Delete crazy_functions

crazy_functions/CodeInterpreter.py

@@ -1,232 +0,0 @@
-from collections.abc import Callable, Iterable, Mapping
-from typing import Any
-from toolbox import CatchException, update_ui, gen_time_str, trimmed_format_exc
-from toolbox import promote_file_to_downloadzone, get_log_folder
-from .crazy_utils import request_gpt_model_in_new_thread_with_ui_alive
-from .crazy_utils import input_clipping, try_install_deps
-from multiprocessing import Process, Pipe
-import os
-import time
-
-templete = """
-```python
-import ...  # Put dependencies here, e.g. import numpy as np
-
-class TerminalFunction(object): # Do not change the name of the class, The name of the class must be `TerminalFunction`
-
-    def run(self, path):    # The name of the function must be `run`, it takes only a positional argument.
-        # rewrite the function you have just written here 
-        ...
-        return generated_file_path
-```
-"""
-
-def inspect_dependency(chatbot, history):
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-    return True
-
-def get_code_block(reply):
-    import re
-    pattern = r"```([\s\S]*?)```" # regex pattern to match code blocks
-    matches = re.findall(pattern, reply) # find all code blocks in text
-    if len(matches) == 1: 
-        return matches[0].strip('python') #  code block
-    for match in matches:
-        if 'class TerminalFunction' in match:
-            return match.strip('python') #  code block
-    raise RuntimeError("GPT is not generating proper code.")
-
-def gpt_interact_multi_step(txt, file_type, llm_kwargs, chatbot, history):
-    # 输入
-    prompt_compose = [
-        f'Your job:\n'
-        f'1. write a single Python function, which takes a path of a `{file_type}` file as the only argument and returns a `string` containing the result of analysis or the path of generated files. \n',
-        f"2. You should write this function to perform following task: " + txt + "\n",
-        f"3. Wrap the output python function with markdown codeblock."
-    ]
-    i_say = "".join(prompt_compose)
-    demo = []
-
-    # 第一步
-    gpt_say = yield from request_gpt_model_in_new_thread_with_ui_alive(
-        inputs=i_say, inputs_show_user=i_say, 
-        llm_kwargs=llm_kwargs, chatbot=chatbot, history=demo, 
-        sys_prompt= r"You are a programmer."
-    )
-    history.extend([i_say, gpt_say])
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面 # 界面更新
-
-    # 第二步
-    prompt_compose = [
-        "If previous stage is successful, rewrite the function you have just written to satisfy following templete: \n",
-        templete
-    ]
-    i_say = "".join(prompt_compose); inputs_show_user = "If previous stage is successful, rewrite the function you have just written to satisfy executable templete. "
-    gpt_say = yield from request_gpt_model_in_new_thread_with_ui_alive(
-        inputs=i_say, inputs_show_user=inputs_show_user, 
-        llm_kwargs=llm_kwargs, chatbot=chatbot, history=history, 
-        sys_prompt= r"You are a programmer."
-    )
-    code_to_return = gpt_say
-    history.extend([i_say, gpt_say])
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面 # 界面更新
-    
-    # # 第三步
-    # i_say = "Please list to packages to install to run the code above. Then show me how to use `try_install_deps` function to install them."
-    # i_say += 'For instance. `try_install_deps(["opencv-python", "scipy", "numpy"])`'
-    # installation_advance = yield from request_gpt_model_in_new_thread_with_ui_alive(
-    #     inputs=i_say, inputs_show_user=inputs_show_user, 
-    #     llm_kwargs=llm_kwargs, chatbot=chatbot, history=history, 
-    #     sys_prompt= r"You are a programmer."
-    # )
-    # # # 第三步  
-    # i_say = "Show me how to use `pip` to install packages to run the code above. "
-    # i_say += 'For instance. `pip install -r opencv-python scipy numpy`'
-    # installation_advance = yield from request_gpt_model_in_new_thread_with_ui_alive(
-    #     inputs=i_say, inputs_show_user=i_say, 
-    #     llm_kwargs=llm_kwargs, chatbot=chatbot, history=history, 
-    #     sys_prompt= r"You are a programmer."
-    # )
-    installation_advance = ""
-    
-    return code_to_return, installation_advance, txt, file_type, llm_kwargs, chatbot, history
-
-def make_module(code):
-    module_file = 'gpt_fn_' + gen_time_str().replace('-','_')
-    with open(f'{get_log_folder()}/{module_file}.py', 'w', encoding='utf8') as f:
-        f.write(code)
-
-    def get_class_name(class_string):
-        import re
-        # Use regex to extract the class name
-        class_name = re.search(r'class (\w+)\(', class_string).group(1)
-        return class_name
-
-    class_name = get_class_name(code)
-    return f"{get_log_folder().replace('/', '.')}.{module_file}->{class_name}"
-
-def init_module_instance(module):
-    import importlib
-    module_, class_ = module.split('->')
-    init_f = getattr(importlib.import_module(module_), class_)
-    return init_f()
-
-def for_immediate_show_off_when_possible(file_type, fp, chatbot):
-    if file_type in ['png', 'jpg']:
-        image_path = os.path.abspath(fp)
-        chatbot.append(['这是一张图片, 展示如下:',  
-            f'本地文件地址: <br/>`{image_path}`<br/>'+
-            f'本地文件预览: <br/><div align="center"><img src="file={image_path}"></div>'
-        ])
-    return chatbot
-
-def subprocess_worker(instance, file_path, return_dict):
-    return_dict['result'] = instance.run(file_path)
-
-def have_any_recent_upload_files(chatbot):
-    _5min = 5 * 60
-    if not chatbot: return False    # chatbot is None
-    most_recent_uploaded = chatbot._cookies.get("most_recent_uploaded", None)
-    if not most_recent_uploaded: return False   # most_recent_uploaded is None
-    if time.time() - most_recent_uploaded["time"] < _5min: return True # most_recent_uploaded is new
-    else: return False  # most_recent_uploaded is too old
-
-def get_recent_file_prompt_support(chatbot):
-    most_recent_uploaded = chatbot._cookies.get("most_recent_uploaded", None)
-    path = most_recent_uploaded['path']
-    return path
-
-@CatchException
-def 虚空终端CodeInterpreter(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-    """
-    txt             输入栏用户输入的文本，例如需要翻译的一段话，再例如一个包含了待处理文件的路径
-    llm_kwargs      gpt模型参数，如温度和top_p等，一般原样传递下去就行
-    plugin_kwargs   插件模型的参数，暂时没有用武之地
-    chatbot         聊天显示框的句柄，用于显示给用户
-    history         聊天历史，前情提要
-    system_prompt   给gpt的静默提醒
-    web_port        当前软件运行的端口号
-    """
-    raise NotImplementedError
-
-    # 清空历史，以免输入溢出
-    history = []; clear_file_downloadzone(chatbot)
-
-    # 基本信息：功能、贡献者
-    chatbot.append([
-        "函数插件功能？",
-        "CodeInterpreter开源版, 此插件处于开发阶段, 建议暂时不要使用, 插件初始化中 ..."
-    ])
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-    if have_any_recent_upload_files(chatbot):
-        file_path = get_recent_file_prompt_support(chatbot)
-    else:
-        chatbot.append(["文件检索", "没有发现任何近期上传的文件。"])
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-    # 读取文件
-    if ("recently_uploaded_files" in plugin_kwargs) and (plugin_kwargs["recently_uploaded_files"] == ""): plugin_kwargs.pop("recently_uploaded_files")
-    recently_uploaded_files = plugin_kwargs.get("recently_uploaded_files", None)
-    file_path = recently_uploaded_files[-1]
-    file_type = file_path.split('.')[-1]
-
-    # 粗心检查
-    if is_the_upload_folder(txt):
-        chatbot.append([
-            "...",
-            f"请在输入框内填写需求，然后再次点击该插件（文件路径 {file_path} 已经被记忆）"
-        ])
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    
-    # 开始干正事
-    for j in range(5):  # 最多重试5次
-        try:
-            code, installation_advance, txt, file_type, llm_kwargs, chatbot, history = \
-                yield from gpt_interact_multi_step(txt, file_type, llm_kwargs, chatbot, history)
-            code = get_code_block(code)
-            res = make_module(code)
-            instance = init_module_instance(res)
-            break
-        except Exception as e:
-            chatbot.append([f"第{j}次代码生成尝试，失败了", f"错误追踪\n```\n{trimmed_format_exc()}\n```\n"])
-            yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-    # 代码生成结束, 开始执行
-    try:
-        import multiprocessing
-        manager = multiprocessing.Manager()
-        return_dict = manager.dict()
-
-        p = multiprocessing.Process(target=subprocess_worker, args=(instance, file_path, return_dict))
-        # only has 10 seconds to run
-        p.start(); p.join(timeout=10)
-        if p.is_alive(): p.terminate(); p.join()
-        p.close()
-        res = return_dict['result']
-        # res = instance.run(file_path)
-    except Exception as e:
-        chatbot.append(["执行失败了", f"错误追踪\n```\n{trimmed_format_exc()}\n```\n"])
-        # chatbot.append(["如果是缺乏依赖，请参考以下建议", installation_advance])
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-
-    # 顺利完成，收尾
-    res = str(res)
-    if os.path.exists(res):
-        chatbot.append(["执行成功了，结果是一个有效文件", "结果：" + res])
-        new_file_path = promote_file_to_downloadzone(res, chatbot=chatbot)
-        chatbot = for_immediate_show_off_when_possible(file_type, new_file_path, chatbot)
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面 # 界面更新
-    else:
-        chatbot.append(["执行成功了，结果是一个字符串", "结果：" + res])
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面 # 界面更新   
-
-"""
-测试：
-    裁剪图像，保留下半部分
-    交换图像的蓝色通道和红色通道
-    将图像转为灰度图像
-    将csv文件转excel表格
-"""

crazy_functions/Langchain知识库.py

@@ -1,106 +0,0 @@
-from toolbox import CatchException, update_ui, ProxyNetworkActivate, update_ui_lastest_msg
-from .crazy_utils import request_gpt_model_in_new_thread_with_ui_alive, get_files_from_everything
-
-
-
-@CatchException
-def 知识库问答(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-    """
-    txt             输入栏用户输入的文本，例如需要翻译的一段话，再例如一个包含了待处理文件的路径
-    llm_kwargs      gpt模型参数, 如温度和top_p等, 一般原样传递下去就行
-    plugin_kwargs   插件模型的参数，暂时没有用武之地
-    chatbot         聊天显示框的句柄，用于显示给用户
-    history         聊天历史，前情提要
-    system_prompt   给gpt的静默提醒
-    web_port        当前软件运行的端口号
-    """
-    history = []    # 清空历史，以免输入溢出
-
-    # < --------------------读取参数--------------- >
-    if ("advanced_arg" in plugin_kwargs) and (plugin_kwargs["advanced_arg"] == ""): plugin_kwargs.pop("advanced_arg")
-    kai_id = plugin_kwargs.get("advanced_arg", 'default')
-
-    chatbot.append((f"向`{kai_id}`知识库中添加文件。", "[Local Message] 从一批文件(txt, md, tex)中读取数据构建知识库, 然后进行问答。"))
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-    # resolve deps
-    try:
-        from zh_langchain import construct_vector_store
-        from langchain.embeddings.huggingface import HuggingFaceEmbeddings
-        from .crazy_utils import knowledge_archive_interface
-    except Exception as e:
-        chatbot.append(["依赖不足", "导入依赖失败。正在尝试自动安装，请查看终端的输出或耐心等待..."])
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        from .crazy_utils import try_install_deps
-        try_install_deps(['zh_langchain==0.2.1', 'pypinyin'], reload_m=['pypinyin', 'zh_langchain'])
-        yield from update_ui_lastest_msg("安装完成，您可以再次重试。", chatbot, history)
-        return
-
-    # < --------------------读取文件--------------- >
-    file_manifest = []
-    spl = ["txt", "doc", "docx", "email", "epub", "html", "json", "md", "msg", "pdf", "ppt", "pptx", "rtf"]
-    for sp in spl:
-        _, file_manifest_tmp, _ = get_files_from_everything(txt, type=f'.{sp}')
-        file_manifest += file_manifest_tmp
-    
-    if len(file_manifest) == 0:
-        chatbot.append(["没有找到任何可读取文件", "当前支持的格式包括: txt, md, docx, pptx, pdf, json等"])
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    
-    # < -------------------预热文本向量化模组--------------- >
-    chatbot.append(['<br/>'.join(file_manifest), "正在预热文本向量化模组, 如果是第一次运行, 将消耗较长时间下载中文向量化模型..."])
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-    print('Checking Text2vec ...')
-    from langchain.embeddings.huggingface import HuggingFaceEmbeddings
-    with ProxyNetworkActivate('Download_LLM'):    # 临时地激活代理网络
-        HuggingFaceEmbeddings(model_name="GanymedeNil/text2vec-large-chinese")
-
-    # < -------------------构建知识库--------------- >
-    chatbot.append(['<br/>'.join(file_manifest), "正在构建知识库..."])
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-    print('Establishing knowledge archive ...')
-    with ProxyNetworkActivate('Download_LLM'):    # 临时地激活代理网络
-        kai = knowledge_archive_interface()
-        kai.feed_archive(file_manifest=file_manifest, id=kai_id)
-    kai_files = kai.get_loaded_file()
-    kai_files = '<br/>'.join(kai_files)
-    # chatbot.append(['知识库构建成功', "正在将知识库存储至cookie中"])
-    # yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-    # chatbot._cookies['langchain_plugin_embedding'] = kai.get_current_archive_id()
-    # chatbot._cookies['lock_plugin'] = 'crazy_functions.Langchain知识库->读取知识库作答'
-    # chatbot.append(['完成', "“根据知识库作答”函数插件已经接管问答系统, 提问吧! 但注意, 您接下来不能再使用其他插件了，刷新页面即可以退出知识库问答模式。"])
-    chatbot.append(['构建完成', f"当前知识库内的有效文件：\n\n---\n\n{kai_files}\n\n---\n\n请切换至“知识库问答”插件进行知识库访问, 或者使用此插件继续上传更多文件。"])
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面 # 由于请求gpt需要一段时间，我们先及时地做一次界面更新
-
-@CatchException
-def 读取知识库作答(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port=-1):
-    # resolve deps
-    try:
-        from zh_langchain import construct_vector_store
-        from langchain.embeddings.huggingface import HuggingFaceEmbeddings
-        from .crazy_utils import knowledge_archive_interface
-    except Exception as e:
-        chatbot.append(["依赖不足", "导入依赖失败。正在尝试自动安装，请查看终端的输出或耐心等待..."])
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        from .crazy_utils import try_install_deps
-        try_install_deps(['zh_langchain==0.2.1', 'pypinyin'], reload_m=['pypinyin', 'zh_langchain'])
-        yield from update_ui_lastest_msg("安装完成，您可以再次重试。", chatbot, history)
-        return
-
-    # < -------------------  --------------- >
-    kai = knowledge_archive_interface()
-
-    if ("advanced_arg" in plugin_kwargs) and (plugin_kwargs["advanced_arg"] == ""): plugin_kwargs.pop("advanced_arg")
-    kai_id = plugin_kwargs.get("advanced_arg", 'default')
-    resp, prompt = kai.answer_with_archive_by_id(txt, kai_id)
-
-    chatbot.append((txt, f'[知识库 {kai_id}] ' + prompt))
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面 # 由于请求gpt需要一段时间，我们先及时地做一次界面更新
-    gpt_say = yield from request_gpt_model_in_new_thread_with_ui_alive(
-        inputs=prompt, inputs_show_user=txt, 
-        llm_kwargs=llm_kwargs, chatbot=chatbot, history=[], 
-        sys_prompt=system_prompt
-    )
-    history.extend((prompt, gpt_say))
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面 # 由于请求gpt需要一段时间，我们先及时地做一次界面更新

crazy_functions/Latex全文润色.py

@@ -1,245 +0,0 @@
-from toolbox import update_ui, trimmed_format_exc, promote_file_to_downloadzone, get_log_folder
-from toolbox import CatchException, report_exception, write_history_to_file, zip_folder
-
-
-class PaperFileGroup():
-    def __init__(self):
-        self.file_paths = []
-        self.file_contents = []
-        self.sp_file_contents = []
-        self.sp_file_index = []
-        self.sp_file_tag = []
-
-        # count_token
-        from request_llms.bridge_all import model_info
-        enc = model_info["gpt-3.5-turbo"]['tokenizer']
-        def get_token_num(txt): return len(enc.encode(txt, disallowed_special=()))
-        self.get_token_num = get_token_num
-
-    def run_file_split(self, max_token_limit=1900):
-        """
-        将长文本分离开来
-        """
-        for index, file_content in enumerate(self.file_contents):
-            if self.get_token_num(file_content) < max_token_limit:
-                self.sp_file_contents.append(file_content)
-                self.sp_file_index.append(index)
-                self.sp_file_tag.append(self.file_paths[index])
-            else:
-                from crazy_functions.pdf_fns.breakdown_txt import breakdown_text_to_satisfy_token_limit
-                segments = breakdown_text_to_satisfy_token_limit(file_content, max_token_limit)
-                for j, segment in enumerate(segments):
-                    self.sp_file_contents.append(segment)
-                    self.sp_file_index.append(index)
-                    self.sp_file_tag.append(self.file_paths[index] + f".part-{j}.tex")
-
-        print('Segmentation: done')
-    def merge_result(self):
-        self.file_result = ["" for _ in range(len(self.file_paths))]
-        for r, k in zip(self.sp_file_result, self.sp_file_index):
-            self.file_result[k] += r
-
-    def write_result(self):
-        manifest = []
-        for path, res in zip(self.file_paths, self.file_result):
-            with open(path + '.polish.tex', 'w', encoding='utf8') as f:
-                manifest.append(path + '.polish.tex')
-                f.write(res)
-        return manifest
-    
-    def zip_result(self):
-        import os, time
-        folder = os.path.dirname(self.file_paths[0])
-        t = time.strftime("%Y-%m-%d-%H-%M-%S", time.localtime())
-        zip_folder(folder, get_log_folder(), f'{t}-polished.zip')
-
-
-def 多文件润色(file_manifest, project_folder, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, language='en', mode='polish'):
-    import time, os, re
-    from .crazy_utils import request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency
-
-
-    #  <-------- 读取Latex文件，删除其中的所有注释 ----------> 
-    pfg = PaperFileGroup()
-
-    for index, fp in enumerate(file_manifest):
-        with open(fp, 'r', encoding='utf-8', errors='replace') as f:
-            file_content = f.read()
-            # 定义注释的正则表达式
-            comment_pattern = r'(?<!\\)%.*'
-            # 使用正则表达式查找注释，并替换为空字符串
-            clean_tex_content = re.sub(comment_pattern, '', file_content)
-            # 记录删除注释后的文本
-            pfg.file_paths.append(fp)
-            pfg.file_contents.append(clean_tex_content)
-
-    #  <-------- 拆分过长的latex文件 ----------> 
-    pfg.run_file_split(max_token_limit=1024)
-    n_split = len(pfg.sp_file_contents)
-
-
-    #  <-------- 多线程润色开始 ----------> 
-    if language == 'en':
-        if mode == 'polish':
-            inputs_array = ["Below is a section from an academic paper, polish this section to meet the academic standard, " + 
-                            "improve the grammar, clarity and overall readability, do not modify any latex command such as \section, \cite and equations:" + 
-                            f"\n\n{frag}" for frag in pfg.sp_file_contents]
-        else:
-            inputs_array = [r"Below is a section from an academic paper, proofread this section." + 
-                            r"Do not modify any latex command such as \section, \cite, \begin, \item and equations. " + 
-                            r"Answer me only with the revised text:" + 
-                        f"\n\n{frag}" for frag in pfg.sp_file_contents]
-        inputs_show_user_array = [f"Polish {f}" for f in pfg.sp_file_tag]
-        sys_prompt_array = ["You are a professional academic paper writer." for _ in range(n_split)]
-    elif language == 'zh':
-        if mode == 'polish':
-            inputs_array = [f"以下是一篇学术论文中的一段内容，请将此部分润色以满足学术标准，提高语法、清晰度和整体可读性，不要修改任何LaTeX命令，例如\section，\cite和方程式：" + 
-                            f"\n\n{frag}" for frag in pfg.sp_file_contents]
-        else:
-            inputs_array = [f"以下是一篇学术论文中的一段内容，请对这部分内容进行语法矫正。不要修改任何LaTeX命令，例如\section，\cite和方程式：" + 
-                            f"\n\n{frag}" for frag in pfg.sp_file_contents] 
-        inputs_show_user_array = [f"润色 {f}" for f in pfg.sp_file_tag]
-        sys_prompt_array=["你是一位专业的中文学术论文作家。" for _ in range(n_split)]
-
-
-    gpt_response_collection = yield from request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency(
-        inputs_array=inputs_array,
-        inputs_show_user_array=inputs_show_user_array,
-        llm_kwargs=llm_kwargs,
-        chatbot=chatbot,
-        history_array=[[""] for _ in range(n_split)],
-        sys_prompt_array=sys_prompt_array,
-        # max_workers=5,  # 并行任务数量限制，最多同时执行5个，其他的排队等待
-        scroller_max_len = 80
-    )
-
-    #  <-------- 文本碎片重组为完整的tex文件，整理结果为压缩包 ----------> 
-    try:
-        pfg.sp_file_result = []
-        for i_say, gpt_say in zip(gpt_response_collection[0::2], gpt_response_collection[1::2]):
-            pfg.sp_file_result.append(gpt_say)
-        pfg.merge_result()
-        pfg.write_result()
-        pfg.zip_result()
-    except:
-        print(trimmed_format_exc())
-
-    #  <-------- 整理结果，退出 ----------> 
-    create_report_file_name = time.strftime("%Y-%m-%d-%H-%M-%S", time.localtime()) + f"-chatgpt.polish.md"
-    res = write_history_to_file(gpt_response_collection, file_basename=create_report_file_name)
-    promote_file_to_downloadzone(res, chatbot=chatbot)
-
-    history = gpt_response_collection
-    chatbot.append((f"{fp}完成了吗？", res))
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-
-@CatchException
-def Latex英文润色(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-    # 基本信息：功能、贡献者
-    chatbot.append([
-        "函数插件功能？",
-        "对整个Latex项目进行润色。函数插件贡献者: Binary-Husky。（注意，此插件不调用Latex，如果有Latex环境，请使用“Latex英文纠错+高亮”插件）"])
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-    # 尝试导入依赖，如果缺少依赖，则给出安装建议
-    try:
-        import tiktoken
-    except:
-        report_exception(chatbot, history,
-                         a=f"解析项目: {txt}",
-                         b=f"导入软件依赖失败。使用该模块需要额外依赖，安装方法```pip install --upgrade tiktoken```。")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    history = []    # 清空历史，以免输入溢出
-    import glob, os
-    if os.path.exists(txt):
-        project_folder = txt
-    else:
-        if txt == "": txt = '空空如也的输入栏'
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到本地项目或无权访问: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    file_manifest = [f for f in glob.glob(f'{project_folder}/**/*.tex', recursive=True)]
-    if len(file_manifest) == 0:
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到任何.tex文件: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    yield from 多文件润色(file_manifest, project_folder, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, language='en')
-
-
-
-
-
-
-@CatchException
-def Latex中文润色(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-    # 基本信息：功能、贡献者
-    chatbot.append([
-        "函数插件功能？",
-        "对整个Latex项目进行润色。函数插件贡献者: Binary-Husky"])
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-    # 尝试导入依赖，如果缺少依赖，则给出安装建议
-    try:
-        import tiktoken
-    except:
-        report_exception(chatbot, history,
-                         a=f"解析项目: {txt}",
-                         b=f"导入软件依赖失败。使用该模块需要额外依赖，安装方法```pip install --upgrade tiktoken```。")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    history = []    # 清空历史，以免输入溢出
-    import glob, os
-    if os.path.exists(txt):
-        project_folder = txt
-    else:
-        if txt == "": txt = '空空如也的输入栏'
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到本地项目或无权访问: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    file_manifest = [f for f in glob.glob(f'{project_folder}/**/*.tex', recursive=True)]
-    if len(file_manifest) == 0:
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到任何.tex文件: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    yield from 多文件润色(file_manifest, project_folder, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, language='zh')
-
-
-
-
-@CatchException
-def Latex英文纠错(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-    # 基本信息：功能、贡献者
-    chatbot.append([
-        "函数插件功能？",
-        "对整个Latex项目进行纠错。函数插件贡献者: Binary-Husky"])
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-    # 尝试导入依赖，如果缺少依赖，则给出安装建议
-    try:
-        import tiktoken
-    except:
-        report_exception(chatbot, history,
-                         a=f"解析项目: {txt}",
-                         b=f"导入软件依赖失败。使用该模块需要额外依赖，安装方法```pip install --upgrade tiktoken```。")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    history = []    # 清空历史，以免输入溢出
-    import glob, os
-    if os.path.exists(txt):
-        project_folder = txt
-    else:
-        if txt == "": txt = '空空如也的输入栏'
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到本地项目或无权访问: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    file_manifest = [f for f in glob.glob(f'{project_folder}/**/*.tex', recursive=True)]
-    if len(file_manifest) == 0:
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到任何.tex文件: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    yield from 多文件润色(file_manifest, project_folder, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, language='en', mode='proofread')
-
-
-

crazy_functions/Latex全文翻译.py

@@ -1,176 +0,0 @@
-from toolbox import update_ui, promote_file_to_downloadzone
-from toolbox import CatchException, report_exception, write_history_to_file
-fast_debug = False
-
-class PaperFileGroup():
-    def __init__(self):
-        self.file_paths = []
-        self.file_contents = []
-        self.sp_file_contents = []
-        self.sp_file_index = []
-        self.sp_file_tag = []
-
-        # count_token
-        from request_llms.bridge_all import model_info
-        enc = model_info["gpt-3.5-turbo"]['tokenizer']
-        def get_token_num(txt): return len(enc.encode(txt, disallowed_special=()))
-        self.get_token_num = get_token_num
-
-    def run_file_split(self, max_token_limit=1900):
-        """
-        将长文本分离开来
-        """
-        for index, file_content in enumerate(self.file_contents):
-            if self.get_token_num(file_content) < max_token_limit:
-                self.sp_file_contents.append(file_content)
-                self.sp_file_index.append(index)
-                self.sp_file_tag.append(self.file_paths[index])
-            else:
-                from crazy_functions.pdf_fns.breakdown_txt import breakdown_text_to_satisfy_token_limit
-                segments = breakdown_text_to_satisfy_token_limit(file_content, max_token_limit)
-                for j, segment in enumerate(segments):
-                    self.sp_file_contents.append(segment)
-                    self.sp_file_index.append(index)
-                    self.sp_file_tag.append(self.file_paths[index] + f".part-{j}.tex")
-
-        print('Segmentation: done')
-
-def 多文件翻译(file_manifest, project_folder, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, language='en'):
-    import time, os, re
-    from .crazy_utils import request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency
-
-    #  <-------- 读取Latex文件，删除其中的所有注释 ----------> 
-    pfg = PaperFileGroup()
-
-    for index, fp in enumerate(file_manifest):
-        with open(fp, 'r', encoding='utf-8', errors='replace') as f:
-            file_content = f.read()
-            # 定义注释的正则表达式
-            comment_pattern = r'(?<!\\)%.*'
-            # 使用正则表达式查找注释，并替换为空字符串
-            clean_tex_content = re.sub(comment_pattern, '', file_content)
-            # 记录删除注释后的文本
-            pfg.file_paths.append(fp)
-            pfg.file_contents.append(clean_tex_content)
-
-    #  <-------- 拆分过长的latex文件 ----------> 
-    pfg.run_file_split(max_token_limit=1024)
-    n_split = len(pfg.sp_file_contents)
-
-    #  <-------- 抽取摘要 ----------> 
-    # if language == 'en':
-    #     abs_extract_inputs = f"Please write an abstract for this paper"
-
-    # # 单线，获取文章meta信息
-    # paper_meta_info = yield from request_gpt_model_in_new_thread_with_ui_alive(
-    #     inputs=abs_extract_inputs,
-    #     inputs_show_user=f"正在抽取摘要信息。",
-    #     llm_kwargs=llm_kwargs,
-    #     chatbot=chatbot, history=[],
-    #     sys_prompt="Your job is to collect information from materials。",
-    # )
-
-    #  <-------- 多线程润色开始 ----------> 
-    if language == 'en->zh':
-        inputs_array = ["Below is a section from an English academic paper, translate it into Chinese, do not modify any latex command such as \section, \cite and equations:" + 
-                        f"\n\n{frag}" for frag in pfg.sp_file_contents]
-        inputs_show_user_array = [f"翻译 {f}" for f in pfg.sp_file_tag]
-        sys_prompt_array = ["You are a professional academic paper translator." for _ in range(n_split)]
-    elif language == 'zh->en':
-        inputs_array = [f"Below is a section from a Chinese academic paper, translate it into English, do not modify any latex command such as \section, \cite and equations:" + 
-                        f"\n\n{frag}" for frag in pfg.sp_file_contents]
-        inputs_show_user_array = [f"翻译 {f}" for f in pfg.sp_file_tag]
-        sys_prompt_array = ["You are a professional academic paper translator." for _ in range(n_split)]
-
-    gpt_response_collection = yield from request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency(
-        inputs_array=inputs_array,
-        inputs_show_user_array=inputs_show_user_array,
-        llm_kwargs=llm_kwargs,
-        chatbot=chatbot,
-        history_array=[[""] for _ in range(n_split)],
-        sys_prompt_array=sys_prompt_array,
-        # max_workers=5,  # OpenAI所允许的最大并行过载
-        scroller_max_len = 80
-    )
-
-    #  <-------- 整理结果，退出 ----------> 
-    create_report_file_name = time.strftime("%Y-%m-%d-%H-%M-%S", time.localtime()) + f"-chatgpt.polish.md"
-    res = write_history_to_file(gpt_response_collection, create_report_file_name)
-    promote_file_to_downloadzone(res, chatbot=chatbot)
-    history = gpt_response_collection
-    chatbot.append((f"{fp}完成了吗？", res))
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-
-
-
-
-@CatchException
-def Latex英译中(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-    # 基本信息：功能、贡献者
-    chatbot.append([
-        "函数插件功能？",
-        "对整个Latex项目进行翻译。函数插件贡献者: Binary-Husky"])
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-    # 尝试导入依赖，如果缺少依赖，则给出安装建议
-    try:
-        import tiktoken
-    except:
-        report_exception(chatbot, history,
-                         a=f"解析项目: {txt}",
-                         b=f"导入软件依赖失败。使用该模块需要额外依赖，安装方法```pip install --upgrade tiktoken```。")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    history = []    # 清空历史，以免输入溢出
-    import glob, os
-    if os.path.exists(txt):
-        project_folder = txt
-    else:
-        if txt == "": txt = '空空如也的输入栏'
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到本地项目或无权访问: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    file_manifest = [f for f in glob.glob(f'{project_folder}/**/*.tex', recursive=True)]
-    if len(file_manifest) == 0:
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到任何.tex文件: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    yield from 多文件翻译(file_manifest, project_folder, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, language='en->zh')
-
-
-
-
-
-@CatchException
-def Latex中译英(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-    # 基本信息：功能、贡献者
-    chatbot.append([
-        "函数插件功能？",
-        "对整个Latex项目进行翻译。函数插件贡献者: Binary-Husky"])
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-    # 尝试导入依赖，如果缺少依赖，则给出安装建议
-    try:
-        import tiktoken
-    except:
-        report_exception(chatbot, history,
-                         a=f"解析项目: {txt}",
-                         b=f"导入软件依赖失败。使用该模块需要额外依赖，安装方法```pip install --upgrade tiktoken```。")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    history = []    # 清空历史，以免输入溢出
-    import glob, os
-    if os.path.exists(txt):
-        project_folder = txt
-    else:
-        if txt == "": txt = '空空如也的输入栏'
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到本地项目或无权访问: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    file_manifest = [f for f in glob.glob(f'{project_folder}/**/*.tex', recursive=True)]
-    if len(file_manifest) == 0:
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到任何.tex文件: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    yield from 多文件翻译(file_manifest, project_folder, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, language='zh->en')

crazy_functions/Latex输出PDF结果.py

@@ -1,306 +0,0 @@
-from toolbox import update_ui, trimmed_format_exc, get_conf, get_log_folder, promote_file_to_downloadzone
-from toolbox import CatchException, report_exception, update_ui_lastest_msg, zip_result, gen_time_str
-from functools import partial
-import glob, os, requests, time
-pj = os.path.join
-ARXIV_CACHE_DIR = os.path.expanduser(f"~/arxiv_cache/")
-
-# =================================== 工具函数 ===============================================
-# 专业词汇声明  = 'If the term "agent" is used in this section, it should be translated to "智能体". '
-def switch_prompt(pfg, mode, more_requirement):
-    """
-    Generate prompts and system prompts based on the mode for proofreading or translating.
-    Args:
-    - pfg: Proofreader or Translator instance.
-    - mode: A string specifying the mode, either 'proofread' or 'translate_zh'.
-
-    Returns:
-    - inputs_array: A list of strings containing prompts for users to respond to.
-    - sys_prompt_array: A list of strings containing prompts for system prompts.
-    """
-    n_split = len(pfg.sp_file_contents)
-    if mode == 'proofread_en':
-        inputs_array = [r"Below is a section from an academic paper, proofread this section." + 
-                        r"Do not modify any latex command such as \section, \cite, \begin, \item and equations. " + more_requirement +
-                        r"Answer me only with the revised text:" + 
-                        f"\n\n{frag}" for frag in pfg.sp_file_contents]
-        sys_prompt_array = ["You are a professional academic paper writer." for _ in range(n_split)]
-    elif mode == 'translate_zh':
-        inputs_array = [r"Below is a section from an English academic paper, translate it into Chinese. " + more_requirement + 
-                        r"Do not modify any latex command such as \section, \cite, \begin, \item and equations. " + 
-                        r"Answer me only with the translated text:" + 
-                        f"\n\n{frag}" for frag in pfg.sp_file_contents]
-        sys_prompt_array = ["You are a professional translator." for _ in range(n_split)]
-    else:
-        assert False, "未知指令"
-    return inputs_array, sys_prompt_array
-
-def desend_to_extracted_folder_if_exist(project_folder):
-    """ 
-    Descend into the extracted folder if it exists, otherwise return the original folder.
-
-    Args:
-    - project_folder: A string specifying the folder path.
-
-    Returns:
-    - A string specifying the path to the extracted folder, or the original folder if there is no extracted folder.
-    """
-    maybe_dir = [f for f in glob.glob(f'{project_folder}/*') if os.path.isdir(f)]
-    if len(maybe_dir) == 0: return project_folder
-    if maybe_dir[0].endswith('.extract'): return maybe_dir[0]
-    return project_folder
-
-def move_project(project_folder, arxiv_id=None):
-    """ 
-    Create a new work folder and copy the project folder to it.
-
-    Args:
-    - project_folder: A string specifying the folder path of the project.
-
-    Returns:
-    - A string specifying the path to the new work folder.
-    """
-    import shutil, time
-    time.sleep(2)   # avoid time string conflict
-    if arxiv_id is not None:
-        new_workfolder = pj(ARXIV_CACHE_DIR, arxiv_id, 'workfolder')
-    else:
-        new_workfolder = f'{get_log_folder()}/{gen_time_str()}'
-    try:
-        shutil.rmtree(new_workfolder)
-    except:
-        pass
-
-    # align subfolder if there is a folder wrapper
-    items = glob.glob(pj(project_folder,'*'))
-    items = [item for item in items if os.path.basename(item)!='__MACOSX']
-    if len(glob.glob(pj(project_folder,'*.tex'))) == 0 and len(items) == 1:
-        if os.path.isdir(items[0]): project_folder = items[0]
-
-    shutil.copytree(src=project_folder, dst=new_workfolder)
-    return new_workfolder
-
-def arxiv_download(chatbot, history, txt, allow_cache=True):
-    def check_cached_translation_pdf(arxiv_id):
-        translation_dir = pj(ARXIV_CACHE_DIR, arxiv_id, 'translation')
-        if not os.path.exists(translation_dir):
-            os.makedirs(translation_dir)
-        target_file = pj(translation_dir, 'translate_zh.pdf')
-        if os.path.exists(target_file):
-            promote_file_to_downloadzone(target_file, rename_file=None, chatbot=chatbot)
-            target_file_compare = pj(translation_dir, 'comparison.pdf')
-            if os.path.exists(target_file_compare):
-                promote_file_to_downloadzone(target_file_compare, rename_file=None, chatbot=chatbot)
-            return target_file
-        return False
-    def is_float(s):
-        try:
-            float(s)
-            return True
-        except ValueError:
-            return False
-    if ('.' in txt) and ('/' not in txt) and is_float(txt): # is arxiv ID
-        txt = 'https://arxiv.org/abs/' + txt.strip()
-    if ('.' in txt) and ('/' not in txt) and is_float(txt[:10]): # is arxiv ID
-        txt = 'https://arxiv.org/abs/' + txt[:10]
-    if not txt.startswith('https://arxiv.org'): 
-        return txt, None
-    
-    # <-------------- inspect format ------------->
-    chatbot.append([f"检测到arxiv文档连接", '尝试下载 ...']) 
-    yield from update_ui(chatbot=chatbot, history=history)
-    time.sleep(1) # 刷新界面
-
-    url_ = txt   # https://arxiv.org/abs/1707.06690
-    if not txt.startswith('https://arxiv.org/abs/'): 
-        msg = f"解析arxiv网址失败, 期望格式例如: https://arxiv.org/abs/1707.06690。实际得到格式: {url_}。"
-        yield from update_ui_lastest_msg(msg, chatbot=chatbot, history=history) # 刷新界面
-        return msg, None
-    # <-------------- set format ------------->
-    arxiv_id = url_.split('/abs/')[-1]
-    if 'v' in arxiv_id: arxiv_id = arxiv_id[:10]
-    cached_translation_pdf = check_cached_translation_pdf(arxiv_id)
-    if cached_translation_pdf and allow_cache: return cached_translation_pdf, arxiv_id
-
-    url_tar = url_.replace('/abs/', '/e-print/')
-    translation_dir = pj(ARXIV_CACHE_DIR, arxiv_id, 'e-print')
-    extract_dst = pj(ARXIV_CACHE_DIR, arxiv_id, 'extract')
-    os.makedirs(translation_dir, exist_ok=True)
-    
-    # <-------------- download arxiv source file ------------->
-    dst = pj(translation_dir, arxiv_id+'.tar')
-    if os.path.exists(dst):
-        yield from update_ui_lastest_msg("调用缓存", chatbot=chatbot, history=history)  # 刷新界面
-    else:
-        yield from update_ui_lastest_msg("开始下载", chatbot=chatbot, history=history)  # 刷新界面
-        proxies = get_conf('proxies')
-        r = requests.get(url_tar, proxies=proxies)
-        with open(dst, 'wb+') as f:
-            f.write(r.content)
-    # <-------------- extract file ------------->
-    yield from update_ui_lastest_msg("下载完成", chatbot=chatbot, history=history)  # 刷新界面
-    from toolbox import extract_archive
-    extract_archive(file_path=dst, dest_dir=extract_dst)
-    return extract_dst, arxiv_id
-# ========================================= 插件主程序1 =====================================================    
-
-
-@CatchException
-def Latex英文纠错加PDF对比(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-    # <-------------- information about this plugin ------------->
-    chatbot.append([ "函数插件功能？",
-        "对整个Latex项目进行纠错, 用latex编译为PDF对修正处做高亮。函数插件贡献者: Binary-Husky。注意事项: 目前仅支持GPT3.5/GPT4，其他模型转化效果未知。目前对机器学习类文献转化效果最好，其他类型文献转化效果未知。仅在Windows系统进行了测试，其他操作系统表现未知。"])
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-    
-    # <-------------- more requirements ------------->
-    if ("advanced_arg" in plugin_kwargs) and (plugin_kwargs["advanced_arg"] == ""): plugin_kwargs.pop("advanced_arg")
-    more_req = plugin_kwargs.get("advanced_arg", "")
-    _switch_prompt_ = partial(switch_prompt, more_requirement=more_req)
-
-    # <-------------- check deps ------------->
-    try:
-        import glob, os, time, subprocess
-        subprocess.Popen(['pdflatex', '-version'])
-        from .latex_fns.latex_actions import Latex精细分解与转化, 编译Latex
-    except Exception as e:
-        chatbot.append([ f"解析项目: {txt}",
-            f"尝试执行Latex指令失败。Latex没有安装, 或者不在环境变量PATH中。安装方法https://tug.org/texlive/。报错信息\n\n```\n\n{trimmed_format_exc()}\n\n```\n\n"])
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    
-
-    # <-------------- clear history and read input ------------->
-    history = []
-    if os.path.exists(txt):
-        project_folder = txt
-    else:
-        if txt == "": txt = '空空如也的输入栏'
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到本地项目或无权访问: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    file_manifest = [f for f in glob.glob(f'{project_folder}/**/*.tex', recursive=True)]
-    if len(file_manifest) == 0:
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到任何.tex文件: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    
-
-    # <-------------- if is a zip/tar file ------------->
-    project_folder = desend_to_extracted_folder_if_exist(project_folder)
-
-
-    # <-------------- move latex project away from temp folder ------------->
-    project_folder = move_project(project_folder, arxiv_id=None)
-
-
-    # <-------------- if merge_translate_zh is already generated, skip gpt req ------------->
-    if not os.path.exists(project_folder + '/merge_proofread_en.tex'):
-        yield from Latex精细分解与转化(file_manifest, project_folder, llm_kwargs, plugin_kwargs, 
-                                chatbot, history, system_prompt, mode='proofread_en', switch_prompt=_switch_prompt_)
-
-
-    # <-------------- compile PDF ------------->
-    success = yield from 编译Latex(chatbot, history, main_file_original='merge', main_file_modified='merge_proofread_en', 
-                             work_folder_original=project_folder, work_folder_modified=project_folder, work_folder=project_folder)
-    
-
-    # <-------------- zip PDF ------------->
-    zip_res = zip_result(project_folder)
-    if success:
-        chatbot.append((f"成功啦", '请查收结果（压缩包）...'))
-        yield from update_ui(chatbot=chatbot, history=history); time.sleep(1) # 刷新界面
-        promote_file_to_downloadzone(file=zip_res, chatbot=chatbot)
-    else:
-        chatbot.append((f"失败了", '虽然PDF生成失败了, 但请查收结果（压缩包）, 内含已经翻译的Tex文档, 也是可读的, 您可以到Github Issue区, 用该压缩包+对话历史存档进行反馈 ...'))
-        yield from update_ui(chatbot=chatbot, history=history); time.sleep(1) # 刷新界面
-        promote_file_to_downloadzone(file=zip_res, chatbot=chatbot)
-
-    # <-------------- we are done ------------->
-    return success
-
-# ========================================= 插件主程序2 =====================================================    
-
-@CatchException
-def Latex翻译中文并重新编译PDF(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-    # <-------------- information about this plugin ------------->
-    chatbot.append([
-        "函数插件功能？",
-        "对整个Latex项目进行翻译, 生成中文PDF。函数插件贡献者: Binary-Husky。注意事项: 此插件Windows支持最佳，Linux下必须使用Docker安装，详见项目主README.md。目前仅支持GPT3.5/GPT4，其他模型转化效果未知。目前对机器学习类文献转化效果最好，其他类型文献转化效果未知。"])
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-    # <-------------- more requirements ------------->
-    if ("advanced_arg" in plugin_kwargs) and (plugin_kwargs["advanced_arg"] == ""): plugin_kwargs.pop("advanced_arg")
-    more_req = plugin_kwargs.get("advanced_arg", "")
-    no_cache = more_req.startswith("--no-cache")
-    if no_cache: more_req.lstrip("--no-cache")
-    allow_cache = not no_cache
-    _switch_prompt_ = partial(switch_prompt, more_requirement=more_req)
-
-    # <-------------- check deps ------------->
-    try:
-        import glob, os, time, subprocess
-        subprocess.Popen(['pdflatex', '-version'])
-        from .latex_fns.latex_actions import Latex精细分解与转化, 编译Latex
-    except Exception as e:
-        chatbot.append([ f"解析项目: {txt}",
-            f"尝试执行Latex指令失败。Latex没有安装, 或者不在环境变量PATH中。安装方法https://tug.org/texlive/。报错信息\n\n```\n\n{trimmed_format_exc()}\n\n```\n\n"])
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    
-
-    # <-------------- clear history and read input ------------->
-    history = []
-    txt, arxiv_id = yield from arxiv_download(chatbot, history, txt, allow_cache)
-    if txt.endswith('.pdf'):
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"发现已经存在翻译好的PDF文档")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    
-
-    if os.path.exists(txt):
-        project_folder = txt
-    else:
-        if txt == "": txt = '空空如也的输入栏'
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到本地项目或无法处理: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    
-    file_manifest = [f for f in glob.glob(f'{project_folder}/**/*.tex', recursive=True)]
-    if len(file_manifest) == 0:
-        report_exception(chatbot, history, a = f"解析项目: {txt}", b = f"找不到任何.tex文件: {txt}")
-        yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-        return
-    
-
-    # <-------------- if is a zip/tar file ------------->
-    project_folder = desend_to_extracted_folder_if_exist(project_folder)
-
-
-    # <-------------- move latex project away from temp folder ------------->
-    project_folder = move_project(project_folder, arxiv_id)
-
-
-    # <-------------- if merge_translate_zh is already generated, skip gpt req ------------->
-    if not os.path.exists(project_folder + '/merge_translate_zh.tex'):
-        yield from Latex精细分解与转化(file_manifest, project_folder, llm_kwargs, plugin_kwargs, 
-                                chatbot, history, system_prompt, mode='translate_zh', switch_prompt=_switch_prompt_)
-
-
-    # <-------------- compile PDF ------------->
-    success = yield from 编译Latex(chatbot, history, main_file_original='merge', main_file_modified='merge_translate_zh', mode='translate_zh', 
-                             work_folder_original=project_folder, work_folder_modified=project_folder, work_folder=project_folder)
-
-    # <-------------- zip PDF ------------->
-    zip_res = zip_result(project_folder)
-    if success:
-        chatbot.append((f"成功啦", '请查收结果（压缩包）...'))
-        yield from update_ui(chatbot=chatbot, history=history); time.sleep(1) # 刷新界面
-        promote_file_to_downloadzone(file=zip_res, chatbot=chatbot)
-    else:
-        chatbot.append((f"失败了", '虽然PDF生成失败了, 但请查收结果（压缩包）, 内含已经翻译的Tex文档, 您可以到Github Issue区, 用该压缩包进行反馈。如系统是Linux，请检查系统字体（见Github wiki） ...'))
-        yield from update_ui(chatbot=chatbot, history=history); time.sleep(1) # 刷新界面
-        promote_file_to_downloadzone(file=zip_res, chatbot=chatbot)
-
-
-    # <-------------- we are done ------------->
-    return success

crazy_functions/agent_fns/auto_agent.py

@@ -1,23 +0,0 @@
-from toolbox import CatchException, update_ui, gen_time_str, trimmed_format_exc, ProxyNetworkActivate
-from toolbox import report_exception, get_log_folder, update_ui_lastest_msg, Singleton
-from crazy_functions.agent_fns.pipe import PluginMultiprocessManager, PipeCom
-from crazy_functions.agent_fns.general import AutoGenGeneral
-
-
-
-class AutoGenMath(AutoGenGeneral):
-
-    def define_agents(self):
-        from autogen import AssistantAgent, UserProxyAgent
-        return [
-            {
-                "name": "assistant",            # name of the agent.
-                "cls":  AssistantAgent,         # class of the agent.
-            },
-            {
-                "name": "user_proxy",           # name of the agent.
-                "cls":  UserProxyAgent,         # class of the agent.
-                "human_input_mode": "ALWAYS",   # always ask for human input.
-                "llm_config": False,            # disables llm-based auto reply.
-            },
-        ]

crazy_functions/agent_fns/echo_agent.py

@@ -1,19 +0,0 @@
-from crazy_functions.agent_fns.pipe import PluginMultiprocessManager, PipeCom
-
-class EchoDemo(PluginMultiprocessManager):
-    def subprocess_worker(self, child_conn):
-        # ⭐⭐ 子进程
-        self.child_conn = child_conn
-        while True:
-            msg = self.child_conn.recv() # PipeCom
-            if msg.cmd == "user_input":
-                # wait futher user input
-                self.child_conn.send(PipeCom("show", msg.content))
-                wait_success = self.subprocess_worker_wait_user_feedback(wait_msg="我准备好处理下一个问题了.")
-                if not wait_success:
-                    # wait timeout, terminate this subprocess_worker
-                    break
-            elif msg.cmd == "terminate":
-                self.child_conn.send(PipeCom("done", ""))
-                break
-        print('[debug] subprocess_worker terminated')

crazy_functions/agent_fns/general.py

@@ -1,134 +0,0 @@
-from toolbox import trimmed_format_exc, get_conf, ProxyNetworkActivate
-from crazy_functions.agent_fns.pipe import PluginMultiprocessManager, PipeCom
-from request_llms.bridge_all import predict_no_ui_long_connection
-import time
-
-def gpt_academic_generate_oai_reply(
-    self,
-    messages,
-    sender,
-    config,
-):
-    llm_config = self.llm_config if config is None else config
-    if llm_config is False:
-        return False, None
-    if messages is None:
-        messages = self._oai_messages[sender]
-
-    inputs = messages[-1]['content']
-    history = []
-    for message in messages[:-1]:
-        history.append(message['content'])
-    context=messages[-1].pop("context", None)
-    assert context is None, "预留参数 context 未实现"
-
-    reply = predict_no_ui_long_connection(
-        inputs=inputs,
-        llm_kwargs=llm_config,
-        history=history,
-        sys_prompt=self._oai_system_message[0]['content'],
-        console_slience=True
-    )
-    assumed_done = reply.endswith('\nTERMINATE')
-    return True, reply
-
-class AutoGenGeneral(PluginMultiprocessManager):
-    def gpt_academic_print_override(self, user_proxy, message, sender):
-        # ⭐⭐ run in subprocess
-        self.child_conn.send(PipeCom("show", sender.name + "\n\n---\n\n" + message["content"]))
-
-    def gpt_academic_get_human_input(self, user_proxy, message):
-        # ⭐⭐ run in subprocess
-        patience = 300
-        begin_waiting_time = time.time()
-        self.child_conn.send(PipeCom("interact", message))
-        while True:
-            time.sleep(0.5)
-            if self.child_conn.poll():
-                wait_success = True
-                break
-            if time.time() - begin_waiting_time > patience:
-                self.child_conn.send(PipeCom("done", ""))
-                wait_success = False
-                break
-        if wait_success:
-            return self.child_conn.recv().content
-        else:
-            raise TimeoutError("等待用户输入超时")
-
-    def define_agents(self):
-        raise NotImplementedError
-
-    def exe_autogen(self, input):
-        # ⭐⭐ run in subprocess
-        input = input.content
-        with ProxyNetworkActivate("AutoGen"):
-            code_execution_config = {"work_dir": self.autogen_work_dir, "use_docker": self.use_docker}
-            agents = self.define_agents()
-            user_proxy = None
-            assistant = None
-            for agent_kwargs in agents:
-                agent_cls = agent_kwargs.pop('cls')
-                kwargs = {
-                    'llm_config':self.llm_kwargs,
-                    'code_execution_config':code_execution_config
-                }
-                kwargs.update(agent_kwargs)
-                agent_handle = agent_cls(**kwargs)
-                agent_handle._print_received_message = lambda a,b: self.gpt_academic_print_override(agent_kwargs, a, b)
-                for d in agent_handle._reply_func_list:
-                    if hasattr(d['reply_func'],'__name__') and d['reply_func'].__name__ == 'generate_oai_reply':
-                        d['reply_func'] = gpt_academic_generate_oai_reply
-                if agent_kwargs['name'] == 'user_proxy':
-                    agent_handle.get_human_input = lambda a: self.gpt_academic_get_human_input(user_proxy, a)
-                    user_proxy = agent_handle
-                if agent_kwargs['name'] == 'assistant': assistant = agent_handle
-            try:
-                if user_proxy is None or assistant is None: raise Exception("用户代理或助理代理未定义")
-                user_proxy.initiate_chat(assistant, message=input)
-            except Exception as e:
-                tb_str = '```\n' + trimmed_format_exc() + '```'
-                self.child_conn.send(PipeCom("done", "AutoGen 执行失败: \n\n" + tb_str))
-
-    def subprocess_worker(self, child_conn):
-        # ⭐⭐ run in subprocess
-        self.child_conn = child_conn
-        while True:
-            msg = self.child_conn.recv()  # PipeCom
-            self.exe_autogen(msg)
-
-
-class AutoGenGroupChat(AutoGenGeneral):
-    def exe_autogen(self, input):
-        # ⭐⭐ run in subprocess
-        import autogen
-
-        input = input.content
-        with ProxyNetworkActivate("AutoGen"):
-            code_execution_config = {"work_dir": self.autogen_work_dir, "use_docker": self.use_docker}
-            agents = self.define_agents()
-            agents_instances = []
-            for agent_kwargs in agents:
-                agent_cls = agent_kwargs.pop("cls")
-                kwargs = {"code_execution_config": code_execution_config}
-                kwargs.update(agent_kwargs)
-                agent_handle = agent_cls(**kwargs)
-                agent_handle._print_received_message = lambda a, b: self.gpt_academic_print_override(agent_kwargs, a, b)
-                agents_instances.append(agent_handle)
-                if agent_kwargs["name"] == "user_proxy":
-                    user_proxy = agent_handle
-                    user_proxy.get_human_input = lambda a: self.gpt_academic_get_human_input(user_proxy, a)
-            try:
-                groupchat = autogen.GroupChat(agents=agents_instances, messages=[], max_round=50)
-                manager = autogen.GroupChatManager(groupchat=groupchat, **self.define_group_chat_manager_config())
-                manager._print_received_message = lambda a, b: self.gpt_academic_print_override(agent_kwargs, a, b)
-                manager.get_human_input = lambda a: self.gpt_academic_get_human_input(manager, a)
-                if user_proxy is None:
-                    raise Exception("user_proxy is not defined")
-                user_proxy.initiate_chat(manager, message=input)
-            except Exception:
-                tb_str = "```\n" + trimmed_format_exc() + "```"
-                self.child_conn.send(PipeCom("done", "AutoGen exe failed: \n\n" + tb_str))
-
-    def define_group_chat_manager_config(self):
-        raise NotImplementedError

crazy_functions/agent_fns/persistent.py

@@ -1,16 +0,0 @@
-from toolbox import Singleton
-@Singleton
-class GradioMultiuserManagerForPersistentClasses():
-    def __init__(self):
-        self.mapping = {}
-
-    def already_alive(self, key):
-        return (key in self.mapping) and (self.mapping[key].is_alive())
-
-    def set(self, key, x):
-        self.mapping[key] = x
-        return self.mapping[key]
-
-    def get(self, key):
-        return self.mapping[key]
-

crazy_functions/agent_fns/pipe.py

@@ -1,194 +0,0 @@
-from toolbox import get_log_folder, update_ui, gen_time_str, get_conf, promote_file_to_downloadzone
-from crazy_functions.agent_fns.watchdog import WatchDog
-import time, os
-
-class PipeCom:
-    def __init__(self, cmd, content) -> None:
-        self.cmd = cmd
-        self.content = content
-
-
-class PluginMultiprocessManager:
-    def __init__(self, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        # ⭐ run in main process
-        self.autogen_work_dir = os.path.join(get_log_folder("autogen"), gen_time_str())
-        self.previous_work_dir_files = {}
-        self.llm_kwargs = llm_kwargs
-        self.plugin_kwargs = plugin_kwargs
-        self.chatbot = chatbot
-        self.history = history
-        self.system_prompt = system_prompt
-        # self.web_port = web_port
-        self.alive = True
-        self.use_docker = get_conf("AUTOGEN_USE_DOCKER")
-        self.last_user_input = ""
-        # create a thread to monitor self.heartbeat, terminate the instance if no heartbeat for a long time
-        timeout_seconds = 5 * 60
-        self.heartbeat_watchdog = WatchDog(timeout=timeout_seconds, bark_fn=self.terminate, interval=5)
-        self.heartbeat_watchdog.begin_watch()
-
-    def feed_heartbeat_watchdog(self):
-        # feed this `dog`, so the dog will not `bark` (bark_fn will terminate the instance)
-        self.heartbeat_watchdog.feed()
-
-    def is_alive(self):
-        return self.alive
-
-    def launch_subprocess_with_pipe(self):
-        # ⭐ run in main process
-        from multiprocessing import Process, Pipe
-
-        parent_conn, child_conn = Pipe()
-        self.p = Process(target=self.subprocess_worker, args=(child_conn,))
-        self.p.daemon = True
-        self.p.start()
-        return parent_conn
-
-    def terminate(self):
-        self.p.terminate()
-        self.alive = False
-        print("[debug] instance terminated")
-
-    def subprocess_worker(self, child_conn):
-        # ⭐⭐ run in subprocess
-        raise NotImplementedError
-
-    def send_command(self, cmd):
-        # ⭐ run in main process
-        repeated = False
-        if cmd == self.last_user_input:
-            repeated = True
-            cmd = ""
-        else:
-            self.last_user_input = cmd
-        self.parent_conn.send(PipeCom("user_input", cmd))
-        return repeated, cmd
-
-    def immediate_showoff_when_possible(self, fp):
-        # ⭐ 主进程
-        # 获取fp的拓展名
-        file_type = fp.split('.')[-1]
-        # 如果是文本文件, 则直接显示文本内容
-        if file_type.lower() in ['png', 'jpg']:
-            image_path = os.path.abspath(fp)
-            self.chatbot.append([
-                '检测到新生图像:', 
-                f'本地文件预览: <br/><div align="center"><img src="file={image_path}"></div>'
-            ])
-            yield from update_ui(chatbot=self.chatbot, history=self.history)
-
-    def overwatch_workdir_file_change(self):
-        # ⭐ 主进程 Docker 外挂文件夹监控
-        path_to_overwatch = self.autogen_work_dir
-        change_list = []
-        # 扫描路径下的所有文件, 并与self.previous_work_dir_files中所记录的文件进行对比，
-        # 如果有新文件出现，或者文件的修改时间发生变化，则更新self.previous_work_dir_files中
-        # 把新文件和发生变化的文件的路径记录到 change_list 中
-        for root, dirs, files in os.walk(path_to_overwatch):
-            for file in files:
-                file_path = os.path.join(root, file)
-                if file_path not in self.previous_work_dir_files.keys():
-                    last_modified_time = os.stat(file_path).st_mtime
-                    self.previous_work_dir_files.update({file_path: last_modified_time})
-                    change_list.append(file_path)
-                else:
-                    last_modified_time = os.stat(file_path).st_mtime
-                    if last_modified_time != self.previous_work_dir_files[file_path]:
-                        self.previous_work_dir_files[file_path] = last_modified_time
-                        change_list.append(file_path)
-        if len(change_list) > 0:
-            file_links = ""
-            for f in change_list:
-                res = promote_file_to_downloadzone(f)
-                file_links += f'<br/><a href="file={res}" target="_blank">{res}</a>'
-                yield from self.immediate_showoff_when_possible(f)
-
-            self.chatbot.append(['检测到新生文档.', f'文档清单如下: {file_links}'])
-            yield from update_ui(chatbot=self.chatbot, history=self.history)
-        return change_list
-
-
-    def main_process_ui_control(self, txt, create_or_resume) -> str:
-        # ⭐ 主进程
-        if create_or_resume == 'create':
-            self.cnt = 1
-            self.parent_conn = self.launch_subprocess_with_pipe() # ⭐⭐⭐
-        repeated, cmd_to_autogen = self.send_command(txt)
-        if txt == 'exit': 
-            self.chatbot.append([f"结束", "结束信号已明确，终止AutoGen程序。"])
-            yield from update_ui(chatbot=self.chatbot, history=self.history)
-            self.terminate()
-            return "terminate"
-        
-        # patience = 10
-        
-        while True:
-            time.sleep(0.5)
-            if not self.alive:
-                # the heartbeat watchdog might have it killed
-                self.terminate()
-                return "terminate"
-            if self.parent_conn.poll(): 
-                self.feed_heartbeat_watchdog()
-                if "[GPT-Academic] 等待中" in self.chatbot[-1][-1]:
-                    self.chatbot.pop(-1)  # remove the last line
-                if "等待您的进一步指令" in self.chatbot[-1][-1]:
-                    self.chatbot.pop(-1)  # remove the last line
-                if '[GPT-Academic] 等待中' in self.chatbot[-1][-1]:
-                    self.chatbot.pop(-1)    # remove the last line
-                msg = self.parent_conn.recv() # PipeCom
-                if msg.cmd == "done":
-                    self.chatbot.append([f"结束", msg.content])
-                    self.cnt += 1
-                    yield from update_ui(chatbot=self.chatbot, history=self.history)
-                    self.terminate()
-                    break
-                if msg.cmd == "show":
-                    yield from self.overwatch_workdir_file_change()
-                    notice = ""
-                    if repeated: notice = "（自动忽略重复的输入）"
-                    self.chatbot.append([f"运行阶段-{self.cnt}（上次用户反馈输入为: 「{cmd_to_autogen}」{notice}", msg.content])
-                    self.cnt += 1
-                    yield from update_ui(chatbot=self.chatbot, history=self.history)
-                if msg.cmd == "interact":
-                    yield from self.overwatch_workdir_file_change()
-                    self.chatbot.append([f"程序抵达用户反馈节点.", msg.content + 
-                                         "\n\n等待您的进一步指令." + 
-                                         "\n\n(1) 一般情况下您不需要说什么, 清空输入区, 然后直接点击“提交”以继续. " +
-                                         "\n\n(2) 如果您需要补充些什么, 输入要反馈的内容, 直接点击“提交”以继续. " +
-                                         "\n\n(3) 如果您想终止程序, 输入exit, 直接点击“提交”以终止AutoGen并解锁. "
-                    ])
-                    yield from update_ui(chatbot=self.chatbot, history=self.history)
-                    # do not terminate here, leave the subprocess_worker instance alive
-                    return "wait_feedback"
-            else:
-                self.feed_heartbeat_watchdog()
-                if '[GPT-Academic] 等待中' not in self.chatbot[-1][-1]:
-                    # begin_waiting_time = time.time()
-                    self.chatbot.append(["[GPT-Academic] 等待AutoGen执行结果 ...", "[GPT-Academic] 等待中"])
-                self.chatbot[-1] = [self.chatbot[-1][0], self.chatbot[-1][1].replace("[GPT-Academic] 等待中", "[GPT-Academic] 等待中.")]
-                yield from update_ui(chatbot=self.chatbot, history=self.history)
-                # if time.time() - begin_waiting_time > patience:
-                #     self.chatbot.append([f"结束", "等待超时, 终止AutoGen程序。"])
-                #     yield from update_ui(chatbot=self.chatbot, history=self.history)
-                #     self.terminate()
-                #     return "terminate"
-
-        self.terminate()
-        return "terminate"
-
-    def subprocess_worker_wait_user_feedback(self, wait_msg="wait user feedback"):
-        # ⭐⭐ run in subprocess
-        patience = 5 * 60
-        begin_waiting_time = time.time()
-        self.child_conn.send(PipeCom("interact", wait_msg))
-        while True:
-            time.sleep(0.5)
-            if self.child_conn.poll():
-                wait_success = True
-                break
-            if time.time() - begin_waiting_time > patience:
-                self.child_conn.send(PipeCom("done", ""))
-                wait_success = False
-                break
-        return wait_success

crazy_functions/agent_fns/watchdog.py

@@ -1,28 +0,0 @@
-import threading, time
-
-class WatchDog():
-    def __init__(self, timeout, bark_fn, interval=3, msg="") -> None:
-        self.last_feed = None
-        self.timeout = timeout
-        self.bark_fn = bark_fn
-        self.interval = interval
-        self.msg = msg
-        self.kill_dog = False
-    
-    def watch(self):
-        while True:
-            if self.kill_dog: break
-            if time.time() - self.last_feed > self.timeout:
-                if len(self.msg) > 0: print(self.msg)
-                self.bark_fn()
-                break
-            time.sleep(self.interval)
-
-    def begin_watch(self):
-        self.last_feed = time.time()
-        th = threading.Thread(target=self.watch)
-        th.daemon = True
-        th.start()
-
-    def feed(self):
-        self.last_feed = time.time()

crazy_functions/chatglm微调工具.py

@@ -1,141 +0,0 @@
-from toolbox import CatchException, update_ui, promote_file_to_downloadzone
-from .crazy_utils import request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency
-import datetime, json
-
-def fetch_items(list_of_items, batch_size):
-    for i in range(0, len(list_of_items), batch_size):
-        yield list_of_items[i:i + batch_size]
-
-def string_to_options(arguments):
-    import argparse
-    import shlex
-
-    # Create an argparse.ArgumentParser instance
-    parser = argparse.ArgumentParser()
-
-    # Add command-line arguments
-    parser.add_argument("--llm_to_learn", type=str, help="LLM model to learn", default="gpt-3.5-turbo")
-    parser.add_argument("--prompt_prefix", type=str, help="Prompt prefix", default='')
-    parser.add_argument("--system_prompt", type=str, help="System prompt", default='')
-    parser.add_argument("--batch", type=int, help="System prompt", default=50)
-    parser.add_argument("--pre_seq_len", type=int, help="pre_seq_len", default=50)
-    parser.add_argument("--learning_rate", type=float, help="learning_rate", default=2e-2)
-    parser.add_argument("--num_gpus", type=int, help="num_gpus", default=1)
-    parser.add_argument("--json_dataset", type=str, help="json_dataset", default="")
-    parser.add_argument("--ptuning_directory", type=str, help="ptuning_directory", default="")
-
-
-
-    # Parse the arguments
-    args = parser.parse_args(shlex.split(arguments))
-
-    return args
-
-@CatchException
-def 微调数据集生成(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-    """
-    txt             输入栏用户输入的文本，例如需要翻译的一段话，再例如一个包含了待处理文件的路径
-    llm_kwargs      gpt模型参数，如温度和top_p等，一般原样传递下去就行
-    plugin_kwargs   插件模型的参数
-    chatbot         聊天显示框的句柄，用于显示给用户
-    history         聊天历史，前情提要
-    system_prompt   给gpt的静默提醒
-    web_port        当前软件运行的端口号
-    """
-    history = []    # 清空历史，以免输入溢出
-    chatbot.append(("这是什么功能？", "[Local Message] 微调数据集生成"))
-    if ("advanced_arg" in plugin_kwargs) and (plugin_kwargs["advanced_arg"] == ""): plugin_kwargs.pop("advanced_arg")
-    args = plugin_kwargs.get("advanced_arg", None)
-    if args is None: 
-        chatbot.append(("没给定指令", "退出"))
-        yield from update_ui(chatbot=chatbot, history=history); return
-    else:
-        arguments = string_to_options(arguments=args)
-
-    dat = []
-    with open(txt, 'r', encoding='utf8') as f:
-        for line in f.readlines():
-            json_dat = json.loads(line)
-            dat.append(json_dat["content"])
-
-    llm_kwargs['llm_model'] = arguments.llm_to_learn
-    for batch in fetch_items(dat, arguments.batch):
-        res = yield from request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency(
-            inputs_array=[f"{arguments.prompt_prefix}\n\n{b}" for b in (batch)],
-            inputs_show_user_array=[f"Show Nothing" for _ in (batch)],
-            llm_kwargs=llm_kwargs,
-            chatbot=chatbot,
-            history_array=[[] for _ in (batch)],
-            sys_prompt_array=[arguments.system_prompt for _ in (batch)],
-            max_workers=10  # OpenAI所允许的最大并行过载
-        )
-    
-        with open(txt+'.generated.json', 'a+', encoding='utf8') as f:
-            for b, r in zip(batch, res[1::2]):
-                f.write(json.dumps({"content":b, "summary":r}, ensure_ascii=False)+'\n')
-
-    promote_file_to_downloadzone(txt+'.generated.json', rename_file='generated.json', chatbot=chatbot)
-    return
-
-
-
-@CatchException
-def 启动微调(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-    """
-    txt             输入栏用户输入的文本，例如需要翻译的一段话，再例如一个包含了待处理文件的路径
-    llm_kwargs      gpt模型参数，如温度和top_p等，一般原样传递下去就行
-    plugin_kwargs   插件模型的参数
-    chatbot         聊天显示框的句柄，用于显示给用户
-    history         聊天历史，前情提要
-    system_prompt   给gpt的静默提醒
-    web_port        当前软件运行的端口号
-    """
-    import subprocess
-    history = []    # 清空历史，以免输入溢出
-    chatbot.append(("这是什么功能？", "[Local Message] 微调数据集生成"))
-    if ("advanced_arg" in plugin_kwargs) and (plugin_kwargs["advanced_arg"] == ""): plugin_kwargs.pop("advanced_arg")
-    args = plugin_kwargs.get("advanced_arg", None)
-    if args is None: 
-        chatbot.append(("没给定指令", "退出"))
-        yield from update_ui(chatbot=chatbot, history=history); return
-    else:
-        arguments = string_to_options(arguments=args)
-      
-
-
-    pre_seq_len = arguments.pre_seq_len             # 128
-    learning_rate = arguments.learning_rate                               # 2e-2
-    num_gpus = arguments.num_gpus                   # 1
-    json_dataset = arguments.json_dataset                 # 't_code.json'
-    ptuning_directory = arguments.ptuning_directory       # '/home/hmp/ChatGLM2-6B/ptuning'
-
-    command = f"torchrun --standalone --nnodes=1 --nproc-per-node={num_gpus} main.py \
-        --do_train \
-        --train_file AdvertiseGen/{json_dataset} \
-        --validation_file AdvertiseGen/{json_dataset} \
-        --preprocessing_num_workers 20 \
-        --prompt_column content \
-        --response_column summary \
-        --overwrite_cache \
-        --model_name_or_path THUDM/chatglm2-6b \
-        --output_dir output/clothgen-chatglm2-6b-pt-{pre_seq_len}-{learning_rate} \
-        --overwrite_output_dir \
-        --max_source_length 256 \
-        --max_target_length 256 \
-        --per_device_train_batch_size 1 \
-        --per_device_eval_batch_size 1 \
-        --gradient_accumulation_steps 16 \
-        --predict_with_generate \
-        --max_steps 100 \
-        --logging_steps 10 \
-        --save_steps 20 \
-        --learning_rate {learning_rate} \
-        --pre_seq_len {pre_seq_len} \
-        --quantization_bit 4"
-
-    process = subprocess.Popen(command, shell=True, cwd=ptuning_directory)
-    try:
-        process.communicate(timeout=3600*24)
-    except subprocess.TimeoutExpired:
-        process.kill()
-    return

crazy_functions/crazy_functions_test.py

@@ -1,231 +0,0 @@
-"""
-这是什么？
-    这个文件用于函数插件的单元测试
-    运行方法 python crazy_functions/crazy_functions_test.py
-"""
-    
-# ==============================================================================================================================
-
-def validate_path():
-    import os, sys
-    dir_name = os.path.dirname(__file__)
-    root_dir_assume = os.path.abspath(os.path.dirname(__file__) +  '/..')
-    os.chdir(root_dir_assume)
-    sys.path.append(root_dir_assume)
-validate_path() # validate path so you can run from base directory
-
-# ==============================================================================================================================
-
-from colorful import *
-from toolbox import get_conf, ChatBotWithCookies
-import contextlib
-import os
-import sys
-from functools import wraps
-proxies, WEB_PORT, LLM_MODEL, CONCURRENT_COUNT, AUTHENTICATION, CHATBOT_HEIGHT, LAYOUT, API_KEY = \
-    get_conf('proxies', 'WEB_PORT', 'LLM_MODEL', 'CONCURRENT_COUNT', 'AUTHENTICATION', 'CHATBOT_HEIGHT', 'LAYOUT', 'API_KEY')
-
-llm_kwargs = {
-    'api_key': API_KEY,
-    'llm_model': LLM_MODEL,
-    'top_p':1.0, 
-    'max_length': None,
-    'temperature':1.0,
-}
-plugin_kwargs = { }
-chatbot = ChatBotWithCookies(llm_kwargs)
-history = []
-system_prompt = "Serve me as a writing and programming assistant."
-web_port = 1024
-
-# ==============================================================================================================================
-
-def silence_stdout(func):
-    @wraps(func)
-    def wrapper(*args, **kwargs):
-        _original_stdout = sys.stdout
-        sys.stdout = open(os.devnull, 'w')
-        for q in func(*args, **kwargs):
-            sys.stdout = _original_stdout
-            yield q
-            sys.stdout = open(os.devnull, 'w')
-        sys.stdout.close()
-        sys.stdout = _original_stdout
-    return wrapper
-
-class CLI_Printer():
-    def __init__(self) -> None:
-        self.pre_buf = ""
-
-    def print(self, buf):
-        bufp = ""
-        for index, chat in enumerate(buf):
-            a, b = chat
-            bufp += sprint亮靛('[Me]:' + a) + '\n'
-            bufp += '[GPT]:' + b
-            if index < len(buf)-1: 
-                bufp += '\n'
-
-        if self.pre_buf!="" and bufp.startswith(self.pre_buf):
-            print(bufp[len(self.pre_buf):], end='')
-        else:
-            print('\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n'+bufp, end='')
-        self.pre_buf = bufp
-        return
-    
-cli_printer = CLI_Printer()
-# ==============================================================================================================================
-def test_解析一个Python项目():
-    from crazy_functions.解析项目源代码 import 解析一个Python项目
-    txt = "crazy_functions/test_project/python/dqn"
-    for cookies, cb, hist, msg in 解析一个Python项目(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        print(cb)
-
-def test_解析一个Cpp项目():
-    from crazy_functions.解析项目源代码 import 解析一个C项目
-    txt = "crazy_functions/test_project/cpp/cppipc"
-    for cookies, cb, hist, msg in 解析一个C项目(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        print(cb)
-
-def test_Latex英文润色():
-    from crazy_functions.Latex全文润色 import Latex英文润色
-    txt = "crazy_functions/test_project/latex/attention"
-    for cookies, cb, hist, msg in Latex英文润色(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        print(cb)
-
-def test_Markdown中译英():
-    from crazy_functions.批量Markdown翻译 import Markdown中译英
-    txt = "README.md"
-    for cookies, cb, hist, msg in Markdown中译英(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        print(cb)
-
-def test_批量翻译PDF文档():
-    from crazy_functions.批量翻译PDF文档_多线程 import 批量翻译PDF文档
-    txt = "crazy_functions/test_project/pdf_and_word"
-    for cookies, cb, hist, msg in 批量翻译PDF文档(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        print(cb)
-
-def test_谷歌检索小助手():
-    from crazy_functions.谷歌检索小助手 import 谷歌检索小助手
-    txt = "https://scholar.google.com/scholar?hl=en&as_sdt=0%2C5&q=auto+reinforcement+learning&btnG="
-    for cookies, cb, hist, msg in 谷歌检索小助手(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        print(cb)
-
-def test_总结word文档():
-    from crazy_functions.总结word文档 import 总结word文档
-    txt = "crazy_functions/test_project/pdf_and_word"
-    for cookies, cb, hist, msg in 总结word文档(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        print(cb)
-
-def test_下载arxiv论文并翻译摘要():
-    from crazy_functions.下载arxiv论文翻译摘要 import 下载arxiv论文并翻译摘要
-    txt = "1812.10695"
-    for cookies, cb, hist, msg in 下载arxiv论文并翻译摘要(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        print(cb)
-
-def test_联网回答问题():
-    from crazy_functions.联网的ChatGPT import 连接网络回答问题
-    # txt = "谁是应急食品？"
-    # >>        '根据以上搜索结果可以得知，应急食品是“原神”游戏中的角色派蒙的外号。'
-    # txt = "道路千万条，安全第一条。后面两句是？"
-    # >>        '行车不规范，亲人两行泪。'
-    # txt = "You should have gone for the head. What does that mean?"
-    # >>        The phrase "You should have gone for the head" is a quote from the Marvel movies, Avengers: Infinity War and Avengers: Endgame. It was spoken by the character Thanos in Infinity War and by Thor in Endgame.
-    txt = "AutoGPT是什么？"
-    for cookies, cb, hist, msg in 连接网络回答问题(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port): 
-        print("当前问答：", cb[-1][-1].replace("\n"," "))
-    for i, it in enumerate(cb): print亮蓝(it[0]); print亮黄(it[1])
-
-def test_解析ipynb文件():
-    from crazy_functions.解析JupyterNotebook import 解析ipynb文件
-    txt = "crazy_functions/test_samples"
-    for cookies, cb, hist, msg in 解析ipynb文件(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        print(cb)
-
-
-def test_数学动画生成manim():
-    from crazy_functions.数学动画生成manim import 动画生成
-    txt = "A ball split into 2, and then split into 4, and finally split into 8."
-    for cookies, cb, hist, msg in 动画生成(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        print(cb)
-
-
-
-def test_Markdown多语言():
-    from crazy_functions.批量Markdown翻译 import Markdown翻译指定语言
-    txt = "README.md"
-    history = []
-    for lang in ["English", "French", "Japanese", "Korean", "Russian", "Italian", "German", "Portuguese", "Arabic"]:
-        plugin_kwargs = {"advanced_arg": lang}
-        for cookies, cb, hist, msg in Markdown翻译指定语言(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-            print(cb)
-
-def test_Langchain知识库():
-    from crazy_functions.Langchain知识库 import 知识库问答
-    txt = "./"
-    chatbot = ChatBotWithCookies(llm_kwargs)
-    for cookies, cb, hist, msg in silence_stdout(知识库问答)(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        cli_printer.print(cb)   #  print(cb)
-    
-    chatbot = ChatBotWithCookies(cookies)
-    from crazy_functions.Langchain知识库 import 读取知识库作答
-    txt = "What is the installation method？"
-    for cookies, cb, hist, msg in silence_stdout(读取知识库作答)(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        cli_printer.print(cb)   #  print(cb)
-
-def test_Langchain知识库读取():
-    from crazy_functions.Langchain知识库 import 读取知识库作答
-    txt = "远程云服务器部署？"
-    for cookies, cb, hist, msg in silence_stdout(读取知识库作答)(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        cli_printer.print(cb)   #  print(cb)
-
-def test_Latex():
-    from crazy_functions.Latex输出PDF结果 import Latex英文纠错加PDF对比, Latex翻译中文并重新编译PDF
-
-    # txt = r"https://arxiv.org/abs/1706.03762"
-    # txt = r"https://arxiv.org/abs/1902.03185"
-    # txt = r"https://arxiv.org/abs/2305.18290"
-    # txt = r"https://arxiv.org/abs/2305.17608"
-    # txt = r"https://arxiv.org/abs/2211.16068"                     #  ACE
-    # txt = r"C:\Users\x\arxiv_cache\2211.16068\workfolder"  #  ACE
-    # txt = r"https://arxiv.org/abs/2002.09253"
-    # txt = r"https://arxiv.org/abs/2306.07831"
-    # txt = r"https://arxiv.org/abs/2212.10156"
-    # txt = r"https://arxiv.org/abs/2211.11559"
-    # txt = r"https://arxiv.org/abs/2303.08774"
-    txt = r"https://arxiv.org/abs/2303.12712"
-    # txt = r"C:\Users\fuqingxu\arxiv_cache\2303.12712\workfolder"
-    
-
-    for cookies, cb, hist, msg in (Latex翻译中文并重新编译PDF)(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-        cli_printer.print(cb)   #  print(cb)
-
-
-
-    # txt = "2302.02948.tar"
-    # print(txt)
-    # main_tex, work_folder = Latex预处理(txt)
-    # print('main tex:', main_tex)
-    # res = 编译Latex(main_tex, work_folder)
-    # # for cookies, cb, hist, msg in silence_stdout(编译Latex)(txt, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, web_port):
-    #     cli_printer.print(cb)   #  print(cb)
-
-
-
-# test_解析一个Python项目()
-# test_Latex英文润色()
-# test_Markdown中译英()
-# test_批量翻译PDF文档()
-# test_谷歌检索小助手()
-# test_总结word文档()
-# test_下载arxiv论文并翻译摘要()
-# test_解析一个Cpp项目()
-# test_联网回答问题()
-# test_解析ipynb文件()
-# test_数学动画生成manim()
-# test_Langchain知识库()
-# test_Langchain知识库读取()
-if __name__ == "__main__":
-    test_Latex()
-    input("程序完成，回车退出。")
-    print("退出。")

crazy_functions/crazy_utils.py

@@ -1,606 +0,0 @@
-from toolbox import update_ui, get_conf, trimmed_format_exc, get_max_token, Singleton
-import threading
-import os
-import logging
-
-def input_clipping(inputs, history, max_token_limit):
-    import numpy as np
-    from request_llms.bridge_all import model_info
-    enc = model_info["gpt-3.5-turbo"]['tokenizer']
-    def get_token_num(txt): return len(enc.encode(txt, disallowed_special=()))
-
-    mode = 'input-and-history'
-    # 当 输入部分的token占比 小于 全文的一半时，只裁剪历史
-    input_token_num = get_token_num(inputs)
-    if input_token_num < max_token_limit//2: 
-        mode = 'only-history'
-        max_token_limit = max_token_limit - input_token_num
-
-    everything = [inputs] if mode == 'input-and-history' else ['']
-    everything.extend(history)
-    n_token = get_token_num('\n'.join(everything))
-    everything_token = [get_token_num(e) for e in everything]
-    delta = max(everything_token) // 16 # 截断时的颗粒度
-        
-    while n_token > max_token_limit:
-        where = np.argmax(everything_token)
-        encoded = enc.encode(everything[where], disallowed_special=())
-        clipped_encoded = encoded[:len(encoded)-delta]
-        everything[where] = enc.decode(clipped_encoded)[:-1]    # -1 to remove the may-be illegal char
-        everything_token[where] = get_token_num(everything[where])
-        n_token = get_token_num('\n'.join(everything))
-
-    if mode == 'input-and-history':
-        inputs = everything[0]
-    else:
-        pass
-    history = everything[1:]
-    return inputs, history
-
-def request_gpt_model_in_new_thread_with_ui_alive(
-        inputs, inputs_show_user, llm_kwargs, 
-        chatbot, history, sys_prompt, refresh_interval=0.2,
-        handle_token_exceed=True, 
-        retry_times_at_unknown_error=2,
-        ):
-    """
-    Request GPT model，请求GPT模型同时维持用户界面活跃。
-
-    输入参数 Args （以_array结尾的输入变量都是列表，列表长度为子任务的数量，执行时，会把列表拆解，放到每个子线程中分别执行）:
-        inputs (string): List of inputs （输入）
-        inputs_show_user (string): List of inputs to show user（展现在报告中的输入，借助此参数，在汇总报告中隐藏啰嗦的真实输入，增强报告的可读性）
-        top_p (float): Top p value for sampling from model distribution （GPT参数，浮点数）
-        temperature (float): Temperature value for sampling from model distribution（GPT参数，浮点数）
-        chatbot: chatbot inputs and outputs （用户界面对话窗口句柄，用于数据流可视化）
-        history (list): List of chat history （历史，对话历史列表）
-        sys_prompt (string): List of system prompts （系统输入，列表，用于输入给GPT的前提提示，比如你是翻译官怎样怎样）
-        refresh_interval (float, optional): Refresh interval for UI (default: 0.2) （刷新时间间隔频率，建议低于1，不可高于3，仅仅服务于视觉效果）
-        handle_token_exceed：是否自动处理token溢出的情况，如果选择自动处理，则会在溢出时暴力截断，默认开启
-        retry_times_at_unknown_error：失败时的重试次数
-
-    输出 Returns:
-        future: 输出，GPT返回的结果
-    """
-    import time
-    from concurrent.futures import ThreadPoolExecutor
-    from request_llms.bridge_all import predict_no_ui_long_connection
-    # 用户反馈
-    chatbot.append([inputs_show_user, ""])
-    yield from update_ui(chatbot=chatbot, history=[]) # 刷新界面
-    executor = ThreadPoolExecutor(max_workers=16)
-    mutable = ["", time.time(), ""]
-    # 看门狗耐心
-    watch_dog_patience = 5
-    # 请求任务
-    def _req_gpt(inputs, history, sys_prompt):
-        retry_op = retry_times_at_unknown_error
-        exceeded_cnt = 0
-        while True:
-            # watchdog error
-            if len(mutable) >= 2 and (time.time()-mutable[1]) > watch_dog_patience: 
-                raise RuntimeError("检测到程序终止。")
-            try:
-                # 【第一种情况】：顺利完成
-                result = predict_no_ui_long_connection(
-                    inputs=inputs, llm_kwargs=llm_kwargs,
-                    history=history, sys_prompt=sys_prompt, observe_window=mutable)
-                return result
-            except ConnectionAbortedError as token_exceeded_error:
-                # 【第二种情况】：Token溢出
-                if handle_token_exceed:
-                    exceeded_cnt += 1
-                    # 【选择处理】 尝试计算比例，尽可能多地保留文本
-                    from toolbox import get_reduce_token_percent
-                    p_ratio, n_exceed = get_reduce_token_percent(str(token_exceeded_error))
-                    MAX_TOKEN = get_max_token(llm_kwargs)
-                    EXCEED_ALLO = 512 + 512 * exceeded_cnt
-                    inputs, history = input_clipping(inputs, history, max_token_limit=MAX_TOKEN-EXCEED_ALLO)
-                    mutable[0] += f'[Local Message] 警告，文本过长将进行截断，Token溢出数：{n_exceed}。\n\n'
-                    continue # 返回重试
-                else:
-                    # 【选择放弃】
-                    tb_str = '```\n' + trimmed_format_exc() + '```'
-                    mutable[0] += f"[Local Message] 警告，在执行过程中遭遇问题, Traceback：\n\n{tb_str}\n\n"
-                    return mutable[0] # 放弃
-            except:
-                # 【第三种情况】：其他错误：重试几次
-                tb_str = '```\n' + trimmed_format_exc() + '```'
-                print(tb_str)
-                mutable[0] += f"[Local Message] 警告，在执行过程中遭遇问题, Traceback：\n\n{tb_str}\n\n"
-                if retry_op > 0:
-                    retry_op -= 1
-                    mutable[0] += f"[Local Message] 重试中，请稍等 {retry_times_at_unknown_error-retry_op}/{retry_times_at_unknown_error}：\n\n"
-                    if ("Rate limit reached" in tb_str) or ("Too Many Requests" in tb_str):
-                        time.sleep(30)
-                    time.sleep(5)
-                    continue # 返回重试
-                else:
-                    time.sleep(5)
-                    return mutable[0] # 放弃
-
-    # 提交任务
-    future = executor.submit(_req_gpt, inputs, history, sys_prompt)
-    while True:
-        # yield一次以刷新前端页面
-        time.sleep(refresh_interval)
-        # “喂狗”（看门狗）
-        mutable[1] = time.time()
-        if future.done():
-            break
-        chatbot[-1] = [chatbot[-1][0], mutable[0]]
-        yield from update_ui(chatbot=chatbot, history=[]) # 刷新界面
-
-    final_result = future.result()
-    chatbot[-1] = [chatbot[-1][0], final_result]
-    yield from update_ui(chatbot=chatbot, history=[]) # 如果最后成功了，则删除报错信息
-    return final_result
-
-def can_multi_process(llm):
-    if llm.startswith('gpt-'): return True
-    if llm.startswith('api2d-'): return True
-    if llm.startswith('azure-'): return True
-    if llm.startswith('spark'): return True
-    if llm.startswith('zhipuai'): return True
-    return False
-
-def request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency(
-        inputs_array, inputs_show_user_array, llm_kwargs, 
-        chatbot, history_array, sys_prompt_array, 
-        refresh_interval=0.2, max_workers=-1, scroller_max_len=30,
-        handle_token_exceed=True, show_user_at_complete=False,
-        retry_times_at_unknown_error=2,
-        ):
-    """
-    Request GPT model using multiple threads with UI and high efficiency
-    请求GPT模型的[多线程]版。
-    具备以下功能：
-        实时在UI上反馈远程数据流
-        使用线程池，可调节线程池的大小避免openai的流量限制错误
-        处理中途中止的情况
-        网络等出问题时，会把traceback和已经接收的数据转入输出
-
-    输入参数 Args （以_array结尾的输入变量都是列表，列表长度为子任务的数量，执行时，会把列表拆解，放到每个子线程中分别执行）:
-        inputs_array (list): List of inputs （每个子任务的输入）
-        inputs_show_user_array (list): List of inputs to show user（每个子任务展现在报告中的输入，借助此参数，在汇总报告中隐藏啰嗦的真实输入，增强报告的可读性）
-        llm_kwargs: llm_kwargs参数
-        chatbot: chatbot （用户界面对话窗口句柄，用于数据流可视化）
-        history_array (list): List of chat history （历史对话输入，双层列表，第一层列表是子任务分解，第二层列表是对话历史）
-        sys_prompt_array (list): List of system prompts （系统输入，列表，用于输入给GPT的前提提示，比如你是翻译官怎样怎样）
-        refresh_interval (float, optional): Refresh interval for UI (default: 0.2) （刷新时间间隔频率，建议低于1，不可高于3，仅仅服务于视觉效果）
-        max_workers (int, optional): Maximum number of threads (default: see config.py) （最大线程数，如果子任务非常多，需要用此选项防止高频地请求openai导致错误）
-        scroller_max_len (int, optional): Maximum length for scroller (default: 30)（数据流的显示最后收到的多少个字符，仅仅服务于视觉效果）
-        handle_token_exceed (bool, optional): （是否在输入过长时，自动缩减文本）
-        handle_token_exceed：是否自动处理token溢出的情况，如果选择自动处理，则会在溢出时暴力截断，默认开启
-        show_user_at_complete (bool, optional): (在结束时，把完整输入-输出结果显示在聊天框)
-        retry_times_at_unknown_error：子任务失败时的重试次数
-
-    输出 Returns:
-        list: List of GPT model responses （每个子任务的输出汇总，如果某个子任务出错，response中会携带traceback报错信息，方��调试和定位问题。）
-    """
-    import time, random
-    from concurrent.futures import ThreadPoolExecutor
-    from request_llms.bridge_all import predict_no_ui_long_connection
-    assert len(inputs_array) == len(history_array)
-    assert len(inputs_array) == len(sys_prompt_array)
-    if max_workers == -1: # 读取配置文件
-        try: max_workers = get_conf('DEFAULT_WORKER_NUM')
-        except: max_workers = 8
-        if max_workers <= 0: max_workers = 3
-    # 屏蔽掉 chatglm的多线程，可能会导致严重卡顿
-    if not can_multi_process(llm_kwargs['llm_model']):
-        max_workers = 1
-        
-    executor = ThreadPoolExecutor(max_workers=max_workers)
-    n_frag = len(inputs_array)
-    # 用户反馈
-    chatbot.append(["请开始多线程操作。", ""])
-    yield from update_ui(chatbot=chatbot, history=[]) # 刷新界面
-    # 跨线程传递
-    mutable = [["", time.time(), "等待中"] for _ in range(n_frag)]
-
-    # 看门狗耐心
-    watch_dog_patience = 5
-
-    # 子线程任务
-    def _req_gpt(index, inputs, history, sys_prompt):
-        gpt_say = ""
-        retry_op = retry_times_at_unknown_error
-        exceeded_cnt = 0
-        mutable[index][2] = "执行中"
-        detect_timeout = lambda: len(mutable[index]) >= 2 and (time.time()-mutable[index][1]) > watch_dog_patience
-        while True:
-            # watchdog error
-            if detect_timeout(): raise RuntimeError("检测到程序终止。")
-            try:
-                # 【第一种情况】：顺利完成
-                gpt_say = predict_no_ui_long_connection(
-                    inputs=inputs, llm_kwargs=llm_kwargs, history=history, 
-                    sys_prompt=sys_prompt, observe_window=mutable[index], console_slience=True
-                )
-                mutable[index][2] = "已成功"
-                return gpt_say
-            except ConnectionAbortedError as token_exceeded_error:
-                # 【第二种情况】：Token溢出
-                if handle_token_exceed:
-                    exceeded_cnt += 1
-                    # 【选择处理】 尝试计算比例，尽可能多地保留文本
-                    from toolbox import get_reduce_token_percent
-                    p_ratio, n_exceed = get_reduce_token_percent(str(token_exceeded_error))
-                    MAX_TOKEN = get_max_token(llm_kwargs)
-                    EXCEED_ALLO = 512 + 512 * exceeded_cnt
-                    inputs, history = input_clipping(inputs, history, max_token_limit=MAX_TOKEN-EXCEED_ALLO)
-                    gpt_say += f'[Local Message] 警告，文本过长将进行截断，Token溢出数：{n_exceed}。\n\n'
-                    mutable[index][2] = f"截断重试"
-                    continue # 返回重试
-                else:
-                    # 【选择放弃】
-                    tb_str = '```\n' + trimmed_format_exc() + '```'
-                    gpt_say += f"[Local Message] 警告，线程{index}在执行过程中遭遇问题, Traceback：\n\n{tb_str}\n\n"
-                    if len(mutable[index][0]) > 0: gpt_say += "此线程失败前收到的回答：\n\n" + mutable[index][0]
-                    mutable[index][2] = "输入过长已放弃"
-                    return gpt_say # 放弃
-            except:
-                # 【第三种情况】：其他错误
-                if detect_timeout(): raise RuntimeError("检测到程序终止。")
-                tb_str = '```\n' + trimmed_format_exc() + '```'
-                print(tb_str)
-                gpt_say += f"[Local Message] 警告，线程{index}在执行过程中遭遇问题, Traceback：\n\n{tb_str}\n\n"
-                if len(mutable[index][0]) > 0: gpt_say += "此线程失败前收到的回答：\n\n" + mutable[index][0]
-                if retry_op > 0: 
-                    retry_op -= 1
-                    wait = random.randint(5, 20)
-                    if ("Rate limit reached" in tb_str) or ("Too Many Requests" in tb_str):
-                        wait = wait * 3
-                        fail_info = "OpenAI绑定信用卡可解除频率限制 "
-                    else:
-                        fail_info = ""
-                    # 也许等待十几秒后，情况会好转
-                    for i in range(wait):
-                        mutable[index][2] = f"{fail_info}等待重试 {wait-i}"; time.sleep(1)
-                    # 开始重试
-                    if detect_timeout(): raise RuntimeError("检测到程序终止。")
-                    mutable[index][2] = f"重试中 {retry_times_at_unknown_error-retry_op}/{retry_times_at_unknown_error}"
-                    continue # 返回重试
-                else:
-                    mutable[index][2] = "已失败"
-                    wait = 5
-                    time.sleep(5)
-                    return gpt_say # 放弃
-
-    # 异步任务开始
-    futures = [executor.submit(_req_gpt, index, inputs, history, sys_prompt) for index, inputs, history, sys_prompt in zip(
-        range(len(inputs_array)), inputs_array, history_array, sys_prompt_array)]
-    cnt = 0
-    while True:
-        # yield一次以刷新前端页面
-        time.sleep(refresh_interval)
-        cnt += 1
-        worker_done = [h.done() for h in futures]
-        # 更好的UI视觉效果
-        observe_win = []
-        # 每个线程都要“喂狗”（看门狗）
-        for thread_index, _ in enumerate(worker_done):
-            mutable[thread_index][1] = time.time()
-        # 在前端打印些好玩的东西
-        for thread_index, _ in enumerate(worker_done):
-            print_something_really_funny = "[ ...`"+mutable[thread_index][0][-scroller_max_len:].\
-                replace('\n', '').replace('`', '.').replace(
-                    ' ', '.').replace('<br/>', '.....').replace('$', '.')+"`... ]"
-            observe_win.append(print_something_really_funny)
-        # 在前端打印些好玩的东西
-        stat_str = ''.join([f'`{mutable[thread_index][2]}`: {obs}\n\n' 
-                            if not done else f'`{mutable[thread_index][2]}`\n\n' 
-                            for thread_index, done, obs in zip(range(len(worker_done)), worker_done, observe_win)])
-        # 在前端打印些好玩的东西
-        chatbot[-1] = [chatbot[-1][0], f'多线程操作已经开始，完成情况: \n\n{stat_str}' + ''.join(['.']*(cnt % 10+1))]
-        yield from update_ui(chatbot=chatbot, history=[]) # 刷新界面
-        if all(worker_done):
-            executor.shutdown()
-            break
-
-    # 异步任务结束
-    gpt_response_collection = []
-    for inputs_show_user, f in zip(inputs_show_user_array, futures):
-        gpt_res = f.result()
-        gpt_response_collection.extend([inputs_show_user, gpt_res])
-    
-    # 是否在结束时，在界面上显示结果
-    if show_user_at_complete:
-        for inputs_show_user, f in zip(inputs_show_user_array, futures):
-            gpt_res = f.result()
-            chatbot.append([inputs_show_user, gpt_res])
-            yield from update_ui(chatbot=chatbot, history=[]) # 刷新界面
-            time.sleep(0.5)
-    return gpt_response_collection
-
-
-
-def read_and_clean_pdf_text(fp):
-    """
-    这个函数用于分割pdf，用了很多trick，逻辑较乱，效果奇好
-
-    **输入参数说明**
-    - `fp`：需要读取和清理文本的pdf文件路径
-
-    **输出参数说明**
-    - `meta_txt`：清理后的文本内容字符串
-    - `page_one_meta`：第一页清理后的文本内容列表
-
-    **函数功能**
-    读取pdf文件并清理其中的文本内容，清理规则包括：
-    - 提取所有块元的文本信息，并合并为一个字符串
-    - 去除短块（字符数小于100）并替换为回车符
-    - 清理多余的空行
-    - 合并小写字母开头的段落块并替换为空格
-    - 清除重复的换行
-    - 将每个换行符替换为两个换行符，使每个段落之间有两个换行符分隔
-    """
-    import fitz, copy
-    import re
-    import numpy as np
-    from colorful import print亮黄, print亮绿
-    fc = 0  # Index 0 文本
-    fs = 1  # Index 1 字体
-    fb = 2  # Index 2 框框
-    REMOVE_FOOT_NOTE = True # 是否丢弃掉 不是正文的内容 （比正文字体小，如参考文献、脚注、图注等）
-    REMOVE_FOOT_FFSIZE_PERCENT = 0.95 # 小于正文的？时，判定为不是正文（有些文章的正文部分字体大小不是100%统一的，有肉眼不可见的小变化）
-    def primary_ffsize(l):
-        """
-        提取文本块主字体
-        """
-        fsize_statiscs = {}
-        for wtf in l['spans']:
-            if wtf['size'] not in fsize_statiscs: fsize_statiscs[wtf['size']] = 0
-            fsize_statiscs[wtf['size']] += len(wtf['text'])
-        return max(fsize_statiscs, key=fsize_statiscs.get)
-        
-    def ffsize_same(a,b):
-        """
-        提取字体大小是否近似相等
-        """
-        return abs((a-b)/max(a,b)) < 0.02
-
-    with fitz.open(fp) as doc:
-        meta_txt = []
-        meta_font = []
-
-        meta_line = []
-        meta_span = []
-        ############################## <第 1 步，搜集初始信息> ##################################
-        for index, page in enumerate(doc):
-            # file_content += page.get_text()
-            text_areas = page.get_text("dict")  # 获取页面上的文本信息
-            for t in text_areas['blocks']:
-                if 'lines' in t:
-                    pf = 998
-                    for l in t['lines']:
-                        txt_line = "".join([wtf['text'] for wtf in l['spans']])
-                        if len(txt_line) == 0: continue
-                        pf = primary_ffsize(l)
-                        meta_line.append([txt_line, pf, l['bbox'], l])
-                        for wtf in l['spans']: # for l in t['lines']:
-                            meta_span.append([wtf['text'], wtf['size'], len(wtf['text'])])
-                    # meta_line.append(["NEW_BLOCK", pf])
-            # 块元提取                           for each word segment with in line                       for each line         cross-line words                          for each block
-            meta_txt.extend([" ".join(["".join([wtf['text'] for wtf in l['spans']]) for l in t['lines']]).replace(
-                '- ', '') for t in text_areas['blocks'] if 'lines' in t])
-            meta_font.extend([np.mean([np.mean([wtf['size'] for wtf in l['spans']])
-                             for l in t['lines']]) for t in text_areas['blocks'] if 'lines' in t])
-            if index == 0:
-                page_one_meta = [" ".join(["".join([wtf['text'] for wtf in l['spans']]) for l in t['lines']]).replace(
-                    '- ', '') for t in text_areas['blocks'] if 'lines' in t]
-                
-        ############################## <第 2 步，获取正文主字体> ##################################
-        try:
-            fsize_statiscs = {}
-            for span in meta_span:
-                if span[1] not in fsize_statiscs: fsize_statiscs[span[1]] = 0
-                fsize_statiscs[span[1]] += span[2]
-            main_fsize = max(fsize_statiscs, key=fsize_statiscs.get)
-            if REMOVE_FOOT_NOTE:
-                give_up_fize_threshold = main_fsize * REMOVE_FOOT_FFSIZE_PERCENT
-        except:
-            raise RuntimeError(f'抱歉, 我们暂时无法解析此PDF文档: {fp}。')
-        ############################## <第 3 步，切分和重新整合> ##################################
-        mega_sec = []
-        sec = []
-        for index, line in enumerate(meta_line):
-            if index == 0: 
-                sec.append(line[fc])
-                continue
-            if REMOVE_FOOT_NOTE:
-                if meta_line[index][fs] <= give_up_fize_threshold:
-                    continue
-            if ffsize_same(meta_line[index][fs], meta_line[index-1][fs]):
-                # 尝试识别段落
-                if meta_line[index][fc].endswith('.') and\
-                    (meta_line[index-1][fc] != 'NEW_BLOCK') and \
-                    (meta_line[index][fb][2] - meta_line[index][fb][0]) < (meta_line[index-1][fb][2] - meta_line[index-1][fb][0]) * 0.7:
-                    sec[-1] += line[fc]
-                    sec[-1] += "\n\n"
-                else:
-                    sec[-1] += " "
-                    sec[-1] += line[fc]
-            else:
-                if (index+1 < len(meta_line)) and \
-                    meta_line[index][fs] > main_fsize:
-                    # 单行 + 字体大
-                    mega_sec.append(copy.deepcopy(sec))
-                    sec = []
-                    sec.append("# " + line[fc])
-                else:
-                    # 尝试识别section
-                    if meta_line[index-1][fs] > meta_line[index][fs]:
-                        sec.append("\n" + line[fc])
-                    else:
-                        sec.append(line[fc])
-        mega_sec.append(copy.deepcopy(sec))
-
-        finals = []
-        for ms in mega_sec:
-            final = " ".join(ms)
-            final = final.replace('- ', ' ')
-            finals.append(final)
-        meta_txt = finals
-
-        ############################## <第 4 步，乱七八糟的后处理> ##################################
-        def 把字符太少的块清除为回车(meta_txt):
-            for index, block_txt in enumerate(meta_txt):
-                if len(block_txt) < 100:
-                    meta_txt[index] = '\n'
-            return meta_txt
-        meta_txt = 把字符太少的块清除为回车(meta_txt)
-
-        def 清理多余的空行(meta_txt):
-            for index in reversed(range(1, len(meta_txt))):
-                if meta_txt[index] == '\n' and meta_txt[index-1] == '\n':
-                    meta_txt.pop(index)
-            return meta_txt
-        meta_txt = 清理多余的空行(meta_txt)
-
-        def 合并小写开头的段落块(meta_txt):
-            def starts_with_lowercase_word(s):
-                pattern = r"^[a-z]+"
-                match = re.match(pattern, s)
-                if match:
-                    return True
-                else:
-                    return False
-            for _ in range(100):
-                for index, block_txt in enumerate(meta_txt):
-                    if starts_with_lowercase_word(block_txt):
-                        if meta_txt[index-1] != '\n':
-                            meta_txt[index-1] += ' '
-                        else:
-                            meta_txt[index-1] = ''
-                        meta_txt[index-1] += meta_txt[index]
-                        meta_txt[index] = '\n'
-            return meta_txt
-        meta_txt = 合并小写开头的段落块(meta_txt)
-        meta_txt = 清理多余的空行(meta_txt)
-
-        meta_txt = '\n'.join(meta_txt)
-        # 清除重复的换行
-        for _ in range(5):
-            meta_txt = meta_txt.replace('\n\n', '\n')
-
-        # 换行 -> 双换行
-        meta_txt = meta_txt.replace('\n', '\n\n')
-
-        ############################## <第 5 步，展示分割效果> ##################################
-        # for f in finals:
-        #    print亮黄(f)
-        #    print亮绿('***************************')
-
-    return meta_txt, page_one_meta
-
-
-def get_files_from_everything(txt, type): # type='.md'
-    """
-    这个函数是用来获取指定目录下所有指定类型（如.md）的文件，并且对于网络上的文件，也可以获取它。
-    下面是对每个参数和返回值的说明：
-    参数 
-    - txt: 路径或网址，表示要搜索的文件或者文件夹路径或网络上的文件。 
-    - type: 字符串，表示要搜索的文件类型。默认是.md。
-    返回值 
-    - success: 布尔值，表示函数是否成功执行。 
-    - file_manifest: 文件路径列表，里面包含以指定类型为后缀名的所有文件的绝对路径。 
-    - project_folder: 字符串，表示文件所在的文件夹路径。如果是网络上的文件，就是临时文件夹的路径。
-    该函数详细注释已添加，请确认是否满足您的需要。
-    """
-    import glob, os
-
-    success = True
-    if txt.startswith('http'):
-        # 网络的远程文件
-        import requests
-        from toolbox import get_conf
-        from toolbox import get_log_folder, gen_time_str
-        proxies = get_conf('proxies')
-        try:
-            r = requests.get(txt, proxies=proxies)
-        except:
-            raise ConnectionRefusedError(f"无法下载资源{txt}，请检查。")
-        path = os.path.join(get_log_folder(plugin_name='web_download'), gen_time_str()+type)
-        with open(path, 'wb+') as f: f.write(r.content)
-        project_folder = get_log_folder(plugin_name='web_download')
-        file_manifest = [path]
-    elif txt.endswith(type):
-        # 直接给定文件
-        file_manifest = [txt]
-        project_folder = os.path.dirname(txt)
-    elif os.path.exists(txt):
-        # 本地路径，递归搜索
-        project_folder = txt
-        file_manifest = [f for f in glob.glob(f'{project_folder}/**/*'+type, recursive=True)]
-        if len(file_manifest) == 0:
-            success = False
-    else:
-        project_folder = None
-        file_manifest = []
-        success = False
-
-    return success, file_manifest, project_folder
-
-
-
-@Singleton
-class nougat_interface():
-    def __init__(self):
-        self.threadLock = threading.Lock()
-
-    def nougat_with_timeout(self, command, cwd, timeout=3600):
-        import subprocess
-        from toolbox import ProxyNetworkActivate
-        logging.info(f'正在执行命令 {command}')
-        with ProxyNetworkActivate("Nougat_Download"):
-            process = subprocess.Popen(command, shell=True, cwd=cwd, env=os.environ)
-        try:
-            stdout, stderr = process.communicate(timeout=timeout)
-        except subprocess.TimeoutExpired:
-            process.kill()
-            stdout, stderr = process.communicate()
-            print("Process timed out!")
-            return False
-        return True
-
-
-    def NOUGAT_parse_pdf(self, fp, chatbot, history):
-        from toolbox import update_ui_lastest_msg
-
-        yield from update_ui_lastest_msg("正在解析论文, 请稍候。进度：正在排队, 等待线程锁...", 
-                                         chatbot=chatbot, history=history, delay=0)
-        self.threadLock.acquire()
-        import glob, threading, os
-        from toolbox import get_log_folder, gen_time_str
-        dst = os.path.join(get_log_folder(plugin_name='nougat'), gen_time_str())
-        os.makedirs(dst)
-
-        yield from update_ui_lastest_msg("正在解析论文, 请稍候。进度：正在加载NOUGAT... （提示：首次运行需要花费较长时间下载NOUGAT参数）", 
-                                         chatbot=chatbot, history=history, delay=0)
-        self.nougat_with_timeout(f'nougat --out "{os.path.abspath(dst)}" "{os.path.abspath(fp)}"', os.getcwd(), timeout=3600)
-        res = glob.glob(os.path.join(dst,'*.mmd'))
-        if len(res) == 0:
-            self.threadLock.release()
-            raise RuntimeError("Nougat解析论文失败。")
-        self.threadLock.release()
-        return res[0]
-
-
-
-
-def try_install_deps(deps, reload_m=[]):
-    import subprocess, sys, importlib
-    for dep in deps:
-        subprocess.check_call([sys.executable, '-m', 'pip', 'install', '--user', dep])
-    import site
-    importlib.reload(site)
-    for m in reload_m:
-        importlib.reload(__import__(m))
-
-
-def get_plugin_arg(plugin_kwargs, key, default):
-    # 如果参数是空的
-    if (key in plugin_kwargs) and (plugin_kwargs[key] == ""): plugin_kwargs.pop(key)
-    # 正常情况
-    return plugin_kwargs.get(key, default)

crazy_functions/game_fns/game_ascii_art.py

@@ -1,42 +0,0 @@
-from toolbox import CatchException, update_ui, update_ui_lastest_msg
-from crazy_functions.multi_stage.multi_stage_utils import GptAcademicGameBaseState
-from crazy_functions.crazy_utils import request_gpt_model_in_new_thread_with_ui_alive
-from request_llms.bridge_all import predict_no_ui_long_connection
-from crazy_functions.game_fns.game_utils import get_code_block, is_same_thing
-import random
-
-
-class MiniGame_ASCII_Art(GptAcademicGameBaseState):
-    def step(self, prompt, chatbot, history):
-        if self.step_cnt == 0:  
-            chatbot.append(["我画你猜（动物）", "请稍等..."])
-        else:
-            if prompt.strip() == 'exit':
-                self.delete_game = True
-                yield from update_ui_lastest_msg(lastmsg=f"谜底是{self.obj}，游戏结束。", chatbot=chatbot, history=history, delay=0.)
-                return
-            chatbot.append([prompt, ""])
-        yield from update_ui(chatbot=chatbot, history=history)
-
-        if self.step_cnt == 0:
-            self.lock_plugin(chatbot)
-            self.cur_task = 'draw'
-
-        if self.cur_task == 'draw':
-            avail_obj = ["狗","猫","鸟","鱼","老鼠","蛇"]
-            self.obj = random.choice(avail_obj)
-            inputs = "I want to play a game called Guess the ASCII art. You can draw the ASCII art and I will try to guess it. " + \
-                f"This time you draw a {self.obj}. Note that you must not indicate what you have draw in the text, and you should only produce the ASCII art wrapped by ```. "
-            raw_res = predict_no_ui_long_connection(inputs=inputs, llm_kwargs=self.llm_kwargs, history=[], sys_prompt="")
-            self.cur_task = 'identify user guess'
-            res = get_code_block(raw_res)
-            history += ['', f'the answer is {self.obj}', inputs, res]
-            yield from update_ui_lastest_msg(lastmsg=res, chatbot=chatbot, history=history, delay=0.)
-
-        elif self.cur_task == 'identify user guess':
-            if is_same_thing(self.obj, prompt, self.llm_kwargs):
-                self.delete_game = True
-                yield from update_ui_lastest_msg(lastmsg="你猜对了！", chatbot=chatbot, history=history, delay=0.)
-            else:
-                self.cur_task = 'identify user guess'
-                yield from update_ui_lastest_msg(lastmsg="猜错了，再试试，输入“exit”获取答案。", chatbot=chatbot, history=history, delay=0.)

crazy_functions/game_fns/game_interactive_story.py

@@ -1,212 +0,0 @@
-prompts_hs = """ 请以“{headstart}”为开头，编写一个小说的第一幕。
-
-- 尽量短，不要包含太多情节，因为你接下来将会与用户互动续写下面的情节，要留出足够的互动空间。
-- 出现人物时，给出人物的名字。
-- 积极地运用环境描写、人物描写等手法，让读者能够感受到你的故事世界。
-- 积极地运用修辞手法，比如比喻、拟人、排比、对偶、夸张等等。
-- 字数要求：第一幕的字数少于300字，且少于2个段落。
-"""
-
-prompts_interact = """ 小说的前文回顾：
-「
-{previously_on_story}
-」
-
-你是一个作家，根据以上的情节，给出4种不同的后续剧情发展方向，每个发展方向都精明扼要地用一句话说明。稍后，我将在这4个选择中，挑选一种剧情发展。
-
-输出格式例如：
-1. 后续剧情发展1
-2. 后续剧情发展2
-3. 后续剧情发展3
-4. 后续剧情发展4
-"""
-
-
-prompts_resume = """小说的前文回顾：
-「
-{previously_on_story}
-」
-
-你是一个作家，我们正在互相讨论，确定后续剧情的发展。
-在以下的剧情发展中，
-「
-{choice}
-」
-我认为更合理的是：{user_choice}。
-请在前文的基础上（不要重复前文），围绕我选定的剧情情节，编写小说的下一幕。
-
-- 禁止杜撰不符合我选择的剧情。
-- 尽量短，不要包含太多情节，因为你接下来将会与用户互动续写下面的情节，要留出足够的互动空间。
-- 不要重复前文。
-- 出现人物时，给出人物的名字。
-- 积极地运用环境描写、人物描写等手法，让读者能够感受到你的故事世界。
-- 积极地运用修辞手法，比如比喻、拟人、排比、对偶、夸张等等。
-- 小说的下一幕字数少于300字，且少于2个段落。
-"""
-
-
-prompts_terminate = """小说的前文回顾：
-「
-{previously_on_story}
-」
-
-你是一个作家，我们正在互相讨论，确定后续剧情的发展。
-现在，故事该结束了，我认为最合理的故事结局是：{user_choice}。
-
-请在前文的基础上（不要重复前文），编写小说的最后一幕。
-
-- 不要重复前文。
-- 出现人物时，给出人物的名字。
-- 积极地运用环境描写、人物描写等手法，让读者能够感受到你的故事世界。
-- 积极地运用修辞手法，比如比喻、拟人、排比、对偶、夸张等等。
-- 字数要求：最后一幕的字数少于1000字。
-"""
-
-
-from toolbox import CatchException, update_ui, update_ui_lastest_msg
-from crazy_functions.multi_stage.multi_stage_utils import GptAcademicGameBaseState
-from crazy_functions.crazy_utils import request_gpt_model_in_new_thread_with_ui_alive
-from request_llms.bridge_all import predict_no_ui_long_connection
-from crazy_functions.game_fns.game_utils import get_code_block, is_same_thing
-import random
-
-
-class MiniGame_ResumeStory(GptAcademicGameBaseState):
-    story_headstart = [
-        '先行者知道，他现在是全宇宙中唯一的一个人了。',
-        '深夜，一个年轻人穿过天安门广场向纪念堂走去。在二十二世纪编年史中，计算机把他的代号定为M102。',
-        '他知道，这最后一课要提前讲了。又一阵剧痛从肝部袭来，几乎使他晕厥过去。',
-        '在距地球五万光年的远方，在银河系的中心，一场延续了两万年的星际战争已接近尾声。那里的太空中渐渐隐现出一个方形区域，仿佛灿烂的群星的背景被剪出一个方口。',
-        '伊依一行三人乘坐一艘游艇在南太平洋上做吟诗航行，他们的目的地是南极，如果几天后能顺利到达那里，他们将钻出地壳去看诗云。',
-        '很多人生来就会莫名其妙地迷上一样东西，仿佛他的出生就是要和这东西约会似的，正是这样，圆圆迷上了肥皂泡。'
-    ]
-
-
-    def begin_game_step_0(self, prompt, chatbot, history):
-        # init game at step 0
-        self.headstart = random.choice(self.story_headstart)
-        self.story = []
-        chatbot.append(["互动写故事", f"这次的故事开头是：{self.headstart}"])
-        self.sys_prompt_ = '你是一个想象力丰富的杰出作家。正在与你的朋友互动，一起写故事，因此你每次写的故事段落应少于300字（结局除外）。'
-        
-        
-    def generate_story_image(self, story_paragraph):
-        try:
-            from crazy_functions.图片生成 import gen_image
-            prompt_ = predict_no_ui_long_connection(inputs=story_paragraph, llm_kwargs=self.llm_kwargs, history=[], sys_prompt='你需要根据用户给出的小说段落，进行简短的环境描写。要求：80字以内。')
-            image_url, image_path = gen_image(self.llm_kwargs, prompt_, '512x512', model="dall-e-2", quality='standard', style='natural')
-            return f'<br/><div align="center"><img src="file={image_path}"></div>'
-        except:
-            return ''
-        
-    def step(self, prompt, chatbot, history):
-        
-        """
-        首先，处理游戏初始化等特殊情况
-        """
-        if self.step_cnt == 0:  
-            self.begin_game_step_0(prompt, chatbot, history)
-            self.lock_plugin(chatbot)
-            self.cur_task = 'head_start'
-        else:
-            if prompt.strip() == 'exit' or prompt.strip() == '结束剧情':
-                # should we terminate game here?
-                self.delete_game = True
-                yield from update_ui_lastest_msg(lastmsg=f"游戏结束。", chatbot=chatbot, history=history, delay=0.)
-                return
-            if '剧情收尾' in prompt:
-                self.cur_task = 'story_terminate'
-            # # well, game resumes
-            # chatbot.append([prompt, ""])
-        # update ui, don't keep the user waiting
-        yield from update_ui(chatbot=chatbot, history=history)
-
-
-        """
-        处理游戏的主体逻辑
-        """
-        if self.cur_task == 'head_start':
-            """
-            这是游戏的第一步
-            """
-            inputs_ = prompts_hs.format(headstart=self.headstart)
-            history_ = []
-            story_paragraph = yield from request_gpt_model_in_new_thread_with_ui_alive(
-                inputs_, '故事开头', self.llm_kwargs, 
-                chatbot, history_, self.sys_prompt_
-            )
-            self.story.append(story_paragraph)
-            # # 配图
-            yield from update_ui_lastest_msg(lastmsg=story_paragraph + '<br/>正在生成插图中 ...', chatbot=chatbot, history=history, delay=0.)
-            yield from update_ui_lastest_msg(lastmsg=story_paragraph + '<br/>'+ self.generate_story_image(story_paragraph), chatbot=chatbot, history=history, delay=0.)
-
-            # # 构建后续剧情引导
-            previously_on_story = ""
-            for s in self.story:
-                previously_on_story += s + '\n'
-            inputs_ = prompts_interact.format(previously_on_story=previously_on_story)
-            history_ = []
-            self.next_choices = yield from request_gpt_model_in_new_thread_with_ui_alive(
-                inputs_, '请在以下几种故事走向中，选择一种（当然，您也可以选择给出其他故事走向）：', self.llm_kwargs, 
-                chatbot,
-                history_,
-                self.sys_prompt_
-            )
-            self.cur_task = 'user_choice'
-
-
-        elif self.cur_task == 'user_choice':
-            """
-            根据用户的提示，确定故事的下一步
-            """
-            if '请在以下几种故事走向中，选择一种' in chatbot[-1][0]: chatbot.pop(-1)
-            previously_on_story = ""
-            for s in self.story:
-                previously_on_story += s + '\n'
-            inputs_ = prompts_resume.format(previously_on_story=previously_on_story, choice=self.next_choices, user_choice=prompt)
-            history_ = []
-            story_paragraph = yield from request_gpt_model_in_new_thread_with_ui_alive(
-                inputs_, f'下一段故事（您的选择是：{prompt}）。', self.llm_kwargs, 
-                chatbot, history_, self.sys_prompt_
-            )
-            self.story.append(story_paragraph)
-            # # 配图
-            yield from update_ui_lastest_msg(lastmsg=story_paragraph + '<br/>正在生成插图中 ...', chatbot=chatbot, history=history, delay=0.)
-            yield from update_ui_lastest_msg(lastmsg=story_paragraph + '<br/>'+ self.generate_story_image(story_paragraph), chatbot=chatbot, history=history, delay=0.)
-
-            # # 构建后续剧情引导
-            previously_on_story = ""
-            for s in self.story:
-                previously_on_story += s + '\n'
-            inputs_ = prompts_interact.format(previously_on_story=previously_on_story)
-            history_ = []
-            self.next_choices = yield from request_gpt_model_in_new_thread_with_ui_alive(
-                inputs_, 
-                '请在以下几种故事走向中，选择一种。当然，您也可以给出您心中的其他故事走向。另外，如果您希望剧情立即收尾，请输入剧情走向，并以“剧情收尾”四个字提示程序。', self.llm_kwargs, 
-                chatbot, 
-                history_, 
-                self.sys_prompt_
-            )
-            self.cur_task = 'user_choice'
-
-
-        elif self.cur_task == 'story_terminate':
-            """
-            根据用户的提示，确定故事的结局
-            """
-            previously_on_story = ""
-            for s in self.story:
-                previously_on_story += s + '\n'
-            inputs_ = prompts_terminate.format(previously_on_story=previously_on_story, user_choice=prompt)
-            history_ = []
-            story_paragraph = yield from request_gpt_model_in_new_thread_with_ui_alive(
-                inputs_, f'故事收尾（您的选择是：{prompt}）。', self.llm_kwargs, 
-                chatbot, history_, self.sys_prompt_
-            )
-            # # 配图
-            yield from update_ui_lastest_msg(lastmsg=story_paragraph + '<br/>正在生成插图中 ...', chatbot=chatbot, history=history, delay=0.)
-            yield from update_ui_lastest_msg(lastmsg=story_paragraph + '<br/>'+ self.generate_story_image(story_paragraph), chatbot=chatbot, history=history, delay=0.)
-
-            # terminate game
-            self.delete_game = True
-            return

crazy_functions/game_fns/game_utils.py

@@ -1,35 +0,0 @@
-
-from crazy_functions.json_fns.pydantic_io import GptJsonIO, JsonStringError
-from request_llms.bridge_all import predict_no_ui_long_connection
-def get_code_block(reply):
-    import re
-    pattern = r"```([\s\S]*?)```" # regex pattern to match code blocks
-    matches = re.findall(pattern, reply) # find all code blocks in text
-    if len(matches) == 1: 
-        return "```" + matches[0] + "```" #  code block
-    raise RuntimeError("GPT is not generating proper code.")
-
-def is_same_thing(a, b, llm_kwargs):
-    from pydantic import BaseModel, Field
-    class IsSameThing(BaseModel):
-        is_same_thing: bool = Field(description="determine whether two objects are same thing.", default=False)
-        
-    def run_gpt_fn(inputs, sys_prompt, history=[]): 
-        return predict_no_ui_long_connection(
-            inputs=inputs, llm_kwargs=llm_kwargs, 
-            history=history, sys_prompt=sys_prompt, observe_window=[]
-        )
-
-    gpt_json_io = GptJsonIO(IsSameThing)
-    inputs_01 = "Identity whether the user input and the target is the same thing: \n target object: {a} \n user input object: {b} \n\n\n".format(a=a, b=b)
-    inputs_01 += "\n\n\n Note that the user may describe the target object with a different language, e.g. cat and 猫 are the same thing."
-    analyze_res_cot_01 = run_gpt_fn(inputs_01, "", [])
-    
-    inputs_02 = inputs_01 + gpt_json_io.format_instructions
-    analyze_res = run_gpt_fn(inputs_02, "", [inputs_01, analyze_res_cot_01])
-
-    try:
-        res = gpt_json_io.generate_output_auto_repair(analyze_res, run_gpt_fn)
-        return res.is_same_thing
-    except JsonStringError as e:
-        return False

crazy_functions/gen_fns/gen_fns_shared.py

@@ -1,70 +0,0 @@
-import time
-import importlib
-from toolbox import trimmed_format_exc, gen_time_str, get_log_folder
-from toolbox import CatchException, update_ui, gen_time_str, trimmed_format_exc, is_the_upload_folder
-from toolbox import promote_file_to_downloadzone, get_log_folder, update_ui_lastest_msg
-import multiprocessing
-
-def get_class_name(class_string):
-    import re
-    # Use regex to extract the class name
-    class_name = re.search(r'class (\w+)\(', class_string).group(1)
-    return class_name
-
-def try_make_module(code, chatbot):
-    module_file = 'gpt_fn_' + gen_time_str().replace('-','_')
-    fn_path = f'{get_log_folder(plugin_name="gen_plugin_verify")}/{module_file}.py'
-    with open(fn_path, 'w', encoding='utf8') as f: f.write(code)
-    promote_file_to_downloadzone(fn_path, chatbot=chatbot)
-    class_name = get_class_name(code)
-    manager = multiprocessing.Manager()
-    return_dict = manager.dict()
-    p = multiprocessing.Process(target=is_function_successfully_generated, args=(fn_path, class_name, return_dict))
-    # only has 10 seconds to run
-    p.start(); p.join(timeout=10)
-    if p.is_alive(): p.terminate(); p.join()
-    p.close()
-    return return_dict["success"], return_dict['traceback']
-
-# check is_function_successfully_generated
-def is_function_successfully_generated(fn_path, class_name, return_dict):
-    return_dict['success'] = False
-    return_dict['traceback'] = ""
-    try:
-        # Create a spec for the module
-        module_spec = importlib.util.spec_from_file_location('example_module', fn_path)
-        # Load the module
-        example_module = importlib.util.module_from_spec(module_spec)
-        module_spec.loader.exec_module(example_module)
-        # Now you can use the module
-        some_class = getattr(example_module, class_name)
-        # Now you can create an instance of the class
-        instance = some_class()
-        return_dict['success'] = True
-        return 
-    except:
-        return_dict['traceback'] = trimmed_format_exc()
-        return
-    
-def subprocess_worker(code, file_path, return_dict):
-    return_dict['result'] = None
-    return_dict['success'] = False
-    return_dict['traceback'] = ""
-    try:
-        module_file = 'gpt_fn_' + gen_time_str().replace('-','_')
-        fn_path = f'{get_log_folder(plugin_name="gen_plugin_run")}/{module_file}.py'
-        with open(fn_path, 'w', encoding='utf8') as f: f.write(code)
-        class_name = get_class_name(code)
-        # Create a spec for the module
-        module_spec = importlib.util.spec_from_file_location('example_module', fn_path)
-        # Load the module
-        example_module = importlib.util.module_from_spec(module_spec)
-        module_spec.loader.exec_module(example_module)
-        # Now you can use the module
-        some_class = getattr(example_module, class_name)
-        # Now you can create an instance of the class
-        instance = some_class()
-        return_dict['result'] = instance.run(file_path)
-        return_dict['success'] = True
-    except:
-        return_dict['traceback'] = trimmed_format_exc()

crazy_functions/ipc_fns/mp.py

@@ -1,37 +0,0 @@
-import platform 
-import pickle
-import multiprocessing
-
-def run_in_subprocess_wrapper_func(v_args):
-    func, args, kwargs, return_dict, exception_dict = pickle.loads(v_args)
-    import sys
-    try:
-        result = func(*args, **kwargs)
-        return_dict['result'] = result
-    except Exception as e:
-        exc_info = sys.exc_info()
-        exception_dict['exception'] = exc_info
-
-def run_in_subprocess_with_timeout(func, timeout=60):
-    if platform.system() == 'Linux':
-        def wrapper(*args, **kwargs):
-            return_dict = multiprocessing.Manager().dict()
-            exception_dict = multiprocessing.Manager().dict()
-            v_args = pickle.dumps((func, args, kwargs, return_dict, exception_dict))
-            process = multiprocessing.Process(target=run_in_subprocess_wrapper_func, args=(v_args,))
-            process.start()
-            process.join(timeout)
-            if process.is_alive():
-                process.terminate()
-                raise TimeoutError(f'功能单元{str(func)}未能在规定时间内完成任务')
-            process.close()
-            if 'exception' in exception_dict:
-                # ooops, the subprocess ran into an exception
-                exc_info = exception_dict['exception']
-                raise exc_info[1].with_traceback(exc_info[2])
-            if 'result' in return_dict.keys():
-                # If the subprocess ran successfully, return the result
-                return return_dict['result']
-        return wrapper
-    else:
-        return func

crazy_functions/json_fns/pydantic_io.py

@@ -1,111 +0,0 @@
-"""
-https://github.com/langchain-ai/langchain/blob/master/docs/extras/modules/model_io/output_parsers/pydantic.ipynb
-
-Example 1.
-
-# Define your desired data structure.
-class Joke(BaseModel):
-    setup: str = Field(description="question to set up a joke")
-    punchline: str = Field(description="answer to resolve the joke")
-
-    # You can add custom validation logic easily with Pydantic.
-    @validator("setup")
-    def question_ends_with_question_mark(cls, field):
-        if field[-1] != "?":
-            raise ValueError("Badly formed question!")
-        return field
-
-
-Example 2.
-
-# Here's another example, but with a compound typed field.
-class Actor(BaseModel):
-    name: str = Field(description="name of an actor")
-    film_names: List[str] = Field(description="list of names of films they starred in")
-"""
-
-import json, re, logging
-
-
-PYDANTIC_FORMAT_INSTRUCTIONS = """The output should be formatted as a JSON instance that conforms to the JSON schema below.
-
-As an example, for the schema {{"properties": {{"foo": {{"title": "Foo", "description": "a list of strings", "type": "array", "items": {{"type": "string"}}}}}}, "required": ["foo"]}}
-the object {{"foo": ["bar", "baz"]}} is a well-formatted instance of the schema. The object {{"properties": {{"foo": ["bar", "baz"]}}}} is not well-formatted.
-
-Here is the output schema:
-```
-{schema}
-```"""
-
-
-PYDANTIC_FORMAT_INSTRUCTIONS_SIMPLE = """The output should be formatted as a JSON instance that conforms to the JSON schema below.
-```
-{schema}
-```"""
-
-class JsonStringError(Exception): ...
-
-class GptJsonIO():
-
-    def __init__(self, schema, example_instruction=True):
-        self.pydantic_object = schema
-        self.example_instruction = example_instruction
-        self.format_instructions = self.generate_format_instructions()
-
-    def generate_format_instructions(self):
-        schema = self.pydantic_object.schema()
-
-        # Remove extraneous fields.
-        reduced_schema = schema
-        if "title" in reduced_schema:
-            del reduced_schema["title"]
-        if "type" in reduced_schema:
-            del reduced_schema["type"]
-        # Ensure json in context is well-formed with double quotes.
-        if self.example_instruction:
-            schema_str = json.dumps(reduced_schema)
-            return PYDANTIC_FORMAT_INSTRUCTIONS.format(schema=schema_str)
-        else:
-            return PYDANTIC_FORMAT_INSTRUCTIONS_SIMPLE.format(schema=schema_str)
-
-    def generate_output(self, text):
-        # Greedy search for 1st json candidate.
-        match = re.search(
-            r"\{.*\}", text.strip(), re.MULTILINE | re.IGNORECASE | re.DOTALL
-        )
-        json_str = ""
-        if match: json_str = match.group()
-        json_object = json.loads(json_str, strict=False)
-        final_object = self.pydantic_object.parse_obj(json_object)
-        return final_object
-
-    def generate_repair_prompt(self, broken_json, error):
-        prompt = "Fix a broken json string.\n\n" + \
-                 "(1) The broken json string need to fix is: \n\n" + \
-                 "```" + "\n" + \
-                 broken_json + "\n" + \
-                 "```" + "\n\n" + \
-                 "(2) The error message is: \n\n" + \
-                 error + "\n\n" + \
-                "Now, fix this json string. \n\n"
-        return prompt
-    
-    def generate_output_auto_repair(self, response, gpt_gen_fn):
-        """
-        response: string containing canidate json
-        gpt_gen_fn: gpt_gen_fn(inputs, sys_prompt)
-        """
-        try:
-            result = self.generate_output(response)
-        except Exception as e:
-            try:
-                logging.info(f'Repairing json：{response}')
-                repair_prompt = self.generate_repair_prompt(broken_json = response, error=repr(e))
-                result = self.generate_output(gpt_gen_fn(repair_prompt, self.format_instructions))
-                logging.info('Repaire json success.')
-            except Exception as e:
-                # 没辙了，放弃治疗
-                logging.info('Repaire json fail.')
-                raise JsonStringError('Cannot repair json.', str(e))
-        return result
-

crazy_functions/latex_fns/latex_actions.py

@@ -1,467 +0,0 @@
-from toolbox import update_ui, update_ui_lastest_msg, get_log_folder
-from toolbox import get_conf, objdump, objload, promote_file_to_downloadzone
-from .latex_toolbox import PRESERVE, TRANSFORM
-from .latex_toolbox import set_forbidden_text, set_forbidden_text_begin_end, set_forbidden_text_careful_brace
-from .latex_toolbox import reverse_forbidden_text_careful_brace, reverse_forbidden_text, convert_to_linklist, post_process
-from .latex_toolbox import fix_content, find_main_tex_file, merge_tex_files, compile_latex_with_timeout
-from .latex_toolbox import find_title_and_abs
-
-import os, shutil
-import re
-import numpy as np
-
-pj = os.path.join
-
-
-def split_subprocess(txt, project_folder, return_dict, opts):
-    """
-    break down latex file to a linked list,
-    each node use a preserve flag to indicate whether it should
-    be proccessed by GPT.
-    """
-    text = txt
-    mask = np.zeros(len(txt), dtype=np.uint8) + TRANSFORM
-
-    # 吸收title与作者以上的部分
-    text, mask = set_forbidden_text(text, mask, r"^(.*?)\\maketitle", re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, r"^(.*?)\\begin{document}", re.DOTALL)
-    # 吸收iffalse注释
-    text, mask = set_forbidden_text(text, mask, r"\\iffalse(.*?)\\fi", re.DOTALL)
-    # 吸收在42行以内的begin-end组合
-    text, mask = set_forbidden_text_begin_end(text, mask, r"\\begin\{([a-z\*]*)\}(.*?)\\end\{\1\}", re.DOTALL, limit_n_lines=42)
-    # 吸收匿名公式
-    text, mask = set_forbidden_text(text, mask, [ r"\$\$([^$]+)\$\$",  r"\\\[.*?\\\]" ], re.DOTALL)
-    # 吸收其他杂项
-    text, mask = set_forbidden_text(text, mask, [ r"\\section\{(.*?)\}", r"\\section\*\{(.*?)\}", r"\\subsection\{(.*?)\}", r"\\subsubsection\{(.*?)\}" ])
-    text, mask = set_forbidden_text(text, mask, [ r"\\bibliography\{(.*?)\}", r"\\bibliographystyle\{(.*?)\}" ])
-    text, mask = set_forbidden_text(text, mask, r"\\begin\{thebibliography\}.*?\\end\{thebibliography\}", re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, r"\\begin\{lstlisting\}(.*?)\\end\{lstlisting\}", re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, r"\\begin\{wraptable\}(.*?)\\end\{wraptable\}", re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, r"\\begin\{algorithm\}(.*?)\\end\{algorithm\}", re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{wrapfigure\}(.*?)\\end\{wrapfigure\}", r"\\begin\{wrapfigure\*\}(.*?)\\end\{wrapfigure\*\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{figure\}(.*?)\\end\{figure\}", r"\\begin\{figure\*\}(.*?)\\end\{figure\*\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{multline\}(.*?)\\end\{multline\}", r"\\begin\{multline\*\}(.*?)\\end\{multline\*\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{table\}(.*?)\\end\{table\}", r"\\begin\{table\*\}(.*?)\\end\{table\*\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{minipage\}(.*?)\\end\{minipage\}", r"\\begin\{minipage\*\}(.*?)\\end\{minipage\*\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{align\*\}(.*?)\\end\{align\*\}", r"\\begin\{align\}(.*?)\\end\{align\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{equation\}(.*?)\\end\{equation\}", r"\\begin\{equation\*\}(.*?)\\end\{equation\*\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\includepdf\[(.*?)\]\{(.*?)\}", r"\\clearpage", r"\\newpage", r"\\appendix", r"\\tableofcontents", r"\\include\{(.*?)\}"])
-    text, mask = set_forbidden_text(text, mask, [r"\\vspace\{(.*?)\}", r"\\hspace\{(.*?)\}", r"\\label\{(.*?)\}", r"\\begin\{(.*?)\}", r"\\end\{(.*?)\}", r"\\item "])
-    text, mask = set_forbidden_text_careful_brace(text, mask, r"\\hl\{(.*?)\}", re.DOTALL)
-    # reverse 操作必须放在最后
-    text, mask = reverse_forbidden_text_careful_brace(text, mask, r"\\caption\{(.*?)\}", re.DOTALL, forbid_wrapper=True)
-    text, mask = reverse_forbidden_text_careful_brace(text, mask, r"\\abstract\{(.*?)\}", re.DOTALL, forbid_wrapper=True)
-    text, mask = reverse_forbidden_text(text, mask, r"\\begin\{abstract\}(.*?)\\end\{abstract\}", re.DOTALL, forbid_wrapper=True)
-    root = convert_to_linklist(text, mask)
-
-    # 最后一步处理，增强稳健性
-    root = post_process(root)
-
-    # 输出html调试文件，用红色标注处保留区（PRESERVE），用黑色标注转换区（TRANSFORM）
-    with open(pj(project_folder, 'debug_log.html'), 'w', encoding='utf8') as f:
-        segment_parts_for_gpt = []
-        nodes = []
-        node = root
-        while True:
-            nodes.append(node)
-            show_html = node.string.replace('\n','<br/>')
-            if not node.preserve:
-                segment_parts_for_gpt.append(node.string)
-                f.write(f'<p style="color:black;">#{node.range}{show_html}#</p>')
-            else:
-                f.write(f'<p style="color:red;">{show_html}</p>')
-            node = node.next
-            if node is None: break
-
-    for n in nodes: n.next = None   # break
-    return_dict['nodes'] = nodes
-    return_dict['segment_parts_for_gpt'] = segment_parts_for_gpt
-    return return_dict
-
-class LatexPaperSplit():
-    """
-    break down latex file to a linked list,
-    each node use a preserve flag to indicate whether it should
-    be proccessed by GPT.
-    """
-    def __init__(self) -> None:
-        self.nodes = None
-        self.msg = "*{\\scriptsize\\textbf{警告：该PDF由GPT-Academic开源项目调用大语言模型+Latex翻译插件一键生成，" + \
-            "版权归原文作者所有。翻译内容可靠性无保障，请仔细鉴别并以原文为准。" + \
-            "项目Github地址 \\url{https://github.com/binary-husky/gpt_academic/}。"
-        # 请您不要删除或修改这行警告，除非您是论文的原作者（如果您是论文原作者，欢迎加REAME中的QQ联系开发者）
-        self.msg_declare = "为了防止大语言模型的意外谬误产生扩散影响，禁止移除或修改此警告。}}\\\\" 
-        self.title = "unknown"
-        self.abstract = "unknown"
-
-    def read_title_and_abstract(self, txt):
-        try:
-            title, abstract = find_title_and_abs(txt)
-            if title is not None: 
-                self.title = title.replace('\n', ' ').replace('\\\\', ' ').replace('  ', '').replace('  ', '')
-            if abstract is not None: 
-                self.abstract = abstract.replace('\n', ' ').replace('\\\\', ' ').replace('  ', '').replace('  ', '')
-        except:
-            pass
-
-    def merge_result(self, arr, mode, msg, buggy_lines=[], buggy_line_surgery_n_lines=10):
-        """
-        Merge the result after the GPT process completed
-        """
-        result_string = ""
-        node_cnt = 0
-        line_cnt = 0
-        
-        for node in self.nodes:
-            if node.preserve:
-                line_cnt += node.string.count('\n')
-                result_string += node.string
-            else:
-                translated_txt = fix_content(arr[node_cnt], node.string)
-                begin_line = line_cnt
-                end_line = line_cnt + translated_txt.count('\n')
-
-                # reverse translation if any error
-                if any([begin_line-buggy_line_surgery_n_lines <= b_line <= end_line+buggy_line_surgery_n_lines for b_line in buggy_lines]):
-                    translated_txt = node.string
-
-                result_string += translated_txt
-                node_cnt += 1
-                line_cnt += translated_txt.count('\n')
-
-        if mode == 'translate_zh':
-            pattern = re.compile(r'\\begin\{abstract\}.*\n')
-            match = pattern.search(result_string)
-            if not match:
-                # match \abstract{xxxx}
-                pattern_compile = re.compile(r"\\abstract\{(.*?)\}", flags=re.DOTALL)
-                match = pattern_compile.search(result_string)
-                position = match.regs[1][0]
-            else:
-                # match \begin{abstract}xxxx\end{abstract}
-                position = match.end()
-            result_string = result_string[:position] + self.msg + msg + self.msg_declare + result_string[position:]
-        return result_string
-
-
-    def split(self, txt, project_folder, opts): 
-        """
-        break down latex file to a linked list,
-        each node use a preserve flag to indicate whether it should
-        be proccessed by GPT.
-        P.S. use multiprocessing to avoid timeout error
-        """
-        import multiprocessing
-        manager = multiprocessing.Manager()
-        return_dict = manager.dict()
-        p = multiprocessing.Process(
-            target=split_subprocess, 
-            args=(txt, project_folder, return_dict, opts))
-        p.start()
-        p.join()
-        p.close()
-        self.nodes = return_dict['nodes']
-        self.sp = return_dict['segment_parts_for_gpt']
-        return self.sp
-
-
-class LatexPaperFileGroup():
-    """
-    use tokenizer to break down text according to max_token_limit
-    """
-    def __init__(self):
-        self.file_paths = []
-        self.file_contents = []
-        self.sp_file_contents = []
-        self.sp_file_index = []
-        self.sp_file_tag = []
-        # count_token
-        from request_llms.bridge_all import model_info
-        enc = model_info["gpt-3.5-turbo"]['tokenizer']
-        def get_token_num(txt): return len(enc.encode(txt, disallowed_special=()))
-        self.get_token_num = get_token_num
-
-    def run_file_split(self, max_token_limit=1900):
-        """
-        use tokenizer to break down text according to max_token_limit
-        """
-        for index, file_content in enumerate(self.file_contents):
-            if self.get_token_num(file_content) < max_token_limit:
-                self.sp_file_contents.append(file_content)
-                self.sp_file_index.append(index)
-                self.sp_file_tag.append(self.file_paths[index])
-            else:
-                from crazy_functions.pdf_fns.breakdown_txt import breakdown_text_to_satisfy_token_limit
-                segments = breakdown_text_to_satisfy_token_limit(file_content, max_token_limit)
-                for j, segment in enumerate(segments):
-                    self.sp_file_contents.append(segment)
-                    self.sp_file_index.append(index)
-                    self.sp_file_tag.append(self.file_paths[index] + f".part-{j}.tex")
-
-    def merge_result(self):
-        self.file_result = ["" for _ in range(len(self.file_paths))]
-        for r, k in zip(self.sp_file_result, self.sp_file_index):
-            self.file_result[k] += r
-
-    def write_result(self):
-        manifest = []
-        for path, res in zip(self.file_paths, self.file_result):
-            with open(path + '.polish.tex', 'w', encoding='utf8') as f:
-                manifest.append(path + '.polish.tex')
-                f.write(res)
-        return manifest
-
-
-def Latex精细分解与转化(file_manifest, project_folder, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, mode='proofread', switch_prompt=None, opts=[]):
-    import time, os, re
-    from ..crazy_utils import request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency
-    from .latex_actions import LatexPaperFileGroup, LatexPaperSplit
-
-    #  <-------- 寻找主tex文件 ----------> 
-    maintex = find_main_tex_file(file_manifest, mode)
-    chatbot.append((f"定位主Latex文件", f'[Local Message] 分析结果：该项目的Latex主文件是{maintex}, 如果分析错误, 请立即终止程序, 删除或修改歧义文件, 然后重试。主程序即将开始, 请稍候。'))
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-    time.sleep(3)
-
-    #  <-------- 读取Latex文件, 将多文件tex工程融合为一个巨型tex ----------> 
-    main_tex_basename = os.path.basename(maintex)
-    assert main_tex_basename.endswith('.tex')
-    main_tex_basename_bare = main_tex_basename[:-4]
-    may_exist_bbl = pj(project_folder, f'{main_tex_basename_bare}.bbl')
-    if os.path.exists(may_exist_bbl):
-        shutil.copyfile(may_exist_bbl, pj(project_folder, f'merge.bbl'))
-        shutil.copyfile(may_exist_bbl, pj(project_folder, f'merge_{mode}.bbl'))
-        shutil.copyfile(may_exist_bbl, pj(project_folder, f'merge_diff.bbl'))
-
-    with open(maintex, 'r', encoding='utf-8', errors='replace') as f:
-        content = f.read()
-        merged_content = merge_tex_files(project_folder, content, mode)
-
-    with open(project_folder + '/merge.tex', 'w', encoding='utf-8', errors='replace') as f:
-        f.write(merged_content)
-
-    #  <-------- 精细切分latex文件 ----------> 
-    chatbot.append((f"Latex文件融合完成", f'[Local Message] 正在精细切分latex文件，这需要一段时间计算，文档越长耗时越长，请耐心等待。'))
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-    lps = LatexPaperSplit()
-    lps.read_title_and_abstract(merged_content)
-    res = lps.split(merged_content, project_folder, opts) # 消耗时间的函数
-    #  <-------- 拆分过长的latex片段 ----------> 
-    pfg = LatexPaperFileGroup()
-    for index, r in enumerate(res):
-        pfg.file_paths.append('segment-' + str(index))
-        pfg.file_contents.append(r)
-
-    pfg.run_file_split(max_token_limit=1024)
-    n_split = len(pfg.sp_file_contents)
-
-    #  <-------- 根据需要切换prompt ----------> 
-    inputs_array, sys_prompt_array = switch_prompt(pfg, mode)
-    inputs_show_user_array = [f"{mode} {f}" for f in pfg.sp_file_tag]
-
-    if os.path.exists(pj(project_folder,'temp.pkl')):
-
-        #  <-------- 【仅调试】如果存在调试缓存文件，则跳过GPT请求环节 ----------> 
-        pfg = objload(file=pj(project_folder,'temp.pkl'))
-
-    else:
-        #  <-------- gpt 多线程请求 ----------> 
-        history_array = [[""] for _ in range(n_split)]
-        # LATEX_EXPERIMENTAL, = get_conf('LATEX_EXPERIMENTAL')
-        # if LATEX_EXPERIMENTAL:
-        #     paper_meta = f"The paper you processing is `{lps.title}`, a part of the abstraction is `{lps.abstract}`"
-        #     paper_meta_max_len = 888
-        #     history_array = [[ paper_meta[:paper_meta_max_len] + '...',  "Understand, what should I do?"] for _ in range(n_split)]
-
-        gpt_response_collection = yield from request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency(
-            inputs_array=inputs_array,
-            inputs_show_user_array=inputs_show_user_array,
-            llm_kwargs=llm_kwargs,
-            chatbot=chatbot,
-            history_array=history_array,
-            sys_prompt_array=sys_prompt_array,
-            # max_workers=5,  # 并行任务数量限制, 最多同时执行5个, 其他的排队等待
-            scroller_max_len = 40
-        )
-
-        #  <-------- 文本碎片重组为完整的tex片段 ----------> 
-        pfg.sp_file_result = []
-        for i_say, gpt_say, orig_content in zip(gpt_response_collection[0::2], gpt_response_collection[1::2], pfg.sp_file_contents):
-            pfg.sp_file_result.append(gpt_say)
-        pfg.merge_result()
-
-        # <-------- 临时存储用于调试 ----------> 
-        pfg.get_token_num = None
-        objdump(pfg, file=pj(project_folder,'temp.pkl'))
-
-    write_html(pfg.sp_file_contents, pfg.sp_file_result, chatbot=chatbot, project_folder=project_folder)
-
-    #  <-------- 写出文件 ----------> 
-    msg = f"当前大语言模型: {llm_kwargs['llm_model']}，当前语言模型温度设定: {llm_kwargs['temperature']}。"
-    final_tex = lps.merge_result(pfg.file_result, mode, msg)
-    objdump((lps, pfg.file_result, mode, msg), file=pj(project_folder,'merge_result.pkl'))
-
-    with open(project_folder + f'/merge_{mode}.tex', 'w', encoding='utf-8', errors='replace') as f:
-        if mode != 'translate_zh' or "binary" in final_tex: f.write(final_tex)
-        
-
-    #  <-------- 整理结果, 退出 ----------> 
-    chatbot.append((f"完成了吗？", 'GPT结果已输出, 即将编译PDF'))
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-    #  <-------- 返回 ----------> 
-    return project_folder + f'/merge_{mode}.tex'
-
-
-def remove_buggy_lines(file_path, log_path, tex_name, tex_name_pure, n_fix, work_folder_modified, fixed_line=[]):
-    try:
-        with open(log_path, 'r', encoding='utf-8', errors='replace') as f:
-            log = f.read()
-        import re
-        buggy_lines = re.findall(tex_name+':([0-9]{1,5}):', log)
-        buggy_lines = [int(l) for l in buggy_lines]
-        buggy_lines = sorted(buggy_lines)
-        buggy_line = buggy_lines[0]-1
-        print("reversing tex line that has errors", buggy_line)
-
-        # 重组，逆转出错的段落
-        if buggy_line not in fixed_line:
-            fixed_line.append(buggy_line)
-
-        lps, file_result, mode, msg = objload(file=pj(work_folder_modified,'merge_result.pkl'))
-        final_tex = lps.merge_result(file_result, mode, msg, buggy_lines=fixed_line, buggy_line_surgery_n_lines=5*n_fix)
-
-        with open(pj(work_folder_modified, f"{tex_name_pure}_fix_{n_fix}.tex"), 'w', encoding='utf-8', errors='replace') as f:
-            f.write(final_tex)
-
-        return True, f"{tex_name_pure}_fix_{n_fix}", buggy_lines
-    except:
-        print("Fatal error occurred, but we cannot identify error, please download zip, read latex log, and compile manually.")
-        return False, -1, [-1]
-
-
-def 编译Latex(chatbot, history, main_file_original, main_file_modified, work_folder_original, work_folder_modified, work_folder, mode='default'):
-    import os, time
-    n_fix = 1
-    fixed_line = []
-    max_try = 32
-    chatbot.append([f"正在编译PDF文档", f'编译已经开始。当前工作路径为{work_folder}，如果程序停顿5分钟以上，请直接去该路径下取回翻译结果，或者重启之后再度尝试 ...']); yield from update_ui(chatbot=chatbot, history=history)
-    chatbot.append([f"正在编译PDF文档", '...']); yield from update_ui(chatbot=chatbot, history=history); time.sleep(1); chatbot[-1] = list(chatbot[-1]) # 刷新界面
-    yield from update_ui_lastest_msg('编译已经开始...', chatbot, history)   # 刷新Gradio前端界面
-
-    while True:
-        import os
-        may_exist_bbl = pj(work_folder_modified, f'merge.bbl')
-        target_bbl = pj(work_folder_modified, f'{main_file_modified}.bbl')
-        if os.path.exists(may_exist_bbl) and not os.path.exists(target_bbl):
-            shutil.copyfile(may_exist_bbl, target_bbl)
-
-        # https://stackoverflow.com/questions/738755/dont-make-me-manually-abort-a-latex-compile-when-theres-an-error
-        yield from update_ui_lastest_msg(f'尝试第 {n_fix}/{max_try} 次编译, 编译原始PDF ...', chatbot, history)   # 刷新Gradio前端界面
-        ok = compile_latex_with_timeout(f'pdflatex -interaction=batchmode -file-line-error {main_file_original}.tex', work_folder_original)
-
-        yield from update_ui_lastest_msg(f'尝试第 {n_fix}/{max_try} 次编译, 编译转化后的PDF ...', chatbot, history)   # 刷新Gradio前端界面
-        ok = compile_latex_with_timeout(f'pdflatex -interaction=batchmode -file-line-error {main_file_modified}.tex', work_folder_modified)
-        
-        if ok and os.path.exists(pj(work_folder_modified, f'{main_file_modified}.pdf')):
-            # 只有第二步成功，才能继续下面的步骤
-            yield from update_ui_lastest_msg(f'尝试第 {n_fix}/{max_try} 次编译, 编译BibTex ...', chatbot, history)    # 刷新Gradio前端界面
-            if not os.path.exists(pj(work_folder_original, f'{main_file_original}.bbl')):
-                ok = compile_latex_with_timeout(f'bibtex  {main_file_original}.aux', work_folder_original)
-            if not os.path.exists(pj(work_folder_modified, f'{main_file_modified}.bbl')):
-                ok = compile_latex_with_timeout(f'bibtex  {main_file_modified}.aux', work_folder_modified)
-
-            yield from update_ui_lastest_msg(f'尝试第 {n_fix}/{max_try} 次编译, 编译文献交叉引用 ...', chatbot, history)  # 刷新Gradio前端界面
-            ok = compile_latex_with_timeout(f'pdflatex -interaction=batchmode -file-line-error {main_file_original}.tex', work_folder_original)
-            ok = compile_latex_with_timeout(f'pdflatex -interaction=batchmode -file-line-error {main_file_modified}.tex', work_folder_modified)
-            ok = compile_latex_with_timeout(f'pdflatex -interaction=batchmode -file-line-error {main_file_original}.tex', work_folder_original)
-            ok = compile_latex_with_timeout(f'pdflatex -interaction=batchmode -file-line-error {main_file_modified}.tex', work_folder_modified)
-
-            if mode!='translate_zh':
-                yield from update_ui_lastest_msg(f'尝试第 {n_fix}/{max_try} 次编译, 使用latexdiff生成论文转化前后对比 ...', chatbot, history) # 刷新Gradio前端界面
-                print(    f'latexdiff --encoding=utf8 --append-safecmd=subfile {work_folder_original}/{main_file_original}.tex  {work_folder_modified}/{main_file_modified}.tex --flatten > {work_folder}/merge_diff.tex')
-                ok = compile_latex_with_timeout(f'latexdiff --encoding=utf8 --append-safecmd=subfile {work_folder_original}/{main_file_original}.tex  {work_folder_modified}/{main_file_modified}.tex --flatten > {work_folder}/merge_diff.tex', os.getcwd())
-
-                yield from update_ui_lastest_msg(f'尝试第 {n_fix}/{max_try} 次编译, 正在编译对比PDF ...', chatbot, history)   # 刷新Gradio前端界面
-                ok = compile_latex_with_timeout(f'pdflatex  -interaction=batchmode -file-line-error merge_diff.tex', work_folder)
-                ok = compile_latex_with_timeout(f'bibtex    merge_diff.aux', work_folder)
-                ok = compile_latex_with_timeout(f'pdflatex  -interaction=batchmode -file-line-error merge_diff.tex', work_folder)
-                ok = compile_latex_with_timeout(f'pdflatex  -interaction=batchmode -file-line-error merge_diff.tex', work_folder)
-
-        # <---------- 检查结果 ----------->
-        results_ = ""
-        original_pdf_success = os.path.exists(pj(work_folder_original, f'{main_file_original}.pdf'))
-        modified_pdf_success = os.path.exists(pj(work_folder_modified, f'{main_file_modified}.pdf'))
-        diff_pdf_success     = os.path.exists(pj(work_folder, f'merge_diff.pdf'))
-        results_ += f"原始PDF编译是否成功: {original_pdf_success};" 
-        results_ += f"转化PDF编译是否成功: {modified_pdf_success};" 
-        results_ += f"对比PDF编译是否成功: {diff_pdf_success};" 
-        yield from update_ui_lastest_msg(f'第{n_fix}编译结束:<br/>{results_}...', chatbot, history) # 刷新Gradio前端界面
-
-        if diff_pdf_success:
-            result_pdf = pj(work_folder_modified, f'merge_diff.pdf')    # get pdf path
-            promote_file_to_downloadzone(result_pdf, rename_file=None, chatbot=chatbot)  # promote file to web UI
-        if modified_pdf_success:
-            yield from update_ui_lastest_msg(f'转化PDF编译已经成功, 正在尝试生成对比PDF, 请稍候 ...', chatbot, history)    # 刷新Gradio前端界面
-            result_pdf = pj(work_folder_modified, f'{main_file_modified}.pdf') # get pdf path
-            origin_pdf = pj(work_folder_original, f'{main_file_original}.pdf') # get pdf path
-            if os.path.exists(pj(work_folder, '..', 'translation')):
-                shutil.copyfile(result_pdf, pj(work_folder, '..', 'translation', 'translate_zh.pdf'))
-            promote_file_to_downloadzone(result_pdf, rename_file=None, chatbot=chatbot)  # promote file to web UI
-            # 将两个PDF拼接
-            if original_pdf_success: 
-                try:
-                    from .latex_toolbox import merge_pdfs
-                    concat_pdf = pj(work_folder_modified, f'comparison.pdf')
-                    merge_pdfs(origin_pdf, result_pdf, concat_pdf)
-                    if os.path.exists(pj(work_folder, '..', 'translation')):
-                        shutil.copyfile(concat_pdf, pj(work_folder, '..', 'translation', 'comparison.pdf'))
-                    promote_file_to_downloadzone(concat_pdf, rename_file=None, chatbot=chatbot)  # promote file to web UI
-                except Exception as e:
-                    print(e)
-                    pass
-            return True # 成功啦
-        else:
-            if n_fix>=max_try: break
-            n_fix += 1
-            can_retry, main_file_modified, buggy_lines = remove_buggy_lines(
-                file_path=pj(work_folder_modified, f'{main_file_modified}.tex'), 
-                log_path=pj(work_folder_modified, f'{main_file_modified}.log'),
-                tex_name=f'{main_file_modified}.tex',
-                tex_name_pure=f'{main_file_modified}',
-                n_fix=n_fix,
-                work_folder_modified=work_folder_modified,
-                fixed_line=fixed_line
-            )
-            yield from update_ui_lastest_msg(f'由于最为关键的转化PDF编译失败, 将根据报错信息修正tex源文件并重试, 当前报错的latex代码处于第{buggy_lines}行 ...', chatbot, history)   # 刷新Gradio前端界面
-            if not can_retry: break
-
-    return False # 失败啦
-
-
-def write_html(sp_file_contents, sp_file_result, chatbot, project_folder):
-    # write html
-    try:
-        import shutil
-        from crazy_functions.pdf_fns.report_gen_html import construct_html
-        from toolbox import gen_time_str
-        ch = construct_html() 
-        orig = ""
-        trans = ""
-        final = []
-        for c,r in zip(sp_file_contents, sp_file_result): 
-            final.append(c)
-            final.append(r)
-        for i, k in enumerate(final): 
-            if i%2==0:
-                orig = k
-            if i%2==1:
-                trans = k
-                ch.add_row(a=orig, b=trans)
-        create_report_file_name = f"{gen_time_str()}.trans.html"
-        res = ch.save_file(create_report_file_name)
-        shutil.copyfile(res, pj(project_folder, create_report_file_name))
-        promote_file_to_downloadzone(file=res, chatbot=chatbot)
-    except:
-        from toolbox import trimmed_format_exc
-        print('writing html result failed:', trimmed_format_exc())

crazy_functions/latex_fns/latex_toolbox.py

@@ -1,562 +0,0 @@
-import os, shutil
-import re
-import numpy as np
-PRESERVE = 0
-TRANSFORM = 1
-
-pj = os.path.join
-
-class LinkedListNode():
-    """
-    Linked List Node
-    """
-    def __init__(self, string, preserve=True) -> None:
-        self.string = string
-        self.preserve = preserve
-        self.next = None
-        self.range = None
-        # self.begin_line = 0
-        # self.begin_char = 0
-
-def convert_to_linklist(text, mask):
-    root = LinkedListNode("", preserve=True)
-    current_node = root
-    for c, m, i in zip(text, mask, range(len(text))):
-        if (m==PRESERVE and current_node.preserve) \
-            or (m==TRANSFORM and not current_node.preserve):
-            # add
-            current_node.string += c
-        else:
-            current_node.next = LinkedListNode(c, preserve=(m==PRESERVE))
-            current_node = current_node.next
-    return root
-
-def post_process(root):
-    # 修复括号
-    node = root
-    while True:
-        string = node.string
-        if node.preserve: 
-            node = node.next
-            if node is None: break
-            continue
-        def break_check(string):
-            str_stack = [""] # (lv, index)
-            for i, c in enumerate(string):
-                if c == '{':
-                    str_stack.append('{')
-                elif c == '}':
-                    if len(str_stack) == 1:
-                        print('stack fix')
-                        return i
-                    str_stack.pop(-1)
-                else:
-                    str_stack[-1] += c
-            return -1
-        bp = break_check(string)
-
-        if bp == -1:
-            pass
-        elif bp == 0:
-            node.string = string[:1]
-            q = LinkedListNode(string[1:], False)
-            q.next = node.next
-            node.next = q
-        else:
-            node.string = string[:bp]
-            q = LinkedListNode(string[bp:], False)
-            q.next = node.next
-            node.next = q
-
-        node = node.next
-        if node is None: break
-
-    # 屏蔽空行和太短的句子
-    node = root
-    while True:
-        if len(node.string.strip('\n').strip(''))==0: node.preserve = True
-        if len(node.string.strip('\n').strip(''))<42: node.preserve = True
-        node = node.next
-        if node is None: break
-    node = root
-    while True:
-        if node.next and node.preserve and node.next.preserve:
-            node.string += node.next.string
-            node.next = node.next.next
-        node = node.next
-        if node is None: break
-
-    # 将前后断行符脱离
-    node = root
-    prev_node = None
-    while True:
-        if not node.preserve:
-            lstriped_ = node.string.lstrip().lstrip('\n')
-            if (prev_node is not None) and (prev_node.preserve) and (len(lstriped_)!=len(node.string)):
-                prev_node.string += node.string[:-len(lstriped_)]
-                node.string = lstriped_
-            rstriped_ = node.string.rstrip().rstrip('\n')
-            if (node.next is not None) and (node.next.preserve) and (len(rstriped_)!=len(node.string)):
-                node.next.string = node.string[len(rstriped_):] + node.next.string
-                node.string = rstriped_
-        # =====
-        prev_node = node
-        node = node.next
-        if node is None: break
-
-    # 标注节点的行数范围
-    node = root
-    n_line = 0
-    expansion = 2
-    while True:
-        n_l = node.string.count('\n')
-        node.range = [n_line-expansion, n_line+n_l+expansion]   # 失败时，扭转的范围
-        n_line = n_line+n_l
-        node = node.next
-        if node is None: break
-    return root
-
-
-"""
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
-Latex segmentation with a binary mask (PRESERVE=0, TRANSFORM=1)
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
-"""
-
-
-def set_forbidden_text(text, mask, pattern, flags=0):
-    """
-    Add a preserve text area in this paper
-    e.g. with pattern = r"\\begin\{algorithm\}(.*?)\\end\{algorithm\}"
-    you can mask out (mask = PRESERVE so that text become untouchable for GPT) 
-    everything between "\begin{equation}" and "\end{equation}"
-    """
-    if isinstance(pattern, list): pattern = '|'.join(pattern)
-    pattern_compile = re.compile(pattern, flags)
-    for res in pattern_compile.finditer(text):
-        mask[res.span()[0]:res.span()[1]] = PRESERVE
-    return text, mask
-
-def reverse_forbidden_text(text, mask, pattern, flags=0, forbid_wrapper=True):
-    """
-    Move area out of preserve area (make text editable for GPT)
-    count the number of the braces so as to catch compelete text area. 
-    e.g.
-    \begin{abstract} blablablablablabla. \end{abstract} 
-    """
-    if isinstance(pattern, list): pattern = '|'.join(pattern)
-    pattern_compile = re.compile(pattern, flags)
-    for res in pattern_compile.finditer(text):
-        if not forbid_wrapper:
-            mask[res.span()[0]:res.span()[1]] = TRANSFORM
-        else:
-            mask[res.regs[0][0]: res.regs[1][0]] = PRESERVE   # '\\begin{abstract}'
-            mask[res.regs[1][0]: res.regs[1][1]] = TRANSFORM   # abstract
-            mask[res.regs[1][1]: res.regs[0][1]] = PRESERVE   # abstract
-    return text, mask
-
-def set_forbidden_text_careful_brace(text, mask, pattern, flags=0):
-    """
-    Add a preserve text area in this paper (text become untouchable for GPT).
-    count the number of the braces so as to catch compelete text area. 
-    e.g.
-    \caption{blablablablabla\texbf{blablabla}blablabla.} 
-    """
-    pattern_compile = re.compile(pattern, flags)
-    for res in pattern_compile.finditer(text):
-        brace_level = -1
-        p = begin = end = res.regs[0][0]
-        for _ in range(1024*16):
-            if text[p] == '}' and brace_level == 0: break
-            elif text[p] == '}':  brace_level -= 1
-            elif text[p] == '{':  brace_level += 1
-            p += 1
-        end = p+1
-        mask[begin:end] = PRESERVE
-    return text, mask
-
-def reverse_forbidden_text_careful_brace(text, mask, pattern, flags=0, forbid_wrapper=True):
-    """
-    Move area out of preserve area (make text editable for GPT)
-    count the number of the braces so as to catch compelete text area. 
-    e.g.
-    \caption{blablablablabla\texbf{blablabla}blablabla.} 
-    """
-    pattern_compile = re.compile(pattern, flags)
-    for res in pattern_compile.finditer(text):
-        brace_level = 0
-        p = begin = end = res.regs[1][0]
-        for _ in range(1024*16):
-            if text[p] == '}' and brace_level == 0: break
-            elif text[p] == '}':  brace_level -= 1
-            elif text[p] == '{':  brace_level += 1
-            p += 1
-        end = p
-        mask[begin:end] = TRANSFORM
-        if forbid_wrapper:
-            mask[res.regs[0][0]:begin] = PRESERVE
-            mask[end:res.regs[0][1]] = PRESERVE
-    return text, mask
-
-def set_forbidden_text_begin_end(text, mask, pattern, flags=0, limit_n_lines=42):
-    """
-    Find all \begin{} ... \end{} text block that with less than limit_n_lines lines.
-    Add it to preserve area
-    """
-    pattern_compile = re.compile(pattern, flags)
-    def search_with_line_limit(text, mask):
-        for res in pattern_compile.finditer(text):
-            cmd = res.group(1)  # begin{what}
-            this = res.group(2) # content between begin and end
-            this_mask = mask[res.regs[2][0]:res.regs[2][1]]
-            white_list = ['document', 'abstract', 'lemma', 'definition', 'sproof', 
-                          'em', 'emph', 'textit', 'textbf', 'itemize', 'enumerate']
-            if (cmd in white_list) or this.count('\n') >= limit_n_lines: # use a magical number 42
-                this, this_mask = search_with_line_limit(this, this_mask)
-                mask[res.regs[2][0]:res.regs[2][1]] = this_mask
-            else:
-                mask[res.regs[0][0]:res.regs[0][1]] = PRESERVE
-        return text, mask
-    return search_with_line_limit(text, mask) 
-
-
-
-"""
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
-Latex Merge File
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
-"""
-
-def find_main_tex_file(file_manifest, mode):
-    """
-    在多Tex文档中，寻找主文件，必须包含documentclass，返回找到的第一个。
-    P.S. 但愿没人把latex模板放在里面传进来 (6.25 加入判定latex模板的代码)
-    """
-    canidates = []
-    for texf in file_manifest:
-        if os.path.basename(texf).startswith('merge'):
-            continue
-        with open(texf, 'r', encoding='utf8', errors='ignore') as f:
-            file_content = f.read()
-        if r'\documentclass' in file_content:
-            canidates.append(texf)
-        else:
-            continue
-
-    if len(canidates) == 0:
-        raise RuntimeError('无法找到一个主Tex文件（包含documentclass关键字）')
-    elif len(canidates) == 1:
-        return canidates[0]
-    else: # if len(canidates) >= 2 通过一些Latex模板中常见（但通常不会出现在正文）的单词，对不同latex源文件扣分，取评分最高者返回
-        canidates_score = []
-        # 给出一些判定模板文档的词作为扣分项
-        unexpected_words = ['\LaTeX', 'manuscript', 'Guidelines', 'font', 'citations', 'rejected', 'blind review', 'reviewers']
-        expected_words = ['\input', '\ref', '\cite']
-        for texf in canidates:
-            canidates_score.append(0)
-            with open(texf, 'r', encoding='utf8', errors='ignore') as f:
-                file_content = f.read()
-                file_content = rm_comments(file_content)
-            for uw in unexpected_words:
-                if uw in file_content:
-                    canidates_score[-1] -= 1
-            for uw in expected_words:
-                if uw in file_content:
-                    canidates_score[-1] += 1
-        select = np.argmax(canidates_score) # 取评分最高者返回
-        return canidates[select]
-    
-def rm_comments(main_file):
-    new_file_remove_comment_lines = []
-    for l in main_file.splitlines():
-        # 删除整行的空注释
-        if l.lstrip().startswith("%"):
-            pass
-        else:
-            new_file_remove_comment_lines.append(l)
-    main_file = '\n'.join(new_file_remove_comment_lines)
-    # main_file = re.sub(r"\\include{(.*?)}", r"\\input{\1}", main_file)  # 将 \include 命令转换为 \input 命令
-    main_file = re.sub(r'(?<!\\)%.*', '', main_file)  # 使用正则表达式查找半行注释, 并替换为空字符串
-    return main_file
-
-def find_tex_file_ignore_case(fp):
-    dir_name = os.path.dirname(fp)
-    base_name = os.path.basename(fp)
-    # 如果输入的文件路径是正确的
-    if os.path.isfile(pj(dir_name, base_name)): return pj(dir_name, base_name)
-    # 如果不正确，试着加上.tex后缀试试
-    if not base_name.endswith('.tex'): base_name+='.tex'
-    if os.path.isfile(pj(dir_name, base_name)): return pj(dir_name, base_name)
-    # 如果还找不到，解除大小写限制，再试一次
-    import glob
-    for f in glob.glob(dir_name+'/*.tex'):
-        base_name_s = os.path.basename(fp)
-        base_name_f = os.path.basename(f)
-        if base_name_s.lower() == base_name_f.lower(): return f
-        # 试着加上.tex后缀试试
-        if not base_name_s.endswith('.tex'): base_name_s+='.tex'
-        if base_name_s.lower() == base_name_f.lower(): return f
-    return None
-
-def merge_tex_files_(project_foler, main_file, mode):
-    """
-    Merge Tex project recrusively
-    """
-    main_file = rm_comments(main_file)
-    for s in reversed([q for q in re.finditer(r"\\input\{(.*?)\}", main_file, re.M)]):
-        f = s.group(1)
-        fp = os.path.join(project_foler, f)
-        fp_ = find_tex_file_ignore_case(fp)
-        if fp_:
-            try:
-                with open(fp_, 'r', encoding='utf-8', errors='replace') as fx: c = fx.read()
-            except:
-                c = f"\n\nWarning from GPT-Academic: LaTex source file is missing!\n\n"
-        else:
-            raise RuntimeError(f'找不到{fp}，Tex源文件缺失！')
-        c = merge_tex_files_(project_foler, c, mode)
-        main_file = main_file[:s.span()[0]] + c + main_file[s.span()[1]:]
-    return main_file
-
-
-def find_title_and_abs(main_file):
-
-    def extract_abstract_1(text):
-        pattern = r"\\abstract\{(.*?)\}"
-        match = re.search(pattern, text, re.DOTALL)
-        if match:
-            return match.group(1)
-        else:
-            return None
-
-    def extract_abstract_2(text):
-        pattern = r"\\begin\{abstract\}(.*?)\\end\{abstract\}"
-        match = re.search(pattern, text, re.DOTALL)
-        if match:
-            return match.group(1)
-        else:
-            return None
-
-    def extract_title(string):
-        pattern = r"\\title\{(.*?)\}"
-        match = re.search(pattern, string, re.DOTALL)
-
-        if match:
-            return match.group(1)
-        else:
-            return None
-
-    abstract = extract_abstract_1(main_file)
-    if abstract is None:
-        abstract = extract_abstract_2(main_file)
-    title = extract_title(main_file)
-    return title, abstract
-
-
-def merge_tex_files(project_foler, main_file, mode):
-    """
-    Merge Tex project recrusively
-    P.S. 顺便把CTEX塞进去以支持中文
-    P.S. 顺便把Latex的注释去除
-    """
-    main_file = merge_tex_files_(project_foler, main_file, mode)
-    main_file = rm_comments(main_file)
-
-    if mode == 'translate_zh':
-        # find paper documentclass
-        pattern = re.compile(r'\\documentclass.*\n')
-        match = pattern.search(main_file)
-        assert match is not None, "Cannot find documentclass statement!"
-        position = match.end()
-        add_ctex = '\\usepackage{ctex}\n'
-        add_url = '\\usepackage{url}\n' if '{url}' not in main_file else ''
-        main_file = main_file[:position] + add_ctex + add_url + main_file[position:]
-        # fontset=windows
-        import platform
-        main_file = re.sub(r"\\documentclass\[(.*?)\]{(.*?)}", r"\\documentclass[\1,fontset=windows,UTF8]{\2}",main_file)
-        main_file = re.sub(r"\\documentclass{(.*?)}", r"\\documentclass[fontset=windows,UTF8]{\1}",main_file)
-        # find paper abstract
-        pattern_opt1 = re.compile(r'\\begin\{abstract\}.*\n')
-        pattern_opt2 = re.compile(r"\\abstract\{(.*?)\}", flags=re.DOTALL)
-        match_opt1 = pattern_opt1.search(main_file)
-        match_opt2 = pattern_opt2.search(main_file)
-        if (match_opt1 is None) and (match_opt2 is None):
-            # "Cannot find paper abstract section!"
-            main_file = insert_abstract(main_file)
-        match_opt1 = pattern_opt1.search(main_file)
-        match_opt2 = pattern_opt2.search(main_file)
-        assert (match_opt1 is not None) or (match_opt2 is not None), "Cannot find paper abstract section!"
-    return main_file
-
-
-insert_missing_abs_str = r"""
-\begin{abstract}
-The GPT-Academic program cannot find abstract section in this paper.
-\end{abstract}
-"""
-
-def insert_abstract(tex_content):
-    if "\\maketitle" in tex_content:
-        # find the position of "\maketitle"
-        find_index = tex_content.index("\\maketitle")
-        # find the nearest ending line
-        end_line_index = tex_content.find("\n", find_index)
-        # insert "abs_str" on the next line
-        modified_tex = tex_content[:end_line_index+1] + '\n\n' + insert_missing_abs_str + '\n\n' + tex_content[end_line_index+1:]
-        return modified_tex
-    elif r"\begin{document}" in tex_content:
-        # find the position of "\maketitle"
-        find_index = tex_content.index(r"\begin{document}")
-        # find the nearest ending line
-        end_line_index = tex_content.find("\n", find_index)
-        # insert "abs_str" on the next line
-        modified_tex = tex_content[:end_line_index+1] + '\n\n' + insert_missing_abs_str + '\n\n' + tex_content[end_line_index+1:]
-        return modified_tex
-    else:
-        return tex_content
-
-"""
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
-Post process
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
-"""
-def mod_inbraket(match):
-    """
-    为啥chatgpt会把cite里面的逗号换成中文逗号呀 
-    """
-    # get the matched string
-    cmd = match.group(1)
-    str_to_modify = match.group(2)
-    # modify the matched string
-    str_to_modify = str_to_modify.replace('：', ':')    # 前面是中文冒号，后面是英文冒号
-    str_to_modify = str_to_modify.replace('，', ',')    # 前面是中文逗号，后面是英文逗号
-    # str_to_modify = 'BOOM'
-    return "\\" + cmd + "{" + str_to_modify + "}"
-
-def fix_content(final_tex, node_string):
-    """
-    Fix common GPT errors to increase success rate
-    """
-    final_tex = re.sub(r"(?<!\\)%", "\\%", final_tex)
-    final_tex = re.sub(r"\\([a-z]{2,10})\ \{", r"\\\1{", string=final_tex)
-    final_tex = re.sub(r"\\\ ([a-z]{2,10})\{", r"\\\1{", string=final_tex)
-    final_tex = re.sub(r"\\([a-z]{2,10})\{([^\}]*?)\}", mod_inbraket, string=final_tex)
-
-    if "Traceback" in final_tex and "[Local Message]" in final_tex:
-        final_tex = node_string # 出问题了，还原原文
-    if node_string.count('\\begin') != final_tex.count('\\begin'):
-        final_tex = node_string # 出问题了，还原原文
-    if node_string.count('\_') > 0 and node_string.count('\_') > final_tex.count('\_'):
-        # walk and replace any _ without \
-        final_tex = re.sub(r"(?<!\\)_", "\\_", final_tex)
-
-    def compute_brace_level(string):
-        # this function count the number of { and }
-        brace_level = 0
-        for c in string:
-            if c == "{": brace_level += 1
-            elif c == "}": brace_level -= 1
-        return brace_level
-    def join_most(tex_t, tex_o):
-        # this function join translated string and original string when something goes wrong
-        p_t = 0
-        p_o = 0
-        def find_next(string, chars, begin):
-            p = begin
-            while p < len(string):
-                if string[p] in chars: return p, string[p]
-                p += 1
-            return None, None
-        while True:
-            res1, char = find_next(tex_o, ['{','}'], p_o)
-            if res1 is None: break
-            res2, char = find_next(tex_t, [char], p_t)
-            if res2 is None: break
-            p_o = res1 + 1
-            p_t = res2 + 1
-        return tex_t[:p_t] + tex_o[p_o:]
-
-    if compute_brace_level(final_tex) != compute_brace_level(node_string):
-        # 出问题了，还原部分原文，保证括号正确
-        final_tex = join_most(final_tex, node_string)
-    return final_tex
-    
-def compile_latex_with_timeout(command, cwd, timeout=60):
-    import subprocess
-    process = subprocess.Popen(command, shell=True, stdout=subprocess.PIPE, stderr=subprocess.PIPE, cwd=cwd)
-    try:
-        stdout, stderr = process.communicate(timeout=timeout)
-    except subprocess.TimeoutExpired:
-        process.kill()
-        stdout, stderr = process.communicate()
-        print("Process timed out!")
-        return False
-    return True
-
-def run_in_subprocess_wrapper_func(func, args, kwargs, return_dict, exception_dict):
-    import sys
-    try:
-        result = func(*args, **kwargs)
-        return_dict['result'] = result
-    except Exception as e:
-        exc_info = sys.exc_info()
-        exception_dict['exception'] = exc_info
-
-def run_in_subprocess(func):
-    import multiprocessing
-    def wrapper(*args, **kwargs):
-        return_dict = multiprocessing.Manager().dict()
-        exception_dict = multiprocessing.Manager().dict()
-        process = multiprocessing.Process(target=run_in_subprocess_wrapper_func, 
-                                            args=(func, args, kwargs, return_dict, exception_dict))
-        process.start()
-        process.join()
-        process.close()
-        if 'exception' in exception_dict:
-            # ooops, the subprocess ran into an exception
-            exc_info = exception_dict['exception']
-            raise exc_info[1].with_traceback(exc_info[2])
-        if 'result' in return_dict.keys():
-            # If the subprocess ran successfully, return the result
-            return return_dict['result']
-    return wrapper
-
-def _merge_pdfs(pdf1_path, pdf2_path, output_path):
-    import PyPDF2   # PyPDF2这个库有严重的内存泄露问题，把它放到子进程中运行，从而方便内存的释放
-    Percent = 0.95
-    # raise RuntimeError('PyPDF2 has a serious memory leak problem, please use other tools to merge PDF files.')
-    # Open the first PDF file
-    with open(pdf1_path, 'rb') as pdf1_file:
-        pdf1_reader = PyPDF2.PdfFileReader(pdf1_file)
-        # Open the second PDF file
-        with open(pdf2_path, 'rb') as pdf2_file:
-            pdf2_reader = PyPDF2.PdfFileReader(pdf2_file)
-            # Create a new PDF file to store the merged pages
-            output_writer = PyPDF2.PdfFileWriter()
-            # Determine the number of pages in each PDF file
-            num_pages = max(pdf1_reader.numPages, pdf2_reader.numPages)
-            # Merge the pages from the two PDF files
-            for page_num in range(num_pages):
-                # Add the page from the first PDF file
-                if page_num < pdf1_reader.numPages:
-                    page1 = pdf1_reader.getPage(page_num)
-                else:
-                    page1 = PyPDF2.PageObject.createBlankPage(pdf1_reader)
-                # Add the page from the second PDF file
-                if page_num < pdf2_reader.numPages:
-                    page2 = pdf2_reader.getPage(page_num)
-                else:
-                    page2 = PyPDF2.PageObject.createBlankPage(pdf1_reader)
-                # Create a new empty page with double width
-                new_page = PyPDF2.PageObject.createBlankPage(
-                    width = int(int(page1.mediaBox.getWidth()) + int(page2.mediaBox.getWidth()) * Percent),
-                    height = max(page1.mediaBox.getHeight(), page2.mediaBox.getHeight())
-                )
-                new_page.mergeTranslatedPage(page1, 0, 0)
-                new_page.mergeTranslatedPage(page2, int(int(page1.mediaBox.getWidth())-int(page2.mediaBox.getWidth())* (1-Percent)), 0)
-                output_writer.addPage(new_page)
-            # Save the merged PDF file
-            with open(output_path, 'wb') as output_file:
-                output_writer.write(output_file)
-
-merge_pdfs = run_in_subprocess(_merge_pdfs) # PyPDF2这个库有严重的内存泄露问题，把它放到子进程中运行，从而方便内存的释放

crazy_functions/latex_utils.py

@@ -1,788 +0,0 @@
-from toolbox import update_ui, update_ui_lastest_msg    # 刷新Gradio前端界面
-from toolbox import zip_folder, objdump, objload, promote_file_to_downloadzone
-import os, shutil
-import re
-import numpy as np
-pj = os.path.join
-
-"""
-========================================================================
-Part One
-Latex segmentation with a binary mask (PRESERVE=0, TRANSFORM=1)
-========================================================================
-"""
-PRESERVE = 0
-TRANSFORM = 1
-
-def set_forbidden_text(text, mask, pattern, flags=0):
-    """
-    Add a preserve text area in this paper
-    e.g. with pattern = r"\\begin\{algorithm\}(.*?)\\end\{algorithm\}"
-    you can mask out (mask = PRESERVE so that text become untouchable for GPT) 
-    everything between "\begin{equation}" and "\end{equation}"
-    """
-    if isinstance(pattern, list): pattern = '|'.join(pattern)
-    pattern_compile = re.compile(pattern, flags)
-    for res in pattern_compile.finditer(text):
-        mask[res.span()[0]:res.span()[1]] = PRESERVE
-    return text, mask
-
-def reverse_forbidden_text(text, mask, pattern, flags=0, forbid_wrapper=True):
-    """
-    Move area out of preserve area (make text editable for GPT)
-    count the number of the braces so as to catch compelete text area. 
-    e.g.
-    \begin{abstract} blablablablablabla. \end{abstract} 
-    """
-    if isinstance(pattern, list): pattern = '|'.join(pattern)
-    pattern_compile = re.compile(pattern, flags)
-    for res in pattern_compile.finditer(text):
-        if not forbid_wrapper:
-            mask[res.span()[0]:res.span()[1]] = TRANSFORM
-        else:
-            mask[res.regs[0][0]: res.regs[1][0]] = PRESERVE   # '\\begin{abstract}'
-            mask[res.regs[1][0]: res.regs[1][1]] = TRANSFORM   # abstract
-            mask[res.regs[1][1]: res.regs[0][1]] = PRESERVE   # abstract
-    return text, mask
-
-def set_forbidden_text_careful_brace(text, mask, pattern, flags=0):
-    """
-    Add a preserve text area in this paper (text become untouchable for GPT).
-    count the number of the braces so as to catch compelete text area. 
-    e.g.
-    \caption{blablablablabla\texbf{blablabla}blablabla.} 
-    """
-    pattern_compile = re.compile(pattern, flags)
-    for res in pattern_compile.finditer(text):
-        brace_level = -1
-        p = begin = end = res.regs[0][0]
-        for _ in range(1024*16):
-            if text[p] == '}' and brace_level == 0: break
-            elif text[p] == '}':  brace_level -= 1
-            elif text[p] == '{':  brace_level += 1
-            p += 1
-        end = p+1
-        mask[begin:end] = PRESERVE
-    return text, mask
-
-def reverse_forbidden_text_careful_brace(text, mask, pattern, flags=0, forbid_wrapper=True):
-    """
-    Move area out of preserve area (make text editable for GPT)
-    count the number of the braces so as to catch compelete text area. 
-    e.g.
-    \caption{blablablablabla\texbf{blablabla}blablabla.} 
-    """
-    pattern_compile = re.compile(pattern, flags)
-    for res in pattern_compile.finditer(text):
-        brace_level = 0
-        p = begin = end = res.regs[1][0]
-        for _ in range(1024*16):
-            if text[p] == '}' and brace_level == 0: break
-            elif text[p] == '}':  brace_level -= 1
-            elif text[p] == '{':  brace_level += 1
-            p += 1
-        end = p
-        mask[begin:end] = TRANSFORM
-        if forbid_wrapper:
-            mask[res.regs[0][0]:begin] = PRESERVE
-            mask[end:res.regs[0][1]] = PRESERVE
-    return text, mask
-
-def set_forbidden_text_begin_end(text, mask, pattern, flags=0, limit_n_lines=42):
-    """
-    Find all \begin{} ... \end{} text block that with less than limit_n_lines lines.
-    Add it to preserve area
-    """
-    pattern_compile = re.compile(pattern, flags)
-    def search_with_line_limit(text, mask):
-        for res in pattern_compile.finditer(text):
-            cmd = res.group(1)  # begin{what}
-            this = res.group(2) # content between begin and end
-            this_mask = mask[res.regs[2][0]:res.regs[2][1]]
-            white_list = ['document', 'abstract', 'lemma', 'definition', 'sproof', 
-                          'em', 'emph', 'textit', 'textbf', 'itemize', 'enumerate']
-            if (cmd in white_list) or this.count('\n') >= limit_n_lines: # use a magical number 42
-                this, this_mask = search_with_line_limit(this, this_mask)
-                mask[res.regs[2][0]:res.regs[2][1]] = this_mask
-            else:
-                mask[res.regs[0][0]:res.regs[0][1]] = PRESERVE
-        return text, mask
-    return search_with_line_limit(text, mask) 
-
-class LinkedListNode():
-    """
-    Linked List Node
-    """
-    def __init__(self, string, preserve=True) -> None:
-        self.string = string
-        self.preserve = preserve
-        self.next = None
-        # self.begin_line = 0
-        # self.begin_char = 0
-
-def convert_to_linklist(text, mask):
-    root = LinkedListNode("", preserve=True)
-    current_node = root
-    for c, m, i in zip(text, mask, range(len(text))):
-        if (m==PRESERVE and current_node.preserve) \
-            or (m==TRANSFORM and not current_node.preserve):
-            # add
-            current_node.string += c
-        else:
-            current_node.next = LinkedListNode(c, preserve=(m==PRESERVE))
-            current_node = current_node.next
-    return root
-"""
-========================================================================
-Latex Merge File
-========================================================================
-"""
-
-def 寻找Latex主文件(file_manifest, mode):
-    """
-    在多Tex文档中，寻找主文件，必须包含documentclass，返回找到的第一个。
-    P.S. 但愿没人把latex模板放在里面传进来 (6.25 加入判定latex模板的代码)
-    """
-    canidates = []
-    for texf in file_manifest:
-        if os.path.basename(texf).startswith('merge'):
-            continue
-        with open(texf, 'r', encoding='utf8') as f:
-            file_content = f.read()
-        if r'\documentclass' in file_content:
-            canidates.append(texf)
-        else:
-            continue
-
-    if len(canidates) == 0:
-        raise RuntimeError('无法找到一个主Tex文件（包含documentclass关键字）')
-    elif len(canidates) == 1:
-        return canidates[0]
-    else: # if len(canidates) >= 2 通过一些Latex模板中常见（但通常不会出现在正文）的单词，对不同latex源文件扣分，取评分最高者返回
-        canidates_score = []
-        # 给出一些判定模板文档的词作为扣分项
-        unexpected_words = ['\LaTeX', 'manuscript', 'Guidelines', 'font', 'citations', 'rejected', 'blind review', 'reviewers']
-        expected_words = ['\input', '\ref', '\cite']
-        for texf in canidates:
-            canidates_score.append(0)
-            with open(texf, 'r', encoding='utf8') as f:
-                file_content = f.read()
-            for uw in unexpected_words:
-                if uw in file_content:
-                    canidates_score[-1] -= 1
-            for uw in expected_words:
-                if uw in file_content:
-                    canidates_score[-1] += 1
-        select = np.argmax(canidates_score) # 取评分最高者返回
-        return canidates[select]
-    
-def rm_comments(main_file):
-    new_file_remove_comment_lines = []
-    for l in main_file.splitlines():
-        # 删除整行的空注释
-        if l.lstrip().startswith("%"):
-            pass
-        else:
-            new_file_remove_comment_lines.append(l)
-    main_file = '\n'.join(new_file_remove_comment_lines)
-    # main_file = re.sub(r"\\include{(.*?)}", r"\\input{\1}", main_file)  # 将 \include 命令转换为 \input 命令
-    main_file = re.sub(r'(?<!\\)%.*', '', main_file)  # 使用正则表达式查找半行注释, 并替换为空字符串
-    return main_file
-
-def merge_tex_files_(project_foler, main_file, mode):
-    """
-    Merge Tex project recrusively
-    """
-    main_file = rm_comments(main_file)
-    for s in reversed([q for q in re.finditer(r"\\input\{(.*?)\}", main_file, re.M)]):
-        f = s.group(1)
-        fp = os.path.join(project_foler, f)
-        if os.path.exists(fp):  
-            # e.g., \input{srcs/07_appendix.tex}
-            with open(fp, 'r', encoding='utf-8', errors='replace') as fx:
-                c = fx.read()
-        else:  
-            # e.g., \input{srcs/07_appendix}
-            with open(fp+'.tex', 'r', encoding='utf-8', errors='replace') as fx:
-                c = fx.read()
-        c = merge_tex_files_(project_foler, c, mode)
-        main_file = main_file[:s.span()[0]] + c + main_file[s.span()[1]:]
-    return main_file
-
-def merge_tex_files(project_foler, main_file, mode):
-    """
-    Merge Tex project recrusively
-    P.S. 顺便把CTEX塞进去以支持中文
-    P.S. 顺便把Latex的注释去除
-    """
-    main_file = merge_tex_files_(project_foler, main_file, mode)
-    main_file = rm_comments(main_file)
-
-    if mode == 'translate_zh':
-        # find paper documentclass
-        pattern = re.compile(r'\\documentclass.*\n')
-        match = pattern.search(main_file)
-        assert match is not None, "Cannot find documentclass statement!"
-        position = match.end()
-        add_ctex = '\\usepackage{ctex}\n'
-        add_url = '\\usepackage{url}\n' if '{url}' not in main_file else ''
-        main_file = main_file[:position] + add_ctex + add_url + main_file[position:]
-        # fontset=windows
-        import platform
-        main_file = re.sub(r"\\documentclass\[(.*?)\]{(.*?)}", r"\\documentclass[\1,fontset=windows,UTF8]{\2}",main_file)
-        main_file = re.sub(r"\\documentclass{(.*?)}", r"\\documentclass[fontset=windows,UTF8]{\1}",main_file)
-        # find paper abstract
-        pattern_opt1 = re.compile(r'\\begin\{abstract\}.*\n')
-        pattern_opt2 = re.compile(r"\\abstract\{(.*?)\}", flags=re.DOTALL)
-        match_opt1 = pattern_opt1.search(main_file)
-        match_opt2 = pattern_opt2.search(main_file)
-        assert (match_opt1 is not None) or (match_opt2 is not None), "Cannot find paper abstract section!"
-    return main_file
-
-
-
-"""
-========================================================================
-Post process
-========================================================================
-"""
-def mod_inbraket(match):
-    """
-    为啥chatgpt会把cite里面的逗号换成中文逗号呀 
-    """
-    # get the matched string
-    cmd = match.group(1)
-    str_to_modify = match.group(2)
-    # modify the matched string
-    str_to_modify = str_to_modify.replace('：', ':')    # 前面是中文冒号，后面是英文冒号
-    str_to_modify = str_to_modify.replace('，', ',')    # 前面是中文逗号，后面是英文逗号
-    # str_to_modify = 'BOOM'
-    return "\\" + cmd + "{" + str_to_modify + "}"
-
-def fix_content(final_tex, node_string):
-    """
-    Fix common GPT errors to increase success rate
-    """
-    final_tex = re.sub(r"(?<!\\)%", "\\%", final_tex)
-    final_tex = re.sub(r"\\([a-z]{2,10})\ \{", r"\\\1{", string=final_tex)
-    final_tex = re.sub(r"\\\ ([a-z]{2,10})\{", r"\\\1{", string=final_tex)
-    final_tex = re.sub(r"\\([a-z]{2,10})\{([^\}]*?)\}", mod_inbraket, string=final_tex)
-
-    if "Traceback" in final_tex and "[Local Message]" in final_tex:
-        final_tex = node_string # 出问题了，还原原文
-    if node_string.count('\\begin') != final_tex.count('\\begin'):
-        final_tex = node_string # 出问题了，还原原文
-    if node_string.count('\_') > 0 and node_string.count('\_') > final_tex.count('\_'):
-        # walk and replace any _ without \
-        final_tex = re.sub(r"(?<!\\)_", "\\_", final_tex)
-
-    def compute_brace_level(string):
-        # this function count the number of { and }
-        brace_level = 0
-        for c in string:
-            if c == "{": brace_level += 1
-            elif c == "}": brace_level -= 1
-        return brace_level
-    def join_most(tex_t, tex_o):
-        # this function join translated string and original string when something goes wrong
-        p_t = 0
-        p_o = 0
-        def find_next(string, chars, begin):
-            p = begin
-            while p < len(string):
-                if string[p] in chars: return p, string[p]
-                p += 1
-            return None, None
-        while True:
-            res1, char = find_next(tex_o, ['{','}'], p_o)
-            if res1 is None: break
-            res2, char = find_next(tex_t, [char], p_t)
-            if res2 is None: break
-            p_o = res1 + 1
-            p_t = res2 + 1
-        return tex_t[:p_t] + tex_o[p_o:]
-
-    if compute_brace_level(final_tex) != compute_brace_level(node_string):
-        # 出问题了，还原部分原文，保证括号正确
-        final_tex = join_most(final_tex, node_string)
-    return final_tex
-
-def split_subprocess(txt, project_folder, return_dict, opts):
-    """
-    break down latex file to a linked list,
-    each node use a preserve flag to indicate whether it should
-    be proccessed by GPT.
-    """
-    text = txt
-    mask = np.zeros(len(txt), dtype=np.uint8) + TRANSFORM
-
-    # 吸收title与作者以上的部分
-    text, mask = set_forbidden_text(text, mask, r"(.*?)\\maketitle", re.DOTALL)
-    # 吸收iffalse注释
-    text, mask = set_forbidden_text(text, mask, r"\\iffalse(.*?)\\fi", re.DOTALL)
-    # 吸收在42行以内的begin-end组合
-    text, mask = set_forbidden_text_begin_end(text, mask, r"\\begin\{([a-z\*]*)\}(.*?)\\end\{\1\}", re.DOTALL, limit_n_lines=42)
-    # 吸收匿名公式
-    text, mask = set_forbidden_text(text, mask, [ r"\$\$(.*?)\$\$",  r"\\\[.*?\\\]" ], re.DOTALL)
-    # 吸收其他杂项
-    text, mask = set_forbidden_text(text, mask, [ r"\\section\{(.*?)\}", r"\\section\*\{(.*?)\}", r"\\subsection\{(.*?)\}", r"\\subsubsection\{(.*?)\}" ])
-    text, mask = set_forbidden_text(text, mask, [ r"\\bibliography\{(.*?)\}", r"\\bibliographystyle\{(.*?)\}" ])
-    text, mask = set_forbidden_text(text, mask, r"\\begin\{thebibliography\}.*?\\end\{thebibliography\}", re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, r"\\begin\{lstlisting\}(.*?)\\end\{lstlisting\}", re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, r"\\begin\{wraptable\}(.*?)\\end\{wraptable\}", re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, r"\\begin\{algorithm\}(.*?)\\end\{algorithm\}", re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{wrapfigure\}(.*?)\\end\{wrapfigure\}", r"\\begin\{wrapfigure\*\}(.*?)\\end\{wrapfigure\*\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{figure\}(.*?)\\end\{figure\}", r"\\begin\{figure\*\}(.*?)\\end\{figure\*\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{multline\}(.*?)\\end\{multline\}", r"\\begin\{multline\*\}(.*?)\\end\{multline\*\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{table\}(.*?)\\end\{table\}", r"\\begin\{table\*\}(.*?)\\end\{table\*\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{minipage\}(.*?)\\end\{minipage\}", r"\\begin\{minipage\*\}(.*?)\\end\{minipage\*\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{align\*\}(.*?)\\end\{align\*\}", r"\\begin\{align\}(.*?)\\end\{align\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\begin\{equation\}(.*?)\\end\{equation\}", r"\\begin\{equation\*\}(.*?)\\end\{equation\*\}"], re.DOTALL)
-    text, mask = set_forbidden_text(text, mask, [r"\\includepdf\[(.*?)\]\{(.*?)\}", r"\\clearpage", r"\\newpage", r"\\appendix", r"\\tableofcontents", r"\\include\{(.*?)\}"])
-    text, mask = set_forbidden_text(text, mask, [r"\\vspace\{(.*?)\}", r"\\hspace\{(.*?)\}", r"\\label\{(.*?)\}", r"\\begin\{(.*?)\}", r"\\end\{(.*?)\}", r"\\item "])
-    text, mask = set_forbidden_text_careful_brace(text, mask, r"\\hl\{(.*?)\}", re.DOTALL)
-    # reverse 操作必须放在最后
-    text, mask = reverse_forbidden_text_careful_brace(text, mask, r"\\caption\{(.*?)\}", re.DOTALL, forbid_wrapper=True)
-    text, mask = reverse_forbidden_text_careful_brace(text, mask, r"\\abstract\{(.*?)\}", re.DOTALL, forbid_wrapper=True)
-    text, mask = reverse_forbidden_text(text, mask, r"\\begin\{abstract\}(.*?)\\end\{abstract\}", re.DOTALL, forbid_wrapper=True)
-    root = convert_to_linklist(text, mask)
-
-    # 修复括号
-    node = root
-    while True:
-        string = node.string
-        if node.preserve: 
-            node = node.next
-            if node is None: break
-            continue
-        def break_check(string):
-            str_stack = [""] # (lv, index)
-            for i, c in enumerate(string):
-                if c == '{':
-                    str_stack.append('{')
-                elif c == '}':
-                    if len(str_stack) == 1:
-                        print('stack fix')
-                        return i
-                    str_stack.pop(-1)
-                else:
-                    str_stack[-1] += c
-            return -1
-        bp = break_check(string)
-
-        if bp == -1:
-            pass
-        elif bp == 0:
-            node.string = string[:1]
-            q = LinkedListNode(string[1:], False)
-            q.next = node.next
-            node.next = q
-        else:
-            node.string = string[:bp]
-            q = LinkedListNode(string[bp:], False)
-            q.next = node.next
-            node.next = q
-
-        node = node.next
-        if node is None: break
-
-    # 屏蔽空行和太短的句子
-    node = root
-    while True:
-        if len(node.string.strip('\n').strip(''))==0: node.preserve = True
-        if len(node.string.strip('\n').strip(''))<42: node.preserve = True
-        node = node.next
-        if node is None: break
-    node = root
-    while True:
-        if node.next and node.preserve and node.next.preserve:
-            node.string += node.next.string
-            node.next = node.next.next
-        node = node.next
-        if node is None: break
-
-    # 将前后断行符脱离
-    node = root
-    prev_node = None
-    while True:
-        if not node.preserve:
-            lstriped_ = node.string.lstrip().lstrip('\n')
-            if (prev_node is not None) and (prev_node.preserve) and (len(lstriped_)!=len(node.string)):
-                prev_node.string += node.string[:-len(lstriped_)]
-                node.string = lstriped_
-            rstriped_ = node.string.rstrip().rstrip('\n')
-            if (node.next is not None) and (node.next.preserve) and (len(rstriped_)!=len(node.string)):
-                node.next.string = node.string[len(rstriped_):] + node.next.string
-                node.string = rstriped_
-        # =====
-        prev_node = node
-        node = node.next
-        if node is None: break
-    # 输出html调试文件，用红色标注处保留区（PRESERVE），用黑色标注转换区（TRANSFORM）
-    with open(pj(project_folder, 'debug_log.html'), 'w', encoding='utf8') as f:
-        segment_parts_for_gpt = []
-        nodes = []
-        node = root
-        while True:
-            nodes.append(node)
-            show_html = node.string.replace('\n','<br/>')
-            if not node.preserve:
-                segment_parts_for_gpt.append(node.string)
-                f.write(f'<p style="color:black;">#{show_html}#</p>')
-            else:
-                f.write(f'<p style="color:red;">{show_html}</p>')
-            node = node.next
-            if node is None: break
-
-    for n in nodes: n.next = None   # break
-    return_dict['nodes'] = nodes
-    return_dict['segment_parts_for_gpt'] = segment_parts_for_gpt
-    return return_dict
-
-
-
-class LatexPaperSplit():
-    """
-    break down latex file to a linked list,
-    each node use a preserve flag to indicate whether it should
-    be proccessed by GPT.
-    """
-    def __init__(self) -> None:
-        self.nodes = None
-        self.msg = "*{\\scriptsize\\textbf{警告：该PDF由GPT-Academic开源项目调用大语言模型+Latex翻译插件一键生成，" + \
-            "版权归原文作者所有。翻译内容可靠性无保障，请仔细鉴别并以原文为准。" + \
-            "项目Github地址 \\url{https://github.com/binary-husky/gpt_academic/}。"
-        # 请您不要删除或修改这行警告，除非您是论文的原作者（如果您是论文原作者，欢迎加REAME中的QQ联系开发者）
-        self.msg_declare = "为了防止大语言模型的意外谬误产生扩散影响，禁止移除或修改此警告。}}\\\\" 
-
-    def merge_result(self, arr, mode, msg):
-        """
-        Merge the result after the GPT process completed
-        """
-        result_string = ""
-        p = 0
-        for node in self.nodes:
-            if node.preserve:
-                result_string += node.string
-            else:
-                result_string += fix_content(arr[p], node.string)
-                p += 1
-        if mode == 'translate_zh':
-            pattern = re.compile(r'\\begin\{abstract\}.*\n')
-            match = pattern.search(result_string)
-            if not match:
-                # match \abstract{xxxx}
-                pattern_compile = re.compile(r"\\abstract\{(.*?)\}", flags=re.DOTALL)
-                match = pattern_compile.search(result_string)
-                position = match.regs[1][0]
-            else:
-                # match \begin{abstract}xxxx\end{abstract}
-                position = match.end()
-            result_string = result_string[:position] + self.msg + msg + self.msg_declare + result_string[position:]
-        return result_string
-
-    def split(self, txt, project_folder, opts): 
-        """
-        break down latex file to a linked list,
-        each node use a preserve flag to indicate whether it should
-        be proccessed by GPT.
-        P.S. use multiprocessing to avoid timeout error
-        """
-        import multiprocessing
-        manager = multiprocessing.Manager()
-        return_dict = manager.dict()
-        p = multiprocessing.Process(
-            target=split_subprocess, 
-            args=(txt, project_folder, return_dict, opts))
-        p.start()
-        p.join()
-        p.close()
-        self.nodes = return_dict['nodes']
-        self.sp = return_dict['segment_parts_for_gpt']
-        return self.sp
-
-
-
-class LatexPaperFileGroup():
-    """
-    use tokenizer to break down text according to max_token_limit
-    """
-    def __init__(self):
-        self.file_paths = []
-        self.file_contents = []
-        self.sp_file_contents = []
-        self.sp_file_index = []
-        self.sp_file_tag = []
-
-        # count_token
-        from request_llm.bridge_all import model_info
-        enc = model_info["gpt-3.5-turbo"]['tokenizer']
-        def get_token_num(txt): return len(enc.encode(txt, disallowed_special=()))
-        self.get_token_num = get_token_num
-
-    def run_file_split(self, max_token_limit=1900):
-        """
-        use tokenizer to break down text according to max_token_limit
-        """
-        for index, file_content in enumerate(self.file_contents):
-            if self.get_token_num(file_content) < max_token_limit:
-                self.sp_file_contents.append(file_content)
-                self.sp_file_index.append(index)
-                self.sp_file_tag.append(self.file_paths[index])
-            else:
-                from .crazy_utils import breakdown_txt_to_satisfy_token_limit_for_pdf
-                segments = breakdown_txt_to_satisfy_token_limit_for_pdf(file_content, self.get_token_num, max_token_limit)
-                for j, segment in enumerate(segments):
-                    self.sp_file_contents.append(segment)
-                    self.sp_file_index.append(index)
-                    self.sp_file_tag.append(self.file_paths[index] + f".part-{j}.tex")
-        print('Segmentation: done')
-
-    def merge_result(self):
-        self.file_result = ["" for _ in range(len(self.file_paths))]
-        for r, k in zip(self.sp_file_result, self.sp_file_index):
-            self.file_result[k] += r
-
-    def write_result(self):
-        manifest = []
-        for path, res in zip(self.file_paths, self.file_result):
-            with open(path + '.polish.tex', 'w', encoding='utf8') as f:
-                manifest.append(path + '.polish.tex')
-                f.write(res)
-        return manifest
-
-def write_html(sp_file_contents, sp_file_result, chatbot, project_folder):
-
-    # write html
-    try:
-        import shutil
-        from .crazy_utils import construct_html
-        from toolbox import gen_time_str
-        ch = construct_html() 
-        orig = ""
-        trans = ""
-        final = []
-        for c,r in zip(sp_file_contents, sp_file_result): 
-            final.append(c)
-            final.append(r)
-        for i, k in enumerate(final): 
-            if i%2==0:
-                orig = k
-            if i%2==1:
-                trans = k
-                ch.add_row(a=orig, b=trans)
-        create_report_file_name = f"{gen_time_str()}.trans.html"
-        ch.save_file(create_report_file_name)
-        shutil.copyfile(pj('./gpt_log/', create_report_file_name), pj(project_folder, create_report_file_name))
-        promote_file_to_downloadzone(file=f'./gpt_log/{create_report_file_name}', chatbot=chatbot)
-    except:
-        from toolbox import trimmed_format_exc
-        print('writing html result failed:', trimmed_format_exc())
-
-def Latex精细分解与转化(file_manifest, project_folder, llm_kwargs, plugin_kwargs, chatbot, history, system_prompt, mode='proofread', switch_prompt=None, opts=[]):
-    import time, os, re
-    from .crazy_utils import request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency
-    from .latex_utils import LatexPaperFileGroup, merge_tex_files, LatexPaperSplit, 寻找Latex主文件
-
-    #  <-------- 寻找主tex文件 ----------> 
-    maintex = 寻找Latex主文件(file_manifest, mode)
-    chatbot.append((f"定位主Latex文件", f'[Local Message] 分析结果：该项目的Latex主文件是{maintex}, 如果分析错误, 请立即终止程序, 删除或修改歧义文件, 然后重试。主程序即将开始, 请稍候。'))
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-    time.sleep(3)
-
-    #  <-------- 读取Latex文件, 将多文件tex工程融合为一个巨型tex ----------> 
-    main_tex_basename = os.path.basename(maintex)
-    assert main_tex_basename.endswith('.tex')
-    main_tex_basename_bare = main_tex_basename[:-4]
-    may_exist_bbl = pj(project_folder, f'{main_tex_basename_bare}.bbl')
-    if os.path.exists(may_exist_bbl):
-        shutil.copyfile(may_exist_bbl, pj(project_folder, f'merge.bbl'))
-        shutil.copyfile(may_exist_bbl, pj(project_folder, f'merge_{mode}.bbl'))
-        shutil.copyfile(may_exist_bbl, pj(project_folder, f'merge_diff.bbl'))
-
-    with open(maintex, 'r', encoding='utf-8', errors='replace') as f:
-        content = f.read()
-        merged_content = merge_tex_files(project_folder, content, mode)
-
-    with open(project_folder + '/merge.tex', 'w', encoding='utf-8', errors='replace') as f:
-        f.write(merged_content)
-
-    #  <-------- 精细切分latex文件 ----------> 
-    chatbot.append((f"Latex文件融合完成", f'[Local Message] 正在精细切分latex文件，这需要一段时间计算，文档越长耗时越长，请耐心等待。'))
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-    lps = LatexPaperSplit()
-    res = lps.split(merged_content, project_folder, opts) # 消耗时间的函数
-
-    #  <-------- 拆分过长的latex片段 ----------> 
-    pfg = LatexPaperFileGroup()
-    for index, r in enumerate(res):
-        pfg.file_paths.append('segment-' + str(index))
-        pfg.file_contents.append(r)
-
-    pfg.run_file_split(max_token_limit=1024)
-    n_split = len(pfg.sp_file_contents)
-
-    #  <-------- 根据需要切换prompt ----------> 
-    inputs_array, sys_prompt_array = switch_prompt(pfg, mode)
-    inputs_show_user_array = [f"{mode} {f}" for f in pfg.sp_file_tag]
-
-    if os.path.exists(pj(project_folder,'temp.pkl')):
-
-        #  <-------- 【仅调试】如果存在调试缓存文件，则跳过GPT请求环节 ----------> 
-        pfg = objload(file=pj(project_folder,'temp.pkl'))
-
-    else:
-        #  <-------- gpt 多线程请求 ----------> 
-        gpt_response_collection = yield from request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency(
-            inputs_array=inputs_array,
-            inputs_show_user_array=inputs_show_user_array,
-            llm_kwargs=llm_kwargs,
-            chatbot=chatbot,
-            history_array=[[""] for _ in range(n_split)],
-            sys_prompt_array=sys_prompt_array,
-            # max_workers=5,  # 并行任务数量限制, 最多同时执行5个, 其他的排队等待
-            scroller_max_len = 40
-        )
-
-        #  <-------- 文本碎片重组为完整的tex片段 ----------> 
-        pfg.sp_file_result = []
-        for i_say, gpt_say, orig_content in zip(gpt_response_collection[0::2], gpt_response_collection[1::2], pfg.sp_file_contents):
-            pfg.sp_file_result.append(gpt_say)
-        pfg.merge_result()
-
-        # <-------- 临时存储用于调试 ----------> 
-        pfg.get_token_num = None
-        objdump(pfg, file=pj(project_folder,'temp.pkl'))
-
-    write_html(pfg.sp_file_contents, pfg.sp_file_result, chatbot=chatbot, project_folder=project_folder)
-
-    #  <-------- 写出文件 ----------> 
-    msg = f"当前大语言模型: {llm_kwargs['llm_model']}，当前语言模型温度设定: {llm_kwargs['temperature']}。"
-    final_tex = lps.merge_result(pfg.file_result, mode, msg)
-    with open(project_folder + f'/merge_{mode}.tex', 'w', encoding='utf-8', errors='replace') as f:
-        if mode != 'translate_zh' or "binary" in final_tex: f.write(final_tex)
-        
-
-    #  <-------- 整理结果, 退出 ----------> 
-    chatbot.append((f"完成了吗？", 'GPT结果已输出, 正在编译PDF'))
-    yield from update_ui(chatbot=chatbot, history=history) # 刷新界面
-
-    #  <-------- 返回 ----------> 
-    return project_folder + f'/merge_{mode}.tex'
-
-
-
-def remove_buggy_lines(file_path, log_path, tex_name, tex_name_pure, n_fix, work_folder_modified):
-    try:
-        with open(log_path, 'r', encoding='utf-8', errors='replace') as f:
-            log = f.read()
-        with open(file_path, 'r', encoding='utf-8', errors='replace') as f:
-            file_lines = f.readlines()
-        import re
-        buggy_lines = re.findall(tex_name+':([0-9]{1,5}):', log)
-        buggy_lines = [int(l) for l in buggy_lines]
-        buggy_lines = sorted(buggy_lines)
-        print("removing lines that has errors", buggy_lines)
-        file_lines.pop(buggy_lines[0]-1)
-        with open(pj(work_folder_modified, f"{tex_name_pure}_fix_{n_fix}.tex"), 'w', encoding='utf-8', errors='replace') as f:
-            f.writelines(file_lines)
-        return True, f"{tex_name_pure}_fix_{n_fix}", buggy_lines
-    except:
-        print("Fatal error occurred, but we cannot identify error, please download zip, read latex log, and compile manually.")
-        return False, -1, [-1]
-    
-def compile_latex_with_timeout(command, cwd, timeout=60):
-    import subprocess
-    process = subprocess.Popen(command, shell=True, stdout=subprocess.PIPE, stderr=subprocess.PIPE, cwd=cwd)
-    try:
-        stdout, stderr = process.communicate(timeout=timeout)
-    except subprocess.TimeoutExpired:
-        process.kill()
-        stdout, stderr = process.communicate()
-        print("Process timed out!")
-        return False
-    return True
-
-def 编译Latex(chatbot, history, main_file_original, main_file_modified, work_folder_original, work_folder_modified, work_folder, mode='default'):
-    import os, time
-    current_dir = os.getcwd()
-    n_fix = 1
-    max_try = 32
-    chatbot.append([f"正在编译PDF文档", f'编译已经开始。当前工作路径为{work_folder}，如果程序停顿5分钟以上，请直接去该路径下取回翻译结果，或者重启之后再度尝试 ...']); yield from update_ui(chatbot=chatbot, history=history)
-    chatbot.append([f"正在编译PDF文档", '...']); yield from update_ui(chatbot=chatbot, history=history); time.sleep(1); chatbot[-1] = list(chatbot[-1]) # 刷新界面
-    yield from update_ui_lastest_msg('编译已经开始...', chatbot, history)   # 刷新Gradio前端界面
-
-    while True:
-        import os
-
-        # https://stackoverflow.com/questions/738755/dont-make-me-manually-abort-a-latex-compile-when-theres-an-error
-        yield from update_ui_lastest_msg(f'尝试第 {n_fix}/{max_try} 次编译, 编译原始PDF ...', chatbot, history)   # 刷新Gradio前端界面
-        ok = compile_latex_with_timeout(f'pdflatex -interaction=batchmode -file-line-error {main_file_original}.tex', work_folder_original)
-
-        yield from update_ui_lastest_msg(f'尝试第 {n_fix}/{max_try} 次编译, 编译转化后的PDF ...', chatbot, history)   # 刷新Gradio前端界面
-        ok = compile_latex_with_timeout(f'pdflatex -interaction=batchmode -file-line-error {main_file_modified}.tex', work_folder_modified)
-        
-        if ok and os.path.exists(pj(work_folder_modified, f'{main_file_modified}.pdf')):
-            # 只有第二步成功，才能继续下面的步骤
-            yield from update_ui_lastest_msg(f'尝试第 {n_fix}/{max_try} 次编译, 编译BibTex ...', chatbot, history)    # 刷新Gradio前端界面
-            if not os.path.exists(pj(work_folder_original, f'{main_file_original}.bbl')):
-                ok = compile_latex_with_timeout(f'bibtex  {main_file_original}.aux', work_folder_original)
-            if not os.path.exists(pj(work_folder_modified, f'{main_file_modified}.bbl')):
-                ok = compile_latex_with_timeout(f'bibtex  {main_file_modified}.aux', work_folder_modified)
-
-            yield from update_ui_lastest_msg(f'尝试第 {n_fix}/{max_try} 次编译, 编译文献交叉引用 ...', chatbot, history)  # 刷新Gradio前端界面
-            ok = compile_latex_with_timeout(f'pdflatex -interaction=batchmode -file-line-error {main_file_original}.tex', work_folder_original)
-            ok = compile_latex_with_timeout(f'pdflatex -interaction=batchmode -file-line-error {main_file_modified}.tex', work_folder_modified)
-            ok = compile_latex_with_timeout(f'pdflatex -interaction=batchmode -file-line-error {main_file_original}.tex', work_folder_original)
-            ok = compile_latex_with_timeout(f'pdflatex -interaction=batchmode -file-line-error {main_file_modified}.tex', work_folder_modified)
-
-            if mode!='translate_zh':
-                yield from update_ui_lastest_msg(f'尝试第 {n_fix}/{max_try} 次编译, 使用latexdiff生成论文转化前后对比 ...', chatbot, history) # 刷新Gradio前端界面
-                print(    f'latexdiff --encoding=utf8 --append-safecmd=subfile {work_folder_original}/{main_file_original}.tex  {work_folder_modified}/{main_file_modified}.tex --flatten > {work_folder}/merge_diff.tex')
-                ok = compile_latex_with_timeout(f'latexdiff --encoding=utf8 --append-safecmd=subfile {work_folder_original}/{main_file_original}.tex  {work_folder_modified}/{main_file_modified}.tex --flatten > {work_folder}/merge_diff.tex')
-
-                yield from update_ui_lastest_msg(f'尝试第 {n_fix}/{max_try} 次编译, 正在编译对比PDF ...', chatbot, history)   # 刷新Gradio前端界面
-                ok = compile_latex_with_timeout(f'pdflatex  -interaction=batchmode -file-line-error merge_diff.tex', work_folder)
-                ok = compile_latex_with_timeout(f'bibtex    merge_diff.aux', work_folder)
-                ok = compile_latex_with_timeout(f'pdflatex  -interaction=batchmode -file-line-error merge_diff.tex', work_folder)
-                ok = compile_latex_with_timeout(f'pdflatex  -interaction=batchmode -file-line-error merge_diff.tex', work_folder)
-
-
-        # <---------- 检查结果 ----------->
-        results_ = ""
-        original_pdf_success = os.path.exists(pj(work_folder_original, f'{main_file_original}.pdf'))
-        modified_pdf_success = os.path.exists(pj(work_folder_modified, f'{main_file_modified}.pdf'))
-        diff_pdf_success     = os.path.exists(pj(work_folder, f'merge_diff.pdf'))
-        results_ += f"原始PDF编译是否成功: {original_pdf_success};" 
-        results_ += f"转化PDF编译是否成功: {modified_pdf_success};" 
-        results_ += f"对比PDF编译是否成功: {diff_pdf_success};" 
-        yield from update_ui_lastest_msg(f'第{n_fix}编译结束:<br/>{results_}...', chatbot, history) # 刷新Gradio前端界面
-
-        if diff_pdf_success:
-            result_pdf = pj(work_folder_modified, f'merge_diff.pdf')    # get pdf path
-            promote_file_to_downloadzone(result_pdf, rename_file=None, chatbot=chatbot)  # promote file to web UI
-        if modified_pdf_success:
-            yield from update_ui_lastest_msg(f'转化PDF编译已经成功, 即将退出 ...', chatbot, history)    # 刷新Gradio前端界面
-            result_pdf = pj(work_folder_modified, f'{main_file_modified}.pdf') # get pdf path
-            if os.path.exists(pj(work_folder, '..', 'translation')):
-                shutil.copyfile(result_pdf, pj(work_folder, '..', 'translation', 'translate_zh.pdf'))
-            promote_file_to_downloadzone(result_pdf, rename_file=None, chatbot=chatbot)  # promote file to web UI
-            return True # 成功啦
-        else:
-            if n_fix>=max_try: break
-            n_fix += 1
-            can_retry, main_file_modified, buggy_lines = remove_buggy_lines(
-                file_path=pj(work_folder_modified, f'{main_file_modified}.tex'), 
-                log_path=pj(work_folder_modified, f'{main_file_modified}.log'),
-                tex_name=f'{main_file_modified}.tex',
-                tex_name_pure=f'{main_file_modified}',
-                n_fix=n_fix,
-                work_folder_modified=work_folder_modified,
-            )
-            yield from update_ui_lastest_msg(f'由于最为关键的转化PDF编译失败, 将根据报错信息修正tex源文件并重试, 当前报错的latex代码处于第{buggy_lines}行 ...', chatbot, history)   # 刷新Gradio前端界面
-            if not can_retry: break
-
-    return False # 失败啦
-
-
-

crazy_functions/live_audio/aliyunASR.py

@@ -1,261 +0,0 @@
-import time, logging, json, sys, struct
-import numpy as np
-from scipy.io.wavfile import WAVE_FORMAT
-
-def write_numpy_to_wave(filename, rate, data, add_header=False):
-    """
-    Write a NumPy array as a WAV file.
-    """
-    def _array_tofile(fid, data):
-        # ravel gives a c-contiguous buffer
-        fid.write(data.ravel().view('b').data)
-
-    if hasattr(filename, 'write'):
-        fid = filename
-    else:
-        fid = open(filename, 'wb')
-
-    fs = rate
-
-    try:
-        dkind = data.dtype.kind
-        if not (dkind == 'i' or dkind == 'f' or (dkind == 'u' and
-                                                 data.dtype.itemsize == 1)):
-            raise ValueError("Unsupported data type '%s'" % data.dtype)
-
-        header_data = b''
-
-        header_data += b'RIFF'
-        header_data += b'\x00\x00\x00\x00'
-        header_data += b'WAVE'
-
-        # fmt chunk
-        header_data += b'fmt '
-        if dkind == 'f':
-            format_tag = WAVE_FORMAT.IEEE_FLOAT
-        else:
-            format_tag = WAVE_FORMAT.PCM
-        if data.ndim == 1:
-            channels = 1
-        else:
-            channels = data.shape[1]
-        bit_depth = data.dtype.itemsize * 8
-        bytes_per_second = fs*(bit_depth // 8)*channels
-        block_align = channels * (bit_depth // 8)
-
-        fmt_chunk_data = struct.pack('<HHIIHH', format_tag, channels, fs,
-                                     bytes_per_second, block_align, bit_depth)
-        if not (dkind == 'i' or dkind == 'u'):
-            # add cbSize field for non-PCM files
-            fmt_chunk_data += b'\x00\x00'
-
-        header_data += struct.pack('<I', len(fmt_chunk_data))
-        header_data += fmt_chunk_data
-
-        # fact chunk (non-PCM files)
-        if not (dkind == 'i' or dkind == 'u'):
-            header_data += b'fact'
-            header_data += struct.pack('<II', 4, data.shape[0])
-
-        # check data size (needs to be immediately before the data chunk)
-        if ((len(header_data)-4-4) + (4+4+data.nbytes)) > 0xFFFFFFFF:
-            raise ValueError("Data exceeds wave file size limit")
-        if add_header:
-            fid.write(header_data)
-            # data chunk
-            fid.write(b'data')
-            fid.write(struct.pack('<I', data.nbytes))
-            if data.dtype.byteorder == '>' or (data.dtype.byteorder == '=' and
-                                            sys.byteorder == 'big'):
-                data = data.byteswap()
-        _array_tofile(fid, data)
-
-        if add_header:
-            # Determine file size and place it in correct
-            #  position at start of the file.
-            size = fid.tell()
-            fid.seek(4)
-            fid.write(struct.pack('<I', size-8))
-
-    finally:
-        if not hasattr(filename, 'write'):
-            fid.close()
-        else:
-            fid.seek(0)
-
-def is_speaker_speaking(vad, data, sample_rate):
-    # Function to detect if the speaker is speaking
-    # The WebRTC VAD only accepts 16-bit mono PCM audio, 
-    # sampled at 8000, 16000, 32000 or 48000 Hz. 
-    # A frame must be either 10, 20, or 30 ms in duration:
-    frame_duration = 30
-    n_bit_each = int(sample_rate * frame_duration / 1000)*2 # x2 because audio is 16 bit (2 bytes)
-    res_list = []
-    for t in range(len(data)):
-        if t!=0 and t % n_bit_each == 0:
-            res_list.append(vad.is_speech(data[t-n_bit_each:t], sample_rate))
-    
-    info = ''.join(['^' if r else '.' for r in res_list])
-    info = info[:10]
-    if any(res_list):
-        return True, info
-    else:
-        return False, info
-
-
-class AliyunASR():
-
-    def test_on_sentence_begin(self, message, *args):
-        # print("test_on_sentence_begin:{}".format(message))
-        pass
-
-    def test_on_sentence_end(self, message, *args):
-        # print("test_on_sentence_end:{}".format(message))
-        message = json.loads(message)
-        self.parsed_sentence = message['payload']['result']
-        self.event_on_entence_end.set()
-        # print(self.parsed_sentence)
-
-    def test_on_start(self, message, *args):
-        # print("test_on_start:{}".format(message))
-        pass
-
-    def test_on_error(self, message, *args):
-        logging.error("on_error args=>{}".format(args))
-        pass
-
-    def test_on_close(self, *args):
-        self.aliyun_service_ok = False
-        pass
-
-    def test_on_result_chg(self, message, *args):
-        # print("test_on_chg:{}".format(message))
-        message = json.loads(message)
-        self.parsed_text = message['payload']['result']
-        self.event_on_result_chg.set()
-
-    def test_on_completed(self, message, *args):
-        # print("on_completed:args=>{} message=>{}".format(args, message))
-        pass
-
-    def audio_convertion_thread(self, uuid):
-        # 在一个异步线程中采集音频
-        import nls  # pip install git+https://github.com/aliyun/alibabacloud-nls-python-sdk.git
-        import tempfile
-        from scipy import io
-        from toolbox import get_conf
-        from .audio_io import change_sample_rate
-        from .audio_io import RealtimeAudioDistribution
-        NEW_SAMPLERATE = 16000
-        rad = RealtimeAudioDistribution()
-        rad.clean_up()
-        temp_folder = tempfile.gettempdir()
-        TOKEN, APPKEY = get_conf('ALIYUN_TOKEN', 'ALIYUN_APPKEY')
-        if len(TOKEN) == 0:
-            TOKEN = self.get_token()
-        self.aliyun_service_ok = True
-        URL="wss://nls-gateway.aliyuncs.com/ws/v1"
-        sr = nls.NlsSpeechTranscriber(
-                    url=URL,
-                    token=TOKEN,
-                    appkey=APPKEY,
-                    on_sentence_begin=self.test_on_sentence_begin,
-                    on_sentence_end=self.test_on_sentence_end,
-                    on_start=self.test_on_start,
-                    on_result_changed=self.test_on_result_chg,
-                    on_completed=self.test_on_completed,
-                    on_error=self.test_on_error,
-                    on_close=self.test_on_close,
-                    callback_args=[uuid.hex]
-                )
-        timeout_limit_second = 20
-        r = sr.start(aformat="pcm",
-                timeout=timeout_limit_second,
-                enable_intermediate_result=True,
-                enable_punctuation_prediction=True,
-                enable_inverse_text_normalization=True)
-
-        import webrtcvad
-        vad = webrtcvad.Vad()
-        vad.set_mode(1)
-
-        is_previous_frame_transmitted = False   # 上一帧是否有人说话
-        previous_frame_data = None
-        echo_cnt = 0        # 在没有声音之后，继续向服务器发送n次音频数据
-        echo_cnt_max = 4   # 在没有声音之后，继续向服务器发送n次音频数据
-        keep_alive_last_send_time = time.time()
-        while not self.stop:
-            # time.sleep(self.capture_interval)
-            audio = rad.read(uuid.hex) 
-            if audio is not None:
-                # convert to pcm file
-                temp_file = f'{temp_folder}/{uuid.hex}.pcm' # 
-                dsdata = change_sample_rate(audio, rad.rate, NEW_SAMPLERATE) # 48000 --> 16000
-                write_numpy_to_wave(temp_file, NEW_SAMPLERATE, dsdata)
-                # read pcm binary
-                with open(temp_file, "rb") as f: data = f.read()
-                is_speaking, info = is_speaker_speaking(vad, data, NEW_SAMPLERATE)
-
-                if is_speaking or echo_cnt > 0:
-                    # 如果话筒激活 / 如果处于回声收尾阶段
-                    echo_cnt -= 1
-                    if not is_previous_frame_transmitted:   # 上一帧没有人声，但是我们把上一帧同样加上
-                        if previous_frame_data is not None: data = previous_frame_data + data
-                    if is_speaking:
-                        echo_cnt = echo_cnt_max
-                    slices = zip(*(iter(data),) * 640)      # 640个字节为一组
-                    for i in slices: sr.send_audio(bytes(i))
-                    keep_alive_last_send_time = time.time()
-                    is_previous_frame_transmitted = True
-                else:
-                    is_previous_frame_transmitted = False
-                    echo_cnt = 0
-                    # 保持链接激活，即使没有声音，也根据时间间隔，发送一些音频片段给服务器
-                    if time.time() - keep_alive_last_send_time > timeout_limit_second/2:
-                        slices = zip(*(iter(data),) * 640)    # 640个字节为一组
-                        for i in slices: sr.send_audio(bytes(i))
-                        keep_alive_last_send_time = time.time()
-                        is_previous_frame_transmitted = True
-                self.audio_shape = info
-            else:
-                time.sleep(0.1)
-
-            if not self.aliyun_service_ok:
-                self.stop = True
-                self.stop_msg = 'Aliyun音频服务异常，请检查ALIYUN_TOKEN和ALIYUN_APPKEY是否过期。'
-        r = sr.stop()
-
-    def get_token(self):
-        from toolbox import get_conf
-        import json
-        from aliyunsdkcore.request import CommonRequest
-        from aliyunsdkcore.client import AcsClient
-        AccessKey_ID, AccessKey_secret = get_conf('ALIYUN_ACCESSKEY', 'ALIYUN_SECRET')
-
-        # 创建AcsClient实例
-        client = AcsClient(
-            AccessKey_ID,
-            AccessKey_secret,
-            "cn-shanghai"
-        )
-
-        # 创建request，并设置参数。
-        request = CommonRequest()
-        request.set_method('POST')
-        request.set_domain('nls-meta.cn-shanghai.aliyuncs.com')
-        request.set_version('2019-02-28')
-        request.set_action_name('CreateToken')
-
-        try:
-            response = client.do_action_with_exception(request)
-            print(response)
-            jss = json.loads(response)
-            if 'Token' in jss and 'Id' in jss['Token']:
-                token = jss['Token']['Id']
-                expireTime = jss['Token']['ExpireTime']
-                print("token = " + token)
-                print("expireTime = " + str(expireTime))
-        except Exception as e:
-            print(e)
-
-        return token

crazy_functions/live_audio/audio_io.py

@@ -1,51 +0,0 @@
-import numpy as np
-from scipy import interpolate
-
-def Singleton(cls):
-    _instance = {}
- 
-    def _singleton(*args, **kargs):
-        if cls not in _instance:
-            _instance[cls] = cls(*args, **kargs)
-        return _instance[cls]
- 
-    return _singleton
-
-
-@Singleton
-class RealtimeAudioDistribution():
-    def __init__(self) -> None:
-        self.data = {}
-        self.max_len = 1024*1024
-        self.rate = 48000   # 只读，每秒采样数量
-
-    def clean_up(self):
-        self.data = {}
-
-    def feed(self, uuid, audio):
-        self.rate, audio_ = audio
-        # print('feed', len(audio_), audio_[-25:])
-        if uuid not in self.data:
-            self.data[uuid] = audio_
-        else:
-            new_arr = np.concatenate((self.data[uuid], audio_))
-            if len(new_arr) > self.max_len: new_arr = new_arr[-self.max_len:]
-            self.data[uuid] = new_arr
-
-    def read(self, uuid):
-        if uuid in self.data:
-            res = self.data.pop(uuid)
-            # print('\r read-', len(res), '-', max(res), end='', flush=True)
-        else:
-            res = None
-        return res
-    
-def change_sample_rate(audio, old_sr, new_sr):
-    duration = audio.shape[0] / old_sr
-
-    time_old  = np.linspace(0, duration, audio.shape[0])
-    time_new  = np.linspace(0, duration, int(audio.shape[0] * new_sr / old_sr))
-
-    interpolator = interpolate.interp1d(time_old, audio.T)
-    new_audio = interpolator(time_new).T
-    return new_audio.astype(np.int16)

crazy_functions/multi_stage/multi_stage_utils.py

@@ -1,93 +0,0 @@
-from pydantic import BaseModel, Field
-from typing import List
-from toolbox import update_ui_lastest_msg, disable_auto_promotion
-from toolbox import CatchException, update_ui, get_conf, select_api_key, get_log_folder
-from request_llms.bridge_all import predict_no_ui_long_connection
-from crazy_functions.json_fns.pydantic_io import GptJsonIO, JsonStringError
-import time
-import pickle
-
-def have_any_recent_upload_files(chatbot):
-    _5min = 5 * 60
-    if not chatbot: return False    # chatbot is None
-    most_recent_uploaded = chatbot._cookies.get("most_recent_uploaded", None)
-    if not most_recent_uploaded: return False   # most_recent_uploaded is None
-    if time.time() - most_recent_uploaded["time"] < _5min: return True # most_recent_uploaded is new
-    else: return False  # most_recent_uploaded is too old
-
-class GptAcademicState():
-    def __init__(self):
-        self.reset()
-
-    def reset(self):
-        pass
-
-    def dump_state(self, chatbot):
-        chatbot._cookies['plugin_state'] = pickle.dumps(self)
-
-    def set_state(self, chatbot, key, value):
-        setattr(self, key, value)
-        chatbot._cookies['plugin_state'] = pickle.dumps(self)
-
-    def get_state(chatbot, cls=None):
-        state = chatbot._cookies.get('plugin_state', None)
-        if state is not None:   state = pickle.loads(state)
-        elif cls is not None:   state = cls()
-        else:                   state = GptAcademicState()
-        state.chatbot = chatbot
-        return state
-
-
-class GptAcademicGameBaseState():
-    """
-    1. first init: __init__ -> 
-    """
-    def init_game(self, chatbot, lock_plugin):
-        self.plugin_name = None
-        self.callback_fn = None
-        self.delete_game = False
-        self.step_cnt = 0
-
-    def lock_plugin(self, chatbot):
-        if self.callback_fn is None:
-            raise ValueError("callback_fn is None")
-        chatbot._cookies['lock_plugin'] = self.callback_fn
-        self.dump_state(chatbot)
-        
-    def get_plugin_name(self):
-        if self.plugin_name is None:
-            raise ValueError("plugin_name is None")
-        return self.plugin_name
-
-    def dump_state(self, chatbot):
-        chatbot._cookies[f'plugin_state/{self.get_plugin_name()}'] = pickle.dumps(self)
-
-    def set_state(self, chatbot, key, value):
-        setattr(self, key, value)
-        chatbot._cookies[f'plugin_state/{self.get_plugin_name()}'] = pickle.dumps(self)
-
-    @staticmethod
-    def sync_state(chatbot, llm_kwargs, cls, plugin_name, callback_fn, lock_plugin=True):
-        state = chatbot._cookies.get(f'plugin_state/{plugin_name}', None)
-        if state is not None:
-            state = pickle.loads(state)
-        else: 
-            state = cls()
-            state.init_game(chatbot, lock_plugin)
-        state.plugin_name = plugin_name
-        state.llm_kwargs = llm_kwargs
-        state.chatbot = chatbot
-        state.callback_fn = callback_fn
-        return state
-    
-    def continue_game(self, prompt, chatbot, history):
-        # 游戏主体
-        yield from self.step(prompt, chatbot, history)
-        self.step_cnt += 1
-        # 保存状态，收尾
-        self.dump_state(chatbot)
-        # 如果游戏结束，清理
-        if self.delete_game:
-            chatbot._cookies['lock_plugin'] = None
-            chatbot._cookies[f'plugin_state/{self.get_plugin_name()}'] = None
-        yield from update_ui(chatbot=chatbot, history=history)

crazy_functions/pdf_fns/breakdown_txt.py

@@ -1,125 +0,0 @@
-from crazy_functions.ipc_fns.mp import run_in_subprocess_with_timeout
-
-def force_breakdown(txt, limit, get_token_fn):
-    """ 当无法用标点、空行分割时，我们用最暴力的方法切割
-    """
-    for i in reversed(range(len(txt))):
-        if get_token_fn(txt[:i]) < limit:
-            return txt[:i], txt[i:]
-    return "Tiktoken未知错误", "Tiktoken未知错误"
-
-
-def maintain_storage(remain_txt_to_cut, remain_txt_to_cut_storage):
-    """ 为了加速计算，我们采样一个特殊的手段。当 remain_txt_to_cut > `_max` 时， 我们把 _max 后的文字转存至 remain_txt_to_cut_storage
-    当 remain_txt_to_cut < `_min` 时，我们再把 remain_txt_to_cut_storage 中的部分文字取出
-    """
-    _min = int(5e4)
-    _max = int(1e5)
-    # print(len(remain_txt_to_cut), len(remain_txt_to_cut_storage))
-    if len(remain_txt_to_cut) < _min and len(remain_txt_to_cut_storage) > 0:
-        remain_txt_to_cut = remain_txt_to_cut + remain_txt_to_cut_storage
-        remain_txt_to_cut_storage = ""
-    if len(remain_txt_to_cut) > _max:
-        remain_txt_to_cut_storage = remain_txt_to_cut[_max:] + remain_txt_to_cut_storage
-        remain_txt_to_cut = remain_txt_to_cut[:_max]
-    return remain_txt_to_cut, remain_txt_to_cut_storage
-
-
-def cut(limit, get_token_fn, txt_tocut, must_break_at_empty_line, break_anyway=False):
-    """ 文本切分
-    """
-    res = []
-    total_len = len(txt_tocut)
-    fin_len = 0
-    remain_txt_to_cut = txt_tocut
-    remain_txt_to_cut_storage = ""
-    # 为了加速计算，我们采样一个特殊的手段。当 remain_txt_to_cut > `_max` 时， 我们把 _max 后的文字转存至 remain_txt_to_cut_storage
-    remain_txt_to_cut, remain_txt_to_cut_storage = maintain_storage(remain_txt_to_cut, remain_txt_to_cut_storage)
-    
-    while True:
-        if get_token_fn(remain_txt_to_cut) <= limit:
-            # 如果剩余文本的token数小于限制，那么就不用切了
-            res.append(remain_txt_to_cut); fin_len+=len(remain_txt_to_cut)
-            break
-        else:
-            # 如果剩余文本的token数大于限制，那么就切
-            lines = remain_txt_to_cut.split('\n')
-
-            # 估计一个切分点
-            estimated_line_cut = limit / get_token_fn(remain_txt_to_cut) * len(lines)
-            estimated_line_cut = int(estimated_line_cut)
-
-            # 开始查找合适切分点的偏移（cnt）
-            cnt = 0
-            for cnt in reversed(range(estimated_line_cut)):
-                if must_break_at_empty_line:
-                    # 首先尝试用双空行（\n\n）作为切分点
-                    if lines[cnt] != "":
-                        continue
-                prev = "\n".join(lines[:cnt])
-                post = "\n".join(lines[cnt:])
-                if get_token_fn(prev) < limit:
-                    break
-
-            if cnt == 0:
-                # 如果没有找到合适的切分点
-                if break_anyway:
-                    # 是否允许暴力切分
-                    prev, post = force_breakdown(txt_tocut, limit, get_token_fn)
-                else:
-                    # 不允许直接报错
-                    raise RuntimeError(f"存在一行极长的文本！{txt_tocut}")
-
-            # 追加列表
-            res.append(prev); fin_len+=len(prev)
-            # 准备下一次迭代
-            remain_txt_to_cut = post
-            remain_txt_to_cut, remain_txt_to_cut_storage = maintain_storage(remain_txt_to_cut, remain_txt_to_cut_storage)
-            process = fin_len/total_len
-            print(f'正在文本切分 {int(process*100)}%')
-            if len(remain_txt_to_cut.strip()) == 0:
-                break
-    return res
-
-
-def breakdown_text_to_satisfy_token_limit_(txt, limit, llm_model="gpt-3.5-turbo"):
-    """ 使用多种方式尝试切分文本，以满足 token 限制
-    """
-    from request_llms.bridge_all import model_info
-    enc = model_info[llm_model]['tokenizer']
-    def get_token_fn(txt): return len(enc.encode(txt, disallowed_special=()))
-    try:
-        # 第1次尝试，将双空行（\n\n）作为切分点
-        return cut(limit, get_token_fn, txt, must_break_at_empty_line=True)
-    except RuntimeError:
-        try:
-            # 第2次尝试，将单空行（\n）作为切分点
-            return cut(limit, get_token_fn, txt, must_break_at_empty_line=False)
-        except RuntimeError:
-            try:
-                # 第3次尝试，将英文句号（.）作为切分点
-                res = cut(limit, get_token_fn, txt.replace('.', '。\n'), must_break_at_empty_line=False) # 这个中文的句号是故意的，作为一个标识而存在
-                return [r.replace('。\n', '.') for r in res]
-            except RuntimeError as e:
-                try:
-                    # 第4次尝试，将中文句号（。）作为切分点
-                    res = cut(limit, get_token_fn, txt.replace('。', '。。\n'), must_break_at_empty_line=False)
-                    return [r.replace('。。\n', '。') for r in res]
-                except RuntimeError as e:
-                    # 第5次尝试，没办法了，随便切一下吧
-                    return cut(limit, get_token_fn, txt, must_break_at_empty_line=False, break_anyway=True)
-
-breakdown_text_to_satisfy_token_limit = run_in_subprocess_with_timeout(breakdown_text_to_satisfy_token_limit_, timeout=60)
-
-if __name__ == '__main__':
-    from crazy_functions.crazy_utils import read_and_clean_pdf_text
-    file_content, page_one = read_and_clean_pdf_text("build/assets/at.pdf")
-
-    from request_llms.bridge_all import model_info
-    for i in range(5):
-        file_content += file_content
-
-    print(len(file_content))
-    TOKEN_LIMIT_PER_FRAGMENT = 2500
-    res = breakdown_text_to_satisfy_token_limit(file_content, TOKEN_LIMIT_PER_FRAGMENT)
-

crazy_functions/pdf_fns/parse_pdf.py

@@ -1,171 +0,0 @@
-from functools import lru_cache
-from toolbox import gen_time_str
-from toolbox import promote_file_to_downloadzone
-from toolbox import write_history_to_file, promote_file_to_downloadzone
-from toolbox import get_conf
-from toolbox import ProxyNetworkActivate
-from colorful import *
-import requests
-import random
-import copy
-import os
-import math
-
-class GROBID_OFFLINE_EXCEPTION(Exception): pass
-
-def get_avail_grobid_url():
-    GROBID_URLS = get_conf('GROBID_URLS')
-    if len(GROBID_URLS) == 0: return None
-    try:
-        _grobid_url = random.choice(GROBID_URLS) # 随机负载均衡
-        if _grobid_url.endswith('/'): _grobid_url = _grobid_url.rstrip('/')
-        with ProxyNetworkActivate('Connect_Grobid'):
-            res = requests.get(_grobid_url+'/api/isalive')
-        if res.text=='true': return _grobid_url
-        else: return None
-    except:
-        return None
-
-@lru_cache(maxsize=32)
-def parse_pdf(pdf_path, grobid_url):
-    import scipdf   # pip install scipdf_parser
-    if grobid_url.endswith('/'): grobid_url = grobid_url.rstrip('/')
-    try:
-        with ProxyNetworkActivate('Connect_Grobid'):
-            article_dict = scipdf.parse_pdf_to_dict(pdf_path, grobid_url=grobid_url)
-    except GROBID_OFFLINE_EXCEPTION:
-        raise GROBID_OFFLINE_EXCEPTION("GROBID服务不可用，请修改config中的GROBID_URL，可修改成本地GROBID服务。")
-    except:
-        raise RuntimeError("解析PDF失败，请检查PDF是否损坏。")
-    return article_dict
-
-
-def produce_report_markdown(gpt_response_collection, meta, paper_meta_info, chatbot, fp, generated_conclusion_files):
-    # -=-=-=-=-=-=-=-= 写出第1个文件：翻译前后混合 -=-=-=-=-=-=-=-=
-    res_path = write_history_to_file(meta +  ["# Meta Translation" , paper_meta_info] + gpt_response_collection, file_basename=f"{gen_time_str()}translated_and_original.md", file_fullname=None)
-    promote_file_to_downloadzone(res_path, rename_file=os.path.basename(res_path)+'.md', chatbot=chatbot)
-    generated_conclusion_files.append(res_path)
-
-    # -=-=-=-=-=-=-=-= 写出第2个文件：仅翻译后的文本 -=-=-=-=-=-=-=-=
-    translated_res_array = []
-    # 记录当前的大章节标题：
-    last_section_name = ""
-    for index, value in enumerate(gpt_response_collection):
-        # 先挑选偶数序列号：
-        if index % 2 != 0:
-            # 先提取当前英文标题：
-            cur_section_name = gpt_response_collection[index-1].split('\n')[0].split(" Part")[0]
-            # 如果index是1的话，则直接使用first section name：
-            if cur_section_name != last_section_name:
-                cur_value = cur_section_name + '\n'
-                last_section_name = copy.deepcopy(cur_section_name)
-            else:
-                cur_value = ""
-            # 再做一个小修改：重新修改当前part的标题，默认用英文的
-            cur_value += value
-            translated_res_array.append(cur_value)
-    res_path = write_history_to_file(meta +  ["# Meta Translation" , paper_meta_info] + translated_res_array, 
-                                     file_basename = f"{gen_time_str()}-translated_only.md", 
-                                     file_fullname = None,
-                                     auto_caption = False)
-    promote_file_to_downloadzone(res_path, rename_file=os.path.basename(res_path)+'.md', chatbot=chatbot)
-    generated_conclusion_files.append(res_path)
-    return res_path
-
-def translate_pdf(article_dict, llm_kwargs, chatbot, fp, generated_conclusion_files, TOKEN_LIMIT_PER_FRAGMENT, DST_LANG):
-    from crazy_functions.pdf_fns.report_gen_html import construct_html
-    from crazy_functions.pdf_fns.breakdown_txt import breakdown_text_to_satisfy_token_limit
-    from crazy_functions.crazy_utils import request_gpt_model_in_new_thread_with_ui_alive
-    from crazy_functions.crazy_utils import request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency
-
-    prompt = "以下是一篇学术论文的基本信息:\n"
-    # title
-    title = article_dict.get('title', '无法获取 title'); prompt += f'title:{title}\n\n'
-    # authors
-    authors = article_dict.get('authors', '无法获取 authors')[:100]; prompt += f'authors:{authors}\n\n'
-    # abstract
-    abstract = article_dict.get('abstract', '无法获取 abstract'); prompt += f'abstract:{abstract}\n\n'
-    # command
-    prompt += f"请将题目和摘要翻译为{DST_LANG}。"
-    meta = [f'# Title:\n\n', title, f'# Abstract:\n\n', abstract ]
-
-    # 单线，获取文章meta信息
-    paper_meta_info = yield from request_gpt_model_in_new_thread_with_ui_alive(
-        inputs=prompt,
-        inputs_show_user=prompt,
-        llm_kwargs=llm_kwargs,
-        chatbot=chatbot, history=[],
-        sys_prompt="You are an academic paper reader。",
-    )
-
-    # 多线，翻译
-    inputs_array = []
-    inputs_show_user_array = []
-
-    # get_token_num
-    from request_llms.bridge_all import model_info
-    enc = model_info[llm_kwargs['llm_model']]['tokenizer']
-    def get_token_num(txt): return len(enc.encode(txt, disallowed_special=()))
-
-    def break_down(txt):
-        raw_token_num = get_token_num(txt)
-        if raw_token_num <= TOKEN_LIMIT_PER_FRAGMENT:
-            return [txt]
-        else:
-            # raw_token_num > TOKEN_LIMIT_PER_FRAGMENT
-            # find a smooth token limit to achieve even seperation
-            count = int(math.ceil(raw_token_num / TOKEN_LIMIT_PER_FRAGMENT))
-            token_limit_smooth = raw_token_num // count + count
-            return breakdown_text_to_satisfy_token_limit(txt, limit=token_limit_smooth, llm_model=llm_kwargs['llm_model'])
-
-    for section in article_dict.get('sections'):
-        if len(section['text']) == 0: continue
-        section_frags = break_down(section['text'])
-        for i, fragment in enumerate(section_frags):
-            heading = section['heading']
-            if len(section_frags) > 1: heading += f' Part-{i+1}'
-            inputs_array.append(
-                f"你需要翻译{heading}章节，内容如下: \n\n{fragment}"
-            )
-            inputs_show_user_array.append(
-                f"# {heading}\n\n{fragment}"
-            )
-
-    gpt_response_collection = yield from request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency(
-        inputs_array=inputs_array,
-        inputs_show_user_array=inputs_show_user_array,
-        llm_kwargs=llm_kwargs,
-        chatbot=chatbot,
-        history_array=[meta for _ in inputs_array],
-        sys_prompt_array=[
-            "请你作为一个学术翻译，负责把学术论文准确翻译成中文。注意文章中的每一句话都要翻译。" for _ in inputs_array],
-    )
-    # -=-=-=-=-=-=-=-= 写出Markdown文件 -=-=-=-=-=-=-=-=
-    produce_report_markdown(gpt_response_collection, meta, paper_meta_info, chatbot, fp, generated_conclusion_files)
-
-    # -=-=-=-=-=-=-=-= 写出HTML文件 -=-=-=-=-=-=-=-=
-    ch = construct_html() 
-    orig = ""
-    trans = ""
-    gpt_response_collection_html = copy.deepcopy(gpt_response_collection)
-    for i,k in enumerate(gpt_response_collection_html): 
-        if i%2==0:
-            gpt_response_collection_html[i] = inputs_show_user_array[i//2]
-        else:
-            # 先提取当前英文标题：
-            cur_section_name = gpt_response_collection[i-1].split('\n')[0].split(" Part")[0]
-            cur_value = cur_section_name + "\n" + gpt_response_collection_html[i]
-            gpt_response_collection_html[i] = cur_value
-
-    final = ["", "", "一、论文概况",  "", "Abstract", paper_meta_info,  "二、论文翻译",  ""]
-    final.extend(gpt_response_collection_html)
-    for i, k in enumerate(final): 
-        if i%2==0:
-            orig = k
-        if i%2==1:
-            trans = k
-            ch.add_row(a=orig, b=trans)
-    create_report_file_name = f"{os.path.basename(fp)}.trans.html"
-    html_file = ch.save_file(create_report_file_name)
-    generated_conclusion_files.append(html_file)
-    promote_file_to_downloadzone(html_file, rename_file=os.path.basename(html_file), chatbot=chatbot)

crazy_functions/pdf_fns/report_gen_html.py

@@ -1,58 +0,0 @@
-from toolbox import update_ui, get_conf, trimmed_format_exc, get_log_folder
-import os
-
-
-
-
-class construct_html():
-    def __init__(self) -> None:
-        self.html_string = ""
-
-    def add_row(self, a, b):
-        from toolbox import markdown_convertion
-        template = """
-            {
-                primary_col: {
-                    header: String.raw`__PRIMARY_HEADER__`,
-                    msg: String.raw`__PRIMARY_MSG__`,
-                },
-                secondary_rol: {
-                    header: String.raw`__SECONDARY_HEADER__`,
-                    msg: String.raw`__SECONDARY_MSG__`,
-                }
-            },
-        """
-        def std(str):
-            str = str.replace(r'`',r'`')
-            if str.endswith("\\"): str += ' '
-            if str.endswith("}"): str += ' '
-            if str.endswith("$"): str += ' '
-            return str
-
-        template_ = template
-        a_lines = a.split('\n')
-        b_lines = b.split('\n')
-
-        if len(a_lines) == 1 or len(a_lines[0]) > 50:
-            template_ = template_.replace("__PRIMARY_HEADER__", std(a[:20]))
-            template_ = template_.replace("__PRIMARY_MSG__", std(markdown_convertion(a)))
-        else:
-            template_ = template_.replace("__PRIMARY_HEADER__", std(a_lines[0]))
-            template_ = template_.replace("__PRIMARY_MSG__", std(markdown_convertion('\n'.join(a_lines[1:]))))
-
-        if len(b_lines) == 1 or len(b_lines[0]) > 50:
-            template_ = template_.replace("__SECONDARY_HEADER__", std(b[:20]))
-            template_ = template_.replace("__SECONDARY_MSG__", std(markdown_convertion(b)))
-        else:
-            template_ = template_.replace("__SECONDARY_HEADER__", std(b_lines[0]))
-            template_ = template_.replace("__SECONDARY_MSG__", std(markdown_convertion('\n'.join(b_lines[1:]))))
-        self.html_string += template_
-
-    def save_file(self, file_name):
-        from toolbox import get_log_folder
-        with open('crazy_functions/pdf_fns/report_template.html', 'r', encoding='utf8') as f:
-            html_template = f.read()
-        html_template = html_template.replace("__TF_ARR__", self.html_string)
-        with open(os.path.join(get_log_folder(), file_name), 'w', encoding='utf8') as f:
-            f.write(html_template.encode('utf-8', 'ignore').decode())
-        return os.path.join(get_log_folder(), file_name)

crazy_functions/test_project/cpp/cppipc/buffer.cpp

@@ -1,87 +0,0 @@
-#include "libipc/buffer.h"
-#include "libipc/utility/pimpl.h"
-
-#include <cstring>
-
-namespace ipc {
-
-bool operator==(buffer const & b1, buffer const & b2) {
-    return (b1.size() == b2.size()) && (std::memcmp(b1.data(), b2.data(), b1.size()) == 0);
-}
-
-bool operator!=(buffer const & b1, buffer const & b2) {
-    return !(b1 == b2);
-}
-
-class buffer::buffer_ : public pimpl<buffer_> {
-public:
-    void*       p_;
-    std::size_t s_;
-    void*       a_;
-    buffer::destructor_t d_;
-
-    buffer_(void* p, std::size_t s, buffer::destructor_t d, void* a)
-        : p_(p), s_(s), a_(a), d_(d) {
-    }
-
-    ~buffer_() {
-        if (d_ == nullptr) return;
-        d_((a_ == nullptr) ? p_ : a_, s_);
-    }
-};
-
-buffer::buffer()
-    : buffer(nullptr, 0, nullptr, nullptr) {
-}
-
-buffer::buffer(void* p, std::size_t s, destructor_t d)
-    : p_(p_->make(p, s, d, nullptr)) {
-}
-
-buffer::buffer(void* p, std::size_t s, destructor_t d, void* additional)
-    : p_(p_->make(p, s, d, additional)) {
-}
-
-buffer::buffer(void* p, std::size_t s)
-    : buffer(p, s, nullptr) {
-}
-
-buffer::buffer(char const & c)
-    : buffer(const_cast<char*>(&c), 1) {
-}
-
-buffer::buffer(buffer&& rhs)
-    : buffer() {
-    swap(rhs);
-}
-
-buffer::~buffer() {
-    p_->clear();
-}
-
-void buffer::swap(buffer& rhs) {
-    std::swap(p_, rhs.p_);
-}
-
-buffer& buffer::operator=(buffer rhs) {
-    swap(rhs);
-    return *this;
-}
-
-bool buffer::empty() const noexcept {
-    return (impl(p_)->p_ == nullptr) || (impl(p_)->s_ == 0);
-}
-
-void* buffer::data() noexcept {
-    return impl(p_)->p_;
-}
-
-void const * buffer::data() const noexcept {
-    return impl(p_)->p_;
-}
-
-std::size_t buffer::size() const noexcept {
-    return impl(p_)->s_;
-}
-
-} // namespace ipc

crazy_functions/test_project/cpp/cppipc/ipc.cpp

@@ -1,701 +0,0 @@
-
-#include <type_traits>
-#include <cstring>
-#include <algorithm>
-#include <utility>          // std::pair, std::move, std::forward
-#include <atomic>
-#include <type_traits>      // aligned_storage_t
-#include <string>
-#include <vector>
-#include <array>
-#include <cassert>
-
-#include "libipc/ipc.h"
-#include "libipc/def.h"
-#include "libipc/shm.h"
-#include "libipc/pool_alloc.h"
-#include "libipc/queue.h"
-#include "libipc/policy.h"
-#include "libipc/rw_lock.h"
-#include "libipc/waiter.h"
-
-#include "libipc/utility/log.h"
-#include "libipc/utility/id_pool.h"
-#include "libipc/utility/scope_guard.h"
-#include "libipc/utility/utility.h"
-
-#include "libipc/memory/resource.h"
-#include "libipc/platform/detail.h"
-#include "libipc/circ/elem_array.h"
-
-namespace {
-
-using msg_id_t = std::uint32_t;
-using acc_t    = std::atomic<msg_id_t>;
-
-template <std::size_t DataSize, std::size_t AlignSize>
-struct msg_t;
-
-template <std::size_t AlignSize>
-struct msg_t<0, AlignSize> {
-    msg_id_t     cc_id_;
-    msg_id_t     id_;
-    std::int32_t remain_;
-    bool         storage_;
-};
-
-template <std::size_t DataSize, std::size_t AlignSize>
-struct msg_t : msg_t<0, AlignSize> {
-    std::aligned_storage_t<DataSize, AlignSize> data_ {};
-
-    msg_t() = default;
-    msg_t(msg_id_t cc_id, msg_id_t id, std::int32_t remain, void const * data, std::size_t size)
-        : msg_t<0, AlignSize> {cc_id, id, remain, (data == nullptr) || (size == 0)} {
-        if (this->storage_) {
-            if (data != nullptr) {
-                // copy storage-id
-                *reinterpret_cast<ipc::storage_id_t*>(&data_) =
-                     *static_cast<ipc::storage_id_t const *>(data);
-            }
-        }
-        else std::memcpy(&data_, data, size);
-    }
-};
-
-template <typename T>
-ipc::buff_t make_cache(T& data, std::size_t size) {
-    auto ptr = ipc::mem::alloc(size);
-    std::memcpy(ptr, &data, (ipc::detail::min)(sizeof(data), size));
-    return { ptr, size, ipc::mem::free };
-}
-
-struct cache_t {
-    std::size_t fill_;
-    ipc::buff_t buff_;
-
-    cache_t(std::size_t f, ipc::buff_t && b)
-        : fill_(f), buff_(std::move(b))
-    {}
-
-    void append(void const * data, std::size_t size) {
-        if (fill_ >= buff_.size() || data == nullptr || size == 0) return;
-        auto new_fill = (ipc::detail::min)(fill_ + size, buff_.size());
-        std::memcpy(static_cast<ipc::byte_t*>(buff_.data()) + fill_, data, new_fill - fill_);
-        fill_ = new_fill;
-    }
-};
-
-auto cc_acc() {
-    static ipc::shm::handle acc_h("__CA_CONN__", sizeof(acc_t));
-    return static_cast<acc_t*>(acc_h.get());
-}
-
-IPC_CONSTEXPR_ std::size_t align_chunk_size(std::size_t size) noexcept {
-    return (((size - 1) / ipc::large_msg_align) + 1) * ipc::large_msg_align;
-}
-
-IPC_CONSTEXPR_ std::size_t calc_chunk_size(std::size_t size) noexcept {
-    return ipc::make_align(alignof(std::max_align_t), align_chunk_size(
-           ipc::make_align(alignof(std::max_align_t), sizeof(std::atomic<ipc::circ::cc_t>)) + size));
-}
-
-struct chunk_t {
-    std::atomic<ipc::circ::cc_t> &conns() noexcept {
-        return *reinterpret_cast<std::atomic<ipc::circ::cc_t> *>(this);
-    }
-
-    void *data() noexcept {
-        return reinterpret_cast<ipc::byte_t *>(this)
-             + ipc::make_align(alignof(std::max_align_t), sizeof(std::atomic<ipc::circ::cc_t>));
-    }
-};
-
-struct chunk_info_t {
-    ipc::id_pool<> pool_;
-    ipc::spin_lock lock_;
-
-    IPC_CONSTEXPR_ static std::size_t chunks_mem_size(std::size_t chunk_size) noexcept {
-        return ipc::id_pool<>::max_count * chunk_size;
-    }
-
-    ipc::byte_t *chunks_mem() noexcept {
-        return reinterpret_cast<ipc::byte_t *>(this + 1);
-    }
-
-    chunk_t *at(std::size_t chunk_size, ipc::storage_id_t id) noexcept {
-        if (id < 0) return nullptr;
-        return reinterpret_cast<chunk_t *>(chunks_mem() + (chunk_size * id));
-    }
-};
-
-auto& chunk_storages() {
-    class chunk_handle_t {
-        ipc::shm::handle handle_;
-
-    public:
-        chunk_info_t *get_info(std::size_t chunk_size) {
-            if (!handle_.valid() &&
-                !handle_.acquire( ("__CHUNK_INFO__" + ipc::to_string(chunk_size)).c_str(), 
-                                  sizeof(chunk_info_t) + chunk_info_t::chunks_mem_size(chunk_size) )) {
-                ipc::error("[chunk_storages] chunk_shm.id_info_.acquire failed: chunk_size = %zd\n", chunk_size);
-                return nullptr;
-            }
-            auto info = static_cast<chunk_info_t*>(handle_.get());
-            if (info == nullptr) {
-                ipc::error("[chunk_storages] chunk_shm.id_info_.get failed: chunk_size = %zd\n", chunk_size);
-                return nullptr;
-            }
-            return info;
-        }
-    };
-    static ipc::map<std::size_t, chunk_handle_t> chunk_hs;
-    return chunk_hs;
-}
-
-chunk_info_t *chunk_storage_info(std::size_t chunk_size) {
-    auto &storages = chunk_storages();
-    std::decay_t<decltype(storages)>::iterator it;
-    {
-        static ipc::rw_lock lock;
-        IPC_UNUSED_ std::shared_lock<ipc::rw_lock> guard {lock};
-        if ((it = storages.find(chunk_size)) == storages.end()) {
-            using chunk_handle_t = std::decay_t<decltype(storages)>::value_type::second_type;
-            guard.unlock();
-            IPC_UNUSED_ std::lock_guard<ipc::rw_lock> guard {lock};
-            it = storages.emplace(chunk_size, chunk_handle_t{}).first;
-        }
-    }
-    return it->second.get_info(chunk_size);
-}
-
-std::pair<ipc::storage_id_t, void*> acquire_storage(std::size_t size, ipc::circ::cc_t conns) {
-    std::size_t chunk_size = calc_chunk_size(size);
-    auto info = chunk_storage_info(chunk_size);
-    if (info == nullptr) return {};
-
-    info->lock_.lock();
-    info->pool_.prepare();
-    // got an unique id
-    auto id = info->pool_.acquire();
-    info->lock_.unlock();
-
-    auto chunk = info->at(chunk_size, id);
-    if (chunk == nullptr) return {};
-    chunk->conns().store(conns, std::memory_order_relaxed);
-    return { id, chunk->data() };
-}
-
-void *find_storage(ipc::storage_id_t id, std::size_t size) {
-    if (id < 0) {
-        ipc::error("[find_storage] id is invalid: id = %ld, size = %zd\n", (long)id, size);
-        return nullptr;
-    }
-    std::size_t chunk_size = calc_chunk_size(size);
-    auto info = chunk_storage_info(chunk_size);
-    if (info == nullptr) return nullptr;
-    return info->at(chunk_size, id)->data();
-}
-
-void release_storage(ipc::storage_id_t id, std::size_t size) {
-    if (id < 0) {
-        ipc::error("[release_storage] id is invalid: id = %ld, size = %zd\n", (long)id, size);
-        return;
-    }
-    std::size_t chunk_size = calc_chunk_size(size);
-    auto info = chunk_storage_info(chunk_size);
-    if (info == nullptr) return;
-    info->lock_.lock();
-    info->pool_.release(id);
-    info->lock_.unlock();
-}
-
-template <ipc::relat Rp, ipc::relat Rc>
-bool sub_rc(ipc::wr<Rp, Rc, ipc::trans::unicast>, 
-            std::atomic<ipc::circ::cc_t> &/*conns*/, ipc::circ::cc_t /*curr_conns*/, ipc::circ::cc_t /*conn_id*/) noexcept {
-    return true;
-}
-
-template <ipc::relat Rp, ipc::relat Rc>
-bool sub_rc(ipc::wr<Rp, Rc, ipc::trans::broadcast>, 
-            std::atomic<ipc::circ::cc_t> &conns, ipc::circ::cc_t curr_conns, ipc::circ::cc_t conn_id) noexcept {
-    auto last_conns = curr_conns & ~conn_id;
-    for (unsigned k = 0;;) {
-        auto chunk_conns  = conns.load(std::memory_order_acquire);
-        if (conns.compare_exchange_weak(chunk_conns, chunk_conns & last_conns, std::memory_order_release)) {
-            return (chunk_conns & last_conns) == 0;
-        }
-        ipc::yield(k);
-    }
-}
-
-template <typename Flag>
-void recycle_storage(ipc::storage_id_t id, std::size_t size, ipc::circ::cc_t curr_conns, ipc::circ::cc_t conn_id) {
-    if (id < 0) {
-        ipc::error("[recycle_storage] id is invalid: id = %ld, size = %zd\n", (long)id, size);
-        return;
-    }
-    std::size_t chunk_size = calc_chunk_size(size);
-    auto info = chunk_storage_info(chunk_size);
-    if (info == nullptr) return;
-
-    auto chunk = info->at(chunk_size, id);
-    if (chunk == nullptr) return;
-
-    if (!sub_rc(Flag{}, chunk->conns(), curr_conns, conn_id)) {
-        return;
-    }
-    info->lock_.lock();
-    info->pool_.release(id);
-    info->lock_.unlock();
-}
-
-template <typename MsgT>
-bool clear_message(void* p) {
-    auto msg = static_cast<MsgT*>(p);
-    if (msg->storage_) {
-        std::int32_t r_size = static_cast<std::int32_t>(ipc::data_length) + msg->remain_;
-        if (r_size <= 0) {
-            ipc::error("[clear_message] invalid msg size: %d\n", (int)r_size);
-            return true;
-        }
-        release_storage(
-            *reinterpret_cast<ipc::storage_id_t*>(&msg->data_),
-            static_cast<std::size_t>(r_size));
-    }
-    return true;
-}
-
-struct conn_info_head {
-
-    ipc::string name_;
-    msg_id_t    cc_id_; // connection-info id
-    ipc::detail::waiter cc_waiter_, wt_waiter_, rd_waiter_;
-    ipc::shm::handle acc_h_;
-
-    conn_info_head(char const * name)
-        : name_     {name}
-        , cc_id_    {(cc_acc() == nullptr) ? 0 : cc_acc()->fetch_add(1, std::memory_order_relaxed)}
-        , cc_waiter_{("__CC_CONN__" + name_).c_str()}
-        , wt_waiter_{("__WT_CONN__" + name_).c_str()}
-        , rd_waiter_{("__RD_CONN__" + name_).c_str()}
-        , acc_h_    {("__AC_CONN__" + name_).c_str(), sizeof(acc_t)} {
-    }
-
-    void quit_waiting() {
-        cc_waiter_.quit_waiting();
-        wt_waiter_.quit_waiting();
-        rd_waiter_.quit_waiting();
-    }
-
-    auto acc() {
-        return static_cast<acc_t*>(acc_h_.get());
-    }
-
-    auto& recv_cache() {
-        thread_local ipc::unordered_map<msg_id_t, cache_t> tls;
-        return tls;
-    }
-};
-
-template <typename W, typename F>
-bool wait_for(W& waiter, F&& pred, std::uint64_t tm) {
-    if (tm == 0) return !pred();
-    for (unsigned k = 0; pred();) {
-        bool ret = true;
-        ipc::sleep(k, [&k, &ret, &waiter, &pred, tm] {
-            ret = waiter.wait_if(std::forward<F>(pred), tm);
-            k   = 0;
-        });
-        if (!ret) return false; // timeout or fail
-        if (k == 0) break; // k has been reset
-    }
-    return true;
-}
-
-template <typename Policy,
-          std::size_t DataSize  = ipc::data_length,
-          std::size_t AlignSize = (ipc::detail::min)(DataSize, alignof(std::max_align_t))>
-struct queue_generator {
-
-    using queue_t = ipc::queue<msg_t<DataSize, AlignSize>, Policy>;
-
-    struct conn_info_t : conn_info_head {
-        queue_t que_;
-
-        conn_info_t(char const * name)
-            : conn_info_head{name}
-            , que_{("__QU_CONN__" +
-                    ipc::to_string(DataSize) + "__" +
-                    ipc::to_string(AlignSize) + "__" + name).c_str()} {
-        }
-
-        void disconnect_receiver() {
-            bool dis = que_.disconnect();
-            this->quit_waiting();
-            if (dis) {
-                this->recv_cache().clear();
-            }
-        }
-    };
-};
-
-template <typename Policy>
-struct detail_impl {
-
-using policy_t    = Policy;
-using flag_t      = typename policy_t::flag_t;
-using queue_t     = typename queue_generator<policy_t>::queue_t;
-using conn_info_t = typename queue_generator<policy_t>::conn_info_t;
-
-constexpr static conn_info_t* info_of(ipc::handle_t h) noexcept {
-    return static_cast<conn_info_t*>(h);
-}
-
-constexpr static queue_t* queue_of(ipc::handle_t h) noexcept {
-    return (info_of(h) == nullptr) ? nullptr : &(info_of(h)->que_);
-}
-
-/* API implementations */
-
-static void disconnect(ipc::handle_t h) {
-    auto que = queue_of(h);
-    if (que == nullptr) {
-        return;
-    }
-    que->shut_sending();
-    assert(info_of(h) != nullptr);
-    info_of(h)->disconnect_receiver();
-}
-
-static bool reconnect(ipc::handle_t * ph, bool start_to_recv) {
-    assert(ph != nullptr);
-    assert(*ph != nullptr);
-    auto que = queue_of(*ph);
-    if (que == nullptr) {
-        return false;
-    }
-    if (start_to_recv) {
-        que->shut_sending();
-        if (que->connect()) { // wouldn't connect twice
-            info_of(*ph)->cc_waiter_.broadcast();
-            return true;
-        }
-        return false;
-    }
-    // start_to_recv == false
-    if (que->connected()) {
-        info_of(*ph)->disconnect_receiver();
-    }
-    return que->ready_sending();
-}
-
-static bool connect(ipc::handle_t * ph, char const * name, bool start_to_recv) {
-    assert(ph != nullptr);
-    if (*ph == nullptr) {
-        *ph = ipc::mem::alloc<conn_info_t>(name);
-    }
-    return reconnect(ph, start_to_recv);
-}
-
-static void destroy(ipc::handle_t h) {
-    disconnect(h);
-    ipc::mem::free(info_of(h));
-}
-
-static std::size_t recv_count(ipc::handle_t h) noexcept {
-    auto que = queue_of(h);
-    if (que == nullptr) {
-        return ipc::invalid_value;
-    }
-    return que->conn_count();
-}
-
-static bool wait_for_recv(ipc::handle_t h, std::size_t r_count, std::uint64_t tm) {
-    auto que = queue_of(h);
-    if (que == nullptr) {
-        return false;
-    }
-    return wait_for(info_of(h)->cc_waiter_, [que, r_count] {
-        return que->conn_count() < r_count;
-    }, tm);
-}
-
-template <typename F>
-static bool send(F&& gen_push, ipc::handle_t h, void const * data, std::size_t size) {
-    if (data == nullptr || size == 0) {
-        ipc::error("fail: send(%p, %zd)\n", data, size);
-        return false;
-    }
-    auto que = queue_of(h);
-    if (que == nullptr) {
-        ipc::error("fail: send, queue_of(h) == nullptr\n");
-        return false;
-    }
-    if (que->elems() == nullptr) {
-        ipc::error("fail: send, queue_of(h)->elems() == nullptr\n");
-        return false;
-    }
-    if (!que->ready_sending()) {
-        ipc::error("fail: send, que->ready_sending() == false\n");
-        return false;
-    }
-    ipc::circ::cc_t conns = que->elems()->connections(std::memory_order_relaxed);
-    if (conns == 0) {
-        ipc::error("fail: send, there is no receiver on this connection.\n");
-        return false;
-    }
-    // calc a new message id
-    auto acc = info_of(h)->acc();
-    if (acc == nullptr) {
-        ipc::error("fail: send, info_of(h)->acc() == nullptr\n");
-        return false;
-    }
-    auto msg_id   = acc->fetch_add(1, std::memory_order_relaxed);
-    auto try_push = std::forward<F>(gen_push)(info_of(h), que, msg_id);
-    if (size > ipc::large_msg_limit) {
-        auto   dat = acquire_storage(size, conns);
-        void * buf = dat.second;
-        if (buf != nullptr) {
-            std::memcpy(buf, data, size);
-            return try_push(static_cast<std::int32_t>(size) - 
-                            static_cast<std::int32_t>(ipc::data_length), &(dat.first), 0);
-        }
-        // try using message fragment
-        //ipc::log("fail: shm::handle for big message. msg_id: %zd, size: %zd\n", msg_id, size);
-    }
-    // push message fragment
-    std::int32_t offset = 0;
-    for (std::int32_t i = 0; i < static_cast<std::int32_t>(size / ipc::data_length); ++i, offset += ipc::data_length) {
-        if (!try_push(static_cast<std::int32_t>(size) - offset - static_cast<std::int32_t>(ipc::data_length),
-                      static_cast<ipc::byte_t const *>(data) + offset, ipc::data_length)) {
-            return false;
-        }
-    }
-    // if remain > 0, this is the last message fragment
-    std::int32_t remain = static_cast<std::int32_t>(size) - offset;
-    if (remain > 0) {
-        if (!try_push(remain - static_cast<std::int32_t>(ipc::data_length),
-                      static_cast<ipc::byte_t const *>(data) + offset, 
-                      static_cast<std::size_t>(remain))) {
-            return false;
-        }
-    }
-    return true;
-}
-
-static bool send(ipc::handle_t h, void const * data, std::size_t size, std::uint64_t tm) {
-    return send([tm](auto info, auto que, auto msg_id) {
-        return [tm, info, que, msg_id](std::int32_t remain, void const * data, std::size_t size) {
-            if (!wait_for(info->wt_waiter_, [&] {
-                    return !que->push(
-                        [](void*) { return true; },
-                        info->cc_id_, msg_id, remain, data, size);
-                }, tm)) {
-                ipc::log("force_push: msg_id = %zd, remain = %d, size = %zd\n", msg_id, remain, size);
-                if (!que->force_push(
-                        clear_message<typename queue_t::value_t>,
-                        info->cc_id_, msg_id, remain, data, size)) {
-                    return false;
-                }
-            }
-            info->rd_waiter_.broadcast();
-            return true;
-        };
-    }, h, data, size);
-}
-
-static bool try_send(ipc::handle_t h, void const * data, std::size_t size, std::uint64_t tm) {
-    return send([tm](auto info, auto que, auto msg_id) {
-        return [tm, info, que, msg_id](std::int32_t remain, void const * data, std::size_t size) {
-            if (!wait_for(info->wt_waiter_, [&] {
-                    return !que->push(
-                        [](void*) { return true; },
-                        info->cc_id_, msg_id, remain, data, size);
-                }, tm)) {
-                return false;
-            }
-            info->rd_waiter_.broadcast();
-            return true;
-        };
-    }, h, data, size);
-}
-
-static ipc::buff_t recv(ipc::handle_t h, std::uint64_t tm) {
-    auto que = queue_of(h);
-    if (que == nullptr) {
-        ipc::error("fail: recv, queue_of(h) == nullptr\n");
-        return {};
-    }
-    if (!que->connected()) {
-        // hasn't connected yet, just return.
-        return {};
-    }
-    auto& rc = info_of(h)->recv_cache();
-    for (;;) {
-        // pop a new message
-        typename queue_t::value_t msg;
-        if (!wait_for(info_of(h)->rd_waiter_, [que, &msg] {
-                return !que->pop(msg);
-            }, tm)) {
-            // pop failed, just return.
-            return {};
-        }
-        info_of(h)->wt_waiter_.broadcast();
-        if ((info_of(h)->acc() != nullptr) && (msg.cc_id_ == info_of(h)->cc_id_)) {
-            continue; // ignore message to self
-        }
-        // msg.remain_ may minus & abs(msg.remain_) < data_length
-        std::int32_t r_size = static_cast<std::int32_t>(ipc::data_length) + msg.remain_;
-        if (r_size <= 0) {
-            ipc::error("fail: recv, r_size = %d\n", (int)r_size);
-            return {};
-        }
-        std::size_t msg_size = static_cast<std::size_t>(r_size);
-        // large message
-        if (msg.storage_) {
-            ipc::storage_id_t buf_id = *reinterpret_cast<ipc::storage_id_t*>(&msg.data_);
-            void* buf = find_storage(buf_id, msg_size);
-            if (buf != nullptr) {
-                struct recycle_t {
-                    ipc::storage_id_t storage_id;
-                    ipc::circ::cc_t   curr_conns;
-                    ipc::circ::cc_t   conn_id;
-                } *r_info = ipc::mem::alloc<recycle_t>(recycle_t{
-                    buf_id, que->elems()->connections(std::memory_order_relaxed), que->connected_id()
-                });
-                if (r_info == nullptr) {
-                    ipc::log("fail: ipc::mem::alloc<recycle_t>.\n");
-                    return ipc::buff_t{buf, msg_size}; // no recycle
-                } else {
-                    return ipc::buff_t{buf, msg_size, [](void* p_info, std::size_t size) {
-                        auto r_info = static_cast<recycle_t *>(p_info);
-                        IPC_UNUSED_ auto finally = ipc::guard([r_info] {
-                            ipc::mem::free(r_info);
-                        });
-                        recycle_storage<flag_t>(r_info->storage_id, size, r_info->curr_conns, r_info->conn_id);
-                    }, r_info};
-                }
-            } else {
-                ipc::log("fail: shm::handle for large message. msg_id: %zd, buf_id: %zd, size: %zd\n", msg.id_, buf_id, msg_size);
-                continue;
-            }
-        }
-        // find cache with msg.id_
-        auto cac_it = rc.find(msg.id_);
-        if (cac_it == rc.end()) {
-            if (msg_size <= ipc::data_length) {
-                return make_cache(msg.data_, msg_size);
-            }
-            // gc
-            if (rc.size() > 1024) {
-                std::vector<msg_id_t> need_del;
-                for (auto const & pair : rc) {
-                    auto cmp = std::minmax(msg.id_, pair.first);
-                    if (cmp.second - cmp.first > 8192) {
-                        need_del.push_back(pair.first);
-                    }
-                }
-                for (auto id : need_del) rc.erase(id);
-            }
-            // cache the first message fragment
-            rc.emplace(msg.id_, cache_t { ipc::data_length, make_cache(msg.data_, msg_size) });
-        }
-        // has cached before this message
-        else {
-            auto& cac = cac_it->second;
-            // this is the last message fragment
-            if (msg.remain_ <= 0) {
-                cac.append(&(msg.data_), msg_size);
-                // finish this message, erase it from cache
-                auto buff = std::move(cac.buff_);
-                rc.erase(cac_it);
-                return buff;
-            }
-            // there are remain datas after this message
-            cac.append(&(msg.data_), ipc::data_length);
-        }
-    }
-}
-
-static ipc::buff_t try_recv(ipc::handle_t h) {
-    return recv(h, 0);
-}
-
-}; // detail_impl<Policy>
-
-template <typename Flag>
-using policy_t = ipc::policy::choose<ipc::circ::elem_array, Flag>;
-
-} // internal-linkage
-
-namespace ipc {
-
-template <typename Flag>
-ipc::handle_t chan_impl<Flag>::inited() {
-    ipc::detail::waiter::init();
-    return nullptr;
-}
-
-template <typename Flag>
-bool chan_impl<Flag>::connect(ipc::handle_t * ph, char const * name, unsigned mode) {
-    return detail_impl<policy_t<Flag>>::connect(ph, name, mode & receiver);
-}
-
-template <typename Flag>
-bool chan_impl<Flag>::reconnect(ipc::handle_t * ph, unsigned mode) {
-    return detail_impl<policy_t<Flag>>::reconnect(ph, mode & receiver);
-}
-
-template <typename Flag>
-void chan_impl<Flag>::disconnect(ipc::handle_t h) {
-    detail_impl<policy_t<Flag>>::disconnect(h);
-}
-
-template <typename Flag>
-void chan_impl<Flag>::destroy(ipc::handle_t h) {
-    detail_impl<policy_t<Flag>>::destroy(h);
-}
-
-template <typename Flag>
-char const * chan_impl<Flag>::name(ipc::handle_t h) {
-    auto info = detail_impl<policy_t<Flag>>::info_of(h);
-    return (info == nullptr) ? nullptr : info->name_.c_str();
-}
-
-template <typename Flag>
-std::size_t chan_impl<Flag>::recv_count(ipc::handle_t h) {
-    return detail_impl<policy_t<Flag>>::recv_count(h);
-}
-
-template <typename Flag>
-bool chan_impl<Flag>::wait_for_recv(ipc::handle_t h, std::size_t r_count, std::uint64_t tm) {
-    return detail_impl<policy_t<Flag>>::wait_for_recv(h, r_count, tm);
-}
-
-template <typename Flag>
-bool chan_impl<Flag>::send(ipc::handle_t h, void const * data, std::size_t size, std::uint64_t tm) {
-    return detail_impl<policy_t<Flag>>::send(h, data, size, tm);
-}
-
-template <typename Flag>
-buff_t chan_impl<Flag>::recv(ipc::handle_t h, std::uint64_t tm) {
-    return detail_impl<policy_t<Flag>>::recv(h, tm);
-}
-
-template <typename Flag>
-bool chan_impl<Flag>::try_send(ipc::handle_t h, void const * data, std::size_t size, std::uint64_t tm) {
-    return detail_impl<policy_t<Flag>>::try_send(h, data, size, tm);
-}
-
-template <typename Flag>
-buff_t chan_impl<Flag>::try_recv(ipc::handle_t h) {
-    return detail_impl<policy_t<Flag>>::try_recv(h);
-}
-
-template struct chan_impl<ipc::wr<relat::single, relat::single, trans::unicast  >>;
-// template struct chan_impl<ipc::wr<relat::single, relat::multi , trans::unicast  >>; // TBD
-// template struct chan_impl<ipc::wr<relat::multi , relat::multi , trans::unicast  >>; // TBD
-template struct chan_impl<ipc::wr<relat::single, relat::multi , trans::broadcast>>;
-template struct chan_impl<ipc::wr<relat::multi , relat::multi , trans::broadcast>>;
-
-} // namespace ipc

crazy_functions/test_project/cpp/cppipc/policy.h

@@ -1,25 +0,0 @@
-#pragma once
-
-#include <type_traits>
-
-#include "libipc/def.h"
-#include "libipc/prod_cons.h"
-
-#include "libipc/circ/elem_array.h"
-
-namespace ipc {
-namespace policy {
-
-template <template <typename, std::size_t...> class Elems, typename Flag>
-struct choose;
-
-template <typename Flag>
-struct choose<circ::elem_array, Flag> {
-    using flag_t = Flag;
-
-    template <std::size_t DataSize, std::size_t AlignSize>
-    using elems_t = circ::elem_array<ipc::prod_cons_impl<flag_t>, DataSize, AlignSize>;
-};
-
-} // namespace policy
-} // namespace ipc

crazy_functions/test_project/cpp/cppipc/pool_alloc.cpp

@@ -1,17 +0,0 @@
-#include "libipc/pool_alloc.h"
-
-#include "libipc/memory/resource.h"
-
-namespace ipc {
-namespace mem {
-
-void* pool_alloc::alloc(std::size_t size) {
-    return async_pool_alloc::alloc(size);
-}
-
-void pool_alloc::free(void* p, std::size_t size) {
-    async_pool_alloc::free(p, size);
-}
-
-} // namespace mem
-} // namespace ipc

crazy_functions/test_project/cpp/cppipc/prod_cons.h

@@ -1,433 +0,0 @@
-#pragma once
-
-#include <atomic>
-#include <utility>
-#include <cstring>
-#include <type_traits>
-#include <cstdint>
-
-#include "libipc/def.h"
-
-#include "libipc/platform/detail.h"
-#include "libipc/circ/elem_def.h"
-#include "libipc/utility/log.h"
-#include "libipc/utility/utility.h"
-
-namespace ipc {
-
-////////////////////////////////////////////////////////////////
-/// producer-consumer implementation
-////////////////////////////////////////////////////////////////
-
-template <typename Flag>
-struct prod_cons_impl;
-
-template <>
-struct prod_cons_impl<wr<relat::single, relat::single, trans::unicast>> {
-
-    template <std::size_t DataSize, std::size_t AlignSize>
-    struct elem_t {
-        std::aligned_storage_t<DataSize, AlignSize> data_ {};
-    };
-
-    alignas(cache_line_size) std::atomic<circ::u2_t> rd_; // read index
-    alignas(cache_line_size) std::atomic<circ::u2_t> wt_; // write index
-
-    constexpr circ::u2_t cursor() const noexcept {
-        return 0;
-    }
-
-    template <typename W, typename F, typename E>
-    bool push(W* /*wrapper*/, F&& f, E* elems) {
-        auto cur_wt = circ::index_of(wt_.load(std::memory_order_relaxed));
-        if (cur_wt == circ::index_of(rd_.load(std::memory_order_acquire) - 1)) {
-            return false; // full
-        }
-        std::forward<F>(f)(&(elems[cur_wt].data_));
-        wt_.fetch_add(1, std::memory_order_release);
-        return true;
-    }
-
-    /**
-     * In single-single-unicast, 'force_push' means 'no reader' or 'the only one reader is dead'.
-     * So we could just disconnect all connections of receiver, and return false.
-    */
-    template <typename W, typename F, typename E>
-    bool force_push(W* wrapper, F&&, E*) {
-        wrapper->elems()->disconnect_receiver(~static_cast<circ::cc_t>(0u));
-        return false;
-    }
-
-    template <typename W, typename F, typename R, typename E>
-    bool pop(W* /*wrapper*/, circ::u2_t& /*cur*/, F&& f, R&& out, E* elems) {
-        auto cur_rd = circ::index_of(rd_.load(std::memory_order_relaxed));
-        if (cur_rd == circ::index_of(wt_.load(std::memory_order_acquire))) {
-            return false; // empty
-        }
-        std::forward<F>(f)(&(elems[cur_rd].data_));
-        std::forward<R>(out)(true);
-        rd_.fetch_add(1, std::memory_order_release);
-        return true;
-    }
-};
-
-template <>
-struct prod_cons_impl<wr<relat::single, relat::multi , trans::unicast>>
-     : prod_cons_impl<wr<relat::single, relat::single, trans::unicast>> {
-
-    template <typename W, typename F, typename E>
-    bool force_push(W* wrapper, F&&, E*) {
-        wrapper->elems()->disconnect_receiver(1);
-        return false;
-    }
-
-    template <typename W, typename F, typename R, 
-              template <std::size_t, std::size_t> class E, std::size_t DS, std::size_t AS>
-    bool pop(W* /*wrapper*/, circ::u2_t& /*cur*/, F&& f, R&& out, E<DS, AS>* elems) {
-        byte_t buff[DS];
-        for (unsigned k = 0;;) {
-            auto cur_rd = rd_.load(std::memory_order_relaxed);
-            if (circ::index_of(cur_rd) ==
-                circ::index_of(wt_.load(std::memory_order_acquire))) {
-                return false; // empty
-            }
-            std::memcpy(buff, &(elems[circ::index_of(cur_rd)].data_), sizeof(buff));
-            if (rd_.compare_exchange_weak(cur_rd, cur_rd + 1, std::memory_order_release)) {
-                std::forward<F>(f)(buff);
-                std::forward<R>(out)(true);
-                return true;
-            }
-            ipc::yield(k);
-        }
-    }
-};
-
-template <>
-struct prod_cons_impl<wr<relat::multi , relat::multi, trans::unicast>>
-     : prod_cons_impl<wr<relat::single, relat::multi, trans::unicast>> {
-
-    using flag_t = std::uint64_t;
-
-    template <std::size_t DataSize, std::size_t AlignSize>
-    struct elem_t {
-        std::aligned_storage_t<DataSize, AlignSize> data_ {};
-        std::atomic<flag_t> f_ct_ { 0 }; // commit flag
-    };
-
-    alignas(cache_line_size) std::atomic<circ::u2_t> ct_; // commit index
-
-    template <typename W, typename F, typename E>
-    bool push(W* /*wrapper*/, F&& f, E* elems) {
-        circ::u2_t cur_ct, nxt_ct;
-        for (unsigned k = 0;;) {
-            cur_ct = ct_.load(std::memory_order_relaxed);
-            if (circ::index_of(nxt_ct = cur_ct + 1) ==
-                circ::index_of(rd_.load(std::memory_order_acquire))) {
-                return false; // full
-            }
-            if (ct_.compare_exchange_weak(cur_ct, nxt_ct, std::memory_order_acq_rel)) {
-                break;
-            }
-            ipc::yield(k);
-        }
-        auto* el = elems + circ::index_of(cur_ct);
-        std::forward<F>(f)(&(el->data_));
-        // set flag & try update wt
-        el->f_ct_.store(~static_cast<flag_t>(cur_ct), std::memory_order_release);
-        while (1) {
-            auto cac_ct = el->f_ct_.load(std::memory_order_acquire);
-            if (cur_ct != wt_.load(std::memory_order_relaxed)) {
-                return true;
-            }
-            if ((~cac_ct) != cur_ct) {
-                return true;
-            }
-            if (!el->f_ct_.compare_exchange_strong(cac_ct, 0, std::memory_order_relaxed)) {
-                return true;
-            }
-            wt_.store(nxt_ct, std::memory_order_release);
-            cur_ct = nxt_ct;
-            nxt_ct = cur_ct + 1;
-            el = elems + circ::index_of(cur_ct);
-        }
-        return true;
-    }
-
-    template <typename W, typename F, typename E>
-    bool force_push(W* wrapper, F&&, E*) {
-        wrapper->elems()->disconnect_receiver(1);
-        return false;
-    }
-
-    template <typename W, typename F, typename R, 
-              template <std::size_t, std::size_t> class E, std::size_t DS, std::size_t AS>
-    bool pop(W* /*wrapper*/, circ::u2_t& /*cur*/, F&& f, R&& out, E<DS, AS>* elems) {
-        byte_t buff[DS];
-        for (unsigned k = 0;;) {
-            auto cur_rd = rd_.load(std::memory_order_relaxed);
-            auto cur_wt = wt_.load(std::memory_order_acquire);
-            auto id_rd  = circ::index_of(cur_rd);
-            auto id_wt  = circ::index_of(cur_wt);
-            if (id_rd == id_wt) {
-                auto* el = elems + id_wt;
-                auto cac_ct = el->f_ct_.load(std::memory_order_acquire);
-                if ((~cac_ct) != cur_wt) {
-                    return false; // empty
-                }
-                if (el->f_ct_.compare_exchange_weak(cac_ct, 0, std::memory_order_relaxed)) {
-                    wt_.store(cur_wt + 1, std::memory_order_release);
-                }
-                k = 0;
-            }
-            else {
-                std::memcpy(buff, &(elems[circ::index_of(cur_rd)].data_), sizeof(buff));
-                if (rd_.compare_exchange_weak(cur_rd, cur_rd + 1, std::memory_order_release)) {
-                    std::forward<F>(f)(buff);
-                    std::forward<R>(out)(true);
-                    return true;
-                }
-                ipc::yield(k);
-            }
-        }
-    }
-};
-
-template <>
-struct prod_cons_impl<wr<relat::single, relat::multi, trans::broadcast>> {
-
-    using rc_t = std::uint64_t;
-
-    enum : rc_t {
-        ep_mask = 0x00000000ffffffffull,
-        ep_incr = 0x0000000100000000ull
-    };
-
-    template <std::size_t DataSize, std::size_t AlignSize>
-    struct elem_t {
-        std::aligned_storage_t<DataSize, AlignSize> data_ {};
-        std::atomic<rc_t> rc_ { 0 }; // read-counter
-    };
-
-    alignas(cache_line_size) std::atomic<circ::u2_t> wt_;   // write index
-    alignas(cache_line_size) rc_t epoch_ { 0 };             // only one writer
-
-    circ::u2_t cursor() const noexcept {
-        return wt_.load(std::memory_order_acquire);
-    }
-
-    template <typename W, typename F, typename E>
-    bool push(W* wrapper, F&& f, E* elems) {
-        E* el;
-        for (unsigned k = 0;;) {
-            circ::cc_t cc = wrapper->elems()->connections(std::memory_order_relaxed);
-            if (cc == 0) return false; // no reader
-            el = elems + circ::index_of(wt_.load(std::memory_order_relaxed));
-            // check all consumers have finished reading this element
-            auto cur_rc = el->rc_.load(std::memory_order_acquire);
-            circ::cc_t rem_cc = cur_rc & ep_mask;
-            if ((cc & rem_cc) && ((cur_rc & ~ep_mask) == epoch_)) {
-                return false; // has not finished yet
-            }
-            // consider rem_cc to be 0 here
-            if (el->rc_.compare_exchange_weak(
-                        cur_rc, epoch_ | static_cast<rc_t>(cc), std::memory_order_release)) {
-                break;
-            }
-            ipc::yield(k);
-        }
-        std::forward<F>(f)(&(el->data_));
-        wt_.fetch_add(1, std::memory_order_release);
-        return true;
-    }
-
-    template <typename W, typename F, typename E>
-    bool force_push(W* wrapper, F&& f, E* elems) {
-        E* el;
-        epoch_ += ep_incr;
-        for (unsigned k = 0;;) {
-            circ::cc_t cc = wrapper->elems()->connections(std::memory_order_relaxed);
-            if (cc == 0) return false; // no reader
-            el = elems + circ::index_of(wt_.load(std::memory_order_relaxed));
-            // check all consumers have finished reading this element
-            auto cur_rc = el->rc_.load(std::memory_order_acquire);
-            circ::cc_t rem_cc = cur_rc & ep_mask;
-            if (cc & rem_cc) {
-                ipc::log("force_push: k = %u, cc = %u, rem_cc = %u\n", k, cc, rem_cc);
-                cc = wrapper->elems()->disconnect_receiver(rem_cc); // disconnect all invalid readers
-                if (cc == 0) return false; // no reader
-            }
-            // just compare & exchange
-            if (el->rc_.compare_exchange_weak(
-                        cur_rc, epoch_ | static_cast<rc_t>(cc), std::memory_order_release)) {
-                break;
-            }
-            ipc::yield(k);
-        }
-        std::forward<F>(f)(&(el->data_));
-        wt_.fetch_add(1, std::memory_order_release);
-        return true;
-    }
-
-    template <typename W, typename F, typename R, typename E>
-    bool pop(W* wrapper, circ::u2_t& cur, F&& f, R&& out, E* elems) {
-        if (cur == cursor()) return false; // acquire
-        auto* el = elems + circ::index_of(cur++);
-        std::forward<F>(f)(&(el->data_));
-        for (unsigned k = 0;;) {
-            auto cur_rc = el->rc_.load(std::memory_order_acquire);
-            if ((cur_rc & ep_mask) == 0) {
-                std::forward<R>(out)(true);
-                return true;
-            }
-            auto nxt_rc = cur_rc & ~static_cast<rc_t>(wrapper->connected_id());
-            if (el->rc_.compare_exchange_weak(cur_rc, nxt_rc, std::memory_order_release)) {
-                std::forward<R>(out)((nxt_rc & ep_mask) == 0);
-                return true;
-            }
-            ipc::yield(k);
-        }
-    }
-};
-
-template <>
-struct prod_cons_impl<wr<relat::multi, relat::multi, trans::broadcast>> {
-
-    using rc_t   = std::uint64_t;
-    using flag_t = std::uint64_t;
-
-    enum : rc_t {
-        rc_mask = 0x00000000ffffffffull,
-        ep_mask = 0x00ffffffffffffffull,
-        ep_incr = 0x0100000000000000ull,
-        ic_mask = 0xff000000ffffffffull,
-        ic_incr = 0x0000000100000000ull
-    };
-
-    template <std::size_t DataSize, std::size_t AlignSize>
-    struct elem_t {
-        std::aligned_storage_t<DataSize, AlignSize> data_ {};
-        std::atomic<rc_t  > rc_   { 0 }; // read-counter
-        std::atomic<flag_t> f_ct_ { 0 }; // commit flag
-    };
-
-    alignas(cache_line_size) std::atomic<circ::u2_t> ct_;   // commit index
-    alignas(cache_line_size) std::atomic<rc_t> epoch_ { 0 };
-
-    circ::u2_t cursor() const noexcept {
-        return ct_.load(std::memory_order_acquire);
-    }
-
-    constexpr static rc_t inc_rc(rc_t rc) noexcept {
-        return (rc & ic_mask) | ((rc + ic_incr) & ~ic_mask);
-    }
-
-    constexpr static rc_t inc_mask(rc_t rc) noexcept {
-        return inc_rc(rc) & ~rc_mask;
-    }
-
-    template <typename W, typename F, typename E>
-    bool push(W* wrapper, F&& f, E* elems) {
-        E* el;
-        circ::u2_t cur_ct;
-        rc_t epoch = epoch_.load(std::memory_order_acquire);
-        for (unsigned k = 0;;) {
-            circ::cc_t cc = wrapper->elems()->connections(std::memory_order_relaxed);
-            if (cc == 0) return false; // no reader
-            el = elems + circ::index_of(cur_ct = ct_.load(std::memory_order_relaxed));
-            // check all consumers have finished reading this element
-            auto cur_rc = el->rc_.load(std::memory_order_relaxed);
-            circ::cc_t rem_cc = cur_rc & rc_mask;
-            if ((cc & rem_cc) && ((cur_rc & ~ep_mask) == epoch)) {
-                return false; // has not finished yet
-            }
-            else if (!rem_cc) {
-                auto cur_fl = el->f_ct_.load(std::memory_order_acquire);
-                if ((cur_fl != cur_ct) && cur_fl) {
-                    return false; // full
-                }
-            }
-            // consider rem_cc to be 0 here
-            if (el->rc_.compare_exchange_weak(
-                        cur_rc, inc_mask(epoch | (cur_rc & ep_mask)) | static_cast<rc_t>(cc), std::memory_order_relaxed) &&
-                epoch_.compare_exchange_weak(epoch, epoch, std::memory_order_acq_rel)) {
-                break;
-            }
-            ipc::yield(k);
-        }
-        // only one thread/process would touch here at one time
-        ct_.store(cur_ct + 1, std::memory_order_release);
-        std::forward<F>(f)(&(el->data_));
-        // set flag & try update wt
-        el->f_ct_.store(~static_cast<flag_t>(cur_ct), std::memory_order_release);
-        return true;
-    }
-
-    template <typename W, typename F, typename E>
-    bool force_push(W* wrapper, F&& f, E* elems) {
-        E* el;
-        circ::u2_t cur_ct;
-        rc_t epoch = epoch_.fetch_add(ep_incr, std::memory_order_release) + ep_incr;
-        for (unsigned k = 0;;) {
-            circ::cc_t cc = wrapper->elems()->connections(std::memory_order_relaxed);
-            if (cc == 0) return false; // no reader
-            el = elems + circ::index_of(cur_ct = ct_.load(std::memory_order_relaxed));
-            // check all consumers have finished reading this element
-            auto cur_rc = el->rc_.load(std::memory_order_acquire);
-            circ::cc_t rem_cc = cur_rc & rc_mask;
-            if (cc & rem_cc) {
-                ipc::log("force_push: k = %u, cc = %u, rem_cc = %u\n", k, cc, rem_cc);
-                cc = wrapper->elems()->disconnect_receiver(rem_cc); // disconnect all invalid readers
-                if (cc == 0) return false; // no reader
-            }
-            // just compare & exchange
-            if (el->rc_.compare_exchange_weak(
-                        cur_rc, inc_mask(epoch | (cur_rc & ep_mask)) | static_cast<rc_t>(cc), std::memory_order_relaxed)) {
-                if (epoch == epoch_.load(std::memory_order_acquire)) {
-                    break;
-                }
-                else if (push(wrapper, std::forward<F>(f), elems)) {
-                    return true;
-                }
-                epoch = epoch_.fetch_add(ep_incr, std::memory_order_release) + ep_incr;
-            }
-            ipc::yield(k);
-        }
-        // only one thread/process would touch here at one time
-        ct_.store(cur_ct + 1, std::memory_order_release);
-        std::forward<F>(f)(&(el->data_));
-        // set flag & try update wt
-        el->f_ct_.store(~static_cast<flag_t>(cur_ct), std::memory_order_release);
-        return true;
-    }
-
-    template <typename W, typename F, typename R, typename E, std::size_t N>
-    bool pop(W* wrapper, circ::u2_t& cur, F&& f, R&& out, E(& elems)[N]) {
-        auto* el = elems + circ::index_of(cur);
-        auto cur_fl = el->f_ct_.load(std::memory_order_acquire);
-        if (cur_fl != ~static_cast<flag_t>(cur)) {
-            return false; // empty
-        }
-        ++cur;
-        std::forward<F>(f)(&(el->data_));
-        for (unsigned k = 0;;) {
-            auto cur_rc = el->rc_.load(std::memory_order_acquire);
-            if ((cur_rc & rc_mask) == 0) {
-                std::forward<R>(out)(true);
-                el->f_ct_.store(cur + N - 1, std::memory_order_release);
-                return true;
-            }
-            auto nxt_rc = inc_rc(cur_rc) & ~static_cast<rc_t>(wrapper->connected_id());
-            bool last_one = false;
-            if ((last_one = (nxt_rc & rc_mask) == 0)) {
-                el->f_ct_.store(cur + N - 1, std::memory_order_release);
-            }
-            if (el->rc_.compare_exchange_weak(cur_rc, nxt_rc, std::memory_order_release)) {
-                std::forward<R>(out)(last_one);
-                return true;
-            }
-            ipc::yield(k);
-        }
-    }
-};
-
-} // namespace ipc

crazy_functions/test_project/cpp/cppipc/queue.h

@@ -1,216 +0,0 @@
-#pragma once
-
-#include <type_traits>
-#include <new>
-#include <utility>  // [[since C++14]]: std::exchange
-#include <algorithm>
-#include <atomic>
-#include <tuple>
-#include <thread>
-#include <chrono>
-#include <string>
-#include <cassert>  // assert
-
-#include "libipc/def.h"
-#include "libipc/shm.h"
-#include "libipc/rw_lock.h"
-
-#include "libipc/utility/log.h"
-#include "libipc/platform/detail.h"
-#include "libipc/circ/elem_def.h"
-
-namespace ipc {
-namespace detail {
-
-class queue_conn {
-protected:
-    circ::cc_t connected_ = 0;
-    shm::handle elems_h_;
-
-    template <typename Elems>
-    Elems* open(char const * name) {
-        if (name == nullptr || name[0] == '\0') {
-            ipc::error("fail open waiter: name is empty!\n");
-            return nullptr;
-        }
-        if (!elems_h_.acquire(name, sizeof(Elems))) {
-            return nullptr;
-        }
-        auto elems = static_cast<Elems*>(elems_h_.get());
-        if (elems == nullptr) {
-            ipc::error("fail acquire elems: %s\n", name);
-            return nullptr;
-        }
-        elems->init();
-        return elems;
-    }
-
-    void close() {
-        elems_h_.release();
-    }
-
-public:
-    queue_conn() = default;
-    queue_conn(const queue_conn&) = delete;
-    queue_conn& operator=(const queue_conn&) = delete;
-
-    bool connected() const noexcept {
-        return connected_ != 0;
-    }
-
-    circ::cc_t connected_id() const noexcept {
-        return connected_;
-    }
-
-    template <typename Elems>
-    auto connect(Elems* elems) noexcept
-                         /*needs 'optional' here*/
-     -> std::tuple<bool, bool, decltype(std::declval<Elems>().cursor())> {
-        if (elems == nullptr) return {};
-        // if it's already connected, just return
-        if (connected()) return {connected(), false, 0};
-        connected_ = elems->connect_receiver();
-        return {connected(), true, elems->cursor()};
-    }
-
-    template <typename Elems>
-    bool disconnect(Elems* elems) noexcept {
-        if (elems == nullptr) return false;
-        // if it's already disconnected, just return false
-        if (!connected()) return false;
-        elems->disconnect_receiver(std::exchange(connected_, 0));
-        return true;
-    }
-};
-
-template <typename Elems>
-class queue_base : public queue_conn {
-    using base_t = queue_conn;
-
-public:
-    using elems_t  = Elems;
-    using policy_t = typename elems_t::policy_t;
-
-protected:
-    elems_t * elems_ = nullptr;
-    decltype(std::declval<elems_t>().cursor()) cursor_ = 0;
-    bool sender_flag_ = false;
-
-public:
-    using base_t::base_t;
-
-    queue_base() = default;
-
-    explicit queue_base(char const * name)
-        : queue_base{} {
-        elems_ = open<elems_t>(name);
-    }
-
-    explicit queue_base(elems_t * elems) noexcept
-        : queue_base{} {
-        assert(elems != nullptr);
-        elems_ = elems;
-    }
-
-    /* not virtual */ ~queue_base() {
-        base_t::close();
-    }
-
-    elems_t       * elems()       noexcept { return elems_; }
-    elems_t const * elems() const noexcept { return elems_; }
-
-    bool ready_sending() noexcept {
-        if (elems_ == nullptr) return false;
-        return sender_flag_ || (sender_flag_ = elems_->connect_sender());
-    }
-
-    void shut_sending() noexcept {
-        if (elems_ == nullptr) return;
-        if (!sender_flag_) return;
-        elems_->disconnect_sender();
-    }
-
-    bool connect() noexcept {
-        auto tp = base_t::connect(elems_);
-        if (std::get<0>(tp) && std::get<1>(tp)) {
-            cursor_ = std::get<2>(tp);
-            return true;
-        }
-        return std::get<0>(tp);
-    }
-
-    bool disconnect() noexcept {
-        return base_t::disconnect(elems_);
-    }
-
-    std::size_t conn_count() const noexcept {
-        return (elems_ == nullptr) ? static_cast<std::size_t>(invalid_value) : elems_->conn_count();
-    }
-
-    bool valid() const noexcept {
-        return elems_ != nullptr;
-    }
-
-    bool empty() const noexcept {
-        return !valid() || (cursor_ == elems_->cursor());
-    }
-
-    template <typename T, typename F, typename... P>
-    bool push(F&& prep, P&&... params) {
-        if (elems_ == nullptr) return false;
-        return elems_->push(this, [&](void* p) {
-            if (prep(p)) ::new (p) T(std::forward<P>(params)...);
-        });
-    }
-
-    template <typename T, typename F, typename... P>
-    bool force_push(F&& prep, P&&... params) {
-        if (elems_ == nullptr) return false;
-        return elems_->force_push(this, [&](void* p) {
-            if (prep(p)) ::new (p) T(std::forward<P>(params)...);
-        });
-    }
-
-    template <typename T, typename F>
-    bool pop(T& item, F&& out) {
-        if (elems_ == nullptr) {
-            return false;
-        }
-        return elems_->pop(this, &(this->cursor_), [&item](void* p) {
-            ::new (&item) T(std::move(*static_cast<T*>(p)));
-        }, std::forward<F>(out));
-    }
-};
-
-} // namespace detail
-
-template <typename T, typename Policy>
-class queue final : public detail::queue_base<typename Policy::template elems_t<sizeof(T), alignof(T)>> {
-    using base_t = detail::queue_base<typename Policy::template elems_t<sizeof(T), alignof(T)>>;
-
-public:
-    using value_t = T;
-
-    using base_t::base_t;
-
-    template <typename... P>
-    bool push(P&&... params) {
-        return base_t::template push<T>(std::forward<P>(params)...);
-    }
-
-    template <typename... P>
-    bool force_push(P&&... params) {
-        return base_t::template force_push<T>(std::forward<P>(params)...);
-    }
-
-    bool pop(T& item) {
-        return base_t::pop(item, [](bool) {});
-    }
-
-    template <typename F>
-    bool pop(T& item, F&& out) {
-        return base_t::pop(item, std::forward<F>(out));
-    }
-};
-
-} // namespace ipc

crazy_functions/test_project/cpp/cppipc/shm.cpp

@@ -1,103 +0,0 @@
-
-#include <string>
-#include <utility>
-
-#include "libipc/shm.h"
-
-#include "libipc/utility/pimpl.h"
-#include "libipc/memory/resource.h"
-
-namespace ipc {
-namespace shm {
-
-class handle::handle_ : public pimpl<handle_> {
-public:
-    shm::id_t id_ = nullptr;
-    void*     m_  = nullptr;
-
-    ipc::string n_;
-    std::size_t s_ = 0;
-};
-
-handle::handle()
-    : p_(p_->make()) {
-}
-
-handle::handle(char const * name, std::size_t size, unsigned mode)
-    : handle() {
-    acquire(name, size, mode);
-}
-
-handle::handle(handle&& rhs)
-    : handle() {
-    swap(rhs);
-}
-
-handle::~handle() {
-    release();
-    p_->clear();
-}
-
-void handle::swap(handle& rhs) {
-    std::swap(p_, rhs.p_);
-}
-
-handle& handle::operator=(handle rhs) {
-    swap(rhs);
-    return *this;
-}
-
-bool handle::valid() const noexcept {
-    return impl(p_)->m_ != nullptr;
-}
-
-std::size_t handle::size() const noexcept {
-    return impl(p_)->s_;
-}
-
-char const * handle::name() const noexcept {
-    return impl(p_)->n_.c_str();
-}
-
-std::int32_t handle::ref() const noexcept {
-    return shm::get_ref(impl(p_)->id_);
-}
-
-void handle::sub_ref() noexcept {
-    shm::sub_ref(impl(p_)->id_);
-}
-
-bool handle::acquire(char const * name, std::size_t size, unsigned mode) {
-    release();
-    impl(p_)->id_ = shm::acquire((impl(p_)->n_ = name).c_str(), size, mode);
-    impl(p_)->m_  = shm::get_mem(impl(p_)->id_, &(impl(p_)->s_));
-    return valid();
-}
-
-std::int32_t handle::release() {
-    if (impl(p_)->id_ == nullptr) return -1;
-    return shm::release(detach());
-}
-
-void* handle::get() const {
-    return impl(p_)->m_;
-}
-
-void handle::attach(id_t id) {
-    if (id == nullptr) return;
-    release();
-    impl(p_)->id_ = id;
-    impl(p_)->m_  = shm::get_mem(impl(p_)->id_, &(impl(p_)->s_));
-}
-
-id_t handle::detach() {
-    auto old = impl(p_)->id_;
-    impl(p_)->id_ = nullptr;
-    impl(p_)->m_  = nullptr;
-    impl(p_)->s_  = 0;
-    impl(p_)->n_.clear();
-    return old;
-}
-
-} // namespace shm
-} // namespace ipc

crazy_functions/test_project/cpp/cppipc/waiter.h

@@ -1,83 +0,0 @@
-#pragma once
-
-#include <utility>
-#include <string>
-#include <mutex>
-#include <atomic>
-
-#include "libipc/def.h"
-#include "libipc/mutex.h"
-#include "libipc/condition.h"
-#include "libipc/platform/detail.h"
-
-namespace ipc {
-namespace detail {
-
-class waiter {
-    ipc::sync::condition cond_;
-    ipc::sync::mutex     lock_;
-    std::atomic<bool>    quit_ {false};
-
-public:
-    static void init();
-
-    waiter() = default;
-    waiter(char const *name) {
-        open(name);
-    }
-
-    ~waiter() {
-        close();
-    }
-
-    bool valid() const noexcept {
-        return cond_.valid() && lock_.valid();
-    }
-
-    bool open(char const *name) noexcept {
-        quit_.store(false, std::memory_order_relaxed);
-        if (!cond_.open((std::string{"_waiter_cond_"} + name).c_str())) {
-            return false;
-        }
-        if (!lock_.open((std::string{"_waiter_lock_"} + name).c_str())) {
-            cond_.close();
-            return false;
-        }
-        return valid();
-    }
-
-    void close() noexcept {
-        cond_.close();
-        lock_.close();
-    }
-
-    template <typename F>
-    bool wait_if(F &&pred, std::uint64_t tm = ipc::invalid_value) noexcept {
-        IPC_UNUSED_ std::lock_guard<ipc::sync::mutex> guard {lock_};
-        while ([this, &pred] {
-                    return !quit_.load(std::memory_order_relaxed)
-                        && std::forward<F>(pred)();
-                }()) {
-            if (!cond_.wait(lock_, tm)) return false;
-        }
-        return true;
-    }
-
-    bool notify() noexcept {
-        std::lock_guard<ipc::sync::mutex>{lock_}; // barrier
-        return cond_.notify(lock_);
-    }
-
-    bool broadcast() noexcept {
-        std::lock_guard<ipc::sync::mutex>{lock_}; // barrier
-        return cond_.broadcast(lock_);
-    }
-
-    bool quit_waiting() {
-        quit_.store(true, std::memory_order_release);
-        return broadcast();
-    }
-};
-
-} // namespace detail
-} // namespace ipc

crazy_functions/test_project/cpp/cppipc/来源

@@ -1,3 +0,0 @@
-https://github.com/mutouyun/cpp-ipc
-
-A high-performance inter-process communication library using shared memory on Linux/Windows.

crazy_functions/test_project/cpp/libJPG/jpgd.cpp

@@ -1,3276 +0,0 @@
-// jpgd.cpp - C++ class for JPEG decompression.
-// Public domain, Rich Geldreich <richgel99@gmail.com>
-// Last updated Apr. 16, 2011
-// Alex Evans: Linear memory allocator (taken from jpge.h).
-//
-// Supports progressive and baseline sequential JPEG image files, and the most common chroma subsampling factors: Y, H1V1, H2V1, H1V2, and H2V2.
-//
-// Chroma upsampling quality: H2V2 is upsampled in the frequency domain, H2V1 and H1V2 are upsampled using point sampling.
-// Chroma upsampling reference: "Fast Scheme for Image Size Change in the Compressed Domain"
-// http://vision.ai.uiuc.edu/~dugad/research/dct/index.html
-
-#include "jpgd.h"
-#include <string.h>
-
-#include <assert.h>
-// BEGIN EPIC MOD
-#define JPGD_ASSERT(x) { assert(x); CA_ASSUME(x); } (void)0
-// END EPIC MOD
-
-#ifdef _MSC_VER
-#pragma warning (disable : 4611) // warning C4611: interaction between '_setjmp' and C++ object destruction is non-portable
-#endif
-
-// Set to 1 to enable freq. domain chroma upsampling on images using H2V2 subsampling (0=faster nearest neighbor sampling).
-// This is slower, but results in higher quality on images with highly saturated colors.
-#define JPGD_SUPPORT_FREQ_DOMAIN_UPSAMPLING 1
-
-#define JPGD_TRUE (1)
-#define JPGD_FALSE (0)
-
-#define JPGD_MAX(a,b) (((a)>(b)) ? (a) : (b))
-#define JPGD_MIN(a,b) (((a)<(b)) ? (a) : (b))
-
-namespace jpgd {
-
-	static inline void *jpgd_malloc(size_t nSize) { return FMemory::Malloc(nSize); }
-	static inline void jpgd_free(void *p) { FMemory::Free(p); }
-
-// BEGIN EPIC MOD
-//@UE3 - use UE3 BGRA encoding instead of assuming RGBA
-	// stolen from IImageWrapper.h
-	enum ERGBFormatJPG
-	{
-		Invalid = -1,
-		RGBA =  0,
-		BGRA =  1,
-		Gray =  2,
-	};
-	static ERGBFormatJPG jpg_format;
-// END EPIC MOD
-
-	// DCT coefficients are stored in this sequence.
-	static int g_ZAG[64] = {  0,1,8,16,9,2,3,10,17,24,32,25,18,11,4,5,12,19,26,33,40,48,41,34,27,20,13,6,7,14,21,28,35,42,49,56,57,50,43,36,29,22,15,23,30,37,44,51,58,59,52,45,38,31,39,46,53,60,61,54,47,55,62,63 };
-
-	enum JPEG_MARKER
-	{
-		M_SOF0  = 0xC0, M_SOF1  = 0xC1, M_SOF2  = 0xC2, M_SOF3  = 0xC3, M_SOF5  = 0xC5, M_SOF6  = 0xC6, M_SOF7  = 0xC7, M_JPG   = 0xC8,
-		M_SOF9  = 0xC9, M_SOF10 = 0xCA, M_SOF11 = 0xCB, M_SOF13 = 0xCD, M_SOF14 = 0xCE, M_SOF15 = 0xCF, M_DHT   = 0xC4, M_DAC   = 0xCC,
-		M_RST0  = 0xD0, M_RST1  = 0xD1, M_RST2  = 0xD2, M_RST3  = 0xD3, M_RST4  = 0xD4, M_RST5  = 0xD5, M_RST6  = 0xD6, M_RST7  = 0xD7,
-		M_SOI   = 0xD8, M_EOI   = 0xD9, M_SOS   = 0xDA, M_DQT   = 0xDB, M_DNL   = 0xDC, M_DRI   = 0xDD, M_DHP   = 0xDE, M_EXP   = 0xDF,
-		M_APP0  = 0xE0, M_APP15 = 0xEF, M_JPG0  = 0xF0, M_JPG13 = 0xFD, M_COM   = 0xFE, M_TEM   = 0x01, M_ERROR = 0x100, RST0   = 0xD0
-	};
-
-	enum JPEG_SUBSAMPLING { JPGD_GRAYSCALE = 0, JPGD_YH1V1, JPGD_YH2V1, JPGD_YH1V2, JPGD_YH2V2 };
-
-#define CONST_BITS  13
-#define PASS1_BITS  2
-#define SCALEDONE ((int32)1)
-
-#define FIX_0_298631336  ((int32)2446)        /* FIX(0.298631336) */
-#define FIX_0_390180644  ((int32)3196)        /* FIX(0.390180644) */
-#define FIX_0_541196100  ((int32)4433)        /* FIX(0.541196100) */
-#define FIX_0_765366865  ((int32)6270)        /* FIX(0.765366865) */
-#define FIX_0_899976223  ((int32)7373)        /* FIX(0.899976223) */
-#define FIX_1_175875602  ((int32)9633)        /* FIX(1.175875602) */
-#define FIX_1_501321110  ((int32)12299)       /* FIX(1.501321110) */
-#define FIX_1_847759065  ((int32)15137)       /* FIX(1.847759065) */
-#define FIX_1_961570560  ((int32)16069)       /* FIX(1.961570560) */
-#define FIX_2_053119869  ((int32)16819)       /* FIX(2.053119869) */
-#define FIX_2_562915447  ((int32)20995)       /* FIX(2.562915447) */
-#define FIX_3_072711026  ((int32)25172)       /* FIX(3.072711026) */
-
-#define DESCALE(x,n)  (((x) + (SCALEDONE << ((n)-1))) >> (n))
-#define DESCALE_ZEROSHIFT(x,n)  (((x) + (128 << (n)) + (SCALEDONE << ((n)-1))) >> (n))
-
-#define MULTIPLY(var, cnst)  ((var) * (cnst))
-
-#define CLAMP(i) ((static_cast<uint>(i) > 255) ? (((~i) >> 31) & 0xFF) : (i))
-
-	// Compiler creates a fast path 1D IDCT for X non-zero columns
-	template <int NONZERO_COLS>
-	struct Row
-	{
-		static void idct(int* pTemp, const jpgd_block_t* pSrc)
-		{
-			// ACCESS_COL() will be optimized at compile time to either an array access, or 0.
-#define ACCESS_COL(x) (((x) < NONZERO_COLS) ? (int)pSrc[x] : 0)
-
-			const int z2 = ACCESS_COL(2), z3 = ACCESS_COL(6);
-
-			const int z1 = MULTIPLY(z2 + z3, FIX_0_541196100);
-			const int tmp2 = z1 + MULTIPLY(z3, - FIX_1_847759065);
-			const int tmp3 = z1 + MULTIPLY(z2, FIX_0_765366865);
-
-			const int tmp0 = (ACCESS_COL(0) + ACCESS_COL(4)) << CONST_BITS;
-			const int tmp1 = (ACCESS_COL(0) - ACCESS_COL(4)) << CONST_BITS;
-
-			const int tmp10 = tmp0 + tmp3, tmp13 = tmp0 - tmp3, tmp11 = tmp1 + tmp2, tmp12 = tmp1 - tmp2;
-
-			const int atmp0 = ACCESS_COL(7), atmp1 = ACCESS_COL(5), atmp2 = ACCESS_COL(3), atmp3 = ACCESS_COL(1);
-
-			const int bz1 = atmp0 + atmp3, bz2 = atmp1 + atmp2, bz3 = atmp0 + atmp2, bz4 = atmp1 + atmp3;
-			const int bz5 = MULTIPLY(bz3 + bz4, FIX_1_175875602);
-
-			const int az1 = MULTIPLY(bz1, - FIX_0_899976223);
-			const int az2 = MULTIPLY(bz2, - FIX_2_562915447);
-			const int az3 = MULTIPLY(bz3, - FIX_1_961570560) + bz5;
-			const int az4 = MULTIPLY(bz4, - FIX_0_390180644) + bz5;
-
-			const int btmp0 = MULTIPLY(atmp0, FIX_0_298631336) + az1 + az3;
-			const int btmp1 = MULTIPLY(atmp1, FIX_2_053119869) + az2 + az4;
-			const int btmp2 = MULTIPLY(atmp2, FIX_3_072711026) + az2 + az3;
-			const int btmp3 = MULTIPLY(atmp3, FIX_1_501321110) + az1 + az4;
-
-			pTemp[0] = DESCALE(tmp10 + btmp3, CONST_BITS-PASS1_BITS);
-			pTemp[7] = DESCALE(tmp10 - btmp3, CONST_BITS-PASS1_BITS);
-			pTemp[1] = DESCALE(tmp11 + btmp2, CONST_BITS-PASS1_BITS);
-			pTemp[6] = DESCALE(tmp11 - btmp2, CONST_BITS-PASS1_BITS);
-			pTemp[2] = DESCALE(tmp12 + btmp1, CONST_BITS-PASS1_BITS);
-			pTemp[5] = DESCALE(tmp12 - btmp1, CONST_BITS-PASS1_BITS);
-			pTemp[3] = DESCALE(tmp13 + btmp0, CONST_BITS-PASS1_BITS);
-			pTemp[4] = DESCALE(tmp13 - btmp0, CONST_BITS-PASS1_BITS);
-		}
-	};
-
-	template <>
-	struct Row<0>
-	{
-		static void idct(int* pTemp, const jpgd_block_t* pSrc)
-		{
-#ifdef _MSC_VER
-			pTemp; pSrc;
-#endif
-		}
-	};
-
-	template <>
-	struct Row<1>
-	{
-		static void idct(int* pTemp, const jpgd_block_t* pSrc)
-		{
-			const int dcval = (pSrc[0] << PASS1_BITS);
-
-			pTemp[0] = dcval;
-			pTemp[1] = dcval;
-			pTemp[2] = dcval;
-			pTemp[3] = dcval;
-			pTemp[4] = dcval;
-			pTemp[5] = dcval;
-			pTemp[6] = dcval;
-			pTemp[7] = dcval;
-		}
-	};
-
-	// Compiler creates a fast path 1D IDCT for X non-zero rows
-	template <int NONZERO_ROWS>
-	struct Col
-	{
-		static void idct(uint8* pDst_ptr, const int* pTemp)
-		{
-			// ACCESS_ROW() will be optimized at compile time to either an array access, or 0.
-#define ACCESS_ROW(x) (((x) < NONZERO_ROWS) ? pTemp[x * 8] : 0)
-
-			const int z2 = ACCESS_ROW(2);
-			const int z3 = ACCESS_ROW(6);
-
-			const int z1 = MULTIPLY(z2 + z3, FIX_0_541196100);
-			const int tmp2 = z1 + MULTIPLY(z3, - FIX_1_847759065);
-			const int tmp3 = z1 + MULTIPLY(z2, FIX_0_765366865);
-
-			const int tmp0 = (ACCESS_ROW(0) + ACCESS_ROW(4)) << CONST_BITS;
-			const int tmp1 = (ACCESS_ROW(0) - ACCESS_ROW(4)) << CONST_BITS;
-
-			const int tmp10 = tmp0 + tmp3, tmp13 = tmp0 - tmp3, tmp11 = tmp1 + tmp2, tmp12 = tmp1 - tmp2;
-
-			const int atmp0 = ACCESS_ROW(7), atmp1 = ACCESS_ROW(5), atmp2 = ACCESS_ROW(3), atmp3 = ACCESS_ROW(1);
-
-			const int bz1 = atmp0 + atmp3, bz2 = atmp1 + atmp2, bz3 = atmp0 + atmp2, bz4 = atmp1 + atmp3;
-			const int bz5 = MULTIPLY(bz3 + bz4, FIX_1_175875602);
-
-			const int az1 = MULTIPLY(bz1, - FIX_0_899976223);
-			const int az2 = MULTIPLY(bz2, - FIX_2_562915447);
-			const int az3 = MULTIPLY(bz3, - FIX_1_961570560) + bz5;
-			const int az4 = MULTIPLY(bz4, - FIX_0_390180644) + bz5;
-
-			const int btmp0 = MULTIPLY(atmp0, FIX_0_298631336) + az1 + az3;
-			const int btmp1 = MULTIPLY(atmp1, FIX_2_053119869) + az2 + az4;
-			const int btmp2 = MULTIPLY(atmp2, FIX_3_072711026) + az2 + az3;
-			const int btmp3 = MULTIPLY(atmp3, FIX_1_501321110) + az1 + az4;
-
-			int i = DESCALE_ZEROSHIFT(tmp10 + btmp3, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*0] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp10 - btmp3, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*7] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp11 + btmp2, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*1] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp11 - btmp2, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*6] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp12 + btmp1, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*2] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp12 - btmp1, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*5] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp13 + btmp0, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*3] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp13 - btmp0, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*4] = (uint8)CLAMP(i);
-		}
-	};
-
-	template <>
-	struct Col<1>
-	{
-		static void idct(uint8* pDst_ptr, const int* pTemp)
-		{
-			int dcval = DESCALE_ZEROSHIFT(pTemp[0], PASS1_BITS+3);
-			const uint8 dcval_clamped = (uint8)CLAMP(dcval);
-			pDst_ptr[0*8] = dcval_clamped;
-			pDst_ptr[1*8] = dcval_clamped;
-			pDst_ptr[2*8] = dcval_clamped;
-			pDst_ptr[3*8] = dcval_clamped;
-			pDst_ptr[4*8] = dcval_clamped;
-			pDst_ptr[5*8] = dcval_clamped;
-			pDst_ptr[6*8] = dcval_clamped;
-			pDst_ptr[7*8] = dcval_clamped;
-		}
-	};
-
-	static const uint8 s_idct_row_table[] =
-	{
-		1,0,0,0,0,0,0,0, 2,0,0,0,0,0,0,0, 2,1,0,0,0,0,0,0, 2,1,1,0,0,0,0,0, 2,2,1,0,0,0,0,0, 3,2,1,0,0,0,0,0, 4,2,1,0,0,0,0,0, 4,3,1,0,0,0,0,0,
-		4,3,2,0,0,0,0,0, 4,3,2,1,0,0,0,0, 4,3,2,1,1,0,0,0, 4,3,2,2,1,0,0,0, 4,3,3,2,1,0,0,0, 4,4,3,2,1,0,0,0, 5,4,3,2,1,0,0,0, 6,4,3,2,1,0,0,0,
-		6,5,3,2,1,0,0,0, 6,5,4,2,1,0,0,0, 6,5,4,3,1,0,0,0, 6,5,4,3,2,0,0,0, 6,5,4,3,2,1,0,0, 6,5,4,3,2,1,1,0, 6,5,4,3,2,2,1,0, 6,5,4,3,3,2,1,0,
-		6,5,4,4,3,2,1,0, 6,5,5,4,3,2,1,0, 6,6,5,4,3,2,1,0, 7,6,5,4,3,2,1,0, 8,6,5,4,3,2,1,0, 8,7,5,4,3,2,1,0, 8,7,6,4,3,2,1,0, 8,7,6,5,3,2,1,0,
-		8,7,6,5,4,2,1,0, 8,7,6,5,4,3,1,0, 8,7,6,5,4,3,2,0, 8,7,6,5,4,3,2,1, 8,7,6,5,4,3,2,2, 8,7,6,5,4,3,3,2, 8,7,6,5,4,4,3,2, 8,7,6,5,5,4,3,2,
-		8,7,6,6,5,4,3,2, 8,7,7,6,5,4,3,2, 8,8,7,6,5,4,3,2, 8,8,8,6,5,4,3,2, 8,8,8,7,5,4,3,2, 8,8,8,7,6,4,3,2, 8,8,8,7,6,5,3,2, 8,8,8,7,6,5,4,2,
-		8,8,8,7,6,5,4,3, 8,8,8,7,6,5,4,4, 8,8,8,7,6,5,5,4, 8,8,8,7,6,6,5,4, 8,8,8,7,7,6,5,4, 8,8,8,8,7,6,5,4, 8,8,8,8,8,6,5,4, 8,8,8,8,8,7,5,4,
-		8,8,8,8,8,7,6,4, 8,8,8,8,8,7,6,5, 8,8,8,8,8,7,6,6, 8,8,8,8,8,7,7,6, 8,8,8,8,8,8,7,6, 8,8,8,8,8,8,8,6, 8,8,8,8,8,8,8,7, 8,8,8,8,8,8,8,8,
-	};
-
-	static const uint8 s_idct_col_table[] = { 1, 1, 2, 3, 3, 3, 3, 3, 3, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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 };
-
-	void idct(const jpgd_block_t* pSrc_ptr, uint8* pDst_ptr, int block_max_zag)
-	{
-		JPGD_ASSERT(block_max_zag >= 1);
-		JPGD_ASSERT(block_max_zag <= 64);
-
-		if (block_max_zag == 1)
-		{
-			int k = ((pSrc_ptr[0] + 4) >> 3) + 128;
-			k = CLAMP(k);
-			k = k | (k<<8);
-			k = k | (k<<16);
-
-			for (int i = 8; i > 0; i--)
-			{
-				*(int*)&pDst_ptr[0] = k;
-				*(int*)&pDst_ptr[4] = k;
-				pDst_ptr += 8;
-			}
-			return;
-		}
-
-		int temp[64];
-
-		const jpgd_block_t* pSrc = pSrc_ptr;
-		int* pTemp = temp;
-
-		const uint8* pRow_tab = &s_idct_row_table[(block_max_zag - 1) * 8];
-		int i;
-		for (i = 8; i > 0; i--, pRow_tab++)
-		{
-			switch (*pRow_tab)
-			{
-			case 0: Row<0>::idct(pTemp, pSrc); break;
-			case 1: Row<1>::idct(pTemp, pSrc); break;
-			case 2: Row<2>::idct(pTemp, pSrc); break;
-			case 3: Row<3>::idct(pTemp, pSrc); break;
-			case 4: Row<4>::idct(pTemp, pSrc); break;
-			case 5: Row<5>::idct(pTemp, pSrc); break;
-			case 6: Row<6>::idct(pTemp, pSrc); break;
-			case 7: Row<7>::idct(pTemp, pSrc); break;
-			case 8: Row<8>::idct(pTemp, pSrc); break;
-			}
-
-			pSrc += 8;
-			pTemp += 8;
-		}
-
-		pTemp = temp;
-
-		const int nonzero_rows = s_idct_col_table[block_max_zag - 1];
-		for (i = 8; i > 0; i--)
-		{
-			switch (nonzero_rows)
-			{
-			case 1: Col<1>::idct(pDst_ptr, pTemp); break;
-			case 2: Col<2>::idct(pDst_ptr, pTemp); break;
-			case 3: Col<3>::idct(pDst_ptr, pTemp); break;
-			case 4: Col<4>::idct(pDst_ptr, pTemp); break;
-			case 5: Col<5>::idct(pDst_ptr, pTemp); break;
-			case 6: Col<6>::idct(pDst_ptr, pTemp); break;
-			case 7: Col<7>::idct(pDst_ptr, pTemp); break;
-			case 8: Col<8>::idct(pDst_ptr, pTemp); break;
-			}
-
-			pTemp++;
-			pDst_ptr++;
-		}
-	}
-
-	void idct_4x4(const jpgd_block_t* pSrc_ptr, uint8* pDst_ptr)
-	{
-		int temp[64];
-		int* pTemp = temp;
-		const jpgd_block_t* pSrc = pSrc_ptr;
-
-		for (int i = 4; i > 0; i--)
-		{
-			Row<4>::idct(pTemp, pSrc);
-			pSrc += 8;
-			pTemp += 8;
-		}
-
-		pTemp = temp;
-		for (int i = 8; i > 0; i--)
-		{
-			Col<4>::idct(pDst_ptr, pTemp);
-			pTemp++;
-			pDst_ptr++;
-		}
-	}
-
-	// Retrieve one character from the input stream.
-	inline uint jpeg_decoder::get_char()
-	{
-		// Any bytes remaining in buffer?
-		if (!m_in_buf_left)
-		{
-			// Try to get more bytes.
-			prep_in_buffer();
-			// Still nothing to get?
-			if (!m_in_buf_left)
-			{
-				// Pad the end of the stream with 0xFF 0xD9 (EOI marker)
-				int t = m_tem_flag;
-				m_tem_flag ^= 1;
-				if (t)
-					return 0xD9;
-				else
-					return 0xFF;
-			}
-		}
-
-		uint c = *m_pIn_buf_ofs++;
-		m_in_buf_left--;
-
-		return c;
-	}
-
-	// Same as previous method, except can indicate if the character is a pad character or not.
-	inline uint jpeg_decoder::get_char(bool *pPadding_flag)
-	{
-		if (!m_in_buf_left)
-		{
-			prep_in_buffer();
-			if (!m_in_buf_left)
-			{
-				*pPadding_flag = true;
-				int t = m_tem_flag;
-				m_tem_flag ^= 1;
-				if (t)
-					return 0xD9;
-				else
-					return 0xFF;
-			}
-		}
-
-		*pPadding_flag = false;
-
-		uint c = *m_pIn_buf_ofs++;
-		m_in_buf_left--;
-
-		return c;
-	}
-
-	// Inserts a previously retrieved character back into the input buffer.
-	inline void jpeg_decoder::stuff_char(uint8 q)
-	{
-		*(--m_pIn_buf_ofs) = q;
-		m_in_buf_left++;
-	}
-
-	// Retrieves one character from the input stream, but does not read past markers. Will continue to return 0xFF when a marker is encountered.
-	inline uint8 jpeg_decoder::get_octet()
-	{
-		bool padding_flag;
-		int c = get_char(&padding_flag);
-
-		if (c == 0xFF)
-		{
-			if (padding_flag)
-				return 0xFF;
-
-			c = get_char(&padding_flag);
-			if (padding_flag)
-			{
-				stuff_char(0xFF);
-				return 0xFF;
-			}
-
-			if (c == 0x00)
-				return 0xFF;
-			else
-			{
-				stuff_char(static_cast<uint8>(c));
-				stuff_char(0xFF);
-				return 0xFF;
-			}
-		}
-
-		return static_cast<uint8>(c);
-	}
-
-	// Retrieves a variable number of bits from the input stream. Does not recognize markers.
-	inline uint jpeg_decoder::get_bits(int num_bits)
-	{
-		if (!num_bits)
-			return 0;
-
-		uint i = m_bit_buf >> (32 - num_bits);
-
-		if ((m_bits_left -= num_bits) <= 0)
-		{
-			m_bit_buf <<= (num_bits += m_bits_left);
-
-			uint c1 = get_char();
-			uint c2 = get_char();
-			m_bit_buf = (m_bit_buf & 0xFFFF0000) | (c1 << 8) | c2;
-
-			m_bit_buf <<= -m_bits_left;
-
-			m_bits_left += 16;
-
-			JPGD_ASSERT(m_bits_left >= 0);
-		}
-		else
-			m_bit_buf <<= num_bits;
-
-		return i;
-	}
-
-	// Retrieves a variable number of bits from the input stream. Markers will not be read into the input bit buffer. Instead, an infinite number of all 1's will be returned when a marker is encountered.
-	inline uint jpeg_decoder::get_bits_no_markers(int num_bits)
-	{
-		if (!num_bits)
-			return 0;
-
-		uint i = m_bit_buf >> (32 - num_bits);
-
-		if ((m_bits_left -= num_bits) <= 0)
-		{
-			m_bit_buf <<= (num_bits += m_bits_left);
-
-			if ((m_in_buf_left < 2) || (m_pIn_buf_ofs[0] == 0xFF) || (m_pIn_buf_ofs[1] == 0xFF))
-			{
-				uint c1 = get_octet();
-				uint c2 = get_octet();
-				m_bit_buf |= (c1 << 8) | c2;
-			}
-			else
-			{
-				m_bit_buf |= ((uint)m_pIn_buf_ofs[0] << 8) | m_pIn_buf_ofs[1];
-				m_in_buf_left -= 2;
-				m_pIn_buf_ofs += 2;
-			}
-
-			m_bit_buf <<= -m_bits_left;
-
-			m_bits_left += 16;
-
-			JPGD_ASSERT(m_bits_left >= 0);
-		}
-		else
-			m_bit_buf <<= num_bits;
-
-		return i;
-	}
-
-	// Decodes a Huffman encoded symbol.
-	inline int jpeg_decoder::huff_decode(huff_tables *pH)
-	{
-		int symbol;
-
-		// Check first 8-bits: do we have a complete symbol?
-		if ((symbol = pH->look_up[m_bit_buf >> 24]) < 0)
-		{
-			// Decode more bits, use a tree traversal to find symbol.
-			int ofs = 23;
-			do
-			{
-				symbol = pH->tree[-(int)(symbol + ((m_bit_buf >> ofs) & 1))];
-				ofs--;
-			} while (symbol < 0);
-
-			get_bits_no_markers(8 + (23 - ofs));
-		}
-		else
-			get_bits_no_markers(pH->code_size[symbol]);
-
-		return symbol;
-	}
-
-	// Decodes a Huffman encoded symbol.
-	inline int jpeg_decoder::huff_decode(huff_tables *pH, int& extra_bits)
-	{
-		int symbol;
-
-		// Check first 8-bits: do we have a complete symbol?
-		if ((symbol = pH->look_up2[m_bit_buf >> 24]) < 0)
-		{
-			// Use a tree traversal to find symbol.
-			int ofs = 23;
-			do
-			{
-				symbol = pH->tree[-(int)(symbol + ((m_bit_buf >> ofs) & 1))];
-				ofs--;
-			} while (symbol < 0);
-
-			get_bits_no_markers(8 + (23 - ofs));
-
-			extra_bits = get_bits_no_markers(symbol & 0xF);
-		}
-		else
-		{
-			JPGD_ASSERT(((symbol >> 8) & 31) == pH->code_size[symbol & 255] + ((symbol & 0x8000) ? (symbol & 15) : 0));
-
-			if (symbol & 0x8000)
-			{
-				get_bits_no_markers((symbol >> 8) & 31);
-				extra_bits = symbol >> 16;
-			}
-			else
-			{
-				int code_size = (symbol >> 8) & 31;
-				int num_extra_bits = symbol & 0xF;
-				int bits = code_size + num_extra_bits;
-				if (bits <= (m_bits_left + 16))
-					extra_bits = get_bits_no_markers(bits) & ((1 << num_extra_bits) - 1);
-				else
-				{
-					get_bits_no_markers(code_size);
-					extra_bits = get_bits_no_markers(num_extra_bits);
-				}
-			}
-
-			symbol &= 0xFF;
-		}
-
-		return symbol;
-	}
-
-	// Tables and macro used to fully decode the DPCM differences.
-	static const int s_extend_test[16] = { 0, 0x0001, 0x0002, 0x0004, 0x0008, 0x0010, 0x0020, 0x0040, 0x0080, 0x0100, 0x0200, 0x0400, 0x0800, 0x1000, 0x2000, 0x4000 };
-	static const int s_extend_offset[16] = { 0, -1, -3, -7, -15, -31, -63, -127, -255, -511, -1023, -2047, -4095, -8191, -16383, -32767 };
-	static const int s_extend_mask[] = { 0, (1<<0), (1<<1), (1<<2), (1<<3), (1<<4), (1<<5), (1<<6), (1<<7), (1<<8), (1<<9), (1<<10), (1<<11), (1<<12), (1<<13), (1<<14), (1<<15), (1<<16) };
-#define HUFF_EXTEND(x,s) ((x) < s_extend_test[s] ? (x) + s_extend_offset[s] : (x))
-
-	// Clamps a value between 0-255.
-	inline uint8 jpeg_decoder::clamp(int i)
-	{
-		if (static_cast<uint>(i) > 255)
-			i = (((~i) >> 31) & 0xFF);
-
-		return static_cast<uint8>(i);
-	}
-
-	namespace DCT_Upsample
-	{
-		struct Matrix44
-		{
-			typedef int Element_Type;
-			enum { NUM_ROWS = 4, NUM_COLS = 4 };
-
-			Element_Type v[NUM_ROWS][NUM_COLS];
-
-			inline int rows() const { return NUM_ROWS; }
-			inline int cols() const { return NUM_COLS; }
-
-			inline const Element_Type & at(int r, int c) const { return v[r][c]; }
-			inline       Element_Type & at(int r, int c)       { return v[r][c]; }
-
-			inline Matrix44() { }
-
-			inline Matrix44& operator += (const Matrix44& a)
-			{
-				for (int r = 0; r < NUM_ROWS; r++)
-				{
-					at(r, 0) += a.at(r, 0);
-					at(r, 1) += a.at(r, 1);
-					at(r, 2) += a.at(r, 2);
-					at(r, 3) += a.at(r, 3);
-				}
-				return *this;
-			}
-
-			inline Matrix44& operator -= (const Matrix44& a)
-			{
-				for (int r = 0; r < NUM_ROWS; r++)
-				{
-					at(r, 0) -= a.at(r, 0);
-					at(r, 1) -= a.at(r, 1);
-					at(r, 2) -= a.at(r, 2);
-					at(r, 3) -= a.at(r, 3);
-				}
-				return *this;
-			}
-
-			friend inline Matrix44 operator + (const Matrix44& a, const Matrix44& b)
-			{
-				Matrix44 ret;
-				for (int r = 0; r < NUM_ROWS; r++)
-				{
-					ret.at(r, 0) = a.at(r, 0) + b.at(r, 0);
-					ret.at(r, 1) = a.at(r, 1) + b.at(r, 1);
-					ret.at(r, 2) = a.at(r, 2) + b.at(r, 2);
-					ret.at(r, 3) = a.at(r, 3) + b.at(r, 3);
-				}
-				return ret;
-			}
-
-			friend inline Matrix44 operator - (const Matrix44& a, const Matrix44& b)
-			{
-				Matrix44 ret;
-				for (int r = 0; r < NUM_ROWS; r++)
-				{
-					ret.at(r, 0) = a.at(r, 0) - b.at(r, 0);
-					ret.at(r, 1) = a.at(r, 1) - b.at(r, 1);
-					ret.at(r, 2) = a.at(r, 2) - b.at(r, 2);
-					ret.at(r, 3) = a.at(r, 3) - b.at(r, 3);
-				}
-				return ret;
-			}
-
-			static inline void add_and_store(jpgd_block_t* pDst, const Matrix44& a, const Matrix44& b)
-			{
-				for (int r = 0; r < 4; r++)
-				{
-					pDst[0*8 + r] = static_cast<jpgd_block_t>(a.at(r, 0) + b.at(r, 0));
-					pDst[1*8 + r] = static_cast<jpgd_block_t>(a.at(r, 1) + b.at(r, 1));
-					pDst[2*8 + r] = static_cast<jpgd_block_t>(a.at(r, 2) + b.at(r, 2));
-					pDst[3*8 + r] = static_cast<jpgd_block_t>(a.at(r, 3) + b.at(r, 3));
-				}
-			}
-
-			static inline void sub_and_store(jpgd_block_t* pDst, const Matrix44& a, const Matrix44& b)
-			{
-				for (int r = 0; r < 4; r++)
-				{
-					pDst[0*8 + r] = static_cast<jpgd_block_t>(a.at(r, 0) - b.at(r, 0));
-					pDst[1*8 + r] = static_cast<jpgd_block_t>(a.at(r, 1) - b.at(r, 1));
-					pDst[2*8 + r] = static_cast<jpgd_block_t>(a.at(r, 2) - b.at(r, 2));
-					pDst[3*8 + r] = static_cast<jpgd_block_t>(a.at(r, 3) - b.at(r, 3));
-				}
-			}
-		};
-
-		const int FRACT_BITS = 10;
-		const int SCALE = 1 << FRACT_BITS;
-
-		typedef int Temp_Type;
-#define D(i) (((i) + (SCALE >> 1)) >> FRACT_BITS)
-#define F(i) ((int)((i) * SCALE + .5f))
-
-		// Any decent C++ compiler will optimize this at compile time to a 0, or an array access.
-#define AT(c, r) ((((c)>=NUM_COLS)||((r)>=NUM_ROWS)) ? 0 : pSrc[(c)+(r)*8])
-
-		// NUM_ROWS/NUM_COLS = # of non-zero rows/cols in input matrix
-		template<int NUM_ROWS, int NUM_COLS>
-		struct P_Q
-		{
-			static void calc(Matrix44& P, Matrix44& Q, const jpgd_block_t* pSrc)
-			{
-				// 4x8 = 4x8 times 8x8, matrix 0 is constant
-				const Temp_Type X000 = AT(0, 0);
-				const Temp_Type X001 = AT(0, 1);
-				const Temp_Type X002 = AT(0, 2);
-				const Temp_Type X003 = AT(0, 3);
-				const Temp_Type X004 = AT(0, 4);
-				const Temp_Type X005 = AT(0, 5);
-				const Temp_Type X006 = AT(0, 6);
-				const Temp_Type X007 = AT(0, 7);
-				const Temp_Type X010 = D(F(0.415735f) * AT(1, 0) + F(0.791065f) * AT(3, 0) + F(-0.352443f) * AT(5, 0) + F(0.277785f) * AT(7, 0));
-				const Temp_Type X011 = D(F(0.415735f) * AT(1, 1) + F(0.791065f) * AT(3, 1) + F(-0.352443f) * AT(5, 1) + F(0.277785f) * AT(7, 1));
-				const Temp_Type X012 = D(F(0.415735f) * AT(1, 2) + F(0.791065f) * AT(3, 2) + F(-0.352443f) * AT(5, 2) + F(0.277785f) * AT(7, 2));
-				const Temp_Type X013 = D(F(0.415735f) * AT(1, 3) + F(0.791065f) * AT(3, 3) + F(-0.352443f) * AT(5, 3) + F(0.277785f) * AT(7, 3));
-				const Temp_Type X014 = D(F(0.415735f) * AT(1, 4) + F(0.791065f) * AT(3, 4) + F(-0.352443f) * AT(5, 4) + F(0.277785f) * AT(7, 4));
-				const Temp_Type X015 = D(F(0.415735f) * AT(1, 5) + F(0.791065f) * AT(3, 5) + F(-0.352443f) * AT(5, 5) + F(0.277785f) * AT(7, 5));
-				const Temp_Type X016 = D(F(0.415735f) * AT(1, 6) + F(0.791065f) * AT(3, 6) + F(-0.352443f) * AT(5, 6) + F(0.277785f) * AT(7, 6));
-				const Temp_Type X017 = D(F(0.415735f) * AT(1, 7) + F(0.791065f) * AT(3, 7) + F(-0.352443f) * AT(5, 7) + F(0.277785f) * AT(7, 7));
-				const Temp_Type X020 = AT(4, 0);
-				const Temp_Type X021 = AT(4, 1);
-				const Temp_Type X022 = AT(4, 2);
-				const Temp_Type X023 = AT(4, 3);
-				const Temp_Type X024 = AT(4, 4);
-				const Temp_Type X025 = AT(4, 5);
-				const Temp_Type X026 = AT(4, 6);
-				const Temp_Type X027 = AT(4, 7);
-				const Temp_Type X030 = D(F(0.022887f) * AT(1, 0) + F(-0.097545f) * AT(3, 0) + F(0.490393f) * AT(5, 0) + F(0.865723f) * AT(7, 0));
-				const Temp_Type X031 = D(F(0.022887f) * AT(1, 1) + F(-0.097545f) * AT(3, 1) + F(0.490393f) * AT(5, 1) + F(0.865723f) * AT(7, 1));
-				const Temp_Type X032 = D(F(0.022887f) * AT(1, 2) + F(-0.097545f) * AT(3, 2) + F(0.490393f) * AT(5, 2) + F(0.865723f) * AT(7, 2));
-				const Temp_Type X033 = D(F(0.022887f) * AT(1, 3) + F(-0.097545f) * AT(3, 3) + F(0.490393f) * AT(5, 3) + F(0.865723f) * AT(7, 3));
-				const Temp_Type X034 = D(F(0.022887f) * AT(1, 4) + F(-0.097545f) * AT(3, 4) + F(0.490393f) * AT(5, 4) + F(0.865723f) * AT(7, 4));
-				const Temp_Type X035 = D(F(0.022887f) * AT(1, 5) + F(-0.097545f) * AT(3, 5) + F(0.490393f) * AT(5, 5) + F(0.865723f) * AT(7, 5));
-				const Temp_Type X036 = D(F(0.022887f) * AT(1, 6) + F(-0.097545f) * AT(3, 6) + F(0.490393f) * AT(5, 6) + F(0.865723f) * AT(7, 6));
-				const Temp_Type X037 = D(F(0.022887f) * AT(1, 7) + F(-0.097545f) * AT(3, 7) + F(0.490393f) * AT(5, 7) + F(0.865723f) * AT(7, 7));
-
-				// 4x4 = 4x8 times 8x4, matrix 1 is constant
-				P.at(0, 0) = X000;
-				P.at(0, 1) = D(X001 * F(0.415735f) + X003 * F(0.791065f) + X005 * F(-0.352443f) + X007 * F(0.277785f));
-				P.at(0, 2) = X004;
-				P.at(0, 3) = D(X001 * F(0.022887f) + X003 * F(-0.097545f) + X005 * F(0.490393f) + X007 * F(0.865723f));
-				P.at(1, 0) = X010;
-				P.at(1, 1) = D(X011 * F(0.415735f) + X013 * F(0.791065f) + X015 * F(-0.352443f) + X017 * F(0.277785f));
-				P.at(1, 2) = X014;
-				P.at(1, 3) = D(X011 * F(0.022887f) + X013 * F(-0.097545f) + X015 * F(0.490393f) + X017 * F(0.865723f));
-				P.at(2, 0) = X020;
-				P.at(2, 1) = D(X021 * F(0.415735f) + X023 * F(0.791065f) + X025 * F(-0.352443f) + X027 * F(0.277785f));
-				P.at(2, 2) = X024;
-				P.at(2, 3) = D(X021 * F(0.022887f) + X023 * F(-0.097545f) + X025 * F(0.490393f) + X027 * F(0.865723f));
-				P.at(3, 0) = X030;
-				P.at(3, 1) = D(X031 * F(0.415735f) + X033 * F(0.791065f) + X035 * F(-0.352443f) + X037 * F(0.277785f));
-				P.at(3, 2) = X034;
-				P.at(3, 3) = D(X031 * F(0.022887f) + X033 * F(-0.097545f) + X035 * F(0.490393f) + X037 * F(0.865723f));
-				// 40 muls 24 adds
-
-				// 4x4 = 4x8 times 8x4, matrix 1 is constant
-				Q.at(0, 0) = D(X001 * F(0.906127f) + X003 * F(-0.318190f) + X005 * F(0.212608f) + X007 * F(-0.180240f));
-				Q.at(0, 1) = X002;
-				Q.at(0, 2) = D(X001 * F(-0.074658f) + X003 * F(0.513280f) + X005 * F(0.768178f) + X007 * F(-0.375330f));
-				Q.at(0, 3) = X006;
-				Q.at(1, 0) = D(X011 * F(0.906127f) + X013 * F(-0.318190f) + X015 * F(0.212608f) + X017 * F(-0.180240f));
-				Q.at(1, 1) = X012;
-				Q.at(1, 2) = D(X011 * F(-0.074658f) + X013 * F(0.513280f) + X015 * F(0.768178f) + X017 * F(-0.375330f));
-				Q.at(1, 3) = X016;
-				Q.at(2, 0) = D(X021 * F(0.906127f) + X023 * F(-0.318190f) + X025 * F(0.212608f) + X027 * F(-0.180240f));
-				Q.at(2, 1) = X022;
-				Q.at(2, 2) = D(X021 * F(-0.074658f) + X023 * F(0.513280f) + X025 * F(0.768178f) + X027 * F(-0.375330f));
-				Q.at(2, 3) = X026;
-				Q.at(3, 0) = D(X031 * F(0.906127f) + X033 * F(-0.318190f) + X035 * F(0.212608f) + X037 * F(-0.180240f));
-				Q.at(3, 1) = X032;
-				Q.at(3, 2) = D(X031 * F(-0.074658f) + X033 * F(0.513280f) + X035 * F(0.768178f) + X037 * F(-0.375330f));
-				Q.at(3, 3) = X036;
-				// 40 muls 24 adds
-			}
-		};
-
-		template<int NUM_ROWS, int NUM_COLS>
-		struct R_S
-		{
-			static void calc(Matrix44& R, Matrix44& S, const jpgd_block_t* pSrc)
-			{
-				// 4x8 = 4x8 times 8x8, matrix 0 is constant
-				const Temp_Type X100 = D(F(0.906127f) * AT(1, 0) + F(-0.318190f) * AT(3, 0) + F(0.212608f) * AT(5, 0) + F(-0.180240f) * AT(7, 0));
-				const Temp_Type X101 = D(F(0.906127f) * AT(1, 1) + F(-0.318190f) * AT(3, 1) + F(0.212608f) * AT(5, 1) + F(-0.180240f) * AT(7, 1));
-				const Temp_Type X102 = D(F(0.906127f) * AT(1, 2) + F(-0.318190f) * AT(3, 2) + F(0.212608f) * AT(5, 2) + F(-0.180240f) * AT(7, 2));
-				const Temp_Type X103 = D(F(0.906127f) * AT(1, 3) + F(-0.318190f) * AT(3, 3) + F(0.212608f) * AT(5, 3) + F(-0.180240f) * AT(7, 3));
-				const Temp_Type X104 = D(F(0.906127f) * AT(1, 4) + F(-0.318190f) * AT(3, 4) + F(0.212608f) * AT(5, 4) + F(-0.180240f) * AT(7, 4));
-				const Temp_Type X105 = D(F(0.906127f) * AT(1, 5) + F(-0.318190f) * AT(3, 5) + F(0.212608f) * AT(5, 5) + F(-0.180240f) * AT(7, 5));
-				const Temp_Type X106 = D(F(0.906127f) * AT(1, 6) + F(-0.318190f) * AT(3, 6) + F(0.212608f) * AT(5, 6) + F(-0.180240f) * AT(7, 6));
-				const Temp_Type X107 = D(F(0.906127f) * AT(1, 7) + F(-0.318190f) * AT(3, 7) + F(0.212608f) * AT(5, 7) + F(-0.180240f) * AT(7, 7));
-				const Temp_Type X110 = AT(2, 0);
-				const Temp_Type X111 = AT(2, 1);
-				const Temp_Type X112 = AT(2, 2);
-				const Temp_Type X113 = AT(2, 3);
-				const Temp_Type X114 = AT(2, 4);
-				const Temp_Type X115 = AT(2, 5);
-				const Temp_Type X116 = AT(2, 6);
-				const Temp_Type X117 = AT(2, 7);
-				const Temp_Type X120 = D(F(-0.074658f) * AT(1, 0) + F(0.513280f) * AT(3, 0) + F(0.768178f) * AT(5, 0) + F(-0.375330f) * AT(7, 0));
-				const Temp_Type X121 = D(F(-0.074658f) * AT(1, 1) + F(0.513280f) * AT(3, 1) + F(0.768178f) * AT(5, 1) + F(-0.375330f) * AT(7, 1));
-				const Temp_Type X122 = D(F(-0.074658f) * AT(1, 2) + F(0.513280f) * AT(3, 2) + F(0.768178f) * AT(5, 2) + F(-0.375330f) * AT(7, 2));
-				const Temp_Type X123 = D(F(-0.074658f) * AT(1, 3) + F(0.513280f) * AT(3, 3) + F(0.768178f) * AT(5, 3) + F(-0.375330f) * AT(7, 3));
-				const Temp_Type X124 = D(F(-0.074658f) * AT(1, 4) + F(0.513280f) * AT(3, 4) + F(0.768178f) * AT(5, 4) + F(-0.375330f) * AT(7, 4));
-				const Temp_Type X125 = D(F(-0.074658f) * AT(1, 5) + F(0.513280f) * AT(3, 5) + F(0.768178f) * AT(5, 5) + F(-0.375330f) * AT(7, 5));
-				const Temp_Type X126 = D(F(-0.074658f) * AT(1, 6) + F(0.513280f) * AT(3, 6) + F(0.768178f) * AT(5, 6) + F(-0.375330f) * AT(7, 6));
-				const Temp_Type X127 = D(F(-0.074658f) * AT(1, 7) + F(0.513280f) * AT(3, 7) + F(0.768178f) * AT(5, 7) + F(-0.375330f) * AT(7, 7));
-				const Temp_Type X130 = AT(6, 0);
-				const Temp_Type X131 = AT(6, 1);
-				const Temp_Type X132 = AT(6, 2);
-				const Temp_Type X133 = AT(6, 3);
-				const Temp_Type X134 = AT(6, 4);
-				const Temp_Type X135 = AT(6, 5);
-				const Temp_Type X136 = AT(6, 6);
-				const Temp_Type X137 = AT(6, 7);
-				// 80 muls 48 adds
-
-				// 4x4 = 4x8 times 8x4, matrix 1 is constant
-				R.at(0, 0) = X100;
-				R.at(0, 1) = D(X101 * F(0.415735f) + X103 * F(0.791065f) + X105 * F(-0.352443f) + X107 * F(0.277785f));
-				R.at(0, 2) = X104;
-				R.at(0, 3) = D(X101 * F(0.022887f) + X103 * F(-0.097545f) + X105 * F(0.490393f) + X107 * F(0.865723f));
-				R.at(1, 0) = X110;
-				R.at(1, 1) = D(X111 * F(0.415735f) + X113 * F(0.791065f) + X115 * F(-0.352443f) + X117 * F(0.277785f));
-				R.at(1, 2) = X114;
-				R.at(1, 3) = D(X111 * F(0.022887f) + X113 * F(-0.097545f) + X115 * F(0.490393f) + X117 * F(0.865723f));
-				R.at(2, 0) = X120;
-				R.at(2, 1) = D(X121 * F(0.415735f) + X123 * F(0.791065f) + X125 * F(-0.352443f) + X127 * F(0.277785f));
-				R.at(2, 2) = X124;
-				R.at(2, 3) = D(X121 * F(0.022887f) + X123 * F(-0.097545f) + X125 * F(0.490393f) + X127 * F(0.865723f));
-				R.at(3, 0) = X130;
-				R.at(3, 1) = D(X131 * F(0.415735f) + X133 * F(0.791065f) + X135 * F(-0.352443f) + X137 * F(0.277785f));
-				R.at(3, 2) = X134;
-				R.at(3, 3) = D(X131 * F(0.022887f) + X133 * F(-0.097545f) + X135 * F(0.490393f) + X137 * F(0.865723f));
-				// 40 muls 24 adds
-				// 4x4 = 4x8 times 8x4, matrix 1 is constant
-				S.at(0, 0) = D(X101 * F(0.906127f) + X103 * F(-0.318190f) + X105 * F(0.212608f) + X107 * F(-0.180240f));
-				S.at(0, 1) = X102;
-				S.at(0, 2) = D(X101 * F(-0.074658f) + X103 * F(0.513280f) + X105 * F(0.768178f) + X107 * F(-0.375330f));
-				S.at(0, 3) = X106;
-				S.at(1, 0) = D(X111 * F(0.906127f) + X113 * F(-0.318190f) + X115 * F(0.212608f) + X117 * F(-0.180240f));
-				S.at(1, 1) = X112;
-				S.at(1, 2) = D(X111 * F(-0.074658f) + X113 * F(0.513280f) + X115 * F(0.768178f) + X117 * F(-0.375330f));
-				S.at(1, 3) = X116;
-				S.at(2, 0) = D(X121 * F(0.906127f) + X123 * F(-0.318190f) + X125 * F(0.212608f) + X127 * F(-0.180240f));
-				S.at(2, 1) = X122;
-				S.at(2, 2) = D(X121 * F(-0.074658f) + X123 * F(0.513280f) + X125 * F(0.768178f) + X127 * F(-0.375330f));
-				S.at(2, 3) = X126;
-				S.at(3, 0) = D(X131 * F(0.906127f) + X133 * F(-0.318190f) + X135 * F(0.212608f) + X137 * F(-0.180240f));
-				S.at(3, 1) = X132;
-				S.at(3, 2) = D(X131 * F(-0.074658f) + X133 * F(0.513280f) + X135 * F(0.768178f) + X137 * F(-0.375330f));
-				S.at(3, 3) = X136;
-				// 40 muls 24 adds
-			}
-		};
-	} // end namespace DCT_Upsample
-
-	// Unconditionally frees all allocated m_blocks.
-	void jpeg_decoder::free_all_blocks()
-	{
-		m_pStream = NULL;
-		for (mem_block *b = m_pMem_blocks; b; )
-		{
-			mem_block *n = b->m_pNext;
-			jpgd_free(b);
-			b = n;
-		}
-		m_pMem_blocks = NULL;
-	}
-
-	// This method handles all errors.
-	// It could easily be changed to use C++ exceptions.
-	void jpeg_decoder::stop_decoding(jpgd_status status)
-	{
-		m_error_code = status;
-		free_all_blocks();
-		longjmp(m_jmp_state, status);
-
-		// we shouldn't get here as longjmp shouldn't return, but we put it here to make it explicit
-		// that this function doesn't return, otherwise we get this error:
-		// 
-		// error : function declared 'noreturn' should not return
-		exit(1);
-	}
-
-	void *jpeg_decoder::alloc(size_t nSize, bool zero)
-	{
-		nSize = (JPGD_MAX(nSize, 1) + 3) & ~3;
-		char *rv = NULL;
-		for (mem_block *b = m_pMem_blocks; b; b = b->m_pNext)
-		{
-			if ((b->m_used_count + nSize) <= b->m_size)
-			{
-				rv = b->m_data + b->m_used_count;
-				b->m_used_count += nSize;
-				break;
-			}
-		}
-		if (!rv)
-		{
-			int capacity = JPGD_MAX(32768 - 256, (nSize + 2047) & ~2047);
-			mem_block *b = (mem_block*)jpgd_malloc(sizeof(mem_block) + capacity);
-			if (!b) stop_decoding(JPGD_NOTENOUGHMEM);
-			b->m_pNext = m_pMem_blocks; m_pMem_blocks = b;
-			b->m_used_count = nSize;
-			b->m_size = capacity;
-			rv = b->m_data;
-		}
-		if (zero) memset(rv, 0, nSize);
-		return rv;
-	}
-
-	void jpeg_decoder::word_clear(void *p, uint16 c, uint n)
-	{
-		uint8 *pD = (uint8*)p;
-		const uint8 l = c & 0xFF, h = (c >> 8) & 0xFF;
-		while (n)
-		{
-			pD[0] = l; pD[1] = h; pD += 2;
-			n--;
-		}
-	}
-
-	// Refill the input buffer.
-	// This method will sit in a loop until (A) the buffer is full or (B)
-	// the stream's read() method reports and end of file condition.
-	void jpeg_decoder::prep_in_buffer()
-	{
-		m_in_buf_left = 0;
-		m_pIn_buf_ofs = m_in_buf;
-
-		if (m_eof_flag)
-			return;
-
-		do
-		{
-			int bytes_read = m_pStream->read(m_in_buf + m_in_buf_left, JPGD_IN_BUF_SIZE - m_in_buf_left, &m_eof_flag);
-			if (bytes_read == -1)
-				stop_decoding(JPGD_STREAM_READ);
-
-			m_in_buf_left += bytes_read;
-		} while ((m_in_buf_left < JPGD_IN_BUF_SIZE) && (!m_eof_flag));
-
-		m_total_bytes_read += m_in_buf_left;
-
-		// Pad the end of the block with M_EOI (prevents the decompressor from going off the rails if the stream is invalid).
-		// (This dates way back to when this decompressor was written in C/asm, and the all-asm Huffman decoder did some fancy things to increase perf.)
-		word_clear(m_pIn_buf_ofs + m_in_buf_left, 0xD9FF, 64);
-	}
-
-	// Read a Huffman code table.
-	void jpeg_decoder::read_dht_marker()
-	{
-		int i, index, count;
-		uint8 huff_num[17];
-		uint8 huff_val[256];
-
-		uint num_left = get_bits(16);
-
-		if (num_left < 2)
-			stop_decoding(JPGD_BAD_DHT_MARKER);
-
-		num_left -= 2;
-
-		while (num_left)
-		{
-			index = get_bits(8);
-
-			huff_num[0] = 0;
-
-			count = 0;
-
-			for (i = 1; i <= 16; i++)
-			{
-				huff_num[i] = static_cast<uint8>(get_bits(8));
-				count += huff_num[i];
-			}
-
-			if (count > 255)
-				stop_decoding(JPGD_BAD_DHT_COUNTS);
-
-			for (i = 0; i < count; i++)
-				huff_val[i] = static_cast<uint8>(get_bits(8));
-
-			i = 1 + 16 + count;
-
-			if (num_left < (uint)i)
-				stop_decoding(JPGD_BAD_DHT_MARKER);
-
-			num_left -= i;
-
-			if ((index & 0x10) > 0x10)
-				stop_decoding(JPGD_BAD_DHT_INDEX);
-
-			index = (index & 0x0F) + ((index & 0x10) >> 4) * (JPGD_MAX_HUFF_TABLES >> 1);
-
-			if (index >= JPGD_MAX_HUFF_TABLES)
-				stop_decoding(JPGD_BAD_DHT_INDEX);
-
-			if (!m_huff_num[index])
-				m_huff_num[index] = (uint8 *)alloc(17);
-
-			if (!m_huff_val[index])
-				m_huff_val[index] = (uint8 *)alloc(256);
-
-			m_huff_ac[index] = (index & 0x10) != 0;
-			memcpy(m_huff_num[index], huff_num, 17);
-			memcpy(m_huff_val[index], huff_val, 256);
-		}
-	}
-
-	// Read a quantization table.
-	void jpeg_decoder::read_dqt_marker()
-	{
-		int n, i, prec;
-		uint num_left;
-		uint temp;
-
-		num_left = get_bits(16);
-
-		if (num_left < 2)
-			stop_decoding(JPGD_BAD_DQT_MARKER);
-
-		num_left -= 2;
-
-		while (num_left)
-		{
-			n = get_bits(8);
-			prec = n >> 4;
-			n &= 0x0F;
-
-			if (n >= JPGD_MAX_QUANT_TABLES)
-				stop_decoding(JPGD_BAD_DQT_TABLE);
-
-			if (!m_quant[n])
-				m_quant[n] = (jpgd_quant_t *)alloc(64 * sizeof(jpgd_quant_t));
-
-			// read quantization entries, in zag order
-			for (i = 0; i < 64; i++)
-			{
-				temp = get_bits(8);
-
-				if (prec)
-					temp = (temp << 8) + get_bits(8);
-
-				m_quant[n][i] = static_cast<jpgd_quant_t>(temp);
-			}
-
-			i = 64 + 1;
-
-			if (prec)
-				i += 64;
-
-			if (num_left < (uint)i)
-				stop_decoding(JPGD_BAD_DQT_LENGTH);
-
-			num_left -= i;
-		}
-	}
-
-	// Read the start of frame (SOF) marker.
-	void jpeg_decoder::read_sof_marker()
-	{
-		int i;
-		uint num_left;
-
-		num_left = get_bits(16);
-
-		if (get_bits(8) != 8)   /* precision: sorry, only 8-bit precision is supported right now */
-			stop_decoding(JPGD_BAD_PRECISION);
-
-		m_image_y_size = get_bits(16);
-
-		if ((m_image_y_size < 1) || (m_image_y_size > JPGD_MAX_HEIGHT))
-			stop_decoding(JPGD_BAD_HEIGHT);
-
-		m_image_x_size = get_bits(16);
-
-		if ((m_image_x_size < 1) || (m_image_x_size > JPGD_MAX_WIDTH))
-			stop_decoding(JPGD_BAD_WIDTH);
-
-		m_comps_in_frame = get_bits(8);
-
-		if (m_comps_in_frame > JPGD_MAX_COMPONENTS)
-			stop_decoding(JPGD_TOO_MANY_COMPONENTS);
-
-		if (num_left != (uint)(m_comps_in_frame * 3 + 8))
-			stop_decoding(JPGD_BAD_SOF_LENGTH);
-
-		for (i = 0; i < m_comps_in_frame; i++)
-		{
-			m_comp_ident[i]  = get_bits(8);
-			m_comp_h_samp[i] = get_bits(4);
-			m_comp_v_samp[i] = get_bits(4);
-			m_comp_quant[i]  = get_bits(8);
-		}
-	}
-
-	// Used to skip unrecognized markers.
-	void jpeg_decoder::skip_variable_marker()
-	{
-		uint num_left;
-
-		num_left = get_bits(16);
-
-		if (num_left < 2)
-			stop_decoding(JPGD_BAD_VARIABLE_MARKER);
-
-		num_left -= 2;
-
-		while (num_left)
-		{
-			get_bits(8);
-			num_left--;
-		}
-	}
-
-	// Read a define restart interval (DRI) marker.
-	void jpeg_decoder::read_dri_marker()
-	{
-		if (get_bits(16) != 4)
-			stop_decoding(JPGD_BAD_DRI_LENGTH);
-
-		m_restart_interval = get_bits(16);
-	}
-
-	// Read a start of scan (SOS) marker.
-	void jpeg_decoder::read_sos_marker()
-	{
-		uint num_left;
-		int i, ci, n, c, cc;
-
-		num_left = get_bits(16);
-
-		n = get_bits(8);
-
-		m_comps_in_scan = n;
-
-		num_left -= 3;
-
-		if ( (num_left != (uint)(n * 2 + 3)) || (n < 1) || (n > JPGD_MAX_COMPS_IN_SCAN) )
-			stop_decoding(JPGD_BAD_SOS_LENGTH);
-
-		for (i = 0; i < n; i++)
-		{
-			cc = get_bits(8);
-			c = get_bits(8);
-			num_left -= 2;
-
-			for (ci = 0; ci < m_comps_in_frame; ci++)
-				if (cc == m_comp_ident[ci])
-					break;
-
-			if (ci >= m_comps_in_frame)
-				stop_decoding(JPGD_BAD_SOS_COMP_ID);
-
-			m_comp_list[i]    = ci;
-			m_comp_dc_tab[ci] = (c >> 4) & 15;
-			m_comp_ac_tab[ci] = (c & 15) + (JPGD_MAX_HUFF_TABLES >> 1);
-		}
-
-		m_spectral_start  = get_bits(8);
-		m_spectral_end    = get_bits(8);
-		m_successive_high = get_bits(4);
-		m_successive_low  = get_bits(4);
-
-		if (!m_progressive_flag)
-		{
-			m_spectral_start = 0;
-			m_spectral_end = 63;
-		}
-
-		num_left -= 3;
-
-		while (num_left)                  /* read past whatever is num_left */
-		{
-			get_bits(8);
-			num_left--;
-		}
-	}
-
-	// Finds the next marker.
-	int jpeg_decoder::next_marker()
-	{
-		uint c, bytes;
-
-		bytes = 0;
-
-		do
-		{
-			do
-			{
-				bytes++;
-				c = get_bits(8);
-			} while (c != 0xFF);
-
-			do
-			{
-				c = get_bits(8);
-			} while (c == 0xFF);
-
-		} while (c == 0);
-
-		// If bytes > 0 here, there where extra bytes before the marker (not good).
-
-		return c;
-	}
-
-	// Process markers. Returns when an SOFx, SOI, EOI, or SOS marker is
-	// encountered.
-	int jpeg_decoder::process_markers()
-	{
-		int c;
-
-		for ( ; ; )
-		{
-			c = next_marker();
-
-			switch (c)
-			{
-			case M_SOF0:
-			case M_SOF1:
-			case M_SOF2:
-			case M_SOF3:
-			case M_SOF5:
-			case M_SOF6:
-			case M_SOF7:
-				//      case M_JPG:
-			case M_SOF9:
-			case M_SOF10:
-			case M_SOF11:
-			case M_SOF13:
-			case M_SOF14:
-			case M_SOF15:
-			case M_SOI:
-			case M_EOI:
-			case M_SOS:
-				{
-					return c;
-				}
-			case M_DHT:
-				{
-					read_dht_marker();
-					break;
-				}
-				// No arithmitic support - dumb patents!
-			case M_DAC:
-				{
-					stop_decoding(JPGD_NO_ARITHMITIC_SUPPORT);
-					break;
-				}
-			case M_DQT:
-				{
-					read_dqt_marker();
-					break;
-				}
-			case M_DRI:
-				{
-					read_dri_marker();
-					break;
-				}
-				//case M_APP0:  /* no need to read the JFIF marker */
-
-			case M_JPG:
-			case M_RST0:    /* no parameters */
-			case M_RST1:
-			case M_RST2:
-			case M_RST3:
-			case M_RST4:
-			case M_RST5:
-			case M_RST6:
-			case M_RST7:
-			case M_TEM:
-				{
-					stop_decoding(JPGD_UNEXPECTED_MARKER);
-					break;
-				}
-			default:    /* must be DNL, DHP, EXP, APPn, JPGn, COM, or RESn or APP0 */
-				{
-					skip_variable_marker();
-					break;
-				}
-			}
-		}
-	}
-
-	// Finds the start of image (SOI) marker.
-	// This code is rather defensive: it only checks the first 512 bytes to avoid
-	// false positives.
-	void jpeg_decoder::locate_soi_marker()
-	{
-		uint lastchar, thischar;
-		uint bytesleft;
-
-		lastchar = get_bits(8);
-
-		thischar = get_bits(8);
-
-		/* ok if it's a normal JPEG file without a special header */
-
-		if ((lastchar == 0xFF) && (thischar == M_SOI))
-			return;
-
-		bytesleft = 4096; //512;
-
-		for ( ; ; )
-		{
-			if (--bytesleft == 0)
-				stop_decoding(JPGD_NOT_JPEG);
-
-			lastchar = thischar;
-
-			thischar = get_bits(8);
-
-			if (lastchar == 0xFF)
-			{
-				if (thischar == M_SOI)
-					break;
-				else if (thischar == M_EOI) // get_bits will keep returning M_EOI if we read past the end
-					stop_decoding(JPGD_NOT_JPEG);
-			}
-		}
-
-		// Check the next character after marker: if it's not 0xFF, it can't be the start of the next marker, so the file is bad.
-		thischar = (m_bit_buf >> 24) & 0xFF;
-
-		if (thischar != 0xFF)
-			stop_decoding(JPGD_NOT_JPEG);
-	}
-
-	// Find a start of frame (SOF) marker.
-	void jpeg_decoder::locate_sof_marker()
-	{
-		locate_soi_marker();
-
-		int c = process_markers();
-
-		switch (c)
-		{
-		case M_SOF2:
-			m_progressive_flag = JPGD_TRUE;
-		case M_SOF0:  /* baseline DCT */
-		case M_SOF1:  /* extended sequential DCT */
-			{
-				read_sof_marker();
-				break;
-			}
-		case M_SOF9:  /* Arithmitic coding */
-			{
-				stop_decoding(JPGD_NO_ARITHMITIC_SUPPORT);
-				break;
-			}
-		default:
-			{
-				stop_decoding(JPGD_UNSUPPORTED_MARKER);
-				break;
-			}
-		}
-	}
-
-	// Find a start of scan (SOS) marker.
-	int jpeg_decoder::locate_sos_marker()
-	{
-		int c;
-
-		c = process_markers();
-
-		if (c == M_EOI)
-			return JPGD_FALSE;
-		else if (c != M_SOS)
-			stop_decoding(JPGD_UNEXPECTED_MARKER);
-
-		read_sos_marker();
-
-		return JPGD_TRUE;
-	}
-
-	// Reset everything to default/uninitialized state.
-	void jpeg_decoder::init(jpeg_decoder_stream *pStream)
-	{
-		m_pMem_blocks = NULL;
-		m_error_code = JPGD_SUCCESS;
-		m_ready_flag = false;
-		m_image_x_size = m_image_y_size = 0;
-		m_pStream = pStream;
-		m_progressive_flag = JPGD_FALSE;
-
-		memset(m_huff_ac, 0, sizeof(m_huff_ac));
-		memset(m_huff_num, 0, sizeof(m_huff_num));
-		memset(m_huff_val, 0, sizeof(m_huff_val));
-		memset(m_quant, 0, sizeof(m_quant));
-
-		m_scan_type = 0;
-		m_comps_in_frame = 0;
-
-		memset(m_comp_h_samp, 0, sizeof(m_comp_h_samp));
-		memset(m_comp_v_samp, 0, sizeof(m_comp_v_samp));
-		memset(m_comp_quant, 0, sizeof(m_comp_quant));
-		memset(m_comp_ident, 0, sizeof(m_comp_ident));
-		memset(m_comp_h_blocks, 0, sizeof(m_comp_h_blocks));
-		memset(m_comp_v_blocks, 0, sizeof(m_comp_v_blocks));
-
-		m_comps_in_scan = 0;
-		memset(m_comp_list, 0, sizeof(m_comp_list));
-		memset(m_comp_dc_tab, 0, sizeof(m_comp_dc_tab));
-		memset(m_comp_ac_tab, 0, sizeof(m_comp_ac_tab));
-
-		m_spectral_start = 0;
-		m_spectral_end = 0;
-		m_successive_low = 0;
-		m_successive_high = 0;
-		m_max_mcu_x_size = 0;
-		m_max_mcu_y_size = 0;
-		m_blocks_per_mcu = 0;
-		m_max_blocks_per_row = 0;
-		m_mcus_per_row = 0;
-		m_mcus_per_col = 0;
-		m_expanded_blocks_per_component = 0;
-		m_expanded_blocks_per_mcu = 0;
-		m_expanded_blocks_per_row = 0;
-		m_freq_domain_chroma_upsample = false;
-
-		memset(m_mcu_org, 0, sizeof(m_mcu_org));
-
-		m_total_lines_left = 0;
-		m_mcu_lines_left = 0;
-		m_real_dest_bytes_per_scan_line = 0;
-		m_dest_bytes_per_scan_line = 0;
-		m_dest_bytes_per_pixel = 0;
-
-		memset(m_pHuff_tabs, 0, sizeof(m_pHuff_tabs));
-
-		memset(m_dc_coeffs, 0, sizeof(m_dc_coeffs));
-		memset(m_ac_coeffs, 0, sizeof(m_ac_coeffs));
-		memset(m_block_y_mcu, 0, sizeof(m_block_y_mcu));
-
-		m_eob_run = 0;
-
-		memset(m_block_y_mcu, 0, sizeof(m_block_y_mcu));
-
-		m_pIn_buf_ofs = m_in_buf;
-		m_in_buf_left = 0;
-		m_eof_flag = false;
-		m_tem_flag = 0;
-
-		memset(m_in_buf_pad_start, 0, sizeof(m_in_buf_pad_start));
-		memset(m_in_buf, 0, sizeof(m_in_buf));
-		memset(m_in_buf_pad_end, 0, sizeof(m_in_buf_pad_end));
-
-		m_restart_interval = 0;
-		m_restarts_left    = 0;
-		m_next_restart_num = 0;
-
-		m_max_mcus_per_row = 0;
-		m_max_blocks_per_mcu = 0;
-		m_max_mcus_per_col = 0;
-
-		memset(m_last_dc_val, 0, sizeof(m_last_dc_val));
-		m_pMCU_coefficients = NULL;
-		m_pSample_buf = NULL;
-
-		m_total_bytes_read = 0;
-
-		m_pScan_line_0 = NULL;
-		m_pScan_line_1 = NULL;
-
-		// Ready the input buffer.
-		prep_in_buffer();
-
-		// Prime the bit buffer.
-		m_bits_left = 16;
-		m_bit_buf = 0;
-
-		get_bits(16);
-		get_bits(16);
-
-		for (int i = 0; i < JPGD_MAX_BLOCKS_PER_MCU; i++)
-			m_mcu_block_max_zag[i] = 64;
-	}
-
-#define SCALEBITS 16
-#define ONE_HALF  ((int) 1 << (SCALEBITS-1))
-#define FIX(x)    ((int) ((x) * (1L<<SCALEBITS) + 0.5f))
-
-	// Create a few tables that allow us to quickly convert YCbCr to RGB.
-	void jpeg_decoder::create_look_ups()
-	{
-		for (int i = 0; i <= 255; i++)
-		{
-			int k = i - 128;
-			m_crr[i] = ( FIX(1.40200f)  * k + ONE_HALF) >> SCALEBITS;
-			m_cbb[i] = ( FIX(1.77200f)  * k + ONE_HALF) >> SCALEBITS;
-			m_crg[i] = (-FIX(0.71414f)) * k;
-			m_cbg[i] = (-FIX(0.34414f)) * k + ONE_HALF;
-		}
-	}
-
-	// This method throws back into the stream any bytes that where read
-	// into the bit buffer during initial marker scanning.
-	void jpeg_decoder::fix_in_buffer()
-	{
-		// In case any 0xFF's where pulled into the buffer during marker scanning.
-		JPGD_ASSERT((m_bits_left & 7) == 0);
-
-		if (m_bits_left == 16)
-			stuff_char( (uint8)(m_bit_buf & 0xFF));
-
-		if (m_bits_left >= 8)
-			stuff_char( (uint8)((m_bit_buf >> 8) & 0xFF));
-
-		stuff_char((uint8)((m_bit_buf >> 16) & 0xFF));
-		stuff_char((uint8)((m_bit_buf >> 24) & 0xFF));
-
-		m_bits_left = 16;
-		get_bits_no_markers(16);
-		get_bits_no_markers(16);
-	}
-
-	void jpeg_decoder::transform_mcu(int mcu_row)
-	{
-		jpgd_block_t* pSrc_ptr = m_pMCU_coefficients;
-		uint8* pDst_ptr = m_pSample_buf + mcu_row * m_blocks_per_mcu * 64;
-
-		for (int mcu_block = 0; mcu_block < m_blocks_per_mcu; mcu_block++)
-		{
-			idct(pSrc_ptr, pDst_ptr, m_mcu_block_max_zag[mcu_block]);
-			pSrc_ptr += 64;
-			pDst_ptr += 64;
-		}
-	}
-
-	static const uint8 s_max_rc[64] =
-	{
-		17, 18, 34, 50, 50, 51, 52, 52, 52, 68, 84, 84, 84, 84, 85, 86, 86, 86, 86, 86,
-		102, 118, 118, 118, 118, 118, 118, 119, 120, 120, 120, 120, 120, 120, 120, 136,
-		136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136,
-		136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136
-	};
-
-	void jpeg_decoder::transform_mcu_expand(int mcu_row)
-	{
-		jpgd_block_t* pSrc_ptr = m_pMCU_coefficients;
-		uint8* pDst_ptr = m_pSample_buf + mcu_row * m_expanded_blocks_per_mcu * 64;
-
-		// Y IDCT
-		int mcu_block;
-		for (mcu_block = 0; mcu_block < m_expanded_blocks_per_component; mcu_block++)
-		{
-			idct(pSrc_ptr, pDst_ptr, m_mcu_block_max_zag[mcu_block]);
-			pSrc_ptr += 64;
-			pDst_ptr += 64;
-		}
-
-		// Chroma IDCT, with upsampling
-		jpgd_block_t temp_block[64];
-
-		for (int i = 0; i < 2; i++)
-		{
-			DCT_Upsample::Matrix44 P, Q, R, S;
-
-			JPGD_ASSERT(m_mcu_block_max_zag[mcu_block] >= 1);
-			JPGD_ASSERT(m_mcu_block_max_zag[mcu_block] <= 64);
-
-			switch (s_max_rc[m_mcu_block_max_zag[mcu_block++] - 1])
-			{
-			case 1*16+1:
-				DCT_Upsample::P_Q<1, 1>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<1, 1>::calc(R, S, pSrc_ptr);
-				break;
-			case 1*16+2:
-				DCT_Upsample::P_Q<1, 2>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<1, 2>::calc(R, S, pSrc_ptr);
-				break;
-			case 2*16+2:
-				DCT_Upsample::P_Q<2, 2>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<2, 2>::calc(R, S, pSrc_ptr);
-				break;
-			case 3*16+2:
-				DCT_Upsample::P_Q<3, 2>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<3, 2>::calc(R, S, pSrc_ptr);
-				break;
-			case 3*16+3:
-				DCT_Upsample::P_Q<3, 3>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<3, 3>::calc(R, S, pSrc_ptr);
-				break;
-			case 3*16+4:
-				DCT_Upsample::P_Q<3, 4>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<3, 4>::calc(R, S, pSrc_ptr);
-				break;
-			case 4*16+4:
-				DCT_Upsample::P_Q<4, 4>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<4, 4>::calc(R, S, pSrc_ptr);
-				break;
-			case 5*16+4:
-				DCT_Upsample::P_Q<5, 4>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<5, 4>::calc(R, S, pSrc_ptr);
-				break;
-			case 5*16+5:
-				DCT_Upsample::P_Q<5, 5>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<5, 5>::calc(R, S, pSrc_ptr);
-				break;
-			case 5*16+6:
-				DCT_Upsample::P_Q<5, 6>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<5, 6>::calc(R, S, pSrc_ptr);
-				break;
-			case 6*16+6:
-				DCT_Upsample::P_Q<6, 6>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<6, 6>::calc(R, S, pSrc_ptr);
-				break;
-			case 7*16+6:
-				DCT_Upsample::P_Q<7, 6>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<7, 6>::calc(R, S, pSrc_ptr);
-				break;
-			case 7*16+7:
-				DCT_Upsample::P_Q<7, 7>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<7, 7>::calc(R, S, pSrc_ptr);
-				break;
-			case 7*16+8:
-				DCT_Upsample::P_Q<7, 8>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<7, 8>::calc(R, S, pSrc_ptr);
-				break;
-			case 8*16+8:
-				DCT_Upsample::P_Q<8, 8>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<8, 8>::calc(R, S, pSrc_ptr);
-				break;
-			default:
-				JPGD_ASSERT(false);
-			}
-
-			DCT_Upsample::Matrix44 a(P + Q); P -= Q;
-			DCT_Upsample::Matrix44& b = P;
-			DCT_Upsample::Matrix44 c(R + S); R -= S;
-			DCT_Upsample::Matrix44& d = R;
-
-			DCT_Upsample::Matrix44::add_and_store(temp_block, a, c);
-			idct_4x4(temp_block, pDst_ptr);
-			pDst_ptr += 64;
-
-			DCT_Upsample::Matrix44::sub_and_store(temp_block, a, c);
-			idct_4x4(temp_block, pDst_ptr);
-			pDst_ptr += 64;
-
-			DCT_Upsample::Matrix44::add_and_store(temp_block, b, d);
-			idct_4x4(temp_block, pDst_ptr);
-			pDst_ptr += 64;
-
-			DCT_Upsample::Matrix44::sub_and_store(temp_block, b, d);
-			idct_4x4(temp_block, pDst_ptr);
-			pDst_ptr += 64;
-
-			pSrc_ptr += 64;
-		}
-	}
-
-	// Loads and dequantizes the next row of (already decoded) coefficients.
-	// Progressive images only.
-	void jpeg_decoder::load_next_row()
-	{
-		int i;
-		jpgd_block_t *p;
-		jpgd_quant_t *q;
-		int mcu_row, mcu_block, row_block = 0;
-		int component_num, component_id;
-		int block_x_mcu[JPGD_MAX_COMPONENTS];
-
-		memset(block_x_mcu, 0, JPGD_MAX_COMPONENTS * sizeof(int));
-
-		for (mcu_row = 0; mcu_row < m_mcus_per_row; mcu_row++)
-		{
-			int block_x_mcu_ofs = 0, block_y_mcu_ofs = 0;
-
-			for (mcu_block = 0; mcu_block < m_blocks_per_mcu; mcu_block++)
-			{
-				component_id = m_mcu_org[mcu_block];
-				q = m_quant[m_comp_quant[component_id]];
-
-				p = m_pMCU_coefficients + 64 * mcu_block;
-
-				jpgd_block_t* pAC = coeff_buf_getp(m_ac_coeffs[component_id], block_x_mcu[component_id] + block_x_mcu_ofs, m_block_y_mcu[component_id] + block_y_mcu_ofs);
-				jpgd_block_t* pDC = coeff_buf_getp(m_dc_coeffs[component_id], block_x_mcu[component_id] + block_x_mcu_ofs, m_block_y_mcu[component_id] + block_y_mcu_ofs);
-				p[0] = pDC[0];
-				memcpy(&p[1], &pAC[1], 63 * sizeof(jpgd_block_t));
-
-				for (i = 63; i > 0; i--)
-					if (p[g_ZAG[i]])
-						break;
-
-				m_mcu_block_max_zag[mcu_block] = i + 1;
-
-				for ( ; i >= 0; i--)
-					if (p[g_ZAG[i]])
-						p[g_ZAG[i]] = static_cast<jpgd_block_t>(p[g_ZAG[i]] * q[i]);
-
-				row_block++;
-
-				if (m_comps_in_scan == 1)
-					block_x_mcu[component_id]++;
-				else
-				{
-					if (++block_x_mcu_ofs == m_comp_h_samp[component_id])
-					{
-						block_x_mcu_ofs = 0;
-
-						if (++block_y_mcu_ofs == m_comp_v_samp[component_id])
-						{
-							block_y_mcu_ofs = 0;
-
-							block_x_mcu[component_id] += m_comp_h_samp[component_id];
-						}
-					}
-				}
-			}
-
-			if (m_freq_domain_chroma_upsample)
-				transform_mcu_expand(mcu_row);
-			else
-				transform_mcu(mcu_row);
-		}
-
-		if (m_comps_in_scan == 1)
-			m_block_y_mcu[m_comp_list[0]]++;
-		else
-		{
-			for (component_num = 0; component_num < m_comps_in_scan; component_num++)
-			{
-				component_id = m_comp_list[component_num];
-
-				m_block_y_mcu[component_id] += m_comp_v_samp[component_id];
-			}
-		}
-	}
-
-	// Restart interval processing.
-	void jpeg_decoder::process_restart()
-	{
-		int i;
-		int c = 0;
-
-		// Align to a byte boundry
-		// FIXME: Is this really necessary? get_bits_no_markers() never reads in markers!
-		//get_bits_no_markers(m_bits_left & 7);
-
-		// Let's scan a little bit to find the marker, but not _too_ far.
-		// 1536 is a "fudge factor" that determines how much to scan.
-		for (i = 1536; i > 0; i--)
-			if (get_char() == 0xFF)
-				break;
-
-		if (i == 0)
-			stop_decoding(JPGD_BAD_RESTART_MARKER);
-
-		for ( ; i > 0; i--)
-			if ((c = get_char()) != 0xFF)
-				break;
-
-		if (i == 0)
-			stop_decoding(JPGD_BAD_RESTART_MARKER);
-
-		// Is it the expected marker? If not, something bad happened.
-		if (c != (m_next_restart_num + M_RST0))
-			stop_decoding(JPGD_BAD_RESTART_MARKER);
-
-		// Reset each component's DC prediction values.
-		memset(&m_last_dc_val, 0, m_comps_in_frame * sizeof(uint));
-
-		m_eob_run = 0;
-
-		m_restarts_left = m_restart_interval;
-
-		m_next_restart_num = (m_next_restart_num + 1) & 7;
-
-		// Get the bit buffer going again...
-
-		m_bits_left = 16;
-		get_bits_no_markers(16);
-		get_bits_no_markers(16);
-	}
-
-	static inline int dequantize_ac(int c, int q) {	c *= q;	return c; }
-
-	// Decodes and dequantizes the next row of coefficients.
-	void jpeg_decoder::decode_next_row()
-	{
-		int row_block = 0;
-
-		for (int mcu_row = 0; mcu_row < m_mcus_per_row; mcu_row++)
-		{
-			if ((m_restart_interval) && (m_restarts_left == 0))
-				process_restart();
-
-			jpgd_block_t* p = m_pMCU_coefficients;
-			for (int mcu_block = 0; mcu_block < m_blocks_per_mcu; mcu_block++, p += 64)
-			{
-				int component_id = m_mcu_org[mcu_block];
-				jpgd_quant_t* q = m_quant[m_comp_quant[component_id]];
-
-				int r, s;
-				s = huff_decode(m_pHuff_tabs[m_comp_dc_tab[component_id]], r);
-				s = HUFF_EXTEND(r, s);
-
-				m_last_dc_val[component_id] = (s += m_last_dc_val[component_id]);
-
-				p[0] = static_cast<jpgd_block_t>(s * q[0]);
-
-				int prev_num_set = m_mcu_block_max_zag[mcu_block];
-
-				huff_tables *pH = m_pHuff_tabs[m_comp_ac_tab[component_id]];
-
-				int k;
-				for (k = 1; k < 64; k++)
-				{
-					int extra_bits;
-					s = huff_decode(pH, extra_bits);
-
-					r = s >> 4;
-					s &= 15;
-
-					if (s)
-					{
-						if (r)
-						{
-							if ((k + r) > 63)
-								stop_decoding(JPGD_DECODE_ERROR);
-
-							if (k < prev_num_set)
-							{
-								int n = JPGD_MIN(r, prev_num_set - k);
-								int kt = k;
-								while (n--)
-									p[g_ZAG[kt++]] = 0;
-							}
-
-							k += r;
-						}
-
-						s = HUFF_EXTEND(extra_bits, s);
-
-						JPGD_ASSERT(k < 64);
-
-						p[g_ZAG[k]] = static_cast<jpgd_block_t>(dequantize_ac(s, q[k])); //s * q[k];
-					}
-					else
-					{
-						if (r == 15)
-						{
-							if ((k + 16) > 64)
-								stop_decoding(JPGD_DECODE_ERROR);
-
-							if (k < prev_num_set)
-							{
-								int n = JPGD_MIN(16, prev_num_set - k);
-								int kt = k;
-								while (n--)
-								{
-									JPGD_ASSERT(kt <= 63);
-									p[g_ZAG[kt++]] = 0;
-								}
-							}
-
-							k += 16 - 1; // - 1 because the loop counter is k
-							// BEGIN EPIC MOD
-							JPGD_ASSERT(k < 64 && p[g_ZAG[k]] == 0);
-							// END EPIC MOD
-						}
-						else
-							break;
-					}
-				}
-
-				if (k < prev_num_set)
-				{
-					int kt = k;
-					while (kt < prev_num_set)
-						p[g_ZAG[kt++]] = 0;
-				}
-
-				m_mcu_block_max_zag[mcu_block] = k;
-
-				row_block++;
-			}
-
-			if (m_freq_domain_chroma_upsample)
-				transform_mcu_expand(mcu_row);
-			else
-				transform_mcu(mcu_row);
-
-			m_restarts_left--;
-		}
-	}
-
-	// YCbCr H1V1 (1x1:1:1, 3 m_blocks per MCU) to RGB
-	void jpeg_decoder::H1V1Convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d = m_pScan_line_0;
-		uint8 *s = m_pSample_buf + row * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int j = 0; j < 8; j++)
-			{
-				int y = s[j];
-				int cb = s[64+j];
-				int cr = s[128+j];
-
-				if (jpg_format == ERGBFormatJPG::BGRA)
-				{
-					d[0] = clamp(y + m_cbb[cb]);
-					d[1] = clamp(y + ((m_crg[cr] + m_cbg[cb]) >> 16));
-					d[2] = clamp(y + m_crr[cr]);
-					d[3] = 255;
-				}
-				else
-				{
-					d[0] = clamp(y + m_crr[cr]);
-					d[1] = clamp(y + ((m_crg[cr] + m_cbg[cb]) >> 16));
-					d[2] = clamp(y + m_cbb[cb]);
-					d[3] = 255;
-				}
-				d += 4;
-			}
-
-			s += 64*3;
-		}
-	}
-
-	// YCbCr H2V1 (2x1:1:1, 4 m_blocks per MCU) to RGB
-	void jpeg_decoder::H2V1Convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d0 = m_pScan_line_0;
-		uint8 *y = m_pSample_buf + row * 8;
-		uint8 *c = m_pSample_buf + 2*64 + row * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int l = 0; l < 2; l++)
-			{
-				for (int j = 0; j < 4; j++)
-				{
-					int cb = c[0];
-					int cr = c[64];
-
-					int rc = m_crr[cr];
-					int gc = ((m_crg[cr] + m_cbg[cb]) >> 16);
-					int bc = m_cbb[cb];
-
-					int yy = y[j<<1];
-					if (jpg_format == ERGBFormatJPG::BGRA)
-					{
-						d0[0] = clamp(yy+bc);
-						d0[1] = clamp(yy+gc);
-						d0[2] = clamp(yy+rc);
-						d0[3] = 255;
-						yy = y[(j<<1)+1];
-						d0[4] = clamp(yy+bc);
-						d0[5] = clamp(yy+gc);
-						d0[6] = clamp(yy+rc);
-						d0[7] = 255;
-					}
-					else
-					{
-						d0[0] = clamp(yy+rc);
-						d0[1] = clamp(yy+gc);
-						d0[2] = clamp(yy+bc);
-						d0[3] = 255;
-						yy = y[(j<<1)+1];
-						d0[4] = clamp(yy+rc);
-						d0[5] = clamp(yy+gc);
-						d0[6] = clamp(yy+bc);
-						d0[7] = 255;
-					}
-
-					d0 += 8;
-
-					c++;
-				}
-				y += 64;
-			}
-
-			y += 64*4 - 64*2;
-			c += 64*4 - 8;
-		}
-	}
-
-	// YCbCr H2V1 (1x2:1:1, 4 m_blocks per MCU) to RGB
-	void jpeg_decoder::H1V2Convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d0 = m_pScan_line_0;
-		uint8 *d1 = m_pScan_line_1;
-		uint8 *y;
-		uint8 *c;
-
-		if (row < 8)
-			y = m_pSample_buf + row * 8;
-		else
-			y = m_pSample_buf + 64*1 + (row & 7) * 8;
-
-		c = m_pSample_buf + 64*2 + (row >> 1) * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int j = 0; j < 8; j++)
-			{
-				int cb = c[0+j];
-				int cr = c[64+j];
-
-				int rc = m_crr[cr];
-				int gc = ((m_crg[cr] + m_cbg[cb]) >> 16);
-				int bc = m_cbb[cb];
-
-				int yy = y[j];
-				if (jpg_format == ERGBFormatJPG::BGRA)
-				{
-					d0[0] = clamp(yy+bc);
-					d0[1] = clamp(yy+gc);
-					d0[2] = clamp(yy+rc);
-					d0[3] = 255;
-					yy = y[8+j];
-					d1[0] = clamp(yy+bc);
-					d1[1] = clamp(yy+gc);
-					d1[2] = clamp(yy+rc);
-					d1[3] = 255;
-				}
-				else
-				{
-					d0[0] = clamp(yy+rc);
-					d0[1] = clamp(yy+gc);
-					d0[2] = clamp(yy+bc);
-					d0[3] = 255;
-					yy = y[8+j];
-					d1[0] = clamp(yy+rc);
-					d1[1] = clamp(yy+gc);
-					d1[2] = clamp(yy+bc);
-					d1[3] = 255;
-				}
-
-				d0 += 4;
-				d1 += 4;
-			}
-
-			y += 64*4;
-			c += 64*4;
-		}
-	}
-
-	// YCbCr H2V2 (2x2:1:1, 6 m_blocks per MCU) to RGB
-	void jpeg_decoder::H2V2Convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d0 = m_pScan_line_0;
-		uint8 *d1 = m_pScan_line_1;
-		uint8 *y;
-		uint8 *c;
-
-		if (row < 8)
-			y = m_pSample_buf + row * 8;
-		else
-			y = m_pSample_buf + 64*2 + (row & 7) * 8;
-
-		c = m_pSample_buf + 64*4 + (row >> 1) * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int l = 0; l < 2; l++)
-			{
-				for (int j = 0; j < 8; j += 2)
-				{
-					int cb = c[0];
-					int cr = c[64];
-
-					int rc = m_crr[cr];
-					int gc = ((m_crg[cr] + m_cbg[cb]) >> 16);
-					int bc = m_cbb[cb];
-
-					int yy = y[j];
-					if (jpg_format == ERGBFormatJPG::BGRA)
-					{
-						d0[0] = clamp(yy+bc);
-						d0[1] = clamp(yy+gc);
-						d0[2] = clamp(yy+rc);
-						d0[3] = 255;
-						yy = y[j+1];
-						d0[4] = clamp(yy+bc);
-						d0[5] = clamp(yy+gc);
-						d0[6] = clamp(yy+rc);
-						d0[7] = 255;
-						yy = y[j+8];
-						d1[0] = clamp(yy+bc);
-						d1[1] = clamp(yy+gc);
-						d1[2] = clamp(yy+rc);
-						d1[3] = 255;
-						yy = y[j+8+1];
-						d1[4] = clamp(yy+bc);
-						d1[5] = clamp(yy+gc);
-						d1[6] = clamp(yy+rc);
-						d1[7] = 255;
-					}
-					else
-					{
-						d0[0] = clamp(yy+rc);
-						d0[1] = clamp(yy+gc);
-						d0[2] = clamp(yy+bc);
-						d0[3] = 255;
-						yy = y[j+1];
-						d0[4] = clamp(yy+rc);
-						d0[5] = clamp(yy+gc);
-						d0[6] = clamp(yy+bc);
-						d0[7] = 255;
-						yy = y[j+8];
-						d1[0] = clamp(yy+rc);
-						d1[1] = clamp(yy+gc);
-						d1[2] = clamp(yy+bc);
-						d1[3] = 255;
-						yy = y[j+8+1];
-						d1[4] = clamp(yy+rc);
-						d1[5] = clamp(yy+gc);
-						d1[6] = clamp(yy+bc);
-						d1[7] = 255;
-					}
-
-					d0 += 8;
-					d1 += 8;
-
-					c++;
-				}
-				y += 64;
-			}
-
-			y += 64*6 - 64*2;
-			c += 64*6 - 8;
-		}
-	}
-
-	// Y (1 block per MCU) to 8-bit grayscale
-	void jpeg_decoder::gray_convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d = m_pScan_line_0;
-		uint8 *s = m_pSample_buf + row * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			*(uint *)d = *(uint *)s;
-			*(uint *)(&d[4]) = *(uint *)(&s[4]);
-
-			s += 64;
-			d += 8;
-		}
-	}
-
-	void jpeg_decoder::expanded_convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-
-		uint8* Py = m_pSample_buf + (row / 8) * 64 * m_comp_h_samp[0] + (row & 7) * 8;
-
-		uint8* d = m_pScan_line_0;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int k = 0; k < m_max_mcu_x_size; k += 8)
-			{
-				const int Y_ofs = k * 8;
-				const int Cb_ofs = Y_ofs + 64 * m_expanded_blocks_per_component;
-				const int Cr_ofs = Y_ofs + 64 * m_expanded_blocks_per_component * 2;
-				for (int j = 0; j < 8; j++)
-				{
-					int y = Py[Y_ofs + j];
-					int cb = Py[Cb_ofs + j];
-					int cr = Py[Cr_ofs + j];
-
-					if (jpg_format == ERGBFormatJPG::BGRA)
-					{
-						d[0] = clamp(y + m_cbb[cb]);
-						d[1] = clamp(y + ((m_crg[cr] + m_cbg[cb]) >> 16));
-						d[2] = clamp(y + m_crr[cr]);
-						d[3] = 255;
-					}
-					else
-					{
-						d[0] = clamp(y + m_crr[cr]);
-						d[1] = clamp(y + ((m_crg[cr] + m_cbg[cb]) >> 16));
-						d[2] = clamp(y + m_cbb[cb]);
-						d[3] = 255;
-					}
-
-					d += 4;
-				}
-			}
-
-			Py += 64 * m_expanded_blocks_per_mcu;
-		}
-	}
-
-	// Find end of image (EOI) marker, so we can return to the user the exact size of the input stream.
-	void jpeg_decoder::find_eoi()
-	{
-		if (!m_progressive_flag)
-		{
-			// Attempt to read the EOI marker.
-			//get_bits_no_markers(m_bits_left & 7);
-
-			// Prime the bit buffer
-			m_bits_left = 16;
-			get_bits(16);
-			get_bits(16);
-
-			// The next marker _should_ be EOI
-			process_markers();
-		}
-
-		m_total_bytes_read -= m_in_buf_left;
-	}
-
-	int jpeg_decoder::decode(const void** pScan_line, uint* pScan_line_len)
-	{
-		if ((m_error_code) || (!m_ready_flag))
-			return JPGD_FAILED;
-
-		if (m_total_lines_left == 0)
-			return JPGD_DONE;
-
-		if (m_mcu_lines_left == 0)
-		{
-			if (setjmp(m_jmp_state))
-				return JPGD_FAILED;
-
-			if (m_progressive_flag)
-				load_next_row();
-			else
-				decode_next_row();
-
-			// Find the EOI marker if that was the last row.
-			if (m_total_lines_left <= m_max_mcu_y_size)
-				find_eoi();
-
-			m_mcu_lines_left = m_max_mcu_y_size;
-		}
-
-		if (m_freq_domain_chroma_upsample)
-		{
-			expanded_convert();
-			*pScan_line = m_pScan_line_0;
-		}
-		else
-		{
-			switch (m_scan_type)
-			{
-			case JPGD_YH2V2:
-				{
-					if ((m_mcu_lines_left & 1) == 0)
-					{
-						H2V2Convert();
-						*pScan_line = m_pScan_line_0;
-					}
-					else
-						*pScan_line = m_pScan_line_1;
-
-					break;
-				}
-			case JPGD_YH2V1:
-				{
-					H2V1Convert();
-					*pScan_line = m_pScan_line_0;
-					break;
-				}
-			case JPGD_YH1V2:
-				{
-					if ((m_mcu_lines_left & 1) == 0)
-					{
-						H1V2Convert();
-						*pScan_line = m_pScan_line_0;
-					}
-					else
-						*pScan_line = m_pScan_line_1;
-
-					break;
-				}
-			case JPGD_YH1V1:
-				{
-					H1V1Convert();
-					*pScan_line = m_pScan_line_0;
-					break;
-				}
-			case JPGD_GRAYSCALE:
-				{
-					gray_convert();
-					*pScan_line = m_pScan_line_0;
-
-					break;
-				}
-			}
-		}
-
-		*pScan_line_len = m_real_dest_bytes_per_scan_line;
-
-		m_mcu_lines_left--;
-		m_total_lines_left--;
-
-		return JPGD_SUCCESS;
-	}
-
-	// Creates the tables needed for efficient Huffman decoding.
-	void jpeg_decoder::make_huff_table(int index, huff_tables *pH)
-	{
-		int p, i, l, si;
-		uint8 huffsize[257];
-		uint huffcode[257];
-		uint code;
-		uint subtree;
-		int code_size;
-		int lastp;
-		int nextfreeentry;
-		int currententry;
-
-		pH->ac_table = m_huff_ac[index] != 0;
-
-		p = 0;
-
-		for (l = 1; l <= 16; l++)
-		{
-			for (i = 1; i <= m_huff_num[index][l]; i++)
-				huffsize[p++] = static_cast<uint8>(l);
-		}
-
-		huffsize[p] = 0;
-
-		lastp = p;
-
-		code = 0;
-		si = huffsize[0];
-		p = 0;
-
-		while (huffsize[p])
-		{
-			while (huffsize[p] == si)
-			{
-				huffcode[p++] = code;
-				code++;
-			}
-
-			code <<= 1;
-			si++;
-		}
-
-		memset(pH->look_up, 0, sizeof(pH->look_up));
-		memset(pH->look_up2, 0, sizeof(pH->look_up2));
-		memset(pH->tree, 0, sizeof(pH->tree));
-		memset(pH->code_size, 0, sizeof(pH->code_size));
-
-		nextfreeentry = -1;
-
-		p = 0;
-
-		while (p < lastp)
-		{
-			i = m_huff_val[index][p];
-			code = huffcode[p];
-			code_size = huffsize[p];
-
-			pH->code_size[i] = static_cast<uint8>(code_size);
-
-			if (code_size <= 8)
-			{
-				code <<= (8 - code_size);
-
-				for (l = 1 << (8 - code_size); l > 0; l--)
-				{
-					JPGD_ASSERT(i < 256);
-
-					pH->look_up[code] = i;
-
-					bool has_extrabits = false;
-					int extra_bits = 0;
-					int num_extra_bits = i & 15;
-
-					int bits_to_fetch = code_size;
-					if (num_extra_bits)
-					{
-						int total_codesize = code_size + num_extra_bits;
-						if (total_codesize <= 8)
-						{
-							has_extrabits = true;
-							extra_bits = ((1 << num_extra_bits) - 1) & (code >> (8 - total_codesize));
-							JPGD_ASSERT(extra_bits <= 0x7FFF);
-							bits_to_fetch += num_extra_bits;
-						}
-					}
-
-					if (!has_extrabits)
-						pH->look_up2[code] = i | (bits_to_fetch << 8);
-					else
-						pH->look_up2[code] = i | 0x8000 | (extra_bits << 16) | (bits_to_fetch << 8);
-
-					code++;
-				}
-			}
-			else
-			{
-				subtree = (code >> (code_size - 8)) & 0xFF;
-
-				currententry = pH->look_up[subtree];
-
-				if (currententry == 0)
-				{
-					pH->look_up[subtree] = currententry = nextfreeentry;
-					pH->look_up2[subtree] = currententry = nextfreeentry;
-
-					nextfreeentry -= 2;
-				}
-
-				code <<= (16 - (code_size - 8));
-
-				for (l = code_size; l > 9; l--)
-				{
-					if ((code & 0x8000) == 0)
-						currententry--;
-
-					if (pH->tree[-currententry - 1] == 0)
-					{
-						pH->tree[-currententry - 1] = nextfreeentry;
-
-						currententry = nextfreeentry;
-
-						nextfreeentry -= 2;
-					}
-					else
-						currententry = pH->tree[-currententry - 1];
-
-					code <<= 1;
-				}
-
-				if ((code & 0x8000) == 0)
-					currententry--;
-
-				pH->tree[-currententry - 1] = i;
-			}
-
-			p++;
-		}
-	}
-
-	// Verifies the quantization tables needed for this scan are available.
-	void jpeg_decoder::check_quant_tables()
-	{
-		for (int i = 0; i < m_comps_in_scan; i++)
-			if (m_quant[m_comp_quant[m_comp_list[i]]] == NULL)
-				stop_decoding(JPGD_UNDEFINED_QUANT_TABLE);
-	}
-
-	// Verifies that all the Huffman tables needed for this scan are available.
-	void jpeg_decoder::check_huff_tables()
-	{
-		for (int i = 0; i < m_comps_in_scan; i++)
-		{
-			if ((m_spectral_start == 0) && (m_huff_num[m_comp_dc_tab[m_comp_list[i]]] == NULL))
-				stop_decoding(JPGD_UNDEFINED_HUFF_TABLE);
-
-			if ((m_spectral_end > 0) && (m_huff_num[m_comp_ac_tab[m_comp_list[i]]] == NULL))
-				stop_decoding(JPGD_UNDEFINED_HUFF_TABLE);
-		}
-
-		for (int i = 0; i < JPGD_MAX_HUFF_TABLES; i++)
-			if (m_huff_num[i])
-			{
-				if (!m_pHuff_tabs[i])
-					m_pHuff_tabs[i] = (huff_tables *)alloc(sizeof(huff_tables));
-
-				make_huff_table(i, m_pHuff_tabs[i]);
-			}
-	}
-
-	// Determines the component order inside each MCU.
-	// Also calcs how many MCU's are on each row, etc.
-	void jpeg_decoder::calc_mcu_block_order()
-	{
-		int component_num, component_id;
-		int max_h_samp = 0, max_v_samp = 0;
-
-		for (component_id = 0; component_id < m_comps_in_frame; component_id++)
-		{
-			if (m_comp_h_samp[component_id] > max_h_samp)
-				max_h_samp = m_comp_h_samp[component_id];
-
-			if (m_comp_v_samp[component_id] > max_v_samp)
-				max_v_samp = m_comp_v_samp[component_id];
-		}
-
-		for (component_id = 0; component_id < m_comps_in_frame; component_id++)
-		{
-			m_comp_h_blocks[component_id] = ((((m_image_x_size * m_comp_h_samp[component_id]) + (max_h_samp - 1)) / max_h_samp) + 7) / 8;
-			m_comp_v_blocks[component_id] = ((((m_image_y_size * m_comp_v_samp[component_id]) + (max_v_samp - 1)) / max_v_samp) + 7) / 8;
-		}
-
-		if (m_comps_in_scan == 1)
-		{
-			m_mcus_per_row = m_comp_h_blocks[m_comp_list[0]];
-			m_mcus_per_col = m_comp_v_blocks[m_comp_list[0]];
-		}
-		else
-		{
-			m_mcus_per_row = (((m_image_x_size + 7) / 8) + (max_h_samp - 1)) / max_h_samp;
-			m_mcus_per_col = (((m_image_y_size + 7) / 8) + (max_v_samp - 1)) / max_v_samp;
-		}
-
-		if (m_comps_in_scan == 1)
-		{
-			m_mcu_org[0] = m_comp_list[0];
-
-			m_blocks_per_mcu = 1;
-		}
-		else
-		{
-			m_blocks_per_mcu = 0;
-
-			for (component_num = 0; component_num < m_comps_in_scan; component_num++)
-			{
-				int num_blocks;
-
-				component_id = m_comp_list[component_num];
-
-				num_blocks = m_comp_h_samp[component_id] * m_comp_v_samp[component_id];
-
-				while (num_blocks--)
-					m_mcu_org[m_blocks_per_mcu++] = component_id;
-			}
-		}
-	}
-
-	// Starts a new scan.
-	int jpeg_decoder::init_scan()
-	{
-		if (!locate_sos_marker())
-			return JPGD_FALSE;
-
-		calc_mcu_block_order();
-
-		check_huff_tables();
-
-		check_quant_tables();
-
-		memset(m_last_dc_val, 0, m_comps_in_frame * sizeof(uint));
-
-		m_eob_run = 0;
-
-		if (m_restart_interval)
-		{
-			m_restarts_left = m_restart_interval;
-			m_next_restart_num = 0;
-		}
-
-		fix_in_buffer();
-
-		return JPGD_TRUE;
-	}
-
-	// Starts a frame. Determines if the number of components or sampling factors
-	// are supported.
-	void jpeg_decoder::init_frame()
-	{
-		int i;
-
-		if (m_comps_in_frame == 1)
-		{
-			if ((m_comp_h_samp[0] != 1) || (m_comp_v_samp[0] != 1))
-				stop_decoding(JPGD_UNSUPPORTED_SAMP_FACTORS);
-
-			m_scan_type = JPGD_GRAYSCALE;
-			m_max_blocks_per_mcu = 1;
-			m_max_mcu_x_size = 8;
-			m_max_mcu_y_size = 8;
-		}
-		else if (m_comps_in_frame == 3)
-		{
-			if ( ((m_comp_h_samp[1] != 1) || (m_comp_v_samp[1] != 1)) ||
-				((m_comp_h_samp[2] != 1) || (m_comp_v_samp[2] != 1)) )
-				stop_decoding(JPGD_UNSUPPORTED_SAMP_FACTORS);
-
-			if ((m_comp_h_samp[0] == 1) && (m_comp_v_samp[0] == 1))
-			{
-				m_scan_type = JPGD_YH1V1;
-
-				m_max_blocks_per_mcu = 3;
-				m_max_mcu_x_size = 8;
-				m_max_mcu_y_size = 8;
-			}
-			else if ((m_comp_h_samp[0] == 2) && (m_comp_v_samp[0] == 1))
-			{
-				m_scan_type = JPGD_YH2V1;
-				m_max_blocks_per_mcu = 4;
-				m_max_mcu_x_size = 16;
-				m_max_mcu_y_size = 8;
-			}
-			else if ((m_comp_h_samp[0] == 1) && (m_comp_v_samp[0] == 2))
-			{
-				m_scan_type = JPGD_YH1V2;
-				m_max_blocks_per_mcu = 4;
-				m_max_mcu_x_size = 8;
-				m_max_mcu_y_size = 16;
-			}
-			else if ((m_comp_h_samp[0] == 2) && (m_comp_v_samp[0] == 2))
-			{
-				m_scan_type = JPGD_YH2V2;
-				m_max_blocks_per_mcu = 6;
-				m_max_mcu_x_size = 16;
-				m_max_mcu_y_size = 16;
-			}
-			else
-				stop_decoding(JPGD_UNSUPPORTED_SAMP_FACTORS);
-		}
-		else
-			stop_decoding(JPGD_UNSUPPORTED_COLORSPACE);
-
-		m_max_mcus_per_row = (m_image_x_size + (m_max_mcu_x_size - 1)) / m_max_mcu_x_size;
-		m_max_mcus_per_col = (m_image_y_size + (m_max_mcu_y_size - 1)) / m_max_mcu_y_size;
-
-		// These values are for the *destination* pixels: after conversion.
-		if (m_scan_type == JPGD_GRAYSCALE)
-			m_dest_bytes_per_pixel = 1;
-		else
-			m_dest_bytes_per_pixel = 4;
-
-		m_dest_bytes_per_scan_line = ((m_image_x_size + 15) & 0xFFF0) * m_dest_bytes_per_pixel;
-
-		m_real_dest_bytes_per_scan_line = (m_image_x_size * m_dest_bytes_per_pixel);
-
-		// Initialize two scan line buffers.
-		m_pScan_line_0 = (uint8 *)alloc(m_dest_bytes_per_scan_line, true);
-		if ((m_scan_type == JPGD_YH1V2) || (m_scan_type == JPGD_YH2V2))
-			m_pScan_line_1 = (uint8 *)alloc(m_dest_bytes_per_scan_line, true);
-
-		m_max_blocks_per_row = m_max_mcus_per_row * m_max_blocks_per_mcu;
-
-		// Should never happen
-		if (m_max_blocks_per_row > JPGD_MAX_BLOCKS_PER_ROW)
-			stop_decoding(JPGD_ASSERTION_ERROR);
-
-		// Allocate the coefficient buffer, enough for one MCU
-		m_pMCU_coefficients = (jpgd_block_t*)alloc(m_max_blocks_per_mcu * 64 * sizeof(jpgd_block_t));
-
-		for (i = 0; i < m_max_blocks_per_mcu; i++)
-			m_mcu_block_max_zag[i] = 64;
-
-		m_expanded_blocks_per_component = m_comp_h_samp[0] * m_comp_v_samp[0];
-		m_expanded_blocks_per_mcu = m_expanded_blocks_per_component * m_comps_in_frame;
-		m_expanded_blocks_per_row = m_max_mcus_per_row * m_expanded_blocks_per_mcu;
-		// Freq. domain chroma upsampling is only supported for H2V2 subsampling factor.
-// BEGIN EPIC MOD
-#if JPGD_SUPPORT_FREQ_DOMAIN_UPSAMPLING
-		m_freq_domain_chroma_upsample = (m_expanded_blocks_per_mcu == 4*3);
-#else
-		m_freq_domain_chroma_upsample = 0;
-#endif
-// END EPIC MOD
-
-		if (m_freq_domain_chroma_upsample)
-			m_pSample_buf = (uint8 *)alloc(m_expanded_blocks_per_row * 64);
-		else
-			m_pSample_buf = (uint8 *)alloc(m_max_blocks_per_row * 64);
-
-		m_total_lines_left = m_image_y_size;
-
-		m_mcu_lines_left = 0;
-
-		create_look_ups();
-	}
-
-	// The coeff_buf series of methods originally stored the coefficients
-	// into a "virtual" file which was located in EMS, XMS, or a disk file. A cache
-	// was used to make this process more efficient. Now, we can store the entire
-	// thing in RAM.
-	jpeg_decoder::coeff_buf* jpeg_decoder::coeff_buf_open(int block_num_x, int block_num_y, int block_len_x, int block_len_y)
-	{
-		coeff_buf* cb = (coeff_buf*)alloc(sizeof(coeff_buf));
-
-		cb->block_num_x = block_num_x;
-		cb->block_num_y = block_num_y;
-		cb->block_len_x = block_len_x;
-		cb->block_len_y = block_len_y;
-		cb->block_size = (block_len_x * block_len_y) * sizeof(jpgd_block_t);
-		cb->pData = (uint8 *)alloc(cb->block_size * block_num_x * block_num_y, true);
-		return cb;
-	}
-
-	inline jpgd_block_t *jpeg_decoder::coeff_buf_getp(coeff_buf *cb, int block_x, int block_y)
-	{
-		JPGD_ASSERT((block_x < cb->block_num_x) && (block_y < cb->block_num_y));
-		return (jpgd_block_t *)(cb->pData + block_x * cb->block_size + block_y * (cb->block_size * cb->block_num_x));
-	}
-
-	// The following methods decode the various types of m_blocks encountered
-	// in progressively encoded images.
-	void jpeg_decoder::decode_block_dc_first(jpeg_decoder *pD, int component_id, int block_x, int block_y)
-	{
-		int s, r;
-		jpgd_block_t *p = pD->coeff_buf_getp(pD->m_dc_coeffs[component_id], block_x, block_y);
-
-		if ((s = pD->huff_decode(pD->m_pHuff_tabs[pD->m_comp_dc_tab[component_id]])) != 0)
-		{
-			r = pD->get_bits_no_markers(s);
-			s = HUFF_EXTEND(r, s);
-		}
-
-		pD->m_last_dc_val[component_id] = (s += pD->m_last_dc_val[component_id]);
-
-		p[0] = static_cast<jpgd_block_t>(s << pD->m_successive_low);
-	}
-
-	void jpeg_decoder::decode_block_dc_refine(jpeg_decoder *pD, int component_id, int block_x, int block_y)
-	{
-		if (pD->get_bits_no_markers(1))
-		{
-			jpgd_block_t *p = pD->coeff_buf_getp(pD->m_dc_coeffs[component_id], block_x, block_y);
-
-			p[0] |= (1 << pD->m_successive_low);
-		}
-	}
-
-	void jpeg_decoder::decode_block_ac_first(jpeg_decoder *pD, int component_id, int block_x, int block_y)
-	{
-		int k, s, r;
-
-		if (pD->m_eob_run)
-		{
-			pD->m_eob_run--;
-			return;
-		}
-
-		jpgd_block_t *p = pD->coeff_buf_getp(pD->m_ac_coeffs[component_id], block_x, block_y);
-
-		for (k = pD->m_spectral_start; k <= pD->m_spectral_end; k++)
-		{
-			s = pD->huff_decode(pD->m_pHuff_tabs[pD->m_comp_ac_tab[component_id]]);
-
-			r = s >> 4;
-			s &= 15;
-
-			if (s)
-			{
-				if ((k += r) > 63)
-					pD->stop_decoding(JPGD_DECODE_ERROR);
-
-				r = pD->get_bits_no_markers(s);
-				s = HUFF_EXTEND(r, s);
-
-				p[g_ZAG[k]] = static_cast<jpgd_block_t>(s << pD->m_successive_low);
-			}
-			else
-			{
-				if (r == 15)
-				{
-					if ((k += 15) > 63)
-						pD->stop_decoding(JPGD_DECODE_ERROR);
-				}
-				else
-				{
-					pD->m_eob_run = 1 << r;
-
-					if (r)
-						pD->m_eob_run += pD->get_bits_no_markers(r);
-
-					pD->m_eob_run--;
-
-					break;
-				}
-			}
-		}
-	}
-
-	void jpeg_decoder::decode_block_ac_refine(jpeg_decoder *pD, int component_id, int block_x, int block_y)
-	{
-		int s, k, r;
-		int p1 = 1 << pD->m_successive_low;
-		int m1 = (-1) << pD->m_successive_low;
-		jpgd_block_t *p = pD->coeff_buf_getp(pD->m_ac_coeffs[component_id], block_x, block_y);
-
-		k = pD->m_spectral_start;
-
-		if (pD->m_eob_run == 0)
-		{
-			for ( ; k <= pD->m_spectral_end; k++)
-			{
-				s = pD->huff_decode(pD->m_pHuff_tabs[pD->m_comp_ac_tab[component_id]]);
-
-				r = s >> 4;
-				s &= 15;
-
-				if (s)
-				{
-					if (s != 1)
-						pD->stop_decoding(JPGD_DECODE_ERROR);
-
-					if (pD->get_bits_no_markers(1))
-						s = p1;
-					else
-						s = m1;
-				}
-				else
-				{
-					if (r != 15)
-					{
-						pD->m_eob_run = 1 << r;
-
-						if (r)
-							pD->m_eob_run += pD->get_bits_no_markers(r);
-
-						break;
-					}
-				}
-
-				do
-				{
-					// BEGIN EPIC MOD
-					JPGD_ASSERT(k < 64);
-					// END EPIC MOD
-
-					jpgd_block_t *this_coef = p + g_ZAG[k];
-
-					if (*this_coef != 0)
-					{
-						if (pD->get_bits_no_markers(1))
-						{
-							if ((*this_coef & p1) == 0)
-							{
-								if (*this_coef >= 0)
-									*this_coef = static_cast<jpgd_block_t>(*this_coef + p1);
-								else
-									*this_coef = static_cast<jpgd_block_t>(*this_coef + m1);
-							}
-						}
-					}
-					else
-					{
-						if (--r < 0)
-							break;
-					}
-
-					k++;
-
-				} while (k <= pD->m_spectral_end);
-
-				if ((s) && (k < 64))
-				{
-					p[g_ZAG[k]] = static_cast<jpgd_block_t>(s);
-				}
-			}
-		}
-
-		if (pD->m_eob_run > 0)
-		{
-			for ( ; k <= pD->m_spectral_end; k++)
-			{
-				// BEGIN EPIC MOD
-				JPGD_ASSERT(k < 64);
-				// END EPIC MOD
-
-				jpgd_block_t *this_coef = p + g_ZAG[k];
-
-				if (*this_coef != 0)
-				{
-					if (pD->get_bits_no_markers(1))
-					{
-						if ((*this_coef & p1) == 0)
-						{
-							if (*this_coef >= 0)
-								*this_coef = static_cast<jpgd_block_t>(*this_coef + p1);
-							else
-								*this_coef = static_cast<jpgd_block_t>(*this_coef + m1);
-						}
-					}
-				}
-			}
-
-			pD->m_eob_run--;
-		}
-	}
-
-	// Decode a scan in a progressively encoded image.
-	void jpeg_decoder::decode_scan(pDecode_block_func decode_block_func)
-	{
-		int mcu_row, mcu_col, mcu_block;
-		int block_x_mcu[JPGD_MAX_COMPONENTS], m_block_y_mcu[JPGD_MAX_COMPONENTS];
-
-		memset(m_block_y_mcu, 0, sizeof(m_block_y_mcu));
-
-		for (mcu_col = 0; mcu_col < m_mcus_per_col; mcu_col++)
-		{
-			int component_num, component_id;
-
-			memset(block_x_mcu, 0, sizeof(block_x_mcu));
-
-			for (mcu_row = 0; mcu_row < m_mcus_per_row; mcu_row++)
-			{
-				int block_x_mcu_ofs = 0, block_y_mcu_ofs = 0;
-
-				if ((m_restart_interval) && (m_restarts_left == 0))
-					process_restart();
-
-				for (mcu_block = 0; mcu_block < m_blocks_per_mcu; mcu_block++)
-				{
-					component_id = m_mcu_org[mcu_block];
-
-					decode_block_func(this, component_id, block_x_mcu[component_id] + block_x_mcu_ofs, m_block_y_mcu[component_id] + block_y_mcu_ofs);
-
-					if (m_comps_in_scan == 1)
-						block_x_mcu[component_id]++;
-					else
-					{
-						if (++block_x_mcu_ofs == m_comp_h_samp[component_id])
-						{
-							block_x_mcu_ofs = 0;
-
-							if (++block_y_mcu_ofs == m_comp_v_samp[component_id])
-							{
-								block_y_mcu_ofs = 0;
-								block_x_mcu[component_id] += m_comp_h_samp[component_id];
-							}
-						}
-					}
-				}
-
-				m_restarts_left--;
-			}
-
-			if (m_comps_in_scan == 1)
-				m_block_y_mcu[m_comp_list[0]]++;
-			else
-			{
-				for (component_num = 0; component_num < m_comps_in_scan; component_num++)
-				{
-					component_id = m_comp_list[component_num];
-					m_block_y_mcu[component_id] += m_comp_v_samp[component_id];
-				}
-			}
-		}
-	}
-
-	// Decode a progressively encoded image.
-	void jpeg_decoder::init_progressive()
-	{
-		int i;
-
-		if (m_comps_in_frame == 4)
-			stop_decoding(JPGD_UNSUPPORTED_COLORSPACE);
-
-		// Allocate the coefficient buffers.
-		for (i = 0; i < m_comps_in_frame; i++)
-		{
-			m_dc_coeffs[i] = coeff_buf_open(m_max_mcus_per_row * m_comp_h_samp[i], m_max_mcus_per_col * m_comp_v_samp[i], 1, 1);
-			m_ac_coeffs[i] = coeff_buf_open(m_max_mcus_per_row * m_comp_h_samp[i], m_max_mcus_per_col * m_comp_v_samp[i], 8, 8);
-		}
-
-		for ( ; ; )
-		{
-			int dc_only_scan, refinement_scan;
-			pDecode_block_func decode_block_func;
-
-			if (!init_scan())
-				break;
-
-			dc_only_scan = (m_spectral_start == 0);
-			refinement_scan = (m_successive_high != 0);
-
-			if ((m_spectral_start > m_spectral_end) || (m_spectral_end > 63))
-				stop_decoding(JPGD_BAD_SOS_SPECTRAL);
-
-			if (dc_only_scan)
-			{
-				if (m_spectral_end)
-					stop_decoding(JPGD_BAD_SOS_SPECTRAL);
-			}
-			else if (m_comps_in_scan != 1)  /* AC scans can only contain one component */
-				stop_decoding(JPGD_BAD_SOS_SPECTRAL);
-
-			if ((refinement_scan) && (m_successive_low != m_successive_high - 1))
-				stop_decoding(JPGD_BAD_SOS_SUCCESSIVE);
-
-			if (dc_only_scan)
-			{
-				if (refinement_scan)
-					decode_block_func = decode_block_dc_refine;
-				else
-					decode_block_func = decode_block_dc_first;
-			}
-			else
-			{
-				if (refinement_scan)
-					decode_block_func = decode_block_ac_refine;
-				else
-					decode_block_func = decode_block_ac_first;
-			}
-
-			decode_scan(decode_block_func);
-
-			m_bits_left = 16;
-			get_bits(16);
-			get_bits(16);
-		}
-
-		m_comps_in_scan = m_comps_in_frame;
-
-		for (i = 0; i < m_comps_in_frame; i++)
-			m_comp_list[i] = i;
-
-		calc_mcu_block_order();
-	}
-
-	void jpeg_decoder::init_sequential()
-	{
-		if (!init_scan())
-			stop_decoding(JPGD_UNEXPECTED_MARKER);
-	}
-
-	void jpeg_decoder::decode_start()
-	{
-		init_frame();
-
-		if (m_progressive_flag)
-			init_progressive();
-		else
-			init_sequential();
-	}
-
-	void jpeg_decoder::decode_init(jpeg_decoder_stream *pStream)
-	{
-		init(pStream);
-		locate_sof_marker();
-	}
-
-	jpeg_decoder::jpeg_decoder(jpeg_decoder_stream *pStream)
-	{
-		if (setjmp(m_jmp_state))
-			return;
-		decode_init(pStream);
-	}
-
-	int jpeg_decoder::begin_decoding()
-	{
-		if (m_ready_flag)
-			return JPGD_SUCCESS;
-
-		if (m_error_code)
-			return JPGD_FAILED;
-
-		if (setjmp(m_jmp_state))
-			return JPGD_FAILED;
-
-		decode_start();
-
-		m_ready_flag = true;
-
-		return JPGD_SUCCESS;
-	}
-
-	jpeg_decoder::~jpeg_decoder()
-	{
-		free_all_blocks();
-	}
-
-	jpeg_decoder_file_stream::jpeg_decoder_file_stream()
-	{
-		m_pFile = NULL;
-		m_eof_flag = false;
-		m_error_flag = false;
-	}
-
-	void jpeg_decoder_file_stream::close()
-	{
-		if (m_pFile)
-		{
-			fclose(m_pFile);
-			m_pFile = NULL;
-		}
-
-		m_eof_flag = false;
-		m_error_flag = false;
-	}
-
-	jpeg_decoder_file_stream::~jpeg_decoder_file_stream()
-	{
-		close();
-	}
-
-	bool jpeg_decoder_file_stream::open(const char *Pfilename)
-	{
-		close();
-
-		m_eof_flag = false;
-		m_error_flag = false;
-
-#if defined(_MSC_VER)
-		m_pFile = NULL;
-		fopen_s(&m_pFile, Pfilename, "rb");
-#else
-		m_pFile = fopen(Pfilename, "rb");
-#endif
-		return m_pFile != NULL;
-	}
-
-	int jpeg_decoder_file_stream::read(uint8 *pBuf, int max_bytes_to_read, bool *pEOF_flag)
-	{
-		if (!m_pFile)
-			return -1;
-
-		if (m_eof_flag)
-		{
-			*pEOF_flag = true;
-			return 0;
-		}
-
-		if (m_error_flag)
-			return -1;
-
-		int bytes_read = static_cast<int>(fread(pBuf, 1, max_bytes_to_read, m_pFile));
-		if (bytes_read < max_bytes_to_read)
-		{
-			if (ferror(m_pFile))
-			{
-				m_error_flag = true;
-				return -1;
-			}
-
-			m_eof_flag = true;
-			*pEOF_flag = true;
-		}
-
-		return bytes_read;
-	}
-
-	bool jpeg_decoder_mem_stream::open(const uint8 *pSrc_data, uint size)
-	{
-		close();
-		m_pSrc_data = pSrc_data;
-		m_ofs = 0;
-		m_size = size;
-		return true;
-	}
-
-	int jpeg_decoder_mem_stream::read(uint8 *pBuf, int max_bytes_to_read, bool *pEOF_flag)
-	{
-		*pEOF_flag = false;
-
-		if (!m_pSrc_data)
-			return -1;
-
-		uint bytes_remaining = m_size - m_ofs;
-		if ((uint)max_bytes_to_read > bytes_remaining)
-		{
-			max_bytes_to_read = bytes_remaining;
-			*pEOF_flag = true;
-		}
-
-		memcpy(pBuf, m_pSrc_data + m_ofs, max_bytes_to_read);
-		m_ofs += max_bytes_to_read;
-
-		return max_bytes_to_read;
-	}
-
-	unsigned char *decompress_jpeg_image_from_stream(jpeg_decoder_stream *pStream, int *width, int *height, int *actual_comps, int req_comps)
-	{
-		if (!actual_comps)
-			return NULL;
-		*actual_comps = 0;
-
-		if ((!pStream) || (!width) || (!height) || (!req_comps))
-			return NULL;
-
-		if ((req_comps != 1) && (req_comps != 3) && (req_comps != 4))
-			return NULL;
-
-		jpeg_decoder decoder(pStream);
-		if (decoder.get_error_code() != JPGD_SUCCESS)
-			return NULL;
-
-		const int image_width = decoder.get_width(), image_height = decoder.get_height();
-		*width = image_width;
-		*height = image_height;
-		*actual_comps = decoder.get_num_components();
-
-		if (decoder.begin_decoding() != JPGD_SUCCESS)
-			return NULL;
-
-		const int dst_bpl = image_width * req_comps;
-
-		uint8 *pImage_data = (uint8*)jpgd_malloc(dst_bpl * image_height);
-		if (!pImage_data)
-			return NULL;
-
-		for (int y = 0; y < image_height; y++)
-		{
-			const uint8* pScan_line = 0;
-			uint scan_line_len;
-			if (decoder.decode((const void**)&pScan_line, &scan_line_len) != JPGD_SUCCESS)
-			{
-				jpgd_free(pImage_data);
-				return NULL;
-			}
-
-			uint8 *pDst = pImage_data + y * dst_bpl;
-
-			if (((req_comps == 4) && (decoder.get_num_components() == 3)) ||
-				((req_comps == 1) && (decoder.get_num_components() == 1)))
-			{
-				memcpy(pDst, pScan_line, dst_bpl);
-			}
-			else if (decoder.get_num_components() == 1)
-			{
-				if (req_comps == 3)
-				{
-					for (int x = 0; x < image_width; x++)
-					{
-						uint8 luma = pScan_line[x];
-						pDst[0] = luma;
-						pDst[1] = luma;
-						pDst[2] = luma;
-						pDst += 3;
-					}
-				}
-				else
-				{
-					for (int x = 0; x < image_width; x++)
-					{
-						uint8 luma = pScan_line[x];
-						pDst[0] = luma;
-						pDst[1] = luma;
-						pDst[2] = luma;
-						pDst[3] = 255;
-						pDst += 4;
-					}
-				}
-			}
-			else if (decoder.get_num_components() == 3)
-			{
-				if (req_comps == 1)
-				{
-					const int YR = 19595, YG = 38470, YB = 7471;
-					for (int x = 0; x < image_width; x++)
-					{
-						int r = pScan_line[x*4+0];
-						int g = pScan_line[x*4+1];
-						int b = pScan_line[x*4+2];
-						*pDst++ = static_cast<uint8>((r * YR + g * YG + b * YB + 32768) >> 16);
-					}
-				}
-				else
-				{
-					for (int x = 0; x < image_width; x++)
-					{
-						pDst[0] = pScan_line[x*4+0];
-						pDst[1] = pScan_line[x*4+1];
-						pDst[2] = pScan_line[x*4+2];
-						pDst += 3;
-					}
-				}
-			}
-		}
-
-		return pImage_data;
-	}
-
-// BEGIN EPIC MOD
-	unsigned char *decompress_jpeg_image_from_memory(const unsigned char *pSrc_data, int src_data_size, int *width, int *height, int *actual_comps, int req_comps, int format)
-	{
-		jpg_format = (ERGBFormatJPG)format;
-// EMD EPIC MOD
-		jpgd::jpeg_decoder_mem_stream mem_stream(pSrc_data, src_data_size);
-		return decompress_jpeg_image_from_stream(&mem_stream, width, height, actual_comps, req_comps);
-	}
-
-	unsigned char *decompress_jpeg_image_from_file(const char *pSrc_filename, int *width, int *height, int *actual_comps, int req_comps)
-	{
-		jpgd::jpeg_decoder_file_stream file_stream;
-		if (!file_stream.open(pSrc_filename))
-			return NULL;
-		return decompress_jpeg_image_from_stream(&file_stream, width, height, actual_comps, req_comps);
-	}
-
-} // namespace jpgd

crazy_functions/test_project/cpp/libJPG/jpgd.h

@@ -1,316 +0,0 @@
-// jpgd.h - C++ class for JPEG decompression.
-// Public domain, Rich Geldreich <richgel99@gmail.com>
-#ifndef JPEG_DECODER_H
-#define JPEG_DECODER_H
-
-#include <stdlib.h>
-#include <stdio.h>
-#include <setjmp.h>
-
-namespace jpgd
-{
-  typedef unsigned char  uint8;
-  typedef   signed short int16;
-  typedef unsigned short uint16;
-  typedef unsigned int   uint;
-  typedef   signed int   int32;
-
-  // Loads a JPEG image from a memory buffer or a file.
-  // req_comps can be 1 (grayscale), 3 (RGB), or 4 (RGBA).
-  // On return, width/height will be set to the image's dimensions, and actual_comps will be set to the either 1 (grayscale) or 3 (RGB).
-  // Notes: For more control over where and how the source data is read, see the decompress_jpeg_image_from_stream() function below, or call the jpeg_decoder class directly.
-  // Requesting a 8 or 32bpp image is currently a little faster than 24bpp because the jpeg_decoder class itself currently always unpacks to either 8 or 32bpp.
-// BEGIN EPIC MOD
-//unsigned char *decompress_jpeg_image_from_memory(const unsigned char *pSrc_data, int src_data_size, int *width, int *height, int *actual_comps, int req_comps);
-  unsigned char *decompress_jpeg_image_from_memory(const unsigned char *pSrc_data, int src_data_size, int *width, int *height, int *actual_comps, int req_comps, int format);
-// END EPIC MOD
-  unsigned char *decompress_jpeg_image_from_file(const char *pSrc_filename, int *width, int *height, int *actual_comps, int req_comps);
-
-  // Success/failure error codes.
-  enum jpgd_status
-  {
-    JPGD_SUCCESS = 0, JPGD_FAILED = -1, JPGD_DONE = 1,
-    JPGD_BAD_DHT_COUNTS = -256, JPGD_BAD_DHT_INDEX, JPGD_BAD_DHT_MARKER, JPGD_BAD_DQT_MARKER, JPGD_BAD_DQT_TABLE, 
-    JPGD_BAD_PRECISION, JPGD_BAD_HEIGHT, JPGD_BAD_WIDTH, JPGD_TOO_MANY_COMPONENTS, 
-    JPGD_BAD_SOF_LENGTH, JPGD_BAD_VARIABLE_MARKER, JPGD_BAD_DRI_LENGTH, JPGD_BAD_SOS_LENGTH,
-    JPGD_BAD_SOS_COMP_ID, JPGD_W_EXTRA_BYTES_BEFORE_MARKER, JPGD_NO_ARITHMITIC_SUPPORT, JPGD_UNEXPECTED_MARKER,
-    JPGD_NOT_JPEG, JPGD_UNSUPPORTED_MARKER, JPGD_BAD_DQT_LENGTH, JPGD_TOO_MANY_BLOCKS,
-    JPGD_UNDEFINED_QUANT_TABLE, JPGD_UNDEFINED_HUFF_TABLE, JPGD_NOT_SINGLE_SCAN, JPGD_UNSUPPORTED_COLORSPACE,
-    JPGD_UNSUPPORTED_SAMP_FACTORS, JPGD_DECODE_ERROR, JPGD_BAD_RESTART_MARKER, JPGD_ASSERTION_ERROR,
-    JPGD_BAD_SOS_SPECTRAL, JPGD_BAD_SOS_SUCCESSIVE, JPGD_STREAM_READ, JPGD_NOTENOUGHMEM
-  };
-    
-  // Input stream interface.
-  // Derive from this class to read input data from sources other than files or memory. Set m_eof_flag to true when no more data is available.
-  // The decoder is rather greedy: it will keep on calling this method until its internal input buffer is full, or until the EOF flag is set.
-  // It the input stream contains data after the JPEG stream's EOI (end of image) marker it will probably be pulled into the internal buffer.
-  // Call the get_total_bytes_read() method to determine the actual size of the JPEG stream after successful decoding.
-  class jpeg_decoder_stream
-  {
-  public:
-    jpeg_decoder_stream() { }
-    virtual ~jpeg_decoder_stream() { }
-
-    // The read() method is called when the internal input buffer is empty.
-    // Parameters:
-    // pBuf - input buffer
-    // max_bytes_to_read - maximum bytes that can be written to pBuf
-    // pEOF_flag - set this to true if at end of stream (no more bytes remaining)
-    // Returns -1 on error, otherwise return the number of bytes actually written to the buffer (which may be 0).
-    // Notes: This method will be called in a loop until you set *pEOF_flag to true or the internal buffer is full.
-    virtual int read(uint8 *pBuf, int max_bytes_to_read, bool *pEOF_flag) = 0;
-  };
-
-  // stdio FILE stream class.
-  class jpeg_decoder_file_stream : public jpeg_decoder_stream
-  {
-    jpeg_decoder_file_stream(const jpeg_decoder_file_stream &);
-    jpeg_decoder_file_stream &operator =(const jpeg_decoder_file_stream &);
-
-    FILE *m_pFile;
-    bool m_eof_flag, m_error_flag;
-
-  public:
-    jpeg_decoder_file_stream();
-    virtual ~jpeg_decoder_file_stream();
-    
-    bool open(const char *Pfilename);
-    void close();
-
-    virtual int read(uint8 *pBuf, int max_bytes_to_read, bool *pEOF_flag);
-  };
-
-  // Memory stream class.
-  class jpeg_decoder_mem_stream : public jpeg_decoder_stream
-  {
-    const uint8 *m_pSrc_data;
-    uint m_ofs, m_size;
-
-  public:
-    jpeg_decoder_mem_stream() : m_pSrc_data(NULL), m_ofs(0), m_size(0) { }
-    jpeg_decoder_mem_stream(const uint8 *pSrc_data, uint size) : m_pSrc_data(pSrc_data), m_ofs(0), m_size(size) { }
-
-    virtual ~jpeg_decoder_mem_stream() { }
-
-    bool open(const uint8 *pSrc_data, uint size);
-    void close() { m_pSrc_data = NULL; m_ofs = 0; m_size = 0; }
-    
-    virtual int read(uint8 *pBuf, int max_bytes_to_read, bool *pEOF_flag);
-  };
-
-  // Loads JPEG file from a jpeg_decoder_stream.
-  unsigned char *decompress_jpeg_image_from_stream(jpeg_decoder_stream *pStream, int *width, int *height, int *actual_comps, int req_comps);
-
-  enum 
-  { 
-    JPGD_IN_BUF_SIZE = 8192, JPGD_MAX_BLOCKS_PER_MCU = 10, JPGD_MAX_HUFF_TABLES = 8, JPGD_MAX_QUANT_TABLES = 4, 
-    JPGD_MAX_COMPONENTS = 4, JPGD_MAX_COMPS_IN_SCAN = 4, JPGD_MAX_BLOCKS_PER_ROW = 8192, JPGD_MAX_HEIGHT = 16384, JPGD_MAX_WIDTH = 16384 
-  };
-          
-  typedef int16 jpgd_quant_t;
-  typedef int16 jpgd_block_t;
-
-  class jpeg_decoder
-  {
-  public:
-    // Call get_error_code() after constructing to determine if the stream is valid or not. You may call the get_width(), get_height(), etc.
-    // methods after the constructor is called. You may then either destruct the object, or begin decoding the image by calling begin_decoding(), then decode() on each scanline.
-    jpeg_decoder(jpeg_decoder_stream *pStream);
-
-    ~jpeg_decoder();
-
-    // Call this method after constructing the object to begin decompression.
-    // If JPGD_SUCCESS is returned you may then call decode() on each scanline.
-    int begin_decoding();
-
-    // Returns the next scan line.
-    // For grayscale images, pScan_line will point to a buffer containing 8-bit pixels (get_bytes_per_pixel() will return 1). 
-    // Otherwise, it will always point to a buffer containing 32-bit RGBA pixels (A will always be 255, and get_bytes_per_pixel() will return 4).
-    // Returns JPGD_SUCCESS if a scan line has been returned.
-    // Returns JPGD_DONE if all scan lines have been returned.
-    // Returns JPGD_FAILED if an error occurred. Call get_error_code() for a more info.
-    int decode(const void** pScan_line, uint* pScan_line_len);
-    
-    inline jpgd_status get_error_code() const { return m_error_code; }
-
-    inline int get_width() const { return m_image_x_size; }
-    inline int get_height() const { return m_image_y_size; }
-
-    inline int get_num_components() const { return m_comps_in_frame; }
-
-    inline int get_bytes_per_pixel() const { return m_dest_bytes_per_pixel; }
-    inline int get_bytes_per_scan_line() const { return m_image_x_size * get_bytes_per_pixel(); }
-
-    // Returns the total number of bytes actually consumed by the decoder (which should equal the actual size of the JPEG file).
-    inline int get_total_bytes_read() const { return m_total_bytes_read; }
-    
-  private:
-    jpeg_decoder(const jpeg_decoder &);
-    jpeg_decoder &operator =(const jpeg_decoder &);
-
-    typedef void (*pDecode_block_func)(jpeg_decoder *, int, int, int);
-
-    struct huff_tables
-    {
-      bool ac_table;
-      uint  look_up[256];
-      uint  look_up2[256];
-      uint8 code_size[256];
-      uint  tree[512];
-    };
-
-    struct coeff_buf
-    {
-      uint8 *pData;
-      int block_num_x, block_num_y;
-      int block_len_x, block_len_y;
-      int block_size;
-    };
-
-    struct mem_block
-    {
-      mem_block *m_pNext;
-      size_t m_used_count;
-      size_t m_size;
-      char m_data[1];
-    };
-
-    jmp_buf m_jmp_state;
-    mem_block *m_pMem_blocks;
-    int m_image_x_size;
-    int m_image_y_size;
-    jpeg_decoder_stream *m_pStream;
-    int m_progressive_flag;
-    uint8 m_huff_ac[JPGD_MAX_HUFF_TABLES];
-    uint8* m_huff_num[JPGD_MAX_HUFF_TABLES];      // pointer to number of Huffman codes per bit size
-    uint8* m_huff_val[JPGD_MAX_HUFF_TABLES];      // pointer to Huffman codes per bit size
-    jpgd_quant_t* m_quant[JPGD_MAX_QUANT_TABLES]; // pointer to quantization tables
-    int m_scan_type;                              // Gray, Yh1v1, Yh1v2, Yh2v1, Yh2v2 (CMYK111, CMYK4114 no longer supported)
-    int m_comps_in_frame;                         // # of components in frame
-    int m_comp_h_samp[JPGD_MAX_COMPONENTS];       // component's horizontal sampling factor
-    int m_comp_v_samp[JPGD_MAX_COMPONENTS];       // component's vertical sampling factor
-    int m_comp_quant[JPGD_MAX_COMPONENTS];        // component's quantization table selector
-    int m_comp_ident[JPGD_MAX_COMPONENTS];        // component's ID
-    int m_comp_h_blocks[JPGD_MAX_COMPONENTS];
-    int m_comp_v_blocks[JPGD_MAX_COMPONENTS];
-    int m_comps_in_scan;                          // # of components in scan
-    int m_comp_list[JPGD_MAX_COMPS_IN_SCAN];      // components in this scan
-    int m_comp_dc_tab[JPGD_MAX_COMPONENTS];       // component's DC Huffman coding table selector
-    int m_comp_ac_tab[JPGD_MAX_COMPONENTS];       // component's AC Huffman coding table selector
-    int m_spectral_start;                         // spectral selection start
-    int m_spectral_end;                           // spectral selection end
-    int m_successive_low;                         // successive approximation low
-    int m_successive_high;                        // successive approximation high
-    int m_max_mcu_x_size;                         // MCU's max. X size in pixels
-    int m_max_mcu_y_size;                         // MCU's max. Y size in pixels
-    int m_blocks_per_mcu;
-    int m_max_blocks_per_row;
-    int m_mcus_per_row, m_mcus_per_col;
-    int m_mcu_org[JPGD_MAX_BLOCKS_PER_MCU];
-    int m_total_lines_left;                       // total # lines left in image
-    int m_mcu_lines_left;                         // total # lines left in this MCU
-    int m_real_dest_bytes_per_scan_line;
-    int m_dest_bytes_per_scan_line;               // rounded up
-    int m_dest_bytes_per_pixel;                   // 4 (RGB) or 1 (Y)
-    huff_tables* m_pHuff_tabs[JPGD_MAX_HUFF_TABLES];
-    coeff_buf* m_dc_coeffs[JPGD_MAX_COMPONENTS];
-    coeff_buf* m_ac_coeffs[JPGD_MAX_COMPONENTS];
-    int m_eob_run;
-    int m_block_y_mcu[JPGD_MAX_COMPONENTS];
-    uint8* m_pIn_buf_ofs;
-    int m_in_buf_left;
-    int m_tem_flag;
-    bool m_eof_flag;
-    uint8 m_in_buf_pad_start[128];
-    uint8 m_in_buf[JPGD_IN_BUF_SIZE + 128];
-    uint8 m_in_buf_pad_end[128];
-    int m_bits_left;
-    uint m_bit_buf;
-    int m_restart_interval;
-    int m_restarts_left;
-    int m_next_restart_num;
-    int m_max_mcus_per_row;
-    int m_max_blocks_per_mcu;
-    int m_expanded_blocks_per_mcu;
-    int m_expanded_blocks_per_row;
-    int m_expanded_blocks_per_component;
-    bool  m_freq_domain_chroma_upsample;
-    int m_max_mcus_per_col;
-    uint m_last_dc_val[JPGD_MAX_COMPONENTS];
-    jpgd_block_t* m_pMCU_coefficients;
-    int m_mcu_block_max_zag[JPGD_MAX_BLOCKS_PER_MCU];
-    uint8* m_pSample_buf;
-    int m_crr[256];
-    int m_cbb[256];
-    int m_crg[256];
-    int m_cbg[256];
-    uint8* m_pScan_line_0;
-    uint8* m_pScan_line_1;
-    jpgd_status m_error_code;
-    bool m_ready_flag;
-    int m_total_bytes_read;
-
-    void free_all_blocks();
-    // BEGIN EPIC MOD
-    UE_NORETURN void stop_decoding(jpgd_status status);
-    // END EPIC MOD
-    void *alloc(size_t n, bool zero = false);
-    void word_clear(void *p, uint16 c, uint n);
-    void prep_in_buffer();
-    void read_dht_marker();
-    void read_dqt_marker();
-    void read_sof_marker();
-    void skip_variable_marker();
-    void read_dri_marker();
-    void read_sos_marker();
-    int next_marker();
-    int process_markers();
-    void locate_soi_marker();
-    void locate_sof_marker();
-    int locate_sos_marker();
-    void init(jpeg_decoder_stream * pStream);
-    void create_look_ups();
-    void fix_in_buffer();
-    void transform_mcu(int mcu_row);
-    void transform_mcu_expand(int mcu_row);
-    coeff_buf* coeff_buf_open(int block_num_x, int block_num_y, int block_len_x, int block_len_y);
-    inline jpgd_block_t *coeff_buf_getp(coeff_buf *cb, int block_x, int block_y);
-    void load_next_row();
-    void decode_next_row();
-    void make_huff_table(int index, huff_tables *pH);
-    void check_quant_tables();
-    void check_huff_tables();
-    void calc_mcu_block_order();
-    int init_scan();
-    void init_frame();
-    void process_restart();
-    void decode_scan(pDecode_block_func decode_block_func);
-    void init_progressive();
-    void init_sequential();
-    void decode_start();
-    void decode_init(jpeg_decoder_stream * pStream);
-    void H2V2Convert();
-    void H2V1Convert();
-    void H1V2Convert();
-    void H1V1Convert();
-    void gray_convert();
-    void expanded_convert();
-    void find_eoi();
-    inline uint get_char();
-    inline uint get_char(bool *pPadding_flag);
-    inline void stuff_char(uint8 q);
-    inline uint8 get_octet();
-    inline uint get_bits(int num_bits);
-    inline uint get_bits_no_markers(int numbits);
-    inline int huff_decode(huff_tables *pH);
-    inline int huff_decode(huff_tables *pH, int& extrabits);
-    static inline uint8 clamp(int i);
-    static void decode_block_dc_first(jpeg_decoder *pD, int component_id, int block_x, int block_y);
-    static void decode_block_dc_refine(jpeg_decoder *pD, int component_id, int block_x, int block_y);
-    static void decode_block_ac_first(jpeg_decoder *pD, int component_id, int block_x, int block_y);
-    static void decode_block_ac_refine(jpeg_decoder *pD, int component_id, int block_x, int block_y);
-  };
-  
-} // namespace jpgd
-
-#endif // JPEG_DECODER_H

crazy_functions/test_project/cpp/libJPG/jpge.cpp

@@ -1,1049 +0,0 @@
-// jpge.cpp - C++ class for JPEG compression.
-// Public domain, Rich Geldreich <richgel99@gmail.com>
-// v1.01, Dec. 18, 2010 - Initial release
-// v1.02, Apr. 6, 2011 - Removed 2x2 ordered dither in H2V1 chroma subsampling method load_block_16_8_8(). (The rounding factor was 2, when it should have been 1. Either way, it wasn't helping.)
-// v1.03, Apr. 16, 2011 - Added support for optimized Huffman code tables, optimized dynamic memory allocation down to only 1 alloc.
-//                        Also from Alex Evans: Added RGBA support, linear memory allocator (no longer needed in v1.03).
-// v1.04, May. 19, 2012: Forgot to set m_pFile ptr to NULL in cfile_stream::close(). Thanks to Owen Kaluza for reporting this bug.
-//                       Code tweaks to fix VS2008 static code analysis warnings (all looked harmless).
-//                       Code review revealed method load_block_16_8_8() (used for the non-default H2V1 sampling mode to downsample chroma) somehow didn't get the rounding factor fix from v1.02.
-
-#include "jpge.h"
-
-#include <stdlib.h>
-#include <string.h>
-#if PLATFORM_WINDOWS
-#include <malloc.h>
-#endif
-
-#define JPGE_MAX(a,b) (((a)>(b))?(a):(b))
-#define JPGE_MIN(a,b) (((a)<(b))?(a):(b))
-
-namespace jpge {
-
-static inline void *jpge_malloc(size_t nSize) { return FMemory::Malloc(nSize); }
-static inline void jpge_free(void *p) { FMemory::Free(p);; }
-
-// Various JPEG enums and tables.
-enum { M_SOF0 = 0xC0, M_DHT = 0xC4, M_SOI = 0xD8, M_EOI = 0xD9, M_SOS = 0xDA, M_DQT = 0xDB, M_APP0 = 0xE0 };
-enum { DC_LUM_CODES = 12, AC_LUM_CODES = 256, DC_CHROMA_CODES = 12, AC_CHROMA_CODES = 256, MAX_HUFF_SYMBOLS = 257, MAX_HUFF_CODESIZE = 32 };
-
-static uint8 s_zag[64] = { 0,1,8,16,9,2,3,10,17,24,32,25,18,11,4,5,12,19,26,33,40,48,41,34,27,20,13,6,7,14,21,28,35,42,49,56,57,50,43,36,29,22,15,23,30,37,44,51,58,59,52,45,38,31,39,46,53,60,61,54,47,55,62,63 };
-static int16 s_std_lum_quant[64] = { 16,11,12,14,12,10,16,14,13,14,18,17,16,19,24,40,26,24,22,22,24,49,35,37,29,40,58,51,61,60,57,51,56,55,64,72,92,78,64,68,87,69,55,56,80,109,81,87,95,98,103,104,103,62,77,113,121,112,100,120,92,101,103,99 };
-static int16 s_std_croma_quant[64] = { 17,18,18,24,21,24,47,26,26,47,99,66,56,66,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99 };
-static uint8 s_dc_lum_bits[17] = { 0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0 };
-static uint8 s_dc_lum_val[DC_LUM_CODES] = { 0,1,2,3,4,5,6,7,8,9,10,11 };
-static uint8 s_ac_lum_bits[17] = { 0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,0x7d };
-static uint8 s_ac_lum_val[AC_LUM_CODES]  =
-{
-  0x01,0x02,0x03,0x00,0x04,0x11,0x05,0x12,0x21,0x31,0x41,0x06,0x13,0x51,0x61,0x07,0x22,0x71,0x14,0x32,0x81,0x91,0xa1,0x08,0x23,0x42,0xb1,0xc1,0x15,0x52,0xd1,0xf0,
-  0x24,0x33,0x62,0x72,0x82,0x09,0x0a,0x16,0x17,0x18,0x19,0x1a,0x25,0x26,0x27,0x28,0x29,0x2a,0x34,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,
-  0x4a,0x53,0x54,0x55,0x56,0x57,0x58,0x59,0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x83,0x84,0x85,0x86,0x87,0x88,0x89,
-  0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4,0xb5,0xb6,0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,
-  0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda,0xe1,0xe2,0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf1,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,
-  0xf9,0xfa
-};
-static uint8 s_dc_chroma_bits[17] = { 0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0 };
-static uint8 s_dc_chroma_val[DC_CHROMA_CODES]  = { 0,1,2,3,4,5,6,7,8,9,10,11 };
-static uint8 s_ac_chroma_bits[17] = { 0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,0x77 };
-static uint8 s_ac_chroma_val[AC_CHROMA_CODES] =
-{
-  0x00,0x01,0x02,0x03,0x11,0x04,0x05,0x21,0x31,0x06,0x12,0x41,0x51,0x07,0x61,0x71,0x13,0x22,0x32,0x81,0x08,0x14,0x42,0x91,0xa1,0xb1,0xc1,0x09,0x23,0x33,0x52,0xf0,
-  0x15,0x62,0x72,0xd1,0x0a,0x16,0x24,0x34,0xe1,0x25,0xf1,0x17,0x18,0x19,0x1a,0x26,0x27,0x28,0x29,0x2a,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,
-  0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58,0x59,0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x82,0x83,0x84,0x85,0x86,0x87,
-  0x88,0x89,0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4,0xb5,0xb6,0xb7,0xb8,0xb9,0xba,0xc2,0xc3,
-  0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda,0xe2,0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,
-  0xf9,0xfa
-};
-
-// Low-level helper functions.
-template <class T> inline void clear_obj(T &obj) { memset(&obj, 0, sizeof(obj)); }
-
-const int YR = 19595, YG = 38470, YB = 7471, CB_R = -11059, CB_G = -21709, CB_B = 32768, CR_R = 32768, CR_G = -27439, CR_B = -5329;
-static inline uint8 clamp(int i) { if (static_cast<uint>(i) > 255U) { if (i < 0) i = 0; else if (i > 255) i = 255; } return static_cast<uint8>(i); }
-
-static void RGB_to_YCC(uint8* pDst, const uint8 *pSrc, int num_pixels)
-{
-  for ( ; num_pixels; pDst += 3, pSrc += 3, num_pixels--)
-  {
-    const int r = pSrc[0], g = pSrc[1], b = pSrc[2];
-    pDst[0] = static_cast<uint8>((r * YR + g * YG + b * YB + 32768) >> 16);
-    pDst[1] = clamp(128 + ((r * CB_R + g * CB_G + b * CB_B + 32768) >> 16));
-    pDst[2] = clamp(128 + ((r * CR_R + g * CR_G + b * CR_B + 32768) >> 16));
-  }
-}
-
-static void RGB_to_Y(uint8* pDst, const uint8 *pSrc, int num_pixels)
-{
-  for ( ; num_pixels; pDst++, pSrc += 3, num_pixels--)
-    pDst[0] = static_cast<uint8>((pSrc[0] * YR + pSrc[1] * YG + pSrc[2] * YB + 32768) >> 16);
-}
-
-static void RGBA_to_YCC(uint8* pDst, const uint8 *pSrc, int num_pixels)
-{
-  for ( ; num_pixels; pDst += 3, pSrc += 4, num_pixels--)
-  {
-    const int r = pSrc[0], g = pSrc[1], b = pSrc[2];
-    pDst[0] = static_cast<uint8>((r * YR + g * YG + b * YB + 32768) >> 16);
-    pDst[1] = clamp(128 + ((r * CB_R + g * CB_G + b * CB_B + 32768) >> 16));
-    pDst[2] = clamp(128 + ((r * CR_R + g * CR_G + b * CR_B + 32768) >> 16));
-  }
-}
-
-static void RGBA_to_Y(uint8* pDst, const uint8 *pSrc, int num_pixels)
-{
-  for ( ; num_pixels; pDst++, pSrc += 4, num_pixels--)
-    pDst[0] = static_cast<uint8>((pSrc[0] * YR + pSrc[1] * YG + pSrc[2] * YB + 32768) >> 16);
-}
-
-static void Y_to_YCC(uint8* pDst, const uint8* pSrc, int num_pixels)
-{
-  for( ; num_pixels; pDst += 3, pSrc++, num_pixels--) { pDst[0] = pSrc[0]; pDst[1] = 128; pDst[2] = 128; }
-}
-
-// Forward DCT - DCT derived from jfdctint.
-#define CONST_BITS  13
-#define ROW_BITS    2
-#define DCT_DESCALE(x, n) (((x) + (((int32)1) << ((n) - 1))) >> (n))
-#define DCT_MUL(var, c) (static_cast<int16>(var) * static_cast<int32>(c))
-#define DCT1D(s0, s1, s2, s3, s4, s5, s6, s7) \
-  int32 t0 = s0 + s7, t7 = s0 - s7, t1 = s1 + s6, t6 = s1 - s6, t2 = s2 + s5, t5 = s2 - s5, t3 = s3 + s4, t4 = s3 - s4; \
-  int32 t10 = t0 + t3, t13 = t0 - t3, t11 = t1 + t2, t12 = t1 - t2; \
-  int32 u1 = DCT_MUL(t12 + t13, 4433); \
-  s2 = u1 + DCT_MUL(t13, 6270); \
-  s6 = u1 + DCT_MUL(t12, -15137); \
-  u1 = t4 + t7; \
-  int32 u2 = t5 + t6, u3 = t4 + t6, u4 = t5 + t7; \
-  int32 z5 = DCT_MUL(u3 + u4, 9633); \
-  t4 = DCT_MUL(t4, 2446); t5 = DCT_MUL(t5, 16819); \
-  t6 = DCT_MUL(t6, 25172); t7 = DCT_MUL(t7, 12299); \
-  u1 = DCT_MUL(u1, -7373); u2 = DCT_MUL(u2, -20995); \
-  u3 = DCT_MUL(u3, -16069); u4 = DCT_MUL(u4, -3196); \
-  u3 += z5; u4 += z5; \
-  s0 = t10 + t11; s1 = t7 + u1 + u4; s3 = t6 + u2 + u3; s4 = t10 - t11; s5 = t5 + u2 + u4; s7 = t4 + u1 + u3;
-
-static void DCT2D(int32 *p)
-{
-  int32 c, *q = p;
-  for (c = 7; c >= 0; c--, q += 8)
-  {
-    int32 s0 = q[0], s1 = q[1], s2 = q[2], s3 = q[3], s4 = q[4], s5 = q[5], s6 = q[6], s7 = q[7];
-    DCT1D(s0, s1, s2, s3, s4, s5, s6, s7);
-    q[0] = s0 << ROW_BITS; q[1] = DCT_DESCALE(s1, CONST_BITS-ROW_BITS); q[2] = DCT_DESCALE(s2, CONST_BITS-ROW_BITS); q[3] = DCT_DESCALE(s3, CONST_BITS-ROW_BITS);
-    q[4] = s4 << ROW_BITS; q[5] = DCT_DESCALE(s5, CONST_BITS-ROW_BITS); q[6] = DCT_DESCALE(s6, CONST_BITS-ROW_BITS); q[7] = DCT_DESCALE(s7, CONST_BITS-ROW_BITS);
-  }
-  for (q = p, c = 7; c >= 0; c--, q++)
-  {
-    int32 s0 = q[0*8], s1 = q[1*8], s2 = q[2*8], s3 = q[3*8], s4 = q[4*8], s5 = q[5*8], s6 = q[6*8], s7 = q[7*8];
-    DCT1D(s0, s1, s2, s3, s4, s5, s6, s7);
-    q[0*8] = DCT_DESCALE(s0, ROW_BITS+3); q[1*8] = DCT_DESCALE(s1, CONST_BITS+ROW_BITS+3); q[2*8] = DCT_DESCALE(s2, CONST_BITS+ROW_BITS+3); q[3*8] = DCT_DESCALE(s3, CONST_BITS+ROW_BITS+3);
-    q[4*8] = DCT_DESCALE(s4, ROW_BITS+3); q[5*8] = DCT_DESCALE(s5, CONST_BITS+ROW_BITS+3); q[6*8] = DCT_DESCALE(s6, CONST_BITS+ROW_BITS+3); q[7*8] = DCT_DESCALE(s7, CONST_BITS+ROW_BITS+3);
-  }
-}
-
-struct sym_freq { uint m_key, m_sym_index; };
-
-// Radix sorts sym_freq[] array by 32-bit key m_key. Returns ptr to sorted values.
-static inline sym_freq* radix_sort_syms(uint num_syms, sym_freq* pSyms0, sym_freq* pSyms1)
-{
-  const uint cMaxPasses = 4;
-  uint32 hist[256 * cMaxPasses]; clear_obj(hist);
-  for (uint i = 0; i < num_syms; i++) { uint freq = pSyms0[i].m_key; hist[freq & 0xFF]++; hist[256 + ((freq >> 8) & 0xFF)]++; hist[256*2 + ((freq >> 16) & 0xFF)]++; hist[256*3 + ((freq >> 24) & 0xFF)]++; }
-  sym_freq* pCur_syms = pSyms0, *pNew_syms = pSyms1;
-  uint total_passes = cMaxPasses; while ((total_passes > 1) && (num_syms == hist[(total_passes - 1) * 256])) total_passes--;
-  for (uint pass_shift = 0, pass = 0; pass < total_passes; pass++, pass_shift += 8)
-  {
-    const uint32* pHist = &hist[pass << 8];
-    uint offsets[256], cur_ofs = 0;
-    for (uint i = 0; i < 256; i++) { offsets[i] = cur_ofs; cur_ofs += pHist[i]; }
-    for (uint i = 0; i < num_syms; i++)
-      pNew_syms[offsets[(pCur_syms[i].m_key >> pass_shift) & 0xFF]++] = pCur_syms[i];
-    sym_freq* t = pCur_syms; pCur_syms = pNew_syms; pNew_syms = t;
-  }
-  return pCur_syms;
-}
-
-// calculate_minimum_redundancy() originally written by: Alistair Moffat, alistair@cs.mu.oz.au, Jyrki Katajainen, jyrki@diku.dk, November 1996.
-static void calculate_minimum_redundancy(sym_freq *A, int n)
-{
-  int root, leaf, next, avbl, used, dpth;
-  if (n==0) return; else if (n==1) { A[0].m_key = 1; return; }
-  A[0].m_key += A[1].m_key; root = 0; leaf = 2;
-  for (next=1; next < n-1; next++)
-  {
-    if (leaf>=n || A[root].m_key<A[leaf].m_key) { A[next].m_key = A[root].m_key; A[root++].m_key = next; } else A[next].m_key = A[leaf++].m_key;
-    if (leaf>=n || (root<next && A[root].m_key<A[leaf].m_key)) { A[next].m_key += A[root].m_key; A[root++].m_key = next; } else A[next].m_key += A[leaf++].m_key;
-  }
-  A[n-2].m_key = 0;
-  for (next=n-3; next>=0; next--) A[next].m_key = A[A[next].m_key].m_key+1;
-  avbl = 1; used = dpth = 0; root = n-2; next = n-1;
-  while (avbl>0)
-  {
-    while (root>=0 && (int)A[root].m_key==dpth) { used++; root--; }
-    while (avbl>used) { A[next--].m_key = dpth; avbl--; }
-    avbl = 2*used; dpth++; used = 0;
-  }
-}
-
-// Limits canonical Huffman code table's max code size to max_code_size.
-static void huffman_enforce_max_code_size(int *pNum_codes, int code_list_len, int max_code_size)
-{
-  if (code_list_len <= 1) return;
-
-  for (int i = max_code_size + 1; i <= MAX_HUFF_CODESIZE; i++) pNum_codes[max_code_size] += pNum_codes[i];
-
-  uint32 total = 0;
-  for (int i = max_code_size; i > 0; i--)
-    total += (((uint32)pNum_codes[i]) << (max_code_size - i));
-
-  while (total != (1UL << max_code_size))
-  {
-    pNum_codes[max_code_size]--;
-    for (int i = max_code_size - 1; i > 0; i--)
-    {
-      if (pNum_codes[i]) { pNum_codes[i]--; pNum_codes[i + 1] += 2; break; }
-    }
-    total--;
-  }
-}
-
-// Generates an optimized offman table.
-void jpeg_encoder::optimize_huffman_table(int table_num, int table_len)
-{
-  sym_freq syms0[MAX_HUFF_SYMBOLS], syms1[MAX_HUFF_SYMBOLS];
-  syms0[0].m_key = 1; syms0[0].m_sym_index = 0;  // dummy symbol, assures that no valid code contains all 1's
-  int num_used_syms = 1;
-  const uint32 *pSym_count = &m_huff_count[table_num][0];
-  for (int i = 0; i < table_len; i++)
-    if (pSym_count[i]) { syms0[num_used_syms].m_key = pSym_count[i]; syms0[num_used_syms++].m_sym_index = i + 1; }
-  sym_freq* pSyms = radix_sort_syms(num_used_syms, syms0, syms1);
-  calculate_minimum_redundancy(pSyms, num_used_syms);
-
-  // Count the # of symbols of each code size.
-  int num_codes[1 + MAX_HUFF_CODESIZE]; clear_obj(num_codes);
-  for (int i = 0; i < num_used_syms; i++)
-    num_codes[pSyms[i].m_key]++;
-
-  const uint JPGE_CODE_SIZE_LIMIT = 16; // the maximum possible size of a JPEG Huffman code (valid range is [9,16] - 9 vs. 8 because of the dummy symbol)
-  huffman_enforce_max_code_size(num_codes, num_used_syms, JPGE_CODE_SIZE_LIMIT);
-
-  // Compute m_huff_bits array, which contains the # of symbols per code size.
-  clear_obj(m_huff_bits[table_num]);
-  for (int i = 1; i <= (int)JPGE_CODE_SIZE_LIMIT; i++)
-    m_huff_bits[table_num][i] = static_cast<uint8>(num_codes[i]);
-
-  // Remove the dummy symbol added above, which must be in largest bucket.
-  for (int i = JPGE_CODE_SIZE_LIMIT; i >= 1; i--)
-  {
-    if (m_huff_bits[table_num][i]) { m_huff_bits[table_num][i]--; break; }
-  }
-
-  // Compute the m_huff_val array, which contains the symbol indices sorted by code size (smallest to largest).
-  for (int i = num_used_syms - 1; i >= 1; i--)
-    m_huff_val[table_num][num_used_syms - 1 - i] = static_cast<uint8>(pSyms[i].m_sym_index - 1);
-}
-
-// JPEG marker generation.
-void jpeg_encoder::emit_byte(uint8 i)
-{
-  m_all_stream_writes_succeeded = m_all_stream_writes_succeeded && m_pStream->put_obj(i);
-}
-
-void jpeg_encoder::emit_word(uint i)
-{
-  emit_byte(uint8(i >> 8)); emit_byte(uint8(i & 0xFF));
-}
-
-void jpeg_encoder::emit_marker(int marker)
-{
-  emit_byte(uint8(0xFF)); emit_byte(uint8(marker));
-}
-
-// Emit JFIF marker
-void jpeg_encoder::emit_jfif_app0()
-{
-  emit_marker(M_APP0);
-  emit_word(2 + 4 + 1 + 2 + 1 + 2 + 2 + 1 + 1);
-  emit_byte(0x4A); emit_byte(0x46); emit_byte(0x49); emit_byte(0x46); /* Identifier: ASCII "JFIF" */
-  emit_byte(0);
-  emit_byte(1);      /* Major version */
-  emit_byte(1);      /* Minor version */
-  emit_byte(0);      /* Density unit */
-  emit_word(1);
-  emit_word(1);
-  emit_byte(0);      /* No thumbnail image */
-  emit_byte(0);
-}
-
-// Emit quantization tables
-void jpeg_encoder::emit_dqt()
-{
-  for (int i = 0; i < ((m_num_components == 3) ? 2 : 1); i++)
-  {
-    emit_marker(M_DQT);
-    emit_word(64 + 1 + 2);
-    emit_byte(static_cast<uint8>(i));
-    for (int j = 0; j < 64; j++)
-      emit_byte(static_cast<uint8>(m_quantization_tables[i][j]));
-  }
-}
-
-// Emit start of frame marker
-void jpeg_encoder::emit_sof()
-{
-  emit_marker(M_SOF0);                           /* baseline */
-  emit_word(3 * m_num_components + 2 + 5 + 1);
-  emit_byte(8);                                  /* precision */
-  emit_word(m_image_y);
-  emit_word(m_image_x);
-  emit_byte(m_num_components);
-  for (int i = 0; i < m_num_components; i++)
-  {
-    emit_byte(static_cast<uint8>(i + 1));                                   /* component ID     */
-    emit_byte((m_comp_h_samp[i] << 4) + m_comp_v_samp[i]);  /* h and v sampling */
-    emit_byte(i > 0);                                   /* quant. table num */
-  }
-}
-
-// Emit Huffman table.
-void jpeg_encoder::emit_dht(uint8 *bits, uint8 *val, int index, bool ac_flag)
-{
-  emit_marker(M_DHT);
-
-  int length = 0;
-  for (int i = 1; i <= 16; i++)
-    length += bits[i];
-
-  emit_word(length + 2 + 1 + 16);
-  emit_byte(static_cast<uint8>(index + (ac_flag << 4)));
-
-  for (int i = 1; i <= 16; i++)
-    emit_byte(bits[i]);
-
-  for (int i = 0; i < length; i++)
-    emit_byte(val[i]);
-}
-
-// Emit all Huffman tables.
-void jpeg_encoder::emit_dhts()
-{
-  emit_dht(m_huff_bits[0+0], m_huff_val[0+0], 0, false);
-  emit_dht(m_huff_bits[2+0], m_huff_val[2+0], 0, true);
-  if (m_num_components == 3)
-  {
-    emit_dht(m_huff_bits[0+1], m_huff_val[0+1], 1, false);
-    emit_dht(m_huff_bits[2+1], m_huff_val[2+1], 1, true);
-  }
-}
-
-// emit start of scan
-void jpeg_encoder::emit_sos()
-{
-  emit_marker(M_SOS);
-  emit_word(2 * m_num_components + 2 + 1 + 3);
-  emit_byte(m_num_components);
-  for (int i = 0; i < m_num_components; i++)
-  {
-    emit_byte(static_cast<uint8>(i + 1));
-    if (i == 0)
-      emit_byte((0 << 4) + 0);
-    else
-      emit_byte((1 << 4) + 1);
-  }
-  emit_byte(0);     /* spectral selection */
-  emit_byte(63);
-  emit_byte(0);
-}
-
-// Emit all markers at beginning of image file.
-void jpeg_encoder::emit_markers()
-{
-  emit_marker(M_SOI);
-  emit_jfif_app0();
-  emit_dqt();
-  emit_sof();
-  emit_dhts();
-  emit_sos();
-}
-
-// Compute the actual canonical Huffman codes/code sizes given the JPEG huff bits and val arrays.
-void jpeg_encoder::compute_huffman_table(uint *codes, uint8 *code_sizes, uint8 *bits, uint8 *val)
-{
-  int i, l, last_p, si;
-  uint8 huff_size[257];
-  uint huff_code[257];
-  uint code;
-
-  int p = 0;
-  for (l = 1; l <= 16; l++)
-    for (i = 1; i <= bits[l]; i++)
-      huff_size[p++] = (char)l;
-
-  huff_size[p] = 0; last_p = p; // write sentinel
-
-  code = 0; si = huff_size[0]; p = 0;
-
-  while (huff_size[p])
-  {
-    while (huff_size[p] == si)
-      huff_code[p++] = code++;
-    code <<= 1;
-    si++;
-  }
-
-  memset(codes, 0, sizeof(codes[0])*256);
-  memset(code_sizes, 0, sizeof(code_sizes[0])*256);
-  for (p = 0; p < last_p; p++)
-  {
-    codes[val[p]]      = huff_code[p];
-    code_sizes[val[p]] = huff_size[p];
-  }
-}
-
-// Quantization table generation.
-void jpeg_encoder::compute_quant_table(int32 *pDst, int16 *pSrc)
-{
-  int32 q;
-  if (m_params.m_quality < 50)
-    q = 5000 / m_params.m_quality;
-  else
-    q = 200 - m_params.m_quality * 2;
-  for (int i = 0; i < 64; i++)
-  {
-    int32 j = *pSrc++; j = (j * q + 50L) / 100L;
-    *pDst++ = JPGE_MIN(JPGE_MAX(j, 1), 255);
-  }
-}
-
-// Higher-level methods.
-void jpeg_encoder::first_pass_init()
-{
-  m_bit_buffer = 0; m_bits_in = 0;
-  memset(m_last_dc_val, 0, 3 * sizeof(m_last_dc_val[0]));
-  m_mcu_y_ofs = 0;
-  m_pass_num = 1;
-}
-
-bool jpeg_encoder::second_pass_init()
-{
-  compute_huffman_table(&m_huff_codes[0+0][0], &m_huff_code_sizes[0+0][0], m_huff_bits[0+0], m_huff_val[0+0]);
-  compute_huffman_table(&m_huff_codes[2+0][0], &m_huff_code_sizes[2+0][0], m_huff_bits[2+0], m_huff_val[2+0]);
-  if (m_num_components > 1)
-  {
-    compute_huffman_table(&m_huff_codes[0+1][0], &m_huff_code_sizes[0+1][0], m_huff_bits[0+1], m_huff_val[0+1]);
-    compute_huffman_table(&m_huff_codes[2+1][0], &m_huff_code_sizes[2+1][0], m_huff_bits[2+1], m_huff_val[2+1]);
-  }
-  first_pass_init();
-  emit_markers();
-  m_pass_num = 2;
-  return true;
-}
-
-bool jpeg_encoder::jpg_open(int p_x_res, int p_y_res, int src_channels)
-{
-  m_num_components = 3;
-  switch (m_params.m_subsampling)
-  {
-    case Y_ONLY:
-    {
-      m_num_components = 1;
-      m_comp_h_samp[0] = 1; m_comp_v_samp[0] = 1;
-      m_mcu_x          = 8; m_mcu_y          = 8;
-      break;
-    }
-    case H1V1:
-    {
-      m_comp_h_samp[0] = 1; m_comp_v_samp[0] = 1;
-      m_comp_h_samp[1] = 1; m_comp_v_samp[1] = 1;
-      m_comp_h_samp[2] = 1; m_comp_v_samp[2] = 1;
-      m_mcu_x          = 8; m_mcu_y          = 8;
-      break;
-    }
-    case H2V1:
-    {
-      m_comp_h_samp[0] = 2; m_comp_v_samp[0] = 1;
-      m_comp_h_samp[1] = 1; m_comp_v_samp[1] = 1;
-      m_comp_h_samp[2] = 1; m_comp_v_samp[2] = 1;
-      m_mcu_x          = 16; m_mcu_y         = 8;
-      break;
-    }
-    case H2V2:
-    {
-      m_comp_h_samp[0] = 2; m_comp_v_samp[0] = 2;
-      m_comp_h_samp[1] = 1; m_comp_v_samp[1] = 1;
-      m_comp_h_samp[2] = 1; m_comp_v_samp[2] = 1;
-      m_mcu_x          = 16; m_mcu_y         = 16;
-    }
-  }
-
-  m_image_x        = p_x_res; m_image_y = p_y_res;
-  m_image_bpp      = src_channels;
-  m_image_bpl      = m_image_x * src_channels;
-  m_image_x_mcu    = (m_image_x + m_mcu_x - 1) & (~(m_mcu_x - 1));
-  m_image_y_mcu    = (m_image_y + m_mcu_y - 1) & (~(m_mcu_y - 1));
-  m_image_bpl_xlt  = m_image_x * m_num_components;
-  m_image_bpl_mcu  = m_image_x_mcu * m_num_components;
-  m_mcus_per_row   = m_image_x_mcu / m_mcu_x;
-
-  if ((m_mcu_lines[0] = static_cast<uint8*>(jpge_malloc(m_image_bpl_mcu * m_mcu_y))) == NULL) return false;
-  for (int i = 1; i < m_mcu_y; i++)
-    m_mcu_lines[i] = m_mcu_lines[i-1] + m_image_bpl_mcu;
-
-  compute_quant_table(m_quantization_tables[0], s_std_lum_quant);
-  compute_quant_table(m_quantization_tables[1], m_params.m_no_chroma_discrim_flag ? s_std_lum_quant : s_std_croma_quant);
-
-  m_out_buf_left = JPGE_OUT_BUF_SIZE;
-  m_pOut_buf = m_out_buf;
-
-  if (m_params.m_two_pass_flag)
-  {
-    clear_obj(m_huff_count);
-    first_pass_init();
-  }
-  else
-  {
-    memcpy(m_huff_bits[0+0], s_dc_lum_bits, 17);    memcpy(m_huff_val [0+0], s_dc_lum_val, DC_LUM_CODES);
-    memcpy(m_huff_bits[2+0], s_ac_lum_bits, 17);    memcpy(m_huff_val [2+0], s_ac_lum_val, AC_LUM_CODES);
-    memcpy(m_huff_bits[0+1], s_dc_chroma_bits, 17); memcpy(m_huff_val [0+1], s_dc_chroma_val, DC_CHROMA_CODES);
-    memcpy(m_huff_bits[2+1], s_ac_chroma_bits, 17); memcpy(m_huff_val [2+1], s_ac_chroma_val, AC_CHROMA_CODES);
-    if (!second_pass_init()) return false;   // in effect, skip over the first pass
-  }
-  return m_all_stream_writes_succeeded;
-}
-
-void jpeg_encoder::load_block_8_8_grey(int x)
-{
-  uint8 *pSrc;
-  sample_array_t *pDst = m_sample_array;
-  x <<= 3;
-  for (int i = 0; i < 8; i++, pDst += 8)
-  {
-    pSrc = m_mcu_lines[i] + x;
-    pDst[0] = pSrc[0] - 128; pDst[1] = pSrc[1] - 128; pDst[2] = pSrc[2] - 128; pDst[3] = pSrc[3] - 128;
-    pDst[4] = pSrc[4] - 128; pDst[5] = pSrc[5] - 128; pDst[6] = pSrc[6] - 128; pDst[7] = pSrc[7] - 128;
-  }
-}
-
-void jpeg_encoder::load_block_8_8(int x, int y, int c)
-{
-  uint8 *pSrc;
-  sample_array_t *pDst = m_sample_array;
-  x = (x * (8 * 3)) + c;
-  y <<= 3;
-  for (int i = 0; i < 8; i++, pDst += 8)
-  {
-    pSrc = m_mcu_lines[y + i] + x;
-    pDst[0] = pSrc[0 * 3] - 128; pDst[1] = pSrc[1 * 3] - 128; pDst[2] = pSrc[2 * 3] - 128; pDst[3] = pSrc[3 * 3] - 128;
-    pDst[4] = pSrc[4 * 3] - 128; pDst[5] = pSrc[5 * 3] - 128; pDst[6] = pSrc[6 * 3] - 128; pDst[7] = pSrc[7 * 3] - 128;
-  }
-}
-
-void jpeg_encoder::load_block_16_8(int x, int c)
-{
-  uint8 *pSrc1, *pSrc2;
-  sample_array_t *pDst = m_sample_array;
-  x = (x * (16 * 3)) + c;
-  int a = 0, b = 2;
-  for (int i = 0; i < 16; i += 2, pDst += 8)
-  {
-    pSrc1 = m_mcu_lines[i + 0] + x;
-    pSrc2 = m_mcu_lines[i + 1] + x;
-    pDst[0] = ((pSrc1[ 0 * 3] + pSrc1[ 1 * 3] + pSrc2[ 0 * 3] + pSrc2[ 1 * 3] + a) >> 2) - 128; pDst[1] = ((pSrc1[ 2 * 3] + pSrc1[ 3 * 3] + pSrc2[ 2 * 3] + pSrc2[ 3 * 3] + b) >> 2) - 128;
-    pDst[2] = ((pSrc1[ 4 * 3] + pSrc1[ 5 * 3] + pSrc2[ 4 * 3] + pSrc2[ 5 * 3] + a) >> 2) - 128; pDst[3] = ((pSrc1[ 6 * 3] + pSrc1[ 7 * 3] + pSrc2[ 6 * 3] + pSrc2[ 7 * 3] + b) >> 2) - 128;
-    pDst[4] = ((pSrc1[ 8 * 3] + pSrc1[ 9 * 3] + pSrc2[ 8 * 3] + pSrc2[ 9 * 3] + a) >> 2) - 128; pDst[5] = ((pSrc1[10 * 3] + pSrc1[11 * 3] + pSrc2[10 * 3] + pSrc2[11 * 3] + b) >> 2) - 128;
-    pDst[6] = ((pSrc1[12 * 3] + pSrc1[13 * 3] + pSrc2[12 * 3] + pSrc2[13 * 3] + a) >> 2) - 128; pDst[7] = ((pSrc1[14 * 3] + pSrc1[15 * 3] + pSrc2[14 * 3] + pSrc2[15 * 3] + b) >> 2) - 128;
-    int temp = a; a = b; b = temp;
-  }
-}
-
-void jpeg_encoder::load_block_16_8_8(int x, int c)
-{
-  uint8 *pSrc1;
-  sample_array_t *pDst = m_sample_array;
-  x = (x * (16 * 3)) + c;
-  for (int i = 0; i < 8; i++, pDst += 8)
-  {
-    pSrc1 = m_mcu_lines[i + 0] + x;
-    pDst[0] = ((pSrc1[ 0 * 3] + pSrc1[ 1 * 3]) >> 1) - 128; pDst[1] = ((pSrc1[ 2 * 3] + pSrc1[ 3 * 3]) >> 1) - 128;
-    pDst[2] = ((pSrc1[ 4 * 3] + pSrc1[ 5 * 3]) >> 1) - 128; pDst[3] = ((pSrc1[ 6 * 3] + pSrc1[ 7 * 3]) >> 1) - 128;
-    pDst[4] = ((pSrc1[ 8 * 3] + pSrc1[ 9 * 3]) >> 1) - 128; pDst[5] = ((pSrc1[10 * 3] + pSrc1[11 * 3]) >> 1) - 128;
-    pDst[6] = ((pSrc1[12 * 3] + pSrc1[13 * 3]) >> 1) - 128; pDst[7] = ((pSrc1[14 * 3] + pSrc1[15 * 3]) >> 1) - 128;
-  }
-}
-
-void jpeg_encoder::load_quantized_coefficients(int component_num)
-{
-  int32 *q = m_quantization_tables[component_num > 0];
-  int16 *pDst = m_coefficient_array;
-  for (int i = 0; i < 64; i++)
-  {
-    sample_array_t j = m_sample_array[s_zag[i]];
-    if (j < 0)
-    {
-      if ((j = -j + (*q >> 1)) < *q)
-        *pDst++ = 0;
-      else
-        *pDst++ = static_cast<int16>(-(j / *q));
-    }
-    else
-    {
-      if ((j = j + (*q >> 1)) < *q)
-        *pDst++ = 0;
-      else
-        *pDst++ = static_cast<int16>((j / *q));
-    }
-    q++;
-  }
-}
-
-void jpeg_encoder::flush_output_buffer()
-{
-  if (m_out_buf_left != JPGE_OUT_BUF_SIZE)
-    m_all_stream_writes_succeeded = m_all_stream_writes_succeeded && m_pStream->put_buf(m_out_buf, JPGE_OUT_BUF_SIZE - m_out_buf_left);
-  m_pOut_buf = m_out_buf;
-  m_out_buf_left = JPGE_OUT_BUF_SIZE;
-}
-
-void jpeg_encoder::put_bits(uint bits, uint len)
-{
-  m_bit_buffer |= ((uint32)bits << (24 - (m_bits_in += len)));
-  while (m_bits_in >= 8)
-  {
-    uint8 c;
-    #define JPGE_PUT_BYTE(c) { *m_pOut_buf++ = (c); if (--m_out_buf_left == 0) flush_output_buffer(); }
-    JPGE_PUT_BYTE(c = (uint8)((m_bit_buffer >> 16) & 0xFF));
-    if (c == 0xFF) JPGE_PUT_BYTE(0);
-    m_bit_buffer <<= 8;
-    m_bits_in -= 8;
-  }
-}
-
-void jpeg_encoder::code_coefficients_pass_one(int component_num)
-{
-  if (component_num >= 3) return; // just to shut up static analysis
-  int i, run_len, nbits, temp1;
-  int16 *src = m_coefficient_array;
-  uint32 *dc_count = component_num ? m_huff_count[0 + 1] : m_huff_count[0 + 0], *ac_count = component_num ? m_huff_count[2 + 1] : m_huff_count[2 + 0];
-
-  temp1 = src[0] - m_last_dc_val[component_num];
-  m_last_dc_val[component_num] = src[0];
-  if (temp1 < 0) temp1 = -temp1;
-
-  nbits = 0;
-  while (temp1)
-  {
-    nbits++; temp1 >>= 1;
-  }
-
-  dc_count[nbits]++;
-  for (run_len = 0, i = 1; i < 64; i++)
-  {
-    if ((temp1 = m_coefficient_array[i]) == 0)
-      run_len++;
-    else
-    {
-      while (run_len >= 16)
-      {
-        ac_count[0xF0]++;
-        run_len -= 16;
-      }
-      if (temp1 < 0) temp1 = -temp1;
-      nbits = 1;
-      while (temp1 >>= 1) nbits++;
-      ac_count[(run_len << 4) + nbits]++;
-      run_len = 0;
-    }
-  }
-  if (run_len) ac_count[0]++;
-}
-
-void jpeg_encoder::code_coefficients_pass_two(int component_num)
-{
-  int i, j, run_len, nbits, temp1, temp2;
-  int16 *pSrc = m_coefficient_array;
-  uint *codes[2];
-  uint8 *code_sizes[2];
-
-  if (component_num == 0)
-  {
-    codes[0] = m_huff_codes[0 + 0]; codes[1] = m_huff_codes[2 + 0];
-    code_sizes[0] = m_huff_code_sizes[0 + 0]; code_sizes[1] = m_huff_code_sizes[2 + 0];
-  }
-  else
-  {
-    codes[0] = m_huff_codes[0 + 1]; codes[1] = m_huff_codes[2 + 1];
-    code_sizes[0] = m_huff_code_sizes[0 + 1]; code_sizes[1] = m_huff_code_sizes[2 + 1];
-  }
-
-  temp1 = temp2 = pSrc[0] - m_last_dc_val[component_num];
-  m_last_dc_val[component_num] = pSrc[0];
-
-  if (temp1 < 0)
-  {
-    temp1 = -temp1; temp2--;
-  }
-
-  nbits = 0;
-  while (temp1)
-  {
-    nbits++; temp1 >>= 1;
-  }
-
-  put_bits(codes[0][nbits], code_sizes[0][nbits]);
-  if (nbits) put_bits(temp2 & ((1 << nbits) - 1), nbits);
-
-  for (run_len = 0, i = 1; i < 64; i++)
-  {
-    if ((temp1 = m_coefficient_array[i]) == 0)
-      run_len++;
-    else
-    {
-      while (run_len >= 16)
-      {
-        put_bits(codes[1][0xF0], code_sizes[1][0xF0]);
-        run_len -= 16;
-      }
-      if ((temp2 = temp1) < 0)
-      {
-        temp1 = -temp1;
-        temp2--;
-      }
-      nbits = 1;
-      while (temp1 >>= 1)
-        nbits++;
-      j = (run_len << 4) + nbits;
-      put_bits(codes[1][j], code_sizes[1][j]);
-      put_bits(temp2 & ((1 << nbits) - 1), nbits);
-      run_len = 0;
-    }
-  }
-  if (run_len)
-    put_bits(codes[1][0], code_sizes[1][0]);
-}
-
-void jpeg_encoder::code_block(int component_num)
-{
-  DCT2D(m_sample_array);
-  load_quantized_coefficients(component_num);
-  if (m_pass_num == 1)
-    code_coefficients_pass_one(component_num);
-  else
-    code_coefficients_pass_two(component_num);
-}
-
-void jpeg_encoder::process_mcu_row()
-{
-  if (m_num_components == 1)
-  {
-    for (int i = 0; i < m_mcus_per_row; i++)
-    {
-      load_block_8_8_grey(i); code_block(0);
-    }
-  }
-  else if ((m_comp_h_samp[0] == 1) && (m_comp_v_samp[0] == 1))
-  {
-    for (int i = 0; i < m_mcus_per_row; i++)
-    {
-      load_block_8_8(i, 0, 0); code_block(0); load_block_8_8(i, 0, 1); code_block(1); load_block_8_8(i, 0, 2); code_block(2);
-    }
-  }
-  else if ((m_comp_h_samp[0] == 2) && (m_comp_v_samp[0] == 1))
-  {
-    for (int i = 0; i < m_mcus_per_row; i++)
-    {
-      load_block_8_8(i * 2 + 0, 0, 0); code_block(0); load_block_8_8(i * 2 + 1, 0, 0); code_block(0);
-      load_block_16_8_8(i, 1); code_block(1); load_block_16_8_8(i, 2); code_block(2);
-    }
-  }
-  else if ((m_comp_h_samp[0] == 2) && (m_comp_v_samp[0] == 2))
-  {
-    for (int i = 0; i < m_mcus_per_row; i++)
-    {
-      load_block_8_8(i * 2 + 0, 0, 0); code_block(0); load_block_8_8(i * 2 + 1, 0, 0); code_block(0);
-      load_block_8_8(i * 2 + 0, 1, 0); code_block(0); load_block_8_8(i * 2 + 1, 1, 0); code_block(0);
-      load_block_16_8(i, 1); code_block(1); load_block_16_8(i, 2); code_block(2);
-    }
-  }
-}
-
-bool jpeg_encoder::terminate_pass_one()
-{
-  optimize_huffman_table(0+0, DC_LUM_CODES); optimize_huffman_table(2+0, AC_LUM_CODES);
-  if (m_num_components > 1)
-  {
-    optimize_huffman_table(0+1, DC_CHROMA_CODES); optimize_huffman_table(2+1, AC_CHROMA_CODES);
-  }
-  return second_pass_init();
-}
-
-bool jpeg_encoder::terminate_pass_two()
-{
-  put_bits(0x7F, 7);
-  flush_output_buffer();
-  emit_marker(M_EOI);
-  m_pass_num++; // purposely bump up m_pass_num, for debugging
-  return true;
-}
-
-bool jpeg_encoder::process_end_of_image()
-{
-  if (m_mcu_y_ofs)
-  {
-    if (m_mcu_y_ofs < 16) // check here just to shut up static analysis
-    {
-      for (int i = m_mcu_y_ofs; i < m_mcu_y; i++)
-        memcpy(m_mcu_lines[i], m_mcu_lines[m_mcu_y_ofs - 1], m_image_bpl_mcu);
-    }
-
-    process_mcu_row();
-  }
-
-  if (m_pass_num == 1)
-    return terminate_pass_one();
-  else
-    return terminate_pass_two();
-}
-
-void jpeg_encoder::load_mcu(const void *pSrc)
-{
-  const uint8* Psrc = reinterpret_cast<const uint8*>(pSrc);
-
-  uint8* pDst = m_mcu_lines[m_mcu_y_ofs]; // OK to write up to m_image_bpl_xlt bytes to pDst
-
-  if (m_num_components == 1)
-  {
-    if (m_image_bpp == 4)
-      RGBA_to_Y(pDst, Psrc, m_image_x);
-    else if (m_image_bpp == 3)
-      RGB_to_Y(pDst, Psrc, m_image_x);
-    else
-      memcpy(pDst, Psrc, m_image_x);
-  }
-  else
-  {
-    if (m_image_bpp == 4)
-      RGBA_to_YCC(pDst, Psrc, m_image_x);
-    else if (m_image_bpp == 3)
-      RGB_to_YCC(pDst, Psrc, m_image_x);
-    else
-      Y_to_YCC(pDst, Psrc, m_image_x);
-  }
-
-  // Possibly duplicate pixels at end of scanline if not a multiple of 8 or 16
-  if (m_num_components == 1)
-    memset(m_mcu_lines[m_mcu_y_ofs] + m_image_bpl_xlt, pDst[m_image_bpl_xlt - 1], m_image_x_mcu - m_image_x);
-  else
-  {
-    const uint8 y = pDst[m_image_bpl_xlt - 3 + 0], cb = pDst[m_image_bpl_xlt - 3 + 1], cr = pDst[m_image_bpl_xlt - 3 + 2];
-    uint8 *q = m_mcu_lines[m_mcu_y_ofs] + m_image_bpl_xlt;
-    for (int i = m_image_x; i < m_image_x_mcu; i++)
-    {
-      *q++ = y; *q++ = cb; *q++ = cr;
-    }
-  }
-
-  if (++m_mcu_y_ofs == m_mcu_y)
-  {
-    process_mcu_row();
-    m_mcu_y_ofs = 0;
-  }
-}
-
-void jpeg_encoder::clear()
-{
-  m_mcu_lines[0] = NULL;
-  m_pass_num = 0;
-  m_all_stream_writes_succeeded = true;
-}
-
-jpeg_encoder::jpeg_encoder()
-{
-  clear();
-}
-
-jpeg_encoder::~jpeg_encoder()
-{
-  deinit();
-}
-
-bool jpeg_encoder::init(output_stream *pStream, int64_t width, int64_t height, int64_t src_channels, const params &comp_params)
-{
-  deinit();
-  if (((!pStream) || (width < 1) || (height < 1)) || ((src_channels != 1) && (src_channels != 3) && (src_channels != 4)) || (!comp_params.check_valid())) return false;
-  m_pStream = pStream;
-  m_params = comp_params;
-  return jpg_open(width, height, src_channels);
-}
-
-void jpeg_encoder::deinit()
-{
-  jpge_free(m_mcu_lines[0]);
-  clear();
-}
-
-bool jpeg_encoder::process_scanline(const void* pScanline)
-{
-  if ((m_pass_num < 1) || (m_pass_num > 2)) return false;
-  if (m_all_stream_writes_succeeded)
-  {
-    if (!pScanline)
-    {
-      if (!process_end_of_image()) return false;
-    }
-    else
-    {
-      load_mcu(pScanline);
-    }
-  }
-  return m_all_stream_writes_succeeded;
-}
-
-// Higher level wrappers/examples (optional).
-#include <stdio.h>
-
-class cfile_stream : public output_stream
-{
-   cfile_stream(const cfile_stream &);
-   cfile_stream &operator= (const cfile_stream &);
-
-   FILE* m_pFile;
-   bool m_bStatus;
-
-public:
-   cfile_stream() : m_pFile(NULL), m_bStatus(false) { }
-
-   virtual ~cfile_stream()
-   {
-      close();
-   }
-
-   bool open(const char *pFilename)
-   {
-      close();
-#if defined(_MSC_VER)
-      if (fopen_s(&m_pFile, pFilename, "wb") != 0)
-	  {
-		  return false;
-	  }
-#else
-      m_pFile = fopen(pFilename, "wb");
-#endif
-      m_bStatus = (m_pFile != NULL);
-      return m_bStatus;
-   }
-
-   bool close()
-   {
-      if (m_pFile)
-      {
-         if (fclose(m_pFile) == EOF)
-         {
-            m_bStatus = false;
-         }
-         m_pFile = NULL;
-      }
-      return m_bStatus;
-   }
-
-   virtual bool put_buf(const void* pBuf, int64_t len)
-   {
-      m_bStatus = m_bStatus && (fwrite(pBuf, len, 1, m_pFile) == 1);
-      return m_bStatus;
-   }
-
-   uint get_size() const
-   {
-      return m_pFile ? ftell(m_pFile) : 0;
-   }
-};
-
-// Writes JPEG image to file.
-bool compress_image_to_jpeg_file(const char *pFilename, int64_t width, int64_t height, int64_t num_channels, const uint8 *pImage_data, const params &comp_params)
-{
-  cfile_stream dst_stream;
-  if (!dst_stream.open(pFilename))
-    return false;
-
-  jpge::jpeg_encoder dst_image;
-  if (!dst_image.init(&dst_stream, width, height, num_channels, comp_params))
-    return false;
-
-  for (uint pass_index = 0; pass_index < dst_image.get_total_passes(); pass_index++)
-  {
-    for (int64_t i = 0; i < height; i++)
-    {
-		// i, width, and num_channels are all 64bit
-       const uint8* pBuf = pImage_data + i * width * num_channels;
-       if (!dst_image.process_scanline(pBuf))
-          return false;
-    }
-    if (!dst_image.process_scanline(NULL))
-       return false;
-  }
-
-  dst_image.deinit();
-
-  return dst_stream.close();
-}
-
-class memory_stream : public output_stream
-{
-   memory_stream(const memory_stream &);
-   memory_stream &operator= (const memory_stream &);
-
-   uint8 *m_pBuf;
-   uint64_t m_buf_size, m_buf_ofs;
-
-public:
-   memory_stream(void *pBuf, uint64_t buf_size) : m_pBuf(static_cast<uint8*>(pBuf)), m_buf_size(buf_size), m_buf_ofs(0) { }
-
-   virtual ~memory_stream() { }
-
-   virtual bool put_buf(const void* pBuf, int64_t len)
-   {
-      uint64_t buf_remaining = m_buf_size - m_buf_ofs;
-      if ((uint64_t)len > buf_remaining)
-         return false;
-      memcpy(m_pBuf + m_buf_ofs, pBuf, len);
-      m_buf_ofs += len;
-      return true;
-   }
-
-   uint64_t get_size() const
-   {
-      return m_buf_ofs;
-   }
-};
-
-bool compress_image_to_jpeg_file_in_memory(void *pDstBuf, int64_t &buf_size, int64_t width, int64_t height, int64_t num_channels, const uint8 *pImage_data, const params &comp_params)
-{
-   if ((!pDstBuf) || (!buf_size))
-      return false;
-
-   memory_stream dst_stream(pDstBuf, buf_size);
-
-   buf_size = 0;
-
-   jpge::jpeg_encoder dst_image;
-   if (!dst_image.init(&dst_stream, width, height, num_channels, comp_params))
-      return false;
-
-   for (uint pass_index = 0; pass_index < dst_image.get_total_passes(); pass_index++)
-   {
-     for (int64_t i = 0; i < height; i++)
-     {
-        const uint8* pScanline = pImage_data + i * width * num_channels;
-        if (!dst_image.process_scanline(pScanline))
-           return false;
-     }
-     if (!dst_image.process_scanline(NULL))
-        return false;
-   }
-
-   dst_image.deinit();
-
-   buf_size = dst_stream.get_size();
-   return true;
-}
-
-} // namespace jpge

crazy_functions/test_project/cpp/libJPG/jpge.h

@@ -1,172 +0,0 @@
-
-// jpge.h - C++ class for JPEG compression.
-// Public domain, Rich Geldreich <richgel99@gmail.com>
-// Alex Evans: Added RGBA support, linear memory allocator.
-#ifndef JPEG_ENCODER_H
-#define JPEG_ENCODER_H
-
-#include <stdint.h>
-
-namespace jpge
-{
-  typedef unsigned char  uint8;
-  typedef signed short   int16;
-  typedef signed int     int32;
-  typedef unsigned short uint16;
-  typedef unsigned int   uint32;
-  typedef unsigned int   uint;
-
-  // JPEG chroma subsampling factors. Y_ONLY (grayscale images) and H2V2 (color images) are the most common.
-  enum subsampling_t { Y_ONLY = 0, H1V1 = 1, H2V1 = 2, H2V2 = 3 };
-
-  // JPEG compression parameters structure.
-  struct params
-  {
-    inline params() : m_quality(85), m_subsampling(H2V2), m_no_chroma_discrim_flag(false), m_two_pass_flag(false) { }
-
-    inline bool check_valid() const
-    {
-      if ((m_quality < 1) || (m_quality > 100)) return false;
-      if ((uint)m_subsampling > (uint)H2V2) return false;
-      return true;
-    }
-
-    // Quality: 1-100, higher is better. Typical values are around 50-95.
-    int m_quality;
-
-    // m_subsampling:
-    // 0 = Y (grayscale) only
-    // 1 = YCbCr, no subsampling (H1V1, YCbCr 1x1x1, 3 blocks per MCU)
-    // 2 = YCbCr, H2V1 subsampling (YCbCr 2x1x1, 4 blocks per MCU)
-    // 3 = YCbCr, H2V2 subsampling (YCbCr 4x1x1, 6 blocks per MCU-- very common)
-    subsampling_t m_subsampling;
-
-    // Disables CbCr discrimination - only intended for testing.
-    // If true, the Y quantization table is also used for the CbCr channels.
-    bool m_no_chroma_discrim_flag;
-
-    bool m_two_pass_flag;
-  };
-  
-  // Writes JPEG image to a file. 
-  // num_channels must be 1 (Y) or 3 (RGB), image pitch must be width*num_channels.
-  bool compress_image_to_jpeg_file(const char *pFilename, int64_t width, int64_t height, int64_t num_channels, const uint8 *pImage_data, const params &comp_params = params());
-
-  // Writes JPEG image to memory buffer. 
-  // On entry, buf_size is the size of the output buffer pointed at by pBuf, which should be at least ~1024 bytes. 
-  // If return value is true, buf_size will be set to the size of the compressed data.
-  bool compress_image_to_jpeg_file_in_memory(void *pBuf, int64_t &buf_size, int64_t width, int64_t height, int64_t num_channels, const uint8 *pImage_data, const params &comp_params = params());
-    
-  // Output stream abstract class - used by the jpeg_encoder class to write to the output stream. 
-  // put_buf() is generally called with len==JPGE_OUT_BUF_SIZE bytes, but for headers it'll be called with smaller amounts.
-  class output_stream
-  {
-  public:
-    virtual ~output_stream() { };
-    virtual bool put_buf(const void* Pbuf, int64_t len) = 0;
-    template<class T> inline bool put_obj(const T& obj) { return put_buf(&obj, sizeof(T)); }
-  };
-    
-  // Lower level jpeg_encoder class - useful if more control is needed than the above helper functions.
-  class jpeg_encoder
-  {
-  public:
-    jpeg_encoder();
-    ~jpeg_encoder();
-
-    // Initializes the compressor.
-    // pStream: The stream object to use for writing compressed data.
-    // params - Compression parameters structure, defined above.
-    // width, height  - Image dimensions.
-    // channels - May be 1, or 3. 1 indicates grayscale, 3 indicates RGB source data.
-    // Returns false on out of memory or if a stream write fails.
-    bool init(output_stream *pStream, int64_t width, int64_t height, int64_t src_channels, const params &comp_params = params());
-    
-    const params &get_params() const { return m_params; }
-    
-    // Deinitializes the compressor, freeing any allocated memory. May be called at any time.
-    void deinit();
-
-    uint get_total_passes() const { return m_params.m_two_pass_flag ? 2 : 1; }
-    inline uint get_cur_pass() { return m_pass_num; }
-
-    // Call this method with each source scanline.
-    // width * src_channels bytes per scanline is expected (RGB or Y format).
-    // You must call with NULL after all scanlines are processed to finish compression.
-    // Returns false on out of memory or if a stream write fails.
-    bool process_scanline(const void* pScanline);
-        
-  private:
-    jpeg_encoder(const jpeg_encoder &);
-    jpeg_encoder &operator =(const jpeg_encoder &);
-
-    typedef int32 sample_array_t;
-        
-    output_stream *m_pStream;
-    params m_params;
-    uint8 m_num_components;
-    uint8 m_comp_h_samp[3], m_comp_v_samp[3];
-    int m_image_x, m_image_y, m_image_bpp, m_image_bpl;
-    int m_image_x_mcu, m_image_y_mcu;
-    int m_image_bpl_xlt, m_image_bpl_mcu;
-    int m_mcus_per_row;
-    int m_mcu_x, m_mcu_y;
-    uint8 *m_mcu_lines[16];
-    uint8 m_mcu_y_ofs;
-    sample_array_t m_sample_array[64];
-    int16 m_coefficient_array[64];
-    int32 m_quantization_tables[2][64];
-    uint m_huff_codes[4][256];
-    uint8 m_huff_code_sizes[4][256];
-    uint8 m_huff_bits[4][17];
-    uint8 m_huff_val[4][256];
-    uint32 m_huff_count[4][256];
-    int m_last_dc_val[3];
-    enum { JPGE_OUT_BUF_SIZE = 2048 };
-    uint8 m_out_buf[JPGE_OUT_BUF_SIZE];
-    uint8 *m_pOut_buf;
-    uint m_out_buf_left;
-    uint32 m_bit_buffer;
-    uint m_bits_in;
-    uint8 m_pass_num;
-    bool m_all_stream_writes_succeeded;
-        
-    void optimize_huffman_table(int table_num, int table_len);
-    void emit_byte(uint8 i);
-    void emit_word(uint i);
-    void emit_marker(int marker);
-    void emit_jfif_app0();
-    void emit_dqt();
-    void emit_sof();
-    void emit_dht(uint8 *bits, uint8 *val, int index, bool ac_flag);
-    void emit_dhts();
-    void emit_sos();
-    void emit_markers();
-    void compute_huffman_table(uint *codes, uint8 *code_sizes, uint8 *bits, uint8 *val);
-    void compute_quant_table(int32 *dst, int16 *src);
-    void adjust_quant_table(int32 *dst, int32 *src);
-    void first_pass_init();
-    bool second_pass_init();
-    bool jpg_open(int p_x_res, int p_y_res, int src_channels);
-    void load_block_8_8_grey(int x);
-    void load_block_8_8(int x, int y, int c);
-    void load_block_16_8(int x, int c);
-    void load_block_16_8_8(int x, int c);
-    void load_quantized_coefficients(int component_num);
-    void flush_output_buffer();
-    void put_bits(uint bits, uint len);
-    void code_coefficients_pass_one(int component_num);
-    void code_coefficients_pass_two(int component_num);
-    void code_block(int component_num);
-    void process_mcu_row();
-    bool terminate_pass_one();
-    bool terminate_pass_two();
-    bool process_end_of_image();
-    void load_mcu(const void* src);
-    void clear();
-    void init();
-  };
-
-} // namespace jpge
-
-#endif // JPEG_ENCODER

crazy_functions/test_project/cpp/libJPG/来源

@@ -1,3 +0,0 @@
-jpge.h - C++ class for JPEG compression.
-Public domain, Rich Geldreich <richgel99@gmail.com>
-Alex Evans: Added RGBA support, linear memory allocator.

crazy_functions/test_project/cpp/longcode/jpgd.cpp

@@ -1,3276 +0,0 @@
-// jpgd.cpp - C++ class for JPEG decompression.
-// Public domain, Rich Geldreich <richgel99@gmail.com>
-// Last updated Apr. 16, 2011
-// Alex Evans: Linear memory allocator (taken from jpge.h).
-//
-// Supports progressive and baseline sequential JPEG image files, and the most common chroma subsampling factors: Y, H1V1, H2V1, H1V2, and H2V2.
-//
-// Chroma upsampling quality: H2V2 is upsampled in the frequency domain, H2V1 and H1V2 are upsampled using point sampling.
-// Chroma upsampling reference: "Fast Scheme for Image Size Change in the Compressed Domain"
-// http://vision.ai.uiuc.edu/~dugad/research/dct/index.html
-
-#include "jpgd.h"
-#include <string.h>
-
-#include <assert.h>
-// BEGIN EPIC MOD
-#define JPGD_ASSERT(x) { assert(x); CA_ASSUME(x); } (void)0
-// END EPIC MOD
-
-#ifdef _MSC_VER
-#pragma warning (disable : 4611) // warning C4611: interaction between '_setjmp' and C++ object destruction is non-portable
-#endif
-
-// Set to 1 to enable freq. domain chroma upsampling on images using H2V2 subsampling (0=faster nearest neighbor sampling).
-// This is slower, but results in higher quality on images with highly saturated colors.
-#define JPGD_SUPPORT_FREQ_DOMAIN_UPSAMPLING 1
-
-#define JPGD_TRUE (1)
-#define JPGD_FALSE (0)
-
-#define JPGD_MAX(a,b) (((a)>(b)) ? (a) : (b))
-#define JPGD_MIN(a,b) (((a)<(b)) ? (a) : (b))
-
-namespace jpgd {
-
-	static inline void *jpgd_malloc(size_t nSize) { return FMemory::Malloc(nSize); }
-	static inline void jpgd_free(void *p) { FMemory::Free(p); }
-
-// BEGIN EPIC MOD
-//@UE3 - use UE3 BGRA encoding instead of assuming RGBA
-	// stolen from IImageWrapper.h
-	enum ERGBFormatJPG
-	{
-		Invalid = -1,
-		RGBA =  0,
-		BGRA =  1,
-		Gray =  2,
-	};
-	static ERGBFormatJPG jpg_format;
-// END EPIC MOD
-
-	// DCT coefficients are stored in this sequence.
-	static int g_ZAG[64] = {  0,1,8,16,9,2,3,10,17,24,32,25,18,11,4,5,12,19,26,33,40,48,41,34,27,20,13,6,7,14,21,28,35,42,49,56,57,50,43,36,29,22,15,23,30,37,44,51,58,59,52,45,38,31,39,46,53,60,61,54,47,55,62,63 };
-
-	enum JPEG_MARKER
-	{
-		M_SOF0  = 0xC0, M_SOF1  = 0xC1, M_SOF2  = 0xC2, M_SOF3  = 0xC3, M_SOF5  = 0xC5, M_SOF6  = 0xC6, M_SOF7  = 0xC7, M_JPG   = 0xC8,
-		M_SOF9  = 0xC9, M_SOF10 = 0xCA, M_SOF11 = 0xCB, M_SOF13 = 0xCD, M_SOF14 = 0xCE, M_SOF15 = 0xCF, M_DHT   = 0xC4, M_DAC   = 0xCC,
-		M_RST0  = 0xD0, M_RST1  = 0xD1, M_RST2  = 0xD2, M_RST3  = 0xD3, M_RST4  = 0xD4, M_RST5  = 0xD5, M_RST6  = 0xD6, M_RST7  = 0xD7,
-		M_SOI   = 0xD8, M_EOI   = 0xD9, M_SOS   = 0xDA, M_DQT   = 0xDB, M_DNL   = 0xDC, M_DRI   = 0xDD, M_DHP   = 0xDE, M_EXP   = 0xDF,
-		M_APP0  = 0xE0, M_APP15 = 0xEF, M_JPG0  = 0xF0, M_JPG13 = 0xFD, M_COM   = 0xFE, M_TEM   = 0x01, M_ERROR = 0x100, RST0   = 0xD0
-	};
-
-	enum JPEG_SUBSAMPLING { JPGD_GRAYSCALE = 0, JPGD_YH1V1, JPGD_YH2V1, JPGD_YH1V2, JPGD_YH2V2 };
-
-#define CONST_BITS  13
-#define PASS1_BITS  2
-#define SCALEDONE ((int32)1)
-
-#define FIX_0_298631336  ((int32)2446)        /* FIX(0.298631336) */
-#define FIX_0_390180644  ((int32)3196)        /* FIX(0.390180644) */
-#define FIX_0_541196100  ((int32)4433)        /* FIX(0.541196100) */
-#define FIX_0_765366865  ((int32)6270)        /* FIX(0.765366865) */
-#define FIX_0_899976223  ((int32)7373)        /* FIX(0.899976223) */
-#define FIX_1_175875602  ((int32)9633)        /* FIX(1.175875602) */
-#define FIX_1_501321110  ((int32)12299)       /* FIX(1.501321110) */
-#define FIX_1_847759065  ((int32)15137)       /* FIX(1.847759065) */
-#define FIX_1_961570560  ((int32)16069)       /* FIX(1.961570560) */
-#define FIX_2_053119869  ((int32)16819)       /* FIX(2.053119869) */
-#define FIX_2_562915447  ((int32)20995)       /* FIX(2.562915447) */
-#define FIX_3_072711026  ((int32)25172)       /* FIX(3.072711026) */
-
-#define DESCALE(x,n)  (((x) + (SCALEDONE << ((n)-1))) >> (n))
-#define DESCALE_ZEROSHIFT(x,n)  (((x) + (128 << (n)) + (SCALEDONE << ((n)-1))) >> (n))
-
-#define MULTIPLY(var, cnst)  ((var) * (cnst))
-
-#define CLAMP(i) ((static_cast<uint>(i) > 255) ? (((~i) >> 31) & 0xFF) : (i))
-
-	// Compiler creates a fast path 1D IDCT for X non-zero columns
-	template <int NONZERO_COLS>
-	struct Row
-	{
-		static void idct(int* pTemp, const jpgd_block_t* pSrc)
-		{
-			// ACCESS_COL() will be optimized at compile time to either an array access, or 0.
-#define ACCESS_COL(x) (((x) < NONZERO_COLS) ? (int)pSrc[x] : 0)
-
-			const int z2 = ACCESS_COL(2), z3 = ACCESS_COL(6);
-
-			const int z1 = MULTIPLY(z2 + z3, FIX_0_541196100);
-			const int tmp2 = z1 + MULTIPLY(z3, - FIX_1_847759065);
-			const int tmp3 = z1 + MULTIPLY(z2, FIX_0_765366865);
-
-			const int tmp0 = (ACCESS_COL(0) + ACCESS_COL(4)) << CONST_BITS;
-			const int tmp1 = (ACCESS_COL(0) - ACCESS_COL(4)) << CONST_BITS;
-
-			const int tmp10 = tmp0 + tmp3, tmp13 = tmp0 - tmp3, tmp11 = tmp1 + tmp2, tmp12 = tmp1 - tmp2;
-
-			const int atmp0 = ACCESS_COL(7), atmp1 = ACCESS_COL(5), atmp2 = ACCESS_COL(3), atmp3 = ACCESS_COL(1);
-
-			const int bz1 = atmp0 + atmp3, bz2 = atmp1 + atmp2, bz3 = atmp0 + atmp2, bz4 = atmp1 + atmp3;
-			const int bz5 = MULTIPLY(bz3 + bz4, FIX_1_175875602);
-
-			const int az1 = MULTIPLY(bz1, - FIX_0_899976223);
-			const int az2 = MULTIPLY(bz2, - FIX_2_562915447);
-			const int az3 = MULTIPLY(bz3, - FIX_1_961570560) + bz5;
-			const int az4 = MULTIPLY(bz4, - FIX_0_390180644) + bz5;
-
-			const int btmp0 = MULTIPLY(atmp0, FIX_0_298631336) + az1 + az3;
-			const int btmp1 = MULTIPLY(atmp1, FIX_2_053119869) + az2 + az4;
-			const int btmp2 = MULTIPLY(atmp2, FIX_3_072711026) + az2 + az3;
-			const int btmp3 = MULTIPLY(atmp3, FIX_1_501321110) + az1 + az4;
-
-			pTemp[0] = DESCALE(tmp10 + btmp3, CONST_BITS-PASS1_BITS);
-			pTemp[7] = DESCALE(tmp10 - btmp3, CONST_BITS-PASS1_BITS);
-			pTemp[1] = DESCALE(tmp11 + btmp2, CONST_BITS-PASS1_BITS);
-			pTemp[6] = DESCALE(tmp11 - btmp2, CONST_BITS-PASS1_BITS);
-			pTemp[2] = DESCALE(tmp12 + btmp1, CONST_BITS-PASS1_BITS);
-			pTemp[5] = DESCALE(tmp12 - btmp1, CONST_BITS-PASS1_BITS);
-			pTemp[3] = DESCALE(tmp13 + btmp0, CONST_BITS-PASS1_BITS);
-			pTemp[4] = DESCALE(tmp13 - btmp0, CONST_BITS-PASS1_BITS);
-		}
-	};
-
-	template <>
-	struct Row<0>
-	{
-		static void idct(int* pTemp, const jpgd_block_t* pSrc)
-		{
-#ifdef _MSC_VER
-			pTemp; pSrc;
-#endif
-		}
-	};
-
-	template <>
-	struct Row<1>
-	{
-		static void idct(int* pTemp, const jpgd_block_t* pSrc)
-		{
-			const int dcval = (pSrc[0] << PASS1_BITS);
-
-			pTemp[0] = dcval;
-			pTemp[1] = dcval;
-			pTemp[2] = dcval;
-			pTemp[3] = dcval;
-			pTemp[4] = dcval;
-			pTemp[5] = dcval;
-			pTemp[6] = dcval;
-			pTemp[7] = dcval;
-		}
-	};
-
-	// Compiler creates a fast path 1D IDCT for X non-zero rows
-	template <int NONZERO_ROWS>
-	struct Col
-	{
-		static void idct(uint8* pDst_ptr, const int* pTemp)
-		{
-			// ACCESS_ROW() will be optimized at compile time to either an array access, or 0.
-#define ACCESS_ROW(x) (((x) < NONZERO_ROWS) ? pTemp[x * 8] : 0)
-
-			const int z2 = ACCESS_ROW(2);
-			const int z3 = ACCESS_ROW(6);
-
-			const int z1 = MULTIPLY(z2 + z3, FIX_0_541196100);
-			const int tmp2 = z1 + MULTIPLY(z3, - FIX_1_847759065);
-			const int tmp3 = z1 + MULTIPLY(z2, FIX_0_765366865);
-
-			const int tmp0 = (ACCESS_ROW(0) + ACCESS_ROW(4)) << CONST_BITS;
-			const int tmp1 = (ACCESS_ROW(0) - ACCESS_ROW(4)) << CONST_BITS;
-
-			const int tmp10 = tmp0 + tmp3, tmp13 = tmp0 - tmp3, tmp11 = tmp1 + tmp2, tmp12 = tmp1 - tmp2;
-
-			const int atmp0 = ACCESS_ROW(7), atmp1 = ACCESS_ROW(5), atmp2 = ACCESS_ROW(3), atmp3 = ACCESS_ROW(1);
-
-			const int bz1 = atmp0 + atmp3, bz2 = atmp1 + atmp2, bz3 = atmp0 + atmp2, bz4 = atmp1 + atmp3;
-			const int bz5 = MULTIPLY(bz3 + bz4, FIX_1_175875602);
-
-			const int az1 = MULTIPLY(bz1, - FIX_0_899976223);
-			const int az2 = MULTIPLY(bz2, - FIX_2_562915447);
-			const int az3 = MULTIPLY(bz3, - FIX_1_961570560) + bz5;
-			const int az4 = MULTIPLY(bz4, - FIX_0_390180644) + bz5;
-
-			const int btmp0 = MULTIPLY(atmp0, FIX_0_298631336) + az1 + az3;
-			const int btmp1 = MULTIPLY(atmp1, FIX_2_053119869) + az2 + az4;
-			const int btmp2 = MULTIPLY(atmp2, FIX_3_072711026) + az2 + az3;
-			const int btmp3 = MULTIPLY(atmp3, FIX_1_501321110) + az1 + az4;
-
-			int i = DESCALE_ZEROSHIFT(tmp10 + btmp3, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*0] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp10 - btmp3, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*7] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp11 + btmp2, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*1] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp11 - btmp2, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*6] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp12 + btmp1, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*2] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp12 - btmp1, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*5] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp13 + btmp0, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*3] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp13 - btmp0, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*4] = (uint8)CLAMP(i);
-		}
-	};
-
-	template <>
-	struct Col<1>
-	{
-		static void idct(uint8* pDst_ptr, const int* pTemp)
-		{
-			int dcval = DESCALE_ZEROSHIFT(pTemp[0], PASS1_BITS+3);
-			const uint8 dcval_clamped = (uint8)CLAMP(dcval);
-			pDst_ptr[0*8] = dcval_clamped;
-			pDst_ptr[1*8] = dcval_clamped;
-			pDst_ptr[2*8] = dcval_clamped;
-			pDst_ptr[3*8] = dcval_clamped;
-			pDst_ptr[4*8] = dcval_clamped;
-			pDst_ptr[5*8] = dcval_clamped;
-			pDst_ptr[6*8] = dcval_clamped;
-			pDst_ptr[7*8] = dcval_clamped;
-		}
-	};
-
-	static const uint8 s_idct_row_table[] =
-	{
-		1,0,0,0,0,0,0,0, 2,0,0,0,0,0,0,0, 2,1,0,0,0,0,0,0, 2,1,1,0,0,0,0,0, 2,2,1,0,0,0,0,0, 3,2,1,0,0,0,0,0, 4,2,1,0,0,0,0,0, 4,3,1,0,0,0,0,0,
-		4,3,2,0,0,0,0,0, 4,3,2,1,0,0,0,0, 4,3,2,1,1,0,0,0, 4,3,2,2,1,0,0,0, 4,3,3,2,1,0,0,0, 4,4,3,2,1,0,0,0, 5,4,3,2,1,0,0,0, 6,4,3,2,1,0,0,0,
-		6,5,3,2,1,0,0,0, 6,5,4,2,1,0,0,0, 6,5,4,3,1,0,0,0, 6,5,4,3,2,0,0,0, 6,5,4,3,2,1,0,0, 6,5,4,3,2,1,1,0, 6,5,4,3,2,2,1,0, 6,5,4,3,3,2,1,0,
-		6,5,4,4,3,2,1,0, 6,5,5,4,3,2,1,0, 6,6,5,4,3,2,1,0, 7,6,5,4,3,2,1,0, 8,6,5,4,3,2,1,0, 8,7,5,4,3,2,1,0, 8,7,6,4,3,2,1,0, 8,7,6,5,3,2,1,0,
-		8,7,6,5,4,2,1,0, 8,7,6,5,4,3,1,0, 8,7,6,5,4,3,2,0, 8,7,6,5,4,3,2,1, 8,7,6,5,4,3,2,2, 8,7,6,5,4,3,3,2, 8,7,6,5,4,4,3,2, 8,7,6,5,5,4,3,2,
-		8,7,6,6,5,4,3,2, 8,7,7,6,5,4,3,2, 8,8,7,6,5,4,3,2, 8,8,8,6,5,4,3,2, 8,8,8,7,5,4,3,2, 8,8,8,7,6,4,3,2, 8,8,8,7,6,5,3,2, 8,8,8,7,6,5,4,2,
-		8,8,8,7,6,5,4,3, 8,8,8,7,6,5,4,4, 8,8,8,7,6,5,5,4, 8,8,8,7,6,6,5,4, 8,8,8,7,7,6,5,4, 8,8,8,8,7,6,5,4, 8,8,8,8,8,6,5,4, 8,8,8,8,8,7,5,4,
-		8,8,8,8,8,7,6,4, 8,8,8,8,8,7,6,5, 8,8,8,8,8,7,6,6, 8,8,8,8,8,7,7,6, 8,8,8,8,8,8,7,6, 8,8,8,8,8,8,8,6, 8,8,8,8,8,8,8,7, 8,8,8,8,8,8,8,8,
-	};
-
-	static const uint8 s_idct_col_table[] = { 1, 1, 2, 3, 3, 3, 3, 3, 3, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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 };
-
-	void idct(const jpgd_block_t* pSrc_ptr, uint8* pDst_ptr, int block_max_zag)
-	{
-		JPGD_ASSERT(block_max_zag >= 1);
-		JPGD_ASSERT(block_max_zag <= 64);
-
-		if (block_max_zag == 1)
-		{
-			int k = ((pSrc_ptr[0] + 4) >> 3) + 128;
-			k = CLAMP(k);
-			k = k | (k<<8);
-			k = k | (k<<16);
-
-			for (int i = 8; i > 0; i--)
-			{
-				*(int*)&pDst_ptr[0] = k;
-				*(int*)&pDst_ptr[4] = k;
-				pDst_ptr += 8;
-			}
-			return;
-		}
-
-		int temp[64];
-
-		const jpgd_block_t* pSrc = pSrc_ptr;
-		int* pTemp = temp;
-
-		const uint8* pRow_tab = &s_idct_row_table[(block_max_zag - 1) * 8];
-		int i;
-		for (i = 8; i > 0; i--, pRow_tab++)
-		{
-			switch (*pRow_tab)
-			{
-			case 0: Row<0>::idct(pTemp, pSrc); break;
-			case 1: Row<1>::idct(pTemp, pSrc); break;
-			case 2: Row<2>::idct(pTemp, pSrc); break;
-			case 3: Row<3>::idct(pTemp, pSrc); break;
-			case 4: Row<4>::idct(pTemp, pSrc); break;
-			case 5: Row<5>::idct(pTemp, pSrc); break;
-			case 6: Row<6>::idct(pTemp, pSrc); break;
-			case 7: Row<7>::idct(pTemp, pSrc); break;
-			case 8: Row<8>::idct(pTemp, pSrc); break;
-			}
-
-			pSrc += 8;
-			pTemp += 8;
-		}
-
-		pTemp = temp;
-
-		const int nonzero_rows = s_idct_col_table[block_max_zag - 1];
-		for (i = 8; i > 0; i--)
-		{
-			switch (nonzero_rows)
-			{
-			case 1: Col<1>::idct(pDst_ptr, pTemp); break;
-			case 2: Col<2>::idct(pDst_ptr, pTemp); break;
-			case 3: Col<3>::idct(pDst_ptr, pTemp); break;
-			case 4: Col<4>::idct(pDst_ptr, pTemp); break;
-			case 5: Col<5>::idct(pDst_ptr, pTemp); break;
-			case 6: Col<6>::idct(pDst_ptr, pTemp); break;
-			case 7: Col<7>::idct(pDst_ptr, pTemp); break;
-			case 8: Col<8>::idct(pDst_ptr, pTemp); break;
-			}
-
-			pTemp++;
-			pDst_ptr++;
-		}
-	}
-
-	void idct_4x4(const jpgd_block_t* pSrc_ptr, uint8* pDst_ptr)
-	{
-		int temp[64];
-		int* pTemp = temp;
-		const jpgd_block_t* pSrc = pSrc_ptr;
-
-		for (int i = 4; i > 0; i--)
-		{
-			Row<4>::idct(pTemp, pSrc);
-			pSrc += 8;
-			pTemp += 8;
-		}
-
-		pTemp = temp;
-		for (int i = 8; i > 0; i--)
-		{
-			Col<4>::idct(pDst_ptr, pTemp);
-			pTemp++;
-			pDst_ptr++;
-		}
-	}
-
-	// Retrieve one character from the input stream.
-	inline uint jpeg_decoder::get_char()
-	{
-		// Any bytes remaining in buffer?
-		if (!m_in_buf_left)
-		{
-			// Try to get more bytes.
-			prep_in_buffer();
-			// Still nothing to get?
-			if (!m_in_buf_left)
-			{
-				// Pad the end of the stream with 0xFF 0xD9 (EOI marker)
-				int t = m_tem_flag;
-				m_tem_flag ^= 1;
-				if (t)
-					return 0xD9;
-				else
-					return 0xFF;
-			}
-		}
-
-		uint c = *m_pIn_buf_ofs++;
-		m_in_buf_left--;
-
-		return c;
-	}
-
-	// Same as previous method, except can indicate if the character is a pad character or not.
-	inline uint jpeg_decoder::get_char(bool *pPadding_flag)
-	{
-		if (!m_in_buf_left)
-		{
-			prep_in_buffer();
-			if (!m_in_buf_left)
-			{
-				*pPadding_flag = true;
-				int t = m_tem_flag;
-				m_tem_flag ^= 1;
-				if (t)
-					return 0xD9;
-				else
-					return 0xFF;
-			}
-		}
-
-		*pPadding_flag = false;
-
-		uint c = *m_pIn_buf_ofs++;
-		m_in_buf_left--;
-
-		return c;
-	}
-
-	// Inserts a previously retrieved character back into the input buffer.
-	inline void jpeg_decoder::stuff_char(uint8 q)
-	{
-		*(--m_pIn_buf_ofs) = q;
-		m_in_buf_left++;
-	}
-
-	// Retrieves one character from the input stream, but does not read past markers. Will continue to return 0xFF when a marker is encountered.
-	inline uint8 jpeg_decoder::get_octet()
-	{
-		bool padding_flag;
-		int c = get_char(&padding_flag);
-
-		if (c == 0xFF)
-		{
-			if (padding_flag)
-				return 0xFF;
-
-			c = get_char(&padding_flag);
-			if (padding_flag)
-			{
-				stuff_char(0xFF);
-				return 0xFF;
-			}
-
-			if (c == 0x00)
-				return 0xFF;
-			else
-			{
-				stuff_char(static_cast<uint8>(c));
-				stuff_char(0xFF);
-				return 0xFF;
-			}
-		}
-
-		return static_cast<uint8>(c);
-	}
-
-	// Retrieves a variable number of bits from the input stream. Does not recognize markers.
-	inline uint jpeg_decoder::get_bits(int num_bits)
-	{
-		if (!num_bits)
-			return 0;
-
-		uint i = m_bit_buf >> (32 - num_bits);
-
-		if ((m_bits_left -= num_bits) <= 0)
-		{
-			m_bit_buf <<= (num_bits += m_bits_left);
-
-			uint c1 = get_char();
-			uint c2 = get_char();
-			m_bit_buf = (m_bit_buf & 0xFFFF0000) | (c1 << 8) | c2;
-
-			m_bit_buf <<= -m_bits_left;
-
-			m_bits_left += 16;
-
-			JPGD_ASSERT(m_bits_left >= 0);
-		}
-		else
-			m_bit_buf <<= num_bits;
-
-		return i;
-	}
-
-	// Retrieves a variable number of bits from the input stream. Markers will not be read into the input bit buffer. Instead, an infinite number of all 1's will be returned when a marker is encountered.
-	inline uint jpeg_decoder::get_bits_no_markers(int num_bits)
-	{
-		if (!num_bits)
-			return 0;
-
-		uint i = m_bit_buf >> (32 - num_bits);
-
-		if ((m_bits_left -= num_bits) <= 0)
-		{
-			m_bit_buf <<= (num_bits += m_bits_left);
-
-			if ((m_in_buf_left < 2) || (m_pIn_buf_ofs[0] == 0xFF) || (m_pIn_buf_ofs[1] == 0xFF))
-			{
-				uint c1 = get_octet();
-				uint c2 = get_octet();
-				m_bit_buf |= (c1 << 8) | c2;
-			}
-			else
-			{
-				m_bit_buf |= ((uint)m_pIn_buf_ofs[0] << 8) | m_pIn_buf_ofs[1];
-				m_in_buf_left -= 2;
-				m_pIn_buf_ofs += 2;
-			}
-
-			m_bit_buf <<= -m_bits_left;
-
-			m_bits_left += 16;
-
-			JPGD_ASSERT(m_bits_left >= 0);
-		}
-		else
-			m_bit_buf <<= num_bits;
-
-		return i;
-	}
-
-	// Decodes a Huffman encoded symbol.
-	inline int jpeg_decoder::huff_decode(huff_tables *pH)
-	{
-		int symbol;
-
-		// Check first 8-bits: do we have a complete symbol?
-		if ((symbol = pH->look_up[m_bit_buf >> 24]) < 0)
-		{
-			// Decode more bits, use a tree traversal to find symbol.
-			int ofs = 23;
-			do
-			{
-				symbol = pH->tree[-(int)(symbol + ((m_bit_buf >> ofs) & 1))];
-				ofs--;
-			} while (symbol < 0);
-
-			get_bits_no_markers(8 + (23 - ofs));
-		}
-		else
-			get_bits_no_markers(pH->code_size[symbol]);
-
-		return symbol;
-	}
-
-	// Decodes a Huffman encoded symbol.
-	inline int jpeg_decoder::huff_decode(huff_tables *pH, int& extra_bits)
-	{
-		int symbol;
-
-		// Check first 8-bits: do we have a complete symbol?
-		if ((symbol = pH->look_up2[m_bit_buf >> 24]) < 0)
-		{
-			// Use a tree traversal to find symbol.
-			int ofs = 23;
-			do
-			{
-				symbol = pH->tree[-(int)(symbol + ((m_bit_buf >> ofs) & 1))];
-				ofs--;
-			} while (symbol < 0);
-
-			get_bits_no_markers(8 + (23 - ofs));
-
-			extra_bits = get_bits_no_markers(symbol & 0xF);
-		}
-		else
-		{
-			JPGD_ASSERT(((symbol >> 8) & 31) == pH->code_size[symbol & 255] + ((symbol & 0x8000) ? (symbol & 15) : 0));
-
-			if (symbol & 0x8000)
-			{
-				get_bits_no_markers((symbol >> 8) & 31);
-				extra_bits = symbol >> 16;
-			}
-			else
-			{
-				int code_size = (symbol >> 8) & 31;
-				int num_extra_bits = symbol & 0xF;
-				int bits = code_size + num_extra_bits;
-				if (bits <= (m_bits_left + 16))
-					extra_bits = get_bits_no_markers(bits) & ((1 << num_extra_bits) - 1);
-				else
-				{
-					get_bits_no_markers(code_size);
-					extra_bits = get_bits_no_markers(num_extra_bits);
-				}
-			}
-
-			symbol &= 0xFF;
-		}
-
-		return symbol;
-	}
-
-	// Tables and macro used to fully decode the DPCM differences.
-	static const int s_extend_test[16] = { 0, 0x0001, 0x0002, 0x0004, 0x0008, 0x0010, 0x0020, 0x0040, 0x0080, 0x0100, 0x0200, 0x0400, 0x0800, 0x1000, 0x2000, 0x4000 };
-	static const int s_extend_offset[16] = { 0, -1, -3, -7, -15, -31, -63, -127, -255, -511, -1023, -2047, -4095, -8191, -16383, -32767 };
-	static const int s_extend_mask[] = { 0, (1<<0), (1<<1), (1<<2), (1<<3), (1<<4), (1<<5), (1<<6), (1<<7), (1<<8), (1<<9), (1<<10), (1<<11), (1<<12), (1<<13), (1<<14), (1<<15), (1<<16) };
-#define HUFF_EXTEND(x,s) ((x) < s_extend_test[s] ? (x) + s_extend_offset[s] : (x))
-
-	// Clamps a value between 0-255.
-	inline uint8 jpeg_decoder::clamp(int i)
-	{
-		if (static_cast<uint>(i) > 255)
-			i = (((~i) >> 31) & 0xFF);
-
-		return static_cast<uint8>(i);
-	}
-
-	namespace DCT_Upsample
-	{
-		struct Matrix44
-		{
-			typedef int Element_Type;
-			enum { NUM_ROWS = 4, NUM_COLS = 4 };
-
-			Element_Type v[NUM_ROWS][NUM_COLS];
-
-			inline int rows() const { return NUM_ROWS; }
-			inline int cols() const { return NUM_COLS; }
-
-			inline const Element_Type & at(int r, int c) const { return v[r][c]; }
-			inline       Element_Type & at(int r, int c)       { return v[r][c]; }
-
-			inline Matrix44() { }
-
-			inline Matrix44& operator += (const Matrix44& a)
-			{
-				for (int r = 0; r < NUM_ROWS; r++)
-				{
-					at(r, 0) += a.at(r, 0);
-					at(r, 1) += a.at(r, 1);
-					at(r, 2) += a.at(r, 2);
-					at(r, 3) += a.at(r, 3);
-				}
-				return *this;
-			}
-
-			inline Matrix44& operator -= (const Matrix44& a)
-			{
-				for (int r = 0; r < NUM_ROWS; r++)
-				{
-					at(r, 0) -= a.at(r, 0);
-					at(r, 1) -= a.at(r, 1);
-					at(r, 2) -= a.at(r, 2);
-					at(r, 3) -= a.at(r, 3);
-				}
-				return *this;
-			}
-
-			friend inline Matrix44 operator + (const Matrix44& a, const Matrix44& b)
-			{
-				Matrix44 ret;
-				for (int r = 0; r < NUM_ROWS; r++)
-				{
-					ret.at(r, 0) = a.at(r, 0) + b.at(r, 0);
-					ret.at(r, 1) = a.at(r, 1) + b.at(r, 1);
-					ret.at(r, 2) = a.at(r, 2) + b.at(r, 2);
-					ret.at(r, 3) = a.at(r, 3) + b.at(r, 3);
-				}
-				return ret;
-			}
-
-			friend inline Matrix44 operator - (const Matrix44& a, const Matrix44& b)
-			{
-				Matrix44 ret;
-				for (int r = 0; r < NUM_ROWS; r++)
-				{
-					ret.at(r, 0) = a.at(r, 0) - b.at(r, 0);
-					ret.at(r, 1) = a.at(r, 1) - b.at(r, 1);
-					ret.at(r, 2) = a.at(r, 2) - b.at(r, 2);
-					ret.at(r, 3) = a.at(r, 3) - b.at(r, 3);
-				}
-				return ret;
-			}
-
-			static inline void add_and_store(jpgd_block_t* pDst, const Matrix44& a, const Matrix44& b)
-			{
-				for (int r = 0; r < 4; r++)
-				{
-					pDst[0*8 + r] = static_cast<jpgd_block_t>(a.at(r, 0) + b.at(r, 0));
-					pDst[1*8 + r] = static_cast<jpgd_block_t>(a.at(r, 1) + b.at(r, 1));
-					pDst[2*8 + r] = static_cast<jpgd_block_t>(a.at(r, 2) + b.at(r, 2));
-					pDst[3*8 + r] = static_cast<jpgd_block_t>(a.at(r, 3) + b.at(r, 3));
-				}
-			}
-
-			static inline void sub_and_store(jpgd_block_t* pDst, const Matrix44& a, const Matrix44& b)
-			{
-				for (int r = 0; r < 4; r++)
-				{
-					pDst[0*8 + r] = static_cast<jpgd_block_t>(a.at(r, 0) - b.at(r, 0));
-					pDst[1*8 + r] = static_cast<jpgd_block_t>(a.at(r, 1) - b.at(r, 1));
-					pDst[2*8 + r] = static_cast<jpgd_block_t>(a.at(r, 2) - b.at(r, 2));
-					pDst[3*8 + r] = static_cast<jpgd_block_t>(a.at(r, 3) - b.at(r, 3));
-				}
-			}
-		};
-
-		const int FRACT_BITS = 10;
-		const int SCALE = 1 << FRACT_BITS;
-
-		typedef int Temp_Type;
-#define D(i) (((i) + (SCALE >> 1)) >> FRACT_BITS)
-#define F(i) ((int)((i) * SCALE + .5f))
-
-		// Any decent C++ compiler will optimize this at compile time to a 0, or an array access.
-#define AT(c, r) ((((c)>=NUM_COLS)||((r)>=NUM_ROWS)) ? 0 : pSrc[(c)+(r)*8])
-
-		// NUM_ROWS/NUM_COLS = # of non-zero rows/cols in input matrix
-		template<int NUM_ROWS, int NUM_COLS>
-		struct P_Q
-		{
-			static void calc(Matrix44& P, Matrix44& Q, const jpgd_block_t* pSrc)
-			{
-				// 4x8 = 4x8 times 8x8, matrix 0 is constant
-				const Temp_Type X000 = AT(0, 0);
-				const Temp_Type X001 = AT(0, 1);
-				const Temp_Type X002 = AT(0, 2);
-				const Temp_Type X003 = AT(0, 3);
-				const Temp_Type X004 = AT(0, 4);
-				const Temp_Type X005 = AT(0, 5);
-				const Temp_Type X006 = AT(0, 6);
-				const Temp_Type X007 = AT(0, 7);
-				const Temp_Type X010 = D(F(0.415735f) * AT(1, 0) + F(0.791065f) * AT(3, 0) + F(-0.352443f) * AT(5, 0) + F(0.277785f) * AT(7, 0));
-				const Temp_Type X011 = D(F(0.415735f) * AT(1, 1) + F(0.791065f) * AT(3, 1) + F(-0.352443f) * AT(5, 1) + F(0.277785f) * AT(7, 1));
-				const Temp_Type X012 = D(F(0.415735f) * AT(1, 2) + F(0.791065f) * AT(3, 2) + F(-0.352443f) * AT(5, 2) + F(0.277785f) * AT(7, 2));
-				const Temp_Type X013 = D(F(0.415735f) * AT(1, 3) + F(0.791065f) * AT(3, 3) + F(-0.352443f) * AT(5, 3) + F(0.277785f) * AT(7, 3));
-				const Temp_Type X014 = D(F(0.415735f) * AT(1, 4) + F(0.791065f) * AT(3, 4) + F(-0.352443f) * AT(5, 4) + F(0.277785f) * AT(7, 4));
-				const Temp_Type X015 = D(F(0.415735f) * AT(1, 5) + F(0.791065f) * AT(3, 5) + F(-0.352443f) * AT(5, 5) + F(0.277785f) * AT(7, 5));
-				const Temp_Type X016 = D(F(0.415735f) * AT(1, 6) + F(0.791065f) * AT(3, 6) + F(-0.352443f) * AT(5, 6) + F(0.277785f) * AT(7, 6));
-				const Temp_Type X017 = D(F(0.415735f) * AT(1, 7) + F(0.791065f) * AT(3, 7) + F(-0.352443f) * AT(5, 7) + F(0.277785f) * AT(7, 7));
-				const Temp_Type X020 = AT(4, 0);
-				const Temp_Type X021 = AT(4, 1);
-				const Temp_Type X022 = AT(4, 2);
-				const Temp_Type X023 = AT(4, 3);
-				const Temp_Type X024 = AT(4, 4);
-				const Temp_Type X025 = AT(4, 5);
-				const Temp_Type X026 = AT(4, 6);
-				const Temp_Type X027 = AT(4, 7);
-				const Temp_Type X030 = D(F(0.022887f) * AT(1, 0) + F(-0.097545f) * AT(3, 0) + F(0.490393f) * AT(5, 0) + F(0.865723f) * AT(7, 0));
-				const Temp_Type X031 = D(F(0.022887f) * AT(1, 1) + F(-0.097545f) * AT(3, 1) + F(0.490393f) * AT(5, 1) + F(0.865723f) * AT(7, 1));
-				const Temp_Type X032 = D(F(0.022887f) * AT(1, 2) + F(-0.097545f) * AT(3, 2) + F(0.490393f) * AT(5, 2) + F(0.865723f) * AT(7, 2));
-				const Temp_Type X033 = D(F(0.022887f) * AT(1, 3) + F(-0.097545f) * AT(3, 3) + F(0.490393f) * AT(5, 3) + F(0.865723f) * AT(7, 3));
-				const Temp_Type X034 = D(F(0.022887f) * AT(1, 4) + F(-0.097545f) * AT(3, 4) + F(0.490393f) * AT(5, 4) + F(0.865723f) * AT(7, 4));
-				const Temp_Type X035 = D(F(0.022887f) * AT(1, 5) + F(-0.097545f) * AT(3, 5) + F(0.490393f) * AT(5, 5) + F(0.865723f) * AT(7, 5));
-				const Temp_Type X036 = D(F(0.022887f) * AT(1, 6) + F(-0.097545f) * AT(3, 6) + F(0.490393f) * AT(5, 6) + F(0.865723f) * AT(7, 6));
-				const Temp_Type X037 = D(F(0.022887f) * AT(1, 7) + F(-0.097545f) * AT(3, 7) + F(0.490393f) * AT(5, 7) + F(0.865723f) * AT(7, 7));
-
-				// 4x4 = 4x8 times 8x4, matrix 1 is constant
-				P.at(0, 0) = X000;
-				P.at(0, 1) = D(X001 * F(0.415735f) + X003 * F(0.791065f) + X005 * F(-0.352443f) + X007 * F(0.277785f));
-				P.at(0, 2) = X004;
-				P.at(0, 3) = D(X001 * F(0.022887f) + X003 * F(-0.097545f) + X005 * F(0.490393f) + X007 * F(0.865723f));
-				P.at(1, 0) = X010;
-				P.at(1, 1) = D(X011 * F(0.415735f) + X013 * F(0.791065f) + X015 * F(-0.352443f) + X017 * F(0.277785f));
-				P.at(1, 2) = X014;
-				P.at(1, 3) = D(X011 * F(0.022887f) + X013 * F(-0.097545f) + X015 * F(0.490393f) + X017 * F(0.865723f));
-				P.at(2, 0) = X020;
-				P.at(2, 1) = D(X021 * F(0.415735f) + X023 * F(0.791065f) + X025 * F(-0.352443f) + X027 * F(0.277785f));
-				P.at(2, 2) = X024;
-				P.at(2, 3) = D(X021 * F(0.022887f) + X023 * F(-0.097545f) + X025 * F(0.490393f) + X027 * F(0.865723f));
-				P.at(3, 0) = X030;
-				P.at(3, 1) = D(X031 * F(0.415735f) + X033 * F(0.791065f) + X035 * F(-0.352443f) + X037 * F(0.277785f));
-				P.at(3, 2) = X034;
-				P.at(3, 3) = D(X031 * F(0.022887f) + X033 * F(-0.097545f) + X035 * F(0.490393f) + X037 * F(0.865723f));
-				// 40 muls 24 adds
-
-				// 4x4 = 4x8 times 8x4, matrix 1 is constant
-				Q.at(0, 0) = D(X001 * F(0.906127f) + X003 * F(-0.318190f) + X005 * F(0.212608f) + X007 * F(-0.180240f));
-				Q.at(0, 1) = X002;
-				Q.at(0, 2) = D(X001 * F(-0.074658f) + X003 * F(0.513280f) + X005 * F(0.768178f) + X007 * F(-0.375330f));
-				Q.at(0, 3) = X006;
-				Q.at(1, 0) = D(X011 * F(0.906127f) + X013 * F(-0.318190f) + X015 * F(0.212608f) + X017 * F(-0.180240f));
-				Q.at(1, 1) = X012;
-				Q.at(1, 2) = D(X011 * F(-0.074658f) + X013 * F(0.513280f) + X015 * F(0.768178f) + X017 * F(-0.375330f));
-				Q.at(1, 3) = X016;
-				Q.at(2, 0) = D(X021 * F(0.906127f) + X023 * F(-0.318190f) + X025 * F(0.212608f) + X027 * F(-0.180240f));
-				Q.at(2, 1) = X022;
-				Q.at(2, 2) = D(X021 * F(-0.074658f) + X023 * F(0.513280f) + X025 * F(0.768178f) + X027 * F(-0.375330f));
-				Q.at(2, 3) = X026;
-				Q.at(3, 0) = D(X031 * F(0.906127f) + X033 * F(-0.318190f) + X035 * F(0.212608f) + X037 * F(-0.180240f));
-				Q.at(3, 1) = X032;
-				Q.at(3, 2) = D(X031 * F(-0.074658f) + X033 * F(0.513280f) + X035 * F(0.768178f) + X037 * F(-0.375330f));
-				Q.at(3, 3) = X036;
-				// 40 muls 24 adds
-			}
-		};
-
-		template<int NUM_ROWS, int NUM_COLS>
-		struct R_S
-		{
-			static void calc(Matrix44& R, Matrix44& S, const jpgd_block_t* pSrc)
-			{
-				// 4x8 = 4x8 times 8x8, matrix 0 is constant
-				const Temp_Type X100 = D(F(0.906127f) * AT(1, 0) + F(-0.318190f) * AT(3, 0) + F(0.212608f) * AT(5, 0) + F(-0.180240f) * AT(7, 0));
-				const Temp_Type X101 = D(F(0.906127f) * AT(1, 1) + F(-0.318190f) * AT(3, 1) + F(0.212608f) * AT(5, 1) + F(-0.180240f) * AT(7, 1));
-				const Temp_Type X102 = D(F(0.906127f) * AT(1, 2) + F(-0.318190f) * AT(3, 2) + F(0.212608f) * AT(5, 2) + F(-0.180240f) * AT(7, 2));
-				const Temp_Type X103 = D(F(0.906127f) * AT(1, 3) + F(-0.318190f) * AT(3, 3) + F(0.212608f) * AT(5, 3) + F(-0.180240f) * AT(7, 3));
-				const Temp_Type X104 = D(F(0.906127f) * AT(1, 4) + F(-0.318190f) * AT(3, 4) + F(0.212608f) * AT(5, 4) + F(-0.180240f) * AT(7, 4));
-				const Temp_Type X105 = D(F(0.906127f) * AT(1, 5) + F(-0.318190f) * AT(3, 5) + F(0.212608f) * AT(5, 5) + F(-0.180240f) * AT(7, 5));
-				const Temp_Type X106 = D(F(0.906127f) * AT(1, 6) + F(-0.318190f) * AT(3, 6) + F(0.212608f) * AT(5, 6) + F(-0.180240f) * AT(7, 6));
-				const Temp_Type X107 = D(F(0.906127f) * AT(1, 7) + F(-0.318190f) * AT(3, 7) + F(0.212608f) * AT(5, 7) + F(-0.180240f) * AT(7, 7));
-				const Temp_Type X110 = AT(2, 0);
-				const Temp_Type X111 = AT(2, 1);
-				const Temp_Type X112 = AT(2, 2);
-				const Temp_Type X113 = AT(2, 3);
-				const Temp_Type X114 = AT(2, 4);
-				const Temp_Type X115 = AT(2, 5);
-				const Temp_Type X116 = AT(2, 6);
-				const Temp_Type X117 = AT(2, 7);
-				const Temp_Type X120 = D(F(-0.074658f) * AT(1, 0) + F(0.513280f) * AT(3, 0) + F(0.768178f) * AT(5, 0) + F(-0.375330f) * AT(7, 0));
-				const Temp_Type X121 = D(F(-0.074658f) * AT(1, 1) + F(0.513280f) * AT(3, 1) + F(0.768178f) * AT(5, 1) + F(-0.375330f) * AT(7, 1));
-				const Temp_Type X122 = D(F(-0.074658f) * AT(1, 2) + F(0.513280f) * AT(3, 2) + F(0.768178f) * AT(5, 2) + F(-0.375330f) * AT(7, 2));
-				const Temp_Type X123 = D(F(-0.074658f) * AT(1, 3) + F(0.513280f) * AT(3, 3) + F(0.768178f) * AT(5, 3) + F(-0.375330f) * AT(7, 3));
-				const Temp_Type X124 = D(F(-0.074658f) * AT(1, 4) + F(0.513280f) * AT(3, 4) + F(0.768178f) * AT(5, 4) + F(-0.375330f) * AT(7, 4));
-				const Temp_Type X125 = D(F(-0.074658f) * AT(1, 5) + F(0.513280f) * AT(3, 5) + F(0.768178f) * AT(5, 5) + F(-0.375330f) * AT(7, 5));
-				const Temp_Type X126 = D(F(-0.074658f) * AT(1, 6) + F(0.513280f) * AT(3, 6) + F(0.768178f) * AT(5, 6) + F(-0.375330f) * AT(7, 6));
-				const Temp_Type X127 = D(F(-0.074658f) * AT(1, 7) + F(0.513280f) * AT(3, 7) + F(0.768178f) * AT(5, 7) + F(-0.375330f) * AT(7, 7));
-				const Temp_Type X130 = AT(6, 0);
-				const Temp_Type X131 = AT(6, 1);
-				const Temp_Type X132 = AT(6, 2);
-				const Temp_Type X133 = AT(6, 3);
-				const Temp_Type X134 = AT(6, 4);
-				const Temp_Type X135 = AT(6, 5);
-				const Temp_Type X136 = AT(6, 6);
-				const Temp_Type X137 = AT(6, 7);
-				// 80 muls 48 adds
-
-				// 4x4 = 4x8 times 8x4, matrix 1 is constant
-				R.at(0, 0) = X100;
-				R.at(0, 1) = D(X101 * F(0.415735f) + X103 * F(0.791065f) + X105 * F(-0.352443f) + X107 * F(0.277785f));
-				R.at(0, 2) = X104;
-				R.at(0, 3) = D(X101 * F(0.022887f) + X103 * F(-0.097545f) + X105 * F(0.490393f) + X107 * F(0.865723f));
-				R.at(1, 0) = X110;
-				R.at(1, 1) = D(X111 * F(0.415735f) + X113 * F(0.791065f) + X115 * F(-0.352443f) + X117 * F(0.277785f));
-				R.at(1, 2) = X114;
-				R.at(1, 3) = D(X111 * F(0.022887f) + X113 * F(-0.097545f) + X115 * F(0.490393f) + X117 * F(0.865723f));
-				R.at(2, 0) = X120;
-				R.at(2, 1) = D(X121 * F(0.415735f) + X123 * F(0.791065f) + X125 * F(-0.352443f) + X127 * F(0.277785f));
-				R.at(2, 2) = X124;
-				R.at(2, 3) = D(X121 * F(0.022887f) + X123 * F(-0.097545f) + X125 * F(0.490393f) + X127 * F(0.865723f));
-				R.at(3, 0) = X130;
-				R.at(3, 1) = D(X131 * F(0.415735f) + X133 * F(0.791065f) + X135 * F(-0.352443f) + X137 * F(0.277785f));
-				R.at(3, 2) = X134;
-				R.at(3, 3) = D(X131 * F(0.022887f) + X133 * F(-0.097545f) + X135 * F(0.490393f) + X137 * F(0.865723f));
-				// 40 muls 24 adds
-				// 4x4 = 4x8 times 8x4, matrix 1 is constant
-				S.at(0, 0) = D(X101 * F(0.906127f) + X103 * F(-0.318190f) + X105 * F(0.212608f) + X107 * F(-0.180240f));
-				S.at(0, 1) = X102;
-				S.at(0, 2) = D(X101 * F(-0.074658f) + X103 * F(0.513280f) + X105 * F(0.768178f) + X107 * F(-0.375330f));
-				S.at(0, 3) = X106;
-				S.at(1, 0) = D(X111 * F(0.906127f) + X113 * F(-0.318190f) + X115 * F(0.212608f) + X117 * F(-0.180240f));
-				S.at(1, 1) = X112;
-				S.at(1, 2) = D(X111 * F(-0.074658f) + X113 * F(0.513280f) + X115 * F(0.768178f) + X117 * F(-0.375330f));
-				S.at(1, 3) = X116;
-				S.at(2, 0) = D(X121 * F(0.906127f) + X123 * F(-0.318190f) + X125 * F(0.212608f) + X127 * F(-0.180240f));
-				S.at(2, 1) = X122;
-				S.at(2, 2) = D(X121 * F(-0.074658f) + X123 * F(0.513280f) + X125 * F(0.768178f) + X127 * F(-0.375330f));
-				S.at(2, 3) = X126;
-				S.at(3, 0) = D(X131 * F(0.906127f) + X133 * F(-0.318190f) + X135 * F(0.212608f) + X137 * F(-0.180240f));
-				S.at(3, 1) = X132;
-				S.at(3, 2) = D(X131 * F(-0.074658f) + X133 * F(0.513280f) + X135 * F(0.768178f) + X137 * F(-0.375330f));
-				S.at(3, 3) = X136;
-				// 40 muls 24 adds
-			}
-		};
-	} // end namespace DCT_Upsample
-
-	// Unconditionally frees all allocated m_blocks.
-	void jpeg_decoder::free_all_blocks()
-	{
-		m_pStream = NULL;
-		for (mem_block *b = m_pMem_blocks; b; )
-		{
-			mem_block *n = b->m_pNext;
-			jpgd_free(b);
-			b = n;
-		}
-		m_pMem_blocks = NULL;
-	}
-
-	// This method handles all errors.
-	// It could easily be changed to use C++ exceptions.
-	void jpeg_decoder::stop_decoding(jpgd_status status)
-	{
-		m_error_code = status;
-		free_all_blocks();
-		longjmp(m_jmp_state, status);
-
-		// we shouldn't get here as longjmp shouldn't return, but we put it here to make it explicit
-		// that this function doesn't return, otherwise we get this error:
-		// 
-		// error : function declared 'noreturn' should not return
-		exit(1);
-	}
-
-	void *jpeg_decoder::alloc(size_t nSize, bool zero)
-	{
-		nSize = (JPGD_MAX(nSize, 1) + 3) & ~3;
-		char *rv = NULL;
-		for (mem_block *b = m_pMem_blocks; b; b = b->m_pNext)
-		{
-			if ((b->m_used_count + nSize) <= b->m_size)
-			{
-				rv = b->m_data + b->m_used_count;
-				b->m_used_count += nSize;
-				break;
-			}
-		}
-		if (!rv)
-		{
-			int capacity = JPGD_MAX(32768 - 256, (nSize + 2047) & ~2047);
-			mem_block *b = (mem_block*)jpgd_malloc(sizeof(mem_block) + capacity);
-			if (!b) stop_decoding(JPGD_NOTENOUGHMEM);
-			b->m_pNext = m_pMem_blocks; m_pMem_blocks = b;
-			b->m_used_count = nSize;
-			b->m_size = capacity;
-			rv = b->m_data;
-		}
-		if (zero) memset(rv, 0, nSize);
-		return rv;
-	}
-
-	void jpeg_decoder::word_clear(void *p, uint16 c, uint n)
-	{
-		uint8 *pD = (uint8*)p;
-		const uint8 l = c & 0xFF, h = (c >> 8) & 0xFF;
-		while (n)
-		{
-			pD[0] = l; pD[1] = h; pD += 2;
-			n--;
-		}
-	}
-
-	// Refill the input buffer.
-	// This method will sit in a loop until (A) the buffer is full or (B)
-	// the stream's read() method reports and end of file condition.
-	void jpeg_decoder::prep_in_buffer()
-	{
-		m_in_buf_left = 0;
-		m_pIn_buf_ofs = m_in_buf;
-
-		if (m_eof_flag)
-			return;
-
-		do
-		{
-			int bytes_read = m_pStream->read(m_in_buf + m_in_buf_left, JPGD_IN_BUF_SIZE - m_in_buf_left, &m_eof_flag);
-			if (bytes_read == -1)
-				stop_decoding(JPGD_STREAM_READ);
-
-			m_in_buf_left += bytes_read;
-		} while ((m_in_buf_left < JPGD_IN_BUF_SIZE) && (!m_eof_flag));
-
-		m_total_bytes_read += m_in_buf_left;
-
-		// Pad the end of the block with M_EOI (prevents the decompressor from going off the rails if the stream is invalid).
-		// (This dates way back to when this decompressor was written in C/asm, and the all-asm Huffman decoder did some fancy things to increase perf.)
-		word_clear(m_pIn_buf_ofs + m_in_buf_left, 0xD9FF, 64);
-	}
-
-	// Read a Huffman code table.
-	void jpeg_decoder::read_dht_marker()
-	{
-		int i, index, count;
-		uint8 huff_num[17];
-		uint8 huff_val[256];
-
-		uint num_left = get_bits(16);
-
-		if (num_left < 2)
-			stop_decoding(JPGD_BAD_DHT_MARKER);
-
-		num_left -= 2;
-
-		while (num_left)
-		{
-			index = get_bits(8);
-
-			huff_num[0] = 0;
-
-			count = 0;
-
-			for (i = 1; i <= 16; i++)
-			{
-				huff_num[i] = static_cast<uint8>(get_bits(8));
-				count += huff_num[i];
-			}
-
-			if (count > 255)
-				stop_decoding(JPGD_BAD_DHT_COUNTS);
-
-			for (i = 0; i < count; i++)
-				huff_val[i] = static_cast<uint8>(get_bits(8));
-
-			i = 1 + 16 + count;
-
-			if (num_left < (uint)i)
-				stop_decoding(JPGD_BAD_DHT_MARKER);
-
-			num_left -= i;
-
-			if ((index & 0x10) > 0x10)
-				stop_decoding(JPGD_BAD_DHT_INDEX);
-
-			index = (index & 0x0F) + ((index & 0x10) >> 4) * (JPGD_MAX_HUFF_TABLES >> 1);
-
-			if (index >= JPGD_MAX_HUFF_TABLES)
-				stop_decoding(JPGD_BAD_DHT_INDEX);
-
-			if (!m_huff_num[index])
-				m_huff_num[index] = (uint8 *)alloc(17);
-
-			if (!m_huff_val[index])
-				m_huff_val[index] = (uint8 *)alloc(256);
-
-			m_huff_ac[index] = (index & 0x10) != 0;
-			memcpy(m_huff_num[index], huff_num, 17);
-			memcpy(m_huff_val[index], huff_val, 256);
-		}
-	}
-
-	// Read a quantization table.
-	void jpeg_decoder::read_dqt_marker()
-	{
-		int n, i, prec;
-		uint num_left;
-		uint temp;
-
-		num_left = get_bits(16);
-
-		if (num_left < 2)
-			stop_decoding(JPGD_BAD_DQT_MARKER);
-
-		num_left -= 2;
-
-		while (num_left)
-		{
-			n = get_bits(8);
-			prec = n >> 4;
-			n &= 0x0F;
-
-			if (n >= JPGD_MAX_QUANT_TABLES)
-				stop_decoding(JPGD_BAD_DQT_TABLE);
-
-			if (!m_quant[n])
-				m_quant[n] = (jpgd_quant_t *)alloc(64 * sizeof(jpgd_quant_t));
-
-			// read quantization entries, in zag order
-			for (i = 0; i < 64; i++)
-			{
-				temp = get_bits(8);
-
-				if (prec)
-					temp = (temp << 8) + get_bits(8);
-
-				m_quant[n][i] = static_cast<jpgd_quant_t>(temp);
-			}
-
-			i = 64 + 1;
-
-			if (prec)
-				i += 64;
-
-			if (num_left < (uint)i)
-				stop_decoding(JPGD_BAD_DQT_LENGTH);
-
-			num_left -= i;
-		}
-	}
-
-	// Read the start of frame (SOF) marker.
-	void jpeg_decoder::read_sof_marker()
-	{
-		int i;
-		uint num_left;
-
-		num_left = get_bits(16);
-
-		if (get_bits(8) != 8)   /* precision: sorry, only 8-bit precision is supported right now */
-			stop_decoding(JPGD_BAD_PRECISION);
-
-		m_image_y_size = get_bits(16);
-
-		if ((m_image_y_size < 1) || (m_image_y_size > JPGD_MAX_HEIGHT))
-			stop_decoding(JPGD_BAD_HEIGHT);
-
-		m_image_x_size = get_bits(16);
-
-		if ((m_image_x_size < 1) || (m_image_x_size > JPGD_MAX_WIDTH))
-			stop_decoding(JPGD_BAD_WIDTH);
-
-		m_comps_in_frame = get_bits(8);
-
-		if (m_comps_in_frame > JPGD_MAX_COMPONENTS)
-			stop_decoding(JPGD_TOO_MANY_COMPONENTS);
-
-		if (num_left != (uint)(m_comps_in_frame * 3 + 8))
-			stop_decoding(JPGD_BAD_SOF_LENGTH);
-
-		for (i = 0; i < m_comps_in_frame; i++)
-		{
-			m_comp_ident[i]  = get_bits(8);
-			m_comp_h_samp[i] = get_bits(4);
-			m_comp_v_samp[i] = get_bits(4);
-			m_comp_quant[i]  = get_bits(8);
-		}
-	}
-
-	// Used to skip unrecognized markers.
-	void jpeg_decoder::skip_variable_marker()
-	{
-		uint num_left;
-
-		num_left = get_bits(16);
-
-		if (num_left < 2)
-			stop_decoding(JPGD_BAD_VARIABLE_MARKER);
-
-		num_left -= 2;
-
-		while (num_left)
-		{
-			get_bits(8);
-			num_left--;
-		}
-	}
-
-	// Read a define restart interval (DRI) marker.
-	void jpeg_decoder::read_dri_marker()
-	{
-		if (get_bits(16) != 4)
-			stop_decoding(JPGD_BAD_DRI_LENGTH);
-
-		m_restart_interval = get_bits(16);
-	}
-
-	// Read a start of scan (SOS) marker.
-	void jpeg_decoder::read_sos_marker()
-	{
-		uint num_left;
-		int i, ci, n, c, cc;
-
-		num_left = get_bits(16);
-
-		n = get_bits(8);
-
-		m_comps_in_scan = n;
-
-		num_left -= 3;
-
-		if ( (num_left != (uint)(n * 2 + 3)) || (n < 1) || (n > JPGD_MAX_COMPS_IN_SCAN) )
-			stop_decoding(JPGD_BAD_SOS_LENGTH);
-
-		for (i = 0; i < n; i++)
-		{
-			cc = get_bits(8);
-			c = get_bits(8);
-			num_left -= 2;
-
-			for (ci = 0; ci < m_comps_in_frame; ci++)
-				if (cc == m_comp_ident[ci])
-					break;
-
-			if (ci >= m_comps_in_frame)
-				stop_decoding(JPGD_BAD_SOS_COMP_ID);
-
-			m_comp_list[i]    = ci;
-			m_comp_dc_tab[ci] = (c >> 4) & 15;
-			m_comp_ac_tab[ci] = (c & 15) + (JPGD_MAX_HUFF_TABLES >> 1);
-		}
-
-		m_spectral_start  = get_bits(8);
-		m_spectral_end    = get_bits(8);
-		m_successive_high = get_bits(4);
-		m_successive_low  = get_bits(4);
-
-		if (!m_progressive_flag)
-		{
-			m_spectral_start = 0;
-			m_spectral_end = 63;
-		}
-
-		num_left -= 3;
-
-		while (num_left)                  /* read past whatever is num_left */
-		{
-			get_bits(8);
-			num_left--;
-		}
-	}
-
-	// Finds the next marker.
-	int jpeg_decoder::next_marker()
-	{
-		uint c, bytes;
-
-		bytes = 0;
-
-		do
-		{
-			do
-			{
-				bytes++;
-				c = get_bits(8);
-			} while (c != 0xFF);
-
-			do
-			{
-				c = get_bits(8);
-			} while (c == 0xFF);
-
-		} while (c == 0);
-
-		// If bytes > 0 here, there where extra bytes before the marker (not good).
-
-		return c;
-	}
-
-	// Process markers. Returns when an SOFx, SOI, EOI, or SOS marker is
-	// encountered.
-	int jpeg_decoder::process_markers()
-	{
-		int c;
-
-		for ( ; ; )
-		{
-			c = next_marker();
-
-			switch (c)
-			{
-			case M_SOF0:
-			case M_SOF1:
-			case M_SOF2:
-			case M_SOF3:
-			case M_SOF5:
-			case M_SOF6:
-			case M_SOF7:
-				//      case M_JPG:
-			case M_SOF9:
-			case M_SOF10:
-			case M_SOF11:
-			case M_SOF13:
-			case M_SOF14:
-			case M_SOF15:
-			case M_SOI:
-			case M_EOI:
-			case M_SOS:
-				{
-					return c;
-				}
-			case M_DHT:
-				{
-					read_dht_marker();
-					break;
-				}
-				// No arithmitic support - dumb patents!
-			case M_DAC:
-				{
-					stop_decoding(JPGD_NO_ARITHMITIC_SUPPORT);
-					break;
-				}
-			case M_DQT:
-				{
-					read_dqt_marker();
-					break;
-				}
-			case M_DRI:
-				{
-					read_dri_marker();
-					break;
-				}
-				//case M_APP0:  /* no need to read the JFIF marker */
-
-			case M_JPG:
-			case M_RST0:    /* no parameters */
-			case M_RST1:
-			case M_RST2:
-			case M_RST3:
-			case M_RST4:
-			case M_RST5:
-			case M_RST6:
-			case M_RST7:
-			case M_TEM:
-				{
-					stop_decoding(JPGD_UNEXPECTED_MARKER);
-					break;
-				}
-			default:    /* must be DNL, DHP, EXP, APPn, JPGn, COM, or RESn or APP0 */
-				{
-					skip_variable_marker();
-					break;
-				}
-			}
-		}
-	}
-
-	// Finds the start of image (SOI) marker.
-	// This code is rather defensive: it only checks the first 512 bytes to avoid
-	// false positives.
-	void jpeg_decoder::locate_soi_marker()
-	{
-		uint lastchar, thischar;
-		uint bytesleft;
-
-		lastchar = get_bits(8);
-
-		thischar = get_bits(8);
-
-		/* ok if it's a normal JPEG file without a special header */
-
-		if ((lastchar == 0xFF) && (thischar == M_SOI))
-			return;
-
-		bytesleft = 4096; //512;
-
-		for ( ; ; )
-		{
-			if (--bytesleft == 0)
-				stop_decoding(JPGD_NOT_JPEG);
-
-			lastchar = thischar;
-
-			thischar = get_bits(8);
-
-			if (lastchar == 0xFF)
-			{
-				if (thischar == M_SOI)
-					break;
-				else if (thischar == M_EOI) // get_bits will keep returning M_EOI if we read past the end
-					stop_decoding(JPGD_NOT_JPEG);
-			}
-		}
-
-		// Check the next character after marker: if it's not 0xFF, it can't be the start of the next marker, so the file is bad.
-		thischar = (m_bit_buf >> 24) & 0xFF;
-
-		if (thischar != 0xFF)
-			stop_decoding(JPGD_NOT_JPEG);
-	}
-
-	// Find a start of frame (SOF) marker.
-	void jpeg_decoder::locate_sof_marker()
-	{
-		locate_soi_marker();
-
-		int c = process_markers();
-
-		switch (c)
-		{
-		case M_SOF2:
-			m_progressive_flag = JPGD_TRUE;
-		case M_SOF0:  /* baseline DCT */
-		case M_SOF1:  /* extended sequential DCT */
-			{
-				read_sof_marker();
-				break;
-			}
-		case M_SOF9:  /* Arithmitic coding */
-			{
-				stop_decoding(JPGD_NO_ARITHMITIC_SUPPORT);
-				break;
-			}
-		default:
-			{
-				stop_decoding(JPGD_UNSUPPORTED_MARKER);
-				break;
-			}
-		}
-	}
-
-	// Find a start of scan (SOS) marker.
-	int jpeg_decoder::locate_sos_marker()
-	{
-		int c;
-
-		c = process_markers();
-
-		if (c == M_EOI)
-			return JPGD_FALSE;
-		else if (c != M_SOS)
-			stop_decoding(JPGD_UNEXPECTED_MARKER);
-
-		read_sos_marker();
-
-		return JPGD_TRUE;
-	}
-
-	// Reset everything to default/uninitialized state.
-	void jpeg_decoder::init(jpeg_decoder_stream *pStream)
-	{
-		m_pMem_blocks = NULL;
-		m_error_code = JPGD_SUCCESS;
-		m_ready_flag = false;
-		m_image_x_size = m_image_y_size = 0;
-		m_pStream = pStream;
-		m_progressive_flag = JPGD_FALSE;
-
-		memset(m_huff_ac, 0, sizeof(m_huff_ac));
-		memset(m_huff_num, 0, sizeof(m_huff_num));
-		memset(m_huff_val, 0, sizeof(m_huff_val));
-		memset(m_quant, 0, sizeof(m_quant));
-
-		m_scan_type = 0;
-		m_comps_in_frame = 0;
-
-		memset(m_comp_h_samp, 0, sizeof(m_comp_h_samp));
-		memset(m_comp_v_samp, 0, sizeof(m_comp_v_samp));
-		memset(m_comp_quant, 0, sizeof(m_comp_quant));
-		memset(m_comp_ident, 0, sizeof(m_comp_ident));
-		memset(m_comp_h_blocks, 0, sizeof(m_comp_h_blocks));
-		memset(m_comp_v_blocks, 0, sizeof(m_comp_v_blocks));
-
-		m_comps_in_scan = 0;
-		memset(m_comp_list, 0, sizeof(m_comp_list));
-		memset(m_comp_dc_tab, 0, sizeof(m_comp_dc_tab));
-		memset(m_comp_ac_tab, 0, sizeof(m_comp_ac_tab));
-
-		m_spectral_start = 0;
-		m_spectral_end = 0;
-		m_successive_low = 0;
-		m_successive_high = 0;
-		m_max_mcu_x_size = 0;
-		m_max_mcu_y_size = 0;
-		m_blocks_per_mcu = 0;
-		m_max_blocks_per_row = 0;
-		m_mcus_per_row = 0;
-		m_mcus_per_col = 0;
-		m_expanded_blocks_per_component = 0;
-		m_expanded_blocks_per_mcu = 0;
-		m_expanded_blocks_per_row = 0;
-		m_freq_domain_chroma_upsample = false;
-
-		memset(m_mcu_org, 0, sizeof(m_mcu_org));
-
-		m_total_lines_left = 0;
-		m_mcu_lines_left = 0;
-		m_real_dest_bytes_per_scan_line = 0;
-		m_dest_bytes_per_scan_line = 0;
-		m_dest_bytes_per_pixel = 0;
-
-		memset(m_pHuff_tabs, 0, sizeof(m_pHuff_tabs));
-
-		memset(m_dc_coeffs, 0, sizeof(m_dc_coeffs));
-		memset(m_ac_coeffs, 0, sizeof(m_ac_coeffs));
-		memset(m_block_y_mcu, 0, sizeof(m_block_y_mcu));
-
-		m_eob_run = 0;
-
-		memset(m_block_y_mcu, 0, sizeof(m_block_y_mcu));
-
-		m_pIn_buf_ofs = m_in_buf;
-		m_in_buf_left = 0;
-		m_eof_flag = false;
-		m_tem_flag = 0;
-
-		memset(m_in_buf_pad_start, 0, sizeof(m_in_buf_pad_start));
-		memset(m_in_buf, 0, sizeof(m_in_buf));
-		memset(m_in_buf_pad_end, 0, sizeof(m_in_buf_pad_end));
-
-		m_restart_interval = 0;
-		m_restarts_left    = 0;
-		m_next_restart_num = 0;
-
-		m_max_mcus_per_row = 0;
-		m_max_blocks_per_mcu = 0;
-		m_max_mcus_per_col = 0;
-
-		memset(m_last_dc_val, 0, sizeof(m_last_dc_val));
-		m_pMCU_coefficients = NULL;
-		m_pSample_buf = NULL;
-
-		m_total_bytes_read = 0;
-
-		m_pScan_line_0 = NULL;
-		m_pScan_line_1 = NULL;
-
-		// Ready the input buffer.
-		prep_in_buffer();
-
-		// Prime the bit buffer.
-		m_bits_left = 16;
-		m_bit_buf = 0;
-
-		get_bits(16);
-		get_bits(16);
-
-		for (int i = 0; i < JPGD_MAX_BLOCKS_PER_MCU; i++)
-			m_mcu_block_max_zag[i] = 64;
-	}
-
-#define SCALEBITS 16
-#define ONE_HALF  ((int) 1 << (SCALEBITS-1))
-#define FIX(x)    ((int) ((x) * (1L<<SCALEBITS) + 0.5f))
-
-	// Create a few tables that allow us to quickly convert YCbCr to RGB.
-	void jpeg_decoder::create_look_ups()
-	{
-		for (int i = 0; i <= 255; i++)
-		{
-			int k = i - 128;
-			m_crr[i] = ( FIX(1.40200f)  * k + ONE_HALF) >> SCALEBITS;
-			m_cbb[i] = ( FIX(1.77200f)  * k + ONE_HALF) >> SCALEBITS;
-			m_crg[i] = (-FIX(0.71414f)) * k;
-			m_cbg[i] = (-FIX(0.34414f)) * k + ONE_HALF;
-		}
-	}
-
-	// This method throws back into the stream any bytes that where read
-	// into the bit buffer during initial marker scanning.
-	void jpeg_decoder::fix_in_buffer()
-	{
-		// In case any 0xFF's where pulled into the buffer during marker scanning.
-		JPGD_ASSERT((m_bits_left & 7) == 0);
-
-		if (m_bits_left == 16)
-			stuff_char( (uint8)(m_bit_buf & 0xFF));
-
-		if (m_bits_left >= 8)
-			stuff_char( (uint8)((m_bit_buf >> 8) & 0xFF));
-
-		stuff_char((uint8)((m_bit_buf >> 16) & 0xFF));
-		stuff_char((uint8)((m_bit_buf >> 24) & 0xFF));
-
-		m_bits_left = 16;
-		get_bits_no_markers(16);
-		get_bits_no_markers(16);
-	}
-
-	void jpeg_decoder::transform_mcu(int mcu_row)
-	{
-		jpgd_block_t* pSrc_ptr = m_pMCU_coefficients;
-		uint8* pDst_ptr = m_pSample_buf + mcu_row * m_blocks_per_mcu * 64;
-
-		for (int mcu_block = 0; mcu_block < m_blocks_per_mcu; mcu_block++)
-		{
-			idct(pSrc_ptr, pDst_ptr, m_mcu_block_max_zag[mcu_block]);
-			pSrc_ptr += 64;
-			pDst_ptr += 64;
-		}
-	}
-
-	static const uint8 s_max_rc[64] =
-	{
-		17, 18, 34, 50, 50, 51, 52, 52, 52, 68, 84, 84, 84, 84, 85, 86, 86, 86, 86, 86,
-		102, 118, 118, 118, 118, 118, 118, 119, 120, 120, 120, 120, 120, 120, 120, 136,
-		136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136,
-		136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136
-	};
-
-	void jpeg_decoder::transform_mcu_expand(int mcu_row)
-	{
-		jpgd_block_t* pSrc_ptr = m_pMCU_coefficients;
-		uint8* pDst_ptr = m_pSample_buf + mcu_row * m_expanded_blocks_per_mcu * 64;
-
-		// Y IDCT
-		int mcu_block;
-		for (mcu_block = 0; mcu_block < m_expanded_blocks_per_component; mcu_block++)
-		{
-			idct(pSrc_ptr, pDst_ptr, m_mcu_block_max_zag[mcu_block]);
-			pSrc_ptr += 64;
-			pDst_ptr += 64;
-		}
-
-		// Chroma IDCT, with upsampling
-		jpgd_block_t temp_block[64];
-
-		for (int i = 0; i < 2; i++)
-		{
-			DCT_Upsample::Matrix44 P, Q, R, S;
-
-			JPGD_ASSERT(m_mcu_block_max_zag[mcu_block] >= 1);
-			JPGD_ASSERT(m_mcu_block_max_zag[mcu_block] <= 64);
-
-			switch (s_max_rc[m_mcu_block_max_zag[mcu_block++] - 1])
-			{
-			case 1*16+1:
-				DCT_Upsample::P_Q<1, 1>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<1, 1>::calc(R, S, pSrc_ptr);
-				break;
-			case 1*16+2:
-				DCT_Upsample::P_Q<1, 2>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<1, 2>::calc(R, S, pSrc_ptr);
-				break;
-			case 2*16+2:
-				DCT_Upsample::P_Q<2, 2>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<2, 2>::calc(R, S, pSrc_ptr);
-				break;
-			case 3*16+2:
-				DCT_Upsample::P_Q<3, 2>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<3, 2>::calc(R, S, pSrc_ptr);
-				break;
-			case 3*16+3:
-				DCT_Upsample::P_Q<3, 3>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<3, 3>::calc(R, S, pSrc_ptr);
-				break;
-			case 3*16+4:
-				DCT_Upsample::P_Q<3, 4>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<3, 4>::calc(R, S, pSrc_ptr);
-				break;
-			case 4*16+4:
-				DCT_Upsample::P_Q<4, 4>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<4, 4>::calc(R, S, pSrc_ptr);
-				break;
-			case 5*16+4:
-				DCT_Upsample::P_Q<5, 4>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<5, 4>::calc(R, S, pSrc_ptr);
-				break;
-			case 5*16+5:
-				DCT_Upsample::P_Q<5, 5>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<5, 5>::calc(R, S, pSrc_ptr);
-				break;
-			case 5*16+6:
-				DCT_Upsample::P_Q<5, 6>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<5, 6>::calc(R, S, pSrc_ptr);
-				break;
-			case 6*16+6:
-				DCT_Upsample::P_Q<6, 6>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<6, 6>::calc(R, S, pSrc_ptr);
-				break;
-			case 7*16+6:
-				DCT_Upsample::P_Q<7, 6>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<7, 6>::calc(R, S, pSrc_ptr);
-				break;
-			case 7*16+7:
-				DCT_Upsample::P_Q<7, 7>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<7, 7>::calc(R, S, pSrc_ptr);
-				break;
-			case 7*16+8:
-				DCT_Upsample::P_Q<7, 8>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<7, 8>::calc(R, S, pSrc_ptr);
-				break;
-			case 8*16+8:
-				DCT_Upsample::P_Q<8, 8>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<8, 8>::calc(R, S, pSrc_ptr);
-				break;
-			default:
-				JPGD_ASSERT(false);
-			}
-
-			DCT_Upsample::Matrix44 a(P + Q); P -= Q;
-			DCT_Upsample::Matrix44& b = P;
-			DCT_Upsample::Matrix44 c(R + S); R -= S;
-			DCT_Upsample::Matrix44& d = R;
-
-			DCT_Upsample::Matrix44::add_and_store(temp_block, a, c);
-			idct_4x4(temp_block, pDst_ptr);
-			pDst_ptr += 64;
-
-			DCT_Upsample::Matrix44::sub_and_store(temp_block, a, c);
-			idct_4x4(temp_block, pDst_ptr);
-			pDst_ptr += 64;
-
-			DCT_Upsample::Matrix44::add_and_store(temp_block, b, d);
-			idct_4x4(temp_block, pDst_ptr);
-			pDst_ptr += 64;
-
-			DCT_Upsample::Matrix44::sub_and_store(temp_block, b, d);
-			idct_4x4(temp_block, pDst_ptr);
-			pDst_ptr += 64;
-
-			pSrc_ptr += 64;
-		}
-	}
-
-	// Loads and dequantizes the next row of (already decoded) coefficients.
-	// Progressive images only.
-	void jpeg_decoder::load_next_row()
-	{
-		int i;
-		jpgd_block_t *p;
-		jpgd_quant_t *q;
-		int mcu_row, mcu_block, row_block = 0;
-		int component_num, component_id;
-		int block_x_mcu[JPGD_MAX_COMPONENTS];
-
-		memset(block_x_mcu, 0, JPGD_MAX_COMPONENTS * sizeof(int));
-
-		for (mcu_row = 0; mcu_row < m_mcus_per_row; mcu_row++)
-		{
-			int block_x_mcu_ofs = 0, block_y_mcu_ofs = 0;
-
-			for (mcu_block = 0; mcu_block < m_blocks_per_mcu; mcu_block++)
-			{
-				component_id = m_mcu_org[mcu_block];
-				q = m_quant[m_comp_quant[component_id]];
-
-				p = m_pMCU_coefficients + 64 * mcu_block;
-
-				jpgd_block_t* pAC = coeff_buf_getp(m_ac_coeffs[component_id], block_x_mcu[component_id] + block_x_mcu_ofs, m_block_y_mcu[component_id] + block_y_mcu_ofs);
-				jpgd_block_t* pDC = coeff_buf_getp(m_dc_coeffs[component_id], block_x_mcu[component_id] + block_x_mcu_ofs, m_block_y_mcu[component_id] + block_y_mcu_ofs);
-				p[0] = pDC[0];
-				memcpy(&p[1], &pAC[1], 63 * sizeof(jpgd_block_t));
-
-				for (i = 63; i > 0; i--)
-					if (p[g_ZAG[i]])
-						break;
-
-				m_mcu_block_max_zag[mcu_block] = i + 1;
-
-				for ( ; i >= 0; i--)
-					if (p[g_ZAG[i]])
-						p[g_ZAG[i]] = static_cast<jpgd_block_t>(p[g_ZAG[i]] * q[i]);
-
-				row_block++;
-
-				if (m_comps_in_scan == 1)
-					block_x_mcu[component_id]++;
-				else
-				{
-					if (++block_x_mcu_ofs == m_comp_h_samp[component_id])
-					{
-						block_x_mcu_ofs = 0;
-
-						if (++block_y_mcu_ofs == m_comp_v_samp[component_id])
-						{
-							block_y_mcu_ofs = 0;
-
-							block_x_mcu[component_id] += m_comp_h_samp[component_id];
-						}
-					}
-				}
-			}
-
-			if (m_freq_domain_chroma_upsample)
-				transform_mcu_expand(mcu_row);
-			else
-				transform_mcu(mcu_row);
-		}
-
-		if (m_comps_in_scan == 1)
-			m_block_y_mcu[m_comp_list[0]]++;
-		else
-		{
-			for (component_num = 0; component_num < m_comps_in_scan; component_num++)
-			{
-				component_id = m_comp_list[component_num];
-
-				m_block_y_mcu[component_id] += m_comp_v_samp[component_id];
-			}
-		}
-	}
-
-	// Restart interval processing.
-	void jpeg_decoder::process_restart()
-	{
-		int i;
-		int c = 0;
-
-		// Align to a byte boundry
-		// FIXME: Is this really necessary? get_bits_no_markers() never reads in markers!
-		//get_bits_no_markers(m_bits_left & 7);
-
-		// Let's scan a little bit to find the marker, but not _too_ far.
-		// 1536 is a "fudge factor" that determines how much to scan.
-		for (i = 1536; i > 0; i--)
-			if (get_char() == 0xFF)
-				break;
-
-		if (i == 0)
-			stop_decoding(JPGD_BAD_RESTART_MARKER);
-
-		for ( ; i > 0; i--)
-			if ((c = get_char()) != 0xFF)
-				break;
-
-		if (i == 0)
-			stop_decoding(JPGD_BAD_RESTART_MARKER);
-
-		// Is it the expected marker? If not, something bad happened.
-		if (c != (m_next_restart_num + M_RST0))
-			stop_decoding(JPGD_BAD_RESTART_MARKER);
-
-		// Reset each component's DC prediction values.
-		memset(&m_last_dc_val, 0, m_comps_in_frame * sizeof(uint));
-
-		m_eob_run = 0;
-
-		m_restarts_left = m_restart_interval;
-
-		m_next_restart_num = (m_next_restart_num + 1) & 7;
-
-		// Get the bit buffer going again...
-
-		m_bits_left = 16;
-		get_bits_no_markers(16);
-		get_bits_no_markers(16);
-	}
-
-	static inline int dequantize_ac(int c, int q) {	c *= q;	return c; }
-
-	// Decodes and dequantizes the next row of coefficients.
-	void jpeg_decoder::decode_next_row()
-	{
-		int row_block = 0;
-
-		for (int mcu_row = 0; mcu_row < m_mcus_per_row; mcu_row++)
-		{
-			if ((m_restart_interval) && (m_restarts_left == 0))
-				process_restart();
-
-			jpgd_block_t* p = m_pMCU_coefficients;
-			for (int mcu_block = 0; mcu_block < m_blocks_per_mcu; mcu_block++, p += 64)
-			{
-				int component_id = m_mcu_org[mcu_block];
-				jpgd_quant_t* q = m_quant[m_comp_quant[component_id]];
-
-				int r, s;
-				s = huff_decode(m_pHuff_tabs[m_comp_dc_tab[component_id]], r);
-				s = HUFF_EXTEND(r, s);
-
-				m_last_dc_val[component_id] = (s += m_last_dc_val[component_id]);
-
-				p[0] = static_cast<jpgd_block_t>(s * q[0]);
-
-				int prev_num_set = m_mcu_block_max_zag[mcu_block];
-
-				huff_tables *pH = m_pHuff_tabs[m_comp_ac_tab[component_id]];
-
-				int k;
-				for (k = 1; k < 64; k++)
-				{
-					int extra_bits;
-					s = huff_decode(pH, extra_bits);
-
-					r = s >> 4;
-					s &= 15;
-
-					if (s)
-					{
-						if (r)
-						{
-							if ((k + r) > 63)
-								stop_decoding(JPGD_DECODE_ERROR);
-
-							if (k < prev_num_set)
-							{
-								int n = JPGD_MIN(r, prev_num_set - k);
-								int kt = k;
-								while (n--)
-									p[g_ZAG[kt++]] = 0;
-							}
-
-							k += r;
-						}
-
-						s = HUFF_EXTEND(extra_bits, s);
-
-						JPGD_ASSERT(k < 64);
-
-						p[g_ZAG[k]] = static_cast<jpgd_block_t>(dequantize_ac(s, q[k])); //s * q[k];
-					}
-					else
-					{
-						if (r == 15)
-						{
-							if ((k + 16) > 64)
-								stop_decoding(JPGD_DECODE_ERROR);
-
-							if (k < prev_num_set)
-							{
-								int n = JPGD_MIN(16, prev_num_set - k);
-								int kt = k;
-								while (n--)
-								{
-									JPGD_ASSERT(kt <= 63);
-									p[g_ZAG[kt++]] = 0;
-								}
-							}
-
-							k += 16 - 1; // - 1 because the loop counter is k
-							// BEGIN EPIC MOD
-							JPGD_ASSERT(k < 64 && p[g_ZAG[k]] == 0);
-							// END EPIC MOD
-						}
-						else
-							break;
-					}
-				}
-
-				if (k < prev_num_set)
-				{
-					int kt = k;
-					while (kt < prev_num_set)
-						p[g_ZAG[kt++]] = 0;
-				}
-
-				m_mcu_block_max_zag[mcu_block] = k;
-
-				row_block++;
-			}
-
-			if (m_freq_domain_chroma_upsample)
-				transform_mcu_expand(mcu_row);
-			else
-				transform_mcu(mcu_row);
-
-			m_restarts_left--;
-		}
-	}
-
-	// YCbCr H1V1 (1x1:1:1, 3 m_blocks per MCU) to RGB
-	void jpeg_decoder::H1V1Convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d = m_pScan_line_0;
-		uint8 *s = m_pSample_buf + row * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int j = 0; j < 8; j++)
-			{
-				int y = s[j];
-				int cb = s[64+j];
-				int cr = s[128+j];
-
-				if (jpg_format == ERGBFormatJPG::BGRA)
-				{
-					d[0] = clamp(y + m_cbb[cb]);
-					d[1] = clamp(y + ((m_crg[cr] + m_cbg[cb]) >> 16));
-					d[2] = clamp(y + m_crr[cr]);
-					d[3] = 255;
-				}
-				else
-				{
-					d[0] = clamp(y + m_crr[cr]);
-					d[1] = clamp(y + ((m_crg[cr] + m_cbg[cb]) >> 16));
-					d[2] = clamp(y + m_cbb[cb]);
-					d[3] = 255;
-				}
-				d += 4;
-			}
-
-			s += 64*3;
-		}
-	}
-
-	// YCbCr H2V1 (2x1:1:1, 4 m_blocks per MCU) to RGB
-	void jpeg_decoder::H2V1Convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d0 = m_pScan_line_0;
-		uint8 *y = m_pSample_buf + row * 8;
-		uint8 *c = m_pSample_buf + 2*64 + row * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int l = 0; l < 2; l++)
-			{
-				for (int j = 0; j < 4; j++)
-				{
-					int cb = c[0];
-					int cr = c[64];
-
-					int rc = m_crr[cr];
-					int gc = ((m_crg[cr] + m_cbg[cb]) >> 16);
-					int bc = m_cbb[cb];
-
-					int yy = y[j<<1];
-					if (jpg_format == ERGBFormatJPG::BGRA)
-					{
-						d0[0] = clamp(yy+bc);
-						d0[1] = clamp(yy+gc);
-						d0[2] = clamp(yy+rc);
-						d0[3] = 255;
-						yy = y[(j<<1)+1];
-						d0[4] = clamp(yy+bc);
-						d0[5] = clamp(yy+gc);
-						d0[6] = clamp(yy+rc);
-						d0[7] = 255;
-					}
-					else
-					{
-						d0[0] = clamp(yy+rc);
-						d0[1] = clamp(yy+gc);
-						d0[2] = clamp(yy+bc);
-						d0[3] = 255;
-						yy = y[(j<<1)+1];
-						d0[4] = clamp(yy+rc);
-						d0[5] = clamp(yy+gc);
-						d0[6] = clamp(yy+bc);
-						d0[7] = 255;
-					}
-
-					d0 += 8;
-
-					c++;
-				}
-				y += 64;
-			}
-
-			y += 64*4 - 64*2;
-			c += 64*4 - 8;
-		}
-	}
-
-	// YCbCr H2V1 (1x2:1:1, 4 m_blocks per MCU) to RGB
-	void jpeg_decoder::H1V2Convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d0 = m_pScan_line_0;
-		uint8 *d1 = m_pScan_line_1;
-		uint8 *y;
-		uint8 *c;
-
-		if (row < 8)
-			y = m_pSample_buf + row * 8;
-		else
-			y = m_pSample_buf + 64*1 + (row & 7) * 8;
-
-		c = m_pSample_buf + 64*2 + (row >> 1) * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int j = 0; j < 8; j++)
-			{
-				int cb = c[0+j];
-				int cr = c[64+j];
-
-				int rc = m_crr[cr];
-				int gc = ((m_crg[cr] + m_cbg[cb]) >> 16);
-				int bc = m_cbb[cb];
-
-				int yy = y[j];
-				if (jpg_format == ERGBFormatJPG::BGRA)
-				{
-					d0[0] = clamp(yy+bc);
-					d0[1] = clamp(yy+gc);
-					d0[2] = clamp(yy+rc);
-					d0[3] = 255;
-					yy = y[8+j];
-					d1[0] = clamp(yy+bc);
-					d1[1] = clamp(yy+gc);
-					d1[2] = clamp(yy+rc);
-					d1[3] = 255;
-				}
-				else
-				{
-					d0[0] = clamp(yy+rc);
-					d0[1] = clamp(yy+gc);
-					d0[2] = clamp(yy+bc);
-					d0[3] = 255;
-					yy = y[8+j];
-					d1[0] = clamp(yy+rc);
-					d1[1] = clamp(yy+gc);
-					d1[2] = clamp(yy+bc);
-					d1[3] = 255;
-				}
-
-				d0 += 4;
-				d1 += 4;
-			}
-
-			y += 64*4;
-			c += 64*4;
-		}
-	}
-
-	// YCbCr H2V2 (2x2:1:1, 6 m_blocks per MCU) to RGB
-	void jpeg_decoder::H2V2Convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d0 = m_pScan_line_0;
-		uint8 *d1 = m_pScan_line_1;
-		uint8 *y;
-		uint8 *c;
-
-		if (row < 8)
-			y = m_pSample_buf + row * 8;
-		else
-			y = m_pSample_buf + 64*2 + (row & 7) * 8;
-
-		c = m_pSample_buf + 64*4 + (row >> 1) * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int l = 0; l < 2; l++)
-			{
-				for (int j = 0; j < 8; j += 2)
-				{
-					int cb = c[0];
-					int cr = c[64];
-
-					int rc = m_crr[cr];
-					int gc = ((m_crg[cr] + m_cbg[cb]) >> 16);
-					int bc = m_cbb[cb];
-
-					int yy = y[j];
-					if (jpg_format == ERGBFormatJPG::BGRA)
-					{
-						d0[0] = clamp(yy+bc);
-						d0[1] = clamp(yy+gc);
-						d0[2] = clamp(yy+rc);
-						d0[3] = 255;
-						yy = y[j+1];
-						d0[4] = clamp(yy+bc);
-						d0[5] = clamp(yy+gc);
-						d0[6] = clamp(yy+rc);
-						d0[7] = 255;
-						yy = y[j+8];
-						d1[0] = clamp(yy+bc);
-						d1[1] = clamp(yy+gc);
-						d1[2] = clamp(yy+rc);
-						d1[3] = 255;
-						yy = y[j+8+1];
-						d1[4] = clamp(yy+bc);
-						d1[5] = clamp(yy+gc);
-						d1[6] = clamp(yy+rc);
-						d1[7] = 255;
-					}
-					else
-					{
-						d0[0] = clamp(yy+rc);
-						d0[1] = clamp(yy+gc);
-						d0[2] = clamp(yy+bc);
-						d0[3] = 255;
-						yy = y[j+1];
-						d0[4] = clamp(yy+rc);
-						d0[5] = clamp(yy+gc);
-						d0[6] = clamp(yy+bc);
-						d0[7] = 255;
-						yy = y[j+8];
-						d1[0] = clamp(yy+rc);
-						d1[1] = clamp(yy+gc);
-						d1[2] = clamp(yy+bc);
-						d1[3] = 255;
-						yy = y[j+8+1];
-						d1[4] = clamp(yy+rc);
-						d1[5] = clamp(yy+gc);
-						d1[6] = clamp(yy+bc);
-						d1[7] = 255;
-					}
-
-					d0 += 8;
-					d1 += 8;
-
-					c++;
-				}
-				y += 64;
-			}
-
-			y += 64*6 - 64*2;
-			c += 64*6 - 8;
-		}
-	}
-
-	// Y (1 block per MCU) to 8-bit grayscale
-	void jpeg_decoder::gray_convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d = m_pScan_line_0;
-		uint8 *s = m_pSample_buf + row * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			*(uint *)d = *(uint *)s;
-			*(uint *)(&d[4]) = *(uint *)(&s[4]);
-
-			s += 64;
-			d += 8;
-		}
-	}
-
-	void jpeg_decoder::expanded_convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-
-		uint8* Py = m_pSample_buf + (row / 8) * 64 * m_comp_h_samp[0] + (row & 7) * 8;
-
-		uint8* d = m_pScan_line_0;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int k = 0; k < m_max_mcu_x_size; k += 8)
-			{
-				const int Y_ofs = k * 8;
-				const int Cb_ofs = Y_ofs + 64 * m_expanded_blocks_per_component;
-				const int Cr_ofs = Y_ofs + 64 * m_expanded_blocks_per_component * 2;
-				for (int j = 0; j < 8; j++)
-				{
-					int y = Py[Y_ofs + j];
-					int cb = Py[Cb_ofs + j];
-					int cr = Py[Cr_ofs + j];
-
-					if (jpg_format == ERGBFormatJPG::BGRA)
-					{
-						d[0] = clamp(y + m_cbb[cb]);
-						d[1] = clamp(y + ((m_crg[cr] + m_cbg[cb]) >> 16));
-						d[2] = clamp(y + m_crr[cr]);
-						d[3] = 255;
-					}
-					else
-					{
-						d[0] = clamp(y + m_crr[cr]);
-						d[1] = clamp(y + ((m_crg[cr] + m_cbg[cb]) >> 16));
-						d[2] = clamp(y + m_cbb[cb]);
-						d[3] = 255;
-					}
-
-					d += 4;
-				}
-			}
-
-			Py += 64 * m_expanded_blocks_per_mcu;
-		}
-	}
-
-	// Find end of image (EOI) marker, so we can return to the user the exact size of the input stream.
-	void jpeg_decoder::find_eoi()
-	{
-		if (!m_progressive_flag)
-		{
-			// Attempt to read the EOI marker.
-			//get_bits_no_markers(m_bits_left & 7);
-
-			// Prime the bit buffer
-			m_bits_left = 16;
-			get_bits(16);
-			get_bits(16);
-
-			// The next marker _should_ be EOI
-			process_markers();
-		}
-
-		m_total_bytes_read -= m_in_buf_left;
-	}
-
-	int jpeg_decoder::decode(const void** pScan_line, uint* pScan_line_len)
-	{
-		if ((m_error_code) || (!m_ready_flag))
-			return JPGD_FAILED;
-
-		if (m_total_lines_left == 0)
-			return JPGD_DONE;
-
-		if (m_mcu_lines_left == 0)
-		{
-			if (setjmp(m_jmp_state))
-				return JPGD_FAILED;
-
-			if (m_progressive_flag)
-				load_next_row();
-			else
-				decode_next_row();
-
-			// Find the EOI marker if that was the last row.
-			if (m_total_lines_left <= m_max_mcu_y_size)
-				find_eoi();
-
-			m_mcu_lines_left = m_max_mcu_y_size;
-		}
-
-		if (m_freq_domain_chroma_upsample)
-		{
-			expanded_convert();
-			*pScan_line = m_pScan_line_0;
-		}
-		else
-		{
-			switch (m_scan_type)
-			{
-			case JPGD_YH2V2:
-				{
-					if ((m_mcu_lines_left & 1) == 0)
-					{
-						H2V2Convert();
-						*pScan_line = m_pScan_line_0;
-					}
-					else
-						*pScan_line = m_pScan_line_1;
-
-					break;
-				}
-			case JPGD_YH2V1:
-				{
-					H2V1Convert();
-					*pScan_line = m_pScan_line_0;
-					break;
-				}
-			case JPGD_YH1V2:
-				{
-					if ((m_mcu_lines_left & 1) == 0)
-					{
-						H1V2Convert();
-						*pScan_line = m_pScan_line_0;
-					}
-					else
-						*pScan_line = m_pScan_line_1;
-
-					break;
-				}
-			case JPGD_YH1V1:
-				{
-					H1V1Convert();
-					*pScan_line = m_pScan_line_0;
-					break;
-				}
-			case JPGD_GRAYSCALE:
-				{
-					gray_convert();
-					*pScan_line = m_pScan_line_0;
-
-					break;
-				}
-			}
-		}
-
-		*pScan_line_len = m_real_dest_bytes_per_scan_line;
-
-		m_mcu_lines_left--;
-		m_total_lines_left--;
-
-		return JPGD_SUCCESS;
-	}
-
-	// Creates the tables needed for efficient Huffman decoding.
-	void jpeg_decoder::make_huff_table(int index, huff_tables *pH)
-	{
-		int p, i, l, si;
-		uint8 huffsize[257];
-		uint huffcode[257];
-		uint code;
-		uint subtree;
-		int code_size;
-		int lastp;
-		int nextfreeentry;
-		int currententry;
-
-		pH->ac_table = m_huff_ac[index] != 0;
-
-		p = 0;
-
-		for (l = 1; l <= 16; l++)
-		{
-			for (i = 1; i <= m_huff_num[index][l]; i++)
-				huffsize[p++] = static_cast<uint8>(l);
-		}
-
-		huffsize[p] = 0;
-
-		lastp = p;
-
-		code = 0;
-		si = huffsize[0];
-		p = 0;
-
-		while (huffsize[p])
-		{
-			while (huffsize[p] == si)
-			{
-				huffcode[p++] = code;
-				code++;
-			}
-
-			code <<= 1;
-			si++;
-		}
-
-		memset(pH->look_up, 0, sizeof(pH->look_up));
-		memset(pH->look_up2, 0, sizeof(pH->look_up2));
-		memset(pH->tree, 0, sizeof(pH->tree));
-		memset(pH->code_size, 0, sizeof(pH->code_size));
-
-		nextfreeentry = -1;
-
-		p = 0;
-
-		while (p < lastp)
-		{
-			i = m_huff_val[index][p];
-			code = huffcode[p];
-			code_size = huffsize[p];
-
-			pH->code_size[i] = static_cast<uint8>(code_size);
-
-			if (code_size <= 8)
-			{
-				code <<= (8 - code_size);
-
-				for (l = 1 << (8 - code_size); l > 0; l--)
-				{
-					JPGD_ASSERT(i < 256);
-
-					pH->look_up[code] = i;
-
-					bool has_extrabits = false;
-					int extra_bits = 0;
-					int num_extra_bits = i & 15;
-
-					int bits_to_fetch = code_size;
-					if (num_extra_bits)
-					{
-						int total_codesize = code_size + num_extra_bits;
-						if (total_codesize <= 8)
-						{
-							has_extrabits = true;
-							extra_bits = ((1 << num_extra_bits) - 1) & (code >> (8 - total_codesize));
-							JPGD_ASSERT(extra_bits <= 0x7FFF);
-							bits_to_fetch += num_extra_bits;
-						}
-					}
-
-					if (!has_extrabits)
-						pH->look_up2[code] = i | (bits_to_fetch << 8);
-					else
-						pH->look_up2[code] = i | 0x8000 | (extra_bits << 16) | (bits_to_fetch << 8);
-
-					code++;
-				}
-			}
-			else
-			{
-				subtree = (code >> (code_size - 8)) & 0xFF;
-
-				currententry = pH->look_up[subtree];
-
-				if (currententry == 0)
-				{
-					pH->look_up[subtree] = currententry = nextfreeentry;
-					pH->look_up2[subtree] = currententry = nextfreeentry;
-
-					nextfreeentry -= 2;
-				}
-
-				code <<= (16 - (code_size - 8));
-
-				for (l = code_size; l > 9; l--)
-				{
-					if ((code & 0x8000) == 0)
-						currententry--;
-
-					if (pH->tree[-currententry - 1] == 0)
-					{
-						pH->tree[-currententry - 1] = nextfreeentry;
-
-						currententry = nextfreeentry;
-
-						nextfreeentry -= 2;
-					}
-					else
-						currententry = pH->tree[-currententry - 1];
-
-					code <<= 1;
-				}
-
-				if ((code & 0x8000) == 0)
-					currententry--;
-
-				pH->tree[-currententry - 1] = i;
-			}
-
-			p++;
-		}
-	}
-
-	// Verifies the quantization tables needed for this scan are available.
-	void jpeg_decoder::check_quant_tables()
-	{
-		for (int i = 0; i < m_comps_in_scan; i++)
-			if (m_quant[m_comp_quant[m_comp_list[i]]] == NULL)
-				stop_decoding(JPGD_UNDEFINED_QUANT_TABLE);
-	}
-
-	// Verifies that all the Huffman tables needed for this scan are available.
-	void jpeg_decoder::check_huff_tables()
-	{
-		for (int i = 0; i < m_comps_in_scan; i++)
-		{
-			if ((m_spectral_start == 0) && (m_huff_num[m_comp_dc_tab[m_comp_list[i]]] == NULL))
-				stop_decoding(JPGD_UNDEFINED_HUFF_TABLE);
-
-			if ((m_spectral_end > 0) && (m_huff_num[m_comp_ac_tab[m_comp_list[i]]] == NULL))
-				stop_decoding(JPGD_UNDEFINED_HUFF_TABLE);
-		}
-
-		for (int i = 0; i < JPGD_MAX_HUFF_TABLES; i++)
-			if (m_huff_num[i])
-			{
-				if (!m_pHuff_tabs[i])
-					m_pHuff_tabs[i] = (huff_tables *)alloc(sizeof(huff_tables));
-
-				make_huff_table(i, m_pHuff_tabs[i]);
-			}
-	}
-
-	// Determines the component order inside each MCU.
-	// Also calcs how many MCU's are on each row, etc.
-	void jpeg_decoder::calc_mcu_block_order()
-	{
-		int component_num, component_id;
-		int max_h_samp = 0, max_v_samp = 0;
-
-		for (component_id = 0; component_id < m_comps_in_frame; component_id++)
-		{
-			if (m_comp_h_samp[component_id] > max_h_samp)
-				max_h_samp = m_comp_h_samp[component_id];
-
-			if (m_comp_v_samp[component_id] > max_v_samp)
-				max_v_samp = m_comp_v_samp[component_id];
-		}
-
-		for (component_id = 0; component_id < m_comps_in_frame; component_id++)
-		{
-			m_comp_h_blocks[component_id] = ((((m_image_x_size * m_comp_h_samp[component_id]) + (max_h_samp - 1)) / max_h_samp) + 7) / 8;
-			m_comp_v_blocks[component_id] = ((((m_image_y_size * m_comp_v_samp[component_id]) + (max_v_samp - 1)) / max_v_samp) + 7) / 8;
-		}
-
-		if (m_comps_in_scan == 1)
-		{
-			m_mcus_per_row = m_comp_h_blocks[m_comp_list[0]];
-			m_mcus_per_col = m_comp_v_blocks[m_comp_list[0]];
-		}
-		else
-		{
-			m_mcus_per_row = (((m_image_x_size + 7) / 8) + (max_h_samp - 1)) / max_h_samp;
-			m_mcus_per_col = (((m_image_y_size + 7) / 8) + (max_v_samp - 1)) / max_v_samp;
-		}
-
-		if (m_comps_in_scan == 1)
-		{
-			m_mcu_org[0] = m_comp_list[0];
-
-			m_blocks_per_mcu = 1;
-		}
-		else
-		{
-			m_blocks_per_mcu = 0;
-
-			for (component_num = 0; component_num < m_comps_in_scan; component_num++)
-			{
-				int num_blocks;
-
-				component_id = m_comp_list[component_num];
-
-				num_blocks = m_comp_h_samp[component_id] * m_comp_v_samp[component_id];
-
-				while (num_blocks--)
-					m_mcu_org[m_blocks_per_mcu++] = component_id;
-			}
-		}
-	}
-
-	// Starts a new scan.
-	int jpeg_decoder::init_scan()
-	{
-		if (!locate_sos_marker())
-			return JPGD_FALSE;
-
-		calc_mcu_block_order();
-
-		check_huff_tables();
-
-		check_quant_tables();
-
-		memset(m_last_dc_val, 0, m_comps_in_frame * sizeof(uint));
-
-		m_eob_run = 0;
-
-		if (m_restart_interval)
-		{
-			m_restarts_left = m_restart_interval;
-			m_next_restart_num = 0;
-		}
-
-		fix_in_buffer();
-
-		return JPGD_TRUE;
-	}
-
-	// Starts a frame. Determines if the number of components or sampling factors
-	// are supported.
-	void jpeg_decoder::init_frame()
-	{
-		int i;
-
-		if (m_comps_in_frame == 1)
-		{
-			if ((m_comp_h_samp[0] != 1) || (m_comp_v_samp[0] != 1))
-				stop_decoding(JPGD_UNSUPPORTED_SAMP_FACTORS);
-
-			m_scan_type = JPGD_GRAYSCALE;
-			m_max_blocks_per_mcu = 1;
-			m_max_mcu_x_size = 8;
-			m_max_mcu_y_size = 8;
-		}
-		else if (m_comps_in_frame == 3)
-		{
-			if ( ((m_comp_h_samp[1] != 1) || (m_comp_v_samp[1] != 1)) ||
-				((m_comp_h_samp[2] != 1) || (m_comp_v_samp[2] != 1)) )
-				stop_decoding(JPGD_UNSUPPORTED_SAMP_FACTORS);
-
-			if ((m_comp_h_samp[0] == 1) && (m_comp_v_samp[0] == 1))
-			{
-				m_scan_type = JPGD_YH1V1;
-
-				m_max_blocks_per_mcu = 3;
-				m_max_mcu_x_size = 8;
-				m_max_mcu_y_size = 8;
-			}
-			else if ((m_comp_h_samp[0] == 2) && (m_comp_v_samp[0] == 1))
-			{
-				m_scan_type = JPGD_YH2V1;
-				m_max_blocks_per_mcu = 4;
-				m_max_mcu_x_size = 16;
-				m_max_mcu_y_size = 8;
-			}
-			else if ((m_comp_h_samp[0] == 1) && (m_comp_v_samp[0] == 2))
-			{
-				m_scan_type = JPGD_YH1V2;
-				m_max_blocks_per_mcu = 4;
-				m_max_mcu_x_size = 8;
-				m_max_mcu_y_size = 16;
-			}
-			else if ((m_comp_h_samp[0] == 2) && (m_comp_v_samp[0] == 2))
-			{
-				m_scan_type = JPGD_YH2V2;
-				m_max_blocks_per_mcu = 6;
-				m_max_mcu_x_size = 16;
-				m_max_mcu_y_size = 16;
-			}
-			else
-				stop_decoding(JPGD_UNSUPPORTED_SAMP_FACTORS);
-		}
-		else
-			stop_decoding(JPGD_UNSUPPORTED_COLORSPACE);
-
-		m_max_mcus_per_row = (m_image_x_size + (m_max_mcu_x_size - 1)) / m_max_mcu_x_size;
-		m_max_mcus_per_col = (m_image_y_size + (m_max_mcu_y_size - 1)) / m_max_mcu_y_size;
-
-		// These values are for the *destination* pixels: after conversion.
-		if (m_scan_type == JPGD_GRAYSCALE)
-			m_dest_bytes_per_pixel = 1;
-		else
-			m_dest_bytes_per_pixel = 4;
-
-		m_dest_bytes_per_scan_line = ((m_image_x_size + 15) & 0xFFF0) * m_dest_bytes_per_pixel;
-
-		m_real_dest_bytes_per_scan_line = (m_image_x_size * m_dest_bytes_per_pixel);
-
-		// Initialize two scan line buffers.
-		m_pScan_line_0 = (uint8 *)alloc(m_dest_bytes_per_scan_line, true);
-		if ((m_scan_type == JPGD_YH1V2) || (m_scan_type == JPGD_YH2V2))
-			m_pScan_line_1 = (uint8 *)alloc(m_dest_bytes_per_scan_line, true);
-
-		m_max_blocks_per_row = m_max_mcus_per_row * m_max_blocks_per_mcu;
-
-		// Should never happen
-		if (m_max_blocks_per_row > JPGD_MAX_BLOCKS_PER_ROW)
-			stop_decoding(JPGD_ASSERTION_ERROR);
-
-		// Allocate the coefficient buffer, enough for one MCU
-		m_pMCU_coefficients = (jpgd_block_t*)alloc(m_max_blocks_per_mcu * 64 * sizeof(jpgd_block_t));
-
-		for (i = 0; i < m_max_blocks_per_mcu; i++)
-			m_mcu_block_max_zag[i] = 64;
-
-		m_expanded_blocks_per_component = m_comp_h_samp[0] * m_comp_v_samp[0];
-		m_expanded_blocks_per_mcu = m_expanded_blocks_per_component * m_comps_in_frame;
-		m_expanded_blocks_per_row = m_max_mcus_per_row * m_expanded_blocks_per_mcu;
-		// Freq. domain chroma upsampling is only supported for H2V2 subsampling factor.
-// BEGIN EPIC MOD
-#if JPGD_SUPPORT_FREQ_DOMAIN_UPSAMPLING
-		m_freq_domain_chroma_upsample = (m_expanded_blocks_per_mcu == 4*3);
-#else
-		m_freq_domain_chroma_upsample = 0;
-#endif
-// END EPIC MOD
-
-		if (m_freq_domain_chroma_upsample)
-			m_pSample_buf = (uint8 *)alloc(m_expanded_blocks_per_row * 64);
-		else
-			m_pSample_buf = (uint8 *)alloc(m_max_blocks_per_row * 64);
-
-		m_total_lines_left = m_image_y_size;
-
-		m_mcu_lines_left = 0;
-
-		create_look_ups();
-	}
-
-	// The coeff_buf series of methods originally stored the coefficients
-	// into a "virtual" file which was located in EMS, XMS, or a disk file. A cache
-	// was used to make this process more efficient. Now, we can store the entire
-	// thing in RAM.
-	jpeg_decoder::coeff_buf* jpeg_decoder::coeff_buf_open(int block_num_x, int block_num_y, int block_len_x, int block_len_y)
-	{
-		coeff_buf* cb = (coeff_buf*)alloc(sizeof(coeff_buf));
-
-		cb->block_num_x = block_num_x;
-		cb->block_num_y = block_num_y;
-		cb->block_len_x = block_len_x;
-		cb->block_len_y = block_len_y;
-		cb->block_size = (block_len_x * block_len_y) * sizeof(jpgd_block_t);
-		cb->pData = (uint8 *)alloc(cb->block_size * block_num_x * block_num_y, true);
-		return cb;
-	}
-
-	inline jpgd_block_t *jpeg_decoder::coeff_buf_getp(coeff_buf *cb, int block_x, int block_y)
-	{
-		JPGD_ASSERT((block_x < cb->block_num_x) && (block_y < cb->block_num_y));
-		return (jpgd_block_t *)(cb->pData + block_x * cb->block_size + block_y * (cb->block_size * cb->block_num_x));
-	}
-
-	// The following methods decode the various types of m_blocks encountered
-	// in progressively encoded images.
-	void jpeg_decoder::decode_block_dc_first(jpeg_decoder *pD, int component_id, int block_x, int block_y)
-	{
-		int s, r;
-		jpgd_block_t *p = pD->coeff_buf_getp(pD->m_dc_coeffs[component_id], block_x, block_y);
-
-		if ((s = pD->huff_decode(pD->m_pHuff_tabs[pD->m_comp_dc_tab[component_id]])) != 0)
-		{
-			r = pD->get_bits_no_markers(s);
-			s = HUFF_EXTEND(r, s);
-		}
-
-		pD->m_last_dc_val[component_id] = (s += pD->m_last_dc_val[component_id]);
-
-		p[0] = static_cast<jpgd_block_t>(s << pD->m_successive_low);
-	}
-
-	void jpeg_decoder::decode_block_dc_refine(jpeg_decoder *pD, int component_id, int block_x, int block_y)
-	{
-		if (pD->get_bits_no_markers(1))
-		{
-			jpgd_block_t *p = pD->coeff_buf_getp(pD->m_dc_coeffs[component_id], block_x, block_y);
-
-			p[0] |= (1 << pD->m_successive_low);
-		}
-	}
-
-	void jpeg_decoder::decode_block_ac_first(jpeg_decoder *pD, int component_id, int block_x, int block_y)
-	{
-		int k, s, r;
-
-		if (pD->m_eob_run)
-		{
-			pD->m_eob_run--;
-			return;
-		}
-
-		jpgd_block_t *p = pD->coeff_buf_getp(pD->m_ac_coeffs[component_id], block_x, block_y);
-
-		for (k = pD->m_spectral_start; k <= pD->m_spectral_end; k++)
-		{
-			s = pD->huff_decode(pD->m_pHuff_tabs[pD->m_comp_ac_tab[component_id]]);
-
-			r = s >> 4;
-			s &= 15;
-
-			if (s)
-			{
-				if ((k += r) > 63)
-					pD->stop_decoding(JPGD_DECODE_ERROR);
-
-				r = pD->get_bits_no_markers(s);
-				s = HUFF_EXTEND(r, s);
-
-				p[g_ZAG[k]] = static_cast<jpgd_block_t>(s << pD->m_successive_low);
-			}
-			else
-			{
-				if (r == 15)
-				{
-					if ((k += 15) > 63)
-						pD->stop_decoding(JPGD_DECODE_ERROR);
-				}
-				else
-				{
-					pD->m_eob_run = 1 << r;
-
-					if (r)
-						pD->m_eob_run += pD->get_bits_no_markers(r);
-
-					pD->m_eob_run--;
-
-					break;
-				}
-			}
-		}
-	}
-
-	void jpeg_decoder::decode_block_ac_refine(jpeg_decoder *pD, int component_id, int block_x, int block_y)
-	{
-		int s, k, r;
-		int p1 = 1 << pD->m_successive_low;
-		int m1 = (-1) << pD->m_successive_low;
-		jpgd_block_t *p = pD->coeff_buf_getp(pD->m_ac_coeffs[component_id], block_x, block_y);
-
-		k = pD->m_spectral_start;
-
-		if (pD->m_eob_run == 0)
-		{
-			for ( ; k <= pD->m_spectral_end; k++)
-			{
-				s = pD->huff_decode(pD->m_pHuff_tabs[pD->m_comp_ac_tab[component_id]]);
-
-				r = s >> 4;
-				s &= 15;
-
-				if (s)
-				{
-					if (s != 1)
-						pD->stop_decoding(JPGD_DECODE_ERROR);
-
-					if (pD->get_bits_no_markers(1))
-						s = p1;
-					else
-						s = m1;
-				}
-				else
-				{
-					if (r != 15)
-					{
-						pD->m_eob_run = 1 << r;
-
-						if (r)
-							pD->m_eob_run += pD->get_bits_no_markers(r);
-
-						break;
-					}
-				}
-
-				do
-				{
-					// BEGIN EPIC MOD
-					JPGD_ASSERT(k < 64);
-					// END EPIC MOD
-
-					jpgd_block_t *this_coef = p + g_ZAG[k];
-
-					if (*this_coef != 0)
-					{
-						if (pD->get_bits_no_markers(1))
-						{
-							if ((*this_coef & p1) == 0)
-							{
-								if (*this_coef >= 0)
-									*this_coef = static_cast<jpgd_block_t>(*this_coef + p1);
-								else
-									*this_coef = static_cast<jpgd_block_t>(*this_coef + m1);
-							}
-						}
-					}
-					else
-					{
-						if (--r < 0)
-							break;
-					}
-
-					k++;
-
-				} while (k <= pD->m_spectral_end);
-
-				if ((s) && (k < 64))
-				{
-					p[g_ZAG[k]] = static_cast<jpgd_block_t>(s);
-				}
-			}
-		}
-
-		if (pD->m_eob_run > 0)
-		{
-			for ( ; k <= pD->m_spectral_end; k++)
-			{
-				// BEGIN EPIC MOD
-				JPGD_ASSERT(k < 64);
-				// END EPIC MOD
-
-				jpgd_block_t *this_coef = p + g_ZAG[k];
-
-				if (*this_coef != 0)
-				{
-					if (pD->get_bits_no_markers(1))
-					{
-						if ((*this_coef & p1) == 0)
-						{
-							if (*this_coef >= 0)
-								*this_coef = static_cast<jpgd_block_t>(*this_coef + p1);
-							else
-								*this_coef = static_cast<jpgd_block_t>(*this_coef + m1);
-						}
-					}
-				}
-			}
-
-			pD->m_eob_run--;
-		}
-	}
-
-	// Decode a scan in a progressively encoded image.
-	void jpeg_decoder::decode_scan(pDecode_block_func decode_block_func)
-	{
-		int mcu_row, mcu_col, mcu_block;
-		int block_x_mcu[JPGD_MAX_COMPONENTS], m_block_y_mcu[JPGD_MAX_COMPONENTS];
-
-		memset(m_block_y_mcu, 0, sizeof(m_block_y_mcu));
-
-		for (mcu_col = 0; mcu_col < m_mcus_per_col; mcu_col++)
-		{
-			int component_num, component_id;
-
-			memset(block_x_mcu, 0, sizeof(block_x_mcu));
-
-			for (mcu_row = 0; mcu_row < m_mcus_per_row; mcu_row++)
-			{
-				int block_x_mcu_ofs = 0, block_y_mcu_ofs = 0;
-
-				if ((m_restart_interval) && (m_restarts_left == 0))
-					process_restart();
-
-				for (mcu_block = 0; mcu_block < m_blocks_per_mcu; mcu_block++)
-				{
-					component_id = m_mcu_org[mcu_block];
-
-					decode_block_func(this, component_id, block_x_mcu[component_id] + block_x_mcu_ofs, m_block_y_mcu[component_id] + block_y_mcu_ofs);
-
-					if (m_comps_in_scan == 1)
-						block_x_mcu[component_id]++;
-					else
-					{
-						if (++block_x_mcu_ofs == m_comp_h_samp[component_id])
-						{
-							block_x_mcu_ofs = 0;
-
-							if (++block_y_mcu_ofs == m_comp_v_samp[component_id])
-							{
-								block_y_mcu_ofs = 0;
-								block_x_mcu[component_id] += m_comp_h_samp[component_id];
-							}
-						}
-					}
-				}
-
-				m_restarts_left--;
-			}
-
-			if (m_comps_in_scan == 1)
-				m_block_y_mcu[m_comp_list[0]]++;
-			else
-			{
-				for (component_num = 0; component_num < m_comps_in_scan; component_num++)
-				{
-					component_id = m_comp_list[component_num];
-					m_block_y_mcu[component_id] += m_comp_v_samp[component_id];
-				}
-			}
-		}
-	}
-
-	// Decode a progressively encoded image.
-	void jpeg_decoder::init_progressive()
-	{
-		int i;
-
-		if (m_comps_in_frame == 4)
-			stop_decoding(JPGD_UNSUPPORTED_COLORSPACE);
-
-		// Allocate the coefficient buffers.
-		for (i = 0; i < m_comps_in_frame; i++)
-		{
-			m_dc_coeffs[i] = coeff_buf_open(m_max_mcus_per_row * m_comp_h_samp[i], m_max_mcus_per_col * m_comp_v_samp[i], 1, 1);
-			m_ac_coeffs[i] = coeff_buf_open(m_max_mcus_per_row * m_comp_h_samp[i], m_max_mcus_per_col * m_comp_v_samp[i], 8, 8);
-		}
-
-		for ( ; ; )
-		{
-			int dc_only_scan, refinement_scan;
-			pDecode_block_func decode_block_func;
-
-			if (!init_scan())
-				break;
-
-			dc_only_scan = (m_spectral_start == 0);
-			refinement_scan = (m_successive_high != 0);
-
-			if ((m_spectral_start > m_spectral_end) || (m_spectral_end > 63))
-				stop_decoding(JPGD_BAD_SOS_SPECTRAL);
-
-			if (dc_only_scan)
-			{
-				if (m_spectral_end)
-					stop_decoding(JPGD_BAD_SOS_SPECTRAL);
-			}
-			else if (m_comps_in_scan != 1)  /* AC scans can only contain one component */
-				stop_decoding(JPGD_BAD_SOS_SPECTRAL);
-
-			if ((refinement_scan) && (m_successive_low != m_successive_high - 1))
-				stop_decoding(JPGD_BAD_SOS_SUCCESSIVE);
-
-			if (dc_only_scan)
-			{
-				if (refinement_scan)
-					decode_block_func = decode_block_dc_refine;
-				else
-					decode_block_func = decode_block_dc_first;
-			}
-			else
-			{
-				if (refinement_scan)
-					decode_block_func = decode_block_ac_refine;
-				else
-					decode_block_func = decode_block_ac_first;
-			}
-
-			decode_scan(decode_block_func);
-
-			m_bits_left = 16;
-			get_bits(16);
-			get_bits(16);
-		}
-
-		m_comps_in_scan = m_comps_in_frame;
-
-		for (i = 0; i < m_comps_in_frame; i++)
-			m_comp_list[i] = i;
-
-		calc_mcu_block_order();
-	}
-
-	void jpeg_decoder::init_sequential()
-	{
-		if (!init_scan())
-			stop_decoding(JPGD_UNEXPECTED_MARKER);
-	}
-
-	void jpeg_decoder::decode_start()
-	{
-		init_frame();
-
-		if (m_progressive_flag)
-			init_progressive();
-		else
-			init_sequential();
-	}
-
-	void jpeg_decoder::decode_init(jpeg_decoder_stream *pStream)
-	{
-		init(pStream);
-		locate_sof_marker();
-	}
-
-	jpeg_decoder::jpeg_decoder(jpeg_decoder_stream *pStream)
-	{
-		if (setjmp(m_jmp_state))
-			return;
-		decode_init(pStream);
-	}
-
-	int jpeg_decoder::begin_decoding()
-	{
-		if (m_ready_flag)
-			return JPGD_SUCCESS;
-
-		if (m_error_code)
-			return JPGD_FAILED;
-
-		if (setjmp(m_jmp_state))
-			return JPGD_FAILED;
-
-		decode_start();
-
-		m_ready_flag = true;
-
-		return JPGD_SUCCESS;
-	}
-
-	jpeg_decoder::~jpeg_decoder()
-	{
-		free_all_blocks();
-	}
-
-	jpeg_decoder_file_stream::jpeg_decoder_file_stream()
-	{
-		m_pFile = NULL;
-		m_eof_flag = false;
-		m_error_flag = false;
-	}
-
-	void jpeg_decoder_file_stream::close()
-	{
-		if (m_pFile)
-		{
-			fclose(m_pFile);
-			m_pFile = NULL;
-		}
-
-		m_eof_flag = false;
-		m_error_flag = false;
-	}
-
-	jpeg_decoder_file_stream::~jpeg_decoder_file_stream()
-	{
-		close();
-	}
-
-	bool jpeg_decoder_file_stream::open(const char *Pfilename)
-	{
-		close();
-
-		m_eof_flag = false;
-		m_error_flag = false;
-
-#if defined(_MSC_VER)
-		m_pFile = NULL;
-		fopen_s(&m_pFile, Pfilename, "rb");
-#else
-		m_pFile = fopen(Pfilename, "rb");
-#endif
-		return m_pFile != NULL;
-	}
-
-	int jpeg_decoder_file_stream::read(uint8 *pBuf, int max_bytes_to_read, bool *pEOF_flag)
-	{
-		if (!m_pFile)
-			return -1;
-
-		if (m_eof_flag)
-		{
-			*pEOF_flag = true;
-			return 0;
-		}
-
-		if (m_error_flag)
-			return -1;
-
-		int bytes_read = static_cast<int>(fread(pBuf, 1, max_bytes_to_read, m_pFile));
-		if (bytes_read < max_bytes_to_read)
-		{
-			if (ferror(m_pFile))
-			{
-				m_error_flag = true;
-				return -1;
-			}
-
-			m_eof_flag = true;
-			*pEOF_flag = true;
-		}
-
-		return bytes_read;
-	}
-
-	bool jpeg_decoder_mem_stream::open(const uint8 *pSrc_data, uint size)
-	{
-		close();
-		m_pSrc_data = pSrc_data;
-		m_ofs = 0;
-		m_size = size;
-		return true;
-	}
-
-	int jpeg_decoder_mem_stream::read(uint8 *pBuf, int max_bytes_to_read, bool *pEOF_flag)
-	{
-		*pEOF_flag = false;
-
-		if (!m_pSrc_data)
-			return -1;
-
-		uint bytes_remaining = m_size - m_ofs;
-		if ((uint)max_bytes_to_read > bytes_remaining)
-		{
-			max_bytes_to_read = bytes_remaining;
-			*pEOF_flag = true;
-		}
-
-		memcpy(pBuf, m_pSrc_data + m_ofs, max_bytes_to_read);
-		m_ofs += max_bytes_to_read;
-
-		return max_bytes_to_read;
-	}
-
-	unsigned char *decompress_jpeg_image_from_stream(jpeg_decoder_stream *pStream, int *width, int *height, int *actual_comps, int req_comps)
-	{
-		if (!actual_comps)
-			return NULL;
-		*actual_comps = 0;
-
-		if ((!pStream) || (!width) || (!height) || (!req_comps))
-			return NULL;
-
-		if ((req_comps != 1) && (req_comps != 3) && (req_comps != 4))
-			return NULL;
-
-		jpeg_decoder decoder(pStream);
-		if (decoder.get_error_code() != JPGD_SUCCESS)
-			return NULL;
-
-		const int image_width = decoder.get_width(), image_height = decoder.get_height();
-		*width = image_width;
-		*height = image_height;
-		*actual_comps = decoder.get_num_components();
-
-		if (decoder.begin_decoding() != JPGD_SUCCESS)
-			return NULL;
-
-		const int dst_bpl = image_width * req_comps;
-
-		uint8 *pImage_data = (uint8*)jpgd_malloc(dst_bpl * image_height);
-		if (!pImage_data)
-			return NULL;
-
-		for (int y = 0; y < image_height; y++)
-		{
-			const uint8* pScan_line = 0;
-			uint scan_line_len;
-			if (decoder.decode((const void**)&pScan_line, &scan_line_len) != JPGD_SUCCESS)
-			{
-				jpgd_free(pImage_data);
-				return NULL;
-			}
-
-			uint8 *pDst = pImage_data + y * dst_bpl;
-
-			if (((req_comps == 4) && (decoder.get_num_components() == 3)) ||
-				((req_comps == 1) && (decoder.get_num_components() == 1)))
-			{
-				memcpy(pDst, pScan_line, dst_bpl);
-			}
-			else if (decoder.get_num_components() == 1)
-			{
-				if (req_comps == 3)
-				{
-					for (int x = 0; x < image_width; x++)
-					{
-						uint8 luma = pScan_line[x];
-						pDst[0] = luma;
-						pDst[1] = luma;
-						pDst[2] = luma;
-						pDst += 3;
-					}
-				}
-				else
-				{
-					for (int x = 0; x < image_width; x++)
-					{
-						uint8 luma = pScan_line[x];
-						pDst[0] = luma;
-						pDst[1] = luma;
-						pDst[2] = luma;
-						pDst[3] = 255;
-						pDst += 4;
-					}
-				}
-			}
-			else if (decoder.get_num_components() == 3)
-			{
-				if (req_comps == 1)
-				{
-					const int YR = 19595, YG = 38470, YB = 7471;
-					for (int x = 0; x < image_width; x++)
-					{
-						int r = pScan_line[x*4+0];
-						int g = pScan_line[x*4+1];
-						int b = pScan_line[x*4+2];
-						*pDst++ = static_cast<uint8>((r * YR + g * YG + b * YB + 32768) >> 16);
-					}
-				}
-				else
-				{
-					for (int x = 0; x < image_width; x++)
-					{
-						pDst[0] = pScan_line[x*4+0];
-						pDst[1] = pScan_line[x*4+1];
-						pDst[2] = pScan_line[x*4+2];
-						pDst += 3;
-					}
-				}
-			}
-		}
-
-		return pImage_data;
-	}
-
-// BEGIN EPIC MOD
-	unsigned char *decompress_jpeg_image_from_memory(const unsigned char *pSrc_data, int src_data_size, int *width, int *height, int *actual_comps, int req_comps, int format)
-	{
-		jpg_format = (ERGBFormatJPG)format;
-// EMD EPIC MOD
-		jpgd::jpeg_decoder_mem_stream mem_stream(pSrc_data, src_data_size);
-		return decompress_jpeg_image_from_stream(&mem_stream, width, height, actual_comps, req_comps);
-	}
-
-	unsigned char *decompress_jpeg_image_from_file(const char *pSrc_filename, int *width, int *height, int *actual_comps, int req_comps)
-	{
-		jpgd::jpeg_decoder_file_stream file_stream;
-		if (!file_stream.open(pSrc_filename))
-			return NULL;
-		return decompress_jpeg_image_from_stream(&file_stream, width, height, actual_comps, req_comps);
-	}
-
-} // namespace jpgd

crazy_functions/test_project/cpp/longcode/jpge.cpp

@@ -1,1049 +0,0 @@
-// jpge.cpp - C++ class for JPEG compression.
-// Public domain, Rich Geldreich <richgel99@gmail.com>
-// v1.01, Dec. 18, 2010 - Initial release
-// v1.02, Apr. 6, 2011 - Removed 2x2 ordered dither in H2V1 chroma subsampling method load_block_16_8_8(). (The rounding factor was 2, when it should have been 1. Either way, it wasn't helping.)
-// v1.03, Apr. 16, 2011 - Added support for optimized Huffman code tables, optimized dynamic memory allocation down to only 1 alloc.
-//                        Also from Alex Evans: Added RGBA support, linear memory allocator (no longer needed in v1.03).
-// v1.04, May. 19, 2012: Forgot to set m_pFile ptr to NULL in cfile_stream::close(). Thanks to Owen Kaluza for reporting this bug.
-//                       Code tweaks to fix VS2008 static code analysis warnings (all looked harmless).
-//                       Code review revealed method load_block_16_8_8() (used for the non-default H2V1 sampling mode to downsample chroma) somehow didn't get the rounding factor fix from v1.02.
-
-#include "jpge.h"
-
-#include <stdlib.h>
-#include <string.h>
-#if PLATFORM_WINDOWS
-#include <malloc.h>
-#endif
-
-#define JPGE_MAX(a,b) (((a)>(b))?(a):(b))
-#define JPGE_MIN(a,b) (((a)<(b))?(a):(b))
-
-namespace jpge {
-
-static inline void *jpge_malloc(size_t nSize) { return FMemory::Malloc(nSize); }
-static inline void jpge_free(void *p) { FMemory::Free(p);; }
-
-// Various JPEG enums and tables.
-enum { M_SOF0 = 0xC0, M_DHT = 0xC4, M_SOI = 0xD8, M_EOI = 0xD9, M_SOS = 0xDA, M_DQT = 0xDB, M_APP0 = 0xE0 };
-enum { DC_LUM_CODES = 12, AC_LUM_CODES = 256, DC_CHROMA_CODES = 12, AC_CHROMA_CODES = 256, MAX_HUFF_SYMBOLS = 257, MAX_HUFF_CODESIZE = 32 };
-
-static uint8 s_zag[64] = { 0,1,8,16,9,2,3,10,17,24,32,25,18,11,4,5,12,19,26,33,40,48,41,34,27,20,13,6,7,14,21,28,35,42,49,56,57,50,43,36,29,22,15,23,30,37,44,51,58,59,52,45,38,31,39,46,53,60,61,54,47,55,62,63 };
-static int16 s_std_lum_quant[64] = { 16,11,12,14,12,10,16,14,13,14,18,17,16,19,24,40,26,24,22,22,24,49,35,37,29,40,58,51,61,60,57,51,56,55,64,72,92,78,64,68,87,69,55,56,80,109,81,87,95,98,103,104,103,62,77,113,121,112,100,120,92,101,103,99 };
-static int16 s_std_croma_quant[64] = { 17,18,18,24,21,24,47,26,26,47,99,66,56,66,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99 };
-static uint8 s_dc_lum_bits[17] = { 0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0 };
-static uint8 s_dc_lum_val[DC_LUM_CODES] = { 0,1,2,3,4,5,6,7,8,9,10,11 };
-static uint8 s_ac_lum_bits[17] = { 0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,0x7d };
-static uint8 s_ac_lum_val[AC_LUM_CODES]  =
-{
-  0x01,0x02,0x03,0x00,0x04,0x11,0x05,0x12,0x21,0x31,0x41,0x06,0x13,0x51,0x61,0x07,0x22,0x71,0x14,0x32,0x81,0x91,0xa1,0x08,0x23,0x42,0xb1,0xc1,0x15,0x52,0xd1,0xf0,
-  0x24,0x33,0x62,0x72,0x82,0x09,0x0a,0x16,0x17,0x18,0x19,0x1a,0x25,0x26,0x27,0x28,0x29,0x2a,0x34,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,
-  0x4a,0x53,0x54,0x55,0x56,0x57,0x58,0x59,0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x83,0x84,0x85,0x86,0x87,0x88,0x89,
-  0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4,0xb5,0xb6,0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,
-  0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda,0xe1,0xe2,0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf1,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,
-  0xf9,0xfa
-};
-static uint8 s_dc_chroma_bits[17] = { 0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0 };
-static uint8 s_dc_chroma_val[DC_CHROMA_CODES]  = { 0,1,2,3,4,5,6,7,8,9,10,11 };
-static uint8 s_ac_chroma_bits[17] = { 0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,0x77 };
-static uint8 s_ac_chroma_val[AC_CHROMA_CODES] =
-{
-  0x00,0x01,0x02,0x03,0x11,0x04,0x05,0x21,0x31,0x06,0x12,0x41,0x51,0x07,0x61,0x71,0x13,0x22,0x32,0x81,0x08,0x14,0x42,0x91,0xa1,0xb1,0xc1,0x09,0x23,0x33,0x52,0xf0,
-  0x15,0x62,0x72,0xd1,0x0a,0x16,0x24,0x34,0xe1,0x25,0xf1,0x17,0x18,0x19,0x1a,0x26,0x27,0x28,0x29,0x2a,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,
-  0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58,0x59,0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x82,0x83,0x84,0x85,0x86,0x87,
-  0x88,0x89,0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4,0xb5,0xb6,0xb7,0xb8,0xb9,0xba,0xc2,0xc3,
-  0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda,0xe2,0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,
-  0xf9,0xfa
-};
-
-// Low-level helper functions.
-template <class T> inline void clear_obj(T &obj) { memset(&obj, 0, sizeof(obj)); }
-
-const int YR = 19595, YG = 38470, YB = 7471, CB_R = -11059, CB_G = -21709, CB_B = 32768, CR_R = 32768, CR_G = -27439, CR_B = -5329;
-static inline uint8 clamp(int i) { if (static_cast<uint>(i) > 255U) { if (i < 0) i = 0; else if (i > 255) i = 255; } return static_cast<uint8>(i); }
-
-static void RGB_to_YCC(uint8* pDst, const uint8 *pSrc, int num_pixels)
-{
-  for ( ; num_pixels; pDst += 3, pSrc += 3, num_pixels--)
-  {
-    const int r = pSrc[0], g = pSrc[1], b = pSrc[2];
-    pDst[0] = static_cast<uint8>((r * YR + g * YG + b * YB + 32768) >> 16);
-    pDst[1] = clamp(128 + ((r * CB_R + g * CB_G + b * CB_B + 32768) >> 16));
-    pDst[2] = clamp(128 + ((r * CR_R + g * CR_G + b * CR_B + 32768) >> 16));
-  }
-}
-
-static void RGB_to_Y(uint8* pDst, const uint8 *pSrc, int num_pixels)
-{
-  for ( ; num_pixels; pDst++, pSrc += 3, num_pixels--)
-    pDst[0] = static_cast<uint8>((pSrc[0] * YR + pSrc[1] * YG + pSrc[2] * YB + 32768) >> 16);
-}
-
-static void RGBA_to_YCC(uint8* pDst, const uint8 *pSrc, int num_pixels)
-{
-  for ( ; num_pixels; pDst += 3, pSrc += 4, num_pixels--)
-  {
-    const int r = pSrc[0], g = pSrc[1], b = pSrc[2];
-    pDst[0] = static_cast<uint8>((r * YR + g * YG + b * YB + 32768) >> 16);
-    pDst[1] = clamp(128 + ((r * CB_R + g * CB_G + b * CB_B + 32768) >> 16));
-    pDst[2] = clamp(128 + ((r * CR_R + g * CR_G + b * CR_B + 32768) >> 16));
-  }
-}
-
-static void RGBA_to_Y(uint8* pDst, const uint8 *pSrc, int num_pixels)
-{
-  for ( ; num_pixels; pDst++, pSrc += 4, num_pixels--)
-    pDst[0] = static_cast<uint8>((pSrc[0] * YR + pSrc[1] * YG + pSrc[2] * YB + 32768) >> 16);
-}
-
-static void Y_to_YCC(uint8* pDst, const uint8* pSrc, int num_pixels)
-{
-  for( ; num_pixels; pDst += 3, pSrc++, num_pixels--) { pDst[0] = pSrc[0]; pDst[1] = 128; pDst[2] = 128; }
-}
-
-// Forward DCT - DCT derived from jfdctint.
-#define CONST_BITS  13
-#define ROW_BITS    2
-#define DCT_DESCALE(x, n) (((x) + (((int32)1) << ((n) - 1))) >> (n))
-#define DCT_MUL(var, c) (static_cast<int16>(var) * static_cast<int32>(c))
-#define DCT1D(s0, s1, s2, s3, s4, s5, s6, s7) \
-  int32 t0 = s0 + s7, t7 = s0 - s7, t1 = s1 + s6, t6 = s1 - s6, t2 = s2 + s5, t5 = s2 - s5, t3 = s3 + s4, t4 = s3 - s4; \
-  int32 t10 = t0 + t3, t13 = t0 - t3, t11 = t1 + t2, t12 = t1 - t2; \
-  int32 u1 = DCT_MUL(t12 + t13, 4433); \
-  s2 = u1 + DCT_MUL(t13, 6270); \
-  s6 = u1 + DCT_MUL(t12, -15137); \
-  u1 = t4 + t7; \
-  int32 u2 = t5 + t6, u3 = t4 + t6, u4 = t5 + t7; \
-  int32 z5 = DCT_MUL(u3 + u4, 9633); \
-  t4 = DCT_MUL(t4, 2446); t5 = DCT_MUL(t5, 16819); \
-  t6 = DCT_MUL(t6, 25172); t7 = DCT_MUL(t7, 12299); \
-  u1 = DCT_MUL(u1, -7373); u2 = DCT_MUL(u2, -20995); \
-  u3 = DCT_MUL(u3, -16069); u4 = DCT_MUL(u4, -3196); \
-  u3 += z5; u4 += z5; \
-  s0 = t10 + t11; s1 = t7 + u1 + u4; s3 = t6 + u2 + u3; s4 = t10 - t11; s5 = t5 + u2 + u4; s7 = t4 + u1 + u3;
-
-static void DCT2D(int32 *p)
-{
-  int32 c, *q = p;
-  for (c = 7; c >= 0; c--, q += 8)
-  {
-    int32 s0 = q[0], s1 = q[1], s2 = q[2], s3 = q[3], s4 = q[4], s5 = q[5], s6 = q[6], s7 = q[7];
-    DCT1D(s0, s1, s2, s3, s4, s5, s6, s7);
-    q[0] = s0 << ROW_BITS; q[1] = DCT_DESCALE(s1, CONST_BITS-ROW_BITS); q[2] = DCT_DESCALE(s2, CONST_BITS-ROW_BITS); q[3] = DCT_DESCALE(s3, CONST_BITS-ROW_BITS);
-    q[4] = s4 << ROW_BITS; q[5] = DCT_DESCALE(s5, CONST_BITS-ROW_BITS); q[6] = DCT_DESCALE(s6, CONST_BITS-ROW_BITS); q[7] = DCT_DESCALE(s7, CONST_BITS-ROW_BITS);
-  }
-  for (q = p, c = 7; c >= 0; c--, q++)
-  {
-    int32 s0 = q[0*8], s1 = q[1*8], s2 = q[2*8], s3 = q[3*8], s4 = q[4*8], s5 = q[5*8], s6 = q[6*8], s7 = q[7*8];
-    DCT1D(s0, s1, s2, s3, s4, s5, s6, s7);
-    q[0*8] = DCT_DESCALE(s0, ROW_BITS+3); q[1*8] = DCT_DESCALE(s1, CONST_BITS+ROW_BITS+3); q[2*8] = DCT_DESCALE(s2, CONST_BITS+ROW_BITS+3); q[3*8] = DCT_DESCALE(s3, CONST_BITS+ROW_BITS+3);
-    q[4*8] = DCT_DESCALE(s4, ROW_BITS+3); q[5*8] = DCT_DESCALE(s5, CONST_BITS+ROW_BITS+3); q[6*8] = DCT_DESCALE(s6, CONST_BITS+ROW_BITS+3); q[7*8] = DCT_DESCALE(s7, CONST_BITS+ROW_BITS+3);
-  }
-}
-
-struct sym_freq { uint m_key, m_sym_index; };
-
-// Radix sorts sym_freq[] array by 32-bit key m_key. Returns ptr to sorted values.
-static inline sym_freq* radix_sort_syms(uint num_syms, sym_freq* pSyms0, sym_freq* pSyms1)
-{
-  const uint cMaxPasses = 4;
-  uint32 hist[256 * cMaxPasses]; clear_obj(hist);
-  for (uint i = 0; i < num_syms; i++) { uint freq = pSyms0[i].m_key; hist[freq & 0xFF]++; hist[256 + ((freq >> 8) & 0xFF)]++; hist[256*2 + ((freq >> 16) & 0xFF)]++; hist[256*3 + ((freq >> 24) & 0xFF)]++; }
-  sym_freq* pCur_syms = pSyms0, *pNew_syms = pSyms1;
-  uint total_passes = cMaxPasses; while ((total_passes > 1) && (num_syms == hist[(total_passes - 1) * 256])) total_passes--;
-  for (uint pass_shift = 0, pass = 0; pass < total_passes; pass++, pass_shift += 8)
-  {
-    const uint32* pHist = &hist[pass << 8];
-    uint offsets[256], cur_ofs = 0;
-    for (uint i = 0; i < 256; i++) { offsets[i] = cur_ofs; cur_ofs += pHist[i]; }
-    for (uint i = 0; i < num_syms; i++)
-      pNew_syms[offsets[(pCur_syms[i].m_key >> pass_shift) & 0xFF]++] = pCur_syms[i];
-    sym_freq* t = pCur_syms; pCur_syms = pNew_syms; pNew_syms = t;
-  }
-  return pCur_syms;
-}
-
-// calculate_minimum_redundancy() originally written by: Alistair Moffat, alistair@cs.mu.oz.au, Jyrki Katajainen, jyrki@diku.dk, November 1996.
-static void calculate_minimum_redundancy(sym_freq *A, int n)
-{
-  int root, leaf, next, avbl, used, dpth;
-  if (n==0) return; else if (n==1) { A[0].m_key = 1; return; }
-  A[0].m_key += A[1].m_key; root = 0; leaf = 2;
-  for (next=1; next < n-1; next++)
-  {
-    if (leaf>=n || A[root].m_key<A[leaf].m_key) { A[next].m_key = A[root].m_key; A[root++].m_key = next; } else A[next].m_key = A[leaf++].m_key;
-    if (leaf>=n || (root<next && A[root].m_key<A[leaf].m_key)) { A[next].m_key += A[root].m_key; A[root++].m_key = next; } else A[next].m_key += A[leaf++].m_key;
-  }
-  A[n-2].m_key = 0;
-  for (next=n-3; next>=0; next--) A[next].m_key = A[A[next].m_key].m_key+1;
-  avbl = 1; used = dpth = 0; root = n-2; next = n-1;
-  while (avbl>0)
-  {
-    while (root>=0 && (int)A[root].m_key==dpth) { used++; root--; }
-    while (avbl>used) { A[next--].m_key = dpth; avbl--; }
-    avbl = 2*used; dpth++; used = 0;
-  }
-}
-
-// Limits canonical Huffman code table's max code size to max_code_size.
-static void huffman_enforce_max_code_size(int *pNum_codes, int code_list_len, int max_code_size)
-{
-  if (code_list_len <= 1) return;
-
-  for (int i = max_code_size + 1; i <= MAX_HUFF_CODESIZE; i++) pNum_codes[max_code_size] += pNum_codes[i];
-
-  uint32 total = 0;
-  for (int i = max_code_size; i > 0; i--)
-    total += (((uint32)pNum_codes[i]) << (max_code_size - i));
-
-  while (total != (1UL << max_code_size))
-  {
-    pNum_codes[max_code_size]--;
-    for (int i = max_code_size - 1; i > 0; i--)
-    {
-      if (pNum_codes[i]) { pNum_codes[i]--; pNum_codes[i + 1] += 2; break; }
-    }
-    total--;
-  }
-}
-
-// Generates an optimized offman table.
-void jpeg_encoder::optimize_huffman_table(int table_num, int table_len)
-{
-  sym_freq syms0[MAX_HUFF_SYMBOLS], syms1[MAX_HUFF_SYMBOLS];
-  syms0[0].m_key = 1; syms0[0].m_sym_index = 0;  // dummy symbol, assures that no valid code contains all 1's
-  int num_used_syms = 1;
-  const uint32 *pSym_count = &m_huff_count[table_num][0];
-  for (int i = 0; i < table_len; i++)
-    if (pSym_count[i]) { syms0[num_used_syms].m_key = pSym_count[i]; syms0[num_used_syms++].m_sym_index = i + 1; }
-  sym_freq* pSyms = radix_sort_syms(num_used_syms, syms0, syms1);
-  calculate_minimum_redundancy(pSyms, num_used_syms);
-
-  // Count the # of symbols of each code size.
-  int num_codes[1 + MAX_HUFF_CODESIZE]; clear_obj(num_codes);
-  for (int i = 0; i < num_used_syms; i++)
-    num_codes[pSyms[i].m_key]++;
-
-  const uint JPGE_CODE_SIZE_LIMIT = 16; // the maximum possible size of a JPEG Huffman code (valid range is [9,16] - 9 vs. 8 because of the dummy symbol)
-  huffman_enforce_max_code_size(num_codes, num_used_syms, JPGE_CODE_SIZE_LIMIT);
-
-  // Compute m_huff_bits array, which contains the # of symbols per code size.
-  clear_obj(m_huff_bits[table_num]);
-  for (int i = 1; i <= (int)JPGE_CODE_SIZE_LIMIT; i++)
-    m_huff_bits[table_num][i] = static_cast<uint8>(num_codes[i]);
-
-  // Remove the dummy symbol added above, which must be in largest bucket.
-  for (int i = JPGE_CODE_SIZE_LIMIT; i >= 1; i--)
-  {
-    if (m_huff_bits[table_num][i]) { m_huff_bits[table_num][i]--; break; }
-  }
-
-  // Compute the m_huff_val array, which contains the symbol indices sorted by code size (smallest to largest).
-  for (int i = num_used_syms - 1; i >= 1; i--)
-    m_huff_val[table_num][num_used_syms - 1 - i] = static_cast<uint8>(pSyms[i].m_sym_index - 1);
-}
-
-// JPEG marker generation.
-void jpeg_encoder::emit_byte(uint8 i)
-{
-  m_all_stream_writes_succeeded = m_all_stream_writes_succeeded && m_pStream->put_obj(i);
-}
-
-void jpeg_encoder::emit_word(uint i)
-{
-  emit_byte(uint8(i >> 8)); emit_byte(uint8(i & 0xFF));
-}
-
-void jpeg_encoder::emit_marker(int marker)
-{
-  emit_byte(uint8(0xFF)); emit_byte(uint8(marker));
-}
-
-// Emit JFIF marker
-void jpeg_encoder::emit_jfif_app0()
-{
-  emit_marker(M_APP0);
-  emit_word(2 + 4 + 1 + 2 + 1 + 2 + 2 + 1 + 1);
-  emit_byte(0x4A); emit_byte(0x46); emit_byte(0x49); emit_byte(0x46); /* Identifier: ASCII "JFIF" */
-  emit_byte(0);
-  emit_byte(1);      /* Major version */
-  emit_byte(1);      /* Minor version */
-  emit_byte(0);      /* Density unit */
-  emit_word(1);
-  emit_word(1);
-  emit_byte(0);      /* No thumbnail image */
-  emit_byte(0);
-}
-
-// Emit quantization tables
-void jpeg_encoder::emit_dqt()
-{
-  for (int i = 0; i < ((m_num_components == 3) ? 2 : 1); i++)
-  {
-    emit_marker(M_DQT);
-    emit_word(64 + 1 + 2);
-    emit_byte(static_cast<uint8>(i));
-    for (int j = 0; j < 64; j++)
-      emit_byte(static_cast<uint8>(m_quantization_tables[i][j]));
-  }
-}
-
-// Emit start of frame marker
-void jpeg_encoder::emit_sof()
-{
-  emit_marker(M_SOF0);                           /* baseline */
-  emit_word(3 * m_num_components + 2 + 5 + 1);
-  emit_byte(8);                                  /* precision */
-  emit_word(m_image_y);
-  emit_word(m_image_x);
-  emit_byte(m_num_components);
-  for (int i = 0; i < m_num_components; i++)
-  {
-    emit_byte(static_cast<uint8>(i + 1));                                   /* component ID     */
-    emit_byte((m_comp_h_samp[i] << 4) + m_comp_v_samp[i]);  /* h and v sampling */
-    emit_byte(i > 0);                                   /* quant. table num */
-  }
-}
-
-// Emit Huffman table.
-void jpeg_encoder::emit_dht(uint8 *bits, uint8 *val, int index, bool ac_flag)
-{
-  emit_marker(M_DHT);
-
-  int length = 0;
-  for (int i = 1; i <= 16; i++)
-    length += bits[i];
-
-  emit_word(length + 2 + 1 + 16);
-  emit_byte(static_cast<uint8>(index + (ac_flag << 4)));
-
-  for (int i = 1; i <= 16; i++)
-    emit_byte(bits[i]);
-
-  for (int i = 0; i < length; i++)
-    emit_byte(val[i]);
-}
-
-// Emit all Huffman tables.
-void jpeg_encoder::emit_dhts()
-{
-  emit_dht(m_huff_bits[0+0], m_huff_val[0+0], 0, false);
-  emit_dht(m_huff_bits[2+0], m_huff_val[2+0], 0, true);
-  if (m_num_components == 3)
-  {
-    emit_dht(m_huff_bits[0+1], m_huff_val[0+1], 1, false);
-    emit_dht(m_huff_bits[2+1], m_huff_val[2+1], 1, true);
-  }
-}
-
-// emit start of scan
-void jpeg_encoder::emit_sos()
-{
-  emit_marker(M_SOS);
-  emit_word(2 * m_num_components + 2 + 1 + 3);
-  emit_byte(m_num_components);
-  for (int i = 0; i < m_num_components; i++)
-  {
-    emit_byte(static_cast<uint8>(i + 1));
-    if (i == 0)
-      emit_byte((0 << 4) + 0);
-    else
-      emit_byte((1 << 4) + 1);
-  }
-  emit_byte(0);     /* spectral selection */
-  emit_byte(63);
-  emit_byte(0);
-}
-
-// Emit all markers at beginning of image file.
-void jpeg_encoder::emit_markers()
-{
-  emit_marker(M_SOI);
-  emit_jfif_app0();
-  emit_dqt();
-  emit_sof();
-  emit_dhts();
-  emit_sos();
-}
-
-// Compute the actual canonical Huffman codes/code sizes given the JPEG huff bits and val arrays.
-void jpeg_encoder::compute_huffman_table(uint *codes, uint8 *code_sizes, uint8 *bits, uint8 *val)
-{
-  int i, l, last_p, si;
-  uint8 huff_size[257];
-  uint huff_code[257];
-  uint code;
-
-  int p = 0;
-  for (l = 1; l <= 16; l++)
-    for (i = 1; i <= bits[l]; i++)
-      huff_size[p++] = (char)l;
-
-  huff_size[p] = 0; last_p = p; // write sentinel
-
-  code = 0; si = huff_size[0]; p = 0;
-
-  while (huff_size[p])
-  {
-    while (huff_size[p] == si)
-      huff_code[p++] = code++;
-    code <<= 1;
-    si++;
-  }
-
-  memset(codes, 0, sizeof(codes[0])*256);
-  memset(code_sizes, 0, sizeof(code_sizes[0])*256);
-  for (p = 0; p < last_p; p++)
-  {
-    codes[val[p]]      = huff_code[p];
-    code_sizes[val[p]] = huff_size[p];
-  }
-}
-
-// Quantization table generation.
-void jpeg_encoder::compute_quant_table(int32 *pDst, int16 *pSrc)
-{
-  int32 q;
-  if (m_params.m_quality < 50)
-    q = 5000 / m_params.m_quality;
-  else
-    q = 200 - m_params.m_quality * 2;
-  for (int i = 0; i < 64; i++)
-  {
-    int32 j = *pSrc++; j = (j * q + 50L) / 100L;
-    *pDst++ = JPGE_MIN(JPGE_MAX(j, 1), 255);
-  }
-}
-
-// Higher-level methods.
-void jpeg_encoder::first_pass_init()
-{
-  m_bit_buffer = 0; m_bits_in = 0;
-  memset(m_last_dc_val, 0, 3 * sizeof(m_last_dc_val[0]));
-  m_mcu_y_ofs = 0;
-  m_pass_num = 1;
-}
-
-bool jpeg_encoder::second_pass_init()
-{
-  compute_huffman_table(&m_huff_codes[0+0][0], &m_huff_code_sizes[0+0][0], m_huff_bits[0+0], m_huff_val[0+0]);
-  compute_huffman_table(&m_huff_codes[2+0][0], &m_huff_code_sizes[2+0][0], m_huff_bits[2+0], m_huff_val[2+0]);
-  if (m_num_components > 1)
-  {
-    compute_huffman_table(&m_huff_codes[0+1][0], &m_huff_code_sizes[0+1][0], m_huff_bits[0+1], m_huff_val[0+1]);
-    compute_huffman_table(&m_huff_codes[2+1][0], &m_huff_code_sizes[2+1][0], m_huff_bits[2+1], m_huff_val[2+1]);
-  }
-  first_pass_init();
-  emit_markers();
-  m_pass_num = 2;
-  return true;
-}
-
-bool jpeg_encoder::jpg_open(int p_x_res, int p_y_res, int src_channels)
-{
-  m_num_components = 3;
-  switch (m_params.m_subsampling)
-  {
-    case Y_ONLY:
-    {
-      m_num_components = 1;
-      m_comp_h_samp[0] = 1; m_comp_v_samp[0] = 1;
-      m_mcu_x          = 8; m_mcu_y          = 8;
-      break;
-    }
-    case H1V1:
-    {
-      m_comp_h_samp[0] = 1; m_comp_v_samp[0] = 1;
-      m_comp_h_samp[1] = 1; m_comp_v_samp[1] = 1;
-      m_comp_h_samp[2] = 1; m_comp_v_samp[2] = 1;
-      m_mcu_x          = 8; m_mcu_y          = 8;
-      break;
-    }
-    case H2V1:
-    {
-      m_comp_h_samp[0] = 2; m_comp_v_samp[0] = 1;
-      m_comp_h_samp[1] = 1; m_comp_v_samp[1] = 1;
-      m_comp_h_samp[2] = 1; m_comp_v_samp[2] = 1;
-      m_mcu_x          = 16; m_mcu_y         = 8;
-      break;
-    }
-    case H2V2:
-    {
-      m_comp_h_samp[0] = 2; m_comp_v_samp[0] = 2;
-      m_comp_h_samp[1] = 1; m_comp_v_samp[1] = 1;
-      m_comp_h_samp[2] = 1; m_comp_v_samp[2] = 1;
-      m_mcu_x          = 16; m_mcu_y         = 16;
-    }
-  }
-
-  m_image_x        = p_x_res; m_image_y = p_y_res;
-  m_image_bpp      = src_channels;
-  m_image_bpl      = m_image_x * src_channels;
-  m_image_x_mcu    = (m_image_x + m_mcu_x - 1) & (~(m_mcu_x - 1));
-  m_image_y_mcu    = (m_image_y + m_mcu_y - 1) & (~(m_mcu_y - 1));
-  m_image_bpl_xlt  = m_image_x * m_num_components;
-  m_image_bpl_mcu  = m_image_x_mcu * m_num_components;
-  m_mcus_per_row   = m_image_x_mcu / m_mcu_x;
-
-  if ((m_mcu_lines[0] = static_cast<uint8*>(jpge_malloc(m_image_bpl_mcu * m_mcu_y))) == NULL) return false;
-  for (int i = 1; i < m_mcu_y; i++)
-    m_mcu_lines[i] = m_mcu_lines[i-1] + m_image_bpl_mcu;
-
-  compute_quant_table(m_quantization_tables[0], s_std_lum_quant);
-  compute_quant_table(m_quantization_tables[1], m_params.m_no_chroma_discrim_flag ? s_std_lum_quant : s_std_croma_quant);
-
-  m_out_buf_left = JPGE_OUT_BUF_SIZE;
-  m_pOut_buf = m_out_buf;
-
-  if (m_params.m_two_pass_flag)
-  {
-    clear_obj(m_huff_count);
-    first_pass_init();
-  }
-  else
-  {
-    memcpy(m_huff_bits[0+0], s_dc_lum_bits, 17);    memcpy(m_huff_val [0+0], s_dc_lum_val, DC_LUM_CODES);
-    memcpy(m_huff_bits[2+0], s_ac_lum_bits, 17);    memcpy(m_huff_val [2+0], s_ac_lum_val, AC_LUM_CODES);
-    memcpy(m_huff_bits[0+1], s_dc_chroma_bits, 17); memcpy(m_huff_val [0+1], s_dc_chroma_val, DC_CHROMA_CODES);
-    memcpy(m_huff_bits[2+1], s_ac_chroma_bits, 17); memcpy(m_huff_val [2+1], s_ac_chroma_val, AC_CHROMA_CODES);
-    if (!second_pass_init()) return false;   // in effect, skip over the first pass
-  }
-  return m_all_stream_writes_succeeded;
-}
-
-void jpeg_encoder::load_block_8_8_grey(int x)
-{
-  uint8 *pSrc;
-  sample_array_t *pDst = m_sample_array;
-  x <<= 3;
-  for (int i = 0; i < 8; i++, pDst += 8)
-  {
-    pSrc = m_mcu_lines[i] + x;
-    pDst[0] = pSrc[0] - 128; pDst[1] = pSrc[1] - 128; pDst[2] = pSrc[2] - 128; pDst[3] = pSrc[3] - 128;
-    pDst[4] = pSrc[4] - 128; pDst[5] = pSrc[5] - 128; pDst[6] = pSrc[6] - 128; pDst[7] = pSrc[7] - 128;
-  }
-}
-
-void jpeg_encoder::load_block_8_8(int x, int y, int c)
-{
-  uint8 *pSrc;
-  sample_array_t *pDst = m_sample_array;
-  x = (x * (8 * 3)) + c;
-  y <<= 3;
-  for (int i = 0; i < 8; i++, pDst += 8)
-  {
-    pSrc = m_mcu_lines[y + i] + x;
-    pDst[0] = pSrc[0 * 3] - 128; pDst[1] = pSrc[1 * 3] - 128; pDst[2] = pSrc[2 * 3] - 128; pDst[3] = pSrc[3 * 3] - 128;
-    pDst[4] = pSrc[4 * 3] - 128; pDst[5] = pSrc[5 * 3] - 128; pDst[6] = pSrc[6 * 3] - 128; pDst[7] = pSrc[7 * 3] - 128;
-  }
-}
-
-void jpeg_encoder::load_block_16_8(int x, int c)
-{
-  uint8 *pSrc1, *pSrc2;
-  sample_array_t *pDst = m_sample_array;
-  x = (x * (16 * 3)) + c;
-  int a = 0, b = 2;
-  for (int i = 0; i < 16; i += 2, pDst += 8)
-  {
-    pSrc1 = m_mcu_lines[i + 0] + x;
-    pSrc2 = m_mcu_lines[i + 1] + x;
-    pDst[0] = ((pSrc1[ 0 * 3] + pSrc1[ 1 * 3] + pSrc2[ 0 * 3] + pSrc2[ 1 * 3] + a) >> 2) - 128; pDst[1] = ((pSrc1[ 2 * 3] + pSrc1[ 3 * 3] + pSrc2[ 2 * 3] + pSrc2[ 3 * 3] + b) >> 2) - 128;
-    pDst[2] = ((pSrc1[ 4 * 3] + pSrc1[ 5 * 3] + pSrc2[ 4 * 3] + pSrc2[ 5 * 3] + a) >> 2) - 128; pDst[3] = ((pSrc1[ 6 * 3] + pSrc1[ 7 * 3] + pSrc2[ 6 * 3] + pSrc2[ 7 * 3] + b) >> 2) - 128;
-    pDst[4] = ((pSrc1[ 8 * 3] + pSrc1[ 9 * 3] + pSrc2[ 8 * 3] + pSrc2[ 9 * 3] + a) >> 2) - 128; pDst[5] = ((pSrc1[10 * 3] + pSrc1[11 * 3] + pSrc2[10 * 3] + pSrc2[11 * 3] + b) >> 2) - 128;
-    pDst[6] = ((pSrc1[12 * 3] + pSrc1[13 * 3] + pSrc2[12 * 3] + pSrc2[13 * 3] + a) >> 2) - 128; pDst[7] = ((pSrc1[14 * 3] + pSrc1[15 * 3] + pSrc2[14 * 3] + pSrc2[15 * 3] + b) >> 2) - 128;
-    int temp = a; a = b; b = temp;
-  }
-}
-
-void jpeg_encoder::load_block_16_8_8(int x, int c)
-{
-  uint8 *pSrc1;
-  sample_array_t *pDst = m_sample_array;
-  x = (x * (16 * 3)) + c;
-  for (int i = 0; i < 8; i++, pDst += 8)
-  {
-    pSrc1 = m_mcu_lines[i + 0] + x;
-    pDst[0] = ((pSrc1[ 0 * 3] + pSrc1[ 1 * 3]) >> 1) - 128; pDst[1] = ((pSrc1[ 2 * 3] + pSrc1[ 3 * 3]) >> 1) - 128;
-    pDst[2] = ((pSrc1[ 4 * 3] + pSrc1[ 5 * 3]) >> 1) - 128; pDst[3] = ((pSrc1[ 6 * 3] + pSrc1[ 7 * 3]) >> 1) - 128;
-    pDst[4] = ((pSrc1[ 8 * 3] + pSrc1[ 9 * 3]) >> 1) - 128; pDst[5] = ((pSrc1[10 * 3] + pSrc1[11 * 3]) >> 1) - 128;
-    pDst[6] = ((pSrc1[12 * 3] + pSrc1[13 * 3]) >> 1) - 128; pDst[7] = ((pSrc1[14 * 3] + pSrc1[15 * 3]) >> 1) - 128;
-  }
-}
-
-void jpeg_encoder::load_quantized_coefficients(int component_num)
-{
-  int32 *q = m_quantization_tables[component_num > 0];
-  int16 *pDst = m_coefficient_array;
-  for (int i = 0; i < 64; i++)
-  {
-    sample_array_t j = m_sample_array[s_zag[i]];
-    if (j < 0)
-    {
-      if ((j = -j + (*q >> 1)) < *q)
-        *pDst++ = 0;
-      else
-        *pDst++ = static_cast<int16>(-(j / *q));
-    }
-    else
-    {
-      if ((j = j + (*q >> 1)) < *q)
-        *pDst++ = 0;
-      else
-        *pDst++ = static_cast<int16>((j / *q));
-    }
-    q++;
-  }
-}
-
-void jpeg_encoder::flush_output_buffer()
-{
-  if (m_out_buf_left != JPGE_OUT_BUF_SIZE)
-    m_all_stream_writes_succeeded = m_all_stream_writes_succeeded && m_pStream->put_buf(m_out_buf, JPGE_OUT_BUF_SIZE - m_out_buf_left);
-  m_pOut_buf = m_out_buf;
-  m_out_buf_left = JPGE_OUT_BUF_SIZE;
-}
-
-void jpeg_encoder::put_bits(uint bits, uint len)
-{
-  m_bit_buffer |= ((uint32)bits << (24 - (m_bits_in += len)));
-  while (m_bits_in >= 8)
-  {
-    uint8 c;
-    #define JPGE_PUT_BYTE(c) { *m_pOut_buf++ = (c); if (--m_out_buf_left == 0) flush_output_buffer(); }
-    JPGE_PUT_BYTE(c = (uint8)((m_bit_buffer >> 16) & 0xFF));
-    if (c == 0xFF) JPGE_PUT_BYTE(0);
-    m_bit_buffer <<= 8;
-    m_bits_in -= 8;
-  }
-}
-
-void jpeg_encoder::code_coefficients_pass_one(int component_num)
-{
-  if (component_num >= 3) return; // just to shut up static analysis
-  int i, run_len, nbits, temp1;
-  int16 *src = m_coefficient_array;
-  uint32 *dc_count = component_num ? m_huff_count[0 + 1] : m_huff_count[0 + 0], *ac_count = component_num ? m_huff_count[2 + 1] : m_huff_count[2 + 0];
-
-  temp1 = src[0] - m_last_dc_val[component_num];
-  m_last_dc_val[component_num] = src[0];
-  if (temp1 < 0) temp1 = -temp1;
-
-  nbits = 0;
-  while (temp1)
-  {
-    nbits++; temp1 >>= 1;
-  }
-
-  dc_count[nbits]++;
-  for (run_len = 0, i = 1; i < 64; i++)
-  {
-    if ((temp1 = m_coefficient_array[i]) == 0)
-      run_len++;
-    else
-    {
-      while (run_len >= 16)
-      {
-        ac_count[0xF0]++;
-        run_len -= 16;
-      }
-      if (temp1 < 0) temp1 = -temp1;
-      nbits = 1;
-      while (temp1 >>= 1) nbits++;
-      ac_count[(run_len << 4) + nbits]++;
-      run_len = 0;
-    }
-  }
-  if (run_len) ac_count[0]++;
-}
-
-void jpeg_encoder::code_coefficients_pass_two(int component_num)
-{
-  int i, j, run_len, nbits, temp1, temp2;
-  int16 *pSrc = m_coefficient_array;
-  uint *codes[2];
-  uint8 *code_sizes[2];
-
-  if (component_num == 0)
-  {
-    codes[0] = m_huff_codes[0 + 0]; codes[1] = m_huff_codes[2 + 0];
-    code_sizes[0] = m_huff_code_sizes[0 + 0]; code_sizes[1] = m_huff_code_sizes[2 + 0];
-  }
-  else
-  {
-    codes[0] = m_huff_codes[0 + 1]; codes[1] = m_huff_codes[2 + 1];
-    code_sizes[0] = m_huff_code_sizes[0 + 1]; code_sizes[1] = m_huff_code_sizes[2 + 1];
-  }
-
-  temp1 = temp2 = pSrc[0] - m_last_dc_val[component_num];
-  m_last_dc_val[component_num] = pSrc[0];
-
-  if (temp1 < 0)
-  {
-    temp1 = -temp1; temp2--;
-  }
-
-  nbits = 0;
-  while (temp1)
-  {
-    nbits++; temp1 >>= 1;
-  }
-
-  put_bits(codes[0][nbits], code_sizes[0][nbits]);
-  if (nbits) put_bits(temp2 & ((1 << nbits) - 1), nbits);
-
-  for (run_len = 0, i = 1; i < 64; i++)
-  {
-    if ((temp1 = m_coefficient_array[i]) == 0)
-      run_len++;
-    else
-    {
-      while (run_len >= 16)
-      {
-        put_bits(codes[1][0xF0], code_sizes[1][0xF0]);
-        run_len -= 16;
-      }
-      if ((temp2 = temp1) < 0)
-      {
-        temp1 = -temp1;
-        temp2--;
-      }
-      nbits = 1;
-      while (temp1 >>= 1)
-        nbits++;
-      j = (run_len << 4) + nbits;
-      put_bits(codes[1][j], code_sizes[1][j]);
-      put_bits(temp2 & ((1 << nbits) - 1), nbits);
-      run_len = 0;
-    }
-  }
-  if (run_len)
-    put_bits(codes[1][0], code_sizes[1][0]);
-}
-
-void jpeg_encoder::code_block(int component_num)
-{
-  DCT2D(m_sample_array);
-  load_quantized_coefficients(component_num);
-  if (m_pass_num == 1)
-    code_coefficients_pass_one(component_num);
-  else
-    code_coefficients_pass_two(component_num);
-}
-
-void jpeg_encoder::process_mcu_row()
-{
-  if (m_num_components == 1)
-  {
-    for (int i = 0; i < m_mcus_per_row; i++)
-    {
-      load_block_8_8_grey(i); code_block(0);
-    }
-  }
-  else if ((m_comp_h_samp[0] == 1) && (m_comp_v_samp[0] == 1))
-  {
-    for (int i = 0; i < m_mcus_per_row; i++)
-    {
-      load_block_8_8(i, 0, 0); code_block(0); load_block_8_8(i, 0, 1); code_block(1); load_block_8_8(i, 0, 2); code_block(2);
-    }
-  }
-  else if ((m_comp_h_samp[0] == 2) && (m_comp_v_samp[0] == 1))
-  {
-    for (int i = 0; i < m_mcus_per_row; i++)
-    {
-      load_block_8_8(i * 2 + 0, 0, 0); code_block(0); load_block_8_8(i * 2 + 1, 0, 0); code_block(0);
-      load_block_16_8_8(i, 1); code_block(1); load_block_16_8_8(i, 2); code_block(2);
-    }
-  }
-  else if ((m_comp_h_samp[0] == 2) && (m_comp_v_samp[0] == 2))
-  {
-    for (int i = 0; i < m_mcus_per_row; i++)
-    {
-      load_block_8_8(i * 2 + 0, 0, 0); code_block(0); load_block_8_8(i * 2 + 1, 0, 0); code_block(0);
-      load_block_8_8(i * 2 + 0, 1, 0); code_block(0); load_block_8_8(i * 2 + 1, 1, 0); code_block(0);
-      load_block_16_8(i, 1); code_block(1); load_block_16_8(i, 2); code_block(2);
-    }
-  }
-}
-
-bool jpeg_encoder::terminate_pass_one()
-{
-  optimize_huffman_table(0+0, DC_LUM_CODES); optimize_huffman_table(2+0, AC_LUM_CODES);
-  if (m_num_components > 1)
-  {
-    optimize_huffman_table(0+1, DC_CHROMA_CODES); optimize_huffman_table(2+1, AC_CHROMA_CODES);
-  }
-  return second_pass_init();
-}
-
-bool jpeg_encoder::terminate_pass_two()
-{
-  put_bits(0x7F, 7);
-  flush_output_buffer();
-  emit_marker(M_EOI);
-  m_pass_num++; // purposely bump up m_pass_num, for debugging
-  return true;
-}
-
-bool jpeg_encoder::process_end_of_image()
-{
-  if (m_mcu_y_ofs)
-  {
-    if (m_mcu_y_ofs < 16) // check here just to shut up static analysis
-    {
-      for (int i = m_mcu_y_ofs; i < m_mcu_y; i++)
-        memcpy(m_mcu_lines[i], m_mcu_lines[m_mcu_y_ofs - 1], m_image_bpl_mcu);
-    }
-
-    process_mcu_row();
-  }
-
-  if (m_pass_num == 1)
-    return terminate_pass_one();
-  else
-    return terminate_pass_two();
-}
-
-void jpeg_encoder::load_mcu(const void *pSrc)
-{
-  const uint8* Psrc = reinterpret_cast<const uint8*>(pSrc);
-
-  uint8* pDst = m_mcu_lines[m_mcu_y_ofs]; // OK to write up to m_image_bpl_xlt bytes to pDst
-
-  if (m_num_components == 1)
-  {
-    if (m_image_bpp == 4)
-      RGBA_to_Y(pDst, Psrc, m_image_x);
-    else if (m_image_bpp == 3)
-      RGB_to_Y(pDst, Psrc, m_image_x);
-    else
-      memcpy(pDst, Psrc, m_image_x);
-  }
-  else
-  {
-    if (m_image_bpp == 4)
-      RGBA_to_YCC(pDst, Psrc, m_image_x);
-    else if (m_image_bpp == 3)
-      RGB_to_YCC(pDst, Psrc, m_image_x);
-    else
-      Y_to_YCC(pDst, Psrc, m_image_x);
-  }
-
-  // Possibly duplicate pixels at end of scanline if not a multiple of 8 or 16
-  if (m_num_components == 1)
-    memset(m_mcu_lines[m_mcu_y_ofs] + m_image_bpl_xlt, pDst[m_image_bpl_xlt - 1], m_image_x_mcu - m_image_x);
-  else
-  {
-    const uint8 y = pDst[m_image_bpl_xlt - 3 + 0], cb = pDst[m_image_bpl_xlt - 3 + 1], cr = pDst[m_image_bpl_xlt - 3 + 2];
-    uint8 *q = m_mcu_lines[m_mcu_y_ofs] + m_image_bpl_xlt;
-    for (int i = m_image_x; i < m_image_x_mcu; i++)
-    {
-      *q++ = y; *q++ = cb; *q++ = cr;
-    }
-  }
-
-  if (++m_mcu_y_ofs == m_mcu_y)
-  {
-    process_mcu_row();
-    m_mcu_y_ofs = 0;
-  }
-}
-
-void jpeg_encoder::clear()
-{
-  m_mcu_lines[0] = NULL;
-  m_pass_num = 0;
-  m_all_stream_writes_succeeded = true;
-}
-
-jpeg_encoder::jpeg_encoder()
-{
-  clear();
-}
-
-jpeg_encoder::~jpeg_encoder()
-{
-  deinit();
-}
-
-bool jpeg_encoder::init(output_stream *pStream, int64_t width, int64_t height, int64_t src_channels, const params &comp_params)
-{
-  deinit();
-  if (((!pStream) || (width < 1) || (height < 1)) || ((src_channels != 1) && (src_channels != 3) && (src_channels != 4)) || (!comp_params.check_valid())) return false;
-  m_pStream = pStream;
-  m_params = comp_params;
-  return jpg_open(width, height, src_channels);
-}
-
-void jpeg_encoder::deinit()
-{
-  jpge_free(m_mcu_lines[0]);
-  clear();
-}
-
-bool jpeg_encoder::process_scanline(const void* pScanline)
-{
-  if ((m_pass_num < 1) || (m_pass_num > 2)) return false;
-  if (m_all_stream_writes_succeeded)
-  {
-    if (!pScanline)
-    {
-      if (!process_end_of_image()) return false;
-    }
-    else
-    {
-      load_mcu(pScanline);
-    }
-  }
-  return m_all_stream_writes_succeeded;
-}
-
-// Higher level wrappers/examples (optional).
-#include <stdio.h>
-
-class cfile_stream : public output_stream
-{
-   cfile_stream(const cfile_stream &);
-   cfile_stream &operator= (const cfile_stream &);
-
-   FILE* m_pFile;
-   bool m_bStatus;
-
-public:
-   cfile_stream() : m_pFile(NULL), m_bStatus(false) { }
-
-   virtual ~cfile_stream()
-   {
-      close();
-   }
-
-   bool open(const char *pFilename)
-   {
-      close();
-#if defined(_MSC_VER)
-      if (fopen_s(&m_pFile, pFilename, "wb") != 0)
-	  {
-		  return false;
-	  }
-#else
-      m_pFile = fopen(pFilename, "wb");
-#endif
-      m_bStatus = (m_pFile != NULL);
-      return m_bStatus;
-   }
-
-   bool close()
-   {
-      if (m_pFile)
-      {
-         if (fclose(m_pFile) == EOF)
-         {
-            m_bStatus = false;
-         }
-         m_pFile = NULL;
-      }
-      return m_bStatus;
-   }
-
-   virtual bool put_buf(const void* pBuf, int64_t len)
-   {
-      m_bStatus = m_bStatus && (fwrite(pBuf, len, 1, m_pFile) == 1);
-      return m_bStatus;
-   }
-
-   uint get_size() const
-   {
-      return m_pFile ? ftell(m_pFile) : 0;
-   }
-};
-
-// Writes JPEG image to file.
-bool compress_image_to_jpeg_file(const char *pFilename, int64_t width, int64_t height, int64_t num_channels, const uint8 *pImage_data, const params &comp_params)
-{
-  cfile_stream dst_stream;
-  if (!dst_stream.open(pFilename))
-    return false;
-
-  jpge::jpeg_encoder dst_image;
-  if (!dst_image.init(&dst_stream, width, height, num_channels, comp_params))
-    return false;
-
-  for (uint pass_index = 0; pass_index < dst_image.get_total_passes(); pass_index++)
-  {
-    for (int64_t i = 0; i < height; i++)
-    {
-		// i, width, and num_channels are all 64bit
-       const uint8* pBuf = pImage_data + i * width * num_channels;
-       if (!dst_image.process_scanline(pBuf))
-          return false;
-    }
-    if (!dst_image.process_scanline(NULL))
-       return false;
-  }
-
-  dst_image.deinit();
-
-  return dst_stream.close();
-}
-
-class memory_stream : public output_stream
-{
-   memory_stream(const memory_stream &);
-   memory_stream &operator= (const memory_stream &);
-
-   uint8 *m_pBuf;
-   uint64_t m_buf_size, m_buf_ofs;
-
-public:
-   memory_stream(void *pBuf, uint64_t buf_size) : m_pBuf(static_cast<uint8*>(pBuf)), m_buf_size(buf_size), m_buf_ofs(0) { }
-
-   virtual ~memory_stream() { }
-
-   virtual bool put_buf(const void* pBuf, int64_t len)
-   {
-      uint64_t buf_remaining = m_buf_size - m_buf_ofs;
-      if ((uint64_t)len > buf_remaining)
-         return false;
-      memcpy(m_pBuf + m_buf_ofs, pBuf, len);
-      m_buf_ofs += len;
-      return true;
-   }
-
-   uint64_t get_size() const
-   {
-      return m_buf_ofs;
-   }
-};
-
-bool compress_image_to_jpeg_file_in_memory(void *pDstBuf, int64_t &buf_size, int64_t width, int64_t height, int64_t num_channels, const uint8 *pImage_data, const params &comp_params)
-{
-   if ((!pDstBuf) || (!buf_size))
-      return false;
-
-   memory_stream dst_stream(pDstBuf, buf_size);
-
-   buf_size = 0;
-
-   jpge::jpeg_encoder dst_image;
-   if (!dst_image.init(&dst_stream, width, height, num_channels, comp_params))
-      return false;
-
-   for (uint pass_index = 0; pass_index < dst_image.get_total_passes(); pass_index++)
-   {
-     for (int64_t i = 0; i < height; i++)
-     {
-        const uint8* pScanline = pImage_data + i * width * num_channels;
-        if (!dst_image.process_scanline(pScanline))
-           return false;
-     }
-     if (!dst_image.process_scanline(NULL))
-        return false;
-   }
-
-   dst_image.deinit();
-
-   buf_size = dst_stream.get_size();
-   return true;
-}
-
-} // namespace jpge

crazy_functions/test_project/cpp/longcode/prod_cons.h

@@ -1,433 +0,0 @@
-#pragma once
-
-#include <atomic>
-#include <utility>
-#include <cstring>
-#include <type_traits>
-#include <cstdint>
-
-#include "libipc/def.h"
-
-#include "libipc/platform/detail.h"
-#include "libipc/circ/elem_def.h"
-#include "libipc/utility/log.h"
-#include "libipc/utility/utility.h"
-
-namespace ipc {
-
-////////////////////////////////////////////////////////////////
-/// producer-consumer implementation
-////////////////////////////////////////////////////////////////
-
-template <typename Flag>
-struct prod_cons_impl;
-
-template <>
-struct prod_cons_impl<wr<relat::single, relat::single, trans::unicast>> {
-
-    template <std::size_t DataSize, std::size_t AlignSize>
-    struct elem_t {
-        std::aligned_storage_t<DataSize, AlignSize> data_ {};
-    };
-
-    alignas(cache_line_size) std::atomic<circ::u2_t> rd_; // read index
-    alignas(cache_line_size) std::atomic<circ::u2_t> wt_; // write index
-
-    constexpr circ::u2_t cursor() const noexcept {
-        return 0;
-    }
-
-    template <typename W, typename F, typename E>
-    bool push(W* /*wrapper*/, F&& f, E* elems) {
-        auto cur_wt = circ::index_of(wt_.load(std::memory_order_relaxed));
-        if (cur_wt == circ::index_of(rd_.load(std::memory_order_acquire) - 1)) {
-            return false; // full
-        }
-        std::forward<F>(f)(&(elems[cur_wt].data_));
-        wt_.fetch_add(1, std::memory_order_release);
-        return true;
-    }
-
-    /**
-     * In single-single-unicast, 'force_push' means 'no reader' or 'the only one reader is dead'.
-     * So we could just disconnect all connections of receiver, and return false.
-    */
-    template <typename W, typename F, typename E>
-    bool force_push(W* wrapper, F&&, E*) {
-        wrapper->elems()->disconnect_receiver(~static_cast<circ::cc_t>(0u));
-        return false;
-    }
-
-    template <typename W, typename F, typename R, typename E>
-    bool pop(W* /*wrapper*/, circ::u2_t& /*cur*/, F&& f, R&& out, E* elems) {
-        auto cur_rd = circ::index_of(rd_.load(std::memory_order_relaxed));
-        if (cur_rd == circ::index_of(wt_.load(std::memory_order_acquire))) {
-            return false; // empty
-        }
-        std::forward<F>(f)(&(elems[cur_rd].data_));
-        std::forward<R>(out)(true);
-        rd_.fetch_add(1, std::memory_order_release);
-        return true;
-    }
-};
-
-template <>
-struct prod_cons_impl<wr<relat::single, relat::multi , trans::unicast>>
-     : prod_cons_impl<wr<relat::single, relat::single, trans::unicast>> {
-
-    template <typename W, typename F, typename E>
-    bool force_push(W* wrapper, F&&, E*) {
-        wrapper->elems()->disconnect_receiver(1);
-        return false;
-    }
-
-    template <typename W, typename F, typename R, 
-              template <std::size_t, std::size_t> class E, std::size_t DS, std::size_t AS>
-    bool pop(W* /*wrapper*/, circ::u2_t& /*cur*/, F&& f, R&& out, E<DS, AS>* elems) {
-        byte_t buff[DS];
-        for (unsigned k = 0;;) {
-            auto cur_rd = rd_.load(std::memory_order_relaxed);
-            if (circ::index_of(cur_rd) ==
-                circ::index_of(wt_.load(std::memory_order_acquire))) {
-                return false; // empty
-            }
-            std::memcpy(buff, &(elems[circ::index_of(cur_rd)].data_), sizeof(buff));
-            if (rd_.compare_exchange_weak(cur_rd, cur_rd + 1, std::memory_order_release)) {
-                std::forward<F>(f)(buff);
-                std::forward<R>(out)(true);
-                return true;
-            }
-            ipc::yield(k);
-        }
-    }
-};
-
-template <>
-struct prod_cons_impl<wr<relat::multi , relat::multi, trans::unicast>>
-     : prod_cons_impl<wr<relat::single, relat::multi, trans::unicast>> {
-
-    using flag_t = std::uint64_t;
-
-    template <std::size_t DataSize, std::size_t AlignSize>
-    struct elem_t {
-        std::aligned_storage_t<DataSize, AlignSize> data_ {};
-        std::atomic<flag_t> f_ct_ { 0 }; // commit flag
-    };
-
-    alignas(cache_line_size) std::atomic<circ::u2_t> ct_; // commit index
-
-    template <typename W, typename F, typename E>
-    bool push(W* /*wrapper*/, F&& f, E* elems) {
-        circ::u2_t cur_ct, nxt_ct;
-        for (unsigned k = 0;;) {
-            cur_ct = ct_.load(std::memory_order_relaxed);
-            if (circ::index_of(nxt_ct = cur_ct + 1) ==
-                circ::index_of(rd_.load(std::memory_order_acquire))) {
-                return false; // full
-            }
-            if (ct_.compare_exchange_weak(cur_ct, nxt_ct, std::memory_order_acq_rel)) {
-                break;
-            }
-            ipc::yield(k);
-        }
-        auto* el = elems + circ::index_of(cur_ct);
-        std::forward<F>(f)(&(el->data_));
-        // set flag & try update wt
-        el->f_ct_.store(~static_cast<flag_t>(cur_ct), std::memory_order_release);
-        while (1) {
-            auto cac_ct = el->f_ct_.load(std::memory_order_acquire);
-            if (cur_ct != wt_.load(std::memory_order_relaxed)) {
-                return true;
-            }
-            if ((~cac_ct) != cur_ct) {
-                return true;
-            }
-            if (!el->f_ct_.compare_exchange_strong(cac_ct, 0, std::memory_order_relaxed)) {
-                return true;
-            }
-            wt_.store(nxt_ct, std::memory_order_release);
-            cur_ct = nxt_ct;
-            nxt_ct = cur_ct + 1;
-            el = elems + circ::index_of(cur_ct);
-        }
-        return true;
-    }
-
-    template <typename W, typename F, typename E>
-    bool force_push(W* wrapper, F&&, E*) {
-        wrapper->elems()->disconnect_receiver(1);
-        return false;
-    }
-
-    template <typename W, typename F, typename R, 
-              template <std::size_t, std::size_t> class E, std::size_t DS, std::size_t AS>
-    bool pop(W* /*wrapper*/, circ::u2_t& /*cur*/, F&& f, R&& out, E<DS, AS>* elems) {
-        byte_t buff[DS];
-        for (unsigned k = 0;;) {
-            auto cur_rd = rd_.load(std::memory_order_relaxed);
-            auto cur_wt = wt_.load(std::memory_order_acquire);
-            auto id_rd  = circ::index_of(cur_rd);
-            auto id_wt  = circ::index_of(cur_wt);
-            if (id_rd == id_wt) {
-                auto* el = elems + id_wt;
-                auto cac_ct = el->f_ct_.load(std::memory_order_acquire);
-                if ((~cac_ct) != cur_wt) {
-                    return false; // empty
-                }
-                if (el->f_ct_.compare_exchange_weak(cac_ct, 0, std::memory_order_relaxed)) {
-                    wt_.store(cur_wt + 1, std::memory_order_release);
-                }
-                k = 0;
-            }
-            else {
-                std::memcpy(buff, &(elems[circ::index_of(cur_rd)].data_), sizeof(buff));
-                if (rd_.compare_exchange_weak(cur_rd, cur_rd + 1, std::memory_order_release)) {
-                    std::forward<F>(f)(buff);
-                    std::forward<R>(out)(true);
-                    return true;
-                }
-                ipc::yield(k);
-            }
-        }
-    }
-};
-
-template <>
-struct prod_cons_impl<wr<relat::single, relat::multi, trans::broadcast>> {
-
-    using rc_t = std::uint64_t;
-
-    enum : rc_t {
-        ep_mask = 0x00000000ffffffffull,
-        ep_incr = 0x0000000100000000ull
-    };
-
-    template <std::size_t DataSize, std::size_t AlignSize>
-    struct elem_t {
-        std::aligned_storage_t<DataSize, AlignSize> data_ {};
-        std::atomic<rc_t> rc_ { 0 }; // read-counter
-    };
-
-    alignas(cache_line_size) std::atomic<circ::u2_t> wt_;   // write index
-    alignas(cache_line_size) rc_t epoch_ { 0 };             // only one writer
-
-    circ::u2_t cursor() const noexcept {
-        return wt_.load(std::memory_order_acquire);
-    }
-
-    template <typename W, typename F, typename E>
-    bool push(W* wrapper, F&& f, E* elems) {
-        E* el;
-        for (unsigned k = 0;;) {
-            circ::cc_t cc = wrapper->elems()->connections(std::memory_order_relaxed);
-            if (cc == 0) return false; // no reader
-            el = elems + circ::index_of(wt_.load(std::memory_order_relaxed));
-            // check all consumers have finished reading this element
-            auto cur_rc = el->rc_.load(std::memory_order_acquire);
-            circ::cc_t rem_cc = cur_rc & ep_mask;
-            if ((cc & rem_cc) && ((cur_rc & ~ep_mask) == epoch_)) {
-                return false; // has not finished yet
-            }
-            // consider rem_cc to be 0 here
-            if (el->rc_.compare_exchange_weak(
-                        cur_rc, epoch_ | static_cast<rc_t>(cc), std::memory_order_release)) {
-                break;
-            }
-            ipc::yield(k);
-        }
-        std::forward<F>(f)(&(el->data_));
-        wt_.fetch_add(1, std::memory_order_release);
-        return true;
-    }
-
-    template <typename W, typename F, typename E>
-    bool force_push(W* wrapper, F&& f, E* elems) {
-        E* el;
-        epoch_ += ep_incr;
-        for (unsigned k = 0;;) {
-            circ::cc_t cc = wrapper->elems()->connections(std::memory_order_relaxed);
-            if (cc == 0) return false; // no reader
-            el = elems + circ::index_of(wt_.load(std::memory_order_relaxed));
-            // check all consumers have finished reading this element
-            auto cur_rc = el->rc_.load(std::memory_order_acquire);
-            circ::cc_t rem_cc = cur_rc & ep_mask;
-            if (cc & rem_cc) {
-                ipc::log("force_push: k = %u, cc = %u, rem_cc = %u\n", k, cc, rem_cc);
-                cc = wrapper->elems()->disconnect_receiver(rem_cc); // disconnect all invalid readers
-                if (cc == 0) return false; // no reader
-            }
-            // just compare & exchange
-            if (el->rc_.compare_exchange_weak(
-                        cur_rc, epoch_ | static_cast<rc_t>(cc), std::memory_order_release)) {
-                break;
-            }
-            ipc::yield(k);
-        }
-        std::forward<F>(f)(&(el->data_));
-        wt_.fetch_add(1, std::memory_order_release);
-        return true;
-    }
-
-    template <typename W, typename F, typename R, typename E>
-    bool pop(W* wrapper, circ::u2_t& cur, F&& f, R&& out, E* elems) {
-        if (cur == cursor()) return false; // acquire
-        auto* el = elems + circ::index_of(cur++);
-        std::forward<F>(f)(&(el->data_));
-        for (unsigned k = 0;;) {
-            auto cur_rc = el->rc_.load(std::memory_order_acquire);
-            if ((cur_rc & ep_mask) == 0) {
-                std::forward<R>(out)(true);
-                return true;
-            }
-            auto nxt_rc = cur_rc & ~static_cast<rc_t>(wrapper->connected_id());
-            if (el->rc_.compare_exchange_weak(cur_rc, nxt_rc, std::memory_order_release)) {
-                std::forward<R>(out)((nxt_rc & ep_mask) == 0);
-                return true;
-            }
-            ipc::yield(k);
-        }
-    }
-};
-
-template <>
-struct prod_cons_impl<wr<relat::multi, relat::multi, trans::broadcast>> {
-
-    using rc_t   = std::uint64_t;
-    using flag_t = std::uint64_t;
-
-    enum : rc_t {
-        rc_mask = 0x00000000ffffffffull,
-        ep_mask = 0x00ffffffffffffffull,
-        ep_incr = 0x0100000000000000ull,
-        ic_mask = 0xff000000ffffffffull,
-        ic_incr = 0x0000000100000000ull
-    };
-
-    template <std::size_t DataSize, std::size_t AlignSize>
-    struct elem_t {
-        std::aligned_storage_t<DataSize, AlignSize> data_ {};
-        std::atomic<rc_t  > rc_   { 0 }; // read-counter
-        std::atomic<flag_t> f_ct_ { 0 }; // commit flag
-    };
-
-    alignas(cache_line_size) std::atomic<circ::u2_t> ct_;   // commit index
-    alignas(cache_line_size) std::atomic<rc_t> epoch_ { 0 };
-
-    circ::u2_t cursor() const noexcept {
-        return ct_.load(std::memory_order_acquire);
-    }
-
-    constexpr static rc_t inc_rc(rc_t rc) noexcept {
-        return (rc & ic_mask) | ((rc + ic_incr) & ~ic_mask);
-    }
-
-    constexpr static rc_t inc_mask(rc_t rc) noexcept {
-        return inc_rc(rc) & ~rc_mask;
-    }
-
-    template <typename W, typename F, typename E>
-    bool push(W* wrapper, F&& f, E* elems) {
-        E* el;
-        circ::u2_t cur_ct;
-        rc_t epoch = epoch_.load(std::memory_order_acquire);
-        for (unsigned k = 0;;) {
-            circ::cc_t cc = wrapper->elems()->connections(std::memory_order_relaxed);
-            if (cc == 0) return false; // no reader
-            el = elems + circ::index_of(cur_ct = ct_.load(std::memory_order_relaxed));
-            // check all consumers have finished reading this element
-            auto cur_rc = el->rc_.load(std::memory_order_relaxed);
-            circ::cc_t rem_cc = cur_rc & rc_mask;
-            if ((cc & rem_cc) && ((cur_rc & ~ep_mask) == epoch)) {
-                return false; // has not finished yet
-            }
-            else if (!rem_cc) {
-                auto cur_fl = el->f_ct_.load(std::memory_order_acquire);
-                if ((cur_fl != cur_ct) && cur_fl) {
-                    return false; // full
-                }
-            }
-            // consider rem_cc to be 0 here
-            if (el->rc_.compare_exchange_weak(
-                        cur_rc, inc_mask(epoch | (cur_rc & ep_mask)) | static_cast<rc_t>(cc), std::memory_order_relaxed) &&
-                epoch_.compare_exchange_weak(epoch, epoch, std::memory_order_acq_rel)) {
-                break;
-            }
-            ipc::yield(k);
-        }
-        // only one thread/process would touch here at one time
-        ct_.store(cur_ct + 1, std::memory_order_release);
-        std::forward<F>(f)(&(el->data_));
-        // set flag & try update wt
-        el->f_ct_.store(~static_cast<flag_t>(cur_ct), std::memory_order_release);
-        return true;
-    }
-
-    template <typename W, typename F, typename E>
-    bool force_push(W* wrapper, F&& f, E* elems) {
-        E* el;
-        circ::u2_t cur_ct;
-        rc_t epoch = epoch_.fetch_add(ep_incr, std::memory_order_release) + ep_incr;
-        for (unsigned k = 0;;) {
-            circ::cc_t cc = wrapper->elems()->connections(std::memory_order_relaxed);
-            if (cc == 0) return false; // no reader
-            el = elems + circ::index_of(cur_ct = ct_.load(std::memory_order_relaxed));
-            // check all consumers have finished reading this element
-            auto cur_rc = el->rc_.load(std::memory_order_acquire);
-            circ::cc_t rem_cc = cur_rc & rc_mask;
-            if (cc & rem_cc) {
-                ipc::log("force_push: k = %u, cc = %u, rem_cc = %u\n", k, cc, rem_cc);
-                cc = wrapper->elems()->disconnect_receiver(rem_cc); // disconnect all invalid readers
-                if (cc == 0) return false; // no reader
-            }
-            // just compare & exchange
-            if (el->rc_.compare_exchange_weak(
-                        cur_rc, inc_mask(epoch | (cur_rc & ep_mask)) | static_cast<rc_t>(cc), std::memory_order_relaxed)) {
-                if (epoch == epoch_.load(std::memory_order_acquire)) {
-                    break;
-                }
-                else if (push(wrapper, std::forward<F>(f), elems)) {
-                    return true;
-                }
-                epoch = epoch_.fetch_add(ep_incr, std::memory_order_release) + ep_incr;
-            }
-            ipc::yield(k);
-        }
-        // only one thread/process would touch here at one time
-        ct_.store(cur_ct + 1, std::memory_order_release);
-        std::forward<F>(f)(&(el->data_));
-        // set flag & try update wt
-        el->f_ct_.store(~static_cast<flag_t>(cur_ct), std::memory_order_release);
-        return true;
-    }
-
-    template <typename W, typename F, typename R, typename E, std::size_t N>
-    bool pop(W* wrapper, circ::u2_t& cur, F&& f, R&& out, E(& elems)[N]) {
-        auto* el = elems + circ::index_of(cur);
-        auto cur_fl = el->f_ct_.load(std::memory_order_acquire);
-        if (cur_fl != ~static_cast<flag_t>(cur)) {
-            return false; // empty
-        }
-        ++cur;
-        std::forward<F>(f)(&(el->data_));
-        for (unsigned k = 0;;) {
-            auto cur_rc = el->rc_.load(std::memory_order_acquire);
-            if ((cur_rc & rc_mask) == 0) {
-                std::forward<R>(out)(true);
-                el->f_ct_.store(cur + N - 1, std::memory_order_release);
-                return true;
-            }
-            auto nxt_rc = inc_rc(cur_rc) & ~static_cast<rc_t>(wrapper->connected_id());
-            bool last_one = false;
-            if ((last_one = (nxt_rc & rc_mask) == 0)) {
-                el->f_ct_.store(cur + N - 1, std::memory_order_release);
-            }
-            if (el->rc_.compare_exchange_weak(cur_rc, nxt_rc, std::memory_order_release)) {
-                std::forward<R>(out)(last_one);
-                return true;
-            }
-            ipc::yield(k);
-        }
-    }
-};
-
-} // namespace ipc

crazy_functions/test_project/latex/attention/background.tex

@@ -1,58 +0,0 @@
-The goal of reducing sequential computation also forms the foundation of the Extended Neural GPU \citep{extendedngpu}, ByteNet \citep{NalBytenet2017} and ConvS2S \citep{JonasFaceNet2017}, all of which use convolutional neural networks as basic building block, computing hidden representations in parallel for all input and output positions. In these models, the number of operations required to relate signals from two arbitrary input or output positions grows in the distance between positions, linearly for ConvS2S and logarithmically for ByteNet. This makes it more difficult to learn dependencies between distant positions \citep{hochreiter2001gradient}. In the Transformer this is reduced to a constant number of operations, albeit at the cost of reduced effective resolution due to averaging attention-weighted positions, an effect we counteract with Multi-Head Attention as described in section~\ref{sec:attention}. 
-
-Self-attention, sometimes called intra-attention is an attention mechanism relating different positions of a single sequence in order to compute a representation of the sequence. Self-attention has been used successfully in a variety of tasks including reading comprehension, abstractive summarization, textual entailment and learning task-independent sentence representations \citep{cheng2016long, decomposableAttnModel, paulus2017deep, lin2017structured}.
-
-End-to-end memory networks are based on a recurrent attention mechanism instead of sequence-aligned recurrence and have been shown to perform well on simple-language question answering and language modeling tasks \citep{sukhbaatar2015}.
-
-To the best of our knowledge, however, the Transformer is the first transduction model relying entirely on self-attention to compute representations of its input and output without using sequence-aligned RNNs or convolution.
-In the following sections, we will describe the Transformer, motivate self-attention and discuss its advantages over models such as \citep{neural_gpu, NalBytenet2017} and \citep{JonasFaceNet2017}.
-
-
-%\citep{JonasFaceNet2017} report new SOTA on machine translation for English-to-German (EnDe), Enlish-to-French (EnFr) and English-to-Romanian language pairs. 
-
-%For example,! in MT, we must draw information from both input and previous output words to translate an output word accurately. An attention layer \citep{bahdanau2014neural} can connect a very large number of positions at low computation cost, making it an essential ingredient in competitive recurrent models for machine translation.
-
-%A natural question to ask then is, "Could we replace recurrence with attention?". \marginpar{Don't know if it's the most natural question to ask given the previous statements. Also, need to say that the complexity table summarizes these statements} Such a model would be blessed with the computational efficiency of attention and the power of cross-positional communication. In this work, show that pure attention models work remarkably well for MT, achieving new SOTA results on EnDe and EnFr, and can be trained in under $2$ days on xyz architecture. 
-
-%After the seminal models introduced in \citep{sutskever14, bahdanau2014neural, cho2014learning}, recurrent models have become the dominant solution for both sequence modeling and sequence-to-sequence transduction. Many efforts such as \citep{wu2016google,luong2015effective,jozefowicz2016exploring} have pushed the boundaries of machine translation (MT) and language modeling with recurrent endoder-decoder and recurrent language models. Recent effort \citep{shazeer2017outrageously} has successfully combined the power of conditional computation with sequence models to train very large models for MT, pushing SOTA at lower computational cost.
-
-%Recurrent models compute a vector of hidden states $h_t$, for each time step $t$ of computation. $h_t$ is a function of both the input at time $t$ and the previous hidden state $h_t$. This dependence on the previous hidden state precludes processing all timesteps at once, instead requiring long sequences of sequential operations.  In practice, this results in greatly reduced computational efficiency, as on modern computing hardware, a single operation on a large batch is much faster than a large number of operations on small batches.  The problem gets worse at longer sequence lengths. Although sequential computation is not a severe bottleneck at inference time, as autoregressively generating each output requires all previous outputs, the inability to compute scores at all output positions at once hinders us from rapidly training our models over large datasets. Although impressive work such as \citep{Kuchaiev2017Factorization} is able to significantly accelerate the training of LSTMs with factorization tricks, we are still bound by the linear dependence on sequence length.
-
-%If the model could compute hidden states at each time step using only the inputs and outputs,  it would be liberated from the dependence on results from previous time steps during training. This line of thought is the foundation of recent efforts such as the Markovian neural GPU \citep{neural_gpu}, ByteNet \citep{NalBytenet2017} and ConvS2S \citep{JonasFaceNet2017}, all of which use convolutional neural networks as a building block to compute hidden representations simultaneously for all timesteps, resulting in $O(1)$ sequential time complexity. \citep{JonasFaceNet2017} report new SOTA on machine translation for English-to-German (EnDe), Enlish-to-French (EnFr) and English-to-Romanian language pairs. 
-
-%A crucial component for accurate sequence prediction is modeling cross-positional communication. For example, in MT, we must draw information from both input and previous output words to translate an output word accurately. An attention layer \citep{bahdanau2014neural} can connect a very large number of positions at a low computation cost, also $O(1)$ sequential time complexity, making it an essential ingredient in recurrent encoder-decoder architectures for MT. A natural question to ask then is, "Could we replace recurrence with attention?". \marginpar{Don't know if it's the most natural question to ask given the previous statements. Also, need to say that the complexity table summarizes these statements} Such a model would be blessed with the computational efficiency of attention and the power of cross-positional communication. In this work, show that pure attention models work remarkably well for MT, achieving new SOTA results on EnDe and EnFr, and can be trained in under $2$ days on xyz architecture. 
-
-
-
-%Note: Facebook model is no better than RNNs in this regard, since it requires a number of layers proportional to the distance you want to communicate.  Bytenet is more promising, since it requires a logarithmnic number of layers (does bytenet have SOTA results)?   
-
-%Note: An attention  layer can connect a very large number of positions at a low computation cost in O(1) sequential operations.  This is why encoder-decoder attention has been so successful in seq-to-seq models so far.  It is only natural, then, to also use attention to connect the timesteps of the same sequence.
-
-%Note: I wouldn't say that long sequences are not a problem during inference.  It would be great if we could infer with no long sequences.  We could just say later on that, while our training graph is constant-depth, our model still requires sequential operations in the decoder part during inference due to the autoregressive nature of the model.   
-
-%\begin{table}[h!]
-%\caption{Attention models are quite efficient for cross-positional communications when sequence length is smaller than channel depth. $n$ represents the sequence length and $d$ represents the channel depth.}
-%\label{tab:op_complexities}
-%\begin{center}
-%\vspace{-5pt}
-%\scalebox{0.75}{
-
-%\begin{tabular}{l|c|c|c}
-%\hline \hline
-%Layer Type & Receptive & Complexity & Sequential  \\
-%           & Field     &            & Operations  \\
-%\hline
-%Pointwise Feed-Forward & $1$ & $O(n \cdot d^2)$ & $O(1)$ \\
-%\hline
-%Recurrent & $n$ & $O(n \cdot d^2)$ & $O(n)$ \\
-%\hline
-%Convolutional & $r$ & $O(r \cdot n \cdot d^2)$ & $O(1)$ \\
-%\hline
-%Convolutional (separable) & $r$ & $O(r \cdot n \cdot d + n %\cdot d^2)$ & $O(1)$ \\
-%\hline
-%Attention & $r$ & $O(r \cdot n \cdot d)$ & $O(1)$ \\
-%\hline \hline
-%\end{tabular}
-%}
-%\end{center}
-%\end{table}

crazy_functions/test_project/latex/attention/introduction.tex

@@ -1,18 +0,0 @@
-Recurrent neural networks, long short-term memory \citep{hochreiter1997} and gated recurrent \citep{gruEval14} neural networks in particular, have been firmly established as state of the art approaches in sequence modeling and transduction problems such as language modeling and machine translation \citep{sutskever14, bahdanau2014neural, cho2014learning}. Numerous efforts have since continued to push the boundaries of recurrent language models and encoder-decoder architectures \citep{wu2016google,luong2015effective,jozefowicz2016exploring}.
-
-Recurrent models typically factor computation along the symbol positions of the input and output sequences. Aligning the positions to steps in computation time, they generate a sequence of hidden states $h_t$, as a function of the previous hidden state $h_{t-1}$ and the input for position $t$. This inherently sequential nature precludes parallelization within training examples, which becomes critical at longer sequence lengths, as memory constraints limit batching across examples.
-%\marginpar{not sure if the memory constraints are understandable here}
-Recent work has achieved significant improvements in computational efficiency through factorization tricks \citep{Kuchaiev2017Factorization} and conditional computation \citep{shazeer2017outrageously}, while also improving model performance in case of the latter. The fundamental constraint of sequential computation, however, remains.
-
-%\marginpar{@all: there is work on analyzing what attention really does in seq2seq models, couldn't find it right away} 
-
-Attention mechanisms have become an integral part of compelling sequence modeling and transduction models in various tasks, allowing modeling of dependencies without regard to their distance in the input or output sequences \citep{bahdanau2014neural, structuredAttentionNetworks}. In all but a few cases \citep{decomposableAttnModel}, however, such attention mechanisms are used in conjunction with a recurrent network.
-
-%\marginpar{not sure if "cross-positional communication" is understandable without explanation}
-%\marginpar{insert exact training times and stats for the model that reaches sota earliest, maybe even a single GPU model?}
-
-In this work we propose the Transformer, a model architecture eschewing recurrence and instead relying entirely on an attention mechanism to draw global dependencies between input and output. The Transformer allows for significantly more parallelization and can reach a new state of the art in translation quality after being trained for as little as twelve hours on eight P100 GPUs. 
-%\marginpar{you removed the constant number of repetitions part. I wrote it because I wanted to make it clear that the model does not only perform attention once, while it's also not recurrent. I thought that might be important to get across early.}
-
-% Just a standard paragraph with citations, rewrite.
-%After the seminal papers of \citep{sutskever14}, \citep{bahdanau2014neural}, and \citep{cho2014learning}, recurrent models have become the dominant solution for both sequence modeling and sequence-to-sequence transduction. Many efforts such as \citep{wu2016google,luong2015effective,jozefowicz2016exploring} have pushed the boundaries of machine translation and language modeling with recurrent sequence models. Recent effort \citep{shazeer2017outrageously} has combined the power of conditional computation with sequence models to train very large models for machine translation, pushing SOTA at lower computational cost. Recurrent models compute a vector of hidden states $h_t$, for each time step $t$ of computation. $h_t$ is a function of both the input at time $t$ and the previous hidden state $h_t$. This dependence on the previous hidden state encumbers recurrnet models to process multiple inputs at once, and their time complexity is a linear function of the length of the input and output, both during training and inference. [What I want to say here is that although this is fine during decoding, at training time, we are given both input and output and this linear nature does not allow the RNN to process all inputs and outputs simultaneously and haven't been used on datasets that are the of the scale of the web. What's the largest dataset we have ? . Talk about Nividia and possibly other's effors to speed up things, and possibly other efforts that alleviate this, but are still limited by it's comptuational nature]. Rest of the intro: What if you could construct the state based on the actual inputs and outputs, then you could construct them all at once. This has been the foundation of many promising recent efforts, bytenet,facenet (Also talk about quasi rnn here). Now we talk about attention!! Along with cell architectures such as long short-term meory (LSTM) \citep{hochreiter1997}, and gated recurrent units (GRUs) \citep{cho2014learning}, attention has emerged as an essential ingredient in successful sequence models, in particular for machine translation. In recent years, many, if not all, state-of-the-art (SOTA) results in machine translation have been achieved with attention-based sequence models \citep{wu2016google,luong2015effective,jozefowicz2016exploring}. Talk about the neon work on how it played with attention to do self attention! Then talk about what we do.