armory-0.92.3/0000755000000000000000000000000012414772765011633 5ustar rootrootarmory-0.92.3/subprocess_win.py0000644000000000000000000016510312414772654015255 0ustar rootroot# subprocess - Subprocesses with accessible I/O streams # # For more information about this module, see PEP 324. # # This module should remain compatible with Python 2.2, see PEP 291. # # Copyright (c) 2003-2005 by Peter Astrand # # Licensed to PSF under a Contributor Agreement. # See http://www.python.org/2.4/license for licensing details. r"""subprocess - Subprocesses with accessible I/O streams This module allows you to spawn processes, connect to their input/output/error pipes, and obtain their return codes. This module intends to replace several other, older modules and functions, like: os.system os.spawn* os.popen* popen2.* commands.* Information about how the subprocess module can be used to replace these modules and functions can be found below. Using the subprocess module =========================== This module defines one class called Popen: class Popen(args, bufsize=0, executable=None, stdin=None, stdout=None, stderr=None, preexec_fn=None, close_fds=False, shell=False, cwd=None, env=None, universal_newlines=False, startupinfo=None, creationflags=0): Arguments are: args should be a string, or a sequence of program arguments. The program to execute is normally the first item in the args sequence or string, but can be explicitly set by using the executable argument. On UNIX, with shell=False (default): In this case, the Popen class uses os.execvp() to execute the child program. args should normally be a sequence. A string will be treated as a sequence with the string as the only item (the program to execute). On UNIX, with shell=True: If args is a string, it specifies the command string to execute through the shell. If args is a sequence, the first item specifies the command string, and any additional items will be treated as additional shell arguments. On Windows: the Popen class uses CreateProcess() to execute the child program, which operates on strings. If args is a sequence, it will be converted to a string using the list2cmdline method. Please note that not all MS Windows applications interpret the command line the same way: The list2cmdline is designed for applications using the same rules as the MS C runtime. bufsize, if given, has the same meaning as the corresponding argument to the built-in open() function: 0 means unbuffered, 1 means line buffered, any other positive value means use a buffer of (approximately) that size. A negative bufsize means to use the system default, which usually means fully buffered. The default value for bufsize is 0 (unbuffered). stdin, stdout and stderr specify the executed programs' standard input, standard output and standard error file handles, respectively. Valid values are PIPE, an existing file descriptor (a positive integer), an existing file object, and None. PIPE indicates that a new pipe to the child should be created. With None, no redirection will occur; the child's file handles will be inherited from the parent. Additionally, stderr can be STDOUT, which indicates that the stderr data from the applications should be captured into the same file handle as for stdout. If preexec_fn is set to a callable object, this object will be called in the child process just before the child is executed. If close_fds is true, all file descriptors except 0, 1 and 2 will be closed before the child process is executed. if shell is true, the specified command will be executed through the shell. If cwd is not None, the current directory will be changed to cwd before the child is executed. If env is not None, it defines the environment variables for the new process. If universal_newlines is true, the file objects stdout and stderr are opened as a text files, but lines may be terminated by any of '\n', the Unix end-of-line convention, '\r', the Macintosh convention or '\r\n', the Windows convention. All of these external representations are seen as '\n' by the Python program. Note: This feature is only available if Python is built with universal newline support (the default). Also, the newlines attribute of the file objects stdout, stdin and stderr are not updated by the communicate() method. The startupinfo and creationflags, if given, will be passed to the underlying CreateProcess() function. They can specify things such as appearance of the main window and priority for the new process. (Windows only) This module also defines some shortcut functions: call(*popenargs, **kwargs): Run command with arguments. Wait for command to complete, then return the returncode attribute. The arguments are the same as for the Popen constructor. Example: retcode = call(["ls", "-l"]) check_call(*popenargs, **kwargs): Run command with arguments. Wait for command to complete. If the exit code was zero then return, otherwise raise CalledProcessError. The CalledProcessError object will have the return code in the returncode attribute. The arguments are the same as for the Popen constructor. Example: check_call(["ls", "-l"]) check_output(*popenargs, **kwargs): Run command with arguments and return its output as a byte string. If the exit code was non-zero it raises a CalledProcessError. The CalledProcessError object will have the return code in the returncode attribute and output in the output attribute. The arguments are the same as for the Popen constructor. Example: output = check_output(["ls", "-l", "/dev/null"]) Exceptions ---------- Exceptions raised in the child process, before the new program has started to execute, will be re-raised in the parent. Additionally, the exception object will have one extra attribute called 'child_traceback', which is a string containing traceback information from the childs point of view. The most common exception raised is OSError. This occurs, for example, when trying to execute a non-existent file. Applications should prepare for OSErrors. A ValueError will be raised if Popen is called with invalid arguments. check_call() and check_output() will raise CalledProcessError, if the called process returns a non-zero return code. Security -------- Unlike some other popen functions, this implementation will never call /bin/sh implicitly. This means that all characters, including shell metacharacters, can safely be passed to child processes. Popen objects ============= Instances of the Popen class have the following methods: poll() Check if child process has terminated. Returns returncode attribute. wait() Wait for child process to terminate. Returns returncode attribute. communicate(input=None) Interact with process: Send data to stdin. Read data from stdout and stderr, until end-of-file is reached. Wait for process to terminate. The optional input argument should be a string to be sent to the child process, or None, if no data should be sent to the child. communicate() returns a tuple (stdout, stderr). Note: The data read is buffered in memory, so do not use this method if the data size is large or unlimited. The following attributes are also available: stdin If the stdin argument is PIPE, this attribute is a file object that provides input to the child process. Otherwise, it is None. stdout If the stdout argument is PIPE, this attribute is a file object that provides output from the child process. Otherwise, it is None. stderr If the stderr argument is PIPE, this attribute is file object that provides error output from the child process. Otherwise, it is None. pid The process ID of the child process. returncode The child return code. A None value indicates that the process hasn't terminated yet. A negative value -N indicates that the child was terminated by signal N (UNIX only). Replacing older functions with the subprocess module ==================================================== In this section, "a ==> b" means that b can be used as a replacement for a. Note: All functions in this section fail (more or less) silently if the executed program cannot be found; this module raises an OSError exception. In the following examples, we assume that the subprocess module is imported with "from subprocess import *". Replacing /bin/sh shell backquote --------------------------------- output=`mycmd myarg` ==> output = Popen(["mycmd", "myarg"], stdout=PIPE).communicate()[0] Replacing shell pipe line ------------------------- output=`dmesg | grep hda` ==> p1 = Popen(["dmesg"], stdout=PIPE) p2 = Popen(["grep", "hda"], stdin=p1.stdout, stdout=PIPE) output = p2.communicate()[0] Replacing os.system() --------------------- sts = os.system("mycmd" + " myarg") ==> p = Popen("mycmd" + " myarg", shell=True) pid, sts = os.waitpid(p.pid, 0) Note: * Calling the program through the shell is usually not required. * It's easier to look at the returncode attribute than the exitstatus. A more real-world example would look like this: try: retcode = call("mycmd" + " myarg", shell=True) if retcode < 0: print >>sys.stderr, "Child was terminated by signal", -retcode else: print >>sys.stderr, "Child returned", retcode except OSError, e: print >>sys.stderr, "Execution failed:", e Replacing os.spawn* ------------------- P_NOWAIT example: pid = os.spawnlp(os.P_NOWAIT, "/bin/mycmd", "mycmd", "myarg") ==> pid = Popen(["/bin/mycmd", "myarg"]).pid P_WAIT example: retcode = os.spawnlp(os.P_WAIT, "/bin/mycmd", "mycmd", "myarg") ==> retcode = call(["/bin/mycmd", "myarg"]) Vector example: os.spawnvp(os.P_NOWAIT, path, args) ==> Popen([path] + args[1:]) Environment example: os.spawnlpe(os.P_NOWAIT, "/bin/mycmd", "mycmd", "myarg", env) ==> Popen(["/bin/mycmd", "myarg"], env={"PATH": "/usr/bin"}) Replacing os.popen* ------------------- pipe = os.popen("cmd", mode='r', bufsize) ==> pipe = Popen("cmd", shell=True, bufsize=bufsize, stdout=PIPE).stdout pipe = os.popen("cmd", mode='w', bufsize) ==> pipe = Popen("cmd", shell=True, bufsize=bufsize, stdin=PIPE).stdin (child_stdin, child_stdout) = os.popen2("cmd", mode, bufsize) ==> p = Popen("cmd", shell=True, bufsize=bufsize, stdin=PIPE, stdout=PIPE, close_fds=True) (child_stdin, child_stdout) = (p.stdin, p.stdout) (child_stdin, child_stdout, child_stderr) = os.popen3("cmd", mode, bufsize) ==> p = Popen("cmd", shell=True, bufsize=bufsize, stdin=PIPE, stdout=PIPE, stderr=PIPE, close_fds=True) (child_stdin, child_stdout, child_stderr) = (p.stdin, p.stdout, p.stderr) (child_stdin, child_stdout_and_stderr) = os.popen4("cmd", mode, bufsize) ==> p = Popen("cmd", shell=True, bufsize=bufsize, stdin=PIPE, stdout=PIPE, stderr=STDOUT, close_fds=True) (child_stdin, child_stdout_and_stderr) = (p.stdin, p.stdout) On Unix, os.popen2, os.popen3 and os.popen4 also accept a sequence as the command to execute, in which case arguments will be passed directly to the program without shell intervention. This usage can be replaced as follows: (child_stdin, child_stdout) = os.popen2(["/bin/ls", "-l"], mode, bufsize) ==> p = Popen(["/bin/ls", "-l"], bufsize=bufsize, stdin=PIPE, stdout=PIPE) (child_stdin, child_stdout) = (p.stdin, p.stdout) Return code handling translates as follows: pipe = os.popen("cmd", 'w') ... rc = pipe.close() if rc is not None and rc % 256: print "There were some errors" ==> process = Popen("cmd", 'w', shell=True, stdin=PIPE) ... process.stdin.close() if process.wait() != 0: print "There were some errors" Replacing popen2.* ------------------ (child_stdout, child_stdin) = popen2.popen2("somestring", bufsize, mode) ==> p = Popen(["somestring"], shell=True, bufsize=bufsize stdin=PIPE, stdout=PIPE, close_fds=True) (child_stdout, child_stdin) = (p.stdout, p.stdin) On Unix, popen2 also accepts a sequence as the command to execute, in which case arguments will be passed directly to the program without shell intervention. This usage can be replaced as follows: (child_stdout, child_stdin) = popen2.popen2(["mycmd", "myarg"], bufsize, mode) ==> p = Popen(["mycmd", "myarg"], bufsize=bufsize, stdin=PIPE, stdout=PIPE, close_fds=True) (child_stdout, child_stdin) = (p.stdout, p.stdin) The popen2.Popen3 and popen2.Popen4 basically works as subprocess.Popen, except that: * subprocess.Popen raises an exception if the execution fails * the capturestderr argument is replaced with the stderr argument. * stdin=PIPE and stdout=PIPE must be specified. * popen2 closes all filedescriptors by default, but you have to specify close_fds=True with subprocess.Popen. """ import sys mswindows = (sys.platform == "win32") import os import types import traceback import gc import signal import errno import ctypes # Exception classes used by this module. class CalledProcessError(Exception): """This exception is raised when a process run by check_call() or check_output() returns a non-zero exit status. The exit status will be stored in the returncode attribute; check_output() will also store the output in the output attribute. """ def __init__(self, returncode, cmd, output=None): self.returncode = returncode self.cmd = cmd self.output = output def __str__(self): return "Command '%s' returned non-zero exit status %d" % (self.cmd, self.returncode) if mswindows: import threading import msvcrt import _subprocess class STARTUPINFO: dwFlags = 0 hStdInput = None hStdOutput = None hStdError = None wShowWindow = 0 class pywintypes: error = IOError else: import select _has_poll = hasattr(select, 'poll') import fcntl import pickle # When select or poll has indicated that the file is writable, # we can write up to _PIPE_BUF bytes without risk of blocking. # POSIX defines PIPE_BUF as >= 512. _PIPE_BUF = getattr(select, 'PIPE_BUF', 512) __all__ = ["Popen", "PIPE", "STDOUT", "call", "check_call", "check_output", "CalledProcessError"] if mswindows: from _subprocess import (CREATE_NEW_CONSOLE, CREATE_NEW_PROCESS_GROUP, STD_INPUT_HANDLE, STD_OUTPUT_HANDLE, STD_ERROR_HANDLE, SW_HIDE, STARTF_USESTDHANDLES, STARTF_USESHOWWINDOW) __all__.extend(["CREATE_NEW_CONSOLE", "CREATE_NEW_PROCESS_GROUP", "STD_INPUT_HANDLE", "STD_OUTPUT_HANDLE", "STD_ERROR_HANDLE", "SW_HIDE", "STARTF_USESTDHANDLES", "STARTF_USESHOWWINDOW"]) try: MAXFD = os.sysconf("SC_OPEN_MAX") except: MAXFD = 256 _active = [] def _cleanup(): for inst in _active[:]: res = inst._internal_poll(_deadstate=sys.maxint) if mswindows: if inst._handle is not None: ctypes.windll.kernel32.CloseHandle(inst._handle) if res is not None: try: _active.remove(inst) except ValueError: # This can happen if two threads create a new Popen instance. # It's harmless that it was already removed, so ignore. pass PIPE = -1 STDOUT = -2 def _eintr_retry_call(func, *args): while True: try: return func(*args) except (OSError, IOError) as e: if e.errno == errno.EINTR: continue raise # XXX This function is only used by multiprocessing and the test suite, # but it's here so that it can be imported when Python is compiled without # threads. def _args_from_interpreter_flags(): """Return a list of command-line arguments reproducing the current settings in sys.flags and sys.warnoptions.""" flag_opt_map = { 'debug': 'd', # 'inspect': 'i', # 'interactive': 'i', 'optimize': 'O', 'dont_write_bytecode': 'B', 'no_user_site': 's', 'no_site': 'S', 'ignore_environment': 'E', 'verbose': 'v', 'bytes_warning': 'b', 'hash_randomization': 'R', 'py3k_warning': '3', } args = [] for flag, opt in flag_opt_map.items(): v = getattr(sys.flags, flag) if v > 0: args.append('-' + opt * v) for opt in sys.warnoptions: args.append('-W' + opt) return args def call(*popenargs, **kwargs): """Run command with arguments. Wait for command to complete, then return the returncode attribute. The arguments are the same as for the Popen constructor. Example: retcode = call(["ls", "-l"]) """ return Popen(*popenargs, **kwargs).wait() def check_call(*popenargs, **kwargs): """Run command with arguments. Wait for command to complete. If the exit code was zero then return, otherwise raise CalledProcessError. The CalledProcessError object will have the return code in the returncode attribute. The arguments are the same as for the Popen constructor. Example: check_call(["ls", "-l"]) """ retcode = call(*popenargs, **kwargs) if retcode: cmd = kwargs.get("args") if cmd is None: cmd = popenargs[0] raise CalledProcessError(retcode, cmd) return 0 def check_output(*popenargs, **kwargs): r"""Run command with arguments and return its output as a byte string. If the exit code was non-zero it raises a CalledProcessError. The CalledProcessError object will have the return code in the returncode attribute and output in the output attribute. The arguments are the same as for the Popen constructor. Example: >>> check_output(["ls", "-l", "/dev/null"]) 'crw-rw-rw- 1 root root 1, 3 Oct 18 2007 /dev/null\n' The stdout argument is not allowed as it is used internally. To capture standard error in the result, use stderr=STDOUT. >>> check_output(["/bin/sh", "-c", ... "ls -l non_existent_file ; exit 0"], ... stderr=STDOUT) 'ls: non_existent_file: No such file or directory\n' """ if 'stdout' in kwargs: raise ValueError('stdout argument not allowed, it will be overridden.') process = Popen(stdout=PIPE, *popenargs, **kwargs) output, unused_err = process.communicate() retcode = process.poll() if retcode: cmd = kwargs.get("args") if cmd is None: cmd = popenargs[0] raise CalledProcessError(retcode, cmd, output=output) return output def list2cmdline(seq): """ Translate a sequence of arguments into a command line string, using the same rules as the MS C runtime: 1) Arguments are delimited by white space, which is either a space or a tab. 2) A string surrounded by double quotation marks is interpreted as a single argument, regardless of white space contained within. A quoted string can be embedded in an argument. 3) A double quotation mark preceded by a backslash is interpreted as a literal double quotation mark. 4) Backslashes are interpreted literally, unless they immediately precede a double quotation mark. 5) If backslashes immediately precede a double quotation mark, every pair of backslashes is interpreted as a literal backslash. If the number of backslashes is odd, the last backslash escapes the next double quotation mark as described in rule 3. """ # See # http://msdn.microsoft.com/en-us/library/17w5ykft.aspx # or search http://msdn.microsoft.com for # "Parsing C++ Command-Line Arguments" result = [] needquote = False for arg in seq: bs_buf = [] # Add a space to separate this argument from the others if result: result.append(' ') needquote = (" " in arg) or ("\t" in arg) or not arg if needquote: result.append('"') for c in arg: if c == '\\': # Don't know if we need to double yet. bs_buf.append(c) elif c == '"': # Double backslashes. result.append('\\' * len(bs_buf)*2) bs_buf = [] result.append('\\"') else: # Normal char if bs_buf: result.extend(bs_buf) bs_buf = [] result.append(c) # Add remaining backslashes, if any. if bs_buf: result.extend(bs_buf) if needquote: result.extend(bs_buf) result.append('"') return ''.join(result) if mswindows: class STARTUP_INFO(ctypes.Structure): _fields_ = [ ("cb", ctypes.c_uint), ("lpReserved", ctypes.c_uint), ("lpDesktop", ctypes.c_uint), ("lpTitle", ctypes.c_uint), ("dwX", ctypes.c_uint), ("dwY", ctypes.c_uint), ("dwXSize", ctypes.c_uint), ("dwYSize", ctypes.c_uint), ("dwXCountChars", ctypes.c_uint), ("dwYCountChars", ctypes.c_uint), ("dwFillAttribute", ctypes.c_uint), ("dwFlags", ctypes.c_uint), ("wShowWindow", ctypes.c_uint16), ("cbReserved2", ctypes.c_uint16), ("lpReserved2", ctypes.c_uint), ("hStdInput", ctypes.c_uint), ("hStdOutput", ctypes.c_uint), ("hStdError", ctypes.c_uint)] class PROCESS_INFORMATION(ctypes.Structure): _fields_ = [ ("hProcess", ctypes.c_uint), ("hThread", ctypes.c_uint), ("dwProcessId", ctypes.c_uint), ("dwThreadId", ctypes.c_uint)] class Popen(object): def __init__(self, args, bufsize=0, executable=None, stdin=None, stdout=None, stderr=None, preexec_fn=None, close_fds=False, shell=False, cwd=None, env=None, universal_newlines=False, startupinfo=None, creationflags=0): """Create new Popen instance.""" _cleanup() self._child_created = False if not isinstance(bufsize, (int, long)): raise TypeError("bufsize must be an integer") if mswindows: if preexec_fn is not None: raise ValueError("preexec_fn is not supported on Windows " "platforms") if close_fds and (stdin is not None or stdout is not None or stderr is not None): raise ValueError("close_fds is not supported on Windows " "platforms if you redirect stdin/stdout/stderr") else: # POSIX if startupinfo is not None: raise ValueError("startupinfo is only supported on Windows " "platforms") if creationflags != 0: raise ValueError("creationflags is only supported on Windows " "platforms") self.stdin = None self.stdout = None self.stderr = None self.pid = None self.returncode = None self.universal_newlines = universal_newlines # Input and output objects. The general principle is like # this: # # Parent Child # ------ ----- # p2cwrite ---stdin---> p2cread # c2pread <--stdout--- c2pwrite # errread <--stderr--- errwrite # # On POSIX, the child objects are file descriptors. On # Windows, these are Windows file handles. The parent objects # are file descriptors on both platforms. The parent objects # are None when not using PIPEs. The child objects are None # when not redirecting. (p2cread, p2cwrite, c2pread, c2pwrite, errread, errwrite) = self._get_handles(stdin, stdout, stderr) try: self._execute_child(args, executable, preexec_fn, close_fds, cwd, env, universal_newlines, startupinfo, creationflags, shell, p2cread, p2cwrite, c2pread, c2pwrite, errread, errwrite) except Exception: # Preserve original exception in case os.close raises. exc_type, exc_value, exc_trace = sys.exc_info() to_close = [] # Only close the pipes we created. if stdin == PIPE: to_close.extend((p2cread, p2cwrite)) if stdout == PIPE: to_close.extend((c2pread, c2pwrite)) if stderr == PIPE: to_close.extend((errread, errwrite)) for fd in to_close: try: os.close(fd) except EnvironmentError: pass raise exc_type, exc_value, exc_trace if mswindows: if p2cwrite is not None: p2cwrite = msvcrt.open_osfhandle(p2cwrite.Detach(), 0) if c2pread is not None: c2pread = msvcrt.open_osfhandle(c2pread.Detach(), 0) if errread is not None: errread = msvcrt.open_osfhandle(errread.Detach(), 0) if p2cwrite is not None: self.stdin = os.fdopen(p2cwrite, 'wb', bufsize) if c2pread is not None: if universal_newlines: self.stdout = os.fdopen(c2pread, 'rU', bufsize) else: self.stdout = os.fdopen(c2pread, 'rb', bufsize) if errread is not None: if universal_newlines: self.stderr = os.fdopen(errread, 'rU', bufsize) else: self.stderr = os.fdopen(errread, 'rb', bufsize) def _translate_newlines(self, data): data = data.replace("\r\n", "\n") data = data.replace("\r", "\n") return data def __del__(self, _maxint=sys.maxint, _active=_active): # If __init__ hasn't had a chance to execute (e.g. if it # was passed an undeclared keyword argument), we don't # have a _child_created attribute at all. if not getattr(self, '_child_created', False): # We didn't get to successfully create a child process. return # In case the child hasn't been waited on, check if it's done. self._internal_poll(_deadstate=_maxint) if self.returncode is None and _active is not None: # Child is still running, keep us alive until we can wait on it. _active.append(self) else: if mswindows: if self._handle is not None: ctypes.windll.kernel32.CloseHandle(self._handle) self._handle = None def communicate(self, input=None): """Interact with process: Send data to stdin. Read data from stdout and stderr, until end-of-file is reached. Wait for process to terminate. The optional input argument should be a string to be sent to the child process, or None, if no data should be sent to the child. communicate() returns a tuple (stdout, stderr).""" # Optimization: If we are only using one pipe, or no pipe at # all, using select() or threads is unnecessary. if [self.stdin, self.stdout, self.stderr].count(None) >= 2: stdout = None stderr = None if self.stdin: if input: try: self.stdin.write(input) except IOError as e: if e.errno != errno.EPIPE and e.errno != errno.EINVAL: raise self.stdin.close() elif self.stdout: stdout = _eintr_retry_call(self.stdout.read) self.stdout.close() elif self.stderr: stderr = _eintr_retry_call(self.stderr.read) self.stderr.close() self.wait() return (stdout, stderr) return self._communicate(input) def poll(self): return self._internal_poll() if mswindows: # # Windows methods # def _get_handles(self, stdin, stdout, stderr): """Construct and return tuple with IO objects: p2cread, p2cwrite, c2pread, c2pwrite, errread, errwrite """ if stdin is None and stdout is None and stderr is None: return (None, None, None, None, None, None) p2cread, p2cwrite = None, None c2pread, c2pwrite = None, None errread, errwrite = None, None if stdin is None: p2cread = _subprocess.GetStdHandle(_subprocess.STD_INPUT_HANDLE) if p2cread is None: p2cread, _ = _subprocess.CreatePipe(None, 0) elif stdin == PIPE: p2cread, p2cwrite = _subprocess.CreatePipe(None, 0) elif isinstance(stdin, int): p2cread = msvcrt.get_osfhandle(stdin) else: # Assuming file-like object p2cread = msvcrt.get_osfhandle(stdin.fileno()) p2cread = self._make_inheritable(p2cread) if stdout is None: c2pwrite = _subprocess.GetStdHandle(_subprocess.STD_OUTPUT_HANDLE) if c2pwrite is None: _, c2pwrite = _subprocess.CreatePipe(None, 0) elif stdout == PIPE: c2pread, c2pwrite = _subprocess.CreatePipe(None, 0) elif isinstance(stdout, int): c2pwrite = msvcrt.get_osfhandle(stdout) else: # Assuming file-like object c2pwrite = msvcrt.get_osfhandle(stdout.fileno()) c2pwrite = self._make_inheritable(c2pwrite) if stderr is None: errwrite = _subprocess.GetStdHandle(_subprocess.STD_ERROR_HANDLE) if errwrite is None: _, errwrite = _subprocess.CreatePipe(None, 0) elif stderr == PIPE: errread, errwrite = _subprocess.CreatePipe(None, 0) elif stderr == STDOUT: errwrite = c2pwrite elif isinstance(stderr, int): errwrite = msvcrt.get_osfhandle(stderr) else: # Assuming file-like object errwrite = msvcrt.get_osfhandle(stderr.fileno()) errwrite = self._make_inheritable(errwrite) return (p2cread, p2cwrite, c2pread, c2pwrite, errread, errwrite) def _make_inheritable(self, handle): """Return a duplicate of handle, which is inheritable""" return _subprocess.DuplicateHandle(_subprocess.GetCurrentProcess(), handle, _subprocess.GetCurrentProcess(), 0, 1, _subprocess.DUPLICATE_SAME_ACCESS) def _find_w9xpopen(self): """Find and return absolut path to w9xpopen.exe""" w9xpopen = os.path.join( os.path.dirname(_subprocess.GetModuleFileName(0)), "w9xpopen.exe") if not os.path.exists(w9xpopen): # Eeek - file-not-found - possibly an embedding # situation - see if we can locate it in sys.exec_prefix w9xpopen = os.path.join(os.path.dirname(sys.exec_prefix), "w9xpopen.exe") if not os.path.exists(w9xpopen): raise RuntimeError("Cannot locate w9xpopen.exe, which is " "needed for Popen to work with your " "shell or platform.") return w9xpopen def _execute_child(self, args, executable, preexec_fn, close_fds, cwd, env, universal_newlines, startupinfo, creationflags, shell, p2cread, p2cwrite, c2pread, c2pwrite, errread, errwrite): """Execute program (MS Windows version)""" if not isinstance(args, types.StringTypes): args = list2cmdline(args) # Process startup details startup_info = STARTUP_INFO() if startupinfo is None: startupinfo = STARTUPINFO() if None not in (p2cread, c2pwrite, errwrite): startup_info.dwFlags = 0x00000100 startup_info.hStdInput = p2cread startup_info.hStdOutput = c2pwrite startup_info.hStdError = errwrite startup_info.dwFlags |= startupinfo.dwFlags if shell: #startup_info.dwFlags |= 0x00000001 startup_info.wShowWindow = 0 comspec = os.environ.get("COMSPEC", "cmd.exe") #w9args = '{} /c "{}"'.format (comspec, args) if (_subprocess.GetVersion() >= 0x80000000 or os.path.basename(comspec).lower() == "command.com"): # Win9x, or using command.com on NT. We need to # use the w9xpopen intermediate program. For more # information, see KB Q150956 # (http://web.archive.org/web/20011105084002/http://support.microsoft.com/support/kb/articles/Q150/9/56.asp) w9xpopen = self._find_w9xpopen() w9args = '"%s" %s' % (w9xpopen, w9args) # Not passing CREATE_NEW_CONSOLE has been known to # cause random failures on win9x. Specifically a # dialog: "Your program accessed mem currently in # use at xxx" and a hopeful warning about the # stability of your system. Cost is Ctrl+C wont # kill children. #creationflags |= _subprocess.CREATE_NEW_CONSOLE creationflags = 0x00040000 # Start the process p_i = PROCESS_INFORMATION() try: args_u16 = unicode(args) ctypes.windll.kernel32.CreateProcessW(executable, args_u16, None, None, 0, creationflags, env, cwd, ctypes.byref(startup_info), ctypes.byref(p_i)) except pywintypes.error, e: # Translate pywintypes.error to WindowsError, which is # a subclass of OSError. FIXME: We should really # translate errno using _sys_errlist (or similar), but # how can this be done from Python? raise WindowsError(*e.args) finally: # Child is launched. Close the parent's copy of those pipe # handles that only the child should have open. You need # to make sure that no handles to the write end of the # output pipe are maintained in this process or else the # pipe will not close when the child process exits and the # ReadFile will hang. if p2cread is not None: p2cread.Close() if c2pwrite is not None: c2pwrite.Close() if errwrite is not None: errwrite.Close() # Retain the process handle, but close the thread handle self._child_created = True self._handle = p_i.hProcess self.pid = p_i.dwProcessId ctypes.windll.kernel32.CloseHandle(p_i.hThread) def _internal_poll(self, _deadstate=None, _WaitForSingleObject=_subprocess.WaitForSingleObject, _WAIT_OBJECT_0=_subprocess.WAIT_OBJECT_0, _GetExitCodeProcess=_subprocess.GetExitCodeProcess): """Check if child process has terminated. Returns returncode attribute. This method is called by __del__, so it can only refer to objects in its local scope. """ if self.returncode is None: if _WaitForSingleObject(self._handle, 0) == _WAIT_OBJECT_0: self.returncode = _GetExitCodeProcess(self._handle) return self.returncode def wait(self): """Wait for child process to terminate. Returns returncode attribute.""" if self.returncode is None: _subprocess.WaitForSingleObject(self._handle, _subprocess.INFINITE) self.returncode = _subprocess.GetExitCodeProcess(self._handle) return self.returncode def _readerthread(self, fh, buffer): buffer.append(fh.read()) def _communicate(self, input): stdout = None # Return stderr = None # Return if self.stdout: stdout = [] stdout_thread = threading.Thread(target=self._readerthread, args=(self.stdout, stdout)) stdout_thread.setDaemon(True) stdout_thread.start() if self.stderr: stderr = [] stderr_thread = threading.Thread(target=self._readerthread, args=(self.stderr, stderr)) stderr_thread.setDaemon(True) stderr_thread.start() if self.stdin: if input is not None: try: self.stdin.write(input) except IOError as e: if e.errno != errno.EPIPE: raise self.stdin.close() if self.stdout: stdout_thread.join() if self.stderr: stderr_thread.join() # All data exchanged. Translate lists into strings. if stdout is not None: stdout = stdout[0] if stderr is not None: stderr = stderr[0] # Translate newlines, if requested. We cannot let the file # object do the translation: It is based on stdio, which is # impossible to combine with select (unless forcing no # buffering). if self.universal_newlines and hasattr(file, 'newlines'): if stdout: stdout = self._translate_newlines(stdout) if stderr: stderr = self._translate_newlines(stderr) self.wait() return (stdout, stderr) def send_signal(self, sig): """Send a signal to the process """ if sig == signal.SIGTERM: self.terminate() elif sig == signal.CTRL_C_EVENT: os.kill(self.pid, signal.CTRL_C_EVENT) elif sig == signal.CTRL_BREAK_EVENT: os.kill(self.pid, signal.CTRL_BREAK_EVENT) else: raise ValueError("Unsupported signal: {}".format(sig)) def terminate(self): """Terminates the process """ try: _subprocess.TerminateProcess(self._handle, 1) except OSError as e: # ERROR_ACCESS_DENIED (winerror 5) is received when the # process already died. if e.winerror != 5: raise rc = _subprocess.GetExitCodeProcess(self._handle) if rc == _subprocess.STILL_ACTIVE: raise self.returncode = rc kill = terminate else: # # POSIX methods # def _get_handles(self, stdin, stdout, stderr): """Construct and return tuple with IO objects: p2cread, p2cwrite, c2pread, c2pwrite, errread, errwrite """ p2cread, p2cwrite = None, None c2pread, c2pwrite = None, None errread, errwrite = None, None if stdin is None: pass elif stdin == PIPE: p2cread, p2cwrite = self.pipe_cloexec() elif isinstance(stdin, int): p2cread = stdin else: # Assuming file-like object p2cread = stdin.fileno() if stdout is None: pass elif stdout == PIPE: c2pread, c2pwrite = self.pipe_cloexec() elif isinstance(stdout, int): c2pwrite = stdout else: # Assuming file-like object c2pwrite = stdout.fileno() if stderr is None: pass elif stderr == PIPE: errread, errwrite = self.pipe_cloexec() elif stderr == STDOUT: errwrite = c2pwrite elif isinstance(stderr, int): errwrite = stderr else: # Assuming file-like object errwrite = stderr.fileno() return (p2cread, p2cwrite, c2pread, c2pwrite, errread, errwrite) def _set_cloexec_flag(self, fd, cloexec=True): try: cloexec_flag = fcntl.FD_CLOEXEC except AttributeError: cloexec_flag = 1 old = fcntl.fcntl(fd, fcntl.F_GETFD) if cloexec: fcntl.fcntl(fd, fcntl.F_SETFD, old | cloexec_flag) else: fcntl.fcntl(fd, fcntl.F_SETFD, old & ~cloexec_flag) def pipe_cloexec(self): """Create a pipe with FDs set CLOEXEC.""" # Pipes' FDs are set CLOEXEC by default because we don't want them # to be inherited by other subprocesses: the CLOEXEC flag is removed # from the child's FDs by _dup2(), between fork() and exec(). # This is not atomic: we would need the pipe2() syscall for that. r, w = os.pipe() self._set_cloexec_flag(r) self._set_cloexec_flag(w) return r, w def _close_fds(self, but): if hasattr(os, 'closerange'): os.closerange(3, but) os.closerange(but + 1, MAXFD) else: for i in xrange(3, MAXFD): if i == but: continue try: os.close(i) except: pass def _execute_child(self, args, executable, preexec_fn, close_fds, cwd, env, universal_newlines, startupinfo, creationflags, shell, p2cread, p2cwrite, c2pread, c2pwrite, errread, errwrite): """Execute program (POSIX version)""" if isinstance(args, types.StringTypes): args = [args] else: args = list(args) if shell: args = ["/bin/sh", "-c"] + args if executable: args[0] = executable if executable is None: executable = args[0] # For transferring possible exec failure from child to parent # The first char specifies the exception type: 0 means # OSError, 1 means some other error. errpipe_read, errpipe_write = self.pipe_cloexec() try: try: gc_was_enabled = gc.isenabled() # Disable gc to avoid bug where gc -> file_dealloc -> # write to stderr -> hang. http://bugs.python.org/issue1336 gc.disable() try: self.pid = os.fork() except: if gc_was_enabled: gc.enable() raise self._child_created = True if self.pid == 0: # Child try: # Close parent's pipe ends if p2cwrite is not None: os.close(p2cwrite) if c2pread is not None: os.close(c2pread) if errread is not None: os.close(errread) os.close(errpipe_read) # When duping fds, if there arises a situation # where one of the fds is either 0, 1 or 2, it # is possible that it is overwritten (#12607). if c2pwrite == 0: c2pwrite = os.dup(c2pwrite) if errwrite == 0 or errwrite == 1: errwrite = os.dup(errwrite) # Dup fds for child def _dup2(a, b): # dup2() removes the CLOEXEC flag but # we must do it ourselves if dup2() # would be a no-op (issue #10806). if a == b: self._set_cloexec_flag(a, False) elif a is not None: os.dup2(a, b) _dup2(p2cread, 0) _dup2(c2pwrite, 1) _dup2(errwrite, 2) # Close pipe fds. Make sure we don't close the # same fd more than once, or standard fds. closed = set(None) for fd in [p2cread, c2pwrite, errwrite]: if fd not in closed and fd > 2: os.close(fd) closed.add(fd) # Close all other fds, if asked for if close_fds: self._close_fds(but=errpipe_write) if cwd is not None: os.chdir(cwd) if preexec_fn: preexec_fn() if env is None: os.execvp(executable, args) else: os.execvpe(executable, args, env) except: exc_type, exc_value, tb = sys.exc_info() # Save the traceback and attach it to the exception object exc_lines = traceback.format_exception(exc_type, exc_value, tb) exc_value.child_traceback = ''.join(exc_lines) os.write(errpipe_write, pickle.dumps(exc_value)) # This exitcode won't be reported to applications, so it # really doesn't matter what we return. os._exit(255) # Parent if gc_was_enabled: gc.enable() finally: # be sure the FD is closed no matter what os.close(errpipe_write) if p2cread is not None and p2cwrite is not None: os.close(p2cread) if c2pwrite is not None and c2pread is not None: os.close(c2pwrite) if errwrite is not None and errread is not None: os.close(errwrite) # Wait for exec to fail or succeed; possibly raising exception # Exception limited to 1M data = _eintr_retry_call(os.read, errpipe_read, 1048576) finally: # be sure the FD is closed no matter what os.close(errpipe_read) if data != "": try: _eintr_retry_call(os.waitpid, self.pid, 0) except OSError as e: if e.errno != errno.ECHILD: raise child_exception = pickle.loads(data) #if child_exception is not None: raise child_exception #else: # class ChildProcessException(Exception): pass #raise ChildProcessException raise child_exception def _handle_exitstatus(self, sts, _WIFSIGNALED=os.WIFSIGNALED, _WTERMSIG=os.WTERMSIG, _WIFEXITED=os.WIFEXITED, _WEXITSTATUS=os.WEXITSTATUS): # This method is called (indirectly) by __del__, so it cannot # refer to anything outside of its local scope.""" if _WIFSIGNALED(sts): self.returncode = -_WTERMSIG(sts) elif _WIFEXITED(sts): self.returncode = _WEXITSTATUS(sts) else: # Should never happen raise RuntimeError("Unknown child exit status!") def _internal_poll(self, _deadstate=None, _waitpid=os.waitpid, _WNOHANG=os.WNOHANG, _os_error=os.error, _ECHILD=errno.ECHILD): """Check if child process has terminated. Returns returncode attribute. This method is called by __del__, so it cannot reference anything outside of the local scope (nor can any methods it calls). """ if self.returncode is None: try: pid, sts = _waitpid(self.pid, _WNOHANG) if pid == self.pid: self._handle_exitstatus(sts) except _os_error as e: if _deadstate is not None: self.returncode = _deadstate if e.errno == _ECHILD: # This happens if SIGCLD is set to be ignored or # waiting for child processes has otherwise been # disabled for our process. This child is dead, we # can't get the status. # http://bugs.python.org/issue15756 self.returncode = 0 return self.returncode def wait(self): """Wait for child process to terminate. Returns returncode attribute.""" while self.returncode is None: try: pid, sts = _eintr_retry_call(os.waitpid, self.pid, 0) except OSError as e: if e.errno != errno.ECHILD: raise # This happens if SIGCLD is set to be ignored or waiting # for child processes has otherwise been disabled for our # process. This child is dead, we can't get the status. pid = self.pid sts = 0 # Check the pid and loop as waitpid has been known to return # 0 even without WNOHANG in odd situations. issue14396. if pid == self.pid: self._handle_exitstatus(sts) return self.returncode def _communicate(self, input): if self.stdin: # Flush stdio buffer. This might block, if the user has # been writing to .stdin in an uncontrolled fashion. self.stdin.flush() if not input: self.stdin.close() if _has_poll: stdout, stderr = self._communicate_with_poll(input) else: stdout, stderr = self._communicate_with_select(input) # All data exchanged. Translate lists into strings. if stdout is not None: stdout = ''.join(stdout) if stderr is not None: stderr = ''.join(stderr) # Translate newlines, if requested. We cannot let the file # object do the translation: It is based on stdio, which is # impossible to combine with select (unless forcing no # buffering). if self.universal_newlines and hasattr(file, 'newlines'): if stdout: stdout = self._translate_newlines(stdout) if stderr: stderr = self._translate_newlines(stderr) self.wait() return (stdout, stderr) def _communicate_with_poll(self, input): stdout = None # Return stderr = None # Return fd2file = {} fd2output = {} poller = select.poll() def register_and_append(file_obj, eventmask): poller.register(file_obj.fileno(), eventmask) fd2file[file_obj.fileno()] = file_obj def close_unregister_and_remove(fd): poller.unregister(fd) fd2file[fd].close() fd2file.pop(fd) if self.stdin and input: register_and_append(self.stdin, select.POLLOUT) select_POLLIN_POLLPRI = select.POLLIN | select.POLLPRI if self.stdout: register_and_append(self.stdout, select_POLLIN_POLLPRI) fd2output[self.stdout.fileno()] = stdout = [] if self.stderr: register_and_append(self.stderr, select_POLLIN_POLLPRI) fd2output[self.stderr.fileno()] = stderr = [] input_offset = 0 while fd2file: try: ready = poller.poll() except select.error, e: if e.args[0] == errno.EINTR: continue raise for fd, mode in ready: if mode & select.POLLOUT: chunk = input[input_offset : input_offset + _PIPE_BUF] try: input_offset += os.write(fd, chunk) except OSError as e: if e.errno == errno.EPIPE: close_unregister_and_remove(fd) else: raise else: if input_offset >= len(input): close_unregister_and_remove(fd) elif mode & select_POLLIN_POLLPRI: data = os.read(fd, 4096) if not data: close_unregister_and_remove(fd) fd2output[fd].append(data) else: # Ignore hang up or errors. close_unregister_and_remove(fd) return (stdout, stderr) def _communicate_with_select(self, input): read_set = [] write_set = [] stdout = None # Return stderr = None # Return if self.stdin and input: write_set.append(self.stdin) if self.stdout: read_set.append(self.stdout) stdout = [] if self.stderr: read_set.append(self.stderr) stderr = [] input_offset = 0 while read_set or write_set: try: rlist, wlist, xlist = select.select(read_set, write_set, []) except select.error, e: if e.args[0] == errno.EINTR: continue raise if self.stdin in wlist: chunk = input[input_offset : input_offset + _PIPE_BUF] try: bytes_written = os.write(self.stdin.fileno(), chunk) except OSError as e: if e.errno == errno.EPIPE: self.stdin.close() write_set.remove(self.stdin) else: raise else: input_offset += bytes_written if input_offset >= len(input): self.stdin.close() write_set.remove(self.stdin) if self.stdout in rlist: data = os.read(self.stdout.fileno(), 1024) if data == "": self.stdout.close() read_set.remove(self.stdout) stdout.append(data) if self.stderr in rlist: data = os.read(self.stderr.fileno(), 1024) if data == "": self.stderr.close() read_set.remove(self.stderr) stderr.append(data) return (stdout, stderr) def send_signal(self, sig): """Send a signal to the process """ os.kill(self.pid, sig) def terminate(self): """Terminate the process with SIGTERM """ self.send_signal(signal.SIGTERM) def kill(self): """Kill the process with SIGKILL """ self.send_signal(signal.SIGKILL) def _demo_posix(): # # Example 1: Simple redirection: Get process list # plist = Popen(["ps"], stdout=PIPE).communicate()[0] print "Process list:" print plist # # Example 2: Change uid before executing child # if os.getuid() == 0: p = Popen(["id"], preexec_fn=lambda: os.setuid(100)) p.wait() # # Example 3: Connecting several subprocesses # print "Looking for 'hda'..." p1 = Popen(["dmesg"], stdout=PIPE) p2 = Popen(["grep", "hda"], stdin=p1.stdout, stdout=PIPE) print repr(p2.communicate()[0]) # # Example 4: Catch execution error # print print "Trying a weird file..." try: print Popen(["/this/path/does/not/exist"]).communicate() except OSError, e: if e.errno == errno.ENOENT: print "The file didn't exist. I thought so..." print "Child traceback:" print e.child_traceback else: print "Error", e.errno else: print >>sys.stderr, "Gosh. No error." def _demo_windows(): # # Example 1: Connecting several subprocesses # print "Looking for 'PROMPT' in set output..." p1 = Popen("set", stdout=PIPE, shell=True) p2 = Popen('find "PROMPT"', stdin=p1.stdout, stdout=PIPE) print repr(p2.communicate()[0]) # # Example 2: Simple execution of program # print "Executing calc..." p = Popen("calc") p.wait() if __name__ == "__main__": if mswindows: _demo_windows() else: _demo_posix() armory-0.92.3/SDM.py0000644000000000000000000010706212414772654012633 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ import inspect import os.path import socket import stat import time from threading import Event from bitcoinrpc_jsonrpc import ServiceProxy from CppBlockUtils import SecureBinaryData, CryptoECDSA from armoryengine.ArmoryUtils import BITCOIN_PORT, LOGERROR, hex_to_binary, \ ARMORY_INFO_SIGN_PUBLICKEY, LOGINFO, BTC_HOME_DIR, LOGDEBUG, OS_WINDOWS, \ SystemSpecs, subprocess_check_output, LOGEXCEPT, FileExistsError, OS_VARIANT, \ BITCOIN_RPC_PORT, binary_to_base58, isASCII, USE_TESTNET, GIGABYTE, \ launchProcess, killProcessTree, killProcess, LOGWARN, RightNow, HOUR, \ PyBackgroundThread, touchFile, DISABLE_TORRENTDL, secondsToHumanTime, \ bytesToHumanSize, MAGIC_BYTES, deleteBitcoindDBs, TheTDM, satoshiIsAvailable,\ MEGABYTE, ARMORY_HOME_DIR, CLI_OPTIONS from bitcoinrpc_jsonrpc import authproxy ################################################################################ def extractSignedDataFromVersionsDotTxt(wholeFile, doVerify=True): """ This method returns a pair: a dictionary to lookup link by OS, and a formatted string that is sorted by OS, and re-formatted list that will hash the same regardless of original format or ordering """ msgBegin = wholeFile.find('# -----BEGIN-SIGNED-DATA-') msgBegin = wholeFile.find('\n', msgBegin+1) + 1 msgEnd = wholeFile.find('# -----SIGNATURE---------') sigBegin = wholeFile.find('\n', msgEnd+1) + 3 sigEnd = wholeFile.find('# -----END-SIGNED-DATA---') MSGRAW = wholeFile[msgBegin:msgEnd] SIGHEX = wholeFile[sigBegin:sigEnd].strip() if -1 in [msgBegin,msgEnd,sigBegin,sigEnd]: LOGERROR('No signed data block found') return '' if doVerify: Pub = SecureBinaryData(hex_to_binary(ARMORY_INFO_SIGN_PUBLICKEY)) Msg = SecureBinaryData(MSGRAW) Sig = SecureBinaryData(hex_to_binary(SIGHEX)) isVerified = CryptoECDSA().VerifyData(Msg, Sig, Pub) if not isVerified: LOGERROR('Signed data block failed verification!') return '' else: LOGINFO('Signature on signed data block is GOOD!') return MSGRAW ################################################################################ def parseLinkList(theData): """ Plug the verified data into here... """ DLDICT,VERDICT = {},{} sectStr = None for line in theData.split('\n'): pcs = line[1:].split() if line.startswith('# SECTION-') and 'INSTALLERS' in line: sectStr = pcs[0].split('-')[-1] if not sectStr in DLDICT: DLDICT[sectStr] = {} VERDICT[sectStr] = '' if len(pcs)>1: VERDICT[sectStr] = pcs[-1] continue if len(pcs)==3 and pcs[1].startswith('http'): DLDICT[sectStr][pcs[0]] = pcs[1:] return DLDICT,VERDICT ################################################################################ # jgarzik'sjj jsonrpc-bitcoin code -- stupid-easy to talk to bitcoind class SatoshiDaemonManager(object): """ Use an existing implementation of bitcoind """ class BitcoindError(Exception): pass class BitcoindNotAvailableError(Exception): pass class BitcoinDotConfError(Exception): pass class SatoshiHomeDirDNE(Exception): pass class ConfigFileUserDNE(Exception): pass class ConfigFilePwdDNE(Exception): pass ############################################################################# def __init__(self): self.executable = None self.satoshiHome = None self.bitconf = {} self.proxy = None self.bitcoind = None self.isMidQuery = False self.last20queries = [] self.disabled = False self.failedFindExe = False self.failedFindHome = False self.foundExe = [] self.circBufferState = [] self.circBufferTime = [] self.btcOut = None self.btcErr = None self.lastTopBlockInfo = { \ 'numblks': -1, 'tophash': '', 'toptime': -1, 'error': 'Uninitialized', 'blkspersec': -1 } # Added torrent DL before we *actually* start SDM (if it makes sense) self.useTorrentFinalAnswer = False self.useTorrentFile = '' self.torrentDisabled = False self.tdm = None self.satoshiHome = None ############################################################################# def setSatoshiDir(self, newDir): self.satoshiHome = newDir ############################################################################# def setDisableTorrentDL(self, b): self.torrentDisabled = b ############################################################################# def tryToSetupTorrentDL(self, torrentPath): if self.torrentDisabled: LOGWARN('Tried to setup torrent download mgr but we are disabled') return False if not torrentPath or not os.path.exists(torrentPath): self.useTorrentFinalAnswer = False return False bootfile = os.path.join(self.satoshiHome, 'bootstrap.dat') bootfilePart = bootfile + '.partial' bootfileOld = bootfile + '.old' # cleartorrent.flag means we should remove any pre-existing files delTorrentFlag = os.path.join(ARMORY_HOME_DIR, 'cleartorrent.flag') if os.path.exists(delTorrentFlag): LOGWARN('Flag found to delete any pre-existing torrent files') if os.path.exists(bootfile): os.remove(bootfile) if os.path.exists(bootfilePart): os.remove(bootfilePart) if os.path.exists(bootfileOld): os.remove(bootfileOld) if os.path.exists(delTorrentFlag): os.remove(delTorrentFlag) TheTDM.setupTorrent(torrentPath, bootfile) if not TheTDM.getTDMState()=='ReadyToStart': LOGERROR('Unknown error trying to start torrent manager') self.useTorrentFinalAnswer = False return False # We will tell the TDM to write status updates to the log file, and only # every 90 seconds. After it finishes (or fails), simply launch bitcoind # as we would've done without the torrent ##### def torrentLogToFile(dpflag=Event(), fractionDone=None, timeEst=None, downRate=None, upRate=None, activity=None, statistics=None, **kws): statStr = '' if fractionDone: statStr += ' Done: %0.1f%% ' % (fractionDone*100) if downRate: statStr += ' / DLRate: %0.1f/sec' % (downRate/1024.) if timeEst: statStr += ' / TLeft: %s' % secondsToHumanTime(timeEst) if statistics: statStr += ' / Seeds: %d' % (statistics.numSeeds) statStr += ' / Peers: %d' % (statistics.numPeers) if len(statStr)==0: statStr = 'No torrent info available' LOGINFO('Torrent: %s' % statStr) ##### def torrentFinished(): bootsz = '' if os.path.exists(bootfile): bootsz = bytesToHumanSize(os.path.getsize(bootfile)) LOGINFO('Torrent finished; size of %s is %s', torrentPath, bootsz) LOGINFO('Remove the core btc databases before doing bootstrap') deleteBitcoindDBs() self.launchBitcoindAndGuardian() ##### def warnUserHashFail(): from PyQt4.QtGui import QMessageBox QMessageBox.warning(self, tr('Hash Failure'), tr("""The torrent download is currently encountering too many packet hash failures to allow it to progress properly. As a result, the torrent engine has been halted. You should report this incident to the Armory team and turn off this feature until further notice."""), QMessageBox.Ok) ##### def torrentFailed(errMsg=''): # Not sure there's actually anything we need to do here... if errMsg == 'hashFail': warnUserHashFail() bootsz = '' if os.path.exists(bootfile): bootsz = bytesToHumanSize(os.path.getsize(bootfile)) LOGERROR('Torrent failed; size of %s is %s', torrentPath, bootsz) self.launchBitcoindAndGuardian() TheTDM.setSecondsBetweenUpdates(90) TheTDM.setCallback('displayFunc', torrentLogToFile) TheTDM.setCallback('finishedFunc', torrentFinished) TheTDM.setCallback('failedFunc', torrentFailed) LOGINFO('Bootstrap file is %s' % bytesToHumanSize(TheTDM.torrentSize)) self.useTorrentFinalAnswer = True self.useTorrentFile = torrentPath return True ############################################################################# def shouldTryBootstrapTorrent(self): if DISABLE_TORRENTDL or TheTDM.getTDMState()=='Disabled': return False # The only torrent we have is for the primary Bitcoin network if not MAGIC_BYTES=='\xf9\xbe\xb4\xd9': return False if TheTDM.torrentSize: bootfile = os.path.join(self.satoshiHome, 'bootstrap.dat') if os.path.exists(bootfile): if os.path.getsize(bootfile) >= TheTDM.torrentSize/2: LOGWARN('Looks like a full bootstrap is already here') LOGWARN('Skipping torrent download') return False # If they don't even have a BTC_HOME_DIR, corebtc never been installed blockDir = os.path.join(self.satoshiHome, 'blocks') if not os.path.exists(self.satoshiHome) or not os.path.exists(blockDir): return True # Get the cumulative size of the blk*.dat files blockDirSize = sum([os.path.getsize(os.path.join(blockDir, a)) \ for a in os.listdir(blockDir) if a.startswith('blk')]) sizeStr = bytesToHumanSize(blockDirSize) LOGINFO('Total size of files in %s is %s' % (blockDir, sizeStr)) # If they have only a small portion of the blockchain, do it szThresh = 100*MEGABYTE if USE_TESTNET else 6*GIGABYTE if blockDirSize < szThresh: return True # So far we know they have a BTC_HOME_DIR, with more than 6GB in blocks/ # The only thing that can induce torrent now is if we have a partially- # finished bootstrap file bigger than the blocks dir. bootFiles = ['',''] bootFiles[0] = os.path.join(self.satoshiHome, 'bootstrap.dat') bootFiles[1] = os.path.join(self.satoshiHome, 'bootstrap.dat.partial') for fn in bootFiles: if os.path.exists(fn): if os.path.getsize(fn) > blockDirSize: return True # Okay, we give up -- just download [the rest] via P2P return False ############################################################################# #def setSatoshiDir(self, newDir): #self.satoshiHome = newDir ############################################################################# def setupSDM(self, pathToBitcoindExe=None, satoshiHome=None, \ extraExeSearch=[], createHomeIfDNE=True): LOGDEBUG('Exec setupSDM') self.failedFindExe = False self.failedFindHome = False # If we are supplied a path, then ignore the extra exe search paths if pathToBitcoindExe==None: pathToBitcoindExe = self.findBitcoind(extraExeSearch) if len(pathToBitcoindExe)==0: LOGDEBUG('Failed to find bitcoind') self.failedFindExe = True else: LOGINFO('Found bitcoind in the following places:') for p in pathToBitcoindExe: LOGINFO(' %s', p) pathToBitcoindExe = pathToBitcoindExe[0] LOGINFO('Using: %s', pathToBitcoindExe) if not os.path.exists(pathToBitcoindExe): LOGINFO('Somehow failed to find exe even after finding it...?') self.failedFindExe = True self.executable = pathToBitcoindExe # Four possible conditions for already-set satoshi home dir, and input arg if satoshiHome is not None: self.satoshiHome = satoshiHome else: if self.satoshiHome is None: self.satoshiHome = BTC_HOME_DIR # If no new dir is specified, leave satoshi home if it's already set # Give it a default BTC_HOME_DIR if not. if not os.path.exists(self.satoshiHome): if createHomeIfDNE: LOGINFO('Making satoshi home dir') os.makedirs(self.satoshiHome) else: LOGINFO('No home dir, makedir not requested') self.failedFindHome = True if self.failedFindExe: raise self.BitcoindError, 'bitcoind not found' if self.failedFindHome: raise self.BitcoindError, 'homedir not found' self.disabled = False self.proxy = None self.bitcoind = None # this will be a Popen object self.isMidQuery = False self.last20queries = [] self.readBitcoinConf(makeIfDNE=True) ############################################################################# def setDisabled(self, newBool=True): s = self.getSDMState() if newBool==True: if s in ('BitcoindInitializing', 'BitcoindSynchronizing', 'BitcoindReady'): self.stopBitcoind() self.disabled = newBool ############################################################################# def getAllFoundExe(self): return list(self.foundExe) ############################################################################# def findBitcoind(self, extraSearchPaths=[]): self.foundExe = [] searchPaths = list(extraSearchPaths) # create a copy if OS_WINDOWS: # Making sure the search path argument comes with /daemon and /Bitcoin on Windows searchPaths.extend([os.path.join(sp, 'Bitcoin') for sp in searchPaths]) searchPaths.extend([os.path.join(sp, 'daemon') for sp in searchPaths]) possBaseDir = [] from platform import machine if '64' in machine(): possBaseDir.append(os.getenv("ProgramW6432")) possBaseDir.append(os.getenv('PROGRAMFILES(X86)')) else: possBaseDir.append(os.getenv('PROGRAMFILES')) # check desktop for links home = os.path.expanduser('~') desktop = os.path.join(home, 'Desktop') if os.path.exists(desktop): dtopfiles = os.listdir(desktop) for path in [os.path.join(desktop, fn) for fn in dtopfiles]: if 'bitcoin' in path.lower() and path.lower().endswith('.lnk'): import win32com.client shell = win32com.client.Dispatch('WScript.Shell') targ = shell.CreateShortCut(path).Targetpath targDir = os.path.dirname(targ) LOGINFO('Found Bitcoin-Qt link on desktop: %s', targDir) possBaseDir.append( targDir ) # Also look in default place in ProgramFiles dirs # Now look at a few subdirs of the searchPaths.extend(possBaseDir) searchPaths.extend([os.path.join(p, 'Bitcoin', 'daemon') for p in possBaseDir]) searchPaths.extend([os.path.join(p, 'daemon') for p in possBaseDir]) searchPaths.extend([os.path.join(p, 'Bitcoin') for p in possBaseDir]) for p in searchPaths: testPath = os.path.join(p, 'bitcoind.exe') if os.path.exists(testPath): self.foundExe.append(testPath) else: # In case this was a downloaded copy, make sure we traverse to bin/64 dir if SystemSpecs.IsX64: searchPaths.extend([os.path.join(p, 'bin/64') for p in extraSearchPaths]) else: searchPaths.extend([os.path.join(p, 'bin/32') for p in extraSearchPaths]) searchPaths.extend(['/usr/bin/', '/usr/lib/bitcoin/']) for p in searchPaths: testPath = os.path.join(p, 'bitcoind') if os.path.exists(testPath): self.foundExe.append(testPath) try: locs = subprocess_check_output(['whereis','bitcoind']).split() if len(locs)>1: locs = filter(lambda x: os.path.basename(x)=='bitcoind', locs) LOGINFO('"whereis" returned: %s', str(locs)) self.foundExe.extend(locs) except: LOGEXCEPT('Error executing "whereis" command') # For logging purposes, check that the first answer matches one of the # extra search paths. There should be some kind of notification that # their supplied search path was invalid and we are using something else. if len(self.foundExe)>0 and len(extraSearchPaths)>0: foundIt = False for p in extraSearchPaths: if self.foundExe[0].startswith(p): foundIt=True if not foundIt: LOGERROR('Bitcoind could not be found in the specified installation:') for p in extraSearchPaths: LOGERROR(' %s', p) LOGERROR('Bitcoind is being started from:') LOGERROR(' %s', self.foundExe[0]) return self.foundExe ############################################################################# def getGuardianPath(self): if OS_WINDOWS: armoryInstall = os.path.dirname(inspect.getsourcefile(SatoshiDaemonManager)) # This should return a zip file because of py2exe if armoryInstall.endswith('.zip'): armoryInstall = os.path.dirname(armoryInstall) gpath = os.path.join(armoryInstall, 'guardian.exe') else: theDir = os.path.dirname(inspect.getsourcefile(SatoshiDaemonManager)) gpath = os.path.join(theDir, 'guardian.py') if not os.path.exists(gpath): LOGERROR('Could not find guardian script: %s', gpath) raise FileExistsError return gpath ############################################################################# def readBitcoinConf(self, makeIfDNE=False): LOGINFO('Reading bitcoin.conf file') bitconf = os.path.join( self.satoshiHome, 'bitcoin.conf' ) if not os.path.exists(bitconf): if not makeIfDNE: raise self.BitcoinDotConfError, 'Could not find bitcoin.conf' else: LOGINFO('No bitcoin.conf available. Creating it...') touchFile(bitconf) # Guarantee that bitcoin.conf file has very strict permissions if OS_WINDOWS: if OS_VARIANT[0].lower()=='xp': LOGERROR('Cannot set permissions correctly in XP!') LOGERROR('Please confirm permissions on the following file ') LOGERROR('are set to exclusive access only for your user ') LOGERROR('(it usually is, but Armory cannot guarantee it ') LOGERROR('on XP systems):') LOGERROR(' %s', bitconf) else: LOGINFO('Setting permissions on bitcoin.conf') import ctypes username_u16 = ctypes.create_unicode_buffer(u'\0', 512) str_length = ctypes.c_int(512) ctypes.windll.Advapi32.GetUserNameW(ctypes.byref(username_u16), ctypes.byref(str_length)) if not CLI_OPTIONS.disableConfPermis: LOGINFO('Setting permissions on bitcoin.conf') cmd_icacls = [u'icacls',bitconf,u'/inheritance:r',u'/grant:r', u'%s:F' % username_u16.value] icacls_out = subprocess_check_output(cmd_icacls, shell=True) LOGINFO('icacls returned: %s', icacls_out) else: LOGWARN('Skipped setting permissions on bitcoin.conf file') else: LOGINFO('Setting permissions on bitcoin.conf') os.chmod(bitconf, stat.S_IRUSR | stat.S_IWUSR) with open(bitconf,'r') as f: # Find the last character of the each line: either a newline or '#' endchr = lambda line: line.find('#') if line.find('#')>1 else len(line) # Reduce each line to a list of key,value pairs separated with '=' allconf = [l[:endchr(l)].strip().split('=') for l in f.readlines()] # Need to convert to (x[0],x[1:]) in case the password has '=' in it allconfPairs = [[x[0], '='.join(x[1:])] for x in allconf if len(x)>1] # Convert the list of pairs to a dictionary self.bitconf = dict(allconfPairs) # Look for rpcport, use default if not there self.bitconf['rpcport'] = int(self.bitconf.get('rpcport', BITCOIN_RPC_PORT)) # We must have a username and password. If not, append to file if not self.bitconf.has_key('rpcuser'): LOGDEBUG('No rpcuser: creating one') with open(bitconf,'a') as f: f.write('\n') f.write('rpcuser=generated_by_armory\n') self.bitconf['rpcuser'] = 'generated_by_armory' if not self.bitconf.has_key('rpcpassword'): LOGDEBUG('No rpcpassword: creating one') with open(bitconf,'a') as f: randBase58 = SecureBinaryData().GenerateRandom(32).toBinStr() randBase58 = binary_to_base58(randBase58) f.write('\n') f.write('rpcpassword=%s' % randBase58) self.bitconf['rpcpassword'] = randBase58 if not isASCII(self.bitconf['rpcuser']): LOGERROR('Non-ASCII character in bitcoin.conf (rpcuser)!') if not isASCII(self.bitconf['rpcpassword']): LOGERROR('Non-ASCII character in bitcoin.conf (rpcpassword)!') self.bitconf['host'] = '127.0.0.1' ############################################################################# def cleanupFailedTorrent(self): # Right now I think don't do anything pass ############################################################################# def startBitcoind(self): self.btcOut, self.btcErr = None,None if self.disabled: LOGERROR('SDM was disabled, must be re-enabled before starting') return LOGINFO('Called startBitcoind') if self.isRunningBitcoind() or TheTDM.getTDMState()=='Downloading': raise self.BitcoindError, 'Looks like we have already started theSDM' if not os.path.exists(self.executable): raise self.BitcoindError, 'Could not find bitcoind' chk1 = os.path.exists(self.useTorrentFile) chk2 = self.shouldTryBootstrapTorrent() chk3 = TheTDM.getTDMState()=='ReadyToStart' if chk1 and chk2 and chk3: TheTDM.startDownload() else: self.launchBitcoindAndGuardian() ############################################################################# def launchBitcoindAndGuardian(self): pargs = [self.executable] if USE_TESTNET: testhome = self.satoshiHome[:] if self.satoshiHome.endswith('/testnet3/'): pargs.append('-datadir=%s' % self.satoshiHome[:-10]) elif self.satoshiHome.endswith('/testnet3'): pargs.append('-datadir=%s' % self.satoshiHome[:-9]) pargs.append('-testnet') else: pargs.append('-datadir=%s' % self.satoshiHome) try: # Don't want some strange error in this size-check to abort loading blocksdir = os.path.join(self.satoshiHome, 'blocks') sz = long(0) if os.path.exists(blocksdir): for fn in os.listdir(blocksdir): fnpath = os.path.join(blocksdir, fn) sz += long(os.path.getsize(fnpath)) if sz < 5*GIGABYTE: if SystemSpecs.Memory>9.0: pargs.append('-dbcache=2000') elif SystemSpecs.Memory>5.0: pargs.append('-dbcache=1000') elif SystemSpecs.Memory>3.0: pargs.append('-dbcache=500') except: LOGEXCEPT('Failed size check of blocks directory') # Startup bitcoind and get its process ID (along with our own) self.bitcoind = launchProcess(pargs) self.btcdpid = self.bitcoind.pid self.selfpid = os.getpid() LOGINFO('PID of bitcoind: %d', self.btcdpid) LOGINFO('PID of armory: %d', self.selfpid) # Startup guardian process -- it will watch Armory's PID gpath = self.getGuardianPath() pargs = [gpath, str(self.selfpid), str(self.btcdpid)] if not OS_WINDOWS: pargs.insert(0, 'python') launchProcess(pargs) ############################################################################# def stopBitcoind(self): LOGINFO('Called stopBitcoind') if not self.isRunningBitcoind(): LOGINFO('...but bitcoind is not running, to be able to stop') return killProcessTree(self.bitcoind.pid) killProcess(self.bitcoind.pid) time.sleep(1) self.bitcoind = None ############################################################################# def isRunningBitcoind(self): """ armoryengine satoshiIsAvailable() only tells us whether there's a running bitcoind that is actively responding on its port. But it won't be responding immediately after we've started it (still doing startup operations). If bitcoind was started and still running, then poll() will return None. Any othe poll() return value means that the process terminated """ if self.bitcoind==None: return False else: if not self.bitcoind.poll()==None: LOGDEBUG('Bitcoind is no more') if self.btcOut==None: self.btcOut, self.btcErr = self.bitcoind.communicate() LOGWARN('bitcoind exited, bitcoind STDOUT:') for line in self.btcOut.split('\n'): LOGWARN(line) LOGWARN('bitcoind exited, bitcoind STDERR:') for line in self.btcErr.split('\n'): LOGWARN(line) return self.bitcoind.poll()==None ############################################################################# def wasRunningBitcoind(self): return (not self.bitcoind==None) ############################################################################# def bitcoindIsResponsive(self): return satoshiIsAvailable(self.bitconf['host'], self.bitconf['rpcport']) ############################################################################# def getSDMState(self): """ As for why I'm doing this: it turns out that between "initializing" and "synchronizing", bitcoind temporarily stops responding entirely, which causes "not-available" to be the state. I need to smooth that out because it wreaks havoc on the GUI which will switch to showing a nasty error. """ state = self.getSDMStateLogic() self.circBufferState.append(state) self.circBufferTime.append(RightNow()) if len(self.circBufferTime)>2 and \ (self.circBufferTime[-1] - self.circBufferTime[1]) > 5: # Only remove the first element if we have at least 5s history self.circBufferState = self.circBufferState[1:] self.circBufferTime = self.circBufferTime[1:] # Here's where we modify the output to smooth out the gap between # "initializing" and "synchronizing" (which is a couple seconds # of "not available"). "NotAvail" keeps getting added to the # buffer, but if it was "initializing" in the last 5 seconds, # we will keep "initializing" if state=='BitcoindNotAvailable': if 'BitcoindInitializing' in self.circBufferState: LOGWARN('Overriding not-available state. This should happen 0-5 times') return 'BitcoindInitializing' return state ############################################################################# def getSDMStateLogic(self): if self.disabled: return 'BitcoindMgmtDisabled' if self.failedFindExe: return 'BitcoindExeMissing' if self.failedFindHome: return 'BitcoindHomeMissing' if TheTDM.isRunning(): return 'TorrentSynchronizing' latestInfo = self.getTopBlockInfo() if self.bitcoind==None and latestInfo['error']=='Uninitialized': return 'BitcoindNeverStarted' if not self.isRunningBitcoind(): # Not running at all: either never started, or process terminated if not self.btcErr==None and len(self.btcErr)>0: errstr = self.btcErr.replace(',',' ').replace('.',' ').replace('!',' ') errPcs = set([a.lower() for a in errstr.split()]) runPcs = set(['cannot','obtain','lock','already','running']) dbePcs = set(['database', 'recover','backup','except','wallet','dat']) if len(errPcs.intersection(runPcs))>=(len(runPcs)-1): return 'BitcoindAlreadyRunning' elif len(errPcs.intersection(dbePcs))>=(len(dbePcs)-1): return 'BitcoindDatabaseEnvError' else: return 'BitcoindUnknownCrash' else: return 'BitcoindNotAvailable' elif not self.bitcoindIsResponsive(): # Running but not responsive... must still be initializing return 'BitcoindInitializing' else: # If it's responsive, get the top block and check # TODO: These conditionals are based on experimental results. May # not be accurate what the specific errors mean... if latestInfo['error']=='ValueError': return 'BitcoindWrongPassword' elif latestInfo['error']=='JsonRpcException': return 'BitcoindInitializing' elif latestInfo['error']=='SocketError': return 'BitcoindNotAvailable' if 'BitcoindReady' in self.circBufferState: # If ready, always ready return 'BitcoindReady' # If we get here, bitcoind is gave us a response. secSinceLastBlk = RightNow() - latestInfo['toptime'] blkspersec = latestInfo['blkspersec'] #print 'Blocks per 10 sec:', ('UNKNOWN' if blkspersec==-1 else blkspersec*10) if secSinceLastBlk > 4*HOUR or blkspersec==-1: return 'BitcoindSynchronizing' else: if blkspersec*20 > 2 and not 'BitcoindReady' in self.circBufferState: return 'BitcoindSynchronizing' else: return 'BitcoindReady' ############################################################################# def createProxy(self, forceNew=False): if self.proxy==None or forceNew: LOGDEBUG('Creating proxy') usr,pas,hst,prt = [self.bitconf[k] for k in ['rpcuser','rpcpassword',\ 'host', 'rpcport']] pstr = 'http://%s:%s@%s:%d' % (usr,pas,hst,prt) LOGINFO('Creating proxy in SDM: host=%s, port=%s', hst,prt) self.proxy = ServiceProxy(pstr) ############################################################################# def __backgroundRequestTopBlock(self): self.createProxy() self.isMidQuery = True try: numblks = self.proxy.getinfo()['blocks'] blkhash = self.proxy.getblockhash(numblks) toptime = self.proxy.getblock(blkhash)['time'] #LOGDEBUG('RPC Call: numBlks=%d, toptime=%d', numblks, toptime) # Only overwrite once all outputs are retrieved self.lastTopBlockInfo['numblks'] = numblks self.lastTopBlockInfo['tophash'] = blkhash self.lastTopBlockInfo['toptime'] = toptime self.lastTopBlockInfo['error'] = None # Holds error info if len(self.last20queries)==0 or \ (RightNow()-self.last20queries[-1][0]) > 0.99: # This conditional guarantees last 20 queries spans at least 20s self.last20queries.append([RightNow(), numblks]) self.last20queries = self.last20queries[-20:] t0,b0 = self.last20queries[0] t1,b1 = self.last20queries[-1] # Need at least 10s of data to give meaning answer if (t1-t0)<10: self.lastTopBlockInfo['blkspersec'] = -1 else: self.lastTopBlockInfo['blkspersec'] = float(b1-b0)/float(t1-t0) except ValueError: # I believe this happens when you used the wrong password LOGEXCEPT('ValueError in bkgd req top blk') self.lastTopBlockInfo['error'] = 'ValueError' except authproxy.JSONRPCException: # This seems to happen when bitcoind is overwhelmed... not quite ready LOGDEBUG('generic jsonrpc exception') self.lastTopBlockInfo['error'] = 'JsonRpcException' except socket.error: # Connection isn't available... is bitcoind not running anymore? LOGDEBUG('generic socket error') self.lastTopBlockInfo['error'] = 'SocketError' except: LOGEXCEPT('generic error') self.lastTopBlockInfo['error'] = 'UnknownError' raise finally: self.isMidQuery = False ############################################################################# def updateTopBlockInfo(self): """ We want to get the top block information, but if bitcoind is rigorously downloading and verifying the blockchain, it can sometimes take 10s to to respond to JSON-RPC calls! We must do it in the background... If it's already querying, no need to kick off another background request, just return the last value, which may be "stale" but we don't really care for this particular use-case """ if not self.isRunningBitcoind(): return if self.isMidQuery: return self.createProxy() self.queryThread = PyBackgroundThread(self.__backgroundRequestTopBlock) self.queryThread.start() ############################################################################# def getTopBlockInfo(self): if self.isRunningBitcoind(): self.updateTopBlockInfo() self.queryThread.join(0.001) # In most cases, result should come in 1 ms # We return a copy so that the data is not changing as we use it return self.lastTopBlockInfo.copy() ############################################################################# def callJSON(self, func, *args): state = self.getSDMState() if not state in ('BitcoindReady', 'BitcoindSynchronizing'): LOGERROR('Called callJSON(%s, %s)', func, str(args)) LOGERROR('Current SDM state: %s', state) raise self.BitcoindError, 'callJSON while %s'%state return self.proxy.__getattr__(func)(*args) ############################################################################# def returnSDMInfo(self): sdminfo = {} for key,val in self.bitconf.iteritems(): sdminfo['bitconf_%s'%key] = val for key,val in self.lastTopBlockInfo.iteritems(): sdminfo['topblk_%s'%key] = val sdminfo['executable'] = self.executable sdminfo['isrunning'] = self.isRunningBitcoind() sdminfo['homedir'] = self.satoshiHome sdminfo['proxyinit'] = (not self.proxy==None) sdminfo['ismidquery'] = self.isMidQuery sdminfo['querycount'] = len(self.last20queries) return sdminfo ############################################################################# def printSDMInfo(self): print '\nCurrent SDM State:' print '\t', 'SDM State Str'.ljust(20), ':', self.getSDMState() for key,value in self.returnSDMInfo().iteritems(): print '\t', str(key).ljust(20), ':', str(value) armory-0.92.3/osxbuild_old_higuys/0000755000000000000000000000000012414772654015707 5ustar rootrootarmory-0.92.3/osxbuild_old_higuys/Armory0000755000000000000000000000033512414772654017107 0ustar rootroot#!/bin/bash cd "${0%/*}" export DYLD_LIBRARY_PATH=../Dependencies/QtCore.framework/Versions/Current:../Dependencies/QtGui.framework/Versions/Current:../Dependencies:$DYLD_LIBRARY_PATH bin/python armorybuild/ArmoryQt.pyc armory-0.92.3/osxbuild_old_higuys/deploy.sh0000755000000000000000000000564612414772654017555 0ustar rootroot#!/bin/bash # We will actually won't be signing on this computer. #CERTIFICATE="None" function clean() { echo "Removing previous installation..." # delete env and app sudo rm -rf Armory.app env } function get_dependencies() { # get build dependencies echo "Installing dependencies..." brew install cryptopp swig qt pyqt wget sudo pip install virtualenv sudo pip install psutil } function make_env() { echo "Making python environment..." virtualenv -q env cd env bin/pip install twisted >/dev/null bin/pip install psutil # move global pyqt into the env # do sip first cp -r /usr/local/Cellar/sip/4.*/lib/python2.*/site-packages/ lib/python2.*/site-packages/ cp -r /usr/local/Cellar/sip/4.*/include/ include/ cp -r /usr/local/Cellar/sip/4.*/bin/ bin/ # now pyqt cp -r /usr/local/Cellar/pyqt/4.*/lib/python2.*/site-packages/PyQt4 lib/python2.*/site-packages/ cp -r /usr/local/Cellar/pyqt/4.*/share/ share/ cp -r /usr/local/Cellar/pyqt/4.*/bin/ bin/ cd .. } function make_app() { echo "Creating Armory.app..." mkdir -p Armory.app/Contents/Dependencies mkdir -p Armory.app/Contents/Resources # insert python cp -r env Armory.app/Contents/MacOS # insert qt frameworks cp -r /usr/local/lib/QtCore.framework Armory.app/Contents/Dependencies/QtCore.framework cp -r /usr/local/lib/QtGui.framework Armory.app/Contents/Dependencies/QtGui.framework cp /usr/local/lib/libpng15.15.dylib Armory.app/Contents/Dependencies/libpng15.15.dylib # essential .app stuff cp Armory Armory.app/Contents/MacOS/Armory chmod +x Armory.app/Contents/MacOS/Armory cp Info.plist Armory.app/Contents/Info.plist cp ../img/armory_icon_fullres.icns Armory.app/Contents/Resources/Icon.icns } function build_armory() { echo "Building Armory..." cd .. # root dir make >/dev/null # keeping stderror python -m py_compile *.py # compile to pyc python -m py_compile jsonrpc/*.py # compile to pyc echo "Moving Armory to app..." mkdir -p osxbuild/Armory.app/Contents/MacOS/armorybuild # osxbuild has to be excluded, otherwise there will be recursion hell # plus some other stuff has to be removed, so let's use this huge thing tar cf - --exclude=osxbuild --exclude=cppForSwig --exclude=dpkgfiles --exclude=extras \ --exclude=windowsbuild --exclude=*.txt --exclude=.git --exclude=.gitignore --exclude=*.py --exclude=Makefile \ * 2>&1 | (cd osxbuild/Armory.app/Contents/MacOS/armorybuild && tar xvf -) >/dev/null 2>&1 cd osxbuild } function finish() { # codesign -s $CERTIFICATE Armory.app rm -rf Armory.app/Contents/MacOS/lib/python2.*/lib-dynload rm -rf Armory.app/Contents/MacOS/lib/python2.*/config rm -rf Armory.app/Contents/MacOS/lib/python2.*/encodings } cd "${0%/*}" get_dependencies if [ ! -d env ]; then make_env fi if [ ! -d Armory.app ]; then make_app fi build_armory finish armory-0.92.3/osxbuild_old_higuys/Info.plist0000644000000000000000000000126012414772654017656 0ustar rootroot CFBundleDisplayName Armory Bitcoin Client CFBundleExecutable Armory CFBundleIdentifier com.armory.armory CFBundleIconFile Icon CFBundleInfoDictionaryVersion 0.87.2 CFBundleName Armory Bitcoin Client NSPrincipalClass NSApplication LSMinimumSystemVersion 10.6.0 armory-0.92.3/edit_icons.bat0000644000000000000000000000036212414772654014441 0ustar rootroot@CLS @SET CURRENT_DIR="%CD%" @SET BATH_DIR="%~dp0" @CD %BATH_DIR% || EXIT 100 @CD .. || EXIT 100 @CD .. || EXIT 100 @SET PATH=%PATH%;%CD% @CD %BATH_DIR% || EXIT 100 rtc.exe /L:"%~dp0\log.txt" /F:edit_icons.rts @CD %CURRENT_DIR% || EXIT 100 armory-0.92.3/samplemodules/0000755000000000000000000000000012414772654014502 5ustar rootrootarmory-0.92.3/samplemodules/testPlugin.py0000644000000000000000000002544412414772654017223 0ustar rootroot# This is a sample plugin file that will be used to create a new tab # in the Armory main window. All plugin files (such as this one) will # be injected with the globals() from ArmoryQt.py, which includes pretty # much all of Bitcoin & Armory related stuff that you need. So this # file can use any utils or objects accessible to functions in ArmoryQt.py. import ast import urllib2 from PyQt4.Qt import QPushButton, SIGNAL, Qt, QLineEdit, QTableWidget, \ QGridLayout, QSpacerItem, QWidget, QScrollArea, QTableWidgetItem from armorycolors import htmlColor from armoryengine.ArmoryUtils import RightNow, secondsToHumanTime, coin2str from armoryengine.BDM import TheBDM from qtdefines import makeHorizFrame, makeVertFrame, STYLE_PLAIN, QRichLabel, \ GETFONT # ArmoryQt will access this by importing PluginObject and initializing one # -- It adds plugin.getTabToDisplay() to the main window tab list # -- It uses plugin.tabName as the label for that tab. # -- It uses plugin.tabName as the label for that tab. # # Make sure you test your plugin not only when it's online, but also when # -- Armory is in offline mode, and internet is not accessible # -- Armory is in offline mode, and internet *is* accessible # -- User uses skip-offline-check so online, but service can't be reached class PluginObject(object): tabName = 'Exchange Rates' maxVersion = '0.92' ############################################################################# def __init__(self, main): self.main = main ########################################################################## ##### Display the conversion values based on the Coinbase API self.lastPriceFetch = 0 self.lblHeader = QRichLabel(tr("""Tracking buy and sell prices on Coinbase every 60 seconds"""), doWrap=False) self.lblLastTime = QRichLabel('', doWrap=False) self.lblSellLabel = QRichLabel(tr('Coinbase Sell Price (USD):'), doWrap=False) self.lblBuyLabel = QRichLabel(tr('Coinbase Buy Price (USD):'), doWrap=False) self.lblSellPrice = QRichLabel('') self.lblBuyPrice = QRichLabel('') self.lastSellStr = '' self.lastBuyStr = '' self.btnUpdate = QPushButton(tr('Check Now')) self.main.connect(self.btnUpdate, SIGNAL('clicked()'), self.checkUpdatePrice) ########################################################################## ##### A calculator for converting prices between USD and BTC lblCalcTitle = QRichLabel(tr("""Convert between USD and BTC using Coinbase sell price"""), hAlign=Qt.AlignHCenter, doWrap=False) self.edtEnterUSD = QLineEdit() self.edtEnterBTC = QLineEdit() self.lblEnterUSD1 = QRichLabel('$') self.lblEnterUSD2 = QRichLabel('USD') self.lblEnterBTC = QRichLabel('BTC') btnClear = QPushButton('Clear') self.main.connect(self.edtEnterUSD, SIGNAL('textEdited(QString)'), self.updateCalcBTC) self.main.connect(self.edtEnterBTC, SIGNAL('textEdited(QString)'), self.updateCalcUSD) def clearCalc(): self.edtEnterUSD.setText('') self.edtEnterBTC.setText('') self.main.connect(btnClear, SIGNAL('clicked()'), clearCalc) frmCalcMid = makeHorizFrame( [self.lblEnterUSD1, self.edtEnterUSD, self.lblEnterUSD2, 'Stretch', self.edtEnterBTC, self.lblEnterBTC]) frmCalcClear = makeHorizFrame(['Stretch', btnClear, 'Stretch']) frmCalc = makeVertFrame([lblCalcTitle, frmCalcMid, frmCalcClear], STYLE_PLAIN) ########################################################################## ##### A table showing you the total balance of each wallet in USD and BTC lblWltTableTitle = QRichLabel(tr("Wallet balances converted to USD"), doWrap=False, hAlign=Qt.AlignHCenter) numWallets = len(self.main.walletMap) self.wltTable = QTableWidget(self.main) self.wltTable.setRowCount(numWallets) self.wltTable.setColumnCount(4) self.wltTable.horizontalHeader().setStretchLastSection(True) self.wltTable.setMinimumWidth(600) ########################################################################## ##### Setup the main layout for the tab mainLayout = QGridLayout() i=0 mainLayout.addWidget(self.lblHeader, i,0, 1,3) i+=1 mainLayout.addItem(QSpacerItem(15,15), i,0) mainLayout.addWidget(self.lblSellLabel, i,1) mainLayout.addWidget(self.lblSellPrice, i,2) i+=1 mainLayout.addItem(QSpacerItem(15,15), i,0) mainLayout.addWidget(self.lblBuyLabel, i,1) mainLayout.addWidget(self.lblBuyPrice, i,2) i+=1 mainLayout.addWidget(self.lblLastTime, i,0, 1,2) mainLayout.addWidget(self.btnUpdate, i,2) i+=1 mainLayout.addItem(QSpacerItem(20,20), i,0) i+=1 mainLayout.addWidget(frmCalc, i,0, 1,3) i+=1 mainLayout.addItem(QSpacerItem(30,30), i,0) i+=1 mainLayout.addWidget(lblWltTableTitle, i,0, 1,3) i+=1 mainLayout.addWidget(self.wltTable, i,0, 1,3) mainLayout.setColumnStretch(0,0) mainLayout.setColumnStretch(1,1) mainLayout.setColumnStretch(2,1) tabWidget = QWidget() tabWidget.setLayout(mainLayout) frmH = makeHorizFrame(['Stretch', tabWidget, 'Stretch']) frm = makeVertFrame(['Space(20)', frmH, 'Stretch']) # Now set the scrollarea widget to the layout self.tabToDisplay = QScrollArea() self.tabToDisplay.setWidgetResizable(True) self.tabToDisplay.setWidget(frm) ############################################################################# def getTabToDisplay(self): return self.tabToDisplay ############################################################################# def addCommasToPrice(self, pstr): dispStr = pstr.strip().split('.')[0] dispStr = ','.join([dispStr[::-1][3*i:3*(i+1)][::-1] \ for i in range((len(dispStr)-1)/3+1)][::-1]) if '.' in pstr: dispStr = dispStr + '.' + pstr.split('.')[1] return dispStr ############################################################################# def fetchFormattedPrice(self, url): sock = urllib2.urlopen(url) value = ast.literal_eval(sock.read())['subtotal']['amount'] return self.addCommasToPrice(value) ############################################################################# def checkUpdatePrice(self): urlBase = 'http://coinbase.com/api/v1/prices/' urlSell = urlBase + 'sell' urlBuy = urlBase + 'buy' try: self.lastSellStr = self.fetchFormattedPrice(urlSell) self.lastBuyStr = self.fetchFormattedPrice(urlBuy) self.lblSellPrice.setText('$%s / BTC' % \ (htmlColor('TextBlue'), self.lastSellStr)) self.lblBuyPrice.setText( '$%s / BTC' % \ (htmlColor('TextBlue'), self.lastBuyStr)) self.lastPriceFetch = RightNow() self.updateLastTimeStr() self.updateWalletTable() self.updateCalcUSD(self.edtEnterBTC.text()) except: #LOGEXCEPT('Failed to fetch price data from %s' % urlBase) pass ############################################################################# def updateLastTimeStr(self): secs = RightNow() - self.lastPriceFetch tstr = 'Less than 1 min' if secs > 60: tstr = secondsToHumanTime(secs) self.lblLastTime.setText(tr("""Last updated: %s ago""") % (htmlColor('DisableFG'), tstr)) ############################################################################# def injectGoOnlineFunc(self, topBlock): self.checkUpdatePrice() ############################################################################# def injectHeartbeatAlwaysFunc(self): # Check the price every 60 seconds, update widgets self.updateLastTimeStr() if RightNow() < self.lastPriceFetch+60: return self.lastPriceFetch = RightNow() self.checkUpdatePrice() ############################################################################# def updateCalcUSD(self, newBTCVal): try: convertVal = float(self.lastSellStr.replace(',','')) usdVal = convertVal * float(newBTCVal.replace(',','')) self.edtEnterUSD.setText(self.addCommasToPrice('%0.2f' % usdVal)) except: self.edtEnterUSD.setText('') ############################################################################# def updateCalcBTC(self, newUSDVal): try: convertVal = float(self.lastSellStr.replace(',','')) btcVal = float(newUSDVal.replace(',','')) / convertVal self.edtEnterBTC.setText(self.addCommasToPrice('%0.8f' % btcVal)) except: self.edtEnterBTC.setText('') ############################################################################# def updateWalletTable(self): numWallets = len(self.main.walletMap) self.wltTable.setRowCount(numWallets) self.wltTable.setColumnCount(4) row = 0 for wltID,wltObj in self.main.walletMap.iteritems(): wltValueBTC = '(...)' wltValueUSD = '(...)' if TheBDM.getBDMState()=='BlockchainReady': convertVal = float(self.lastSellStr.replace(',','')) wltBal = wltObj.getBalance('Total') wltValueBTC = coin2str(wltBal, maxZeros=2) wltValueUSD = '$' + self.addCommasToPrice('%0.2f' % (wltBal*convertVal/1e8)) rowItems = [] rowItems.append(QTableWidgetItem(wltID)) rowItems.append(QTableWidgetItem(wltObj.labelName)) rowItems.append(QTableWidgetItem(wltValueBTC)) rowItems.append(QTableWidgetItem(wltValueUSD)) rowItems[-2].setTextAlignment(Qt.AlignRight) rowItems[-1].setTextAlignment(Qt.AlignRight) rowItems[-2].setFont(GETFONT('Fixed', 10)) rowItems[-1].setFont(GETFONT('Fixed', 10)) for i,item in enumerate(rowItems): self.wltTable.setItem(row, i, item) item.setFlags(Qt.NoItemFlags) self.wltTable.setHorizontalHeaderItem(0, QTableWidgetItem(tr('Wallet ID'))) self.wltTable.setHorizontalHeaderItem(1, QTableWidgetItem(tr('Wallet Name'))) self.wltTable.setHorizontalHeaderItem(2, QTableWidgetItem(tr('BTC Balance'))) self.wltTable.setHorizontalHeaderItem(3, QTableWidgetItem(tr('USD ($) Value'))) self.wltTable.verticalHeader().hide() row += 1 armory-0.92.3/samplemodules/LoggingPlugin.py0000644000000000000000000000565112414772654017630 0ustar rootroot# This is a sample plugin file that will be used to create a new tab # in the Armory main window. All plugin files (such as this one) will # be injected with the globals() from ArmoryQt.py, which includes pretty # much all of Bitcoin & Armory related stuff that you need. So this # file can use any utils or objects accessible to functions in ArmoryQt.py. from PyQt4.Qt import QPushButton, SIGNAL, QTextEdit, QScrollArea, QTabWidget from armoryengine.ArmoryUtils import getLastBytesOfFile, ARMORY_LOG_FILE,\ ARMCPP_LOG_FILE from qtdefines import QRichLabel, makeHorizFrame, GETFONT, relaxedSizeNChar, \ makeVertFrame from PyQt4 import QtGui # ArmoryQt will access this by importing PluginObject and initializing one # -- It adds plugin.getTabToDisplay() to the main window tab list # -- It uses plugin.tabName as the label for that tab. # # Make sure you test your plugin not only when it's online, but also when # -- Armory is in offline mode, and internet is not accessible # -- Armory is in offline mode, and internet *is* accessible # -- User uses skip-offline-check so online, but service can't be reached class PluginObject(object): tabName = 'Armory Log' maxVersion = '0.92' ############################################################################# def __init__(self, main): self.main = main def updateLogDisplay(): self.pyLogTextDisplay.setText(getLastBytesOfFile(ARMORY_LOG_FILE)) self.pyLogTextDisplay.moveCursor(QtGui.QTextCursor.End) self.cppLogTextDisplay.setText(getLastBytesOfFile(ARMCPP_LOG_FILE)) self.cppLogTextDisplay.moveCursor(QtGui.QTextCursor.End) lblHeader = QRichLabel(tr("""Log File Display"""), doWrap=False) self.updateButton = QPushButton("Update") self.main.connect(self.updateButton, SIGNAL('clicked()'), updateLogDisplay) topRow = makeHorizFrame([lblHeader, self.updateButton, 'stretch']) self.pyLogTextDisplay = self.createLogDisplay() self.cppLogTextDisplay = self.createLogDisplay() logTabPanel = QTabWidget() logTabPanel.addTab(self.pyLogTextDisplay, "Python Log") logTabPanel.addTab(self.cppLogTextDisplay, "C++ Log") self.logFrame = makeVertFrame([topRow, logTabPanel ]) # Now set the scrollarea widget to the layout self.tabToDisplay = QScrollArea() self.tabToDisplay.setWidgetResizable(True) self.tabToDisplay.setWidget(self.logFrame) updateLogDisplay() def createLogDisplay(self): logTextDisplay = QTextEdit() logTextDisplay.setFont(GETFONT('Fixed', 8)) w,h = relaxedSizeNChar(logTextDisplay, 68)[0], int(12 * 8.2) logTextDisplay.setMinimumWidth(w) logTextDisplay.setMinimumHeight(h) logTextDisplay.setReadOnly(True) return logTextDisplay ############################################################################# def getTabToDisplay(self): return self.tabToDisplay armory-0.92.3/osxbuild/0000755000000000000000000000000012414772654013461 5ustar rootrootarmory-0.92.3/osxbuild/osx_build_notes.txt0000644000000000000000000000244612414772654017430 0ustar rootrootThis directory was prepared by forum user, "picobit", and reviewed by the ATI team. These notes describe what had to be done on fresh installs of OS X 10.7 (Lion), 10.8 (Mountain Lion) and 10.9 (Mavericks) in order to get build-app.py working. (1) Install xcode from the Apple store (free) (2) From within xcode, install the command-line utilities "Xcode" --> "Preferences" --> "Downloads" (3) You may also have to run "xcode-select --install" from the terminal. You will have to click through an EULA and a few other dialogs. (4) From Red Emerald's preparation steps for compiling Armory on Mac (https://gist.github.com/WyseNynja/4200620), execute the following to install and update brew: $ ruby -e "$(curl -fsSL https://raw.github.com/Homebrew/homebrew/go/install)" $ touch ~/.bashrc $ echo "export CFLAGS=\"-arch x86_64\"" >> ~/.bashrc $ echo "export ARCHFLAGS=\"-arch x86_64\"" >> ~/.bashrc $ source ~/.bashrc $ brew update $ brew doctor (5) Execute "brew install swig" (6) "cd" into the "osxbuild" directory, and execute "python build-app.py". Armory will be found under the "workspace" subdirectory. Armory.app can be moved elsewhere on the system, including under /Applications so that it's accessible by the OS X Launchpad. armory-0.92.3/osxbuild/QTBUG-39644.patch0000644000000000000000000000101012414772654016043 0ustar rootroot--- ./src/gui/kernel/qcocoaapplicationdelegate_mac.mm 2014-07-10 20:22:45.000000000 -0400 +++ ./src/gui/kernel/qcocoaapplicationdelegate_mac.mm 2014-07-10 20:19:23.000000000 -0400 @@ -122,7 +122,7 @@ static void cleanupCocoaApplicationDeleg [dockMenu release]; [qtMenuLoader release]; if (reflectionDelegate) { - [NSApp setDelegate:reflectionDelegate]; + [[NSApplication sharedApplication] setDelegate:reflectionDelegate]; [reflectionDelegate release]; } [super dealloc]; armory-0.92.3/osxbuild/armoryd-script.sh0000755000000000000000000000277512414772654017012 0ustar rootroot#!/bin/bash # This is the initial driver script executed by the armoryd application on OS X. # Its role is to set up the environment before passing control to Python. # NB: If any changes are made to this script, you'll probably need to make the # same changes to the Armory script. # Set environment variables so the Python executable finds its stuff. # Note that `dirname $0` gives a relative path. We'd like the absolute path. DIRNAME="$( cd "$( dirname "${BASH_SOURCE[0]}" )" && pwd )" ARMORYDIR="$DIRNAME/py/usr/lib/armory" LIBDIR="$DIRNAME/../Dependencies" FRDIR="$DIRNAME/../Frameworks" export PYTHONPATH="$ARMORYDIR" export DYLD_LIBRARY_PATH="${LIBDIR}:${FRDIR}" export DYLD_FRAMEWORK_PATH="${LIBDIR}:${FRDIR}" # Misc. crap to keep around in case it's ever needed. #OSXVER=`sw_vers -productVersion | awk '{ print substr( $0, 0, 4 ) }'` #if [ $# == "0" ]; then # <-- If 0 CL args.... # OS X has a quirk. For whatever reasons, if you execute Python from a different # location than the location of what actually gets executed when you run Armory, # the menu bar calls Armory "Python". However, if you symlink Python and run the # symlink from the execution directory, the app name from Info.plist is used. # Also, the link should be here so that the link works wherever this is # executed, and not just on the build machine. ln -sf "$FRDIR/Python.framework/Versions/2.7/Resources/Python.app/Contents/MacOS/Python" "$DIRNAME/Python" # Call armoryd and get this party started! "$DIRNAME/Python" "$ARMORYDIR/armoryd.py" "$@" armory-0.92.3/osxbuild/QTBUG-40585.patch0000644000000000000000000001577712414772654016070 0ustar rootroot--- src/gui/kernel/qeventdispatcher_mac.mm 2014-08-02 14:07:52.000000000 -0400 +++ src/gui/kernel/qeventdispatcher_mac.mm 2014-08-05 16:35:27.000000000 -0400 @@ -558,7 +558,6 @@ // In case we end up recursing while we now process events, make sure // that we send remaining posted Qt events before this call returns: - wakeUp(); emit awake(); bool excludeUserEvents = flags & QEventLoop::ExcludeUserInputEvents; @@ -600,8 +599,35 @@ // [NSApp run], which is the normal code path for cocoa applications. if (NSModalSession session = d->currentModalSession()) { QBoolBlocker execGuard(d->currentExecIsNSAppRun, false); - while ([NSApp runModalSession:session] == NSRunContinuesResponse && !d->interrupt) - qt_mac_waitForMoreModalSessionEvents(); + + // OSX 10.9 appears to tighten up its internal code such that + // sessions shouldn't be used once they've been freed, which + // could happen in the else condition of the if(canExec) + // statement. Add extra logic to make sure we don't use the + // session once the current modal session is freed. We stop if + // the session is no longer current or if runModalSession() + // indicates the modal session is no longer continuing. + bool stayInLoop = true; + while (!d->interrupt && stayInLoop) { + // Mavericks deprecated the status we wish to check. + NSInteger checkStatus = 0; + if(QSysInfo::MacintoshVersion < QSysInfo::MV_10_9) { + checkStatus = NSRunContinuesResponse; + } + else { + checkStatus = NSModalResponseContinue; + } + if([NSApp runModalSession:session] == checkStatus) { + qt_mac_waitForMoreModalSessionEvents(); + } + else { + stayInLoop = false; + } + + if(session != d->currentModalSession()) { + stayInLoop = false; + } + } if (!d->interrupt && session == d->currentModalSessionCached) { // Someone called [NSApp stopModal:] from outside the event @@ -610,8 +636,7 @@ d->temporarilyStopAllModalSessions(); } - // Clean up the modal session list, call endModalSession. - if (d->cleanupModalSessionsNeeded) { + if (d->cleanupModalSessionsNeeded) { d->cleanupModalSessions(); } @@ -632,15 +657,23 @@ // to use cocoa's native way of running modal sessions: if (flags & QEventLoop::WaitForMoreEvents) qt_mac_waitForMoreModalSessionEvents(); + + // Mavericks deprecated the status we wish to check. + NSInteger checkStatus = 0; + if(QSysInfo::MacintoshVersion < QSysInfo::MV_10_9) { + checkStatus = NSRunContinuesResponse; + } + else { + checkStatus = NSModalResponseContinue; + } NSInteger status = [NSApp runModalSession:session]; - if (status != NSRunContinuesResponse && session == d->currentModalSessionCached) { + if (status != checkStatus && session == d->currentModalSessionCached) { // INVARIANT: Someone called [NSApp stopModal:] from outside the event // dispatcher (e.g to stop a native dialog). But that call wrongly stopped // 'session' as well. As a result, we need to restart all internal sessions: d->temporarilyStopAllModalSessions(); } - // Clean up the modal session list, call endModalSession. if (d->cleanupModalSessionsNeeded) { d->cleanupModalSessions(); } @@ -835,6 +868,7 @@ if (info.session) { [NSApp endModalSession:info.session]; info.session = 0; + [(NSWindow*) info.nswindow release]; } } currentModalSessionCached = 0; @@ -935,12 +969,15 @@ currentModalSessionCached = info.session; break; } - cocoaModalSessionStack.remove(i); currentModalSessionCached = 0; if (info.session) { + Q_ASSERT(info.nswindow != 0); [NSApp endModalSession:info.session]; [(NSWindow *)info.nswindow release]; } + + // remove the info now that we are finished with it + cocoaModalSessionStack.remove(i); } updateChildrenWorksWhenModal(); @@ -949,6 +986,8 @@ void QEventDispatcherMacPrivate::beginModalSession(QWidget *widget) { + QEventDispatcherMac::instance()->interrupt(); + // Add a new, empty (null), NSModalSession to the stack. // It will become active the next time QEventDispatcher::processEvents is called. // A QCocoaModalSessionInfo is considered pending to become active if the widget pointer @@ -970,16 +1009,20 @@ // when we stop the _current_ modal session (which is the session on top of // the stack, and might not belong to 'widget'). int stackSize = cocoaModalSessionStack.size(); + int endedSessions = 0; for (int i=stackSize-1; i>=0; --i) { QCocoaModalSessionInfo &info = cocoaModalSessionStack[i]; + if (!info.widget) { + endedSessions++; + } if (info.widget == widget) { info.widget = 0; - if (i == stackSize-1) { + if (i + endedSessions == stackSize-1) { // The top sessions ended. Interrupt the event dispatcher // to start spinning the correct session immidiatly: + QEventDispatcherMac::instance()->interrupt(); currentModalSessionCached = 0; cleanupModalSessionsNeeded = true; - QEventDispatcherMac::instance()->interrupt(); } } } @@ -1056,8 +1099,9 @@ } #ifdef QT_MAC_USE_COCOA - if (d->cleanupModalSessionsNeeded && d->currentExecIsNSAppRun) + if (d->cleanupModalSessionsNeeded && d->currentExecIsNSAppRun) { d->cleanupModalSessions(); + } #endif if (d->interrupt) { @@ -1067,8 +1111,9 @@ // [NSApplication run] is running the event loop, we // delayed stopping it until now (to let cocoa process // pending cocoa events first). - if (d->currentModalSessionCached) + if (d->currentModalSessionCached) { d->temporarilyStopAllModalSessions(); + } [NSApp stop:NSApp]; d->cancelWaitForMoreEvents(); } armory-0.92.3/osxbuild/build-app.py0000755000000000000000000010232112414772654015712 0ustar rootroot#!/usr/env python """Build Armory as a Mac OS X Application.""" import os from os import path import sys import hashlib import shutil import glob import time import datetime import optparse import tarfile from subprocess import Popen, PIPE # Set some constants up front #swigBinVer = '2.0.12' pythonVer = '2.7.8' setToolVer = '5.4.1' pipVer = '1.5.6' psutilVer = '2.1.1' zopeVer = '4.1.1' twistedVer = '14.0.0' libpngVer = '1.6.12' qtVer = '4.8.6' sipVer = '4.16.2' # NB: I'm occasionally forced to upgrade alongside PyQt. pyQtVer = '4.11.1' # NB: When I'm upgraded, SIP usually has to be upgraded too. webkitRev = '170685' LOGFILE = 'build-app.log.txt' LOGPATH = path.abspath( path.join(os.getcwd(), LOGFILE)) ARMORYDIR = '..' WORKDIR = path.join(os.getcwd(), 'workspace') APPDIR = path.join(WORKDIR, 'Armory.app') # actually make it local DLDIR = path.join(WORKDIR, 'downloads') UNPACKDIR = path.join(WORKDIR, 'unpackandbuild') #SWIGDIR = path.join(UNPACKDIR, 'swig', swigBinVer) INSTALLDIR = path.join(WORKDIR, 'install') PYPREFIX = path.join(APPDIR, 'Contents/Frameworks/Python.framework/Versions/2.7') PYSITEPKGS = path.join(PYPREFIX, 'lib/python2.7/site-packages') MAKEFLAGS = '-j4' QTBUILTFLAG = path.join(UNPACKDIR, 'qt/qt_install_success.txt') #pypath_txt_template=""" PYTHON_INCLUDE=%s/include/python2.7/ PYTHON_LIB=%s/lib/python2.7/config/libpython2.7.a PYVER=python2.7 """ pypathData = 'PYTHON_INCLUDE=%s/include/python2.7/' % PYPREFIX pypathData += '\nPYTHON_LIB=%s/lib/python2.7/config/libpython2.7.a' % PYPREFIX pypathData += '\nPYTHON_LIB_DIR=%s/lib/python2.7/config/' % PYPREFIX pypathData += '\nPYVER=python2.7' # If no arguments specified, then do the minimal amount of work necessary # Assume that only one flag is specified. These should be parser = optparse.OptionParser(usage="%prog [options]\n") parser.add_option('--fromscratch', dest='fromscratch', default=False, action='store_true', help='Remove all prev-downloaded: redownload and rebuild all') parser.add_option('--rebuildall', dest='rebuildall', default=False, action='store_true', help='Remove all prev-built; no redownload, only rebuild') parser.add_option('--qtcheckout', dest='qtcheckout', default='4.8', type='str', help='Specify commit to checkout, after a pull') parser.add_option('--qtupdate', dest='qtupdate', default=False, action='store_true', help='Rebuild only qt libraries, if already built') parser.add_option('--qtrebuild', dest='qtrebuild', default=False, action='store_true', help='Rebuild only qt libraries, if already built') parser.add_option('--precompiledQt',dest='precompiledQt',default=False, action='store_true', help='Download and use a precompiled version of Qt') (CLIOPTS, CLIARGS) = parser.parse_args() ################################################################################ # Now actually start the download&build process # Make sure all the dirs exist def main(): if path.exists(LOGFILE): os.remove(LOGFILE) delete_prev_data(CLIOPTS) makedir(WORKDIR) makedir(DLDIR) makedir(UNPACKDIR) makedir(INSTALLDIR) # For git repos, the "ID" is branch name. Otherwise, its' the md5sum for pkgname, fname, url, ID in distfiles: logprint('\n\n') # Skip download of Qt-git if downloading Qt, and vice versa. #if((pkgname.lower()=='qt-git' and CLIOPTS.precompiledQt) or \ # (pkgname.lower()=='qt' and not CLIOPTS.precompiledQt) ): # continue downloadPkg(pkgname, fname, url, ID) logprint("\n\nALL DOWNLOADS COMPLETED.\n\n") make_empty_app() compile_python() compile_pip() install_libpng() install_qt() compile_sip() compile_pyqt() compile_zope() compile_twisted() compile_psutil() #unzip_swig() compile_armory() make_resources() cleanup_app() # Force Finder to update the Icon execAndWait("touch " + APPDIR) make_targz() ################################################################################ # Write the string to both console and log file def logprint(s): print s with open(LOGFILE,'a') as f: f.write(s if s.endswith('\n') else s+'\n') ################################################################################ """ # While this worked well to capture the output, buffering made it impossible # to write the data to stdout in real time (it woud all buffer up to the end def execAndWait(syscmd, cwd=None): try: logprint('*'*80) logprint('Executing: "%s"' % syscmd) proc = Popen(syscmd, stdin=PIPE, stdout=PIPE, stderr=PIPE, shell=True, cwd=cwd) while proc.poll() == None: time.sleep(0.25) except Exception as e: logprint('\n' + '-'*80) logprint('ERROR: %s' % str(e)) logprint('-'*80 + '\n') finally: out,err = proc.communicate() logprint('STDOUT:') logprint(out if len(out.strip()) > 0 else "") logprint('STDERR:') logprint(err if len(err.strip()) > 0 else "") logprint('*'*80) return [out,err] """ ################################################################################ def getRightNowStr(): dateFmt = '%Y-%b-%d %I:%M%p' dtobj = datetime.datetime.fromtimestamp(time.time()) dtstr = u'' + dtobj.strftime(dateFmt).decode('utf-8') return dtstr[:-2] + dtstr[-2:].lower() ################################################################################ def execAndWait(syscmd, cwd=None): try: syscmd += ' 2>&1 | tee -a %s' % LOGPATH logprint('*'*80) logprint(getRightNowStr()) logprint('Executing: "%s"' % syscmd) logprint('Executing from: "%s"' % (os.getcwd() if cwd is None else cwd)) proc = Popen(syscmd, shell=True, cwd=cwd) while proc.poll() == None: time.sleep(0.25) logprint('Finished executing: "%s"' % syscmd) logprint('Finished executing from: "%s"' % (os.getcwd() if cwd is None else cwd)) logprint('*'*80) except Exception as e: logprint('\n' + '-'*80) logprint('ERROR: %s' % str(e)) logprint('-'*80 + '\n') ################################################################################ def makedir(dirname): if not path.isdir(dirname): logprint( "Creating directory: %s" % dirname) os.mkdir(dirname) ################################################################################ def movepath(pathname, newpath): if path.exists(pathname): logprint('Moving directory tree: \nFrom "%s"\nTo "%s"' % (pathname, newpath)) shutil.move(pathname, newpath) ################################################################################ def removetree(pathname): if path.exists(pathname): logprint('Removing directory tree: %s' % pathname) shutil.rmtree(pathname) ################################################################################ def removefile(pathname): if path.exists(pathname): logprint('Removing file: %s' % pathname) os.remove(pathname) ################################################################################ def copytree(pathname, newpath): if path.exists(pathname): logprint('Copying directory tree: \nFrom "%s"\nTo "%s"' % (pathname, newpath)) shutil.copytree(pathname, newpath) ################################################################################ def copyfile(src, dst): logprint('Copying file: "%s" --> "%s"' % (src,dst)) shutil.copy(src,dst) ################################################################################ def check_sha(filename, sha): logprint("Checking %s" % filename) check = hashlib.sha1() with open(filename,'rb') as f: check.update(f.read()) digest = check.hexdigest() if sha is None: logprint("SHA-1 =", digest) return digest elif sha==digest: logprint("SHA-1 matches: OK") return True else: logprint("SHA-1 does not match!") return False ################################################################################ def getTarUnpackPath(tarName, inDir=None): """ NOTE: THIS FUNCTION IS NOT RELIABLE. It only works if the tar file would extract a single directory with all contents in that dir. If it unpacks more than one file or directory, the output will be incomplete. """ tarPath = tarName if inDir is not None: tarPath = path.join(inDir, tarName) # HACK: XZ support was added to tarfile.open() in Python 3.3. Can't use for # now, so we'll have to apply a hack to get around this. if tarName == "Python-%s.tar.xz" % pythonVer: theDir = "Python-%s" % pythonVer else: tar = tarfile.open(tarPath,'r') theDir = tar.next().name.split('/')[0] tar.close() return theDir ################################################################################ def unpack(tarName, fromDir=DLDIR, toDir=UNPACKDIR, overwrite=False): """ This is not a versatile function. It expects tar files with a single unpack directory. I will expand this function as necessary if we need tar files that aren't a single bundled dir. """ if fromDir is not None: tardl = path.join(fromDir, tarName) if not path.exists(toDir): os.mkdir(toDir) # Use tarfile module to pick out the base dir. extractPath = getTarUnpackPath(tarName, fromDir) extractPath = path.join(toDir, extractPath) if path.exists(extractPath): if overwrite: removetree(path.join(toDir, extractPath)) else: return extractPath flistBefore = set(os.listdir(toDir)) if tarName.endswith('tar.gz') or tarName.endswith('tgz'): execAndWait('tar -zxf %s -C %s' % (tardl, toDir)) elif tarName.endswith('tar.bz2') or tarName.endswith('tbz'): execAndWait('tar -jxf %s -C %s' % (tardl, toDir)) elif tarName.endswith('tar.xz') or tarName.endswith('xz'): execAndWait('tar -Jxf %s -C %s' % (tardl, toDir)) else: raise RuntimeError('Not a recognized tar name') newStuff = [] for objPath in os.listdir(toDir): if not objPath in flistBefore: newStuff.append(path.join(toDir, objPath)) logprint('Unpacked: %s' % tardl) for objPath in newStuff: logprint(' ' + objPath) if len(newStuff) > 1: logprint('*** ERROR: tarfile unpacked more than one object! ***' ) return newStuff[0] if len(newStuff)==1 else newStuff ################################################################################ def downloadPkg(pkgname, fname, url, ID, toDir=DLDIR): myfile = path.join(toDir, fname) isGitRepo = url.lower().startswith('git:') doDL = True if isGitRepo: clonename = '.'.join(url.split('/')[-1].split('.')[:-1]) clonedir = path.join(toDir, clonename) branch = ID[:] # the ID value is actually the branch name if path.exists(clonedir) or path.exists(path.join(DLDIR,fname)): doDL=False elif path.exists(myfile): if check_sha(myfile, ID): logprint("File already exists: %s" % myfile) doDL = False else: removefile(myfile) logprint("File exists but wrong hash. Redownload %s" % myfile) # Start the download if needed if doDL: if isGitRepo: # NB: The "git checkout" line appears to be temporarily broken. As of # May 2014, we're passing in "4.8" for Qt. The actual repository is # "qt" but the default branch is "4.8", so we're okay. Clean up later? logprint('Cloning "%s" to "%s"' % (url, clonedir)) execAndWait('git clone %s' % url, cwd=toDir) execAndWait('git checkout %s' % ID) else: logprint('Downloading from %s' % url) execAndWait('curl -OL "%s"' % url, cwd=toDir) # List of all files needed to download. Each item is # (Name, filename, url, sha-1 or None) distfiles = [] distfiles.append( [ 'Python', \ "Python-%s.tar.xz" % pythonVer, \ "http://python.org/ftp/python/%s/Python-%s.tar.xz" % (pythonVer, pythonVer), \ "9c6281eeace0c3646fa556c8087bb1b7e033c9c4" ] ) distfiles.append( [ 'setuptools', \ "setuptools-%s.tar.gz" % setToolVer, \ "https://pypi.python.org/packages/source/s/setuptools/setuptools-%s.tar.gz" % setToolVer, \ "113e5688a7fab03004f7b793aa2f718f949515d0" ] ) distfiles.append( [ 'Pip', \ "pip-%s.tar.gz" % pipVer, \ "https://pypi.python.org/packages/source/p/pip/pip-%s.tar.gz" % pipVer, \ "e6cd9e6f2fd8d28c9976313632ef8aa8ac31249e" ] ) distfiles.append( [ "psutil", \ "psutil-%s.tar.gz" % psutilVer, \ "https://pypi.python.org/packages/source/p/psutil/psutil-%s.tar.gz" % psutilVer, \ "0c20a20ed316e69f2b0881530439213988229916" ] ) distfiles.append( [ 'Twisted', \ "Twisted-%s.tar.bz2" % twistedVer, \ "https://pypi.python.org/packages/source/T/Twisted/Twisted-%s.tar.bz2" % twistedVer, \ "a90fae98072f8e28b9459875ce9b77f5524bbc48" ] ) # Other lines rely on the given version. Patch this up later. distfiles.append( [ 'libpng', \ "libpng-%s.mavericks.bottle.tar.gz" % libpngVer, \ "https://downloads.sf.net/project/machomebrew/Bottles/libpng-%s.mavericks.bottle.tar.gz" % libpngVer, \ "6b82dd8fc966b83b15ab27224f864a384b7b766d" ] ) #distfiles.append( [ "Qt", \ #"qt-4.8.5.mountain_lion.bottle.2.tar.gz", \ #"https://downloads.sf.net/project/machomebrew/Bottles/qt-4.8.5.mountain_lion.bottle.2.tar.gz", \ #"b361f521d413409c0e4397f2fc597c965ca44e56" #] ) #distfiles.append( [ "Qt", \ # "qt-everywhere-opensource-src-5.2.1.tar.gz", \ # "http://download.qt-project.org/official_releases/qt/5.2/5.2.1/single/qt-everywhere-opensource-src-5.2.1.tar.gz", \ # "31a5cf175bb94dbde3b52780d3be802cbeb19d65" ] ) # Pre-packaged source can lag a bit but provides for more consistent user # support. Use pre-packaged source instead of Git whenever possible. distfiles.append( [ "Qt", \ "qt-everywhere-opensource-src-%s.tar.gz" % qtVer, \ "http://download.qt-project.org/official_releases/qt/4.8/%s/qt-everywhere-opensource-src-%s.tar.gz" % (qtVer, qtVer), \ "745f9ebf091696c0d5403ce691dc28c039d77b9e" ] ) # Skipping Git for now. #distfiles.append( [ "Qt-git", \ # "qt5_git_repo.tar.gz", \ # 'git://gitorious.org/qt/qt5.git', # 'stable' ] ) #distfiles.append( [ "Qt-git", \ # "qt4_git_repo.tar.gz", \ # 'git://gitorious.org/qt/qt.git', # '4.8' ] ) distfiles.append( [ "Webkit-for-Qt", \ "libWebKitSystemInterfaceMavericks.a", \ "http://trac.webkit.org/export/%s/trunk/WebKitLibraries/libWebKitSystemInterfaceMavericks.a" % webkitRev, \ "fb544ee9346765843ddb9c0d97df99b31a3307e4" ] ) #distfiles.append( [ "Qt-p1", \ #"Ie9a72e3b.patch", \ #'https://gist.github.com/cliffrowley/f526019bb3182c237836/raw/459bfcfe340baa306eed81720b0734f4bede94d7/Ie9a72e3b.patch', \ #'829a8e9644c143be11c03ee7b2b9c8b042708b41' #] ) #distfiles.append( [ 'Qt-p2', \ #'qt-4.8-libcpp.diff', \ #'https://gist.github.com/cliffrowley/7380124/raw/ff6c681b282bbc1fe4a58e2f0c37905062ebd58b/qt-4.8-libcpp.diff', \ #'4215caf4b8c84236f85093a1f0d24739a1c5ccfd' #] ) #distfiles.append( [ 'Qt-p3', \ #'qt-4.8-libcpp-configure.diff', \ #'https://gist.github.com/cliffrowley/93ce53b9dd8d8bb65530/raw/d3f6a6f039c5826df04fcfa56569394ea5069b9e/qt-4.8-libcpp-configure.diff', \ #'a0b5189097937410113f22b78579c4eac940def9' #] ) distfiles.append( [ "sip", \ "sip-%s.tar.gz" % sipVer, \ "http://sourceforge.net/projects/pyqt/files/sip/sip-%s/sip-%s.tar.gz" % (sipVer, sipVer), \ '4d3ebce6ec7c31d8a862a6ee307a5f6c3e67349b' ] ) distfiles.append( [ "zope", \ "zope.interface-%s.tar.gz" % zopeVer, \ "https://pypi.python.org/packages/source/z/zope.interface/zope.interface-%s.tar.gz" % zopeVer, \ '20a9284429e29eb8cc63eee5ed686c257c01b1fc' ] ) # Other lines rely on the given version. Patch this up later. distfiles.append( [ "pyqt", \ "PyQt-mac-gpl-%s.tar.gz" % pyQtVer, \ "http://downloads.sf.net/project/pyqt/PyQt4/PyQt-%s/PyQt-mac-gpl-%s.tar.gz" % (pyQtVer, pyQtVer), \ '9d7478758957c60ac5007144a0dc7f157f4a5836' ] ) #distfiles.append( [ "pyqt", \ # "PyQt-gpl-5.2.tar.gz", \ # "http://downloads.sf.net/project/pyqt/PyQt5/PyQt-5.2/PyQt-gpl-5.2.tar.gz", \ # 'a1c232d34ab268587c127ad3097c725ee1a70cf0' ] ) # May roll our own SWIG/PCRE someday. For now, assume the user already has SWIG. #distfiles.append( [ 'swig', \ # "swig-2.0.12.mavericks.bottle.tar.gz", \ # "https://downloads.sf.net/project/machomebrew/Bottles/swig-2.0.12.mavericks.bottle.tar.gz", \ # "5e429bc6228e8ec1f154ee5eb9497b54b8b765d5" ] ) # Now repack the information in distfiles tarfilesToDL = {} for d in distfiles: tarfilesToDL[d[0]] = d[1] ################################################################################ def make_empty_app(): 'Make the empty .app bundle structure' makedir(APPDIR) makedir(path.join(APPDIR,'Contents')) makedir(path.join(APPDIR,'Contents/MacOS')) makedir(path.join(APPDIR,'Contents/MacOS/py')) makedir(path.join(APPDIR,'Contents/Frameworks')) makedir(path.join(APPDIR,'Contents/Resources')) makedir(path.join(APPDIR,'Contents/Dependencies')) ################################################################################ def compile_python(): logprint('Installing python.') bldPath = unpack(tarfilesToDL['Python']) # ./configure frameDir = path.join(APPDIR, 'Contents/Frameworks') execAndWait('./configure --enable-ipv6 --prefix=%s --enable-framework="%s"' % \ (INSTALLDIR, frameDir), cwd=bldPath) # make execAndWait('make %s' % MAKEFLAGS, cwd=bldPath) # pyexe = path.join(APPDIR, 'Contents/MacOS/Python') execAndWait('make install PYTHONAPPSDIR=%s' % INSTALLDIR, cwd=bldPath) # Update $PATH var newPath = path.join(PYPREFIX, 'bin') os.environ['PATH'] = '%s:%s' % (newPath, os.environ['PATH']) logprint('PATH is now %s' % os.environ['PATH']) ################################################################################ def compile_pip(): logprint('Installing setuptools.') pipexe = path.join(PYPREFIX, 'bin/pip') if path.exists(pipexe): logprint('Pip already installed') else: logprint('Installing pip.') command = 'python -s setup.py --no-user-cfg install --force --verbose' # Unpack and build setuptools setupDir = unpack(tarfilesToDL['setuptools']) execAndWait(command, cwd=setupDir) # Unpack and build pip pipDir = unpack(tarfilesToDL['Pip']) execAndWait(command, cwd=pipDir) ################################################################################ def install_libpng(): logprint('Installing libpng') dylib = 'libpng16.16.dylib' target = path.join(APPDIR, 'Contents/Dependencies', dylib) if path.exists(target): logprint('libpng already installed.') else: pngDir = unpack(tarfilesToDL['libpng']) src = path.join(pngDir, '%s/lib' % libpngVer, dylib) copyfile(src, target) ################################################################################ def compile_qt(): logprint('Compiling Qt') # Already cloned to the qtDLDir, then tar it and move the dir to # qtBuildDir. Then we will build inside the qtBuildDir, using qtInstDir # as the prefix. qtDLDir = path.join(DLDIR, 'qt') qtBuildDir = path.join(UNPACKDIR, 'qt-everywhere-opensource-src-%s' % qtVer) qtInstDir = path.join(INSTALLDIR, 'qt') qtTarFile = path.join(DLDIR, 'qt-everywhere-opensource-src-%s.tar.gz' % qtVer) #qtTarFile = path.join(DLDIR, 'qt4_git_repo.tar.gz') #qtTarFile = path.join(DLDIR, 'qt5_git_repo.tar.gz') # If we did a fresh download, it's already uncompressed in DLDir. Move it # to where it should be in the UNPACKDIR if path.exists(qtDLDir): if path.exists(qtBuildDir): removetree(qtBuildDir) movepath(qtDLDir, qtBuildDir) # If it's not in the bld dir, unpack it from the tar file # If it's not in the tar file, either, we have a problem. if not path.exists(qtBuildDir): if not path.exists(qtTarFile): raise RuntimeError('*** ERROR: No cloned repo and no tar file...? ***') logprint('Unpacking Qt from tarfile') qtBuildDir = unpack(tarfilesToDL['Qt']) #logprint('Remove qt4_git_repo.tar.gz to re-clone HEAD') #logprint('Remove qt5_git_repo.tar.gz to re-clone HEAD') elif not path.exists(qtTarFile): # Useful only if we're grabbing Qt from Git. logprint('Tarring downloaded repo for future use.') execAndWait('tar -zcf %s qt' % qtTarFile, cwd=UNPACKDIR) # Webkit-for-Qt is not a tar archive. It's actually just a single .a file. webkita = tarfilesToDL['Webkit-for-Qt'] src = path.join(DLDIR, webkita) dst = path.join(qtBuildDir, 'src/3rdparty/webkit/WebKitLibraries', webkita) copyfile(src, dst) #for patch in ['Qt-p1', 'Qt-p2', 'Qt-p3']: # execAndWait('patch -p1 < ../../downloads/' + tarfilesToDL[patch], cwd=qtBuildDir) #execAndWait('patch -p1 < ../../../qt-maverick-stability.patch', cwd=qtBuildDir) # Put Qt patches here. # Partial bug fixes for modal windows. execAndWait('patch -p0 < %s' % path.join(os.getcwd(), 'QTBUG-37699.patch'), \ cwd=qtBuildDir) # Completed bug fixes for modal windows. execAndWait('patch -p0 < %s' % path.join(os.getcwd(), 'QTBUG-40585.patch'), \ cwd=qtBuildDir) # For now, Qt requires a patch to compile on 10.10, and may require a more # comprehensive patch later. osMjrVer = os.uname()[2].split('.')[0] if osMjrVer == '14': execAndWait('patch -p0 < %s' % path.join(os.getcwd(), \ 'QTBUG-39644.patch'), \ cwd=qtBuildDir) ##### Configure command = './configure -prefix "%s" -system-zlib -confirm-license -opensource ' command += '-nomake demos -nomake examples -nomake docs -cocoa -fast -release ' command += '-no-qt3support -arch x86_64 -no-3dnow ' command += '-platform unsupported/macx-clang' execAndWait(command % qtInstDir, cwd=qtBuildDir) ##### Make execAndWait('make %s' % MAKEFLAGS, cwd=qtBuildDir) ##### Make Install # This will actually happen outside this function, since the INSTALLDIR # Gets wiped every build ################################################################################ def install_qt(): # We really don't need this arg for now, but maybe it'll be useful later? #if CLIOPTS.precompiledQt: # logprint('Unpacking precompiled Qt.') # qtdir = unpack(tarfilesToDL['Qt']) # raise RuntimeError('Using precompiled Qt is not supported yet.') #else: if not path.exists(QTBUILTFLAG): compile_qt() execAndWait('touch %s' % QTBUILTFLAG) else: logprint('QT already compiled. Skipping compile step.') # Even if it's already built, we'll always "make install" and then # set a bunch of environment variables (INSTALLDIR is wiped on every # Run of this script, so all "make install" steps need to be re-run qtInstDir = path.join(INSTALLDIR, 'qt') qtBinDir = path.join(qtInstDir, 'bin') qtBuildDir = path.join(UNPACKDIR, 'qt-everywhere-opensource-src-%s' % qtVer) qtconf = path.join(qtBinDir, 'qt.conf') execAndWait('make install', cwd=qtBuildDir) newcwd = path.join(APPDIR, 'Contents/Frameworks') for mod in ['QtCore', 'QtGui', 'QtXml', 'QtNetwork']: src = path.join(qtInstDir, 'lib', mod+'.framework') dst = path.join(APPDIR, 'Contents/Frameworks', mod+'.framework') if path.exists(dst): removetree(dst) copytree(src, dst) with open(qtconf, 'w') as f: f.write('[Paths]\nPrefix = %s' % qtInstDir) try: old = ':'+os.environ['DYLD_FRAMEWORK_PATH'] except KeyError: old = '' frmpath = path.join(APPDIR, 'Contents/Frameworks') os.environ['PATH'] = '%s:%s' % (qtBinDir, os.environ['PATH']) os.environ['DYLD_FRAMEWORK_PATH'] = '%s:%s' % (frmpath, old) os.environ['QTDIR'] = qtInstDir os.environ['QMAKESPEC'] = path.join(os.environ['QTDIR'], 'mkspecs/macx-g++') logprint('All the following ENV vars are now set:') for var in ['PATH','DYLD_FRAMEWORK_PATH', 'QTDIR', 'QMAKESPEC']: logprint(' %s: \n %s' % (var, os.environ[var])) ################################################################################ def compile_sip(): logprint('Installing sip') if path.exists(path.join(PYSITEPKGS, 'sip.so')): logprint('Sip is already installed.') else: #os.chdir('build/sip-4.14.6') sipPath = unpack(tarfilesToDL['sip']) command = 'python configure.py' command += ' --destdir="%s"' % PYSITEPKGS command += ' --bindir="%s/bin"' % PYPREFIX command += ' --incdir="%s/include"' % PYPREFIX command += ' --sipdir="%s/share/sip"' % PYPREFIX execAndWait(command, cwd=sipPath) execAndWait('make', cwd=sipPath) # Must run "make install" again even if it was previously built (since # the APPDIR and INSTALLDIR are wiped every time the script is run) execAndWait('make install', cwd=sipPath) ################################################################################ def compile_pyqt(): logprint('Install PyQt4') #logprint('Install PyQt5') #if path.exists(path.join(PYSITEPKGS, 'PyQt5')): if path.exists(path.join(PYSITEPKGS, 'PyQt4')): logprint('Pyqt is already installed.') else: pyqtPath = unpack(tarfilesToDL['pyqt']) incDir = path.join(PYPREFIX, 'include') execAndWait('python ./configure-ng.py --confirm-license --sip-incdir="%s"' % incDir, cwd=pyqtPath) execAndWait('make %s' % MAKEFLAGS, cwd=pyqtPath) # Need to add pyrcc4 to the PATH execAndWait('make install', cwd=pyqtPath) pyrccPath = path.join(UNPACKDIR, 'PyQt-mac-gpl-%s/pyrcc' % pyQtVer) os.environ['PATH'] = '%s:%s' % (pyrccPath, os.environ['PATH']) ################################################################################ ''' def pip_install(package, lookfor): """Install package with pip. For some reason this appears to be broken. Pip installs psutil in /usr/local instead of inside the app. Strange. Do not use! """ if path.exists(path.join(PYSITEPKGS, lookfor)): print package, "already installed" else: print "Installing %s using pip." % (package,) execAndWait("pip install %s > pip-%s.log 2>&1" % (package, package)) ''' ################################################################################ def compile_twisted(): logprint('Installing python-twisted') if glob.glob(PYSITEPKGS + '/Twisted*'): logprint('Twisted already installed') else: command = "python -s setup.py --no-user-cfg install --force --verbose" twpath = unpack(tarfilesToDL['Twisted']) execAndWait(command, cwd=twpath) ################################################################################ def compile_zope(): logprint('Installing python-zope') if glob.glob(PYSITEPKGS + '/zope*'): logprint('zope already installed') else: command = "python -s setup.py --no-user-cfg install --force --verbose" twpath = unpack(tarfilesToDL['zope']) execAndWait(command, cwd=twpath) ################################################################################ def compile_psutil(): logprint('Installing psutil') if glob.glob(PYSITEPKGS + '/psutil*'): logprint('Psutil already installed') else: command = 'python -s setup.py --no-user-cfg install --force --verbose' psPath = unpack(tarfilesToDL['psutil']) execAndWait(command, cwd=psPath) ################################################################################ def compile_armory(): logprint('Compiling and installing Armory') # Always compile - even if already in app #os.chdir('..') # Leave workspace directory. pypathpath = path.join(ARMORYDIR, 'cppForSwig/pypaths.txt') logprint('Writing ' + pypathpath) with open(pypathpath, 'w') as f: f.write(pypathData) armoryAppScript = path.join(APPDIR, 'Contents/MacOS/Armory') armorydAppScript = path.join(APPDIR, 'Contents/MacOS/armoryd') pydir = path.join(APPDIR, 'Contents/MacOS/py') execAndWait('make all', cwd='..') execAndWait('make DESTDIR="%s" install' % pydir, cwd='..') copyfile('Armory-script.sh', armoryAppScript) copyfile('armoryd-script.sh', armorydAppScript) execAndWait('chmod +x "%s"' % armoryAppScript) execAndWait('chmod +x "%s"' % armorydAppScript) ################################################################################ def make_resources(): "Populate the Resources folder." cont = path.join(APPDIR, 'Contents') copyfile('Info.plist', cont) icnsArm = '../img/armory_icon_fullres.icns' icnsRes = path.join(cont, 'Resources/Icon.icns') copyfile(icnsArm, icnsRes) ################################################################################ #def unzip_swig(): # '''Unzip the SWIG binary.''' # logprint('Unzipping the SWIG binary.') # swigDir = unpack(tarfilesToDL['swig']) ################################################################################ def cleanup_app(): "Try to remove as much unnecessary junk as possible." show_app_size() print "Removing Python test-suite." testdir = path.join(PYPREFIX, "lib/python2.7/test") if path.exists(testdir): removetree(testdir) print "Removing .pyo and unneeded .py files." remove_python_files(PYPREFIX) remove_python_files(path.join(APPDIR, 'Contents/MacOS/py'), False) show_app_size() ################################################################################ def make_targz(): ver = getVersionStr() execAndWait('tar -zcf ../armory_%s_osx.tar.gz Armory.app' % ver, cwd=WORKDIR) ################################################################################ def getVersionStr(): with open('../armoryengine/ArmoryUtils.py') as f: for line in f.readlines(): if line.startswith('BTCARMORY_VERSION'): vstr = line[line.index('(')+1:line.index(')')] vquad = tuple([int(v) for v in vstr.replace(' ','').split(',')]) print vquad, len(vquad) vstr = '%d.%02d' % vquad[:2] if (vquad[2] > 0 or vquad[3] > 0): vstr += '.%d' % vquad[2] if vquad[3] > 0: vstr += '.%d' % vquad[3] return vstr ################################################################################ def show_app_size(): "Show the size of the app." logprint("Size of application: ") sys.stdout.flush() execAndWait('du -hs "%s"' % APPDIR) ################################################################################ def remove_python_files(top, removePy=True): """Remove .pyo files and, if desired, any .py files where the .pyc file exists.""" n_pyo = 0 n_py_rem = 0 n_py_kept = 0 for (dirname, dirs, files) in os.walk(top): for f in files: prename, ext = path.splitext(f) if ext == '.pyo': removefile(path.join(dirname, f)) n_pyo += 1 elif ext == '.py': if removePy: if (f + 'c') in files: removefile(path.join(dirname, f)) n_py_rem += 1 else: n_py_kept += 1 else: if (f + 'c') in files: removefile(path.join(dirname, (f + 'c'))) n_py_kept += 1 logprint("Removes %i .py files (kept %i)." % (n_py_rem, n_py_kept)) ################################################################################ def delete_prev_data(opts): # If we ran this before, we should have a qt dir here prevQtDir = path.join(UNPACKDIR, 'qt') def resetQtRepo(): if path.exists(prevQtDir): makefile = path.join(prevQtDir, 'Makefile') if path.exists(makefile): execAndWait('make clean', cwd=prevQtDir) removefile(makefile) removefile(QTBUILTFLAG) # Always remove previously-built application files removetree(APPDIR) removetree(INSTALLDIR) # When building from scratch if opts.fromscratch: removetree(UNPACKDIR) # Clear all unpacked tar files removetree(DLDIR) # Clear even the downloaded files elif opts.rebuildall: removetree(UNPACKDIR) elif not opts.qtcheckout == '4.8': resetQtRepo() execAndWait('git pull') execAndWait('git checkout %s' % opts.qtcheckout) elif opts.qtupdate: resetQtRepo() execAndWait('git pull') elif opts.qtrebuild: resetQtRepo() else: logprint('Using all packages previously downloaded and built') ################################################################################ if __name__ == "__main__": main() armory-0.92.3/osxbuild/Armory-script.sh0000755000000000000000000000277712414772654016610 0ustar rootroot#!/bin/bash # This is the initial driver script executed by the Armory application on OS X. # Its role is to set up the environment before passing control to Python. # NB: If any changes are made to this script, you'll probably need to make the # same changes to the armoryd script. # Set environment variables so the Python executable finds its stuff. # Note that `dirname $0` gives a relative path. We'd like the absolute path. DIRNAME="$( cd "$( dirname "${BASH_SOURCE[0]}" )" && pwd )" ARMORYDIR="$DIRNAME/py/usr/lib/armory" LIBDIR="$DIRNAME/../Dependencies" FRDIR="$DIRNAME/../Frameworks" export PYTHONPATH="$ARMORYDIR" export DYLD_LIBRARY_PATH="${LIBDIR}:${FRDIR}" export DYLD_FRAMEWORK_PATH="${LIBDIR}:${FRDIR}" # Misc. crap to keep around in case it's ever needed. #OSXVER=`sw_vers -productVersion | awk '{ print substr( $0, 0, 4 ) }'` #if [ $# == "0" ]; then # <-- If 0 CL args.... # OS X has a quirk. For whatever reasons, if you execute Python from a different # location than the location of what actually gets executed when you run Armory, # the menu bar calls Armory "Python". However, if you symlink Python and run the # symlink from the execution directory, the app name from Info.plist is used. # Also, the link should be here so that the link works wherever this is # executed, and not just on the build machine. ln -sf "$FRDIR/Python.framework/Versions/2.7/Resources/Python.app/Contents/MacOS/Python" "$DIRNAME/Python" # Call ArmoryQt and get this party started! "$DIRNAME/Python" "$ARMORYDIR/ArmoryQt.py" "$@" armory-0.92.3/osxbuild/QTBUG-37699.patch0000644000000000000000000000312412414772654016063 0ustar rootroot--- src/gui/kernel/qeventdispatcher_mac.mm 2014-07-12 16:19:53.000000000 -0400 +++ src/gui/kernel/qeventdispatcher_mac.mm 2014-07-12 16:24:57.000000000 -0400 @@ -609,6 +609,12 @@ bool QEventDispatcherMac::processEvents( // 'session' as well. As a result, we need to restart all internal sessions: d->temporarilyStopAllModalSessions(); } + + // Clean up the modal session list, call endModalSession. + if (d->cleanupModalSessionsNeeded) { + d->cleanupModalSessions(); + } + } else { d->nsAppRunCalledByQt = true; QBoolBlocker execGuard(d->currentExecIsNSAppRun, true); @@ -633,6 +639,12 @@ bool QEventDispatcherMac::processEvents( // 'session' as well. As a result, we need to restart all internal sessions: d->temporarilyStopAllModalSessions(); } + + // Clean up the modal session list, call endModalSession. + if (d->cleanupModalSessionsNeeded) { + d->cleanupModalSessions(); + } + retVal = true; } else do { // Dispatch all non-user events (but que non-user events up for later). In @@ -1044,7 +1056,7 @@ inline static void processPostedEvents(Q } #ifdef QT_MAC_USE_COCOA - if (d->cleanupModalSessionsNeeded) + if (d->cleanupModalSessionsNeeded && d->currentExecIsNSAppRun) d->cleanupModalSessions(); #endif armory-0.92.3/osxbuild/Info.plist0000755000000000000000000000134012414772654015432 0ustar rootroot CFBundleDisplayName Armory Bitcoin Client CFBundleExecutable Armory CFBundleIdentifier com.armory.armory CFBundleIconFile Icon.icns CFBundleInfoDictionaryVersion 0.89.99.3 CFBundleName Armory Bitcoin Client NSPrincipalClass NSApplication LSMinimumSystemVersion 10.6.0 LSAppNapIsDisabled armory-0.92.3/guardian.py0000644000000000000000000000634612414772654014005 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ import sys import psutil import time import platform import os import signal import subprocess # Note: this ended up not being used for Windows! Check out guardian.exe opsys = platform.system() OS_WINDOWS = 'win32' in opsys.lower() or 'windows' in opsys.lower() try: pid_armory = int(sys.argv[1]) pid_bitcoind = int(sys.argv[2]) except: print 'USAGE: %d armorypid bitcoindpid' % sys.argv[0] exit(0) def check_pid(pid, name=''): try: proc = psutil.Process(pid) procstr = ' '.join(proc.cmdline) if name=='': return procstr else: return procstr if procstr==name else False except psutil.error.NoSuchProcess: return False def kill(pid): if OS_WINDOWS: #import ctypes #k32 = ctypes.windll.kernel32 #handle = k32.OpenProcess(1,0,pid) #return (0 != k32.TerminateProcess(handle,0)) os.kill(pid, signal.CTRL_C_EVENT) else: os.kill(pid, signal.SIGTERM) time.sleep(3) if not check_pid(pid): return print 'Regular TERMINATE of bitcoind failed; issuing SIGKILL (hard)' time.sleep(1) os.kill(pid, signal.SIGKILL) ################################################################################ def killProcessTree(pid): # In this case, Windows is easier because we know it has the get_children # call, because have bundled a recent version of psutil. Linux, however, # does not have that function call in earlier versions. if OS_WINDOWS: for child in psutil.Process(pid).get_children(): kill(child.pid) else: proc = subprocess.Popen("ps -o pid --ppid %d --noheaders" % pid, shell=True, stdout=subprocess.PIPE) out,err = proc.communicate() for pid_str in out.split("\n")[:-1]: kill(int(pid_str)) # Verify the two PIDs are valid proc_name_armory = check_pid(pid_armory) proc_name_bitcoind = check_pid(pid_bitcoind) if proc_name_armory: print 'ArmoryQt is running in pid=%d (%s)' % (pid_armory, proc_name_armory) else: print 'ArmoryQt IS NOT RUNNING!' if proc_name_bitcoind: print 'bitcoind is running in pid=%d (%s)' % (pid_bitcoind, proc_name_bitcoind) else: print 'bitcoind IS NOT RUNNING!' while True: time.sleep(3) if not check_pid(pid_armory, proc_name_armory): #print 'ArmoryQt died!' break if not check_pid(pid_bitcoind, proc_name_bitcoind): #print 'bitcoind disappeared -- guardian exiting' exit(0) if check_pid(pid_bitcoind, proc_name_bitcoind): # Depending on how popen was called, bitcoind may be a child of # pid_bitcoind. But psutil makes it easy to find those child procs # and kill them. killProcessTree(pid_bitcoind) kill(pid_bitcoind) armory-0.92.3/ArmorySetup.nsi0000644000000000000000000001674112414772654014646 0ustar rootroot# Auto-generated by EclipseNSIS Script Wizard # Sep 25, 2013 4:18:18 PM Name "Bitcoin Armory" # General Symbol Definitions !define REGKEY "SOFTWARE\$(^Name)" !define COMPANY "Armory Technologies Inc." !define URL http://bitcoinarmory.com/ # MultiUser Symbol Definitions !define MULTIUSER_EXECUTIONLEVEL Highest !define MULTIUSER_INSTALLMODE_COMMANDLINE !define MULTIUSER_INSTALLMODE_INSTDIR Armory !define MULTIUSER_INSTALLMODE_INSTDIR_REGISTRY_KEY "${REGKEY}" !define MULTIUSER_INSTALLMODE_INSTDIR_REGISTRY_VALUE "Path" # MUI Symbol Definitions !define MUI_ICON img\armory48x48.ico !define MUI_FINISHPAGE_NOAUTOCLOSE !define MUI_STARTMENUPAGE_REGISTRY_ROOT HKLM !define MUI_STARTMENUPAGE_REGISTRY_KEY ${REGKEY} !define MUI_STARTMENUPAGE_REGISTRY_VALUENAME StartMenuGroup !define MUI_STARTMENUPAGE_DEFAULTFOLDER Armory !define MUI_FINISHPAGE_RUN $INSTDIR\ArmoryQt.exe !define MUI_UNICON img\armory48x48.ico !define MUI_UNFINISHPAGE_NOAUTOCLOSE # Included files !include MultiUser.nsh !include Sections.nsh !include MUI2.nsh !include CompilerArgs.nsi # Reserved Files ReserveFile "${NSISDIR}\Plugins\x86-ansi\StartMenu.dll" # Variables Var StartMenuGroup # Installer pages !insertmacro MUI_PAGE_WELCOME !insertmacro MUI_PAGE_LICENSE LICENSE !insertmacro MUI_PAGE_DIRECTORY !insertmacro MUI_PAGE_STARTMENU Application $StartMenuGroup !insertmacro MUI_PAGE_INSTFILES !insertmacro MUI_PAGE_FINISH !insertmacro MUI_UNPAGE_CONFIRM !insertmacro MUI_UNPAGE_INSTFILES # Installer languages !insertmacro MUI_LANGUAGE English # Installer attributes # Default to -testing to match 90% of builds. Manually change actual releases OutFile armory_${VERSION}-testing_winAll.exe InstallDir "$PROGRAMFILES\Armory" CRCCheck on XPStyle on Icon img\armory48x48.ico ShowInstDetails show AutoCloseWindow true LicenseData LICENSE VIProductVersion "${VERSION}" VIAddVersionKey ProductName "Bitcoin Armory" VIAddVersionKey ProductVersion "${VERSION}" VIAddVersionKey CompanyName "${COMPANY}" VIAddVersionKey CompanyWebsite "${URL}" VIAddVersionKey FileVersion "${VERSION}" VIAddVersionKey FileDescription "" VIAddVersionKey LegalCopyright "" InstallDirRegKey HKLM "${REGKEY}" Path UninstallIcon img\armory48x48.ico ShowUninstDetails show # Installer sections # Macro for creating a registry key !define HKEY_CLASSES_ROOT 0xffffffff80000000 !define HKEY_CURRENT_USER 0xffffffff80000001 !define HKEY_LOCAL_MACHINE 0xffffffff80000002 !define HKEY_USERS 0xffffffff80000003 !define HKEY_PERFORMANCE_DATA 0xffffffff80000004 !define HKEY_CURRENT_CONFIG 0xffffffff80000005 !define HKEY_DYN_DATA 0xffffffff80000006 !define KEY_CREATE_SUB_KEY 0x0004 !macro CreateRegKey ROOT_KEY SUB_KEY Push $0 Push $1 System::Call /NOUNLOAD "Advapi32::RegCreateKeyExA(i, t, i, t, i, i, i, *i, i) i(${ROOT_KEY}, '${SUB_KEY}', 0, '', 0, ${KEY_CREATE_SUB_KEY}, 0, .r0, 0) .r1" StrCmp $1 0 +2 SetErrors StrCmp $0 0 +2 System::Call /NOUNLOAD "Advapi32::RegCloseKey(i) i(r0) .r1" System::Free 0 Pop $1 Pop $0 !macroend !macro CREATE_SMGROUP_SHORTCUT NAME PATH ARGS Push "${ARGS}" Push "${NAME}" Push "${PATH}" Call CreateSMGroupShortcut !macroend Section -Main SEC0000 SetOutPath $INSTDIR RmDir /r $INSTDIR SetOverwrite on File /r ArmoryStandalone\* File ArmoryStandalone\ArmoryQt.exe !insertmacro CreateRegKey ${HKEY_CURRENT_USER} "Software\Armory" SetOutPath $DESKTOP CreateShortcut "$DESKTOP\Bitcoin Armory.lnk" $INSTDIR\ArmoryQt.exe !insertmacro CREATE_SMGROUP_SHORTCUT "Bitcoin Armory" "$INSTDIR\ArmoryQt.exe" "" !insertmacro CREATE_SMGROUP_SHORTCUT "Bitcoin Armory (Offline)" "$INSTDIR\ArmoryQt.exe" "--offline" !insertmacro CREATE_SMGROUP_SHORTCUT "Bitcoin Armory (testnet)" "$INSTDIR\ArmoryQt.exe" "--testnet" WriteRegStr HKLM "${REGKEY}\Components" Main 1 SectionEnd Section -post SEC0001 WriteRegStr HKLM "${REGKEY}" Path $INSTDIR SetOutPath $INSTDIR WriteUninstaller $INSTDIR\uninstall.exe !insertmacro MUI_STARTMENU_WRITE_BEGIN Application SetOutPath $SMPROGRAMS\$StartMenuGroup CreateShortcut "$SMPROGRAMS\$StartMenuGroup\Uninstall $(^Name).lnk" $INSTDIR\uninstall.exe !insertmacro MUI_STARTMENU_WRITE_END WriteRegStr HKLM "SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\$(^Name)" DisplayName "$(^Name)" WriteRegStr HKLM "SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\$(^Name)" DisplayVersion "${VERSION}" WriteRegStr HKLM "SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\$(^Name)" Publisher "${COMPANY}" WriteRegStr HKLM "SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\$(^Name)" URLInfoAbout "${URL}" WriteRegStr HKLM "SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\$(^Name)" DisplayIcon $INSTDIR\uninstall.exe WriteRegStr HKLM "SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\$(^Name)" UninstallString $INSTDIR\uninstall.exe WriteRegDWORD HKLM "SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\$(^Name)" NoModify 1 WriteRegDWORD HKLM "SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\$(^Name)" NoRepair 1 SectionEnd # Macro for selecting uninstaller sections !macro SELECT_UNSECTION SECTION_NAME UNSECTION_ID Push $R0 ReadRegStr $R0 HKLM "${REGKEY}\Components" "${SECTION_NAME}" StrCmp $R0 1 0 next${UNSECTION_ID} !insertmacro SelectSection "${UNSECTION_ID}" GoTo done${UNSECTION_ID} next${UNSECTION_ID}: !insertmacro UnselectSection "${UNSECTION_ID}" done${UNSECTION_ID}: Pop $R0 !macroend # Uninstaller sections !macro DELETE_SMGROUP_SHORTCUT NAME Push "${NAME}" Call un.DeleteSMGroupShortcut !macroend Section /o -un.Main UNSEC0000 !insertmacro DELETE_SMGROUP_SHORTCUT "Bitcoin Armory (testnet)" !insertmacro DELETE_SMGROUP_SHORTCUT "Bitcoin Armory (Offline)" !insertmacro DELETE_SMGROUP_SHORTCUT "Bitcoin Armory" Delete /REBOOTOK "$DESKTOP\Bitcoin Armory.lnk" DeleteRegKey /IfEmpty HKEY_CURRENT_USER "Software\Armory" Delete /REBOOTOK $INSTDIR\ArmoryQt.exe RmDir /r /REBOOTOK $INSTDIR DeleteRegValue HKLM "${REGKEY}\Components" Main SectionEnd Section -un.post UNSEC0001 DeleteRegKey HKLM "SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\$(^Name)" Delete /REBOOTOK "$SMPROGRAMS\$StartMenuGroup\Uninstall $(^Name).lnk" Delete /REBOOTOK $INSTDIR\uninstall.exe DeleteRegValue HKLM "${REGKEY}" StartMenuGroup DeleteRegValue HKLM "${REGKEY}" Path DeleteRegKey /IfEmpty HKLM "${REGKEY}\Components" DeleteRegKey /IfEmpty HKLM "${REGKEY}" RmDir /r /REBOOTOK $SMPROGRAMS\$StartMenuGroup RmDir /r /REBOOTOK $INSTDIR Push $R0 StrCpy $R0 $StartMenuGroup 1 StrCmp $R0 ">" no_smgroup no_smgroup: Pop $R0 SectionEnd # Installer functions Function .onInit InitPluginsDir !insertmacro MULTIUSER_INIT FunctionEnd Function CreateSMGroupShortcut Exch $R0 ;PATH Exch Exch $R1 ;NAME Exch 2 Exch $R3 Push $R2 StrCpy $R2 $StartMenuGroup 1 StrCmp $R2 ">" no_smgroup SetOutPath $SMPROGRAMS\$StartMenuGroup CreateShortcut "$SMPROGRAMS\$StartMenuGroup\$R1.lnk" $R0 $R3 no_smgroup: Pop $R2 Pop $R1 Pop $R0 FunctionEnd # Uninstaller functions Function un.onInit ReadRegStr $INSTDIR HKLM "${REGKEY}" Path !insertmacro MUI_STARTMENU_GETFOLDER Application $StartMenuGroup !insertmacro MULTIUSER_UNINIT !insertmacro SELECT_UNSECTION Main ${UNSEC0000} FunctionEnd Function un.DeleteSMGroupShortcut Exch $R1 ;NAME Push $R2 StrCpy $R2 $StartMenuGroup 1 StrCmp $R2 ">" no_smgroup Delete /REBOOTOK "$SMPROGRAMS\$StartMenuGroup\$R1.lnk" no_smgroup: Pop $R2 Pop $R1 FunctionEnd armory-0.92.3/armoryengine/0000755000000000000000000000000012414772654014327 5ustar rootrootarmory-0.92.3/armoryengine/parseAnnounce.py0000644000000000000000000003152412414772654017507 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ from ArmoryUtils import * import os from jasvet import readSigBlock from copy import deepcopy ################################################################################ # NOTE: These methods DO NOT verify signatures. It is assumed that the # signature verification already happened, and these methods were only # called if the signatures were good. They can be called on blocks # of text WITH OR WITHOUT the signature block data (either pass it # the signed block, or just whats inside the block). SIGNED_BLOCK_HEAD = '-----BEGIN BITCOIN SIGNED MESSAGE-----' SIGNED_BLOCK_TAIL = '-----BEGIN BITCOIN SIGNATURE-----' ################################################################################ ################################################################################ class changelogParser(object): """ Returns a list of list of lists representing all version & changelg to the stop version (or all versions, if 0) changeLog == [ [ '0.88.1', 'December 27, 2013', [ [ 'Auto-run Bitcoind', 'This version will now run ...'], [ 'Mac/OSX Version', 'Binaries now available on ...'], [ 'Signed installers', 'All binaries are now sign ...'] ] ] [ '0.87', 'April 18, 2013', [ [ 'QR Codes', 'QR codes added everywhere ...'], [ 'Export History', 'Export tx history to CSV ...'] ] ] ... ] """ ############################################################################# def __init__(self, filename='', filetext=''): self.changelog = [] if not filename and not filetext: return if filename and os.path.exists(filename): f = open(filename, 'r') filetext = f.read() f.close() self.parseChangelogText(filetext) ############################################################################# def parseChangelogFile(self, filename): if not os.path.exists(filename): LOGERROR('File does not exist: %s', filename) f = open(filename,'r') verdata = f.read() f.close() return self.parseVersionsText(verdata) ############################################################################# def parseChangelogText(self, fileText): self.changelog = [] if fileText is None: return None try: if SIGNED_BLOCK_HEAD in fileText: fileText = readSigBlock(fileText)[1] versionLines = [line.strip() for line in fileText.split('\n')][::-1] if len(versionLines)==0: return None # All lines have been stripped already while len(versionLines) > 0: line = versionLines.pop() if line.startswith('#') or len(line)==0: continue if line.startswith('VERSION') and len(line.split())==2: self.changelog.append([line.split(' ')[-1], '', []]) elif line.upper().startswith('RELEASED'): self.changelog[-1][1] = line[8:].strip() elif line.startswith('-'): featureTitle = line[2:] self.changelog[-1][2].append([featureTitle, '']) else: curr = self.changelog[-1][2][-1][-1] self.changelog[-1][2][-1][-1] += ('' if len(curr)==0 else ' ') + line return self.getChangelog() except: LOGEXCEPT('Failed to parse changelog') return None ############################################################################# def getChangelog(self, stopAtVersion=0, dontStartBefore=UINT32_MAX): output = [] for ver in self.changelog: verInt = getVersionInt(readVersionString(ver[0])) if verInt > dontStartBefore: continue if verInt <= stopAtVersion: break output.append(ver[:]) return output ################################################################################ ################################################################################ class downloadLinkParser(object): """ Parse files with the following format: -----BEGIN BITCOIN SIGNED MESSAGE----- # Armory for Windows Armory 0.91 Windows XP 32 http://url/armory_0.91_xp32.exe 3afb9881c32 Armory 0.91 Windows XP 64 http://url/armory_0.91_xp64.exe 8993ab127cf Armory 0.91 Windows Vista,7,8 32,64 http://url/armory_0.91.exe 7f3b9964aa3 # Offline Bundles ArmoryOffline 0.88 Ubuntu 10.04 32 http://url/offbundle-32.tar.gz 641382c93b9 ArmoryOffline 0.88 Ubuntu 12.10 32 http://url/offbundle-64.tar.gz 5541af39c84 # Windows 32-bit Satoshi (Bitcoin-Qt/bitcoind) Satoshi 0.9.0 Windows XP,Vista,7,8 32,64 http://btc.org/win0.9.0.exe 118372a9ff3 Satoshi 0.9.0 Ubuntu 10.04 http://btc.org/win0.9.0.deb 2aa3f763c3b -----BEGIN BITCOIN SIGNATURE----- ac389861cff8a989ae57ae67af43cb3716ca189aa178cff893179531 -----END BITCOIN SIGNATURE----- This will return a heavily-nested dictionary that will be easy to look up after we have reduced the current OS to the right set of keys (we will create a function that takes the output of platform.system(), platform.mac_ver(), platform.linux_distribution(), and platform.win32_ver() and returns a sequence of keys we can use to look up the correct version self.downloadMap['Armory']['0.91']['Windows']['Vista']['64'] --> ['http://url/armory_0.91.exe', '7f3b9964aa3'] Actually use "getDownloadLink """ ############################################################################# def __init__(self, filename='', filetext=''): self.downloadMap = {} if not filename and not filetext: return if filename and os.path.exists(filename): f = open(filename, 'r') self.parseDownloadList(f.read()) f.close() elif filetext: self.parseDownloadList(filetext) ############################################################################# def parseDownloadList(self, fileText): self.downloadMap = {} if fileText is None: return {} def insertLink(mapObj, urlAndHash, keyList): if len(keyList)>1: if not keyList[0] in mapObj: mapObj[keyList[0]] = {} insertLink(mapObj[keyList[0]], urlAndHash, keyList[1:]) else: mapObj[keyList[0]] = urlAndHash try: if SIGNED_BLOCK_HEAD in fileText: fileText = readSigBlock(fileText)[1] dlLines = [line.strip() for line in fileText.split('\n')][::-1] while len(dlLines) > 0: line = dlLines.pop() if line.startswith('#') or len(line)==0: continue lineLists = [pc.split(',') for pc in line.split()[:-2]] urlAndHash = line.split()[-2:] APPLIST, VERLIST, OSLIST, SUBOSLIST, BITLIST = range(5) for app in lineLists[APPLIST]: for ver in lineLists[VERLIST]: for opsys in lineLists[OSLIST]: for subOS in lineLists[SUBOSLIST]: for nbit in lineLists[BITLIST]: insertLink(self.downloadMap, urlAndHash, [app, ver, opsys, subOS, nbit]) return self.getNestedDownloadMap() except: LOGEXCEPT('Failed to parse downloads') return None ############################################################################# def printDownloadMap(self): def recursePrint(theObj, indent=0): if not isinstance(theObj, dict): print ' '*indent + str(theObj) else: for key,val in theObj.iteritems(): print ' '*indent + key + ':' recursePrint(theObj[key], indent+5) recursePrint(self.downloadMap) ############################################################################# def getDownloadLink(self, *keyList): def recurseGet(theMap, keyList): if len(keyList)==0: return None if not isinstance(theMap, dict): return None if len(keyList)>1: if not keyList[0] in theMap: return None return recurseGet(theMap[keyList[0]], keyList[1:]) else: return theMap[keyList[0]] if len(keyList)==0: return None return recurseGet(self.downloadMap, keyList) ############################################################################# def getNestedDownloadMap(self): return deepcopy(self.downloadMap) ################################################################################ ################################################################################ class notificationParser(object): """ # PRIORITY VALUES: # Test announce: 1024 # General Announcment: 2048 # Important non-critical: 3072 # Critical/security sens: 4096 # # Unique ID must be first, and signals that this is a new notification UNIQUEID: 873fbc11 VERSION: 0 STARTTIME: 0 EXPIRES: 1500111222 CANCELID: [] MINVERSION: 0.87.2 MAXVERSION: 0.88.1 PRIORITY: 4096 NOTIFYSEND: False NOTIFYRECV: True SHORTDESCR: Until further notice, require 30 confirmations for incoming transactions. LONGDESCR: THIS IS A FAKE ALERT FOR TESTING PURPOSES: There is some turbulence on the network that may result in some transactions being accidentally reversed up to 30 confirmations. A clever attacker may be able to exploit this to scam you. For incoming transactions from parties with no existing trust, please wait at least 30 confirmations before considering the coins to be yours. ***** """ ############################################################################# def __init__(self, filename='', filetext=''): self.notifications = {} if not filename and not filetext: return if filename and os.path.exists(filename): f = open(filename, 'r') filetext = f.read() f.close() self.parseNotificationText(filetext) ############################################################################# def parseNotificationText(self, fileText): self.notifications = {} if fileText is None: return None try: if SIGNED_BLOCK_HEAD in fileText: fileText = readSigBlock(fileText)[1] notifyLines = [line.strip() for line in fileText.split('\n')][::-1] currID = '' readLongDescr = False longDescrAccum = '' while len(notifyLines) > 0: line = notifyLines.pop() if not readLongDescr and (line.startswith('#') or len(line)==0): continue if line.upper().startswith('UNIQUEID'): currID = line.split(':')[-1].strip() self.notifications[currID] = {} elif line.upper().startswith('LONGDESCR'): readLongDescr = True elif line.startswith("*****"): readLongDescr = False self.notifications[currID]['LONGDESCR'] = longDescrAccum longDescrAccum = '' elif readLongDescr: if len(line.strip())==0: longDescrAccum += '

' else: longDescrAccum += line.strip() + ' ' else: key = line.split(':')[ 0].strip().upper() val = line.split(':')[-1].strip() self.notifications[currID][key] = val return self.getNotificationMap() except: LOGEXCEPT('Failed to parse notifications') return None ############################################################################# def getNotificationMap(self): return deepcopy(self.notifications) # kate: indent-width 3; replace-tabs on; armory-0.92.3/armoryengine/Block.py0000644000000000000000000002466212414772654015745 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ from armoryengine.ArmoryUtils import UNINITIALIZED, UnitializedBlockDataError, \ hash256, LITTLEENDIAN, BIGENDIAN, binary_switchEndian, binary_to_hex, \ binaryBits_to_difficulty from armoryengine.BDM import TheBDM from armoryengine.BinaryUnpacker import BinaryUnpacker from armoryengine.Transaction import BlockComponent, indent, PyTx from armoryengine.BinaryPacker import BinaryPacker, UINT32, BINARY_CHUNK, \ VAR_INT ################################################################################ # Block Information ################################################################################ class PyBlockHeader(BlockComponent): def __init__(self): self.version = 1 self.prevBlkHash = '' self.merkleRoot = UNINITIALIZED self.timestamp = UNINITIALIZED self.diffBits = UNINITIALIZED self.nonce = UNINITIALIZED # Use these fields for storage of block information, but are not otherwise # part of the serialized data structure self.theHash = '' self.numTx = UNINITIALIZED self.blkHeight = UNINITIALIZED self.fileByteLoc = UNINITIALIZED self.nextBlkHash = UNINITIALIZED self.intDifficult = UNINITIALIZED self.sumDifficult = UNINITIALIZED self.isMainChain = False self.isOrphan = True def serialize(self): if self.version == UNINITIALIZED: raise UnitializedBlockDataError, 'PyBlockHeader object not initialized!' binOut = BinaryPacker() binOut.put(UINT32, self.version) binOut.put(BINARY_CHUNK, self.prevBlkHash) binOut.put(BINARY_CHUNK, self.merkleRoot) binOut.put(UINT32, self.timestamp) binOut.put(BINARY_CHUNK, self.diffBits) binOut.put(UINT32, self.nonce) return binOut.getBinaryString() def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): blkData = toUnpack else: blkData = BinaryUnpacker( toUnpack ) self.version = blkData.get(UINT32) self.prevBlkHash = blkData.get(BINARY_CHUNK, 32) self.merkleRoot = blkData.get(BINARY_CHUNK, 32) self.timestamp = blkData.get(UINT32) self.diffBits = blkData.get(BINARY_CHUNK, 4) self.nonce = blkData.get(UINT32) self.theHash = hash256(self.serialize()) return self def getHash(self, endian=LITTLEENDIAN): if self.version == UNINITIALIZED: raise UnitializedBlockDataError, 'PyBlockHeader object not initialized!' if len(self.theHash) < 32: self.theHash = hash256(self.serialize()) outHash = self.theHash if endian==BIGENDIAN: outHash = binary_switchEndian(outHash) return outHash def getHashHex(self, endian=LITTLEENDIAN): if self.version == UNINITIALIZED: raise UnitializedBlockDataError, 'PyBlockHeader object not initialized!' if len(self.theHash) < 32: self.theHash = hash256(self.serialize()) return binary_to_hex(self.theHash, endian) def getDifficulty(self): if self.diffBits == UNINITIALIZED: raise UnitializedBlockDataError, 'PyBlockHeader object not initialized!' self.intDifficult = binaryBits_to_difficulty(self.diffBits) return self.intDifficult def fetchCpp(self): """ Convert a raw blockheader with no context, to a C++ BlockHeader """ return TheBDM.getHeaderByHash(self.getHash()) def pprint(self, nIndent=0, endian=BIGENDIAN): indstr = indent*nIndent print indstr + 'BlockHeader:' print indstr + indent + 'Version: ', self.version print indstr + indent + 'ThisHash: ', binary_to_hex( self.theHash, endOut=endian), \ '(BE)' if endian==BIGENDIAN else '(LE)' print indstr + indent + 'PrevBlock: ', binary_to_hex(self.prevBlkHash, endOut=endian), \ '(BE)' if endian==BIGENDIAN else '(LE)' print indstr + indent + 'MerkRoot: ', binary_to_hex(self.merkleRoot, endOut=endian), \ '(BE)' if endian==BIGENDIAN else '(LE)' print indstr + indent + 'Timestamp: ', self.timestamp fltDiff = binaryBits_to_difficulty(self.diffBits) print indstr + indent + 'Difficulty:', fltDiff, '('+binary_to_hex(self.diffBits)+')' print indstr + indent + 'Nonce: ', self.nonce if not self.blkHeight==UNINITIALIZED: print indstr + indent + 'BlkHeight: ', self.blkHeight if not self.blkHeight==UNINITIALIZED: print indstr + indent + 'BlkFileLoc:', self.fileByteLoc if not self.nextBlkHash==UNINITIALIZED: #print indstr + indent + 'NextBlock: ', binary_to_hex(self.nextBlkHash) print indstr + indent + 'NextBlock: ', self.nextBlkHash if not self.numTx==UNINITIALIZED: print indstr + indent + 'NumTx: ', self.numTx if not self.intDifficult==UNINITIALIZED: print indstr + indent + 'Difficulty:', self.intDifficult if not self.sumDifficult==UNINITIALIZED: print indstr + indent + 'DiffSum: ', self.sumDifficult ################################################################################ ################################################################################ class PyBlockData(object): def __init__(self, txList=[]): self.txList = txList self.numTx = len(txList) self.merkleTree = [] self.merkleRoot = UNINITIALIZED def serialize(self): if self.numTx == UNINITIALIZED: raise UnitializedBlockDataError, 'PyBlockData object not initialized!' binOut = BinaryPacker() binOut.put(VAR_INT, self.numTx) for tx in self.txList: binOut.put(BINARY_CHUNK, tx.serialize()) return binOut.getBinaryString() def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): blkData = toUnpack else: blkData = BinaryUnpacker( toUnpack ) self.txList = [] self.numTx = blkData.get(VAR_INT) for i in xrange(self.numTx): self.txList.append( PyTx().unserialize(blkData) ) self.merkleTree = [] self.merkleRoot = '' return self def getTxHashList(self): if( self.numTx == UNINITIALIZED ): self.getMerkleRoot() return self.merkleTree[:self.numTx] def getMerkleRoot(self): assert( not self.numTx == UNINITIALIZED ) if len(self.merkleTree)==0 and not self.numTx==0: #Create the merkle tree self.merkleTree = [hash256(tx.serialize()) for tx in self.txList] sz = len(self.merkleTree) while sz > 1: hashes = self.merkleTree[-sz:] mod2 = sz%2 for i in range(sz/2): self.merkleTree.append( hash256(hashes[2*i] + hashes[2*i+1]) ) if mod2==1: self.merkleTree.append( hash256(hashes[-1] + hashes[-1]) ) sz = (sz+1) / 2 self.merkleRoot = self.merkleTree[-1] return self.merkleRoot def printMerkleTree(self, reverseHash=False, indent=''): print indent + 'Printing Merkle Tree:' if reverseHash: print indent + '(hashes will be reversed, like shown on BlockExplorer.com)' root = self.getMerkleRoot() print indent + 'Merkle Root:', binary_to_hex(root) for h in self.merkleTree: phash = binary_to_hex(h) if not reverseHash else binary_to_hex(h, endOut=BIGENDIAN) print indent + '\t' + phash def pprint(self, nIndent=0, endian=BIGENDIAN): indstr = indent*nIndent print indstr + 'BlockData:' print indstr + indent + 'MerkleRoot: ', binary_to_hex(self.getMerkleRoot(), endian), \ '(BE)' if endian==BIGENDIAN else '(LE)' print indstr + indent + 'NumTx: ', self.numTx for tx in self.txList: tx.pprint(nIndent+1, endian=endian) ################################################################################ ################################################################################ class PyBlock(object): def __init__(self, prevHeader=None, txlist=[]): self.blockHeader = PyBlockHeader() self.blockData = PyBlockData() if prevHeader: self.setPrevHeader(prevHeader) if txlist: self.setTxList(txlist) def serialize(self): assert( not self.blockHeader == UNINITIALIZED ) binOut = BinaryPacker() binOut.put(BINARY_CHUNK, self.blockHeader.serialize()) binOut.put(BINARY_CHUNK, self.blockData.serialize()) return binOut.getBinaryString() def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): blkData = toUnpack else: blkData = BinaryUnpacker( toUnpack ) self.txList = [] self.blockHeader = PyBlockHeader().unserialize(blkData) self.blockData = PyBlockData().unserialize(blkData) return self def getNumTx(self): return len(self.blockData.txList) def getSize(self): return len(self.serialize()) # Not sure how useful these manual block-construction methods # are. For now, I just need something with non-ridiculous vals def setPrevHeader(self, prevHeader, copyAttr=True): self.blockHeader.prevBlkHash = prevHeader.theHash self.blockHeader.nonce = 0 if copyAttr: self.blockHeader.version = prevHeader.version self.blockHeader.timestamp = prevHeader.timestamp+600 self.blockHeader.diffBits = prevHeader.diffBits def setTxList(self, txlist): self.blockData = PyBlockData(txlist) if not self.blockHeader == UNINITIALIZED: self.blockHeader.merkleRoot = self.blockData.getMerkleRoot() def tx(self, idx): return self.blockData.txList[idx] def pprint(self, nIndent=0, endian=BIGENDIAN): indstr = indent*nIndent print indstr + 'Block:' self.blockHeader.pprint(nIndent+1, endian=endian) self.blockData.pprint(nIndent+1, endian=endian) armory-0.92.3/armoryengine/Transaction.py0000644000000000000000000032103212414772654017167 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ import logging import os import CppBlockUtils as Cpp from armoryengine.ArmoryUtils import * from armoryengine.BinaryPacker import * from armoryengine.BinaryUnpacker import * from armoryengine.AsciiSerialize import AsciiSerializable UNSIGNED_TX_VERSION = 1 ################################################################################ # Identify all the codes/strings that are needed for dealing with scripts ################################################################################ # Start list of OP codes OP_0 = 0 OP_FALSE = 0 OP_PUSHDATA1 = 76 OP_PUSHDATA2 = 77 OP_PUSHDATA4 = 78 OP_1NEGATE = 79 OP_1 = 81 OP_TRUE = 81 OP_2 = 82 OP_3 = 83 OP_4 = 84 OP_5 = 85 OP_6 = 86 OP_7 = 87 OP_8 = 88 OP_9 = 89 OP_10 = 90 OP_11 = 91 OP_12 = 92 OP_13 = 93 OP_14 = 94 OP_15 = 95 OP_16 = 96 OP_NOP = 97 OP_IF = 99 OP_NOTIF = 100 OP_ELSE = 103 OP_ENDIF = 104 OP_VERIFY = 105 OP_RETURN = 106 OP_TOALTSTACK = 107 OP_FROMALTSTACK = 108 OP_IFDUP = 115 OP_DEPTH = 116 OP_DROP = 117 OP_DUP = 118 OP_NIP = 119 OP_OVER = 120 OP_PICK = 121 OP_ROLL = 122 OP_ROT = 123 OP_SWAP = 124 OP_TUCK = 125 OP_2DROP = 109 OP_2DUP = 110 OP_3DUP = 111 OP_2OVER = 112 OP_2ROT = 113 OP_2SWAP = 114 OP_CAT = 126 OP_SUBSTR = 127 OP_LEFT = 128 OP_RIGHT = 129 OP_SIZE = 130 OP_INVERT = 131 OP_AND = 132 OP_OR = 133 OP_XOR = 134 OP_EQUAL = 135 OP_EQUALVERIFY = 136 OP_1ADD = 139 OP_1SUB = 140 OP_2MUL = 141 OP_2DIV = 142 OP_NEGATE = 143 OP_ABS = 144 OP_NOT = 145 OP_0NOTEQUAL = 146 OP_ADD = 147 OP_SUB = 148 OP_MUL = 149 OP_DIV = 150 OP_MOD = 151 OP_LSHIFT = 152 OP_RSHIFT = 153 OP_BOOLAND = 154 OP_BOOLOR = 155 OP_NUMEQUAL = 156 OP_NUMEQUALVERIFY = 157 OP_NUMNOTEQUAL = 158 OP_LESSTHAN = 159 OP_GREATERTHAN = 160 OP_LESSTHANOREQUAL = 161 OP_GREATERTHANOREQUAL = 162 OP_MIN = 163 OP_MAX = 164 OP_WITHIN = 165 OP_RIPEMD160 = 166 OP_SHA1 = 167 OP_SHA256 = 168 OP_HASH160 = 169 OP_HASH256 = 170 OP_CODESEPARATOR = 171 OP_CHECKSIG = 172 OP_CHECKSIGVERIFY = 173 OP_CHECKMULTISIG = 174 OP_CHECKMULTISIGVERIFY = 175 opnames = ['']*256 opnames[0] = 'OP_0' for i in range(1,76): opnames[i] ='OP_PUSHDATA' opnames[76] = 'OP_PUSHDATA1' opnames[77] = 'OP_PUSHDATA2' opnames[78] = 'OP_PUSHDATA4' opnames[79] = 'OP_1NEGATE' opnames[81] = 'OP_1' opnames[81] = 'OP_TRUE' for i in range(1,17): opnames[80+i] = 'OP_' + str(i) opnames[97] = 'OP_NOP' opnames[99] = 'OP_IF' opnames[100] = 'OP_NOTIF' opnames[103] = 'OP_ELSE' opnames[104] = 'OP_ENDIF' opnames[105] = 'OP_VERIFY' opnames[106] = 'OP_RETURN' opnames[107] = 'OP_TOALTSTACK' opnames[108] = 'OP_FROMALTSTACK' opnames[115] = 'OP_IFDUP' opnames[116] = 'OP_DEPTH' opnames[117] = 'OP_DROP' opnames[118] = 'OP_DUP' opnames[119] = 'OP_NIP' opnames[120] = 'OP_OVER' opnames[121] = 'OP_PICK' opnames[122] = 'OP_ROLL' opnames[123] = 'OP_ROT' opnames[124] = 'OP_SWAP' opnames[125] = 'OP_TUCK' opnames[109] = 'OP_2DROP' opnames[110] = 'OP_2DUP' opnames[111] = 'OP_3DUP' opnames[112] = 'OP_2OVER' opnames[113] = 'OP_2ROT' opnames[114] = 'OP_2SWAP' opnames[126] = 'OP_CAT' opnames[127] = 'OP_SUBSTR' opnames[128] = 'OP_LEFT' opnames[129] = 'OP_RIGHT' opnames[130] = 'OP_SIZE' opnames[131] = 'OP_INVERT' opnames[132] = 'OP_AND' opnames[133] = 'OP_OR' opnames[134] = 'OP_XOR' opnames[135] = 'OP_EQUAL' opnames[136] = 'OP_EQUALVERIFY' opnames[139] = 'OP_1ADD' opnames[140] = 'OP_1SUB' opnames[141] = 'OP_2MUL' opnames[142] = 'OP_2DIV' opnames[143] = 'OP_NEGATE' opnames[144] = 'OP_ABS' opnames[145] = 'OP_NOT' opnames[146] = 'OP_0NOTEQUAL' opnames[147] = 'OP_ADD' opnames[148] = 'OP_SUB' opnames[149] = 'OP_MUL' opnames[150] = 'OP_DIV' opnames[151] = 'OP_MOD' opnames[152] = 'OP_LSHIFT' opnames[153] = 'OP_RSHIFT' opnames[154] = 'OP_BOOLAND' opnames[155] = 'OP_BOOLOR' opnames[156] = 'OP_NUMEQUAL' opnames[157] = 'OP_NUMEQUALVERIFY' opnames[158] = 'OP_NUMNOTEQUAL' opnames[159] = 'OP_LESSTHAN' opnames[160] = 'OP_GREATERTHAN' opnames[161] = 'OP_LESSTHANOREQUAL' opnames[162] = 'OP_GREATERTHANOREQUAL' opnames[163] = 'OP_MIN' opnames[164] = 'OP_MAX' opnames[165] = 'OP_WITHIN' opnames[166] = 'OP_RIPEMD160' opnames[167] = 'OP_SHA1' opnames[168] = 'OP_SHA256' opnames[169] = 'OP_HASH160' opnames[170] = 'OP_HASH256' opnames[171] = 'OP_CODESEPARATOR' opnames[172] = 'OP_CHECKSIG' opnames[173] = 'OP_CHECKSIGVERIFY' opnames[174] = 'OP_CHECKMULTISIG' opnames[175] = 'OP_CHECKMULTISIGVERIFY' opCodeLookup = {} opCodeLookup['OP_FALSE'] = 0 opCodeLookup['OP_0'] = 0 opCodeLookup['OP_PUSHDATA1'] = 76 opCodeLookup['OP_PUSHDATA2'] = 77 opCodeLookup['OP_PUSHDATA4'] = 78 opCodeLookup['OP_1NEGATE'] = 79 opCodeLookup['OP_1'] = 81 for i in range(1,17): opCodeLookup['OP_'+str(i)] = 80+i opCodeLookup['OP_TRUE'] = 81 opCodeLookup['OP_NOP'] = 97 opCodeLookup['OP_IF'] = 99 opCodeLookup['OP_NOTIF'] = 100 opCodeLookup['OP_ELSE'] = 103 opCodeLookup['OP_ENDIF'] = 104 opCodeLookup['OP_VERIFY'] = 105 opCodeLookup['OP_RETURN'] = 106 opCodeLookup['OP_TOALTSTACK'] = 107 opCodeLookup['OP_FROMALTSTACK'] = 108 opCodeLookup['OP_IFDUP'] = 115 opCodeLookup['OP_DEPTH'] = 116 opCodeLookup['OP_DROP'] = 117 opCodeLookup['OP_DUP'] = 118 opCodeLookup['OP_NIP'] = 119 opCodeLookup['OP_OVER'] = 120 opCodeLookup['OP_PICK'] = 121 opCodeLookup['OP_ROLL'] = 122 opCodeLookup['OP_ROT'] = 123 opCodeLookup['OP_SWAP'] = 124 opCodeLookup['OP_TUCK'] = 125 opCodeLookup['OP_2DROP'] = 109 opCodeLookup['OP_2DUP'] = 110 opCodeLookup['OP_3DUP'] = 111 opCodeLookup['OP_2OVER'] = 112 opCodeLookup['OP_2ROT'] = 113 opCodeLookup['OP_2SWAP'] = 114 opCodeLookup['OP_CAT'] = 126 opCodeLookup['OP_SUBSTR'] = 127 opCodeLookup['OP_LEFT'] = 128 opCodeLookup['OP_RIGHT'] = 129 opCodeLookup['OP_SIZE'] = 130 opCodeLookup['OP_INVERT'] = 131 opCodeLookup['OP_AND'] = 132 opCodeLookup['OP_OR'] = 133 opCodeLookup['OP_XOR'] = 134 opCodeLookup['OP_EQUAL'] = 135 opCodeLookup['OP_EQUALVERIFY'] = 136 opCodeLookup['OP_1ADD'] = 139 opCodeLookup['OP_1SUB'] = 140 opCodeLookup['OP_2MUL'] = 141 opCodeLookup['OP_2DIV'] = 142 opCodeLookup['OP_NEGATE'] = 143 opCodeLookup['OP_ABS'] = 144 opCodeLookup['OP_NOT'] = 145 opCodeLookup['OP_0NOTEQUAL'] = 146 opCodeLookup['OP_ADD'] = 147 opCodeLookup['OP_SUB'] = 148 opCodeLookup['OP_MUL'] = 149 opCodeLookup['OP_DIV'] = 150 opCodeLookup['OP_MOD'] = 151 opCodeLookup['OP_LSHIFT'] = 152 opCodeLookup['OP_RSHIFT'] = 153 opCodeLookup['OP_BOOLAND'] = 154 opCodeLookup['OP_BOOLOR'] = 155 opCodeLookup['OP_NUMEQUAL'] = 156 opCodeLookup['OP_NUMEQUALVERIFY'] = 157 opCodeLookup['OP_NUMNOTEQUAL'] = 158 opCodeLookup['OP_LESSTHAN'] = 159 opCodeLookup['OP_GREATERTHAN'] = 160 opCodeLookup['OP_LESSTHANOREQUAL'] = 161 opCodeLookup['OP_GREATERTHANOREQUAL'] = 162 opCodeLookup['OP_MIN'] = 163 opCodeLookup['OP_MAX'] = 164 opCodeLookup['OP_WITHIN'] = 165 opCodeLookup['OP_RIPEMD160'] = 166 opCodeLookup['OP_SHA1'] = 167 opCodeLookup['OP_SHA256'] = 168 opCodeLookup['OP_HASH160'] = 169 opCodeLookup['OP_HASH256'] = 170 opCodeLookup['OP_CODESEPARATOR'] = 171 opCodeLookup['OP_CHECKSIG'] = 172 opCodeLookup['OP_CHECKSIGVERIFY'] = 173 opCodeLookup['OP_CHECKMULTISIG'] = 174 opCodeLookup['OP_CHECKMULTISIGVERIFY'] = 175 #Word Opcode Description #OP_PUBKEYHASH = 253 Represents a public key hashed with OP_HASH160. #OP_PUBKEY = 254 Represents a public key compatible with OP_CHECKSIG. #OP_INVALIDOPCODE = 255 Matches any opcode that is not yet assigned. #[edit] Reserved words #Any opcode not assigned is also reserved. Using an unassigned opcode makes the transaction invalid. #Word Opcode When used... #OP_RESERVED = 80 Transaction is invalid #OP_VER = 98 Transaction is invalid #OP_VERIF = 101 Transaction is invalid #OP_VERNOTIF = 102 Transaction is invalid #OP_RESERVED1 = 137 Transaction is invalid #OP_RESERVED2 = 138 Transaction is invalid #OP_NOP1 = OP_NOP10 176-185 The word is ignored. ################################################################################ def getOpCode(name): return int_to_binary(opCodeLookup[name], widthBytes=1) ################################################################################ def getMultisigScriptInfo(rawScript): """ Gets the Multi-Sig tx type, as well as all the address-160 strings of the keys that are needed to satisfy this transaction. This currently only identifies M-of-N transaction types, returning unknown otherwise. However, the address list it returns should be valid regardless of whether the type was unknown: we assume all 20-byte chunks of data are public key hashes, and 65-byte chunks are public keys. M==0 (output[0]==0) indicates this isn't a multisig script """ if not getTxOutScriptType(rawScript)==CPP_TXOUT_MULTISIG: return [0, 0, None, None] scrAddr = '' addr160List = [] pubKeyList = [] M,N = 0,0 pubKeyStr = Cpp.BtcUtils().getMultisigPubKeyInfoStr(rawScript) bu = BinaryUnpacker(pubKeyStr) M = bu.get(UINT8) N = bu.get(UINT8) if M==0: return [0, 0, None, None] for i in range(N): pkstr = bu.get(BINARY_CHUNK, 33) if pkstr[0] == '\x04': pkstr += bu.get(BINARY_CHUNK, 32) pubKeyList.append(pkstr) addr160List.append(hash160(pkstr)) return M, N, addr160List, pubKeyList ################################################################################ def getHash160ListFromMultisigScrAddr(scrAddr): mslen = len(scrAddr) - 3 if not (mslen%20==0 and scrAddr[0]==SCRADDR_MULTISIG_BYTE): raise BadAddressError('Supplied ScrAddr is not multisig!') catList = scrAddr[3:] return [catList[20*i:20*(i+1)] for i in range(len(catList)/20)] ################################################################################ # These two methods are just easier-to-type wrappers around the C++ methods def getTxOutScriptType(script): return Cpp.BtcUtils().getTxOutScriptTypeInt(script) ################################################################################ # These two methods are just easier-to-type wrappers around the C++ methods def getTxOutScriptDisplayStr(script): scrAddr = script_to_scrAddr(script) scrType = getTxOutScriptType(script) if scrType in CPP_TXOUT_HAS_ADDRSTR: return scrAddr_to_addrStr(scrAddr) elif scrType==CPP_TXOUT_MULTISIG: M, N, addrs, pubs = getMultisigScriptInfo(script) p2shStr = script_to_addrStr(script_to_p2sh_script(script)) return '[Multisig %d-of-%d] (not P2SH but would be %s)' % (M,N,p2shStr) else: return '[Non-Standard Script: %s]: ' % binary_to_hex(scrAddr[1:65]) ################################################################################ def getTxInScriptType(txinObj): """ NOTE: this method takes a TXIN object, not just the script itself. This is because this method needs to see the OutPoint to distinguish an UNKNOWN TxIn from a coinbase-TxIn """ script = txinObj.binScript prevTx = txinObj.outpoint.txHash return Cpp.BtcUtils().getTxInScriptTypeInt(script, prevTx) ################################################################################ def getTxInP2SHScriptType(txinObj): """ If this TxIn is identified as SPEND-P2SH, then it contains a subscript that is really a TxOut script (which must hash to the value included on the actual TxOut script). Use this to get the TxOut script type of the Spend-P2SH subscript """ scrType = getTxInScriptType(txinObj) if not scrType==CPP_TXIN_SPENDP2SH: return None lastPush = Cpp.BtcUtils().getLastPushDataInScript(txinObj.binScript) return getTxOutScriptType(lastPush) ################################################################################ def TxInExtractAddrStrIfAvail(txinObj): rawScript = txinObj.binScript prevTxHash = txinObj.outpoint.txHash scrType = Cpp.BtcUtils().getTxInScriptTypeInt(rawScript, prevTxHash) lastPush = Cpp.BtcUtils().getLastPushDataInScript(rawScript) if scrType in [CPP_TXIN_STDUNCOMPR, CPP_TXIN_STDCOMPR]: return hash160_to_addrStr( hash160(lastPush) ) elif scrType == CPP_TXIN_SPENDP2SH: return binScript_to_p2shAddrStr(lastPush) else: return '' ################################################################################ def TxInExtractPreImageIfAvail(txinObj): rawScript = txinObj.binScript prevTxHash = txinObj.outpoint.txHash scrType = Cpp.BtcUtils().getTxInScriptTypeInt(rawScript, prevTxHash) if scrType == [CPP_TXIN_STDUNCOMPR, CPP_TXIN_STDCOMPR, CPP_TXIN_SPENDP2SH]: return Cpp.BtcUtils().getLastPushDataInScript(rawScript) else: return '' # Finally done with all the base conversion functions and ECDSA code # Now define the classes for the objects that will use this ################################################################################ # Transaction Classes ################################################################################ ##### class BlockComponent(object): def copy(self): return self.__class__().unserialize(self.serialize()) def serialize(self): raise NotImplementedError def unserialize(self): raise NotImplementedError ################################################################################ class PyOutPoint(BlockComponent): def __init__(self, txHash=None, txOutIndex=None): self.txHash = txHash self.txOutIndex = txOutIndex def __eq__(self, op2): return self.serialize()==op2.serialize() def __ne__(self, op2): return not self.__eq__(op2) def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): opData = toUnpack else: opData = BinaryUnpacker( toUnpack ) if opData.getRemainingSize() < 36: raise UnserializeError self.txHash = opData.get(BINARY_CHUNK, 32) self.txOutIndex = opData.get(UINT32) return self def serialize(self): binOut = BinaryPacker() binOut.put(BINARY_CHUNK, self.txHash) binOut.put(UINT32, self.txOutIndex) return binOut.getBinaryString() def pprint(self, nIndent=0, endian=BIGENDIAN): indstr = indent*nIndent print indstr + 'OutPoint:' print indstr + indent + 'PrevTxHash:', \ binary_to_hex(self.txHash, endian), \ '(BE)' if endian==BIGENDIAN else '(LE)' print indstr + indent + 'TxOutIndex:', self.txOutIndex ##### class PyTxIn(BlockComponent): def __init__(self): self.outpoint = UNINITIALIZED self.binScript = UNINITIALIZED self.intSeq = 2**32-1 def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): txInData = toUnpack else: txInData = BinaryUnpacker( toUnpack ) self.outpoint = PyOutPoint().unserialize(txInData.get(BINARY_CHUNK, 36) ) scriptSize = txInData.get(VAR_INT) if txInData.getRemainingSize() < scriptSize+4: raise UnserializeError self.binScript = txInData.get(BINARY_CHUNK, scriptSize) self.intSeq = txInData.get(UINT32) return self def getScript(self): return self.binScript def serialize(self): binOut = BinaryPacker() binOut.put(BINARY_CHUNK, self.outpoint.serialize() ) binOut.put(VAR_INT, len(self.binScript)) binOut.put(BINARY_CHUNK, self.binScript) binOut.put(UINT32, self.intSeq) return binOut.getBinaryString() def pprint(self, nIndent=0, endian=BIGENDIAN): indstr = indent*nIndent print indstr + 'PyTxIn:' print indstr + indent + 'PrevTxHash:', \ binary_to_hex(self.outpoint.txHash, endian), \ '(BE)' if endian==BIGENDIAN else '(LE)' print indstr + indent + 'TxOutIndex:', self.outpoint.txOutIndex print indstr + indent + 'Script: ', \ '('+binary_to_hex(self.binScript)[:64]+')' addrStr = TxInExtractAddrStrIfAvail(self) if len(addrStr)==0: addrStr = '' print indstr + indent + 'Sender: ', addrStr print indstr + indent + 'Seq: ', self.intSeq def toString(self, nIndent=0, endian=BIGENDIAN): indstr = indent*nIndent indstr2 = indstr + indent result = indstr + 'PyTxIn:' result = ''.join([result, '\n', indstr2 + 'PrevTxHash:', \ binary_to_hex(self.outpoint.txHash, endian), \ '(BE)' if endian==BIGENDIAN else '(LE)']) result = ''.join([result, '\n', indstr2 + 'TxOutIndex:', \ str(self.outpoint.txOutIndex)]) result = ''.join([result, '\n', indstr2 + 'Script: ', \ '('+binary_to_hex(self.binScript)[:64]+'...)']) addrStr = TxInExtractAddrStrIfAvail(self) if len(addrStr)>0: result = ''.join([result, '\n', indstr2 + 'Sender: ', addrStr]) result = ''.join([result, '\n', indstr2 + 'Seq: ', str(self.intSeq)]) return result # Before broadcasting a transaction make sure that the script is canonical # This TX could have been signed by an older version of the software. # Either on the offline Armory installation which may not have been upgraded # or on a previous installation of Armory on this computer. def minimizeDERSignaturePadding(self): rsLen = binary_to_int(self.binScript[2:3]) rLen = binary_to_int(self.binScript[4:5]) rBin = self.binScript[5:5+rLen] sLen = binary_to_int(self.binScript[6+rLen:7+rLen]) sBin = self.binScript[7+rLen:7+rLen+sLen] sigScript = createDERSigFromRS(rBin, sBin) newBinScript = int_to_binary(len(sigScript)+1) + sigScript + self.binScript[3+rsLen:] paddingRemoved = newBinScript != self.binScript newTxIn = self.copy() newTxIn.binScript = newBinScript return paddingRemoved, newTxIn ##### class PyTxOut(BlockComponent): def __init__(self): self.value = UNINITIALIZED self.binScript = UNINITIALIZED def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): txOutData = toUnpack else: txOutData = BinaryUnpacker( toUnpack ) self.value = txOutData.get(UINT64) scriptSize = txOutData.get(VAR_INT) if txOutData.getRemainingSize() < scriptSize: raise UnserializeError self.binScript = txOutData.get(BINARY_CHUNK, scriptSize) return self def getValue(self): return self.value def getScript(self): return self.binScript def serialize(self): binOut = BinaryPacker() binOut.put(UINT64, self.value) binOut.put(VAR_INT, len(self.binScript)) binOut.put(BINARY_CHUNK, self.binScript) return binOut.getBinaryString() def pprint(self, nIndent=0, endian=BIGENDIAN): """ indstr = indent*nIndent indstr2 = indent*nIndent + indent print indstr + 'TxOut:' print indstr2 + 'Value: ', self.value, '(', float(self.value) / ONE_BTC, ')' txoutType = getTxOutScriptType(self.binScript) if txoutType in [CPP_TXOUT_STDPUBKEY33, CPP_TXOUT_STDPUBKEY65]: print indstr2 + 'Script: PubKey(%s) OP_CHECKSIG' % \ script_to_addrStr(self.binScript) elif txoutType == CPP_TXOUT_STDHASH160: print indstr2 + 'Script: OP_DUP OP_HASH160 (%s) OP_EQUALVERIFY OP_CHECKSIG' % \ script_to_addrStr(self.binScript) elif txoutType == CPP_TXOUT_P2SH: print indstr2 + 'Script: OP_HASH160 (%s) OP_EQUAL' % \ script_to_addrStr(self.binScript) else: opStrList = convertScriptToOpStrings(self.binScript) print indstr + indent + 'Script: ', ' '.join(opStrList) """ print self.toString(nIndent, endian) def toString(self, nIndent=0, endian=BIGENDIAN): indstr = indent*nIndent indstr2 = indent*nIndent + indent valStr, btcStr = str(self.value), str(float(self.value)/ONE_BTC) result = indstr + 'TxOut:\n' result += indstr2 + 'Value: %s (%s)\n' % (valStr, btcStr) result += indstr2 txoutType = getTxOutScriptType(self.binScript) if txoutType in [CPP_TXOUT_STDPUBKEY33, CPP_TXOUT_STDPUBKEY65]: result += 'Script: PubKey(%s) OP_CHECKSIG \n' % \ script_to_addrStr(self.binScript) elif txoutType == CPP_TXOUT_STDHASH160: result += 'Script: OP_DUP OP_HASH160 (%s) OP_EQUALVERIFY OP_CHECKSIG' % \ script_to_addrStr(self.binScript) elif txoutType == CPP_TXOUT_P2SH: result += 'Script: OP_HASH160 (%s) OP_EQUAL' % \ script_to_addrStr(self.binScript) else: opStrList = convertScriptToOpStrings(self.binScript) result += 'Script: ' + ' '.join(opStrList) return result ##### class PyTx(BlockComponent): def __init__(self): self.version = UNINITIALIZED self.inputs = UNINITIALIZED self.outputs = UNINITIALIZED self.lockTime = 0 self.thisHash = UNINITIALIZED def serialize(self): binOut = BinaryPacker() binOut.put(UINT32, self.version) binOut.put(VAR_INT, len(self.inputs)) for txin in self.inputs: binOut.put(BINARY_CHUNK, txin.serialize()) binOut.put(VAR_INT, len(self.outputs)) for txout in self.outputs: binOut.put(BINARY_CHUNK, txout.serialize()) binOut.put(UINT32, self.lockTime) return binOut.getBinaryString() def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): txData = toUnpack else: txData = BinaryUnpacker( toUnpack ) startPos = txData.getPosition() self.inputs = [] self.outputs = [] self.version = txData.get(UINT32) numInputs = txData.get(VAR_INT) for i in xrange(numInputs): self.inputs.append( PyTxIn().unserialize(txData) ) numOutputs = txData.get(VAR_INT) for i in xrange(numOutputs): self.outputs.append( PyTxOut().unserialize(txData) ) self.lockTime = txData.get(UINT32) endPos = txData.getPosition() self.nBytes = endPos - startPos self.thisHash = hash256(self.serialize()) return self # Before broadcasting a transaction make sure that the script is canonical # This TX could have been signed by an older version of the software. # Either on the offline Armory installation which may not have been upgraded # or on a previous installation of Armory on this computer. def minimizeDERSignaturePadding(self): paddingRemoved = False newTx = self.copy() newTx.inputs = [] for txIn in self.inputs: paddingRemovedFromTxIn, newTxIn = txIn.minimizeDERSignaturePadding() if paddingRemovedFromTxIn: paddingRemoved = True newTx.inputs.append(newTxIn) else: newTx.inputs.append(txIn) return paddingRemoved, newTx.copy() def getHash(self): return hash256(self.serialize()) def getHashHex(self, endianness=LITTLEENDIAN): return binary_to_hex(self.getHash(), endOut=endianness) def copy(self): return PyTx().unserialize(self.serialize()) def makeRecipientsList(self): """ Make a list of lists, each one containing information about an output in this tx. Usually contains [ScriptType, Value, Script] May include more information if any of the scripts are multi-sig, such as public keys and multi-sig type (M-of-N) """ recipInfoList = [] for txout in self.outputs: recipInfoList.append([]) scrType = getTxOutScriptType(txout.binScript) recipInfoList[-1].append(scrType) recipInfoList[-1].append(txout.value) recipInfoList[-1].append(txout.binScript) if scrType == CPP_TXOUT_MULTISIG: recipInfoList[-1].append(getMultisigScriptInfo(txout.binScript)) else: recipInfoList[-1].append([]) return recipInfoList def pprint(self, nIndent=0, endian=BIGENDIAN): indstr = indent*nIndent print indstr + 'Transaction:' print indstr + indent + 'TxHash: ', self.getHashHex(endian), \ '(BE)' if endian==BIGENDIAN else '(LE)' print indstr + indent + 'Version: ', self.version print indstr + indent + 'nInputs: ', len(self.inputs) print indstr + indent + 'nOutputs: ', len(self.outputs) print indstr + indent + 'LockTime: ', self.lockTime print indstr + indent + 'Inputs: ' for inp in self.inputs: inp.pprint(nIndent+2, endian=endian) print indstr + indent + 'Outputs: ' for out in self.outputs: out.pprint(nIndent+2, endian=endian) def toString(self, nIndent=0, endian=BIGENDIAN): indstr = indent*nIndent result = indstr + 'Transaction:' result = ''.join([result, '\n', indstr + indent + 'TxHash: ', self.getHashHex(endian), \ '(BE)' if endian==BIGENDIAN else '(LE)']) result = ''.join([result, '\n', indstr + indent + 'Version: ', str(self.version)]) result = ''.join([result, '\n', indstr + indent + 'nInputs: ', str(len(self.inputs))]) result = ''.join([result, '\n', indstr + indent + 'nOutputs: ', str(len(self.outputs))]) result = ''.join([result, '\n', indstr + indent + 'LockTime: ', str(self.lockTime)]) result = ''.join([result, '\n', indstr + indent + 'Inputs: ']) for inp in self.inputs: result = ''.join([result, '\n', inp.toString(nIndent+2, endian=endian)]) result = ''.join([result, '\n', indstr + indent + 'Outputs: ']) for out in self.outputs: result = ''.join([result, '\n', out.toString(nIndent+2, endian=endian)]) return result def fetchCpp(self): """ Use the info in this PyTx to get the C++ version from TheBDM """ return TheBDM.getTxByHash(self.getHash()) def pprintHex(self, nIndent=0): bu = BinaryUnpacker(self.serialize()) theSer = self.serialize() print binary_to_hex(bu.get(BINARY_CHUNK, 4)) nTxin = bu.get(VAR_INT) print 'VAR_INT(%d)' % nTxin for i in range(nTxin): print binary_to_hex(bu.get(BINARY_CHUNK,32)) print binary_to_hex(bu.get(BINARY_CHUNK,4)) scriptSz = bu.get(VAR_INT) print 'VAR_IN(%d)' % scriptSz print binary_to_hex(bu.get(BINARY_CHUNK,scriptSz)) print binary_to_hex(bu.get(BINARY_CHUNK,4)) nTxout = bu.get(VAR_INT) print 'VAR_INT(%d)' % nTxout for i in range(nTxout): print binary_to_hex(bu.get(BINARY_CHUNK,8)) scriptSz = bu.get(VAR_INT) print binary_to_hex(bu.get(BINARY_CHUNK,scriptSz)) print binary_to_hex(bu.get(BINARY_CHUNK, 4)) # Use to identify status of individual sigs on an UnsignedTxINPUT TXIN_SIGSTAT = enum('ALREADY_SIGNED', 'WLT_ALREADY_SIGNED', 'WLT_CAN_SIGN', 'NO_SIGNATURE') # Use to identify status of USTXI objects of an UnsignedTransaction obj TX_SIGSTAT = enum('SIGNING_COMPLETE', 'WLT_CAN_COMPLETE', 'WLT_CAN_CONTRIB', 'CANNOT_COMPLETE') ################################################################################ # This is a container object for holding data about USTXI signing status class InputSigningStatus(object): def __init__(self): self.M = 0 self.N = 0 self.statusN = [] self.statusM = [] self.allSigned = False self.wltCanSign = False self.wltIsRelevant = False self.wltCanComplete = False def pprint(self, indent=3, lutFunc=None): if lutFunc is None: def lutDispLetter(code): if code==TXIN_SIGSTAT.ALREADY_SIGNED: return '#' elif code==TXIN_SIGSTAT.WLT_ALREADY_SIGNED: return '@' elif code==TXIN_SIGSTAT.WLT_CAN_SIGN: return '-' elif code==TXIN_SIGSTAT.NO_SIGNATURE: return '_' lutFunc = lutDispLetter ind = ' '*indent print ind, print '(%d-of-%d)' % (self.M, self.N), print 'AllSigned: %s' % str(self.allSigned).ljust(6), print 'AllSlots:', ' '.join([lutFunc(s) for s in self.statusN]), ' ', print 'ReqSorted:', ' '.join([lutFunc(s) for s in self.statusM]), ' ' ################################################################################ # This is a container object for holding a list of InputSigningStatus objects # and aggregating info about class TxSigningStatus(object): def __init__(self): self.numInputs = 0 self.statusList = [] self.canBroadcast = False self.wltCanSign = False self.wltIsRelevant = False self.wltAlreadySigned = False self.wltCanComplete = False def pprint(self, indent=3, lutFunc=None): print ' '*indent + 'Tx has %d inputs:' % self.numInputs for stat in self.statusList: stat.pprint(indent+3, lutFunc) ################################################################################ def generatePreHashTxMsgToSign(pytx, txInIndex, prevTxOutScript, hashcode=1): """ This wraps up all the complexity of: https://en.bitcoin.it/w/images/en/7/70/Bitcoin_OpCheckSig_InDetail.png into a few simple lines of code! (blank all scripts except this one, insert prev script, append hashcode) Right now only supports SIGHASH_ALL """ if not hashcode==1: LOGERROR('Only hashcode=1 is supported at this time!') LOGERROR('Requested hashcode=%d' % hashcode) return None # Create a copy of the tx with all scripts blanked out txCopy = pytx.copy() for i in range(len(txCopy.inputs)): txCopy.inputs[i].binScript = '' # Set the script of the TxIn being signed, to the previous TxOut script txCopy.inputs[txInIndex].binScript = prevTxOutScript hashCode1 = int_to_binary(hashcode, widthBytes=1) hashCode4 = int_to_binary(hashcode, widthBytes=4, endOut=LITTLEENDIAN) preHashMsg = txCopy.serialize() + hashCode4 return preHashMsg, hashCode1 ################################################################################ class UnsignedTxInput(AsciiSerializable): """ The name is really "UnsignedTx" input ... it is an input of an unsignedTx This used to be part of the PyTxDP class itself, but it didn't make sense to be tracking all those individual, parallel lists anymore. So now we use this class to hold all the data that used to be split between half a dozen TxDP vars, and just store a list of these in the TxDP. This holds the full, raw, supporting transaction for the particular input needing to be signed, as well as the raw P2SH script if needed. Can also store a "contributor" ID -- all UTXO inputs with the same contribID will be shown in the user interface as belonging to a single person/device. A "locator" is a 4-byte, user-specified string, that identifies where in a BIP32 wallet a particular address is located. This isn't needed for regular Armory wallets, but may be needed in the future for HW or other lightweight wallets to be able to locate their keys (because they don't store all the keys, they compute them on-the-fly and need to be told the BIP32 branch where it is). This class will also be used to store/track signatures. Note that for regular Pay2PubKeyHash scripts, "adding a signature" to this object means also adding a public key insert* inputs are either single values (for single-sig scraddrs), or [index, val] pairs which specify which input is associated with the val self.txoScript is always the exact script of the TxOut being spend self.scriptType is the CPP_TXOUT_TYPE of the txoScript *UNLESS* that script is P2SH -- then it will be the type of the P2SH subscript, and that subscript will be stored in self.p2shScript i.e. consider a bare multisig and a P2SH multisig: Bare Multisig: scriptType == CPP_TXOUT_MULTISIG txoScript == "OP_2 [KeyA] [KeyB] [KeyC] OP_3 OP_CHECKMULTISIG" p2shScript == '' Same script but using P2SH: scriptType == CPP_TXOUT_MULTISIG txoScript == "OP_DUP [ScriptHash] OP_EQUALVERIFY" p2shScript == "OP_2 [KeyA] [KeyB] [KeyC] OP_3 OP_CHECKMULTISIG" The txoScript variable always contains the script that needs to be inserted into the TxIn script when signing (look at OP_CHECKSIG for details) """ EQ_ATTRS_SIMPLE = ['version', 'supportTx', 'outpoint', 'txoScript', 'value', 'scriptType', 'contribID', 'contribLabel', 'p2shScript', 'sequence', 'keysListed', 'sigsNeeded'] EQ_ATTRS_LISTS = ['scrAddrs', 'signatures', 'wltLocators', 'pubKeys'] ############################################################################# def __init__(self, rawSupportTx='', txoutIndex=-1, p2sh=None, pubKeyMap=None, insertSigs=None, insertWltLocs=None, contribID=None, contribLabel=None, sequence=UINT32_MAX, version=UNSIGNED_TX_VERSION): if not rawSupportTx: self.isInitialized = False return tx = PyTx().unserialize(rawSupportTx) txout = tx.outputs[txoutIndex] self.isInitialized = True self.version = version self.supportTx = rawSupportTx self.outpoint = PyOutPoint(hash256(rawSupportTx), txoutIndex) self.txoScript = txout.getScript() self.scriptType = getTxOutScriptType(self.txoScript) self.value = txout.getValue() self.contribID = '' if contribID is None else contribID self.contribLabel= '' if contribLabel is None else contribLabel self.p2shScript = '' if p2sh is None else p2sh self.sequence = sequence # Each of these will be a single value for single-signature UTXOs self.keysListed = 0 self.sigsNeeded = 0 self.scrAddrs = None self.pubKeys = None self.signatures = None self.wltLocators = None if pubKeyMap is not None and not isinstance(pubKeyMap, dict): if isinstance(pubKeyMap, (list,tuple)): pub = dict([[SCRADDR_P2PKH_BYTE+hash160(pk), pk] for pk in pubKeyMap]) elif isinstance(pubKeyMap, basestring): pub = {SCRADDR_P2PKH_BYTE+hash160(pubKeyMap): pubKeyMap} else: LOGERROR('Invalid type for pub keys input: %s', str(type(pubKeyMap))) self.isInitialized = False return pubKeyMap = pub ##### if not self.sequence==UINT32_MAX: LOGWARN('WARNING: NON-MAX SEQUENCE NUMBER ON UNSIGNEDTX INPUT!') LOGWARN('Sequence: %d' % self.sequence) ##### # If this is P2SH, let's check things, and then use the sub-script baseScript = self.txoScript if self.scriptType==CPP_TXOUT_P2SH: # If we're here, we should've passed in a P2SH script if self.p2shScript is None: self.isInitialized = False raise UstxError('No P2SH script supplied for P2SH input') # Sanity check tha the supplied P2SH script actually matches self.p2shScrAddr = script_to_scrAddr(baseScript) scriptHash = hash160(self.p2shScript) if not SCRADDR_P2SH_BYTE+scriptHash == self.p2shScrAddr: self.isInitialized = False raise InvalidScriptError, 'No P2SH script info avail for TxDP' # Replace script type with that of the sub-script # We can use the presence of p2shScript to identify it's p2sh # Do the rest of the processing with the baseScript though we # will leave self.txoScript alone since that needs to be the # original script baseScript = self.p2shScript self.scriptType = getTxOutScriptType(self.p2shScript) ##### # Fill some of the other fields with info needed to spend the script if self.scriptType==CPP_TXOUT_P2SH: # If this is a P2SH script, we've already overwritten the script # type with the type of sub script. If we're here, this means # that the subscript is also P2SH, which is not allowed raise InvalidScriptError('Cannot have recursive P2SH scripts!') elif self.scriptType in CPP_TXOUT_STDSINGLESIG: scrAddr = script_to_scrAddr(baseScript) if pubKeyMap is None or pubKeyMap.get(scrAddr) is None: raise KeyDataError('Must give pubkey map for singlesig USTXI!') self.sigsNeeded = 1 self.keysListed = 1 self.scrAddrs = [scrAddr] self.pubKeys = [pubKeyMap[scrAddr]] self.signatures = [''] self.wltLocators = [''] elif self.scriptType==CPP_TXOUT_MULTISIG: M, N, a160s, pubs = getMultisigScriptInfo(baseScript) self.sigsNeeded = M self.keysListed = N self.scrAddrs = [SCRADDR_P2PKH_BYTE+a for a in a160s] self.pubKeys = pubs[:] self.signatures = ['']*N self.wltLocators = ['']*N else: LOGWARN("Non-standard script for TxIn %d" % i) pass # "insert*s" can either be a single values, or a list # of pairs [multisgIndex, pubKey] insertData = [(insertSigs, self.setSignature), (insertWltLocs, self.setWltLocator)] for insList,insFunc in insertData: if insList is None: continue listlist = insList if not isinstance(listlist, (list, tuple)): listlist = [[0, insList]] if not isinstance(listlist[0], (list, tuple)): listlist = [listlist] for idx,data in listlist: if idx >= self.keysListed: LOGERROR('Insert list has index too big') continue insFunc(idx, data) ############################################################################# def setPubKey(self, msIndex, pubKey): self.pubKeys[msIndex] = pubKey ############################################################################# def setSignature(self, msIndex, sigStr): LOGDEBUG('Setting signature in key index: %d' % msIndex) self.signatures[msIndex] = sigStr ############################################################################# def setWltLocator(self, msIndex, wltLoc): self.wltLocators[msIndex] = wltLoc ############################################################################# def getPublicKeyList(self): """ This returns a list of PAIRS: [pubkey, wltLocator] The wallet-locator is a client-dependent string which helps lightweight wallets find a particular key within their own wallet structure. This would only be used by clients that don't store any keys, but always recompute them on the fly. As of this writing, I'm not aware of any wallets doing this yet, so you can expect all wltLoc's to be empty. And even if they are not empty, you can still ignore it, unless you put the wltLoc yourself to help yourself out later! """ return zip(self.pubKeys, self.wltLocators) ############################################################################# def createSigScript(self, stripExtraSigs=True): """ Here, we don't care what the orig script was in the TxOut being spent, unless it was P2SH. It's because this method assumes that all the sigs are already created, valid and in the right place -- which requires the previous TxOut script to do (before we get to this method). The exception is if this is P2SH, in which case we have to append the script to the end of the sigScript. However we *do* care about the original TxOut script's TYPE, so that we know what data to include in the sig script. For instance, Pay2PubKey scripts only require a signature, whereas Pay2PubKeyHash requires both a pub key and a sig. P2SH always needs the serialized script appended to the end of it. """ outScript = '' if self.scriptType in CPP_TXOUT_STDSINGLESIG and not self.signatures[0]: return '' # All signatures are already DER-encoded. if self.scriptType == CPP_TXOUT_P2SH: raise InvalidScriptError('Nested P2SH not allowed') if self.scriptType in [CPP_TXOUT_STDPUBKEY33, CPP_TXOUT_STDPUBKEY65]: # Only need the signature to complete coinbase TxOut outScript = scriptPushData(self.signatures[0]) elif self.scriptType==CPP_TXOUT_STDHASH160: # Gotta include the public key, too, for standard TxOuts serSig = scriptPushData(self.signatures[0]) serPubKey = scriptPushData(self.pubKeys[0]) outScript = serSig + serPubKey elif self.scriptType==CPP_TXOUT_MULTISIG: # Serialize non-empty sigs, replace empty ones with OP_0 sigList = self.signatures[:] countSigs = lambda slist: sum([ (1 if s else 0) for s in slist ]) if stripExtraSigs: # Mainnet appears to treat extra sigs as non-std. Remove if req while countSigs(sigList) > self.sigsNeeded: sigList.pop() OP_0 = getOpCode('OP_0') pushSig = lambda sig: (scriptPushData(sig) if sig else '') outScript = OP_0 + ''.join([pushSig(s) for s in sigList]) else: raise InvalidScriptError('Non-std script, cannot create sig script') # If P2SH, the script type already identifies the subscript. But we # can tell because the p2shScript var will be non-empty. All we do # for these types of script is append the raw p2sh script to the end if len(self.p2shScript) > 0: outScript += scriptPushData(self.p2shScript) return outScript ############################################################################# def createTxSignature(self, pytx, sbdPrivKey, hashcode=1): """ This might be a little confusing ... remember this is an input for a transaction which may not have been fully defined at the time this object was created. We supply the final PyTx object is being signed, and assume that this input is one of them. Then we produce the signature using the CryptoECDSA module and the supplied privKey. This returns a DER-encoded signature string with the 1-byte hashcode appended to the end """ # Make sure the supplied privateKey is relevant to this USTXI computedPub = CryptoECDSA().ComputePublicKey(sbdPrivKey).toBinStr() if not computedPub in self.pubKeys: raise SignatureError('No PubKey that matches this privKey') txiIdx = -1 for i,txin in enumerate(pytx.inputs): if self.outpoint.serialize()==txin.outpoint.serialize(): txiIdx = i break else: raise SignatureError('No TxIn in tx that matches this USTXI') msg,hc = generatePreHashTxMsgToSign(pytx, txiIdx, self.getTxoScriptToSign(), hashcode) sbdSig = CryptoECDSA().SignData(SecureBinaryData(msg), sbdPrivKey) binSig = sbdSig.toBinStr() return createDERSigFromRS(binSig[:32], binSig[32:]) + hc ############################################################################# def insertSignature(self, sigStr, pubKey): """ Returns -1 if no sig can be added, index of last sig added otherwise (usually only one sig added, but if this is a multisig and has repeated public keys, it will insert the sig in every slot for which it is valid) """ msIdx = -1 while(True): try: newIdx = self.pubKeys.index(pubKey, msIdx+1) except ValueError: # Eventually we run out of slots to insert into and error out. # Since we're using [].index(), exception-control-flow is easiest return msIdx msIdx = newIdx self.setSignature(msIdx, sigStr) ############################################################################# def createAndInsertSignature(self, pytx, sbdPrivKey, hashcode=1): derSig = self.createTxSignature(pytx, sbdPrivKey, hashcode) computedPub = CryptoECDSA().ComputePublicKey(sbdPrivKey).toBinStr() msIdx = self.insertSignature(derSig, computedPub) return derSig, msIdx ############################################################################# def verifyTxSignature(self, pytx, sigStr, pubKey=None): return (self.getValidIndexForSignature(pytx, sigStr, pubKey) >= 0) ############################################################################# def getValidIndexForSignature(self, pytx, sigStr, pubKey=None): """ IMPORTANT: This returns the index in the self.pubKeys list, for which the signature is valid! -1 is returned if the signature is not valid for any pubkey! For boolean query, use: isValid = (verifyTxSignature(...) >= 0) """ txiIdx = -1 for i,txin in enumerate(pytx.inputs): if self.outpoint.serialize()==txin.outpoint.serialize(): txiIdx = i break else: raise SignatureError('No TxIn that matches this USTXI') # If we were not given a public key to use for verification, # recurse into this method once with each of self.pubKeys. # We've assumed up until now that pubkeys and p2sh script will # always be available with the supportingTx, all as part of the # USTXI class if pubKey is None: for i,pubk in enumerate(self.pubKeys): if self.verifyTxSignature(pytx, sigStr, pubk): return i return -1 # If public key is supplied (including on recursion) try: msIndex = self.pubKeys.index(pubKey) except ValueError: raise KeyDataError('Supplied pubkey does not match any USTXI keys') rBin, sBin = getRSFromDERSig(sigStr) hashcode = binary_to_int(sigStr[-1]) # Don't forget "sigStr" has the 1-byte hashcode at the end msg = generatePreHashTxMsgToSign(pytx, txiIdx, self.getTxoScriptToSign(), hashcode)[0] sbdMsg = SecureBinaryData(msg) sbdSig = SecureBinaryData(rBin + sBin) sbdPub = SecureBinaryData(pubKey) return msIndex if CryptoECDSA().VerifyData(sbdMsg, sbdSig, sbdPub) else -1 ############################################################################# # make sure to sign the p2shScript if it is there, other wise sign the txoScript # For p2sh the txoScript is not signed, it's compared with the p2sh that # supplied as input, and the signatures reference that script for p2sh def getTxoScriptToSign(self): return self.p2shScript if self.p2shScript else self.txoScript ############################################################################# def verifyAllSignatures(self, pytx): M = self.sigsNeeded N = self.keysListed signStat = self.evaluateSigningStatus() # If we don't have enough raw signatures, bail now if not signStat.allSigned: return False # Now check that all the raw signatures are actually value numValid = 0 # we'll double check sufficient sigs for i in range(signStat.N): if signStat.statusN[i] in [TXIN_SIGSTAT.ALREADY_SIGNED, \ TXIN_SIGSTAT.WLT_ALREADY_SIGNED]: pub = self.pubKeys[i] sig = self.signatures[i] if self.verifyTxSignature(pytx, sig, pub): numValid +=1 else: LOGERROR('Signature in USTXI is not valid') return (numValid >= M) ############################################################################# def toJSONMap(self, lite=False): outjson = {} outjson['version'] = self.version outjson['magicbytes'] = binary_to_hex(MAGIC_BYTES) outjson['outpoint'] = binary_to_hex(self.outpoint.serialize()) outjson['p2shscript'] = binary_to_hex(self.p2shScript) outjson['contribid'] = self.contribID outjson['contriblabel'] = self.contribLabel outjson['sequence'] = self.sequence outjson['numkeys'] = self.keysListed outjson['keys'] = [] for i in range(self.keysListed): outjson['keys'].append({}) outjson['keys'][i]['pubkeyhex'] = binary_to_hex(self.pubKeys[i]) outjson['keys'][i]['dersighex'] = binary_to_hex(self.signatures[i]) outjson['keys'][i]['wltlochex'] = binary_to_hex(self.wltLocators[i]) # Add a few convenience keys to avoid the caller having to calcs for it supportPyTx = PyTx().unserialize(self.supportTx) txoidx = binary_to_int(self.outpoint.serialize()[-4:], LITTLEENDIAN) outjson['supporttxhash_le'] = supportPyTx.getHashHex() outjson['supporttxhash_be'] = hex_switchEndian(supportPyTx.getHashHex()) outjson['supporttxhash'] = outjson['supporttxhash_be'] # BE is default outjson['supporttxoutindex']= txoidx outjson['inputvalue'] = supportPyTx.outputs[txoidx].value if not lite: outjson['supporttx'] = binary_to_hex(self.supportTx) return outjson ############################################################################# def fromJSONMap(self, jsonMap, skipMagicCheck=False): # There is a lite version of toJSONMap(), but can't create from a lite copy if not 'supporttx' in jsonMap: raise UnserializeError('Incomplete unsigned transaction map') ver = jsonMap['version'] magic = hex_to_binary(jsonMap['magicbytes']) if not ver == UNSIGNED_TX_VERSION: LOGWARN('Unserialing USTX of different version') LOGWARN(' USTX Version: %d' % ver) LOGWARN(' Armory Version: %d' % UNSIGNED_TX_VERSION) # Check the magic bytes of the lockbox match if not magic == MAGIC_BYTES and not skipMagicCheck: LOGERROR('Wrong network!') LOGERROR(' USTX Magic: ' + binary_to_hex(magic)) LOGERROR(' Armory Magic: ' + binary_to_hex(MAGIC_BYTES)) raise NetworkIDError('Network magic bytes mismatch') rawSupportTx = hex_to_binary(jsonMap['supporttx']) txoutIndex = jsonMap['supporttxoutindex'] p2sh = hex_to_binary(jsonMap['p2shscript']) contribID = jsonMap['contribid'] contribLabel = jsonMap['contriblabel'] sequence = jsonMap['sequence'] pubkeyMap = {} insertSigs = [] insertWltLocs = [] for i in range(jsonMap['numkeys']): pub = hex_to_binary(jsonMap['keys'][i]['pubkeyhex']) sig = hex_to_binary(jsonMap['keys'][i]['dersighex']) loc = hex_to_binary(jsonMap['keys'][i]['wltlochex']) pubkeyMap[SCRADDR_P2PKH_BYTE + hash160(pub)] = pub insertSigs.append([i, sig]) insertWltLocs.append([i, loc]) self.__init__(rawSupportTx, txoutIndex, p2sh, pubkeyMap, insertSigs, insertWltLocs, contribID, contribLabel, sequence) return self ############################################################################# def serialize(self): if not self.isInitialized: LOGERROR('Cannot serialize an uninitialzed unsigned txin') return None tempID = binary_to_base58(hash160(self.outpoint.serialize()))[:4] bp = BinaryPacker() bp.put(UINT32, self.version) bp.put(BINARY_CHUNK, MAGIC_BYTES, 4) bp.put(BINARY_CHUNK, self.outpoint.serialize(), 36) bp.put(VAR_STR, self.supportTx) bp.put(VAR_STR, self.p2shScript) bp.put(VAR_STR, self.contribID) bp.put(VAR_STR, toBytes(self.contribLabel)) bp.put(UINT32, self.sequence) bp.put(VAR_INT, self.keysListed) for i in range(self.keysListed): bp.put(VAR_STR, self.pubKeys[i]) bp.put(VAR_STR, self.signatures[i]) bp.put(VAR_STR, self.wltLocators[i]) return bp.getBinaryString() ############################################################################# def unserialize(self, rawBinaryData, skipMagicCheck=False): bu = BinaryUnpacker(rawBinaryData) version = bu.get(UINT32) magic = bu.get(BINARY_CHUNK, 4) outpt = bu.get(BINARY_CHUNK, 36) suppTx = bu.get(VAR_STR) p2shScr = bu.get(VAR_STR) contrib = bu.get(VAR_STR) contribLbl = toUnicode(bu.get(VAR_STR)) seq = bu.get(UINT32) nEntry = bu.get(VAR_INT) keysiginfo = [] pubMap, sigList, locList = {},[],[] for i in range(nEntry): pub = bu.get(VAR_STR) sigList.append([i, bu.get(VAR_STR)]) locList.append([i, bu.get(VAR_STR)]) pubMap[SCRADDR_P2PKH_BYTE+hash160(pub)] = pub if not outpt[:32] == hash256(suppTx): raise UnserializeError('OutPoint hash does not match supporting tx') if not seq==UINT32_MAX: LOGWARN('WARNING: NON-MAX SEQUENCE NUMBER ON UNSIGNEDTX INPUT!') if not magic==MAGIC_BYTES and not skipMagicCheck: LOGERROR('WRONG NETWORK!') LOGERROR(' MAGIC BYTES: ' + magic) LOGERROR(' Expected: ' + MAGIC_BYTES) raise NetworkIDError('Network magic bytes mismatch') if not version==UNSIGNED_TX_VERSION: LOGWARN('Unserialing UnsignedTxInput of different version') LOGWARN(' USTX Version: %d' % version) LOGWARN(' Armory Version: %d' % UNSIGNED_TX_VERSION) self.__init__(suppTx, binary_to_int(outpt[-4:]), p2shScr, pubMap, sigList, locList, contrib, contribLbl, seq, version) return self ############################################################################# def evaluateSigningStatus(self, cppWlt=None): signStatus = InputSigningStatus() signStatus.M = self.sigsNeeded signStatus.N = self.keysListed signStatus.statusM = [TXIN_SIGSTAT.NO_SIGNATURE]*signStatus.M signStatus.statusN = [TXIN_SIGSTAT.NO_SIGNATURE]*signStatus.N # First evaluate if we have sigs for each key, or if we *COULD* sign # This simply returns signed-or-notsigned if no wallet is supplied signStatus.wltIsRelevant = False signStatus.wltCanSign = False for i in range(signStatus.N): if len(self.signatures[i]) > 0: signStatus.statusN[i] = TXIN_SIGSTAT.ALREADY_SIGNED if cppWlt and cppWlt.hasScrAddress(self.scrAddrs[i]): signStatus.wltIsRelevant = True if len(self.signatures[i]) > 0: signStatus.statusN[i] = TXIN_SIGSTAT.WLT_ALREADY_SIGNED else: signStatus.wltCanSign = True signStatus.statusN[i] = TXIN_SIGSTAT.WLT_CAN_SIGN # Now we sort the results and compare to M-value to get high-level metrics # SIGSTAT enumeration values sort the way we ultimately want to display signStatus.statusM = sorted(signStatus.statusN)[:signStatus.M] # Since values are sorted, the last element tells us whether we're done signStatus.allSigned = (signStatus.statusM[-1] in \ [TXIN_SIGSTAT.ALREADY_SIGNED, TXIN_SIGSTAT.WLT_ALREADY_SIGNED]) signStatus.wltCanComplete = (signStatus.statusM[-1] == TXIN_SIGSTAT.WLT_CAN_SIGN) return signStatus ############################################################################# def pprint(self, indent=3): ind = ' '*indent txHashStr = binary_to_hex(self.outpoint.txHash, BIGENDIAN)[:8] txoIdx = self.outpoint.txOutIndex scrType = CPP_TXOUT_SCRIPT_NAMES[self.scriptType] print 'UnsignedTxInput -- %s:%d (%s)' % (txHashStr, txoIdx, scrType) ############################################################################# """ def __eq__(self, obj2): if not isinstance(obj2, self.__class__): return False compareAttrs = ['version', 'supportTx', 'outpoint', 'txoScript', 'value', 'scriptType', 'contribID', 'contribLabel', 'p2shScript', 'sequence', 'keysListed', 'sigsNeeded'] compareLists = ['scrAddrs', 'signatures', 'wltLocators', 'pubKeys'] compareMaps = [] for attr in compareAttrs: if not getattr(self, attr) == getattr(obj2, attr): LOGERROR('Compare failed for attribute: %s' % attr) LOGERROR(' self: %s' % str(getattr(self,attr))) LOGERROR(' other: %s' % str(getattr(obj2,attr))) return False for attr in compareLists: selfList = getattr(self, attr) otherList = getattr(obj2, attr) if not len(selfList)==len(otherList): LOGERROR('List size compare failed for %s' % attr) return False i = -1 for a,b in zip(selfList, otherList): i+=1 if not a==b: LOGERROR('Failed list compare for attr %s, index %d' % (attr,i)) return False return True def __ne__(self, obj2): return not self.__eq__(obj2) """ ################################################################################ class NullAuthData(object): def __init__(self): pass def serialize(self): return '' def unserialize(self, s): return self def __eq__(self, nad2): return True def __ne__(self, nad2): return False ################################################################################ class DecoratedTxOut(AsciiSerializable): """ The name is really "UnsignedTx" output ... it is an output of an unsignedTx self.authData can be anything that the offline computer will recognize as authentication of the owner of the txOut script. This could be our planned rootkey + multiplier technique (or multiple root keys and multipliers, in multisig), or it could be a chain of X509 certs that link an ID to this script. As of this writing, we're not utilizing any of these auth techniques, yet, so we simply assume it will be None, or that it has a .serialize() and .unserialize() method so this class doesn't have to care ContribID and ContribLabel are optional fields that help in simulfunding situations, where there may be tons of inputs and outputs (change) that would otherwise appear unrelated. We need a way to associate them so we can display intelligent stuff to the user. """ def __init__(self, script=None, value=None, p2sh=None, wltLocator=None, authMethod='NONE', authData=None, contribID=None, contribLabel=None, version=UNSIGNED_TX_VERSION): if None in [script, value]: self.isInitialized = False return self.isInitialized = True self.version = version self.binScript = script self.value = value self.p2shScript = p2sh if p2sh else '' self.wltLocator = wltLocator if wltLocator else '' self.authMethod = authMethod self.authData = authData if authData else NullAuthData() self.contribID = contribID if contribID else '' self.contribLabel = contribLabel if contribLabel else '' # Derived values self.scrAddr = script_to_scrAddr(script) self.scriptType = getTxOutScriptType(script) self.multiInfo = {} # P2SH destinations don't *require* the subscript like USTXI do baseScript = self.binScript if p2sh and self.scriptType == CPP_TXOUT_P2SH: self.scriptType = getTxOutScriptType(p2sh) baseScript = p2sh if self.scriptType == CPP_TXOUT_MULTISIG: M, N, a160s, pubs = getMultisigScriptInfo(baseScript) self.multiInfo['M'] = M self.multiInfo['N'] = N self.multiInfo['Addr160s'] = a160s self.multiInfo['PubKeys'] = pubs ############################################################################# def setAuthData(self, authType, authObj): self.authMethod = authType self.authData = authObj ############################################################################# def setWltLocator(self, wltLocStr): self.wltLocator = wltLocStr ############################################################################# def getRecipStr(self): if self.scriptType in CPP_TXOUT_HAS_ADDRSTR: return script_to_addrStr(self.binScript) elif self.scriptType == CPP_TXOUT_MULTISIG: lbID = calcLockboxID(self.binScript) return 'Multisig %d-of-%d (%s)' % \ (self.multiInfo['M'], self.multiInfo['N'], lbID) else: return '' ############################################################################# def toJSONMap(self): """ No lite version needed, since these are usually very small. Below is the list of supported TXOUT types defined around line 500 in armoryengine/ArmoryUtils.py. This list will probably not be maintained as regularly as the one in ArmoryUtils.py, since these comments are not required to be accurate for the code to be functional. Please confirm that it matches the ArmoryUtils list for the current version of Armory before relying on it. CPP_TXOUT_STDHASH160 = 0 CPP_TXOUT_STDPUBKEY65 = 1 CPP_TXOUT_STDPUBKEY33 = 2 CPP_TXOUT_MULTISIG = 3 CPP_TXOUT_P2SH = 4 CPP_TXOUT_NONSTANDARD = 5 CPP_TXOUT_HAS_ADDRSTR = [CPP_TXOUT_STDHASH160, CPP_TXOUT_STDPUBKEY65, CPP_TXOUT_STDPUBKEY33, CPP_TXOUT_P2SH] CPP_TXOUT_STDSINGLESIG = [CPP_TXOUT_STDHASH160, CPP_TXOUT_STDPUBKEY65, CPP_TXOUT_STDPUBKEY33] CPP_TXOUT_SCRIPT_NAMES = ['']*6 CPP_TXOUT_SCRIPT_NAMES[CPP_TXOUT_STDHASH160] = 'Standard (PKH)' CPP_TXOUT_SCRIPT_NAMES[CPP_TXOUT_STDPUBKEY65] = 'Standard (PK65)' CPP_TXOUT_SCRIPT_NAMES[CPP_TXOUT_STDPUBKEY33] = 'Standard (PK33)' CPP_TXOUT_SCRIPT_NAMES[CPP_TXOUT_MULTISIG] = 'Multi-Signature' CPP_TXOUT_SCRIPT_NAMES[CPP_TXOUT_P2SH] = 'Standard (P2SH)' CPP_TXOUT_SCRIPT_NAMES[CPP_TXOUT_NONSTANDARD] = 'Non-Standard' """ outjson = {} outjson['version'] = self.version outjson['magicbytes'] = binary_to_hex(MAGIC_BYTES) outjson['txoutscript'] = binary_to_hex(self.binScript) outjson['txoutvalue'] = self.value outjson['p2shscript'] = binary_to_hex(self.p2shScript) outjson['wltlocator'] = binary_to_hex(self.wltLocator) outjson['authmethod'] = self.authMethod # we expect plaintext outjson['authdata'] = binary_to_hex(self.authData.serialize()) # we expect this won't be outjson['contribid'] = self.contribID outjson['contriblabel'] = self.contribLabel # Some computed values so the caller doesn't have to deal with it scrType = getTxOutScriptType(self.binScript) outjson['scripttypeint'] = scrType # armoryengine/ArmoryUtils.py line ~500 outjson['scripttypestr'] = CPP_TXOUT_SCRIPT_NAMES[scrType] outjson['isp2sh'] = (scrType == CPP_TXOUT_P2SH) outjson['ismultisig'] = (scrType == CPP_TXOUT_MULTISIG) outjson['hasaddrstr'] = False outjson['addrstr'] = '' if scrType in CPP_TXOUT_HAS_ADDRSTR: outjson['hasaddrstr'] = True outjson['addrstr'] = script_to_addrStr(self.binScript) return outjson ############################################################################# def fromJSONMap(self, jsonMap, skipMagicCheck=False): ver = jsonMap['version'] magic = hex_to_binary(jsonMap['magicbytes']) # Issue a warning if the versions don't match if not ver == UNSIGNED_TX_VERSION: LOGWARN('Unserialing USTX of different version') LOGWARN(' USTX Version: %d' % ver) LOGWARN(' Armory Version: %d' % UNSIGNED_TX_VERSION) # Check the magic bytes of the lockbox match if not magic == MAGIC_BYTES and not skipMagicCheck: LOGERROR('Wrong network!') LOGERROR(' USTX Magic: ' + binary_to_hex(magic)) LOGERROR(' Armory Magic: ' + binary_to_hex(MAGIC_BYTES)) raise NetworkIDError('Network magic bytes mismatch') script = hex_to_binary(jsonMap['txoutscript']) value = jsonMap['txoutvalue'] p2sh = hex_to_binary(jsonMap['p2shscript']) loc = hex_to_binary(jsonMap['wltlocator']) meth = jsonMap['authmethod'] data = hex_to_binary(jsonMap['authdata']) cid = jsonMap['contribid'] clbl = jsonMap['contriblabel'] authData = NullAuthData().unserialize(data) self.__init__(script, value, p2sh, loc, meth, authData, cid, clbl) return self ############################################################################# def serialize(self): if not self.isInitialized: LOGERROR('Cannot serialize an uninitialzed unsigned txin') return None bp = BinaryPacker() bp.put(UINT32, self.version) bp.put(BINARY_CHUNK, MAGIC_BYTES) bp.put(VAR_STR, self.binScript) bp.put(UINT64, self.value) bp.put(VAR_STR, self.p2shScript) bp.put(VAR_STR, self.wltLocator) bp.put(VAR_STR, self.authMethod) bp.put(VAR_STR, self.authData.serialize()) bp.put(VAR_STR, self.contribID) bp.put(VAR_STR, self.contribLabel) return bp.getBinaryString() ############################################################################# def unserialize(self, rawData, skipMagicCheck=False): bu = BinaryUnpacker(rawData) version = bu.get(UINT32) magic = bu.get(BINARY_CHUNK, 4) script = bu.get(VAR_STR) value = bu.get(UINT64) p2shScr = bu.get(VAR_STR) wltLoc = bu.get(VAR_STR) authMeth = bu.get(VAR_STR) authData = bu.get(VAR_STR) contribID = bu.get(VAR_STR) contribLBL = toUnicode(bu.get(VAR_STR)) if not magic==MAGIC_BYTES and not skipMagicCheck: LOGERROR('WRONG NETWORK!') LOGERROR(' MAGIC BYTES: ' + magic) LOGERROR(' Expected: ' + MAGIC_BYTES) raise NetworkIDError('Network magic bytes mismatch') if not version==UNSIGNED_TX_VERSION: LOGWARN('Unserialing UnsignedTxInput of different version') LOGWARN(' USTX Version: %d' % version) LOGWARN(' Armory Version: %d' % UNSIGNED_TX_VERSION) authDataObj = NullAuthData().unserialize(authData) self.__init__(script, value, p2shScr, wltLoc, authMeth, authDataObj, contribID, contribLBL) return self ############################################################################# def pprint(self, indent=3): ind = ' '*indent scrType = CPP_TXOUT_SCRIPT_NAMES[self.scriptType] print ind + 'Version: ', self.version if self.scriptType in CPP_TXOUT_HAS_ADDRSTR: print ind + 'Address: ', scrAddr_to_addrStr(self.scrAddr) if self.p2shScript: print ind + 'P2SH Script: ', binary_to_hex(self.p2shScript)[:50] elif self.scriptType==CPP_TXOUT_MULTISIG: print ind + 'Multisig: %(M)s-of-%(N)s' % self.multiInfo print ind + 'Value: ', coin2strNZS(self.value) print ind + 'ContribID: ', self.contribID print ind + 'ContribLabel:', self.contribLabel ############################################################################# def __eq__(self, obj2): if not isinstance(obj2, self.__class__): return False compareAttrs = ['version', 'binScript', 'value', 'p2shScript', 'wltLocator', 'authMethod', 'contribID', 'contribLabel', 'scrAddr', 'scriptType', 'multiInfo'] compareLists = [] compareMaps = [] for attr in compareAttrs: if not getattr(self, attr) == getattr(obj2, attr): LOGERROR('Compare failed for attribute: %s' % attr) LOGERROR(' self: %s' % str(getattr(self,attr))) LOGERROR(' other: %s' % str(getattr(obj2,attr))) return False for attr in compareLists: selfList = getattr(self, attr) otherList = getattr(obj2, attr) if not len(selfList)==len(otherList): LOGERROR('List size compare failed for %s' % attr) return False i = -1 for a,b in zip(selfList, otherList): i+=1 if not a==b: LOGERROR('Failed list compare for attr %s, index %d' % (attr,i)) return False return True def __ne__(self, obj2): return not self.__eq__(obj2) ################################################################################ ################################################################################ # This class can be used for both multi-signature tx collection, as well as # offline wallet signing (you are collecting signatures for a 1-of-1 tx only # involving yourself). class UnsignedTransaction(AsciiSerializable): """ Let's call this a "USTX" to avoid confusion with "UTXO"s which are "unSPENT TxOut"s. UnsignedTransaction is basically a PyTx() object that has all the metadata needed for an offline device to sign it. The contribID is basically just the promissory note ID, if this was constrcuted from a collection of promissory notes. For instance, we have 100 inputs to a tx, but only two contributors. If only 12 of those inputs have signatures (so far), then it would be good to know that, say, there's only two other people that need to provide sigs, not 88. """ OBJNAME = "UnsignedTx" BLKSTRING = "TXSIGCOLLECT" EMAILSUBJ = 'Armory Multi-sig Transaction to Sign - %s' EMAILBODY = """ The chunk of text below is a proposed spending transaction with all signatures available so far. Open the Lockbox manager in Armory and click on "Review and Sign" in the bottom row of the dashboard. Copy this text into the import box, including the first and last lines. You will be given the opportunity to confirm the transaction before signing. After it is signed, click "Export" in the bottom-right corner and send it back to me.""" EQ_ATTRS_SIMPLE = ['version', 'lockTime', 'asciiID'] EQ_ATTRS_LISTS = ['ustxInputs', 'decorTxOuts'] ############################################################################# def __init__(self, pytx=None, pubKeyMap=None, txMap=None, p2shMap=None, version=UNSIGNED_TX_VERSION): self.version = version self.pytxObj = UNINITIALIZED self.uniqueIDB58 = '' self.asciiID = '' # need a common name for all ser/unser classes self.lockTime = 0 self.ustxInputs = [] self.decorTxOuts = [] txMap = {} if txMap is None else txMap p2shMap = {} if p2shMap is None else p2shMap if pytx: self.createFromPyTx(pytx, pubKeyMap, txMap, p2shMap) ############################################################################# def createFromUnsignedTxIO(self, ustxinList, dtxoList, lockTime=0): """ All custom sequence numbers are set in the individual ustxi entries """ nIn = len(ustxinList) nOut = len(dtxoList) self.pytxObj = PyTx() self.pytxObj.version = UNSIGNED_TX_VERSION self.pytxObj.lockTime = lockTime self.pytxObj.inputs = [None]*nIn self.pytxObj.outputs = [None]*nOut for iin,ustxi in enumerate(ustxinList): self.pytxObj.inputs[iin] = PyTxIn() self.pytxObj.inputs[iin].outpoint = ustxi.outpoint self.pytxObj.inputs[iin].binScript = '' self.pytxObj.inputs[iin].intSeq = ustxi.sequence for iout,dtxo in enumerate(dtxoList): self.pytxObj.outputs[iout] = PyTxOut() self.pytxObj.outputs[iout].value = dtxo.value self.pytxObj.outputs[iout].binScript = dtxo.binScript # Create copies of the input lists self.ustxInputs = ustxinList[:] self.decorTxOuts = dtxoList[:] # Finally issue a warning if this selection is super high fee totalIn = sum([ustxi.value for ustxi in ustxinList]) totalOut = sum([dtxo.value for dtxo in dtxoList ]) if totalIn - totalOut > 100*MIN_RELAY_TX_FEE: LOGWARN('Exceptionally high fee in createFromUnsignedTxIO') LOGWARN('TotalInputs = %s BTC', coin2strNZS(totalIn)) LOGWARN('TotalOutputs = %s BTC', coin2strNZS(totalOut)) LOGWARN('Computed Fee = %s BTC', coin2strNZS(totalIn-totalOut)) elif totalIn - totalOut < 0: raise ValueError('Supplied inputs are less than the supplied outputs') rawTxNoSigs = self.pytxObj.serialize() self.uniqueIDB58 = binary_to_base58(hash256(rawTxNoSigs))[:8] self.asciiID = self.uniqueIDB58 return self ############################################################################# def createFromPyTx(self, pytx, pubKeyMap=None, txMap=None, p2shMap=None): """ It might seem silly to convert pytx into USTXIs and DecoratedTxos, just to call the other method that reconstructs the same pytx object. At least it all goes through the same construction method. """ pubKeyMap = {} if not pubKeyMap else pubKeyMap txMap = {} if not txMap else txMap p2shMap = {} if not p2shMap else p2shMap if len(txMap)==0 and not TheBDM.getBDMState()=='BlockchainReady': # TxDP includes the transactions that supply the inputs to this # transaction, so the BDM needs to be available to fetch those. raise BlockchainUnavailableError, ('Must input supporting transactions ' 'or access to the blockchain, to ' 'create the TxDP') ustxiList = [] dtxoList = [] # Get support tx for each input and create unsignedTx-input for each for txin in pytx.inputs: # First, make sure that we have the previous Tx data available # We can't continue without it, since BIP 0010 will now require # the full tx of outputs being spent outpt = txin.outpoint txhash = outpt.txHash txoIdx = outpt.txOutIndex pyPrevTx = None # Either the supporting tx was supplied in txMap, or BDM is avail if len(txMap)>0: # If supplied a txMap, we expect it to have everything we need if not txMap.has_key(txhash): raise InvalidHashError, ('Could not find the referenced tx ' 'in supplied txMap') pyPrevTx = txMap[txhash].copy() elif TheBDM.getBDMState()=='BlockchainReady': cppPrevTx = TheBDM.getTxByHash(txhash) if not cppPrevTx: raise InvalidHashError, 'Could not find the referenced tx' pyPrevTx = PyTx().unserialize(cppPrevTx.serialize()) else: raise InvalidScriptError, 'No previous-tx data available for TxDP' txoScript = pyPrevTx.outputs[txoIdx].binScript txoScrAddr = script_to_scrAddr(txoScript) txoType = getTxOutScriptType(txoScript) p2sh = None if txoType==CPP_TXOUT_P2SH: p2sh = p2shMap.get(binary_to_hex(txoScrAddr)) if not p2sh: raise InvalidHashError('P2SH script not supplied') ustxiList.append(UnsignedTxInput(pyPrevTx.serialize(), txoIdx, p2sh, pubKeyMap)) # Create the DecoratedTxOut for each output. Without any # supplemental auth info, this conversion isn't necessarily useful. for txout in pytx.outputs: scr = txout.getScript() val = txout.getValue() p2sh = p2shMap.get(script_to_scrAddr(scr)) # returns None if not P2SH # Append to the dtxo list dtxoList.append(DecoratedTxOut(scr, val, p2sh)) return self.createFromUnsignedTxIO(ustxiList, dtxoList, pytx.lockTime) ############################################################################# def createFromTxOutSelection(self, utxoSelection, scriptValuePairs, pubKeyMap=None, txMap=None, p2shMap=None): totalUtxoSum = sumTxOutList(utxoSelection) totalOutputSum = sum([a[1] for a in scriptValuePairs]) if not totalUtxoSum >= totalOutputSum: raise UstxError('More outputs than inputs!') thePyTx = PyTx() thePyTx.version = UNSIGNED_TX_VERSION thePyTx.lockTime = 0 thePyTx.inputs = [] thePyTx.outputs = [] # We can prepare the outputs, first for script,value in scriptValuePairs: txout = PyTxOut() txout.value = long(value) # Assume recipObj is either a PBA or a string if isinstance(script, PyBtcAddress): LOGERROR("Didn't know any func was still using this conditional") intType = getTxOutScriptType(script) if intType==CPP_TXOUT_NONSTANDARD: LOGWARN('Including non-standard script output') LOGWARN('Script: ' + binary_to_hex(script)) #raise BadAddressError('Invalid script for tx creation') txout.binScript = script[:] thePyTx.outputs.append(txout) # Prepare the inputs based on the utxo objects for iin,utxo in enumerate(utxoSelection): # First, make sure that we have the previous Tx data available # We can't continue without it, since BIP 0010 will now require # the full tx of outputs being spent txin = PyTxIn() txin.outpoint = PyOutPoint() txin.binScript = '' txin.intSeq = 2**32-1 txhash = utxo.getTxHash() txoIdx = utxo.getTxOutIndex() txin.outpoint.txHash = str(txhash) txin.outpoint.txOutIndex = txoIdx thePyTx.inputs.append(txin) return self.createFromPyTx(thePyTx, pubKeyMap, txMap, p2shMap) ############################################################################# def createFromUnsignedTxInputSelection(self, ustxiList, scriptValuePairs, p2shMap=None, lockTime=0): dtxoList = [] if p2shMap is None: p2shMap = {} for scr,val in scriptValuePairs: p2sh = p2shMap.get(script_to_scrAddr(scr)) # Returns None if DNE dtxoList.append(DecoratedTxOut(scr,val,p2sh)) return self.createFromUnsignedTxIO(ustxiList, dtxoList, lockTime) ############################################################################# def calculateFee(self): totalIn = sum([ustxi.value for ustxi in self.ustxInputs ]) totalOut = sum([dtxo.value for dtxo in self.decorTxOuts]) return totalIn-totalOut ############################################################################# def serialize(self): """ TODO: We should consider the idea that we don't even need to serialize the pytxObj at all... it seems there should only be a single, canonical way to construct the tx. """ if self.pytxObj==UNINITIALIZED: LOGERROR('Cannot serialize an uninitialized tx') return None bp = BinaryPacker() bp.put(UINT32, self.version) bp.put(BINARY_CHUNK, MAGIC_BYTES, 4) bp.put(UINT32, self.lockTime) bp.put(VAR_INT, len(self.ustxInputs)) for ustxi in self.ustxInputs: bp.put(VAR_STR, ustxi.serialize()) bp.put(VAR_INT, len(self.decorTxOuts)) for dtxo in self.decorTxOuts: bp.put(VAR_STR, dtxo.serialize()) return bp.getBinaryString() ############################################################################# def unserialize(self, rawData, expectID=None, skipMagicCheck=False): bu = BinaryUnpacker(rawData) ver = bu.get(UINT32) magic = bu.get(BINARY_CHUNK, 4) lockt = bu.get(UINT32) numUSTXI = bu.get(VAR_INT) ustxiList = [] for i in range(numUSTXI): ustxiList.append( UnsignedTxInput().unserialize(bu.get(VAR_STR), skipMagicCheck) ) numDtxo = bu.get(VAR_INT) dtxoList = [] for i in range(numDtxo): dtxoList.append( DecoratedTxOut().unserialize(bu.get(VAR_STR), skipMagicCheck) ) # Issue a warning if the versions don't match if not ver == UNSIGNED_TX_VERSION: LOGWARN('Unserialing USTX of different version') LOGWARN(' USTX Version: %d' % ver) LOGWARN(' Armory Version: %d' % UNSIGNED_TX_VERSION) # Check the magic bytes of the lockbox match if not magic == MAGIC_BYTES and not skipMagicCheck: LOGERROR('Wrong network!') LOGERROR(' USTX Magic: ' + binary_to_hex(magic)) LOGERROR(' Armory Magic: ' + binary_to_hex(MAGIC_BYTES)) raise NetworkIDError('Network magic bytes mismatch') self.createFromUnsignedTxIO(ustxiList, dtxoList, lockt) # Check that we got the expect ID on the TXSIGCOLLECT if expectID and not expectID==self.uniqueIDB58: raise UnserializeError('ID on ascii block does not match computed ID') return self ############################################################################# def toJSONMap(self, lite=False): if self.pytxObj==UNINITIALIZED: LOGERROR('Cannot serialize an uninitialized tx') raise ValueError('Cannot serialize an uninitialized tx') outjson = {} outjson['version'] = self.version outjson['magicbytes'] = binary_to_hex(MAGIC_BYTES) outjson['id'] = self.uniqueIDB58 outjson['locktimeint'] = self.lockTime if self.lockTime < 500000000: outjson['locktimeblock'] = self.lockTime outjson['locktimedate'] = '' else: outjson['locktimeblock'] = -1 outjson['locktimedate'] = unixTimeToFormatStr(self.lockTime) outjson['numinputs'] = len(self.ustxInputs) outjson['numoutputs'] = len(self.decorTxOuts) totalIn = sum([ustxi.value for ustxi in self.ustxInputs ]) totalOut = sum([dtxo.value for dtxo in self.decorTxOuts]) totalFee = totalIn-totalOut outjson['suminputs'] = totalIn outjson['sumoutputs'] = totalOut outjson['fee'] = totalFee if lite: return outjson outjson['inputs'] = [] for ustxi in self.ustxInputs: outjson['inputs'].append(ustxi.toJSONMap()) outjson['outputs'] = [] for dtxo in self.decorTxOuts: outjson['outputs'].append(dtxo.toJSONMap()) return outjson ############################################################################# def fromJSONMap(self, jsonMap, skipMagicCheck=False): if not 'inputs' in jsonMap: raise UnserializeError('Incomplete unsigned transaction map') ver = jsonMap['version'] magic = hex_to_binary(jsonMap['magicbytes']) uniq = jsonMap['id'] tlock = jsonMap['locktimeint'] # Issue a warning if the versions don't match if not ver == UNSIGNED_TX_VERSION: LOGWARN('Unserialing USTX of different version') LOGWARN(' USTX Version: %d' % ver) LOGWARN(' Armory Version: %d' % UNSIGNED_TX_VERSION) # Check the magic bytes of the lockbox match if not magic == MAGIC_BYTES and not skipMagicCheck: LOGERROR('Wrong network!') LOGERROR(' USTX Magic: ' + binary_to_hex(magic)) LOGERROR(' Armory Magic: ' + binary_to_hex(MAGIC_BYTES)) raise NetworkIDError('Network magic bytes mismatch') ustxiList = [] for ustxi in jsonMap['inputs']: ustxiList.append(UnsignedTxInput().fromJSONMap(ustxi, skipMagicCheck)) dtxoList = [] for dtxo in jsonMap['outputs']: dtxoList.append(DecoratedTxOut().fromJSONMap(dtxo, skipMagicCheck)) self.createFromUnsignedTxIO(ustxiList, dtxoList, tlock) return self ############################################################################# def evaluateSigningStatus(self, cppWlt=None): txSigStat = TxSigningStatus() txSigStat.numInputs = len(self.ustxInputs) txSigStat.statusList = [ustxi.evaluateSigningStatus(cppWlt) \ for ustxi in self.ustxInputs] txSigStat.canBroadcast = True txSigStat.wltCanSign = False txSigStat.wltIsRelevant = False txSigStat.wltCanComplete = True txSigStat.wltAlreadySigned = False #txSigStat.wltPartialSigned = False for inputStat in txSigStat.statusList: if not inputStat.allSigned: txSigStat.canBroadcast = False if inputStat.wltCanSign: txSigStat.wltCanSign = True if inputStat.wltIsRelevant: txSigStat.wltIsRelevant = True if not inputStat.wltCanComplete: txSigStat.wltCanComplete = False for statCode in inputStat.statusN: # WLT_CAN_SIGN is true only if it's not signed yet. # Therefore, if we run into with other WLT_ALREADY_SIGNED # that means we're in a partial state (not sure how that happens) #wltCanSign = statCode == TXIN_SIGSTAT.WLT_CAN_SIGN wltAlready = statCode == TXIN_SIGSTAT.WLT_ALREADY_SIGNED #if (wltCanSign and txSigStat.wltAlreadySigned) or \ #(wltAlready and txSigStat.wltCanSign): #txSigStat.wltPartialSigned = True #break if wltAlready: txSigStat.wltAlreadySigned = True break return txSigStat ############################################################################# def verifySigsAllInputs(self): for ustxi in self.ustxInputs: if not ustxi.verifyAllSignatures(self.pytxObj): return False return True ############################################################################# def verifyInputsMatchPyTxObj(self): """ This assumes that all inputs are sorted the same way. I was going to make it totally generic and have a function for creating a mapping, but so far, I can't see how you would end up with mis-sorted data, since the pytxObj always is created from the ustxInputs list (originally) Nonetheless, it probably wouldn't be too hard to have ustxInputs re-sorted by this method in less then N^2 time """ opList1 = [inp.outpoint.serialize() for inp in self.pytxObj.inputs] opList2 = [inp.outpoint.serialize() for inp in self.ustxInputs] #return sorted(opList1)==sorted(opList2) return opList1==opList2 ############################################################################# def getUnsignedPyTx(self, doVerifySigs=True): return self.pytxObj.copy() ############################################################################# def getSignedPyTx(self, doVerifySigs=True, stripExtraSigs=True): # Make sure the USTXI list is synchronous with the pytx input list if not self.verifyInputsMatchPyTxObj(): LOGERROR('Invalid USTXI set or ordering') return None finalTx = self.pytxObj.copy() # Check signatures are valid (if not skipped) # TODO: I would've used PyScriptProcessor since it evaluates the scripts # as a whole, instead of just verifying the individual signatures, # but it doesn't currently handle P2SH scripts properly, so it # wouldn't be reliable for P2SH scripts if doVerifySigs: if not self.verifySigsAllInputs(): LOGERROR('Attempted to prepare final tx, but not all sigs available') raise SignatureError('Invalid signature while preparing final tx') # Iterate through the lists for iin in range(len(self.ustxInputs)): ustxi = self.ustxInputs[iin] sigScript = ustxi.createSigScript(stripExtraSigs=stripExtraSigs) if not sigScript: return None finalTx.inputs[iin].binScript = sigScript return finalTx ############################################################################# def getPyTxSignedIfPossible(self, doVerifySigs=True): if self.evaluateSigningStatus().canBroadcast: return self.getSignedPyTx() else: return self.getUnsignedPyTx() ############################################################################# def isSigValidForInput(self, txInIndex, sigStr, pubKey=None): """ This returns the multi-sig index """ if txInIndex >= len(self.ustxInputs): raise SignatureError('TxIn index is out of range for this USTX') ustxi = self.ustxInputs[txInIndex] return ustxi.verifyTxSignature(self.pytxObj, sigStr, pubKey) ############################################################################# def createAndInsertSignatureForInput(self, txInIndex, sbdPrivKey, hashcode=1): if txInIndex >= len(self.ustxInputs): raise SignatureError('TxIn index is out of range for this USTX') ustxi = self.ustxInputs[txInIndex] ustxi.createAndInsertSignature(self.pytxObj, sbdPrivKey, hashcode) ############################################################################# def insertSignatureForInput(self, txInIndex, sigStr, pubKey=None): ustxi = self.ustxInputs[txInIndex] sigIndex = ustxi.getValidIndexForSignature(self.pytxObj, sigStr, pubKey) if sigIndex >= 0: ustxi.setSignature(sigIndex, sigStr) return sigIndex return -1 ############################################################################# def insertSignature(self, sigStr, pubKey=None): if pubKey is None or len(self.ustxInputs)>5: LOGWARN('Inserting sig without input index and/or pubkey will be SLOW!') for iin,ustxi in enumerate(self.ustxInputs): msIdx = ustxi.insertSignature(sigStr, pubKey) if msIdx >= 0: return msIdx return -1 ############################################################################# def getBroadcastTxIfReady(self, verifySigs=True): try: return self.getSignedPyTx(verifySigs) except SignatureError, msg: return None ############################################################################# def pprint(self, indent=3): ind = ' '*indent tx = self.pytxObj txHash = hash256(tx.serialize()) print ind+'UnsignedTx ID: ', self.uniqueIDB58 print ind+'Curr TxID : ', binary_to_hex(txHash, BIGENDIAN) print ind+'Version : ', tx.version print ind+'Lock Time : ', tx.lockTime print ind+'Fee (BTC) : ', coin2strNZS(self.calculateFee()) print ind+'#Inputs : ', len(tx.inputs) for i,ustxi in enumerate(self.ustxInputs): prevHash = binary_to_hex(ustxi.outpoint.txHash, BIGENDIAN)[:8] prevIdx = ustxi.outpoint.txOutIndex typeName = CPP_TXOUT_SCRIPT_NAMES[ustxi.scriptType] usesP2SH = '*' if len(ustxi.p2shScript)>0 else ' ' value = coin2str(ustxi.value).lstrip().rjust(12) M,N = ustxi.sigsNeeded, ustxi.keysListed contrib = '(%s)'%ustxi.contribID if ustxi.contribID else '' pubKeySz = '(' + ' '.join([str(len(s)) for s in ustxi.pubKeys]) + ')' printStr = ' '*2*indent printStr += '%(prevHash)s:%(prevIdx)d / ' % locals() printStr += '%(typeName)s%(usesP2SH)s / ' % locals() printStr += '(M=%(M)d, N=%(N)d) / ' % locals() printStr += '%(value)s / %(contrib)s' % locals() printStr += 'PubSz: ' + pubKeySz print printStr print ind+'#Outputs : ', len(tx.outputs) for i,txout in enumerate(tx.outputs): dtxo = self.decorTxOuts[i] addrDisp = getTxOutScriptDisplayStr(txout.binScript) valDisp = coin2str(txout.value, maxZeros=2) print ' '*2*indent + 'Recip:', addrDisp.ljust(35), print valDisp, 'BTC', print ('(%s)' % dtxo.contribID) if dtxo.contribID else '' ############################################################################# """ def __eq__(self, obj2): if not isinstance(obj2, self.__class__): return False compareAttrs = ['version', 'lockTime'] compareLists = ['ustxInputs', 'decorTxOuts'] compareMaps = [] for attr in compareAttrs: if not getattr(self, attr) == getattr(obj2, attr): LOGERROR('Compare failed for attribute: %s' % attr) LOGERROR(' self: %s' % str(getattr(self,attr))) LOGERROR(' other: %s' % str(getattr(obj2,attr))) return False for attr in compareLists: selfList = getattr(self, attr) otherList = getattr(obj2, attr) if not len(selfList)==len(otherList): LOGERROR('List size compare failed for %s' % attr) return False i = -1 for a,b in zip(selfList, otherList): i+=1 if not a==b: LOGERROR('Failed list compare for attr %s, index %d' % (attr,i)) return False for attr in compareMaps: selfMap = getattr(self, attr) otherMap = getattr(obj2, attr) if not len(selfMap)==len(otherMap): LOGERROR('Map size compare failed for %s' % attr) return False for key,val in selfMap.iteritems(): if not key in otherMap: LOGERROR('First map has key not in second map: "%s"' % key) return False if not val==otherMap[key]: LOGERROR('Value for attr=%s, key=%s does not match' % (attr,key)) return False return True def __ne__(self, obj2): return not self.__eq__(obj2) """ ################################################################################ # This is intended only for lists of unsignedTxInputs that have all unlocked # signing keys in the signAddrObjMap. Map is all [scrAddr, PyBtcAddress] pairs. # # This method is intended for sweep transaction where a bundle of private keys # were provided. def PyCreateAndSignTx(ustxiList, dtxoList, sbdPrivKeyMap): ustx = UnsignedTransaction().createFromUnsignedTxIO(ustxiList, dtxoList) for ustxiIndex in range(len(ustx.ustxInputs)): for scrAddr in ustx.ustxInputs[ustxiIndex].scrAddrs: sbdPriv = sbdPrivKeyMap.get(scrAddr) if sbdPriv is None: raise SignatureError('Supplied key map cannot sign all inputs') ustx.createAndInsertSignatureForInput(ustxiIndex, sbdPriv) # Make sure everythign was good if not ustx.verifySigsAllInputs(): raise SignatureError('Not all signatures are present or valid') return ustx.getSignedPyTx(doVerifySigs=False) # already checked them ################################################################################ # NOTE: This method was actually used to create the Blockchain-reorg unit- # test, and hence why coinbase transactions are supported. However, # for normal transactions supported by PyBtcEngine, this support is # unnecessary. # # Additionally, this method both creates and signs the tx: however # PyBtcEngine employs TxDistProposals which require the construction # and signing to be two separate steps. This method is not suited # for most of the armoryengine CONOPS. # # On the other hand, this method DOES work, and there is no reason # not to use it if you already have PyBtcAddress-w-PrivKeys avail # and have a list of inputs and outputs as described below. # # This method will take an already-selected set of TxOuts, along with # PyBtcAddress objects containing necessary the private keys # # Src TxOut ~ {PyBtcAddr, PrevTx, PrevTxOutIdx} --OR-- COINBASE = -1 # Dst TxOut ~ {PyBtcAddr, value} # # Of course, we usually don't have the private keys of the dst addrs... # def PyCreateAndSignTx_old(srcTxOuts, dstAddrsVals): newTx = PyTx() newTx.version = 1 newTx.lockTime = 0 newTx.inputs = [] newTx.outputs = [] numInputs = len(srcTxOuts) numOutputs = len(dstAddrsVals) coinbaseTx = False if numInputs==1 and srcTxOuts[0] == -1: coinbaseTx = True ############################# # Fill in TxOuts first for i in range(numOutputs): txout = PyTxOut() txout.value = dstAddrsVals[i][1] dst = dstAddrsVals[i][0] if(coinbaseTx): txout.binScript = pubkey_to_p2pk_script(dst.binPublicKey65.toBinStr()) else: txout.binScript = hash160_to_p2pkhash_script(dst.getAddr160()) newTx.outputs.append(txout) ############################# # Create temp TxIns with blank scripts for i in range(numInputs): txin = PyTxIn() txin.outpoint = PyOutPoint() if(coinbaseTx): txin.outpoint.txHash = '\x00'*32 txin.outpoint.txOutIndex = binary_to_int('\xff'*4) else: txin.outpoint.txHash = hash256(srcTxOuts[i][1].serialize()) txin.outpoint.txOutIndex = srcTxOuts[i][2] txin.binScript = '' txin.intSeq = 2**32-1 newTx.inputs.append(txin) ############################# # Now we apply the ultra-complicated signature procedure # We need a copy of the Tx with all the txin scripts blanked out txCopySerialized = newTx.serialize() for i in range(numInputs): if coinbaseTx: pass else: txCopy = PyTx().unserialize(txCopySerialized) srcAddr = srcTxOuts[i][0] txoutIdx = srcTxOuts[i][2] prevTxOut = srcTxOuts[i][1].outputs[txoutIdx] binToSign = '' assert(srcAddr.hasPrivKey()) # Only implemented one type of hashing: SIGHASH_ALL hashType = 1 # SIGHASH_ALL hashCode1 = int_to_binary(1, widthBytes=1) hashCode4 = int_to_binary(1, widthBytes=4) # Copy the script of the TxOut we're spending, into the txIn script txCopy.inputs[i].binScript = prevTxOut.binScript preHashMsg = txCopy.serialize() + hashCode4 # CppBlockUtils::CryptoECDSA modules do the hashing for us ##binToSign = hash256(preHashMsg) ##binToSign = binary_switchEndian(binToSign) signature = srcAddr.generateDERSignature(preHashMsg) # If we are spending a Coinbase-TxOut, only need sig, no pubkey # Don't forget to tack on the one-byte hashcode and consider it part of sig if len(prevTxOut.binScript) > 30: sigLenInBinary = int_to_binary(len(signature) + 1) newTx.inputs[i].binScript = sigLenInBinary + signature + hashCode1 else: pubkey = srcAddr.binPublicKey65.toBinStr() sigLenInBinary = int_to_binary(len(signature) + 1) pubkeyLenInBinary = int_to_binary(len(pubkey) ) newTx.inputs[i].binScript = sigLenInBinary + signature + hashCode1 + \ pubkeyLenInBinary + pubkey ############################# # Finally, our tx is complete! return newTx ############################################################################# def getFeeForTx(txHash): if TheBDM.getBDMState()=='BlockchainReady': if not TheBDM.hasTxWithHash(txHash): LOGERROR('Attempted to get fee for tx we don\'t have...? %s', \ binary_to_hex(txHash,BIGENDIAN)) return 0 txref = TheBDM.getTxByHash(txHash) valIn, valOut = 0,0 for i in range(txref.getNumTxIn()): valIn += TheBDM.getSentValue(txref.getTxInCopy(i)) for i in range(txref.getNumTxOut()): valOut += txref.getTxOutCopy(i).getValue() return valIn - valOut ############################################################################# def determineSentToSelfAmt(le, wlt): """ NOTE: this method works ONLY because we always generate a new address whenever creating a change-output, which means it must have a higher chainIndex than all other addresses. If you did something creative with this tx, this may not actually work. """ amt = 0 if TheBDM.isInitialized() and le.isSentToSelf(): txref = TheBDM.getTxByHash(le.getTxHash()) if not txref.isInitialized(): return (0, 0) if txref.getNumTxOut()==1: return (txref.getTxOutCopy(0).getValue(), -1) maxChainIndex = -5 txOutChangeVal = 0 changeIndex = -1 valSum = 0 for i in range(txref.getNumTxOut()): valSum += txref.getTxOutCopy(i).getValue() addr160 = CheckHash160(txref.getTxOutCopy(i).getScrAddressStr()) addr = wlt.getAddrByHash160(addr160) if addr and addr.chainIndex > maxChainIndex: maxChainIndex = addr.chainIndex txOutChangeVal = txref.getTxOutCopy(i).getValue() changeIndex = i amt = valSum - txOutChangeVal return (amt, changeIndex) ################################################################################ #def getUnspentTxOutsForAddrList(addr160List, utxoType='Sweep', startBlk=-1, \ def getUnspentTxOutsForAddr160List(addr160List, utxoType='Sweep', startBlk=-1, \ abortIfBDMBusy=False): """ You have a list of addresses (or just one) and you want to get all the unspent TxOuts for it. This can either be for computing its balance, or for sweeping the address(es). This will return a list of pairs of [addr160, utxoObj] This isn't the most efficient method for producing the pairs NOTE: At the moment, this only gets STANDARD TxOuts... non-std uses a different BDM call This method will return null output if the BDM is currently in the middle of a scan. You can use waitAsLongAsNecessary=True if you want to wait for the previous scan AND the next scan. Otherwise, you can check for bal==-1 and then try again later... Multi-threading update: This one-stop-shop method has to be blocking. Instead, you might want to register the address and rescan asynchronously, skipping this method entirely: cppWlt = Cpp.BtcWallet() cppWlt.addScrAddress_1_(Hash160ToScrAddr(self.getAddr160())) TheBDM.registerScrAddr(Hash160ToScrAddr(self.getAddr160())) TheBDM.rescanBlockchain(wait=False) <... do some other stuff ...> if TheBDM.getBDMState()=='BlockchainReady': TheBDM.updateWalletsAfterScan(wait=True) # fast after a rescan bal = cppWlt.getBalance('Spendable') utxoList = cppWlt.getUnspentTxOutList() else: <...come back later...> """ if TheBDM.getBDMState()=='BlockchainReady' or \ (TheBDM.isScanning() and not abortIfBDMBusy): if not isinstance(addr160List, (list,tuple)): addr160List = [addr160List] cppWlt = Cpp.BtcWallet() for addr in addr160List: if isinstance(addr, PyBtcAddress): cppWlt.addScrAddress_1_(Hash160ToScrAddr(addr.getAddr160())) else: cppWlt.addScrAddress_1_(Hash160ToScrAddr(addr)) TheBDM.registerWallet(cppWlt) currBlk = TheBDM.getTopBlockHeight() TheBDM.scanBlockchainForTx(cppWlt, currBlk+1 if startBlk==-1 else startBlk) #TheBDM.scanRegisteredTxForWallet(cppWlt, currBlk+1 if startBlk==-1 else startBlk) if utxoType.lower() in ('sweep','unspent','full','all','ultimate'): return cppWlt.getFullTxOutList(currBlk) elif utxoType.lower() in ('spend','spendable','confirmed'): return cppWlt.getSpendableTxOutList(currBlk, IGNOREZC) else: raise TypeError, 'Unknown utxoType!' else: return [] def pprintLedgerEntry(le, indent=''): if len(le.getScrAddr())==21: hash160 = CheckHash160(le.getScrAddr()) addrStr = hash160_to_addrStr(hash160)[:12] else: addrStr = '' leVal = coin2str(le.getValue(), maxZeros=1) txType = '' if le.isSentToSelf(): txType = 'ToSelf' else: txType = 'Recv' if le.getValue()>0 else 'Sent' blkStr = str(le.getBlockNum()) print indent + 'LE %s %s %s %s' % \ (addrStr.ljust(15), leVal, txType.ljust(8), blkStr.ljust(8)) # Putting this at the end because of the circular dependency from armoryengine.BDM import TheBDM from armoryengine.PyBtcAddress import PyBtcAddress from armoryengine.CoinSelection import pprintUnspentTxOutList, sumTxOutList from armoryengine.Script import * from armoryengine.MultiSigUtils import calcLockboxID armory-0.92.3/armoryengine/ALL.py0000644000000000000000000000067012414772654015314 0ustar rootrootfrom armoryengine.ArmoryUtils import * from armoryengine.BinaryUnpacker import * from armoryengine.BDM import * from armoryengine.CoinSelection import * from armoryengine.Networking import * from armoryengine.PyBtcWallet import * from armoryengine.Script import * from SDM import * from armoryengine.Timer import * from armoryengine.Transaction import * from armoryengine.MultiSigUtils import * from armoryengine.UserAddressUtils import * armory-0.92.3/armoryengine/BDM.py0000644000000000000000000020104112414772654015301 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ import Queue import os.path from armoryengine.ArmoryUtils import * from SDM import SatoshiDaemonManager from armoryengine.Timer import TimeThisFunction import CppBlockUtils as Cpp from armoryengine.BinaryUnpacker import BinaryUnpacker from armoryengine.BinaryPacker import UINT64 BDMcurrentBlock = [UINT32_MAX, 0] def getCurrTimeAndBlock(): time0 = long(RightNowUTC()) if TheBDM.getBDMState()=='BlockchainReady': if BDMcurrentBlock[1]: return (time0, BDMcurrentBlock[0]) else: return (time0, TheBDM.getTopBlockHeight()) else: return (time0, UINT32_MAX) ################################################################################ # Let's create a thread-wrapper for the blockchain utilities. Enable the # ability for multi-threaded blockchain scanning -- have a main thread and # a blockchain thread: blockchain can scan, and main thread will check back # every now and then to see if it's done BLOCKCHAINMODE = enum('Offline', \ 'Uninitialized', \ 'Full', \ 'Rescanning', \ 'LiteScanning', \ 'FullPrune', \ 'Lite') BDMINPUTTYPE = enum('RegisterAddr', \ 'ZeroConfTxToInsert', \ 'HeaderRequested', \ 'TxRequested', \ 'BlockRequested', \ 'AddrBookRequested', \ 'BlockAtHeightRequested', \ 'HeaderAtHeightRequested', \ 'ForceRebuild', \ 'RescanRequested', \ 'WalletRecoveryScan', \ 'UpdateWallets', \ 'ReadBlkUpdate', \ 'GoOnlineRequested', \ 'GoOfflineRequested', \ 'Passthrough', \ 'Reset', \ 'Shutdown') def newTheBDM(isOffline=False, blocking=False): global TheBDM TheBDM = BlockDataManagerThread(isOffline=isOffline, blocking=blocking) # Make TheBDM act like it's a singleton. Always use the global singleton TheBDM # instance that exists in this module regardless of the instance that passed as self def ActLikeASingletonBDM(func): def inner(*args, **kwargs): if TheBDM and len(args) > 0: newArgs = (TheBDM,) + args[1:] return func(*newArgs, **kwargs) else: return func(*args, **kwargs) return inner ################################################################################ class BlockDataManagerThread(threading.Thread): """ A note about this class: It was mainly created to allow for asynchronous blockchain scanning, but the act of splitting the BDM into it's own thread meant that ALL communication with the BDM requires thread-safe access. So basically, I had to wrap EVERYTHING. And then make it flexible. For this reason, any calls not explicitly related to rescanning will block by default, which could be a long time if the BDM is in the middle of rescanning. For this reason, you are expected to either pass wait=False if you just want to queue the function call and move on in the main thread, or check the BDM state first, to make sure it's not currently scanning and can expect immediate response. This makes using the BDM much more complicated. But comes with the benefit of all rescanning being able to happen in the background. If you want to run it like single-threaded, you can use TheBDM.setBlocking(True) and all calls will block. Always (unless you pass wait=False explicitly to one of those calls). Any calls that retrieve data from the BDM should block, even if you technically can specify wait=False. This is because the class was not designed to maintain organization of output data asynchronously. So a call like TheBDM.getTopBlockHeader() will always block, and you should check the BDM state if you want to make sure it returns immediately. Since there is only one main thread, There is really no way for a rescan to be started between the time you check the state and the time you call the method (so if you want to access the BDM from multiple threads, this class will need some redesign). This serves as a layer between the GUI and the Blockchain utilities. If a request is made to mess with the BDM while it is in the middle of scanning, it will queue it for when it's done All private methods (those starting with two underscores, like __method), are executed only by the BDM thread. These should never be called externally, and are only safe to run when the BDM is ready to execute them. You can use any non-private methods at any time, and if you set wait=True, the main thread will block until that operation is complete. If the BDM is in the middle of a scan, the main thread could block for minutes until the scanning is complete and then it processes your request. Therefore, use setBlocking(True) to make sure you always wait/block after every call, if you are interested in simplicity and don't mind waiting. Use setBlocking(False) along with wait=False for the appropriate calls to queue up your request and continue the main thread immediately. You can finish up something else, and then come back and check whether the job is finished (usually using TheBDM.getBDMState()=='BlockchainReady') Any methods not defined explicitly in this class will "passthrough" the __getattr__() method, which will then call that exact method name on the BDM. All calls block by default. All such calls can also include wait=False if you want to queue it and then continue asynchronously. Implementation notes: Before the multi-threaded BDM, there was wallets, and there was the BDM. We always gave the wallets to the BDM and said "please search the block- chain for relevant transactions". Now that this is asynchronous, the calling thread is going to queue the blockchain scan, and then run off and do other things: which may include address/wallet operations that would collide with the BDM updating it. THEREFORE, the BDM now has a single, master wallet. Any address you add to any of your wallets, should be added to the master wallet, too. The PyBtcWallet class does this for you, but if you are using raw BtcWallets (the C++ equivalent), you need to do: cppWallet.addScrAddress_1_(Hash160ToScrAddr(newAddr)) TheBDM.registerScrAddr(newAddr, isFresh=?) This will add the address to the TheBDM.masterCppWallet. Then when you queue up the TheBDM to do a rescan (if necessary), it will update only its own wallet. Luckily, I designed the BDM so that data for addresses in one wallet (the master), can be applied immediately to other/new wallets that have the same addresses. If you say isFresh=False, then the BDM will set isDirty=True. This means that a full rescan will have to be performed, and wallet information may not be accurate until it is performed. isFresh=True should be used for addresses/wallets you just created, and thus there's no reason to rescan, because there's no chance they could have any history in the blockchain. Tying this all together: if you add an address to a PYTHON wallet, you just add it through an existing call. If you add it with a C++ wallet, you need to explicitly register it with TheBDM, too. Then you need to tell the BDM to do a rescan (if isDirty==True), and then call the method updateWalletsAfterScan( are ready, you can chec """ ############################################################################# def __init__(self, isOffline=False, blocking=False): super(BlockDataManagerThread, self).__init__() if isOffline: self.blkMode = BLOCKCHAINMODE.Offline self.prefMode = BLOCKCHAINMODE.Offline else: self.blkMode = BLOCKCHAINMODE.Uninitialized self.prefMode = BLOCKCHAINMODE.Full self.bdm = Cpp.BlockDataManager().getBDM() # These are for communicating with the master (GUI) thread self.inputQueue = Queue.Queue() self.outputQueue = Queue.Queue() # Flags self.startBDM = False self.doShutdown = False self.aboutToRescan = False self.errorOut = 0 self.setBlocking(blocking) self.currentActivity = 'None' # Lists of wallets that should be checked after blockchain updates self.pyWltList = [] # these will be python refs self.cppWltList = [] # these will be python refs # The BlockDataManager is easier to use if you put all your addresses # into a C++ BtcWallet object, and let it self.masterCppWallet = Cpp.BtcWallet() self.bdm.registerWallet(self.masterCppWallet) self.btcdir = BTC_HOME_DIR self.ldbdir = LEVELDB_DIR self.lastPctLoad = 0 ############################################################################# @ActLikeASingletonBDM def setDaemon(self, daemonic): if not self.isDaemon(): super(BlockDataManagerThread, self).setDaemon(daemonic) ############################################################################# @ActLikeASingletonBDM def start(self): try: super(BlockDataManagerThread, self).start() except RuntimeError: LOGWARN("Attempt to start singleton TheBDM that has already been started.") pass ############################################################################# @ActLikeASingletonBDM def __getattr__(self, name): ''' Anything that is not explicitly defined in this class should passthrough to the C++ BlockDataManager class This remaps such calls into "passthrough" requests via the input queue. This makes sure that the requests are processed only when the BDM is ready. Hopefully, this will prevent multi-threaded disasters, such as seg faults due to trying to read memory that is in the process of being updated. Specifically, any passthrough call is expected to return output unless you add 'waitForReturn=False' to the arg list. i.e. all calls that "passthrough" will always block unless you explicitly tell it not to. ''' rndID = int(random.uniform(0,100000000)) if not hasattr(self.bdm, name): LOGERROR('No BDM method: %s', name) raise AttributeError else: def passthruFunc(*args, **kwargs): #LOGDEBUG('External thread requesting: %s (%d)', name, rndID) waitForReturn = True if len(kwargs)>0 and \ kwargs.has_key('wait') and \ not kwargs['wait']: waitForReturn = False # If this was ultimately called from the BDM thread, don't go # through the queue, just do it! if len(kwargs)>0 and \ kwargs.has_key('calledFromBDM') and \ kwargs['calledFromBDM']: return getattr(self.bdm, name)(*args) self.inputQueue.put([BDMINPUTTYPE.Passthrough, rndID, waitForReturn, name] + list(args)) if waitForReturn: try: out = self.outputQueue.get(True, self.mtWaitSec) return out except Queue.Empty: LOGERROR('BDM was not ready for your request! Waited %d sec.' % self.mtWaitSec) LOGERROR(' getattr name: %s', name) LOGERROR('BDM currently doing: %s (%d)', self.currentActivity,self.currentID ) LOGERROR('Waiting for completion: ID= %d', rndID) LOGERROR('Direct traceback') traceback.print_stack() self.errorOut += 1 LOGEXCEPT('Traceback:') return passthruFunc ############################################################################# @ActLikeASingletonBDM def waitForOutputIfNecessary(self, expectOutput, rndID=0): # The get() command will block until the thread puts something there. # We don't always expect output, but we use this method to # replace inputQueue.join(). The reason for doing it is so # that we can guarantee that BDM thread knows whether we are waiting # for output or not, and any additional requests put on the inputQueue # won't extend our wait time for this request if expectOutput: try: return self.outputQueue.get(True, self.mtWaitSec) except Queue.Empty: stkOneUp = traceback.extract_stack()[-2] filename,method = stkOneUp[0], stkOneUp[1] LOGERROR('Waiting for BDM output that didn\'t come after %ds.' % self.mtWaitSec) LOGERROR('BDM state is currently: %s', self.getBDMState()) LOGERROR('Called from: %s:%d (%d)', os.path.basename(filename), method, rndID) LOGERROR('BDM currently doing: %s (%d)', self.currentActivity, self.currentID) LOGERROR('Direct traceback') traceback.print_stack() LOGEXCEPT('Traceback:') self.errorOut += 1 else: return None ############################################################################# @ActLikeASingletonBDM def setBlocking(self, doblock=True, newTimeout=MT_WAIT_TIMEOUT_SEC): """ If we want TheBDM to behave as a single-threaded app, we need to disable the timeouts so that long operations (such as reading the blockchain) do not crash the process. So setting wait=True is NOT identical to setBlocking(True), since using wait=True with blocking=False will break when the timeout has been reached """ if doblock: self.alwaysBlock = True self.mtWaitSec = None else: self.alwaysBlock = False self.mtWaitSec = newTimeout ############################################################################# @ActLikeASingletonBDM def Reset(self, wait=None): expectOutput = False if not wait==False and (self.alwaysBlock or wait==True): expectOutput = True rndID = int(random.uniform(0,100000000)) self.inputQueue.put([BDMINPUTTYPE.Reset, rndID, expectOutput] ) return self.waitForOutputIfNecessary(expectOutput, rndID) ############################################################################# @ActLikeASingletonBDM def getBlkMode(self): return self.blkMode ############################################################################# @ActLikeASingletonBDM def getBDMState(self): if self.blkMode == BLOCKCHAINMODE.Offline: # BDM will not be able to provide any blockchain data, or scan return 'Offline' elif self.blkMode == BLOCKCHAINMODE.Full and not self.aboutToRescan: # The BDM is idle, waiting for things to do return 'BlockchainReady' elif self.blkMode == BLOCKCHAINMODE.LiteScanning and not self.aboutToRescan: # The BDM is doing some processing but it is expected to be done within # 0.1s. For instance, readBlkFileUpdate requires processing, but can be # performed 100/sec. For the outside calling thread, this is not any # different than BlockchainReady. return 'BlockchainReady' elif self.blkMode == BLOCKCHAINMODE.Rescanning or self.aboutToRescan: # BDM is doing a FULL scan of the blockchain, and expected to take return 'Scanning' elif self.blkMode == BLOCKCHAINMODE.Uninitialized and not self.aboutToRescan: # BDM wants to be online, but the calling thread never initiated the # loadBlockchain() call. Usually setOnlineMode, registerWallets, then # load the blockchain. return 'Uninitialized' elif self.blkMode == BLOCKCHAINMODE.FullPrune: # NOT IMPLEMENTED return 'FullPrune' elif self.blkMode == BLOCKCHAINMODE.Lite: # NOT IMPLEMENTED return 'Lite' else: return '' % self.blkMode ############################################################################# @ActLikeASingletonBDM def predictLoadTime(self): # Apparently we can't read the C++ state while it's scanning, # specifically getLoadProgress* methods. Thus we have to resort # to communicating via files... bleh bfile = os.path.join(ARMORY_HOME_DIR,'blkfiles.txt') if not os.path.exists(bfile): return [-1,-1,-1,-1] try: with open(bfile,'r') as f: tmtrx = [line.split() for line in f.readlines() if len(line.strip())>0] phases = [float(row[0]) for row in tmtrx] currPhase = phases[-1] startat = [float(row[1]) for row in tmtrx if float(row[0])==currPhase] sofar = [float(row[2]) for row in tmtrx if float(row[0])==currPhase] total = [float(row[3]) for row in tmtrx if float(row[0])==currPhase] times = [float(row[4]) for row in tmtrx if float(row[0])==currPhase] todo = total[0] - startat[0] pct0 = sofar[0] / todo pct1 = sofar[-1] / todo t0,t1 = times[0], times[-1] if (not t1>t0) or todo<0: return [-1,-1,-1,-1] rate = (pct1-pct0) / (t1-t0) tleft = (1-pct1)/rate totalPct = (startat[-1] + sofar[-1]) / total[-1] if not self.lastPctLoad == pct1: LOGINFO('Reading blockchain, pct complete: %0.1f', 100*totalPct) self.lastPctLoad = totalPct return (currPhase,totalPct,rate,tleft) except: raise return [-1,-1,-1,-1] ############################################################################# @ActLikeASingletonBDM def execCleanShutdown(self, wait=True): expectOutput = False if not wait==False and (self.alwaysBlock or wait==True): expectOutput = True rndID = int(random.uniform(0,100000000)) self.inputQueue.put([BDMINPUTTYPE.Shutdown, rndID, expectOutput]) return self.waitForOutputIfNecessary(expectOutput, rndID) ############################################################################# @ActLikeASingletonBDM def setSatoshiDir(self, newBtcDir): if not os.path.exists(newBtcDir): LOGERROR('setSatoshiDir: directory does not exist: %s', newBtcDir) return if not self.blkMode in (BLOCKCHAINMODE.Offline, BLOCKCHAINMODE.Uninitialized): LOGERROR('Cannot set blockchain/satoshi path after BDM is started') return self.btcdir = newBtcDir ############################################################################# @ActLikeASingletonBDM def setLevelDBDir(self, ldbdir): if not self.blkMode in (BLOCKCHAINMODE.Offline, BLOCKCHAINMODE.Uninitialized): LOGERROR('Cannot set blockchain/satoshi path after BDM is started') return if not os.path.exists(ldbdir): os.makedirs(ldbdir) self.ldbdir = ldbdir ############################################################################# @ActLikeASingletonBDM def setOnlineMode(self, goOnline=True, wait=None): LOGINFO('Setting online mode: %s (wait=%s)' % (str(goOnline), str(wait))) expectOutput = False # Wait is tri-state - True, False, or None if not wait==False and (self.alwaysBlock or wait==True): expectOutput = True rndID = int(random.uniform(0,100000000)) if goOnline: if TheBDM.getBDMState() in ('Offline','Uninitialized'): self.inputQueue.put([BDMINPUTTYPE.GoOnlineRequested, rndID, expectOutput]) else: if TheBDM.getBDMState() in ('Scanning','BlockchainReady'): self.inputQueue.put([BDMINPUTTYPE.GoOfflineRequested, rndID, expectOutput]) return self.waitForOutputIfNecessary(expectOutput, rndID) ############################################################################# @ActLikeASingletonBDM def isScanning(self): return (self.aboutToRescan or self.blkMode==BLOCKCHAINMODE.Rescanning) ############################################################################# @ActLikeASingletonBDM def readBlkFileUpdate(self, wait=True): """ This method can be blocking... it always has been without a problem, because the block file updates are always fast. But I have to assume that it theoretically *could* take a while. Consider using wait=False if you want it to do its thing and not wait for it (this matters, because you'll want to call TheBDM.updateWalletsAfterScan() when this is finished to make sure that """ expectOutput = False if not wait==False and (self.alwaysBlock or wait==True): expectOutput = True rndID = int(random.uniform(0,100000000)) self.inputQueue.put([BDMINPUTTYPE.ReadBlkUpdate, rndID, expectOutput]) return self.waitForOutputIfNecessary(expectOutput, rndID) ############################################################################# @ActLikeASingletonBDM def isInitialized(self): return self.blkMode==BLOCKCHAINMODE.Full and self.bdm.isInitialized() ############################################################################# @ActLikeASingletonBDM def isDirty(self): return self.bdm.isDirty() ############################################################################# @ActLikeASingletonBDM def rescanBlockchain(self, scanType='AsNeeded', wait=None): expectOutput = False if not wait==False and (self.alwaysBlock or wait==True): expectOutput = True self.aboutToRescan = True rndID = int(random.uniform(0,100000000)) self.inputQueue.put([BDMINPUTTYPE.RescanRequested, rndID, expectOutput, scanType]) LOGINFO('Blockchain rescan requested') return self.waitForOutputIfNecessary(expectOutput, rndID) ############################################################################# @ActLikeASingletonBDM def updateWalletsAfterScan(self, wait=True): """ Be careful with this method: it is asking the BDM thread to update the wallets in the main thread. If you do this with wait=False, you need to avoid any wallet operations in the main thread until it's done. However, this is usually very fast as long as you know the BDM is not in the middle of a rescan, so you might as well set wait=True. In fact, I highly recommend you always use wait=True, in order to guarantee thread-safety. NOTE: If there are multiple wallet-threads, this might not work. It might require specifying which wallets to update after a scan, so that other threads don't collide with the BDM updating its wallet when called from this thread. """ expectOutput = False if not wait==False and (self.alwaysBlock or wait==True): expectOutput = True rndID = int(random.uniform(0,100000000)) self.inputQueue.put([BDMINPUTTYPE.UpdateWallets, rndID, expectOutput]) return self.waitForOutputIfNecessary(expectOutput, rndID) ############################################################################# @ActLikeASingletonBDM def startWalletRecoveryScan(self, pywlt, wait=None): """ A wallet recovery scan may require multiple, independent rescans. This is because we don't know how many addresses to pre-calculate for the initial scan. So, we will calculate the first X addresses in the wallet, do a scan, and then if any addresses have tx history beyond X/2, calculate another X and rescan. This will usually only have to be done once, but may need to be repeated for super-active wallets. (In the future, I may add functionality to sample the gap between address usage, so I can more-intelligently determine when we're at the end...) """ expectOutput = False if not wait==False and (self.alwaysBlock or wait==True): expectOutput = True self.aboutToRescan = True rndID = int(random.uniform(0,100000000)) self.inputQueue.put([BDMINPUTTYPE.WalletRecoveryScan, rndID, expectOutput, pywlt]) LOGINFO('Wallet recovery scan requested') return self.waitForOutputIfNecessary(expectOutput, rndID) ############################################################################# @ActLikeASingletonBDM def __checkBDMReadyToServeData(self): if self.blkMode==BLOCKCHAINMODE.Rescanning: LOGERROR('Requested blockchain data while scanning. Don\'t do this!') LOGERROR('Check self.getBlkModeStr()==BLOCKCHAINMODE.Full before') LOGERROR('making requests! Skipping request') return False if self.blkMode==BLOCKCHAINMODE.Offline: LOGERROR('Requested blockchain data while BDM is in offline mode.') LOGERROR('Please start the BDM using TheBDM.setOnlineMode() before,') LOGERROR('and then wait for it to complete, before requesting data.') return False if not self.bdm.isInitialized(): LOGERROR('The BDM thread declares the BDM is ready, but the BDM ') LOGERROR('itself reports that it is not initialized! What is ') LOGERROR('going on...?') return False return True ############################################################################# @ActLikeASingletonBDM def getTxByHash(self, txHash): """ All calls that retrieve blockchain data are blocking calls. You have no choice in the matter! """ #if not self.__checkBDMReadyToServeData(): #return None rndID = int(random.uniform(0,100000000)) self.inputQueue.put([BDMINPUTTYPE.TxRequested, rndID, True, txHash]) try: result = self.outputQueue.get(True, 10) if result==None: LOGERROR('Requested tx does not exist:\n%s', binary_to_hex(txHash)) return result except Queue.Empty: LOGERROR('Waited 10s for tx to be returned. Abort') LOGERROR('ID: getTxByHash (%d)', rndID) return None #LOGERROR('Going to block until we get something...') #return self.outputQueue.get(True) return None ############################################################################ @ActLikeASingletonBDM def getHeaderByHash(self, headHash): """ All calls that retrieve blockchain data are blocking calls. You have no choice in the matter! """ #if not self.__checkBDMReadyToServeData(): #return None rndID = int(random.uniform(0,100000000)) self.inputQueue.put([BDMINPUTTYPE.HeaderRequested, rndID, True, headHash]) try: result = self.outputQueue.get(True, 10) if result==None: LOGERROR('Requested header does not exist:\n%s', \ binary_to_hex(headHash)) return result except Queue.Empty: LOGERROR('Waited 10s for header to be returned. Abort') LOGERROR('ID: getTxByHash (%d)', rndID) #LOGERROR('Going to block until we get something...') #return self.outputQueue.get(True) return None ############################################################################# @ActLikeASingletonBDM def getBlockByHash(self,headHash): """ All calls that retrieve blockchain data are blocking calls. You have no choice in the matter! This retrives the full block, not just the header, encoded the same way as it is in the blkXXXX.dat files (including magic bytes and block 4-byte block size) """ #if not self.__checkBDMReadyToServeData(): #return None rndID = int(random.uniform(0,100000000)) self.inputQueue.put([BDMINPUTTYPE.BlockRequested, rndID, True, headHash]) try: result = self.outputQueue.get(True, 10) if result==None: LOGERROR('Requested block does not exist:\n%s', \ binary_to_hex(headHash)) return result except Queue.Empty: LOGERROR('Waited 10s for block to be returned. Abort') LOGERROR('ID: getTxByHash (%d)', rndID) #LOGERROR('Going to block until we get something...') #return self.outputQueue.get(True) return None ############################################################################# @ActLikeASingletonBDM def getAddressBook(self, wlt): """ Address books are constructed from Blockchain data, which means this must be a blocking method. """ rndID = int(random.uniform(0,100000000)) if isinstance(wlt, PyBtcWallet): self.inputQueue.put([BDMINPUTTYPE.AddrBookRequested, rndID, True, wlt.cppWallet]) elif isinstance(wlt, Cpp.BtcWallet): self.inputQueue.put([BDMINPUTTYPE.AddrBookRequested, rndID, True, wlt]) try: result = self.outputQueue.get(True, self.mtWaitSec) return result except Queue.Empty: LOGERROR('Waited %ds for addrbook to be returned. Abort' % self.mtWaitSec) LOGERROR('ID: getTxByHash (%d)', rndID) #LOGERROR('Going to block until we get something...') #return self.outputQueue.get(True) return None ############################################################################# @ActLikeASingletonBDM def addNewZeroConfTx(self, rawTx, timeRecv, writeToFile, wait=None): expectOutput = False if not wait==False and (self.alwaysBlock or wait==True): expectOutput = True rndID = int(random.uniform(0,100000000)) self.inputQueue.put([BDMINPUTTYPE.ZeroConfTxToInsert, rndID, expectOutput, rawTx, timeRecv]) return self.waitForOutputIfNecessary(expectOutput, rndID) ############################################################################# @ActLikeASingletonBDM def registerScrAddr(self, scrAddr, isFresh=False, wait=None): """ This is for a generic address: treat it as imported (requires rescan) unless specifically specified otherwise """ if isFresh: self.registerNewScrAddr(scrAddr, wait=wait) else: self.registerImportedScrAddr(scrAddr, wait=wait) ############################################################################# @ActLikeASingletonBDM def registerNewScrAddr(self, scrAddr, wait=None): """ Variable isFresh==True means the address was just [freshly] created, and we need to watch for transactions with it, but we don't need to rescan any blocks """ expectOutput = False if not wait==False and (self.alwaysBlock or wait==True): expectOutput = True rndID = int(random.uniform(0,100000000)) self.inputQueue.put([BDMINPUTTYPE.RegisterAddr, rndID, expectOutput, scrAddr, True]) return self.waitForOutputIfNecessary(expectOutput, rndID) ############################################################################# @ActLikeASingletonBDM def registerImportedScrAddr(self, scrAddr, \ firstTime=UINT32_MAX, \ firstBlk=UINT32_MAX, \ lastTime=0, \ lastBlk=0, wait=None): """ TODO: Need to clean up the first/last blk/time variables. Rather, I need to make sure they are maintained and applied intelligently and consistently """ expectOutput = False if not wait==False and (self.alwaysBlock or wait==True): expectOutput = True rndID = int(random.uniform(0,100000000)) self.inputQueue.put([BDMINPUTTYPE.RegisterAddr, rndID, expectOutput, \ scrAddr, [firstTime, firstBlk, lastTime, lastBlk]]) return self.waitForOutputIfNecessary(expectOutput, rndID) ############################################################################# @ActLikeASingletonBDM def registerWallet(self, wlt, isFresh=False, wait=None): """ Will register a C++ wallet or Python wallet """ if isinstance(wlt, PyBtcWallet): scrAddrs = [Hash160ToScrAddr(a.getAddr160()) for a in wlt.getAddrList()] if isFresh: for scrad in scrAddrs: self.registerNewScrAddr(scrad, wait=wait) else: for scrad in scrAddrs: self.registerImportedScrAddr(scrad, wait=wait) if not wlt in self.pyWltList: self.pyWltList.append(wlt) elif isinstance(wlt, Cpp.BtcWallet): # We are using this branch to add multi-sig wallets, which aren't # even help as python wallets, only low-level BtcWallets naddr = wlt.getNumScrAddr() for a in range(naddr): self.registerScrAddr(wlt.getScrAddrObjByIndex(a).getScrAddr(), isFresh, wait=wait) if not wlt in self.cppWltList: self.cppWltList.append(wlt) else: LOGERROR('Unrecognized object passed to registerWallet function') ############################################################################# # These bdm_direct methods feel like a hack. They probably are. I need # find an elegant way to get the code normally run outside the BDM thread, # to be able to run inside the BDM thread without using the BDM queue (since # the queue is specifically FOR non-BDM-thread calls). For now, the best # I can do is create non-private versions of these methods that access BDM # methods directly, but should not be used under any circumstances, unless # we know for sure that the BDM ultimately called this method. @ActLikeASingletonBDM def registerScrAddr_bdm_direct(self, scrAddr, timeInfo): """ Something went awry calling __registerScrAddrNow from the PyBtcWallet code (apparently I don't understand __methods). Use this method to externally bypass the BDM thread queue and register the address immediately. THIS METHOD IS UNSAFE UNLESS CALLED FROM A METHOD RUNNING IN THE BDM THREAD This method can be called from a non BDM class, but should only do so if that class method was called by the BDM (thus, no conflicts) """ self.__registerScrAddrNow(scrAddr, timeInfo) ############################################################################# @ActLikeASingletonBDM def scanBlockchainForTx_bdm_direct(self, cppWlt, startBlk=0, endBlk=UINT32_MAX): """ THIS METHOD IS UNSAFE UNLESS CALLED FROM A METHOD RUNNING IN THE BDM THREAD This method can be called from a non BDM class, but should only do so if that class method was called by the BDM (thus, no conflicts) """ self.bdm.scanRegisteredTxForWallet(cppWlt, startBlk, endBlk) ############################################################################# @ActLikeASingletonBDM def scanRegisteredTxForWallet_bdm_direct(self, cppWlt, startBlk=0, endBlk=UINT32_MAX): """ THIS METHOD IS UNSAFE UNLESS CALLED FROM A METHOD RUNNING IN THE BDM THREAD This method can be called from a non BDM class, but should only do so if that class method was called by the BDM (thus, no conflicts) """ self.bdm.scanRegisteredTxForWallet(cppWlt, startBlk, endBlk) ############################################################################# @ActLikeASingletonBDM def getTopBlockHeight_bdm_direct(self): """ THIS METHOD IS UNSAFE UNLESS CALLED FROM A METHOD RUNNING IN THE BDM THREAD This method can be called from a non BDM class, but should only do so if that class method was called by the BDM (thus, no conflicts) """ return self.bdm.getTopBlockHeight() ############################################################################# @ActLikeASingletonBDM def getLoadProgress(self): """ This method does not actually work! The load progress in bytes is not updated properly while the BDM thread is scanning. It might have to emit this information explicitly in order to be useful. """ return (self.bdm.getLoadProgressBytes(), self.bdm.getTotalBlockchainBytes()) ############################################################################# @ActLikeASingletonBDM def __registerScrAddrNow(self, scrAddr, timeInfo): """ Do the registration right now. This should not be called directly outside of this class. This is only called by the BDM thread when any previous scans have been completed """ if isinstance(timeInfo, bool): isFresh = timeInfo if isFresh: # We claimed to have just created this ScrAddr...(so no rescan needed) self.masterCppWallet.addNewScrAddress(scrAddr) else: self.masterCppWallet.addScrAddress_1_(scrAddr) else: if isinstance(timeInfo, (list,tuple)) and len(timeInfo)==4: self.masterCppWallet.addScrAddress_5_(scrAddr, *timeInfo) else: LOGWARN('Unrecognized time information in register method.') LOGWARN(' Data: %s', str(timeInfo)) LOGWARN('Assuming imported key requires full rescan...') self.masterCppWallet.addScrAddress_1_(scrAddr) ############################################################################# @TimeThisFunction @ActLikeASingletonBDM def __startLoadBlockchain(self): """ This should only be called by the threaded BDM, and thus there should never be a conflict. """ if self.blkMode == BLOCKCHAINMODE.Rescanning: LOGERROR('Blockchain is already scanning. Was this called already?') return elif self.blkMode == BLOCKCHAINMODE.Full: LOGERROR('Blockchain has already been loaded -- maybe we meant') LOGERROR('to call startRescanBlockchain()...?') return elif not self.blkMode == BLOCKCHAINMODE.Uninitialized: LOGERROR('BDM should be in "Uninitialized" mode before starting ') LOGERROR('the initial scan. If BDM is in offline mode, you should ') LOGERROR('switch it to online-mode, first, then request the scan.') LOGERROR('Continuing with the scan, anyway.') # Remove "blkfiles.txt" to make sure we get accurate TGO bfile = os.path.join(ARMORY_HOME_DIR,'blkfiles.txt') if os.path.exists(bfile): os.remove(bfile) # Check for the existence of the Bitcoin-Qt directory if not os.path.exists(self.btcdir): raise FileExistsError, ('Directory does not exist: %s' % self.btcdir) blkdir = os.path.join(self.btcdir, 'blocks') blk1st = os.path.join(blkdir, 'blk00000.dat') # ... and its blk000X.dat files if not os.path.exists(blk1st): LOGERROR('Blockchain data not available: %s', blk1st) self.prefMode = BLOCKCHAINMODE.Offline raise FileExistsError, ('Blockchain data not available: %s' % self.blk1st) # We have the data, we're ready to go self.blkMode = BLOCKCHAINMODE.Rescanning self.aboutToRescan = False armory_homedir = ARMORY_HOME_DIR blockdir = blkdir leveldbdir = self.ldbdir if OS_WINDOWS: if isinstance(ARMORY_HOME_DIR, unicode): armory_homedir = ARMORY_HOME_DIR.encode('utf8') if isinstance(blkdir, unicode): blockdir = blkdir.encode('utf8') if isinstance(self.ldbdir, unicode): leveldbdir = self.ldbdir.encode('utf8') LOGINFO('Setting Armory Home Dir: %s' % armory_homedir) LOGINFO('Setting BlkFile Dir: %s' % blockdir) LOGINFO('Setting LevelDB Dir: %s' % leveldbdir) self.bdm.SetDatabaseModes(ARMORY_DB_BARE, DB_PRUNE_NONE); self.bdm.SetHomeDirLocation(armory_homedir) self.bdm.SetBlkFileLocation(blockdir) self.bdm.SetLevelDBLocation(leveldbdir) self.bdm.SetBtcNetworkParams( GENESIS_BLOCK_HASH, \ GENESIS_TX_HASH, \ MAGIC_BYTES) # The master wallet contains all addresses of all wallets registered self.bdm.registerWallet(self.masterCppWallet) # Now we actually startup the BDM and run with it if CLI_OPTIONS.rebuild: self.bdm.doInitialSyncOnLoad_Rebuild() elif CLI_OPTIONS.rescan: self.bdm.doInitialSyncOnLoad_Rescan() else: self.bdm.doInitialSyncOnLoad() # The above op populates the BDM with all relevent tx, but those tx # still need to be scanned to collect the wallet ledger and UTXO sets self.bdm.scanBlockchainForTx(self.masterCppWallet) self.bdm.saveScrAddrHistories() ############################################################################# @TimeThisFunction @ActLikeASingletonBDM def __startRescanBlockchain(self, scanType='AsNeeded'): """ This should only be called by the threaded BDM, and thus there should never be a conflict. If we don't force a full scan, we let TheBDM figure out how much of the chain needs to be rescanned. Which may not be very much. We may force a full scan if we think there's an issue with balances. """ if self.blkMode==BLOCKCHAINMODE.Offline: LOGERROR('Blockchain is in offline mode. How can we rescan?') elif self.blkMode==BLOCKCHAINMODE.Uninitialized: LOGERROR('Blockchain was never loaded. Why did we request rescan?') # Remove "blkfiles.txt" to make sure we get accurate TGO bfile = os.path.join(ARMORY_HOME_DIR,'blkfiles.txt') if os.path.exists(bfile): os.remove(bfile) if not self.isDirty(): LOGWARN('It does not look like we need a rescan... doing it anyway') if scanType=='AsNeeded': if self.bdm.numBlocksToRescan(self.masterCppWallet) < 144: LOGINFO('Rescan requested, but <1 day\'s worth of block to rescan') self.blkMode = BLOCKCHAINMODE.LiteScanning else: LOGINFO('Rescan requested, and very large scan is necessary') self.blkMode = BLOCKCHAINMODE.Rescanning self.aboutToRescan = False if scanType=='AsNeeded': self.bdm.doSyncIfNeeded() elif scanType=='ForceRescan': LOGINFO('Forcing full rescan of blockchain') self.bdm.doFullRescanRegardlessOfSync() self.blkMode = BLOCKCHAINMODE.Rescanning elif scanType=='ForceRebuild': LOGINFO('Forcing full rebuild of blockchain database') self.bdm.doRebuildDatabases() self.blkMode = BLOCKCHAINMODE.Rescanning # missingBlocks = self.bdm.missingBlockHashes() self.bdm.scanBlockchainForTx(self.masterCppWallet) self.bdm.saveScrAddrHistories() ############################################################################# @TimeThisFunction @ActLikeASingletonBDM def __startRecoveryRescan(self, pywlt): """ This should only be called by the threaded BDM, and thus there should never be a conflict. In order to work cleanly with the threaded BDM, the search code needed to be integrated directly here, instead of being called from the PyBtcWallet method. Because that method is normally called from outside the BDM thread, but this method is only called from _inside_ the BDM thread. Those calls use the BDM stack which will deadlock waiting for the itself before it can move on... Unfortunately, because of this, we have to break a python-class privacy rules: we are accessing the PyBtcWallet object as if this were PyBtcWallet code (accessing properties directly). """ if not isinstance(pywlt, PyBtcWallet): LOGERROR('Only python wallets can be passed for recovery scans') return if self.blkMode==BLOCKCHAINMODE.Offline: LOGERROR('Blockchain is in offline mode. How can we rescan?') elif self.blkMode==BLOCKCHAINMODE.Uninitialized: LOGERROR('Blockchain was never loaded. Why did we request rescan?') self.blkMode = BLOCKCHAINMODE.Rescanning self.aboutToRescan = False ##### # Whenever calling PyBtcWallet methods from BDM, set flag prevCalledFromBDM = pywlt.calledFromBDM pywlt.calledFromBDM = True # Do the scan... pywlt.freshImportFindHighestIndex() # Unset flag when done pywlt.calledFromBDM = prevCalledFromBDM ##### self.bdm.scanRegisteredTxForWallet(self.masterCppWallet) ############################################################################# @TimeThisFunction @ActLikeASingletonBDM def __readBlockfileUpdates(self): ''' This method can be blocking... it always has been without a problem, because the block file updates are always fast. But I have to assume that it theoretically *could* take a while, and the caller might care. ''' if self.blkMode == BLOCKCHAINMODE.Offline: LOGERROR('Can\'t update blockchain in %s mode!', self.getBDMState()) return self.blkMode = BLOCKCHAINMODE.LiteScanning nblk = self.bdm.readBlkFileUpdate() # On new blocks, re-save the histories # ACR: This was removed because the histories get saved already on the # call to TheBDM.updateWalletsAfterScan() #if nblk > 0: #self.bdm.saveScrAddrHistories() return nblk ############################################################################# @TimeThisFunction @ActLikeASingletonBDM def __updateWalletsAfterScan(self): """ This will actually do a scan regardless of whether it is currently "after scan", but it will usually only be requested right after a full rescan """ numToRescan = 0 for pyWlt in self.pyWltList: thisNum = self.bdm.numBlocksToRescan(pyWlt.cppWallet) numToRescan = max(numToRescan, thisNum) for cppWlt in self.cppWltList: thisNum = self.bdm.numBlocksToRescan(cppWlt) numToRescan = max(numToRescan, thisNum) if numToRescan<144: self.blkMode = BLOCKCHAINMODE.LiteScanning else: self.blkMode = BLOCKCHAINMODE.Rescanning for pyWlt in self.pyWltList: # We use "calledFromBDM" to avoid deadlocking -- no other messages # on the BDM queue can be processed until this function returns, but # the syncWithBlockchain call will put a request on the queue # and wait for the BDM to process it. We use "calledFromBDM" to # request that the call go around the queue, right to the self.bdm # object. prevCFB = pyWlt.calledFromBDM pyWlt.calledFromBDM = True pyWlt.syncWithBlockchain() pyWlt.calledFromBDM = prevCFB for cppWlt in self.cppWltList: # The pre-leveldb version of Armory specifically required to call # # scanRegisteredTxForWallet (scan already-collected reg tx) # # instead of # # scanBlockchainForTx (search for reg tx then scan) # # Because the second one will induce a full rescan to find all new # registeredTx, if we recently imported an addr or wallet. If we # imported but decided not to rescan yet, we wan tthe first one, # which only scans the registered tx that are already collected # (including new blocks, but not previous blocks). # # NOTE: In versions 0.90-0.92, the following paragraph is not # actually true: we don't have supernode support. Yet, # we never converted this back to scanRegisteredTxForWallet. # Hmmm... # However, with the leveldb stuff only supporting super-node, there # is no rescanning, thus it's safe to always call scanBlockchainForTx, # which grabs everything from the database almost instantaneously. # However we may want to re-examine this after we implement new # database modes of operation #self.bdm.scanRegisteredTxForWallet(cppWlt) self.bdm.scanBlockchainForTx(cppWlt) # At this point all wallets should be 100% up-to-date, save the histories # to be reloaded next time self.bdm.saveScrAddrHistories() ############################################################################# @ActLikeASingletonBDM def __shutdown(self): if not self.blkMode == BLOCKCHAINMODE.Rescanning: self.bdm.saveScrAddrHistories() self.__reset() self.blkMode = BLOCKCHAINMODE.Offline self.doShutdown = True ############################################################################# @ActLikeASingletonBDM def __fullRebuild(self): self.bdm.destroyAndResetDatabases() self.__reset() self.__startLoadBlockchain() ############################################################################# @ActLikeASingletonBDM def __reset(self): LOGERROR('Resetting BDM and all wallets') self.bdm.Reset() if self.blkMode in (BLOCKCHAINMODE.Full, BLOCKCHAINMODE.Rescanning): # Uninitialized means we want to be online, but haven't loaded yet self.blkMode = BLOCKCHAINMODE.Uninitialized elif not self.blkMode==BLOCKCHAINMODE.Offline: return self.bdm.resetRegisteredWallets() # Flags self.startBDM = False #self.btcdir = BTC_HOME_DIR # Lists of wallets that should be checked after blockchain updates self.pyWltList = [] # these will be python refs self.cppWltList = [] # these will be C++ refs # The BlockDataManager is easier to use if you put all your addresses # into a C++ BtcWallet object, and let it self.masterCppWallet = Cpp.BtcWallet() self.bdm.registerWallet(self.masterCppWallet) ############################################################################# @ActLikeASingletonBDM def __getFullBlock(self, headerHash): headerObj = self.bdm.getHeaderByHash(headerHash) if not headerObj: return None rawTxList = [] txList = headerObj.getTxRefPtrList() for txref in txList: tx = txref.getTxCopy() rawTxList.append(tx.serialize()) numTxVarInt = len(rawTxList) blockBytes = 80 + len(numTxVarInt) + sum([len(tx) for tx in rawTxList]) rawBlock = MAGIC_BYTES rawBlock += int_to_hex(blockBytes, endOut=LITTLEENDIAN, widthBytes=4) rawBlock += headerObj.serialize() rawBlock += packVarInt(numTxVarInt) rawBlock += ''.join(rawTxList) return rawBlock ############################################################################# @ActLikeASingletonBDM def getBDMInputName(self, i): for name in dir(BDMINPUTTYPE): if getattr(BDMINPUTTYPE, name)==i: return name ############################################################################# @TimeThisFunction @ActLikeASingletonBDM def createAddressBook(self, cppWlt): return cppWlt.createAddressBook() ############################### # This is critical code used when kicking off ArmoryQt and armoryd. Ideally, all # initialization would happen here, but there's too much GUI stuff to make it # work. So, we'll do what we can here, which is a significant amount. # INPUT: A Python wallet map, a C++ lockbox wallet map, a flag indicating if the # memory pool has been initialized, and the BDM. # OUTPUT: The top block height and a flag indicating that the mem pool has been # initialized. ####################################################################### @ActLikeASingletonBDM def finishLoadBlockchainCommon(self, inWltMap, inLBWltMap, initMemPool): retVal = self.getTopBlockHeight() # If necessary, initialize the mem pool. if not initMemPool: mempoolfile = os.path.join(ARMORY_HOME_DIR,'mempool.bin') clearpoolfile = os.path.join(ARMORY_HOME_DIR,'clearmempool.flag') if os.path.exists(clearpoolfile): LOGINFO('clearmempool.flag found. Clearing memory pool') os.remove(clearpoolfile) if os.path.exists(mempoolfile): os.remove(mempoolfile) elif os.path.exists(mempoolfile): memfile = open(mempoolfile, 'rb') memdata = memfile.read() memfile.close() binunpacker = BinaryUnpacker(memdata) try: while binunpacker.getRemainingSize() > 0: binunpacker.get(UINT64) PyTx().unserialize(binunpacker) except: os.remove(mempoolfile) LOGWARN('Memory pool file was corrupt and has been deleted. No further ' \ 'action is required.') cppMempoolFile = mempoolfile if OS_WINDOWS and isinstance(mempoolfile, unicode): cppMempoolFile = mempoolfile.encode('utf8') self.enableZeroConf(cppMempoolFile) # Sync each Python wallet. for wltID in inWltMap.iterkeys(): LOGINFO('Syncing wallet: %s', wltID) inWltMap[wltID].setBlockchainSyncFlag(BLOCKCHAIN_READONLY) inWltMap[wltID].syncWithBlockchainLite(0) inWltMap[wltID].detectHighestUsedIndex(True) # expand wlt if necessary inWltMap[wltID].fillAddressPool() # The lockboxes use C++ wallets 'til the 2.0 wallets are ready. We just need # to scan each wallet. for lbID,cppWallet in inLBWltMap.iteritems(): self.scanRegisteredTxForWallet(cppWallet, 0, wait=True) LOGINFO('Blockchain load and wallet sync finished') return (retVal, True) @ActLikeASingletonBDM def run(self): """ This thread runs in an infinite loop, waiting for things to show up on the self.inputQueue, and then processing those entries. If there are no requests to the BDM from the main thread, this thread will just sit idle (in a CPU-friendly fashion) until something does. """ while not self.doShutdown: # If there were any errors, we will have that many extra output # entries on the outputQueue. We clear them off so that this # thread can be re-sync'd with the main thread try: while self.errorOut>0: self.outputQueue.get_nowait() self.errorOut -= 1 except Queue.Empty: LOGERROR('ErrorOut var over-represented number of errors!') self.errorOut = 0 # Now start the main try: try: inputTuple = self.inputQueue.get_nowait() # If we don't error out, we have stuff to process right now except Queue.Empty: # We only switch to offline/full/uninitialzed when the queue # is empty. After that, then we block in a CPU-friendly way # until data shows up on the Queue if self.prefMode==BLOCKCHAINMODE.Full: if self.bdm.isInitialized(): self.blkMode = BLOCKCHAINMODE.Full else: self.blkMode = BLOCKCHAINMODE.Uninitialized else: self.blkMode = BLOCKCHAINMODE.Offline self.currentActivity = 'None' # Block until something shows up. inputTuple = self.inputQueue.get() except: LOGERROR('Unknown error in BDM thread') # The first list element is always the BDMINPUTTYPE (command) # The second argument is whether the caller will be waiting # for the output: which means even if it's None, we need to # put something on the output queue. cmd = inputTuple[0] rndID = inputTuple[1] expectOutput = inputTuple[2] output = None # Some variables that can be queried externally to figure out # what the BDM is currently doing self.currentActivity = self.getBDMInputName(inputTuple[0]) self.currentID = rndID if cmd == BDMINPUTTYPE.RegisterAddr: scrAddr,timeInfo = inputTuple[3:] self.__registerScrAddrNow(scrAddr, timeInfo) elif cmd == BDMINPUTTYPE.ZeroConfTxToInsert: rawTx = inputTuple[3] timeIn = inputTuple[4] if isinstance(rawTx, PyTx): rawTx = rawTx.serialize() self.bdm.addNewZeroConfTx(rawTx, timeIn, True) elif cmd == BDMINPUTTYPE.HeaderRequested: headHash = inputTuple[3] rawHeader = self.bdm.getHeaderByHash(headHash) if rawHeader: output = rawHeader else: output = None elif cmd == BDMINPUTTYPE.TxRequested: txHash = inputTuple[3] rawTx = self.bdm.getTxByHash(txHash) if rawTx: output = rawTx else: output = None elif cmd == BDMINPUTTYPE.BlockRequested: headHash = inputTuple[3] rawBlock = self.__getFullBlock(headHash) if rawBlock: output = rawBlock else: output = None LOGERROR('Requested header does not exist:\n%s', \ binary_to_hex(headHash)) elif cmd == BDMINPUTTYPE.HeaderAtHeightRequested: height = inputTuple[3] rawHeader = self.bdm.getHeaderByHeight(height) if rawHeader: output = rawHeader else: output = None LOGERROR('Requested header does not exist:\nHeight=%s', height) elif cmd == BDMINPUTTYPE.BlockAtHeightRequested: height = inputTuple[3] rawBlock = self.__getFullBlock(height) if rawBlock: output = rawBlock else: output = None LOGERROR('Requested header does not exist:\nHeight=%s', height) elif cmd == BDMINPUTTYPE.AddrBookRequested: cppWlt = inputTuple[3] output = self.createAddressBook(cppWlt) elif cmd == BDMINPUTTYPE.UpdateWallets: self.__updateWalletsAfterScan() elif cmd == BDMINPUTTYPE.RescanRequested: scanType = inputTuple[3] if not scanType in ('AsNeeded', 'ForceRescan', 'ForceRebuild'): LOGERROR('Invalid scan type for rescanning: ' + scanType) scanType = 'AsNeeded' self.__startRescanBlockchain(scanType) elif cmd == BDMINPUTTYPE.WalletRecoveryScan: LOGINFO('Wallet Recovery Scan Requested') pywlt = inputTuple[3] self.__startRecoveryRescan(pywlt) elif cmd == BDMINPUTTYPE.ReadBlkUpdate: output = self.__readBlockfileUpdates() elif cmd == BDMINPUTTYPE.Passthrough: # If the caller is waiting, then it is notified by output funcName = inputTuple[3] funcArgs = inputTuple[4:] output = getattr(self.bdm, funcName)(*funcArgs) elif cmd == BDMINPUTTYPE.Shutdown: LOGINFO('Shutdown Requested') self.__shutdown() elif cmd == BDMINPUTTYPE.ForceRebuild: LOGINFO('Rebuild databases requested') self.__fullRebuild() elif cmd == BDMINPUTTYPE.Reset: LOGINFO('Reset Requested') self.__reset() elif cmd == BDMINPUTTYPE.GoOnlineRequested: LOGINFO('Go online requested') # This only sets the blkMode to what will later be # recognized as online-requested, or offline self.prefMode = BLOCKCHAINMODE.Full if self.bdm.isInitialized(): # The BDM was started and stopped at one point, without # being reset. It can safely pick up from where it # left off self.__readBlockfileUpdates() else: self.blkMode = BLOCKCHAINMODE.Uninitialized self.__startLoadBlockchain() elif cmd == BDMINPUTTYPE.GoOfflineRequested: LOGINFO('Go offline requested') self.prefMode = BLOCKCHAINMODE.Offline self.inputQueue.task_done() if expectOutput: self.outputQueue.put(output) except Queue.Empty: continue except: inputName = self.getBDMInputName(inputTuple[0]) LOGERROR('Error processing BDM input') #traceback.print_stack() LOGERROR('Received inputTuple: ' + inputName + ' ' + str(inputTuple)) LOGERROR('Error processing ID (%d)', rndID) LOGEXCEPT('ERROR:') if expectOutput: self.outputQueue.put('BDM_REQUEST_ERROR') self.inputQueue.task_done() continue LOGINFO('BDM is shutdown.') ################################################################################ # Make TheBDM reference the asyncrhonous BlockDataManager wrapper if we are # running TheBDM = None TheSDM = None if CLI_OPTIONS.offline: LOGINFO('Armory loaded in offline-mode. Will not attempt to load ') LOGINFO('blockchain without explicit command to do so.') TheBDM = BlockDataManagerThread(isOffline=True, blocking=False) TheBDM.start() # Also create the might-be-needed SatoshiDaemonManager TheSDM = SatoshiDaemonManager() else: # NOTE: "TheBDM" is sometimes used in the C++ code to reference the # singleton BlockDataManager_LevelDB class object. Here, # "TheBDM" refers to a python BlockDataManagerThead class # object that wraps the C++ version. It implements some of # it's own methods, and then passes through anything it # doesn't recognize to the C++ object. LOGINFO('Using the asynchronous/multi-threaded BlockDataManager.') LOGINFO('Blockchain operations will happen in the background. ') LOGINFO('Devs: check TheBDM.getBDMState() before asking for data.') LOGINFO('Registering addresses during rescans will queue them for ') LOGINFO('inclusion after the current scan is completed.') TheBDM = BlockDataManagerThread(isOffline=False, blocking=False) TheBDM.setDaemon(True) TheBDM.start() #if CLI_OPTIONS.doDebug or CLI_OPTIONS.netlog or CLI_OPTIONS.mtdebug: cppLogFile = os.path.join(ARMORY_HOME_DIR, 'armorycpplog.txt') cpplf = cppLogFile if OS_WINDOWS and isinstance(cppLogFile, unicode): cpplf = cppLogFile.encode('utf8') # For C++ logging, higher levels is more logging, 0 is disabled # For Python logging (in ArmoryUtils) it's reversed if CLI_OPTIONS.logDisable: TheBDM.StartCppLogging(cpplf, 0) else: TheBDM.StartCppLogging(cpplf, 4) TheBDM.EnableCppLogStdOut() # 32-bit linux has an issue with max open files. Rather than modifying # the system, we can tell LevelDB to take it easy with max files to open if OS_LINUX and not SystemSpecs.IsX64: LOGINFO('Lowering max-open-files parameter in LevelDB for 32-bit linux') TheBDM.setMaxOpenFiles(75) # Override the above if they explicitly specify it as CLI arg if CLI_OPTIONS.maxOpenFiles > 0: LOGINFO('Overriding max files via command-line arg') TheBDM.setMaxOpenFiles( CLI_OPTIONS.maxOpenFiles ) #LOGINFO('LevelDB max-open-files is %d', TheBDM.getMaxOpenFiles()) # Also load the might-be-needed SatoshiDaemonManager TheSDM = SatoshiDaemonManager() # Put the import at the end to avoid circular reference problem from armoryengine.PyBtcWallet import PyBtcWallet, BLOCKCHAIN_READONLY from armoryengine.Transaction import PyTx armory-0.92.3/armoryengine/BinaryUnpacker.py0000644000000000000000000001124312414772654017617 0ustar rootroot################################################################################ # # Copyright (C) 2011-2014, Armory Technologies, Inc. # Distributed under the GNU Affero General Public License (AGPL v3) # See LICENSE or http://www.gnu.org/licenses/agpl.html # ################################################################################ # # Project: Armory # Author: Alan Reiner # Website: www.bitcoinarmory.com # Orig Date: 20 November, 2011 # ################################################################################ ################################################################################ ################################################################################ # Classes for reading and writing large binary objects ################################################################################ ################################################################################ from struct import pack, unpack from BinaryPacker import UINT8, UINT16, UINT32, UINT64, INT8, INT16, INT32, INT64, VAR_INT, VAR_STR, FLOAT, BINARY_CHUNK from armoryengine.ArmoryUtils import LITTLEENDIAN, unpackVarInt, LOGERROR class UnpackerError(Exception): pass # Seed this object with binary data, then read in its pieces sequentially class BinaryUnpacker(object): """ Class for helping unpack binary streams of data. Typical usage is >> bup = BinaryUnpacker(myBinaryData) >> int32 = bup.get(UINT32) >> int64 = bup.get(VAR_INT) >> bytes10 = bup.get(BINARY_CHUNK, 10) >> ...etc... """ def __init__(self, binaryStr): self.binaryStr = binaryStr self.pos = 0 def getSize(self): return len(self.binaryStr) def getRemainingSize(self): return len(self.binaryStr) - self.pos def getBinaryString(self): return self.binaryStr def getRemainingString(self): return self.binaryStr[self.pos:] def append(self, binaryStr): self.binaryStr += binaryStr def advance(self, bytesToAdvance): self.pos += bytesToAdvance def rewind(self, bytesToRewind): self.pos -= bytesToRewind def resetPosition(self, toPos=0): self.pos = toPos def getPosition(self): return self.pos def get(self, varType, sz=0, endianness=LITTLEENDIAN): """ First argument is the data-type: UINT32, VAR_INT, etc. If BINARY_CHUNK, need to supply a number of bytes to read, as well """ def sizeCheck(sz): if self.getRemainingSize() 0: return (tempsize, self.torrentSize) elif mainsize > 0: if not mainsize == self.torrentSize: LOGERROR('Torrent %s is not the correct size...?', self.torrentName) return (0,0) else: return (mainsize, mainsize) return (0, self.torrentSize) ############################################################################# def hasCustomFunc(self, funcName): if not funcName in self.customCallbacks: return False return isinstance(self.customCallbacks[funcName], types.FunctionType) ############################################################################# def setCallback(self, name, func): if func is None: if name in self.customCallbacks: del self.customCallbacks[name] return self.customCallbacks[name] = func ############################################################################# def setSecondsBetweenUpdates(self, newSec): self.minSecondsBetweenUpdates = newSec ############################################################################# def isDone(self): return self.doneObj.isSet() ############################################################################# def displayFunc(self, dpflag=Event(), fractionDone=None, timeEst=None, downRate=None, upRate=None, activity=None, statistics=None, **kws): # Use caller-set function if it exists if self.hasCustomFunc('displayFunc'): self.customCallbacks['displayFunc'](dpflag, fractionDone, timeEst, \ downRate, upRate, activity, \ statistics, **kws) return pr = '' pr += ('Done: %0.1f%%' % (fractionDone*100)) if fractionDone else '' pr += (' (%0.1f kB/s' % (downRate/1024.)) if downRate else ' (' pr += (' from %d seeds' % statistics.numSeeds) if statistics else '' pr += (' and %d peers' % statistics.numPeers) if statistics else '' if timeEst: pr += '; Approx %s remaining' % secondsToHumanTime(timeEst) pr += ')' LOGINFO(pr) ############################################################################# def statusFunc(self, dpflag=Event(), fractionDone=None, timeEst=None, downRate=None, upRate=None, activity=None, statistics=None, **kws): # Want to be able to query a few things between status calls self.lastStats['fracDone'] = fractionDone self.lastStats['timeEst'] = timeEst self.lastStats['downRate'] = downRate self.lastStats['upRate'] = upRate self.lastStats['activity'] = activity self.lastStats['numSeeds'] = statistics.numSeeds if statistics else None self.lastStats['numPeers'] = statistics.numPeers if statistics else None self.lastStats['downTotal']= statistics.downTotal if statistics else None self.lastStats['upTotal'] = statistics.upTotal if statistics else None try: if (RightNow() - self.lastUpdate) < self.minSecondsBetweenUpdates: return self.lastUpdate = RightNow() self.displayFunc(dpflag, fractionDone, timeEst, downRate, upRate, activity, statistics, **kws) finally: # Set this flag to let the caller know it's ready for the next update dpflag.set() ############################################################################# def getLastStats(self, name): return self.lastStats.get(name) ############################################################################# def isStarted(self): return (self.startTime is not None) ############################################################################# def isFailed(self): return self.dlFailed ############################################################################# def isFinished(self): return (self.finishTime is not None) or self.dlFailed ############################################################################# def isRunning(self): return self.isStarted() and not self.isFinished() ############################################################################# def finishedFunc(self): """ This function must rename the ".partial" function to the correct name """ self.finishTime = RightNow() LOGINFO('Download finished!') LOGINFO("Moving file") LOGINFO(" From: %s", self.savePath_temp) LOGINFO(" To: %s", self.savePath) shutil.move(self.savePath_temp, self.savePath) # Use caller-set function if it exists if self.hasCustomFunc('finishedFunc'): self.customCallbacks['finishedFunc']() if self.bt1dow: self.bt1dow.shutdown() ############################################################################# def failedFunc(self, msg=''): self.dlFailed = True LOGEXCEPT('Download failed! %s', msg) # Use caller-set function if it exists if self.hasCustomFunc('failedFunc'): self.customCallbacks['failedFunc'](msg) return if self.bt1dow: self.bt1dow.shutdown() ############################################################################# def errorFunc(self, errMsg): # Use caller-set function if it exists if 'failed hash check, re-downloading it' in errMsg: self.nHashFailures = self.nHashFailures +1 if self.hasCustomFunc('errorFunc'): self.customCallbacks['errorFunc'](errMsg) return LOGEXCEPT(errMsg) ############################################################################# def excFunc(self, errMsg): # Use caller-set function if it exists if self.hasCustomFunc('excFunc'): self.customCallbacks['excFunc'](errMsg) return LOGEXCEPT(errMsg) ############################################################################# def chooseFileFunc(self, default, fsize, saveas, thedir): # Use caller-set function if it exists if self.hasCustomFunc('chooseFileFunc'): self.customCallbacks['chooseFileFunc'](default, fsize, saveas, thedir) return return (default if saveas is None else saveas) ############################################################################# def getTDMState(self): if self.nHashFailures >= self.killAfterNHashFails: return 'HashFailures' if self.disabled: return 'Disabled' if not self.isInitialized(): return 'Uninitialized' if self.torrentDNE: return 'TorrentDNE' if not self.isStarted(): return 'ReadyToStart' if self.dlFailed: return 'DownloadFailed' if self.isFinished(): return 'DownloadFinished' return 'Downloading' ############################################################################# def startDownload(self): return self.doTheDownloadThing(async=True) ############################################################################# @AllowAsync def doTheDownloadThing(self): """ This was copied and modified directly from btdownloadheadless.py """ if self.disabled: LOGERROR('Attempted to start DL but DISABLE_TORRENT is True') return while 1: # Use this var to identify if we've started downloading self.startTime = RightNow() configdir = ConfigDir(self.cacheDir) defaultsToIgnore = ['responsefile', 'url', 'priority'] configdir.setDefaults(defaults, defaultsToIgnore) config = configdir.loadConfig() config['responsefile'] = self.torrent config['url'] = '' config['priority'] = '' config['saveas'] = self.savePath_temp config['save_options'] = 0 config['max_uploads'] = 0 config['max_files_open'] = 25 configdir.deleteOldCacheData(config['expire_cache_data']) myid = createPeerID() seed(myid) rawserver = RawServer( self.doneObj, config['timeout_check_interval'], config['timeout'], ipv6_enable = config['ipv6_enabled'], failfunc = self.failedFunc, errorfunc = self.errorFunc) upnp_type = UPnP_test(config['upnp_nat_access']) while True: try: listen_port = rawserver.find_and_bind( \ config['minport'], config['maxport'], config['bind'], ipv6_socket_style = config['ipv6_binds_v4'], upnp = upnp_type, randomizer = config['random_port']) break except socketerror, e: if upnp_type and e == UPnP_ERROR: LOGWARN('WARNING: COULD NOT FORWARD VIA UPnP') upnp_type = 0 continue LOGERROR("error: Couldn't listen - " + str(e)) self.failedFunc() return if not self.response: break infohash = sha(bencode(self.response['info'])).digest() LOGINFO('Downloading: %s', self.torrentName) curr,tot = [float(a)/MEGABYTE for a in self.fileProgress()] if curr == 0: LOGINFO('Starting new download') elif curr==tot: LOGINFO('Torrent already finished!') return else: LOGINFO('Picking up where left off at %0.0f of %0.0f MB' % (curr,tot)) self.bt1dow = BT1Download( self.statusFunc, self.finishedFunc, self.errorFunc, self.excFunc, self.doneObj, config, self.response, infohash, myid, rawserver, listen_port, configdir) if not self.bt1dow.saveAs(self.chooseFileFunc): break if not self.bt1dow.initFiles(old_style = True): break if not self.bt1dow.startEngine(): self.bt1dow.shutdown() break if self.nHashFailures >= self.killAfterNHashFails: self.bt1dow.shutdown() self.customCallbacks['errorFunc']('hashFail') break self.bt1dow.startRerequester() self.bt1dow.autoStats() if not self.bt1dow.am_I_finished(): self.statusFunc(activity = 'Connecting to peers') rawserver.listen_forever(self.bt1dow.getPortHandler()) self.statusFunc(activity = 'Shutting down') self.bt1dow.shutdown() break try: rawserver.shutdown() except: pass if not self.isDone(): self.failedFunc() # Run this file to test with your target torrent. Also shows an example # of overriding methods with other custom methods. Just about # any of the methods of TorrentDownloadManager can be replaced like this if __name__=="__main__": tdm = TorrentDownloadManager() tdm.setupTorrent(argv[1], argv[2]) # Replace full-featured LOGINFOs with simple print message def simplePrint( dpflag=Event(), fractionDone=None, timeEst=None, downRate=None, upRate=None, activity=None, statistics=None, **kws): if fractionDone: print 'TorrentThread: %0.1f%% done;' % (fractionDone*100), if timeEst: print ', about %s remaining' % secondsToHumanTime(timeEst), if activity: print ' (%s)'%activity else: print '' sys.stdout.flush() # Finish funct will still move file.partial to file, this is everything else def notifyFinished(): print 'TorrentThread: Finished downloading at %s' % unixTimeToFormatStr(RightNow()) sys.stdout.flush() tdm.setCallback('displayFunc', simplePrint) tdm.setCallback('finishedFunc', notifyFinished) tdm.setSecondsBetweenUpdates(1) thr = tdm.startDownload(async=True) # The above call was asynchronous while not thr.isFinished(): print 'MainThread: Still downloading;', if tdm.getLastStats('downRate'): print ' Last dl speed: %0.1f kB/s' % (tdm.getLastStats('downRate')/1024.) else: print '' sys.stdout.flush() sleep(10) print 'Finished downloading! Exiting...' armory-0.92.3/armoryengine/ArmoryUtils.py0000644000000000000000000037176612414772654017217 0ustar rootroot################################################################################ # # Copyright (C) 2011-2014, Armory Technologies, Inc. # Distributed under the GNU Affero General Public License (AGPL v3) # See LICENSE or http://www.gnu.org/licenses/agpl.html # ################################################################################ # # Project: Armory # Author: Alan Reiner # Website: www.bitcoinarmory.com # Orig Date: 20 November, 2011 # ################################################################################ import ast from datetime import datetime from email.MIMEMultipart import MIMEMultipart from email.MIMEBase import MIMEBase from email.MIMEText import MIMEText from email.Utils import COMMASPACE, formatdate from email import Encoders import hashlib import inspect import locale import logging import math import multiprocessing import optparse import os import platform import random import signal import smtplib from struct import pack, unpack from itertools import izip #from subprocess import PIPE import sys import threading import time import traceback import shutil import base64 import socket #from psutil import Popen import psutil from CppBlockUtils import KdfRomix, CryptoAES from qrcodenative import QRCode, QRErrorCorrectLevel # Version Numbers BTCARMORY_VERSION = (0, 92, 3, 0) # (Major, Minor, Bugfix, AutoIncrement) PYBTCWALLET_VERSION = (1, 35, 0, 0) # (Major, Minor, Bugfix, AutoIncrement) ARMORY_DONATION_ADDR = '1ArmoryXcfq7TnCSuZa9fQjRYwJ4bkRKfv' ARMORY_DONATION_PUBKEY = ( '04' '11d14f8498d11c33d08b0cd7b312fb2e6fc9aebd479f8e9ab62b5333b2c395c5' 'f7437cab5633b5894c4a5c2132716bc36b7571cbe492a7222442b75df75b9a84') ARMORY_INFO_SIGN_ADDR = '1NWvhByxfTXPYNT4zMBmEY3VL8QJQtQoei' ARMORY_INFO_SIGN_PUBLICKEY = ('04' 'af4abc4b24ef57547dd13a1110e331645f2ad2b99dfe1189abb40a5b24e4ebd8' 'de0c1c372cc46bbee0ce3d1d49312e416a1fa9c7bb3e32a7eb3867d1c6d1f715') SATOSHI_PUBLIC_KEY = ( '04' 'fc9702847840aaf195de8442ebecedf5b095cdbb9bc716bda9110971b28a49e0' 'ead8564ff0db22209e0374782c093bb899692d524e9d6a6956e7c5ecbcd68284') indent = ' '*3 haveGUI = [False, None] parser = optparse.OptionParser(usage="%prog [options]\n") parser.add_option("--settings", dest="settingsPath",default='DEFAULT', type="str", help="load Armory with a specific settings file") parser.add_option("--datadir", dest="datadir", default='DEFAULT', type="str", help="Change the directory that Armory calls home") parser.add_option("--satoshi-datadir", dest="satoshiHome", default='DEFAULT', type='str', help="The Bitcoin-Qt/bitcoind home directory") parser.add_option("--satoshi-port", dest="satoshiPort", default='DEFAULT', type="str", help="For Bitcoin-Qt instances operating on a non-standard port") parser.add_option("--satoshi-rpcport", dest="satoshiRpcport",default='DEFAULT',type="str", help="RPC port Bitcoin-Qt instances operating on a non-standard port") #parser.add_option("--bitcoind-path", dest="bitcoindPath",default='DEFAULT', type="str", help="Path to the location of bitcoind on your system") parser.add_option("--dbdir", dest="leveldbDir", default='DEFAULT', type='str', help="Location to store blocks database (defaults to --datadir)") parser.add_option("--rpcport", dest="rpcport", default='DEFAULT', type="str", help="RPC port for running armoryd.py") parser.add_option("--testnet", dest="testnet", default=False, action="store_true", help="Use the testnet protocol") parser.add_option("--offline", dest="offline", default=False, action="store_true", help="Force Armory to run in offline mode") parser.add_option("--nettimeout", dest="nettimeout", default=2, type="int", help="Timeout for detecting internet connection at startup") parser.add_option("--interport", dest="interport", default=-1, type="int", help="Port for inter-process communication between Armory instances") parser.add_option("--debug", dest="doDebug", default=False, action="store_true", help="Increase amount of debugging output") parser.add_option("--nologging", dest="logDisable", default=False, action="store_true", help="Disable all logging") parser.add_option("--netlog", dest="netlog", default=False, action="store_true", help="Log networking messages sent and received by Armory") parser.add_option("--logfile", dest="logFile", default='DEFAULT', type='str', help="Specify a non-default location to send logging information") parser.add_option("--mtdebug", dest="mtdebug", default=False, action="store_true", help="Log multi-threaded call sequences") parser.add_option("--skip-online-check",dest="forceOnline", default=False, action="store_true", help="Go into online mode, even if internet connection isn't detected") parser.add_option("--skip-stats-report", dest="skipStatsReport", default=False, action="store_true", help="Does announcement checking without any OS/version reporting (for ATI statistics)") parser.add_option("--skip-announce-check",dest="skipAnnounceCheck", default=False, action="store_true", help="Do not query for Armory announcements") parser.add_option("--tor", dest="useTorSettings", default=False, action="store_true", help="Enable common settings for when Armory connects through Tor") parser.add_option("--keypool", dest="keypool", default=100, type="int", help="Default number of addresses to lookahead in Armory wallets") parser.add_option("--redownload", dest="redownload", default=False, action="store_true", help="Delete Bitcoin-Qt/bitcoind databases; redownload") parser.add_option("--rebuild", dest="rebuild", default=False, action="store_true", help="Rebuild blockchain database and rescan") parser.add_option("--rescan", dest="rescan", default=False, action="store_true", help="Rescan existing blockchain DB") parser.add_option("--maxfiles", dest="maxOpenFiles",default=0, type="int", help="Set maximum allowed open files for LevelDB databases") parser.add_option("--disable-torrent", dest="disableTorrent", default=False, action="store_true", help="Only download blockchain data via P2P network (slow)") parser.add_option("--test-announce", dest="testAnnounceCode", default=False, action="store_true", help="Only used for developers needing to test announcement code with non-offline keys") parser.add_option("--nospendzeroconfchange",dest="ignoreAllZC",default=False, action="store_true", help="All zero-conf funds will be unspendable, including sent-to-self coins") parser.add_option("--multisigfile", dest="multisigFile", default='DEFAULT', type='str', help="File to store information about multi-signature transactions") parser.add_option("--force-wallet-check", dest="forceWalletCheck", default=False, action="store_true", help="Force the wallet sanity check on startup") parser.add_option("--disable-modules", dest="disableModules", default=False, action="store_true", help="Disable looking for modules in the execution directory") parser.add_option("--disable-conf-permis", dest="disableConfPermis", default=False, action="store_true", help="Disable forcing permissions on bitcoin.conf") # Pre-10.9 OS X sometimes passes a process serial number as -psn_0_xxxxxx. Nuke! if sys.platform == 'darwin': parser.add_option('-p', '--psn') # These are arguments passed by running unit-tests that need to be handled parser.add_option("--port", dest="port", default=None, type="int", help="Unit Test Argument - Do not consume") parser.add_option("--verbosity", dest="verbosity", default=None, type="int", help="Unit Test Argument - Do not consume") parser.add_option("--coverage_output_dir", dest="coverageOutputDir", default=None, type="str", help="Unit Test Argument - Do not consume") parser.add_option("--coverage_include", dest="coverageInclude", default=None, type="str", help="Unit Test Argument - Do not consume") # Some useful constants to be used throughout everything BASE58CHARS = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz' BASE16CHARS = '0123 4567 89ab cdef'.replace(' ','') LITTLEENDIAN = '<' BIGENDIAN = '>' NETWORKENDIAN = '!' ONE_BTC = long(100000000) DONATION = long(5000000) CENT = long(1000000) UNINITIALIZED = None UNKNOWN = -2 MIN_TX_FEE = 10000 MIN_RELAY_TX_FEE = 10000 MT_WAIT_TIMEOUT_SEC = 20; UINT8_MAX = 2**8-1 UINT16_MAX = 2**16-1 UINT32_MAX = 2**32-1 UINT64_MAX = 2**64-1 RightNow = time.time SECOND = 1 MINUTE = 60 HOUR = 3600 DAY = 24*HOUR WEEK = 7*DAY MONTH = 30*DAY YEAR = 365*DAY UNCOMP_PK_LEN = 65 COMP_PK_LEN = 33 KILOBYTE = 1024.0 MEGABYTE = 1024*KILOBYTE GIGABYTE = 1024*MEGABYTE TERABYTE = 1024*GIGABYTE PETABYTE = 1024*TERABYTE LB_MAXM = 7 LB_MAXN = 7 # Set the default-default DEFAULT_DATE_FORMAT = '%Y-%b-%d %I:%M%p' FORMAT_SYMBOLS = [ \ ['%y', 'year, two digit (00-99)'], \ ['%Y', 'year, four digit'], \ ['%b', 'month name (abbrev)'], \ ['%B', 'month name (full)'], \ ['%m', 'month number (01-12)'], \ ['%d', 'day of month (01-31)'], \ ['%H', 'hour 24h (00-23)'], \ ['%I', 'hour 12h (01-12)'], \ ['%M', 'minute (00-59)'], \ ['%p', 'morning/night (am,pm)'], \ ['%a', 'day of week (abbrev)'], \ ['%A', 'day of week (full)'], \ ['%%', 'percent symbol'] ] class UnserializeError(Exception): pass class BadAddressError(Exception): pass class VerifyScriptError(Exception): pass class FileExistsError(Exception): pass class ECDSA_Error(Exception): pass class UnitializedBlockDataError(Exception): pass class WalletLockError(Exception): pass class SignatureError(Exception): pass class KeyDataError(Exception): pass class ChecksumError(Exception): pass class WalletAddressError(Exception): pass class PassphraseError(Exception): pass class EncryptionError(Exception): pass class InterruptTestError(Exception): pass class NetworkIDError(Exception): pass class WalletExistsError(Exception): pass class ConnectionError(Exception): pass class BlockchainUnavailableError(Exception): pass class InvalidHashError(Exception): pass class InvalidScriptError(Exception): pass class BadURIError(Exception): pass class CompressedKeyError(Exception): pass class TooMuchPrecisionError(Exception): pass class NegativeValueError(Exception): pass class FiniteFieldError(Exception): pass class BitcoindError(Exception): pass class ShouldNotGetHereError(Exception): pass class BadInputError(Exception): pass class UstxError(Exception): pass class P2SHNotSupportedError(Exception): pass # Get the host operating system opsys = platform.system() OS_WINDOWS = 'win32' in opsys.lower() or 'windows' in opsys.lower() OS_LINUX = 'nix' in opsys.lower() or 'nux' in opsys.lower() OS_MACOSX = 'darwin' in opsys.lower() or 'osx' in opsys.lower() if getattr(sys, 'frozen', False): sys.argv = [arg.decode('utf8') for arg in sys.argv] CLI_OPTIONS = None CLI_ARGS = None (CLI_OPTIONS, CLI_ARGS) = parser.parse_args() # This is probably an abuse of the CLI_OPTIONS structure, but not # automatically expanding "~" symbols is killing me for opt,val in CLI_OPTIONS.__dict__.iteritems(): if not isinstance(val, basestring) or not val.startswith('~'): continue if os.path.exists(os.path.expanduser(val)): CLI_OPTIONS.__dict__[opt] = os.path.expanduser(val) else: # If the path doesn't exist, it still won't exist when we don't # modify it, and I'd like to modify as few vars as possible pass # Use CLI args to determine testnet or not USE_TESTNET = CLI_OPTIONS.testnet #USE_TESTNET = True # Set default port for inter-process communication if CLI_OPTIONS.interport < 0: CLI_OPTIONS.interport = 8223 + (1 if USE_TESTNET else 0) # Pass this bool to all getSpendable* methods, and it will consider # all zero-conf UTXOs as unspendable, including sent-to-self (change) IGNOREZC = CLI_OPTIONS.ignoreAllZC # Figure out the default directories for Satoshi client, and BicoinArmory OS_NAME = '' OS_VARIANT = '' USER_HOME_DIR = '' BTC_HOME_DIR = '' ARMORY_HOME_DIR = '' LEVELDB_DIR = '' SUBDIR = 'testnet3' if USE_TESTNET else '' if OS_WINDOWS: OS_NAME = 'Windows' OS_VARIANT = platform.win32_ver() import ctypes buffer = ctypes.create_unicode_buffer(u'\0' * 260) rt = ctypes.windll.shell32.SHGetFolderPathW(0, 26, 0, 0, ctypes.byref(buffer)) USER_HOME_DIR = unicode(buffer.value) BTC_HOME_DIR = os.path.join(USER_HOME_DIR, 'Bitcoin', SUBDIR) ARMORY_HOME_DIR = os.path.join(USER_HOME_DIR, 'Armory', SUBDIR) BLKFILE_DIR = os.path.join(BTC_HOME_DIR, 'blocks') BLKFILE_1stFILE = os.path.join(BLKFILE_DIR, 'blk00000.dat') elif OS_LINUX: OS_NAME = 'Linux' OS_VARIANT = platform.linux_distribution() USER_HOME_DIR = os.getenv('HOME') BTC_HOME_DIR = os.path.join(USER_HOME_DIR, '.bitcoin', SUBDIR) ARMORY_HOME_DIR = os.path.join(USER_HOME_DIR, '.armory', SUBDIR) BLKFILE_DIR = os.path.join(BTC_HOME_DIR, 'blocks') BLKFILE_1stFILE = os.path.join(BLKFILE_DIR, 'blk00000.dat') elif OS_MACOSX: platform.mac_ver() OS_NAME = 'MacOSX' OS_VARIANT = platform.mac_ver() USER_HOME_DIR = os.path.expanduser('~/Library/Application Support') BTC_HOME_DIR = os.path.join(USER_HOME_DIR, 'Bitcoin', SUBDIR) ARMORY_HOME_DIR = os.path.join(USER_HOME_DIR, 'Armory', SUBDIR) BLKFILE_DIR = os.path.join(BTC_HOME_DIR, 'blocks') BLKFILE_1stFILE = os.path.join(BLKFILE_DIR, 'blk00000.dat') else: print '***Unknown operating system!' print '***Cannot determine default directory locations' # Get the host operating system opsys = platform.system() OS_WINDOWS = 'win32' in opsys.lower() or 'windows' in opsys.lower() OS_LINUX = 'nix' in opsys.lower() or 'nux' in opsys.lower() OS_MACOSX = 'darwin' in opsys.lower() or 'osx' in opsys.lower() BLOCKCHAINS = {} BLOCKCHAINS['\xf9\xbe\xb4\xd9'] = "Main Network" BLOCKCHAINS['\xfa\xbf\xb5\xda'] = "Old Test Network" BLOCKCHAINS['\x0b\x11\x09\x07'] = "Test Network (testnet3)" NETWORKS = {} NETWORKS['\x00'] = "Main Network" NETWORKS['\x05'] = "Main Network" NETWORKS['\x6f'] = "Test Network" NETWORKS['\xc4'] = "Test Network" NETWORKS['\x34'] = "Namecoin Network" # We disable wallet checks on ARM for the sake of resources (unless forced) DO_WALLET_CHECK = CLI_OPTIONS.forceWalletCheck or \ not platform.machine().lower().startswith('arm') # Version Handling Code def getVersionString(vquad, numPieces=4): vstr = '%d.%02d' % vquad[:2] if (vquad[2] > 0 or vquad[3] > 0) and numPieces>2: vstr += '.%d' % vquad[2] if vquad[3] > 0 and numPieces>3: vstr += '.%d' % vquad[3] return vstr def getVersionInt(vquad, numPieces=4): vint = int(vquad[0] * 1e7) vint += int(vquad[1] * 1e5) if numPieces>2: vint += int(vquad[2] * 1e3) if numPieces>3: vint += int(vquad[3]) return vint def readVersionString(verStr): verList = [int(piece) for piece in verStr.split('.')] while len(verList)<4: verList.append(0) return tuple(verList) def readVersionInt(verInt): verStr = str(verInt).rjust(10,'0') verList = [] verList.append( int(verStr[ -3:]) ) verList.append( int(verStr[ -5:-3 ]) ) verList.append( int(verStr[ -7:-5 ]) ) verList.append( int(verStr[:-7 ]) ) return tuple(verList[::-1]) # Allow user to override default bitcoin-qt/bitcoind home directory if not CLI_OPTIONS.satoshiHome.lower()=='default': success = True if USE_TESTNET: testnetTry = os.path.join(CLI_OPTIONS.satoshiHome, 'testnet3') if os.path.exists(testnetTry): CLI_OPTIONS.satoshiHome = testnetTry if not os.path.exists(CLI_OPTIONS.satoshiHome): print 'Directory "%s" does not exist! Using default!' % \ CLI_OPTIONS.satoshiHome else: BTC_HOME_DIR = CLI_OPTIONS.satoshiHome # Allow user to override default Armory home directory if not CLI_OPTIONS.datadir.lower()=='default': if not os.path.exists(CLI_OPTIONS.datadir): print 'Directory "%s" does not exist! Using default!' % \ CLI_OPTIONS.datadir else: ARMORY_HOME_DIR = CLI_OPTIONS.datadir # Same for the directory that holds the LevelDB databases LEVELDB_DIR = os.path.join(ARMORY_HOME_DIR, 'databases') if not CLI_OPTIONS.leveldbDir.lower()=='default': if not os.path.exists(CLI_OPTIONS.leveldbDir): print 'Directory "%s" does not exist! Using default!' % \ CLI_OPTIONS.leveldbDir os.makedirs(CLI_OPTIONS.leveldbDir) else: LEVELDB_DIR = CLI_OPTIONS.leveldbDir # Change the log file to use ARMORY_LOG_FILE = os.path.join(ARMORY_HOME_DIR, 'armorylog.txt') ARMCPP_LOG_FILE = os.path.join(ARMORY_HOME_DIR, 'armorycpplog.txt') if not sys.argv[0] in ['ArmoryQt.py', 'ArmoryQt.exe', 'Armory.exe']: basename = os.path.basename(sys.argv[0]) CLI_OPTIONS.logFile = os.path.join(ARMORY_HOME_DIR, '%s.log.txt' % basename) # Change the settings file to use if CLI_OPTIONS.settingsPath.lower()=='default': CLI_OPTIONS.settingsPath = os.path.join(ARMORY_HOME_DIR, 'ArmorySettings.txt') # Change the log file to use if CLI_OPTIONS.logFile.lower()=='default': if sys.argv[0] in ['ArmoryQt.py', 'ArmoryQt.exe', 'Armory.exe']: CLI_OPTIONS.logFile = os.path.join(ARMORY_HOME_DIR, 'armorylog.txt') else: basename = os.path.basename(sys.argv[0]) CLI_OPTIONS.logFile = os.path.join(ARMORY_HOME_DIR, '%s.log.txt' % basename) SETTINGS_PATH = CLI_OPTIONS.settingsPath MULT_LOG_FILE = os.path.join(ARMORY_HOME_DIR, 'multipliers.txt') MULTISIG_FILE_NAME = 'multisigs.txt' MULTISIG_FILE = os.path.join(ARMORY_HOME_DIR, MULTISIG_FILE_NAME) if not CLI_OPTIONS.multisigFile.lower()=='default': if not os.path.exists(CLI_OPTIONS.multisigFile): print 'Multisig file "%s" does not exist!' % CLI_OPTIONS.multisigFile else: MULTISIG_FILE = CLI_OPTIONS.multisigFile # If this is the first Armory has been run, create directories if ARMORY_HOME_DIR and not os.path.exists(ARMORY_HOME_DIR): os.makedirs(ARMORY_HOME_DIR) if not os.path.exists(LEVELDB_DIR): os.makedirs(LEVELDB_DIR) ##### MAIN NETWORK IS DEFAULT ##### if not USE_TESTNET: # TODO: The testnet genesis tx hash can't be the same...? BITCOIN_PORT = 8333 BITCOIN_RPC_PORT = 8332 ARMORY_RPC_PORT = 8225 MAGIC_BYTES = '\xf9\xbe\xb4\xd9' GENESIS_BLOCK_HASH_HEX = '6fe28c0ab6f1b372c1a6a246ae63f74f931e8365e15a089c68d6190000000000' GENESIS_BLOCK_HASH = 'o\xe2\x8c\n\xb6\xf1\xb3r\xc1\xa6\xa2F\xaec\xf7O\x93\x1e\x83e\xe1Z\x08\x9ch\xd6\x19\x00\x00\x00\x00\x00' GENESIS_TX_HASH_HEX = '3ba3edfd7a7b12b27ac72c3e67768f617fc81bc3888a51323a9fb8aa4b1e5e4a' GENESIS_TX_HASH = ';\xa3\xed\xfdz{\x12\xb2z\xc7,>gv\x8fa\x7f\xc8\x1b\xc3\x88\x8aQ2:\x9f\xb8\xaaK\x1e^J' ADDRBYTE = '\x00' P2SHBYTE = '\x05' PRIVKEYBYTE = '\x80' # This will usually just be used in the GUI to make links for the user BLOCKEXPLORE_NAME = 'blockchain.info' BLOCKEXPLORE_URL_TX = 'https://blockchain.info/tx/%s' BLOCKEXPLORE_URL_ADDR = 'https://blockchain.info/address/%s' else: BITCOIN_PORT = 18333 BITCOIN_RPC_PORT = 18332 ARMORY_RPC_PORT = 18225 MAGIC_BYTES = '\x0b\x11\x09\x07' GENESIS_BLOCK_HASH_HEX = '43497fd7f826957108f4a30fd9cec3aeba79972084e90ead01ea330900000000' GENESIS_BLOCK_HASH = 'CI\x7f\xd7\xf8&\x95q\x08\xf4\xa3\x0f\xd9\xce\xc3\xae\xbay\x97 \x84\xe9\x0e\xad\x01\xea3\t\x00\x00\x00\x00' GENESIS_TX_HASH_HEX = '3ba3edfd7a7b12b27ac72c3e67768f617fc81bc3888a51323a9fb8aa4b1e5e4a' GENESIS_TX_HASH = ';\xa3\xed\xfdz{\x12\xb2z\xc7,>gv\x8fa\x7f\xc8\x1b\xc3\x88\x8aQ2:\x9f\xb8\xaaK\x1e^J' ADDRBYTE = '\x6f' P2SHBYTE = '\xc4' PRIVKEYBYTE = '\xef' # BLOCKEXPLORE_NAME = 'blockexplorer.com' BLOCKEXPLORE_URL_TX = 'http://blockexplorer.com/testnet/tx/%s' BLOCKEXPLORE_URL_ADDR = 'http://blockexplorer.com/testnet/address/%s' # These are the same regardless of network # They are the way data is stored in the database which is network agnostic SCRADDR_P2PKH_BYTE = '\x00' SCRADDR_P2SH_BYTE = '\x05' SCRADDR_MULTISIG_BYTE = '\xfe' SCRADDR_NONSTD_BYTE = '\xff' SCRADDR_BYTE_LIST = [SCRADDR_P2PKH_BYTE, \ SCRADDR_P2SH_BYTE, \ SCRADDR_MULTISIG_BYTE, \ SCRADDR_NONSTD_BYTE] # Copied from cppForSwig/BtcUtils.h::getTxOutScriptTypeInt(script) CPP_TXOUT_STDHASH160 = 0 CPP_TXOUT_STDPUBKEY65 = 1 CPP_TXOUT_STDPUBKEY33 = 2 CPP_TXOUT_MULTISIG = 3 CPP_TXOUT_P2SH = 4 CPP_TXOUT_NONSTANDARD = 5 CPP_TXOUT_HAS_ADDRSTR = [CPP_TXOUT_STDHASH160, \ CPP_TXOUT_STDPUBKEY65, CPP_TXOUT_STDPUBKEY33, CPP_TXOUT_P2SH] CPP_TXOUT_STDSINGLESIG = [CPP_TXOUT_STDHASH160, \ CPP_TXOUT_STDPUBKEY65, CPP_TXOUT_STDPUBKEY33] CPP_TXOUT_SCRIPT_NAMES = ['']*6 CPP_TXOUT_SCRIPT_NAMES[CPP_TXOUT_STDHASH160] = 'Standard (PKH)' CPP_TXOUT_SCRIPT_NAMES[CPP_TXOUT_STDPUBKEY65] = 'Standard (PK65)' CPP_TXOUT_SCRIPT_NAMES[CPP_TXOUT_STDPUBKEY33] = 'Standard (PK33)' CPP_TXOUT_SCRIPT_NAMES[CPP_TXOUT_MULTISIG] = 'Multi-Signature' CPP_TXOUT_SCRIPT_NAMES[CPP_TXOUT_P2SH] = 'Standard (P2SH)' CPP_TXOUT_SCRIPT_NAMES[CPP_TXOUT_NONSTANDARD] = 'Non-Standard' # Copied from cppForSwig/BtcUtils.h::getTxInScriptTypeInt(script) CPP_TXIN_STDUNCOMPR = 0 CPP_TXIN_STDCOMPR = 1 CPP_TXIN_COINBASE = 2 CPP_TXIN_SPENDPUBKEY = 3 CPP_TXIN_SPENDMULTI = 4 CPP_TXIN_SPENDP2SH = 5 CPP_TXIN_NONSTANDARD = 6 CPP_TXIN_SCRIPT_NAMES = ['']*7 CPP_TXIN_SCRIPT_NAMES[CPP_TXIN_STDUNCOMPR] = 'Sig + PubKey65' CPP_TXIN_SCRIPT_NAMES[CPP_TXIN_STDCOMPR] = 'Sig + PubKey33' CPP_TXIN_SCRIPT_NAMES[CPP_TXIN_COINBASE] = 'Coinbase' CPP_TXIN_SCRIPT_NAMES[CPP_TXIN_SPENDPUBKEY] = 'Plain Signature' CPP_TXIN_SCRIPT_NAMES[CPP_TXIN_SPENDMULTI] = 'Spend Multisig' CPP_TXIN_SCRIPT_NAMES[CPP_TXIN_SPENDP2SH] = 'Spend P2SH' CPP_TXIN_SCRIPT_NAMES[CPP_TXIN_NONSTANDARD] = 'Non-Standard' ################################################################################ if not CLI_OPTIONS.satoshiPort == 'DEFAULT': try: BITCOIN_PORT = int(CLI_OPTIONS.satoshiPort) except: raise TypeError('Invalid port for Bitcoin-Qt, using ' + str(BITCOIN_PORT)) ################################################################################ if not CLI_OPTIONS.satoshiRpcport == 'DEFAULT': try: BITCOIN_RPC_PORT = int(CLI_OPTIONS.satoshiRpcport) except: raise TypeError('Invalid rpc port for Bitcoin-Qt, using ' + str(BITCOIN_RPC_PORT)) ################################################################################ if not CLI_OPTIONS.rpcport == 'DEFAULT': try: ARMORY_RPC_PORT = int(CLI_OPTIONS.rpcport) except: raise TypeError('Invalid RPC port for armoryd ' + str(ARMORY_RPC_PORT)) if sys.argv[0]=='ArmoryQt.py': print '********************************************************************************' print 'Loading Armory Engine:' print ' Armory Version: ', getVersionString(BTCARMORY_VERSION) print ' PyBtcWallet Version:', getVersionString(PYBTCWALLET_VERSION) print 'Detected Operating system:', OS_NAME print ' OS Variant :', OS_VARIANT print ' User home-directory :', USER_HOME_DIR print ' Satoshi BTC directory :', BTC_HOME_DIR print ' Armory home dir :', ARMORY_HOME_DIR print ' LevelDB directory :', LEVELDB_DIR print ' Armory settings file :', SETTINGS_PATH print ' Armory log file :', ARMORY_LOG_FILE print ' Do wallet checking :', DO_WALLET_CHECK ################################################################################ def launchProcess(cmd, useStartInfo=True, *args, **kwargs): LOGINFO('Executing popen: %s', str(cmd)) if not OS_WINDOWS: from subprocess import Popen, PIPE return Popen(cmd, stdin=PIPE, stdout=PIPE, stderr=PIPE, *args, **kwargs) else: from subprocess_win import Popen, PIPE, STARTUPINFO, STARTF_USESHOWWINDOW if useStartInfo: startinfo = STARTUPINFO() startinfo.dwFlags |= STARTF_USESHOWWINDOW return Popen(cmd, \ *args, \ stdin=PIPE, \ stdout=PIPE, \ stderr=PIPE, \ startupinfo=startinfo, \ **kwargs) else: return Popen(cmd, \ *args, \ stdin=PIPE, \ stdout=PIPE, \ stderr=PIPE, \ **kwargs) ################################################################################ def killProcess(pid, sig='default'): # I had to do this, because killing a process in Windows has issues # when using py2exe (yes, os.kill does not work, for the same reason # I had to pass stdin/stdout/stderr everywhere... LOGWARN('Killing process pid=%d', pid) if not OS_WINDOWS: import os sig = signal.SIGKILL if sig=='default' else sig os.kill(pid, sig) else: import sys, os.path, ctypes, ctypes.wintypes k32 = ctypes.WinDLL('kernel32.dll') k32.OpenProcess.restype = ctypes.wintypes.HANDLE k32.TerminateProcess.restype = ctypes.wintypes.BOOL hProcess = k32.OpenProcess(1, False, pid) k32.TerminateProcess(hProcess, 1) k32.CloseHandle(hProcess) ################################################################################ def subprocess_check_output(*popenargs, **kwargs): """ Run command with arguments and return its output as a byte string. Backported from Python 2.7, because it's stupid useful, short, and won't exist on systems using Python 2.6 or earlier """ from subprocess import CalledProcessError process = launchProcess(*popenargs, **kwargs) output, unused_err = process.communicate() retcode = process.poll() if retcode: cmd = kwargs.get("args") if cmd is None: cmd = popenargs[0] error = CalledProcessError(retcode, cmd) error.output = output raise error return output ################################################################################ def killProcessTree(pid): # In this case, Windows is easier because we know it has the get_children # call, because have bundled a recent version of psutil. Linux, however, # does not have that function call in earlier versions. from subprocess import Popen, PIPE if not OS_LINUX: for child in psutil.Process(pid).get_children(): killProcess(child.pid) else: proc = Popen("ps -o pid --ppid %d --noheaders" % pid, shell=True, stdout=PIPE) out,err = proc.communicate() for pid_str in out.split("\n")[:-1]: killProcess(int(pid_str)) ################################################################################ # Similar to subprocess_check_output, but used for long-running commands def execAndWait(cli_str, timeout=0, useStartInfo=True): """ There may actually still be references to this function where check_output would've been more appropriate. But I didn't know about check_output at the time... """ process = launchProcess(cli_str, shell=True, useStartInfo=useStartInfo) pid = process.pid start = RightNow() while process.poll() == None: time.sleep(0.1) if timeout>0 and (RightNow() - start)>timeout: print 'Process exceeded timeout, killing it' killProcess(pid) out,err = process.communicate() return [out,err] ######### INITIALIZE LOGGING UTILITIES ########## # # Setup logging to write INFO+ to file, and WARNING+ to console # In debug mode, will write DEBUG+ to file and INFO+ to console # # Want to get the line in which an error was triggered, but by wrapping # the logger function (as I will below), the displayed "file:linenum" # references the logger function, not the function that called it. # So I use traceback to find the file and line number two up in the # stack trace, and return that to be displayed instead of default # [Is this a hack? Yes and no. I see no other way to do this] def getCallerLine(): stkTwoUp = traceback.extract_stack()[-3] filename,method = stkTwoUp[0], stkTwoUp[1] return '%s:%d' % (os.path.basename(filename),method) # When there's an error in the logging function, it's impossible to find! # These wrappers will print the full stack so that it's possible to find # which line triggered the error def LOGDEBUG(msg, *a): try: logstr = msg if len(a)==0 else (msg%a) callerStr = getCallerLine() + ' - ' logging.debug(callerStr + logstr) except TypeError: traceback.print_stack() raise def LOGINFO(msg, *a): try: logstr = msg if len(a)==0 else (msg%a) callerStr = getCallerLine() + ' - ' logging.info(callerStr + logstr) except TypeError: traceback.print_stack() raise def LOGWARN(msg, *a): try: logstr = msg if len(a)==0 else (msg%a) callerStr = getCallerLine() + ' - ' logging.warn(callerStr + logstr) except TypeError: traceback.print_stack() raise def LOGERROR(msg, *a): try: logstr = msg if len(a)==0 else (msg%a) callerStr = getCallerLine() + ' - ' logging.error(callerStr + logstr) except TypeError: traceback.print_stack() raise def LOGCRIT(msg, *a): try: logstr = msg if len(a)==0 else (msg%a) callerStr = getCallerLine() + ' - ' logging.critical(callerStr + logstr) except TypeError: traceback.print_stack() raise def LOGEXCEPT(msg, *a): try: logstr = msg if len(a)==0 else (msg%a) callerStr = getCallerLine() + ' - ' logging.exception(callerStr + logstr) except TypeError: traceback.print_stack() raise def chopLogFile(filename, size): if not os.path.exists(filename): print 'Log file doesn\'t exist [yet]' return logfile = open(filename, 'r') allLines = logfile.readlines() logfile.close() nBytes,nLines = 0,0; for line in allLines[::-1]: nBytes += len(line) nLines += 1 if nBytes>size: break logfile = open(filename, 'w') for line in allLines[-nLines:]: logfile.write(line) logfile.close() # Cut down the log file to just the most recent 1 MB chopLogFile(ARMORY_LOG_FILE, 1024*1024) # Now set loglevels DEFAULT_CONSOLE_LOGTHRESH = logging.WARNING DEFAULT_FILE_LOGTHRESH = logging.INFO DEFAULT_PPRINT_LOGLEVEL = logging.DEBUG DEFAULT_RAWDATA_LOGLEVEL = logging.DEBUG rootLogger = logging.getLogger('') if CLI_OPTIONS.doDebug or CLI_OPTIONS.netlog or CLI_OPTIONS.mtdebug: # Drop it all one level: console will see INFO, file will see DEBUG DEFAULT_CONSOLE_LOGTHRESH -= 20 DEFAULT_FILE_LOGTHRESH -= 20 if CLI_OPTIONS.logDisable: DEFAULT_CONSOLE_LOGTHRESH += 100 DEFAULT_FILE_LOGTHRESH += 100 DateFormat = '%Y-%m-%d %H:%M' logging.getLogger('').setLevel(logging.DEBUG) fileFormatter = logging.Formatter('%(asctime)s (%(levelname)s) -- %(message)s', \ datefmt=DateFormat) fileHandler = logging.FileHandler(ARMORY_LOG_FILE) fileHandler.setLevel(DEFAULT_FILE_LOGTHRESH) fileHandler.setFormatter(fileFormatter) logging.getLogger('').addHandler(fileHandler) consoleFormatter = logging.Formatter('(%(levelname)s) %(message)s') consoleHandler = logging.StreamHandler() consoleHandler.setLevel(DEFAULT_CONSOLE_LOGTHRESH) consoleHandler.setFormatter( consoleFormatter ) logging.getLogger('').addHandler(consoleHandler) class stringAggregator(object): def __init__(self): self.theStr = '' def getStr(self): return self.theStr def write(self, theStr): self.theStr += theStr # A method to redirect pprint() calls to the log file # Need a way to take a pprint-able object, and redirect its output to file # Do this by swapping out sys.stdout temporarily, execute theObj.pprint() # then set sys.stdout back to the original. def LOGPPRINT(theObj, loglevel=DEFAULT_PPRINT_LOGLEVEL): sys.stdout = stringAggregator() theObj.pprint() printedStr = sys.stdout.getStr() sys.stdout = sys.__stdout__ stkOneUp = traceback.extract_stack()[-2] filename,method = stkOneUp[0], stkOneUp[1] methodStr = '(PPRINT from %s:%d)\n' % (filename,method) logging.log(loglevel, methodStr + printedStr) # For super-debug mode, we'll write out raw data def LOGRAWDATA(rawStr, loglevel=DEFAULT_RAWDATA_LOGLEVEL): dtype = isLikelyDataType(rawStr) stkOneUp = traceback.extract_stack()[-2] filename,method = stkOneUp[0], stkOneUp[1] methodStr = '(PPRINT from %s:%d)\n' % (filename,method) pstr = rawStr[:] if dtype==DATATYPE.Binary: pstr = binary_to_hex(rawStr) pstr = prettyHex(pstr, indent=' ', withAddr=False) elif dtype==DATATYPE.Hex: pstr = prettyHex(pstr, indent=' ', withAddr=False) else: pstr = ' ' + '\n '.join(pstr.split('\n')) logging.log(loglevel, methodStr + pstr) cpplogfile = None if CLI_OPTIONS.logDisable: print 'Logging is disabled' rootLogger.disabled = True def logexcept_override(type, value, tback): import traceback import logging strList = traceback.format_exception(type,value,tback) logging.error(''.join([s for s in strList])) # then call the default handler sys.__excepthook__(type, value, tback) sys.excepthook = logexcept_override # If there is a rebuild or rescan flag, let's do the right thing. fileRedownload = os.path.join(ARMORY_HOME_DIR, 'redownload.flag') fileRebuild = os.path.join(ARMORY_HOME_DIR, 'rebuild.flag') fileRescan = os.path.join(ARMORY_HOME_DIR, 'rescan.flag') fileDelSettings = os.path.join(ARMORY_HOME_DIR, 'delsettings.flag') # Flag to remove everything in Bitcoin dir except wallet.dat (if requested) if os.path.exists(fileRedownload): # Flag to remove *BITCOIN-QT* databases so it will have to re-download LOGINFO('Found %s, will delete Bitcoin DBs & redownload' % fileRedownload) os.remove(fileRedownload) if os.path.exists(fileRebuild): os.remove(fileRebuild) if os.path.exists(fileRescan): os.remove(fileRescan) CLI_OPTIONS.redownload = True CLI_OPTIONS.rebuild = True elif os.path.exists(fileRebuild): # Flag to remove Armory databases so it will have to rebuild LOGINFO('Found %s, will destroy and rebuild databases' % fileRebuild) os.remove(fileRebuild) if os.path.exists(fileRescan): os.remove(fileRescan) CLI_OPTIONS.rebuild = True elif os.path.exists(fileRescan): LOGINFO('Found %s, will throw out saved history, rescan' % fileRescan) os.remove(fileRescan) if os.path.exists(fileRebuild): os.remove(fileRebuild) CLI_OPTIONS.rescan = True # Separately, we may want to delete the settings file, which couldn't # be done easily from the GUI, because it frequently gets rewritten to # file before shutdown is complete. The best way is to delete it on start. if os.path.exists(fileDelSettings): os.remove(SETTINGS_PATH) os.remove(fileDelSettings) ################################################################################ def deleteBitcoindDBs(): if not os.path.exists(BTC_HOME_DIR): LOGERROR('Could not find Bitcoin-Qt/bitcoind home dir to remove blk data') LOGERROR(' Does not exist: %s' % BTC_HOME_DIR) else: LOGINFO('Found bitcoin home dir, removing blocks and databases') # Remove directories for btcDir in ['blocks', 'chainstate', 'database']: fullPath = os.path.join(BTC_HOME_DIR, btcDir) if os.path.exists(fullPath): LOGINFO(' Removing dir: %s' % fullPath) shutil.rmtree(fullPath) # Remove files for btcFile in ['DB_CONFIG', 'db.log', 'debug.log', 'peers.dat']: fullPath = os.path.join(BTC_HOME_DIR, btcFile) if os.path.exists(fullPath): LOGINFO(' Removing file: %s' % fullPath) os.remove(fullPath) ##### if CLI_OPTIONS.redownload: deleteBitcoindDBs() if os.path.exists(fileRedownload): os.remove(fileRedownload) ##### if CLI_OPTIONS.rebuild and os.path.exists(LEVELDB_DIR): LOGINFO('Found existing databases dir; removing before rebuild') shutil.rmtree(LEVELDB_DIR) os.mkdir(LEVELDB_DIR) #### if CLI_OPTIONS.testAnnounceCode: LOGERROR('*'*60) LOGERROR('You are currently using a developer mode intended for ') LOGERROR('to help with testing of announcements, which is considered') LOGERROR('a security risk. ') LOGERROR('*'*60) ARMORY_INFO_SIGN_ADDR = '1PpAJyNoocJt38Vcf4AfPffaxo76D4AAEe' ARMORY_INFO_SIGN_PUBLICKEY = ('04' '601c891a2cbc14a7b2bb1ecc9b6e42e166639ea4c2790703f8e2ed126fce432c' '62fe30376497ad3efcd2964aa0be366010c11b8d7fc8209f586eac00bb763015') #### if CLI_OPTIONS.useTorSettings: LOGWARN('Option --tor was supplied, forcing --skip-announce-check,') LOGWARN('--skip-online-check, --skip-stats-report and --disable-torrent') CLI_OPTIONS.skipAnnounceCheck = True CLI_OPTIONS.skipStatsReport = True CLI_OPTIONS.forceOnline = True CLI_OPTIONS.disableTorrent = True ################################################################################ def addWalletToList(inWltPath, inWltList): '''Helper function that checks to see if a path contains a valid wallet. If so, the wallet will be added to the incoming list.''' if os.path.isfile(inWltPath): if not inWltPath.endswith('backup.wallet'): openfile = open(inWltPath, 'rb') first8 = openfile.read(8) openfile.close() if first8=='\xbaWALLET\x00': inWltList.append(inWltPath) else: if not os.path.isdir(inWltPath): LOGWARN('Path %s does not exist.' % inWltPath) else: LOGDEBUG('%s is a directory.' % inWltPath) ################################################################################ def readWalletFiles(inWltList=None): '''Function that finds the paths of all non-backup wallets in the Armory data directory (nothing passed in) or in a list of wallet paths (paths passed in.''' wltPaths = [] if not inWltList: for f in os.listdir(ARMORY_HOME_DIR): fullPath = os.path.join(ARMORY_HOME_DIR, f) addWalletToList(fullPath, wltPaths) else: for w in inWltList: addWalletToList(w, wltPaths) return wltPaths ################################################################################ # Load the C++ utilites here # # The SWIG/C++ block utilities give us access to the blockchain, fast ECDSA # operations, and general encryption/secure-binary containers ################################################################################ try: import CppBlockUtils as Cpp from CppBlockUtils import CryptoECDSA, SecureBinaryData LOGINFO('C++ block utilities loaded successfully') except: LOGCRIT('C++ block utilities not available.') LOGCRIT(' Make sure that you have the SWIG-compiled modules') LOGCRIT(' in the current directory (or added to the PATH)') LOGCRIT(' Specifically, you need:') LOGCRIT(' CppBlockUtils.py and') if OS_LINUX or OS_MACOSX: LOGCRIT(' _CppBlockUtils.so') elif OS_WINDOWS: LOGCRIT(' _CppBlockUtils.pyd') else: LOGCRIT('\n\n... UNKNOWN operating system') raise ################################################################################ # Get system details for logging purposes class DumbStruct(object): pass def GetSystemDetails(): """Checks memory of a given system""" out = DumbStruct() CPU,COR,X64,MEM = range(4) sysParam = [None,None,None,None] out.CpuStr = 'UNKNOWN' out.Machine = platform.machine().lower() if OS_LINUX: # Get total RAM freeStr = subprocess_check_output('free -m', shell=True) totalMemory = freeStr.split('\n')[1].split()[1] out.Memory = int(totalMemory) * 1024 # Get CPU name out.CpuStr = 'Unknown' cpuinfo = subprocess_check_output(['cat','/proc/cpuinfo']) for line in cpuinfo.split('\n'): if line.strip().lower().startswith('model name'): out.CpuStr = line.split(':')[1].strip() break elif OS_WINDOWS: import ctypes class MEMORYSTATUSEX(ctypes.Structure): _fields_ = [ ("dwLength", ctypes.c_ulong), ("dwMemoryLoad", ctypes.c_ulong), ("ullTotalPhys", ctypes.c_ulonglong), ("ullAvailPhys", ctypes.c_ulonglong), ("ullTotalPageFile", ctypes.c_ulonglong), ("ullAvailPageFile", ctypes.c_ulonglong), ("ullTotalVirtual", ctypes.c_ulonglong), ("ullAvailVirtual", ctypes.c_ulonglong), ("sullAvailExtendedVirtual", ctypes.c_ulonglong), ] def __init__(self): # have to initialize this to the size of MEMORYSTATUSEX self.dwLength = ctypes.sizeof(self) super(MEMORYSTATUSEX, self).__init__() stat = MEMORYSTATUSEX() ctypes.windll.kernel32.GlobalMemoryStatusEx(ctypes.byref(stat)) out.Memory = stat.ullTotalPhys/1024. out.CpuStr = platform.processor() elif OS_MACOSX: memsizeStr = subprocess_check_output('sysctl hw.memsize', shell=True) out.Memory = int(memsizeStr.split(": ")[1]) / 1024 out.CpuStr = subprocess_check_output('sysctl -n machdep.cpu.brand_string', shell=True) else: out.CpuStr = 'Unknown' raise OSError("Can't get system specs in: %s" % platform.system()) out.NumCores = multiprocessing.cpu_count() out.IsX64 = platform.machine().lower() == 'x86_64' out.Memory = out.Memory / (1024*1024.) def getHddSize(adir): if OS_WINDOWS: free_bytes = ctypes.c_ulonglong(0) ctypes.windll.kernel32.GetDiskFreeSpaceExW(ctypes.c_wchar_p(adir), \ None, None, \ ctypes.pointer(free_bytes)) return free_bytes.value else: s = os.statvfs(adir) return s.f_bavail * s.f_frsize out.HddAvailA = getHddSize(ARMORY_HOME_DIR) / (1024**3) out.HddAvailB = getHddSize(BTC_HOME_DIR) / (1024**3) return out SystemSpecs = None try: SystemSpecs = GetSystemDetails() except: LOGEXCEPT('Error getting system details:') LOGERROR('Skipping.') SystemSpecs = DumbStruct() SystemSpecs.Memory = -1 SystemSpecs.CpuStr = 'Unknown' SystemSpecs.NumCores = -1 SystemSpecs.IsX64 = 'Unknown' SystemSpecs.Machine = platform.machine().lower() SystemSpecs.HddAvailA = -1 SystemSpecs.HddAvailB = -1 LOGINFO('') LOGINFO('') LOGINFO('') LOGINFO('************************************************************') LOGINFO('Invoked: ' + ' '.join(sys.argv)) LOGINFO('************************************************************') LOGINFO('Loading Armory Engine:') LOGINFO(' Armory Version : ' + getVersionString(BTCARMORY_VERSION)) LOGINFO(' PyBtcWallet Version : ' + getVersionString(PYBTCWALLET_VERSION)) LOGINFO('Detected Operating system: ' + OS_NAME) LOGINFO(' OS Variant : ' + (OS_VARIANT[0] if OS_MACOSX else '-'.join(OS_VARIANT))) LOGINFO(' User home-directory : ' + USER_HOME_DIR) LOGINFO(' Satoshi BTC directory : ' + BTC_HOME_DIR) LOGINFO(' Armory home dir : ' + ARMORY_HOME_DIR) LOGINFO('Detected System Specs : ') LOGINFO(' Total Available RAM : %0.2f GB', SystemSpecs.Memory) LOGINFO(' CPU ID string : ' + SystemSpecs.CpuStr) LOGINFO(' Number of CPU cores : %d cores', SystemSpecs.NumCores) LOGINFO(' System is 64-bit : ' + str(SystemSpecs.IsX64)) LOGINFO(' Preferred Encoding : ' + locale.getpreferredencoding()) LOGINFO(' Machine Arch : ' + SystemSpecs.Machine) LOGINFO(' Available HDD (ARM) : %d GB' % SystemSpecs.HddAvailA) LOGINFO(' Available HDD (BTC) : %d GB' % SystemSpecs.HddAvailB) LOGINFO('') LOGINFO('Network Name: ' + NETWORKS[ADDRBYTE]) LOGINFO('Satoshi Port: %d', BITCOIN_PORT) LOGINFO('Do wlt check: %s', str(DO_WALLET_CHECK)) LOGINFO('Named options/arguments to armoryengine.py:') for key,val in ast.literal_eval(str(CLI_OPTIONS)).iteritems(): LOGINFO(' %-16s: %s', key,val) LOGINFO('Other arguments:') for val in CLI_ARGS: LOGINFO(' %s', val) LOGINFO('************************************************************') def GetExecDir(): """ Return the path from where armoryengine was imported. Inspect method expects a function or module name, it can actually inspect its own name... """ srcfile = inspect.getsourcefile(GetExecDir) srcpath = os.path.dirname(srcfile) srcpath = os.path.abspath(srcpath) if OS_WINDOWS and srcpath.endswith('.zip'): srcpath = os.path.dirname(srcpath) # Right now we are at the armoryengine dir... walk up one more srcpath = os.path.dirname(srcpath) LOGINFO('Determined that execution dir is: %s' % srcpath) if not os.path.exists(srcpath): LOGERROR('Exec dir %s does not exist!' % srcpath) LOGERROR('Continuing anyway...' % srcpath) return srcpath def coin2str(nSatoshi, ndec=8, rJust=True, maxZeros=8): """ Converts a raw value (1e-8 BTC) into a formatted string for display ndec, guarantees that we get get a least N decimal places in our result maxZeros means we will replace zeros with spaces up to M decimal places in order to declutter the amount field """ nBtc = float(nSatoshi) / float(ONE_BTC) s = ('%%0.%df' % ndec) % nBtc s = s.rjust(18, ' ') if maxZeros < ndec: maxChop = ndec - maxZeros nChop = min(len(s) - len(str(s.strip('0'))), maxChop) if nChop>0: s = s[:-nChop] + nChop*' ' if nSatoshi < 10000*ONE_BTC: s.lstrip() if not rJust: s = s.strip(' ') s = s.replace('. ', '') return s def coin2strNZ(nSatoshi): """ Right-justified, minimum zeros, but with padding for alignment""" return coin2str(nSatoshi, 8, True, 0) def coin2strNZS(nSatoshi): """ Right-justified, minimum zeros, stripped """ return coin2str(nSatoshi, 8, True, 0).strip() def coin2str_approx(nSatoshi, sigfig=3): posVal = nSatoshi isNeg = False if nSatoshi<0: isNeg = True posVal *= -1 nDig = max(round(math.log(posVal+1, 10)-0.5), 0) nChop = max(nDig-2, 0 ) approxVal = round((10**nChop) * round(posVal / (10**nChop))) return coin2str( (-1 if isNeg else 1)*approxVal, maxZeros=0) def str2coin(theStr, negAllowed=True, maxDec=8, roundHighPrec=True): coinStr = str(theStr) if len(coinStr.strip())==0: raise ValueError isNeg = ('-' in coinStr) coinStrPos = coinStr.replace('-','') if not '.' in coinStrPos: if not negAllowed and isNeg: raise NegativeValueError return (int(coinStrPos)*ONE_BTC)*(-1 if isNeg else 1) else: lhs,rhs = coinStrPos.strip().split('.') if len(lhs.strip('-'))==0: lhs='0' if len(rhs)>maxDec and not roundHighPrec: raise TooMuchPrecisionError if not negAllowed and isNeg: raise NegativeValueError fullInt = (int(lhs + rhs[:9].ljust(9,'0')) + 5) / 10 return fullInt*(-1 if isNeg else 1) ################################################################################ def makeAsciiBlock(binStr, headStr='', wid=64, newline='\n'): # Convert the raw chunk of binary data b64Data = base64.b64encode(binStr) sz = len(b64Data) firstLine = '=====%s' % headStr lines = [firstLine.ljust(wid, '=')] lines.extend([b64Data[wid*i:wid*(i+1)] for i in range((sz-1)/wid+1)]) lines.append("="*wid) return newline.join(lines) ################################################################################ def readAsciiBlock(ablock, headStr=''): headStr = '' rawData = None # Contiue only if we actually get data. if len(ablock) > 0: lines = ablock.strip().split() if not lines[0].startswith('=====%s' % headStr) or \ not lines[-1].startswith('======'): LOGERROR('Attempting to unserialize something not an ASCII block') return lines[0].strip('='), None headStr = lines[0].strip('=') rawData = base64.b64decode(''.join(lines[1:-1])) return (headStr, rawData) ################################################################################ def replacePlurals(txt, *args): """ Use this like regular string formatting, but with pairs of strings: replacePlurals("I have @{one cat|%d cats}@. @{It is|They are}@ cute!", nCat) Then you can supply a single number which will select all supplied pairs. or one number per @{|}@ object. If you use with format strings (such as above, with "%d") make sure to replace those strings FIRST, then call this function. Otherwise the %d will disappear depending on the plurality and cause an error. Hence why I made the function below: formatWithPlurals """ if len(args)==0: if ('@{' in txt) and ('}@' in txt): raise IndexError('Not enough arguments for plural formatting') return txt argList = list(args[::-1]) n = argList[0] nRepl = 0 while '@{' in txt: idx0 = txt.find('@{') idx1 = txt.find('}@')+2 sep = txt.find('|', idx0) if idx1==1 or sep==-1: raise TypeError('Invalid replacement format') strOne = txt[idx0+2:sep] strMany = txt[sep+1:idx1-2] strReplace = txt[idx0:idx1] if not len(args) == 1: try: n = argList.pop() except IndexError: raise IndexError('Not enough arguments for plural formatting') txt = txt.replace(strReplace, strOne if n==1 else strMany) nRepl += 1 if (len(args)>1 and len(argList)>0) or (nRepl < len(args)): raise TypeError('Too many arguments supplied for plural formatting') return txt ################################################################################ def formatWithPlurals(txt, replList=None, pluralList=None): """ Where you would normally supply X extra arguments for either regular string formatting or the plural function, you will instead supply a X-element list for each one (actually, the two lists are likely to be different sizes). """ # Do the string formatting/replacement first, since the post-pluralized # string may remove some of the replacement objects (i.e. if you have # "The @{cat|%d cats}@ danced", the %d won't be there if the singular # is chosen and replaced before applying the string formatting objects). if replList is not None: if not isinstance(replList, (list,tuple)): replList = [replList] txt = txt % tuple(replList) if pluralList is not None: if not isinstance(pluralList, (list,tuple)): pluralList = [pluralList] txt = replacePlurals(txt, *pluralList) return txt ################################################################################ # A bunch of convenience methods for converting between: # -- Raw binary scripts (as seen in the blockchain) # -- Address strings (exchanged between people for paying each other) # -- ScrAddr strings (A unique identifier used by the DB) ################################################################################ ################################################################################ # Convert a 20-byte hash to a "pay-to-public-key-hash" script to be inserted # into a TxOut script def hash160_to_p2pkhash_script(binStr20): if not len(binStr20)==20: raise InvalidHashError('Tried to convert non-20-byte str to p2pkh script') from Transaction import getOpCode from Script import scriptPushData outScript = ''.join([ getOpCode('OP_DUP' ), \ getOpCode('OP_HASH160' ), \ scriptPushData(binStr20), getOpCode('OP_EQUALVERIFY'), \ getOpCode('OP_CHECKSIG' )]) return outScript ################################################################################ # Convert a 20-byte hash to a "pay-to-script-hash" script to be inserted # into a TxOut script def hash160_to_p2sh_script(binStr20): if not len(binStr20)==20: raise InvalidHashError('Tried to convert non-20-byte str to p2sh script') from Transaction import getOpCode from Script import scriptPushData outScript = ''.join([ getOpCode('OP_HASH160'), scriptPushData(binStr20), getOpCode('OP_EQUAL')]) return outScript ################################################################################ # Convert an arbitrary script into a P2SH script def script_to_p2sh_script(binScript): scriptHash = hash160(binScript) return hash160_to_p2sh_script(scriptHash) ################################################################################ # Convert a 33-byte or 65-byte hash to a "pay-to-pubkey" script to be inserted # into a TxOut script def pubkey_to_p2pk_script(binStr33or65): if not len(binStr33or65) in [33, 65]: raise KeyDataError('Invalid public key supplied to p2pk script') from Transaction import getOpCode from Script import scriptPushData serPubKey = scriptPushData(binStr33or65) outScript = serPubKey + getOpCode('OP_CHECKSIG') return outScript ################################################################################ # Convert a list of public keys to an OP_CHECKMULTISIG script. There will be # use cases where we require the keys to be sorted lexicographically, so we # will do that by default. If you require a different order, pre-sort them # and pass withSort=False. # # NOTE: About the hardcoded bytes in here: the mainnet addrByte and P2SH # bytes are hardcoded into DB format. This means that # that any ScrAddr object will use the mainnet prefix bytes, regardless # of whether it is in testnet. def pubkeylist_to_multisig_script(pkList, M, withSort=True): if sum([ (0 if len(pk) in [33,65] else 1) for pk in pkList]) > 0: raise KeyDataError('Not all strings in pkList are 33 or 65 bytes!') from Transaction import getOpCode opM = getOpCode('OP_%d' % M) opN = getOpCode('OP_%d' % len(pkList)) newPkList = pkList[:] # copy if withSort: newPkList = sorted(pkList) outScript = opM for pk in newPkList: outScript += int_to_binary(len(pk), widthBytes=1) outScript += pk outScript += opN outScript += getOpCode('OP_CHECKMULTISIG') return outScript ################################################################################ def scrAddr_to_script(scraddr): """ Convert a scrAddr string (used by BDM) to the correct TxOut script Note this only works for P2PKH and P2SH scraddrs. Multi-sig and all non-standard scripts cannot be derived from scrAddrs. In a way, a scrAddr is intended to be an intelligent "hash" of the script, and it's a perk that most of the time we can reverse it to get the script. """ if len(scraddr)==0: raise BadAddressError('Empty scraddr') prefix = scraddr[0] if not prefix in SCRADDR_BYTE_LIST or not len(scraddr)==21: LOGERROR('Bad scraddr: "%s"' % binary_to_hex(scraddr)) raise BadAddressError('Invalid ScrAddress') if prefix==SCRADDR_P2PKH_BYTE: return hash160_to_p2pkhash_script(scraddr[1:]) elif prefix==SCRADDR_P2SH_BYTE: return hash160_to_p2sh_script(scraddr[1:]) else: LOGERROR('Unsupported scraddr type: "%s"' % binary_to_hex(scraddr)) raise BadAddressError('Can only convert P2PKH and P2SH scripts') ################################################################################ def script_to_scrAddr(binScript): """ Convert a binary script to scrAddr string (used by BDM) """ return Cpp.BtcUtils().getScrAddrForScript(binScript) ################################################################################ def script_to_addrStr(binScript): """ Convert a binary script to scrAddr string (used by BDM) """ return scrAddr_to_addrStr(script_to_scrAddr(binScript)) ################################################################################ def scrAddr_to_addrStr(scrAddr): if len(scrAddr)==0: raise BadAddressError('Empty scrAddr') prefix = scrAddr[0] if not prefix in SCRADDR_BYTE_LIST or not len(scrAddr)==21: raise BadAddressError('Invalid ScrAddress') if prefix==SCRADDR_P2PKH_BYTE: return hash160_to_addrStr(scrAddr[1:]) elif prefix==SCRADDR_P2SH_BYTE: return hash160_to_p2shAddrStr(scrAddr[1:]) else: LOGERROR('Unsupported scrAddr type: "%s"' % binary_to_hex(scrAddr)) raise BadAddressError('Can only convert P2PKH and P2SH scripts') ################################################################################ # We beat around the bush here, to make sure it goes through addrStr which # triggers errors if this isn't a regular addr or P2SH addr def scrAddr_to_hash160(scrAddr): addr = scrAddr_to_addrStr(scrAddr) atype, a160 = addrStr_to_hash160(addr) return (atype, a160) ################################################################################ def addrStr_to_scrAddr(addrStr): if not checkAddrStrValid(addrStr): BadAddressError('Invalid address: "%s"' % addrStr) atype, a160 = addrStr_to_hash160(addrStr) if atype==ADDRBYTE: return SCRADDR_P2PKH_BYTE + a160 elif atype==P2SHBYTE: return SCRADDR_P2SH_BYTE + a160 else: BadAddressError('Invalid address: "%s"' % addrStr) ################################################################################ def addrStr_to_script(addrStr): """ Convert an addr string to a binary script """ return scrAddr_to_script(addrStr_to_scrAddr(addrStr)) ################################################################################ # Load the C++ utilites here # # The SWIG/C++ block utilities give us access to the blockchain, fast ECDSA # operations, and general encryption/secure-binary containers ################################################################################ try: import CppBlockUtils as Cpp from CppBlockUtils import CryptoECDSA, SecureBinaryData LOGINFO('C++ block utilities loaded successfully') except: LOGCRIT('C++ block utilities not available.') LOGCRIT(' Make sure that you have the SWIG-compiled modules') LOGCRIT(' in the current directory (or added to the PATH)') LOGCRIT(' Specifically, you need:') LOGCRIT(' CppBlockUtils.py and') if OS_LINUX or OS_MACOSX: LOGCRIT(' _CppBlockUtils.so') elif OS_WINDOWS: LOGCRIT(' _CppBlockUtils.pyd') else: LOGCRIT('\n\n... UNKNOWN operating system') raise ################################################################################ # We need to have some methods for casting ASCII<->Unicode<->Preferred DEFAULT_ENCODING = 'utf-8' def isASCII(theStr): try: theStr.decode('ascii') return True except UnicodeEncodeError: return False except UnicodeDecodeError: return False except: LOGEXCEPT('What was passed to this function? %s', theStr) return False def toBytes(theStr, theEncoding=DEFAULT_ENCODING): if isinstance(theStr, unicode): return theStr.encode(theEncoding) elif isinstance(theStr, str): return theStr else: LOGERROR('toBytes() not been defined for input: %s', str(type(theStr))) def toUnicode(theStr, theEncoding=DEFAULT_ENCODING): if isinstance(theStr, unicode): return theStr elif isinstance(theStr, str): return unicode(theStr, theEncoding) else: try: return unicode(theStr) except: LOGEXCEPT('toUnicode() not defined for %s', str(type(theStr))) def toPreferred(theStr): if OS_WINDOWS: return theStr.encode('utf-8') else: return toUnicode(theStr).encode(locale.getpreferredencoding()) def lenBytes(theStr, theEncoding=DEFAULT_ENCODING): return len(toBytes(theStr, theEncoding)) # Stolen from stackoverflow (google "stackoverflow 1809531") def unicode_truncate(theStr, length, encoding='utf-8'): encoded = theStr.encode(encoding)[:length] return encoded.decode(encoding, 'ignore') ############################################################################# def satoshiIsAvailable(host='127.0.0.1', port=BITCOIN_PORT, timeout=0.01): if not isinstance(port, (list,tuple)): port = [port] for p in port: s = socket.socket() s.settimeout(timeout) # Most of the time checking localhost -- FAST try: s.connect((host, p)) s.close() return p except: pass return 0 # This is a sweet trick for create enum-like dictionaries. # Either automatically numbers (*args), or name-val pairs (**kwargs) #http://stackoverflow.com/questions/36932/whats-the-best-way-to-implement-an-enum-in-python def enum(*sequential, **named): enums = dict(zip(sequential, range(len(sequential))), **named) return type('Enum', (), enums) DATATYPE = enum("Binary", 'Base58', 'Hex') def isLikelyDataType(theStr, dtype=None): """ This really shouldn't be used on short strings. Hence why it's called "likely" datatype... """ ret = None hexCount = sum([1 if c in BASE16CHARS else 0 for c in theStr]) b58Count = sum([1 if c in BASE58CHARS else 0 for c in theStr]) canBeHex = hexCount==len(theStr) canBeB58 = b58Count==len(theStr) if canBeHex: ret = DATATYPE.Hex elif canBeB58 and not canBeHex: ret = DATATYPE.Base58 else: ret = DATATYPE.Binary if dtype==None: return ret else: return dtype==ret cpplogfile = None if CLI_OPTIONS.logDisable: print 'Logging is disabled' rootLogger.disabled = True # The database uses prefixes to identify type of address. Until the new # wallet format is created that supports more than just hash160 addresses # we have to explicitly add the prefix to any hash160 values that are being # sent to any of the C++ utilities. For instance, the BlockDataManager (BDM) # (C++ stuff) tracks regular hash160 addresses, P2SH, multisig, and all # non-standard scripts. Any such "scrAddrs" (script-addresses) will eventually # be valid entities for tracking in a wallet. Until then, all of our python # utilities all use just hash160 values, and we manually add the prefix # before talking to the BDM. HASH160PREFIX = '\x00' P2SHPREFIX = '\x05' MSIGPREFIX = '\xfe' NONSTDPREFIX = '\xff' def CheckHash160(scrAddr): if not len(scrAddr)==21: raise BadAddressError("Supplied scrAddr is not a Hash160 value!") if not scrAddr[0] in [HASH160PREFIX, P2SHPREFIX]: raise BadAddressError("Supplied scrAddr is not a Hash160 value!") return scrAddr[1:] def Hash160ToScrAddr(a160): if not len(a160)==20: LOGERROR('Invalid hash160 value!') return HASH160PREFIX + a160 def HexHash160ToScrAddr(a160): if not len(a160)==40: LOGERROR('Invalid hash160 value!') return HASH160PREFIX + hex_to_binary(a160) # Some more constants that are needed to play nice with the C++ utilities ARMORY_DB_BARE = 0 ARMORY_DB_LITE = 1 ARMORY_DB_PARTIAL = 2 ARMORY_DB_FULL = 3 ARMORY_DB_SUPER = 4 DB_PRUNE_ALL = 0 DB_PRUNE_NONE = 1 # Some time methods (RightNow() return local unix timestamp) RightNow = time.time def RightNowUTC(): return time.mktime(time.gmtime(RightNow())) def RightNowStr(fmt=DEFAULT_DATE_FORMAT): return unixTimeToFormatStr(RightNow(), fmt) # Define all the hashing functions we're going to need. We don't actually # use any of the first three directly (sha1, sha256, ripemd160), we only # use hash256 and hash160 which use the first three to create the ONLY hash # operations we ever do in the bitcoin network # UPDATE: mini-private-key format requires vanilla sha256... def sha1(bits): return hashlib.new('sha1', bits).digest() def sha256(bits): return hashlib.new('sha256', bits).digest() def sha512(bits): return hashlib.new('sha512', bits).digest() def ripemd160(bits): # It turns out that not all python has ripemd160...? #return hashlib.new('ripemd160', bits).digest() return Cpp.BtcUtils().ripemd160_SWIG(bits) def hash256(s): """ Double-SHA256 """ return sha256(sha256(s)) def hash160(s): """ RIPEMD160( SHA256( binaryStr ) ) """ return Cpp.BtcUtils().getHash160_SWIG(s) def HMAC(key, msg, hashfunc=sha512, hashsz=None): """ This is intended to be simple, not fast. For speed, use HDWalletCrypto() """ hashsz = len(hashfunc('')) if hashsz==None else hashsz key = (hashfunc(key) if len(key)>hashsz else key) key = key.ljust(hashsz, '\x00') okey = ''.join([chr(ord('\x5c')^ord(c)) for c in key]) ikey = ''.join([chr(ord('\x36')^ord(c)) for c in key]) return hashfunc( okey + hashfunc(ikey + msg) ) HMAC256 = lambda key,msg: HMAC(key, msg, sha256, 32) HMAC512 = lambda key,msg: HMAC(key, msg, sha512, 64) ################################################################################ def prettyHex(theStr, indent='', withAddr=True, major=8, minor=8): """ This is the same as pprintHex(), but returns the string instead of printing it to console. This is useful for redirecting output to files, or doing further modifications to the data before display """ outStr = '' sz = len(theStr) nchunk = int((sz-1)/minor) + 1; for i in range(nchunk): if i%major==0: outStr += '\n' + indent if withAddr: locStr = int_to_hex(i*minor/2, widthBytes=2, endOut=BIGENDIAN) outStr += '0x' + locStr + ': ' outStr += theStr[i*minor:(i+1)*minor] + ' ' return outStr ################################################################################ def pprintHex(theStr, indent='', withAddr=True, major=8, minor=8): """ This method takes in a long hex string and prints it out into rows of 64 hex chars, in chunks of 8 hex characters, and with address markings on each row. This means that each row displays 32 bytes, which is usually pleasant. The format is customizable: you can adjust the indenting of the entire block, remove address markings, or change the major/minor grouping size (major * minor = hexCharsPerRow) """ print prettyHex(theStr, indent, withAddr, major, minor) def pprintDiff(str1, str2, indent=''): if not len(str1)==len(str2): print 'pprintDiff: Strings are different length!' return byteDiff = [] for i in range(len(str1)): if str1[i]==str2[i]: byteDiff.append('-') else: byteDiff.append('X') pprintHex(''.join(byteDiff), indent=indent) ##### Switch endian-ness ##### def hex_switchEndian(s): """ Switches the endianness of a hex string (in pairs of hex chars) """ pairList = [s[i]+s[i+1] for i in xrange(0,len(s),2)] return ''.join(pairList[::-1]) def binary_switchEndian(s): """ Switches the endianness of a binary string """ return s[::-1] ##### INT/HEXSTR ##### def int_to_hex(i, widthBytes=0, endOut=LITTLEENDIAN): """ Convert an integer (int() or long()) to hexadecimal. Default behavior is to use the smallest even number of hex characters necessary, and using little-endian. Use the widthBytes argument to add 0-padding where needed if you are expecting constant-length output. """ h = hex(i)[2:] if isinstance(i,long): h = h[:-1] if len(h)%2 == 1: h = '0'+h if not widthBytes==0: nZero = 2*widthBytes - len(h) if nZero > 0: h = '0'*nZero + h if endOut==LITTLEENDIAN: h = hex_switchEndian(h) return h def hex_to_int(h, endIn=LITTLEENDIAN): """ Convert hex-string to integer (or long). Default behavior is to interpret hex string as little-endian """ hstr = h.replace(' ','') # copies data, no references if endIn==LITTLEENDIAN: hstr = hex_switchEndian(hstr) return( int(hstr, 16) ) ##### HEXSTR/BINARYSTR ##### def hex_to_binary(h, endIn=LITTLEENDIAN, endOut=LITTLEENDIAN): """ Converts hexadecimal to binary (in a python string). Endianness is only switched if (endIn != endOut) """ bout = h.replace(' ','') # copies data, no references if not endIn==endOut: bout = hex_switchEndian(bout) return bout.decode('hex_codec') def binary_to_hex(b, endOut=LITTLEENDIAN, endIn=LITTLEENDIAN): """ Converts binary to hexadecimal. Endianness is only switched if (endIn != endOut) """ hout = b.encode('hex_codec') if not endOut==endIn: hout = hex_switchEndian(hout) return hout ##### Shorthand combo of prettyHex and binary_to_hex intended for use in debugging def ph(binaryInput): return prettyHex(binary_to_hex(binaryInput)) ##### INT/BINARYSTR ##### def int_to_binary(i, widthBytes=0, endOut=LITTLEENDIAN): """ Convert integer to binary. Default behavior is use as few bytes as necessary, and to use little-endian. This can be changed with the two optional input arguemnts. """ h = int_to_hex(i,widthBytes) return hex_to_binary(h, endOut=endOut) def binary_to_int(b, endIn=LITTLEENDIAN): """ Converts binary to integer (or long). Interpret as LE by default """ h = binary_to_hex(b, endIn, LITTLEENDIAN) return hex_to_int(h) ##### INT/BITS ##### def int_to_bitset(i, widthBytes=0): bitsOut = [] while i>0: i,r = divmod(i,2) bitsOut.append(['0','1'][r]) result = ''.join(bitsOut) if widthBytes != 0: result = result.ljust(widthBytes*8,'0') return result def bitset_to_int(bitset): n = 0 for i,bit in enumerate(bitset): n += (0 if bit=='0' else 1) * 2**i return n EmptyHash = hex_to_binary('00'*32) ################################################################################ # BINARY/BASE58 CONVERSIONS def binary_to_base58(binstr): """ This method applies the Bitcoin-specific conversion from binary to Base58 which may includes some extra "zero" bytes, such as is the case with the main-network addresses. This method is labeled as outputting an "addrStr", but it's really this special kind of Base58 converter, which makes it usable for encoding other data, such as ECDSA keys or scripts. """ padding = 0; for b in binstr: if b=='\x00': padding+=1 else: break n = 0 for ch in binstr: n *= 256 n += ord(ch) b58 = '' while n > 0: n, r = divmod (n, 58) b58 = BASE58CHARS[r] + b58 return '1'*padding + b58 ################################################################################ def base58_to_binary(addr): """ This method applies the Bitcoin-specific conversion from Base58 to binary which may includes some extra "zero" bytes, such as is the case with the main-network addresses. This method is labeled as inputting an "addrStr", but it's really this special kind of Base58 converter, which makes it usable for encoding other data, such as ECDSA keys or scripts. """ # Count the zeros ('1' characters) at the beginning padding = 0; for c in addr: if c=='1': padding+=1 else: break n = 0 for ch in addr: n *= 58 n += BASE58CHARS.index(ch) binOut = '' while n>0: d,m = divmod(n,256) binOut = chr(m) + binOut n = d return '\x00'*padding + binOut ################################################################################ def hash160_to_addrStr(binStr, netbyte=ADDRBYTE): """ Converts the 20-byte pubKeyHash to 25-byte binary Bitcoin address which includes the network byte (prefix) and 4-byte checksum (suffix) """ if not len(binStr) == 20: raise InvalidHashError('Input string is %d bytes' % len(binStr)) addr21 = netbyte + binStr addr25 = addr21 + hash256(addr21)[:4] return binary_to_base58(addr25); ################################################################################ def hash160_to_p2shAddrStr(binStr): if not len(binStr) == 20: raise InvalidHashError('Input string is %d bytes' % len(binStr)) addr21 = P2SHBYTE + binStr addr25 = addr21 + hash256(addr21)[:4] return binary_to_base58(addr25); ################################################################################ def binScript_to_p2shAddrStr(binScript): return hash160_to_p2shAddrStr(hash160(binScript)) ################################################################################ def addrStr_is_p2sh(b58Str): if len(b58Str)==0: return False if sum([(0 if c in BASE58CHARS else 1) for c in b58Str]) > 0: return False binStr = base58_to_binary(b58Str) if not len(binStr)==25: return False if not hash256(binStr[:21])[:4] == binStr[-4:]: return False return (binStr[0] == P2SHBYTE) ################################################################################ # As of version 0.90.1, this returns the prefix byte with the hash160. This is # because we need to handle/distinguish regular addresses from P2SH. All code # using this method must be updated to expect 2 outputs and check the prefix. def addrStr_to_hash160(b58Str, p2shAllowed=True): binStr = base58_to_binary(b58Str) if not p2shAllowed and binStr[0]==P2SHBYTE: raise P2SHNotSupportedError if not len(binStr) == 25: raise BadAddressError('Address string is %d bytes' % len(binStr)) if not hash256(binStr[:21])[:4] == binStr[-4:]: raise ChecksumError('Address string has invalid checksum') if not binStr[0] in (ADDRBYTE, P2SHBYTE): raise BadAddressError('Unknown addr prefix: %s' % binary_to_hex(binStr[0])) return (binStr[0], binStr[1:-4]) ###### Typing-friendly Base16 ##### # Implements "hexadecimal" encoding but using only easy-to-type # characters in the alphabet. Hex usually includes the digits 0-9 # which can be slow to type, even for good typists. On the other # hand, by changing the alphabet to common, easily distinguishable, # lowercase characters, typing such strings will become dramatically # faster. Additionally, some default encodings of QRCodes do not # preserve the capitalization of the letters, meaning that Base58 # is not a feasible options NORMALCHARS = '0123 4567 89ab cdef'.replace(' ','') EASY16CHARS = 'asdf ghjk wert uion'.replace(' ','') hex_to_base16_map = {} base16_to_hex_map = {} for n,b in zip(NORMALCHARS,EASY16CHARS): hex_to_base16_map[n] = b base16_to_hex_map[b] = n def binary_to_easyType16(binstr): return ''.join([hex_to_base16_map[c] for c in binary_to_hex(binstr)]) # Treat unrecognized characters as 0, to facilitate possibly later recovery of # their correct values from the checksum. def easyType16_to_binary(b16str): return hex_to_binary(''.join([base16_to_hex_map.get(c, '0') for c in b16str])) def makeSixteenBytesEasy(b16): if not len(b16)==16: raise ValueError('Must supply 16-byte input') chk2 = computeChecksum(b16, nBytes=2) et18 = binary_to_easyType16(b16 + chk2) nineQuads = [et18[i*4:(i+1)*4] for i in range(9)] first4 = ' '.join(nineQuads[:4]) second4 = ' '.join(nineQuads[4:8]) last1 = nineQuads[8] return ' '.join([first4, second4, last1]) def readSixteenEasyBytes(et18): b18 = easyType16_to_binary(et18.strip().replace(' ','')) if len(b18)!=18: raise ValueError('Must supply 18-byte input') b16 = b18[:16] chk = b18[ 16:] if chk=='': LOGWARN('Missing checksum when reading EasyType') return (b16, 'No_Checksum') b16new = verifyChecksum(b16, chk) if len(b16new)==0: return ('','Error_2+') elif not b16new==b16: return (b16new,'Fixed_1') else: return (b16new,None) ##### FLOAT/BTC ##### # https://en.bitcoin.it/wiki/Proper_Money_Handling_(JSON-RPC) def ubtc_to_floatStr(n): return '%d.%08d' % divmod (n, ONE_BTC) def floatStr_to_ubtc(s): return long(round(float(s) * ONE_BTC)) def float_to_btc (f): return long (round(f * ONE_BTC)) # From https://en.bitcoin.it/wiki/Proper_Money_Handling_(JSON-RPC) def JSONtoAmount(value): return long(round(float(value) * 1e8)) def AmountToJSON(amount): return float(amount / 1e8) ##### And a few useful utilities ##### # Take an incoming list and return a "zipped" list where every two items in the # list are paired and can be iterated over together. # http://stackoverflow.com/questions/5389507/iterating-over-every-two-elements-in-a-list def getDualIterable(inList): a = iter(inList) return izip(a, a) def unixTimeToFormatStr(unixTime, formatStr=DEFAULT_DATE_FORMAT): """ Converts a unix time (like those found in block headers) to a pleasant, human-readable format """ dtobj = datetime.fromtimestamp(unixTime) dtstr = u'' + dtobj.strftime(formatStr).decode('utf-8') dtstr = dtstr.encode('ascii', errors='replace') return dtstr[:-2] + dtstr[-2:].lower() def secondsToHumanTime(nSec): strPieces = [] floatSec = float(nSec) if floatSec < 0.9*MINUTE: strPieces = [floatSec, 'second'] elif floatSec < 0.9*HOUR: strPieces = [floatSec/MINUTE, 'minute'] elif floatSec < 0.9*DAY: strPieces = [floatSec/HOUR, 'hour'] elif floatSec < 0.9*WEEK: strPieces = [floatSec/DAY, 'day'] elif floatSec < 0.9*MONTH: strPieces = [floatSec/WEEK, 'week'] elif floatSec < 0.9*YEAR: strPieces = [floatSec/MONTH, 'month'] else: strPieces = [floatSec/YEAR, 'year'] # if strPieces[0]<1.25: return '1 '+strPieces[1] elif strPieces[0]<=1.75: return '1.5 '+strPieces[1]+'s' else: return '%d %ss' % (int(strPieces[0]+0.5), strPieces[1]) def bytesToHumanSize(nBytes): if nBytes0: if not beQuiet: LOGWARN('fixed!') return fixStr else: # ONE LAST CHECK SPECIFIC TO MY SERIALIZATION SCHEME: # If the string was originally all zeros, chksum is hash256('') # ...which is a known value, and frequently used in my files if chksum==hex_to_binary('5df6e0e2'): if not beQuiet: LOGWARN('fixed!') return '' # ID a checksum byte error... origHash = hashFunc(bin1) for i in range(len(chksum)): chkArray = [chksum[j] for j in range(len(chksum))] for ch in range(256): chkArray[i] = chr(ch) if origHash.startswith(''.join(chkArray)): LOGWARN('***Checksum error! Incorrect byte in checksum!') return bin1 LOGWARN('Checksum fix failed') return '' # Taken directly from rpc.cpp in reference bitcoin client, 0.3.24 def binaryBits_to_difficulty(b): """ Converts the 4-byte binary difficulty string to a float """ i = binary_to_int(b) nShift = (i >> 24) & 0xff dDiff = float(0x0000ffff) / float(i & 0x00ffffff) while nShift < 29: dDiff *= 256.0 nShift += 1 while nShift > 29: dDiff /= 256.0 nShift -= 1 return dDiff # TODO: I don't actually know how to do this, yet... def difficulty_to_binaryBits(i): pass ################################################################################ def CreateQRMatrix(dataToEncode, errLevel=QRErrorCorrectLevel.L): dataLen = len(dataToEncode) baseSz = 4 if errLevel == QRErrorCorrectLevel.L else \ 5 if errLevel == QRErrorCorrectLevel.M else \ 6 if errLevel == QRErrorCorrectLevel.Q else \ 7 # errLevel = QRErrorCorrectLevel.H sz = baseSz if dataLen < 70 else 5 + (dataLen - 70) / 30 qrmtrx = [[]] while sz<20: try: errCorrectEnum = getattr(QRErrorCorrectLevel, errLevel.upper()) qr = QRCode(sz, errCorrectEnum) qr.addData(dataToEncode) qr.make() success=True break except TypeError: sz += 1 if not success: LOGERROR('Unsuccessful attempt to create QR code') LOGERROR('Data to encode: (Length: %s, isAscii: %s)', \ len(dataToEncode), isASCII(dataToEncode)) return [[0]], 1 qrmtrx = [] modCt = qr.getModuleCount() for r in range(modCt): tempList = [0]*modCt for c in range(modCt): # The matrix is transposed by default, from what we normally expect tempList[c] = 1 if qr.isDark(c,r) else 0 qrmtrx.append(tempList) return [qrmtrx, modCt] # The following params are for the Bitcoin elliptic curves (secp256k1) SECP256K1_MOD = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2FL SECP256K1_ORDER = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141L SECP256K1_B = 0x0000000000000000000000000000000000000000000000000000000000000007L SECP256K1_A = 0x0000000000000000000000000000000000000000000000000000000000000000L SECP256K1_GX = 0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798L SECP256K1_GY = 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8L ################################################################################ ################################################################################ # START FINITE FIELD OPERATIONS class FiniteField(object): """ Create a simple, prime-order FiniteField. Because this is used only to encode data of fixed width, I enforce prime-order by hardcoding primes, and you just pick the data width (in bytes). If your desired data width is not here, simply find a prime number very close to 2^N, and add it to the PRIMES map below. This will be used for Shamir's Secret Sharing scheme. Encode your data as the coeffient of finite-field polynomial, and store points on that polynomial. The order of the polynomial determines how many points are needed to recover the original secret. """ # bytes: primeclosetomaxval PRIMES = { 1: 2**8-5, # mainly for testing 2: 2**16-39, 4: 2**32-5, 8: 2**64-59, 16: 2**128-797, 20: 2**160-543, 24: 2**192-333, 32: 2**256-357, 48: 2**384-317, 64: 2**512-569, 96: 2**768-825, 128: 2**1024-105, 192: 2**1536-3453, 256: 2**2048-1157 } def __init__(self, nbytes): if not self.PRIMES.has_key(nbytes): LOGERROR('No primes available for size=%d bytes', nbytes) self.prime = None raise FiniteFieldError self.prime = self.PRIMES[nbytes] def add(self,a,b): return (a+b) % self.prime def subtract(self,a,b): return (a-b) % self.prime def mult(self,a,b): return (a*b) % self.prime def power(self,a,b): result = 1 while(b>0): b,x = divmod(b,2) result = (result * (a if x else 1)) % self.prime a = a*a % self.prime return result def powinv(self,a): """ USE ONLY PRIME MODULUS """ return self.power(a,self.prime-2) def divide(self,a,b): """ USE ONLY PRIME MODULUS """ baddinv = self.powinv(b) return self.mult(a,baddinv) def mtrxrmrowcol(self,mtrx,r,c): if not len(mtrx) == len(mtrx[0]): LOGERROR('Must be a square matrix!') return [] sz = len(mtrx) return [[mtrx[i][j] for j in range(sz) if not j==c] for i in range(sz) if not i==r] ################################################################################ def mtrxdet(self,mtrx): if len(mtrx)==1: return mtrx[0][0] if not len(mtrx) == len(mtrx[0]): LOGERROR('Must be a square matrix!') return -1 result = 0; for i in range(len(mtrx)): mult = mtrx[0][i] * (-1 if i%2==1 else 1) subdet = self.mtrxdet(self.mtrxrmrowcol(mtrx,0,i)) result = self.add(result, self.mult(mult,subdet)) return result ################################################################################ def mtrxmultvect(self,mtrx, vect): M,N = len(mtrx), len(mtrx[0]) if not len(mtrx[0])==len(vect): LOGERROR('Mtrx and vect are incompatible: %dx%d, %dx1', M, N, len(vect)) return [ sum([self.mult(mtrx[i][j],vect[j]) for j in range(N)])%self.prime for i in range(M) ] ################################################################################ def mtrxmult(self,m1, m2): M1,N1 = len(m1), len(m1[0]) M2,N2 = len(m2), len(m2[0]) if not N1==M2: LOGERROR('Mtrx and vect are incompatible: %dx%d, %dx%d', M1,N1, M2,N2) inner = lambda i,j: sum([self.mult(m1[i][k],m2[k][j]) for k in range(N1)]) return [ [inner(i,j)%self.prime for j in range(N1)] for i in range(M1) ] ################################################################################ def mtrxadjoint(self,mtrx): sz = len(mtrx) inner = lambda i,j: self.mtrxdet(self.mtrxrmrowcol(mtrx,i,j)) return [[((-1 if (i+j)%2==1 else 1)*inner(j,i))%self.prime for j in range(sz)] for i in range(sz)] ################################################################################ def mtrxinv(self,mtrx): det = self.mtrxdet(mtrx) adj = self.mtrxadjoint(mtrx) sz = len(mtrx) return [[self.divide(adj[i][j],det) for j in range(sz)] for i in range(sz)] ################################################################################ def SplitSecret(secret, needed, pieces, nbytes=None, use_random_x=False): if not isinstance(secret, basestring): secret = secret.toBinStr() if nbytes==None: nbytes = len(secret) ff = FiniteField(nbytes) fragments = [] # Convert secret to an integer a = binary_to_int(SecureBinaryData(secret).toBinStr(),BIGENDIAN) if not a=needed: LOGERROR('You must create more pieces than needed to reconstruct!') raise FiniteFieldError if needed==1 or needed>8: LOGERROR('Can split secrets into parts *requiring* at most 8 fragments') LOGERROR('You can break it into as many optional fragments as you want') raise FiniteFieldError # We deterministically produce the coefficients so that we always use the # same polynomial for a given secret lasthmac = secret[:] othernum = [] for i in range(pieces+needed-1): lasthmac = HMAC512(lasthmac, 'splitsecrets')[:nbytes] othernum.append(binary_to_int(lasthmac)) def poly(x): polyout = ff.mult(a, ff.power(x,needed-1)) for i,e in enumerate(range(needed-2,-1,-1)): term = ff.mult(othernum[i], ff.power(x,e)) polyout = ff.add(polyout, term) return polyout for i in range(pieces): x = othernum[i+2] if use_random_x else i+1 fragments.append( [x, poly(x)] ) secret,a = None,None fragments = [ [int_to_binary(p, nbytes, BIGENDIAN) for p in frag] for frag in fragments] return fragments ################################################################################ def ReconstructSecret(fragments, needed, nbytes): ff = FiniteField(nbytes) pairs = fragments[:needed] m = [] v = [] for x,y in pairs: x = binary_to_int(x, BIGENDIAN) y = binary_to_int(y, BIGENDIAN) m.append([]) for i,e in enumerate(range(needed-1,-1,-1)): m[-1].append( ff.power(x,e) ) v.append(y) minv = ff.mtrxinv(m) outvect = ff.mtrxmultvect(minv,v) return int_to_binary(outvect[0], nbytes, BIGENDIAN) ################################################################################ def createTestingSubsets( fragIndices, M, maxTestCount=20): """ Returns (IsRandomized, listOfTuplesOfSizeM) """ numIdx = len(fragIndices) if M>numIdx: LOGERROR('Insufficent number of fragments') raise KeyDataError elif M==numIdx: LOGINFO('Fragments supplied == needed. One subset to test (%s-of-N)' % M) return ( False, [tuple(fragIndices)] ) else: LOGINFO('Test reconstruct %s-of-N, with %s fragments' % (M, numIdx)) subs = [] # Compute the number of possible subsets. This is stable because we # shouldn't ever have more than 12 fragments fact = math.factorial numCombo = fact(numIdx) / ( fact(M) * fact(numIdx-M) ) if numCombo <= maxTestCount: LOGINFO('Testing all %s combinations...' % numCombo) for x in xrange(2**numIdx): bits = int_to_bitset(x) if not bits.count('1') == M: continue subs.append(tuple([fragIndices[i] for i,b in enumerate(bits) if b=='1'])) return (False, sorted(subs)) else: LOGINFO('#Subsets > %s, will need to randomize' % maxTestCount) usedSubsets = set() while len(subs) < maxTestCount: sample = tuple(sorted(random.sample(fragIndices, M))) if not sample in usedSubsets: usedSubsets.add(sample) subs.append(sample) return (True, sorted(subs)) ################################################################################ def testReconstructSecrets(fragMap, M, maxTestCount=20): # If fragMap has X elements, then it will test all X-choose-M subsets of # the fragMap and return the restored secret for each one. If there's more # subsets than maxTestCount, then just do a random sampling of the possible # subsets fragKeys = [k for k in fragMap.iterkeys()] isRandom, subs = createTestingSubsets(fragKeys, M, maxTestCount) nBytes = len(fragMap[fragKeys[0]][1]) LOGINFO('Testing %d-byte fragments' % nBytes) testResults = [] for subset in subs: fragSubset = [fragMap[i][:] for i in subset] recon = ReconstructSecret(fragSubset, M, nBytes) testResults.append((subset, recon)) return isRandom, testResults ################################################################################ def ComputeFragIDBase58(M, wltIDBin): mBin4 = int_to_binary(M, widthBytes=4, endOut=BIGENDIAN) fragBin = hash256(wltIDBin + mBin4)[:4] fragB58 = str(M) + binary_to_base58(fragBin) return fragB58 ################################################################################ def ComputeFragIDLineHex(M, index, wltIDBin, isSecure=False, addSpaces=False): fragID = int_to_hex((128+M) if isSecure else M) fragID += int_to_hex(index+1) fragID += binary_to_hex(wltIDBin) if addSpaces: fragID = ' '.join([fragID[i*4:(i+1)*4] for i in range(4)]) return fragID ################################################################################ def ReadFragIDLineBin(binLine): doMask = binary_to_int(binLine[0]) > 127 M = binary_to_int(binLine[0]) & 0x7f fnum = binary_to_int(binLine[1]) wltID = binLine[2:] idBase58 = ComputeFragIDBase58(M, wltID) + '-#' + str(fnum) return (M, fnum, wltID, doMask, idBase58) ################################################################################ def ReadFragIDLineHex(hexLine): return ReadFragIDLineBin( hex_to_binary(hexLine.strip().replace(' ',''))) # END FINITE FIELD OPERATIONS ################################################################################ ################################################################################ ################################################################################ def stripJSONStrChars(inStr): '''Function that strips the extra characters from a JSON-encoded string.''' # When Python decodes a JSON string, extra characters are added. For example, # "Hello" becomes "u'Hello'". We want to get the original string. return inStr[2:-1] ################################################################################ def checkAddrType(addrBin): """ Gets the network byte of the address. Returns -1 if chksum fails """ first21, chk4 = addrBin[:-4], addrBin[-4:] chkBytes = hash256(first21) return addrBin[0] if (chkBytes[:4] == chk4) else -1 ################################################################################ def checkAddrBinValid(addrBin, validPrefixes=None): """ Checks whether this address is valid for the given network (set at the top of pybtcengine.py) """ if validPrefixes is None: validPrefixes = [ADDRBYTE, P2SHBYTE] if not isinstance(validPrefixes, list): validPrefixes = [validPrefixes] return (checkAddrType(addrBin) in validPrefixes) ################################################################################ def checkAddrStrValid(addrStr): """ Check that a Base58 address-string is valid on this network """ return checkAddrBinValid(base58_to_binary(addrStr)) ################################################################################ def convertKeyDataToAddress(privKey=None, pubKey=None): """ Returns a hash160 value """ if not privKey and not pubKey: raise BadAddressError('No key data supplied for conversion') elif privKey: if isinstance(privKey, str): privKey = SecureBinaryData(privKey) if not privKey.getSize()==32: raise BadAddressError('Invalid private key format!') else: pubKey = CryptoECDSA().ComputePublicKey(privKey) if isinstance(pubKey,str): pubKey = SecureBinaryData(pubKey) return pubKey.getHash160() ################################################################################ def decodeMiniPrivateKey(keyStr): """ Converts a 22, 26 or 30-character Base58 mini private key into a 32-byte binary private key. """ if not len(keyStr) in (22,26,30): return '' keyQ = keyStr + '?' theHash = sha256(keyQ) if binary_to_hex(theHash[0]) == '01': raise KeyDataError('PBKDF2-based mini private keys not supported!') elif binary_to_hex(theHash[0]) != '00': raise KeyDataError('Invalid mini private key... double check the entry') return sha256(keyStr) ################################################################################ def parsePrivateKeyData(theStr): hexChars = '01234567890abcdef' b58Chars = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz' hexCount = sum([1 if c in hexChars else 0 for c in theStr.lower()]) b58Count = sum([1 if c in b58Chars else 0 for c in theStr]) canBeHex = hexCount==len(theStr) canBeB58 = b58Count==len(theStr) binEntry = '' keyType = '' isMini = False if canBeB58 and not canBeHex: if len(theStr) in (22, 30): # Mini-private key format! try: binEntry = decodeMiniPrivateKey(theStr) except KeyDataError: raise BadAddressError('Invalid mini-private key string') keyType = 'Mini Private Key Format' isMini = True elif len(theStr) in range(48,53): binEntry = base58_to_binary(theStr) keyType = 'Plain Base58' else: raise BadAddressError('Unrecognized key data') elif canBeHex: binEntry = hex_to_binary(theStr) keyType = 'Plain Hex' else: raise BadAddressError('Unrecognized key data') if len(binEntry)==36 or (len(binEntry)==37 and binEntry[0]==PRIVKEYBYTE): if len(binEntry)==36: keydata = binEntry[:32 ] chk = binEntry[ 32:] binEntry = verifyChecksum(keydata, chk) if not isMini: keyType = 'Raw %s with checksum' % keyType.split(' ')[1] else: # Assume leading 0x80 byte, and 4 byte checksum keydata = binEntry[ :1+32 ] chk = binEntry[ 1+32:] binEntry = verifyChecksum(keydata, chk) binEntry = binEntry[1:] if not isMini: keyType = 'Standard %s key with checksum' % keyType.split(' ')[1] if binEntry=='': raise InvalidHashError('Private Key checksum failed!') elif len(binEntry) in (33, 37) and binEntry[-1]=='\x01': raise CompressedKeyError('Compressed Public keys not supported!') return binEntry, keyType ################################################################################ def encodePrivKeyBase58(privKeyBin): bin33 = PRIVKEYBYTE + privKeyBin chk = computeChecksum(bin33) return binary_to_base58(bin33 + chk) URI_VERSION_STR = '1.0' ################################################################################ def parseBitcoinURI(theStr): """ Takes a URI string, returns the pieces of it, in a dictionary """ # Start by splitting it into pieces on any separator seplist = ';?&' for c in seplist: theStr = theStr.replace(c,' ') parts = theStr.split() # Now start walking through the parts and get the info out of it if not parts[0].startswith('bitcoin:'): return {} uriData = {} try: uriData['address'] = parts[0][parts[0].index(':')+1:] for p in parts[2:]: if not '=' in p: raise BadURIError('Unrecognized URI field: "%s"'%p) # All fields must be "key=value" making it pretty easy to parse key, value = p.split('=') # A few if key.lower()=='amount': uriData['amount'] = str2coin(value) elif key.lower() in ('label','message'): uriData[key] = uriPercentToReserved(value) else: uriData[key] = value except: return {} return uriData ################################################################################ def uriReservedToPercent(theStr): """ Convert from a regular string to a percent-encoded string """ #Must replace '%' first, to avoid recursive (and incorrect) replacement! reserved = "%!*'();:@&=+$,/?#[] " for c in reserved: theStr = theStr.replace(c, '%%%s' % int_to_hex(ord(c))) return theStr ################################################################################ def uriPercentToReserved(theStr): """ This replacement direction is much easier! Convert from a percent-encoded string to a """ parts = theStr.split('%') if len(parts)>1: for p in parts[1:]: parts[0] += chr( hex_to_int(p[:2]) ) + p[2:] return parts[0][:] ################################################################################ def createBitcoinURI(addr, amt=None, msg=None): uriStr = 'bitcoin:%s' % addr if amt or msg: uriStr += '?' if amt: uriStr += 'amount=%s' % coin2str(amt, maxZeros=0).strip() if amt and msg: uriStr += '&' if msg: uriStr += 'label=%s' % uriReservedToPercent(msg) return uriStr ################################################################################ def createDERSigFromRS(rBin, sBin): # Remove all leading zero-bytes (why didn't we use lstrip() here?) while rBin[0]=='\x00': rBin = rBin[1:] while sBin[0]=='\x00': sBin = sBin[1:] if binary_to_int(rBin[0])&128>0: rBin = '\x00'+rBin if binary_to_int(sBin[0])&128>0: sBin = '\x00'+sBin rSize = int_to_binary(len(rBin)) sSize = int_to_binary(len(sBin)) rsSize = int_to_binary(len(rBin) + len(sBin) + 4) sigScript = '\x30' + rsSize + \ '\x02' + rSize + rBin + \ '\x02' + sSize + sBin return sigScript ################################################################################ def getRSFromDERSig(derSig): if not isinstance(derSig, str): # In case this is a SecureBinaryData object... derSig = derSig.toBinStr() codeByte = derSig[0] nBytes = binary_to_int(derSig[1]) rsStr = derSig[2:2+nBytes] assert(codeByte == '\x30') assert(nBytes == len(rsStr)) # Read r codeByte = rsStr[0] rBytes = binary_to_int(rsStr[1]) r = rsStr[2:2+rBytes] assert(codeByte == '\x02') sStr = rsStr[2+rBytes:] # Read s codeByte = sStr[0] sBytes = binary_to_int(sStr[1]) s = sStr[2:2+sBytes] assert(codeByte == '\x02') # Now we have the (r,s) values of the return r[-32:], s[-32:] ############################################################################# def newBlockSyncRescanZC(bdm, wltMap, prevLedgSize): newLedgSize = {} for wltID,wlt in wltMap.iteritems(): wlt.syncWithBlockchainLite() bdm.rescanWalletZeroConf(wlt.cppWallet) newLedgSize[wltID] = len(wlt.getTxLedger()) for wltID,wlt in wltMap.iteritems(): if prevLedgSize[wltID] != newLedgSize[wltID]: return True return False ############################################################################# def notifyOnSurpriseTx(blk0, blk1, wltMap, lboxWltMap, isGui, bdm, notifyQueue, settings ): # We usually see transactions as zero-conf first, then they show up in # a block. It is a "surprise" when the first time we see it is in a block if isGui: notifiedAlready = set([ n[1].getTxHash() for n in notifyQueue ]) notifyIn = settings.getSettingOrSetDefault('NotifyBtcIn', not OS_MACOSX) notifyOut = settings.getSettingOrSetDefault('NotifyBtcOut', not OS_MACOSX) for blk in range(blk0, blk1): sbh = bdm.getMainBlockFromDB(blk) for i in range(sbh.getNumTx()): cppTx = sbh.getTxCopy(i) # Iterate through the Python wallets and create a ledger entry for # the transaction. If we haven't already been notified of the # transaction, put it on the notification queue. for wltID,wlt in wltMap.iteritems(): le = wlt.cppWallet.calcLedgerEntryForTx(cppTx) if isGui and (notifyQueue != None): if not le.getTxHash() in notifiedAlready: if (le.getValue()<=0 and notifyOut) or (le.getValue>0 and notifyIn): notifyQueue.append([wltID, le, False]) else: pass else: # There should be a log message here. pass # Iterate through the C++ lockbox wallets and create a ledger entry # for the transaction.If we haven't already been notified of the # transaction, put it on the notification queue. for lbID,cppWlt in lboxWltMap.iteritems(): le = cppWlt.calcLedgerEntryForTx(cppTx) if isGui and (notifyQueue != None): if not le.getTxHash() in notifiedAlready: if (le.getValue()<=0 and notifyOut) or \ (le.getValue>0 and notifyIn): notifyQueue.append([lbID, le, False]) else: pass else: # There should be a log message here. pass ################################################################################ class PyBackgroundThread(threading.Thread): """ Wraps a function in a threading.Thread object which will run that function in a separate thread. Calling self.start() will return immediately, but will start running that function in separate thread. You can check its progress later by using self.isRunning() or self.isFinished(). If the function returns a value, use self.getOutput(). Use self.getElapsedSeconds() to find out how long it took. """ def __init__(self, *args, **kwargs): threading.Thread.__init__(self) self.output = None self.startedAt = UNINITIALIZED self.finishedAt = UNINITIALIZED self.errorThrown = None self.passAsync = None self.setDaemon(True) if len(args)==0: self.func = lambda: () else: if not hasattr(args[0], '__call__'): raise TypeError('PyBkgdThread ctor arg1 must be a function') else: self.setThreadFunction(args[0], *args[1:], **kwargs) def setThreadFunction(self, thefunc, *args, **kwargs): def funcPartial(): return thefunc(*args, **kwargs) self.func = funcPartial def setDaemon(self, yesno): if self.isStarted(): LOGERROR('Must set daemon property before starting thread') else: super(PyBackgroundThread, self).setDaemon(yesno) def isFinished(self): return not (self.finishedAt==UNINITIALIZED) def isStarted(self): return not (self.startedAt==UNINITIALIZED) def isRunning(self): return (self.isStarted() and not self.isFinished()) def getElapsedSeconds(self): if not self.isFinished(): LOGERROR('Thread is not finished yet!') return None else: return self.finishedAt - self.startedAt def getOutput(self): if not self.isFinished(): if self.isRunning(): LOGERROR('Cannot get output while thread is running') else: LOGERROR('Thread was never .start()ed') return None return self.output def didThrowError(self): return (self.errorThrown is not None) def raiseLastError(self): if self.errorThrown is None: return raise self.errorThrown def getErrorType(self): if self.errorThrown is None: return None return type(self.errorThrown) def getErrorMsg(self): if self.errorThrown is None: return '' return self.errorThrown.args[0] def start(self): # The prefunc is blocking. Probably preparing something # that needs to be in place before we start the thread self.startedAt = RightNow() super(PyBackgroundThread, self).start() def run(self): # This should not be called manually. Only call start() try: self.output = self.func() except Exception as e: LOGEXCEPT('Error in pybkgdthread: %s', str(e)) self.errorThrown = e self.finishedAt = RightNow() if not self.passAsync: return if hasattr(self.passAsync, '__call__'): self.passAsync() def reset(self): self.output = None self.startedAt = UNINITIALIZED self.finishedAt = UNINITIALIZED self.errorThrown = None def restart(self): self.reset() self.start() # Define a decorator that allows the function to be called asynchronously def AllowAsync(func): def wrappedFunc(*args, **kwargs): if not 'async' in kwargs or kwargs['async']==False: # Run the function normally if 'async' in kwargs: del kwargs['async'] return func(*args, **kwargs) else: # Run the function as a background thread passAsync = kwargs['async'] del kwargs['async'] thr = PyBackgroundThread(func, *args, **kwargs) thr.passAsync = passAsync thr.start() return thr return wrappedFunc def emptyFunc(*args, **kwargs): return def EstimateCumulativeBlockchainSize(blkNum): # I tried to make a "static" variable here so that # the string wouldn't be parsed on every call, but # I botched that, somehow. # # It doesn't *have to* be fast, but why not? # Oh well.. blksizefile = """ 0 285 20160 4496226 40320 9329049 60480 16637208 80640 31572990 82656 33260320 84672 35330575 86688 36815335 88704 38386205 100800 60605119 102816 64795352 104832 68697265 108864 79339447 112896 92608525 116928 116560952 120960 140607929 124992 170059586 129024 217718109 133056 303977266 137088 405836779 141120 500934468 145152 593217668 149184 673064617 153216 745173386 157248 816675650 161280 886105443 165312 970660768 169344 1058290613 173376 1140721593 177408 1240616018 179424 1306862029 181440 1463634913 183456 1639027360 185472 1868851317 187488 2019397056 189504 2173291204 191520 2352873908 193536 2530862533 195552 2744361593 197568 2936684028 199584 3115432617 201600 3282437367 203616 3490737816 205632 3669806064 207648 3848901149 209664 4064972247 211680 4278148686 213696 4557787597 215712 4786120879 217728 5111707340 219744 5419128115 221760 5733907456 223776 6053668460 225792 6407870776 227808 6652067986 228534 6778529822 257568 10838081536 259542 11106516992 271827 12968787968 286296 15619588096 290715 16626221056 323285 24216006308 """ strList = [line.strip().split() for line in blksizefile.strip().split('\n')] BLK_SIZE_LIST = [[int(x[0]), int(x[1])] for x in strList] if blkNum < BLK_SIZE_LIST[-1][0]: # Interpolate bprev,bcurr = None, None for i,blkpair in enumerate(BLK_SIZE_LIST): if blkNum < blkpair[0]: b0,d0 = BLK_SIZE_LIST[i-1] b1,d1 = blkpair ratio = float(blkNum-b0)/float(b1-b0) return int(ratio*d1 + (1-ratio)*d0) raise ValueError('Interpolation failed for %d' % blkNum) else: bend, dend = BLK_SIZE_LIST[-1] bend2, dend2 = BLK_SIZE_LIST[-3] rate = float(dend - dend2) / float(bend - bend2) # bytes per block extraOnTop = (blkNum - bend) * rate return dend+extraOnTop ################################################################################ # Function checks to see if a binary value that's passed in is a valid public # key. The incoming key may be binary or hex. The return value is a boolean # indicating whether or not the key is valid. def isValidPK(inPK, inStr=False): retVal = False checkVal = '\x00' if inStr: checkVal = hex_to_binary(inPK) else: checkVal = inPK pkLen = len(checkVal) if pkLen == UNCOMP_PK_LEN or pkLen == COMP_PK_LEN: # The "proper" way to check the key is to feed it to Crypto++. if not CryptoECDSA().VerifyPublicKeyValid(SecureBinaryData(checkVal)): LOGWARN('Pub key %s is invalid.' % binary_to_hex(inPK)) else: retVal = True else: LOGWARN('Pub key %s has an invalid length (%d bytes).' % \ (len(inPK), binary_to_hex(inPK))) return retVal ################################################################################ # Function that extracts IDs from a given text block and returns a list of all # the IDs. The format should follow the example below, with "12345678" and # "AbCdEfGh" being the IDs, and "LOCKBOX" being the key. There may be extra # newline characters. The characters will be ignored. # # =====LOCKBOX-12345678===================================================== # ckhc3hqhhuih7gGGOUT78hweds # ========================================================================== # =====LOCKBOX-AbCdEfGh===================================================== # ckhc3hqhhuih7gGGOUT78hweds # ========================================================================== # # In addition, the incoming block of text must be from a file (using something # like "with open() as x") or a StringIO/cStringIO object. def getBlockID(asciiText, key): blockList = [] # Iterate over each line in the text and get the IDs. for line in asciiText: if key in line: stripT = line.replace("=", "").replace(key, "").replace("\n", "") blockList.append(stripT) return blockList ################################################################################ # Decompress an incoming public key. The incoming key may be binary or hex. The # final key is in the same form (i.e., binary or hex) as the incoming key. def decompressPK(inKey, inStr=False): outKey = '\x00' checkKey = '\x00' # Let's support strings and binary data. if inStr: checkKey = hex_to_binary(inKey) else: checkKey = inKey lenInKey = len(checkKey) # WARNING: This function won't verify the input. It just passes the input # down the line. if lenInKey == UNCOMP_PK_LEN: LOGWARN('The public key is already decompressed.') outKey = checkKey elif lenInKey != COMP_PK_LEN: LOGERROR('The public key has an incorrect size (%d bytes).' % lenInKey) else: if checkKey[0] == '\x02' or checkKey[0] == '\x03': cppKeyVal = SecureBinaryData(checkKey) outKey = CryptoECDSA().UncompressPoint(cppKeyVal).toBinStr() keyStr = binary_to_hex(outKey) else: LOGERROR('The public key\'s first byte (%s) is incorrectly ' \ 'formatted.' % binary_to_hex(checkKey[0])) # Keep consistency by returning a string key if necessary. if inStr: outKey = binary_to_hex(outKey) return outKey ################################################################################ # Function that can be used to send an e-mail to multiple recipients. def send_email(send_from, server, password, send_to, subject, text): # smtp.sendmail() requires a list of recipients. If we didn't get a list, # create one, and delimit based on a colon. if not type(send_to) == list: send_to = send_to.split(":") # Split the server info. Also, use a default port in case the user goofed and # didn't specify a port. server = server.split(":") serverAddr = server[0] serverPort = 587 if len(server) > 1: serverPort = int(server[1]) # Some of this may have to be modded to support non-TLS servers. msg = MIMEMultipart() msg['From'] = send_from msg['To'] = COMMASPACE.join(send_to) msg['Date'] = formatdate(localtime=True) msg['Subject'] = subject msg.attach(MIMEText(text)) mailServer = smtplib.SMTP(serverAddr, serverPort) mailServer.ehlo() mailServer.starttls() mailServer.ehlo() mailServer.login(send_from, password) mailServer.sendmail(send_from, send_to, msg.as_string()) mailServer.close() ############################################################################# def DeriveChaincodeFromRootKey(sbdPrivKey): return SecureBinaryData( HMAC256( sbdPrivKey.getHash256(), \ 'Derive Chaincode from Root Key')) ############################################################################# def getLastBytesOfFile(filename, nBytes=500*1024): if not os.path.exists(filename): LOGERROR('File does not exist!') return '' sz = os.path.getsize(filename) with open(filename, 'rb') as fin: if sz > nBytes: fin.seek(sz - nBytes) return fin.read() ################################################################################ def HardcodedKeyMaskParams(): paramMap = {} # Nothing up my sleeve! Need some hardcoded random numbers to use for # encryption IV and salt. Using the first 256 digits of Pi for the # the IV, and first 256 digits of e for the salt (hashed) digits_pi = ( \ 'ARMORY_ENCRYPTION_INITIALIZATION_VECTOR_' '1415926535897932384626433832795028841971693993751058209749445923' '0781640628620899862803482534211706798214808651328230664709384460' '9550582231725359408128481117450284102701938521105559644622948954' '9303819644288109756659334461284756482337867831652712019091456485') digits_e = ( \ 'ARMORY_KEY_DERIVATION_FUNCTION_SALT_' '7182818284590452353602874713526624977572470936999595749669676277' '2407663035354759457138217852516642742746639193200305992181741359' '6629043572900334295260595630738132328627943490763233829880753195' '2510190115738341879307021540891499348841675092447614606680822648') paramMap['IV'] = SecureBinaryData( hash256(digits_pi)[:16] ) paramMap['SALT'] = SecureBinaryData( hash256(digits_e) ) paramMap['KDFBYTES'] = long(16*MEGABYTE) def hardcodeCreateSecurePrintPassphrase(secret): if isinstance(secret, basestring): secret = SecureBinaryData(secret) bin7 = HMAC512(secret.getHash256(), paramMap['SALT'].toBinStr())[:7] out,bin7 = SecureBinaryData(binary_to_base58(bin7 + hash256(bin7)[0])), None return out def hardcodeCheckPassphrase(passphrase): if isinstance(passphrase, basestring): pwd = base58_to_binary(passphrase) else: pwd = base58_to_binary(passphrase.toBinStr()) isgood,pwd = (hash256(pwd[:7])[0] == pwd[-1]), None return isgood def hardcodeApplyKdf(secret): if isinstance(secret, basestring): secret = SecureBinaryData(secret) kdf = KdfRomix() kdf.usePrecomputedKdfParams(paramMap['KDFBYTES'], 1, paramMap['SALT']) return kdf.DeriveKey(secret) def hardcodeMask(secret, passphrase=None, ekey=None): if not ekey: ekey = hardcodeApplyKdf(passphrase) return CryptoAES().EncryptCBC(secret, ekey, paramMap['IV']) def hardcodeUnmask(secret, passphrase=None, ekey=None): if not ekey: ekey = hardcodeApplyKdf(passphrase) return CryptoAES().DecryptCBC(secret, ekey, paramMap['IV']) paramMap['FUNC_PWD'] = hardcodeCreateSecurePrintPassphrase paramMap['FUNC_KDF'] = hardcodeApplyKdf paramMap['FUNC_MASK'] = hardcodeMask paramMap['FUNC_UNMASK'] = hardcodeUnmask paramMap['FUNC_CHKPWD'] = hardcodeCheckPassphrase return paramMap ################################################################################ ################################################################################ class SettingsFile(object): """ This class could be replaced by the built-in QSettings in PyQt, except that older versions of PyQt do not support the QSettings (or at least I never figured it out). Easy enough to do it here All settings must populated with a simple datatype -- non-simple datatypes should be broken down into pieces that are simple: numbers and strings, or lists/tuples of them. Will write all the settings to file. Each line will look like: SingleValueSetting1 | 3824.8 SingleValueSetting2 | this is a string Tuple Or List Obj 1 | 12 $ 43 $ 13 $ 33 Tuple Or List Obj 2 | str1 $ another str """ ############################################################################# def __init__(self, path=None): self.settingsPath = path self.settingsMap = {} if not path: self.settingsPath = os.path.join(ARMORY_HOME_DIR, 'ArmorySettings.txt') LOGINFO('Using settings file: %s', self.settingsPath) if os.path.exists(self.settingsPath): self.loadSettingsFile(path) ############################################################################# def pprint(self, nIndent=0): indstr = indent*nIndent print indstr + 'Settings:' for k,v in self.settingsMap.iteritems(): print indstr + indent + k.ljust(15), v ############################################################################# def hasSetting(self, name): return self.settingsMap.has_key(name) ############################################################################# def set(self, name, value): if isinstance(value, tuple): self.settingsMap[name] = list(value) else: self.settingsMap[name] = value self.writeSettingsFile() ############################################################################# def extend(self, name, value): """ Adds/converts setting to list, appends value to the end of it """ if not self.settingsMap.has_key(name): if isinstance(value, list): self.set(name, value) else: self.set(name, [value]) else: origVal = self.get(name, expectList=True) if isinstance(value, list): origVal.extend(value) else: origVal.append(value) self.settingsMap[name] = origVal self.writeSettingsFile() ############################################################################# def get(self, name, expectList=False): if not self.hasSetting(name) or self.settingsMap[name]=='': return ([] if expectList else '') else: val = self.settingsMap[name] if expectList: if isinstance(val, list): return val else: return [val] else: return val ############################################################################# def getAllSettings(self): return self.settingsMap ############################################################################# def getSettingOrSetDefault(self, name, defaultVal, expectList=False): output = defaultVal if self.hasSetting(name): output = self.get(name) else: self.set(name, defaultVal) return output ############################################################################# def delete(self, name): if self.hasSetting(name): del self.settingsMap[name] self.writeSettingsFile() ############################################################################# def writeSettingsFile(self, path=None): if not path: path = self.settingsPath f = open(path, 'w') for key,val in self.settingsMap.iteritems(): try: # Skip anything that throws an exception valStr = '' if isinstance(val, basestring): valStr = val elif isinstance(val, int) or \ isinstance(val, float) or \ isinstance(val, long): valStr = str(val) elif isinstance(val, list) or \ isinstance(val, tuple): valStr = ' $ '.join([str(v) for v in val]) f.write(key.ljust(36)) f.write(' | ') f.write(toBytes(valStr)) f.write('\n') except: LOGEXCEPT('Invalid entry in SettingsFile... skipping') f.close() ############################################################################# def loadSettingsFile(self, path=None): if not path: path = self.settingsPath if not os.path.exists(path): raise FileExistsError('Settings file DNE:' + path) f = open(path, 'rb') sdata = f.read() f.close() # Automatically convert settings to numeric if possible def castVal(v): v = v.strip() a,b = v.isdigit(), v.replace('.','').isdigit() if a: return int(v) elif b: return float(v) else: if v.lower()=='true': return True elif v.lower()=='false': return False else: return toUnicode(v) sdata = [line.strip() for line in sdata.split('\n')] for line in sdata: if len(line.strip())==0: continue try: key,vals = line.split('|') valList = [castVal(v) for v in vals.split('$')] if len(valList)==1: self.settingsMap[key.strip()] = valList[0] else: self.settingsMap[key.strip()] = valList except: LOGEXCEPT('Invalid setting in %s (skipping...)', path) # Random method for creating def touchFile(fname): try: os.utime(fname, None) except: f = open(fname, 'a') f.flush() os.fsync(f.fileno()) f.close() # NOTE: Had to put in this at the eend so it was after the AllowAsync def # This flag takes into account both CLI_OPTIONs, and availability of the # BitTornado library (the user can remove the BitTornado dir and/or the # torrentDL.py files without breaking Armory, it will simply set this # disable flag to true) class FakeTDM(object): def __init__(self): self.isRunning = lambda: False self.isStarted = lambda: False self.isFinished = lambda: False self.getTDMState = lambda: 'Disabled' self.removeOldTorrentFile = lambda: None DISABLE_TORRENTDL = CLI_OPTIONS.disableTorrent TheTDM = FakeTDM() try: import torrentDL TheTDM = torrentDL.TorrentDownloadManager() except: LOGEXCEPT('Failed to import torrent downloader') DISABLE_TORRENTDL = True # We only use BITTORRENT for mainnet if USE_TESTNET: DISABLE_TORRENTDL = True armory-0.92.3/armoryengine/PyBtcWallet.py0000644000000000000000000040662012414772654017103 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ import os.path import shutil from CppBlockUtils import SecureBinaryData, KdfRomix, CryptoAES, CryptoECDSA import CppBlockUtils as Cpp from armoryengine.ArmoryUtils import * from armoryengine.BinaryPacker import * from armoryengine.BinaryUnpacker import * from armoryengine.Timer import * # This import is causing a circular import problem when used by findpass and promokit # it is imported at the end of the file. Do not add it back at the begining # from armoryengine.Transaction import * BLOCKCHAIN_READONLY = 0 BLOCKCHAIN_READWRITE = 1 BLOCKCHAIN_DONOTUSE = 2 WLT_UPDATE_ADD = 0 WLT_UPDATE_MODIFY = 1 WLT_DATATYPE_KEYDATA = 0 WLT_DATATYPE_ADDRCOMMENT = 1 WLT_DATATYPE_TXCOMMENT = 2 WLT_DATATYPE_OPEVAL = 3 WLT_DATATYPE_DELETED = 4 DEFAULT_COMPUTE_TIME_TARGET = 0.25 DEFAULT_MAXMEM_LIMIT = 32*1024*1024 PYROOTPKCCVER = 1 # Current version of root pub key/chain code backup format PYROOTPKCCVERMASK = 0x7F PYROOTPKCCSIGNMASK = 0x80 def buildWltFileName(uniqueIDB58): return 'armory_%s_.wallet' % uniqueIDB58 class PyBtcWallet(object): """ This class encapsulates all the concepts and variables in a "wallet", and maintains the passphrase protection, key stretching, encryption, etc, required to maintain the wallet. This class also includes the file I/O methods for storing and loading wallets. ***NOTE: I have ONLY implemented deterministic wallets, using ECDSA Diffie-Hellman shared-secret crypto operations. This allows one to actually determine the next PUBLIC KEY in the address chain without actually having access to the private keys. This makes it possible to synchronize online-offline computers once and never again. You can import random keys into your wallet, but if it is encrypted, you will have to supply a passphrase to make sure it can be encrypted as well. Presumably, wallets will be used for one of three purposes: (1) Spend money and receive payments (2) Watching-only wallets - have the private keys, just not on this computer (3) May be watching *other* people's addrs. There's a variety of reasons we might want to watch other peoples' addresses, but most them are not relevant to a "basic" BTC user. Nonetheless it should be supported to watch money without considering it part of our own assets This class is included in the combined-python-cpp module, because we really need to maintain a persistent Cpp.BtcWallet if this class is to be useful (we don't want to have to rescan the entire blockchain every time we do any wallet operations). The file format was designed from the outset with lots of unused space to allow for expansion without having to redefine the file format and break previous wallets. Luckily, wallet information is cheap, so we don't have to stress too much about saving space (100,000 addresses should take 15 MB) This file is NOT for storing Tx-related information. I want this file to be the minimal amount of information you need to secure and backup your entire wallet. Tx information can always be recovered from examining the blockchain... your private keys cannot be. We track version numbers, just in case. We start with 1.0 Version 1.0: --- fileID -- (8) '\xbaWALLET\x00' for wallet files version -- (4) getVersionInt(PYBTCWALLET_VERSION) magic bytes -- (4) defines the blockchain for this wallet (BTC, NMC) wlt flags -- (8) 64 bits/flags representing info about wallet binUniqueID -- (6) first 5 bytes of first address in wallet (rootAddr25Bytes[:5][::-1]), reversed This is not intended to look like the root addr str and is reversed to avoid having all wallet IDs start with the same characters (since the network byte is front) create date -- (8) unix timestamp of when this wallet was created (actually, the earliest creation date of any addr in this wallet -- in the case of importing addr data). This is used to improve blockchain searching Short Name -- (32) Null-terminated user-supplied short name for wlt Long Name -- (256) Null-terminated user-supplied description for wlt Highest Used-- (8) The chain index of the highest used address --- Crypto/KDF -- (512) information identifying the types and parameters of encryption used to secure wallet, and key stretching used to secure your passphrase. Includes salt. (the breakdown of this field will be described separately) KeyGenerator-- (237) The base address for a determinstic wallet. Just a serialized PyBtcAddress object. --- UNUSED -- (1024) unused space for future expansion of wallet file --- Remainder of file is for key storage and various other things. Each "entry" will start with a 4-byte code identifying the entry type, then 20 bytes identifying what address the data is for, and finally then the subsequent data . So far, I have three types of entries that can be included: \x01 -- Address/Key data (as of PyBtcAddress version 1.0, 237 bytes) \x02 -- Address comments (variable-width field) \x03 -- Address comments (variable-width field) \x04 -- OP_EVAL subscript (when this is enabled, in the future) Please see PyBtcAddress for information on how key data is serialized. Comments (\x02) are var-width, and if a comment is changed to something longer than the existing one, we'll just blank out the old one and append a new one to the end of the file. It looks like 02000000 01 4f This comment is enabled (01) with 4f characters For file syncing, we protect against corrupted wallets by doing atomic operations before even telling the user that new data has been added. We do this by copying the wallet file, and creating a walletUpdateFailed file. We then modify the original, verify its integrity, and then delete the walletUpdateFailed file. Then we create a backupUpdateFailed flag, do the identical update on the backup file, and delete the failed flag. This guaranatees that no matter which nanosecond the power goes out, there will be an uncorrupted wallet and we know which one it is. We never let the user see any data until the atomic write-to-file operation has completed Additionally, we implement key locking and unlocking, with timeout. These key locking features are only DEFINED here, not actually enforced (because this is a library, not an application). You can set the default/temporary time that the KDF key is maintained in memory after the passphrase is entered, and this class will keep track of when the wallet should be next locked. It is up to the application to check whether the current time exceeds the lock time. This will probably be done in a kind of heartbeat method, which checks every few seconds for all sorts of things -- including wallet locking. """ ############################################################################# def __init__(self): self.fileTypeStr = '\xbaWALLET\x00' self.magicBytes = MAGIC_BYTES self.version = PYBTCWALLET_VERSION # (Major, Minor, Minor++, even-more-minor) self.eofByte = 0 self.cppWallet = None # Mirror of PyBtcWallet in C++ object self.cppInfo = {} # Extra info about each address to help sync self.watchingOnly = False self.wltCreateDate = 0 # Three dictionaries hold all data self.addrMap = {} # maps 20-byte addresses to PyBtcAddress objects self.commentsMap = {} # maps 20-byte addresses to user-created comments self.commentLocs = {} # map comment keys to wallet file locations self.opevalMap = {} # maps 20-byte addresses to OP_EVAL data (future) self.labelName = '' self.labelDescr = '' self.linearAddr160List = [] self.chainIndexMap = {} self.txAddrMap = {} # cache for getting tx-labels based on addr search if USE_TESTNET: self.addrPoolSize = 10 # this makes debugging so much easier! else: self.addrPoolSize = CLI_OPTIONS.keypool # For file sync features self.walletPath = '' self.doBlockchainSync = BLOCKCHAIN_READONLY self.lastSyncBlockNum = 0 # Private key encryption details self.useEncryption = False self.kdf = None self.crypto = None self.kdfKey = None self.defaultKeyLifetime = 10 # seconds after unlock, that key is discarded self.lockWalletAtTime = 0 # seconds after unlock, that key is discarded self.isLocked = False self.testedComputeTime=None # Deterministic wallet, need a root key. Though we can still import keys. # The unique ID contains the network byte (id[-1]) but is not intended to # resemble the address of the root key self.uniqueIDBin = '' self.uniqueIDB58 = '' # Base58 version of reversed-uniqueIDBin self.lastComputedChainAddr160 = '' self.lastComputedChainIndex = 0 self.highestUsedChainIndex = 0 # All PyBtcAddress serializations are exact same size, figure it out now self.pybtcaddrSize = len(PyBtcAddress().serialize()) # All BDM calls by default go on the multi-thread-queue. But if the BDM # is the one calling the PyBtcWallet methods, it will deadlock if it uses # the queue. Therefore, the BDM will set this flag before making any # calls, which will tell PyBtcWallet to use __direct methods. self.calledFromBDM = False # Finally, a bunch of offsets that tell us where data is stored in the # file: this can be generated automatically on unpacking (meaning it # doesn't require manually updating offsets if I change the format), and # will save us a couple lines of code later, when we need to update things self.offsetWltFlags = -1 self.offsetLabelName = -1 self.offsetLabelDescr = -1 self.offsetTopUsed = -1 self.offsetRootAddr = -1 self.offsetKdfParams = -1 self.offsetCrypto = -1 # These flags are ONLY for unit-testing the walletFileSafeUpdate function self.interruptTest1 = False self.interruptTest2 = False self.interruptTest3 = False #flags the wallet if it has off chain imports (from a consistency repair) self.hasNegativeImports = False ############################################################################# def isWltSigningAnyLockbox(self, lockboxList): for lockbox in lockboxList: for addr160 in lockbox.a160List: if self.addrMap.has_key(addr160): return True return False ############################################################################# def getWalletVersion(self): return (getVersionInt(self.version), getVersionString(self.version)) ############################################################################# def getTimeRangeForAddress(self, addr160): if not self.addrMap.has_key(addr160): return None else: return self.addrMap[addr160].getTimeRange() ############################################################################# def getBlockRangeForAddress(self, addr160): if not self.addrMap.has_key(addr160): return None else: return self.addrMap[addr160].getBlockRange() ############################################################################# def setBlockchainSyncFlag(self, syncYes=True): self.doBlockchainSync = syncYes ############################################################################# @TimeThisFunction def syncWithBlockchain(self, startBlk=None): """ Will block until getTopBlockHeader() returns, which could be a while. If you don't want to wait, check TheBDM.getBDMState()=='BlockchainReady' before calling this method. If you expect the blockchain will have to be rescanned, then call TheBDM.rescanBlockchain or TheBDM.loadBlockchain If this method is called from the BDM itself, calledFromBDM will signal to use the BDM methods directly, not the queue. This will deadlock otherwise. """ if TheBDM.getBDMState() in ('Offline', 'Uninitialized'): LOGWARN('Called syncWithBlockchain but BDM is %s', TheBDM.getBDMState()) return if not self.doBlockchainSync==BLOCKCHAIN_DONOTUSE: if startBlk==None: startBlk = self.lastSyncBlockNum + 1 # calledFromBDM means that ultimately the BDM itself called this # method and is blocking waiting for it. So we can't use the # BDM-thread queue, must call its methods directly if self.calledFromBDM: TheBDM.scanBlockchainForTx_bdm_direct(self.cppWallet, startBlk) self.lastSyncBlockNum = TheBDM.getTopBlockHeight_bdm_direct() else: TheBDM.scanBlockchainForTx(self.cppWallet, startBlk, wait=True) self.lastSyncBlockNum = TheBDM.getTopBlockHeight(wait=True) else: LOGERROR('Blockchain-sync requested, but current wallet') LOGERROR('is set to BLOCKCHAIN_DONOTUSE') ############################################################################# @TimeThisFunction def syncWithBlockchainLite(self, startBlk=None): """ This is just like a regular sync, but it won't rescan the whole blockchain if the wallet is dirty -- if addresses were imported recently, it will still only scan what the blockchain picked up on the last scan. Use the non-lite version to allow a full scan. """ if TheBDM.getBDMState() in ('Offline', 'Uninitialized'): LOGWARN('Called syncWithBlockchainLite but BDM is %s', TheBDM.getBDMState()) return if not self.doBlockchainSync==BLOCKCHAIN_DONOTUSE: if startBlk==None: if self.lastSyncBlockNum is not None: startBlk = self.lastSyncBlockNum + 1 # calledFromBDM means that ultimately the BDM itself called this # method and is blocking waiting for it. So we can't use the # BDM-thread queue, must call its methods directly if self.calledFromBDM: TheBDM.scanRegisteredTxForWallet_bdm_direct(self.cppWallet, startBlk) self.lastSyncBlockNum = TheBDM.getTopBlockHeight_bdm_direct() else: TheBDM.scanRegisteredTxForWallet(self.cppWallet, startBlk, wait=True) self.lastSyncBlockNum = TheBDM.getTopBlockHeight(wait=True) wltLE = self.cppWallet.getTxLedgerForComments() for le in wltLE: txHash = le.getTxHash() if not self.txAddrMap.has_key(txHash): self.txAddrMap[txHash] = [] scrAddr = SecureBinaryData(le.getScrAddr()) try: addrStr = scrAddr_to_addrStr(scrAddr.toBinStr()) addr160 = addrStr_to_hash160(addrStr)[1] if addr160 not in self.txAddrMap[txHash]: self.txAddrMap[txHash].append(addr160) except: continue else: LOGERROR('Blockchain-sync requested, but current wallet') LOGERROR('is set to BLOCKCHAIN_DONOTUSE') ############################################################################# def getCommentForAddrBookEntry(self, abe): comment = self.getComment(abe.getAddr160()) if len(comment)>0: return comment # SWIG BUG! # http://sourceforge.net/tracker/?func=detail&atid=101645&aid=3403085&group_id=1645 # Apparently, using the -threads option when compiling the swig module # causes the "for i in vector<...>:" mechanic to sometimes throw seg faults! # For this reason, this method was replaced with the one below: for regTx in abe.getTxList(): comment = self.getComment(regTx.getTxHash()) if len(comment)>0: return comment return '' ############################################################################# def getCommentForTxList(self, a160, txhashList): comment = self.getComment(a160) if len(comment)>0: return comment for txHash in txhashList: comment = self.getComment(txHash) if len(comment)>0: return comment return '' ############################################################################# def printAddressBook(self): addrbook = self.cppWallet.createAddressBook() for abe in addrbook: print hash160_to_addrStr(abe.getAddr160()), txlist = abe.getTxList() print len(txlist) for rtx in txlist: print '\t', binary_to_hex(rtx.getTxHash(), BIGENDIAN) ############################################################################# def hasAnyImported(self): for a160,addr in self.addrMap.iteritems(): if addr.chainIndex == -2: return True return False ############################################################################# # The IGNOREZC args on the get*Balance calls determine whether unconfirmed # change (sent-to-self) will be considered spendable or unconfirmed. This # was added after the malleability issues cropped up in Feb 2014. Zero-conf # change was always deprioritized, but using --nospendzeroconfchange makes # it totally unspendable def getBalance(self, balType="Spendable"): if not TheBDM.getBDMState()=='BlockchainReady' and not self.calledFromBDM: return -1 else: currBlk = TheBDM.getTopBlockHeight(calledFromBDM=self.calledFromBDM) if balType.lower() in ('spendable','spend'): return self.cppWallet.getSpendableBalance(currBlk, IGNOREZC) elif balType.lower() in ('unconfirmed','unconf'): return self.cppWallet.getUnconfirmedBalance(currBlk, IGNOREZC) elif balType.lower() in ('total','ultimate','unspent','full'): return self.cppWallet.getFullBalance() else: raise TypeError('Unknown balance type! "' + balType + '"') ############################################################################# def getAddrBalance(self, addr160, balType="Spendable", currBlk=UINT32_MAX): if (not TheBDM.getBDMState()=='BlockchainReady' and not self.calledFromBDM) or \ not self.hasAddr(addr160): return -1 else: addr = self.cppWallet.getScrAddrObjByKey(Hash160ToScrAddr(addr160)) if balType.lower() in ('spendable','spend'): return addr.getSpendableBalance(currBlk, IGNOREZC) elif balType.lower() in ('unconfirmed','unconf'): return addr.getUnconfirmedBalance(currBlk, IGNOREZC) elif balType.lower() in ('ultimate','unspent','full'): return addr.getFullBalance() else: raise TypeError('Unknown balance type!') ############################################################################# def getTxLedger(self, ledgType='Full'): """ Gets the ledger entries for the entire wallet, from C++/SWIG data structs """ if not TheBDM.getBDMState()=='BlockchainReady' and not self.calledFromBDM: return [] else: ledgBlkChain = self.cppWallet.getTxLedger() ledgZeroConf = self.cppWallet.getZeroConfLedger() if ledgType.lower() in ('full','all','ultimate'): ledg = [] ledg.extend(ledgBlkChain) ledg.extend(ledgZeroConf) return ledg elif ledgType.lower() in ('blk', 'blkchain', 'blockchain'): return ledgBlkChain elif ledgType.lower() in ('zeroconf', 'zero'): return ledgZeroConf else: raise TypeError('Unknown ledger type! "' + ledgType + '"') ############################################################################# def getAddrTxLedger(self, addr160, ledgType='Full'): """ Gets the ledger entries for the entire wallet, from C++/SWIG data structs """ if (not TheBDM.getBDMState()=='BlockchainReady' and not self.calledFromBDM) or \ not self.hasAddr(addr160): return [] else: scrAddr = Hash160ToScrAddr(addr160) ledgBlkChain = self.cppWallet.getScrAddrObjByKey(scrAddr).getTxLedger() ledgZeroConf = self.cppWallet.getScrAddrObjByKey(scrAddr).getZeroConfLedger() if ledgType.lower() in ('full','all','ultimate'): ledg = [] ledg.extend(ledgBlkChain) ledg.extend(ledgZeroConf) return ledg elif ledgType.lower() in ('blk', 'blkchain', 'blockchain'): return ledgBlkChain elif ledgType.lower() in ('zeroconf', 'zero'): return ledgZeroConf else: raise TypeError('Unknown ledger type! "' + ledgType + '"') ############################################################################# def getTxOutList(self, txType='Spendable'): """ Returns UnspentTxOut/C++ objects """ if TheBDM.getBDMState()=='BlockchainReady' and \ not self.doBlockchainSync==BLOCKCHAIN_DONOTUSE: currBlk = TheBDM.getTopBlockHeight(calledFromBDM=self.calledFromBDM) self.syncWithBlockchain() if txType.lower() in ('spend', 'spendable'): return self.cppWallet.getSpendableTxOutList(currBlk, IGNOREZC); elif txType.lower() in ('full', 'all', 'unspent', 'ultimate'): return self.cppWallet.getFullTxOutList(currBlk); else: raise TypeError('Unknown TxOut type! ' + txType) else: LOGERROR('***Blockchain is not available for accessing wallet-tx data') return [] ############################################################################# def getAddrTxOutList(self, addr160, txType='Spendable'): """ Returns UnspentTxOut/C++ objects """ if TheBDM.getBDMState()=='BlockchainReady' and \ self.hasAddr(addr160) and \ not self.doBlockchainSync==BLOCKCHAIN_DONOTUSE: currBlk = TheBDM.getTopBlockHeight(calledFromBDM=self.calledFromBDM) self.syncWithBlockchain() scrAddrStr = Hash160ToScrAddr(addr160) cppAddr = self.cppWallet.getScrAddrObjByKey(scrAddrStr) if txType.lower() in ('spend', 'spendable'): return cppAddr.getSpendableTxOutList(currBlk, IGNOREZC); elif txType.lower() in ('full', 'all', 'unspent', 'ultimate'): return cppAddr.getFullTxOutList(currBlk); else: raise TypeError('Unknown TxOutList type! ' + txType) else: LOGERROR('***Blockchain is not available for accessing wallet-tx data') return [] ############################################################################# def getAddrByHash160(self, addr160): return (None if not self.hasAddr(addr160) else self.addrMap[addr160]) ############################################################################# def hasScrAddr(self, scrAddr): """ Wallets currently only hold P2PKH scraddrs, so if it's not that, False """ if not scrAddr[0] == SCRADDR_P2PKH_BYTE or not len(scrAddr)==21: return False # For P2PKH scraddrs, the first byte is prefix, next 20 bytes is addr160 return self.hasAddr(scrAddr[1:]) ############################################################################# def hasAddr(self, addrData): if isinstance(addrData, str): if len(addrData) == 20: return self.addrMap.has_key(addrData) elif isLikelyDataType(addrData)==DATATYPE.Base58: return self.addrMap.has_key(addrStr_to_hash160(addrData)[1]) else: return False elif isinstance(addrData, PyBtcAddress): return self.addrMap.has_key(addrData.getAddr160()) else: return False ############################################################################# def setDefaultKeyLifetime(self, newlifetime): """ Set a new default lifetime for holding the unlock key. Min 2 sec """ self.defaultKeyLifetime = max(newlifetime, 2) ############################################################################# def checkWalletLockTimeout(self): if not self.isLocked and self.kdfKey and RightNow()>self.lockWalletAtTime: self.lock() if self.kdfKey: self.kdfKey.destroy() self.kdfKey = None if self.useEncryption: self.isLocked = True ############################################################################# def lockTxOutsOnNewTx(self, pytxObj): for txin in pytxObj.inputs: self.cppWallet.lockTxOutSwig(txin.outpoint.txHash, \ txin.outpoint.txOutIndex) ############################################################################# # THIS WAS CREATED ORIGINALLY TO SUPPORT BITSAFE INTEGRATION INTO ARMORY # But it's also a good first step into general BIP 32 support def getChildExtPubFromRoot(self, i): root = self.addrMap['ROOT'] ekey = ExtendedKey().CreateFromPublic(root.binPublicKey65, root.chaincode) newKey = HDWalletCrypto().ChildKeyDeriv(ekey, i) newKey.setIndex(i) return newKey #newAddr = PyBtcAddress().createFromExtendedPublicKey(newKey) ############################################################################# #def createFromExtendedPublicKey(self, ekey): #pub65 = ekey.getPub() #chain = ekey.getChain() #newAddr = self.createFromPublicKeyData(pub65, chain) #newAddr.chainIndex = newAddr.getIndex() #return newAddr ############################################################################# #def deriveChildPublicKey(self, i): #newKey = HDWalletCrypto().ChildKeyDeriv(self.getExtendedPublicKey(), i) #newAddr = PyBtcAddress().createFromExtendedPublicKey(newKey) ############################################################################# # Copy the wallet file to backup def backupWalletFile(self, backupPath = None): '''Function that attempts to make a backup copy of the wallet to the file in a given path and returns whether or not the copy succeeded.''' # Assume upfront that the copy will work. retVal = True walletFileBackup = self.getWalletPath('backup') if backupPath == None \ else backupPath try: shutil.copy(self.walletPath, walletFileBackup) except IOError, errReason: LOGERROR('Unable to copy file %s' % backupPath) LOGERROR('Reason for copy failure: %s' % errReason) retVal = False return retVal ############################################################################# # THIS WAS CREATED ORIGINALLY TO SUPPORT BITSAFE INTEGRATION INTO ARMORY # But it's also a good first step into general BIP 32 support def createWalletFromMasterPubKey(self, masterHex, \ isActuallyNew=True, \ doRegisterWithBDM=True): # This function eats hex inputs, not sure why I chose to do that... p0 = masterHex.index('4104') + 2 pubkey = SecureBinaryData(hex_to_binary(masterHex[p0:p0+130])) c0 = masterHex.index('1220') + 4 chain = SecureBinaryData(hex_to_binary(masterHex[c0:c0+64])) # Create the root address object rootAddr = PyBtcAddress().createFromPublicKeyData( pubkey ) rootAddr.markAsRootAddr(chain) self.addrMap['ROOT'] = rootAddr ekey = self.getChildExtPubFromRoot(0) firstAddr = PyBtcAddress().createFromPublicKeyData(ekey.getPub()) firstAddr.chaincode = ekey.getChain() firstAddr.chainIndex = 0 first160 = firstAddr.getAddr160() # Update wallet object with the new data # NEW IN WALLET VERSION 1.35: unique ID is now based on # the first chained address: this guarantees that the unique ID # is based not only on the private key, BUT ALSO THE CHAIN CODE self.useEncryption = False self.addrMap[firstAddr.getAddr160()] = firstAddr self.uniqueIDBin = (ADDRBYTE + firstAddr.getAddr160()[:5])[::-1] self.uniqueIDB58 = binary_to_base58(self.uniqueIDBin) self.labelName = 'BitSafe Demo Wallet' self.labelDescr = 'We\'ll be lucky if this works!' self.lastComputedChainAddr160 = first160 self.lastComputedChainIndex = firstAddr.chainIndex self.highestUsedChainIndex = firstAddr.chainIndex-1 self.wltCreateDate = long(RightNow()) self.linearAddr160List = [first160] self.chainIndexMap[firstAddr.chainIndex] = first160 self.watchingOnly = True # We don't have to worry about atomic file operations when # creating the wallet: so we just do it naively here. newWalletFilePath = os.path.join(ARMORY_HOME_DIR, 'bitsafe_demo_%s.wallet' % self.uniqueIDB58) self.walletPath = newWalletFilePath if not newWalletFilePath: shortName = self.labelName .replace(' ','_') # This was really only needed when we were putting name in filename #for c in ',?;:\'"?/\\=+-|[]{}<>': #shortName = shortName.replace(c,'_') newName = buildWltFileName(self.uniqueIDB58) self.walletPath = os.path.join(ARMORY_HOME_DIR, newName) LOGINFO(' New wallet will be written to: %s', self.walletPath) newfile = open(self.walletPath, 'wb') fileData = BinaryPacker() # packHeader method writes KDF params and root address headerBytes = self.packHeader(fileData) # We make sure we have byte locations of the two addresses, to start self.addrMap[first160].walletByteLoc = headerBytes + 21 fileData.put(BINARY_CHUNK, '\x00' + first160 + firstAddr.serialize()) # Store the current localtime and blocknumber. Block number is always # accurate if available, but time may not be exactly right. Whenever # basing anything on time, please assume that it is up to one day off! time0,blk0 = getCurrTimeAndBlock() if isActuallyNew else (0,0) # Don't forget to sync the C++ wallet object self.cppWallet = Cpp.BtcWallet() self.cppWallet.addAddress_5_(rootAddr.getAddr160(), time0,blk0,time0,blk0) self.cppWallet.addAddress_5_(first160, time0,blk0,time0,blk0) # We might be holding the wallet temporarily and not ready to register it if doRegisterWithBDM: TheBDM.registerWallet(self.cppWallet, isFresh=isActuallyNew) # new wallet newfile.write(fileData.getBinaryString()) newfile.flush() os.fsync(newfile.fileno()) newfile.close() walletFileBackup = self.getWalletPath('backup') shutil.copy(self.walletPath, walletFileBackup) # Let's fill the address pool while we are unlocked # It will get a lot more expensive if we do it on the next unlock if doRegisterWithBDM: self.fillAddressPool(self.addrPoolSize, isActuallyNew=isActuallyNew) return self ############################################################################# def createNewWalletFromPKCC(self, plainPubKey, chaincode, newWalletFilePath=None, \ isActuallyNew=False, doRegisterWithBDM=True, \ skipBackupFile=False): """ This method will create a new wallet based on a root public key, chain code and wallet ID. """ # Is this needed? Just in case.... if self.calledFromBDM: LOGERROR('Called createNewWallet() from BDM method!') LOGERROR('Don\'t do this!') return None LOGINFO('***Creating watching-only wallet from a public key & chain code') # Prep for C++ usage, then create the root address object and first public # address and its Hash160. plainPubKey = SecureBinaryData(plainPubKey) chaincode = SecureBinaryData(chaincode) rootAddr = PyBtcAddress().createFromPublicKeyData(plainPubKey) rootAddr.markAsRootAddr(chaincode) firstAddr = rootAddr.extendAddressChain() first160 = firstAddr.getAddr160() # Update wallet object with the new data. # NEW IN WALLET VERSION 1.35: unique ID is now based on the first chained # address. This guarantees that the unique ID is based not only on the # private key, BUT ALSO THE CHAIN CODE. self.useEncryption = False self.watchingOnly = True self.wltCreateDate = long(RightNow()) self.addrMap['ROOT'] = rootAddr self.addrMap[firstAddr.getAddr160()] = firstAddr self.uniqueIDBin = (ADDRBYTE + firstAddr.getAddr160()[:5])[::-1] self.uniqueIDB58 = binary_to_base58(self.uniqueIDBin) self.labelName = (self.uniqueIDB58 + ' (Watch)')[:32] self.labelDescr = (self.uniqueIDB58 + ' (Watching-only copy)')[:256] self.lastComputedChainAddr160 = first160 self.lastComputedChainIndex = firstAddr.chainIndex self.highestUsedChainIndex = firstAddr.chainIndex-1 self.linearAddr160List = [first160] self.chainIndexMap[firstAddr.chainIndex] = first160 # We don't have to worry about atomic file operations when creating the # wallet, so we just do it here, naively. self.walletPath = newWalletFilePath if not newWalletFilePath: shortName = self.labelName .replace(' ','_') # This was really only needed when we were putting name in filename #for c in ',?;:\'"?/\\=+-|[]{}<>': #shortName = shortName.replace(c,'_') newName = 'armory_%s_.WatchOnly.wallet' % self.uniqueIDB58 self.walletPath = os.path.join(ARMORY_HOME_DIR, newName) # Start writing the wallet. LOGINFO(' New wallet will be written to: %s', self.walletPath) newfile = open(self.walletPath, 'wb') fileData = BinaryPacker() # packHeader method writes KDF params and root address headerBytes = self.packHeader(fileData) # We make sure we have byte locations of the two addresses, to start self.addrMap[first160].walletByteLoc = headerBytes + 21 fileData.put(BINARY_CHUNK, '\x00' + first160 + firstAddr.serialize()) # Store the current localtime and blocknumber. Block number is always # accurate if available, but time may not be exactly right. Whenever # basing anything on time, please assume that it is up to one day off! time0,blk0 = getCurrTimeAndBlock() if isActuallyNew else (0,0) # Don't forget to sync the C++ wallet object. self.cppWallet = Cpp.BtcWallet() self.cppWallet.addScrAddress_5_(Hash160ToScrAddr(rootAddr.getAddr160()), \ time0,blk0,time0,blk0) self.cppWallet.addScrAddress_5_(Hash160ToScrAddr(first160), \ time0,blk0,time0,blk0) # We'll probably want to register the new wallet for the necessary rescan. if doRegisterWithBDM: TheBDM.registerWallet(self.cppWallet, isFresh=isActuallyNew) # Write the actual wallet file and close it. Create a backup if necessary. newfile.write(fileData.getBinaryString()) newfile.close() if not skipBackupFile: walletFileBackup = self.getWalletPath('backup') shutil.copy(self.walletPath, walletFileBackup) # Let's fill the address pool while we are unlocked. It will get a lot # more expensive if we do it on the next unlock. if doRegisterWithBDM: self.fillAddressPool(self.addrPoolSize, isActuallyNew=isActuallyNew) return self ############################################################################# def createNewWallet(self, newWalletFilePath=None, \ plainRootKey=None, chaincode=None, \ withEncrypt=True, IV=None, securePassphrase=None, \ kdfTargSec=DEFAULT_COMPUTE_TIME_TARGET, \ kdfMaxMem=DEFAULT_MAXMEM_LIMIT, \ shortLabel='', longLabel='', isActuallyNew=True, \ doRegisterWithBDM=True, skipBackupFile=False, \ extraEntropy=None, Progress=emptyFunc, armoryHomeDir = ARMORY_HOME_DIR): """ This method will create a new wallet, using as much customizability as you want. You can enable encryption, and set the target params of the key-derivation function (compute-time and max memory usage). The KDF parameters will be experimentally determined to be as hard as possible for your computer within the specified time target (default, 0.25s). It will aim for maximizing memory usage and using only 1 or 2 iterations of it, but this can be changed by scaling down the kdfMaxMem parameter (default 32 MB). If you use encryption, don't forget to supply a 32-byte passphrase, created via SecureBinaryData(pythonStr). This method will apply the passphrase so that the wallet is "born" encrypted. The field plainRootKey could be used to recover a written backup of a wallet, since all addresses are deterministically computed from the root address. This obviously won't reocver any imported keys, but does mean that you can recover your ENTIRE WALLET from only those 32 plaintext bytes AND the 32-byte chaincode. We skip the atomic file operations since we don't even have a wallet file yet to safely update. DO NOT CALL THIS FROM BDM METHOD. IT MAY DEADLOCK. """ if self.calledFromBDM: LOGERROR('Called createNewWallet() from BDM method!') LOGERROR('Don\'t do this!') return None if securePassphrase: securePassphrase = SecureBinaryData(securePassphrase) if plainRootKey: plainRootKey = SecureBinaryData(plainRootKey) if chaincode: chaincode = SecureBinaryData(chaincode) if withEncrypt and not securePassphrase: raise EncryptionError('Cannot create encrypted wallet without passphrase') LOGINFO('***Creating new deterministic wallet') # Set up the KDF if not withEncrypt: self.kdfKey = None else: LOGINFO('(with encryption)') self.kdf = KdfRomix() LOGINFO('Target (time,RAM)=(%0.3f,%d)', kdfTargSec, kdfMaxMem) (mem,niter,salt) = self.computeSystemSpecificKdfParams( \ kdfTargSec, kdfMaxMem) self.kdf.usePrecomputedKdfParams(mem, niter, salt) self.kdfKey = self.kdf.DeriveKey(securePassphrase) if not plainRootKey: # TODO: We should find a source for injecting extra entropy # At least, Crypto++ grabs from a few different sources, itself if not extraEntropy: extraEntropy = SecureBinaryData(0) plainRootKey = SecureBinaryData().GenerateRandom(32, extraEntropy) if not chaincode: #chaincode = SecureBinaryData().GenerateRandom(32) # For wallet 1.35a, derive chaincode deterministically from root key # The root key already has 256 bits of entropy which is excessive, # anyway. And my original reason for having the chaincode random is # no longer valid. chaincode = DeriveChaincodeFromRootKey(plainRootKey) # Create the root address object rootAddr = PyBtcAddress().createFromPlainKeyData( \ plainRootKey, \ IV16=IV, \ willBeEncr=withEncrypt, \ generateIVIfNecessary=True) rootAddr.markAsRootAddr(chaincode) # This does nothing if no encryption rootAddr.lock(self.kdfKey) rootAddr.unlock(self.kdfKey) firstAddr = rootAddr.extendAddressChain(self.kdfKey) first160 = firstAddr.getAddr160() # Update wallet object with the new data # NEW IN WALLET VERSION 1.35: unique ID is now based on # the first chained address: this guarantees that the unique ID # is based not only on the private key, BUT ALSO THE CHAIN CODE self.useEncryption = withEncrypt self.addrMap['ROOT'] = rootAddr self.addrMap[firstAddr.getAddr160()] = firstAddr self.uniqueIDBin = (ADDRBYTE + firstAddr.getAddr160()[:5])[::-1] self.uniqueIDB58 = binary_to_base58(self.uniqueIDBin) self.labelName = shortLabel[:32] # aka "Wallet Name" self.labelDescr = longLabel[:256] # aka "Description" self.lastComputedChainAddr160 = first160 self.lastComputedChainIndex = firstAddr.chainIndex self.highestUsedChainIndex = firstAddr.chainIndex-1 self.wltCreateDate = long(RightNow()) self.linearAddr160List = [first160] self.chainIndexMap[firstAddr.chainIndex] = first160 # We don't have to worry about atomic file operations when # creating the wallet: so we just do it naively here. self.walletPath = newWalletFilePath if not newWalletFilePath: shortName = self.labelName .replace(' ','_') # This was really only needed when we were putting name in filename #for c in ',?;:\'"?/\\=+-|[]{}<>': #shortName = shortName.replace(c,'_') newName = buildWltFileName(self.uniqueIDB58) self.walletPath = os.path.join(armoryHomeDir, newName) LOGINFO(' New wallet will be written to: %s', self.walletPath) newfile = open(self.walletPath, 'wb') fileData = BinaryPacker() # packHeader method writes KDF params and root address headerBytes = self.packHeader(fileData) # We make sure we have byte locations of the two addresses, to start self.addrMap[first160].walletByteLoc = headerBytes + 21 fileData.put(BINARY_CHUNK, '\x00' + first160 + firstAddr.serialize()) # Store the current localtime and blocknumber. Block number is always # accurate if available, but time may not be exactly right. Whenever # basing anything on time, please assume that it is up to one day off! time0,blk0 = getCurrTimeAndBlock() if isActuallyNew else (0,0) # Don't forget to sync the C++ wallet object self.cppWallet = Cpp.BtcWallet() self.cppWallet.addScrAddress_5_(Hash160ToScrAddr(rootAddr.getAddr160()), \ time0,blk0,time0,blk0) self.cppWallet.addScrAddress_5_(Hash160ToScrAddr(first160), \ time0,blk0,time0,blk0) # We might be holding the wallet temporarily and not ready to register it if doRegisterWithBDM: TheBDM.registerWallet(self.cppWallet, isFresh=isActuallyNew) # new wallet newfile.write(fileData.getBinaryString()) newfile.close() if not skipBackupFile: walletFileBackup = self.getWalletPath('backup') shutil.copy(self.walletPath, walletFileBackup) # Lock/unlock to make sure encrypted keys are computed and written to file if self.useEncryption: self.unlock(secureKdfOutput=self.kdfKey, Progress=Progress) # Let's fill the address pool while we are unlocked # It will get a lot more expensive if we do it on the next unlock if doRegisterWithBDM: self.fillAddressPool(self.addrPoolSize, isActuallyNew=isActuallyNew, Progress=Progress) if self.useEncryption: self.lock() return self ############################################################################# def advanceHighestIndex(self, ct=1): topIndex = self.highestUsedChainIndex + ct topIndex = min(topIndex, self.lastComputedChainIndex) topIndex = max(topIndex, 0) self.highestUsedChainIndex = topIndex self.walletFileSafeUpdate( [[WLT_UPDATE_MODIFY, self.offsetTopUsed, \ int_to_binary(self.highestUsedChainIndex, widthBytes=8)]]) self.fillAddressPool() ############################################################################# def rewindHighestIndex(self, ct=1): self.advanceHighestIndex(-ct) ############################################################################# def peekNextUnusedAddr160(self): try: return self.getAddress160ByChainIndex(self.highestUsedChainIndex+1) except: # Not sure why we'd fail, maybe addrPoolSize==0? return '' ############################################################################# def getNextUnusedAddress(self): if self.lastComputedChainIndex - self.highestUsedChainIndex < \ max(self.addrPoolSize-1,1): self.fillAddressPool(self.addrPoolSize) self.advanceHighestIndex(1) new160 = self.getAddress160ByChainIndex(self.highestUsedChainIndex) self.addrMap[new160].touch() self.walletFileSafeUpdate( [[WLT_UPDATE_MODIFY, \ self.addrMap[new160].walletByteLoc, \ self.addrMap[new160].serialize()]] ) return self.addrMap[new160] ############################################################################# def computeNextAddress(self, addr160=None, isActuallyNew=True, doRegister=True): """ Use this to extend the chain beyond the last-computed address. We will usually be computing the next address from the tip of the chain, but I suppose someone messing with the file format may leave gaps in the chain requiring some to be generated in the middle (then we can use the addr160 arg to specify which address to extend) """ if not addr160: addr160 = self.lastComputedChainAddr160 newAddr = self.addrMap[addr160].extendAddressChain(self.kdfKey) new160 = newAddr.getAddr160() newDataLoc = self.walletFileSafeUpdate( \ [[WLT_UPDATE_ADD, WLT_DATATYPE_KEYDATA, new160, newAddr]]) self.addrMap[new160] = newAddr self.addrMap[new160].walletByteLoc = newDataLoc[0] + 21 if newAddr.chainIndex > self.lastComputedChainIndex: self.lastComputedChainAddr160 = new160 self.lastComputedChainIndex = newAddr.chainIndex self.linearAddr160List.append(new160) self.chainIndexMap[newAddr.chainIndex] = new160 # In the future we will enable first/last seen, but not yet time0,blk0 = getCurrTimeAndBlock() if isActuallyNew else (0,0) self.cppWallet.addScrAddress_5_(Hash160ToScrAddr(new160), \ time0,blk0,time0,blk0) # For recovery rescans, this method will be called directly by # the BDM, which may cause a deadlock if we go through the # thread queue. The calledFromBDM is "permission" to access the # BDM private methods directly if doRegister: if self.calledFromBDM: TheBDM.registerScrAddr_bdm_direct(Hash160ToScrAddr(new160), timeInfo=isActuallyNew) else: # This uses the thread queue, which means the address will be # registered next time the BDM is not busy TheBDM.registerScrAddr(Hash160ToScrAddr(new160), isFresh=isActuallyNew) return new160 ############################################################################# def fillAddressPool(self, numPool=None, isActuallyNew=True, doRegister=True, Progress=emptyFunc): """ Usually, when we fill the address pool, we are generating addresses for the first time, and thus there is no chance it's ever seen the blockchain. However, this method is also used for recovery/import of wallets, where the address pool has addresses that probably have transactions already in the blockchain. """ if not numPool: numPool = self.addrPoolSize gap = self.lastComputedChainIndex - self.highestUsedChainIndex numToCreate = max(numPool - gap, 0) for i in range(numToCreate): Progress(i+1, numToCreate) self.computeNextAddress(isActuallyNew=isActuallyNew, doRegister=doRegister) #dlgPrg.UpdateHBar(i+1) return self.lastComputedChainIndex ############################################################################# def setAddrPoolSize(self, newSize): if newSize<5: LOGERROR('Will not allow address pool sizes smaller than 5...') return self.addrPoolSize = newSize self.fillAddressPool(newSize) ############################################################################# def getHighestUsedIndex(self): """ This only retrieves the stored value, but it may not be correct if, for instance, the wallet was just imported but has been used before. """ return self.highestUsedChainIndex ############################################################################# def getHighestComputedIndex(self): """ This only retrieves the stored value, but it may not be correct if, for instance, the wallet was just imported but has been used before. """ return self.lastComputedChainIndex ############################################################################# def detectHighestUsedIndex(self, writeResultToWallet=False, fullscan=False): """ This method is used to find the highestUsedChainIndex value of the wallet WITHIN its address pool. It will NOT extend its address pool in this search, because it is assumed that the wallet couldn't have used any addresses it had not calculated yet. If you have a wallet IMPORT, though, or a wallet that has been used before but does not have this information stored with it, then you should be using the next method: self.freshImportFindHighestIndex() which will actually extend the address pool as necessary to find the highest address used. """ if not TheBDM.getBDMState()=='BlockchainReady' and not self.calledFromBDM: LOGERROR('Cannot detect any usage information without the blockchain') return -1 oldSync = self.doBlockchainSync self.doBlockchainSync = BLOCKCHAIN_READONLY if fullscan: # Will initiate rescan if wallet is dirty self.syncWithBlockchain(self.lastSyncBlockNum) else: # Will only use data already scanned, even if wallet is dirty self.syncWithBlockchainLite(self.lastSyncBlockNum) self.doBlockchainSync = oldSync highestIndex = max(self.highestUsedChainIndex, 0) for addr in self.getLinearAddrList(withAddrPool=True): a160 = addr.getAddr160() if len(self.getAddrTxLedger(a160)) > 0: highestIndex = max(highestIndex, addr.chainIndex) if writeResultToWallet: self.highestUsedChainIndex = highestIndex self.walletFileSafeUpdate( [[WLT_UPDATE_MODIFY, self.offsetTopUsed, \ int_to_binary(highestIndex, widthBytes=8)]]) return highestIndex ############################################################################# @TimeThisFunction def freshImportFindHighestIndex(self, stepSize=None): """ This is much like detectHighestUsedIndex, except this will extend the address pool as necessary. It assumes that you have a fresh wallet that has been used before, but was deleted and restored from its root key and chaincode, and thus we don't know if only 10 or 10,000 addresses were used. If this was an exceptionally active wallet, it's possible that we may need to manually increase the step size to be sure we find everything. In fact, there is no way to tell FOR SURE what is the last addressed used: one must make an assumption that the wallet never calculated more than X addresses without receiving a payment... """ if not stepSize: stepSize = self.addrPoolSize topCompute = 0 topUsed = 0 oldPoolSize = self.addrPoolSize self.addrPoolSize = stepSize # When we hit the highest address, the topCompute value will extend # out [stepsize] addresses beyond topUsed, and the topUsed will not # change, thus escaping the while loop nWhile = 0 while topCompute - topUsed < 0.9*stepSize: topCompute = self.fillAddressPool(stepSize, isActuallyNew=False) topUsed = self.detectHighestUsedIndex(True) nWhile += 1 if nWhile>10000: raise WalletAddressError('Escaping inf loop in freshImport...') self.addrPoolSize = oldPoolSize return topUsed ############################################################################# def writeFreshWalletFile(self, path, newName='', newDescr=''): newFile = open(path, 'wb') bp = BinaryPacker() self.packHeader(bp) newFile.write(bp.getBinaryString()) for addr160,addrObj in self.addrMap.iteritems(): if not addr160=='ROOT': newFile.write('\x00' + addr160 + addrObj.serialize()) for hashVal,comment in self.commentsMap.iteritems(): twoByteLength = int_to_binary(len(comment), widthBytes=2) if len(hashVal)==20: typestr = int_to_binary(WLT_DATATYPE_ADDRCOMMENT) newFile.write(typestr + hashVal + twoByteLength + comment) elif len(hashVal)==32: typestr = int_to_binary(WLT_DATATYPE_TXCOMMENT) newFile.write(typestr + hashVal + twoByteLength + comment) newFile.close() ############################################################################# def makeUnencryptedWalletCopy(self, newPath, securePassphrase=None): self.writeFreshWalletFile(newPath) if not self.useEncryption: return True if self.isLocked: if not securePassphrase: LOGERROR('Attempted to make unencrypted copy without unlocking') return False else: self.unlock(securePassphrase=SecureBinaryData(securePassphrase)) newWlt = PyBtcWallet().readWalletFile(newPath) newWlt.unlock(self.kdfKey) newWlt.changeWalletEncryption(None) walletFileBackup = newWlt.getWalletPath('backup') if os.path.exists(walletFileBackup): LOGINFO('New wallet created, deleting backup file') os.remove(walletFileBackup) return True ############################################################################# def makeEncryptedWalletCopy(self, newPath, securePassphrase=None): """ Unlike the previous method, I can't just copy it if it's unencrypted, because the target device probably shouldn't be exposed to the unencrypted wallet. So for that case, we will encrypt the wallet in place, copy, then remove the encryption. """ if self.useEncryption: # Encrypted->Encrypted: Easy! self.writeFreshWalletFile(newPath) return True if not securePassphrase: LOGERROR("Tried to make encrypted copy, but no passphrase supplied") return False # If we're starting unencrypted...encrypt it in place (mem,nIter,salt) = self.computeSystemSpecificKdfParams(0.25) self.changeKdfParams(mem, nIter, salt) self.changeWalletEncryption(securePassphrase=securePassphrase) # Write the encrypted wallet to the target directory self.writeFreshWalletFile(newPath) # Unencrypt the wallet now self.unlock(securePassphrase=securePassphrase) self.changeWalletEncryption(None) return True ############################################################################# def getRootPKCC(self, pkIsCompressed=False): '''Get the root public key and chain code for this wallet. The key may be compressed or uncompressed.''' root = self.addrMap['ROOT'] wltRootPubKey = root.binPublicKey65.copy().toBinStr() wltChainCode = root.chaincode.copy().toBinStr() # Neither should happen, but just in case.... if len(wltRootPubKey) != 65: QMessageBox.critical(self, 'There\'s something wrong with your', \ 'watching-only wallet! The root public key can\'t be retrieved.', \ QMessageBox.Ok) self.accept() return if len(wltChainCode) != 32: QMessageBox.critical(self, 'There\'s something wrong with your', \ 'watching-only wallet! The root chain code can\'t be retrieved.', \ QMessageBox.Ok) self.accept() return # Finish assembling data for the final output. if pkIsCompressed == True: wltRootCompPubKey = \ CryptoECDSA().CompressPoint(SecureBinaryData(wltRootPubKey)) wltRootPubKey = wltRootCompPubKey.toBinStr() return (wltRootPubKey, wltChainCode) ############################################################################# def getRootPKCCBackupData(self, pkIsCompressed=True, et16=True): ''' Get the root public key and chain code for this wallet. The root pub key/chain code output format will be as follows. All data will be output in EasyType16 format. ---PART 1: Root Data ID (9 bytes)--- - Compressed pub key's "sign byte" flag (mask 0x80) + root data format version (mask 0x7F) (1 byte) - Wallet ID (6 bytes) - Checksum of the initial byte + the wallet ID (2 bytes) ---PART 2: Root Data (64 bytes)--- - Compressed public key minus the first ("sign") byte (32 bytes) - Chain code (32 bytes) ''' # Get the root pub key & chain code. The key will be compressed. self.wltRootPubKey, self.wltChainCode = self.getRootPKCC(True) # The "version byte" will actually contain the root data format version # (mask 0x7F) and a bit (mask 0x80) indicating if the first byte of the # compressed public key is 0x02 (0) or 0x03 (1). Done so that the ET16 # output of the PK & CC will cover 4 lines, with a 5th chunk of data # containing everything else. rootPKCCFormatVer = PYROOTPKCCVER if self.wltRootPubKey[0] == '\x03': rootPKCCFormatVer ^= 0x80 # Produce the root ID object. Convert to ET16 if necessary. wltRootIDConcat = int_to_binary(rootPKCCFormatVer) + self.uniqueIDBin rootIDConcatChksum = computeChecksum(wltRootIDConcat, nBytes=2) wltRootIDConcat += rootIDConcatChksum if et16 == True: lineNoSpaces = binary_to_easyType16(wltRootIDConcat) pcs = [lineNoSpaces[i*4:(i+1)*4] for i in range((len(lineNoSpaces)-1)/4+1)] wltRootIDConcat = ' '.join(pcs) # Get 4 rows of PK & CC data. Convert to ET16 data if necessary. pkccLines = [] wltPKCCConcat = self.wltRootPubKey[1:] + self.wltChainCode for i in range(0, len(wltPKCCConcat), 16): concatData = wltPKCCConcat[i:i+16] if et16 == True: concatData = makeSixteenBytesEasy(concatData) pkccLines.append(concatData) # Return the root ID & the PK/CC data. return (wltRootIDConcat, pkccLines) ############################################################################# def writePKCCFile(self, newPath): '''Make a copy of this wallet with only the public key and chain code.''' # Open the PKCC file for writing. newFile = open(newPath, 'wb') # Write the data to the file. The file format is as follows: # PKCC data format version (UINT8) # Root ID (VAR_STR) # Number of PKCC lines (UINT8) # PKCC lines (VAR_STR) outRootIDET16, outPKCCET16Lines = self.getRootPKCCBackupData(True) newFile.write(str(PYROOTPKCCVER) + '\n') newFile.write(outRootIDET16 + '\n') for a in outPKCCET16Lines: newFile.write(a + '\n') # Clean everything up. newFile.close() ############################################################################# def forkOnlineWallet(self, newWalletFile, shortLabel='', longLabel=''): """ Make a copy of this wallet that contains no private key data """ if not self.addrMap['ROOT'].hasPrivKey(): LOGWARN('This wallet is already void of any private key data!') LOGWARN('Aborting wallet fork operation.') onlineWallet = PyBtcWallet() onlineWallet.fileTypeStr = self.fileTypeStr onlineWallet.version = self.version onlineWallet.magicBytes = self.magicBytes onlineWallet.wltCreateDate = self.wltCreateDate onlineWallet.useEncryption = False onlineWallet.watchingOnly = True if not shortLabel: shortLabel = self.labelName if not longLabel: longLabel = self.labelDescr onlineWallet.labelName = (shortLabel + ' (Watch)')[:32] onlineWallet.labelDescr = (longLabel + ' (Watching-only copy)')[:256] newAddrMap = {} for addr160,addrObj in self.addrMap.iteritems(): onlineWallet.addrMap[addr160] = addrObj.copy() onlineWallet.addrMap[addr160].binPrivKey32_Encr = SecureBinaryData() onlineWallet.addrMap[addr160].binPrivKey32_Plain = SecureBinaryData() onlineWallet.addrMap[addr160].binInitVector16 = SecureBinaryData() onlineWallet.addrMap[addr160].useEncryption = False onlineWallet.addrMap[addr160].createPrivKeyNextUnlock = False onlineWallet.commentsMap = self.commentsMap onlineWallet.opevalMap = self.opevalMap onlineWallet.uniqueIDBin = self.uniqueIDBin onlineWallet.highestUsedChainIndex = self.highestUsedChainIndex onlineWallet.lastComputedChainAddr160 = self.lastComputedChainAddr160 onlineWallet.lastComputedChainIndex = self.lastComputedChainIndex onlineWallet.writeFreshWalletFile(newWalletFile, shortLabel, longLabel) return onlineWallet ############################################################################# def supplyRootKeyForWatchingOnlyWallet(self, securePlainRootKey32, \ permanent=False): """ If you have a watching only wallet, you might want to upgrade it to a full wallet by supplying the 32-byte root private key. Generally, this will be used to make a 'permanent' upgrade to your wallet, and the new keys will be written to file ( NOTE: you should setup encryption just after doing this, to make sure that the plaintext keys get wiped from your wallet file). On the other hand, if you don't want this to be a permanent upgrade, this could potentially be used to maintain a watching only wallet on your harddrive, and actually plug in your plaintext root key instead of an encryption password whenever you want sign transactions. """ pass ############################################################################# def touchAddress(self, addr20): """ Use this to update your wallet file to recognize the first/last times seen for the address. This information will improve blockchain search speed, if it knows not to search transactions that happened before they were created. """ pass ############################################################################# def testKdfComputeTime(self): """ Experimentally determines the compute time required by this computer to execute with the current key-derivation parameters. This may be useful for when you transfer a wallet to a new computer that has different speed/memory characteristic. """ testPassphrase = SecureBinaryData('This is a simple passphrase') start = RightNow() self.kdf.DeriveKey(testPassphrase) self.testedComputeTime = (RightNow()-start) return self.testedComputeTime ############################################################################# def serializeKdfParams(self, kdfObj=None, binWidth=256): """ Pack key-derivation function parameters into a binary stream. As of wallet version 1.0, there is only one KDF technique used in these wallets, and thus we only need to store the parameters of this KDF. In the future, we may have multiple KDFs and have to store the selection in this serialization. """ if not kdfObj: kdfObj = self.kdf if not kdfObj: return '\x00'*binWidth binPacker = BinaryPacker() binPacker.put(UINT64, kdfObj.getMemoryReqtBytes()) binPacker.put(UINT32, kdfObj.getNumIterations()) binPacker.put(BINARY_CHUNK, kdfObj.getSalt().toBinStr(), width=32) kdfStr = binPacker.getBinaryString() binPacker.put(BINARY_CHUNK, computeChecksum(kdfStr,4), width=4) padSize = binWidth - binPacker.getSize() binPacker.put(BINARY_CHUNK, '\x00'*padSize) return binPacker.getBinaryString() ############################################################################# def unserializeKdfParams(self, toUnpack, binWidth=256): if isinstance(toUnpack, BinaryUnpacker): binUnpacker = toUnpack else: binUnpacker = BinaryUnpacker(toUnpack) allKdfData = binUnpacker.get(BINARY_CHUNK, 44) kdfChksum = binUnpacker.get(BINARY_CHUNK, 4) kdfBytes = len(allKdfData) + len(kdfChksum) padding = binUnpacker.get(BINARY_CHUNK, binWidth-kdfBytes) if allKdfData=='\x00'*44: return None fixedKdfData = verifyChecksum(allKdfData, kdfChksum) if len(fixedKdfData)==0: raise UnserializeError('Corrupted KDF params, could not fix') elif not fixedKdfData==allKdfData: self.walletFileSafeUpdate( \ [[WLT_UPDATE_MODIFY, self.offsetKdfParams, fixedKdfData]]) allKdfData = fixedKdfData LOGWARN('KDF params in wallet were corrupted, but fixed') kdfUnpacker = BinaryUnpacker(allKdfData) mem = kdfUnpacker.get(UINT64) nIter = kdfUnpacker.get(UINT32) salt = kdfUnpacker.get(BINARY_CHUNK, 32) kdf = KdfRomix(mem, nIter, SecureBinaryData(salt)) return kdf ############################################################################# def serializeCryptoParams(self, binWidth=256): """ As of wallet version 1.0, all wallets use the exact same encryption types, so there is nothing to serialize or unserialize. The 256 bytes here may be used in the future, though. """ return '\x00'*binWidth ############################################################################# def unserializeCryptoParams(self, toUnpack, binWidth=256): """ As of wallet version 1.0, all wallets use the exact same encryption types, so there is nothing to serialize or unserialize. The 256 bytes here may be used in the future, though. """ if isinstance(toUnpack, BinaryUnpacker): binUnpacker = toUnpack else: binUnpacker = BinaryUnpacker(toUnpack) binUnpacker.get(BINARY_CHUNK, binWidth) return CryptoAES() ############################################################################# def verifyPassphrase(self, securePassphrase): """ Verify a user-submitted passphrase. This passphrase goes into the key-derivation function to get actual encryption key, which is what actually needs to be verified Since all addresses should have the same encryption, we only need to verify correctness on the root key """ kdfOutput = self.kdf.DeriveKey(securePassphrase) try: isValid = self.addrMap['ROOT'].verifyEncryptionKey(kdfOutput) return isValid finally: kdfOutput.destroy() ############################################################################# def verifyEncryptionKey(self, secureKdfOutput): """ Verify the underlying encryption key (from KDF). Since all addresses should have the same encryption, we only need to verify correctness on the root key. """ return self.addrMap['ROOT'].verifyEncryptionKey(secureKdfOutput) ############################################################################# def computeSystemSpecificKdfParams(self, targetSec=0.25, maxMem=32*1024*1024): """ WARNING!!! DO NOT CHANGE KDF PARAMS AFTER ALREADY ENCRYPTED THE WALLET By changing them on an already-encrypted wallet, we are going to lose the original AES256-encryption keys -- which are uniquely determined by (numIter, memReqt, salt, passphrase) Only use this method before you have encrypted your wallet, in order to determine good KDF parameters based on your computer's specific speed/memory capabilities. """ kdf = KdfRomix() kdf.computeKdfParams(targetSec, long(maxMem)) mem = kdf.getMemoryReqtBytes() nIter = kdf.getNumIterations() salt = SecureBinaryData(kdf.getSalt().toBinStr()) return (mem, nIter, salt) ############################################################################# def restoreKdfParams(self, mem, numIter, secureSalt): """ This method should only be used when we are loading an encrypted wallet from file. DO NOT USE THIS TO CHANGE KDF PARAMETERS. Doing so may result in data loss! """ self.kdf = KdfRomix(mem, numIter, secureSalt) ############################################################################# def changeKdfParams(self, mem, numIter, salt, securePassphrase=None): """ Changing KDF changes the wallet encryption key which means that a KDF change is essentially the same as an encryption key change. As such, the wallet must be unlocked if you intend to change an already- encrypted wallet with KDF. TODO: this comment doesn't belong here...where does it go? : If the KDF is NOT yet setup, this method will do it. Supply the target compute time, and maximum memory requirements, and the underlying C++ code will experimentally determine the "hardest" key-derivation params that will run within the specified time and memory usage on the system executing this method. You should set the max memory usage very low (a few kB) for devices like smartphones, which have limited memory availability. The KDF will then use less memory but more iterations to achieve the same compute time. """ if self.useEncryption: if not securePassphrase: LOGERROR('') LOGERROR('You have requested changing the key-derivation') LOGERROR('parameters on an already-encrypted wallet, which') LOGERROR('requires modifying the encryption on this wallet.') LOGERROR('Please unlock your wallet before attempting to') LOGERROR('change the KDF parameters.') raise WalletLockError('Cannot change KDF without unlocking wallet') elif not self.verifyPassphrase(securePassphrase): LOGERROR('Incorrect passphrase to unlock wallet') raise PassphraseError('Incorrect passphrase to unlock wallet') secureSalt = SecureBinaryData(salt) newkdf = KdfRomix(mem, numIter, secureSalt) bp = BinaryPacker() bp.put(BINARY_CHUNK, self.serializeKdfParams(newkdf), width=256) updList = [[WLT_UPDATE_MODIFY, self.offsetKdfParams, bp.getBinaryString()]] if not self.useEncryption: # We may be setting the kdf params before enabling encryption self.walletFileSafeUpdate(updList) else: # Must change the encryption key: and we won't get here unless # we have a passphrase to use. This call will take the self.changeWalletEncryption(securePassphrase=securePassphrase, \ extraFileUpdates=updList, kdfObj=newkdf) self.kdf = newkdf ############################################################################# def changeWalletEncryption(self, secureKdfOutput=None, \ securePassphrase=None, \ extraFileUpdates=[], kdfObj=None, Progress=emptyFunc): """ Supply the passphrase you would like to use to encrypt this wallet (or supply the KDF output directly, to skip the passphrase part). This method will attempt to re-encrypt with the new passphrase. This fails if the wallet is already locked with a different passphrase. If encryption is already enabled, please unlock the wallet before calling this method. Make sure you set up the key-derivation function (KDF) before changing from an unencrypted to an encrypted wallet. An error will be thrown if you don't. You can use something like the following # For a target of 0.05-0.1s compute time: (mem,nIter,salt) = wlt.computeSystemSpecificKdfParams(0.1) wlt.changeKdfParams(mem, nIter, salt) Use the extraFileUpdates to pass in other changes that need to be written to the wallet file in the same atomic operation as the encryption key modifications. """ if not kdfObj: kdfObj = self.kdf oldUsedEncryption = self.useEncryption if securePassphrase or secureKdfOutput: newUsesEncryption = True else: newUsesEncryption = False oldKdfKey = None if oldUsedEncryption: if self.isLocked: raise WalletLockError('Must unlock wallet to change passphrase') else: oldKdfKey = self.kdfKey.copy() if newUsesEncryption and not self.kdf: raise EncryptionError('KDF must be setup before encrypting wallet') # Prep the file-update list with extras passed in as argument walletUpdateInfo = list(extraFileUpdates) # Derive the new KDF key if a passphrase was supplied newKdfKey = secureKdfOutput if securePassphrase: newKdfKey = self.kdf.DeriveKey(securePassphrase) if oldUsedEncryption and newUsesEncryption and self.verifyEncryptionKey(newKdfKey): LOGWARN('Attempting to change encryption to same passphrase!') return # Wallet is encrypted with the new passphrase already # With unlocked key data, put the rest in a try/except/finally block # To make sure we destroy the temporary kdf outputs try: # If keys were previously unencrypted, they will be not have # initialization vectors and need to be generated before encrypting. # This is why we have the enableKeyEncryption() call if not oldUsedEncryption==newUsesEncryption: # If there was an encryption change, we must change the flags # in the wallet file in the same atomic operation as changing # the stored keys. We can't let them get out of sync. self.useEncryption = newUsesEncryption walletUpdateInfo.append(self.createChangeFlagsEntry()) self.useEncryption = oldUsedEncryption # Restore the old flag just in case the file write fails newAddrMap = {} i=1 nAddr = len(self.addrMap) for addr160,addr in self.addrMap.iteritems(): Progress(i, nAddr) i = i +1 newAddrMap[addr160] = addr.copy() newAddrMap[addr160].enableKeyEncryption(generateIVIfNecessary=True) newAddrMap[addr160].changeEncryptionKey(oldKdfKey, newKdfKey) newAddrMap[addr160].walletByteLoc = addr.walletByteLoc walletUpdateInfo.append( \ [WLT_UPDATE_MODIFY, addr.walletByteLoc, newAddrMap[addr160].serialize()]) # Try to update the wallet file with the new encrypted key data updateSuccess = self.walletFileSafeUpdate( walletUpdateInfo ) if updateSuccess: # Finally give the new data to the user for addr160,addr in newAddrMap.iteritems(): self.addrMap[addr160] = addr.copy() self.useEncryption = newUsesEncryption if newKdfKey: self.lock() self.unlock(newKdfKey, Progress=Progress) finally: # Make sure we always destroy the temporary passphrase results if newKdfKey: newKdfKey.destroy() if oldKdfKey: oldKdfKey.destroy() ############################################################################# def getWalletPath(self, nameSuffix=None): fpath = self.walletPath if self.walletPath=='': fpath = os.path.join(ARMORY_HOME_DIR, buildWltFileName(self.uniqueIDB58)) if not nameSuffix==None: pieces = os.path.splitext(fpath) if not pieces[0].endswith('_'): fpath = pieces[0] + '_' + nameSuffix + pieces[1] else: fpath = pieces[0] + nameSuffix + pieces[1] return fpath ############################################################################# def getDisplayStr(self, pref="Wallet: "): return '%s"%s" (%s)' % (pref, self.labelName, self.uniqueIDB58) ############################################################################# def getCommentForAddress(self, addr160): if self.commentsMap.has_key(addr160): return self.commentsMap[addr160] else: return '' ############################################################################# def getComment(self, hashVal): """ This method is used for both address comments, as well as tx comments In the first case, use the 20-byte binary pubkeyhash. Use 32-byte tx hash for the tx-comment case. """ if self.commentsMap.has_key(hashVal): return self.commentsMap[hashVal] else: return '' ############################################################################# def setComment(self, hashVal, newComment): """ This method is used for both address comments, as well as tx comments In the first case, use the 20-byte binary pubkeyhash. Use 32-byte tx hash for the tx-comment case. """ updEntry = [] isNewComment = False if self.commentsMap.has_key(hashVal): # If there is already a comment for this address, overwrite it oldCommentLen = len(self.commentsMap[hashVal]) oldCommentLoc = self.commentLocs[hashVal] # The first 23 bytes are the datatype, hashVal, and 2-byte comment size offset = 1 + len(hashVal) + 2 updEntry.append([WLT_UPDATE_MODIFY, oldCommentLoc+offset, '\x00'*oldCommentLen]) else: isNewComment = True dtype = WLT_DATATYPE_ADDRCOMMENT if len(hashVal)>20: dtype = WLT_DATATYPE_TXCOMMENT updEntry.append([WLT_UPDATE_ADD, dtype, hashVal, newComment]) newCommentLoc = self.walletFileSafeUpdate(updEntry) self.commentsMap[hashVal] = newComment # If there was a wallet overwrite, it's location is the first element self.commentLocs[hashVal] = newCommentLoc[-1] ############################################################################# def getAddrCommentIfAvail(self, txHash): if not TheBDM.getBDMState()=='BlockchainReady': return self.getComment(txHash) # If we haven't extracted relevant addresses for this tx, yet -- do it if not self.txAddrMap.has_key(txHash): self.txAddrMap[txHash] = [] tx = TheBDM.getTxByHash(txHash) if tx.isInitialized(): for i in range(tx.getNumTxOut()): txout = tx.getTxOutCopy(i) stype = getTxOutScriptType(txout.getScript()) scrAddr = tx.getScrAddrForTxOut(i) if stype in CPP_TXOUT_HAS_ADDRSTR: addrStr = scrAddr_to_addrStr(scrAddr) addr160 = addrStr_to_hash160(addrStr)[1] if self.hasAddr(addr160): self.txAddrMap[txHash].append(addr160) else: pass #LOGERROR("Unrecognized scraddr: " + binary_to_hex(scrAddr)) addrComments = [] for a160 in self.txAddrMap[txHash]: if self.commentsMap.has_key(a160) and '[[' not in self.commentsMap[a160]: addrComments.append(self.commentsMap[a160]) return '; '.join(addrComments) ############################################################################# def getCommentForLE(self, le): # Smart comments for LedgerEntry objects: get any direct comments ... # if none, then grab the one for any associated addresses. txHash = le.getTxHash() if self.commentsMap.has_key(txHash): comment = self.commentsMap[txHash] else: # [[ COMMENTS ]] are not meant to be displayed on main ledger comment = self.getAddrCommentIfAvail(txHash) if comment.startswith('[[') and comment.endswith(']]'): comment = '' return comment ############################################################################# def setWalletLabels(self, lshort, llong=''): self.labelName = lshort self.labelDescr = llong toWriteS = lshort.ljust( 32, '\x00') toWriteL = llong.ljust(256, '\x00') updList = [] updList.append([WLT_UPDATE_MODIFY, self.offsetLabelName, toWriteS]) updList.append([WLT_UPDATE_MODIFY, self.offsetLabelDescr, toWriteL]) self.walletFileSafeUpdate(updList) ############################################################################# def packWalletFlags(self, binPacker): nFlagBytes = 8 flags = [False]*nFlagBytes*8 flags[0] = self.useEncryption flags[1] = self.watchingOnly flagsBitset = ''.join([('1' if f else '0') for f in flags]) binPacker.put(UINT64, bitset_to_int(flagsBitset)) ############################################################################# def createChangeFlagsEntry(self): """ Packs up the wallet flags and returns a update-entry that can be included in a walletFileSafeUpdate call. """ bp = BinaryPacker() self.packWalletFlags(bp) toWrite = bp.getBinaryString() return [WLT_UPDATE_MODIFY, self.offsetWltFlags, toWrite] ############################################################################# def unpackWalletFlags(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): flagData = toUnpack else: flagData = BinaryUnpacker( toUnpack ) wltflags = flagData.get(UINT64, 8) wltflags = int_to_bitset(wltflags, widthBytes=8) self.useEncryption = (wltflags[0]=='1') self.watchingOnly = (wltflags[1]=='1') ############################################################################# def packHeader(self, binPacker): if not self.addrMap['ROOT']: raise WalletAddressError('Cannot serialize uninitialzed wallet!') startByte = binPacker.getSize() binPacker.put(BINARY_CHUNK, self.fileTypeStr, width=8) binPacker.put(UINT32, getVersionInt(self.version)) binPacker.put(BINARY_CHUNK, self.magicBytes, width=4) # Wallet info flags self.offsetWltFlags = binPacker.getSize() - startByte self.packWalletFlags(binPacker) # Binary Unique ID (firstAddr25bytes[:5][::-1]) binPacker.put(BINARY_CHUNK, self.uniqueIDBin, width=6) # Unix time of wallet creations binPacker.put(UINT64, self.wltCreateDate) # User-supplied wallet label (short) self.offsetLabelName = binPacker.getSize() - startByte binPacker.put(BINARY_CHUNK, self.labelName , width=32) # User-supplied wallet label (long) self.offsetLabelDescr = binPacker.getSize() - startByte binPacker.put(BINARY_CHUNK, self.labelDescr, width=256) # Highest used address: self.offsetTopUsed = binPacker.getSize() - startByte binPacker.put(INT64, self.highestUsedChainIndex) # Key-derivation function parameters self.offsetKdfParams = binPacker.getSize() - startByte binPacker.put(BINARY_CHUNK, self.serializeKdfParams(), width=256) # Wallet encryption parameters (currently nothing to put here) self.offsetCrypto = binPacker.getSize() - startByte binPacker.put(BINARY_CHUNK, self.serializeCryptoParams(), width=256) # Address-chain root, (base-address for deterministic wallets) self.offsetRootAddr = binPacker.getSize() - startByte self.addrMap['ROOT'].walletByteLoc = self.offsetRootAddr binPacker.put(BINARY_CHUNK, self.addrMap['ROOT'].serialize()) # In wallet version 1.0, this next kB is unused -- may be used in future binPacker.put(BINARY_CHUNK, '\x00'*1024) return binPacker.getSize() - startByte ############################################################################# def unpackHeader(self, binUnpacker): """ Unpacking the header information from a wallet file. See the help text on the base class, PyBtcWallet, for more information on the wallet serialization. """ self.fileTypeStr = binUnpacker.get(BINARY_CHUNK, 8) self.version = readVersionInt(binUnpacker.get(UINT32)) self.magicBytes = binUnpacker.get(BINARY_CHUNK, 4) # Decode the bits to get the flags self.offsetWltFlags = binUnpacker.getPosition() self.unpackWalletFlags(binUnpacker) # This is the first 4 bytes of the 25-byte address-chain-root address # This includes the network byte (i.e. main network, testnet, namecoin) self.uniqueIDBin = binUnpacker.get(BINARY_CHUNK, 6) self.uniqueIDB58 = binary_to_base58(self.uniqueIDBin) self.wltCreateDate = binUnpacker.get(UINT64) # We now have both the magic bytes and network byte if not self.magicBytes == MAGIC_BYTES: LOGERROR('Requested wallet is for a different blockchain!') LOGERROR('Wallet is for: %s ', BLOCKCHAINS[self.magicBytes]) LOGERROR('ArmoryEngine: %s ', BLOCKCHAINS[MAGIC_BYTES]) return -1 if not self.uniqueIDBin[-1] == ADDRBYTE: LOGERROR('Requested wallet is for a different network!') LOGERROR('ArmoryEngine: %s ', NETWORKS[ADDRBYTE]) return -2 # User-supplied description/name for wallet self.offsetLabelName = binUnpacker.getPosition() self.labelName = binUnpacker.get(BINARY_CHUNK, 32).strip('\x00') # Longer user-supplied description/name for wallet self.offsetLabelDescr = binUnpacker.getPosition() self.labelDescr = binUnpacker.get(BINARY_CHUNK, 256).strip('\x00') self.offsetTopUsed = binUnpacker.getPosition() self.highestUsedChainIndex = binUnpacker.get(INT64) # Read the key-derivation function parameters self.offsetKdfParams = binUnpacker.getPosition() self.kdf = self.unserializeKdfParams(binUnpacker) # Read the crypto parameters self.offsetCrypto = binUnpacker.getPosition() self.crypto = self.unserializeCryptoParams(binUnpacker) # Read address-chain root address data self.offsetRootAddr = binUnpacker.getPosition() rawAddrData = binUnpacker.get(BINARY_CHUNK, self.pybtcaddrSize) self.addrMap['ROOT'] = PyBtcAddress().unserialize(rawAddrData) fixedAddrData = self.addrMap['ROOT'].serialize() if not rawAddrData==fixedAddrData: self.walletFileSafeUpdate([ \ [WLT_UPDATE_MODIFY, self.offsetRootAddr, fixedAddrData]]) self.addrMap['ROOT'].walletByteLoc = self.offsetRootAddr if self.useEncryption: self.addrMap['ROOT'].isLocked = True self.isLocked = True # In wallet version 1.0, this next kB is unused -- may be used in future binUnpacker.advance(1024) # TODO: automatic conversion if the code uses a newer wallet # version than the wallet... got a manual script, but it # would be nice to autodetect and correct #convertVersion return 0 #success ############################################################################# def unpackNextEntry(self, binUnpacker): dtype = binUnpacker.get(UINT8) hashVal = '' binData = '' if dtype==WLT_DATATYPE_KEYDATA: hashVal = binUnpacker.get(BINARY_CHUNK, 20) binData = binUnpacker.get(BINARY_CHUNK, self.pybtcaddrSize) elif dtype==WLT_DATATYPE_ADDRCOMMENT: hashVal = binUnpacker.get(BINARY_CHUNK, 20) commentLen = binUnpacker.get(UINT16) binData = binUnpacker.get(BINARY_CHUNK, commentLen) elif dtype==WLT_DATATYPE_TXCOMMENT: hashVal = binUnpacker.get(BINARY_CHUNK, 32) commentLen = binUnpacker.get(UINT16) binData = binUnpacker.get(BINARY_CHUNK, commentLen) elif dtype==WLT_DATATYPE_OPEVAL: raise NotImplementedError('OP_EVAL not support in wallet yet') elif dtype==WLT_DATATYPE_DELETED: deletedLen = binUnpacker.get(UINT16) binUnpacker.advance(deletedLen) return (dtype, hashVal, binData) ############################################################################# @TimeThisFunction def readWalletFile(self, wltpath, verifyIntegrity=True, doScanNow=False): if not os.path.exists(wltpath): raise FileExistsError("No wallet file:"+wltpath) self.__init__() self.walletPath = wltpath if verifyIntegrity: try: nError = self.doWalletFileConsistencyCheck() except KeyDataError, errmsg: LOGEXCEPT('***ERROR: Wallet file had unfixable errors.') raise KeyDataError(errmsg) wltfile = open(wltpath, 'rb') wltdata = BinaryUnpacker(wltfile.read()) wltfile.close() self.cppWallet = Cpp.BtcWallet() self.unpackHeader(wltdata) self.lastComputedChainIndex = -UINT32_MAX self.lastComputedChainAddr160 = None while wltdata.getRemainingSize()>0: byteLocation = wltdata.getPosition() dtype, hashVal, rawData = self.unpackNextEntry(wltdata) if dtype==WLT_DATATYPE_KEYDATA: newAddr = PyBtcAddress() newAddr.unserialize(rawData) newAddr.walletByteLoc = byteLocation + 21 # Fix byte errors in the address data fixedAddrData = newAddr.serialize() if not rawData==fixedAddrData: self.walletFileSafeUpdate([ \ [WLT_UPDATE_MODIFY, newAddr.walletByteLoc, fixedAddrData]]) if newAddr.useEncryption: newAddr.isLocked = True self.addrMap[hashVal] = newAddr if newAddr.chainIndex > self.lastComputedChainIndex: self.lastComputedChainIndex = newAddr.chainIndex self.lastComputedChainAddr160 = newAddr.getAddr160() if newAddr.chainIndex < -2: newAddr.chainIndex = -2 self.hasNegativeImports = True self.linearAddr160List.append(newAddr.getAddr160()) self.chainIndexMap[newAddr.chainIndex] = newAddr.getAddr160() # Update the parallel C++ object that scans the blockchain for us timeRng = newAddr.getTimeRange() blkRng = newAddr.getBlockRange() self.cppWallet.addScrAddress_5_(Hash160ToScrAddr(hashVal), \ timeRng[0], blkRng[0], \ timeRng[1], blkRng[1]) if dtype in (WLT_DATATYPE_ADDRCOMMENT, WLT_DATATYPE_TXCOMMENT): self.commentsMap[hashVal] = rawData # actually ASCII data, here self.commentLocs[hashVal] = byteLocation if dtype==WLT_DATATYPE_OPEVAL: raise NotImplementedError('OP_EVAL not support in wallet yet') if dtype==WLT_DATATYPE_DELETED: pass if (not doScanNow or \ not TheBDM.getBDMState()=='BlockchainReady' or \ self.doBlockchainSync==BLOCKCHAIN_DONOTUSE): pass else: self.syncWithBlockchain() ### Update the wallet version if necessary ### if getVersionInt(self.version) < getVersionInt(PYBTCWALLET_VERSION): LOGERROR('Wallets older than version 1.35 no longer supported!') return return self ############################################################################# def walletFileSafeUpdate(self, updateList): """ The input "toAddDataList" should be a list of triplets, such as: [ [WLT_DATA_ADD, WLT_DATATYPE_KEYDATA, addr160_1, PyBtcAddrObj1] [WLT_DATA_ADD, WLT_DATATYPE_KEYDATA, addr160_2, PyBtcAddrObj2] [WLT_DATA_MODIFY, modifyStartByte1, binDataForOverwrite1 ] [WLT_DATA_ADD, WLT_DATATYPE_ADDRCOMMENT, addr160_3, 'Long-term savings'] [WLT_DATA_MODIFY, modifyStartByte2, binDataForOverwrite2 ] ] The return value is the list of new file byte offsets (from beginning of the file), that specify the start of each modification made to the wallet file. For MODIFY fields, this just returns the modifyStartByte field that was provided as input. For adding data, it specifies the starting byte of the new field (the DATATYPE byte). We keep this data in PyBtcAddress objects so that we know where to apply modifications in case we need to change something, like converting from unencrypted to encrypted private keys. If this method fails, we simply return an empty list. We can check for an empty list to know if the file update succeeded. WHY IS THIS SO COMPLICATED? -- Because it's atomic! When we want to add data to the wallet file, we will do so in a completely recoverable way. We define this method to make sure a backup exists when we start modifying the file, and keep a flag to identify when the wallet might be corrupt. If we ever try to load the wallet file and see another file with the _update_unsuccessful suffix, we should instead just restore from backup. Similarly, we have to update the backup file after updating the main file so we will use a similar technique with the backup_unsuccessful suffix. We don't want to rely on a backup if somehow *the backup* got corrupted and the original file is fine. THEREFORE -- this is implemented in such a way that the user should know two things: (1) No matter when the power goes out, we ALWAYS have a uncorrupted wallet file, and know which one it is. Either the backup is safe, or the original is safe. Based on the flag files, we know which one is guaranteed to be not corrupted. (2) ALWAYS DO YOUR FILE OPERATIONS BEFORE SETTING DATA IN MEMORY You must write it to disk FIRST using this SafeUpdate method, THEN give the new data to the user -- never give it to them until you are sure that it was written safely to disk. Number (2) is easy to screw up because you plan to write the file just AFTER the data is created and stored in local memory. But an error might be thrown halfway which is handled higher up, and instead the data never made it to file. Then there is a risk that the user uses their new address that never made it into the wallet file. """ if not os.path.exists(self.walletPath): raise FileExistsError('No wallet file exists to be updated!') if len(updateList)==0: return [] # Make sure that the primary and backup files are synced before update self.doWalletFileConsistencyCheck() walletFileBackup = self.getWalletPath('backup') mainUpdateFlag = self.getWalletPath('update_unsuccessful') backupUpdateFlag = self.getWalletPath('backup_unsuccessful') # Will be passing back info about all data successfully added oldWalletSize = os.path.getsize(self.walletPath) updateLocations = [] dataToChange = [] toAppend = BinaryPacker() try: for entry in updateList: modType = entry[0] updateInfo = entry[1:] if(modType==WLT_UPDATE_ADD): dtype = updateInfo[0] updateLocations.append(toAppend.getSize()+oldWalletSize) if dtype==WLT_DATATYPE_KEYDATA: if len(updateInfo[1])!=20 or not isinstance(updateInfo[2], PyBtcAddress): raise Exception('Data type does not match update type') toAppend.put(UINT8, WLT_DATATYPE_KEYDATA) toAppend.put(BINARY_CHUNK, updateInfo[1]) toAppend.put(BINARY_CHUNK, updateInfo[2].serialize()) elif dtype in (WLT_DATATYPE_ADDRCOMMENT, WLT_DATATYPE_TXCOMMENT): if not isinstance(updateInfo[2], str): raise Exception('Data type does not match update type') toAppend.put(UINT8, dtype) toAppend.put(BINARY_CHUNK, updateInfo[1]) toAppend.put(UINT16, len(updateInfo[2])) toAppend.put(BINARY_CHUNK, updateInfo[2]) elif dtype==WLT_DATATYPE_OPEVAL: raise Exception('OP_EVAL not support in wallet yet') elif(modType==WLT_UPDATE_MODIFY): updateLocations.append(updateInfo[0]) dataToChange.append( updateInfo ) else: LOGERROR('Unknown wallet-update type!') raise Exception('Unknown wallet-update type!') except Exception: LOGEXCEPT('Bad input to walletFileSafeUpdate') return [] binaryToAppend = toAppend.getBinaryString() # We need to safely modify both the main wallet file and backup # Start with main wallet touchFile(mainUpdateFlag) try: wltfile = open(self.walletPath, 'ab') wltfile.write(binaryToAppend) wltfile.flush() os.fsync(wltfile.fileno()) wltfile.close() # This is for unit-testing the atomic-wallet-file-update robustness if self.interruptTest1: raise InterruptTestError wltfile = open(self.walletPath, 'r+b') for loc,replStr in dataToChange: wltfile.seek(loc) wltfile.write(replStr) wltfile.flush() os.fsync(wltfile.fileno()) wltfile.close() except IOError: LOGEXCEPT('Could not write data to wallet. Permissions?') shutil.copy(walletFileBackup, self.walletPath) os.remove(mainUpdateFlag) return [] # Write backup flag before removing main-update flag. If we see # both flags, we know file IO was interrupted RIGHT HERE touchFile(backupUpdateFlag) # This is for unit-testing the atomic-wallet-file-update robustness if self.interruptTest2: raise InterruptTestError os.remove(mainUpdateFlag) # Modify backup try: # This is for unit-testing the atomic-wallet-file-update robustness if self.interruptTest3: raise InterruptTestError backupfile = open(walletFileBackup, 'ab') backupfile.write(binaryToAppend) backupfile.flush() os.fsync(backupfile.fileno()) backupfile.close() backupfile = open(walletFileBackup, 'r+b') for loc,replStr in dataToChange: backupfile.seek(loc) backupfile.write(replStr) backupfile.flush() os.fsync(backupfile.fileno()) backupfile.close() except IOError: LOGEXCEPT('Could not write backup wallet. Permissions?') shutil.copy(self.walletPath, walletFileBackup) os.remove(mainUpdateFlag) return [] os.remove(backupUpdateFlag) return updateLocations ############################################################################# def doWalletFileConsistencyCheck(self, onlySyncBackup=True): """ First we check the file-update flags (files we touched/removed during file modification operations), and then restore the primary wallet file and backup file to the exact same state -- we know that at least one of them is guaranteed to not be corrupt, and we know based on the flags which one that is -- so we execute the appropriate copy operation. ***NOTE: For now, the remaining steps are untested and unused! After we have guaranteed that main wallet and backup wallet are the same, we want to do a check that the data is consistent. We do this by simply reading in the key-data from the wallet, unserializing it and reserializing it to see if it matches -- this works due to the way the PyBtcAddress::unserialize() method works: it verifies the checksums in the address data, and corrects errors automatically! And it's part of the unit-tests that serialize/unserialize round-trip is guaranteed to match for all address types if there's no byte errors. If an error is detected, we do a safe-file-modify operation to re-write the corrected information to the wallet file, in-place. We DO NOT check comment fields, since they do not have checksums, and are not critical to protect against byte errors. """ if not os.path.exists(self.walletPath): raise FileExistsError('No wallet file exists to be checked!') walletFileBackup = self.getWalletPath('backup') mainUpdateFlag = self.getWalletPath('update_unsuccessful') backupUpdateFlag = self.getWalletPath('backup_unsuccessful') if not os.path.exists(walletFileBackup): # We haven't even created a backup file, yet LOGDEBUG('Creating backup file %s', walletFileBackup) touchFile(backupUpdateFlag) shutil.copy(self.walletPath, walletFileBackup) os.remove(backupUpdateFlag) if os.path.exists(backupUpdateFlag) and os.path.exists(mainUpdateFlag): # Here we actually have a good main file, but backup never succeeded LOGWARN('***WARNING: error in backup file... how did that happen?') shutil.copy(self.walletPath, walletFileBackup) os.remove(mainUpdateFlag) os.remove(backupUpdateFlag) elif os.path.exists(mainUpdateFlag): LOGWARN('***WARNING: last file operation failed! Restoring wallet from backup') # main wallet file might be corrupt, copy from backup shutil.copy(walletFileBackup, self.walletPath) os.remove(mainUpdateFlag) elif os.path.exists(backupUpdateFlag): LOGWARN('***WARNING: creation of backup was interrupted -- fixing') shutil.copy(self.walletPath, walletFileBackup) os.remove(backupUpdateFlag) if onlySyncBackup: return 0 ############################################################################# #def getAddrByIndex(self, i): #return self.addrMap.values()[i] ############################################################################# def deleteImportedAddress(self, addr160): """ We want to overwrite a particular key in the wallet. Before overwriting the data looks like this: [ \x00 | <20-byte addr160> | <237-byte keydata> ] And we want it to look like: [ \x04 | <2-byte length> | \x00\x00\x00... ] So we need to construct a wallet-update vector to modify the data starting at the first byte, replace it with 0x04, specifies how many bytes are in the deleted entry, and then actually overwrite those bytes with 0s """ if not self.addrMap[addr160].chainIndex==-2: raise WalletAddressError('You can only delete imported addresses!') overwriteLoc = self.addrMap[addr160].walletByteLoc - 21 overwriteLen = 20 + self.pybtcaddrSize - 2 overwriteBin = '' overwriteBin += int_to_binary(WLT_DATATYPE_DELETED, widthBytes=1) overwriteBin += int_to_binary(overwriteLen, widthBytes=2) overwriteBin += '\x00'*overwriteLen self.walletFileSafeUpdate([[WLT_UPDATE_MODIFY, overwriteLoc, overwriteBin]]) # IMPORTANT: we need to update the wallet structures to reflect the # new state of the wallet. This will actually be easiest # if we just "forget" the current wallet state and re-read # the wallet from file wltPath = self.walletPath self.readWalletFile(wltPath, doScanNow=True) ############################################################################# def importExternalAddressData(self, privKey=None, privChk=None, \ pubKey=None, pubChk=None, \ addr20=None, addrChk=None, \ firstTime=UINT32_MAX, \ firstBlk=UINT32_MAX, lastTime=0, \ lastBlk=0): """ This wallet fully supports importing external keys, even though it is a deterministic wallet: determinism only adds keys to the pool based on the address-chain, but there's nothing wrong with adding new keys not on the chain. We don't know when this address was created, so we have to set its first/last-seen times to 0, to make sure we search the whole blockchain for tx related to it. This data will be updated later after we've done the search and know for sure when it is "relevant". (alternatively, if you know it's first-seen time for some reason, you can supply it as an input, but this seems rare: we don't want to get it wrong or we could end up missing wallet-relevant transactions) DO NOT CALL FROM A BDM THREAD FUNCTION. IT MAY DEADLOCK. """ if self.calledFromBDM: LOGERROR('Called importExternalAddressData() from BDM method!') LOGERROR('Don\'t do this!') return None if not privKey and not self.watchingOnly: LOGERROR('') LOGERROR('This wallet is strictly for addresses that you') LOGERROR('own. You cannot import addresses without the') LOGERROR('the associated private key. Instead, use a') LOGERROR('watching-only wallet to import this address.') LOGERROR('(actually, this is currently, completely disabled)') raise WalletAddressError('Cannot import non-private-key addresses') # First do all the necessary type conversions and error corrections computedPubKey = None computedAddr20 = None if privKey: if isinstance(privKey, str): privKey = SecureBinaryData(privKey) if privChk: privKey = SecureBinaryData(verifyChecksum(privKey.toBinStr(), privChk)) computedPubkey = CryptoECDSA().ComputePublicKey(privKey) computedAddr20 = convertKeyDataToAddress(pubKey=computedPubkey) # If public key is provided, we prep it so we can verify Pub/Priv match if pubKey: if isinstance(pubKey, str): pubKey = SecureBinaryData(pubKey) if pubChk: pubKey = SecureBinaryData(verifyChecksum(pubKey.toBinStr(), pubChk)) if not computedAddr20: computedAddr20 = convertKeyDataToAddress(pubKey=pubKey) # The 20-byte address (pubkey hash160) should always be a python string if addr20: if not isinstance(pubKey, str): addr20 = addr20.toBinStr() if addrChk: addr20 = verifyChecksum(addr20, addrChk) # Now a few sanity checks if self.addrMap.has_key(addr20): LOGWARN('The private key address is already in your wallet!') return None #if pubKey and not computedPubkey==pubKey: #raise ECDSA_Error('Private and public keys to be imported do not match!') #if addr20 and not computedAddr20==addr20: #raise ECDSA_Error('Supplied address hash does not match key data!') addr20 = computedAddr20 if self.addrMap.has_key(addr20): LOGERROR('The computed private key address is already in your wallet!') return None # If a private key is supplied and this wallet is encrypted&locked, then # we have no way to secure the private key without unlocking the wallet. if self.useEncryption and privKey and not self.kdfKey: raise WalletLockError('Cannot import private key when wallet is locked!') if privKey: # For priv key, lots of extra encryption and verification options newAddr = PyBtcAddress().createFromPlainKeyData(privKey, addr20, \ self.useEncryption, \ self.useEncryption, \ publicKey65=computedPubkey, \ skipCheck=True, skipPubCompute=True) if self.useEncryption: newAddr.lock(self.kdfKey) newAddr.unlock(self.kdfKey) elif pubKey: securePubKey = SecureBinaryData(pubKey) newAddr = PyBtcAddress().createFromPublicKeyData(securePubKey) else: newAddr = PyBtcAddress().createFromPublicKeyHash160(addr20) newAddr.chaincode = SecureBinaryData('\xff'*32) newAddr.chainIndex = -2 newAddr.timeRange = [firstTime, lastTime] newAddr.blkRange = [firstBlk, lastBlk ] #newAddr.binInitVect16 = SecureBinaryData().GenerateRandom(16) newAddr160 = newAddr.getAddr160() newDataLoc = self.walletFileSafeUpdate( \ [[WLT_UPDATE_ADD, WLT_DATATYPE_KEYDATA, newAddr160, newAddr]]) self.addrMap[newAddr160] = newAddr.copy() self.addrMap[newAddr160].walletByteLoc = newDataLoc[0] + 21 self.linearAddr160List.append(newAddr160) if self.useEncryption and self.kdfKey: self.addrMap[newAddr160].lock(self.kdfKey) if not self.isLocked: self.addrMap[newAddr160].unlock(self.kdfKey) self.cppWallet.addScrAddress_5_(Hash160ToScrAddr(newAddr160), \ firstTime, firstBlk, lastTime, lastBlk) # The following line MAY deadlock if this method is called from the BDM # thread. Do not write any BDM methods that calls this method! TheBDM.registerImportedScrAddr(Hash160ToScrAddr(newAddr160), firstTime, firstBlk, lastTime, lastBlk) return newAddr.serializePublicKey() ############################################################################# def bulkImportAddresses(self, textBlock, privKeyEndian=BIGENDIAN, \ sepList=":;'[]()=-_*&^%$#@!,./?\n"): """ Attempts to import plaintext key data stored in a file. This method expects all data to be in hex or Base58: 20 bytes / 40 hex chars -- public key hashes 25 bytes / 50 hex chars -- full binary addresses 65 bytes / 130 hex chars -- public key 32 bytes / 64 hex chars -- private key 33 or 34 Base58 chars -- address strings 50 to 52 Base58 chars -- base58-encoded private key Since this is python, I don't have to require any particular format: I can pretty easily break apart the entire file into individual strings, search for addresses and public keys, then, search for private keys that correspond to that data. Obviously, simpler is better, but as long as the data is encoded as in the above list and separated by whitespace or punctuation, this method should succeed. We must throw an error if this is NOT a watching-only address and we find an address without a private key. We will need to create a separate watching-only wallet in order to import these keys. TODO: will finish this later """ """ STUB: (AGAIN) I just can't make this work out to be as stupid-proof as I originally planned. I'll have to put it on hold. self.__init__() newfile = open(filename,'rb') newdata = newfile.read() newfile.close() # Change all punctuation to the same char so split() works easier for ch in sepList: newdata.replace(ch, ' ') newdata = newdata.split() hexChars = '01234567890abcdef' b58Chars = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz' DATATYPES = enum( 'UNKNOWN', \ 'Addr_Hex_20', \ 'Addr_B58_25', \ 'PubX_Hex_32', \ 'PubY_Hex_32', \ 'PubK_Hex_65', \ 'Priv_Hex_32', \ 'Priv_Hex_36', \ 'Priv_Hex_37', \ 'Priv_B58_32', \ 'Priv_B58_37', \ 'Priv_MiniPriv', \ 'PubK_Hex_33_Compressed', \ 'Priv_Hex_33_Compressed') DTYPES = enum('Unknown', 'Hash160', 'PubKey', 'PrivKey', 'Byte32', 'Byte33') lastAddr = None lastPubK = None lastPriv = None for theStr in newdata: if len(theStr)<20: continue hexCount = sum([1 if c in hexChars else 0 for c in theStr]) b58Count = sum([1 if c in b58Chars else 0 for c in theStr]) canBeHex = hexCount==len(theStr) canBeB58 = b58Count==len(theStr) isHex = canBeHex isB58 = canBeB58 and not canBeHex isStr = not isHex and not isB58 dataAndType = [DTYPES.Unknown, ''] if isHex: binData = hex_to_binary(theStr) sz = len(binData) if sz==20: dataAndType = [DTYPES.Hash160, binData] elif sz==25: dataAndType = [DTYPES.Hash160, binData[1:21]] elif sz==32: dataAndType = [DTYPES., binData[1:21]] elif isB58: binData = base58_to_binary(theStr) sz = len(binData) if isHex and sz==40: elif isHex and sz==50: dataAndType = [DTYPES.Hash160, hex_to_binary(theStr)[1:21]] elif isB58 and sz>=31 and sz<=35: dataAndType = [DTYPES.Hash160, addrStr_to_hash160(theStr)] elif isHex is sz==130: dataAndType = [DTYPES.PubKey, hex_to_binary(theStr)] elif isHex is sz==128: dataAndType = [DTYPES.PubKey, '\x04'+hex_to_binary(theStr)] elif isHex is sz==128: potentialKey = SecureBinaryData('\x04' + piece) isValid = CryptoECDSA().VerifyPublicKeyValid(potentialKey) """ pass ############################################################################# def checkIfRescanRequired(self): """ Returns true is we have to go back to disk/mmap and rescan more than two weeks worth of blocks DO NOT CALL FROM A BDM METHOD. Instead, call directly: self.bdm.numBlocksToRescan(pywlt.cppWallet) > 2016 """ if self.calledFromBDM: LOGERROR('Called checkIfRescanRequired() from BDM method!') LOGERROR('Don\'t do this!') if TheBDM.getBDMState()=='BlockchainReady': return (TheBDM.numBlocksToRescan(self.cppWallet) > 2016) else: return False ############################################################################# def signUnsignedTx(self, ustx, hashcode=1): if not hashcode==1: LOGERROR('hashcode!=1 is not supported at this time!') return # If the wallet is locked, we better bail now if self.isLocked is True and self.kdfKey is None: raise WalletLockError('Cannot sign tx without unlocking wallet') numInputs = len(ustx.pytxObj.inputs) wltAddr = [] for iin,ustxi in enumerate(ustx.ustxInputs): for isig,scrAddr in enumerate(ustxi.scrAddrs): addr160 = scrAddr_to_hash160(scrAddr)[1] if self.hasAddr(addr160) and self.addrMap[addr160].hasPrivKey(): wltAddr.append((self.addrMap[addr160], iin, isig)) # WltAddr now contains a list of every input we can sign for, and the # PyBtcAddress object that can be used to sign it. Let's do it. numMyAddr = len(wltAddr) LOGDEBUG('Total number of inputs in transaction: %d', numInputs) LOGDEBUG('Number of inputs that you can sign for: %d', numMyAddr) # Unlock the wallet if necessary, sign inputs maxChainIndex = -1 for addrObj,idx,sigIdx in wltAddr: maxChainIndex = max(maxChainIndex, addrObj.chainIndex) if addrObj.isLocked: if self.kdfKey: if addrObj.createPrivKeyNextUnlock: self.unlock(self.kdfKey) else: addrObj.unlock(self.kdfKey) else: self.lock() raise WalletLockError('Cannot sign tx without unlocking wallet') if not addrObj.hasPubKey(): # Make sure the public key is available for this address addrObj.binPublicKey65 = \ CryptoECDSA().ComputePublicKey(addrObj.binPrivKey32_Plain) ##### MAGIC ##### ustx.createAndInsertSignatureForInput(idx, addrObj.binPrivKey32_Plain) ##### MAGIC ##### if self.useEncryption: self.lock() prevHighestIndex = self.highestUsedChainIndex if prevHighestIndex 0 and addrObjPrev.chainIndex > -1: addrObj.createPrivKeyNextUnlock_IVandKey[0] = \ addrObjPrev.binInitVect16.copy() addrObj.createPrivKeyNextUnlock_IVandKey[1] = \ addrObjPrev.binPrivKey32_Encr.copy() addrObj.createPrivKeyNextUnlock_ChainDepth = ChainDepth addrObj.unlock(self.kdfKey) if addrObj.chainIndex > -1: addrObjPrev = addrObj if needToSaveAddrAfterUnlock: updateLoc = addrObj.walletByteLoc self.walletFileSafeUpdate( [[WLT_UPDATE_MODIFY, addrObj.walletByteLoc, addrObj.serialize()]]) self.isLocked = False LOGDEBUG('Unlock succeeded: %s', self.uniqueIDB58) ############################################################################ def lock(self, Progress=emptyFunc): """ We assume that we have already set all encryption parameters (such as IVs for each key) and thus all we need to do is call the "lock" method on each PyBtcAddress object. If wallet is unlocked, try to re-lock addresses, regardless of whether we have a kdfKey or not. In some circumstances (such as when the addrs have never been locked before) we will need the key to encrypt them. However, in most cases, the encrypted versions are already available and the PyBtcAddress objects can destroy the plaintext keys without ever needing access to the encryption keys. ANY METHOD THAT CALLS THIS MUST CATCH WALLETLOCKERRORS UNLESS YOU ARE POSITIVE THAT THE KEYS HAVE ALREADY BEEN ENCRYPTED BEFORE, OR ARE ALREADY SITTING IN THE ENCRYPTED WALLET FILE. PyBtcAddress objects were designed to do this, but in case of a bug, you don't want the program crashing with money-bearing private keys sitting in memory only. TODO: If things like IVs are not set properly, we should implement a way to check for this, correct it, and update the wallet file if necessary """ # Wallet is unlocked, will try to re-lock addresses, regardless of whether # we have a kdfKey or not. If a key is required, we will throw a # WalletLockError, and the caller can get the passphrase from the user, # unlock the wallet, then try locking again. # NOTE: If we don't have kdfKey, it is set to None, which is the default # input for PyBtcAddress::lock for "I don't have it". In most # cases, it is actually possible to lock the wallet without the # kdfKey because we saved the encrypted versions before unlocking if self.useEncryption: LOGDEBUG('Attempting to lock wallet: %s', self.uniqueIDB58) i=1 nAddr = len(self.addrMap) try: for addr160,addrObj in self.addrMap.iteritems(): Progress(i, nAddr) i = i +1 self.addrMap[addr160].lock(self.kdfKey) if self.kdfKey: self.kdfKey.destroy() self.kdfKey = None self.isLocked = True except WalletLockError: LOGERROR('Locking wallet requires encryption key. This error') LOGERROR('Usually occurs on newly-encrypted wallets that have') LOGERROR('never been encrypted before.') raise WalletLockError('Unlock with passphrase before locking again') LOGDEBUG('Wallet locked: %s', self.uniqueIDB58) else: LOGWARN('Attempted to lock unencrypted wallet: %s', self.uniqueIDB58) ############################################################################# def getAddrListSortedByChainIndex(self, withRoot=False): """ Returns Addr160 list """ addrList = [] for addr160 in self.linearAddr160List: addr=self.addrMap[addr160] addrList.append( [addr.chainIndex, addr160, addr] ) addrList.sort(key=lambda x: x[0]) return addrList ############################################################################# def getAddrList(self): """ Returns list of PyBtcAddress objects """ addrList = [] for addr160,addrObj in self.addrMap.iteritems(): if addr160=='ROOT': continue # I assume these will be references, not copies addrList.append( addrObj ) return addrList ############################################################################# def getLinearAddrList(self, withImported=True, withAddrPool=False): """ Retrieves a list of addresses, by hash, in the order they appear in the wallet file. Can ignore the imported addresses to get only chained addresses, if necessary. I could do this with one list comprehension, but it would be long. I'm resisting the urge... """ addrList = [] for a160 in self.linearAddr160List: addr = self.addrMap[a160] if not a160=='ROOT' and (withImported or addr.chainIndex>=0): # Either we want imported addresses, or this isn't one if (withAddrPool or addr.chainIndex<=self.highestUsedChainIndex): addrList.append(addr) return addrList ############################################################################# def getAddress160ByChainIndex(self, desiredIdx): """ It should be safe to assume that if the index is less than the highest computed, it will be in the chainIndexMap, but I don't like making such assumptions. Perhaps something went wrong with the wallet, or it was manually reconstructed and has holes in the chain. We will regenerate addresses up to that point, if necessary (but nothing past the value self.lastComputedChainIndex. """ if desiredIdx>self.lastComputedChainIndex or desiredIdx<0: # I removed the option for fillPoolIfNecessary, because of the risk # that a bug may lead to generation of billions of addresses, which # would saturate the system's resources and fill the HDD. raise WalletAddressError('Chain index is out of range') if self.chainIndexMap.has_key(desiredIdx): return self.chainIndexMap[desiredIdx] else: # Somehow the address isn't here, even though it is less than the # last computed index closestIdx = 0 for idx,addr160 in self.chainIndexMap.iteritems(): if closestIdxWallet} but we have a lboxList [Lbox0, Lbox1, ...]. I will have to standardize the member names and lookup structures. We have a script and want to show the user something useful about it. We have a couple different display modes, since some formats are space- constrained. For instance, the DlgConfirmSend dialog only has space for 34 letters, as it was designed to be showing only an address string. This is similar to self.getContribStr, but that method is more focused on identifying participants of a multi-sig transaction. It almost works here, but we need one that's more general. Consider a 3-of-5 lockbox with ID Abcd1234z and label "My long-term savings super-secure" and p2sh address 2m83zQr9981pmKnrSwa32 10 20 30 40 50 60 70 | | | | | | | | 256 Lockbox 3-of-5 "Long-term savings" (2m83zQr9981p...) 256 Lockbox 3-of-5 "Long-term savings" (Abcd1234z) 50 Lockbox 3-of-5 "Long-term sa..." (2m83zQr9981p...) 35 Lockbox 3-of-5 "Long-term savings" 32 Lockbox 3-of-5 "Long-term sa..." 256 Wallet "LabelLabelLabelLabelLabelLabel" (1j93CnrAA3xn...) 256 Wallet "LabelLabelLabelLabelLabelLabel" (Abcd1234z) 50 Wallet "LabelLabelLa..." (1j93CnrAA3xn...) 35 Wallet "LabelLabelLa..." So we will always show the type and the label (possibly truncated). If we can show the ID or Addr (whichever is preferred) we will do so, otherwise it gets left out. If our truncation leaves the string too short, we usually try to add back in a few chars. It's not perfect, but it seems to work reliably. The doBold arg indicates that we want to add html bold tags around the first N parts of the return. This is applied after the length calculations are performed, as bolding will have a very small impact on width """ if maxChars<32: LOGERROR('getDisplayStringForScript() req at least 32 bytes output') return None scriptType = getTxOutScriptType(binScript) scrAddr = script_to_scrAddr(binScript) wlt = None for iterID,iterWlt in wltMap.iteritems(): if iterWlt.hasScrAddr(scrAddr): wlt = iterWlt break lbox = None if wlt is None: searchScrAddr = scrAddr if scriptType==CPP_TXOUT_MULTISIG: searchScrAddr = script_to_scrAddr(script_to_p2sh_script(binScript)) for iterLbox in lboxList: if searchScrAddr == iterLbox.p2shScrAddr: lbox = iterLbox break # Return these with the display string wltID = wlt.uniqueIDB58 if wlt else None lboxID = lbox.uniqueIDB58 if lbox else None if wlt is not None: strType = 'Wallet:' strLabel = wlt.labelName addrStr = None if scriptType in CPP_TXOUT_HAS_ADDRSTR: addrStr = scrAddr_to_addrStr(scrAddr) strLast = wlt.uniqueIDB58 if addrStr is None else addrStr strLast = wlt.uniqueIDB58 if prefIDOverAddr else strLast elif lbox is not None: strType = 'Lockbox %d-of-%d:' % (lbox.M, lbox.N) strLabel = lbox.shortName addrStr = scrAddr_to_addrStr(lbox.p2shScrAddr) strLast = lbox.uniqueIDB58 if prefIDOverAddr else addrStr else: strType = '' strLabel = '' strLast = '' addrStr = None def truncateStr(theStr, maxLen): if len(theStr) <= maxLen: return theStr else: return theStr[:maxLen-3] + '...' if len(strType) > 0: # We have something to display... do it and return lenType = len(strType) lenLabel = len(strLabel) + 3 lenLast = len(strLast) + 3 lenLabelTrunc = min(lenLabel + 3, lblTrunc + 6) lenLastTrunc = min(lenLast + 3, lastTrunc + 6) if lenType + lenLabel + lenLast <= maxChars: strLabel = ' "%s"' % strLabel strLast = ' (%s)' % strLast if lenLast>0 else '' elif lenType + lenLabel + lenLastTrunc <= maxChars: extraChars = maxChars - (lenType + lenLabel + lenLastTrunc) lastTrunc += extraChars strLabel = ' "%s"' % strLabel strLast = ' (%s)' % truncateStr(strLast,lastTrunc) if lenLast>0 else '' elif lenType + lenLabelTrunc + lenLastTrunc <= maxChars: extraChars = maxChars - (lenType + lenLabelTrunc + lenLastTrunc) lblTrunc += extraChars/2 lastTrunc += extraChars/2 strLabel = ' "%s"' % truncateStr(strLabel, lblTrunc) strLast = ' (%s)' % truncateStr(strLast, lastTrunc) if lenLast>0 else '' elif lenType + lenLabel <= maxChars: strLabel = ' "%s"' % strLabel strLast = '' elif lenType + lenLabelTrunc <= maxChars: lblTrunc += maxChars - (lenType + lenLabelTrunc) strLabel = ' "%s"' % truncateStr(strLabel, lblTrunc) strLast = '' else: # Total last resort, actually leave the label out... # If we still can't fit it... too bad, we have to show something lastTrunc = max(maxChars - (lenType + 4), 6) strLabel = '' strLast = ' %s' % truncateStr(strLast, lastTrunc) if doBold>0: strType = '%s' % strType if doBold>1: strLabel = '%s' % strLabel if doBold>2: strLast = '%s' % strLast displayStr = ''.join([strType, strLabel, strLast]) return {'String': displayStr, 'WltID': wltID, 'LboxID': lboxID, 'AddrStr': addrStr} # If we're here, it didn't match any loaded wlt or lockbox dispStr = '' if scriptType in CPP_TXOUT_HAS_ADDRSTR: addrStr = script_to_addrStr(binScript) if len(addrStr) <= maxChars: dispStr = addrStr else: dispStr = addrStr[:maxChars-3] + '...' elif scriptType == CPP_TXOUT_MULTISIG: M,N,a160s,pubs = getMultisigScriptInfo(binScript) lbID = calcLockboxID(binScript) dispStr = 'Unknown %d-of-%d (%s)' % (M,N,lbID) addrStr = script_to_addrStr(script_to_p2sh_script(binScript)) if len(dispStr) + len(addrStr) + 3 <= maxChars: dispStr += ' [%s]' % addrStr elif len(dispStr) + lastTrunc + 6 <= maxChars: dispStr += ' [%s...]' % addrStr[:lastTrunc] else: addrStr = script_to_addrStr(script_to_p2sh_script(binScript)) dispStr = 'Non-Standard: %s' % addrStr if len(dispStr) > maxChars: dispStr = dispStr[:maxChars-3] + '...' return {'String': dispStr, 'WltID': None, 'LboxID': None, 'AddrStr': addrStr} armory-0.92.3/armoryengine/BinaryPacker.py0000644000000000000000000000604512414772654017260 0ustar rootroot################################################################################ # # Copyright (C) 2011-2014, Armory Technologies, Inc. # Distributed under the GNU Affero General Public License (AGPL v3) # See LICENSE or http://www.gnu.org/licenses/agpl.html # ################################################################################ # # Project: Armory # Author: Alan Reiner # Website: www.bitcoinarmory.com # Orig Date: 20 November, 2011 # ################################################################################ from armoryengine.ArmoryUtils import LITTLEENDIAN, int_to_binary, packVarInt UINT8, UINT16, UINT32, UINT64, INT8, INT16, INT32, INT64, VAR_INT, VAR_STR, FLOAT, BINARY_CHUNK = range(12) from struct import pack, unpack class PackerError(Exception): pass class BinaryPacker(object): """ Class for helping load binary data into a stream. Typical usage is >> binpack = BinaryPacker() >> bup.put(UINT32, 12) >> bup.put(VAR_INT, 78) >> bup.put(BINARY_CHUNK, '\x9f'*10) >> ...etc... >> result = bup.getBinaryString() """ def __init__(self): self.binaryConcat = [] def getSize(self): return sum([len(a) for a in self.binaryConcat]) def getBinaryString(self): return ''.join(self.binaryConcat) def __str__(self): return self.getBinaryString() def put(self, varType, theData, width=None, endianness=LITTLEENDIAN): """ Need to supply the argument type you are put'ing into the stream. Values of BINARY_CHUNK will automatically detect the size as necessary Use width=X to include padding of BINARY_CHUNKs w/ 0x00 bytes """ E = endianness if varType == UINT8: self.binaryConcat += int_to_binary(theData, 1, endianness) elif varType == UINT16: self.binaryConcat += int_to_binary(theData, 2, endianness) elif varType == UINT32: self.binaryConcat += int_to_binary(theData, 4, endianness) elif varType == UINT64: self.binaryConcat += int_to_binary(theData, 8, endianness) elif varType == INT8: self.binaryConcat += pack(E+'b', theData) elif varType == INT16: self.binaryConcat += pack(E+'h', theData) elif varType == INT32: self.binaryConcat += pack(E+'i', theData) elif varType == INT64: self.binaryConcat += pack(E+'q', theData) elif varType == VAR_INT: self.binaryConcat += packVarInt(theData)[0] elif varType == VAR_STR: self.binaryConcat += packVarInt(len(theData))[0] self.binaryConcat += theData elif varType == FLOAT: self.binaryConcat += pack(E+'f', theData) elif varType == BINARY_CHUNK: if width==None: self.binaryConcat += theData else: if len(theData)>width: raise PackerError, 'Too much data to fit into fixed width field' self.binaryConcat += theData.ljust(width, '\x00') else: raise PackerError, "Var type not recognized! VarType="+str(varType) armory-0.92.3/armoryengine/__init__.py0000644000000000000000000000000012414772654016426 0ustar rootrootarmory-0.92.3/armoryengine/PyBtcWalletRecovery.py0000644000000000000000000023016212414772654020616 0ustar rootrootfrom armoryengine.BinaryUnpacker import BinaryUnpacker from armoryengine.ArmoryUtils import UINT32_MAX, KeyDataError, \ verifyChecksum, int_to_bitset, \ KILOBYTE, RightNowStr, hex_to_binary from armoryengine.BinaryPacker import UINT16, UINT32, UINT64, INT64, \ BINARY_CHUNK from armoryengine.PyBtcAddress import PyBtcAddress from armoryengine.PyBtcWallet import (PyBtcWallet, WLT_DATATYPE_KEYDATA, \ WLT_DATATYPE_ADDRCOMMENT, \ WLT_DATATYPE_TXCOMMENT, \ WLT_DATATYPE_OPEVAL, \ WLT_DATATYPE_DELETED, WLT_UPDATE_ADD, \ getSuffixedPath) from CppBlockUtils import SecureBinaryData, CryptoECDSA, CryptoAES, BtcWallet import os import shutil from time import sleep, ctime from armoryengine.ArmoryUtils import AllowAsync, emptyFunc, LOGEXCEPT, \ LOGINFO, LOGERROR, SECP256K1_ORDER, \ binary_to_int, BIGENDIAN, int_to_binary, \ binary_to_hex, enum, HMAC256 # 0 1 2 3 4 5 RECOVERMODE = enum('NotSet', 'Stripped', 'Bare', 'Full', 'Meta', 'Check') class InvalidEntry(Exception): pass class PyBtcWalletRecovery(object): """ Fail safe wallet recovery tool. Reads a wallet, verifies and extracts sensitive data to a new file. """ def __init__(self): """ Set of lists holding various errors at given indexes. Used at the end of the recovery process to compile a wallet specific log of encountered inconsistencies """ self.byteError = [] #byte errors self.brokenSequence = [] #inconsistent address entry order in the file self.sequenceGaps = [] #gaps in key pair chain self.forkedPublicKeyChain = [] #for public keys: (N-1)*chaincode != N self.chainCodeCorruption = [] #addr[N] chaincode != addr[0] chaincode self.invalidPubKey = [] #pub key isnt a valid EC point self.missingPubKey = [] #addr[N] has no pub key self.hashValMismatch = [] #addrStr20 doesnt match hashVal entry in file self.unmatchedPair = [] #private key doesnt yield public key self.importedErr = [] #all imported keys related errors self.negativeImports = [] #lists forked imports in wallet #inconsistent private keys as P/HMAC512(rootKey, 'LogMult') mod N self.privKeyMultipliers = [] """ Object wide identifiers. To make sure certain sensitive objects are deleted after us, they are only defined within ProcessWallet's scope """ self.newwalletPath = None self.WO = False self.UIreport = '' self.UID = '' self.labelName = '' self.WalletPath = '' """ Modes: 1) Stripped: Only recover the root key and chaincode (it all sits in the header). As fail safe as it gets. 2) Bare: Recover root key, chaincode and valid private/public key pairs. Verify integrity of the wallet and consistency of all entries encountered. Skips comments, unprocessed public keys and otherwise corrupted data without attempting to fix it. 3) Full: Recovers as much data as possible from the wallet. 4) Meta: Get all labels and comment entries from the wallet, return as list 5) Check: checks wallet for consistency. Does not yield a recovered file, does not enforce unlocking encrypted wallets. returned values: -1: invalid path or file isn't a wallet In meta mode, a dict is returned holding all comments and labels in the wallet """ self.smode = RECOVERMODE.NotSet ########################################################################### def BuildLogFile(self, errorCode, Progress, returnError=False, nErrors=0): """ The recovery function has ended and called this. Review the analyzed data, build a log and return negative values if the recovery couldn't complete """ ''' error codes: 0 - no errors in wallet 1 - found errors, fixed them <0 - error prcoessing wallet, read description below ''' self.strOutput = [] self.UIreport = self.UIreport + '- Building log file...
' Progress(self.UIreport) if errorCode < 0: if errorCode == -1: errorstr = \ 'ERROR: Invalid path, or file is not a valid Armory wallet\r\n' elif errorCode == -2: errorstr = \ 'ERROR: file I/O failure. Do you have proper credentials?\r\n' elif errorCode == -3: errorstr = \ 'ERROR: This wallet file is for another network/blockchain\r\n' elif errorCode == -4: errorstr = \ 'ERROR: invalid or missing passphrase for encrypted wallet\r\n' elif errorCode == -10: errorstr = 'ERROR: no kdf parameters available\r\n' elif errorCode == -12: errorstr = 'ERROR: failed to unlock root key\r\n' self.strOutput.append(' %s' % (errorstr)) self.UIreport = self.UIreport + errorstr Progress(self.UIreport) return self.FinalizeLog(errorCode, Progress, returnError) if returnError == 'Dict': errors = {} errors['byteError'] = self.byteError errors['brokenSequence'] = self.brokenSequence errors['sequenceGaps'] = self.sequenceGaps errors['forkedPublicKeyChain'] = self.forkedPublicKeyChain errors['chainCodeCorruption'] = self.chainCodeCorruption errors['invalidPubKey'] = self.invalidPubKey errors['missingPubKey'] = self.missingPubKey errors['hashValMismatch'] = self.hashValMismatch errors['unmatchedPair'] = self.unmatchedPair errors['misc'] = self.misc errors['importedErr'] = self.importedErr errors['negativeImports'] = self.negativeImports errors['nErrors'] = nErrors errors['privMult'] = self.privKeyMultipliers return errors if self.newwalletPath != None: self.LogPath = self.newwalletPath + ".log" else: self.LogPath = self.WalletPath + ".log" basename = os.path.basename(self.WalletPath) if self.smode == RECOVERMODE.Check: self.strOutput.append('Checking wallet %s (ID: %s) on %s \r\n' % \ ('\'' + self.labelName + '\'' \ if len(self.labelName) != 0 else basename, \ self.UID, ctime())) else: self.strOutput.append('Analyzing wallet %s (ID: %s) on %s \r\n' % \ ('\'' + self.labelName + '\'' if \ len(self.labelName) != 0 else basename, \ self.UID, ctime())) self.strOutput.append('Using recovery mode: %d\r\n' % (self.smode)) if self.WO: self.strOutput.append('Wallet is Watch Only\r\n') else: self.strOutput.append('Wallet contains private keys ') if self.useEnc == 0: self.strOutput.append('and doesn\'t use encryption\r\n') else: self.strOutput.append('and uses encryption\r\n') # If all we have is these logs, should know num used, if avail self.strOutput.append('Highest used index: %d\r\n' % self.highestUsed) if self.smode == RECOVERMODE.Stripped and not self.WO: self.strOutput.append(' Recovered root key and chaincode, stripped recovery done.') return self.FinalizeLog(errorCode, Progress, returnError) self.strOutput.append('The wallet file is %d bytes, of which %d bytes were read\r\n' % \ (self.fileSize, self.dataLastOffset)) self.strOutput.append('%d chain addresses, %d imported keys and %d comments were found\r\n' % \ (self.naddress, self.nImports, self.ncomments)) nErrors = 0 #### chained keys self.strOutput.append('Found %d chained address entries\r\n' \ % (self.naddress)) if len(self.byteError) == 0: self.strOutput.append('No byte errors were found in the wallet file\r\n') else: nErrors = nErrors + len(self.byteError) self.strOutput.append('%d byte errors were found in the wallet file:\r\n' % (len(self.byteError))) for i in range(0, len(self.byteError)): self.strOutput.append(' chainIndex %s at file offset %s\r\n' \ % (self.byteError[i][0], self.byteError[i][1])) if len(self.brokenSequence) == 0: self.strOutput.append('All chained addresses were arranged sequentially in the wallet file\r\n') else: #nErrors = nErrors + len(self.brokenSequence) self.strOutput.append('The following %d addresses were not arranged sequentially in the wallet file:\r\n' % \ (len(self.brokenSequence))) for i in range(0, len(self.brokenSequence)): self.strOutput.append(' chainIndex %s at file offset %s\r\n' % \ (self.brokenSequence[i][0], self.brokenSequence[i][1])) if len(self.sequenceGaps) == 0: self.strOutput.append('There are no gaps in the address chain\r\n') else: nErrors = nErrors + len(self.sequenceGaps) self.strOutput.append('Found %d gaps in the address chain:\r\n' % \ (len(self.sequenceGaps))) for i in range(0, len(self.sequenceGaps)): self.strOutput.append(' from chainIndex %s to %s\r\n' % \ (self.sequenceGaps[i][0], self.sequenceGaps[i][1])) if len(self.forkedPublicKeyChain) == 0: self.strOutput.append('No chained address fork was found\r\n') else: nErrors = nErrors + len(self.forkedPublicKeyChain) self.strOutput.append('Found %d forks within the address chain:\r\n' \ % (len(self.forkedPublicKeyChain))) for i in range(0, len(self.forkedPublicKeyChain)): self.strOutput.append(' at chainIndex %s, file offset %s\r\n' \ % (self.forkedPublicKeyChain[i][0], \ self.forkedPublicKeyChain[i][1])) if len(self.chainCodeCorruption) == 0: self.strOutput.append('No chaincode corruption was found\r\n') else: nErrors = nErrors + len(self.chainCodeCorruption) self.strOutput.append(' \ Found %d instances of chaincode corruption:\r\n' % \ (len(self.chainCodeCorruption))) for i in range(0, len(self.chainCodeCorruption)): self.strOutput.append(' at chainIndex %s, file offset %s\r\n' % (self.chainCodeCorruption[i][0], \ self.chainCodeCorruption[i][1])) if len(self.invalidPubKey) == 0: self.strOutput.append('All chained public keys are valid EC points\r\n') else: nErrors = nErrors + len(self.invalidPubKey) self.strOutput.append('%d chained public keys are invalid EC points:\r\n' % (len(self.invalidPubKey))) for i in range(0, len(self.invalidPubKey)): self.strOutput.append(' at chainIndex %s, file offset %s' % \ (self.invalidPubKey[i][0], \ self.invalidPubKey[i][1])) if len(self.missingPubKey) == 0: self.strOutput.append('No chained public key is missing\r\n') else: nErrors = nErrors + len(self.missingPubKey) self.strOutput.append('%d chained public keys are missing:\r\n' % \ (len(self.missingPubKey))) for i in range(0, len(self.missingPubKey)): self.strOutput.append(' at chainIndex %s, file offset %s' % \ (self.missingPubKey[i][0], \ self.missingPubKey[i][1])) if len(self.hashValMismatch) == 0: self.strOutput.append('All entries were saved under their matching hashVal\r\n') else: nErrors = nErrors + len(self.hashValMismatch) self.strOutput.append('%d address entries were saved under an erroneous hashVal:\r\n' % \ (len(self.hashValMismatch))) for i in range(0, len(self.hashValMismatch)): self.strOutput.append(' at chainIndex %s, file offset %s\r\n' \ % (self.hashValMismatch[i][0], \ self.hashValMismatch[i][1])) if not self.WO: if len(self.unmatchedPair) == 0: self.strOutput.append('All chained public keys match their respective private keys\r\n') else: nErrors = nErrors + len(self.unmatchedPair) self.strOutput.append('%d public keys do not match their respective private key:\r\n' % \ (len(self.unmatchedPair))) for i in range(0, len(self.unmatchedPair)): self.strOutput.append(' at chainIndex %s, file offset %s\r\n' \ % (self.unmatchedPair[i][0], self.unmatchedPair[i][1])) if len(self.misc) > 0: nErrors = nErrors + len(self.misc) self.strOutput.append('%d miscalleneous errors were found:\r\n' % \ (len(self.misc))) for i in range(0, len(self.misc)): self.strOutput.append(' %s\r\n' % self.misc[i]) #### imported keys self.strOutput.append('Found %d imported address entries\r\n' % \ (self.nImports)) if self.nImports > 0: if len(self.importedErr) == 0: self.strOutput.append('No errors were found within the imported address entries\r\n') else: nErrors = nErrors + len(self.importedErr) self.strOutput.append('%d errors were found within the imported address entries:\r\n' % \ (len(self.importedErr))) for i in range(0, len(self.importedErr)): self.strOutput.append(' %s\r\n' % (self.importedErr[i])) if len(self.privKeyMultipliers) > 0: self.strOutput.append('Inconsistent private keys were found!\r\n') self.strOutput.append('Logging Multipliers (no private key data):\r\n') for i in range(0, len(self.privKeyMultipliers)): self.strOutput.append(' %s\r\n' % (self.privKeyMultipliers[i])) ####TODO: comments error log self.strOutput.append('%d errors were found\r\n' % (nErrors)) #self.UIreport += '- %d errors were found
' % \ #( ' style="color: red;"' if nErrors else '', nErrors) return self.FinalizeLog(errorCode, Progress, returnError) ############################################################################ def FinalizeLog(self, errorcode, Progress, returnError=False): self.EndLog = '' if errorcode < 0: self.strOutput.append( \ 'Recovery failed: error code %d\r\n\r\n\r\n' % (errorcode)) self.EndLog = '- Recovery failed: error code %d
' % \ (errorcode) Progress(self.UIreport + self.EndLog) return errorcode else: self.strOutput.append('Recovery done\r\n\r\n\r\n') self.EndLog = self.EndLog + '- Recovery done
' if self.newwalletPath: self.EndLog = self.EndLog + \ '
Recovered wallet saved at:
- %s
' % \ (self.newwalletPath) Progress(self.UIreport + self.EndLog) self.strOutput.append('\r\n\r\n\r\n') if not returnError: self.EndLog = self.EndLog + '
Recovery log saved at:
- %s
' \ % (self.LogPath) Progress(self.UIreport + self.EndLog, True) self.logfile = open(self.LogPath, 'ab') for s in self.strOutput: self.logfile.write(s) self.logfile.close() return errorcode else: return [errorcode, self.strOutput] ############################################################################ def RecoverWallet(self, WalletPath, Passphrase=None, Mode=RECOVERMODE.Bare, returnError=False, Progress=emptyFunc): return self.ProcessWallet(WalletPath, None, Passphrase, Mode, None, returnError, async=True, Progress=Progress) ############################################################################ @AllowAsync def ProcessWallet(self, WalletPath=None, Wallet=None, Passphrase=None, Mode=RECOVERMODE.Stripped, prgAt=None, returnError=False, Progress=emptyFunc): self.__init__() if not WalletPath: if not Wallet: return -1 WalletPath = Wallet.walletPath self.WalletPath = WalletPath RecoveredWallet = None SecurePassphrase = None self.naddress = 0 #holds address chain sequentially, ordered by chainIndex, as lists: #[addrEntry, hashVal, naddress, byteLocation, rawData] #validChainDict uses the same list format, and is used to hold computed #valid chain address entries addrDict = {} validChainDict = {} self.nImports = 0 #holds imported address, by order of apparition, as lists: #[addrEntry, hashVal, byteLocation, rawData] importedDict = {} self.ncomments = 0 #holds all comments entries, as lists: [rawData, hashVal, dtype] commentDict = {} #in meta mode, the wallet's short and long labels are saved in entries #shortLabel and longLabel, pointing to a single str object rmode = Mode self.smode = Mode if Mode == RECOVERMODE.Meta: self.WO = True self.fileSize=0 if not os.path.exists(WalletPath): return self.BuildLogFile(-1, Progress, returnError) else: self.fileSize = os.path.getsize(WalletPath) toRecover = PyBtcWallet() toRecover.walletPath = WalletPath #consistency check try: toRecover.doWalletFileConsistencyCheck() except: #I expect 99% of errors raised here would be by Python's "os" module #failing an I/O operations, mainly for lack of credentials. LOGEXCEPT('') return self.BuildLogFile(-2, Progress, returnError) #fetch wallet content wltfile = open(WalletPath, 'rb') wltdata = BinaryUnpacker(wltfile.read()) wltfile.close() #unpack header try: returned = toRecover.unpackHeader(wltdata) except: LOGEXCEPT('') #Raises here come from invalid header parsing, meaning the file isn't #an Armory wallet to begin with, or the header is fubar return self.BuildLogFile(-1, Progress, returnError) self.UID = toRecover.uniqueIDB58 self.labelName = toRecover.labelName self.highestUsed = toRecover.highestUsedChainIndex #TODO: try to salvage broken header # compare uniqueIDB58 with recovered wallet self.UIreport = 'Analyzing wallet: %s
' % (toRecover.labelName \ if len(toRecover.labelName) != 0 \ else os.path.basename(WalletPath)) Progress(self.UIreport) if returned < 0: return self.BuildLogFile(-3, Progress, returnError) self.useEnc=0 rootAddr = toRecover.addrMap['ROOT'] #check for private keys (watch only?) if toRecover.watchingOnly is True: self.WO = True if not self.WO: #check if wallet is encrypted if toRecover.isLocked==True and rmode != RECOVERMODE.Meta: ''' Passphrase can one of be 3 things: 1) str 2) SecureBinaryData 3) a function that will return the passphrase (think user prompt) ''' if isinstance(Passphrase, str): SecurePassphrase = SecureBinaryData(Passphrase) Passphrase = '' elif isinstance(Passphrase, SecureBinaryData): SecurePassphrase = Passphrase.copy() elif hasattr(Passphrase, '__call__'): getPassphrase = Passphrase(toRecover) if isinstance(getPassphrase, SecureBinaryData): SecurePassphrase = getPassphrase.copy() getPassphrase.destroy() else: if rmode==RECOVERMODE.Check: self.WO = True else: return self.BuildLogFile(-4, Progress, returnError) else: if rmode==RECOVERMODE.Check: self.WO = True else: return self.BuildLogFile(-4, Progress, returnError) #if the wallet uses encryption, unlock ROOT and verify it if toRecover.isLocked and not self.WO: self.useEnc=1 if not toRecover.kdf: SecurePassphrase.destroy() return self.BuildLogFile(-10, Progress, returnError) secureKdfOutput = toRecover.kdf.DeriveKey(SecurePassphrase) if not toRecover.verifyEncryptionKey(secureKdfOutput): SecurePassphrase.destroy() secureKdfOutput.destroy() return self.BuildLogFile(-4, Progress, returnError) #DlgUnlockWallet may have filled kdfKey. Since this code can be #called with no UI and just the passphrase, gotta make sure this #member is cleaned up before setting it if isinstance(toRecover.kdfKey, SecureBinaryData): toRecover.kdfKey.destroy() toRecover.kdfKey = secureKdfOutput try: rootAddr.unlock(toRecover.kdfKey) except: LOGEXCEPT('') SecurePassphrase.destroy() return self.BuildLogFile(-12, Progress, returnError) else: SecurePassphrase = None #stripped recovery, we're done if rmode == RECOVERMODE.Stripped: RecoveredWallet = self.createRecoveredWallet(toRecover, rootAddr, \ SecurePassphrase, Progress, returnError) rootAddr.lock() if SecurePassphrase: SecurePassphrase.destroy() if not isinstance(RecoveredWallet, PyBtcWallet): return RecoveredWallet if isinstance(toRecover.kdfKey, SecureBinaryData): toRecover.kdfKey.destroy() if isinstance(RecoveredWallet.kdfKey, SecureBinaryData): RecoveredWallet.kdfKey.destroy() #stripped recovery, we are done return self.BuildLogFile(1, Progress, returnError) if rmode == RECOVERMODE.Meta: commentDict["shortLabel"] = toRecover.labelName commentDict["longLabel"] = toRecover.labelDescr ''' address entries may not be saved sequentially. To check the address chain is valid, all addresses will be unserialized and saved by chainIndex in addrDict. Then all addresses will be checked for consistency and proper chaining. Imported private keys and comments will be added at the tail of the file. ''' UIupdate = "" self.misc = [] #miscellaneous errors self.rawError = [] #raw binary errors' if prgAt: prgAt_in = prgAt[0] prgAt[0] = prgAt_in +prgAt[1]*0.01 #move on to wallet body toRecover.lastComputedChainIndex = -UINT32_MAX toRecover.lastComputedChainAddr160 = None while wltdata.getRemainingSize()>0: byteLocation = wltdata.getPosition() UIupdate = '- Reading wallet: %0.1f/%0.1f kB
' % \ (float(byteLocation)/KILOBYTE, float(self.fileSize)/KILOBYTE) if Progress(self.UIreport + UIupdate) == 0: if SecurePassphrase: SecurePassphrase.destroy() if toRecover.kdfKey: toRecover.kdfKey.destroy() rootAddr.lock() return 0 newAddr = None try: dtype, hashVal, rawData = toRecover.unpackNextEntry(wltdata) except NotImplementedError: self.misc.append('Found OPEVAL data entry at offest: %d' % \ (byteLocation)) pass except: LOGEXCEPT('') #Error in the binary file content. Try to skip an entry size amount #of bytes to find a valid entry. self.rawError.append('Raw binary error found at offset: %d' \ % (byteLocation)) dtype, hashVal, rawData, dataList = self.LookForFurtherEntry( \ wltdata, byteLocation) if dtype is None: #could not find anymore valid data self.rawError.append('Could not find anymore valid data past \ offset: %d' % (byteLocation)) break byteLocation = dataList[1] self.rawError.append(' Found a valid data entry at offset: %d' \ % (byteLocation)) if dataList[0] == 0: #found an address entry, but it has checksum errors newAddr = dataList[2] if dtype==WLT_DATATYPE_KEYDATA: if rmode != RECOVERMODE.Meta: if newAddr is None: newAddr = PyBtcAddress() try: newAddr.unserialize(rawData) except: LOGEXCEPT('') #unserialize error, try to recover the entry self.rawError.append( \ ' Found checksum errors in address entry starting at offset: %d' \ % (byteLocation)) try: newAddr, chksumError = \ self.addrEntry_unserialize_recover(rawData) self.rawError.append(' Recovered damaged entry') except: LOGEXCEPT('') #failed to recover the entry self.rawError.append( \ ' Could not recover damaged entry') newAddr = None if newAddr is not None: newAddr.walletByteLoc = byteLocation + 21 if newAddr.useEncryption: newAddr.isLocked = True #save address entry count in the file, to check #for entry sequence if newAddr.chainIndex > -2 : addrDict[newAddr.chainIndex] = \ [newAddr, hashVal, self.naddress, byteLocation, rawData] self.naddress = self.naddress +1 else: importedDict[self.nImports] = \ [newAddr, hashVal, byteLocation, rawData] self.nImports = self.nImports +1 else: self.naddress = self.naddress +1 elif dtype in (WLT_DATATYPE_ADDRCOMMENT, WLT_DATATYPE_TXCOMMENT): #if rmode > 2: if rmode in [RECOVERMODE.Full, RECOVERMODE.Meta, RECOVERMODE.Check]: commentDict[self.ncomments] = [rawData, hashVal, dtype] self.ncomments = self.ncomments +1 elif dtype==WLT_DATATYPE_OPEVAL: self.misc.append('Found OPEVAL data entry at offest: %d' % \ (byteLocation)) pass elif dtype==WLT_DATATYPE_DELETED: pass else: self.misc.append('Found unknown data entry type at offset: %d' % \ (byteLocation)) #TODO: try same trick as recovering from unpack errors? self.dataLastOffset = wltdata.getPosition() UIupdate = '- Reading wallet: %0.1f/%0.1f kB
' % \ (float(self.dataLastOffset)/KILOBYTE, float(self.fileSize)/KILOBYTE) self.UIreport = self.UIreport + UIupdate #verify the root address is derived from the root key if not self.WO: testroot = PyBtcAddress().createFromPlainKeyData( \ rootAddr.binPrivKey32_Plain, None, None, \ generateIVIfNecessary=True) if rootAddr.addrStr20 != testroot.addrStr20: self.rawError.append( \ ' root address was not derived from the root key') #verify chainIndex 0 was derived from the root address firstAddr = rootAddr.extendAddressChain(toRecover.kdfKey) if firstAddr.addrStr20 != addrDict[0][0].addrStr20: self.rawError.append(' chainIndex 0 was not derived from the \ root address') testroot.binPrivKey32_Plain.destroy() if rmode != RECOVERMODE.Meta: currSequence = addrDict[0][2] chaincode = addrDict[0][0].chaincode.toHexStr() else: currSequence = None chaincode = None commentDict['naddress'] = self.naddress self.naddress = 0 commentDict['ncomments'] = self.ncomments if prgAt: prgTotal = len(addrDict) + len(importedDict) + len(commentDict) #chained key pairs. for rmode is 4, no need to skip this part, #naddress will be 0 n=0 for i in addrDict: entrylist = [] entrylist = list(addrDict[i]) newAddr = entrylist[0] rawData = entrylist[4] byteLocation = entrylist[3] n = n+1 UIupdate = '- Processing address entries: %d/%d
' % \ (n, self.naddress) if Progress(self.UIreport + UIupdate) == 0: if SecurePassphrase: SecurePassphrase.destroy() if toRecover.kdfKey: toRecover.kdfKey.destroy() rootAddr.lock() return 0 if prgAt: prgAt[0] = prgAt_in + (0.01 + 0.99*n/prgTotal)*prgAt[1] # Fix byte errors in the address data fixedAddrData = newAddr.serialize() if not rawData==fixedAddrData: self.byteError.append([newAddr.chainIndex, byteLocation]) fixedAddr = PyBtcAddress() fixedAddr.unserialize(fixedAddrData) newAddr = PyBtcAddress() newAddr.unserialize(fixedAddrData) entrylist[0] = newAddr addrDict[i] = entrylist #check public key is a valid EC point if newAddr.hasPubKey(): if not CryptoECDSA().VerifyPublicKeyValid(newAddr.binPublicKey65): self.invalidPubKey.append([newAddr.chainIndex, byteLocation]) else: self.missingPubKey.append([newAddr.chainIndex, byteLocation]) #check chaincode consistency newCC = newAddr.chaincode.toHexStr() if newCC != chaincode: self.chainCodeCorruption.append([newAddr.chainIndex, byteLocation]) #check the address entry sequence nextSequence = entrylist[2] if nextSequence != currSequence: if (nextSequence - currSequence) != 1: self.brokenSequence.append([newAddr.chainIndex, byteLocation]) currSequence = nextSequence #check for gaps in the sequence isPubForked = False if newAddr.chainIndex > 0: seq = newAddr.chainIndex -1 prevEntry = [] while seq > -1: if seq in addrDict: break seq = seq -1 prevEntry = list(addrDict[seq]) prevAddr = prevEntry[0] gap = newAddr.chainIndex - seq if gap > 1: self.sequenceGaps.append([seq, newAddr.chainIndex]) #check public address chain if newAddr.hasPubKey(): cid = 0 extended = prevAddr.binPublicKey65 while cid < gap: extended = CryptoECDSA().ComputeChainedPublicKey( \ extended, prevAddr.chaincode) cid = cid +1 if extended.toHexStr() != newAddr.binPublicKey65.toHexStr(): self.forkedPublicKeyChain.append([newAddr.chainIndex, \ byteLocation]) isPubForked = True if not self.WO: #not a watch only wallet, check private/public key chaining and #integrity if newAddr.useEncryption != toRecover.useEncryption: if newAddr.useEncryption: self.misc.append('Encrypted address entry in a non encrypted \ wallet at chainIndex %d in wallet %s' % \ (newAddr.chainIndex, os.path.basename( \ WalletPath))) else: self.misc.append('Unencrypted address entry in an encrypted wallet at chainIndex %d in wallet %s' % \ (newAddr.chainIndex, os.path.basename( \ WalletPath))) keymismatch=0 """ 0: public key matches private key 1: public key doesn't match private key 2: private key is missing (encrypted) 3: public key is missing 4: private key is missing (unencrypted) """ if not newAddr.hasPrivKey(): #entry has no private key keymismatch=2 if not newAddr.useEncryption: #uncomputed private key in a non encrypted wallet? #definitely not supposed to happen keymismatch = 4 self.misc.append('Uncomputed private key in unencrypted wallet at chainIndex %d in wallet %s' \ % (newAddr.chainIndex, os.path.basename \ (WalletPath))) else: self.misc.append('Missing private key is not flagged for computation at chainIndex %d in wallet %s'\ % (newAddr.chainIndex, os.path.basename \ (WalletPath))) else: if newAddr.createPrivKeyNextUnlock: #have to build the private key on unlock; we can use prevAddr #for that purpose, used to chain the public key off of newAddr.createPrivKeyNextUnlock_IVandKey[0] = \ prevAddr.binInitVect16.copy() newAddr.createPrivKeyNextUnlock_IVandKey[1] = \ prevAddr.binPrivKey32_Encr.copy() newAddr.createPrivKeyNextUnlock_ChainDepth = \ newAddr.chainIndex - prevAddr.chainIndex #unlock if necessary if keymismatch == 0: if newAddr.isLocked: try: newAddr.unlock(toRecover.kdfKey) keymismatch = 0 except KeyDataError: keymismatch = 1 isPrivForked = False validAddr = None if newAddr.chainIndex > 0 and keymismatch != 2: #if the wallet has the private key, derive it from the #chainIndex and compare. If they mismatch, save the bad #private key as -3 -chainIndex in the saved wallet. Additionally, #derive the private key in case it is missing (keymismatch==4) gap = newAddr.chainIndex prevkey = None if prevAddr.useEncryption: if prevAddr.binPrivKey32_Encr.getSize() == 32: gap = newAddr.chainIndex - prevAddr.chainIndex prevkey = CryptoAES().DecryptCFB( \ prevAddr.binPrivKey32_Encr, \ SecureBinaryData(toRecover.kdfKey), \ prevAddr.binInitVect16) else: if prevAddr.binPrivKey32_Plain.getSize() == 32: gap = newAddr.chainIndex - prevAddr.chainIndex prevkey = prevAddr.binPrivKey32_Plain if gap == newAddr.chainIndex: #coudln't get a private key from prevAddr, #derive from root addr prevAddr = addrDict[0][0] if prevAddr.useEncryption: prevkey = CryptoAES().DecryptCFB( \ prevAddr.binPrivKey32_Encr, \ SecureBinaryData(toRecover.kdfKey), \ prevAddr.binInitVect16) else: prevkey = prevAddr.binPrivKey32_Plain for t in range(0, gap): prevkey = prevAddr.safeExtendPrivateKey( \ prevkey, \ prevAddr.chaincode) if keymismatch != 4: if prevkey.toHexStr() != \ newAddr.binPrivKey32_Plain.toHexStr(): """ Special case: The private key saved in the wallet doesn't match the extended private key. 2 things to do: 1) Save the current address entry as an import, as -chainIndex -3 2) After the address entry has been analyzed, replace it with a valid one, to keep on checking the chain. """ isPrivForked = True validAddr = newAddr.copy() validAddr.binPrivKey32_Plain = prevkey.copy() validAddr.binPublicKey65 = CryptoECDSA().ComputePublicKey(\ validAddr.binPrivKey32_Plain) validAddr.chainCode = prevAddr.chaincode.copy() validAddr.keyChanged = True if validAddr.useEncryption: validAddr.keyChanged = True validAddr.lock(secureKdfOutput=toRecover.kdfKey) if isPubForked is not True: self.forkedPublicKeyChain.append([newAddr.chainIndex, \ byteLocation]) if isPrivForked is False: chID = newAddr.chainIndex validchID = 0 for ids in range(chID -1, 0, -1): if ids in validChainDict: validchID = ids break validChainAddr = validChainDict[validchID] if validChainAddr.useEncryption: validPrivKey = CryptoAES().DecryptCFB( \ validChainAddr.binPrivKey32_Encr, \ SecureBinaryData(toRecover.kdfKey), \ validChainAddr.binInitVect16) else: validPrivKey = validChainAddr.binPrivKey32_Plain.copy() gap = chID - validchID for t in range(0, gap): validPrivKey = validChainAddr.safeExtendPrivateKey( \ validPrivKey, \ validChainAddr.chaincode) if prevkey.toHexStr() != validPrivKey.toHexStr(): isPrivForked = True validAddr = newAddr.copy() validAddr.binPrivKey32_Plain = validPrivKey.copy() validAddr.binPublicKey65 = \ CryptoECDSA().ComputePublicKey( \ validAddr.binPrivKey32_Plain) validAddr.chainCode = validChainAddr.chaincode.copy() if validAddr.useEncryption: validAddr.keyChanged = True validAddr.lock(secureKdfOutput=toRecover.kdfKey) validPrivKey.destroy() else: newAddr.binPrivKey32_Plain = prevkey.copy() prevkey.destroy() if validAddr is None: validChainDict[i] = newAddr else: validChainDict[i] = validAddr #deal with mismatch scenarios if keymismatch == 1: self.unmatchedPair.append([newAddr.chainIndex, byteLocation]) #TODO: needs better handling for keymismatch == 2 elif keymismatch == 2: self.misc.append('no private key at chainIndex %d in wallet %s'\ % (newAddr.chainIndex, WalletPath)) elif keymismatch == 3: newAddr.binPublicKey65 = \ CryptoECDSA().ComputePublicKey(newAddr.binPrivKey32_Plain) newAddr.addrStr20 = newAddr.binPublicKey65.getHash160() #if we have clear possible mismatches (or there were none), #proceed to consistency checks if keymismatch == 0: if not CryptoECDSA().CheckPubPrivKeyMatch( \ newAddr.binPrivKey32_Plain, \ newAddr.binPublicKey65): self.unmatchedPair.append([newAddr.chainIndex, byteLocation]) if newAddr.addrStr20 != entrylist[1]: self.hashValMismatch.append([newAddr.chainIndex, byteLocation]) if isPrivForked: negImport = newAddr.copy() negImport.chainIndex = -3 -newAddr.chainIndex if negImport.useEncryption: negImport.lock() importedDict[self.nImports] = [negImport, 0, 0, 0] self.nImports = self.nImports +1 if newAddr.useEncryption: newAddr.lock() if self.naddress > 0: self.UIreport = self.UIreport + UIupdate #imported addresses if not self.WO: for i in range(0, self.nImports): entrylist = [] entrylist = list(importedDict[i]) newAddr = entrylist[0] rawData = entrylist[3] UIupdate = '- Processing imported address entries: \ %d/%d
' % (i +1, self.nImports) if Progress(self.UIreport + UIupdate) == 0: if SecurePassphrase: SecurePassphrase.destroy() if toRecover.kdfKey: toRecover.kdfKey.destroy() rootAddr.lock() return 0 if prgAt: prgAt[0] = prgAt_in + (0.01 + 0.99*(newAddr.chainIndex +1) \ /prgTotal)*prgAt[1] if newAddr.chainIndex <= -2: if newAddr.chainIndex < -2: self.negativeImports.append(newAddr.addrStr20) else: # Fix byte errors in the address data fixedAddrData = newAddr.serialize() if not rawData==fixedAddrData: self.importedErr.append('found byte error in imported \ address %d at file offset %d' % (i, entrylist[2])) newAddr = PyBtcAddress() newAddr.unserialize(fixedAddrData) entrylist[0] = newAddr importedDict[i] = entrylist #check public key is a valid EC point if newAddr.hasPubKey(): if not CryptoECDSA().VerifyPublicKeyValid( \ newAddr.binPublicKey65): self.importedErr.append('invalid pub key for imported \ address %d at file offset %d\r\n' % (i, entrylist[2])) else: self.importedErr.append('missing pub key for imported \ address %d at file offset %d\r\n' % (i, entrylist[2])) #if there a private key in the entry, check for consistency if not newAddr.hasPrivKey(): self.importedErr.append('missing private key for imported \ address %d at file offset %d\r\n' % (i, entrylist[2])) else: if newAddr.useEncryption != toRecover.useEncryption: if newAddr.useEncryption: self.importedErr.append('Encrypted address entry in \ a non encrypted wallet for imported address %d at \ file offset %d\r\n' % (i, entrylist[2])) else: self.importedErr.append('Unencrypted address entry in \ an encrypted wallet for imported address %d at file \ offset %d\r\n' % (i, entrylist[2])) keymismatch = 0 if newAddr.isLocked: try: newAddr.unlock(toRecover.kdfKey) except KeyDataError: keymismatch = 1 self.importedErr.append('pub key doesnt match private \ key for imported address %d at file offset %d\r\n' \ % (i, entrylist[2])) if keymismatch == 0: #pubkey is present, check against priv key if not CryptoECDSA().CheckPubPrivKeyMatch( \ newAddr.binPrivKey32_Plain, newAddr.binPublicKey65): keymismatch = 1 self.importedErr.append('pub key doesnt match private \ key for imported address %d at file offset %d\r\n' \ % (i, entrylist[2])) if keymismatch == 1: #compute missing/invalid pubkey newAddr.binPublicKey65 = CryptoECDSA().ComputePublicKey( \ newAddr.binPrivKey32_Plain) #check hashVal if newAddr.addrStr20 != entrylist[1] and newAddr.chainIndex == 2: newAddr.addrStr20 = newAddr.binPublicKey65.getHash160() self.importedErr.append('hashVal doesnt match addrStr20 \ for imported address %d at file offset %d\r\n' \ % (i, entrylist[2])) #if the entry was encrypted, lock it back with the new wallet #kdfkey if newAddr.useEncryption: newAddr.lock() if self.nImports > 0: self.UIreport = self.UIreport + UIupdate #TODO: check comments consistency nerrors = len(self.rawError) + len(self.byteError) + \ len(self.sequenceGaps) + len(self.forkedPublicKeyChain) + \ len(self.chainCodeCorruption) + len(self.invalidPubKey) + \ len(self.missingPubKey) + len(self.hashValMismatch) + \ len(self.unmatchedPair) + len(self.importedErr) + len(self.misc) if nerrors: if not self.WO or rmode == RECOVERMODE.Full: if rmode < RECOVERMODE.Meta: #create recovered wallet RecoveredWallet = self.createRecoveredWallet(toRecover, \ rootAddr, SecurePassphrase, Progress, returnError) if SecurePassphrase: RecoveredWallet.kdfKey = \ RecoveredWallet.kdf.DeriveKey(SecurePassphrase) rootAddr.lock() if not isinstance(RecoveredWallet, PyBtcWallet): if SecurePassphrase: SecurePassphrase.destroy() if toRecover.kdfKey: toRecover.kdfKey.destroy() return RecoveredWallet #build address pool for i in range(1, self.naddress): UIupdate = '- Building address chain: %d/%d
' % \ (i+1, self.naddress) if Progress(self.UIreport + UIupdate) == 0: if SecurePassphrase: SecurePassphrase.destroy() if toRecover.kdfKey: toRecover.kdfKey.destroy() if RecoveredWallet.kdfKey: RecoveredWallet.kdfKey.destroy() return 0 #TODO: check this builds the proper address chain, #and saves encrypted private keys RecoveredWallet.computeNextAddress(None, False, True) if Progress and self.naddress > 0: self.UIreport = self.UIreport + UIupdate #save imported addresses if rootAddr.isLocked: rootAddr.unlock(toRecover.kdfKey) invQ = self.getInvModOfHMAC(rootAddr.binPrivKey32_Plain.toBinStr()) regQ = self.getValidKeyHMAC(rootAddr.binPrivKey32_Plain.toBinStr()) rootAddr.lock() for i in range(0, self.nImports): UIupdate = '- Saving imported addresses: %d/%d
' \ % (i+1, self.nImports) if Progress(self.UIreport + UIupdate) == 0: if SecurePassphrase: SecurePassphrase.destroy() if toRecover.kdfKey: toRecover.kdfKey.destroy() if RecoveredWallet.kdfKey: RecoveredWallet.kdfKey.destroy() return 0 entrylist = [] entrylist = list(importedDict[i]) newAddr = entrylist[0] if newAddr.isLocked: newAddr.unlock(toRecover.kdfKey) if newAddr.chainIndex < -2: privMultiplier = CryptoECDSA().ECMultiplyScalars( \ newAddr.binPrivKey32_Plain.toBinStr(), invQ.toBinStr()) self.privKeyMultipliers.append(binary_to_hex(privMultiplier)) # Sanity check that the multipliers are correct recov = CryptoECDSA().ECMultiplyScalars(privMultiplier, regQ.toBinStr()) if not recov==newAddr.binPrivKey32_Plain.toBinStr(): # Unfortunately I'm not sure what to do here if it doesn't match # We know no ther way to handle it... LOGERROR('Logging a multiplier that does not match!?') if newAddr.useEncryption: newAddr.keyChanged = 1 newAddr.lock(RecoveredWallet.kdfKey) RecoveredWallet.walletFileSafeUpdate([[WLT_UPDATE_ADD, \ WLT_DATATYPE_KEYDATA, newAddr.addrStr20, newAddr]]) if Progress and self.nImports > 0: self.UIreport = \ self.UIreport + UIupdate invQ,regQ = None,None #save comments if rmode == RECOVERMODE.Full: for i in range(0, self.ncomments): UIupdate = '- Saving comment entries: %d/%d
' \ % (i+1, self.ncomments) if Progress(self.UIreport + UIupdate) == 0: if SecurePassphrase: SecurePassphrase.destroy() if toRecover.kdfKey: toRecover.kdfKey.destroy() if RecoveredWallet.kdfKey: RecoveredWallet.kdfKey.destroy() return 0 entrylist = [] entrylist = list(commentDict[i]) RecoveredWallet.walletFileSafeUpdate([[WLT_UPDATE_ADD, \ entrylist[2], entrylist[1], entrylist[0]]]) if Progress and self.ncomments > 0: self.UIreport = \ self.UIreport + UIupdate if isinstance(rootAddr.binPrivKey32_Plain, SecureBinaryData): rootAddr.lock() #TODO: nothing to process anymore at this point. if the recovery mode #is 4 (meta), just return the comments dict if isinstance(toRecover.kdfKey, SecureBinaryData): toRecover.kdfKey.destroy() if RecoveredWallet is not None: if isinstance(RecoveredWallet.kdfKey, SecureBinaryData): RecoveredWallet.kdfKey.destroy() if SecurePassphrase: SecurePassphrase.destroy() if rmode != RECOVERMODE.Meta: if nerrors == 0: return self.BuildLogFile(0, Progress, returnError, nerrors) else: return self.BuildLogFile(1, Progress, returnError, nerrors) else: return commentDict ############################################################################ def createRecoveredWallet(self, toRecover, rootAddr, SecurePassphrase, Progress, returnError): self.newwalletPath = os.path.join(os.path.dirname(toRecover.walletPath), 'armory_%s_RECOVERED%s.wallet' % \ (toRecover.uniqueIDB58, '.watchonly' \ if self.WO else '')) if os.path.exists(self.newwalletPath): try: os.remove(self.newwalletPath) except: LOGEXCEPT('') return self.BuildLogFile(-2, Progress, returnError) try: if not self.WO: RecoveredWallet = PyBtcWallet() RecoveredWallet.createNewWallet( \ newWalletFilePath=self.newwalletPath, \ securePassphrase=SecurePassphrase, \ plainRootKey=rootAddr.binPrivKey32_Plain, \ chaincode=rootAddr.chaincode, \ #not registering with the BDM, #so no addresses are computed doRegisterWithBDM=False, \ shortLabel=toRecover.labelName, \ longLabel=toRecover.labelDescr) else: RecoveredWallet = self.createNewWO(toRecover, \ self.newwalletPath, rootAddr) except: LOGEXCEPT('') #failed to create new file return self.BuildLogFile(-2, Progress, returnError) return RecoveredWallet ############################################################################ def LookForFurtherEntry(self, rawdata, loc): """ Attempts to find valid data entries in wallet file by skipping known byte widths. The process: 1) Assume an address entry with invalid data type key and/or the hash160. Read ahead and try to unserialize a valid PyBtcAddress 2) Assume a corrupt address entry. Move 1+20+237 bytes ahead, try to unpack the next entry At this point all entries are of random length. The most accurate way to define them as valid is to try and unpack the next entry, or check end of file has been hit gracefully 3) Try for address comment 4) Try for transaction comment 5) Try for deleted entry 6) At this point, can still try for random byte search. Essentially, push an incremental amount of bytes until a valid entry or the end of the file is hit. Simplest way around it is to recursively call this member with an incremented loc About address entries: currently, the code tries to fully unserialize tentative address entries. It will most likely raise at the slightest error. However, that doesn't mean the entry is entirely bogus, or not an address entry at all. Individual data packets should be checked against their checksum for validity in a full implementation of the raw data recovery layer of this tool. Other entries do not carry checksums and thus appear opaque to this recovery layer. TODO: 1) verify each checksum data block in address entries 2) same with the file header """ #check loc against data end. if loc >= rawdata.getSize(): return None, None, None, [0] #reset to last known good offset rawdata.resetPosition(loc) #try for address entry: push 1 byte for the key, 20 for the public key #hash, try to unpack the next 237 bytes as an address entry try: rawdata.advance(1) hash160 = rawdata.get(BINARY_CHUNK, 20) chunk = rawdata.get(BINARY_CHUNK, self.pybtcaddrSize) newAddr, chksumError = self.addrEntry_unserialize_recover(chunk) #if we got this far, no exception was raised, return the valid entry #and hash, but invalid key if chksumError != 0: #had some checksum errors, pass the data on return 0, hash160, chunk, [0, loc, newAddr, chksumError] return 0, hash160, chunk, [1, loc] except: LOGEXCEPT('') #unserialize error, move on rawdata.resetPosition(loc) #try for next entry try: rawdata.advance(1+20+237) dtype, hash, chunk = PyBtcWallet().unpackNextEntry(rawdata) if dtype>-1 and dtype<5: return dtype, hash, chunk, [1, loc +1+20+237] else: rawdata.resetPosition(loc) except: LOGEXCEPT('') rawdata.resetPosition(loc) #try for addr comment: push 1 byte for the key, 20 for the hash160, #2 for the N and N for the comment try: rawdata.advance(1) hash160 = rawdata.get(BINARY_CHUNK, 20) chunk_length = rawdata.get(UINT16) chunk = rawdata.get(BINARY_CHUNK, chunk_length) #test the next entry dtype, hash, chunk2 = PyBtcWallet().unpackNextEntry(rawdata) if dtype>-1 and dtype<5: #good entry, return it return 1, hash160, chunk, [1, loc] else: rawdata.resetPosition(loc) except: LOGEXCEPT('') rawdata.resetPosition(loc) #try for txn comment: push 1 byte for the key, 32 for the txnhash, #2 for N, and N for the comment try: rawdata.advance(1) hash256 = rawdata.get(BINARY_CHUNK, 32) chunk_length = rawdata.get(UINT16) chunk = rawdata.get(BINARY_CHUNK, chunk_length) #test the next entry dtype, hash, chunk2 = PyBtcWallet().unpackNextEntry(rawdata) if dtype>-1 and dtype<5: #good entry, return it return 2, hash256, chunk, [1, loc] else: rawdata.resetPosition(loc) except: LOGEXCEPT('') rawdata.resetPosition(loc) #try for deleted entry: 1 byte for the key, 2 bytes for N, N bytes #worth of 0s try: rawdata.advance(1) chunk_length = rawdata.get(UINT16) chunk = rawdata.get(BINARY_CHUNK, chunk_length) #test the next entry dtype, hash, chunk2 = PyBtcWallet().unpackNextEntry(rawdata) if dtype>-1 and dtype<5: baddata = 0 for i in len(chunk): if i != 0: baddata = 1 break if baddata != 0: return 4, None, chunk, [1, loc] rawdata.resetPosition(loc) except: LOGEXCEPT('') rawdata.resetPosition(loc) #couldn't find any valid entries, push loc by 1 and try again loc = loc +1 return self.LookForFurtherEntry(rawdata, loc) ############################################################################ def addrEntry_unserialize_recover(self, toUnpack): """ Unserialze a raw address entry, test all checksum carrying members On errors, flags chksumError bits as follows: bit 0: addrStr20 error bit 1: private key error bit 2: contains a valid private key even though containsPrivKey is 0 bit 3: iv error bit 4: contains a valid iv even though useEncryption is 0 bit 5: pubkey error bit 6: contains a valid pubkey even though containsPubKey is 0 bit 7: chaincode error """ if isinstance(toUnpack, BinaryUnpacker): serializedData = toUnpack else: serializedData = BinaryUnpacker( toUnpack ) def chkzero(a): """ Due to fixed-width fields, we will get lots of zero-bytes even when the binary data container was empty """ if a.count('\x00')==len(a): return '' else: return a chksumError = 0 # Start with a fresh new address retAddr = PyBtcAddress() retAddr.addrStr20 = serializedData.get(BINARY_CHUNK, 20) chkAddr20 = serializedData.get(BINARY_CHUNK, 4) addrVerInt = serializedData.get(UINT32) flags = serializedData.get(UINT64) retAddr.addrStr20 = verifyChecksum(self.addrStr20, chkAddr20) flags = int_to_bitset(flags, widthBytes=8) # Interpret the flags containsPrivKey = (flags[0]=='1') containsPubKey = (flags[1]=='1') retAddr.useEncryption = (flags[2]=='1') retAddr.createPrivKeyNextUnlock = (flags[3]=='1') if len(self.addrStr20)==0: chksumError |= 1 # Write out address-chaining parameters (for deterministic wallets) retAddr.chaincode = chkzero(serializedData.get(BINARY_CHUNK, 32)) chkChaincode = serializedData.get(BINARY_CHUNK, 4) retAddr.chainIndex = serializedData.get(INT64) depth = serializedData.get(INT64) retAddr.createPrivKeyNextUnlock_ChainDepth = depth # Correct errors, convert to secure container retAddr.chaincode = SecureBinaryData(verifyChecksum(retAddr.chaincode, \ chkChaincode)) if retAddr.chaincode.getSize == 0: chksumError |= 128 # Write out whatever is appropriate for private-key data # Binary-unpacker will write all 0x00 bytes if empty values are given iv = chkzero(serializedData.get(BINARY_CHUNK, 16)) chkIv = serializedData.get(BINARY_CHUNK, 4) privKey = chkzero(serializedData.get(BINARY_CHUNK, 32)) chkPriv = serializedData.get(BINARY_CHUNK, 4) iv = SecureBinaryData(verifyChecksum(iv, chkIv)) privKey = SecureBinaryData(verifyChecksum(privKey, chkPriv)) # If this is SUPPOSED to contain a private key... if containsPrivKey: if privKey.getSize()==0: chksumError |= 2 containsPrivKey = 0 else: if privKey.getSize()==32: chksumError |= 4 containsPrivKey = 1 if retAddr.useEncryption: if iv.getSize()==0: chksumError |= 8 retAddr.useEncryption = 0 else: if iv.getSize()==16: chksumError |= 16 retAddr.useEncryption = 1 if retAddr.useEncryption: if retAddr.createPrivKeyNextUnlock: retAddr.createPrivKeyNextUnlock_IVandKey[0] = iv.copy() retAddr.createPrivKeyNextUnlock_IVandKey[1] = privKey.copy() else: retAddr.binInitVect16 = iv.copy() retAddr.binPrivKey32_Encr = privKey.copy() else: retAddr.binInitVect16 = iv.copy() retAddr.binPrivKey32_Plain = privKey.copy() pubKey = chkzero(serializedData.get(BINARY_CHUNK, 65)) chkPub = serializedData.get(BINARY_CHUNK, 4) pubKey = SecureBinaryData(verifyChecksum(pubKey, chkPub)) if containsPubKey: if not pubKey.getSize()==65: chksumError |= 32 if retAddr.binPrivKey32_Plain.getSize()==32: pubKey = CryptoECDSA().ComputePublicKey( retAddr.binPrivKey32_Plain) else: if pubKey.getSize()==65: chksumError |= 64 retAddr.binPublicKey65 = pubKey retAddr.timeRange[0] = serializedData.get(UINT64) retAddr.timeRange[1] = serializedData.get(UINT64) retAddr.blkRange[0] = serializedData.get(UINT32) retAddr.blkRange[1] = serializedData.get(UINT32) retAddr.isInitialized = True if (chksumError and 171) == 171: raise InvalidEntry if chksumError != 0: #write out errors to the list self.rawError.append(' Encountered checksum errors in follolwing \ address entry members:') if chksumError and 1: self.rawError.append(' - addrStr20') if chksumError and 2: self.rawError.append(' - private key') if chksumError and 4: self.rawError.append(' - hasPrivatKey flag') if chksumError and 8: self.rawError.append(' - Encryption IV') if chksumError and 16: self.rawError.append(' - useEncryption flag') if chksumError and 32: self.rawError.append(' - public key') if chksumError and 64: self.rawError.append(' - hasPublicKey flag') if chksumError and 128: self.rawError.append(' - chaincode') return retAddr, chksumError ############################################################################ def createNewWO(self, toRecover, newPath, rootAddr): newWO = PyBtcWallet() newWO.version = toRecover.version newWO.magicBytes = toRecover.magicBytes newWO.wltCreateDate = toRecover.wltCreateDate newWO.uniqueIDBin = toRecover.uniqueIDBin newWO.useEncryption = False newWO.watchingOnly = True newWO.walletPath = newPath if toRecover.labelName: newWO.labelName = toRecover.labelName[:32] if toRecover.labelDescr: newWO.labelDescr = toRecover.labelDescr[:256] newAddr = rootAddr.copy() newAddr.binPrivKey32_Encr = SecureBinaryData() newAddr.binPrivKey32_Plain = SecureBinaryData() newAddr.useEncryption = False newAddr.createPrivKeyNextUnlock = False newWO.addrMap['ROOT'] = newAddr firstAddr = newAddr.extendAddressChain() newWO.addrMap[firstAddr.getAddr160()] = firstAddr newWO.lastComputedChainAddr160 = firstAddr.getAddr160() newWO.lastComputedChainIndex = firstAddr.chainIndex newWO.highestUsedChainIndex = toRecover.highestUsedChainIndex newWO.cppWallet = BtcWallet() newWO.writeFreshWalletFile(newPath) return newWO ############################################################################ def getValidKeyHMAC(self, Q): nonce = 0 while True: hmacQ = HMAC256(Q, 'LogMult%d' % nonce) if binary_to_int(hmacQ, BIGENDIAN) >= SECP256K1_ORDER: nonce += 1 continue return SecureBinaryData(hmacQ) ############################################################################ def getInvModOfHMAC(self, Q): hmacQ = self.getValidKeyHMAC(Q) return CryptoECDSA().InvMod(SecureBinaryData(hmacQ)) ############################################################################### def WalletConsistencyCheck(wallet, prgAt=None): """ Checks consistency of non encrypted wallet data Returns 0 if no error was found, otherwise a string list of the scan full log """ return PyBtcWalletRecovery().ProcessWallet(None, wallet, None, RECOVERMODE.Check, prgAt, True) ############################################################################# # We don't have access to the qtdefines:tr function, but we still want # the capability to print multi-line strings within the code. This simply # strips each line and then concatenates them together def tr_(s): return ' '.join([line.strip() for line in s.split('\n')]) ############################################################################# @AllowAsync def FixWallet(wltPath, wlt, mode=RECOVERMODE.Full, DoNotMove=False, Passphrase=None, Progress=emptyFunc): ''' return code: 0 - no wallet errors found, nothing to fix 1 - errors found, wallet fixed str - errors found, couldnt fix wallet, returning the error as a str ''' fixer = PyBtcWalletRecovery() frt = fixer.ProcessWallet(wltPath, wlt, Passphrase, mode, Progress=Progress) # Shorten a bunch of statements datestr = RightNowStr('%Y-%m-%d-%H%M') if wlt: homedir = os.path.dirname(wlt.walletPath) wltID = wlt.uniqueIDB58 else: homedir = os.path.dirname(wltPath) wltID = fixer.UID if frt == 0: Progress(fixer.UIreport + fixer.EndLog) return 0, 0, fixer elif frt == 1 or (isinstance(frt, dict) and frt['nErrors'] != 0): Progress(fixer.UIreport) if DoNotMove: Progress(fixer.UIreport + fixer.EndLog) return 1, 0, fixer else: #move the old wallets and log files to another folder corruptFolder = os.path.join(homedir, wltID, datestr) if not os.path.exists(corruptFolder): os.makedirs(corruptFolder) logsToCopy = ['armorylog.txt', 'armorycpplog.txt', 'multipliers.txt'] wltCopyName = 'armory_%s_ORIGINAL_%s.wallet' % (wltID, '.watchonly') wltLogName = 'armory_%s_LOGFILE_%s.log' % \ (wltID, '.watchonly' if fixer.WO else '') corruptWltPath = os.path.join(corruptFolder, wltCopyName) recoverLogPath = os.path.join(corruptFolder, wltLogName) try: if not fixer.WO: #wallet has private keys, make a WO version and delete it wlt.forkOnlineWallet(corruptWltPath, wlt.labelName, wlt.labelDescr) os.remove(wlt.walletPath) else: os.rename(wlt.walletPath, corruptWltPath) if os.path.exists(fixer.LogPath): os.rename(fixer.LogPath, os.path.join(corruptFolder, wltLogName)) if os.path.exists(fixer.newwalletPath): os.rename(fixer.newwalletPath, wlt.walletPath) #remove backups origBackup = getSuffixedPath(wlt.walletPath, 'backup') if os.path.exists(origBackup): os.remove(origBackup) newBackup = getSuffixedPath(fixer.newwalletPath, 'backup') if os.path.exists(newBackup): os.remove(newBackup) # Copy all the relevant log files for fn in logsToCopy: fullpath = os.path.join(homedir, fn) if os.path.exists(fullpath): shutil.copy(fullpath, corruptFolder) else: LOGERROR('Expected log file was not copied: %s', fn) fixer.EndLog = ("""
Wallet analysis and restoration complete.
The inconsistent wallet and log files were moved to:
%s/

""") % corruptFolder Progress(fixer.UIreport + fixer.EndLog) return 1, corruptFolder, fixer except Exception as e: #failed to move files around, most likely a credential error LOGEXCEPT(str(e)) errStr = '
An error occurred moving wallet files: %s' % e Progress(fixer.UIreport + errStr) return -1, fixer.UIreport + errStr, fixer else: Progress(fixer.UIreport + fixer.EndLog) return -1, fixer.UIreport + fixer.EndLog, fixer ############################################################################### @AllowAsync def FixWalletList(wallets, dlg, Progress=emptyFunc): #It's the caller's responsibility to unload the wallets from his app #fix the wallets fixedWlt = [] wlterror = [] goodWallets = [] fixerObjs = [] logsSaved = [] for wlt in wallets: if dlg: status = [0] dlg.sigSetNewProgress(status) while not status[0]: sleep(0.01) wltStatus, extraData, recovObj = FixWallet( \ '', wlt, Passphrase=dlg.AskUnlock, Progress=Progress) fixerObjs.append(recovObj) if wltStatus == 0: goodWallets.append(wlt.uniqueIDB58) fixedWlt.append(wlt.walletPath) elif wltStatus == 1: fixedWlt.append(wlt.walletPath) logsSaved.append([wlt.uniqueIDB58, extraData]) elif wltStatus == -1: wlterror.append([wlt.uniqueIDB58, extraData]) if dlg: dlg.setRecoveryDone(wlterror, goodWallets, fixedWlt, fixerObjs) #load the new wallets dlg.loadFixedWallets(fixedWlt) else: return wlterror ############################################################################### ''' Stand alone, one wallet a time, all purpose recovery call. Used with unloaded wallets or modes other than Full, and for armoryd If dlg is set, it will report to it (UI) If not, it will log the wallet status with LOGERROR and LOGINFO, and return the status code to the caller ''' @AllowAsync def ParseWallet(wltPath, wlt, mode, dlg, Progress=emptyFunc): fixedWlt = [] wlterror = [] goodWallets = [] inPassphrase = dlg.AskUnlock if dlg else None wltStatus, extraData, recovObj = FixWallet(wltPath, wlt, mode, True, Passphrase=inPassphrase, Progress=Progress) if wltStatus == 0: goodWallets.append(1) fixedWlt.append(1) if dlg is None: if wlt: LOGINFO('Wallet %s is consistent' % (wlt.uniqueIDB58)) elif wltPath: LOGINFO('Wallet %s is consistent' % (wltPath)) elif wltStatus == 1: fixedWlt.append(1) if dlg is None: if wlt: LOGERROR('Wallet %s is inconsistent!!!' % (wlt.uniqueIDB58)) elif wltPath: LOGERROR('Wallet %s is inconsistent!!!' % (wltPath)) elif wltStatus == -1: wlterror.append(extraData) if dlg is None: if wlt: LOGERROR('Failed to perform consistency check on wallet %s!!!'\ % (wlt.uniqueIDB58)) elif wltPath: LOGERROR('Failed to perform consistency check on wallet %s!!!'\ % (wltPath)) if dlg: dlg.setRecoveryDone(wlterror, goodWallets, fixedWlt, [recovObj]) else: return wltStatus armory-0.92.3/armoryengine/Script.py0000644000000000000000000005631312414772654016155 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ ################################################################################ # # SCRIPTING! # ################################################################################ from armoryengine.ArmoryUtils import * from armoryengine.BinaryPacker import UINT8, BINARY_CHUNK, UINT16, UINT32 from armoryengine.BinaryUnpacker import BinaryUnpacker from armoryengine.Timer import TimeThisFunction from armoryengine.Transaction import * def convertScriptToOpStrings(binScript): opList = [] i = 0; sz = len(binScript) error = False; while i < sz: nextOp = ord(binScript[i]); if nextOp == 0: opList.append("0") i+=1 elif nextOp < 76: opList.append('PUSHDATA(%s)' % str(nextOp)) binObj = binScript[i+1:i+1+nextOp] opList.append('['+binary_to_hex(binObj)+']') i += nextOp+1 elif nextOp == 76: nb = binary_to_int(binScript[i+1:i+2]) if i+1+1+nb > sz: error = True; break binObj = binScript[i+2:i+2+nb] opList.append('OP_PUSHDATA1(%s)' % str(nb)) opList.append('['+binary_to_hex(binObj)+']') i += nb+2 elif nextOp == 77: nb = binary_to_int(binScript[i+1:i+3]); if i+1+2+nb > sz: error = True; break nbprint = min(nb,256) binObj = binScript[i+3:i+3+nbprint] opList.append('OP_PUSHDATA2(%s)' % str(nb)) opList.append('['+binary_to_hex(binObj)[:512] + '...]') i += nb+3 elif nextOp == 78: nb = binScript[i+1:i+5]; if i+1+4+nb > sz: error = True; break nbprint = min(nb,256) binObj = binScript[i+5,i+5+nbprint] opList.append('[OP_PUSHDATA4(%s)]' % str(nb)) opList.append('['+binary_to_hex(binObj)[:512] + '...]') i += nb+5 else: opList.append(opnames[nextOp]); i += 1 if error: opList.append("ERROR PROCESSING SCRIPT"); return opList; def pprintScript(binScript, nIndent=0): indstr = indent*nIndent print indstr + 'Script:' opList = convertScriptToOpStrings(binScript) for op in opList: print indstr + indent + op def scriptPushData(binObj): sz = len(binObj) if sz <= 76: lenByte = int_to_binary(sz, widthBytes=1) return lenByte+binObj elif sz <= 256: lenByte = int_to_binary(sz, widthBytes=1) return '\x4c' + lenByte + binObj elif sz <= 65536: lenBytes = int_to_binary(sz, widthBytes=2) return '\x4d' + lenBytes + binObj else: InvalidScriptError('Cannot use PUSHDATA for len(obj)>65536') class ScriptBuilder(object): def __init__(self): self.opList = [] def addOpCode(self, opStr): self.opList.append(getOpCode(opStr)) def pushData(self, data): if data.startswith('OP_'): LOGWARN('Looks like you accidentally called pushData instead of addOpCode') LOGWARN('Pushing data: ' + data) self.opList.append(scriptPushData(data)) def getBinaryScript(self): return ''.join(self.opList) def getHexScript(self): return binary_to_hex(''.join(self.opList)) def getHumanScript(self): # Human-readable return ' '.join(convertScriptToOpStrings(self.getBinaryScript())) TX_INVALID = 0 OP_NOT_IMPLEMENTED = 1 OP_DISABLED = 2 SCRIPT_STACK_SIZE_ERROR = 3 SCRIPT_ERROR = 4 SCRIPT_NO_ERROR = 5 class PyScriptProcessor(object): """ Use this class to evaluate a script. This method is more complicated than some might expect, due to the fact that any OP_CHECKSIG or OP_CHECKMULTISIG code requires the full transaction of the TxIn script and also needs the TxOut script being spent. Since nearly every useful script will have one of these operations, this class/method assumes that all that data will be supplied. To simply execute a script not requiring any crypto operations: scriptIsValid = PyScriptProcessor().executeScript(binScript) """ def __init__(self, txOldData=None, txNew=None, txInIndex=None): self.stack = [] self.txNew = None self.script1 = None self.script2 = None if txOldData and txNew and not txInIndex==None: self.setTxObjects(txOldData, txNew, txInIndex) def setTxObjects(self, txOldData, txNew, txInIndex): """ The minimal amount of data necessary to evaluate a script that has an signature check is the TxOut script that is being spent and the entire Tx of the TxIn that is spending it. Thus, we must supply at least the txOldScript, and a txNew with its TxIn index (so we know which TxIn is spending that TxOut). It is acceptable to pass in the full TxOut or the tx of the TxOut instead of just the script itself. """ self.txNew = PyTx().unserialize(txNew.serialize()) self.script1 = str(txNew.inputs[txInIndex].binScript) # copy self.txInIndex = txInIndex self.txOutIndex = txNew.inputs[txInIndex].outpoint.txOutIndex self.txHash = txNew.inputs[txInIndex].outpoint.txHash if isinstance(txOldData, PyTx): if not self.txHash == hash256(txOldData.serialize()): LOGERROR('*** Supplied incorrect pair of transactions!') self.script2 = str(txOldData.outputs[self.txOutIndex].binScript) elif isinstance(txOldData, PyTxOut): self.script2 = str(txOldData.binScript) elif isinstance(txOldData, str): self.script2 = str(txOldData) @TimeThisFunction def verifyTransactionValid(self, txOldData=None, txNew=None, txInIndex=-1): if txOldData and txNew and txInIndex != -1: self.setTxObjects(txOldData, txNew, txInIndex) else: txOldData = self.script2 txNew = self.txNew txInIndex = self.txInIndex if self.script1==None or self.txNew==None: raise VerifyScriptError, 'Cannot verify transactions, without setTxObjects call first!' # Execute TxIn script first self.stack = [] exitCode1 = self.executeScript(self.script1, self.stack) if not exitCode1 == SCRIPT_NO_ERROR: raise VerifyScriptError, ('First script failed! Exit Code: ' + str(exitCode1)) exitCode2 = self.executeScript(self.script2, self.stack) if not exitCode2 == SCRIPT_NO_ERROR: raise VerifyScriptError, ('Second script failed! Exit Code: ' + str(exitCode2)) return self.stack[-1]==1 def executeScript(self, binaryScript, stack=[]): self.stack = stack self.stackAlt = [] scriptData = BinaryUnpacker(binaryScript) self.lastOpCodeSepPos = None while scriptData.getRemainingSize() > 0: opcode = scriptData.get(UINT8) exitCode = self.executeOpCode(opcode, scriptData, self.stack, self.stackAlt) if not exitCode == SCRIPT_NO_ERROR: if exitCode==OP_NOT_IMPLEMENTED: LOGERROR('***ERROR: OpCodes OP_IF, OP_NOTIF, OP_ELSE, OP_ENDIF,') LOGERROR(' have not been implemented, yet. This script') LOGERROR(' could not be evaluated.') if exitCode==OP_DISABLED: LOGERROR('***ERROR: This script included an op code that has been') LOGERROR(' disabled for security reasons. Script eval') LOGERROR(' failed.') return exitCode return SCRIPT_NO_ERROR # Implementing this method exactly as in the client because it looks like # there could be some subtleties with how it determines "true" def castToBool(self, binData): if isinstance(binData, int): binData = int_to_binary(binData) for i,byte in enumerate(binData): if not ord(byte) == 0: # This looks like it's assuming LE encoding (?) if (i == len(binData)-1) and (byte==0x80): return False return True return False def checkSig(self,binSig, binPubKey, txOutScript, txInTx, txInIndex, lastOpCodeSep=None): """ Generic method for checking Bitcoin tx signatures. This needs to be used for both OP_CHECKSIG and OP_CHECKMULTISIG. Step 1 is to pop signature and public key off the stack, which must be done outside this method and passed in through the argument list. The remaining steps do not require access to the stack. """ # 2. Subscript is from latest OP_CODESEPARATOR until end... if DNE, use whole script subscript = txOutScript if lastOpCodeSep: subscript = subscript[lastOpCodeSep:] # 3. Signature is deleted from subscript # I'm not sure why this line is necessary - maybe for non-standard scripts? lengthInBinary = int_to_binary(len(binSig)) subscript = subscript.replace( lengthInBinary + binSig, "") # 4. Hashtype is popped and stored hashtype = binary_to_int(binSig[-1]) justSig = binSig[:-1] if not hashtype == 1: LOGERROR('Non-unity hashtypes not implemented yet! (hashtype = %d)', hashtype) assert(False) # 5. Make a copy of the transaction -- we will be hashing a modified version txCopy = PyTx().unserialize( txInTx.serialize() ) # 6. Remove all OP_CODESEPARATORs subscript.replace( int_to_binary(OP_CODESEPARATOR), '') # 7. All the TxIn scripts in the copy are blanked (set to empty string) for txin in txCopy.inputs: txin.binScript = '' # 8. Script for the current input in the copy is set to subscript txCopy.inputs[txInIndex].binScript = subscript # 9. Prepare the signature and public key senderAddr = PyBtcAddress().createFromPublicKey(binPubKey) binHashCode = int_to_binary(hashtype, widthBytes=4) toHash = txCopy.serialize() + binHashCode # Hashes are computed as part of CppBlockUtils::CryptoECDSA methods ##hashToVerify = hash256(toHash) ##hashToVerify = binary_switchEndian(hashToVerify) # 10. Apply ECDSA signature verification if senderAddr.verifyDERSignature(toHash, justSig): return True else: return False def executeOpCode(self, opcode, scriptUnpacker, stack, stackAlt): """ Executes the next OP_CODE given the current state of the stack(s) """ # TODO: Gavin clarified the effects of OP_0, and OP_1-OP_16. # OP_0 puts an empty string onto the stack, which evaluateses to # false and is plugged into HASH160 as '' # OP_X puts a single byte onto the stack, 0x01 to 0x10 # # I haven't implemented it this way yet, because I'm still missing # some details. Since this "works" for available scripts, I'm going # to leave it alone for now. ########################################################################## ########################################################################## ### This block produces very nice debugging output for script eval! #def pr(s): #if isinstance(s,int): #return str(s) #elif isinstance(s,str): #if len(s)>8: #return binary_to_hex(s)[:8] #else: #return binary_to_hex(s) #print ' '.join([pr(i) for i in stack]) #print opnames[opcode][:12].ljust(12,' ') + ':', ########################################################################## ########################################################################## stackSizeAtLeast = lambda n: (len(self.stack) >= n) if opcode == OP_FALSE: stack.append(0) elif 0 < opcode < 76: stack.append(scriptUnpacker.get(BINARY_CHUNK, opcode)) elif opcode == OP_PUSHDATA1: nBytes = scriptUnpacker.get(UINT8) stack.append(scriptUnpacker.get(BINARY_CHUNK, nBytes)) elif opcode == OP_PUSHDATA2: nBytes = scriptUnpacker.get(UINT16) stack.append(scriptUnpacker.get(BINARY_CHUNK, nBytes)) elif opcode == OP_PUSHDATA4: nBytes = scriptUnpacker.get(UINT32) stack.append(scriptUnpacker.get(BINARY_CHUNK, nBytes)) elif opcode == OP_1NEGATE: stack.append(-1) elif opcode == OP_TRUE: stack.append(1) elif 81 < opcode < 97: stack.append(opcode-80) elif opcode == OP_NOP: pass # TODO: figure out the conditional op codes... elif opcode == OP_IF: return OP_NOT_IMPLEMENTED elif opcode == OP_NOTIF: return OP_NOT_IMPLEMENTED elif opcode == OP_ELSE: return OP_NOT_IMPLEMENTED elif opcode == OP_ENDIF: return OP_NOT_IMPLEMENTED elif opcode == OP_VERIFY: if not self.castToBool(stack.pop()): stack.append(0) return TX_INVALID elif opcode == OP_RETURN: return TX_INVALID elif opcode == OP_TOALTSTACK: stackAlt.append( stack.pop() ) elif opcode == OP_FROMALTSTACK: stack.append( stackAlt.pop() ) elif opcode == OP_IFDUP: # Looks like this method duplicates the top item if it's not zero if not stackSizeAtLeast(1): return SCRIPT_STACK_SIZE_ERROR if self.castToBool(stack[-1]): stack.append(stack[-1]); elif opcode == OP_DEPTH: stack.append( len(stack) ) elif opcode == OP_DROP: stack.pop() elif opcode == OP_DUP: stack.append( stack[-1] ) elif opcode == OP_NIP: if not stackSizeAtLeast(2): return SCRIPT_STACK_SIZE_ERROR del stack[-2] elif opcode == OP_OVER: if not stackSizeAtLeast(2): return SCRIPT_STACK_SIZE_ERROR stack.append(stack[-2]) elif opcode == OP_PICK: n = stack.pop() if not stackSizeAtLeast(n): return SCRIPT_STACK_SIZE_ERROR stack.append(stack[-n]) elif opcode == OP_ROLL: n = stack.pop() if not stackSizeAtLeast(n): return SCRIPT_STACK_SIZE_ERROR stack.append(stack[-(n+1)]) del stack[-(n+2)] elif opcode == OP_ROT: if not stackSizeAtLeast(3): return SCRIPT_STACK_SIZE_ERROR stack.append( stack[-3] ) del stack[-4] elif opcode == OP_SWAP: if not stackSizeAtLeast(2): return SCRIPT_STACK_SIZE_ERROR x2 = stack.pop() x1 = stack.pop() stack.extend([x2, x1]) elif opcode == OP_TUCK: if not stackSizeAtLeast(2): return SCRIPT_STACK_SIZE_ERROR x2 = stack.pop() x1 = stack.pop() stack.extend([x2, x1, x2]) elif opcode == OP_2DROP: if not stackSizeAtLeast(2): return SCRIPT_STACK_SIZE_ERROR stack.pop() stack.pop() elif opcode == OP_2DUP: if not stackSizeAtLeast(2): return SCRIPT_STACK_SIZE_ERROR stack.append( stack[-2] ) stack.append( stack[-2] ) elif opcode == OP_3DUP: if not stackSizeAtLeast(3): return SCRIPT_STACK_SIZE_ERROR stack.append( stack[-3] ) stack.append( stack[-3] ) stack.append( stack[-3] ) elif opcode == OP_2OVER: if not stackSizeAtLeast(4): return SCRIPT_STACK_SIZE_ERROR stack.append( stack[-4] ) stack.append( stack[-4] ) elif opcode == OP_2ROT: if not stackSizeAtLeast(6): return SCRIPT_STACK_SIZE_ERROR stack.append( stack[-6] ) stack.append( stack[-6] ) elif opcode == OP_2SWAP: if not stackSizeAtLeast(4): return SCRIPT_STACK_SIZE_ERROR x4 = stack.pop() x3 = stack.pop() x2 = stack.pop() x1 = stack.pop() stack.extend( [x3, x4, x1, x2] ) elif opcode == OP_CAT: return OP_DISABLED elif opcode == OP_SUBSTR: return OP_DISABLED elif opcode == OP_LEFT: return OP_DISABLED elif opcode == OP_RIGHT: return OP_DISABLED elif opcode == OP_SIZE: if isinstance(stack[-1], int): stack.append(0) else: stack.append( len(stack[-1]) ) elif opcode == OP_INVERT: return OP_DISABLED elif opcode == OP_AND: return OP_DISABLED elif opcode == OP_OR: return OP_DISABLED elif opcode == OP_XOR: return OP_DISABLED elif opcode == OP_EQUAL: x1 = stack.pop() x2 = stack.pop() stack.append( 1 if x1==x2 else 0 ) elif opcode == OP_EQUALVERIFY: x1 = stack.pop() x2 = stack.pop() if not x1==x2: stack.append(0) return TX_INVALID elif opcode == OP_1ADD: stack[-1] += 1 elif opcode == OP_1SUB: stack[-1] -= 1 elif opcode == OP_2MUL: stack[-1] *= 2 return OP_DISABLED elif opcode == OP_2DIV: stack[-1] /= 2 return OP_DISABLED elif opcode == OP_NEGATE: stack[-1] *= -1 elif opcode == OP_ABS: stack[-1] = abs(stack[-1]) elif opcode == OP_NOT: top = stack.pop() if top==0: stack.append(1) else: stack.append(0) elif opcode == OP_0NOTEQUAL: top = stack.pop() if top==0: stack.append(0) else: stack.append(1) top = stack.pop() if top==0: stack.append(1) else: stack.append(0) elif opcode == OP_ADD: b = stack.pop() a = stack.pop() stack.append(a+b) elif opcode == OP_SUB: b = stack.pop() a = stack.pop() stack.append(a-b) elif opcode == OP_MUL: return OP_DISABLED elif opcode == OP_DIV: return OP_DISABLED elif opcode == OP_MOD: return OP_DISABLED elif opcode == OP_LSHIFT: return OP_DISABLED elif opcode == OP_RSHIFT: return OP_DISABLED elif opcode == OP_BOOLAND: b = stack.pop() a = stack.pop() if (not a==0) and (not b==0): stack.append(1) else: stack.append(0) elif opcode == OP_BOOLOR: b = stack.pop() a = stack.pop() stack.append( 1 if (self.castToBool(a) or self.castToBool(b)) else 0 ) elif opcode == OP_NUMEQUAL: b = stack.pop() a = stack.pop() stack.append( 1 if a==b else 0 ) elif opcode == OP_NUMEQUALVERIFY: b = stack.pop() a = stack.pop() if not a==b: stack.append(0) return TX_INVALID elif opcode == OP_NUMNOTEQUAL: b = stack.pop() a = stack.pop() stack.append( 1 if not a==b else 0 ) elif opcode == OP_LESSTHAN: b = stack.pop() a = stack.pop() stack.append( 1 if ab else 0) elif opcode == OP_LESSTHANOREQUAL: b = stack.pop() a = stack.pop() stack.append( 1 if a<=b else 0) elif opcode == OP_GREATERTHANOREQUAL: b = stack.pop() a = stack.pop() stack.append( 1 if a>=b else 0) elif opcode == OP_MIN: b = stack.pop() a = stack.pop() stack.append( min(a,b) ) elif opcode == OP_MAX: b = stack.pop() a = stack.pop() stack.append( max(a,b) ) elif opcode == OP_WITHIN: xmax = stack.pop() xmin = stack.pop() x = stack.pop() stack.append( 1 if (xmin <= x < xmax) else 0 ) elif opcode == OP_RIPEMD160: bits = stack.pop() stack.append( ripemd160(bits) ) elif opcode == OP_SHA1: bits = stack.pop() stack.append( sha1(bits) ) elif opcode == OP_SHA256: bits = stack.pop() stack.append( sha256(bits) ) elif opcode == OP_HASH160: bits = stack.pop() if isinstance(bits, int): bits = '' stack.append( hash160(bits) ) elif opcode == OP_HASH256: bits = stack.pop() if isinstance(bits, int): bits = '' stack.append( sha256(sha256(bits) ) ) elif opcode == OP_CODESEPARATOR: self.lastOpCodeSepPos = scriptUnpacker.getPosition() elif opcode == OP_CHECKSIG or opcode == OP_CHECKSIGVERIFY: # 1. Pop key and sig from the stack binPubKey = stack.pop() binSig = stack.pop() # 2-10. encapsulated in sep method so CheckMultiSig can use it too txIsValid = self.checkSig( binSig, \ binPubKey, \ scriptUnpacker.getBinaryString(), \ self.txNew, \ self.txInIndex, \ self.lastOpCodeSepPos) stack.append(1 if txIsValid else 0) if opcode==OP_CHECKSIGVERIFY: verifyCode = self.executeOpCode(OP_VERIFY) if verifyCode == TX_INVALID: return TX_INVALID elif opcode == OP_CHECKMULTISIG or opcode == OP_CHECKMULTISIGVERIFY: # OP_CHECKMULTISIG procedure ported directly from Satoshi client code # Location: bitcoin-0.4.0-linux/src/src/script.cpp:775 i=1 if len(stack) < i: return TX_INVALID nKeys = int(stack[-i]) if nKeys < 0 or nKeys > 20: return TX_INVALID i += 1 iKey = i i += nKeys if len(stack) < i: return TX_INVALID nSigs = int(stack[-i]) if nSigs < 0 or nSigs > nKeys: return TX_INVALID iSig = i i += 1 i += nSigs if len(stack) < i: return TX_INVALID stack.pop() # Apply the ECDSA verification to each of the supplied Sig-Key-pairs enoughSigsMatch = True while enoughSigsMatch and nSigs > 0: binSig = stack[-iSig] binKey = stack[-iKey] if( self.checkSig(binSig, \ binKey, \ scriptUnpacker.getBinaryString(), \ self.txNew, \ self.txInIndex, \ self.lastOpCodeSepPos) ): iSig += 1 nSigs -= 1 iKey +=1 nKeys -=1 if(nSigs > nKeys): enoughSigsMatch = False # Now pop the things off the stack, we only accessed in-place before while i > 1: i -= 1 stack.pop() stack.append(1 if enoughSigsMatch else 0) if opcode==OP_CHECKMULTISIGVERIFY: verifyCode = self.executeOpCode(OP_VERIFY) if verifyCode == TX_INVALID: return TX_INVALID else: return SCRIPT_ERROR return SCRIPT_NO_ERROR # Putting this at the end because of the circular dependency from armoryengine.PyBtcAddress import PyBtcAddress armory-0.92.3/armoryengine/AsciiSerialize.py0000644000000000000000000001134312414772654017603 0ustar rootrootfrom ArmoryUtils import makeAsciiBlock, readAsciiBlock from armoryengine.ArmoryUtils import LOGERROR, UnserializeError class AsciiSerializable(object): """ This is intended to be a virtual class (roughly speaking). The below four methods will be inherited by all classes that derive from this one. The only requirements for these methods to work is that the objects have the following attributes and methods defined: Class Static Members self.BLKSTRING self.EQ_ATTRS_SIMPLE self.EQ_ATTRS_LISTS self.EQ_ATTRS_MAPS Object members: self.asciiID Class Methods: self.serialize() self.unserialize() The EQ_ATTRS_* is a list of strings of this class's members' names that can be directly compared via == operator, or a list or map of such objects. These will be iterated and checked in the __eq__(self, other) function that will be inherited. For instance, you might right the class the following way: class MyClass(AsciiSerializable): BLKSTRING = "MyObject" EQ_ATTRS_SIMPLE = ['myInt', 'myStr'] EQ_ATTRS_LISTS = ['myVect'] EQ_ATTRS_MAPS = ['myMapA', 'myMapB'] def __init__(self, initInt, initStr, initVect, initMap1, initMap2): self.myInt = initInt self.myStr = initStr self.myVect = initVect self.myMapA = initMap1 self.myMapB = initMap2 If you would like to do more in the __eq__ function than just compare those simple things, call this first inside your overridden __eq__ func, then define your extra logic: def __eq__(self, obj2): if not super(MyClass, self).__eq__(obj2): return False # We'll consider them equal if the first is a multiple of the second return (self.modulus % obj2.modulus)==0 """ ############################################################################# def serializeAscii(self): headStr = '%s-%s' % (self.BLKSTRING, self.asciiID) return makeAsciiBlock(self.serialize(), headStr) ############################################################################# def unserializeAscii(self, ustxBlock, skipMagicCheck=False): headStr,rawData = readAsciiBlock(ustxBlock, self.BLKSTRING) if rawData is None: LOGERROR('Expected str "%s", got "%s"' % (self.BLKSTRING, headStr)) raise UnserializeError('Unexpected BLKSTRING') expectID = headStr.split('-')[-1] return self.unserialize(rawData, expectID, skipMagicCheck) ############################################################################# def __eq__(self, aso2): if not isinstance(aso2, self.__class__): return False # Expect three lists of comparables to be present (static or otherwise) # self.EQ_ATTRS_SIMPLE # self.EQ_ATTRS_LISTS # self.EQ_ATTRS_MAPS #### Regular compares if hasattr(self, 'EQ_ATTRS_SIMPLE'): for attr in self.EQ_ATTRS_SIMPLE: if not getattr(self, attr) == getattr(aso2, attr): LOGERROR('Compare failed for attribute: %s' % attr) LOGERROR(' self: %s' % str(getattr(self,attr))) LOGERROR(' other: %s' % str(getattr(aso2,attr))) return False #### List iteration compares if hasattr(self, 'EQ_ATTRS_LISTS'): for attr in self.EQ_ATTRS_LISTS: selfList = getattr(self, attr) otherList = getattr(aso2, attr) if not len(selfList)==len(otherList): LOGERROR('List size compare failed for %s' % attr) return False i = -1 for a,b in zip(selfList, otherList): i+=1 if not a==b: LOGERROR('Failed list compare for attr %s, index %d' % (attr,i)) return False #### Map iteration compares if hasattr(self, 'EQ_ATTRS_MAPS'): for attr in self.EQ_ATTRS_MAPS: selfMap = getattr(self, attr) otherMap = getattr(aso2, attr) if not len(selfMap)==len(otherMap): LOGERROR('Map size compare failed for %s' % attr) return False for key,val in selfMap.iteritems(): if not key in otherMap: LOGERROR('First map has key not in second map: "%s"' % key) return False if not val==otherMap[key]: LOGERROR('Value for attr=%s, key=%s does not match' % (attr,key)) return False return True ############################################################################# def __ne__(self, aso2): return not self.__eq__(aso2) armory-0.92.3/armoryengine/Networking.py0000644000000000000000000011317612414772654017041 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ ################################################################################ # # Armory Networking: # # This is where I will define all the network operations needed for # Armory to operate, using python-twisted. There are "better" # ways to do this with "reusable" code structures (i.e. using huge # deferred callback chains), but this is not the central "creative" # part of the Bitcoin protocol. I need just enough to broadcast tx # and receive new tx that aren't in the blockchain yet. Beyond that, # I'll just be ignoring everything else. # ################################################################################ import os.path import random from twisted.internet.defer import Deferred from twisted.internet.protocol import Protocol, ReconnectingClientFactory from armoryengine.ArmoryUtils import LOGINFO, RightNow, getVersionString, \ BTCARMORY_VERSION, NetworkIDError, LOGERROR, BLOCKCHAINS, CLI_OPTIONS, LOGDEBUG, \ binary_to_hex, BIGENDIAN, LOGRAWDATA, ARMORY_HOME_DIR, ConnectionError, \ MAGIC_BYTES, hash256, verifyChecksum, NETWORKENDIAN, int_to_bitset, \ bitset_to_int, unixTimeToFormatStr from armoryengine.BDM import TheBDM from armoryengine.BinaryPacker import BinaryPacker, BINARY_CHUNK, UINT32, UINT64, \ UINT16, VAR_INT, INT32, INT64, VAR_STR, INT8 from armoryengine.BinaryUnpacker import BinaryUnpacker, UnpackerError from armoryengine.Block import PyBlockHeader from armoryengine.Transaction import PyTx, indent class ArmoryClient(Protocol): """ This is where all the Bitcoin-specific networking stuff goes. In the Twisted way, you need to inject your own chains of callbacks through the factory in order to get this class to do the right thing on the various events. """ ############################################################ def __init__(self): self.recvData = '' self.gotVerack = False self.sentVerack = False self.sentHeadersReq = True self.peer = [] ############################################################ def connectionMade(self): """ Construct the initial version message and send it right away. Everything else will be handled by dataReceived. """ LOGINFO('Connection initiated. Start handshake') addrTo = str_to_quad(self.transport.getPeer().host) portTo = self.transport.getPeer().port addrFrom = str_to_quad(self.transport.getHost().host) portFrom = self.transport.getHost().port self.peer = [addrTo, portTo] services = '0'*16 msgVersion = PayloadVersion() msgVersion.version = 40000 # TODO: this is what my Satoshi client says msgVersion.services = services msgVersion.time = long(RightNow()) msgVersion.addrRecv = PyNetAddress(0, services, addrTo, portTo ) msgVersion.addrFrom = PyNetAddress(0, services, addrFrom, portFrom) msgVersion.nonce = random.randint(2**60, 2**64-1) msgVersion.subver = 'Armory:%s' % getVersionString(BTCARMORY_VERSION) msgVersion.height0 = -1 self.sendMessage( msgVersion ) self.factory.func_madeConnect() ############################################################ def dataReceived(self, data): """ Called by the reactor when data is received over the connection. This method will do nothing if we don't receive a full message. """ #print '\n\nData Received:', #pprintHex(binary_to_hex(data), withAddr=False) # Put the current buffer into an unpacker, process until empty self.recvData += data buf = BinaryUnpacker(self.recvData) messages = [] while True: try: # recvData is only modified if the unserialize succeeds # Had a serious issue with references, so I had to convert # messages to strings to guarantee that copies were being # made! (yes, hacky...) thisMsg = PyMessage().unserialize(buf) messages.append( thisMsg.serialize() ) self.recvData = buf.getRemainingString() except NetworkIDError: LOGERROR('Message for a different network!' ) if BLOCKCHAINS.has_key(self.recvData[:4]): LOGERROR( '(for network: %s)', BLOCKCHAINS[self.recvData[:4]]) # Before raising the error, we should've finished reading the msg # So pop it off the front of the buffer self.recvData = buf.getRemainingString() return except UnpackerError: # Expect this error when buffer isn't full enough for a whole msg break # We might've gotten here without anything to process -- if so, bail if len(messages)==0: return # Finally, we have some message to process, let's do it for msgStr in messages: msg = PyMessage().unserialize(msgStr) cmd = msg.cmd # Log the message if netlog option if CLI_OPTIONS.netlog: LOGDEBUG( 'DataReceived: %s', msg.payload.command) if msg.payload.command == 'tx': LOGDEBUG('\t' + binary_to_hex(msg.payload.tx.thisHash)) elif msg.payload.command == 'block': LOGDEBUG('\t' + msg.payload.header.getHashHex()) elif msg.payload.command == 'inv': for inv in msg.payload.invList: LOGDEBUG(('\tBLOCK: ' if inv[0]==2 else '\tTX : ') + \ binary_to_hex(inv[1])) # We process version and verackk only if we haven't yet if cmd=='version' and not self.sentVerack: self.peerInfo = {} self.peerInfo['version'] = msg.payload.version self.peerInfo['subver'] = msg.payload.subver self.peerInfo['time'] = msg.payload.time self.peerInfo['height'] = msg.payload.height0 LOGINFO('Received version message from peer:') LOGINFO(' Version: %s', str(self.peerInfo['version'])) LOGINFO(' SubVersion: %s', str(self.peerInfo['subver'])) LOGINFO(' TimeStamp: %s', str(self.peerInfo['time'])) LOGINFO(' StartHeight: %s', str(self.peerInfo['height'])) self.sentVerack = True self.sendMessage( PayloadVerack() ) elif cmd=='verack': self.gotVerack = True self.factory.handshakeFinished(self) #self.startHeaderDL() #################################################################### # Don't process any other messages unless the handshake is finished if self.gotVerack and self.sentVerack: self.processMessage(msg) ############################################################ #def connectionLost(self, reason): #""" #Try to reopen connection (not impl yet) #""" #self.factory.connectionFailed(self, reason) ############################################################ def processMessage(self, msg): # TODO: when I start expanding this class to be more versatile, # I'll consider chaining/setting callbacks from the calling # application. For now, it's pretty static. #msg.payload.pprint(nIndent=2) if msg.cmd=='inv': invobj = msg.payload getdataMsg = PyMessage('getdata') for inv in invobj.invList: if inv[0]==MSG_INV_BLOCK: if self.factory.bdm and (self.factory.bdm.getBDMState()=='Scanning' or \ self.factory.bdm.hasHeaderWithHash(inv[1])): continue getdataMsg.payload.invList.append(inv) if inv[0]==MSG_INV_TX: if self.factory.bdm and (self.factory.bdm.getBDMState()=='Scanning' or \ self.factory.bdm.hasTxWithHash(inv[1])): continue getdataMsg.payload.invList.append(inv) # Now send the full request if self.factory.bdm and not self.factory.bdm.getBDMState()=='Scanning': self.sendMessage(getdataMsg) if msg.cmd=='tx': pytx = msg.payload.tx self.factory.func_newTx(pytx) elif msg.cmd=='inv': invList = msg.payload.invList self.factory.func_inv(invList) elif msg.cmd=='block': pyHeader = msg.payload.header pyTxList = msg.payload.txList LOGINFO('Received new block. %s', binary_to_hex(pyHeader.getHash(), BIGENDIAN)) self.factory.func_newBlock(pyHeader, pyTxList) ############################################################ def startHeaderDL(self): numList = self.createBlockLocatorNumList(self.topBlk) msg = PyMessage('getheaders') msg.payload.version = 1 if self.factory.bdm: msg.payload.hashList = [self.factory.bdm.getHeaderByHeight(i).getHash() for i in numList] else: msg.payload.hashList = [] msg.payload.hashStop = '\x00'*32 self.sentHeadersReq = True ############################################################ def startBlockDL(self): numList = self.createBlockLocatorNumList(self.topBlk) msg = PyMessage('getblocks') msg.payload.version = 1 if self.factory.bdm: msg.payload.hashList = [self.factory.bdm.getHeaderByHeight(i).getHash() for i in numList] else: msg.payload.hashList = [] msg.payload.hashStop = '\x00'*32 ############################################################ def sendMessage(self, msg): """ Must pass in a PyMessage, or one of the Payload types, which will be converted to a PyMessage -- and then sent to the peer. If you have a fully-serialized message (with header) already, easy enough to user PyMessage().unserialize(binMsg) """ if isinstance(msg, PyMessage): #print '\n\nSending Message:', msg.payload.command.upper() #pprintHex(binary_to_hex(msg.serialize()), indent=' ') if CLI_OPTIONS.netlog: LOGDEBUG( 'SendMessage: %s', msg.payload.command) LOGRAWDATA( msg.serialize() ) self.transport.write(msg.serialize()) else: msg = PyMessage(payload=msg) #print '\n\nSending Message:', msg.payload.command.upper() #pprintHex(binary_to_hex(msg.serialize()), indent=' ') if CLI_OPTIONS.netlog: LOGDEBUG( 'SendMessage: %s', msg.payload.command) LOGRAWDATA( msg.serialize() ) self.transport.write(msg.serialize()) ############################################################ def sendTx(self, txObj): """ This is a convenience method for the special case of sending a locally-constructed transaction. Pass in either a PyTx object, or a binary serialized tx. It will be converted to a PyMessage and forwarded to our peer(s) """ LOGINFO('sendTx called...') if isinstance(txObj, PyMessage): self.sendMessage( txObj ) elif isinstance(txObj, PyTx): self.sendMessage( PayloadTx(txObj)) elif isinstance(txObj, str): self.sendMessage( PayloadTx(PyTx().unserialize(txObj)) ) ################################################################################ ################################################################################ class ArmoryClientFactory(ReconnectingClientFactory): """ Spawns Protocol objects used for communicating over the socket. All such objects (ArmoryClients) can share information through this factory. However, at the moment, this class is designed to only create a single connection -- to localhost. """ protocol = ArmoryClient lastAlert = 0 ############################################################################# def __init__(self, \ bdm, def_handshake=None, \ func_loseConnect=(lambda: None), \ func_madeConnect=(lambda: None), \ func_newTx=(lambda x: None), \ func_newBlock=(lambda x,y: None), \ func_inv=(lambda x: None)): """ Initialize the ReconnectingClientFactory with a deferred for when the handshake finishes: there should be only one handshake, and thus one firing of the handshake-finished callback """ self.bdm = bdm self.lastAlert = 0 self.deferred_handshake = forceDeferred(def_handshake) self.fileMemPool = os.path.join(ARMORY_HOME_DIR, 'mempool.bin') # All other methods will be regular callbacks: we plan to have a very # static set of behaviors for each message type # (NOTE: The logic for what I need right now is so simple, that # I finished implementing it in a few lines of code. When I # need to expand the versatility of this class, I'll start # doing more OOP/deferreds/etc self.func_loseConnect = func_loseConnect self.func_madeConnect = func_madeConnect self.func_newTx = func_newTx self.func_newBlock = func_newBlock self.func_inv = func_inv self.proto = None ############################################################################# def addTxToMemoryPool(self, pytx): if self.bdm and not self.bdm.getBDMState()=='Offline': self.bdm.addNewZeroConfTx(pytx.serialize(), long(RightNow()), True) ############################################################################# def handshakeFinished(self, protoObj): LOGINFO('Handshake finished, connection open!') self.proto = protoObj if self.deferred_handshake: d, self.deferred_handshake = self.deferred_handshake, None d.callback(protoObj) ############################################################################# def clientConnectionLost(self, connector, reason): LOGERROR('***Connection to Satoshi client LOST! Attempting to reconnect...') self.func_loseConnect() ReconnectingClientFactory.clientConnectionLost(self,connector,reason) ############################################################################# def connectionFailed(self, protoObj, reason): LOGERROR('***Initial connection to Satoshi client failed! Retrying...') ReconnectingClientFactory.connectionFailed(self, protoObj, reason) ############################################################################# def sendTx(self, pytxObj): if self.proto: self.proto.sendTx(pytxObj) else: raise ConnectionError, 'Connection to localhost DNE.' ############################################################################# def sendMessage(self, msgObj): if self.proto: self.proto.sendMessage(msgObj) else: raise ConnectionError, 'Connection to localhost DNE.' ############################################################################### ############################################################################### # # Networking Objects # ############################################################################### ############################################################################### def quad_to_str( addrQuad): return '.'.join([str(a) for a in addrQuad]) def quad_to_binary( addrQuad): return ''.join([chr(a) for a in addrQuad]) def binary_to_quad(addrBin): return [ord(a) for a in addrBin] def str_to_quad(addrBin): return [int(a) for a in addrBin.split('.')] def str_to_binary(addrBin): """ I should come up with a better name for this -- it's net-addr only """ return ''.join([chr(int(a)) for a in addrBin.split('.')]) def parseNetAddress(addrObj): if isinstance(addrObj, str): if len(addrObj)==4: return binary_to_quad(addrObj) else: return str_to_quad(addrObj) # Probably already in the right form return addrObj MSG_INV_ERROR = 0 MSG_INV_TX = 1 MSG_INV_BLOCK = 2 ################################################################################ class PyMessage(object): """ All payload objects have a serialize and unserialize method, making them easy to attach to PyMessage objects """ def __init__(self, cmd='', payload=None): """ Can create a message by the command name, or the payload (or neither) """ self.magic = MAGIC_BYTES self.cmd = cmd self.payload = payload if payload: self.cmd = payload.command elif cmd: self.payload = PayloadMap[self.cmd]() def serialize(self): bp = BinaryPacker() bp.put(BINARY_CHUNK, self.magic, width= 4) bp.put(BINARY_CHUNK, self.cmd.ljust(12, '\x00'), width=12) payloadBin = self.payload.serialize() bp.put(UINT32, len(payloadBin)) bp.put(BINARY_CHUNK, hash256(payloadBin)[:4], width= 4) bp.put(BINARY_CHUNK, payloadBin) return bp.getBinaryString() def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): msgData = toUnpack else: msgData = BinaryUnpacker( toUnpack ) self.magic = msgData.get(BINARY_CHUNK, 4) self.cmd = msgData.get(BINARY_CHUNK, 12).strip('\x00') length = msgData.get(UINT32) chksum = msgData.get(BINARY_CHUNK, 4) payload = msgData.get(BINARY_CHUNK, length) payload = verifyChecksum(payload, chksum) self.payload = PayloadMap[self.cmd]().unserialize(payload) if self.magic != MAGIC_BYTES: raise NetworkIDError, 'Message has wrong network bytes!' return self def pprint(self, nIndent=0): indstr = indent*nIndent print '' print indstr + 'Bitcoin-Network-Message -- ' + self.cmd.upper() print indstr + indent + 'Magic: ' + binary_to_hex(self.magic) print indstr + indent + 'Command: ' + self.cmd print indstr + indent + 'Payload: ' + str(len(self.payload.serialize())) + ' bytes' self.payload.pprint(nIndent+1) ################################################################################ class PyNetAddress(object): def __init__(self, time=-1, svcs='0'*16, netaddrObj=[], port=-1): """ For our client we will ALWAYS use svcs=0 (NODE_NETWORK=0) time is stored as a unix timestamp services is stored as a bitset -- a string of 16 '0's or '1's addrObj is stored as a list/tuple of four UINT8s port is a regular old port number... """ self.time = time self.services = svcs self.addrQuad = parseNetAddress(netaddrObj) self.port = port def unserialize(self, toUnpack, hasTimeField=True): if isinstance(toUnpack, BinaryUnpacker): addrData = toUnpack else: addrData = BinaryUnpacker( toUnpack ) if hasTimeField: self.time = addrData.get(UINT32) self.services = addrData.get(UINT64) self.addrQuad = addrData.get(BINARY_CHUNK,16)[-4:] self.port = addrData.get(UINT16, endianness=NETWORKENDIAN) self.services = int_to_bitset(self.services) self.addrQuad = binary_to_quad(self.addrQuad) return self def serialize(self, withTimeField=True): bp = BinaryPacker() if withTimeField: bp.put(UINT32, self.time) bp.put(UINT64, bitset_to_int(self.services)) bp.put(BINARY_CHUNK, quad_to_binary(self.addrQuad).rjust(16,'\x00')) bp.put(UINT16, self.port, endianness=NETWORKENDIAN) return bp.getBinaryString() def pprint(self, nIndent=0): indstr = indent*nIndent print '' print indstr + 'Network-Address:', print indstr + indent + 'Time: ' + unixTimeToFormatStr(self.time) print indstr + indent + 'Svcs: ' + self.services print indstr + indent + 'IPv4: ' + quad_to_str(self.addrQuad) print indstr + indent + 'Port: ' + self.port def pprintShort(self): print quad_to_str(self.addrQuad) + ':' + str(self.port) ################################################################################ ################################################################################ class PayloadAddr(object): command = 'addr' def __init__(self, addrList=[]): self.addrList = addrList # PyNetAddress objs def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): addrData = toUnpack else: addrData = BinaryUnpacker( toUnpack ) self.addrList = [] naddr = addrData.get(VAR_INT) for i in range(naddr): self.addrList.append( PyNetAddress().unserialize(addrData) ) return self def serialize(self): bp = BinaryPacker() bp.put(VAR_INT, len(self.addrList)) for netaddr in self.addrList: bp.put(BINARY_CHUNK, netaddr.serialize(), width=30) return bp.getBinaryString() def pprint(self, nIndent=0): indstr = indent*nIndent print '' print indstr + 'Message(addr):', for a in self.addrList: a.pprintShort() def pprintShort(self): for a in self.addrList: print '[' + quad_to_str(a.pprintShort()) + '], ' ################################################################################ ################################################################################ class PayloadPing(object): """ All payload objects have a serialize and unserialize method, making them easy to attach to PyMessage objects """ command = 'ping' def __init__(self): pass def unserialize(self, toUnpack): return self def serialize(self): return '' def pprint(self, nIndent=0): indstr = indent*nIndent print '' print indstr + 'Message(ping)' ################################################################################ ################################################################################ class PayloadVersion(object): command = 'version' def __init__(self, version=0, svcs='0'*16, tstamp=-1, addrRcv=PyNetAddress(), \ addrFrm=PyNetAddress(), nonce=-1, sub=-1, height=-1): self.version = version self.services = svcs self.time = tstamp self.addrRecv = addrRcv self.addrFrom = addrFrm self.nonce = nonce self.subver = sub self.height0 = height def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): verData = toUnpack else: verData = BinaryUnpacker( toUnpack ) self.version = verData.get(INT32) self.services = int_to_bitset(verData.get(UINT64), widthBytes=8) self.time = verData.get(INT64) self.addrRecv = PyNetAddress().unserialize(verData, hasTimeField=False) self.addrFrom = PyNetAddress().unserialize(verData, hasTimeField=False) self.nonce = verData.get(UINT64) self.subver = verData.get(VAR_STR) self.height0 = verData.get(INT32) return self def serialize(self): bp = BinaryPacker() bp.put(INT32, self.version ) bp.put(UINT64, bitset_to_int(self.services)) bp.put(INT64, self.time ) # todo, should this really be int64? bp.put(BINARY_CHUNK, self.addrRecv.serialize(withTimeField=False)) bp.put(BINARY_CHUNK, self.addrFrom.serialize(withTimeField=False)) bp.put(UINT64, self.nonce ) bp.put(VAR_STR, self.subver ) bp.put(INT32, self.height0 ) return bp.getBinaryString() def pprint(self, nIndent=0): indstr = indent*nIndent print '' print indstr + 'Message(version):' print indstr + indent + 'Version: ' + str(self.version) print indstr + indent + 'Services: ' + self.services print indstr + indent + 'Time: ' + unixTimeToFormatStr(self.time) print indstr + indent + 'AddrTo: ',; self.addrRecv.pprintShort() print indstr + indent + 'AddrFrom:',; self.addrFrom.pprintShort() print indstr + indent + 'Nonce: ' + str(self.nonce) print indstr + indent + 'SubVer: ', self.subver print indstr + indent + 'StartHgt: ' + str(self.height0) ################################################################################ class PayloadVerack(object): """ All payload objects have a serialize and unserialize method, making them easy to attach to PyMessage objects """ command = 'verack' def __init__(self): pass def unserialize(self, toUnpack): return self def serialize(self): return '' def pprint(self, nIndent=0): indstr = indent*nIndent print '' print indstr + 'Message(verack)' ################################################################################ ################################################################################ class PayloadInv(object): """ All payload objects have a serialize and unserialize method, making them easy to attach to PyMessage objects """ command = 'inv' def __init__(self): self.invList = [] # list of (type, hash) pairs def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): invData = toUnpack else: invData = BinaryUnpacker( toUnpack ) numInv = invData.get(VAR_INT) for i in range(numInv): invType = invData.get(UINT32) invHash = invData.get(BINARY_CHUNK, 32) self.invList.append( [invType, invHash] ) return self def serialize(self): bp = BinaryPacker() bp.put(VAR_INT, len(self.invList)) for inv in self.invList: bp.put(UINT32, inv[0]) bp.put(BINARY_CHUNK, inv[1], width=32) return bp.getBinaryString() def pprint(self, nIndent=0): indstr = indent*nIndent print '' print indstr + 'Message(inv):' for inv in self.invList: print indstr + indent + ('BLOCK: ' if inv[0]==2 else 'TX : ') + \ binary_to_hex(inv[1]) ################################################################################ ################################################################################ class PayloadGetData(object): """ All payload objects have a serialize and unserialize method, making them easy to attach to PyMessage objects """ command = 'getdata' def __init__(self, invList=[]): if invList: self.invList = invList else: self.invList = [] def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): invData = toUnpack else: invData = BinaryUnpacker( toUnpack ) numInv = invData.get(VAR_INT) for i in range(numInv): invType = invData.get(UINT32) invHash = invData.get(BINARY_CHUNK, 32) self.invList.append( [invType, invHash] ) return self def serialize(self): bp = BinaryPacker() bp.put(VAR_INT, len(self.invList)) for inv in self.invList: bp.put(UINT32, inv[0]) bp.put(BINARY_CHUNK, inv[1], width=32) return bp.getBinaryString() def pprint(self, nIndent=0): indstr = indent*nIndent print '' print indstr + 'Message(getdata):' for inv in self.invList: print indstr + indent + ('BLOCK: ' if inv[0]==2 else 'TX : ') + \ binary_to_hex(inv[1]) ################################################################################ ################################################################################ class PayloadGetHeaders(object): command = 'getheaders' def __init__(self, hashStartList=[], hashStop=''): self.version = 1 self.hashList = hashStartList self.hashStop = hashStop def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): ghData = toUnpack else: ghData = BinaryUnpacker( toUnpack ) self.version = ghData.get(UINT32) nhash = ghData.get(VAR_INT) for i in range(nhash): self.hashList.append(ghData.get(BINARY_CHUNK, 32)) self.hashStop = ghData.get(BINARY_CHUNK, 32) return self def serialize(self): nhash = len(self.hashList) bp = BinaryPacker() bp.put(UINT32, self.version) bp.put(VAR_INT, nhash) for i in range(nhash): bp.put(BINARY_CHUNK, self.hashList[i], width=32) bp.put(BINARY_CHUNK, self.hashStop, width=32) return bp.getBinaryString() def pprint(self, nIndent=0): indstr = indent*nIndent print '' print indstr + 'Message(getheaders):' print indstr + indent + 'HashList(s) :' + binary_to_hex(self.hashList[0]) for i in range(1,len(self.hashList)): print indstr + indent + ' :' + binary_to_hex(self.hashList[i]) print indstr + indent + 'HashStop :' + binary_to_hex(self.hashStop) ################################################################################ ################################################################################ class PayloadGetBlocks(object): command = 'getblocks' def __init__(self, version=1, startCt=-1, hashStartList=[], hashStop=''): self.version = 1 self.hashList = hashStartList self.hashStop = hashStop def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): gbData = toUnpack else: gbData = BinaryUnpacker( toUnpack ) self.version = gbData.get(UINT32) nhash = gbData.get(VAR_INT) for i in range(nhash): self.hashList.append(gbData.get(BINARY_CHUNK, 32)) self.hashStop = gbData.get(BINARY_CHUNK, 32) return self def serialize(self): nhash = len(self.hashList) bp = BinaryPacker() bp.put(UINT32, self.version) bp.put(VAR_INT, nhash) for i in range(nhash): bp.put(BINARY_CHUNK, self.hashList[i], width=32) bp.put(BINARY_CHUNK, self.hashList, width=32) return bp.getBinaryString() def pprint(self, nIndent=0): indstr = indent*nIndent print '' print indstr + 'Message(getheaders):' print indstr + indent + 'Version :' + str(self.version) print indstr + indent + 'HashList(s) :' + binary_to_hex(self.hashList[0]) for i in range(1,len(self.hashList)): print indstr + indent + ' :' + binary_to_hex(self.hashList[i]) print indstr + indent + 'HashStop :' + binary_to_hex(self.hashStop) ################################################################################ ################################################################################ class PayloadTx(object): command = 'tx' def __init__(self, tx=PyTx()): self.tx = tx def unserialize(self, toUnpack): self.tx.unserialize(toUnpack) return self def serialize(self): return self.tx.serialize() def pprint(self, nIndent=0): indstr = indent*nIndent print '' print indstr + 'Message(tx):' self.tx.pprint(nIndent+1) ################################################################################ ################################################################################ class PayloadHeaders(object): command = 'headers' def __init__(self, header=PyBlockHeader(), headerlist=[]): self.header = header self.headerList = headerlist def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): headerData = toUnpack else: headerData = BinaryUnpacker( toUnpack ) self.headerList = [] self.header.unserialize(headerData) numHeader = headerData.get(VAR_INT) for i in range(numHeader): self.headerList.append(PyBlockHeader().unserialize(headerData)) headerData.get(VAR_INT) # Not sure if this is even used, ever return self def serialize(self): bp = BinaryPacker() bp.put(BINARY_CHUNK, self.header.serialize()) bp.put(VAR_INT, len(self.headerList)) for header in self.headerList: bp.put(BINARY_CHUNK, header.serialize()) bp.put(VAR_INT, 0) return bp.getBinaryString() def pprint(self, nIndent=0): indstr = indent*nIndent print '' print indstr + 'Message(headers):' self.header.pprint(nIndent+1) for header in self.headerList: print indstr + indent + 'Header:', header.getHash() ################################################################################ ################################################################################ class PayloadBlock(object): command = 'block' def __init__(self, header=PyBlockHeader(), txlist=[]): self.header = header self.txList = txlist def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): blkData = toUnpack else: blkData = BinaryUnpacker( toUnpack ) self.txList = [] self.header.unserialize(blkData) numTx = blkData.get(VAR_INT) for i in range(numTx): self.txList.append(PyTx().unserialize(blkData)) return self def serialize(self): bp = BinaryPacker() bp.put(BINARY_CHUNK, self.header.serialize()) bp.put(VAR_INT, len(self.txList)) for tx in self.txList: bp.put(BINARY_CHUNK, tx.serialize()) return bp.getBinaryString() def pprint(self, nIndent=0): indstr = indent*nIndent print '' print indstr + 'Message(block):' self.header.pprint(nIndent+1) for tx in self.txList: print indstr + indent + 'Tx:', tx.getHashHex() ################################################################################ class PayloadAlert(object): command = 'alert' def __init__(self): self.version = 1 self.relayUntil = 0 self.expiration = 0 self.uniqueID = 0 self.cancelVal = 0 self.cancelSet = [] self.minVersion = 0 self.maxVersion = 0 self.subVerSet = [] self.comment = '' self.statusBar = '' self.reserved = '' self.signature = '' def unserialize(self, toUnpack): if isinstance(toUnpack, BinaryUnpacker): blkData = toUnpack else: blkData = BinaryUnpacker( toUnpack ) return self def serialize(self): bp = BinaryPacker() return bp.getBinaryString() def pprint(self, nIndent=0): print nIndent*'\t' + 'ALERT(...)' REJECT_MALFORMED_CODE = 0x01 REJECT_INVALID_CODE = 0x10 REJECT_OBSOLETE_CODE = 0x11 REJECT_DUPLICATE_CODE = 0x12 REJECT_NONSTANDARD_CODE = 0x40 REJECT_DUST_CODE = 0x41 REJECT_INSUFFICIENTFEE_CODE = 0x42 REJECT_CHECKPOINT_CODE = 0x43 ################################################################################ class PayloadReject(object): command = 'reject' def __init__(self): self.messageType = '' self.message = '' self.data = '' self.serializedData = None self.rejectCode = None def unserialize(self, toUnpack): bu = BinaryUnpacker(toUnpack) self.messageType = bu.get(VAR_STR) self.rejectCode = bu.get(INT8) self.message = bu.get(VAR_STR) self.data = bu.get(BINARY_CHUNK, bu.getRemainingSize()) self.serializedData = toUnpack return self def serialize(self): return self.serializedData def pprint(self, nIndent=0): print nIndent*'\t' + 'REJECT - Tx: ' + self.message ################################################################################ # Use this map to figure out which object to serialize/unserialize from a cmd PayloadMap = { 'ping': PayloadPing, 'tx': PayloadTx, 'inv': PayloadInv, 'version': PayloadVersion, 'verack': PayloadVerack, 'addr': PayloadAddr, 'getdata': PayloadGetData, 'getheaders': PayloadGetHeaders, 'getblocks': PayloadGetBlocks, 'block': PayloadBlock, 'headers': PayloadHeaders, 'alert': PayloadAlert, 'reject': PayloadReject } class FakeClientFactory(ReconnectingClientFactory): """ A fake class that has the same methods as an ArmoryClientFactory, but doesn't do anything. If there is no internet, then we want to be able to use the same calls """ ############################################################################# def __init__(self, \ def_handshake=None, \ func_loseConnect=(lambda: None), \ func_madeConnect=(lambda: None), \ func_newTx=(lambda x: None), \ func_newBlock=(lambda x,y: None), \ func_inv=(lambda x: None)): pass def addTxToMemoryPool(self, pytx): pass def handshakeFinished(self, protoObj): pass def clientConnectionLost(self, connector, reason): pass def connectionFailed(self, protoObj, reason): pass def sendTx(self, pytxObj): pass ################################################################################ # It seems we need to do this frequently when downloading headers & blocks # This only returns a list of numbers, but one list-comprehension to get hashes def createBlockLocatorNumList(topblk): blockNumList = [] n,step,niter = topblk,1,0 while n>0: blockNumList.append(n) if niter >= 10: step *= 2 n -= step niter += 1 blockNumList.append(0) return blockNumList ################################################################################ def forceDeferred(callbk): if callbk: if isinstance(callbk, Deferred): return callbk else: d = Deferred() d.addCallback(callbk) return d # kate: indent-width 3; replace-tabs on; armory-0.92.3/armoryengine/Timer.py0000644000000000000000000000670112414772654015765 0ustar rootroot################################################################################ # # Copyright (C) 2011-2014, Armory Technologies, Inc. # Distributed under the GNU Affero General Public License (AGPL v3) # See LICENSE or http://www.gnu.org/licenses/agpl.html # ################################################################################ # # Project: Armory # Author: Alan Reiner # Website: www.bitcoinarmory.com # Orig Date: 20 November, 2011 # ################################################################################ from armoryengine.ArmoryUtils import LOGWARN, RightNow, LOGERROR class Timer(object): ################################################################################ # # Keep track of lots of different timers: # # Key: timerName # Value: [cumulTime, numStart, lastStart, isRunning] # timerMap = {} def startTimer(self, timerName): if not self.timerMap.has_key(timerName): self.timerMap[timerName] = [0, 0, 0, False] timerEntry = self.timerMap[timerName] timerEntry[1] += 1 timerEntry[2] = RightNow() timerEntry[3] = True def stopTimer(self, timerName): if not self.timerMap.has_key(timerName): LOGWARN('Requested stop timer that does not exist! (%s)' % timerName) return if not self.timerMap[timerName][3]: LOGWARN('Requested stop timer that is not running! (%s)' % timerName) return timerEntry = self.timerMap[timerName] timerEntry[0] += RightNow() - timerEntry[2] timerEntry[2] = 0 timerEntry[3] = False def resetTimer(self, timerName): if not self.timerMap.has_key(timerName): LOGERROR('Requested reset timer that does not exist! (%s)' % timerName) # Even if it didn't exist, it will be created now self.timerMap[timerName] = [0, 0, 0, False] def readTimer(self, timerName): if not self.timerMap.has_key(timerName): LOGERROR('Requested read timer that does not exist! (%s)' % timerName) return timerEntry = self.timerMap[timerName] return timerEntry[0] + (RightNow() - timerEntry[2]) def printTimings(self): print 'Timings: '.ljust(30), print 'nCall'.rjust(13), print 'cumulTime'.rjust(13), print 'avgTime'.rjust(13) print '-'*70 for tname,quad in self.timerMap.iteritems(): print ('%s' % tname).ljust(30), print ('%d' % quad[1]).rjust(13), print ('%0.6f' % quad[0]).rjust(13), avg = quad[0]/quad[1] print ('%0.6f' % avg).rjust(13) print '-'*70 def saveTimingsCSV(self, fname): f = open(fname, 'w') f.write( 'TimerName,') f.write( 'nCall,') f.write( 'cumulTime,') f.write( 'avgTime\n\n') for tname,quad in self.timerMap.iteritems(): f.write('%s,' % tname) f.write('%d,' % quad[1]) f.write('%0.6f,' % quad[0]) avg = quad[0]/quad[1] f.write('%0.6f\n' % avg) f.write('\n\nNote: timings may be incorrect if errors ' 'were triggered in the timed functions') print 'Saved timings to file: %s' % fname def __init__(selfparams): # @NoSelf pass def TimeThisFunction(func): timer = Timer() def inner(*args, **kwargs): timer.startTimer(func.__name__) ret = func(*args, **kwargs) timer.stopTimer(func.__name__) return ret return inner armory-0.92.3/armoryengine/MultiSigUtils.py0000644000000000000000000011772112414772654017470 0ustar rootrootfrom armoryengine.ArmoryUtils import * from armoryengine.Transaction import * MULTISIG_VERSION = 1 ################################################################################ # # Multi-signature transactions are going to require a ton of different # primitives to be both useful and safe for escrow. All primitives should # have an ASCII-armored-esque form for transmission through email or text # file, as well as binary form for when file transfer is guaranteed # # Until Armory implements BIP 32, these utilities are more suited to # low-volume use cases, such as one-time escrow, or long-term savings # using multi-device authentication. Multi-signature *wallets* which # behave like regular wallets but spit out P2SH addresses and usable # in every day situations -- those will have to wait for Armory's new # wallet format. # # Concepts: # "Lockbox": A "lock box" for putting coins that will be protected # with multiple signatures. The lockbox contains both # the script info as well as meta-data, like participants' # names and emails associated with each public key. # # # # # ################################################################################ """ Use-Case 1 -- Protecting coins with 2-of-3 computers (2 offline, 1 online): Create or access existing wallet on each of three computers. Online computer will create the lockbox - needs one public key from its own wallet, and one from each offline wallet. Can have both WO wallets on the online computer, and pull keys directly from those. User creates an lockbox with all three keys, labeling them appropriately This lockbox will be added to the global list. User will fund the lockbox from an existing offline wallet with lots of money. He does not need to use the special funding procedure, which is only needed if there's multiple people involved with less than full trust. Creates the transaction as usual, but uses the "lockbox" button for the recipient instead of normal address. The address line will show the lockbox ID and short description. Will save the lockbox and the offline transaction to the USB drive """ LOCKBOXIDSIZE = 8 PROMIDSIZE = 4 LBPREFIX, LBSUFFIX = 'Lockbox[Bare:', ']' LBP2SHPREFIX = 'Lockbox[' ################################################################################ def calcLockboxID(script=None, scraddr=None): # ScrAddr is "Script/Address" and for multisig it is 0xfe followed by # M and N, then the SORTED hash160 values of the public keys # Part of the reason for using "ScrAddrs" is to bundle together # different scripts that have the same effective signing authority. # Different sortings of the same public key list have same signing # authority and therefore should have the same ScrAddr if script is not None: scrType = getTxOutScriptType(script) if not scrType==CPP_TXOUT_MULTISIG: LOGERROR('Not a multisig script!') return None scraddr = script_to_scrAddr(script) if not scraddr.startswith(SCRADDR_MULTISIG_BYTE): LOGERROR('ScrAddr is not a multisig script!') return None hashedData = hash160(MAGIC_BYTES + scraddr) return binary_to_base58(hashedData)[1:9] ################################################################################ def createLockboxEntryStr(lbID, isBareMultiSig=False): return '%s%s%s' % (LBPREFIX if isBareMultiSig else LBP2SHPREFIX, lbID, LBSUFFIX) ################################################################################ def readLockboxEntryStr(addrtext): result = None if isBareLockbox(addrtext) or isP2SHLockbox(addrtext): len(LBPREFIX if isBareLockbox(addrtext) else LBP2SHPREFIX) idStr = addrtext[len(LBPREFIX if isBareLockbox(addrtext) else LBP2SHPREFIX): addrtext.find(LBSUFFIX)] if len(idStr)==LOCKBOXIDSIZE: result = idStr return result ################################################################################ def isBareLockbox(addrtext): return addrtext.startswith(LBPREFIX) def scrAddr_to_displayStr(scrAddr, wltMap, lbMap): retStr = '' if scrAddr[0] in (SCRADDR_P2PKH_BYTE, SCRADDR_P2SH_BYTE): retStr = scrAddr_to_addrStr(scrAddr) elif scrAddr[0] == SCRADDR_MULTISIG_BYTE: retStr = getDisplayStringForScript(scrAddr[1:], wltMap, lbMap) else: LOGERROR('scrAddr %s is invalid.' % binary_to_hex(scrAddr)) return retStr ################################################################################ def isP2SHLockbox(addrtext): # Bugfix: Bare prefix includes P2SH prefix, whoops. Return false if Bare return addrtext.startswith(LBP2SHPREFIX) and not isBareLockbox(addrtext) ################################################################################ def getWltFromB58ID(inB58ID, inWltMap, inLBMap, inLBWltMap): retWlt = None retWltIsCPP = True if inB58ID in inWltMap.keys(): retWlt = inWltMap[inB58ID] retWltIsCPP = False elif inB58ID in inLBMap.keys(): retWlt = inLBWltMap[inB58ID] else: LOGERROR('Base58 ID %s does not represent a valid wallet or lockbox.' % \ inB58ID) return (retWlt, retWltIsCPP) ################################################################################ # Function that writes a lockbox to a file. The lockbox can be appended to a # previously existing file or can overwrite what was already in the file. def writeLockboxesFile(inLockboxes, lbFilePath, append=False): writeMode = 'w' if append: writeMode = 'a' # Do all the serializing and bail-on-error before opening the file # for writing, or we might delete it all by accident textOut = '\n\n'.join([lb.serializeAscii() for lb in inLockboxes]) + '\n' with open(lbFilePath, writeMode) as f: f.write(textOut) f.flush() os.fsync(f.fileno()) ################################################################################ # Function that can be used to send an e-mail to multiple recipients. def readLockboxesFile(lbFilePath): retLBList = [] # Read in the lockbox file. with open(lbFilePath, 'r') as lbFileData: allData = lbFileData.read() # Find the lockbox starting point. startMark = '=====LOCKBOX' if startMark in allData: try: # Find the point where the start mark begins and collect either all the # data before the next LB or the remaining data in the file (i.e., # we're on the final LB). pos = allData.find(startMark) while pos >= 0: nextPos = allData.find(startMark, pos+1) if nextPos < 0: nextPos = len(allData) # Pull in all the LB data, process it and add it to the LB list. lbBlock = allData[pos:nextPos].strip() lbox = MultiSigLockbox().unserializeAscii(lbBlock) LOGINFO('Read in Lockbox: %s' % lbox.uniqueIDB58) retLBList.append(lbox) pos = allData.find(startMark, pos+1) except: LOGEXCEPT('Error reading lockboxes file') shutil.copy(lbFilePath, lbFilePath+'.%d.bak'% long(RightNow())) return retLBList ############################################################################# def getLockboxFilePaths(): '''Function that finds the paths of all lockboxes in the Armory home directory.''' lbPaths = [] # Return the multisig file path. if os.path.isfile(MULTISIG_FILE): lbPaths.append(MULTISIG_FILE) # For now, no standalone lockboxes will be returned. Maybe later.... #for f in os.listdir(ARMORY_HOME_DIR): # fullPath = os.path.join(ARMORY_HOME_DIR, f) # if os.path.isfile(fullPath) and not fullPath.endswith('lockbox.txt'): # lbPaths.append(fullPath) return lbPaths ############################################################################# def isMofNNonStandardToSpend(m, n): # Minimum non-standard tx spends # 4 of 4 # 3 of 5 # 2 of 6 # any of 7 return (n > 3 and m > 3) or \ (n > 4 and m > 2) or \ (n > 5 and m > 1) or \ n > 6 ################################################################################ ################################################################################ class MultiSigLockbox(AsciiSerializable): OBJNAME = 'Lockbox' BLKSTRING = 'LOCKBOX' EMAILSUBJ = 'Armory Lockbox Definition - %s' EMAILBODY = """ The chunk of text below is a complete lockbox definition needed to track the balance of this multi-sig lockbox, as well as create signatures for proposed spending transactions. Open the Lockbox Manager, click "Import Lockbox" in the first row, then copy the text below into the import box, including the first and last lines. You will need to restart Armory and let it rescan if this lockbox has already been used.""" ############################################################################# def __init__(self, name=None, descr=None, M=None, N=None, dPubKeys=None, createDate=None, version=MULTISIG_VERSION): self.version = MULTISIG_VERSION self.shortName = toUnicode(name) self.longDescr = toUnicode(descr) self.createDate = long(RightNow()) if createDate is None else createDate self.magicBytes = MAGIC_BYTES self.uniqueIDB58 = None self.asciiID = None if (M is not None) and (N is not None) and (dPubKeys is not None): self.setParams(name, descr, M, N, dPubKeys, createDate, version) ############################################################################# def setParams(self, name, descr, M, N, dPubKeys, createDate=None, version=MULTISIG_VERSION): self.version = version self.magicBytes = MAGIC_BYTES self.shortName = name self.longDescr = toUnicode(descr) self.M = M self.N = N self.dPubKeys = dPubKeys[:] binPubKeys = [p.binPubKey for p in dPubKeys] self.a160List = [hash160(p) for p in binPubKeys] if createDate is not None: self.createDate = createDate script = pubkeylist_to_multisig_script(binPubKeys, self.M, True) # Computed some derived members self.binScript = script self.scrAddr = script_to_scrAddr(script) self.p2shScrAddr = script_to_scrAddr(script_to_p2sh_script(script)) self.uniqueIDB58 = calcLockboxID(script) self.opStrList = convertScriptToOpStrings(script) self.asciiID = self.uniqueIDB58 # need a common member name in all classes ############################################################################# def serialize(self): bp = BinaryPacker() bp.put(UINT32, self.version) bp.put(BINARY_CHUNK, MAGIC_BYTES) bp.put(UINT64, self.createDate) bp.put(VAR_STR, toBytes(self.shortName)) bp.put(VAR_STR, toBytes(self.longDescr)) bp.put(UINT8, self.M) bp.put(UINT8, self.N) for i in range(self.N): bp.put(VAR_STR, self.dPubKeys[i].serialize()) return bp.getBinaryString() ############################################################################# # In the final stages of lockbox design, I changed up the serialization # format for lockboxes, and decided to see how easy it was to transition # using the version numbers. Here's the old unserialize version, modified # to map the old data to the new format. ArmoryQt will read all the # lockboxes in the file, it will call this on each one of them, and then # it will write out all the lockboxes whic effectively, immediately upgrades # all of them. def unserialize_v0(self, rawData, expectID=None, skipMagicCheck=False): LOGWARN('Version 0 lockbox detected. Reading and converting') bu = BinaryUnpacker(rawData) boxVersion = bu.get(UINT32) boxMagic = bu.get(BINARY_CHUNK, 4) created = bu.get(UINT64) boxScript = bu.get(VAR_STR) boxName = toUnicode(bu.get(VAR_STR)) boxDescr = toUnicode(bu.get(VAR_STR)) nComment = bu.get(UINT32) boxComms = ['']*nComment for i in range(nComment): boxComms[i] = toUnicode(bu.get(VAR_STR)) # Check the magic bytes of the lockbox match if not boxMagic == MAGIC_BYTES and not skipMagicCheck: LOGERROR('Wrong network!') LOGERROR(' Lockbox Magic: ' + binary_to_hex(boxMagic)) LOGERROR(' Armory Magic: ' + binary_to_hex(MAGIC_BYTES)) raise NetworkIDError('Network magic bytes mismatch') # Lockbox ID is written in the first line, it should match the script # If not maybe a version mistmatch, serialization error, or bug # (unfortunately, for mixed network testing, the lockbox ID is the # hash of the script & the MAGIC_BYTES, which means we need to # skip checking the ID if we are skipping MAGIC) if expectID and not calcLockboxID(boxScript) == expectID and not skipMagicCheck: LOGERROR('ID on lockbox block does not match script') raise UnserializeError('ID on lockbox does not match!') # Now we switch to the new setParams method M,N,a160s,pubs = getMultisigScriptInfo(boxScript) dPubKeys = [DecoratedPublicKey(pub, com) for pub,com in zip(pubs,boxComms)] # No need to read magic bytes -- already checked & bailed if incorrect self.setParams(boxName, boxDescr, M, N, dPubKeys, created) return self ############################################################################# def unserialize(self, rawData, expectID=None, skipMagicCheck=False): bu = BinaryUnpacker(rawData) lboxVersion = bu.get(UINT32) # If this is an older version, use conversion method if lboxVersion==0: return self.unserialize_v0(rawData, expectID) lboxMagic = bu.get(BINARY_CHUNK, 4) created = bu.get(UINT64) lboxName = toUnicode(bu.get(VAR_STR)) lboxDescr = toUnicode(bu.get(VAR_STR)) M = bu.get(UINT8) N = bu.get(UINT8) dPubKeys = [] for i in range(N): dPubKeys.append(DecoratedPublicKey().unserialize(bu.get(VAR_STR), skipMagicCheck=skipMagicCheck)) # Issue a warning if the versions don't match if not lboxVersion == MULTISIG_VERSION: LOGWARN('Unserialing lockbox of different version') LOGWARN(' Lockbox Version: %d' % lboxVersion) LOGWARN(' Armory Version: %d' % MULTISIG_VERSION) # Check the magic bytes of the lockbox match if not lboxMagic == MAGIC_BYTES and not skipMagicCheck: LOGERROR('Wrong network!') LOGERROR(' Lockbox Magic: ' + binary_to_hex(lboxMagic)) LOGERROR(' Armory Magic: ' + binary_to_hex(MAGIC_BYTES)) raise NetworkIDError('Network magic bytes mismatch') binPubKeys = [p.binPubKey for p in dPubKeys] lboxScript = pubkeylist_to_multisig_script(binPubKeys, M) # Lockbox ID is written in the first line, it should match the script # If not maybe a version mistmatch, serialization error, or bug if expectID and not calcLockboxID(lboxScript) == expectID and not skipMagicCheck: LOGERROR('ID on lockbox block does not match script') LOGERROR(' Expecting: %s' % str(expectID)) LOGERROR(' Calculated: %s' % str(calcLockboxID(lboxScript))) raise UnserializeError('ID on lockbox does not match!') # No need to read magic bytes -- already checked & bailed if incorrect self.setParams(lboxName, lboxDescr, M, N, dPubKeys, created) return self ############################################################################# def toJSONMap(self): outjson = {} outjson['version'] = self.version outjson['magicbytes'] = binary_to_hex(MAGIC_BYTES) outjson['id'] = self.asciiID outjson['lboxname'] = self.shortName outjson['lboxdescr'] = self.longDescr outjson['M'] = self.M outjson['N'] = self.N outjson['pubkeylist'] = [dpk.toJSONMap() for dpk in self.dPubKeys] outjson['a160list'] = [binary_to_hex(hash160(p.binPubKey)) \ for p in self.dPubKeys] outjson['addrstrs'] = [hash160_to_addrStr(hex_to_binary(a)) \ for a in outjson['a160list']] outjson['txoutscript'] = binary_to_hex(self.binScript) outjson['p2shscript'] = binary_to_hex(scrAddr_to_script(self.p2shScrAddr)) outjson['p2shaddr'] = scrAddr_to_addrStr(self.p2shScrAddr) outjson['createdate'] = self.createDate return outjson ############################################################################# def fromJSONMap(self, jsonMap, skipMagicCheck=False): ver = jsonMap['version'] magic = hex_to_binary(jsonMap['magicbytes']) uniq = jsonMap['id'] # Issue a warning if the versions don't match if not ver == UNSIGNED_TX_VERSION: LOGWARN('Unserializing Lockbox of different version') LOGWARN(' USTX Version: %d' % ver) LOGWARN(' Armory Version: %d' % UNSIGNED_TX_VERSION) # Check the magic bytes of the lockbox match if not magic == MAGIC_BYTES and not skipMagicCheck: LOGERROR('Wrong network!') LOGERROR(' USTX Magic: ' + binary_to_hex(magic)) LOGERROR(' Armory Magic: ' + binary_to_hex(MAGIC_BYTES)) raise NetworkIDError('Network magic bytes mismatch') name = jsonMap['lboxname'] descr = jsonMap['lboxdescr'] M = jsonMap['M'] N = jsonMap['N'] pubs = [] for i in range(N): pubs.append(DecoratedPublicKey().fromJSONMap(jsonMap['pubkeylist'][i], skipMagicCheck)) created = jsonMap['createdate'] self.setParams(name, descr, M, N, pubs, created) return self ############################################################################# def pprint(self): print 'Multi-signature %d-of-%d lockbox:' % (self.M, self.N) print ' Unique ID: ', self.uniqueIDB58 print ' Created: ', unixTimeToFormatStr(self.createDate) print ' LBox Name: ', self.shortName print ' P2SHAddr: ', scrAddr_to_addrStr(self.p2shScrAddr) print ' Box Desc: ' print ' ', self.longDescr[:70] print ' Key List: ' print ' Script Ops: ' for opStr in self.opStrList: print ' ', opStr print'' print ' Key Info: ' for i in range(len(self.dPubKeys)): print ' Key %d' % i print ' ', binary_to_hex(self.dPubKeys[i].binPubKey)[:40] + '...' print ' ', hash160_to_addrStr(self.a160List[i]) print '' ############################################################################# def pprintOneLine(self): print 'LockBox %s: %s-of-%s, created: %s; "%s"' % (self.uniqueIDB58, self.M, self.N, unixTimeToFormatStr(self.createDate), self.shortName) ################################################################################ def createDecoratedTxOut(self, value=0, asP2SH=False): if not asP2SH: dtxoScript = self.binScript p2shScript = None else: dtxoScript = script_to_p2sh_script(self.binScript) p2shScript = self.binScript return DecoratedTxOut(dtxoScript, value, p2shScript) ################################################################################ def makeFundingTxFromPromNotes(self, promList): ustxiAccum = [] totalPay = sum([prom.dtxoTarget.value for prom in promList]) totalFee = sum([prom.feeAmt for prom in promList]) # DTXO list always has at least the lockbox itself dtxoAccum = [self.createDecoratedTxOut(value=totalPay, asP2SH=False)] # Errors with the change values should've been caught in prom::setParams totalInputs = 0 totalChange = 0 for prom in promList: for ustxi in prom.ustxInputs: ustxiAccum.append(ustxi) totalInputs += ustxi.value # Add any change outputs if prom.dtxoChange and prom.dtxoChange.value > 0: dtxoAccum.append(prom.dtxoChange) totalChange += prom.dtxoChange.value if not totalPay + totalFee == totalInputs - totalChange: raise ValueError('Promissory note values do not add up correctly') return UnsignedTransaction().createFromUnsignedTxIO(ustxiAccum, dtxoAccum) ################################################################################ def makeSpendingTx(self, rawFundTxIdxPairs, dtxoList, feeAmt): ustxiAccum = [] # Errors with the change values should've been caught in setParams totalInputs = 0 anyP2SH = False for rawTx,txoIdx in rawFundTxIdxPairs: fundTx = PyTx().unserialize(rawTx) txout = fundTx.outputs[txoIdx] txoScript = txout.getScript() txoValue = txout.getValue() if not calcLockboxID(txoScript)==self.uniqueIDB58: raise InvalidScriptError('Given OutPoint is not for this lockbox') # If the funding tx is P2SH, make sure it matches the lockbox # then include the subscript in the USTXI p2shSubscript = None if getTxOutScriptType(txoScript) == CPP_TXOUT_P2SH: # setParams guarantees self.binScript is bare multi-sig script txP2SHScrAddr = script_to_scrAddr(txoScript) lbP2SHScrAddr = script_to_p2sh_script(self.binScript) if not lbP2SHScrAddr == txP2SHScrAddr: LOGERROR('Given utxo script hash does not match this lockbox') raise InvalidScriptError('P2SH input does not match lockbox') p2shSubscript = self.binScript anyP2SH = True ustxiAccum.append(UnsignedTxInput(rawTx, txoIdx, p2shSubscript)) totalInputs += txoValue # Copy the dtxoList since we're probably adding a change output dtxoAccum = dtxoList[:] totalOutputs = sum([dtxo.value for dtxo in dtxoAccum]) changeAmt = totalInputs - (totalOutputs + feeAmt) if changeAmt < 0: raise ValueError('More outputs than inputs!') elif changeAmt > 0: # If adding change output, make it P2SH if any inputs were P2SH if not anyP2SH: txoScript = self.binScript p2shScript = None else: txoScript = script_to_p2sh_script(self.binScript) p2shScript = self.binScript dtxoAccum.append( DecoratedTxOut(txoScript, changeAmt, p2shScript)) return UnsignedTransaction().createFromUnsignedTxIO(ustxiAccum, dtxoAccum) ################################################################################ ################################################################################ class DecoratedPublicKey(AsciiSerializable): OBJNAME = 'PublicKey' BLKSTRING = 'PUBLICKEY' EMAILSUBJ = 'Armory Public Key for Lockbox Creation - %s' EMAILBODY = """ The chunk of text below is a public key that can be imported into the lockbox creation window in Armory. Open the lockbox manager, click on "Create Lockbox", and then use the "Import" button next to the address book button. Copy the following text into the box, including the first and last lines.""" EQ_ATTRS_SIMPLE = ['version', 'binPubKey', 'keyComment', 'wltLocator', 'pubKeyID', 'asciiID', 'authMethod', 'authData'] ############################################################################# def __init__(self, binPubKey=None, keyComment=None, wltLoc=None, authMethod=None, authData=None): self.version = MULTISIG_VERSION self.binPubKey = binPubKey self.keyComment = '' self.wltLocator = '' self.authMethod = '' self.authData = authData if authData else NullAuthData() self.pubKeyID = None self.asciiID = None if binPubKey is not None: self.setParams(binPubKey, keyComment, wltLoc, authMethod, authData, version=self.version) ############################################################################# def setParams(self, binPubKey, keyComment=None, wltLoc=None, authMethod=None, authData=None, version=MULTISIG_VERSION): # Set params will only overwrite with non-None data self.binPubKey = binPubKey if keyComment is not None: self.keyComment = toUnicode(keyComment) if wltLoc is not None: self.wltLocator = wltLoc if authMethod is not None: self.authMethod = authMethod if authData is not None: self.authData = authData self.version = version pubkeyAddr = hash160_to_addrStr(hash160(binPubKey)) self.pubKeyID = pubkeyAddr[:12] self.asciiID = self.pubKeyID # need a common member name in all classes ############################################################################# def serialize(self): if not self.binPubKey: LOGERROR('Cannot serialize uninitialized pubkey') return None bp = BinaryPacker() bp.put(UINT32, self.version) bp.put(BINARY_CHUNK, MAGIC_BYTES) bp.put(VAR_STR, self.binPubKey) bp.put(VAR_STR, toBytes(self.keyComment)) bp.put(VAR_STR, self.wltLocator) bp.put(VAR_STR, self.authMethod) bp.put(VAR_STR, self.authData.serialize()) return bp.getBinaryString() ############################################################################# def unserialize(self, rawData, expectID=None, skipMagicCheck=False): ustxiList = [] bu = BinaryUnpacker(rawData) version = bu.get(UINT32) magicBytes = bu.get(BINARY_CHUNK, 4) binPubKey = bu.get(VAR_STR) keyComment = toUnicode(bu.get(VAR_STR)) wltLoc = bu.get(VAR_STR) authMeth = bu.get(VAR_STR) authDataStr = bu.get(VAR_STR) authData = NullAuthData().unserialize(authDataStr) # Check the magic bytes of the lockbox match if not magicBytes == MAGIC_BYTES and not skipMagicCheck: LOGERROR('Wrong network!') LOGERROR(' PubKey Magic: ' + binary_to_hex(magicBytes)) LOGERROR(' Armory Magic: ' + binary_to_hex(MAGIC_BYTES)) raise NetworkIDError('Network magic bytes mismatch') if not version==MULTISIG_VERSION: LOGWARN('Unserializing LB pubkey of different version') LOGWARN(' PubKey Version: %d' % version) LOGWARN(' Armory Version: %d' % MULTISIG_VERSION) self.setParams(binPubKey, keyComment, wltLoc, authMeth, authData, version) if expectID and not expectID==self.pubKeyID: LOGERROR('Pubkey block ID does not match expected') return None return self ############################################################################# def toJSONMap(self): outjson = {} outjson['version'] = self.version outjson['magicbytes'] = binary_to_hex(MAGIC_BYTES) outjson['id'] = self.asciiID outjson['pubkeyhex'] = binary_to_hex(self.binPubKey) outjson['keycomment'] = self.keyComment outjson['wltLocator'] = binary_to_hex(self.wltLocator) outjson['authmethod'] = self.authMethod # we expect plaintext outjson['authdata'] = binary_to_hex(self.authData.serialize()) return outjson ############################################################################# def fromJSONMap(self, jsonMap, skipMagicCheck=False): ver = jsonMap['version'] magic = jsonMap['magicbytes'] uniq = jsonMap['id'] # Issue a warning if the versions don't match if not ver == UNSIGNED_TX_VERSION: LOGWARN('Unserializing DPK of different version') LOGWARN(' USTX Version: %d' % ver) LOGWARN(' Armory Version: %d' % UNSIGNED_TX_VERSION) # Check the magic bytes of the lockbox match if not magic == MAGIC_BYTES and not skipMagicCheck: LOGERROR('Wrong network!') LOGERROR(' USTX Magic: ' + binary_to_hex(magic)) LOGERROR(' Armory Magic: ' + binary_to_hex(MAGIC_BYTES)) raise NetworkIDError('Network magic bytes mismatch') pub = hex_to_binary(jsonMap['pubkeyhex']) comm = jsonMap['keycomment'] loc = hex_to_binary(jsonMap['wltLocator']) meth = jsonMap['authmethod'] data = hex_to_binary(jsonMap['authdata']) authobj = NullAuthData().unserialize(data) self.setParams(pub, comm, loc, meth, authobj) return self ############################################################################# def pprint(self): print 'pprint of DecoratedPublicKey is not implemented' ################################################################################ def computePromissoryID(ustxiList=None, dtxoTarget=None, feeAmt=None, dtxoChange=None, prom=None): if prom: ustxiList = prom.ustxInputs dtxoTarget = prom.dtxoTarget feeAmt = prom.feeAmt dtxoChange = prom.dtxoChange if not ustxiList: LOGERROR("Empty ustxiList in computePromissoryID") return None outptList = sorted([ustxi.outpoint.serialize() for ustxi in ustxiList]) targStr = dtxoTarget.binScript targStr += int_to_binary(dtxoTarget.value, widthBytes=8) targStr += dtxoChange.binScript if dtxoChange else '' return binary_to_base58(hash256(''.join(outptList) + targStr))[:8] ################################################################################ ################################################################################ class MultiSigPromissoryNote(AsciiSerializable): OBJNAME = 'PromNote' BLKSTRING = 'PROMISSORY' EMAILSUBJ = 'Armory Promissory Note for Simulfunding - %s' EMAILBODY = """ The chunk of text below describes how this wallet will contribute to a simulfunding transaction. In the lockbox manager, go to "Merge Promissory Notes" and then click on "Import Promissory Note." Copy and paste the block of text into the import box, including the first and last lines. You should receive a block of text like this from each party funding this transaction.""" EQ_ATTRS_SIMPLE = ['version', 'dtxoTarget', 'feeAmt', 'dtxoChange', 'promID', 'asciiID', 'promLabel'] EQ_ATTRS_LISTS = ['ustxInputs'] ############################################################################# def __init__(self, dtxoTarget=None, feeAmt=None, ustxInputs=None, dtxoChange=None, promLabel=None, version=MULTISIG_VERSION): self.version = MULTISIG_VERSION self.dtxoTarget = dtxoTarget self.feeAmt = feeAmt self.ustxInputs = ustxInputs self.dtxoChange = dtxoChange self.promID = None self.asciiID = None self.promLabel = promLabel if promLabel else '' # We MIGHT use this object to simultaneously promise funds AND # provide a key to include in the target multisig lockbox (which would # save a round of exchanging data, if the use-case allows it) self.lockboxKey = '' if dtxoTarget is not None: self.setParams(dtxoTarget, feeAmt, dtxoChange, ustxInputs, promLabel, version) ############################################################################# def setParams(self, dtxoTarget=None, feeAmt=None, dtxoChange=None, ustxInputs=None, promLabel=None, version=MULTISIG_VERSION): # Set params will only overwrite with non-None data if dtxoTarget is not None: self.dtxoTarget = dtxoTarget if feeAmt is not None: self.feeAmt = feeAmt if dtxoChange is not None: self.dtxoChange = dtxoChange if ustxInputs is not None: self.ustxInputs = ustxInputs if promLabel is not None: self.promLabel = promLabel # Compute some other data members self.version = version self.magicBytes = MAGIC_BYTES self.promID = computePromissoryID(prom=self) self.asciiID = self.promID # need a common member name in all classes # Make sure that the change output matches expected, also set contribIDs totalInputs = 0 for ustxi in self.ustxInputs: totalInputs += ustxi.value ustxi.contribID = self.promID changeAmt = totalInputs - (self.dtxoTarget.value + self.feeAmt) if changeAmt > 0: if not self.dtxoChange.value==changeAmt: LOGERROR('dtxoChange.value==%s, computed %s', coin2strNZS(self.dtxoChange.value), coin2strNZS(changeAmt)) raise ValueError('Change output on prom note is unexpected') elif changeAmt < 0: LOGERROR('Insufficient prom inputs for payAmt and feeAmt') LOGERROR('Total inputs: %s', coin2strNZS(totalInputs)) LOGERROR('(Amt, Fee)=(%s,%s)', coin2strNZS(self.dtxoTarget.value), coin2strNZS(self.feeAmt)) raise ValueError('Insufficient prom inputs for pay & fee') ############################################################################# def setLockboxKey(self, binPubKey): keyPair = [binPubKey[0], len(binPubKey)] if not keyPair in [['\x02', 33], ['\x03', 33], ['\x04', 65]]: LOGERROR('Invalid public key supplied') return False if keyPair[0] == '\x04': if not CryptoECDSA().VerifyPublicKeyValid(SecureBinaryData(binPubKey)): LOGERROR('Invalid public key supplied') return False self.lockboxKey = binPubKey[:] return True ############################################################################# def serialize(self): if not self.dtxoTarget: LOGERROR('Cannot serialize uninitialized promissory note') return None if self.dtxoChange is None: serChange = '' else: serChange = self.dtxoChange.serialize() bp = BinaryPacker() bp.put(UINT32, self.version) bp.put(BINARY_CHUNK, MAGIC_BYTES) bp.put(VAR_STR, self.dtxoTarget.serialize()) bp.put(VAR_STR, serChange) bp.put(UINT64, self.feeAmt) bp.put(VAR_INT, len(self.ustxInputs)) for ustxi in self.ustxInputs: bp.put(VAR_STR, ustxi.serialize()) bp.put(VAR_STR, toBytes(self.promLabel)) bp.put(VAR_STR, self.lockboxKey) return bp.getBinaryString() ############################################################################# def unserialize(self, rawData, expectID=None, skipMagicCheck=False): ustxiList = [] bu = BinaryUnpacker(rawData) version = bu.get(UINT32) magicBytes = bu.get(BINARY_CHUNK, 4) target = bu.get(VAR_STR) change = bu.get(VAR_STR) feeAmt = bu.get(UINT64) numUSTXI = bu.get(VAR_INT) # Check the magic bytes of the lockbox match if not magicBytes == MAGIC_BYTES and not skipMagicCheck: LOGERROR('Wrong network!') LOGERROR(' PromNote Magic: ' + binary_to_hex(magicBytes)) LOGERROR(' Armory Magic: ' + binary_to_hex(MAGIC_BYTES)) raise NetworkIDError('Network magic bytes mismatch') for i in range(numUSTXI): ustxiList.append( UnsignedTxInput().unserialize(bu.get(VAR_STR), skipMagicCheck=skipMagicCheck) ) promLabel = toUnicode(bu.get(VAR_STR)) lockboxKey = bu.get(VAR_STR) if not version==MULTISIG_VERSION: LOGWARN('Unserialing promissory note of different version') LOGWARN(' PromNote Version: %d' % version) LOGWARN(' Armory Version: %d' % MULTISIG_VERSION) dtxoTarget = DecoratedTxOut().unserialize(target, skipMagicCheck=skipMagicCheck) dtxoChange = DecoratedTxOut().unserialize(change, skipMagicCheck=skipMagicCheck) if change else None self.setParams(dtxoTarget, feeAmt, dtxoChange, ustxiList, promLabel) if expectID and not expectID==self.promID: LOGERROR('Promissory note ID does not match expected') return None if len(lockboxKey)>0: self.setLockboxKey(lockboxKey) return self ############################################################################# def toJSONMap(self, lite=False): outjson = {} outjson['version'] = self.version outjson['magicbytes'] = binary_to_hex(MAGIC_BYTES) outjson['id'] = self.asciiID #bp = BinaryPacker() #bp.put(UINT32, self.version) #bp.put(BINARY_CHUNK, MAGIC_BYTES) #bp.put(VAR_STR, self.dtxoTarget.serialize()) #bp.put(VAR_STR, serChange) #bp.put(UINT64, self.feeAmt) #bp.put(VAR_INT, len(self.ustxInputs)) #for ustxi in self.ustxInputs: #bp.put(VAR_STR, ustxi.serialize()) #bp.put(VAR_STR, toBytes(self.promLabel)) #bp.put(VAR_STR, self.lockboxKey) if self.dtxoChange is None: dtxoChangeMap = {} else: dtxoChangeMap = self.dtxoChange.toJSONMap() outjson['txouttarget'] = self.dtxoTarget.toJSONMap() outjson['txoutchange'] = dtxoChangeMap outjson['fee'] = self.feeAmt outjson['numinputs'] = len(self.ustxInputs) outjson['promlabel'] = self.promLabel outjson['lbpubkey'] = self.lockboxKey if not lite: outjson['inputs'] = [] for ustxi in self.ustxInputs: outjson['inputs'].append(ustxi.toJSONMap()) return outjson ############################################################################# def fromJSONMap(self, jsonMap, skipMagicCheck=False): ver = jsonMap['version'] magic = jsonMap['magicbytes'] uniq = jsonMap['id'] # Issue a warning if the versions don't match if not ver == UNSIGNED_TX_VERSION: LOGWARN('Unserializing Lockbox of different version') LOGWARN(' USTX Version: %d' % ver) LOGWARN(' Armory Version: %d' % UNSIGNED_TX_VERSION) # Check the magic bytes of the lockbox match if not magic == MAGIC_BYTES and not skipMagicCheck: LOGERROR('Wrong network!') LOGERROR(' USTX Magic: ' + binary_to_hex(magic)) LOGERROR(' Armory Magic: ' + binary_to_hex(MAGIC_BYTES)) raise NetworkIDError('Network magic bytes mismatch') targ = DecoratedTxOut().fromJSONMap(jsonMap['txouttarget']) fee = jsonMap['fee'] if len(jsonMap['txoutchange'])>0: chng = DecoratedTxOut().fromJSONMap(jsonMap['txoutchange']) else: chng = None nin = jsonMap['numinputs'] inputs = [] for i in range(nin): inputs.append(UnsignedTxInput().fromJSONMap(jsonMap['inputs'][i], skipMagicCheck)) lbl = jsonMap['promlabel'] self.setParams(targ, fee, chng, inputs, lbl) return self ############################################################################# def pprint(self): print 'Promissory Note:' print ' Version :', self.version print ' Unique ID :', self.promID print ' Num Inputs :', len(self.ustxInputs) print ' Target Addr :', self.dtxoTarget.getRecipStr() print ' Pay Amount :', self.dtxoTarget.value print ' Fee Amount :', self.feeAmt if self.dtxoChange is not None: print ' ChangeAddr :', self.dtxoChange.getRecipStr() print ' LB Key :', self.lockboxKey print ' LB Key Info :', self.promLabel # Resolve circular dependencies here. from armoryengine.UserAddressUtils import getDisplayStringForScript armory-0.92.3/armoryengine/Decorators.py0000644000000000000000000001155512414772654017015 0ustar rootroot################################################################################ # # Copyright (C) 2011-2014, Armory Technologies, Inc. # Distributed under the GNU Affero General Public License (AGPL v3) # See LICENSE or http://www.gnu.org/licenses/agpl.html # ################################################################################ # # Project: Armory # Author: Alan Reiner # Website: www.bitcoinarmory.com # Orig Date: 20 November, 2011 # ################################################################################ from armoryengine.ArmoryUtils import send_email, LOGERROR import functools import sys # Following this pattern to allow arguments to be passed to this decorator: # http://stackoverflow.com/questions/10176226/how-to-pass-extra-arguments-to-python-decorator def EmailOutput(send_from, server, password, send_to, subject='Armory Output'): def ActualEmailOutputDecorator(func): @functools.wraps(func) # Pull in certain "helper" data from dec'd func def wrapper(*args, **kwargs): ret = func(*args, **kwargs) # Run dec'd func before sending e-mail if ret and send_from and server and password and send_to: send_email(send_from, server, password, send_to, subject, ret) return ret return wrapper return ActualEmailOutputDecorator # Windows does not handle extensions very well in QFileDialog.getSaveFileName # When double extensions (e.g. .sigcollect.tx) are used windows will return duplicates. # # This decorator removes just the longest repeating extension # Examples: # filename.a.b.c.a.b.c will reduce to filename.a.b.c # filename.a.b.b.a.b.b will reduce to filename.a.b def RemoveRepeatingExtensions(func): @functools.wraps(func) # Pull in certain "helper" data from dec'd func def inner(*args, **kwargs): rv = func(*args, **kwargs) segs = rv.split('.') isDupExt = lambda s, n : s[-n*2:-n] == s[-n:] # Try the maximum amount of repeating extensions first. for i in range(1, len(segs)/2 + 1)[::-1]: if isDupExt(segs, i): while isDupExt(segs, i): segs = segs[:-i] return '.'.join(segs) return inner # A decorator meant for the JSON RPC functions. It's important to both log # errors on the server and notify the client that an error occurred. This # decorator sets up a standardized way to catch errors that occur in a function # and report them. The drawback is that any decorated functs that do their own # try/catches won't have access to this functionality since those errors will # have been caught. def catchErrsForJSON(func): @functools.wraps(func) # Pull in certain "helper" data from dec'd func def inner(*args, **kwargs): jsonPrefix = "jsonrpc_" rv = None errTB = None errFrame = None errDepth = 0 # Just call the funct. If no errs are thrown, or if errs are caught before # returning, we'll get through this. Otherwise, get the error info and # place it in the log. try: rv = func(*args, **kwargs) except: # get the error info and ignore the 1st frame (i.e., this funct). (errType, errVal, errTB) = sys.exc_info() errFrame = errTB.tb_frame.f_back # Save basic info on the trace. rv = {} errStr = 'An error occurred in %s' % func.__name__[len(jsonPrefix):] errTypeStr = 'Error Type = \'%s\'' % errType.__name__ errValStr = 'Error Value = \'%s\'' % errVal rv['Error'] = errStr rv['Error Type'] = errType.__name__ rv['Error Value'] = str(errVal) # If type has no val, this'll be blank LOGRAWDATA(errStr) LOGRAWDATA(errTypeStr) LOGRAWDATA(errValStr) #LOGERROR(errStr) #LOGERROR(errTypeStr) #LOGERROR(errValStr) # Log each error line but don't return to the user. The user really # doesn't need to see the trace. Also, unless directly called, the # JSON functs will just lead back to where the JSON server started. # The trace can go almost 30 levels deep! So, we'll limit the reported # levels to 10 so that the logs aren't crushed. while errFrame != None and errDepth < 10: errFile = errFrame.f_code.co_filename errFileStr = 'Error File = \'%s\'' % errFile errFileNumStr = 'Error Line Number = \'%d\'' % errFrame.f_lineno LOGERROR(errFileStr) LOGERROR(errFileNumStr) errFrame = errFrame.f_back errDepth += 1 if errFrame != None and errDepth == 10: LOGERROR('Trace stopped so as to not overwhelm the logs') finally: # Delete circular references and return the error dict. if errTB: del errTB del errFrame # Not totally sure this is necessary. Just in case.... return rv return inner armory-0.92.3/armoryengine/CoinSelection.py0000644000000000000000000011042412414772654017441 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ ################################################################################ ################################################################################ # # SelectCoins algorithms # # The following methods define multiple ways that one could select coins # for a given transaction. However, the "best" solution is extremely # dependent on the variety of unspent outputs, and also the preferences # of the user. Things to take into account when selecting coins: # # - Number of inputs: If we have a lot of inputs in this transaction # from different addresses, then all those addresses # have now been linked together. We want to use # as few outputs as possible # # - Tx Fess/Size: The bigger the transaction, in bytes, the more # fee we're going to have to pay to the miners # # - Priority: Low-priority transactions might require higher # fees and/or take longer to make it into the # blockchain. Priority is the sum of TxOut # priorities: (NumConfirm * NumBTC / SizeKB) # We especially want to avoid 0-confirmation txs # # - Output values: In almost every transaction, we must return # change to ourselves. This means there will # be two outputs, one to the recipient, one to # us. We prefer that both outputs be about the # same size, so that it's not clear which is the # recipient, which is the change. But we don't # want to use too many inputs to do this. # # - Sustainability: We should pick a strategy that tends to leave our # wallet containing a variety of TxOuts that are # well-suited for future transactions to benefit. # For instance, always favoring the single TxOut # with a value close to the target, will result # in a future wallet full of tiny TxOuts. This # guarantees that in the future, we're going to # have to do 10+ inputs for a single Tx. # # # The strategy is to execute a half dozen different types of SelectCoins # algorithms, each with a different goal in mind. Then we examine each # of the results and evaluate a "select-score." Use the one with the # best score. In the future, we could make the scoring algorithm based # on user preferences. We expect that depending on what the availble # list looks like, some of these algorithms could produce perfect results, # and in other instances *terrible* results. # ################################################################################ ################################################################################ import math import random from armoryengine.ArmoryUtils import CheckHash160, binary_to_hex, coin2str, \ hash160_to_addrStr, ONE_BTC, CENT, int_to_binary, MIN_RELAY_TX_FEE, MIN_TX_FEE from armoryengine.Timer import TimeThisFunction from armoryengine.Transaction import * ################################################################################ # These would normally be defined by C++ and fed in, but I've recreated # the C++ class here... it's really just a container, anyway # # TODO: LevelDB upgrade: had to upgrade this class to use arbitrary # ScrAddress "notation", even though everything else on the python # side expects pure hash160 values. For now, it looks like it can # handle arbitrary scripts, but the CheckHash160() calls will # (correctly) throw errors if you don't. We can upgrade this in # the future. class PyUnspentTxOut(object): def __init__(self, scrAddr=None, txHash=None, txoIdx=None, val=None, numConf=None, fullScript=None): self.initialize(scrAddr, txHash, txoIdx, val, numConf, fullScript) ############################################################################# def createFromCppUtxo(self, cppUtxo): scrAddr= cppUtxo.getRecipientScrAddr() val = cppUtxo.getValue() conf = cppUtxo.getNumConfirm() txHash = cppUtxo.getTxHash() txoIdx = cppUtxo.getTxOutIndex() script = cppUtxo.getScript() self.initialize(scrAddr, txHash, txoIdx, val, conf, script) return self ############################################################################# def initialize(self, scrAddr=None, txHash=None, txoIdx=None, val=None, numConf=None, fullScript=None): self.scrAddr = scrAddr self.txHash = txHash self.txOutIndex = txoIdx self.val = val self.conf = numConf if self.scrAddr and fullScript is None: self.binScript = scrAddr_to_script(self.scrAddr) else: self.binScript = fullScript def getTxHash(self): return self.txHash def getTxOutIndex(self): return self.txOutIndex def getValue(self): return self.val def getNumConfirm(self): return self.conf def getScript(self): return self.binScript def getRecipientScrAddr(self): return self.scrAddr def getRecipientHash160(self): return CheckHash160(self.scrAddr) def prettyStr(self, indent=''): pstr = [indent] pstr.append(binary_to_hex(self.scrAddr[:8])) pstr.append(coin2str(self.val)) pstr.append(str(self.conf).rjust(8,' ')) return ' '.join(pstr) def pprint(self, indent=''): print self.prettyStr(indent) ################################################################################ def sumTxOutList(txoutList): return sum([u.getValue() for u in txoutList]) ################################################################################ # This is really just for viewing a TxOut list -- usually for debugging def pprintUnspentTxOutList(utxoList, headerLine='Coin Selection: '): totalSum = sum([u.getValue() for u in utxoList]) print headerLine, '(Total = %s BTC)' % coin2str(totalSum) print ' ','Owner Address'.ljust(34), print ' ','TxOutValue'.rjust(18), print ' ','NumConf'.rjust(8), print ' ','PriorityFactor'.rjust(16) for utxo in utxoList: a160 = CheckHash160(utxo.getRecipientScrAddr()) print ' ',hash160_to_addrStr(a160).ljust(34), print ' ',(coin2str(utxo.getValue()) + ' BTC').rjust(18), print ' ',str(utxo.getNumConfirm()).rjust(8), print ' ', ('%0.2f' % (utxo.getValue()*utxo.getNumConfirm()/(ONE_BTC*144.))).rjust(16) ################################################################################ # Sorting currently implemented in C++, but we implement a different kind, here def PySortCoins(unspentTxOutInfo, sortMethod=1): """ Here we define a few different ways to sort a list of unspent TxOut objects. Most of them are simple, some are more complex. In particular, the last method (4) tries to be intelligent, by grouping together inputs from the same address. The goal is not to do the heavy lifting for SelectCoins... we simply need a few different ways to sort coins so that the SelectCoins algorithms has a variety of different inputs to play with. Each sorting method is useful for some types of unspent-TxOut lists, so as long as we have one good sort, the PyEvalCoinSelect method will pick it out. As a precaution we send all the zero-confirmation UTXO's to the back of the list, so that they will only be used if absolutely necessary. """ zeroConfirm = [] if sortMethod==0: priorityFn = lambda a: a.getValue() * a.getNumConfirm() return sorted(unspentTxOutInfo, key=priorityFn, reverse=True) if sortMethod==1: priorityFn = lambda a: (a.getValue() * a.getNumConfirm())**(1/3.) return sorted(unspentTxOutInfo, key=priorityFn, reverse=True) if sortMethod==2: priorityFn = lambda a: (math.log(a.getValue()*a.getNumConfirm()+1)+4)**4 return sorted(unspentTxOutInfo, key=priorityFn, reverse=True) if sortMethod==3: priorityFn = lambda a: a.getValue() if a.getNumConfirm()>0 else 0 return sorted(unspentTxOutInfo, key=priorityFn, reverse=True) if sortMethod==4: addrMap = {} zeroConfirm = [] for utxo in unspentTxOutInfo: if utxo.getNumConfirm() == 0: zeroConfirm.append(utxo) else: scrType = getTxOutScriptType(utxo.getScript()) if scrType in CPP_TXOUT_HAS_ADDRSTR: addr = script_to_addrStr(utxo.getScript()) else: addr = script_to_scrAddr(utxo.getScript()) if not addrMap.has_key(addr): addrMap[addr] = [utxo] else: addrMap[addr].append(utxo) priorityUTXO = (lambda a: (a.getNumConfirm()*a.getValue()**0.333)) for addr,txoutList in addrMap.iteritems(): txoutList.sort(key=priorityUTXO, reverse=True) priorityGrp = lambda a: max([priorityUTXO(utxo) for utxo in a]) finalSortedList = [] for utxo in sorted(addrMap.values(), key=priorityGrp, reverse=True): finalSortedList.extend(utxo) finalSortedList.extend(zeroConfirm) return finalSortedList if sortMethod in (5, 6, 7): utxoSorted = PySortCoins(unspentTxOutInfo, 1) # Rotate the top 1,2 or 3 elements to the bottom of the list for i in range(sortMethod-4): utxoSorted.append(utxoSorted[0]) del utxoSorted[0] return utxoSorted # TODO: Add a semi-random sort method: it will favor putting high-priority # outputs at the front of the list, but will not be deterministic # This should give us some high-fitness variation compared to sorting # uniformly if sortMethod==8: utxosNoZC = filter(lambda a: a.getNumConfirm()!=0, unspentTxOutInfo) random.shuffle(utxosNoZC) utxosNoZC.extend(filter(lambda a: a.getNumConfirm()==0, unspentTxOutInfo)) return utxosNoZC if sortMethod==9: utxoSorted = PySortCoins(unspentTxOutInfo, 1) sz = len(filter(lambda a: a.getNumConfirm()!=0, utxoSorted)) # swap 1/3 of the values at random topsz = int(min(max(round(sz/3), 5), sz)) for i in range(topsz): pick1 = int(random.uniform(0,topsz)) pick2 = int(random.uniform(0,sz-topsz)) utxoSorted[pick1], utxoSorted[pick2] = utxoSorted[pick2], utxoSorted[pick1] return utxoSorted ################################################################################ # Now we try half a dozen different selection algorithms ################################################################################ ################################################################################ def PySelectCoins_SingleInput_SingleValue( \ unspentTxOutInfo, targetOutVal, minFee=0): """ This method should usually be called with a small number added to target val so that a tx can be constructed that has room for user to add some extra fee if necessary. However, we must also try calling it with the exact value, in case the user is trying to spend exactly their remaining balance. """ target = targetOutVal + minFee bestMatchVal = 2**64 bestMatchUtxo = None for utxo in unspentTxOutInfo: if target <= utxo.getValue() < bestMatchVal: bestMatchVal = utxo.getValue() bestMatchUtxo = utxo closeness = bestMatchVal - target if 0 < closeness <= CENT: # If we're going to have a change output, make sure it's above CENT # to avoid a mandatory fee try2Val = 2**64 try2Utxo = None for utxo in unspentTxOutInfo: if target+CENT < utxo.getValue() < try2Val: try2Val = utxo.getValue() try2Val = utxo if not try2Utxo==None: bestMatchUtxo = try2Utxo if bestMatchUtxo==None: return [] else: return [bestMatchUtxo] ################################################################################ def PySelectCoins_MultiInput_SingleValue( \ unspentTxOutInfo, targetOutVal, minFee=0): """ This method should usually be called with a small number added to target val so that a tx can be constructed that has room for user to add some extra fee if necessary. However, we must also try calling it with the exact value, in case the user is trying to spend exactly their remaining balance. """ target = targetOutVal + minFee outList = [] sumVal = 0 for utxo in unspentTxOutInfo: sumVal += utxo.getValue() outList.append(utxo) if sumVal>=target: break return outList ################################################################################ def PySelectCoins_SingleInput_DoubleValue( \ unspentTxOutInfo, targetOutVal, minFee=0): """ We will look for a single input that is within 30% of the target In case the tx value is tiny rel to the fee: the minTarget calc may fail to exceed the actual tx size needed, so we add an extra We restrain the search to 25%. If there is no one output in this range, then we will return nothing, and the SingleInput_SingleValue method might return a usable result """ idealTarget = 2*targetOutVal + minFee # check to make sure we're accumulating enough minTarget = long(0.75 * idealTarget) minTarget = max(minTarget, targetOutVal+minFee) maxTarget = long(1.25 * idealTarget) if sum([u.getValue() for u in unspentTxOutInfo]) < minTarget: return [] bestMatch = 2**64-1 bestUTXO = None for txout in unspentTxOutInfo: if minTarget <= txout.getValue() <= maxTarget: if abs(txout.getValue()-idealTarget) < bestMatch: bestMatch = abs(txout.getValue()-idealTarget) bestUTXO = txout if bestUTXO==None: return [] else: return [bestUTXO] ################################################################################ def PySelectCoins_MultiInput_DoubleValue( \ unspentTxOutInfo, targetOutVal, minFee=0): idealTarget = 2.0 * targetOutVal minTarget = long(0.80 * idealTarget) minTarget = max(minTarget, targetOutVal+minFee) if sum([u.getValue() for u in unspentTxOutInfo]) < minTarget: return [] outList = [] lastDiff = 2**64-1 sumVal = 0 for utxo in unspentTxOutInfo: sumVal += utxo.getValue() outList.append(utxo) currDiff = abs(sumVal - idealTarget) # should switch from decreasing to increasing when best match if sumVal>=minTarget and currDiff>lastDiff: del outList[-1] break lastDiff = currDiff return outList ################################################################################ def getSelectCoinsScores(utxoSelectList, targetOutVal, minFee): """ Define a metric for scoring the output of SelectCoints. The output of this method is a tuple of scores which identify a few different factors of a txOut selection that users might care about in a selectCoins algorithm. This method only returns an absolute score, usually between 0 and 1 for each factor. It is up to the person calling this method to decide how much "weight" they want to give each one. You could even use the scores as multiplicative factors if you wanted, though they were designed with the following equation in mind: finalScore = sum(WEIGHT[i] * SCORE[i]) TODO: I need to recalibrate some of these factors, and modify them to represent more directly what the user would be concerned about -- such as PayFeeFactor, AnonymityFactor, etc. The information is indirectly available with the current set of factors here """ # Need to calculate how much the change will be returned to sender on this tx totalIn = sum([utxo.getValue() for utxo in utxoSelectList]) totalChange = totalIn - (targetOutVal+minFee) # Abort if this is an empty list (negative score) or not enough coins if len(utxoSelectList)==0 or totalIn 0) # # On the other hand, if we have 1.832 and 10.00, and the 10.000 is the # change, we don't really care that they're not close, it's still # damned good/deceptive output anonymity (so: only execute # the following block if outAnonFactor <= 1) if 0 < outAnonFactor <= 1 and not totalChange==0: outValDiff = abs(totalChange - targetOutVal) diffPct = (outValDiff / max(totalChange, targetOutVal)) if diffPct < 0.20: outAnonFactor *= 1 elif diffPct < 0.50: outAnonFactor *= 0.7 elif diffPct < 1.0: outAnonFactor *= 0.3 else: outAnonFactor = 0 ################## # Tx size: we don't have signatures yet, but we assume that each txin is # about 180 Bytes, TxOuts are 35, and 10 other bytes in the Tx numBytes = 10 numBytes += 180 * len(utxoSelectList) numBytes += 35 * (1 if totalChange==0 else 2) txSizeFactor = 0 numKb = int(numBytes / 1000) # Will compute size factor after we see this tx priority and AllowFree # results. If the tx qualifies for free, we don't need to penalize # a 3 kB transaction vs one that is 0.5 kB ################## # Priority: If our priority is above the 1-btc-after-1-day threshold # then we might be allowed a free tx. But, if its priority # isn't much above this thresh, it might take a couple blocks # to be included dPriority = 0 anyZeroConfirm = False for utxo in utxoSelectList: if utxo.getNumConfirm() == 0: anyZeroConfirm = True else: dPriority += utxo.getValue() * utxo.getNumConfirm() dPriority = dPriority / numBytes priorityThresh = ONE_BTC * 144 / 250 if dPriority < priorityThresh: priorityFactor = 0 elif dPriority < 10.0*priorityThresh: priorityFactor = 0.7 elif dPriority < 100.0*priorityThresh: priorityFactor = 0.9 else: priorityFactor = 1.0 ################## # AllowFree: If three conditions are met, then the tx can be sent safely # without a tx fee. Granted, it may not be included in the # current block if the free space is full, but definitely in # the next one isFreeAllowed = 0 haveDustOutputs = (0= priorityThresh and \ numBytes <= 10000): isFreeAllowed = 1 ################## # Finish size-factor calculation -- if free is allowed, kB is irrelevant txSizeFactor = 0 if isFreeAllowed or numKb<1: txSizeFactor = 1 else: if numKb < 2: txSizeFactor=0.2 elif numKb<3: txSizeFactor=0.1 elif numKb<4: txSizeFactor=0 else: txSizeFactor=-1 #if this is huge, actually subtract score return (isFreeAllowed, noZeroConf, priorityFactor, numAddrFactor, txSizeFactor, outAnonFactor) ################################################################################ # We define default preferences for weightings. Weightings are used to # determine the "priorities" for ranking various SelectCoins results # By setting the weights to different orders of magnitude, you are essentially # defining a sort-order: order by FactorA, then sub-order by FactorB... ################################################################################ # TODO: ADJUST WEIGHTING! IDX_ALLOWFREE = 0 IDX_NOZEROCONF = 1 IDX_PRIORITY = 2 IDX_NUMADDR = 3 IDX_TXSIZE = 4 IDX_OUTANONYM = 5 WEIGHTS = [None]*6 WEIGHTS[IDX_ALLOWFREE] = 100000 WEIGHTS[IDX_NOZEROCONF] = 1000000 # let's avoid zero-conf if possible WEIGHTS[IDX_PRIORITY] = 50 WEIGHTS[IDX_NUMADDR] = 100000 WEIGHTS[IDX_TXSIZE] = 100 WEIGHTS[IDX_OUTANONYM] = 30 ################################################################################ def PyEvalCoinSelect(utxoSelectList, targetOutVal, minFee, weights=WEIGHTS): """ Use a specified set of weightings and sub-scores for a unspentTxOut list, to assign an absolute "fitness" of this particular selection. The goal of getSelectCoinsScores() is to produce weighting-agnostic subscores -- then this method applies the weightings to these scores to get a final answer. If list A has a higher score than list B, then it's a better selection for that transaction. If you the two scores don't look right to you, then you probably just need to adjust the weightings to your liking. These weightings may become user-configurable in the future -- likely as an option of coin-selection profiles -- such as "max anonymity", "min fee", "balanced", etc). """ scores = getSelectCoinsScores(utxoSelectList, targetOutVal, minFee) if scores==-1: return -1 # Combine all the scores theScore = 0 theScore += weights[IDX_NOZEROCONF] * scores[IDX_NOZEROCONF] theScore += weights[IDX_PRIORITY] * scores[IDX_PRIORITY] theScore += weights[IDX_NUMADDR] * scores[IDX_NUMADDR] theScore += weights[IDX_TXSIZE] * scores[IDX_TXSIZE] theScore += weights[IDX_OUTANONYM] * scores[IDX_OUTANONYM] # If we're already paying a fee, why bother including this weight? if minFee < 0.0005: theScore += weights[IDX_ALLOWFREE] * scores[IDX_ALLOWFREE] return theScore ################################################################################ # https://bitcointalk.org/index.php?topic=92496.msg1126310#msg1126310 contains a # description (possibly out-of-date?) of how this function works. @TimeThisFunction def PySelectCoins(unspentTxOutInfo, targetOutVal, minFee=0, numRand=10, margin=CENT): """ Intense algorithm for coin selection: computes about 30 different ways to select coins based on the desired target output and the min tx fee. Then ranks the various solutions and picks the best one """ if sum([u.getValue() for u in unspentTxOutInfo]) < targetOutVal: return [] targExact = targetOutVal targMargin = targetOutVal+margin selectLists = [] # Start with the intelligent solutions with different sortings for sortMethod in range(8): diffSortList = PySortCoins(unspentTxOutInfo, sortMethod) selectLists.append(PySelectCoins_SingleInput_SingleValue( diffSortList, targExact, minFee )) selectLists.append(PySelectCoins_MultiInput_SingleValue( diffSortList, targExact, minFee )) selectLists.append(PySelectCoins_SingleInput_SingleValue( diffSortList, targMargin, minFee )) selectLists.append(PySelectCoins_MultiInput_SingleValue( diffSortList, targMargin, minFee )) selectLists.append(PySelectCoins_SingleInput_DoubleValue( diffSortList, targExact, minFee )) selectLists.append(PySelectCoins_MultiInput_DoubleValue( diffSortList, targExact, minFee )) selectLists.append(PySelectCoins_SingleInput_DoubleValue( diffSortList, targMargin, minFee )) selectLists.append(PySelectCoins_MultiInput_DoubleValue( diffSortList, targMargin, minFee )) # Throw in a couple random solutions, maybe we get lucky # But first, make a copy before in-place shuffling # NOTE: using list[:] like below, really causes a swig::vector to freak out! #utxos = unspentTxOutInfo[:] #utxos = list(unspentTxOutInfo) for method in range(8,10): for i in range(numRand): utxos = PySortCoins(unspentTxOutInfo, method) selectLists.append(PySelectCoins_MultiInput_SingleValue(utxos, targExact, minFee)) selectLists.append(PySelectCoins_MultiInput_DoubleValue(utxos, targExact, minFee)) selectLists.append(PySelectCoins_MultiInput_SingleValue(utxos, targMargin, minFee)) selectLists.append(PySelectCoins_MultiInput_DoubleValue(utxos, targMargin, minFee)) # Now we define PyEvalCoinSelect as our sorting metric, and find the best solution scoreFunc = lambda ulist: PyEvalCoinSelect(ulist, targetOutVal, minFee) finalSelection = max(selectLists, key=scoreFunc) SCORES = getSelectCoinsScores(finalSelection, targetOutVal, minFee) if len(finalSelection)==0: return [] # If we selected a list that has only one or two inputs, and we have # other, tiny, unspent outputs from the same addresses, we should # throw one or two of them in to help clear them out. However, we # only do so if a plethora of conditions exist: # # First, we only consider doing this if the tx has <5 inputs already. # Also, we skip this process if the current tx doesn't have excessive # priority already -- we don't want to risk de-prioritizing a tx for # this purpose. # # Next we sort by LOWEST value, because we really benefit from this most # by clearing out tiny outputs. Along those lines, we don't even do # unless it has low priority -- don't want to take a high-priority utxo # and convert it to one that will be low-priority to start. # # Finally, we shouldn't do this if a high score was assigned to output # anonymity: this extra output may cause a tx with good output anonymity # to no longer possess this property IDEAL_NUM_INPUTS = 5 if len(finalSelection) < IDEAL_NUM_INPUTS and \ SCORES[IDX_OUTANONYM] == 0: utxoToScrAddr = lambda a: a.getRecipientScrAddr() getPriority = lambda a: a.getValue() * a.getNumConfirm() getUtxoID = lambda a: a.getTxHash() + int_to_binary(a.getTxOutIndex()) alreadyUsedAddr = set( [utxoToScrAddr(utxo) for utxo in finalSelection] ) utxoSmallToLarge = sorted(unspentTxOutInfo, key=getPriority) utxoSmToLgIDs = [getUtxoID(utxo) for utxo in utxoSmallToLarge] finalSelectIDs = [getUtxoID(utxo) for utxo in finalSelection] for other in utxoSmallToLarge: # Skip it if it is already selected if getUtxoID(other) in finalSelectIDs: continue # We only consider UTXOs that won't link any new addresses together if not utxoToScrAddr(other) in alreadyUsedAddr: continue # Avoid zero-conf inputs altogether if other.getNumConfirm() == 0: continue # Don't consider any inputs that are high priority already if getPriority(other) > ONE_BTC*144: continue finalSelection.append(other) if len(finalSelection)>=IDEAL_NUM_INPUTS: break return finalSelection ################################################################################ def calcMinSuggestedFeesHackMS(selectCoinsResult, targetOutVal, preSelectedFee, numRecipients): """ This is a hack, because the calcMinSuggestedFees below assumes standard P2PKH inputs and outputs, not allowing us a way to modify it if we ne know that the inputs will be much larger, or the outputs. we just copy the original method with an update to the computation """ paid = targetOutVal + preSelectedFee change = sum([u.getValue() for u in selectCoinsResult]) - paid numBytes = 0 msInfo = [getMultisigScriptInfo(utxo.getScript()) for utxo in selectCoinsResult] for m,n,As,Ps in msInfo: numBytes += m*70 + 40 numBytes += 200*numRecipients # assume large lockbox outputs numKb = int(numBytes / 1000) if numKb>10: return [(1+numKb)*MIN_RELAY_TX_FEE, (1+numKb)*MIN_TX_FEE] # Compute raw priority of tx prioritySum = 0 for utxo in selectCoinsResult: prioritySum += utxo.getValue() * utxo.getNumConfirm() prioritySum = prioritySum / numBytes # Any tiny/dust outputs? haveDustOutputs = (0= ONE_BTC * 144 / 250. and \ numBytes < 10000): return [0,0] # This cannot be a free transaction. minFeeMultiplier = (1 + numKb) # At the moment this condition never triggers if minFeeMultiplier<1.0 and haveDustOutputs: minFeeMultiplier = 1.0 return [minFeeMultiplier * MIN_RELAY_TX_FEE, \ minFeeMultiplier * MIN_TX_FEE] ################################################################################ def calcMinSuggestedFees(selectCoinsResult, targetOutVal, preSelectedFee, numRecipients): """ Returns two fee options: one for relay, one for include-in-block. In general, relay fees are required to get your block propagated (since most nodes are Satoshi clients), but there's no guarantee it will be included in a block -- though I'm sure there's plenty of miners out there will include your tx for sub-standard fee. However, it's virtually guaranteed that a miner will accept a fee equal to the second return value from this method. We have to supply the fee that was used in the selection algorithm, so that we can figure out how much change there will be. Without this information, we might accidentally declare a tx to be freeAllow when it actually is not. """ # TODO: this should be updated to accommodate the non-constant # TxOut/TxIn size given that it now accepts P2SH and Multisig if len(selectCoinsResult)==0: return [-1,-1] paid = targetOutVal + preSelectedFee change = sum([u.getValue() for u in selectCoinsResult]) - paid # Calc approx tx size numBytes = 10 numBytes += 180 * len(selectCoinsResult) numBytes += 35 * (numRecipients + (1 if change>0 else 0)) numKb = int(numBytes / 1000) if numKb>10: return [(1+numKb)*MIN_RELAY_TX_FEE, (1+numKb)*MIN_TX_FEE] # Compute raw priority of tx prioritySum = 0 for utxo in selectCoinsResult: prioritySum += utxo.getValue() * utxo.getNumConfirm() prioritySum = prioritySum / numBytes # Any tiny/dust outputs? haveDustOutputs = (0= ONE_BTC * 144 / 250. and \ numBytes < 10000): return [0,0] # This cannot be a free transaction. minFeeMultiplier = (1 + numKb) # At the moment this condition never triggers if minFeeMultiplier<1.0 and haveDustOutputs: minFeeMultiplier = 1.0 return [minFeeMultiplier * MIN_RELAY_TX_FEE, \ minFeeMultiplier * MIN_TX_FEE] ################################################################################ def approxTxInSizeForTxOut(utxoScript, lboxList=None): """ Since this is always used for fee estimation, we overestimate the size to be conservative. However, if this is P2SH, we won't have a clue what the hashed script is, so unless we find it in our lockbox map, we assume the max-max which is 1,650 bytes. Otherwise the TxIn is always: PrevTxHash(32), PrevTxOutIndex(4), Script(_), Sequence(4) """ scrType = getTxOutScriptType(utxoScript) if scrType == CPP_TXOUT_STDHASH160: return 180 elif scrType in [CPP_TXOUT_STDPUBKEY33, CPP_TXOUT_STDPUBKEY65]: return 110 elif scrType == CPP_TXOUT_MULTISIG: M,N,a160s,pubs = getMultisigScriptInfo(utxoScript) return M*70 + 40 elif scrType == CPP_TXOUT_P2SH and not lboxList is None: scrAddr = script_to_scrAddr(utxoScript) for lbox in lboxList: if scrAddr == lbox.p2shScrAddr: M,N,a160s,pubs = getMultisigScriptInfo(lbox.binScript) return M*70 + 40 # If we got here, we didn't identify it at all. Assume max for TxIn return 1650 ################################################################################ # I needed a new function that was going to be as accurate as possible for # arbitrary coin selections (and recipient lists). However, this doesn't # work in all places tat the old coin selection algo was used, so I am # leaving those calls alone and simply defining this for new methods that # have access to full UTXOs scripts and scriptValPairs. def calcMinSuggestedFeesNew(selectCoinsResult, scriptValPairs, preSelectedFee, changeScript=None): """ Returns two fee options: one for relay, one for include-in-block. In general, relay fees are required to get your block propagated (since most nodes are Satoshi clients), but there's no guarantee it will be included in a block -- though I'm sure there's plenty of miners out there will include your tx for sub-standard fee. However, it's virtually guaranteed that a miner will accept a fee equal to the second return value from this method. We have to supply the fee that was used in the selection algorithm, so that we can figure out how much change there will be. Without this information, we might accidentally declare a tx to be freeAllow when it actually is not. """ # TODO: this should be updated to accommodate the non-constant # TxOut/TxIn size given that it now accepts P2SH and Multisig targetOutVal = long( sum([rv[1] for rv in scriptValPairs]) ) if len(selectCoinsResult)==0: return [-1,-1] paid = targetOutVal + preSelectedFee change = sum([u.getValue() for u in selectCoinsResult]) - paid # Calc approx tx size numBytes = 10 numBytes += sum([len(sv[0])+9 for sv in scriptValPairs]) if change>0: # If no changeScript is provided, we assume P2PKH or P2SH: approx 35 bytes numBytes += len(changeScript) if changeScript else 35 numKb = int(numBytes / 1000) if numKb>10: return [(1+numKb)*MIN_RELAY_TX_FEE, (1+numKb)*MIN_TX_FEE] # Compute raw priority of tx prioritySum = 0 for utxo in selectCoinsResult: prioritySum += utxo.getValue() * utxo.getNumConfirm() prioritySum = prioritySum / numBytes # Any tiny/dust outputs? haveDustOutputs = (0= ONE_BTC * 144 / 250. and \ numBytes < 10000): return [0,0] # This cannot be a free transaction. minFeeMultiplier = (1 + numKb) # At the moment this condition never triggers if minFeeMultiplier<1.0 and haveDustOutputs: minFeeMultiplier = 1.0 return [minFeeMultiplier * MIN_RELAY_TX_FEE, \ minFeeMultiplier * MIN_TX_FEE] armory-0.92.3/armoryengine/PyBtcAddress.py0000644000000000000000000016612512414772654017243 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ from CppBlockUtils import SecureBinaryData, CryptoAES, CryptoECDSA from armoryengine.ArmoryUtils import ADDRBYTE, hash256, binary_to_base58, \ KeyDataError, RightNow, LOGERROR, ChecksumError, convertKeyDataToAddress, \ verifyChecksum, WalletLockError, createDERSigFromRS, binary_to_int, \ computeChecksum, getVersionInt, PYBTCWALLET_VERSION, bitset_to_int, \ LOGDEBUG, Hash160ToScrAddr, int_to_bitset, UnserializeError, \ hash160_to_addrStr, int_to_binary, BIGENDIAN, \ BadAddressError, checkAddrStrValid, binary_to_hex from armoryengine.BinaryPacker import BinaryPacker, UINT8, UINT16, UINT32, UINT64, \ INT8, INT16, INT32, INT64, VAR_INT, VAR_STR, FLOAT, BINARY_CHUNK from armoryengine.BinaryUnpacker import BinaryUnpacker from armoryengine.Timer import TimeThisFunction import CppBlockUtils as Cpp ############################################################################# def calcWalletIDFromRoot(root, chain): """ Helper method for computing a wallet ID """ root = PyBtcAddress().createFromPlainKeyData(SecureBinaryData(root)) root.chaincode = SecureBinaryData(chain) first = root.extendAddressChain() return binary_to_base58((ADDRBYTE + first.getAddr160()[:5])[::-1]) class PyBtcAddress(object): """ PyBtcAddress -- This class encapsulated EVERY kind of address object: -- Plaintext private-key-bearing addresses -- Encrypted private key addresses, with AES locking and unlocking -- Watching-only public-key addresses -- Address-only storage, representing someone else's key -- Deterministic address generation from previous addresses -- Serialization and unserialization of key data under all conditions -- Checksums on all serialized fields to protect against HDD byte errors For deterministic wallets, new addresses will be created from a chaincode and the previous address. What is implemented here is a special kind of deterministic calculation that actually allows the user to securely generate new addresses even if they don't have the private key. This method uses Diffie-Hellman shared-secret calculations to produce the new keys, and has the same level of security as all other ECDSA operations. There's a lot of fantastic benefits to doing this: (1) If all addresses in wallet are chained, then you only need to backup your wallet ONCE -- when you first create it. Print it out, put it in a safety-deposit box, or tattoo the generator key to the inside of your eyelid: it will never change. (2) You can keep your private keys on an offline machine, and keep a watching-only wallet online. You will be able to generate new keys/addresses, and verify incoming transactions, without ever requiring your private key to touch the internet. (3) If your friend has the chaincode and your first public key, they too can generate new addresses for you -- allowing them to send you money multiple times, with different addresses, without ever needing to specifically request the addresses. (the downside to this is if the chaincode is compromised, all chained addresses become de-anonymized -- but is only a loss of privacy, not security) However, we do require some fairly complicated logic, due to the fact that a user with a full, private-key-bearing wallet, may try to generate a new key/address without supplying a passphrase. If this happens, the wallet logic gets very complicated -- we don't want to reject the request to generate a new address, but we can't compute the private key until the next time the user unlocks their wallet. Thus, we have to save off the data they will need to create the key, to be applied on next unlock. """ ############################################################################# def __init__(self): """ We use SecureBinaryData objects to store pub, priv and IV objects, because that is what is required by the C++ code. See EncryptionUtils.h to see that available methods. """ self.addrStr20 = '' self.binPublicKey65 = SecureBinaryData() # 0x04 X(BE) Y(BE) self.binPrivKey32_Encr = SecureBinaryData() # BIG-ENDIAN self.binPrivKey32_Plain = SecureBinaryData() self.binInitVect16 = SecureBinaryData() self.isLocked = False self.useEncryption = False self.isInitialized = False self.keyChanged = False # ...since last key encryption self.walletByteLoc = -1 self.chaincode = SecureBinaryData() self.chainIndex = 0 # Information to be used by C++ to know where to search for transactions # in the blockchain (disabled in favor of a better search method) self.timeRange = [2**32-1, 0] self.blkRange = [2**32-1, 0] # This feels like a hack, but it's the only way I can think to handle # the case of generating new, chained addresses, even without the # private key currently in memory. i.e. - If we can't unlock the priv # key when creating a new chained priv key, we will simply extend the # public key, and store the last-known chain info, so that it can be # generated the next time the address is unlocked self.createPrivKeyNextUnlock = False self.createPrivKeyNextUnlock_IVandKey = [None, None] # (IV,Key) self.createPrivKeyNextUnlock_ChainDepth = -1 ############################################################################# def isInitialized(self): """ Keep track of whether this address has been initialized """ return self.isInitialized ############################################################################# def hasPrivKey(self): """ We have a private key if either the plaintext, or ciphertext private-key fields are non-empty. We also consider ourselves to "have" the private key if this address was chained from a key that has the private key, even if we haven't computed it yet (due to not having unlocked the private key before creating the new address). """ return (self.binPrivKey32_Encr.getSize() != 0 or \ self.binPrivKey32_Plain.getSize() != 0 or \ self.createPrivKeyNextUnlock) ############################################################################# def hasPubKey(self): return (self.binPublicKey65.getSize() != 0) ############################################################################## def getPubKey(self): '''Return the uncompressed public key of the address.''' if self.binPublicKey65.getSize() != 65: raise KeyDataError, 'PyBtcAddress does not have a public key!' return self.binPublicKey65 ############################################################################# def hasChainCode(self): '''Return a boolean indicating if the address has a chain code.''' return (self.chaincode.getSize() != 0) ############################################################################# def getChainCode(self): '''Return the chain code of the address.''' if len(self.chaincode) != 32: raise KeyDataError, 'PyBtcAddress does not have a chain code!' return self.chaincode ############################################################################# def getAddrStr(self, netbyte=ADDRBYTE): chksum = hash256(netbyte + self.addrStr20)[:4] return binary_to_base58(netbyte + self.addrStr20 + chksum) ############################################################################# def getAddr160(self): if len(self.addrStr20)!=20: raise KeyDataError, 'PyBtcAddress does not have an address string!' return self.addrStr20 ############################################################################# def isCompressed(self): # Armory wallets (v1.35) do not support compressed keys return False ############################################################################# def touch(self, unixTime=None, blkNum=None): """ Just like "touching" a file, this makes sure that the firstSeen and lastSeen fields for this address are updated to include "now" If we include only a block number, we will fill in the timestamp with the unix-time for that block (if the BlockDataManager is availabled) """ if self.blkRange[0]==0: self.blkRange[0]=2**32-1 if self.timeRange[0]==0: self.timeRange[0]=2**32-1 if blkNum==None: if TheBDM.getBDMState()=='BlockchainReady': topBlk = TheBDM.getTopBlockHeight() self.blkRange[0] = long(min(self.blkRange[0], topBlk)) self.blkRange[1] = long(max(self.blkRange[1], topBlk)) else: self.blkRange[0] = long(min(self.blkRange[0], blkNum)) self.blkRange[1] = long(max(self.blkRange[1], blkNum)) if unixTime==None and TheBDM.getBDMState()=='BlockchainReady': unixTime = TheBDM.getHeaderByHeight(blkNum).getTimestamp() if unixTime==None: unixTime = RightNow() self.timeRange[0] = long(min(self.timeRange[0], unixTime)) self.timeRange[1] = long(max(self.timeRange[1], unixTime)) ############################################################################# def copy(self): newAddr = PyBtcAddress().unserialize(self.serialize()) newAddr.binPrivKey32_Plain = self.binPrivKey32_Plain.copy() newAddr.binPrivKey32_Encr = self.binPrivKey32_Encr.copy() newAddr.binPublicKey65 = self.binPublicKey65.copy() newAddr.binInitVect16 = self.binInitVect16.copy() newAddr.isLocked = self.isLocked newAddr.useEncryption = self.useEncryption newAddr.isInitialized = self.isInitialized newAddr.keyChanged = self.keyChanged newAddr.walletByteLoc = self.walletByteLoc newAddr.chaincode = self.chaincode newAddr.chainIndex = self.chainIndex return newAddr ############################################################################# def getTimeRange(self): return self.timeRange ############################################################################# def getBlockRange(self): return self.blkRange ############################################################################# def serializePublicKey(self): """Converts the SecureBinaryData public key to a 65-byte python string""" return self.binPublicKey65.toBinStr() ############################################################################# def serializeEncryptedPrivateKey(self): """Converts SecureBinaryData encrypted private key to python string""" return self.binPrivKey32_Encr.toBinStr() ############################################################################# # NOTE: This method should rarely be used, unless we are only printing it # to the screen. Actually, it will be used for unencrypted wallets def serializePlainPrivateKey(self): return self.binPrivKey32_Plain.toBinStr() def serializeInitVector(self): return self.binInitVect16.toBinStr() ############################################################################# def verifyEncryptionKey(self, secureKdfOutput): """ Determine if this data is the decryption key for this encrypted address """ if not self.useEncryption or not self.hasPrivKey(): return False if self.useEncryption and not secureKdfOutput: LOGERROR('No encryption key supplied to verifyEncryption!') return False decryptedKey = CryptoAES().DecryptCFB( self.binPrivKey32_Encr, \ SecureBinaryData(secureKdfOutput), \ self.binInitVect16) verified = False if not self.isLocked: if decryptedKey==self.binPrivKey32_Plain: verified = True else: computedPubKey = CryptoECDSA().ComputePublicKey(decryptedKey) if self.hasPubKey(): verified = (self.binPublicKey65==computedPubKey) else: verified = (computedPubKey.getHash160()==self.addrStr20) if verified: self.binPublicKey65 = computedPubKey decryptedKey.destroy() return verified ############################################################################# def setInitializationVector(self, IV16=None, random=False, force=False): """ Either set the IV through input arg, or explicitly call random=True Returns the IV -- which is especially important if it is randomly gen This method is mainly for PREVENTING you from changing an existing IV without meaning to. Losing the IV for encrypted data is almost as bad as losing the encryption key. Caller must use force=True in order to override this warning -- otherwise this method will abort. """ if self.binInitVect16.getSize()==16: if self.isLocked: LOGERROR('Address already locked with different IV.') LOGERROR('Changing IV may cause loss of keydata.') else: LOGERROR('Address already contains an initialization') LOGERROR('vector. If you change IV without updating') LOGERROR('the encrypted storage, you may permanently') LOGERROR('lose the encrypted data') if not force: LOGERROR('If you really want to do this, re-execute this call with force=True') return '' if IV16: self.binInitVect16 = SecureBinaryData(IV16) elif random==True: self.binInitVect16 = SecureBinaryData().GenerateRandom(16) else: raise KeyDataError, 'setInitVector: set IV data, or random=True' return self.binInitVect16 ############################################################################# def enableKeyEncryption(self, IV16=None, generateIVIfNecessary=False): """ setIV method will raise error is we don't specify any args, but it is acceptable HERE to not specify any args just to enable encryption """ self.useEncryption = True if IV16: self.setInitializationVector(IV16) elif generateIVIfNecessary and self.binInitVect16.getSize()<16: self.setInitializationVector(random=True) ############################################################################# def isKeyEncryptionEnabled(self): return self.useEncryption ############################################################################# def createFromEncryptedKeyData(self, addr20, encrPrivKey32, IV16, \ chkSum=None, pubKey=None): # We expect both private key and IV to the right size assert(encrPrivKey32.getSize()==32) assert(IV16.getSize()==16) self.__init__() self.addrStr20 = addr20 self.binPrivKey32_Encr = SecureBinaryData(encrPrivKey32) self.setInitializationVector(IV16) self.isLocked = True self.useEncryption = True self.isInitialized = True if chkSum and not self.binPrivKey32_Encr.getHash256().startswith(chkSum): raise ChecksumError, "Checksum doesn't match encrypted priv key data!" if pubKey: self.binPublicKey65 = SecureBinaryData(pubKey) if not self.binPublicKey65.getHash160()==self.addrStr20: raise KeyDataError, "Public key does not match supplied address" return self ############################################################################# def createFromPlainKeyData(self, plainPrivKey, addr160=None, willBeEncr=False, \ generateIVIfNecessary=False, IV16=None, \ chksum=None, publicKey65=None, \ skipCheck=False, skipPubCompute=False): assert(plainPrivKey.getSize()==32) if not addr160: addr160 = convertKeyDataToAddress(privKey=plainPrivKey) self.__init__() self.addrStr20 = addr160 self.isInitialized = True self.binPrivKey32_Plain = SecureBinaryData(plainPrivKey) self.isLocked = False if willBeEncr: self.enableKeyEncryption(IV16, generateIVIfNecessary) elif IV16: self.binInitVect16 = IV16 if chksum and not verifyChecksum(self.binPrivKey32_Plain.toBinStr(), chksum): raise ChecksumError, "Checksum doesn't match plaintext priv key!" if publicKey65: self.binPublicKey65 = SecureBinaryData(publicKey65) if not self.binPublicKey65.getHash160()==self.addrStr20: raise KeyDataError, "Public key does not match supplied address" if not skipCheck: if not CryptoECDSA().CheckPubPrivKeyMatch(self.binPrivKey32_Plain,\ self.binPublicKey65): raise KeyDataError, 'Supplied pub and priv key do not match!' elif not skipPubCompute: # No public key supplied, but we do want to calculate it self.binPublicKey65 = CryptoECDSA().ComputePublicKey(plainPrivKey) return self ############################################################################# def createFromPublicKeyData(self, publicKey65, chksum=None): assert(publicKey65.getSize()==65) self.__init__() self.addrStr20 = publicKey65.getHash160() self.binPublicKey65 = publicKey65 self.isInitialized = True self.isLocked = False self.useEncryption = False if chksum and not verifyChecksum(self.binPublicKey65.toBinStr(), chksum): raise ChecksumError, "Checksum doesn't match supplied public key!" return self ############################################################################# def safeExtendPrivateKey(self, privKey, chn, pubKey=None): # We do this computation twice, in case one is somehow corrupted # (Must be ultra paranoid with computing keys) logMult1 = SecureBinaryData() logMult2 = SecureBinaryData() a160hex = '' # Can provide a pre-computed public key to skip that part of the compute if pubKey is None: pubKey = SecureBinaryData(0) else: a160hex = binary_to_hex(pubKey.getHash160()) newPriv1 = CryptoECDSA().ComputeChainedPrivateKey(privKey, chn, pubKey, logMult1) newPriv2 = CryptoECDSA().ComputeChainedPrivateKey(privKey, chn, pubKey, logMult2) if newPriv1==newPriv2: newPriv2.destroy() with open(MULT_LOG_FILE,'a') as f: f.write('PrvChain (pkh, mult): %s,%s\n' % (a160hex,logMult1.toHexStr())) return newPriv1 else: LOGCRIT('Chaining failed! Computed keys are different!') LOGCRIT('Recomputing chained key 3 times; bail if they do not match') newPriv1.destroy() newPriv2.destroy() logMult3 = SecureBinaryData() newPriv1 = CryptoECDSA().ComputeChainedPrivateKey(privKey, chn, pubKey, logMult1) newPriv2 = CryptoECDSA().ComputeChainedPrivateKey(privKey, chn, pubKey, logMult2) newPriv3 = CryptoECDSA().ComputeChainedPrivateKey(privKey, chn, pubKey, logMult3) LOGCRIT(' Multiplier1: ' + logMult1.toHexStr()) LOGCRIT(' Multiplier2: ' + logMult2.toHexStr()) LOGCRIT(' Multiplier3: ' + logMult3.toHexStr()) if newPriv1==newPriv2 and newPriv1==newPriv3: newPriv2.destroy() newPriv3.destroy() with open(MULT_LOG_FILE,'a') as f: f.write('PrvChain (pkh, mult): %s,%s\n' % (a160hex,logMult1.toHexStr())) return newPriv1 else: LOGCRIT('Chaining failed again! Returning empty private key.') newPriv1.destroy() newPriv2.destroy() newPriv3.destroy() # This should crash just about any process that would try to use it # without checking for empty private key. return SecureBinaryData(0) ############################################################################# def safeExtendPublicKey(self, pubKey, chn): # We do this computation twice, in case one is somehow corrupted # (Must be ultra paranoid with computing keys) a160hex = binary_to_hex(pubKey.getHash160()) logMult1 = SecureBinaryData() logMult2 = SecureBinaryData() newPub1 = CryptoECDSA().ComputeChainedPublicKey(pubKey, chn, logMult1) newPub2 = CryptoECDSA().ComputeChainedPublicKey(pubKey, chn, logMult2) if newPub1==newPub2: newPub2.destroy() with open(MULT_LOG_FILE,'a') as f: f.write('PubChain (pkh, mult): %s,%s\n' % (a160hex, logMult1.toHexStr())) return newPub1 else: LOGCRIT('Chaining failed! Computed keys are different!') LOGCRIT('Recomputing chained key 3 times; bail if they do not match') newPub1.destroy() newPub2.destroy() logMult3 = SecureBinaryData() newPub1 = CryptoECDSA().ComputeChainedPublicKey(pubKey, chn, logMult1) newPub2 = CryptoECDSA().ComputeChainedPublicKey(pubKey, chn, logMult2) newPub3 = CryptoECDSA().ComputeChainedPublicKey(pubKey, chn, logMult3) LOGCRIT(' Multiplier1: ' + logMult1.toHexStr()) LOGCRIT(' Multiplier2: ' + logMult2.toHexStr()) LOGCRIT(' Multiplier3: ' + logMult3.toHexStr()) if newPub1==newPub2 and newPub1==newPub3: newPub2.destroy() newPub3.destroy() with open(MULT_LOG_FILE,'a') as f: f.write('PubChain (pkh, mult): %s,%s\n' % (a160hex, logMult1.toHexStr())) return newPub1 else: LOGCRIT('Chaining failed again! Returning empty public key.') newPub1.destroy() newPub2.destroy() newPub3.destroy() # This should crash just about any process that would try to use it # without checking for empty public key. return SecureBinaryData(0) ############################################################################# def lock(self, secureKdfOutput=None, generateIVIfNecessary=False): # We don't want to destroy the private key if it's not supposed to be # encrypted. Similarly, if we haven't actually saved the encrypted # version, let's not lock it newIV = False if not self.useEncryption or not self.hasPrivKey(): # This isn't supposed to be encrypted, or there's no privkey to encrypt return else: if self.binPrivKey32_Encr.getSize()==32 and not self.keyChanged: # Addr should be encrypted, and we already have encrypted priv key self.binPrivKey32_Plain.destroy() self.isLocked = True elif self.binPrivKey32_Plain.getSize()==32: # Addr should be encrypted, but haven't computed encrypted value yet if secureKdfOutput!=None: # We have an encryption key, use it if self.binInitVect16.getSize() < 16: if not generateIVIfNecessary: raise KeyDataError, 'No Initialization Vector available' else: self.binInitVect16 = SecureBinaryData().GenerateRandom(16) newIV = True # Finally execute the encryption self.binPrivKey32_Encr = CryptoAES().EncryptCFB( \ self.binPrivKey32_Plain, \ SecureBinaryData(secureKdfOutput), \ self.binInitVect16) # Destroy the unencrypted key, reset the keyChanged flag self.binPrivKey32_Plain.destroy() self.isLocked = True self.keyChanged = False else: # Can't encrypt the addr because we don't have encryption key raise WalletLockError, ("\n\tTrying to destroy plaintext key, but no" "\n\tencrypted key data is available, and no" "\n\tencryption key provided to encrypt it.") # In case we changed the IV, we should let the caller know this return self.binInitVect16 if newIV else SecureBinaryData() ############################################################################# def unlock(self, secureKdfOutput, skipCheck=False): """ This method knows nothing about a key-derivation function. It simply takes in an AES key and applies it to decrypt the data. However, it's best if that AES key is actually derived from "heavy" key-derivation function. """ if not self.useEncryption or not self.isLocked: # Bail out if the wallet is unencrypted, or already unlocked self.isLocked = False return if self.createPrivKeyNextUnlock: # This is SPECIFICALLY for the case that we didn't have the encr key # available when we tried to extend our deterministic wallet, and # generated a new address anyway self.binPrivKey32_Plain = CryptoAES().DecryptCFB( \ self.createPrivKeyNextUnlock_IVandKey[1], \ SecureBinaryData(secureKdfOutput), \ self.createPrivKeyNextUnlock_IVandKey[0]) for i in range(self.createPrivKeyNextUnlock_ChainDepth): #self.binPrivKey32_Plain = CryptoECDSA().ComputeChainedPrivateKey( \ #self.binPrivKey32_Plain, \ #self.chaincode) self.binPrivKey32_Plain = self.safeExtendPrivateKey( \ self.binPrivKey32_Plain, \ self.chaincode) # IV should have already been randomly generated, before self.isLocked = False self.createPrivKeyNextUnlock = False self.createPrivKeyNextUnlock_IVandKey = [] self.createPrivKeyNextUnlock_ChainDepth = 0 # Lock/Unlock to make sure encrypted private key is filled self.lock(secureKdfOutput,generateIVIfNecessary=True) self.unlock(secureKdfOutput) else: if not self.binPrivKey32_Encr.getSize()==32: raise WalletLockError, 'No encrypted private key to decrypt!' if not self.binInitVect16.getSize()==16: raise WalletLockError, 'Initialization Vect (IV) is missing!' self.binPrivKey32_Plain = CryptoAES().DecryptCFB( \ self.binPrivKey32_Encr, \ secureKdfOutput, \ self.binInitVect16) self.isLocked = False if not skipCheck: if not self.hasPubKey(): self.binPublicKey65 = CryptoECDSA().ComputePublicKey(\ self.binPrivKey32_Plain) else: # We should usually check that keys match, but may choose to skip # if we have a lot of keys to load # NOTE: I run into this error if I fill the keypool without first # unlocking the wallet. I'm not sure why it doesn't work # when locked (it should), but this wallet format has been # working flawless for almost a year... and will be replaced # soon, so I won't sweat it. if not CryptoECDSA().CheckPubPrivKeyMatch(self.binPrivKey32_Plain, \ self.binPublicKey65): raise KeyDataError, "Stored public key does not match priv key!" ############################################################################# def changeEncryptionKey(self, secureOldKey, secureNewKey): """ We will use None to specify "no encryption", either for old or new. Of course we throw an error is old key is "None" but the address is actually encrypted. """ if not self.hasPrivKey(): raise KeyDataError, 'No private key available to re-encrypt' if not secureOldKey and self.useEncryption and self.isLocked: raise WalletLockError, 'Need old encryption key to unlock private keys' wasLocked = self.isLocked # Decrypt the original key if self.isLocked: self.unlock(secureOldKey, skipCheck=False) # Keep the old IV if we are changing the key. IV reuse is perfectly # fine for a new key, and might save us from disaster if we otherwise # generated a new one and then forgot to take note of it. self.keyChanged = True if not secureNewKey: # If we chose not to re-encrypt, make sure we clear the encryption self.binInitVect16 = SecureBinaryData() self.binPrivKey32_Encr = SecureBinaryData() self.isLocked = False self.useEncryption = False else: # Re-encrypt with new key (using same IV) self.useEncryption = True self.lock(secureNewKey) # do this to make sure privKey_Encr filled if wasLocked: self.isLocked = True else: self.unlock(secureNewKey) self.isLocked = False ############################################################################# # This is more of a static method def checkPubPrivKeyMatch(self, securePriv, securePub): CryptoECDSA().CheckPubPrivKeyMatch(securePriv, securePub) ############################################################################# @TimeThisFunction def generateDERSignature(self, binMsg, secureKdfOutput=None): """ This generates a DER signature for this address using the private key. Obviously, if we don't have the private key, we throw an error. Or if the wallet is locked and no encryption key was provided. If an encryption key IS provided, then we unlock the address just long enough to sign the message and then re-lock it """ if not self.hasPrivKey(): raise KeyDataError, 'Cannot sign for address without private key!' if self.isLocked: if secureKdfOutput==None: raise WalletLockError, "Cannot sign Tx when private key is locked!" else: # Wallet is locked but we have a decryption key self.unlock(secureKdfOutput, skipCheck=False) try: secureMsg = SecureBinaryData(binMsg) sig = CryptoECDSA().SignData(secureMsg, self.binPrivKey32_Plain) sigstr = sig.toBinStr() rBin = sigstr[:32 ] sBin = sigstr[ 32:] return createDERSigFromRS(rBin, sBin) except: LOGERROR('Failed signature generation') finally: # Always re-lock/cleanup after unlocking, even after an exception. # If locking triggers an error too, we will just skip it. try: if secureKdfOutput!=None: self.lock(secureKdfOutput) except: LOGERROR('Error re-locking address') pass ############################################################################# @TimeThisFunction def verifyDERSignature(self, binMsgVerify, derSig): if not self.hasPubKey(): raise KeyDataError, 'No public key available for this address!' rBin, sBin = getRSFromDERSig(derSig) secMsg = SecureBinaryData(binMsgVerify) secSig = SecureBinaryData(rBin + sBin) secPubKey = SecureBinaryData(self.binPublicKey65) return CryptoECDSA().VerifyData(secMsg, secSig, secPubKey) ############################################################################# def markAsRootAddr(self, chaincode): if not chaincode.getSize()==32: raise KeyDataError, 'Chaincode must be 32 bytes' else: self.chainIndex = -1 self.chaincode = chaincode ############################################################################# def isAddrChainRoot(self): return (self.chainIndex==-1) ############################################################################# @TimeThisFunction def extendAddressChain(self, secureKdfOutput=None, newIV=None): """ We require some fairly complicated logic here, due to the fact that a user with a full, private-key-bearing wallet, may try to generate a new key/address without supplying a passphrase. If this happens, the wallet logic gets mucked up -- we don't want to reject the request to generate a new address, but we can't compute the private key until the next time the user unlocks their wallet. Thus, we have to save off the data they will need to create the key, to be applied on next unlock. """ if not self.chaincode.getSize() == 32: raise KeyDataError, 'No chaincode has been defined to extend chain' newAddr = PyBtcAddress() privKeyAvailButNotDecryptable = (self.hasPrivKey() and \ self.isLocked and \ not secureKdfOutput ) if self.hasPrivKey() and not privKeyAvailButNotDecryptable: # We are extending a chain using private key data wasLocked = self.isLocked if self.useEncryption and self.isLocked: if not secureKdfOutput: raise WalletLockError, 'Cannot create new address without passphrase' self.unlock(secureKdfOutput) if not newIV: newIV = SecureBinaryData().GenerateRandom(16) if self.hasPubKey(): #newPriv = CryptoECDSA().ComputeChainedPrivateKey( \ #self.binPrivKey32_Plain, \ #self.chaincode, \ #self.binPublicKey65) newPriv = self.safeExtendPrivateKey( \ self.binPrivKey32_Plain, \ self.chaincode, \ self.binPublicKey65) else: #newPriv = CryptoECDSA().ComputeChainedPrivateKey( \ #self.binPrivKey32_Plain, \ #self.chaincode) newPriv = self.safeExtendPrivateKey( \ self.binPrivKey32_Plain, \ self.chaincode) newPub = CryptoECDSA().ComputePublicKey(newPriv) newAddr160 = newPub.getHash160() newAddr.createFromPlainKeyData(newPriv, newAddr160, \ IV16=newIV, publicKey65=newPub) newAddr.addrStr20 = newPub.getHash160() newAddr.useEncryption = self.useEncryption newAddr.isInitialized = True newAddr.chaincode = self.chaincode newAddr.chainIndex = self.chainIndex+1 # We can't get here without a secureKdfOutput (I think) if newAddr.useEncryption: newAddr.lock(secureKdfOutput) if not wasLocked: newAddr.unlock(secureKdfOutput) self.unlock(secureKdfOutput) return newAddr else: # We are extending the address based solely on its public key if not self.hasPubKey(): raise KeyDataError, 'No public key available to extend chain' #newAddr.binPublicKey65 = CryptoECDSA().ComputeChainedPublicKey( \ #self.binPublicKey65, self.chaincode) newAddr.binPublicKey65 = self.safeExtendPublicKey( \ self.binPublicKey65, self.chaincode) newAddr.addrStr20 = newAddr.binPublicKey65.getHash160() newAddr.useEncryption = self.useEncryption newAddr.isInitialized = True newAddr.chaincode = self.chaincode newAddr.chainIndex = self.chainIndex+1 if privKeyAvailButNotDecryptable: # *** store what is needed to recover key on next addr unlock *** newAddr.isLocked = True newAddr.useEncryption = True if not newIV: newIV = SecureBinaryData().GenerateRandom(16) newAddr.binInitVect16 = newIV newAddr.createPrivKeyNextUnlock = True newAddr.createPrivKeyNextUnlock_IVandKey = [None,None] if self.createPrivKeyNextUnlock: # We are chaining from address also requiring gen on next unlock newAddr.createPrivKeyNextUnlock_IVandKey[0] = \ self.createPrivKeyNextUnlock_IVandKey[0].copy() newAddr.createPrivKeyNextUnlock_IVandKey[1] = \ self.createPrivKeyNextUnlock_IVandKey[1].copy() newAddr.createPrivKeyNextUnlock_ChainDepth = \ self.createPrivKeyNextUnlock_ChainDepth+1 else: # The address from which we are extending has already been generated newAddr.createPrivKeyNextUnlock_IVandKey[0] = self.binInitVect16.copy() newAddr.createPrivKeyNextUnlock_IVandKey[1] = self.binPrivKey32_Encr.copy() newAddr.createPrivKeyNextUnlock_ChainDepth = 1 return newAddr def serialize(self): """ We define here a binary serialization scheme that will write out ALL information needed to completely reconstruct address data from file. This method returns a string, but presumably will be used to write addr data to file. The following format is used. Address160 (20 bytes) : The 20-byte hash of the public key This must always be the first field AddressChk ( 4 bytes) : Checksum to make sure no error in addr160 AddrVersion ( 4 bytes) : Early version don't specify encrypt params Flags ( 8 bytes) : Addr-specific info, including encrypt params ChainCode (32 bytes) : For extending deterministic wallets ChainChk ( 4 bytes) : Checksum for chaincode ChainIndex ( 8 bytes) : Index in chain if deterministic addresses ChainDepth ( 8 bytes) : How deep addr is in chain beyond last computed private key (if base address was locked when we tried to extend/chain it) InitVect (16 bytes) : Initialization vector for encryption InitVectChk ( 4 bytes) : Checksum for IV PrivKey (32 bytes) : Private key data (may be encrypted) PrivKeyChk ( 4 bytes) : Checksum for private key data PublicKey (65 bytes) : Public key for this address PubKeyChk ( 4 bytes) : Checksum for private key data FirstTime ( 8 bytes) : The first time addr was seen in blockchain LastTime ( 8 bytes) : The last time addr was seen in blockchain FirstBlock ( 4 bytes) : The first block addr was seen in blockchain LastBlock ( 4 bytes) : The last block addr was seen in blockchain """ serializeWithEncryption = self.useEncryption if self.useEncryption and \ self.binPrivKey32_Encr.getSize()==0 and \ self.binPrivKey32_Plain.getSize()>0: LOGERROR('') LOGERROR('***WARNING: you have chosen to serialize a key you hope to be') LOGERROR(' encrypted, but have not yet chosen a passphrase for') LOGERROR(' it. The only way to serialize this address is with ') LOGERROR(' the plaintext keys. Please lock this address at') LOGERROR(' least once in order to enable encrypted output.') serializeWithEncryption = False # Before starting, let's construct the flags for this address nFlagBytes = 8 flags = [False]*nFlagBytes*8 flags[0] = self.hasPrivKey() flags[1] = self.hasPubKey() flags[2] = serializeWithEncryption flags[3] = self.createPrivKeyNextUnlock flags = ''.join([('1' if f else '0') for f in flags]) def raw(a): if isinstance(a, str): return a else: return a.toBinStr() def chk(a): if isinstance(a, str): return computeChecksum(a,4) else: return computeChecksum(a.toBinStr(),4) # Use BinaryPacker "width" fields to guaranteee BINARY_CHUNK width. # Sure, if we have malformed data we might cut some of it off instead # of writing it to the binary stream. But at least we'll ALWAYS be # able to determine where each field is, and will never corrupt the # whole wallet so badly we have to go hex-diving to figure out what # happened. binOut = BinaryPacker() binOut.put(BINARY_CHUNK, self.addrStr20, width=20) binOut.put(BINARY_CHUNK, chk(self.addrStr20), width= 4) binOut.put(UINT32, getVersionInt(PYBTCWALLET_VERSION)) binOut.put(UINT64, bitset_to_int(flags)) # Write out address-chaining parameters (for deterministic wallets) binOut.put(BINARY_CHUNK, raw(self.chaincode), width=32) binOut.put(BINARY_CHUNK, chk(self.chaincode), width= 4) binOut.put(INT64, self.chainIndex) binOut.put(INT64, self.createPrivKeyNextUnlock_ChainDepth) # Write out whatever is appropriate for private-key data # Binary-unpacker will write all 0x00 bytes if empty values are given if serializeWithEncryption: if self.createPrivKeyNextUnlock: binOut.put(BINARY_CHUNK, raw(self.createPrivKeyNextUnlock_IVandKey[0]), width=16) binOut.put(BINARY_CHUNK, chk(self.createPrivKeyNextUnlock_IVandKey[0]), width= 4) binOut.put(BINARY_CHUNK, raw(self.createPrivKeyNextUnlock_IVandKey[1]), width=32) binOut.put(BINARY_CHUNK, chk(self.createPrivKeyNextUnlock_IVandKey[1]), width= 4) else: binOut.put(BINARY_CHUNK, raw(self.binInitVect16), width=16) binOut.put(BINARY_CHUNK, chk(self.binInitVect16), width= 4) binOut.put(BINARY_CHUNK, raw(self.binPrivKey32_Encr), width=32) binOut.put(BINARY_CHUNK, chk(self.binPrivKey32_Encr), width= 4) else: binOut.put(BINARY_CHUNK, raw(self.binInitVect16), width=16) binOut.put(BINARY_CHUNK, chk(self.binInitVect16), width= 4) binOut.put(BINARY_CHUNK, raw(self.binPrivKey32_Plain), width=32) binOut.put(BINARY_CHUNK, chk(self.binPrivKey32_Plain), width= 4) binOut.put(BINARY_CHUNK, raw(self.binPublicKey65), width=65) binOut.put(BINARY_CHUNK, chk(self.binPublicKey65), width= 4) binOut.put(UINT64, self.timeRange[0]) binOut.put(UINT64, self.timeRange[1]) binOut.put(UINT32, self.blkRange[0]) binOut.put(UINT32, self.blkRange[1]) return binOut.getBinaryString() ############################################################################# def scanBlockchainForAddress(self, abortIfBDMBusy=False): """ This method will return null output if the BDM is currently in the middle of a scan. You can use waitAsLongAsNecessary=True if you want to wait for the previous scan AND the next scan. Otherwise, you can check for bal==-1 and then try again later... This is particularly relevant if you know that an address has already been scanned, and you expect this method to return immediately. Thus, you don't want to wait for any scan at all... This one-stop-shop method has to be blocking. You might want to register the address and rescan asynchronously, skipping this method entirely: cppWlt = Cpp.BtcWallet() cppWlt.addScrAddress_1_(Hash160ToScrAddr(self.getAddr160())) TheBDM.registerScrAddr(Hash160ToScrAddr(self.getAddr160())) TheBDM.rescanBlockchain(wait=False) <... do some other stuff ...> if TheBDM.getBDMState()=='BlockchainReady': TheBDM.updateWalletsAfterScan(wait=True) # fast after a rescan bal = cppWlt.getBalance('Spendable') utxoList = cppWlt.getUnspentTxOutList() else: <...come back later...> """ if TheBDM.getBDMState()=='BlockchainReady' or \ (TheBDM.isScanning() and not abortIfBDMBusy): LOGDEBUG('Scanning blockchain for address') # We are expecting this method to return balance # and UTXO data, so we must make sure we're blocking. cppWlt = Cpp.BtcWallet() cppWlt.addScrAddress_1_(Hash160ToScrAddr(self.getAddr160())) TheBDM.registerWallet(cppWlt, wait=True) TheBDM.scanBlockchainForTx(cppWlt, wait=True) utxoList = cppWlt.getSpendableTxOutList() bal = cppWlt.getSpendableBalance(0, IGNOREZC) return (bal, utxoList) else: return (-1, []) ############################################################################# def unserialize(self, toUnpack): """ We reconstruct the address from a serialized version of it. See the help text for "serialize()" for information on what fields need to be included and the binary mapping We verify all checksums, correct for one byte errors, and raise exceptions for bigger problems that can't be fixed. """ if isinstance(toUnpack, BinaryUnpacker): serializedData = toUnpack else: serializedData = BinaryUnpacker( toUnpack ) def chkzero(a): """ Due to fixed-width fields, we will get lots of zero-bytes even when the binary data container was empty """ if a.count('\x00')==len(a): return '' else: return a # Start with a fresh new address self.__init__() self.addrStr20 = serializedData.get(BINARY_CHUNK, 20) chkAddr20 = serializedData.get(BINARY_CHUNK, 4) addrVerInt = serializedData.get(UINT32) flags = serializedData.get(UINT64) self.addrStr20 = verifyChecksum(self.addrStr20, chkAddr20) flags = int_to_bitset(flags, widthBytes=8) # Interpret the flags containsPrivKey = (flags[0]=='1') containsPubKey = (flags[1]=='1') self.useEncryption = (flags[2]=='1') self.createPrivKeyNextUnlock = (flags[3]=='1') addrChkError = False if len(self.addrStr20)==0: addrChkError = True if not containsPrivKey and not containsPubKey: raise UnserializeError, 'Checksum mismatch in addrStr' # Write out address-chaining parameters (for deterministic wallets) self.chaincode = chkzero(serializedData.get(BINARY_CHUNK, 32)) chkChaincode = serializedData.get(BINARY_CHUNK, 4) self.chainIndex = serializedData.get(INT64) depth = serializedData.get(INT64) self.createPrivKeyNextUnlock_ChainDepth = depth # Correct errors, convert to secure container self.chaincode = SecureBinaryData(verifyChecksum(self.chaincode, chkChaincode)) # Write out whatever is appropriate for private-key data # Binary-unpacker will write all 0x00 bytes if empty values are given iv = chkzero(serializedData.get(BINARY_CHUNK, 16)) chkIv = serializedData.get(BINARY_CHUNK, 4) privKey = chkzero(serializedData.get(BINARY_CHUNK, 32)) chkPriv = serializedData.get(BINARY_CHUNK, 4) iv = SecureBinaryData(verifyChecksum(iv, chkIv)) privKey = SecureBinaryData(verifyChecksum(privKey, chkPriv)) # If this is SUPPOSED to contain a private key... if containsPrivKey: if privKey.getSize()==0: raise UnserializeError, 'Checksum mismatch in PrivateKey '+\ '('+hash160_to_addrStr(self.addrStr20)+')' if self.useEncryption: if iv.getSize()==0: raise UnserializeError, 'Checksum mismatch in IV ' +\ '('+hash160_to_addrStr(self.addrStr20)+')' if self.createPrivKeyNextUnlock: self.createPrivKeyNextUnlock_IVandKey[0] = iv.copy() self.createPrivKeyNextUnlock_IVandKey[1] = privKey.copy() else: self.binInitVect16 = iv.copy() self.binPrivKey32_Encr = privKey.copy() else: self.binInitVect16 = iv.copy() self.binPrivKey32_Plain = privKey.copy() pubKey = chkzero(serializedData.get(BINARY_CHUNK, 65)) chkPub = serializedData.get(BINARY_CHUNK, 4) pubKey = SecureBinaryData(verifyChecksum(pubKey, chkPub)) if containsPubKey: if not pubKey.getSize()==65: if self.binPrivKey32_Plain.getSize()==32: pubKey = CryptoAES().ComputePublicKey(self.binPrivKey32_Plain) else: raise UnserializeError, 'Checksum mismatch in PublicKey ' +\ '('+hash160_to_addrStr(self.addrStr20)+')' self.binPublicKey65 = pubKey if addrChkError: self.addrStr20 = self.binPublicKey65.getHash160() self.timeRange[0] = serializedData.get(UINT64) self.timeRange[1] = serializedData.get(UINT64) self.blkRange[0] = serializedData.get(UINT32) self.blkRange[1] = serializedData.get(UINT32) self.isInitialized = True return self ############################################################################# # The following methods are the SIMPLE address operations that can be used # to juggle address data without worrying at all about encryption details. # The addresses created here can later be endowed with encryption. ############################################################################# def createFromPrivateKey(self, privKey, pubKey=None, skipCheck=False): """ Creates address from a user-supplied random INTEGER. This method DOES perform elliptic-curve operations """ if isinstance(privKey, str) and len(privKey)==32: self.binPrivKey32_Plain = SecureBinaryData(privKey) elif isinstance(privKey, int) or isinstance(privKey, long): binPriv = int_to_binary(privKey, widthBytes=32, endOut=BIGENDIAN) self.binPrivKey32_Plain = SecureBinaryData(binPriv) else: raise KeyDataError, 'Unknown private key format' if pubKey==None: self.binPublicKey65 = CryptoECDSA().ComputePublicKey(self.binPrivKey32_Plain) else: self.binPublicKey65 = SecureBinaryData(pubKey) if not skipCheck: assert(CryptoECDSA().CheckPubPrivKeyMatch( \ self.binPrivKey32_Plain, \ self.binPublicKey65)) self.addrStr20 = self.binPublicKey65.getHash160() self.isInitialized = True return self ############################################################################# def createFromPublicKey(self, pubkey): """ Creates address from a user-supplied ECDSA public key. The key can be supplied as an (x,y) pair of integers, an EC_Point as defined in the lisecdsa class, or as a 65-byte binary string (the 64 public key bytes with a 0x04 prefix byte) This method will fail if the supplied pair of points is not on the secp256k1 curve. """ if isinstance(pubkey, tuple) and len(pubkey)==2: # We are given public-key (x,y) pair binXBE = int_to_binary(pubkey[0], widthBytes=32, endOut=BIGENDIAN) binYBE = int_to_binary(pubkey[1], widthBytes=32, endOut=BIGENDIAN) self.binPublicKey65 = SecureBinaryData('\x04' + binXBE + binYBE) if not CryptoECDSA().VerifyPublicKeyValid(self.binPublicKey65): raise KeyDataError, 'Supplied public key is not on secp256k1 curve' elif isinstance(pubkey, str) and len(pubkey)==65: self.binPublicKey65 = SecureBinaryData(pubkey) if not CryptoECDSA().VerifyPublicKeyValid(self.binPublicKey65): raise KeyDataError, 'Supplied public key is not on secp256k1 curve' else: raise KeyDataError, 'Unknown public key format!' # TODO: I should do a test to see which is faster: # 1) Compute the hash directly like this # 2) Get the string, hash it in python self.addrStr20 = self.binPublicKey65.getHash160() self.isInitialized = True return self def createFromPublicKeyHash160(self, pubkeyHash160, netbyte=ADDRBYTE): """ Creates an address from just the 20-byte binary hash of a public key. In binary form without a chksum, there is no protection against byte errors, since there's no way to distinguish an invalid address from a valid one (they both look like random data). If you are creating an address using 20 bytes you obtained in an unreliable manner (such as manually typing them in), you should double-check the input before sending money using the address created here -- the tx will appear valid and be accepted by the network, but will be permanently tied up in the network """ self.__init__() self.addrStr20 = pubkeyHash160 self.isInitialized = True return self def createFromAddrStr(self, addrStr): """ Creates an address from a Base58 address string. Since the address string includes a checksum, this method will fail if there was any errors entering/copying the address """ self.__init__() self.addrStr = addrStr if not self.checkAddressValid(): raise BadAddressError, 'Invalid address string: '+addrStr self.isInitialized = True return self def calculateAddrStr(self, netbyte=ADDRBYTE): """ Forces a recalculation of the address string from the public key """ if not self.hasPubKey(): raise KeyDataError, 'Cannot compute address without PublicKey' keyHash = self.binPublicKey65.getHash160() chksum = hash256(netbyte + keyHash)[:4] return binary_to_base58(netbyte + keyHash + chksum) def checkAddressValid(self): return checkAddrStrValid(self.addrStr); def pprint(self, withPrivKey=True, indent=''): def pp(x, nchar=1000): if x.getSize()==0: return '--'*32 else: return x.toHexStr()[:nchar] print indent + 'BTC Address :', self.getAddrStr() print indent + 'Hash160[BE] :', binary_to_hex(self.getAddr160()) print indent + 'Wallet Location :', self.walletByteLoc print indent + 'Chained Address :', self.chainIndex >= -1 print indent + 'Have (priv,pub) : (%s,%s)' % \ (str(self.hasPrivKey()), str(self.hasPubKey())) print indent + 'First/Last Time : (%s,%s)' % \ (str(self.timeRange[0]), str(self.timeRange[1])) print indent + 'First/Last Block : (%s,%s)' % \ (str(self.blkRange[0]), str(self.blkRange[1])) if self.hasPubKey(): print indent + 'PubKeyX(BE) :', \ binary_to_hex(self.binPublicKey65.toBinStr()[1:33 ]) print indent + 'PubKeyY(BE) :', \ binary_to_hex(self.binPublicKey65.toBinStr()[ 33:]) print indent + 'Encryption parameters:' print indent + ' UseEncryption :', self.useEncryption print indent + ' IsLocked :', self.isLocked print indent + ' KeyChanged :', self.keyChanged print indent + ' ChainIndex :', self.chainIndex print indent + ' Chaincode :', pp(self.chaincode) print indent + ' InitVector :', pp(self.binInitVect16) if withPrivKey and self.hasPrivKey(): print indent + 'PrivKeyPlain(BE) :', pp(self.binPrivKey32_Plain) print indent + 'PrivKeyCiphr(BE) :', pp(self.binPrivKey32_Encr) else: print indent + 'PrivKeyPlain(BE) :', pp(SecureBinaryData()) print indent + 'PrivKeyCiphr(BE) :', pp(SecureBinaryData()) if self.createPrivKeyNextUnlock: print indent + ' ***** :', 'PrivKeys available on next unlock' def toString(self, withPrivKey=True, indent=''): def pp(x, nchar=1000): if x.getSize()==0: return '--'*32 else: return x.toHexStr()[:nchar] result = ''.join([indent + 'BTC Address :', self.getAddrStr()]) result = ''.join([result, '\n', indent + 'Hash160[BE] :', binary_to_hex(self.getAddr160())]) result = ''.join([result, '\n', indent + 'Wallet Location :', str(self.walletByteLoc)]) result = ''.join([result, '\n', indent + 'Chained Address :', str(self.chainIndex >= -1)]) result = ''.join([result, '\n', indent + 'Have (priv,pub) : (%s,%s)' % \ (str(self.hasPrivKey()), str(self.hasPubKey()))]) result = ''.join([result, '\n', indent + 'First/Last Time : (%s,%s)' % \ (str(self.timeRange[0]), str(self.timeRange[1]))]) result = ''.join([result, '\n', indent + 'First/Last Block : (%s,%s)' % \ (str(self.blkRange[0]), str(self.blkRange[1]))]) if self.hasPubKey(): result = ''.join([result, '\n', indent + 'PubKeyX(BE) :', \ binary_to_hex(self.binPublicKey65.toBinStr()[1:33 ])]) result = ''.join([result, '\n', indent + 'PubKeyY(BE) :', \ binary_to_hex(self.binPublicKey65.toBinStr()[ 33:])]) result = ''.join([result, '\n', indent + 'Encryption parameters:']) result = ''.join([result, '\n', indent + ' UseEncryption :', str(self.useEncryption)]) result = ''.join([result, '\n', indent + ' IsLocked :', str(self.isLocked)]) result = ''.join([result, '\n', indent + ' KeyChanged :', str(self.keyChanged)]) result = ''.join([result, '\n', indent + ' ChainIndex :', str(self.chainIndex)]) result = ''.join([result, '\n', indent + ' Chaincode :', pp(self.chaincode)]) result = ''.join([result, '\n', indent + ' InitVector :', pp(self.binInitVect16)]) if withPrivKey and self.hasPrivKey(): result = ''.join([result, '\n', indent + 'PrivKeyPlain(BE) :', pp(self.binPrivKey32_Plain)]) result = ''.join([result, '\n', indent + 'PrivKeyCiphr(BE) :', pp(self.binPrivKey32_Encr)]) else: result = ''.join([result, '\n', indent + 'PrivKeyPlain(BE) :', pp(SecureBinaryData())]) result = ''.join([result, '\n', indent + 'PrivKeyCiphr(BE) :', pp(SecureBinaryData())]) if self.createPrivKeyNextUnlock: result = ''.join([result, '\n', indent + ' ***** :', 'PrivKeys available on next unlock']) return result # Put the import at the end to avoid circular reference problem from armoryengine.BDM import * armory-0.92.3/jasvet.py0000644000000000000000000004622712414772654013511 0ustar rootroot#!/usr/bin/env python # jackjack's signing/verifying tool # verifies base64 signatures from Bitcoin # signs message in three formats: # - Bitcoin base64 (compatible with Bitcoin) # - ASCII armored, Clearsign # - ASCII armored, Base64 # # Licence: Public domain or CC0 import base64 import hashlib import random import time import CppBlockUtils from armoryengine.ArmoryUtils import getVersionString, BTCARMORY_VERSION, \ ChecksumError FTVerbose=False version='0.1.0' _p = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2FL _r = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141L _b = 0x0000000000000000000000000000000000000000000000000000000000000007L _a = 0x0000000000000000000000000000000000000000000000000000000000000000L _Gx = 0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798L _Gy = 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8L BEGIN_MARKER = '-----BEGIN ' END_MARKER = '-----END ' DASHX5 = '-----' RN = '\r\n' RNRN = '\r\n\r\n' CLEARSIGN_MSG_TYPE_MARKER = 'BITCOIN SIGNED MESSAGE' BITCOIN_SIG_TYPE_MARKER = 'BITCOIN SIGNATURE' BASE64_MSG_TYPE_MARKER = 'BITCOIN MESSAGE' BITCOIN_ARMORY_COMMENT = 'Comment: Signed by Bitcoin Armory v' +\ getVersionString(BTCARMORY_VERSION, 3) class UnknownSigBlockType(Exception): pass def randomk(): # Using Crypto++ CSPRNG instead of python's sbdRandK = CppBlockUtils.SecureBinaryData().GenerateRandom(32) hexRandK = sbdRandK.toBinStr().encode('hex_codec') return int(hexRandK, 16) # Common constants/functions for Bitcoin def hash_160_to_bc_address(h160, addrtype=0): vh160 = chr(addrtype) + h160 h = Hash(vh160) addr = vh160 + h[0:4] return b58encode(addr) def bc_address_to_hash_160(addr): hash160 = b58decode(addr, 25) return hash160[1:21] def Hash(data): return hashlib.sha256(hashlib.sha256(data).digest()).digest() def sha256(data): return hashlib.sha256(data).digest() def sha1(data): return hashlib.sha1(data).digest() __b58chars = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz' __b58base = len(__b58chars) def b58encode(v): long_value = 0L for (i, c) in enumerate(v[::-1]): long_value += (256**i) * ord(c) result = '' while long_value >= __b58base: div, mod = divmod(long_value, __b58base) result = __b58chars[mod] + result long_value = div result = __b58chars[long_value] + result nPad = 0 for c in v: if c == '\0': nPad += 1 else: break return (__b58chars[0]*nPad) + result def b58decode(v, length): long_value = 0L for (i, c) in enumerate(v[::-1]): long_value += __b58chars.find(c) * (__b58base**i) result = '' while long_value >= 256: div, mod = divmod(long_value, 256) result = chr(mod) + result long_value = div result = chr(long_value) + result nPad = 0 for c in v: if c == __b58chars[0]: nPad += 1 else: break result = chr(0)*nPad + result if length is not None and len(result) != length: return None return result def ASecretToSecret(key): vch = DecodeBase58Check(key) if vch and vch[0] == chr(128): return vch[1:] else: return False def DecodeBase58Check(psz): vchRet = b58decode(psz, None) key = vchRet[0:-4] csum = vchRet[-4:] hashValue = Hash(key) cs32 = hashValue[0:4] if cs32 != csum: return None else: return key def regenerate_key(sec): b = ASecretToSecret(sec) if not b: return False b = b[0:32] secret = int('0x' + b.encode('hex'), 16) return EC_KEY(secret) def GetPubKey(pkey, compressed=False): return i2o_ECPublicKey(pkey, compressed) def GetPrivKey(pkey, compressed=False): return i2d_ECPrivateKey(pkey, compressed) def GetSecret(pkey): return ('%064x' % pkey.secret).decode('hex') def i2d_ECPrivateKey(pkey, compressed=False):#, crypted=True): part3='a081a53081a2020101302c06072a8648ce3d0101022100' # for uncompressed keys if compressed: if True:#not crypted: ## Bitcoin accepts both part3's for crypted wallets... part3='a08185308182020101302c06072a8648ce3d0101022100' # for compressed keys key = '3081d30201010420' + \ '%064x' % pkey.secret + \ part3 + \ '%064x' % _p + \ '3006040100040107042102' + \ '%064x' % _Gx + \ '022100' + \ '%064x' % _r + \ '020101a124032200' else: key = '308201130201010420' + \ '%064x' % pkey.secret + \ part3 + \ '%064x' % _p + \ '3006040100040107044104' + \ '%064x' % _Gx + \ '%064x' % _Gy + \ '022100' + \ '%064x' % _r + \ '020101a144034200' return key.decode('hex') + i2o_ECPublicKey(pkey, compressed) def i2o_ECPublicKey(pkey, compressed=False): if compressed: if pkey.pubkey.point.y() & 1: key = '03' + '%064x' % pkey.pubkey.point.x() else: key = '02' + '%064x' % pkey.pubkey.point.x() else: key = '04' + \ '%064x' % pkey.pubkey.point.x() + \ '%064x' % pkey.pubkey.point.y() return key.decode('hex') def hash_160(public_key): md = hashlib.new('ripemd160') md.update(hashlib.sha256(public_key).digest()) return md.digest() def public_key_to_bc_address(public_key, v=0): h160 = hash_160(public_key) return hash_160_to_bc_address(h160, v) def inverse_mod( a, m ): if a < 0 or m <= a: a = a % m c, d = a, m uc, vc, ud, vd = 1, 0, 0, 1 while c != 0: q, c, d = divmod( d, c ) + ( c, ) uc, vc, ud, vd = ud - q*uc, vd - q*vc, uc, vc assert d == 1 if ud > 0: return ud else: return ud + m class CurveFp( object ): def __init__( self, p, a, b ): self.__p = p self.__a = a self.__b = b def p( self ): return self.__p def a( self ): return self.__a def b( self ): return self.__b def contains_point( self, x, y ): return ( y * y - ( x * x * x + self.__a * x + self.__b ) ) % self.__p == 0 class Point( object ): def __init__( self, curve, x, y, order = None ): self.__curve = curve self.__x = x self.__y = y self.__order = order if self.__curve: assert self.__curve.contains_point( x, y ) if order: assert self * order == INFINITY def __add__( self, other ): if other == INFINITY: return self if self == INFINITY: return other assert self.__curve == other.__curve if self.__x == other.__x: if ( self.__y + other.__y ) % self.__curve.p() == 0: return INFINITY else: return self.double() p = self.__curve.p() l = ( ( other.__y - self.__y ) * \ inverse_mod( other.__x - self.__x, p ) ) % p x3 = ( l * l - self.__x - other.__x ) % p y3 = ( l * ( self.__x - x3 ) - self.__y ) % p return Point( self.__curve, x3, y3 ) def __mul__( self, other ): def leftmost_bit( x ): assert x > 0 result = 1L while result <= x: result = 2 * result return result / 2 e = other if self.__order: e = e % self.__order if e == 0: return INFINITY if self == INFINITY: return INFINITY assert e > 0 e3 = 3 * e negative_self = Point( self.__curve, self.__x, -self.__y, self.__order ) i = leftmost_bit( e3 ) / 2 result = self while i > 1: result = result.double() if ( e3 & i ) != 0 and ( e & i ) == 0: result = result + self if ( e3 & i ) == 0 and ( e & i ) != 0: result = result + negative_self i = i / 2 return result def __rmul__( self, other ): return self * other def __str__( self ): if self == INFINITY: return "infinity" return "(%d,%d)" % ( self.__x, self.__y ) def double( self ): if self == INFINITY: return INFINITY p = self.__curve.p() a = self.__curve.a() l = ( ( 3 * self.__x * self.__x + a ) * \ inverse_mod( 2 * self.__y, p ) ) % p x3 = ( l * l - 2 * self.__x ) % p y3 = ( l * ( self.__x - x3 ) - self.__y ) % p return Point( self.__curve, x3, y3 ) def x( self ): return self.__x def y( self ): return self.__y def curve( self ): return self.__curve def order( self ): return self.__order INFINITY = Point( None, None, None ) def str_to_long(b): res = 0 pos = 1 for a in reversed(b): res += ord(a) * pos pos *= 256 return res class Public_key( object ): def __init__( self, generator, point, c ): self.curve = generator.curve() self.generator = generator self.point = point self.compressed = c n = generator.order() if not n: raise RuntimeError, "Generator point must have order." if not n * point == INFINITY: raise RuntimeError, "Generator point order is bad." if point.x() < 0 or n <= point.x() or point.y() < 0 or n <= point.y(): raise RuntimeError, "Generator point has x or y out of range." def verify( self, hashValue, signature ): if isinstance(hashValue, str): hashValue=str_to_long(hashValue) G = self.generator n = G.order() r = signature.r s = signature.s if r < 1 or r > n-1: return False if s < 1 or s > n-1: return False c = inverse_mod( s, n ) u1 = ( hashValue * c ) % n u2 = ( r * c ) % n xy = u1 * G + u2 * self.point v = xy.x() % n return v == r def ser(self): if self.compressed: if self.point.y() & 1: key = '03' + '%064x' % self.point.x() else: key = '02' + '%064x' % self.point.x() else: key = '04' + \ '%064x' % self.point.x() + \ '%064x' % self.point.y() return key.decode('hex') class Signature( object ): def __init__( self, r, s ): self.r = r self.s = s def ser(self): return ("%064x%064x"%(self.r,self.s)).decode('hex') class Private_key( object ): def __init__( self, public_key, secret_multiplier ): self.public_key = public_key self.secret_multiplier = secret_multiplier # def der( self ): # hex_der_key = '06052b8104000a30740201010420' + \ # '%064x' % self.secret_multiplier + \ # 'a00706052b8104000aa14403420004' + \ # '%064x' % self.public_key.point.x() + \ # '%064x' % self.public_key.point.y() # return hex_der_key.decode('hex') def sign( self, hashValue, random_k ): if isinstance(hashValue, str): hashValue=str_to_long(hashValue) G = self.public_key.generator n = G.order() k = random_k % n p1 = k * G r = p1.x() if r == 0: raise RuntimeError, "amazingly unlucky random number r" s = ( inverse_mod( k, n ) * \ ( hashValue + ( self.secret_multiplier * r ) % n ) ) % n if s == 0: raise RuntimeError, "amazingly unlucky random number s" return Signature( r, s ) class EC_KEY(object): def __init__( self, secret, c=False): curve = CurveFp( _p, _a, _b ) generator = Point( curve, _Gx, _Gy, _r ) self.pubkey = Public_key( generator, generator * secret, c ) self.privkey = Private_key( self.pubkey, secret ) self.secret = secret def decbin(d, l=0, rev=False): if l==0: a="%x"%d if len(a)%2: a='0'+a else: a=("%0"+str(2*l)+"x")%d a=a.decode('hex') if rev: a=a[::-1] return a def decvi(d): if d<0xfd: return decbin(d) elif d<0xffff: return '\xfd'+decbin(d,2,True) elif d<0xffffffff: return '\xfe'+decbin(d,4,True) return '\xff'+decbin(d,8,True) def format_msg_to_sign(msg): return "\x18Bitcoin Signed Message:\n"+decvi(len(msg))+msg def sqrt_mod(a, p): return pow(a, (p+1)/4, p) curve_secp256k1 = CurveFp (_p, _a, _b) generator_secp256k1 = g = Point (curve_secp256k1, _Gx, _Gy, _r) randrange = random.SystemRandom().randrange # Signing/verifying def verify_message_Bitcoin(signature, message, pureECDSASigning=False, networkVersionNumber=0): msg=message if not pureECDSASigning: msg=Hash(format_msg_to_sign(message)) compressed=False curve = curve_secp256k1 G = generator_secp256k1 _a,_b,_p=curve.a(),curve.b(),curve.p() order = G.order() sig = base64.b64decode(signature) if len(sig) != 65: raise Exception("vmB","Bad signature") hb = ord(sig[0]) r,s = map(str_to_long,[sig[1:33],sig[33:65]]) if hb < 27 or hb >= 35: raise Exception("vmB","Bad first byte") if hb >= 31: compressed = True hb -= 4 recid = hb - 27 x = (r + (recid/2) * order) % _p y2 = ( pow(x,3,_p) + _a*x + _b ) % _p yomy = sqrt_mod(y2, _p) if (yomy - recid) % 2 == 0: y=yomy else: y=_p - yomy R = Point(curve, x, y, order) e = str_to_long(msg) minus_e = -e % order inv_r = inverse_mod(r,order) Q = inv_r * ( R*s + G*minus_e ) public_key = Public_key(G, Q, compressed) addr = public_key_to_bc_address(public_key.ser(), networkVersionNumber) return addr def sign_message(secret, message, pureECDSASigning=False): if len(secret) == 32: pkey = EC_KEY(str_to_long(secret)) compressed = False elif len(secret) == 33: pkey = EC_KEY(str_to_long(secret[:-1])) secret=secret[:-1] compressed = True else: raise Exception("sm","Bad private key size") msg=message if not pureECDSASigning: msg=Hash(format_msg_to_sign(message)) eckey = EC_KEY(str_to_long(secret), compressed) private_key = eckey.privkey public_key = eckey.pubkey addr = public_key_to_bc_address(GetPubKey(eckey,eckey.pubkey.compressed)) sig = private_key.sign(msg, randomk()) if not public_key.verify(msg, sig): raise Exception("sm","Problem signing message") return [sig,addr,compressed,public_key] def sign_message_Bitcoin(secret, msg, pureECDSASigning=False): sig,addr,compressed,public_key=sign_message(secret, msg, pureECDSASigning) for i in range(4): hb=27+i if compressed: hb+=4 sign=base64.b64encode(chr(hb)+sig.ser()) try: networkVersionNumber = str_to_long(b58decode(addr, None)) >> (8*24) if addr == verify_message_Bitcoin(sign, msg, pureECDSASigning, networkVersionNumber): return {'address':addr, 'b64-signature':sign, 'signature':chr(hb)+sig.ser(), 'message':msg} except Exception as e: # print e.args pass raise Exception("smB","Unable to construct recoverable key") def FormatText(t, sigctx=False, verbose=False): #sigctx: False=what is displayed, True=what is signed r='' te=t.split('\n') for l in te: while len(l) and l[len(l)-1] in [' ', '\r', '\t', chr(9)]: l=l[:-1] if not len(l) or l[len(l)-1]!='\r': l+='\r' if not sigctx: if len(l) and l[0]=='-': l='- '+l r+=l+'\n' r=r[:-2] global FTVerbose if FTVerbose: print ' -- Sent: '+t.encode('hex') if sigctx: print ' -- Signed: '+r.encode('hex') else: print ' -- Displayed: '+r.encode('hex') return r def crc24(m): INIT = 0xB704CE POLY = 0x1864CFB crc = INIT r = '' for o in m: o=ord(o) crc ^= (o << 16) for i in xrange(8): crc <<= 1 if crc & 0x1000000: crc ^= POLY for i in range(3): r += chr( ( crc & (0xff<<(8*i))) >> (8*i) ) return r def chunks(t, n): return [t[i:i+n] for i in range(0, len(t), n)] def ASCIIArmory(block, name, addComment=False): r=BEGIN_MARKER+name+DASHX5+RN if addComment: r+= BITCOIN_ARMORY_COMMENT r+=RNRN r+=RN.join(chunks(base64.b64encode(block), 64))+RN+'=' r+=base64.b64encode(crc24(block))+RN r+=END_MARKER+name+DASHX5 return r def readSigBlock(r): # Take the name off of the end because the BEGIN markers are confusing r = FormatText(r, True) name = r.split(BEGIN_MARKER)[1].split(DASHX5)[0] if name == BASE64_MSG_TYPE_MARKER: encoded,crc = r.split(BEGIN_MARKER)[1].split(END_MARKER)[0].split(DASHX5)[1].strip().split('\n=') crc = crc.strip() # Always starts with a blank line (\r\n\r\n) chop that off with the comment oand process the rest encoded = encoded.split(RNRN)[1] # Combines 64 byte chunks that are separated by \r\n encoded = ''.join(encoded.split(RN)) # decode the message. decoded = base64.b64decode(encoded) # Check sum of decoded messgae if base64.b64decode(crc) != crc24(decoded): raise ChecksumError # The signature is followed by the message and the whole thing is encoded # The message always starts at 65 because the signature is 65 bytes. signature = base64.b64encode(decoded[:65]) msg = decoded[65:] elif name == CLEARSIGN_MSG_TYPE_MARKER: # First get rid of the Clearsign marker and everything before it in case the user # added extra lines that would confuse the parsing that follows # The message is preceded by a blank line (\r\n\r\n) chop that off with the comment and process the rest # For Clearsign the message is unencoded since the message could include the \r\n\r\n we only ignore # the first and combine the rest. msg = r.split(BEGIN_MARKER+CLEARSIGN_MSG_TYPE_MARKER+DASHX5)[1] msg = RNRN.join(msg.split(RNRN)[1:]) msg = msg.split(RN+DASHX5)[0] # Only the signature is encoded, use the original r to pull out the encoded signature encoded = r.split(BEGIN_MARKER)[2].split(DASHX5)[1].split(BITCOIN_SIG_TYPE_MARKER)[0] encoded, crc = encoded.split('\n=') encoded = ''.join(encoded.split('\n')) signature = ''.join(encoded.split('\r')) crc = crc.strip() if base64.b64decode(crc) != crc24(base64.b64decode(signature)): raise ChecksumError else: raise UnknownSigBlockType() return signature, msg #============================================== def verifySignature(b64sig, msg, signVer='v0', networkVersionNumber=0): # If version 1, apply RFC2440 formatting rules to the message if signVer=='v1': msg = FormatText(msg, True) return verify_message_Bitcoin(b64sig, msg, networkVersionNumber = networkVersionNumber) def ASv0(privkey, msg): return sign_message_Bitcoin(privkey, msg) def ASv1CS(privkey, msg): sig=ASv0(privkey, FormatText(msg)) r=BEGIN_MARKER+CLEARSIGN_MSG_TYPE_MARKER+DASHX5+RN+BITCOIN_ARMORY_COMMENT+RNRN r+=FormatText(msg)+RN r+=ASCIIArmory(sig['signature'], BITCOIN_SIG_TYPE_MARKER) return r def ASv1B64(privkey, msg): sig=ASv0(privkey, FormatText(msg)) return ASCIIArmory(sig['signature']+sig['message'], BASE64_MSG_TYPE_MARKER, True) #============================================== # # Some tests with ugly output # You can delete the print commands in FormatText() after testing # if __name__=='__main__': pvk1='\x01'*32 text0='Hello world!' text1='Hello world!\n' text2='Hello world!\n\t' text3='Hello world!\n-jackjack' text4='Hello world!\n-jackjack ' text5='Hello world!' FTVerbose=True sv0=ASv0(pvk1, text1) print sv0 print verifySignature(sv0['b64-signature'], sv0['message'], signVer='v0') print ASv1B64(pvk1, text1) print print ASv1CS(pvk1, text1) print print ASv1CS(pvk1, text2) print print ASv1CS(pvk1, text3) print print ASv1CS(pvk1, text4) print print ASv1CS(pvk1, text5) armory-0.92.3/dpkgfiles/0000755000000000000000000000000012414772654013600 5ustar rootrootarmory-0.92.3/dpkgfiles/make_deb_package.py0000755000000000000000000000470412414772654017364 0ustar rootroot#! /usr/bin/python import os import shutil import platform import time from subprocess import Popen, PIPE def execAndWait(cli_str): print '*** Executing:', cli_str[:60], '...' process = Popen(cli_str, shell=True) while process.poll() == None: time.sleep(0.5) print '*** Finished executing' def dir(path='.'): allpaths = os.listdir(path) fileList = filter(lambda a: os.path.isfile(a), allpaths) dirList = filter(lambda a: os.path.isdir(a), allpaths) return [fileList, dirList] def cd(path): os.chdir(path) def pwd(): return os.getcwd() if pwd().split('/')[-1]=='dpkgfiles': cd('..') if not os.path.exists('./armoryengine/ArmoryUtils.py') or \ not os.path.exists('./ArmoryQt.py'): print '***ERROR: Must run this script from the root Armory directory!' exit(1) # Must get current Armory version from armoryengine.py # I desperately need a better way to store/read/increment version numbers vstr = '' with open('armoryengine/ArmoryUtils.py') as f: for line in f.readlines(): if line.startswith('BTCARMORY_VERSION'): vstr = line[line.index('(')+1:line.index(')')] vquad = tuple([int(v) for v in vstr.replace(' ','').split(',')]) print vquad, len(vquad) vstr = '%d.%02d' % vquad[:2] if (vquad[2] > 0 or vquad[3] > 0): vstr += '.%d' % vquad[2] if vquad[3] > 0: vstr += '.%d' % vquad[3] break pkgdir = 'armory-%s' % (vstr,) pkgdir_ = 'armory_%s' % (vstr,) if not vstr: print '***ERROR: Could not deduce version from ArmoryUtils.py. ' print ' There is no good reason for this to happen. Ever! :(' exit(1) # Copy the correct control file (for 32-bit or 64-bit OS) osBits = platform.architecture()[0][:2] shutil.copy('dpkgfiles/control%s' % (osBits), 'dpkgfiles/control') dpkgfiles = ['control', 'copyright', 'postinst', 'postrm', 'rules'] # Start pseudo-bash-script origDir = pwd().split('/')[-1] execAndWait('make clean') cd('..') execAndWait('rm -rf %s' % pkgdir) execAndWait('rm -f %s*' % pkgdir) execAndWait('rm -f %s*' % pkgdir_) shutil.copytree(origDir, pkgdir) execAndWait('tar -zcf %s.tar.gz %s' % (pkgdir, pkgdir)) cd(pkgdir) execAndWait('export DEBFULLNAME="Armory Technologies, Inc."; dh_make -s -e support@bitcoinarmory.com -f ../%s.tar.gz' % pkgdir) for f in dpkgfiles: shutil.copy('dpkgfiles/%s' % f, 'debian/%s' % f) # Finally, all the magic happens here execAndWait('dpkg-buildpackage -rfakeroot') armory-0.92.3/dpkgfiles/postinst0000755000000000000000000000511312414772654015411 0ustar rootroot#! /usr/bin/python import os import time from subprocess import Popen, PIPE import platform def execAndWait(cli_str): print ' EXEC:', cli_str process = Popen(cli_str, shell=True) while process.poll() == None: time.sleep(0.01) # Ubuntu 10.10+ has issues with the regular gconftool-2 commands # for registering URL handlers. Need a different solution, but # it's a permanent one. perm_app_register = True def createDesktopFile(name, idstr, arglist, toDir=''): toPath = os.path.join(toDir, 'armory%s.desktop' % idstr) deskfile = open(toPath, 'w') deskfile.write('[Desktop Entry]\n') deskfile.write('Type=Application\n') deskfile.write('Name=Armory') if name: deskfile.write(' (' + name + ')') deskfile.write('\n') deskfile.write('GenericName=Bitcoin Client\n') deskfile.write('Comment=Full-featured Bitcoin wallet management application\n') deskfile.write('Categories=Qt;Network;\n') deskfile.write('Exec=python /usr/lib/armory/ArmoryQt.py') for a in arglist: deskfile.write(' --%s' % a) if perm_app_register: deskfile.write(' %u') deskfile.write('\n') deskfile.write('Icon=armory%sicon\n' % idstr) deskfile.write('StartupNotify=false\n') deskfile.write('Terminal=false\n') deskfile.write('MimeType=x-scheme-handler/bitcoin\n') deskfile.close() # Give the system time to actually get rid of the .desktop files time.sleep(1) createDesktopFile('', '', [], '/usr/share/applications') createDesktopFile('Offline', 'offline',['offline'],'/usr/share/applications') createDesktopFile('Test Network','testnet',['testnet'],'/usr/share/applications') print ' Setting up menu items.' execAndWait('xdg-icon-resource install --novendor --context apps --size 64 /usr/share/armory/img/armory_icon_64x64.png armoryicon') execAndWait('xdg-icon-resource install --novendor --context apps --size 64 /usr/share/armory/img/armory_icon_64x64.png armoryofflineicon') execAndWait('xdg-icon-resource install --novendor --context apps --size 64 /usr/share/armory/img/armory_icon_green_64x64.png armorytestneticon') execAndWait('xdg-desktop-menu install --novendor /usr/share/applications/armory.desktop') execAndWait('xdg-desktop-menu install --novendor /usr/share/applications/armorytestnet.desktop') execAndWait('xdg-desktop-menu install --novendor /usr/share/applications/armoryoffline.desktop') print '' print '!!! Armory installed successfully !!!' print '' print ' Armory can be removed at any time, either through your package ' print ' manager, or through the following command:' print ' sudo dpkg -r armory' armory-0.92.3/dpkgfiles/rules0000755000000000000000000000100112414772654014650 0ustar rootroot#!/usr/bin/make -f # -*- makefile -*- # Sample debian/rules that uses debhelper. # This file was originally written by Joey Hess and Craig Small. # As a special exception, when this file is copied by dh-make into a # dh-make output file, you may use that output file without restriction. # This special exception was added by Craig Small in version 0.37 of dh-make. # Uncomment this to turn on verbose mode. #export DH_VERBOSE=1 %: dh $@ override_dh_auto_build: make PYVER=python2.7 override_dh_auto_test: armory-0.92.3/dpkgfiles/control320000644000000000000000000000154712414772654015357 0ustar rootrootSource: armory Section: net Priority: extra Maintainer: Armory Technologies, Inc. Build-Depends: python (>= 2.6), debhelper (>= 7), pyqt4-dev-tools, swig, libqtcore4, libqt4-dev, python-qt4, python-dev, python-twisted, python-psutil Standards-Version: 3.8.3 Homepage: http://www.bitcoinarmory.com Package: armory Architecture: i386 Depends: python (>= 2.6), python-qt4, python-twisted, python-psutil, xdg-utils, ${shlibs:Depends} Description: Advanced Bitcoin Wallet Management Software Armory is advanced program for managing multiple Bitcoin wallets with the highest level of security available. Use top-of-the-line wallet encryption, print permanent paper backups of your wallets, and store your Bitcoins on an offline computer for maximum security from online threats. Armory is open-source software licensed under the AGPLv3. armory-0.92.3/dpkgfiles/armory0000755000000000000000000000006712414772654015042 0ustar rootroot#!/bin/sh exec python /usr/lib/armory/ArmoryQt.py "$@" armory-0.92.3/dpkgfiles/copyright0000644000000000000000000001307412414772654015540 0ustar rootrootFormat: http://www.debian.org/doc/packaging-manuals/copyright-format/1.0/ Upstream-Name: Armory Upstream-Contact: https://github.com/etotheipi/BitcoinArmory/issues Source: https://github.com/etotheipi/BitcoinArmory Files: * Copyright: 2011-2014 Armory Technologies, Inc. License: AGPL-3+ This program is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. . This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more details. Files: cppForSwig/cryptopp/* License: public-domain Files: cppForSwig/leveldb/* Copyright: (c) 2011 The LevelDB Authors License: BSD-3-clause Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: . * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. . THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. Files: qtreactor4.py Copyright: (c) 2001-2011 Twisted Matrix Laboratories License: Expat Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: . The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. . THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Files: qrcodenative.py Copyright: (c) 2009 Kazuhiko Arase License: Expat Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: . The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. . THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Files: jsonrpc/* Copyright: 2011 Jeff Garzik (c) 2007 Jan-Klass Kollhof License: LGPL-2.1+ jsonrpc is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. . This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. . You should have received a copy of the GNU Lesser General Public License along with this software; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA armory-0.92.3/dpkgfiles/control640000644000000000000000000000155012414772654015356 0ustar rootrootSource: armory Section: net Priority: extra Maintainer: Armory Technologies, Inc. Build-Depends: python (>= 2.6), debhelper (>= 7), pyqt4-dev-tools, swig, libqtcore4, libqt4-dev, python-qt4, python-dev, python-twisted, python-psutil Standards-Version: 3.8.3 Homepage: http://www.bitcoinarmory.com Package: armory Architecture: amd64 Depends: python (>= 2.6), python-qt4, python-twisted, python-psutil, xdg-utils, ${shlibs:Depends} Description: Advanced Bitcoin Wallet Management Software Armory is advanced program for managing multiple Bitcoin wallets with the highest level of security available. Use top-of-the-line wallet encryption, print permanent paper backups of your wallets, and store your Bitcoins on an offline computer for maximum security from online threats. Armory is open-source software licensed under the AGPLv3. armory-0.92.3/dpkgfiles/postrm0000755000000000000000000000061512414772654015054 0ustar rootroot#! /bin/bash set -e xdg-desktop-menu uninstall /usr/share/applications/armory.desktop xdg-desktop-menu uninstall /usr/share/applications/armorytestnet.desktop xdg-desktop-menu uninstall /usr/share/applications/armoryoffline.desktop xdg-icon-resource uninstall --size 64 armoryicon xdg-icon-resource uninstall --size 64 armorytestneticon xdg-icon-resource uninstall --size 64 armoryofflineicon armory-0.92.3/dpkgfiles/armory.desktop0000755000000000000000000000041212414772654016504 0ustar rootroot[Desktop Entry] Type=Application Name=Armory GenericName=Bitcoin Client Comment=Full-featured Bitcoin wallet management application Categories=Qt;Network; Exec=/usr/bin/armory Icon=armoryicon StartupNotify=false Terminal=false Keywords=bitcoin;finance;wallet;money; armory-0.92.3/dpkgfiles/armoryoffline.desktop0000755000000000000000000000044312414772654020053 0ustar rootroot[Desktop Entry] Type=Application Name=Armory (Offline-mode) GenericName=Bitcoin Client Comment=Full-featured Bitcoin wallet management application Categories=Qt;Network; Exec=/usr/bin/armory --offline Icon=armoryicon StartupNotify=false Terminal=false Keywords=bitcoin;finance;wallet;money; armory-0.92.3/dpkgfiles/armorytestnet.desktop0000755000000000000000000000046212414772654020120 0ustar rootroot[Desktop Entry] Type=Application Name=Armory (Testnet) GenericName=Bitcoin Client Comment=Full-featured Bitcoin wallet management application Categories=Qt;Network; Exec=/usr/bin/armory --testnet Icon=armorytestneticon StartupNotify=false Terminal=false Keywords=bitcoin;finance;wallet;money;test;testnet; armory-0.92.3/LICENSE.py0000644000000000000000000010353112414772654013267 0ustar rootrootdef licenseText(): return """ ******************************************************************************** * * * Armory -- Advanced Bitcoin Wallet Software * * * * Copyright (C) 2011-2014, Armory Technologies, Inc. * * * * This program is free software: you can redistribute it and/or modify * * it under the terms of the GNU Affero General Public License as * * published by the Free Software Foundation, either version 3 of the * * License, or (at your option) any later version. * * * * This program is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * * GNU Affero General Public License * * for more details. * * * ******************************************************************************** * * * To use this software or source code in a way not compliant with the * * APGLv3, please contact us to discuss a dual-licensing agreement: * * * * licensing@bitcoinarmory.com * * * ******************************************************************************** This license applies to all works under this directory tree EXCEPT for: cppForSwig/cryptopp/* cppForSwig/leveldb/* qtreactor4.py qrcodenative.py jsonrpc/* bittornado/* Everything in the cryptopp directory is considered public domain according to http://www.cryptopp.com/ and included with the source distribution as a convenience to the user. The leveldb library has been included, unmodified, in compliance with its license that can be found in the cppForSwig/leveldb directory. ******************************************************************************** GNU AFFERO GENERAL PUBLIC LICENSE Version 3, 19 November 2007 --------------------------------------- Copyright (c) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU Affero General Public License is a free, copyleft license for software and other kinds of works, specifically designed to ensure cooperation with the community in the case of network server software. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, our General Public Licenses are intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things. Developers that use our General Public Licenses protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License which gives you legal permission to copy, distribute and/or modify the software. A secondary benefit of defending all users' freedom is that improvements made in alternate versions of the program, if they receive widespread use, become available for other developers to incorporate. Many developers of free software are heartened and encouraged by the resulting cooperation. However, in the case of software used on network servers, this result may fail to come about. The GNU General Public License permits making a modified version and letting the public access it on a server without ever releasing its source code to the public. The GNU Affero General Public License is designed specifically to ensure that, in such cases, the modified source code becomes available to the community. It requires the operator of a network server to provide the source code of the modified version running there to the users of that server. Therefore, public use of a modified version, on a publicly accessible server, gives the public access to the source code of the modified version. An older license, called the Affero General Public License and published by Affero, was designed to accomplish similar goals. This is a different license, not a version of the Affero GPL, but Affero has released a new version of the Affero GPL which permits relicensing under this license. The terms and conditions for copying, distribution and modification follow: ******************************************************************************** TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU Affero General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Remote Network Interaction; Use with the GNU General Public License. Notwithstanding any other provision of this License, if you modify the Program, your modified version must prominently offer all users interacting with it remotely through a computer network (if your version supports such interaction) an opportunity to receive the Corresponding Source of your version by providing access to the Corresponding Source from a network server at no charge, through some standard or customary means of facilitating copying of software. This Corresponding Source shall include the Corresponding Source for any work covered by version 3 of the GNU General Public License that is incorporated pursuant to the following paragraph. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the work with which it is combined will remain governed by version 3 of the GNU General Public License. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU Affero General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU Affero General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU Affero General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU Affero General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. END OF TERMS AND CONDITIONS """ armory-0.92.3/release_scripts/0000755000000000000000000000000012414772654015017 5ustar rootrootarmory-0.92.3/release_scripts/dlmap.txt0000644000000000000000000000060212414772654016653 0ustar rootrootArmory 0.91 https://s3.amazonaws.com/bitcoinarmory-releases/ armory_%ver-beta_64bit.deb Ubuntu 12.04,12.10,13.04,13.10,14.10 64 armory_%ver-beta_32bit.deb Ubuntu 12.04,12.10,13.04,13.10,14.10 32 armory_%ver-beta_osx.tar.gz MacOSX 10.7,10.8,10.9,10.9.1,10.9.2 64 armory_%ver-beta_raspbian.tar.gz RaspberryPi Raspbian(armhf) 32 armory_%ver-beta_winAll.exe Windows XP,Vista,7,8,8.1 32,64 armory-0.92.3/release_scripts/release_utils.py0000644000000000000000000000751212414772654020236 0ustar rootroot#! /usr/bin/python import sys import os import time import shutil from subprocess import Popen, PIPE ################################################################################ def execAndWait(cli_str, timeout=0, usepipes=True, cwd=None): """ There may actually still be references to this function where check_output would've been more appropriate. But I didn't know about check_output at the time... """ if isinstance(cli_str, (list, tuple)): cli_str = ' '.join(cli_str) print 'Executing:', '"' + cli_str + '"' if usepipes: process = Popen(cli_str, stdin=PIPE, stdout=PIPE, stderr=PIPE, shell=True, cwd=cwd) else: process = Popen(cli_str, shell=True, cwd=cwd) pid = process.pid start = time.time() while process.poll() == None: time.sleep(0.1) if timeout>0 and (time.time() - start)>timeout: print 'Process exceeded timeout, killing it' killProcess(pid) out,err = process.communicate() return [out,err] ################################################################################ # Copied from armoryengine.py def getVersionString(vquad, numPieces=4): vstr = '%d.%02d' % vquad[:2] if (vquad[2] > 0 or vquad[3] > 0) and numPieces>2: vstr += '.%d' % vquad[2] if vquad[3] > 0 and numPieces>3: vstr += '.%d' % vquad[3] return vstr def readVersionString(verStr): verList = [int(piece) for piece in verStr.split('.')] while len(verList)<4: verList.append(0) return tuple(verList) def getVersionInt(vquad, numPieces=4): vint = int(vquad[0] * 1e7) vint += int(vquad[1] * 1e5) if numPieces>2: vint += int(vquad[2] * 1e3) if numPieces>3: vint += int(vquad[3]) return vint ################################################################################ # Extract [osName, verStr, verInt, verType, ext] # Example ['winAll', '0.91.1', 91001000, 'rc1', '.exe'] def parseInstallerName(fn): pcs = fn.split('_') if not len(pcs)==3 or not pcs[0]=='armory': return None temp,verWhole,osNameExt = pcs[:] vpcs = verWhole.split('-') verStr = vpcs[0] verType = ('-'+vpcs[1]) if len(vpcs)>1 else '' epcs = osNameExt.split('.') osName = epcs[0] osExt = '.'.join(epcs[1:]) verQuad = readVersionString(verStr) verInt = getVersionInt(verQuad) return [osName, verStr, verInt, verType, osExt] ################################################################################ # Parse filenames to return the latest version number present (and assoc type) def getLatestVerFromList(filelist): latestVerInt = 0 latestVerStr = '' verType = '' # Find the highest version number for fn in filelist: fivevals = parseInstallerName(fn) if fivevals is None: continue; verstr,verint,vertype = fivevals[1:4] if verint>latestVerInt: latestVerInt = verint latestVerStr = verstr latestVerType = vertype return (latestVerInt, latestVerStr, latestVerType) ################################################################################ def getAllHashes(fnlist): hashes = [] for fn in fnlist: out,err = execAndWait('sha256sum %s' % fn) hashes.append([fn, out.strip().split()[0]]) return hashes ################################################################################ def checkExists(fullPath, onDNE='exit'): fullPath = os.path.expanduser(fullPath) if os.path.exists(fullPath): print 'Found file: %s' % fullPath else: print 'Path does not exist: %s' % fullPath if onDNE=='skip': return None elif onDNE=='exit': exit(1) return fullPath def makeOutputDir(dirpath, wipe=True): if os.path.exists(dirpath) and wipe: shutil.rmtree(dirpath) if not os.path.exists(dirpath): os.makedirs(dirpath) return dirpath armory-0.92.3/release_scripts/announcemap.txt0000644000000000000000000000020512414772654020061 0ustar rootrootbootstrap.dat.torrent bootstrap changelog.txt changelog dllinks.txt downloads notify.txt notify armory-0.92.3/release_scripts/Step2_Offline_PackageSigning.py0000644000000000000000000003316512414772654022772 0ustar rootroot#! /usr/bin/python # Take a directory full of things to be signed, and do the right thing. # Make sure you cert-sign the windows installers, first import os import time import shutil import getpass from sys import argv from subprocess import Popen, PIPE from release_utils import * ##### from release_settings import getReleaseParams, getMasterPackageList ##### if len(argv)<4: import textwrap print textwrap.dedent(""" Script Arguments (* is optional) argv[0] "python %s" argv[1] inputDir (from Step1) argv[2] outputDir (for Step3) argv[3] bundleDir argv[4] isTestingRelease (default ~ "0") argv[5]* git branch to tag (default ~ "master") argv[6]* use testing settings (default ~ "0") """) % argv[0] exit(1) # Process CLI args inDir = checkExists(argv[1]) outDir = argv[2] bundleDir = argv[3] isTestRelease = (len(argv)>4 and not argv[4]=="0") gitBranch = 'master' if len(argv)<5 else argv[5] testParams = (len(argv)>6 and not argv[6]=="0") outDir = makeOutputDir(outDir, wipe=False) masterPkgList = getMasterPackageList() RELEASE = getReleaseParams(testParams) # Other defaults -- same for all Armory releases builder = RELEASE['Builder'] gituser = RELEASE['GitUser'] gitemail = RELEASE['GitEmail'] signAddress = RELEASE['SignAddr'] announceName = RELEASE['AnnounceFile'] bucketPrefix = RELEASE['BucketPrefix'] bucketAnnounce = bucketPrefix + RELEASE['BucketAnnounce'] bucketReleases = bucketPrefix + RELEASE['BucketReleases'] gpgKeyID = RELEASE['GPGKeyID'] btcWltID = RELEASE['BTCWltID'] # Setup dual writing to console and log file writelog = open('step2_log.txt', 'w') def logprint(s): print s writelog.write(s + '\n') # Check that all the paths expected from step 1 actually exist srcGitRepo = checkExists(os.path.join(inDir, 'BitcoinArmory')) srcInstalls = checkExists(os.path.join(inDir, 'installers')) srcAnnounce = checkExists(os.path.join(inDir, 'unsignedannounce')) srcRelease = checkExists(os.path.join(inDir, 'release_scripts')) srcCoreSHA = checkExists(os.path.join(inDir, 'SHA256SUMS.asc'), 'skip') # Check that all the paths expected from step 1 actually exist dstGitRepo = os.path.join(outDir, 'BitcoinArmory') dstInstalls = makeOutputDir(os.path.join(outDir, 'installers')) dstAnnounce = makeOutputDir(os.path.join(outDir, 'signedannounce')) dstRelease = makeOutputDir(os.path.join(outDir, 'release_scripts')) # Scan the list of files in installers dir to get latest instList = [fn for fn in os.listdir(srcInstalls)] topVerInt,topVerStr,topVerType = getLatestVerFromList(instList) # A shortcut to get the full path of the installer filename for a given pkg def getSrcPath(pkgName, suffixStr='FileSuffix'): pkgSuffix = masterPkgList[pkgName][suffixStr] fname = 'armory_%s%s_%s' % (topVerStr, topVerType, pkgSuffix) return os.path.join(srcInstalls, fname) def getDstPath(pkgName, suffixStr='FileSuffix'): if pkgName=='SHAFILE_TXT': pkgSuffix = 'sha256sum.txt' elif pkgName=='SHAFILE_ASC': pkgSuffix = 'sha256sum.txt.asc' else: pkgSuffix = masterPkgList[pkgName][suffixStr] fname = 'armory_%s%s_%s' % (topVerStr, topVerType, pkgSuffix) return os.path.join(dstInstalls, fname) # Check that all the master packages exist, as well as any bundle dirs for pkgName,pkgInfo in masterPkgList.iteritems(): checkExists(getSrcPath(pkgName)) logprint('Regular pacakge "%s": %s' % (pkgName.ljust(20), getSrcPath(pkgName))) if pkgInfo['HasBundle']: logprint('Offline bundle "%s": %s' % (pkgName.ljust(20), pkgInfo['BundleDeps'])) checkExists(os.path.join(bundleDir, pkgInfo['BundleDeps'])) # Check for wallet in ARMORY_HOME_DIR wltPath = checkExists('~/.armory/armory_%s_.wallet' % btcWltID) logprint('*'*80) logprint('Please confirm all parameters before continuing:') logprint(' Dir with all the installers: "%s"' % srcInstalls) logprint(' Dir with announcement data : "%s"' % srcAnnounce) logprint(' Dir with fresh git checkout: "%s"' % srcGitRepo) logprint(' Path to Bitcoin Core SHA256: "%s"' % str(srcCoreSHA)) logprint(' Detected Version Integer : "%s"' % topVerInt) logprint(' Detected Version String : "%s"' % topVerStr) logprint(' This is release of type : "%s"' % topVerType) logprint(' Use the following GPG key : "%s"' % gpgKeyID) logprint(' Use the following wallet : "%s"' % wltPath) logprint(' Builder for signing deb : "%s"' % builder) logprint(' Git branch to be signed is : "%s"' % gitBranch) logprint(' Git user to tag release : "%s" / <%s>' % (gituser, gitemail)) if srcCoreSHA: logprint('\n'*2) logprint('*'*80) logprint('Output of gpg-verify on SHA256SUMS') logprint(execAndWait('gpg -v %s' % srcCoreSHA)[0]) logprint('*'*80) logprint('Contents of SHA256SUM.asc:') logprint(open(srcCoreSHA,'r').read()) logprint('*'*80) logprint('Contents of dllinks.txt (to be signed):') logprint(open(os.path.join(srcAnnounce, 'dllinks.txt'),'r').read()) logprint('\n') if raw_input('Visually verify -- good? [Y/n]: ').lower().startswith('n'): exit(1) reply = raw_input('Does all this look correct? [Y/n]') if reply.lower().startswith('n'): logprint('User aborted') exit(0) logprint('*'*80) logprint('') # First thing: sign all debs logprint('Signing all .deb files:') for pkgName in masterPkgList: pkgSrc = getSrcPath(pkgName) pkgDst = getDstPath(pkgName) shutil.copy(pkgSrc, pkgDst) if pkgDst.endswith('.deb'): logprint('Signing: ' + pkgDst) cmd = 'dpkg-sig -s builder -m "%s" -k %s %s' % (builder, gpgKeyID, pkgDst) logprint('EXEC: ' + cmd) execAndWait(cmd) logprint(execAndWait('dpkg-sig --verify %s' % pkgDst)[0]) ################################################################################ logprint('Creating bundles:') for pkgName,pkgInfo in masterPkgList.iteritems(): if not pkgInfo['HasBundle']: continue bpath = getDstPath(pkgName, 'BundleSuffix') tempDir = 'OfflineBundle' if os.path.exists(tempDir): logprint('Removing temp bundle directory: ' + tempDir) shutil.rmtree(tempDir) logprint('\tCopying bundle dependencies') shutil.copytree(os.path.join(bundleDir, pkgInfo['BundleDeps']), tempDir) shutil.copy(getSrcPath(pkgName), tempDir) execAndWait('tar -zcf %s %s/*' % (bpath, tempDir)) if os.path.exists(tempDir): logprint('Removing temp bundle directory: ' + tempDir) shutil.rmtree(tempDir) # Finally, create the signed hashes file filesToSign = [] for pkgName,pkgInfo in masterPkgList.iteritems(): filesToSign.append(getDstPath(pkgName)) if pkgInfo['HasBundle']: filesToSign.append(getDstPath(pkgName, 'BundleSuffix')) logprint('All files to be included in hashes file:') for f in filesToSign: logprint(' ' + f) newHashes = getAllHashes(filesToSign) #hashname = 'armory_%s%s_sha256sum.txt' % (topVerStr, topVerType) #hashname = getDstPath('SHAFILE_TXT') #hashpath = os.path.join(dstInstalls, hashname) hashpath = getDstPath('SHAFILE_TXT') with open(hashpath, 'w') as hashfile: for fn,sha2 in newHashes: basefn = os.path.basename(fn) logprint(' ' + sha2 + ' ' + basefn) hashfile.write('%s %s\n' % (sha2,basefn)) hashfile.write('\n') execAndWait('gpg -sa --clearsign --digest-algo SHA256 %s ' % hashpath) os.remove(hashpath) ################################################################################ ################################################################################ # Now update the announcements (require armoryengine) sys.path.append('/usr/lib/armory') from armoryengine.ALL import PyBtcWallet, binary_to_hex, hex_to_binary, \ SecureBinaryData, addrStr_to_hash160, sha256, \ ADDRBYTE from jasvet import ASv1CS, readSigBlock, verifySignature origDLFile = os.path.join(srcAnnounce, 'dllinks.txt') newDLFile = os.path.join(srcAnnounce, 'dllinks_temp.txt') announcePath = os.path.join(dstAnnounce, announceName) # Checking that wallet has signing key, and user can unlock wallet wlt = PyBtcWallet().readWalletFile(wltPath) if not wlt.hasAddr(signAddress): print 'Supplied wallet does not have the correct signing key' exit(1) print 'Must unlock wallet to sign the announce file...' while True: passwd = SecureBinaryData(getpass.getpass('Wallet passphrase: ')) if not wlt.verifyPassphrase(passwd): print 'Invalid passphrase!' continue break wlt.unlock(securePassphrase=passwd) passwd.destroy() addrObj = wlt.getAddrByHash160(addrStr_to_hash160(signAddress)[1]) def doSignFile(inFile, outFile): with open(inFile, 'rb') as f: sigBlock = ASv1CS(addrObj.binPrivKey32_Plain.toBinStr(), f.read()) with open(outFile, 'wb') as f: f.write(sigBlock) def getFileHash(baseDir, fname): fullpath = os.path.join(baseDir, fn) with open(fullpath, 'rb') as fdata: return binary_to_hex(sha256(fdata.read())) # Now compute the hashes of the files in the signed-installer dir, write out fnew = open(newDLFile, 'w') fnew.write(open(origDLFile, 'r').read()) fnew.write('\n') typeSuffix = 'Testing' if isTestRelease else '' for pkgName,pkgInfo in masterPkgList.iteritems(): fn = 'armory_%s%s_%s' % (topVerStr, topVerType, pkgInfo['FileSuffix']) outputStr = ['Armory%s' % typeSuffix, topVerStr, pkgInfo['OSNameLink'], pkgInfo['OSVarLink'], pkgInfo['OSArchLink'], os.path.join(bucketReleases, fn), getFileHash(dstInstalls, fn)] fnew.write(' '.join(outputStr) + '\n') if pkgInfo['HasBundle']: # Note different 4th arg for OSVar -- because bundles have different reqts fn = 'armory_%s%s_%s' % (topVerStr, topVerType, pkgInfo['BundleSuffix']) outputStr = ['ArmoryOffline%s' % typeSuffix, topVerStr, pkgInfo['OSNameLink'], pkgInfo['BundleDLLVar'], pkgInfo['OSArchLink'], os.path.join(bucketReleases, fn), getFileHash(dstInstalls, fn)] fnew.write(' '.join(outputStr) + '\n') fnew.write('\n') fnew.close() fileMappings = {} longestID = 0 longestURL = 0 print 'Reading file mapping...' with open('announcemap.txt','r') as f: for line in f.readlines(): fname, fid = line.strip().split() inputPath = os.path.join(srcAnnounce, fname) if not os.path.exists(inputPath): print 'ERROR: Could not find %s-file (%s)' % (fid, inputPath) exit(1) print ' Map: %s --> %s' % (fname, fid) print 'Signing and copying files to %s directory...' % dstAnnounce with open('announcemap.txt','r') as f: for line in f.readlines(): fname, fid = line.strip().split() inputPath = os.path.join(srcAnnounce, fname) outputPath = os.path.join(dstAnnounce, fname) # If we're using a modified DL file if fname=='dllinks.txt': inputPath = newDLFile if fname.endswith('.txt'): doSignFile(inputPath, outputPath) else: shutil.copy(inputPath, outputPath) fdata = open(outputPath, 'rb').read() fhash = binary_to_hex(sha256(fdata)) fileMappings[fname] = [fid, fhash] longestID = max(longestID, len(fid)) longestURL = max(longestURL, len(bucketAnnounce + fname)) print 'Creating digest file...' digestFile = open(announcePath, 'w') ### for fname,vals in fileMappings.iteritems(): fid = vals[0].ljust(longestID + 3) url = (bucketAnnounce + fname).ljust(longestURL + 3) fhash = vals[1] digestFile.write('%s %s %s\n' % (fid, url, fhash)) digestFile.close() print '' print '------' with open(announcePath, 'r') as f: dfile = f.read() print dfile print '------' print 'Please verify the above data to your satisfaction:' raw_input('Hit when ready: ') doSignFile(announcePath, os.path.join(dstAnnounce, announceName)) print '*'*80 print open(announcePath, 'r').read() print '*'*80 print '' print 'Verifying files' for fname,vals in fileMappings.iteritems(): if 'bootstrap' in fname: continue with open(os.path.join(dstAnnounce, fname), 'rb') as f: sig,msg = readSigBlock(f.read()) addrB58 = verifySignature(sig, msg, 'v1', ord(ADDRBYTE)) print 'Sign addr for:', vals[0].ljust(longestID+3), addrB58 print 'Done!' ################################################################################ # GIT SIGN gittag = 'v%s%s' % (topVerStr, topVerType) logprint('*'*80) logprint('About to tag and sign git repo with:') logprint(' Tag: ' + gittag) logprint(' User: ' + gituser) logprint(' Email: ' + gitemail) gitmsg = raw_input('Put your commit message here: ') if os.path.exists(dstGitRepo): shutil.rmtree(dstGitRepo) shutil.copytree(srcGitRepo, dstGitRepo) os.chdir(dstGitRepo) execAndWait('git checkout %s' % gitBranch, cwd=dstGitRepo) execAndWait('git config user.name "%s"' % gituser, cwd=dstGitRepo) execAndWait('git config user.email %s' % gitemail, cwd=dstGitRepo) execAndWait('git tag -s %s -u %s -m "%s"' % (gittag, gpgKeyID, gitmsg), cwd=dstGitRepo) out,err = execAndWait('git tag -v %s' % gittag, cwd=dstGitRepo) logprint(out) logprint(err) ################################################################################ # Copy the release scripts over to the output dir to make sure Step3 has them shutil.copytree(srcRelease, dstRelease) logprint('*'*80) #logprint('CLEAN UP & BUNDLE EVERYTHING TOGETHER') #toExport = instFiles[:] #toExport.append(hashpath + '.asc') #toExport.append("%s" % dstGitRepo) #execAndWait('tar -zcf signed_release_%s%s.tar.gz %s' % (topVerStr, topVerType, ' '.join(toExport))) armory-0.92.3/release_scripts/README.txt0000644000000000000000000002457312414772654016530 0ustar rootrootBuild & Release Process for Armory This directory contains a variety of scripts that will be used to compile, bundle, sign, and upload new releases of Armory. There are three scripts because it is assumed that the signing keys are offline, requiring something similar to an offline transaction: create everything online, take offline for signing, take online again to broadcast (upload to Amazon S3). The following is assumed to have been done already before starting this process: - Local & remote machines and VMs have compiled & bundled installers - release_settings.py file that returns nested dictionary of all release/installer information (see example at end of this doc) - Each remote system has our public key in its authorized_keys file - Offline computer has GPG key & Armory wallet spec'd at top of Step2 script - All announce files are updated (except for dllinks which will be updated by the script itself once files are signed and hashes are known) - The Step2 script contains an accurate list of everything file/installer - The computer running Step3 has write-access to the git repo, and a configuration file with API key for uploading results to Amazon S3 - Directories on the offline computer containing dependencies for each OS-specific offline-bundle - Already have an installed version of Armory offline in the /usr/lib/armory directory, to be used for creating signature blocks The output of this process will be: - Signed git tag that can be pushed to the repo - All .deb installers will be signed using dpkg-sig - Offline bundles using the signed deb files - GPG-signed hashes file including all regular installers and offline bundles - Append URLs and hashes to dllinks.txt - New announce.txt file that contains URLs and hashes of all notify files signed by offline BITCOIN private key - Full list of URLs of uploaded installers & bundles in HTML and forum markdown, for easy updating of website and forum posts ----- Step1 Script: Fetch all the installers, and do a fresh checkout of the repo. It should also include updates to the announcement files After that, put everything into a single directory that can be copied to a USB key to be taken to the offline computer. Script Arguments (* is optional) argv[0] <> argv[1] version string, "0.91.1" argv[2] version type, "-testing", "-beta", "" argv[3]* output directory (default ~ ./exportToOffline) argv[4]* unsigned announce dir (default ~ ./unsignedannounce) argv[5]* Bitcoin Core SHA256SUMS.asc (default ~ "None") argv[7]* use testing settings (default ~ "0") Script Output: /BitcoinArmory (clone of repo) /release_scripts (copy of release_scripts dir from repo) /installers (all non-offline-bundle packages) /unsignedannounce (all unsigned announcement files) /SHA256SUMS.asc (if present) Note the release_scripts dir is itself copied because it has release_settings.py which is needed by all three steps. Plus, we most likely made tweaks to these Step* scripts to support the current release, and it wouldn't be in the cloned repo yet. After the release is successful, we commit the updated scripts as the basis for the next release. ----- Step2 Script: This script will be executed from the release_scripts directory above -- we will copy the directory to the offline computer, then cd into it then run Step2 script from there. It does not depend on the cloned repo -- it adds /usr/lib/armory to sys.path, to use the currently installed version of Armory for any non-generic-python operations. Script Arguments (* is optional) argv[0] <> argv[1] inputDir (from Step1) argv[2] outputDir (for Step3) argv[3] bundleDir argv[6]* git branch to tag (default ~ "master") argv[7]* use testing settings (default ~ 0) Script Output: /BitcoinArmory (same repo but with signed tag v0.91.1) /release_scripts (same copy, unmodified) /installers (signed, now includes offline bundles) /announceFiles (all txt signed, added announce.txt) The "bundleDir" should contain one directory for everything in the master package list that "hasBundle==True". It's "BundleDeps" will be the name of the directory that the Step 2 script will look for. The bundle deps dir will contain all dependencies (all of them .debs, as of this writing), as well as a script that installs everything including the package itself. i.e. Step2 script will make a copy of the bundle deps, it will copy the signed installer into the copy, and then tar it all up. The bundle deps dir should have, in addition to the deps themselves, a script that will install everything in that directory including the signed package. The testing settings use a different GPG key, BTC key, and different bucket for uploading ----- Step 3 Script: Will expect to find the three directories above with signed data. It will actually execute verification of all signatures, though you will have to manually verify the output before continuing. After that, it will attempt to upload everything. It expects to find the .s3cmd configuration file, already setup with your S3 API key to be able to upload files to the BitoinArmory-releases bucket. It will do the following: Script Arguments (* is optional) argv[0] <> argv[1] inputDir (from Step2) argv[2]* isDryRun (default ~ False) Script Output: -- Upload all installers and offline bundles to BitcoinArmory-releases -- Upload all announce files to BitcoinArmory-media bucket -- Ask if you'd like to push the latest git tag (if this is a testing version, you may not want to push the tag) ################################################################################ # # # Example release_settings.py file # # # # Provides dictionaries "getReleaseParams" and "getMasterPackageList" # # # ################################################################################ #! /usr/bin/python import os def getReleaseParams(doTest=False): rparams = {} rparams['Builder'] = 'Armory Technologies, Inc.' rparams['GitUser'] = 'Armory Technologies, Inc.' rparams['GitEmail'] = 'contact@bitcoinarmory.com' if not doTest: rparams['SignAddr'] = '1NWvhByxfTXPYNT4zMBmEY3VL8QJQtQoei' rparams['AnnounceFile'] = 'announce.txt' rparams['BucketAnnounce'] = 'https://s3.amazonaws.com/bitcoinarmory-media/' rparams['BucketReleases'] = 'https://s3.amazonaws.com/bitcoinarmory-releases/' rparams['GPGKeyID'] = '98832223' rparams['BTCWltID'] = '2DTq89wvw' else: rparams['SignAddr'] = '1PpAJyNoocJt38Vcf4AfPffaxo76D4AAEe' rparams['AnnounceFile'] = 'testannounce.txt' rparams['BucketAnnounce'] = 'https://s3.amazonaws.com/bitcoinarmory-testing/' rparams['BucketReleases'] = 'https://s3.amazonaws.com/bitcoinarmory-testing/' rparams['GPGKeyID'] = 'FB596985' rparams['BTCWltID'] = '2XqAdZZ8B' return rparams def getMasterPackageList(): masterPkgList = {} m = masterPkgList pkg = 'Windows (All)' m[pkg] = {} m[pkg]['FetchFrom'] = ['cp', '~/windows_share/armory_%s_win32.exe'] m[pkg]['FileSuffix'] = 'winAll.exe' m[pkg]['OSNameDisp'] = 'Windows' m[pkg]['OSVarDisp'] = 'XP, Vista, 7, 8+' m[pkg]['OSArchDisp'] = '32- and 64-bit' m[pkg]['OSNameLink'] = 'Windows' m[pkg]['OSVarLink'] = 'XP,Vista,7,8,8.1' m[pkg]['OSArchLink'] = '32,64' m[pkg]['HasBundle'] = False pkg = 'MacOSX (All)' m[pkg] = {} m[pkg]['FetchFrom'] = ['scp', 'joeschmoe', '192.168.1.22', 22, '~/BitcoinArmory/osxbuild/armory_%s_osx.tar.gz'] m[pkg]['FileSuffix'] = 'osx.tar.gz' m[pkg]['OSNameDisp'] = 'MacOSX' m[pkg]['OSVarDisp'] = '10.7+' m[pkg]['OSArchDisp'] = '64bit' m[pkg]['OSNameLink'] = 'MacOSX' m[pkg]['OSVarLink'] = '10.7,10.8,10.9,10.9.1,10.9.2' m[pkg]['OSArchLink'] = '64'' m[pkg]['HasBundle'] = False pkg = 'Ubuntu 12.04-32bit' m[pkg] = {} m[pkg]['FetchFrom'] = ['scp', 'guest', 'buildmachine1', 3822, '~/buildenv/armory_%s-1_i386.deb'] m[pkg]['FileSuffix'] = 'ubuntu-32bit.deb' m[pkg]['OSNameDisp'] = 'Ubuntu' m[pkg]['OSVarDisp'] = '12.04+' m[pkg]['OSArchDisp'] = '32bit' m[pkg]['OSNameLink'] = 'Ubuntu' m[pkg]['OSVarLink'] = '12.04,12.10,13.04,13.10,14.04' m[pkg]['OSArchLink'] = '32' m[pkg]['HasBundle'] = True m[pkg]['BundleDeps'] = 'offline_deps_ubuntu32' m[pkg]['BundleSuffix'] = 'offline_ubuntu_12.04-32.tar.gz' m[pkg]['BundleOSVar'] = '12.04 exact' m[pkg]['BundleDLLVar'] = '12.04' pkg = 'Ubuntu 12.04-64bit' m[pkg] = {} m[pkg]['FetchFrom'] = ['scp', 'guest', '192.168.0.83', 1899, '~/buildenv/armory_%s-1_amd64_osx.deb'] m[pkg]['FileSuffix'] = 'ubuntu-64bit.deb' m[pkg]['OSNameDisp'] = 'Ubuntu' m[pkg]['OSVarDisp'] = '12.04+' m[pkg]['OSArchDisp'] = '64bit' m[pkg]['OSNameLink'] = 'Ubuntu' m[pkg]['OSVarLink'] = '12.04,12.10,13.04,13.10,14.04' m[pkg]['OSArchLink'] = '64' m[pkg]['HasBundle'] = True m[pkg]['BundleDeps'] = 'offline_deps_ubuntu64' m[pkg]['BundleSuffix'] = 'offline_ubuntu_12.04-64.tar.gz' m[pkg]['BundleOSVar'] = '12.04 exact' m[pkg]['BundleDLLVar'] = '12.04' pkg = 'RaspberryPi' m[pkg] = {} m[pkg]['FetchFrom'] = ['cp', '~/buildenv/rpibuild/armory_%s-1.tar.gz'] m[pkg]['FileSuffix'] = 'raspbian-armhf.tar.gz' m[pkg]['OSNameDisp'] = 'Raspbian' m[pkg]['OSVarDisp'] = None m[pkg]['OSArchDisp'] = 'armhf' m[pkg]['OSNameLink'] = 'RaspberryPi' m[pkg]['OSVarLink'] = None m[pkg]['OSArchLink'] = '32' m[pkg]['HasBundle'] = True m[pkg]['BundleDeps'] = 'offline_deps_raspbian' m[pkg]['BundleSuffix'] = 'rpi_bundle.tar.gz' m[pkg]['BundleOSVar'] = None m[pkg]['BundleDLLVar'] = 'Raspbian' return masterPkgList armory-0.92.3/release_scripts/Step1_Online_PrepareForSigning.py0000644000000000000000000000455112414772654023342 0ustar rootroot# stub import subprocess import os import time import shutil import ast from sys import argv from release_utils import * ##### from release_settings import getReleaseParams, getMasterPackageList ##### masterPkgList = getMasterPackageList() CLONE_URL = 'https://github.com/etotheipi/BitcoinArmory.git' if len(argv)<3: import textwrap print textwrap.dedent(""" Script Arguments (* is optional) argv[0] "python %s" argv[1] version string, "0.91.1" argv[2] version type, "-testing", "-beta", "" argv[3]* output directory (default ~ ./exportToOffline) argv[4]* unsigned announce dir (default ~ ./unsignedannounce) argv[5]* Bitcoin Core SHA256SUMS.asc (default ~ "None") """) % argv[0] exit(1) print argv verStr = argv[1] verType = argv[2] outDir = argv[3] if len(argv)>3 else './exportToOffline' annSrc = argv[4] if len(argv)>4 else './unsignedannounce' shaCore = argv[5] if len(argv)>5 else None instDst = os.path.join(outDir, 'installers') cloneDir = os.path.join(outDir, 'BitcoinArmory') rscrDir = os.path.join(outDir, 'release_scripts') annDst = os.path.join(outDir, 'unsignedannounce') if os.path.exists(outDir): shutil.rmtree(outDir) os.makedirs(instDst) # will create outdir and installers dir # Check that unsigned announcements dir exists checkExists(annSrc) # Throw in the Bitcoin Core hashes file if supplied if shaCore is not None: checkExists(shaCore) shutil.copy(shaCore, os.path.join(outDir,'SHA256SUMS.asc')) # Grab the list of scp and cp commands from fetchlist for pkgName,pkgInfo in masterPkgList.iteritems(): fetchCmd = pkgInfo['FetchFrom'] cmd,cmdArgs = fetchCmd[0],fetchCmd[1:] localFn = 'armory_%s%s_%s' % (verStr, verType, pkgInfo['FileSuffix']) copyTo = os.path.join(instDst, localFn) if cmd=='cp': assert(len(cmdArgs)==1) copyFrom = checkExists(cmdArgs[0] % verStr) print 'Copying: %s --> %s' % (copyFrom, copyTo) shutil.copy(copyFrom, copyTo) if cmd=='scp': assert(len(cmdArgs)==4) usr,ip,port,src = cmdArgs remoteSrc = src % verStr hostPath = '%s@%s:%s' % (usr, ip, remoteSrc) execAndWait(['scp', '-P', str(port), hostPath, copyTo]) execAndWait(['git', 'clone', CLONE_URL, cloneDir]) shutil.copytree('../release_scripts', rscrDir) shutil.copytree(annSrc, annDst) armory-0.92.3/release_scripts/googlecode_upload_release.py0000644000000000000000000003174512414772654022556 0ustar rootroot#!/usr/bin/env python # # Copyright 2006, 2007 Google Inc. All Rights Reserved. # Author: danderson@google.com (David Anderson) # # Script for uploading files to a Google Code project. # # This is intended to be both a useful script for people who want to # streamline project uploads and a reference implementation for # uploading files to Google Code projects. # # To upload a file to Google Code, you need to provide a path to the # file on your local machine, a small summary of what the file is, a # project name, and a valid account that is a member or owner of that # project. You can optionally provide a list of labels that apply to # the file. The file will be uploaded under the same name that it has # in your local filesystem (that is, the "basename" or last path # component). Run the script with '--help' to get the exact syntax # and available options. # # Note that the upload script requests that you enter your # googlecode.com password. This is NOT your Gmail account password! # This is the password you use on googlecode.com for committing to # Subversion and uploading files. You can find your password by going # to http://code.google.com/hosting/settings when logged in with your # Gmail account. If you have already committed to your project's # Subversion repository, the script will automatically retrieve your # credentials from there (unless disabled, see the output of '--help' # for details). # # If you are looking at this script as a reference for implementing # your own Google Code file uploader, then you should take a look at # the upload() function, which is the meat of the uploader. You # basically need to build a multipart/form-data POST request with the # right fields and send it to https://PROJECT.googlecode.com/files . # Authenticate the request using HTTP Basic authentication, as is # shown below. # # Licensed under the terms of the Apache Software License 2.0: # http://www.apache.org/licenses/LICENSE-2.0 # # Questions, comments, feature requests and patches are most welcome. # Please direct all of these to the Google Code users group: # http://groups.google.com/group/google-code-hosting # ################################################################################ # # Script downloaded from code.google.com and adapted for uploading # new Armory releases. It is included simply for my own convenience # having this backed up # ################################################################################ """Google Code file uploader script. """ __author__ = 'danderson@google.com (David Anderson)' import httplib import os.path import optparse import getpass import base64 import sys def upload(file, project_name, user_name, password, summary, labels=None): """Upload a file to a Google Code project's file server. Args: file: The local path to the file. project_name: The name of your project on Google Code. user_name: Your Google account name. password: The googlecode.com password for your account. Note that this is NOT your global Google Account password! summary: A small description for the file. labels: an optional list of label strings with which to tag the file. Returns: a tuple: http_status: 201 if the upload succeeded, something else if an error occured. http_reason: The human-readable string associated with http_status file_url: If the upload succeeded, the URL of the file on Google Code, None otherwise. """ # The login is the user part of user@gmail.com. If the login provided # is in the full user@domain form, strip it down. if user_name.endswith('@gmail.com'): user_name = user_name[:user_name.index('@gmail.com')] form_fields = [('summary', summary)] if labels is not None: form_fields.extend([('label', l.strip()) for l in labels]) content_type, body = encode_upload_request(form_fields, file) upload_host = '%s.googlecode.com' % project_name upload_uri = '/files' auth_token = base64.b64encode('%s:%s'% (user_name, password)) headers = { 'Authorization': 'Basic %s' % auth_token, 'User-Agent': 'Googlecode.com uploader v0.9.4', 'Content-Type': content_type, } server = httplib.HTTPSConnection(upload_host) server.request('POST', upload_uri, body, headers) resp = server.getresponse() server.close() if resp.status == 201: location = resp.getheader('Location', None) else: location = None return resp.status, resp.reason, location def encode_upload_request(fields, file_path): """Encode the given fields and file into a multipart form body. fields is a sequence of (name, value) pairs. file is the path of the file to upload. The file will be uploaded to Google Code with the same file name. Returns: (content_type, body) ready for httplib.HTTP instance """ BOUNDARY = '----------Googlecode_boundary_reindeer_flotilla' CRLF = '\r\n' body = [] # Add the metadata about the upload first for key, value in fields: body.extend( ['--' + BOUNDARY, 'Content-Disposition: form-data; name="%s"' % key, '', value, ]) # Now add the file itself file_name = os.path.basename(file_path) f = open(file_path, 'rb') file_content = f.read() f.close() body.extend( ['--' + BOUNDARY, 'Content-Disposition: form-data; name="filename"; filename="%s"' % file_name, # The upload server determines the mime-type, no need to set it. 'Content-Type: application/octet-stream', '', file_content, ]) # Finalize the form body body.extend(['--' + BOUNDARY + '--', '']) return 'multipart/form-data; boundary=%s' % BOUNDARY, CRLF.join(body) def upload_find_auth(file_path, project_name, summary, labels=None, user_name=None, password=None, tries=3): """Find credentials and upload a file to a Google Code project's file server. file_path, project_name, summary, and labels are passed as-is to upload. Args: file_path: The local path to the file. project_name: The name of your project on Google Code. summary: A small description for the file. labels: an optional list of label strings with which to tag the file. config_dir: Path to Subversion configuration directory, 'none', or None. user_name: Your Google account name. tries: How many attempts to make. """ if user_name is None or password is None: from netrc import netrc authenticators = netrc().authenticators("code.google.com") if authenticators: if user_name is None: user_name = authenticators[0] if password is None: password = authenticators[2] while tries > 0: if user_name is None: # Read username if not specified or loaded from svn config, or on # subsequent tries. sys.stdout.write('Please enter your googlecode.com username: ') sys.stdout.flush() user_name = sys.stdin.readline().rstrip() if password is None: # Read password if not loaded from svn config, or on subsequent tries. print 'Please enter your googlecode.com password.' print '** Note that this is NOT your Gmail account password! **' print 'It is the password you use to access Subversion repositories,' print 'and can be found here: http://code.google.com/hosting/settings' password = getpass.getpass() status, reason, url = upload(file_path, project_name, user_name, password, summary, labels) # Returns 403 Forbidden instead of 401 Unauthorized for bad # credentials as of 2007-07-17. if status in [httplib.FORBIDDEN, httplib.UNAUTHORIZED]: # Rest for another try. user_name = password = None tries = tries - 1 else: # We're done. break return status, reason, url # Copied from armoryengine.py def getVersionString(vquad, numPieces=4): vstr = '%d.%02d' % vquad[:2] if (vquad[2] > 0 or vquad[3] > 0) and numPieces>2: vstr += '.%d' % vquad[2] if vquad[3] > 0 and numPieces>3: vstr += '.%d' % vquad[3] return vstr def readVersionString(verStr): verList = [int(piece) for piece in verStr.split('.')] while len(verList)<4: verList.append(0) return tuple(verList) def getVersionInt(vquad, numPieces=4): vint = int(vquad[0] * 1e7) vint += int(vquad[1] * 1e5) if numPieces>2: vint += int(vquad[2] * 1e3) if numPieces>3: vint += int(vquad[3]) return vint def main(): print '' print '-'*80 print 'Executing upload script for bitcoinarmory.googlecode.com...' parser = optparse.OptionParser(usage='googlecode-upload.py [--dryrun] dirFilesToUpload') parser.add_option("--dryrun", dest="dryrun", default=False, action="store_true", \ help="Detect and parse files to upload without actually executing the upload") parser.add_option("--testver", dest="testver", default=False, action="store_true", \ help="Uploading a testing version; Only windows installers") options, args = parser.parse_args() if len(args)==0: print 'ERROR: must supply directory containing new installers to upload' return if not os.path.exists(args[0]): print 'ERROR: supplied path does not exist! %s' % args[0] return theDir = args[0] latestVersion = 0 latestVerStr = None for fname in os.listdir(theDir): if fname.endswith('.msi') or fname.endswith('.deb'): try: verQuad = readVersionString(fname.split('_')[1].split('-')[0]) verInt = getVersionInt(verQuad) if verInt > latestVersion: latestVersion = verInt latestVerStr = getVersionString(verQuad) except: print 'WARNING: Could not parse installer filename: %s' % fname continue verstr = '%s-beta' % latestVerStr if options.testver: verstr = '%s-testing' % latestVerStr print 'Latest version detected: ', verstr print '-'*80 print '' prefix = 'armory_' suffix = [['_amd64.deb', 'Version %s for Ubuntu/Debian 64-bit', ['DebianPackage', 'OS-Linux64']], \ ['_i386.deb', 'Version %s for Ubuntu/Debian 32-bit', ['DebianPackage', 'OS-Linux32']], \ ['_win64.msi', 'Version %s for Windows 64-bit', ['WindowsMSI', 'OS-Win64']], \ ['_win32.msi', 'Version %s for Windows 32- and 64-bit', ['WindowsMSI', 'OS-Win32']], \ ['_OSX.dmg', 'Version %s for Mac/OSX 10.8+', ['MacosxDMG', 'OS-MacOSX']], \ ['_sha256sum.txt.asc', 'Version %s SHA256 hashes of installers',['HashesSHA256']], \ ['_OfflineBundle_Ubuntu-10.04-32bit.tar.gz', 'Version %s Offline Bundle for Ubuntu 10.04-32bit', \ ['DebianPackage', 'OS-Linux32', 'Offline']], \ ['_OfflineBundle_Ubuntu-10.04-64bit.tar.gz', 'Version %s Offline Bundle for Ubuntu 10.04-64bit', \ ['DebianPackage', 'OS-Linux64', 'Offline']]] urlSummList = [] password = getpass.getpass('Enter your googlecode password: ') for suf,summ,lbls in suffix: basename = prefix + verstr + suf fullpath = os.path.join(theDir, basename) if options.testver: # Only Windows pkgs uploaded for testing ver. Linux can compile. if '.deb' in basename: continue else: # Change "Version..." to "Testing version..." summ = 'Testing v' + summ[1:] summary = summ % verstr if not os.path.exists(fullpath): print 'ERROR: Could not find installer to upload: %s', fullpath continue if not options.dryrun: # Disabled for testing, just in case I forget --dryrun status, reason, url = upload_find_auth( fullpath, 'bitcoinarmory', summary, lbls, 'etotheipi', password) if url.startswith('http') and not url.startswith('https:'): print 'Original URL:', url url = 'https' + url[4:] print 'New URL: ', url else: print 'Dryun requested, no actual upload performed' url = 'https://bitcoinarmory.googlecode.com/files/%s' % basename urlSummList.append([url, summary]) if not url: print 'An error occurred. Your file was not uploaded.' print 'Google Code upload server said: %s (%s)' % (reason, status) print '' print '-'*80 print 'Printing forum-formatted links to uploaded installers' for url,summary in urlSummList: print '[url=%s]%s[/url]' % (url, summary) print '' print '-'*80 print 'Printing html/href links to include on webpage:' for url,summary in urlSummList: print '%s' % (url, summary) print '-'*80 if __name__ == '__main__': sys.exit(main()) armory-0.92.3/release_scripts/signannounce.py0000644000000000000000000001474012414772654020066 0ustar rootrootimport sys import os import getpass import shutil sys.path.append('..') sys.path.append('/usr/lib/armory') from armoryengine.ALL import * from jasvet import ASv1CS, readSigBlock, verifySignature def signAnnounceFiles(wltPath): if len(CLI_ARGS)<1: print 'Must specify a wallet file containing the signing key' exit(1) wltPath = CLI_ARGS[0] if not os.path.exists(wltPath): print 'Wallet file was not found (%s)' % wltPath exit(1) inDir = 'unsignedAnnounce' outDir = 'signedAnnounce' origDLFile = os.path.join(inDir, 'dllinks.txt') newDLFile = os.path.join(inDir, 'dllinks_temp.txt') ################################################################################ ################################################################################ # We may need to compute some installer hashes doComputeDLLinks = (len(CLI_ARGS)>1) if doComputeDLLinks: instDir = CLI_ARGS[1] if not os.path.exists(instDir): print 'Installers dir does not exist!' exit(1) instFileInfo = {} with open('dlmap.txt','r') as f: dlmapLines = [line.strip() for line in f.readlines()] verName, verStr, urlPrefix = dlmapLines[0].split() for line in dlmapLines[2:]: fn,opsys,osver,osarch = line.replace('%ver',verStr).split() instFileInfo[fn] = [opsys, osver, osarch] OS,OSVER,OSARCH = range(3) with open(newDLFile, 'w') as f: # Write the existing data from rawfiles/dllinks into temp file f.write(open(origDLFile, 'r').read()) f.write('\n') # Now compute hashes of each installer and write info to temp file for fn in os.listdir(instDir): fullpath = os.path.join(instDir, fn) if not fn in instFileInfo: print 'File in installer directory does not match any in info map' print ' File:', fullpath print ' InfoMap:' for filename in instFileInfo: print ' ', filename exit(1) fdata = open(fullpath, 'rb').read() fhash = binary_to_hex(sha256(fdata)) outputStr = [verName, verStr, instFileInfo[fn][OS], instFileInfo[fn][OSVER], instFileInfo[fn][OSARCH], os.path.join(urlPrefix, fn), fhash] f.write(' '.join(outputStr) + '\n') ################################################################################ ### if CLI_OPTIONS.testAnnounceCode: signAddress = '1PpAJyNoocJt38Vcf4AfPffaxo76D4AAEe' announceName = 'testannounce.txt' pathPrefix = 'https://s3.amazonaws.com/bitcoinarmory-testing/' else: signAddress = '1NWvhByxfTXPYNT4zMBmEY3VL8QJQtQoei' announceName = 'announce.txt' pathPrefix = 'https://s3.amazonaws.com/bitcoinarmory-media/' announcePath = os.path.join(outDir, announceName) ### wlt = PyBtcWallet().readWalletFile(wltPath) if not wlt.hasAddr(signAddress): print 'Supplied wallet does not have the correct signing key' exit(1) print 'Must unlock wallet to sign the announce file...' while True: passwd = SecureBinaryData(getpass.getpass('Wallet passphrase: ')) if not wlt.verifyPassphrase(passwd): print 'Invalid passphrase!' continue break wlt.unlock(securePassphrase=passwd) passwd.destroy() addrObj = wlt.getAddrByHash160(addrStr_to_hash160(signAddress)[1]) def doSignFile(inFile, outFile): with open(inFile, 'rb') as f: sigBlock = ASv1CS(addrObj.binPrivKey32_Plain.toBinStr(), f.read()) with open(outFile, 'wb') as f: f.write(sigBlock) fileMappings = {} longestID = 0 longestURL = 0 print 'Reading file mapping...' with open('announcemap.txt','r') as f: for line in f.readlines(): fname, fid = line.strip().split() inputPath = os.path.join(inDir, fname) if not os.path.exists(inputPath): print 'ERROR: Could not find %s-file (%s)' % (fid, inputPath) exit(1) print ' Map: %s --> %s' % (fname, fid) if os.path.exists(outDir): print 'Wiping old, announced files...' shutil.rmtree(outDir) os.mkdir(outDir) print 'Signing and copying files to %s directory...' % outDir with open('announcemap.txt','r') as f: for line in f.readlines(): fname, fid = line.strip().split() inputPath = os.path.join(inDir, fname) outputPath = os.path.join(outDir, fname) # If we're using a modified DL file if fname=='dllinks.txt' and doComputeDLLinks: inputPath = newDLFile if fname.endswith('.txt'): doSignFile(inputPath, outputPath) else: shutil.copy(inputPath, outputPath) fdata = open(outputPath, 'rb').read() fhash = binary_to_hex(sha256(fdata)) fileMappings[fname] = [fid, fhash] longestID = max(longestID, len(fid)) longestURL = max(longestURL, len(pathPrefix+fname)) print 'Creating digest file...' digestFile = open(announcePath, 'w') ### for fname,vals in fileMappings.iteritems(): fid = vals[0].ljust(longestID + 3) url = (pathPrefix + fname).ljust(longestURL + 3) fhash = vals[1] digestFile.write('%s %s %s\n' % (fid, url, fhash)) digestFile.close() print '' print '------' with open(announcePath, 'r') as f: dfile = f.read() print dfile print '------' print 'Please verify the above data to your satisfaction:' raw_input('Hit when ready: ') doSignFile(announcePath, os.path.join(outDir, announceName)) print '*'*80 print open(announcePath, 'r').read() print '*'*80 print '' print 'Verifying files' for fname,vals in fileMappings.iteritems(): if 'bootstrap' in fname: continue with open(os.path.join(outDir, fname), 'rb') as f: sig,msg = readSigBlock(f.read()) addrB58 = verifySignature(sig, msg, 'v1', ord(ADDRBYTE)) print 'Sign addr for:', vals[0].ljust(longestID+3), addrB58 print 'Done!' armory-0.92.3/release_scripts/Step3_Online_VerifyAndUpload.py0000644000000000000000000001522112414772654023010 0ustar rootroot#! /usr/bin/python # This script doesn't actually do the verification stuff yet. You should # manually check, after this script completes, that signed_release_unpack: # dpkg-sig --verify *.deb # gpg -v *.asc # cd BitcoinArmory; git tag -v v0.90-beta (or whatever the tag is) from sys import argv import os import time import shutil from release_utils import * import json from datetime import datetime ##### from release_settings import getReleaseParams, getMasterPackageList ##### if len(argv)<2: import textwrap print textwrap.dedent(""" Script Arguments (* is optional) argv[0] "python %s" argv[1] inputDir (from Step2) argv[2]* isDryRun (default ~ 0) argv[3]* useTestParams (default ~ 0) """) % argv[0] exit(1) # Parse CLI args inDir = checkExists(argv[1]) isDryRun = (len(argv)>2 and not argv[2]=='0') testParams = (len(argv)>3 and not argv[3]=='0') masterPkgList = getMasterPackageList() RELEASE = getReleaseParams(testParams) signAddress = RELEASE['SignAddr'] announceName = RELEASE['AnnounceFile'] bucketPrefix = RELEASE['BucketPrefix'] htmlRelease = bucketPrefix + RELEASE['BucketReleases'] htmlAnnounce = bucketPrefix + RELEASE['BucketAnnounce'] s3Release = 's3://%s' % RELEASE['BucketReleases'] s3Announce = 's3://%s' % RELEASE['BucketAnnounce'] gpgKeyID = RELEASE['GPGKeyID'] btcWltID = RELEASE['BTCWltID'] #uploadlog = open('step3_log_%d.txt' % long(time.time()), 'w') uploadlog = open('step3_log.txt', 'w') def logprint(s): print s uploadlog.write(s + '\n') srcGitRepo = checkExists(os.path.join(inDir, 'BitcoinArmory')) srcInstalls = checkExists(os.path.join(inDir, 'installers')) srcAnnounce = checkExists(os.path.join(inDir, 'signedannounce')) # Scan the list of files in installers dir to get latest instList = [fn for fn in os.listdir(srcInstalls)] topVerInt,topVerStr,topVerType = getLatestVerFromList(instList) def getPkgFilename(pkgName, offline=False): if pkgName=='SHAFILE_TXT': suffix = 'sha256sum.txt' elif pkgName=='SHAFILE_ASC': suffix = 'sha256sum.txt.asc' else: suffixType = 'BundleSuffix' if offline else 'FileSuffix' suffix = masterPkgList[pkgName][suffixType] return 'armory_%s%s_%s' % (topVerStr, topVerType, suffix) #uploads.sort(key=lambda x: x[1]) # Now actually execute the uploads and make them public forumTextList = [] htmlTextList = [] rawUrlList = [] s3cmdList = [] # Try to make things sorted properly osSort = ['Windows', 'MacOSX', 'Ubuntu', 'RaspberryPi'][::-1] pkgPairs = [] while len(osSort)>0: thisOS = osSort.pop() for pkgName,pkgInfo in masterPkgList.iteritems(): if thisOS == pkgInfo['OSNameDisp']: pkgPairs.append([pkgName,pkgInfo]) uploadsRegular = [] uploadsOffline = [] for pkgName,pkgInfo in pkgPairs: pkgDict = {} pkgDict['SrcFile'] = getPkgFilename(pkgName) pkgDict['SrcPath'] = os.path.join(inDir, 'installers', pkgDict['SrcFile']) pkgDict['OSName'] = pkgInfo['OSNameDisp'] pkgDict['OSVar'] = pkgInfo['OSVarDisp'] pkgDict['OSArch'] = pkgInfo['OSArchDisp'] pkgDict['IsHash'] = False pkgDict['IsBundle'] = False pkgDict['DstUpload'] = '%s%s' % (s3Release, pkgDict['SrcFile']) pkgDict['DownLink'] = '%s%s' % (htmlRelease, pkgDict['SrcFile']) uploadsRegular.append(pkgDict) if pkgInfo['HasBundle']: pkgDict = {} pkgDict['SrcFile'] = getPkgFilename(pkgName, offline=True) pkgDict['SrcPath'] = os.path.join(inDir, 'installers', pkgDict['SrcFile']) pkgDict['OSName'] = pkgInfo['OSNameDisp'] pkgDict['OSVar'] = pkgInfo['BundleOSVar'] pkgDict['OSArch'] = pkgInfo['OSArchDisp'] pkgDict['IsHash'] = False pkgDict['IsBundle'] = True pkgDict['DstUpload'] = '%s%s' % (s3Release, pkgDict['SrcFile']) pkgDict['DownLink'] = '%s%s' % (htmlRelease, pkgDict['SrcFile']) uploadsOffline.append(pkgDict) uploads = uploadsRegular + uploadsOffline ascDict = {} ascDict['SrcFile'] = getPkgFilename('SHAFILE_ASC') ascDict['SrcPath'] = os.path.join(inDir, 'installers', ascDict['SrcFile']) ascDict['IsHash'] = True ascDict['IsBundle'] = False ascDict['DstUpload'] = '%s%s' % (s3Release, ascDict['SrcFile']) ascDict['DownLink'] = '%s%s' % (htmlRelease, ascDict['SrcFile']) uploads.append(ascDict) jsonOut = {} jsonOut['VersionStr'] = topVerStr + topVerType jsonOut['ReleaseDate'] = datetime.fromtimestamp(time.time()).strftime("%B %d, %Y") jsonOut['Downloads'] = uploads print json.dumps(jsonOut, indent=4) for upl in uploads: print 'Going to upload:' for key,val in upl.iteritems(): print ' ', key.ljust(10), ':', val print '' for pkgDict in uploads: #osStr, subOS, bits, vi, vs = fivevals #print fullfn, fn, isbundle, ishash, osStr, subOS, bits, vi, vs verFullStr = topVerStr + topVerType humanText = 'Armory %s' % verFullStr if pkgDict['IsBundle']: humanText += ' Offline Bundle' if pkgDict['IsHash']: humanText += ': Signed hashes of all installers ' else: osParams = [pkgDict[a] for a in ['OSName', 'OSVar', 'OSArch']] humanText += ' for %s %s (%s)' % tuple(osParams) uploadurl = pkgDict['DstUpload'] linkurl = pkgDict['DownLink'] s3cmd = 's3cmd put --acl-public %s %s' % (pkgDict['SrcPath'], uploadurl) forumText = '[url=%s]%s[/url]' % (linkurl, humanText) htmlText = '%s' % (linkurl, humanText) forumTextList.append(forumText) htmlTextList.append(htmlText) rawUrlList.append(linkurl) s3cmdList.append(s3cmd) announceDir = os.path.join(inDir, 'signedannounce') for fn in os.listdir(announceDir): fpath = os.path.join(announceDir, fn) uploadurl = '%s%s' % (s3Announce, fn) s3cmd = 's3cmd put --acl-public %s %s' % (fpath, uploadurl) s3cmdList.append(s3cmd) logprint('\nRAW URL LIST') for txt in rawUrlList: logprint(' '+txt) logprint('\nFORUM POSTING LINKS') for txt in forumTextList: logprint(' '+txt) logprint('\nWEBSITE POSTING LINKS') for txt in htmlTextList: logprint(' '+txt) logprint('\nS3CMD UPLOAD COMMANDS') for txt in s3cmdList: logprint(' '+txt) if not isDryRun: logprint('') yn = raw_input('Continue with upload? [y/N]') if yn.lower().startswith('y'): logprint('STARTING UPLOADS') for s3cmd in s3cmdList: logprint('Uploading: ' + s3cmd.split()[-1].strip()) execAndWait(s3cmd, usepipes=False) logprint('') logprint('Not actually pushing the signed tag; do it manually --') logprint('Copy the following command to push the tag:') logprint(' cd %s/BitcoinArmory; git push origin v%s' % (inDir, verFullStr)) armory-0.92.3/armorycolors.py0000644000000000000000000001575312414772654014750 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ import sys from PyQt4.QtGui import QColor, QPalette, QApplication """ # Here's what the palette looks like on Ubuntu 10.04, default theme qp.color(QPalette.Window); 240 235 226 255 qp.color(QPalette.Background); 240 235 226 255 qp.color(QPalette.WindowText); 60 59 55 255 qp.color(QPalette.Foreground); 60 59 55 255 qp.color(QPalette.Base); 255 255 255 255 qp.color(QPalette.AlternateBase); 239 239 239 255 qp.color(QPalette.Text); 58 57 53 255 qp.color(QPalette.Button); 240 235 226 255 qp.color(QPalette.BrightText); 255 255 255 255 qp.color(QPalette.ToolTipBase); 255 255 220 255 qp.color(QPalette.ToolTipText); 255 255 255 255 qp.color(QPalette.Light); 255 255 255 255 qp.color(QPalette.Midlight); 203 199 196 255 qp.color(QPalette.Dark); 200 196 189 255 qp.color(QPalette.Mid); 184 181 178 255 qp.color(QPalette.Shadow); 185 181 174 255 qp.color(QPalette.Highlight); 198 185 166 255 qp.color(QPalette.HighlightedText); 50 50 50 255 qp.color(QPalette.Link); 0 0 255 255 qp.color(QPalette.LinkVisited); 255 0 255 255 """ class InvalidColor(Exception): pass ################################################################################ def tweakColor(qcolor, op, tweaks): """ We want to be able to take existing colors (from the palette) and tweak them. This may involved "inverting" them, or multiplying or adding scalars to the various channels. """ if len(tweaks) != 3: raise InvalidColor, 'Must supply list or tuple of RGB tweaks' # Determine what the "tweaks" list/tuple means tweakChannel = lambda x,mod: x # identity if op.lower() in ('times', '*'): def tweakChannel(color, mod): if mod < 0: color = (255 - color) mod *= -1 returnColor = color * mod returnColor = min(returnColor, 255) return int(max(returnColor, 0)) elif op.lower() in ('plus', '+'): def tweakChannel(color, mod): returnColor = color + mod returnColor = min(returnColor, 255) return int(max(returnColor, 0)) else: raise InvalidColor, 'Invalid color operation: "%s"' % op r,g,b = qcolor.red(), qcolor.green(), qcolor.blue() r = tweakChannel(r, tweaks[0]) g = tweakChannel(g, tweaks[1]) b = tweakChannel(b, tweaks[2]) return QColor(r,g,b) ################################################################################ def luminance(qcolor): """ Gives the pseudo-equivalent greyscale value of this color """ r,g,b = qcolor.red(), qcolor.green(), qcolor.blue() return int(0.2*r + 0.6*g + 0.2*b) QAPP = QApplication(sys.argv) qpal = QAPP.palette() # workaround for https://bugs.launchpad.net/ubuntu/+source/qt4-x11/+bug/877236 qpal.setColor(QPalette.ToolTipBase, qpal.color(QPalette.Window)) qpal.setColor(QPalette.ToolTipText, qpal.color(QPalette.WindowText)) QAPP.setPalette(qpal) # Some of the standard colors to be tweaked class ArbitraryStruct: pass Colors = ArbitraryStruct() Colors.Background = qpal.color(QPalette.Window) Colors.Foreground = qpal.color(QPalette.WindowText) Colors.HighlightBG = qpal.color(QPalette.Highlight) Colors.HighlightFG = qpal.color(QPalette.HighlightedText) Colors.Link = qpal.color(QPalette.Link) Colors.Mid = qpal.color(QPalette.Mid) Colors.DisableFG = qpal.color(QPalette.Disabled, QPalette.WindowText) Colors.isDarkBkgd = (luminance(Colors.Background) < 128) Colors.TextWarn = tweakColor(Colors.Foreground, '+', [+100, -40, -40]) Colors.TextRed = tweakColor(Colors.Foreground, '+', [+100, -40, -40]) Colors.TextGreen = tweakColor(Colors.Foreground, '+', [ -40, +100, -40]) Colors.TextBlue = tweakColor(Colors.Foreground, '+', [ -40, -40, +100]) Colors.SlightRed = tweakColor(Colors.Background, '*', [1.05, 0.95, 0.95]) Colors.SlightGreen = tweakColor(Colors.Background, '*', [0.95, 1.05, 0.95]) Colors.SlightBlue = tweakColor(Colors.Background, '*', [0.95, 0.95, 1.05]) Colors.SlightMoreBlue = tweakColor(Colors.Background, '*', [0.95, 0.95, 1.15]) Colors.SlightBkgdDark = tweakColor(Colors.Background, '*', [0.95, 0.95, 0.95]) Colors.SlightBkgdLight = tweakColor(Colors.Background, '*', [1.05, 1.05, 1.05]) Colors.TextNoConfirm = tweakColor(Colors.Mid, '*', [ 0.9, 0.9, 0.9]) Colors.TextSomeConfirm = tweakColor(Colors.Mid, '*', [ 0.7, 0.7, 0.7]) Colors.MoneyPos = tweakColor(Colors.Foreground, '+', [ -50, +100, -50]) Colors.MoneyNeg = tweakColor(Colors.Foreground, '+', [+150, -40, -40]) Colors.TblWltOther = tweakColor(Colors.Background, '*', [1.00, 1.00, 1.00]) Colors.TblWltMine = tweakColor(Colors.Background, '*', [0.95, 0.95, 1.3 ]) Colors.TblWltOffline = tweakColor(Colors.Background, '*', [0.85, 0.85, 1.35]) if(Colors.isDarkBkgd): Colors.LBtnNormalBG = Colors.Background Colors.LBtnHoverBG = tweakColor(Colors.Background, '+', [ +25, +25, 0]) Colors.LBtnNormalFG = tweakColor(Colors.Link, '+', [+150, +150, 0]) Colors.LBtnHoverFG = tweakColor(Colors.Link, '+', [+150, +150, 0]) else: Colors.LBtnNormalBG = Colors.Background Colors.LBtnHoverBG = tweakColor(Colors.Background, '*', [ 0.8, 0.8, 1.7]) Colors.LBtnNormalFG = Colors.Link Colors.LBtnHoverFG = Colors.Link Colors.ToolTipQ = Colors.LBtnNormalFG ################################################################################ def htmlColor(name): """ These are not official HTML colors: this is simply a method for taking one of the above colors and converting to a hex string """ try: qcolor = Colors.__dict__[name] r,g,b = qcolor.red(), qcolor.green(), qcolor.blue() rstr = hex(r)[2:].rjust(2, '0') gstr = hex(g)[2:].rjust(2, '0') bstr = hex(b)[2:].rjust(2, '0') return '#%s%s%s' % (rstr, gstr, bstr) except: raise InvalidColor, 'Invalid color: ' + name if __name__== "__main__": print Colors.TextWarn print htmlColor("TextRed") print htmlColor("TextWarn") print "Colors in the palette!" for name,qc in Colors.__dict__.iteritems(): if not isinstance(qc, QColor): continue print '\t', print ('"'+name+'"').ljust(20), print str(qc.red()).rjust(3), print str(qc.green()).rjust(3), print str(qc.blue()).rjust(3), print '\t(%s)' % htmlColor(name) armory-0.92.3/ui/0000755000000000000000000000000012414772654012245 5ustar rootrootarmory-0.92.3/ui/TxConstruct.py0000644000000000000000000000356312414772654015126 0ustar rootrootfrom PyQt4.Qt import * from PyQt4.QtGui import * from PyQt4.QtNetwork import * from qtdefines import * from qtdialogs import createAddrBookButton, DlgSetComment, DlgSendBitcoins, \ DlgUnlockWallet, DlgQRCodeDisplay, DlgRequestPayment from armoryengine.ALL import * from armorymodels import * from armoryengine.MultiSigUtils import MultiSigLockbox, calcLockboxID,\ createLockboxEntryStr from ui.MultiSigModels import \ LockboxDisplayModel, LockboxDisplayProxy, LOCKBOXCOLS import webbrowser ############################################################################# class TxInCtorEntry(object): def __init__(self, ustxi=None): if ustxi is None: ustxi = UnsignedTxInput() ############################################################################# class DlgConstructTx(ArmoryDialog): ############################################################################# def __init__(self, parent, main, prefill=None): super(DlgConstructTx, self).__init__(parent, main) if prefill is None: prefill = UnsignedTransaction() if not TheBDM.getBDMState()=='BlockchainReady': LOGERROR('Cannot use tx ctor until Armory is in full online mode') self.reject() self.widgTableIn = [] self.widgTableOut = [] self.txInSpendScript = [] self.txInPrevScript = [] self.txOut = [] def addInputToTable(self, ustxi=None): if ustxi is None: ustxi = UnsignedTxInput() newRow = {} newRow[''] def makeShortHRScriptFromBin(self, binScript): def makeShortHRScriptFromHex(self, hexScript): def makeShortHRScriptFromHR(self, hexScript): def humanScript_to(self, binScript=None, hexScript=None, humanScript=None): def updateTxInputScript(self, txinIndex, newScript): armory-0.92.3/ui/TxFrames.py0000644000000000000000000023504512414772654014361 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ from PyQt4.Qt import * #@UnusedWildImport from PyQt4.QtGui import * #@UnusedWildImport from armoryengine.BDM import TheBDM from qtdefines import * #@UnusedWildImport from armoryengine.Transaction import UnsignedTransaction, getTxOutScriptType from armoryengine.Script import convertScriptToOpStrings from armoryengine.CoinSelection import PySelectCoins, calcMinSuggestedFees,\ calcMinSuggestedFeesHackMS, PyUnspentTxOut from ui.WalletFrames import SelectWalletFrame, LockboxSelectFrame from armoryengine.MultiSigUtils import \ calcLockboxID, readLockboxEntryStr, createLockboxEntryStr, isBareLockbox,\ isP2SHLockbox class SendBitcoinsFrame(ArmoryFrame): def __init__(self, parent, main, initLabel='', wlt=None, prefill=None, wltIDList=None, selectWltCallback = None, onlyOfflineWallets=False, sendCallback = None, createUnsignedTxCallback = None, spendFromLockboxID=None): super(SendBitcoinsFrame, self).__init__(parent, main) self.maxHeight = tightSizeNChar(GETFONT('var'), 1)[1] + 8 self.sourceAddrList = None self.altBalance = None self.wlt = wlt self.wltID = wlt.uniqueIDB58 if wlt else None self.wltIDList = wltIDList self.selectWltCallback = selectWltCallback self.sendCallback = sendCallback self.createUnsignedTxCallback = createUnsignedTxCallback self.lbox = self.main.getLockboxByID(spendFromLockboxID) self.onlyOfflineWallets = onlyOfflineWallets txFee = self.main.getSettingOrSetDefault('Default_Fee', MIN_TX_FEE) self.widgetTable = [] self.scrollRecipArea = QScrollArea() lblRecip = QRichLabel('Enter Recipients:') lblRecip.setAlignment(Qt.AlignLeft | Qt.AlignBottom) self.freeOfErrors = True feetip = self.main.createToolTipWidget(\ 'Transaction fees go to users who contribute computing power to ' 'keep the Bitcoin network secure, and in return they get your transaction ' 'included in the blockchain faster. Most transactions ' 'do not require a fee but it is recommended anyway ' 'since it guarantees quick processing and helps the network.') self.edtFeeAmt = QLineEdit() self.edtFeeAmt.setFont(GETFONT('Fixed')) self.edtFeeAmt.setMinimumWidth(tightSizeNChar(self.edtFeeAmt, 6)[0]) self.edtFeeAmt.setMaximumWidth(tightSizeNChar(self.edtFeeAmt, 12)[0]) self.edtFeeAmt.setMaximumHeight(self.maxHeight) self.edtFeeAmt.setAlignment(Qt.AlignRight) self.edtFeeAmt.setText(coin2str(txFee, maxZeros=1).strip()) # This used to be in the later, expert-only section, but some of these # are actually getting referenced before being declared. So moved them # up to here. self.chkDefaultChangeAddr = QCheckBox('Use an existing address for change') self.radioFeedback = QRadioButton('Send change to first input address') self.radioSpecify = QRadioButton('Specify a change address') self.lblChangeAddr = QRichLabel('Change:') # Replaced with createAddressEntryWidgets #self.edtChangeAddr = QLineEdit() #self.btnChangeAddr = createAddrBookButton(parent, self.edtChangeAddr, \ #None, 'Send change to') addrWidgets = self.main.createAddressEntryWidgets(self, maxDetectLen=36, defaultWltID=self.wltID) self.edtChangeAddr = addrWidgets['QLE_ADDR'] self.btnChangeAddr = addrWidgets['BTN_BOOK'] self.lblAutoDetect = addrWidgets['LBL_DETECT'] self.getUserChangeScript = addrWidgets['CALLBACK_GETSCRIPT'] self.chkRememberChng = QCheckBox('Remember for future transactions') self.vertLine = VLINE() self.ttipSendChange = self.main.createToolTipWidget(\ 'Most transactions end up with oversized inputs and Armory will send ' 'the change to the next address in this wallet. You may change this ' 'behavior by checking this box.') self.ttipFeedback = self.main.createToolTipWidget(\ 'Guarantees that no new addresses will be created to receive ' 'change. This reduces anonymity, but is useful if you ' 'created this wallet solely for managing imported addresses, ' 'and want to keep all funds within existing addresses.') self.ttipSpecify = self.main.createToolTipWidget(\ 'You can specify any valid Bitcoin address for the change. ' 'NOTE: If the address you specify is not in this wallet, ' 'Armory will not be able to distinguish the outputs when it shows ' 'up in your ledger. The change will look like a second recipient, ' 'and the total debit to your wallet will be equal to the amount ' 'you sent to the recipient plus the change.') self.ttipUnsigned = self.main.createToolTipWidget(\ 'Check this box to create an unsigned transaction to be signed' ' and/or broadcast later.') self.unsignedCheckbox = QCheckBox('Create Unsigned') self.btnSend = QPushButton('Send!') # Created a standard wallet chooser frame. Pass the call back method # for when the user selects a wallet. if self.lbox is None: coinControlCallback = self.coinControlUpdate if self.main.usermode == USERMODE.Expert else None self.frmSelectedWlt = SelectWalletFrame(parent, main, VERTICAL, self.wltID, wltIDList=self.wltIDList, selectWltCallback=self.setWallet, \ coinControlCallback=coinControlCallback, onlyOfflineWallets=self.onlyOfflineWallets) else: self.frmSelectedWlt = LockboxSelectFrame(parent, main, VERTICAL, self.lbox.uniqueIDB58) # Only the Create Unsigned Transaction button if there is a callback for it. # Otherwise the containing dialog or wizard will provide the offlien tx button componentList = [ QLabel('Fee:'), self.edtFeeAmt, feetip, 'Stretch'] if self.createUnsignedTxCallback: self.connect(self.unsignedCheckbox, SIGNAL(CLICKED), self.unsignedCheckBoxUpdate) componentList.append(self.unsignedCheckbox) componentList.append(self.ttipUnsigned) # Only add the Send Button if there's a callback for it # Otherwise the containing dialog or wizard will provide the send button if self.sendCallback: self.connect(self.btnSend, SIGNAL(CLICKED), self.createTxAndBroadcast) componentList.append(self.btnSend) txFrm = makeHorizFrame(componentList, condenseMargins=True) btnEnterURI = QPushButton('Manually Enter "bitcoin:" Link') ttipEnterURI = self.main.createToolTipWidget( tr(""" Armory does not always succeed at registering itself to handle URL links from webpages and email. Click this button to copy a "bitcoin:" link directly into Armory.""")) self.connect(btnEnterURI, SIGNAL("clicked()"), self.clickEnterURI) fromFrameList = [self.frmSelectedWlt] if not USE_TESTNET: btnDonate = QPushButton("Donate to Armory Developers!") ttipDonate = self.main.createToolTipWidget(\ 'Making this software was a lot of work. You can give back ' 'by adding a small donation to go to the Armory developers. ' 'You will have the ability to change the donation amount ' 'before finalizing the transaction.') self.connect(btnDonate, SIGNAL("clicked()"), self.addDonation) frmDonate = makeHorizFrame([btnDonate, ttipDonate], condenseMargins=True) fromFrameList.append(frmDonate) if not self.main.usermode == USERMODE.Standard: frmEnterURI = makeHorizFrame([btnEnterURI, ttipEnterURI], condenseMargins=True) fromFrameList.append(frmEnterURI) ######################################################################## # In Expert usermode, allow the user to modify source addresses if self.main.usermode == USERMODE.Expert: sendChangeToFrame = QFrame() sendChangeToLayout = QGridLayout() sendChangeToLayout.addWidget(self.lblChangeAddr, 0,0) sendChangeToLayout.addWidget(self.edtChangeAddr, 0,1) sendChangeToLayout.addWidget(self.btnChangeAddr, 0,2) sendChangeToLayout.addWidget(self.lblAutoDetect, 1,1, 1,2) sendChangeToLayout.setColumnStretch(0,0) sendChangeToLayout.setColumnStretch(1,1) sendChangeToLayout.setColumnStretch(2,0) sendChangeToFrame.setLayout(sendChangeToLayout) btngrp = QButtonGroup(self) btngrp.addButton(self.radioFeedback) btngrp.addButton(self.radioSpecify) btngrp.setExclusive(True) self.connect(self.chkDefaultChangeAddr, SIGNAL('toggled(bool)'), self.toggleChngAddr) self.connect(self.radioSpecify, SIGNAL('toggled(bool)'), self.toggleSpecify) frmChngLayout = QGridLayout() i = 0; frmChngLayout.addWidget(self.chkDefaultChangeAddr, i, 0, 1, 6) frmChngLayout.addWidget(self.ttipSendChange, i, 6, 1, 2) i += 1 frmChngLayout.addWidget(self.radioFeedback, i, 1, 1, 5) frmChngLayout.addWidget(self.ttipFeedback, i, 6, 1, 2) i += 1 frmChngLayout.addWidget(self.radioSpecify, i, 1, 1, 5) frmChngLayout.addWidget(self.ttipSpecify, i, 6, 1, 2) i += 1 frmChngLayout.addWidget(sendChangeToFrame, i, 1, 1, 6) i += 1 frmChngLayout.addWidget(self.chkRememberChng, i, 1, 1, 7) frmChngLayout.addWidget(self.vertLine, 1, 0, i - 1, 1) frmChngLayout.setColumnStretch(0,1) frmChngLayout.setColumnStretch(1,1) frmChngLayout.setColumnStretch(2,1) frmChngLayout.setColumnStretch(3,1) frmChngLayout.setColumnStretch(4,1) frmChngLayout.setColumnStretch(5,1) frmChngLayout.setColumnStretch(6,1) frmChangeAddr = QFrame() frmChangeAddr.setLayout(frmChngLayout) frmChangeAddr.setFrameStyle(STYLE_SUNKEN) fromFrameList.append('Stretch') fromFrameList.append(frmChangeAddr) else: fromFrameList.append('Stretch') frmBottomLeft = makeVertFrame(fromFrameList, STYLE_RAISED, condenseMargins=True) lblSend = QRichLabel('Sending from Wallet:') lblSend.setAlignment(Qt.AlignLeft | Qt.AlignBottom) leftFrame = makeVertFrame([lblSend, frmBottomLeft], condenseMargins=True) rightFrame = makeVertFrame([lblRecip, self.scrollRecipArea, txFrm], condenseMargins=True) layout = QHBoxLayout() layout.addWidget(leftFrame, 0) layout.addWidget(rightFrame, 1) layout.setContentsMargins(0,0,0,0) layout.setSpacing(0) self.setLayout(layout) self.makeRecipFrame(1) self.setWindowTitle('Send Bitcoins') self.setMinimumHeight(self.maxHeight * 20) # self.setSizePolicy(QSizePolicy.Fixed, QSizePolicy.Preferred) loadCount = self.main.settings.get('Load_Count') alreadyDonated = self.main.getSettingOrSetDefault('DonateAlready', False) lastPestering = self.main.getSettingOrSetDefault('DonateLastPester', 0) donateFreq = self.main.getSettingOrSetDefault('DonateFreq', 20) dnaaDonate = self.main.getSettingOrSetDefault('DonateDNAA', False) if prefill: amount = prefill.get('amount','') message = prefill.get('message','') label = prefill.get('label','') if prefill.get('lockbox',''): plainStr = createLockboxEntryStr(prefill.get('lockbox','')) self.addOneRecipient(None, amount, message, None, plainStr) else: atype, addr160 = addrStr_to_hash160(prefill.get('address','')) self.addOneRecipient(addr160, amount, message, label) elif not self.main == None and \ loadCount % donateFreq == (donateFreq-1) and \ not loadCount == lastPestering and \ not dnaaDonate and \ not USE_TESTNET: result = MsgBoxWithDNAA(MSGBOX.Question, 'Please donate!', tr(""" Armory is the result of thousands of hours of development by very talented coders. Yet, this software has been given to you for free to benefit the greater Bitcoin community!

If you are satisfied with this software, please consider donating what you think this software would be worth as a commercial application.

Are you willing to donate to the Armory developers? If you select "Yes," a donation field will be added to your next transaction. You will have the opportunity to remove it or change the amount before sending the transaction."""), None) self.main.writeSetting('DonateLastPester', loadCount) if result[0] == True: self.addDonation() self.makeRecipFrame(2) if result[1] == True: self.main.writeSetting('DonateDNAA', True) if self.lbox: self.toggleSpecify(False) self.toggleChngAddr(False) hexgeom = self.main.settings.get('SendBtcGeometry') if len(hexgeom) > 0: geom = QByteArray.fromHex(hexgeom) self.restoreGeometry(geom) # Use this to fire wallet change after the constructor is complete. # if it's called during construction then self's container may not exist yet. def fireWalletChange(self): # Set the wallet in the wallet selector and let all of display components # react to it. This is at the end so that we can be sure that all of the # components that react to setting the wallet exist. if self.lbox: self.unsignedCheckbox.setChecked(True) self.unsignedCheckbox.setEnabled(False) else: self.frmSelectedWlt.updateOnWalletChange() self.unsignedCheckBoxUpdate() ############################################################################# def unsignedCheckBoxUpdate(self): if self.unsignedCheckbox.isChecked(): self.btnSend.setText('Continue') self.btnSend.setToolTip('Click to create an unsigned transaction!') else: self.btnSend.setText('Send!') self.btnSend.setToolTip('Click to send bitcoins!') ############################################################################# def addOneRecipient(self, addr160, amt, msg, label=None, plainText=None): """ plainText arg can be used, and will override addr160. It is for injecting either fancy script types, or special keywords into the address field, such as a lockbox ID """ if label is not None: self.wlt.setComment(addr160, label) lastIsEmpty = True for widg in ['QLE_ADDR', 'QLE_AMT', 'QLE_COMM']: if len(str(self.widgetTable[-1][widg].text())) > 0: lastIsEmpty = False if not lastIsEmpty: self.makeRecipFrame(len(self.widgetTable) + 1) if amt: amt = coin2str(amt, maxZeros=2).strip() if plainText is None: plainText = hash160_to_addrStr(addr160) self.widgetTable[-1]['QLE_ADDR'].setText(plainText) self.widgetTable[-1]['QLE_ADDR'].setCursorPosition(0) self.widgetTable[-1]['QLE_AMT'].setText(amt) self.widgetTable[-1]['QLE_AMT'].setCursorPosition(0) self.widgetTable[-1]['QLE_COMM'].setText(msg) self.widgetTable[-1]['QLE_COMM'].setCursorPosition(0) ############################################################################# # Now that the wallet can change in the context of the send dialog, this # method is used as a callback for when the wallet changes # isDoubleClick is unused - do not accept or close dialog on double click def setWallet(self, wlt, isDoubleClick=False): self.wlt = wlt self.wltID = wlt.uniqueIDB58 if wlt else None if not TheBDM.getBDMState() == 'BlockchainReady': self.lblSummaryBal.setText('(available when online)', color='DisableFG') if self.main.usermode == USERMODE.Expert: # Pre-set values based on settings chngBehave = self.main.getWltSetting(self.wltID, 'ChangeBehavior') chngAddr = self.main.getWltSetting(self.wltID, 'ChangeAddr') if chngBehave == 'Feedback': self.chkDefaultChangeAddr.setChecked(True) self.radioFeedback.setChecked(True) self.radioSpecify.setChecked(False) self.toggleChngAddr(True) self.chkRememberChng.setChecked(True) elif chngBehave == 'Specify': self.chkDefaultChangeAddr.setChecked(True) self.radioFeedback.setChecked(False) self.radioSpecify.setChecked(True) self.toggleChngAddr(True) if checkAddrStrValid(chngAddr): self.edtChangeAddr.setText(chngAddr) self.edtChangeAddr.setCursorPosition(0) self.chkRememberChng.setChecked(True) else: # Other option is "NewAddr" but in case there's an error, should run # this branch by default self.chkDefaultChangeAddr.setChecked(False) self.radioFeedback.setChecked(False) self.radioSpecify.setChecked(False) self.toggleChngAddr(False) if (self.chkDefaultChangeAddr.isChecked() and \ not self.radioFeedback.isChecked() and \ not self.radioSpecify.isChecked()): self.radioFeedback.setChecked(True) # If there is a unsigned then we have a send button and unsigned checkbox to update if self.createUnsignedTxCallback: self.unsignedCheckbox.setChecked(wlt.watchingOnly) self.unsignedCheckbox.setEnabled(not wlt.watchingOnly) self.unsignedCheckBoxUpdate() if self.selectWltCallback: self.selectWltCallback(wlt) ############################################################################# # Update the available source address list and balance based on results from # coin control. This callback is now necessary because coin control was moved # to the Select Wallet Frame def coinControlUpdate(self, sourceAddrList, altBalance): self.sourceAddrList = sourceAddrList self.altBalance = altBalance ############################################################################# def validateInputsGetUSTX(self): self.freeOfErrors = True scripts = [] addrList = [] self.comments = [] isSendToNonStandardLockbox = False for row in range(len(self.widgetTable)): # Verify validity of address strings addrStr = str(self.widgetTable[row]['QLE_ADDR'].text()).strip() self.widgetTable[row]['QLE_ADDR'].setText(addrStr) # overwrite w/ stripped addrIsValid = True addrList.append(addrStr) try: enteredScript = self.widgetTable[row]['FUNC_GETSCRIPT']()['Script'] if not enteredScript: addrIsValid = False else: scripts.append(enteredScript) except: LOGEXCEPT('Failed to parse entered address: %s', addrStr) addrIsValid = False if not addrIsValid: scripts.append('') self.freeOfErrors = False self.updateAddrColor(row, Colors.SlightRed) numChkFail = sum([1 if len(b)==0 else 0 for b in scripts]) if not self.freeOfErrors: QMessageBox.critical(self, tr('Invalid Address'), tr(""" You have entered %d invalid @{address|addresses}@. The @{error has|errors have}@ been highlighted on the entry screen.""", numChkFail, numChkFail), QMessageBox.Ok) for row in range(len(self.widgetTable)): try: atype, a160 = addrStr_to_hash160(addrList[row]) if atype == -1 or not atype in [ADDRBYTE,P2SHBYTE]: net = 'Unknown Network' if NETWORKS.has_key(addrList[row][0]): net = NETWORKS[addrList[row][0]] QMessageBox.warning(self, tr('Wrong Network!'), tr(""" Address %d is for the wrong network! You are on the %s and the address you supplied is for the the %s!""") % \ (row+1, NETWORKS[ADDRBYTE], net), QMessageBox.Ok) except: pass return False # Construct recipValuePairs and check that all metrics check out scriptValPairs = [] totalSend = 0 for row in range(len(self.widgetTable)): try: recipStr = str(self.widgetTable[row]['QLE_ADDR'].text()).strip() valueStr = str(self.widgetTable[row]['QLE_AMT'].text()).strip() value = str2coin(valueStr, negAllowed=False) if value == 0: QMessageBox.critical(self, 'Zero Amount', \ 'You cannot send 0 BTC to any recipients.
Please enter ' 'a positive amount for recipient %d.' % (row+1), QMessageBox.Ok) return False except NegativeValueError: QMessageBox.critical(self, 'Negative Value', \ 'You have specified a negative amount for recipient %d.
Only ' 'positive values are allowed!.' % (row + 1), QMessageBox.Ok) return False except TooMuchPrecisionError: QMessageBox.critical(self, 'Too much precision', \ 'Bitcoins can only be specified down to 8 decimal places. ' 'The smallest value that can be sent is 0.0000 0001 BTC. ' 'Please enter a new amount for recipient %d.' % (row + 1), QMessageBox.Ok) return False except ValueError: QMessageBox.critical(self, 'Missing recipient amount', \ 'You did not specify an amount to send!', QMessageBox.Ok) return False except: QMessageBox.critical(self, 'Invalid Value String', \ 'The amount you specified ' 'to send to address %d is invalid (%s).' % (row + 1, valueStr), QMessageBox.Ok) LOGERROR('Invalid amount specified: "%s"', valueStr) return False totalSend += value script = self.widgetTable[row]['FUNC_GETSCRIPT']()['Script'] #scraddr = script_to_scrAddr(script) # Checking for sending bitcoins to a Lockbox using P2SH that is # non-standard to spend. # only P2SH matters, if it's a bare multi sig, you won't be able to # deposit if it's non-standard. In other words if it standard to spend from # a bare sig lockbox it's standard to deposit into it. # This is not necessarily so for P2SH. Must warn the user or else they # may get some bitcoins stuck in a lockbox until they upgrade to bitcoin # 0.10.0 if isP2SHLockbox(recipStr): lbox = self.main.getLockboxByID(readLockboxEntryStr(recipStr)) if isMofNNonStandardToSpend(lbox.M, lbox.N): reply = QMessageBox.warning(self, tr('Non-Standard to Spend'), tr(""" Due to the Lockbox size (%d-of-%d) of recipient %d, spending funds from this Lockbox is valid but non-standard for versions of Bitcoin prior to 0.10.0. This means if your version of Bitcoin is 0.9.x or below, and you try to broadcast a transaction that spends from this Lockbox the transaction will not be accepted. If you have version 0.10.0, but all of your peers have an older version your transaction will not be forwarded to the rest of the network. If you deposit Bitcoins into this Lockbox you may have to wait until you and at least some of your peers have upgraded to 0.10.0 before those Bitcoins can be spent. Alternatively, if you have enough computing power to mine your own transactions, or know someone who does, you can arrange to have any valid but non-standard transaction included in the block chain.""") % \ (lbox.M, lbox.N, row+1), QMessageBox.Ok | QMessageBox.Cancel) if not reply==QMessageBox.Ok: return scriptValPairs.append([script, value]) self.comments.append((str(self.widgetTable[row]['QLE_COMM'].text()), value)) try: feeStr = str(self.edtFeeAmt.text()) fee = str2coin(feeStr, negAllowed=False) except NegativeValueError: QMessageBox.critical(self, tr('Negative Value'), tr(""" You must enter a positive value for the fee."""), QMessageBox.Ok) return False except TooMuchPrecisionError: QMessageBox.critical(self, tr('Too much precision'), tr(""" Bitcoins can only be specified down to 8 decimal places. The smallest unit of a Bitcoin is 0.0000 0001 BTC. Please enter a fee of at least 0.0000 0001"""), QMessageBox.Ok) return False except: QMessageBox.critical(self, tr('Invalid Fee String'), tr(""" The fee you specified is invalid. A standard fee is 0.0001 BTC, though some transactions may succeed with zero fee."""), QMessageBox.Ok) LOGERROR(tr('Invalid fee specified: "%s"') % feeStr) return False bal = self.getUsableBalance() if totalSend + fee > bal: valTry = coin2str(totalSend + fee, maxZeros=2).strip() valMax = coin2str(bal, maxZeros=2).strip() if self.altBalance == None: QMessageBox.critical(self, tr('Insufficient Funds'), tr(""" You just tried to send more Bitcoins than you have available. You only have %s BTC (spendable) in this wallet!""") % \ valMax, QMessageBox.Ok) else: QMessageBox.critical(self, tr('Insufficient Funds'), tr(""" You just tried to send more Bitcoins than you have available. You only have %s BTC with this coin control selection!""") % \ (valTry, valMax), QMessageBox.Ok) return False # Iteratively calculate the minimum fee by first trying the user selected # fee then on each iteration set the feeTry to the minFee, and see if the # new feeTry can cover the original amount plus the new minfee. This loop # will rarely iterate. It will only iterate when there is enough dust in # utxoList so that each fee increase causes enough dust to be used to # increase the fee yet again. Also, for the loop to iterate, the # totalSend + fee must be close to the bal, but not go over when the min # fee is increased If it does go over, it will exit the loop on the # last condition,and give the user an insufficient balance warning. minFee = None utxoSelect = [] feeTry = fee while minFee is None or (feeTry < minFee and totalSend + minFee <= bal): if minFee: feeTry = minFee utxoList = self.getUsableTxOutList() utxoSelect = PySelectCoins(utxoList, totalSend, feeTry) if self.lbox is None: minFee = calcMinSuggestedFees(utxoSelect, totalSend, feeTry, \ len(scriptValPairs))[1] else: minFee = calcMinSuggestedFeesHackMS(utxoSelect, totalSend, feeTry, \ len(scriptValPairs))[1] if minFee > 99*MIN_RELAY_TX_FEE: QMessageBox.critical(self, tr('Minimum Transaction Fee Is Too Large'), tr(""" The minimum fee for this transaction is %s BTC. That fee is too large and indicates that there are probably too many small inputs to fit into a single transaction. To send these Bitcoins, this transaction must be broken up into to smaller pieces. """) % coin2strNZS(minFee), QMessageBox.Ok) return False # We now have a min-fee that we know we can match if the user agrees if fee < minFee: usrFeeStr = coin2strNZS(fee) minFeeStr = coin2strNZS(minFee) newBalStr = coin2strNZS(bal - minFee) if totalSend + minFee > bal: # Need to adjust this based on overrideMin flag self.edtFeeAmt.setText(coin2str(minFee, maxZeros=1).strip()) QMessageBox.warning(self, tr('Insufficient Balance'), tr(""" The required transaction fee causes this transaction to exceed your balance. In order to send this transaction, you will be required to pay a fee of %s BTC.

Please go back and adjust the value of your transaction, not to exceed a total of %s BTC (the necessary fee has been entered into the form, so you can use the "MAX" button to enter the remaining balance for a recipient).""") % \ (minFeeStr, newBalStr), QMessageBox.Ok) return reply = QMessageBox.warning(self, tr('Insufficient Fee'), tr(""" The fee you have specified (%s BTC) is insufficient for the size and priority of your transaction. You must include at least %s BTC to send this transaction.

Do you agree to the fee of %s BTC?""") % \ (usrFeeStr, minFeeStr, minFeeStr), \ QMessageBox.Yes | QMessageBox.Cancel) if reply == QMessageBox.Cancel: return False if reply == QMessageBox.No: pass elif reply == QMessageBox.Yes: fee = long(minFee) # Warn user of excessive fee specified if fee > 100*MIN_RELAY_TX_FEE or (minFee > 0 and fee > 10*minFee): reply = QMessageBox.warning(self, tr('Excessive Fee'), tr(""" You have specified a fee of %s BTC which is much higher than the minimum fee required for this transaction: %s BTC. Are you absolutely sure that you want to send with this fee?

If you do not want this fee, click "No" and then change the fee at the bottom of the "Send Bitcoins" window before trying again.""") % (coin2strNZS(fee), coin2strNZS(minFee)), QMessageBox.Yes | QMessageBox.No) if not reply==QMessageBox.Yes: return False if len(utxoSelect) == 0: QMessageBox.critical(self, tr('Coin Selection Error'), tr(""" There was an error constructing your transaction, due to a quirk in the way Bitcoin transactions work. If you see this error more than once, try sending your BTC in two or more separate transactions."""), QMessageBox.Ok) return False # ## IF we got here, everything is good to go... # Just need to get a change address and then construct the tx totalTxSelect = sum([u.getValue() for u in utxoSelect]) totalChange = totalTxSelect - (totalSend + fee) self.changeScript = '' self.selectedBehavior = '' if totalChange > 0: script,behavior = self.determineChangeScript(utxoSelect) self.changeScript = script self.selectedBehavior = behavior scriptValPairs.append([self.changeScript, totalChange]) LOGINFO('Change address behavior: %s', self.selectedBehavior) else: self.selectedBehavior = NO_CHANGE changePair = None if len(self.selectedBehavior) > 0: changePair = (self.changeScript, self.selectedBehavior) # Keep a copy of the originally-sorted list for display origSVPairs = scriptValPairs[:] # Anonymize the outputs random.shuffle(scriptValPairs) # In order to create the USTXI objects, need to make we supply a # map of public keys that can be included if self.lbox: p2shMap = {binary_to_hex(script_to_scrAddr(script_to_p2sh_script( self.lbox.binScript))) : self.lbox.binScript} ustx = UnsignedTransaction().createFromTxOutSelection( \ utxoSelect, scriptValPairs, p2shMap = p2shMap) for i in range(len(ustx.ustxInputs)): ustx.ustxInputs[i].contribID = self.lbox.uniqueIDB58 for i in range(len(ustx.decorTxOuts)): if ustx.decorTxOuts[i].binScript == self.lbox.binScript: ustx.decorTxOuts[i].contribID = self.lbox.uniqueIDB58 else: # If this has nothing to do with lockboxes, we need to make sure # we're providing a key map for the inputs pubKeyMap = {} for utxo in utxoSelect: scrType = getTxOutScriptType(utxo.getScript()) if scrType in CPP_TXOUT_STDSINGLESIG: scrAddr = utxo.getRecipientScrAddr() a160 = scrAddr_to_hash160(scrAddr)[1] addrObj = self.wlt.getAddrByHash160(a160) if addrObj: pubKeyMap[scrAddr] = addrObj.binPublicKey65.toBinStr() # Now create the unsigned USTX ustx = UnsignedTransaction().createFromTxOutSelection( \ utxoSelect, scriptValPairs, pubKeyMap) #ustx.pprint() txValues = [totalSend, fee, totalChange] if not self.unsignedCheckbox.isChecked(): dlg = DlgConfirmSend(self.wlt, origSVPairs, txValues[1], self, \ self.main, True, ustx) if not dlg.exec_(): return False else: self.main.warnNewUSTXFormat() return ustx def createTxAndBroadcast(self): # The Send! button is clicked validate and broadcast tx ustx = self.validateInputsGetUSTX() if ustx: if self.createUnsignedTxCallback and self.unsignedCheckbox.isChecked(): self.createUnsignedTxCallback(ustx) else: try: if self.wlt.isLocked: Passphrase = None unlockdlg = DlgUnlockWallet(self.wlt, self, self.main, 'Send Transaction', returnPassphrase=True) if unlockdlg.exec_(): if unlockdlg.Accepted == 1: Passphrase = unlockdlg.securePassphrase.copy() unlockdlg.securePassphrase.destroy() if Passphrase is None or self.wlt.kdf is None: QMessageBox.critical(self.parent(), 'Wallet is Locked', \ 'Cannot sign transaction while your wallet is locked. ', \ QMessageBox.Ok) return else: self.wlt.kdfKey = self.wlt.kdf.DeriveKey(Passphrase) Passphrase.destroy() self.wlt.mainWnd = self.main self.wlt.parent = self commentStr = '' if len(self.comments) == 1: commentStr = self.comments[0][0] else: for i in range(len(self.comments)): amt = self.comments[i][1] if len(self.comments[i][0].strip()) > 0: commentStr += '%s (%s); ' % (self.comments[i][0], coin2str_approx(amt).strip()) ustxSigned = self.wlt.signUnsignedTx(ustx) finalTx = ustxSigned.getSignedPyTx() if len(commentStr) > 0: self.wlt.setComment(finalTx.getHash(), commentStr) self.main.broadcastTransaction(finalTx) TheBDM.saveScrAddrHistories() except: LOGEXCEPT('Problem sending transaction!') # TODO: not sure what errors to catch here, yet... raise if self.sendCallback: self.sendCallback() ############################################################################# def getUsableBalance(self): if self.lbox is None: if self.altBalance == None: return self.wlt.getBalance('Spendable') else: return self.altBalance else: lbID = self.lbox.uniqueIDB58 cppWlt = self.main.cppLockboxWltMap.get(lbID) if cppWlt is None: LOGERROR('Somehow failed to get cppWlt for lockbox: %s', lbID) return cppWlt.getSpendableBalance(self.main.currBlockNum, IGNOREZC) ############################################################################# def getUsableTxOutList(self): if self.lbox is None: if self.altBalance is None: return list(self.wlt.getTxOutList('Spendable')) else: utxoList = [] for a160 in self.sourceAddrList: # Trying to avoid a swig bug involving iteration over vector<> types utxos = self.wlt.getAddrTxOutList(a160) for i in range(len(utxos)): utxoList.append(PyUnspentTxOut().createFromCppUtxo(utxos[i])) return utxoList else: lbID = self.lbox.uniqueIDB58 cppWlt = self.main.cppLockboxWltMap.get(lbID) if cppWlt is None: LOGERROR('Somehow failed to get cppWlt for lockbox: %s', lbID) txoList = cppWlt.getSpendableTxOutList(self.main.currBlockNum, IGNOREZC) pyUtxoList = [] for i in range(len(txoList)): pyUtxo = PyUnspentTxOut().createFromCppUtxo(txoList[i]) pyUtxoList.append(pyUtxo) return pyUtxoList ############################################################################# def determineChangeScript(self, utxoList): changeScript = '' changeAddrStr = '' changeAddr160 = '' selectedBehavior = 'NewAddr' if self.lbox is None else 'Feedback' if not self.main.usermode == USERMODE.Expert or \ not self.chkDefaultChangeAddr.isChecked(): # Default behavior for regular wallets is 'NewAddr', but for lockboxes # the default behavior is "Feedback" (send back to the original addr if self.lbox is None: changeAddrStr = self.wlt.getNextUnusedAddress().getAddrStr() changeAddr160 = addrStr_to_hash160(changeAddrStr)[1] changeScript = scrAddr_to_script(addrStr_to_scrAddr(changeAddrStr)) self.wlt.setComment(changeAddr160, CHANGE_ADDR_DESCR_STRING) else: changeScript = script_to_p2sh_script(self.lbox.binScript) if self.main.usermode == USERMODE.Expert: if not self.chkDefaultChangeAddr.isChecked(): self.main.setWltSetting(self.wltID, 'ChangeBehavior', selectedBehavior) else: if self.radioFeedback.isChecked(): selectedBehavior = 'Feedback' changeScript = utxoList[0].getScript() elif self.radioSpecify.isChecked(): selectedBehavior = 'Specify' changeScript = self.getUserChangeScript()['Script'] if changeScript is None: QMessageBox.warning(self, tr('Invalid Address'), tr(""" You specified an invalid change address for this transcation."""), QMessageBox.Ok) return None scrType = getTxOutScriptType(changeScript) if scrType in CPP_TXOUT_HAS_ADDRSTR: changeAddrStr = script_to_addrStr(changeScript) elif scrType==CPP_TXOUT_MULTISIG: scrP2SH = script_to_p2sh_script(changeScript) changeAddrStr = script_to_addrStr(scrP2SH) if self.main.usermode == USERMODE.Expert and self.chkRememberChng.isChecked(): self.main.setWltSetting(self.wltID, 'ChangeBehavior', selectedBehavior) if selectedBehavior == 'Specify' and len(changeAddrStr) > 0: self.main.setWltSetting(self.wltID, 'ChangeAddr', changeAddrStr) else: self.main.setWltSetting(self.wltID, 'ChangeBehavior', 'NewAddr') return changeScript,selectedBehavior ##################################################################### def setMaximum(self, targWidget): nRecip = len(self.widgetTable) totalOther = 0 r = 0 try: bal = self.getUsableBalance() txFee = str2coin(str(self.edtFeeAmt.text())) while r < nRecip: # Use while loop so 'r' is still in scope in the except-clause if targWidget == self.widgetTable[r]['QLE_AMT']: r += 1 continue amtStr = str(self.widgetTable[r]['QLE_AMT'].text()).strip() if len(amtStr) > 0: totalOther += str2coin(amtStr) r += 1 except: QMessageBox.warning(self, 'Invalid Input', \ 'Cannot compute the maximum amount ' 'because there is an error in the amount ' 'for recipient %d.' % (r + 1,), QMessageBox.Ok) return maxStr = coin2str((bal - (txFee + totalOther)), maxZeros=0) if bal < txFee + totalOther: QMessageBox.warning(self, 'Insufficient funds', \ 'You have specified more than your spendable balance to ' 'the other recipients and the transaction fee. Therefore, the ' 'maximum amount for this recipient would actually be negative.', \ QMessageBox.Ok) return targWidget.setText(maxStr.strip()) ##################################################################### def createSetMaxButton(self, targWidget): newBtn = QPushButton('MAX') newBtn.setMaximumWidth(relaxedSizeStr(self, 'MAX')[0]) newBtn.setToolTip('Fills in the maximum spendable amount minus ' 'the amounts specified for other recipients ' 'and the transaction fee ') funcSetMax = lambda: self.setMaximum(targWidget) self.connect(newBtn, SIGNAL(CLICKED), funcSetMax) return newBtn ##################################################################### def makeRecipFrame(self, nRecip): prevNRecip = len(self.widgetTable) nRecip = max(nRecip, 1) inputs = [] for i in range(nRecip): if i < prevNRecip and i < nRecip: inputs.append([]) for widg in ['QLE_ADDR', 'QLE_AMT', 'QLE_COMM']: inputs[-1].append(str(self.widgetTable[i][widg].text())) frmRecip = QFrame() frmRecip.setFrameStyle(QFrame.NoFrame) frmRecipLayout = QVBoxLayout() def revertColorCallback(row): def callbk(): self.updateAddrColor(row, Colors.Background) return callbk self.widgetTable = [] for r in range(nRecip): self.widgetTable.append({}) self.widgetTable[r]['LBL_ADDR'] = QLabel('Address %d:' % (r+1)) addrEntryWidgets = self.main.createAddressEntryWidgets(self, maxDetectLen=45, boldDetectParts=1) self.widgetTable[r]['FUNC_GETSCRIPT'] = addrEntryWidgets['CALLBACK_GETSCRIPT'] self.widgetTable[r]['QLE_ADDR'] = addrEntryWidgets['QLE_ADDR'] self.widgetTable[r]['QLE_ADDR'].setMinimumWidth(relaxedSizeNChar(GETFONT('var'), 20)[0]) self.widgetTable[r]['QLE_ADDR'].setMaximumHeight(self.maxHeight) self.widgetTable[r]['QLE_ADDR'].setFont(GETFONT('var', 9)) self.connect(self.widgetTable[r]['QLE_ADDR'], SIGNAL('textChanged(QString)'), revertColorCallback(r)) self.widgetTable[r]['BTN_BOOK'] = addrEntryWidgets['BTN_BOOK'] self.widgetTable[r]['LBL_DETECT'] = addrEntryWidgets['LBL_DETECT'] self.widgetTable[r]['LBL_AMT'] = QLabel('Amount:') self.widgetTable[r]['QLE_AMT'] = QLineEdit() self.widgetTable[r]['QLE_AMT'].setFont(GETFONT('Fixed')) self.widgetTable[r]['QLE_AMT'].setMinimumWidth(tightSizeNChar(GETFONT('Fixed'), 14)[0]) self.widgetTable[r]['QLE_AMT'].setMaximumHeight(self.maxHeight) self.widgetTable[r]['QLE_AMT'].setAlignment(Qt.AlignLeft) self.widgetTable[r]['LBL_BTC'] = QLabel('BTC') self.widgetTable[r]['LBL_BTC'].setAlignment(Qt.AlignLeft | Qt.AlignVCenter) self.widgetTable[r]['BTN_MAX'] = \ self.createSetMaxButton(self.widgetTable[r]['QLE_AMT']) self.widgetTable[r]['LBL_COMM'] = QLabel('Comment:') self.widgetTable[r]['QLE_COMM'] = QLineEdit() self.widgetTable[r]['QLE_COMM'].setFont(GETFONT('var', 9)) self.widgetTable[r]['QLE_COMM'].setMaximumHeight(self.maxHeight) if r < nRecip and r < prevNRecip: self.widgetTable[r]['QLE_ADDR'].setText(inputs[r][0]) self.widgetTable[r]['QLE_AMT'].setText(inputs[r][1]) self.widgetTable[r]['QLE_COMM'].setText(inputs[r][2]) subfrm = QFrame() subfrm.setFrameStyle(STYLE_RAISED) subLayout = QGridLayout() subLayout.addWidget(self.widgetTable[r]['LBL_ADDR'], 0,0, 1,1) subLayout.addWidget(self.widgetTable[r]['QLE_ADDR'], 0,1, 1,5) subLayout.addWidget(self.widgetTable[r]['BTN_BOOK'], 0,6, 1,1) subLayout.addWidget(self.widgetTable[r]['LBL_DETECT'], 1,1, 1,6) subLayout.addWidget(self.widgetTable[r]['LBL_AMT'], 2,0, 1,1) subLayout.addWidget(self.widgetTable[r]['QLE_AMT'], 2,1, 1,2) subLayout.addWidget(self.widgetTable[r]['LBL_BTC'], 2,3, 1,1) subLayout.addWidget(self.widgetTable[r]['BTN_MAX'], 2,4, 1,1) subLayout.addWidget(QLabel(''), 2, 5, 1, 2) subLayout.addWidget(self.widgetTable[r]['LBL_COMM'], 3,0, 1,1) subLayout.addWidget(self.widgetTable[r]['QLE_COMM'], 3,1, 1,6) subLayout.setContentsMargins(5, 5, 5, 5) subLayout.setSpacing(3) subfrm.setLayout(subLayout) frmRecipLayout.addWidget(subfrm) btnFrm = QFrame() btnFrm.setFrameStyle(QFrame.NoFrame) btnLayout = QHBoxLayout() lbtnAddRecip = QLabelButton('+ Recipient') lbtnAddRecip.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) lbtnRmRecip = QLabelButton('- Recipient') lbtnRmRecip.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) self.connect(lbtnAddRecip, SIGNAL(CLICKED), lambda: self.makeRecipFrame(nRecip + 1)) self.connect(lbtnRmRecip, SIGNAL(CLICKED), lambda: self.makeRecipFrame(nRecip - 1)) btnLayout.addStretch() btnLayout.addWidget(lbtnAddRecip) btnLayout.addWidget(lbtnRmRecip) btnFrm.setLayout(btnLayout) frmRecipLayout.addWidget(btnFrm) frmRecipLayout.addStretch() frmRecip.setLayout(frmRecipLayout) # return frmRecip self.scrollRecipArea.setWidget(frmRecip) self.scrollRecipArea.setWidgetResizable(True) ############################################################################# def addDonation(self, amt=DONATION): lastIsEmpty = True for widg in ['QLE_ADDR', 'QLE_AMT', 'QLE_COMM']: if len(str(self.widgetTable[-1][widg].text())) > 0: lastIsEmpty = False if not lastIsEmpty: self.makeRecipFrame(len(self.widgetTable) + 1) self.widgetTable[-1]['QLE_ADDR'].setText(ARMORY_DONATION_ADDR) self.widgetTable[-1]['QLE_AMT'].setText(coin2str(amt, maxZeros=2).strip()) self.widgetTable[-1]['QLE_COMM'].setText(\ 'Donation to Armory developers. Thank you for your generosity!') ############################################################################# def clickEnterURI(self): dlg = DlgUriCopyAndPaste(self.parent(), self.main) dlg.exec_() if len(dlg.uriDict) > 0: lastIsEmpty = True for widg in ['QLE_ADDR', 'QLE_AMT', 'QLE_COMM']: if len(str(self.widgetTable[-1][widg].text())) > 0: lastIsEmpty = False if not lastIsEmpty: self.makeRecipFrame(len(self.widgetTable) + 1) self.widgetTable[-1]['QLE_ADDR'].setText(dlg.uriDict['address']) if dlg.uriDict.has_key('amount'): amtStr = coin2str(dlg.uriDict['amount'], maxZeros=1).strip() self.widgetTable[-1]['QLE_AMT'].setText(amtStr) haveLbl = dlg.uriDict.has_key('label') haveMsg = dlg.uriDict.has_key('message') dispComment = '' if haveLbl and haveMsg: dispComment = dlg.uriDict['label'] + ': ' + dlg.uriDict['message'] elif not haveLbl and haveMsg: dispComment = dlg.uriDict['message'] elif haveLbl and not haveMsg: dispComment = dlg.uriDict['label'] self.widgetTable[-1]['QLE_COMM'].setText(dispComment) ############################################################################# def toggleSpecify(self, b): self.lblChangeAddr.setVisible(b) self.edtChangeAddr.setVisible(b) self.btnChangeAddr.setVisible(b) self.lblAutoDetect.setVisible(b) ############################################################################# def toggleChngAddr(self, b): self.radioFeedback.setVisible(b) self.radioSpecify.setVisible(b) self.ttipFeedback.setVisible(b) self.ttipSpecify.setVisible(b) self.chkRememberChng.setVisible(b) self.lblAutoDetect.setVisible(b) self.vertLine.setVisible(b) if not self.radioFeedback.isChecked() and not self.radioSpecify.isChecked(): self.radioFeedback.setChecked(True) self.toggleSpecify(b and self.radioSpecify.isChecked()) ############################################################################# def updateAddrColor(self, idx, color): palette = QPalette() palette.setColor(QPalette.Base, color) self.widgetTable[idx]['QLE_ADDR'].setPalette(palette); self.widgetTable[idx]['QLE_ADDR'].setAutoFillBackground(True); class ReviewOfflineTxFrame(ArmoryDialog): def __init__(self, parent=None, main=None, initLabel=''): super(ReviewOfflineTxFrame, self).__init__(parent, main) self.ustx = None self.wlt = None self.lblDescr = QRichLabel('') ttipDataIsSafe = self.main.createToolTipWidget(\ 'There is no security-sensitive information in this data below, so ' 'it is perfectly safe to copy-and-paste it into an ' 'email message, or save it to a borrowed USB key.') btnSave = QPushButton('Save as file...') self.connect(btnSave, SIGNAL(CLICKED), self.doSaveFile) ttipSave = self.main.createToolTipWidget(\ 'Save this data to a USB key or other device, to be transferred to ' 'a computer that contains the private keys for this wallet.') btnCopy = QPushButton('Copy to clipboard') self.connect(btnCopy, SIGNAL(CLICKED), self.copyAsciiUSTX) self.lblCopied = QRichLabel(' ') self.lblCopied.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) ttipCopy = self.main.createToolTipWidget(\ 'Copy the transaction data to the clipboard, so that it can be ' 'pasted into an email or a text document.') lblInstruct = QRichLabel('Instructions for completing this transaction:') self.lblUTX = QRichLabel('') frmUTX = makeLayoutFrame(HORIZONTAL, [ttipDataIsSafe, self.lblUTX]) frmUpper = makeLayoutFrame(HORIZONTAL, [self.lblDescr], STYLE_SUNKEN) # Wow, I just cannot get the txtEdits to be the right size without # forcing them very explicitly self.txtUSTX = QTextEdit() self.txtUSTX.setFont(GETFONT('Fixed', 8)) w,h = relaxedSizeNChar(self.txtUSTX, 68)[0], int(12 * 8.2) self.txtUSTX.setMinimumWidth(w) self.txtUSTX.setMinimumHeight(h) self.txtUSTX.setReadOnly(True) frmLower = QFrame() frmLower.setFrameStyle(STYLE_RAISED) frmLowerLayout = QGridLayout() frmLowerLayout.addWidget(frmUTX, 0, 0, 1, 3) frmLowerLayout.addWidget(self.txtUSTX, 1, 0, 3, 1) frmLowerLayout.addWidget(btnSave, 1, 1, 1, 1) frmLowerLayout.addWidget(ttipSave, 1, 2, 1, 1) frmLowerLayout.addWidget(btnCopy, 2, 1, 1, 1) frmLowerLayout.addWidget(ttipCopy, 2, 2, 1, 1) frmLowerLayout.addWidget(self.lblCopied, 3, 1, 1, 2) frmLowerLayout.setColumnStretch(0, 1) frmLowerLayout.setColumnStretch(1, 0) frmLowerLayout.setColumnStretch(2, 0) frmLowerLayout.setColumnStretch(3, 0) frmLowerLayout.setRowStretch(0, 0) frmLowerLayout.setRowStretch(1, 1) frmLowerLayout.setRowStretch(2, 1) frmLowerLayout.setRowStretch(3, 1) frmLower.setLayout(frmLowerLayout) frmAll = makeLayoutFrame(VERTICAL, [lblInstruct, \ frmUpper, \ 'Space(5)', \ frmLower]) frmAll.layout().setStretch(0, 0) frmAll.layout().setStretch(1, 0) frmAll.layout().setStretch(2, 0) frmAll.layout().setStretch(3, 2) frmAll.layout().setStretch(4, 1) frmAll.layout().setStretch(5, 0) dlgLayout = QVBoxLayout() dlgLayout.addWidget(frmAll) self.setLayout(dlgLayout) def setUSTX(self, ustx): self.ustx = ustx self.lblUTX.setText('Transaction Data \t (Unsigned ID: %s)' % ustx.uniqueIDB58) self.txtUSTX.setText(ustx.serializeAscii()) def setWallet(self, wlt): self.wlt = wlt if determineWalletType(wlt, self.main)[0] in \ [ WLTTYPES.Offline, WLTTYPES.WatchOnly ]: self.lblDescr.setText(tr(""" The block of data shown below is the complete transaction you just requested, but is invalid because it does not contain any signatures. You must take this data to the computer with the full wallet to get it signed, then bring it back here to be broadcast to the Bitcoin network.

Use "Save as file..." to save an *.unsigned.tx file to USB drive or other removable media. On the offline computer, click "Offline Transactions" on the main window. Load the transaction, review it, then sign it (the filename now end with *.signed.tx). Click "Continue" below when you have the signed transaction on this computer.

NOTE: The USB drive only ever holds public transaction data that will be broadcast to the network. This data may be considered privacy-sensitive, but does not compromise the security of your wallet.""")) else: self.lblDescr.setText(tr(""" You have chosen to create the previous transaction but not sign it or broadcast it, yet. You can save the unsigned transaction to file, or copy&paste from the text box. You can use the following window (after clicking "Continue") to sign and broadcast the transaction when you are ready""")) def copyAsciiUSTX(self): clipb = QApplication.clipboard() clipb.clear() clipb.setText(self.txtUSTX.toPlainText()) self.lblCopied.setText('Copied!') def doSaveFile(self): """ Save the Unsigned-Tx block of data """ dpid = self.ustx.uniqueIDB58 suffix = ('' if OS_WINDOWS else '.unsigned.tx') toSave = self.main.getFileSave(\ 'Save Unsigned Transaction', \ ['Armory Transactions (*.unsigned.tx)'], \ 'armory_%s_%s' % (dpid, suffix)) LOGINFO('Saving unsigned tx file: %s', toSave) try: theFile = open(toSave, 'w') theFile.write(self.txtUSTX.toPlainText()) theFile.close() except IOError: LOGEXCEPT('Failed to save file: %s', toSave) pass ################################################################################ class SignBroadcastOfflineTxFrame(ArmoryFrame): """ We will make the assumption that this Frame is used ONLY for outgoing transactions from your wallet. This simplifies the logic if we don't have to identify input senders/values, and handle the cases where those may not be specified """ def __init__(self, parent=None, main=None, initLabel=''): super(SignBroadcastOfflineTxFrame, self).__init__(parent, main) self.wlt = None self.sentToSelfWarn = False self.fileLoaded = None lblDescr = QRichLabel(\ 'Copy or load a transaction from file into the text box below. ' 'If the transaction is unsigned and you have the correct wallet, ' 'you will have the opportunity to sign it. If it is already signed ' 'you will have the opportunity to broadcast it to ' 'the Bitcoin network to make it final.') self.txtUSTX = QTextEdit() self.txtUSTX.setFont(GETFONT('Fixed', 8)) w,h = relaxedSizeNChar(self.txtUSTX, 68) #self.txtUSTX.sizeHint = lambda: QSize(w, h) self.txtUSTX.setMinimumWidth(w) self.txtUSTX.setMinimumHeight(8*h) self.txtUSTX.setSizePolicy(QSizePolicy.Expanding, QSizePolicy.Expanding) self.btnSign = QPushButton('Sign') self.btnBroadcast = QPushButton('Broadcast') self.btnSave = QPushButton('Save file...') self.btnLoad = QPushButton('Load file...') self.btnCopy = QPushButton('Copy Text') self.btnCopyHex = QPushButton('Copy Raw Tx (Hex)') self.lblCopied = QRichLabel('') self.lblCopied.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) self.btnSign.setEnabled(False) self.btnBroadcast.setEnabled(False) self.connect(self.txtUSTX, SIGNAL('textChanged()'), self.processUSTX) self.connect(self.btnSign, SIGNAL(CLICKED), self.signTx) self.connect(self.btnBroadcast, SIGNAL(CLICKED), self.broadTx) self.connect(self.btnSave, SIGNAL(CLICKED), self.saveTx) self.connect(self.btnLoad, SIGNAL(CLICKED), self.loadTx) self.connect(self.btnCopy, SIGNAL(CLICKED), self.copyTx) self.connect(self.btnCopyHex, SIGNAL(CLICKED), self.copyTxHex) self.lblStatus = QRichLabel('') self.lblStatus.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) wStat, hStat = relaxedSizeStr(self.lblStatus, 'Signature is Invalid!') self.lblStatus.setMinimumWidth(int(wStat * 1.2)) self.lblStatus.setMinimumHeight(int(hStat * 1.2)) frmDescr = makeLayoutFrame(HORIZONTAL, [lblDescr], STYLE_RAISED) self.infoLbls = [] # ## self.infoLbls.append([]) self.infoLbls[-1].append(self.main.createToolTipWidget(\ 'This is wallet from which the offline transaction spends bitcoins')) self.infoLbls[-1].append(QRichLabel('Wallet:')) self.infoLbls[-1].append(QRichLabel('')) # ## self.infoLbls.append([]) self.infoLbls[-1].append(self.main.createToolTipWidget('The name of the wallet')) self.infoLbls[-1].append(QRichLabel('Wallet Label:')) self.infoLbls[-1].append(QRichLabel('')) # ## self.infoLbls.append([]) self.infoLbls[-1].append(self.main.createToolTipWidget(\ 'A unique string that identifies an unsigned transaction. ' 'This is different than the ID that the transaction will have when ' 'it is finally broadcast, because the broadcast ID cannot be ' 'calculated without all the signatures')) self.infoLbls[-1].append(QRichLabel('Pre-Broadcast ID:')) self.infoLbls[-1].append(QRichLabel('')) # ## self.infoLbls.append([]) self.infoLbls[-1].append(self.main.createToolTipWidget(\ 'Net effect on this wallet\'s balance')) self.infoLbls[-1].append(QRichLabel('Transaction Amount:')) self.infoLbls[-1].append(QRichLabel('')) self.moreInfo = QLabelButton('Click here for more
information about
this transaction') self.connect(self.moreInfo, SIGNAL(CLICKED), self.execMoreTxInfo) frmMoreInfo = makeLayoutFrame(HORIZONTAL, [self.moreInfo], STYLE_SUNKEN) frmMoreInfo.setMinimumHeight(tightSizeStr(self.moreInfo, 'Any String')[1] * 5) expert = (self.main.usermode == USERMODE.Expert) frmBtn = makeLayoutFrame(VERTICAL, [ self.btnSign, \ self.btnBroadcast, \ self.btnSave, \ self.btnLoad, \ self.btnCopy, \ self.btnCopyHex if expert else QRichLabel(''), \ self.lblCopied, \ HLINE(), \ self.lblStatus, \ HLINE(), \ 'Stretch', \ frmMoreInfo]) frmBtn.setMaximumWidth(tightSizeNChar(QPushButton(''), 30)[0]) frmInfoLayout = QGridLayout() for r in range(len(self.infoLbls)): for c in range(len(self.infoLbls[r])): frmInfoLayout.addWidget(self.infoLbls[r][c], r, c, 1, 1) frmInfo = QFrame() frmInfo.setFrameStyle(STYLE_SUNKEN) frmInfo.setLayout(frmInfoLayout) frmBottom = QFrame() frmBottom.setFrameStyle(STYLE_SUNKEN) frmBottomLayout = QGridLayout() frmBottomLayout.addWidget(self.txtUSTX, 0, 0, 1, 1) frmBottomLayout.addWidget(frmBtn, 0, 1, 2, 1) frmBottomLayout.addWidget(frmInfo, 1, 0, 1, 1) # frmBottomLayout.addWidget(frmMoreInfo, 1,1, 1,1) frmBottom.setLayout(frmBottomLayout) layout = QVBoxLayout() layout.addWidget(frmDescr) layout.addWidget(frmBottom) self.setLayout(layout) self.processUSTX() def processUSTX(self): # TODO: it wouldn't be TOO hard to modify this dialog to take # arbitrary hex-serialized transactions for broadcast... # but it's not trivial either (for instance, I assume # that we have inputs values, etc) self.wlt = None self.leValue = None self.ustxObj = None self.idxSelf = [] self.idxOther = [] self.lblStatus.setText('') self.lblCopied.setText('') self.enoughSigs = False self.sigsValid = False self.ustxReadable = False ustxStr = str(self.txtUSTX.toPlainText()) try: self.ustxObj = UnsignedTransaction().unserializeAscii(ustxStr) self.signStat = self.ustxObj.evaluateSigningStatus() self.enoughSigs = self.signStat.canBroadcast self.sigsValid = self.ustxObj.verifySigsAllInputs() self.ustxReadable = True except BadAddressError: QMessageBox.critical(self, 'Inconsistent Data!', \ 'This transaction contains inconsistent information. This ' 'is probably not your fault...', QMessageBox.Ok) self.ustxObj = None self.ustxReadable = False except NetworkIDError: QMessageBox.critical(self, 'Wrong Network!', \ 'This transaction is actually for a different network! ' 'Did you load the correct transaction?', QMessageBox.Ok) self.ustxObj = None self.ustxReadable = False except (UnserializeError, IndexError, ValueError): self.ustxObj = None self.ustxReadable = False if not self.enoughSigs or not self.sigsValid or not self.ustxReadable: self.btnBroadcast.setEnabled(False) else: if self.main.netMode == NETWORKMODE.Full: self.btnBroadcast.setEnabled(True) else: self.btnBroadcast.setEnabled(False) self.btnBroadcast.setToolTip('No connection to Bitcoin network!') self.btnSave.setEnabled(True) self.btnCopyHex.setEnabled(False) if not self.ustxReadable: if len(ustxStr) > 0: self.lblStatus.setText('Unrecognized!') else: self.lblStatus.setText('') self.btnSign.setEnabled(False) self.btnBroadcast.setEnabled(False) self.btnSave.setEnabled(False) self.makeReviewFrame() return elif not self.enoughSigs: if not self.main.getSettingOrSetDefault('DNAA_ReviewOfflineTx', False): result = MsgBoxWithDNAA(MSGBOX.Warning, title='Offline Warning', \ msg='Please review your transaction carefully before ' 'signing and broadcasting it! The extra security of ' 'using offline wallets is lost if you do ' 'not confirm the transaction is correct!', dnaaMsg=None) self.main.writeSetting('DNAA_ReviewOfflineTx', result[1]) self.lblStatus.setText('Unsigned') self.btnSign.setEnabled(True) self.btnBroadcast.setEnabled(False) elif not self.sigsValid: self.lblStatus.setText('Bad Signature!') self.btnSign.setEnabled(True) self.btnBroadcast.setEnabled(False) else: self.lblStatus.setText('All Signatures Valid!') self.btnSign.setEnabled(False) self.btnCopyHex.setEnabled(True) # NOTE: We assume this is an OUTGOING transaction. When I pull in the # multi-sig code, I will have to either make a different dialog, # or add some logic to this one FIELDS = enum('Hash', 'OutList', 'SumOut', 'InList', 'SumIn', 'Time', 'Blk', 'Idx') data = extractTxInfo(self.ustxObj, -1) # Collect the input wallets (hopefully just one of them) fromWlts = set() for scrAddr, amt, a, b, c, script in data[FIELDS.InList]: wltID = self.main.getWalletForAddr160(scrAddr[1:]) if not wltID == '': fromWlts.add(wltID) if len(fromWlts) > 1: QMessageBox.warning(self, 'Multiple Input Wallets', \ 'Somehow, you have obtained a transaction that actually pulls from more ' 'than one wallet. The support for handling multi-wallet signatures is ' 'not currently implemented (this also could have happened if you imported ' 'the same private key into two different wallets).' , QMessageBox.Ok) self.makeReviewFrame() return elif len(fromWlts) == 0: QMessageBox.warning(self, 'Unrelated Transaction', \ 'This transaction appears to have no relationship to any of the wallets ' 'stored on this computer. Did you load the correct transaction?', \ QMessageBox.Ok) self.makeReviewFrame() return spendWltID = fromWlts.pop() self.wlt = self.main.walletMap[spendWltID] toWlts = set() myOutSum = 0 theirOutSum = 0 rvPairs = [] idx = 0 for scrType, amt, binScript, multiSigList in data[FIELDS.OutList]: recip = script_to_scrAddr(binScript) try: wltID = self.main.getWalletForAddr160(CheckHash160(recip)) except BadAddressError: wltID = '' if wltID == spendWltID: toWlts.add(wltID) myOutSum += amt self.idxSelf.append(idx) else: rvPairs.append([recip, amt]) theirOutSum += amt self.idxOther.append(idx) idx += 1 myInSum = data[FIELDS.SumIn] # because we assume all are ours if myInSum == None: fee = None else: fee = myInSum - data[FIELDS.SumOut] self.leValue = theirOutSum self.makeReviewFrame() ############################################################################ def makeReviewFrame(self): # ## if self.ustxObj == None: self.infoLbls[0][2].setText('') self.infoLbls[1][2].setText('') self.infoLbls[2][2].setText('') self.infoLbls[3][2].setText('') else: ##### 0 ##### 1 if self.wlt: self.infoLbls[0][2].setText(self.wlt.uniqueIDB58) self.infoLbls[1][2].setText(self.wlt.labelName) else: self.infoLbls[0][2].setText('[[ Unrelated ]]') self.infoLbls[1][2].setText('') ##### 2 self.infoLbls[2][2].setText(self.ustxObj.uniqueIDB58) ##### 3 if self.leValue: self.infoLbls[3][2].setText(coin2strNZS(self.leValue) + ' BTC') else: self.infoLbls[3][2].setText('') self.moreInfo.setVisible(True) def execMoreTxInfo(self): if not self.ustxObj: self.processUSTX() if not self.ustxObj: QMessageBox.warning(self, 'Invalid Transaction', \ 'Transaction data is invalid and cannot be shown!', QMessageBox.Ok) return leVal = 0 if self.leValue is None else -self.leValue dlgTxInfo = DlgDispTxInfo(self.ustxObj, self.wlt, self.parent(), self.main, \ precomputeIdxGray=self.idxSelf, precomputeAmt=leVal, txtime=-1) dlgTxInfo.exec_() def signTx(self): if not self.ustxObj: QMessageBox.critical(self, 'Cannot Sign', \ 'This transaction is not relevant to any of your wallets.' 'Did you load the correct transaction?', QMessageBox.Ok) return if self.ustxObj == None: QMessageBox.warning(self, 'Not Signable', \ 'This is not a valid transaction, and thus it cannot ' 'be signed. ', QMessageBox.Ok) return elif self.enoughSigs and self.sigsValid: QMessageBox.warning(self, 'Already Signed', \ 'This transaction has already been signed!', QMessageBox.Ok) return if self.wlt and self.wlt.watchingOnly: QMessageBox.warning(self, 'No Private Keys!', \ 'This transaction refers one of your wallets, but that wallet ' 'is a watching-only wallet. Therefore, private keys are ' 'not available to sign this transaction.', \ QMessageBox.Ok) return # We should provide the same confirmation dialog here, as we do when # sending a regular (online) transaction. But the DlgConfirmSend was # not really designed ustx = self.ustxObj svpairs = [] svpairsMine = [] theFee = ustx.calculateFee() for scrType,value,script,msInfo in ustx.pytxObj.makeRecipientsList(): svpairs.append([script, value]) if scrType in CPP_TXOUT_STDSINGLESIG: addrStr = script_to_addrStr(script) if self.wlt.hasAddr(addrStr_to_hash160(addrStr)[1]): svpairsMine.append([script, value]) if len(svpairsMine) == 0 and len(svpairs) > 1: QMessageBox.warning(self, tr('Missing Change'), tr(""" This transaction has %d recipients, and none of them are addresses in this wallet (for receiving change). This can happen if you specified a custom change address for this transaction, or sometimes happens solely by chance with a multi-recipient transaction. It could also be the result of someone tampering with the transaction.

The transaction is valid and ready to be signed. Please verify the recipient and amounts carefully before confirming the transaction on the next screen.""") % \ len(svpairs), QMessageBox.Ok) dlg = DlgConfirmSend(self.wlt, svpairs, theFee, self, self.main, pytxOrUstx=ustx) if not dlg.exec_(): return if self.wlt.useEncryption and self.wlt.isLocked: Passphrase = None unlockdlg = DlgUnlockWallet(self.wlt, self, self.main, 'Send Transaction', returnPassphrase=True) if unlockdlg.exec_(): if unlockdlg.Accepted == 1: Passphrase = unlockdlg.securePassphrase.copy() unlockdlg.securePassphrase.destroy() if Passphrase is None or self.wlt.kdf is None: QMessageBox.critical(self.parent(), 'Wallet is Locked', \ 'Cannot sign transaction while your wallet is locked. ', \ QMessageBox.Ok) return else: self.wlt.kdfKey = self.wlt.kdf.DeriveKey(Passphrase) Passphrase.destroy() newUstx = self.wlt.signUnsignedTx(self.ustxObj) self.wlt.advanceHighestIndex() self.txtUSTX.setText(newUstx.serializeAscii()) self.ustxObj = newUstx if not self.fileLoaded == None: self.saveTxAuto() def broadTx(self): if self.main.netMode == NETWORKMODE.Disconnected: QMessageBox.warning(self, 'No Internet!', \ 'Armory lost its connection to Bitcoin-Qt, and cannot ' 'broadcast any transactions until it is reconnected. ' 'Please verify that Bitcoin-Qt (or bitcoind) is open ' 'and synchronized with the network.', QMessageBox.Ok) return elif self.main.netMode == NETWORKMODE.Offline: QMessageBox.warning(self, 'No Internet!', \ 'You do not currently have a connection to the Bitcoin network. ' 'If this does not seem correct, verify that Bitcoin-Qt is open ' 'and synchronized with the network.', QMessageBox.Ok) return try: finalTx = self.ustxObj.getSignedPyTx() except SignatureError: QMessageBox.warning(self, 'Signature Error', tr(""" Not all signatures are valid. This transaction cannot be broadcast."""), QMessageBox.Ok) except: QMessageBox.warning(self, tr('Error'), tr(""" There was an error processing this transaction, for reasons that are probably not your fault..."""), QMessageBox.Ok) return # We should provide the same confirmation dialog here, as we do when # sending a regular (online) transaction. But the DlgConfirmSend was # not really designed ustx = self.ustxObj svpairs = [[r[2],r[1]] for r in ustx.pytxObj.makeRecipientsList()] theFee = ustx.calculateFee() doIt = True if self.wlt: dlg = DlgConfirmSend(self.wlt, svpairs, theFee, self, self.main, sendNow=True, pytxOrUstx=ustx) doIt = dlg.exec_() if doIt: self.main.broadcastTransaction(finalTx) if self.fileLoaded and os.path.exists(self.fileLoaded): try: # pcs = self.fileLoaded.split('.') # newFileName = '.'.join(pcs[:-2]) + '.DONE.' + '.'.join(pcs[-2:]) shutil.move(self.fileLoaded, self.fileLoaded.replace('signed', 'SENT')) except: QMessageBox.critical(self, 'File Remove Error', \ 'The file could not be deleted. If you want to delete ' 'it, please do so manually. The file was loaded from: ' '

%s: ' % self.fileLoaded, QMessageBox.Ok) try: self.parent().accept() except: # This just attempts to close the OfflineReview&Sign window. If # it fails, the user can close it themselves. LOGEXCEPT('Could not close/accept parent dialog.') def saveTxAuto(self): if not self.ustxReadable: QMessageBox.warning(self, 'Formatting Error', \ 'The transaction data was not in a format recognized by ' 'Armory.') return if not self.fileLoaded == None and self.enoughSigs and self.sigsValid: newSaveFile = self.fileLoaded.replace('unsigned', 'signed') LOGINFO('New save file: %s' % newSaveFile) f = open(newSaveFile, 'w') f.write(str(self.txtUSTX.toPlainText())) f.close() if not newSaveFile == self.fileLoaded: os.remove(self.fileLoaded) self.fileLoaded = newSaveFile QMessageBox.information(self, 'Transaction Saved!', \ 'Your transaction has been saved to the following location:' '\n\n%s\n\nIt can now be broadcast from any computer running ' 'Armory in online mode.' % newSaveFile, QMessageBox.Ok) return def saveTx(self): if not self.ustxReadable: QMessageBox.warning(self, 'Formatting Error', \ 'The transaction data was not in a format recognized by ' 'Armory.') return # The strange windows branching is because PyQt in Windows automatically # adds the ffilter suffix to the default filename, where as it needs to # be explicitly added in PyQt in Linux. Not sure why this behavior exists. defaultFilename = '' if not self.ustxObj == None: if self.enoughSigs and self.sigsValid: suffix = '' if OS_WINDOWS else '.signed.tx' defaultFilename = 'armory_%s_%s' % (self.ustxObj.uniqueIDB58, suffix) ffilt = 'Transactions (*.signed.tx *.unsigned.tx)' else: suffix = '' if OS_WINDOWS else '.unsigned.tx' defaultFilename = 'armory_%s_%s' % (self.ustxObj.uniqueIDB58, suffix) ffilt = 'Transactions (*.unsigned.tx *.signed.tx)' filename = self.main.getFileSave('Save Transaction', \ [ffilt], \ defaultFilename) if len(str(filename)) > 0: LOGINFO('Saving transaction file: %s', filename) f = open(filename, 'w') f.write(str(self.txtUSTX.toPlainText())) f.close() def loadTx(self): filename = self.main.getFileLoad(tr('Load Transaction'), \ ['Transactions (*.signed.tx *.unsigned.tx *.SENT.tx)']) if len(str(filename)) > 0: LOGINFO('Selected transaction file to load: %s', filename) f = open(filename, 'r') self.txtUSTX.setText(f.read()) f.close() self.fileLoaded = filename def copyTx(self): clipb = QApplication.clipboard() clipb.clear() clipb.setText(str(self.txtUSTX.toPlainText())) self.lblCopied.setText('Copied!') def copyTxHex(self): clipb = QApplication.clipboard() clipb.clear() clipb.setText(binary_to_hex(self.ustxObj.getSignedPyTx().serialize())) self.lblCopied.setText('Copied!') # Need to put circular imports at the end of the script to avoid an import deadlock from qtdialogs import CLICKED, DlgConfirmSend, DlgUriCopyAndPaste, \ DlgUnlockWallet, extractTxInfo, DlgDispTxInfo, NO_CHANGE armory-0.92.3/ui/Wizards.py0000644000000000000000000004105512414772654014247 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ from PyQt4.Qt import * #@UnusedWildImport from PyQt4.QtGui import * #@UnusedWildImport from armoryengine.ArmoryUtils import USE_TESTNET from ui.WalletFrames import NewWalletFrame, SetPassphraseFrame, VerifyPassphraseFrame,\ WalletBackupFrame, WizardCreateWatchingOnlyWalletFrame from ui.TxFrames import SendBitcoinsFrame, SignBroadcastOfflineTxFrame,\ ReviewOfflineTxFrame from qtdefines import USERMODE, GETFONT, tr, AddToRunningDialogsList from armoryengine.PyBtcWallet import PyBtcWallet from CppBlockUtils import SecureBinaryData from armoryengine.BDM import TheBDM from qtdialogs import DlgProgress # This class is intended to be an abstract Wizard class that # will hold all of the functionality that is common to all # Wizards in Armory. class ArmoryWizard(QWizard): def __init__(self, parent, main): super(QWizard, self).__init__(parent) self.setWizardStyle(QWizard.ClassicStyle) self.parent = parent self.main = main self.setFont(GETFONT('var')) self.setWindowFlags(Qt.Window) # Need to adjust the wizard frame size whenever the page changes. self.connect(self, SIGNAL('currentIdChanged(int)'), self.fitContents) if USE_TESTNET: self.setWindowTitle('Armory - Bitcoin Wallet Management [TESTNET]') self.setWindowIcon(QIcon(':/armory_icon_green_32x32.png')) else: self.setWindowTitle('Armory - Bitcoin Wallet Management') self.setWindowIcon(QIcon(':/armory_icon_32x32.png')) def fitContents(self): self.adjustSize() @AddToRunningDialogsList def exec_(self): return super(ArmoryWizard, self).exec_() # This class is intended to be an abstract Wizard Page class that # will hold all of the functionality that is common to all # Wizard pages in Armory. # The layout is QVBoxLayout and holds a single QFrame (self.pageFrame) class ArmoryWizardPage(QWizardPage): def __init__(self, wizard, pageFrame): super(ArmoryWizardPage, self).__init__(wizard) self.pageFrame = pageFrame self.pageLayout = QVBoxLayout() self.pageLayout.addWidget(self.pageFrame) self.setLayout(self.pageLayout) # override this method to implement validators def validatePage(self): return True ################################ Wallet Wizard ################################ # Wallet Wizard has these pages: # 1. Create Wallet # 2. Set Passphrase # 3. Verify Passphrase # 4. Create Paper Backup # 5. Create Watcing Only Wallet class WalletWizard(ArmoryWizard): def __init__(self, parent, main): super(WalletWizard,self).__init__(parent, main) self.newWallet = None self.isBackupCreated = False self.setWindowTitle(tr("Wallet Creation Wizard")) self.setOption(QWizard.HaveFinishButtonOnEarlyPages, on=True) self.setOption(QWizard.IgnoreSubTitles, on=True) # Page 1: Create Wallet self.walletCreationPage = WalletCreationPage(self) self.addPage(self.walletCreationPage) # Page 2: Set Passphrase self.setPassphrasePage = SetPassphrasePage(self) self.addPage(self.setPassphrasePage) # Page 3: Verify Passphrase self.verifyPassphrasePage = VerifyPassphrasePage(self) self.addPage(self.verifyPassphrasePage) # Page 4: Create Paper Backup self.walletBackupPage = WalletBackupPage(self) self.addPage(self.walletBackupPage) # Page 5: Create Watching Only Wallet -- but only if expert, or offline self.hasCWOWPage = False if self.main.usermode==USERMODE.Expert or not self.main.internetAvail: self.hasCWOWPage = True self.createWOWPage = CreateWatchingOnlyWalletPage(self) self.addPage(self.createWOWPage) self.setButtonLayout([QWizard.BackButton, QWizard.Stretch, QWizard.NextButton, QWizard.FinishButton]) def initializePage(self, *args, **kwargs): if self.currentPage() == self.verifyPassphrasePage: self.verifyPassphrasePage.setPassphrase( self.setPassphrasePage.pageFrame.getPassphrase()) elif self.hasCWOWPage and self.currentPage() == self.createWOWPage: self.createWOWPage.pageFrame.setWallet(self.newWallet) if self.currentPage() == self.walletBackupPage: self.createNewWalletFromWizard() self.walletBackupPage.pageFrame.setPassphrase( self.setPassphrasePage.pageFrame.getPassphrase()) self.walletBackupPage.pageFrame.setWallet(self.newWallet) # Hide the back button on wallet backup page self.setButtonLayout([QWizard.Stretch, QWizard.NextButton, QWizard.FinishButton]) elif self.currentPage() == self.walletCreationPage: # Hide the back button on the first page self.setButtonLayout([QWizard.Stretch, QWizard.NextButton, QWizard.FinishButton]) else: self.setButtonLayout([QWizard.BackButton, QWizard.Stretch, QWizard.NextButton, QWizard.FinishButton]) def done(self, event): if self.newWallet and not self.walletBackupPage.pageFrame.isBackupCreated: reply = QMessageBox.question(self, tr('Wallet Backup Warning'), tr(""" You have not made a backup for your new wallet. You only have to make a backup of your wallet one time to protect all the funds held by this wallet any time in the future (it is a backup of the signing keys, not the coins themselves).

If you do not make a backup, you will permanently lose the money in this wallet if you ever forget your password, or suffer from hardware failure.

Are you sure that you want to leave this wizard without backing up your wallet?"""), \ QMessageBox.Yes | QMessageBox.No) if reply == QMessageBox.No: # Stay in the wizard return None return super(WalletWizard, self).done(event) def createNewWalletFromWizard(self): self.newWallet = PyBtcWallet().createNewWallet( \ securePassphrase=self.setPassphrasePage.pageFrame.getPassphrase(), \ kdfTargSec=self.walletCreationPage.pageFrame.getKdfSec(), \ kdfMaxMem=self.walletCreationPage.pageFrame.getKdfBytes(), \ shortLabel=self.walletCreationPage.pageFrame.getName(), \ longLabel=self.walletCreationPage.pageFrame.getDescription(), \ doRegisterWithBDM=False, \ extraEntropy=self.main.getExtraEntropyForKeyGen()) self.newWallet.unlock(securePassphrase= SecureBinaryData(self.setPassphrasePage.pageFrame.getPassphrase())) # We always want to fill the address pool, right away. fillPoolProgress = DlgProgress(self, self.main, HBar=1, \ Title="Creating Wallet") fillPoolProgress.exec_(self.newWallet.fillAddressPool, doRegister=False, Progress=fillPoolProgress.UpdateHBar) # Reopening from file helps make sure everything is correct -- don't # let the user use a wallet that triggers errors on reading it wltpath = self.newWallet.walletPath walletFromDisk = PyBtcWallet().readWalletFile(wltpath) self.main.addWalletToApplication(walletFromDisk, walletIsNew=True) if TheBDM.getBDMState() in ('Uninitialized', 'Offline'): TheBDM.registerWallet(walletFromDisk, isFresh=True, wait=False) else: self.main.newWalletList.append([walletFromDisk, True]) def cleanupPage(self, *args, **kwargs): if self.hasCWOWPage and self.currentPage() == self.createWOWPage: self.setButtonLayout([QWizard.Stretch, QWizard.NextButton, QWizard.FinishButton]) # If we are backing up from setPassphrasePage must be going # to the first page. elif self.currentPage() == self.setPassphrasePage: # Hide the back button on the first page self.setButtonLayout([QWizard.Stretch, QWizard.NextButton, QWizard.FinishButton]) else: self.setButtonLayout([QWizard.BackButton, QWizard.Stretch, QWizard.NextButton, QWizard.FinishButton]) class WalletCreationPage(ArmoryWizardPage): def __init__(self, wizard): super(WalletCreationPage, self).__init__(wizard, NewWalletFrame(wizard, wizard.main, "Primary Wallet")) self.setTitle(tr("Step 1: Create Wallet")) self.setSubTitle(tr(""" Create a new wallet for managing your funds. The name and description can be changed at any time.""")) # override this method to implement validators def validatePage(self): result = True if self.pageFrame.getKdfSec() == -1: QMessageBox.critical(self, 'Invalid Target Compute Time', \ 'You entered Target Compute Time incorrectly.\n\nEnter: (ms, s)', QMessageBox.Ok) result = False elif self.pageFrame.getKdfBytes() == -1: QMessageBox.critical(self, 'Invalid Max Memory Usage', \ 'You entered Max Memory Usag incorrectly.\n\nnter: (kb, mb)', QMessageBox.Ok) result = False return result class SetPassphrasePage(ArmoryWizardPage): def __init__(self, wizard): super(SetPassphrasePage, self).__init__(wizard, SetPassphraseFrame(wizard, wizard.main, "Set Passphrase", self.updateNextButton)) self.setTitle(tr("Step 2: Set Passphrase")) self.updateNextButton() def updateNextButton(self): self.emit(SIGNAL("completeChanged()")) def isComplete(self): return self.pageFrame.checkPassphrase(False) class VerifyPassphrasePage(ArmoryWizardPage): def __init__(self, wizard): super(VerifyPassphrasePage, self).__init__(wizard, VerifyPassphraseFrame(wizard, wizard.main, "Verify Passphrase")) self.passphrase = None self.setTitle(tr("Step 3: Verify Passphrase")) def setPassphrase(self, passphrase): self.passphrase = passphrase def validatePage(self): result = self.passphrase == str(self.pageFrame.edtPasswd3.text()) if not result: QMessageBox.critical(self, 'Invalid Passphrase', \ 'You entered your confirmation passphrase incorrectly!', QMessageBox.Ok) return result class WalletBackupPage(ArmoryWizardPage): def __init__(self, wizard): super(WalletBackupPage, self).__init__(wizard, WalletBackupFrame(wizard, wizard.main, "Backup Wallet")) self.myWizard = wizard self.setTitle(tr("Step 4: Backup Wallet")) self.setFinalPage(True) class CreateWatchingOnlyWalletPage(ArmoryWizardPage): def __init__(self, wizard): super(CreateWatchingOnlyWalletPage, self).__init__(wizard, WizardCreateWatchingOnlyWalletFrame(wizard, wizard.main, "Create Watching Only Wallet")) self.setTitle(tr("Step 5: Create Watching Only Wallet")) ############################### Offline TX Wizard ############################## # Offline TX Wizard has these pages: # 1. Create Transaction # 2. Sign Transaction on Offline Computer # 3. Broadcast Transaction class TxWizard(ArmoryWizard): def __init__(self, parent, main, wlt, prefill=None, onlyOfflineWallets=False): super(TxWizard,self).__init__(parent, main) self.setWindowTitle(tr("Offline Transaction Wizard")) self.setOption(QWizard.IgnoreSubTitles, on=True) self.setOption(QWizard.HaveCustomButton1, on=True) self.setOption(QWizard.HaveFinishButtonOnEarlyPages, on=True) # Page 1: Create Offline TX self.createTxPage = CreateTxPage(self, wlt, prefill, onlyOfflineWallets=onlyOfflineWallets) self.addPage(self.createTxPage) # Page 2: Sign Offline TX self.reviewOfflineTxPage = ReviewOfflineTxPage(self) self.addPage(self.reviewOfflineTxPage) # Page 3: Broadcast Offline TX self.signBroadcastOfflineTxPage = SignBroadcastOfflineTxPage(self) self.addPage(self.signBroadcastOfflineTxPage) self.setButtonText(QWizard.NextButton, tr('Create Unsigned Transaction')) self.setButtonText(QWizard.CustomButton1, tr('Send!')) self.connect(self, SIGNAL('customButtonClicked(int)'), self.sendClicked) self.setButtonLayout([QWizard.CancelButton, QWizard.BackButton, QWizard.Stretch, QWizard.NextButton, QWizard.CustomButton1]) def initializePage(self, *args, **kwargs): if self.currentPage() == self.createTxPage: self.createTxPage.pageFrame.fireWalletChange() elif self.currentPage() == self.reviewOfflineTxPage: self.setButtonText(QWizard.NextButton, tr('Next')) self.setButtonLayout([QWizard.BackButton, QWizard.Stretch, QWizard.NextButton, QWizard.FinishButton]) self.reviewOfflineTxPage.pageFrame.setTxDp(self.createTxPage.txdp) self.reviewOfflineTxPage.pageFrame.setWallet( self.createTxPage.pageFrame.wlt) def cleanupPage(self, *args, **kwargs): if self.currentPage() == self.reviewOfflineTxPage: self.updateOnSelectWallet(self.createTxPage.pageFrame.wlt) self.setButtonText(QWizard.NextButton, tr('Create Unsigned Transaction')) def sendClicked(self, customButtonIndex): self.createTxPage.pageFrame.createTxAndBroadcast() self.accept() def updateOnSelectWallet(self, wlt): if wlt.watchingOnly: self.setButtonLayout([QWizard.CancelButton, QWizard.BackButton, QWizard.Stretch, QWizard.NextButton]) else: self.setButtonLayout([QWizard.CancelButton, QWizard.BackButton, QWizard.Stretch, QWizard.NextButton, QWizard.CustomButton1]) class CreateTxPage(ArmoryWizardPage): def __init__(self, wizard, wlt, prefill=None, onlyOfflineWallets=False): super(CreateTxPage, self).__init__(wizard, SendBitcoinsFrame(wizard, wizard.main, "Create Transaction", wlt, prefill, selectWltCallback=self.updateOnSelectWallet, onlyOfflineWallets=onlyOfflineWallets)) self.setTitle(tr("Step 1: Create Transaction")) self.txdp = None def validatePage(self): result = self.pageFrame.validateInputsGetTxDP() # the validator also computes the transaction and returns it or False if not valid if result: self.txdp = result result = True return result def updateOnSelectWallet(self, wlt): self.wizard().updateOnSelectWallet(wlt) class ReviewOfflineTxPage(ArmoryWizardPage): def __init__(self, wizard): super(ReviewOfflineTxPage, self).__init__(wizard, ReviewOfflineTxFrame(wizard, wizard.main, "Review Offline Transaction")) self.setTitle(tr("Step 2: Review Offline Transaction")) self.setFinalPage(True) class SignBroadcastOfflineTxPage(ArmoryWizardPage): def __init__(self, wizard): super(SignBroadcastOfflineTxPage, self).__init__(wizard, SignBroadcastOfflineTxFrame(wizard, wizard.main, "Sign/Broadcast Offline Transaction")) self.setTitle(tr("Step 3: Sign/Broadcast Offline Transaction")) armory-0.92.3/ui/VerifyOfflinePackage.py0000644000000000000000000001261712414772654016651 0ustar rootrootfrom PyQt4.Qt import * #@UnusedWildImport from PyQt4.QtGui import * #@UnusedWildImport from qtdefines import tr, QRichLabel, ArmoryDialog from armoryengine.parseAnnounce import * from armorycolors import htmlColor class VerifyOfflinePackageDialog(ArmoryDialog): def __init__(self, parent, main): super(VerifyOfflinePackageDialog, self).__init__(parent) self.main = main layout = QVBoxLayout(self) load = QGroupBox(tr("Load Signed Package"), self) layout.addWidget(load) layoutload = QVBoxLayout() load.setLayout(layoutload) self.loadFileButton = QPushButton(tr("Select file to verify..."), load); layoutload.addWidget(self.loadFileButton) self.connect(self.loadFileButton, SIGNAL('clicked()'), self.load) self.lblVerified = QRichLabel('', hAlign=Qt.AlignHCenter, doWrap=False) layout.addWidget(self.lblVerified) save = QGroupBox(tr("Save Verified Package"), self) layout.addItem(QSpacerItem(10,10)) layout.addWidget(save) layoutsave = QVBoxLayout() save.setLayout(layoutsave) self.saveFileButton = QPushButton(tr("Select file to save to..."), load); self.saveFileButton.setEnabled(False) layoutsave.addWidget(self.saveFileButton) self.connect(self.saveFileButton, SIGNAL('clicked()'), self.save) self.setWindowTitle('Verify Signed Package') def load(self): self.fileData = None #self.fromfile = QFileDialog.getOpenFileName(self, tr("Load file to verify"), "", tr("Armory Signed Packages (*.signed)")) self.fromfile = self.main.getFileLoad(tr('Load file to Verify'),\ ['Armory Signed Packages (*.signed)']) if len(self.fromfile)==0: return df = open(self.fromfile, "rb") allfile = df.read() df.close() magicstart="START_OF_SIGNATURE_SECTION" magicend="END_OF_SIGNATURE_SECTION" if 0 != allfile.find(magicstart, 0, 1024*1024*4): # don't search past 4MiB QMessageBox.warning(self, tr("Invalid File"), tr("This file is not a signed package")) return end = allfile.find(magicend, 0, 1024*1024*4) # don't search past 4MiB if -1 == end: # don't search past 4MiB QMessageBox.warning(self, tr("Invalid File"), tr("The end of the signature in the file could not be found")) signatureData = allfile[len(magicstart):end] fileData = allfile[end+len(magicend):] print "All:",end, end+len(magicend), len(fileData), len(allfile) allsigs = downloadLinkParser(filetext=signatureData).downloadMap res = binary_to_hex(sha256(fileData)) good=False url=None print "Hash of package file: ", res # simply check if any of the hashes match for pack in allsigs.itervalues(): for packver in pack.itervalues(): for packos in packver.itervalues(): for packosver in packos.itervalues(): for packosarch in packosver.itervalues(): okhash = packosarch[1] if okhash == res: url = packosarch[0] good=True if good: self.saveFileButton.setEnabled(True) self.fileData = fileData self.fileName = os.path.basename(url) self.lblVerified.setText(tr("""Signature is Valid!""") % htmlColor('TextGreen')) reply = QMessageBox.warning(self, tr("Signature Valid"), tr(""" The downloaded file has a valid signature from Armory Technologies, Inc., and is safe to install.

Would you like to overwrite the original file with the extracted installer? If you would like to save it to a new location, click "No" and then use the "Save Verified Package" button to select a new save location.""") % htmlColor('TextGreen'), \ QMessageBox.Yes | QMessageBox.No) if reply==QMessageBox.Yes: newFile = self.fromfile if newFile.endswith('.signed'): newFile = self.fromfile[:-7] LOGINFO('Saving installer to: ' + newFile) with open(newFile, 'wb') as df: df.write(self.fileData) if os.path.exists(newFile): LOGINFO('Removing original file: ' + self.fromfile) os.remove(self.fromfile) QMessageBox.warning(self, tr('Saved!'), tr(""" The installer was successfully extracted and saved to the following location:

%s""") % newFile, QMessageBox.Ok) else: self.saveFileButton.setEnabled(False) self.lblVerified.setText(tr("""Invalid signature on loaded file!""") % htmlColor('TextRed')) QMessageBox.warning(self, tr("Signature failure"), \ tr("This file has an invalid signature")) def save(self): tofile = QFileDialog.getSaveFileName(self, tr("Save confirmed package"), \ QDir.homePath() + "/" + self.fileName) if len(tofile)==0: return df = open(tofile, "wb") df.write(self.fileData) df.close() # kate: indent-width 3; replace-tabs on; armory-0.92.3/ui/MultiSigDialogs.py0000644000000000000000000047432412414772654015675 0ustar rootrootfrom PyQt4.Qt import * from PyQt4.QtGui import * from PyQt4.QtNetwork import * from qtdefines import * from qtdialogs import createAddrBookButton, DlgSetComment, DlgSendBitcoins, \ DlgUnlockWallet, DlgQRCodeDisplay, DlgRequestPayment,\ DlgDispTxInfo from armoryengine.ALL import * from armorymodels import * from armorycolors import * from armoryengine.MultiSigUtils import MultiSigLockbox, calcLockboxID,\ createLockboxEntryStr, readLockboxEntryStr, isMofNNonStandardToSpend from ui.MultiSigModels import \ LockboxDisplayModel, LockboxDisplayProxy, LOCKBOXCOLS import webbrowser from armoryengine.CoinSelection import PySelectCoins, PyUnspentTxOut, \ pprintUnspentTxOutList import cStringIO import textwrap ############################################################################# class DlgLockboxEditor(ArmoryDialog): ############################################################################# def __init__(self, parent, main, maxM=LB_MAXM, maxN=LB_MAXN, loadBox=None): super(DlgLockboxEditor, self).__init__(parent, main) lblDescr = QRichLabel(tr(""" Create Multi-signature Lockbox """) % htmlColor("TextBlue"), hAlign=Qt.AlignHCenter) lblDescr2 = QRichLabel(tr(""" Create a "lockbox" to hold coins that have signing authority split between multiple devices for personal funds, or split between multiple parties for escrow.""")) lblDescr3 = QRichLabel(tr(""" NOTE: Multi-sig "lockboxes" require public keys, not the address strings most Bitcoin users are familiar with. Click for more info.""")) def openMoreInfo(*args): QMessageBox.information(self, tr('Public Key Information'), tr(""" A public key is much longer than an address string, and always starts with "02", "03" or "04". Most wallet applications do not provide an easy way to access a public key associated with a given address. This is easiest if everyone is using Armory.

The address book buttons next to each input box below will show you normal address strings, but will enter the correct public key of the address you select.

If you are creating this lockbox with other Armory users, they can use the "Select Public Key" button from the Lockbox Manager dashboard to pick a key and enter their contact info. You can use the "Import" button on each public key line to import the data they send you."""), QMessageBox.Ok) lblDescr3.setOpenExternalLinks(False) self.connect(lblDescr3, SIGNAL('linkActivated(const QString &)'), \ openMoreInfo) self.createDate = long(RightNow()) self.loadedID = None self.comboM = QComboBox() self.comboN = QComboBox() self.maxM = maxM self.maxN = maxN self.minM = 1 self.minN = 2 self.connect(self.comboM, SIGNAL('activated(int)'), \ self.updateWidgetTable_M) self.connect(self.comboN, SIGNAL('activated(int)'), \ self.updateWidgetTable_N) self.comboM.setFont(GETFONT('Var', 14, bold=True)) self.comboN.setFont(GETFONT('Var', 14, bold=True)) self.lblMasterIcon = QLabel() # Used to optimize update-on-every-key-press self.prevPubKeyStr = ['']*self.maxN for i in range(1,self.maxM+1): self.comboM.addItem(str(i)) for i in range(2, self.maxN+1): self.comboN.addItem(str(i)) defaultM = 2 defaultN = 3 self.comboM.setCurrentIndex(defaultM-1) self.comboN.setCurrentIndex(defaultN-2) self.widgetMap = {} for i in range(self.maxN): self.widgetMap[i] = {} self.widgetMap[i]['IMG_ICON'] = QLabel() self.widgetMap[i]['LBL_ROWN'] = QRichLabel(tr(""" Public Key #%d:""") % \ (htmlColor('TextBlue'), i+1), doWrap=False, hAlign=Qt.AlignRight) self.widgetMap[i]['LBL_WLTN'] = QRichLabel(tr('Name or ID:'), \ doWrap=False, \ hAlign=Qt.AlignRight) addrWidgets = self.main.createAddressEntryWidgets(self, '', 60, 2, getPubKey=True, showLockboxes=False) self.widgetMap[i]['QLE_PUBK'] = addrWidgets['QLE_ADDR'] self.widgetMap[i]['BTN_BOOK'] = addrWidgets['BTN_BOOK'] self.widgetMap[i]['LBL_DETECT']=addrWidgets['LBL_DETECT'] self.widgetMap[i]['LBL_NAME'] = QRichLabel('', doWrap=False) self.widgetMap[i]['BTN_NAME'] = QLabelButton(tr('Edit')) self.widgetMap[i]['BTN_IMPORT'] = QLabelButton(tr('Import')) self.widgetMap[i]['BTN_NAME'].setContentsMargins(0,0,0,0) self.widgetMap[i]['LBL_DETECT'].setWordWrap(False) # METADATA for a DecoratedPublicKey helps lite wallets # identify their own keys, or authenticate keys of others. # When a pubkey block is imported we store the public key and # its metadata here indexed by pubkey. Later, we serialize # these into the wallet definition. We index by public # key with it so that we can identify if the user changed the # public key since they imported this data in which case we # should zero-out the METADATA self.widgetMap[i]['METADATA'] = {} def createCallback(i): def nameClick(): self.clickNameButton(i) return nameClick def createImportCallback(i): def importClick(): self.clickImportButton(i) return importClick self.connect(self.widgetMap[i]['BTN_NAME'], SIGNAL('clicked()'), \ createCallback(i)) self.connect(self.widgetMap[i]['BTN_IMPORT'], SIGNAL('clicked()'), \ createImportCallback(i)) self.prevPubKeyStr[i] = '' #self.widgetMap[i]['QLE_PUBK'].setFont(GETFONT('Fixed', 9)) w,h = tightSizeNChar(self.widgetMap[i]['QLE_PUBK'], 50) self.widgetMap[i]['QLE_PUBK'].setMinimumWidth(w) self.btnCancel = QPushButton(tr('Exit')) self.btnContinue = QPushButton(tr('Save Lockbox')) #self.btnContinue.setEnabled(False) self.connect(self.btnContinue, SIGNAL('clicked()'), self.doContinue) self.connect(self.btnCancel, SIGNAL('clicked()'), self.reject) self.lblFinal = QRichLabel('') self.edtBoxName = QLineEdit() w,h = relaxedSizeNChar(self.edtBoxName, 36) self.edtBoxName.setMinimumWidth(w) self.edtBoxName.setMaxLength(64) self.btnLongDescr = QLabelButton(tr("Set extended info")) self.longDescr = u'' self.connect(self.btnLongDescr, SIGNAL('clicked()'), self.setLongDescr) frmName = makeHorizFrame(['Stretch', QLabel('Lockbox Name:'), self.edtBoxName, self.btnLongDescr, 'Stretch']) layoutPubKeys = QGridLayout() self.pkFrameList = [] for i in range(self.maxN): self.pkFrameList.append(QFrame()) layoutThisRow = QGridLayout() layoutThisRow.addWidget(self.widgetMap[i]['IMG_ICON'], 0,0, 3,1) layoutThisRow.addWidget(self.widgetMap[i]['LBL_ROWN'], 0,1) layoutThisRow.addWidget(self.widgetMap[i]['LBL_WLTN'], 2,1) layoutThisRow.addItem(QSpacerItem(10,10), 0,2) layoutThisRow.addWidget(self.widgetMap[i]['QLE_PUBK'], 0,3) layoutThisRow.addWidget(self.widgetMap[i]['BTN_BOOK'], 0,4) layoutDetect = QHBoxLayout() layoutDetect.addWidget(self.widgetMap[i]['LBL_DETECT']) layoutDetect.addStretch() layoutDetect.addItem(QSpacerItem(5,5)) layoutDetect.addWidget(self.widgetMap[i]['BTN_IMPORT']) layoutThisRow.addLayout(layoutDetect, 1,3, 1,2) layoutName = QHBoxLayout() layoutName.addWidget(self.widgetMap[i]['LBL_NAME']) layoutName.addItem(QSpacerItem(5,5)) layoutName.addWidget(self.widgetMap[i]['BTN_NAME']) layoutName.addStretch() layoutThisRow.addLayout(layoutName, 2,3, 1,2) layoutThisRow.setColumnStretch(3, 1) layoutThisRow.setSpacing(2) self.pkFrameList[-1].setLayout(layoutThisRow) self.pkFrameList[-1].setFrameStyle(STYLE_SUNKEN) self.pkFrameList.append('Stretch') frmPubKeys = makeVertFrame( [frmName]+self.pkFrameList, STYLE_RAISED) self.scrollPubKeys = QScrollArea() self.scrollPubKeys.setWidget(frmPubKeys) self.scrollPubKeys.setWidgetResizable(True) frmTop = makeVertFrame([lblDescr, lblDescr2, lblDescr3], STYLE_RAISED) # Create the M,N select frame (stolen from frag-create dialog lblMNSelect = QRichLabel(tr("""Create Multi-Sig Lockbox""") % htmlColor("TextBlue"), \ doWrap=False, hAlign=Qt.AlignHCenter) lblBelowM = QRichLabel(tr('Required Signatures (M) '), \ hAlign=Qt.AlignHCenter, doWrap=False) lblBelowN = QRichLabel(tr('Total Signers (N) '), \ hAlign=Qt.AlignHCenter, doWrap=False) lblOfStr = QRichLabel(tr(' - OF - ')) btnClear = QPushButton(tr('Clear All')) self.connect(btnClear, SIGNAL('clicked()'), self.clearAll) layoutMNSelect = QGridLayout() layoutMNSelect.addWidget(self.comboM, 1,2) layoutMNSelect.addWidget(lblOfStr, 1,4) layoutMNSelect.addWidget(self.comboN, 1,6) layoutMNSelect.addWidget(lblBelowM, 2,1, 1,3) layoutMNSelect.addWidget(lblBelowN, 2,5, 1,3) layoutMNSelect.setColumnStretch(0,1) layoutMNSelect.setColumnStretch(8,1) frmMNSelect = QFrame() frmMNSelect.setFrameStyle(STYLE_RAISED) frmMNSelect.setLayout(layoutMNSelect) frmFinish = makeHorizFrame([self.btnCancel, 'Stretch', btnClear, 'Stretch', self.btnContinue]) layoutMaster = QVBoxLayout() layoutMaster.addWidget(frmTop) layoutMaster.addWidget(frmMNSelect) layoutMaster.addWidget(self.scrollPubKeys, 1) layoutMaster.addWidget(frmFinish) self.updateWidgetTable(defaultM, defaultN) self.updateLabels() if loadBox is not None: self.fillForm(loadBox) self.setLayout(layoutMaster) self.setWindowTitle('Multi-Sig Lockbox Editor') self.setMinimumWidth(750) ############################################################################# def clickNameButton(self, i): currName = unicode(self.widgetMap[i]['LBL_NAME'].text()) dlgComm = DlgSetComment(self, self.main, currName, \ 'public key', 'ID or contact info') if dlgComm.exec_(): self.widgetMap[i]['LBL_NAME'].setText(dlgComm.edtComment.text()) ############################################################################# def clickImportButton(self, i): title = tr("Import Public Key Block") descr = tr("""
Import Public Key Block

Copy and paste a PUBLICKEY block into the text field below, or load it from file. PUBLICKEY files usually have the extension *.lockbox.pub. If you were given a chunk of hex characters starting with "02", "03" or "04", that is a raw public key and can be entered directly into the public key field in the lockbox creation window.""") ftypes = ['Public Key Blocks (*.lockbox.pub)'] dlgImport = DlgImportAsciiBlock(self, self.main, title, descr, ftypes, DecoratedPublicKey) dlgImport.exec_() if dlgImport.returnObj: binPub = dlgImport.returnObj.binPubKey keyComm = dlgImport.returnObj.keyComment wltLoc = dlgImport.returnObj.wltLocator authMeth= dlgImport.returnObj.authMethod authData= dlgImport.returnObj.authData self.widgetMap[i]['QLE_PUBK'].setText(binary_to_hex(binPub)) self.widgetMap[i]['LBL_NAME'].setText(keyComm) self.widgetMap[i]['METADATA'][binPub] = [wltLoc, authMeth, authData] ############################################################################# def setLongDescr(self): class DlgSetLongDescr(ArmoryDialog): def __init__(self, parent, currDescr=''): super(DlgSetLongDescr, self).__init__(parent) lbl = QRichLabel(tr(""" Set Extended Lockbox Details

Use this space to store any extended information about this multi-sig lockbox, such as contact information of other parties, references to contracts, etc. Keep in mind that this field will be included when this lockbox is shared with others, so you should include your own contact information, as well as avoid putting any sensitive data in here""")) self.descr = QPlainTextEdit() self.descr.setPlainText(currDescr) btn = QPushButton(tr("Done")) self.connect(btn, SIGNAL('clicked()'), self.accept) layout = QVBoxLayout() layout.addWidget(lbl) layout.addWidget(self.descr, 1) layout.addWidget(makeHorizFrame(['Stretch', btn])) self.setLayout(layout) self.setWindowTitle(tr('Edit Lockbox Description')) self.setMinimumWidth(450) dlg = DlgSetLongDescr(self, self.longDescr) if dlg.exec_(): self.longDescr = unicode(dlg.descr.toPlainText()) ############################################################################# def isPotentiallyValidHexPubKey(self, pkstr): # Don't check for valid pub keys in 65-byte fields; it would be slow # (this will be run after every key press) if len(pkstr) == 33*2: return pkstr[:2] in ['02','03'] elif len(pkstr) == 65*2: return pkstr[:2] == '04' else: return False ############################################################################# def updateLabels(self, *args, **kwargs): # Disable the continue button if not all keys are in M = int(str(self.comboM.currentText())) N = int(str(self.comboN.currentText())) for i in range(N): pkStr = str(self.widgetMap[i]['QLE_PUBK'].text()).strip() if not self.isPotentiallyValidHexPubKey(pkStr): #self.btnContinue.setEnabled(False) self.lblFinal.setText('') break else: self.formFilled = True #self.btnContinue.setEnabled(True) self.lblFinal.setText(tr(""" Using the %d public keys above, a multi-sig lockbox will be created requiring %d signatures to spend money.""") % (htmlColor('TextBlue'), M, htmlColor('TextBlue'), N)) ############################################################################# def updateWidgetTable_M(self, idxM): currN = int(str(self.comboN.currentText())) currM = idxM + 1 self.minN = max(currM, 2) currN = max(self.minN, currN, 2) self.comboN.clear() setIndex = 0 for i in range(self.minN, self.maxN+1): self.comboN.addItem(str(i)) if i==currN: setIndex = i-self.minN self.comboN.setCurrentIndex(setIndex) self.updateWidgetTable(currM, currN) ############################################################################# def updateWidgetTable_N(self, idxN): currM = int(str(self.comboM.currentText())) self.updateWidgetTable(currM, idxN+self.minN) ############################################################################# def updateWidgetTable(self, M, N): self.imgPie = QPixmap(':/frag%df.png' % M) # Do the bulk of processing stuff for i in range(self.maxN): self.widgetMap[i]['IMG_ICON'].setPixmap(self.imgPie.scaled(40,40)) self.lblMasterIcon.setPixmap(self.imgPie.scaled(64,64)) for i in range(self.maxN): self.pkFrameList[i].setVisible(i=N: self.widgetMap[i]['QLE_PUBK'].setText('') self.updateLabels() ############################################################################# def clearAll(self): self.edtBoxName.clear() self.longDescr = '' for index,widMap in self.widgetMap.iteritems(): for key,widget in widMap.iteritems(): if key in ['QLE_PUBK', 'LBL_NAME']: widget.clear() ############################################################################# def fillForm(self, lboxObj): self.edtBoxName.setText(lboxObj.shortName) self.longDescr = lboxObj.longDescr self.loadedID = lboxObj.uniqueIDB58 self.createDate = lboxObj.createDate for i in range(lboxObj.N): binPub = lboxObj.dPubKeys[i].binPubKey self.widgetMap[i]['QLE_PUBK'].setText(binary_to_hex(binPub)) self.widgetMap[i]['LBL_NAME'].setText(lboxObj.dPubKeys[i].keyComment) def setCombo(cmb, val): for i in range(cmb.count()): if str(cmb.itemText(i))==str(val): cmb.setCurrentIndex(i) setCombo(self.comboM, lboxObj.M) setCombo(self.comboN, lboxObj.N) self.updateWidgetTable(lboxObj.M, lboxObj.N) self.updateLabels() ############################################################################# def doContinue(self): currM = int(str(self.comboM.currentText())) currN = int(str(self.comboN.currentText())) if len(str(self.edtBoxName.text()).strip())==0: QMessageBox.warning(self, tr('Missing Name'), tr(""" Lockboxes cannot be saved without a name (at the top of the public key list). It is also recommended to set the extended information next to it, for documenting the purpose of the lockbox."""), QMessageBox.Ok) return # If we got here, we already know all the public keys are valid strings pubKeyList = [] acceptedBlankComment = False for i in range(currN): pkHex = str(self.widgetMap[i]['QLE_PUBK'].text()).strip() if len(pkHex)==0: QMessageBox.critical(self, tr('Not Enough Keys'), tr(""" You specified less than %d public keys. Please enter a public key into every field before continuing.""") % currN, QMessageBox.Ok) return isValid = isLikelyDataType(pkHex, DATATYPE.Hex) if isValid: pkBin = hex_to_binary(pkHex) isValid = self.isPotentiallyValidHexPubKey(pkHex) if len(pkBin) == 65: if not CryptoECDSA().VerifyPublicKeyValid(SecureBinaryData(pkBin)): isValid = False if not isValid: QMessageBox.critical(self, tr('Invalid Public Key'), tr(""" The data specified for public key %d is not valid. Please double-check the data was entered correctly.""") % (i+1), QMessageBox.Ok) return keyComment = unicode(self.widgetMap[i]['LBL_NAME'].text()) #self.widgetMap[i]['METADATA'][binPub] = [wltLoc, authMeth, authData] extras = [None, None, None] if pkBin in self.widgetMap[i]['METADATA']: extras = self.widgetMap[i]['METADATA'][pkBin][:] pubKeyList.append(DecoratedPublicKey(pkBin, keyComment, *extras)) # Finally, throw a warning if the comment is not set strComment = str(self.widgetMap[i]['LBL_NAME'].text()).strip() if len(strComment)==0 and not acceptedBlankComment: reply =QMessageBox.warning(self, tr('Empty Name/ID Field'), tr(""" You did not specify a comment/label for one or more public keys. Other devices/parties may not be able to identify them. If this is a multi-party lockbox, it is recommended you put in contact information for each party, such as name, email and/or phone number.

Continue with some fields blank?
(click "No" to go back and finish filling in the form)"""), QMessageBox.Yes | QMessageBox.No) if reply==QMessageBox.Yes: acceptedBlankComment = True else: return # Sort the public keys lexicographically dPubKeys = sorted(pubKeyList, key=lambda lbKey: lbKey.binPubKey) binPubKeys = [p.binPubKey for p in dPubKeys] txOutScript = pubkeylist_to_multisig_script(binPubKeys, currM) opCodeList = convertScriptToOpStrings(txOutScript) scraddr = script_to_scrAddr(txOutScript) lockboxID = calcLockboxID(txOutScript) if self.loadedID is not None: if not self.loadedID == lockboxID: reply = QMessageBox.warning(self, tr('Different Lockbox'), tr(""" You originally loaded lockbox (%s) but the edits you made have caused it to become a new/different lockbox (%s). Changing the M-value, N-value, or any of the public keys will result in a new lockbox, unrelated to the original.

If you click "Ok" a new lockbox will be created instead of replacing the original. If you do not need the original, you can go the lockbox browser and manually remove it.""") % \ (self.loadedID, lockboxID), QMessageBox.Ok | QMessageBox.Cancel) if not reply==QMessageBox.Ok: return else: self.createDate = long(RightNow()) if not USE_TESTNET and isMofNNonStandardToSpend(currM, currN): reply = QMessageBox.warning(self, tr('Non-Standard to Spend'), tr(""" If you are running any Bitcoin Core version earlier than 0.9.3 all spending transactions from this lockbox will be rejected as non-standard. There will be no problem sending coins to the lockbox, but subsequent spends from the lockbox will require you to upgrade Bitcoin Core to at least 0.9.3 or later.

Do you wish to continue creating the lockbox, anyway?"""), QMessageBox.Yes | QMessageBox.No) if not reply==QMessageBox.Yes: return LOGINFO('Got a valid TxOut script:') LOGINFO('ScrAddrStr: ' + binary_to_hex(scraddr)) LOGINFO('Raw script: ' + binary_to_hex(txOutScript)) LOGINFO('HR Script: \n ' + '\n '.join(opCodeList)) LOGINFO('Lockbox ID: ' + lockboxID) self.lockbox = MultiSigLockbox( toUnicode(self.edtBoxName.text()), toUnicode(self.longDescr), currM, currN, dPubKeys, self.createDate) self.main.updateOrAddLockbox(self.lockbox, isFresh=True) self.accept() doExportLockbox(self, self.main, self.lockbox) ################################################################################ def doExportLockbox(parent, main, lockbox): title = tr('Export Lockbox Definition') descr = tr(""" IMPORTANT: All labels and descriptions you have entered for this lockbox are included in this text block below!

Before you send this to any other parties, please confirm that you have not entered any sensitive or embarassing information into any of the lockbox fields. Each lockbox has a name and extended information, as well as a comment for each public key.

All parties or devices that have [partial] signing authority over this lockbox need to import this data into their local lockbox manager in order to use it.""") % htmlColor('TextWarn') ftypes = ['Lockbox definitions (*.lockbox.def)'] defaultFN = 'Lockbox_%s_.lockbox.def' % lockbox.asciiID DlgExportAsciiBlock(parent, main, lockbox, title, descr, ftypes, defaultFN).exec_() ################################################################################ class DlgLockboxManager(ArmoryDialog): def __init__(self, parent, main): super(DlgLockboxManager, self).__init__(parent, main) #if not USE_TESTNET: #QMessageBox.warning(self, tr('Dangerous Feature!'), tr(""" #Multi-signature transactions are an #EXPERIMENTAL feature in this version of Armory. It is #not intended to be used with real money, until all #the warnings like this one go away. #

#Use at your own risk!"""), QMessageBox.Ok) extraTxt = '' if len(self.main.allLockboxes) > 0: extraTxt = tr('
Double-click on a lockbox to edit') lblDescr = QRichLabel(tr(""" Manage Multi-Sig Lockboxes %s""") % (htmlColor('TextBlue'), extraTxt), hAlign=Qt.AlignHCenter) frmDescr = makeVertFrame([lblDescr], STYLE_RAISED) # For the dashboard self.updateDashboardFuncs = [] self.lboxModel = LockboxDisplayModel(self.main, \ self.main.allLockboxes, \ self.main.getPreferredDateFormat()) self.lboxProxy = LockboxDisplayProxy(self) self.lboxProxy.setSourceModel(self.lboxModel) self.lboxProxy.sort(LOCKBOXCOLS.CreateDate, Qt.DescendingOrder) self.lboxView = QTableView() self.lboxView.setModel(self.lboxProxy) self.lboxView.setSortingEnabled(True) self.lboxView.setSelectionBehavior(QTableView.SelectRows) self.lboxView.setSelectionMode(QTableView.SingleSelection) self.lboxView.verticalHeader().setDefaultSectionSize(18) self.lboxView.horizontalHeader().setStretchLastSection(True) self.lboxView.setContextMenuPolicy(Qt.CustomContextMenu) self.lboxView.customContextMenuRequested.connect(self.showLboxContextMenu) self.connect( \ self.lboxView, SIGNAL('clicked(QModelIndex)'), self.singleClickLockbox) self.connect( \ self.lboxView, SIGNAL('doubleClicked(QModelIndex)'), self.dblClickLockbox) self.txtLockboxInfo = QTextEdit() self.txtLockboxInfo.acceptRichText() self.txtLockboxInfo.setStyleSheet('QTextEdit { background-color : %s }' %\ htmlColor('SlightBkgdLight')) self.txtLockboxInfo.setReadOnly(True) self.txtLockboxInfo.setFont(GETFONT('Fixed', 9)) lbGuideURL = "https://bitcoinarmory.com/about/using-lockboxes/" lblLinkToMSWebpage = QRichLabel(tr("""Consult our lockbox documentation for lockbox usage examples and info""") % lbGuideURL, doWrap=False) lblLinkToMSWebpage.setOpenExternalLinks(True) btnDone = QPushButton(tr('Done')) frmDone = makeHorizFrame([lblLinkToMSWebpage, 'Stretch', btnDone]) self.connect(btnDone, SIGNAL('clicked()'), self.accept) #maxKeys = max([lb.N for lb in self.main.allLockboxes]) for i in range(LOCKBOXCOLS.Key0, LOCKBOXCOLS.Key4+1): self.lboxView.hideColumn(i) self.lboxView.hideColumn(LOCKBOXCOLS.UnixTime) # Main Tab displays lockbox details #self.lockboxTable = [] #for lbID,cppWlt in self.main.cppLockboxWltMap.iteritems(): #ledger = cppWlt.getTxLedger() #for i in range(len(ledger)): #self.lockboxTable.append([lbID, ledger[i]]) #self.lockboxLedg = self.main.convertLedgerToTable(self.lockboxTable) self.ledgerProxy = LedgerDispSortProxy(self) self.ledgerProxy.setSourceModel(self.main.lockboxLedgModel) self.ledgerView = QTableView() self.ledgerView.setModel(self.ledgerProxy) self.ledgerView.setSortingEnabled(True) self.ledgerView.setItemDelegate(LedgerDispDelegate(self)) self.ledgerView.setSelectionBehavior(QTableView.SelectRows) self.ledgerView.setSelectionMode(QTableView.SingleSelection) self.ledgerView.verticalHeader().setDefaultSectionSize(20) self.ledgerView.verticalHeader().hide() self.ledgerView.horizontalHeader().setResizeMode(0, QHeaderView.Fixed) self.ledgerView.horizontalHeader().setResizeMode(3, QHeaderView.Fixed) self.ledgerView.hideColumn(LEDGERCOLS.isOther) self.ledgerView.hideColumn(LEDGERCOLS.UnixTime) self.ledgerView.hideColumn(LEDGERCOLS.WltID) self.ledgerView.hideColumn(LEDGERCOLS.TxHash) self.ledgerView.hideColumn(LEDGERCOLS.isCoinbase) self.ledgerView.hideColumn(LEDGERCOLS.toSelf) self.ledgerView.hideColumn(LEDGERCOLS.DoubleSpend) dateWidth = tightSizeStr(self.ledgerView, '_9999-Dec-99 99:99pm__')[0] nameWidth = tightSizeStr(self.ledgerView, '9'*32)[0] cWidth = 20 # num-confirm icon width tWidth = 72 # date icon width initialColResize(self.ledgerView, [cWidth, 0, dateWidth, tWidth, \ 0.30, 0.40, 0.3]) self.connect(self.ledgerView, SIGNAL('doubleClicked(QModelIndex)'), \ self.dblClickLedger) self.ledgerView.setContextMenuPolicy(Qt.CustomContextMenu) self.ledgerView.customContextMenuRequested.connect(self.showContextMenuLedger) # Setup the details tab self.tabDetails = QWidget() layoutDetails = QHBoxLayout() #layoutDetails.addWidget(frmManageBtns) # Removed when added dash tab layoutDetails.addWidget(self.txtLockboxInfo, 1) self.tabDetails.setLayout(layoutDetails) # Setup the ledger tab self.tabLedger = QWidget() layoutLedger = QHBoxLayout() layoutLedger.addWidget(self.ledgerView) self.tabLedger.setLayout(layoutLedger) # Creates self.stkDashboard self.createLockboxDashboardTab() self.tabbedDisplay = QTabWidget() self.tabbedDisplay.addTab(self.stkDashboard, tr("Dashboard")) self.tabbedDisplay.addTab(self.tabDetails, tr("Info")) self.tabbedDisplay.addTab(self.tabLedger, tr("Transactions")) self.tabbedDisplay.setTabEnabled(2, TheBDM.getBDMState()=='BlockchainReady') splitter = QSplitter() splitter.setOrientation(Qt.Vertical) splitter.addWidget(self.lboxView) splitter.addWidget(self.tabbedDisplay) splitter.setStretchFactor(0, 1) splitter.setStretchFactor(0, 2) layout = QGridLayout() layout.addWidget(frmDescr, 0,0, 1,2) layout.addWidget(splitter, 1,0, 1,2) layout.addWidget(frmDone, 2,0, 1,2) layout.setRowStretch(1, 1) self.setLayout(layout) self.setMinimumWidth(700) self.updateButtonDisable() hexgeom = self.main.settings.get('LockboxGeometry') tblgeom = self.main.settings.get('LockboxAddrCols') ledggeom = self.main.settings.get('LockboxLedgerCols') if len(hexgeom) > 0: geom = QByteArray.fromHex(hexgeom) self.restoreGeometry(geom) if len(tblgeom) > 0: restoreTableView(self.lboxView, tblgeom) if len(ledggeom) > 0: restoreTableView(self.ledgerView, ledggeom) ############################################################################# def createLockboxDashboardTab(self): ORGANIZER = 'Organizer' ANYONE = 'Anyone' self.allDashButtons = [{}, {}] # We need two of these dictionaries: we're going to put the widgets # directly into them, and we need one for each of the two stack pages for i in [0,1]: self.allDashButtons[i] = \ { 'CreateLB': { \ 'button': tr('Create Lockbox'), 'callbk': self.doCreate, 'organiz': True, 'lbltxt': tr('Collect public keys'), 'tiptxt': tr("""Create a lockbox by collecting public keys from each device or person that will be a signing authority over the funds. Once created you will be given a chunk of text to send to each party so they can recognize and sign transactions related to the lockbox."""), 'select': None, 'offline': None}, 'SelectKey': { \ 'button': tr('Select Public Key'), 'callbk': self.doSelectKey, 'organiz': False, 'lbltxt': tr('Send to organizer'), 'tiptxt': tr("""In order to create a lockbox all devices and/or parties need to provde a public key that they control to be merged by the organizer. Once all keys are collected, the organizer will send you the final lockbox definition to import."""), 'select': None, 'offline': None}, 'ExportLB': { \ 'button': tr('Export Lockbox'), 'callbk': self.doExport, 'organiz': False, 'lbltxt': tr('Send to other devices or parties'), 'tiptxt': tr("""Export a lockbox definition to be imported by other devices are parties. Normally the lockbox organizer will do this after all public keys are collected, but any participant who already has it can send it, such as if one party/device accidentally deletes it."""), 'select': tr('Select lockbox to export'), 'offline': None}, 'ImportLB': { \ 'button': tr('Import Lockbox'), 'callbk': self.doImport, 'organiz': False, 'lbltxt': tr('From organizer or other device'), 'tiptxt': tr("""Import a lockbox definition to begin tracking its funds and to be able to sign related transactions. Normally, the organizer will send you send you the data to import after you provide a public key from one of your wallets."""), 'select': None, 'offline': None}, 'EditLB': { \ 'button': tr('Edit Lockbox'), 'callbk': self.doEdit, 'organiz': False, 'lbltxt': '', 'tiptxt': tr('Edit an existing lockbox'), 'select': tr('Select lockbox to edit'), 'offline': None}, #'RegFund': { \ #'button': tr('Fund Lockbox'), #'callbk': self.doFundIt, #'organiz': False, #'lbltxt': tr('Fund selected lockbox from any wallet'), #'tiptxt': tr("""If you would like to fund this lockbox #from another lockbox, select the funding #lockbox in the table and click the #"Create Spending Tx" button. Use the #address book to select this lockbox as the #recipient of that transaction. #

#If multiple people will be funding #this lockbox and not all of them are fully #trusted, click the "Simul" checkbox on the #left to see the simulfunding options."""), #'select': tr('Select a lockbox to fund
'), #'offline': tr('Must be online to fund
')}, # Added
to the labels to force to be two lines... this # is a hack to make sure that the row inits to a reasonable # size on open 'MergeProm': { \ 'button': tr('Merge Promissory Notes'), 'callbk': self.doMergeProm, 'organiz': True, 'lbltxt': '', 'tiptxt': tr("""Collect promissory notes from all funders of a simulfunding transaction. Use this to merge them into a single transaction that the funders can review and sign."""), 'select': None, 'offline': None}, 'CreateProm': { \ 'button': tr('Create Promissory Note'), 'callbk': self.doCreateProm, 'organiz': False, 'lbltxt': tr('Make a funding commitment to a lockbox'), 'tiptxt': tr("""A "promissory note" provides blockchain information about how your wallet will contribute funds to a simulfunding transaction. A promissory note does not move any money in your wallet. The organizer will create a single transaction that includes all promissory notes and you will be able to review it in its entirety before signing."""), 'select': tr('Select lockbox to commit funds to'), 'offline': tr('Must be online to create')}, 'RevSign': { \ 'button': tr('Review and Sign'), 'callbk': self.doReview, 'organiz': False, 'lbltxt': tr('Multi-sig spend or simulfunding'), 'tiptxt': tr("""Review and sign any lockbox-related transaction that requires multiple signatures. This includes spending transactions from a regular lockbox, as well as completing a simulfunding transaction."""), 'select': None, 'offline': None}, 'CreateTx': { \ 'button': tr('Create Spending Tx'), 'callbk': self.doSpend, 'organiz': True, 'lbltxt': tr('Send bitcoins from lockbox'), 'tiptxt': tr("""Create a proposed transaction sending bitcoins to an address, wallet or another lockbox. The transaction will not be final until enough signatures have been collected and then broadcast from an online computer."""), 'select': tr('Select lockbox to spend from'), 'offline': tr('Must be online to spend')}, 'MergeSigs': { \ 'button': tr('Collect Sigs && Broadcast'), 'callbk': self.doReview, 'organiz': True, 'lbltxt': tr('Merge signatures to finalize'), 'tiptxt': tr('Merge signatures and broadcast transaction'), 'select': None, 'offline': tr('(must be online to broadcast)')}, } # We will have two pages on the stack. The first one is for regular # funding with all the simulfunding options missing. The second one # is re-arranged (but mostly the same widgets) but with the additional # simulfunding widgets self.stkDashboard = QStackedWidget() simultxt = 'Simul' self.chkSimulfundA = QCheckBox(simultxt) self.chkSimulfundB = QCheckBox(simultxt) ttipSimulTxt = tr(""" If this lockbox will be funded by multiple parties and not all parties are fully trusted, use "simulfunding" to ensure that funds are committed at the same time. Check the "Simul" box to show simulfunding options in the table.""") ttipSimulA = self.main.createToolTipWidget(ttipSimulTxt) ttipSimulB = self.main.createToolTipWidget(ttipSimulTxt) def clickSimulA(): self.chkSimulfundB.setChecked(self.chkSimulfundA.isChecked()) stk = 1 if self.chkSimulfundA.isChecked() else 0 self.stkDashboard.setCurrentIndex(stk) def clickSimulB(): self.chkSimulfundA.setChecked(self.chkSimulfundB.isChecked()) stk = 1 if self.chkSimulfundB.isChecked() else 0 self.stkDashboard.setCurrentIndex(stk) self.chkSimulfundB.setChecked(self.chkSimulfundA.isChecked()) self.connect(self.chkSimulfundA, SIGNAL('clicked()'), clickSimulA) self.connect(self.chkSimulfundB, SIGNAL('clicked()'), clickSimulB) cellWidth = 150 cellStyle = STYLE_RAISED def createHeaderCell(headStr, extraWidgList=None): lbl = QRichLabel(headStr, bold=True, size=4, hAlign=Qt.AlignHCenter, vAlign=Qt.AlignVCenter) if extraWidgList is None: frm = makeVertFrame([lbl], cellStyle) else: botLayout = QHBoxLayout() for widg in extraWidgList: botLayout.addWidget(widg) botLayout.setSpacing(0) cellLayout = QVBoxLayout() cellLayout.addWidget(lbl) cellLayout.addLayout(botLayout) frm = QFrame() frm.setLayout(cellLayout) frm.setFrameStyle(cellStyle) return frm self.updateDashFuncs = [] def createCell(stk, btnKeyList, direct=HORIZONTAL): layoutMulti = QHBoxLayout() if direct==HORIZONTAL else QVBoxLayout() for key in btnKeyList: layout = QGridLayout() btnMap = self.allDashButtons[stk][key] btnMap['BTN'] = QPushButton(btnMap['button']) btnMap['LBL'] = QRichLabel('', doWrap=True, hAlign=Qt.AlignHCenter, vAlign=Qt.AlignTop) btnMap['TTIP'] = self.main.createToolTipWidget(btnMap['tiptxt']) if btnMap['organiz']: btnMap['BTN'].setAutoFillBackground(True) btnMap['BTN'].setStyleSheet(\ 'QPushButton { background-color : %s }' % htmlColor('SlightMoreBlue')) layout.addWidget(btnMap['BTN'], 0,0) layout.addWidget(btnMap['TTIP'], 0,1) layout.addWidget(btnMap['LBL'], 1,0) layout.setColumnStretch(0,1) layout.setColumnStretch(1,0) self.connect(btnMap['BTN'], SIGNAL('clicked()'), btnMap['callbk']) slayout = QHBoxLayout() slayout.addStretch() slayout.addLayout(layout) slayout.addStretch() layoutMulti.addLayout(slayout) def updateWidgets(stkPage, btnKey): btnMap = self.allDashButtons[stkPage][btnKey] def updateFunc(hasSelect, isOnline): # Default to regular label lbltxt = btnMap['lbltxt'] orgtxt = 'Organizer
' % \ htmlColor('TextBlue') btnMap['BTN'].setText(btnMap['button']) btnMap['BTN'].setEnabled(True) btnMap['LBL'].setEnabled(True) if isOnline: if not hasSelect and btnMap['select'] is not None: lbltxt = btnMap['select'] btnMap['BTN'].setEnabled(False) btnMap['LBL'].setEnabled(False) else: if btnMap['offline'] is not None: lbltxt = btnMap['offline'] btnMap['BTN'].setEnabled(False) btnMap['LBL'].setEnabled(False) else: if not hasSelect and btnMap['select'] is not None: lbltxt = btnMap['select'] btnMap['BTN'].setEnabled(False) btnMap['LBL'].setEnabled(False) if btnMap['organiz']: btnMap['LBL'].setText(orgtxt + lbltxt) btnMap['LBL'].setWordWrap(False) else: btnMap['LBL'].setText(lbltxt) # Semi-hack: # The 'MergeSigs' button is the only one that kinda makes # sense to not work offline, but there may be isolated # cases where the user would merge without intending to # broadcast. Having it disabled in offline mode would # make them go mad. So I'm going to explicitly make sure # that just that button is always enabled, even though # it might look like a bug. if btnKey=='MergeSigs': btnMap['BTN'].setEnabled(True) return updateFunc # Add the func to the list of things to call on context change self.updateDashFuncs.append(updateWidgets(stk, key)) frmCell = QFrame() frmCell.setLayout(layoutMulti) frmCell.setFrameStyle(STYLE_RAISED) # This was calibrated to linux, but at least it will work on one OS # The alternative was squished text on every OS w,h = tightSizeNChar(btnMap['LBL'], 30) frmCell.setMinimumHeight(5.5*h) return frmCell ##### REGULAR FUNDING - Special Cell #### # This FUND row for regular funding will be totally unlike the others # Create it here instead of with the the createCell() function self.lblDispAddr = QRichLabel('', doWrap=False, hAlign=Qt.AlignHCenter) self.lblDispAddr.setTextInteractionFlags(Qt.TextSelectableByMouse | \ Qt.TextSelectableByKeyboard) self.btnFundRegular = QPushButton(tr('Fund from Wallet')) self.btnQRCodeDisp = QPushButton(tr('QR Code')) self.btnFundRequest = QPushButton(tr('Request Payment')) self.btnCopyClip = QPushButton(tr('Copy Address')) def funcCopyClip(): lbox = self.getSelectedLockbox() if not lbox: return self.btnCopyClip.setText('Copied!') clipb = QApplication.clipboard() clipb.clear() clipb.setText(scrAddr_to_addrStr(lbox.p2shScrAddr)) from twisted.internet import reactor reactor.callLater(1, lambda: self.btnCopyClip.setText('Copy Address')) def funcReqPayment(): lbox = self.getSelectedLockbox() if not lbox: return p2shAddr = scrAddr_to_addrStr(lbox.p2shScrAddr) DlgRequestPayment(self, self.main, p2shAddr).exec_() def funcQRCode(): lbox = self.getSelectedLockbox() if not lbox: return p2shAddr = scrAddr_to_addrStr(lbox.p2shScrAddr) lboxDisp = 'Lockbox %d-of-%d: "%s" (%s)' % (lbox.M, lbox.N, lbox.shortName, lbox.uniqueIDB58) DlgQRCodeDisplay(self, self.main, p2shAddr, p2shAddr, lboxDisp).exec_() self.connect(self.btnCopyClip, SIGNAL('clicked()'), funcCopyClip) self.connect(self.btnQRCodeDisp, SIGNAL('clicked()'), funcQRCode) self.connect(self.btnFundRequest, SIGNAL('clicked()'), funcReqPayment) self.connect(self.btnFundRegular, SIGNAL('clicked()'), self.doFundIt) def updateRegFundCell(hasSelect, isOnline): lbox = self.getSelectedLockbox() self.btnCopyClip.setText(tr('Copy Address')) if not hasSelect or not lbox: self.btnQRCodeDisp.setEnabled(False) self.btnFundRegular.setEnabled(False) self.btnFundRequest.setEnabled(False) self.btnCopyClip.setEnabled(False) self.lblDispAddr.setEnabled(False) self.lblDispAddr.setText('No lockbox selected') else: p2shAddr = scrAddr_to_addrStr(lbox.p2shScrAddr) self.btnFundRegular.setEnabled(isOnline) self.btnQRCodeDisp.setEnabled(True) self.btnFundRequest.setEnabled(True) self.btnCopyClip.setEnabled(True) self.lblDispAddr.setEnabled(True) self.lblDispAddr.setText(tr(""" Anyone can send funds to this lockbox using this Bitcoin address:
%s""") % p2shAddr) self.updateDashFuncs.append(updateRegFundCell) layoutFundRow = QGridLayout() layoutFundRow.addWidget( self.btnFundRegular, 0,2) layoutFundRow.addWidget( self.btnQRCodeDisp, 0,3) layoutFundRow.addWidget( self.btnFundRequest, 0,4) layoutFundRow.addWidget( self.btnCopyClip, 0,5) layoutFundRow.addWidget( self.lblDispAddr, 1,1, 1,6) layoutFundRow.setColumnStretch(0, 1) layoutFundRow.setColumnStretch(1, 1) layoutFundRow.setColumnStretch(2, 0) layoutFundRow.setColumnStretch(3, 0) layoutFundRow.setColumnStretch(4, 0) layoutFundRow.setColumnStretch(5, 0) layoutFundRow.setColumnStretch(6, 1) layoutFundRow.setColumnStretch(7, 1) frmFundRegCell = QFrame() frmFundRegCell.setLayout(layoutFundRow) frmFundRegCell.setFrameStyle(STYLE_RAISED) ##### REGULAR FUNDING - Special Cell #### # First frame is for regular funding. Switch to frmMulti if chkSimulfundA frmSingle = QFrame() frmSingleLayout = QGridLayout() firstRow = createCell(0, ['CreateLB', 'SelectKey', 'ExportLB', 'ImportLB'], HORIZONTAL) #secondRow = createCell(0, ['RegFund'], HORIZONTAL) thirdRow = createCell(0, ['CreateTx', 'RevSign', 'MergeSigs'], HORIZONTAL) frmSingleLayout.addWidget(createHeaderCell('CREATE'), 0,0) frmSingleLayout.addWidget(firstRow, 0,1, 1,3) frmSingleLayout.addWidget(createHeaderCell('FUND', [self.chkSimulfundA, ttipSimulA]), 1,0) frmSingleLayout.addWidget(frmFundRegCell, 1,1, 1,3) frmSingleLayout.addWidget(createHeaderCell('SPEND'), 2,0) frmSingleLayout.addWidget(thirdRow, 2,1, 1,3) frmSingleLayout.setColumnStretch(0,0) frmSingleLayout.setColumnStretch(1,1) frmSingleLayout.setColumnStretch(2,1) frmSingleLayout.setColumnStretch(3,1) frmSingleLayout.setSpacing(1) frmSingleLayout.setColumnMinimumWidth(0,100) frmSingle.setLayout(frmSingleLayout) frmSingle.setFrameStyle(STYLE_STYLED) self.stkDashboard.addWidget(frmSingle) # Second frame is for simulfunding frmMulti = QFrame() frmMultiLayout = QGridLayout() firstRow = createCell(1, ['CreateLB', 'SelectKey', 'ExportLB', 'ImportLB'], HORIZONTAL) secondRow = createCell(1, ['MergeProm', 'CreateProm'], HORIZONTAL) lastCol = createCell(1, ['RevSign', 'MergeSigs'], VERTICAL) thirdRow = createCell(1, ['CreateTx'], HORIZONTAL) frmMultiLayout.addWidget(createHeaderCell('CREATE'), 0,0) frmMultiLayout.addWidget(firstRow, 0,1, 1,3) frmMultiLayout.addWidget(createHeaderCell('FUND', [self.chkSimulfundB, ttipSimulB]), 1,0) frmMultiLayout.addWidget(secondRow, 1,1, 1,2) frmMultiLayout.addWidget(lastCol, 1,3, 2,1) frmMultiLayout.addWidget(createHeaderCell('SPEND'), 2,0) frmMultiLayout.addWidget(thirdRow, 2,1, 1,2) frmMultiLayout.setColumnStretch(0,0) frmMultiLayout.setColumnStretch(1,1) frmMultiLayout.setColumnStretch(2,1) frmMultiLayout.setColumnStretch(3,1) frmMultiLayout.setSpacing(1) frmMultiLayout.setRowMinimumHeight(1,100) frmMultiLayout.setRowMinimumHeight(2,100) frmMultiLayout.setColumnMinimumWidth(0,100) frmMulti.setLayout(frmMultiLayout) frmMulti.setFrameStyle(STYLE_STYLED) self.stkDashboard.addWidget(frmMulti) # Default is to use frmSingle self.stkDashboard.setCurrentIndex(0) ############################################################################# def updateTxCommentFromView(self, view): index = view.selectedIndexes()[0] row, col = index.row(), index.column() currComment = str(view.model().index(row, LEDGERCOLS.Comment).data().toString()) dialog = DlgSetComment(self, self.main, currComment, 'Transaction') if dialog.exec_(): newComment = str(dialog.edtComment.text()) lboxId = str(view.model().index(row, LEDGERCOLS.WltID).data().toString()) txHash = str(view.model().index(row, LEDGERCOLS.TxHash).data().toString()) lbox = self.main.allLockboxes[self.main.lockboxIDMap[lboxId]] for a160 in lbox.a160List: wltID = self.main.getWalletForAddr160(a160) if len(wltID)>0: self.main.walletMap[wltID].setComment(hex_to_binary(txHash), newComment) self.main.walletListChanged() ############################################################################# def dblClickLedger(self, index): if index.column()==LEDGERCOLS.Comment: self.updateTxCommentFromView(self.ledgerView) else: self.showLedgerTx() ############################################################################# def showLedgerTx(self): row = self.ledgerView.selectedIndexes()[0].row() txHash = str(self.ledgerView.model().index(row, LEDGERCOLS.TxHash).data().toString()) txtime = unicode(self.ledgerView.model().index(row, LEDGERCOLS.DateStr).data().toString()) pytx = None txHashBin = hex_to_binary(txHash) if TheBDM.isInitialized(): cppTx = TheBDM.getTxByHash(txHashBin) if cppTx.isInitialized(): pytx = PyTx().unserialize(cppTx.serialize()) if pytx==None: QMessageBox.critical(self, 'Invalid Tx:', 'The transaction you requested be displayed does not exist in ' 'in Armory\'s database. This is unusual...', QMessageBox.Ok) return lboxId = str(self.ledgerView.model().index(row, LEDGERCOLS.WltID).data().toString()) lbox = self.main.allLockboxes[self.main.lockboxIDMap[lboxId]] wltID = None wlt = None for a160 in lbox.a160List: wltID = self.main.getWalletForAddr160(a160) if len(wltID)>0: wlt = self.main.walletMap[wltID] break DlgDispTxInfo( pytx, wlt, self, self.main, txtime=txtime).exec_() ############################################################################# def showContextMenuLedger(self): menu = QMenu(self.ledgerView) if len(self.ledgerView.selectedIndexes())==0: return row = self.ledgerView.selectedIndexes()[0].row() txHash = str(self.ledgerView.model().index(row, LEDGERCOLS.TxHash).data().toString()) txHash = hex_switchEndian(txHash) wltID = str(self.ledgerView.model().index(row, LEDGERCOLS.WltID).data().toString()) if USE_TESTNET: blkExploreTitle = 'View on blockexplorer.com' blkExploreURL = 'http://blockexplorer.com/testnet/tx/%s' % txHash else: blkExploreTitle = 'View on blockchain.info' blkExploreURL = 'https://blockchain.info/tx/%s' % txHash actViewTx = menu.addAction("View Details") actViewBlkChn = menu.addAction(blkExploreTitle) actComment = menu.addAction("Change Comment") actCopyTxID = menu.addAction("Copy Transaction ID") action = menu.exec_(QCursor.pos()) if action==actViewTx: self.showLedgerTx() elif action==actViewBlkChn: try: webbrowser.open(blkExploreURL) except: LOGEXCEPT('Failed to open webbrowser') QMessageBox.critical(self, 'Could not open browser', \ 'Armory encountered an error opening your web browser. To view ' 'this transaction on blockchain.info, please copy and paste ' 'the following URL into your browser: ' '

%s' % blkExploreURL, QMessageBox.Ok) elif action==actCopyTxID: clipb = QApplication.clipboard() clipb.clear() clipb.setText(txHash) elif action==actComment: self.updateTxCommentFromView(self.ledgerView) ############################################################################# def showLboxContextMenu(self, pos): menu = QMenu(self.lboxView) std = (self.main.usermode == USERMODE.Standard) adv = (self.main.usermode == USERMODE.Advanced) dev = (self.main.usermode == USERMODE.Expert) if True: actionCopyAddr = menu.addAction("Copy P2SH address") if True: actionShowQRCode = menu.addAction("Display address QR code") if not USE_TESTNET: actionBlkChnInfo = menu.addAction("View address on %s" % BLOCKEXPLORE_NAME) else: actionBlkChnInfo = None if True: actionReqPayment = menu.addAction("Request payment to this lockbox") if dev: actionCopyHash160 = menu.addAction("Copy hash160 value (hex)") if True: actionCopyBalance = menu.addAction("Copy balance") if True: actionRemoveLB = menu.addAction("Delete Lockbox") selectedIndexes = self.lboxView.selectedIndexes() if len(selectedIndexes)>0: idx = selectedIndexes[0] action = menu.exec_(QCursor.pos()) # Get data on a given row, easily def getModelStr(col): model = self.lboxView.model() qstr = model.index(idx.row(), col).data().toString() return str(qstr).strip() lboxId = getModelStr(LOCKBOXCOLS.ID) lbox = self.main.getLockboxByID(lboxId) p2shAddr = script_to_addrStr(script_to_p2sh_script(lbox.binScript)) if lbox else None if action == actionCopyAddr: clippy = p2shAddr elif action == actionBlkChnInfo: urlToOpen = BLOCKEXPLORE_URL_ADDR % p2shAddr try: import webbrowser webbrowser.open(urlToOpen) except: QMessageBox.critical(self, tr('Could not open browser'), tr(""" Armory encountered an error opening your web browser. To view this address on %s, please copy and paste the following URL into your browser:

%s""") % (BLOCKEXPLORE_NAME, urlToOpen, urlToOpen), QMessageBox.Ok) return elif action == actionShowQRCode: DlgQRCodeDisplay(self, self.main, p2shAddr, p2shAddr, createLockboxEntryStr(lboxId)).exec_() return elif action == actionReqPayment: if not self.main.getSettingOrSetDefault('DNAA_P2SHCompatWarn', False): oldStartChar = "'m' or 'n'" if USE_TESTNET else "'1'" newStartChar = "'2'" if USE_TESTNET else "'3'" reply = MsgBoxWithDNAA(MSGBOX.Warning, tr('Compatibility Warning'), tr("""You are about to request payment to a "P2SH" address which is the format used for receiving to multi-signature addresses/lockboxes. "P2SH" are like regular Bitcoin addresses but start with %s instead of %s.

Unfortunately, not all software and services support sending to P2SH addresses. If the sender or service indicates an error sending to this address, you might have to request payment to a regular wallet address and then send the funds from that wallet to the lockbox once it is confirmed.""") % \ (newStartChar, oldStartChar), dnaaMsg=tr('Do not show this message again')) if reply[1]==True: self.main.writeSetting('DNAA_P2SHCompatWarn', True) DlgRequestPayment(self, self.main, p2shAddr).exec_() return elif dev and action == actionCopyHash160: clippy = binary_to_hex(addrStr_to_hash160(p2shAddr)[1]) elif action == actionCopyBalance: clippy = getModelStr(LOCKBOXCOLS.Balance) elif action == actionRemoveLB: dispInfo = self.main.getDisplayStringForScript(lbox.binScript) reply = QMessageBox.warning(self, tr('Confirm Delete'), tr(""" "Removing" a lockbox does not delete any signing keys, so you maintain signing authority for any coins that are sent there. However, it will remove it from the list of lockboxes, and you will have to re-import it again later in order to send any funds to or from the lockbox.

You are about to remove the following lockbox:

%s """) % (htmlColor('TextBlue'), dispInfo['String']), QMessageBox.Yes | QMessageBox.No) if reply==QMessageBox.Yes: self.main.removeLockbox(lbox) self.lboxModel.reset() self.singleClickLockbox() return else: return clipb = QApplication.clipboard() clipb.clear() clipb.setText(str(clippy).strip()) ############################################################################# def updateButtonDisable(self): noSelection = (self.getSelectedLBID() is None) isOffline = (not TheBDM.getBDMState()=='BlockchainReady') """ # Removed all these when we added the dashboard tab self.btnEdit.setDisabled(noSelection) self.btnExport.setDisabled(noSelection) self.btnDelete.setDisabled(noSelection) self.btnFundIt.setDisabled(noSelection or isOffline) self.btnSimul.setDisabled(noSelection) self.btnSpend.setDisabled(noSelection) """ if noSelection: self.txtLockboxInfo.setText(tr("""

Select a lockbox from the table above to view its info
""") % htmlColor('DisableFG')) for fn in self.updateDashFuncs: # Whoops, made the args inverses of what the func takes, oh well fn(not noSelection, not isOffline) ############################################################################# def getSelectedLBID(self): selection = self.lboxView.selectedIndexes() if len(selection)==0: return None row = selection[0].row() idCol = LOCKBOXCOLS.ID return str(self.lboxView.model().index(row, idCol).data().toString()) ############################################################################# def getSelectedLockbox(self): lbID = self.getSelectedLBID() if lbID: return self.main.getLockboxByID(lbID) return None ############################################################################# def getDisplayRichText(self, lb, tr=None, dateFmt=None): if dateFmt is None: dateFmt = DEFAULT_DATE_FORMAT if tr is None: tr = lambda x: unicode(x) EMPTYLINE = u'' shortName = toUnicode(lb.shortName) if len(shortName.strip())==0: shortName = u'') longDescr = textwrap.fill(longDescr, width=60) formattedDate = unixTimeToFormatStr(lb.createDate, dateFmt) lines = [] lines.append(tr("""
Lockbox Information for %s
""") % (htmlColor("TextBlue"), lb.uniqueIDB58)) lines.append(tr('Multisig:      %d-of-%d') % (lb.M, lb.N)) lines.append(tr('Lockbox ID:    %s') % lb.uniqueIDB58) lines.append(tr('P2SH Address:  %s') % binScript_to_p2shAddrStr(lb.binScript)) lines.append(tr('Lockbox Name:  %s') % lb.shortName) lines.append(tr('Created:       %s') % formattedDate) lines.append(tr('Extended Info:
%s
') % longDescr) lines.append(tr('Stored Key Details')) for i in range(len(lb.dPubKeys)): comm = lb.dPubKeys[i].keyComment addr = hash160_to_addrStr(lb.a160List[i]) pubk = binary_to_hex(lb.dPubKeys[i].binPubKey)[:40] + '...' if len(comm.strip())==0: comm = '' lines.append(tr('  Key #%d') % (i+1)) lines.append(tr('     Name/ID: %s') % comm) lines.append(tr('     Address: %s') % addr) lines.append(tr('     PubKey:  %s') % pubk) lines.append(EMPTYLINE) lines.append(tr('')) return '
'.join(lines) ############################################################################# def singleClickLockbox(self, index=None, *args): lb = self.getSelectedLockbox() if lb: self.txtLockboxInfo.setText(self.getDisplayRichText(lb)) else: self.txtLockboxInfo.setText('') self.updateButtonDisable() ############################################################################# def dblClickLockbox(self, index, *args): lb = self.getSelectedLockbox() if lb: DlgLockboxEditor(self, self.main, loadBox=lb).exec_() self.lboxModel.reset() self.singleClickLockbox() ############################################################################# def doCreate(self): dlg = DlgLockboxEditor(self, self.main).exec_() if dlg: self.lboxModel.reset() self.singleClickLockbox() self.updateButtonDisable() ############################################################################# def doSelectKey(self): dlg = DlgSelectPublicKey(self, self.main).exec_() ############################################################################# def doImport(self): dlg = DlgImportLockbox(self, self.main) if dlg.exec_(): if dlg.importedLockbox is not None: self.main.updateOrAddLockbox(dlg.importedLockbox, isFresh=True) if not self.main.getSettingOrSetDefault('DNAA_LockboxImport', False): reply = MsgBoxWithDNAA(MSGBOX.Info, tr("Import Successful"), tr(""" The lockbox was imported successfully. If this is a new lockbox that has never been used before, then you can start using it right away.

If the lockbox is not new and has been used before, Armory will not know about its history until you rescan the databases. You can manually initiate a rescan by going to "Help"\xe2\x86\x92"Rescan Databases" from the main window."""), tr("Do not show this message again")) if reply[1]: self.main.writeSetting('DNAA_LockboxImport', True) self.lboxModel.reset() self.singleClickLockbox() self.updateButtonDisable() ############################################################################# def doEdit(self): lb = self.getSelectedLockbox() DlgLockboxEditor(self, self.main, loadBox=lb).exec_() self.lboxModel.reset() self.singleClickLockbox() self.updateButtonDisable() ############################################################################# def doExport(self): lb = self.getSelectedLockbox() doExportLockbox(self, self.main, lb) self.updateButtonDisable() ############################################################################# def doMergeProm(self): lb = self.getSelectedLockbox() lbID = None if lb is None else lb.uniqueIDB58 DlgMergePromNotes(self, self.main, lbID).exec_() ############################################################################# def doCreateProm(self): lb = self.getSelectedLockbox() lbID = None if lb is None else lb.uniqueIDB58 DlgCreatePromNote(self, self.main, lbID).exec_() ############################################################################# def doReview(self): title = tr("Import Signature Collector") descr = tr(""" Import a Signature Collector block to review and sign the lockbox-spend or simulfunding transaction. This text block is produced by the organizer and will contain "=====TXSIGCOLLECT" on the first line. Or you can import it from a file, which is saved by default with a *.sigcollect.tx extension.""") ftypes = ['Signature Collectors (*.sigcollect.tx)'] dlgImport = DlgImportAsciiBlock(self, self.main, title, descr, ftypes, UnsignedTransaction) dlgImport.exec_() if dlgImport.returnObj: ustx = dlgImport.returnObj DlgMultiSpendReview(self, self.main, ustx).exec_() ############################################################################# def doDelete(self): lb = self.getSelectedLockbox() dispInfo = self.main.getDisplayStringForScript(lb.binScript, 100, 2, prefIDOverAddr=True) reply = QMessageBox.warning(self, tr('Confirm Delete'), tr(""" "Removing" a lockbox does not delete any signing keys, so you maintain signing authority for any coins that are sent there. However, Armory will stop tracking its history and balance, and you will have to re-import it later in order to sign any transactions.

You are about to remove the following lockbox:

%s """) % (htmlColor('TextBlue'), dispInfo['String']), QMessageBox.Yes | QMessageBox.No) if reply==QMessageBox.Yes: lbObj = self.getSelectedLockbox() self.main.removeLockbox(lbObj) self.lboxModel.reset() self.singleClickLockbox() self.updateButtonDisable() ############################################################################# def doFundIt(self): reply = QMessageBox.warning(self, tr('[WARNING]'), tr(""" WARNING: If this lockbox is being used to hold escrow for multiple parties, and requires being funded by multiple participants, you must use a special funding process to ensure simultaneous funding. Otherwise, one of the other parties may be able to scam you!

It is safe to continue if any of the following conditions are true:
  • You are the only one expected to fund this lockbox/escrow
  • All other parties in the lockbox/escrow are fully trusted
  • This lockbox is being used for personal savings
If the above does not apply to you, please press "Cancel" and select the "Simul" checkbox on the lockbox dashboard. """) % htmlColor('TextWarn'), QMessageBox.Ok | QMessageBox.Cancel) if not reply==QMessageBox.Ok: return lbID = self.getSelectedLBID() lb = self.main.getLockboxByID(lbID) prefillMap = {'lockbox': lbID, 'message': tr('Funding %d-of-%d') % (lb.M, lb.N) } DlgSendBitcoins(None, self, self.main, prefillMap).exec_() self.updateButtonDisable() ############################################################################# def doSimul(self): lbID = self.getSelectedLBID() dlgSimul = DlgSimulfundSelect(self, self.main, lbID) dlgSimul.exec_() if dlgSimul.selection is None: return elif dlgSimul.selection=='Create': DlgCreatePromNote(self, self.main, lbID).exec_() elif dlgSimul.selection=='Collect': DlgMergePromNotes(self, self.main, lbID).exec_() elif dlgSimul.selection=='Review': title = tr("Import Signature Collector") descr = tr(""" Import a Signature Collector text block to review and sign the simulfunding transaction. This text block is produced by the party that collected and merged all the promissory notes. Files containing signature-collecting data usually end with *.sigcollect.tx.""") ftypes = ['Signature Collectors (*.sigcollect.tx)'] dlgImport = DlgImportAsciiBlock(self, self.main, title, descr, ftypes, UnsignedTransaction) dlgImport.exec_() if dlgImport.returnObj: ustx = dlgImport.returnObj DlgMultiSpendReview(self, self.main, ustx).exec_() self.updateButtonDisable() ############################################################################# def doSpend(self): lbID = self.getSelectedLBID() dlg = DlgSendBitcoins(None, self, self.main, spendFromLockboxID=lbID) dlg.exec_() self.updateButtonDisable() ############################################################################# def saveGeometrySettings(self): self.main.writeSetting('LockboxGeometry', str(self.saveGeometry().toHex())) self.main.writeSetting('LockboxAddrCols', saveTableView(self.lboxView)) self.main.writeSetting('LockboxLedgerCols', saveTableView(self.ledgerView)) ############################################################################# def closeEvent(self, event): self.saveGeometrySettings() super(DlgLockboxManager, self).closeEvent(event) ############################################################################# def accept(self, *args): self.saveGeometrySettings() super(DlgLockboxManager, self).accept(*args) ############################################################################# def reject(self, *args): self.saveGeometrySettings() super(DlgLockboxManager, self).reject(*args) ################################################################################ class DlgFundLockbox(ArmoryDialog): def __init__(self, parent, main): super(DlgFundLockbox, self).__init__(parent, main) self.selection = None lblDescr = QRichLabel(tr(""" To spend from a multi-sig lockbox, one party/device must create a proposed spending transaction, then all parties/devices must review and sign that transaction. Once it has enough signatures, any device, can broadcast the transaction to the network.""")) lblCreate = QRichLabel(tr(""" I am creating a new proposed spending transaction and will pass it to each party or device that needs to sign it""")) lblReview = QRichLabel(tr(""" Another party or device created the transaction, I just need to review and sign it.""")) btnCreate = QPushButton(tr("Create Transaction")) btnReview = QPushButton(tr("Review and Sign")) btnCancel = QPushButton(tr("Cancel")) self.connect(btnCreate, SIGNAL('clicked()'), self.doCreate) self.connect(btnReview, SIGNAL('clicked()'), self.doReview) self.connect(btnCancel, SIGNAL('clicked()'), self.reject) frmTop = makeHorizFrame([lblDescr], STYLE_STYLED) layoutBot = QGridLayout() layoutBot.addWidget(btnReview, 0,0) layoutBot.addWidget(lblReview, 0,1) layoutBot.addWidget(HLINE(), 1,0, 1,2) layoutBot.addWidget(btnCreate, 2,0) layoutBot.addWidget(lblCreate, 2,1) layoutBot.setColumnStretch(0, 0) layoutBot.setColumnStretch(1, 1) frmBot = QFrame() frmBot.setLayout(layoutBot) frmBot.setFrameStyle(STYLE_STYLED) frmCancel = makeHorizFrame([btnCancel, 'Stretch']) layoutMain = QVBoxLayout() layoutMain.addWidget(frmTop) layoutMain.addWidget(frmBot) layoutMain.addWidget(frmCancel) self.setLayout(layoutMain) self.setMinimumWidth(500) def doCreate(self): self.selection = 'Create' self.accept() def doReview(self): self.selection = 'Review' self.accept() ################################################################################ class DlgSpendFromLockbox(ArmoryDialog): def __init__(self, parent, main): super(DlgSpendFromLockbox, self).__init__(parent, main) self.selection = None lblDescr = QRichLabel(tr(""" To spend from a multi-sig lockbox, one party/device must create a proposed spending transaction, then all parties/devices must review and sign that transaction. Once it has enough signatures, any device, can broadcast the transaction to the network.""")) btnCreate = QPushButton(tr("Create Transaction")) btnReview = QPushButton(tr("Review and Sign")) btnCancel = QPushButton(tr("Cancel")) if TheBDM.getBDMState()=='BlockchainReady': lblCreate = QRichLabel(tr(""" I am creating a new proposed spending transaction and will pass it to each party or device that needs to sign it""")) else: btnCreate.setEnabled(False) lblCreate = QRichLabel(tr(""" Transaction creation is not available when offline.""")) lblReview = QRichLabel(tr(""" Another party or device created the transaction, I just need to review and sign it.""")) self.connect(btnCreate, SIGNAL('clicked()'), self.doCreate) self.connect(btnReview, SIGNAL('clicked()'), self.doReview) self.connect(btnCancel, SIGNAL('clicked()'), self.reject) frmTop = makeHorizFrame([lblDescr], STYLE_STYLED) layoutBot = QGridLayout() layoutBot.addWidget(btnCreate, 0,0) layoutBot.addWidget(lblCreate, 0,1) layoutBot.addWidget(HLINE(), 1,0, 1,2) layoutBot.addWidget(btnReview, 2,0) layoutBot.addWidget(lblReview, 2,1) layoutBot.setColumnStretch(0, 0) layoutBot.setColumnStretch(1, 1) frmBot = QFrame() frmBot.setLayout(layoutBot) frmBot.setFrameStyle(STYLE_STYLED) frmCancel = makeHorizFrame([btnCancel, 'Stretch']) layoutMain = QVBoxLayout() layoutMain.addWidget(frmTop, 1) layoutMain.addWidget(frmBot, 1) layoutMain.addWidget(frmCancel, 0) self.setLayout(layoutMain) self.setMinimumWidth(500) def doCreate(self): self.selection = 'Create' self.accept() def doReview(self): self.selection = 'Review' self.accept() ################################################################################ class DlgSimulfundSelect(ArmoryDialog): def __init__(self, parent, main, lbID): super(DlgSimulfundSelect, self).__init__(parent, main) self.selection = None lbox = self.main.getLockboxByID(lbID) #dispStr = '%s-of-%s: %s (%s)' % \ #(htmlColor('TextBlue'), lbox.M, lbox.N, lbox.shortName, lbox.uniqueIDB58) dispStr = self.main.getDisplayStringForScript(lbox.binScript)['String'] lblTitle = QRichLabel(tr(""" Simultaneous Lockbox Funding""") % htmlColor('TextBlue'), hAlign=Qt.AlignHCenter) lblDescr = QRichLabel(tr(""" To have multiple parties simultaneously fund a lockbox, each party will need to create a "promissory note," and any other party will collect all of them to create a single simulfunding transaction. This transaction will be signed by all parties after reviewing that it meets their expectations. This process guarantees that either all parties commit funds simultaneously, or no one does. The signature that you provide using this interface is only valid if all the other funding commitments are also signed.

If you are both creating a promissory note and merging all the notes together, you should first create the promissory note and save it to disk or copy it to your clipboard. Once all other funding commitments have been received, open this dialog again and load all of them at once. Sign for your contribution and send the result to all the other parties.

You are currently handling a simulfunding operation for lockbox:
%s.""") % dispStr) btnCreate = QPushButton(tr('Create Promissory Note')) btnCollect = QPushButton(tr('Collect and Merge Notes')) btnReview = QPushButton(tr('Sign Simulfunding Transaction')) btnCancel = QPushButton(tr("Cancel")) if TheBDM.getBDMState()=='BlockchainReady': lblCreate = QRichLabel(tr(""" Create a commitment to a simulfunding transaction""")) else: btnCreate.setEnabled(False) lblCreate = QRichLabel(tr(""" Note creation is not available when offline.""")) lblCollect = QRichLabel(tr(""" Collect multiple promissory notes into a single simulfunding transaction""")) lblReview = QRichLabel(tr(""" Review and signed a simulfunding transaction (after all promissory notes have been collected)""")) self.connect(btnCreate, SIGNAL('clicked()'), self.doCreate) self.connect(btnCollect, SIGNAL('clicked()'), self.doCollect) self.connect(btnReview, SIGNAL('clicked()'), self.doReview) self.connect(btnCancel, SIGNAL('clicked()'), self.reject) frmTop = makeVertFrame([lblTitle, lblDescr], STYLE_STYLED) layoutBot = QGridLayout() layoutBot.addWidget(btnCreate, 0,0) layoutBot.addWidget(lblCreate, 0,1) layoutBot.addWidget(HLINE(), 1,0, 1,2) layoutBot.addWidget(btnCollect, 2,0) layoutBot.addWidget(lblCollect, 2,1) layoutBot.addWidget(HLINE(), 3,0, 1,2) layoutBot.addWidget(btnReview, 4,0) layoutBot.addWidget(lblReview, 4,1) layoutBot.setColumnStretch(0, 0) layoutBot.setColumnStretch(1, 1) frmBot = QFrame() frmBot.setLayout(layoutBot) frmBot.setFrameStyle(STYLE_STYLED) frmCancel = makeHorizFrame([btnCancel, 'Stretch']) layoutMain = QVBoxLayout() layoutMain.addWidget(frmTop, 1) layoutMain.addWidget(frmBot, 1) layoutMain.addWidget(frmCancel, 0) self.setLayout(layoutMain) self.setMinimumWidth(600) def doCreate(self): self.selection = 'Create' self.accept() def doCollect(self): self.selection = 'Collect' self.accept() def doReview(self): self.selection = 'Review' self.accept() ################################################################################ class DlgImportAsciiBlock(ArmoryDialog): def __init__(self, parent, main, titleStr, descrStr, fileTypes, importType): super(DlgImportAsciiBlock, self).__init__(parent) self.main = main self.fileTypes = fileTypes self.importType = importType self.returnObj = None lbl = QRichLabel(descrStr) self.txtAscii = QPlainTextEdit() self.txtAscii.setFont(GETFONT('Fixed', 9)) w,h = relaxedSizeNChar(self.txtAscii, 80) self.txtAscii.setMinimumWidth(w) btnLoad = QPushButton(tr("Load from file")) btnDone = QPushButton(tr("Done")) btnCancel = QPushButton(tr("Cancel")) self.connect(btnLoad, SIGNAL('clicked()'), self.loadfile) self.connect(btnDone, SIGNAL('clicked()'), self.clickedDone) self.connect(btnCancel, SIGNAL('clicked()'), self.reject) frmLoadButton = makeHorizFrame(['Stretch', btnLoad]) frmBottomRow = makeHorizFrame([btnCancel, 'Stretch', btnDone]) layout = QVBoxLayout() layout.addWidget(lbl) layout.addWidget(frmLoadButton) layout.addWidget(self.txtAscii, 1) layout.addWidget(frmBottomRow) self.setLayout(layout) self.setWindowTitle(titleStr) self.setMinimumWidth(450) ############################################################################# def loadfile(self): loadPath = self.main.getFileLoad(tr('Load Data'), self.fileTypes) if not loadPath: return with open(loadPath) as f: data = f.read() self.txtAscii.setPlainText(data) ############################################################################# def clickedDone(self): try: txt = str(self.txtAscii.toPlainText()).strip() self.returnObj = self.importType().unserializeAscii(txt) except: LOGEXCEPT('Error reading ASCII block') QMessageBox.warning(self, tr('Error'), tr(""" There was an error reading the ASCII block entered. Please make sure it was entered/copied correctly, and that you have copied the header and footer lines that start with "=====". """), QMessageBox.Ok) return self.accept() ################################################################################ class DlgSelectPublicKey(ArmoryDialog): def __init__(self, parent, main): super(DlgSelectPublicKey, self).__init__(parent, main) lblDescr = QRichLabel(tr("""
Select Public Key for Lockbox Creation

Lockbox creation requires public keys not the regular Bitcoin addresses most users are accustomed to. A public key is much longer than a regular bitcoin address, usually starting with "02", "03" or "04". Once you have selected a public key, send it to the lockbox organizer (person or device). The organizer will create the lockbox which then must be imported by all devices that will track the funds and/or sign transactions.

It is recommended that you select a new key from one of your wallets that will not be used for any other purpose. You can use a public key from a watching-only wallet (for an offline wallet), but you will have to sign the transactions the same way you would a regular offline transaction. Additionally the offline computer will need to have Armory version 0.92 or later.

BACKUP WARNING: It is highly recommended that you select a public key from a wallet for which you have good backups! If you are creating a lockbox requiring the same number of signatures as there are authorities (such as 2-of-2 or 3-of-3), the loss of the wallet will lead to loss of lockbox funds! """) % htmlColor('TextRed')) lblSelect = QRichLabel(tr('Select Public Key:'), doWrap=False) lblContact = QRichLabel(tr('Notes or Contact Info:'), doWrap=False) ttipContact = self.main.createToolTipWidget(tr(""" If multiple people will be part of this lockbox, you should specify name and contact info in the box below, which will be available to all parties that import the finalized lockbox.

If this lockbox will be shared among devices you own (such as for personal savings), specify information that helps you identify which device is associated with this public key.""")) self.edtContact = QLineEdit() w,h = relaxedSizeNChar(self.edtContact, 60) self.edtContact.setMinimumWidth(w) frmDescr = makeVertFrame([lblDescr], STYLE_RAISED) addrWidgets = self.main.createAddressEntryWidgets(self, '', 60, 2, getPubKey=True, showLockboxes=False) self.edtPubKey = addrWidgets['QLE_ADDR'] self.btnAddrBook = addrWidgets['BTN_BOOK'] self.lblDetect = addrWidgets['LBL_DETECT'] self.lblDetect.setVisible(True) #btnExportKey = QPushButton(tr('Send to Organizer')) #self.connect(btnExportKey, SIGNAL('clicked()'), self.doExportKey) #frmButtons = makeHorizFrame([QRichLabel(tr('When finished:')), #btnExportKey, #'Stretch']) layoutAddrEntry = QGridLayout() layoutAddrEntry.addWidget(lblSelect, 0,0) layoutAddrEntry.addWidget(self.edtPubKey, 0,1) layoutAddrEntry.addWidget(self.btnAddrBook, 0,2) layoutAddrEntry.addWidget(self.lblDetect, 1,1, 1,2) layoutAddrEntry.addWidget(lblContact, 2,0) layoutAddrEntry.addWidget(self.edtContact, 2,1) layoutAddrEntry.addWidget(ttipContact, 2,2) #layoutAddrEntry.addWidget(frmButtons, 3,0, 1,3) layoutAddrEntry.setColumnStretch(0,0) layoutAddrEntry.setColumnStretch(1,1) layoutAddrEntry.setColumnStretch(2,0) frmAddrEntry = QFrame() frmAddrEntry.setLayout(layoutAddrEntry) btnDone = QPushButton(tr('Continue')) btnCancel = QPushButton(tr('Cancel')) self.connect(btnDone, SIGNAL('clicked()'), self.doDone) self.connect(btnCancel, SIGNAL('clicked()'), self.reject) frmDone = makeHorizFrame([btnCancel, 'Stretch', btnDone]) mainLayout = QVBoxLayout() mainLayout.addWidget(frmDescr) mainLayout.addWidget(frmAddrEntry) mainLayout.addWidget(HLINE()) mainLayout.addWidget(frmDone) self.setLayout(mainLayout) self.setMinimumWidth(600) self.setWindowTitle(tr('Select Public Key for Lockbox')) self.setWindowIcon(QIcon(self.main.iconfile)) ############################################################################# def collectKeyData(self): try: binPub = hex_to_binary(str(self.edtPubKey.text()).strip()) if binPub[0] in ['\x02', '\x03'] and len(binPub)==33: pass # valid key elif binPub[0]=='\x04' and len(binPub)==65: if not CryptoECDSA().VerifyPublicKeyValid(SecureBinaryData(binPub)): raise BadAddressError('Public key starting with 0x04 is invalid') else: raise BadAddressError('Invalid pub key entered, or not a pub key') except: LOGEXCEPT('Invalid public key entered') QMessageBox.warning(self, tr('Invalid Public Key'), tr(""" You must enter a public key into the box, not a regular Bitcoin address that most users are accustomed to. A public key is much longer than a Bitcoin address, and always starts with "02", "03" or "04"."""), QMessageBox.Ok) return None comm = unicode(self.edtContact.text()).strip() dPubKey = DecoratedPublicKey(binPub, comm) return dPubKey.serializeAscii() ############################################################################# def doExportKey(self): toCopy = self.collectKeyData() if not toCopy: return dPubKey = DecoratedPublicKey().unserializeAscii(toCopy) title = tr("Export Public Key for Lockbox") descr = tr(""" The text below includes both the public key and the notes/contact info you entered. Please send this text to the organizer (person or device) to be used to create the lockbox. This data is not sensitive and it is appropriate be sent via email or transferred via USB storage. """) ftypes = ['Public Key Blocks (*.lockbox.pub)'] defaultFN = 'PubKey_%s_.lockbox.pub' % dPubKey.pubKeyID DlgExportAsciiBlock(self, self.main, dPubKey, title, descr, ftypes, defaultFN).exec_() def doDone(self): if self.collectKeyData() is None: return self.doExportKey() self.accept() ################################################################################ class DlgExportAsciiBlock(ArmoryDialog): def __init__(self, parent, main, exportObj, title, descr, ftypes, defaultFN): super(DlgExportAsciiBlock, self).__init__(parent, main) lblDescr = QRichLabel(descr) self.exportObj = exportObj self.fileTypes = ftypes self.defaultFN = defaultFN self.asciiBlock = exportObj.serializeAscii() txt = QPlainTextEdit() txt.setFont(GETFONT('Fixed', 9)) w,h = relaxedSizeNChar(txt, 80) txt.setMinimumWidth(w) txt.setMinimumHeight(h*9) txt.setPlainText(self.asciiBlock) txt.setReadOnly(True) self.lblCopyMail = QRichLabel('') btnCopy = QPushButton(tr("Copy to Clipboard")) btnSave = QPushButton(tr("Save to File")) btnMail = QPushButton(tr("Send Email")) btnDone = QPushButton(tr("Done")) self.connect(btnCopy, SIGNAL('clicked()'), self.clipcopy) self.connect(btnSave, SIGNAL('clicked()'), self.savefile) self.connect(btnMail, SIGNAL('clicked()'), self.mailLB) self.connect(btnDone, SIGNAL('clicked()'), self.accept) frmCopy = makeHorizFrame([btnSave, btnCopy, btnMail, self.lblCopyMail, \ 'Stretch']) frmDone = makeHorizFrame(['Stretch', btnDone]) frmMain = makeVertFrame([lblDescr, txt, frmCopy], STYLE_RAISED) layout = QVBoxLayout() layout.addWidget(frmMain) layout.addWidget(frmDone) self.setLayout(layout) self.setWindowTitle(title) self.setWindowIcon(QIcon(self.main.iconfile)) def savefile(self): fn = self.main.getFileSave(tr('Export ASCII Block'), self.fileTypes, self.defaultFN) if fn: with open(fn,'w') as f: f.write(self.asciiBlock + '\n') self.accept() def clipcopy(self): clipb = QApplication.clipboard() clipb.clear() clipb.setText(self.asciiBlock) self.lblCopyMail.setText('Copied!') def mailLB(self): # Iterate over the text block and get the public key ID. # WARNING: For now, the code assumes there will be only one ID returned. # If this changes in the future, the code must be adjusted as necessary. blockIO = cStringIO.StringIO(self.asciiBlock) pkID = getBlockID(blockIO, self.exportObj.BLKSTRING+'-')[0] # Prepare to send an email with the public key. For now, the email text # is the public key and nothing else. subj = tr(self.exportObj.EMAILSUBJ) % self.exportObj.asciiID body = tr(self.exportObj.EMAILBODY) urlText = 'mailto:?subject=%s&body=%s\n\n%s' % (subj, body, self.asciiBlock) finalUrl = QUrl(urlText) QDesktopServices.openUrl(finalUrl) if not self.main.getSettingOrSetDefault('DNAA_MailtoWarn', False): reply = MsgBoxWithDNAA(MSGBOX.Warning, tr('Email Triggered'), tr(""" Armory attempted to execute a "mailto:" link which should trigger your email application or web browser to open a compose-email window. This does not work in all environments, and you might have to manually copy and paste the text in the box into an email. """), dnaaMsg=tr('Do not show this message again'), dnaaStartChk=True) if reply[1]: self.main.writeSetting('DNAA_MailtoWarn', True) self.lblCopyMail.setText('Email produced!') ################################################################################ class DlgImportLockbox(ArmoryDialog): def __init__(self, parent, main): super(DlgImportLockbox, self).__init__(parent) self.main = main self.importedLockbox = None lbl = QRichLabel(tr(""" Import Lockbox

Copy the lockbox text block from file or email into the box below. If you have a file with the lockbox in it, you can load it using the "Load Lockbox" button at the bottom.""")) self.txtBoxBlock = QPlainTextEdit() self.txtBoxBlock.setFont(GETFONT('Fixed', 9)) w,h = relaxedSizeNChar(self.txtBoxBlock, 80) self.txtBoxBlock.setMinimumWidth(w) btnLoad = QPushButton(tr("Load from file")) btnDone = QPushButton(tr("Done")) btnCancel = QPushButton(tr("Cancel")) self.connect(btnLoad, SIGNAL('clicked()'), self.loadfile) self.connect(btnDone, SIGNAL('clicked()'), self.clickedDone) self.connect(btnCancel, SIGNAL('clicked()'), self.reject) frmLoadButton = makeHorizFrame(['Stretch', btnLoad]) frmBottomRow = makeHorizFrame([btnCancel, 'Stretch', btnDone]) layout = QVBoxLayout() layout.addWidget(lbl) layout.addWidget(frmLoadButton) layout.addWidget(self.txtBoxBlock, 1) layout.addWidget(frmBottomRow) self.setLayout(layout) self.setWindowTitle(tr('Import Lockbox')) self.setMinimumWidth(450) ############################################################################# def loadfile(self): boxPath = self.main.getFileLoad(tr('Load Lockbox'), ['Lockboxes (*.lockbox.def)']) if not boxPath: return with open(boxPath) as f: data = f.read() self.txtBoxBlock.setPlainText(data) ############################################################################# def clickedDone(self): txt = str(self.txtBoxBlock.toPlainText()).strip() try: self.importedLockbox = MultiSigLockbox().unserializeAscii(txt) except: LOGEXCEPT('Error unserializing the entered text') if self.importedLockbox == None: QMessageBox.critical(self, tr('Non-lockbox'), tr(""" You are attempting to load something that is not a Lockbox. Please clear the display and try again."""), QMessageBox.Ok) else: lbID = self.importedLockbox.uniqueIDB58 if not self.main.getLockboxByID(lbID) is None: reply = QMessageBox.warning(self, tr("Duplicate Lockbox"), tr(""" You just attempted to import a lockbox with ID, %s. This lockbox is already in your available list of lockboxes.

Even with the same ID, the lockbox information may be different. Would you like to overwrite the lockbox information already stored for %s?""") % (lbID,lbID), \ QMessageBox.Yes | QMessageBox.Cancel) if not reply==QMessageBox.Yes: return self.accept() ################################################################################ class DlgMultiSpendReview(ArmoryDialog): ############################################################################# def __init__(self, parent, main, ustx): super(DlgMultiSpendReview, self).__init__(parent, main) LOGDEBUG('Debugging information for multi-spend USTX') #ustx.pprint() lblDescr = QRichLabel(tr(""" The following transaction is a proposed spend of funds controlled by multiple parties. The keyholes next to each input represent required signatures for the tx to be valid. White means it has not yet been signed, and cannot be signed by you. Green represents signatures that can be added by one of your wallets. Gray keyholes are already signed.

Change outputs have been hidden where it is obvious (such as coins returning to the same lockbox from where it came). If there is any ambiguity, Armory will display all outputs.""")) KEYW,KEYH = 25,36 CHKW,CHKH = 32,32 PIEW,PIEH = 32,32 # These need to return copies self.pixGreen = lambda: QPixmap(':/keyhole_green.png').scaled(KEYW,KEYH) self.pixGray = lambda: QPixmap(':/keyhole_gray.png' ).scaled(KEYW,KEYH) self.pixBlue = lambda: QPixmap(':/keyhole_blue.png' ).scaled(KEYW,KEYH) self.pixWhite = lambda: QPixmap(':/keyhole_white.png').scaled(KEYW,KEYH) self.pixRed = lambda: QPixmap(':/keyhole_red.png' ).scaled(KEYW,KEYH) self.pixChk = lambda: QPixmap(':/checkmark32.png' ).scaled(CHKW,CHKH) self.pixPie = lambda m: QPixmap(':/frag%df.png'%m ).scaled(PIEW,PIEH) layout = QVBoxLayout() self.ustx = UnsignedTransaction().unserialize(ustx.serialize()) self.feeAmt = self.ustx.calculateFee() # Some simple container classes class InputBundle(object): def __init__(self): self.binScript = '' self.sendAmt = 0 self.dispStr = '' self.ustxiList = [] self.lockbox = None self.wltOfflineSign = [] self.wltSignRightNow = [] self.keyholePixmap = [] # Some simple container classes class OutputBundle(object): def __init__(self): self.recvAmt = 0 self.dispStr = '' self.lockbox = None self.wltID = None self.inputBundles = {} self.outputBundles = {} # NOTE: This will do some weird things if we have a contrib that # gets back more than he puts in... i.e. he will be required # to sign, but he will be receiving money, instead of sending # it. Right now, if that happens, he will show up as an # input bundle with a negative send amount # Accumulate and prepare all static info (that doesn't change with sigs) self.maxN = 0 canPotentiallySignAny = False for ustxi in self.ustx.ustxInputs: hrStr,idStr = self.main.getContribStr(ustxi.txoScript, ustxi.contribID, ustxi.contribLabel) iBundle = self.inputBundles.setdefault(idStr, InputBundle()) iBundle.ustxiList.append(ustxi) iBundle.sendAmt += ustxi.value iBundle.dispStr = hrStr if idStr[:2] in ['LB']: iBundle.lockbox = self.main.getLockboxByID(idStr.split(':')[-1]) canPotentiallySignAny = True # Check whether we have the capability to sign this lockbox iBundle.binScript = iBundle.lockbox.binScript M,N = iBundle.lockbox.M, iBundle.lockbox.N self.maxN = max(N, self.maxN) iBundle.wltOfflineSign = [None]*N iBundle.wltSignRightNow = [None]*N iBundle.keyholePixmap = [None]*N for i in range(N): a160 = iBundle.lockbox.a160List[i] wltID = self.main.getWalletForAddr160(a160) iBundle.keyholePixmap[i] = QLabel() iBundle.keyholePixmap[i].setPixmap(self.pixWhite()) if wltID: wlt = self.main.walletMap[wltID] wltType = determineWalletType(wlt, self.main)[0] if wltType in [WLTTYPES.WatchOnly, WLTTYPES.Offline]: iBundle.wltOfflineSign[i] = [wltID, a160] else: iBundle.wltSignRightNow[i] = [wltID, a160] iBundle.keyholePixmap[i].setPixmap(self.pixGreen()) else: iBundle.wltOfflineSign = [None] iBundle.wltSignRightNow = [None] iBundle.keyholePixmap = [None] M,N = 1,1 self.maxN = 1 if idStr[:3] in ['WLT']: canPotentiallySignAny = True iBundle.keyholePixmap[0] = QLabel() wltID = idStr.split(':')[-1] wlt = self.main.walletMap[wltID] wltType = determineWalletType(wlt, self.main)[0] a160 = CheckHash160(script_to_scrAddr(ustxi.txoScript)) if wltType in [WLTTYPES.WatchOnly, WLTTYPES.Offline]: iBundle.wltOfflineSign[0] = [wltID, a160] iBundle.keyholePixmap[0].setPixmap(self.pixWhite()) else: iBundle.wltSignRightNow[0] = [wltID, a160] iBundle.keyholePixmap[0].setPixmap(self.pixGreen()) else: # In these cases, nothing really to do pass # The output bundles are quite a bit simpler isReceivingAny = False for dtxo in self.ustx.decorTxOuts: hrStr,idStr = self.main.getContribStr(dtxo.binScript, dtxo.contribID, dtxo.contribLabel) if idStr in self.inputBundles: self.inputBundles[idStr].sendAmt -= dtxo.value else: oBundle = self.outputBundles.setdefault(idStr, OutputBundle()) oBundle.recvAmt += dtxo.value oBundle.dispStr = hrStr if idStr.startswith('LB:'): oBundle.lockbox = self.main.getLockboxByID(idStr.split(':')[-1]) if idStr[:3] in ['LB:', 'WLT']: isReceivingAny = True if not canPotentiallySignAny: if not isReceivingAny: QMessageBox.warning(self, tr("Unrelated Multi-Spend"), tr(""" The signature-collector you loaded appears to be unrelated to any of the wallets or lockboxes that you have available. If you were expecting to be able to sign for a lockbox input, you need to import the lockbox definition first. Any other person or device with the lockbox loaded can export it to be imported by this device."""), QMessageBox.Ok) else: QMessageBox.warning(self, tr("Cannot Sign"), tr(""" The signature-collector you loaded is sending money to one of your wallets or lockboxes, but does not have any inputs for which you can sign. If you were expecting to be able to sign for a lockbox input, you need to import the lockbox definition first. Any other person or device with the lockbox loaded can export it to be imported by this device."""), QMessageBox.Ok) layoutInputs = QGridLayout() layoutOutputs = QGridLayout() self.iWidgets = {} self.oWidgets = {} iin = 0 iout = 0 for idStr in self.inputBundles: self.iWidgets[idStr] = {} iWidgMap = self.iWidgets[idStr] topRow = (self.maxN+1)*iin iin += 1 iBundle = self.inputBundles[idStr] contribID = '' contribLabel = '' if len(iBundle.ustxiList) > 0: contribID = iBundle.ustxiList[0].contribID.strip() contribLabel = iBundle.ustxiList[0].contribLabel.strip() # The header line lists the name and value and any multisig pies if not contribLabel: iWidgMap['HeadLbl'] = QRichLabel(tr(""" Spending: %s""") % \ (htmlColor('TextBlue'), iBundle.dispStr), doWrap=False) else: if contribID: contribID = ' (%s)' % contribID iWidgMap['HeadLbl'] = QRichLabel(tr(""" Contributor: %s%s""") % \ (htmlColor('TextBlue'), contribLabel, contribID), doWrap=False) val = iBundle.sendAmt iWidgMap['Amount'] = QMoneyLabel(-val, txtSize=12, wBold=True) # These are images that show up to N=5 iWidgMap['HeadImg'] = [None]*self.maxN iWidgMap['KeyImg'] = [None]*self.maxN iWidgMap['KeyLbl'] = [None]*self.maxN iWidgMap['ChkImg'] = [None]*self.maxN iWidgMap['SignBtn'] = [None]*self.maxN for i in range(self.maxN): iWidgMap['HeadImg'][i] = QLabel() iWidgMap['KeyImg' ][i] = QLabel() iWidgMap['KeyLbl' ][i] = QRichLabel('', doWrap=False) iWidgMap['ChkImg' ][i] = QLabel() iWidgMap['SignBtn'][i] = QPushButton('') iWidgMap['ChkImg'][i].setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) # Now actually insert the widgets into a layout headerLine = [iWidgMap['HeadLbl']] headerLine.extend(iWidgMap['HeadImg']) headerLine.append('Stretch') headerLine.append(iWidgMap['Amount']) layoutInputs.addWidget(makeHorizFrame(headerLine), topRow,0, 1,4) def createSignCallback(idstring, nIdx): def doSign(): self.doSignForInput(idstring, nIdx) return doSign for i in range(self.maxN): row = topRow + 1 + i layoutInputs.addItem(QSpacerItem(20,20), row,0) layoutInputs.addWidget(iWidgMap['SignBtn'][i], row,1) layoutInputs.addWidget(iWidgMap['ChkImg' ][i], row,1) layoutInputs.addWidget(iWidgMap['KeyImg' ][i], row,2) layoutInputs.addWidget(iWidgMap['KeyLbl' ][i], row,3) self.connect(iWidgMap['SignBtn'][i], SIGNAL('clicked()'), \ createSignCallback(idStr, i)) lbox = iBundle.lockbox M = lbox.M if lbox else 1 N = lbox.N if lbox else 1 if i >= N: iWidgMap['SignBtn'][i].setVisible(False) iWidgMap['KeyImg' ][i].setVisible(False) iWidgMap['KeyLbl' ][i].setVisible(False) iWidgMap['ChkImg' ][i].setVisible(False) else: if lbox: comm = lbox.dPubKeys[i].keyComment elif len(iBundle.ustxiList) > 0: comm = iBundle.ustxiList[0].contribLabel else: comm = None wltID = '' if iBundle.wltOfflineSign[i]: wltID = iBundle.wltOfflineSign[i][0] elif iBundle.wltSignRightNow[i]: wltID = iBundle.wltSignRightNow[i][0] wltName = '' if wltID: wltName = self.main.walletMap[wltID].getDisplayStr() if not comm: if not wltName: dispStr = tr('[[Unknown Signer]]') else: dispStr = wltName else: if not wltName: dispStr = comm else: if lbox: dispStr = '%s [%s]' % (comm, wltName) else: dispStr = '%s' % wltName iWidgMap['KeyLbl' ][i].setText(dispStr) iWidgMap['HeadImg'][i].setPixmap(self.pixPie(M)) iWidgMap['KeyImg' ][i].setMinimumSize(KEYW,KEYH) iWidgMap['ChkImg' ][i].setMinimumSize(CHKW,CHKH) iWidgMap['KeyLbl' ][i].setWordWrap(False) if not lbox: iWidgMap['HeadImg'][i].setVisible(False) for widgetName,widgetList in iWidgMap.iteritems(): if widgetName in ['HeadLbl', 'Amount']: continue for i in range(self.maxN): lbox = iBundle.lockbox N = lbox.N if lbox else 1 if i >= N: widgetList[i].setVisible(False) layoutInputs.setColumnStretch(0,0) layoutInputs.setColumnStretch(1,0) layoutInputs.setColumnStretch(2,0) layoutInputs.setColumnStretch(3,1) layoutInputs.setColumnStretch(4,0) # Maybe one day we'll do full listing of lockboxes on the output side # But for now, it will only further complicate things... for idStr in self.outputBundles: lbox = self.outputBundles[idStr].lockbox M,N = [1,1] if lbox is None else [lbox.M, lbox.N] self.oWidgets[idStr] = {} oWidgMap = self.oWidgets[idStr] topRow = (self.maxN+1)*iout iout += 1 oWidgMap['HeadLbl'] = QRichLabel(tr(""" Receiving: %s""") % \ (htmlColor('TextBlue'), self.outputBundles[idStr].dispStr), \ doWrap=False) val = self.outputBundles[idStr].recvAmt oWidgMap['Amount'] = QMoneyLabel(val, txtSize=12, wBold=True) # These are the pie images oWidgMap['HeadImg'] = [None]*N for i in range(N): oWidgMap['HeadImg'][i] = QLabel() # Now actually insert the widgets into a layout headerLine = [oWidgMap['HeadLbl']] headerLine.extend(oWidgMap['HeadImg']) headerLine.append('Stretch') headerLine.append(oWidgMap['Amount']) layoutOutputs.addWidget(makeHorizFrame(headerLine), topRow,0, 1,5) if N>1: for i in range(N): oWidgMap['HeadImg'][i].setPixmap(self.pixPie(M)) oWidgMap['HeadImg'][i].setMinimumSize(PIEW,PIEH) # Add a fee row if needed if self.feeAmt > 0: row = (self.maxN+1)*iout lblFee = QRichLabel('Transaction Fee') lblAmt = QMoneyLabel(self.feeAmt, txtSize=12, wBold=True) frmTxFee = makeHorizFrame([lblFee, 'Stretch', lblAmt]) layoutOutputs.addWidget(HLINE(), row,0, 1,5) layoutOutputs.addWidget(frmTxFee, row+1,0, 1,5) frmInputs = QFrame() frmInputs.setLayout(layoutInputs) frmInputs.setFrameStyle(STYLE_STYLED) frmOutputs = QFrame() frmOutputs.setLayout(layoutOutputs) frmOutputs.setFrameStyle(STYLE_STYLED) self.btnLoadImport = QPushButton(tr('Import/Merge')) self.lblFinalMsg = QRichLabel('') self.lblFinalChk = QLabel() self.btnFinalBroad = QPushButton(tr('Broadcast')) self.btnFinalExport = QPushButton(tr('Export')) self.lblFinalChk.setMinimumSize(CHKW,CHKH) layoutBtns = QHBoxLayout() layoutBtns.addWidget(self.btnLoadImport) layoutBtns.addStretch() layoutBtns.addWidget(self.lblFinalMsg, 1) layoutBtns.addWidget(self.lblFinalChk) layoutBtns.addWidget(self.btnFinalBroad) layoutBtns.addWidget(self.btnFinalExport) frmButtons = QFrame() frmButtons.setLayout(layoutBtns) self.connect(self.btnLoadImport, SIGNAL('clicked()'), self.doImport) self.connect(self.btnFinalBroad, SIGNAL('clicked()'), self.doBroadcast) self.connect(self.btnFinalExport, SIGNAL('clicked()'), self.doExport) frmMain = makeVertFrame([lblDescr, HLINE(), HLINE(), frmInputs, HLINE(), HLINE(), frmOutputs, HLINE(), frmButtons]) # Actually, this dialog will not handle changing USTX objects yet # For now, need to pre-select your USTX, then load this dialog with it #self.btnLoadImport.setVisible(False) layoutMain = QVBoxLayout() layoutMain.addWidget(frmMain) self.setLayout(layoutMain) self.setMinimumWidth(750) # Evaluate SigningStatus returns per-wallet details if a wlt is given self.relevancyMap = {} self.canSignMap = {} self.alreadySigned = {} self.evalSigStat() ############################################################################# def doSignForInput(self, idStr, keyIdx): ib = self.inputBundles[idStr] wltID, a160 = ib.wltSignRightNow[keyIdx] wlt = self.main.walletMap[wltID] pytx = self.ustx.pytxObj if wlt.useEncryption and wlt.isLocked: dlg = DlgUnlockWallet(wlt, self, self.main, 'Sign Lockbox') if not dlg.exec_(): QMessageBox.critical(self, 'Wallet is locked', 'Cannot sign without unlocking wallet!', QMessageBox.Ok) return if ib.lockbox: # If a lockbox, all USTXIs require the same signing key for ustxi in ib.ustxiList: addrObj = wlt.getAddrByHash160(a160) ustxi.createAndInsertSignature(pytx, addrObj.binPrivKey32_Plain) else: # Not lockboxes... may have to access multiple keys in wallet for ustxi in ib.ustxiList: a160 = CheckHash160(ustxi.scrAddrs[0]) addrObj = wlt.getAddrByHash160(a160) ustxi.createAndInsertSignature(pytx, addrObj.binPrivKey32_Plain) self.evalSigStat() ############################################################################# def evalSigStat(self): self.relevancyMap = {} self.canSignMap = {} self.alreadySigned = {} # Not sure if we really need this... for wltID,pyWlt in self.main.walletMap.iteritems(): txss = self.ustx.evaluateSigningStatus(pyWlt.cppWallet) self.relevancyMap[wltID] = txss.wltIsRelevant self.canSignMap[wltID] = txss.wltCanSign self.alreadySigned[wltID] = txss.wltAlreadySigned # This is complex, for sure. # The outermost loop goes over all inputs and outputs # Then goes over all N public keys for idStr,ib in self.inputBundles.iteritems(): iWidgMap = self.iWidgets[idStr] # Since we are calling this without a wlt, each key state can only # be either ALREADY_SIGNED or NO_SIGNATURE (no WLT* possible) isigstat = ib.ustxiList[0].evaluateSigningStatus() N = ib.lockbox.N if ib.lockbox else 1 for i in range(N): signBtn = iWidgMap['SignBtn'][i] chkLbl = iWidgMap['ChkImg'][i] keyImg = iWidgMap['KeyImg'][i] if isigstat.statusN[i]==TXIN_SIGSTAT.ALREADY_SIGNED: chkLbl.setVisible(True) chkLbl.setPixmap(self.pixChk()) signBtn.setEnabled(False) signBtn.setVisible(False) signBtn.setText(tr('Done!')) keyImg.setPixmap(self.pixGray()) elif ib.wltSignRightNow[i]: chkLbl.setVisible(False) chkLbl.setPixmap(QPixmap()) signBtn.setVisible(True) signBtn.setEnabled(True) signBtn.setText('Sign') keyImg.setPixmap(self.pixGreen()) elif ib.wltOfflineSign[i]: wltID = ib.wltOfflineSign[i][0] wlt = self.main.walletMap[wltID] wltType = determineWalletType(wlt, self.main)[0] if wltType==WLTTYPES.WatchOnly: chkLbl.setVisible(False) chkLbl.setPixmap(QPixmap()) signBtn.setVisible(False) signBtn.setEnabled(False) signBtn.setText('Offline') keyImg.setPixmap(self.pixWhite()) elif wltType==WLTTYPES.Offline: chkLbl.setVisible(False) chkLbl.setPixmap(QPixmap()) signBtn.setVisible(True) signBtn.setEnabled(False) signBtn.setText('Offline') keyImg.setPixmap(self.pixWhite()) else: chkLbl.setPixmap(QPixmap()) chkLbl.setVisible(False) signBtn.setVisible(True) signBtn.setVisible(False) keyImg.setPixmap(self.pixWhite()) signBtn.setVisible(False) # Now modify the window/buttons based on the whole transaction state # (i.e. Can broadcast, etc) extraTxt = tr('') if not self.main.netMode == NETWORKMODE.Full: extraTxt = tr(""" from any online computer (you are currently offline)""") txss = self.ustx.evaluateSigningStatus() if txss.canBroadcast: self.lblFinalMsg.setText(tr(""" This transaction has enough signatures and can be broadcast %s""") % (htmlColor('TextGreen'), extraTxt)) self.btnFinalBroad.setVisible(True) self.btnFinalBroad.setEnabled(self.main.netMode == NETWORKMODE.Full) self.btnFinalExport.setVisible(True) self.btnFinalExport.setEnabled(True) self.lblFinalChk.setPixmap(self.pixChk()) else: self.lblFinalMsg.setText( tr(""" This transaction is incomplete. You can add signatures then export and give to other parties or devices to sign.""") % htmlColor('TextWarn')) self.btnFinalBroad.setVisible(False) self.btnFinalBroad.setEnabled(False) self.btnFinalExport.setVisible(True) self.btnFinalExport.setEnabled(True) self.lblFinalChk.setPixmap(QPixmap()) def doExport(self): #class DlgExportAsciiBlock(ArmoryDialog): #def __init__(self, parent, main, exportObj, title, descr, fileTypes, defaultFN) title = tr("Export Signature Collector") descr = tr(""" The text below includes all data about this multi-sig transaction, including all the signatures already made to it. It contains everything needed to securely review and sign it, including offline devices/wallets.

If this transaction requires signatures from multiple parties, it is safe to send this data via email or USB key. No data is included that would compromise the security of any of the signing devices.""") ftypes = ['Signature Collectors (*.sigcollect.tx)'] defaultFN = 'MultisigTransaction_%s_.sigcollect.tx' % self.ustx.uniqueIDB58 DlgExportAsciiBlock(self, self.main, self.ustx, title, descr, ftypes, defaultFN).exec_() def doImport(self): title = tr("Import Signature Collector") descr = tr(""" Load a multi-sig transaction for review, signing and/or broadcast. If any of your loaded wallets can sign for any transaction inputs, you will be able to execute the signing for each one. If your signature completes the transaction, you can then broadcast it to finalize it.""") ftypes = ['Signature Collectors (*.sigcollect.tx)'] importType = self.ustx.__class__ dlg = DlgImportAsciiBlock(self, self.main, title, descr, ftypes, importType) if dlg.exec_(): # Merge signatures if the current ustx ID matchs the imported file if self.ustx.uniqueIDB58 == dlg.returnObj.uniqueIDB58: for i in range(len(dlg.returnObj.ustxInputs)): for j in range(len(dlg.returnObj.ustxInputs[i].signatures)): if len(self.ustx.ustxInputs[i].signatures[j]) > 0: dlg.returnObj.ustxInputs[i].signatures[j] = \ self.ustx.ustxInputs[i].signatures[j] # FIXME: This is a serious hack because I didn't have time to implement # reloading an existing dialog with a new USTX, so I just recurse # for now (it's because all the layouts are set in the __init__ # function, etc... self.accept() DlgMultiSpendReview(self.parent, self.main, dlg.returnObj).exec_() def doBroadcast(self): finalTx = self.ustx.getSignedPyTx(doVerifySigs=True) if not finalTx: #self.ustx.evaluateSigningStatus().pprint() QMessageBox.critical(self, tr('Invalid Signatures'), tr(""" Somehow not all inputs have valid sigantures! You can choose to attempt to broadcast anyway, in case you think Armory is not evaluating the transaction state correctly.

Otherwise, please confirm that you have created signatures from the correct wallets. Perhaps try collecting signatures again...?"""), QMessageBox.Ok) finalTx = self.ustx.getSignedPyTx(doVerifySigs=False) self.main.broadcastTransaction(finalTx, withOldSigWarning=False) try: self.parent.tabbedDisplay.setCurrentIndex(2) except: try: self.parent.parent.tabbedDisplay.setCurrentIndex(2) except: pass self.accept() ################################################################################ class DlgCreatePromNote(ArmoryDialog): ############################################################################# def __init__(self, parent, main, defaultIDorAddr=None, skipExport=False): super(DlgCreatePromNote, self).__init__(parent, main) self.finalPromNote = None self.skipExport = skipExport lblDescr = QRichLabel(tr(""" Create Simulfunding Promissory Note """) % htmlColor('TextBlue'), hAlign=Qt.AlignHCenter, doWrap=False) lblDescr2 = QRichLabel(tr(""" Use this form to create a "promissory note" which can be combined with notes from other parties to fund an address or lockbox simultaneously ("simulfunding"). This funding transaction will not be valid until all promissory notes are merged into a single transaction, then all funding parties will review and sign it.

If this lockbox is being funded by only one party, using this interface is unnecessary. Have the funding party send Bitcoins to the destination address or lockbox in the normal way.""")) lblNoteSrc = QRichLabel(tr(""" NOTE: At the moment, simulfunding is restricted to using single-signature wallets/addresses for funding. More complex simulfunding transactions will be possible in a future version of Armory.""")) if len(self.main.walletIDList)>0: self.spendFromWltID = self.main.walletIDList[0] else: self.spendFromWltID = '' def selectWalletFunc(wlt): self.spendFromWltID = wlt.uniqueIDB58 wltFrame = SelectWalletFrame(self, self.main, HORIZONTAL, selectWltCallback=selectWalletFunc) # Create the frame that specifies the target of the funding lblAddress = QRichLabel(tr('Address:')) lblAmount = QRichLabel(tr('Amount:')) lblFee = QRichLabel(tr('Add fee:')) lblBTC1 = QRichLabel(tr('BTC')) lblBTC2 = QRichLabel(tr('BTC')) startStr = '' if defaultIDorAddr: if checkAddrStrValid(defaultIDorAddr): startStr = defaultIDorAddr else: startStr = createLockboxEntryStr(defaultIDorAddr) aewMap = self.main.createAddressEntryWidgets(self, startStr, maxDetectLen=72, boldDetectParts=2) self.edtFundTarget = aewMap['QLE_ADDR'] self.btnSelectTarg = aewMap['BTN_BOOK'] self.lblAutoDetect = aewMap['LBL_DETECT'] self.parseEntryFunc = aewMap['CALLBACK_GETSCRIPT'] self.lblAutoDetect.setWordWrap(False) self.edtAmountBTC = QLineEdit() self.edtAmountBTC.setFont(GETFONT('Fixed')) self.edtAmountBTC.setMinimumWidth(tightSizeNChar(GETFONT('Fixed'), 16)[0]) self.edtAmountBTC.setAlignment(Qt.AlignLeft) self.edtFeeBTC = QLineEdit() self.edtFeeBTC.setFont(GETFONT('Fixed')) self.edtFeeBTC.setMinimumWidth(tightSizeNChar(GETFONT('Fixed'), 16)[0]) self.edtFeeBTC.setAlignment(Qt.AlignLeft) self.edtFeeBTC.setText('0.0') lblComment = QRichLabel('Funder Label (optional):') self.edtKeyLabel = QLineEdit() self.edtKeyLabel.setMaxLength(144) ttipFunder = self.main.createToolTipWidget(tr(""" This label will be attached to the promissory note to help identify who is committing these funds. If you do not fill this in, each other party signing will see [[Unknown Signer]] for the ID.""")) frmKeyComment = makeHorizFrame([lblComment, self.edtKeyLabel, ttipFunder]) gboxIn = QGroupBox(tr('Source of Funding')) gboxInLayout = QVBoxLayout() gboxInLayout.addWidget(lblNoteSrc) gboxInLayout.addWidget(wltFrame) gboxInLayout.addWidget(frmKeyComment) gboxIn.setLayout(gboxInLayout) gboxOut = QGroupBox(tr('Funding Destination')) gboxOutLayout = QGridLayout() gboxOutLayout.addWidget(lblAddress, 0,0) gboxOutLayout.addWidget(self.edtFundTarget, 0,1, 1,5) gboxOutLayout.addWidget(self.btnSelectTarg, 0,6) gboxOutLayout.addWidget(self.lblAutoDetect, 1,1, 1,5) gboxOutLayout.addWidget(lblAmount, 3,0) gboxOutLayout.addWidget(self.edtAmountBTC, 3,1) gboxOutLayout.addWidget(lblBTC1, 3,2) gboxOutLayout.addWidget(lblFee, 3,4) gboxOutLayout.addWidget(self.edtFeeBTC, 3,5) gboxOutLayout.addWidget(lblBTC2, 3,6) gboxOutLayout.setColumnStretch(0, 0) gboxOutLayout.setColumnStretch(1, 0) gboxOutLayout.setColumnStretch(2, 0) gboxOutLayout.setColumnStretch(3, 1) gboxOutLayout.setColumnStretch(4, 0) gboxOut.setLayout(gboxOutLayout) btnExit = QPushButton(tr('Cancel')) btnDone = QPushButton(tr('Continue')) self.connect(btnExit, SIGNAL('clicked()'), self.reject) self.connect(btnDone, SIGNAL('clicked()'), self.doContinue) frmButtons = makeHorizFrame([btnExit, 'Stretch', btnDone]) mainLayout = QVBoxLayout() mainLayout.addWidget(lblDescr) mainLayout.addWidget(lblDescr2) mainLayout.addWidget(HLINE()) mainLayout.addWidget(gboxIn) mainLayout.addWidget(HLINE()) mainLayout.addWidget(gboxOut) mainLayout.addWidget(HLINE()) mainLayout.addWidget(frmButtons) self.setLayout(mainLayout) self.layout().setSizeConstraint(QLayout.SetFixedSize) self.setWindowTitle('Create Promissory Note') #self.updateTargetLabel() self.setMinimumWidth(600) ############################################################################# def updateTargetLabel(self): try: addrText = str(self.edtFundTarget.text()) if addrStr_is_p2sh(addrText): lboxID = self.main.getLockboxByP2SHAddrStr(addrText).uniqueIDB58 else: lboxID = readLockboxEntryStr(addrText) if lboxID: lbox = self.main.getLockboxByID(lboxID) if lbox: dispStr = '%s-of-%s: %s' % (lbox.M, lbox.N, lbox.shortName) else: dispStr = 'Unrecognized Lockbox' self.lblTargetID.setVisible(True) self.lblTargetID.setText(dispStr, color='TextBlue') return wltID = self.main.getWalletForAddr160(addrStr_to_hash160(addrText)[1]) if wltID: wlt = self.main.walletMap[wltID] dispStr = '%s (%s)' % (wlt.labelName, wlt.uniqueIDB58) self.lblTargetID.setVisible(True) self.lblTargetID.setText(dispStr, color='TextBlue') return self.lblTargetID.setVisible(False) except: LOGEXCEPT('') self.lblTargetID.setVisible(False) ############################################################################# def doContinue(self): if not TheBDM.getBDMState()=='BlockchainReady': LOGERROR('Blockchain not avail for creating prom note') QMessageBox.critical(self, tr('Blockchain Not Available'), tr(""" The blockchain has become unavailable since you opened this window. Creation of the promissory note cannot continue. If you think you should be online, please try again in a minute, or after restarting Armory"""), QMessageBox.Ok) return False # TODO: Expand this to allow simulfunding from lockbox(es) wlt = self.main.walletMap.get(self.spendFromWltID, None) lbox = self.main.getLockboxByID(self.spendFromWltID) if lbox is not None: LOGERROR('Simulfunding from lockbox not currently implemented') QMessageBox.critical(self, tr('Lockbox Selected'), tr(""" Currently, Armory does not implement simulfunding with lockbox inputs. Please choose a regular wallet as your input"""), QMessageBox.Ok) return False elif wlt is None: LOGERROR('No wallet in map with ID: "%s"' % self.spendFromWltID) QMessageBox.critical(self, tr('No Wallet Selected'), tr(""" The wallet selected is not available. Select another wallet."""), QMessageBox.Ok) return False # Read the user-supplied BTC value to contribute try: valueStr = str(self.edtAmountBTC.text()) valueAmt = str2coin(valueStr) if valueAmt == 0: QMessageBox.critical(self, tr('Zero Amount'), tr(""" You cannot promise 0 BTC.
Please enter a positive amount."""), QMessageBox.Ok) return False except NegativeValueError: QMessageBox.critical(self, tr('Negative Value'), tr(""" You have specified a negative amount.
Only positive values are allowed!"""), QMessageBox.Ok) return False except TooMuchPrecisionError: QMessageBox.critical(self, tr('Too much precision'), tr(""" Bitcoins can only be specified down to 8 decimal places. The smallest value that can be sent is 0.0000 0001 BTC. Please enter a new amount"""), QMessageBox.Ok) return False except ValueError: QMessageBox.critical(self, tr('Missing amount'), tr(""" You did not specify an amount to promise!"""), QMessageBox.Ok) return False except: QMessageBox.critical(self, tr('Invalid Value String'), tr(""" The amount you specified is invalid (%s).""") % valueStr, QMessageBox.Ok) LOGEXCEPT('Invalid amount specified: "%s"', valueStr) return False # Read the fee string try: feeStr = str(self.edtFeeBTC.text()) feeAmt = str2coin(feeStr) except NegativeValueError: QMessageBox.critical(self, tr('Negative Fee'), tr(""" You have specified a negative amount.
Only positive values are allowed!"""), QMessageBox.Ok) return False except TooMuchPrecisionError: QMessageBox.critical(self, tr('Too much precision'), tr(""" Bitcoins can only be specified down to 8 decimal places. The smallest value that can be sent is 0.0000 0001 BTC. Please enter a new amount"""), QMessageBox.Ok) return False except ValueError: QMessageBox.critical(self, tr('Missing amount'), tr(""" 'You did not specify an amount to promise!"""), QMessageBox.Ok) return False except: QMessageBox.critical(self, tr('Invalid Fee String'), tr(""" The amount you specified is invalid (%s).""") % feeStr, QMessageBox.Ok) LOGEXCEPT('Invalid amount specified: "%s"', feeStr) return False totalAmt = valueAmt + feeAmt availBal = wlt.getBalance('Spendable') if totalAmt > availBal: QMessageBox.critical(self, tr('Not enough funds!'), tr(""" You specified %s BTC (amount + fee), but the selected wallet only has %s BTC spendable.""") % (coin2strNZS(totalAmt), coin2strNZS(availBal)), QMessageBox.Ok) return False utxoList = wlt.getTxOutList('Spendable') utxoSelect = PySelectCoins(utxoList, valueAmt, feeAmt) if len(utxoSelect) == 0: QMessageBox.critical(self, tr('Coin Selection Error'), tr(""" There was an error constructing your transaction, due to a quirk in the way Bitcoin transactions work. If you see this error more than once, try sending your BTC in two or more separate transactions."""), QMessageBox.Ok) return False # Create the target DTXO targetScript = self.parseEntryFunc()['Script'] dtxoTarget = DecoratedTxOut(targetScript, valueAmt) # Create the change DTXO # TODO: Expand this to allow simulfunding from lockbox(es) #pprintUnspentTxOutList(utxoSelect) changeAmt = sumTxOutList(utxoSelect) - (valueAmt + feeAmt) dtxoChange = None if changeAmt > 0: changeAddr160 = wlt.getNextUnusedAddress().getAddr160() changeScript = hash160_to_p2pkhash_script(changeAddr160) dtxoChange = DecoratedTxOut(changeScript, changeAmt) else: LOGINFO('Had exact change for prom note: dtxoChange=None') # If we got here, we can carry through with creating the prom note ustxiList = [] for i in range(len(utxoSelect)): utxo = utxoSelect[i] txHash = utxo.getTxHash() txoIdx = utxo.getTxOutIndex() cppTx = TheBDM.getTxByHash(txHash) if not cppTx.isInitialized(): LOGERROR('UTXO was supplied for which we could not find prev Tx') QMessageBox.warning(self, tr('Transaction Not Found'), tr(""" There was an error creating the promissory note -- the selected coins were not found in the blockchain. Please go to "Help"\xe2\x86\x92"Submit Bug Report" from the main window and submit your log files so the Armory team can review this error."""), QMessageBox.Ok) rawTx = cppTx.serialize() utxoScrAddr = utxo.getRecipientScrAddr() aobj = wlt.getAddrByHash160(CheckHash160(utxoScrAddr)) pubKeys = {utxoScrAddr: aobj.binPublicKey65.toBinStr()} ustxiList.append(UnsignedTxInput(rawTx, txoIdx, None, pubKeys)) funderStr = str(self.edtKeyLabel.text()).strip() self.finalPromNote = MultiSigPromissoryNote(dtxoTarget, feeAmt, ustxiList, dtxoChange, funderStr) LOGINFO('Successfully created prom note: %s' % self.finalPromNote.promID) if self.skipExport: self.accept() else: title = tr("Export Promissory Note") descr = tr(""" The text below includes all the data needed to represent your contribution to a simulfunding transaction. Your money cannot move because you have not signed anything, yet. Once all promissory notes are collected, you will be able to review the entire funding transaction before signing.""") ftypes = ['Promissory Notes (*.promnote)'] defaultFN = 'Contrib_%s_%sBTC.promnote' % \ (self.finalPromNote.promID, coin2strNZS(valueAmt)) if not DlgExportAsciiBlock(self, self.main, self.finalPromNote, title, descr, ftypes, defaultFN).exec_(): return False else: self.accept() ################################################################################ class DlgMergePromNotes(ArmoryDialog): ############################################################################# def __init__(self, parent, main, lboxID=None): super(DlgMergePromNotes, self).__init__(parent, main) self.cumulPay = 0 self.cumulFee = 0 self.promNotes = [] self.promIDSet = set([]) # Will be none if lboxID is None: self.lbox = None self.promMustMatch = None else: self.lbox = self.main.getLockboxByID(lboxID) self.promMustMatch = self.reduceScript(self.lbox.binScript) lblTitle = QRichLabel(tr(""" Merge Promissory Notes """) % htmlColor('TextBlue'), hAlign=Qt.AlignHCenter, doWrap=False) lblDescr = QRichLabel(tr(""" Collect promissory notes from two or more parties to combine them into a single simulfunding transaction. Once all notes are collected you will be able to send it to each contributing party for review and signing.""")) if self.lbox: #lbTargStr = 'Lockbox %s-of-%s: %s (%s)' % \ #(htmlColor('TextBlue'), self.lbox.M, self.lbox.N, #self.lbox.shortName, self.lbox.uniqueIDB58) lbTargStr = self.main.getDisplayStringForScript(self.lbox.binScript) lbTargStr = lbTargStr['String'] gboxTarget = QGroupBox(tr('Lockbox Being Funded')) else: lbTargStr = '' gboxTarget = QGroupBox(tr('Address Being Funded')) self.lblTarg = QRichLabel(lbTargStr) lblPayText = QRichLabel('Total Funding:', doWrap=False) lblFeeText = QRichLabel('Total Fee:', doWrap=False) self.lblCurrPay = QMoneyLabel(0, maxZeros=2) self.lblCurrFee = QMoneyLabel(0, maxZeros=2) self.lblPayUnits = QRichLabel('BTC') self.lblFeeUnits = QRichLabel('BTC') gboxTargetLayout = QGridLayout() gboxTargetLayout.addWidget(self.lblTarg, 1,0, 1,6) gboxTargetLayout.addItem(QSpacerItem(20,20), 2,0) gboxTargetLayout.addWidget(lblPayText, 2,1) gboxTargetLayout.addItem(QSpacerItem(20,20), 2,2) gboxTargetLayout.addWidget(self.lblCurrPay, 2,3) gboxTargetLayout.addWidget(self.lblPayUnits, 2,4) gboxTargetLayout.addItem(QSpacerItem(20,20), 3,0) gboxTargetLayout.addWidget(lblFeeText, 3,1) gboxTargetLayout.addItem(QSpacerItem(20,20), 3,2) gboxTargetLayout.addWidget(self.lblCurrFee, 3,3) gboxTargetLayout.addWidget(self.lblFeeUnits, 3,4) gboxTargetLayout.setColumnStretch(0,0) gboxTargetLayout.setColumnStretch(1,0) gboxTargetLayout.setColumnStretch(2,0) gboxTargetLayout.setColumnStretch(3,0) gboxTargetLayout.setColumnStretch(4,0) gboxTargetLayout.setColumnStretch(5,1) gboxTarget.setLayout(gboxTargetLayout) # For when there's no prom note yet self.gboxLoaded = QGroupBox(tr('Loaded Promissory Notes')) lblNoInfo = QRichLabel(tr(""" No Promissory Notes Have Been Added"""), hAlign=Qt.AlignHCenter, vAlign=Qt.AlignVCenter) gboxLayout = QVBoxLayout() gboxLayout.addWidget(lblNoInfo) self.gboxLoaded.setLayout(gboxLayout) self.promModel = PromissoryCollectModel(self.main, self.promNotes) self.promView = QTableView() self.promView.setModel(self.promModel) self.promView.setSelectionMode(QTableView.NoSelection) width0 = relaxedSizeNChar(self.promView, 12)[0] width23 = relaxedSizeNChar(GETFONT('Fixed'), 12)[0] initialColResize(self.promView, [width0, 300, width23, width23]) self.promView.horizontalHeader().setStretchLastSection(True) self.promView.verticalHeader().setDefaultSectionSize(20) self.promLoadStacked = QStackedWidget() self.promLoadStacked.addWidget(self.gboxLoaded) self.promLoadStacked.addWidget(self.promView) self.updatePromTable() btnImport = QPushButton(tr('Import Promissory Note')) btnCreate = QPushButton(tr('Create && Add Promissory Note')) self.connect(btnImport, SIGNAL('clicked()'), self.importNote) self.connect(btnCreate, SIGNAL('clicked()'), self.createPromAdd) frmImport = makeHorizFrame(['Stretch', btnImport, btnCreate, 'Stretch']) btnCancel = QPushButton(tr('Cancel')) self.chkBareMS = QCheckBox(tr('Use bare multisig (no P2SH)')) self.ttipBareMS = self.main.createToolTipWidget( tr(""" EXPERT OPTION: Do not check this box unless you know what it means and you need it! Forces Armory to exposes public keys to the blockchain before the funds are spent. This is only needed for very specific use cases, and otherwise creates blockchain bloat.""")) btnFinish = QPushButton(tr('Continue')) self.connect(btnCancel, SIGNAL('clicked()'), self.reject) self.connect(btnFinish, SIGNAL('clicked()'), self.mergeNotesCreateUSTX) frmButtons = makeHorizFrame([btnCancel, 'Stretch', self.chkBareMS, self.ttipBareMS, btnFinish]) # If this was opened with default lockbox, set visibility, save ms script # If opened generic, this will be set first time importNote() is called self.chkBareMS.setVisible(False) self.ttipBareMS.setVisible(False) if self.lbox is not None: self.chkBareMS.setVisible(True) self.ttipBareMS.setVisible(True) self.msTarget = self.lbox.binScript mainLayout = QVBoxLayout() mainLayout.addWidget(lblTitle, 0) mainLayout.addWidget(lblDescr, 0) mainLayout.addWidget(HLINE(), 0) mainLayout.addWidget(frmImport, 0) mainLayout.addWidget(HLINE(), 0) mainLayout.addWidget(self.promLoadStacked, 1) mainLayout.addWidget(HLINE(), 0) mainLayout.addWidget(gboxTarget, 0) mainLayout.addWidget(HLINE(), 0) mainLayout.addWidget(frmButtons, 0) self.setLayout(mainLayout) self.setMinimumWidth(700) ############################################################################# def importNote(self): title = tr('Import Promissory Note') descr = tr(""" Import a promissory note to add to this simulfunding transaction""") ftypes = ['Promissory Notes (*.promnote)'] dlgImport = DlgImportAsciiBlock(self, self.main, title, descr, ftypes, MultiSigPromissoryNote) dlgImport.exec_() promnote = None if dlgImport.returnObj: promnote = dlgImport.returnObj #promnote.pprint() if not promnote: QMessageBox.critical(self, tr('Invalid Promissory Note'), tr(""" No promissory note was loaded."""), QMessageBox.Ok) return self.addNote(promnote) ############################################################################# def createPromAdd(self): if not TheBDM.getBDMState()=='BlockchainReady': QMessageBox.warning(self, tr("Not Online"), tr(""" Armory is currently in offline mode and cannot create any transactions or promissory notes. You can only merge pre-existing promissory notes at this time."""), QMessageBox.Ok) return defaultTarg = None if self.promMustMatch: for lbox in self.main.allLockboxes: if lbox.p2shScrAddr == self.promMustMatch: defaultTarg = lbox.uniqueIDB58 break else: defaultTarg = scrAddr_to_addrStr(self.promMustMatch) dlg = DlgCreatePromNote(self, self.main, defaultTarg, skipExport=True) dlg.exec_() if dlg.finalPromNote: self.addNote(dlg.finalPromNote) ############################################################################# def addNote(self, promnote): if promnote.promID in self.promIDSet: QMessageBox.critical(self, tr('Already Loaded'), tr(""" This promissory note has already been loaded!"""), QMessageBox.Ok) return # reduceScript returns the same scrAddr for a bare multi-sig as it does # for it's P2SH form targetScript = promnote.dtxoTarget.binScript promTarget = self.reduceScript(targetScript) # If loaded from main window menu, we have nothing to match yet; set it if not self.promMustMatch: self.promMustMatch = promTarget contribStr = self.main.getContribStr(targetScript)[0] self.lblTarg.setText('%s' % \ (htmlColor('TextBlue'), contribStr)) # If this is a multi-sig target, or it's a P2SH multisig we recognize # then provide the option to use bare multi-sig (which may be # desriable in certain contexts). self.chkBareMS.setVisible(False) self.ttipBareMS.setVisible(False) for lbID,cppWlt in self.main.cppLockboxWltMap.iteritems(): if cppWlt.hasScrAddress(promTarget): LOGINFO('Have lockbox for the funding target: %s' % lbID) lb = self.main.getLockboxByID(lbID) if lb and lb.binScript and \ getTxOutScriptType(lb.binScript)==CPP_TXOUT_MULTISIG: self.msTarget = lb.binScript self.chkBareMS.setVisible(True) self.ttipBareMS.setVisible(True) break # By now, we should always know what target addr ... make sure it matches if not promTarget==self.promMustMatch: QMessageBox.critical(self, tr('Mismatched Funding Target'), tr(""" The promissory note you loaded is for a different funding target. Please make sure that all promissory notes are for the target specified on the previous window"""), QMessageBox.Ok) return self.promNotes.append(promnote) self.promIDSet.add(promnote.promID) self.cumulPay += promnote.dtxoTarget.value self.cumulFee += promnote.feeAmt self.lblCurrPay.setValueText(self.cumulPay, maxZeros=2, wBold=True) self.lblCurrFee.setValueText(self.cumulFee, maxZeros=2, wBold=True) self.updatePromTable() ############################################################################# def reduceScript(self, script): scrType = getTxOutScriptType(script) if scrType==CPP_TXOUT_MULTISIG: # This is already script = script_to_p2sh_script(script) return script_to_scrAddr(script) ############################################################################# def updatePromTable(self): if len(self.promNotes)==0: self.promLoadStacked.setCurrentIndex(0) else: self.promLoadStacked.setCurrentIndex(1) self.promModel.reset() ############################################################################# def mergeNotesCreateUSTX(self): if len(self.promNotes)==0: QMessageBox.warning(self, tr('Nothing Loaded'), tr(""" No promissory notes were loaded. Cannot create simulfunding transaction."""), QMessageBox.Ok) return if len(self.promNotes)==1: reply = QMessageBox.warning(self, tr('Merging One Note'), tr(""" Only one promissory note was entered, so there is nothing to merge.

The simulfunding interface is intended to merge promissory notes from multiple parties to ensure simultaneous funding for escrow. If only person is funding, they can simply send money to the address or lockbox like they would any other transaction, without going through the simulfunding interface.

Click "Ok" to continue to the multi-signing interface, but there will only be one input to sign."""), QMessageBox.Ok) if not reply==QMessageBox.Ok: return ustxiList = [] dtxoList = [] # We've already made sure all promNotes have the same target firstDtxo = self.promNotes[0].dtxoTarget dtxoTarget = DecoratedTxOut().unserialize(firstDtxo.serialize()) if self.chkBareMS.isChecked(): LOGINFO('Using bare-multisig') dtxoTarget.binScript = self.msTarget dtxoTarget.value = self.cumulPay dtxoList.append(dtxoTarget) for prom in self.promNotes: for ustxi in prom.ustxInputs: updUstxi = UnsignedTxInput().unserialize(ustxi.serialize()) updUstxi.contribID = prom.promID updUstxi.contribLabel = prom.promLabel ustxiList.append(updUstxi) if prom.dtxoChange: updDtxo = DecoratedTxOut().unserialize(prom.dtxoChange.serialize()) updDtxo.contribID = prom.promID dtxoList.append(updDtxo) ustx = UnsignedTransaction().createFromUnsignedTxIO(ustxiList, dtxoList) title = tr('Export Simulfunding Transaction') descr = tr(""" The text block below contains the simulfunding transaction to be signed by all parties funding this lockbox. Copy the text block into an email to all parties contributing funds. Each party can review the final simulfunding transaction, add their signature(s), then send back to you to finalize it.

When you click "Done", you will be taken to a window that you can use to merge the TXSIGCOLLECT blocks from all parties and broadcast the final transaction.""") ftypes = ['Signature Collectors (*.sigcollect.tx)'] defaultFN = 'Simulfund_%s.sigcollect.tx' % ustx.uniqueIDB58 self.accept() DlgMultiSpendReview(self, self.main, ustx).exec_() ################################################################################ class DlgSelectMultiSigOption(ArmoryDialog): ############################################################################# def __init__(self, parent, main): super(DlgSelectMultiSigOption, self).__init__(parent, main) self.btnCreate = QPushButton(tr('Create/Manage lockboxes')) #self.btnImport = QPushButton(tr('Import multi-sig lockbox')) self.btnFund = QPushButton(tr('Fund a lockbox')) self.btnSpend = QPushButton(tr('Spend from a lockbox')) lblDescr = QRichLabel(tr(""" Multi-Sig Lockboxes [EXPERIMENTAL]""") % htmlColor('TextBlue'), hAlign=Qt.AlignHCenter, doWrap=False) lblDescr2 = QRichLabel(tr(""" The buttons below link you to all the functionality needed to create, fund and spend from multi-sig "lockboxes." This includes turning multiple wallets into a multi-factor lock-box for your personal coins, or can be used for escrow between multiple parties, using the Bitcoin network itself to hold the escrow.

IMPORTANT: If you are using an lockbox that requires being funded by multiple parties simultaneously, you should not use regular transactions to do the funding. You should use the third button labeled "Fund a multi-sig lockbox" to collect funding promises into a single transaction, to limit the ability of any party to scam you. Read more about it by clicking [NO LINK YET] (if the above doesn't hold, you can use the regular "Send Bitcoins" dialog to fund the lockbox).""")) self.lblCreate = QRichLabel(tr(""" Collect public keys to create an "address" that can be used to send funds to the multi-sig container""")) #self.lblImport = QRichLabel(tr(""" #If someone has already created the lockbox you can add it #to your lockbox list""")) self.lblFund = QRichLabel(tr(""" Send money to an lockbox simultaneously with other parties involved in the lockbox""")) self.lblSpend = QRichLabel(tr(""" Collect signatures to authorize transferring money out of a multi-sig lockbox""")) self.connect(self.btnCreate, SIGNAL('clicked()'), self.openCreate) self.connect(self.btnFund, SIGNAL('clicked()'), self.openFund) self.connect(self.btnSpend, SIGNAL('clicked()'), self.openSpend) layoutTop = QVBoxLayout() layoutTop.addWidget(lblDescr) layoutTop.addWidget(HLINE()) layoutTop.addWidget(lblDescr2, 1) frmTop = QFrame() frmTop.setFrameStyle(STYLE_RAISED) frmTop.setLayout(layoutTop) layoutBottom = QGridLayout() layoutBottom.addItem(QSpacerItem(10,10), 0,0, 5,1) layoutBottom.addItem(QSpacerItem(10,10), 0,6, 5,1) layoutBottom.addItem(QSpacerItem(10,10), 0,1) layoutBottom.addItem(QSpacerItem(10,10), 2,1) layoutBottom.addItem(QSpacerItem(10,10), 4,1) layoutBottom.addWidget(self.btnCreate, 0,2) layoutBottom.addWidget(self.btnFund, 2,2) layoutBottom.addWidget(self.btnSpend, 4,2) layoutBottom.addItem(QSpacerItem(10,10), 0,3) layoutBottom.addItem(QSpacerItem(10,10), 2,3) layoutBottom.addItem(QSpacerItem(10,10), 4,3) layoutBottom.addWidget(self.lblCreate, 0,4) layoutBottom.addWidget(self.lblFund, 2,4) layoutBottom.addWidget(self.lblSpend, 4,4) layoutBottom.addItem(QSpacerItem(10,10), 0,5) layoutBottom.addItem(QSpacerItem(10,10), 2,5) layoutBottom.addItem(QSpacerItem(10,10), 4,5) layoutBottom.addWidget(HLINE(), 1,1, 1,4) layoutBottom.addWidget(HLINE(), 3,1, 1,4) layoutBottom.setColumnStretch(2, 1) layoutBottom.setColumnStretch(4, 2) frmBottom = QFrame() frmBottom.setFrameStyle(STYLE_RAISED) frmBottom.setLayout(layoutBottom) btnDone = QPushButton(tr("Done")) self.connect(btnDone, SIGNAL('clicked()'), self.accept) frmDone = makeHorizFrame(['Stretch', btnDone]) layoutMaster = QVBoxLayout() layoutMaster.addWidget(frmTop) layoutMaster.addWidget(frmBottom,1) layoutMaster.addWidget(frmDone) self.setMinimumWidth(550) self.setLayout(layoutMaster) self.setWindowTitle(tr('Multi-Sig Lockboxes')) ############################################################################# def openCreate(self): DlgLockboxEditor(self, self.main).exec_() ############################################################################# def openFund(self): DlgFundLockbox(self, self.main).exec_() ############################################################################# def openSpend(self): DlgSpendFromLockbox(self, self.main).exec_() # Get around circular dependencies from ui.WalletFrames import SelectWalletFrame armory-0.92.3/ui/__init__.py0000644000000000000000000000000012414772654014344 0ustar rootrootarmory-0.92.3/ui/WalletFrames.py0000644000000000000000000013437712414772654015224 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ from PyQt4.Qt import * #@UnusedWildImport from PyQt4.QtGui import * #@UnusedWildImport from armoryengine.BDM import TheBDM from qtdefines import * #@UnusedWildImport WALLET_DATA_ENTRY_FIELD_WIDTH = 60 class LockboxSelectFrame(ArmoryFrame): def __init__(self, parent, main, layoutDir=VERTICAL, spendFromLBID=None): super(LockboxSelectFrame, self).__init__(parent, main) self.lbox = self.main.getLockboxByID(spendFromLBID) self.cppWlt = self.main.cppLockboxWltMap[spendFromLBID] if not self.lbox: QMessageBox.warning(self, tr("Invalid Lockbox"), tr(""" There was an error loading the specified lockbox (%s).""") % spendFromLBID, QMessageBox.Ok) self.reject() return lblSpendFromLB = QRichLabel(tr(""" Lockbox %s (%d-of-%d)""") % (htmlColor('TextBlue'), \ self.lbox.uniqueIDB58, self.lbox.M, self.lbox.N)) lblSpendFromLB.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) lbls = [] lbls.append(QRichLabel("Lockbox ID:", doWrap=False)) lbls.append(QRichLabel("Name:", doWrap=False)) lbls.append(QRichLabel("Description:", doWrap=False)) lbls.append(QRichLabel("Spendable BTC:", doWrap=False)) layoutDetails = QGridLayout() for i,lbl in enumerate(lbls): lbl.setAlignment(Qt.AlignLeft | Qt.AlignTop) lbl.setText('' + str(lbls[i].text()) + '') layoutDetails.addWidget(lbl, i+1, 0) # LockboxID self.dispID = QRichLabel(spendFromLBID) # Lockbox Short Description/Name self.dispName = QRichLabel(self.lbox.shortName) self.dispName.setWordWrap(True) self.dispName.setSizePolicy(QSizePolicy.Preferred, QSizePolicy.Preferred) # Lockbox long descr dispDescr = self.lbox.longDescr[:253] if len(self.lbox.longDescr)>253: dispDescr += '...' self.dispDescr = QRichLabel(dispDescr) self.dispDescr.setWordWrap(True) self.dispDescr.setSizePolicy(QSizePolicy.Preferred, QSizePolicy.Preferred) bal = self.cppWlt.getSpendableBalance(self.main.currBlockNum, IGNOREZC) self.dispBal = QMoneyLabel(bal, wBold=True) self.dispBal.setTextFormat(Qt.RichText) layoutDetails.addWidget(self.dispID, 1, 1) layoutDetails.addWidget(self.dispName, 2, 1) layoutDetails.addWidget(self.dispDescr, 3, 1) layoutDetails.addWidget(self.dispBal, 4, 1) layoutDetails.setColumnStretch(0,0) layoutDetails.setColumnStretch(1,1) frmDetails = QFrame() frmDetails.setLayout(layoutDetails) frmDetails.setFrameStyle(STYLE_SUNKEN) layout = QVBoxLayout() layout.addWidget(lblSpendFromLB) layout.addWidget(frmDetails) self.setLayout(layout) # This class has all of the select wallet display and control functionality for # selecting a wallet, and doing coin control. It can be dropped into any dialog # and will interface with the dialog with select wlt and coin control callbacks. class SelectWalletFrame(ArmoryFrame): def __init__(self, parent, main, layoutDir=VERTICAL, firstSelect=None, onlyMyWallets=False, wltIDList=None, atLeast=0, selectWltCallback=None, coinControlCallback=None, onlyOfflineWallets=False): super(SelectWalletFrame, self).__init__(parent, main) self.coinControlCallback = coinControlCallback self.walletComboBox = QComboBox() self.walletListBox = QListWidget() self.balAtLeast = atLeast self.selectWltCallback = selectWltCallback self.doVerticalLayout = layoutDir==VERTICAL if self.main and len(self.main.walletMap) == 0: QMessageBox.critical(self, 'No Wallets!', \ 'There are no wallets to select from. Please create or import ' 'a wallet first.', QMessageBox.Ok) self.accept() return self.wltIDList = wltIDList if wltIDList else self.getWalletIdList(onlyOfflineWallets) selectedWltIndex = 0 self.selectedID = None wltItems = 0 self.displayIDs = [] if len(self.wltIDList) > 0: self.selectedID = self.wltIDList[0] for wltID in self.wltIDList: wlt = self.main.walletMap[wltID] wlttype = determineWalletType(wlt, self.main)[0] if onlyMyWallets and wlttype == WLTTYPES.WatchOnly: continue self.displayIDs.append(wltID) if self.doVerticalLayout: self.walletComboBox.addItem(wlt.labelName) else: self.walletListBox.addItem(QListWidgetItem(wlt.labelName)) if wltID == firstSelect: selectedWltIndex = wltItems self.selectedID = wltID wltItems += 1 if self.doVerticalLayout: self.walletComboBox.setCurrentIndex(selectedWltIndex) else: self.walletListBox.setCurrentRow(selectedWltIndex) self.connect(self.walletComboBox, SIGNAL('currentIndexChanged(int)'), self.updateOnWalletChange) self.connect(self.walletListBox, SIGNAL('currentRowChanged(int)'), self.updateOnWalletChange) # Start the layout layout = QVBoxLayout() lbls = [] lbls.append(QRichLabel("Wallet ID:", doWrap=False)) lbls.append(QRichLabel("Name:", doWrap=False)) lbls.append(QRichLabel("Description:", doWrap=False)) lbls.append(QRichLabel("Spendable BTC:", doWrap=False)) for i in range(len(lbls)): lbls[i].setAlignment(Qt.AlignLeft | Qt.AlignTop) lbls[i].setText('' + str(lbls[i].text()) + '') self.dispID = QRichLabel('') self.dispName = QRichLabel('') self.dispName.setWordWrap(True) # This line fixes squished text when word wrapping self.dispName.setSizePolicy(QSizePolicy.Preferred, QSizePolicy.Preferred) self.dispDescr = QRichLabel('') self.dispDescr.setWordWrap(True) # This line fixes squished text when word wrapping self.dispDescr.setSizePolicy(QSizePolicy.Preferred, QSizePolicy.Preferred) self.dispBal = QMoneyLabel(0) self.dispBal.setTextFormat(Qt.RichText) wltInfoFrame = QFrame() wltInfoFrame.setFrameStyle(STYLE_SUNKEN) wltInfoFrame.setSizePolicy(QSizePolicy.Preferred, QSizePolicy.Preferred) frmLayout = QGridLayout() for i in range(len(lbls)): frmLayout.addWidget(lbls[i], i, 0, 1, 1) self.dispID.setAlignment(Qt.AlignLeft | Qt.AlignTop) self.dispName.setAlignment(Qt.AlignLeft | Qt.AlignTop) self.dispDescr.setAlignment(Qt.AlignLeft | Qt.AlignTop) self.dispBal.setAlignment(Qt.AlignLeft | Qt.AlignTop) self.dispDescr.setMinimumWidth(tightSizeNChar(self.dispDescr, 30)[0]) frmLayout.addWidget(self.dispID, 0, 2, 1, 1) frmLayout.addWidget(self.dispName, 1, 2, 1, 1) frmLayout.addWidget(self.dispDescr, 2, 2, 1, 1) frmLayout.addWidget(self.dispBal, 3, 2, 1, 1) if coinControlCallback: self.lblCoinCtrl = QRichLabel('Source: All addresses', doWrap=False) frmLayout.addWidget(self.lblCoinCtrl, 4, 2, 1, 1) self.btnCoinCtrl = QPushButton('Coin Control') self.connect(self.btnCoinCtrl, SIGNAL(CLICKED), self.doCoinCtrl) frmLayout.addWidget(self.btnCoinCtrl, 4, 0, 1, 2) frmLayout.setColumnStretch(0, 1) frmLayout.setColumnStretch(1, 1) frmLayout.setColumnStretch(2, 1) frmLayout.addItem(QSpacerItem(20, 10, QSizePolicy.Fixed, QSizePolicy.Expanding), 0, 1, 4, 1) wltInfoFrame.setLayout(frmLayout) if self.doVerticalLayout: layout.addWidget(makeLayoutFrame(VERTICAL, [self.walletComboBox, wltInfoFrame]) ) else: layout.addWidget(makeLayoutFrame(HORIZONTAL, [self.walletListBox, wltInfoFrame]) ) self.setLayout(layout) # Make sure this is called once so that the default selection is displayed self.updateOnWalletChange() def getWalletIdList(self, onlyOfflineWallets): result = [] if onlyOfflineWallets: result = self.main.getWatchingOnlyWallets() else: result = list(self.main.walletIDList) return result def getSelectedWltID(self): idx = -1 if self.doVerticalLayout: idx = self.walletComboBox.currentIndex() else: idx = self.walletListBox.currentRow() return '' if idx<0 else self.displayIDs[idx] def doCoinCtrl(self): wlt = self.main.walletMap[self.getSelectedWltID()] dlgcc = DlgCoinControl(self, self.main, wlt, self.sourceAddrList) if dlgcc.exec_(): self.sourceAddrList = [x[0] for x in dlgcc.coinControlList] self.altBalance = sum([x[1] for x in dlgcc.coinControlList]) nAddr = len(self.sourceAddrList) if self.altBalance == wlt.getBalance('Spendable'): self.lblCoinCtrl.setText('Source: All addresses') self.sourceAddrList = None self.altBalance = None elif nAddr == 0: self.lblCoinCtrl.setText('Source: None selected') elif nAddr == 1: aStr = hash160_to_addrStr(self.sourceAddrList[0]) self.lblCoinCtrl.setText('Source: %s...' % aStr[:12]) elif nAddr > 1: self.lblCoinCtrl.setText('Source: %d addresses' % nAddr) self.updateOnCoinControl() def updateOnWalletChange(self, ignoredInt=None): """ "ignoredInt" is because the signals should call this function with the selected index of the relevant container, but we grab it again anyway using getSelectedWltID() """ wltID = self.getSelectedWltID() if len(wltID) > 0: wlt = self.main.walletMap[wltID] self.dispID.setText(wltID) self.dispName.setText(wlt.labelName) self.dispDescr.setText(wlt.labelDescr) self.selectedID = wltID if not TheBDM.getBDMState() == 'BlockchainReady': self.dispBal.setText('-' * 12) else: bal = wlt.getBalance('Spendable') balStr = coin2str(wlt.getBalance('Spendable'), maxZeros=1) if bal <= self.balAtLeast: self.dispBal.setText('%s' % balStr) else: self.dispBal.setText('' + balStr + '') if self.selectWltCallback: self.selectWltCallback(wlt) self.repaint() # Reset the coin control variables after a new wallet is selected if self.coinControlCallback: self.altBalance = None self.sourceAddrList = None self.btnCoinCtrl.setEnabled(wlt.getBalance('Spendable')>0) self.lblCoinCtrl.setText('Source: All addresses' if wlt.getBalance('Spendable')>0 else\ 'Source: 0 addresses' ) self.updateOnCoinControl() def updateOnCoinControl(self): useAllAddr = (self.altBalance == None) wlt = self.main.walletMap[self.getSelectedWltID()] fullBal = wlt.getBalance('Spendable') if useAllAddr: self.dispID.setText(wlt.uniqueIDB58) self.dispName.setText(wlt.labelName) self.dispDescr.setText(wlt.labelDescr) if fullBal == 0: self.dispBal.setText('0.0', color='TextRed', bold=True) else: self.dispBal.setValueText(fullBal, wBold=True) else: self.dispID.setText(wlt.uniqueIDB58 + '*') self.dispName.setText(wlt.labelName + '*') self.dispDescr.setText('*Coin Control Subset*', color='TextBlue', bold=True) self.dispBal.setText(coin2str(self.altBalance, maxZeros=0), color='TextBlue') rawValTxt = str(self.dispBal.text()) self.dispBal.setText(rawValTxt + ' (of %s)' % \ (htmlColor('DisableFG'), coin2str(fullBal, maxZeros=0))) if not TheBDM.getBDMState() == 'BlockchainReady': self.dispBal.setText('(available when online)', color='DisableFG') self.repaint() if self.coinControlCallback: self.coinControlCallback(self.sourceAddrList, self.altBalance) # Container for controls used in configuring a wallet to be added to any # dialog or wizard. Currently it is only used the create wallet wizard. # Just has Name and Description # Advanced options have just been moved to their own frame to be used in # the restore wallet dialog as well. class NewWalletFrame(ArmoryFrame): def __init__(self, parent, main, initLabel=''): super(NewWalletFrame, self).__init__(parent, main) self.editName = QLineEdit() self.editName.setMinimumWidth(tightSizeNChar(self.editName,\ WALLET_DATA_ENTRY_FIELD_WIDTH)[0]) self.editName.setText(initLabel) lblName = QLabel("Wallet &name:") lblName.setBuddy(self.editName) self.editDescription = QTextEdit() self.editDescription.setMaximumHeight(75) self.editDescription.setMinimumWidth(tightSizeNChar(self.editDescription,\ WALLET_DATA_ENTRY_FIELD_WIDTH)[0]) lblDescription = QLabel("Wallet &description:") lblDescription.setAlignment(Qt.AlignVCenter) lblDescription.setBuddy(self.editDescription) # breaking this up into tabs frameLayout = QVBoxLayout() newWalletTabs = QTabWidget() #### Basic Tab nameFrame = makeHorizFrame([lblName, STRETCH, self.editName]) descriptionFrame = makeHorizFrame([lblDescription, STRETCH, self.editDescription]) basicQTab = makeVertFrame([nameFrame, descriptionFrame, STRETCH]) newWalletTabs.addTab(basicQTab, "Configure") # Fork watching-only wallet self.advancedOptionsTab = AdvancedOptionsFrame(parent, main) newWalletTabs.addTab(self.advancedOptionsTab, "Advanced Options") frameLayout.addWidget(newWalletTabs) self.setLayout(frameLayout) # These help us collect entropy as the user goes through the wizard # to be used for wallet creation self.main.registerWidgetActivateTime(self) def getKdfSec(self): return self.advancedOptionsTab.getKdfSec() def getKdfBytes(self): return self.advancedOptionsTab.getKdfBytes() def getName(self): return str(self.editName.text()) def getDescription(self): return str(self.editDescription.toPlainText()) class AdvancedOptionsFrame(ArmoryFrame): def __init__(self, parent, main, initLabel=''): super(AdvancedOptionsFrame, self).__init__(parent, main) lblComputeDescription = QRichLabel( \ 'Armory will test your system\'s speed to determine the most ' 'challenging encryption settings that can be performed ' 'in a given amount of time. High settings make it much harder ' 'for someone to guess your passphrase. This is used for all ' 'encrypted wallets, but the default parameters can be changed below.\n') lblComputeDescription.setWordWrap(True) timeDescriptionTip = main.createToolTipWidget( \ 'This is the amount of time it will take for your computer ' 'to unlock your wallet after you enter your passphrase. ' '(the actual time used will be less than the specified ' 'time, but more than one half of it). ') # Set maximum compute time self.editComputeTime = QLineEdit() self.editComputeTime.setText('250 ms') self.editComputeTime.setMaxLength(12) lblComputeTime = QLabel('Target compute &time (s, ms):') memDescriptionTip = main.createToolTipWidget( \ 'This is the maximum memory that will be ' 'used as part of the encryption process. The actual value used ' 'may be lower, depending on your system\'s speed. If a ' 'low value is chosen, Armory will compensate by chaining ' 'together more calculations to meet the target time. High ' 'memory target will make GPU-acceleration useless for ' 'guessing your passphrase.') lblComputeTime.setBuddy(self.editComputeTime) # Set maximum memory usage self.editComputeMem = QLineEdit() self.editComputeMem.setText('32.0 MB') self.editComputeMem.setMaxLength(12) lblComputeMem = QLabel('Max &memory usage (kB, MB):') lblComputeMem.setBuddy(self.editComputeMem) self.editComputeTime.setMaximumWidth( tightSizeNChar(self, 20)[0] ) self.editComputeMem.setMaximumWidth( tightSizeNChar(self, 20)[0] ) entryFrame = QFrame() entryLayout = QGridLayout() entryLayout.addWidget(timeDescriptionTip, 0, 0, 1, 1) entryLayout.addWidget(lblComputeTime, 0, 1, 1, 1) entryLayout.addWidget(self.editComputeTime, 0, 2, 1, 1) entryLayout.addWidget(memDescriptionTip, 1, 0, 1, 1) entryLayout.addWidget(lblComputeMem, 1, 1, 1, 1) entryLayout.addWidget(self.editComputeMem, 1, 2, 1, 1) entryFrame.setLayout(entryLayout) layout = QVBoxLayout() layout.addWidget(lblComputeDescription) layout.addWidget(entryFrame) layout.addStretch() self.setLayout(layout) def getKdfSec(self): # return -1 if the input is invalid kdfSec = -1 try: kdfT, kdfUnit = str(self.editComputeTime.text()).strip().split(' ') if kdfUnit.lower() == 'ms': kdfSec = float(kdfT) / 1000. elif kdfUnit.lower() in ('s', 'sec', 'seconds'): kdfSec = float(kdfT) except: pass return kdfSec def getKdfBytes(self): # return -1 if the input is invalid kdfBytes = -1 try: kdfM, kdfUnit = str(self.editComputeMem.text()).split(' ') if kdfUnit.lower() == 'mb': kdfBytes = round(float(kdfM) * (1024.0 ** 2)) elif kdfUnit.lower() == 'kb': kdfBytes = round(float(kdfM) * (1024.0)) except: pass return kdfBytes class SetPassphraseFrame(ArmoryFrame): def __init__(self, parent, main, initLabel='', passphraseCallback=None): super(SetPassphraseFrame, self).__init__(parent, main) self.passphraseCallback = passphraseCallback layout = QGridLayout() lblDlgDescr = QLabel('Please enter a passphrase for wallet encryption.\n\n' 'A good passphrase consists of at least 10 or more\n' 'random letters, or 6 or more random words.\n') lblDlgDescr.setWordWrap(True) layout.addWidget(lblDlgDescr, 0, 0, 1, 2) lblPwd1 = QLabel("New Passphrase:") self.editPasswd1 = QLineEdit() self.editPasswd1.setEchoMode(QLineEdit.Password) self.editPasswd1.setMinimumWidth(MIN_PASSWD_WIDTH(self)) lblPwd2 = QLabel("Again:") self.editPasswd2 = QLineEdit() self.editPasswd2.setEchoMode(QLineEdit.Password) self.editPasswd2.setMinimumWidth(MIN_PASSWD_WIDTH(self)) layout.addWidget(lblPwd1, 1, 0) layout.addWidget(lblPwd2, 2, 0) layout.addWidget(self.editPasswd1, 1, 1) layout.addWidget(self.editPasswd2, 2, 1) self.lblMatches = QLabel(' ' * 20) self.lblMatches.setTextFormat(Qt.RichText) layout.addWidget(self.lblMatches, 3, 1) self.setLayout(layout) self.connect(self.editPasswd1, SIGNAL('textChanged(QString)'), \ self.checkPassphrase) self.connect(self.editPasswd2, SIGNAL('textChanged(QString)'), \ self.checkPassphrase) # These help us collect entropy as the user goes through the wizard # to be used for wallet creation self.main.registerWidgetActivateTime(self) # This function is multi purpose. It updates the screen and validates the passphrase def checkPassphrase(self, sideEffects=True): result = True p1 = self.editPasswd1.text() p2 = self.editPasswd2.text() goodColor = htmlColor('TextGreen') badColor = htmlColor('TextRed') if not isASCII(unicode(p1)) or \ not isASCII(unicode(p2)): if sideEffects: self.lblMatches.setText('Passphrase is non-ASCII!' % badColor) result = False elif not p1 == p2: if sideEffects: self.lblMatches.setText('Passphrases do not match!' % badColor) result = False elif len(p1) < 5: if sideEffects: self.lblMatches.setText('Passphrase is too short!' % badColor) result = False if sideEffects: if result: self.lblMatches.setText('Passphrases match!' % goodColor) if self.passphraseCallback: self.passphraseCallback() return result def getPassphrase(self): return str(self.editPasswd1.text()) class VerifyPassphraseFrame(ArmoryFrame): def __init__(self, parent, main, initLabel=''): super(VerifyPassphraseFrame, self).__init__(parent, main) lblWarnImgL = QLabel() lblWarnImgL.setPixmap(QPixmap(':/MsgBox_warning48.png')) lblWarnImgL.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) lblWarnTxt1 = QRichLabel(\ '!!! DO NOT FORGET YOUR PASSPHRASE !!!', size=4) lblWarnTxt1.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) lblWarnTxt2 = QRichLabel(\ 'No one can help you recover you bitcoins if you forget the ' 'passphrase and don\'t have a paper backup! Your wallet and ' 'any digital backups are useless if you forget it. ' '

' 'A paper backup protects your wallet forever, against ' 'hard-drive loss and losing your passphrase. It also protects you ' 'from theft, if the wallet was encrypted and the paper backup ' 'was not stolen with it. Please make a paper backup and keep it in ' 'a safe place.' '

' 'Please enter your passphrase a third time to indicate that you ' 'are aware of the risks of losing your passphrase!', doWrap=True) self.edtPasswd3 = QLineEdit() self.edtPasswd3.setEchoMode(QLineEdit.Password) self.edtPasswd3.setMinimumWidth(MIN_PASSWD_WIDTH(self)) layout = QGridLayout() layout.addWidget(lblWarnImgL, 0, 0, 4, 1) layout.addWidget(lblWarnTxt1, 0, 1, 1, 1) layout.addWidget(lblWarnTxt2, 2, 1, 1, 1) layout.addWidget(self.edtPasswd3, 5, 1, 1, 1) self.setLayout(layout) # These help us collect entropy as the user goes through the wizard # to be used for wallet creation self.main.registerWidgetActivateTime(self) class WalletBackupFrame(ArmoryFrame): # Some static enums, and a QRadioButton with mouse-enter/mouse-leave events FEATURES = enum('ProtGen', 'ProtImport', 'LostPass', 'Durable', \ 'Visual', 'Physical', 'Count') OPTIONS = enum('Paper1', 'PaperN', 'DigPlain', 'DigCrypt', 'Export', 'Count') def __init__(self, parent, main, initLabel=''): super(WalletBackupFrame, self).__init__(parent, main) # Don't have a wallet yet so assume false. self.hasImportedAddr = False self.isBackupCreated = False self.passphrase = None self.lblTitle = QRichLabel(tr("Backup Options")) lblTitleDescr = QRichLabel(tr(""" Armory wallets only need to be backed up one time, ever. The backup is good no matter how many addresses you use. """)) lblTitleDescr.setOpenExternalLinks(True) self.optPaperBackupTop = QRadioButtonBackupCtr(self, \ tr('Printable Paper Backup'), self.OPTIONS.Paper1) self.optPaperBackupOne = QRadioButtonBackupCtr(self, \ tr('Single-Sheet (Recommended)'), self.OPTIONS.Paper1) self.optPaperBackupFrag = QRadioButtonBackupCtr(self, \ tr('Fragmented Backup (M-of-N)'), self.OPTIONS.PaperN) self.optDigitalBackupTop = QRadioButtonBackupCtr(self, \ tr('Digital Backup'), self.OPTIONS.DigPlain) self.optDigitalBackupPlain = QRadioButtonBackupCtr(self, \ tr('Unencrypted'), self.OPTIONS.DigPlain) self.optDigitalBackupCrypt = QRadioButtonBackupCtr(self, \ tr('Encrypted'), self.OPTIONS.DigCrypt) self.optIndivKeyListTop = QRadioButtonBackupCtr(self, \ tr('Export Key Lists'), self.OPTIONS.Export) self.optPaperBackupTop.setFont(GETFONT('Var', bold=True)) self.optDigitalBackupTop.setFont(GETFONT('Var', bold=True)) self.optIndivKeyListTop.setFont(GETFONT('Var', bold=True)) # I need to be able to unset the sub-options when they become disabled self.optPaperBackupNONE = QRadioButton('') self.optDigitalBackupNONE = QRadioButton('') btngrpTop = QButtonGroup(self) btngrpTop.addButton(self.optPaperBackupTop) btngrpTop.addButton(self.optDigitalBackupTop) btngrpTop.addButton(self.optIndivKeyListTop) btngrpTop.setExclusive(True) btngrpPaper = QButtonGroup(self) btngrpPaper.addButton(self.optPaperBackupNONE) btngrpPaper.addButton(self.optPaperBackupOne) btngrpPaper.addButton(self.optPaperBackupFrag) btngrpPaper.setExclusive(True) btngrpDig = QButtonGroup(self) btngrpDig.addButton(self.optDigitalBackupNONE) btngrpDig.addButton(self.optDigitalBackupPlain) btngrpDig.addButton(self.optDigitalBackupCrypt) btngrpDig.setExclusive(True) self.connect(self.optPaperBackupTop, SIGNAL(CLICKED), self.optionClicked) self.connect(self.optPaperBackupOne, SIGNAL(CLICKED), self.optionClicked) self.connect(self.optPaperBackupFrag, SIGNAL(CLICKED), self.optionClicked) self.connect(self.optDigitalBackupTop, SIGNAL(CLICKED), self.optionClicked) self.connect(self.optDigitalBackupPlain, SIGNAL(CLICKED), self.optionClicked) self.connect(self.optDigitalBackupCrypt, SIGNAL(CLICKED), self.optionClicked) self.connect(self.optIndivKeyListTop, SIGNAL(CLICKED), self.optionClicked) spacer = lambda: QSpacerItem(20, 1, QSizePolicy.Fixed, QSizePolicy.Expanding) layoutOpts = QGridLayout() layoutOpts.addWidget(self.optPaperBackupTop, 0, 0, 1, 2) layoutOpts.addItem(spacer(), 1, 0) layoutOpts.addItem(spacer(), 2, 0) layoutOpts.addWidget(self.optDigitalBackupTop, 3, 0, 1, 2) layoutOpts.addItem(spacer(), 4, 0) layoutOpts.addItem(spacer(), 5, 0) layoutOpts.addWidget(self.optIndivKeyListTop, 6, 0, 1, 2) layoutOpts.addWidget(self.optPaperBackupOne, 1, 1) layoutOpts.addWidget(self.optPaperBackupFrag, 2, 1) layoutOpts.addWidget(self.optDigitalBackupPlain, 4, 1) layoutOpts.addWidget(self.optDigitalBackupCrypt, 5, 1) layoutOpts.setColumnStretch(0, 0) layoutOpts.setColumnStretch(1, 1) frmOpts = QFrame() frmOpts.setLayout(layoutOpts) frmOpts.setFrameStyle(STYLE_SUNKEN) self.featuresTips = [None] * self.FEATURES.Count self.featuresLbls = [None] * self.FEATURES.Count self.featuresImgs = [None] * self.FEATURES.Count F = self.FEATURES self.featuresTips[F.ProtGen] = self.main.createToolTipWidget(tr(""" Every time you click "Receive Bitcoins," a new address is generated. All of these addresses are generated from a single seed value, which is included in all backups. Therefore, all addresses that you have generated so far and will ever be generated with this wallet, are protected by this backup! """)) self.featuresTips[F.ProtImport] = self.main.createToolTipWidget(tr(""" This wallet does not currently have any imported addresses, so you can safely ignore this feature! When imported addresses are present, backups only protects those imported before the backup was made. You must replace that backup if you import more addresses! """)) self.featuresTips[F.LostPass] = self.main.createToolTipWidget(tr(""" Lost/forgotten passphrases are, by far, the most common reason for users losing bitcoins. It is critical you have at least one backup that works if you forget your wallet passphrase. """)) self.featuresTips[F.Durable] = self.main.createToolTipWidget(tr(""" USB drives and CD/DVD disks are not intended for long-term storage. They will probably last many years, but not guaranteed even for 3-5 years. On the other hand, printed text on paper will last many decades, and useful even when thoroughly faded. """)) self.featuresTips[F.Visual] = self.main.createToolTipWidget(tr(""" The ability to look at a backup and determine if it is still usable. If a digital backup is stored in a safe deposit box, you have no way to verify its integrity unless you take a secure computer/device with you. A simple glance at a paper backup is enough to verify that it is still intact. """)) self.featuresTips[F.Physical] = self.main.createToolTipWidget(tr(""" If multiple pieces/fragments are required to restore this wallet. For instance, encrypted backups require the backup and the passphrase. This feature is only needed for those concerned about physical security, not just online security.""")) MkFeatLabel = lambda x: QRichLabel(tr(x), doWrap=False) self.featuresLbls[F.ProtGen] = MkFeatLabel('Protects All Future Addresses') self.featuresLbls[F.ProtImport] = MkFeatLabel('Protects Imported Addresses') self.featuresLbls[F.LostPass] = MkFeatLabel('Forgotten Passphrase') self.featuresLbls[F.Durable] = MkFeatLabel('Long-term Durability') self.featuresLbls[F.Visual] = MkFeatLabel('Visual Integrity') self.featuresLbls[F.Physical] = MkFeatLabel('Multi-Point Protection') if not self.hasImportedAddr: self.featuresLbls[F.ProtImport].setEnabled(False) self.lblSelFeat = QRichLabel('', doWrap=False, hAlign=Qt.AlignHCenter) layoutFeat = QGridLayout() layoutFeat.addWidget(self.lblSelFeat, 0, 0, 1, 3) layoutFeat.addWidget(HLINE(), 1, 0, 1, 3) for i in range(self.FEATURES.Count): self.featuresImgs[i] = QLabel('') layoutFeat.addWidget(self.featuresTips[i], i + 2, 0) layoutFeat.addWidget(self.featuresLbls[i], i + 2, 1) layoutFeat.addWidget(self.featuresImgs[i], i + 2, 2) layoutFeat.setColumnStretch(0, 0) layoutFeat.setColumnStretch(1, 1) layoutFeat.setColumnStretch(2, 0) frmFeat = QFrame() frmFeat.setLayout(layoutFeat) frmFeat.setFrameStyle(STYLE_SUNKEN) self.lblDescrSelected = QRichLabel('') frmFeatDescr = makeVertFrame([self.lblDescrSelected]) self.lblDescrSelected.setMinimumHeight(tightSizeNChar(self, 10)[1] * 8) self.btnDoIt = QPushButton('Create Backup') self.connect(self.btnDoIt, SIGNAL(CLICKED), self.clickedDoIt) layout = QGridLayout() layout.addWidget(self.lblTitle, 0, 0, 1, 2) layout.addWidget(lblTitleDescr, 1, 0, 1, 2) layout.addWidget(frmOpts, 2, 0) layout.addWidget(frmFeat, 2, 1) layout.addWidget(frmFeatDescr, 3, 0, 1, 2) layout.addWidget(self.btnDoIt, 4, 0, 1, 2) layout.setRowStretch(0, 0) layout.setRowStretch(1, 0) layout.setRowStretch(2, 0) layout.setRowStretch(3, 1) layout.setRowStretch(4, 0) self.setLayout(layout) self.setMinimumSize(640, 350) self.optPaperBackupTop.setChecked(True) self.optPaperBackupOne.setChecked(True) self.setDispFrame(-1) self.optionClicked() ############################################################################# def setWallet(self, wlt): self.wlt = wlt wltID = wlt.uniqueIDB58 wltName = wlt.labelName self.hasImportedAddr = self.wlt.hasAnyImported() # Highlight imported-addr feature if their wallet contains them pcolor = 'TextWarn' if self.hasImportedAddr else 'DisableFG' self.featuresLbls[self.FEATURES.ProtImport].setText(tr(\ 'Protects Imported Addresses'), color=pcolor) if self.hasImportedAddr: self.featuresTips[self.FEATURES.ProtImport].setText(tr(""" When imported addresses are present, backups only protects those imported before the backup was made! You must replace that backup if you import more addresses! Your wallet does contain imported addresses.""")) self.lblTitle.setText(tr(""" Backup Options for Wallet "%s" (%s)""" % (wltName, wltID))) ############################################################################# def setDispFrame(self, index): if index < 0: self.setDispFrame(self.getIndexChecked()) else: # Highlight imported-addr feature if their wallet contains them pcolor = 'TextWarn' if self.hasImportedAddr else 'DisableFG' self.featuresLbls[self.FEATURES.ProtImport].setText(tr(\ 'Protects Imported Addresses'), color=pcolor) txtPaper = tr(""" Paper backups protect every address ever generated by your wallet. It is unencrypted, which means it needs to be stored in a secure place, but it will help you recover your wallet if you forget your encryption passphrase!

You don't need a printer to make a paper backup! The data can be copied by hand with pen and paper. Paper backups are preferred to digital backups, because you know the paper backup will work no matter how many years (or decades) it sits in storage. """) txtDigital = tr(""" Digital backups can be saved to an external hard-drive or USB removable media. It is recommended you make a few copies to protect against "bit rot" (degradation).

""") txtDigPlain = tr(""" IMPORTANT: Do not save an unencrypted digital backup to your primary hard drive! Please save it directly to the backup device. Deleting the file does not guarantee the data is actually gone! """) txtDigCrypt = tr(""" IMPORTANT: It is critical that you have at least one unencrypted backup! Without it, your bitcoins will be lost forever if you forget your passphrase! This is by far the most common reason users lose coins! Having at least one paper backup is recommended.""") txtIndivKeys = tr(""" View and export invidivual addresses strings, public keys and/or private keys contained in your wallet. This is useful for exporting your private keys to be imported into another wallet app or service.

You can view/backup imported keys, as well as unused keys in your keypool (pregenerated addresses protected by your backup that have not yet been used). """) chk = lambda: QPixmap(':/checkmark32.png').scaled(20, 20) _X_ = lambda: QPixmap(':/red_X.png').scaled(16, 16) if index == self.OPTIONS.Paper1: self.lblSelFeat.setText(tr('Single-Sheet Paper Backup'), bold=True) self.featuresImgs[self.FEATURES.ProtGen ].setPixmap(chk()) self.featuresImgs[self.FEATURES.ProtImport].setPixmap(chk()) self.featuresImgs[self.FEATURES.LostPass ].setPixmap(chk()) self.featuresImgs[self.FEATURES.Durable ].setPixmap(chk()) self.featuresImgs[self.FEATURES.Visual ].setPixmap(chk()) self.featuresImgs[self.FEATURES.Physical ].setPixmap(_X_()) self.lblDescrSelected.setText(txtPaper) elif index == self.OPTIONS.PaperN: self.lblSelFeat.setText(tr('Fragmented Paper Backup'), bold=True) self.featuresImgs[self.FEATURES.ProtGen ].setPixmap(chk()) self.featuresImgs[self.FEATURES.ProtImport].setPixmap(_X_()) self.featuresImgs[self.FEATURES.LostPass ].setPixmap(chk()) self.featuresImgs[self.FEATURES.Durable ].setPixmap(chk()) self.featuresImgs[self.FEATURES.Visual ].setPixmap(chk()) self.featuresImgs[self.FEATURES.Physical ].setPixmap(chk()) self.lblDescrSelected.setText(txtPaper) elif index == self.OPTIONS.DigPlain: self.lblSelFeat.setText(tr('Unencrypted Digital Backup'), bold=True) self.featuresImgs[self.FEATURES.ProtGen ].setPixmap(chk()) self.featuresImgs[self.FEATURES.ProtImport].setPixmap(chk()) self.featuresImgs[self.FEATURES.LostPass ].setPixmap(chk()) self.featuresImgs[self.FEATURES.Durable ].setPixmap(_X_()) self.featuresImgs[self.FEATURES.Visual ].setPixmap(_X_()) self.featuresImgs[self.FEATURES.Physical ].setPixmap(_X_()) self.lblDescrSelected.setText(txtDigital + txtDigPlain) elif index == self.OPTIONS.DigCrypt: self.lblSelFeat.setText(tr('Encrypted Digital Backup'), bold=True) self.featuresImgs[self.FEATURES.ProtGen ].setPixmap(chk()) self.featuresImgs[self.FEATURES.ProtImport].setPixmap(chk()) self.featuresImgs[self.FEATURES.LostPass ].setPixmap(_X_()) self.featuresImgs[self.FEATURES.Durable ].setPixmap(_X_()) self.featuresImgs[self.FEATURES.Visual ].setPixmap(_X_()) self.featuresImgs[self.FEATURES.Physical ].setPixmap(chk()) self.lblDescrSelected.setText(txtDigital + txtDigCrypt) elif index == self.OPTIONS.Export: self.lblSelFeat.setText(tr('Export Key Lists'), bold=True) self.featuresImgs[self.FEATURES.ProtGen ].setPixmap(chk()) self.featuresImgs[self.FEATURES.ProtImport].setPixmap(chk()) self.featuresImgs[self.FEATURES.LostPass ].setPixmap(chk()) self.featuresImgs[self.FEATURES.Durable ].setPixmap(_X_()) self.featuresImgs[self.FEATURES.Visual ].setPixmap(_X_()) self.featuresImgs[self.FEATURES.Physical ].setPixmap(_X_()) self.lblDescrSelected.setText(txtIndivKeys) else: LOGERROR('What index was sent to setDispFrame? %d', index) ############################################################################# def getIndexChecked(self): if self.optPaperBackupOne.isChecked(): return self.OPTIONS.Paper1 elif self.optPaperBackupFrag.isChecked(): return self.OPTIONS.PaperN elif self.optPaperBackupTop.isChecked(): return self.OPTIONS.Paper1 elif self.optDigitalBackupPlain.isChecked(): return self.OPTIONS.DigPlain elif self.optDigitalBackupCrypt.isChecked(): return self.OPTIONS.DigCrypt elif self.optDigitalBackupTop.isChecked(): return self.OPTIONS.DigPlain elif self.optIndivKeyListTop.isChecked(): return self.OPTIONS.Export else: return 0 ############################################################################# def optionClicked(self): if self.optPaperBackupTop.isChecked(): self.optPaperBackupOne.setEnabled(True) self.optPaperBackupFrag.setEnabled(True) self.optDigitalBackupPlain.setEnabled(False) self.optDigitalBackupCrypt.setEnabled(False) self.optDigitalBackupPlain.setChecked(False) self.optDigitalBackupCrypt.setChecked(False) self.optDigitalBackupNONE.setChecked(True) self.btnDoIt.setText(tr('Create Paper Backup')) elif self.optDigitalBackupTop.isChecked(): self.optDigitalBackupPlain.setEnabled(True) self.optDigitalBackupCrypt.setEnabled(True) self.optPaperBackupOne.setEnabled(False) self.optPaperBackupFrag.setEnabled(False) self.optPaperBackupOne.setChecked(False) self.optPaperBackupFrag.setChecked(False) self.optPaperBackupNONE.setChecked(True) self.btnDoIt.setText(tr('Create Digital Backup')) elif self.optIndivKeyListTop.isChecked(): self.optPaperBackupOne.setEnabled(False) self.optPaperBackupFrag.setEnabled(False) self.optPaperBackupOne.setChecked(False) self.optPaperBackupFrag.setChecked(False) self.optDigitalBackupPlain.setEnabled(False) self.optDigitalBackupCrypt.setEnabled(False) self.optDigitalBackupPlain.setChecked(False) self.optDigitalBackupCrypt.setChecked(False) self.optDigitalBackupNONE.setChecked(True) self.optPaperBackupNONE.setChecked(True) self.btnDoIt.setText(tr('Export Key Lists')) self.setDispFrame(-1) def setPassphrase(self, passphrase): self.passphrase = passphrase def clickedDoIt(self): isBackupCreated = False if self.passphrase: from qtdialogs import DlgProgress unlockProgress = DlgProgress(self, self.main, HBar=1, Title="Unlocking Wallet") unlockProgress.exec_(self.wlt.unlock, securePassphrase=SecureBinaryData( \ self.passphrase), Progress=unlockProgress.UpdateHBar) if self.optPaperBackupOne.isChecked(): isBackupCreated = OpenPaperBackupWindow('Single', self.parent(), self.main, self.wlt) elif self.optPaperBackupFrag.isChecked(): isBackupCreated = OpenPaperBackupWindow('Frag', self.parent(), self.main, self.wlt) elif self.optDigitalBackupPlain.isChecked(): if self.main.digitalBackupWarning(): isBackupCreated = self.main.makeWalletCopy(self, self.wlt, 'Decrypt', 'decrypt') elif self.optDigitalBackupCrypt.isChecked(): isBackupCreated = self.main.makeWalletCopy(self, self.wlt, 'Encrypt', 'encrypt') elif self.optIndivKeyListTop.isChecked(): if self.wlt.useEncryption and self.wlt.isLocked: dlg = DlgUnlockWallet(self.wlt, self, self.main, 'Unlock Private Keys') if not dlg.exec_(): if self.main.usermode == USERMODE.Expert: QMessageBox.warning(self, tr('Unlock Failed'), tr(""" Wallet was not be unlocked. The public keys and addresses will still be shown, but private keys will not be available unless you reopen the dialog with the correct passphrase."""), \ QMessageBox.Ok) else: QMessageBox.warning(self, tr('Unlock Failed'), tr(""" 'Wallet could not be unlocked to display individual keys."""), \ QMessageBox.Ok) if self.main.usermode == USERMODE.Standard: return DlgShowKeyList(self.wlt, self.parent(), self.main).exec_() isBackupCreated = True if isBackupCreated: self.isBackupCreated = True class WizardCreateWatchingOnlyWalletFrame(ArmoryFrame): def __init__(self, parent, main, initLabel='', backupCreatedCallback=None): super(WizardCreateWatchingOnlyWalletFrame, self).__init__(parent, main) summaryText = QRichLabel(tr(""" Your wallet has been created and is ready to be used. It will appear in the "Available Wallets" list in the main window. You may click "Finish" if you do not plan to use this wallet on any other computer.

A watching-only wallet behaves exactly like a a regular wallet, but does not contain any signing keys. You can generate addresses and confirm receipt of payments, but not spend or move the funds in the wallet. To move the funds, use the "Offline Transactions" button on the main window for directions (which involves bringing the transaction to this computer for a signature). Or you can give the watching-only wallet to someone who needs to monitor the wallet but should not be able to move the money.

Click the button to save a watching-only copy of this wallet. Use the "Import or Restore Wallet" button in the upper-right corner""")) lbtnForkWlt = QPushButton('Create Watching-Only Copy') self.connect(lbtnForkWlt, SIGNAL(CLICKED), self.forkOnlineWallet) layout = QVBoxLayout() layout.addWidget(summaryText) layout.addWidget(lbtnForkWlt) self.setLayout(layout) def forkOnlineWallet(self): currPath = self.wlt.walletPath pieces = os.path.splitext(currPath) currPath = pieces[0] + '.watchonly' + pieces[1] saveLoc = self.main.getFileSave('Save Watching-Only Copy', \ defaultFilename=currPath) if not saveLoc.endswith('.wallet'): saveLoc += '.wallet' self.wlt.forkOnlineWallet(saveLoc, self.wlt.labelName, \ '(Watching-Only) ' + self.wlt.labelDescr) def setWallet(self, wlt): self.wlt = wlt # Need to put circular imports at the end of the script to avoid an import deadlock from qtdialogs import CLICKED, DlgCoinControl, STRETCH, MIN_PASSWD_WIDTH, \ QRadioButtonBackupCtr, OpenPaperBackupWindow, DlgUnlockWallet, DlgShowKeyList armory-0.92.3/ui/UpgradeDownloader.py0000644000000000000000000007071412414772654016236 0ustar rootrootfrom PyQt4.Qt import * from PyQt4.QtGui import * from PyQt4.QtNetwork import * from qtdefines import * from armoryengine.parseAnnounce import * class UpgradeDownloader: def __init__(self, parent, main): self.finishedCB = lambda : None self.startedCB = lambda : None self.url = None self.filesha = None self.downloadFile = None self.progressBar = None self.frame = None self.parent = parent self.main = main self.packageName = '' self.networkAccess = QNetworkAccessManager() # downloadLinkFile def setFile(self, url, filehash): self.url = url self.filesha = filehash if self.downloadButton: if url and not self.downloadFile: self.downloadButton.setEnabled(True) else: self.downloadButton.setEnabled(False) def useDownloadLinkFileAndSignature(self, linkfile): self.downloadLinkFile = linkfile def setFinishedCallback(self, callback): self.finishedCB = callback def setStartedCallback(self, callback): self.startedCB = callback def setPackageName(self, pkgName): self.packageName = pkgName def createDownloaderWidget(self, parent): if self.frame: raise RuntimeError("already created a downloader widget") self.frame = QWidget(parent) bottomRowLayout = QHBoxLayout(self.frame) self.progressBar = QProgressBar(self.frame) bottomRowLayout.addWidget(self.progressBar, +1) self.downloadButton = QPushButton(tr("Download"), self.frame) self.frame.connect(self.downloadButton, SIGNAL('clicked()'), \ self.startOrStopDownload) bottomRowLayout.addWidget(self.downloadButton) return self.frame def startOrStopDownload(self): if self.downloadFile: o = self.downloadFile self.downloadFile = None o.close() else: self.startDownload() def startDownload(self): req = QNetworkRequest(QUrl.fromEncoded(self.url)) self.receivedData = "" self.downloadFile = self.networkAccess.get(req) QObject.connect(self.downloadFile, SIGNAL('readyRead()'), self.readMoreDownloadData) QObject.connect(self.downloadFile, SIGNAL('finished()'), self.downloadFinished) if not self.downloadButton is None: self.downloadButton.setText(tr("Cancel")) self.progressTimer() self.startedCB() ############################################################################# def downloadFinished(self): if not self.downloadButton is None: self.downloadButton.setText(tr("Download")) # We will ask the user if they want us to unpack it for them # Only if linux, only if satoshi, only if not offline-pkg-signed linuxUnpackFile = None # downloadFile will be removed on cancel if not self.downloadFile is None: status = self.downloadFile.attribute(QNetworkRequest.HttpStatusCodeAttribute).toInt()[0] if len(self.receivedData)==0: if status == 404: status = tr("File not found") QMessageBox.warning(self.frame, tr("Download failed"), \ tr("There was a failure downloading this file: {}").format(str(status))) else: res = binary_to_hex(sha256(self.receivedData)) LOGINFO("Downloaded package has hash " + res) if res != self.filesha: QMessageBox.warning(self.frame, tr("Verification failed"), tr(""" The download completed but its cryptographic signature is invalid. Please try the download again. If you get another error, please report the problem to support@bitcoinarmory.com.

The downloaded data has been discarded. """)) else: defaultFN = os.path.basename(self.url) if self.downloadLinkFile: defaultFN += ".signed" dest = self.main.getFileSave(tr("Save File"), [tr('Installers (*.exe, *.app, *.deb, *.tar.gz)')], defaultFilename=defaultFN) if len(dest)!=0: df = open(dest, "wb") if self.downloadLinkFile: df.write("START_OF_SIGNATURE_SECTION") df.write(self.downloadLinkFile) df.write("END_OF_SIGNATURE_SECTION") df.write(self.receivedData) df.close() if self.downloadLinkFile: QMessageBox.warning(self.frame, tr("Download complete"), tr(""" The package has the signature from Armory Technologies, Inc. bundled with it, so it can be verified by an offline computer before installation. To use this feature, the offline system must be running Armory 0.91-beta or higher. Go to "Help"\xe2\x86\x92"Verify Signed Package" and load the *.signed file. The file was saved to:

%s

There is no special procedure to update a previous installation. The installer will update existing versions without touching your wallets or settings.""") % \ (htmlColor("TextGreen"), dest), \ QMessageBox.Ok) else: if OS_LINUX and \ self.packageName=='Satoshi' and \ dest.endswith('tar.gz'): linuxUnpackFile = dest else: QMessageBox.warning(self.frame, tr("Download complete"), tr(""" The file downloaded successfully, and carries a valid signature from Armory Technologies, Inc. You can now use it to install the software. The file was saved to:

%s

There is no special procedure to update a previous installation. The installer will update existing versions without touching your wallets or settings.""") % \ (htmlColor("TextGreen"), dest), QMessageBox.Ok) if linuxUnpackFile is not None: reply = QMessageBox.warning(self.frame, tr('Unpack Download'), tr(""" You just downloaded the Bitcoin Core software for Linux. Would you like Armory to extract it for you and adjust your settings to use it automatically?

If you modified your settings to run Bitcoin Core manually, click "No" then extract the downloaded file and manually start bitcoin-qt or bitcoind in from the extracted "bin/%d" directory.""") % (64 if SystemSpecs.IsX64 else 32), \ QMessageBox.Yes | QMessageBox.No) if reply==QMessageBox.Yes: finalDir = self.main.unpackLinuxTarGz(dest, changeSettings=True) if finalDir is None: QMessageBox.critical(self.frame, tr('Error Unpacking'), tr(""" There was an error unpacking the Bitcoin Core file. To use it, you need to go to where the file was saved, right-click on it and select "Extract Here", then adjust your settings ("File"\xe2\x86\x92"Settings" from the main window) to point "Bitcoin Install Dir" to the extracted directory.

You saved the installer to:

%s""") % dest, QMessageBox.Ok) else: QMessageBox.warning(self.frame, tr('Finished!'), tr(""" The operation was successful. Restart Armory to use the newly-downloaded Bitcoin Core software"""), QMessageBox.Ok) self.receivedData = None self.downloadFile = None self.downloadButton.setEnabled(True) self.progressBar.setFormat("") if self.finishedCB: self.finishedCB() def readMoreDownloadData(self): if not self.receivedData is None: self.receivedData = self.receivedData + self.downloadFile.readAll() def progressTimer(self): if not self.downloadFile: self.progressBar.reset() self.progressBar.setRange(0, 100) self.progressBar.setValue(0) return size = self.downloadFile.header(QNetworkRequest.ContentLengthHeader).toInt()[0] self.progressBar.setRange(0, size) self.progressBar.setValue(len(self.receivedData)) totalStr = bytesToHumanSize(size) sofarStr = bytesToHumanSize(len(self.receivedData)) s = tr("{0} / {1} downloaded").format(sofarStr, totalStr) self.progressBar.setFormat(s) QTimer.singleShot(250, self.progressTimer) class UpgradeDownloaderDialog(ArmoryDialog): # parent: QWidget # showPackage: automatically select this package name, if available, for the current OS # downloadText: the text *WITH SIGNATURE* of the downloaded text data # changeLog: the text of the downloaded changelogs def __init__(self, parent, main, showPackage, downloadText, changeLog): super(UpgradeDownloaderDialog, self).__init__(parent, main) self.downloader = UpgradeDownloader(parent, main) self.bitsColor = htmlColor('Foreground') def enableOrDisable(e): self.os.setEnabled(e) self.osver.setEnabled(e) self.osarch.setEnabled(e) self.packages.setEnabled(e) self.closeButton.setEnabled(e) self.downloader.setFinishedCallback(lambda : enableOrDisable(True)) def onStart(): enableOrDisable(False) downloadText=None if self.saveAsOfflinePackage.isChecked(): downloadText = self.downloadText self.downloader.useDownloadLinkFileAndSignature(downloadText) self.downloader.setStartedCallback(onStart) self.downloadText = downloadText self.nestedDownloadMap = downloadLinkParser(filetext=downloadText).downloadMap self.changelog = changelogParser().parseChangelogText(changeLog) self.localizedData = { \ "Ubuntu" : tr("Ubuntu/Debian"), \ "Windows" : tr("Windows"), \ "MacOSX" : tr("MacOSX"), \ "32" : tr("32-bit"), \ "64" : tr("64-bit"), \ "Satoshi" : tr("Bitcoin Core"), \ "ArmoryTesting" : tr("Armory Testing (unstable)"), \ "ArmoryOffline" : tr("Offline Armory Wallet") \ } oslabel = QLabel(tr("OS:"), self) self.os = QComboBox(self) self.osver = QComboBox(self) self.osarch = QComboBox(self) packages = QTreeWidget(self) self.packages = packages packages.setRootIsDecorated(False) packages.sortByColumn(0, Qt.AscendingOrder) packages.setSortingEnabled(True) headerItem = QTreeWidgetItem() headerItem.setText(0,tr("Package")) headerItem.setText(1,tr("Version")) packages.setHeaderItem(headerItem) packages.setMaximumHeight(int(7*tightSizeStr(packages, "Abcdefg")[1])) packages.header().setResizeMode(0, QHeaderView.Stretch) packages.header().setResizeMode(1, QHeaderView.Stretch) self.connect(self.os, SIGNAL("activated(int)"), self.cascadeOsVer) self.connect(self.osver, SIGNAL("activated(int)"), self.cascadeOsArch) self.connect(self.osarch, SIGNAL("activated(int)"), self.displayPackages) self.connect(packages, \ SIGNAL('currentItemChanged(QTreeWidgetItem*,QTreeWidgetItem*)'), \ self.useSelectedPackage) self.changelogView = QTextBrowser(self) self.changelogView.setOpenExternalLinks(True) self.saveAsOfflinePackage = QCheckBox(tr("Save with offline-verifiable signature")) self.closeButton = QPushButton(tr("Close"), self) self.connect(self.closeButton, SIGNAL('clicked()'), self.accept) self.btnDLInfo = QLabelButton('Download Info') self.btnDLInfo.setVisible(False) self.connect(self.btnDLInfo, SIGNAL('clicked()'), self.popupPackageInfo) self.lblSelectedSimple = QRichLabel(tr('No download selected'), doWrap=False, hAlign=Qt.AlignHCenter) self.lblSelectedSimpleMore = QRichLabel(tr(''), doWrap=False) self.lblSelectedComplex = QRichLabel(tr('No download selected')) self.lblCurrentVersion = QRichLabel('', hAlign=Qt.AlignHCenter) # At the moment, not sure we actually need this label self.lblSelectedComplex.setVisible(False) self.btnShowComplex = QLabelButton(tr('Show all downloads for all OS')) self.connect(self.btnShowComplex, SIGNAL('clicked()'), self.showComplex) frmDisp = makeHorizFrame(['Stretch', self.lblSelectedSimpleMore, 'Stretch']) frmBtnShowComplex = makeHorizFrame(['Stretch', self.btnShowComplex]) layoutSimple = QVBoxLayout() layoutSimple.addWidget(self.lblSelectedSimple) layoutSimple.addWidget(frmDisp) layoutSimple.addWidget(self.lblCurrentVersion) layoutSimple.addWidget(frmBtnShowComplex) frmTopSimple = QFrame() frmTopSimple.setLayout(layoutSimple) layoutComplex = QGridLayout() layoutComplex.addWidget(oslabel, 0,0) layoutComplex.addWidget(self.os, 0,1) layoutComplex.addWidget(self.osver, 0,2) layoutComplex.addWidget(self.osarch,0,3) layoutComplex.addWidget(packages, 1,0, 1,4) layoutComplex.addWidget(self.lblSelectedComplex, 2,0, 1,4) layoutComplex.setColumnStretch(0,0) layoutComplex.setColumnStretch(1,2) layoutComplex.setColumnStretch(2,2) layoutComplex.setColumnStretch(3,1) frmTopComplex = QFrame() frmTopComplex.setLayout(layoutComplex) frmTopComplex.setFrameStyle(STYLE_SUNKEN) frmTopSimple.setFrameStyle(STYLE_SUNKEN) self.stackedDisplay = QStackedWidget() self.stackedDisplay.addWidget(frmTopSimple) self.stackedDisplay.addWidget(frmTopComplex) layout = QGridLayout() layout.addWidget(self.stackedDisplay, 0,0, 1,3) layout.addWidget(self.changelogView, 1,0, 1,3) layout.addWidget(self.saveAsOfflinePackage, 2,0) layout.addWidget(self.btnDLInfo, 2,2) layout.addWidget(self.downloader.createDownloaderWidget(self), \ 3,0, 1,3) layout.addWidget(self.closeButton, 4,2) layout.setRowStretch(0, 1) layout.setColumnStretch(1, 1) self.cascadeOs() self.selectMyOs() self.useSelectedPackage() self.cascadeOs() # I have no clue why we have to call these things so many times! self.selectMyOs() self.cascadeOs() # Above we had to select *something*, we should check that the # architecture actually matches our system. If not, warn #trueBits = '64' if SystemSpecs.IsX64 else '32' #selectBits = self.itemData(self.osarch)[:2] #if showPackage and not trueBits==selectBits: #QMessageBox.warning(self, tr("Wrong Architecture"), tr(""" #You appear to be on a %s-bit architecture, but the only #available download is for %s-bit systems. It is unlikely #that this download will work on this operating system. #

#Please make sure that the correct operating system is #selected before attempting to download and install any #packages.""") % (trueBits, selectBits), QMessageBox.Ok) #self.bitsColor = htmlColor('TextRed') if showPackage == 'Armory': expectVer = self.main.armoryVersions[1] elif showPackage == 'Satoshi': expectVer = self.main.satoshiVersions[1] # This is currently broken... will have to fix later #if showPackage: #for n in range(0, packages.topLevelItemCount()): #row = packages.topLevelItem(n) #if str(row.data(0, 32).toString())==showPackage: #packages.setCurrentItem(row) #if not expectVer or str(row.data(1, 32).toString())==expectVer: #break #self.useSelectedPackage() #else: #foundPackage = False self.stackedDisplay.setCurrentIndex(1) QMessageBox.warning(self, tr("Not Found"), tr(""" Armory could not determine an appropriate download for your operating system. You will have to manually select the correct download on the next window."""), QMessageBox.Ok) #else: #self.stackedDisplay.setCurrentIndex(1) self.setLayout(layout) self.setMinimumWidth(600) self.setWindowTitle(tr('Secure Downloader')) def showSimple(self): self.stackedDisplay.setCurrentIndex(0) def showComplex(self): self.stackedDisplay.setCurrentIndex(1) def findCmbData(self, cmb, findStr, last=False): """ So I ran into some issues with finding python strings in comboboxes full of QStrings. I confirmed that self.os.itemText(i)==tr("Ubuntu/Debian") but not self.os.findData(tr("Ubuntu/Debian")) I'm probably being stupid, I thought I saw this work before... Return zero if failed so we just select the first item in the list if we don't find it. """ for i in range(cmb.count()): if cmb.itemText(i)==findStr: return i return 0 if not last else cmb.count()-1 def selectMyOs(self): osVar = OS_VARIANT if isinstance(osVar, (list,tuple)): osVar = osVar[0] osIndex = 0 if OS_WINDOWS: osIndex = self.findCmbData(self.os, tr("Windows")) elif OS_LINUX: if osVar.lower() in ['debian', 'linuxmint']: d1 = self.findCmbData(self.os, tr('Debian')) d2 = self.findCmbData(self.os, tr('Ubuntu')) osIndex = max(d1,d2) elif osVar.lower() == "ubuntu": osIndex = self.findCmbData(self.os, tr('Ubuntu')) else: osIndex = self.findCmbData(self.os, tr('Ubuntu')) elif OS_MACOSX: osIndex = self.findCmbData(self.osver, tr('MacOSX')) self.os.setCurrentIndex(osIndex) self.cascadeOsVer() # signals don't go through for some reason osverIndex = 0 if OS_WINDOWS: osverIndex = self.findCmbData(self.osver, platform.win32_ver(), True) elif OS_LINUX: osverIndex = self.findCmbData(self.osver, OS_VARIANT[1], True) elif OS_MACOSX: osverIndex = self.findCmbData(self.osver, platform.mac_ver()[0], True) self.osver.setCurrentIndex(osverIndex) self.cascadeOsArch() archIndex = 0 if platform.machine() == "x86_64": archIndex = self.findCmbData(self.osarch, tr('64')) else: archIndex = self.findCmbData(self.osarch, tr('32')) self.osarch.setCurrentIndex(archIndex) def useSelectedPackage(self): if self.packages.currentItem() is None: self.changelogView.setHtml("" + tr(""" There is no version information to be shown here.""") +"") self.downloader.setFile(None, None) else: packagename = str(self.packages.currentItem().data(0, 32).toString()) packagever = str(self.packages.currentItem().data(1, 32).toString()) packageurl = str(self.packages.currentItem().data(2, 32).toString()) packagehash = str(self.packages.currentItem().data(3, 32).toString()) self.downloader.setFile(packageurl, packagehash) self.selectedDLInfo = [packagename,packagever,packageurl,packagehash] self.btnDLInfo.setVisible(True) self.downloader.setPackageName(packagename) # Figure out where to bound the changelog information startIndex = -1 if self.changelog is not None: for i,triplet in enumerate(self.changelog): if triplet[0]==packagever: startIndex = i break stopIndex = len(self.changelog) if len(self.main.armoryVersions[0])>0: for i,triplet in enumerate(self.changelog): currVer = getVersionInt(readVersionString(self.main.armoryVersions[0])) thisVer = getVersionInt(readVersionString(triplet[0])) if thisVer <= currVer: stopIndex = i break if startIndex > -1: logHtml = "" if startIndex >= stopIndex: logHtml = tr("Release notes are not available for this package") else: for i in range(startIndex, stopIndex): block = self.changelog[i] logHtml += "

" + tr("Version {0}").format(block[0]) + "

\n" logHtml += "" + tr("Released on {0}").format(block[1]) + "\n" features = block[2] logHtml += "
    " for f in features: logHtml += "
  • " + tr("{0}: {1}").format(f[0], f[1]) + "
    • \n" logHtml += "
\n\n" else: if packagename == "Satoshi": logHtml = tr(""" No version information is available here for any of the core Bitcoin software downloads. You can find the information at: https://bitcoin.org/en/version-history""") else: logHtml = tr("Release notes are not available for this package") #logHtml += tr(""" #

#----- #

#Package: %s version %s
#Download URL: %s
#Verified sha256sum: %s""") % \ #(packagename, packagever, packageurl, packagehash) self.changelogView.setHtml(logHtml) self.updateLabels(packagename, packagever, self.itemData(self.os), self.itemData(self.osver), self.itemData(self.osarch)) def popupPackageInfo(self): pkgname,pkgver,pkgurl,pkghash = self.selectedDLInfo pkgname= tr(pkgname) pkgver = tr(pkgver) osname = tr(self.itemData(self.os)) osver = tr(self.itemData(self.osver)) osarch = self.itemData(self.osarch) inst = os.path.basename(pkgurl) QMessageBox.information(self, tr('Package Information'), tr(""" Download information for %(pkgname)s version %(pkgver)s:
  • Operating System:
    • %(osname)s %(osver)s %(osarch)s-bit
  • Installer Filename:
    • %(inst)s
  • Download URL:
    • %(pkgurl)s
  • Verified sha256sum:
    • %(pkghash)s
""") % locals(), QMessageBox.Ok) def cascade(self, combobox, valuesfrom, nextToCascade): combobox.blockSignals(True) current = combobox.currentText() combobox.clear() for v in valuesfrom: combobox.addItem(self.localized(v), QVariant(v)) at = combobox.findText(current) if at != -1: combobox.setCurrentIndex(at) nextToCascade() combobox.blockSignals(False) # pass the combobox (self.os, osver, ...) and the part of nestedDownloadMap # to look into def cascadeOs(self): allOSes = set() for pack in self.nestedDownloadMap.itervalues(): for packver in pack.itervalues(): for os in packver.iterkeys(): allOSes.add(os) self.cascade(self.os, allOSes, self.cascadeOsVer) def cascadeOsVer(self): chosenos = str(self.os.itemData(self.os.currentIndex()).toString()) if len(chosenos)==0: return allVers = set() for pack in self.nestedDownloadMap.itervalues(): for packver in pack.itervalues(): if chosenos in packver: for osver in packver[chosenos].iterkeys(): allVers.add(osver) # We use a list here because we need to sort the subvers allVers = sorted([x for x in allVers]) self.cascade(self.osver, allVers, self.cascadeOsArch) def cascadeOsArch(self): chosenos = str(self.os.itemData(self.os.currentIndex()).toString()) chosenosver = str(self.osver.itemData(self.osver.currentIndex()).toString()) if len(chosenosver)==0: return allArchs = set() for pack in self.nestedDownloadMap.itervalues(): for packver in pack.itervalues(): if chosenos in packver and chosenosver in packver[chosenos]: for osarch in packver[chosenos][chosenosver].iterkeys(): allArchs.add(osarch) self.cascade(self.osarch, allArchs, self.displayPackages) def displayPackages(self): packages = self.packages packages.clear() chosenos = str(self.os.itemData(self.os.currentIndex()).toString()) chosenosver = str(self.osver.itemData(self.osver.currentIndex()).toString()) chosenosarch = str(self.osarch.itemData(self.osarch.currentIndex()).toString()) if len(chosenosarch)==0: return for packname,pack in self.nestedDownloadMap.iteritems(): for packvername,packver in pack.iteritems(): if chosenos in packver \ and chosenosver in packver[chosenos] \ and chosenosarch in packver[chosenos][chosenosver]: row = QTreeWidgetItem() row.setText(0, self.localized(packname)) row.setData(0, 32, packname) # not localized row.setText(1, self.localized(packvername)) row.setData(1, 32, packvername) row.setData(2, 32, packver[chosenos][chosenosver][chosenosarch][0]) row.setData(3, 32, packver[chosenos][chosenosver][chosenosarch][1]) packages.addTopLevelItem(row) self.updateLabels(packname, packvername, self.itemData(self.os), self.itemData(self.osver), self.itemData(self.osarch)) def updateLabels(self, pkgName, pkgVer, osName, osVer, osArch): if not pkgName: self.lblSelectedComplex.setText(tr("""No package currently selected""")) self.lblSelectedSimple.setText(tr("""No package currently selected""")) self.lblSelectedSimpleMore.setText(tr("")) else: self.lblSelectedComplex.setText(tr(""" Selected Package: {} {} for {} {} {}"""). \ format(tr(pkgName), tr(pkgVer), tr(osName), tr(osVer), tr(osArch))) self.lblSelectedSimple.setText(tr(""" Securely download latest version of %s""") % pkgName) self.lblCurrentVersion.setText('') currVerStr = '' if pkgName=='Satoshi': if self.main.satoshiVersions[0]: self.lblCurrentVersion.setText(tr(""" You are currently using Bitcoin Core version %s""") % \ self.main.satoshiVersions[0]) elif pkgName=='Armory': if self.main.armoryVersions[0]: self.lblCurrentVersion.setText(tr(""" You are currently using Armory version %s""") % \ self.main.armoryVersions[0]) self.lblSelectedSimpleMore.setText(tr(""" Software Download: %s version %s
Operating System: %s %s
System Architecture: %s """) % \ (tr(pkgName), tr(pkgVer), tr(osName), tr(osVer), self.bitsColor, tr(osArch))) # get the untranslated name from the combobox specified def itemData(self, combobox): return str(combobox.itemData(combobox.currentIndex()).toString()) def localized(self, v): if v in self.localizedData: return str(self.localizedData[v]) else: return str(v) # kate: indent-width 3; replace-tabs on; armory-0.92.3/ui/MultiSigModels.py0000644000000000000000000001301112414772654015514 0ustar rootrootfrom os import path import platform import sys from armoryengine.ALL import * from qtdefines import * from PyQt4.QtCore import * from PyQt4.QtGui import * LOCKBOXCOLS = enum('ID', 'MSType', 'CreateDate', 'LBName', \ 'Key0', 'Key1', 'Key2', 'Key3', 'Key4', \ 'NumTx', 'Balance', 'UnixTime') class LockboxDisplayModel(QAbstractTableModel): def __init__(self, main, allLockboxes, dateFormat=DEFAULT_DATE_FORMAT): super(LockboxDisplayModel, self).__init__() self.boxList = allLockboxes self.dateFmt = dateFormat self.main = main def recomputeMaxKeys(self): self.maxN = max([lbox.N for lbox in self.boxList]) def rowCount(self, index=QModelIndex()): return len(self.boxList) def columnCount(self, index=QModelIndex()): return 12 def getKeyDisp(self, lbox, i): if len(lbox.commentList[i].strip())>0: return lbox.commentList[i] else: pubhex = binary_to_hex(lbox.pkList[i]) addr = hash160_to_addrStr(lbox.a160List[i]) return "%s (%s...)" % (addr, pubhex[:20]) def data(self, index, role=Qt.DisplayRole): row,col = index.row(), index.column() lbox = self.boxList[row] lbID = lbox.uniqueIDB58 lwlt = self.main.cppLockboxWltMap[lbID] nTx, bal = 0, 0 if TheBDM.getBDMState()=='BlockchainReady': nTx = len(lwlt.getTxLedger()) bal = lwlt.getFullBalance() if role==Qt.DisplayRole: if col==LOCKBOXCOLS.ID: return QVariant(lbID) elif col==LOCKBOXCOLS.CreateDate: return QVariant(unixTimeToFormatStr(lbox.createDate, self.dateFmt)) elif col==LOCKBOXCOLS.MSType: return QVariant('%d-of-%d' % (lbox.M, lbox.N)) elif col==LOCKBOXCOLS.LBName: return QVariant(lbox.shortName) elif col==LOCKBOXCOLS.Key0: return QVariant(self.getKeyDisp(lbox, 0)) elif col==LOCKBOXCOLS.Key1: return QVariant(self.getKeyDisp(lbox, 1)) elif col==LOCKBOXCOLS.Key2: return QVariant(self.getKeyDisp(lbox, 2)) elif col==LOCKBOXCOLS.Key3: return QVariant(self.getKeyDisp(lbox, 3)) elif col==LOCKBOXCOLS.Key4: return QVariant(self.getKeyDisp(lbox, 4)) elif col==LOCKBOXCOLS.NumTx: if not TheBDM.getBDMState()=='BlockchainReady': return QVariant('(...)') return QVariant(nTx) elif col==LOCKBOXCOLS.Balance: if not TheBDM.getBDMState()=='BlockchainReady': return QVariant('(...)') return QVariant(coin2str(bal, maxZeros=2)) elif col==LOCKBOXCOLS.UnixTime: return QVariant(str(lbox.createDate)) elif role==Qt.TextAlignmentRole: if col in (LOCKBOXCOLS.MSType, LOCKBOXCOLS.NumTx, LOCKBOXCOLS.Balance): return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) return QVariant(int(Qt.AlignLeft | Qt.AlignVCenter)) elif role==Qt.FontRole: f = GETFONT('Var') if col==LOCKBOXCOLS.Balance: f = GETFONT('Fixed') if nTx>0: f.setWeight(QFont.Bold) return QVariant(f) elif role==Qt.BackgroundColorRole: if bal>0: return QVariant( Colors.SlightGreen ) return QVariant() def headerData(self, section, orientation, role=Qt.DisplayRole): colLabels = ['ID', 'Type', 'Created', 'Info', 'Key #1', 'Key #2', 'Key #3', 'Key #4', 'Key #5', '#Tx', 'Funds', 'UnixTime'] if role==Qt.DisplayRole: if orientation==Qt.Horizontal: return QVariant( colLabels[section]) elif role==Qt.TextAlignmentRole: return QVariant( int(Qt.AlignHCenter | Qt.AlignVCenter) ) class LockboxDisplayProxy(QSortFilterProxyModel): """ A proxy that re-maps indices to the table view so that data appears sorted without touching the model """ def lessThan(self, idxLeft, idxRight): COL = LOCKBOXCOLS thisCol = self.sortColumn() def getDouble(idx, col): row = idx.row() s = toUnicode(self.sourceModel().index(row, col).data().toString()) return float(s) def getInt(idx, col): row = idx.row() s = toUnicode(self.sourceModel().index(row, col).data().toString()) return int(s) #LOCKBOXCOLS = enum('ID', 'MSType', 'CreateDate', 'LBName', \ #'Key0', 'Key1', 'Key2', 'Key3', 'Key4', \ #'NumTx', 'Balance', 'UnixTime') strLeft = str(self.sourceModel().data(idxLeft).toString()) strRight = str(self.sourceModel().data(idxRight).toString()) if thisCol in (COL.ID, COL.MSType, COL.LBName): return (strLeft.lower() < strRight.lower()) elif thisCol==COL.CreateDate: tLeft = getDouble(idxLeft, COL.UnixTime) tRight = getDouble(idxRight, COL.UnixTime) return (tLeftArmory Technologies, Inc. (testing key) has signed the following block of text:
""") % htmlColor('TextGreen') else: ownerStr = tr(""" Armory Technologies, Inc. has signed the following block of text:
""") % \ htmlColor('TextGreen') else: ownerStr = tr(""" The owner of the following Bitcoin address...
%s

... has produced a valid signature for the following message:
""") % addrB58 if addrB58: msg = messageString.replace('\r\n','\n') msg = ' ' + '
'.join(msg.split('\n')) # The user will be able to see the entire message # in the Message Signing/Verification dialog msg = '
'.join([line[:60]+ '...'*(len(line)>60) for line in msg.split('
')][:12]) MsgBoxCustom(MSGBOX.Good, tr('Verified!'), tr(""" %s
%s

Please make sure that the address above (%s...) matches the exact address you were expecting. A valid signature is meaningless unless it is made from a recognized address!""") % (ownerStr, msg, addrB58[:10])) self.lblSigResult.setText(\ 'Valid Signature by %s' % addrDisp) else: self.displayInvalidSignatureMessage() def displayInvalidSignatureMessage(self): MsgBoxCustom(MSGBOX.Error, 'Invalid Signature!', \ 'The supplied signature is not valid!') self.lblSigResult.setText('Invalid Signature!') class BareSignatureVerificationWidget(SignatureVerificationWidget): def __init__(self, parent=None, main=None): super(BareSignatureVerificationWidget, self).__init__(parent, main) # Pick an Address in Row 0 of the grid layout addressLabel = QLabel('Signing Address:') self.addressLineEdit = QLineEdit() self.addressBookButton = createAddrBookButton(self, self.addressLineEdit, None, selectMineOnly=True, showLockboxes=False) self.signMessageLayout.addWidget(addressLabel, 0, 0) self.signMessageLayout.addWidget(self.addressLineEdit, 0, 1) self.signMessageLayout.addWidget(self.addressBookButton, 0, 2) # Create a message text box messageLabel = QLabel("Signed Message:") self.messageTextEdit = QTextEdit() self.messageTextEdit.setAcceptRichText(False) self.messageTextEdit.setStyleSheet("font: 9pt \"Courier\";") self.signMessageLayout.addWidget(messageLabel, 1, 0) self.signMessageLayout.addWidget(self.messageTextEdit, 1, 1) # Create a Signature display signatureLabel = QLabel('Signature:') self.signatureTextEdit = QTextEdit() self.signatureTextEdit.setStyleSheet("font: 9pt \"Courier\";") self.signMessageLayout.addWidget(signatureLabel, 2, 0) self.signMessageLayout.addWidget(self.signatureTextEdit, 2, 1) def verifySignature(self): messageString = str(self.messageTextEdit.toPlainText()) try: addrB58 = verifySignature(str(self.signatureTextEdit.toPlainText()), \ messageString, 'v0', ord(ADDRBYTE)) if addrB58 == str(self.addressLineEdit.text()): self.displayVerifiedBox(addrB58, messageString) else: self.displayInvalidSignatureMessage() except: self.displayInvalidSignatureMessage() raise def clearFields(self): super(BareSignatureVerificationWidget, self).clearFields() self.addressLineEdit.setText('') self.messageTextEdit.setPlainText('') self.signatureTextEdit.setPlainText('') class SignedMessageBlockVerificationWidget(SignatureVerificationWidget): def __init__(self, parent=None, main=None): super(SignedMessageBlockVerificationWidget, self).__init__(parent, main) # Create a Signature display signatureLabel = QLabel('Signed Message Block:') self.signedMessageBlockTextEdit = QTextEdit() self.signedMessageBlockTextEdit.setStyleSheet("font: 9pt \"Courier\";") self.signedMessageBlockTextEdit.setAcceptRichText(False) self.signMessageLayout.addWidget(signatureLabel, 0, 0) self.signMessageLayout.addWidget(self.signedMessageBlockTextEdit, 0, 1) # Create a message in Row 1 messageLabel = QLabel("Message:") self.messageTextEdit = QTextEdit() self.messageTextEdit.setAcceptRichText(False) self.messageTextEdit.setReadOnly(True) self.messageTextEdit.setStyleSheet("font: 9pt \"Courier\"; background-color: #bbbbbb;") self.signMessageLayout.addWidget(messageLabel, 1, 0) self.signMessageLayout.addWidget(self.messageTextEdit, 1, 1, 1, 2) def verifySignature(self): try: sig, msg = readSigBlock(str(self.signedMessageBlockTextEdit.toPlainText())) addrB58 = verifySignature(sig, msg, 'v1', ord(ADDRBYTE) ) self.displayVerifiedBox(addrB58, msg) self.messageTextEdit.setPlainText(msg) except: self.displayInvalidSignatureMessage() raise def clearFields(self): super(SignedMessageBlockVerificationWidget, self).clearFields() self.signedMessageBlockTextEdit.setPlainText('') self.messageTextEdit.setPlainText('') armory-0.92.3/armoryd.py0000644000000000000000000040311512414772654013663 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ # # # Original copyright transferred from from Ian Coleman (2012) # # Special thanks to Ian Coleman who created the original incarnation of # # this file and then transferred the rights to me so I could integrate it # # into the Armory project. And even more thanks to him for his advice # # on upgrading its security features and other capabilities. # # # ################################################################################ ##### # ORIGINAL comments from Ian Coleman, circa July 2012: # # This is a json-rpc interface to armory - http://bitcoinarmory.com/ # # Where possible this follows conventions established by the Satoshi client. # Does not require armory to be installed or running, this is a standalone # application. Requires bitcoind process to be running before starting armoryd. # Requires an armory wallet (can be watching only) to be in the same folder as # the armoryd script. Works with testnet, use --testnet flag when starting the # script. # # BEWARE: # This is relatively untested, please use caution. There should be no chance for # irreversible damage to be done by this software, but it is still in the early # development stage so treat it with the appropriate level of skepticism. # # Many thanks must go to etotheipi who started the armory client, and who has # provided immense amounts of help with this. This app is mostly chunks # of code taken from armory and refurbished into an rpc client. # See the bitcontalk thread for more details about this software: # https://bitcointalk.org/index.php?topic=92496.0 ##### ################################################################################ # To assist users, they can access, via JSON, a dictionary with information on # all the functions available via JSON. The dictionary will use the funct name # as the key and another dictionary as the value. The resultant dict will have a # description (string), a list of strings with parameter info, and the return # value (string). The following example provides a visual guide. # # { # "functA" : { # "Description" : "A funct that does a thing. This has mult lines." # "Parameters" : [ # "paramA - Descrip of paramA. Mult lines exist." # "paramB - A random string." # ] # "Return Value" : "Description of the return value. Mult lines!" # } # # Devs will have to remember to add the doc string when new functs are added. In # addition, devs will have to remember to use the following format for the # docstring, lest they risk screwing up the resultant dictionary or being unable # to run armoryd. Note that parameters must have a single dash separating them, # along with a single space before and after the dash! # # DESCRIPTION: # A funct that does a thing. # This has mult lines. # PARAMETERS: # paramA - Descrip of paramA. # Mult lines exist. # paramB - A random string. # RETURN: # Description of the return value. # Mult lines! ################################################################################ ################################################################################ # # Random JSON notes should be placed here as desired. # # - If a returned string has a newline char, JSON will convert it to the string # "\n" (minus quotation marks). # - In general, if you need to pass an actual newline via the command line, type # $'\n' instead of \n or \\n. (Newlines in files can be left alone.) # - The code sometimes returns "bitcoinrpc_jsonrpc.authproxy.JSONRPCException" # if values are returned as binary data. This is something to keep in mind if # bugs occur. # - When all else fails, and you have no clue how to deal via JSON, read RFC # 4627 and/or the Python manual's section on JSON. # ################################################################################ import decimal import base64 import json from twisted.cred.checkers import FilePasswordDB from twisted.internet import reactor from twisted.web import server from twisted.internet.protocol import ClientFactory # REMOVE IN 0.93 from txjsonrpc.auth import wrapResource from txjsonrpc.web import jsonrpc from armoryengine.ALL import * from collections import defaultdict from itertools import islice from armoryengine.Decorators import EmailOutput, catchErrsForJSON from armoryengine.PyBtcWalletRecovery import * from inspect import * from jasvet import readSigBlock, verifySignature from CppBlockUtils import BtcWallet # Some non-twisted json imports from jgarzik's code and his UniversalEncoder class UniversalEncoder(json.JSONEncoder): def default(self, obj): if isinstance(obj, decimal.Decimal): return float(obj) return json.JSONEncoder.default(self, obj) ARMORYD_CONF_FILE = os.path.join(ARMORY_HOME_DIR, 'armoryd.conf') # Define some specific errors that can be thrown and caught class UnrecognizedCommand(Exception): pass class NotEnoughCoinsError(Exception): pass class CoinSelectError(Exception): pass class WalletUnlockNeeded(Exception): pass class InvalidBitcoinAddress(Exception): pass class PrivateKeyNotFound(Exception): pass class WalletDoesNotExist(Exception): pass class LockboxDoesNotExist(Exception): pass class AddressNotInWallet(Exception): pass # A dictionary that includes the names of all functions an armoryd user can # call from the armoryd server. Implemented on the server side so that a client # can know what exactly the server can run. See the note above regarding the # docstring format. jsonFunctDict = {} NOT_IMPLEMENTED = '--Not Implemented--' ############################################ # Copied from ArmoryQt. Remove in 0.93. class armorydInstanceListener(Protocol): def connectionMade(self): LOGINFO('Another armoryd instance just tried to open.') self.factory.func_conn_made() def dataReceived(self, data): LOGINFO('Received data from alternate armoryd instance') self.factory.func_recv_data(data) self.transport.loseConnection() ############################################ # Copied from ArmoryQt. Remove in 0.93. class armorydListenerFactory(ClientFactory): protocol = armorydInstanceListener def __init__(self, fn_conn_made, fn_recv_data): self.func_conn_made = fn_conn_made self.func_recv_data = fn_recv_data ############################################################################# # Helper function from ArmoryQt. Check to see if we can go online. # (NB: Should be removed in 0.93 and combined w/ ArmoryQt code.) def onlineModeIsPossible(internetAvail, forceOnline): canGoOnline = True if not forceOnline: satoshiIsAvailableResult = satoshiIsAvailable() hasBlockFiles = checkHaveBlockfiles() canGoOnline = internetAvail and satoshiIsAvailableResult and hasBlockFiles LOGINFO('Internet connection is Available: %s', str(internetAvail)) LOGINFO('Bitcoin-Qt/bitcoind is Available: %s', satoshiIsAvailableResult) LOGINFO('The first blk*.dat was Available: %s', str(hasBlockFiles)) LOGINFO('Online mode currently possible: %s', canGoOnline) return canGoOnline ############################################################################# # Helper function from ArmoryQt. Check to see if we have the blk*.dat files. # (NB: Should be removed in 0.93 and combined w/ ArmoryQt code.) def checkHaveBlockfiles(): return os.path.exists(os.path.join(TheBDM.btcdir, 'blocks')) ############################################################################# # Check to see if an Internet connection is available. Code lifted from # ArmoryQt. (NB: Should be removed in 0.93 and combined w/ ArmoryQt code.) # (AO: There are many lines from the original code in ArmoryQt including # some that i have just removed. I have removed them rather than comment them # out to reduce the amount of commented code in the repo. If you want to see # what I removed compare the revisions and/or refer to ArmoryQt.) def setupNetworking(): LOGINFO('Setting up networking...') forceOnline = CLI_OPTIONS.forceOnline if forceOnline: LOGINFO('Forced online mode: True') # Check general internet connection internetAvail = False if not forceOnline: try: import urllib2 response=urllib2.urlopen('http://google.com', \ timeout=CLI_OPTIONS.nettimeout) internetAvail = True except ImportError: LOGERROR('No module urllib2 -- cannot determine if internet is ' \ 'available') except urllib2.URLError: # In the extremely rare case that google might be down (or just to try # again...) try: response=urllib2.urlopen('http://microsoft.com', \ timeout=CLI_OPTIONS.nettimeout) except: LOGEXCEPT('Error checking for internet connection') LOGERROR('Run --skip-online-check if you think this is an error') internetAvail = False except: LOGEXCEPT('Error checking for internet connection') LOGERROR('Run --skip-online-check if you think this is an error') internetAvail = False return onlineModeIsPossible(internetAvail, forceOnline) ################################################################################ # Utility function that takes a list of wallet paths, gets the paths and adds # the wallets to a wallet set (actually a dictionary, with the wallet ID as the # key and the wallet as the value), along with adding the wallet ID to a # separate set. def addMultWallets(inWltPaths, inWltMap, inWltIDSet): '''Function that adds multiple wallets to an armoryd server.''' newWltList = [] for aWlt in inWltPaths: # Logic basically taken from loadWalletsAndSettings() try: wltLoad = PyBtcWallet().readWalletFile(aWlt) wltID = wltLoad.uniqueIDB58 # For now, no wallets are excluded. If this changes.... #if aWlt in wltExclude or wltID in wltExclude: # continue # A directory can have multiple versions of the same # wallet. We'd prefer to skip watch-only wallets. if wltID in inWltIDSet: LOGWARN('***WARNING: Duplicate wallet (%s) detected' % wltID) wo1 = inWltMap[wltID].watchingOnly wo2 = wltLoad.watchingOnly if wo1 and not wo2: prevWltPath = inWltMap[wltID].walletPath inWltMap[wltID] = wltLoad LOGWARN('First wallet is more useful than the second one...') LOGWARN(' Wallet 1 (loaded): %s', aWlt) LOGWARN(' Wallet 2 (skipped): %s', prevWltPath) else: LOGWARN('Second wallet is more useful than the first one...') LOGWARN(' Wallet 1 (skipped): %s', aWlt) LOGWARN(' Wallet 2 (loaded): %s', \ inWltMap[wltID].walletPath) else: # Update the wallet structs. inWltMap[wltID] = wltLoad inWltIDSet.add(wltID) newWltList.append(wltID) except: LOGEXCEPT('***WARNING: Unable to load wallet %s. Skipping.', aWlt) raise return newWltList ################################################################################ # Utility function that takes a list of lockbox paths, gets the paths and adds # the lockboxes to a lockbox set (actually a dictionary, with the lockbox ID as # the key and the lockbox as the value), along with adding the lockboxy ID to a # separate set. def addMultLockboxes(inLBPaths, inLboxMap, inLBIDSet): '''Function that adds multiple lockboxes to an armoryd server.''' newLBList = [] for curLBFile in inLBPaths: try: curLBList = readLockboxesFile(curLBFile) for curLB in curLBList: lbID = curLB.uniqueIDB58 if lbID in inLBIDSet: LOGINFO('***WARNING: Duplicate lockbox (%s) detected' % lbID) else: inLboxMap[lbID] = curLB inLBIDSet.add(lbID) newLBList.append(lbID) except: LOGEXCEPT('***WARNING: Unable to load lockbox file %s. Skipping.', \ curLBFile) raise return newLBList class Armory_Json_Rpc_Server(jsonrpc.JSONRPC): ############################################################################# def __init__(self, wallet, lockbox=None, inWltMap=None, inLBMap=None, \ inWltIDSet=None, inLBIDSet=None, inLBCppWalletMap=None, \ armoryHomeDir=ARMORY_HOME_DIR, addrByte=ADDRBYTE): # Save the incoming info. If the user didn't pass in a wallet set, put the # wallet in the set (actually a dictionary w/ the wallet ID as the key). self.addressMetaData = {} self.curWlt = wallet self.curLB = lockbox # Dicts, sets and lists (and other container types?), if used as a default # argument, actually become references and subsequent calls to __init__ # will not necessarily be empty objects/maps. The proper way to initialize # is to check for None and set to the proper type. if inWltMap == None: inWltMap = {} if inWltIDSet == None: inWltIDSet = set() if inLBMap == None: inLBMap = {} if inLBIDSet == None: inLBIDSet = set() if inLBCppWalletMap == None: inLBCppWalletMap = {} self.serverWltMap = inWltMap # Dict self.serverWltIDSet = inWltIDSet # set() self.serverLBMap = inLBMap # Dict self.serverLBIDSet = inLBIDSet # set() self.serverLBCppWalletMap = inLBCppWalletMap # Dict self.armoryHomeDir = armoryHomeDir if wallet != None: wltID = wallet.uniqueIDB58 if self.serverWltMap.get(wltID) == None: self.serverWltMap[wltID] = wallet # If any variables rely on whether or not Testnet in a Box is running, # we'll set everything up here. self.addrByte = addrByte ############################################################################# @catchErrsForJSON def jsonrpc_receivedfromsigner(self, *sigBlock): """ DESCRIPTION: Verify that a message (RFC 2440: clearsign or Base64) has been signed by a Bitcoin address and get the amount of coins sent to the current wallet by the message's signer. PARAMETERS: sigBlock - Message with the RFC 2440 message to be verified. The message must be enclosed in quotation marks. RETURN: A dictionary with verified message and the amount of money sent to the current wallet by the signer. """ retDict = {} # We must deal with a quirk. Non-escaped spaces (i.e., spaces that aren't # \u0020) will cause the CL parser to split the sig into multiple lines. # We need to combine the lines. (NB: Strip the final space too!) signedMsg = (''.join((str(piece) + ' ') for piece in sigBlock))[:-1] verification = self.jsonrpc_verifysignature(signedMsg) retDict['message'] = verification['message'] retDict['amount'] = self.jsonrpc_receivedfromaddress(verification['address']) return retDict ############################################################################# # The following is a fake example of a message that can be sent into # verifysignature(). The example is included primarily to show command line # formatting. Messages are the same type as those generated by Bitcoin Core. # python armoryd.py verifysignature \"-----BEGIN BITCOIN SIGNED MESSAGE-----$'\n'Comment: Hello.$'\n'-----BEGIN BITCOIN SIGNATURE-----$'\n'$'\n'junkjunkjunk$'\n'-----END BITCOIN SIGNATURE-----\" @catchErrsForJSON def jsonrpc_verifysignature(self, *sigBlock): """ DESCRIPTION: Take a message (RFC 2440: clearsign or Base64) signed by a Bitcoin address and verify the message. PARAMETERS: sigBlock - Message with the RFC 2440 message to be verified. The message must be enclosed in quotation marks. RETURN: A dictionary with verified message and the Base58 address of the signer. """ retDict = {} # We must deal with a couple of quirks. First, non-escaped spaces (i.e., # spaces that aren't \u0020) will cause the CL parser to split the sig # into multiple lines. We need to combine the lines. Second, the quotation # marks used to prevent Armory from treating the sig like a CL arg need # to be removed. (NB: The final space must be stripped too.) signedMsg = (''.join((str(piece) + ' ') for piece in sigBlock))[1:-2] # Get the signature block's signature and message. The signature must be # formatted for clearsign or Base64 persuant to RFC 2440. sig, msg = readSigBlock(signedMsg) retDict['message'] = msg addrB58 = verifySignature(sig, msg, 'v1', ord(self.addrByte) ) retDict['address'] = addrB58 return retDict ############################################################################# @catchErrsForJSON def jsonrpc_receivedfromaddress(self, sender): """ DESCRIPTION: Return the number of coins received from a particular sender. PARAMETERS: sender - Base58 address of the sender to the current wallet. RETURN: Number of Bitcoins sent by the sender to the current wallet. """ totalReceived = 0.0 ledgerEntries = self.curWlt.getTxLedger('blk') for entry in ledgerEntries: cppTx = TheBDM.getTxByHash(entry.getTxHash()) if cppTx.isInitialized(): # Only consider the first for determining received from address # This function should assume it is online, and actually request the previous # TxOut script from the BDM -- which guarantees we know the sender. # Use TheBDM.getSenderScrAddr(txin). This takes a C++ txin (which we have) # and it will grab the TxOut being spent by that TxIn and return the # scraddr of it. This will succeed 100% of the time. cppTxin = cppTx.getTxInCopy(0) txInAddr = scrAddr_to_addrStr(TheBDM.getSenderScrAddr(cppTxin)) fromSender = sender == txInAddr if fromSender: txBinary = cppTx.serialize() pyTx = PyTx().unserialize(txBinary) for txout in pyTx.outputs: if self.curWlt.hasAddr(script_to_addrStr(txout.getScript())): totalReceived += txout.value return AmountToJSON(totalReceived) ############################################################################# # backupFilePath is the file to backup the current wallet to. # It does not necessarily exist yet. @catchErrsForJSON def jsonrpc_backupwallet(self, backupFilePath): """ DESCRIPTION: Back up the current wallet to a file at a given location. The backup will occur only if the file does not exist yet. PARAMETERS: backupFilePath - Path to the location where the backup will be saved. RETURN: A dictionary indicating whether or not the backup succeeded or failed, with the reason for failure given if applicable. """ retVal = {} if os.path.isfile(backupFilePath): retVal = {} retVal['Error'] = 'File %s already exists. Will not overwrite.' % \ backupFilePath else: if not self.curWlt.backupWalletFile(backupFilePath): # If we have a failure here, we probably won't know why. Not much # to do other than ask the user to check the armoryd server. retVal['Error'] = "Backup failed. Check the armoryd server logs." else: retVal['Result'] = "Backup succeeded." return retVal ############################################################################# # Get a list of UTXOs for the currently loaded wallet. @catchErrsForJSON def jsonrpc_listunspent(self): """ DESCRIPTION: Get a list of unspent transactions for the currently loaded wallet. By default, zero-conf UTXOs are included. PARAMETERS: None RETURN: A dictionary listing information about each UTXO in the currently loaded wallet. The dictionary is similar to the one returned by the bitcoind call of the same name. """ # Return a dictionary with a string as the key and a wallet B58 value as # the value. utxoList = self.curWlt.getTxOutList('unspent') utxoOutList = {} curTxOut = 0 totBal = 0 utxoOutList = [] if TheBDM.getBDMState()=='BlockchainReady': for u in utxoList: curUTXODict = {} curTxOut += 1 curTxOutStr = 'utxo%05d' % curTxOut utxoVal = AmountToJSON(u.getValue()) curUTXODict['txid'] = binary_to_hex(u.getOutPoint().getTxHash(), \ BIGENDIAN, LITTLEENDIAN) curUTXODict['vout'] = u.getTxOutIndex() try: curUTXODict['address'] = script_to_addrStr(u.getScript()) except: LOGEXCEPT('Error parse UTXO script -- multisig or non-standard') curUTXODict['address'] = '' curUTXODict['scriptPubKey'] = binary_to_hex(u.getScript()) curUTXODict['amount'] = utxoVal curUTXODict['confirmations'] = u.getNumConfirm() curUTXODict['priority'] = utxoVal * u.getNumConfirm() utxoOutList.append(curUTXODict) totBal += utxoVal else: LOGERROR('Blockchain not ready. Values will not be reported.') # Maybe we'll add more later, but for now, return what we have. return utxoOutList ############################################################################# # Get a dictionary with UTXOs for the wallet associated with the Base58 # address passed into the function. By default, zero-conf UTXOs are included. # The basic layout of the dictionary is as follows. # { # addrbalance : { # Address : Balance # } # numutxo : int # totalbalance : float # utxolist : { # Same information as listunspent # } # } @catchErrsForJSON def jsonrpc_listaddrunspent(self, inB58): """ DESCRIPTION: Get a list of unspent transactions for the currently loaded wallet that are associated with a given, comma-separated list of Base58 addresses from the wallet. By default, zero-conf UTXOs are included. PARAMETERS: inB58 - The Base58 address to check against the current wallet. RETURN: A dictionary containing all UTXOs for the currently loaded wallet associated with the given Base58 address, along with information about each UTXO. """ # TODO: We should probably add paging to this... totalTxOuts = 0 totalBal = 0 utxoDict = {} utxoList = [] # Get the UTXO balance & list for each address. # The strip() makes it possible to supply addresses with # spaces after or before each comma addrList = [a.strip() for a in inB58.split(",")] curTxOut = 0 topBlk = TheBDM.getTopBlockHeight() addrBalanceMap = {} utxoEntries = [] for addrStr in addrList: # For now, prevent the caller from accidentally inducing a 20 min rescan # If they want the unspent list for a non-registered addr, they can # explicitly register it and rescan before calling this method. if not TheBDM.scrAddrIsRegistered(addrStr_to_scrAddr(addrStr)): raise BitcoindError('Address is not registered, requires rescan') atype,a160 = addrStr_to_hash160(addrStr) if atype==ADDRBYTE: # Already checked it's registered, regardless if in a loaded wallet utxoList = getUnspentTxOutsForAddr160List([a160], 'spendable', 0) elif atype==P2SHBYTE: # For P2SH, we'll require we have a loaded lockbox lbox = self.getLockboxByP2SHAddrStr(addrStr) if not lbox: raise BitcoindError('Import lockbox before getting P2SH unspent') # We simply grab the UTXO list for the lbox, both p2sh and multisig cppWallet = self.serverLBCppWalletMap[lbox.uniqueIDB58] utxoList = cppWallet.getSpendableTxOutList(topBlk, IGNOREZC) else: raise NetworkIDError('Addr for the wrong network!') # Place each UTXO in the return dict. Each entry should specify which # address is associated with which UTXO. # (DR: For 0.93, this ought to be merged with the listunspent code, and # maybe moved around a bit to make the info easier to process.) utxoListBal = 0 for u in utxoList: curTxOut += 1 curUTXODict = {} # Get the UTXO info. curTxOutStr = 'utxo%05d' % curTxOut utxoVal = AmountToJSON(u.getValue()) curUTXODict['txid'] = binary_to_hex(u.getOutPoint().getTxHash(), \ BIGENDIAN, LITTLEENDIAN) curUTXODict['vout'] = u.getTxOutIndex() try: curUTXODict['address'] = script_to_addrStr(u.getScript()) except: LOGEXCEPT('Error parse UTXO script -- multisig or non-standard') curUTXODict['address'] = '' curUTXODict['scriptPubKey'] = binary_to_hex(u.getScript()) curUTXODict['amount'] = utxoVal curUTXODict['confirmations'] = u.getNumConfirm() curUTXODict['priority'] = utxoVal * u.getNumConfirm() utxoEntries.append(curUTXODict) totalTxOuts += 1 utxoListBal += u.getValue() totalBal += u.getValue() # Add up the UTXO balances for each address and add it to the UTXO # entry dict, then add the UTXO entry dict to the master dict. addrBalanceMap[addrStr] = AmountToJSON(utxoListBal) # Let's round out the master dict with more info. utxoDict['utxolist'] = utxoEntries utxoDict['numutxo'] = totalTxOuts utxoDict['addrbalance'] = addrBalanceMap utxoDict['totalbalance'] = AmountToJSON(totalBal) return utxoDict ############################################################################# @catchErrsForJSON def jsonrpc_importprivkey(self, privKey): """ DESCRIPTION: Import a private key into the current wallet. PARAMETERS: privKey - A private key in any format supported by Armory, including Base58 private keys supported by bitcoind (uncompressed public key support only). RETURN: A string of the private key's accompanying hexadecimal public key. """ # Convert string to binary retDict = {} privKey = str(privKey) privKeyValid = True if self.curWlt.useEncryption and self.curWlt.isLocked: raise WalletUnlockNeeded # Make sure the key is one we can support try: self.binPrivKey, self.privKeyType = parsePrivateKeyData(privKey) except: (errType, errVal) = sys.exc_info()[:2] LOGEXCEPT('Error parsing incoming private key.') LOGERROR('Error Type: %s' % errType) LOGERROR('Error Value: %s' % errVal) retDict['Error'] = 'Error type %s while parsing incoming private ' \ 'key.' % errType privKeyValid = False if privKeyValid: self.thePubKey = self.curWlt.importExternalAddressData(self.binPrivKey) if self.thePubKey != None: retDict['PubKey'] = binary_to_hex(self.thePubKey) else: LOGERROR('Attempt to import a private key failed.') retDict['Error'] = 'Attempt to import your private key failed. ' \ 'Check if the key is already in your wallet.' return retDict ############################################################################# @catchErrsForJSON def jsonrpc_getrawtransaction(self, txHash, verbose=0, endianness=BIGENDIAN): """ DESCRIPTION: Get the raw transaction string for a given transaction hash. PARAMETERS: txHash - A string representing the hex value of a transaction ID. verbose - (Default=0) Integer indicating whether or not the result should be more verbose. endianness - (Default=BIGENDIAN) Indicates the endianness of the ID. RETURN: A dictionary with the decoded raw transaction and relevant information. """ rawTx = None cppTx = TheBDM.getTxByHash(hex_to_binary(txHash, endianness)) if cppTx.isInitialized(): txBinary = cppTx.serialize() pyTx = PyTx().unserialize(txBinary) rawTx = binary_to_hex(pyTx.serialize()) if verbose: result = self.jsonrpc_decoderawtransaction(rawTx) result['hex'] = rawTx else: result = rawTx else: LOGERROR('Tx hash not recognized by TheBDM: %s' % txHash) result = None return result ############################################################################# @catchErrsForJSON def jsonrpc_gettxout(self, txHash, n, binary=0): """ DESCRIPTION: Get the TxOut entries for a given transaction hash. PARAMETERS: txHash - A string representing the hex value of a transaction ID. n - The TxOut index to obtain. binary - (Default=0) Indicates whether or not the resultant binary script should be in binary form or converted to a hex string. RETURN: A dictionary with the Bitcoin amount for the TxOut and the TxOut script in hex string form (default) or binary form. """ n = int(n) txOut = None cppTx = TheBDM.getTxByHash(hex_to_binary(txHash, BIGENDIAN)) if cppTx.isInitialized(): txBinary = cppTx.serialize() pyTx = PyTx().unserialize(txBinary) if n < len(pyTx.outputs): # If the user doesn't want binary data, return a formatted string, # otherwise return a hex string with the raw TxOut data. txOut = pyTx.outputs[n] result = {'value' : AmountToJSON(txOut.value), 'script' : txOut.binScript if binary else binary_to_hex(txOut.binScript)} else: LOGERROR('Tx output index is invalid: #%d' % n) else: LOGERROR('Tx hash not recognized by TheBDM: %s' % binary_to_hex(txHash)) return result ############################################################################# @catchErrsForJSON def jsonrpc_encryptwallet(self, passphrase): """ DESCRIPTION: Encrypt a wallet with a given passphrase. PARAMETERS: passphrase - The wallet's new passphrase. RETURN: A string indicating that the encryption was successful. """ retStr = 'Wallet %s has been encrypted.' % self.curWlt.uniqueIDB58 if self.curWlt.isLocked: raise WalletUnlockNeeded else: try: self.sbdPassphrase = SecureBinaryData(str(passphrase)) self.curWlt.changeWalletEncryption(securePassphrase=self.sbdPassphrase) self.curWlt.lock() finally: self.sbdPassphrase.destroy() # Ensure SBD is destroyed. return retStr ############################################################################# @catchErrsForJSON def jsonrpc_unlockwallet(self, passphrase, timeout=10): """ DESCRIPTION: Unlock a wallet with a given passphrase and unlock time length. PARAMETERS: passphrase - The wallet's current passphrase. timeout - (Default=10) The time, in seconds, that the wallet will be unlocked. RETURN: A string indicating if the wallet was unlocked or if it was already unlocked. """ retStr = 'Wallet %s is already unlocked.' % self.curWlt if self.curWlt.isLocked: try: self.sbdPassphrase = SecureBinaryData(str(passphrase)) self.curWlt.unlock(securePassphrase=self.sbdPassphrase, tempKeyLifetime=int(timeout)) retStr = 'Wallet %s has been unlocked.' % self.curWlt.uniqueIDB58 finally: self.sbdPassphrase.destroy() # Ensure SBD is destroyed. return retStr ############################################################################# @catchErrsForJSON def jsonrpc_relockwallet(self): """ DESCRIPTION: Re-lock a wallet. PARAMETERS: None RETURN: A string indicating whether or not the wallet is locked. """ # Lock the wallet. It should lock but we'll check to be safe. self.curWlt.lock() retStr = 'Wallet is %slocked.' % '' if self.curWlt.isLocked else 'not ' return retStr ############################################################################# @catchErrsForJSON def getScriptAddrStrs(self, txOut): addrList = [] scriptType = getTxOutScriptType(txOut.binScript) if scriptType in CPP_TXOUT_STDSINGLESIG: M = 1 addrList = [script_to_addrStr(txOut.binScript)] elif scriptType == CPP_TXOUT_P2SH: M = -1 addrList = [script_to_addrStr(txOut.binScript)] elif scriptType==CPP_TXOUT_MULTISIG: M, N, addr160List, pub65List = getMultisigScriptInfo(txOut.binScript) addrList = [hash160_to_addrStr(a160) for a160 in addr160List] elif scriptType == CPP_TXOUT_NONSTANDARD: M = -1 opStringList = convertScriptToOpStrings(txOut.binScript) return { 'asm' : ' '.join(opStringList), 'hex' : binary_to_hex(txOut.binScript), 'reqSigs' : M, 'type' : CPP_TXOUT_SCRIPT_NAMES[scriptType], 'addresses' : addrList } ############################################################################# @catchErrsForJSON def jsonrpc_decoderawtransaction(self, hexString): """ DESCRIPTION: Decode a raw transaction hex string. PARAMETERS: hexString - A string representing, in hex form, a raw transaction. RETURN: A dictionary containing the decoded transaction's information. """ pyTx = PyTx().unserialize(hex_to_binary(hexString)) ##### # Accumulate TxIn info vinList = [] for txin in pyTx.inputs: prevHash = txin.outpoint.txHash scrType = getTxInScriptType(txin) # ACR: What is asm, and why is basically just binScript? oplist = convertScriptToOpStrings(txin.binScript) scriptSigDict = { 'asm' : ' '.join(oplist), 'hex' : binary_to_hex(txin.binScript) } if not scrType == CPP_TXIN_COINBASE: vinList.append( { 'txid' : binary_to_hex(prevHash, BIGENDIAN), 'vout' : txin.outpoint.txOutIndex, 'scriptSig' : scriptSigDict, 'sequence' : txin.intSeq}) else: vinList.append( { 'coinbase' : binary_to_hex(txin.binScript), 'sequence' : txin.intSeq }) ##### # Accumulate TxOut info voutList = [] for n,txout in enumerate(pyTx.outputs): voutList.append( { 'value' : AmountToJSON(txout.value), 'n' : n, 'scriptAddrStrs' : self.getScriptAddrStrs(txout) } ) ##### # Accumulate all the data to return result = { 'txid' : pyTx.getHashHex(BIGENDIAN), 'version' : pyTx.version, 'locktime' : pyTx.lockTime, 'vin' : vinList, 'vout' : voutList } return result ############################################################################# @catchErrsForJSON def jsonrpc_getnewaddress(self): """ DESCRIPTION: Get a new Base58 address from the currently loaded wallet. PARAMETERS: None RETURN: The wallet's next unused public address in Base58 form. """ addr = self.curWlt.getNextUnusedAddress() return addr.getAddrStr() ############################################################################# @catchErrsForJSON def jsonrpc_dumpprivkey(self, addr58): """ DESCRIPTION: Dump the private key for a given Base58 address associated with the currently loaded wallet. PARAMETERS: addr58 - A Base58 public address associated with the current wallet. RETURN: The 32 byte binary private key. """ # Cannot dump the private key for a locked wallet if self.curWlt.isLocked: raise WalletUnlockNeeded # The first byte must be the correct net byte, and the # last 4 bytes must be the correct checksum if not checkAddrStrValid(addr58): raise InvalidBitcoinAddress addr160 = addrStr_to_hash160(addr58, False)[1] pyBtcAddress = self.curWlt.getAddrByHash160(addr160) if pyBtcAddress == None: raise PrivateKeyNotFound return binary_to_hex(pyBtcAddress.serializePlainPrivateKey()) ############################################################################# @catchErrsForJSON def jsonrpc_getwalletinfo(self, inWltID=None): """ DESCRIPTION: Get information on the currently loaded wallet. PARAMETERS: inWltID - (Default=None) If used, armoryd will get info for the wallet for the provided Base58 wallet ID instead of the current wallet. RETURN: A dictionary with information on the current wallet. """ wltInfo = {} self.isReady = TheBDM.getBDMState() == 'BlockchainReady' self.wltToUse = self.curWlt # If we're not getting info on the currently loaded wallet, check to make # sure the incoming wallet ID points to an actual wallet. if inWltID: if self.serverWltIDSet[inWltID] != None: self.wltToUse = self.serverWltMap[inWltID] else: raise WalletDoesNotExist return self.wltToUse.toJSONMap() ############################################################################# @catchErrsForJSON def jsonrpc_getbalance(self, baltype='spendable'): """ DESCRIPTION: Get the balance of the currently loaded wallet. PARAMETERS: baltype - (Default=spendable) A string indicating the balance type to retrieve from the current wallet. RETURN: The current wallet balance (BTC), or -1 if an error occurred. """ retVal = -1 # Proceed only if the blockchain's good. Wallet value could be unreliable # otherwise. if TheBDM.getBDMState()=='BlockchainReady': if not baltype in ['spendable', 'spend', 'unconf', 'unconfirmed', \ 'total', 'ultimate', 'unspent', 'full']: LOGERROR('Unrecognized getbalance string: "%s"', baltype) else: retVal = AmountToJSON(self.curWlt.getBalance(baltype)) else: LOGERROR('Blockchain not ready. Values will not be reported.') return retVal ############################################################################# @catchErrsForJSON def jsonrpc_getaddrbalance(self, inB58, baltype='spendable'): """ DESCRIPTION: Get the balance of a Base58 address associated with the currently loaded wallet. PARAMETERS: inB58 - The Base58 address associated with the current wallet. baltype - (Default=spendable) A string indicating the balance type to retrieve from the current wallet. RETURN: The current wallet balance (BTC), or -1 if an error occurred. """ retVal = -1 if not baltype in ['spendable','spend', 'unconf', 'unconfirmed', \ 'ultimate','unspent', 'full']: raise BadInputError('Unrecognized getaddrbalance type: %s' % baltype) topBlk = TheBDM.getTopBlockHeight() addrList = [a.strip() for a in inB58.split(",")] retBalance = 0 for addrStr in addrList: if not TheBDM.scrAddrIsRegistered(addrStr_to_scrAddr(addrStr)): raise BitcoindError('Address is not registered, requires rescan') atype,a160 = addrStr_to_hash160(addrStr) if atype==ADDRBYTE: # Already checked it's registered, regardless if in a loaded wallet utxoList = getUnspentTxOutsForAddr160List([a160], baltype, 0) elif atype==P2SHBYTE: # For P2SH, we'll require we have a loaded lockbox lbox = self.getLockboxByP2SHAddrStr(addrStr) if not lbox: raise BitcoindError('Import lockbox before getting P2SH unspent') # We simply grab the UTXO list for the lbox, both p2sh and multisig cppWallet = self.serverLBCppWalletMap[lbox.uniqueIDB58] utxoList = cppWallet.getSpendableTxOutList(topBlk, IGNOREZC) else: raise NetworkIDError('Addr for the wrong network!') retBalance += sumTxOutList(utxoList) return AmountToJSON(retBalance) ############################################################################# @catchErrsForJSON def jsonrpc_getreceivedbyaddress(self, address): """ DESCRIPTION: Get the number of coins received by a Base58 address associated with the currently loaded wallet. PARAMETERS: address - The Base58 address associated with the current wallet. RETURN: The balance received from the incoming address (BTC). """ if CLI_OPTIONS.offline: raise ValueError('Cannot get received amount when offline') # Only gets correct amount for addresses in the wallet, otherwise 0 addr160 = addrStr_to_hash160(address, False)[1] txs = self.curWlt.getAddrTxLedger(addr160) balance = sum([x.getValue() for x in txs if x.getValue() > 0]) return AmountToJSON(balance) ############################################################################# @catchErrsForJSON def jsonrpc_createustxtoaddress(self, recAddr, amount): """ DESCRIPTION: Create an unsigned transaction to be sent to one recipient from the currently loaded wallet. PARAMETERS: recAddr - The recipient. This can be an address, a P2SH script address, a lockbox (e.g., "Lockbox[83jcAqz9]" or "Lockbox[Bare:83jcAqz9]"), or a public key (compressed or uncompressed) string. amount - The number of Bitcoins to send to the recipient. RETURN: An ASCII-formatted unsigned transaction, similar to the one output by Armory for offline signing. """ if CLI_OPTIONS.offline: raise ValueError('Cannot create transactions when offline') ustxScr = getScriptForUserString(recAddr, self.serverWltMap, \ self.convLBDictToList()) amtCoin = JSONtoAmount(amount) return self.create_unsigned_transaction([[str(ustxScr['Script']), \ amtCoin]]) ############################################################################# # Create an unsigned Tx to be sent from the currently loaded wallet. # # Example: We wish to send 1 BTC to a lockbox and 0.12 BTC to a standard # Bitcoin address. (Publick keys and P2SH scripts can also be specified as # recipients but we don't use either one in this example.) # armoryd createustxformany Lockbox[83jcAqz9],1.0 mwpw68XWmvQKfsCJXETkDX2CWHPdchY6fi,0.12 @catchErrsForJSON def jsonrpc_createustxformany(self, *args): """ DESCRIPTION: Create an unsigned transaction to be sent to multiple recipients from the currently loaded wallet. PARAMETERS: args - An indefinite number of comma-separated sets of recipients and the number of Bitcoins to send to the recipients. The recipients can be an address, a P2SH script address, a lockbox (e.g., "Lockbox[83jcAqz9]" or "Lockbox[Bare:83jcAqz9]"), or a public key (compressed or uncompressed) string. RETURN: An ASCII-formatted unsigned transaction, similar to the one output by Armory for offline signing. """ if CLI_OPTIONS.offline: raise ValueError('Cannot create transactions when offline') scriptValuePairs = [] for a in args: r,v = a.split(',') ustxScr = getScriptForUserString(r, self.serverWltMap, \ self.convLBDictToList()) scriptValuePairs.append([ustxScr['Script'], JSONtoAmount(v)]) return self.create_unsigned_transaction(scriptValuePairs) ############################################################################# @catchErrsForJSON def jsonrpc_getledgersimple(self, inB58ID, tx_count=10, from_tx=0): """ DESCRIPTION: Get a simple version of a wallet or lockbox ledger. PARAMETERS: inB58ID - The Base58 ID of the wallet or lockbox from which to obtain the ledger. The wallet or lockbox must already be loaded. tx_count - (Default=10) The number of entries to get. from_tx - (Default=0) The first entry to get. RETURN: A dictionary with a wallet ledger of type "simple". """ return self.jsonrpc_getledger(inB58ID, tx_count, from_tx, True) ############################################################################# @catchErrsForJSON def jsonrpc_getledger(self, inB58ID, tx_count=10, from_tx=0, simple=False): """ DESCRIPTION: Get a wallet or lockbox ledger. inB58ID - The Base58 ID of the wallet or lockbox from which to obtain the ledger. The wallet or lockbox must already be loaded. tx_count - (Default=10) The number of entries to get. from_tx - (Default=0) The first entry to get. simple - (Default=False) Flag indicating if the returned ledger should be simple in format. RETURN: A ledger list with dictionary entries for each transaction. """ final_le_list = [] b58Type = 'wallet' self.b58ID = str(inB58ID) # Get the wallet. (ledgerWlt, wltIsCPP) = getWltFromB58ID(self.b58ID, self.serverWltMap, \ self.serverLBMap, \ self.serverLBCppWalletMap) # Proceed only if the incoming ID (and, hence, the wallet) is valid. if ledgerWlt == None: errMsg = 'Error: Base58 ID %s does not represent a valid wallet or ' \ 'lockbox.' % self.b58ID LOGERROR(errMsg) final_le_list.append(errMsg) else: # For now, lockboxes can only use C++ wallets, which use a different # set of calls and such. If we got back a Python wallet, convert it. if not wltIsCPP: ledgerWlt = ledgerWlt.cppWallet else: b58Type = 'lockbox' # Do some setup to determine how many ledger entries we'll get and # which entries we'll get. tx_count = int(tx_count) from_tx = int(from_tx) ledgerEntries = ledgerWlt.getTxLedger() sz = len(ledgerEntries) lower = min(sz, from_tx) upper = min(sz, from_tx+tx_count) txSet = set([]) # Loop through all the potential ledger entries and create what we can. for i in range(lower,upper): # Get the exact Tx we're looking for. le = ledgerEntries[i] txHashBin = le.getTxHash() txHashHex = binary_to_hex(txHashBin, BIGENDIAN) # If the BDM doesn't have the C++ Tx & header, log errors. cppTx = TheBDM.getTxByHash(txHashBin) if not cppTx.isInitialized(): LOGERROR('Tx hash not recognized by TheBDM: %s' % txHashHex) cppHead = TheBDM.getHeaderPtrForTx(cppTx) if not cppHead.isInitialized(): LOGERROR('Header pointer is not available!') headHashBin = '' headHashHex = '' headtime = 0 else: headHashBin = cppHead.getThisHash() headHashHex = binary_to_hex(headHashBin, BIGENDIAN) headtime = cppHead.getTimestamp() # Get some more data. # amtCoins: amt of BTC transacted, always positive (how big are # outputs minus change?) # netCoins: net effect on wallet (positive or negative) # feeCoins: how much fee was paid for this tx nconf = (TheBDM.getTopBlockHeader().getBlockHeight() - \ le.getBlockNum()) + 1 isToSelf = le.isSentToSelf() amtCoins = 0.0 netCoins = le.getValue() feeCoins = getFeeForTx(txHashBin) scrAddrs = [cppTx.getTxOutCopy(i).getScrAddressStr() for i in \ range(cppTx.getNumTxOut())] # Find the first recipient and the change recipient. firstScrAddr = '' changeScrAddr = '' if cppTx.getNumTxOut()==1: firstScrAddr = scrAddrs[0] elif isToSelf: # Sent-to-Self tx amtCoins,changeIdx = determineSentToSelfAmt(le, ledgerWlt) changeScrAddr = scrAddrs[changeIdx] for iout,recipScrAddr in enumerate(scrAddrs): if not iout==changeIdx: firstScrAddr = recipScrAddr break elif netCoins<0: # Outgoing transaction (process in reverse order so get first) amtCoins = -1*(netCoins+feeCoins) for recipScrAddr in scrAddrs[::-1]: if ledgerWlt.hasScrAddress(recipScrAddr): changeScrAddr = recipScrAddr else: firstScrAddr = recipScrAddr else: # Incoming transaction (process in reverse order so get first) amtCoins = netCoins for recipScrAddr in scrAddrs[::-1]: if ledgerWlt.hasScrAddress(recipScrAddr): firstScrAddr = recipScrAddr else: changeScrAddr = recipScrAddr # Determine the direction of the Tx based on the coin setup. if netCoins < -feeCoins: txDir = 'send' elif netCoins > -feeCoins: txDir = 'receive' else: txDir = 'toself' # Convert the scrAddrs to display strings. firstAddr = scrAddr_to_displayStr(firstScrAddr, self.serverWltMap, \ self.serverLBMap.values()) changeAddr = '' if len(changeScrAddr)==0 else \ scrAddr_to_displayStr(changeScrAddr, \ self.serverWltMap, \ self.serverLBMap.values()) # Get the address & amount from each TxIn. myinputs, otherinputs = [], [] for iin in range(cppTx.getNumTxIn()): sender = TheBDM.getSenderScrAddr(cppTx.getTxInCopy(iin)) val = TheBDM.getSentValue(cppTx.getTxInCopy(iin)) addTo = (myinputs if ledgerWlt.hasScrAddress(sender) else \ otherinputs) addTo.append( {'address': scrAddr_to_displayStr(sender, \ self.serverWltMap, \ self.serverLBMap.values()), \ 'amount': AmountToJSON(val)} ) # Get the address & amount from each TxOut. myoutputs, otheroutputs = [], [] for iout in range(cppTx.getNumTxOut()): recip = cppTx.getTxOutCopy(iout).getScrAddressStr() val = cppTx.getTxOutCopy(iout).getValue(); addTo = (myoutputs if ledgerWlt.hasScrAddress(recip) else \ otheroutputs) addTo.append( {'address': scrAddr_to_displayStr(recip, \ self.serverWltMap, \ self.serverLBMap.values()), \ 'amount': AmountToJSON(val)} ) # Create the ledger entry. (NB: "comment" isn't doable with C++ # wallets. Once the 2.0 wallets are ready, it should be restored.) tx_info = { 'direction' : txDir, b58Type : inB58ID, 'amount' : AmountToJSON(amtCoins), 'netdiff' : AmountToJSON(netCoins), 'fee' : AmountToJSON(feeCoins), 'txid' : txHashHex, 'blockhash' : headHashHex, 'confirmations': nconf, 'txtime' : le.getTxTime(), 'txsize' : len(cppTx.serialize()), 'blocktime' : headtime, #'comment' : ledgerWlt.getComment(txHashBin), 'firstrecip': firstAddr, 'changerecip': changeAddr } # Add more info if it's not a simple ledger. if not simple: tx_info['senderme'] = myinputs tx_info['senderother'] = otherinputs tx_info['recipme'] = myoutputs tx_info['recipother'] = otheroutputs # Add the ledger entry to the ledger list. final_le_list.append(tx_info) return final_le_list ############################################################################# # NB: For now, this is incompatible with lockboxes. @catchErrsForJSON def jsonrpc_listtransactions(self, tx_count=10, from_tx=0): """ DESCRIPTION: List the transactions associated with the currently loaded wallet. PARAMETERS: tx_count - (Default=10) The number of entries to get. from_tx - (Default=0) The first entry to get. RETURN: A dictionary with information on the retrieved transactions. """ # This does not use 'account's like in the Satoshi client final_tx_list = [] ledgerEntries = self.curWlt.getTxLedger('blk') sz = len(ledgerEntries) lower = min(sz, from_tx) upper = min(sz, from_tx+tx_count) txSet = set([]) for i in range(lower,upper): le = ledgerEntries[i] txHashBin = le.getTxHash() if txHashBin in txSet: continue txSet.add(txHashBin) txHashHex = binary_to_hex(txHashBin, BIGENDIAN) cppTx = TheBDM.getTxByHash(txHashBin) if not cppTx.isInitialized(): LOGERROR('Tx hash not recognized by TheBDM: %s' % txHashHex) #cppHead = cppTx.getHeaderPtr() cppHead = TheBDM.getHeaderPtrForTx(cppTx) if not cppHead.isInitialized: LOGERROR('Header pointer is not available!') blockIndex = cppTx.getBlockTxIndex() blockHash = binary_to_hex(cppHead.getThisHash(), BIGENDIAN) blockTime = le.getTxTime() isToSelf = le.isSentToSelf() feeCoin = getFeeForTx(txHashBin) totalBalDiff = le.getValue() nconf = TheBDM.getTopBlockHeader().getBlockHeight()-le.getBlockNum()+1 # We have potentially change outputs on any outgoing transactions. # If sent-to-self, assume 1 change address (max chain idx), all others # are receives recipVals = [] for iout in range(cppTx.getNumTxOut()): recip = CheckHash160(cppTx.getTxOutCopy(iout).getScrAddressStr()) val = cppTx.getTxOutCopy(iout).getValue() recipVals.append([recip,val]) if cppTx.getNumTxOut()==1: changeAddr160 = "" targAddr160 = CheckHash160(cppTx.getTxOutCopy(0).getScrAddressStr()) elif isToSelf: selfamt,changeIdx = determineSentToSelfAmt(le, self.curWlt) if changeIdx==-1: changeAddr160 = "" else: changeAddr160 = recipVals[changeIdx] del recipVals[changeIdx] targAddr160 = recipVals[0][0] elif totalBalDiff < 0: # This was ultimately an outgoing transaction for iout,rv in enumerate(recipVals): if self.curWlt.hasAddr(rv[0]): changeAddr160 = rv[0] del recipVals[iout] break targAddr160 = recipVals[0][0] else: # Receiving transaction for recip,val in recipVals: if self.curWlt.hasAddr(recip): targAddr160 = recip break targAddr160 = recipVals[0][0] changeAddr160 = '' # We always add one entry for the total balance diff on outgoing tx if totalBalDiff<-feeCoin: category = 'send' amt = AmountToJSON(le.getValue()+feeCoin) fee = -AmountToJSON(feeCoin) tx_info = { "account" : "", "address" : hash160_to_addrStr(targAddr160), "category" : category, "amount" : amt, "fee" : fee, "confirmations" : nconf, "blockhash" : blockHash, "blockindex" : blockIndex, "blocktime" : blockTime, "txid" : txHashHex, "time" : blockTime, "timereceived" : blockTime } final_tx_list.append(tx_info) for a160,val in recipVals: # Change outputs have already been removed if totalBalDiff>0 and not self.curWlt.hasAddr(a160): # This is a receiving tx and this is other addr sending to other # addr continue if a160=='\x00'*20: address = '' else: address = hash160_to_addrStr(a160) if not self.curWlt.hasAddr(a160): category = 'send' amt = -AmountToJSON(val) fee = -AmountToJSON(feeCoin) tx_info = { "account" : "", "address" : address, "category" : category, "amount" : amt, "fee" : fee, "confirmations" : nconf, "blockhash" : blockHash, "blockindex" : blockIndex, "blocktime" : blockTime, "txid" : txHashHex, "time" : blockTime, "timereceived" : blockTime } else: category = 'receive' amt = AmountToJSON(val) tx_info = { "account" : "", "address" : address, "category" : category, "amount" : amt, "confirmations" : nconf, "blockhash" : blockHash, "blockindex" : blockIndex, "blocktime" : blockTime, "txid" : txHashHex, "time" : blockTime, "timereceived" : blockTime } final_tx_list.append(tx_info) return final_tx_list ############################################################################# # A semi-analogue to bitcoind's getinfo(). @catchErrsForJSON def jsonrpc_getarmorydinfo(self): """ DESCRIPTION: Get information on the version of armoryd running on the server. PARAMETERS: None RETURN: A dictionary listing version of armoryd running on the server. """ isReady = TheBDM.getBDMState() == 'BlockchainReady' info = { \ 'versionstr': getVersionString(BTCARMORY_VERSION), 'version': getVersionInt(BTCARMORY_VERSION), #'protocolversion': 0, 'walletversionstr': getVersionString(PYBTCWALLET_VERSION), 'walletversion': getVersionInt(PYBTCWALLET_VERSION), 'bdmstate': TheBDM.getBDMState(), 'balance': AmountToJSON(self.curWlt.getBalance()) \ if isReady else -1, 'blocks': TheBDM.getTopBlockHeight(), #'connections': (0 if isReady else 1), #'proxy': '', 'difficulty': TheBDM.getTopBlockHeader().getDifficulty() \ if isReady else -1, 'testnet': USE_TESTNET, 'keypoolsize': self.curWlt.addrPoolSize } return info ############################################################################# @catchErrsForJSON def jsonrpc_getblock(self, blkhash): """ DESCRIPTION: Get the block associated with a given block hash. PARAMETERS: blkhash - A hex string representing the block to obtain. RETURN: A dictionary listing information on the desired block, or empty if the block wasn't found. """ if TheBDM.getBDMState() in ['Uninitialized', 'Offline']: return {'error': 'armoryd is offline'} head = TheBDM.getHeaderByHash(hex_to_binary(blkhash, BIGENDIAN)) if not head: return {'error': 'header not found'} out = {} out['hash'] = blkhash out['confirmations'] = TheBDM.getTopBlockHeight()-head.getBlockHeight()+1 # TODO fix size. It returns max int, as does # Tx. They're never set. # out['size'] = head.getBlockSize() out['height'] = head.getBlockHeight() out['time'] = head.getTimestamp() out['nonce'] = head.getNonce() out['difficulty'] = head.getDifficulty() out['difficultysum'] = head.getDifficultySum() out['mainbranch'] = head.isMainBranch() out['bits'] = binary_to_hex(head.getDiffBits(), BIGENDIAN) out['merkleroot'] = binary_to_hex(head.getMerkleRoot(), BIGENDIAN) out['version'] = head.getVersion() out['rawheader'] = binary_to_hex(head.serialize()) # TODO: Fix this part. getTxRefPtrList was never defined. # txlist = head.getTxRefPtrList() # ntx = len(txlist) # out['tx'] = ['']*ntx # for i in range(ntx): # out['tx'][i] = binary_to_hex(txlist[i].getThisHash(), BIGENDIAN) return out ############################################################################# @catchErrsForJSON def jsonrpc_gettransaction(self, txHash): """ DESCRIPTION: Get the transaction associated with a given transaction hash. PARAMETERS: txHash - A hex string representing the block to obtain. RETURN: A dictionary listing information on the desired transaction, or empty if the transaction wasn't found. """ if TheBDM.getBDMState() in ['Uninitialized', 'Offline']: return {'Error': 'armoryd is offline'} binhash = hex_to_binary(txHash, BIGENDIAN) tx = TheBDM.getTxByHash(binhash) if not tx.isInitialized(): return {'Error': 'transaction not found'} out = {} out['txid'] = txHash out['mainbranch'] = tx.isMainBranch() out['numtxin'] = tx.getNumTxIn() out['numtxout'] = tx.getNumTxOut() haveAllInputs = True txindata = [] inputvalues = [] outputvalues = [] for i in range(tx.getNumTxIn()): op = tx.getTxInCopy(i).getOutPoint() prevtx = TheBDM.getTxByHash(op.getTxHash()) if not prevtx.isInitialized(): haveAllInputs = False txindata.append( { 'address': '00'*32, 'value': '-1', 'ismine': False, 'fromtxid': binary_to_hex(op.getTxHash(), BIGENDIAN), 'fromtxindex': op.getTxOutIndex()}) else: txout = prevtx.getTxOutCopy(op.getTxOutIndex()) inputvalues.append(txout.getValue()) recip160 = CheckHash160(txout.getScrAddressStr()) txindata.append( { 'address': hash160_to_addrStr(recip160), 'value': AmountToJSON(txout.getValue()), 'ismine': self.curWlt.hasAddr(recip160), 'fromtxid': binary_to_hex(op.getTxHash(), BIGENDIAN), 'fromtxindex': op.getTxOutIndex()}) txoutdata = [] for i in range(tx.getNumTxOut()): txout = tx.getTxOutCopy(i) a160 = CheckHash160(txout.getScrAddressStr()) txoutdata.append( { 'value': AmountToJSON(txout.getValue()), 'ismine': self.curWlt.hasAddr(a160), 'address': hash160_to_addrStr(a160)}) outputvalues.append(txout.getValue()) fee = sum(inputvalues)-sum(outputvalues) out['fee'] = AmountToJSON(fee) out['infomissing'] = not haveAllInputs out['inputs'] = txindata out['outputs'] = txoutdata if not tx.isMainBranch(): return out # The tx is in a block, fill in the rest of the data out['confirmations'] = TheBDM.getTopBlockHeight()-tx.getBlockHeight()+1 out['time'] = tx.getBlockTimestamp() out['orderinblock'] = tx.getBlockTxIndex() le = self.curWlt.cppWallet.calcLedgerEntryForTx(tx) amt = le.getValue() out['netdiff'] = AmountToJSON(amt) out['totalinputs'] = AmountToJSON(sum(inputvalues)) if le.getTxHash()=='\x00'*32: out['category'] = 'unrelated' out['direction'] = 'unrelated' elif le.isSentToSelf(): out['category'] = 'toself' out['direction'] = 'toself' elif amt<-fee: out['category'] = 'send' out['direction'] = 'send' else: out['category'] = 'receive' out['direction'] = 'receive' return out ############################################################################# # Function that takes a paired list of recipients and the amount to be sent # to them, and creates an unsigned transaction based on the current wallet. # The ASCII version of the transaction is sent back. # https://bitcointalk.org/index.php?topic=92496.msg1126310#msg1126310 # contains out-of-date notes regarding how the code works. A slightly more # up-to-date comparison can be made against the code in # SendBitcoinsFrame::validateInputsGetUSTX() (ui/TxFrames.py). def create_unsigned_transaction(self, scriptValuePairs, spendFromLboxID=None): # Do initial setup, including choosing the coins you'll use. totalSend = long( sum([rv[1] for rv in scriptValuePairs]) ) fee = 0 lbox = None if spendFromLboxID is None: spendBal = self.curWlt.getBalance('Spendable') utxoList = self.curWlt.getTxOutList('Spendable') else: lbox = self.serverLBMap[spendFromLboxID] cppWlt = self.serverLBCppWalletMap[spendFromLboxID] topBlk = TheBDM.getTopBlockHeight() spendBal = cppWlt.getSpendableBalance(topBlk, IGNOREZC) utxoList = cppWlt.getSpendableTxOutList(topBlk, IGNOREZC) utxoSelect = PySelectCoins(utxoList, totalSend, fee) # Calculate the real fee and make sure it's affordable. # ACR: created new, more flexible fee-calc function. Perhaps there's an # opportunity to retro-fit this to other places we calc the min fee. # Keep in mind it relies on having the UTXO script available... the # fact that PyUnspentTxOut doesn't requrie that field should probably # be fixed, but at the moment every code path going into it does set # that member. minFeeRec = calcMinSuggestedFeesNew(utxoSelect, scriptValuePairs, fee)[1] if fee < minFeeRec: if (totalSend + minFeeRec) > spendBal: raise NotEnoughCoinsError, "You can't afford the fee!" utxoSelect = PySelectCoins(utxoList, totalSend, minFeeRec) fee = minFeeRec # If we have no coins, bail out. if len(utxoSelect)==0: raise CoinSelectError, "Coin selection failed. This shouldn't happen." # Calculate the change. totalSelected = sum([u.getValue() for u in utxoSelect]) totalChange = totalSelected - (totalSend + fee) # Generate and shuffle the recipient list. outputPairs = scriptValuePairs[:] if totalChange > 0: if spendFromLboxID is None: nextAddr = self.curWlt.getNextUnusedAddress().getAddrStr() ustxScr = getScriptForUserString(nextAddr, self.serverWltMap, \ self.convLBDictToList()) outputPairs.append( [ustxScr['Script'], totalChange] ) else: ustxScr = getScriptForUserString(lbox.binScript, self.serverWltMap, \ self.convLBDictToList()) outputPairs.append( [ustxScr['Script'], totalChange] ) random.shuffle(outputPairs) # If this has nothing to do with lockboxes, we need to make sure # we're providing a key map for the inputs. pubKeyMap = {} for utxo in utxoSelect: scrType = getTxOutScriptType(utxo.getScript()) if scrType in CPP_TXOUT_STDSINGLESIG: scrAddr = utxo.getRecipientScrAddr() a160 = scrAddr_to_hash160(scrAddr)[1] addrObj = self.curWlt.getAddrByHash160(a160) if addrObj: pubKeyMap[scrAddr] = addrObj.binPublicKey65.toBinStr() # Create an unsigned transaction and return the ASCII version. usTx = UnsignedTransaction().createFromTxOutSelection(utxoSelect, \ outputPairs, \ pubKeyMap) return usTx.serializeAscii() ############################################################################# # Helper function that gets an uncompressed public key from a wallet, based # on an index value. def getPKFromWallet(self, inWlt, inIdx): retStr = '' try: addr160 = inWlt.getAddress160ByChainIndex(inIdx) retStr = inWlt.addrMap[addr160].getPubKey().toHexStr() except: LOGEXCEPT('Error fetching public key in wlt %s for chain index: %d' % \ (inWlt.uniqueIDB58, inIdx)) return retStr ############################################################################# # Create a multisig lockbox. The user must specify the number of keys needed # to unlock a lockbox, the number of keys in a lockbox, and the exact keys or # wallets to use. If wallets are specified, an address will be chosen from # the wallet. If public keys are specified, the keys must be uncompressed. # (For now, compressed keys aren't supported.) # # Example: We wish to create a 2-of-3 lockbox based on 2 loaded wallets # (27TchD13 and AaAaaAQ4) and an uncompressed public key. The following # command would be executed. # armoryd createlockbox 2 3 27TchD13 AaAaaAQ4 04010203040506070809.... @catchErrsForJSON def jsonrpc_createlockbox(self, numM, numN, *args): """ DESCRIPTION: Create an m-of-n lockbox associated with wallets loaded onto the armoryd server. PARAMETERS: numM - The number of signatures required to spend lockbox funds. numN - The total number of signatures associated with a lockbox. args - The wallets or public keys associated with a lockbox, the total of which must match in number. The wallets are represented by their Base58 IDs. The keys must be uncompressed. RETURN: A dictionary with information about the new lockbox. """ m = int(numM) n = int(numN) errStr = '' result = {} # Do some basic error checking before proceeding. if m > n: errStr = 'The user requires more keys or wallets to unlock a ' \ 'lockbox (%d) than are required to create a lockbox (%d).' % \ (m, n) LOGERROR(errStr) result['Error'] = errStr elif m > LB_MAXM: errStr = 'The number of signatures required to unlock a lockbox ' \ '(%d) exceeds the maximum allowed (%d)' % (m, LB_MAXM) LOGERROR(errStr) result['Error'] = errStr elif n > LB_MAXN: errStr = 'The number of keys or wallets required to create a ' \ 'lockbox (%d) exceeds the maximum allowed (%d)' % (n, LB_MAXN) LOGERROR(errStr) result['Error'] = errStr elif not args: errStr = 'No keys or wallets were specified. %d wallets or keys are ' \ 'required to create the lockbox.' % n LOGERROR(errStr) result['Error'] = errStr elif len(args) > n: errStr = 'The number of supplied keys or wallets (%d) exceeds the ' \ 'number required to create the lockbox (%d)' % (len(args), n) LOGERROR(errStr) result['Error'] = errStr elif len(args) < n: errStr = 'The number of supplied keys or wallets (%d) is less than ' \ 'the number of required to create the lockbox (%d)' % \ (len(args), n) LOGERROR(errStr) result['Error'] = errStr else: allArgsValid = True badArg = '' addrList = [] # Starts as string list, eventually becomes binary. addrNameList = [] # String list lockboxPubKeyList = [] # We need to determine which args are keys, which are wallets and which # are garbage. for lockboxItem in args: # First, check if the arg is a wallet ID. If not, check if it's a # valid pub key. If not, the input's invalid. try: # If search item's a pub key, it'll cause a KeyError to be # thrown. That's fine. We can catch it and keep on truckin'. lbWlt = self.serverWltMap[lockboxItem] lbWltHighestIdx = lbWlt.getHighestUsedIndex() lbWltPK = self.getPKFromWallet(lbWlt, lbWltHighestIdx) addrList.append(lbWltPK) addrName = 'Public key %d from wallet %s' % (lbWltHighestIdx, \ lockboxItem) addrNameList.append(addrName) except KeyError: # A screwy wallet ID will cause a TypeError if we check to see if # it's a pub key. Let's catch it. try: # A pub key could be fake but in the proper form, so we # have a second place where a value can fail. Catch it. if isValidPK(lockboxItem, True): # Make sure we're using an uncompressed key before # processing it. if len(lockboxItem) != 130: badArg = lockboxItem allArgsValid = False else: addrList.append(lockboxItem) addrName = 'Public key %s' % lockboxItem addrNameList.append(addrName) else: badArg = lockboxItem allArgsValid = False break except TypeError: badArg = lockboxItem allArgsValid = False break # Do some basic error checking before proceeding. if allArgsValid == False: errStr = 'The user has specified an argument (%s) that is ' \ 'invalid.' % badArg LOGERROR(errStr) result['Error'] = errStr else: # We must sort the addresses and comments together. It's important # to keep this code in sync with any other code creating lockboxes. # Also, convert the key list from hex to binary to support multisig # conversion while also minimizing coding. decorated = [[pk,comm] for pk,comm in zip(addrList, \ addrNameList)] decorSort = sorted(decorated, key=lambda pair: pair[0]) for i, pair in enumerate(decorSort): lockboxPubKeyList.append(DecoratedPublicKey(hex_to_binary(pair[0]))) addrList[i] = hex_to_binary(pair[0]) addrNameList[i] = pair[1] # Let the lockbox creation begin! We'll write it to a file and # return the hex representation via JSON. pkListScript = pubkeylist_to_multisig_script(addrList, m) lbID = calcLockboxID(pkListScript) lbCreateDate = long(RightNow()) lbName = 'Lockbox %s' % lbID lbDescrip = '%s - %d-of-%d - Created by armoryd' % (lbID, m, n) lockbox = MultiSigLockbox(lbName, lbDescrip, m, n, lockboxPubKeyList, lbCreateDate) # To be safe, we'll write the LB only if Armory doesn't already have # a copy. if lbID in self.serverLBMap.keys(): errStr = 'Lockbox %s already exists.' % lbID LOGERROR(errStr) result['Error'] = errStr else: # Write to the "master" LB list used by Armory and an individual # file, and load the LB into our LB set. lbFileName = 'Multisig_%s.lockbox.txt' % lbID lbFilePath = os.path.join(self.armoryHomeDir, lbFileName) writeLockboxesFile([lockbox], os.path.join(self.armoryHomeDir, \ MULTISIG_FILE_NAME), True) writeLockboxesFile([lockbox], lbFilePath, False) self.serverLBMap[lbID] = lockbox result = lockbox.toJSONMap() return result ############################################################################# # Get info for a lockbox by lockbox ID. If no ID is specified, we'll get info # on the currently loaded LB if an LB exists. @catchErrsForJSON def jsonrpc_getlockboxinfo(self, inLBID=None, outForm='JSON'): """ DESCRIPTION: Get information on the lockbox associated with a lockbox ID string or, if it exists, the currently active armoryd lockbox. PARAMETERS: inLBID - (Default=None) If used, armoryd will get information on the lockbox with the provided Base58 ID instead of the currently active armoryd lockbox. outForm - (Default=JSON) If used, armoryd will return the lockbox in a particular format. Choices are "JSON", "Hex", and "Base64". RETURN: If the lockbox is found, a dictionary with information on the lockbox will be returned. """ self.lbToUse = self.curLB lbFound = True retDict = {} # We'll return info on the currently loaded LB if no LB ID has been # specified. If an LB ID has been specified, we'll get info on it if the # specified LB has been loaded. if inLBID in self.serverLBIDSet: self.lbToUse = self.serverLBMap[inLBID] else: # Unlike wallets, LBs are optional in armoryd, so we need to make sure # the currently loaded LB actually exists. if inLBID != None: retDict['Error'] = 'Lockbox %s does not exist.' % inLBID lbFound = False else: if self.lbToUse == None: retDict['Error'] = 'There are no lockboxes on the server.' lbFound = False # Get info on the lockbox. if lbFound: self.outForm = outForm.lower() if self.outForm == 'json': retDict['JSON'] = self.lbToUse.toJSONMap() elif self.outForm == 'hex': retDict['Hex'] = binary_to_hex(self.lbToUse.serialize()) elif self.outForm == 'base64': retDict['Base64'] = base64.b64encode(binary_to_hex(self.lbToUse.serialize())) else: retDict['Error'] = '%s is an invalid output type.' % self.outForm return retDict ############################################################################# # Receive a e-mail notification when money is sent from the active wallet. # The e-mail will list the address(es) that sent the money, along with the # accompanying transaction(s) and any metadata associated with the # address(es). Examples of usage are as follows, with clarification of # command line arguments provided as needed. # # 1)SMTP server port specified, 1 recipient, e-mail subject specified, # "add" command used by default. # armoryd watchwallet s@x.com smtp.x.com:465 myPass123 r@y.org Hi\ Friend\! # 2)SMTP server port defaults to 587, 2 recipients (delimited by a colon), no # subject specified, "add" command specified. # armoryd watchwallet sender@a.com smtp.a.com 321PassMy # recip1@gmail.com:recip2@yahoo.com watchCmd=add # 3)E-mail notifications from a given e-mail address are stopped. # armoryd watchwallet sender@c.net watchCmd=remove @catchErrsForJSON def jsonrpc_watchwallet(self, send_from, smtpServer=None, password=None, send_to=None, subject=None, watchCmd='add'): """ DESCRIPTION: Send an e-mail notification when the current wallet spends money. PARAMETERS: send_from - The email address of the sender. smtpServer - (Default=None) The SMTP email server. password - (Default=None) The email account password. send_to - (Default=None) The recipient or, if the string is delineated by a colon, a list of recipients. subject - (Default=None) The email subject. watchCmd - (Default=add) A string indicating if emails from the sender should be sent or, if set to "remove", emails from the sender that are currently being sent should be stopped. RETURN: None """ retStr = 'watchwallet command failed due to a bad command.' if not watchCmd in ['add', 'remove']: LOGERROR('Unrecognized watchwallet command: "%s"', watchCmd) else: send_to = send_to.split(":") # Write the funct to be run when a block arrives with a transaction # where a wallet has sent money. @EmailOutput(send_from, smtpServer, password, send_to, subject) def reportTxFromAddrInNewBlock(pyHeader, pyTxList): result = '' for pyTx in pyTxList: for pyTxIn in pyTx.inputs: sendingAddrStr = TxInExtractAddrStrIfAvail(pyTxIn) if len(sendingAddrStr) > 0: sendingAddrHash160 = addrStr_to_hash160(sendingAddrStr, \ False)[1] if self.curWlt.addrMap.has_key(sendingAddrHash160): sendingAddr = self.curWlt.addrMap[sendingAddrHash160] result = ''.join([result, '\n', sendingAddr.toString(), \ '\n']) # print the meta data if sendingAddrStr in self.addressMetaData: result = ''.join([result, "\nMeta Data: ", \ str(self.addressMetaData[sendingAddrStr]), \ '\n']) result = ''.join([result, '\n', pyTx.toString()]) return result # Add or remove e-mail functs based on the user's command. if watchCmd == 'add': rpc_server.newBlockFunctions[send_from].append(reportTxFromAddrInNewBlock) elif watchCmd == 'remove': rpc_server.newBlockFunctions[send_from] = [] retStr = 'watchwallet command succeeded.' return retStr ############################################################################# # Send ASCII-encoded lockboxes to recipients via e-mail. For now, only # lockboxes from ArmoryQt's master list (multisigs.txt) or from the Armory # home directory will be searched. @catchErrsForJSON def jsonrpc_sendlockbox(self, lbIDs, sender, server, pwd, recips, msgSubj='Armory Lockbox'): """ DESCRIPTION: E-mail ASCII-encoded lockboxes to recipients. PARAMETERS: lbIDs - A colon-delineated list of Base58 IDs of lockboxes to send to an email recipient. sender - The email address of the sender. server - The SMTP email server. pwd - The email account password. recips - The recipient or, if the string is delineated by a colon, a list of recipients. msgSubj - (Default=Armory Lockbox) The email subject. RETURN: A string indicating whether or not the attempt to send was successful. """ # Initial setup retStr = 'sendlockbox command succeeded.' if msgSubj == None: msgSubj = 'Armory Lockboxes' lbIDs = lbIDs.split(":") # Write the decorated function that will send the e-mail out. @EmailOutput(sender, server, pwd, recips, msgSubj) def sendLockboxes(lockboxes): emailText = '%s has sent you lockboxes used by Armory.' % sender emailText += ' The lockboxes can be found printed below.\n\n' emailText += 'TOTAL LOCKBOXES: %d\n\n' % len(lockboxes) for curLB in lockboxes: emailText += self.serverLBMap[curLB].serializeAscii() + '\n\n' return emailText # Do these lockboxes actually exist? If not, let the user know and bail. allLBsValid = True for curLB in lbIDs: if not curLB in self.serverLBMap.keys(): LOGERROR('Lockbox %s does not exist! Exiting.' % curLB) allLBsValid = False retStr = 'sendlockbox command failed. %s does not exist.' % curLB break # Send the lockbox notifications if all the lockboxes exist. if allLBsValid: sendLockboxes(lbIDs) return retStr ############################################################################# # Associate meta data to an address or addresses # Example input: "{\"mzAtXhy3Z6SLd7rAwNJrL17e8mQkjDVDXh\": {\"chain\": 5, # \"index\": 2}, \"mkF5L93F5HLhLmQagX26TdXcvPGHvfjoTM\": {\"CrazyField\": \"what\", # \"1\": 1, \"2\": 2}}" @catchErrsForJSON def jsonrpc_setaddressmetadata(self, newAddressMetaData): """ DESCRIPTION: Set armoryd-specific metadata associated with Base58 addresses. PARAMETERS: newAddressMetaData - A dictionary containing arbitrary metadata to attach to Base58 addresses listed with the metadata. RETURN: None """ # Loop once to check the addresses # Don't add any meta data if one of the addresses wrong. for addr in newAddressMetaData.keys(): if not checkAddrStrValid(addr): raise InvalidBitcoinAddress if not self.curWlt.addrMap.has_key(addrStr_to_hash160(addr, False)[1]): raise AddressNotInWallet self.addressMetaData.update(newAddressMetaData) ############################################################################# # Clear the metadata. @catchErrsForJSON def jsonrpc_clearaddressmetadata(self): """ DESCRIPTION: Clear all armoryd-specific metadata for the currently loaded wallet. PARAMETERS: None RETURN: None """ self.addressMetaData = {} ############################################################################# # Get the metadata. @catchErrsForJSON def jsonrpc_getaddressmetadata(self): """ DESCRIPTION: Get all armoryd-specific metadata for the currently loaded wallet. PARAMETERS: None RETURN: A dictionary with all metadata sent to armoryd. """ return self.addressMetaData ############################################################################# # Function that gets the B58 string of the currently active wallet. @catchErrsForJSON def jsonrpc_getactivewallet(self): """ DESCRIPTION: Get the wallet ID of the currently active wallet. PARAMETERS: None RETURN: The Base58 ID for the currently active wallet. """ # Return the B58 string of the currently active wallet. return self.curWlt.uniqueIDB58 if self.curWlt else None ############################################################################# # Function that gets the B58 string of the currently active lockbox. @catchErrsForJSON def jsonrpc_getactivelockbox(self): """ DESCRIPTION: Get the lockbox ID of the currently active lockbox. PARAMETERS: None RETURN: The Base58 ID for the currently active lockbox. """ # Return the B58 string of the currently active lockbox. return self.curLB.uniqueIDB58 if self.curLB else None ############################################################################# # Function that sets the active wallet using a B58 string. @catchErrsForJSON def jsonrpc_setactivewallet(self, newIDB58): """ DESCRIPTION: Set the currently active wallet to one already loaded on the armoryd server. PARAMETERS: newIDB58 - The Base58 ID of the wallet to be made active. RETURN: A string indicating whether or not the wallet was set as desired. """ # Return a string indicating whether or not the active wallet was set to a # new wallet. If the change fails, keep the currently active wallet. retStr = '' try: newWlt = self.serverWltMap[newIDB58] self.curWlt = newWlt # Separate in case ID's wrong & error's thrown. LOGINFO('Syncing wallet: %s' % newIDB58) self.curWlt.syncWithBlockchain() # Call after each BDM operation. retStr = 'Wallet %s is now active.' % newIDB58 except: LOGERROR('setactivewallet - Wallet %s does not exist.' % newIDB58) retStr = 'Wallet %s does not exist.' % newIDB58 return retStr ############################################################################# # Function that sets the active lockbox using a B58 string. @catchErrsForJSON def jsonrpc_setactivelockbox(self, newIDB58): """ DESCRIPTION: Set the currently active lockbox to one already loaded on the armoryd server. PARAMETERS: newIDB58 - The Base58 ID of the lockbox to be made active. RETURN: A string indicating whether or not the lockbox was set as desired. """ # Return a string indicating whether or not the active wallet was set to a # new wallet. If the change fails, keep the currently active wallet. retStr = '' try: newLB = self.serverLBMap[newIDB58] self.curLB = newLB # Separate in case ID's wrong & error's thrown. retStr = 'Lockbox %s is now active.' % newIDB58 except: LOGERROR('setactivelockbox - Lockbox %s does not exist.' % newIDB58) retStr = 'Lockbox %s does not exist.' % newIDB58 return retStr ############################################################################# # Function that lists all the loaded wallets. @catchErrsForJSON def jsonrpc_listloadedwallets(self): """ DESCRIPTION: List all wallets loaded onto the armoryd server. PARAMETERS: None RETURN: A dictionary with the Base58 values of all wallets loaded in armoryd. """ # Return a dictionary with a string as the key and a wallet B58 value as # the value. curKey = 1 walletList = {} for k in self.serverWltMap.keys(): curWltStr = 'Wallet %04d' % curKey walletList[curWltStr] = k curKey += 1 return walletList ############################################################################# # Function that lists all the loaded wallets. @catchErrsForJSON def jsonrpc_listloadedlockboxes(self): """ DESCRIPTION: List all lockboxes loaded onto the armoryd server. PARAMETERS: None RETURN: A dictionary with the Base58 values of all lockboxes loaded in armoryd. """ # Return a dictionary with a string as the key and a wallet B58 value as # the value. curKey = 1 lockboxList = {} for l in self.serverLBMap.keys(): curLBStr = 'Lockbox %04d' % curKey lockboxList[curLBStr] = l curKey += 1 return lockboxList ############################################################################# # Pull in a signed Tx and get the raw Tx hex data to broadcast. This call # works with a regular signed Tx and a signed lockbox Tx if there are already # enough signatures. @catchErrsForJSON def jsonrpc_gethextxtobroadcast(self, txASCIIFile): """ DESCRIPTION: Get a signed Tx from a file and get the raw hex data to broadcast. PARAMETERS: txASCIIFile - The path to a file with an signed transacion. RETURN: A hex string of the raw transaction data to be transmitted. """ ustxObj = None enoughSigs = False sigStatus = None sigsValid = False ustxReadable = False allData = '' finalTx = None self.retStr = 'The transaction data cannot be broadcast' # Read in the signed Tx data. HANDLE UNREADABLE FILE!!! with open(txASCIIFile, 'r') as lbTxData: allData = lbTxData.read() # Try to decipher the Tx and make sure it's actually signed. try: ustxObj = UnsignedTransaction().unserializeAscii(allData) sigStatus = ustxObj.evaluateSigningStatus() enoughSigs = sigStatus.canBroadcast sigsValid = ustxObj.verifySigsAllInputs() ustxReadable = True except BadAddressError: LOGERROR('This transaction contains inconsistent information. This ' \ 'is probably not your fault...') ustxObj = None ustxReadable = False except NetworkIDError: LOGERROR('This transaction is actually for a different network! Did' \ 'you load the correct transaction?') ustxObj = None ustxReadable = False except (UnserializeError, IndexError, ValueError): LOGERROR('This transaction can\'t be read.') ustxObj = None ustxReadable = False # If we have a signed Tx object, let's make sure it's actually usable. if ustxObj: if not enoughSigs or not sigsValid or not ustxReadable: if not ustxReadable: if len(allData) > 0: LOGERROR('The Tx data was read but was corrupt.') else: LOGERROR('The Tx data couldn\'t be read.') if not sigsValid: LOGERROR('The Tx data doesn\'t have valid signatures.') if not enoughSigs: LOGERROR('The Tx data doesn\'t have enough signatures.') else: finalTx = ustxObj.getBroadcastTxIfReady() if finalTx: newTxHash = finalTx.getHash() LOGINFO('Tx %s may be broadcast - %s' % \ (binary_to_hex(newTxHash), \ binary_to_hex(finalTx.serialize()))) self.retStr = binary_to_hex(finalTx.serialize()) else: LOGERROR('The Tx data isn\'t ready to be broadcast') return self.retStr ################################## # Take the ASCII representation of an unsigned Tx (i.e., the data that is # signed by Armory's offline Tx functionality) and returns an ASCII # representation of the signed Tx, with the current wallet signing the Tx. # See SignBroadcastOfflineTxFrame::signTx() (ui/TxFrames.py) for the GUI's # analog. @catchErrsForJSON def jsonrpc_signasciitransaction(self, unsignedTxASCII, wltPasswd=None): """ DESCRIPTION: Sign an unsigned transaction and get the signed ASCII data. PARAMETERS: unsignedTxASCII - An ASCII-formatted unsigned transaction, like the one used by Armory for offline transactions. wltPasswd - (Default=None) If needed, the current wallet's password. RETURN: A dictionary containing a string with the ASCII-formatted signed transaction or, if the signing failed, a string indicating failure. """ retDict = {} # As a courtesy to people who use them, we'll strip quotation marks # from the beginning and/or end of the string. unsignedTxASCII = str(unsignedTxASCII) if unsignedTxASCII[0] == '\"': unsignedTxASCII = unsignedTxASCII[1:] if unsignedTxASCII[-1] == '\"': unsignedTxASCII = unsignedTxASCII[:-1] unsignedTx = UnsignedTransaction().unserializeAscii(unsignedTxASCII) # If the wallet is encrypted, attempt to decrypt it. decrypted = False if self.curWlt.useEncryption: try: passwd = SecureBinaryData(str(wltPasswd)) if not self.curWlt.verifyPassphrase(passwd): LOGERROR('Passphrase was incorrect! Wallet could not be ' \ 'unlocked. Signed transaction will not be created.') retDict['Error'] = 'Passphrase was incorrect! Wallet could ' \ 'not be unlocked. Signed transaction will ' \ 'not be created.' else: self.curWlt.unlock(securePassphrase=passwd) decrypted = True finally: passwd.destroy() # If the wallet's unencrypted, we want to continue. else: decrypted = True # Create the signed transaction and verify it. if decrypted: unsignedTx = self.curWlt.signUnsignedTx(unsignedTx) self.curWlt.advanceHighestIndex() if not unsignedTx.verifySigsAllInputs(): LOGERROR('Error signing transaction. The correct wallet was ' \ 'probably not used.') retDict['Error'] = 'Error signing transaction. The correct ' \ 'wallet was probably not used.' else: # The signed Tx is valid. retDict['SignedTx'] = unsignedTx.serializeAscii() return retDict ############################################################################# # Register some code to be run when we encounter a zero-conf Tx or a # "surprise" Tx. The definitions are as follows. # # Zero-conf Tx: A Tx seen by itelf on the network. (This is virtually every # Tx on the network.) # Surprise Tx: On rare occasions, a transaction will be seen for the first # time when it appears in a block. # # NB: This code is NOT ready for everyday use and is here primarily to # establish some hooks to support future work. It's also blatantly wrong, as # the code doesn't match the newBlockFunctions code. Hack at your own risk! #@catchErrsForJSON #def jsonrpc_registertxscript(self, scrPath): # """ # DESCRIPTION: # Add wallets onto the armoryd server. # PARAMETERS: # None # RETURN: # None # """ # # rpc_server.newTxFunctions[curWlt].append(scrPath) ############################################################################# # Helper funct that converts the lockbox dict into a list. def convLBDictToList(self): retList = [] for lb in self.serverLBMap.values(): retList.append(lb) return retList ############################################################################# # Get a dictionary with all functions the armoryd server can run. @catchErrsForJSON def jsonrpc_help(self): """ DESCRIPTION: Get a directionary with all functions the armoryd server can run. PARAMETERS: None RETURN: A dictionary with all functions available on the armoryd server, along with the function parameters and function return value. """ return jsonFunctDict ############################################################################# def getWalletForAddr160(self, addr160): for wltID,wlt in self.serverWltMap.iteritems(): if wlt.hasAddr(addr160): return wltID return '' ############################################################################# def getWalletForScrAddr(self, scrAddr): for wltID, wlt in self.serverWltMap.iteritems(): if wlt.hasScrAddr(scrAddr): return wltID return '' ################################################################################ # Get the lock box ID if the p2shAddrString is found in one of the lockboxes # otherwise it returns None def getLockboxByP2SHAddrStr(self, p2shAddrStr): for lboxId,lbox in self.serverLBMap.iteritems(): if p2shAddrStr == binScript_to_p2shAddrStr(lbox.binScript): return lbox return None # Now that we have completed the armoryd server class, let's build the # dict that includes the functions clients can call, along with documentation. # Be sure to use only functs with "jsonrpc_" at the start of the funct name (and # also strip "jsonrpc_") and get the funct's docstring ("""Funct descrip"""), # which will be extensively parsed to create the dict. jFunctPrefix = "jsonrpc_" jFuncts = inspect.getmembers(Armory_Json_Rpc_Server, predicate=inspect.ismethod) # Check only the applicable functs. for curJFunct in jFuncts: if curJFunct[0].startswith(jFunctPrefix): # Remember to strip the prefix before using the funct name. functDoc = {} functName = curJFunct[0][len(jFunctPrefix):] # Save the descrip/param/return data while stripping out the targeted # strings (e.g., "PARAMETERS:"). Also, filter out the empty string in # the resultant list, which should have three entries in the end. m = '[ \n]*DESCRIPTION:[ \n]*|[ \n]*PARAMETERS:[ \n]*|[ \n]*RETURN:[ \n]*' functSplit = filter(None, re.split(m, str(curJFunct[1].__doc__))) if(len(functSplit) != 3): functDoc['Error'] = 'The function description is malformed.' else: # While the help text is still together, perform the following steps. # Description: Replace newlines & extra space w/ 1 space, then strip # leading & trailing whitespace. (This allows params to # be described over multiple lines.) # Parameters: Strip extra whitespace. # Return Value: Replace newlines & extra space w/ 1 space, then strip # leading & trailing whitespace. (This allows vals to be # described over multiple lines.) functSplit[0] = re.sub(r' *\n *', ' ', functSplit[0]).strip() functSplit[1] = functSplit[1].strip() functSplit[2] = re.sub(r' *\n *', ' ', functSplit[2]).strip() # Create the return dict and param list, then populate the param list. # If the parameter entry is "None", just save it. If there are params, # perform the following steps. # - Split the param list while using the param name and the follow-up # dash as the key, while saving the param name. The format must be # "paramName - " in order for the code to work properly!!! # - Filter out the empty string in the resultant list. # - Split the resultant strings in two, with the param name in the # first string and the description in the second string. # - For each description, replace newlines & extra space w/ 1 space, # then strip leading & trailing whitespace. (This allows descips to # be written over multiple lines.) # - Recreate & append to the param list a string w/ the param name & # param descrip. functDoc = {} functParams = [] if functSplit[1] == 'None': functParams.append(functSplit[1]) else: functSplit2 = filter(None, (re.split(r'([^\s]+) - ', \ functSplit[1]))) functSplit3 = getDualIterable(functSplit2) for pName, pDescrip in functSplit3: pDescripClean = re.sub(r' *\n *', ' ', pDescrip).strip() pStr = '%s - %s' % (pName, pDescripClean) functParams.append(pStr) # Save all the strings & lists in the funct's dict. The code is written # to prevent numerical confusion that can occur from pops. functDoc['Parameters'] = functParams functDoc['Return Value'] = functSplit.pop(2) functDoc['Description'] = functSplit.pop(0) # Save the funct's dict in the master dict to be returned to the user. jsonFunctDict[functName] = functDoc ################################################################################ class Armory_Daemon(object): def __init__(self, wlt=None, lb=None): # NB: These objects contain ONLY wallet/lockbox data loaded at startup. # Armory_Json_Rpc_Server will contain the active wallet/LB lists. # WltMap: wltID --> PyBtcWallet self.WltMap = {} self.wltIDSet = set() # lboxMap: lboxID --> MultiSigLockbox # lboxCppWalletMap: lboxID --> Cpp.BtcWallet self.lboxMap = {} self.lboxCppWalletMap = {} self.lbIDSet = set() self.curWlt = None self.curLB = None self.newZeroConfSinceLastUpdate = [] # Check if armoryd is already running. If so, just execute the command, # otherwise prepare to act as the server. armorydIsRunning = self.checkForAlreadyRunning() if armorydIsRunning == True: # Execute the command and return to the command line. self.executeCommand() os._exit(0) else: # Make sure we're actually able to do something before proceeding. if setupNetworking(): self.lock = threading.Lock() self.lastChecked = None #check wallet consistency every hour self.checkStep = 3600 ################################################################################ # armoryd is still somewhat immature. We'll print a warning to let people know # that armoryd is still beta software and that the API may change. LOGWARN('************************************************************************') LOGWARN('* Please note that armoryd v%s is beta software and is still in ' % \ getVersionString(BTCARMORY_VERSION)) LOGWARN('* development. Whenever applicable, the interface is designed to match ') LOGWARN('* that of bitcoind, with function parameters and return values closely ') LOGWARN('* matching those of bitcoind. Despite this, the function parameters and ') LOGWARN('* return values may change, both for ported bitcoind function and ') LOGWARN('* Armory-specific functions.') LOGWARN('************************************************************************') LOGWARN('') LOGWARN('*'*80) LOGWARN('* WARNING! WALLET FILE ACCESS IS NOT INTERPROCESS-SAFE!') LOGWARN('* DO NOT run armoryd at the same time as ArmoryQt if ') LOGWARN('* they are managing the same wallet file. If you want ') LOGWARN('* to manage the same wallet with both applications ') LOGWARN('* you must make a digital copy/backup of the wallet file ') LOGWARN('* into another directory and point armoryd at that one. ') LOGWARN('* ') LOGWARN('* As long as the two processes do not share the same ') LOGWARN('* actual file, there is no risk of wallet corruption. ') LOGWARN('* Just be aware that addresses may end up being reused ') LOGWARN('* if you execute transactions at approximately the same ') LOGWARN('* time with both apps. ') LOGWARN('*') LOGWARN('*'*80) LOGWARN('') # Otherwise, set up the server. This includes a defaultdict with a # list of functs to execute. This is done so that multiple functs # can be associated with the same search key. self.newTxFunctions = [] self.heartbeatFunctions = [] self.newBlockFunctions = defaultdict(list) # armoryd can take a default lockbox. If it's not passed in, load # some lockboxes. if lb: self.curLB = lb else: # Get the lockboxes in standard Armory LB file and store pointers # to them, assuming any exist. lbPaths = getLockboxFilePaths() addMultLockboxes(lbPaths, self.lboxMap, self.lbIDSet) if len(self.lboxMap) > 0: # Set the current LB to the 1st wallet in the set. (The choice # is arbitrary.) self.curLB = self.lboxMap[self.lboxMap.keys()[0]] # Create the CPP wallet map for each lockbox. for lbID,lbox in self.lboxMap.iteritems(): self.lboxCppWalletMap[lbID] = BtcWallet() scraddrReg = script_to_scrAddr(lbox.binScript) scraddrP2SH = script_to_scrAddr(script_to_p2sh_script(lbox.binScript)) self.lboxCppWalletMap[lbID].addScrAddress_1_(scraddrReg) self.lboxCppWalletMap[lbID].addScrAddress_1_(scraddrP2SH) LOGWARN('Registering lockbox: %s' % lbID) TheBDM.registerWallet(self.lboxCppWalletMap[lbID]) else: LOGWARN('No lockboxes were loaded.') # armoryd can take a default wallet. If it's not passed in, load # some wallets. if wlt: self.curWlt = wlt else: # Get the wallets in the Armory data directory and store pointers # to them. Also, set the current wallet to the 1st wallet in the # set. (The choice is arbitrary.) wltPaths = readWalletFiles() addMultWallets(wltPaths, self.WltMap, self.wltIDSet) if len(self.WltMap) > 0: self.curWlt = self.WltMap[self.WltMap.keys()[0]] self.WltMap[self.curWlt.uniqueIDB58] = self.curWlt self.wltIDSet.add(self.curWlt.uniqueIDB58) else: LOGERROR('No wallets could be loaded! armoryd will exit.') # Log info on the wallets we've loaded. numWallets = len(self.WltMap) LOGINFO('Number of wallets read in: %d', numWallets) for wltID, wlt in self.WltMap.iteritems(): dispStr = (' Wallet (%s):' % wltID).ljust(25) dispStr += '"'+wlt.labelName.ljust(32)+'" ' dispStr += '(Encrypted)' if wlt.useEncryption else '(No Encryption)' LOGINFO(dispStr) # Log info on the lockboxes we've loaded. numLockboxes = len(self.lboxMap) LOGINFO('Number of lockboxes read in: %d', numLockboxes) for lockboxID, lockbox in self.lboxMap.iteritems(): dispStr = (' Lockbox (%s):' % lockboxID).ljust(25) dispStr += '"' + lockbox.shortName.ljust(32) + '"' LOGINFO(dispStr) # Check and make sure we have at least 1 wallet. If we don't, stop # immediately. if numWallets > 0: LOGWARN('Active wallet is set to %s' % self.curWlt.uniqueIDB58) else: os._exit(0) # Check to see if we have 1+ lockbox. If so, log the active one. if numLockboxes > 0: LOGWARN('Active lockbox is set to %s' % self.curLB.uniqueIDB58) LOGINFO("Initialising RPC server on port %d", ARMORY_RPC_PORT) resource = Armory_Json_Rpc_Server(self.curWlt, self.curLB, \ self.WltMap, self.lboxMap, \ self.wltIDSet, self.lbIDSet, \ self.lboxCppWalletMap) secured_resource = self.set_auth(resource) # This is LISTEN call for armory RPC server reactor.listenTCP(ARMORY_RPC_PORT, \ server.Site(secured_resource), \ interface="127.0.0.1") # Setup the heartbeat function to run every reactor.callLater(3, self.Heartbeat) else: errStr = 'armoryd is not ready to run! Please check to see if ' \ 'bitcoind is running and the Blockchain files ' \ '(blk*.dat) are available.' LOGERROR(errStr) os._exit(0) ############################################################################# def set_auth(self, resource): passwordfile = ARMORYD_CONF_FILE # Create User Name & Password file to use locally if not os.path.exists(passwordfile): with open(passwordfile,'a') as f: # Don't wait for Python or the OS to write the file. Flush buffers. try: genVal = SecureBinaryData().GenerateRandom(32) f.write('generated_by_armory:%s' % binary_to_base58(genVal.toBinStr())) f.flush() os.fsync(f.fileno()) finally: genVal.destroy() checker = FilePasswordDB(passwordfile) realmName = "Armory JSON-RPC App" wrapper = wrapResource(resource, [checker], realmName=realmName) return wrapper ############################################################################# # NB: ArmoryQt has a similar function (finishLoadBlockchainGUI) that shares # common functionality via the BDM (finishLoadBlockchainCommon). If you mod # this function, please be mindful of what goes where, and make sure any # critical functionality makes it into ArmoryQt. def start(self): #run a wallet consistency check before starting the BDM self.checkWallet() #try to grab checkWallet lock to block start() until the check is over self.lock.acquire() self.lock.release() # This is not a UI so no need to worry about the main thread being # blocked. Any UI that uses this Daemon can put the call to the Daemon on # its own thread. TheBDM.setBlocking(True) LOGWARN('Server started...') if(not TheBDM.getBDMState()=='Offline'): # Put the BDM in online mode only after registering all Python wallets. for wltID, wlt in self.WltMap.iteritems(): LOGWARN('Registering wallet: %s' % wltID) TheBDM.registerWallet(wlt) TheBDM.setOnlineMode(True) # Initialize the mem pool and sync the wallets. self.latestBlockNum = TheBDM.finishLoadBlockchainCommon(self.WltMap, \ self.lboxCppWalletMap, \ False)[0] self.timeReceived = TheBDM.getTopBlockHeader().getTimestamp() LOGINFO('Blockchain loaded. Wallets synced!') LOGINFO('Current block number: %d', self.latestBlockNum) LOGINFO('Current block received at: %d', self.timeReceived) vectMissingBlks = TheBDM.missingBlockHashes() LOGINFO('Blockfile corruption check: Missing blocks: %d', \ len(vectMissingBlks)) if len(vectMissingBlks) > 0: LOGERROR('Armory has detected an error in the blockchain ' \ 'database maintained by the third-party Bitcoin ' \ 'software (Bitcoin-Qt or bitcoind). This error is not ' \ 'fatal, but may lead to incorrect balances, inability ' \ 'to send coins, or application instability. It is ' \ 'unlikely that the error affects your wallets, but it ' \ 'is possible. If you experience crashing, or see ' \ 'incorrect balances on any wallets, it is strongly ' \ 'recommended you re-download the blockchain via the ' \ '"Factory Reset" option in ArmoryQt.') LOGINFO('Wallet balance: %s' % \ coin2str(self.curWlt.getBalance('Spendable'))) # This is CONNECT call for armoryd to talk to bitcoind LOGINFO('Set up connection to bitcoind') self.NetworkingFactory = ArmoryClientFactory( \ TheBDM, func_loseConnect = self.showOfflineMsg, \ func_madeConnect = self.showOnlineMsg, \ func_newTx = self.execOnNewTx, \ func_newBlock = self.execOnNewBlock) reactor.connectTCP('127.0.0.1', BITCOIN_PORT, self.NetworkingFactory) reactor.run() ############################################################################# @classmethod def checkForAlreadyRunning(self): retVal = True sock = socket.socket() # Try to create a connection to the Armory server. If an error is thrown, # that means the server doesn't exist. try: # For now, all we want to do is see if the server exists. sock = socket.create_connection(('127.0.0.1',ARMORY_RPC_PORT), 0.1); except socket.error: LOGINFO('No other armoryd.py instance is running. We\'re the first. %d' % ARMORY_RPC_PORT) retVal = False # Clean up the socket and return the result. sock.close() return retVal ############################################################################# def executeCommand(self): # Open the armoryd.conf config file. At present, it's just a username and # password (e.g., "frank:abc123"). ''' Function that sets up and executes an armoryd command using JSON-RPC. ''' with open(ARMORYD_CONF_FILE, 'r') as f: usr,pwd = f.readline().strip().split(':') # If the user gave a command, create a connection to the armoryd server # and attempt to execute the command. if CLI_ARGS: # Make sure the command is lowercase. CLI_ARGS[0] = CLI_ARGS[0].lower() # Create a proxy pointing to the armoryd server. proxyobj = ServiceProxy("http://%s:%s@127.0.0.1:%d" % \ (usr,pwd,ARMORY_RPC_PORT)) # Let's try to get everything set up for successful command execution. try: #if not proxyobj.__hasattr__(CLI_ARGS[0]): #raise UnrecognizedCommand, 'No json command %s'%CLI_ARGS[0] extraArgs = [] for arg in ([] if len(CLI_ARGS)==1 else CLI_ARGS[1:]): # It is possible to pass in JSON-formatted data (e.g., # {"myName":"Terry"}). This isn't smart because no armoryd # commands can handle them. But, just in case this changes in the # future, we'll decode them anyway and let the functions fail on # their own terms. "Normal" args, however, will work for now. if arg[0] == '{': # JSON input example: {"Ages":(10.23, 39.21)} # json.loads() output: {u'Ages', [10.23, 39.21]} extraArgs.append(json.loads(arg)) else: extraArgs.append(arg) # Call the user's command (e.g., "getbalance full" -> # jsonrpc_getbalance(full)) and print results. result = proxyobj.__getattr__(CLI_ARGS[0])(*extraArgs) print json.dumps(result, indent=4, sort_keys=True, \ cls=UniversalEncoder) # If there are any special cases where we wish to do some # post-processing on the client side, do it here. # For now, no such post-processing is required. except Exception as e: # The command was bad. Print a message. errtype = str(type(e)) errtype = errtype.replace("",'') errordict = { 'error': { 'errortype': errtype, 'jsoncommand': CLI_ARGS[0], 'jsoncommandargs': ([] if len(CLI_ARGS)==1 else CLI_ARGS[1:]), 'extrainfo': str(e) if len(e.args)<2 else e.args}} print json.dumps( errordict, indent=4, sort_keys=True, cls=UniversalEncoder) ############################################################################# def execOnNewTx(self, pytxObj): # Execute on every new Tx. TheBDM.addNewZeroConfTx(pytxObj.serialize(), long(RightNow()), True) self.newZeroConfSinceLastUpdate.append(pytxObj.serialize()) #TheBDM.rescanWalletZeroConf(self.curWlt.cppWallet) # Add anything else you'd like to do on a new transaction. for txFunc in self.newTxFunctions: txFunc(pytxObj) ############################################################################# def execOnNewBlock(self, pyHeader, pyTxList): # DO NOT PUT ANY FUNCTION HERE THAT EXPECT TheBDM TO BE UP TO DATE # WITH THE NEW BLOCK! ONLY CALL FUNCTIONS THAT OPERATE PURELY ON # THE NEW HEADER AND TXLIST WITHOUT TheBDM. # Any functions that you want to execute on new blocks should go in # the "if newBlocks>0: ... " clause in the Heartbeat function, below # Armory executes newBlock functions in the readBlkFileUpdate() # which occurs in the heartbeat function. execOnNewBlock() may be # called before readBlkFileUpdate() has run, and thus TheBDM may # not have the new block data yet. (There's a variety of reason for # this design decision, I can enumerate them for you in an email....) # If you need to execute anything, execute after readBlkFileUpdate(). # Therefore, if you put anything here, it should operate on the header # or tx data in a vacuum (without any reliance on TheBDM) pass ############################################################################# def showOfflineMsg(self): LOGINFO('Offline - not tracking blockchain') ############################################################################# def showOnlineMsg(self): LOGINFO('Online - tracking blockchain') ############################################################################# @AllowAsync def checkWallet(self): if self.lock.acquire(False): wltStatus = PyBtcWalletRecovery().ProcessWallet(None, self.curWlt, \ Mode=5) if wltStatus != 0: print 'Wallet consistency check failed in wallet %s!!!' \ % (self.curWlt.uniqueIDB58) print 'Aborting...' quit() else: self.lastChecked = RightNow() self.lock.release() ############################################################################# def Heartbeat(self, nextBeatSec=1): """ This method is invoked when the app is initialized, and will run every 2 seconds, or whatever is specified in the nextBeatSec argument. """ try: for wltID,wlt in self.WltMap.iteritems(): wlt.checkWalletLockTimeout() # Check for new blocks in the latest blk0XXXX.dat file. if TheBDM.getBDMState()=='BlockchainReady': #check wallet every checkStep seconds nextCheck = self.lastChecked + self.checkStep if RightNow() >= nextCheck: self.checkWallet() # If there's a new block, use this to determine it affected our wallets. # NB: We may wish to alter this to reflect only the active wallet. #prevLedgSize = dict([(wltID, len(self.walletMap[wltID].getTxLedger())) \ # for wltID in WltMap.keys()]) # Check for new blocks in the blk000X.dat file prevTopBlock = TheBDM.getTopBlockHeight() newBlks = TheBDM.readBlkFileUpdate(wait=True) # If we have new zero-conf transactions, scan them and update ledger if len(self.newZeroConfSinceLastUpdate)>0: self.newZeroConfSinceLastUpdate.reverse() for wltID in self.WltMap.keys(): wlt = self.WltMap[wltID] TheBDM.rescanWalletZeroConf(wlt.cppWallet, wait=True) for lbID,cppWlt in self.lboxCppWalletMap.iteritems(): TheBDM.rescanWalletZeroConf(cppWlt, wait=True) # We had a notification thing going in ArmoryQt using checkNewZeroConf() # but we didn't need it here (yet), so I simply remove it and clear the # ZC list as if we called it #self.checkNewZeroConf() #del self.newZeroConfSinceLastUpdate[:] self.newZeroConfSinceLastUpdate = [] if newBlks>0: self.latestBlockNum = TheBDM.getTopBlockHeight() self.topTimestamp = TheBDM.getTopBlockHeader().getTimestamp() # This tracks every wallet and lockbox registered, runs standard # update functions after new blocks come in. "After scan" also # means after we've updated the blockchain with a new block. TheBDM.updateWalletsAfterScan(wait=True) # On very rare occasions, we could come across a new Tx in a block # instead of seeing it on the network first. Let's check for this # case and, if desired, execute NewTx user functs. # NB: As written, this code is probably wrong! We only care about # the active wallet, but we're passing in the entire wallet set. # We probably ought to add awareness of the current wallet in the # daemon. Be sure to get the initial wallet and do post-processing # when a user wants to change the active wallet. (For that matter, # we should probably add post-processing when adding wallets so # that we can track what we have.) #surpriseTx = newBlockSyncRescanZC(TheBDM, WltMap, prevLedgSize) #if surpriseTx: #LOGINFO('New Block contained a transaction relevant to us!') # THIS NEEDS TO BE CHECKED! IT STILL USES ARMORYQT VALUES!!! # WltMap SHOULD ALSO PROBABLY BE CHANGED TO THE CURRENT WALLET! #notifyOnSurpriseTx(self.currBlockNum-newBlocks, \ # self.currBlockNum+1, WltMap, False, TheBDM) # If there's user-executed code on a new Tx, execute here before # dealing with any new blocks. # NB: THIS IS PLACEHOLDER CODE THAT MAY BE WRONG!!! #for txFunc in self.newTxFunctions: #txFunc(pytxObj) # If there are no new block functions to run, just skip all this. if len(self.newBlockFunctions) > 0: # Here's where we actually execute the new-block calls, because # this code is guaranteed to execute AFTER the TheBDM has processed # the new block data. # We walk through headers by block height in case the new block # didn't extend the main chain (this won't run), or there was a # reorg with multiple blocks and we only want to process the new # blocks on the main chain, not the invalid ones for blknum in range(prevTopBlock+1, self.latestBlockNum+1): cppHeader = TheBDM.getHeaderByHeight(blknum) pyHeader = PyBlockHeader().unserialize(cppHeader.serialize()) cppBlock = TheBDM.getMainBlockFromDB(blknum) pyTxList = [PyTx().unserialize(cppBlock.getSerializedTx(i)) for i in range(cppBlock.getNumTx())] for funcKey in self.newBlockFunctions: for blockFunc in self.newBlockFunctions[funcKey]: blockFunc(pyHeader, pyTxList) except: # When getting the error info, don't collect the traceback in order to # avoid circular references. https://docs.python.org/2/library/sys.html # has more info. LOGEXCEPT('Error in heartbeat function') (errType, errVal) = sys.exc_info()[:2] LOGERROR('Error Type: %s' % errType) LOGERROR('Error Value: %s' % errVal) finally: reactor.callLater(nextBeatSec, self.Heartbeat) if __name__ == "__main__": rpc_server = Armory_Daemon() rpc_server.start() armory-0.92.3/pytest/0000755000000000000000000000000012414772654013160 5ustar rootrootarmory-0.92.3/pytest/tiab.zip0000644000000000000000000234022312414772654014631 0ustar rootrootPKQDtiab/PKSDtiab/1/PK! C-qstiab/1/bitcoin.confENAN0 ]TH $MmjGCI`=>Y x XP@N dbU]x=R]jF Eoā:;bAbm <6 Fv{ L](צϽ(XH((߻]?"jo4H.JyNs?6TH * M 7Xm[+ m;'+ nvE gv.A )[ V..v.V/\_RXZ9xyRXw@1Mm<=aGl1ê RrY@Yy+J^+!Y9Z'4=.RO1z*[(¶+;H\߶Z-ҫPT'PO#^YiVR/ YgWҒg/!5%v<_ VS9o\)л}smLmAyF` DL-UY&;D( =m2m?џVGq)M4Vv,}WJӋ\)MdfAB{DdvG1F' PQ٦YtWe"%/$J0`Tqަ(XT/6{p l khځ^Ebt ~C/wߏɴgN|f$6C+>\L>`nYٓf8N7f(@gz@Um+J c Uq~I|J/I @wAw#ZJ* 1Lv}`t3̀bZ JV!U Bt K1S]BY]xk/RNdUQ@4 l>KJڴR#Q_3csYy}ӷ!0Eygp'wp$W2>Nt- j:.ܣSCc7|{ T }r7V)Ŕ~!E50Q5،#r^B٩y22]B.Q@XS@#hO0bmŦ5K Z8*[ЖtelV@)EpbVrӅb։K)fa2Ҝ|#4f%EVEQ̢İs[GQ@>~8~m[G4n^bj% &Uw\*0q͘wuMX]:J(f7- Zrܬ ?G:?sZae֖_zhc u_.c7ڢƷ> <HA 0 W"[=eu%HD 'G\:=q8x-=$$ .{SXLhu'uKzB@@I9 UTs7ϝ?*v4ΛE饏(MM9vu AۓA>zCewF"ox"SafbڧW[b ) ]Vl?N&|X:vB&CV['CߙJ}lAC\rg`*&5<ɩOIs`ķee~s"I|MlY%x$[pzj f0V+ r),PyFmkͪsGms w <8mHd ꁨ #7J+ &ڎlЖ+eZ pMj0E|fh{5%črTߎ<>8'Z|nX'΀׏$xV C *Zᵡ*@Ó_A:63PMmz$Я@Bw/8ݎ} XCk;N/#/ B`RNA8y뼣e{{(m0*h>4Um+LLM\&,}}!_| s nS_7L]7j*|rwbwu ivvnMqخ:?L7#:Z`=K響?~Q}!`kA)h2 K֫ GL^~nKFvue4VښH~}lJ^JAf}a c;t|s ѿSPQX4+y"6AB`T%˾ PCv\9)ce# B C~ ;;df` թA}?'Ji#])^z*KCB Fe֝I0[)4ΉܧaFOQ>!<+)'A<)xQp=Y>YyF\10 jKE1Cht#T! \yw?Q^8MJyܦSVo jM*"E@oثټw}a6즂-=FKj_̭XrnG5%$"G}qj?S7 T;˟7i$&,]eB>B|Jf=3h []~2zo`B4Bi_0" l}>AB D!MGdH'@{}M"V{BPQf\dlsENƙ ϽB\dU9ְAK\,I sra{Ռ!!5~X@ 0%s:E:uK/\eР\ӭZ8]C=[ыSò@ߺ+o6vp"fu8Ӧ%˙@:ty.GB6$R30G*UK]AE_RC ʹo'SDBcdZpdÈV,;ɜMLlAdÖks$  ߟxQ6_ܤANGgڟiC-@yrʱ:V_M,mZnmwUZ˽ +^oةZVG s~Ѥ!!mBsӇFPyZ̓ 9vwh:/跷ӴPĉFwk5'&f뙑/Sqc pfn7 Uj\H]0@WD,] ~zCR /D oxI}H 7ј|$Cᝊx6pjb{k(hq'DŽ`LJ Mc(<;cc/ FE@ 'oj}p!^[3ܡ[CdZS.HEq|Rn_BP*1P|i2~&^?4n !P!ip:G!6EYG;v (*Ā,SSdiď#1䢯m_V+(y||zHW42tgiPMSf-oyFtMmк%/t+PN+#O+fB@OIӷs-U_4)zjDZLv#%}z)[\g4f ObzwOH @$*yaF 6LHKdbAYR8mdm2Ъ -n8=[ I +MQ`VZtMqy'?-Ph6s (1fF~OvhZcrɛ+B;[s5#TpǞ4>O0낣1MKUHY·vqίhWꞐ KLI|<ʧKYf8 9\?l@-',·s:`2ws~h%WAoӬpܤ7'L!X@|z(zSYZ1pG%o5"V"vӲ@xPbke!Y,Hadb7hkZ}&dK_l).6߇4}U]P?#x$pBB``O9ã\Y.|-[=OwI#@P+(<0c[R$^Df?U2%%uj6eLLoh|˞lMHM/4Da#Qr3FdR- }ۙ,!!<ë)V:6y#Y>,0{U yRlpF|s(³A򏥵韂ؓ=jHLD0>DkʵEg'|èݒB( SUG#N1_m"hE1ٹRoLzRB.G+VωaJO-6an)r1 d}N U]SwG8` Gs f+Q2 #Acڕ$E3 c-2TRYjgBKS9EszY B (\-L߿xP&6NlG7֫pt(Ur-ݽI;."G|}I$V#0.ч9-cux*MA*!L:G9!R9qɼÂ[ޯ{X`TQn~72jYP%`j11#SDFVE- }`6i?ާoйSkl&u8{Q/Xl@&H`y=j"tv!"V-u!h25!J' f^!?xh$M_Z+8Q@4QX˺a6ڗ?~PFWkԡl6|J*&abkUa 2f%RREC7/$y]%C5M{&U?PI%SYWo:DG8 hm08v0c>X%!LiW+l5`þ!fƛu Bh!P+S?J$ m4퇍QbPњvYut2[q+c36 @ZYd_ۄiU\I$MLx\3^4_'f`}$PJ-@B.BpVei8x(ƴd-[4BxljMf:<H빿*CBŕ sX ]#[&,B'B"3tKLigeoY{RyT5|>A'DJ6,|Xq1H`녞&Ҩ;7IS AiI$;G1*߇Ang9}~\C/΁YQ1pfo-m#dUr}Ӥ^?mTCBQeS4WMlv Uۤk4fX1n5Sg٬/žH1'k 0GuFue] :ϻ[y)Poya/ R^cT&#mZe~MZKڟ YT{"?< *Eth͕*kZs fwI$*P L юz!gȉ iNz_En1M7ioEţ 粨⥱*^(T |Y&s &t^yIv9lǼ(q寧^Hvm?>~y ^/sT}k?V[H6´cQ /1}#s砱uu3H!¯o]ݮlL7^hRj<B ڨzj[$Y, %MdG|>.r|Bl?/iMV2ψpz gS BNa43 \t6tz;HB``zj;!P땮\it`\!ܱ!z*QF[̐(45b f+$Џ~ -eqئ˯'*$a @e6UCQsx[䉼w=oTAlVVYUdWR~!sʴVqX<4au%Γ{}H][Ft%-\ ӼK5=l:T+Pdaez15yhxXw^Ee)*ѪGV׿z 0b0k3WQ-LIesL>?w"Foj?ΝDdr(بV0?PWsvڹ,6Bqvd'>'TX5jyvڈRw6]|&A8F*WNB:O-$1gB^ J~_V5zTfX~.0Zdvc MOiuUK. 9o Nn&,B'ݝ\% J.׈ZFY{"\XCq =2vR 8B@sm֨lYQPo"J/*? ?d}y=~s젵n*|O%r2$0OC̓ۄ+keP'Z]GԎ#bspD_zI<)kŀJSm7Y{8z;tm5Ӣ% ~ (H2``D8N w2 Y 7w_!ؤɳCgu`nR;)0g 4ae37Q\8BlP|ONaH -P!!(\zI$epk eWnAS4 dyC]kN*WҶS,s7e !C7IJb&%Պ{a Q @s!6ɹJ~K#ւJ^J΅tj;?Ԏbfu +w+0mr(jm0ypDd>窷]tx&$##KOT_ w\g), ߋ=j6xzq#UVR-Emmt֪AѼ5Ѥzl=Ӝ8Ⱦ.HU' $bS~7nĒ" Kk ]$?NYܴQe)2g;hX -#C./I:HO AyӅeO5[m{BbRMEaU "N/yt|R٩&5&3%/>= f˜XBHC{O,||]S!!-y x DvO_TPTOCg62wRZ݁ٮM(*-Xg$wse}kGvnbcn5hˡm?J!!hTroG%7b%3Ki)f(٪< 0 P#\5?րk(eԖjm@m@N'UbG7$Mm%iխc/m_3|k^+a&!핏K"S *c/+$6sxj,1'?P S~4v$N'};|/}!!h| Z2WދH܌1ދ8g ٖ&&vlĦI~>/U7]3 > mYKm6[SGXutV7&=R6!:^ y(m:l5ň{z4d;\Sԯgatr(DVhuQ|oVu QD2>^䄬l逤vĊ i9{AXe9܄6n%Gy.7>$w4<8RVg6`_4##b(ZF`ߝwBEQ[ p70{D#$]<7/ Q nWfO_G{^ӀtV a񇵶Mz7Co'ے{oŎY Ɓ%5zTu/XCaqS]*'v X¥`_ `vbΛN:9m:FTGWm'-g"b)9ZgN50}`+ߡω/gs2wmMiNe!4L;>GܱT#+lźiϘJ(͡fxaTsjsz.z![A~ Ƙ7bmJٕ2 nyBAdmȇ<$⭱'$٘͂ qϋ66To VQ2w%;٫1,~tk1ǨDoR=C[T3@B0!ß-+C7)4>} zF»e'f焔_EQ\t쉉)3^CGĚUZ4tL *# zd?љcXe5퐒F2ePo0+AsKidqxo]Bpp/._ nnյ"S%Q5_C p(cg0,WQhz)$p/EJߝ0Εz5QD"$]m f=7#ǏləPW躞Jj]Og2D -fd+ϜW6.rq3e.ݰ@Fͧ#$y˔?=q H!,sj]p M ύT3^cw?-%4!!`ehF਎6ߩc{dE'2~BH(Uc; aV!/S5n[d>%f߹7Q5kIEx7$h'4^n"MSV:Ga1@M1oG8/.Q ~DtԢf_wv[P] x?oەMjpZ/H1)R9-?MV/|uBpY@bQ*Th:}fK~ rGJD%9}S-S9{"PA4"YkU\J~v P֟,s1ж0#+ES@" E)B]"8zG \Fܻ][;㉍G1)9D=UK3x907j3zc%AVG،ZS /Ce{Ad'e_ZVd?So X1_'mbuJtD1ݠǦ%ET ȂZyIyM #dIwrG;_U~' !Dۂ-yNG} L]GFdz4P\9Z;C'|DtU}RV]60%#Tzjz$)YP Ik . D 8sjtmt-;`\gfikP=A{zM6.޵u7|={ ebvQKp:<" zl7oyeh:IU|}_Fp?f@DȯSͷBli{payG,nƅSπTΉa|{|OB0$=տ&v{.z8/K#-t)II i;C7;{k3gy;9Vlɡ1n^eI Ontj,ц׉}Z./sjK㡝 $?m>B.LO6=>!0w|l=[cEC6I\ƕ<X\DMUіu!.j(Yi\) f#vp`!Z ڶK`,X Wprּ1PXA9kGJP K_kFTVeb-I\1Cp\91!7Fr-`^OOA6'bFC}9)y[Fux;h@2W$:d#3ܣw37">"! rܝbB`n\h~\¯qXP:9Nn-@et*W'r[e7ӐaN:7T&.0ࠠJX?#EuGVrہM0`#)!pMHlN?s_WPN4/'3",;_ %?Y>r73 ^,(̘MⒺ'uzCxᒴLb愅*}VDž׭FFO.{xreh^$[?WXi,kR~w/5. ۓk*"5;Dbc0&OK{W!X3k*'>@A_+{X7_Ӑ!%Oâ 54A= MSNBlRCL׎N 9e޽O|E*,P-QsT{m|o*( qBƱXQ2CCWg6CM@[olٿ O$xOȢ]pÄ~9Yۀ ĪsܬF9}ވrA%xzP؟7EAl-'A7쯥<^ ۩8ݠVO\2a/[GuGc sF琯/)Ik"LxSgM$\{R_OO&7 ԅHɃ5:n±BvAVy(9쓅ʥ/<0T]vk0H;& )0,xZ5;@n8& df,9j7Io/سe6DQt8 _tK4 D+a@D@0<7TmV)H/wO2w͛[wȜ 1Y$l L^>9NWw M.Y}%jX&I9LH*Ў;| .s`wUOT.@1>45Atc;˸W9ETaQ?ǒe:V1q}BkQ`“.>X6$g )K{Ӯey]8y, >@$ Xn&=ǿS֟gدq{̘ԌYeРW{/9&`X,U[X|o(RIq,ue.]ng9dd^~ǧu 5؈ҟ};.<`hgG^_FSŞl.ܶ : }OP?:3ً˜"{tX1~u=N A3g/\?(ue c^Y ()W )[=̣":Q&t\e9),D'޶>2'VK}i`dlz"{΅2ޡkS_P=-S]B ya6/eG'E! !Wy\X6a26Z#3-/yqՊUw-mvC0ϝ'q4$o&Mpw旔Se~Qt;k7;ӟz<b3]%`չz5[˱O>NݬPz F2Dpȫo?<T"`sˍM\sv/\P 6$y& @oԇmL͕^%BVvD{ $ j4CNv;!*:=HWZ @YT"#YzTڟ3z//c:qXX >g狄.VYMJhPBxfKBլ?m0˥Z*OncqNfk5g̟Vl>yzN4h/yIŽsbOYΊjQ]f-6NNb@c[Oa䧫2W`t1ŰKAx}+ahx͊_3Ovă?{z.XԔ$P?\Qߒ?FJl\ ʖ $x{,0D`yt.nxpYZl r(7繥lC||>#Gof'y [D`6) k:x/뀫ޭu\g*Gh"ݤ )Qm`Go\GWJ$E]䠬|ȳsgvHҍL lKc,ceQmGWwi˻rL#ux}  uj&gy| B-H[_VrN=)SvEp"K (@T['\ȳ!Gp֠mׅ?ɂ,D,ew/R#spt [ۣ $:fG-Lb2Ύmg{d'/Lۗvd[L[UH`LX"Jl ́7t`(j(Os=/ |QG?oG|t]I! ۾q\TfsOܛE<r.%}>4qf]g`x? t`ꃷ+r]O "rҫA)Sqf\YŕuAƙ[|-ӧoKRUY*Tvs3flL<'2E CQ؅2荏"uGX e%: TwѰEdKņl!*{@Ƿʡ9qUGؤ ({鷟2{OfĊ *&>P`]Z' XI"Z,bE,^|(V^ wȪB߽BozXAT'ڱs(bqQ kmˬXYj`l;,H>J{יWý3="*1 ܩ Aс1چti=qBPyNPV5SS|Qص[lE]˿2+f|"j\@X QP%^f>mn]% _Ez[gﷂyO;Ib4`^^u5y^3;һ^Ys2_ĉ?.a1DC;Waܽ!]żT3)]]V810PNQeW݃lt Ϧ8gmO1YPe3{S6VE}z YR*.Lҽ׻ ÏJB*y0k}pӇ.%S }8# Q<$|rfxBdD8OGx9'#>aw"M O  ugC iqq2 CF=sXqiѐ{@4yڈP7[bVJ n( Be5iA[GmR‹Zy,X{eo 4s+*y5իAsxoϟ/ 2'*MbDakpQ[}e?ϯF/c3ښD\ =>~4]ax _vjiC[]5eSgfsH  i/gCpL@Wy?B r:4C1 y.F\f(}}{U 6 Hbož??ץGE ־bџ+kaC&;}j^KLl~"_YBP|^DTP$(A*?d'g?U 2|x"8?6$$`8׀LzR*[+ RӿF(F29Ta`7\2+1@ZcԳaQeG? / m|]Sa]e6.bH>/ ְĘ]7ÔJ"|}׈?$aȐ^7;Jh[ {2ZP %i녳,<[7\\ lga+:+2%S%7!n1#,eKV)_n0YTG&12oTHk?#eEJ΁'EItכ)Ɲ#^K%dX I8R(ׁB$NԱO9%{,0ik@N:{_o8ӡ~촏|g (˖N/Pare50- ҟǎC*`_ʧ#7Sp\_/z0 tW\/4z a{JSd-8ܖxةm#Πl[;v1U[-xa-m) Ѩ.пZ`O}ުGb3w@0UҬBޝ3KO9ddCQڥ_s_!%#!^N ]M,G =rO,]Ho&Z^7y; 0R :0Ze'sirX?y%!ZZJԼd^u\s[5t3i\[e@^J8&4| B< #Y0>֢05Ҡ5RlvV%^fhјKB&7=sV17ky} CX y۝r?VS)ˁ/MmߜK/AT8b(ә$f V𴝌HeȊIWxq I ؉ x HoWa/_żbǏj+f s:O! V-*HLHx1 9 (Kō.#Fr=͉+koygMC.Ҵ7rC``fn[ЕfP=A>GSylv朽Q=3m6'(QyΌ3X͒Bewj^nџAKX yMa+g uitlkl? Z= ! 75H1k+k"Tl AYOenieػ5f){JnG\,|5P4ޚDۓ8iwu\-e' 3"\N-=׸v ڹHMn^(۽pJ.R̍&`#+zneLZ l@m4Pr-{>yTT:?wX3a }2Z,{.n=-VNLYY{LɼS n/UPn$2O&0lp4cс8b(e5fVyB/OBo6x0 F89((9^!v.:(Eo뤲$+|p<ɭa'ap`),"RNr=-E]OWxCo;[gh찛! ƂI/>K b=,_z~ܘIRJNE kZ,L= zV qn6چP }틐BRX͛㟟䉀4JdFO8 L1(F:2gU"e "izN9xLxE>Ӥ0E@Lҕ|!vB#0o:C(){gK, [? eLl1Tγvj@IDP\xA:,R봐#HMn'.kZy%~JWc޳DHz'"^ۅB*7ΧEm-n!q!~ټR(H6UWTpP*/ӘiTR%ug%Y1>Z+P_med#Ԑ,OYxk0'9aHb xPg]?C^`)zaq֨q"qJRsdqX60&P}nnXAGZP Yq*sNū젃M/í °ԭ (JR-jJN*o}T!p R_wlEؚZ9,gKC+V}2a"6HF* O3 Hda cBUKKG29.mS:OaRK`fj%ntؚ:F ]C@? c'B4ü{VWVs܆@Os1"AӗFAq = ,JnSk~, PVB?}˸l:$1HʆX'8[D0=Q1|wƬp>oxAaI%+(@5]bV8(9} /[JP|ḵi11m6p[6H=:܊J\/:ASeXf-D!8&˶q 4W}oeI2=*ύoys* ]pS<)?Z4`Ck{P1=a F::'$nXt0H֏(UD𔭗Ƨ#J1GF?m P嶼dИ$0nt>VQ<ޠ^Bր:(IYQNS)9Qq1Y<&VűM8ƀm`3LVR m  ~u37멣ԙwO | l|뿄W LK0?TM&{݇W7oפHZcF\uN^/G/,6}~G:= tUM|xS½Y}y"prb5<ۚ{n_U -YzDs'Zw~w[Lnl@c)6'p\9UAJCnf)7/'zHrHVmm.`|5:JM0#gj_@!AHldBi[pWw^՛7PKR0ǚƗۦDOђv@ǰ[ZYDcX\g<2/呠T6(5/oMc&vu.56bțbJ]kpzYQΒdQ蠧dI_@^V"^HF!wS&t(&tT2?J)g\]=y`1tA+ĤpnoVL;Ǻi촕Od'8©p!1˺ץrRV߮ܨhwtAÏҹΕ5gyo\*nبV>hEQb,Z~aK/jP(й^eSm1&jhڵ\MyaxGB9*4{JacnBؘUg&6\6`LBj)]k-ڻȱ6pĶ1Mt`:'}%zT-,&I)sCw#= n,@i /5-V@UY jO%(-l%` +@qeF22a_A#zsC/5 >v%j pX]~;,+߿JW!Mf.LorhP6|Vv:û-jVZF[qoX4FK+tއOb }(En5+.^m+z?)Ŕ!  //(/l|z~Ե.3]~:AQ2Ose"LXRbcKDBPܐ%hه-'üV:~tΡC |h$P v{;9|6P0* ]U_w\#Qj<+8X #8Z(5s5N[Rd$qh6/!2T$~wuG;Kڿ*ox08^Zr^D5Kz60Fb~/ݼtC2\}uɳ&M]s˵ap&ޕM*s7tϑƈuD(Y z!J>OxQ1?3Wn6FPKb~m`hA疭0EBC}+gԺ]>w4?V]θ/7K_c /ɳ󹁲 ;gKo} 9]=`W&EX`1CR3}=˦ }y2)p|U{Mʙ r}Pc}i2iZ;{73E_Ŀ{!/e*aJzr1vBМ`=:p޻&]~ۛ[>P* O{s+~&Bb?^gJE2Q\yaXn#aD. API0{h,p&P-L 6H2|zz͐B*Oᖨ\`wcř%dC {Mq cQ*llI{\PyI8_8$`X S{_cwQEX $gh'nBD`rddcEYs8ό=W"֩^u:Hl7 ɽ]w?X P 8k0 vNs'_T#'J{EZY|& x.r>O̭WymZvh#wr}-6 i CnT%Q$P+7 Iprk+Ɖ(A 8À|/?cs6z}l7[RG㣫={)wJ( iT]}7ُ3`UyBϐa?Kd8rK/I~`}vBZ-b#[cC Z<ˬ2w9DJ_MԿ0Ҁ2 Cael2>Q_1(摨*"tzg^P=Ap^.֮u -9rD7TF- =)0TOs<ӕ?guhޞ8m(,v]{_ ?*ހEYQ8EC8EX畗f#Wk/W-GvG8(H4wIA;Y$<|d݉TI fџo3`ڀ{n;Fwd*Pn , #<̠|Qty`&r&Iq1f(~srCO>^^Aيx)M_C5(L #یQWl2=s2<د:GmWp3EƦjb\LZŔO?dxjL[8E3 褻%C-^i$m2W}ZBgТ訾(Ix•Pe$ޱ]# Q<6yOxt3A/\̢tv}A!'oJ' o.]0BR@\٨~@kwu+"xNnݼG-mô?G]nwg*\]6s`gcDXp7tr%^ֲNn!k]=j^9ϜR`G\ȸs磬dHvQiZO,^tK׌TzN4v7&P}BA<"(eTZ͗z{ AbAZß>Er"q?Ѕ0Ar07ZIӬ8һܠ0sĔf ƖJ(*; LuN876Jԗz3RZ›a溘zxfeT¤2XnpWX#vo];#D{}GMm߽J ~|25I?Q=_#:X@(Vͩ DK[qdfU|);\%ל北ERah*~m"e;XUMyz/,T0񛋈3l2W:[9Ş8 L"M(};jdOE'Q,259=^w>\϶B-){ ZΛ{vmjĮ>0ԫ]9+e\@ǡ?,ҏ*nHU[DҝoM%qx=N x-![ŵ8&K ?#ı˦aBa27: JƄfSΕ!m=O(?jo}R=8ק:{1ՅN\xJ) ?wݎRb#+1M }.9 ŶB|z^>lid/Y^_w WSEir,;N6lլͬ䦂0맬VhyP Hrs=yG?J:=y&V1rbd|Cl e'+}aV/PS% Q"X4Wt*Տϲ+-J63&1\\Du1ȁ(*7i5.9˔ue , 1{x6t*UfE?QqeW '.^TQxf+pw#uQ,+/Z!MĈl2qIWG38zWp\9 ^IdCm ~Ux-jlCc@ 7 9qLZ e3(h%ةg {8l1`_4@V:f+Ɖ (wHn;,Rfig=KO`1^[#f91-)Peƕ`pL/L}>ET[i^5d7_Ȓi?{B~{De_w"VbETS ޞ(>it#zB!V&ӎA=Dl{O b#=!5I(W!e+QipL3DP =!W0V(C45^.y -Zi(؊H1a_fN.F=Βa-:$uiRq {کY6 >,%,ۍyOdeS%z.a6>]_-;uv%!P^fA.HGaDm êhL ^bZ)\qfCֳd<}<]|% yZ/?|*8cu6:(%t"1=baHA1)ZKL y")M%<%:48ؓƍu3^>KS.!2^䟵x86@/X1l5~B1hlqDRQ.nby1G2^u MlEE~E_]!t6&\*ZM3(%/& ])бSQՐCrl)5reyv"CQ؇cr-on{޿b^{|nuBcirҀ.gr̗nfЩW/?fh ΡBf#=Mf +p>V|ފSTOx^B[=W#bWFy52J3%4x`:KSxo5>6V\_[Q9'A=@:KU~ϓ.NVQLvgYC2?j;[(ތ`j]g"Ejr Dgzu*/MrDz`q!z5[u7{}}'7 QƵ$EB iaGr6Cp(^bſV'YdcטU#Y2|9 4be;=ҧ_D{B翷#)fnvwKfӕ1¸|BCxZuAlf.7< O24 .Dfg`i#:K3|݈%[qukjheV-k[Vs=\˺IІôF> }+pB}8BhF)^|Ӭ՚% g1=:Rsp@Ad0-JgzuUZz̦YgВl9' %vS"HH=[BU%1l=һ~q*(&s\BUY2,>_JӃ~@Smvp঴5'2 (*0ͮueb"W $3FD}0l?qK%7-OFݧH_gx RJoN,s X2L}ENz!o9&pn F] ,x5pᵨ #šJzuzS ?,5S*x7r y&O3={-b_ T=_TJu5z0@r"clVK MS#Y ;_ie_Ě(_zDg0 xAZvx/U<)n 7hw#ɡu/&%F._hhv3u0It8uYݬ>M'} "،?p^N[_6-# }/5.3"ҟNoSM-´r\~of@ }ig?;1T~.^P̦-h]=z42DU~TGWK^zE|?mx⩣O$'iG,sGw坟u@~Uf"bq<i1Ft;,>Xu8g+,TSEen;:;c//\ڃ_1SOAC4&Vq8P\>}IE9{E1W?^Gt; qpSmdێMϢW?0?ת F{!k=c8Qѣ.oNXr8VYHq(9Q4zz);C6P~;!"Ȯiav c'sZOJE<qB) Ml[^LbT\ʨ#BHIC{mq.k_69gsӸRA537y6s^iTc oS1xIki'"nÈT{l ~?\sV=7FkTw> UOtV3W o 4v;4 0{zP,|}7~쌉Z{t6L>} j zaAK-YJU>a%Da19SGOć*40ʭYyX aĿIcEO5 i\KXmLWO?ZσVl@!ǖ!]N#Dݶz^/0CJ:b#xt"g+גIA&aR/Jp$~?>lot60XF%;%LDVlY*XDQp8WَJdv>:̓*^w>&B]޷< ";X o" 'yқ6$3_fvix%&2,qZl {nǕ췬XZ[ѱ9Ig'q\_ǵ@z3t1,Hn0c8d?7xeUD"uTD)/ 6+ sP➚Q^H~󫛥`RFg#WC >iWޓൺގ["ݲ-z<[vsyELLWՏ80ϏgzZ=!A;[6y4 op 0սL>?W~ +>i5Tt2^z]s4Z Յix-, {]pmcƕo ܫe:cON_:g;ZB NviI/ݱAB rl_me^߻lbUn3'%g7^,!ZbY{;em+>5gA'] WgCN&jf{RiezCDG \7F> w;U{Vi y\ZLӦ%\ߴ }.<*'rȮh2T|o^v#5 ϡbWqN*UaFKG.*q$.߰WUs(r7jOٛ`}(~TAͽd #%c!=IZϡ%OA,ۿ+7fif^_'aV<_W|f1vC( KhZ#h9G49Q9@;yŸ]oSKcn*6%#^s=K/[J8HkmnRKMz+(WT]9R||ɮMl"S`}%/Bp G"95gNIḂٵVԽ6+A>k'gz_.2]XIbnQc\f7 qAr@JXM %ugk&"lo,5ԳS~7\E}̅J)!@&]';58p="u.-z~5C6GxRR7v&`a%< _zvg +ka8˛rx' ՙ*8ݱFԆF$Ra-#嚱qzW97 :–C_Y04蟛|RK\`3 u߈qsl,GBxN:6&J$4v ߹G|qXNn׌Z} \cm+$lgiĝhޯ']N{%.iDWgӇ昑MN1^r;YJG,.xmfNż*fKwڬgW uZO=⤫g^reBXnV~",=?%~|j"# E7prn8 a%/3*>259p!nL/-oyɁ}imo[+?͆b_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUi  \PKQDtiab/1/testnet3/blocks/index/PKDg+#|}%'tiab/1/testnet3/blocks/index/000005.sstg VݶN2CfW+de%ب5@Hz BAuP1膀^FJ1q3vx vM(:kz %BZ*<˗ߞޓ}\o(FYݲ  `93i猪=# x>nO7r01B#GwW_DXn'OaVTAf/}K#A훕GJb%EGwT' VyQ_JZu. 8 !# 8%@mB&E [3f B1Eq&ėZ-N 4vJn|Lj&iT+4rO`+'Op,Kd_"^ʌg`0 Lv~N 򱩛/YY^}/vs2A_ԟYAw~&mGִBןgeK)B k(bR΋j-fv5On?-ꯈ=(AЍ@p5tds H=WXyhpxВ=@!Tk0) :xdו>qRK8lJ-ȵ%;jp#ϕ<>Uw4jZ뜧Q*,*HaX{lՃLkvXȍJ>p Xoqg^GY0KuHr]SyhT 4*n`%4ѵb.(H%S Mr$ RqmOR|m֮?ƛBy}[Ք\ׁ:qy%% WwWo4$E":ݥQn$o~k/S7g{Nّ/sm`.1I v zyS9)LWžCH՚FdE-:882r.h0 0;!BEAVcӬ N֒kg\UrU K[H~\}Q /s`%>~3XJQyk۝H̆ )fՋbznRŴ8{6Dj`Ĩ>t̅l4'<WMIb-Tdnˮ.W8<z@@JF\r_̓lϤ[ޖE*rfKxtC p r%KڼRY;W?00lq^["!{xvXnEuR#c|x)I1G9 ,i7 Պ }!`DV9-8U Q=~$`$8p֫`ux@L䐊gۖLo\;jVg؅3R*\'ȺF-/ CQ^Sg{n?uH͵$ϑB)h `Y5)>nִ1阤qֶUq\]7I^eN%¸Esp& 聎%G[/)J :L.YiZrq|\Y2}`Ξ0p5ڵ$(Gt|ΆD\އ~b`YfAatq,X#b 'bgoTcR{kܘ1N 'O@ʐр]ӄ4B-=ͷHL nJ;zm(ϰ=}ݪO?2`]?-F5f3-@} wafG)m3ⵟgTԝ͒06 B |0G(LA7*O M% NıX|eO'0n׸2FږUTJՄ¡~;0&"~f*^Aܘ'1glr+'0A7I?ʧ7+6r\I6}PkۿdT>=tX膌ŝw;_Gp#L^F`[ \ZXFBaP4?opgH̶߫ \v#(*\jrKHoC{FÚz_a<ث~O=_1~kO( s=Av\c MsncevG_ȨSlWƠTvsSi1fZG8M v8CA U :j詢 ~p/%;)ʥv'!et/ƤNN }AY|do4 Fꔌ9,(~[H! %SbթކL8j5h'wUfIz&!*)r8ݽCMu _&zo)fKո-BgDn;XVhh':5:0C^VE$s+lv#9_[ul\R73sI_plsCo\Ơ%\ E̍E+"WJ?wռx\.2lHF3EN_8n,?I7Å GB(#Dϙśg/\UR }kd. KH]:CR&ock&i fR{Y-hE` Fwi6M0]awohxJ)rpEX7^w5v.х@e#W4?ebɖYZ(IF %i(LA7i_T_ 1>rUљ[NȝxN04vL$z,]h x16#do!T2ADVkK `5g,#ye;%gń`6FAnh%"X'h" RBX$XPKQI=q=g3+7IF8WVЪoЂzo@̳tf* A7L SBoƍHu#7"QViiЏ3+:c/y֪D17KrSo`YJ3hR y_ 1膀fg=&F; 10!q v`h=esn!m{Kz`@O↘Թ:(=]UGAnٰ"ř 1KFOGi\v,ҧ*@t=,㴳ӗ}3#g` !` Q3|Z&h>tt17nJ {=! q o$C߮ܖRJvw۟$ތĭk蜗U CʃlTj?}ͨrՇxYg@'0A7͖3^Ӿ\Ԍr }MJ_g3?DʪGAQ C lFxYb{;䃼G "/)qmGpdGo8 E5([o")1xݴ܇,@"0|O`nhruyr+җ/s>(d'1$\TBW,iߡrl%N{BXeO,|zIEJI#erc}2qVv ^hf1膀+fs:_*؄x%%S Xwf21NHXC&sA&٪/^ 'gIxCM;Sbz4L_07VhPeVGVy@=tp"6)GT-g=rќ_%\H=]YTmA*,P aDG#`|N?WW&XH:SKc;gW|²)$9eo'`0]˞Λ=b #ZR*S-G(֐; [|OJP)!ٓG4s=0w~ SAb9δq  "nNaNƠ0]aв_Wͷc ZL8ۦ8jb3F<T'uo*}8)n?`jÚD۸WVD0~ P bvTREAyc ]]l/;Ό*mD87 r94oidꬑb+c|ۂ'V /___To84t>C^$ȟ*C%d[X9 +qn<_`{y 5C+ OV-?0E)Fr%c1}!Z']!eIcbq\Z]|@fΝʏ+d^ 9w c # >+,\F %"59нU JdvCtnWyc?ED_t6A̧>X:҂z] YƠ. =MdCs fҮ*w怟\."WDZYm;W9)wlw%.?XΡriv{Hwq[ZM/FlRS!t3%6%Cտq#UeS4"O3 h ?rZ;OL aMrWnYRGq=G兛%NȔBǢf-BF-OWA`!?床UΓ jtL$kB"FW. xssZT}W9\{8L&i-bOVY { -FV/4J&C%d[8 ITTZ,%n7& ت\>*POd(+ث!Z+}yS/Q[$Ӹz༲ɭq/ km}۬SA-1cIoӁpt~ 8U uh'KTHor%f<^C_r` ﶫl\rQb>Ԉ2ҡ?mRJ\xS*xL֯!/(AЍgO\T6RE)[^Y2.v> &7P~5xV׼hyd'|ۍ epI Ѷ2/&E^[]_ES+AnȈyDeBAn7>(|0S CB!.3i%TX@9=i{M)P$!Gy`AA@JϯM9}1 8n;oe({x Q)bU E#0N#vMZ-a0̯0uь"E YINXMITelbotwN {K5 DI]j9vtS!Լ^˚r(oUQ==vqdroA*j~UJe0e _ vLl+)xxLիy]%U-OHk&}z՝^Ш8 @t#N{y\ۏmRtnN6(c( 5.mzB+LO= 2vnXk(g +&v+"{YWc650 pP?r?)AYtA !&&AE)|Rr/Gk<d,.=k~teRGEfHsdNEbwKB6GAn*|RekDXw~wpLzf_񭰾 6zX h4Y i_[kAVR,dJ5µi ao42A ކTAB EAnN5w9!;C&;g\v+j>CO` >oiwkQ}uUUh,ȧfHyPΔ@4PxߟcU햇F`?` !`2C?nj?7$Bs\c/̈́Z*2 ix$ CCs=@ZOCC3Mvdb~ LWzD:T M.dUw @t#QR%B*N;qs;lTt`h@qv!6kTȺFPfn]#.]3 ͹6Yj6UJ-\pqBUŠc%O]|:!';6g0*YJ'Y9zax׺-QH3e79` !`2A6h5 qb`iJƾ\N'ekd3f;m&> :ےlT Fѫt1SРB,)͚د1I>\k`CWfmޢe} SΡZj8몬8>B:f޷YQ?B_Ш @t#rÓ#؅v'>U$">ODΔ+-c %X=Sc b}񵣼3'F/GپB,b9YUN9PL1߿yMЇo#%hT!'th>%<TA|Ê}JfY ,(iupNr~V}H8Յ- -E^Q&35jۊN~J]Զ3f(/~g*Ơvf@ն[:ӞgEg_!T]"Ju)gR딏sd{<>w31:r'ZʟalW[7 A][IL_ $K\R-Ankk>R%W]Y[G1 }UrR͈ơg Rui0#0~,wKzΥƼGv5CkP F@/=_۱mPm&$;uG"7ETXAѻP[c5>~Ps-IkzӖr3O75zϺꬬu+bY0S FTWZJ '0A7 ƾ}$u9W.9C(ؐBx=G9F%j:1_Nrk|fUyY![X}ځ1&"{k]Ԧx`KsUeӏj{QJXLR%?˃n#o 일[ѩN`uNJOFD$0Цu=AsBy;OkAY578JѐHt7AF[0\l,egg|Q\d[@< @t#X8>*"%Xh&=TĹie(sHJ L3f/7ǫi, SoMMwt曟# -¾ѝ:iZN2 VEǸd#:~)/E` `r yϿ׵ߎyN~Q&;rx4jWt@UMi(YʌR8 ;+WS]5rZjq?cFwZ+P^PSy ÝЩt3QAv,ڵ^b7]d4Y7~$h}D퇴`tW_iܮ l32m8|S(8![ MhC `oDSMcwN6x)Mw]S{qc&m/?88 eprw&-MP6=S2'yszs+.OlgVG30hHp 5fW/'He=T. ZikI95ܨMAP !>cMdHm +5.X}omHseuG t{_[Rk)]<'2l07[,E BmX5\:_(?5VdS"}!>}X[n 7 ?{=F5{4i6q8^shgiᨢCqY)06YOՙ|Y~Qac)S?zJap8z])~6ĺ\EҸ_-h=c6uFSmɀZϫ2N0m?Q{G/ O\&C6<`8 8ۜN?`,Nbt[HۼkWx]zuA=#`jq2!PJ/IXrwA`bѢoEѾL)>t{̉`nv1DSAP#Զ}V{qI1i‡W esĬjb;)GAbLIV@hS!ixXkK&n ctu O5\uۮk > ݜvBHj$Oـ˳4pdM ި TGn\"fCG45v 2}k^N(x3n?׌Z//_kJ6^WNsvͧ#+9%5ZP-B@xdg;JW]YDe59j#48uHA7׆BX;ǝ,™*F?P&}>^F;WLV N-2j#@:rWK+xLy裠9kųm]U[E'Ͻ8Q Laݗ*9 ݧ>h0a v<jC@=v3fa9>im=͍4-q5Y ۺ7nߧL>z}gUctx}yY|A?X+W̝fEBy]Ff3;WS`Cm(GHK:OM`}#U#nU-|6TW wKCXbX%x A 0xDN]Y }t9=;^@疅l[L\Bؾ_#$]AjC!.XOfNms?jPwf:}&-,\  ,[7!Ʌ&ցyJ2A)f8DȆu:+]4%s"Źڢf~~q} ~l K0SAP#Զ \م+L9.FZpK^QN0ܿVj)"><#rSw!zΚ\#*ٙe<}›G^ܦ (,.\`f6b}.ůMVwtTLfIN1 Kh/ ` oQ`Cm6DUQ^;nY}\ZkZ`.aMF׭&bMﮋZw˳ܡatZsj*(|m (0~ g,*[%lɖųf`H C&ouh4=rԏLƔ!Iںmr`Jd!F:rg>Az@]_5Qz]'uVR [ꛬrֺLQюϲ .mmOS2qֵge̊c?2FsP:`#q2䂥 }zH?=x8]kzN~zF\._;j?Z>Y;f PDf @ (PYVpa>l[VBOLKK_H&ߙy~馼ިoo3~ڷ\rPIYMW9K tp Q`CmؐM!Vtjԃ}^we(8HX8#exf}ܘ-uo9+!=XzMT5wR5'Xu3%쁯`9OaAPXgvIuFA:'asKo[ߛbk|W*礍@+BmӟNEw~_s ;0"CPsԶ8&SO5͕oW >G&OH. H kJ1?6U7$9n9Ue^l]HL19ķ ] A j $% , 1R=;SVo|z->(9{yˁn×;~ L7Ї/hEjy^#w@~LAP  KpԖvE;Snn »3ډYǬ'\ܿnJ|#3e-/ C6uY<=gS珃W[hwM8lCh+yOv\>)" r#?UEOީ7&M2Sa} 䥻ѹ/+m=b}ɡIK:4gl {@P%dkw^9]*glZXUۮ(t<,i3݌ A7h^e ?t) ݢAOF ( 鉇->iPHCoQJ,>4ԝ$: ֢I}=e4їޤ)5v_Q@{|4Z- 2j#8뛤v0Ovem6<{2L"!\c;2JJi&}U{O|r`C}\t'gd ROS),ݚ`k\L8$gF .8l,SfW:̼TEp^~:wnUXNοHx.A1Ԇ`SC%vٸ_XeScbܱt,BvsCהR.?-cZ[U9_o. o璮q,x;^>.&4MjC@tyvLQ74z;.@c&.X+=9䚌5 BuCF?Y3T s^,@*c쓮Nw0Ε[Zj?BXu!2A)fꚦs6,maw~GD?2bKX?'8CM>m0j9^Oi~2cGӔ&kSVtIv!}ۚU"ۙN#{B F)J64XǾH5"L 0ּ8ڜB&K9|fR&<|iT2~ӆ mPna*v+˕jF+4eHΕdhQ>A[<ﶟNHQn8˸UΙ<ΞG㓺7ME! Y(0<#u Ηcp y\,)ྒJHt[ [su\o9`R5~}VYv?GH+aG!PںeQ|{gxg\%j3@ofk-i4ymŏ5 =*3yCO:a O>]# 28>*=ޚkոnzuM5r⳺υ [Q`CmC8+0c.Fwc|;Ne3Ɨ8*;!vpvUk"s\A\bA1Ԇn8Hj1p0_%*JEEw֨|5GO'Xh[Ӣtr=Z%z2 j#@1'U0GRա AO- ^['c'>_LOD:D765SUՏLAP bG'ww0KkMirv˱Nm(\uaFE;)0?woZtӨwʹɄ#lp~> #j6@r`'ɱՍnfy1 jN8~?0'CLjDae-Dd1q?UPɁrlO77ƚ,:ti`hj? z2A)f$pZ DZ$v -H=yol&#zMmLh?>?~RbK%͆ q˟Sepsؾ뿅Nw.ng`M@||vlO j3@bCeЎLߝK:5?^@ևTqfҵn꜄ҵnBQ`Cmh19Å- ԲD{\Y6uW aȕn sjJΏnmq+Tz鶪,u{M`#@ ju93^=< Q`Cm†~צg8MyR M0|G \yٽP{s7w7>ovoذTBVSF~vsՇ=EyOtlE7S`Cm(X_MJW E\0Nwxx`HrU.ݺ-"r9鱧c$xQ W2A)fUoYok]_EpCY|4T_RZ wji\n^WwT[n =Kӛ휺gKqغ:a~rxA⻡ֱ`DC BmXK71ŒS,wmm*k抷-&_X:Ӫل@f)3v%oyWHYkyXz`{ b b d WpmUC6#eѦf1 Ɲ*!Ѡ .q4qMw b kKG`Ywy¤Qޏ E3O)D72I;Kƃ 7Ocq4wcxA>g\wT[Ǭ.ӽǃyۚ K-J{,|#Sp}\Қ\#AL 74DgW)9W\Ep~xY01<1'@7H~P]vC3E۹0!f㵳!Uݚk'38}/se(hYSۣ_ jߙ;ԶNAPZ?He,A&tP쿣!!WO֌^ͻVvA46Mȫsǣ![ӿW1UhxN! +v|禀`%(061FR B-U@ha^eޔApԿ+~2P#Rd#ayd7B'|}O BmTQ;hY<| ݉+>Ԁ0WӞ>)\E Ao+Y]_[kRe"U}\>B^ƒ(06ۡn0umn' @=HvqȦ:lgZ)c7ٔѥFpv%:s,irf5A1Ԇ`KcN}}1+=Q`homOXM1WWl5@!&i .S.:Bl6`)06SX;*X︇+Ew[_yxho̽ /cgѭ$tux}pe^Eq&K?+Ue]x. *x&d!Fv (r uXStF\>v6KMbar_W'΄t⥩>߲gl vcB@6R| 6H 7wx;/8}jM%>3>B8B4MG ?y^d!F8ݙp 0I WG;lM tV~M@%0^ S?kMm{{wG2fq>=Q^,:ր@qd!F'KPj7pVg܋Σ[Lv0,R?abc9MV)KL6-J|۶ځ'nS \8SOl3q-&a֢ (l;GoG*\}cUFSzI-r__.ݴ+OUةytu.[t<όFQIoԢ (xwTa9@7mN}5e@_hV?U/}~6чbR:yǏ̃b5!frW<=j3@eIR<,m!P0B\L)8JV9V*{yqp{:aƑtGOGԫS-Dnʣ H@R帎}(~_=zE#B>rlU{G@ovZ:wqyV tx oPު/ alUnݦ*}!YW4RvJW|pk֚={~bS-]A1Ԇ`_GۧL܈ j~4;~b$EBSGnoaжnI֤ܓaWc]&ʎ@o;յ/D}1v.gfk &GO b bM066mh ΁oC/L%:^{ջh֞_BHtvj,A1Ԇ-q_&aT{ RZSiof:bƐ|[;oגrY6&A~7떴U6.X?S`CmX .8`;XCX$}ګpq*ѯNMtP <1գ (ГrGIu;e*?_g0{,],+iCM5 E#=qhNiKQ`cacw9fݵ3kHN=K zd!FL}Ę&F[msZgcg W L',, 2"+D#:o ,j74WLjAJ^lqSvLrEkmYN[-P:e> C AK Hd Ej[D}g$|alT~Jp66h&@c}n'D&X;#0֢WK~qMK22s9k'!KC^|BAP ! ?V^z0k+RR)uB_~&%uw 8嬫ڡ:9]k 5W$d􆗳WvXsآg:nFngbcs~ j@;8Zk`2-D>ZYl(Y.|Diʿn\.YڮuJ~#2uA1Ԇ .-2\/6~aGɋ4}r= Vr+Zِf{*vb?deLy=xj$U*XARPJ0l NU Q /<ަ긱\w+s|WI^:#%՜gͱ z|M~2^[w: GPB%<G3~E8^owZ?qS{ ԹMnr*7__ sʋfkpqTl빹>xC*kϘY}X(06cQ{Cj1NX)e"'{4j<0hb.l*S Z?3@|E ( 0׃qh0 iۡ {تlƥ~xSuDCsi.1,ed.@ÅN.|,05zh ׼ZZfmM 4ɜA{Q%7/Y)#:jR%6/9-o]).G(~/2"<9ڽ/`p 3)Ζ(k-RwDs_ZdDT4d:˯ݡs7=^wOφG8JAP !r$ 65ym|b Wg/</jPZ&'T& 0ljrWޖ#R^SU׃ZŒh<PZk|F:+S`F]mo\`&zV[ßR6| `mkaK(TLy⵳eCUƧ ;yj?A1Ԇً##j$'5V{+ظ%;om ?O"%t]Fp/g78%sRP߅ŊR3{ޟ0.hb`fgc-B^E$m/Y!e<89d Rp%܊w@s&VqʗI(_in)VVkgχ.Nz(@0n2/4Tg.S c,"C64KX{ptBl:tm짗Jm~*?(^f;W\1pZ0y:!AJóFW^nsٝ$͗²e?:/mj7C(06T+g3NjwaTzkلu<9|!ze߸dt榇Pj ox4/'pC^FpMQcUZF;{ M0 (PY>#U3V@XM8ָ8JM4?I?^50WLr$WMIL#d.@c|Ig3rֻcYӵJ\7q?bMcq/<9w_ (Pg%~sfxhp=sp_[VEO+$`U'#o\T)է$W`~6stp`piW*8M_7 m9W !6|VR`Cmh`|pH*\0ʰ>;+ÒӭG/m-9s[+۵Hd R=ּ NdB:| .NTY[y*3ٗ"˚u^Ko)7!{m}~ A (Gq;I"S F-`pԓVIiS߻~\' ND|-X}fxR63l@bM5HV8jt&Fnnafu_ [+MNF7޸މo{3d»MpgtgOn|ŜxB!:/jC@X'f.`in10+wN`2"Vz61b`bCO >@)065 ! ۥY2t0;_H$aǵcP!&$~#!#O݁,K^uriOaAPHg\م(Lg+ͩe?ؖX`9fkOQYCA'?ik-ZȰsMH]BvxF<=p4l>L#Lw)!;j{i]DKi7z .LWbod..~Lu>dyb'z&EbcBq\9w8g2bvGު2o=qFseV3NA (,-83 lg#2'DE>n\77^(2cքjC@WlmH)WaC"u5{At $ݴA(˳aף{wkB]h>s"Zҫ7%}uu1$cg_BYFFHӋzmh. fzBR[>%'cO@gYg fJuHT}cD꽬 B}R}DT구R5\> ^!'깬fҤnCQUz-,WJz\zbYMRJUhZLTO A}YM4j!uvZ@Tlz|Y(;ꑕj.Q=_Q lJUtIT?͠꺬mjRM#9,"@MTMW7 ~7R.P^#׀H&NKZ^TWT~ TqjJ5:zlY} +J5UeFP+KD%j%PC)v+`j UeX)+ D? Ue5sPQl+ճD?6j,)(iwk?&6w]VR=ITUe5ޔ*JՓZ?ղ jqj UK2TWJUuLT-VPXV'H6sT4T͗6KQM^+Uj& Ue P)U͕%Q5÷xBtY 95w Sj*Uej㩕!Q57;CxYÔJUj.*R&F.9@=D6YjUC|=/T,\@UTTՈ#S^VaϫBn[*P5XVc9D_X*U|>THR. OTX^%_RݱR&zjM.xXwQt+UIO Ucuv/p5qs:NW#IS*ӑTnɽ=-$&InF.s0hbeaamny|ssy{;G`b&3kTmX ǫAT_IHLIfN՛j%kgz)'Xq~!=SM7ebms7`gk+Q]2cZEīITXLWD83BT=U. keѠ:^-jc0]*ZWgZ"k[ǀ>tw׸`eZM|$)ṽ\Fx}GxGNp;7_>,V^;k:^DGR5Yw95V;T[˭X[1-2kMTzWQoP`m y^R^5Zp+vh<kUpЋzj0k$T4)3-X{{t~MP͙^=kQOPm./oU+QɥF0=WG8WT#yXÙ~Zksza ct?v&6am$=/..XC;/2;h&T3MYf)<Ϋ[6g$` at  u3H ӷyu&ra,`iJ^]E}j\5 Nu5 Y+J^ۊj z1[xɶWwQPmb `z!h9|AQ^H3I&u<eƋ?zՏ镖u.U?0k#9ӭ9Pmxce $QiX}~WT}ПXL7E~8A)TT ~:.Sm`f%xAQΥot7ğv8NL5juyy.j6U/k}K:f,j&)X=7ΫFԡT=c}D͠Zt>^LT=ЏX27zQӨE׳3 ڇo(wt-gEMZ]MQ«]}f:32DMZ]H䵥 TM'VWEkvy5j.j$3P KՈ.b5PՅAyëz -f\9qf5gAMWO0^ۉJ budz?^=E Nbu`z ہn#jUU>V{@xM՗=:DP3 Ej@'r1=8]+'U;E(V=ӣxkTewѣc8c2rՍW?QMTm:$P#DuCG20]:PAyc2]j5HT=U-:Uôo#xDRՠjwwJ-hgpNTЩ |chzDp*:P l %`8Mr6=eu[,P~#k6٢`w9{M;&= `ͱ37i?Q9 @28d([zMyjIwn.u7M|l"\kE vD-,Ñ`8k#Ybh[st;͙`_>6٭`'U[3Rơ-`c];Ι7eXy$$rX>Y=A0;9Zգ;Hl zhf'sAF `uÙ`B}JUA,{ّ ul+7ھ`YjpHIJP;Hf"627e7H;$2Yb䬛`D`#VY`@+: g Wb`ˉ G1lg[BlZl(`5l!hlR72t- 6-lRՖ.\bѢ)`6ޔQ,!Aha+Hd( =Tsf/X T6Y1^jn`[3F(KGs06l2g.JWڲ!f 6ւ{ GFsV[lbЬ`3,K)IFHcz8gq %2m̙` 0,]%O֛٥,~%F7* ֋م8>5^XOfRj J']z0;:h]x;N*$91L&!#6Q%J}ԍmUJJc[FGYTj,P,V6jТ)T.[U)P$.[ufJ!EDNv SFPB~hZ0 tm,Y|.Pa@IedȗPҝ72+ % ԁQJy0JOPY wB 3M9(љ@FZ B(Gov>o䤒'eH!`ePkP Yy1ڇg!J0$TWgRdԖp' -2 @'{ Q@%=Bm.&fTB tP zVgyRF6 bX`U=@7ŜZ2*vPi@W <(t tP|(J]T)@NEE27B,ȯ`Sc*kB-N5gt/rODzѭ`*iyRF( ED:|#ޣßwL#v?HN l8边jǹ}&ql8P8U  @a.WNŽd5cta hf5 etz,PJ-A(P?k*9 Pz@!ZaB P^@M Q6jr6PBQT|j#/(NڨPhpV h *h9=@-S]% `TPɛ-$qC y3cTiPQ2[xR3h5^{SI/P{+Goԋ*7:Va JΊn@nBm PmF%xPa@Ʉj/db4͠Zh6iȕ<(^%@VB)=|Ȣдa2bGnJ0ȅ%?hIȥl*3+T%P!91:7 (Lvr? ȑL< &XA!e<^9o֒sKK6IfXO uߠ3X%=\Q_|ʋVUGJLHg2niW]mg)Ӹ#]iF?ئRiRsJ 9.>,kfz?F?_X=LwY`t=XZ 2Kt :DW3g#OFNp#Pˮhr@fEb$ ΫE^J_L^o6rPfx^ޔ4ڊhJe5E6yGjkIkKHѶƆ4i9ic;tDָ!9YCrd #YFPCte/' l2\.O|̳SW-<~~?aWׄj3R.ovoI 'uZϚ1.2WkM=Vlݦ G }565O-_;./;o#͑7W7dQO7fdO7oyc[:<-= 43k cw^HI.z/ɚblSC ,)X9u'N#Ϳt|Ώ? k tW֒'s8i?^IXsAm.xO\t%"\^ғr()/?=Mǩ6K̒ ߻wЦD~G74̸44{D,͠ 6>ׅ=Bm;.;@˃^h݄fYt޵OuӪu^PK SD'tiab/1/testnet3/blocks/index/000183.logPKDM'tiab/1/testnet3/blocks/index/000189.logiHqMK-}PR$.ӖͲͭevYtߵ L0ɢ,+5geAef5,{~`y^g;$rSsz,lzƏg⽂3$erK;~4TEͲhk[itgY9Yز@12N ;c9{e풗m sy=WŹWP~fe ^Sk2uĊR6=yLT;aTdI J|UpGJ_RuϽ ]c[yr~wŃvuTQKgוLMBc[N }[G:׍{z~CXMjs_4,֪h2-)̒RfB_0tT`:V ,JXg9V^~O| 8dnV;tN2aT-m3Tbi`/.67}‹~E^7)%rԊlC 䆀Jg1oˉ.bSeuc?sb'62O .Ν:ʢ{WK6&焀 ; dT-@#(N( FEY.,xW0"VKNWzfyXpFhH}˃5]Lbg1/* ^kw=8ױMU}=5/=^dq (n]t! 37fyUlK;A7%@%Y^a /PK „D*$tiab/1/testnet3/blocks/index/CURRENTMANIFEST-000188 PK „D!tiab/1/testnet3/blocks/index/LOCKPK„Dxp tiab/1/testnet3/blocks/index/LOGA @@֞bu9:j$Wn=ױjؖu]߭c۔BO}8u4eo_O~C}I+@׾0PKsƧΏsxO[LtR]<ǺM ~_N_\];Q5t6d77,_e=b"Ӛ+{.Xe GPKD.<*#tiab/1/testnet3/blocks/rev00000.datW_q‡.FJnPZF'!H43/O&{/$x̔ ɧt%[]u@KK |OW+&zw6'?h\+|s2WJ\տLsҀХݧm]{zc..+$&VAY܀ViP r:nA Ss<5AJ5zmٖ -?]JaÀխ /g[1|Y'B7;\WJ7 LfШo]gn[J֘XHY 0J9_R>"DVr[Ȕ2.S\@'VE$O=?o%n^1WI^|>S$qu .lxHv<7b%<ϟ)NeM|SYKA yPc}~xG9* *s..>Ru  ?4@?@J~И|p[{@pҟl sY 0vzG>F1;?Pr$'laǕ3i?E&k00_92_>TJSzTD=xߦYm c??5kU?ȋGe~[PuqaP6Z;<.(ZW.C:+s;' &Z I1a^b`mƑDe2-™d ]=}rR*`gWDh >~}28$979/SݒnԘJŜUnһ>4Lhff X;vTFOpXfyj:R`x0[9ZVք-$>CXwj$@Qt{no[M϶ǘ!3pB YDbYЩKv<8|BuHMw.ΌU__s2ҡ[$\Of8WSO& ~)4ϦD6 wK(@xzj:Aֵ͚̫1.a9 lU$. ,]3ĸ=k;BCuYҖ:;o£0>N69)6* ڎvx TRo1QO!͆:rCV;㣽@ʕ'@*#[|]3EعzءKY_2,njYcbbS(+.qWSmۼ$db9Xk^,E*ln&{b1 ;`%8³ĎlyHbK<0$}lWF;]S;_K##1w.5MQãޚہSqwϑ/wɔJޟ X:-pY][@=˾I0x!lrŭr#IMTԍ#T;š #z/b͝ pٗ&7 ɍO=ܬg2V$sٍSA}GzH燎pBcĩnj8 . oM.ܟbiMGBT p&p_O9nA[8ˮ/gDһ`/]Ǵ|flz·,GxA tQPB! ~!|vZKG~()P<~wHt)Kv>wHʃ5!-UgwcdG#p]B}(IXȧY@HTqA.Z |OJH}5z_'Ζ鶥lm:ŏR=T%J'_$ ,a4x>NU!v>+nrPC8]R+]7]/̥= oFC͵ ۧ$^GNZ;h^HS.ub:g䪄.YYCʹ@'Aop"FNM؎;uK S)F'g>]j$|ij,+OSट~.w bv-1},M5A 6WgIQxdBr8mx\]rivѕ!*L)!0Ƅab+*I(I!![RؐA[攵P B [.(N J1U^vYh`z&{m4cĚziW  J@h|6AG܅ É>A ۊ;L|ݐgMUJdc1G9zu,*5$&`G$sP&_ג\LJmRFdUe mE#j">Xq/ha‚ʊ ccmmT+>;wj~4蹌$/GX~٭j\U+D=h€;ybԓ- W,k9#Vw_`g]ρ#,XkfZC{ ?FyެcܤPC_zW= @_+*.:aa(N캏Ɏ)3~:yY&ib3:9թ)?)~ەWpL?O°j"M"b^CLok/!H"̛x^k㙰(>XN\d+:s]lo 0oK*Yύ^l,)[$ wE˕#gʱk[ <!?\Cd.v%w{4pq0MwN8ϱPmxN u&q% ьjђsoi =})&^_;x+Ʃd7p{(o%'4s7ɫV8Yꨒ#\+Cmb/Gev8TP(qM˹5tq}rXV, 4߿o<.7)+'jpQWuLn6krvIT y7B;cھuS&10\0h竄FԻí?׮cF @6 GT0/5WZI#*KŬ~;#ҳJ8va*Uִg 9۰\f%W,:K U~/6߅97 MGIkqe-yk\2WaR1שDc?QmU.eΐǝ>ȬZv5^F'hI8p4P)&V3#ۤpcaRĔ^`kpZh}HlyjwgCI'+`|A+o^ej!]<(/Tդ塜"sJ$)o.j7>뱴n6JY>wLܝ!`_9LeS3~:0v^*{*l | \+sS& y2uꞌ]&.`"cK1)o֫`괁(;5&h{0jͪk;%C>n`x1:_tiuqJHG ſ~ LX{!Z|u?9W*ptXJ\eE #a9>:*W) P]@J<*r{{8ƕ=8٘&ʤb/e炁Ыvi1FS#uon0#&&02`ge/3mp%Á݆gk{$,U!F?(B-TMS0)咅(~;?*2 jy !Φf4|UR3 ;CT+3gǺ->J7&>K휓e^!p)!i ρ_I6)J\wCإd/4@by4ǽ('5n%H֧WdpKm±cLywsj;p>0[ʵnwuqƓQ6ɋtW^|oXgn`NEh;نDVZ(-~rvr{6apC#T18S)y8%rr+yt1ezUK8EI˅WӤg*t9WWwVUˍrK?2Nt9˃纤/ TW _E"ۧ]ol  }yG/_fn ?8h-20WepQ/f9e O!⧴UO=; Č"}?4ALŸ:r&k4}pF+NEŚW=2WyK>ܽ+n pgu>&Ǿ cg+FuԃMc-%7c~ߋPFH޻/3e?H?voDi >]RhNI~JL<8[\GzP, t}:]%dm&o-e5m F'%:jCWܳbǁpTcld[p|t~h\ ͱD|.|qa& J%oԒ!>xZrQe2:iXKuu,C问"Hknb来lx׉O wzns Ik|iLٗ{mU2eˎס~Y X]>bUm~֏8ܘ^GDdO­۳g鼥V]&]D N]$(Zسl΄M㢿|'P fPB1!27 Bu9՝sʹ-~g PC8p[qѐF >!tayo1$pc(ɠq {R`Gㆂ*g| G^.>j*/^ 7t&`9㍅2K֤/m6|iݞ`*FNm-Un""rx3Mǭ?ݲuM17((m]H1f۸a9=f[IwP0*Kbz-oc/x/.aONٳrvOz꿿[ދuė+LFRM^LY5+o3VoQ4_F#qTp'%J`|T8~ϛ+OKokAy2~f5:cO%Ա 1_H3ꑐ(oR֐i|ȷU+ e&!ǥ@7ˋѦ4NQy9%QN*h\v+~?]7Eg9SZ(m{ǐ1f=Gq>7)w NT㖳xF>t+,]1`x ,`Mr>SXIr37*.XUUkc &/ A⇠>'PZdQp,M@/C](=b[JG(ߦH^~`̦@V+s7(*gbʬ{CMjmJW%*,sHױآIլQ\OG_KcTsY(LYd/|*Zoqm>/H#1ġ01'_gH#Cp |S{7o6I9# r #qY,*haw'k{(C=4{*(kJ󰗤z5y*!{F^יL4$60>kzKQ\&*Y/ғ8Tp6*2OV7X`_ b SR> Rq^JͶu&5xl{2Њh nN\?4+4n3cX,m$<=Se|Dk}kTs  NaY2ЂL3g*v3,Vaj'zם}qN;@Zi 5] 3%EnpU2:Z6LŒCgґ$b]QHW΃r(kosNL4@OONFl7\8ZԄN.X}9>91g=1ķګ`B1*(NlI zJW q\wP7[70.z:P[ii^B8Ф3Smʃ 1!(_TGC<kDNΣ{ТcS8r*Si-9=޺ 'yUhx(KQ(vFo WZ$ Uy3ϩD:h&7EߚDO)CtDd_\0p] 8D;= v⁝7o!logj@ 2'3[ "Dw':CE8_[ݞc..Øpb1 ˑYM]C\4#K^8s=zبP ƱjqvT,yvp=U tiv *Izq2Qp\)CkITVDG:0,=_gJ sj|̘G9PE4F0J{6HK,tɌn @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ b_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUi mqPKQDtiab/1/testnet3/chainstate/PKDFN%tiab/1/testnet3/chainstate/000005.sstLu\TOR!t7)-J#,Rt! !"] Hw^yyfv܅PHF÷x\|1(}.;eՄ(3q^6'J*+4i/;#mB}_vhq(7O( wF21';^OX_Ҭ1GwFx -(\rB3:40]H?#%h\0g:˛S(w0ʀ].`trLt`E2CX5 zUyn% @ ϵmꭰ"kŠa&dE$@ *KϺOI!kq3nnvxb݄ЭYo(XǡJ:ne*63Hx5$'Q`-oA!gMWOY= Ɍ(v5,N {qzTw00n W51ؗǻ7;V!U[NAhD(AN ɺ`D9r+EIw%&XBi˻u:mu&bB/.m?YLܝ_^[-<EÙy^fIcr'=w+DB}h{OK c|lɃV-Jœ.ҢMoPd<Ĵ+f$Ӏ`chy+Gm`$o:f]šN%B1huJQ ƾ~WJ99':k-#eܛ{" ;UB5^1\.qO;b__Cf_@D1#GbOhPLӼcbx]tq !GU{krrmJ_F-/,sv\K`px',K:S$J`"?~y9Nr JB=ewL<c7?+'6@ qIBz xpsgf:tn$rIIޡV\ H^6YIjb+~V}y%SURR?U/h#7=̣;rz(ʪVge@@8v8ԟi}6I63ΩN< ցXňmH5Ρ8m'p¢ ^P:ĂP}RNJ[T ~}MtZם@1L:At}ɧ2Q^e<ZŁ6t&wPIOT4ի܌ȹli MfRmjzq&\1U_tGJ 4H<΃ 'ڂCV2eD͊ [w5Eܹ‡!Y6~22݋>]q[ 1u{&S. ĹPT[ `޳rL6Y*|i~bGLaJ#N9!Xb$!͒{7Y6*ǡvL '.!w|c߹Y˕ SOЅf8y5F/m8Q3QE/a/J` 5O-Tzgyȫ0&O&PIȅ4y|bFٻJc,=iW5 QJQ-;>%^0vUJj@>.ҪAqJ xfRBo`@Z1^co)6^orb2=H$"u^Og:yR6ksM6N\ ?dg"Y0"r&!$ݩKܯN MAМD)6gfj y#ߎd+\{V?'8\kiEa`)4y/qɦ1j]‘}9¡G8h0*q/΀R F[ c\7v 5@!'t?B?tmN|ԤDc%X Jg_gbC3C\0Lqٿ|g[{'K)=.;7JLK1Q9N& h[u K)^r2U$0,.RE>?)h$1=μvJ`t,5 p_ e!&[M;|>2D%O$ 11ZA3>1uF |yo+WP_Y5IQ:(c-jT)Q1Ta|[ -! fƞMsȓ75!7eYx7e-w}w=c+fygK VX70\-g`!]ޓ=#ܾyPHoM'.I/ \xw+lfpOc!'4G&UݜE-}VDvhWи<00gw.Lr3Q^U]_Udj꠨a"ʍk*T.(=+7ͯSjL/a'Z`!in3K(Y-j3FpUs'6"݉CAeop$>k +X_ ƃN5Vf]`B2]'_댮e8NC Y+g+D!b͡f69F_7Nm2oڱѿq} xތO<1i޶Mw/Mr:`aS,1xM84&KG_mg$\'zj iʕW5fnq'/vgս8E}sLX\(S ԇ =$Lnw):{ؒWq2WwW\Lw0% [;bUQn>+bjpj7v&6xun>ZȒٌb tܠ`P980 RnuQ7HO gj[[lpѧ5 %XfO?xdcH!omD{ $06Aӎ>yC{Ev>YN3ߗvޕX kY)vi 2PfizF~elZ_Ih_0/5A? x' 'Z$B$LD9C'L86&tX="dϛEgGX 3z퓭\#58 ӓUr32?$ 50}$LqWTzz_v )o A(IM;#Cz e79)'k h@ vC0#TS% 'Q! *Vh"Fwd}o#=-~Zkse:alY@x˷?Hă挰mu }$:9OtP0o3 V#7l~w6nm#`8x<.n_gX O i'"\QJ SFy } RTvIkZ4/ރD㒆;ȏOrGhL\]f'M2oO~X1FICA]%%p8*^s}O}Iw6׌e>2?ךe3~0-hͻ&'9ySKEŹ5|I^Mz7jw?a(^*Dr,6vLI\ExVkC*6EHT@BH7 DCW^3}CEΤLn;F191)خr 4=5lak}e.wX^VеUۤZ;hpU8B`U9Vͨj/k1?=K셆%6G>;ot&h֯ߥʿ_=©A4[MUi=.MF:cV=10$Zue8ghqWN3"#G}1$<`NG%S^߿Fd!D>8AƹX&[qa6C5S3 "\zay\c"ΒO&K׃q}av9-(W}ْbzZvݶ_DŽh 'q<Pؒ#P"#Zy9o[Y 8jʡBt́i^xN0g-AɧSSs㾨 ʙw\{0z1)S绸++1"& ʫ|~zIe[, k1{dS2qe%j;hH۷1.z>6xM-4PxyerRQO4tobhpYwU\cNa#GƑ 8z]ɡ%+|Λt3"^CXX7.I[F(5 8/Pkf3Y~NPwZxF)#EeiQ?}hϣs._f$|uMؐzð,_DLM 7Ϸa"o04H/-qvgC<~_g$c~Լ;œ &kI8)u߸b(|S}m4T]i||kͶ!l>k{|S_Bgh*fȧ!"<a=!V+'OhVśoUsrZҫ/CFp?06>T =.騱tL"Tom51~<&ٚGZ)9$?ӀPl(IyTc q\=c\] mEwWY9{\[׳.XxP3٧<͌wHE]|6?P7^jZqPHGeb.Olpv3~F)Vv.!pMj1i)BJ’#AKYOr.P=0%MCЯ?Ek٠ 0 ::tA;ͩ#:D&a43n+ˀ8.6kr`:x 7aV:;'/QuͼQfF*0ox6q03ɾDcS>U7QT y3Y??c\)EcuY@ڋK YYIymfuJ_́/gON #rQjD5uJvE$6찅J&( jhl\!xv5G[ҺxM hRtpprJ?*= 豆1#Vvu}Q'_lr6PbjSG` Ҹ #vNss)=hTW@qnXlm!tC|{ba+dv0 |L0їVjlPP^Y1A1^kb[7ϳe1~FeF :p&@Dsy \(*]@ɜ=U "JdlhpNeiOꡩݏ34p3U^;]H(?hz@A-AykjUg ILlh,>A?ÁPYiiYWQM_j+\P9 C5-y\!wSj&rpOb;R.gV2P퐲~d1!.n@ͨ5IlW,MWgsh8U#+X@QgR9g&ؽ+:𓀦wP6p6a·Qlp1^$>Q ronϺ[ŝwH~){Rd6_u\[wES:DRk '"%) KtNACK"(R_}~>g?s~{g,9 VA/[23T+g6@p$ᰑ?=HRB֭aqجl& ʐy=emÆ%-Y|[ W #u~酲͝/M!L봙jg_2-VKUE%wZU{O)́ `^Rz9z6sՏ QSh~ |x?Z_jr PW+[ʈI=iҖkmWs;^NAýyysgqM/) )gFW2=6%_;ig1S^XBRBN MԳ-|f`}焵 HWC>;֤-3>r'ObKC@jɄt'F$bg\`3tz8z,?*y⊛ho3xw7V=]+9{8BӴ_RO Zs+7A C"B~M\Ae Wy3}i1=`LuZFpQ` ^I" BZTX2>pp2W@q-7)IYh[J@[:{([ ) ދJ SK?Ptڨ /T2U]lkoM: [cHq$ /~3-9/>a9R*bN *S9ukWP !Wgao~n~Qkj+g@⃼y8Y5QgW1J%W+Fru{2PTYfTpY( VD젞yMބrBvqˍJ/cBljCώ.y';V /Zf(}-jɨX%Yd1H I[?W%7 j$"Vb=[@M DzY@ bPZ'2IAU𤤩>9BCb/i9Q3Q>H𬵪bn=pXxAI}ֲwtck: |':/pQwʯ7>-J2%0pM&Bxz%t~1t;q&(İ7>Ҡ UE)"ܣ(Qw~,4lf K[UJvhW>aTr[Zn(4ŝ}q~Np gl*!osʪ;'.2%{RM6HFy>=w_"M.%jYy]vH:LkwQ=Ax%Y^G6FCL󻁣zqUJke<Nb߁8<:܅-2Wr%P<`,*_>E mBQ ;hXxmc]W/ J-IӤ3 ʣ6?B:: :Z ]0H2(X% ,Bd w3QryD;Muf!;3ƪ={ְ{b٢؀p4`C`J_o/tKnr/аMphh~ ~6TB{45GE'#.CƯ@1c6SWn\E,} LW#)@^Ƒ;Ub.^E9SIj}x5Dml~D{ f9oniVCwQ'$W:xQK-JVf13vQU~C^q%zMx w/` IMxJ*i_Qݓ5VW?tpsQW?niD2q2|j[`U'Z-'k1$MJ2-igQ"R TpS*y2WLwKO=MxM43`t8z1>[<DG #~^cVl ͜* 9Yr% >YknWO?"Dj`%bרqZؚ@5EZfu`x~7}<TZ" ,|'j_ _JeE2c }c/[շ|8}pyqM.Iz) '22~=՘g*aBٜLc5yc-h{hWԳhiz+{{]-Y҃ ' ^bsЎ& 9:P #Lp6-ٟ8@?7|lׁ!>$ ?ݜ/w@'"O٭ 9.#A!4ȿLڭP':7yBHPTߟxۃٟ Ùd7&JRƊW3"}y>7G'>G@#'ݔq +Et1Ѥ&(cn0!y1mJ3a,2) GZ*ھe6bӜ3,9 ^xv`uO64.JM*=ie(1~ f߽$Z(HZ>&qVb\qYr!Z4=p >ˁBWh֐="DjM}iހ;E,椒k/~fAZ6bcDLI p$' 41:J3auLZXj}F尾'X"|e|X$;V~7 yJ58?t!ܢ;Xj,AJex1rek f]mHo7 Q#tC1d2ITO,lDx;_ .Kr`Ipk.x KLMi3? =|;&h$mU1B߂% $tum ߤTުދoGS=[tΏ I}{]>yhp y:r "F{+׷O뉑GyԻhqFNFP? \=Aӄf\sAg-qK$YYoXy+k2)5rAW^HJӷ nYK])U[Ve{H"`YK̚kx0%bQ&3A~Nby?qp|XurW,r5'ij ⡰E -ךLFG4PY-)bW0c~.ydз>u@*bGS7x.)p Lt-J)r+õ1$]pFQЃ=sN\so6qT޳V&$Ou*+p Rn׎, GDQyo lBڂ_lK`7_ &]X^o(F2tC@DkoI%jΤN,yFe;%߿@"9t䰷XQ_6%WGTpu(6T;M%6 eci#-#Q8>3%S3ɸOxjVޙC@}wpVOdgϙCW  BS}@&T1]kurFړ;|C;Z u儭Dd4 çB :_ѰG jZa( Ey6Pu6'H5(j+!G3dښ e \/ͮ*_!ӘHEQFOIn"j\lXaLV9WvDҝ`xi<Nb( hɗ\nI\-sa#+g$XJ]~&fIƕ#*"9/+bdb=Gc8Rh6~8UR~vQ@DE>l)$\14S*瞭tD*Lu<J6FkoE?gǮ!MKN,fGM+8r/R1"$%;C4+a F@9i}U ]$~7HwYO@F`i9=C'/];Yċk"9)mm;$ZT?zwc HhMtbl(ʫ LGR/=z_1O6r&"+@c@A.s%|ׇ"XtLB([u_] #mtsZDs3 vF'7cf!>pOWN0.(@mr,}7,v4AiYkG)DZ`ȻfjtѨsܤ ݋pF(`@j)*sԄ:}y1z;/[eI駄¥++>0s^T6aU@\:J@FDJz#u sRw_qǷ5DŶ"A B:XԏIwMCeLT9VmQr).<'4h~ˋρHTo{w+*@`g啅Ih^j$rl옲v\D\%.P41! fl rCIP(BdIVt\cVy)ir6T[CŒٷB"lf jr6]s #o[j} dJqCR:M{ߢ]$[!YDRG@`Dqj1x1O*CX'Rly-9Kj\;4NAPQi=;U}ڸ;&6$9)<1uV 皬pʳacp՞z)R~mKGCHîyee,P5"M Y%IEsa{B6D@HbL dUԝܤ/Ldm.L +{ϒaEwy>"2KDqĀ4lw׸'FX7j~Ҋ}ZXZU?U̹['w 4je{ <H0{,]_)?qsQR]c^7?Pt8 3Te¾&+1ܶJj|l`:IU҄]jF@*.5ky3b/yc#%G8. :j9ԑ6dis6(K+ڊF$%4k Zt&: B8aOܨt ԃMaP}zɀ:nH}~}/^jP֏>'&jx)K:B{g 3({}Fwk`ef("|y}̸;*ZtOX4<rK5G0<5Th;8졍U`<@ Q1tJɡH7 h VHgsX ]>LICq?$= $jkgQe1V7k&T Q$IuًGh5 !vED= ؘYިj|ҕRA?ӆ' P݅U]Z.8e%nXPmƎ"^tSpW%H#QgM ŋTwG0D7kp6`B5dm,w(6bKbPpy/04;Hցx wjC*AZO0ߧ6x1- ui=b͛KϩF.A6-Xz7J|pZg҈r%#F1oӉY}x>q{PUVUpH":T4_@:`iK#@pRǓ)9gm-Г~яқ<uۨO{EW\4eH,=ݮ*,|di!Mh#svCe >-3i`kRׯcHa}=?ELn^yunRί$Օl>ʧ3-wڌLdq'MR\@ZΪ8J%rޑDmz@1:xK8MhiF,@DSk=,Nw w8; %0PQPĝ;J>IEz/lY׫dZYwԞ֨̚I.zأ )U2{\czvw]-ymseRg $׆CkGAyYn-nn iriv뫻DX'"pBiw*<ߞnm|1ãCg7-*͉kms_(;h9S(\"%]&^ }D? KpĽAٲ"і;U+0\Ĕ,DFa\@#=΢Ty$$O_6-U_"E_ gw*לarjvl-<8B@HeWr|6H,q^i#daJUžؐ<8}DׯJK~8~FWkUw|Mh,YQ-}ށ.W(L-Mr1vY5捌OFY{{A e!/ I% Cf'Gepի]<*m׉ZC@elT+ O뮓v._q?=4?q޳-Ilނ%ޢdqKo;3I&=ZchA MsyRD -k~1C 5E,{nߋά[ݓ ,' 6 )!(5~UMJ!(|koT_.|T1t=-f•SgycNa,{7#:oc0ׯfa”Wh6sHBD?c\!U/%xNlW[R _= qJ&j&JLIߌ#q:䠈HՎAz ֬iZ5c""68AohG4/_ٱaiPlӮR~ϑB5 y7fǷh/ sqt*r}D`a@9L pPj/-yC^CUXf b;BpTh!eǷċ{=7&DA ZHZQy=߫'RL~cl}*kQuCWwp!`ԘbsF+瘴\SjOᇎ m8i} a5wbqVJ@n=p^͸bRt8kU4l-P P*R-WX$~DC^I5쾞rlO CLF aN+PPl7C.`um9S)9V&w"k{Vu%U獉'KGXj69"kޏ|Sű b+ j${d]pN^m[MC3we6 Bmޚ`.g ]W+ b6Wd ÐGb4V%3[5 R#rѨ(]}\bA%HcXXK0 Ю.'5"쐔/{7Z#ߠ;[.$kf گL?N^nr0Cfʠ?*x6OѪ. ו#7!˃5]glPŶw&E|w`hA;)a=kes } 炘Y jȼ\SOL^k)Ԧ+g5duhwFE<7K:H`kåA#^90,֌ug^xң&9ՠ檯ٿ!.0#9x@$: ]8Ce]ruRO!dݽs2֒x#4a%EVEQ̼̠돎[iwIJn^%ʑ?n C w*>TʨDT+(۵e٣f)`si H; kSkk/`.6 2u+sl '=o3wu~{:k٤^h@cNnmc*dy_M,|F]5YgdOVf$wJ8c$;Pa㴍h\"q"~@)gcy2xmmrd>1⣆;9#7 ~njB{uy̝J'_Jvc7]Huhz)a^$3L)3>떇}ܿ&w7 L{`eS#UTqp庳A}7ͤOb]bSе\yR{v?5^#jvUnZ йh.eI\A!5o@HӘ{@uI<.USj{,%3 fC Eΰo D!lhwh"$-'VI 1UpVcαUz1lEr!L+MQĈtJA#3d6ۜڻnސ9_]mVFY0˒ Bgôw?6\`h\T7GNOmuq1a;ZiNdx=6 аd0k! k-WmWHYqYWV1Tenxs hи3_lhZՑt4$#޹=\4.[ }7 ^FRFKub췇՛NUcG`8tX%KOIݠt3bH<2̗HW\'SMgoe1"ۤi`/vT?6ӛab'2XJXý~}Dn&CLiKD2c/Qo~ }qIqaYlVjshO̬cdrCTBXGoT_Lr6HBGCÐAWIZB- &E‰F`5j|%iw͇bd3IAqCErjܒ 2,+Rt*ek-(ozjtO)Nf1޼֭S/d' J,EϿ䒪rfA;l[1~C|ܐRVd}I{fSH'r|ULh'LvSx  d[ZR$N uB.΃ ..j:utSo' qRWuX?*v0><΢HaRe (M[Y W@eq0Xآ'aM~ gDYt) zjqNJq|GG OlZ#;2 /K>h` qe=`K $q1wcE]7`ﭠlWc3I!)Kk4d7PR7K"OHWL}~Q͂ᩥ؅vYIgj4Ji+2?_janu=Fo2%FJ0\ ,I>?wFN?YSP q,uG|o%ʾoV.=t2^ ~9 p8tq Oa(|cϾGdr%hϐ!T(2i? IA@~~fҊ)x8z+q2>Xt~[;Nͦ(D0d[)U3I#훎M|\5h sgK4*P/oALU!uړ?zuDIW~wK'i|JlNdk@zKQ沲(X ۬o*) uS"%EPDѢ1^㹜r bYdLS>>[Rӟӳ:?؎"$LϬwPCOz)x!ӅKQMopDda+8?-xUV}Jloa_d)&^JKߗ#eSGE z(+, ;5#Y}U_ig'1|{#U3e|,ҿ 8_G [l,YFh½v#bkg^3[gS$lr hb)AV89\o'bϖCߘF_Gw4c87U/51rVd'~x$O`܎7& "KFÑ6GXm+=\ J}X3ctbk#.;ʵ]!J.N/rJʉut)5ַ= ] P* g_Fd wwXHh$Tyqf2 Ċ\B}r%+0/ʗ0BmF\3p}N=G6dŽ* Yń@֒0j> ζuت-fz͖Wqq(T?`xFބ$+/SMU0+d%$|ChϺ-lT-뛞nXln=vPJ`ꅱg 9DkCWvd3y=J,zU~!߹  Gs_] yʼnH;N5}t1Hn_n1n0^OBGJ3I|RX>{V`4ƛHZ{\=TAQ폴p#CpQ 8,*Z.(mN'3pŖMɓakqQ=G+6nw;v\I@dN9ΎfyKO%6 -ݧ`_4c1T~wj|ضCDǦ/}`l^k$5$q8M\~?lɰ(nû#{,5[GH"zNoR n?4[Z)O?{/YQ(Tc _$e8z$-u\ S .J Ưi9}vȓ­bANvg.H[WyŴr.k{m.Nm Qss\7ձ Mwɿi{& != 1̟^, 8D<żIBұ `aeOA}qu1pxwJD{93HefKNh]Em9LwPCծ/}uҫNV_愔CacpNoETa_kVt&w[^reߚgf؛i }.KL7A.'ߩO NDό9C  GJoGlٖkY'Iz/2mqd_7rZyK5@튅6%)VN1(8CL kflPeyS%S+L*t-U*Z K 87o5|8z )9)àZ: cn8+7q$xjh 2s߯si "mgz(FȞqA5t^O`(Z;N%۹77lvLk"cv ^[E~eQV_(.Oe!N}JmN2}ȕÆ![éUL>E~ExץPR? Im<Ƶ OcG0t~!] [Wg|H_af-;ݷ@cH3 Ub&>ЮUF%5Ų1B|Pr M{`x3OO݃vV gd f\Z!Vķ![}h4f")?ZaV]lӒ5Ľ6+w(XUQzdɧlrKUEtR9*$u%פ.QFyLUDm&RrnTǍQ1Pq/bZ!d5PЎ[3!e7]P3"gsP)_zsHЪi/\ft8çjXV)dOsC4vG f5܈.u@ `D&;LCov*%h;@e%Wa=Q(-;mpĮA,Z25d*¾m KqNVz/qO(wϚO/FD;m,m ÙpRYٱ,#xN1M f4sJV%E+WTWq 2ePA2 %K Z)Z e(=o~$'C2~ w .X4HW>L7N1ᥟ댷6{P1sVNa!*Q6^۴&!Ƒ44ȩ.sыY}ELUN2Ӓb0'o*I XP-=m}=Dt+t>eU-19쪤ŹGEZˉSV0۪]JhꧾMQ -MSm~>#ŰeoYka{:IZE?}"&;_t+4Qy lMB||f Y3 vGYdq7ַjYP<%czd2uLjvyT (>h l,RNnܐ|>7,>`>>1}ҋJB_?8 H9]״?ۚd6ϑxM{M_}2F|?c 74.2([ ߰IqQGtU|;\rRSo=8y0XtR+oX셥JD"V(5MgxImF ,lO5{ᑲRŞؽh0ﴺ~>̰2"D Wm=AJ[nPP1TГQy~ӞOlt#ɲF=/-xF&1(ᐬTD-mUen;oIM8 PSf"R˸1n1&xHj'- uc$"9P)^3K.}%Iۈ_.XvI^bxoSMb BTl I5@Bav,T?,#`d,UZ1SyQV6wNiWxj սu2pbYΦݠ}ׄLutۑKOPᙢ4 U) y TD%qLŗ=%J?\ )>;yDNZtˑC &6K*_(VwqFߌ~VVO Lz9S]o X}SQm:V& G #9OX?aaNJr!B)T~|_2B/nS@W;žq麝Jb1 v*J'c-ҭt-<3.涕7DK{' V%Ljv/_81IJéVON>R i#e>;vU"_tJ*FJ=Յ:8[y7FyrZ؊k?K/EQ5iJz bVLk)%TlʽZr'Xƿ1ByNS(Gx&}S`3h.'BYQP=p@J h?.q--2/fNqɛ!X'x&±Pkس [C{~M=Je ;w?v3jd~5ՠC|rI} g헩ӢD b­RPH\/lNz{5P覍a$ YOHh\ɘ휨MiKiq)1@!]>YK2^OQ_^ش˼Y5\֋^rI֚ n!ۀl#WNՈѽ,X# ׃"z],"R7@d.ߎIOtGlDKGﰗ7>?DHb:b|1.MT45Q2Kl׫7&9|EįQN=f઼O zpWvn,ԭJ!%U+p@ᚂY-XgSp"xslFPh2Ѭ„s)Iz-ʒ7Z57T:,g|0NsH.a>՝=xvR$$+ v v_whPϻ'jIx$|RNA&=0?/4ƬG;}"BFrgyӠ?ǝg8ϑmnpUd6\4ܭ0EdF̰lP|rBs]OEjgm@BXg%)#"gL9aWS̡ƻ@7׆ԯwP#EoG1kc׈)C!]=բ xW%Vr\ЮbA~Y + YO}&ɯ lk#dKP,Ge"j#!բ,*n3'W[/2`"'x8d.p mFV#bZHj,ftmk[f ʨ%ӾZƢԾD/DmaGT(Z ?$s*,MZ*5cmѶfV*TyJ'b}/ _=id7Qg|b>!Qfɗ yPCԼhLF\y{~QX砐d|68cb;Grڡ_ 'j3bCN;) -KԉJj.?wR7F\E?F7;U,Ug Y PeOS s]lFOST&xDvm:pX\w+]0|>xK+dgp*,c ;!s8ohԕLYB>+mbce&*r,0QU,T >zs> K ~AIJE@xogəCPKvUH6(opnD6¦TZ *h& 8p8/4Lk-dW\z.c?K>Nmd~sZ& sJG% 6 (]Vî]jW+MX+J4 ?W8RCs4LU*6"kijk7VB$͆9b2V/ ԁCSF$XdS7G:X^1QP;OWp֓GqV]mDmf?dɽ.>` }xm&y_>%‚Pׁ bљo3p8Ҭ-[›#~͉ZaRJ&q]1~U$=9}盃50;-cj-O\zenO:ef^A!0U)ΎJbl>`VP{L| 3֮?z|݋4v!}EԖ ț {g[<$Փ9mJc‘'W-Il <Z\/_?mfc.x7W+kWaZ<@(R|jd*ri(&kD[ă<rngwE $iX V\u"deM; !݈/cٱ첥C(g^KDӝRrOQT_ >߿1z|9|2QdӠqXWUY,sݨ>!{E Gfo/c=hj5:}1fW\j1EXwQ°=mU}!Zklܕ$LҩXsXF,Aσy~;ME6EeAӆ^?Hl-z%C&%'vl%LcreXঈ N8m)mHv ]0|C浼SKN9)y)%چ5]¼HHF8 -+)'i{Ɇe> _>NVMZI!za&J'3ْQ:Aɒ&7L'WM.PVuG5-uvv /w}M*Rld4Re./*llŲOjZZڒ+3k[6-qmII ib25 EXc"eNj[V:" `4]]Wџܴ®>x#o$}phV!3ja jj$cq|ƾ9u2 o5ꏚs uSV838383838383'=ggWy!ouiCF'LG?pc݀>@Q?@Pu3K[ T+o-Iy_RH^J OA$WxV`2q}RtcZ!?mfaz#Ҳ+H>o Dǥ&|(_hv'YJħCGZz)+ Ea 3OWWGi4pA1+_]63]I 1PڨޭDL8I`d=2\x $ csv|z1lwg_Gmfm,.103в ۘY`t$LD%4vrGmt)SAo vRtsNOørTh@ *:.z(QQv8AhmO۱{ƽx,}j dUW X;hq2p|`!ͫm?jj<B^F[* eJI^j.Ysmi|j%GvN3u-3 ~O{i^Ό"+J X^l9֩tŪAV)>1Kbno!Z.Ylƛǿ4QKuY`j7"'kx h8#@J@!X~K )toB5~ q_@KV\&$Qh8әR=!`oB; fc8On5i@HV^Y~Tu>O[Qx(ie"pqH v#67N I™_gWߌ=Qi>bSj ĂW(b~X=}LJN(|Hm0Io}d[AZ\os͞8l59{ =|ۊތH]~._@y7 u DMlj^ KLg$=LĸjR@P5d SIag LgM+4G ٬ۊ 9mQf31m# Er#nseãWכּG 48h83o>p+k-_ ;G"{3WQ!Nu0H$"qpp1EtŽn9bJOeag3Z-~w=x\'MMz`j#7Md= ې@(dHT @?>K )t@m+{\MĸRK mD\($3@+- =K_ lgmGa03ueW;~Qu/q\AV>Z‘lGQGmgFj^@yѨ/ |A]h$gF 8H Q!Q hqLi^gfjѷGW-h_S־M mu&Taj Vעl ˛ '<5x/K )t"w"޻;"ƕF]!G[;@x63G У.ĺ3|A4Y_ )QBg5-cN%H4ٍt(Fo9$D:M*p5طOOP'fԦ#oi6_Hҏͯ_7j35d*&D;8_uW{v])+N KL'q.t1I M8o/`\G H8]63]u[GʕXtc/"/ګ "@޽9k/9*TX䕙No6,8$J:w:]Lsslu龚,.3pB:A Z_RPCR]\!  k)pp.?IP~|9݇8^]-QwCl K2өp(ܹ^k)yiqFq]NY=63=aK|ҋR47+Z+^69L*8 L!u>Hi~H1]/ "Fb"f?m/x8Q*U]x?ppez!o!'\٢P7e1+?b[ <{kdZFH'upjYaONvLi4NA> ۗ0seÖH}gx,5)WtB鬩+~۹ j^?l?au8pض9c~/~aAͲ۬ӼM'2~~IB#ۖn{WdC `{"kgkXZ˫udv̀?&[DT=퓶3lTKTf?vm׵lPk]@Rj_T̑J{z'a뉷a+j\ю|hGU3fZ`S>CY>H=/7Bh=NCh=y59a4?ҹc'4[8Q:ve_gvOޒo=4{h~L,ӭlꭴ.[h67ʭ}[fS83?BNI'4[G"?1+39u~: }DU+ǫt!'%*K!{s6a}А3$zȍ>RHV 'r$(LCCn}CW굏I3萋=`r٧*R䟗3M@dZεbC/,; h=$[ItȕPn{ 7ʭ0}O!wtA!G`Ϩ~ BZ+K/]$:ZD}.TXSf'Q:VrqT:KaCw,1}i۾DCC)l9[]%!Gr+ıSh5]W*rOJtșRn;Jtȭ=M]<Xb1 *rΠtZŵeCۄ\2mgАj)z?RΔ萻I͖0 9o[a&tRdw 9 {Z/8RS萋FIt}?xv٧*ǝCw}7x֯[ii-w:5M.fmHqaN }~{Pyss讯_ Ό]]L6_6xQA^8>pytWx}CD u:<;]bgFQuW* }gE5y4HQ=OµU+ 6HKͥ>g rIMv].YJkg1yD<TfDgNhl <̚9TX)tB.`ˈW+Oԋ싓`g Lgmw}C =%"փAzP"bDY?XO=~ K,3ӑIBzտvH UlNtp+s̭ۉ-BUXt#&Oҫ-#fǑ@գW$D}ytg. U]0p:dW]CSQZ)3QEkޛXU_VnQoo`9/W r,-6I;pT1I+02S"XiF/8#/\B3'hDg΋KܺC%șLeW1!E^lp/#]=v.49++r`$z)٬\A+K)W{XPa ef:' e-$JA"Z?ypË]=sLڍ'[5_f(]+8h83Rz ?!e4hzeلMAz>UQrz%^u0jV ҫ%!qpppfQz9Bw˳|޿qٓ3 ʎl1S:G/W ×^G9}NYkk]k8|UD{*gze91N3g54s^9TX)t\Czu~qqS^)RU/\, LoB>`3 r*_E8'Ie]:btia*Yҙq0 EƫUoo931ב^%*ő@Ы,Kri𐤠cBC=±iHbߨЇ>ETȯCīF]ZEI^ݴG_>+=7{ٳ@Qɿ^5DKYۤʴXi4)QSףqyNu+}k/4|^GGIG3G{Dgt4s,g9 g*,Af:;ӑ^@+J.S~:ҫC酆g:W!`u3:gK酆gX?8^'f iչJeg:3Hf$=Y7y0#¹gVEo,>6]k9/r7^=ܚ^qf$z &"I#ug.j-|%Vu0a&+rz#*ponjC}_[0s!& ~)jN7rىn N:Wo͙͘ԝڢ9G;2# ͜JkΜ,4s-Sb*,Af:^E~ T^@lWn!tֹoBwRKBugnq 8JB~b K,3ӹz Օ=2L6D^_i*]7ZZI ZÙ5*}Ck慘o^aB=zwMZL/Ä8H&jZaqU+Q n#꯻^ qf5Qz[aC*|.jYAgvoKU|"3|>wsUwy/>H^E"zܴ}z9YAcFDG0r^W^ qf>_>"Tg"s%X$t?Bzآ|rU֭DUON1lY'-s>tAN D?BzJEz'ęգWGpׄP{ƺGlU^ dH~l^S/T>XB\LJ9;ɚ9TX)t# |pq Z#a^ qxz|XϐKL/ 81$ĺɱ,֩23{T:]TSf(tJj'j3`{ jCжr4vKxU-?Z)תlX4hkK m^;yኑ`q*. r_!F¥jǠ_!P|a>MWw_x}} WiўAOL7/Ʒg{uSL/dct]M!]m"Ge/$rsg8:b H l c;=~iO}'n @ggH>i _Sa ?f:mg}5YGj Tp=yxWC][:;(wtԲ g ,8(>뭀CCC xL X 0e<3jceBk\'k!K3v>QQT~x G/eLTG˴^7Eϙe~[f\]cxlͨe֜PУU<ŷsyt~,oߺ=q<|ya7flܤ OmLs?!Pq*FU[lG1`1X K·bt=\{wl&HX^`vF[4y-œf;0(A^s#GmgF)|=R?26/q6OK|Iw]av"*Ԩz^`&/uSpppf/?f`ΨaJ-xˉ+koѓۊsheCWn޾j[&[Z4豾Sa9/ u>ARөyZq{nyKۅQǼoܯQ1߶<+1!Φ}kD{ЊnwqQQ|k8PD@ŋCPL  < 0@4M MB%Q@Ӽ <2TLDMEm~02x_?y3};5#_p{}YY}9 yk m{͸Wr GbV€\Fr ڠ*b 4XMhX>5& wf>h?,i+,w{,I]єPPoVQ L LSUW(U&Pמ|m_.SV36g3yT7Mkw/P%+thH 8Vh37ބ:M"rZ W @{YQ'׋-7q}Z wl&ЖJ :r'<:^ DxQ}5M fDurN8! m498UØT69ptjǮE-5*23uQc RmlfYĪ㌇Ř[XEzDovs=5s8]UYYEZ6\cjQmYilC7PU1-\t;e5j|Ϟ664̳Ͷ^`fblb֍3<&zxolPW}\tu>V?+@[vG#VfbO|=VWfDb Bu[(X#n7Akbn2W1tWn$f,op?1l=T1zRx"?{=B4>/Lϋz$+e[tj L!VmŪ+z0+e-kݨ!V+c1Vtkw>V6v_5"wMO?'w},We'}$k/Tw%ʼPF'`}Y'^VmPw;득}嬃YX jQq5 ذ yF0KÝ;{]-ۀcYA=Z5v.xvdZAN5Z6\H164[N5[f [l[Y%ie,x͢aO#~5Yp=#ȍ4cefs{W*[M}E2}zTdA[h"?nR֠*ppP.0@x$ػswhΤ| "mJ"va6|+ha@.#`;A l4iHNew<{>x/$:`GM?}xݪ؜5pч;_SVTE8g›KfF&ΫKSc0\%Z,l̎nUuSsuaf_)p&% V :SeZ)C_S2pLALAC۩TBJlzmR^ 6{ٸg{KCӞ4NڙZRщn{ܫ5kҐu9^#v"ZG<GQ+ܟD.⩫޿_}:G9z~*0; '2>W~tz8=EaLeۺϴ;N^ROJM'rm-X6N.>9^s0@O3 nqIJw@Ф=)K"Or@sDts(KVѡ)>[ShYX?dP74>/.g2opu(Ckr[yF0?RÝ;o>uHPjjozf5ZqXpj99[6\X1}'M 쥣?"w j #(]N<'\r#4R`*=m|kifȥ# @{ʽβMN.hho^V3A~{rx<,,q'س\5!vpѦgϊW60 P 7(FV 4XG͡n~Y ]K^`IgG1"l Nb@)يa1W W˩ A.1a'U1FZgԞ|ֽuLiɨqf7X=)o3f¸ !odx9+R b à zDyYBB?(]9D,A rmuN0ܗ{a_B-q\cLj"B7z}hK TcVS[BK)~pKw+t(k s^K(FphY+t< ~K3\Z.lt`߽cҺy=Wtt,˿ƣ鯗q̫˅Bv +̿SCJS+d[]Y6N.dsm ='!nWYzĝc3ct~y^. mo#rPCYA/5N.g}_`}AYX7_4]:ee;w;Wxա'miGyF0TÝ;皝 Caj+HF2\ڼF+c!KLdZu bv .dqK h^KP@4/p=#ȍ4㠥RI Q̂Nd$S@GӰqhi ڿOˡݭf~{ ĝ-P@^%\)4r&@ -XA r킀% :H^3TNewAV5nɗ0]쨵С;n'Uuc*0jЈnz=P< -s#FS\4Q:^{.窈ف|CӖ> [hšN>X Av~?) 9>Ҡ 21dʃ^ $ĝ`(^GY@GY@v$jՄGUx>c2#3ojBY)ӞbsD.+/n!@{G.N.'@зR$v_lZG\Uhj%VluЋw\"SNw>ְIsL﷜Ft竀իZ0}F}n1%2%hJȲY6N.X&=g;_ 0@O  b,y4i{BKZUF9(]@Ρ,YƅW5N.g]Ozנa'Y ,qg>ujGoyF0 @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ e_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8$/L"PK cDtiab/1/testnet3/db.logPKD ~XPtiab/1/testnet3/debug.logĝrJPPxju$N0<=ߒ-E@r{[{Fie忬Eo|3߸}wo.;VO'P&lX.şۗ.67ݨp2J}a|}O޶7?O.C˟_=^}̷>͛O߾+r[ϫ|rk񷏷e^=ᑧ/~.7ʥK}.s{oi}UW>ty}+å_-"U{ /}s˭vs|ַ'S{'w,w[Y<˷3O>d޳f<]~ssR忧~]qMꟸ6-@^i{ovA]~L_~ßkn_ۉUXn<mW.CͫBwn|&>7|u?߄\͕}IaiyM?U5(鋢R˷o< !*'^(^ݛvytǯcy3+)HSS4i }V\;{Lj5&)Mv)^~-0+pL76xwc |Oo0yVM5w[Jƹ:WRWݦMJy$`f'_`, \5E˔Y֧I|5YC5˱̓ ttC߸t΅98;نkyjspYcTɫ9W LiO(qҟ2dC(\jUTXMBl!fq]ҿrg1}<\q.tИJq6rB'cU.u>8m ̰T1.0f?,9Լ^r>D\knbo <w~{477hxsa:S;igH)7EYZX0f[y^W3`ꐳ{Z+дʾ~ yӣI?6΄1A{X3P,6՛|IۀQ9+VL .Εoә=b-g Y٦: $hPRhƄi蕤yQ.`Ttd}̍{R4Gw! d!T]й@@ИPDa皓 yӲg#'OgxYjZŘrtmW̕tjG@宎ȜLk!&%؂tg 6u}:kh]qchQsz2Llb"wk۷8q*'OB.7^u;RLO@h@O&*QX ˈs̪4A0٥ؙ0\\k B@whKMuƺг +SJɱ guIH*9)S&WaԻp14LGs |hYnB`Y-ښ.& z;㚓_45ՇЄ+D?O%V%/ 0̺@h>= OQGsf(QukYʉPKw[ɼ񢭍fG== "!qLK(X*`c׻ivUL5@3:=#w#сFK[uQ#T6 XrlEY8 ]bƨ5c &G)j<1(ScQx9E3kڴ5{Ρl!P|Z5kEbs`Jĩ 8ذHeTVvtг nNEˮ%`&cyZuC&E 3v@yUW#b@Of.㟯ʇqy|UMĜl.< *w@- T۰N0ɰ;ù׉)8o.%Y$:FI0T;tu/f(p^W4:Гbo&j+^9L6t_&`_/ GD;ŎQP 0FAT,̢QT W33Hr<\"gLQ4p @OfH* <18-FVʚwR12U_aF(ވ~9.pB;Z\o ;Ϧm5qr3 ٱD$$3aXP{>r!P˂EɼhGVJl( I9Ϊ3Tg̙!P`{:/b۶7w!&ʊɐ:'"+|5"gI %< TȷY-mn 6r4Dm3]PĿ @whtn 4 ;d$,j=iW6@2MYhh ٬@(*"w6V!c[Y;?w嵸٤dR$fKuSqaj3kE[_ C. |d3cГ X6g(جZBg=3+?G|Il[=P{[?CdvcgjlNQ5s2"沩i Gw=k/rjE[#Xvq'@5czlw&đPQRUQYQ ]@Ϧ\7#R% ډ7敌nbOIcu.rjcF[77CvT{NĂ {ٻ%~B"gp7 4+PjϹcyNfF=JaR֨89[ArB8:hʬWIúvNij= ߉Id aL+=14t]P?#GcUxT US`圚J*gV!͊,%ej#F#n2l&IR b1H8fc{+дp}_"71%ٟ[T,VKw !c49&262G=D$ tG@Td覠-Z ժ4gZיoVﺻ' J=1€TJ;ѓ`$4yx/$qϘplŀY6fѓ`JB֊߫tϪg|‹&tmlP;e0D *$7@"pB%̀-KO n/Ť(mPz2ipC}=TjiS!fd <7Rz[nzD'#N&F\B(F4|˻)hIdWEn\!.TWL`9(@qAl"-&A|Ev#^Gv2e0k]`@#4zc(%޳ v\QL+U αxQt䛤7%0"Ffɾ>=vbrxmD 1EIdz#x0@VpCfd Rtux{;Z65I(ts@K+м9$рӇ x*:%LNg]LTO aE\IX^$ux udQ&š@`Q)"u3APb){kB#/ՔlXpSSOXS斜Xizɫ"q~#DiE۬@=QCuz2v4xb$[cTH&7Q8v?;͊y^iċ'@ic#?o;P\)]HT lj'qO|m҈b/HN&gXJm?g2Z"W-&mŔ4ژVaqO@יNf ]5[`ĈW%ZQ%sTb@gNh@whQPZ:q_J\X&3&f \':`^@#JH'30"ƬHRtΒRu g0N n%‰+1&+ڥo1%/ c4D ӲN:AU)kuG!Z8%xυʞ$S7Vd)0rhH"WIזֽ&Eͫ6jU2 fxP#ATs.T5bF*Q4iSB:<TH{RwK17Pwdڌ森A? U# 9ЂkI ڲ_KO\Zeb4#r'KT Tw.I;i(ң2abhb8Cg()2k 'KkǎsfISһRJ.g"1[l4 kbuqXyRz*djabI4a(ӆ4KV( 6,c& =YZ8"KV >6TлPEK [Z *$&#r~h ^Lκ]հgP%(N%hq F$2*8T@,lAMgXJH*07Pdi-bBui DPO/;| A֦ʖ?v̩oCELY dS:@=vmISeF عҜH:7PdiBpz2/dSI hDXYg=d%Sꄩ24{ΠPj0}2/4Dxf,Qx~Ӟ,ӆEf%*C,\tC|z6/{ ^mkʌ#e=*g3ODӅMjW~Kɼ[Kf\Cib䊉 R:16PdibCdeŴ4uҜRqJ $-+-.-GU ԰Kg5rSjtVO&K)XD7 M*3{dm@ `$g.YʟlJNy 񱡖V!d `D2N'@_q ԆIx!fi+f#<+<Fd^3 vG-أ)8%[ ָ4;k}-uCG'BZz*EIEϠ{ O^KՉ(I/׹$צ7P8g50K'RcjRsC =T5P̖d\xR1AhIF-^bT6Pwli;hٛ!R#~2YKYJZ:WNmTESo5"R[,_#eYFI]JI Mx$Zd;!T+ɴ0z\%C9h2l-a敺Qs%L_ PG\i)ddZ8USx 5W<Q6/_1zuǕM0yP dNM o YFg#ggLw) m=ioz5yUz ԓit`8^؋ZMV8aQYl'ȪL D=UsiD1ɬ6P0O.&B̑,|[rA$E=#4{WzՌҳɬƀ{x>m\X!6,'Y38DZ7PTimWA=Jx}ŋV$p W^li+p[f y1Rҁq(ʣت &d7rt<'BjsA TB{+E2W8|)' 0!Ez/RJB=PG\)-cC3S&Μ @7tY8c8^o1vPJk0.!TmG՟L 58"wɽ#_x, Hxy֥qRѕF,m=dWq |'BJK#!BVɐEѐAy: =WZq1 -'Be2INBbrh R>$jى$Ɔr}+\ɉ[y2NPOv9ITi'h4n6¥6/,I?Փi'uކ$MܰhX]C$bd)rp%$x,P 0 a X\o( !$@/S(L!z`>K%?*d c*ڦ %aV%Lmac QݓO!U=,%JǩNb.RV7Yl*E+s5\jC tPYg(n{i*f9-u#%id$m Q#KۦhTteT'BTy0vdw4j`۲vq),]!TO~9@=vlO3Dj,EZU2''Z :?YƤ": YZ;Pb.p2/LST'[Mj8 =dʲЅW;G.F,Yb'ɼl%r#/-kY0rر2E;I5CD#Kvh14R6'BN. dn:hi\JRUI9ihW{粓4bKOd^Hmv8eTuLuB$#IZάyj2;-{ĐDL|$@$ Y Wd08 Z۳P&@p:bKT7Xx21t2FqKuJhJjlunw-TPL 9~ٹ9 )2PLcgLV$!v+F/Wq Uܣ',i-zDR!&l3Xގrh+xUXiϖ֮\L#B!lI1C5 -`WDmoiA4i3뺁P҈-%ѡj/Lg xHm_ n+ ^DFn[ڶY 9@=EdECeD[4]"صP4{WjWz 8Q,M YM*>~+ptH=QQ=%jQ;eDpUNu>P*, uĖ275f'Ød .RmA^eމZk{i š8;;-@!Toz21Ty]eɛ4ʈ#() IFZZC%]<*B~ l nA:o&䍧Ⱥ) V.[L^UH@ݳu%D>-N7K$r6K.[HLWVHl*CϦ9lɨ P͌l, v3k$!}ZAe7ov`Jyu$z*&$ P,؈4⃣J$ ^Yu+T?j4?{ nf[|+mhRC652nBA? Ozuǖ\ cy`؜=Da.ZpQe x% SG&ed\celg6HiڷWqA=c@+XKrv/S2 3z$`⣗pdO$""xO1 \::!ٳ1]2x)ԎDni!#24I$KBJVng5jAgcxD`$Q/2NR{DEn6UŠN҇(NPq7b"Qq 5Ӗ1 +A;Z"¦ey4 ͜CRrjPYgX(Cժ*ĕY|lܲgK4C b8 "4.ݿ).UܾTͺw|t)"x?[9w5O|>ûZ^}~t}}a.۷?SCWgpOݛkuC|᏷7ڪ~QVK5tߍ?~{|GcҎxlCyU{zh/͟-sn+ߛ)o=ܣ\y}y<\ʧU^OhC#ҟd:OzyJ_S˃ݲ絻b\8Nfuy=⾼y({xR"=GA_K򏎝o`1c=c\=`IL |J @G( :LOmI"`$7~ n;=^Z`3ԼV}ؚzhvR%x2KopqՊzvԞw/&Z25#]G*<26S BדyM&3'K|$fd-q慟h?+mHy\$X>" ^B=},Yg8鉧;dwUuUU|D&w &#%jswiVFͯv<QsHW+ ΀Ϭ5J[KIF0f&smʄkW * j~~\-Xʣ/R)>X" kQt3Xcl>g;u0Of  ?09aYn?h5~7Uǭ3mS1BÕto?|.gUoJ^n.]؄Tyqv5hJ__T@n(pwo+Wd{={8ʊ:XCvEI ">$6ps\μGBFQe(Dā0WVԮ&l @ºҫ8-6~ߟ! x^N w$7랉0-J1QU*UuY3nJ;@MGz}+ޗǥX-B_4ա1KI북;dplRO@ j2?حM"xR| }}B_@苒}8=/'$EWE#&HУ݄`"9 qzJ<]OdU 'Hzbx^ՌУbc to'BdF"zy8ﻷ}ٌsGqk=˴u$zYE |;79,rlWՆ2z1z3}jI+kB_] dIꊯbK'!߆ƽo;JG>vuMqM">fSH!Qrj T9N*swSzFs#4sOvzS?c)14NΘ{c=sOx7c0e=#1ƌw2v$cINL-NnWaYUCz!T_(gތ2fY3Vƌd=s_v,T@nc(`U}\{{=ƌ{81Y]Ř{!cFa8cF(cF5o `k0lՆ2f1f3}jY++\Rr+5do=؞tlOk$(1eqJ99(s"ȁX= M!ܟۮ/oFObS>ɥ=y80+2ҘjlF Ԙ? 43ít@I;5𗞢3eŒIAr!0wSSsSq{ lsižMBn")cjI- já) L lYm8 W-Uwլ* F2fKy F3Z|D"0:~UZ0y3#W-fK]dVσ˻Xd`(?`(jh~p(cW?"# ܽXc4|Gʝ*YUX/?VL.eX$,#5bnQ}?Kǹ=$xn(lc(j4$AvbՆ?HlL_ZV{Ъ>G&uF@w"DGF{92qd'5܃D=I^NjPcۃHɏWǺ7? AO 䇅ˠ\UpTQ2ePEA^UqT G]UeP=#w2peP;2"9ѥK8-T^4]NdU pc1ѕQ_Ut<ˠdXA(&62" LVv&&Df] U0r&Z~v{DWC&*Lt fkN&Z2.*PK&ZItq`kh-"Y͑rk==ָkqOdz xՂcLWtTbBׄ<^-C Oķo`\ FbEuUa/"[Ŀ jݩn[ӽ7g<3oP!yh <(l?2CJƹ(.q.l?"(ƹhA=M#4%w >!aLF&u :{7]Ig Y}iTHpB.r۶*:m[]R$r֒CY,JExll2's`#~wWNK$sd3:Is漐hj$J9m]M!JbTJXr oFò~o.JZf0drcQEogYmka-m6ux2WPSQyϢًooA\ 2T֐qgP]^U:Z\޸om2δ)dA:u;CmI(6liV_Ш Dr.ZFaT{u0<U ei<ڶ.'"4,K*)F2*pMJs- "m85`bJ!O-/<Zd9Q, 4q=ԔZ'8L yvϞ,)*i~ J3>_G `9.5b+p'F8<4K,+s{3=VGl m@K+uQ>EdZ4LK79'$&8”[s{ 0rcxOAs{u3o";ZnOQK q GoA:cU_N ϱ(e4&** `H=\K=5ZǣE+slB ~tc3ZaB&&?f8K6p6uJ>ZЄ) [NNV PwPd0)>r. yxmP?( e(ͤxE B6@.km0So-&XRh]<P`ԃԃK*Ki ԤǨ%P3cG8[Mzɒ'K,9Q;&1 59G6𬦾U V341HmITAz z V[-9׭J *%%|IQ)g4a[M`f [M@y@Sq& !cZE%-!%!3<@m CÍA$Z hAmrrňtdg PKÌD}uRtiab/1/testnet3/peers.dat D`םN^@dlAx3VY2*Y̒)߇w@9/j 3)8AfӷDJirD'`PKRDrltiab/1/testnet3/server.cert0Hv%o*E0KW@`0G|DV-iGX>A䂛Ȋd߲ z7eFm qЬv'ǴKo2 T]+V6w TkA5!RL<U\3ʼ] V"_NH'_w1&~~%?gي{bo(|[w)nw=xccw*8y:ejiy>*Х7}˘#m܃Uu4OzB-[Lk5mS/`n:cdL8CUj}͹qn;b ׇf=\y$ڨI}v.)&~U]jMqD!// İ a]*VSOzxPex"7O/yl)ޕCp^CA~́kGgRR0;O6A}gWmg?_Ri,X{ 5P7 dvyY/k6oFp.Z ~evTo\^9Sn68Ұl?9sݳD WO3G| ÂohPA]+/[IsVU\{_6(EƷ_}> OIH hx>yG/FB1ɌWeOǯ O3PKRD tiab/1/testnet3/server.pemm`{=X2.%gv?9vSHOGs~/}=gMz@)Mܓ8Mcá1?ɈTpO 2+ <%?(]3N?t!>M''٧3ot"cX0z̴}M-;L*M##đ;([t$4f* 6gQ, gs#[c˼DfP[oŗɃl1#Hoկ=)Pzi#8p9؜< ᵒLَymt N(.Sr.rs*'nѩe!C/l <b'T\ MI>Q5KjwGQXt墝c ]o9-[Y ؇`!dk4C:@2gefochyC^I+SNZIzY<&[7 0yS!%-<%VHV/K7מ 38V oiqx6\"l-q4nl&,ʡZFrOe,.CpTOй:}ʭzQ9H.Xk6"+M$gmNӰ-!:67P3ػۙm6C06!1tG(ėxP ? z{eƵrtr pLtbI^ |OìF #Dh:/Wx^+дE-ED LNhO Ȳf9E\xZzBd XE7rWHWƀ1Pz4Hqo6Pdi8<,[51#XȜ{㴨)e\D?눼Bj,duZ GEynṢOċ) ? *]uńl /;:,Ew}~N2=ZzH΂~ Y6k%rϾ9A*$|0xn}1$qa_2c~$w"VIF0F7 M{ kW8Z۷?.s}JAlXjUJLW06,b4Q~~Erj$ָX[I̐{~ De׆d}.Y0#ӔjLdOtHwx!~A?H2oPKD1[tiab/1/testnet3/wallet.dat yw>9޹sAT Q7s 79CRb8peȯuFO%`x/%B}0@#imI<s}0@^?R,WG|(g`z=*ADEqܒ\Cx.%`öIm]=n /G>Kf# Ɇ B ,r}!^$'.Qܼ\M]6sVQt 3TdH`@Iqr}U/ &EP`yLbibIFGv2b0gE^5ISp "E!F0 IVRɕN؊!W{Y*uKO`߮;qK*UT@9!t j{8)!eeiO )ZS 1$DSFCʣ#QdQͬKIY^tn(iȏn\sʾk$ !1gw"֋"$'@M^uz#7$ +蛰ڣ?⛽MQ-QDץ[-:񲧫6t靔U٫BEq#s~^WSe!4RF 5iGΤw{}.7H7_^X=,s#H!9U^-lX]?¼]Y;Dz6IVxxrߖrԚcLSRm|%{ܝv7)eW"C ?Z2S덚!g6ym$zyl"Q%-r\\|B:W)&{cЦ\TPxg+rV:~[S5d|tDxeN[,9~9g?DZDИòۨWNO*w $!bJT^+:qӊ}γ!n2l<>#^N{rOPp-vfiEot=܁I-GU`F|aL+XvB+X'h%܈!DD>1fnsf_t%8O{؀qZMUʬ8}z{KXL>t9\ .97١LwcVl @x2Hp6N0{sbV6VY+d)!D~zAb3YBgs5qZNՓ9ӫ؝li0̀ oaQZѝTH/g}֝!y/e>ZdR望.LJ ݦ V :$z~.m\Ϟ98X&Aw͹ Iv+ћ_.PoeT4;<֪*?t?)X*1`m `o Cx[j^w!/l8s@Ճgo3. =Z}PfY>RZzcϑʼne L+&3DKzwB,33a3 Oe_ܵu[cycHQSĜ^6'Qίݭj攆z~%hﭵ&O׈MsW$inShB,zL)˳ }4|{pBĖ'bD+dGU,.-gsxr=<4;brLA:zIÍ Z3nZڞ/zuL+XvB+XxVA]IO /|Z%fa JZS ,y I7 {9v=#)bi{r;+ j ]TVhvuVϗuuXy\n/tIߑۓH+&Iɳ6zr1^v}6wu[^jǧ_rF\NZd;rL[OC)TeMyIPlaؽzc*xJ!VhlS[=LW2khD+}NM|N~rX0S /6}Hӎo(=(" Er[22_t>2uz>͚ ;/t_?7 ~],UaŽ[˂jωdKᬯq_hKӈE B`d&{W^ԯcdN')(;x8Y+m6&Y(+7{:V~E':{Կ=6>ijC1d.s='ڤTSBVR.siU=;V`ٍB=?mHΤ=8Q\-USMZXX2AtoH&,!uRQhLs2LN|{[9o^Ayk/^uaS52_?mT2u `q _dfXI4>htp]mg,`\11ɠ7N+$Z.l<ưʢ"\`edWߒїc"3K+z׺̽Im){|A^*O$1`m `V@]zjA!WIj1.=B[aj8Ph$o,qoj~X{ &-`;.KF;gD(N9o֐Ha\ُ> ⬋o:UY',MzVxMa 0y[qL%W'BNUsk2vE;"M8Ns ]})r3B>tfiEo\ğLP@i /?x۷'7CV6VڏyeU66~H ( w+[I3`w5h,;ӽ&)SyI >rW8l9zM Y_OMm ~7m߯=fy=f KNK$ݗ-}Vpp!-`~YDZQIPCPKW߅ cR+KKc%sؓن .׀ Zr }pVrݧ8Wmsf5Q@e/yWV3O*:&'ei$9$z(-J\v4_'uk[ U585NyPpH*ɨ%Kr0Nc4!IQENK 8$t-[+>W^3_bzc ώ]_|l6-;_^Tp|uf_jdZuؓK#7C<6oє s;ޘ} 2[!d|N8$7E?5x)cmӓ:-Jג.KMvYa8_(N 5N".As'+Ɯ9GWEٺuM{xɱ`M _ g1=)ڲ&\Lފ(Z:K78Ʀb]vE=Ջ:˃1e}G .g'9%_jϖw:_p =?dYBe RC~u_9C S7RW)#W>"[%8M>YSz5kB& ~8Ra֨ x`PA6)lңPRS^]}2rS)bjC=3Vd(oK"\eҫxX1qU3A6m/.?,Y@"Eo ,ËYkA 8k /Ę1!l?_m0.B0<5+G8Lx'aO% TB}ł9nsrXi{tn $wW@@E@[[W@I-Ї/.^ _]Su}8C Qp8%WWw/OӇ}mc!o Ouw?Vc; +ߍ1ot na5b1P8X}XBX*_0QǥM?ݙM";o"A{_3{_N<}s9}͟6\y19ݜb3%#'WQОn Iy#g9+F~#gn<~FGԀ| %\r\RPKQDtiab/2/PK$ Cw %tiab/2/bitcoin.conf= 0 E=OZEA_?v+Ii2to "y=\rs;se.H(j?f(jb k}DǪL5"UgKD*c;^Z ЙjhM=Qp&X| 7Ɯ5f{f^PKQDtiab/2/testnet3/PK cDtiab/2/testnet3/.lockPKQDtiab/2/testnet3/blocks/PKDqtY#tiab/2/testnet3/blocks/blk00000.dateTQpF;P)i Av=gϜ9=g>Ͻ(XH((߻]?"jo4H.JyNs?6TH * M 7Xm[+ m;'+ nvE gv.A )[ V..v.V/\_RXZ9xyRXw@1Mm<=aGl1ê RrY@Yy+J^+!Y9Z'4=.RO1z*[(¶+;H\߶Z-ҫPT'PO#^YiVR/ YgWҒg/!5%v<_ VS9o\)л}smLmAyF` DL-UY&;D( =m2m?џVGq)M4Vv,}WJӋ\)MdfAB{DdvG1F' PQ٦YtWe"%/$J0`Tqަ(XT/6{p l khځ^Ebt ~C/wߏɴgN|f$6C+>\L>`nYٓf8N7f(@gz@Um+J c Uq~I|J/I @wAw#ZJ* 1Lv}`t3̀bZ JV!U Bt K1S]BY]xk/RNdUQ@4 l>KJڴR#Q_3csYy}ӷ!0Eygp'wp$W2>Nt- j:.ܣSCc7|{ T }r7V)Ŕ~!E50Q5،#r^B٩y22]B.Q@XS@#hO0bmŦ5K Z8*[ЖtelV@)EpbVrӅb։K)fa2Ҝ|#4f%EVEQ̢İs[GQ@>~8~m[G4n^bj% &Uw\*0q͘wuMX]:J(f7- Zrܬ ?G:?sZae֖_zhc u_.c7ڢƷ> <HA 0 W"[=eu%HD 'G\:=q8x-=$$ .{SXLhu'uKzB@@I9 UTs7ϝ?*v4ΛE饏(MM9vu AۓA>zCewF"ox"SafbڧW[b ) ]Vl?N&|X:vB&CV['CߙJ}lAC\rg`*&5<ɩOIs`ķee~s"I|MlY%x$[pzj f0V+ r),PyFmkͪsGms w <8mHd ꁨ #7J+ &ڎlЖ+eZ pMj0E|fh{5%črTߎ<>8'Z|nX'΀׏$xV C *Zᵡ*@Ó_A:63PMmz$Я@Bw/8ݎ} XCk;N/#/ B`RNA8y뼣e{{(m0*h>4Um+LLM\&,}}!_| s nS_7L]7j*|rwbwu ivvnMqخ:?L7#:Z`=K響?~Q}!`kA)h2 K֫ GL^~nKFvue4VښH~}lJ^JAf}a c;t|s ѿSPQX4+y"6AB`T%˾ PCv\9)ce# B C~ ;;df` թA}?'Ji#])^z*KCB Fe֝I0[)4ΉܧaFOQ>!<+)'A<)xQp=Y>YyF\10 jKE1Cht#T! \yw?Q^8MJyܦSVo jM*"E@oثټw}a6즂-=FKj_̭XrnG5%$"G}qj?S7 T;˟7i$&,]eB>B|Jf=3h []~2zo`B4Bi_0" l}>AB D!MGdH'@{}M"V{BPQf\dlsENƙ ϽB\dU9ְAK\,I sra{Ռ!!5~X@ 0%s:E:uK/\eР\ӭZ8]C=[ыSò@ߺ+o6vp"fu8Ӧ%˙@:ty.GB6$R30G*UK]AE_RC ʹo'SDBcdZpdÈV,;ɜMLlAdÖks$  ߟxQ6_ܤANGgڟiC-@yrʱ:V_M,mZnmwUZ˽ +^oةZVG s~Ѥ!!mBsӇFPyZ̓ 9vwh:/跷ӴPĉFwk5'&f뙑/Sqc pfn7 Uj\H]0@WD,] ~zCR /D oxI}H 7ј|$Cᝊx6pjb{k(hq'DŽ`LJ Mc(<;cc/ FE@ 'oj}p!^[3ܡ[CdZS.HEq|Rn_BP*1P|i2~&^?4n !P!ip:G!6EYG;v (*Ā,SSdiď#1䢯m_V+(y||zHW42tgiPMSf-oyFtMmк%/t+PN+#O+fB@OIӷs-U_4)zjDZLv#%}z)[\g4f ObzwOH @$*yaF 6LHKdbAYR8mdm2Ъ -n8=[ I +MQ`VZtMqy'?-Ph6s (1fF~OvhZcrɛ+B;[s5#TpǞ4>O0낣1MKUHY·vqίhWꞐ KLI|<ʧKYf8 9\?l@-',·s:`2ws~h%WAoӬpܤ7'L!X@|z(zSYZ1pG%o5"V"vӲ@xPbke!Y,Hadb7hkZ}&dK_l).6߇4}U]P?#x$pBB``O9ã\Y.|-[=OwI#@P+(<0c[R$^Df?U2%%uj6eLLoh|˞lMHM/4Da#Qr3FdR- }ۙ,!!<ë)V:6y#Y>,0{U yRlpF|s(³A򏥵韂ؓ=jHLD0>DkʵEg'|èݒB( SUG#N1_m"hE1ٹRoLzRB.G+VωaJO-6an)r1 d}N U]SwG8` Gs f+Q2 #Acڕ$E3 c-2TRYjgBKS9EszY B (\-L߿xP&6NlG7֫pt(Ur-ݽI;."G|}I$V#0.ч9-cux*MA*!L:G9!R9qɼÂ[ޯ{X`TQn~72jYP%`j11#SDFVE- }`6i?ާoйSkl&u8{Q/Xl@&H`y=j"tv!"V-u!h25!J' f^!?xh$M_Z+8Q@4QX˺a6ڗ?~PFWkԡl6|J*&abkUa 2f%RREC7/$y]%C5M{&U?PI%SYWo:DG8 hm08v0c>X%!LiW+l5`þ!fƛu Bh!P+S?J$ m4퇍QbPњvYut2[q+c36 @ZYd_ۄiU\I$MLx\3^4_'f`}$PJ-@B.BpVei8x(ƴd-[4BxljMf:<H빿*CBŕ sX ]#[&,B'B"3tKLigeoY{RyT5|>A'DJ6,|Xq1H`녞&Ҩ;7IS AiI$;G1*߇Ang9}~\C/΁YQ1pfo-m#dUr}Ӥ^?mTCBQeS4WMlv Uۤk4fX1n5Sg٬/žH1'k 0GuFue] :ϻ[y)Poya/ R^cT&#mZe~MZKڟ YT{"?< *Eth͕*kZs fwI$*P L юz!gȉ iNz_En1M7ioEţ 粨⥱*^(T |Y&s &t^yIv9lǼ(q寧^Hvm?>~y ^/sT}k?V[H6´cQ /1}#s砱uu3H!¯o]ݮlL7^hRj<B ڨzj[$Y, %MdG|>.r|Bl?/iMV2ψpz gS BNa43 \t6tz;HB``zj;!P땮\it`\!ܱ!z*QF[̐(45b f+$Џ~ -eqئ˯'*$a @e6UCQsx[䉼w=oTAlVVYUdWR~!sʴVqX<4au%Γ{}H][Ft%-\ ӼK5=l:T+Pdaez15yhxXw^Ee)*ѪGV׿z 0b0k3WQ-LIesL>?w"Foj?ΝDdr(بV0?PWsvڹ,6Bqvd'>'TX5jyvڈRw6]|&A8F*WNB:O-$1gB^ J~_V5zTfX~.0Zdvc MOiuUK. 9o Nn&,B'ݝ\% J.׈ZFY{"\XCq =2vR 8B@sm֨lYQPo"J/*? ?d}y=~s젵n*|O%r2$0OC̓ۄ+keP'Z]GԎ#bspD_zI<)kŀJSm7Y{8z;tm5Ӣ% ~ (H2``D8N w2 Y 7w_!ؤɳCgu`nR;)0g 4ae37Q\8BlP|ONaH -P!!(\zI$epk eWnAS4 dyC]kN*WҶS,s7e !C7IJb&%Պ{a Q @s!6ɹJ~K#ւJ^J΅tj;?Ԏbfu +w+0mr(jm0ypDd>窷]tx&$##KOT_ w\g), ߋ=j6xzq#UVR-Emmt֪AѼ5Ѥzl=Ӝ8Ⱦ.HU' $bS~7nĒ" Kk ]$?NYܴQe)2g;hX -#C./I:HO AyӅeO5[m{BbRMEaU "N/yt|R٩&5&3%/>= f˜XBHC{O,||]S!!-y x DvO_TPTOCg62wRZ݁ٮM(*-Xg$wse}kGvnbcn5hˡm?J!!hTroG%7b%3Ki)f(٪< 0 P#\5?րk(eԖjm@m@N'UbG7$Mm%iխc/m_3|k^+a&!핏K"S *c/+$6sxj,1'?P S~4v$N'};|/}!!h| Z2WދH܌1ދ8g ٖ&&vlĦI~>/U7]3 > mYKm6[SGXutV7&=R6!:^ y(m:l5ň{z4d;\Sԯgatr(DVhuQ|oVu QD2>^䄬l逤vĊ i9{AXe9܄6n%Gy.7>$w4<8RVg6`_4##b(ZF`ߝwBEQ[ p70{D#$]<7/ Q nWfO_G{^ӀtV a񇵶Mz7Co'ے{oŎY Ɓ%5zTu/XCaqS]*'v X¥`_ `vbΛN:9m:FTGWm'-g"b)9ZgN50}`+ߡω/gs2wmMiNe!4L;>GܱT#+lźiϘJ(͡fxaTsjsz.z![A~ Ƙ7bmJٕ2 nyBAdmȇ<$⭱'$٘͂ qϋ66To VQ2w%;٫1,~tk1ǨDoR=C[T3@B0!ß-+C7)4>} zF»e'f焔_EQ\t쉉)3^CGĚUZ4tL *# zd?љcXe5퐒F2ePo0+AsKidqxo]Bpp/._ nnյ"S%Q5_C p(cg0,WQhz)$p/EJߝ0Εz5QD"$]m f=7#ǏləPW躞Jj]Og2D -fd+ϜW6.rq3e.ݰ@Fͧ#$y˔?=q H!,sj]p M ύT3^cw?-%4!!`ehF਎6ߩc{dE'2~BH(Uc; aV!/S5n[d>%f߹7Q5kIEx7$h'4^n"MSV:Ga1@M1oG8/.Q ~DtԢf_wv[P] x?oەMjpZ/H1)R9-?MV/|uBpY@bQ*Th:}fK~ rGJD%9}S-S9{"PA4"YkU\J~v P֟,s1ж0#+ES@" E)B]"8zG \Fܻ][;㉍G1)9D=UK3x907j3zc%AVG،ZS /Ce{Ad'e_ZVd?So X1_'mbuJtD1ݠǦ%ET ȂZyIyM #dIwrG;_U~' !Dۂ-yNG} L]GFdz4P\9Z;C'|DtU}RV]60%#Tzjz$)YP Ik . D 8sjtmt-;`\gfikP=A{zM6.޵u7|={ ebvQKp:<" zl7oyeh:IU|}_Fp?f@DȯSͷBli{payG,nƅSπTΉa|{|OB0$=տ&v{.z8/K#-t)II i;C7;{k3gy;9Vlɡ1n^eI Ontj,ц׉}Z./sjK㡝 $?m>B.LO6=>!0w|l=[cEC6I\ƕ<X\DMUіu!.j(Yi\) f#vp`!Z ڶK`,X Wprּ1PXA9kGJP K_kFTVeb-I\1Cp\91!7Fr-`^OOA6'bFC}9)y[Fux;h@2W$:d#3ܣw37">"! rܝbB`n\h~\¯qXP:9Nn-@et*W'r[e7ӐaN:7T&.0ࠠJX?#EuGVrہM0`#)!pMHlN?s_WPN4/'3",;_ %?Y>r73 ^,(̘MⒺ'uzCxᒴLb愅*}VDž׭FFO.{xreh^$[?WXi,kR~w/5. ۓk*"5;Dbc0&OK{W!X3k*'>@A_+{X7_Ӑ!%Oâ 54A= MSNBlRCL׎N 9e޽O|E*,P-QsT{m|o*( qBƱXQ2CCWg6CM@[olٿ O$xOȢ]pÄ~9Yۀ ĪsܬF9}ވrA%xzP؟7EAl-'A7쯥<^ ۩8ݠVO\2a/[GuGc sF琯/)Ik"LxSgM$\{R_OO&7 ԅHɃ5:n±BvAVy(9쓅ʥ/<0T]vk0H;& )0,xZ5;@n8& df,9j7Io/سe6DQt8 _tK4 D+a@D@0<7TmV)H/wO2w͛[wȜ 1Y$l L^>9NWw M.Y}%jX&I9LH*Ў;| .s`wUOT.@1>45Atc;˸W9ETaQ?ǒe:V1q}BkQ`“.>X6$g )K{Ӯey]8y, >@$ Xn&=ǿS֟gدq{̘ԌYeРW{/9&`X,U[X|o(RIq,ue.]ng9dd^~ǧu 5؈ҟ};.<`hgG^_FSŞl.ܶ : }OP?:3ً˜"{tX1~u=N A3g/\?(ue c^Y ()W )[=̣":Q&t\e9),D'޶>2'VK}i`dlz"{΅2ޡkS_P=-S]B ya6/eG'E! !Wy\X6a26Z#3-/yqՊUw-mvC0ϝ'q4$o&Mpw旔Se~Qt;k7;ӟz<b3]%`չz5[˱O>NݬPz F2Dpȫo?<T"`sˍM\sv/\P 6$y& @oԇmL͕^%BVvD{ $ j4CNv;!*:=HWZ @YT"#YzTڟ3z//c:qXX >g狄.VYMJhPBxfKBլ?m0˥Z*OncqNfk5g̟Vl>yzN4h/yIŽsbOYΊjQ]f-6NNb@c[Oa䧫2W`t1ŰKAx}+ahx͊_3Ovă?{z.XԔ$P?\Qߒ?FJl\ ʖ $x{,0D`yt.nxpYZl r(7繥lC||>#Gof'y [D`6) k:x/뀫ޭu\g*Gh"ݤ )Qm`Go\GWJ$E]䠬|ȳsgvHҍL lKc,ceQmGWwi˻rL#ux}  uj&gy| B-H[_VrN=)SvEp"K (@T['\ȳ!Gp֠mׅ?ɂ,D,ew/R#spt [ۣ $:fG-Lb2Ύmg{d'/Lۗvd[L[UH`LX"Jl ́7t`(j(Os=/ |QG?oG|t]I! ۾q\TfsOܛE<r.%}>4qf]g`x? t`ꃷ+r]O "rҫA)Sqf\YŕuAƙ[|-ӧoKRUY*Tvs3flL<'2E CQ؅2荏"uGX e%: TwѰEdKņl!*{@Ƿʡ9qUGؤ ({鷟2{OfĊ *&>P`]Z' XI"Z,bE,^|(V^ wȪB߽BozXAT'ڱs(bqQ kmˬXYj`l;,H>J{יWý3="*1 ܩ Aс1چti=qBPyNPV5SS|Qص[lE]˿2+f|"j\@X QP%^f>mn]% _Ez[gﷂyO;Ib4`^^u5y^3;һ^Ys2_ĉ?.a1DC;Waܽ!]żT3)]]V810PNQeW݃lt Ϧ8gmO1YPe3{S6VE}z YR*.Lҽ׻ ÏJB*y0k}pӇ.%S }8# Q<$|rfxBdD8OGx9'#>aw"M O  ugC iqq2 CF=sXqiѐ{@4yڈP7[bVJ n( Be5iA[GmR‹Zy,X{eo 4s+*y5իAsxoϟ/ 2'*MbDakpQ[}e?ϯF/c3ښD\ =>~4]ax _vjiC[]5eSgfsH  i/gCpL@Wy?B r:4C1 y.F\f(}}{U 6 Hbož??ץGE ־bџ+kaC&;}j^KLl~"_YBP|^DTP$(A*?d'g?U 2|x"8?6$$`8׀LzR*[+ RӿF(F29Ta`7\2+1@ZcԳaQeG? / m|]Sa]e6.bH>/ ְĘ]7ÔJ"|}׈?$aȐ^7;Jh[ {2ZP %i녳,<[7\\ lga+:+2%S%7!n1#,eKV)_n0YTG&12oTHk?#eEJ΁'EItכ)Ɲ#^K%dX I8R(ׁB$NԱO9%{,0ik@N:{_o8ӡ~촏|g (˖N/Pare50- ҟǎC*`_ʧ#7Sp\_/z0 tW\/4z a{JSd-8ܖxةm#Πl[;v1U[-xa-m) Ѩ.пZ`O}ުGb3w@0UҬBޝ3KO9ddCQڥ_s_!%#!^N ]M,G =rO,]Ho&Z^7y; 0R :0Ze'sirX?y%!ZZJԼd^u\s[5t3i\[e@^J8&4| B< #Y0>֢05Ҡ5RlvV%^fhјKB&7=sV17ky} CX y۝r?VS)ˁ/MmߜK/AT8b(ә$f V𴝌HeȊIWxq I ؉ x HoWa/_żbǏj+f s:O! V-*HLHx1 9 (Kō.#Fr=͉+koygMC.Ҵ7rC``fn[ЕfP=A>GSylv朽Q=3m6'(QyΌ3X͒Bewj^nџAKX yMa+g uitlkl? Z= ! 75H1k+k"Tl AYOenieػ5f){JnG\,|5P4ޚDۓ8iwu\-e' 3"\N-=׸v ڹHMn^(۽pJ.R̍&`#+zneLZ l@m4Pr-{>yTT:?wX3a }2Z,{.n=-VNLYY{LɼS n/UPn$2O&0lp4cс8b(e5fVyB/OBo6x0 F89((9^!v.:(Eo뤲$+|p<ɭa'ap`),"RNr=-E]OWxCo;[gh찛! ƂI/>K b=,_z~ܘIRJNE kZ,L= zV qn6چP }틐BRX͛㟟䉀4JdFO8 L1(F:2gU"e "izN9xLxE>Ӥ0E@Lҕ|!vB#0o:C(){gK, [? eLl1Tγvj@IDP\xA:,R봐#HMn'.kZy%~JWc޳DHz'"^ۅB*7ΧEm-n!q!~ټR(H6UWTpP*/ӘiTR%ug%Y1>Z+P_med#Ԑ,OYxk0'9aHb xPg]?C^`)zaq֨q"qJRsdqX60&P}nnXAGZP Yq*sNū젃M/í °ԭ (JR-jJN*o}T!p R_wlEؚZ9,gKC+V}2a"6HF* O3 Hda cBUKKG29.mS:OaRK`fj%ntؚ:F ]C@? c'B4ü{VWVs܆@Os1"AӗFAq = ,JnSk~, PVB?}˸l:$1HʆX'8[D0=Q1|wƬp>oxAaI%+(@5]bV8(9} /[JP|ḵi11m6p[6H=:܊J\/:ASeXf-D!8&˶q 4W}oeI2=*ύoys* ]pS<)?Z4`Ck{P1=a F::'$nXt0H֏(UD𔭗Ƨ#J1GF?m P嶼dИ$0nt>VQ<ޠ^Bր:(IYQNS)9Qq1Y<&VűM8ƀm`3LVR m  ~u37멣ԙwO | l|뿄W LK0?TM&{݇W7oפHZcF\uN^/G/,6}~G:= tUM|xS½Y}y"prb5<ۚ{n_U -YzDs'Zw~w[Lnl@c)6'p\9UAJCnf)7/'zHrHVmm.`|5:JM0#gj_@!AHldBi[pWw^՛7PKR0ǚƗۦDOђv@ǰ[ZYDcX\g<2/呠T6(5/oMc&vu.56bțbJ]kpzYQΒdQ蠧dI_@^V"^HF!wS&t(&tT2?J)g\]=y`1tA+ĤpnoVL;Ǻi촕Od'8©p!1˺ץrRV߮ܨhwtAÏҹΕ5gyo\*nبV>hEQb,Z~aK/jP(й^eSm1&jhڵ\MyaxGB9*4{JacnBؘUg&6\6`LBj)]k-ڻȱ6pĶ1Mt`:'}%zT-,&I)sCw#= n,@i /5-V@UY jO%(-l%` +@qeF22a_A#zsC/5 >v%j pX]~;,+߿JW!Mf.LorhP6|Vv:û-jVZF[qoX4FK+tއOb }(En5+.^m+z?)Ŕ!  //(/l|z~Ե.3]~:AQ2Ose"LXRbcKDBPܐ%hه-'üV:~tΡC |h$P v{;9|6P0* ]U_w\#Qj<+8X #8Z(5s5N[Rd$qh6/!2T$~wuG;Kڿ*ox08^Zr^D5Kz60Fb~/ݼtC2\}uɳ&M]s˵ap&ޕM*s7tϑƈuD(Y z!J>OxQ1?3Wn6FPKb~m`hA疭0EBC}+gԺ]>w4?V]θ/7K_c /ɳ󹁲 ;gKo} 9]=`W&EX`1CR3}=˦ }y2)p|U{Mʙ r}Pc}i2iZ;{73E_Ŀ{!/e*aJzr1vBМ`=:p޻&]~ۛ[>P* O{s+~&Bb?^gJE2Q\yaXn#aD. API0{h,p&P-L 6H2|zz͐B*Oᖨ\`wcř%dC {Mq cQ*llI{\PyI8_8$`X S{_cwQEX $gh'nBD`rddcEYs8ό=W"֩^u:Hl7 ɽ]w?X P 8k0 vNs'_T#'J{EZY|& x.r>O̭WymZvh#wr}-6 i CnT%Q$P+7 Iprk+Ɖ(A 8À|/?cs6z}l7[RG㣫={)wJ( iT]}7ُ3`UyBϐa?Kd8rK/I~`}vBZ-b#[cC Z<ˬ2w9DJ_MԿ0Ҁ2 Cael2>Q_1(摨*"tzg^P=Ap^.֮u -9rD7TF- =)0TOs<ӕ?guhޞ8m(,v]{_ ?*ހEYQ8EC8EX畗f#Wk/W-GvG8(H4wIA;Y$<|d݉TI fџo3`ڀ{n;Fwd*Pn , #<̠|Qty`&r&Iq1f(~srCO>^^Aيx)M_C5(L #یQWl2=s2<د:GmWp3EƦjb\LZŔO?dxjL[8E3 褻%C-^i$m2W}ZBgТ訾(Ix•Pe$ޱ]# Q<6yOxt3A/\̢tv}A!'oJ' o.]0BR@\٨~@kwu+"xNnݼG-mô?G]nwg*\]6s`gcDXp7tr%^ֲNn!k]=j^9ϜR`G\ȸs磬dHvQiZO,^tK׌TzN4v7&P}BA<"(eTZ͗z{ AbAZß>Er"q?Ѕ0Ar07ZIӬ8һܠ0sĔf ƖJ(*; LuN876Jԗz3RZ›a溘zxfeT¤2XnpWX#vo];#D{}GMm߽J ~|25I?Q=_#:X@(Vͩ DK[qdfU|);\%ל北ERah*~m"e;XUMyz/,T0񛋈3l2W:[9Ş8 L"M(};jdOE'Q,259=^w>\϶B-){ ZΛ{vmjĮ>0ԫ]9+e\@ǡ?,ҏ*nHU[DҝoM%qx=N x-![ŵ8&K ?#ı˦aBa27: JƄfSΕ!m=O(?jo}R=8ק:{1ՅN\xJ) ?wݎRb#+1M }.9 ŶB|z^>lid/Y^_w WSEir,;N6lլͬ䦂0맬VhyP Hrs=yG?J:=y&V1rbd|Cl e'+}aV/PS% Q"X4Wt*Տϲ+-J63&1\\Du1ȁ(*7i5.9˔ue , 1{x6t*UfE?QqeW '.^TQxf+pw#uQ,+/Z!MĈl2qIWG38zWp\9 ^IdCm ~Ux-jlCc@ 7 9qLZ e3(h%ةg {8l1`_4@V:f+Ɖ (wHn;,Rfig=KO`1^[#f91-)Peƕ`pL/L}>ET[i^5d7_Ȓi?{B~{De_w"VbETS ޞ(>it#zB!V&ӎA=Dl{O b#=!5I(W!e+QipL3DP =!W0V(C45^.y -Zi(؊H1a_fN.F=Βa-:$uiRq {کY6 >,%,ۍyOdeS%z.a6>]_-;uv%!P^fA.HGaDm êhL ^bZ)\qfCֳd<}<]|% yZ/?|*8cu6:(%t"1=baHA1)ZKL y")M%<%:48ؓƍu3^>KS.!2^䟵x86@/X1l5~B1hlqDRQ.nby1G2^u MlEE~E_]!t6&\*ZM3(%/& ])бSQՐCrl)5reyv"CQ؇cr-on{޿b^{|nuBcirҀ.gr̗nfЩW/?fh ΡBf#=Mf +p>V|ފSTOx^B[=W#bWFy52J3%4x`:KSxo5>6V\_[Q9'A=@:KU~ϓ.NVQLvgYC2?j;[(ތ`j]g"Ejr Dgzu*/MrDz`q!z5[u7{}}'7 QƵ$EB iaGr6Cp(^bſV'YdcטU#Y2|9 4be;=ҧ_D{B翷#)fnvwKfӕ1¸|BCxZuAlf.7< O24 .Dfg`i#:K3|݈%[qukjheV-k[Vs=\˺IІôF> }+pB}8BhF)^|Ӭ՚% g1=:Rsp@Ad0-JgzuUZz̦YgВl9' %vS"HH=[BU%1l=һ~q*(&s\BUY2,>_JӃ~@Smvp঴5'2 (*0ͮueb"W $3FD}0l?qK%7-OFݧH_gx RJoN,s X2L}ENz!o9&pn F] ,x5pᵨ #šJzuzS ?,5S*x7r y&O3={-b_ T=_TJu5z0@r"clVK MS#Y ;_ie_Ě(_zDg0 xAZvx/U<)n 7hw#ɡu/&%F._hhv3u0It8uYݬ>M'} "،?p^N[_6-# }/5.3"ҟNoSM-´r\~of@ }ig?;1T~.^P̦-h]=z42DU~TGWK^zE|?mx⩣O$'iG,sGw坟u@~Uf"bq<i1Ft;,>Xu8g+,TSEen;:;c//\ڃ_1SOAC4&Vq8P\>}IE9{E1W?^Gt; qpSmdێMϢW?0?ת F{!k=c8Qѣ.oNXr8VYHq(9Q4zz);C6P~;!"Ȯiav c'sZOJE<qB) Ml[^LbT\ʨ#BHIC{mq.k_69gsӸRA537y6s^iTc oS1xIki'"nÈT{l ~?\sV=7FkTw> UOtV3W o 4v;4 0{zP,|}7~쌉Z{t6L>} j zaAK-YJU>a%Da19SGOć*40ʭYyX aĿIcEO5 i\KXmLWO?ZσVl@!ǖ!]N#Dݶz^/0CJ:b#xt"g+גIA&aR/Jp$~?>lot60XF%;%LDVlY*XDQp8WَJdv>:̓*^w>&B]޷< ";X o" 'yқ6$3_fvix%&2,qZl {nǕ췬XZ[ѱ9Ig'q\_ǵ@z3t1,Hn0c8d?7xeUD"uTD)/ 6+ sP➚Q^H~󫛥`RFg#WC >iWޓൺގ["ݲ-z<[vsyELLWՏ80ϏgzZ=!A;[6y4 op 0սL>?W~ +>i5Tt2^z]s4Z Յix-, {]pmcƕo ܫe:cON_:g;ZB NviI/ݱAB rl_me^߻lbUn3'%g7^,!ZbY{;em+>5gA'] WgCN&jf{RiezCDG \7F> w;U{Vi y\ZLӦ%\ߴ }.<*'rȮh2T|o^v#5 ϡbWqN*UaFKG.*q$.߰WUs(r7jOٛ`}(~TAͽd #%c!=IZϡ%OA,ۿ+7fif^_'aV<_W|f1vC( KhZ#h9G49Q9@;yŸ]oSKcn*6%#^s=K/[J8HkmnRKMz+(WT]9R||ɮMl"S`}%/Bp G"95gNIḂٵVԽ6+A>k'gz_.2]XIbnQc\f7 qAr@JXM %ugk&"lo,5ԳS~7\E}̅J)!@&]';58p="u.-z~5C6GxRR7v&`a%< _zvg +ka8˛rx' ՙ*8ݱFԆF$Ra-#嚱qzW97 :–C_Y04蟛|RK\`3 u߈qsl,GBxN:6&J$4v ߹G|qXNn׌Z} \cm+$lgiĝhޯ']N{%.iDWgӇ昑MN1^r;YJG,.xmfNż*fKwڬgW uZO=⤫g^reBXnV~",=?%~|j"# E7prn8 a%/3*>259p!nL/-oyɁ}imo[+?͆b_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUi  \PKQDtiab/2/testnet3/blocks/index/PKDg+#|}%'tiab/2/testnet3/blocks/index/000005.sstg VݶN2CfW+de%ب5@Hz BAuP1膀^FJ1q3vx vM(:kz %BZ*<˗ߞޓ}\o(FYݲ  `93i猪=# x>nO7r01B#GwW_DXn'OaVTAf/}K#A훕GJb%EGwT' VyQ_JZu. 8 !# 8%@mB&E [3f B1Eq&ėZ-N 4vJn|Lj&iT+4rO`+'Op,Kd_"^ʌg`0 Lv~N 򱩛/YY^}/vs2A_ԟYAw~&mGִBןgeK)B k(bR΋j-fv5On?-ꯈ=(AЍ@p5tds H=WXyhpxВ=@!Tk0) :xdו>qRK8lJ-ȵ%;jp#ϕ<>Uw4jZ뜧Q*,*HaX{lՃLkvXȍJ>p Xoqg^GY0KuHr]SyhT 4*n`%4ѵb.(H%S Mr$ RqmOR|m֮?ƛBy}[Ք\ׁ:qy%% WwWo4$E":ݥQn$o~k/S7g{Nّ/sm`.1I v zyS9)LWžCH՚FdE-:882r.h0 0;!BEAVcӬ N֒kg\UrU K[H~\}Q /s`%>~3XJQyk۝H̆ )fՋbznRŴ8{6Dj`Ĩ>t̅l4'<WMIb-Tdnˮ.W8<z@@JF\r_̓lϤ[ޖE*rfKxtC p r%KڼRY;W?00lq^["!{xvXnEuR#c|x)I1G9 ,i7 Պ }!`DV9-8U Q=~$`$8p֫`ux@L䐊gۖLo\;jVg؅3R*\'ȺF-/ CQ^Sg{n?uH͵$ϑB)h `Y5)>nִ1阤qֶUq\]7I^eN%¸Esp& 聎%G[/)J :L.YiZrq|\Y2}`Ξ0p5ڵ$(Gt|ΆD\އ~b`YfAatq,X#b 'bgoTcR{kܘ1N 'O@ʐр]ӄ4B-=ͷHL nJ;zm(ϰ=}ݪO?2`]?-F5f3-@} wafG)m3ⵟgTԝ͒06 B |0G(LA7*O M% NıX|eO'0n׸2FږUTJՄ¡~;0&"~f*^Aܘ'1glr+'0A7I?ʧ7+6r\I6}PkۿdT>=tX膌ŝw;_Gp#L^F`[ \ZXFBaP4?opgH̶߫ \v#(*\jrKHoC{FÚz_a<ث~O=_1~kO( s=Av\c MsncevG_ȨSlWƠTvsSi1fZG8M v8CA U :j詢 ~p/%;)ʥv'!et/ƤNN }AY|do4 Fꔌ9,(~[H! %SbթކL8j5h'wUfIz&!*)r8ݽCMu _&zo)fKո-BgDn;XVhh':5:0C^VE$s+lv#9_[ul\R73sI_plsCo\Ơ%\ E̍E+"WJ?wռx\.2lHF3EN_8n,?I7Å GB(#Dϙśg/\UR }kd. KH]:CR&ock&i fR{Y-hE` Fwi6M0]awohxJ)rpEX7^w5v.х@e#W4?ebɖYZ(IF %i(LA7i_T_ 1>rUљ[NȝxN04vL$z,]h x16#do!T2ADVkK `5g,#ye;%gń`6FAnh%"X'h" RBX$XPKQI=q=g3+7IF8WVЪoЂzo@̳tf* A7L SBoƍHu#7"QViiЏ3+:c/y֪D17KrSo`YJ3hR y_ 1膀fg=&F; 10!q v`h=esn!m{Kz`@O↘Թ:(=]UGAnٰ"ř 1KFOGi\v,ҧ*@t=,㴳ӗ}3#g` !` Q3|Z&h>tt17nJ {=! q o$C߮ܖRJvw۟$ތĭk蜗U CʃlTj?}ͨrՇxYg@'0A7͖3^Ӿ\Ԍr }MJ_g3?DʪGAQ C lFxYb{;䃼G "/)qmGpdGo8 E5([o")1xݴ܇,@"0|O`nhruyr+җ/s>(d'1$\TBW,iߡrl%N{BXeO,|zIEJI#erc}2qVv ^hf1膀+fs:_*؄x%%S Xwf21NHXC&sA&٪/^ 'gIxCM;Sbz4L_07VhPeVGVy@=tp"6)GT-g=rќ_%\H=]YTmA*,P aDG#`|N?WW&XH:SKc;gW|²)$9eo'`0]˞Λ=b #ZR*S-G(֐; [|OJP)!ٓG4s=0w~ SAb9δq  "nNaNƠ0]aв_Wͷc ZL8ۦ8jb3F<T'uo*}8)n?`jÚD۸WVD0~ P bvTREAyc ]]l/;Ό*mD87 r94oidꬑb+c|ۂ'V /___To84t>C^$ȟ*C%d[X9 +qn<_`{y 5C+ OV-?0E)Fr%c1}!Z']!eIcbq\Z]|@fΝʏ+d^ 9w c # >+,\F %"59нU JdvCtnWyc?ED_t6A̧>X:҂z] YƠ. =MdCs fҮ*w怟\."WDZYm;W9)wlw%.?XΡriv{Hwq[ZM/FlRS!t3%6%Cտq#UeS4"O3 h ?rZ;OL aMrWnYRGq=G兛%NȔBǢf-BF-OWA`!?床UΓ jtL$kB"FW. xssZT}W9\{8L&i-bOVY { -FV/4J&C%d[8 ITTZ,%n7& ت\>*POd(+ث!Z+}yS/Q[$Ӹz༲ɭq/ km}۬SA-1cIoӁpt~ 8U uh'KTHor%f<^C_r` ﶫl\rQb>Ԉ2ҡ?mRJ\xS*xL֯!/(AЍgO\T6RE)[^Y2.v> &7P~5xV׼hyd'|ۍ epI Ѷ2/&E^[]_ES+AnȈyDeBAn7>(|0S CB!.3i%TX@9=i{M)P$!Gy`AA@JϯM9}1 8n;oe({x Q)bU E#0N#vMZ-a0̯0uь"E YINXMITelbotwN {K5 DI]j9vtS!Լ^˚r(oUQ==vqdroA*j~UJe0e _ vLl+)xxLիy]%U-OHk&}z՝^Ш8 @t#N{y\ۏmRtnN6(c( 5.mzB+LO= 2vnXk(g +&v+"{YWc650 pP?r?)AYtA !&&AE)|Rr/Gk<d,.=k~teRGEfHsdNEbwKB6GAn*|RekDXw~wpLzf_񭰾 6zX h4Y i_[kAVR,dJ5µi ao42A ކTAB EAnN5w9!;C&;g\v+j>CO` >oiwkQ}uUUh,ȧfHyPΔ@4PxߟcU햇F`?` !`2C?nj?7$Bs\c/̈́Z*2 ix$ CCs=@ZOCC3Mvdb~ LWzD:T M.dUw @t#QR%B*N;qs;lTt`h@qv!6kTȺFPfn]#.]3 ͹6Yj6UJ-\pqBUŠc%O]|:!';6g0*YJ'Y9zax׺-QH3e79` !`2A6h5 qb`iJƾ\N'ekd3f;m&> :ےlT Fѫt1SРB,)͚د1I>\k`CWfmޢe} SΡZj8몬8>B:f޷YQ?B_Ш @t#rÓ#؅v'>U$">ODΔ+-c %X=Sc b}񵣼3'F/GپB,b9YUN9PL1߿yMЇo#%hT!'th>%<TA|Ê}JfY ,(iupNr~V}H8Յ- -E^Q&35jۊN~J]Զ3f(/~g*Ơvf@ն[:ӞgEg_!T]"Ju)gR딏sd{<>w31:r'ZʟalW[7 A][IL_ $K\R-Ankk>R%W]Y[G1 }UrR͈ơg Rui0#0~,wKzΥƼGv5CkP F@/=_۱mPm&$;uG"7ETXAѻP[c5>~Ps-IkzӖr3O75zϺꬬu+bY0S FTWZJ '0A7 ƾ}$u9W.9C(ؐBx=G9F%j:1_Nrk|fUyY![X}ځ1&"{k]Ԧx`KsUeӏj{QJXLR%?˃n#o 일[ѩN`uNJOFD$0Цu=AsBy;OkAY578JѐHt7AF[0\l,egg|Q\d[@< @t#X8>*"%Xh&=TĹie(sHJ L3f/7ǫi, SoMMwt曟# -¾ѝ:iZN2 VEǸd#:~)/E` `r yϿ׵ߎyN~Q&;rx4jWt@UMi(YʌR8 ;+WS]5rZjq?cFwZ+P^PSy ÝЩt3QAv,ڵ^b7]d4Y7~$h}D퇴`tW_iܮ l32m8|S(8![ MhC `oDSMcwN6x)Mw]S{qc&m/?88 eprw&-MP6=S2'yszs+.OlgVG30hHp 5fW/'He=T. ZikI95ܨMAP !>cMdHm +5.X}omHseuG t{_[Rk)]<'2l07[,E BmX5\:_(?5VdS"}!>}X[n 7 ?{=F5{4i6q8^shgiᨢCqY)06YOՙ|Y~Qac)S?zJap8z])~6ĺ\EҸ_-h=c6uFSmɀZϫ2N0m?Q{G/ O\&C6<`8 8ۜN?`,Nbt[HۼkWx]zuA=#`jq2!PJ/IXrwA`bѢoEѾL)>t{̉`nv1DSAP#Զ}V{qI1i‡W esĬjb;)GAbLIV@hS!ixXkK&n ctu O5\uۮk > ݜvBHj$Oـ˳4pdM ި TGn\"fCG45v 2}k^N(x3n?׌Z//_kJ6^WNsvͧ#+9%5ZP-B@xdg;JW]YDe59j#48uHA7׆BX;ǝ,™*F?P&}>^F;WLV N-2j#@:rWK+xLy裠9kųm]U[E'Ͻ8Q Laݗ*9 ݧ>h0a v<jC@=v3fa9>im=͍4-q5Y ۺ7nߧL>z}gUctx}yY|A?X+W̝fEBy]Ff3;WS`Cm(GHK:OM`}#U#nU-|6TW wKCXbX%x A 0xDN]Y }t9=;^@疅l[L\Bؾ_#$]AjC!.XOfNms?jPwf:}&-,\  ,[7!Ʌ&ցyJ2A)f8DȆu:+]4%s"Źڢf~~q} ~l K0SAP#Զ \م+L9.FZpK^QN0ܿVj)"><#rSw!zΚ\#*ٙe<}›G^ܦ (,.\`f6b}.ůMVwtTLfIN1 Kh/ ` oQ`Cm6DUQ^;nY}\ZkZ`.aMF׭&bMﮋZw˳ܡatZsj*(|m (0~ g,*[%lɖųf`H C&ouh4=rԏLƔ!Iںmr`Jd!F:rg>Az@]_5Qz]'uVR [ꛬrֺLQюϲ .mmOS2qֵge̊c?2FsP:`#q2䂥 }zH?=x8]kzN~zF\._;j?Z>Y;f PDf @ (PYVpa>l[VBOLKK_H&ߙy~馼ިoo3~ڷ\rPIYMW9K tp Q`CmؐM!Vtjԃ}^we(8HX8#exf}ܘ-uo9+!=XzMT5wR5'Xu3%쁯`9OaAPXgvIuFA:'asKo[ߛbk|W*礍@+BmӟNEw~_s ;0"CPsԶ8&SO5͕oW >G&OH. H kJ1?6U7$9n9Ue^l]HL19ķ ] A j $% , 1R=;SVo|z->(9{yˁn×;~ L7Ї/hEjy^#w@~LAP  KpԖvE;Snn »3ډYǬ'\ܿnJ|#3e-/ C6uY<=gS珃W[hwM8lCh+yOv\>)" r#?UEOީ7&M2Sa} 䥻ѹ/+m=b}ɡIK:4gl {@P%dkw^9]*glZXUۮ(t<,i3݌ A7h^e ?t) ݢAOF ( 鉇->iPHCoQJ,>4ԝ$: ֢I}=e4їޤ)5v_Q@{|4Z- 2j#8뛤v0Ovem6<{2L"!\c;2JJi&}U{O|r`C}\t'gd ROS),ݚ`k\L8$gF .8l,SfW:̼TEp^~:wnUXNοHx.A1Ԇ`SC%vٸ_XeScbܱt,BvsCהR.?-cZ[U9_o. o璮q,x;^>.&4MjC@tyvLQ74z;.@c&.X+=9䚌5 BuCF?Y3T s^,@*c쓮Nw0Ε[Zj?BXu!2A)fꚦs6,maw~GD?2bKX?'8CM>m0j9^Oi~2cGӔ&kSVtIv!}ۚU"ۙN#{B F)J64XǾH5"L 0ּ8ڜB&K9|fR&<|iT2~ӆ mPna*v+˕jF+4eHΕdhQ>A[<ﶟNHQn8˸UΙ<ΞG㓺7ME! Y(0<#u Ηcp y\,)ྒJHt[ [su\o9`R5~}VYv?GH+aG!PںeQ|{gxg\%j3@ofk-i4ymŏ5 =*3yCO:a O>]# 28>*=ޚkոnzuM5r⳺υ [Q`CmC8+0c.Fwc|;Ne3Ɨ8*;!vpvUk"s\A\bA1Ԇn8Hj1p0_%*JEEw֨|5GO'Xh[Ӣtr=Z%z2 j#@1'U0GRա AO- ^['c'>_LOD:D765SUՏLAP bG'ww0KkMirv˱Nm(\uaFE;)0?woZtӨwʹɄ#lp~> #j6@r`'ɱՍnfy1 jN8~?0'CLjDae-Dd1q?UPɁrlO77ƚ,:ti`hj? z2A)f$pZ DZ$v -H=yol&#zMmLh?>?~RbK%͆ q˟Sepsؾ뿅Nw.ng`M@||vlO j3@bCeЎLߝK:5?^@ևTqfҵn꜄ҵnBQ`Cmh19Å- ԲD{\Y6uW aȕn sjJΏnmq+Tz鶪,u{M`#@ ju93^=< Q`Cm†~צg8MyR M0|G \yٽP{s7w7>ovoذTBVSF~vsՇ=EyOtlE7S`Cm(X_MJW E\0Nwxx`HrU.ݺ-"r9鱧c$xQ W2A)fUoYok]_EpCY|4T_RZ wji\n^WwT[n =Kӛ휺gKqغ:a~rxA⻡ֱ`DC BmXK71ŒS,wmm*k抷-&_X:Ӫل@f)3v%oyWHYkyXz`{ b b d WpmUC6#eѦf1 Ɲ*!Ѡ .q4qMw b kKG`Ywy¤Qޏ E3O)D72I;Kƃ 7Ocq4wcxA>g\wT[Ǭ.ӽǃyۚ K-J{,|#Sp}\Қ\#AL 74DgW)9W\Ep~xY01<1'@7H~P]vC3E۹0!f㵳!Uݚk'38}/se(hYSۣ_ jߙ;ԶNAPZ?He,A&tP쿣!!WO֌^ͻVvA46Mȫsǣ![ӿW1UhxN! +v|禀`%(061FR B-U@ha^eޔApԿ+~2P#Rd#ayd7B'|}O BmTQ;hY<| ݉+>Ԁ0WӞ>)\E Ao+Y]_[kRe"U}\>B^ƒ(06ۡn0umn' @=HvqȦ:lgZ)c7ٔѥFpv%:s,irf5A1Ԇ`KcN}}1+=Q`homOXM1WWl5@!&i .S.:Bl6`)06SX;*X︇+Ew[_yxho̽ /cgѭ$tux}pe^Eq&K?+Ue]x. *x&d!Fv (r uXStF\>v6KMbar_W'΄t⥩>߲gl vcB@6R| 6H 7wx;/8}jM%>3>B8B4MG ?y^d!F8ݙp 0I WG;lM tV~M@%0^ S?kMm{{wG2fq>=Q^,:ր@qd!F'KPj7pVg܋Σ[Lv0,R?abc9MV)KL6-J|۶ځ'nS \8SOl3q-&a֢ (l;GoG*\}cUFSzI-r__.ݴ+OUةytu.[t<όFQIoԢ (xwTa9@7mN}5e@_hV?U/}~6чbR:yǏ̃b5!frW<=j3@eIR<,m!P0B\L)8JV9V*{yqp{:aƑtGOGԫS-Dnʣ H@R帎}(~_=zE#B>rlU{G@ovZ:wqyV tx oPު/ alUnݦ*}!YW4RvJW|pk֚={~bS-]A1Ԇ`_GۧL܈ j~4;~b$EBSGnoaжnI֤ܓaWc]&ʎ@o;յ/D}1v.gfk &GO b bM066mh ΁oC/L%:^{ջh֞_BHtvj,A1Ԇ-q_&aT{ RZSiof:bƐ|[;oגrY6&A~7떴U6.X?S`CmX .8`;XCX$}ګpq*ѯNMtP <1գ (ГrGIu;e*?_g0{,],+iCM5 E#=qhNiKQ`cacw9fݵ3kHN=K zd!FL}Ę&F[msZgcg W L',, 2"+D#:o ,j74WLjAJ^lqSvLrEkmYN[-P:e> C AK Hd Ej[D}g$|alT~Jp66h&@c}n'D&X;#0֢WK~qMK22s9k'!KC^|BAP ! ?V^z0k+RR)uB_~&%uw 8嬫ڡ:9]k 5W$d􆗳WvXsآg:nFngbcs~ j@;8Zk`2-D>ZYl(Y.|Diʿn\.YڮuJ~#2uA1Ԇ .-2\/6~aGɋ4}r= Vr+Zِf{*vb?deLy=xj$U*XARPJ0l NU Q /<ަ긱\w+s|WI^:#%՜gͱ z|M~2^[w: GPB%<G3~E8^owZ?qS{ ԹMnr*7__ sʋfkpqTl빹>xC*kϘY}X(06cQ{Cj1NX)e"'{4j<0hb.l*S Z?3@|E ( 0׃qh0 iۡ {تlƥ~xSuDCsi.1,ed.@ÅN.|,05zh ׼ZZfmM 4ɜA{Q%7/Y)#:jR%6/9-o]).G(~/2"<9ڽ/`p 3)Ζ(k-RwDs_ZdDT4d:˯ݡs7=^wOφG8JAP !r$ 65ym|b Wg/</jPZ&'T& 0ljrWޖ#R^SU׃ZŒh<PZk|F:+S`F]mo\`&zV[ßR6| `mkaK(TLy⵳eCUƧ ;yj?A1Ԇً##j$'5V{+ظ%;om ?O"%t]Fp/g78%sRP߅ŊR3{ޟ0.hb`fgc-B^E$m/Y!e<89d Rp%܊w@s&VqʗI(_in)VVkgχ.Nz(@0n2/4Tg.S c,"C64KX{ptBl:tm짗Jm~*?(^f;W\1pZ0y:!AJóFW^nsٝ$͗²e?:/mj7C(06T+g3NjwaTzkلu<9|!ze߸dt榇Pj ox4/'pC^FpMQcUZF;{ M0 (PY>#U3V@XM8ָ8JM4?I?^50WLr$WMIL#d.@c|Ig3rֻcYӵJ\7q?bMcq/<9w_ (Pg%~sfxhp=sp_[VEO+$`U'#o\T)է$W`~6stp`piW*8M_7 m9W !6|VR`Cmh`|pH*\0ʰ>;+ÒӭG/m-9s[+۵Hd R=ּ NdB:| .NTY[y*3ٗ"˚u^Ko)7!{m}~ A (Gq;I"S F-`pԓVIiS߻~\' ND|-X}fxR63l@bM5HV8jt&Fnnafu_ [+MNF7޸މo{3d»MpgtgOn|ŜxB!:/jC@X'f.`in10+wN`2"Vz61b`bCO >@)065 ! ۥY2t0;_H$aǵcP!&$~#!#O݁,K^uriOaAPHg\م(Lg+ͩe?ؖX`9fkOQYCA'?ik-ZȰsMH]BvxF<=p4l>L#Lw)!;j{i]DKi7z .LWbod..~Lu>dyb'z&EbcBq\9w8g2bvGު2o=qFseV3NA (,-83 lg#2'DE>n\77^(2cքjC@WlmH)WaC"u5{At $ݴA(˳aף{wkB]h>s"Zҫ7%}uu1$cg_BYFFHӋzmh. fzBR[>%'cO@gYg fJuHT}cD꽬 B}R}DT구R5\> ^!'깬fҤnCQUz-,WJz\zbYMRJUhZLTO A}YM4j!uvZ@Tlz|Y(;ꑕj.Q=_Q lJUtIT?͠꺬mjRM#9,"@MTMW7 ~7R.P^#׀H&NKZ^TWT~ TqjJ5:zlY} +J5UeFP+KD%j%PC)v+`j UeX)+ D? Ue5sPQl+ճD?6j,)(iwk?&6w]VR=ITUe5ޔ*JՓZ?ղ jqj UK2TWJUuLT-VPXV'H6sT4T͗6KQM^+Uj& Ue P)U͕%Q5÷xBtY 95w Sj*Uej㩕!Q57;CxYÔJUj.*R&F.9@=D6YjUC|=/T,\@UTTՈ#S^VaϫBn[*P5XVc9D_X*U|>THR. OTX^%_RݱR&zjM.xXwQt+UIO Ucuv/p5qs:NW#IS*ӑTnɽ=-$&InF.s0hbeaamny|ssy{;G`b&3kTmX ǫAT_IHLIfN՛j%kgz)'Xq~!=SM7ebms7`gk+Q]2cZEīITXLWD83BT=U. keѠ:^-jc0]*ZWgZ"k[ǀ>tw׸`eZM|$)ṽ\Fx}GxGNp;7_>,V^;k:^DGR5Yw95V;T[˭X[1-2kMTzWQoP`m y^R^5Zp+vh<kUpЋzj0k$T4)3-X{{t~MP͙^=kQOPm./oU+QɥF0=WG8WT#yXÙ~Zksza ct?v&6am$=/..XC;/2;h&T3MYf)<Ϋ[6g$` at  u3H ӷyu&ra,`iJ^]E}j\5 Nu5 Y+J^ۊj z1[xɶWwQPmb `z!h9|AQ^H3I&u<eƋ?zՏ镖u.U?0k#9ӭ9Pmxce $QiX}~WT}ПXL7E~8A)TT ~:.Sm`f%xAQΥot7ğv8NL5juyy.j6U/k}K:f,j&)X=7ΫFԡT=c}D͠Zt>^LT=ЏX27zQӨE׳3 ڇo(wt-gEMZ]MQ«]}f:32DMZ]H䵥 TM'VWEkvy5j.j$3P KՈ.b5PՅAyëz -f\9qf5gAMWO0^ۉJ budz?^=E Nbu`z ہn#jUU>V{@xM՗=:DP3 Ej@'r1=8]+'U;E(V=ӣxkTewѣc8c2rՍW?QMTm:$P#DuCG20]:PAyc2]j5HT=U-:Uôo#xDRՠjwwJ-hgpNTЩ |chzDp*:P l %`8Mr6=eu[,P~#k6٢`w9{M;&= `ͱ37i?Q9 @28d([zMyjIwn.u7M|l"\kE vD-,Ñ`8k#Ybh[st;͙`_>6٭`'U[3Rơ-`c];Ι7eXy$$rX>Y=A0;9Zգ;Hl zhf'sAF `uÙ`B}JUA,{ّ ul+7ھ`YjpHIJP;Hf"627e7H;$2Yb䬛`D`#VY`@+: g Wb`ˉ G1lg[BlZl(`5l!hlR72t- 6-lRՖ.\bѢ)`6ޔQ,!Aha+Hd( =Tsf/X T6Y1^jn`[3F(KGs06l2g.JWڲ!f 6ւ{ GFsV[lbЬ`3,K)IFHcz8gq %2m̙` 0,]%O֛٥,~%F7* ֋م8>5^XOfRj J']z0;:h]x;N*$91L&!#6Q%J}ԍmUJJc[FGYTj,P,V6jТ)T.[U)P$.[ufJ!EDNv SFPB~hZ0 tm,Y|.Pa@IedȗPҝ72+ % ԁQJy0JOPY wB 3M9(љ@FZ B(Gov>o䤒'eH!`ePkP Yy1ڇg!J0$TWgRdԖp' -2 @'{ Q@%=Bm.&fTB tP zVgyRF6 bX`U=@7ŜZ2*vPi@W <(t tP|(J]T)@NEE27B,ȯ`Sc*kB-N5gt/rODzѭ`*iyRF( ED:|#ޣßwL#v?HN l8边jǹ}&ql8P8U  @a.WNŽd5cta hf5 etz,PJ-A(P?k*9 Pz@!ZaB P^@M Q6jr6PBQT|j#/(NڨPhpV h *h9=@-S]% `TPɛ-$qC y3cTiPQ2[xR3h5^{SI/P{+Goԋ*7:Va JΊn@nBm PmF%xPa@Ʉj/db4͠Zh6iȕ<(^%@VB)=|Ȣдa2bGnJ0ȅ%?hIȥl*3+T%P!91:7 (Lvr? ȑL< &XA!e<^9o֒sKK6IfXO uߠ3X%=\Q_|ʋVUGJLHg2niW]mg)Ӹ#]iF?ئRiRsJ 9.>,kfz?F?_X=LwY`t=XZ 2Kt :DW3g#OFNp#Pˮhr@fEb$ ΫE^J_L^o6rPfx^ޔ4ڊhJe5E6yGjkIkKHѶƆ4i9ic;tDָ!9YCrd #YFPCte/' l2\.O|̳SW-<~~?aWׄj3R.ovoI 'uZϚ1.2WkM=Vlݦ G }565O-_;./;o#͑7W7dQO7fdO7oyc[:<-= 43k cw^HI.z/ɚblSC ,)X9u'N#Ϳt|Ώ? k tW֒'s8i?^IXsAm.xO\t%"\^ғr()/?=Mǩ6K̒ ߻wЦD~G74̸44{D,͠ 6>ׅ=Bm;.;@˃^h݄fYt޵OuӪu^PK SD'tiab/2/testnet3/blocks/index/000175.logPKDM'tiab/2/testnet3/blocks/index/000181.logiHqMK-}PR$.ӖͲͭevYtߵ L0ɢ,+5geAef5,{~`y^g;$rSsz,lzƏg⽂3$erK;~4TEͲhk[itgY9Yز@12N ;c9{e풗m sy=WŹWP~fe ^Sk2uĊR6=yLT;aTdI J|UpGJ_RuϽ ]c[yr~wŃvuTQKgוLMBc[N }[G:׍{z~CXMjs_4,֪h2-)̒RfB_0tT`:V ,JXg9V^~O| 8dnV;tN2aT-m3Tbi`/.67}‹~E^7)%rԊlC 䆀Jg1oˉ.bSeuc?sb'62O .Ν:ʢ{WK6&焀 ; dT-@#(N( FEY.,xW0"VKNWzfyXpFhH}˃5]Lbg1/* ^kw=8ױMU}=5/=^dq (n]t! 37fyUlK;A7%@%Y^a /PK ÄD"u^?$tiab/2/testnet3/blocks/index/CURRENTMANIFEST-000180 PK ÄD!tiab/2/testnet3/blocks/index/LOCKPKÄDHB tiab/2/testnet3/blocks/index/LOG˱ @@Qk8]AF$nb)۟cjr^ͮ^bm!59c9r;_0}Xv;P20=e,Rn>x `PK=vD]$tiab/2/testnet3/blocks/index/LOG.oldA @@֞bu9]! $#$-NX5eLe]f1.Pf4|8 aYu]?!ya~\>_lK[,!}aPK SD14^},tiab/2/testnet3/blocks/index/MANIFEST-000009[ AQ@s-|fm꯲ey1_MSci;ݯSsKݲnHݎ@#PKHwDV~U,tiab/2/testnet3/blocks/index/MANIFEST-000172Ka%&RBe$ %p:qе9Fj&QjCl&RJ8rA"hS'z_n㢦GgYt:6Ϊo֕.]i12z)A4%_x,BH+Ic3jkD6ɉ=W"ٺXX+'jwv뛝ʛT1>tL6{hlH9XyXpv;4޶]AxZ(pѴ_,.ϗ7~E-F'ƙvvo V~Xqw8w9ߢHuGmr_wLuݩ,\.{ڮ/ͻG*p?_=Px|sPkxqZد&R'Ud(-zcE$K׷خӉO"dR ׆ĵ\%߷c{cެ^+>KL6PKÄDnE,tiab/2/testnet3/blocks/index/MANIFEST-000180 Q@|2UDēH„ц^(b[{_,nrꑇ{tHٴt\hNvbBU5(Y*c ?a~~?wP- @T>PKD.<*#tiab/2/testnet3/blocks/rev00000.datW_q‡.FJnPZF'!H43/O&{/$x̔ ɧt%[]u@KK |OW+&zw6'?h\+|s2WJ\տLsҀХݧm]{zc..+$&VAY܀ViP r:nA Ss<5AJ5zmٖ -?]JaÀխ /g[1|Y'B7;\WJ7 LfШo]gn[J֘XHY 0J9_R>"DVr[Ȕ2.S\@'VE$O=?o%n^1WI^|>S$qu .lxHv<7b%<ϟ)NeM|SYKA yPc}~xG9* *s..>Ru  ?4@?@J~И|p[{@pҟl sY 0vzG>F1;?Pr$'laǕ3i?E&k00_92_>TJSzTD=xߦYm c??5kU?ȋGe~[PuqaP6Z;<.(ZW.C:+s;' &Z I1a^b`mƑDe2-™d ]=}rR*`gWDh >~}28$979/SݒnԘJŜUnһ>4Lhff X;vTFOpXfyj:R`x0[9ZVք-$>CXwj$@Qt{no[M϶ǘ!3pB YDbYЩKv<8|BuHMw.ΌU__s2ҡ[$\Of8WSO& ~)4ϦD6 wK(@xzj:Aֵ͚̫1.a9 lU$. ,]3ĸ=k;BCuYҖ:;o£0>N69)6* ڎvx TRo1QO!͆:rCV;㣽@ʕ'@*#[|]3EعzءKY_2,njYcbbS(+.qWSmۼ$db9Xk^,E*ln&{b1 ;`%8³ĎlyHbK<0$}lWF;]S;_K##1w.5MQãޚہSqwϑ/wɔJޟ X:-pY][@=˾I0x!lrŭr#IMTԍ#T;š #z/b͝ pٗ&7 ɍO=ܬg2V$sٍSA}GzH燎pBcĩnj8 . oM.ܟbiMGBT p&p_O9nA[8ˮ/gDһ`/]Ǵ|flz·,GxA tQPB! ~!|vZKG~()P<~wHt)Kv>wHʃ5!-UgwcdG#p]B}(IXȧY@HTqA.Z |OJH}5z_'Ζ鶥lm:ŏR=T%J'_$ ,a4x>NU!v>+nrPC8]R+]7]/̥= oFC͵ ۧ$^GNZ;h^HS.ub:g䪄.YYCʹ@'Aop"FNM؎;uK S)F'g>]j$|ij,+OSट~.w bv-1},M5A 6WgIQxdBr8mx\]rivѕ!*L)!0Ƅab+*I(I!![RؐA[攵P B [.(N J1U^vYh`z&{m4cĚziW  J@h|6AG܅ É>A ۊ;L|ݐgMUJdc1G9zu,*5$&`G$sP&_ג\LJmRFdUe mE#j">Xq/ha‚ʊ ccmmT+>;wj~4蹌$/GX~٭j\U+D=h€;ybԓ- W,k9#Vw_`g]ρ#,XkfZC{ ?FyެcܤPC_zW= @_+*.:aa(N캏Ɏ)3~:yY&ib3:9թ)?)~ەWpL?O°j"M"b^CLok/!H"̛x^k㙰(>XN\d+:s]lo 0oK*Yύ^l,)[$ wE˕#gʱk[ <!?\Cd.v%w{4pq0MwN8ϱPmxN u&q% ьjђsoi =})&^_;x+Ʃd7p{(o%'4s7ɫV8Yꨒ#\+Cmb/Gev8TP(qM˹5tq}rXV, 4߿o<.7)+'jpQWuLn6krvIT y7B;cھuS&10\0h竄FԻí?׮cF @6 GT0/5WZI#*KŬ~;#ҳJ8va*Uִg 9۰\f%W,:K U~/6߅97 MGIkqe-yk\2WaR1שDc?QmU.eΐǝ>ȬZv5^F'hI8p4P)&V3#ۤpcaRĔ^`kpZh}HlyjwgCI'+`|A+o^ej!]<(/Tդ塜"sJ$)o.j7>뱴n6JY>wLܝ!`_9LeS3~:0v^*{*l | \+sS& y2uꞌ]&.`"cK1)o֫`괁(;5&h{0jͪk;%C>n`x1:_tiuqJHG ſ~ LX{!Z|u?9W*ptXJ\eE #a9>:*W) P]@J<*r{{8ƕ=8٘&ʤb/e炁Ыvi1FS#uon0#&&02`ge/3mp%Á݆gk{$,U!F?(B-TMS0)咅(~;?*2 jy !Φf4|UR3 ;CT+3gǺ->J7&>K휓e^!p)!i ρ_I6)J\wCإd/4@by4ǽ('5n%H֧WdpKm±cLywsj;p>0[ʵnwuqƓQ6ɋtW^|oXgn`NEh;نDVZ(-~rvr{6apC#T18S)y8%rr+yt1ezUK8EI˅WӤg*t9WWwVUˍrK?2Nt9˃纤/ TW _E"ۧ]ol  }yG/_fn ?8h-20WepQ/f9e O!⧴UO=; Č"}?4ALŸ:r&k4}pF+NEŚW=2WyK>ܽ+n pgu>&Ǿ cg+FuԃMc-%7c~ߋPFH޻/3e?H?voDi >]RhNI~JL<8[\GzP, t}:]%dm&o-e5m F'%:jCWܳbǁpTcld[p|t~h\ ͱD|.|qa& J%oԒ!>xZrQe2:iXKuu,C问"Hknb来lx׉O wzns Ik|iLٗ{mU2eˎס~Y X]>bUm~֏8ܘ^GDdO­۳g鼥V]&]D N]$(Zسl΄M㢿|'P fPB1!27 Bu9՝sʹ-~g PC8p[qѐF >!tayo1$pc(ɠq {R`Gㆂ*g| G^.>j*/^ 7t&`9㍅2K֤/m6|iݞ`*FNm-Un""rx3Mǭ?ݲuM17((m]H1f۸a9=f[IwP0*Kbz-oc/x/.aONٳrvOz꿿[ދuė+LFRM^LY5+o3VoQ4_F#qTp'%J`|T8~ϛ+OKokAy2~f5:cO%Ա 1_H3ꑐ(oR֐i|ȷU+ e&!ǥ@7ˋѦ4NQy9%QN*h\v+~?]7Eg9SZ(m{ǐ1f=Gq>7)w NT㖳xF>t+,]1`x ,`Mr>SXIr37*.XUUkc &/ A⇠>'PZdQp,M@/C](=b[JG(ߦH^~`̦@V+s7(*gbʬ{CMjmJW%*,sHױآIլQ\OG_KcTsY(LYd/|*Zoqm>/H#1ġ01'_gH#Cp |S{7o6I9# r #qY,*haw'k{(C=4{*(kJ󰗤z5y*!{F^יL4$60>kzKQ\&*Y/ғ8Tp6*2OV7X`_ b SR> Rq^JͶu&5xl{2Њh nN\?4+4n3cX,m$<=Se|Dk}kTs  NaY2ЂL3g*v3,Vaj'zם}qN;@Zi 5] 3%EnpU2:Z6LŒCgґ$b]QHW΃r(kosNL4@OONFl7\8ZԄN.X}9>91g=1ķګ`B1*(NlI zJW q\wP7[70.z:P[ii^B8Ф3Smʃ 1!(_TGC<kDNΣ{ТcS8r*Si-9=޺ 'yUhx(KQ(vFo WZ$ Uy3ϩD:h&7EߚDO)CtDd_\0p] 8D;= v⁝7o!logj@ 2'3[ "Dw':CE8_[ݞc..Øpb1 ˑYM]C\4#K^8s=zبP ƱjqvT,yvp=U tiv *Izq2Qp\)CkITVDG:0,=_gJ sj|̘G9PE4F0J{6HK,tɌn @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ b_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUi mqPKQDtiab/2/testnet3/chainstate/PKDFN%tiab/2/testnet3/chainstate/000005.sstLu\TOR!t7)-J#,Rt! !"] Hw^yyfv܅PHF÷x\|1(}.;eՄ(3q^6'J*+4i/;#mB}_vhq(7O( wF21';^OX_Ҭ1GwFx -(\rB3:40]H?#%h\0g:˛S(w0ʀ].`trLt`E2CX5 zUyn% @ ϵmꭰ"kŠa&dE$@ *KϺOI!kq3nnvxb݄ЭYo(XǡJ:ne*63Hx5$'Q`-oA!gMWOY= Ɍ(v5,N {qzTw00n W51ؗǻ7;V!U[NAhD(AN ɺ`D9r+EIw%&XBi˻u:mu&bB/.m?YLܝ_^[-<EÙy^fIcr'=w+DB}h{OK c|lɃV-Jœ.ҢMoPd<Ĵ+f$Ӏ`chy+Gm`$o:f]šN%B1huJQ ƾ~WJ99':k-#eܛ{" ;UB5^1\.qO;b__Cf_@D1#GbOhPLӼcbx]tq !GU{krrmJ_F-/,sv\K`px',K:S$J`"?~y9Nr JB=ewL<c7?+'6@ qIBz xpsgf:tn$rIIޡV\ H^6YIjb+~V}y%SURR?U/h#7=̣;rz(ʪVge@@8v8ԟi}6I63ΩN< ցXňmH5Ρ8m'p¢ ^P:ĂP}RNJ[T ~}MtZם@1L:At}ɧ2Q^e<ZŁ6t&wPIOT4ի܌ȹli MfRmjzq&\1U_tGJ 4H<΃ 'ڂCV2eD͊ [w5Eܹ‡!Y6~22݋>]q[ 1u{&S. ĹPT[ `޳rL6Y*|i~bGLaJ#N9!Xb$!͒{7Y6*ǡvL '.!w|c߹Y˕ SOЅf8y5F/m8Q3QE/a/J` 5O-Tzgyȫ0&O&PIȅ4y|bFٻJc,=iW5 QJQ-;>%^0vUJj@>.ҪAqJ xfRBo`@Z1^co)6^orb2=H$"u^Og:yR6ksM6N\ ?dg"Y0"r&!$ݩKܯN MAМD)6gfj y#ߎd+\{V?'8\kiEa`)4y/qɦ1j]‘}9¡G8h0*q/΀R F[ c\7v 5@!'t?B?tmN|ԤDc%X Jg_gbC3C\0Lqٿ|g[{'K)=.;7JLK1Q9N& h[u K)^r2U$0,.RE>?)h$1=μvJ`t,5 p_ e!&[M;|>2D%O$ 11ZA3>1uF |yo+WP_Y5IQ:(c-jT)Q1Ta|[ -! fƞMsȓ75!7eYx7e-w}w=c+fygK VX70\-g`!]ޓ=#ܾyPHoM'.I/ \xw+lfpOc!'4G&UݜE-}VDvhWи<00gw.Lr3Q^U]_Udj꠨a"ʍk*T.(=+7ͯSjL/a'Z`!in3K(Y-j3FpUs'6"݉CAeop$>k +X_ ƃN5Vf]`B2]'_댮e8NC Y+g+D!b͡f69F_7Nm2oڱѿq} xތO<1i޶Mw/Mr:`aS,1xM84&KG_mg$\'zj iʕW5fnq'/vgս8E}sLX\(S ԇ =$Lnw):{ؒWq2WwW\Lw0% [;bUQn>+bjpj7v&6xun>ZȒٌb tܠ`P980 RnuQ7HO gj[[lpѧ5 %XfO?xdcH!omD{ $06Aӎ>yC{Ev>YN3ߗvޕX kY)vi 2PfizF~elZ_Ih_0/5A? x' 'Z$B$LD9C'L86&tX="dϛEgGX 3z퓭\#58 ӓUr32?$ 50}$LqWTzz_v )o A(IM;#Cz e79)'k h@ vC0#TS% 'Q! *Vh"Fwd}o#=-~Zkse:alY@x˷?Hă挰mu }$:9OtP0o3 V#7l~w6nm#`8x<.n_gX O i'"\QJ SFy } RTvIkZ4/ރD㒆;ȏOrGhL\]f'M2oO~X1FICA]%%p8*^s}O}Iw6׌e>2?ךe3~0-hͻ&'9ySKEŹ5|I^Mz7jw?a(^*Dr,6vLI\ExVkC*6EHT@BH7 DCW^3}CEΤLn;F191)خr 4=5lak}e.wX^VеUۤZ;hpU8B`U9Vͨj/k1?=K셆%6G>;ot&h֯ߥʿ_=©A4[MUi=.MF:cV=10$Zue8ghqWN3"#G}1$<`NG%S^߿Fd!D>8AƹX&[qa6C5S3 "\zay\c"ΒO&K׃q}av9-(W}ْbzZvݶ_DŽh 'q<Pؒ#P"#Zy9o[Y 8jʡBt́i^xN0g-AɧSSs㾨 ʙw\{0z1)S绸++1"& ʫ|~zIe[, k1{dS2qe%j;hH۷1.z>6xM-4PxyerRQO4tobhpYwU\cNa#GƑ 8z]ɡ%+|Λt3"^CXX7.I[F(5 8/Pkf3Y~NPwZxF)#EeiQ?}hϣs._f$|uMؐzð,_DLM 7Ϸa"o04H/-qvgC<~_g$c~Լ;œ &kI8)u߸b(|S}m4T]i||kͶ!l>k{|S_Bgh*fȧ!"<a=!V+'OhVśoUsrZҫ/CFp?06>T =.騱tL"Tom51~<&ٚGZ)9$?ӀPl(IyTc q\=c\] mEwWY9{\[׳.XxP3٧<͌wHE]|6?P7^jZqPHGeb.Olpv3~F)Vv.!pMj1i)BJ’#AKYOr.P=0%MCЯ?Ek٠ 0 ::tA;ͩ#:D&a43n+ˀ8.6kr`:x 7aV:;'/QuͼQfF*0ox6q03ɾDcS>U7QT y3Y??c\)EcuY@ڋK YYIymfuJ_́/gON #rQjD5uJvE$6찅J&( jhl\!xv5G[ҺxM hRtpprJ?*= 豆1#Vvu}Q'_lr6PbjSG` Ҹ #vNss)=hTW@qnXlm!tC|{ba+dv0 |L0їVjlPP^Y1A1^kb[7ϳe1~FeF :p&@Dsy \(*]@ɜ=U "JdlhpNeiOꡩݏ34p3U^;]H(?hz@A-AykjUg ILlh,>A?ÁPYiiYWQM_j+\P9 C5-y\!wSj&rpOb;R.gV2P퐲~d1!.n@ͨ5IlW,MWgsh8U#+X@QgR9g&ؽ+:𓀦wP6p6a·Qlp1^$>Q ronϺ[ŝwH~){Rd6_u\[wES:DRk '"%) KtNACK"(R_}~>g?s~{g,9 VA/[23T+g6@p$ᰑ?=HRB֭aqجl& ʐy=emÆ%-Y|[ W #u~酲͝/M!L봙jg_2-VKUE%wZU{O)́ `^Rz9z6sՏ QSh~ |x?Z_jr PW+[ʈI=iҖkmWs;^NAýyysgqM/) )gFW2=6%_;ig1S^XBRBN MԳ-|f`}焵 HWC>;֤-3>r'ObKC@jɄt'F$bg\`3tz8z,?*y⊛ho3xw7V=]+9{8BӴ_RO Zs+7A C"B~M\Ae Wy3}i1=`LuZFpQ` ^I" BZTX2>pp2W@q-7)IYh[J@[:{([ ) ދJ SK?Ptڨ /T2U]lkoM: [cHq$ /~3-9/>a9R*bN *S9ukWP !Wgao~n~Qkj+g@⃼y8Y5QgW1J%W+Fru{2PTYfTpY( VD젞yMބrBvqˍJ/cBljCώ.y';V /Zf(}-jɨX%Yd1H I[?W%7 j$"Vb=[@M DzY@ bPZ'2IAU𤤩>9BCb/i9Q3Q>H𬵪bn=pXxAI}ֲwtck: |':/pQwʯ7>-J2%0pM&Bxz%t~1t;q&(İ7>Ҡ UE)"ܣ(Qw~,4lf K[UJvhW>aTr[Zn(4ŝ}q~Np gl*!osʪ;'.2%{RM6HFy>=w_"M.%jYy]vH:LkwQ=Ax%Y^G6FCL󻁣zqUJke<Nb߁8<:܅-2Wr%P<`,*_>E mBQ ;hXxmc]W/ J-IӤ3 ʣ6?B:: :Z ]0H2(X% ,Bd w3QryD;Muf!;3ƪ={ְ{b٢؀p4`C`J_o/tKnr/аMphh~ ~6TB{45GE'#.CƯ@1c6SWn\E,} LW#)@^Ƒ;Ub.^E9SIj}x5Dml~D{ f9oniVCwQ'$W:xQK-JVf13vQU~C^q%zMx w/` IMxJ*i_Qݓ5VW?tpsQW?niD2q2|j[`U'Z-'k1$MJ2-igQ"R TpS*y2WLwKO=MxM43`t8z1>[<DG #~^cVl ͜* 9Yr% >YknWO?"Dj`%bרqZؚ@5EZfu`x~7}<TZ" ,|'j_ _JeE2c }c/[շ|8}pyqM.Iz) '22~=՘g*aBٜLc5yc-h{hWԳhiz+{{]-Y҃ ' ^bsЎ& 9:P #Lp6-ٟ8@?7|lׁ!>$ ?ݜ/w@'"O٭ 9.#A!4ȿLڭP':7yBHPTߟxۃٟ Ùd7&JRƊW3"}y>7G'>G@#'ݔq +Et1Ѥ&(cn0!y1mJ3a,2) GZ*ھe6bӜ3,9 ^xv`uO64.JM*=ie(1~ f߽$Z(HZ>&qVb\qYr!Z4=p >ˁBWh֐="DjM}iހ;E,椒k/~fAZ6bcDLI p$' 41:J3auLZXj}F尾'X"|e|X$;V~7 yJ58?t!ܢ;Xj,AJex1rek f]mHo7 Q#tC1d2ITO,lDx;_ .Kr`Ipk.x KLMi3? =|;&h$mU1B߂% $tum ߤTުދoGS=[tΏ I}{]>yhp y:r "F{+׷O뉑GyԻhqFNFP? \=Aӄf\sAg-qK$YYoXy+k2)5rAW^HJӷ nYK])U[Ve{H"`YK̚kx0%bQ&3A~Nby?qp|XurW,r5'ij ⡰E -ךLFG4PY-)bW0c~.ydз>u@*bGS7x.)p Lt-J)r+õ1$]pFQЃ=sN\so6qT޳V&$Ou*+p Rn׎, GDQyo lBڂ_lK`7_ &]X^o(F2tC@DkoI%jΤN,yFe;%߿@"9t䰷XQ_6%WGTpu(6T;M%6 eci#-#Q8>3%S3ɸOxjVޙC@}wpVOdgϙCW  BS}@&T1]kurFړ;|C;Z u儭Dd4 çB :_ѰG jZa( Ey6Pu6'H5(j+!G3dښ e \/ͮ*_!ӘHEQFOIn"j\lXaLV9WvDҝ`xi<Nb( hɗ\nI\-sa#+g$XJ]~&fIƕ#*"9/+bdb=Gc8Rh6~8UR~vQ@DE>l)$\14S*瞭tD*Lu<J6FkoE?gǮ!MKN,fGM+8r/R1"$%;C4+a F@9i}U ]$~7HwYO@F`i9=C'/];Yċk"9)mm;$ZT?zwc HhMtbl(ʫ LGR/=z_1O6r&"+@c@A.s%|ׇ"XtLB([u_] #mtsZDs3 vF'7cf!>pOWN0.(@mr,}7,v4AiYkG)DZ`ȻfjtѨsܤ ݋pF(`@j)*sԄ:}y1z;/[eI駄¥++>0s^T6aU@\:J@FDJz#u sRw_qǷ5DŶ"A B:XԏIwMCeLT9VmQr).<'4h~ˋρHTo{w+*@`g啅Ih^j$rl옲v\D\%.P41! fl rCIP(BdIVt\cVy)ir6T[CŒٷB"lf jr6]s #o[j} dJqCR:M{ߢ]$[!YDRG@`Dqj1x1O*CX'Rly-9Kj\;4NAPQi=;U}ڸ;&6$9)<1uV 皬pʳacp՞z)R~mKGCHîyee,P5"M Y%IEsa{B6D@HbL dUԝܤ/Ldm.L +{ϒaEwy>"2KDqĀ4lw׸'FX7j~Ҋ}ZXZU?U̹['w 4je{ <H0{,]_)?qsQR]c^7?Pt8 3Te¾&+1ܶJj|l`:IU҄]jF@*.5ky3b/yc#%G8. :j9ԑ6dis6(K+ڊF$%4k Zt&: B8aOܨt ԃMaP}zɀ:nH}~}/^jP֏>'&jx)K:B{g 3({}Fwk`ef("|y}̸;*ZtOX4<rK5G0<5Th;8졍U`<@ Q1tJɡH7 h VHgsX ]>LICq?$= $jkgQe1V7k&T Q$IuًGh5 !vED= ؘYިj|ҕRA?ӆ' P݅U]Z.8e%nXPmƎ"^tSpW%H#QgM ŋTwG0D7kp6`B5dm,w(6bKbPpy/04;Hցx wjC*AZO0ߧ6x1- ui=b͛KϩF.A6-Xz7J|pZg҈r%#F1oӉY}x>q{PUVUpH":T4_@:`iK#@pRǓ)9gm-Г~яқ<uۨO{EW\4eH,=ݮ*,|di!Mh#svCe >-3i`kRׯcHa}=?ELn^yunRί$Օl>ʧ3-wڌLdq'MR\@ZΪ8J%rޑDmz@1:xK8MhiF,@DSk=,Nw w8; %0PQPĝ;J>IEz/lY׫dZYwԞ֨̚I.zأ )U2{\czvw]-ymseRg $׆CkGAyYn-nn iriv뫻DX'"pBiw*<ߞnm|1ãCg7-*͉kms_(;h9S(\"%]&^ }D? KpĽAٲ"і;U+0\Ĕ,DFa\@#=΢Ty$$O_6-U_"E_ gw*לarjvl-<8B@HeWr|6H,q^i#daJUžؐ<8}DׯJK~8~FWkUw|Mh,YQ-}ށ.W(L-Mr1vY5捌OFY{{A e!/ I% Cf'Gepի]<*m׉ZC@elT+ O뮓v._q?=4?q޳-Ilނ%ޢdqKo;3I&=ZchA MsyRD -k~1C 5E,{nߋά[ݓ ,' 6 )!(5~UMJ!(|koT_.|T1t=-f•SgycNa,{7#:oc0ׯfa”Wh6sHBD?c\!U/%xNlW[R _= qJ&j&JLIߌ#q:䠈HՎAz ֬iZ5c""68AohG4/_ٱaiPlӮR~ϑB5 y7fǷh/ sqt*r}D`a@9L pPj/-yC^CUXf b;BpTh!eǷċ{=7&DA ZHZQy=߫'RL~cl}*kQuCWwp!`ԘbsF+瘴\SjOᇎ m8i} a5wbqVJ@n=p^͸bRt8kU4l-P P*R-WX$~DC^I5쾞rlO CLF aN+PPl7C.`um9S)9V&w"k{Vu%U獉'KGXj69"kޏ|Sű b+ j${d]pN^m[MC3we6 Bmޚ`.g ]W+ b6Wd ÐGb4V%3[5 R#rѨ(]}\bA%HcXXK0 Ю.'5"쐔/{7Z#ߠ;[.$kf گL?N^nr0Cfʠ?*x6OѪ. ו#7!˃5]glPŶw&E|w`hA;)a=kes } 炘Y jȼ\SOL^k)Ԧ+g5duhwFE<7K:H`kåA#^90,֌ug^xң&9ՠ檯ٿ!.0#9x@$: ]8Ce]ruRO!dݽs2֒x#4a%EVEQ̼̠돎[iwIJn^%ʑ?n C w*>TʨDT+(۵e٣f)`si H; kSkk/`.6 2u+sl '=o3wu~{:k٤^h@cNnmc*dy_M,|F]5YgdOVf$wJ8c$;Pa㴍h\"q"~@)gcy2xmmrd>1⣆;9#7 ~njB{uy̝J'_Jvc7]Huhz)a^$3L)3>떇}ܿ&w7 L{`eS#UTqp庳A}7ͤOb]bSе\yR{v?5^#jvUnZ йh.eI\A!5o@HӘ{@uI<.USj{,%3 fC Eΰo D!lhwh"$-'VI 1UpVcαUz1lEr!L+MQĈtJA#3d6ۜڻnސ9_]mVFY0˒ Bgôw?6\`h\T7GNOmuq1a;ZiNdx=6 аd0k! k-WmWHYqYWV1Tenxs hи3_lhZՑt4$#޹=\4.[ }7 ^FRFKub췇՛NUcG`8tX%KOIݠt3bH<2̗HW\'SMgoe1"ۤi`/vT?6ӛab'2XJXý~}Dn&CLiKD2c/Qo~ }qIqaYlVjshO̬cdrCTBXGoT_Lr6HBGCÐAWIZB- &E‰F`5j|%iw͇bd3IAqCErjܒ 2,+Rt*ek-(ozjtO)Nf1޼֭S/d' J,EϿ䒪rfA;l[1~C|ܐRVd}I{fSH'r|ULh'LvSx  d[ZR$N uB.΃ ..j:utSo' qRWuX?*v0><΢HaRe (M[Y W@eq0Xآ'aM~ gDYt) zjqNJq|GG OlZ#;2 /K>h` qe=`K $q1wcE]7`ﭠlWc3I!)Kk4d7PR7K"OHWL}~Q͂ᩥ؅vYIgj4Ji+2?_janu=Fo2%FJ0\ ,I>?wFN?YSP q,uG|o%ʾoV.=t2^ ~9 p8tq Oa(|cϾGdr%hϐ!T(2i? IA@~~fҊ)x8z+q2>Xt~[;Nͦ(D0d[)U3I#훎M|\5h sgK4*P/oALU!uړ?zuDIW~wK'i|JlNdk@zKQ沲(X ۬o*) uS"%EPDѢ1^㹜r bYdLS>>[Rӟӳ:?؎"$LϬwPCOz)x!ӅKQMopDda+8?-xUV}Jloa_d)&^JKߗ#eSGE z(+, ;5#Y}U_ig'1|{#U3e|,ҿ 8_G [l,YFh½v#bkg^3[gS$lr hb)AV89\o'bϖCߘF_Gw4c87U/51rVd'~x$O`܎7& "KFÑ6GXm+=\ J}X3ctbk#.;ʵ]!J.N/rJʉut)5ַ= ] P* g_Fd wwXHh$Tyqf2 Ċ\B}r%+0/ʗ0BmF\3p}N=G6dŽ* Yń@֒0j> ζuت-fz͖Wqq(T?`xFބ$+/SMU0+d%$|ChϺ-lT-뛞nXln=vPJ`ꅱg 9DkCWvd3y=J,zU~!߹  Gs_] yʼnH;N5}t1Hn_n1n0^OBGJ3I|RX>{V`4ƛHZ{\=TAQ폴p#CpQ 8,*Z.(mN'3pŖMɓakqQ=G+6nw;v\I@dN9ΎfyKO%6 -ݧ`_4c1T~wj|ضCDǦ/}`l^k$5$q8M\~?lɰ(nû#{,5[GH"zNoR n?4[Z)O?{/YQ(Tc _$e8z$-u\ S .J Ưi9}vȓ­bANvg.H[WyŴr.k{m.Nm Qss\7ձ Mwɿi{& != 1̟^, 8D<żIBұ `aeOA}qu1pxwJD{93HefKNh]Em9LwPCծ/}uҫNV_愔CacpNoETa_kVt&w[^reߚgf؛i }.KL7A.'ߩO NDό9C  GJoGlٖkY'Iz/2mqd_7rZyK5@튅6%)VN1(8CL kflPeyS%S+L*t-U*Z K 87o5|8z )9)àZ: cn8+7q$xjh 2s߯si "mgz(FȞqA5t^O`(Z;N%۹77lvLk"cv ^[E~eQV_(.Oe!N}JmN2}ȕÆ![éUL>E~ExץPR? Im<Ƶ OcG0t~!] [Wg|H_af-;ݷ@cH3 Ub&>ЮUF%5Ų1B|Pr M{`x3OO݃vV gd f\Z!Vķ![}h4f")?ZaV]lӒ5Ľ6+w(XUQzdɧlrKUEtR9*$u%פ.QFyLUDm&RrnTǍQ1Pq/bZ!d5PЎ[3!e7]P3"gsP)_zsHЪi/\ft8çjXV)dOsC4vG f5܈.u@ `D&;LCov*%h;@e%Wa=Q(-;mpĮA,Z25d*¾m KqNVz/qO(wϚO/FD;m,m ÙpRYٱ,#xN1M f4sJV%E+WTWq 2ePA2 %K Z)Z e(=o~$'C2~ w .X4HW>L7N1ᥟ댷6{P1sVNa!*Q6^۴&!Ƒ44ȩ.sыY}ELUN2Ӓb0'o*I XP-=m}=Dt+t>eU-19쪤ŹGEZˉSV0۪]JhꧾMQ -MSm~>#ŰeoYka{:IZE?}"&;_t+4Qy lMB||f Y3 vGYdq7ַjYP<%czd2uLjvyT (>h l,RNnܐ|>7,>`>>1}ҋJB_?8 H9]״?ۚd6ϑxM{M_}2F|?c 74.2([ ߰IqQGtU|;\rRSo=8y0XtR+oX셥JD"V(5MgxImF ,lO5{ᑲRŞؽh0ﴺ~>̰2"D Wm=AJ[nPP1TГQy~ӞOlt#ɲF=/-xF&1(ᐬTD-mUen;oIM8 PSf"R˸1n1&xHj'- uc$"9P)^3K.}%Iۈ_.XvI^bxoSMb BTl I5@Bav,T?,#`d,UZ1SyQV6wNiWxj սu2pbYΦݠ}ׄLutۑKOPᙢ4 U) y TD%qLŗ=%J?\ )>;yDNZtˑC &6K*_(VwqFߌ~VVO Lz9S]o X}SQm:V& G #9OX?aaNJr!B)T~|_2B/nS@W;žq麝Jb1 v*J'c-ҭt-<3.涕7DK{' V%Ljv/_81IJéVON>R i#e>;vU"_tJ*FJ=Յ:8[y7FyrZ؊k?K/EQ5iJz bVLk)%TlʽZr'Xƿ1ByNS(Gx&}S`3h.'BYQP=p@J h?.q--2/fNqɛ!X'x&±Pkس [C{~M=Je ;w?v3jd~5ՠC|rI} g헩ӢD b­RPH\/lNz{5P覍a$ YOHh\ɘ휨MiKiq)1@!]>YK2^OQ_^ش˼Y5\֋^rI֚ n!ۀl#WNՈѽ,X# ׃"z],"R7@d.ߎIOtGlDKGﰗ7>?DHb:b|1.MT45Q2Kl׫7&9|EįQN=f઼O zpWvn,ԭJ!%U+p@ᚂY-XgSp"xslFPh2Ѭ„s)Iz-ʒ7Z57T:,g|0NsH.a>՝=xvR$$+ v v_whPϻ'jIx$|RNA&=0?/4ƬG;}"BFrgyӠ?ǝg8ϑmnpUd6\4ܭ0EdF̰lP|rBs]OEjgm@BXg%)#"gL9aWS̡ƻ@7׆ԯwP#EoG1kc׈)C!]=բ xW%Vr\ЮbA~Y + YO}&ɯ lk#dKP,Ge"j#!բ,*n3'W[/2`"'x8d.p mFV#bZHj,ftmk[f ʨ%ӾZƢԾD/DmaGT(Z ?$s*,MZ*5cmѶfV*TyJ'b}/ _=id7Qg|b>!Qfɗ yPCԼhLF\y{~QX砐d|68cb;Grڡ_ 'j3bCN;) -KԉJj.?wR7F\E?F7;U,Ug Y PeOS s]lFOST&xDvm:pX\w+]0|>xK+dgp*,c ;!s8ohԕLYB>+mbce&*r,0QU,T >zs> K ~AIJE@xogəCPKvUH6(opnD6¦TZ *h& 8p8/4Lk-dW\z.c?K>Nmd~sZ& sJG% 6 (]Vî]jW+MX+J4 ?W8RCs4LU*6"kijk7VB$͆9b2V/ ԁCSF$XdS7G:X^1QP;OWp֓GqV]mDmf?dɽ.>` }xm&y_>%‚Pׁ bљo3p8Ҭ-[›#~͉ZaRJ&q]1~U$=9}盃50;-cj-O\zenO:ef^A!0U)ΎJbl>`VP{L| 3֮?z|݋4v!}EԖ ț {g[<$Փ9mJc‘'W-Il <Z\/_?mfc.x7W+kWaZ<@(R|jd*ri(&kD[ă<rngwE $iX V\u"deM; !݈/cٱ첥C(g^KDӝRrOQT_ >߿1z|9|2QdӠqXWUY,sݨ>!{E Gfo/c=hj5:}1fW\j1EXwQ°=mU}!Zklܕ$LҩXsXF,Aσy~;ME6EeAӆ^?Hl-z%C&%'vl%Lcre cVT20QGZ.!}axPK=vD_"tiab/2/testnet3/chainstate/LOG.old @QVf7?؂,AF$vQԱJelʺTiwc׶jRN~z}ރ~ aQ_Wk.ںFcBnaar&h9yZU6)r,rUHM(iטg@XIDxeUSW)?vn놮ȂnVvk7n\QqwP G] SiBp_R8T94?dY-_^o㤟H5T49490.'m5ㆾoqʄ&1cV5@ǁLNuF&lm f[ۙjfSCuCDwuVGq{C:wXؗz ?(fJgB4SeS,d~ 5}m{1knP>lIIzw3rRwnS=|a3]V9O]GwSzSo53 4ĪꓞtxqIzl`s2yoNyҿh7}n>QHUzz}cm_Rm;%!5V)::ME}UG~$=8$7 ?PKÄD<*tiab/2/testnet3/chainstate/MANIFEST-000093ʽJBa$4CД-ACCau0PD|]\EA+k3]b&Kr<%+*yʭ|ElӶy\p\p\p\p\p\p\p\pſ8<-+}T{K[ ֖&(!-\p\p\p\p\p\p\p\p_ Gm-wK2( <73ʦ dsLy]=BaT!͈?`7|>pP 83i ӯO '/+n_+-nhPUVA0dF8!C>˂#?YD9GO9AAW k9rPp#|1;o ϝyy^(nމJXP;,k  w9<>p wQ=Ayx lA)`|#PushYF/𦈴/P%Z. . . . . . .a{4K >@q#d!W^`8O31+A=sp^soGa j-ܣqa~(9dD&?6>. . . . . . .E?P%a*7'/ݼ> } xx<|߁($8 rBr'_$CGy.w{IhZDB:!yy= 6M(`~2?Vt4Rr3q*Ppf*%U2OHɲwRIA_\#U%/DJlџ$MKP1|OA6_iMလi$S#ɣrߨiˌMߝ,3Aצ_{M 21( }}^=!^& p"6@^zZhA@ PA{ .rcp pviȳwOU,zqweA]sW E[ϛnW0_?;Ax5GMM,%dgRxً ~6}0rh*l?N%>=?kourrLdy *R)g䁏7rNiw5w6gګ7x2K}1}*}@6;2t 9:s3zkд5S ppn5h x*8dMƯ VK"Xi Bs- &df>7 RqKA4i LQL3eۇ["Tg=f΀wJ$7\̬ D$d P v& ne ,/^ yeV-C1J+l*f <۹~~|es!΋ J\ѐ,svi}!c^J>z_=3\k885fr$Ù}Ilgw I ί@Q=bAдe4AqWJ_㤘q%_A`r!1 >\23)c Vqs R}|P)`8[uXdz൘f*3~ZǼ`ܔr!o:XbJ!2  y$f !)3231|X) n\gU,2vf0gc BAV8d翾,Ķ cYYĎ6.lǚ4w?~ٟ e7W,t0}P)Qs7} ,8$KHlgw H JV" ȕ %(C`Vn2;W3Ⱥ 8֩A(<'eg&S $0UHWOɒ6UX "X9X351l"v1ï{ٝ*{9SrzMtqz(3F8w7djZA3V$HA.[IJU 5 $kd_ ɟ#:ap p8zo/բ;ClUjad¦?A4(FRe.k:ٞax*I*1U&n$A?>qvG[ "L9qk Wnp'gw6]q]z||#hZfu| 3eLo}|{N < Hegj S:Dr,#5|H:ڎtVtw# dL%{'Cqtl\e8L k֥fvc!v6;f7loBF Jx&g-V߃@TDgｑM )qښ;ڧJUmHYdYjӴ.:qUB Q[/)!) P >ܵ2 yJ-;QdL;$ xNq^?jc'XAb>Kc4eV3T`hlZ9o1|CB&yO 7$懇L Lf5k{UmNU ;3TxasD'؅naB H VdRڹTVۍnR%(eݍ{QȈ6u?1@CN><Ӽ6Ec!6Fo@LzuwA~=H6fE ߃s}2-dsT5,"_4{ 0b Mjb֧9 Z3uע?[eyjӑT>כN#M9ZVKSFwdd-H}h/ՙ9r=/df :[Q`?soh>`88(`L+hh6)`8[UHUꇦYӴ2:Z_m( 2؏,5'yPz羟F:نG\~f7Ӄ_b!\ :6m,feg2ǯ'CE rA-AW&nv<pWZD~|i&fZ_%4_u O<( pmKSN?_5(KOg~=N15q0DY,ڃHn Aݑ7r̩JB3g쉩X3%¬CȯFbU˺Jp[B~շݥ-8(83A=~%`s!շ(Ɯ!lg0R0x'74-A̬ȯzQŭdo;gOYKEv~yQ)faW]+1(JO8?N& WfܭSadG_}p`f٣"ίH;bػF_ qJΈөDU!?_5$[:jIZT ~؝z>q,[K(=g5R 99wJu9fVᬙCLaVYϨ7ۯhs2I*8(dfJF{I V2TUoT 4-A̬δzיP֍]_3O~U)zvg~?_68*չ 327n}9&KIA.>XFA_I:{bp p}*➧\GJRo7OU]'u֐,iGs۸f5-T_(5KuTfV)W>թĨA;+T6u01[k~7W(1ĭ 1򫹦c&Pp&M=~|KIA.8jJ os3~%Y kȯv,"VM|ŰcayWAY9x"3ni5O&ԉQȔihY>XHlgwd4sJu(Sa>5shZ)x!hzWz_a"4WOf9d "/df,dA V}YzTUs:1:MKP*3{խUm̠ bT2|󬒞8M宣j~X3bI,j:Tn ԾÂ)qȯZ*B^luM:+bp p ܹ2̺ V[^);yAC+AY:N8qnAݞLJu-]DW[HlgwdKh2fN˭CLaV'yԊZ;_nKȯ^|'eyQ_I6XaޗI٪To-UՋ.#i,R%(xէPŨ,`}r6LU>IO_sr6(|1_-s2" rc+feg2W{WJ/ő\g *.CMluuUW`p p b3{E8wc&9g9z)hOQT~ՠ,W7zyWeX[v7umbfk#XHv{v ȗi*ՙ:9 *'fMKP3YhF8i3:Wj4ۺ:d d++:R+ lսn oXJUH>F,iZRY2:CN,TnXա ^VuBPuloBtڦN8-AJl/-$qZCj_6´||)ca6zxbg->іt/M zy[kD[on'q|-yDM<pB-[7Mߤ?~q3:#n!k5z:rJP/,;#u-c@P l c3p{Bz.V[G @mrlpUS2wy ߵxjI/ߌcbJכ5}m_{Dٹ[z7}1o&x:ob_V_,Oz=aEQッ<@Z)?7$38lok -2<4G $8{ͿzTX]4dGZMKPY?#S.b篪y1iRV0jB)?<pBtAo<0(8ɩ!JsmՇHA.-|'ޅv-ZY rz=<0 8;]W9ʰ}|4p1?\ ҳy]M0~;\/ԵYX\z#T%R y&͜ER9yhLz94-AfuzC/un {^̸k=Nazp9 +{=/ V=E'ؔ6Up~KTmm4-A̬N ]/L꼢;}":t9AӿUPuS<0fi۽i oTZV}hqx4\2|TG#JAhבwsBS0zz>m}A}?AZϱc=T?a>Z'}P4s=߸}j4'kklٷ ]>:hgݾ5iZ=Ȑ<{؄: 7Ż[88  ,^HCمHySչVj0:͌3ӀAO^-z`/]gpXut8]oZYǽV`CΘzSKc q5jG^*L-Yyv3'|uy֥sȷWc6lPY 66`F]f{HHg"4@Ju)BdCi j@0ӷ-僪~C$qϑcD|;mMiri ,Ĝbxfeg2 ]@cAˋ% Z@: yŴPdtAy\ɢ#nvEvfas '^P9<1w-~tx{'4Oh5#fU\p+.-ci.=Bk}qvG~LJxS3ǬTٷCLaV'-a;Wu-1ۚZ@zЂ!` M×v"lg5Ko}T`4-A̬':c*Ԯuhu,KQuVjzaU.'hzZՉ.E :߫-QuFk3NKPxʊR$qh$NKeP䣗VJAheuD'd8%,cMhZ@Du3'h_9u,j|1:|\@7ǶhN7)W33)8[Hvrgtygh|2fRU.eVZ@tputnO( ϐ )-vt@ )&`&PpI W?\g S/뇕~=qZ/!N1ז{nja=rop G==:<{j0{ɣ ZK*o(_KD?K4J6?I˘~@} rƚq['3qpu禂,yn7YE乩e4֌ʿvW\wM*m0&*ʏg%=Iཙ*ھ^Y{k{*~ү/_#W\UGC\){Fw?/\sUE;sNݹR+J5re*檊>J٦s|Kȕ~{UhJ-檊nJن4s|sFtY6n*"geXꎳ=aoT q[R9\):ɋ(ڊ["XEn2QG5~YE*>gĥhmP#<4xXCa=E硲szDX3*?\E4qV~1'9QEfsKݹR~6(JSN5rU]U=hϕuJAϐ+U51WUt>WΥם+k9eTׂYmGlj?vUm }nr端W+*L{|IDk]y7ޱ^>vŹzqUOT$~J1G`5!-WZCY W#RGr_h3Mkay ^.bU^ƙ$xy8tXU׊z庺~TMhr-Xu2kWs)jBРgEŰQe; 5w]pX,,#jy׆k FpNY$U6={Sݣr2WyrY'BrQw?hˣ^٠QcQ7)6Gĝ;:]D;w,݁D0YÝVc_a)@\Z<^Nꐮfj9(̾gYs!SEܳ wu,upt.j=ZYrM =g - M}gd$ z+E:Z@/mrryؗZ@gVbig>ťr~Y|cmI -lgq:ņ٧]_Xr/Kob\eH z<`Ɗ a+Rl)_zHVycayٟ9ש%#KLjUyfxz7TLxm7-3e&*_1W[4EW1e]Dgӣ=1ɪw{IQ Y7F oc,;+ H%yj1\N}@u% k ō f BNk72+CSFRgW/[04bSB/|fzG{Vb<>sNo6Sqhq^ %K,up<{ӌբ.^^FVtAۏRt-3Z[ ~dV_\b-3Rvc'n0-`g3m3kU@W`!g6bss#2'9̋N4dI j D-YXf9v0s2>A>s,"qgҨ!boUv^u"w|;1B=8ϫdAL-z5FY^KjVkȆ8 R s>59-5VC~rN ]x=4caǼ> rӌ4QTֻ a?h^{Za?_žyM;*GjV f YNG(o\ҏ:ņψ_Xp~\ i q]X0KK[Pi5/{4k/t1&_:}A_> g*9AtjJ!3!D 1Y@WeͥB:~8vV6{]UcDоڧ})cq ރb8 / @!q'Y({H #L_,nU˫Fڴ{?FxمBvblfg(G:2K=*XzO^@C9۹@k%P-v1nsQK]^۶J+垁]$|Nu>^!Ʊ1۝,?pU@WՍmL>m ۵Yo9ply,4 m^rfAg`W9g%0S$| 7'~N3ޯ^5U@[6{P@ލaʸ{T.Q./&2R ~JT8<[ ɳ l7z^gQ4wVvgx#p'jOI>Z<>k{+~ >L%ô7:%]FZqΆCP|r7"1ptXz5S+ȹdIdps 7߬UG9Vuy,i<')Yie6+HOґ{j% [%/Vَ SƨM[6Z?J=?w%?=KΎ*nV=CYn]sy>YKc<_zS76Z?'쌵ƤJqr^W62 ,qؚO{E=zvʳi&=qo#xZ;%G&-m-fٿٚ:}IFuZ6.'{@g﯊趱[I j >:rnM%i1E;!c㉓RN8L13|E~Q+!=qyͶ'^kԡO?:fO[zv^QbS3:=Q;U`i _߶9YȾW4Z|oYW?NO&0/͏Xڪf0t6 }'_oYF⎕Cܙ[0ˮGDƖkv쫂˧n7S5\OP{l;5ZM"uq9w~B\*fk슠#=Gr2$;_c0Kr<9dA;;#GrrЮ5Pͱ) \Ǡ}{H9*2r._)r*}opdA)SPcPm{,:?Sc0K Q>ܙA)$TeSy{ >@MS|A)/=]2H9*ڵY=L{(RU2e-c\/^bty,JF 81(l͛8Ee ]-*)(w.|ʵl .;?3(jL{JQnwK\7Dʁ^/jVß JW JVNvs f T2;Krw3~!w̲GԠ?צƽ z|m{\N{aPʝ.-X+R+E9@9"DʁJF?RnyRYkqrxGy,D @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ c_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8mUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUa_AUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU؃ FPUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU@TUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU=8oPK cDtiab/2/testnet3/db.logPKD_HgNtiab/2/testnet3/debug.logَMx 2@bABYY0žfUJY 不{tfF8owwd.7塼iOr{K}|S{._===RQ}I/i{/7z7n݅wee*JKS{*틗tۇEnT|A>?~_)Kk>^>gK~]Xn/u^9Z/lPom-*_o_ony\~)/_Ov/߳[ײSylo?_? ll{{yYmM8އy?8>{o?<-VL?zsy7n -d%Ԋ߬/MyZ/*_}uBi9?a)ZtJ3oZ^嵐\~Wخ6M]]=| y;Y? ' 'JNMLs)fYYosPZIJg]Jw~± Ǭ G|tcw gl[׿oֿsnTsūls)um݄ndv3c=fM2hf֮);zR,_ͮwVl͡r,d``j!Lo\:tœ{lɵser3S/% *Ƭb5jLrvϫ0M}@\sW],\UYoaٶ6E[Cznw0j”dO]~*`RyJ)'(mXPCɔn5\I@(!ju.ЩbJCSXV3]5aXs뺇~j3o\8SI_&Uh3WJVs6[ϢSN$b\u;=dW6͇`w%0tA5ݱ%@ n@}ǭ{2盛rSJT NpEj+%υX}7L~v@ =![Qd֗i:ZR~U54מ Z\XLzbKٺ^p, z{cįp0( JvVĜاf[ Nʛh/x1FqTKPɜhS*Mls,VqN5bgz.m.`e : rL==q?2Hƕ.̜-. Zߪg ȃ8@(/1NMq&1H&%bIѬKL e]9opqxCΌlk=#˚6СV As2B3&L^I:Nw 86?C>):vs㽇\{)v#w! W#T]й@@ИPLa皓 {Ӳg#L'O8gFbL96ˇAT̕tjG@]y9N)*1&F(m9-bZMJ=*|wָ]WvteƍrГ `&V.vVk.}8lr2k-($rVnRMГ J29*Mnv)6vh&^P+/Rz@lZʔRrs"X]ƪ(L.ds z)+а]8ghd XGs |46#>q :fAwh뺘4 kN%Ԑb3GPF$1Xaj3pho( 4z~̋'O(sFpf(QukYʉTKw[˼񢭏fG== "!qLK(x*N`׻ivU\5@3:=#w#ɁFn8g颚%Glbuيcf1'pv+Q:֌4F'3@X^KCHpz&I."uBYզu~ ӪUVn! 1vd,܁ Us1} ^uC>8z6$uѲk>:C[OdqV07oWnHhQSasF(O tDBu eU<?*pTqIωh§Ar@ c䖎[dhmx'd@,f;FI2T;Lt /f(p^W4:Гbo?&j+Q9L6t_&`_/@D;kŎQT pFIT,Gr̩ ͒o˽9H8gu@ 7| 9R]%8'8i TYnB*&RܶC+м܈_ z2U '6g|8X2t$*gzԲGSt2/'<$'Ms IsU 4g>4bEȘ3C^2t^ĶmU+h\gCNA:'"+|kvE3/Jyן󩠷Y-mn 64bz\Զ8T;g+/چ N&<IZ4z?H3ؔƁ! "|Wc@u_-d fv~k ųI-jE$nK͘mc. 0u CF{l\Us΅UKrϑXww+а ogqA>L܎u^)WMH\6559gN@whu#b+.df9CO 7$9U !^e]γ*R!@Of#Exf`@idj)'^Wm5mÎm^ r/G'3@5M庌JYbx$Xۢes,3wg0{z@Rrz6hݔ;Kh'߀0+.&́i\ tnjazo@ǝL;aγw'K\ #M/~(WfԠϹcy t'3UJİ}r )5*gG8Ab ;HBޜP(C35SXog^4)nsZez$5Dj/|ߕ#R`>5?y+,|]^?aʜެ%ZBcw}:Lv"d:5i{)rt~!|Ĕ!>0_' {'|:h[X))}V;MPFɏ@fj1ŌS5gL\f°rDBS@X!P;Rb2PQ2N\ٜ\` C$N@n3q> :3P(rD2߈3llE$ZYOQj@)kHՒ8JLEQJNcBْ9$"V9i@nSA :dgd즠-lSժ4gZיw;OTJu$`@"H Tr<ѓy`$9~9l|0@VpCf伄 VW}ɓ:vxꠥ=Z65+QXY:ܗWyt?1rX'3@%XM܏srbzd=_ -fy\ =P!PGhNf*6c/d;: ˕"V'gJ .ƄVzty1Ru@fU=G'>h gȾEF {L} 쁦^1Pjd( JDEXi>RMDNHol qGF@]R˝D8p988Ϟ,QkXBH8 xj༄fJJ|RdG"U4(HDMӌ9 Eʝ8v/bAٖ3dK6ȑ(4w?Ō(7FwO18H9ƓQw 16d$C.b{%QFwq[ tG8"Fv'#+tjJ#"n\oc3$۶9! tOX@mĈ4w@FX!$ 0<(dD{#kFhb%51E'9MQyV+QBKIjx x0{!vœ 5V /e"L h(ƨ&I76 3k;X&$,1<Ɠ `Dɒy{\PA`0J iE@@'@$0䎦0 I XqGF%>>q~#DiE[u]rC:= LN|Cj<D8\$֨SxfEA4Eqz\ѓ 4=2^طD1N ~_U#p.q|:eE[atC Ki{9y`'ΙǧԱŤ$ 4쁒Xh: pk}"f Lgr8G8(K%D8p4 tGzɔ@ NR̨r$I+NF%txy-|h/W@ݨG:NBA.b}2ESuJpH CFmYA T:arba8#z=R!zΑg6aAFc@{ܣ3z23_ WFEG9:~ ӯSQ3qcF[l1+ ST /#ΌaYKl?zfY35{E@Or7vfI M@ԆZy&[eִ5ktZV N OSQS߉w<VAON/4u{!CLRӓڧJpS${E4.AJGkbRgVӜ}@OtCAH`◖n3D8H"J?a\Zv|͊=L 4;= 5bY (&@!`%GJi8kUL tnj휆@C@P!P*p̠8(iF nhBI|9r+дJ)gfd#'S@L.1"AbLrhlU,_Б 'D@@whRG$V80 vGTA]|p}z23n Q#ҧ[ ǑtM͗4J1YlYZlaձG |2wx-7hѱ WkDG/Z< #W =OfcBc~POf =!/p?ÕFR iq;VX# ɔNP쀎8gČ`)*@I#rN!fAJ _+&Ȯ,7¼{l2,714ؿgp<a W51[*[ۙ420t =TZ=r Kaa:\joٖth2EgE9+4vcJ2ULГv@ݓV#v5WpF(z90 ʢkQ{'JL[ W}Se hPBcy @b4 .*x&=,ӆGf%+euODtC|z(%mt qD' _b">9>%M6v4{AF$\!T/${g! $-C8H3.jPx4c2ŤŇ$8&p =YZ0y0r?1s2a~m𕟕,Sr+l/^G틗?;ZQ_D{E̗W_Y_\f1._|2 ޗIÏ`[4T_>/ ܟ痒mFReLsSKR%Wiqi=#5m22A_lQ,%oJ lHR-!1Sx ,Rm,xQ@}0ЈB} /oJjy'򩡖­IJƓnbI O@_ 0(9MDYi{ä=TFxLjPǭd,/olCɧ`Ģ际  ָ4;k0uCg[3!<,JVZTAR&$Rc ՠ#1OҤ;I_堂fRP*a=qAtXPbeBtҤY۪I5|@;k4!TkA³gv[a^B v"6XB,ߙrCwjP|gO]QajRCb*EIaQL2 uU;ke8 3i뻇z%0];`j% 5a!58G0BA;@u{19]!T'a=Գ' 1DC!Ft)9 7j3#{# ڥSᬞ=|ED@4 W&`Is+/Fڻq\doaUzPMǯ(;(92MI򍒯s04I%;w,5{KTh "vD$a#ár!S4Ƿq$0D. T㽬BՃ}(mIuG,T@:xC=l)GAFP1HucKM@unuQ*,gc@GQVi0bc~Y/b"Ef5fT@W~Aq, ,-/6#IÔKI9R- s*.aVn-}:x0Z,d^OJ4)/E2y1L/. qŒ{9Bc8D=hN$ n3~Ml.WIhXjdzSgSaX-MIxȖᬞ=ňt,3m=h.VSZ$Є=&!nex hZt#w:bKBI㨑zZN(Ot ŷ1HR f!UeuǖX (٣YPElMAג]642zrn)AjCgɤcЫ B{ѠII-^rp6Pwli;pۛ!RCK(|Qҥe{u&@U$z'h^* ݓ%kHYiIb_ ?Ql )Kn#qijx?JkktC-}Z)@!U'"~llȟ42}(?7CpP)~; ђkQ=$fǝ;;5҆L^zuǕ} $C gi^\.ɢmZP6gf&NkܼRW={K+-=a=eɰSR"+ÎG6 gT)&@qm$\14=M) u,,sLݓ ŔzX=pmg5MP/wMBI(٣Zc@DeԢ v$h/ޮ+H qkB2һ<ȄH2:I:ޢu27-# |BCf$?;{Z ">o\X!>,' }RpzG2{WZZ#>s_di+8Oi 4O/v-T)\@A/*JȃI7|/mxCNfDH"! +xpĕߣx/=ć*qp$qLHoICQZ&c m'v4{l WJ|jyfsD晓a؝@!'e|3&@o{90ਞ=DC#vm!zP$ M[>͉~KIW#Pr_1T?=DREhi!ZJ7tnNE9G:J+Mx0 -<{&KₑES9$V)_Zv"AE`\ߚ=WrxG *4gO%P<*́RJo͎Ff#\J{|gi.).`*7Pw\iNG!ǸsI g&0;#+"XUãKfnՅ4{:WCٓI5}!  HDTq).nuqOv}9iNlTabẒL2@P*/: KziI<966%iRG2HK7{&A7³z㾡Bԉ@`+bVP)F`X%?*~ك;Mmľ|DLl@-Yd3Z,GuO><P٣;T_T2)S /7l*E+37\jC tPO UphhL04GEKݵHI6h[ÔmҶ$U=*>ΞS"> Õ΍ضC.A4e,%Wyգ>³'t|OgX9He&ON>g{P6Pdi;T sϞU&VK0qJmRZR.|Ah6f);7M#gO+A6=ҲCĎ)Iu9͖,,%pl YڶCMy%0gO,AbG!"rwUE.Up(}R5_L--m{j~Bu3Krgk4wp>.928%dAE|ՌwВPܞUj5 +[⠺=ɸ+%t/+!%ޯsTRSRSO.X7@ݳQ,1T?(-?{p O">A*5$Iё0xZ{eN [P4Bcq2?{tIY#!*qmFލ\C-ZB[gli˃iՇJihDB'Bh/m.> h.y̺n=TF4bKn8~r(BxtwY& $=RzWb ^dAFn[ڶVunh &irPbusF KwC UcM} V>izB4<I@ŁcZbItQ,gKkc4C6 DgO1*Tۉ$K++f*PGe8:#z`KYYWvթAӷ00^M,#$+HR?!dIn=[BM +T?*Q{XճgHK7„tJ%b0c$1\BDdp?mWuϖN5T[%zLMŎ2 D,sCAd>gKk;v4C& BgO6i]LmiU@>$mTeh2w4LED2 T_6Bj [:{ #hI-RVě\Ēty,BVU4?#D@--ypĖ-1}t%cS>c1L0{|LvlXW=L5i* sPuВTYiRBDvaੳ^^zndU©'YIj-ۥ`qZYI (Z Х՞cB=>Wq Tg8 $T4{߻tR7d97pmh!Ǖ޳u!Tg)''J Cب(Ş2"8E+'dVj}:bKYjĎjǜ$c~j tN.NՊ]L+}O0#cK tzB5yf?{̉4*S`LňnҰr*c8ZfPmF ,;ޫfy^U4j,=Ē ,HgфY7%aCqvj٭JT8TV. 4r,RX-Uݓ$ ^6A]Fr61<+n爃HNեO!֡fcr53͝k,mct7t@ d!ȕ#G 9N XHU,~W| B5视*,R*0)9X ='R~dguO֑D<P`gge19mK!dv; %:P{_TN<|1$QCqJT_Xp(R\/lҎ-m/MPI;!.P2·UgZKXZ&pZ>#]ؽ5!P1Wbh?*+BOYh"MJ&7K Q#uG jщ/nS&ASPQ.Ԯ`:H8f+A-CaӲ|4qͤfrZz)]B5F7=恆`'rR%&)Q,( k-]XջgKL-c8[\xIQ?S/D)<q&ED CD-qFPƪ υ:Rp]De"c1H<nJP{{ƃ#do>@ BmD8!1 )PElrR;&0[vnPI]+0jyυjVV!O|"2&WΚBxϖIiۻ޵Syxj_߷})2Hv)k{큡Kfe|h?-;sh}7E'},!{?!ꟃ!bh9 kmH}K"q>Pl mZ)x=f'ls7kg?E]=M4x?ywHO*.Hd6OI%.OOMϓ%'KN,ݲ~jCݤwofMyC5H7k^m&E'Z&ۘd;_EB 8# ݁jS$㷸(|=p>\r6wIsv7wN{xUfq.E`*x5N{z*ҨcSDEX{xwl~QB']/ifVv{w=c_Ӽ-̒$I. KE!({czr)_b79Z:l3m4)@IBϪ2ImsN$ \1 D4u~ﯿiۧiX|6Uf=UXb5VCPA 4NQMZoe22k47UCWFDTߡM7\S\ExUuy }h#6i&e 0q\+gMތ&ب9M]>apLJ:V2* Gl ٔ&d h aD_/%FA[M7>%H H|mLP8IPttxJASOcHcIc}~# 1^iOg`l{&L͡#n7ofVp؊xfIo^UtbǘsN,9Y%r?KĖ~繺'nx>{F'KN,Yg˶Fbb{Rɔ)'Sc g{Ħp CUun!-TRDǥGftN!y/ZN0)nWLxTFce\^1YZyͪV ,+#C.[K%(]Nʐ"ZMX"ϘPs)TZVhW&Tq/x_P8`3Ƙr-qFLna&ljwߙcQ0 ꌔnP4N2(!^FXPF"K=K4<3x*LB ng7.jlmZBw ,oV3S~Eހ(F y'74oTZz`,#Drq9gD#-aC L*z0)1QIR)*j) +GenUND)0Qm- F4μЖ󐬂]$4܋Ha3){F҄*w lRF+L}mH_O!^FDJdҊ60a0I)'wI C2.BR.Ƃ"n% hR~hڂZgsQ~h 5X)k&ޣ"MP0:FbŠO ԤP#WFCl8QK2j[bԲēɒ%'K?_.;$䈏q>R2𗭅6tI1"P$L[Rh0+8ZpQvCCǃQh5q!ߵp&䍞&R)z"4"L͡c>&ZxGAb ́#$)-$%= Ӡl 3h-p(hn,8_?cL[ߙyZB˨ 3v!cb8Yrd~ cCh!y-X<ɵ+Ar~K- B ӫTӫb[K` E:@V/3{x<?xwws; 6{rYs\p_j5\]/4"?ﴗ&Ϗ d{&_wrfy7”ܾ5o|kyj߉Eĸ_w}g(WJq%9sM{ պpv=hxsUw e^z¬u}>ww;qbq= nhoL@N=`DŻm(}߸?Wz4w{w+’+2](z% 8̏Y?E k}yv yۣ#qg}35ۑlk=6cƫ>byEWbbiAzv~cDVϲ}+OCWސ/fZ3ec@JRI+4ZLE^b)\ bǛF ei`p[#D@;|pV\Hw8Jvm$x{PqɯnnZt.cyn@`d>Q(+ #yˡ :]͏+PMJǀ5o@~9&f*W䗅LiQ~3-JbE̴螐{0"\L x'fZ^03-FL4 pLb*9vf:U5LQ3Ӣ2S] ە@ffʀT@nac(rf:p#3t7?+YQ8GaEY8^(jW[\1 d*U-Rm)Ypt%uFK%+( :=X KXm(3BwgE,(?E%SqzQtO"=XD`(b/E#weErh}"b**,b"jEgEKeYAX*+(ӳ,B{Mƫ1"'aE]=ENְ XDY " e(E8"pXZ `v+QYDE3F7bF:c)X-(F#:=Τ\4yhw᝞iD=(ET4hF҈tQ+hDD# ]iD(\iD)2`ܮB#& _YhD1jQtX!kF`b҈"9=L#x F#0$4⑇n;;(F c¶҈(F 8Z(jE#*yڭChD1FXsF)D^fze g4V-m`ܟ:nIvIi kޝ#ИSLEciL=!)J1EN4`SܕiƠT*4f"jИ1ET`bҘWfz3н(+@ev1E1(r3p3ѻy8154e:Sc¶ӘEi 1ܫ5V4"'ȞT@\^W|)uzr2ujp\$ @Ӱh*1q2*%2pJ 4G*Oif?B>ik9.54^:;iD46?Q&G\r*fبrS$+WEqu.*'*8TKr˭A N\bڑ@cXiDZ"mQ FpwVMbowe0<*Qlg40Zms !^RJ* f^wU FUU\]k*̯uQAwO PKČD5ypRtiab/2/testnet3/peers.dat EPsvSJ"EٍO `L2 I^ 8KP2,2y po7GBTU+k=4n3 ȋMQ5KceO)sDPKRD߂itiab/2/testnet3/server.certT0@B=`C3G(@x|}[hF2rbm#7,D)^/ 7*_*/̟2_/h JQxi+؞܄-We&/,b't|TݞcΈ,r|OܣGȜ6dsnl`ot;J:uvݱ se)xJ&@3*~b{_^$H(yH]Ӑ؋2k̔qHA7&>ѥ3zCM]_fEvy.{w:-=Zlor^3-M2|R5w;,Hzُ^r,b2"GHNd)#u'ScX}آ FHE%0wvp2}:-׆6@I+GrF2rC oa!ȓ(7-5q 3> A`FÁm&ڔK5[oCcCs'C;!OÕ\vߣ!+ d{&c3֌8R yH'+CGa~ 7pWp}5/gu_6CI}}7@7e K t3,S >o'pfRvJʋZkdSWE`%t~2;>>3߅,#PKRD--tiab/2/testnet3/server.pemm7PD{NH%|r;rYwmv^/,/g\GHe~daT< khe&:#QcD=: U;#*1b)N99ux}^Ώ.AI|Г"C? bYrHGX~ksp ^2jcq%- H]ʗw7ޯ{&Kj)|bkHvjz"d{=`q;:j z2{D1f ki9S)UH}A>{3( F-sͰG60ɘ#.W&z!kU:xAjE\hR;Q4öz`|y\7xg/ r%ɖS{co Oh2S\*GW@>Œ, LV"ccຬ%~*#A5;Co2澥(rRjw7p~y |[ι}* ^KǰE ?#/Bע@Br;VdŌꄏlսW3t>6Czǃ*JiḜ%,ƮI^vm @MٽkrNh K/݋{}> 'TC:ZԞClj[nwvrhl+@v?P^i*~v,~ (߮ue\,&ï/nMP._+_zq( ⥵?8QẊmBbܺ٬- 9wuJN`TiGL^Z I!dG@7e8B؃) vBpeZ+% YtYd1] 4k6'Ip(V Ci[f^j@ ['-hd/ |%h]`7YGӍɂI{L[e+VqmB[xeWHJ}?i۪]~?FH=~Z"ߧ벇grq3UH<*4K,l+ ߚ Iw+3 zdQn"#nfYP=/>^i;,bo $V's'gg5kqHq~m"aZfo(Kup]DS>>/_*O[adxPqK0yfoe G nn,ڑ 5PKÄD:G*tiab/2/testnet3/wallet.dat] 8U>yyVP!sy8SR!d&KyJep޺?vts^qkw{׷0Bh  pokQMpr|_>N$@ $@ $@ $@ $@ $@ $@ $@ h v?H H H H H H H Hv@ECM6n'!?  Af + rL*6syހ 3$;e@)A{O@)I;-AdH H H H H H H  ?C@5 U1 VC %#$;;>EKEKK@>?ICG{Dʊ~k ӘĜlV&ʊ9$@/w݉9M GJL#NBXE n`$ $*JJ|~:!;$dlla!̃L|! 3?\@tgMwniu5al_}ے~dF{*0\SH` g)}E]@]XSY`8j* FC}H =>Tet( lu"o39JUHySoH- m]6'?l dk}bULR3a_N=#U]h&Y$)*9e>y{79ҹItiĀ_JxD_Qp,M\A`0=[HTI1`Ͽ:NC\=yu+w`g5tYUc DُKh-A@x*tRL(p#W:Eģ_c.svQav_}w !{ՆB%ܙ-=!Eq 2WwmB]y1+J&? :* @exV[m V>N3k $ r-oR$ȶW78&JxI99(̠#57+NhXy9nO} y,}퓚?׃^z}lѸcEE3Svn&=EgCǚenQi:dZds5 $POVG[p{F^q0F喕.jR$~ձ'Z@֗I]KhhI^ľC7⿂1?V8?Ѫ(g(Fg9U~ɛ˓"< +4GUeؿ(/;v(#׹nX~U㪾b!o;:XOͺ0hu9kɑ*(>ۗEuV۟hu h{rEu!xꂿio{Cx=U¥|&VҠ ԁ|ϟXs'zOE1 qO7w/\ 嘒|k v6믛[iu,O[w<8-/|k#6}UMcO:V}CgT{60W Z*<gD3A`,SM% h`bew?k#l%sBQSB䄘%s .. L_P35( s;:NUM3̄r-Owu9G-vRE<Ke8 09p8lV U:σIWPBڕ,xe'q4`9D8 Vq'΋ IgVqx]0͑H~l~uY8foqx,}fX3٣]ˀڶ>[-:y0SUo#J_3z!VksmV(s*|Ag|?pLxXIwlJ2}d_-=7шڧ-6oqX •B{wEbєʸͅ'ԯ |۬* )0 #C!V|'{4 R_[ϖ¤JIȉ>hD(2f{{}zjKR&𲬈1fSkKa]JcW&vkx$L.TU`eO QiB yZ-NM&5ib977$xE]xtvPk'-G|hB,8y!)=_8<~|5t(f*N}^X6^ AUzI`hrJx܆%݋!hrf"tfΝҟ;t m@+I8F2k߷l]0$ D sLO}^HَetΦt8PX=vmp^PsmrYh$$){|j"~Lco>F,9!lah'ucۀI"ۯ~0L [`69s5J'I[ X UKRFWC3:'t8_SNyOvyis#綗pEɃHȤ, u Kd>qOL([m1VZIg|9T}q-% L\Z\}g {'F^`RBxBpI֓E\aoJH2QÝ.C*l=h 2s?K)fDpWYSKtYB7B]NE-:wdFŤk 7oXu<]"5TM#F`'FxoulvR g>pii9ANJ96ZЩ@7۩9BkC.Adp]D~ސ wjc7^6|Xch|/M[gFa7J]a0'UNK F]m$ 5pN0O,3T]rDs;CwUh`{TÉ[Ju8oq Y%uzɿNY7r5 N0QdЄ(]C%vw˃΋KYp|E0mQОk>cʖ޿Q1֬U038.&!Mt}c_L%ɪt396`lnߵw4휞Xy}Eew -@`AQ|3elɟCSrx:T@X.9LVmHZ{= )_^3xSuu-'7x-Shw=E.M_~> TXJAJ23?.| DTzbYp!酒J^ b}S;˅[{ן:sN,;^[: U5 '2~`F3\&DqZ'l"Xs9<2*SpM!K0fXby }m (IT|<A?c.4F*+ jTUE멑4q;H8>|q h#Xq\{F :!2 <: :ɥvC*Z5:wXKU\Ef~&ۈט:Nȑ[9aY0u\rX-ԤD0~I N0ۭT2}nm%4`eREq;Ck?++-d~奴TO/LM$e-vU:C/y5i'3Fp=q 18aQV,BqF꡶7(!8dG^̤{'7V99\y:&Y~ST}8 t`T<08ǰPM?t*ZGra,  I5D. ?w < ^0\?b w;{q.T[ƻ^=$.EF^7k#xB,b'7%r0 Jyu|E2W%^JM-}՚ Mmwx7 pi?\EkjjRUI,f PR;+4Z 0%ļSM)'wf n=FË&n2!`}Py϶${+MNN5J%Jﴴ1CdjSWܵ<PX0홓} 6 9y 8}y^E1iі\0b8t#hK$GɈWJ$ #k7'~' |sa|,AK$z .C3w)5pL<^WpgmW{ rV]/^xKLxtϐ[10 *9}~а41>rq'[qKaY܊}\(|%WպP72x!57́:^rxLȹǛ=^N/2OxyR =oÿv??_K 9Z\fr A'C/c`Qx44ԧdq17T0STTSE0JcJ^JZ)^ X cAG;x긂#i0rcrArFE`~Y̘Llt4FjL*HHH2BR@F҂W#1&$a$ "X$#%n'!%T&d$$$2f KO x!/<_^y] j.[([:᳽~"d< ~h`TZr3ă4gm~{= O >@l5h&\`,eM4 Vl&;Ktԣ(ގv9ș95b8SD-$߉#qº #ֈ.CϽz여#sB.AϹpͳگ 9r'OG3w|LƲL, ,8dzj#KvZ)q!QG psFĀ\h1Φ{jVBkē{8r)wx3/bwQf{+;M RyU)]OBS֡#IGn;l'L[J2VBoɼqp$?s%y,@-IS-^o#v4 ՗dQͻ>*pmWlD?7xGCe ^tJ"~|wK!4L~R/Ĕ!Ed#TTd8Q>DDo!Z~۳Q*Gs.×q6+ebQgГm7vY7~dbzj[o iK>F'4x@YRt=D('2إgW.0vUARJx^` k7ۆA(ԎJ|JX7fL‹7mҺ> WÀƴ{mY4}z:Ean>|?y,Ee12n[cРX4YoeAm  N0a>S{uNz5=҃69J*/9 e<YEsfUu|ZAnY"=,?<c"$Ka.Ͱɓ *^vBT2~:bI6#5W֍YofR*O}wx$X#I kd~j#Xg84b/{#+twwuZ  tV^r ^R JSN]aT`T++niRx–!^eW }{QOh۟Kl&<w`Y{Т["#re;d;hkhcmlL9XlwEu(.Nn:"ڢ m̜f!޽z3Ia~փhG=D8'"=mJe7'IL%47Gҳ!b}|TXSN]QUGBVL!5l(v{]~&qnn\L}^UlUBϋ,4<ݕևK?14r}_f[uxYԅ$Z6%3ʔW =_]-`N (0s\3L\0'(ajos0cȟ ۷K2;ytrjYƛS2^*(yqZ˦|qJ|n@m8A7r-\<~Xn:b\B0щUSө:/ORi:w%%(`t.)C8 F߻[2ݺZp84 O.yc&v.m AP9ɃSɝeyÂ:v0 qM֡iQވ#KW*uY3RkͶ}rh4}ozDgʂf#pX[C?P/6%Et)sHcFQO=宽Ǔ!Y2]CA8n~˂8wB-ZAe)H-x{ДN9aOȸȭ%:z4IfF~g%kb-iܰQ{v {a7(Jaҙ =d\mLQQ5kҠ5s%Alzb\(r{Ź10KP!dNwikWSh1:s~Փ  !:bbL-bs<[,=!L"%OHCƼr"r5tB-<qO_5r:Ո%9Lb%y)1fUepUR{r n%i? mΐs7 s5z ռ2x3fT 7YYxH  T^6iNt#L(8D0a™ f IBM2'JID&L^|lQKWnzRF.sO9!lL_I}AaG<{cCŵnhyYp{uQY12IKͯǿ$39OvbEv|c4Pn $eۺh'-q4Ny T{6sr̬>zrPІӓOLn-J?{J0Zt-B\1/Cٛ#a.3^Ze6;\hҰ~Cvo sʯX>}hM+ӟhut}—Z}[ 1~_":`.(?[gxr[;\:X;:9P$s?{"u'tG=Z6z3{2 "= 5b@zP?b9ժLmLҸnvc­1X".PODMm#gNU=(O`\_2$amzKMb̿L5qP.aj$괲$5g 1L|r<Ѫo |HKq2r M#lԘ,%WB2< ,aNT1ϔU;N?>2񞰍&7!Q]q< $3_/>G3x7&{P \ttN cxrkO7K.nө{jW`A+ §{>H :~I&M'd)iK }TtP>h|KF9L|] sSXP߃u~4q5i5@?(/:W|N௮u _]WWZxѯClҚ'֡OX?FbNbbrM\{xkO"on8r \xKPKRD tiab/armory/PKDkBtiab/armory/ArmorySettings.txtWr0}L/bCg BHig5Bߵ%6fAr2"'q~LHՔ09<[V{.irR (TmN+IS ~ъ% aEI~3#f$0Bb^dfhZaw/AW؝\ e4[w7 ű!b# 4(ճ՗$.n=wDZw rx⡌J;͈!|JdWRvIs}/@H> '?Gd0}ݞ} w[,r.Oyw*:&rO˽?wd|Ee#c.ng, F+U[Ǧ.C^Qq*ǜ ~*Vi/7}st.駯>ڍ E'zw&%aɸu>0)//IJ7Pr8QhKc @L$훟*_`+ib"Gc- QIKAbPn[$ǐ]*. OI3ߛ@PZP|+)"|' ʁwVڳDaQ=2_ KȕC_!$Sl\42,5zCiHx_,y?QNUyй%;\MO,,h2s5R5QRZGHVX=uZv @'Ń4Zܥ-P{S [H-r!x;PNZl;=kyy3YPɤZaˑmș.KOpsw%0j;ЮS"22W Jw}!! QlvcYkE^52YRVy?v4\gDyE^9c,m Tdw& Zp66FIs{ۤ_8?ՁZ{<]:}e+¢kʐG)86&ww75q,W$Ѹ gd !S.J,G;8qZ-1Ipbl5zIke[2&ܒl:{kz!@S|4 AXC6pe[. O5 (YF݉VyF*;Q?H"o+sqS=SU%6s{$W 5'HSQA !;3Dp+ :y _n;6F[HIOa36Z:v3Cqru<*|wNtHH4 ^=vek#t nS VJw) ͙sJ 5$5UEW2[1 OgDcO=IQ*C͹҇J3+տF-\dn84ZނI=٨ xlo3 4e/$rU)Z Fw$]}Z^r 1Y Q4%g`:cD.jehCWu5Ev7^y`( zS%M YSGґmWKd2+.T-e~.X4!#1 0JyO"bbP:=}=j 'Q.t2UvCcUMvFge?-ؠ:ЭWosgKO<>sx\1W)/Uq猩g/H'319Adx2JuS󁗖i|=hͳq]7t-]OSz$$ea>F6;:tUkn_ I7[2y,z5AMSiR+v]8=oƺ; c i/jnÅhkh֍t hd e0a'vW 6ާ`#hE9 L pMe)4/vLw:ߖ! @`Ҿ:ʾfc *]@Ft qP|TƋL> lv0o*h}XP*rH&wlĥ4DJ5-7)l$o9҆t^A EILP{58#V-y#\,u9bnO a7͜*H/kEX6+&Gn=~aSo'عAfaLxC PKЄDf( W)tiab/armory/armory_DZMmtb2v_backup.walleti8T{p˱!APdp/2Ե],%#IFD'׾4$k5e0w;cys|ߜ2&ܒl:{kz!@S|4 AXC6pe[. O5 (YF݉VyF*;Q?H"o+sqS=SU%6s{$W 5'HSQA !;3Dp+ :y _n;6F[HIOa36Z:v3Cqru<*|wNtHH4 ^=vek#t nS VJw) ͙sJ 5$5UEW2[1 OgDcO=IQ*C͹҇J3+տF-\dn84ZނI=٨ xlo3 4e/$rU)Z Fw$]}Z^r 1Y Q4%g`:cD.jehCWu5Ev7^y`( zS%M YSGґmWKd2+.T-e~.X4!#1 0JyO"bbP:=}=j 'Q.t2UvCcUMvFge?-ؠ:ЭWosgKO<>sx\1W)/Uq猩g/H'319Adx2JuS󁗖i|=hͳq]7t-]OSz$$ea>F6;:tUkn_ I7[2y,z5AMSiR+v]8=oƺ; c i/jnÅhkh֍t hd e0a'vW 6ާ`#hE9 L pMe)4/vLw:ߖ! @`Ҿ:ʾfc *]@Ft qP|TƋL> lv0o*h}XP*rH&wlĥ4DJ5-7)l$o9҆t^A EILP{58#V-y#\,u9bnO a7͜*H/kEX6+&Gn=~aSo'عAfaLxC PKyDh!t&tiab/armory/armory_Ev9L4wAd_.signed.tx@EsA!ayBdU "7e.:=ox*PQH8& asD ?V a8T:h<ʊvAe0DGWv HWW&* (lsSQa5qs0Dv5gP fd!c+"J/+KD؅&sT0kZ8Ř՗ IYS4WBRZ y.]󭥲,/1݈BB7|@b`eX1Ef!4آ<1B+W!7#qinvc̕v`r.8}6М5pA~tOW{>nH_pF8]zL*~#ydr)q5n/x4F/I=\z|NVJ$[VCu+}j=J;McGST.nRG=?3^[U ,pG 1&~O /b|#c62WkPKyDݷ-P(tiab/armory/armory_EyUJNfMQ_.unsigned.txMc@K9$^TII ;!! Oϙgu}iea{<)|ѹRϑi~?嚰U@6}>p>@>+ qh.wW|I餫(lپ@`;m-}}'E$0k;! sxS=9 v`x]itNa2^# F 'eC*gMGJ-d;(Js7^v> Ӳ? mSEQCG[ WR k،=MS3[(({ Bq]XfW16on-i[[y'c}Y~41:SG+7z/zT`g2R^j)vS3m-Q6vuƩbZcxN:*S%Ou3!\o ƒ4`D7݆QQĊE +*Z"#[}}w{4KtH,H.>errw2ϛc&u9_|qH+x? PKЄD)z #tiab/armory/armory_GDHFnMQ2_.walletwPg?fBE2+ (2ق%{-{ C%2doQ(A CPFb{煖{yr{߼VGu$xjۅB)ꞃؿ .^El%=MR)y\j`%J*C؂U)Ǘb }dSFcu= [`NYAas=*h@v`stvff\~મ!}* y鱘'ǀVR!)q#H<ûÄi%:m:X~;s0,lGZˏ+rmX'{]zRX]a& 3,2NEȶq X׌vݟ秕 q6Zp Ҹd rxk# Ċjǽf[4cs i3߷;5m:3t,tq MO( E&lhMb .5 `A 1=d$͟<̖V'sp:}={iokhn R*JXL>V۩ q;V!eS ֶلˊ {q=L]Ϯ6f{Xʿ?{Qۄ[X'Q O![2sK: `AIJ1.zT$o++bb,hn]t~sI)64XmNnÈL-8iZB%Ji54WJe{_;Y G7WZ~=W eŠ| ;gA6:2'ȜGb<칱`tYA8g-Ɂ?I, Qqn ψczx#I {[V߮9xHvϣ -eS(ݾ왧9oKٯG@,dD^prZ#_@k5lm}d6_jmFrFQ Aȿ[Uf3oaIY!5z|9u@v_&:WιHG\G400e^'#t݋FJ\)xɿb 5*h0f$KL zs~&]T QDB;5:?,]u,Q5鴡v y,[<g;?Lh3;Y+E4¸o 2/ͨJ~Ɗ[Pa2zWڷO_J5W|"Gs)U*VTt[5L |hNaYv5S}"gHqk#v,n`u~ fIc/M4C$}$> Xj ގzʎ056u@mWͭaĮ8YE…+e΂`*@pwc}"5~-0EM8Ad. `ujHp]ŢGB+oʩ 6jpM}tޚλiG_e(tY/ǹvEpަe46IK{_Xnw/$J=}2#Ok Ph%+FL@*F f^ʓEĤJy⅄>Mb0LVHfsJLy5$qQSa=R΋%ZS[LO[G)A_XeU5[ );vH7Nq\ϫ/|q¯2n9s4C)k6Rv>z/l_ueAQ}#"/+:A+%PrSvI]4(({c꣦JFc*p $Mo1kV U_#93 ~TP5KiVyjuoָǹ iq89n@0%+^ ¾\6kbc"64,t7`r6̄Ę^Gzq&\290ZΠ8oLڏ$ 0t*Ny[;3\X @w+uӉ<i&Lף?l7S1Q97DvXC4~"+l+q|ziZWF m` PC 2jAk:p#+sH SuwQH_g.CY{Ӗ^ "~xrcVeFZ ( g_t"׷X\(u.;U 4 tv =Tq1">9hBY @c lGMRW㹄C`Ek0g6#*\QCA~9V/Bʃ_tEqc&˟ȬȪO=*ZZZw_KkX}e!UfF @@<7orUV^].`buC#00R\BsS:t(U#ˎ3 A}3w'{{]$}ǂKb:/{7ڼy".@\7n\U¿ dk0@mok _WC9LpwBTm ɩ;-@W)76yѡx.X"/ނ6 Hal05 $ET+Uݽ.3va a׬JowzyCnZ(\o'k*NB4*UX7|^&]r-;\{ Q g5g->c-BtltP޳ȖHk^˼Р,r*/+icr GHQXo{#.tCLHВ 1:,+QBLZ(Gv5%K,yxB *$ltnn%53w]½~KP1{=ͯzk- ĚtcRS8M |~okǦ(]fV۩ q;V!eS ֶلˊ {q=L]Ϯ6f{Xʿ?{Qۄ[X'Q O![2sK: `AIJ1.zT$o++bb,hn]t~sI)64XmNnÈL-8iZB%Ji54WJe{_;Y G7WZ~=W eŠ| ;gA6:2'ȜGb<칱`tYA8g-Ɂ?I, Qqn ψczx#I {[V߮9xHvϣ -eS(ݾ왧9oKٯG@,dD^prZ#_@k5lm}d6_jmFrFQ Aȿ[Uf3oaIY!5z|9u@v_&:WιHG\G400e^'#t݋FJ\)xɿb 5*h0f$KL zs~&]T QDB;5:?,]u,Q5鴡v y,[<g;?Lh3;Y+E4¸o 2/ͨJ~Ɗ[Pa2zWڷO_J5W|"Gs)U*VTt[5L |hNaYv5S}"gHqk#v,n`u~ fIc/M4C$}$> Xj ގzʎ056u@mWͭaĮ8YE…+e΂`*@pwc}"5~-0EM8Ad. `ujHp]ŢGB+oʩ 6jpM}tޚλiG_e(tY/ǹvEpަe46IK{_Xnw/$J=}2#Ok Ph%+FL@*F f^ʓEĤJy⅄>Mb0LVHfsJLy5$qQSa=R΋%ZS[LO[G)A_XeU5[ );vH7Nq\ϫ/|q¯2n9s4C)k6Rv>z/l_ueAQ}#"/+:A+%PrSvI]4(({c꣦JFc*p $Mo1kV U_#93 ~TP5KiVyjuoָǹ iq89n@0%+^ ¾\6kbc"64,t7`r6̄Ę^Gzq&\290ZΠ8oLڏ$ 0t*Ny[;3\X @w+uӉ<i&Lף?l7S1Q97DvXC4~"+l+q|ziZWF m` PC 2jAk:p#+sH SuwQH_g.CY{Ӗ^ "~xrcVeFZ ( g_t"׷X\(u.;U 4 tv =Tq1">9hBY @c lGMRW㹄C`Ek0g6#*\QCA~9V/Bʃ_tEqc&˟ȬȪO=*ZZZw_KkX}e!UfF @@<7orUV^].`buC#00R\BsS:t(U#ˎ3 A}3w'{{]$}ǂKb:/{7ڼy".@\7n\U¿ dk0@mok _WC9LpwBTm ɩ;-@W)76yѡx.X"/ނ6 Hal05 $ET+Uݽ.3va a׬JowzyCnZ(\o'k*NB4*UX7|^&]r-;\{ Q g5g->c-BtltP޳ȖHk^˼Р,r*/+icr GHQXo{#.tCLHВ 1:,+QBLZ(Gv5%K,yxB *$ltnn%53w]½~KP1{=ͯzk- ĚtcRS8M |~okǦ(]fc UdshʋN$-x24_X9n"h^u1_dH=dwg=.(j̡|6Ԩ 2!Ṅ{~N;4W*x/oV6w,F 39o0ۧvc{nʢޛl?\!s8BgrP͌HdM 8{9D "S lysC  o7(KƾNFA k%٠5Ժ9[Y8wg;'H[?Zݑ3`ڇ@E$t4R%)3 &'\4ݼD˚DHO>vl(&UwLR1 j)zj8A0;d5ѳxB$gշu/y*8x=ӭB9״]h }4Y TntQyv?̆$tbĪ‚ !aCvYg'qw'Q XYM7u5 ! + 0BMJ_`r4D>ئaqr mz\%hO yWFb=͛mMcԐ\^#G 9udz(yPd)tM؍p:k+4ŜO9?zV|9^>-"wt66?<8Q2;{O 6ܚITȎ!(A75ŝbb  nſV4/O>"‚agP~2 }6UDH"'ڦQR[ZZ:^> Ux;l4k'gxqJmjݐM[@+5i0!c&:ӭG>x4O*Ws4zaEzWQ{ d+  SK:=_&.^}oPGU(XqUVJX9^}| 4#UN')DT!_ ,ÏԭN3oeM9rNبb`ݔ~&S ES.Gouhwz>z*{ܐuO.iuHat )]xԅ$8 ') )@KM?;N 59ͥ %B;GCsO x7f,q AoFH,ys-܅/>iq4Skp9;C6gE~}aA; u\ P쀢;g : Luo丮T"#:9Ռf凗_Um\r`)cYPMNGD^PKЄD~ Y)tiab/armory/armory_vzgEfJrJ_backup.wallety8yqȵ;5n\rL4d+䊐3 )E(1a8rJ:V&3n)^<=cny|_:{ cpr |i7N[KP8#r;  } :|n_oُhn8>c UdshʋN$-x24_X9n"h^u1_dH=dwg=.(j̡|6Ԩ 2!Ṅ{~N;4W*x/oV6w,F 39o0ۧvc{nʢޛl?\!s8BgrP͌HdM 8{9D "S lysC  o7(KƾNFA k%٠5Ժ9[Y8wg;'H[?Zݑ3`ڇ@E$t4R%)3 &'\4ݼD˚DHO>vl(&UwLR1 j)zj8A0;d5ѳxB$gշu/y*8x=ӭB9״]h }4Y TntQyv?̆$tbĪ‚ !aCvYg'qw'Q XYM7u5 ! + 0BMJ_`r4D>ئaqr mz\%hO yWFb=͛mMcԐ\^#G 9udz(yPd)tM؍p:k+4ŜO9?zV|9^>-"wt66?<8Q2;{O 6ܚITȎ!(A75ŝbb  nſV4/O>"‚agP~2 }6UDH"'ڦQR[ZZ:^> Ux;l4k'gxqJmjݐM[@+5i0!c&:ӭG>x4O*Ws4zaEzWQ{ d+  SK:=_&.^}oPGU(XqUVJX9^}| 4#UN')DT!_ ,ÏԭN3oeM9rNبb`ݔ~&S ES.Gouhwz>z*{ܐuO.iuHat )]xԅ$8 ') )@KM?;N 59ͥ %B;GCsO x7f,q AoFH,ys-܅/>iq4Skp9;C6gE~}aA; u\ P쀢;g : Luo丮T"#:9Ռf凗_Um\r`)cYPMNGD^PKRDtiab/armory/atisignedannounce/PKЌDc+tiab/armory/atisignedannounce/announce.filen1_v, P.iI )o0#ƔVב9>ojw{Qz]Z"{PJ5pB潰&_` /Xatآ1N8}o;[2Lx^"on_zq"|@bXt^Lw4tWՃ9LW%lծ5TvtYA(퓁$Y2B$5A1K8%zBӪs!y޸ƃq[yayp/qXٶSs8ťO7&Ҿ)˹]O卤g;#&Q~1Aj>=xǮ>Л-82abIq",y-vrMN_77;N iuR;jr۸PS6.TEʓ3Y:~q> |Uٕ{Oϕ mSov-QH) vr1RLJRg.S aV(!=oxS3䔎R9Lؔ(Ѫ%cyYٷrovp&Q7#2jU'yRP@SR]ʧ)'bɺX$YuV R4Ras3T#8$\`agf+fmF}G$ ;.IS؎NJz=gvWed'XuɸCq[%b)L9~\9mGnIA$@!V)ɖ*(\~ !4BT(YIlSDDG NնF6>1RHbj[};୹PE"ZW9.]K95gW)&ЈŅҒ 4ʩʼwBT5(va}ò@S{kPdݹ&|@d#E!VT8=!g.AJ@&IZ톈r /HNb(5l#TVDDQf O(,GUᇢ؆ cŧ'sjqw=àߑoPrdMTlG # WƾTgMMrRET$Œ:eȜ]#iɚCf k&dS{zwҖv%X ʢZuh6 Gʏ#>7$1gf:"n*lg<+(5<4̴"hh8`(/PM+l;/v9|VRL6U:l~܁gԅnYc u #e(YԐIFIWQ>XW֪֦!k6]LuxaVf|؍ٟɣPd&BnO|')z qOAJ ieluk'l[Hpq섷Xv"_WQ7ob͕8H*\K( 22}j> ,\aoPXȋ|%Ԝp,O1{qEko|zށ:n`0G|,ß1)˛/glc6,8>t"DL=9>>2c3 N$>h}; 4 PBOlZQ,'rM2{Xofɵ[hTNds=˼O+y##M5|M. ؙ 17 24 gnNΙHRK>v˻'G+#_X:MhǙrm[o#^/Đ7bMv-nGxrhr,(# 2+|%CF =eV2P1#(׬VP Qg[67HP۱.bӵk6 qt;C^.&mqA6U;R$ unD$S1yھ_߷L Q TZBƀbhyKBu;)" IfE@>\UBJYAy6^h6Q(!yhכGPwgߝ:Jq^$ӶT *(pt -Bd#fCL%|K(BZoJn/1^?*T @M[tj='&Hsgց=.vI' .yiiVO5 YD=#Qݑ1@wS TA@Wx8cp(e=diosԭbԔRACBH S?]RS*dQR() 9Mrq> `l0Oֻa3lfgK5iRnPO_K/ŬAT[M?dU [sRC!X2$%z˯ :ß~2Vqfa 丿ý+ .ȳcbUJQ:EFTpVLRW:gK| w֭X4L ,&n:j {f(&ȮLy߱jߧtO%>8ކ8ΗCX{Ćy&a鍔`( ANgE>YfMz j3VF5!,-Eb-/5h!J3MB4޵[l}0?(+˅":JLb>`5FX";Hϛm2¶ I}<_C6-4TlC<ؑ}q4ܑp<2^L]ݞܝPWIw_ʓίpT ݇NL(nj$ -K @PX͍tD /G\@4?:SB֧q ́מ؄hh3^f4?>H u t}#%ArI ܋IvNTMٻbRMP*5^TuHq7]c]hY)I%]s!%3Bιr+,5?}:֤%i]m܄^ʞl#,$4Ь٩#HY9|Md',]OQ$~T)t>2st'!Gyx{*dhܓukuyGSzmd6X &N5k!87L T*2DRjj&s/@(ןP z0 ųr,)';gJM|Hk)Vqnn8N`uЈO}zDއpR>!wi@b&*utWb6kwJ[hkS2'gxXw2'>!/ K]M,֮t6cY ~aZa8c/>+ =m0Xa*v>:XDbuq%^e4s`cǻA0K; #8ƓjO8μ~< C,`mbY=q2=ɷ}Dd@[/,P )#>h(y: "}d3PB صd a|C ~><n(RpB K3F {+l>f)3R盙J7Je(hee~̾ryߓF"n`[JN[tZ h4 2¤%]?h:>[/m8}7au>5=-""v@ЀpT=yL/bZ~- 3L#b윇]G8^\o[G%$7m&sϾX ;7o@14 Q 7~s1YJ9^6d 3Ҫ*BKt;yU̚.R6N~(4DeP2< »wb0Dc @[DI)56ep"oyh%Q['E7 Ν.C=V($Y]M4/mݏyXݔ`t#w7IB"t886A2FF:ĄKߛ>)DeNNYԤ9dCl; *^r|Wk;lX^iP=~b8'zlcV*$OgI^#$1#ajy`9ְDU  Hx=ޝW8C:*.mg%5q4|i)n7rN;5opG/ ֡Ҹ?::aZS"Rk]q[XI)pPn1w nxj; d~'54- UȚ\ oAMUC\>8ē{WǀyYc?݄k;{s]nw7AOJ1C EJ==>vma:p9)nq4׽}|dto='wn_A~"((8lIu򛷶Go}Tړ_..,.߿pu]<ŭߺodն8n|K/~;)'WOPK2cDm,tiab/armory/atisignedannounce/downloads.fileY[OG}`J}HZiDj0|6rQCd>2gnx}pֳíݟ֣g?ndyfӻ?<HHٕ(Y=NgNPApZsRE5jvøQ|FpHgxxPwoB"X_9;eQ4hGnXSlQd|ZPs.qS `d =h]쐮a/E/ 2暽VcFYcTDs$K#ٛb|^ӠkU88>8tcqOցSKAC TŁ,r 1B,7Gb( v9H*CZ2q<>@F;N\]lRpa &0tk/LCSO.ZqiqiύXzE]vB ]pFh#+r C%kE0Ȁc V[ 2ýze[SǶbЫ;T4/&'NDdE "r|zlLDp|]񮪠W&zXz̃jj)jUMx`aaNCt\(& $3%" L¸?s >b͹gcr>3}p$VQأS$ s4Tc' `d8U )AA E\A9 5l 0.ǢFUԘfr܃,KZ.]-GEUt.k3nQ,,^*!֡;Fږ-IFK. : jY3zwd`?!3 ,u @JP"^ԅ>elw UD w\Ӈe!ͷĜ+=+3ICv"*'(0,MB 5!>$raQ] D4w'(VBTG rX)4d%A=%4e2MHmX2j$L밷*Ds0` 0&1b/BfB|رB^09)T $0h +, Vس$p:FȷI x>G$%) SoEqF}vU~LlX`/DۡTS]Аb-\}+D0=c) E[M*V'3G[PХIv=h1zRCf #5*V|ZZX~jKy-ڠÑCA4A _lx`s=C 8Dc?oUxz%-6_A8(m ;ul.NΑaGO7Q$/>oysg<{mbﻳԞĿ^{B[ovm?ý_'~MO6_~G'SK6;PK3cDQU)tiab/armory/atisignedannounce/notify.fileT]o0}G?\qI&j'M{p`3ۤ@7i4@J|>s/~f #pKX$ %B5f /a7UKd2g{F- /9===p ^qk2wK:I޾8/YX_:2xvَ?^'?uy۴rAjbli9Ͼ![Jr_zf/nŰE0zo ץ|+Ip9Ecyhv'r=ө569Q\]J%Ha+iK4ЎA1i sM`3deQ%!"8d'}t=z5Ir/f딵%05We#2ʄm0t8ոC_HjN~:X 7c {$ xr4@[%<[oߵT_;?`aTem G0\b:q|Rm%/4dwQ8PPĢU2rM∉IXO}+/wR|@I;sela9BWr_ 9z 3.A7#x+^r\bS|ϘSRt?wy)^Fn#Q e3OPKAjD9Av*tiab/armory/Contrib_4f71oDhA_1BTC.promnoteK0VK)t  Ѐ𔝀4_?3ou='ɹo 'l[QrY/,)?uaV!P#soNMsD2H`wr+o)_(*U,-s?ӫ]轮2nuүARX ",L*˖qՌzFӧ87mАHK׭Jh5Bj!;W, NpI֎B!GBR࢞ns!9:SNYsl^1~AΠ $P`LJTiC+.n{ ! ֜v:#"iћAR&Ԍf|A m>u]x(VVdPe9`ː,dv+^+HnleOWCGr0٧fYD_ zLnIݱy gwN GxZ{ 9FDVSjJ2죘Z'FAnLhRRkmtRX]?{OQ\&?^PK-kDL=r*tiab/armory/Contrib_J75shT7q_1BTC.promnoteKӚ0K"$ .;|__NI&y=?gL8mXG~,7ǗAm9EMU2W!z,K/"P 'ſ*aR./dM5gZH]VLT_mb.G8`XuI1+Sb1_JQ_!7cq{VXa Jj k@Y _- on$iՙ]Dac% fL68g.Ԗ ޢ5mFTpZd#vm+ Ur<>lIcAؕ'f/fh~:Pu] 8Uy)-,V4I5R1ud6뱩-f,tT*V覷gF CvZ,֢OΰHm>>A^zr2x̊r=2h(`^ rb"c/v dt6{m:oϜWΓ~NXaN?\PKQDtiab/armory/databases/PKQD&tiab/armory/databases/leveldb_blkdata/PK%SD0tiab/armory/databases/leveldb_blkdata/000003.logTpADE@E@@B%T BQBCEPAF$DE@ޛ7ygw9ܟ3;= %3$" #*ax]<;ra96Ww9̵bb|1d$>0{"_:ſN0Ľvk4)a2*+W?X?R ߂\4N|JAn#IwZDbg5 'Q<!8ᩝ`0rGeKT5D?5!̳ d1v:u~gRXﴥWuOSdžd qS?IbHzMəѭQ}h_;Ċl7b^pM|J,AIb$1(+Ig1FIb J.tծɌ;E7~+}d6&IX{q/-Ǵ,坥n1$ $G}ÖUCyaʣvO^VVɶeKa"6(@ I$%q/#(IA}*l}UcT|>+:NN~hO8أ۽&-iXӵ.$)$G=̙ 7-Kٹkʘ6N|=4V?PVC4$H"$IAI\qK±ݤ/I"쿟?z~9Jߧi$7 M9ӧ bbS{=gSHI2Hmq'ӭhn/Hz͟rn}<:(|Eh$d$8%]Ha<¬Uƨ4{F.,8UX\xz겹= $bGTR>(z\.fM ϧi>:R4p)IIQo;gI1ݶrgIuAws,F)kS eRI)kr$9(+I7,&+[EWx˞/돎刈IV?%ɡ)!K.\Sޣ^rh4Y9Rģ냮FXih2'OG:&TBE_+%a6(@ I%q/#(IAװ\FZ k3eI?ʕGa/$$))3{ܯ$9ļKi³ː$<)~iZ<`#̫wWPRF$HR"$)AI\qKz`Y)1mq9 NrW_kzK;٢ԗhДw(\01VmorotEJRAx/lwv饓ʈb@_{vw@I(@ I%q/e9IG+s:Hu:ϠEx.M̜׏$4%SbV?7Bx"%i Iξ99L5 p@v~i9HEh$i4$8%|N`|q#pb.}Ryu[nI@SVH7m+/ZLI/ ^y%-)I IQOR>mZ\IXdq02$2]yL3tؗ|^c`]+C/4&I M. a0ZV:I'e<ۈ))ʀ;HI:HM4 v{ $&e;rAiGO}PbEh$t$8%}a%0HN9={1[JH?_~s'7[3IAS<^3e':eAh3V7D$ $=$G9Kpsxt#sSQeVGJ,XQ$6@!IJ_rIz [K;a喊E\m` )$)u5E7,*jTL:d$OM*lnN+X1%WQK <^fP2R5$H2 $@I\qK(0J2`vO??R./"2 cocF4Ih/Sy%GFynU]U吿d$\e֥icJBv?"MyO@IM7I dDH2 (Ɉac3Rc8Y%J(ʃ8_J*R%T~QX>!jf(3QbwŷT;_ɽd$oV}joni0c=}{ӯ¢AI&|Wn%6@ Kj+oIJ& eC^js,OnPY)knzü qh_o1H̐eHJfzJ32צ F R|ʒT&R>)~yPm%3G%3#%3-!d||)m99Nщ)8%34̃#[i{C-jBuIQQ˔uEIpIawߵ,MT5?)T8jQ(6AR#9 ']~~ݫ);SoU)zx/wģh,И)J'ݭ͜Oq}HJVz].wV[zR+br~9%N 4te(@@Ɋd)q@Ɋ峒eȯos'OŋG/ ޼j:oF N|Sxwz9\4:$%DG}W3mE O$ر{` $mCJ%H+JFJ ;C>K+{?w¾|V`&ÐGxNKD_`9CmS2I QQ/ORyB9nnwb; >;ГM:u) %Pr"(9AJ\qPrbpbܖWq}7Y>Sxq^԰.}M4JNĕϪѱo*(Kixd&Y$%DGӧZ\ Դoz@>_J$4sdೢDJ.%H+J.FJ.LtN2,{xgOXi;2'v?w6GF:coSKٓ[]ړ]:r:q[h(E" %8(E좋`t+; *즙{\6eJ.I/wE1f lH [7|@S*g!d';%0z*xXKP15RX %P"(EAJ\qPh1Rbگ o'=so[=ޓZDC|dpj8?(,:yd E [UGVv%/(7bhu$ѧ>I+dSP&Lz' %P!(@J\qPaEðT65ĕ1,/H9jZ!!twVߋfhbИ깍+dy{, 6HJqPg"_NyW|ZSLk['O9 @J(@@))q@)RRY7R;N,ɪީz_(K݇(š1a׾/p](IV Ib(KSy(E v3r{= G֣wn+kyH2& xB J WXv%0PƵ^33J>m2Zz[+YMh#D5I7ܥ烓JS 쐵~FRJBx vaY29ݤb U%J DPJ1bİ,z}D6Ag*u_플F) ?YuNn+;޵'?n3u6I)QQJVOnŧ |uz}Tq^R,۰h(R %8(KaX*}]6ǐ{h۾I.Us1/NN4J)h ߳ #${ g}/g/fv%BRJCxoΖ1. XnYrUSa|qs_H)rlh( %8(a)1PP)Ҳ %P!(@J\qPaقa| =EJQ'+tg鳓NT#˦[F)-|w2%RHJ&I6-2M#${vW?va@R*@xǯ7Ȉ.e:Zv^)fiGK 4JEh+ᨮwʔ_* )9GPeowwDG}RgǮ~n:˷GZO)Q)Z HP(6R AR#R G% :i]2)Z|jeczոeYhJИz}No]WEo0gA$2DG 4+9E;ЩcשC~M`ʟ9G R;DJe2H+Je7FJe Sj6髡0?c$;@TH!S"c$*4JehhZrph-s۾,",")U JNu4JUhiqzv< 3W8;u-HJ5z]2>KդZ>-,qk:̗P)I U P(6R AR#R .ʎY/ۭkS<]f4&|O",_S[asXRא%Ľ{L?w~Iʾsv"1Y&!'Uv_Pm:RG:;1{ K8D xdAl#,:4<<@GCV1_G{(q5!)5 JK{s=9I6 =C[|j}K־\ۻC+5!JW'qB%5KWMGC(@@)q@e@"6ہWμ w/d1kHU@LI<-,k\=$aٵ3t^= QQOн)l<ız{Ձ)^ LJ Ah( %8(,VGcc E5,~tL^1tq emhVnI^svNHJz3cMw'/Yޠ~Zܪ GTo3#AJzJ APꀔravtv x#7{4fb (u1;rl#-gj"mcRy !)u!J<_9dDx'kt@$ݫS(@@)q@eVufN:.܏fuGԅƘ1Y+gg>ioj%3]Ճ(co2"u-C^:SY7w(}A h} %P!(@J\qPaô&A~TgtmԺ:Z*QAcHwfL?8tB Cx3FK¥$F$ÆaN ߈F. ) J<Ԃc &U;< 7KXnzs 9N -A(@@i4)q@ihN&Xٞ?췪4HT\n#fq,!bů7v?? )q]%Z,Z^ׅh_([>U|,N3%:ɀB JCWX6;Vifsar"g8X<" r8]( 1 Jl(hhPv#GRAxߕigGqkCoj)e8POgmGFJRrUthXײLqr9dח$93yJTYOFi Zx-fE7{VWޮkE-=7->!f3Ɵ $O?} JP^}q&鷻xKT~Y],H:8P!(@J\qPa2ð9ɐ- R-졣]|-_"7F4Z*^ɏ"d.-W&?6IiQQ(PNszz"ރw=];R*G0oPm9Gȵs,_cX*ߔ.OSt`v/Ż#ߊ bNMFFo͡1]p=A>~+]aniƼ=@mQQq+}g0sD{=x55EZ^V2Hiuh(- %8(-,΢w7X U;-!}JUv2&JCBc~7se+;jgW[mGy{%DG}ezv8ָ9O|Or~/v$;MB JKWX(-1,6s(t_3\ ﭴ7Sh@떏칊P-V/f$DGϯIz%!>{V+nێv{c9 AiR# kĬ03t+W2a T`aD6̌Fi8&MD9Jҧ OF[7~TK.(gqyHGäos> ޴RۚPm5G5{%nkL\yHx>ef{_Z(1'ƌ#+}Sbs9K}ҿJdwc&ՉS)ZUGp;R6r-IxB 6JW6X6;6(aGi݉3?׿彿gXeJ6]7voxB=Q4JhLehB[PMt}A4gߟˋbT{fd2nɀ?PmG͎J.4E1X;O1fҎ\jXrMvИ~e9_,fDj͓0XFRCx 5^mvl}`x(wR:`cuglR/ݑh( %8((T^3=e^*|٬W7>0Ioyfyr+'n讯Tdoy") JKr|UD$#DG}nEKNo%ļώ1"7<bBsd-Pm#G#S6;J~.|ӷJ|^aP#l5+o}6ԑe;rg|IQQ<~QaY 3l]܂'lEV⬡VIADTNB NJ'G!_9ar@RD}'c=SY뛯 w\7nΠ9F8pdV@VÑ)P>Lt(Z.{%`-/%(W8-\s,5@Jd(@@錠t)qW,Vq[KQ?$vFM*MG3y}a_Jh]F_E պ#)] Jַtd|XḷPm G # E, ;CT*Ri|?cZQ^%FjjޠLgBc_M <ů#)%o%#$po _&`Z$#=5yHu5$@@ GPAJqP±81}͏nO[ە;9X%%N/ `E{ +C“)bnU'_FRBx?h(W;ĆgNf*$ 7]=2Y(@@銠t)q@((oY5_Kd m]"OZΑFxwqwIcr y|n%q{ܠvhV¿:ap^gjq6))Pm GȣnXuY$踰M+U76?+|t=5T(xX"t[m%HJwqW GZײkgGH_=d #:(Hɤ[.B JwWXv1,j2>5gٳP-Kio}NYwQ#,w |斩Sw&DRz@xIlP,֍ \~s[mzڃjL_u ZjJ @Pzragڛc2:dj@dZ*"FUr]4JhL6ý{jVju\^8Imu'*BRzBx[KXOVa{޶͵[ JW>Xq;Ҡm5/K)oĺYǥ7Zwa34Faiנ!sn3Z7[w%|%i:,G칅w8db?лE\7pY;tAsP"(}AJqʾFPvT222~v2PfPFJ+{I2ʎ̆RC<{?y=s{:svՋtoӶSwh x]( 1kK },3Z9Ӗ? YcZr4(h}#>ݱڎSE2֟H1^-0i) 4 (@i4)1ÁnRg,IK5VQ j7nHx8:>.^HzA'Of3ROR-$Jchj߬#NF7;?U4(/ě$ٷ m_N8Qup"@ 4Q@i\ibUM nO'l1d4Rj]L]PM%dxoDi!qW įy$wq%MNi QbQ/+Jsw,όH})O P1Fi Rbj)4kדDMQ}4 3#oeZvQpe֦ܯH4be5uc'4] {p{(s|jx r Y9Vo hx+$J) {0{(v<~͟87oSuAA"$*ح)cW:2!QރƤ7YʘEjb@S# ]8DE27Lm+R,K~uzu}wQ@ah Ru:ˍ@ J3Hfhs3ۆ|>O&]5{lJӗ$(͠1^jWnV5K%̷\ݝ9&:4(W ]|^{l^NMMۿyXCb!J@ 4Qm9k"syLBOvM&MKn"Q6P}Ťhx]mcιp`Uȯj8}~"3K;W{.|fB3O4c>Ldh@ 0 %v8PG}"IծTQ쩾Z( ڋ6"Qއgfkfw -N1Vcy(<7pe?J|sF¡ٻښ)t+FAJ_y@ QZ@i@ANfG^>3iRp4ti sG}(-1ڌͮgXm(L2>\֒=*Eh(hwOmZ#?3*OL*[?) 6 (@i )1YlbwX~?s7+}Eت夊#QZBcd엳ckj*tU#ۖV%65Z}duM XR}ǍǤ1VRNb@ QZ,+4J+)ooX蘶^'7ʝPD ;`}WyЏcSY= J,(/6l.<\ VXe^Ux4%((@Pʵ陏ymB{ɰ6,%١Zngh/90gI$Jkh6~p>>U4cTi]6%OټInKrǸG99@J<=J P(m@JLpA U^WhݙgqEwH6ИA&OAU~]ž͍&oM\k{!J,G,5 pѷ&q:=4ޗo %WjJ P>Q>)1Á!QPZ>O7r3afG^̀i$ʇB/ѵ[WI&2zGRMNi QbQ/t(8qR穞{O&[ZPs OMAĹRV@ J[-Hh[Ӆuۿ>,MLWWr$J[h DY3?oMLzkܻ)3v%j{ߎدv{Iȝjl9MET4+@ J;H.J;4ێ ʛ,f4?$?~Mcqct]$J;h Ek]H9?sp1dQbQeeoF@9{ַi\f|hN֋VT]t~1h TX<%@ G0G %v8P>Bs18"0owYklp9h~4&)Z$9੫CdnLvxGᔎ%):rΠwxT?k(@ JG#HhV#U=OvYΆV"^OT$Ӊ(1x&JH\(}XRbX1DE*ek1ͳ,l| %sv%((@{L*Ϣn;ӫB)ڗ{_G| yK]#l.Wý1zv}h;C) J,es.Ɇ= <&Tj&Zf%gz>HycR|N0J'C;\^脆 NU@cEk}dJt&] $J'hLVkJ&?wlf-{䟫|BGt(ء2ڤP[R\wBi\\H׉0JgS;((VMnZB}yyXckNlG;|\$Jgاƌ=48ndž)Ģ~NR,VM ͊y EpqZ %@ tQrtAstANo:Pfb[SD^ڇYw),2oDH)޲?(Z t(!9G~r|C>\ U'-/idf@ tQ@惣+ J67YldΥ`dש| Ԇ)+Yc}f?==xݛ NQbQsn-:}*A3obXԍ|yXMTeER%F#P1 FRbj_8풂* ~jT}9>$J YG [zwО(Y4MEp'%u?Z[S붐eNNAk̩ZWn=:1gaQs厞F|XH@w!x\3:Whfxs/)!J,[i]#?NkPՕQyLMAJvŁ J P(AJLptG ͺ"K=]Vl]+gXm"=*\]ɐ(ݡ1GL5n]j/2b*m;yNĢ>%wMffСu;JK dԡ;%((i)JF6^$ʧ_%/DW4N9Ң{+8DE:#{xOS-"Q`6Je>%(( gh}lذ,"bGVZ-fiR7HϠ13nf[C_dih_ᘳpJOzxIə{x]s %yJ Pz(=AJLpDie\-;sg~4ls+ | zZD fīp xjK<aŇSzAXԗ0Rmf)frτIX%@J'B@%H J/Y ^xhIBaR9_ A/Cmɪ2xAs͏^zD~8 awօ "7dE=)8]_2mx_ݜ Ë-Gb,` -1m6og˒K۳&}$b#ᇸiZ=]d ͑a6<_Juy8V!]n獪c>%EM:Ӟ śqdySRH-*WZ)ЁԿ,`-1"~í')\fhWQQw?ξ 4]g6ϥ?v<;c}%,a%v?ukE2C鶆wëk|V6vO"YCs&q/WzE ,w_`Y=rlCMũɦ%B`5/uhyXt0S;,O @a٤cIs4zߍoWy˸Md,9oyBjCG&Y=6a_YBX3T0(,)t5+}'mchy.30@S;,l Dq3WG;wdֽeU)T>Nq#-b-Ϗ2jĝvVzsI?Rmhuu[>,+i'?YO9-Z6>ad-%|ϗ@ ||Zbjs<45p_X6l}De`Eʏv_d9D|͙;Y2Wv^lp zwKf B'H?ʣR_ZTyh͢E` eh?>!'B.PX>QMkJMaxgG$&?aAP6r$ hV;w2JF 0 ^2sqgN1lzf6&Un YbQϐG{_2ibkv-^ +A#,` -12̓(,,+ ,WLy'?]Zd M+;Y\ȿhScza@1edE}ؽ3|Kyj"+yء!_J YܴGbe2 0<4_OXWf|ȩ_w49>"VPiz+Ŏ|Ask*t}*,J[9 [I˪-!K,/НNW]{gL"LQX*iK-^~Fbe82pt(-nJcqNzr;uzpsMC$phãof~USp9kZ{edE=ex%}@{ueQXXd?뉥 Z2 "X12fZbje>JR$xGA]ۛgM0 ьlK"YF@s^He7B$i-cBy_eڅe$dEFGzC\cL?o__VP>^r;\ ~%,#a%vؿ腜 >b]sj1[Q5W 杝,<`#ɋd z(Aj]>$'8D1 ttݰLLҥL$(hJ֊Hs̳.r?Q [FCX/us&_%Ŷ'?W$߻` he4hhRbq~Y)-cKsVD T.+AO@ YƂas{rX<4ՈEq7)$ᙰi/ly_skFv*e,4GKV=If7P'u4DѫVq%8WX-wMv~軁3FD̆CΧd,`-128!β5OW;t`LHqʡ.k<8$VZL4ynYbQ ' _}B;C舱L{EWAK<2K X,AK J ༊sw:TuS4VI0KG42S` ȝV*&qyvqop\ Wn8Y'?J. [i2k%%,` %v8X&[ (qN+ 2#IU: s{(*,9Fv YZR#X12f Zbje*GSQX^|${J=q;Ng mnd ))>Lڧʾ[JCi'KedE+oi,O;n.zEsex%QSK X,@KLpLCwM^4S}яY ;RڪL,Qf6x"QcĺݱSz0ϐ@ LYr-gtKF?'*z ̀,ֈy? Cc3cD+S_qi٪ng-L,`-1['ekr Mg;}ɛ΋dV^h"Yf@s_-KoFEz^ᖙ%t#37 gQ}0$xAkwC!Ձ` -1[&e&׻u^ǹH<~=1@SIq~oh23h+1k3zT6_FY%MM$U2[[69L$uJZwۤd9-` ,ehYeB.O3|L)(|񾄳J$h#YfAsNl4o)kPe0j? QY4Leb%n YbQhCk;Gީ,;=^Vp <)+hed` le6hxQZflMTn4 f;5ڝ+%{Iˁ˷!,?~G_Ĕ渗8eܙc_ /tv&nYbQwk3̋?KBbxjB;'Z6ڃR@ ́Y怖`9(qE/Gj+tޘH,kq fÁpJnbAt 6w6ݬڍ3[p\hƯ5Ư ^<ψW)%б#hl`` \e.h讉rQX^Q+`zŢK?}o%o8Se2k|O8>;-~Hҍ eTedET%0M7?}&m)[">AF@tȒq ?fZbje!PX>Z-3:nV[5nP7l2cI'DpZo@< $52ĢqQT'\ '69qav ~ԁ` |e>hc>R^5vYy4;}v h3ĠHw&4U)/K/L5&[@X?y!o܉Gi" KzNizD=-M{yv,`Y,-1ݺ,@a2tvs? Yq9韩?r}EG1e4sr?3n>#/' - ᖅ%j"ƣ3bi~98e0u֨ZNdY0BS;, .DqG"nO[M,,, 9c3gB^ߣ!ܒ Y)[AXԿ+JEK7t~=3jbvoUOx%,`E%v euy\kY2ޚ*d_q@5ӽx]?e[GF/6LZo),oWxW=lT[U]ʃc)jdԢ AKK X,AKLp,gDiYb]^T0UiG^ WֿP"(漲Wv@oNYՁ,7OIVx-K K,Ҩ,>. l,^d 6gĻ/ -y zN#X1fYZbje e ˼.O >5_:u߫ux 9e 4@w#c DՔΕ-K!K,d͏J'& m>wv# G2ák-!X1fY Zbh. J]_8}re<ϒ~ڸ0BHМu*$F2ZtMƸϗlv9qnYYbQL[2b/~FB"IcA_]4ؓfvHA]\3b.Gbe̲ t=e(,tgH)zaR#svHe6+eZ)=Z[CXk }asi$`rvXt׬aBrr#` -:^[Bsn5edEuCM\q\ ҪE=[zkݼ $>ь` :ehor#'CԡX6'OGéw^Ͻ_*HumTz2Weps}? X%w3Fj:+eg<ԹLNa,z<%,a%vArzt(,h`Ijt~^KYxkP~=8.n?\ e=4'/<XnSb+p\׻[ % vהK׉lg,#Y6Bs?P־7~CQ^*}$p&aķD,vxJ,I}5S&?z_E6ޠ :Ɖ,`l-1/4[M(֥rKM*~")Ǣ[bVd͙iq{;L. o/qoS5*pfz ɢ.YɗELh$+N~-,` l-13(,z m:{Ƈ 5v_>WŹޏOwI,a sxAh;ֿeTkpJ;ADBDZI i)A$Cinu]r^8_=<3`.A|lY@Udw6loNZe~H>ʷWh(Z$΂e r(p%g{JN]ۿ|TdHo`^m p΀ /u[*xl--K[~{_Vޓhok&5۵ KDb((K ,X,+w ҳ,KOY/(tŽ߫x"эWe)czBtM8ʴdO^7'[-/oD;MM/',!>+G1 KqP@`Y,YWeg=Qvz4zGhZ$122{XS)ް)94!',}wEZ8Lx":Pz(F̼;,[^ ~ hvOtbjXHKӮagzJ fkM_- Kf;hP@`Y,YSE+?k,?1A1B5ͼw²܇m5_q篃Zw3 ^ep;[^ 9ŴtC`čQaTlYە`KxYq7(K XV,)wů89S,-(,Y&wQJQ EH] T?aY׺;7@,HpVڇzǖ` ď[cūn(Xh7{KV%2M%XVB,+A畻eY*O/׿:]$׶PaM{,D~XGTy>bF}~PW~w('b;[^ ^[ıƫfO Eqm)3Jإ:l9rd,9 e U*y.aYu˪S%C}>;N__o!YKƧEª:aY&}gF}f`>[^ ƽnЏMB)BopXLcYJ]Ղje5r>k>eB<, Y&uPDuF$`/:("ԕ>osITKK%ƻݰAɒ{lY@|9A-;95ub3BPã,l_@Yie IJdy^KX֜u)>Z *& { \z6^l4#tݔPhXtQi୭ ]wlY @o﬿o#}m,|G@oS8XB,kA,K ]2=kS=eS!߁Hʤ@@P_ThJY#?&٧Qw܇ /zFoIls["c]]g.nMc:0eh5i]6zKLCظi [[?0sbDZ&E u:9.s;KuX0ϚJ:W(_+\Ude3sXd/-L}h[w-" mZ-u/C2d@rP@`YYSG?됽˻8g 2sGHvTo zp]0V|JX`rm`~|v!y|l@|Rր[J*3͉8x kU]A>@YieIJdy^KX6ujTμ fw>tA6l h:{p',}4xB0a5K 䎗*Jc RBJ>l[^ MC?TQfQg&V "Tm, CYie#IJdy^KX6u;KZÛÃ\Z Fsul9RJ۞n /{f1lH}lly֜R,DK7=y! b"4| dH,@,,+w g")Av?>%=pmR_#pM?aֵWyIO;j #{,S"3ǖM` [&qX-*lLoVuc<_*CYieIJ dyN˼*x)FE Ų|Y_/}^GПZe'c[ RTAP=6= k cf33moYO0ê'p‚ngfe3rl>˲Y_Gz:]5 Lfx|²wjsk/[F}+qt[-/?hf\|Py3g!ؐyvP+XH|vdIl e -y.ariyiBpp[#O4JlW2!U#3튑V'qƣ,S,4b<%,Oڗ>ƫQ_2@gV4?p²ǚ`kDaCm]'B^|" c 1axIn!y:{ ᴅ a,y,4b<%,;zA)5)H?|Ɩ1h49 p~vk,?Ja-re;[^ ~XwxV(Q+:Z!\w-6H,;! s]g]z1Ơwט߄زly@}TLhlvXohЍb{[r@wNXvC,A画yF>S,(7Y/߯.3jy²n^z=v ݸ bU-{t{JɆ?&#65?iC.p$wH@$P@`YW=gY{wDU`M3ðfqf DFQI&>{²Ћe!.=ȈyZCVYe/I=,QWYe*Z.4rdyoH,{! ]²kXUE%f~nJCChXD.#aW',{}2˄tJGvÚ^5:iSc[-//+w AdA%o"F1˚,4bs²gQ["z6Y)8#CgwY:ǖ` Ŀ'|.W#Φ@~NxsQ<(.K>s ˁ1d%*l઀vܓB%m d( /3,da`!d[ "*_7 rΚ>O?Z+@z̸G|.Nx㡶]23 ‘#SH٤RT qx!* 7G5'z䞣7Cilf?f{Msf L<-xX6ʛ6AL9 fu-ͬϻp^`݄)Tpk܏9e騝kdߋ#'|+·x] FfyD`z[_%krjr)G?ɕ,y)rDE 77$(l*m* Ri3ĕɥQ+Zbxj+wS!i26 gt+7RTI~gJMWCWF6E8st|E`lDs6閈7q?=%ʧH}gF5&_GRwT'~O|kORk%y J&ipEMt۟Q9bJ?mo wlUX@mť>| ܿpɋ$ ^dچ’(B>J9![6/z”TY8c]72E[eF ]*.hʣگv^7f"IH/Ǘr̟_N@UJB5yD;}ZnZf.f2;wLDŽ#92UЪL9PHc[%a6i^^J"[TИگkᖒw;(kxYG];c"KBZ،H4uEoi dG(wۯG{GMa,1MB'C0-ׄĎULRQk ݥ^ kwLRݟMWTHz-$Rtv<1 7&.!Ml N~2M1%pQnh |:@2xKLhp/ \aڣeQ+57KJ>6R>ZڤepP-qmY; kulԚI{:Y1VRXȆIp#".@ߐ(:Lu  jб7Lxe$C{ΟYD`}GdY/˥6ބz " %5 NJH[U|'>Ñ߳b{]g>4jG>8Q}ﱆ"׿J|-[H 2p~ѹ0?Ul+714U';H%czGV‘3 ALz;^xLW,m ٷXR}]$C^0מ/ba,x$G,U`ݬ#zw#k(JLGr%M癮GxyҿyMw$ȉuZVMeB^c7pȬh![-/ȳ^`A5㳈UƺFLqDs)RH, C s]}Cgl:NkHB>qޠҕR lawC>-*`=m|ebN/%]S>[^ Tאpn? Ȑ׋O~y0 H,! s]Y7bOY/3Eŝb*nV(9gN|fXS;a9 sU1' T*ecIlnbܗqy5_5"[?8<. % S1%@,G@畻Y7FN4}3|$nRn7L@NyG p#O z3'_B_H,euy,4rb9 <%,Gϲ=ec?rz0oBݐ7[J V3 Qp+sNrS }~w*pOEt;}yWG/-G, H,B,,+w ˟g=d/+GY#(ܤ?Hj8[?8aF/Ѥ}ul=BJ7硪[-/?\Fe J}O(­0=wO7[؞~Lkק KȻP@`9YS2YSh>Eec}'7F9TYyWu=lu1=kyOvx#o7ë,)G|@Yi8rdy^KXu#fKc 7bԓ3lb<)>V XpaS" xfHr S񗵦>o:g(Zy$٩ ߶$ N;[^ ~oEE"}ѝ wI}ai/$^$<ڌ9r;)r{ &`fvMc&.'9pMnb.#|uq a5 hcǖ?9c+)?$% ځC*īh4`KDU(K <%,j}OjIGW{>!ZZF&ԏ<YKz',A/w ?Yn6pM0+%8*Grly 4&7Ld֏ؓsOqYtBYi]S,3!HqWy "b(S%-O|'4"Ce :6#d`Zy zLi=%X.B,A畻Y㋧=2mw)\iVޗP{%\&EafC= հD3"NXx/tcϗ|XQY]Ugzը#BB(dI1H, K ]r T˥SxBV Y\&p6w}+NX.|~ec* z~cs1Uce+s4rP$F!{{ &Q_y^`Z%-vx?K?rb ~.2b٩^Ӈ֎ġyu\>~2Ē*IJ;tWفJ/m~6{__,MM-G̰c|YkӧUk=wf9$ޭM@Oͳۇn57(p^a#(5dֽπhy?GqLlp \XD3"x* Ȇ2ϔ;wBR0m+ + n ˨=`ڡy'>w8|WrdeoǘǠFƐ- U=Ad~|-IZP`J2𣻡/PO">n xiL%>iDQ|Ӄ Gy;eVn7*>Kׇq Dd66)]V;+l|i1G$lr,< jM`G/ZuK3i(9Ýie `agC4x \ЫFL A@m*FRD~Zb p.w*rjlG3Scs8Ք*}#S@Dı* Op?H!M+uhץČ10")#LYJ@ғFU%xbkߒjz!1kMs\r꩖ˠ6:.Xړ<G\ 6\o#FM.6 2B0~{s;N6V)Xcy#c W1 q\_s`YgEI+cC/e-qKZwCCa\0e;rU X QbcZ`|?"_crǎҌ?/{=B~K#鱶#GM ޢ>ul@45 ސ1{]=Pm]o}}KA~Fe`K8'8(K \X,+w nbynKպ3ݘb$M^ire8wǪ> ɚȌ=8rTz&jKO &7߁xW`$~sP, .U~ f<~{>ZvUuTqױ7@-}6~ =)XH^j$x $;~C& zaIL{PP--in?khkGhaeMtg2IʟXB?Z"Frݨ=\2H!CcWVйt0Yȣ;Ne$0hm2 BGpd8~gYK =Ic2A\LՂ_WГ<ȴ=Qv LHUC=_m~Z{I.p|oE=wHBSm]w]jv겚e) bU*4Xv`%;ךLEO@=>y%>ysl{ȃ?+CvA@NS {U ]#8V?]5f ظ,3z Jݬ+HG*틵F]cʑLrg5>_E"|e6Ȑ;%ʸ@fQH_/F+Q?(7x|`Cnp.de4HdzQ|9'oĵISO|-,\h>hZ=8oٿnoL<1w}' z<״#ꆮ IX2  +<[~7|V-c%1%a4g@ 1&%vPrRC^ӻ?J/_Š^z;zCM&t;f|w|^5>H,?2~Yi*1=ClJf2ltB'Otl%| mKGoݔ0 ~W]_OMīM| reHfCV[ .z|-pE6/F +GQi55y]u[T(4ԮCqxk/f QC\WT(/ [(ybzdum/D z u_-[fጦ ;>KmUTy=~%5|m BPkI\?HC ^A>LxM@ϧ=[ Qu #?D~ A,Z 3(vcrk7%W3c[Q6) Tas-9V:I;GR9Dpb`wfg̸?Nϻec{:i׃ vj}cI"<+Q)f OO2k\52< H>X*E8O $Ny}1m#k]e7Wy %33d:evS򩔼:DHvXvIyml+N 碢߅H˲>C`ۉ_xM|繵ګû<>V-7edmS4xiM%}zWZt3"{(WE{_ڶ28bnH ex) $),;P9qq{RxtY`=m3$!,ہ,~M%^~>MmFYG?~w@pk2St0ٯ7L/YT 6 J]^rN/\qNz==|2l3| deOBu絇_4KĊ Wayz:aय=8Kr#r]e+ۆdWNjfZי Z$toly]l6́gu3u].V1e3sj]&5o yk Nr7zڃ[ 閥ą +`SnZ3;Kd83\kEqvR[S7I/j6 sOrUp2 abMZަO r,ߖ̞[Lt;} @?Cd_G _ z+eהCU쥼 s7B?y rXBMZ|*飉WN=5@un.# .ݞRG.@òߜTxYۧ\z[;)|CG|W}FryZ9qO -U@UuV{nu]JR}G:T}'@֨ݱ|3lot_ZwV]j;{ `YdNƧٳu~FQJf<O4谵ur uY$-z'p3{s0X9ԨRcԕV1lkΒZ &,K\V@9]U}  m Ę×JC’mKr}}fA>@JJԕGUy5j'L_ 6zkHX: WZLKdn;T9\`9|n+u}M‹v6at=BЌyB^(y&e!<V&_ W:ǖ55, \ngzb*2ah~Pʷf,*3 -`ч0/7?o&pVE) v+şxE ,Ygsp+7e5@293ݮzPo{5]IA8sݲtk JR@ K Fx5Q"t(A[, H X>r&m\}0-ъhv.MEl+X>R5fbs\K%8JfnKN}t2:ʚ͏<,s%b:;XmmO8, ~)l 5/'d}ØEGC0ݷBbBVɧZ%?de$pQ?[ "7$zm6x 3re>O׾>NۇR^Q$fhB}Foxv^7ǯ1.Sy`ԫ!I Np:*$:!mHeHXf˾=2%͚DY$C { O t~du\QuBvIreRH<<~7VϢLkg E ` d~ؚFJW悸s 2HV_h,hCNCg:gS_6?`rq3HqG$cJHF`0_'׏ s㻽g^z[0` YygOD"xttD+W?J[Lqʕ5ߗ#-S{oى{],0d1 s^GVU\e4xͭ#2ь}eđ.=ኑd΢qz XRqIPH'>d8w1t,:e%0sR B⌄Qðlg̜lGBoQTf^1t d^@v83E8ҍҎZa]ZI(X PSsgݨr7Lｹk@>=,[&t^8kYD8v^l5oayH<#G/(%bSS$r%jeeEyEOk2t]͑@k(Tv(xcy4M B k`ۊџGV2mD 7Yp 'cLd=/ z&0s);X!oYϟ)`Ok3pk `y р9'X} ޻Oz1Gγǰ Ez|9WK5Vҫ;7iΨ  "{>oܴ0sN7 {+Yrm曛5̢ETt2ވw7(Dw|Nnǫ<ޓB RF9CF{D;[VEv⧟%S|c0,J+Pݙ+?1]lĮ'q!HX!wBoSNŰ#GѸ>o7n)xX /,o ޗV\d~!'`UX^CoUf'U. $D]ay HŮn M0u%58 b6 `l甹@L%Qli+^%Xl3;AHKXz#B.8)7p}twn 2FL. ȚCgz /f{5pMk:h4'2 1llF(g'ENwLi!u7X^r*#IJPZP<ƻkݓ&iEIMXzET1 7M޶V0.)ؾ^CA ,݁l"sҀbAJ&Cww-K7 Qj-2~Ow;Yоs:)g4lqG~TxQ]E~4ߍ𠰐5qXIQQ%MVqV\[Y|jt1b OWӷ-4Ky+o[N݂lK0&.tF ~ =ROOzv=6y N@|,̾adaaos*@ G;Im$j| ?|J{aruy~TWʞm M^IK{dE~ߘܘ.tI7\%Iȱ 2W&O 2|KçiyD VU[) v@~3p˺Э*W~f}ha.*}u `iH= d.|&įƯ"T`i ^68TG5d',/6.iƷ!{l'0ٿyZr)"`^ifn:N:UfӬSgai$a2x4Go(K ͩx!@~9.vFkydkꑵX~%{X,͐$mw'jtV'Xu*HoI1ZlUYl 3T.<bu'1O3' X 3 $ꩁz,z!Qw6 &jLl12ߘG9a5q56es9: yny H\M,HwJ:.d,6XA}aY[5ᔯrȪR-,  M˄x$ltqGn}z}"f49e`^ ;9eʗ"C,ʼn^#O֥GL?}ֵ r l kؒ^zS#"ZTat#>L-/DEc:n sa\&H^3̥I9sdp,X[U:SOW)tg%/ .)FO M6S,$TX,E5/~aKgu=jV >,M aFQ./GX[r$ʈYYdA TL~jV1Bj .gJ #K- ziQsbӌ+㉹=8"d,5Yê2iy9sb s^[~bc9w* g)#ETÊ&C8mPW;H[X*sn<'F12;DTM_[Fx@^r$^0=kdbBMI&G"4"xܔq\{c*a?KiK J:p"LW:<2!=AAHkB{O\kOj{\NtP-5qj1+v1YӿڛS^RYY#鵹.~D2A!tCRΒ^7/!ڻxR 8Ȼ ,9΢8o+}y u^ndUSR@Z| "Wz?}HFeuf'a)\?X4gz}CQ8* ayH2^ a_ |5Afj@ۼ"A%jUv^=$S@rRl~wkq'';R c5"^Xa)]3f";kJu՗DȾHXq̌IhlO羆y$dUI SUa3%Q7skV1xdˎ$9,O$%n*^Z_I"?bXu%\m8YXB_Z ."A> cTP5R1˺t)#oX2tHӚՖ;XQ,>#5>C +,{dp~_$ q2Z˗+p+OOKA 1<,i~{up DG KdEGovMd:" yA厈\Rͧs,78r6EJ _/u[UuH=Pz[}~#CpÔʛB{(,#O+6,Rʱ[?Dv^p㎶1r3,}\$dvn #kC}A91ѭofq9?YKv b %q,|тYK6dvpVwjU7OŜ^k;a_kPȚLB|̢NL[ w_i#}ydA7,+=It#ߊfV1ٰdF}֥dd`b$ qA X2iXS^|[*,>SFY|xFkuRw Òz[=J*Ntg ٖrڣ|c,d{3, vF1l77xQKz _Z8|;`grAm,1\ #aI[DT#iusa:wm KZ hvtQ u~k.5@X ;]YrT 7}{jLόz&aIPu{zD̪*V}M `yHZO/w3t׼E~e@QJ `I̓~Lzp~y*`܍H*KJdGE7FMI0#2"Sȳ,)˾4c<[NکfwR3##aIޤ|jq2ѳqZdۘ/ } .pL>]u0$1y&>`ٱMpTD52R߈0=?IX<[z_p$пu|Ù Ṡڱ$RYݓIYtL()4-r/QKb%,Ȥ3qf0-5T=BvÒ*tܓBM,lPGE5) CLhb׈L\6˷ 4, \YTU;PVxu V0t!.gyà:QX"^Ly BɖNc (һ\`9\z |wOD?dxm!g dq(砘.p/S"Z:dt#{i`7 `Oxvx챶u=5󓏊SūEk)Vͧt]?B[ `%˿F]fԵ[\qBMV¥OȪ:,gnֶ5<L#+*d."ohHK^ůo3g&@މ7g г?Dc|_߶||J|K\k{}+xze/*h ^`pdY"*9 /X(4c MK8^CJBe˟:8\8t'"1s@A7(ޯy J7wF%^4̭o -AFݾcQ*-Q GyGk 5ƙ,>H qzG2\UR$A.v"WKhW~*i[ gp/.pP`?CQr\v |ub 8HE^=X qqWh 8nbJjԳۡWf[j_TRx`{J.r8gk^YgizqH8x4=QsOB7:29Y 00]9=M\;=Ph]=7ʸśzVJsJK^dvc!o.Gm*'xQ"by}FN|oW,_LWj'al.;pVc?=p<6H8x=_P0W!CI&!6cFj[|4a4ZތNZxWSe)XY!^UNA߰hX)e!'8LVt7̜T7RcyvlNBZtW'/vo7Ow]`.D`H%*,΂Ypq~C.#{x`x3]WG j:z$*8BKq|3|7j{TC\3& uR8JKXt!Eq)w ?˨xNVH:yZZxvmn;[UR?=DOW=t qh{qdm g^?Ra'{!Gw="&vOM]/R焗sWܽyD)x' m+NN[M#:&=V)]n2 ,U0d=O.p H? bG-_&VrKz<:$ܺ;AQh]A]&xTNڰlՋ|DCU|p )X"AB{ys2|-ѷ&tqo3Ѻ> BB[ r#ߨ VՔX*8G~a$4ػTe)hkx8 "1A7Qo=8~kH H#ޮ]ιڞ¼NJ*X[U?MfT3:;fʟI\oӟI0n?Ud! h8F{4<X*6ii$ |ܴ-S vK<Sawj&7Jz]\Z[&ceuO-x"AB+{?G񪱂\<|_^F isb]Ϻ0]z0f̧ H?Pzm [|=͆zLg$-$N'n Y BB{ӇU)UCߝfyFT)NE`T;0A A{^_kzOgX⪵b(>И~NZ:hWTeuLqPxBc~ϖkg8Qط{t!#]B&@ #[㠑&JGuGOL9v' }kw7ָ's\1";yȓGeDy{Ew ܨgC8H8d! t{̱dHdY<M}˛lyXf (tԮ أt'c]P1 u"ɥsDCڹ 7y$SI4$ Glbzj=BJ'\q%Odv o;AP;`W+s*bk,WmOz>_\/?'H.d! hq$0-,v8#ܾUa+yWjiV;AQ]As }6k+=˝J?]"ƝA|;pd$~CA6yvo#䈏@hGN N~Q>#L(tʮ&؇ȧ9K_gcc#2?c{H[~)p]%R7IC3iL[Hߣ ?WV[swO VGǶ Vn뉄~+t#X#{*-t_RTL(g)skw 4p<$ _$D3m6 kC bRf*D8ݭ_n-0Ȭђl9cYja}ZmX(NeX1~uOSpH?5/w kR+փG"\#zP'%MMv ŠB?$Ue MH4"Qߧ8R Fco rn _Ro#N=k Ve.;U p$nmPHl(tѮ سUaX-\r^W=쇖Lsz-k^1' G=D?[hC˅'[`* X$n׳; lWl/B2)svR:Sj~1%mIGw~H?]rNPvX~} Y#Rv^eg+EBFddٲVH%Je'["3$y~=s߯}u}ϹN9x!~6 ̷,]~#FF P9Ć3-[MLUݏd{p'xwqo%tWtT3L^"A0E`nրLj2} _:I@4j'>r.}oO~ Xa.,_Q$E݄4"A0E`‰n yB*TH4+[hjH p`Cls!:ÔG\M:ztm'zQ"@^A#A0E`…nւó ׽D;JwlY'?@ C,YFhQ? [Gt A0E` Rˈ9t\'qٺ nzbRo,P?9E< q! jY}3S{"{;Һ+= pHLXl<҅P>bt<ҧ2nVfZ /p9v.3)rVĪfəLNHSu7!\N:!]0E` .~ |zl$Mi:S;{j"q>/nc=ƝEʿJRjiܞj(gs|E`fχn:dD;m.gmܓJ]Z9 #@iqܕk%?E3[5(q-QkfG\< C`f(9;$tS*i};R|9d/v~-C 8yU:B+;S]6 Cw6,qAWEA#A0E`a3blO.l}N"!Ns[7 K9r q_9';XXݐl MGWy jzpY$,@нC.^V9+)mTټWETX5_&HYI2+9/+_W0u)Jkɩ^/ ,LMQG3 ClJvΆp[i5sʂe~0 dNșǸpM$,@ѭA"elOcpDzvX erU?=rEjPE ="sZ^˱LA<A`DdD d\+_κ%xkN3NY=lD NLGFJQZe^a2{\#L#+DK*#ppS p8?jݬ:k̻89{1*!!D 9 G)ib^P̭M_17S]MI\v_ <"N ,T=m_'fbLJȝme´LK@*H|@'籨E&'0(egᩞzK(/$,@MHQ4-VSf{CY緵2훕H]92gp>Z·2 sw-򵰳:'UvĶD`DݷT(ͥrQvSY6O >&F3$99=' )\mɷ)\pFʅ`O-=81$,@$MFPTKA.u`ņԧwΰɌ,{ H Cy)DZS3i80a:W}*QaFFL\9 !{RGQTjeX3+рEkύ2m_O6 H C+xґ2d d_ڧ %{?'sG`DE<xuY66]/M3Rt铤= .8.Voe3}gw'm|r1䦾VL'Yxghq9"A0W|lUvn8D ) 9tc (xod1f&yX,#8];<9ā{㾰yDPMi,BN7,OJZd?us!p!V@h" A0E`n\UEk&t7p]?LL}1\ag|=bL;WHf5R%(ct6BuәAԑ "QBbBEP_&ZRiAA/DB 7nX, Z@q+({E W6TQ?,_oa3rPstPt\. t@ { {ĹFesss.PڥhNSs'+*N\ouh|qmom_/~ul(Py_E?nUx}"A0E`n WQ],l ;y_q@!Β~Q3O}ǵ@Qh2՜w)=WI- HLX{[;oOd;M#9y2T=r(buCq9 9ı, _89gjDSŴοu$SX "T;pk$lxϢB2 R1#3lf>_Qgj| @Cpr#;{UtU;Ea2CRPN*S UjSC?Uv(`L7\ u?r $le|_NwM^{7 [Άztq!@b HLX^@^GQ(n N|'c /<9V-=Z:p9 W7ms G8C"ŀˠJ3pB wqE`E( jk[?  uUS:2@hCd@KγM[`˷xkB( &9VKx A0E`Ո' Y }ň9EقO  ->rK! <&#=V(D'X-wlD!@"A0E`nlC :ԙ\٭Ad狭= m?r5dnTU"j^gP$U0z]櫅$ ) m 5m]Ɯ9WUiJO%Z*w]$ sWPYnqg.G]^] #j:C'8f_AB "A Ez,q-Mok7cI<2{OuB09/j#ӳ|ݼ<EW*M9a" 7 G`D]@aaSPm(m[Z̍>#:ʑIz2`H`Cܡ®m}(%CfG=?|oLt3fWNUW#!ի)FL,r. =;r눒^8:1Nifm{ Ѕ@oŤG HLX[zb\]2k)?Jb/q4WV ?a `C.(AOpm4Le9 ߂/Vf)PAR "yɛ$"|y.SD^eafZ]Gu21G@ !.ɚ?Ut5g}&^猓u=D0z2kC1&btF1 o4Q5 jz9D᪆M z;VOVx/a, ,T Ab*OQ!E-ϡ~"QHoC'~ A*F}@7}}H=L(f9-wQ JToL#A0D`bn ]~YW.&0EXy+b.%7C19ex y -$.VKڪ~ɗ)@`@RDŪ s^s%GttOAkI?C &X| q5w)Qb{3[qv"(G"? H ls2AaSd[8v=(J{`DL EI1+ƍ\jIzF*4_vk/Ir)#@(9 UHLXU[+(ޞ:Krŏo:=?QYGjVh@.`A̷]-]Ro&|*c!K|rрOmcpi%DA) ) G~/QJ#KI+}[TC7#oo'j !U6,KY{}*YvwYEL3c]p-.o."pnlmDQ N;A1'W+ <;kHMQnv 0)yobNY/KK">9?2/WzXK=՘C|GJ|{k K>eHٗFtwWu {>\[mb* !,}҇BkeXǎ9M-m*/zҼOx| * NWp!nw*U?TWs;˘rm(M&"0n+ TCy0jn)zVI߃>rK3hx*lXuiuPߜ%)6H 8(S {9לI͢K,*9M=pEGg8N9}o/%*ZzoZI_yRTcFa7p'BɰBu !M⿣5m7OꔼǗ_3ɑh2(/XC\M >۾&!JLbDcbiS0}&vs8 S 膑Y|يNWXˤ%3}3L .C G2<r[Ej9RO؍e6!1ئݵқ8/%+m1$|y ;W*r WQhKA 2iUqGG.PHkxJA oJVx >OUZ\1v*Bv zK_+XjZ4壗KkOoߺCL6 "Ao6Q+ӏ歷92]Nvq-~0'Y5 +U WXO73RY=frT+}Vt@[Fk\yJL&׋ NqDN_ry6-wA "YxEAC 9}Q/rk?R_fm.@z9{LTwFgҧ-C: Oϊo9Ց&g2uUۚcit/j;A#Ut+88R-h0ܻlw?W@ Wq>`A-O8?S떷 +Ԯs:AP&J7Uűk֥7aQ|;\a#ow1׳ , KyBNIccpWpZ$,@н9BG>]]_c,xWI^񵱏#pFIbX$Qgµ~?g v87o;5S0<{T ς$Bˆ#׾L(*e!&Y”¯.a;C:ud1j̩͙Y)!ksGk LYSҺ!qMsw֦a_ɹaC`:(*_I@>1'ۛvwM+nm]A~t3z}4kaweԮ?G A+ /bF|3#K4G.L~?'}r ) 't h(@:wo%s* 3dؼa3ghg䂛Yq{ufX*H 6(r\JT]ZYdy >Kh3gfݕDFL!A0E`rn8u i_G5"yv]5 ~VA!Ԅ,ꞣ5=YseN͜$^جG)">39(7Lqw"eۻV>l#@Ŧ H iDE!lA=Gz2 r]Ŋ}!O<z]q0+ĢuUuZ=헾447vINMZ!uFNjMDʡ{E|~Y[owM=H HLXx{OQ++>"T>G!o:ͶGS(h,erQa~x()+&S 6(@zϼ!auL6PMKilHzMh?uw>-=&K?d0&By;;+߅cJC>Ҿ vg1_#QO еp l6{?ዢdݭ&&nYC}J0nwP-8٘ݞIE*!\#_z8z̛v6}g1.OKgXCt.u_bZlt^h=`<BL{Hn= @R ׼1Nk]. ˆ`XuwًQxRo@wE#E0DMP"OPH=ً^A>v;N ?`A: `:\d ц*!/Kiftf‡y'e4 ,*ZoEgǻ ľi@pd"E0E`!LEP3LzW/ϑQس\zqtG9$rEށ+; `h)=kCE qYK Tg/~\5QZU+5P&5!"՜ A`B.s<"rtffp{lszi19!D=̃0(YOOc ZiDd#Kj֭6"DԻ2DHwE^ E0E`!r@bLߏWEˊݓ(>lb).Ep9龅oNU P6+ΏElM#Un9b3zr쯫D0 q0%H 'mqH_!J99me枺$HE ߾13S0,<4!>>/PU e}-e*KWfh\> bh]k+!MT"E0E`!{Yb8饸4l-jyķ*i19Ĕt}|o=f+$8%욵8rˎR&e n6ԭT77v+$"wrR"uHLX-ԣ]/Ցx42- fK]v=)؋HG읉D!#~ n]${Qch;P3^p?GQKL,-ݿ[tѥvyF)b \5RS"ߠ5031KPF]Db㕏BO !(| D!9\3s2SqW.OQ]uCWNsHrT~x,:5*E""Э/CQ#*c$@7MF44^e˰/D` E$N5↬{n#٫ۖKT_l@ BY d((mHLXD(y| =?0&H'5T&1.bj{WԻq:sޥrғ/+V>3tꮫ&oHiM? T}B~0.)) A- E5V=yr&ei$K{hhUBcEr)H<E>^/y48~oU"P;=EM)Yq%PV ߻芜ߦϛ}e.2H<(YpƏې>.-Hn\$E`e4$p؟~Jw>h橛sQvk$F&Ʊ^M$&f85HYՓJj!9rIC',r No(X?SQ-'f}$g{—'` Xe@ɋ&QBӱbE׽K3&NdC:|g)K/-ztv~_q?9Ӣ%Yc? my $"x{ (N.n%SN_mjH$Q͠QN,RrWK 6K`哢ErDi탟zx/cL,"E0EC$%=pڎ5WJSɌYmAl*]Vg$ Vxt7Ngּ0 Hhva=Z Ў$WwC3"'Rs"kH 5: a9U')&o HMUgw~E&T$JsLBzMxDFڟFL)8RV[pAK 74nmwi j3L2uTF"HLB#PVKi 3_໨(3qG*g( v""Ffs? J [rXqT0u8 t>;m\I[;VF|'46P!Uh*q hݷn%(ZeU[(<>bNqG^-G*viO, ;4$)oqky?x텘21OxE'I$ۍ,xXʪ!`(nBa0"@wH1w`3SGw=uG+WZVlY`,a@}P}5b-T))"qHQHl,؀s)D7I|E9T<(vZm2AS ; zLuպ8_"%+&"';nP E0EC$@w% {g:)mbFT q}L&o4\(9;?]՘$d/x:U7Wu5O>j~C;FkzJ?s(i$ c$=Ӣ8E jY:*EFZoƌ6y "2O_dN7|`OV91jdf,n|kg I iBֹ{G`CE""8< vO?kюjq4wح_ >7gҪJF;p3~H;Cq_,z}1ܯaqPlU0/!E0Dgq  Tb,g4c[tx"W7@L}0fgo+h7m$}_|b8NE%t}:K$RbwM8e+,τ`FG`8{#Σ:.[LZ=[WA #r_A&a5sjӮd;pkg N_-qJ^<кjUv1^>KZkՌ[OW(cGиAE""!,BD>旬?9*Lf#@˜Gc/P9c]G!O~Eu䕲ìԭ >HSؐ,Lb !j+m!zܯz, d`͂ 9[<\l݆COno:F"RC?9&< w={J^׸׾ax5j30P$@EWrf<,WlRz~,k.X}!uʙb݄xӗS}>i1oc߁!E0EC$%u0A[#~bs[H~cy2I &iBa}iK-+* 9éW}{}苈͟'ꂦJEN~8S=tbp7vHY/ ,MF s )0h/\h4|m7/H&Ӂ }>#9=ږ. ^L/7/3r%mx6:9V!3Re q;_3#j]=Beڲ'sGs WIT[w._d0}HX}g#׏^[MŒn:ccg+R*l}F<ur8;8u2O3]RS1D j(zJ {q˨oYm敄קAlfj{Hy$۝x3`| FQn IpoE}зwOE:R>#D ?@EL""!cB$5u/|wO}}wic="P$CEn88?Q40,د)wx w{774(TKܗ'ߺ &w)_=3X"E0DsОX5xY‰vGoELsb9X,_\ (VxƢ߼:s>ۧx{sJ:Y؛kOnjxO Skz PHh3(H ǹlvjctU=o흮>=}cj3<ffdlkEi(U7][<-別;Xu͏ȷ;iyľJ@ ~]cЗIh@rePcm(&tF}K Bw(J5^{V>YETbhg ZpƿI %'uFlBbVfyMX_"7xy? !r'T>RS1Dށ.m<9rlfSvO8Ƶ"*1NȢggBٗzl1D`;ssa}WO{.༊f~-.ݘ;{=B?X*q ߱xB U)q!H͋e+XU%;}C<7(Rܡ"dUjJ~>"o0}sr`{`čl2I RFf>cLxH웆aQWi fԽp`mn1 4 )`O"X_-Գ_-|u8s1/AOdt0XGi'|+sgqFtPo$ ]{6+)Ji}=9罄}GeU` K1|QPmG!\9I;k)s ]=3H L4_|Uyf/U?gi g{g\>/ʟ4n+B!bB0#HRC?H0VoQsq◤=4&n",*EЧSPqN=+=&ۯRb"ٮ%KxQseuݪ!B$MU C` ݽB#dtҼAӄCg#ϭdCf@ǑKb"< ʦD$bd Ep<~@E^#E0DuОE1Q¥ٽvM_LI/uAr*8jMgn@քBIӗ5`]]e<ʜ_=uqSy?r.C+v@Eb""!RrrIC㳯|i@q\ܜc$d U AS06j?mq7kS"(loum_UOsQ]x*վc'G=xm/ & !⟿^v> E3HC |"X笚 ޏ",*"_EVivb+zQ3WCe_*‚;:b?qņf,Ux2Te_$guᝌ{Sr!_t>^IlDS/ؾg"1D7޷Bv'N a 7<޿dsTv[]9P@EŠ~sdS +?rl !.+uP, 2We^x2+6?$ܕx\ٽ HRC?:(< %q; 7 NhśuV}RLC:䃋Au.i-˽c86kyfCi`g>ȉɻ-<:8H1RS1D>)A#TAXWu#{aSbu/U%D*wVwAV ro!IjzϔDVnv*h{:%Xg/yKb(k4cCJ]83FGD = "HLA{UE2UJ-ܶ3ѻ@']`P%N e\cG3'>n3I?  ]uO % Oj1͉X&zb Uw@% E0D' kH- ";\:ݡ˯m#[XkKG1“wCQxEf>;V}5+'~[Td))"^XC&Lwre|nS w䋵Nǯ\E> ב~\TkBfcG6;!LBR`]RhXk '|t/!z !wTd ))"!ψm0B9]?Mv0CAջol'5Mymz՘hK*JT`Dj qo͵=8)W_%Inzlf!^H`Ɗb0B=("oW~ ]6Q?'blb15 ?dOd[ukBpofxz'x? dW 3"""̈hE?l%KQ/J.d~90̝ &$K!^'(E kRj?!f0 E0D)hQz3s >c1& K[dP+|`P@gzNӠnn7>|§NM%O[9qfDb [Ea]'l )v+RS1D.5 Y̥?>X.pu@z7I&OmsZaG4(ء"$XMf8lep-.N 7* ⳓ}rK7,[#ޡм\'=^0b:VlKwIz-BD\ˉ_BG{Y"7mUʖWdrX孫%LĂ"*W"iz9 7!_Á5 ;M}F0Oe.Cc1nOEM~"pCy,r2yHq5tVZIb>z'}[9zd`PCbP[%.g 7n[-7hpyne:?}HD8#Llz(HLDOH+ޝDt_?nⴶ*gĔ{))ܸ,8`"P;&~aE=av=TtK5}XLlљbyK^𭘉Z"gj5mP12(D&rn xxShT~ԙ$7EȢkhsW]yMbXǑw .iJ+F"/mj& #Dg?@E$""!2U WX F{[P$jU[60À2/#j6g_8ooJu7Ȼ>;7E;fϻՊR)͆IQiugDEmH9AŔ,R*򽴓A{CL E`!IW7+aK}hCz6.or-˴lYiO'1o7%`kѪ ļW~٭KuGTcXGM0JI%83K A6u#Ab)yjGL G> \wngaM>*K)LMGZ.OMYWTU9ＭweSM%L%uEo5 hTi=P:b wIh䷂o1 3x,q!l@ Yi/ 6`mE~YR > P4q(I,^7g?k0Vؽ3s=*ת:h{#)YRYN?&RqK+س6|{Ф +e?gU:?öHavۀ 'd6n_C-x90U+=:c(s|k˥ݒjK-Q~2?hN NIHŷaz? ޲xNz_,|}ÉJ:4q+Me,ջ,nwO=QnEMvD}Oj9_n6l2'9kW5M7T6qnjvby;%|KDG_V- X]R<-uggo!spl ~-OUB}t2۲ | kaWDt\jЫRobDTY9Lu$OvN4* a NP%cMGilK*nnJn w~S+l `PvzԒ>fj' )Z*#B7GdwJsMxB;yn#DH"H yKAWP|T2zueDlЗ +C%S2 +X }Aq)Y8_O{>wG\|ԭ`oљ=O`ʱOrv*]>sB" *qq+P􈧷{GBݘvb W7\}< &d&z@b#=8Xin@xKA_)fEN~ےk2\m^d\\| *Y~H Nz*߸sk%L X{ E1G`8W72Y@yc}(x*A&s2& *r6hr>l@,2R"n7KUSb 19{Nue!Ddc"H Ǚ8hw6(&01݅`7ڟD[6&.]88P L0;ʫMN&ރ5V W]%|d*+*ϴjᾶ{tZ+@rQп*;x>]*,YZ)*Zl,l"I^%i׾J*l Y+z:qyt{*|Ι9sqv+l}D61/yn,bݿ\bߔVecDDD\xh?NwD׈E'lh{koQ~OOtZCum=gZ:-69^-gƥsA(9cNēH//?w##GjXPtiukЉ4Q9A Wa7O5d6ݨ%-.:9F"A|20E"pa֐eyOS#Z4]*[ ˜=$e=Iq5Bcĭonڗl$vw_Em׈KJ֨'rIL^rnay/JG%s"D~DXDVF8Z:?6>ҁiďɡi 9=<*[`]ȴoVɓ=C4sSOV.1t\2Ehob˞vNG}ʜH #!"_"J=uzۨ2K%,pd-[K.|N}샓`zʾ UO$-Ժ~+gtK ycnH5cbrxhi*V-ÉXEf3'HwHWξbMybonbX !#;2exy{Mt0$16`tKg-j\'DS8о+9[^+{˭fpFӉ 909rfkcǾ/ThX#LCm=Gd-/Y;;$,r}mCLOϜ1F"CE")fHs$K&y=/ݼjnSЇ/r"]s"ǫ?V~9~QO9lh}^ŇXowVjd= ?&>wذ|^9S ca?/bך,ؠfH"=%%7襴A7)R^âSOi{jsN{W&]@I](M择4.׫AJtpLn&}#L\ œ%b?p*hz旦ԛK^ka܃wat21Npö;ʚ0K4zH1w}Xo4F? >[pe8uN1~>fzG&rF,~N̉+Ļ TziÍ#zn+EɽvsvE!Mj婏ZŇ"J}n>mqX|@hqdO?7GHb̈́Mo󒄋Y&sNymz;=4쫕D OϤs$ݾڱ.Xa շ;ZD/K3,CallkNo~%au71~wqi߾nbqbwJ[=-#n!BE_sR1]w7>JX\be3lRĊtΑh!G ^[^^|kֆ 2|t=Ϸ%U - Jas /ۡQ Zm߿s9> \~rOOśk%S[?(VFL5Pi)f%FsROUYo h H+pA=>caNl \6f\O][th`D7U+&TP;MҷqcP(g(˜pgW~fIED7͏{BO7k5TeNK?Ŀ$?a㜻ڢhFZ֢\ʴ|6E-/k-:YcEǾCi=~Xt_v6FL޼@-,{Bg0-gՃlyFK]␝{C|/^Wwɏv~0?Tp`q~&{ϣیx-7ltKNV2B顗G sPc H78,C;%PbE⪽#{)V۶Mn?!ؙsje萝hQDvf[ Iɤ][o$2$9QʹoVZݱ7k|*ܫy߾EÉ1'RHwH>H'Eg絥HO3|j7uufXk$7l)JT4;C| ʱ8*1T|تN6HƕI!w 0t"Fq0ćJ/k fB,DV^ukRo=]HWB>& ~;DŽTYpa:g&]XT9<+{TzM/^C q:n!؂ːUGaqp N#H8TF"`&dcq/*TzA0؀}8\ãL\nD0̙uR-!i Ope'}H a0[@Gjֳ. ᆭA*XCH]kBH_[TЃ{TzbH3H*sp K:*2 \ D*A"uzp{#PHU,DV=A6Ұ7 ΊP hN)݄Twpg63 k[v|ػꩽr`l8fgl=px -7UكհJ? 6;k İK>@bpG;xFvlN6ɸwj|]TzC; f T1"xi /@;>%ܰg|Uoq5cg ^[W#kO18~=aY; _5BSzJ?N~X5@;6|D>5bQ Njw 8JKW}'l\lTzv8vCЄ3Za Tz/ǵF*tH0d,KBe~HvT~pKهpWUy8bp `G+9"a7upfsЍͷAuKDX[g#{a[C+#}.8|F,P& cPS܂RGsC*.oJGX +sCjߨp6p.!c ?nЇJgB9 H` V#Pe JL7w#R魌&n6v l@*} 4P΂&&&WȄT +# :UyĨT~ U#(&cS Kp gK?G1 {?ۧ"n/Ra>Fx!C`U_2s_XEd1pb 8@7a4.WW,CbUP`cY_YM7m mWW5Y6"렚<݊vc=c'2/YYo)nNʎڵ1˺%:)r^.t1pssR`g$ r 8}Y^wͻknN0 $x.mc4Ӭryކ$ĔB'`Ԃsl!zXO{8FȲ'YEz}Nsf;y4fJMr[>}c/&Oz*G˪p!1̇?7d{Pk$ , ~BrB# .ݻ~ZtRue8r!9xjY-Iʘi;?u39b)ڮGNpJnPm29`BC6{G֋Nv~wۃNCɊ|!10䞢Φt<^_Ⱚ|ӀgpXLrU~:| "[BN;C_#ߴNu5Kn}iI'A 1$XUܢ~xb8=[+zI$#>"sO 6^APtErH!$<.\CYZᄩj\aŲnr +O\xV{dYe6@Y )$ٜIX~LU\ m ~ ̃89㏘?Bne>8ƙAf0#UdGrsc}=z&8.QyX*hFV&,HNH lXS,A+m_[mfrH#HIRh`N^jXt:1V7K4F=uPR,+fߡ8B3W ϱt;yFB MGH Y ,S+,>v,B $x '3XRdN4gx%~hc/]5Lc:ދ x~Xg*x̢ Yh:CmU| M $X{zؙ6'nRC'crl꒲|t;ƻH$RH&*$X- ;2lZ6;sGC*ys, 5͉?h3+gI'!VhrYtUs7Id " $X HV;4^ke{oP$gX(GJ)یwI)˂vd}B[פ?5ʩZ"<M&Jr?*>1+Whω#%>x}zX}x]Sm.$3N XjmbVw3L󏜔4'Ų*? 9\'FۮHGkMX dX_l,H< /~ќt¨3$䤑3rD>:$5_EAmLc@MtK2ο ^$]Ɵ9Az61?B0.(0"͓dȋdިۿ,DM[#w8x)%S#ka׌;QU0eh{ߟn#eY0Oϝ>.j'x)d}IN)!'3ӓNt3~$Xd.}Bt|jy]Be}s1Pԣ'x8< v$foaUМNG4ef$Frn1jO'J $x* i45ƪo\gkymw3v` K 'Z$ =:z\4eB(ɑ%D<e)8~c!=˂d}oi\79KK䙝wfޟoPurې'h E Ad%ɔxMŤwWd;+85H)!.;`H`\fLo9_zѬr38#ҡ>y0oVRQms8DFSEFsiowk싸S~!&9'L]0$ЕYM v$xM5bLvTn8A~ʲy~ꊙI^7]kbkURh!JRZ L/xW"`/ #$L~nxEJ'hxUs$VD LQEX ҕgJJQS6EST!E]AQջL)VS9E]\CQ"eeMQSQj( ;:aOQr^kLQk\(+E=uuۃxQ-uh+EPT/EmNQ(/-p}J=i WhVf %NJd.줰EmX$!SkrwlYAǓB NkFﳸp6y_ `Cr&B< swVpFgjy(u$$)^a>Hen g~p$H!ay;z.۽3,SKrNsg9=mN_w$g:_Jm$WBI!OGboʎ/f:74vd;z'(nFl/'`<ɿ~"%|OH'C \$ة D=پcЫ+ ^s7&u/T!qk^g$QD!|o>ia_GO}4`H u}"jfl[%RXA5Ipc_}b^$9HkrM_ήJgLќlIR7I q)}Sf:~pJu?)p%ø`G:7V.Y.PP'9򤰌kU)B/6369k( I?$Ǐx~Nx^$(ۧH;/XEIDm :ݢOD躥`oִrr_l.8$g')w -rq5nN:$ZLI.yņ$"c&]p"N?vrGޟ9}Sb̠uoo wWZFH}M ?ICE$JNܱ؛E7J4 9$I*#.&4Hr J$;e8C I%lxh[$ueƷKlr0drA>0.k&Ǭ4Yy!=P >?$z:`7`Kcq]DS3gps_fnln?"aW776vV7YiLUhqsW079XcUi,7uT~8ҏQ^UEPm^R䣨uE]㧨YXJvOD>.eQ-t(0Fs?SHbkbFrqRi[;Frr1]\&Sz^Κn2-(6-*⹚HkP֥PKxDc0tiab/armory/databases/leveldb_blkdata/000008.sst 8TQ5S-3TRdI)*EBR,lmRJ E#%"$Qb-B3Ӣ9|}滿{{$b^Eor&O*gǘ7 \8dޔBՂ&cݎ:t0L A21YD̪MZ  [ A 0xE.r&/o9)eharF)EZMGSXȩ1gJH;WCo,{tUY9[{X`4-k0AT~z B@ 5xsL*5B`,D Ñ$UEUBѻjgl!2>}$GPsNȓ5b&zx= 9i1;6|#B =iZme2u~jAh[<մ_HYHY08h$+9EFf~"S; $\+O{~Ԉga<}TQA6JNQxrg>ix2#.8$kY 췮F#U"4{A:@_奝;v'=9/qj׳Д+3JF6daVhcA7q<;?2oWA@mvh?ф` /Aiբ#~eQíTI"UO ȱ+SegJƌ ;8sq?aNE  ݠË]UO \kj9!xWEiAN5 %" A\%lN$S|ƒ-#fhA;}lk&ӑc=S/@ ܡEzӽoD^BmBM3̹֢xg[Q(CdmC } a-Px"$u y%℗ O3 dC۾o\>IV /0=5kK9ra3 "M-O랞d|tW/r!xsN4m=K?bܒ6°*|ם6. Y)j@0B\<\)2Wz#hY/Cr37Oq6Ԅ: shGsAMNH֝ko<>rP x$w#_;şa;Yqq7kɚ$C?;Q; YC"cTU\epe >̹㉝mj%_YB9a9ð WEMB #i^,aRp^@Z%gv!= SU>UAbLHjqXd !3=̹'}\tܫ{DPtڈ\$|Armz/%:)0L*K7nLpr9=У_/~4G& 4e?*pddsZn[oVHQΡݰ׋!m"Ysk &%!& 0،g%mJCZK㭣'֡8ٯ*q?rmdf98G6: AOcMB-˒8:VB6° F2ύmR ^XIF 1ۃO L G\Ý!Ғqq<q.$6@ =dž=iDdc5p0p:~ح+-iUPƪfvgH0qχa-f(a6YE0xC6x|[Ew32 C vMwx3بqgտPKτD'[0tiab/armory/databases/leveldb_blkdata/000011.sst 8aZjK%EB:$J!*;DE"JXGRHȭ\J(It8rGvh_v<w7 6 '߿ ¥3/ܸ.!$p2)yمjeLOD:?Qgz bn8M6 1,)AZP, K(b1z+lr>-^2'R -߃jYabWV^笒5אg>}zк/@~҇1HBqВ?1G+,%c&ၠXf","$aL>E} pA 48Ī!1U_]3^PM8ֲ3{!3vV>BS%ΜObi/uE0q<\\.[g[Np>-d@]9 BV̢)A48M 3e<_Fk AKGP1t$-O+j{EEHɁw>7Ku2HPs꼍sdqnJbJ=QYS!GHq7Q+U\kzOP]>ƧEWƢsć[H.E@0*g}:Wr]2Fqf mxM qQC'Jjsh۞YYhO-~#ShⅠ Ub;$w?fTQHHx =c x WLGty>zѴ3Hjf@z†hߵm_X%s[Tz !W=%8y_QMZRBu*̢@RS߾Ca(C95!(0JOn!TWȒwQz|b(~˼6ʾfa##釞O\rdJ;P-A-TMo[EaMxϙ%!E葂A1=^ 9ih@P 78/TvѴr(0c$Z=BqДQRt`vך4Ch4͂Ok՗vy˴56CA;_'H>~r4j'I3|(΀o6R5y٧6kx|AA#Mi3sU*kW A T:ӪLkWT[@FkCEShS99 笒5=G7ZtؚP!U*NBa bD&$:6NkR?Z=&(cH̳h)mХ6aht:-G + Rc>VJ;>b[ -1J$yA[aH#L}˒q<:I(Sd?uӴi_t,U_%98:aS Sypkag0 >p {J82K(a_viZc.8, pɆ{臝up`Bư2ӌx1,qƏa-f$aB6YE1xC6%~gh"6~oXU,eʓQ7^'iGtPKτD80tiab/armory/databases/leveldb_blkdata/000012.log wG[OtոFZ-s”G׎{սz\Iy@F=}25#3|[WTY1ҕ ?v_VvrHx }zP~Tuo\d_ӹG#F),AGDm;-?;Co4hvLUY#&& }gwͤaL3gru9Qtt`KǤfuSs}y{LŲIWZZvI|xǟqnVdIHQ\٥LҪ/.z?na}F%',9VL-! KXsӗ#5)jJ1~ƽ+1/vhewv/a8ߩw1q'WF\9EdӔ[Os.L8WNJbki'<|Vx?\pՔJFIr=zcHAn95LI~L}n{{;_BOϥ;6,n8?h}RWwRrGCz\Tg)9wӘ~K53r 9exWdm牙RʝvV)\цW'p/ZYmit4*tСB')tB @}@G,䤕BiǀD*8jT݇gŬᏈ$NMҗI;%5}'#}kO~gk_tV*Oi~Ų%S=?IW'iAZi2gQ+_-_ie{yM8\|qMUP>@\%$Z#ޥ[D\#ui:RQC:PfV7˅\`DgP>@\%$Z!ޥ[D\#ui:RQC:Pjw{\@$/ ʄurRtgA7 ?u 97bܞջMy^'2ĮsGC rYf__ĥ PY֥(' ߂>~@K{YOtp{g yG ֕Bc m  .EBBa0}XFtG/.]Pp`JhgOe dVEfdܻ\xqe<~ iRoW81sâU^_quP5g^2 8-w;}#FJS]VIrյɽr$t7U3.*>`x`b[#fF:mmõOp=cǽ.$XvS%޼ccQ,0!02lNŔW/f (]O2[p+p8 }|wJۊM'?JK+H∽FEny}&Wm mxvF̳Sוv=U3LwսUXL8TXp;($7JZ>ij),>sd&_xJBO5iG`df~|][ _giӉ5yp#_v^GzȡŴiގ@!2*څ hΖv.H8nq @Łt-[H8nqv.]8[8 qU@　4h8 q@@　40` 8[څ v\p 8+pW-኶4څ o mVnfh.+e]Xbދ5^ o o _m~څ څ]8@KpvRiWkR!IC8cC 5 ]tc:R?.F8}A[2 /co8Fqr\M%ΒpGxͩ.>PSiFԬ2|EU|}D>7%/ᒗpGje&Zn=^>›{|ܧcMΕ:_Aw=;`{7J>MkJ,Ƿ\wI+p<Zl#ʴ$&PZ_{z{gc9kmsL8$NNX;aJݯ«O=|˹F:356FV<9'R߯)O>}:۝^u_^VQqFa˷uK,}FD @UX*Ghӻ5x}}aT7jhY*U{MtFD>8aw)ON4f^S%:.'OlN/;ED4oW"5ceuAo{?m~- ? ~@%K՗/T_P} @%K'~$S~)m?EO@?ESO@?ESO@?ESO#$F? Y'+W@^"zEjH?v?iV=%Q,[*q !iD J8=qq[$D $U~T{gQ$UX$U%,){V^;o()֥ޏ~\7/CPzgBb N'%8\TKCP936^68b!o٨|#o8+wkU65'f&ݠu {q[H|#7RVFY. d]Ⱥ$uI @%KY. 7o$[Fd+I$8VJp$ I@' N$8 Hp$ I@'$CHd H7'$@OH=!zB %zVfH |#+|#|#eo+?ƈlW m|#F |#Fo$6ou#FJnCR7n,+g/+ތ'.JEo3FTܾl]Dݺ%<ɠn4EϤ"NF6$)ioҝvܜ[S]Vp}̒)΅){ܮ(vhXC oY>Xk C]iumuFԍbK(Y[ Hn) R@tK-[ H@(QlP7jo [Mɪ)@{SMڛ7ho )@{SMڛX -uFJ(P6lB؄ ` &MI[E uF ꆶO+O3ԍzԍjԍʏ*{l#:R7]Q7R7Eԍ6ԍŊQu/uFInB, !qak:R_.FX}BXUPg!,Pna!2dȐ!C 2dȐ!C 2dȐ!C 2dȐ!C 2dȐ!C 2dȐ!C 2dȐPK τD)3-tiab/armory/databases/leveldb_blkdata/CURRENTMANIFEST-000010 PK &SD*tiab/armory/databases/leveldb_blkdata/LOCKPKτDp{)tiab/armory/databases/leveldb_blkdata/LOGK 0FyWq!FW 5 fVW&Ù߲XP>{˖ d>}ȟ^̍fo\yck_Yb۳ \"X_Ys|) RPKQD&tiab/armory/databases/leveldb_headers/PK%SD!0|P0tiab/armory/databases/leveldb_headers/000003.logw8UcFBfV!Bʌ"d-+WBdf̞!3++$&%3^vszq?{sλ9CI‚/ /1$\a' i)~wI2?!\f ,lTg߮0c@pzlǔT9Jf]*9ѳX#֧ecײup)k_c>t臕xfԆG8i?T_N{?i(z] "!?c%΀aQP ?8<Ҍ>e4INj}~BTA"vK}lu"Ch$O~pA(R- Lo>AiKJWs Z3硼X!g ңB[ a肾Gwm]6~/lܰ]mE8ΑٞHTx``wou8"^S^qߟogF'w尉\F4 0Au38:K5Sg~F NY\S1C,(4\뙏"Lw ՔJOM{j9@Rܽq %Me3.~ /l Gv B194z ِ(]ZqTEpruSvǝ}}QW73?"BoiVo(Yt } emq+F& dPee&@#нF1c#י%^\ZR~? jRfLRv$N* \m&-' 2(@S`'lUEW u<~7~E"hbjVIxK2k} ^$o]hu }@iPăC/\yK䢻T}L.{N=[r)2^fFƽD"hL6=*x"֭rjN1*q2YGbW.|+_sdmD*M 6WS{3K6 )LL2B_eXp4ЊvOlijcD4#B|k؆^sH;`<Oui\U@;Mӟf:2(7A@bPhmg~uÔ!-[R&RU?_a]!2 ʃd|F"p'eV+y-V$YȠFkGQ@Do9j88qHS㹋ulruUp4:IessHbҌ[2ˋƥ6"B|RBQ ]޽yO;ͩYO9~t0L,gdP=M@s4gnC%EPYwwO]A.Fn}, 0)*TAhԜW>u"g)~r+V-Jq%R3}-LȚf2hSU 0}"Cea5US2I*}<=(4\~αmzVlz? >}p;ֈP}eyxHI^Ms}j/Pɱ0ۖ+ 2P|:I{?iigj6rU}z`4e% AƖo7Dz1ݠy_UsT_2`+wU1~ISo5!,SE6(g@Uc-x4 ]vJ5{!f Rc>=To\n6s6).%Fr * hv t?@Fxʞb._ԝS, ݳh MK1SYcSPh=voU8_QaTRPv!ZHnHӄMAgvሖuzT/O @w#jږ~֤%dd㳅FՍ(4\n%mqk|7tď&gVc,jΖ vw4jfTG)-o׶ٍlC@}91|}.Ŀp8ZR\9y?u吝@"ht%i{*b^\l)z.XI?Sވ;y`n^%۩/^_6 KC4O@Շ:Y('߿*#,Ү3 | # AsMϥ6DEՌ}6|Fɖ֎w4ri*κĶw=m͜ ݑʶ!]z|:P<)) իEo'Hl\䫨VrQLa'}AyشBEuP| y7h}Û]@|+A+#S@ez з0_͙B:3هX^6IM_vp4z_vi{I>RYZp[ģ!p_.FkxVԦ#R}Es7Xߪ^V4Ț'p Ƞ,puZ M -} if*8lU>ON;X}ƯBE'4> T|#OiDSD]i:(uLjjIpObǶZUgs,D\'' _oo$3i{yخ"I@[![w0Н fBE3 (U0^wra)f/n1x%/G/dPùF@4 A7أ~$0\H׺rܕBv\껈}F-E~]n줐P砽_7T?)%bpTה.ȠkE@ Хr񬩢x--Πp4ZfStBl *񟯜3Zx4X0AۉⶌC\S66n ؏KI{cw/pE[Zw{w<5NްD.F{?j?hȓ?I`)]oU_SpڝtNex[tdnyByqڹ(Sz;4"!?)~=ӆ(u2EBA[g: ccoQ1CjTA"肪p|ޑRLi/IQPjQG=N+JS {2a{I:<:_NtRL 1К BE7x2X Ei.Fq!K͖=d yQ%hn]j_brϞTY=PKbD I Ew݉Kssߢ,:$ŲdQh#6JcZTw.F[ [J$|wcpհJb8jkl'b2vW < uKq< AEm%ZKl^տ|m_,[=d@R _}u q,ZwUo2G"Tany>;ЦLkŇ2ʦuWPv@f#@_" 1tL-rBo/$F}A"hV4F&̍mf9h;L$y"< *@U+  Ip&_+J0]\y1W)ZJ(4\:-1$PZ͕M0xpQ)DHNX'?,*)`L #yDU2(ӗ0R6+l.X(;Y)<:sEMf3nt=75?cG<"@0۽IϻLfO>䟸et6jB) tC :3gor]y@\Y.FWDH(3kb)orڝG%IO^x1bQߵ~=r1kidϐ& Ƞ-?di`M͏gz)>QgMNs)P?9TYv]@[]hnߢQ:Ki`kb ?# 4=.Mv;ѝלwJD27 9BQh\Ws8!VK-:4zh͹e*&RR8Ŕ;>9{uGY,Ϟdu3]0K{S7:D s!}4I I"h_}>6U5l b\%Z;I1?s")DžjHneӡ_#ԝsG+uC N)h7 46@VVЅZ0ol=m{BI9FBE;Xև$5;LS.TI_;xx(1g}>C 4E߮辍 9D݌3@w &=0-^P2%?JP2?k=;(4\?_n~K5cYsB*(Q*^!cutsa6 1O}FL*Pԛ^Aiی@|x^'. {q065癳.p4ڌ$<NK֋pm4,YXl_Pdشr sB^h2}0)-ws* gá’ߘePh]X44duIao7uGٔbV|ե, 8w{ݏ,[BR Џ1LЩXǦݒt)Z=ؿDy `8(qb&6'zG ܅[tAC$HkW Z}O08}mMզ#?B|nԬ&?It;+AuV% *5PQ\ң$oy"2(ﺈlv:z/w7qMJ CMInFafOR}Fʹn~-bKBE{Gl)tqVAdK՟嶺|fFQ'kǟqį%dYǽLd &2HCA P8f( !ʬCmPOPhJ;Bw;mDb?ӱ|g "o۝)!6]`G6 @tZ%mJ3zBZy2UW`L m].FT/U]$'wsҕvIw^!B;v7M7]8 yfEa~y x? Q8~0 /@Kʦ)* diԋSfɌm-E3]T_*{x&+wim>dpcƍ{jSZ6kτ$i-Il,@aUvt&LyeZƨRzp4Zyy3qauiM yU@ "$۳,wlUg`+/N AOR7P[ X cZꉃZI%bt=[}RJ7(4\o5;B1$+A0t ovńGaHSonۼ\^lV,s%'^dCȠsSk5*znzިdy\O-.FkbWӸMڗ$)?-\a?QR׷4J1 L *: 4C?("Xп?+nen\;[V+0<'t4YLstV8^x @G">:>"PW\ch!fjU%)G'ɦl{Ɖ<YS^jUf[TQKS@f"Ӊh!E"]xPwNf(|MO/b+ҴYGc^-r8Gz@1!R@4\Z]xX_i)]*U vp>:wywP\s<KZ_~>R 6*s?YA rb|GƷ4ؒKmG 63+b+btNsv&H׀ :&_{Eh'jJE$fMS$Ӭ ϱ"Bى,"]{5axe9b4ܯA!E!!?TqGi[B..连 ;CͲ&yǶw$}yEӖ%L igO> 4it):nnёJS+:;.@梾X߇5"holATOZ3 ǿ09 ӫX7~G)0TZ`iQ񶷷X>sc?}A ȠRx~huZ;E 恛)RoI.tT39p4_u.¦%{ʎ{[i3s2sM:Y zb@/Gl@W"Џ>-dINMO˅?2nw+j}sZt Ir^!XU,[/S^jG<\Y]۪fs7)CMS&&@Waynz&˹'|׈^CAuө1SQﹳ;[s695}R\6Abg} p4_ӱv9ڇ&B?Pe59I{AjW(ԁ Yk1asǩtmꔮ1kbGju~sg*>{A@/Ly![fhev"cWϬ76 Cc@)Z_E앪@4$Ė+JLݓˌI}tutKG~{ +2c ]ĩs݈fhs!g$p$*VE{tD"}r)]bIJ=3lf+J)/Tsh8:D:Ef랚 -FxPOMK{Tbv0kP=PTݐ Gw(4\vN¡  渾o0"q7kz\C$tQ[)! ɿʂ)g͡pR^|WMdЩ AC@-BD7KAaK7b_Pp42~[[y{STLnپ"B )l.~FWS2ۻN!#/٦Y_2O@aZo61< TO[GWC\ w]N1zϋO ::p:E&'JyoתnE$pȿߴrs@oֵT GAݜn@KќrӍ.(I"S*;a)9p4_88!>ytz803BS#ۋt?Atr ݉f{1U7mHn,tqtEO*;ځȖoQ:?$y彭dDrv:AKuSf>?6Xl:5f٦U4. tbe i}C;%S)=o>8p4:rQcmץ539\wͶJr<v.]>6LW\p=gHOCu/'hSӿaxts#wZNc7$)6a-\)+L%p ^R%)pȠ~j;0p4m`lumSz˳.~8nxV>%ޘg\Mν%,&H4mNeޮDŜ]hXK*=Wq5=|g B v`O4({7 dNqn)e 1uޒW(쌌(Y"+;df%*[fH=Kz.us}'g%4>\Vj(j )%,t2@+hBV{/O@gsWq#8 rb"fx2^a}J/a5sKJDiNSxoܹ<Q#h5'%\),ۖ|C L4{.WԾ!<5 Lo铓B0WZDK5 Wz a4ZA?c)ѹ"أQ;!s5>3ѵA44ON 8cOOLuPtjkMxL+2}ٷ^Bnr.,жI. FWNvWFE4פ6Ac#[.9Ql>'q<ϐmi-M4jd #@o`4):AЙ]לe~P9-Mg3k - '(RI5?)/MȥrӘ˾R@1u @r:C;cz5#%A_Lf:RɅJgGǖC: 1M`FO e0wDZ;@ hk^o1YQҵ0ꝕwQv;n$SN!/rGg={FfL~6~ dMnhi0-qd iׅrD1| bް{fd1G'|s2ȒɰvFEt_{/+ؾ󁂩fJn,Qۡi m'1e9ڶj )ϽY4:81,@y5H,p.AzAi(+$ A2 -AC:\nZK#x}婑jnlXhr~ pf Ao.v֪.Aи~),>xx+0KdVH2w- @s`4ں2F i3% 콍J*x|B{4OGmiΨyZY Ins?ӊz@Hh.,$@vh5`KUfrNKE)3{ׯR=*bibɜ@&h,t6:Ӄy?16#x+\6.y "gX^ϛw Jb ESۡܡoňJ K}6Ё3'ob~D}@E>,mtޥej>lO(%ˬs)鴁hk!iM;s7=1c^u$;O $~@a˷ѯI%Nlٸt7S;|bh=\{;g! OM_sΩPUq FE;Qg9 J.01pQFXh=R &HSG[gmp䉩퓳1}z@r }>uVB4FEtG yBqBYcC6.'mNuhN\բϱ|R^Pp$D" \Ƞ~ h^`4ZA:Wr,ƦgZ3pβ?)$J(_nL ЪXF "WmGi'jg S_LXhho0-qU >B8̢ʻ7#|;AzN|s"!5}ՙ췼8Dqb^鯽@hc,t+@a4ZAֿ)#8AyTa0+'Qs'& ){[ 2giЦXhWFkq"WUS`/tf﫟b|\9q׆Ib!sCddh2[ @a9tF h\8.-Mg~.py+b}]fM ߜo^{l]m2xe>WrE}.k$s~>AvWA@FEtQ5[\N rd\B·\Z~%\,'gw^WޅQ?e}A}E9mh FE4Iͤ/ Uʔ+ڨk}ah<@'=m}G R1Ƞ1oBS4ZAи-.]M2rls3tB7C@ܕI)A=/AiY"Z zcha"CܮAl) Ydvv/Ik-\f%*^FەǛn&@pĶ @hz`ޞjvVȋJsY}ɖa>\vpHpASR hba4ZA7-ror~8RIN7!X M r$[eZ (rvBh0-q}sj,QPBx")Q|2C` mȠ펅Fw/^|ZoNn=ƈ%V#F z)B4Z#4Au%UZ%ܐӭ7'U;fnnt\MZS&?Hu5O~N~!'=^]p nP:!hա*(Y3X.fVv(qȽid=@LP оX;6a4jLS#QY^}4]R L{7yb?|6٫.ќy ˕LvBKu|K! [6u,F[h/R սf9^B}eQo'G97uZ,7ƺ'@5NXhQF{HhFXXf܌̝=tz7I#Sdsk·uߺ2HK+@akF i1/a쏮;o*O+G6ۡ/h_I>ky̕J'Irf_2Z_E 'L7]] "zCM&dyϠNjO?_mm|DZJ-:.)KedG0h۩@\@,47@=3hU* 2m1 -a2y*>/|Voo֧̔wȠ h0-q9 SdNiX}|]ָWa<"bø !2nXns p9/ї 9q7PhMD & Wv:x"V5BŴK qys B4FE4ˏ=V. ~ 7327ny)2/L/{ )o3cQ crxdSV@cIdF T/_vAwhr;lJ"˥$j6lO5mVg H~1(H5ɴ=@G`F h\O.|>7oDOP e!`tssaV2 IBF?J)SC:u&w:hՀaޙ v: ֯E cqJSi <ǝ: hr`4ZAxx.GtOyS۹CG$]>`rEs Z ,?m#,t$@?yWv|@Oۄ ,R/h5ȩ3]?IzsU!%{[..Tó^ no4t'@w\.:E̋(8ˍgIwmy_jhƵߩJѡj]xu"K}(J&ciC@9$, @}hM7KUkIL$C;Vd޲wh|J#br>vϥ~5!Q,q0K5>2Tz'@?Bt'ËI Rc7)* BMrjza4ZAYhx1ZRÓ P^O;ASͤ2ƣ hua4ZAaNXtR,|n[hi.X;v70hqw Dv13,@5ah=g0|:υڭيIb1 ѯ7BYy@qRrՖM<= dOh=0-XR ~Ua`AI{u-1nas_U_qUWFe7#4AE h a4ZAO]}<%U1lotd\_-efTdwM2 ih_kkWY-[pN򞝖AT'=0J 4,t @EhUZWAиnp|#_ޠ,I2|LO '+A:] }j^hƵM}E8Asϯv#!,va̕ d_@a}F 9{S+(lj'i)}.,Qotu;D{n)8~aOĩY>2q>Ү+pm @2XpF+e"Weゃ1jfA~4Uآr`0K[z}a@t):ѺhƵvƔJh~ғ#㷤䓧%]*o=z>z&TxO dZ<@cI-FE4M%>BD^ |WNWy wKdLoHjt()+϶יZKw_>)L!Ư0-W={MHu)p7Q[DVv(U=xT-inO` nT-IAa4ZAt9r ט\*=1TV&gy7 G+C+- dze1@`4MABRts"-ٷڻ[ͤC9JUcqZ֔h`zփ\4sp LBEt ] h`4ZAjwHWҜqxWHjAx!jh^>Śxm h-hzzHh2WTެ`LW)>/ŔgCn0I.N^.sKXkG1fPN2vS;>VFE47QR=g8[MT=V,9K">Js(F8ܕ]X1F"׾Tq'r\P5o~NJO}N0rꅹҞQaπ ~ {={ 귍yJ q{/\@h"Wz4T-If^OO?Ʉ! .}ASLt*1huRY4݉"g4ј3s:Dǁ١!ȠYBk4kF h\ǵeܨ‹) :__'Y KAMAo&A,4@%hIM+#dfOǻx*pm)@]Xa,+F[h-AM0lJ++H^JAœSObCC &=g4ʅ -PQ,t:@-h՗42uL烀MK&e }z e]6=Yg=Я]s,ܫ4&<>FEAIў|.ɤVyd ᅚlւ.7 P$K)G_3$[`n.6@X.F;"W7&Z+s{Sj3ꏿyF ;;>g= dP=@B4Z]AtVJ|YƥW%ފt㵰Sn7f&ƈJ7qEswӇ?p2(K}'z]:}-Pb i027sE={~ {{xo89ҵvK|IZ+>|XzUf=:=XU)h  .uGuXuӮ!`eʼ,WkG }&x!z*٩N.5`;SuPfwRvmӀ2KYZke?]\O ( ;)*9PwRv?Ku(GqPVvRv1RC+*2Kj'N.5_/])h .oBF!9{;qlrZ̕}}UQFD1SN.Owt PvRv^~#@;(!([PUB(F[P1YrrjBu|bNU%]c(= f]r%JPh, <?lSkO{B`ԍ*+>~ordecl]~\PeF6?,b9(Sؾ<ЕȽFu[]6fL\K .a!Uo*vdS][}0ǢuBX '^g@!V0򊐺:e Sl|f13vڕ;ʺo@g9A̐)R?go };nϥzC/GPL}V׆ uEġ4YDa] bz#Gt'e0  N.`4:'P@(M3gSEKNi/Z*[]+N6<8? BK5<|r'en%t]:P3(;)tqI٥f-BKUeeN.jZ4ڝ]j|=Mu1Ka`(7PoOrlZBUﻎofzēc.m窪0Ueڋ Љ/GYq rmU#\*a<;Jnj:Z$8Gw QzPo0u 0Mῖ/u쎄:^gセȠ [m#ex!BMʮ?;eGát^%[~?^dPt%)4qbPp$]&|`5z#S1 ~7BMc|%P_"yY\䍐Q'EDzc(| Y$q)h9 .D<||9ܙ-by{?~-r CH!;.n?Q]*noq PXP>mnw v"*zw/0u"5WIx5СXHKW=5WR]1Sa$ r)QBUb草UjÉ{L .W^k*XSo[v}Z-2aP(\PC= Ѵ"7EEBama?"T+-D4 .oҵsS>pe3nrC\8:B~q䠲a@BVt?}2߳+_Ppy͊k"z &kצ >hN/F(PygG=c."$ _x `(,i ]n)N4)h#yA+*|\1zk ZBWoLߔ>dU,cJ\6foBP$vRvBGi*@÷!/B{DW3T7r"|1ctBI$u׿:wC)˼mZ~ӷ}eEV+lQDPaV&Q.m3w\J١}]7!_~[e"l yirQN=Zyz9o]BZݪfge}gnX/# s(DJ١bAf!VhU(rHi/W_=ChD_y&eo5+ l7X U$e%0+G~HW\qk*D+kTGG =q L(׶Rvhkyk9DQKLsԜ҂(H:gG;;TIxD^Q+/lJyhZsra,E# ,B6)6^z5B%$ a. Gm$ T14o^\+\8iQї&a;hN0GUh>X"}QMe{.vif& 24" VV0E9y*Ss"? ʅ(ב4oR\TY4qνoXXw"a6 C]ΜQTRvpIU?DQERN9 Mtb%-.ws%LA[5a^4]1r41Ar!l)A YV=DQCRSмqxTӟh&cV7PB 61%AZcJph\C@yK9P",&7`.P&AHvӳ7k#̧d` 3`h=kFN;"J{u=ܣ'PK?DQGRh{j3ik7s9ַ-{4rU9OT`h.b# 85z 9oOQ4 4FwGď|.=@J0$c*/{H hnk*B{Q:FTX6/D SмZk˟t:3t ;{a# &yG7b%6j7/r"/-8X杷W=Kb7Ȝy"'gpc'C+A-$e-0Y#Vr(g^lk)ëLÏTQXRK`/W([);iD~rg+e֜P(:);8*0/Fl y^ڋS*2"4Ku\ 8|=#]\b]lH3BZW9QRvpr=}LblZ ye$,7rDU?>>0L%qTqw8%3p+eVM5P@#$Ef6dTВMWP?-7u` 7*iNMSw9,_O]J5qq?r:hN)bP|lKqS]q2䣘%SмwtpMT輴`l|?Ef(nЛ}vv )$u6ھh*_L{0z LAڰ2W7sYJNioJ_})Z" QL4 c(sx"=CJ=Ϟ6n_;IppICZ*PQ̑v4/+.P;e:3Sl^2Q8HiqЎ\A7DJ١=jI8, E*XsSk(\JɆ)hJV;yGޥ L^9_˓$qse# G D~X!))hдJaV͕u S5 KoC8A7 V27f+eٟ(wRvhhFvDe ŐB{HvÎa בN`"\(Pu2ĸ5ggt›8?J=,pU pC$~+e(a͎OQ9n9/KY &smSмFJ]:\G/f4̸ͪ%^/٤TT BG$e 0ͻv拝S~:z|3+FeaB8 iDg`̢>DySvn#MIℤlyZ~ڇѷq³y= QܐܶzpX==>Vxy&>֮ SмwnL8J|vVmBJSg'[Uw mR`e](T=Ĥ<4[yo&hQ!̥ɷri@ _Q%Kd œ%!;ݾjJ=3B̍+ͧ,7[6jpy|oCqqӉVa]2YOvDhyL. ;q(D.G}ߙC}ߊ hk}¶)t\nG(<=](^H cTڀ@o7}DܭGgitjd)hsٵGOL-g&Ek^bǢ[B6_HoT_$AHJиEˇkw3^循|ds~j m¦۽G^NAWwԋgm),ln 3bՀ(O;S&劲x (Ƅ~k!)h^3Wx1cqˮS,A{մ+2r :AGQS̗_Wt YroeZ[Z)$v a [歨$șcxbkPU.} 9:rY=hF )򭧝&γqPqYw=;+0]F-fmleK?9 gZ~/VQx L Q|24o Ko,6 n4Hoy;jq[SۼXxDK)OBD!R Qꅒ%iy҄)5 n NZ4ݥ?tx~h$?vN-gg yJMJ2/ޭ>8fh$YB1+'u[d`LAI_PZiapdZ={QI+3 rQ4ktnB $u0X/x$Y ]dɵSмJO/6e{!<=o<]{Mo9QbKœou @0"(QH I3:DTg7!zP81miDb];_ft("e@6P{DFR\3L:Zu+O̟D-b^7g{bJZ4"5g/IǼ6/(yX=8,I )翈vJ+Rq$o4hb]g49y|#J-Η$(^~j$HG[lPynS~d!mM?lI➂zIԨ?Y@\9zevJR();sS(\#>.`Noc7k?TןN`)h^P=+_E$͈glWc^<y=afv舣^u g!%II~,9Gp6Ω%e0{SO=ƽVKq-%h`|Sc?i<&eo% I!1|+A4g畿t?,12)h΅1 KT/r8+quM2zl[K4PƝT J2pm7w<.*B:rRziE׃Ƀ8s&b@~4DIJ١%竾!J*%w);{lcDV@Biq8ʡqXJ@`d:3 J:4):^:YefV0SMT0͋7-8':P![QޓS-9G Yoި<@)Pzd )+>H5 Mw`n1D?@yME]zqBC\>- {56|z9]Q%+ly{gtD'o(5h yK*NX5(Agr@{_+Dy{+kžrC,$}|*Yi9B$7LA~QLQpSP 7;xh 瀀(DFR܃O6eDt@o57㺹|a Wfך dW ]mSl5r@yDARN%|}]-Xa="湚 ` OQ0]1y4I#*7|&D1D/I&t(0f(H ǰԂ\w.*V?ʉṳ4?35ZcEֲs2t} v?O2H9P|eD Jr\:;qBѷvtƺ"Z0͛?SC)=6GӍ#ߝH7+A?ZŒLBRxI=#;4sӆ9ф\>~X)h^c4-F{ra@PV0R@aQm4xmy$ _.A0ܷ*^yueC~lދ b Q Us!{xț{ M e T#L)hޔܞKOظ]JgKgM*eG]B@&t?Dypl?[*.&H>AGD` ^@m[}ޫlGsu/uNkYؼ.@Q `)c6:edTUokGa E g=X'v]s-G|:!|qtxY(x JklG,'tIy@eZȕU=V7|)h^Kᢕ)IDoqsEzFQ',竽6ތ/40^I{ysľʱcioU?û:kKv%w fߵ >h./&0c5ARXؕL.3P.K3r=YG-s^y{MݞUd;6crƯfhu6D)AR8}^;Xڠ4.h&K{LA]U1-]+9bmCgjDQwQ7d9Q")i>=Ol|2ZϳpImWӚO{-)h}/J,߫՘"ZѝAē|?%La-)RL^x9޴`ʖu(| J98Ls>^T 98.rMy?Q}Yl3 Fj1ETŹ!-RKGHr24^(H i0չ(3tf cq73HP;MheԭbG!` BJ$e0=@_%{h;w=VJ /1\S$BH}v!; QRvpWI)3)h\ᡶ2Ex}1} LAtD+Dw#P"ݖnǾ`FLk7 nRLcGmzUke0+-<=\,`I՗L]}>3I8 :6ł{=bd>|4E72;` ٣]5ΔWGivp?vq~:Q3*K[ݐfoգt0{n 2zxoT1D#(n|:M|yEASWМA4!)|'R~ėTSb0[~Ywx8?x}q]jqq5Bי pt/nj0Qb5 ]mwUp(oq*uLE` sa/+Y Aq_~臶tUE3C{n@Hva ?My {CZъgQZt$z%[|uCX |DRQH&F=/@MsD%7șw04Jݥ-YPmh6RP5WyR!C--D>0|F,r8KH-Y߂0D@t!,gPEYu %So o1Q(O@V$T6sSƑaG6m[?VR)h}K)8~VOH(>!:7$4nWqlDw1!)?S V51hPu :y?d̥;t0{iL?a10׏+>1G*sZQ`ϧCv$ŝ`[G,hGa 7\ɅIY4QT.b.}jO7+mzA!J(u@Mڥ_nugEk% 4m+1ԡoe=ȿjD,1>}V}GX`;Q:븲|Xw#\٨|= svZL `\ %T;]sY.S#u$&6҅3pS*:4SN=ǐ2 SмGz<3y>M5M8@h L w@t t#)m>"JEz-Ԭ r0[-u҅]!̼L\D34j5w6BGi(:Qz] ܣsH?5tYx'LA[I~pgpU_LtZ ;'I26bJA^$%co!"4)gɚ S4oGCS-7cYgnNjyzpR(2Rqw:)A.R D 11[`X!,WDLA2]%=2X5K!Hd^( BwtgN+@~$#Eٚe+%-rƂISмU QeS :4yݼfFKX@|vCYu gBMJq(VjyC$_M_7vr\̕li|zGxI^f=⟂7qfбȴ)7)x8URT-[LA=Ϳ!<]/N<_:Ʒp3Dz7/uQd cg, 6cNMt 1Y&p זHIn%@Y@(n;śٝP␉Sl̳862ΡxY'n\'0>6q;,%7Vx=ƪsS*xNɷn^(oTR7G2&%YHo+c ,W3t]gN9 ġВSC[;b9n/)g7/X1%;+UgqΑG=xޞ:N[(Ù%g,hMV^8tlN%*TNZ(rvO@S,״^Is y/?tW geax|ё Sݑ 3ŅC˭^aբ|!o.eY9%aI`+q@-7MvzTonx'fَgRQ;4Z: |iۮyZ7[ V~V&}@퍛@ QS ?7M\WD%Y0 *p^e39#YI#iĊ jl$UjGN?d8&?V?:1/@V zFcF`L :I2 j3kTč7FޔC6yw#KBzltrKt#sVvڐZY)G`L#~GLE׽ՕKfQJ,YAYfʎʒY#琍pzLgi߾ZUfI4W;INĚ] se+^/ A8bzW4ecfr:+.>Ϡ ܥZkDV#8 h=fq]EqP`b}(A\һU:@llSf;N'&o5H>;vc0ߠ fAQ}7,ٕ^Xw ;3 e]j)q&_EG[͡reDHx㖹S$VxdHxlaSa.Hqf|2l#sFdmj_FWy~v¡D1])Y `L#&#*נ`mP?{\u{۹NJRe2WjD~ymiSV[ĆW/L(vˍ<.1&VhoS~v1Ł- `L80({u[yrqQly.[!Zhgtc`Nd[6vw ϯŎ 3b{69.%oo8 ހ) Sl[)Q82'lQT,ZbAfBfă<2%A^/AGɐes8~>cM=GX $ FtNO;z6WT2ds-Ek1Ulao۾}琬uD&NE' `L*<ղt~ա΂Hj .5!&b7B?q̦+i7%U{dC h֔kӶ+3(bύ4^[gZap:W !A6 6M]]Fm]9f}s[5`(Zٗ6y$|ΞzL:/|zk]w|gOg5Kz(i9/:A_ 6Yc`R^ , F)zM{ w7'1ર]|aF+E?*p/d'L<_IcazkvS89fUd A8ȢR!8yc Ѥ§O*CZɸj`g(ʋR6FN6yAɞށ OoISR/%J!aebGq()SR8Qb;@eb*A'D'0! 0ϡ wrKq}oIR4; :ewJ%DcJ.{N}/ HayGiǸRyzH[~yD@oD4E&WUX ;5٬2ڴ Y5ZUc`h T(6tv#yo[K ny5ؔTwhE 8!6uc`8 ig]WSJI?޸BPC&ф^ 6OϭAGU"F/ЩCo^GUG#t+Ʊk sLM6% `L \Vl!b+Nh}51sHn}̦.?zm=עԐiTgS61uK"0%'o~VFÁ᜞F&b.qktkW1}G[`ǫa'PCuݜ5i\a-6u*Ħ `LLJtSU(8tB}?re9fwF64SЭ#^69_[LoG⛑K7 *vV;pC6NuqS‰CNJ畄FNXE!1u0+:ep^8a%|.?A$7m_ٞduo]8XYEjg %t?7ѵwR3sx[q"_lnEzz Bp/ȍο11`hQD|G>n?9>٘'+6Do#pͨ_P[d 9rKcz/6:?ղN!jPnA4y=FaG{:!I(& Q3.Hw;Y4Ql4\?|d:i;Uh8Jr}W1=V~We{Ɋ7h M@;:Ȇ= Bcݡ\>l?w[d=Xqd5%Ӝ2R81lQT1; m:fݷJ¥֝<7s `l (6h.ir=bRWY WCi歧r+9*Kk_4L/M[KW 6 c`1zdpÌo7S'}B޽9 $olnAcZI OE;Dgj_VOVm4/;}ANbdžpW*JuZ:4yb@2G+lPR D?Y}H.kɶ?.ە*s+"+l5 <ޒ)d$-VZoqZqCp6A$^3K@uH"ޞ=DsҘ~iYv_XdSjP#\ 6. `?`}Ϲ~t(LyҹF)-?rkEߗe1b?{]tބ6|/gWw݅l_K"?]Ngal.GmRPh>B+{J`pU_`{֛0\ >Y<{WSrf1nun!e_G{)b缧:z;i䨟6iՐejGf `L !]ڗV=r蕊fm~p[/Fl=(Wm]#DuXÇln\Z;;!qĚ-]|߃#1w["ĶAE :'^@25?0秝ZԓAЛ{ ce`81Tf83WW)dRR5l2֟p/bYffڅj=?C5iW~܎E pUpU0fe+v|{<7r<ݻ-/rd_bPl䍿fb:qd}Xx }A64KWYS=Y^Ra޲uuEBdMw[mLG0׽orR<{>)"9%  hvOi'Sn棝 QI_m _#\*6)aߘ0?ڵGI.ȵuTq>O KpSQbWq]' y[f6&U`Cp9|v+EP6w砢TG!r6*p/4iyܾx(nv.mot9[~=4>і䔥iK˖Ǩm5 b 0"RcZf>˷JqKb֤swkM̢fħgDݾK.x jGK-sG2muZ`Ld!D=]H kW.$+g0. Y>|GB/^ѱQNJ̾/r ɢ4Al/ls$-t[ +%4YBٴ/5٤PlõNWotckWNNNc:zcIwF > &v~\te "~lq#ų? 8+Ν|fwIK$(!8d|wޓwZsF)  6qC1. `?Z; K%Xc,XuJo)U^g6!v;WSrXw郩ͽ3kF] hs^_Y ݝL>MBM (c`h9+K'* f8hP+\{]CnՏH9k#wd]cahs_AgøVFˁ}lA}]pk)Tx߭d}RO Cwos<r13 xp9|GJ:%8x0¡bXE%@\="/xaIv572e!~\ 1u Y+,LcvfOO@55hTgkP[z?`\IJ9dj]:K  c`/4Ŗf:UoQo/H iKؐYaբbȒS'Ul7݊7ORxqzhLPCl)KJct) |eW3;A-Ջe^1Ił'U\ʏG1I"ܚh~d\61u0p&e|bJ'uvdY5Dfe 8te+_pQ7{K˔bnz|C?5Ylӓ b0!6QqiSu珮fs'Rl⭺7|g3 ^rgS78 xמN }|,YZr0mp!<c`RхWv~ kOdkcr+xBmuNn5Z˅zFh$m x+0 Q)Ff>%K2V-3l6w.A6*gǭ;>T2=9vlШ969 mBlE;(C{Gj֣vQo{ŻQmW6W%q`O"넴7x /0 mKcTFѥQx4Wn!y/s,ͳIgVjgC;s@>EѰr95hi%EU_ߛ,/1h`GЖSCI먈}m@a`j"Dt܉ E˕~up_ij{.Z;Ql+ߡ͔{*<}:2N4@p=xLC{m=4D^k-|kx|,Ję; d%Ų`I}ǯY|Z.w0]҈1 'n,z&j ?[_D\ڥ3K[5HXf-}w>*֑_as*ȫ@V"p| Zy)By,*Cj0V{vE!`3ƾ爗7*ې 2ێ'٥-:!Ѽ]k;#p lh<SC@"fn>x_DZ mXJH]1 L;]³9 S=Cw`a41]u6_'+-IFQ W] <?h @pD GyLLxTjom΢#Appa,K7s͉L7e-Z|?.V^^'pozJ7ƽpY 6Gޗj)z6buy6ưcNd"Z7!# ߾v^ DFkWFkpl(Ȭ*|[RL2߶I#W-?\I(*eWqF TW(59}B} f-3m]MSkA\EIk?/D'=)o1“6'pvT h1j#jxg~ ҽdXnicA|tO"Ph%8VtˍeDĄqxsgGRR]gl&PlgpN;g9(:ޫ%fyw>؅Xcpl4NL}.߿,]1IMZ (rު]zfcGcDӷ%n5n:.(8!ͬDe3>]sGZGQxJPѤM)=9=;mnG" c +/Lwv=Z tMbZр|q4ڃ*#O ٱw=Xq_ٍrvL #W4,f;z!%c`sj/ͫJu_{gmll҉ďW6',7nW>Ny[ 1u ͮb?Д׎ct2W۹.L8VZR }b`LLJt+V}Ρba{2{B|憗74 ɋe9dƫI*ECk#'ɲa!r-qhڟ~S=OBE%C:qNEڞWSt`崔aV"IՐ1[W~$GwgH\bRśv$I* O\\r`?i/A>^ľ`B=A*]glH5Si)&{ Uθiq3uHxKYy[ld}&1uRiWPDs[jb#wӮx٭}FoNʝ1{RȶA (wb0eHUok8er9~7 ?܊>@捆Q"A&`L ܖmgkrlDbl`񗖺õYg" fR~2=5cM g.չw)*ַݶ&Uce~!-ޏ0d)āQBl{a"PpoHL^ gq׎T"bD~I\@c9{kg,)]qE-Ni A c`JvmuM*ES.EȓQ 3^Kz n۫Uj8/(Q1p #ؘClG{1 \;BCQOs17ir?,3W67WwX:O,hk%cLy(B2V DD2$$SP(HH;mݗT?Z2ƼTuUzJϻɫ؛|4Syl1cLɲۇ'w;ӡi'9ߦU/ѡ8ﵢ)'8cnq[ ?Bw}Zz{@Bv@%-,>6n'dN?VȦ m}j }Sḱ1psLf9ԡuC5wQXEP?u%Fqfq S[srSKbTLJQ o-'g3 C+:f.tŽmvi/EV1,mP99djHd"7:7VP[O#ͱCc†9xJ𩊉[wRѺz3okHR͡~bܺ.Kט21$*6]ިL); "iD_iy'>:pI:FRx }ԣ 6R] ZzKjĞ]#n=-|{^-:"**GVyٮI\h,C JP"-k!c9ى$Pw7%g!N7IѯQhy_9"RFEDdn46J=y*ʡFW5?|;{^)~|lOܑs}֏%jG*Z.GG։kf\S[F ڮٙ#^Ulw(y 3FfFH3u,qNUM\+.$(ElnLLw7Бz˲fl~3d0u={ͺ:uR1pռ/)6De嗒; ŷH LK\N\k?aKksV˄{9 e;GJU@o7@Ϛ/1!yQ+B0@cP=a9T/aU^n#g}t۩O'%9nNL3vj߹CrF {9dfr>Qͩ"*,-uT *XX5qrͲ}lIyAI ]/)@cPa\Kr_Vy[eu5J8c+tsm2_wr/{d-/)c+ nN LO|[ov%O&"V&Mψ"{׺O~Oi(R2iόwklM|gm(㩢[8v+:fU.C.7ٜ2ۺCfQYcAb"j{qM0˜CJnܜ:6nZ`%kYSwylơE49y<3YkӲ(tq KV<3؝MLK .\E5:IЈqM{+6἞uPbv4!Ա=.,cJuѶY-:&5gIޞqT)<ҷF[k8@uB9Sa9"FOƷtN̴t&'vQR{ӂ4S'Ts]OX)HϕmsUxG*r#~.I 䩑&+ b3+L:KR ǖ/>ܜ:fHfR͡w:S~ϩN/U^:c>̺2͖_evx)ylxӃ4S̡9Tg}Wls7[^a߱–;F̱;u H"f/%3J*v0}|ETGj[OWYM$:6t3-:.'W]LONکcѠ5^jTp 3;le]M)p1XBcPJ]Q8` ڴʥA޼qq}ʮ(;;źKYrYY y{+ϛ :fRA=2g^9ӵ趦o~+1W gR6yCgۢShNT xf&o/93H3u|oT}{ v|Ѩg+&]E2'F5.w2TPpجH%b tM*<~3Tps!1s"0jqⶮSH]1yOz_]}I{t_>U^&nL3Wl.m^ x?㊜é;r1PmG=lmgt=.[ͪz쳙f%C5owgB<̇4SGzZGj[[>?oo)řT"x R)v;Y+cHR5R+f㬂o*f_Nb }&NI1&UKZQ cEMbj_:7TӐּ|؋翻eKGK2LZ4Txjm Աѐ:>GG綠oFIRNm⫤e/gkb޸w1z /~H3u\AMt~\B~u6xlʇ'>4gƽBc"F£C|Z![b#\'\yYEmul;iFK?Uޗlߕ'ix{Zfyp@;u,qP>怬<&)h:1߫aÙ v8 y_aZy]7k4_xT:qsf9TvA5hQoNvs7,BUD[md;[ޱi%H 23Y|l"af6AB}Z? TKćs\Tgb4f/ >3;7sؤ :o^^u4SRj u#)ղ,kh`BD5}Uq#ŦBcC2To^zZ ݝK<9=NDԍ.ūJftwv{s4SǼ!J@vܟxb,3D37w|d3BݮZJ}o%7׊s͸jWw[|[f;8'Y%4i y;Iů_9E{7c/T_iά}ON@!O+ޕVTm\oeFrt娧w#=[87TmsJ(?VB|*0?_磰&#lKԧHOY\~qQ~5{OnjxpU6mK UXqofXZ| ~=QRܒ\C!09_Q#7BHVVyi;]b'Ǭ 8x0dhoʶZ=V3;tәm!N n":8dzC-IJQg ]f ݚ*vimwHz_S% cEMT"o4W6 LWOwgߨ۲4ͺ_k*u+XTLyc pH3u mח\O}9vu]Uw֪?;IQ͡jV䜣5_ }cbt):+NI\MVWH3u\gPqL{qj; cZ[nA2wjuN;m"UqaI/f !Mƾ~tg|eNX3@n.L3)LTsw_7KyJҿ2liG7qu8<|'nNY֍L}"+J:T>6n.Lq%S5ClYKsEZ^/pxot"6Uxp϶ʄ{;|405nƒ0biyCTހ*Լnw^prEp㬪Q|t|K¬K#Gɋz!1oN8.}fO mt/uu'PŘVO95;ޯ-cAاkS&9/gwvL¡Ci8aU>խ7ob1s'j5Jeu>9 {^E3^~z:tF6L3 w裬4IY#qׄdjӻ^fYZy_u͊Jsgv5XD*'|ͥ@c_JF8OF6u`j}A݊;z;^^ Rc{|;g,E5"ϔ~{[6}RU]2B.ZS6)7_- i%;+I0W,|YtM>>͙&՜d2؂FkIn}^n.meݲo>r/j5'{̸ ۓW7w LKo"TzC:|EZ; ?GgX5:rq3›,t<94H3u,qPjnƷԧ];-pIl泌4n+QD7g^ׇK>_~Кc3o)ґت_]zv}M7?tߐyl]<\&:f/bw沧 +2>w\#ܤIƸW-cf ^q /9Bz3lGF#J*]v19=(Vߠ8y62Z @?iDφ4G=҂'Qt?p~/f.~cѠܔ;^w7U֑O+=m.:6 Y7TO皨J. _U>3}p4d:oo#$zrtz !Աġz 9Nc7O$ȳ&2NN޶,B[^yb\:/ÜT.`MXOe7@vQ.)bAwF0>x,32lÅU2S(`'LKp%tYtڴ=+8cG;Ts).,M~>R'I7Hl"*.8TݻS=ec2s1U,2Y,yJ|i%Zo 7W iC>p;fg4szucT$ $gxwMҍ4?=渹RH3u1"{x)G7 Φ};6yGFf?UgycʒJȫqsef꘹]?~~7Ϙ©NѭdNj{ηMħн}Quub/88 4VFZ뜎gm~:&Fz#gH NV*u,>6 j³TzlRCI¼΅jmqʠ=?~\Q'_|ށhilvS[ iVe 8l(zuLti9ԓ5ٜ6>;N--\UIsSA׮Lo%_HCH3uN }"Ed=s!̣ \pxFz?9@9D3#H3u,qӿ\:aF-=04( Z&ņcK1־ظ94S2 Qzz0 oT!R`6}N;rtlLi%JQY {17/:jb_U=7* 5"psO!1sX)tÞ(.-2ؚ=,p̥q:q [..K~eSGب#- c6shI5h0]g \ ?-NxD/{T?H{W0{v]Vf63PjfH3u;2LzCݣ v~gnib/kWI<)۴&|3%"69'NP{k4SdžWG*WL\k(Fa]ηWeo #9])'w^ >XVlm;~|^{E^5.k\ěC[kJV&_Z 1s;jnlF YRk/uԵ ]/ZȽq݆ArR b's./|!1l͵CcP7=J[|UjK.V-,}p-g9+kDwiL^[gh/Teo^Bgh=}Ŗv>ެXm fLr> 7٪O;s~$tz6V; 迫`ݏ3o yGOrWK]t78]|kd{CeNH3u,qƈЙj!8An/gŁnOVN Wc i'p7 i%QvQ3y8gLW fG/q&eWkoXn4{G ~C4vfCW'#Ccio-)i9aR}TSg3z5n߸Ex^Yn(\沴dYvÆ;|{xj!Ա"=Toj:rw\q8^zٵ``֟ӻsx(}{4Sz0UPԼbʯ k3?/Q[Dw &R!hrxAۣ@cP]557^HT^_g+˳;o0lOMRXҺ6'ۘc>.攽| 77 iD$@7Uch9(; EFe QaKzf}B]ǟ9>j[d.ԮU)')rXKOvw%<M*HSY Ms lzߐnC[d]jd}[4a4N3j 4!hT @J7 ʺ,PG^ 8DЈ"f_F4i6XOЈ8OR(+-B{3%,rs.*WZ#KWAnfܙT#x٨_tA[^fg]KЫa&A#ڪ4EЈ8 ./1 ZڈJ8 U mDK鄶т͛akcN Qq \SJ8F@Uxw.Ţ"lt'9Oa1'UIyaAjP8 >;W]8-mx~8BPPhDRDi m^ C m^=!9FB# _ ;qz=Ih#ZE8#h^M,hX eΩ&hd3?)']^)fo L3Vf$Gmj4AsK^l/d\R?I}ͨx {Zl%EKCwy̐O_f֘RpB ??rJ=/ÓwY/E#"hR_7C)FԄii((4cLGwWe9uBmSkΏ/-Y?/i4XiCe3A# $>7H$N#ʂ PhD)V+ mD?V"Јt8wڈ 8& 20z+GQ)c\BB?dW' }-No m]9NdB[O?ooI5.&~~MȽrZ$hWOM_sj}=7&,H2*j&FtP_00Z &4hNkC/@MqZ4?NQ>g!fYSʥgo.V) Qh=8Bv0fqɷ]9cncAwQ/ևE6qM1zL% b}Ȏ5̺wQ<%}tLz''h'7qCS['pJڈ'8m_4-NrFli3xPhIf[ٟ=ĝ(0w6> VUfGkd*6ƞDwCkF=#6#b9,!h&Jwq-a$Ј*E8ڈJ8ml^qthWsΰꄧKg3;(5d#h7OM6ݸ~ pl"I> SD`> mD0>VF7pPh+6\1*l=ZlvA{mևy.߬]=N[K)=#hfw#9X.[o83e],ߖm5(\CЈ8}n!\"^# +.vFtigFtiGЈ8 / :AnGl->vIvj|D|#嫪>tB s a=I}q#hD?h>,:o4+޾L&=*k=':.B{BSF#i/YDUR6N6CN@EBQOs6n NӧcFi?LЈc8= W2O./,p3ЈQ8} mDM*> =o.MQc[oy:Sk# }-)8hdkys_(pNEp8Av]_ķv'xJa0A#Dtt"\"OMh#jt0<QC`#m@P0U@/*ZK?r(E'p:q /F0CЈ84e_%SFV\?>!pq !hĞ{U8+Q(вeŮjmgt)fkDvkRhXMЈ 8GXF$8xFxxp:%h< S֟5پHϱg*8u"KAFt $O|D mD6N mT9}fЯW+Ǥl`ɑT"Ugu E?j4$N߀=@TJh#MF4?[0Fp رiA#vZXFCy@yW04[Ɩwވ`}nw3{"PcMϻ?t.g@볓#:|rņ6X`|k: f{wewD6)jpAmuO/;}Bg.vx4tǰOXoLZj:7)t|:[A'-Х8A#vv}8B|Ď4.Eӏ]FPFJ_v\kZFy&n?*W۱U*C q8A#t |GЈmu8] ͵ͼ+nJ5 k'r)#8@<#P `aK{S ~~A9E8/!öK+1ؙnb>ho3f)|gR3j6aS o~vwdHiM QoLfJ=!?l:'5 yg3녦3C!C 1W\?AɌtfs|cI@4Zw9iCf|D @ib4cF1ջU^cPa]{i>uKIfN5QCV =Պ韋]Ĉɯpj!rfwd웸miͳ"ʲӬa ۖK^7R7>E 7Nx3EH6ճ'}θ9-R$6X.[ /=5-<G?V36kdQ!O}i_/MN^ꊎbd{q;x mNa]"6Wv"jrt/>!j~O 2`elEg~^r,fVa-ᕤQM, GBs3 `?`$j65digjjz΃Usez9 ΋ڋ!k\v8^=px|FϺlL Ok.L%mw܌ h@)L?f*@M᪃LY>&Fg+ߛopH:m_^fxa"VmQ8藿hx`]sqF9W7-hbrAMfQ@ mã 5J/#3FR|Ylu(ޜٱ1Ic틿Gbx a=ؐyVߜ0ŴΉ/ɮ[87ƙ.F?7_EGȧ-acra-gxp:ƴe'A}7ksiy=ynp.kI~$|$ӳ{Y xX;'{oJgޔvB#=Wf ≧ jr8WVi#A1Z M%ɝ5ã*'Orn]4}[ϽZc+Cޟػ4!ޠM:uݾnz=kvmv'ssp&ǹfƔ)].8HWVzGy!PweAD1k-Vv ktrVCoƏ\1m&Нļ' y 85f]y㘶9e2"7! t {M.:thIf55umTNhINm ,}QGBX^y$Jn]5So.[yyF[[ݱ4m$8C/=sPK;*g <}dO GEkPi]),x0% F߷nhra\} 7b!W8 C={%F/ХCo@ր&Aw%ƱqkPj@qS#aȳ퐥]X4o~gɫYyc?9[F"(ؠg>4g݉' OND%]<ax|U ls!Ц9=pKzq&<<׺K"aGaF()KJ'n` a5w^9Qq[ oSC M?m'bbw aIAv5ǾxVyZ_X6 |^E? !DKC> ]FUsK7AMKWQXMs+͟9~a#Y t%/F̡kF2)7~{·K{BUAipʔuiXm#FO ڈ'Oz2ϺOj&Ӭ92j׉e457F\LoϩPIN#Q qݩ{lV)t()kVi0eW Oeo+`_-~vǮl0MR T[jN?d8.a",ڔhxQ-#@=ߞ`cЊl<; ?a'E ٦l?{fLXB)ZH՚uupo:cՠi G3X"dqVvU)fY^b O/5D P2I]3>jǐ0<Ǚ/$)+ K q̃Bd=p}~y 'Zd& x#!Gr,-FpoPŮ`Ickcl>ȸS;/Pl}YK&0[IeaywnB2IxZx$l)n1} A{bDk`@_erޭI]xpJ${.% *&CJe?xoП=QxxN ~ۑgC@`6/1aAIaIv|V`x u9RP1$6jk'Vbҷa.ȨQ@Ӹ0`Ng/,K  ^~["0(ZT>0ӣ"ø i=_f9sl:T"ʕwPbe}U/jjOG֥w(A}jB7J ]Sl9w1`tZݒyhW'DaEj(/[3x2P|'=b>uYuyo2mhuq&<2ΗcoG%0|S?o{//$}`7f쥴-/Q6 z>(wܨׁЃogi,ҡ7 v{m. X_#Ҧ:>)ݨحkMhnz > :fBU/2)a+ۍ~*;)/]-.KH c=MtTWZSTuSyA |0)Tz?B=ny%W(D}W1 4)9i/~Qx~+mʚ:wB5ՠ?e1$ڧ;4pyo$Կ@: =}rӷJq{|2uSXn%;뻆!v1GlC"t7}HO>[Lu{=z@f){nMsGeA #yM_314xd*S^4>ЋӎY,uȈ_`ȁ9E4v4K!+aٷNZUĂxd ‰t%(ch[>=rs '~D\bWH\dùrGGH7sfzHA/9Ȧ/ \|~D:3KF-Q?w:ҭ͂w_t?7"%h~\h{#{p#_ fP7!+5,iH}Ԥ\zύ95ڸwԗ3->ޒɃK߀;A5`A4Z4aHX;6ek~Qq{7˸\ ]SĶS(=dwnCv+Hn>w,`W񧠮AԮVxoU wi<*2DI4h}YtdS"몡r6#Sa{:]l(_3eOhqEuzeh9 I":퓪C<1LW7SSVWKzj+{zFF#pS# vތ̫7.~ҁ{tp!{!Vǿ7GEg^o$|HF[ٽal$[4:4E~줽T]pH'!^V>)c #nMfǷ`Cج+DnoomDM_Y4뿄|\#PAxdDo3]vM:FSWu?3( dEş7/Ʒ6GKfh܎_AqHpz>A_/ʽXY2ळ_ԝ>,"nXhV@(e.H!Z}>86GCA5)!a H hB4L$%vw"Ȟ3mLW;uk|@r2;/K9& |wFayUY;/ 壟f@:UWG˫li,7w W1JcRAG7:mlzayB#kAtdTnx +=}I7-}v )pm'Và둵!< 1Oڼ_|b>%zNZ.q\DzH@5:f^i4VH,rOi Ț~wǶK0+]nZ5$ Ǧ= EБՀ(+%qJHե.%XOdv2>Bh񺍍o j)@ШN؉MË!O*Fh5k?ĸG}zeYCF +n׷Ѵ5N@9WbS]w쿪A$@3Zi=} ˱*4YLIU!5 cS|IPs2;"/qSzI8@P :ݙSt\_ !4mX~:0jQMItς0-[O|W] A^ ٯRLz:).8;*{U;(E @ئxwMeAO} he9^?y?cNs:)/i`xi6t/pdJwk ۂYiM B3@o {p5?OˀZP0 o'\3^;㣃RYa)nQ&7UK_> :, #bO*<@jB 镲44vKN0A㵙dY)pHu6tۡ_Qa p:ULg20Nb(/24 7 lx9UF4Hi)>=K")[\!|2\ Ll/G6XC4L 8%:yO~66='hkIY[9q*FwsVHze>]BJӓ9m\)wk2CւZIjvRuefc.= 9p{ggOb)2>}g7TFWBУpHEJsRoG7Pc:9Js@hc!àsOcmx!F>j H<ݚb'azxj"^(@O9[s[#dVuwĹ =L toL0a ~o>nyMЊP=~׭'s+JC'A㑥lq2Ao ar Pﮁ“Va-KR\{;2ߗ]t"<Ը ϼRvb{n_-45 I[!%fU2ɢix}|?XIV8}A Av8BK"Cyx_^+ -UOn`YFWsN1բ;ٶjQ_w6{gGՙr8Dv7)NwC* Y=EBYoEIQ)^{l3] ?ҵ<1$G2uy#\:;~zB[DvBҹWY 0AGe;۰ȏy_؎NuS^ o$maRMc):D65ݧc~^]7ztػgԽԌE[aR{IFCBP54K[ "h.= xdSdI?yUѲ#da!;WsŜUC['G6uy2MPa0^xD\|)cy*2dٟ+(G6MP^BG--hE{i ƣ0 cWMIt=F}\e ;x8?a%ʈ!,;-+ٕP{̬2Ѹ$WH:{ϟ{>;wd-p<,1q.R7hef}C˵VI«*r20,z4&-yvTGD$X|IK#!vba 3adNDdߠp-1Q+8E./ JΡ`oSK#ުZq62Sp<(MUx}Su-UMf)4b}vX΁XTekI&ƮƪmZ_S4H*q?Bj{ E[z>lp=RY]xqGԿZ⍻-ՓQ­%[ind'7k?8i3'mSrZcI;z}NǯG31g"][)<#K?Cg+KHvc*GLOxE0$7 6Xu=Eay 48zK^_d*Q_Q3xɂBǥs+|"r凮X""R?EnL=i,0=fa]@ң K=Giε >)>LJt'RmMkK>׮Z׫4})Wې-=p&~!ƒ|St ,Gm(u!ᯕ;Y6a ۈY,JRp/j7 nn-`xY>n_&0;Gsޫ c.ǟl75X^z,;?9*9BϽC0ǿMPnQ g_oXhB(2[D_br7&;O{Gmf8 M`/Z\W߰ك?m'NZA4?ZC3_ h^BˬTyj5 ^!:3'sX)ܦLE%4,j'6|@2~hx !7/i`KGzjOFMk`Ng cɬ"@'òTd~DzXmf't6S'|"LZ Ѻlܐ;8@dZLLlS]AuzT\o3ӢíӍ%:Q{ .=p{laRx.S9{yn)ea3 F;'Q 咥ljvyɴ,C:/**]=FQ=Z?Gw ?5i4Q4 q[WV܂զhC})hKZe SL"3*UjRg{"+0>SC Q<a5, R*m;)q;ߤ)tGgvvݵ0|.HZ~NFaTRv(3E#FS+;7#.b|,"Ѷ ~8i|0Wkjb I9N$0z/tȶGE(M8Wcݦ]P#ӽl6x9XUi*<ѦH 8sh1J#MnYէWm1]!ORܭepFh>V'TDvEiЋatH %rWV?9µys" $(>?)# Ӱ%* lxwpDW,K.[lȉ9B'ۼX;FJě!p:r-6#V?V7}fB8^ث+&_\*>r:6|#5Ŵva8UA?I_Ĥd֌Gm Ƌ ~VRqXlv0罬vꨩh_4ma5dinbUOr iI$Ü/RHsՋ(X(H>\e57থ3Ûh /!AHN [?HܤdMnevw:B࣫\odcuOy2T<oMG\;3sHHgt1 .;rќVҗ ߯2n O7$ sOYبl zzGmYH˞ :R++G^X2ƺMq|2G+%XnAӻ}eɪe On3yxX+GA:(Pr6XIզ*PJ*Q75B0.olk/~>}F,K{iϫ\62>R~}R*X0;u8jR37>ޑˆ0xXa.S3];w'bqqհ</*xm} 0S#$xX{"8~H̉s,u,9JZ)o^[Z@ꋡE+c)᱗}aZ^>iRSJE3s;jNۧz&4;_~wV<)vwTSe]| ˦)j?xKS w3}2/vlGpuO@.>bZ|m֪*s81+P_GlxMx+)8Q(6"8~ -} O.4\D\U78~nx/nv4H7Kz>j[jL[SIf%D%a'.6Y癿dkm KrW$0w 6<Q7󔉌#gk;+읯 bLr7â!$2^e9(?ooI[TUL/b\x9PbyHi,rn&^lH(Y$^zZMeSBZbYjCU%1wg.&j`B| MF p:kڋFaUD=V҄>J?U7rzsӆ!J5}䎴ݵfy3 ֧BQSֺ"_)Fuo[GHr)ߨq캠I2r16ˈL0ʇ\2*ޜ{j4WMecO#wO`]:Q@A8=RuIpM:?|1W"{tSY:ް $@ *撁xb|lP@<=rl} {~{~O˓2 ,1x)RBB3KC8UL=b3jyO)T.nݡjJTd6ʲ,ڲJW|-̐ms؆Z*X?ci߇T<{M%}Un(]m#(s FӉboHxaVKCT;<KnҰ2:5|.wTYgظC?@= H=Npk fa(coWr8|G߰U=hT =r$R!UeV?4߶rO='[#a+yۏoQ PѶWh!.0( qGwFs^dNݻ!HN_K^D0*󓗈zݤk.ĂoeX#'~8DH#ׂ8j(ϪRYr:~ceP0Vbo @^4¨/> <$5UbFw_} G_0=Ѽک!H3ND}=fˣd|acd$Gt4= ۋcR1Cr+mfdX")H%G kBg'fKd_UpL<8)DC֑N!;j%u̡$9غ`}큎i+966{]Ϟ9!]8<+|8"tR h5hy1eZ~-(9txX@ӓۭ -!hdK~O^ 72v۴#=8fMmr/abL_E)ǼW5"J^Y[|#9wgg.o>%ިvԆJw1흐>2'ζބ̈AxۼW'Tүax:y2Rvz]K@l4gXI5N*+;O˼Cc=7d[ ҏC۾1<a1.C<{ʖD_/S.G#B (w xXG'_Î(2)u_xr gX6`7A.W~$?vx,q? رXi]v3?{y;%`SysorȘ:#`/g*0&DXqW;L+)mK<-%QTeBGCco}N69?nPe+UZ` N;ܘRsG%I?H <PX58ZlssiL;pc,yׇKal} A mw%VYcIX`LBzSdVT$O;' 0{ WZN  8n5Hwwh,BH?11s[kI >_I/tE+gh6v$ 8iI+j2\^Rn91he>ExJxXzƂ @4!j+/ Q-|"Kc'a%L7m1Jd3f)|gR3j6aS o~vWdHiM QoLfJ=!?l:'% ?yg3󅦅3C!C 1W\?@Ɍtfs|cI@4Zw9iCf|D @ib4cF1ջU^cPa)]{i>uKIfN3G[Eމqٶ,ԙd7orG*rZQ"%W+"/v]#&(R ˙ߑYo O?s4ϊ(Ngtl[b/y݈#HB.lv2C8QP#KT2s;:RJp`l6ԴW 4OBxG+yglNQIsڣ2C܇+AM+Ғ/7>^{p2`-v8LA<΃ۜ*.EnmE^"]}B0<e؊("+LXzcͬ%?WN fD=6Gw@*g^4cqxQƓ56ˑ{ù$@R{ohk}~m9̰E5Ir-xSME2j.ֲE -0׈L,֍,ígA#wȦ8Ѷ/W"9';`E='Pv!#gH =;PTudUӗ(ihou^^ \ :U [6*=gcRlnB\saX+1@7P=x~]LVi;\u)#+䳟^ȱ>q{S}Pm= o=LĊt0-t oVsuN>(5'3⃵EA S5:) 2 _pmxTBmwfw(Q-\3$ k[ HUΪ>DIP&nV;LTdBƜV}>B ē⋕EyئhlXpxt`23jp"4J P j= m}f{Fh/c8n` C ndޭc5!i3NM:ϛA(ҙwwU1!q9竹ݏd0yXo4XN kKאBg,썴zf# _8 N4e{–E2j֬h gfdʝߦĄ)%?~LjcNj "P6- Z1^(sIh7x>D:b{R6\A7v)j%!Lyo^$|܇!_KzJA  j;ucWS'3ָ2Sy-%Oԩ+\L͸}>aՔ<_4vEhN~~?4êy; a^QbБ?D𽊝 s)NVQ&_oVϥD8_͘20Wi*Q~0/l0(Ѳte ֎|"xNj!C3W̺g t'1Bp'!==A %YW8mN١L4UdB.BA Zt fM]Zmҡ9z3o8Ku_`c='ǃv}R9aW-d÷@͔8a^іVw,M/:PKO=T}*'O*tOF?YӂOTZgj"/2 >m+[Q#ޯ[7|A7p90.%p>m Ռ%GQ& htRQc]SwEߜ]?E͕Wn7P&$7yKʒۉuZJs%5j[>} 7b!W8 C{%FХCo@ր&Aw%Ʊqk;k̶<Ռ&gIo?,:D# jH #4G x|n*Fk RÝAoP{*m )?M;at.}H+Fjg 1-!Ki6OW7J;zǾrjEοߗQ^A|hX<'^K>8y%'(+Y9'B,M!>m!9Ps>{NLxbyuD0XrP MSZ0C#[U^ҡ?No-sEG$`xL?f/x{ե\mI;veiJVpj9'+tsuoa4u`צFÿ]buh}VdkQx 0<6Ug03kejJNB֬Cs{C'x۬MK@<>'$JY7t#`xl^|AlL&NqIޗyP#.v9px!aENѤ_dT0]Zp#~`Ϡ" 푀;gCukHE7=uZ'3d>~{`h5…{*vKLcX^Ԕa^Ɲygz\2ោJ*{ λ3tzI z=uwgKGw\K${؂M ~]yz'5wE)쭻X3')㽩SBDuL;)mGVE}l;GD?[{:%%ّ[˃o ~c  8 ߿&Q[;08<{tAFG#mX^͇R nt@RS{\\({n1$BFCwHx ikk2;םڮoVaěK8QJ:f}@+b_@546@3NW]/C) )U A?xFoF~}Qd{W.{[zM|KȞ12O~`ogkj"4v 9{0  od){OR4P_ݩxAjޚ[t3º2fP$>`F{ӟϖ,K  ^~["0(ZT>0ӣ"ø i=_f9sl:T"ʕwP~be}UjjOE֥w(A}jBg7J ]wSl9w1`t"ݒyhW'DaIj(/[3x2P|'=b>uYuy2mhuq&<2Ηc Jf p+" #%Jc߸*__ I:}n'n5Ki[4x1_0352?muPQǓA@=YCoA0]Z{):z;e;p臨bG3ΣaRx ?rzJv 9*QZ#CiR4s_0˹|/Vڔ5u.jA;[ tb'IOk#zw 1g)iZβGdSCFH.^[=zoVJw:L7d`YJvVI ;pw }->ucgp߇DBo |#20y _oCh0MY׏Ѯ؋KO@as(xϬu&RCҗZ!&ⷊ4˜Xn ~5)ZڻXC=LyY1EfLѐ:@m66Kthh:'#+%n V) IuP9ow0:3졡=/5ymt xȞ!QQ#q6v?8?](V%ev;Eej+?|@;i/U#h^V>)c #nMfǷ`Cج+DnoomDM_Y4뿄|\#PA8xdDn3]vM:FSWu?3( dEş7/Ʒ6GKfh܎_AqHpz>xA_/ʽXY2ळ_ԝ>,"fXhV@(e.H!Z}>86*4^QĀ*@3D+AZb'z7GqlgfکK][CǔyYrٷ^7I h'3.蟬ye/B7w[5JqXby8?56N9FqL*(>F[޿{Xe^%o>BAȚsn$[y.Jτasq3yi ae]mp EU0zd-y]Y옧{m^e>BRCn@=Vr{-lȸH =$ ^GCvM3OxL4$o9Vç4xxdMKA;I}c[Kg%k.vN[cCICБՀ(+%qJHե.%XO`v2>Bh񺍍o j)@ШN؉M"O(Fh5k?ĸG}zeYCF +n׷Ѵ5s*P/e̷pGwC-hk 4t9dE/F{ܼQY͙+D9e@QMKhN1N>N@9W`U]{쿨A$@3Zi=} ˱*4x*͏Jrv)>$A]G$ (k̋): џ/v^,?l|QWn$gAB+A^ ѯRӷLz:).8;*{U;(E @ئxgwMeAO} he9^y?cNs:)/i`xA6t/pdJwk ۂYiM B3@o {p%?wˀZPO0o'\3^[㣃RYa)nQ&WUK_>o :, #bO*<@jB 镲44vKN0.L8b|y:Ef:/0UxS*3`j}'NBhFFxvThG֛$^N0;te~hRHV!+a_ n: CDxd/ 4NN(h-L4Nxw M3b SA#Z!b[!A<\!.AmG:W5Rb Hk>|Du^kz f+о'3h<88EAZ<>8$}!|2Pc+*| i'?]HxA#4xp̵}ˬK-Tق\u9p=R|^ OlvNw-l罫kL󐵠oVZݶTb6|! n=m:m6 YX ̮xM.`%*t\%!Ok_lrLRj*Qٍss t_*Lwa.`cYD#;ȐGKƛy_ݯ|Mݟz՛_w+1֜Y%p)YWW``鱐a㹧6pĐtxd5@#H<ݚb'azxj"GQ49~}v}kWYSLjlo0΍iDh8P,CFc959BA])6KzYN}(xoR~/ _0id| +<.㽗oG:`+ ߧJ/xCXq=vE<3O( u/#;2(Oᙗ`{=M9!6V7`':-(8ese2& a}U;J,j,.NTHjej$ױcԐ2Og"n#Ձ_oW?[W Ꞃ^e9xM^8T<ǡRVh(}_7IۧiT^(8%+Ac"I Jۏֵ$.቎؅=T##R9뎫OuIOJ0x83:&3 qY?Ng<䒲@sRi/E:Qؙ>ו'+#0?}I˖pL%b}7,+;{-ޏA)-1q/CҀ AAGqX3 ZxdQ|N>pOto$V+ĠȆ j|k;C!X!fSZ$U9bt^RDAzj\o]#N/>$ST02GGM2nOu~Ld ϰ=t^ʗ%P|07zFZo]d8hU)Zw8v&,<x]>gb:Ӗ*dl3So1q>;,qI@ qs[C*25v QMcbU7-X]U?M7RsJOڞrwc1r{=)+<83kvJ!gu,0~ZbH=}9u+%6|w}9y(,{Ͷ»1ϭ7IZZ-}$s^"L.[mE$xY3 {7Q^S=5k}ԋLj.\p tP({G-8|YϻM/DiW00iU}B}Pߐi]v۔2E:I_RZ046EC.KK;yg4>TAEG˩qkNJT1!AѝavYLy))NEoO9tX/Y' h1\.]~5|F=9Ρ% ݪέ0 ɖjH>]5NԕZjm6eL } =0長7f~/veӿVdl'7M>;}ÿ"t—2+b "7(-rWgq IV)v0=t)+ YĦ֜(rVZBMpN7:ǖD)g{tx28]VrN%SFqYfD[{`vN%J 0|iY[*u^TTλ[8zZ-ZdՍ^jfh^a 1[WV܂aLhCI7 4>fXorGo ΪD~'Oma=Zv/tȶqGuB&ѱn.P#ӹl6x%XEi*ѦH 8sh1J#MnYէWm3]!ORܭepFh>V'TDvEiЋat'%{^sys I$9Q|~S2GZ aE+ￋWpUphGpw7^Lb2ZwHՐ=U=I3QH^P~fJF1VX CìQtĵ;3Īw >q C ºhߘ/nŎ)}z^8);tïOwC6y?K=, ڣ#k <$m̦oG E~=KMyRV>$gyӻH*~t: مrL-! M.-ΞSW-QyRkzza>s @p$$=d%S<؏ȧqVwx|F+ ʧ>6*<촻y5:>rqJF1?|*AH&C `=MXu:;#kiޙge 2'mby9lҧ,lTK6} =b6z,c^(e V})Չw/, c9Bp|2G-)XnAӻ}eɪe bOn3yxX+ ~ n_W 9TbSEl{(%Y(ߛ}!yTݷzo6>]i܌9pYQy[ЊP?l̻/~bZfPj?ےrߌ^fTXY-iKrgN9me}x%pJūD|YI{3EGޫFaHLxTO؃aayt ^GUq*bꉧFH@D"qf+5X6Xs5Sފj-CV\knևXY-l#o(vXFpxXzN#SζZս)eQID'OPU={g P/}Z;qIoK'l.>c}P=.T0H7L_ubڕ 5h9/Țo ax:Bwz4|XDYuFVI޿GJ$"%^hĥx `Ap$| }E* IG*~ZrBBj. (U=;v%睁7ac!> ^ `f>PƌUzވ;%Ydx{KK""o${pԩ{:w%Bv 8ChVU|ƘÉ_ᔇں?bmtc-NjoOa)üo?aG!TӅ&4B +ѣ eс wCq!bgM<;%qӘwǮm T$Msˈike`tver"Bp:,^rOZ>7Kz1[L[SIf%DEa'.6Y癿dmm ˲1w 6<y o)GΓvV;_?'*dLr7!$҆^y9R(?_oiI[TULEjx9PbyHiiIB7ny{6u{}Jh^zZMQBZbYxjCU%1wg&j`BlMFRp:kZFaUxF<"Y=mw,[3}3]G|՗ф15`n*8 j9llE%RCUY) _ Ov4 uT<$YI,FV\>^"/ +vXUM`|`uPlY 8~*DkSfª=': 1. B˜;HnEKRZ1[8aΥAcM @2p8^8uZ@` ~;^a)CحOՍa"mNͽ~-#-ww"8̂@kԔW} Q>ѥ7wwCsgTmܸRv$JsRڳ16K M0ʇ\,*ޜ{j1ՅJr/Gt3h׃ 8=RuM: G+{tSI*ް $ @ *撁xl|lP@<=rl}{~{~/˓<1x)BB3KCe8L=b3ujOWs/nݡjJTdJ2,Z2׺|-Ȑ8?tOf<%E~?{~‚cDZtRxؾ)R'**3Wrn7\mXmq;x<3l! DUo5 I0=9A>oXLnĆ.9)*\2ڟ`o[9sVޓRQ ǧA[k[ : Je~x\t#;m9nk/2OuPrN_K^D+?*zݤk.ĂoeX#'~8ΟՑr 1pQWU-6|7Kطur#xPG3XS~ @Z[ _yS`pؗrV }&N6}tFjjGʇ8#8=][-B)>%Q;Иħn/6IA^t4Ńm;1`t8VGvX6Vҽ[TMR%!ւokv\5a{ jj8ߛRa1#ڔ6s[cm+_?J;^fk&Q:!OT<$]鋵LMa,</cI: *f0k^i3#IAI>jX8?w7c_?}$Qc XvI!*4tX T+ɫf%KmtM{^!TKn?zx iYoxGÆK[D6/c mPAY nHllG,%_}Rٗ3xئi0lj뜐&->>EI(nj"=q{X[)r/P<,iG9nOL_pw)ylmpSjm~ݬtgx yA2Ubzq6ٛP'v0ꤦZ>3+ ew 8_bcq1k•MvRIq&Q0Y':9|D6'qiSgZNd3:%J1m-aqGH;%qtn9(Ͽ@!߂>^)21`xeiP<}0rya;ᗟNcWK; ɒ+ߌޅimDn% 9~43̜[ZI\`Q : -sB8;Պ.ˢ"ƥ@|`]?w!ûO@~t=zPKτD!o'U0tiab/armory/databases/leveldb_headers/000012.loguTUCtH#%! .)AN. nA}r}wC]kf֝}{ rı@bGXqWE@RVvQ u̽SW D6pfԽr7=vvyß- PcƮ/U^`=#H;$VC.Ivϟ }-AGx og{~qL;o3+ì0'e1@Bp^٭xg8 A_7-gȣlqq \mai]$ DЀPpn4<|?`T~de)ol z/wp;-J%qާ4!AZ.B|AH[Z9㪁ܟjJ<(Fhz Rz)9j+w p-~bB'KQmxWb02]Q"|23}&.R (*y;ƩuPjA p.FpZsl~h t#er>Jq1V,{`i?w~aw>4oavx֣=2q!Ǒt4}_Y&^UZQ@rx!1[ft.d@tH2hҡ7E41sN*WGyEsi.uCެBi%L& ֨ "y+T{abOb +bGoi@)K* hR>SPM'X$e&| /.[R`ru:<@ϱi/4Pn\媃-hp\J;G/̈=kP#P^^^Q0s:, 2OA־Nqg'F",*PaTb3F[Kύ4Ls~.Lgq?Z{i($Huv:Є7Ws,S8 %cT@NJ8K7 @ <M.=ǁ ,EEwb\E1ѵS>ý5뜯 A}$lPܖ8vVLߐ1*B)CPM_o[kEќ`;eGY(6 :y|39ɴnʼnnA$y TƓؿg\<<.P?'4X.[  * R)([sN]rJI!a gUB 9|wpuâ!

RP@;)#[ u܊\]X%(HP@HOAZxȜf)HFaNoӰ2JʚFסmj&G"6rCt{ڎDӅ5/@<||~EQ6ڻk7+`K1V 煗wMmp$ȘbvӞ:rw(jLTv֕XG7נ:n&H O!<5 3GЫ2Y3߲":\`J vX'ɷtS:ˏA$(bi(=_s-FvB&M2y!]nc6{]h)d UA4<X,I0Df@DiZf*)2W3A<1;1\Pf$hi|/δ>>1knV@O2OۈQvyH{B<aee&|$5#ֽ0fyE99T9͈o&x ȤXt~վBdMj@mER)INq\Њ`IĈV%%uDlp9;Y} bP,hcHU+ ?_<xR 7Z"ewA<#j҆j碟RB[1NL 2<:`Y/&N~옿\{'*ō8Y @d23f>zk[vcvY'3V!^qnr=zjqgX_2% | @22HY̹vwQ)YFNF؉8'Ӕd(a#bmX8-{k6ˡ."!]8ƎЪ{شX>3c"c oAxMmA0 TeփUx n'o;D5P?(Ml/\;ʜXօG?9[S A wq׫(ŜMM=aќ8+i @3)k:E՞7Y31̚ ٘sJ0gA $XpeƬ YmSƒID րCgV%>-?j*gj/y!L0{>_Hpy0ne'1ؚF3OZ F慶 Y0U&9(A&;=/aߧfZ DgЭE6 Eg!A3{4ZOD'gvţ1)EbS jh "R?pU>xVna_R֜\q0Eg2i\uͦnږ V*cAj,m4 ?bgܓ)a}W$lٶ)(T&; ƒ)XﮱoYbO?Q5YHM>4f[ `%73xpƶ-eع\SpfMC&TF3T2o=PNQ$[j#|s'T6N]3đ}: }Cl3@O px!^EnѤ_`|(V1Da> !gXo%1tR9/d O'iwsK[<dY$n{P+BӜBc ԼǍT?tu cn#ʽ|PBs":!tV37dӀJ"\}3]mUSPRX- eO>OkgɮT`DE(siv~j>V 3b D:͍ӖM7ВA[?N`*4Kոk[tErv߹!D(=O5 4W yjfRΎdRHDUݼH~e"HV~rq?\{ݢ'CҔ Ŕ߉j}G%?fkŹKut]@G'c౦vN2MQళ /{::l SDkk#5-wvwI`MaN>ɱh Ҽ{2vN9:$H$8!ِc;o~U?Z@{ F,p)M ɴ ojQ^c|a dtaa} -B\\x GgnuVF@ʱUtn;qб" &W*]$HAҎմU^K/vF ,t\0AwFm$GqSxADTJZ*߯ 5e+T&z DtV{6l!Kr.uv0x^)q[lO K p-y',+}9|֫Hs~xCDR-FA$c)mۋU}10} AOŽxP 1JxnF?(FL2Ym=R>)Y=:צBQu=bzL=*~ZUvSJ}Oa0O@1(ڝ! M@N )ywGOm6~ݗiN~Ґ;;خ;OH c>NtT~cjg1kbSk谥W|H3[G dg>`֪/g~iINew(#Z9˩Ud9Q?Y]Z;=Y  mLUI'+G`|R0)~Ův(nUJy@|^C͡JNvI+^5|1RFl%RTeY!E $3s7ict# q37P<$p` )!cS$e3T̕FVJpGr rCe+Wtf!O]~re0,a\W67I`C#ݚgw7Ԣ>lD@;>~4c9n?({@(q_2wF`d:=7i:-x7t}Jx*4HlڶaOAH #?RkQ Bɰݔ_,) """l-i\duK(Fr1<宼1S#~6d{[8%|hfo]xxTzt?4h+^_HmeY^*Q)%* <)=c%1c@"] Q8Z\ի=Q륜я3-KN'>P[{6pJPSV$]{{K7N;{啠d[EFI|rkW.w3WCl~%~H^Q\~,JW;,YůC  hFA )eN?Ays #fUqD=]ٯg4Ɖ4֎gH Eky6ʧ >$S梾˴tU`A[OLF)SY!BOCΥY ֹ) s}=sVMZΑq:HP_O7Oyw¦9w]ߔm FSu U>&'37.QB&Q9|cز5_'yl oK*70#3-rE O1XJY(o W4`7#CzFT;E~]yR ى%#5YDڨq:ƽ*3B-#ܹwB+[)`C)l{bgݯ՞ $8Q+&+D$iq6W9w/T4+GIk?$a Od|\=]]O8 } ˱3~d3\X.#䤘NBc (H^.X Ák]n )ޞANJxxH{ɏJ#wꊣ5-]f8uϳ}|0km "y( lfh<歛&#ו9pS-rO|G rt蝋EV|A k@EG`k8 z&;.&={caΨ޼ \R,!X~&R8) r\wor;8ݬE/J7QlT~F%}atxXeS:*K(EzO7jv!E F'֊wXI*Z@I&t ]O1~u"eʍQ~ZO28TD3! ưSu/(x{2MEA GvR¡ٵWV@Wg~ApSV܆QJ,0=^T\:8d4BfR_Y<%yOB0ʿ('ŸRR%h+L4JƓޖPrX2<S(n1ss:RT]$-x紝nH<e4"#8*tDsFPSv {v榖v="ɡo-~c>D 1$vӈ8j !>S㲟Q / vC;`^8 F`O ק\K[f&`\k%f⨬ݩ]F]ꄔfٓ隺Ym,/T/˚oV^Ě}GuR6vgˌT+FVAh~'bhF@% A 9<%~v«TFys+>u Se7( ko\(X6N͐' _<{Wgny;MmNqGGrb)-0sR^^c^ojC̼[tU 6VM 61;0JG`܂{._Mݖj'iJwl,(v(5FYkR>"r+}Ⱥ"Oqdɩދ+#/dM]nͯtq{8v- soQx9Cd[qE9 \~7WxjrY va1d =;NV@q^>?rYxYܟ0}sDs6!$m)L[wDWȵKp7MƁr&ruRj gH'vqP},8QϦVڷk!I~Zv)"x>HDzq-`  LWw!I*FhTeM8UFjw~>p*62MB9yɧVxpP.ϓm%#B Ci%J/;8`S#8W&᡽M<ELu7NWuqτ5&M XƬSBz)Z0Z.+Lc'r I Z;o젯iPt_ x= 7y7,ti_a:u 6P(#)ƒ~UU^HzTsɱ>Cvg?Č0n V1l;a1+aԑpܦ `v[z䲜E:{>KdTKx u\ꤟ"ȶۀ)fD6 J;Dgxܕ%.^.M"njRO6- eo| 0`SpP+7ދ=)u''RT_MW՜S̾xmQԐ0xF)-xg>nQ0׵xkGKk9Orx;a|$@a#)yƯ+m IUO}K4OM|{Qյ S ӿ$jєY &)|r&zഇ `{HSp >{ }cwpvISM9sCѲz `(ӟ;?()4΍wbL*m-춌M”KT T}!?(R\ޱƗ5n0)5)^ /Y}L  6,ێ$ywIp݇(Ay50٫&v͡dERaz9/I$WrLX dtJ<'pB[6 xa~ωrd9Ꚋ&DFRԀ)իZP7S$ x\]:)gp^{m_"tEu`+S~R^}0Ay5ISnhF۳hgxνC-78AHtz[GYki̘b.%iҸsHKDzǯf4П/S{`J(Z:TYKX:FPœXK6C4]gȸi/ұߋy Ca9krIqҾa^%W+4QR†oў)0}|.g^ ŸU[sւ1uȁy?`SpY/SFaf+`5ނq#_c(3lgE~|(HJ?K}v܋S0bښKrx{_ȴq,E_O;- P$ )pXg5r]aG'ؑ@ Fl[Dn_k6!M-籐QaQs]s~(P/2(MJfc]TSҢ[ߟY2]AP;;BSui\,EZ-t˟b$m@:W+u.t޻t8/Iy&'g&Мݏ"s~6i>LU{7 wFX44fFO(xs'7ApMKD`Sp-_?_ͭn=iLBT/b?va.$[ 1*pi۲+R+.KT6ӥFxtgg[whysnI@ zE\R?8&I\x^]UӓKzFD[N:wl ?(Յ"h趾+9$1n"Pҕ4RM*&vRk(9pI4WgN#Q=¢w,Ї;;x$4qy.{vͻg\懶xE!)tS/DoWǵRxj277wIΏؐOkZ,]Pt&~#C7U:##)\3ִMtl;vJ%z7RD]:C3Nv)Ά(H 0J뙩AՂȮ~."t`=I9qXU 0], gcX")\ \>6W L(EHk@FuT/цf21ϣL\!b1b9#ִt4KΊCdwz%jw!p~BR){B ;{Ǭ*tk&ŸF[/lF:O9}ݨ|AƓ4NFR=) qz|y^ >߇)ݼ<CxFwާ>Qv lկ8S)M~~./WLU sΗX)OJ ŷݶ7/`:E#©w$2DkRM-EJ +^}c;5M }W}XڮSp|FIVZ|K@eRey}DKl"O%"z1G9 tXWBPH޾Y5ں'޻j,Mef `ʖy240 /\7%IiIxM鳿ULd;0x8Qݵ`'MϖX]zK&-Ә0u#Ӕ` ERM)\r}ƀj_JTBՌmgkuÈ]"{MD֜ Qy6jj Ѝ8/pn(.H u0ךCk5 U4 o7 2 Uw3qM\qh(H b0$hоxQ*&{AF뀫-cavnUEΙʡmN{ayz~> IVZWE2p,Rv9CaO)̼{ETq(+ vHԁ@T%D` Sp- ߟ]1.b%p&8bU8[HP@rI6OR=FȜzh'1o;*ZD){f"xWOP-ZtuwZ|9΅t@&<@R*Iɮ,;]9$ڔ0k,=n%OZًkb'ţ"5;Q>\b @C2DqGR͋)W7#^'#oQJ`?1A߻r5@ nPQ.DύEegKB10%(Ȫom+ l5MK=-9_JR*-.;?%ٮ& E m`\x")g\S۫TfQn`q{t!P$4 'vnTl:aJd5\67FMysU5]N==xʼn>rRɻ_ZR6:y |T%+ ۋ35tC`jisI6 */ٓ C~+etKngs[` @⃤` ?[UrgL~n_79|`8'wV֡VU350VSςα~?DER=),'6oQ3:#8|+|;Y1p4sbѶ~w{DCRta byC,h S*Eĥ^̫ ޗZ,jZ̃> xՉ #)؞”y)O! ]ooLr OjA/ޤhZR\WyLԻJ;v87c!Zr4xvd=>ె0eEma+~<"Nd5Nid|[ZOB*8!Z2v9 += Lv )N/0*BNu ˼_&XI~,. w?i#kC\x#I9!k~𙲃4D,ٟDdoJ>RuF܌>=hx+Q!)6Cn'7-zR|041wBℳGlN:+{YprpuSE#ؔ(H 1',wS+n`Fay"mGů:?>]wh5cӃO Jm*L:EXbLgzHѡmJ#}/vH}Rl]@TU] Cac{xR")fj\T.|ny}ꄙCp3i*l)%|,J  J\0ף)Dj_os[}|D% {8YAp$[Q=8֢v7N_^A0Q^~}2G9lW Δ[;@SpnU vf.xLQUR]ە3I/gD6S=/b(dP-a$ J 2 L8QYى_:3Q[(e3{Sl \6. BH W0e,H[K=2Ǎ+t2y9;W;NӪ=R\VDTBJ#lI0\\^Ѻ;r΀7=DER͒)}芿ґ.=yJqo~=y %t&NW8Y?Z MF#(C}Yo?qI2gdtN!|\ܴ"Tx\īqfi8duv^(Tp LeS6] rn Ag Ql0ךZK}:Dp "x!)`rqVoݩ ֗nCx$ۄVe4Y^u>ːr~:)+[#P囉( H 2O0א*gmwWvo =><+R΍U3|y{8QxJ/G|Vam@S s$ېSp ɓ٧+bLXdhYg%\\sQAݡNu! $")ت\a|g|K+>)Bb{^4at`{7gB!`+a SŤ+>Wg,jmlU۝F7|A# a,gڞ jP]4$`K(H 0W9"#1R:viԉ9`Aa%#Eyu5HUh>pAhQ()H 0tJz_-{)r~?{~M9^w<KjS%Iv1SpOk.rti,nzY6'[yXaf< 9AG)` Lp=Pڤ@*Ϯ~I-AFYI"xaIK(t3v[Ϟ?袩;'t"Ct$ی*kKz9rے9:||j~於Qf;V Gu<:d )\n닞Z{^YMr*7IAl fOʁt-6!J& LUNLYvFN7O M։ _'抃F}:@J*d!).E` W=6O\>mְZ=JhL/w6nzd#)>'SpM?qC-G /)&Hh(~L\;:qIV :gLVD=?!`sHVo]#WS3PL Ji0W9[Ym̚$J OAy97ώ05*giWwH 0WQs~m*O{LN\F7& /7z R J.9(L%fҶ[#JE*ͪ⎎̌dZ۾SEj_dO@<$[w7Í^v!* 4q^e/7JD0ѓ9D㹠ӾB%IVz)0PNYCnm;!Ѳr5dU|Va x>DQ^!)V\o,T3O >ۙժ2Fx5 'Vq I` Xݣ Q l_)Jbi&O _QHT/]$C0[tĽ[O!k$[=k~8O`kF 9 7ƹz21`( KƓWow^R`+ Sp}ER<]׽Xeb ˈ97ejo6=jgo-1y|m'|0RIa]q!׉E*`8@-O\98rDmdjˣ Y3n?`$ !.adz^nP5%ꧺeTit3~>Eya gn?j NZ$l=ɡYRuw]vh?%ob~D C1pBN;S_2(x S OnyGZy_u[@~D @/>QMp 7#yѢsC?]VX ?t * P?e|u?V~}~D @1v{о-yDEWƍk#ã7-1?@ $C5  P?e|4hРA 4hРA 4hРA 4hРA 4hРA 4hРA 4hРA 4hРA 4hРA 4hРA 4hРA 4hРA 4hРA 4hРA 4h-PK τD)3-tiab/armory/databases/leveldb_headers/CURRENTMANIFEST-000010 PK &SD*tiab/armory/databases/leveldb_headers/LOCKPKτDM{)tiab/armory/databases/leveldb_headers/LOGM 0}O1uD&Ν Z(B^/OʲyWVkƍw(ya:SbˠR$dh}|NX"ua=WGe(^PKoxD&dl}-tiab/armory/databases/leveldb_headers/LOG.oldA 0F}O1umf$Ν Z)B|']c}#R>ewA|iL%qxTƁL63ڒv}inRa p˖biKviZ2zPK%SD#5tiab/armory/databases/leveldb_headers/MANIFEST-000002 @38`  X! :׾lL]*?chSmҳhz),pPKτDa5tiab/armory/databases/leveldb_headers/MANIFEST-000010=JQ hB*.EtSp#NDOm% B7(igVdY5 p>eqeP8Q>( UN./~l^Obz+giXtywIk  #"PK Dtiab/armory/mempool.binPKτD7o tiab/armory/multisigs.txtɮ@EH|`-hlchfv`fË2LJ%;[WU~y{<'˟ E %R4WUvwK<5@*}f^ZjRĎlC*M@ g,36uZ87LlyX|ֆv }d͉_|RQڻVT8NJ#/+0^mtmW3_׷ZxrM,ҤӠIսJH6>Wח[/w5i.ϲM<)zEA\uhu ĭkHEY?ʈ[߁ȳiXYk(,x*dYi5yaO?dCG]x3 lnuc-]ݰYog+cPf^ք" s궆'E^._\o)gvP$qSdܽGe=JM)1]"ݾh<Tq34uPyu^nJ!$Y!i{sǡ87d(r֯K85PmPn `O xeYw?*-`SX>@m@ԣ"'ӊt3ꈫzV%][BY83tBq[yd/ KY[gyaFvmԼ/ 2ݼ}Igzl(ŧ&ge7 w]͑Mg=;pEH' *KRJ ۃcv3,ۏMۆ,؎$" 5U.eHE8yvHK&]p=81M^n:٫:?)^x`/377䑑\?ɏHd-N%u?76v8_݊!cNm' EJtLb=^XߑJw ǰ>`Z{"3ȇ#%Ʒ'oƽJ K-3n"[͒["_Z%p`~VƔũK(Hڲ7/9qq^.o.PKAkDrn,tiab/armory/Simulfund_fmuHCs5G.sigcollect.tx@$VC˲cL7`)6cG9D2S>-' ·K@II 0K|FD Lt◤En͜^Sɨn'O+CI=#$?“-"(p!/zm7 t9GM2'd1l*9:uX~&wN癝[,m7!+|ѧ~wvڗGzD xB0 ][0!Ya}\;T(,>q ܧӗqDiWXZ4sIcƤ8vp@_wP͉>0 .W/NU.gstcZ"?VV9NC H+#Nr~adySbO?:,& 0juJ ?)%.]dIL:|3|n ZӜ??_HOQpzSdj?qG8M.p "z^]zMUsV!Nv`:w'|_uxsdKmsB Y\>Mx8o7r!Y{+`_ZjW%V2шweӍ^rq>W*d}Lwv̧/*wYC&TNyky"ʫFz*/!_@_ڱluahl7[M! +\LA"L"E0U+eS ;ŔaJ%ɝٱoۍ0K{=nl'7>ύvIx;_iqrg8k3x #\̋2}"{0ORK4q{<׶W)/ :Yul7OJgwh~zuY]`6q~a /xo57bKvH^,Lx]?dt?%*B+nOFZ9%[} /Yۊ1n'|+4$,}qpJY}富KkDg%4 Wڌ)_w[mY ϡe+y]TŽb{VO.O p-|t%ue8 jzB:PK͸SD5PV tiab/clean.sh5; 0 нmPTR((iDD85CY[5BE2 z,d6q nODPKVSD tiab/Makefile 0g):!C3 b),Ѧ%)I+$-;={H|j*pIq+}Fyv?ŅANWHőWҰ,Y}';POEnp>tAMoDGltr0}XEbjch h: Ėyɶ uXx-MPK{SD9MnRtiab/peers.datFPFKSllj6i.xM'&SLd)g $O|#`\Ş&+XgOw'4V:flA>WG$KLr̔ӸPK?QD$tiab/ v+v+ƘDvsPK?SD$#tiab/1/ ||ƘDvsPK?! C-qs$ Htiab/1/bitcoin.conf ;t}sDvsPK?QD$itiab/1/testnet3/ 6*6*ƘDvsPK? cD$ tiab/1/testnet3/.lock HRnM}sDvsPK? =DWLYY$ tiab/1/testnet3/bitcoin.conf i%8}s KDvsPK?QD$]tiab/1/testnet3/blocks/ **DvsPK?DqtY#$ tiab/1/testnet3/blocks/blk00000.dat +vN}sVDvsPK?QD$,tiab/1/testnet3/blocks/index/ **DvsPK?Dg+#|}%'$ gtiab/1/testnet3/blocks/index/000005.sst -n}sQDvsPK? SD'$DItiab/1/testnet3/blocks/index/000183.log lans*,**,*PK?DM'$ Itiab/1/testnet3/blocks/index/000189.log 7`uG޺uG޺uPK? „D*$$ Mtiab/1/testnet3/blocks/index/CURRENT )ߺu޺u DvsPK? „D!$ (Ntiab/1/testnet3/blocks/index/LOCK s ޺uk}sDvsPK?„Dxp $ gNtiab/1/testnet3/blocks/index/LOG G޺us ޺uvpDvsPK?}sRDvsPK?DgH2h$ tiab/armory/blkfiles.txt ĘvuuPK?NjDM7[=v*$ tiab/armory/Contrib_3NFePKw5_1BTC.promnote  bZn!.}suDvsPK?AjD9Av*$ tiab/armory/Contrib_4f71oDhA_1BTC.promnote JnR}sDvsPK?-kDL=r*$ tiab/armory/Contrib_J75shT7q_1BTC.promnote  Tn}s*DvsPK?QD$tiab/armory/databases/ l4+l4+DvsPK?QD&$Ftiab/armory/databases/leveldb_blkdata/ J+J+U"DvsPK?%SD0$tiab/armory/databases/leveldb_blkdata/000003.log #ns + +PK?gkD Sn]0$ tiab/armory/databases/leveldb_blkdata/000005.sst ;utÓutÓuPK?xDc0$ v_tiab/armory/databases/leveldb_blkdata/000008.sst JuuuPK?τD'[0$ Hhtiab/armory/databases/leveldb_blkdata/000011.sst -~@ul?ul?uPK?τD80$ qtiab/armory/databases/leveldb_blkdata/000012.log 5PuN@uN@uPK? τD)3-$ tiab/armory/databases/leveldb_blkdata/CURRENT AuhAuhAuPK? &SD*$ Etiab/armory/databases/leveldb_blkdata/LOCK F#ns}sDvsPK?τDp{)$ tiab/armory/databases/leveldb_blkdata/LOG \fu=u}DvsPK?oxDlo{-$ Otiab/armory/databases/leveldb_blkdata/LOG.old u7ɷu}DvsPK?%SD#5$tiab/armory/databases/leveldb_blkdata/MANIFEST-000002 #nsJ+J+PK?τD:5$ tiab/armory/databases/leveldb_blkdata/MANIFEST-000010 pAu_@u_@uPK?QD&$tiab/armory/databases/leveldb_headers/ +S++S+DvsPK?%SD!0|P0$Ftiab/armory/databases/leveldb_headers/000003.log #ns|[+|[+PK?gkD'i0$ tiab/armory/databases/leveldb_headers/000005.sst ́uuuPK?xD3S0N+y0$ сtiab/armory/databases/leveldb_headers/000008.sst ?uxuxuPK?τDt'8N+y0$ Otiab/armory/databases/leveldb_headers/000011.sst ~<}s DvsPK?τDM{)$ u tiab/armory/databases/leveldb_headers/LOG \fu8uVDvsPK?oxD&dl}-$ v tiab/armory/databases/leveldb_headers/LOG.old T uEzuVDvsPK?%SD#5$Kw tiab/armory/databases/leveldb_headers/MANIFEST-000002 #nsu+u+PK?τDa5$ :x tiab/armory/databases/leveldb_headers/MANIFEST-000010 " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main()armory-0.92.3/pytest/testArmoryD.py0000644000000000000000000002503612414772654016015 0ustar rootroot''' Created on Oct 8, 2013 @author: Andy ''' import sys sys.path.append('..') import os import time from pytest.Tiab import TiabTest from CppBlockUtils import SecureBinaryData, CryptoECDSA from armoryd import Armory_Json_Rpc_Server, PrivateKeyNotFound, \ InvalidBitcoinAddress, WalletUnlockNeeded, Armory_Daemon, AmountToJSON from armoryengine.ArmoryUtils import hex_to_binary, \ binary_to_base58, binary_to_hex, convertKeyDataToAddress, hash160_to_addrStr,\ hex_switchEndian, hash160, BIGENDIAN from armoryengine.BDM import TheBDM from armoryengine.PyBtcWallet import PyBtcWallet from armoryengine.Transaction import PyTx import unittest TEST_WALLET_NAME = 'Test Wallet Name' TEST_WALLET_DESCRIPTION = 'Test Wallet Description' TEST_WALLET_ID = '3VB8XSoY' RAW_TX1 = '0100000001b5dbdcea08ae1ff5a547755aaab7f468a6091a573ae76c6fa5a3fcf5ec65b804010000008b4830450220081341a4e803c7c8e64c3a3fd285dca34c9f7c71c4dfc2b576d761c5783ce735022100eea66ba382d00e628d86fc5bc1928a93765e26fd8252c4d01efe22147c12b91a01410458fec9d580b0c6842cae00aecd96e89af3ff56f5be49dae425046e64057e0f499acc35ec10e1b544e0f01072296c6fa60a68ea515e59d24ff794cf8923cd30f4ffffffff0200943577000000001976a91462d978319c7d7ac6cceed722c3d08aa81b37101288acf02c41d1160000001976a91409097379782fadfbd72e5a818219cf2eb56249d288ac00000000' TX_ID1 = 'db0ee46beff3a61f38bfc563f92c11449ed57c3d7d5cd5aafbe0114e5a9ceee4' TX_ID1_OUTPUT0_VALUE = 20.0 TX_ID1_OUTPUT1_VALUE = 979.9999 PASSPHRASE1 = 'abcde' UNLOCK_TIMEOUT = 5 # These tests could be run in or out of the TiaB class ArmoryDTest(TiabTest): def removeFileList(self, fileList): for f in fileList: if os.path.exists(f): os.remove(f) def setUp(self): self.verifyBlockHeight() self.fileA = os.path.join(self.armoryHomeDir, 'armory_%s_.wallet' % TEST_WALLET_ID) self.fileB = os.path.join(self.armoryHomeDir, 'armory_%s_backup.wallet' % TEST_WALLET_ID) self.fileAupd = os.path.join(self.armoryHomeDir, 'armory_%s_backup_unsuccessful.wallet' % TEST_WALLET_ID) self.fileBupd = os.path.join(self.armoryHomeDir, 'armory_%s_update_unsuccessful.wallet' % TEST_WALLET_ID) self.removeFileList([self.fileA, self.fileB, self.fileAupd, self.fileBupd]) # We need a controlled test, so we script the all the normally-random stuff self.privKey = SecureBinaryData('\xaa'*32) self.privKey2 = SecureBinaryData('\x33'*32) self.chainstr = SecureBinaryData('\xee'*32) theIV = SecureBinaryData(hex_to_binary('77'*16)) self.passphrase = SecureBinaryData('A self.passphrase') self.passphrase2 = SecureBinaryData('A new self.passphrase') self.wallet = PyBtcWallet().createNewWallet(withEncrypt=False, \ plainRootKey=self.privKey, \ chaincode=self.chainstr, \ IV=theIV, \ shortLabel=TEST_WALLET_NAME, \ longLabel=TEST_WALLET_DESCRIPTION, armoryHomeDir = self.armoryHomeDir) self.jsonServer = Armory_Json_Rpc_Server(self.wallet) TheBDM.registerWallet(self.wallet) def tearDown(self): self.removeFileList([self.fileA, self.fileB, self.fileAupd, self.fileBupd]) # Can't test with actual transactions in this environment. See ARMORY-34. # This wallet has no txs # def testListunspent(self): # actualResult = self.jsonServer.jsonrpc_listunspent() # self.assertEqual(actualResult, []) def testImportprivkey(self): originalLength = len(self.wallet.linearAddr160List) self.jsonServer.jsonrpc_importprivkey(binary_to_hex(self.privKey2.toBinStr())) self.assertEqual(len(self.wallet.linearAddr160List), originalLength+1) def testGettxout(self): txOut = self.jsonServer.jsonrpc_gettxout(TX_ID1, 0) self.assertEquals(txOut['value'],TX_ID1_OUTPUT0_VALUE) txOut = self.jsonServer.jsonrpc_gettxout(TX_ID1, 1) self.assertEquals(txOut['value'],TX_ID1_OUTPUT1_VALUE) # Cannot unit test actual balances. Only verify that getreceivedbyaddress return a 0 result. def testGetreceivedbyaddress(self): a160 = hash160(self.wallet.getNextUnusedAddress().binPublicKey65.toBinStr()) testAddr = hash160_to_addrStr(a160) result = self.jsonServer.jsonrpc_getreceivedbyaddress(testAddr) self.assertEqual(result, 0) def testGetrawtransaction(self): actualRawTx = self.jsonServer.jsonrpc_getrawtransaction(TX_ID1) pyTx = PyTx().unserialize(hex_to_binary(actualRawTx)) self.assertEquals(TX_ID1, binary_to_hex(pyTx.getHash(), BIGENDIAN)) def testBackupWallet(self): backupTestPath = os.path.join(self.armoryHomeDir, 'armory_%s_.wallet.backup.test' % TEST_WALLET_ID) # Remove backupTestPath in case it exists backupFileList = [backupTestPath, self.fileB] self.removeFileList(backupFileList) # Remove the backup test path that is to be created after tear down. self.addCleanup(self.removeFileList, backupFileList) self.jsonServer.jsonrpc_backupwallet(backupTestPath) self.assertTrue(os.path.exists(backupTestPath)) self.wallet.backupWalletFile() self.assertTrue(os.path.exists(self.fileB)) def testDecoderawtransaction(self): actualDD = self.jsonServer.jsonrpc_decoderawtransaction(RAW_TX1) # Test specific values pulled from bitcoin daemon's output for the test raw TX expectScriptStr = 'OP_DUP OP_HASH160 PUSHDATA(20) [62d978319c7d7ac6cceed722c3d08aa81b371012] OP_EQUALVERIFY OP_CHECKSIG' self.assertEqual(actualDD['locktime'], 0) self.assertEqual(actualDD['version'], 1) self.assertEqual(len(actualDD['vin']), 1) self.assertEqual(actualDD['vin'][0]['sequence'], 4294967295L) self.assertEqual(actualDD['vin'][0]['scriptSig']['hex'], '4830450220081341a4e803c7c8e64c3a3fd285dca34c9f7c71c4dfc2b576d761c5783ce735022100eea66ba382d00e628d86fc5bc1928a93765e26fd8252c4d01efe22147c12b91a01410458fec9d580b0c6842cae00aecd96e89af3ff56f5be49dae425046e64057e0f499acc35ec10e1b544e0f01072296c6fa60a68ea515e59d24ff794cf8923cd30f4') self.assertEqual(actualDD['vin'][0]['vout'], 1) self.assertEqual(actualDD['vin'][0]['txid'], '04b865ecf5fca3a56f6ce73a571a09a668f4b7aa5a7547a5f51fae08eadcdbb5') self.assertEqual(len(actualDD['vout']), 2) self.assertEqual(actualDD['vout'][0]['value'], 20.0) self.assertEqual(actualDD['vout'][0]['n'], 0) self.assertEqual(actualDD['vout'][0]['scriptAddrStrs']['reqSigs'], 1) self.assertEqual(actualDD['vout'][0]['scriptAddrStrs']['hex'], '76a91462d978319c7d7ac6cceed722c3d08aa81b37101288ac') self.assertEqual(actualDD['vout'][0]['scriptAddrStrs']['addresses'], ['mpXd2u8fPVYdL1Nf9bZ4EFnqhkNyghGLxL']) self.assertEqual(actualDD['vout'][0]['scriptAddrStrs']['asm'], expectScriptStr) self.assertEqual(actualDD['vout'][0]['scriptAddrStrs']['type'], 'Standard (PKH)') self.assertEqual(actualDD['vout'][1]['scriptAddrStrs']['type'], 'Standard (PKH)') def testDumpprivkey(self): testPrivKey = self.privKey.toBinStr() hash160 = convertKeyDataToAddress(testPrivKey) addr58 = hash160_to_addrStr(hash160) # Verify that a bogus addrss Raises InvalidBitcoinAddress Exception result = self.jsonServer.jsonrpc_dumpprivkey('bogus') self.assertEqual(result['Error Type'],'InvalidBitcoinAddress') result = self.jsonServer.jsonrpc_dumpprivkey(addr58) self.assertEqual(result['Error Type'],'PrivateKeyNotFound') # verify that the first private key can be found firstHash160 = self.wallet.getNextUnusedAddress().getAddr160() firstAddr58 = hash160_to_addrStr(firstHash160) actualPrivateKey = self.jsonServer.jsonrpc_dumpprivkey(firstAddr58) expectedPrivateKey = binary_to_hex(self.wallet.getAddrByHash160(firstHash160).serializePlainPrivateKey()) self.assertEqual(actualPrivateKey, expectedPrivateKey) # Verify that a locked wallet Raises WalletUnlockNeeded Exception kdfParams = self.wallet.computeSystemSpecificKdfParams(0.1) self.wallet.changeKdfParams(*kdfParams) self.wallet.changeWalletEncryption( securePassphrase=self.passphrase ) self.wallet.lock() result = self.jsonServer.jsonrpc_dumpprivkey(addr58) self.assertEqual(result['Error Type'],'WalletUnlockNeeded') def testEncryptwallet(self): kdfParams = self.wallet.computeSystemSpecificKdfParams(0.1) self.wallet.changeKdfParams(*kdfParams) self.jsonServer.jsonrpc_encryptwallet(PASSPHRASE1) self.assertTrue(self.wallet.isLocked) # Verify that a locked wallet Raises WalletUnlockNeeded Exception # self.assertRaises(WalletUnlockNeeded, self.jsonServer.jsonrpc_encryptwallet, PASSPHRASE1) result = self.jsonServer.jsonrpc_encryptwallet(PASSPHRASE1) print result def testUnlockwallet(self): kdfParams = self.wallet.computeSystemSpecificKdfParams(0.1) self.wallet.changeKdfParams(*kdfParams) self.jsonServer.jsonrpc_encryptwallet(PASSPHRASE1) self.assertTrue(self.wallet.isLocked) self.jsonServer.jsonrpc_unlockwallet(PASSPHRASE1, UNLOCK_TIMEOUT) self.assertFalse(self.wallet.isLocked) time.sleep(UNLOCK_TIMEOUT+1) self.wallet.checkWalletLockTimeout() self.assertTrue(self.wallet.isLocked) def testGetWalletInfo(self): wltInfo = self.jsonServer.jsonrpc_getwalletinfo() self.assertEqual(wltInfo['name'], TEST_WALLET_NAME) self.assertEqual(wltInfo['description'], TEST_WALLET_DESCRIPTION) self.assertEqual(wltInfo['balance'], AmountToJSON(self.wallet.getBalance('Spend'))) self.assertEqual(wltInfo['keypoolsize'], self.wallet.addrPoolSize) self.assertEqual(wltInfo['numaddrgen'], len(self.wallet.addrMap)) self.assertEqual(wltInfo['highestusedindex'], self.wallet.highestUsedChainIndex) # This should always return 0 balance # Need to create our own test net to test with balances def testGetBalance(self): for ballanceType in ['spendable','spend', 'unconf', \ 'unconfirmed', 'total', 'ultimate','unspent', 'full']: self.assertEqual(self.jsonServer.jsonrpc_getbalance(ballanceType), AmountToJSON(self.wallet.getBalance(ballanceType))) # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main() armory-0.92.3/pytest/testUserAddress.py0000644000000000000000000004415112414772654016663 0ustar rootrootimport sys sys.path.append('..') import unittest from pytest.Tiab import TiabTest from CppBlockUtils import SecureBinaryData, CryptoECDSA from armoryengine.ArmoryUtils import * from armoryengine.MultiSigUtils import calcLockboxID from armoryengine.Transaction import getTxOutScriptType from armoryengine.UserAddressUtils import getDisplayStringForScript, \ getScriptForUserString ################################################################################ class MockWallet(object): def __init__(self, wltID, lblName, scrAddr): self.labelName = lblName self.uniqueIDB58 = wltID self.scrAddr = scrAddr def hasScrAddr(self, scraddr): return scraddr==self.scrAddr ################################################################################ class MockLockbox(object): def __init__(self, lboxID, lboxName, script, M, N): self.uniqueIDB58 = lboxID self.shortName = lboxName self.binScript = script self.M = M self.N = N if getTxOutScriptType(script) == CPP_TXOUT_P2SH: self.p2shScrAddr = script_to_scrAddr(self.binScript) elif getTxOutScriptType(script) == CPP_TXOUT_MULTISIG: self.p2shScrAddr = script_to_scrAddr(script_to_p2sh_script(self.binScript)) else: raise BadAddressError('Must initialize [mocked] lbox with MS or P2SH') ################################################################################ class ScriptToDispStrTest(TiabTest): """ I know, these are not real unit tests! The problem here is that it's going to take a ton of time to prepare the 300 different test outputs, and it's very likely that I'll be tweaking the getDisplayStringForScript() many times before settling down on one I like. for now, this is simply printing the outputs of the function, and you manually review it. Once this method is settled down, we can make it a real unit test """ def setUp(self): self.pubKeyList = [self.makePubKey(a) for a in ['\xbb','\xaa','\xcc']] self.binScriptMS = pubkeylist_to_multisig_script(self.pubKeyList, 2) self.binScriptP2PK = pubkey_to_p2pk_script(self.pubKeyList[0]) self.p2pkHash160 = hash160(self.pubKeyList[0]) self.binScriptP2PKH = hash160_to_p2pkhash_script(self.p2pkHash160) self.binScriptP2SH_MS = script_to_p2sh_script(self.binScriptMS) self.binScriptNonStd = '\x01'*25 # Create two wallets, one will be used, one won't (both in map) self.wlt = MockWallet('AbCd1234z', 'Primary Long-Term Savings Wallet', script_to_scrAddr(self.binScriptP2PKH)) self.wltNull = MockWallet('YyBb7788b', 'This wallet is not used', script_to_scrAddr('\x00')) # Create two lockboxes, one will be used, one won't (both in map) self.lboxID = calcLockboxID(self.binScriptMS) self.lbox = MockLockbox(self.lboxID, 'My Ultra-Secure Savings Lockbox', self.binScriptP2SH_MS, 2, 3) # Create some other public keys to create a lockbox that won't be used self.pubKeyListOther = [self.makePubKey(a) for a in ['\x32','\x19','\xfc']] self.binScriptMSOther = pubkeylist_to_multisig_script(self.pubKeyListOther, 2) self.lboxNull = MockLockbox('ZzCc8899a', 'This lockbox is not used', self.binScriptMSOther, 3, 5) self.binScriptTestList = [ \ [self.binScriptP2PKH, 'mfi7ZGQSEUSudTFeXrSnZUpo9u1dAtTBon'], [self.binScriptP2PK, 'mfi7ZGQSEUSudTFeXrSnZUpo9u1dAtTBon'], [self.binScriptMS, '2N8pebcLPhfPhJpre5v1biNNTXxd9Qt3rcx'], [self.binScriptP2SH_MS, '2N8pebcLPhfPhJpre5v1biNNTXxd9Qt3rcx'], [self.binScriptNonStd, '2NEF6nBRNhSDcsZu8UB877nnqwCWdKXbZXq']] self.maxLengthTestList = [256, 60, 58, 54, 45, 32] ############################################################################# def makePubKey(self, byte): """ The input byte will be repeated 32 times, then treated as the x-value of a compressed pubkey. Uncompress it to get a real pubkey. We do this so that we have a valid public key for our tests, in which the validity of our 65-byte keys are checked """ sbd33 = SecureBinaryData('\x02' + byte*32) return CryptoECDSA().UncompressPoint(sbd33).toBinStr() ########################################################################## def createTestFunction(self, wltList, lboxList, binScrList, lenList, descr): """ All of the test basically reduce to a single, triply-nested loop with different inputs. """ def myTestFunc(): print '' print '*'*80 print descr print '*'*80 wltMap = {} for wlt in wltList: wltMap[wlt.uniqueIDB58] = wlt for scr,addrStr in binScrList: print '\nAddrStr:', addrStr for pref in [True, False]: print ' PrefID:', str(pref) for lenMax in lenList: outInfo = getDisplayStringForScript(scr, wltMap, lboxList, lenMax, prefIDOverAddr=pref) outStr = outInfo['String'] lenStr = str(len(outStr)).rjust(3) print ' ', lenStr,outStr self.assertTrue(isinstance(outStr, basestring)) self.assertTrue(len(outStr) <= lenMax) return myTestFunc ############################################################################# def testNoWalletsOrLockboxes(self): self.createTestFunction([], [], self.binScriptTestList, self.maxLengthTestList, "No wallets or lockboxes loaded")() ############################################################################# def testOneWalletNoLockbox(self): self.createTestFunction([self.wlt], [], self.binScriptTestList, self.maxLengthTestList, "One wallet but no lockboxes")() ############################################################################# def testOneWalletPlusNulls(self): self.createTestFunction([self.wlt, self.wltNull], [self.lboxNull], self.binScriptTestList, self.maxLengthTestList, "One wallet, one empty/null wallet and lockbox")() ############################################################################# def testNoWalletOneLockbox(self): self.createTestFunction([], [self.lbox], self.binScriptTestList, self.maxLengthTestList, "One lockbox no wallets")() ############################################################################# def testOneWalletOneLockbox(self): self.createTestFunction([self.wlt], [self.lbox], self.binScriptTestList, self.maxLengthTestList, "One lockbox and one wallet")() ############################################################################# def testTwoWalletsTwoLockboxes(self): self.createTestFunction([self.wlt], [self.lbox], self.binScriptTestList, self.maxLengthTestList, "Two wallets and two lockboxes (one empty of each)")() ################################################################################ class UserAddressToScript(TiabTest): """ Test a bunch of different strings that the user could enter, and check the output of getScriptForUserString(), with and without relevant wallets loaded/available """ def setUp(self): self.pubKeyList = [self.makePubKey(a) for a in ['\xaa','\x33','\x44']] self.binScriptMS = pubkeylist_to_multisig_script(self.pubKeyList, 2) self.binScriptP2PK = pubkey_to_p2pk_script(self.pubKeyList[0]) self.p2pkHash160 = hash160(self.pubKeyList[0]) self.binScriptP2PKH = hash160_to_p2pkhash_script(self.p2pkHash160) self.binScriptP2SH_MS = script_to_p2sh_script(self.binScriptMS) self.binScriptNonStd = '\x01'*25 pubKeyCompr = '\x02' + '\xaa'*32 self.binScriptP2PKCompr = pubkey_to_p2pk_script(pubKeyCompr) self.binScriptP2PKHCompr = hash160_to_p2pkhash_script(hash160(pubKeyCompr)) # Create two wallets, one will be used, one won't (both in map) self.wlt = MockWallet('AbCd1234z', 'Primary Long-Term Savings Wallet', script_to_scrAddr(self.binScriptP2PKH)) self.wlt2 = MockWallet('BcDe2345y', 'Another long-term savings wallet', script_to_scrAddr(self.binScriptP2PKCompr)) self.wltNull = MockWallet('YyBb7788b', 'This wallet is not used', script_to_scrAddr('\x00')) self.lboxID = calcLockboxID(self.binScriptMS) self.lbox = MockLockbox(self.lboxID, 'My Ultra-Secure Savings Lockbox', self.binScriptMS, 2, 3) # Create some other public keys to create a lockbox that won't be used self.pubKeyListOther = [self.makePubKey(a) for a in ['\x32','\x19','\xfc']] self.binScriptMSOther = pubkeylist_to_multisig_script(self.pubKeyListOther, 2) lboxIDOther = calcLockboxID(self.binScriptMSOther) self.lboxNull = MockLockbox(lboxIDOther, 'This lockbox is not used', self.binScriptMSOther, 3, 5) # When all wallets and lockboxes are avail, these will all be recognized self.validInputStrings = [ \ 'n4TMVYp9BX4yDtjqPgJHrnRPu7zdZ2aLGj', '2N1j5GnC97dXRprEzbQVJJAYXMqCsffdX29', 'Lockbox[%s]' % self.lboxID, 'Lockbox[Bare:%s]' % self.lboxID, binary_to_hex(self.pubKeyList[0]), binary_to_hex(pubKeyCompr)] # a compressed key # Now a few others that should fail to return useful info self.badInputStrings = [ \ 'mpduARVk95R9EXDtbb54fZG1VVQ4CWZmY6', # bad checksum on addr 'Lockbox{%s}' % self.lboxID, 'Lockbox[BARE:%s]' % self.lboxID, # wrong casing 'abc123', ''] ############################################################################# def makePubKey(self, byte): """ The input byte will be repeated 32 times, then treated as the x-value of a compressed pubkey. Uncompress it to get a real pubkey. We do this so that we have a valid public key for our tests, in which the validity of our 65-byte keys are checked """ sbd33 = SecureBinaryData('\x02' + byte*32) return CryptoECDSA().UncompressPoint(sbd33).toBinStr() ############################################################################# def testReadP2PKH(self): wltMap = {} lboxList = [] scrInfo = getScriptForUserString(self.validInputStrings[0], wltMap, lboxList) self.assertEqual(scrInfo['Script'], self.binScriptP2PKH) self.assertEqual(scrInfo['WltID'], None) self.assertEqual(scrInfo['LboxID'], None) self.assertTrue(scrInfo['ShowID']) wltMap = {} wltMap[self.wlt.uniqueIDB58] = self.wlt wltMap[self.wlt2.uniqueIDB58] = self.wlt2 lboxList = [self.lbox] scrInfo = getScriptForUserString(self.validInputStrings[0], wltMap, lboxList) self.assertEqual(scrInfo['Script'], self.binScriptP2PKH) self.assertEqual(scrInfo['WltID'], 'AbCd1234z') self.assertEqual(scrInfo['LboxID'], None) self.assertTrue(scrInfo['ShowID']) ############################################################################# def testReadP2SH(self): wltMap = {} lboxList = [] scrInfo = getScriptForUserString(self.validInputStrings[1], wltMap, lboxList) self.assertEqual(scrInfo['Script'], self.binScriptP2SH_MS) self.assertEqual(scrInfo['WltID'], None) self.assertEqual(scrInfo['LboxID'], None) self.assertTrue(scrInfo['ShowID']) wltMap = {} wltMap[self.wlt.uniqueIDB58] = self.wlt wltMap[self.wlt2.uniqueIDB58] = self.wlt2 lboxList = [self.lbox] scrInfo = getScriptForUserString(self.validInputStrings[1], wltMap, lboxList) self.assertEqual(scrInfo['Script'], self.binScriptP2SH_MS) self.assertEqual(scrInfo['WltID'], None) self.assertEqual(scrInfo['LboxID'], self.lboxID) self.assertTrue(scrInfo['ShowID']) ############################################################################# def testReadLockboxP2SH(self): #self.validInputStrings = [ \ #'1CAGDKTRT1erLn2pHUQjZcUHuQvEyxGp3j', #'3HGSXsQN6CtM73E6QnPj6RPCKcQyXS4Sek', #'Lockbox[%s]' % self.lboxID, #'Lockbox[Bare:%s]' % self.lboxID, #binary_to_hex(self.pubKeyList[0]), #binary_to_hex(pubKeyCompr] # a compressed key wltMap = {} lboxList = [] scrInfo = getScriptForUserString(self.validInputStrings[2], wltMap, lboxList) self.assertEqual(scrInfo['Script'], None) self.assertEqual(scrInfo['WltID'], None) self.assertEqual(scrInfo['LboxID'], None) wltMap = {} wltMap[self.wlt.uniqueIDB58] = self.wlt wltMap[self.wlt2.uniqueIDB58] = self.wlt2 lboxList = [self.lbox] scrInfo = getScriptForUserString(self.validInputStrings[2], wltMap, lboxList) self.assertEqual(scrInfo['Script'], self.binScriptP2SH_MS) self.assertEqual(scrInfo['WltID'], None) self.assertEqual(scrInfo['LboxID'], self.lboxID) self.assertFalse(scrInfo['ShowID']) ############################################################################# def testReadLockboxBare(self): #self.validInputStrings = [ \ #'1CAGDKTRT1erLn2pHUQjZcUHuQvEyxGp3j', #'3HGSXsQN6CtM73E6QnPj6RPCKcQyXS4Sek', #'Lockbox[%s]' % self.lboxID, #'Lockbox[Bare:%s]' % self.lboxID, #binary_to_hex(self.pubKeyList[0]), #binary_to_hex(pubKeyCompr] # a compressed key wltMap = {} lboxList = [] scrInfo = getScriptForUserString(self.validInputStrings[3], wltMap, lboxList) self.assertEqual(scrInfo['Script'], None) self.assertEqual(scrInfo['WltID'], None) self.assertEqual(scrInfo['LboxID'], None) wltMap = {} wltMap[self.wlt.uniqueIDB58] = self.wlt wltMap[self.wlt2.uniqueIDB58] = self.wlt2 lboxList = [self.lbox] scrInfo = getScriptForUserString(self.validInputStrings[3], wltMap, lboxList) self.assertEqual(scrInfo['Script'], self.binScriptMS) self.assertEqual(scrInfo['WltID'], None) self.assertEqual(scrInfo['LboxID'], self.lboxID) self.assertFalse(scrInfo['ShowID']) ############################################################################# def testReadPubKeyUncompr(self): #self.validInputStrings = [ \ #'1CAGDKTRT1erLn2pHUQjZcUHuQvEyxGp3j', #'3HGSXsQN6CtM73E6QnPj6RPCKcQyXS4Sek', #'Lockbox[%s]' % self.lboxID, #'Lockbox[Bare:%s]' % self.lboxID, #binary_to_hex(self.pubKeyList[0]), #binary_to_hex(pubKeyCompr] # a compressed key wltMap = {} lboxList = [] scrInfo = getScriptForUserString(self.validInputStrings[4], wltMap, lboxList) self.assertEqual(scrInfo['Script'], self.binScriptP2PKH) self.assertEqual(scrInfo['WltID'], None) self.assertEqual(scrInfo['LboxID'], None) self.assertFalse(scrInfo['ShowID']) wltMap = {} wltMap[self.wlt.uniqueIDB58] = self.wlt wltMap[self.wlt2.uniqueIDB58] = self.wlt2 lboxList = [self.lbox] scrInfo = getScriptForUserString(self.validInputStrings[4], wltMap, lboxList) self.assertEqual(scrInfo['Script'], self.binScriptP2PKH) self.assertEqual(scrInfo['WltID'], 'AbCd1234z') self.assertEqual(scrInfo['LboxID'], None) self.assertFalse(scrInfo['ShowID']) ############################################################################# def testReadPubKeyCompr(self): #self.validInputStrings = [ \ #'1CAGDKTRT1erLn2pHUQjZcUHuQvEyxGp3j', #'3HGSXsQN6CtM73E6QnPj6RPCKcQyXS4Sek', #'Lockbox[%s]' % self.lboxID, #'Lockbox[Bare:%s]' % self.lboxID, #binary_to_hex(self.pubKeyList[0]), #binary_to_hex(pubKeyCompr] # a compressed key wltMap = {} lboxList = [] scrInfo = getScriptForUserString(self.validInputStrings[5], wltMap, lboxList) self.assertEqual(scrInfo['Script'], self.binScriptP2PKHCompr) self.assertEqual(scrInfo['WltID'], None) self.assertEqual(scrInfo['LboxID'], None) self.assertFalse(scrInfo['ShowID']) wltMap = {} wltMap[self.wlt.uniqueIDB58] = self.wlt wltMap[self.wlt2.uniqueIDB58] = self.wlt2 lboxList = [self.lbox] scrInfo = getScriptForUserString(self.validInputStrings[5], wltMap, lboxList) self.assertEqual(scrInfo['Script'], self.binScriptP2PKHCompr) self.assertEqual(scrInfo['WltID'], 'BcDe2345y') self.assertEqual(scrInfo['LboxID'], None) self.assertFalse(scrInfo['ShowID']) ############################################################################# def testReadBadStrings(self): wltMap = {} lboxList = [] for badStr in self.badInputStrings: scrInfo = getScriptForUserString(badStr, wltMap, lboxList) self.assertEqual(scrInfo['Script'], None) self.assertEqual(scrInfo['WltID'], None) self.assertEqual(scrInfo['LboxID'], None) wltMap = {} wltMap[self.wlt.uniqueIDB58] = self.wlt wltMap[self.wlt2.uniqueIDB58] = self.wlt2 lboxList = [self.lbox] for badStr in self.badInputStrings: scrInfo = getScriptForUserString(badStr, wltMap, lboxList) self.assertEqual(scrInfo['Script'], None) self.assertEqual(scrInfo['WltID'], None) self.assertEqual(scrInfo['LboxID'], None) # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main()armory-0.92.3/pytest/testPyBtcAddress.py0000644000000000000000000004372712414772654016776 0ustar rootroot''' Created on Aug 6, 2013 @author: Andy ''' import sys sys.path.append('..') from pytest.Tiab import TiabTest, TOP_TIAB_BLOCK import unittest from CppBlockUtils import CryptoECDSA, SecureBinaryData from armoryengine.ArmoryUtils import hex_to_binary, RightNow, int_to_binary, \ checkAddrStrValid, hash256, UnserializeError, hash160_to_addrStr from armoryengine.PyBtcAddress import PyBtcAddress sys.argv.append('--nologging') INIT_VECTOR = '77'*16 TEST_ADDR1_PRIV_KEY_ENCR1 = '500c41607d79c766859e6d9726ef1ea0fdf095922f3324454f6c4c34abcb23a5' TEST_ADDR1_PRIV_KEY_ENCR2 = '7966cf5886494246cc5aaf7f1a4a2777cd6126612e7029d79ef9df47f6d6927d' TEST_ADDR1_PRIV_KEY_ENCR3 = '0db5c1e9a8d1ebc0525bdb534626033b948804a9a34871d67bf58a3df11d6888' TEST_ADDR1_PRIV_KEY_ENCR4 = '5db1314a20ae9fc978477ab3fe16ab17b246d813a541ecdd4143fcf082b19407' TEST_PUB_KEY1 = '046c35e36776e997883ad4269dcc0696b10d68f6864ae73b8ad6ad03e879e43062a0139095ece3bd653b809fa7e8c7d78ffe6fac75a84c8283d8a000890bfc879d' # Create an address to use for all subsequent tests PRIVATE_KEY = SecureBinaryData(hex_to_binary('aa'*32)) PRIVATE_CHECKSUM = PRIVATE_KEY.getHash256()[:4] PUBLIC_KEY = CryptoECDSA().ComputePublicKey(PRIVATE_KEY) ADDRESS_20 = PUBLIC_KEY.getHash160() TEST_BLOCK_NUM = 100 # We pretend that we plugged some passphrases through a KDF FAKE_KDF_OUTPUT1 = SecureBinaryData( hex_to_binary('11'*32) ) FAKE_KDF_OUTPUT2 = SecureBinaryData( hex_to_binary('22'*32) ) class PyBtcAddressTest(TiabTest): # TODO: This test needs more verification of the results. def testEncryptedAddress(self): # test serialization and unserialization of an empty PyBtcAddrss # Should serialize to a string that starts with 20 bytes of zeros # Unserialize should throw an UnserializeError caused by checksum mismatch emptyBtcAddr = PyBtcAddress() emptyBtcAddrSerialized = emptyBtcAddr.serialize() self.assertEqual(emptyBtcAddrSerialized[:20], hex_to_binary('00'*20)) self.assertRaises(UnserializeError, PyBtcAddress().unserialize, emptyBtcAddrSerialized) # Test non-crashing testAddr1 = PyBtcAddress().createFromPlainKeyData(PRIVATE_KEY, ADDRESS_20) testAddr2 = PyBtcAddress().createFromPlainKeyData(PRIVATE_KEY, ADDRESS_20, chksum=PRIVATE_CHECKSUM) testAddr3 = PyBtcAddress().createFromPlainKeyData(PRIVATE_KEY, ADDRESS_20, publicKey65=PUBLIC_KEY) testAddr4 = PyBtcAddress().createFromPlainKeyData(PRIVATE_KEY, ADDRESS_20, publicKey65=PUBLIC_KEY, skipCheck=True) testAddr5 = PyBtcAddress().createFromPlainKeyData(PRIVATE_KEY, ADDRESS_20, skipPubCompute=True) testString = testAddr1.toString() self.assertTrue(len(testString) > 0) testAddr = PyBtcAddress().createFromPlainKeyData(PRIVATE_KEY, ADDRESS_20, publicKey65=PUBLIC_KEY) serializedAddr1 = testAddr.serialize() retestAddr = PyBtcAddress().unserialize(serializedAddr1) serializedRetest1 = retestAddr.serialize() self.assertEqual(serializedAddr1, serializedRetest1) theIV = SecureBinaryData(hex_to_binary(INIT_VECTOR)) testAddr.enableKeyEncryption(theIV) testAddr.lock(FAKE_KDF_OUTPUT1) self.assertTrue(testAddr.useEncryption) self.assertTrue(testAddr.isLocked) self.assertEqual(testAddr.binPrivKey32_Plain.toHexStr(), '') self.assertEqual(testAddr.binPrivKey32_Encr.toHexStr(), TEST_ADDR1_PRIV_KEY_ENCR1) serializedAddr2 = testAddr.serialize() retestAddr = PyBtcAddress().unserialize(serializedAddr2) serializedRetest2 = retestAddr.serialize() self.assertEqual(serializedAddr2, serializedRetest2) testAddr.unlock(FAKE_KDF_OUTPUT1) self.assertFalse(testAddr.isLocked) self.assertEqual(testAddr.binPrivKey32_Plain.toHexStr(), PRIVATE_KEY.toHexStr()) testAddr.changeEncryptionKey(None, FAKE_KDF_OUTPUT1) self.assertTrue(testAddr.useEncryption) self.assertFalse(testAddr.isLocked) self.assertEqual(testAddr.binPrivKey32_Plain.toHexStr(), PRIVATE_KEY.toHexStr()) self.assertEqual(testAddr.binPrivKey32_Encr.toHexStr(), TEST_ADDR1_PRIV_KEY_ENCR1) # Save off this data for a later test addr20_1 = testAddr.getAddr160() encryptedKey1 = testAddr.binPrivKey32_Encr encryptionIV1 = testAddr.binInitVect16 plainPubKey1 = testAddr.binPublicKey65 # OP(Key1 --> Unencrypted) testAddr.changeEncryptionKey(FAKE_KDF_OUTPUT1, None) self.assertFalse(testAddr.useEncryption) self.assertFalse(testAddr.isLocked) self.assertEqual(testAddr.binPrivKey32_Plain.toHexStr(), PRIVATE_KEY.toHexStr()) self.assertEqual(testAddr.binPrivKey32_Encr.toHexStr(), '') # OP(Unencrypted --> Key2) if not testAddr.isKeyEncryptionEnabled(): testAddr.enableKeyEncryption(theIV) testAddr.changeEncryptionKey(None, FAKE_KDF_OUTPUT2) self.assertTrue(testAddr.useEncryption) self.assertFalse(testAddr.isLocked) self.assertEqual(testAddr.binPrivKey32_Plain.toHexStr(), PRIVATE_KEY.toHexStr()) self.assertEqual(testAddr.binPrivKey32_Encr.toHexStr(), TEST_ADDR1_PRIV_KEY_ENCR2) # Save off this data for a later test addr20_2 = testAddr.getAddr160() encryptedKey2 = testAddr.binPrivKey32_Encr encryptionIV2 = testAddr.binInitVect16 plainPubKey2 = testAddr.binPublicKey65 # OP(Key2 --> Key1) testAddr.changeEncryptionKey(FAKE_KDF_OUTPUT2, FAKE_KDF_OUTPUT1) self.assertTrue(testAddr.useEncryption) self.assertFalse(testAddr.isLocked) self.assertEqual(testAddr.binPrivKey32_Plain.toHexStr(), PRIVATE_KEY.toHexStr()) self.assertEqual(testAddr.binPrivKey32_Encr.toHexStr(), TEST_ADDR1_PRIV_KEY_ENCR1) # OP(Key1 --> Lock --> Key2) testAddr.lock(FAKE_KDF_OUTPUT1) testAddr.changeEncryptionKey(FAKE_KDF_OUTPUT1, FAKE_KDF_OUTPUT2) self.assertTrue(testAddr.useEncryption) self.assertTrue(testAddr.isLocked) self.assertEqual(testAddr.binPrivKey32_Plain.toHexStr(), '') self.assertEqual(testAddr.binPrivKey32_Encr.toHexStr(), TEST_ADDR1_PRIV_KEY_ENCR2) # OP(Key2 --> Lock --> Unencrypted) testAddr.changeEncryptionKey(FAKE_KDF_OUTPUT2, None) self.assertFalse(testAddr.useEncryption) self.assertFalse(testAddr.isLocked) self.assertEqual(testAddr.binPrivKey32_Plain.toHexStr(), PRIVATE_KEY.toHexStr()) self.assertEqual(testAddr.binPrivKey32_Encr.toHexStr(), '') # Encryption Key Tests: self.assertEqual(testAddr.serializePlainPrivateKey(), PRIVATE_KEY.toBinStr()) # Test loading pre-encrypted key data testAddr = PyBtcAddress().createFromEncryptedKeyData(addr20_1, encryptedKey1, encryptionIV1) self.assertTrue(testAddr.useEncryption) self.assertTrue(testAddr.isLocked) self.assertEqual(testAddr.binPrivKey32_Plain.toHexStr(), '') self.assertEqual(testAddr.binPrivKey32_Encr.toHexStr(), TEST_ADDR1_PRIV_KEY_ENCR1) # OP(EncrAddr --> Unlock1) testAddr.unlock(FAKE_KDF_OUTPUT1) self.assertTrue(testAddr.useEncryption) self.assertFalse(testAddr.isLocked) self.assertEqual(testAddr.binPrivKey32_Plain.toHexStr(), PRIVATE_KEY.toHexStr()) self.assertEqual(testAddr.binPrivKey32_Encr.toHexStr(), TEST_ADDR1_PRIV_KEY_ENCR1) # OP(Unlock1 --> Lock1) testAddr.lock() self.assertTrue(testAddr.useEncryption) self.assertTrue(testAddr.isLocked) self.assertEqual(testAddr.binPrivKey32_Plain.toHexStr(), '') self.assertEqual(testAddr.binPrivKey32_Encr.toHexStr(), TEST_ADDR1_PRIV_KEY_ENCR1) # OP(Lock1 --> Lock2) testAddr.changeEncryptionKey(FAKE_KDF_OUTPUT1, FAKE_KDF_OUTPUT2) self.assertTrue(testAddr.useEncryption) self.assertTrue(testAddr.isLocked) self.assertEqual(testAddr.binPrivKey32_Plain.toHexStr(), '') self.assertEqual(testAddr.binPrivKey32_Encr.toHexStr(), TEST_ADDR1_PRIV_KEY_ENCR2) # Test serializing locked wallet from pre-encrypted data' serializedAddr = testAddr.serialize() retestAddr = PyBtcAddress().unserialize(serializedAddr) serializedRetest = retestAddr.serialize() self.assertEqual(serializedAddr, serializedRetest) ############################################################################# # Now testing chained-key (deterministic) address generation # Test chained priv key generation # Starting with plain key data chaincode = SecureBinaryData(hex_to_binary('ee'*32)) addr0 = PyBtcAddress().createFromPlainKeyData(PRIVATE_KEY, ADDRESS_20) addr0.markAsRootAddr(chaincode) pub0 = addr0.binPublicKey65 # Test serializing address-chain-root serializedAddr = addr0.serialize() retestAddr = PyBtcAddress().unserialize(serializedAddr) serializedRetest = retestAddr.serialize() self.assertEqual(serializedAddr, serializedRetest) self.assertEqual(retestAddr.binPrivKey32_Plain.toHexStr(), PRIVATE_KEY.toHexStr()) # Generate chained PRIVATE key address # OP(addr[0] --> addr[1]) addr1 = addr0.extendAddressChain() self.assertEqual(addr1.binPrivKey32_Plain.toHexStr(), TEST_ADDR1_PRIV_KEY_ENCR3) # OP(addr[0] --> addr[1]) [again]' addr1a = addr0.extendAddressChain() self.assertEqual(addr1a.binPrivKey32_Plain.toHexStr(), TEST_ADDR1_PRIV_KEY_ENCR3) # OP(addr[1] --> addr[2]) addr2 = addr1.extendAddressChain() pub2 = addr2.binPublicKey65.copy() priv2 = addr2.binPrivKey32_Plain.copy() self.assertEqual(priv2.toHexStr(), TEST_ADDR1_PRIV_KEY_ENCR4) # Addr1.PRIVATE_KEY == Addr1a.PRIVATE_KEY:', self.assertEqual(addr1.binPublicKey65, addr1a.binPublicKey65) # Test serializing priv-key-chained', serializedAddr = addr2.serialize() retestAddr = PyBtcAddress().unserialize(serializedAddr) serializedRetest = retestAddr.serialize() self.assertEqual(serializedAddr, serializedRetest) ############################################################################# # Generate chained PUBLIC key address # addr[0] addr0 = PyBtcAddress().createFromPublicKeyData(pub0) addr0.markAsRootAddr(chaincode) self.assertEqual(addr0.chainIndex, -1) self.assertEqual(addr0.chaincode, chaincode) # Test serializing pub-key-only-root', serializedAddr = addr0.serialize() retestAddr = PyBtcAddress().unserialize(serializedAddr) serializedRetest = retestAddr.serialize() self.assertEqual(serializedAddr, serializedRetest) # OP(addr[0] --> addr[1])' addr1 = addr0.extendAddressChain() self.assertEqual(addr1.binPrivKey32_Plain.toHexStr(), '') # OP(addr[1] --> addr[2])' addr2 = addr1.extendAddressChain() pub2a = addr2.binPublicKey65.copy() self.assertEqual(addr2.binPrivKey32_Plain.toHexStr(), '') self.assertEqual(pub2a.toHexStr(), TEST_PUB_KEY1) # Addr2.PublicKey == Addr2a.PublicKey:' # Test serializing pub-key-from-chain' serializedAddr = addr2.serialize() retestAddr = PyBtcAddress().unserialize(serializedAddr) serializedRetest = retestAddr.serialize() self.assertEqual(serializedAddr, serializedRetest) ############################################################################# # Generate chained keys from locked addresses addr0 = PyBtcAddress().createFromPlainKeyData( PRIVATE_KEY, \ willBeEncr=True, IV16=theIV) addr0.markAsRootAddr(chaincode) # OP(addr[0] plain) # Test serializing unlocked addr-chain-root serializedAddr = addr0.serialize() retestAddr = PyBtcAddress().unserialize(serializedAddr) serializedRetest = retestAddr.serialize() self.assertEqual(serializedAddr, serializedRetest) self.assertFalse(retestAddr.useEncryption) # OP(addr[0] locked) addr0.lock(FAKE_KDF_OUTPUT1) self.assertEqual(addr0.binPrivKey32_Plain.toHexStr(), '') # OP(addr[0] w/Key --> addr[1]) addr1 = addr0.extendAddressChain(FAKE_KDF_OUTPUT1, newIV=theIV) self.assertEqual(addr1.binPrivKey32_Plain.toHexStr(), '') # OP(addr[1] w/Key --> addr[2]) addr2 = addr1.extendAddressChain(FAKE_KDF_OUTPUT1, newIV=theIV) addr2.unlock(FAKE_KDF_OUTPUT1) priv2a = addr2.binPrivKey32_Plain.copy() addr2.lock() self.assertEqual(addr2.binPrivKey32_Plain.toHexStr(), '') # Addr2.priv == Addr2a.priv: self.assertEqual(priv2, priv2a) # Test serializing chained address from locked root serializedAddr = addr2.serialize() retestAddr = PyBtcAddress().unserialize(serializedAddr) serializedRetest = retestAddr.serialize() self.assertEqual(serializedAddr, serializedRetest) ############################################################################# # Generate chained keys from locked addresses, no unlocking addr0 = PyBtcAddress().createFromPlainKeyData( PRIVATE_KEY, \ willBeEncr=True, IV16=theIV) addr0.markAsRootAddr(chaincode) # OP(addr[0] locked) addr0.lock(FAKE_KDF_OUTPUT1) self.assertEqual(addr0.binPrivKey32_Plain.toHexStr(), '') # OP(addr[0] locked --> addr[1] locked)' addr1 = addr0.extendAddressChain(newIV=theIV) self.assertEqual(addr1.binPrivKey32_Plain.toHexStr(), '') # OP(addr[1] locked --> addr[2] locked) addr2 = addr1.extendAddressChain(newIV=theIV) pub2b = addr2.binPublicKey65.copy() self.assertEqual(addr2.binPrivKey32_Plain.toHexStr(), '') self.assertEqual(pub2b.toHexStr(), TEST_PUB_KEY1) # Addr2.Pub == Addr2b.pub: # Test serializing priv-key-bearing address marked for unlock serializedAddr = addr2.serialize() retestAddr = PyBtcAddress().unserialize(serializedAddr) serializedRetest = retestAddr.serialize() self.assertEqual(serializedAddr, serializedRetest) addr2.unlock(FAKE_KDF_OUTPUT1) priv2b = addr2.binPrivKey32_Plain.copy() # OP(addr[2] locked --> unlocked) self.assertEqual(priv2b.toHexStr(), TEST_ADDR1_PRIV_KEY_ENCR4) addr2.lock() # OP(addr[2] unlocked --> locked)' # Addr2.priv == Addr2b.priv: self.assertEqual(priv2, priv2b) # TODO: Add coverage for condition where TheBDM is in BlockchainReady state. def testTouch(self): testAddr = PyBtcAddress().createFromPlainKeyData(PRIVATE_KEY, ADDRESS_20, publicKey65=PUBLIC_KEY) theIV = SecureBinaryData(hex_to_binary(INIT_VECTOR)) testAddr.enableKeyEncryption(theIV) rightNow = RightNow() testAddr.touch(rightNow) self.assertEqual(testAddr.timeRange[0], long(rightNow)) self.assertEqual(testAddr.timeRange[1], long(rightNow)) testAddr.touch(0) self.assertEqual(testAddr.timeRange[0], long(0)) self.assertEqual(testAddr.timeRange[1], long(rightNow)) testAddr.touch(blkNum=TEST_BLOCK_NUM) self.assertEqual(testAddr.blkRange[0], TEST_BLOCK_NUM) self.assertEqual(testAddr.blkRange[1], TOP_TIAB_BLOCK) testAddr.touch(blkNum=0) self.assertEqual(testAddr.blkRange[0], 0) self.assertEqual(testAddr.blkRange[1], TOP_TIAB_BLOCK) # Cover the case where the blkRange[0] starts at 0 testAddr.touch(blkNum=TEST_BLOCK_NUM) self.assertEqual(testAddr.blkRange[0], TEST_BLOCK_NUM) self.assertEqual(testAddr.blkRange[1], TOP_TIAB_BLOCK) def testCopy(self): testAddr = PyBtcAddress().createFromPlainKeyData(PRIVATE_KEY, ADDRESS_20, publicKey65=PUBLIC_KEY) testCopy = testAddr.copy() self.assertEqual(testAddr.binPrivKey32_Plain, testCopy.binPrivKey32_Plain) self.assertEqual(testAddr.binPrivKey32_Encr, testCopy.binPrivKey32_Encr) self.assertEqual(testAddr.binPublicKey65, testCopy.binPublicKey65) self.assertEqual(testAddr.binInitVect16, testCopy.binInitVect16) self.assertEqual(testAddr.isLocked, testCopy.isLocked) self.assertEqual(testAddr.useEncryption, testCopy.useEncryption) self.assertEqual(testAddr.isInitialized, testCopy.isInitialized) self.assertEqual(testAddr.keyChanged, testCopy.keyChanged) self.assertEqual(testAddr.walletByteLoc, testCopy.walletByteLoc) self.assertEqual(testAddr.chaincode, testCopy.chaincode) self.assertEqual(testAddr.chainIndex, testCopy.chainIndex) def testVerifyEncryptionKey(self): testAddr = PyBtcAddress().createFromPlainKeyData(PRIVATE_KEY, ADDRESS_20, publicKey65=PUBLIC_KEY) theIV = SecureBinaryData(hex_to_binary(INIT_VECTOR)) testAddr.enableKeyEncryption(theIV) self.assertFalse(testAddr.verifyEncryptionKey(FAKE_KDF_OUTPUT1)) testAddr.lock(FAKE_KDF_OUTPUT1) self.assertTrue(testAddr.verifyEncryptionKey(FAKE_KDF_OUTPUT1)) self.assertFalse(testAddr.verifyEncryptionKey(FAKE_KDF_OUTPUT2)) def testSimpleAddress(self): # Execute the tests with Satoshi's public key from the Bitcoin specification page satoshiPubKeyHex = '04fc9702847840aaf195de8442ebecedf5b095cdbb9bc716bda9110971b28a49e0ead8564ff0db22209e0374782c093bb899692d524e9d6a6956e7c5ecbcd68284' addrPiece1Hex = '65a4358f4691660849d9f235eb05f11fabbd69fa' addrPiece1Bin = hex_to_binary(addrPiece1Hex) satoshiAddrStr = hash160_to_addrStr(addrPiece1Bin) saddr = PyBtcAddress().createFromPublicKey( hex_to_binary(satoshiPubKeyHex) ) print '\tAddr calc from pubkey: ', saddr.calculateAddrStr() self.assertTrue(checkAddrStrValid(satoshiAddrStr)) testAddr = PyBtcAddress().createFromPlainKeyData(PRIVATE_KEY, ADDRESS_20, publicKey65=PUBLIC_KEY) msg = int_to_binary(39029348428) theHash = hash256(msg) derSig = testAddr.generateDERSignature(theHash) # Testing ECDSA signing & verification -- arbitrary binary strings: self.assertTrue(testAddr.verifyDERSignature( theHash, derSig)) # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main()armory-0.92.3/pytest/testParseAnnounce.py0000644000000000000000000002075512414772654017204 0ustar rootrootimport sys sys.path.append('..') from pytest.Tiab import TiabTest import unittest from armoryengine.parseAnnounce import * from armoryengine.ArmoryUtils import * changelogTestText = """ # This is a comment # Nothing to see here #---------------------------------- Version 0.31 Released January 27, 2014 - Major Feature 1 This is a description of the first major feature. - Major Feature 2 Description of the second big feature. - Major Feature 3 Indentations might be malformed Version 0.30 # No release date on this one - Major Feature 4 Another multi-line description # I debated whetehr to put this next feature in there... # In the end I did - Major Feature 5 Description of the fifth big feature. Version 0.25 Released April 21, 2013 # I realize these feature numbers don't make sense for decreasing # version numbers - Major Feature 6 # Can we put comments This feature requires # in the middle of # the descriptions? interspersed comments - Major Feature 7 - Major Feature 8 """ fullFeatureLists = \ [ \ [ '0.31', 'January 27, 2014', [ \ ['Major Feature 1', 'This is a description of the first major feature.'], ['Major Feature 2', 'Description of the second big feature.'], ['Major Feature 3', 'Indentations might be malformed'] \ ] \ ], [ '0.30', '', [ \ ['Major Feature 4', 'Another multi-line description'], ['Major Feature 5', 'Description of the fifth big feature.'] \ ] \ ], [ '0.25', 'April 21, 2013', [ \ ['Major Feature 6', 'This feature requires interspersed comments'], ['Major Feature 7', ''], ['Major Feature 8', ''] \ ] \ ] \ ] downloadTestText = """ -----BEGIN BITCOIN SIGNED MESSAGE----- # Armory for Windows Armory 0.91 Windows XP 32 http://url/armory_0.91_xp32.exe 3afb9881c32 Armory 0.91 Windows XP 64 http://url/armory_0.91_xp64.exe 8993ab127cf Armory 0.91 Windows Vista,7,8 32,64 http://url/armory_0.91.exe 7f3b9964aa3 # Various Ubuntu/Debian versions Armory 0.91 Ubuntu 10.04,10.10 32 http://url/armory_10.04-32.deb 01339a9469b59a15bedab3b90f0a9c90ff2ff712ffe1b8d767dd03673be8477f Armory 0.91 Ubuntu 12.10,13.04 32 http://url/armory_12.04-32.deb 5541af39c84 Armory 0.91 Ubuntu 10.04,10.10 64 http://url/armory_10.04-64.deb 9af7613cab9 Armory 0.91 Ubuntu 13.10 64 http://url/armory_13.10-64.deb 013fccb961a # Offline Bundles ArmoryOffline 0.90 Ubuntu 10.04 32 http://url/offbundle-32-90.tar.gz 641382c93b9 ArmoryOffline 0.90 Ubuntu 12.10 32 http://url/offbundle-64-90.tar.gz 5541af39c84 ArmoryOffline 0.88 Ubuntu 10.04 32 http://url/offbundle-32-88.tar.gz 641382c93b9 ArmoryOffline 0.88 Ubuntu 12.10 32 http://url/offbundle-64-88.tar.gz 5541af39c84 # Windows 32-bit Satoshi (Bitcoin-Qt/bitcoind) Satoshi 0.9.0 Windows XP,Vista,7,8 32,64 http://btc.org/win0.9.0.exe 837f6cb4981314b323350353e1ffed736badb1c8c0db083da4e5dfc0dd47cdf1 Satoshi 0.9.0 Ubuntu 10.04 32 http://btc.org/lin0.9.0.deb 2aa3f763c3b Satoshi 0.9.0 Ubuntu 10.04 64 http://btc.org/lin0.9.0.deb 2aa3f763c3b -----BEGIN BITCOIN SIGNATURE----- HAZGhRr4U/utHgk9BZVOTqWcAodtHLuIq67TMSdThAiZwcfpdjnYZ6ZwmkUj0c3W U0zy72vLLx9mpKJQdDmV7k0= =i8i+ -----END BITCOIN SIGNATURE----- """ notifyTestText = """ -----BEGIN BITCOIN SIGNED MESSAGE----- Comment: Signed by Bitcoin Armory v0.90.99 # PRIORITY VALUES: # Test announce: 1024 # General Announcment: 2048 # Important non-critical: 3072 # Critical/security sens: 4096 # Critical++: 5120 # UNIQUEID: 873fbc11 VERSION: 0 STARTTIME: 0 EXPIRES: 1500111222 CANCELID: [] MINVERSION: 0.87.2 MAXVERSION: 0.88.1 PRIORITY: 4096 ALERTTYPE: Security NOTIFYSEND: False NOTIFYRECV: True SHORTDESCR: Until further notice, require 30 confirmations for incoming transactions. LONGDESCR: THIS IS A FAKE ALERT FOR TESTING PURPOSES: There is some turbulence on the network that may result in some transactions being accidentally reversed up to 30 confirmations. A clever attacker may be able to exploit this to scam you. For incoming transactions from parties with no existing trust, please wait at least 30 confirmations before considering the coins to be yours. By default, Armory will show you a checkmark when a transaction has 6 confirmations. You can hover your mouse over the checkmark in the ledger to display the actual number. 30 confirmations corresponds to approximately 4-6 hours. ***** UNIQUEID: 113c948a VERSION: 0 STARTTIME: 0 EXPIRES: 1700111222 CANCELID: [] MINVERSION: * MAXVERSION: <0.91.99.8 PRIORITY: 0 ALERTTYPE: Upgrade NOTIFYSEND: False NOTIFYSEND: False NOTIFYRECV: False SHORTDESCR: New 0.92-beta testing version available. Please download 0.91.99.8 LONGDESCR: The new version fixes the following bugs: - Bug A - Bug B - Bug C ***** -----BEGIN BITCOIN SIGNATURE----- HAZGhRr4U/utHgk9BZVOTqWcAodtHLuIq67TMSdThAiZwcfpdjnYZ6ZwmkUj0c3W U0zy72vLLx9mpKJQdDmV7k0= =i8i+ -----END BITCOIN SIGNATURE----- """ class parseChangelogTest(TiabTest): def setUp(self): self.clh = changelogParser(changelogTestText) def tearDown(self): pass # TODO: This test needs more verification of the results. def testReadAll(self): expectedOutput = fullFeatureLists[:] testOutput = self.clh.getChangelog() for test,expect in zip(testOutput, expectedOutput): self.assertEqual( test[0], expect[0] ) for testFeat, expectFeat in zip(test[1], expect[1]): self.assertEqual( testFeat, expectFeat ) def testStopAt028(self): expectedOutput = fullFeatureLists[:] testOutput = self.clh.getChangelog(getVersionInt([0,28,0,0])) for test,expect in zip(testOutput, expectedOutput): self.assertEqual( test[0], expect[0] ) for testFeat, expectFeat in zip(test[1], expect[1]): self.assertEqual( testFeat, expectFeat ) ################################################################################ class parseDownloadTest(TiabTest): def setUp(self): self.dl = downloadLinkParser(filetext=downloadTestText) def tearDown(self): pass def testParseDL(self): dllink = self.dl.getDownloadLink('Armory','0.91','Windows','XP','32') self.assertEqual(dllink, ['http://url/armory_0.91_xp32.exe', '3afb9881c32']) dllink = self.dl.getDownloadLink('Armory','0.91','Windows','Vista','32') self.assertEqual(dllink, ['http://url/armory_0.91.exe', '7f3b9964aa3']) # This is a real file with a real hash, for testing DL in Armory dllink = self.dl.getDownloadLink('Satoshi','0.9.0','Windows','7','64') self.assertEqual(dllink, ['http://btc.org/win0.9.0.exe', '837f6cb4981314b323350353e1ffed736badb1c8c0db083da4e5dfc0dd47cdf1']) dllink = self.dl.getDownloadLink('ArmoryOffline','0.88','Ubuntu','10.04','32') self.assertEqual(dllink, ['http://url/offbundle-32-88.tar.gz', '641382c93b9']) dllink = self.dl.getDownloadLink('Armory','1.01','WIndows','10.04','32') self.assertEqual(dllink, None) ################################################################################ class parseNotifyTest(TiabTest): def setUp(self): self.notify = notificationParser(filetext=notifyTestText) def tearDown(self): pass def testParseNotify(self): notifyMap = self.notify.getNotificationMap() self.assertEqual(notifyMap['873fbc11']['VERSION'], '0') self.assertEqual(notifyMap['873fbc11']['CANCELID'], '[]') self.assertEqual(notifyMap['873fbc11']['MAXVERSION'], '0.88.1') self.assertTrue(notifyMap['873fbc11']['LONGDESCR'].strip().startswith('THIS IS A FAKE')) self.assertEqual(notifyMap['113c948a']['VERSION'], '0') self.assertEqual(notifyMap['113c948a']['CANCELID'], '[]') # This is a bogus assertion that must fail unless updated on every release: # self.assertEqual(notifyMap['113c948a']['MAXVERSION'], '0.91.99.7') self.assertTrue(notifyMap['113c948a']['LONGDESCR'].strip().startswith('The new version')) # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main() armory-0.92.3/pytest/testArmoryDTiab.py0000644000000000000000000006263312414772654016621 0ustar rootroot''' Created on Oct 8, 2013 @author: Andy ''' import sys sys.path.append('..') from pytest.Tiab import TiabTest, TOP_TIAB_BLOCK, FIRST_WLT_BALANCE,\ FIRST_WLT_NAME, SECOND_WLT_NAME, THIRD_WLT_NAME, TIAB_SATOSHI_PORT from armoryengine.ArmoryUtils import * from armoryd import AmountToJSON, Armory_Json_Rpc_Server, JSONtoAmount from armoryengine.BDM import TheBDM from armoryengine.PyBtcWallet import PyBtcWallet from armoryengine.Transaction import UnsignedTransaction, PyTx import unittest from jasvet import ASv1CS TX_FILENAME = 'mytxfile' TEST_WALLET_NAME = 'Test Wallet Name' TEST_WALLET_DESCRIPTION = 'Test Wallet Description' TX_ID1_OUTPUT0_VALUE = 63000 TX_ID1_OUTPUT1_VALUE = 139367000 # Values related primarily to createlockbox(). TWO_OF_THREE_LB_NAME = '3U1JQKkD' TWO_OF_TWO_LB_NAME = 'p4iZSRhP' TWO_OF_TWO_LB_NAME_COMP_1 ='5gpFk6Yp' TWO_OF_TWO_LB_NAME_COMP_2 ='zENzyu84' GOOD_PK_UNCOMP_1 = '04e8445082a72f29b75ca48748a914df60622a609cacfce8ed0e35804560741d292728ad8d58a140050c1016e21f285636a580f4d2711b7fac3957a594ddf416a0' GOOD_PK_COMP_1 = '02e8445082a72f29b75ca48748a914df60622a609cacfce8ed0e35804560741d29' GOOD_PK_UNCOMP_2 = '0439a36013301597daef41fbe593a02cc513d0b55527ec2df1050e2e8ff49c85c23cbe7ded0e7ce6a594896b8f62888fdbc5c8821305e2ea42bf01e37300116281' GOOD_PK_COMP_2 = '0339a36013301597daef41fbe593a02cc513d0b55527ec2df1050e2e8ff49c85c2' BAD_WLT_NAME = 'keKoEXp1' BAD_PK = '04e8445082a72f29b75ca48748a914df60622a609cacfce8ed0e35804560741d2927' BAD_PK_UNCOMP_1 = '04000102030405060708090a0b0c0d0e0f000102030405060708090a0b0c0d0e0f000102030405060708090a0b0c0d0e0f000102030405060708090a0b0c0d0e0f' BAD_PK_COMP_1 = '02000102030405060708090a0b0c0d0e0f000102030405060708090a0b0c0d0e0f' ERRSTR09 = 'The user requires more keys or wallets to unlock a lockbox (%d) ' \ 'than are required to create a lockbox (%d).' % (3, 2) ERRSTR10 = 'The number of signatures required to unlock a lockbox (%d) ' \ 'exceeds the maximum allowed (%d)' % (8, LB_MAXM) ERRSTR11 = 'The number of keys or wallets required to create a lockbox (%d) ' \ 'exceeds the maximum allowed (%d)' % (8, LB_MAXN) ERRSTR12 = 'No keys or wallets were specified. %d wallets or keys are ' \ 'required to create the lockbox.' % 4 ERRSTR13 = 'The number of supplied keys or wallets (%d) exceeds the number ' \ 'required to create the lockbox (%d)' % (3, 2) ERRSTR14 = 'The number of supplied keys or wallets (%d) is less than the ' \ 'number of required to create the lockbox (%d)' % (1, 2) PASSPHRASE1 = 'abcde' UNLOCK_TIMEOUT = 5 TIAB_DIR = 'tiab' TEST_TIAB_DIR = os.path.join('test','tiab') NEED_TIAB_MSG = "This Test must be run with J:/Development_Stuff/bitcoin-testnet-boxV2.7z (Armory jungle disk). Copy to the test directory." EXPECTED_TIAB_NEXT_ADDR = 'muEePRR9ShvRm2nqeiJyD8pJRHPuww2ECG' EXPECTED_UNSPENT_TX1_BAL = 20.0 EXPECTED_UNSPENT_TX1_CONF = 3 EXPECTED_UNSPENT_TX1_HEX = '8257d5a894cb3545830fa997402ff460c55abca7816ad520af8931b2eab33444' EXPECTED_UNSPENT_TX1_PRI = 60.0 EXPECTED_UNSPENT_TX5_BAL = 938.8997 EXPECTED_UNSPENT_TX5_CONF = 8 EXPECTED_UNSPENT_TX5_HEX = '111842cb336995ac460f302f9f611e94e5b27222368d79cfd7db4c7cbc071572' EXPECTED_UNSPENT_TX5_PRI = 7511.1976 EXPECTED_UNSPENT_TX_TOT = 964.8997 EXPECTED_RECEIVED_FROM_TIAB_WLT_1_ADDR_2 = 979.9999 TIAB_WLT_1_ADDR_1 = 'muxkzd4sitPbMz4BXmkEJKT6ccshxDFsrn' TIAB_WLT_1_PK_1 = '92vsXfvjpbTj1sN75VSV2M7DWyqoVx5nayp3dE7ZaG9rRVRYU4P' TIAB_WLT_1_ADDR_2 = 'mtZ2d1jFZ9YNp3Ku5Fb2u8Tfu3RgimBHAD' TIAB_WLT_1_PK_2 = '934MLhycJEAWL4kMbFt6JRSkNcgEtQXN3ha6Wh8WZyD85cZZZ4N' TIAB_WLT_1_ADDR_3 = 'mhrpYhQLgYgAvYs1A4E8Z4Dv4ZoZPyLbLS' TIAB_WLT_1_PK_3 = '91rTQa47dLQhNGDenejW9qxcMTL73GRG347zKfa3qVvzun7ZcNe' TIAB_WLT_1_PK_UTXO_BAL_3 = 3.0 TIAB_WLT_1_PK_UTXO_HEX_3 = '507b01123e9416eb6de996f64686b7c8290eacd13b9607438a8bab4a78d3afd503000000' # Has 938.8997 BTC TIAB_WLT_1_ADDR_8 = 'mikxgMUqkk6Tts1D39Hhx6wKEeQbBH3ons' TIAB_WLT_1_PK_8 = '92fXG1foeHfn8DYEwTXggCPrFEEY6KpokqoJkp9EhpJw5boc3GY' TIAB_WLT_1_PK_UTXO_BAL_8 = 938.8997 TIAB_WLT_1_PK_UTXO_HEX_8 = '721507bc7c4cdbd7cf798d362272b2e5941e619f2f300f46ac956933cb42181100000000' TIAB_WLT_2_ADDR_1 = 'mzkKrXNPU6nfBpZCKLmwueb9MvSFaKPDMD' TIAB_WLT_2_PK_1 = '91jZJ2BnJbk4B6zpqzJqVfbtaq4RMaPPvP7USr9rtWXusSAYrq7' TIAB_WLT_2_ADDR_2 = 'n2DLXxVZSNBfzXsAm4HewpsfAGBpgTW6DH' TIAB_WLT_2_PK_2 = '93LLsm4n19Dwbp6zbnmuvHmMjEJFR23h4xstnDnEBYMWSkXaFMT' TIAB_WLT_2_ADDR_3 = 'mhbmvVedo4i67maX6pfw9trcBWQQ3yXgkB' TIAB_WLT_2_PK_3 = '92aUXStPSfHDXydGh9MsBnnyacNzJwgWBC4G8W5BiTFkTJpeHEH' # Has 28.9 BTC TIAB_WLT_2_ADDR_4 = 'mk7pAQ7YdmnwWaGFCgwiKiEbaGjyEsSVUE' TIAB_WLT_2_PK_4 = '92gYPs8i6qvSmc8moBAaWLB7M16kX5MBpbGoUygUmQTdrxkNnwR' TIAB_WLT_3_ADDR_1 = 'mnHywMYRuMyYeamyGhUPJLFSsoWbNAnsNz' TIAB_WLT_3_PK_1 = '9295sDHkX1xDMzSxit3Bvi8GdLUQq1JFktBQFB8Ca45aLaw8neN' TIAB_WLT_3_ADDR_2 = 'mpXd2u8fPVYdL1Nf9bZ4EFnqhkNyghGLxL' TIAB_WLT_3_PK_2 = '92Mic29J44mKLn4qKXm31mMv45BtEnywBnJh36jn1Rk2RT9PTsK' # has 18.90 BTC TIAB_WLT_3_ADDR_3 = 'mmfN9oj2wtMTCACKJz7fUcDeAczz4kucvV' TIAB_WLT_3_PK_3 = '92ymyLuiEUJJz5madzhPtBTa3of46vLXDSuFPNMAA6DMLSeKA8S' BTC_TO_SEND = 1 TEST_MESSAGE = "All your base are belong to us." # These tests need to be run in the TiaB class ArmoryDTiabTest(TiabTest): def setUp(self): self.verifyBlockHeight() # Load the primary file from the test net in a box self.fileA = os.path.join(self.tiab.tiabDirectory, 'tiab', 'armory', \ 'armory_%s_.wallet' % FIRST_WLT_NAME) self.wltA = PyBtcWallet().readWalletFile(self.fileA, doScanNow=True) self.fileB = os.path.join(self.tiab.tiabDirectory, 'tiab', 'armory', \ 'armory_%s_.wallet' % SECOND_WLT_NAME) self.wltB = PyBtcWallet().readWalletFile(self.fileB, doScanNow=True) self.fileC = os.path.join(self.tiab.tiabDirectory, 'tiab', 'armory', \ 'armory_%s_.wallet' % THIRD_WLT_NAME) self.wltC = PyBtcWallet().readWalletFile(self.fileC, doScanNow=True) self.jsonServer = Armory_Json_Rpc_Server(self.wltA, \ inWltMap={SECOND_WLT_NAME : self.wltB, \ THIRD_WLT_NAME : self.wltC}, \ armoryHomeDir=os.path.join(self.tiab.tiabDirectory, \ 'tiab','armory')) TheBDM.registerWallet(self.wltA) def testActiveWallet(self): self.jsonServer.jsonrpc_setactivewallet(FIRST_WLT_NAME) result = self.jsonServer.jsonrpc_getactivewallet() self.assertEqual(result, FIRST_WLT_NAME) bogusResult = self.jsonServer.jsonrpc_setactivewallet('bogus wallet name') self.assertTrue('does not exist' in bogusResult) # Tests all of the address meta data functions at once def testAddressMetaData(self): testInput = {TIAB_WLT_1_ADDR_1: {'chain': 5, 'index': 2}, TIAB_WLT_1_ADDR_2: {'CrazyField': 'what', '1': 1, '2': 2}} self.jsonServer.jsonrpc_setaddressmetadata(testInput) testOutput1=self.jsonServer.jsonrpc_getaddressmetadata() self.assertEqual(testOutput1, testInput) self.jsonServer.jsonrpc_clearaddressmetadata() testOutput2=self.jsonServer.jsonrpc_getaddressmetadata() self.assertEqual(testOutput2, {}) def testListloadedwallets(self): result = self.jsonServer.jsonrpc_listloadedwallets() self.assertEqual(len(result.keys()), 3) self.assertTrue(FIRST_WLT_NAME in result.values()) self.assertTrue(SECOND_WLT_NAME in result.values()) self.assertTrue(THIRD_WLT_NAME in result.values()) def getPrivateKey(self, address): hash160 = addrStr_to_hash160(address)[1] if self.wltA.isLocked: self.wltA.unlock(securePassphrase=SecureBinaryData(PASSPHRASE1), tempKeyLifetime=1000000) return self.wltA.addrMap[hash160].binPrivKey32_Plain.toBinStr() # Test Create lockbox and list loaded lockbox at the same time. # Also test set and get active lockbox. def testLockboxMethods(self): self.assertEqual(self.jsonServer.jsonrpc_getactivelockbox(), None) addrFromFirstWlt = self.jsonServer.getPKFromWallet(self.wltA, \ self.wltA.getHighestUsedIndex()) addrFromSecondWlt = self.jsonServer.getPKFromWallet(self.wltB, \ self.wltB.getHighestUsedIndex()) addrFromThirdWlt = self.jsonServer.getPKFromWallet(self.wltC, \ self.wltC.getHighestUsedIndex()) # This test should succeed. actualResult1 = self.jsonServer.jsonrpc_createlockbox(2, 3, \ addrFromFirstWlt, \ SECOND_WLT_NAME, \ THIRD_WLT_NAME) self.assertTrue(TWO_OF_THREE_LB_NAME in actualResult1.values()) # This test should fail because the first createlockbox() used the 2nd & # 3rd addresses. actualResult2 = self.jsonServer.jsonrpc_createlockbox(2, 3, \ addrFromFirstWlt, \ addrFromSecondWlt, \ addrFromThirdWlt) self.assertTrue(TWO_OF_THREE_LB_NAME in actualResult2['Error']) # This test should succeed. actualResult3 = self.jsonServer.jsonrpc_createlockbox(2, 2, \ addrFromSecondWlt, \ addrFromThirdWlt) self.assertEqual(TWO_OF_TWO_LB_NAME, actualResult3['id']) listResult3 = self.jsonServer.jsonrpc_listloadedlockboxes() self.assertEqual(len(listResult3.keys()), 2) self.assertTrue(TWO_OF_TWO_LB_NAME in listResult3.values()) # This test should fail because of a bad wallet name. actualResult4 = self.jsonServer.jsonrpc_createlockbox(2, 2, \ addrFromFirstWlt, \ BAD_WLT_NAME) self.assertTrue(BAD_WLT_NAME in actualResult4['Error']) # This test should fail because of a malformed, uncompressed public key. actualResult5 = self.jsonServer.jsonrpc_createlockbox(2, 2, \ addrFromFirstWlt, \ BAD_PK_UNCOMP_1) self.assertTrue(BAD_PK_UNCOMP_1 in actualResult5['Error']) # This test should fail because of a malformed, compressed public key. actualResult6 = self.jsonServer.jsonrpc_createlockbox(2, 2, \ addrFromFirstWlt, \ BAD_PK_COMP_1) self.assertTrue(BAD_PK_COMP_1 in actualResult6['Error']) # This test should fail due to a compressed public key being used. foundUncompAddr = False actualResult7 = self.jsonServer.jsonrpc_createlockbox(2, 2, \ addrFromFirstWlt, \ GOOD_PK_COMP_1) self.assertTrue(GOOD_PK_COMP_1 in actualResult7['Error']) # This test should fail due to a malformed public key (incorrect length). actualResult8 = self.jsonServer.jsonrpc_createlockbox(2, 2, \ addrFromFirstWlt, \ BAD_PK) self.assertTrue(BAD_PK in actualResult8['Error']) # These tests should fail for various reasons related to the # of inputs. actualResult09 = self.jsonServer.jsonrpc_createlockbox(3, 2, \ addrFromFirstWlt, \ addrFromThirdWlt) self.assertTrue(ERRSTR09 in actualResult09['Error']) actualResult10 = self.jsonServer.jsonrpc_createlockbox(8, 8, \ addrFromFirstWlt, \ addrFromSecondWlt, \ addrFromThirdWlt, \ FIRST_WLT_NAME, \ SECOND_WLT_NAME, \ THIRD_WLT_NAME, \ GOOD_PK_UNCOMP_1, \ GOOD_PK_UNCOMP_2) self.assertTrue(ERRSTR10 in actualResult10['Error']) actualResult11 = self.jsonServer.jsonrpc_createlockbox(1, 8, \ addrFromFirstWlt, \ addrFromSecondWlt, \ addrFromThirdWlt, \ FIRST_WLT_NAME, \ SECOND_WLT_NAME, \ THIRD_WLT_NAME, \ GOOD_PK_UNCOMP_1, \ GOOD_PK_UNCOMP_2) self.assertTrue(ERRSTR11 in actualResult11['Error']) actualResult12 = self.jsonServer.jsonrpc_createlockbox(1, 4) self.assertTrue(ERRSTR12 in actualResult12['Error']) actualResult13 = self.jsonServer.jsonrpc_createlockbox(1, 2, \ addrFromFirstWlt, \ addrFromSecondWlt, \ addrFromThirdWlt) self.assertTrue(ERRSTR13 in actualResult13['Error']) actualResult14 = self.jsonServer.jsonrpc_createlockbox(1, 2, \ addrFromFirstWlt) self.assertTrue(ERRSTR14 in actualResult14['Error']) # These tests should succeed. self.jsonServer.jsonrpc_setactivelockbox(TWO_OF_TWO_LB_NAME) self.assertEqual(self.jsonServer.jsonrpc_getactivelockbox(), \ TWO_OF_TWO_LB_NAME) self.jsonServer.jsonrpc_setactivelockbox(TWO_OF_THREE_LB_NAME) self.assertEqual(self.jsonServer.jsonrpc_getactivelockbox(), \ TWO_OF_THREE_LB_NAME) def testVerifysignature(self): clearSignMessage = ASv1CS(self.getPrivateKey(TIAB_WLT_1_ADDR_1), \ TEST_MESSAGE) inMsg = '\"' + clearSignMessage + '\"' result = self.jsonServer.jsonrpc_verifysignature(inMsg) self.assertEqual(result['message'], TEST_MESSAGE) self.assertEqual(result['address'], TIAB_WLT_1_ADDR_1) def testReceivedfromsigner(self): clearSignMessage2 = ASv1CS(self.getPrivateKey(TIAB_WLT_1_ADDR_3), \ TEST_MESSAGE) inMsg2 = '\"' + clearSignMessage2 + '\"' result2 = self.jsonServer.jsonrpc_receivedfromsigner(inMsg2) self.assertEqual(result2['message'], TEST_MESSAGE) self.assertEqual(result2['amount'], 0) def testReceivedfromaddress(self): result = self.jsonServer.jsonrpc_receivedfromaddress(TIAB_WLT_3_ADDR_3) self.assertEqual(result, 0) result = self.jsonServer.jsonrpc_receivedfromaddress(TIAB_WLT_1_ADDR_2) self.assertEqual(result, EXPECTED_RECEIVED_FROM_TIAB_WLT_1_ADDR_2) def testGettransaction(self): tx = self.jsonServer.jsonrpc_gettransaction('db0ee46beff3a61f38bfc563f92c11449ed57c3d7d5cd5aafbe0114e5a9ceee4') self.assertEqual(tx, {'category': 'send', 'inputs': [{'fromtxid': '04b865ecf5fca3a56f6ce73a571a09a668f4b7aa5a7547a5f51fae08eadcdbb5', 'ismine': True, 'fromtxindex': 1, 'value': 1000.0, 'address': 'mtZ2d1jFZ9YNp3Ku5Fb2u8Tfu3RgimBHAD'}], 'direction': 'send', 'fee': 0.0001, 'totalinputs': 1000.0, 'outputs': [{'address': 'mpXd2u8fPVYdL1Nf9bZ4EFnqhkNyghGLxL', 'value': 20.0, 'ismine': False}, {'address': 'mgLjhTCUtbeLPP9fDkBnG8oztWgJaXZQjn', 'value': 979.9999, 'ismine': True}], 'txid': 'db0ee46beff3a61f38bfc563f92c11449ed57c3d7d5cd5aafbe0114e5a9ceee4', 'confirmations': 10, 'orderinblock': 1, 'mainbranch': True, 'numtxin': 1, 'time': 3947917907L, 'numtxout': 2, 'netdiff': -20.0001, 'infomissing': False}) def testGetblock(self): block = self.jsonServer.jsonrpc_getblock('0000000064a1ad1f15981a713a6ef08fd98f69854c781dc7b8789cc5f678e01f') # This method is broken in a couple ways. # For no just verify that raw transaction is correct self.assertEqual(block['rawheader'], '02000000d8778a50d43d3e02c4c20bdd0ed97077a3c4bef3e86ce58975f6f43a00000000d25912cfc67228748494d421512c7a6cc31668fa82b72265261558802a89f4c2e0350153ffff001d10bcc285',) def testGetinfo(self): info = self.jsonServer.jsonrpc_getarmorydinfo() self.assertEqual(info['blocks'], TOP_TIAB_BLOCK) self.assertEqual(info['bdmstate'], 'BlockchainReady') self.assertEqual(info['walletversionstr'], '1.35') self.assertEqual(info['difficulty'], 1.0) self.assertEqual(info['balance'], FIRST_WLT_BALANCE) def testListtransactions(self): txList = self.jsonServer.jsonrpc_listtransactions(100) self.assertTrue(len(txList)>10) self.assertEqual(txList[0], {'blockhash': '0000000064a1ad1f15981a713a6ef08fd98f69854c781dc7b8789cc5f678e01f', 'blockindex': 1, 'confirmations': 31, 'address': 'mtZ2d1jFZ9YNp3Ku5Fb2u8Tfu3RgimBHAD', 'category': 'receive', 'account': '', 'txid': '04b865ecf5fca3a56f6ce73a571a09a668f4b7aa5a7547a5f51fae08eadcdbb5', 'blocktime': 1392588256, 'amount': 1000.0, 'timereceived': 1392588256, 'time': 1392588256}) def testGetledgersimple(self): ledger = self.jsonServer.jsonrpc_getledgersimple(FIRST_WLT_NAME) self.assertTrue(len(ledger)>4) amountList = [row['amount'] for row in ledger] expectedAmountList = [1000.0, 20.0, 30.0, 0.8, 10.0] self.assertEqual(amountList[:5], expectedAmountList) def testGetledger(self): ledger = self.jsonServer.jsonrpc_getledger(FIRST_WLT_NAME) self.assertTrue(len(ledger)>6) amountList = [row['amount'] for row in ledger] expectedAmountList = [1000.0, 20.0, 30.0, 0.8, 10.0, 6.0, 20.0] self.assertEqual(amountList, expectedAmountList) self.assertEqual(ledger[0]['direction'], 'receive') self.assertEqual(len(ledger[0]['recipme']), 1) self.assertEqual(ledger[0]['recipme'][0]['amount'], 1000.0) self.assertEqual(len(ledger[0]['recipother']), 1) self.assertEqual(ledger[0]['recipother'][0]['amount'], 49.997) self.assertEqual(len(ledger[0]['senderme']), 0) self.assertEqual(len(ledger[0]['senderother']), 21) self.assertEqual(ledger[1]['direction'], 'send') self.assertEqual(len(ledger[1]['senderother']), 0) self.assertEqual(len(ledger[1]['senderme']), 1) self.assertEqual(ledger[1]['senderme'][0]['amount'], 1000.0) def testSendtoaddress(self): # Send 1 BTC serializedUnsignedTx = \ self.jsonServer.jsonrpc_createustxtoaddress(TIAB_WLT_3_ADDR_3, \ BTC_TO_SEND) unsignedTx = UnsignedTransaction().unserializeAscii(serializedUnsignedTx) # Should have 2 txouts to TIAB_WLT_3_ADDR_3 and the change self.assertEqual(len(unsignedTx.decorTxOuts), 2) foundTxOut = False for txout in unsignedTx.decorTxOuts: if script_to_addrStr(txout.binScript) == TIAB_WLT_3_ADDR_3: self.assertEqual(txout.value, JSONtoAmount(BTC_TO_SEND)) foundTxOut = True self.assertTrue(foundTxOut) # Test two paths through signing method and make sure they are equal # Wallets in the TIAB start out unencrypted serializedSignedTxUnencrypted = \ self.jsonServer.jsonrpc_signasciitransaction(serializedUnsignedTx, \ '')['SignedTx'] self.jsonServer.jsonrpc_encryptwallet(PASSPHRASE1) serializedSignedTxEncrypted = \ self.jsonServer.jsonrpc_signasciitransaction(serializedUnsignedTx, \ PASSPHRASE1)['SignedTx'] # Other tests expect wallet to be unencrypted self.wltA.unlock(securePassphrase=SecureBinaryData(PASSPHRASE1), tempKeyLifetime=1000000) self.wltA.changeWalletEncryption() signedTxUnencrypted = UnsignedTransaction().unserializeAscii(serializedSignedTxUnencrypted) signedTxEncrypted = UnsignedTransaction().unserializeAscii(serializedSignedTxEncrypted) # check number of outputs 1 Btc goes to a single output and the other goes to change self.assertEqual(len(signedTxUnencrypted.decorTxOuts), 2) self.assertEqual(len(signedTxEncrypted.decorTxOuts), 2) self.assertEqual(signedTxUnencrypted.asciiID, signedTxEncrypted.asciiID) self.assertTrue(JSONtoAmount(BTC_TO_SEND) in [signedTxEncrypted.decorTxOuts[0].value, signedTxEncrypted.decorTxOuts[1].value]) self.assertTrue(JSONtoAmount(BTC_TO_SEND) in [signedTxUnencrypted.decorTxOuts[0].value, signedTxUnencrypted.decorTxOuts[1].value]) f = open(TX_FILENAME, 'w') f.write(signedTxEncrypted.serializeAscii()) f.close() txHexToBroadcast = self.jsonServer.jsonrpc_gethextxtobroadcast(TX_FILENAME) finalPyTx = PyTx().unserialize(hex_to_binary(txHexToBroadcast)) self.assertEqual(len(finalPyTx.outputs), 2) self.assertTrue(JSONtoAmount(BTC_TO_SEND) in [finalPyTx.outputs[0].value, finalPyTx.outputs[1].value]) def testSendmany(self): # Send 1 BTC serializedUnsignedTx = \ self.jsonServer.jsonrpc_createustxformany(','.join([TIAB_WLT_3_ADDR_2, str(BTC_TO_SEND)]), \ ','.join([TIAB_WLT_3_ADDR_3, str(BTC_TO_SEND)])) unsignedTx = UnsignedTransaction().unserializeAscii(serializedUnsignedTx) # Should have 2 txouts to TIAB_WLT_3_ADDR_3 and the change self.assertEqual(len(unsignedTx.decorTxOuts), 3) txOutsFound = 0 for txout in unsignedTx.decorTxOuts: if script_to_addrStr(txout.binScript) in [TIAB_WLT_3_ADDR_2, TIAB_WLT_3_ADDR_3]: self.assertEqual(txout.value, JSONtoAmount(BTC_TO_SEND)) txOutsFound += 1 self.assertEqual(txOutsFound, 2) def testListUnspent(self): actualResult = self.jsonServer.jsonrpc_listunspent() self.assertEqual(actualResult[0]['amount'], \ EXPECTED_UNSPENT_TX1_BAL) self.assertEqual(actualResult[0]['confirmations'], \ EXPECTED_UNSPENT_TX1_CONF) self.assertEqual(actualResult[0]['txid'], \ EXPECTED_UNSPENT_TX1_HEX) self.assertEqual(actualResult[0]['priority'], \ EXPECTED_UNSPENT_TX1_PRI) self.assertEqual(actualResult[4]['amount'], \ EXPECTED_UNSPENT_TX5_BAL) self.assertEqual(actualResult[4]['confirmations'], \ EXPECTED_UNSPENT_TX5_CONF) self.assertEqual(actualResult[4]['txid'], \ EXPECTED_UNSPENT_TX5_HEX) self.assertEqual(actualResult[4]['priority'], \ EXPECTED_UNSPENT_TX5_PRI) def testListAddrUnspent(self): totStr = '%s,%s' % (TIAB_WLT_1_ADDR_3, TIAB_WLT_1_ADDR_8) totBal = TIAB_WLT_1_PK_UTXO_BAL_3 + TIAB_WLT_1_PK_UTXO_BAL_8 actualResult = self.jsonServer.jsonrpc_listaddrunspent(totStr) self.assertEqual(actualResult['addrbalance'][TIAB_WLT_1_ADDR_3], \ TIAB_WLT_1_PK_UTXO_BAL_3) self.assertEqual(actualResult['addrbalance'][TIAB_WLT_1_ADDR_8], \ TIAB_WLT_1_PK_UTXO_BAL_8) # NB: Ideally, the TAB asserts would be against addresses with multiple # UTXOs. As is, this test case works but could be better. self.assertEqual(actualResult['totalbalance'], TIAB_WLT_1_PK_UTXO_BAL_3 + TIAB_WLT_1_PK_UTXO_BAL_8 ) self.assertEqual(actualResult['numutxo'], 2) def testGetNewAddress(self): actualResult = self.jsonServer.jsonrpc_getnewaddress() self.assertEqual(actualResult, EXPECTED_TIAB_NEXT_ADDR) def testGetBalance(self): balances = {'spendable' : FIRST_WLT_BALANCE, \ 'spend' : FIRST_WLT_BALANCE, \ 'unconf' : 0, \ 'unconfirmed' : 0, \ 'total' : FIRST_WLT_BALANCE, \ 'ultimate' : FIRST_WLT_BALANCE, \ 'unspent' : FIRST_WLT_BALANCE, \ 'full' : FIRST_WLT_BALANCE} for balanceType in balances.keys(): result = self.jsonServer.jsonrpc_getbalance(balanceType) self.assertEqual(result, AmountToJSON(self.wltA.getBalance(balanceType))) # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main() armory-0.92.3/pytest/testAnnounce.py0000644000000000000000000000603112414772654016200 0ustar rootrootimport sys sys.path.append('..') from pytest.Tiab import TiabTest from armoryengine.ALL import * from announcefetch import AnnounceDataFetcher import unittest forceTestURL = 'https://s3.amazonaws.com/bitcoinarmory-testing/testannounce.txt' fetchDump = './fetchedFiles' class AnnouncementTester(TiabTest): def setUp(self): pass def tearDown(self): pass def testNoStart(self): adf = AnnounceDataFetcher(forceTestURL, fetchDir=fetchDump) adf.setFetchInterval(20) self.assertFalse(adf.isDisabled()) self.assertFalse(adf.atLeastOneSuccess()) def testStart(self): adf = AnnounceDataFetcher(forceTestURL, fetchDir=fetchDump) adf.setFetchInterval(20) print 'STARTING', print ' Running:', adf.isRunning(), print ' OneSuccess:', adf.atLeastOneSuccess(), print ' #Files',adf.numFiles() print 'Attempting to fetch before ADF is started' d = adf.getAnnounceFile('notify') print '*****' print 'LENGTH OF NOTIFY FILE:', (len(d) if d else 0) print '*****' print 'Attempting to fetch before ADF is started (forced)' d = adf.getAnnounceFile('notify', forceCheck=True) print '*****' print 'LENGTH OF NOTIFY FILE:', (len(d) if d else 0) print '*****' adf.start() t = 0 try: while True: time.sleep(0.5) t += 0.5 print ' Running:', adf.isRunning(), print ' OneSuccess:', adf.atLeastOneSuccess(), print ' #Files',adf.numFiles() if 1040: adf.shutdown() if not adf.isRunning(): print 'Attempting to fetch after shutdown' d = adf.getAnnounceFile('notify') print '*****' print 'LENGTH OF NOTIFY FILE:', (len(d) if d else 0) print '*****' print 'Attempting to fetch after shutdown (forced)' d = adf.getAnnounceFile('notify', forceCheck=True) print '*****' print 'LENGTH OF NOTIFY FILE:', (len(d) if d else 0) print '*****' break except KeyboardInterrupt: print 'Exiting...' # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main() armory-0.92.3/pytest/__init__.py0000644000000000000000000000023412414772654015270 0ustar rootroot__all__ = ["ArmoryEngineUtilsTest", "BlockDataManagerThreadTest", "PyBtcAddressTest", \ "SplitSecretTest", "PyTXTest", "PyBtcWalletTest", "Tiab"]armory-0.92.3/pytest/testArmoryDStartup.py0000644000000000000000000001122512414772654017373 0ustar rootrootimport sys sys.path.append('..') from pytest.Tiab import * import json from armoryd import Armory_Daemon from armoryengine.ArmoryUtils import CLI_OPTIONS # runs a Test In a Box (TIAB) bitcoind session. By copying a prebuilt # testnet with a known state # Charles's recommendation is that you keep the TIAB somewhere like ~/.armory/tiab.charles # and export that path in your .bashrc as ARMORY_TIAB_PATH class ArmoryDSession: numInstances=0 # create a Test In a Box, initializing it and filling it with data # the data comes from a path in the environment unless tiabdatadir is set # tiab_repository is used to name which flavor of box is used if # tiabdatadir is not used - It is intended to be used for when we # have multiple testnets in a box with different properties def __init__(self, tiab): self.processes = [] self.running = False self.tiab = tiab self.armorydPath = 'armoryd.py' if os.path.exists('armoryd.py') else \ os.path.join('..', 'armoryd.py') self.restart() def __del__(self): self.clean() # exit bitcoind and remove all data def clean(self): if not self.running: return ArmoryDSession.numInstances -= 1 for x in self.processes: x.kill() for x in self.processes: x.wait() self.processes = [] self.running=False # clean() and then start bitcoind again def callArmoryD(self, additionalArgs, waitForOutput=True): armoryDArgs = ['python', self.armorydPath, '--testnet', '--datadir=' + os.path.join(self.tiab.tiabDirectory, 'tiab', 'armory'), '--satoshi-datadir=' + os.path.join(self.tiab.tiabDirectory, 'tiab', '1'), '--satoshi-port=' + str(TIAB_SATOSHI_PORT), '--skip-online-check'] # if this is process is in debug mode, make the subrocess debug too if CLI_OPTIONS.doDebug: armoryDArgs.append('--debug') armoryDArgs.extend(additionalArgs) if waitForOutput: # If there is output coming back convert it from a string to a dictionary return json.loads(subprocess.check_output(armoryDArgs)) else: # If we are not waiting output, e.g. when starting ArmoryD, return the started process. startedProcess = subprocess.Popen(armoryDArgs) self.processes.append(startedProcess) return startedProcess def restart(self): self.clean() if ArmoryDSession.numInstances != 0: raise RuntimeError("Cannot have more than one ArmoryD session simultaneously") try: self.callArmoryD([os.path.join(self.tiab.tiabDirectory, 'tiab', 'armory',FIRST_WLT_FILE_NAME)], False) ArmoryDSession.numInstances += 1 # Wait for Armory_Daemon to start running i = 0 while not Armory_Daemon.checkForAlreadyRunning() and i < 10: time.sleep(1) i += 1 if i >= 10: raise RuntimeError("Cannot have more than one ArmoryD session simultaneously") except: self.clean() raise self.running = True class ArmoryDStartupTest(TiabTest): def setUp(self): self.armoryDSession = ArmoryDSession(self.tiab) def tearDown(self): self.armoryDSession.clean() def testJSONGetinfo(self): self.armoryDSession.callArmoryD(['setactivewallet', FIRST_WLT_NAME]) actualResult = self.armoryDSession.callArmoryD(['getarmorydinfo']) self.assertEqual(actualResult['balance'], FIRST_WLT_BALANCE) self.assertEqual(actualResult['bdmstate'], 'BlockchainReady') self.assertEqual(actualResult['blocks'], TOP_TIAB_BLOCK) self.assertEqual(actualResult['difficulty'], 1.0) self.assertEqual(actualResult['testnet'], True) def testJSONMultipleWallets(self): self.armoryDSession.callArmoryD(['setactivewallet', FIRST_WLT_NAME]) wltDictionary = self.armoryDSession.callArmoryD(['listloadedwallets']) self.assertTrue(len(wltDictionary), 3) actualResult = self.armoryDSession.callArmoryD(['getwalletinfo']) self.assertEqual(actualResult['name'], 'Primary Wallet') setWltResult = self.armoryDSession.callArmoryD(['setactivewallet', THIRD_WLT_NAME]) self.assertTrue(setWltResult.index(THIRD_WLT_NAME) > 0) actualResult2 = self.armoryDSession.callArmoryD(['getwalletinfo']) self.assertEqual(actualResult2['name'], 'Third Wallet') # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main() armory-0.92.3/pytest/testArmoryEngineUtils.py0000644000000000000000000005244512414772654020064 0ustar rootroot''' Created on Jul 29, 2013 @author: Andy ''' import sys sys.path.append('..') import hashlib import locale from random import shuffle import time import unittest from armoryengine.ArmoryUtils import * from armoryengine.BinaryPacker import * from armoryengine.BinaryUnpacker import * import armoryengine.ArmoryUtils from armoryengine import ArmoryUtils #sys.argv.append('--nologging') UNICODE_STRING = u'unicode string' NON_ASCII_STRING = '\xff\x00 Non-ASCII string \xff\x00' ASCII_STRING = 'ascii string' LONG_TEST_NUMBER = 98753178900 ################################################################################ ################################################################################ class ArmoryEngineTest(unittest.TestCase): ############################################################################# def testIsASCII(self): self.assertTrue(isASCII(ASCII_STRING)) self.assertFalse(isASCII(NON_ASCII_STRING)) ############################################################################# def testToBytes(self): self.assertEqual(toBytes(UNICODE_STRING), UNICODE_STRING.encode('utf-8')) self.assertEqual(toBytes(ASCII_STRING), ASCII_STRING) self.assertEqual(toBytes(NON_ASCII_STRING), NON_ASCII_STRING) self.assertEqual(toBytes(5), None) ############################################################################# def testToUnicode(self): self.assertEqual(toUnicode(ASCII_STRING), unicode(ASCII_STRING, 'utf-8')) self.assertEqual(toUnicode(UNICODE_STRING), UNICODE_STRING) self.assertEqual(toUnicode(5),unicode(5)) ############################################################################# def testToPreferred(self): self.assertEqual(toPreferred(ASCII_STRING), toUnicode(ASCII_STRING).encode(locale.getpreferredencoding())) ############################################################################# def testLenBytes(self): self.assertEqual(lenBytes(ASCII_STRING), len(ASCII_STRING)) ############################################################################# def testBasicUtils(self): addr = '1Ncui8YjT7JJD91tkf42dijPnqywbupf7w' # Sam Rushing's BTC address i = 4093 hstr = 'fd0f' bstr = '\xfd\x0f' self.callTestFunction('int_to_hex', hstr, i ) self.callTestFunction('int_to_hex', hstr, long(i)) self.callTestFunction('int_to_hex', hstr + "00", i, 3) self.callTestFunction('hex_to_int', i, hstr) self.callTestFunction('int_to_binary', bstr, i ) self.callTestFunction('binary_to_int', i, bstr) self.callTestFunction('hex_to_binary', bstr, hstr) self.callTestFunction('binary_to_hex', hstr, bstr) self.callTestFunction('hex_switchEndian', '67452301', '01234567') hstr = '0ffd' bstr = '\x0f\xfd' self.callTestFunction('int_to_hex', hstr, i , 2, BIGENDIAN) self.callTestFunction('hex_to_int', i, hstr, BIGENDIAN) self.callTestFunction('int_to_binary', bstr, i , 2, BIGENDIAN) self.callTestFunction('binary_to_int', i, bstr, BIGENDIAN) #h = '00000123456789abcdef000000' #ans = 'aaaaabcdeghjknrsuwxyaaaaaa' #self.callTestFunction('binary_to_typingBase16', ans, h ) #self.callTestFunction('typingBase16_to_binary', h, ans) blockhead = '010000001d8f4ec0443e1f19f305e488c1085c95de7cc3fd25e0d2c5bb5d0000000000009762547903d36881a86751f3f5049e23050113f779735ef82734ebf0b4450081d8c8c84db3936a1a334b035b' blockhash = '1195e67a7a6d0674bbd28ae096d602e1f038c8254b49dfe79d47000000000000' blockhashBE = '000000000000479de7df494b25c838f0e102d696e08ad2bb74066d7a7ae69511' blockhashBEDifficulty = 3.6349e-48 allF = 'ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff' self.callTestFunction('ubtc_to_floatStr', '12.05600000', 1205600000) self.callTestFunction('floatStr_to_ubtc', 1205600000, '12.056') self.callTestFunction('float_to_btc', 1205600000, 12.056) self.callTestFunction('packVarInt', ['A',1], 65) self.callTestFunction('packVarInt', ['\xfd\xff\x00', 3], 255) self.callTestFunction('packVarInt', ['\xfe\x00\x00\x01\x00', 5], 65536) self.callTestFunction('packVarInt', ['\xff\x00\x10\xa5\xd4\xe8\x00\x00\x00', 9], 10**12) self.callTestFunction('unpackVarInt', [65,1], 'A') self.callTestFunction('unpackVarInt', [255, 3], '\xfd\xff\x00') self.callTestFunction('unpackVarInt', [65536, 5], '\xfe\x00\x00\x01\x00') self.callTestFunction('unpackVarInt', [10**12, 9], '\xff\x00\x10\xa5\xd4\xe8\x00\x00\x00') data = hex_to_binary('11' + 'aa'*31) dataBE = hex_to_binary('11' + 'aa'*31, endIn=LITTLEENDIAN, endOut=BIGENDIAN) dataE1 = hex_to_binary('11' + 'aa'*30 + 'ab') dataE2 = hex_to_binary('11' + 'aa'*29 + 'abab') dchk = hash256(data)[:4] self.callTestFunction('verifyChecksum', data, data, dchk) self.callTestFunction('verifyChecksum', data, dataBE, dchk, beQuiet=True) self.callTestFunction('verifyChecksum', '', dataE1, dchk, hash256, False, True) # don't fix self.callTestFunction('verifyChecksum', data, dataE1, dchk, hash256, True, True) # try fix self.callTestFunction('verifyChecksum', '', dataE2, dchk, hash256, False, True) # don't fix self.callTestFunction('verifyChecksum', '', dataE2, dchk, hash256, True, True) # try fix verTuple = (0,50,0,0) verInt = 5000000 verStr = '0.50' self.callTestFunction('getVersionString', verStr, verTuple) self.callTestFunction('getVersionInt', verInt, verTuple) self.callTestFunction('readVersionString', verTuple, verStr) self.callTestFunction('readVersionInt', verTuple, verInt) verTuple = (1,0,12,0) verInt = 10012000 verStr = '1.00.12' self.callTestFunction('getVersionString', verStr, verTuple) self.callTestFunction('getVersionInt', verInt, verTuple) self.callTestFunction('readVersionString', verTuple, verStr) self.callTestFunction('readVersionInt', verTuple, verInt) verTuple = (0,20,0,108) verInt = 2000108 verStr = '0.20.0.108' self.callTestFunction('getVersionString', verStr, verTuple) self.callTestFunction('getVersionInt', verInt, verTuple) self.callTestFunction('readVersionString', verTuple, verStr) self.callTestFunction('readVersionInt', verTuple, verInt) miniKey = 'S4b3N3oGqDqR5jNuxEvDwf' miniPriv = hex_to_binary('0c28fca386c7a227600b2fe50b7cae11ec86d3bf1fbe471be89827e19d72aa1d') self.callTestFunction('decodeMiniPrivateKey', miniPriv, miniKey) self.callTestFunction('coin2str',' 0.0000', 0, 4) self.callTestFunction('coin2str',' 987.5318', LONG_TEST_NUMBER, 4) self.callTestFunction('coin2str','987.53178900', LONG_TEST_NUMBER, 8, False) self.callTestFunction('coin2str','987.5317890000', LONG_TEST_NUMBER, 12, False, 10) self.callTestFunction('coin2strNZ',' 987.531789 ', LONG_TEST_NUMBER) self.callTestFunction('coin2strNZS','987.531789', LONG_TEST_NUMBER) self.callTestFunction('coin2str_approx',' 988 ', LONG_TEST_NUMBER) self.callTestFunction('coin2str_approx',' -988 ', LONG_TEST_NUMBER * -1) self.callTestFunction('str2coin', LONG_TEST_NUMBER, '987.53178900') self.assertRaises(ValueError, str2coin, ' ') self.assertRaises(NegativeValueError, str2coin, '-1', False) self.callTestFunction('str2coin', -100000000, '-1', True) self.assertRaises(NegativeValueError, str2coin, '-1.1', False) self.assertRaises(TooMuchPrecisionError, str2coin, '.1111', True, 2, False) self.callTestFunction('str2coin', 11110000, '.1111', True, 8, True) self.callTestFunction('sha1', hashlib.new('sha1', bstr).digest(), bstr) self.callTestFunction('sha512', hashlib.new('sha512', bstr).digest(), bstr) self.callTestFunction('ripemd160', hex_to_binary('13988143ae67128f883765a4a4b19d77c1ea1ee9'), bstr) self.callTestFunction('hash160', hex_to_binary('d418dd224e11e1d3b37b5f46b072ccf4e4e26203'), bstr) self.callTestFunction('binaryBits_to_difficulty', blockhashBEDifficulty, blockhashBE) ############################################################################# def callTestFunction(self, fnName, expectedOutput, *args, **kwargs): """ Provide a function name, inputs and some known outputs Prints a pass/fail string if the outputs match """ fn = getattr(ArmoryUtils, fnName) actualOutput = fn(*args,**kwargs) self.assertAlmostEqual(expectedOutput, actualOutput, 4, \ '\n\t' + '___Inputs___:' + str(args) + '\n\t' + '___ExpOut___:' + \ str(expectedOutput) + '\n\t' + '___ActOut___:' + str(actualOutput)) ############################################################################# def testPluralsBasic(self): ##### Test the basic replacePlurals function strIn = 'Hello my @{kitty|2 kitties}@. I love you@{| guys}@!' strOut = ['','',''] strOut[1] = 'Hello my kitty. I love you!' strOut[2] = 'Hello my 2 kitties. I love you guys!' # Test singular for i in range(1,3): replOut = replacePlurals(strIn, i) self.assertEqual(replOut, strOut[i]) replOut = replacePlurals(strIn, i, i) self.assertEqual(replOut, strOut[i]) noStr = 'No replacements' self.assertEqual( replacePlurals(noStr), noStr) # Not enough arguments self.assertRaises(IndexError, replacePlurals, strIn) self.assertRaises(IndexError, replacePlurals, strIn + ' @{A cat|many cats}@', 1,1) # Too many arguments self.assertRaises(TypeError, replacePlurals, strIn, 1,1,1) # No format specifiers self.assertRaises(TypeError, replacePlurals, noStr, 1) ############################################################################# def testFormatWithPlurals(self): ##### Test the formatWithPlurals function strIn = 'Hello my @{kitty|%d kitties}@. I love you@{| guys}@!' strOut = ['','','','',''] strOut[1] = 'Hello my kitty. I love you!' strOut[2] = 'Hello my 2 kitties. I love you guys!' strOut[3] = 'Hello my kitty. I love you guys!' strOut[4] = 'Hello my 2 kitties. I love you!' ## Test singular for i in range(1,3): replOut = formatWithPlurals(strIn, i, i) self.assertEqual(replOut, strOut[i]) replOut = formatWithPlurals(strIn, [i], [i]) self.assertEqual(replOut, strOut[i]) replOut = formatWithPlurals(strIn, [i], [i, i]) self.assertEqual(replOut, strOut[i]) replOut = formatWithPlurals(strIn, i, [i]) self.assertEqual(replOut, strOut[i]) replOut = formatWithPlurals(strIn, i, [i, i]) self.assertEqual(replOut, strOut[i]) replOut = formatWithPlurals(strIn, 2, [1,2]) self.assertEqual(replOut, strOut[3]) replOut = formatWithPlurals(strIn, 2, [2,1]) self.assertEqual(replOut, strOut[4]) ############################################################################# def testPyBackgroundThread(self): # This will be used for testing def doLongOperation(throwError=False): j = '\xab'*32 n = 20000 for i in xrange(n): j = hash160(j) if i==n/2 and throwError: raise ValueError('This is a forced error') return j # On completion, the following should be the output ans = '\\\xea\xef\xc6:\xd4\xd7\xed\xee_YM\xf1\xa1aV\x81\x03Y\xc1' # Test proper thread execution thr = PyBackgroundThread(doLongOperation, False) thr.start() while not thr.isFinished(): thr.join(0.1) self.assertTrue(thr.isFinished()) self.assertEqual(thr.getOutput(), ans) self.assertFalse(thr.didThrowError()) self.assertEqual(thr.getErrorType(), None) self.assertEqual(thr.getErrorMsg(), '') # Test error thrown thr = PyBackgroundThread(doLongOperation, True) thr.start() while not thr.isFinished(): thr.join(0.1) self.assertTrue(thr.isFinished()) self.assertEqual(thr.getOutput(), None) self.assertTrue(thr.didThrowError()) self.assertEqual(thr.getErrorType(), ValueError) self.assertEqual(thr.getErrorMsg(), 'This is a forced error') self.assertRaises(ValueError, thr.raiseLastError) ############################################################################# def test_read_address(self): hashVal = hex_to_binary('c3a9eb6753c449c88ac193e9ddf7ab3a0be8c5ad') addrStr00 = hash160_to_addrStr(hashVal) addrStr05 = hash160_to_p2shAddrStr(hashVal) addrStrA3 = '28tvtpKmqbKUVaGHshsVKWTaRHJ5yG36xvv' addrStrBad = '1JqaKdBsruwgGcZkiVCNU2DBh56DHBsEb1' prefix, a160 = addrStr_to_hash160(addrStr00) self.assertEqual(prefix, ADDRBYTE) self.assertEqual(a160, hashVal) self.assertFalse(addrStr_is_p2sh(addrStr00)) prefix, a160 = addrStr_to_hash160(addrStr05) self.assertEqual(prefix, P2SHBYTE) self.assertEqual(a160, hashVal) self.assertTrue(addrStr_is_p2sh(addrStr05)) self.assertRaises(BadAddressError, addrStr_to_hash160, addrStrA3) self.assertRaises(ChecksumError, addrStr_to_hash160, addrStrBad) self.assertRaises(P2SHNotSupportedError, addrStr_to_hash160, addrStr05, False) ############################################################################# def test_p2pkhash_script(self): pkh = '\xab'*20 computed = hash160_to_p2pkhash_script(pkh) expected = '\x76\xa9\x14' + pkh + '\x88\xac' self.assertEqual(computed, expected) # Make sure it raises an error on non-20-byte inputs self.assertRaises(InvalidHashError, hash160_to_p2pkhash_script, '\xab'*21) ############################################################################# def test_p2sh_script(self): scriptHash = '\xab'*20 computed = hash160_to_p2sh_script(scriptHash) expected = '\xa9\x14' + scriptHash + '\x87' self.assertEqual(computed, expected) # Make sure it raises an error on non-20-byte inputs self.assertRaises(InvalidHashError, hash160_to_p2sh_script, '\xab'*21) ############################################################################# def test_p2pk_script(self): pubkey = ['\x3a'*33, \ '\x3a'*65] expected = ['\x21' + '\x3a'*33 + '\xac', \ '\x41' + '\x3a'*65 + '\xac'] for i in range(2): pk = pubkey[i] exp = expected[i] self.assertEqual( pubkey_to_p2pk_script(pk), exp) # Make sure it raises an error on non-[33,65]-byte inputs self.assertRaises(KeyDataError, pubkey_to_p2pk_script, '\xab'*21) ############################################################################# def test_script_to_p2sh(self): script = '\xab'*10 scriptHash = hex_to_binary('fc7eb079a69ac4a98e49ea373c91f62b8b9cebe2') expected = '\xa9\x14' + scriptHash + '\x87' self.assertEqual( script_to_p2sh_script(script), expected) ############################################################################# def test_pklist_to_multisig(self): pk1 = 'x01'*33 pk2 = 'xfa'*33 pk3 = 'x33'*33 pk4 = 'x01'*65 pk5 = 'xfa'*65 pk6 = 'x33'*65 pkNot = 'x33'*100 pkList1 = [pk1, pk2, pk3] pkList2 = [pk4, pk5, pk6] pkList3 = [pk1, pk5, pk3] pkList4 = [pk1, pkNot, pk3] # error #self.assertTrue(False) # STUB ############################################################################# def testCppScrAddr(self): ##### Pay to hash(pubkey) script = hex_to_binary("76a914a134408afa258a50ed7a1d9817f26b63cc9002cc88ac") a160 = hex_to_binary( "a134408afa258a50ed7a1d9817f26b63cc9002cc") scraddr = hex_to_binary( "00a134408afa258a50ed7a1d9817f26b63cc9002cc") self.assertEqual(script, scrAddr_to_script(scraddr)) self.assertEqual(scraddr, script_to_scrAddr(script)) # this uses C++ # Go round trip to avoid dependency on the network. Works in both main-net or testnet self.assertEqual(scraddr, addrStr_to_scrAddr(scrAddr_to_addrStr(scraddr))) ##### Pay to PubKey65 script = hex_to_binary( "4104" "b0bd634234abbb1ba1e986e884185c61" "cf43e001f9137f23c2c409273eb16e65" "37a576782eba668a7ef8bd3b3cfb1edb" "7117ab65129b8a2e681f3c1e0908ef7b""ac") a160 = hex_to_binary( "e24b86bff5112623ba67c63b6380636cbdf1a66d") scraddr = hex_to_binary("00e24b86bff5112623ba67c63b6380636cbdf1a66d") self.assertEqual(scraddr, script_to_scrAddr(script)) self.assertEqual(scraddr, addrStr_to_scrAddr(scrAddr_to_addrStr(scraddr))) ##### Pay to PubKey33 script = hex_to_binary( "2102" "4005c945d86ac6b01fb04258345abea7" "a845bd25689edb723d5ad4068ddd3036""ac") a160 = hex_to_binary( "0c1b83d01d0ffb2bccae606963376cca3863a7ce") scraddr = hex_to_binary("000c1b83d01d0ffb2bccae606963376cca3863a7ce") self.assertEqual(scraddr, script_to_scrAddr(script)) self.assertEqual(scraddr, addrStr_to_scrAddr(scrAddr_to_addrStr(scraddr))) ##### Non-standard script # This was from block 150951 which was erroneously produced by MagicalTux # This is not only non-standard, it's non-spendable script = hex_to_binary("76a90088ac") scraddr = hex_to_binary("ff") + hash160(hex_to_binary("76a90088ac")) self.assertEqual(scraddr, script_to_scrAddr(script)) ##### P2SH script = hex_to_binary("a914d0c15a7d41500976056b3345f542d8c944077c8a87") a160 = hex_to_binary( "d0c15a7d41500976056b3345f542d8c944077c8a") scraddr = hex_to_binary("05d0c15a7d41500976056b3345f542d8c944077c8a") self.assertEqual(script, scrAddr_to_script(scraddr)) self.assertEqual(scraddr, script_to_scrAddr(script)) # this uses C++ self.assertEqual(scraddr, addrStr_to_scrAddr(scrAddr_to_addrStr(scraddr))) ################################################################################ ################################################################################ class BinaryPackerUnpackerTest(unittest.TestCase): ############################################################################# def testBinaryUnpacker(self): ts = '\xff\xff\xff' bu = BinaryUnpacker(ts) self.assertEqual(bu.getSize(), len(ts)) bu.advance(1) self.assertEqual(bu.getRemainingSize(), len(ts)-1) self.assertEqual(bu.getBinaryString(), ts) self.assertEqual(bu.getRemainingString(), ts[1:]) bu.rewind(1) self.assertEqual(bu.getRemainingSize(), len(ts)) bu.resetPosition(2) self.assertEqual(bu.getRemainingSize(), len(ts) - 2) self.assertEqual(bu.getPosition(), 2) bu.resetPosition() self.assertEqual(bu.getRemainingSize(), len(ts)) self.assertEqual(bu.getPosition(), 0) bu.append(ts) self.assertEqual(bu.getBinaryString(), ts + ts) ############################################################################# def testBinaryPacker(self): UNKNOWN_TYPE = 100 TEST_FLOAT = 1.23456789 TEST_UINT = 0xff TEST_INT = -1 TEST_VARINT = 78 TEST_STR = 'abc' TEST_BINARY_PACKER_STR = hex_to_binary('ffff00ff000000ff00000000000000ffffffffffffffffffffffffffffff4e0361626352069e3fffffffffffff00') FS_FOR_3_BYTES = '\xff\xff\xff' bp = BinaryPacker() bp.put(UINT8, TEST_UINT) bp.put(UINT16, TEST_UINT) bp.put(UINT32, TEST_UINT) bp.put(UINT64, TEST_UINT) bp.put(INT8, TEST_INT) bp.put(INT16, TEST_INT) bp.put(INT32, TEST_INT) bp.put(INT64, TEST_INT) bp.put(VAR_INT, TEST_VARINT) bp.put(VAR_STR, TEST_STR) bp.put(FLOAT, TEST_FLOAT) bp.put(BINARY_CHUNK, FS_FOR_3_BYTES) bp.put(BINARY_CHUNK, FS_FOR_3_BYTES, 4) self.assertRaises(PackerError, bp.put, UNKNOWN_TYPE, TEST_INT) self.assertRaises(PackerError, bp.put, BINARY_CHUNK, FS_FOR_3_BYTES, 2) self.assertEqual(bp.getSize(), len(TEST_BINARY_PACKER_STR)) ts = bp.getBinaryString() self.assertEqual(ts, TEST_BINARY_PACKER_STR) bu = BinaryUnpacker(ts) self.assertEqual(bu.get(UINT8), TEST_UINT) self.assertEqual(bu.get(UINT16), TEST_UINT) self.assertEqual(bu.get(UINT32), TEST_UINT) self.assertEqual(bu.get(UINT64), TEST_UINT) self.assertEqual(bu.get(INT8), TEST_INT) self.assertEqual(bu.get(INT16), TEST_INT) self.assertEqual(bu.get(INT32), TEST_INT) self.assertEqual(bu.get(INT64), TEST_INT) self.assertEqual(bu.get(VAR_INT), TEST_VARINT) self.assertEqual(bu.get(VAR_STR), TEST_STR) self.assertAlmostEqual(bu.get(FLOAT), TEST_FLOAT, 2) self.assertEqual(bu.get(BINARY_CHUNK, 3), FS_FOR_3_BYTES) self.assertEqual(bu.get(BINARY_CHUNK, 4), FS_FOR_3_BYTES+"\x00") self.assertRaises(UnpackerError, bu.get, BINARY_CHUNK, 1) self.assertRaises(UnpackerError, bu.get, UNKNOWN_TYPE) self.assertRaises(UnpackerError, bu.get, BINARY_CHUNK, 1) # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main()armory-0.92.3/pytest/Tiab.py0000644000000000000000000001210612414772654014411 0ustar rootrootimport sys # This Code chunk has to appear before ArmoryUtils is imported # If not, it will run the tests in Mainnet. # TODO: Fix the code base so that nothing is started during imports. sys.argv.append('--testnet') # Uncomment when debugging # sys.argv.append('--debug') sys.argv.append('--nologging') import os import time import CppBlockUtils import tempfile import shutil import subprocess import copy import unittest from zipfile import ZipFile from armoryengine.BDM import TheBDM, BlockDataManagerThread, newTheBDM TOP_TIAB_BLOCK = 247 FIRST_WLT_FILE_NAME = "armory_GDHFnMQ2_.wallet" FIRST_WLT_NAME = "GDHFnMQ2" SECOND_WLT_FILE_NAME = "armory_vzgEfJrJ_.wallet" SECOND_WLT_NAME = "vzgEfJrJ" THIRD_WLT_FILE_NAME = "armory_DZMmtb2v_.wallet" THIRD_WLT_NAME = "DZMmtb2v" FIRST_WLT_BALANCE = 964.8997 TIAB_SATOSHI_PORT = 19000 # runs a Test In a Box (TIAB) bitcoind session. By copying a prebuilt # testnet with a known state # Charles's recommendation is that you keep the TIAB somewhere like ~/.armory/tiab.charles # and export that path in your .bashrc as ARMORY_TIAB_PATH class TiabSession: numInstances=0 # create a Test In a Box, initializing it and filling it with data # the data comes from a path in the environment unless tiabdatadir is set # tiab_repository is used to name which flavor of box is used if # tiabdatadir is not used - It is intended to be used for when we # have multiple testnets in a box with different properties def __init__(self, tiabZipPath="tiab.zip"): self.processes = [] self.tiabDirectory = tempfile.mkdtemp("armory_tiab") self.tiabZipPath = tiabZipPath self.running = False self.restart() def __del__(self): self.clean() # exit bitcoind and remove all data def clean(self): if not self.running: return TiabSession.numInstances -= 1 for x in self.processes: x.kill() for x in self.processes: x.wait() self.processes = [] shutil.rmtree(self.tiabDirectory) self.running=False # returns the port the first bitcoind is running on # In future versions of this class, multiple bitcoinds will get different ports, # so therefor, you should call this function to get the port to connect to def port(self, instanceNum): instance = instanceNum if instance==0: return TIAB_SATOSHI_PORT elif instance==1: return 19010 else: raise RuntimeError("No such instance number") # clean() and then start bitcoind again def callBitcoinD(self, bitcoinDArgs): bitcoinDArgsCopy = copy.copy(bitcoinDArgs) bitcoinDArgsCopy.insert(0, "bitcoind") return self.processes.append(subprocess.Popen(bitcoinDArgsCopy)) def restart(self): self.clean() if TiabSession.numInstances != 0: raise RuntimeError("Cannot have more than one Test-In-A-Box session simultaneously (yet)") TiabSession.numInstances += 1 with ZipFile(self.tiabZipPath, "r") as z: z.extractall(self.tiabDirectory) try: self.callBitcoinD(["-datadir=" + os.path.join(self.tiabDirectory,'tiab','1'), "-debug"]) self.callBitcoinD(["-datadir=" + os.path.join(self.tiabDirectory,'tiab','2'), "-debug"]) except: self.clean() raise self.running = True TIAB_ZIPFILE_NAME = 'tiab.zip' NEED_TIAB_MSG = "This Test must be run with . Copy to the test directory. Actual Block Height is " class TiabTest(unittest.TestCase): @classmethod def setUpClass(self): # Handle both calling the this test from the context of the test directory # and calling this test from the context of the main directory. # The latter happens if you run all of the tests in the directory if os.path.exists(TIAB_ZIPFILE_NAME): tiabZipPath = TIAB_ZIPFILE_NAME elif os.path.exists(os.path.join('pytest',TIAB_ZIPFILE_NAME)): tiabZipPath = (os.path.join('pytest',TIAB_ZIPFILE_NAME)) else: self.fail(NEED_TIAB_MSG) self.tiab = TiabSession(tiabZipPath=tiabZipPath) # Need to destroy whatever BDM may have been created automatically CppBlockUtils.BlockDataManager().DestroyBDM() newTheBDM() TheBDM.setDaemon(True) TheBDM.start() TheBDM.setSatoshiDir(os.path.join(self.tiab.tiabDirectory,'tiab','1','testnet3')) self.armoryHomeDir = os.path.join(self.tiab.tiabDirectory,'tiab','armory') TheBDM.setLevelDBDir(os.path.join(self.tiab.tiabDirectory,'tiab','armory','databases')) TheBDM.setBlocking(True) TheBDM.setOnlineMode(wait=True) i = 0 while not TheBDM.getBDMState()=='BlockchainReady' and i < 10: time.sleep(2) i += 1 if i >= 10: raise RuntimeError("Timeout waiting for TheBDM to get into BlockchainReady state.") @classmethod def tearDownClass(self): CppBlockUtils.BlockDataManager().DestroyBDM() self.tiab.clean() def verifyBlockHeight(self): blockHeight = TheBDM.getTopBlockHeight() self.assertEqual(blockHeight, TOP_TIAB_BLOCK, NEED_TIAB_MSG + str(blockHeight)) armory-0.92.3/pytest/SendTx.py0000644000000000000000000000457712414772654014754 0ustar rootrootimport sys from twisted.trial._synctest import SkipTest sys.path.append('..') from pytest.Tiab import TiabTest from armoryengine.ALL import * from twisted.internet import reactor TIAB_DIR = '.\\tiab' TEST_TIAB_DIR = '.\\test\\tiab' NEED_TIAB_MSG = "This Test must be run with J:/Development_Stuff/bitcoin-testnet-boxV2.7z (Armory jungle disk). Copy to the test directory." class Test: def __init__(self): self.success=False def txReturned(self, tx): # a round trip was completed # print "got something back" #if protoObj.serialize() == tx: self.factory1.stopTrying() self.factory2.stopTrying() reactor.stop() self.success=True def timeout(self): self.factory1.stopTrying() self.factory2.stopTrying() reactor.stop() self.success=False def run(self, tiab): class T: def port(self, p): if p == 0: return 19000 else: return 19010 # sends 10BTC between primary two wallets tx = hex_to_binary("0100000001721507bc7c4cdbd7cf798d362272b2e5941e619f2f300f46ac956933cb421811000000008b4830450220045e83813973971742e87a00a1dae5de02475ec4d9111373d77cac8b22b30dd802210095ced701b5ebfe41bf32a551e94fcd254189b6386f7ebaae06c22cd61aa93b2801410462326939525c697781dc280cd80a5d93f1a92ed480e30adfbeebe1b1bc1e161b3f06a222dcca62ba045c7536d3a31de2554842a58a2706b996bbdfe3bcc46a8fffffffff02404eaca0150000001976a914bec7782c7a686b60300f7831032d2740288b3fb888ac00ca9a3b000000001976a914d2f1cb6d6cee483b9c18c6ebfe371d37ad381b0488ac00000000"); self.success=False def sendTx(protoObj): # print "sent" pytx = PyTx() pytx.unserialize(tx) protoObj.sendMessage(PayloadTx(pytx)) self.factory1 = ArmoryClientFactory(None, sendTx) reactor.callWhenRunning( \ reactor.connectTCP, '127.0.0.1', \ tiab.port(0), self.factory1) self.factory2 = ArmoryClientFactory( None, func_inv=self.txReturned) reactor.callWhenRunning( \ reactor.connectTCP, '127.0.0.1', \ tiab.port(0), self.factory2) reactor.callLater(15, self.timeout) reactor.run() return self.success # Disabling this test because it's not actually testing Armory. @SkipTest class TiabSendTxTest(TiabTest): def test_sendtx(self): self.assertTrue(Test().run(self.tiab)) armory-0.92.3/pytest/testPyBtcWalletRecovery.py0000644000000000000000000001507512414772654020353 0ustar rootrootimport sys sys.path.append('..') from pytest.Tiab import TiabTest from CppBlockUtils import SecureBinaryData, CryptoECDSA, CryptoAES from armoryengine.PyBtcAddress import PyBtcAddress from armoryengine.ArmoryUtils import * from armoryengine.BinaryUnpacker import BinaryUnpacker from armoryengine.PyBtcWallet import PyBtcWallet from armoryengine.PyBtcWalletRecovery import PyBtcWalletRecovery, RECOVERMODE import unittest import os from armoryengine.ArmoryUtils import SECP256K1_ORDER, binary_to_int, BIGENDIAN class PyBtcWalletRecoveryTest(TiabTest): def setUp(self): self.corruptWallet = 'corrupt_wallet.wallet' self.wltID = self.buildCorruptWallet(self.corruptWallet) def tearDown(self): os.unlink(self.corruptWallet) os.unlink(self.corruptWallet[:-7] + '_backup.wallet') os.unlink('armory_%s_RECOVERED.wallet' % self.wltID) os.unlink('armory_%s_RECOVERED_backup.wallet' % self.wltID) def buildCorruptWallet(self, walletPath): crpWlt = PyBtcWallet() crpWlt.createNewWallet(walletPath, securePassphrase='testing', doRegisterWithBDM=False) #not registering with the BDM, have to fill the wallet address pool manually crpWlt.fillAddressPool(100) #grab the last computed address lastaddr = crpWlt.addrMap[crpWlt.lastComputedChainAddr160] #corrupt the pubkey PubKey = hex_to_binary('0478d430274f8c5ec1321338151e9f27f4c676a008bdf8638d07c0b6be9ab35c71a1518063243acd4dfe96b66e3f2ec8013c8e072cd09b3834a19f81f659cc3455') lastaddr.binPublicKey65 = SecureBinaryData(PubKey) crpWlt.addrMap[crpWlt.lastComputedChainAddr160] = lastaddr crpWlt.fillAddressPool(200) #insert a gap and inconsistent encryption newAddr = PyBtcAddress() newAddr.chaincode = lastaddr.chaincode newAddr.chainIndex = 250 PrivKey = hex_to_binary('e3b0c44298fc1c149afbf4c8996fb92427ae41e5978fe51ca495991b7852b855') newAddr.binPrivKey32_Plain = SecureBinaryData(PrivKey) newAddr.binPublicKey65 = CryptoECDSA().ComputePublicKey( \ newAddr.binPrivKey32_Plain) newAddr.addrStr20 = newAddr.binPublicKey65.getHash160() newAddr.isInitialized = True crpWlt.addrMap[newAddr.addrStr20] = newAddr crpWlt.lastComputedChainAddr160 = newAddr.addrStr20 crpWlt.fillAddressPool(250) lastAddr = crpWlt.addrMap[crpWlt.lastComputedChainAddr160] PrivKey = hex_to_binary('e3b0c44298fc1c149afbf4c8996fb92427ae41e5978fe51ca495991b00000000') lastAddr.binPrivKey32_Plain = SecureBinaryData(PrivKey) lastAddr.binPublicKey65 = CryptoECDSA().ComputePublicKey( \ lastAddr.binPrivKey32_Plain) lastAddr.keyChanged = True crpWlt.kdfKey = crpWlt.kdf.DeriveKey(SecureBinaryData('testing')) lastAddr.lock(secureKdfOutput=crpWlt.kdfKey) lastAddr.useEncryption = True crpWlt.fillAddressPool(350); #TODO: corrupt a private key #break an address entry at binary level return crpWlt.uniqueIDB58 def testWalletRecovery(self): #run recovery on broken wallet recThread = PyBtcWalletRecovery().RecoverWallet(self.corruptWallet, \ 'testing', RECOVERMODE.Full, \ returnError = 'Dict') recThread.join() brkWltResult = recThread.output self.assertTrue(len(brkWltResult['sequenceGaps'])==1, \ "Sequence Gap Undetected") self.assertTrue(len(brkWltResult['forkedPublicKeyChain'])==3, \ "Address Chain Forks Undetected") self.assertTrue(len(brkWltResult['unmatchedPair'])==100, \ "Unmatched Priv/Pub Key Undetected") self.assertTrue(len(brkWltResult['misc'])==50, \ "Wallet Encryption Inconsistency Undetected") self.assertTrue(len(brkWltResult['importedErr'])==50, \ "Unexpected Errors Found") self.assertTrue(brkWltResult['nErrors']==204, \ "Unexpected Errors Found") #check obfuscated keys yield the valid key #grab root key badWlt = PyBtcWallet() badWlt.readWalletFile(self.corruptWallet, False, False) rootAddr = badWlt.addrMap['ROOT'] SecurePassphrase = SecureBinaryData('testing') secureKdfOutput = badWlt.kdf.DeriveKey(SecurePassphrase) #HMAC Q rootAddr.unlock(secureKdfOutput) Q = rootAddr.binPrivKey32_Plain.toBinStr() nonce = 0 while 1: hmacQ = HMAC256(Q, 'LogMult%d' % nonce) if binary_to_int(hmacQ, BIGENDIAN) < SECP256K1_ORDER: hmacQ = SecureBinaryData(hmacQ) break nonce = nonce +1 #Bad Private Keys import operator badKeys = [addrObj for addrObj in (sorted(badWlt.addrMap.values(), key=operator.attrgetter('chainIndex')))] #run through obdsPrivKey for i in range(0, len(brkWltResult['privMult'])): obfsPKey = SecureBinaryData( hex_to_binary(brkWltResult['privMult'][i])) pKey = CryptoECDSA().ECMultiplyScalars(obfsPKey.toBinStr(), \ hmacQ.toBinStr()) try: badKeys[i+201].unlock(secureKdfOutput) except: continue self.assertTrue(binary_to_hex(pKey) == \ badKeys[i+201].binPrivKey32_Plain.toHexStr(), \ 'key mult error') #run recovery on recovered wallet recThread = PyBtcWalletRecovery().RecoverWallet( \ 'armory_%s_RECOVERED.wallet' % self.wltID, \ 'testing', RECOVERMODE.Full, \ returnError = 'Dict') recThread.join() rcvWltResult = recThread.output self.assertTrue(len(rcvWltResult['importedErr'])==50, \ "Unexpected Errors Found") self.assertTrue(rcvWltResult['nErrors']==50, \ "Unexpected Errors Found") self.assertTrue(len(rcvWltResult['negativeImports'])==99, \ "Missing neg Imports") # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main()armory-0.92.3/pytest/testPyBtcWallet.py0000644000000000000000000004553412414772654016637 0ustar rootroot''' Created on Aug 14, 2013 @author: Andy ''' import sys sys.path.append('..') from pytest.Tiab import TiabTest, FIRST_WLT_NAME, SECOND_WLT_NAME import os import unittest from armoryengine.MultiSigUtils import readLockboxesFile from CppBlockUtils import SecureBinaryData from armoryengine.ArmoryUtils import convertKeyDataToAddress, \ hash256, binary_to_hex, hex_to_binary, CLI_OPTIONS, \ WalletLockError, InterruptTestError, MULTISIG_FILE_NAME from armoryengine.PyBtcWallet import PyBtcWallet from armoryengine.BDM import TheBDM sys.argv.append('--nologging') WALLET_ROOT_ADDR = '5da74ed60a43a7ff11f0ba56cb0192b03518cc56' NEW_UNUSED_ADDR = 'fb80e6fd042fa24178b897a6a70e1ae7eb56a20a' class PyBtcWalletTest(TiabTest): def setUp(self): self.shortlabel = 'TestWallet1' self.wltID ='3VB8XSoY' self.fileA = os.path.join(self.armoryHomeDir, 'armory_%s_.wallet' % self.wltID) self.fileB = os.path.join(self.armoryHomeDir, 'armory_%s_backup.wallet' % self.wltID) self.fileAupd = os.path.join(self.armoryHomeDir, 'armory_%s_backup_unsuccessful.wallet' % self.wltID) self.fileBupd = os.path.join(self.armoryHomeDir, 'armory_%s_update_unsuccessful.wallet' % self.wltID) self.removeFileList([self.fileA, self.fileB, self.fileAupd, self.fileBupd]) # We need a controlled test, so we script the all the normally-random stuff self.privKey = SecureBinaryData('\xaa'*32) self.privKey2 = SecureBinaryData('\x33'*32) self.chainstr = SecureBinaryData('\xee'*32) theIV = SecureBinaryData(hex_to_binary('77'*16)) self.passphrase = SecureBinaryData('A self.passphrase') self.passphrase2 = SecureBinaryData('A new self.passphrase') self.wlt = PyBtcWallet().createNewWallet(withEncrypt=False, \ plainRootKey=self.privKey, \ chaincode=self.chainstr, \ IV=theIV, \ shortLabel=self.shortlabel, armoryHomeDir = self.armoryHomeDir) def tearDown(self): self.removeFileList([self.fileA, self.fileB, self.fileAupd, self.fileBupd]) # ********************************************************************* # Testing deterministic, encrypted wallet features' # ********************************************************************* def removeFileList(self, fileList): for f in fileList: if os.path.exists(f): os.remove(f) def testBackupWallet(self): backupTestPath = os.path.join(self.armoryHomeDir, 'armory_%s_.wallet.backup.test' % self.wltID) # Remove backupTestPath in case it exists backupFileList = [backupTestPath, self.fileB] self.removeFileList(backupFileList) # Remove the backup test path that is to be created after tear down. self.addCleanup(self.removeFileList, backupFileList) self.wlt.backupWalletFile(backupTestPath) self.assertTrue(os.path.exists(backupTestPath)) self.wlt.backupWalletFile() self.assertTrue(os.path.exists(self.fileB)) def testIsWltSigningAnyLockbox(self): lockboxList = readLockboxesFile(os.path.join(self.armoryHomeDir, MULTISIG_FILE_NAME)) self.assertFalse(self.wlt.isWltSigningAnyLockbox(lockboxList)) lboxWltAFile = os.path.join(self.armoryHomeDir,'armory_%s_.wallet' % FIRST_WLT_NAME) lboxWltA = PyBtcWallet().readWalletFile(lboxWltAFile, doScanNow=True) self.assertTrue(lboxWltA.isWltSigningAnyLockbox(lockboxList)) lboxWltBFile = os.path.join(self.armoryHomeDir,'armory_%s_.wallet' % SECOND_WLT_NAME) lboxWltB = PyBtcWallet().readWalletFile(lboxWltBFile, doScanNow=True) self.assertTrue(lboxWltB.isWltSigningAnyLockbox(lockboxList)) # Remove wallet files, need fresh dir for this test def testPyBtcWallet(self): self.wlt.addrPoolSize = 5 # No block chain loaded so this should return -1 # self.assertEqual(self.wlt.detectHighestUsedIndex(True), -1) self.assertEqual(self.wlt.kdfKey, None) self.assertEqual(binary_to_hex(self.wlt.addrMap['ROOT'].addrStr20), WALLET_ROOT_ADDR ) ############################################################################# # (1) Getting a new address: newAddr = self.wlt.getNextUnusedAddress() self.wlt.pprint(indent=' '*5) self.assertEqual(binary_to_hex(newAddr.addrStr20), NEW_UNUSED_ADDR) # (1) Re-reading wallet from file, compare the two wallets wlt2 = PyBtcWallet().readWalletFile(self.wlt.walletPath) self.assertTrue(self.wlt.isEqualTo(wlt2)) ############################################################################# # Test locking an unencrypted wallet does not lock self.assertFalse(self.wlt.useEncryption) self.wlt.lock() self.assertFalse(self.wlt.isLocked) # (2)Testing unencrypted wallet import-address' originalLength = len(self.wlt.linearAddr160List) self.wlt.importExternalAddressData(privKey=self.privKey2) self.assertEqual(len(self.wlt.linearAddr160List), originalLength+1) # (2) Re-reading wallet from file, compare the two wallets wlt2 = PyBtcWallet().readWalletFile(self.wlt.walletPath) self.assertTrue(self.wlt.isEqualTo(wlt2)) # (2a)Testing deleteImportedAddress # Wallet size before delete:', os.path.getsize(self.wlt.walletPath) # Addresses before delete:', len(self.wlt.linearAddr160List) toDelete160 = convertKeyDataToAddress(self.privKey2) self.wlt.deleteImportedAddress(toDelete160) self.assertEqual(len(self.wlt.linearAddr160List), originalLength) # (2a) Reimporting address for remaining tests # Wallet size before reimport:', os.path.getsize(self.wlt.walletPath) self.wlt.importExternalAddressData(privKey=self.privKey2) self.assertEqual(len(self.wlt.linearAddr160List), originalLength+1) # (2b)Testing ENCRYPTED wallet import-address privKey3 = SecureBinaryData('\xbb'*32) privKey4 = SecureBinaryData('\x44'*32) self.chainstr2 = SecureBinaryData('\xdd'*32) theIV2 = SecureBinaryData(hex_to_binary('66'*16)) self.passphrase2= SecureBinaryData('hello') wltE = PyBtcWallet().createNewWallet(withEncrypt=True, \ plainRootKey=privKey3, \ securePassphrase=self.passphrase2, \ chaincode=self.chainstr2, \ IV=theIV2, \ shortLabel=self.shortlabel, armoryHomeDir = self.armoryHomeDir) # We should have thrown an error about importing into a locked wallet... self.assertRaises(WalletLockError, wltE.importExternalAddressData, privKey=self.privKey2) wltE.unlock(securePassphrase=self.passphrase2) wltE.importExternalAddressData(privKey=self.privKey2) # (2b) Re-reading wallet from file, compare the two wallets wlt2 = PyBtcWallet().readWalletFile(wltE.walletPath) self.assertTrue(wltE.isEqualTo(wlt2)) # (2b) Unlocking wlt2 after re-reading locked-import-wallet wlt2.unlock(securePassphrase=self.passphrase2) self.assertFalse(wlt2.isLocked) ############################################################################# # Now play with encrypted wallets # *********************************************************************' # (3)Testing conversion to encrypted wallet kdfParams = self.wlt.computeSystemSpecificKdfParams(0.1) self.wlt.changeKdfParams(*kdfParams) self.assertEqual(self.wlt.kdf.getSalt(), kdfParams[2]) self.wlt.changeWalletEncryption( securePassphrase=self.passphrase ) self.assertEqual(self.wlt.kdf.getSalt(), kdfParams[2]) # (3) Re-reading wallet from file, compare the two wallets' wlt2 = PyBtcWallet().readWalletFile(self.wlt.getWalletPath()) self.assertTrue(self.wlt.isEqualTo(wlt2)) # NOTE: this isEqual operation compares the serializations # of the wallet addresses, which only contains the # encrypted versions of the private keys. However, # self.wlt is unlocked and contains the plaintext keys, too # while wlt2 does not. self.wlt.lock() for key in self.wlt.addrMap: self.assertTrue(self.wlt.addrMap[key].isLocked) self.assertEqual(self.wlt.addrMap[key].binPrivKey32_Plain.toHexStr(), '') ############################################################################# # (4)Testing changing self.passphrase on encrypted wallet', self.wlt.unlock( securePassphrase=self.passphrase ) for key in self.wlt.addrMap: self.assertFalse(self.wlt.addrMap[key].isLocked) self.assertNotEqual(self.wlt.addrMap[key].binPrivKey32_Plain.toHexStr(), '') # ...to same self.passphrase' origKdfKey = self.wlt.kdfKey self.wlt.changeWalletEncryption( securePassphrase=self.passphrase ) self.assertEqual(origKdfKey, self.wlt.kdfKey) # (4)And now testing new self.passphrase...' self.wlt.changeWalletEncryption( securePassphrase=self.passphrase2 ) self.assertNotEqual(origKdfKey, self.wlt.kdfKey) # (4) Re-reading wallet from file, compare the two wallets' wlt2 = PyBtcWallet().readWalletFile(self.wlt.getWalletPath()) self.assertTrue(self.wlt.isEqualTo(wlt2)) ############################################################################# # (5)Testing changing KDF on encrypted wallet' self.wlt.unlock( securePassphrase=self.passphrase2 ) MEMORY_REQT_BYTES = 1024 NUM_ITER = 999 SALT_ALL_0 ='00'*32 self.wlt.changeKdfParams(MEMORY_REQT_BYTES, NUM_ITER, hex_to_binary(SALT_ALL_0), self.passphrase2) self.assertEqual(self.wlt.kdf.getMemoryReqtBytes(), MEMORY_REQT_BYTES) self.assertEqual(self.wlt.kdf.getNumIterations(), NUM_ITER) self.assertEqual(self.wlt.kdf.getSalt().toHexStr(), SALT_ALL_0) self.wlt.changeWalletEncryption( securePassphrase=self.passphrase2 ) # I don't know why this shouldn't be '' # Commenting out because it's a broken assertion # self.assertNotEqual(origKdfKey.toHexStr(), '') # (5) Get new address from locked wallet' # Locking wallet' self.wlt.lock() for i in range(10): self.wlt.getNextUnusedAddress() self.assertEqual(len(self.wlt.addrMap), originalLength+13) # (5) Re-reading wallet from file, compare the two wallets' wlt2 = PyBtcWallet().readWalletFile(self.wlt.getWalletPath()) self.assertTrue(self.wlt.isEqualTo(wlt2)) ############################################################################# # !!! #forkOnlineWallet() # (6)Testing forking encrypted wallet for online mode' self.wlt.forkOnlineWallet('OnlineVersionOfEncryptedWallet.bin') wlt2.readWalletFile('OnlineVersionOfEncryptedWallet.bin') for key in wlt2.addrMap: self.assertTrue(self.wlt.addrMap[key].isLocked) self.assertEqual(self.wlt.addrMap[key].binPrivKey32_Plain.toHexStr(), '') # (6)Getting a new addresses from both wallets' for i in range(self.wlt.addrPoolSize*2): self.wlt.getNextUnusedAddress() wlt2.getNextUnusedAddress() newaddr1 = self.wlt.getNextUnusedAddress() newaddr2 = wlt2.getNextUnusedAddress() self.assertTrue(newaddr1.getAddr160() == newaddr2.getAddr160()) self.assertEqual(len(wlt2.addrMap), 3*originalLength+14) # (6) Re-reading wallet from file, compare the two wallets wlt3 = PyBtcWallet().readWalletFile('OnlineVersionOfEncryptedWallet.bin') self.assertTrue(wlt3.isEqualTo(wlt2)) ############################################################################# # (7)Testing removing wallet encryption' # Wallet is locked? ', self.wlt.isLocked self.wlt.unlock(securePassphrase=self.passphrase2) self.wlt.changeWalletEncryption( None ) for key in self.wlt.addrMap: self.assertFalse(self.wlt.addrMap[key].isLocked) self.assertNotEqual(self.wlt.addrMap[key].binPrivKey32_Plain.toHexStr(), '') # (7) Re-reading wallet from file, compare the two wallets' wlt2 = PyBtcWallet().readWalletFile(self.wlt.getWalletPath()) self.assertTrue(self.wlt.isEqualTo(wlt2)) ############################################################################# # \n' # *********************************************************************' # (8)Doing interrupt tests to test wallet-file-update recovery' def hashfile(fn): f = open(fn,'r') d = hash256(f.read()) f.close() return binary_to_hex(d[:8]) def verifyFileStatus(fileAExists = True, fileBExists = True, \ fileAupdExists = True, fileBupdExists = True): self.assertEqual(os.path.exists(self.fileA), fileAExists) self.assertEqual(os.path.exists(self.fileB), fileBExists) self.assertEqual(os.path.exists(self.fileAupd), fileAupdExists) self.assertEqual(os.path.exists(self.fileBupd), fileBupdExists) correctMainHash = hashfile(self.fileA) try: self.wlt.interruptTest1 = True self.wlt.getNextUnusedAddress() except InterruptTestError: # Interrupted!' pass self.wlt.interruptTest1 = False # (8a)Interrupted getNextUnusedAddress on primary file update' verifyFileStatus(True, True, False, True) # (8a)Do consistency check on the wallet' self.wlt.doWalletFileConsistencyCheck() verifyFileStatus(True, True, False, False) self.assertEqual(correctMainHash, hashfile(self.fileA)) try: self.wlt.interruptTest2 = True self.wlt.getNextUnusedAddress() except InterruptTestError: # Interrupted!' pass self.wlt.interruptTest2 = False # (8b)Interrupted getNextUnusedAddress on between primary/backup update' verifyFileStatus(True, True, True, True) # (8b)Do consistency check on the wallet' self.wlt.doWalletFileConsistencyCheck() verifyFileStatus(True, True, False, False) self.assertEqual(hashfile(self.fileA), hashfile(self.fileB)) # (8c) Try interrupting at state 3' verifyFileStatus(True, True, False, False) try: self.wlt.interruptTest3 = True self.wlt.getNextUnusedAddress() except InterruptTestError: # Interrupted!' pass self.wlt.interruptTest3 = False # (8c)Interrupted getNextUnusedAddress on backup file update' verifyFileStatus(True, True, True, False) # (8c)Do consistency check on the wallet' self.wlt.doWalletFileConsistencyCheck() verifyFileStatus(True, True, False, False) self.assertEqual(hashfile(self.fileA), hashfile(self.fileB)) ############################################################################# # \n' # *********************************************************************' # (9)Checksum-based byte-error correction tests!' # (9)Start with a good primary and backup file...' # (9a)Open primary wallet, change second byte in KDF' wltfile = open(self.wlt.walletPath,'r+b') wltfile.seek(326) wltfile.write('\xff') wltfile.close() # (9a)Byte changed, file hashes:' verifyFileStatus(True, True, False, False) # (9a)Try to read wallet from file, should correct KDF error, write fix' wlt2 = PyBtcWallet().readWalletFile(self.wlt.walletPath) verifyFileStatus(True, True, False, False) self.assertNotEqual(hashfile(self.fileA), hashfile(self.fileB)) # \n' # *********************************************************************' # (9b)Change a byte in each checksummed field in root addr' wltfile = open(self.wlt.walletPath,'r+b') wltfile.seek(838); wltfile.write('\xff') wltfile.seek(885); wltfile.write('\xff') wltfile.seek(929); wltfile.write('\xff') wltfile.seek(954); wltfile.write('\xff') wltfile.seek(1000); wltfile.write('\xff') wltfile.close() # (9b) New file hashes...' verifyFileStatus(True, True, False, False) # (9b)Try to read wallet from file, should correct address errors' wlt2 = PyBtcWallet().readWalletFile(self.wlt.walletPath) verifyFileStatus(True, True, False, False) self.assertNotEqual(hashfile(self.fileA), hashfile(self.fileB)) # \n' # *********************************************************************' # (9c)Change a byte in each checksummed field, of first non-root addr' wltfile = open(self.wlt.walletPath,'r+b') wltfile.seek(1261+21+838); wltfile.write('\xff') wltfile.seek(1261+21+885); wltfile.write('\xff') wltfile.seek(1261+21+929); wltfile.write('\xff') wltfile.seek(1261+21+954); wltfile.write('\xff') wltfile.seek(1261+21+1000); wltfile.write('\xff') wltfile.close() # (9c) New file hashes...' verifyFileStatus(True, True, False, False) # (9c)Try to read wallet from file, should correct address errors' wlt2 = PyBtcWallet().readWalletFile(self.wlt.walletPath) verifyFileStatus(True, True, False, False) self.assertNotEqual(hashfile(self.fileA), hashfile(self.fileB)) # \n' # *********************************************************************' # (9d)Now butcher the CHECKSUM, see if correction works' wltfile = open(self.wlt.walletPath,'r+b') wltfile.seek(977); wltfile.write('\xff') wltfile.close() # (9d) New file hashes...' verifyFileStatus(True, True, False, False) # (9d)Try to read wallet from file, should correct address errors' wlt2 = PyBtcWallet().readWalletFile(self.wlt.walletPath) verifyFileStatus(True, True, False, False) self.assertNotEqual(hashfile(self.fileA), hashfile(self.fileB)) # *******' # (9z) Test comment I/O' comment1 = 'This is my normal unit-testing address.' comment2 = 'This is fake tx... no tx has this hash.' comment3 = comment1 + ' Corrected!' hash1 = '\x1f'*20 # address160 hash2 = '\x2f'*32 # tx hash self.wlt.setComment(hash1, comment1) self.wlt.setComment(hash2, comment2) self.wlt.setComment(hash1, comment3) wlt2 = PyBtcWallet().readWalletFile(self.wlt.walletPath) c3 = wlt2.getComment(hash1) c2 = wlt2.getComment(hash2) self.assertEqual(c3, comment3) self.assertEqual(c2, comment2) # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main()armory-0.92.3/pytest/testDecorators.py0000644000000000000000000000300112414772654016531 0ustar rootroot################################################################################ # # Copyright (C) 2011-2014, Armory Technologies, Inc. # Distributed under the GNU Affero General Public License (AGPL v3) # See LICENSE or http://www.gnu.org/licenses/agpl.html # ################################################################################ # # Project: Armory # Author: Andy Ofiesh # Website: www.bitcoinarmory.com # Orig Date: 2 January, 2014 # ################################################################################ import sys sys.path.append('..') from pytest.Tiab import TiabTest import unittest from armoryengine.Decorators import EmailOutput # NOT a real unit test. To verify this test properly # uncomment the decorator and specify the email arguments # The email arguments should never be pushed to the repo # Run the test and check your email class EmailOutputTest(TiabTest): def testEmailOutput(self): actualResult = someStringOutputFunction("World!") expectedResult = "Hello World!" self.assertEqual(actualResult, expectedResult) # @EmailOutput(, , , ) def someStringOutputFunction(inputString): return "Hello " + inputString # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main() armory-0.92.3/pytest/testSplitSecret.py0000644000000000000000000000773712414772654016711 0ustar rootroot''' Created on Aug 4, 2013 @author: Andy ''' import sys sys.path.append('..') from pytest.Tiab import TiabTest from random import shuffle import unittest from armoryengine.ArmoryUtils import FiniteField, FiniteFieldError, SplitSecret, \ hex_to_binary, RightNow, binary_to_hex, ReconstructSecret sys.argv.append('--nologging') sys.argv.append('--nologging') TEST_A = 200 TEST_B = 100 TEST_ADD_RESULT = 49 TEST_SUB_RESULT = 100 TEST_MULT_RESULT = 171 TEST_DIV_RESULT = 2 TEST_MTRX = [[1, 2, 3], [3,4,5], [6,7,8] ] TEST_VECTER = [1, 2, 3] TEST_3_BY_2_MTRX = [[1, 2, 3], [3,4,5]] TEST_2_BY_3_MTRX = [[1, 2], [3,4], [5, 6]] TEST_RMROW1CO1L_RESULT = [[1, 3], [6, 8]] TEST_DET_RESULT = 0 TEST_MULT_VECT_RESULT = [14, 26, 44] TEST_MULT_VECT_RESULT2 = [5, 11, 17] TEST_MULT_VECT_RESULT3 = [[7, 10], [15, 22], [23, 34]] TEST_MULT_VECT_RESULT4 = [[248, 5, 249], [6, 241, 4], [248, 5, 249]] TEST_MULT_VECT_RESULT5 = [[0, 0, 0], [0, 0, 0], [0, 0, 0]] class SplitSecretTest(TiabTest): def testFiniteFieldTest(self): ff1 = FiniteField(1) self.assertRaises(FiniteFieldError, FiniteField, 257) self.assertEqual(ff1.add(TEST_A, TEST_B), TEST_ADD_RESULT) self.assertEqual(ff1.subtract(TEST_A, TEST_B), TEST_SUB_RESULT) self.assertEqual(ff1.mult(TEST_A, TEST_B), TEST_MULT_RESULT) self.assertEqual(ff1.divide(TEST_A, TEST_B), TEST_DIV_RESULT) self.assertEqual(ff1.mtrxrmrowcol(TEST_MTRX, 1, 1), TEST_RMROW1CO1L_RESULT) self.assertEqual(ff1.mtrxrmrowcol(TEST_3_BY_2_MTRX, 1, 1), []) self.assertEqual(ff1.mtrxdet([[1]]), 1) self.assertEqual(ff1.mtrxdet(TEST_3_BY_2_MTRX), -1) self.assertEqual(ff1.mtrxdet(TEST_MTRX), TEST_DET_RESULT) self.assertEqual(ff1.mtrxmultvect(TEST_MTRX, TEST_VECTER), TEST_MULT_VECT_RESULT) self.assertEqual(ff1.mtrxmultvect(TEST_3_BY_2_MTRX, TEST_VECTER), TEST_MULT_VECT_RESULT[:2]) self.assertEqual(ff1.mtrxmultvect(TEST_2_BY_3_MTRX, TEST_VECTER), TEST_MULT_VECT_RESULT2) self.assertEqual(ff1.mtrxmult(TEST_2_BY_3_MTRX, TEST_3_BY_2_MTRX), TEST_MULT_VECT_RESULT3) self.assertEqual(ff1.mtrxmult(TEST_2_BY_3_MTRX, TEST_2_BY_3_MTRX), TEST_MULT_VECT_RESULT3) self.assertEqual(ff1.mtrxadjoint(TEST_MTRX), TEST_MULT_VECT_RESULT4) self.assertEqual(ff1.mtrxinv(TEST_MTRX), TEST_MULT_VECT_RESULT5) def testSplitSecret(self): self.callSplitSecret('9f', 2,3) self.callSplitSecret('9f', 3,5) self.callSplitSecret('9f', 4,7) self.callSplitSecret('9f', 5,9) self.callSplitSecret('9f', 6,7) self.callSplitSecret('9f'*16, 3,5, 16) self.callSplitSecret('9f'*16, 7,10, 16) self.assertRaises(FiniteFieldError, SplitSecret, '9f'*16, 3, 5, 8) self.assertRaises(FiniteFieldError, SplitSecret, '9f', 5,4) self.assertRaises(FiniteFieldError, SplitSecret, '9f', 1,1) def callSplitSecret(self, secretHex, M, N, nbytes=1): secret = hex_to_binary(secretHex) print '\nSplitting secret into %d-of-%d: secret=%s' % (M,N,secretHex) tstart = RightNow() out = SplitSecret(secret, M, N) tsplit = RightNow() - tstart print 'Fragments:' for i in range(len(out)): x = binary_to_hex(out[i][0]) y = binary_to_hex(out[i][1]) print ' Fragment %d: [%s, %s]' % (i+1,x,y) trecon = 0 print 'Reconstructing secret from various subsets of fragments...' for i in range(10): shuffle(out) tstart = RightNow() reconstruct = ReconstructSecret(out, M, nbytes) trecon += RightNow() - tstart print ' The reconstructed secret is:', binary_to_hex(reconstruct) self.assertEqual(binary_to_hex(reconstruct), secretHex) print 'Splitting secret took: %0.5f sec' % tsplit print 'Reconstructing takes: %0.5f sec' % (trecon/10) # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main()armory-0.92.3/pytest/testPyTX.py0000644000000000000000000005550112414772654015304 0ustar rootroot''' Created on Aug 4, 2013 @author: Andy ''' import sys sys.path.append('..') import unittest from armoryengine.ArmoryUtils import hex_to_binary, binary_to_hex, hex_to_int, \ ONE_BTC from armoryengine.BinaryUnpacker import BinaryUnpacker from armoryengine.Block import PyBlock from armoryengine.PyBtcAddress import PyBtcAddress from armoryengine.Script import PyScriptProcessor from armoryengine.Transaction import PyTx, PyTxIn, PyOutPoint, PyTxOut, \ PyCreateAndSignTx, getMultisigScriptInfo, BlockComponent,\ PyCreateAndSignTx_old from pytest.Tiab import TiabTest # Unserialize an reserialize tx1raw = hex_to_binary( \ '01000000016290dce984203b6a5032e543e9e272d8bce934c7de4d15fa0fe44d' 'd49ae4ece9010000008b48304502204f2fa458d439f957308bca264689aa175e' '3b7c5f78a901cb450ebd20936b2c500221008ea3883a5b80128e55c9c6070aa6' '264e1e0ce3d18b7cd7e85108ce3d18b7419a0141044202550a5a6d3bb81549c4' 'a7803b1ad59cdbba4770439a4923624a8acfc7d34900beb54a24188f7f0a4068' '9d905d4847cc7d6c8d808a457d833c2d44ef83f76bffffffff0242582c0a0000' '00001976a914c1b4695d53b6ee57a28647ce63e45665df6762c288ac80d1f008' '000000001976a9140e0aec36fe2545fb31a41164fb6954adcd96b34288ac00000000') tx2raw = hex_to_binary( \ '0100000001f658dbc28e703d86ee17c9a2d3b167a8508b082fa0745f55be5144' 'a4369873aa010000008c49304602210041e1186ca9a41fdfe1569d5d807ca7ff' '6c5ffd19d2ad1be42f7f2a20cdc8f1cc0221003366b5d64fe81e53910e156914' '091d12646bc0d1d662b7a65ead3ebe4ab8f6c40141048d103d81ac9691cf13f3' 'fc94e44968ef67b27f58b27372c13108552d24a6ee04785838f34624b294afee' '83749b64478bb8480c20b242c376e77eea2b3dc48b4bffffffff0200e1f50500' '0000001976a9141b00a2f6899335366f04b277e19d777559c35bc888ac40aeeb' '02000000001976a9140e0aec36fe2545fb31a41164fb6954adcd96b34288ac00000000') multiTx1raw = hex_to_binary( \ '0100000004a14fd232f045f0c9f28c6848a22fee393152e901eaa61a9f18438b3ba05c6035010000008a47304402201b19808aa145dbebf775ed11a15d763eaa2' 'b5df92b20f9835f62c72404918b1b02205aea3e816ac6ac7545254b9c34a00c37f20024793bbe0a64958934343f3c577b014104c0f3d0a4920bb6825769dd6ae1' 'e36b0ac36581639d605241cdd548c4ef5d46cda5ac21723d478041a63118f192fdb730c4cf76106789824cd68879a7afeb5288ffffffffa14fd232f045f0c9f28' 'c6848a22fee393152e901eaa61a9f18438b3ba05c6035000000008b4830450220796307d9787b892c8b1ada8511d99e855ea3099e1a76ce0f7aa783ed352a6e59' '022100fc38d05d7dfbe51e28c36d854dd0dcc938d60a3e406573c3dc39253694d14a12014104630aaf9d5c8d757cb5759428d4075911a2b2ff13dd7208ad7ea1d' '1682738a7138be93ee526c9d774e0dea03fa2a5fbb68043259ddfb942c0763f9b636b40c43fffffffffa14fd232f045f0c9f28c6848a22fee393152e901eaa61a' '9f18438b3ba05c6035020000008c493046022100cb423b63197ef3cdbfaed69f61aac59755f0025bd6d7a9d3c78024d897ebcf94022100f3ad14804a3c8042387' 'eca9b9053abe99e12651a795cae7f546b08e1c08c6464014104649694df12dcd7fdb5a8c54c376b904bd7337891d865b8d306beb5d2e5d8fdf2a537d6f9df65ff' '44eb0b6042ebfdf9e338bff7f4afacb359dd6c71aea7b9b92dffffffffa14fd232f045f0c9f28c6848a22fee393152e901eaa61a9f18438b3ba05c60350300000' '08b483045022100fb9f4ddc68497a266362d489abf05184909a2b99aa64803061c88597b725877802207f39cf5a90a305aee45f365cf9e2d258e37cab4da6c123' 'aa287635cd1fd40dd001410438252055130f3dd242201684931550c4065efc1b87c48192f75868f747e2a9df9a700fed7e90068bd395c58680bd593780c8119e7' '981dae08c345588f120fcb4ffffffff02e069f902000000001976a914ad00cf2b893e132c33a79a22ae938d6309c780a488ac80f0fa02000000001976a9143155' '18b646ea65ad148ee1e2f0360233617447e288ac00000000') multiTx2raw = hex_to_binary( \ '0100000004a14fd232f045f0c9f28c6848a22fee393152e901eaa61a9f18438b3ba05c6035010000008a47304402201b19808aa145dbebf775ed11a15d763eaa2' 'b5df92b20f9835f62c72404918b1b02205aea3e816ac6ac7545254b9c34a00c37f20024793bbe0a64958934343f3c577b014104c0f3d0a4920bb6825769dd6ae1' 'e36b0ac36581639d605241cdd548c4ef5d46cda5ac21723d478041a63118f192fdb730c4cf76106789824cd68879a7afeb5288ffffffffa14fd232f045f0c9f28' 'c6848a22fee393152e901eaa61a9f18438b3ba05c6035000000008b4830450220796307d9787b892c8b1ada8511d99e855ea3099e1a76ce0f7aa783ed352a6e59' '022100fc38d05d7dfbe51e28c36d854dd0dcc938d60a3e406573c3dc39253694d14a12014104630aaf9d5c8d757cb5759428d4075911a2b2ff13dd7208ad7ea1d' '1682738a7138be93ee526c9d774e0dea03fa2a5fbb68043259ddfb942c0763f9b636b40c43fffffffffa14fd232f045f0c9f28c6848a22fee393152e901eaa61a' '9f18438b3ba05c6035020000008c493046022100cb423b63197ef3cdbfaed69f61aac59755f0025bd6d7a9d3c78024d897ebcf94022100f3ad14804a3c8042387' 'eca9b9053abe99e12651a795cae7f546b08e1c08c6464014104649694df12dcd7fdb5a8c54c376b904bd7337891d865b8d306beb5d2e5d8fdf2a537d6f9df65ff' '44eb0b6042ebfdf9e338bff7f4afacb359dd6c71aea7b9b92dffffffffa14fd232f045f0c9f28c6848a22fee393152e901eaa61a9f18438b3ba05c60350300000' '08c49304602220000fb9f4ddc68497a266362d489abf05184909a2b99aa64803061c88597b725877802207f39cf5a90a305aee45f365cf9e2d258e37cab4da6c123' 'aa287635cd1fd40dd001410438252055130f3dd242201684931550c4065efc1b87c48192f75868f747e2a9df9a700fed7e90068bd395c58680bd593780c8119e7' '981dae08c345588f120fcb4ffffffff02e069f902000000001976a914ad00cf2b893e132c33a79a22ae938d6309c780a488ac80f0fa02000000001976a9143155' '18b646ea65ad148ee1e2f0360233617447e288ac00000000') # Here's a full block, which we should be able to parse and process hexBlock = ( \ '01000000eb10c9a996a2340a4d74eaab41421ed8664aa49d18538bab59010000000000005a2f06efa9f2bd804f17877537f2080030cadbfa1eb50e02338117cc' '604d91b9b7541a4ecfbb0a1a64f1ade70301000000010000000000000000000000000000000000000000000000000000000000000000ffffffff0804cfbb0a1a' '02360affffffff0100f2052a01000000434104c2239c4eedb3beb26785753463be3ec62b82f6acd62efb65f452f8806f2ede0b338e31d1f69b1ce449558d7061' 'aa1648ddc2bf680834d3986624006a272dc21cac000000000100000003e8caa12bcb2e7e86499c9de49c45c5a1c6167ea4b894c8c83aebba1b6100f343010000' '008c493046022100e2f5af5329d1244807f8347a2c8d9acc55a21a5db769e9274e7e7ba0bb605b26022100c34ca3350df5089f3415d8af82364d7f567a6a297f' 'cc2c1d2034865633238b8c014104129e422ac490ddfcb7b1c405ab9fb42441246c4bca578de4f27b230de08408c64cad03af71ee8a3140b40408a7058a1984a9' 'f246492386113764c1ac132990d1ffffffff5b55c18864e16c08ef9989d31c7a343e34c27c30cd7caa759651b0e08cae0106000000008c4930460221009ec9aa' '3e0caf7caa321723dea561e232603e00686d4bfadf46c5c7352b07eb00022100a4f18d937d1e2354b2e69e02b18d11620a6a9332d563e9e2bbcb01cee559680a' '014104411b35dd963028300e36e82ee8cf1b0c8d5bf1fc4273e970469f5cb931ee07759a2de5fef638961726d04bd5eb4e5072330b9b371e479733c942964bb8' '6e2b22ffffffff3de0c1e913e6271769d8c0172cea2f00d6d3240afc3a20f9fa247ce58af30d2a010000008c493046022100b610e169fd15ac9f60fe2b507529' '281cf2267673f4690ba428cbb2ba3c3811fd022100ffbe9e3d71b21977a8e97fde4c3ba47b896d08bc09ecb9d086bb59175b5b9f03014104ff07a1833fd8098b' '25f48c66dcf8fde34cbdbcc0f5f21a8c2005b160406cbf34cc432842c6b37b2590d16b165b36a3efc9908d65fb0e605314c9b278f40f3e1affffffff0240420f' '00000000001976a914adfa66f57ded1b655eb4ccd96ee07ca62bc1ddfd88ac007d6a7d040000001976a914981a0c9ae61fa8f8c96ae6f8e383d6e07e77133e88' 'ac00000000010000000138e7586e0784280df58bd3dc5e3d350c9036b1ec4107951378f45881799c92a4000000008a47304402207c945ae0bbdaf9dadba07bdf' '23faa676485a53817af975ddf85a104f764fb93b02201ac6af32ddf597e610b4002e41f2de46664587a379a0161323a85389b4f82dda014104ec8883d3e4f7a3' '9d75c9f5bb9fd581dc9fb1b7cdf7d6b5a665e4db1fdb09281a74ab138a2dba25248b5be38bf80249601ae688c90c6e0ac8811cdb740fcec31dffffffff022f66' 'ac61050000001976a914964642290c194e3bfab661c1085e47d67786d2d388ac2f77e200000000001976a9141486a7046affd935919a3cb4b50a8a0c233c286c' '88ac00000000') # I made these two tx in a fake blockchain... but they should still work tx1Fake = PyTx().unserialize(hex_to_binary( ( '01000000 0163451d 1002611c 1388d5ba 4ddfdf99 196a86b5 990fb5b0 dc786207' '4fdcb8ee d2000000 004a4930 46022100 cb02fb5a 910e7554 85e3578e 6e9be315' 'a161540a 73f84ee6 f5d68641 925c59ac 0221007e 530a1826 30b50e2c 12dd09cd' 'ebfd809f 038be982 bdc2c7e9 d4cbf634 9e088d01 ffffffff 0200ca9a 3b000000' '001976a9 14cb2abd e8bccacc 32e893df 3a054b9e f7f227a4 ce88ac00 286bee00' '00000019 76a914ee 26c56fc1 d942be8d 7a24b2a1 001dd894 69398088 ac000000' '00' ).replace(' ',''))) tx2Fake = PyTx().unserialize(hex_to_binary( ( '01000000 01a5b837 da38b64a 6297862c ba8210d0 21ac59e1 2b7c6d7e 70c355f6' '972ee7a8 6e010000 008c4930 46022100 89e47100 d88d5f8c 8f62a796 dac3afb8' 'f090c6fc 2eb0c4af ac7b7567 3a364c01 0221002b f40e554d ae51264b 0a86df17' '3e45756a 89bbd302 4f166cc4 2cfd1874 13636901 41046868 0737c76d abb801cb' '2204f57d be4e4579 e4f710cd 67dc1b42 27592c81 e9b5cf02 b5ac9e8b 4c9f49be' '5251056b 6a6d011e 4c37f6b6 d17ede6b 55faa235 19e2ffff ffff0100 286bee00' '00000019 76a914c5 22664fb0 e55cdc5c 0cea73b4 aad97ec8 34323288 ac000000' '00' ).replace(' ',''))) ALL_ZERO_OUTPOINT = hex_to_binary('00' * 36) class PyTXTest(TiabTest): def testMinimizeDERSignaturePadding(self): multiTx1 = PyTx().unserialize(multiTx1raw) paddingMinimizedMulti1, newTxMulti1 = multiTx1.minimizeDERSignaturePadding() self.assertEqual(multiTx1.inputs[0].binScript, newTxMulti1.inputs[0].binScript) self.assertEqual(multiTx1.inputs[1].binScript, newTxMulti1.inputs[1].binScript) self.assertEqual(multiTx1.inputs[2].binScript, newTxMulti1.inputs[2].binScript) self.assertEqual(multiTx1.inputs[3].binScript, newTxMulti1.inputs[3].binScript) self.assertFalse(paddingMinimizedMulti1) txString = multiTx1.toString() self.assertTrue(len(txString)> 0) multiTx2 = PyTx().unserialize(multiTx2raw) paddingMinimizedMulti2, newTxMulti2 = multiTx2.minimizeDERSignaturePadding() self.assertEqual(multiTx2.inputs[0].binScript, newTxMulti2.inputs[0].binScript) self.assertEqual(multiTx2.inputs[1].binScript, newTxMulti2.inputs[1].binScript) self.assertEqual(multiTx2.inputs[2].binScript, newTxMulti2.inputs[2].binScript) # Added 1 extra byte of padding self.assertEqual(len(multiTx2.inputs[3].binScript)-1, len(newTxMulti2.inputs[3].binScript)) self.assertTrue(paddingMinimizedMulti2) tx1 = PyTx().unserialize(tx1raw) paddingMinimized1, newTx1 = tx1.minimizeDERSignaturePadding() self.assertEqual(tx1.inputs[0].binScript, newTx1.inputs[0].binScript) self.assertFalse(paddingMinimized1) tx2 = PyTx().unserialize(tx2raw) paddingMinimized2, newTx2 = tx2.minimizeDERSignaturePadding() # Old tx had 2 extra bytes of padding one each on the r and s self.assertEqual(len(tx2.inputs[0].binScript)-2, len(newTx2.inputs[0].binScript)) self.assertTrue(paddingMinimized2) def testSerializeUnserialize(self): tx1 = PyTx().unserialize(tx1raw) tx2 = PyTx().unserialize(BinaryUnpacker(tx2raw)) tx1again = tx1.serialize() tx2again = tx2.serialize() self.assertEqual(tx1again, tx1raw) self.assertEqual(tx2again, tx2raw) blk = PyBlock().unserialize( hex_to_binary(hexBlock) ) blockReHex = binary_to_hex(blk.serialize()) self.assertEqual(hexBlock, blockReHex) binRoot = blk.blockData.getMerkleRoot() self.assertEqual(blk.blockHeader.merkleRoot, blk.blockData.merkleRoot) def testCreateTx(self): addrA = PyBtcAddress().createFromPrivateKey(hex_to_int('aa' * 32)) addrB = PyBtcAddress().createFromPrivateKey(hex_to_int('bb' * 32)) # This TxIn will be completely ignored, so it can contain garbage txinA = PyTxIn() txinA.outpoint = PyOutPoint().unserialize(hex_to_binary('00'*36)) txinA.binScript = hex_to_binary('99'*4) txinA.intSeq = hex_to_int('ff'*4) # test binary unpacker in unserialize testTxIn = PyTxIn().unserialize(txinA.serialize()) self.assertEqual(txinA.getScript(), testTxIn.getScript()) self.assertEqual(txinA.intSeq, testTxIn.intSeq) self.assertEqual(txinA.outpoint.txHash, testTxIn.outpoint.txHash) txoutA = PyTxOut() txoutA.value = 50 * ONE_BTC txoutA.binScript = '\x76\xa9\x14' + addrA.getAddr160() + '\x88\xac' # Test pprint print '\nTest pretty print PyTxIn, expect PrevTXHash all 0s' testTxIn.pprint() # test binary unpacker in unserialize testTxOut = PyTxOut().unserialize(txoutA.serialize()) self.assertEqual(txoutA.getScript(), testTxOut.getScript()) self.assertEqual(txoutA.value, testTxOut.getValue()) # Test pprint print '\nTest pretty print PyTxOut' testTxOut.pprint() tx1 = PyTx() tx1.version = 1 tx1.numInputs = 1 tx1.inputs = [txinA] tx1.numOutputs = 1 tx1.outputs = [txoutA] tx1.locktime = 0 tx1hash = tx1.getHash() recipientList = tx1.makeRecipientsList() self.assertEqual(len(recipientList), 1) self.assertEqual(recipientList[0][0], 0) self.assertEqual(recipientList[0][1], 50 * ONE_BTC) self.assertEqual(tx1.getHashHex(), binary_to_hex(tx1hash)) # Creating transaction to send coins from A to B tx2 = PyCreateAndSignTx_old( [[ addrA, tx1, 0 ]], [[addrB, 50*ONE_BTC]]) psp = PyScriptProcessor() psp.setTxObjects(tx1, tx2, 0) self.assertTrue(psp.verifyTransactionValid()) def testVerifyTxFromFakeBlockChain(self): psp = PyScriptProcessor() psp.setTxObjects(tx1Fake, tx2Fake, 0) self.assertTrue(psp.verifyTransactionValid()) def test2of2MultiSigTx(self): tx1 = PyTx().unserialize(hex_to_binary('010000000189a0022c8291b4328338ec95179612b8ebf72067051de019a6084fb97eae0ebe000000004a4930460221009627882154854e3de066943ba96faba02bb8b80c1670a0a30d0408caa49f03df022100b625414510a2a66ebb43fffa3f4023744695380847ee1073117ec90cb60f2c8301ffffffff0210c18d0000000000434104a701496f10db6aa8acbb6a7aa14d62f4925f8da03de7f0262010025945f6ebcc3efd55b6aa4bc6f811a0dc1bbdd2644bdd81c8a63766aa11f650cd7736bbcaf8ac001bb7000000000043526b006b7dac7ca914fc1243972b59c1726735d3c5cca40e415039dce9879a6c936b7dac7ca914375dd72e03e7b5dbb49f7e843b7bef4a2cc2ce9e879a6c936b6c6ca200000000')) tx2 = PyTx().unserialize(hex_to_binary('01000000011c9608650a912be7fa88eecec664e6fbfa4b676708697fa99c28b3370005f32d01000000fd1701483045022017462c29efc9158cf26f2070d444bb2b087b8a0e6287a9274fa36fad30c46485022100c6d4cc6cd504f768389637df71c1ccd452e0691348d0f418130c31da8cc2a6e8014104e83c1d4079a1b36417f0544063eadbc44833a992b9667ab29b4ff252d8287687bad7581581ae385854d4e5f1fcedce7de12b1aec1cb004cabb2ec1f3de9b2e60493046022100fdc7beb27de0c3a53fbf96df7ccf9518c5fe7873eeed413ce17e4c0e8bf9c06e022100cc15103b3c2e1f49d066897fe681a12e397e87ed7ee39f1c8c4a5fef30f4c2c60141047cf315904fcc2e3e2465153d39019e0d66a8aaec1cec1178feb10d46537427239fd64b81e41651e89b89fefe6a23561d25dddc835395dd3542f83b32a1906aebffffffff01c0d8a700000000001976a914fc1243972b59c1726735d3c5cca40e415039dce988ac00000000')) # Verify 2-of-2 tx from Testnet psp = PyScriptProcessor() psp.setTxObjects(tx1, tx2, 0) self.assertTrue(psp.verifyTransactionValid()) def test2of3MultiSigTx(self): tx1 = PyTx().unserialize(hex_to_binary('010000000371c06e0639dbe6bc35e6f948da4874ae69d9d91934ec7c5366292d0cbd5f97b0010000008a47304402200117cdd3ec6259af29acea44db354a6f57ac10d8496782033f5fe0febfd77f1b02202ceb02d60dbb43e6d4e03e5b5fbadc031f8bbb3c6c34ad307939947987f600bf01410452d63c092209529ca2c75e056e947bc95f9daffb371e601b46d24377aaa3d004ab3c6be2d6d262b34d736b95f3b0ef6876826c93c4077d619c02ebd974c7facdffffffffa65aa866aa7743ec05ba61418015fc32ecabd99886732056f1d4454c8f762bf8000000008c493046022100ea0a9b41c9372837e52898205c7bebf86b28936a3ee725672d0ca8f434f876f0022100beb7243a51fbc0997e55cb519d3b9cbd59f7aba68d80ba1e8adbb53443cda3c00141043efd1ca3cffc50638031281d227ff347a3a27bc145e2f846891d29f87bc068c27710559c4d9cd71f7e9e763d6e2753172406eb1ed1fadcaf9a8972b4270f05b4ffffffffd866d14151ee1b733a2a7273f155ecb25c18303c31b2c4de5aa6080aef2e0006000000008b483045022052210f95f6b413c74ce12cfc1b14a36cb267f9fa3919fa6e20dade1cd570439f022100b9e5b325f312904804f043d06c6ebc8e4b1c6cd272856c48ab1736b9d562e10c01410423fdddfe7e4d70d762dd6596771e035f4b43d54d28c2231be1102056f81f067914fe4fb6fd6e3381228ee5587ddd2028c846025741e963d9b1d6cf2c2dea0dbcffffffff0210ef3200000000004341048a33e9fd2de28137574cc69fe5620199abe37b7d08a51c528876fe6c5fa7fc28535f5a667244445e79fffc9df85ec3d79d77693b1f37af0e2d7c1fa2e7113a48acc0d454070000000061526b006b7dac7ca9143cd1def404e12a85ead2b4d3f5f9f817fb0d46ef879a6c936b7dac7ca9146a4e7d5f798e90e84db9244d4805459f87275943879a6c936b7dac7ca914486efdd300987a054510b4ce1148d4ad290d911e879a6c936b6c6ca200000000')) tx2 = PyTx().unserialize(hex_to_binary('01000000012f654d4d1d7246d1a824c5b6c5177c0b5a1983864579aabb88cabd5d05e032e201000000fda0014730440220151ad44e7f78f9e0c4a3f2135c19ca3de8dbbb7c58893db096c0c5f1573d5dec02200724a78c3fa5f153103cb46816df46eb6cfac3718038607ddec344310066161e01410459fd82189b81772258a3fc723fdda900eb8193057d4a573ee5ad39e26b58b5c12c4a51b0edd01769f96ed1998221daf0df89634a7137a8fa312d5ccc95ed8925483045022100ca34834ece5925cff6c3d63e2bda6b0ce0685b18f481c32e70de9a971e85f12f0220572d0b5de0cf7b8d4e28f4914a955e301faaaa42f05feaa1cc63b45f938d75d9014104ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1483045022074e01e8225e8c4f9d0b3f86908d42a61e611f406e13817d16240f94f52f49359022100f4c768dd89c6435afd3834ae2c882465ade92d7e1cc5c2c2c3d8d25c41b3ea61014104ce66c9f5068b715b62cc1622572cd98a08812d8ca01563045263c3e7af6b997e603e8e62041c4eb82dfd386a3412c34c334c34eb3c76fb0e37483fc72323f807ffffffff01b0ad5407000000001976a9146a4e7d5f798e90e84db9244d4805459f8727594388ac00000000')) # Verify 2-of-3 tx from Testnet psp = PyScriptProcessor() psp.setTxObjects(tx1, tx2, 0) self.assertTrue(psp.verifyTransactionValid()) def testMultiSig(self): tx1 = PyTx().unserialize(hex_to_binary('0100000001845ad165bdc0f9b5829cf5a594c4148dfd89e24756303f3a8dabeb597afa589b010000008b483045022063c233df8efa3d1885e069e375a8eabf16b23475ef21bdc9628a513ee4caceb702210090a102c7b602043e72b34a154d495ac19b3b9e42acb962c399451f2baead8f4c014104b38f79037ad25b84a564eaf53ede93dec70b35216e6682aa71a47cefa2996ec49acfbb0a8730577c62ef9a7cc20c740aaaaee75419bef9640a4216c2b49c42d3ffffffff02000c022900000000434104c08c0a71ccbe838403e3870aa1ab871b0ab3a6014b0ba41f6df2b9aefea73134ecaa0b27797620e402a33799e9047f86519d9e43bbd504cf753c293752933f4fac406f40010000000062537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae00000000')) tx2 = PyTx().unserialize(hex_to_binary('0100000001bb664ff716b9dfc831bcc666c1767f362ad467fcfbaf4961de92e45547daab8701000000fd190100493046022100d73f633f114e0e0b324d87d38d34f22966a03b072803afa99c9408201f6d6dc6022100900e85be52ad2278d24e7edbb7269367f5f2d6f1bd338d017ca460008776614401473044022071fef8ac0aa6318817dbd242bf51fb5b75be312aa31ecb44a0afe7b49fcf840302204c223179a383bb6fcb80312ac66e473345065f7d9136f9662d867acf96c12a42015241048c006ff0d2cfde86455086af5a25b88c2b81858aab67f6a3132c885a2cb9ec38e700576fd46c7d72d7d22555eee3a14e2876c643cd70b1b0a77fbf46e62331ac4104b68ef7d8f24d45e1771101e269c0aacf8d3ed7ebe12b65521712bba768ef53e1e84fff3afbee360acea0d1f461c013557f71d426ac17a293c5eebf06e468253e00ffffffff0280969800000000001976a9140817482d2e97e4be877efe59f4bae108564549f188ac7015a7000000000062537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae00000000')) # OP_CHECKMULTISIG from Testnet psp = PyScriptProcessor() psp.setTxObjects(tx1, tx2, 0) self.assertTrue(psp.verifyTransactionValid()) ''' def testMultiSigAddrExtraction(self): script1 = hex_to_binary('4104b54b5fc1917945fff64785d4baaca66a9704e9ed26002f51f53763499643321fbc047683a62be16e114e25404ce6ffdcf625a928002403402bf9f01e5cbd5f3dad4104f576e534f9bbf6d7c5f186ff4c6e0c5442c2755314bdee62fbc656f94d6cbf32c5eb3522da21cf9f954133000ffccb20dbfec030737640cc3315ce09619210d0ac') expectedBtcAddrList1 = ['1KmV9FdKJEFFCHydZUZGdBL9uKq2T9JUm8','13maaQeK5qSPjHwnHhwNUtNKruK3qYLwvv'] self.verifyMultiSigAddrExtraction(script1, expectedBtcAddrList1) script2 = hex_to_binary('537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae') expectedBtcAddrList2 = ['1ChwTs5Dmh6y9iDh4pjWyu2X6nAhjre7SV','1G2i31fxRqaoXBfYMuE4YKb9x96uYcHeQ','12Tg96ZPSYc3P2g5c9c4znFFH2whriN9NQ'] self.verifyMultiSigAddrExtraction(script2, expectedBtcAddrList2) script3 = hex_to_binary('527a7651a269527a829178a914731cdb75c88a01cbb96729888f726b3b9f29277a879b69527a829178a914e9b4261c6122f8957683636548923acc069e8141879b6952ae') expectedBtcAddrList3 = ['1BVfH6iKT1s8fYEVSj39QkJrPqCKN4hv2m','1NJiFfFPZ177Pv96Yt4FCNZFEumyL2eKmt'] self.verifyMultiSigAddrExtraction(script3, expectedBtcAddrList3) ''' def verifyMultiSigAddrExtraction(self, scr, expectedBtcAddrList): addrList = getMultisigScriptInfo(scr)[2] btcAddrList = [] for a in addrList: btcAddrList.append(PyBtcAddress().createFromPublicKeyHash160(a).getAddrStr()) self.assertEqual(btcAddrList, expectedBtcAddrList) def testUnpackUnserializePyOutPoint(self): outpoint = PyOutPoint().unserialize(BinaryUnpacker(ALL_ZERO_OUTPOINT)) self.assertEqual(outpoint.txHash, hex_to_binary('00'*32)) self.assertEqual(outpoint.txOutIndex, 0) def testCopyPyOutPoint(self): outpoint = PyOutPoint().unserialize(BinaryUnpacker(ALL_ZERO_OUTPOINT)) outpointCopy = outpoint.copy() self.assertEqual(outpoint.txHash, outpointCopy.txHash) self.assertEqual(outpoint.txOutIndex, outpointCopy.txOutIndex) def testPPrintPyOutPoint(self): # No return value - Should just print 0s outpoint = PyOutPoint().unserialize(BinaryUnpacker(ALL_ZERO_OUTPOINT)) print "PyOutPoint PPrint Test. Expect all 0s: " outpoint.pprint() ''' Does not pass because fromCpp is missing def testCreateCppFromCppPyOutPoint(self): outpoint = PyOutPoint().unserialize(BinaryUnpacker(ALL_ZERO_OUTPOINT)) outpointFromCpp = PyOutPoint().fromCpp(outpoint.createCpp()) self.assertEqual(outpoint.txHash, outpointFromCpp.txHash) self.assertEqual(outpoint.txOutIndex, outpointFromCpp.txOutIndex) ''' def testBogusBlockComponent(self): class TestBlockComponent(BlockComponent): pass testBlkComp = TestBlockComponent() self.assertRaises(NotImplementedError, testBlkComp.serialize) self.assertRaises(NotImplementedError, testBlkComp.unserialize) # TODO: Add some tests for the OP_CHECKMULTISIG support in TxDP # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main() armory-0.92.3/pytest/testMultisig.py0000644000000000000000000020176412414772654016241 0ustar rootroot''' Created on Aug 4, 2013 @author: Andy ''' import sys import textwrap sys.path.append('..') #from pytest.Tiab import TiabTest import unittest from armoryengine.ArmoryUtils import * from armoryengine.Transaction import PyTx, UnsignedTxInput, DecoratedTxOut,\ UnsignedTransaction, TXIN_SIGSTAT, NullAuthData from armoryengine.Script import convertScriptToOpStrings from armoryengine.MultiSigUtils import calcLockboxID, computePromissoryID, \ MultiSigLockbox, MultiSigPromissoryNote, DecoratedPublicKey def normalizeAddrStr(astr): """ This extracts the addr160 from the address string (which is network- independent), and then recreates the addrStr which will use the currently-enabled network byte (mainnet, testnet, whatevernet) """ if checkAddrType==-1: raise BadAddressError('Invalid address string (bad checksum)') return hash160_to_addrStr(base58_to_binary(astr)[1:21]) # Unserialize an reserialize tx1raw = hex_to_binary( \ '01000000016290dce984203b6a5032e543e9e272d8bce934c7de4d15fa0fe44d' 'd49ae4ece9010000008b48304502204f2fa458d439f957308bca264689aa175e' '3b7c5f78a901cb450ebd20936b2c500221008ea3883a5b80128e55c9c6070aa6' '264e1e0ce3d18b7cd7e85108ce3d18b7419a0141044202550a5a6d3bb81549c4' 'a7803b1ad59cdbba4770439a4923624a8acfc7d34900beb54a24188f7f0a4068' '9d905d4847cc7d6c8d808a457d833c2d44ef83f76bffffffff0242582c0a0000' '00001976a914c1b4695d53b6ee57a28647ce63e45665df6762c288ac80d1f008' '000000001976a9140e0aec36fe2545fb31a41164fb6954adcd96b34288ac00000000') tx2raw = hex_to_binary( \ '0100000001f658dbc28e703d86ee17c9a2d3b167a8508b082fa0745f55be5144' 'a4369873aa010000008c49304602210041e1186ca9a41fdfe1569d5d807ca7ff' '6c5ffd19d2ad1be42f7f2a20cdc8f1cc0221003366b5d64fe81e53910e156914' '091d12646bc0d1d662b7a65ead3ebe4ab8f6c40141048d103d81ac9691cf13f3' 'fc94e44968ef67b27f58b27372c13108552d24a6ee04785838f34624b294afee' '83749b64478bb8480c20b242c376e77eea2b3dc48b4bffffffff0200e1f50500' '0000001976a9141b00a2f6899335366f04b277e19d777559c35bc888ac40aeeb' '02000000001976a9140e0aec36fe2545fb31a41164fb6954adcd96b34288ac00000000') multiTx1raw = hex_to_binary( \ '0100000004a14fd232f045f0c9f28c6848a22fee393152e901eaa61a9f18438b3ba05c6035010000008a47304402201b19808aa145dbebf775ed11a15d763eaa2' 'b5df92b20f9835f62c72404918b1b02205aea3e816ac6ac7545254b9c34a00c37f20024793bbe0a64958934343f3c577b014104c0f3d0a4920bb6825769dd6ae1' 'e36b0ac36581639d605241cdd548c4ef5d46cda5ac21723d478041a63118f192fdb730c4cf76106789824cd68879a7afeb5288ffffffffa14fd232f045f0c9f28' 'c6848a22fee393152e901eaa61a9f18438b3ba05c6035000000008b4830450220796307d9787b892c8b1ada8511d99e855ea3099e1a76ce0f7aa783ed352a6e59' '022100fc38d05d7dfbe51e28c36d854dd0dcc938d60a3e406573c3dc39253694d14a12014104630aaf9d5c8d757cb5759428d4075911a2b2ff13dd7208ad7ea1d' '1682738a7138be93ee526c9d774e0dea03fa2a5fbb68043259ddfb942c0763f9b636b40c43fffffffffa14fd232f045f0c9f28c6848a22fee393152e901eaa61a' '9f18438b3ba05c6035020000008c493046022100cb423b63197ef3cdbfaed69f61aac59755f0025bd6d7a9d3c78024d897ebcf94022100f3ad14804a3c8042387' 'eca9b9053abe99e12651a795cae7f546b08e1c08c6464014104649694df12dcd7fdb5a8c54c376b904bd7337891d865b8d306beb5d2e5d8fdf2a537d6f9df65ff' '44eb0b6042ebfdf9e338bff7f4afacb359dd6c71aea7b9b92dffffffffa14fd232f045f0c9f28c6848a22fee393152e901eaa61a9f18438b3ba05c60350300000' '08b483045022100fb9f4ddc68497a266362d489abf05184909a2b99aa64803061c88597b725877802207f39cf5a90a305aee45f365cf9e2d258e37cab4da6c123' 'aa287635cd1fd40dd001410438252055130f3dd242201684931550c4065efc1b87c48192f75868f747e2a9df9a700fed7e90068bd395c58680bd593780c8119e7' '981dae08c345588f120fcb4ffffffff02e069f902000000001976a914ad00cf2b893e132c33a79a22ae938d6309c780a488ac80f0fa02000000001976a9143155' '18b646ea65ad148ee1e2f0360233617447e288ac00000000') multiTx2raw = hex_to_binary( \ '0100000004a14fd232f045f0c9f28c6848a22fee393152e901eaa61a9f18438b3ba05c6035010000008a47304402201b19808aa145dbebf775ed11a15d763eaa2' 'b5df92b20f9835f62c72404918b1b02205aea3e816ac6ac7545254b9c34a00c37f20024793bbe0a64958934343f3c577b014104c0f3d0a4920bb6825769dd6ae1' 'e36b0ac36581639d605241cdd548c4ef5d46cda5ac21723d478041a63118f192fdb730c4cf76106789824cd68879a7afeb5288ffffffffa14fd232f045f0c9f28' 'c6848a22fee393152e901eaa61a9f18438b3ba05c6035000000008b4830450220796307d9787b892c8b1ada8511d99e855ea3099e1a76ce0f7aa783ed352a6e59' '022100fc38d05d7dfbe51e28c36d854dd0dcc938d60a3e406573c3dc39253694d14a12014104630aaf9d5c8d757cb5759428d4075911a2b2ff13dd7208ad7ea1d' '1682738a7138be93ee526c9d774e0dea03fa2a5fbb68043259ddfb942c0763f9b636b40c43fffffffffa14fd232f045f0c9f28c6848a22fee393152e901eaa61a' '9f18438b3ba05c6035020000008c493046022100cb423b63197ef3cdbfaed69f61aac59755f0025bd6d7a9d3c78024d897ebcf94022100f3ad14804a3c8042387' 'eca9b9053abe99e12651a795cae7f546b08e1c08c6464014104649694df12dcd7fdb5a8c54c376b904bd7337891d865b8d306beb5d2e5d8fdf2a537d6f9df65ff' '44eb0b6042ebfdf9e338bff7f4afacb359dd6c71aea7b9b92dffffffffa14fd232f045f0c9f28c6848a22fee393152e901eaa61a9f18438b3ba05c60350300000' '08c49304602220000fb9f4ddc68497a266362d489abf05184909a2b99aa64803061c88597b725877802207f39cf5a90a305aee45f365cf9e2d258e37cab4da6c123' 'aa287635cd1fd40dd001410438252055130f3dd242201684931550c4065efc1b87c48192f75868f747e2a9df9a700fed7e90068bd395c58680bd593780c8119e7' '981dae08c345588f120fcb4ffffffff02e069f902000000001976a914ad00cf2b893e132c33a79a22ae938d6309c780a488ac80f0fa02000000001976a9143155' '18b646ea65ad148ee1e2f0360233617447e288ac00000000') # Here's a full block, which we should be able to parse and process hexBlock = ( \ '01000000eb10c9a996a2340a4d74eaab41421ed8664aa49d18538bab59010000000000005a2f06efa9f2bd804f17877537f2080030cadbfa1eb50e02338117cc' '604d91b9b7541a4ecfbb0a1a64f1ade70301000000010000000000000000000000000000000000000000000000000000000000000000ffffffff0804cfbb0a1a' '02360affffffff0100f2052a01000000434104c2239c4eedb3beb26785753463be3ec62b82f6acd62efb65f452f8806f2ede0b338e31d1f69b1ce449558d7061' 'aa1648ddc2bf680834d3986624006a272dc21cac000000000100000003e8caa12bcb2e7e86499c9de49c45c5a1c6167ea4b894c8c83aebba1b6100f343010000' '008c493046022100e2f5af5329d1244807f8347a2c8d9acc55a21a5db769e9274e7e7ba0bb605b26022100c34ca3350df5089f3415d8af82364d7f567a6a297f' 'cc2c1d2034865633238b8c014104129e422ac490ddfcb7b1c405ab9fb42441246c4bca578de4f27b230de08408c64cad03af71ee8a3140b40408a7058a1984a9' 'f246492386113764c1ac132990d1ffffffff5b55c18864e16c08ef9989d31c7a343e34c27c30cd7caa759651b0e08cae0106000000008c4930460221009ec9aa' '3e0caf7caa321723dea561e232603e00686d4bfadf46c5c7352b07eb00022100a4f18d937d1e2354b2e69e02b18d11620a6a9332d563e9e2bbcb01cee559680a' '014104411b35dd963028300e36e82ee8cf1b0c8d5bf1fc4273e970469f5cb931ee07759a2de5fef638961726d04bd5eb4e5072330b9b371e479733c942964bb8' '6e2b22ffffffff3de0c1e913e6271769d8c0172cea2f00d6d3240afc3a20f9fa247ce58af30d2a010000008c493046022100b610e169fd15ac9f60fe2b507529' '281cf2267673f4690ba428cbb2ba3c3811fd022100ffbe9e3d71b21977a8e97fde4c3ba47b896d08bc09ecb9d086bb59175b5b9f03014104ff07a1833fd8098b' '25f48c66dcf8fde34cbdbcc0f5f21a8c2005b160406cbf34cc432842c6b37b2590d16b165b36a3efc9908d65fb0e605314c9b278f40f3e1affffffff0240420f' '00000000001976a914adfa66f57ded1b655eb4ccd96ee07ca62bc1ddfd88ac007d6a7d040000001976a914981a0c9ae61fa8f8c96ae6f8e383d6e07e77133e88' 'ac00000000010000000138e7586e0784280df58bd3dc5e3d350c9036b1ec4107951378f45881799c92a4000000008a47304402207c945ae0bbdaf9dadba07bdf' '23faa676485a53817af975ddf85a104f764fb93b02201ac6af32ddf597e610b4002e41f2de46664587a379a0161323a85389b4f82dda014104ec8883d3e4f7a3' '9d75c9f5bb9fd581dc9fb1b7cdf7d6b5a665e4db1fdb09281a74ab138a2dba25248b5be38bf80249601ae688c90c6e0ac8811cdb740fcec31dffffffff022f66' 'ac61050000001976a914964642290c194e3bfab661c1085e47d67786d2d388ac2f77e200000000001976a9141486a7046affd935919a3cb4b50a8a0c233c286c' '88ac00000000') # I made these two tx in a fake blockchain... but they should still work tx1Fake = PyTx().unserialize(hex_to_binary( ( '01000000 0163451d 1002611c 1388d5ba 4ddfdf99 196a86b5 990fb5b0 dc786207' '4fdcb8ee d2000000 004a4930 46022100 cb02fb5a 910e7554 85e3578e 6e9be315' 'a161540a 73f84ee6 f5d68641 925c59ac 0221007e 530a1826 30b50e2c 12dd09cd' 'ebfd809f 038be982 bdc2c7e9 d4cbf634 9e088d01 ffffffff 0200ca9a 3b000000' '001976a9 14cb2abd e8bccacc 32e893df 3a054b9e f7f227a4 ce88ac00 286bee00' '00000019 76a914ee 26c56fc1 d942be8d 7a24b2a1 001dd894 69398088 ac000000' '00' ).replace(' ',''))) tx2Fake = PyTx().unserialize(hex_to_binary( ( '01000000 01a5b837 da38b64a 6297862c ba8210d0 21ac59e1 2b7c6d7e 70c355f6' '972ee7a8 6e010000 008c4930 46022100 89e47100 d88d5f8c 8f62a796 dac3afb8' 'f090c6fc 2eb0c4af ac7b7567 3a364c01 0221002b f40e554d ae51264b 0a86df17' '3e45756a 89bbd302 4f166cc4 2cfd1874 13636901 41046868 0737c76d abb801cb' '2204f57d be4e4579 e4f710cd 67dc1b42 27592c81 e9b5cf02 b5ac9e8b 4c9f49be' '5251056b 6a6d011e 4c37f6b6 d17ede6b 55faa235 19e2ffff ffff0100 286bee00' '00000019 76a914c5 22664fb0 e55cdc5c 0cea73b4 aad97ec8 34323288 ac000000' '00' ).replace(' ',''))) ALL_ZERO_OUTPOINT = hex_to_binary('00' * 36) class MSUtilsTest(unittest.TestCase): def setUp(self): self.tx1 = PyTx().unserialize(tx1raw) self.tx2 = PyTx().unserialize(tx2raw) self.tx1hash = hex_to_binary( \ 'aa739836a44451be555f74a02f088b50a867b1d3a2c917ee863d708ec2db58f6', BIGENDIAN) self.tx2hash = hex_to_binary( \ '9072559e9e2772cd6ac88683531a512cba6c2fee82b2476ed5e84c24abe5f526', BIGENDIAN) self.pubKey = hex_to_binary( \ '048d103d81ac9691cf13f3fc94e44968ef67b27f58b27372c13108552d24a6ee04' '785838f34624b294afee83749b64478bb8480c20b242c376e77eea2b3dc48b4b') self.sigStr = hex_to_binary( \ '304602210041e1186ca9a41fdfe1569d5d807ca7ff' '6c5ffd19d2ad1be42f7f2a20cdc8f1cc0221003366b5d64fe81e53910e156914' '091d12646bc0d1d662b7a65ead3ebe4ab8f6c4' + '01') # Specify the target addresses as testnet addrStrs, but the "normalize" # method will convert it to the correct addrStr for mainnet or testnet self.addrStr1 = normalizeAddrStr('mhyjJTq9RsDfhNdjTkga1CKhTiL5VFw85J') self.addrStr2 = normalizeAddrStr('mgoCqfR25kZVApAGFK3Tx5CTNcCppmKwfb') def tearDown(self): pass def testUSTXI_serialize_roundtrip(self): ustxi = UnsignedTxInput(tx1raw, 1, None, self.pubKey) serUSTXI = ustxi.serialize() ustxi2 = UnsignedTxInput().unserialize(serUSTXI) self.assertEqual(serUSTXI, ustxi2.serialize()) def testUSTXI_addSignature(self): # We can check all the signature handling stuff without the private key, # because Tx2 is a full tx with a valid signature. So we can pretende # Tx2 is unsigned, and that we are supplying sigStr as one of (the only) # signature that will be needed to finish the UnsignedTransaction ustxi = UnsignedTxInput(tx1raw, 1, None, self.pubKey) # Try once with provided pub key self.assertTrue(ustxi.verifyTxSignature(self.tx2, self.sigStr, self.pubKey)) # Try the recursive method self.assertTrue(ustxi.verifyTxSignature(self.tx2, self.sigStr)) # Try inserting the signature into USTXI then verify all ustxi.setSignature(0, self.sigStr) self.assertTrue(ustxi.verifyAllSignatures(self.tx2)) # Try a bad signature badSig = self.sigStr[:16] + '\x00'*8 + self.sigStr[24:] self.assertFalse(ustxi.verifyTxSignature(self.tx2, badSig)) def testDTXO(self): a160_1 = addrStr_to_hash160(self.addrStr1)[1] a160_2 = addrStr_to_hash160(self.addrStr2)[1] dtxo1 = DecoratedTxOut(hash160_to_p2pkhash_script(a160_1), long(1.00*ONE_BTC)) dtxo2 = DecoratedTxOut(hash160_to_p2pkhash_script(a160_2), long(0.49*ONE_BTC)) serDTXO1 = dtxo1.serialize() dtxo1_dup = DecoratedTxOut().unserialize(serDTXO1) self.assertEqual(serDTXO1, dtxo1_dup.serialize()) serDTXO2 = dtxo2.serialize() dtxo2_dup = DecoratedTxOut().unserialize(serDTXO2) self.assertEqual(serDTXO2, dtxo2_dup.serialize()) # not a real test """ def testPprintTxInSignStat(self): ustxi = UnsignedTxInput(tx1raw, 1, None, self.pubKey) sigstat = ustxi.evaluateSigningStatus() sigstat.pprint() """ # not a real test def testUnsignedTx(self): ustxi = UnsignedTxInput(tx1raw, 1, None, self.pubKey) a160_1 = addrStr_to_hash160(self.addrStr1)[1] a160_2 = addrStr_to_hash160(self.addrStr2)[1] dtxo1 = DecoratedTxOut(hash160_to_p2pkhash_script(a160_1), long(1.00*ONE_BTC)) dtxo2 = DecoratedTxOut(hash160_to_p2pkhash_script(a160_2), long(0.49*ONE_BTC)) ustx = UnsignedTransaction().createFromUnsignedTxIO([ustxi], [dtxo1,dtxo2]) self.assertEqual(len(ustx.ustxInputs), 1) self.assertEqual(len(ustx.decorTxOuts), 2) self.assertEqual(ustx.lockTime, 0) self.assertEqual(ustx.uniqueIDB58, 'J2mRenD7') serUstx = ustx.serialize() ustx2 = UnsignedTransaction().unserialize(serUstx) self.assertEqual(serUstx, ustx2.serialize()) serUstxASCII = ustx.serializeAscii() ustx2 = UnsignedTransaction().unserializeAscii(serUstxASCII) self.assertEqual(serUstx, ustx2.serialize()) #print '' #print 'Sample TxSigCollect Block:' #print serUstxASCII #ustx.pprint() #print '\n' #ustx.evaluateSigningStatus().pprint() def testAddSigToUSTX(self): ustxi = UnsignedTxInput(tx1raw, 1, None, self.pubKey) a160_1 = addrStr_to_hash160(self.addrStr1)[1] a160_2 = addrStr_to_hash160(self.addrStr2)[1] dtxo1 = DecoratedTxOut(hash160_to_p2pkhash_script(a160_1), long(1.00*ONE_BTC)) dtxo2 = DecoratedTxOut(hash160_to_p2pkhash_script(a160_2), long(0.49*ONE_BTC)) ustx = UnsignedTransaction().createFromUnsignedTxIO([ustxi], [dtxo1,dtxo2]) msIndex = ustx.insertSignatureForInput(0, self.sigStr, self.pubKey) self.assertEqual(msIndex, 0) msIndex = ustx.insertSignatureForInput(0, self.sigStr) self.assertEqual(msIndex, 0) badSig = self.sigStr[:16] + '\x00'*8 + self.sigStr[24:] msIndex = ustx.insertSignatureForInput(0, badSig) self.assertEqual(msIndex, -1) def testCreateMultisigTests(self): ''' This is used solely to generate some multi-sig scripts, using known public/private keys, that we can then use to test signing, etc. This test doesn't actually test anything, but could be tweaked and then reenabled to produce new data for new tests ''' asc_nosig = textwrap.dedent(""" =====TXSIGCOLLECT-5JxmLy4T====================================================== AQAAAAsRCQcAAAAAAf19AQEAAAALEQkH/XsoFKgwJMVZsviXpv+aOun4BQHRm+Cuvs/X7O/J3n8BAAAA /QMBAQAAAAGcgxlJ0d+ZHi+MzG+laL4qTx/jVH/lPbbKmrGLA1oc8AAAAACMSTBGAiEArOklwdcihg72 fMu+GvnKF+AdFiMmeT7CWV4KMZmA3kcCIQDyjBMqkI6tFVXMG/yhbBhVg7TNYsAGLjM5UWLfVx57WgFB BLmTMVBhjWo901GrcZzZMNBUectdX4ZsVyHhMNjZpaAJxlpQqnjiK9PAvrNqOIgMq8itz9S3KDaOs/Kh W6/lJNL/////AsAOFgIAAAAAGXapFInbjSGPxqYLm35NTXhzcAkVf8h8iKwwq98DAAAAABl2qRSBj0Gs NlhCyvZkoRO2iRw54544foisAAAAAAAA/////wFBBJ6i78WXHp6ywhTupFpF7A0V2jwQEjE9pWO1+7wZ qS+IM59Dur1Ut5OC+yUycjeFHQdqemkBDFT97zMCJalmtXwAAALiAQAAAAsRCQfJUkEEagSrmNnkd0rY BuMC3d62O+oWtctfIj7ndHjoYbtYPrM2tvvLYLWz1PFVGsReX/xJNkZufZj2x8Dsc2U590aRpkEEaGgH N8dtq7gByyIE9X2+TkV55PcQzWfcG0InWSyB6bXPArWsnotMn0m+UlEFa2ptAR5MN/a20X7ea1X6ojUZ 4kEEuVwknYT0F+PjlaEnQlQotUBnHMFYgeuCjBe3IqU/xZniHKXlbJDzQJiNOTOsx2vrgy/WTKsHjd88 5zKSMDHRqFOuoH+IAgAAAAAAAAROT05FADIBAAAACxEJBxl2qRRs7kd5CHIvdApqfOmMDp1dyrD6Mois gARXAQAAAAAAAAROT05FAA== ================================================================================ """.strip()) asc_sig = textwrap.dedent(""" =====TXSIGCOLLECT-5JxmLy4T====================================================== AQAAAAsRCQcAAAAAAf3EAQEAAAALEQkH/XsoFKgwJMVZsviXpv+aOun4BQHRm+Cuvs/X7O/J3n8BAAAA /QMBAQAAAAGcgxlJ0d+ZHi+MzG+laL4qTx/jVH/lPbbKmrGLA1oc8AAAAACMSTBGAiEArOklwdcihg72 fMu+GvnKF+AdFiMmeT7CWV4KMZmA3kcCIQDyjBMqkI6tFVXMG/yhbBhVg7TNYsAGLjM5UWLfVx57WgFB BLmTMVBhjWo901GrcZzZMNBUectdX4ZsVyHhMNjZpaAJxlpQqnjiK9PAvrNqOIgMq8itz9S3KDaOs/Kh W6/lJNL/////AsAOFgIAAAAAGXapFInbjSGPxqYLm35NTXhzcAkVf8h8iKwwq98DAAAAABl2qRSBj0Gs NlhCyvZkoRO2iRw54544foisAAAAAAAA/////wFBBJ6i78WXHp6ywhTupFpF7A0V2jwQEjE9pWO1+7wZ qS+IM59Dur1Ut5OC+yUycjeFHQdqemkBDFT97zMCJalmtXxHMEQCIF12j4Vj1Shf49BkDWwVzf1kRgYr 4EIPObgRTVPQz2KkAiAQ28gOniv2A5ozeBCk/rpWHTw2DqqkraEUDYLAPr83NQEAAuIBAAAACxEJB8lS QQRqBKuY2eR3StgG4wLd3rY76ha1y18iPud0eOhhu1g+sza2+8tgtbPU8VUaxF5f/Ek2Rm59mPbHwOxz ZTn3RpGmQQRoaAc3x22ruAHLIgT1fb5ORXnk9xDNZ9wbQidZLIHptc8Ctayei0yfSb5SUQVram0BHkw3 9rbRft5rVfqiNRniQQS5XCSdhPQX4+OVoSdCVCi1QGccwViB64KMF7cipT/FmeIcpeVskPNAmI05M6zH a+uDL9ZMqweN3zznMpIwMdGoU66gf4gCAAAAAAAABE5PTkUAMgEAAAALEQkHGXapFGzuR3kIci90Cmp8 6YwOnV3KsPoyiKyABFcBAAAAAAAABE5PTkUA ================================================================================ """.strip()) # For this manual construction to work, I had to save the signed funding # transaction signedFundMS = hex_to_binary( \ '0100000001fd7b2814a83024c559b2f897a6ff9a3ae9f80501d19be0aebecfd7' 'ecefc9de7f010000008a47304402205d768f8563d5285fe3d0640d6c15cdfd64' '46062be0420f39b8114d53d0cf62a4022010dbc80e9e2bf6039a337810a4feba' '561d3c360eaaa4ada1140d82c03ebf37350141049ea2efc5971e9eb2c214eea4' '5a45ec0d15da3c1012313da563b5fbbc19a92f88339f43babd54b79382fb2532' '7237851d076a7a69010c54fdef330225a966b57cffffffff02a07f8802000000' '00c95241046a04ab98d9e4774ad806e302dddeb63bea16b5cb5f223ee77478e8' '61bb583eb336b6fbcb60b5b3d4f1551ac45e5ffc4936466e7d98f6c7c0ec7365' '39f74691a6410468680737c76dabb801cb2204f57dbe4e4579e4f710cd67dc1b' '4227592c81e9b5cf02b5ac9e8b4c9f49be5251056b6a6d011e4c37f6b6d17ede' '6b55faa23519e24104b95c249d84f417e3e395a127425428b540671cc15881eb' '828c17b722a53fc599e21ca5e56c90f340988d3933acc76beb832fd64cab078d' 'df3ce732923031d1a853ae80045701000000001976a9146cee477908722f740a' '6a7ce98c0e9d5dcab0fa3288ac00000000') #UnsignedTransaction().unserializeAscii(asc_nosig).evaluateSigningStatus().pprint() #UnsignedTransaction().unserializeAscii(asc_sig).evaluateSigningStatus().pprint() privKeys = [SecureBinaryData(a*32) for a in ['\xaa','\xbb','\xcc']] pubKeys = [CryptoECDSA().ComputePublicKey(prv) for prv in privKeys] pubStrs = [pubk.toBinStr() for pubk in pubKeys] #for i,prv in enumerate(privKeys): #print 'PrivKey %d:', prv.toHexStr() msScript = pubkeylist_to_multisig_script(pubStrs, 2) msScriptReverse = pubkeylist_to_multisig_script(pubStrs[::-1], 2) self.assertEqual(msScript, msScriptReverse) #for opStr in convertScriptToOpStrings(msScript): #print ' ', opStr dtxo = DecoratedTxOut(msScript, 1.0*ONE_BTC) ustxi = UnsignedTxInput(signedFundMS, 0) #ustxi.pprint() refund1 = addrStr_to_scrAddr(normalizeAddrStr('mqSvihZRtKt1J3EBbwBJSHeAYVjdxUnpvf')) refund2 = addrStr_to_scrAddr(normalizeAddrStr('mjAauu6jzmYaE7jrfFgKqLxtvpStmPxcb7')) dtxo1 = DecoratedTxOut(scrAddr_to_script(refund1), long(0.223*ONE_BTC)) dtxo2 = DecoratedTxOut(scrAddr_to_script(refund2), long(0.200*ONE_BTC)) ustx = UnsignedTransaction().createFromUnsignedTxIO([ustxi], [dtxo1, dtxo2]) #ustx.pprint() #ustx.evaluateSigningStatus().pprint() # Need a candidate tx to test signing txObj = ustx.pytxObj # Test signing on the individual USTXI NOSIG = TXIN_SIGSTAT.NO_SIGNATURE SIG = TXIN_SIGSTAT.ALREADY_SIGNED for i in [0,1]: for j in [0,1]: for k in [0,1]: ustxiCopy = UnsignedTxInput().unserialize(ustxi.serialize()) if i>0: ustxiCopy.createAndInsertSignature(txObj, privKeys[0]) if j>0: ustxiCopy.createAndInsertSignature(txObj, privKeys[1]) if k>0: ustxiCopy.createAndInsertSignature(txObj, privKeys[2]) sstat = ustxiCopy.evaluateSigningStatus() #sstat.pprint() self.assertEqual(sstat.allSigned, (i+j+k)>1) self.assertEqual(sstat.statusM[0], NOSIG if i+j+k==0 else SIG) self.assertEqual(sstat.statusM[1], NOSIG if i+j+k<2 else SIG) # Now try all this on the full USTX (not just the input for i in [0,1]: for j in [0,1]: for k in [0,1]: ustxCopy = UnsignedTransaction().unserialize(ustx.serialize()) if i>0: ustxCopy.createAndInsertSignatureForInput(0, privKeys[0]) if j>0: ustxCopy.createAndInsertSignatureForInput(0, privKeys[1]) if k>0: ustxCopy.createAndInsertSignatureForInput(0, privKeys[2]) sstat = ustxCopy.evaluateSigningStatus() #sstat.pprint() self.assertEqual(sstat.canBroadcast, (i+j+k)>1) #self.assertEqual(sstat.statusM[0], NOSIG if i+j+k==0 else SIG) #self.assertEqual(sstat.statusM[1], NOSIG if i+j+k<2 else SIG) # Now actually sign it and dump out a raw signed tx! ustx.createAndInsertSignatureForInput(0, privKeys[0]) ustx.createAndInsertSignatureForInput(0, privKeys[2]) #print ustx.serializeAscii() #print binary_to_hex(ustx.getPyTxSignedIfPossible().serialize()) ################################################################################ # This class tests all Round Trip operations, plus other tests that involve # Lockbox Related Objects # There are 6 objects that are tested for at least round trip operations # Decorated Public Key # Lockbox # Promisory Note # Unsigned Transaction # Unsigned Transaction Input # Decorated Transaction Output class LockboxRelatedObjectsTest(unittest.TestCase): @classmethod def setUpClass(self): global serMap # We have 6 classes to test, but USTXI and DTXO can use the USTX data serMap = {} serMap['dpk'] = {} serMap['lockbox'] = {} serMap['promnote'] = {} serMap['ustx'] = {} serMap['dpk']['nocomment'] = textwrap.dedent(""" =====PUBLICKEY-mqQQMsTsUyGJ===================================================== AQAAAAsRCQdBBPXISLf5jl7LafjFYbMVfb+OqjzMD8XGVyBauZ1kNA/tMGoZn5lHdfZRVcNN8D9+9vG9 GpvTn9PUWZ1uETTewPIAAAAA ================================================================================ """.strip()) serMap['dpk']['wcomment'] = textwrap.dedent(""" =====PUBLICKEY-mqjMCZC4BFRm===================================================== AQAAAAsRCQdBBCMhT2Hr0mjRkNu+VR+JFRczrwE+E+Fbzd5l/XNCHJC6i62liVEVRnasthYQCjiFsv2y Yw9HN6LxwO6+eQeBKQEcdGhpcyBpcyBhIHVzZWxlc3MgY29tbWVudCFAIQAAAA== ================================================================================ """.strip()) serMap['lockbox']['nocomments'] = textwrap.dedent(""" =====LOCKBOX-7mtvkCTa=========================================================== AQAAAAsRCQclhKNTAAAAAAtTYW1wbGUgMm9mMwACA04BAAAACxEJB0EEIyFPYevSaNGQ275VH4kVFzOv AT4T4VvN3mX9c0IckLqLraWJURVGdqy2FhAKOIWy/bJjD0c3ovHA7r55B4EpAQAAAABOAQAAAAsRCQdB BMWU5+Df9QeQfI0i+TRNXiImnOGzoIAyVGKhEpa20uN95t7eEN+gOaippJmGbFxQew0C1LTqlUn4C4oa NIwDkroAAAAATgEAAAALEQkHQQTOFdjRK/2+hr00V4iRFlzDXMS0Ll3fT+qJ9YSH519IUTsIvhQenODR MReXXbfJmcCxUPg3N2TQvLX7iI2GRo2jAAAAAA== ================================================================================ """.strip()) serMap['lockbox']['nometadata'] = textwrap.dedent(""" =====LOCKBOX-7mtvkCTa=========================================================== AQAAAAsRCQclhKNTAAAAAAtTYW1wbGUgMm9mMwACA2ABAAAACxEJB0EEIyFPYevSaNGQ275VH4kVFzOv AT4T4VvN3mX9c0IckLqLraWJURVGdqy2FhAKOIWy/bJjD0c3ovHA7r55B4EpARJLZXkgIzEgaW4gdGhl IGxpc3QAAABWAQAAAAsRCQdBBMWU5+Df9QeQfI0i+TRNXiImnOGzoIAyVGKhEpa20uN95t7eEN+gOaip pJmGbFxQew0C1LTqlUn4C4oaNIwDkroIS2V5ICMyISAAAABkAQAAAAsRCQdBBM4V2NEr/b6GvTRXiJEW XMNcxLQuXd9P6on1hIfnX0hROwi+FB6c4NExF5ddt8mZwLFQ+Dc3ZNC8tfuIjYZGjaMWS2V5IHdpdGgg dW5pY29kZSBkYXRhIQAAAA== ================================================================================ """.strip()) serMap['promnote']['regular'] = textwrap.dedent(""" =====PROMISSORY-CerrVYjD======================================================== AQAAAAsRCQcyAQAAAAsRCQcXqRSRUUn/7EjvozN4YtftMtBnm438H4ew1owAAAAAAAAABE5PTkUAAAA0 AQAAAAsRCQcZdqkU3GEOtRTZmvGtO/RAN/POah+meRyIrEDvBwAAAAAAAAAETk9ORQAAABAnAAAAAAAA A/2DAQEAAAALEQkH0yTdj/1epai7+ozi6P+QAGb7SC7heN8KKd7MXaylqCEBAAAA/QABAQAAAAFzi65S WdroLD8dGjAFjvQhDnaRFW1HDwU0AiSXxKxPuQEAAACLSDBFAiEAkbFWoFx5lKs+Q0OY3TL3lo1ckIei ZOPWB0giLsMvrP0CICJ26+e5IB8l20Luaj2+zxWCu7bxYpyFqB8AaPXBaB7/AUEEIyFPYevSaNGQ275V H4kVFzOvAT4T4VvN3mX9c0IckLqLraWJURVGdqy2FhAKOIWy/bJjD0c3ovHA7r55B4EpAf////8CQEtM AAAAAAAXqRTlgY0MJP3lDak826GfCJM965UHXIcwJEwAAAAAABl2qRRdhR54M5b6KlxBD4fX4V7mP5EO KoisAAAAAAAIQ2VyclZZakQA/////wFBBPz7sT4Gd75jvfE+EDKrJaGVHgY2RhCwpxm+tbM13+4gfLGE IA7JYx15z4YUoMuKNiCpVNeQXjWTpwkJC1Exu+EAAP21BAEAAAALEQkH0EsZt7ZdeY8SUHZ0rIL0ABXx Hg1nH9Mm9D9Zo0ZM1xEAAAAA/TIEAQAAAAEJ8zsWPm4lSEu10eHw6DeLOienJjmDq97CqfnsyZMHNAEA AAD92wMASTBGAiEA5hmqIWXzmymsvmcCs5eT6T8r1Ot0Az1mXDRiI4wNE/ICIQCqCvWQirOgV3jTLpR0 DKNc8D3R1mxctkd+3lmHMbOtkQFJMEYCIQDmGaohZfObKay+ZwKzl5PpPyvU63QDPWZcNGIjjA0T8gIh AKoK9ZCKs6BXeNMulHQMo1zwPdHWbFy2R37eWYcxs62RAUkwRgIhAOYZqiFl85sprL5nArOXk+k/K9Tr dAM9Zlw0YiOMDRPyAiEAqgr1kIqzoFd40y6UdAyjXPA90dZsXLZHft5ZhzGzrZEBSTBGAiEA5hmqIWXz mymsvmcCs5eT6T8r1Ot0Az1mXDRiI4wNE/ICIQCqCvWQirOgV3jTLpR0DKNc8D3R1mxctkd+3lmHMbOt kQFJMEYCIQDmGaohZfObKay+ZwKzl5PpPyvU63QDPWZcNGIjjA0T8gIhAKoK9ZCKs6BXeNMulHQMo1zw PdHWbFy2R37eWYcxs62RAUkwRgIhAOYZqiFl85sprL5nArOXk+k/K9TrdAM9Zlw0YiOMDRPyAiEAqgr1 kIqzoFd40y6UdAyjXPA90dZsXLZHft5ZhzGzrZEBSTBGAiEA5hmqIWXzmymsvmcCs5eT6T8r1Ot0Az1m XDRiI4wNE/ICIQCqCvWQirOgV3jTLpR0DKNc8D3R1mxctkd+3lmHMbOtkQFN0QFXQQTvJ9REU6uNF9tq kmOWOaSme3wv+2pdNjQvonQMceMVLx8UVLu/R8TMYLxIX/SO7Hsd6QM9dxozXVK80Hajp29LQQTvJ9RE U6uNF9tqkmOWOaSme3wv+2pdNjQvonQMceMVLx8UVLu/R8TMYLxIX/SO7Hsd6QM9dxozXVK80Hajp29L QQTvJ9REU6uNF9tqkmOWOaSme3wv+2pdNjQvonQMceMVLx8UVLu/R8TMYLxIX/SO7Hsd6QM9dxozXVK8 0Hajp29LQQTvJ9REU6uNF9tqkmOWOaSme3wv+2pdNjQvonQMceMVLx8UVLu/R8TMYLxIX/SO7Hsd6QM9 dxozXVK80Hajp29LQQTvJ9REU6uNF9tqkmOWOaSme3wv+2pdNjQvonQMceMVLx8UVLu/R8TMYLxIX/SO 7Hsd6QM9dxozXVK80Hajp29LQQTvJ9REU6uNF9tqkmOWOaSme3wv+2pdNjQvonQMceMVLx8UVLu/R8TM YLxIX/SO7Hsd6QM9dxozXVK80Hajp29LQQTvJ9REU6uNF9tqkmOWOaSme3wv+2pdNjQvonQMceMVLx8U VLu/R8TMYLxIX/SO7Hsd6QM9dxozXVK80Hajp29LV67/////AbCfLQAAAAAAGXapFCwDJu3M0e/OzPv8 yTMMgkKohccUiKwAAAAAAAhDZXJyVllqRAD/////AUEE7yfURFOrjRfbapJjljmkpnt8L/tqXTY0L6J0 DHHjFS8fFFS7v0fEzGC8SF/0jux7HekDPXcaM11SvNB2o6dvSwAA/VoCAQAAAAsRCQcRyZHa7iCRLwdD H0oHdiOvbDVj5cDoexX5HK0fFh8RvAIAAAD91wEBAAAAAqSzhO8p2UlTYZbBtnV3nyrqrfShMZfzDpId Lcm6AQPzAQAAAItIMEUCIQCREoEDVTRz2WqLHbLnDYKpTUhgufQ7je76GxYCyppdGAIgHEhwzPsLCdra LY/mBMqotfTE6SPowHeo6LFuH9GYX00BQQRWZgMKp8HBmppMCu35YERTSJSu4EO99s/RQ3+jtZINL8XO 1XY1S8UM7/ajjM6Wv3g45bGjATcKtGwqhAlIWl1e/////yvlXmEhjTLSBnhishefOy0RldxN3AlytJ2V YlYq1inMAQAAAIxJMEYCIQDqUpfjjR1xuMh2/7cXzSh7cZXOBM0IxpKEaSrXDKvdEgIhAKwM/OsjuRcg q6KXyZ0swmVx8o/dGgbCPYCkj2ZI4wweAUEEzhXY0Sv9voa9NFeIkRZcw1zEtC5d30/qifWEh+dfSFE7 CL4UHpzg0TEXl123yZnAsVD4Nzdk0Ly1+4iNhkaNo/////8DQIr3AQAAAAAXqRSRUUn/7EjvozN4Ytft MtBnm438H4fArNgAAAAAABl2qRSfOjzmZuGGa8CNGDprHfriVETn2IisICkbAAAAAAAZdqkUbZs27Nt1 uzK2C61o8v2KMbWTJx6IrAAAAAAACENlcnJWWWpEAP////8BQQQh3dwX9khXeseuKzuXX0cmoa9HgQMd O22XmvHKWXTL3Yt+UaCYx0woedfoKo4phLQomWMFXRZoUPSAJx2dpSh2AAAfVGhpcyBpcyBhbm90aGVy IHRlc3RpbmcgY29tbWVudAA= ================================================================================ """.strip()) serMap['promnote']['regular'] = textwrap.dedent(""" =====PROMISSORY-GVfKYBqK======================================================== AQAAAAsRCQcyAQAAAAsRCQcXqRSUFt7Fp83rejuvC6FPeHUyzH6RQodQNHQCAAAAAAAABE5PTkUAAAAA AAAAAAAAAAAB/YMBAQAAAAsRCQdKjCQZ04S5mekJ7FSvGyohppsRllgQ1lF0D/ewX9Ls6AAAAAD9AAEB AAAAATS/9KXacFYJPYQCoSkRSIKYDIIgQ6wZzEdgiipEAVbuAAAAAItIMEUCIE9MTdfNrRrMW8BFe8uC N34DMz3wYa+KL6bPkxNpgDUnAiEAnfZxXXfhAdF435vRb1kWxg65NbMAHfbX/bDh9iXQNKYBQQRBul/I mA3bgs0PGSJFd3KeQPBPp9LYuduFgnfA+kEKf1GZI4s+EGuxDHvjZoNBwYvWPEgtqYVxvybEXWHwhhou /////wJQNHQCAAAAABl2qRSSFcygbZulF1EFISvxCYhFoLBf44isAC0xAQAAAAAXqRSUFt7Fp83rejuv C6FPeHUyzH6RQocAAAAAAAhHVmZLWUJxSwD/////AUEEBgLRFKodcJB0fSX3gNeaAM7uNQNM/tL8RcBZ 4+5P1i6RbjURO9yt34sF0flB8XbiR/T/cUqkn66p/S/Ww3FKEwAAJkR1bXBpbmcgYWxsIG15IGNhc2gg aW50byB0aGlzIGRvbmF0aW9uAA== ================================================================================ """.strip()) # These will be used for all USTX, USTXI and DTXO serMap['ustx']['regular'] = textwrap.dedent(""" =====TXSIGCOLLECT-8rgLHcFg====================================================== AQAAAAsRCQcAAAAAAv3EAQEAAAALEQkHc4uuUlna6Cw/HRowBY70IQ52kRVtRw8FNAIkl8SsT7kBAAAA /QIBAQAAAAEXA5J+qKVnY8IE4dDBE58Pyp+q1uA/RBkeol1FLLoZFQAAAACLSDBFAiEA0dB7emFmICZD NecZeg7eRzjjOKTmg+EZLXca14dg1uYCIBDnAgPWPSMmwaK5ZWpTeCuhn86qDh1KyP87cglKYhWdAUEE UtPQusiUYHM/ECQT0yg2oqwdYUsUmer4RyxxD0lxRei8AceGdrnDC5uL/Y6kzW3rQxynEVXBGJI01Qkk 1frDLP////8CMBsPAAAAAAAZdqkUOW5GJnPKcmK1r9T5oiPKqWm0HSGIrICWmAAAAAAAGXapFHAJXqNd 6fuLln4Tkl6tDx7sbO/giKwAAAAAAAAA/////wFBBCMhT2Hr0mjRkNu+VR+JFRczrwE+E+Fbzd5l/XNC HJC6i62liVEVRnasthYQCjiFsv2yYw9HN6LxwO6+eQeBKQFHMEQCIFlfw+VSIaBS6vDXbs093+fNaFJb 3GidWizy+UUAhHXZAiAXwqBQPrg2zXMo/VOkEpKlHAHccv2/laZJdwRCE+BnAgEA/ZoCAQAAAAsRCQcR yZHa7iCRLwdDH0oHdiOvbDVj5cDoexX5HK0fFh8RvAIAAAD91wEBAAAAAqSzhO8p2UlTYZbBtnV3nyrq rfShMZfzDpIdLcm6AQPzAQAAAItIMEUCIQCREoEDVTRz2WqLHbLnDYKpTUhgufQ7je76GxYCyppdGAIg HEhwzPsLCdraLY/mBMqotfTE6SPowHeo6LFuH9GYX00BQQRWZgMKp8HBmppMCu35YERTSJSu4EO99s/R Q3+jtZINL8XO1XY1S8UM7/ajjM6Wv3g45bGjATcKtGwqhAlIWl1e/////yvlXmEhjTLSBnhishefOy0R ldxN3AlytJ2VYlYq1inMAQAAAIxJMEYCIQDqUpfjjR1xuMh2/7cXzSh7cZXOBM0IxpKEaSrXDKvdEgIh AKwM/OsjuRcgq6KXyZ0swmVx8o/dGgbCPYCkj2ZI4wweAUEEzhXY0Sv9voa9NFeIkRZcw1zEtC5d30/q ifWEh+dfSFE7CL4UHpzg0TEXl123yZnAsVD4Nzdk0Ly1+4iNhkaNo/////8DQIr3AQAAAAAXqRSRUUn/ 7EjvozN4YtftMtBnm438H4fArNgAAAAAABl2qRSfOjzmZuGGa8CNGDprHfriVETn2IisICkbAAAAAAAZ dqkUbZs27Nt1uzK2C61o8v2KMbWTJx6IrAAAAAAAAAD/////AUEEId3cF/ZIV3rHris7l19HJqGvR4ED HTttl5rxyll0y92LflGgmMdMKHnX6CqOKYS0KJljBV0WaFD0gCcdnaUodkgwRQIgI0xQLY+qnQKi8f65 5OEAPEv/r0rZnLB/h7qd5LF6hm8CIQCOPpmt1Jr6o1b43VEYg0PNKYzRekLppI3gpVFh0zlM2AEAAjQB AAAACxEJBxl2qRQWtJ1IcK7dFugwnF1pwaCGOsMI1oisgJaYAAAAAAAAAAROT05FAAAANAEAAAALEQkH GXapFFwtg57h8JGhIbsJLXk23+KqzOo9iKwQAhsAAAAAAAAABE5PTkUAAAA= ================================================================================ """.strip()) serMap['ustx']['multispend_unsigned'] = textwrap.dedent(""" =====TXSIGCOLLECT-7oXWAFds====================================================== AQAAAAsRCQcAAAAAAf3UAgEAAAALEQkHSowkGdOEuZnpCexUrxsqIaabEZZYENZRdA/3sF/S7OgBAAAA /QABAQAAAAE0v/Sl2nBWCT2EAqEpEUiCmAyCIEOsGcxHYIoqRAFW7gAAAACLSDBFAiBPTE3Xza0azFvA RXvLgjd+AzM98GGvii+mz5MTaYA1JwIhAJ32cV134QHReN+b0W9ZFsYOuTWzAB321/2w4fYl0DSmAUEE QbpfyJgN24LNDxkiRXdynkDwT6fS2LnbhYJ3wPpBCn9RmSOLPhBrsQx742aDQcGL1jxILamFcb8mxF1h 8IYaLv////8CUDR0AgAAAAAZdqkUkhXMoG2bpRdRBSEr8QmIRaCwX+OIrAAtMQEAAAAAF6kUlBbexafN 63o7rwuhT3h1Msx+kUKHAAAAAMlSQQQjIU9h69Jo0ZDbvlUfiRUXM68BPhPhW83eZf1zQhyQuoutpYlR FUZ2rLYWEAo4hbL9smMPRzei8cDuvnkHgSkBQQTFlOfg3/UHkHyNIvk0TV4iJpzhs6CAMlRioRKWttLj febe3hDfoDmoqaSZhmxcUHsNAtS06pVJ+AuKGjSMA5K6QQTOFdjRK/2+hr00V4iRFlzDXMS0Ll3fT+qJ 9YSH519IUTsIvhQenODRMReXXbfJmcCxUPg3N2TQvLX7iI2GRo2jU64IN210dmtDVGEA/////wNBBCMh T2Hr0mjRkNu+VR+JFRczrwE+E+Fbzd5l/XNCHJC6i62liVEVRnasthYQCjiFsv2yYw9HN6LxwO6+eQeB KQEAAEEExZTn4N/1B5B8jSL5NE1eIiac4bOggDJUYqESlrbS433m3t4Q36A5qKmkmYZsXFB7DQLUtOqV SfgLiho0jAOSugAAQQTOFdjRK/2+hr00V4iRFlzDXMS0Ll3fT+qJ9YSH519IUTsIvhQenODRMReXXbfJ mcCxUPg3N2TQvLX7iI2GRo2jAAACNAEAAAALEQkHGXapFCd8VsRZVBUqMoQpIAAPglG9VyAiiKxwb5gA AAAAAAAABE5PTkUAAAAyAQAAAAsRCQcXqRSUFt7Fp83rejuvC6FPeHUyzH6RQoeAlpgAAAAAAAAABE5P TkUAAAA= ================================================================================ """.strip()) serMap['ustx']['multispend_partsign'] = textwrap.dedent(""" =====TXSIGCOLLECT-7oXWAFds====================================================== AQAAAAsRCQcAAAAAAf0bAwEAAAALEQkHSowkGdOEuZnpCexUrxsqIaabEZZYENZRdA/3sF/S7OgBAAAA /QABAQAAAAE0v/Sl2nBWCT2EAqEpEUiCmAyCIEOsGcxHYIoqRAFW7gAAAACLSDBFAiBPTE3Xza0azFvA RXvLgjd+AzM98GGvii+mz5MTaYA1JwIhAJ32cV134QHReN+b0W9ZFsYOuTWzAB321/2w4fYl0DSmAUEE QbpfyJgN24LNDxkiRXdynkDwT6fS2LnbhYJ3wPpBCn9RmSOLPhBrsQx742aDQcGL1jxILamFcb8mxF1h 8IYaLv////8CUDR0AgAAAAAZdqkUkhXMoG2bpRdRBSEr8QmIRaCwX+OIrAAtMQEAAAAAF6kUlBbexafN 63o7rwuhT3h1Msx+kUKHAAAAAMlSQQQjIU9h69Jo0ZDbvlUfiRUXM68BPhPhW83eZf1zQhyQuoutpYlR FUZ2rLYWEAo4hbL9smMPRzei8cDuvnkHgSkBQQTFlOfg3/UHkHyNIvk0TV4iJpzhs6CAMlRioRKWttLj febe3hDfoDmoqaSZhmxcUHsNAtS06pVJ+AuKGjSMA5K6QQTOFdjRK/2+hr00V4iRFlzDXMS0Ll3fT+qJ 9YSH519IUTsIvhQenODRMReXXbfJmcCxUPg3N2TQvLX7iI2GRo2jU64IN210dmtDVGEA/////wNBBCMh T2Hr0mjRkNu+VR+JFRczrwE+E+Fbzd5l/XNCHJC6i62liVEVRnasthYQCjiFsv2yYw9HN6LxwO6+eQeB KQEAAEEExZTn4N/1B5B8jSL5NE1eIiac4bOggDJUYqESlrbS433m3t4Q36A5qKmkmYZsXFB7DQLUtOqV SfgLiho0jAOSukcwRAIgK0UqQSZCBtaE6vQIQzd2cux7lCYz5F9WOsStmXuAy/4CIBogV6OLRM/W8Ia4 nc8m+JpnnQgVh+/LtO8OaNW4ev8+AQBBBM4V2NEr/b6GvTRXiJEWXMNcxLQuXd9P6on1hIfnX0hROwi+ FB6c4NExF5ddt8mZwLFQ+Dc3ZNC8tfuIjYZGjaMAAAI0AQAAAAsRCQcZdqkUJ3xWxFlUFSoyhCkgAA+C Ub1XICKIrHBvmAAAAAAAAAAETk9ORQAAADIBAAAACxEJBxepFJQW3sWnzet6O68LoU94dTLMfpFCh4CW mAAAAAAAAAAETk9ORQAAAA== ================================================================================ """.strip()) serMap['ustx']['multispend_enoughsign'] = textwrap.dedent(""" =====TXSIGCOLLECT-7oXWAFds====================================================== AQAAAAsRCQcAAAAAAf1jAwEAAAALEQkHSowkGdOEuZnpCexUrxsqIaabEZZYENZRdA/3sF/S7OgBAAAA /QABAQAAAAE0v/Sl2nBWCT2EAqEpEUiCmAyCIEOsGcxHYIoqRAFW7gAAAACLSDBFAiBPTE3Xza0azFvA RXvLgjd+AzM98GGvii+mz5MTaYA1JwIhAJ32cV134QHReN+b0W9ZFsYOuTWzAB321/2w4fYl0DSmAUEE QbpfyJgN24LNDxkiRXdynkDwT6fS2LnbhYJ3wPpBCn9RmSOLPhBrsQx742aDQcGL1jxILamFcb8mxF1h 8IYaLv////8CUDR0AgAAAAAZdqkUkhXMoG2bpRdRBSEr8QmIRaCwX+OIrAAtMQEAAAAAF6kUlBbexafN 63o7rwuhT3h1Msx+kUKHAAAAAMlSQQQjIU9h69Jo0ZDbvlUfiRUXM68BPhPhW83eZf1zQhyQuoutpYlR FUZ2rLYWEAo4hbL9smMPRzei8cDuvnkHgSkBQQTFlOfg3/UHkHyNIvk0TV4iJpzhs6CAMlRioRKWttLj febe3hDfoDmoqaSZhmxcUHsNAtS06pVJ+AuKGjSMA5K6QQTOFdjRK/2+hr00V4iRFlzDXMS0Ll3fT+qJ 9YSH519IUTsIvhQenODRMReXXbfJmcCxUPg3N2TQvLX7iI2GRo2jU64IN210dmtDVGEA/////wNBBCMh T2Hr0mjRkNu+VR+JFRczrwE+E+Fbzd5l/XNCHJC6i62liVEVRnasthYQCjiFsv2yYw9HN6LxwO6+eQeB KQEAAEEExZTn4N/1B5B8jSL5NE1eIiac4bOggDJUYqESlrbS433m3t4Q36A5qKmkmYZsXFB7DQLUtOqV SfgLiho0jAOSukcwRAIgK0UqQSZCBtaE6vQIQzd2cux7lCYz5F9WOsStmXuAy/4CIBogV6OLRM/W8Ia4 nc8m+JpnnQgVh+/LtO8OaNW4ev8+AQBBBM4V2NEr/b6GvTRXiJEWXMNcxLQuXd9P6on1hIfnX0hROwi+ FB6c4NExF5ddt8mZwLFQ+Dc3ZNC8tfuIjYZGjaNIMEUCIQC5OkpGv/UnK/ih2GiUf9zHhBeJjYJG7YVM ZvaRfXiZTgIgPsSob1XTyyX6i4HrKut4N+BjCQIoFT2xjFxwzXPcxGgBAAI0AQAAAAsRCQcZdqkUJ3xW xFlUFSoyhCkgAA+CUb1XICKIrHBvmAAAAAAAAAAETk9ORQAAADIBAAAACxEJBxepFJQW3sWnzet6O68L oU94dTLMfpFCh4CWmAAAAAAAAAAETk9ORQAAAA== ================================================================================ """.strip()) serMap['ustx']['multispend_oversign'] = textwrap.dedent(""" =====TXSIGCOLLECT-7oXWAFds====================================================== AQAAAAsRCQcAAAAAAf2rAwEAAAALEQkHSowkGdOEuZnpCexUrxsqIaabEZZYENZRdA/3sF/S7OgBAAAA /QABAQAAAAE0v/Sl2nBWCT2EAqEpEUiCmAyCIEOsGcxHYIoqRAFW7gAAAACLSDBFAiBPTE3Xza0azFvA RXvLgjd+AzM98GGvii+mz5MTaYA1JwIhAJ32cV134QHReN+b0W9ZFsYOuTWzAB321/2w4fYl0DSmAUEE QbpfyJgN24LNDxkiRXdynkDwT6fS2LnbhYJ3wPpBCn9RmSOLPhBrsQx742aDQcGL1jxILamFcb8mxF1h 8IYaLv////8CUDR0AgAAAAAZdqkUkhXMoG2bpRdRBSEr8QmIRaCwX+OIrAAtMQEAAAAAF6kUlBbexafN 63o7rwuhT3h1Msx+kUKHAAAAAMlSQQQjIU9h69Jo0ZDbvlUfiRUXM68BPhPhW83eZf1zQhyQuoutpYlR FUZ2rLYWEAo4hbL9smMPRzei8cDuvnkHgSkBQQTFlOfg3/UHkHyNIvk0TV4iJpzhs6CAMlRioRKWttLj febe3hDfoDmoqaSZhmxcUHsNAtS06pVJ+AuKGjSMA5K6QQTOFdjRK/2+hr00V4iRFlzDXMS0Ll3fT+qJ 9YSH519IUTsIvhQenODRMReXXbfJmcCxUPg3N2TQvLX7iI2GRo2jU64IN210dmtDVGEA/////wNBBCMh T2Hr0mjRkNu+VR+JFRczrwE+E+Fbzd5l/XNCHJC6i62liVEVRnasthYQCjiFsv2yYw9HN6LxwO6+eQeB KQFIMEUCIEp1ufpfgI5z1XwcZ9i8B7x7XwJ3mkUyCq56bOcuPTmqAiEA4V68y5iExV7VZbPqcdIxWS/w WA8PpFqbkdqw/kJQNb4BAEEExZTn4N/1B5B8jSL5NE1eIiac4bOggDJUYqESlrbS433m3t4Q36A5qKmk mYZsXFB7DQLUtOqVSfgLiho0jAOSukcwRAIgK0UqQSZCBtaE6vQIQzd2cux7lCYz5F9WOsStmXuAy/4C IBogV6OLRM/W8Ia4nc8m+JpnnQgVh+/LtO8OaNW4ev8+AQBBBM4V2NEr/b6GvTRXiJEWXMNcxLQuXd9P 6on1hIfnX0hROwi+FB6c4NExF5ddt8mZwLFQ+Dc3ZNC8tfuIjYZGjaNIMEUCIQC5OkpGv/UnK/ih2GiU f9zHhBeJjYJG7YVMZvaRfXiZTgIgPsSob1XTyyX6i4HrKut4N+BjCQIoFT2xjFxwzXPcxGgBAAI0AQAA AAsRCQcZdqkUJ3xWxFlUFSoyhCkgAA+CUb1XICKIrHBvmAAAAAAAAAAETk9ORQAAADIBAAAACxEJBxep FJQW3sWnzet6O68LoU94dTLMfpFCh4CWmAAAAAAAAAAETk9ORQAAAA== ================================================================================ """.strip()) serMap['ustx']['ss2ms_unsigned'] = textwrap.dedent(""" =====TXSIGCOLLECT-HJqTvsXR====================================================== AQAAAAsRCQcAAAAAAf17AQEAAAALEQkH0yTdj/1epai7+ozi6P+QAGb7SC7heN8KKd7MXaylqCEBAAAA /QABAQAAAAFzi65SWdroLD8dGjAFjvQhDnaRFW1HDwU0AiSXxKxPuQEAAACLSDBFAiEAkbFWoFx5lKs+ Q0OY3TL3lo1ckIeiZOPWB0giLsMvrP0CICJ26+e5IB8l20Luaj2+zxWCu7bxYpyFqB8AaPXBaB7/AUEE IyFPYevSaNGQ275VH4kVFzOvAT4T4VvN3mX9c0IckLqLraWJURVGdqy2FhAKOIWy/bJjD0c3ovHA7r55 B4EpAf////8CQEtMAAAAAAAXqRTlgY0MJP3lDak826GfCJM965UHXIcwJEwAAAAAABl2qRRdhR54M5b6 KlxBD4fX4V7mP5EOKoisAAAAAAAAAP////8BQQT8+7E+Bne+Y73xPhAyqyWhlR4GNkYQsKcZvrWzNd/u IHyxhCAOyWMdec+GFKDLijYgqVTXkF41k6cJCQtRMbvhAAACMgEAAAALEQkHF6kUlBbexafN63o7rwuh T3h1Msx+kUKHAAk9AAAAAAAAAAROT05FAAAANAEAAAALEQkHGXapFLJqoSyMxawfCdRd3e5nFzk56v3l iKwg9A4AAAAAAAAABE5PTkUAAAA= ================================================================================ """.strip()) serMap['ustx']['ss2ms_signed'] = textwrap.dedent(""" =====TXSIGCOLLECT-HJqTvsXR====================================================== AQAAAAsRCQcAAAAAAf3CAQEAAAALEQkH0yTdj/1epai7+ozi6P+QAGb7SC7heN8KKd7MXaylqCEBAAAA /QABAQAAAAFzi65SWdroLD8dGjAFjvQhDnaRFW1HDwU0AiSXxKxPuQEAAACLSDBFAiEAkbFWoFx5lKs+ Q0OY3TL3lo1ckIeiZOPWB0giLsMvrP0CICJ26+e5IB8l20Luaj2+zxWCu7bxYpyFqB8AaPXBaB7/AUEE IyFPYevSaNGQ275VH4kVFzOvAT4T4VvN3mX9c0IckLqLraWJURVGdqy2FhAKOIWy/bJjD0c3ovHA7r55 B4EpAf////8CQEtMAAAAAAAXqRTlgY0MJP3lDak826GfCJM965UHXIcwJEwAAAAAABl2qRRdhR54M5b6 KlxBD4fX4V7mP5EOKoisAAAAAAAAAP////8BQQT8+7E+Bne+Y73xPhAyqyWhlR4GNkYQsKcZvrWzNd/u IHyxhCAOyWMdec+GFKDLijYgqVTXkF41k6cJCQtRMbvhRzBEAiARp54CUAAnSuKOwadJpeh1krlJyEGX ZqTV9KP4J8/1VwIgCI8MOAE4lIynyJ7aOSkIJ7KUjMn6aMCJTolck+gwXX8BAAIyAQAAAAsRCQcXqRSU Ft7Fp83rejuvC6FPeHUyzH6RQocACT0AAAAAAAAABE5PTkUAAAA0AQAAAAsRCQcZdqkUsmqhLIzFrB8J 1F3d7mcXOTnq/eWIrCD0DgAAAAAAAAAETk9ORQAAAA== ================================================================================ """.strip()) ############################################################################# def doRoundTrip(self, classObj, serMethod, unserMethod): # Test two round-trips with just the serialize methods def serialize(a): return getattr(a, serMethod)() def unserialize(obj, classType, skipMagicCheck=False): tempObj = classType() getattr(tempObj, unserMethod)(obj, skipMagicCheck=skipMagicCheck) return tempObj ser = serialize(classObj); classObj2 = unserialize(ser, classObj.__class__, skipMagicCheck=True) ser2 = serialize(classObj2); classObj3 = unserialize(ser2, classObj.__class__, skipMagicCheck=True) self.assertEqual(classObj, classObj2) self.assertEqual(classObj2, classObj3) # We could do all three of these in one swing with an extra loop, and even # test all the different classes by nesting one more layer, but it will look # look like there's only one test even though there's really 36, and we have # to go digging to figure out which one failed.... kinda. Maybe we should # do it anyway... ############################################################################# ##### UnsignedTxInput ############################################################################# def testUSTXI_serialize_roundtrip(self): for comment,asciiUstx in serMap['ustx'].iteritems(): ustx = UnsignedTransaction().unserializeAscii(asciiUstx, skipMagicCheck=True) for ustxi in ustx.ustxInputs: self.doRoundTrip(ustxi, 'serialize', 'unserialize') ############################################################################# def testUSTXI_JSON_roundtrip(self): for comment,asciiUstx in serMap['ustx'].iteritems(): ustx = UnsignedTransaction().unserializeAscii(asciiUstx, skipMagicCheck=True) for ustxi in ustx.ustxInputs: self.doRoundTrip(ustxi, 'toJSONMap', 'fromJSONMap') ############################################################################# ##### DecoratedTxOut ############################################################################# def testDTXO_serialize_roundtrip(self): for comment,asciiUstx in serMap['ustx'].iteritems(): ustx = UnsignedTransaction().unserializeAscii(asciiUstx, skipMagicCheck=True) for dtxo in ustx.decorTxOuts: self.doRoundTrip(dtxo, 'serialize', 'unserialize') ############################################################################# def testDTXO_JSON_roundtrip(self): for comment,asciiUstx in serMap['ustx'].iteritems(): ustx = UnsignedTransaction().unserializeAscii(asciiUstx, skipMagicCheck=True) for dtxo in ustx.decorTxOuts: self.doRoundTrip(dtxo, 'toJSONMap', 'fromJSONMap') ############################################################################# ##### UnsignedTransaction ############################################################################# def testUSTX_serialize_roundtrip(self): for comment,asciiUstx in serMap['ustx'].iteritems(): ustx = UnsignedTransaction().unserializeAscii(asciiUstx, skipMagicCheck=True) self.doRoundTrip(ustx, 'serialize', 'unserialize') ############################################################################# def testUSTX_serializeAscii_roundtrip(self): for comment,asciiUstx in serMap['ustx'].iteritems(): ustx = UnsignedTransaction().unserializeAscii(asciiUstx, skipMagicCheck=True) self.doRoundTrip(ustx, 'serializeAscii', 'unserializeAscii') ############################################################################# def testUSTX_JSON_roundtrip(self): for comment,asciiUstx in serMap['ustx'].iteritems(): ustx = UnsignedTransaction().unserializeAscii(asciiUstx, skipMagicCheck=True) self.doRoundTrip(ustx, 'toJSONMap', 'fromJSONMap') ############################################################################# ##### Lockbox ############################################################################# def testLockbox_serialize_roundtrip(self): for comment,asciiLockbox in serMap['lockbox'].iteritems(): lbox = MultiSigLockbox().unserializeAscii(asciiLockbox, skipMagicCheck=True) # Cannot verify that pprint or pprintOneLine does the correct thing, # but at least this will verify that it doesn't crash # and the output can be examined for manual verification. #lbox.pprintOneLine() #lbox.pprint() ############################################################################# def testLockbox_serializeAscii_roundtrip(self): for comment,asciiLockbox in serMap['lockbox'].iteritems(): lbox = MultiSigLockbox().unserializeAscii(asciiLockbox, skipMagicCheck=True) self.doRoundTrip(lbox, 'serializeAscii', 'unserializeAscii') ############################################################################# def testLockbox_JSON_roundtrip(self): for comment,asciiLockbox in serMap['lockbox'].iteritems(): lbox = MultiSigLockbox().unserializeAscii(asciiLockbox, skipMagicCheck=True) self.doRoundTrip(lbox, 'toJSONMap', 'fromJSONMap') def testLockboxDisplayInformation(self): lbox = MultiSigLockbox().unserializeAscii(serMap['lockbox'].values()[0], skipMagicCheck=True) # Cannot verify that pprint or pprintOneLine does the correct thing, # but at least this will verify that it doesn't crash #lbox.pprintOneLine() #lbox.pprint() self.assertTrue(binScript_to_p2shAddrStr(lbox.binScript)) def testCreateDecoratedTxOut(self): lbox = MultiSigLockbox().unserializeAscii(serMap['lockbox'].values()[0], skipMagicCheck=True) expectedValue = 1000 decoratedTxOutMultiSig = lbox.createDecoratedTxOut(expectedValue) expectedBinScriptMultiSig = hex_to_binary('52410423214f61ebd268d190dbbe551f89151733af013e13e15bcdde65fd73421c90ba8bada58951154676acb616100a3885b2fdb2630f4737a2f1c0eebe79078129014104c594e7e0dff507907c8d22f9344d5e22269ce1b3a080325462a11296b6d2e37de6dede10dfa039a8a9a499866c5c507b0d02d4b4ea9549f80b8a1a348c0392ba4104ce15d8d12bfdbe86bd34578891165cc35cc4b42e5ddf4fea89f58487e75f48513b08be141e9ce0d13117975db7c999c0b150f8373764d0bcb5fb888d86468da353ae') self.assertEquals(decoratedTxOutMultiSig.binScript, expectedBinScriptMultiSig) self.assertEquals(decoratedTxOutMultiSig.value, expectedValue) self.assertEquals(decoratedTxOutMultiSig.scriptType, CPP_TXOUT_MULTISIG) decoratedTxOutP2SH = lbox.createDecoratedTxOut(expectedValue, asP2SH=True) expectedBinScriptP2SH = hex_to_binary('a9149416dec5a7cdeb7a3baf0ba14f787532cc7e914287') self.assertEquals(decoratedTxOutP2SH.binScript, expectedBinScriptP2SH) self.assertEquals(decoratedTxOutP2SH.value, expectedValue) # self.scriptType is the CPP_TXOUT_TYPE of the txoScript *UNLESS* that # script is P2SH -- then it will be the type of the P2SH subscript, # and that subscript will be stored in self.p2shScript self.assertEquals(decoratedTxOutP2SH.scriptType, CPP_TXOUT_MULTISIG) ############################################################################# ##### Promissory Note ############################################################################# def testPromNote_serialize_roundtrip(self): for comment,asciiPromNote in serMap['promnote'].iteritems(): prom = MultiSigPromissoryNote().unserializeAscii(asciiPromNote, skipMagicCheck=True) self.doRoundTrip(prom, 'serialize', 'unserialize') ############################################################################# def testPromNote_serializeAscii_roundtrip(self): for comment,asciiPromNote in serMap['promnote'].iteritems(): prom = MultiSigPromissoryNote().unserializeAscii(asciiPromNote, skipMagicCheck=True) self.doRoundTrip(prom, 'serializeAscii', 'unserializeAscii') ############################################################################# def testPromNote_JSON_roundtrip(self): for comment,asciiPromNote in serMap['promnote'].iteritems(): prom = MultiSigPromissoryNote().unserializeAscii(asciiPromNote, skipMagicCheck=True) self.doRoundTrip(prom, 'toJSONMap', 'fromJSONMap') def testMakeFundingTxFromPromNotes(self): promNote = MultiSigPromissoryNote().unserializeAscii( serMap['promnote'].values()[0], skipMagicCheck=True) lbox = MultiSigLockbox().unserializeAscii(serMap['lockbox'].values()[0], skipMagicCheck=True) result = lbox.makeFundingTxFromPromNotes([promNote]) # 1 promisory note and no change means 1 input and 1 output self.assertEqual(len(result.ustxInputs), 1) self.assertEqual(len(result.decorTxOuts), 1) self.assertEqual(result.uniqueIDB58, 'NaVk9y4Y') class PubKeyBlockTest(unittest.TestCase): def setUp(self): self.binPubKey = hex_to_binary( \ '048d103d81ac9691cf13f3fc94e44968ef67b27f58b27372c13108552d24a6ee04' '785838f34624b294afee83749b64478bb8480c20b242c376e77eea2b3dc48b4b') self.comment = 'This is a sample comment!' def tearDown(self): pass ############################################################################# def testPubKey_serialize_roundtrip(self): wltLoc = 'Armory3cx8J2n#223' authMethod = 'NullAuthMethod' authData = NullAuthData() dpk = DecoratedPublicKey(self.binPubKey, self.comment, wltLoc, authMethod, authData) self.assertEqual(self.binPubKey, dpk.binPubKey) self.assertEqual(self.comment, dpk.keyComment) self.assertEqual(wltLoc, dpk.wltLocator) self.assertEqual(authMethod, dpk.authMethod) self.assertEqual(authData, dpk.authData) serKey = dpk.serialize() dpk2 = DecoratedPublicKey().unserialize(serKey) self.assertEqual(dpk.binPubKey, dpk2.binPubKey) self.assertEqual(dpk.keyComment, dpk2.keyComment) self.assertEqual(wltLoc, dpk2.wltLocator) self.assertEqual(authMethod, dpk2.authMethod) self.assertEqual(authData, dpk2.authData) ############################################################################# def testPubKey_serializeAscii_roundtrip(self): wltLoc = 'Armory3cx8J2n#223' authMethod = 'NullAuthMethod' authData = NullAuthData() dpk = DecoratedPublicKey(self.binPubKey, self.comment, wltLoc, authMethod, authData) self.assertEqual(self.binPubKey, dpk.binPubKey) self.assertEqual(self.comment, dpk.keyComment) self.assertEqual(wltLoc, dpk.wltLocator) self.assertEqual(authMethod, dpk.authMethod) self.assertEqual(authData, dpk.authData) ascKey = dpk.serializeAscii() dpk2 = DecoratedPublicKey().unserializeAscii(ascKey) self.assertEqual(dpk.binPubKey, dpk2.binPubKey) self.assertEqual(dpk.keyComment,dpk2.keyComment) self.assertEqual(wltLoc, dpk2.wltLocator) self.assertEqual(authMethod, dpk2.authMethod) self.assertEqual(authData, dpk2.authData) """ def testMinimizeDERSignaturePadding(self): multiTx1 = PyTx().unserialize(multiTx1raw) paddingMinimizedMulti1, newTxMulti1 = multiTx1.minimizeDERSignaturePadding() self.assertEqual(multiTx1.inputs[0].binScript, newTxMulti1.inputs[0].binScript) self.assertEqual(multiTx1.inputs[1].binScript, newTxMulti1.inputs[1].binScript) self.assertEqual(multiTx1.inputs[2].binScript, newTxMulti1.inputs[2].binScript) self.assertEqual(multiTx1.inputs[3].binScript, newTxMulti1.inputs[3].binScript) self.assertFalse(paddingMinimizedMulti1) txString = multiTx1.toString() self.assertTrue(len(txString)> 0) multiTx2 = PyTx().unserialize(multiTx2raw) paddingMinimizedMulti2, newTxMulti2 = multiTx2.minimizeDERSignaturePadding() self.assertEqual(multiTx2.inputs[0].binScript, newTxMulti2.inputs[0].binScript) self.assertEqual(multiTx2.inputs[1].binScript, newTxMulti2.inputs[1].binScript) self.assertEqual(multiTx2.inputs[2].binScript, newTxMulti2.inputs[2].binScript) # Added 1 extra byte of padding self.assertEqual(len(multiTx2.inputs[3].binScript)-1, len(newTxMulti2.inputs[3].binScript)) self.assertTrue(paddingMinimizedMulti2) tx1 = PyTx().unserialize(tx1raw) paddingMinimized1, newTx1 = tx1.minimizeDERSignaturePadding() self.assertEqual(tx1.inputs[0].binScript, newTx1.inputs[0].binScript) self.assertFalse(paddingMinimized1) tx2 = PyTx().unserialize(tx2raw) paddingMinimized2, newTx2 = tx2.minimizeDERSignaturePadding() # Old tx had 2 extra bytes of padding one each on the r and s self.assertEqual(len(tx2.inputs[0].binScript)-2, len(newTx2.inputs[0].binScript)) self.assertTrue(paddingMinimized2) def testSerializeUnserialize(self): tx1 = PyTx().unserialize(tx1raw) tx2 = PyTx().unserialize(BinaryUnpacker(tx2raw)) tx1again = tx1.serialize() tx2again = tx2.serialize() self.assertEqual(tx1again, tx1raw) self.assertEqual(tx2again, tx2raw) blk = PyBlock().unserialize( hex_to_binary(hexBlock) ) blockReHex = binary_to_hex(blk.serialize()) self.assertEqual(hexBlock, blockReHex) binRoot = blk.blockData.getMerkleRoot() self.assertEqual(blk.blockHeader.merkleRoot, blk.blockData.merkleRoot) def testCreateTx(self): addrA = PyBtcAddress().createFromPrivateKey(hex_to_int('aa' * 32)) addrB = PyBtcAddress().createFromPrivateKey(hex_to_int('bb' * 32)) # This TxIn will be completely ignored, so it can contain garbage txinA = PyTxIn() txinA.outpoint = PyOutPoint().unserialize(hex_to_binary('00'*36)) txinA.binScript = hex_to_binary('99'*4) txinA.intSeq = hex_to_int('ff'*4) # test binary unpacker in unserialize testTxIn = PyTxIn().unserialize(txinA.serialize()) self.assertEqual(txinA.getScript(), testTxIn.getScript()) self.assertEqual(txinA.intSeq, testTxIn.intSeq) self.assertEqual(txinA.outpoint.txHash, testTxIn.outpoint.txHash) txoutA = PyTxOut() txoutA.value = 50 * ONE_BTC txoutA.binScript = '\x76\xa9\x14' + addrA.getAddr160() + '\x88\xac' # Test pprint #print '\nTest pretty print PyTxIn, expect PrevTXHash all 0s' #testTxIn.pprint() # test binary unpacker in unserialize testTxOut = PyTxOut().unserialize(txoutA.serialize()) self.assertEqual(txoutA.getScript(), testTxOut.getScript()) self.assertEqual(txoutA.value, testTxOut.getValue()) # Test pprint #print '\nTest pretty print PyTxOut' #testTxOut.pprint() tx1 = PyTx() tx1.version = 1 tx1.numInputs = 1 tx1.inputs = [txinA] tx1.numOutputs = 1 tx1.outputs = [txoutA] tx1.locktime = 0 tx1hash = tx1.getHash() recipientList = tx1.makeRecipientsList() self.assertEqual(len(recipientList), 1) self.assertEqual(recipientList[0][0], TXOUT_SCRIPT_STANDARD) self.assertEqual(recipientList[0][1], 50 * ONE_BTC) self.assertEqual(tx1.getHashHex(), binary_to_hex(tx1hash)) # Creating transaction to send coins from A to B tx2 = PyCreateAndSignTx( [[ addrA, tx1, 0 ]], [[addrB, 50*ONE_BTC]]) psp = PyScriptProcessor() psp.setTxObjects(tx1, tx2, 0) self.assertTrue(psp.verifyTransactionValid()) def testVerifyTxFromFakeBlockChain(self): psp = PyScriptProcessor() psp.setTxObjects(tx1Fake, tx2Fake, 0) self.assertTrue(psp.verifyTransactionValid()) def test2of2MultiSigTx(self): tx1 = PyTx().unserialize(hex_to_binary('010000000189a0022c8291b4328338ec95179612b8ebf72067051de019a6084fb97eae0ebe000000004a4930460221009627882154854e3de066943ba96faba02bb8b80c1670a0a30d0408caa49f03df022100b625414510a2a66ebb43fffa3f4023744695380847ee1073117ec90cb60f2c8301ffffffff0210c18d0000000000434104a701496f10db6aa8acbb6a7aa14d62f4925f8da03de7f0262010025945f6ebcc3efd55b6aa4bc6f811a0dc1bbdd2644bdd81c8a63766aa11f650cd7736bbcaf8ac001bb7000000000043526b006b7dac7ca914fc1243972b59c1726735d3c5cca40e415039dce9879a6c936b7dac7ca914375dd72e03e7b5dbb49f7e843b7bef4a2cc2ce9e879a6c936b6c6ca200000000')) tx2 = PyTx().unserialize(hex_to_binary('01000000011c9608650a912be7fa88eecec664e6fbfa4b676708697fa99c28b3370005f32d01000000fd1701483045022017462c29efc9158cf26f2070d444bb2b087b8a0e6287a9274fa36fad30c46485022100c6d4cc6cd504f768389637df71c1ccd452e0691348d0f418130c31da8cc2a6e8014104e83c1d4079a1b36417f0544063eadbc44833a992b9667ab29b4ff252d8287687bad7581581ae385854d4e5f1fcedce7de12b1aec1cb004cabb2ec1f3de9b2e60493046022100fdc7beb27de0c3a53fbf96df7ccf9518c5fe7873eeed413ce17e4c0e8bf9c06e022100cc15103b3c2e1f49d066897fe681a12e397e87ed7ee39f1c8c4a5fef30f4c2c60141047cf315904fcc2e3e2465153d39019e0d66a8aaec1cec1178feb10d46537427239fd64b81e41651e89b89fefe6a23561d25dddc835395dd3542f83b32a1906aebffffffff01c0d8a700000000001976a914fc1243972b59c1726735d3c5cca40e415039dce988ac00000000')) # Verify 2-of-2 tx from Testnet psp = PyScriptProcessor() psp.setTxObjects(tx1, tx2, 0) self.assertTrue(psp.verifyTransactionValid()) def test2of3MultiSigTx(self): tx1 = PyTx().unserialize(hex_to_binary('010000000371c06e0639dbe6bc35e6f948da4874ae69d9d91934ec7c5366292d0cbd5f97b0010000008a47304402200117cdd3ec6259af29acea44db354a6f57ac10d8496782033f5fe0febfd77f1b02202ceb02d60dbb43e6d4e03e5b5fbadc031f8bbb3c6c34ad307939947987f600bf01410452d63c092209529ca2c75e056e947bc95f9daffb371e601b46d24377aaa3d004ab3c6be2d6d262b34d736b95f3b0ef6876826c93c4077d619c02ebd974c7facdffffffffa65aa866aa7743ec05ba61418015fc32ecabd99886732056f1d4454c8f762bf8000000008c493046022100ea0a9b41c9372837e52898205c7bebf86b28936a3ee725672d0ca8f434f876f0022100beb7243a51fbc0997e55cb519d3b9cbd59f7aba68d80ba1e8adbb53443cda3c00141043efd1ca3cffc50638031281d227ff347a3a27bc145e2f846891d29f87bc068c27710559c4d9cd71f7e9e763d6e2753172406eb1ed1fadcaf9a8972b4270f05b4ffffffffd866d14151ee1b733a2a7273f155ecb25c18303c31b2c4de5aa6080aef2e0006000000008b483045022052210f95f6b413c74ce12cfc1b14a36cb267f9fa3919fa6e20dade1cd570439f022100b9e5b325f312904804f043d06c6ebc8e4b1c6cd272856c48ab1736b9d562e10c01410423fdddfe7e4d70d762dd6596771e035f4b43d54d28c2231be1102056f81f067914fe4fb6fd6e3381228ee5587ddd2028c846025741e963d9b1d6cf2c2dea0dbcffffffff0210ef3200000000004341048a33e9fd2de28137574cc69fe5620199abe37b7d08a51c528876fe6c5fa7fc28535f5a667244445e79fffc9df85ec3d79d77693b1f37af0e2d7c1fa2e7113a48acc0d454070000000061526b006b7dac7ca9143cd1def404e12a85ead2b4d3f5f9f817fb0d46ef879a6c936b7dac7ca9146a4e7d5f798e90e84db9244d4805459f87275943879a6c936b7dac7ca914486efdd300987a054510b4ce1148d4ad290d911e879a6c936b6c6ca200000000')) tx2 = PyTx().unserialize(hex_to_binary('01000000012f654d4d1d7246d1a824c5b6c5177c0b5a1983864579aabb88cabd5d05e032e201000000fda0014730440220151ad44e7f78f9e0c4a3f2135c19ca3de8dbbb7c58893db096c0c5f1573d5dec02200724a78c3fa5f153103cb46816df46eb6cfac3718038607ddec344310066161e01410459fd82189b81772258a3fc723fdda900eb8193057d4a573ee5ad39e26b58b5c12c4a51b0edd01769f96ed1998221daf0df89634a7137a8fa312d5ccc95ed8925483045022100ca34834ece5925cff6c3d63e2bda6b0ce0685b18f481c32e70de9a971e85f12f0220572d0b5de0cf7b8d4e28f4914a955e301faaaa42f05feaa1cc63b45f938d75d9014104ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1483045022074e01e8225e8c4f9d0b3f86908d42a61e611f406e13817d16240f94f52f49359022100f4c768dd89c6435afd3834ae2c882465ade92d7e1cc5c2c2c3d8d25c41b3ea61014104ce66c9f5068b715b62cc1622572cd98a08812d8ca01563045263c3e7af6b997e603e8e62041c4eb82dfd386a3412c34c334c34eb3c76fb0e37483fc72323f807ffffffff01b0ad5407000000001976a9146a4e7d5f798e90e84db9244d4805459f8727594388ac00000000')) # Verify 2-of-3 tx from Testnet psp = PyScriptProcessor() psp.setTxObjects(tx1, tx2, 0) self.assertTrue(psp.verifyTransactionValid()) def testMultiSig(self): tx1 = PyTx().unserialize(hex_to_binary('0100000001845ad165bdc0f9b5829cf5a594c4148dfd89e24756303f3a8dabeb597afa589b010000008b483045022063c233df8efa3d1885e069e375a8eabf16b23475ef21bdc9628a513ee4caceb702210090a102c7b602043e72b34a154d495ac19b3b9e42acb962c399451f2baead8f4c014104b38f79037ad25b84a564eaf53ede93dec70b35216e6682aa71a47cefa2996ec49acfbb0a8730577c62ef9a7cc20c740aaaaee75419bef9640a4216c2b49c42d3ffffffff02000c022900000000434104c08c0a71ccbe838403e3870aa1ab871b0ab3a6014b0ba41f6df2b9aefea73134ecaa0b27797620e402a33799e9047f86519d9e43bbd504cf753c293752933f4fac406f40010000000062537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae00000000')) tx2 = PyTx().unserialize(hex_to_binary('0100000001bb664ff716b9dfc831bcc666c1767f362ad467fcfbaf4961de92e45547daab8701000000fd190100493046022100d73f633f114e0e0b324d87d38d34f22966a03b072803afa99c9408201f6d6dc6022100900e85be52ad2278d24e7edbb7269367f5f2d6f1bd338d017ca460008776614401473044022071fef8ac0aa6318817dbd242bf51fb5b75be312aa31ecb44a0afe7b49fcf840302204c223179a383bb6fcb80312ac66e473345065f7d9136f9662d867acf96c12a42015241048c006ff0d2cfde86455086af5a25b88c2b81858aab67f6a3132c885a2cb9ec38e700576fd46c7d72d7d22555eee3a14e2876c643cd70b1b0a77fbf46e62331ac4104b68ef7d8f24d45e1771101e269c0aacf8d3ed7ebe12b65521712bba768ef53e1e84fff3afbee360acea0d1f461c013557f71d426ac17a293c5eebf06e468253e00ffffffff0280969800000000001976a9140817482d2e97e4be877efe59f4bae108564549f188ac7015a7000000000062537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae00000000')) # OP_CHECKMULTISIG from Testnet psp = PyScriptProcessor() psp.setTxObjects(tx1, tx2, 0) self.assertTrue(psp.verifyTransactionValid()) def testMultiSigAddrExtraction(self): script1 = hex_to_binary('4104b54b5fc1917945fff64785d4baaca66a9704e9ed26002f51f53763499643321fbc047683a62be16e114e25404ce6ffdcf625a928002403402bf9f01e5cbd5f3dad4104f576e534f9bbf6d7c5f186ff4c6e0c5442c2755314bdee62fbc656f94d6cbf32c5eb3522da21cf9f954133000ffccb20dbfec030737640cc3315ce09619210d0ac') expectedBtcAddrList1 = ['1KmV9FdKJEFFCHydZUZGdBL9uKq2T9JUm8','13maaQeK5qSPjHwnHhwNUtNKruK3qYLwvv'] self.verifyMultiSigAddrExtraction(script1, expectedBtcAddrList1) script2 = hex_to_binary('537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae') expectedBtcAddrList2 = ['1ChwTs5Dmh6y9iDh4pjWyu2X6nAhjre7SV','1G2i31fxRqaoXBfYMuE4YKb9x96uYcHeQ','12Tg96ZPSYc3P2g5c9c4znFFH2whriN9NQ'] self.verifyMultiSigAddrExtraction(script2, expectedBtcAddrList2) script3 = hex_to_binary('527a7651a269527a829178a914731cdb75c88a01cbb96729888f726b3b9f29277a879b69527a829178a914e9b4261c6122f8957683636548923acc069e8141879b6952ae') expectedBtcAddrList3 = ['1BVfH6iKT1s8fYEVSj39QkJrPqCKN4hv2m','1NJiFfFPZ177Pv96Yt4FCNZFEumyL2eKmt'] self.verifyMultiSigAddrExtraction(script3, expectedBtcAddrList3) def verifyMultiSigAddrExtraction(self, scr, expectedBtcAddrList): addrList = getMultisigScriptInfo(scr)[2] btcAddrList = [] for a in addrList: btcAddrList.append(PyBtcAddress().createFromPublicKeyHash160(a).getAddrStr()) self.assertEqual(btcAddrList, expectedBtcAddrList) def testUnpackUnserializePyOutPoint(self): outpoint = PyOutPoint().unserialize(BinaryUnpacker(ALL_ZERO_OUTPOINT)) self.assertEqual(outpoint.txHash, hex_to_binary('00'*32)) self.assertEqual(outpoint.txOutIndex, 0) def testCopyPyOutPoint(self): outpoint = PyOutPoint().unserialize(BinaryUnpacker(ALL_ZERO_OUTPOINT)) outpointCopy = outpoint.copy() self.assertEqual(outpoint.txHash, outpointCopy.txHash) self.assertEqual(outpoint.txOutIndex, outpointCopy.txOutIndex) def testPPrintPyOutPoint(self): # No return value - Should just print 0s outpoint = PyOutPoint().unserialize(BinaryUnpacker(ALL_ZERO_OUTPOINT)) #print "PyOutPoint PPrint Test. Expect all 0s: " #outpoint.pprint() ''' Does not pass because fromCpp is missing def testCreateCppFromCppPyOutPoint(self): outpoint = PyOutPoint().unserialize(BinaryUnpacker(ALL_ZERO_OUTPOINT)) outpointFromCpp = PyOutPoint().fromCpp(outpoint.createCpp()) self.assertEqual(outpoint.txHash, outpointFromCpp.txHash) self.assertEqual(outpoint.txOutIndex, outpointFromCpp.txOutIndex) ''' def testBogusBlockComponent(self): class TestBlockComponent(BlockComponent): pass testBlkComp = TestBlockComponent() self.assertRaises(NotImplementedError, testBlkComp.serialize) self.assertRaises(NotImplementedError, testBlkComp.unserialize) # TODO: Add some tests for the OP_CHECKMULTISIG support in TxDP """ # Running tests with "python " will NOT work for any Armory tests # You must run tests with "python -m unittest " or run all tests with "python -m unittest discover" # if __name__ == "__main__": # unittest.main() armory-0.92.3/buildinstaller_x64.bat0000644000000000000000000000066712414772654016047 0ustar rootrootREM This should only be run from cppForSwig\BitcoinArmory_SwigDLL directory copy ..\libs\x64\BitcoinArmory_SwigDLL.dll ..\..\_CppBlockUtils.pyd C:\Python27_64\Lib\site-packages\PyQt4\pyrcc4.exe -o ..\..\qrc_img_resources.py ..\..\imgList.xml python64 ..\..\setup.py py2exe --includes sip,hashlib,json,twisted -d ..\..\ArmoryStandalone rtc /F:..\..\edit_icons.rts python64 ..\..\writeNSISCompilerArgs.py makensis.exe ..\..\ArmorySetup.nsi armory-0.92.3/Makefile0000644000000000000000000000505512414772654013275 0ustar rootroot# All the actual Makefiles are deeper in the directory tree. # I am just calling them, here. PREFIX=/usr DESTDIR= all : $(MAKE) -C cppForSwig clean : $(MAKE) -C cppForSwig clean rm -f osxbuild/build-app.log.txt rm -rf osxbuild/workspace/ rm -f CppBlockUtils.py rm -f qrc_img_resources.py rm -f _CppBlockUtils.so rm -f cppForSwig/cryptopp/a.out rm -f *.pyc BitTornado/*.pyc bitcoinrpc_jsonrpc/*.pyc ui/*.pyc rm -f armoryengine/*.pyc dialogs/*.pyc BitTornado/BT1/*.pyc rm -f pytest/*.pyc txjsonrpc/*.pyc jsonrpc/*.pyc txjsonrpc/web/*.pyc install : all mkdir -p $(DESTDIR)$(PREFIX)/share/armory/img mkdir -p $(DESTDIR)$(PREFIX)/lib/armory/extras mkdir -p $(DESTDIR)$(PREFIX)/lib/armory/bitcoinrpc_jsonrpc mkdir -p $(DESTDIR)$(PREFIX)/lib/armory/txjsonrpc mkdir -p $(DESTDIR)$(PREFIX)/lib/armory/txjsonrpc/web mkdir -p $(DESTDIR)$(PREFIX)/lib/armory/ui mkdir -p $(DESTDIR)$(PREFIX)/lib/armory/pytest mkdir -p $(DESTDIR)$(PREFIX)/lib/armory/BitTornado/BT1 mkdir -p $(DESTDIR)$(PREFIX)/lib/armory/urllib3 mkdir -p $(DESTDIR)$(PREFIX)/bin cp dpkgfiles/armory $(DESTDIR)$(PREFIX)/bin chmod +x $(DESTDIR)$(PREFIX)/bin/armory cp *.py *.so README $(DESTDIR)$(PREFIX)/lib/armory/ rsync -rupE armoryengine $(DESTDIR)$(PREFIX)/lib/armory/ rsync -rupE --exclude="img/.DS_Store" img $(DESTDIR)$(PREFIX)/share/armory/ cp extras/*.py $(DESTDIR)$(PREFIX)/lib/armory/extras cp bitcoinrpc_jsonrpc/*.py $(DESTDIR)$(PREFIX)/lib/armory/bitcoinrpc_jsonrpc cp -r txjsonrpc/*.py $(DESTDIR)$(PREFIX)/lib/armory/txjsonrpc cp -r txjsonrpc/web/*.py $(DESTDIR)$(PREFIX)/lib/armory/txjsonrpc/web cp ui/*.py $(DESTDIR)$(PREFIX)/lib/armory/ui cp pytest/*.py $(DESTDIR)$(PREFIX)/lib/armory/pytest cp -r urllib3/* $(DESTDIR)$(PREFIX)/lib/armory/urllib3 mkdir -p $(DESTDIR)$(PREFIX)/share/applications cp BitTornado/*.py $(DESTDIR)$(PREFIX)/lib/armory/BitTornado cp BitTornado/BT1/*.py $(DESTDIR)$(PREFIX)/lib/armory/BitTornado/BT1 cp default_bootstrap.torrent $(DESTDIR)$(PREFIX)/lib/armory sed "s:python /usr:python $(PREFIX):g" < dpkgfiles/armory.desktop > $(DESTDIR)$(PREFIX)/share/applications/armory.desktop sed "s:python /usr:python $(PREFIX):g" < dpkgfiles/armoryoffline.desktop > $(DESTDIR)$(PREFIX)/share/applications/armoryoffline.desktop sed "s:python /usr:python $(PREFIX):g" < dpkgfiles/armorytestnet.desktop > $(DESTDIR)$(PREFIX)/share/applications/armorytestnet.desktop all-test-tools: all $(MAKE) -C cppForSwig/gtest test: all-test-tools (cd cppForSwig/gtest && ./CppBlockUtilsTests) python -m unittest discover osx : chmod +x osxbuild/deploy.sh cd osxbuild; ./deploy.sh armory-0.92.3/edit_icons.rts0000644000000000000000000000531712414772654014510 0ustar rootroot'------------------------------------------------------------------------------ ' Edit Icons: Replacing Icon Resource with Icon from .ICO File '------------------------------------------------------------------------------ ' ' This sample VBScript code provides a real-world example that demonstrates ' many of the features available in Resource Tuner Console. ' ' This code shows how to modify icons in executables: ' - Replace the main icon with the new icons from an .ICO file (including ' the 256x256 PNG-compressed Vista icon); ' - Sort out the added icons in the right order; ' - Add one more icon to the newly created Icon Group; ' - Output the changes to the Resource Tree to a log file; ' - Restore the original timestamps on the file after saving (for demo purpose). ' ' To give you an idea of how this all works, we made this sample script and ' test application. When you installed Resorce Tuner Console on your computer, ' the setup program created the ".\Demo Scripts" folder under the RTC folder, with ' the test application "DemoApp1.exe" in the ".\Demo Scripts\Edit Icons\Src" folder. ' ' This script is ready to run. Select EDIT_ICONS.BAT file to execute the script. ' ' The script will add or replace icons in DemoApp1.exe with icons from the .ico ' files from the ".\Src" folder. ' ' The resulting file will be created in the directory named ".\Release" ' Check the log file "log.txt" to see the Resource Tree changed. ' ' Demonstrates the following: ' ' - PEFileProxy.OpenFile ' - PEFileProxy.Terminated ' - PEFileProxy.HasResources ' - PEFileProxy.CreateBackUp ' - PEFileProxy.SaveAsNewImage ' - PEFileProxy.PostDebugString ' - PEFileProxy.UpdateCheckSum ' - ResourcesProxy.ChangeIcon ' - ResourcesProxy.ResourceTreeToLog ' - ScriptUnit.SetFileTime ' '--------------------------------------------------------------------------------------- Sub Main PEFileProxy.PostDebugString "Updating the checksum in the PE file header is enabled." PEFileProxy.UpdateCheckSum = True PEFileProxy.PostDebugString "The creation of a backup copy is disabled." PEFileProxy.CreateBackUp = False SRCFILE = "..\..\ArmoryStandalone\ArmoryQt.exe" 'Open file PEFileProxy.PostDebugString "Opening the file..." PEFileProxy.OpenFile SRCFILE 'This specifies the default language LangID = 0 PEFileProxy.PostDebugString "Changing/adding the main application icon..." ResourcesProxy.ChangeIcon "", LangID, CREATE_IF_NOT_EXIST, REPLACE_IF_ITEM_EXISTS, "..\..\img\Armory48x48.ico" 'Save file PEFileProxy.PostDebugString "Saving file..." DESTFILE = "..\..\ArmoryStandalone\ArmoryQt.exe" PEFileProxy.SaveAsNewImage DESTFILE PEFileProxy.PostDebugString "Closing this file..." PEFileProxy.CloseFile end Sub armory-0.92.3/LICENSE0000644000000000000000000000441712414772654012643 0ustar rootroot*********************************************************** * * Armory -- Bitcoin Wallet Software * * Copyright (C) 2011-2014, Armory Technologies, Inc. * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU Affero General Public License as * published by the Free Software Foundation, either version 3 of the * License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Affero General Public License * for more details. * *********************************************************** * * Armory is licensed under the GNU Affero General Public License, Version 3. * Please see LICENSE.py for the full details of this license. * *********************************************************** * * To use this software or source code in a way not compliant with the * APGLv3, please contact us to discuss a dual-licensing agreement: * * licensing@bitcoinarmory.com * *********************************************************** armory-0.92.3/ArmoryQt.py0000755000000000000000000113644212414772654013776 0ustar rootroot#! /usr/bin/python ################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ from datetime import datetime import hashlib import logging import math import os import platform import random import shutil import signal import socket import subprocess import sys import threading import time import traceback import webbrowser import psutil from copy import deepcopy from PyQt4.QtCore import * from PyQt4.QtGui import * from twisted.internet.defer import Deferred from twisted.internet.protocol import Protocol, ClientFactory import CppBlockUtils as Cpp from armoryengine.ALL import * from armorycolors import Colors, htmlColor, QAPP from armorymodels import * from ui.toolsDialogs import MessageSigningVerificationDialog import qrc_img_resources from qtdefines import * from qtdialogs import * from ui.Wizards import WalletWizard, TxWizard from ui.VerifyOfflinePackage import VerifyOfflinePackageDialog from ui.UpgradeDownloader import UpgradeDownloaderDialog from jasvet import verifySignature, readSigBlock from announcefetch import AnnounceDataFetcher, ANNOUNCE_URL, ANNOUNCE_URL_BACKUP,\ DEFAULT_FETCH_INTERVAL from armoryengine.parseAnnounce import * from armoryengine.PyBtcWalletRecovery import WalletConsistencyCheck from armoryengine.MultiSigUtils import MultiSigLockbox from ui.MultiSigDialogs import DlgSelectMultiSigOption, DlgLockboxManager, \ DlgMergePromNotes, DlgCreatePromNote, DlgImportAsciiBlock from armoryengine.Decorators import RemoveRepeatingExtensions from armoryengine.Block import PyBlock # HACK ALERT: Qt has a bug in OS X where the system font settings will override # the app's settings when a window is activated (e.g., Armory starts, the user # switches to another app, and then switches back to Armory). There is a # workaround, as used by TeXstudio and other programs. # https://bugreports.qt-project.org/browse/QTBUG-5469 - Bug discussion. # http://sourceforge.net/p/texstudio/bugs/594/?page=1 - Fix is mentioned. # http://pyqt.sourceforge.net/Docs/PyQt4/qapplication.html#setDesktopSettingsAware # - Mentions that this must be called before the app (QAPP) is created. if OS_MACOSX: QApplication.setDesktopSettingsAware(False) # PyQt4 Imports # All the twisted/networking functionality if OS_WINDOWS: from _winreg import * class ArmoryMainWindow(QMainWindow): """ The primary Armory window """ ############################################################################# @TimeThisFunction def __init__(self, parent=None): super(ArmoryMainWindow, self).__init__(parent) # Load the settings file self.settingsPath = CLI_OPTIONS.settingsPath self.settings = SettingsFile(self.settingsPath) # SETUP THE WINDOWS DECORATIONS self.lblLogoIcon = QLabel() if USE_TESTNET: self.setWindowTitle('Armory - Bitcoin Wallet Management [TESTNET]') self.iconfile = ':/armory_icon_green_32x32.png' self.lblLogoIcon.setPixmap(QPixmap(':/armory_logo_green_h56.png')) if Colors.isDarkBkgd: self.lblLogoIcon.setPixmap(QPixmap(':/armory_logo_white_text_green_h56.png')) else: self.setWindowTitle('Armory - Bitcoin Wallet Management') self.iconfile = ':/armory_icon_32x32.png' self.lblLogoIcon.setPixmap(QPixmap(':/armory_logo_h44.png')) if Colors.isDarkBkgd: self.lblLogoIcon.setPixmap(QPixmap(':/armory_logo_white_text_h56.png')) self.setWindowIcon(QIcon(self.iconfile)) self.lblLogoIcon.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) self.netMode = NETWORKMODE.Offline self.abortLoad = False self.memPoolInit = False self.dirtyLastTime = False self.needUpdateAfterScan = True self.sweepAfterScanList = [] self.newWalletList = [] self.newZeroConfSinceLastUpdate = [] self.lastBDMState = ['Uninitialized', None] self.lastSDMState = 'Uninitialized' self.doShutdown = False self.downloadDict = {} self.notAvailErrorCount = 0 self.satoshiVerWarnAlready = False self.satoshiLatestVer = None self.latestVer = {} self.downloadDict = {} self.satoshiHomePath = None self.satoshiExeSearchPath = None self.initSyncCircBuff = [] self.latestVer = {} self.lastVersionsTxtHash = '' self.dlgCptWlt = None self.torrentFinished = False self.torrentCircBuffer = [] self.lastAskedUserStopTorrent = 0 self.wasSynchronizing = False self.announceIsSetup = False self.entropyAccum = [] self.allLockboxes = [] self.lockboxIDMap = {} self.cppLockboxWltMap = {} # Full list of notifications, and notify IDs that should trigger popups # when sending or receiving. self.lastAnnounceUpdate = {} self.changelog = [] self.downloadLinks = {} self.almostFullNotificationList = {} self.notifyOnSend = set() self.notifyonRecv = set() self.versionNotification = {} self.notifyIgnoreLong = [] self.notifyIgnoreShort = [] self.maxPriorityID = None self.satoshiVersions = ['',''] # [curr, avail] self.armoryVersions = [getVersionString(BTCARMORY_VERSION), ''] self.NetworkingFactory = None # Kick off announcement checking, unless they explicitly disabled it # The fetch happens in the background, we check the results periodically self.announceFetcher = None self.setupAnnouncementFetcher() #delayed URI parsing dict self.delayedURIData = {} self.delayedURIData['qLen'] = 0 #Setup the signal to spawn progress dialogs from the main thread self.connect(self, SIGNAL('initTrigger') , self.initTrigger) self.connect(self, SIGNAL('execTrigger'), self.execTrigger) self.connect(self, SIGNAL('checkForNegImports'), self.checkForNegImports) # We want to determine whether the user just upgraded to a new version self.firstLoadNewVersion = False currVerStr = 'v'+getVersionString(BTCARMORY_VERSION) if self.settings.hasSetting('LastVersionLoad'): lastVerStr = self.settings.get('LastVersionLoad') if not lastVerStr==currVerStr: LOGINFO('First load of new version: %s', currVerStr) self.firstLoadNewVersion = True self.settings.set('LastVersionLoad', currVerStr) # Because dynamically retrieving addresses for querying transaction # comments can be so slow, I use this txAddrMap to cache the mappings # between tx's and addresses relevant to our wallets. It really only # matters for massive tx with hundreds of outputs -- but such tx do # exist and this is needed to accommodate wallets with lots of them. self.txAddrMap = {} self.loadWalletsAndSettings() eulaAgreed = self.getSettingOrSetDefault('Agreed_to_EULA', False) if not eulaAgreed: DlgEULA(self,self).exec_() if not self.abortLoad: self.setupNetworking() # setupNetworking may have set this flag if something went wrong if self.abortLoad: LOGWARN('Armory startup was aborted. Closing.') os._exit(0) # We need to query this once at the beginning, to avoid having # strange behavior if the user changes the setting but hasn't # restarted yet... self.doAutoBitcoind = \ self.getSettingOrSetDefault('ManageSatoshi', not OS_MACOSX) # If we're going into online mode, start loading blockchain if self.doAutoBitcoind: self.startBitcoindIfNecessary() else: self.loadBlockchainIfNecessary() # Setup system tray and register "bitcoin:" URLs with the OS self.setupSystemTray() self.setupUriRegistration() self.extraHeartbeatSpecial = [] self.extraHeartbeatAlways = [] self.extraHeartbeatOnline = [] self.extraNewTxFunctions = [] self.extraNewBlockFunctions = [] self.extraShutdownFunctions = [] self.extraGoOnlineFunctions = [] """ pass a function to extraHeartbeatAlways to run on every heartbeat. pass a list for more control on the function, as [func, [args], keep_running], where: func is the function [args] is a list of arguments keep_running is a bool, pass False to remove the function from extraHeartbeatAlways on the next iteration """ self.lblArmoryStatus = QRichLabel('Offline ' % htmlColor('TextWarn'), doWrap=False) self.statusBar().insertPermanentWidget(0, self.lblArmoryStatus) # Table for all the wallets self.walletModel = AllWalletsDispModel(self) self.walletsView = QTableView() w,h = tightSizeNChar(self.walletsView, 55) viewWidth = 1.2*w sectionSz = 1.3*h viewHeight = 4.4*sectionSz self.walletsView.setModel(self.walletModel) self.walletsView.setSelectionBehavior(QTableView.SelectRows) self.walletsView.setSelectionMode(QTableView.SingleSelection) self.walletsView.verticalHeader().setDefaultSectionSize(sectionSz) self.walletsView.setMinimumSize(viewWidth, viewHeight) self.walletsView.setItemDelegate(AllWalletsCheckboxDelegate(self)) self.walletsView.horizontalHeader().setResizeMode(0, QHeaderView.Fixed) self.walletsView.hideColumn(0) if self.usermode == USERMODE.Standard: initialColResize(self.walletsView, [20, 0, 0.35, 0.2, 0.2]) else: initialColResize(self.walletsView, [20, 0.15, 0.30, 0.2, 0.20]) if self.settings.hasSetting('LastFilterState'): if self.settings.get('LastFilterState')==4: self.walletsView.showColumn(0) self.connect(self.walletsView, SIGNAL('doubleClicked(QModelIndex)'), self.execDlgWalletDetails) self.connect(self.walletsView, SIGNAL('clicked(QModelIndex)'), self.execClickRow) self.walletsView.setColumnWidth(WLTVIEWCOLS.Visible, 20) w,h = tightSizeNChar(GETFONT('var'), 100) # Prepare for tableView slices (i.e. "Showing 1 to 100 of 382", etc) self.numShowOpts = [100,250,500,1000,'All'] self.sortLedgOrder = Qt.AscendingOrder self.sortLedgCol = 0 self.currLedgMin = 1 self.currLedgMax = 100 self.currLedgWidth = 100 # Table to display ledger/activity self.ledgerTable = [] self.ledgerModel = LedgerDispModelSimple(self.ledgerTable, self, self) self.ledgerView = QTableView() self.ledgerView.setModel(self.ledgerModel) self.ledgerView.setSortingEnabled(True) self.ledgerView.setItemDelegate(LedgerDispDelegate(self)) self.ledgerView.setSelectionBehavior(QTableView.SelectRows) self.ledgerView.setSelectionMode(QTableView.SingleSelection) self.ledgerView.verticalHeader().setDefaultSectionSize(sectionSz) self.ledgerView.verticalHeader().hide() self.ledgerView.horizontalHeader().setResizeMode(0, QHeaderView.Fixed) self.ledgerView.horizontalHeader().setResizeMode(3, QHeaderView.Fixed) self.ledgerView.hideColumn(LEDGERCOLS.isOther) self.ledgerView.hideColumn(LEDGERCOLS.UnixTime) self.ledgerView.hideColumn(LEDGERCOLS.WltID) self.ledgerView.hideColumn(LEDGERCOLS.TxHash) self.ledgerView.hideColumn(LEDGERCOLS.isCoinbase) self.ledgerView.hideColumn(LEDGERCOLS.toSelf) self.ledgerView.hideColumn(LEDGERCOLS.DoubleSpend) # Another table and model, for lockboxes self.lockboxLedgTable = [] self.lockboxLedgModel = LedgerDispModelSimple(self.lockboxLedgTable, self, self, isLboxModel=True) dateWidth = tightSizeStr(self.ledgerView, '_9999-Dec-99 99:99pm__')[0] nameWidth = tightSizeStr(self.ledgerView, '9'*32)[0] cWidth = 20 # num-confirm icon width tWidth = 72 # date icon width initialColResize(self.ledgerView, [cWidth, 0, dateWidth, tWidth, 0.30, 0.40, 0.3]) self.connect(self.ledgerView, SIGNAL('doubleClicked(QModelIndex)'), \ self.dblClickLedger) self.ledgerView.setContextMenuPolicy(Qt.CustomContextMenu) self.ledgerView.customContextMenuRequested.connect(self.showContextMenuLedger) btnAddWallet = QPushButton("Create Wallet") btnImportWlt = QPushButton("Import or Restore Wallet") self.connect(btnAddWallet, SIGNAL('clicked()'), self.startWalletWizard) self.connect(btnImportWlt, SIGNAL('clicked()'), self.execImportWallet) # Put the Wallet info into it's own little box lblAvail = QLabel("Available Wallets:") viewHeader = makeLayoutFrame(HORIZONTAL, [lblAvail, \ 'Stretch', \ btnAddWallet, \ btnImportWlt, ]) wltFrame = QFrame() wltFrame.setFrameStyle(QFrame.Box|QFrame.Sunken) wltLayout = QGridLayout() wltLayout.addWidget(viewHeader, 0,0, 1,3) wltLayout.addWidget(self.walletsView, 1,0, 1,3) wltFrame.setLayout(wltLayout) # Make the bottom 2/3 a tabwidget self.mainDisplayTabs = QTabWidget() # Put the labels into scroll areas just in case window size is small. self.tabDashboard = QWidget() self.setupDashboard() # Combo box to filter ledger display self.comboWltSelect = QComboBox() self.populateLedgerComboBox() self.connect(self.ledgerView.horizontalHeader(), \ SIGNAL('sortIndicatorChanged(int,Qt::SortOrder)'), \ self.changeLedgerSorting) self.connect(self.comboWltSelect, SIGNAL('activated(int)'), self.changeWltFilter) self.lblTot = QRichLabel('Maximum Funds:', doWrap=False); self.lblSpd = QRichLabel('Spendable Funds:', doWrap=False); self.lblUcn = QRichLabel('Unconfirmed:', doWrap=False); self.lblTotalFunds = QRichLabel('-'*12, doWrap=False) self.lblSpendFunds = QRichLabel('-'*12, doWrap=False) self.lblUnconfFunds = QRichLabel('-'*12, doWrap=False) self.lblTotalFunds.setAlignment(Qt.AlignRight | Qt.AlignVCenter) self.lblSpendFunds.setAlignment(Qt.AlignRight | Qt.AlignVCenter) self.lblUnconfFunds.setAlignment(Qt.AlignRight | Qt.AlignVCenter) self.lblTot.setAlignment(Qt.AlignRight | Qt.AlignVCenter) self.lblSpd.setAlignment(Qt.AlignRight | Qt.AlignVCenter) self.lblUcn.setAlignment(Qt.AlignRight | Qt.AlignVCenter) self.lblBTC1 = QRichLabel('BTC', doWrap=False) self.lblBTC2 = QRichLabel('BTC', doWrap=False) self.lblBTC3 = QRichLabel('BTC', doWrap=False) self.ttipTot = self.createToolTipWidget( \ 'Funds if all current transactions are confirmed. ' 'Value appears gray when it is the same as your spendable funds.') self.ttipSpd = self.createToolTipWidget( 'Funds that can be spent right now') self.ttipUcn = self.createToolTipWidget( \ 'Funds that have less than 6 confirmations, and thus should not ' 'be considered yours, yet.') frmTotals = QFrame() frmTotals.setFrameStyle(STYLE_NONE) frmTotalsLayout = QGridLayout() frmTotalsLayout.addWidget(self.lblTot, 0,0) frmTotalsLayout.addWidget(self.lblSpd, 1,0) frmTotalsLayout.addWidget(self.lblUcn, 2,0) frmTotalsLayout.addWidget(self.lblTotalFunds, 0,1) frmTotalsLayout.addWidget(self.lblSpendFunds, 1,1) frmTotalsLayout.addWidget(self.lblUnconfFunds, 2,1) frmTotalsLayout.addWidget(self.lblBTC1, 0,2) frmTotalsLayout.addWidget(self.lblBTC2, 1,2) frmTotalsLayout.addWidget(self.lblBTC3, 2,2) frmTotalsLayout.addWidget(self.ttipTot, 0,3) frmTotalsLayout.addWidget(self.ttipSpd, 1,3) frmTotalsLayout.addWidget(self.ttipUcn, 2,3) frmTotals.setLayout(frmTotalsLayout) # Will fill this in when ledgers are created & combined self.lblLedgShowing = QRichLabel('Showing:', hAlign=Qt.AlignHCenter) self.lblLedgRange = QRichLabel('', hAlign=Qt.AlignHCenter) self.lblLedgTotal = QRichLabel('', hAlign=Qt.AlignHCenter) self.comboNumShow = QComboBox() for s in self.numShowOpts: self.comboNumShow.addItem( str(s) ) self.comboNumShow.setCurrentIndex(0) self.comboNumShow.setMaximumWidth( tightSizeStr(self, '_9999_')[0]+25 ) self.btnLedgUp = QLabelButton('') self.btnLedgUp.setMaximumHeight(20) self.btnLedgUp.setPixmap(QPixmap(':/scroll_up_18.png')) self.btnLedgUp.setAlignment(Qt.AlignVCenter | Qt.AlignHCenter) self.btnLedgUp.setVisible(False) self.btnLedgDn = QLabelButton('') self.btnLedgDn.setMaximumHeight(20) self.btnLedgDn.setPixmap(QPixmap(':/scroll_down_18.png')) self.btnLedgDn.setAlignment(Qt.AlignVCenter | Qt.AlignHCenter) self.connect(self.comboNumShow, SIGNAL('activated(int)'), self.changeNumShow) self.connect(self.btnLedgUp, SIGNAL('clicked()'), self.clickLedgUp) self.connect(self.btnLedgDn, SIGNAL('clicked()'), self.clickLedgDn) frmFilter = makeVertFrame([QLabel('Filter:'), self.comboWltSelect, 'Stretch']) self.frmLedgUpDown = QFrame() layoutUpDown = QGridLayout() layoutUpDown.addWidget(self.lblLedgShowing,0,0) layoutUpDown.addWidget(self.lblLedgRange, 1,0) layoutUpDown.addWidget(self.lblLedgTotal, 2,0) layoutUpDown.addWidget(self.btnLedgUp, 0,1) layoutUpDown.addWidget(self.comboNumShow, 1,1) layoutUpDown.addWidget(self.btnLedgDn, 2,1) layoutUpDown.setVerticalSpacing(2) self.frmLedgUpDown.setLayout(layoutUpDown) self.frmLedgUpDown.setFrameStyle(STYLE_SUNKEN) frmLower = makeHorizFrame([ frmFilter, \ 'Stretch', \ self.frmLedgUpDown, \ 'Stretch', \ frmTotals]) # Now add the ledger to the bottom of the window ledgFrame = QFrame() ledgFrame.setFrameStyle(QFrame.Box|QFrame.Sunken) ledgLayout = QGridLayout() ledgLayout.addWidget(self.ledgerView, 1,0) ledgLayout.addWidget(frmLower, 2,0) ledgLayout.setRowStretch(0, 0) ledgLayout.setRowStretch(1, 1) ledgLayout.setRowStretch(2, 0) ledgFrame.setLayout(ledgLayout) self.tabActivity = QWidget() self.tabActivity.setLayout(ledgLayout) self.tabAnnounce = QWidget() self.setupAnnounceTab() # Add the available tabs to the main tab widget self.MAINTABS = enum('Dash','Ledger','Announce') self.mainDisplayTabs.addTab(self.tabDashboard, 'Dashboard') self.mainDisplayTabs.addTab(self.tabActivity, 'Transactions') self.mainDisplayTabs.addTab(self.tabAnnounce, 'Announcements') ########################################################################## if USE_TESTNET and not CLI_OPTIONS.disableModules: self.loadArmoryModules() ########################################################################## btnSendBtc = QPushButton(tr("Send Bitcoins")) btnRecvBtc = QPushButton(tr("Receive Bitcoins")) btnWltProps = QPushButton(tr("Wallet Properties")) btnOfflineTx = QPushButton(tr("Offline Transactions")) btnMultisig = QPushButton(tr("Lockboxes (Multi-Sig)")) self.connect(btnWltProps, SIGNAL('clicked()'), self.execDlgWalletDetails) self.connect(btnRecvBtc, SIGNAL('clicked()'), self.clickReceiveCoins) self.connect(btnSendBtc, SIGNAL('clicked()'), self.clickSendBitcoins) self.connect(btnOfflineTx,SIGNAL('clicked()'), self.execOfflineTx) self.connect(btnMultisig, SIGNAL('clicked()'), self.browseLockboxes) verStr = 'Armory %s / %s User' % (getVersionString(BTCARMORY_VERSION), UserModeStr(self.usermode)) lblInfo = QRichLabel(verStr, doWrap=False) lblInfo.setFont(GETFONT('var',10)) lblInfo.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) logoBtnFrame = [] logoBtnFrame.append(self.lblLogoIcon) logoBtnFrame.append(btnSendBtc) logoBtnFrame.append(btnRecvBtc) logoBtnFrame.append(btnWltProps) if self.usermode in (USERMODE.Advanced, USERMODE.Expert): logoBtnFrame.append(btnOfflineTx) if self.usermode in (USERMODE.Expert,): logoBtnFrame.append(btnMultisig) logoBtnFrame.append(lblInfo) logoBtnFrame.append('Stretch') btnFrame = makeVertFrame(logoBtnFrame, STYLE_SUNKEN) logoWidth=220 btnFrame.sizeHint = lambda: QSize(logoWidth*1.0, 10) btnFrame.setMaximumWidth(logoWidth*1.2) btnFrame.setSizePolicy(QSizePolicy.Preferred, QSizePolicy.Expanding) layout = QGridLayout() layout.addWidget(btnFrame, 0, 0, 1, 1) layout.addWidget(wltFrame, 0, 1, 1, 1) layout.addWidget(self.mainDisplayTabs, 1, 0, 1, 2) layout.setRowStretch(0, 1) layout.setRowStretch(1, 5) # Attach the layout to the frame that will become the central widget mainFrame = QFrame() mainFrame.setLayout(layout) self.setCentralWidget(mainFrame) self.setMinimumSize(750,500) # Start the user at the dashboard self.mainDisplayTabs.setCurrentIndex(self.MAINTABS.Dash) ########################################################################## # Set up menu and actions #MENUS = enum('File', 'Wallet', 'User', "Tools", "Network") currmode = self.getSettingOrSetDefault('User_Mode', 'Advanced') MENUS = enum('File', 'User', 'Tools', 'Addresses', 'Wallets', \ 'MultiSig', 'Help') self.menu = self.menuBar() self.menusList = [] self.menusList.append( self.menu.addMenu('&File') ) self.menusList.append( self.menu.addMenu('&User') ) self.menusList.append( self.menu.addMenu('&Tools') ) self.menusList.append( self.menu.addMenu('&Addresses') ) self.menusList.append( self.menu.addMenu('&Wallets') ) self.menusList.append( self.menu.addMenu('&MultiSig') ) self.menusList.append( self.menu.addMenu('&Help') ) #self.menusList.append( self.menu.addMenu('&Network') ) def exportTx(): if not TheBDM.getBDMState()=='BlockchainReady': QMessageBox.warning(self, 'Transactions Unavailable', \ 'Transaction history cannot be collected until Armory is ' 'in online mode. Please try again when Armory is online. ', QMessageBox.Ok) return else: DlgExportTxHistory(self,self).exec_() actExportTx = self.createAction('&Export Transactions...', exportTx) actSettings = self.createAction('&Settings...', self.openSettings) actMinimApp = self.createAction('&Minimize Armory', self.minimizeArmory) actExportLog = self.createAction('Export &Log File...', self.exportLogFile) actCloseApp = self.createAction('&Quit Armory', self.closeForReal) self.menusList[MENUS.File].addAction(actExportTx) self.menusList[MENUS.File].addAction(actSettings) self.menusList[MENUS.File].addAction(actMinimApp) self.menusList[MENUS.File].addAction(actExportLog) self.menusList[MENUS.File].addAction(actCloseApp) def chngStd(b): if b: self.setUserMode(USERMODE.Standard) def chngAdv(b): if b: self.setUserMode(USERMODE.Advanced) def chngDev(b): if b: self.setUserMode(USERMODE.Expert) modeActGrp = QActionGroup(self) actSetModeStd = self.createAction('&Standard', chngStd, True) actSetModeAdv = self.createAction('&Advanced', chngAdv, True) actSetModeDev = self.createAction('&Expert', chngDev, True) modeActGrp.addAction(actSetModeStd) modeActGrp.addAction(actSetModeAdv) modeActGrp.addAction(actSetModeDev) self.menusList[MENUS.User].addAction(actSetModeStd) self.menusList[MENUS.User].addAction(actSetModeAdv) self.menusList[MENUS.User].addAction(actSetModeDev) LOGINFO('Usermode: %s', currmode) self.firstModeSwitch=True if currmode=='Standard': self.usermode = USERMODE.Standard actSetModeStd.setChecked(True) elif currmode=='Advanced': self.usermode = USERMODE.Advanced actSetModeAdv.setChecked(True) elif currmode=='Expert': self.usermode = USERMODE.Expert actSetModeDev.setChecked(True) def openMsgSigning(): MessageSigningVerificationDialog(self,self).exec_() def openBlindBroad(): if not satoshiIsAvailable(): QMessageBox.warning(self, tr("Not Online"), tr(""" Bitcoin Core is not available, so Armory will not be able to broadcast any transactions for you."""), QMessageBox.Ok) return DlgBroadcastBlindTx(self,self).exec_() actOpenSigner = self.createAction('&Message Signing/Verification...', openMsgSigning) if currmode=='Expert': actOpenTools = self.createAction('&EC Calculator...', lambda: DlgECDSACalc(self,self, 1).exec_()) actBlindBroad = self.createAction('&Broadcast Raw Transaction...', openBlindBroad) self.menusList[MENUS.Tools].addAction(actOpenSigner) if currmode=='Expert': self.menusList[MENUS.Tools].addAction(actOpenTools) self.menusList[MENUS.Tools].addAction(actBlindBroad) def mkprom(): if not TheBDM.getBDMState()=='BlockchainReady': QMessageBox.warning(self, tr('Offline'), tr(""" Armory is currently offline, and cannot determine what funds are available for simulfunding. Please try again when Armory is in online mode."""), QMessageBox.Ok) else: DlgCreatePromNote(self, self).exec_() def msrevsign(): title = tr('Import Multi-Spend Transaction') descr = tr(""" Import a signature-collector text block for review and signing. It is usually a block of text with "TXSIGCOLLECT" in the first line, or a *.sigcollect.tx file.""") ftypes = ['Signature Collectors (*.sigcollect.tx)'] dlgImport = DlgImportAsciiBlock(self, self, title, descr, ftypes, UnsignedTransaction) dlgImport.exec_() if dlgImport.returnObj: DlgMultiSpendReview(self, self, dlgImport.returnObj).exec_() simulMerge = lambda: DlgMergePromNotes(self, self).exec_() actMakeProm = self.createAction('Simulfund &Promissory Note', mkprom) actPromCollect = self.createAction('Simulfund &Collect && Merge', simulMerge) actMultiSpend = self.createAction('Simulfund &Review && Sign', msrevsign) if not self.usermode==USERMODE.Expert: self.menusList[MENUS.MultiSig].menuAction().setVisible(False) # Addresses actAddrBook = self.createAction('View &Address Book...', self.execAddressBook) actSweepKey = self.createAction('&Sweep Private Key/Address...', self.menuSelectSweepKey) actImportKey = self.createAction('&Import Private Key/Address...', self.menuSelectImportKey) self.menusList[MENUS.Addresses].addAction(actAddrBook) if not currmode=='Standard': self.menusList[MENUS.Addresses].addAction(actImportKey) self.menusList[MENUS.Addresses].addAction(actSweepKey) actCreateNew = self.createAction('&Create New Wallet', self.startWalletWizard) actImportWlt = self.createAction('&Import or Restore Wallet', self.execImportWallet) actAddressBook = self.createAction('View &Address Book', self.execAddressBook) actRecoverWlt = self.createAction('&Fix Damaged Wallet', self.RecoverWallet) #actRescanOnly = self.createAction('Rescan Blockchain', self.forceRescanDB) #actRebuildAll = self.createAction('Rescan with Database Rebuild', self.forceRebuildAndRescan) self.menusList[MENUS.Wallets].addAction(actCreateNew) self.menusList[MENUS.Wallets].addAction(actImportWlt) self.menusList[MENUS.Wallets].addSeparator() self.menusList[MENUS.Wallets].addAction(actRecoverWlt) #self.menusList[MENUS.Wallets].addAction(actRescanOnly) #self.menusList[MENUS.Wallets].addAction(actRebuildAll) #self.menusList[MENUS.Wallets].addAction(actMigrateSatoshi) #self.menusList[MENUS.Wallets].addAction(actAddressBook) def execVersion(): self.explicitCheckAnnouncements() self.mainDisplayTabs.setCurrentIndex(self.MAINTABS.Announce) execAbout = lambda: DlgHelpAbout(self).exec_() execTrouble = lambda: webbrowser.open('https://bitcoinarmory.com/troubleshooting/') execBugReport = lambda: DlgBugReport(self, self).exec_() execVerifySigned = lambda: VerifyOfflinePackageDialog(self, self).exec_() actAboutWindow = self.createAction(tr('&About Armory...'), execAbout) actVersionCheck = self.createAction(tr('Armory Version'), execVersion) actDownloadUpgrade = self.createAction(tr('Update Software...'), self.openDownloaderAll) actVerifySigned = self.createAction(tr('Verify Signed Package...'), execVerifySigned) actTroubleshoot = self.createAction(tr('Troubleshooting Armory'), execTrouble) actSubmitBug = self.createAction(tr('Submit Bug Report'), execBugReport) actClearMemPool = self.createAction(tr('Clear All Unconfirmed'), self.clearMemoryPool) actRescanDB = self.createAction(tr('Rescan Databases'), self.rescanNextLoad) actRebuildDB = self.createAction(tr('Rebuild and Rescan Databases'), self.rebuildNextLoad) actFactoryReset = self.createAction(tr('Factory Reset'), self.factoryReset) actPrivacyPolicy = self.createAction(tr('Armory Privacy Policy'), self.showPrivacyGeneric) self.menusList[MENUS.Help].addAction(actAboutWindow) self.menusList[MENUS.Help].addAction(actVersionCheck) self.menusList[MENUS.Help].addAction(actDownloadUpgrade) self.menusList[MENUS.Help].addAction(actVerifySigned) self.menusList[MENUS.Help].addSeparator() self.menusList[MENUS.Help].addAction(actTroubleshoot) self.menusList[MENUS.Help].addAction(actSubmitBug) self.menusList[MENUS.Help].addAction(actPrivacyPolicy) self.menusList[MENUS.Help].addSeparator() self.menusList[MENUS.Help].addAction(actClearMemPool) self.menusList[MENUS.Help].addAction(actRescanDB) self.menusList[MENUS.Help].addAction(actRebuildDB) self.menusList[MENUS.Help].addAction(actFactoryReset) execMSHack = lambda: DlgSelectMultiSigOption(self,self).exec_() execBrowse = lambda: DlgLockboxManager(self,self).exec_() actMultiHacker = self.createAction(tr('Multi-Sig Lockboxes'), execMSHack) actBrowseLockboxes = self.createAction(tr('Lockbox &Manager...'), execBrowse) #self.menusList[MENUS.MultiSig].addAction(actMultiHacker) self.menusList[MENUS.MultiSig].addAction(actBrowseLockboxes) self.menusList[MENUS.MultiSig].addAction(actMakeProm) self.menusList[MENUS.MultiSig].addAction(actPromCollect) self.menusList[MENUS.MultiSig].addAction(actMultiSpend) # Restore any main-window geometry saved in the settings file hexgeom = self.settings.get('MainGeometry') hexledgsz = self.settings.get('MainLedgerCols') hexwltsz = self.settings.get('MainWalletCols') if len(hexgeom)>0: geom = QByteArray.fromHex(hexgeom) self.restoreGeometry(geom) if len(hexwltsz)>0: restoreTableView(self.walletsView, hexwltsz) if len(hexledgsz)>0: restoreTableView(self.ledgerView, hexledgsz) self.ledgerView.setColumnWidth(LEDGERCOLS.NumConf, 20) self.ledgerView.setColumnWidth(LEDGERCOLS.TxDir, 72) haveGUI[0] = True haveGUI[1] = self BDMcurrentBlock[1] = 1 if DO_WALLET_CHECK: self.checkWallets() self.setDashboardDetails() from twisted.internet import reactor reactor.callLater(0.1, self.execIntroDialog) reactor.callLater(1, self.Heartbeat) if self.getSettingOrSetDefault('MinimizeOnOpen', False) and not CLI_ARGS: LOGINFO('MinimizeOnOpen is True') reactor.callLater(0, self.minimizeArmory) if CLI_ARGS: reactor.callLater(1, self.uriLinkClicked, CLI_ARGS[0]) #################################################### def getWatchingOnlyWallets(self): result = [] for wltID in self.walletIDList: if self.walletMap[wltID].watchingOnly: result.append(wltID) return result #################################################### def changeWltFilter(self): currIdx = max(self.comboWltSelect.currentIndex(), 0) currText = str(self.comboWltSelect.currentText()).lower() if currText.lower().startswith('custom filter'): self.walletsView.showColumn(0) else: self.walletsView.hideColumn(0) # If "custom" is selected, do nothing... if currIdx==4: return for i in range(len(self.walletVisibleList)): self.walletVisibleList[i] = False self.setWltSetting(self.walletIDList[i], 'LedgerShow', False) # If a specific wallet is selected, just set that and you're done if currIdx >= 4: self.walletVisibleList[currIdx-7] = True self.setWltSetting(self.walletIDList[currIdx-7], 'LedgerShow', True) else: # Else we walk through the wallets and flag the particular ones typelist = [[wid, determineWalletType(self.walletMap[wid], self)[0]] \ for wid in self.walletIDList] for i,winfo in enumerate(typelist): wid,wtype = winfo[:] if currIdx==0: # My wallets doShow = wtype in [WLTTYPES.Offline,WLTTYPES.Crypt,WLTTYPES.Plain] self.walletVisibleList[i] = doShow self.setWltSetting(wid, 'LedgerShow', doShow) elif currIdx==1: # Offline wallets doShow = winfo[1] in [WLTTYPES.Offline] self.walletVisibleList[i] = doShow self.setWltSetting(wid, 'LedgerShow', doShow) elif currIdx==2: # Others' Wallets doShow = winfo[1] in [WLTTYPES.WatchOnly] self.walletVisibleList[i] = doShow self.setWltSetting(wid, 'LedgerShow', doShow) elif currIdx==3: # All Wallets self.walletVisibleList[i] = True self.setWltSetting(wid, 'LedgerShow', True) self.walletsView.reset() self.createCombinedLedger() if self.frmLedgUpDown.isVisible(): self.changeNumShow() ############################################################################ def loadArmoryModules(self): """ This method checks for any .py files in the exec directory """ moduleDir = os.path.join(GetExecDir(), 'modules') if not moduleDir or not os.path.exists(moduleDir): return LOGWARN('Attempting to load modules from: %s' % moduleDir) from dynamicImport import getModuleList, dynamicImport # This call does not eval any code in the modules. It simply # loads the python files as raw chunks of text so we can # check hashes and signatures modMap = getModuleList(moduleDir) for name,infoMap in modMap.iteritems(): modPath = os.path.join(infoMap['SourceDir'], infoMap['Filename']) modHash = binary_to_hex(sha256(infoMap['SourceCode'])) isSignedByATI = False if 'Signature' in infoMap: """ Signature file contains multiple lines, of the form "key=value\n" The last line is the hex-encoded signature, which is over the source code + everything in the sig file up to the last line. The key-value lines may contain properties such as signature validity times/expiration, contact info of author, etc. """ sigFile = infoMap['SigData'] sigLines = [line.strip() for line in sigFile.strip().split('\n')] properties = dict([line.split('=') for line in sigLines[:-1]]) msgSigned = infoMap['SourceCode'] + '\x00' + '\n'.join(sigLines[:1]) sbdMsg = SecureBinaryData(sha256(msgSigned)) sbdSig = SecureBinaryData(hex_to_binary(sigLines[-1])) sbdPub = SecureBinaryData(hex_to_binary(ARMORY_INFO_SIGN_PUBLICKEY)) isSignedByATI = CryptoECDSA().VerifyData(sbdMsg, sbdSig, sbdPub) LOGWARN('Sig on "%s" is valid: %s' % (name, str(isSignedByATI))) if not isSignedByATI and not USE_TESTNET: reply = QMessageBox.warning(self, tr("UNSIGNED Module"), tr(""" Armory detected the following module which is unsigned and may be dangerous:

Module Name: %s
Module Path: %s
Module Hash: %s


You should never trust unsigned modules! At this time, Armory will not allow you to run this module unless you are in testnet mode.""") % \ (name, modPath, modHash[:16]), QMessageBox.Ok) if not reply==QMessageBox.Yes: continue module = dynamicImport(moduleDir, name, globals()) plugObj = module.PluginObject(self) if not hasattr(plugObj,'getTabToDisplay') or \ not hasattr(plugObj,'tabName'): LOGERROR('Module is malformed! No tabToDisplay or tabName attrs') QMessageBox.critical(self, tr("Bad Module"), tr(""" The module you attempted to load (%s) is malformed. It is missing attributes that are needed for Armory to load it. It will be skipped.""") % name, QMessageBox.Ok) continue verPluginInt = getVersionInt(readVersionString(plugObj.maxVersion)) verArmoryInt = getVersionInt(BTCARMORY_VERSION) if verArmoryInt >verPluginInt: reply = QMessageBox.warning(self, tr("Outdated Module"), tr(""" Module "%s" is only specified to work up to Armory version %s. You are using Armory version %s. Please remove the module if you experience any problems with it, or contact the maintainer for a new version.

Do you want to continue loading the module?"""), QMessageBox.Yes | QMessageBox.No) if not reply==QMessageBox.Yes: continue # All plugins should have "tabToDisplay" and "tabName" attributes LOGWARN('Adding module to tab list: "' + plugObj.tabName + '"') self.mainDisplayTabs.addTab(plugObj.getTabToDisplay(), plugObj.tabName) # Also inject any extra methods that will be injectFuncList = [ \ ['injectHeartbeatAlwaysFunc', 'extraHeartbeatAlways'], ['injectHeartbeatOnlineFunc', 'extraHeartbeatOnline'], ['injectGoOnlineFunc', 'extraGoOnlineFunctions'], ['injectNewTxFunc', 'extraNewTxFunctions'], ['injectNewBlockFunc', 'extraNewBlockFunctions'], ['injectShutdownFunc', 'extraShutdownFunctions'] ] # Add any methods for plugFuncName,funcListName in injectFuncList: if not hasattr(plugObj, plugFuncName): continue if not hasattr(self, funcListName): LOGERROR('Missing an ArmoryQt list variable: %s' % funcListName) continue LOGINFO('Found module function: %s' % plugFuncName) funcList = getattr(self, funcListName) plugFunc = getattr(plugObj, plugFuncName) funcList.append(plugFunc) ############################################################################ def factoryReset(self): """ reply = QMessageBox.information(self,'Factory Reset', \ 'You are about to revert all Armory settings ' 'to the state they were in when Armory was first installed. ' '

' 'If you click "Yes," Armory will exit after settings are ' 'reverted. You will have to manually start Armory again.' '

' 'Do you want to continue? ', \ QMessageBox.Yes | QMessageBox.No) if reply==QMessageBox.Yes: self.removeSettingsOnClose = True self.closeForReal() """ if DlgFactoryReset(self,self).exec_(): # The dialog already wrote all the flag files, just close now self.closeForReal() #################################################### def showPrivacyGeneric(self): DlgPrivacyPolicy().exec_() #################################################### def clearMemoryPool(self): touchFile( os.path.join(ARMORY_HOME_DIR, 'clearmempool.flag') ) msg = tr(""" The next time you restart Armory, all unconfirmed transactions will be cleared allowing you to retry any stuck transactions.""") if not self.doAutoBitcoind: msg += tr("""

Make sure you also restart Bitcoin-Qt (or bitcoind) and let it synchronize again before you restart Armory. Doing so will clear its memory pool, as well""") QMessageBox.information(self, tr('Memory Pool'), msg, QMessageBox.Ok) #################################################### def registerWidgetActivateTime(self, widget): # This is a bit of a hack, but it's a very isolated method to make # it easy to link widgets to my entropy accumulator # I just realized this doesn't do exactly what I originally intended... # I wanted it to work on arbitrary widgets like QLineEdits, but using # super is not the answer. What I want is the original class method # to be called after logging keypress, not its superclass method. # Nonetheless, it does do what I need it to, as long as you only # registered frames and dialogs, not individual widgets/controls. mainWindow = self def newKPE(wself, event=None): mainWindow.logEntropy() super(wself.__class__, wself).keyPressEvent(event) def newKRE(wself, event=None): mainWindow.logEntropy() super(wself.__class__, wself).keyReleaseEvent(event) def newMPE(wself, event=None): mainWindow.logEntropy() super(wself.__class__, wself).mousePressEvent(event) def newMRE(wself, event=None): mainWindow.logEntropy() super(wself.__class__, wself).mouseReleaseEvent(event) from types import MethodType widget.keyPressEvent = MethodType(newKPE, widget) widget.keyReleaseEvent = MethodType(newKRE, widget) widget.mousePressEvent = MethodType(newMPE, widget) widget.mouseReleaseEvent = MethodType(newMRE, widget) #################################################### def logEntropy(self): try: self.entropyAccum.append(RightNow()) self.entropyAccum.append(QCursor.pos().x()) self.entropyAccum.append(QCursor.pos().y()) except: LOGEXCEPT('Error logging keypress entropy') #################################################### def getExtraEntropyForKeyGen(self): # The entropyAccum var has all the timestamps, down to the microsecond, # of every keypress and mouseclick made during the wallet creation # wizard. Also logs mouse positions on every press, though it will # be constant while typing. Either way, even, if they change no text # and use a 5-char password, we will still pickup about 40 events. # Then we throw in the [name,time,size] triplets of some volatile # system directories, and the hash of a file in that directory that # is expected to have timestamps and system-dependent parameters. # Finally, take a desktop screenshot... # All three of these source are likely to have sufficient entropy alone. source1,self.entropyAccum = self.entropyAccum,[] if len(source1)==0: LOGERROR('Error getting extra entropy from mouse & key presses') source2 = [] try: if OS_WINDOWS: tempDir = os.getenv('TEMP') extraFiles = [] elif OS_LINUX: tempDir = '/var/log' extraFiles = ['/var/log/Xorg.0.log'] elif OS_MACOSX: tempDir = '/var/log' extraFiles = ['/var/log/system.log'] # A simple listing of the directory files, sizes and times is good if os.path.exists(tempDir): for fname in os.listdir(tempDir): fullpath = os.path.join(tempDir, fname) sz = os.path.getsize(fullpath) tm = os.path.getmtime(fullpath) source2.append([fname, sz, tm]) # On Linux we also throw in Xorg.0.log for f in extraFiles: if os.path.exists(f): with open(f,'rb') as infile: source2.append(hash256(infile.read())) if len(source2)==0: LOGWARN('Second source of supplemental entropy will be empty') except: LOGEXCEPT('Error getting extra entropy from filesystem') source3 = '' try: pixDesk = QPixmap.grabWindow(QApplication.desktop().winId()) pixRaw = QByteArray() pixBuf = QBuffer(pixRaw) pixBuf.open(QIODevice.WriteOnly) pixDesk.save(pixBuf, 'PNG') source3 = pixBuf.buffer().toHex() except: LOGEXCEPT('Third source of entropy (desktop screenshot) failed') if len(source3)==0: LOGWARN('Error getting extra entropy from screenshot') LOGINFO('Adding %d keypress events to the entropy pool', len(source1)/3) LOGINFO('Adding %s bytes of filesystem data to the entropy pool', bytesToHumanSize(len(str(source2)))) LOGINFO('Adding %s bytes from desktop screenshot to the entropy pool', bytesToHumanSize(len(str(source3))/2)) allEntropy = ''.join([str(a) for a in [source1, source1, source3]]) return SecureBinaryData(HMAC256('Armory Entropy', allEntropy)) #################################################### def rescanNextLoad(self): reply = QMessageBox.warning(self, tr('Queue Rescan?'), tr(""" The next time you restart Armory, it will rescan the blockchain database, and reconstruct your wallet histories from scratch. The rescan will take 10-60 minutes depending on your system.

Do you wish to force a rescan on the next Armory restart?"""), \ QMessageBox.Yes | QMessageBox.No) if reply==QMessageBox.Yes: touchFile( os.path.join(ARMORY_HOME_DIR, 'rescan.flag') ) #################################################### def rebuildNextLoad(self): reply = QMessageBox.warning(self, tr('Queue Rebuild?'), tr(""" The next time you restart Armory, it will rebuild and rescan the entire blockchain database. This operation can take between 30 minutes and 4 hours depending on you system speed.

Do you wish to force a rebuild on the next Armory restart?"""), \ QMessageBox.Yes | QMessageBox.No) if reply==QMessageBox.Yes: touchFile( os.path.join(ARMORY_HOME_DIR, 'rebuild.flag') ) #################################################### def loadFailedManyTimesFunc(self, nFail): """ For now, if the user is having trouble loading the blockchain, all we do is delete mempool.bin (which is frequently corrupted but not detected as such. However, we may expand this in the future, if it's determined that more-complicated things are necessary. """ LOGERROR('%d attempts to load blockchain failed. Remove mempool.bin.' % nFail) mempoolfile = os.path.join(ARMORY_HOME_DIR,'mempool.bin') if os.path.exists(mempoolfile): os.remove(mempoolfile) else: LOGERROR('File mempool.bin does not exist. Nothing deleted.') #################################################### def menuSelectImportKey(self): QMessageBox.information(self, 'Select Wallet', \ 'You must import an address into a specific wallet. If ' 'you do not want to import the key into any available wallet, ' 'it is recommeneded you make a new wallet for this purpose.' '

' 'Double-click on the desired wallet from the main window, then ' 'click on "Import/Sweep Private Keys" on the bottom-right ' 'of the properties window.' '

' 'Keys cannot be imported into watching-only wallets, only full ' 'wallets.', QMessageBox.Ok) #################################################### def menuSelectSweepKey(self): QMessageBox.information(self, 'Select Wallet', \ 'You must select a wallet into which funds will be swept. ' 'Double-click on the desired wallet from the main window, then ' 'click on "Import/Sweep Private Keys" on the bottom-right ' 'of the properties window to sweep to that wallet.' '

' 'Keys cannot be swept into watching-only wallets, only full ' 'wallets.', QMessageBox.Ok) #################################################### def changeNumShow(self): prefWidth = self.numShowOpts[self.comboNumShow.currentIndex()] if prefWidth=='All': self.currLedgMin = 1; self.currLedgMax = self.ledgerSize self.currLedgWidth = -1; else: self.currLedgMax = self.currLedgMin + prefWidth - 1 self.currLedgWidth = prefWidth self.applyLedgerRange() #################################################### def clickLedgUp(self): self.currLedgMin -= self.currLedgWidth self.currLedgMax -= self.currLedgWidth self.applyLedgerRange() #################################################### def clickLedgDn(self): self.currLedgMin += self.currLedgWidth self.currLedgMax += self.currLedgWidth self.applyLedgerRange() #################################################### def applyLedgerRange(self): if self.currLedgMin < 1: toAdd = 1 - self.currLedgMin self.currLedgMin += toAdd self.currLedgMax += toAdd if self.currLedgMax > self.ledgerSize: toSub = self.currLedgMax - self.ledgerSize self.currLedgMin -= toSub self.currLedgMax -= toSub self.currLedgMin = max(self.currLedgMin, 1) self.btnLedgUp.setVisible(self.currLedgMin!=1) self.btnLedgDn.setVisible(self.currLedgMax!=self.ledgerSize) self.createCombinedLedger() #################################################### def openSettings(self): LOGDEBUG('openSettings') dlgSettings = DlgSettings(self, self) dlgSettings.exec_() #################################################### def setupSystemTray(self): LOGDEBUG('setupSystemTray') # Creating a QSystemTray self.sysTray = QSystemTrayIcon(self) self.sysTray.setIcon( QIcon(self.iconfile) ) self.sysTray.setVisible(True) self.sysTray.setToolTip('Armory' + (' [Testnet]' if USE_TESTNET else '')) self.connect(self.sysTray, SIGNAL('messageClicked()'), self.bringArmoryToFront) self.connect(self.sysTray, SIGNAL('activated(QSystemTrayIcon::ActivationReason)'), \ self.sysTrayActivated) menu = QMenu(self) def traySend(): self.bringArmoryToFront() self.clickSendBitcoins() def trayRecv(): self.bringArmoryToFront() self.clickReceiveCoins() actShowArmory = self.createAction('Show Armory', self.bringArmoryToFront) actSendBtc = self.createAction('Send Bitcoins', traySend) actRcvBtc = self.createAction('Receive Bitcoins', trayRecv) actClose = self.createAction('Quit Armory', self.closeForReal) # Create a short menu of options menu.addAction(actShowArmory) menu.addAction(actSendBtc) menu.addAction(actRcvBtc) menu.addSeparator() menu.addAction(actClose) self.sysTray.setContextMenu(menu) self.notifyQueue = [] self.notifyBlockedUntil = 0 ############################################################################# @AllowAsync def registerBitcoinWithFF(self): #the 3 nodes needed to add to register bitcoin as a protocol in FF rdfschemehandler = 'about=\"urn:scheme:handler:bitcoin\"' rdfscheme = 'about=\"urn:scheme:bitcoin\"' rdfexternalApp = 'about=\"urn:scheme:externalApplication:bitcoin\"' #find mimeTypes.rdf file home = os.getenv('HOME') out,err = execAndWait('find %s -type f -name \"mimeTypes.rdf\"' % home) for rdfs in out.split('\n'): if rdfs: try: FFrdf = open(rdfs, 'r+') except: continue ct = FFrdf.readlines() rdfsch=-1 rdfsc=-1 rdfea=-1 i=0 #look for the nodes for line in ct: if rdfschemehandler in line: rdfsch=i elif rdfscheme in line: rdfsc=i elif rdfexternalApp in line: rdfea=i i+=1 #seek to end of file FFrdf.seek(-11, 2) i=0; #add the missing nodes if rdfsch == -1: FFrdf.write(' \n') FFrdf.write(' \n') FFrdf.write(' \n') FFrdf.write(' \n') i+=1 if rdfsc == -1: FFrdf.write(' \n') FFrdf.write(' \n') FFrdf.write(' \n') i+=1 if rdfea == -1: FFrdf.write(' \n') i+=1 if i != 0: FFrdf.write('\n') FFrdf.close() ############################################################################# def setupUriRegistration(self, justDoIt=False): """ Setup Armory as the default application for handling bitcoin: links """ LOGINFO('setupUriRegistration') if USE_TESTNET: return if OS_LINUX: out,err = execAndWait('gconftool-2 --get /desktop/gnome/url-handlers/bitcoin/command') out2,err = execAndWait('xdg-mime query default x-scheme-handler/bitcoin') #check FF protocol association #checkFF_thread = threading.Thread(target=self.registerBitcoinWithFF) #checkFF_thread.start() self.registerBitcoinWithFF(async=True) def setAsDefault(): LOGINFO('Setting up Armory as default URI handler...') execAndWait('gconftool-2 -t string -s /desktop/gnome/url-handlers/bitcoin/command "python /usr/lib/armory/ArmoryQt.py \"%s\""') execAndWait('gconftool-2 -s /desktop/gnome/url-handlers/bitcoin/needs_terminal false -t bool') execAndWait('gconftool-2 -t bool -s /desktop/gnome/url-handlers/bitcoin/enabled true') execAndWait('xdg-mime default armory.desktop x-scheme-handler/bitcoin') if ('no value' in out.lower() or 'no value' in err.lower()) and not 'armory.desktop' in out2.lower(): # Silently add Armory if it's never been set before setAsDefault() elif (not 'armory' in out.lower() or not 'armory.desktop' in out2.lower()) and not self.firstLoad: # If another application has it, ask for permission to change it # Don't bother the user on the first load with it if verification is # needed. They have enough to worry about with this weird new program... if not self.getSettingOrSetDefault('DNAA_DefaultApp', False): reply = MsgBoxWithDNAA(MSGBOX.Question, 'Default URL Handler', \ 'Armory is not set as your default application for handling ' '"bitcoin:" links. Would you like to use Armory as the ' 'default?', 'Do not ask this question again') if reply[0]==True: setAsDefault() if reply[1]==True: self.writeSetting('DNAA_DefaultApp', True) elif OS_WINDOWS: # Check for existing registration (user first, then root, if necessary) action = 'DoNothing' modulepathname = '"' if getattr(sys, 'frozen', False): app_dir = os.path.dirname(sys.executable) app_path = os.path.join(app_dir, sys.executable) elif __file__: return #running from a .py script, not gonna register URI on Windows #justDoIt = True import ctypes GetModuleFileNameW = ctypes.windll.kernel32.GetModuleFileNameW GetModuleFileNameW.restype = ctypes.c_int app_path = ctypes.create_string_buffer(1024) rtlength = ctypes.c_int() rtlength = GetModuleFileNameW(None, ctypes.byref(app_path), 1024) passstr = str(app_path.raw) modulepathname += unicode(passstr[0:(rtlength*2)], encoding='utf16') + u'" "%1"' modulepathname = modulepathname.encode('utf8') rootKey = 'bitcoin\\shell\\open\\command' try: userKey = 'Software\\Classes\\' + rootKey registryKey = OpenKey(HKEY_CURRENT_USER, userKey, 0, KEY_READ) val,code = QueryValueEx(registryKey, '') if 'armory' in val.lower(): if val.lower()==modulepathname.lower(): LOGINFO('Armory already registered for current user. Done!') return else: action = 'DoIt' #armory is registered, but to another path else: # Already set to something (at least created, which is enough) action = 'AskUser' except: # No user-key set, check if root-key is set try: registryKey = OpenKey(HKEY_CLASSES_ROOT, rootKey, 0, KEY_READ) val,code = QueryValueEx(registryKey, '') if 'armory' in val.lower(): LOGINFO('Armory already registered at admin level. Done!') return else: # Root key is set (or at least created, which is enough) action = 'AskUser' except: action = 'DoIt' dontAsk = self.getSettingOrSetDefault('DNAA_DefaultApp', False) dontAskDefault = self.getSettingOrSetDefault('AlwaysArmoryURI', False) if justDoIt: LOGINFO('URL-register: just doing it') action = 'DoIt' elif dontAsk and dontAskDefault: LOGINFO('URL-register: user wants to do it by default') action = 'DoIt' elif action=='AskUser' and not self.firstLoad and not dontAsk: # If another application has it, ask for permission to change it # Don't bother the user on the first load with it if verification is # needed. They have enough to worry about with this weird new program... reply = MsgBoxWithDNAA(MSGBOX.Question, 'Default URL Handler', \ 'Armory is not set as your default application for handling ' '"bitcoin:" links. Would you like to use Armory as the ' 'default?', 'Do not ask this question again') if reply[1]==True: LOGINFO('URL-register: do not ask again: always %s', str(reply[0])) self.writeSetting('DNAA_DefaultApp', True) self.writeSetting('AlwaysArmoryURI', reply[0]) if reply[0]==True: action = 'DoIt' else: LOGINFO('User requested not to use Armory as URI handler') return # Finally, do it if we're supposed to! LOGINFO('URL-register action: %s', action) if action=='DoIt': LOGINFO('Registering Armory for current user') baseDir = os.path.dirname(unicode(passstr[0:(rtlength*2)], encoding='utf16')) regKeys = [] regKeys.append(['Software\\Classes\\bitcoin', '', 'URL:bitcoin Protocol']) regKeys.append(['Software\\Classes\\bitcoin', 'URL Protocol', ""]) regKeys.append(['Software\\Classes\\bitcoin\\shell', '', None]) regKeys.append(['Software\\Classes\\bitcoin\\shell\\open', '', None]) for key,name,val in regKeys: dkey = '%s\\%s' % (key,name) LOGINFO('\tWriting key: [HKEY_CURRENT_USER\\] ' + dkey) registryKey = CreateKey(HKEY_CURRENT_USER, key) SetValueEx(registryKey, name, 0, REG_SZ, val) CloseKey(registryKey) regKeysU = [] regKeysU.append(['Software\\Classes\\bitcoin\\shell\\open\\command', '', \ modulepathname]) regKeysU.append(['Software\\Classes\\bitcoin\\DefaultIcon', '', \ '"%s\\armory48x48.ico"' % baseDir]) for key,name,val in regKeysU: dkey = '%s\\%s' % (key,name) LOGINFO('\tWriting key: [HKEY_CURRENT_USER\\] ' + dkey) registryKey = CreateKey(HKEY_CURRENT_USER, key) #hKey = ctypes.c_int(registryKey.handle) #ctypes.windll.Advapi32.RegSetValueEx(hKey, None, 0, REG_SZ, val, (len(val)+1)) SetValueEx(registryKey, name, 0, REG_SZ, val) CloseKey(registryKey) ############################################################################# def warnNewUSTXFormat(self): if not self.getSettingOrSetDefault('DNAA_Version092Warn', False): reply = MsgBoxWithDNAA(MSGBOX.Warning, tr("Version Warning"), tr(""" Since Armory version 0.92 the formats for offline transaction operations has changed to accommodate multi-signature transactions. This format is not compatible with versions of Armory before 0.92.

To continue, the other system will need to be upgraded to to version 0.92 or later. If you cannot upgrade the other system, you will need to reinstall an older version of Armory on this system."""), dnaaMsg='Do not show this warning again') self.writeSetting('DNAA_Version092Warn', reply[1]) ############################################################################# def execOfflineTx(self): self.warnNewUSTXFormat() dlgSelect = DlgOfflineSelect(self, self) if dlgSelect.exec_(): # If we got here, one of three buttons was clicked. if dlgSelect.do_create: DlgSendBitcoins(self.getSelectedWallet(), self, self, onlyOfflineWallets=True).exec_() elif dlgSelect.do_broadc: DlgSignBroadcastOfflineTx(self,self).exec_() ############################################################################# def sizeHint(self): return QSize(1000, 650) ############################################################################# def openToolsDlg(self): QMessageBox.information(self, 'No Tools Yet!', \ 'The developer tools are not available yet, but will be added ' 'soon. Regardless, developer-mode still offers lots of ' 'extra information and functionality that is not available in ' 'Standard or Advanced mode.', QMessageBox.Ok) ############################################################################# def execIntroDialog(self): if not self.getSettingOrSetDefault('DNAA_IntroDialog', False): dlg = DlgIntroMessage(self, self) result = dlg.exec_() if dlg.chkDnaaIntroDlg.isChecked(): self.writeSetting('DNAA_IntroDialog', True) if dlg.requestCreate: self.startWalletWizard() if dlg.requestImport: self.execImportWallet() ############################################################################# def makeWalletCopy(self, parent, wlt, copyType='Same', suffix='', changePass=False): '''Create a digital backup of your wallet.''' if changePass: LOGERROR('Changing password is not implemented yet!') raise NotImplementedError # Set the file name. if copyType.lower()=='pkcc': fn = 'armory_%s.%s' % (wlt.uniqueIDB58, suffix) else: fn = 'armory_%s_%s.wallet' % (wlt.uniqueIDB58, suffix) if wlt.watchingOnly and copyType.lower() != 'pkcc': fn = 'armory_%s_%s.watchonly.wallet' % (wlt.uniqueIDB58, suffix) savePath = unicode(self.getFileSave(defaultFilename=fn)) if not len(savePath)>0: return False # Create the file based on the type you want. if copyType.lower()=='same': wlt.writeFreshWalletFile(savePath) elif copyType.lower()=='decrypt': if wlt.useEncryption: dlg = DlgUnlockWallet(wlt, parent, self, 'Unlock Private Keys') if not dlg.exec_(): return False # Wallet should now be unlocked wlt.makeUnencryptedWalletCopy(savePath) elif copyType.lower()=='encrypt': newPassphrase=None if not wlt.useEncryption: dlgCrypt = DlgChangePassphrase(parent, self, not wlt.useEncryption) if not dlgCrypt.exec_(): QMessageBox.information(parent, tr('Aborted'), tr(""" No passphrase was selected for the encrypted backup. No backup was created"""), QMessageBox.Ok) newPassphrase = SecureBinaryData(str(dlgCrypt.edtPasswd1.text())) wlt.makeEncryptedWalletCopy(savePath, newPassphrase) elif copyType.lower() == 'pkcc': wlt.writePKCCFile(savePath) else: LOGERROR('Invalid "copyType" supplied to makeWalletCopy: %s', copyType) return False QMessageBox.information(parent, tr('Backup Complete'), tr(""" Your wallet was successfully backed up to the following location:

%s""") % savePath, QMessageBox.Ok) return True ############################################################################# def createAction(self, txt, slot, isCheckable=False, \ ttip=None, iconpath=None, shortcut=None): """ Modeled from the "Rapid GUI Programming with Python and Qt" book, page 174 """ icon = QIcon() if iconpath: icon = QIcon(iconpath) theAction = QAction(icon, txt, self) if isCheckable: theAction.setCheckable(True) self.connect(theAction, SIGNAL('toggled(bool)'), slot) else: self.connect(theAction, SIGNAL('triggered()'), slot) if ttip: theAction.setToolTip(ttip) theAction.setStatusTip(ttip) if shortcut: theAction.setShortcut(shortcut) return theAction ############################################################################# def setUserMode(self, mode): LOGINFO('Changing usermode:') LOGINFO(' From: %s', self.settings.get('User_Mode')) self.usermode = mode if mode==USERMODE.Standard: self.writeSetting('User_Mode', 'Standard') if mode==USERMODE.Advanced: self.writeSetting('User_Mode', 'Advanced') if mode==USERMODE.Expert: self.writeSetting('User_Mode', 'Expert') LOGINFO(' To: %s', self.settings.get('User_Mode')) if not self.firstModeSwitch: QMessageBox.information(self,'Restart Armory', \ 'You may have to restart Armory for all aspects of ' 'the new usermode to go into effect.', QMessageBox.Ok) self.firstModeSwitch = False ############################################################################# def getPreferredDateFormat(self): # Treat the format as "binary" to make sure any special symbols don't # interfere with the SettingsFile symbols globalDefault = binary_to_hex(DEFAULT_DATE_FORMAT) fmt = self.getSettingOrSetDefault('DateFormat', globalDefault) return hex_to_binary(str(fmt)) # short hex strings could look like int() ############################################################################# def setPreferredDateFormat(self, fmtStr): # Treat the format as "binary" to make sure any special symbols don't # interfere with the SettingsFile symbols try: unixTimeToFormatStr(1000000000, fmtStr) except: QMessageBox.warning(self, 'Invalid Date Format', \ 'The date format you specified was not valid. Please re-enter ' 'it using only the strftime symbols shown in the help text.', \ QMessageBox.Ok) return False self.writeSetting('DateFormat', binary_to_hex(fmtStr)) return True ############################################################################# def setupAnnouncementFetcher(self): # Decide if disable OS/version reporting sent with announce fetches skipStats1 = self.getSettingOrSetDefault('SkipStatsReport', False) skipStats2 = CLI_OPTIONS.skipStatsReport self.skipStatsReport = skipStats1 or skipStats2 # This determines if we should disable all of it skipChk1 = self.getSettingOrSetDefault('SkipAnnounceCheck', False) skipChk2 = CLI_OPTIONS.skipAnnounceCheck skipChk3 = CLI_OPTIONS.offline and not CLI_OPTIONS.testAnnounceCode skipChk4 = CLI_OPTIONS.useTorSettings skipChk5 = self.getSettingOrSetDefault('UseTorSettings', False) self.skipAnnounceCheck = \ skipChk1 or skipChk2 or skipChk3 or skipChk4 or skipChk5 url1 = ANNOUNCE_URL url2 = ANNOUNCE_URL_BACKUP fetchPath = os.path.join(ARMORY_HOME_DIR, 'atisignedannounce') if self.announceFetcher is None: # We keep an ID in the settings file that can be used by ATI's # statistics aggregator to remove duplicate reports. We store # the month&year that the ID was generated, so that we can change # it every month for privacy reasons idData = self.getSettingOrSetDefault('MonthlyID', '0000_00000000') storedYM,currID = idData.split('_') monthyear = unixTimeToFormatStr(RightNow(), '%m%y') if not storedYM == monthyear: currID = SecureBinaryData().GenerateRandom(4).toHexStr() self.settings.set('MonthlyID', '%s_%s' % (monthyear, currID)) self.announceFetcher = AnnounceDataFetcher(url1, url2, fetchPath, currID) self.announceFetcher.setStatsDisable(self.skipStatsReport) self.announceFetcher.setFullyDisabled(self.skipAnnounceCheck) self.announceFetcher.start() # Set last-updated vals to zero to force processing at startup for fid in ['changelog, downloads','notify','bootstrap']: self.lastAnnounceUpdate[fid] = 0 # If we recently updated the settings to enable or disable checking... if not self.announceFetcher.isRunning() and not self.skipAnnounceCheck: self.announceFetcher.setFullyDisabled(False) self.announceFetcher.setFetchInterval(DEFAULT_FETCH_INTERVAL) self.announceFetcher.start() elif self.announceFetcher.isRunning() and self.skipAnnounceCheck: self.announceFetcher.setFullyDisabled(True) self.announceFetcher.shutdown() ############################################################################# def processAnnounceData(self, forceCheck=False, forceWait=5): adf = self.announceFetcher # The ADF always fetches everything all the time. If forced, do the # regular fetch first, then examine the individual files without forcing if forceCheck: adf.fetchRightNow(forceWait) # Check each of the individual files for recent modifications idFuncPairs = [ ['announce', self.updateAnnounceTab], ['changelog', self.processChangelog], ['downloads', self.processDownloads], ['notify', self.processNotifications], ['bootstrap', self.processBootstrap] ] # If modified recently for fid,func in idFuncPairs: if not fid in self.lastAnnounceUpdate or \ adf.getFileModTime(fid) > self.lastAnnounceUpdate[fid]: self.lastAnnounceUpdate[fid] = RightNow() fileText = adf.getAnnounceFile(fid) func(fileText) ############################################################################# def processChangelog(self, txt): try: clp = changelogParser() self.changelog = clp.parseChangelogText(txt) except: # Don't crash on an error, but do log what happened LOGEXCEPT('Failed to parse changelog data') ############################################################################# def processDownloads(self, txt): try: dlp = downloadLinkParser() self.downloadLinks = dlp.parseDownloadList(txt) if self.downloadLinks is None: return thisVer = getVersionInt(BTCARMORY_VERSION) # Check ARMORY versions if not 'Armory' in self.downloadLinks: LOGWARN('No Armory links in the downloads list') else: maxVer = 0 self.versionNotification = {} for verStr,vermap in self.downloadLinks['Armory'].iteritems(): dlVer = getVersionInt(readVersionString(verStr)) if dlVer > maxVer: maxVer = dlVer self.armoryVersions[1] = verStr if thisVer >= maxVer: continue shortDescr = tr('Armory version %s is now available!') % verStr notifyID = binary_to_hex(hash256(shortDescr)[:4]) self.versionNotification['UNIQUEID'] = notifyID self.versionNotification['VERSION'] = '0' self.versionNotification['STARTTIME'] = '0' self.versionNotification['EXPIRES'] = '%d' % long(UINT64_MAX) self.versionNotification['CANCELID'] = '[]' self.versionNotification['MINVERSION'] = '*' self.versionNotification['MAXVERSION'] = '<%s' % verStr self.versionNotification['PRIORITY'] = '3072' self.versionNotification['ALERTTYPE'] = 'Upgrade' self.versionNotification['NOTIFYSEND'] = 'False' self.versionNotification['NOTIFYRECV'] = 'False' self.versionNotification['SHORTDESCR'] = shortDescr self.versionNotification['LONGDESCR'] = \ self.getVersionNotifyLongDescr(verStr).replace('\n','
') if 'ArmoryTesting' in self.downloadLinks: for verStr,vermap in self.downloadLinks['ArmoryTesting'].iteritems(): dlVer = getVersionInt(readVersionString(verStr)) if dlVer > maxVer: maxVer = dlVer self.armoryVersions[1] = verStr if thisVer >= maxVer: continue shortDescr = tr('Armory Testing version %s is now available!') % verStr notifyID = binary_to_hex(hash256(shortDescr)[:4]) self.versionNotification['UNIQUEID'] = notifyID self.versionNotification['VERSION'] = '0' self.versionNotification['STARTTIME'] = '0' self.versionNotification['EXPIRES'] = '%d' % long(UINT64_MAX) self.versionNotification['CANCELID'] = '[]' self.versionNotification['MINVERSION'] = '*' self.versionNotification['MAXVERSION'] = '<%s' % verStr self.versionNotification['PRIORITY'] = '1024' self.versionNotification['ALERTTYPE'] = 'upgrade-testing' self.versionNotification['NOTIFYSEND'] = 'False' self.versionNotification['NOTIFYRECV'] = 'False' self.versionNotification['SHORTDESCR'] = shortDescr self.versionNotification['LONGDESCR'] = \ self.getVersionNotifyLongDescr(verStr, True).replace('\n','
') # For Satoshi updates, we don't trigger any notifications like we # do for Armory above -- we will release a proper announcement if # necessary. But we want to set a flag to if not 'Satoshi' in self.downloadLinks: LOGWARN('No Satoshi links in the downloads list') else: try: maxVer = 0 for verStr,vermap in self.downloadLinks['Satoshi'].iteritems(): dlVer = getVersionInt(readVersionString(verStr)) if dlVer > maxVer: maxVer = dlVer self.satoshiVersions[1] = verStr if not self.NetworkingFactory: return # This is to detect the running versions of Bitcoin-Qt/bitcoind thisVerStr = self.NetworkingFactory.proto.peerInfo['subver'] thisVerStr = thisVerStr.strip('/').split(':')[-1] if sum([0 if c in '0123456789.' else 1 for c in thisVerStr]) > 0: return self.satoshiVersions[0] = thisVerStr except: pass except: # Don't crash on an error, but do log what happened LOGEXCEPT('Failed to parse download link data') ############################################################################# def getVersionNotifyLongDescr(self, verStr, testing=False): shortOS = None if OS_WINDOWS: shortOS = 'windows' elif OS_LINUX: shortOS = 'ubuntu' elif OS_MACOSX: shortOS = 'mac' webURL = 'https://bitcoinarmory.com/download/' if shortOS is not None: webURL += '#' + shortOS if testing: return tr(""" A new testing version of Armory is out. You can upgrade to version %s through our secure downloader inside Armory (link at the bottom of this notification window). """) % (verStr) return tr(""" Your version of Armory is now outdated. Please upgrade to version %s through our secure downloader inside Armory (link at the bottom of this notification window). Alternatively, you can get the new version from our website downloads page at:

%s """) % (verStr, webURL, webURL) ############################################################################# def processBootstrap(self, binFile): # Nothing to process, actually. We'll grab the bootstrap from its # current location, if needed pass ############################################################################# def notificationIsRelevant(self, notifyID, notifyMap): currTime = RightNow() thisVerInt = getVersionInt(BTCARMORY_VERSION) # Ignore transactions below the requested priority minPriority = self.getSettingOrSetDefault('NotifyMinPriority', 2048) if int(notifyMap['PRIORITY']) < minPriority: return False # Ignore version upgrade notifications if disabled in the settings if 'upgrade' in notifyMap['ALERTTYPE'].lower() and \ self.getSettingOrSetDefault('DisableUpgradeNotify', False): return False if notifyID in self.notifyIgnoreShort: return False if notifyMap['STARTTIME'].isdigit(): if currTime < long(notifyMap['STARTTIME']): return False if notifyMap['EXPIRES'].isdigit(): if currTime > long(notifyMap['EXPIRES']): return False try: minVerStr = notifyMap['MINVERSION'] minExclude = minVerStr.startswith('>') minVerStr = minVerStr[1:] if minExclude else minVerStr minVerInt = getVersionInt(readVersionString(minVerStr)) minVerInt += 1 if minExclude else 0 if thisVerInt < minVerInt: return False except: pass try: maxVerStr = notifyMap['MAXVERSION'] maxExclude = maxVerStr.startswith('<') maxVerStr = maxVerStr[1:] if maxExclude else maxVerStr maxVerInt = getVersionInt(readVersionString(maxVerStr)) maxVerInt -= 1 if maxExclude else 0 if thisVerInt > maxVerInt: return False except: pass return True ############################################################################# def processNotifications(self, txt): # Keep in mind this will always be run on startup with a blank slate, as # well as every 30 min while Armory is running. All notifications are # "new" on startup (though we will allow the user to do-not-show-again # and store the notification ID in the settings file). try: np = notificationParser() currNotificationList = np.parseNotificationText(txt) except: # Don't crash on an error, but do log what happened LOGEXCEPT('Failed to parse notifications') if currNotificationList is None: currNotificationList = {} # If we have a new-version notification, it's not ignroed, and such # notifications are not disabled, add it to the list vnotify = self.versionNotification if vnotify and 'UNIQUEID' in vnotify: currNotificationList[vnotify['UNIQUEID']] = deepcopy(vnotify) # Create a copy of almost all the notifications we have. # All notifications >= 2048, unless they've explictly allowed testing # notifications. This will be shown on the "Announcements" tab. self.almostFullNotificationList = {} currMin = self.getSettingOrSetDefault('NotifyMinPriority', \ DEFAULT_MIN_PRIORITY) minmin = min(currMin, DEFAULT_MIN_PRIORITY) for nid,valmap in currNotificationList.iteritems(): if int(valmap['PRIORITY']) >= minmin: self.almostFullNotificationList[nid] = deepcopy(valmap) tabPriority = 0 self.maxPriorityID = None # Check for new notifications addedNotifyIDs = set() irrelevantIDs = set() for nid,valmap in currNotificationList.iteritems(): if not self.notificationIsRelevant(nid, valmap): # Can't remove while iterating over the map irrelevantIDs.add(nid) self.notifyIgnoreShort.add(nid) continue if valmap['PRIORITY'].isdigit(): if int(valmap['PRIORITY']) > tabPriority: tabPriority = int(valmap['PRIORITY']) self.maxPriorityID = nid if not nid in self.almostFullNotificationList: addedNotifyIDs.append(nid) # Now remove them from the set that we are working with for nid in irrelevantIDs: del currNotificationList[nid] # Check for notifications we had before but no long have removedNotifyIDs = [] for nid,valmap in self.almostFullNotificationList.iteritems(): if not nid in currNotificationList: removedNotifyIDs.append(nid) #for nid in removedNotifyIDs: #self.notifyIgnoreShort.discard(nid) #self.notifyIgnoreLong.discard(nid) # Change the "Announcements" tab color if something important is there tabWidgetBar = self.mainDisplayTabs.tabBar() tabColor = Colors.Foreground if tabPriority >= 5120: tabColor = Colors.TextRed elif tabPriority >= 4096: tabColor = Colors.TextRed elif tabPriority >= 3072: tabColor = Colors.TextBlue elif tabPriority >= 2048: tabColor = Colors.TextBlue tabWidgetBar.setTabTextColor(self.MAINTABS.Announce, tabColor) self.updateAnnounceTab() # We only do popups for notifications >=4096, AND upgrade notify if tabPriority >= 3072: DlgNotificationWithDNAA(self, self, self.maxPriorityID, \ currNotificationList[self.maxPriorityID]).show() elif vnotify: if not vnotify['UNIQUEID'] in self.notifyIgnoreShort: DlgNotificationWithDNAA(self,self,vnotify['UNIQUEID'],vnotify).show() ############################################################################# @TimeThisFunction def setupNetworking(self): LOGINFO('Setting up networking...') self.internetAvail = False # Prevent Armory from being opened twice from twisted.internet import reactor import twisted def uriClick_partial(a): self.uriLinkClicked(a) if CLI_OPTIONS.interport > 1: try: self.InstanceListener = ArmoryListenerFactory(self.bringArmoryToFront, \ uriClick_partial ) reactor.listenTCP(CLI_OPTIONS.interport, self.InstanceListener) except twisted.internet.error.CannotListenError: LOGWARN('Socket already occupied! This must be a duplicate Armory') QMessageBox.warning(self, tr('Already Open'), tr(""" Armory is already running! You can only have one Armory open at a time. Exiting..."""), QMessageBox.Ok) os._exit(0) else: LOGWARN('*** Listening port is disabled. URI-handling will not work') settingSkipCheck = self.getSettingOrSetDefault('SkipOnlineCheck', False) useTor = self.getSettingOrSetDefault('UseTorSettings', False) self.forceOnline = CLI_OPTIONS.forceOnline or settingSkipCheck or useTor # Check general internet connection self.internetAvail = False if self.forceOnline: LOGINFO('Skipping online check, forcing online mode') else: try: import urllib2 response=urllib2.urlopen('http://google.com', timeout=CLI_OPTIONS.nettimeout) self.internetAvail = True except ImportError: LOGERROR('No module urllib2 -- cannot determine if internet is available') except urllib2.URLError: # In the extremely rare case that google might be down (or just to try again...) try: response=urllib2.urlopen('http://microsoft.com', timeout=CLI_OPTIONS.nettimeout) except: LOGEXCEPT('Error checking for internet connection') LOGERROR('Run --skip-online-check if you think this is an error') self.internetAvail = False except: LOGEXCEPT('Error checking for internet connection') LOGERROR('Run --skip-online-check if you think this is an error') self.internetAvail = False LOGINFO('Internet connection is Available: %s', self.internetAvail) LOGINFO('Bitcoin-Qt/bitcoind is Available: %s', satoshiIsAvailable()) LOGINFO('The first blk*.dat was Available: %s', str(self.checkHaveBlockfiles())) LOGINFO('Online mode currently possible: %s', self.onlineModeIsPossible()) ############################################################################# def manageBitcoindAskTorrent(self): if not satoshiIsAvailable(): reply = MsgBoxCustom(MSGBOX.Question, tr('BitTorrent Option'), tr(""" You are currently configured to run the core Bitcoin software yourself (Bitcoin-Qt or bitcoind). Normally, you should start the Bitcoin software first and wait for it to synchronize with the network before starting Armory.

However, Armory can shortcut most of this initial synchronization for you using BitTorrent. If your firewall allows it, using BitTorrent can be an order of magnitude faster (2x to 20x) than letting the Bitcoin software download it via P2P.

To synchronize using BitTorrent (recommended): Click "Use BitTorrent" below, and do not start the Bitcoin software until after it is complete.

To synchronize using Bitcoin P2P (fallback): Click "Cancel" below, then close Armory and start Bitcoin-Qt (or bitcoind). Do not start Armory until you see a green checkmark in the bottom-right corner of the Bitcoin-Qt window."""), \ wCancel=True, yesStr='Use BitTorrent') if not reply: QMessageBox.warning(self, tr('Synchronize'), tr(""" When you are ready to start synchronization, close Armory and start Bitcoin-Qt or bitcoind. Restart Armory only when synchronization is complete. If using Bitcoin-Qt, you will see a green checkmark in the bottom-right corner"""), QMessageBox.Ok) return False else: reply = MsgBoxCustom(MSGBOX.Question, tr('BitTorrent Option'), tr(""" You are currently running the core Bitcoin software, but it is not fully synchronized with the network, yet. Normally, you should close Armory until Bitcoin-Qt (or bitcoind) is finished

However, Armory can speed up this initial synchronization for you using BitTorrent. If your firewall allows it, using BitTorrent can be an order of magnitude faster (2x to 20x) than letting the Bitcoin software download it via P2P.

To synchronize using BitTorrent (recommended): Close the running Bitcoin software right now. When it is closed, click "Use BitTorrent" below. Restart the Bitcoin software when Armory indicates it is complete.

To synchronize using Bitcoin P2P (fallback): Click "Cancel" below, and then close Armory until the Bitcoin software is finished synchronizing. If using Bitcoin-Qt, you will see a green checkmark in the bottom-right corner of the main window."""), QMessageBox.Ok) if reply: if satoshiIsAvailable(): QMessageBox.warning(self, tr('Still Running'), tr(""" The Bitcoin software still appears to be open! Close it right now before clicking "Ok." The BitTorrent engine will start as soon as you do."""), QMessageBox.Ok) else: QMessageBox.warning(self, tr('Synchronize'), tr(""" You chose to finish synchronizing with the network using the Bitcoin software which is already running. Please close Armory until it is finished. If you are running Bitcoin-Qt, you will see a green checkmark in the bottom-right corner, when it is time to open Armory again."""), QMessageBox.Ok) return False return True ############################################################################ def findTorrentFileForSDM(self, forceWaitTime=0): """ Hopefully the announcement fetcher has already gotten one for us, or at least we have a default. """ # Only do an explicit announce check if we have no bootstrap at all # (don't need to spend time doing an explicit check if we have one) if self.announceFetcher.getFileModTime('bootstrap') == 0: if forceWaitTime>0: self.explicitCheckAnnouncements(forceWaitTime) # If it's still not there, look for a default file if self.announceFetcher.getFileModTime('bootstrap') == 0: LOGERROR('Could not get announce bootstrap; using default') srcTorrent = os.path.join(GetExecDir(), 'default_bootstrap.torrent') else: srcTorrent = self.announceFetcher.getAnnounceFilePath('bootstrap') # Maybe we still don't have a torrent for some reason if not srcTorrent or not os.path.exists(srcTorrent): return '' torrentPath = os.path.join(ARMORY_HOME_DIR, 'bootstrap.dat.torrent') LOGINFO('Using torrent file: ' + torrentPath) shutil.copy(srcTorrent, torrentPath) return torrentPath ############################################################################ def startBitcoindIfNecessary(self): LOGINFO('startBitcoindIfNecessary') if not (self.forceOnline or self.internetAvail) or CLI_OPTIONS.offline: LOGWARN('Not online, will not start bitcoind') return False if not self.doAutoBitcoind: LOGWARN('Tried to start bitcoind, but ManageSatoshi==False') return False if satoshiIsAvailable(): LOGWARN('Tried to start bitcoind, but satoshi already running') return False self.setSatoshiPaths() TheSDM.setDisabled(False) torrentIsDisabled = self.getSettingOrSetDefault('DisableTorrent', False) # Give the SDM the torrent file...it will use it if it makes sense if not torrentIsDisabled and TheSDM.shouldTryBootstrapTorrent(): torrentFile = self.findTorrentFileForSDM(2) if not torrentFile or not os.path.exists(torrentFile): LOGERROR('Could not find torrent file') else: TheSDM.tryToSetupTorrentDL(torrentFile) try: # "satexe" is actually just the install directory, not the direct # path the executable. That dir tree will be searched for bitcoind TheSDM.setupSDM(extraExeSearch=self.satoshiExeSearchPath) TheSDM.startBitcoind() LOGDEBUG('Bitcoind started without error') return True except: LOGEXCEPT('Failed to setup SDM') self.switchNetworkMode(NETWORKMODE.Offline) ############################################################################ def setSatoshiPaths(self): LOGINFO('setSatoshiPaths') # We skip the getSettingOrSetDefault call, because we don't want to set # it if it doesn't exist if self.settings.hasSetting('SatoshiExe'): if not os.path.exists(self.settings.get('SatoshiExe')): LOGERROR('Bitcoin installation setting is a non-existent directory') self.satoshiExeSearchPath = [self.settings.get('SatoshiExe')] else: self.satoshiExeSearchPath = [] self.satoshiHomePath = BTC_HOME_DIR if self.settings.hasSetting('SatoshiDatadir') and \ CLI_OPTIONS.satoshiHome=='DEFAULT': # Setting override BTC_HOME_DIR only if it wasn't explicitly # set as the command line. self.satoshiHomePath = self.settings.get('SatoshiDatadir') LOGINFO('Setting satoshi datadir = %s' % self.satoshiHomePath) TheBDM.setSatoshiDir(self.satoshiHomePath) TheSDM.setSatoshiDir(self.satoshiHomePath) TheTDM.setSatoshiDir(self.satoshiHomePath) ############################################################################ def loadBlockchainIfNecessary(self): LOGINFO('loadBlockchainIfNecessary') if CLI_OPTIONS.offline: if self.forceOnline: LOGERROR('Cannot mix --force-online and --offline options! Using offline mode.') self.switchNetworkMode(NETWORKMODE.Offline) TheBDM.setOnlineMode(False, wait=False) elif self.onlineModeIsPossible(): # Track number of times we start loading the blockchain. # We will decrement the number when loading finishes # We can use this to detect problems with mempool or blkxxxx.dat self.numTriesOpen = self.getSettingOrSetDefault('FailedLoadCount', 0) if self.numTriesOpen>2: self.loadFailedManyTimesFunc(self.numTriesOpen) self.settings.set('FailedLoadCount', self.numTriesOpen+1) self.switchNetworkMode(NETWORKMODE.Full) #self.resetBdmBeforeScan() TheBDM.setOnlineMode(True, wait=False) else: self.switchNetworkMode(NETWORKMODE.Offline) TheBDM.setOnlineMode(False, wait=False) ############################################################################# def checkHaveBlockfiles(self): return os.path.exists(os.path.join(TheBDM.btcdir, 'blocks')) ############################################################################# def onlineModeIsPossible(self): return ((self.internetAvail or self.forceOnline) and \ satoshiIsAvailable() and \ self.checkHaveBlockfiles()) ############################################################################# def switchNetworkMode(self, newMode): LOGINFO('Setting netmode: %s', newMode) self.netMode=newMode if newMode in (NETWORKMODE.Offline, NETWORKMODE.Disconnected): self.NetworkingFactory = FakeClientFactory() return elif newMode==NETWORKMODE.Full: # Actually setup the networking, now from twisted.internet import reactor def showOfflineMsg(): self.netMode = NETWORKMODE.Disconnected self.setDashboardDetails() self.lblArmoryStatus.setText( \ 'Disconnected' % htmlColor('TextWarn')) if not self.getSettingOrSetDefault('NotifyDiscon', not OS_MACOSX): return try: self.sysTray.showMessage('Disconnected', \ 'Connection to Bitcoin-Qt client lost! Armory cannot send \n' 'or receive bitcoins until connection is re-established.', \ QSystemTrayIcon.Critical, 10000) except: LOGEXCEPT('Failed to show disconnect notification') self.connectCount = 0 def showOnlineMsg(): self.netMode = NETWORKMODE.Full self.setDashboardDetails() self.lblArmoryStatus.setText(\ 'Connected (%s blocks) ' % (htmlColor('TextGreen'), self.currBlockNum)) if not self.getSettingOrSetDefault('NotifyReconn', not OS_MACOSX): return try: if self.connectCount>0: self.sysTray.showMessage('Connected', \ 'Connection to Bitcoin-Qt re-established', \ QSystemTrayIcon.Information, 10000) self.connectCount += 1 except: LOGEXCEPT('Failed to show reconnect notification') self.NetworkingFactory = ArmoryClientFactory( \ TheBDM, func_loseConnect=showOfflineMsg, \ func_madeConnect=showOnlineMsg, \ func_newTx=self.newTxFunc) #func_newTx=newTxFunc) reactor.callWhenRunning(reactor.connectTCP, '127.0.0.1', \ BITCOIN_PORT, self.NetworkingFactory) ############################################################################# def newTxFunc(self, pytxObj): if TheBDM.getBDMState() in ('Offline','Uninitialized') or self.doShutdown: return TheBDM.addNewZeroConfTx(pytxObj.serialize(), long(RightNow()), True, wait=True) self.newZeroConfSinceLastUpdate.append(pytxObj.serialize()) #LOGDEBUG('Added zero-conf tx to pool: ' + binary_to_hex(pytxObj.thisHash)) # All extra tx functions take one arg: the PyTx object of the new ZC tx for txFunc in self.extraNewTxFunctions: txFunc(pytxObj) ############################################################################# def parseUriLink(self, uriStr, clickOrEnter='click'): if len(uriStr) < 1: QMessageBox.critical(self, 'No URL String', \ 'You have not entered a URL String yet. ' 'Please go back and enter a URL String.', \ QMessageBox.Ok) return {} ClickOrEnter = clickOrEnter[0].upper() + clickOrEnter[1:] LOGINFO('URI link clicked!') LOGINFO('The following URI string was parsed:') LOGINFO(uriStr.replace('%','%%')) uriDict = parseBitcoinURI(uriStr) if TheBDM.getBDMState() in ('Offline','Uninitialized'): LOGERROR('%sed "bitcoin:" link in offline mode.' % ClickOrEnter) self.bringArmoryToFront() QMessageBox.warning(self, 'Offline Mode', 'You %sed on a "bitcoin:" link, but Armory is in ' 'offline mode, and is not capable of creating transactions. ' '%sing links will only work if Armory is connected ' 'to the Bitcoin network!' % (clickOrEnter, ClickOrEnter), \ QMessageBox.Ok) return {} if len(uriDict)==0: warnMsg = ('It looks like you just %sed a "bitcoin:" link, but ' 'that link is malformed. ' % clickOrEnter) if self.usermode == USERMODE.Standard: warnMsg += ('Please check the source of the link and enter the ' 'transaction manually.') else: warnMsg += 'The raw URI string is:

' + uriStr QMessageBox.warning(self, 'Invalid URI', warnMsg, QMessageBox.Ok) LOGERROR(warnMsg) return {} if not uriDict.has_key('address'): QMessageBox.warning(self, 'The "bitcoin:" link you just %sed ' 'does not even contain an address! There is nothing that ' 'Armory can do with this link!' % clickOrEnter, QMessageBox.Ok) LOGERROR('No address in "bitcoin:" link! Nothing to do!') return {} # Verify the URI is for the same network as this Armory instnance theAddrByte = checkAddrType(base58_to_binary(uriDict['address'])) if theAddrByte!=-1 and not theAddrByte in [ADDRBYTE, P2SHBYTE]: net = 'Unknown Network' if NETWORKS.has_key(theAddrByte): net = NETWORKS[theAddrByte] QMessageBox.warning(self, 'Wrong Network!', \ 'The address for the "bitcoin:" link you just %sed is ' 'for the wrong network! You are on the %s ' 'and the address you supplied is for the the ' '%s!' % (clickOrEnter, NETWORKS[ADDRBYTE], net), \ QMessageBox.Ok) LOGERROR('URI link is for the wrong network!') return {} # If the URI contains "req-" strings we don't recognize, throw error recognized = ['address','version','amount','label','message'] for key,value in uriDict.iteritems(): if key.startswith('req-') and not key[4:] in recognized: QMessageBox.warning(self,'Unsupported URI', 'The "bitcoin:" link ' 'you just %sed contains fields that are required but not ' 'recognized by Armory. This may be an older version of Armory, ' 'or the link you %sed on uses an exotic, unsupported format.' '

The action cannot be completed.' % (clickOrEnter, clickOrEnter), \ QMessageBox.Ok) LOGERROR('URI link contains unrecognized req- fields.') return {} return uriDict ############################################################################# def uriLinkClicked(self, uriStr): LOGINFO('uriLinkClicked') if TheBDM.getBDMState()=='Offline': QMessageBox.warning(self, 'Offline', \ 'You just clicked on a "bitcoin:" link, but Armory is offline ' 'and cannot send transactions. Please click the link ' 'again when Armory is online.', \ QMessageBox.Ok) return elif not TheBDM.getBDMState()=='BlockchainReady': # BDM isnt ready yet, saved URI strings in the delayed URIDict to # call later through finishLoadBlockChainGUI qLen = self.delayedURIData['qLen'] self.delayedURIData[qLen] = uriStr qLen = qLen +1 self.delayedURIData['qLen'] = qLen return uriDict = self.parseUriLink(uriStr, 'click') if len(uriDict)>0: self.bringArmoryToFront() return self.uriSendBitcoins(uriDict) ############################################################################# @TimeThisFunction def loadWalletsAndSettings(self): LOGINFO('loadWalletsAndSettings') self.getSettingOrSetDefault('First_Load', True) self.getSettingOrSetDefault('Load_Count', 0) self.getSettingOrSetDefault('User_Mode', 'Advanced') self.getSettingOrSetDefault('UnlockTimeout', 10) self.getSettingOrSetDefault('DNAA_UnlockTimeout', False) # Determine if we need to do new-user operations, increment load-count self.firstLoad = False if self.getSettingOrSetDefault('First_Load', True): self.firstLoad = True self.writeSetting('First_Load', False) self.writeSetting('First_Load_Date', long(RightNow())) self.writeSetting('Load_Count', 1) self.writeSetting('AdvFeature_UseCt', 0) else: self.writeSetting('Load_Count', (self.settings.get('Load_Count')+1) % 100) firstDate = self.getSettingOrSetDefault('First_Load_Date', RightNow()) daysSinceFirst = (RightNow() - firstDate) / (60*60*24) # Set the usermode, default to standard self.usermode = USERMODE.Standard if self.settings.get('User_Mode') == 'Advanced': self.usermode = USERMODE.Advanced elif self.settings.get('User_Mode') == 'Expert': self.usermode = USERMODE.Expert # The user may have asked to never be notified of a particular # notification again. We have a short-term list (wiped on every # load), and a long-term list (saved in settings). We simply # initialize the short-term list with the long-term list, and add # short-term ignore requests to it notifyStr = self.getSettingOrSetDefault('NotifyIgnore', '') nsz = len(notifyStr) self.notifyIgnoreLong = set(notifyStr[8*i:8*(i+1)] for i in range(nsz/8)) self.notifyIgnoreShort = set(notifyStr[8*i:8*(i+1)] for i in range(nsz/8)) # Load wallets found in the .armory directory self.walletMap = {} self.walletIndices = {} self.walletIDSet = set() # I need some linear lists for accessing by index self.walletIDList = [] self.walletVisibleList = [] self.combinedLedger = [] self.ledgerSize = 0 self.ledgerTable = [] self.currBlockNum = 0 LOGINFO('Loading wallets...') wltPaths = readWalletFiles() wltExclude = self.settings.get('Excluded_Wallets', expectList=True) wltOffline = self.settings.get('Offline_WalletIDs', expectList=True) for fpath in wltPaths: try: wltLoad = PyBtcWallet().readWalletFile(fpath) wltID = wltLoad.uniqueIDB58 if fpath in wltExclude or wltID in wltExclude: continue if wltID in self.walletIDSet: LOGWARN('***WARNING: Duplicate wallet detected, %s', wltID) wo1 = self.walletMap[wltID].watchingOnly wo2 = wltLoad.watchingOnly if wo1 and not wo2: prevWltPath = self.walletMap[wltID].walletPath self.walletMap[wltID] = wltLoad LOGWARN('First wallet is more useful than the second one...') LOGWARN(' Wallet 1 (loaded): %s', fpath) LOGWARN(' Wallet 2 (skipped): %s', prevWltPath) else: LOGWARN('Second wallet is more useful than the first one...') LOGWARN(' Wallet 1 (skipped): %s', fpath) LOGWARN(' Wallet 2 (loaded): %s', self.walletMap[wltID].walletPath) else: # Update the maps/dictionaries self.walletMap[wltID] = wltLoad self.walletIndices[wltID] = len(self.walletMap)-1 # Maintain some linear lists of wallet info self.walletIDSet.add(wltID) self.walletIDList.append(wltID) wtype = determineWalletType(wltLoad, self)[0] notWatch = (not wtype == WLTTYPES.WatchOnly) defaultVisible = self.getWltSetting(wltID, 'LedgerShow', notWatch) self.walletVisibleList.append(defaultVisible) wltLoad.mainWnd = self except: LOGEXCEPT( '***WARNING: Wallet could not be loaded: %s (skipping)', fpath) raise LOGINFO('Number of wallets read in: %d', len(self.walletMap)) for wltID, wlt in self.walletMap.iteritems(): dispStr = (' Wallet (%s):' % wlt.uniqueIDB58).ljust(25) dispStr += '"'+wlt.labelName.ljust(32)+'" ' dispStr += '(Encrypted)' if wlt.useEncryption else '(No Encryption)' LOGINFO(dispStr) # Register all wallets with TheBDM TheBDM.registerWallet( wlt.cppWallet ) TheBDM.bdm.registerWallet(wlt.cppWallet) # Create one wallet per lockbox to make sure we can query individual # lockbox histories easily. if self.usermode==USERMODE.Expert: LOGINFO('Loading Multisig Lockboxes') self.loadLockboxesFromFile(MULTISIG_FILE) # Get the last directory savedDir = self.settings.get('LastDirectory') if len(savedDir)==0 or not os.path.exists(savedDir): savedDir = ARMORY_HOME_DIR self.lastDirectory = savedDir self.writeSetting('LastDirectory', savedDir) ############################################################################# @RemoveRepeatingExtensions def getFileSave(self, title='Save Wallet File', \ ffilter=['Wallet files (*.wallet)'], \ defaultFilename=None): LOGDEBUG('getFileSave') startPath = self.settings.get('LastDirectory') if len(startPath)==0 or not os.path.exists(startPath): startPath = ARMORY_HOME_DIR if not defaultFilename==None: startPath = os.path.join(startPath, defaultFilename) types = ffilter types.append('All files (*)') typesStr = ';; '.join(types) # Found a bug with Swig+Threading+PyQt+OSX -- save/load file dialogs freeze # User picobit discovered this is avoided if you use the Qt dialogs, instead # of the native OS dialogs. Use native for all except OSX... if not OS_MACOSX: fullPath = unicode(QFileDialog.getSaveFileName(self, title, startPath, typesStr)) else: fullPath = unicode(QFileDialog.getSaveFileName(self, title, startPath, typesStr, options=QFileDialog.DontUseNativeDialog)) fdir,fname = os.path.split(fullPath) if fdir: self.writeSetting('LastDirectory', fdir) return fullPath ############################################################################# def getFileLoad(self, title='Load Wallet File', \ ffilter=['Wallet files (*.wallet)'], \ defaultDir=None): LOGDEBUG('getFileLoad') if defaultDir is None: defaultDir = self.settings.get('LastDirectory') if len(defaultDir)==0 or not os.path.exists(defaultDir): defaultDir = ARMORY_HOME_DIR types = list(ffilter) types.append(tr('All files (*)')) typesStr = ';; '.join(types) # Found a bug with Swig+Threading+PyQt+OSX -- save/load file dialogs freeze # User picobit discovered this is avoided if you use the Qt dialogs, instead # of the native OS dialogs. Use native for all except OSX... if not OS_MACOSX: fullPath = unicode(QFileDialog.getOpenFileName(self, title, defaultDir, typesStr)) else: fullPath = unicode(QFileDialog.getOpenFileName(self, title, defaultDir, typesStr, \ options=QFileDialog.DontUseNativeDialog)) self.writeSetting('LastDirectory', os.path.split(fullPath)[0]) return fullPath ############################################################################## def getWltSetting(self, wltID, propName, defaultValue=''): # Sometimes we need to settings specific to individual wallets -- we will # prefix the settings name with the wltID. wltPropName = 'Wallet_%s_%s' % (wltID, propName) if self.settings.hasSetting(wltPropName): return self.settings.get(wltPropName) else: if not defaultValue=='': self.setWltSetting(wltID, propName, defaultValue) return defaultValue ############################################################################# def setWltSetting(self, wltID, propName, value): wltPropName = 'Wallet_%s_%s' % (wltID, propName) self.writeSetting(wltPropName, value) ############################################################################# def toggleIsMine(self, wltID): alreadyMine = self.getWltSetting(wltID, 'IsMine') if alreadyMine: self.setWltSetting(wltID, 'IsMine', False) else: self.setWltSetting(wltID, 'IsMine', True) ############################################################################# def loadLockboxesFromFile(self, fn): self.allLockboxes = [] self.cppLockboxWltMap = {} if not os.path.exists(fn): return lbList = readLockboxesFile(fn) for lb in lbList: self.updateOrAddLockbox(lb) ############################################################################# def updateOrAddLockbox(self, lbObj, isFresh=False): try: lbID = lbObj.uniqueIDB58 index = self.lockboxIDMap.get(lbID) if index is None: # Add new lockbox to list self.allLockboxes.append(lbObj) self.lockboxIDMap[lbID] = len(self.allLockboxes)-1 # Create new wallet to hold the lockbox, register it with BDM self.cppLockboxWltMap[lbID] = BtcWallet() scraddrReg = script_to_scrAddr(lbObj.binScript) scraddrP2SH = script_to_scrAddr(script_to_p2sh_script(lbObj.binScript)) TheBDM.registerWallet(self.cppLockboxWltMap[lbID], isFresh) TheBDM.bdm.registerWallet(self.cppLockboxWltMap[lbID], isFresh) if not isFresh: self.cppLockboxWltMap[lbID].addScrAddress_1_(scraddrReg) self.cppLockboxWltMap[lbID].addScrAddress_1_(scraddrP2SH) else: self.cppLockboxWltMap[lbID].addNewScrAddress(scraddrReg) self.cppLockboxWltMap[lbID].addNewScrAddress(scraddrP2SH) # Save the scrAddr histories again to make sure no rescan nexttime if TheBDM.getBDMState()=='BlockchainReady': TheBDM.saveScrAddrHistories() else: # Replace the original self.allLockboxes[index] = lbObj writeLockboxesFile(self.allLockboxes, MULTISIG_FILE) except: LOGEXCEPT('Failed to add/update lockbox') ############################################################################# def removeLockbox(self, lbObj): lbID = lbObj.uniqueIDB58 index = self.lockboxIDMap.get(lbID) if index is None: LOGERROR('Tried to remove lockbox that DNE: %s', lbID) else: del self.allLockboxes[index] self.reconstructLockboxMaps() writeLockboxesFile(self.allLockboxes, MULTISIG_FILE) ############################################################################# def reconstructLockboxMaps(self): self.lockboxIDMap.clear() for i,box in enumerate(self.allLockboxes): self.lockboxIDMap[box.uniqueIDB58] = i ############################################################################# def getLockboxByID(self, boxID): index = self.lockboxIDMap.get(boxID) return None if index is None else self.allLockboxes[index] ################################################################################ # Get the lock box ID if the p2shAddrString is found in one of the lockboxes # otherwise it returns None def getLockboxByP2SHAddrStr(self, p2shAddrStr): for lboxId in self.lockboxIDMap.keys(): lbox = self.allLockboxes[self.lockboxIDMap[lboxId]] if p2shAddrStr == binScript_to_p2shAddrStr(lbox.binScript): return lbox return None ############################################################################# def browseLockboxes(self): DlgLockboxManager(self,self).exec_() ############################################################################# def getContribStr(self, binScript, contribID='', contribLabel=''): """ This is used to display info for the lockbox interface. It might also be useful as a general script_to_user_string method, where you have a binScript and you want to tell the user something about it. However, it is verbose, so it won't fit in a send-confirm dialog, necessarily. We should extract as much information as possible without contrib*. This at least guarantees that we see the correct data for our own wallets and lockboxes, even if the data for other parties is incorrect. """ displayInfo = self.getDisplayStringForScript(binScript, 60, 2) if displayInfo['WltID'] is not None: return displayInfo['String'], ('WLT:%s' % displayInfo['WltID']) elif displayInfo['LboxID'] is not None: return displayInfo['String'], ('LB:%s' % displayInfo['LboxID']) scriptType = getTxOutScriptType(binScript) scrAddr = script_to_scrAddr(binScript) # At this point, we can use the contrib ID (and know we can't sign it) if contribID or contribLabel: if contribID: if contribLabel: outStr = 'Contributor "%s" (%s)' % (contribLabel, contribID) else: outStr = 'Contributor %s' % contribID else: if contribLabel: outStr = 'Contributor "%s"' % contribLabel else: outStr = 'Unknown Contributor' LOGERROR('How did we get to this impossible else-statement?') return outStr, ('CID:%s' % contribID) # If no contrib ID, then salvage anything astr = displayInfo['AddrStr'] cid = None if scriptType == CPP_TXOUT_MULTISIG: M,N,a160s,pubs = getMultisigScriptInfo(binScript) dispStr = 'Unrecognized Multisig %d-of-%d: P2SH=%s' % (M,N,astr) cid = 'MS:%s' % astr elif scriptType == CPP_TXOUT_P2SH: dispStr = 'Unrecognized P2SH: %s' % astr cid = 'P2SH:%s' % astr elif scriptType in CPP_TXOUT_HAS_ADDRSTR: dispStr = 'Address: %s' % astr cid = 'ADDR:%s' % astr else: dispStr = 'Non-standard: P2SH=%s' % astr cid = 'NS:%s' % astr return dispStr, cid ############################################################################# def getWalletForAddr160(self, addr160): for wltID, wlt in self.walletMap.iteritems(): if wlt.hasAddr(addr160): return wltID return '' ############################################################################# def getWalletForScrAddr(self, scrAddr): for wltID, wlt in self.walletMap.iteritems(): if wlt.hasScrAddr(scrAddr): return wltID return '' ############################################################################# def getSettingOrSetDefault(self, settingName, defaultVal): s = self.settings.getSettingOrSetDefault(settingName, defaultVal) return s ############################################################################# def writeSetting(self, settingName, val): self.settings.set(settingName, val) ############################################################################# def startRescanBlockchain(self, forceFullScan=False): if TheBDM.getBDMState() in ('Offline','Uninitialized'): LOGWARN('Rescan requested but Armory is in offline mode') return if TheBDM.getBDMState()=='Scanning': LOGINFO('Queueing rescan after current scan completes.') else: LOGINFO('Starting blockchain rescan...') # Start it in the background TheBDM.rescanBlockchain('AsNeeded', wait=False) self.needUpdateAfterScan = True self.setDashboardDetails() ############################################################################# def forceRescanDB(self): self.needUpdateAfterScan = True self.lblDashModeBuild.setText( 'Build Databases', \ size=4, bold=True, color='DisableFG') self.lblDashModeScan.setText( 'Scanning Transaction History', \ size=4, bold=True, color='Foreground') TheBDM.rescanBlockchain('ForceRescan', wait=False) self.setDashboardDetails() ############################################################################# def forceRebuildAndRescan(self): self.needUpdateAfterScan = True self.lblDashModeBuild.setText( 'Preparing Databases', \ size=4, bold=True, color='Foreground') self.lblDashModeScan.setText( 'Scan Transaction History', \ size=4, bold=True, color='DisableFG') #self.resetBdmBeforeScan() # this resets BDM and then re-registeres wlts TheBDM.rescanBlockchain('ForceRebuild', wait=False) self.setDashboardDetails() ############################################################################# @TimeThisFunction def initialWalletSync(self): for wltID in self.walletMap.iterkeys(): LOGINFO('Syncing wallet: %s', wltID) self.walletMap[wltID].setBlockchainSyncFlag(BLOCKCHAIN_READONLY) # Used to do "sync-lite" when we had to rescan for new addresses, self.walletMap[wltID].syncWithBlockchainLite(0) #self.walletMap[wltID].syncWithBlockchain(0) self.walletMap[wltID].detectHighestUsedIndex(True) # expand wlt if necessary self.walletMap[wltID].fillAddressPool() for lbID,cppWallet in self.cppLockboxWltMap.iteritems(): TheBDM.scanRegisteredTxForWallet(cppWallet, wait=True) @TimeThisFunction # NB: armoryd has a similar function (Armory_Daemon::start()), and both share # common functionality in ArmoryUtils (finishLoadBlockchainCommon). If you # mod this function, please be mindful of what goes where, and make sure # any critical functionality makes it into armoryd. def finishLoadBlockchainGUI(self): # Let's populate the wallet info after finishing loading the blockchain. if TheBDM.isInitialized(): self.setDashboardDetails() (self.currBlockNum, self.memPoolInit) = \ TheBDM.finishLoadBlockchainCommon(self.walletMap, \ self.cppLockboxWltMap, \ self.memPoolInit) self.statusBar().showMessage('Blockchain loaded. Wallets synced!', 10000) # We still need to put together various bits of info. self.createCombinedLedger() self.ledgerSize = len(self.combinedLedger) if self.netMode==NETWORKMODE.Full: LOGINFO('Current block number: %d', self.currBlockNum) self.lblArmoryStatus.setText(\ 'Connected (%s blocks) ' % (htmlColor('TextGreen'), self.currBlockNum)) self.blkReceived = TheBDM.getTopBlockHeader().getTimestamp() self.writeSetting('LastBlkRecv', self.currBlockNum) self.writeSetting('LastBlkRecvTime', self.blkReceived) currSyncSuccess = self.getSettingOrSetDefault("SyncSuccessCount", 0) self.writeSetting('SyncSuccessCount', min(currSyncSuccess+1, 10)) # If there are missing blocks, continue, but throw up a huge warning. vectMissingBlks = TheBDM.missingBlockHashes() LOGINFO('Blockfile corruption check: Missing blocks: %d', \ len(vectMissingBlks)) if len(vectMissingBlks) > 0: LOGINFO('Missing blocks: %d', len(vectMissingBlks)) QMessageBox.critical(self, tr('Blockdata Error'), tr(""" Armory has detected an error in the blockchain database maintained by the third-party Bitcoin software (Bitcoin-Qt or bitcoind). This error is not fatal, but may lead to incorrect balances, inability to send coins, or application instability.

It is unlikely that the error affects your wallets, but it is possible. If you experience crashing, or see incorrect balances on any wallets, it is strongly recommended you re-download the blockchain using: "Help"\xe2\x86\x92"Factory Reset"."""), \ QMessageBox.Ok) # If necessary, throw up a window stating the the blockchain's loaded. if self.getSettingOrSetDefault('NotifyBlkFinish',True): reply,remember = MsgBoxWithDNAA(MSGBOX.Info, \ 'Blockchain Loaded!', 'Blockchain loading is complete. ' 'Your balances and transaction history are now available ' 'under the "Transactions" tab. You can also send and ' 'receive bitcoins.', \ dnaaMsg='Do not show me this notification again ', yesStr='OK') if remember==True: self.writeSetting('NotifyBlkFinish',False) self.mainDisplayTabs.setCurrentIndex(self.MAINTABS.Ledger) # Execute any extra functions we may have. for fn in self.extraGoOnlineFunctions: fn(self.currBlockNum) self.netMode = NETWORKMODE.Full self.settings.set('FailedLoadCount', 0) else: self.statusBar().showMessage('! Blockchain loading failed !', 10000) # This will force the table to refresh with new data self.setDashboardDetails() self.updateAnnounceTab() # make sure satoshi version info is up to date self.removeBootstrapDat() # if we got here, we're *really* done with it self.walletModel.reset() qLen = self.delayedURIData['qLen'] if qLen > 0: #delayed URI parses, feed them back to the uri parser now for i in range(0, qLen): uriStr = self.delayedURIData[qLen-i-1] self.delayedURIData['qLen'] = qLen -i -1 self.uriLinkClicked(uriStr) ############################################################################# def removeBootstrapDat(self): bfile = os.path.join(BTC_HOME_DIR, 'bootstrap.dat.old') if os.path.exists(bfile): os.remove(bfile) ############################################################################# def changeLedgerSorting(self, col, order): """ The direct sorting was implemented to avoid having to search for comment information for every ledger entry. Therefore, you can't sort by comments without getting them first, which is the original problem to avoid. """ if col in (LEDGERCOLS.NumConf, LEDGERCOLS.DateStr, \ LEDGERCOLS.Comment, LEDGERCOLS.Amount, LEDGERCOLS.WltName): self.sortLedgCol = col self.sortLedgOrder = order self.createCombinedLedger() ############################################################################# @TimeThisFunction def createCombinedLedger(self, wltIDList=None, withZeroConf=True): """ Create a ledger to display on the main screen, that consists of ledger entries of any SUBSET of available wallets. """ start = RightNow() if wltIDList==None: currIdx = max(self.comboWltSelect.currentIndex(), 0) wltIDList = [] for i,vis in enumerate(self.walletVisibleList): if vis: wltIDList.append(self.walletIDList[i]) self.writeSetting('LastFilterState', currIdx) if wltIDList==None: return self.combinedLedger = [] totalFunds = 0 spendFunds = 0 unconfFunds = 0 currBlk = 0xffffffff if TheBDM.isInitialized(): currBlk = TheBDM.getTopBlockHeight() for wltID in wltIDList: wlt = self.walletMap[wltID] id_le_pairs = [[wltID, le] for le in wlt.getTxLedger('Full')] self.combinedLedger.extend(id_le_pairs) totalFunds += wlt.getBalance('Total') spendFunds += wlt.getBalance('Spendable') unconfFunds += wlt.getBalance('Unconfirmed') def keyFuncNumConf(x): numConf = x[1].getBlockNum() - currBlk # returns neg for reverse sort txTime = x[1].getTxTime() txhash = x[1].getTxHash() value = x[1].getValue() return (numConf, txTime, txhash, value) def keyFuncTxTime(x): numConf = x[1].getBlockNum() - currBlk # returns neg for reverse sort txTime = x[1].getTxTime() txhash = x[1].getTxHash() value = x[1].getValue() return (txTime, numConf, txhash, value) # Apply table sorting -- this is very fast sortDir = (self.sortLedgOrder == Qt.AscendingOrder) if self.sortLedgCol == LEDGERCOLS.NumConf: self.combinedLedger.sort(key=keyFuncNumConf, reverse=sortDir) if self.sortLedgCol == LEDGERCOLS.DateStr: self.combinedLedger.sort(key=keyFuncTxTime, reverse=sortDir) if self.sortLedgCol == LEDGERCOLS.WltName: self.combinedLedger.sort(key=lambda x: self.walletMap[x[0]].labelName, reverse=sortDir) if self.sortLedgCol == LEDGERCOLS.Comment: self.combinedLedger.sort(key=lambda x: self.getCommentForLE(x[0],x[1]), reverse=sortDir) if self.sortLedgCol == LEDGERCOLS.Amount: self.combinedLedger.sort(key=lambda x: abs(x[1].getValue()), reverse=sortDir) self.ledgerSize = len(self.combinedLedger) # Hide the ledger slicer if our data set is smaller than the slice width self.frmLedgUpDown.setVisible(self.ledgerSize>self.currLedgWidth) self.lblLedgRange.setText('%d to %d' % (self.currLedgMin, self.currLedgMax)) self.lblLedgTotal.setText('(of %d)' % self.ledgerSize) # Many MainWindow objects haven't been created yet... # let's try to update them and fail silently if they don't exist try: if TheBDM.getBDMState() in ('Offline', 'Scanning'): self.lblTotalFunds.setText( '-'*12 ) self.lblSpendFunds.setText( '-'*12 ) self.lblUnconfFunds.setText('-'*12 ) return uncolor = htmlColor('MoneyNeg') if unconfFunds>0 else htmlColor('Foreground') btccolor = htmlColor('DisableFG') if spendFunds==totalFunds else htmlColor('MoneyPos') lblcolor = htmlColor('DisableFG') if spendFunds==totalFunds else htmlColor('Foreground') goodColor= htmlColor('TextGreen') self.lblTotalFunds.setText( '%s' % (btccolor,coin2str(totalFunds))) self.lblTot.setText('Maximum Funds:' % lblcolor) self.lblBTC1.setText('BTC' % lblcolor) self.lblSpendFunds.setText( '%s' % (goodColor, coin2str(spendFunds))) self.lblUnconfFunds.setText('%s' % \ (uncolor, coin2str(unconfFunds))) # Finally, update the ledger table rmin,rmax = self.currLedgMin-1, self.currLedgMax self.ledgerTable = self.convertLedgerToTable(self.combinedLedger[rmin:rmax]) self.ledgerModel.ledger = self.ledgerTable self.ledgerModel.reset() except AttributeError: raise if not self.usermode==USERMODE.Expert: return # In expert mode, we're updating the lockbox info, too try: lockboxTable = [] for lbID,cppWlt in self.cppLockboxWltMap.iteritems(): zcLedger = cppWlt.getZeroConfLedger() for i in range(len(zcLedger)): lockboxTable.append([lbID, zcLedger[i]]) ledger = cppWlt.getTxLedger() for i in range(len(ledger)): lockboxTable.append([lbID, ledger[i]]) self.lockboxLedgTable = self.convertLedgerToTable(lockboxTable) self.lockboxLedgModel.ledger = self.lockboxLedgTable self.lockboxLedgModel.reset() except: LOGEXCEPT('Failed to update lockbox ledger') ############################################################################# def getCommentForLockboxTx(self, lboxId, le): commentSet = set([]) lbox = self.allLockboxes[self.lockboxIDMap[lboxId]] for a160 in lbox.a160List: wltID = self.getWalletForAddr160(a160) if wltID: commentSet.add(self.walletMap[wltID].getCommentForLE(le)) return ' '.join(commentSet) ############################################################################# @TimeThisFunction def convertLedgerToTable(self, ledger, showSentToSelfAmt=True): table2D = [] datefmt = self.getPreferredDateFormat() for wltID,le in ledger: row = [] wlt = self.walletMap.get(wltID) if wlt: isWatch = (determineWalletType(wlt, self)[0] == WLTTYPES.WatchOnly) wltName = wlt.labelName dispComment = self.getCommentForLE(wltID, le) else: lboxId = wltID lbox = self.getLockboxByID(lboxId) if not lbox: continue isWatch = True wltName = '%s-of-%s: %s (%s)' % (lbox.M, lbox.N, lbox.shortName, lboxId) dispComment = self.getCommentForLockboxTx(lboxId, le) nConf = self.currBlockNum - le.getBlockNum()+1 if le.getBlockNum()>=0xffffffff: nConf=0 # If this was sent-to-self... we should display the actual specified # value when the transaction was executed. This is pretty difficult # when both "recipient" and "change" are indistinguishable... but # They're actually not because we ALWAYS generate a new address to # for change , which means the change address MUST have a higher # chain index amt = le.getValue() if le.isSentToSelf() and wlt and showSentToSelfAmt: amt = determineSentToSelfAmt(le, wlt)[0] # NumConf row.append(nConf) # UnixTime (needed for sorting) row.append(le.getTxTime()) # Date row.append(unixTimeToFormatStr(le.getTxTime(), datefmt)) # TxDir (actually just the amt... use the sign of the amt to determine dir) row.append(coin2str(le.getValue(), maxZeros=2)) # Wlt Name row.append(wltName) # Comment row.append(dispComment) # Amount row.append(coin2str(amt, maxZeros=2)) # Is this money mine? row.append(isWatch) # ID to display (this might be the lockbox ID) row.append( wltID ) # TxHash row.append( binary_to_hex(le.getTxHash() )) # Is this a coinbase/generation transaction row.append( le.isCoinbase() ) # Sent-to-self row.append( le.isSentToSelf() ) # Tx was invalidated! (double=spend!) row.append( not le.isValid()) # Finally, attach the row to the table table2D.append(row) return table2D ############################################################################# @TimeThisFunction def walletListChanged(self): self.walletModel.reset() self.populateLedgerComboBox() self.createCombinedLedger() ############################################################################# @TimeThisFunction def populateLedgerComboBox(self): self.comboWltSelect.clear() self.comboWltSelect.addItem( 'My Wallets' ) self.comboWltSelect.addItem( 'Offline Wallets' ) self.comboWltSelect.addItem( 'Other\'s wallets' ) self.comboWltSelect.addItem( 'All Wallets' ) self.comboWltSelect.addItem( 'Custom Filter' ) for wltID in self.walletIDList: self.comboWltSelect.addItem( self.walletMap[wltID].labelName ) self.comboWltSelect.insertSeparator(5) self.comboWltSelect.insertSeparator(5) comboIdx = self.getSettingOrSetDefault('LastFilterState', 0) self.comboWltSelect.setCurrentIndex(comboIdx) ############################################################################# def execDlgWalletDetails(self, index=None): if len(self.walletMap)==0: reply = QMessageBox.information(self, 'No Wallets!', \ 'You currently do not have any wallets. Would you like to ' 'create one, now?', QMessageBox.Yes | QMessageBox.No) if reply==QMessageBox.Yes: self.startWalletWizard() return if index==None: index = self.walletsView.selectedIndexes() if len(self.walletMap)==1: self.walletsView.selectRow(0) index = self.walletsView.selectedIndexes() elif len(index)==0: QMessageBox.warning(self, 'Select a Wallet', \ 'Please select a wallet on the right, to see its properties.', \ QMessageBox.Ok) return index = index[0] wlt = self.walletMap[self.walletIDList[index.row()]] dialog = DlgWalletDetails(wlt, self.usermode, self, self) dialog.exec_() #self.walletListChanged() ############################################################################# def execClickRow(self, index=None): row,col = index.row(), index.column() if not col==WLTVIEWCOLS.Visible: return wltID = self.walletIDList[row] currEye = self.walletVisibleList[row] self.walletVisibleList[row] = not currEye self.setWltSetting(wltID, 'LedgerShow', not currEye) # Set it to "Custom Filter" self.comboWltSelect.setCurrentIndex(4) if TheBDM.getBDMState()=='BlockchainReady': self.createCombinedLedger() self.ledgerModel.reset() self.walletModel.reset() ############################################################################# def updateTxCommentFromView(self, view): index = view.selectedIndexes()[0] row, col = index.row(), index.column() currComment = str(view.model().index(row, LEDGERCOLS.Comment).data().toString()) wltID = str(view.model().index(row, LEDGERCOLS.WltID ).data().toString()) txHash = str(view.model().index(row, LEDGERCOLS.TxHash ).data().toString()) dialog = DlgSetComment(self, self, currComment, 'Transaction') if dialog.exec_(): newComment = str(dialog.edtComment.text()) self.walletMap[wltID].setComment(hex_to_binary(txHash), newComment) self.walletListChanged() ############################################################################# def updateAddressCommentFromView(self, view, wlt): index = view.selectedIndexes()[0] row, col = index.row(), index.column() currComment = str(view.model().index(row, ADDRESSCOLS.Comment).data().toString()) addrStr = str(view.model().index(row, ADDRESSCOLS.Address).data().toString()) dialog = DlgSetComment(self, self, currComment, 'Address') if dialog.exec_(): newComment = str(dialog.edtComment.text()) atype, addr160 = addrStr_to_hash160(addrStr) if atype==P2SHBYTE: LOGWARN('Setting comment for P2SH address: %s' % addrStr) wlt.setComment(addr160, newComment) ############################################################################# @TimeThisFunction def getAddrCommentIfAvailAll(self, txHash): if not TheBDM.isInitialized(): return '' else: appendedComments = [] for wltID,wlt in self.walletMap.iteritems(): cmt = wlt.getAddrCommentIfAvail(txHash) if len(cmt)>0: appendedComments.append(cmt) return '; '.join(appendedComments) ############################################################################# def getCommentForLE(self, wltID, le): # Smart comments for LedgerEntry objects: get any direct comments ... # if none, then grab the one for any associated addresses. return self.walletMap[wltID].getCommentForLE(le) """ txHash = le.getTxHash() if wlt.commentsMap.has_key(txHash): comment = wlt.commentsMap[txHash] else: # [[ COMMENTS ]] are not meant to be displayed on main ledger comment = self.getAddrCommentIfAvail(txHash) if comment.startswith('[[') and comment.endswith(']]'): comment = '' return comment """ ############################################################################# def addWalletToApplication(self, newWallet, walletIsNew=True): LOGINFO('addWalletToApplication') # Update the maps/dictionaries newWltID = newWallet.uniqueIDB58 if self.walletMap.has_key(newWltID): return self.walletMap[newWltID] = newWallet self.walletIndices[newWltID] = len(self.walletMap)-1 # Maintain some linear lists of wallet info self.walletIDSet.add(newWltID) self.walletIDList.append(newWltID) showByDefault = (determineWalletType(newWallet, self)[0] != WLTTYPES.WatchOnly) self.walletVisibleList.append(showByDefault) self.setWltSetting(newWltID, 'LedgerShow', showByDefault) ledger = [] self.walletListChanged() self.mainWnd = self ############################################################################# def removeWalletFromApplication(self, wltID): LOGINFO('removeWalletFromApplication') idx = -1 try: idx = self.walletIndices[wltID] except KeyError: LOGERROR('Invalid wallet ID passed to "removeWalletFromApplication"') raise WalletExistsError del self.walletMap[wltID] del self.walletIndices[wltID] self.walletIDSet.remove(wltID) del self.walletIDList[idx] del self.walletVisibleList[idx] # Reconstruct walletIndices for i,wltID in enumerate(self.walletIDList): self.walletIndices[wltID] = i self.walletListChanged() ############################################################################# def RecoverWallet(self): DlgWltRecoverWallet(self, self).promptWalletRecovery() ############################################################################# def createSweepAddrTx(self, sweepFromAddrObjList, sweepToScript): """ This method takes a list of addresses (likely just created from private key data), finds all their unspent TxOuts, and creates a signed tx that transfers 100% of the funds to the sweepTO160 address. It doesn't actually execute the transaction, but it will return a broadcast-ready PyTx object that the user can confirm. TxFee is automatically calc'd and deducted from the output value, if necessary. """ LOGINFO('createSweepAddrTx') if not isinstance(sweepFromAddrObjList, (list, tuple)): sweepFromAddrObjList = [sweepFromAddrObjList] addr160List = [a.getAddr160() for a in sweepFromAddrObjList] utxoList = getUnspentTxOutsForAddr160List(addr160List, 'Sweep', 0) if len(utxoList)==0: return [None, 0, 0] outValue = sumTxOutList(utxoList) inputSide = [] outputSide = [] for utxo in utxoList: # The PyCreateAndSignTx method require PyTx and PyBtcAddress objects rawTx = TheBDM.getTxByHash(utxo.getTxHash()).serialize() PyPrevTx = PyTx().unserialize(rawTx) a160 = CheckHash160(utxo.getRecipientScrAddr()) for aobj in sweepFromAddrObjList: if a160 == aobj.getAddr160(): pubKey = aobj.binPublicKey65.toBinStr() txoIdx = utxo.getTxOutIndex() inputSide.append(UnsignedTxInput(rawTx, txoIdx, None, pubKey)) break minFee = calcMinSuggestedFees(utxoList, outValue, 0, 1)[1] if minFee > 0: LOGDEBUG( 'Subtracting fee from Sweep-output') outValue -= minFee if outValue<=0: return [None, outValue, minFee] # Creating the output list is pretty easy... outputSide = [] outputSide.append(DecoratedTxOut(sweepToScript, outValue)) try: # Make copies, destroy them in the finally clause privKeyMap = {} for addrObj in sweepFromAddrObjList: scrAddr = SCRADDR_P2PKH_BYTE + addrObj.getAddr160() privKeyMap[scrAddr] = addrObj.binPrivKey32_Plain.copy() pytx = PyCreateAndSignTx(inputSide, outputSide, privKeyMap) return (pytx, outValue, minFee) finally: for scraddr in privKeyMap: privKeyMap[scraddr].destroy() """ # Try with zero fee and exactly one output minFee = calcMinSuggestedFees(utxoList, outValue, 0, 1)[1] if minFee > 0: LOGDEBUG( 'Subtracting fee from Sweep-output') outValue -= minFee if outValue<=0: return [None, outValue, minFee] outputSide = [] outputSide.append( [PyBtcAddress().createFromPublicKeyHash160(sweepTo160), \ outValue] ) pytx = PyCreateAndSignTx(inputSide, outputSide) return (pytx, outValue, minFee) """ ############################################################################# def confirmSweepScan(self, pybtcaddrList, targAddr160): LOGINFO('confirmSweepScan') gt1 = len(self.sweepAfterScanList)>1 if len(self.sweepAfterScanList) > 0: QMessageBox.critical(self, 'Already Sweeping', 'You are already in the process of scanning the blockchain for ' 'the purposes of sweeping other addresses. You cannot initiate ' 'sweeping new addresses until the current operation completes. ' '

' 'In the future, you may select "Multiple Keys" when entering ' 'addresses to sweep. There is no limit on the number that can be ' 'specified, but they must all be entered at once.', QMessageBox.Ok) # Destroy the private key data for addr in pybtcaddrList: addr.binPrivKey32_Plain.destroy() return False confirmed=False if TheBDM.getBDMState() in ('Offline', 'Uninitialized'): #LOGERROR('Somehow ended up at confirm-sweep while in offline mode') #QMessageBox.info(self, 'Armory is Offline', \ #'Armory is currently in offline mode. You must be in online ' #'mode to initiate the sweep operation.') nkey = len(self.sweepAfterScanList) strPlur = 'addresses' if nkey>1 else 'address' QMessageBox.info(self, 'Armory is Offline', \ 'You have chosen to sweep %d %s, but Armory is currently ' 'in offline mode. The sweep will be performed the next time you ' 'go into online mode. You can initiate online mode (if available) ' 'from the dashboard in the main window.' (nkey,strPlur), QMessageBox.Ok) confirmed=True else: msgConfirm = ( \ 'Armory must scan the global transaction history in order to ' 'find any bitcoins associated with the %s you supplied. ' 'Armory will go into offline mode temporarily while the scan ' 'is performed, and you will not have access to balances or be ' 'able to create transactions. The scan may take several minutes.' '

' % ('keys' if gt1 else 'key')) if TheBDM.getBDMState()=='Scanning': msgConfirm += ( \ 'There is currently another scan operation being performed. ' 'Would you like to start the sweep operation after it completes? ') elif TheBDM.getBDMState()=='BlockchainReady': msgConfirm += ( \ 'Would you like to start the scan operation right now?') msgConfirm += ('

Clicking "No" will abort the sweep operation') confirmed = QMessageBox.question(self, 'Confirm Rescan', msgConfirm, \ QMessageBox.Yes | QMessageBox.No) if confirmed==QMessageBox.Yes: for addr in pybtcaddrList: TheBDM.registerImportedScrAddr(Hash160ToScrAddr(addr.getAddr160())) self.sweepAfterScanList = pybtcaddrList self.sweepAfterScanTarg = targAddr160 #TheBDM.rescanBlockchain('AsNeeded', wait=False) self.startRescanBlockchain() self.setDashboardDetails() return True ############################################################################# def finishSweepScan(self): LOGINFO('finishSweepScan') sweepList, self.sweepAfterScanList = self.sweepAfterScanList,[] ####################################################################### # The createSweepTx method will return instantly because the blockchain # has already been rescanned, as described above targScript = scrAddr_to_script(SCRADDR_P2PKH_BYTE + self.sweepAfterScanTarg) finishedTx, outVal, fee = self.createSweepAddrTx(sweepList, targScript) gt1 = len(sweepList)>1 if finishedTx==None: if (outVal,fee)==(0,0): QMessageBox.critical(self, 'Nothing to do', \ 'The private %s you have provided does not appear to contain ' 'any funds. There is nothing to sweep.' % ('keys' if gt1 else 'key'), \ QMessageBox.Ok) return else: pladdr = ('addresses' if gt1 else 'address') QMessageBox.critical(self, 'Cannot sweep',\ 'You cannot sweep the funds from the %s you specified, because ' 'the transaction fee would be equal to or greater than the amount ' 'swept.' '

' 'Balance of %s: %s
' 'Fee to sweep %s: %s' '

The sweep operation has been canceled.' % (pladdr, pladdr, \ coin2str(outVal+fee,maxZeros=0), pladdr, coin2str(fee,maxZeros=0)), \ QMessageBox.Ok) LOGERROR('Sweep amount (%s) is less than fee needed for sweeping (%s)', \ coin2str(outVal+fee, maxZeros=0), coin2str(fee, maxZeros=0)) return wltID = self.getWalletForAddr160(self.sweepAfterScanTarg) wlt = self.walletMap[wltID] # Finally, if we got here, we're ready to broadcast! if gt1: dispIn = 'multiple addresses' else: dispIn = 'address %s' % sweepList[0].getAddrStr() dispOut = 'wallet "%s" (%s) ' % (wlt.labelName, wlt.uniqueIDB58) if DlgVerifySweep(dispIn, dispOut, outVal, fee).exec_(): self.broadcastTransaction(finishedTx, dryRun=False) if TheBDM.getBDMState()=='BlockchainReady': wlt.syncWithBlockchain(0) self.walletListChanged() ############################################################################# def broadcastTransaction(self, pytx, dryRun=False, withOldSigWarning=True): if dryRun: #DlgDispTxInfo(pytx, None, self, self).exec_() return else: modified, newTx = pytx.minimizeDERSignaturePadding() if modified and withOldSigWarning: reply = QMessageBox.warning(self, 'Old signature format detected', \ 'The transaction that you are about to execute ' 'has been signed with an older version Bitcoin Armory ' 'that has added unnecessary padding to the signature. ' 'If you are running version Bitcoin 0.8.2 or later the unnecessary ' 'the unnecessary signature padding will not be broadcast. ' 'Note that removing the unnecessary padding will change the hash value ' 'of the transaction. Do you want to remove the unnecessary padding?', QMessageBox.Yes | QMessageBox.No) if reply == QMessageBox.Yes: pytx = newTx LOGRAWDATA(pytx.serialize(), logging.INFO) LOGPPRINT(pytx, logging.INFO) newTxHash = pytx.getHash() LOGINFO('Sending Tx, %s', binary_to_hex(newTxHash)) self.NetworkingFactory.sendTx(pytx) LOGINFO('Transaction sent to Satoshi client...!') def sendGetDataMsg(): msg = PyMessage('getdata') msg.payload.invList.append( [MSG_INV_TX, newTxHash] ) self.NetworkingFactory.sendMessage(msg) def checkForTxInBDM(): # The sleep/delay makes sure we have time to receive a response # but it also gives the user a chance to SEE the change to their # balance occur. In some cases, that may be more satisfying than # just seeing the updated balance when they get back to the main # screen if not TheBDM.getTxByHash(newTxHash).isInitialized(): LOGERROR('Transaction was not accepted by the Satoshi client') LOGERROR('Raw transaction:') LOGRAWDATA(pytx.serialize(), logging.ERROR) LOGERROR('Transaction details') LOGPPRINT(pytx, logging.ERROR) searchstr = binary_to_hex(newTxHash, BIGENDIAN) supportURL = 'https://bitcoinarmory.com/support' blkexplURL = BLOCKEXPLORE_URL_TX % searchstr blkexplURL_short = BLOCKEXPLORE_URL_TX % searchstr[:20] QMessageBox.warning(self, tr('Transaction Not Accepted'), tr(""" The transaction that you just executed, does not appear to have been accepted by the Bitcoin network. This can happen for a variety of reasons, but it is usually due to a bug in the Armory software.

On some occasions the transaction actually did succeed and this message is the bug itself! To confirm whether the the transaction actually succeeded, you can try this direct link to %s:

%s...

If you do not see the transaction on that webpage within one minute, it failed and you should attempt to re-send it. If it does show up, then you do not need to do anything else -- it will show up in Armory as soon as it receives one confirmation.

If the transaction did fail, please consider reporting this error the the Armory developers. From the main window, go to "Help" and select "Submit Bug Report". Or use "File" -> "Export Log File" and then attach it to a support ticket at %s""") % (BLOCKEXPLORE_NAME, blkexplURL, blkexplURL_short, supportURL, supportURL), QMessageBox.Ok) self.mainDisplayTabs.setCurrentIndex(self.MAINTABS.Ledger) # Send the Tx after a short delay, give the system time to see the Tx # on the network and process it, and check to see if the Tx was seen. # We may change this setup in the future, but for now.... reactor.callLater(3, sendGetDataMsg) reactor.callLater(7, checkForTxInBDM) ############################################################################# def warnNoImportWhileScan(self): extraMsg = '' if not self.usermode==USERMODE.Standard: extraMsg = ('

' 'In the future, you may avoid scanning twice by ' 'starting Armory in offline mode (--offline), and ' 'perform the import before switching to online mode.') QMessageBox.warning(self, 'Armory is Busy', \ 'Wallets and addresses cannot be imported while Armory is in ' 'the middle of an existing blockchain scan. Please wait for ' 'the scan to finish. ' + extraMsg, QMessageBox.Ok) ############################################################################# def execImportWallet(self): sdm = TheSDM.getSDMState() bdm = TheBDM.getBDMState() if sdm in ['BitcoindInitializing', \ 'BitcoindSynchronizing', \ 'TorrentSynchronizing'] or \ bdm in ['Scanning']: QMessageBox.warning(self, tr('Scanning'), tr(""" Armory is currently in the middle of scanning the blockchain for your existing wallets. New wallets cannot be imported until this operation is finished."""), QMessageBox.Ok) return DlgUniversalRestoreSelect(self, self).exec_() ############################################################################# def execGetImportWltName(self): fn = self.getFileLoad('Import Wallet File') if not os.path.exists(fn): return wlt = PyBtcWallet().readWalletFile(fn, verifyIntegrity=False, \ doScanNow=False) wltID = wlt.uniqueIDB58 wlt = None if self.walletMap.has_key(wltID): QMessageBox.warning(self, 'Duplicate Wallet!', \ 'You selected a wallet that has the same ID as one already ' 'in your wallet (%s)! If you would like to import it anyway, ' 'please delete the duplicate wallet in Armory, first.'%wltID, \ QMessageBox.Ok) return fname = self.getUniqueWalletFilename(fn) newpath = os.path.join(ARMORY_HOME_DIR, fname) LOGINFO('Copying imported wallet to: %s', newpath) shutil.copy(fn, newpath) newWlt = PyBtcWallet().readWalletFile(newpath) newWlt.fillAddressPool() self.addWalletToAppAndAskAboutRescan(newWlt) """ I think the addWalletToAppAndAskAboutRescan replaces this... if TheBDM.getBDMState() in ('Uninitialized', 'Offline'): self.addWalletToApplication(newWlt, walletIsNew=False) return if TheBDM.getBDMState()=='BlockchainReady': doRescanNow = QMessageBox.question(self, 'Rescan Needed', \ 'The wallet was imported successfully, but cannot be displayed ' 'until the global transaction history is ' 'searched for previous transactions. This scan will potentially ' 'take much longer than a regular rescan, and the wallet cannot ' 'be shown on the main display until this rescan is complete.' '

' 'Would you like to go into offline mode to start this scan now?' ' If you click "No" the scan will be aborted, and the wallet ' 'will not be added to Armory.', \ QMessageBox.Yes | QMessageBox.No) else: doRescanNow = QMessageBox.question(self, 'Rescan Needed', \ 'The wallet was imported successfully, but its balance cannot ' 'be determined until Armory performs a "recovery scan" for the ' 'wallet. This scan potentially takes much longer than a regular ' 'scan, and must be completed for all imported wallets. ' '

' 'Armory is already in the middle of a scan and cannot be interrupted. ' 'Would you like to start the recovery scan when it is done?' '

' ' If you click "No," the wallet import will be aborted ' 'and you must re-import the wallet when you ' 'are able to wait for the recovery scan.', \ QMessageBox.Yes | QMessageBox.No) if doRescanNow == QMessageBox.Yes: LOGINFO('User requested rescan after wallet import') #TheBDM.startWalletRecoveryScan(newWlt) # TODO: re-enable this later #TheBDM.rescanBlockchain('AsNeeded', wait=False) self.startRescanBlockchain() self.setDashboardDetails() else: LOGINFO('User aborted the wallet-import scan') QMessageBox.warning(self, 'Import Failed', \ 'The wallet was not imported.', QMessageBox.Ok) # The wallet cannot exist without also being on disk. # If the user aborted, we should remove the disk data. thepath = newWlt.getWalletPath() thepathBackup = newWlt.getWalletPath('backup') os.remove(thepath) os.remove(thepathBackup) return self.addWalletToApplication(newWlt, walletIsNew=False) self.newWalletList.append([newWlt, False]) LOGINFO('Import Complete!') """ ############################################################################# def addWalletToAppAndAskAboutRescan(self, newWallet): LOGINFO('Raw import successful.') # If we are offline, then we can't assume there will ever be a # rescan. Just add the wallet to the application if TheBDM.getBDMState() in ('Uninitialized', 'Offline'): TheBDM.registerWallet(newWallet.cppWallet) self.addWalletToApplication(newWallet, walletIsNew=False) return """ TODO: Temporarily removed recovery-rescan operations elif TheBDM.getBDMState()=='BlockchainReady': doRescanNow = QMessageBox.question(self, 'Rescan Needed', \ 'The wallet was recovered successfully, but cannot be displayed ' 'until the global transaction history is ' 'searched for previous transactions. This scan will potentially ' 'take much longer than a regular rescan, and the wallet cannot ' 'be shown on the main display until this rescan is complete.' '

' 'Would you like to go into offline mode to start this scan now?' ' If you click "No" the scan will be aborted, and the wallet ' 'will not be added to Armory.', \ QMessageBox.Yes | QMessageBox.No) doRescanNow = QMessageBox.question(self, 'Rescan Needed', \ 'The wallet was recovered successfully, but cannot be displayed ' 'until a special kind of rescan is performed to find previous ' 'transactions. However, Armory is currently in the middle of ' 'a scan. Would you like to start the recovery scan immediately ' 'afterwards?' '

' ' If you click "No" the scan will be aborted, and the wallet ' 'will not be added to Armory. Restore the wallet again when you ' 'are able to wait for the recovery scan.', \ QMessageBox.Yes | QMessageBox.No) """ doRescanNow = QMessageBox.Cancel if TheBDM.getBDMState()=='BlockchainReady': doRescanNow = QMessageBox.question(self, tr('Rescan Needed'), \ tr("""The wallet was restored successfully but its balance cannot be displayed until the blockchain is rescanned. Armory will need to go into offline mode for 5-20 minutes.

Would you like to do the scan now? Clicking "No" will abort the restore/import operation."""), \ QMessageBox.Yes | QMessageBox.No) else: doRescanNow = QMessageBox.question(self, tr('Rescan Needed'), \ tr("""The wallet was restored successfully but its balance cannot be displayed until the blockchain is rescanned. However, Armory is currently in the middle of a rescan operation right now. Would you like to start a new scan as soon as this one is finished?

Clicking "No" will abort adding the wallet to Armory."""), \ QMessageBox.Yes | QMessageBox.No) if doRescanNow == QMessageBox.Yes: LOGINFO('User requested rescan after wallet restore') #TheBDM.startWalletRecoveryScan(newWallet) TheBDM.registerWallet(newWallet.cppWallet) self.startRescanBlockchain() self.setDashboardDetails() else: LOGINFO('User aborted the wallet-recovery scan') QMessageBox.warning(self, 'Import Failed', \ 'The wallet was not restored. To restore the wallet, reenter ' 'the "Restore Wallet" dialog again when you are able to wait ' 'for the rescan operation. ', QMessageBox.Ok) # The wallet cannot exist without also being on disk. # If the user aborted, we should remove the disk data. thepath = newWallet.getWalletPath() thepathBackup = newWallet.getWalletPath('backup') os.remove(thepath) os.remove(thepathBackup) return self.addWalletToApplication(newWallet, walletIsNew=False) LOGINFO('Import Complete!') ############################################################################# def digitalBackupWarning(self): reply = QMessageBox.warning(self, 'Be Careful!', tr(""" WARNING: You are about to make an unencrypted backup of your wallet. It is highly recommended that you do not ever save unencrypted wallets to your regular hard drive. This feature is intended for saving to a USB key or other removable media."""), QMessageBox.Ok | QMessageBox.Cancel) return (reply==QMessageBox.Ok) ############################################################################# def execAddressBook(self): if TheBDM.getBDMState()=='Scanning': QMessageBox.warning(self, 'Blockchain Not Ready', \ 'The address book is created from transaction data available in ' 'the blockchain, which has not finished loading. The address ' 'book will become available when Armory is online.', QMessageBox.Ok) elif TheBDM.getBDMState() in ('Uninitialized','Offline'): QMessageBox.warning(self, 'Blockchain Not Ready', \ 'The address book is created from transaction data available in ' 'the blockchain, but Armory is currently offline. The address ' 'book will become available when Armory is online.', QMessageBox.Ok) else: if len(self.walletMap)==0: QMessageBox.warning(self, 'No wallets!', 'You have no wallets so ' 'there is no address book to display.', QMessageBox.Ok) return DlgAddressBook(self, self, None, None, None).exec_() ############################################################################# def getUniqueWalletFilename(self, wltPath): root,fname = os.path.split(wltPath) base,ext = os.path.splitext(fname) if not ext=='.wallet': fname = base+'.wallet' currHomeList = os.listdir(ARMORY_HOME_DIR) newIndex = 2 while fname in currHomeList: # If we already have a wallet by this name, must adjust name base,ext = os.path.splitext(fname) fname='%s_%02d.wallet'%(base, newIndex) newIndex+=1 if newIndex==99: raise WalletExistsError('Cannot find unique filename for wallet.' 'Too many duplicates!') return fname ############################################################################# def addrViewDblClicked(self, index, wlt): uacfv = lambda x: self.updateAddressCommentFromView(self.wltAddrView, self.wlt) ############################################################################# def dblClickLedger(self, index): if index.column()==LEDGERCOLS.Comment: self.updateTxCommentFromView(self.ledgerView) else: self.showLedgerTx() ############################################################################# def showLedgerTx(self): row = self.ledgerView.selectedIndexes()[0].row() txHash = str(self.ledgerView.model().index(row, LEDGERCOLS.TxHash).data().toString()) wltID = str(self.ledgerView.model().index(row, LEDGERCOLS.WltID).data().toString()) txtime = unicode(self.ledgerView.model().index(row, LEDGERCOLS.DateStr).data().toString()) pytx = None txHashBin = hex_to_binary(txHash) if TheBDM.isInitialized(): cppTx = TheBDM.getTxByHash(txHashBin) if cppTx.isInitialized(): pytx = PyTx().unserialize(cppTx.serialize()) if pytx==None: QMessageBox.critical(self, 'Invalid Tx:', 'The transaction you requested be displayed does not exist in ' 'in Armory\'s database. This is unusual...', QMessageBox.Ok) return DlgDispTxInfo( pytx, self.walletMap[wltID], self, self, txtime=txtime).exec_() ############################################################################# def showContextMenuLedger(self): menu = QMenu(self.ledgerView) if len(self.ledgerView.selectedIndexes())==0: return row = self.ledgerView.selectedIndexes()[0].row() txHash = str(self.ledgerView.model().index(row, LEDGERCOLS.TxHash).data().toString()) txHash = hex_switchEndian(txHash) wltID = str(self.ledgerView.model().index(row, LEDGERCOLS.WltID).data().toString()) actViewTx = menu.addAction("View Details") actViewBlkChn = menu.addAction("View on %s" % BLOCKEXPLORE_NAME) actComment = menu.addAction("Change Comment") actCopyTxID = menu.addAction("Copy Transaction ID") actOpenWallet = menu.addAction("Open Relevant Wallet") action = menu.exec_(QCursor.pos()) if action==actViewTx: self.showLedgerTx() elif action==actViewBlkChn: try: webbrowser.open(BLOCKEXPLORE_URL_TX % txHash) except: LOGEXCEPT('Failed to open webbrowser') QMessageBox.critical(self, 'Could not open browser', \ 'Armory encountered an error opening your web browser. To view ' 'this transaction on blockchain.info, please copy and paste ' 'the following URL into your browser: ' '

%s' % (BLOCKEXPLORE_URL_TX % txHash), QMessageBox.Ok) elif action==actCopyTxID: clipb = QApplication.clipboard() clipb.clear() clipb.setText(txHash) elif action==actComment: self.updateTxCommentFromView(self.ledgerView) elif action==actOpenWallet: DlgWalletDetails(self.getSelectedWallet(), self.usermode, self, self).exec_() ############################################################################# def getSelectedWallet(self): wltID = None if len(self.walletMap) > 0: wltID = self.walletMap.keys()[0] wltSelect = self.walletsView.selectedIndexes() if len(wltSelect) > 0: row = wltSelect[0].row() wltID = str(self.walletsView.model().index(row, WLTVIEWCOLS.ID).data().toString()) # Starting the send dialog with or without a wallet return None if wltID == None else self.walletMap[wltID] def clickSendBitcoins(self): if TheBDM.getBDMState() in ('Offline', 'Uninitialized'): QMessageBox.warning(self, 'Offline Mode', \ 'Armory is currently running in offline mode, and has no ' 'ability to determine balances or create transactions. ' '

' 'In order to send coins from this wallet you must use a ' 'full copy of this wallet from an online computer, ' 'or initiate an "offline transaction" using a watching-only ' 'wallet on an online computer.', QMessageBox.Ok) return elif TheBDM.getBDMState()=='Scanning': QMessageBox.warning(self, 'Armory Not Ready', \ 'Armory is currently scanning the blockchain to collect ' 'the information needed to create transactions. This typically ' 'takes between one and five minutes. Please wait until your ' 'balance appears on the main window, then try again.', \ QMessageBox.Ok) return selectionMade = True if len(self.walletMap)==0: reply = QMessageBox.information(self, 'No Wallets!', \ 'You cannot send any bitcoins until you create a wallet and ' 'receive some coins. Would you like to create a wallet?', \ QMessageBox.Yes | QMessageBox.No) if reply==QMessageBox.Yes: self.startWalletWizard() else: DlgSendBitcoins(self.getSelectedWallet(), self, self).exec_() ############################################################################# def uriSendBitcoins(self, uriDict): # Because Bitcoin-Qt doesn't store the message= field we have to assume # that the label field holds the Tx-info. So we concatenate them for # the display message uri_has = lambda s: uriDict.has_key(s) haveLbl = uri_has('label') haveMsg = uri_has('message') newMsg = '' if haveLbl and haveMsg: newMsg = uriDict['label'] + ': ' + uriDict['message'] elif not haveLbl and haveMsg: newMsg = uriDict['message'] elif haveLbl and not haveMsg: newMsg = uriDict['label'] descrStr = '' descrStr = ('You just clicked on a "bitcoin:" link requesting bitcoins ' 'to be sent to the following address:
') descrStr += '
--Address:\t%s ' % uriDict['address'] #if uri_has('label'): #if len(uriDict['label'])>30: #descrStr += '(%s...)' % uriDict['label'][:30] #else: #descrStr += '(%s)' % uriDict['label'] amt = 0 if uri_has('amount'): amt = uriDict['amount'] amtstr = coin2str(amt, maxZeros=1) descrStr += '
--Amount:\t%s BTC' % amtstr if newMsg: if len(newMsg)>60: descrStr += '
--Message:\t%s...' % newMsg[:60] else: descrStr += '
--Message:\t%s' % newMsg uriDict['message'] = newMsg if not uri_has('amount'): descrStr += ('

There is no amount specified in the link, so ' 'you can decide the amount after selecting a wallet to use ' 'for this this transaction. ') else: descrStr += ('

The specified amount can be changed on the ' 'next screen before hitting the "Send" button. ') selectedWalletID = None if len(self.walletMap)==0: reply = QMessageBox.information(self, 'No Wallets!', \ 'You just clicked on a "bitcoin:" link to send money, but you ' 'currently have no wallets! Would you like to create a wallet ' 'now?', QMessageBox.Yes | QMessageBox.No) if reply==QMessageBox.Yes: self.startWalletWizard() return False else: DlgSendBitcoins(self.getSelectedWallet(), self, self, uriDict).exec_() return True ############################################################################# def clickReceiveCoins(self): LOGDEBUG('Clicked "Receive Bitcoins Button"') wltID = None selectionMade = True if len(self.walletMap)==0: reply = QMessageBox.information(self, 'No Wallets!', \ 'You have not created any wallets which means there is nowhere to ' 'store you bitcoins! Would you like to create a wallet now?', \ QMessageBox.Yes | QMessageBox.No) if reply==QMessageBox.Yes: self.startWalletWizard() return elif len(self.walletMap)==1: wltID = self.walletMap.keys()[0] else: wltSelect = self.walletsView.selectedIndexes() if len(wltSelect)>0: row = wltSelect[0].row() wltID = str(self.walletsView.model().index(row, WLTVIEWCOLS.ID).data().toString()) dlg = DlgWalletSelect(self, self, 'Receive coins with wallet...', '', \ firstSelect=wltID, onlyMyWallets=False) if dlg.exec_(): wltID = dlg.selectedID else: selectionMade = False if selectionMade: wlt = self.walletMap[wltID] wlttype = determineWalletType(wlt, self)[0] if showRecvCoinsWarningIfNecessary(wlt, self): DlgNewAddressDisp(wlt, self, self).exec_() ############################################################################# def sysTrayActivated(self, reason): if reason==QSystemTrayIcon.DoubleClick: self.bringArmoryToFront() ############################################################################# def bringArmoryToFront(self): self.show() self.setWindowState(Qt.WindowActive) self.activateWindow() self.raise_() ############################################################################# def minimizeArmory(self): LOGDEBUG('Minimizing Armory') self.hide() self.sysTray.show() ############################################################################# def startWalletWizard(self): walletWizard = WalletWizard(self, self) walletWizard.exec_() ############################################################################# def startTxWizard(self, prefill=None, onlyOfflineWallets=False): txWizard = TxWizard(self, self, self.getSelectedWallet(), prefill, onlyOfflineWallets=onlyOfflineWallets) txWizard.exec_() ############################################################################# def exportLogFile(self): LOGDEBUG('exportLogFile') reply = QMessageBox.warning(self, tr('Bug Reporting'), tr(""" As of version 0.91, Armory now includes a form for reporting problems with the software. Please use "Help"\xe2\x86\x92"Submit Bug Report" to send a report directly to the Armory team, which will include your log file automatically."""), QMessageBox.Ok | QMessageBox.Cancel) if not reply==QMessageBox.Ok: return if self.logFilePrivacyWarning(wCancel=True): self.saveCombinedLogFile() ############################################################################# def getUserAgreeToPrivacy(self, getAgreement=False): ptype = 'submitbug' if getAgreement else 'generic' dlg = DlgPrivacyPolicy(self, self, ptype) if not dlg.exec_(): return False return dlg.chkUserAgrees.isChecked() ############################################################################# def logFileTriplePrivacyWarning(self): return MsgBoxCustom(MSGBOX.Warning, tr('Privacy Warning'), tr(""" ATI Privacy Policy

You should review the Armory Technologies, Inc. privacy policy before sending any data to ATI servers.

Wallet Analysis Log Files

The wallet analysis logs contain no personally-identifiable information, only a record of errors and inconsistencies found in your wallet file. No private keys or even public keys are included.

Regular Log Files

The regular log files do not contain any security-sensitive information, but some users may consider the information to be privacy-sensitive. The log files may identify some addresses and transactions that are related to your wallets. It is always recommended you include your log files with any request to the Armory team, unless you are uncomfortable with the privacy implications.

Watching-only Wallet

A watching-only wallet is a copy of a regular wallet that does not contain any signing keys. This allows the holder to see the balance and transaction history of the wallet, but not spend any of the funds.

You may be requested to submit a watching-only copy of your wallet to Armory Technologies, Inc. to make sure that there is no risk to the security of your funds. You should not even consider sending your watching-only wallet unless it was specifically requested by an Armory representative.""") % PRIVACY_URL, yesStr="&Ok") ############################################################################# def logFilePrivacyWarning(self, wCancel=False): return MsgBoxCustom(MSGBOX.Warning, tr('Privacy Warning'), tr(""" ATI Privacy Policy
You should review the Armory Technologies, Inc. privacy policy before sending any data to ATI servers.

Armory log files do not contain any security-sensitive information, but some users may consider the information to be privacy-sensitive. The log files may identify some addresses and transactions that are related to your wallets.

No signing-key data is ever written to the log file. Only enough data is there to help the Armory developers track down bugs in the software, but it may still be considered sensitive information to some users.

Please do not send the log file to the Armory developers if you are not comfortable with the privacy implications! However, if you do not send the log file, it may be very difficult or impossible for us to help you with your problem.

Advanced tip: You can use "File"\xe2\x86\x92"Export Log File" from the main window to save a copy of the log file that you can manually review."""), wCancel=wCancel, yesStr="&Ok") ############################################################################# def saveCombinedLogFile(self, saveFile=None): if saveFile is None: # TODO: Interleave the C++ log and the python log. # That could be a lot of work! defaultFN = 'armorylog_%s.txt' % \ unixTimeToFormatStr(RightNow(),'%Y%m%d_%H%M') saveFile = self.getFileSave(title='Export Log File', \ ffilter=['Text Files (*.txt)'], \ defaultFilename=defaultFN) if len(unicode(saveFile)) > 0: fout = open(saveFile, 'wb') fout.write(getLastBytesOfFile(ARMORY_LOG_FILE, 256*1024)) fout.write(getLastBytesOfFile(ARMCPP_LOG_FILE, 256*1024)) fout.close() LOGINFO('Log saved to %s', saveFile) ############################################################################# def blinkTaskbar(self): self.activateWindow() ############################################################################# def lookForBitcoind(self): LOGDEBUG('lookForBitcoind') if satoshiIsAvailable(): return 'Running' self.setSatoshiPaths() try: TheSDM.setupSDM(extraExeSearch=self.satoshiExeSearchPath) except: LOGEXCEPT('Error setting up SDM') pass if TheSDM.failedFindExe: return 'StillMissing' return 'AllGood' ############################################################################# def executeModeSwitch(self): LOGDEBUG('executeModeSwitch') if TheSDM.getSDMState() == 'BitcoindExeMissing': bitcoindStat = self.lookForBitcoind() if bitcoindStat=='Running': result = QMessageBox.warning(self, tr('Already running!'), tr(""" The Bitcoin software appears to be installed now, but it needs to be closed for Armory to work. Would you like Armory to close it for you?"""), QMessageBox.Yes | QMessageBox.No) if result==QMessageBox.Yes: self.closeExistingBitcoin() self.startBitcoindIfNecessary() elif bitcoindStat=='StillMissing': QMessageBox.warning(self, tr('Still Missing'), tr(""" The Bitcoin software still appears to be missing. If you just installed it, then please adjust your settings to point to the installation directory."""), QMessageBox.Ok) self.startBitcoindIfNecessary() elif self.doAutoBitcoind and not TheSDM.isRunningBitcoind(): if satoshiIsAvailable(): result = QMessageBox.warning(self, tr('Still Running'), tr(""" 'Bitcoin-Qt is still running. Armory cannot start until 'it is closed. Do you want Armory to close it for you?"""), \ QMessageBox.Yes | QMessageBox.No) if result==QMessageBox.Yes: self.closeExistingBitcoin() self.startBitcoindIfNecessary() else: self.startBitcoindIfNecessary() elif TheBDM.getBDMState() == 'BlockchainReady' and TheBDM.isDirty(): #self.resetBdmBeforeScan() self.startRescanBlockchain() elif TheBDM.getBDMState() in ('Offline','Uninitialized'): #self.resetBdmBeforeScan() TheBDM.setOnlineMode(True) self.switchNetworkMode(NETWORKMODE.Full) else: LOGERROR('ModeSwitch button pressed when it should be disabled') time.sleep(0.3) self.setDashboardDetails() ############################################################################# @TimeThisFunction def resetBdmBeforeScan(self): if TheBDM.getBDMState()=='Scanning': LOGINFO('Aborting load') touchFile(os.path.join(ARMORY_HOME_DIR,'abortload.txt')) os.remove(os.path.join(ARMORY_HOME_DIR,'blkfiles.txt')) TheBDM.Reset(wait=False) for wid,wlt in self.walletMap.iteritems(): TheBDM.registerWallet(wlt.cppWallet) ############################################################################# def setupDashboard(self): LOGDEBUG('setupDashboard') self.lblBusy = QLabel('') if OS_WINDOWS: # Unfortunately, QMovie objects don't work in Windows with py2exe # had to create my own little "Busy" icon and hook it up to the # heartbeat self.lblBusy.setPixmap(QPixmap(':/loadicon_0.png')) self.numHeartBeat = 0 def loadBarUpdate(): if self.lblBusy.isVisible(): self.numHeartBeat += 1 self.lblBusy.setPixmap(QPixmap(':/loadicon_%d.png' % \ (self.numHeartBeat%6))) self.extraHeartbeatAlways.append(loadBarUpdate) else: self.qmov = QMovie(':/busy.gif') self.lblBusy.setMovie( self.qmov ) self.qmov.start() self.btnModeSwitch = QPushButton('') self.connect(self.btnModeSwitch, SIGNAL('clicked()'), \ self.executeModeSwitch) # Will switch this to array/matrix of widgets if I get more than 2 rows self.lblDashModeTorrent = QRichLabel('',doWrap=False) self.lblDashModeSync = QRichLabel('',doWrap=False) self.lblDashModeBuild = QRichLabel('',doWrap=False) self.lblDashModeScan = QRichLabel('',doWrap=False) self.lblDashModeTorrent.setAlignment(Qt.AlignLeft | Qt.AlignVCenter) self.lblDashModeSync.setAlignment( Qt.AlignLeft | Qt.AlignVCenter) self.lblDashModeBuild.setAlignment( Qt.AlignLeft | Qt.AlignVCenter) self.lblDashModeScan.setAlignment( Qt.AlignLeft | Qt.AlignVCenter) self.barProgressTorrent = QProgressBar(self) self.barProgressSync = QProgressBar(self) self.barProgressBuild = QProgressBar(self) self.barProgressScan = QProgressBar(self) self.barProgressTorrent.setRange(0,100) self.barProgressSync.setRange(0,100) self.barProgressBuild.setRange(0,100) self.barProgressScan.setRange(0,100) self.lblTorrentStats = QRichLabel('', hAlign=Qt.AlignHCenter) twid = relaxedSizeStr(self,'99 seconds')[0] self.lblTimeLeftTorrent = QRichLabel('') self.lblTimeLeftSync = QRichLabel('') self.lblTimeLeftBuild = QRichLabel('') self.lblTimeLeftScan = QRichLabel('') self.lblTimeLeftSync.setMinimumWidth(twid) self.lblTimeLeftScan.setMinimumWidth(twid) self.lblStatsTorrent = QRichLabel('') layoutDashMode = QGridLayout() layoutDashMode.addWidget(self.lblDashModeTorrent, 0,0) layoutDashMode.addWidget(self.barProgressTorrent, 0,1) layoutDashMode.addWidget(self.lblTimeLeftTorrent, 0,2) layoutDashMode.addWidget(self.lblTorrentStats, 1,0) layoutDashMode.addWidget(self.lblDashModeSync, 2,0) layoutDashMode.addWidget(self.barProgressSync, 2,1) layoutDashMode.addWidget(self.lblTimeLeftSync, 2,2) layoutDashMode.addWidget(self.lblDashModeBuild, 3,0) layoutDashMode.addWidget(self.barProgressBuild, 3,1) layoutDashMode.addWidget(self.lblTimeLeftBuild, 3,2) layoutDashMode.addWidget(self.lblDashModeScan, 4,0) layoutDashMode.addWidget(self.barProgressScan, 4,1) layoutDashMode.addWidget(self.lblTimeLeftScan, 4,2) layoutDashMode.addWidget(self.lblBusy, 0,3, 5,1) layoutDashMode.addWidget(self.btnModeSwitch, 0,3, 5,1) self.frmDashModeSub = QFrame() self.frmDashModeSub.setFrameStyle(STYLE_SUNKEN) self.frmDashModeSub.setLayout(layoutDashMode) self.frmDashMode = makeHorizFrame(['Stretch', \ self.frmDashModeSub, \ 'Stretch']) self.lblDashDescr1 = QRichLabel('') self.lblDashDescr2 = QRichLabel('') for lbl in [self.lblDashDescr1, self.lblDashDescr2]: # One textbox above buttons, one below lbl.setStyleSheet('padding: 5px') qpal = lbl.palette() qpal.setColor(QPalette.Base, Colors.Background) lbl.setPalette(qpal) lbl.setOpenExternalLinks(True) # Set up an array of buttons in the middle of the dashboard, to be used # to help the user install bitcoind. self.lblDashBtnDescr = QRichLabel('') self.lblDashBtnDescr.setOpenExternalLinks(True) BTN,LBL,TTIP = range(3) self.dashBtns = [[None]*3 for i in range(5)] self.dashBtns[DASHBTNS.Close ][BTN] = QPushButton('Close Bitcoin Process') self.dashBtns[DASHBTNS.Install ][BTN] = QPushButton('Download Bitcoin') self.dashBtns[DASHBTNS.Browse ][BTN] = QPushButton('Open www.bitcoin.org') self.dashBtns[DASHBTNS.Instruct][BTN] = QPushButton('Installation Instructions') self.dashBtns[DASHBTNS.Settings][BTN] = QPushButton('Change Settings') ##### def openBitcoinOrg(): webbrowser.open('http://www.bitcoin.org/en/download') ##### def openInstruct(): if OS_WINDOWS: webbrowser.open('https://www.bitcoinarmory.com/install-windows/') elif OS_LINUX: webbrowser.open('https://www.bitcoinarmory.com/install-linux/') elif OS_MACOSX: webbrowser.open('https://www.bitcoinarmory.com/install-macosx/') self.connect(self.dashBtns[DASHBTNS.Close][BTN], SIGNAL('clicked()'), \ self.closeExistingBitcoin) self.connect(self.dashBtns[DASHBTNS.Install][BTN], SIGNAL('clicked()'), \ self.openDLSatoshi) self.connect(self.dashBtns[DASHBTNS.Browse][BTN], SIGNAL('clicked()'), \ openBitcoinOrg) self.connect(self.dashBtns[DASHBTNS.Settings][BTN], SIGNAL('clicked()'), \ self.openSettings) #self.connect(self.dashBtns[DASHBTNS.Instruct][BTN], SIGNAL('clicked()'), \ #self.openInstructWindow) self.dashBtns[DASHBTNS.Close][LBL] = QRichLabel( \ 'Stop existing Bitcoin processes so that Armory can open its own') self.dashBtns[DASHBTNS.Browse][LBL] = QRichLabel( \ 'Open browser to Bitcoin webpage to download and install Bitcoin software') self.dashBtns[DASHBTNS.Instruct][LBL] = QRichLabel( \ 'Instructions for manually installing Bitcoin for operating system') self.dashBtns[DASHBTNS.Settings][LBL] = QRichLabel( \ 'Open Armory settings window to change Bitcoin software management') self.dashBtns[DASHBTNS.Browse][TTIP] = self.createToolTipWidget( \ 'Will open your default browser to http://www.bitcoin.org where you can ' 'download the latest version of Bitcoin-Qt, and get other information ' 'and links about Bitcoin, in general.') self.dashBtns[DASHBTNS.Instruct][TTIP] = self.createToolTipWidget( \ 'Instructions are specific to your operating system and include ' 'information to help you verify you are installing the correct software') self.dashBtns[DASHBTNS.Settings][TTIP] = self.createToolTipWidget( 'Change Bitcoin-Qt/bitcoind management settings or point Armory to ' 'a non-standard Bitcoin installation') self.dashBtns[DASHBTNS.Close][TTIP] = self.createToolTipWidget( \ 'Armory has detected a running Bitcoin-Qt or bitcoind instance and ' 'will force it to exit') self.dashBtns[DASHBTNS.Install][BTN].setEnabled(False) self.dashBtns[DASHBTNS.Install][LBL] = QRichLabel('') self.dashBtns[DASHBTNS.Install][LBL].setText( \ 'This option is not yet available yet!', color='DisableFG') self.dashBtns[DASHBTNS.Install][TTIP] = QRichLabel('') # disabled #if OS_LINUX: if OS_WINDOWS: self.dashBtns[DASHBTNS.Install][BTN].setEnabled(True) self.dashBtns[DASHBTNS.Install][LBL] = QRichLabel('') self.dashBtns[DASHBTNS.Install][LBL].setText( \ 'Securely download Bitcoin software for Windows %s' % OS_VARIANT[0]) self.dashBtns[DASHBTNS.Install][TTIP] = self.createToolTipWidget( \ 'The downloaded files are cryptographically verified. ' 'Using this option will start the installer, you will ' 'have to click through it to complete installation.') #self.lblDashInstallForMe = QRichLabel( \ #'Armory will download, verify, and start the Bitcoin installer for you') #self.ttipInstallForMe = self.createToolTipWidget( \ #'Armory will download the latest version of the Bitcoin software ' #'for Windows and verify its digital signatures. You will have to ' #'click through the installation options.') elif OS_LINUX: # Only display the install button if using a debian-based distro dist = platform.linux_distribution() if dist[0] in ['Ubuntu','LinuxMint'] or 'debian' in dist: self.dashBtns[DASHBTNS.Install][BTN].setEnabled(True) self.dashBtns[DASHBTNS.Install][LBL] = QRichLabel( tr(""" Download and Install Bitcoin Core for Ubuntu/Debian""")) self.dashBtns[DASHBTNS.Install][TTIP] = self.createToolTipWidget( tr(""" 'Will download and Bitcoin software and cryptographically verify it""")) elif OS_MACOSX: pass else: LOGERROR('Unrecognized OS!') self.frmDashMgmtButtons = QFrame() self.frmDashMgmtButtons.setFrameStyle(STYLE_SUNKEN) layoutButtons = QGridLayout() layoutButtons.addWidget(self.lblDashBtnDescr, 0,0, 1,3) for r in range(5): for c in range(3): if c==LBL: wMin = tightSizeNChar(self, 50)[0] self.dashBtns[r][c].setMinimumWidth(wMin) layoutButtons.addWidget(self.dashBtns[r][c], r+1,c) self.frmDashMgmtButtons.setLayout(layoutButtons) self.frmDashMidButtons = makeHorizFrame(['Stretch', \ self.frmDashMgmtButtons, 'Stretch']) dashLayout = QVBoxLayout() dashLayout.addWidget(self.frmDashMode) dashLayout.addWidget(self.lblDashDescr1) dashLayout.addWidget(self.frmDashMidButtons ) dashLayout.addWidget(self.lblDashDescr2) frmInner = QFrame() frmInner.setLayout(dashLayout) self.dashScrollArea = QScrollArea() self.dashScrollArea.setWidgetResizable(True) self.dashScrollArea.setWidget(frmInner) scrollLayout = QVBoxLayout() scrollLayout.addWidget(self.dashScrollArea) self.tabDashboard.setLayout(scrollLayout) ############################################################################# def setupAnnounceTab(self): self.lblAlertStr = QRichLabel(tr(""" Announcements and alerts from Armory Technologies, Inc."""), doWrap=False, hAlign=Qt.AlignHCenter) def checkUpd(): lastUpdate = self.announceFetcher.getLastSuccessfulFetchTime() self.explicitCheckAnnouncements(5) lastUpdate2 = self.announceFetcher.getLastSuccessfulFetchTime() if lastUpdate==lastUpdate2: QMessageBox.warning(self, tr('Not Available'), tr(""" Could not access the Armory Technologies, Inc. announcement feeder. Try again in a couple minutes.""") % \ htmlColor('TextGreen'), QMessageBox.Ok) else: QMessageBox.warning(self, tr('Update'), tr(""" Announcements are now up to date!"""), QMessageBox.Ok) self.lblLastUpdated = QRichLabel('', doWrap=False) self.btnCheckForUpdates = QPushButton(tr('Check for Updates')) self.connect(self.btnCheckForUpdates, SIGNAL(CLICKED), checkUpd) frmLastUpdate = makeHorizFrame(['Stretch', \ self.lblLastUpdated, \ self.btnCheckForUpdates, \ 'Stretch']) self.icoArmorySWVersion = QLabel('') self.lblArmorySWVersion = QRichLabel(tr(""" No version information is available"""), doWrap=False) self.icoSatoshiSWVersion = QLabel('') self.lblSatoshiSWVersion = QRichLabel('', doWrap=False) self.btnSecureDLArmory = QPushButton(tr('Secure Downloader')) self.btnSecureDLSatoshi = QPushButton(tr('Secure Downloader')) self.btnSecureDLArmory.setVisible(False) self.btnSecureDLSatoshi.setVisible(False) self.connect(self.btnSecureDLArmory, SIGNAL(CLICKED), self.openDLArmory) self.connect(self.btnSecureDLSatoshi, SIGNAL(CLICKED), self.openDLSatoshi) frmVersions = QFrame() layoutVersions = QGridLayout() layoutVersions.addWidget(self.icoArmorySWVersion, 0,0) layoutVersions.addWidget(self.lblArmorySWVersion, 0,1) layoutVersions.addWidget(self.btnSecureDLArmory, 0,2) layoutVersions.addWidget(self.icoSatoshiSWVersion, 1,0) layoutVersions.addWidget(self.lblSatoshiSWVersion, 1,1) layoutVersions.addWidget(self.btnSecureDLSatoshi, 1,2) layoutVersions.setColumnStretch(0,0) layoutVersions.setColumnStretch(1,1) layoutVersions.setColumnStretch(2,0) frmVersions.setLayout(layoutVersions) frmVersions.setFrameStyle(STYLE_RAISED) lblVerHeader = QRichLabel(tr(""" Software Version Updates:"""), doWrap=False, \ hAlign=Qt.AlignHCenter) lblTableHeader = QRichLabel(tr(""" All Available Notifications:"""), doWrap=False, \ hAlign=Qt.AlignHCenter) # We need to generate popups when a widget is clicked, and be able # change that particular widget's target, when the table is updated. # Create one of these DlgGen objects for each of the 10 rows, simply # update it's nid and notifyMap when the table is updated class DlgGen(): def setParams(self, parent, nid, notifyMap): self.parent = parent self.nid = nid self.notifyMap = notifyMap def __call__(self): return DlgNotificationWithDNAA(self.parent, self.parent, \ self.nid, self.notifyMap, False).exec_() self.announceTableWidgets = \ [[QLabel(''), QRichLabel(''), QLabelButton('+'), DlgGen()] \ for i in range(10)] layoutTable = QGridLayout() for i in range(10): for j in range(3): layoutTable.addWidget(self.announceTableWidgets[i][j], i,j) self.connect(self.announceTableWidgets[i][2], SIGNAL(CLICKED), \ self.announceTableWidgets[i][3]) layoutTable.setColumnStretch(0,0) layoutTable.setColumnStretch(1,1) layoutTable.setColumnStretch(2,0) frmTable = QFrame() frmTable.setLayout(layoutTable) frmTable.setFrameStyle(STYLE_SUNKEN) self.updateAnnounceTable() frmEverything = makeVertFrame( [ self.lblAlertStr, frmLastUpdate, 'Space(30)', lblTableHeader, frmTable, 'Space(30)', lblVerHeader, frmVersions, 'Stretch']) frmEverything.setMinimumWidth(300) frmEverything.setMaximumWidth(800) frmFinal = makeHorizFrame(['Stretch', frmEverything, 'Stretch']) self.announceScrollArea = QScrollArea() self.announceScrollArea.setWidgetResizable(True) self.announceScrollArea.setWidget(frmFinal) scrollLayout = QVBoxLayout() scrollLayout.addWidget(self.announceScrollArea) self.tabAnnounce.setLayout(scrollLayout) self.announceIsSetup = True ############################################################################# def openDownloaderAll(self): dl,cl = self.getDownloaderData() if not dl is None and not cl is None: UpgradeDownloaderDialog(self, self, None, dl, cl).exec_() ############################################################################# def openDLArmory(self): dl,cl = self.getDownloaderData() if not dl is None and not cl is None: UpgradeDownloaderDialog(self, self, 'Armory', dl, cl).exec_() ############################################################################# def openDLSatoshi(self): dl,cl = self.getDownloaderData() if not dl is None and not cl is None: UpgradeDownloaderDialog(self, self, 'Satoshi', dl, cl).exec_() ############################################################################# def getDownloaderData(self): dl = self.announceFetcher.getAnnounceFile('downloads') cl = self.announceFetcher.getAnnounceFile('changelog') dlObj = downloadLinkParser().parseDownloadList(dl) clObj = changelogParser().parseChangelogText(cl) if dlObj is None or clObj is None: QMessageBox.warning(self, tr('No Data'), tr(""" The secure downloader has not received any download data to display. Either the Armory Technologies, Inc. announcement feeder is down, or this computer cannot access the server.""") % \ htmlColor('TextGreen'), QMessageBox.Ok) return None,None lastUpdate = self.announceFetcher.getLastSuccessfulFetchTime() sinceLastUpd = RightNow() - lastUpdate if lastUpdate < RightNow()-1*WEEK: QMessageBox.warning(self, tr('Old Data'), tr(""" The last update retrieved from the Armory Technologies, Inc. announcement feeder was %s ago. The following downloads may not be the latest available.""") % (htmlColor("TextGreen"), \ secondsToHumanTime(sinceLastUpd)), QMessageBox.Ok) dl = self.announceFetcher.getAnnounceFile('downloads') cl = self.announceFetcher.getAnnounceFile('changelog') return dl,cl ############################################################################# def updateAnnounceTab(self, *args): if not self.announceIsSetup: return iconArmory = ':/armory_icon_32x32.png' iconSatoshi = ':/bitcoinlogo.png' iconInfoFile = ':/MsgBox_info48.png' iconGoodFile = ':/MsgBox_good48.png' iconWarnFile = ':/MsgBox_warning48.png' iconCritFile = ':/MsgBox_critical24.png' lastUpdate = self.announceFetcher.getLastSuccessfulFetchTime() noAnnounce = (lastUpdate == 0) if noAnnounce: self.lblLastUpdated.setText(tr("No announcement data was found!")) self.btnSecureDLArmory.setVisible(False) self.icoArmorySWVersion.setVisible(True) self.lblArmorySWVersion.setText(tr(""" You are running Armory version %s""") % getVersionString(BTCARMORY_VERSION)) else: updTimeStr = unixTimeToFormatStr(lastUpdate) self.lblLastUpdated.setText(tr("Last Updated: %s") % updTimeStr) verStrToInt = lambda s: getVersionInt(readVersionString(s)) # Notify of Armory updates self.icoArmorySWVersion.setPixmap(QPixmap(iconArmory).scaled(24,24)) self.icoSatoshiSWVersion.setPixmap(QPixmap(iconSatoshi).scaled(24,24)) try: armCurrent = verStrToInt(self.armoryVersions[0]) armLatest = verStrToInt(self.armoryVersions[1]) if armCurrent >= armLatest: dispIcon = QPixmap(iconArmory).scaled(24,24) self.icoArmorySWVersion.setPixmap(dispIcon) self.btnSecureDLArmory.setVisible(False) self.lblArmorySWVersion.setText(tr(""" You are using the latest version of Armory""")) else: dispIcon = QPixmap(iconWarnFile).scaled(24,24) self.icoArmorySWVersion.setPixmap(dispIcon) self.btnSecureDLArmory.setVisible(True) self.lblArmorySWVersion.setText(tr(""" There is a newer version of Armory available!""")) self.btnSecureDLArmory.setVisible(True) self.icoArmorySWVersion.setVisible(True) except: self.btnSecureDLArmory.setVisible(False) self.lblArmorySWVersion.setText(tr(""" You are running Armory version %s""") % getVersionString(BTCARMORY_VERSION)) try: satCurrStr,satLastStr = self.satoshiVersions satCurrent = verStrToInt(satCurrStr) if satCurrStr else 0 satLatest = verStrToInt(satLastStr) if satLastStr else 0 # Show CoreBTC updates if satCurrent and satLatest: if satCurrent >= satLatest: dispIcon = QPixmap(iconGoodFile).scaled(24,24) self.btnSecureDLSatoshi.setVisible(False) self.icoSatoshiSWVersion.setPixmap(dispIcon) self.lblSatoshiSWVersion.setText(tr(""" You are using the latest version of core Bitcoin (%s)""") % satCurrStr) else: dispIcon = QPixmap(iconWarnFile).scaled(24,24) self.btnSecureDLSatoshi.setVisible(True) self.icoSatoshiSWVersion.setPixmap(dispIcon) self.lblSatoshiSWVersion.setText(tr(""" There is a newer version of the core Bitcoin software available!""")) elif satCurrent: # satLatest is not available dispIcon = QPixmap(iconGoodFile).scaled(24,24) self.btnSecureDLSatoshi.setVisible(False) self.icoSatoshiSWVersion.setPixmap(None) self.lblSatoshiSWVersion.setText(tr(""" You are using core Bitcoin version %s""") % satCurrStr) elif satLatest: # only satLatest is avail (maybe offline) dispIcon = QPixmap(iconSatoshi).scaled(24,24) self.btnSecureDLSatoshi.setVisible(True) self.icoSatoshiSWVersion.setPixmap(dispIcon) self.lblSatoshiSWVersion.setText(tr("""Core Bitcoin version %s is available.""") % satLastStr) else: # only satLatest is avail (maybe offline) dispIcon = QPixmap(iconSatoshi).scaled(24,24) self.btnSecureDLSatoshi.setVisible(False) self.icoSatoshiSWVersion.setPixmap(dispIcon) self.lblSatoshiSWVersion.setText(tr("""No version information is available for core Bitcoin""") ) #self.btnSecureDLSatoshi.setVisible(False) #if self.satoshiVersions[0]: #self.lblSatoshiSWVersion.setText(tr(""" You are running #core Bitcoin software version %s""") % self.satoshiVersions[0]) #else: #self.lblSatoshiSWVersion.setText(tr("""No information is #available for the core Bitcoin software""")) except: LOGEXCEPT('Failed to process satoshi versions') self.updateAnnounceTable() ############################################################################# def updateAnnounceTable(self): # Default: Make everything non-visible except first row, middle column for i in range(10): for j in range(3): self.announceTableWidgets[i][j].setVisible(i==0 and j==1) if len(self.almostFullNotificationList)==0: self.announceTableWidgets[0][1].setText(tr(""" There are no announcements or alerts to display""")) return alertsForSorting = [] for nid,nmap in self.almostFullNotificationList.iteritems(): alertsForSorting.append([nid, int(nmap['PRIORITY'])]) sortedAlerts = sorted(alertsForSorting, key=lambda a: -a[1])[:10] i = 0 for nid,priority in sortedAlerts: if priority>=4096: pixm = QPixmap(':/MsgBox_critical64.png') elif priority>=3072: pixm = QPixmap(':/MsgBox_warning48.png') elif priority>=2048: pixm = QPixmap(':/MsgBox_info48.png') else: pixm = QPixmap(':/MsgBox_info48.png') shortDescr = self.almostFullNotificationList[nid]['SHORTDESCR'] if priority>=4096: shortDescr = '' + shortDescr + '' shortDescr = shortDescr % htmlColor('TextWarn') self.announceTableWidgets[i][0].setPixmap(pixm.scaled(24,24)) self.announceTableWidgets[i][1].setText(shortDescr) self.announceTableWidgets[i][2].setVisible(True) self.announceTableWidgets[i][3].setParams(self, nid, \ self.almostFullNotificationList[nid]) for j in range(3): self.announceTableWidgets[i][j].setVisible(True) i += 1 ############################################################################# def explicitCheckAnnouncements(self, waitTime=3): self.announceFetcher.fetchRightNow(waitTime) self.processAnnounceData() self.updateAnnounceTab() ############################################################################# def closeExistingBitcoin(self): for proc in psutil.process_iter(): if proc.name.lower() in ['bitcoind.exe','bitcoin-qt.exe',\ 'bitcoind','bitcoin-qt']: killProcess(proc.pid) time.sleep(2) return # If got here, never found it QMessageBox.warning(self, 'Not Found', \ 'Attempted to kill the running Bitcoin-Qt/bitcoind instance, ' 'but it was not found. ', QMessageBox.Ok) ############################################################################# def getPercentageFinished(self, maxblk, lastblk): curr = EstimateCumulativeBlockchainSize(lastblk) maxb = EstimateCumulativeBlockchainSize(maxblk) return float(curr)/float(maxb) ############################################################################# def updateSyncProgress(self): if TheTDM.getTDMState()=='Downloading': dlSpeed = TheTDM.getLastStats('downRate') timeEst = TheTDM.getLastStats('timeEst') fracDone = TheTDM.getLastStats('fracDone') numSeeds = TheTDM.getLastStats('numSeeds') numPeers = TheTDM.getLastStats('numPeers') self.barProgressTorrent.setVisible(True) self.lblDashModeTorrent.setVisible(True) self.lblTimeLeftTorrent.setVisible(True) self.lblTorrentStats.setVisible(True) self.barProgressTorrent.setFormat('%p%') self.lblDashModeSync.setVisible(True) self.barProgressSync.setVisible(True) self.barProgressSync.setValue(0) self.lblTimeLeftSync.setVisible(True) self.barProgressSync.setFormat('') self.lblDashModeBuild.setVisible(True) self.barProgressBuild.setVisible(True) self.barProgressBuild.setValue(0) self.lblTimeLeftBuild.setVisible(True) self.barProgressBuild.setFormat('') self.lblDashModeScan.setVisible(True) self.barProgressScan.setVisible(True) self.barProgressScan.setValue(0) self.lblTimeLeftScan.setVisible(True) self.barProgressScan.setFormat('') if not numSeeds: self.barProgressTorrent.setValue(0) self.lblTimeLeftTorrent.setText('') self.lblTorrentStats.setText('') self.lblDashModeTorrent.setText(tr('Initializing Torrent Engine'), \ size=4, bold=True, color='Foreground') self.lblTorrentStats.setVisible(False) else: self.lblDashModeTorrent.setText(tr('Downloading via Armory CDN'), \ size=4, bold=True, color='Foreground') if fracDone: self.barProgressTorrent.setValue(int(99.9*fracDone)) if timeEst: self.lblTimeLeftTorrent.setText(secondsToHumanTime(timeEst)) self.lblTorrentStats.setText(tr(""" Bootstrap Torrent: %s/sec from %d peers""") % \ (bytesToHumanSize(dlSpeed), numSeeds+numPeers)) self.lblTorrentStats.setVisible(True) elif TheBDM.getBDMState()=='Scanning': self.barProgressTorrent.setVisible(TheTDM.isStarted()) self.lblDashModeTorrent.setVisible(TheTDM.isStarted()) self.barProgressTorrent.setValue(100) self.lblTimeLeftTorrent.setVisible(False) self.lblTorrentStats.setVisible(False) self.barProgressTorrent.setFormat('') self.lblDashModeSync.setVisible(self.doAutoBitcoind) self.barProgressSync.setVisible(self.doAutoBitcoind) self.barProgressSync.setValue(100) self.lblTimeLeftSync.setVisible(False) self.barProgressSync.setFormat('') self.lblDashModeBuild.setVisible(True) self.barProgressBuild.setVisible(True) self.lblTimeLeftBuild.setVisible(True) self.lblDashModeScan.setVisible(True) self.barProgressScan.setVisible(True) self.lblTimeLeftScan.setVisible(True) # Scan time is super-simple to predict: it's pretty much linear # with the number of bytes remaining. phase,pct,rate,tleft = TheBDM.predictLoadTime() if phase==1: self.lblDashModeBuild.setText( 'Building Databases', \ size=4, bold=True, color='Foreground') self.lblDashModeScan.setText( 'Scan Transaction History', \ size=4, bold=True, color='DisableFG') self.barProgressBuild.setFormat('%p%') self.barProgressScan.setFormat('') elif phase==3: self.lblDashModeBuild.setText( 'Build Databases', \ size=4, bold=True, color='DisableFG') self.lblDashModeScan.setText( 'Scanning Transaction History', \ size=4, bold=True, color='Foreground') self.lblTimeLeftBuild.setVisible(False) self.barProgressBuild.setFormat('') self.barProgressBuild.setValue(100) self.barProgressScan.setFormat('%p%') elif phase==4: self.lblDashModeScan.setText( 'Global Blockchain Index', \ size=4, bold=True, color='Foreground') tleft15 = (int(tleft-1)/15 + 1)*15 if tleft < 2: tstring = '' pvalue = 100 else: tstring = secondsToHumanTime(tleft15) pvalue = pct*100 if phase==1: self.lblTimeLeftBuild.setText(tstring) self.barProgressBuild.setValue(pvalue) elif phase==3: self.lblTimeLeftScan.setText(tstring) self.barProgressScan.setValue(pvalue) elif TheSDM.getSDMState() in ['BitcoindInitializing','BitcoindSynchronizing']: self.barProgressTorrent.setVisible(TheTDM.isStarted()) self.lblDashModeTorrent.setVisible(TheTDM.isStarted()) self.barProgressTorrent.setValue(100) self.lblTimeLeftTorrent.setVisible(False) self.lblTorrentStats.setVisible(False) self.barProgressTorrent.setFormat('') self.lblDashModeSync.setVisible(True) self.barProgressSync.setVisible(True) self.lblTimeLeftSync.setVisible(True) self.barProgressSync.setFormat('%p%') self.lblDashModeBuild.setVisible(True) self.barProgressBuild.setVisible(True) self.lblTimeLeftBuild.setVisible(False) self.barProgressBuild.setValue(0) self.barProgressBuild.setFormat('') self.lblDashModeScan.setVisible(True) self.barProgressScan.setVisible(True) self.lblTimeLeftScan.setVisible(False) self.barProgressScan.setValue(0) self.barProgressScan.setFormat('') ssdm = TheSDM.getSDMState() lastBlkNum = self.getSettingOrSetDefault('LastBlkRecv', 0) lastBlkTime = self.getSettingOrSetDefault('LastBlkRecvTime', 0) # Get data from SDM if it has it info = TheSDM.getTopBlockInfo() if len(info['tophash'])>0: lastBlkNum = info['numblks'] lastBlkTime = info['toptime'] # Use a reference point if we are starting from scratch refBlock = max(290746, lastBlkNum) refTime = max(1394922889, lastBlkTime) # Ten min/block is pretty accurate, even from genesis (about 1% slow) # And it gets better as we sync past the reference block above self.approxMaxBlock = refBlock + int((RightNow() - refTime) / (10*MINUTE)) self.approxBlkLeft = self.approxMaxBlock - lastBlkNum self.approxPctSoFar = self.getPercentageFinished(self.approxMaxBlock, \ lastBlkNum) self.initSyncCircBuff.append([RightNow(), self.approxPctSoFar]) if len(self.initSyncCircBuff)>30: # There's always a couple wacky measurements up front, start at 10 t0,p0 = self.initSyncCircBuff[10] t1,p1 = self.initSyncCircBuff[-1] dt,dp = t1-t0, p1-p0 if dt>600: self.initSyncCircBuff = self.initSyncCircBuff[1:] if dp>0 and dt>0: dpPerSec = dp / dt if lastBlkNum < 200000: dpPerSec = dpPerSec / 2 timeRemain = (1 - self.approxPctSoFar) / dpPerSec #timeRemain = min(timeRemain, 8*HOUR) else: timeRemain = None else: timeRemain = None intPct = int(100*self.approxPctSoFar) strPct = '%d%%' % intPct self.barProgressSync.setFormat('%p%') if ssdm == 'BitcoindReady': return (0,0,0.99) # because it's probably not completely done... self.lblTimeLeftSync.setText('Almost Done...') self.barProgressSync.setValue(99) elif ssdm == 'BitcoindSynchronizing': sdmPercent = int(99.9*self.approxPctSoFar) if self.approxBlkLeft < 10000: if self.approxBlkLeft < 200: self.lblTimeLeftSync.setText('%d blocks' % self.approxBlkLeft) else: # If we're within 10k blocks, estimate based on blkspersec if info['blkspersec'] > 0: timeleft = int(self.approxBlkLeft/info['blkspersec']) self.lblTimeLeftSync.setText(secondsToHumanTime(timeleft)) else: # If we're more than 10k blocks behind... if timeRemain: timeRemain = min(24*HOUR, timeRemain) self.lblTimeLeftSync.setText(secondsToHumanTime(timeRemain)) else: self.lblTimeLeftSync.setText('') elif ssdm == 'BitcoindInitializing': sdmPercent = 0 self.barProgressSync.setFormat('') self.barProgressBuild.setFormat('') self.barProgressScan.setFormat('') else: LOGERROR('Should not predict sync info in non init/sync SDM state') return ('UNKNOWN','UNKNOWN', 'UNKNOWN') self.barProgressSync.setValue(sdmPercent) else: LOGWARN('Called updateSyncProgress while not sync\'ing') ############################################################################# def GetDashFunctionalityText(self, func): """ Outsourcing all the verbose dashboard text to here, to de-clutter the logic paths in the setDashboardDetails function """ LOGINFO('Switching Armory functional mode to "%s"', func) if func.lower() == 'scanning': return ( \ 'The following functionality is available while scanning in offline mode:' '

    ' '
  • Create new wallets
    • ' '
  • Generate receiving addresses for your wallets
    • ' '
  • Create backups of your wallets (printed or digital)
    • ' '
  • Change wallet encryption settings
    • ' '
  • Sign transactions created from an online system
    • ' '
  • Sign messages
    • ' '
' '

NOTE: The Bitcoin network will process transactions ' 'to your addresses, even if you are offline. It is perfectly ' 'okay to create and distribute payment addresses while Armory is offline, ' 'you just won\'t be able to verify those payments until the next time ' 'Armory is online.') elif func.lower() == 'offline': return ( \ 'The following functionality is available in offline mode:' '
    ' '
  • Create, import or recover wallets
    • ' '
  • Generate new receiving addresses for your wallets
    • ' '
  • Create backups of your wallets (printed or digital)
    • ' '
  • Import private keys to wallets
    • ' '
  • Change wallet encryption settings
    • ' '
  • Sign messages
    • ' '
  • Sign transactions created from an online system
    • ' '
' '

NOTE: The Bitcoin network will process transactions ' 'to your addresses, regardless of whether you are online. It is perfectly ' 'okay to create and distribute payment addresses while Armory is offline, ' 'you just won\'t be able to verify those payments until the next time ' 'Armory is online.') elif func.lower() == 'online': return ( \ '
    ' '
  • Create, import or recover Armory wallets
    • ' '
  • Generate new addresses to receive coins
    • ' '
  • Send bitcoins to other people
    • ' '
  • Create one-time backups of your wallets (in printed or digital form)
    • ' '
  • Click on "bitcoin:" links in your web browser ' '(not supported on all operating systems)
    • ' '
  • Import private keys to wallets
    • ' '
  • Monitor payments to watching-only wallets and create ' 'unsigned transactions
    • ' '
  • Sign messages
    • ' '
  • Create transactions with watching-only wallets, ' 'to be signed by an offline wallets
    • ' '
') ############################################################################# def GetDashStateText(self, mgmtMode, state): """ Outsourcing all the verbose dashboard text to here, to de-clutter the logic paths in the setDashboardDetails function """ LOGINFO('Switching Armory state text to Mgmt:%s, State:%s', mgmtMode, state) # A few states don't care which mgmtMode you are in... if state == 'NewUserInfo': return tr(""" For more information about Armory, and even Bitcoin itself, you should visit the frequently asked questions page. If you are experiencing problems using this software, please visit the Armory troubleshooting webpage. It will be updated frequently with solutions to common problems.

IMPORTANT: Make a backup of your wallet(s)! Paper backups protect you forever against forgotten passwords, hard-drive failure, and make it easy for your family to recover your funds if something terrible happens to you. Each wallet only needs to be backed up once, ever! Without it, you are at risk of losing all of your Bitcoins! For more information, visit the Armory Backups page.

To learn about improving your security through the use of offline wallets, visit the Armory Quick Start Guide, and the Offline Wallet Tutorial.

""") elif state == 'OnlineFull1': return ( \ '

You now have access to all the features Armory has to offer!
' 'To see your balances and transaction history, please click ' 'on the "Transactions" tab above this text.
' 'Here\'s some things you can do with Armory Bitcoin Client:' '
') elif state == 'OnlineFull2': return ( \ ('If you experience any performance issues with Armory, ' 'please confirm that Bitcoin-Qt is running and fully ' 'synchronized with the Bitcoin network. You will see ' 'a green checkmark in the bottom right corner of the ' 'Bitcoin-Qt window if it is synchronized. If not, it is ' 'recommended you close Armory and restart it only when you ' 'see that checkmark.' '

' if not self.doAutoBitcoind else '') + ( 'Please backup your wallets! Armory wallets are ' '"deterministic", meaning they only need to be backed up ' 'one time (unless you have imported external addresses/keys). ' 'Make a backup and keep it in a safe place! All funds from ' 'Armory-generated addresses will always be recoverable with ' 'a paper backup, any time in the future. Use the "Backup ' 'Individual Keys" option for each wallet to backup imported ' 'keys.

')) elif state == 'OnlineNeedSweep': return ( \ 'Armory is currently online, but you have requested a sweep operation ' 'on one or more private keys. This requires searching the global ' 'transaction history for the available balance of the keys to be ' 'swept. ' '

' 'Press the button to start the blockchain scan, which ' 'will also put Armory into offline mode for a few minutes ' 'until the scan operation is complete') elif state == 'OnlineDirty': return ( \ 'Wallet balances may ' 'be incorrect until the rescan operation is performed!' '

' 'Armory is currently online, but addresses/keys have been added ' 'without rescanning the blockchain. You may continue using ' 'Armory in online mode, but any transactions associated with the ' 'new addresses will not appear in the ledger. ' '

' 'Pressing the button above will put Armory into offline mode ' 'for a few minutes until the scan operation is complete.') elif state == 'OfflineNoSatoshiNoInternet': return ( \ 'There is no connection to the internet, and there is no other ' 'Bitcoin software running. Most likely ' 'you are here because this is a system dedicated ' 'to manage offline wallets! ' '

' 'If you expected Armory to be in online mode, ' 'please verify your internet connection is active, ' 'then restart Armory. If you think the lack of internet ' 'connection is in error (such as if you are using Tor), ' 'then you can restart Armory with the "--skip-online-check" ' 'option, or change it in the Armory settings.' '

' 'If you do not have Bitcoin-Qt installed, you can ' 'download it from ' 'http://www.bitcoin.org.') # Branch the available display text based on which Satoshi-Management # mode Armory is using. It probably wasn't necessary to branch the # the code like this, but it helped me organize the seemingly-endless # number of dashboard screens I need if mgmtMode.lower()=='user': if state == 'OfflineButOnlinePossible': return ( \ 'You are currently in offline mode, but can ' 'switch to online mode by pressing the button above. However, ' 'it is not recommended that you switch until ' 'Bitcoin-Qt/bitcoind is fully synchronized with the bitcoin network. ' 'You will see a green checkmark in the bottom-right corner of ' 'the Bitcoin-Qt window when it is finished.' '

' 'Switching to online mode will give you access ' 'to more Armory functionality, including sending and receiving ' 'bitcoins and viewing the balances and transaction histories ' 'of each of your wallets.

') elif state == 'OfflineNoSatoshi': bitconf = os.path.join(BTC_HOME_DIR, 'bitcoin.conf') return ( \ 'You are currently in offline mode because ' 'Bitcoin-Qt is not running. To switch to online ' 'mode, start Bitcoin-Qt and let it synchronize with the network ' '-- you will see a green checkmark in the bottom-right corner when ' 'it is complete. If Bitcoin-Qt is already running and you believe ' 'the lack of connection is an error (especially if using proxies), ' 'please see ' 'this link for options.' '

' 'If you prefer to have Armory do this for you, ' 'then please check "Let Armory run ' 'Bitcoin-Qt in the background" under "File"->"Settings."' '

' 'If you are new to Armory and/or Bitcoin-Qt, ' 'please visit the Armory ' 'webpage for more information. Start at ' '' 'Why Armory needs Bitcoin-Qt or go straight to our ' 'frequently asked questions page for more general information. ' 'If you already know what you\'re doing and simply need ' 'to fetch the latest version of Bitcoin-Qt, you can download it from ' 'http://www.bitcoin.org.') elif state == 'OfflineNoInternet': return ( \ 'You are currently in offline mode because ' 'Armory could not detect an internet connection. ' 'If you think this is in error, then ' 'restart Armory using the " --skip-online-check" option, ' 'or adjust the Armory settings. Then restart Armory.' '

' 'If this is intended to be an offline computer, note ' 'that it is not necessary to have Bitcoin-Qt or bitcoind ' 'running.' ) elif state == 'OfflineNoBlkFiles': return ( \ 'You are currently in offline mode because ' 'Armory could not find the blockchain files produced ' 'by Bitcoin-Qt. Do you run Bitcoin-Qt (or bitcoind) ' 'from a non-standard directory? Armory expects to ' 'find the blkXXXX.dat files in

%s

' 'If you know where they are located, please restart ' 'Armory using the " --satoshi-datadir=[path]" ' 'to notify Armory where to find them.') % BLKFILE_DIR elif state == 'Disconnected': return ( \ 'Armory was previously online, but the connection to Bitcoin-Qt/' 'bitcoind was interrupted. You will not be able to send bitcoins ' 'or confirm receipt of bitcoins until the connection is ' 'reestablished. br>
Please check that Bitcoin-Qt is open ' 'and synchronized with the network. Armory will try to ' 'reconnect automatically when the connection is available ' 'again. If Bitcoin-Qt is available again, and reconnection does ' 'not happen, please restart Armory.

') elif state == 'ScanNoWallets': return ( \ 'Please wait while the global transaction history is scanned. ' 'Armory will go into online mode automatically, as soon as ' 'the scan is complete.') elif state == 'ScanWithWallets': return ( \ 'Armory is scanning the global transaction history to retrieve ' 'information about your wallets. The "Transactions" tab will ' 'be updated with wallet balance and history as soon as the scan is ' 'complete. You may manage your wallets while you wait.

') else: LOGERROR('Unrecognized dashboard state: Mgmt:%s, State:%s', \ mgmtMode, state) return '' elif mgmtMode.lower()=='auto': if state == 'OfflineBitcoindRunning': return ( \ 'It appears you are already running Bitcoin software ' '(Bitcoin-Qt or bitcoind). ' 'Unlike previous versions of Armory, you should not run ' 'this software yourself -- Armory ' 'will run it in the background for you. Either close the ' 'Bitcoin application or adjust your settings. If you change ' 'your settings, then please restart Armory.') if state == 'OfflineNeedBitcoinInst': return ( \ 'Only one more step to getting online with Armory! You ' 'must install the Bitcoin software from www.bitcoin.org in order ' 'for Armory to communicate with the Bitcoin network. If the ' 'Bitcoin software is already installed and/or you would prefer ' 'to manage it yourself, please adjust your settings and ' 'restart Armory.') if state == 'InitializingLongTime': return tr(""" To maximize your security, the Bitcoin engine is downloading and verifying the global transaction ledger. This will take several hours, but only needs to be done once! It is usually best to leave it running over night for this initialization process. Subsequent loads will only take a few minutes.

Please Note: Between Armory and the underlying Bitcoin engine, you need to have 40-50 GB of spare disk space available to hold the global transaction history.

While you wait, you can manage your wallets. Make new wallets, make digital or paper backups, create Bitcoin addresses to receive payments, sign messages, and/or import private keys. You will always receive Bitcoin payments regardless of whether you are online, but you will have to verify that payment through another service until Armory is finished this initialization.""") if state == 'InitializingDoneSoon': return ( \ 'The software is downloading and processing the latest activity ' 'on the network related to your wallet%s. This should take only ' 'a few minutes. While you wait, you can manage your wallets. ' '

' 'Now would be a good time to make paper (or digital) backups of ' 'your wallet%s if you have not done so already! You are protected ' 'forever from hard-drive loss, or forgetting you password. ' 'If you do not have a backup, you could lose all of your ' 'Bitcoins forever! See the ' 'Armory Backups page for more info.' % \ (('' if len(self.walletMap)==1 else 's',)*2)) if state == 'OnlineDisconnected': return ( \ 'Armory\'s communication with the Bitcoin network was interrupted. ' 'This usually does not happen unless you closed the process that ' 'Armory was using to communicate with the network. Armory requires ' '%s to be running in the background, and this error pops up if it ' 'disappears.' '

You may continue in offline mode, or you can close ' 'all Bitcoin processes and restart Armory.' \ % os.path.basename(TheSDM.executable)) if state == 'OfflineBadConnection': return ( \ 'Armory has experienced an issue trying to communicate with the ' 'Bitcoin software. The software is running in the background, ' 'but Armory cannot communicate with it through RPC as it expects ' 'to be able to. If you changed any settings in the Bitcoin home ' 'directory, please make sure that RPC is enabled and that it is ' 'accepting connections from localhost. ' '

' 'If you have not changed anything, please export the log file ' '(from the "File" menu) and send it to support@bitcoinarmory.com') if state == 'OfflineSatoshiAvail': return ( \ 'Armory does not detect internet access, but it does detect ' 'running Bitcoin software. Armory is in offline-mode.

' 'If you are intending to run an offline system, you will not ' 'need to have the Bitcoin software installed on the offline ' 'computer. It is only needed for the online computer. ' 'If you expected to be online and ' 'the absence of internet is an error, please restart Armory ' 'using the "--skip-online-check" option. ') if state == 'OfflineForcedButSatoshiAvail': return ( \ 'Armory was started in offline-mode, but detected you are ' 'running Bitcoin software. If you are intending to run an ' 'offline system, you will not need to have the Bitcoin ' 'software installed or running on the offline ' 'computer. It is only required for being online. ') if state == 'OfflineBadDBEnv': return ( \ 'The Bitcoin software indicates there ' 'is a problem with its databases. This can occur when ' 'Bitcoin-Qt/bitcoind is upgraded or downgraded, or sometimes ' 'just by chance after an unclean shutdown.' '

' 'You can either revert your installed Bitcoin software to the ' 'last known working version (but not earlier than version 0.8.1) ' 'or delete everything except "wallet.dat" from the your Bitcoin ' 'home directory:

' '%s' '

' 'If you choose to delete the contents of the Bitcoin home ' 'directory, you will have to do a fresh download of the blockchain ' 'again, which will require a few hours the first ' 'time.' % self.satoshiHomePath) if state == 'OfflineBtcdCrashed': sout = '' if TheSDM.btcOut==None else str(TheSDM.btcOut) serr = '' if TheSDM.btcErr==None else str(TheSDM.btcErr) soutHtml = '

' + '
'.join(sout.strip().split('\n')) serrHtml = '

' + '
'.join(serr.strip().split('\n')) soutDisp = 'StdOut: %s' % soutHtml serrDisp = 'StdErr: %s' % serrHtml if len(sout)>0 or len(serr)>0: return (tr(""" There was an error starting the underlying Bitcoin engine. This should not normally happen. Usually it occurs when you have been using Bitcoin-Qt prior to using Armory, especially if you have upgraded or downgraded Bitcoin-Qt recently. Output from bitcoind:
""") + \ (soutDisp if len(sout)>0 else '') + \ (serrDisp if len(serr)>0 else '') ) else: return ( tr(""" There was an error starting the underlying Bitcoin engine. This should not normally happen. Usually it occurs when you have been using Bitcoin-Qt prior to using Armory, especially if you have upgraded or downgraded Bitcoin-Qt recently.

Unfortunately, this error is so strange, Armory does not recognize it. Please go to "Export Log File" from the "File" menu and email at as an attachment to support@bitcoinarmory.com. We apologize for the inconvenience!""")) ############################################################################# @TimeThisFunction def setDashboardDetails(self, INIT=False): """ We've dumped all the dashboard text into the above 2 methods in order to declutter this method. """ onlineAvail = self.onlineModeIsPossible() sdmState = TheSDM.getSDMState() bdmState = TheBDM.getBDMState() tdmState = TheTDM.getTDMState() descr = '' descr1 = '' descr2 = '' # Methods for showing/hiding groups of widgets on the dashboard def setBtnRowVisible(r, visBool): for c in range(3): self.dashBtns[r][c].setVisible(visBool) def setSyncRowVisible(b): self.lblDashModeSync.setVisible(b) self.barProgressSync.setVisible(b) self.lblTimeLeftSync.setVisible(b) def setTorrentRowVisible(b): self.lblDashModeTorrent.setVisible(b) self.barProgressTorrent.setVisible(b) self.lblTimeLeftTorrent.setVisible(b) self.lblTorrentStats.setVisible(b) def setBuildRowVisible(b): self.lblDashModeBuild.setVisible(b) self.barProgressBuild.setVisible(b) self.lblTimeLeftBuild.setVisible(b) def setScanRowVisible(b): self.lblDashModeScan.setVisible(b) self.barProgressScan.setVisible(b) self.lblTimeLeftScan.setVisible(b) def setOnlyDashModeVisible(): setTorrentRowVisible(False) setSyncRowVisible(False) setBuildRowVisible(False) setScanRowVisible(False) self.lblBusy.setVisible(False) self.btnModeSwitch.setVisible(False) self.lblDashModeSync.setVisible(True) def setBtnFrameVisible(b, descr=''): self.frmDashMidButtons.setVisible(b) self.lblDashBtnDescr.setVisible(len(descr)>0) self.lblDashBtnDescr.setText(descr) if INIT: setBtnFrameVisible(False) setBtnRowVisible(DASHBTNS.Install, False) setBtnRowVisible(DASHBTNS.Browse, False) setBtnRowVisible(DASHBTNS.Instruct, False) setBtnRowVisible(DASHBTNS.Settings, False) setBtnRowVisible(DASHBTNS.Close, False) setOnlyDashModeVisible() self.btnModeSwitch.setVisible(False) # This keeps popping up for some reason! self.lblTorrentStats.setVisible(False) if self.doAutoBitcoind and not sdmState=='BitcoindReady': # User is letting Armory manage the Satoshi client for them. if not sdmState==self.lastSDMState: self.lblBusy.setVisible(False) self.btnModeSwitch.setVisible(False) # There's a whole bunch of stuff that has to be hidden/shown # depending on the state... set some reasonable defaults here setBtnFrameVisible(False) setBtnRowVisible(DASHBTNS.Install, False) setBtnRowVisible(DASHBTNS.Browse, False) setBtnRowVisible(DASHBTNS.Instruct, False) setBtnRowVisible(DASHBTNS.Settings, True) setBtnRowVisible(DASHBTNS.Close, False) if not (self.forceOnline or self.internetAvail) or CLI_OPTIONS.offline: self.mainDisplayTabs.setTabEnabled(self.MAINTABS.Ledger, False) setOnlyDashModeVisible() self.lblDashModeSync.setText( 'Armory is offline', \ size=4, color='TextWarn', bold=True) if satoshiIsAvailable(): self.frmDashMidButtons.setVisible(True) setBtnRowVisible(DASHBTNS.Close, True) if CLI_OPTIONS.offline: # Forced offline but bitcoind is running LOGINFO('Dashboard switched to auto-OfflineForcedButSatoshiAvail') descr1 += self.GetDashStateText('Auto', 'OfflineForcedButSatoshiAvail') descr2 += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(descr1) self.lblDashDescr2.setText(descr2) else: LOGINFO('Dashboard switched to auto-OfflineSatoshiAvail') descr1 += self.GetDashStateText('Auto', 'OfflineSatoshiAvail') descr2 += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(descr1) self.lblDashDescr2.setText(descr2) else: LOGINFO('Dashboard switched to auto-OfflineNoSatoshiNoInternet') setBtnFrameVisible(True, \ 'In case you actually do have internet access, use can use ' 'the following links to get Armory installed. Or change ' 'your settings.') setBtnRowVisible(DASHBTNS.Browse, True) setBtnRowVisible(DASHBTNS.Install, True) setBtnRowVisible(DASHBTNS.Settings, True) #setBtnRowVisible(DASHBTNS.Instruct, not OS_WINDOWS) descr1 += self.GetDashStateText('Auto','OfflineNoSatoshiNoInternet') descr2 += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(descr1) self.lblDashDescr2.setText(descr2) elif not TheSDM.isRunningBitcoind() and not TheTDM.isRunning(): setOnlyDashModeVisible() self.mainDisplayTabs.setTabEnabled(self.MAINTABS.Ledger, False) self.lblDashModeSync.setText( 'Armory is offline', \ size=4, color='TextWarn', bold=True) # Bitcoind is not being managed, but we want it to be if satoshiIsAvailable() or sdmState=='BitcoindAlreadyRunning': # But bitcoind/-qt is already running LOGINFO('Dashboard switched to auto-butSatoshiRunning') self.lblDashModeSync.setText(' Please close Bitcoin-Qt', \ size=4, bold=True) setBtnFrameVisible(True, '') setBtnRowVisible(DASHBTNS.Close, True) self.btnModeSwitch.setVisible(True) self.btnModeSwitch.setText('Check Again') #setBtnRowVisible(DASHBTNS.Close, True) descr1 += self.GetDashStateText('Auto', 'OfflineBitcoindRunning') descr2 += self.GetDashStateText('Auto', 'NewUserInfo') descr2 += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(descr1) self.lblDashDescr2.setText(descr2) #self.psutil_detect_bitcoin_exe_path() elif sdmState in ['BitcoindExeMissing', 'BitcoindHomeMissing']: LOGINFO('Dashboard switched to auto-cannotFindExeHome') if sdmState=='BitcoindExeMissing': self.lblDashModeSync.setText('Cannot find Bitcoin Installation', \ size=4, bold=True) else: self.lblDashModeSync.setText('Cannot find Bitcoin Home Directory', \ size=4, bold=True) setBtnRowVisible(DASHBTNS.Close, satoshiIsAvailable()) setBtnRowVisible(DASHBTNS.Install, True) setBtnRowVisible(DASHBTNS.Browse, True) setBtnRowVisible(DASHBTNS.Settings, True) #setBtnRowVisible(DASHBTNS.Instruct, not OS_WINDOWS) self.btnModeSwitch.setVisible(True) self.btnModeSwitch.setText('Check Again') setBtnFrameVisible(True) descr1 += self.GetDashStateText('Auto', 'OfflineNeedBitcoinInst') descr2 += self.GetDashStateText('Auto', 'NewUserInfo') descr2 += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(descr1) self.lblDashDescr2.setText(descr2) elif sdmState in ['BitcoindDatabaseEnvError']: LOGINFO('Dashboard switched to auto-BadDBEnv') setOnlyDashModeVisible() setBtnRowVisible(DASHBTNS.Install, True) #setBtnRowVisible(DASHBTNS.Instruct, not OS_WINDOWS) setBtnRowVisible(DASHBTNS.Settings, True) self.lblDashModeSync.setText( 'Armory is offline', \ size=4, color='TextWarn', bold=True) descr1 += self.GetDashStateText('Auto', 'OfflineBadDBEnv') descr2 += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(descr1) self.lblDashDescr2.setText(descr2) setBtnFrameVisible(True, '') elif sdmState in ['BitcoindUnknownCrash']: LOGERROR('Should not usually get here') setOnlyDashModeVisible() setBtnFrameVisible(True, \ 'Try reinstalling the Bitcoin ' 'software then restart Armory. If you continue to have ' 'problems, please contact Armory\'s core developer at ' 'support@bitcoinarmory.com.') setBtnRowVisible(DASHBTNS.Settings, True) setBtnRowVisible(DASHBTNS.Install, True) LOGINFO('Dashboard switched to auto-BtcdCrashed') self.lblDashModeSync.setText( 'Armory is offline', \ size=4, color='TextWarn', bold=True) descr1 += self.GetDashStateText('Auto', 'OfflineBtcdCrashed') descr2 += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(descr1) self.lblDashDescr2.setText(descr2) self.lblDashDescr1.setTextInteractionFlags( \ Qt.TextSelectableByMouse | \ Qt.TextSelectableByKeyboard) elif sdmState in ['BitcoindNotAvailable']: LOGERROR('BitcoindNotAvailable: should not happen...') self.notAvailErrorCount += 1 #if self.notAvailErrorCount < 5: #LOGERROR('Auto-mode-switch') #self.executeModeSwitch() descr1 += '' descr2 += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(descr1) self.lblDashDescr2.setText(descr2) else: setBtnFrameVisible(False) descr1 += '' descr2 += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(descr1) self.lblDashDescr2.setText(descr2) else: # online detected/forced, and TheSDM has already been started if sdmState in ['BitcoindWrongPassword', 'BitcoindNotAvailable']: extraTxt = '' if not self.wasSynchronizing: setOnlyDashModeVisible() else: extraTxt = tr(""" Armory has lost connection to the core Bitcoin software. If you did not do anything that affects your network connection or the bitcoind process, it will probably recover on its own in a couple minutes

""") self.lblTimeLeftSync.setVisible(False) self.barProgressSync.setFormat('') self.mainDisplayTabs.setTabEnabled(self.MAINTABS.Ledger, False) LOGINFO('Dashboard switched to auto-BadConnection') self.lblDashModeSync.setText( 'Armory is offline', \ size=4, color='TextWarn', bold=True) descr1 += self.GetDashStateText('Auto', 'OfflineBadConnection') descr2 += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(extraTxt + descr1) self.lblDashDescr2.setText(descr2) elif sdmState in ['BitcoindInitializing', \ 'BitcoindSynchronizing', \ 'TorrentSynchronizing']: self.wasSynchronizing = True LOGINFO('Dashboard switched to auto-InitSync') self.lblBusy.setVisible(True) self.mainDisplayTabs.setTabEnabled(self.MAINTABS.Ledger, False) self.updateSyncProgress() # If torrent ever ran, leave it visible setSyncRowVisible(True) setScanRowVisible(True) setTorrentRowVisible(TheTDM.isStarted()) if TheTDM.isRunning(): self.lblDashModeTorrent.setText('Downloading via Armory CDN', \ size=4, bold=True, color='Foreground') self.lblDashModeSync.setText( 'Synchronizing with Network', \ size=4, bold=True, color='DisableFG') self.lblTorrentStats.setVisible(True) elif sdmState=='BitcoindInitializing': self.lblDashModeTorrent.setText('Download via Armory CDN', \ size=4, bold=True, color='DisableFG') self.lblDashModeSync.setText( 'Initializing Bitcoin Engine', \ size=4, bold=True, color='Foreground') self.lblTorrentStats.setVisible(False) else: self.lblDashModeTorrent.setText('Download via Armory CDN', \ size=4, bold=True, color='DisableFG') self.lblDashModeSync.setText( 'Synchronizing with Network', \ size=4, bold=True, color='Foreground') self.lblTorrentStats.setVisible(False) self.lblDashModeBuild.setText( 'Build Databases', \ size=4, bold=True, color='DisableFG') self.lblDashModeScan.setText( 'Scan Transaction History', \ size=4, bold=True, color='DisableFG') # If more than 10 days behind, or still downloading torrent if tdmState=='Downloading' or self.approxBlkLeft > 1440: descr1 += self.GetDashStateText('Auto', 'InitializingLongTime') descr2 += self.GetDashStateText('Auto', 'NewUserInfo') else: descr1 += self.GetDashStateText('Auto', 'InitializingDoneSoon') descr2 += self.GetDashStateText('Auto', 'NewUserInfo') setBtnRowVisible(DASHBTNS.Settings, True) setBtnFrameVisible(True, \ 'Since version 0.88, Armory runs bitcoind in the ' 'background. You can switch back to ' 'the old way in the Settings dialog. ') descr2 += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(descr1) self.lblDashDescr2.setText(descr2) else: # User is managing satoshi client, or bitcoind is already sync'd self.frmDashMidButtons.setVisible(False) if bdmState in ('Offline', 'Uninitialized'): if onlineAvail and not self.lastBDMState[1]==onlineAvail: LOGINFO('Dashboard switched to user-OfflineOnlinePoss') self.mainDisplayTabs.setTabEnabled(self.MAINTABS.Ledger, False) setOnlyDashModeVisible() self.lblBusy.setVisible(False) self.btnModeSwitch.setVisible(True) self.btnModeSwitch.setEnabled(True) self.btnModeSwitch.setText('Go Online!') self.lblDashModeSync.setText('Armory is offline', size=4, bold=True) descr = self.GetDashStateText('User', 'OfflineButOnlinePossible') descr += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(descr) elif not onlineAvail and not self.lastBDMState[1]==onlineAvail: self.mainDisplayTabs.setTabEnabled(self.MAINTABS.Ledger, False) setOnlyDashModeVisible() self.lblBusy.setVisible(False) self.btnModeSwitch.setVisible(False) self.btnModeSwitch.setEnabled(False) self.lblDashModeSync.setText( 'Armory is offline', \ size=4, color='TextWarn', bold=True) if not satoshiIsAvailable(): if self.internetAvail: descr = self.GetDashStateText('User','OfflineNoSatoshi') setBtnRowVisible(DASHBTNS.Settings, True) setBtnFrameVisible(True, \ 'If you would like Armory to manage the Bitcoin software ' 'for you (Bitcoin-Qt or bitcoind), then adjust your ' 'Armory settings, then restart Armory.') else: descr = self.GetDashStateText('User','OfflineNoSatoshiNoInternet') elif not self.internetAvail: descr = self.GetDashStateText('User', 'OfflineNoInternet') elif not self.checkHaveBlockfiles(): descr = self.GetDashStateText('User', 'OfflineNoBlkFiles') descr += '

' descr += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(descr) elif bdmState == 'BlockchainReady': setOnlyDashModeVisible() self.mainDisplayTabs.setTabEnabled(self.MAINTABS.Ledger, True) self.lblBusy.setVisible(False) if self.netMode == NETWORKMODE.Disconnected: self.btnModeSwitch.setVisible(False) self.lblDashModeSync.setText( 'Armory is disconnected', size=4, color='TextWarn', bold=True) descr = self.GetDashStateText('User','Disconnected') descr += self.GetDashFunctionalityText('Offline') self.lblDashDescr1.setText(descr) elif TheBDM.isDirty(): LOGINFO('Dashboard switched to online-but-dirty mode') self.btnModeSwitch.setVisible(True) self.btnModeSwitch.setText('Rescan Now') self.mainDisplayTabs.setCurrentIndex(self.MAINTABS.Dash) self.lblDashModeSync.setText( 'Armory is online, but needs to rescan ' \ 'the blockchain', size=4, color='TextWarn', bold=True) if len(self.sweepAfterScanList) > 0: self.lblDashDescr1.setText( self.GetDashStateText('User', 'OnlineNeedSweep')) else: self.lblDashDescr1.setText( self.GetDashStateText('User', 'OnlineDirty')) else: # Fully online mode LOGINFO('Dashboard switched to fully-online mode') self.btnModeSwitch.setVisible(False) self.lblDashModeSync.setText( 'Armory is online!', color='TextGreen', size=4, bold=True) self.mainDisplayTabs.setTabEnabled(self.MAINTABS.Ledger, True) descr = self.GetDashStateText('User', 'OnlineFull1') descr += self.GetDashFunctionalityText('Online') descr += self.GetDashStateText('User', 'OnlineFull2') self.lblDashDescr1.setText(descr) #self.mainDisplayTabs.setCurrentIndex(self.MAINTABS.Dash) elif bdmState == 'Scanning': LOGINFO('Dashboard switched to "Scanning" mode') self.updateSyncProgress() self.lblDashModeScan.setVisible(True) self.barProgressScan.setVisible(True) self.lblTimeLeftScan.setVisible(True) self.lblBusy.setVisible(True) self.btnModeSwitch.setVisible(False) if TheSDM.getSDMState() == 'BitcoindReady': self.barProgressSync.setVisible(True) self.lblTimeLeftSync.setVisible(True) self.lblDashModeSync.setVisible(True) self.lblTimeLeftSync.setText('') self.lblDashModeSync.setText( 'Synchronizing with Network', \ size=4, bold=True, color='DisableFG') else: self.barProgressSync.setVisible(False) self.lblTimeLeftSync.setVisible(False) self.lblDashModeSync.setVisible(False) if len(str(self.lblDashModeBuild.text()).strip()) == 0: self.lblDashModeBuild.setText( 'Preparing Databases', \ size=4, bold=True, color='Foreground') if len(str(self.lblDashModeScan.text()).strip()) == 0: self.lblDashModeScan.setText( 'Scan Transaction History', \ size=4, bold=True, color='DisableFG') self.mainDisplayTabs.setTabEnabled(self.MAINTABS.Ledger, False) if len(self.walletMap)==0: descr = self.GetDashStateText('User','ScanNoWallets') else: descr = self.GetDashStateText('User','ScanWithWallets') descr += self.GetDashStateText('Auto', 'NewUserInfo') descr += self.GetDashFunctionalityText('Scanning') + '
' self.lblDashDescr1.setText(descr) self.lblDashDescr2.setText('') self.mainDisplayTabs.setCurrentIndex(self.MAINTABS.Dash) else: LOGERROR('What the heck blockchain mode are we in? %s', bdmState) self.lastBDMState = [bdmState, onlineAvail] self.lastSDMState = sdmState self.lblDashModeTorrent.setContentsMargins( 50,5,50,5) self.lblDashModeSync.setContentsMargins( 50,5,50,5) self.lblDashModeBuild.setContentsMargins(50,5,50,5) self.lblDashModeScan.setContentsMargins( 50,5,50,5) vbar = self.dashScrollArea.verticalScrollBar() # On Macs, this causes the main window scroll area to keep bouncing back # to the top. Not setting the value seems to fix it. DR - 2014/02/12 if not OS_MACOSX: vbar.setValue(vbar.minimum()) ############################################################################# def createToolTipWidget(self, tiptext, iconSz=2): """ The is to signal to Qt that it should be interpretted as HTML/Rich text even if no HTML tags are used. This appears to be necessary for Qt to wrap the tooltip text """ fgColor = htmlColor('ToolTipQ') lbl = QLabel('(?)' % (iconSz, fgColor)) lbl.setMaximumWidth(relaxedSizeStr(lbl, '(?)')[0]) def setAllText(wself, txt): def pressEv(ev): QWhatsThis.showText(ev.globalPos(), txt, self) wself.mousePressEvent = pressEv wself.setToolTip('' + txt) # Calling setText on this widget will update both the tooltip and QWT from types import MethodType lbl.setText = MethodType(setAllText, lbl) lbl.setText(tiptext) return lbl ############################################################################# def createAddressEntryWidgets(self, parent, initString='', maxDetectLen=128, boldDetectParts=0, **cabbKWArgs): """ If you are putting the LBL_DETECT somewhere that is space-constrained, set maxDetectLen to a smaller value. It will limit the number of chars to be included in the autodetect label. "cabbKWArgs" is "create address book button kwargs" Here's the signature of that function... you can pass any named args to this function and they will be passed along to createAddrBookButton def createAddrBookButton(parent, targWidget, defaultWltID=None, actionStr="Select", selectExistingOnly=False, selectMineOnly=False, getPubKey=False, showLockboxes=True) Returns three widgets that can be put into layouts: [[QLineEdit: addr/pubkey]] [[Button: Addrbook]] [[Label: Wallet/Lockbox/Addr autodetect]] """ addrEntryObjs = {} addrEntryObjs['QLE_ADDR'] = QLineEdit() addrEntryObjs['QLE_ADDR'].setText(initString) addrEntryObjs['BTN_BOOK'] = createAddrBookButton(parent, addrEntryObjs['QLE_ADDR'], **cabbKWArgs) addrEntryObjs['LBL_DETECT'] = QRichLabel('') addrEntryObjs['CALLBACK_GETSCRIPT'] = None ########################################################################## # Create a function that reads the user string and updates labels if # the entry is recognized. This will be used to automatically show the # user that what they entered is recognized and gives them more info # # It's a little awkward to put this whole thing in here... this could # probably use some refactoring def updateAddrDetectLabels(): try: enteredText = str(addrEntryObjs['QLE_ADDR'].text()).strip() scriptInfo = self.getScriptForUserString(enteredText) displayInfo = self.getDisplayStringForScript( scriptInfo['Script'], maxDetectLen, boldDetectParts, prefIDOverAddr=scriptInfo['ShowID']) dispStr = displayInfo['String'] if displayInfo['WltID'] is None and displayInfo['LboxID'] is None: addrEntryObjs['LBL_DETECT'].setText(dispStr) else: addrEntryObjs['LBL_DETECT'].setText(dispStr, color='TextBlue') # No point in repeating what the user just entered addrEntryObjs['LBL_DETECT'].setVisible(enteredText != dispStr) addrEntryObjs['QLE_ADDR'].setCursorPosition(0) except: #LOGEXCEPT('Invalid recipient string') addrEntryObjs['LBL_DETECT'].setVisible(False) addrEntryObjs['LBL_DETECT'].setVisible(False) # End function to be connected ########################################################################## # Now actually connect the entry widgets parent.connect(addrEntryObjs['QLE_ADDR'], SIGNAL('textChanged(QString)'), updateAddrDetectLabels) updateAddrDetectLabels() # Create a func that can be called to get the script that was entered # This uses getScriptForUserString() which actually returns 4 vals # rawScript, wltIDorNone, lboxIDorNone, addrStringEntered # (The last one is really only used to determine what info is most # relevant to display to the user...it can be ignored in most cases) def getScript(): entered = str(addrEntryObjs['QLE_ADDR'].text()).strip() return self.getScriptForUserString(entered) addrEntryObjs['CALLBACK_GETSCRIPT'] = getScript return addrEntryObjs ############################################################################# def getScriptForUserString(self, userStr): return getScriptForUserString(userStr, self.walletMap, self.allLockboxes) ############################################################################# def getDisplayStringForScript(self, binScript, maxChars=256, doBold=0, prefIDOverAddr=False, lblTrunc=12, lastTrunc=12): return getDisplayStringForScript(binScript, self.walletMap, self.allLockboxes, maxChars, doBold, prefIDOverAddr, lblTrunc, lastTrunc) ############################################################################# @TimeThisFunction def checkNewZeroConf(self): ''' Function that looks at an incoming zero-confirmation transaction queue and determines if any incoming transactions were created by Armory. If so, the transaction will be passed along to a user notification queue. ''' while len(self.newZeroConfSinceLastUpdate)>0: rawTx = self.newZeroConfSinceLastUpdate.pop() # Iterate through the Python wallets and create a ledger entry for the # transaction. If the transaction is for us, put it on the notification # queue, create the combined ledger, and reset the Qt table model. for wltID in self.walletMap.keys(): wlt = self.walletMap[wltID] le = wlt.cppWallet.calcLedgerEntryForTxStr(rawTx) if not le.getTxHash() == '\x00' * 32: LOGDEBUG('ZerConf tx for wallet: %s. Adding to notify queue.' \ % wltID) notifyIn = self.getSettingOrSetDefault('NotifyBtcIn', \ not OS_MACOSX) notifyOut = self.getSettingOrSetDefault('NotifyBtcOut', \ not OS_MACOSX) if (le.getValue() <= 0 and notifyOut) or \ (le.getValue() > 0 and notifyIn): # notifiedAlready = False, self.notifyQueue.append([wltID, le, False]) self.createCombinedLedger() self.walletModel.reset() # Iterate through the C++ lockbox wallets and create a ledger entry for # the transaction. If the transaction is for us, put it on the # notification queue, create the combined ledger, and reset the Qt # table models. for lbID,cppWlt in self.cppLockboxWltMap.iteritems(): le = cppWlt.calcLedgerEntryForTxStr(rawTx) if not le.getTxHash() == '\x00' * 32: LOGDEBUG('ZerConf tx for LOCKBOX: %s' % lbID) # notifiedAlready = False, self.notifyQueue.append([lbID, le, False]) self.createCombinedLedger() self.walletModel.reset() self.lockboxLedgModel.reset() ############################################################################# ############################################################################# def Heartbeat(self, nextBeatSec=1): """ This method is invoked when the app is initialized, and will run every second, or whatever is specified in the nextBeatSec argument. """ # Special heartbeat functions are for special windows that may need # to update every, say, every 0.1s # is all that matters at that moment, like a download progress window. # This is "special" because you are putting all other processing on # hold while this special window is active # IMPORTANT: Make sure that the special heartbeat function returns # a value below zero when it's done OR if it errors out! # Otherwise, it should return the next heartbeat delay, # which would probably be something like 0.1 for a rapidly # updating progress counter for fn in self.extraHeartbeatSpecial: try: nextBeat = fn() if nextBeat>0: reactor.callLater(nextBeat, self.Heartbeat) else: self.extraHeartbeatSpecial = [] reactor.callLater(1, self.Heartbeat) except: LOGEXCEPT('Error in special heartbeat function') self.extraHeartbeatSpecial = [] reactor.callLater(1, self.Heartbeat) return # TorrentDownloadManager # SatoshiDaemonManager # BlockDataManager tdmState = TheTDM.getTDMState() sdmState = TheSDM.getSDMState() bdmState = TheBDM.getBDMState() #print '(SDM, BDM) State = (%s, %s)' % (sdmState, bdmState) self.processAnnounceData() try: for func in self.extraHeartbeatAlways: if isinstance(func, list): fnc = func[0] kargs = func[1] keep_running = func[2] if keep_running == False: self.extraHeartbeatAlways.remove(func) fnc(*kargs) else: func() for idx,wltID in enumerate(self.walletIDList): self.walletMap[wltID].checkWalletLockTimeout() if self.doAutoBitcoind: if TheTDM.isRunning(): if tdmState=='Downloading': self.updateSyncProgress() downRate = TheTDM.getLastStats('downRate') self.torrentCircBuffer.append(downRate if downRate else 0) # Assumes 1 sec heartbeat bufsz = len(self.torrentCircBuffer) if bufsz > 5*MINUTE: self.torrentCircBuffer = self.torrentCircBuffer[1:] if bufsz >= 4.99*MINUTE: # If dlrate is below 30 kB/s, offer the user a way to skip it avgDownRate = sum(self.torrentCircBuffer) / float(bufsz) if avgDownRate < 30*KILOBYTE: if (RightNow() - self.lastAskedUserStopTorrent) > 5*MINUTE: self.lastAskedUserStopTorrent = RightNow() reply = QMessageBox.warning(self, tr('Torrent'), tr(""" Armory is attempting to use BitTorrent to speed up the initial synchronization, but it appears to be downloading slowly or not at all.

If the torrent engine is not starting properly, or is not downloading at a reasonable speed for your internet connection, you should disable it in File\xe2\x86\x92Settings and then restart Armory."""), QMessageBox.Ok) # For now, just show once then disable self.lastAskedUserStopTorrent = UINT64_MAX if sdmState in ['BitcoindInitializing','BitcoindSynchronizing']: self.updateSyncProgress() elif sdmState == 'BitcoindReady': if bdmState == 'Uninitialized': LOGINFO('Starting load blockchain') self.loadBlockchainIfNecessary() elif bdmState == 'Offline': LOGERROR('Bitcoind is ready, but we are offline... ?') elif bdmState=='Scanning': self.updateSyncProgress() if not sdmState==self.lastSDMState or \ not bdmState==self.lastBDMState[0]: self.setDashboardDetails() else: if bdmState in ('Offline','Uninitialized'): # This call seems out of place, but it's because if you are in offline # mode, it needs to check periodically for the existence of Bitcoin-Qt # so that it can enable the "Go Online" button self.setDashboardDetails() return elif bdmState=='Scanning': self.updateSyncProgress() if self.netMode==NETWORKMODE.Disconnected: if self.onlineModeIsPossible(): self.switchNetworkMode(NETWORKMODE.Full) if not TheBDM.isDirty() == self.dirtyLastTime: self.setDashboardDetails() self.dirtyLastTime = TheBDM.isDirty() if bdmState=='BlockchainReady': ##### # Blockchain just finished loading. Do lots of stuff... if self.needUpdateAfterScan: LOGDEBUG('Running finishLoadBlockchainGUI') self.finishLoadBlockchainGUI() self.needUpdateAfterScan = False self.setDashboardDetails() ##### # If we just rescanned to sweep an address, need to finish it if len(self.sweepAfterScanList)>0: LOGDEBUG('SweepAfterScanList is not empty -- exec finishSweepScan()') self.finishSweepScan() for addr in self.sweepAfterScanList: addr.binPrivKey32_Plain.destroy() self.sweepAfterScanList = [] self.setDashboardDetails() ##### # If we had initiated any wallet restoration scans, we need to add # Those wallets to the display if len(self.newWalletList)>0: LOGDEBUG('Wallet restore completed. Add to application.') while len(self.newWalletList)>0: wlt,isFresh = self.newWalletList.pop() LOGDEBUG('Registering %s wallet' % ('NEW' if isFresh else 'IMPORTED')) TheBDM.registerWallet(wlt.cppWallet, isFresh) self.addWalletToApplication(wlt, walletIsNew=isFresh) self.setDashboardDetails() # If there's a new block, use this to determine it affected our wallets prevLedgSize = dict([(wltID, len(self.walletMap[wltID].getTxLedger())) \ for wltID in self.walletMap.keys()]) # Now we start the normal array of heartbeat operations newBlocks = TheBDM.readBlkFileUpdate(wait=True) self.currBlockNum = TheBDM.getTopBlockHeight() if isinstance(self.currBlockNum, int): BDMcurrentBlock[0] = self.currBlockNum if not newBlocks: newBlocks = 0 # If we have new zero-conf transactions, scan them and update ledger if len(self.newZeroConfSinceLastUpdate)>0: self.newZeroConfSinceLastUpdate.reverse() for wltID in self.walletMap.keys(): wlt = self.walletMap[wltID] TheBDM.rescanWalletZeroConf(wlt.cppWallet, wait=True) for lbID,cppWlt in self.cppLockboxWltMap.iteritems(): TheBDM.rescanWalletZeroConf(cppWlt, wait=True) self.checkNewZeroConf() # Trigger any notifications, if we have them... self.doTheSystemTrayThing() if newBlocks>0 and not TheBDM.isDirty(): # This says "after scan", but works when new blocks appear, too TheBDM.updateWalletsAfterScan(wait=True) self.ledgerModel.reset() LOGINFO('New Block! : %d', self.currBlockNum) didAffectUs = False # LITE sync means it won't rescan if addresses have been imported didAffectUs = newBlockSyncRescanZC(TheBDM, self.walletMap, \ prevLedgSize) if didAffectUs: LOGINFO('New Block contained a transaction relevant to us!') self.walletListChanged() notifyOnSurpriseTx(self.currBlockNum-newBlocks, \ self.currBlockNum+1, self.walletMap, \ self.cppLockboxWltMap, True, TheBDM, \ self.notifyQueue, self.settings) self.createCombinedLedger() self.blkReceived = RightNow() self.writeSetting('LastBlkRecvTime', self.blkReceived) self.writeSetting('LastBlkRecv', self.currBlockNum) if self.netMode==NETWORKMODE.Full: LOGINFO('Current block number: %d', self.currBlockNum) self.lblArmoryStatus.setText(\ 'Connected (%s blocks) ' % \ (htmlColor('TextGreen'), self.currBlockNum)) # Update the wallet view to immediately reflect new balances self.walletModel.reset() # Any extra functions that may have been injected to be run # when new blocks are received. if len(self.extraNewBlockFunctions) > 0: cppHead = TheBDM.getMainBlockFromDB(self.currBlockNum) pyBlock = PyBlock().unserialize(cppHead.getSerializedBlock()) for blockFunc in self.extraNewBlockFunctions: blockFunc(pyBlock) blkRecvAgo = RightNow() - self.blkReceived #blkStampAgo = RightNow() - TheBDM.getTopBlockHeader().getTimestamp() self.lblArmoryStatus.setToolTip('Last block received is %s ago' % \ secondsToHumanTime(blkRecvAgo)) for func in self.extraHeartbeatOnline: func() except: # When getting the error info, don't collect the traceback in order to # avoid circular references. https://docs.python.org/2/library/sys.html # has more info. LOGEXCEPT('Error in heartbeat function') (errType, errVal) = sys.exc_info()[:2] errStr = 'Error Type: %s\nError Value: %s' % (errType, errVal) LOGERROR(errStr) finally: reactor.callLater(nextBeatSec, self.Heartbeat) ############################################################################# def printAlert(self, moneyID, ledgerAmt, txAmt): ''' Function that prints a notification for a transaction that affects an address we control. ''' dispLines = [] title = '' totalStr = coin2strNZS(txAmt) if moneyID in self.walletMap: wlt = self.walletMap[moneyID] if len(wlt.labelName) <= 20: dispName = '"%s"' % wlt.labelName else: dispName = '"%s..."' % wlt.labelName[:17] dispName = 'Wallet %s (%s)' % (dispName, wlt.uniqueIDB58) elif moneyID in self.cppLockboxWltMap: lbox = self.getLockboxByID(moneyID) if len(lbox.shortName) <= 20: dispName = '%d-of-%d "%s"' % (lbox.M, lbox.N, lbox.shortName) else: dispName = '%d-of-%d "%s..."' % (lbox.M, lbox.N, lbox.shortName[:17]) dispName = 'Lockbox %s (%s)' % (dispName, lbox.uniqueIDB58) else: LOGERROR('Asked to show notification for wlt/lbox we do not have') return # Collected everything we need to display, now construct it and do it. if ledgerAmt > 0: # Received! title = 'Bitcoins Received!' dispLines.append('Amount: %s BTC' % totalStr) dispLines.append('Recipient: %s' % dispName) elif ledgerAmt < 0: # Sent! title = 'Bitcoins Sent!' dispLines.append('Amount: %s BTC' % totalStr) dispLines.append('Sender: %s' % dispName) self.sysTray.showMessage(title, \ '\n'.join(dispLines), \ QSystemTrayIcon.Information, \ 10000) LOGINFO(title) ############################################################################# @TimeThisFunction def doTheSystemTrayThing(self): """ I named this method as it is because this is not just "show a message." I need to display all relevant transactions, in sequence that they were received. I will store them in self.notifyQueue, and this method will do nothing if it's empty. """ if not TheBDM.getBDMState()=='BlockchainReady' or \ RightNow()20: wname = wname[:17] + '...' wltName = 'Wallet "%s" (%s)' % (wname, moneyID) else: cppWlt = self.cppLockboxWltMap[moneyID] lbox = self.getLockboxByID(moneyID) M = self.getLockboxByID(moneyID).M N = self.getLockboxByID(moneyID).N lname = self.getLockboxByID(moneyID).shortName if len(lname) > 20: lname = lname[:17] + '...' wltName = 'Lockbox %d-of-%d "%s" (%s)' % (M, N, lname, moneyID) if le.isSentToSelf(): # Used to display the sent-to-self amount, but if this is a lockbox # we only have a cppWallet, and the determineSentToSelfAmt() func # only operates on python wallets. Oh well, the user can double- # click on the tx in their ledger if they want to see what's in it. # amt = determineSentToSelfAmt(le, cppWlt)[0] # self.sysTray.showMessage('Your bitcoins just did a lap!', \ # 'Wallet "%s" (%s) just sent %s BTC to itself!' % \ # (wlt.labelName, moneyID, coin2str(amt,maxZeros=1).strip()), self.sysTray.showMessage('Your bitcoins just did a lap!', \ '%s just sent some BTC to itself!' % wltName, QSystemTrayIcon.Information, 10000) return # If coins were either received or sent from the loaded wlt/lbox dispLines = [] totalStr = coin2strNZS(abs(le.getValue())) if le.getValue() > 0: title = 'Bitcoins Received!' dispLines.append('Amount: %s BTC' % totalStr) dispLines.append('Recipient: %s' % wltName) elif le.getValue() < 0: # Also display the address of where they went txref = TheBDM.getTxByHash(le.getTxHash()) nOut = txref.getNumTxOut() recipStr = '' for i in range(nOut): script = txref.getTxOutCopy(i).getScript() if cppWlt.hasScrAddress(script_to_scrAddr(script)): continue if len(recipStr)==0: recipStr = self.getDisplayStringForScript(script, 45)['String'] else: recipStr = '' title = 'Bitcoins Sent!' dispLines.append('Amount: %s BTC' % totalStr) dispLines.append('From: %s' % wltName) dispLines.append('To: %s' % recipStr) self.sysTray.showMessage(title, '\n'.join(dispLines), QSystemTrayIcon.Information, 10000) LOGINFO(title + '\n' + '\n'.join(dispLines)) # Wait for 5 seconds before processing the next queue object. self.notifyBlockedUntil = RightNow() + 5 return ############################################################################# def closeEvent(self, event=None): moc = self.getSettingOrSetDefault('MinimizeOrClose', 'DontKnow') doClose, doMinimize = False, False if moc=='DontKnow': reply,remember = MsgBoxWithDNAA(MSGBOX.Question, 'Minimize or Close', \ 'Would you like to minimize Armory to the system tray instead ' 'of closing it?', dnaaMsg='Remember my answer', \ yesStr='Minimize', noStr='Close') if reply==True: doMinimize = True if remember: self.writeSetting('MinimizeOrClose', 'Minimize') else: doClose = True; if remember: self.writeSetting('MinimizeOrClose', 'Close') if doMinimize or moc=='Minimize': self.minimizeArmory() if event: event.ignore() elif doClose or moc=='Close': self.doShutdown = True self.sysTray.hide() self.closeForReal(event) else: return # how would we get here? ############################################################################# def unpackLinuxTarGz(self, targzFile, changeSettings=True): if targzFile is None: return None if not os.path.exists(targzFile): return None unpackDir = os.path.join(ARMORY_HOME_DIR, 'latestBitcoinInst') unpackDir2 = os.path.join(ARMORY_HOME_DIR, 'latestBitcoinInstOld') if os.path.exists(unpackDir): if os.path.exists(unpackDir2): shutil.rmtree(unpackDir2) shutil.move(unpackDir, unpackDir2) os.mkdir(unpackDir) out,err = execAndWait('tar -zxf %s -C %s' % (targzFile, unpackDir), \ timeout=5) LOGINFO('UNPACK STDOUT: "' + out + '"') LOGINFO('UNPACK STDERR: "' + err + '"') # There should only be one subdir unpackDirChild = None for fn in os.listdir(unpackDir): unpackDirChild = os.path.join(unpackDir, fn) if unpackDirChild is None: LOGERROR('There was apparently an error unpacking the file') return None finalDir = os.path.abspath(unpackDirChild) LOGWARN('Bitcoin Core unpacked into: %s', finalDir) if changeSettings: self.settings.set('SatoshiExe', finalDir) return finalDir ############################################################################# def closeForReal(self, event=None): ''' Unlike File->Quit or clicking the X on the window, which may actually minimize Armory, this method is for *really* closing Armory ''' try: # Save the main window geometry in the settings file self.writeSetting('MainGeometry', str(self.saveGeometry().toHex())) self.writeSetting('MainWalletCols', saveTableView(self.walletsView)) self.writeSetting('MainLedgerCols', saveTableView(self.ledgerView)) if TheBDM.getBDMState()=='Scanning': LOGINFO('BDM state is scanning -- force shutdown BDM') TheBDM.execCleanShutdown(wait=False) else: LOGINFO('BDM is safe for clean shutdown') TheBDM.execCleanShutdown(wait=True) # This will do nothing if bitcoind isn't running. TheSDM.stopBitcoind() except: # Don't want a strange error here interrupt shutdown LOGEXCEPT('Strange error during shutdown') # Any extra shutdown activities, perhaps added by modules for fn in self.extraShutdownFunctions: try: fn() except: LOGEXCEPT('Shutdown function failed. Skipping.') from twisted.internet import reactor LOGINFO('Attempting to close the main window!') reactor.stop() if event: event.accept() ############################################################################# def execTrigger(self, toSpawn): super(ArmoryDialog, toSpawn).exec_() ############################################################################# def initTrigger(self, toInit): if isinstance(toInit, DlgProgress): toInit.setup(self) toInit.status = 1 ############################################################################# def checkForNegImports(self): negativeImports = [] for wlt in self.walletMap: if self.walletMap[wlt].hasNegativeImports: negativeImports.append(self.walletMap[wlt].uniqueIDB58) # If we detect any negative import if len(negativeImports) > 0: logDirs = [] for wltID in negativeImports: if not wltID in self.walletMap: continue homedir = os.path.dirname(self.walletMap[wltID].walletPath) wltlogdir = os.path.join(homedir, wltID) if not os.path.exists(wltlogdir): continue for subdirname in os.listdir(wltlogdir): subdirpath = os.path.join(wltlogdir, subdirname) logDirs.append([wltID, subdirpath]) DlgInconsistentWltReport(self, self, logDirs).exec_() ############################################################################# def getAllRecoveryLogDirs(self, wltIDList): self.logDirs = [] for wltID in wltIDList: if not wltID in self.walletMap: continue homedir = os.path.dirname(self.walletMap[wltID].walletPath) logdir = os.path.join(homedir, wltID) if not os.path.exists(logdir): continue self.logDirs.append([wltID, logdir]) return self.logDirs ############################################################################# @AllowAsync def CheckWalletConsistency(self, wallets, prgAt=None): if prgAt: totalSize = 0 walletSize = {} for wlt in wallets: statinfo = os.stat(wallets[wlt].walletPath) walletSize[wlt] = statinfo.st_size totalSize = totalSize + statinfo.st_size i=0 dlgrdy = [0] nerrors = 0 for wlt in wallets: if prgAt: prgAt[0] = i f = 10000*walletSize[wlt]/totalSize prgAt[1] = f i = f +i self.wltCstStatus = WalletConsistencyCheck(wallets[wlt], prgAt) if self.wltCstStatus[0] != 0: self.WltCstError(wallets[wlt], self.wltCstStatus[1], dlgrdy) while not dlgrdy[0]: time.sleep(0.01) nerrors = nerrors +1 prgAt[2] = 1 dlgrdy[0] = 0 while prgAt[2] != 2: time.sleep(0.1) if nerrors == 0: self.emit(SIGNAL('UWCS'), [1, 'All wallets are consistent', 10000, dlgrdy]) self.emit(SIGNAL('checkForNegImports')) else: while not dlgrdy: self.emit(SIGNAL('UWCS'), [1, 'Consistency Check Failed!', 0, dlgrdy]) time.sleep(1) self.checkRdyForFix() def checkRdyForFix(self): #check BDM first time.sleep(1) self.dlgCptWlt.emit(SIGNAL('Show')) while 1: if TheBDM.getBDMState() == 'Scanning': canFix = tr(""" The wallet analysis tool will become available as soon as Armory is done loading. You can close this window and it will reappear when ready.""") self.dlgCptWlt.UpdateCanFix([canFix]) time.sleep(1) elif TheBDM.getBDMState() == 'Offline' or \ TheBDM.getBDMState() == 'Uninitialized': TheSDM.setDisabled(True) CLI_OPTIONS.offline = True break else: break #check running dialogs self.dlgCptWlt.emit(SIGNAL('Show')) runningList = [] while 1: listchanged = 0 canFix = [] for dlg in runningList: if dlg not in runningDialogsList: runningList.remove(dlg) listchanged = 1 for dlg in runningDialogsList: if not isinstance(dlg, DlgCorruptWallet): if dlg not in runningList: runningList.append(dlg) listchanged = 1 if len(runningList): if listchanged: canFix.append(tr(""" The following windows need closed before you can run the wallet analysis tool:""")) canFix.extend([str(myobj.windowTitle()) for myobj in runningList]) self.dlgCptWlt.UpdateCanFix(canFix) time.sleep(0.2) else: break canFix.append('Ready to analyze inconsistent wallets!') self.dlgCptWlt.UpdateCanFix(canFix, True) self.dlgCptWlt.exec_() def checkWallets(self): nwallets = len(self.walletMap) if nwallets > 0: self.prgAt = [0, 0, 0] self.pbarWalletProgress = QProgressBar() self.pbarWalletProgress.setMaximum(10000) self.pbarWalletProgress.setMaximumSize(300, 22) self.pbarWalletProgress.setStyleSheet('text-align: center; margin-bottom: 2px; margin-left: 10px;') self.pbarWalletProgress.setFormat('Wallet Consistency Check: %p%') self.pbarWalletProgress.setValue(0) self.statusBar().addWidget(self.pbarWalletProgress) self.connect(self, SIGNAL('UWCS'), self.UpdateWalletConsistencyStatus) self.connect(self, SIGNAL('PWCE'), self.PromptWltCstError) self.CheckWalletConsistency(self.walletMap, self.prgAt, async=True) self.UpdateConsistencyCheckMessage(async = True) #self.extraHeartbeatAlways.append(self.UpdateWalletConsistencyPBar) @AllowAsync def UpdateConsistencyCheckMessage(self): while self.prgAt[2] == 0: self.emit(SIGNAL('UWCS'), [0, self.prgAt[0]]) time.sleep(0.5) self.emit(SIGNAL('UWCS'), [2]) self.prgAt[2] = 2 def UpdateWalletConsistencyStatus(self, msg): if msg[0] == 0: self.pbarWalletProgress.setValue(msg[1]) elif msg[0] == 1: self.statusBar().showMessage(msg[1], msg[2]) msg[3][0] = 1 else: self.pbarWalletProgress.hide() def WltCstError(self, wlt, status, dlgrdy): self.emit(SIGNAL('PWCE'), dlgrdy, wlt, status) LOGERROR('Wallet consistency check failed! (%s)', wlt.uniqueIDB58) def PromptWltCstError(self, dlgrdy, wallet=None, status='', mode=None): if not self.dlgCptWlt: self.dlgCptWlt = DlgCorruptWallet(wallet, status, self, self) dlgrdy[0] = 1 else: self.dlgCptWlt.addStatus(wallet, status) if not mode: self.dlgCptWlt.show() else: self.dlgCptWlt.exec_() ############################################ class ArmoryInstanceListener(Protocol): def connectionMade(self): LOGINFO('Another Armory instance just tried to open.') self.factory.func_conn_made() def dataReceived(self, data): LOGINFO('Received data from alternate Armory instance') self.factory.func_recv_data(data) self.transport.loseConnection() ############################################ class ArmoryListenerFactory(ClientFactory): protocol = ArmoryInstanceListener def __init__(self, fn_conn_made, fn_recv_data): self.func_conn_made = fn_conn_made self.func_recv_data = fn_recv_data ############################################ def checkForAlreadyOpen(): import socket LOGDEBUG('Checking for already open socket...') try: sock = socket.create_connection(('127.0.0.1',CLI_OPTIONS.interport), 0.1); # If we got here (no error), there's already another Armory open if OS_WINDOWS: # Windows can be tricky, sometimes holds sockets even after closing checkForAlreadyOpenError() LOGERROR('Socket already in use. Sending CLI args to existing proc.') if CLI_ARGS: sock.send(CLI_ARGS[0]) sock.close() LOGERROR('Exiting...') os._exit(0) except: # This is actually the normal condition: we expect this to be the # first/only instance of Armory and opening the socket will err out pass ############################################ def checkForAlreadyOpenError(): LOGINFO('Already open error checking') # Sometimes in Windows, Armory actually isn't open, because it holds # onto the socket even after it's closed. armoryExists = [] bitcoindExists = [] aexe = os.path.basename(sys.argv[0]) bexe = 'bitcoind.exe' if OS_WINDOWS else 'bitcoind' for proc in psutil.process_iter(): if aexe in proc.name: LOGINFO('Found armory PID: %d', proc.pid) armoryExists.append(proc.pid) if bexe in proc.name: LOGINFO('Found bitcoind PID: %d', proc.pid) if ('testnet' in proc.name) == USE_TESTNET: bitcoindExists.append(proc.pid) if len(armoryExists)>0: LOGINFO('Not an error! Armory really is open') return elif len(bitcoindExists)>0: # Strange condition where bitcoind doesn't get killed by Armory/guardian # (I've only seen this happen on windows, though) LOGERROR('Found zombie bitcoind process...killing it') for pid in bitcoindExists: killProcess(pid) time.sleep(0.5) raise ############################################ if 1: import qt4reactor qt4reactor.install() if CLI_OPTIONS.interport > 1: checkForAlreadyOpen() pixLogo = QPixmap(':/splashlogo.png') if USE_TESTNET: pixLogo = QPixmap(':/splashlogo_testnet.png') SPLASH = QSplashScreen(pixLogo) SPLASH.setMask(pixLogo.mask()) SPLASH.show() QAPP.processEvents() # Will make this customizable QAPP.setFont(GETFONT('var')) form = ArmoryMainWindow() form.show() SPLASH.finish(form) from twisted.internet import reactor def endProgram(): LOGINFO('Resetting BlockDataMgr, freeing memory') TheBDM.Reset() TheBDM.execCleanShutdown(wait=False) if reactor.threadpool is not None: reactor.threadpool.stop() QAPP.quit() os._exit(0) QAPP.connect(form, SIGNAL("lastWindowClosed()"), endProgram) reactor.addSystemEventTrigger('before', 'shutdown', endProgram) QAPP.setQuitOnLastWindowClosed(True) reactor.runReturn() os._exit(QAPP.exec_()) armory-0.92.3/imgList.xml0000644000000000000000000002063412414772654013767 0ustar rootroot img/MsgBox_critical24.png img/MsgBox_critical64.png img/MsgBox_error32.png img/MsgBox_error64.png img/MsgBox_good48.png img/MsgBox_info32.png img/MsgBox_info48.png img/MsgBox_question32.png img/MsgBox_question64.png img/MsgBox_warning48.png img/addr_book_icon.png img/armory_icon_24x24.png img/armory_icon_32x32.png img/armory_icon_64x64.png img/armory_icon_fullres.png img/armory_icon_green_24x24.png img/armory_icon_green_32x32.png img/armory_icon_green_64x64.png img/armory_icon_green_fullres.png img/armory_logo_fullres.png img/armory_logo_green_h72.png img/armory_logo_green_h56.png img/armory_logo_h36.png img/armory_logo_h48.png img/armory_logo_h72.png img/armory_logo_h44.png img/armory_logo_h56.png img/armory_logo_white_text_h72.png img/armory_logo_white_text_green_h72.png img/armory_logo_white_text_h56.png img/armory_logo_white_text_green_h56.png img/armory_rightclickcopy.png img/arrow_down.png img/arrow_down32.png img/arrow_left.png img/arrow_left32.png img/arrow_right.png img/arrow_right32.png img/arrow_right_24x24.png img/arrow_right_blue_24x24.png img/arrow_right_green_24x24.png img/arrow_right_red_24x24.png img/arrow_up.png img/arrow_up32.png img/asterisk_orange.png img/bitcoinlogo.png img/busy.gif img/button-blue.png img/button-green.png img/button-purple.png img/button-red.png img/button-seagreen.png img/button-yellow.png img/checkmark32.png img/checkmark32_blue.png img/checkmark32_orange.png img/checkmark_okay.png img/circle_blue.png img/circle_green.png img/circle_orange.png img/circle_purple.png img/circle_red.png img/circle_tan.png img/circle_yellow.png img/conf0t.png img/conf1t.png img/conf2t.png img/conf3t.png img/conf4t.png img/conf5t.png img/conf6t.png img/conf0t_nonum.png img/conf1t_nonum.png img/conf2t_nonum.png img/conf3t_nonum.png img/conf4t_nonum.png img/conf5t_nonum.png img/folder-new-5.png img/folder.png img/folder24.png img/frag1f.png img/frag2f.png img/frag3f.png img/frag4f.png img/frag5f.png img/frag6f.png img/frag7f.png img/frag8f.png img/keyhole_gray.png img/keyhole_green.png img/keyhole_blue.png img/keyhole_red.png img/keyhole_white.png img/lockedIcon.png img/loadicon_0.png img/loadicon_1.png img/loadicon_2.png img/loadicon_3.png img/loadicon_4.png img/loadicon_5.png img/logo_vert_black_text.png img/logo_vert_black_text_antialiased.png img/logo_vert_black_text_green.png img/logo_vert_white_text.png img/moneyCoinbase.png img/moneyIn.png img/moneyOut.png img/moneySelf.png img/plus_orange.png img/preferences.png img/preferences256.png img/printer_icon.png img/process-stop-4.png img/red_X.png img/scroll_up_24.png img/scroll_down_24.png img/scroll_up_18.png img/scroll_down_18.png img/sent_to_self.png img/splashlogo.png img/splashlogo_testnet.png img/unlockedIcon.png img/visible.png img/visible2.png img/view-refresh-4.png img/wallet_16x12.png armory-0.92.3/announcefetch.py0000644000000000000000000003411212414772654015023 0ustar rootrootfrom armoryengine.ALL import * from threading import Event from jasvet import verifySignature, readSigBlock import os import sys import time import urllib DEFAULT_FETCH_INTERVAL = 30*MINUTE DEFAULT_MIN_PRIORITY = 2048 if not CLI_OPTIONS.testAnnounceCode: # Signed with the Bitcoin offline announce key (see top of ArmoryUtils.py) ANNOUNCE_SIGN_PUBKEY = ARMORY_INFO_SIGN_PUBLICKEY ANNOUNCE_URL = 'https://bitcoinarmory.com/announce.txt' ANNOUNCE_URL_BACKUP = 'https://s3.amazonaws.com/bitcoinarmory-media/announce.txt' else: # This is a lower-security announce file, fake data, just for testing ANNOUNCE_SIGN_PUBKEY = ('04' '601c891a2cbc14a7b2bb1ecc9b6e42e166639ea4c2790703f8e2ed126fce432c' '62fe30376497ad3efcd2964aa0be366010c11b8d7fc8209f586eac00bb763015') ANNOUNCE_URL = 'https://s3.amazonaws.com/bitcoinarmory-testing/testannounce.txt' ANNOUNCE_URL_BACKUP = ANNOUNCE_URL class AnnounceDataFetcher(object): """ Armory Technologies, Inc, will post occasional SIGNED updates to be processed by running instances of Armory that haven't disabled it. The files in the fetchDir will be small. At the time of this writing, the only files we will fetch and store: announce.txt : announcements & alerts to be displayed to the user changelog.txt : changelog of versions, triggers update nofications dllinks.txt : URLs and hashes of installers for all OS and versions notify.txt : Notifications & alerts bootstrap.dat.torrent : torrent file for quick blockchain download """ ############################################################################# def __init__(self, announceURL=ANNOUNCE_URL, \ backupURL=ANNOUNCE_URL_BACKUP, \ fetchDir=None, uniqueID='00000000'): self.loopIsIdle = Event() self.forceCheckFlag = Event() self.forceIsFinished = Event() self.firstSuccess = Event() self.shutdownFlag = Event() self.lastFetch = 0 self.lastChange = 0 self.loopThread = None self.disabled = False self.setFetchInterval(DEFAULT_FETCH_INTERVAL) self.loopIsIdle.set() self.lastAnnounceChange = 0 # Where to fetch the data from self.announceURL = announceURL self.announceURL_backup = backupURL # For OS/version statistics, we use the ID is used to remove duplicates self.uniqueID = uniqueID self.disableDecorate = False # Just disable ourselves if we have continuous exceptions self.numConsecutiveExceptions = 0 # If we are on testnet, we may require matching a mainnnet addr a160 = hash160(hex_to_binary(ANNOUNCE_SIGN_PUBKEY)) self.validAddrStr = hash160_to_addrStr(a160) # Make sure the fetch directory exists (where we put downloaded files) self.fetchDir = fetchDir if fetchDir is None: self.fetchDir = os.path.join(ARMORY_HOME_DIR, 'announcefiles') if not os.path.exists(self.fetchDir): os.mkdir(self.fetchDir) # Read and hash existing files in that directory self.fileHashMap = {} LOGINFO('Reading files in fetcher directory:') for fname in os.listdir(self.fetchDir): fpath = os.path.join(self.fetchDir, fname) if not fname.endswith('.file') or os.path.getsize(fpath) > 16*MEGABYTE: continue fid = fname[:-5] with open(fpath, 'rb') as f: self.fileHashMap[fid] = binary_to_hex(sha256(f.read())) LOGINFO(' %s : %s', fid.ljust(16), self.fileHashMap[fid]) ############################################################################# def start(self): if not self.disabled: self.loopThread = self.__runFetchLoop(async=True) ############################################################################# def isDisabled(self): return self.disabled ############################################################################# def shutdown(self): LOGINFO('Called AnnounceDataFetcher.shutdown()') self.shutdownFlag.set() ############################################################################# def setFetchInterval(self, newInterval): self.fetchInterval = max(newInterval,10) ############################################################################# def setFullyDisabled(self, b=True): self.disabled = b ############################################################################# def setStatsDisable(self, b=True): self.disableDecorate = b ############################################################################# def isRunning(self): return self.loopThread.isRunning() if self.loopThread else False ############################################################################# def atLeastOneSuccess(self): return self.firstSuccess.isSet() ############################################################################# def numFiles(self): return len(self.fileHashMap) ############################################################################# def fetchRightNow(self, doWait=0): self.forceIsFinished.clear() self.forceCheckFlag.set() if doWait > 0: self.forceIsFinished.wait(doWait) self.forceCheckFlag.clear() ############################################################################# def getAnnounceFilePath(self, fileID): fpath = os.path.join(self.fetchDir, fileID+'.file') return fpath if os.path.exists(fpath) else None ############################################################################# def getAnnounceFile(self, fileID, forceCheck=False, forceWait=10): if forceCheck: LOGINFO('Forcing fetch before returning file') if not self.isRunning(): # This is safe because there's no one to collide with self.__runFetchSequence() else: self.forceIsFinished.clear() self.forceCheckFlag.set() if not self.forceIsFinished.wait(forceWait): self.forceCheckFlag.clear() return None self.forceCheckFlag.clear() else: # Wait up to one second for any current ops to finish if not self.loopIsIdle.wait(1): LOGERROR('Loop was busy for more than one second') return None # If the above succeeded, it will be in the fetchedFiles dir # We may have fpath = self.getAnnounceFilePath(fileID) if not (fpath and os.path.exists(fpath)): LOGERROR('No file with ID=%s was fetched', fileID) return None with open(fpath, 'rb') as f: returnData = f.read() return returnData ############################################################################# def getFileModTime(self, fileID): fpath = self.getAnnounceFilePath(fileID) if not fpath or not os.path.exists(fpath): #LOGERROR('No file with ID=%s was fetched', fileID) return 0 return os.path.getmtime(fpath) ############################################################################# def getLastSuccessfulFetchTime(self): announcePath = os.path.join(self.fetchDir, 'announce.file') if os.path.exists(announcePath): return os.path.getmtime(announcePath) else: return 0 ############################################################################# def getDecoratedURL(self, url, verbose=False): """ This always decorates the URL with at least Armory version. Use the verbose=True option to add OS, subOS, and a few "random" bytes that help reject duplicate queries. """ # ACR UPDATE 08/2014: non-verbose now does no decorating at all. It just # returns the same URL that was passed in. if (not verbose) or self.disableDecorate: return url argsMap = {} argsMap['ver'] = getVersionString(BTCARMORY_VERSION) if verbose: if OS_WINDOWS: argsMap['os'] = 'win' elif OS_LINUX: argsMap['os'] = 'lin' elif OS_MACOSX: argsMap['os'] = 'mac' else: argsMap['os'] = 'unk' try: if OS_MACOSX: argsMap['osvar'] = OS_VARIANT else: argsMap['osvar'] = OS_VARIANT[0].lower() except: LOGERR('Unrecognized OS while constructing version URL') argsMap['osvar'] = 'unk' argsMap['id'] = self.uniqueID return url + '?' + urllib.urlencode(argsMap) ############################################################################# def __fetchAnnounceDigests(self, doDecorate=False): self.lastFetch = RightNow() digestURL = self.getDecoratedURL(self.announceURL, verbose=doDecorate) backupURL = None if self.announceURL_backup: backupURL = self.getDecoratedURL(self.announceURL_backup) return self.__fetchFile(digestURL, backupURL) ############################################################################# def __fetchFile(self, url, backupURL=None): LOGINFO('Fetching: %s', url) try: import urllib2 import socket LOGDEBUG('Downloading URL: %s' % url) socket.setdefaulttimeout(CLI_OPTIONS.nettimeout) urlobj = urllib2.urlopen(url, timeout=CLI_OPTIONS.nettimeout) return urlobj.read() except ImportError: LOGERROR('No module urllib2 -- cannot download anything') return '' except (urllib2.URLError, urllib2.HTTPError): LOGERROR('Specified URL was inaccessible') LOGERROR('Tried: %s', url) return self.__fetchFile(backupURL) if backupURL else '' except: LOGEXCEPT('Unspecified error downloading URL') return self.__fetchFile(backupURL) if backupURL else '' ############################################################################# def __runFetchSequence(self): ##### Always decorate the URL with OS, Armory version on the first run digestData = self.__fetchAnnounceDigests(not self.firstSuccess.isSet()) if len(digestData)==0: LOGWARN('Error fetching announce digest') return self.firstSuccess.set() ##### Digests come in signature blocks. Verify sig using jasvet. try: sig, msg = readSigBlock(digestData) signAddress = verifySignature(sig, msg, 'v1', ord(ADDRBYTE)) if not signAddress == self.validAddrStr: LOGERROR('Announce info carried invalid signature!') LOGERROR('Signature addr: %s' % signAddress) LOGERROR('Expected address: %s', self.validAddrStr) return except: LOGEXCEPT('Could not verify data in signed message block') return # Always rewrite file; it's small and will use mtime for info with open(os.path.join(self.fetchDir, 'announce.file'), 'w') as f: f.write(digestData) ##### We have a valid digest, now parse it justDownloadedMap = {} for row in [line.split() for line in msg.strip().split('\n')]: if len(row)==3: justDownloadedMap[row[0]] = [row[1], row[2]] else: LOGERROR('Malformed announce matrix: %s' % str(row)) return ##### Check whether any of the hashes have changed for key,val in justDownloadedMap.iteritems(): jdURL,jdHash = val[0],val[1] if not (key in self.fileHashMap and self.fileHashMap[key]==jdHash): LOGINFO('Changed [ "%s" ] == [%s, %s]', key, jdURL, jdHash) newData = self.__fetchFile(jdURL) if len(newData) == 0: LOGERROR('Failed downloading announce file : %s', key) return newHash = binary_to_hex(sha256(newData)) if not newHash == jdHash: LOGERROR('Downloaded file hash does not match!') LOGERROR('Hash of downloaded data: %s', newHash) return filename = os.path.join(self.fetchDir, key+'.file') with open(filename, 'wb') as f: f.write(newData) self.lastChange = RightNow() self.fileHashMap[key] = jdHash ##### Clean up as needed if self.forceCheckFlag.isSet(): self.forceIsFinished.set() self.forceCheckFlag.clear() self.numConsecutiveExceptions = 0 ############################################################################# # I'm taking a shortcut around adding all the threading code here # Simply use @AllowAsync and only call with async=True. Done. @AllowAsync def __runFetchLoop(self): """ All this code runs in a separate thread (your app will freeze if you don't call this with the async=True argument). It will periodically check for new announce data, and update members that are visible to other threads. By default, it will check once per hour. If you call self.forceCheckFlag.set() It will skip the time check and force a download right now. Using getAnnounceFile(forceCheck=True) will do this for you, and will wait until the operation completes before returning the result. """ while True: try: if self.isDisabled() or self.shutdownFlag.isSet(): self.shutdownFlag.clear() break ##### Only check once per hour unless force flag is set if not self.forceCheckFlag.isSet(): if RightNow()-self.lastFetch < self.fetchInterval: continue else: LOGINFO('Forcing announce data fetch') self.forceIsFinished.clear() self.loopIsIdle.clear() self.__runFetchSequence() except: self.numConsecutiveExceptions += 1 LOGEXCEPT('Failed download') if self.numConsecutiveExceptions > 20: self.setDisabled(True) finally: self.loopIsIdle.set() time.sleep(0.5) armory-0.92.3/dynamicImport.py0000644000000000000000000000437612414772654015033 0ustar rootrootimport os import sys from armoryengine.ArmoryUtils import LOGEXCEPT def getModuleList(inDir): moduleMap = {} if not os.path.exists(inDir): return moduleMap for fn in os.listdir(inDir): if not fn.endswith('.py') and not fn.endswith('.sig'): continue try: modName = fn.split('.')[0] fullfn = os.path.join(inDir, fn) with open(fullfn, 'r') as f: fileData = f.read() if not modName in moduleMap: moduleMap[modName] = {} if fn.endswith('.py'): moduleMap[modName]['SourceCode'] = fileData moduleMap[modName]['SourceDir'] = inDir moduleMap[modName]['Filename'] = fn elif fn.endswith('.sig'): moduleMap[modName]['SigData'] = fileData except: LOGEXCEPT('Loading plugin %s failed. Skipping' % fullfn) return moduleMap def dynamicImport(inDir, moduleName, injectLocals=None): """ We import from an arbitrary directory, we need to add the dir to sys.path, but we want to prevent any shenanigans by an imported module that messes with sys.path (perhaps maliciously, but trying to import a malicious module without allowing malicious behavior is probably impossible--make sure you're using safe code and then assume the module is safe). Either way, we're going to assume that the dynamically-imported modules are really simple and have no reason to mess with sys.path. We will revisit this later if it becomes a barrier to being useful """ if injectLocals is None: injectLocals = {} pluginPath = os.path.join(inDir, moduleName+'.py') if not os.path.exists(pluginPath): return None # Join using a character that would be invalid in a pathname prevSysPath = '\x00'.join(sys.path) sys.path.append(inDir) modTemp = __import__(moduleName) modTemp.__dict__.update(injectLocals) # Assume that sys.path was unmodified by the module sys.path = sys.path[:-1] currSysPath = '\x00'.join(sys.path) if not currSysPath==prevSysPath: print '***ERROR: Dynamically imported module messed with sys.path!' print ' : Make sure your module does not modify sys.path' exit(1) return modTemp armory-0.92.3/setup.py0000644000000000000000000000117212414772654013343 0ustar rootroot#! /usr/bin/python from distutils.core import setup import py2exe opts = {"py2exe":{ "dll_excludes":["MSWSOCK.dll", "IPHLPAPI.dll", "MSWSOCK.dll", "WINNSI.dll", "WTSAPI32.dll"], "packages":["email"] }} setup( options = opts, windows = [ { "script": "../../ArmoryQt.py", "icon_resources": [(1, "../../img/armory256x256.ico"), (1, "../../img/armory64x64.ico"), (1, "../../img/armory48x48.ico")] } ] ) armory-0.92.3/bitcoinrpc_jsonrpc/0000755000000000000000000000000012414772654015522 5ustar rootrootarmory-0.92.3/bitcoinrpc_jsonrpc/proxy.py0000644000000000000000000000011212414772654017247 0ustar rootrootfrom .authproxy import AuthServiceProxy as ServiceProxy, JSONRPCException armory-0.92.3/bitcoinrpc_jsonrpc/json.py0000644000000000000000000000043012414772654017042 0ustar rootroot_json = __import__('json') loads = _json.loads dumps = _json.dumps if hasattr(_json, 'JSONEncodeException'): JSONEncodeException = _json.JSONEncodeException JSONDecodeException = _json.JSONDecodeException else: JSONEncodeException = TypeError JSONDecodeException = ValueError armory-0.92.3/bitcoinrpc_jsonrpc/__init__.py0000644000000000000000000000021512414772654017631 0ustar rootrootfrom .json import loads, dumps, JSONEncodeException, JSONDecodeException from bitcoinrpc_jsonrpc.proxy import ServiceProxy, JSONRPCException armory-0.92.3/bitcoinrpc_jsonrpc/authproxy.py0000644000000000000000000001104312414772654020136 0ustar rootroot """ Copyright 2011 Jeff Garzik AuthServiceProxy has the following improvements over python-jsonrpc's ServiceProxy class: - HTTP connections persist for the life of the AuthServiceProxy object (if server supports HTTP/1.1) - sends protocol 'version', per JSON-RPC 1.1 - sends proper, incrementing 'id' - sends Basic HTTP authentication headers - parses all JSON numbers that look like floats as Decimal - uses standard Python json lib Previous copyright, from python-jsonrpc/jsonrpc/proxy.py: Copyright (c) 2007 Jan-Klaas Kollhof This file is part of jsonrpc. jsonrpc is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this software; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA """ try: import http.client as httplib except ImportError: import httplib import base64 import json import decimal try: import urllib.parse as urlparse except ImportError: import urlparse USER_AGENT = "AuthServiceProxy/0.1" HTTP_TIMEOUT = 30 class JSONRPCException(Exception): def __init__(self, rpcError): Exception.__init__(self) self.error = rpcError class AuthServiceProxy(object): def __init__(self, serviceURL, serviceName=None): self.__serviceURL = serviceURL self.__serviceName = serviceName self.__url = urlparse.urlparse(serviceURL) if self.__url.port is None: port = 80 else: port = self.__url.port self.__idcnt = 0 authpair = "%s:%s" % (self.__url.username, self.__url.password) authpair = unicode(authpair, 'utf-8').encode('utf-8') self.__authhdr = "Basic ".encode('utf8') + base64.b64encode(authpair) if self.__url.scheme == 'https': self.__conn = httplib.HTTPSConnection(self.__url.hostname, port, None, None,False, HTTP_TIMEOUT) else: self.__conn = httplib.HTTPConnection(self.__url.hostname, port, False, HTTP_TIMEOUT) def __getattr__(self, name): if self.__serviceName != None: name = "%s.%s" % (self.__serviceName, name) return AuthServiceProxy(self.__serviceURL, name) def __call__(self, *args): self.__idcnt += 1 postdata = json.dumps({ 'version': '1.1', 'method': self.__serviceName, 'params': args, 'id': self.__idcnt}) self.__conn.request('POST', self.__url.path, postdata, { 'Host' : self.__url.hostname, 'User-Agent' : USER_AGENT, 'Authorization' : self.__authhdr, 'Content-type' : 'application/json' }) httpresp = self.__conn.getresponse() if httpresp is None: raise JSONRPCException({ 'code' : -342, 'message' : 'missing HTTP response from server'}) resp = httpresp.read() resp = resp.decode('utf8') resp = json.loads(resp, parse_float=decimal.Decimal) if resp['error'] != None: raise JSONRPCException(resp['error']) elif 'result' not in resp: raise JSONRPCException({ 'code' : -343, 'message' : 'missing JSON-RPC result'}) else: return resp['result'] def _batch(self, rpc_call_list): postdata = json.dumps(list(rpc_call_list)) self.__conn.request('POST', self.__url.path, postdata, { 'Host' : self.__url.hostname, 'User-Agent' : USER_AGENT, 'Authorization' : self.__authhdr, 'Content-type' : 'application/json' }) httpresp = self.__conn.getresponse() if httpresp is None: raise JSONRPCException({ 'code' : -342, 'message' : 'missing HTTP response from server'}) resp = httpresp.read() resp = resp.decode('utf8') resp = json.loads(resp, parse_float=decimal.Decimal) return resp armory-0.92.3/qtdefines.py0000644000000000000000000010220212414772654014161 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ import struct from tempfile import mkstemp from PyQt4.QtCore import * from PyQt4.QtGui import * import urllib from armorycolors import Colors, htmlColor from armoryengine.ArmoryUtils import * from armoryengine.BinaryUnpacker import * from armoryengine.MultiSigUtils import * SETTINGS_PATH = os.path.join(ARMORY_HOME_DIR, 'ArmorySettings.txt') USERMODE = enum('Standard', 'Advanced', 'Expert') SATOSHIMODE = enum('Auto', 'User') NETWORKMODE = enum('Offline', 'Full', 'Disconnected') WLTTYPES = enum('Plain', 'Crypt', 'WatchOnly', 'Offline') WLTFIELDS = enum('Name', 'Descr', 'WltID', 'NumAddr', 'Secure', \ 'BelongsTo', 'Crypto', 'Time', 'Mem', 'Version') MSGBOX = enum('Good','Info', 'Question', 'Warning', 'Critical', 'Error') MSGBOX = enum('Good','Info', 'Question', 'Warning', 'Critical', 'Error') DASHBTNS = enum('Close', 'Browse', 'Install', 'Instruct', 'Settings') STYLE_SUNKEN = QFrame.Box | QFrame.Sunken STYLE_RAISED = QFrame.Box | QFrame.Raised STYLE_PLAIN = QFrame.Box | QFrame.Plain STYLE_STYLED = QFrame.StyledPanel | QFrame.Raised STYLE_NONE = QFrame.NoFrame VERTICAL = 'vertical' HORIZONTAL = 'horizontal' CHANGE_ADDR_DESCR_STRING = '[[ Change received ]]' HTTP_VERSION_FILE = 'https://bitcoinarmory.com/versions.txt' BUG_REPORT_URL = 'https://bitcoinarmory.com/scripts/receive_debug.php' PRIVACY_URL = 'https://bitcoinarmory.com/privacy-policy' # For announcements handling ANNOUNCE_FETCH_INTERVAL = 1 * HOUR if CLI_OPTIONS.testAnnounceCode: HTTP_ANNOUNCE_FILE = \ 'https://s3.amazonaws.com/bitcoinarmory-testing/testannounce.txt' else: HTTP_ANNOUNCE_FILE = 'https://bitcoinarmory.com/atiannounce.txt' # Keep track of dialogs and wizard that are executing runningDialogsList = [] def AddToRunningDialogsList(func): def wrapper(*args, **kwargs): runningDialogsList.append(args[0]) result = func(*args, **kwargs) runningDialogsList.remove(args[0]) return result return wrapper ################################################################################ def tr(txt, replList=None, pluralList=None): """ This is a common convention for implementing translations, where all translatable strings are put int the _(...) function, and that method does some fancy stuff to present the translation if needed. This is being implemented here, to not only do translations in the future, but also to clean up the typical text fields I use. I've ended up with a program full of stuff like this: myLabel = QRichLabel( \ 'This text is split across mulitple lines ' 'with a space after each one, and single ' 'quotes on either side.') Instead it should really look like: myLabel = QRichLabel( tr(''' This text is split across mulitple lines and it will acquire a space after each line as well as include newlines because it's HTML and uses
. ''' )) Added easy plural handling: Just add an extra argument to specify a variable on which plurality should be chosen, and then decorate your text with @{singular|plural}@ For instance: tr('The @{cat|cats}@ danced. @{It was|They were}@ happy.', nCat) tr('The @{cat|%d cats}@ danced. @{It was|They were}@ happy.'%nCat, nCat) tr('The @{cat|cats}@ attacked the @{dog|dogs}@', nCat, nDog) This should work well for """ txt = toUnicode(txt) lines = [l.strip() for l in txt.split('\n')] txt = (' '.join(lines)).strip() # Eventually we do something cool with this transalate function. # It will be defined elsewhere, but for now stubbed with identity fn TRANSLATE = lambda x: x txt = TRANSLATE(txt) return formatWithPlurals(txt, replList, pluralList) ################################################################################ def HLINE(style=QFrame.Plain): qf = QFrame() qf.setFrameStyle(QFrame.HLine | style) return qf def VLINE(style=QFrame.Plain): qf = QFrame() qf.setFrameStyle(QFrame.VLine | style) return qf # Setup fixed-width and var-width fonts def GETFONT(ftype, sz=10, bold=False, italic=False): fnt = None if ftype.lower().startswith('fix'): if OS_WINDOWS: fnt = QFont("Courier", sz) elif OS_MACOSX: fnt = QFont("Menlo", sz) else: fnt = QFont("DejaVu Sans Mono", sz) elif ftype.lower().startswith('var'): if OS_MACOSX: fnt = QFont("Lucida Grande", sz) else: fnt = QFont("Verdana", sz) #if OS_WINDOWS: #fnt = QFont("Tahoma", sz) #else: #fnt = QFont("Sans", sz) elif ftype.lower().startswith('money'): if OS_WINDOWS: fnt = QFont("Courier", sz) elif OS_MACOSX: fnt = QFont("Menlo", sz) else: fnt = QFont("DejaVu Sans Mono", sz) else: fnt = QFont(ftype, sz) if bold: fnt.setWeight(QFont.Bold) if italic: fnt.setItalic(True) return fnt def UnicodeErrorBox(parent): QMessageBox.warning(parent, 'ASCII Error', \ toUnicode('Armory does not currently support non-ASCII characters in ' 'most text fields (like \xc2\xa3\xc2\xa5\xc3\xa1\xc3\xb6\xc3\xa9). ' 'Please use only letters found ' 'on an English(US) keyboard. This will be fixed in an upcoming ' 'release'), QMessageBox.Ok) ####### def UserModeStr(mode): if mode==USERMODE.Standard: return 'Standard' elif mode==USERMODE.Advanced: return 'Advanced' elif mode==USERMODE.Expert: return 'Expert' ####### def tightSizeNChar(obj, nChar): """ Approximates the size of a row text of mixed characters This is only aproximate, since variable-width fonts will vary depending on the specific text """ try: fm = QFontMetricsF(QFont(obj.font())) except AttributeError: fm = QFontMetricsF(QFont(obj)) szWidth,szHeight = fm.boundingRect('abcfgijklm').width(), fm.height() szWidth = int(szWidth * nChar/10.0 + 0.5) return szWidth, szHeight ####### def tightSizeStr(obj, theStr): """ Measure a specific string """ try: fm = QFontMetricsF(QFont(obj.font())) except AttributeError: fm = QFontMetricsF(QFont(obj)) szWidth,szHeight = fm.boundingRect(theStr).width(), fm.height() return szWidth, szHeight ####### def relaxedSizeStr(obj, theStr): """ Approximates the size of a row text, nchars long, adds some margin """ try: fm = QFontMetricsF(QFont(obj.font())) except AttributeError: fm = QFontMetricsF(QFont(obj)) szWidth,szHeight = fm.boundingRect(theStr).width(), fm.height() return (10 + szWidth*1.05), 1.5*szHeight ####### def relaxedSizeNChar(obj, nChar): """ Approximates the size of a row text, nchars long, adds some margin """ try: fm = QFontMetricsF(QFont(obj.font())) except AttributeError: fm = QFontMetricsF(QFont(obj)) szWidth,szHeight = fm.boundingRect('abcfg ijklm').width(), fm.height() szWidth = int(szWidth * nChar/10.0 + 0.5) return (10 + szWidth*1.05), 1.5*szHeight ############################################################################# def determineWalletType(wlt, wndw): if wlt.watchingOnly: if wndw.getWltSetting(wlt.uniqueIDB58, 'IsMine'): return [WLTTYPES.Offline, 'Offline'] else: return [WLTTYPES.WatchOnly, 'Watching-Only'] elif wlt.useEncryption: return [WLTTYPES.Crypt, 'Encrypted'] else: return [WLTTYPES.Plain, 'No Encryption'] ############################################################################# def initialColResize(tblViewObj, sizeList): """ We assume that all percentages are below 1, all fixed >1. TODO: This seems to almost work. providing exactly 100% input will actually result in somewhere between 75% and 125% (approx). For now, I have to experiment with initial values a few times before getting it to a satisfactory initial size. """ totalWidth = tblViewObj.width() fixedCols, pctCols = [],[] nCols = tblViewObj.model().columnCount() for col,colVal in enumerate(sizeList): if colVal > 1: fixedCols.append( (col, colVal) ) else: pctCols.append( (col, colVal) ) for c,sz in fixedCols: tblViewObj.horizontalHeader().resizeSection(c, sz) totalFixed = sum([sz[1] for sz in fixedCols]) szRemain = totalWidth-totalFixed for c,pct in pctCols: tblViewObj.horizontalHeader().resizeSection(c, pct*szRemain) tblViewObj.horizontalHeader().setStretchLastSection(True) class QRichLabel(QLabel): def __init__(self, txt, doWrap=True, \ hAlign=Qt.AlignLeft, \ vAlign=Qt.AlignVCenter, \ **kwargs): super(QRichLabel, self).__init__(txt) self.setTextFormat(Qt.RichText) self.setWordWrap(doWrap) self.setAlignment(hAlign | vAlign) self.setText(txt, **kwargs) # Fixes a problem with QLabel resizing based on content # ACR: ... and makes other problems. Removing for now. #self.setSizePolicy(QSizePolicy.Preferred, QSizePolicy.MinimumExpanding) #self.setMinimumHeight(int(relaxedSizeStr(self, 'QWERTYqypgj')[1])) def setText(self, text, color=None, size=None, bold=None, italic=None): text = unicode(text) if color: text = '%s' % (htmlColor(color), text) if size: if isinstance(size, int): text = '%s' % (size, text) else: text = '%s' % (size, text) if bold: text = '%s' % text if italic: text = '%s' % text super(QRichLabel, self).setText(text) def setBold(self): self.setText('' + self.text() + '') def setItalic(self): self.setText('' + self.text() + '') class QMoneyLabel(QRichLabel): def __init__(self, nSatoshi, ndec=8, maxZeros=2, wColor=True, wBold=False, txtSize=10): QLabel.__init__(self, coin2str(nSatoshi)) self.setValueText(nSatoshi, ndec, maxZeros, wColor, wBold, txtSize) def setValueText(self, nSatoshi, ndec=None, maxZeros=None, wColor=None, wBold=None, txtSize=10): """ When we set the text of the QMoneyLabel, remember previous values unless explicitly respecified """ if not ndec is None: self.ndec = ndec if not maxZeros is None: self.max0 = maxZeros if not wColor is None: self.colr = wColor if not wBold is None: self.bold = wBold theFont = GETFONT("Fixed", txtSize) if self.bold: theFont.setWeight(QFont.Bold) self.setFont(theFont) self.setWordWrap(False) valStr = coin2str(nSatoshi, ndec=self.ndec, maxZeros=self.max0) goodMoney = htmlColor('MoneyPos') badMoney = htmlColor('MoneyNeg') if nSatoshi < 0 and self.colr: self.setText('%s' % (badMoney, valStr)) elif nSatoshi > 0 and self.colr: self.setText('%s' % (goodMoney, valStr)) else: self.setText('%s' % valStr) self.setAlignment(Qt.AlignLeft | Qt.AlignVCenter) def setLayoutStretchRows(layout, *args): for i,st in enumerate(args): layout.setRowStretch(i, st) def setLayoutStretchCols(layout, *args): for i,st in enumerate(args): layout.setColumnStretch(i, st) # Use this for QHBoxLayout and QVBoxLayout, where you don't specify dimension def setLayoutStretch(layout, *args): for i,st in enumerate(args): layout.setStretch(i, st) ################################################################################ def QPixmapButton(img): btn = QPushButton('') px = QPixmap(img) btn.setIcon( QIcon(px)) btn.setIconSize(px.rect().size()) return btn ################################################################################ def QAcceptButton(): return QPixmapButton('img/btnaccept.png') def QCancelButton(): return QPixmapButton('img/btncancel.png') def QBackButton(): return QPixmapButton('img/btnback.png') def QOkButton(): return QPixmapButton('img/btnok.png') def QDoneButton(): return QPixmapButton('img/btndone.png') ################################################################################ class QLabelButton(QLabel): mousePressOn = set() def __init__(self, txt): colorStr = htmlColor('LBtnNormalFG') QLabel.__init__(self, '%s' % (colorStr, txt)) self.plainText = txt self.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) def sizeHint(self): w,h = relaxedSizeStr(self, self.plainText) return QSize(w,1.2*h) def mousePressEvent(self, ev): # Prevent click-bleed-through to dialogs being opened txt = toBytes(unicode(self.text())) self.mousePressOn.add(txt) def mouseReleaseEvent(self, ev): txt = toBytes(unicode(self.text())) if txt in self.mousePressOn: self.mousePressOn.remove(txt) self.emit(SIGNAL('clicked()')) def enterEvent(self, ev): ssStr = "QLabel { background-color : %s }" % htmlColor('LBtnHoverBG') self.setStyleSheet(ssStr) def leaveEvent(self, ev): ssStr = "QLabel { background-color : %s }" % htmlColor('LBtnNormalBG') self.setStyleSheet(ssStr) ################################################################################ # The optionalMsg argument is not word wrapped so the caller is responsible for limiting # the length of the longest line in the optionalMsg def MsgBoxCustom(wtype, title, msg, wCancel=False, yesStr=None, noStr=None, optionalMsg=None): """ Creates a message box with custom button text and icon """ class dlgWarn(ArmoryDialog): def __init__(self, dtype, dtitle, wmsg, withCancel=False, yesStr=None, noStr=None): super(dlgWarn, self).__init__(None) msgIcon = QLabel() fpix = '' if dtype==MSGBOX.Good: fpix = ':/MsgBox_good48.png' if dtype==MSGBOX.Info: fpix = ':/MsgBox_info48.png' if dtype==MSGBOX.Question: fpix = ':/MsgBox_question64.png' if dtype==MSGBOX.Warning: fpix = ':/MsgBox_warning48.png' if dtype==MSGBOX.Critical: fpix = ':/MsgBox_critical64.png' if dtype==MSGBOX.Error: fpix = ':/MsgBox_error64.png' if len(fpix)>0: msgIcon.setPixmap(QPixmap(fpix)) msgIcon.setAlignment(Qt.AlignHCenter | Qt.AlignTop) lblMsg = QLabel(msg) lblMsg.setTextFormat(Qt.RichText) lblMsg.setWordWrap(True) lblMsg.setAlignment(Qt.AlignLeft | Qt.AlignVCenter) lblMsg.setOpenExternalLinks(True) w,h = tightSizeNChar(lblMsg, 70) lblMsg.setMinimumSize( w, 3.2*h ) buttonbox = QDialogButtonBox() if dtype==MSGBOX.Question: if not yesStr: yesStr = '&Yes' if not noStr: noStr = '&No' btnYes = QPushButton(yesStr) btnNo = QPushButton(noStr) self.connect(btnYes, SIGNAL('clicked()'), self.accept) self.connect(btnNo, SIGNAL('clicked()'), self.reject) buttonbox.addButton(btnYes,QDialogButtonBox.AcceptRole) buttonbox.addButton(btnNo, QDialogButtonBox.RejectRole) else: cancelStr = '&Cancel' if (noStr is not None or withCancel) else '' yesStr = '&OK' if (yesStr is None) else yesStr btnOk = QPushButton(yesStr) btnCancel = QPushButton(cancelStr) self.connect(btnOk, SIGNAL('clicked()'), self.accept) self.connect(btnCancel, SIGNAL('clicked()'), self.reject) buttonbox.addButton(btnOk, QDialogButtonBox.AcceptRole) if cancelStr: buttonbox.addButton(btnCancel, QDialogButtonBox.RejectRole) spacer = QSpacerItem(20, 10, QSizePolicy.Fixed, QSizePolicy.Expanding) layout = QGridLayout() layout.addItem( spacer, 0,0, 1,2) layout.addWidget(msgIcon, 1,0, 1,1) layout.addWidget(lblMsg, 1,1, 1,1) if optionalMsg: optionalTextLabel = QLabel(optionalMsg) optionalTextLabel.setTextFormat(Qt.RichText) optionalTextLabel.setAlignment(Qt.AlignLeft | Qt.AlignVCenter) w,h = tightSizeNChar(optionalTextLabel, 70) optionalTextLabel.setMinimumSize( w, 3.2*h ) layout.addWidget(optionalTextLabel, 2,0,1,2) layout.addWidget(buttonbox, 3,0, 1,2) layout.setSpacing(20) self.setLayout(layout) self.setWindowTitle(dtitle) dlg = dlgWarn(wtype, title, msg, wCancel, yesStr, noStr) result = dlg.exec_() return result ################################################################################ def MsgBoxWithDNAA(wtype, title, msg, dnaaMsg, wCancel=False, \ yesStr='Yes', noStr='No', dnaaStartChk=False): """ Creates a warning/question/critical dialog, but with a "Do not ask again" checkbox. Will return a pair (response, DNAA-is-checked) """ class dlgWarn(ArmoryDialog): def __init__(self, dtype, dtitle, wmsg, dmsg=None, withCancel=False): super(dlgWarn, self).__init__(None) msgIcon = QLabel() fpix = '' if dtype==MSGBOX.Info: fpix = ':/MsgBox_info48.png' if not dmsg: dmsg = 'Do not show this message again' if dtype==MSGBOX.Question: fpix = ':/MsgBox_question64.png' if not dmsg: dmsg = 'Do not ask again' if dtype==MSGBOX.Warning: fpix = ':/MsgBox_warning48.png' if not dmsg: dmsg = 'Do not show this warning again' if dtype==MSGBOX.Critical: fpix = ':/MsgBox_critical64.png' if not dmsg: dmsg = None # should always show crits if dtype==MSGBOX.Error: fpix = ':/MsgBox_error64.png' if not dmsg: dmsg = None # should always show errors if len(fpix)>0: msgIcon.setPixmap(QPixmap(fpix)) msgIcon.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) self.chkDnaa = QCheckBox(dmsg) self.chkDnaa.setChecked(dnaaStartChk) lblMsg = QLabel(msg) lblMsg.setTextFormat(Qt.RichText) lblMsg.setWordWrap(True) lblMsg.setAlignment(Qt.AlignLeft | Qt.AlignVCenter) w,h = tightSizeNChar(lblMsg, 50) lblMsg.setMinimumSize( w, 3.2*h ) lblMsg.setOpenExternalLinks(True) buttonbox = QDialogButtonBox() if dtype==MSGBOX.Question: btnYes = QPushButton(yesStr) btnNo = QPushButton(noStr) self.connect(btnYes, SIGNAL('clicked()'), self.accept) self.connect(btnNo, SIGNAL('clicked()'), self.reject) buttonbox.addButton(btnYes,QDialogButtonBox.AcceptRole) buttonbox.addButton(btnNo, QDialogButtonBox.RejectRole) else: btnOk = QPushButton('Ok') self.connect(btnOk, SIGNAL('clicked()'), self.accept) buttonbox.addButton(btnOk, QDialogButtonBox.AcceptRole) if withCancel: btnOk = QPushButton('Cancel') self.connect(btnOk, SIGNAL('clicked()'), self.reject) buttonbox.addButton(btnOk, QDialogButtonBox.RejectRole) spacer = QSpacerItem(20, 10, QSizePolicy.Fixed, QSizePolicy.Expanding) layout = QGridLayout() layout.addItem( spacer, 0,0, 1,2) layout.addWidget(msgIcon, 1,0, 1,1) layout.addWidget(lblMsg, 1,1, 1,1) layout.addWidget(self.chkDnaa, 2,0, 1,2) layout.addWidget(buttonbox, 3,0, 1,2) layout.setSpacing(20) self.setLayout(layout) self.setWindowTitle(dtitle) dlg = dlgWarn(wtype, title, msg, dnaaMsg, wCancel) result = dlg.exec_() return (result, dlg.chkDnaa.isChecked()) def makeLayoutFrame(dirStr, widgetList, style=QFrame.NoFrame, condenseMargins=False): frm = QFrame() frm.setFrameStyle(style) frmLayout = QHBoxLayout() if dirStr.lower().startswith(VERTICAL): frmLayout = QVBoxLayout() for w in widgetList: if isinstance(w,str) and w.lower()=='stretch': frmLayout.addStretch() elif isinstance(w,str) and w.lower().startswith('space'): # expect "spacer(30)" first = w.index('(')+1 last = w.index(')') wid,hgt = int(w[first:last]), 1 if dirStr.lower().startswith(VERTICAL): wid,hgt = hgt,wid frmLayout.addItem( QSpacerItem(wid,hgt) ) elif isinstance(w,str) and w.lower().startswith('line'): frmLine = QFrame() if dirStr.lower().startswith(VERTICAL): frmLine.setFrameStyle(QFrame.HLine | QFrame.Plain) else: frmLine.setFrameStyle(QFrame.VLine | QFrame.Plain) frmLayout.addWidget(frmLine) elif isinstance(w,str) and w.lower().startswith('strut'): first = w.index('(')+1 last = w.index(')') strutSz = int(w[first:last]) frmLayout.addStrut(strutSz) elif isinstance(w,QSpacerItem): frmLayout.addItem(w) else: frmLayout.addWidget(w) if condenseMargins: frmLayout.setContentsMargins(3,3,3,3) frmLayout.setSpacing(3) else: frmLayout.setContentsMargins(5,5,5,5) frm.setLayout(frmLayout) return frm def addFrame(widget, style=STYLE_SUNKEN, condenseMargins=False): return makeLayoutFrame(HORIZONTAL, [widget], style, condenseMargins) def makeVertFrame(widgetList, style=QFrame.NoFrame, condenseMargins=False): return makeLayoutFrame(VERTICAL, widgetList, style, condenseMargins) def makeHorizFrame(widgetList, style=QFrame.NoFrame, condenseMargins=False): return makeLayoutFrame(HORIZONTAL, widgetList, style, condenseMargins) def QImageLabel(imgfn, size=None, stretch='NoStretch'): lbl = QLabel() if size==None: px = QPixmap(imgfn) else: px = QPixmap(imgfn).scaled(*size) # expect size=(W,H) lbl.setPixmap(px) return lbl def restoreTableView(qtbl, hexBytes): try: binunpack = BinaryUnpacker(hex_to_binary(hexBytes)) hexByte = binunpack.get(UINT8) binLen = binunpack.get(UINT8) toRestore = [] for i in range(binLen): sz = binunpack.get(UINT16) if sz>0: toRestore.append([i,sz]) for i,c in toRestore[:-1]: qtbl.setColumnWidth(i, c) except Exception, e: print 'ERROR!' pass # Don't want to crash the program just because couldn't load tbl data def saveTableView(qtbl): nCol = qtbl.model().columnCount() sz = [None]*nCol for i in range(nCol): sz[i] = qtbl.columnWidth(i) # Use 'ff' as a kind of magic byte for this data. Most importantly # we want to guarantee that the settings file will interpret this # as hex data -- I once had an unlucky hex string written out with # all digits and then intepretted as an integer on the next load :( first = int_to_hex(nCol) rest = [int_to_hex(s, widthBytes=2) for s in sz] return 'ff' + first + ''.join(rest) ################################################################################ # This class is intended to be an abstract frame class that # will hold all of the functionality that is common to all # Frames used in Armory. # The Frames that extend this class should contain all of the # display and control components for some screen used in Armory # Putting this content in a frame allows it to be used on it's own # in a dialog or as a component in a larger frame. class ArmoryFrame(QFrame): def __init__(self, parent, main): super(ArmoryFrame, self).__init__(parent) self.main = main # Subclasses should implement a method that returns a boolean to control # when done, accept, next, or final button should be enabled. self.isComplete = None ################################################################################ class ArmoryDialog(QDialog): def __init__(self, parent=None, main=None): super(ArmoryDialog, self).__init__(parent) self.parent = parent self.main = main self.setFont(GETFONT('var')) self.setWindowFlags(Qt.Window) if USE_TESTNET: self.setWindowTitle('Armory - Bitcoin Wallet Management [TESTNET]') self.setWindowIcon(QIcon(':/armory_icon_green_32x32.png')) else: self.setWindowTitle('Armory - Bitcoin Wallet Management') self.setWindowIcon(QIcon(':/armory_icon_32x32.png')) @AddToRunningDialogsList def exec_(self): return super(ArmoryDialog, self).exec_() ################################################################################ class QRCodeWidget(QWidget): def __init__(self, asciiToEncode='', prefSize=160, errLevel='L', parent=None): super(QRCodeWidget, self).__init__() self.parent = parent self.qrmtrx = None self.setAsciiData(asciiToEncode, prefSize, errLevel, repaint=False) def setAsciiData(self, newAscii, prefSize=160, errLevel='L', repaint=True): if len(newAscii)==0: self.qrmtrx = [[0]] self.modCt = 1 self.pxScale= 1 return self.theData = newAscii self.qrmtrx, self.modCt = CreateQRMatrix(self.theData, errLevel) self.setPreferredSize(prefSize) def getModuleCount1D(self): return self.modCt def setPreferredSize(self, px, policy='Approx'): self.pxScale,rem = divmod(int(px), int(self.modCt)) if policy.lower().startswith('approx'): if rem>self.modCt/2.0: self.pxScale += 1 elif policy.lower().startswith('atleast'): if rem>0: self.pxScale += 1 elif policy.lower().startswith('max'): pass else: LOGERROR('Bad size policy in set qr size') return self.pxScale*self.modCt return def getSize(self): return self.pxScale*self.modCt def sizeHint(self): sz1d = self.pxScale*self.modCt return QSize(sz1d, sz1d) def paintEvent(self, e): qp = QPainter() qp.begin(self) self.drawWidget(qp) qp.end() def drawWidget(self, qp): # In case this is not a white background, draw the white boxes qp.setPen(QColor(255,255,255)) qp.setBrush(QColor(255,255,255)) for r in range(self.modCt): for c in range(self.modCt): if not self.qrmtrx[r][c]: qp.drawRect(*[a*self.pxScale for a in [r,c,1,1]]) # Draw the black tiles qp.setPen(QColor(0,0,0)) qp.setBrush(QColor(0,0,0)) for r in range(self.modCt): for c in range(self.modCt): if self.qrmtrx[r][c]: qp.drawRect(*[a*self.pxScale for a in [r,c,1,1]]) def mouseDoubleClickEvent(self, *args): DlgInflatedQR(self.parent, self.theData).exec_() # Create a very simple dialog and execute it class DlgInflatedQR(ArmoryDialog): def __init__(self, parent, dataToQR): super(DlgInflatedQR, self).__init__(parent) sz = QApplication.desktop().size() w,h = sz.width(), sz.height() qrSize = int(min(w,h)*0.8) qrDisp = QRCodeWidget(dataToQR, prefSize=qrSize) def closeDlg(*args): self.accept() qrDisp.mouseDoubleClickEvent = closeDlg self.mouseDoubleClickEvent = closeDlg lbl = QRichLabel('Double-click or press ESC to close') lbl.setAlignment(Qt.AlignTop | Qt.AlignHCenter) frmQR = makeHorizFrame(['Stretch', qrDisp, 'Stretch']) frmFull = makeVertFrame(['Stretch',frmQR, lbl, 'Stretch']) layout = QVBoxLayout() layout.addWidget(frmFull) self.setLayout(layout) self.showFullScreen() # Pure-python BMP creator taken from: # # http://pseentertainmentcorp.com/smf/index.php?topic=2034.0 # # This will take a 2D array of ones-and-zeros and convert it to a binary # bitmap image, which will be stored in a temporary file. This temporary # file can be used for display and copy-and-paste into email. def bmp_binary(header, pixels): '''It takes a header (based on default_bmp_header), the pixel data (from structs, as produced by get_color and row_padding), and writes it to filename''' header_str = "" header_str += struct.pack('0: if os.path.exists(currText): initPath = currText if not OS_MACOSX: fullPath = unicode(QFileDialog.getExistingDirectory(par, title, initPath)) else: fullPath = unicode(QFileDialog.getExistingDirectory(par, title, initPath, \ options=QFileDialog.DontUseNativeDialog)) if fullPath: qObj.setText( fullPath) def createDirectorySelectButton(parent, targetWidget, title="Select Directory"): btn = QPushButton('') ico = QIcon(QPixmap(':/folder24.png')) btn.setIcon(ico) fn = lambda: selectDirectoryForQLineEdit(parent, targetWidget, title) parent.connect(btn, SIGNAL('clicked()'), fn) return btn armory-0.92.3/qt4reactor.py0000644000000000000000000002432312414772654014276 0ustar rootroot# Copyright (c) 2001-2011 Twisted Matrix Laboratories. # See LICENSE_qt4reactor for details. """ This module provides support for Twisted to be driven by the Qt mainloop. In order to use this support, simply do the following:: | app = QApplication(sys.argv) # your code to init Qt | import qt4reactor | qt4reactor.install() alternatively: | from twisted.application import reactors | reactors.installReactor('qt4') Then use twisted.internet APIs as usual. The other methods here are not intended to be called directly. If you don't instantiate a QApplication or QCoreApplication prior to installing the reactor, a QCoreApplication will be constructed by the reactor. QCoreApplication does not require a GUI so trial testing can occur normally. Twisted can be initialized after QApplication.exec_() with a call to reactor.runReturn(). calling reactor.stop() will unhook twisted but leave your Qt application running API Stability: stable Maintainer: U{Glenn H Tarbox, PhD} Previous maintainer: U{Itamar Shtull-Trauring} Original port to QT4: U{Gabe Rudy} Subsequent port by therve """ import sys import time from zope.interface import implements from twisted.internet.interfaces import IReactorFDSet from twisted.python import log, runtime from twisted.internet import posixbase from twisted.python.runtime import platformType, platform try: from PyQt4.QtCore import QSocketNotifier, QObject, SIGNAL, QTimer, QCoreApplication from PyQt4.QtCore import QEventLoop except ImportError: from PySide.QtCore import QSocketNotifier, QObject, SIGNAL, QTimer, QCoreApplication from PySide.QtCore import QEventLoop class TwistedSocketNotifier(QObject): """ Connection between an fd event and reader/writer callbacks. """ def __init__(self, parent, reactor, watcher, socketType): QObject.__init__(self, parent) self.reactor = reactor self.watcher = watcher fd = watcher.fileno() self.notifier = QSocketNotifier(fd, socketType, parent) self.notifier.setEnabled(True) if socketType == QSocketNotifier.Read: self.fn = self.read else: self.fn = self.write QObject.connect(self.notifier, SIGNAL("activated(int)"), self.fn) def shutdown(self): self.notifier.setEnabled(False) self.disconnect(self.notifier, SIGNAL("activated(int)"), self.fn) self.fn = self.watcher = None self.notifier.deleteLater() self.deleteLater() def read(self, fd): if not self.watcher: return w = self.watcher # doRead can cause self.shutdown to be called so keep a reference to self.watcher def _read(): #Don't call me again, until the data has been read self.notifier.setEnabled(False) why = None try: why = w.doRead() inRead = True except: inRead = False log.err() why = sys.exc_info()[1] if why: self.reactor._disconnectSelectable(w, why, inRead) elif self.watcher: self.notifier.setEnabled(True) # Re enable notification following sucessfull read self.reactor._iterate(fromqt=True) log.callWithLogger(w, _read) def write(self, sock): if not self.watcher: return w = self.watcher def _write(): why = None self.notifier.setEnabled(False) try: why = w.doWrite() except: log.err() why = sys.exc_info()[1] if why: self.reactor._disconnectSelectable(w, why, False) elif self.watcher: self.notifier.setEnabled(True) self.reactor._iterate(fromqt=True) log.callWithLogger(w, _write) class QtReactor(posixbase.PosixReactorBase): implements(IReactorFDSet) def __init__(self): self._reads = {} self._writes = {} self._notifiers = {} self._timer = QTimer() self._timer.setSingleShot(True) QObject.connect(self._timer, SIGNAL("timeout()"), self.iterate) if QCoreApplication.instance() is None: # Application Object has not been started yet self.qApp=QCoreApplication([]) self._ownApp=True else: self.qApp = QCoreApplication.instance() self._ownApp=False self._blockApp = None posixbase.PosixReactorBase.__init__(self) def _add(self, xer, primary, type): """ Private method for adding a descriptor from the event loop. It takes care of adding it if new or modifying it if already added for another state (read -> read/write for example). """ if xer not in primary: primary[xer] = TwistedSocketNotifier(None, self, xer, type) def addReader(self, reader): """ Add a FileDescriptor for notification of data available to read. """ self._add(reader, self._reads, QSocketNotifier.Read) def addWriter(self, writer): """ Add a FileDescriptor for notification of data available to write. """ self._add(writer, self._writes, QSocketNotifier.Write) def _remove(self, xer, primary): """ Private method for removing a descriptor from the event loop. It does the inverse job of _add, and also add a check in case of the fd has gone away. """ if xer in primary: notifier = primary.pop(xer) notifier.shutdown() def removeReader(self, reader): """ Remove a Selectable for notification of data available to read. """ self._remove(reader, self._reads) def removeWriter(self, writer): """ Remove a Selectable for notification of data available to write. """ self._remove(writer, self._writes) def removeAll(self): """ Remove all selectables, and return a list of them. """ rv = self._removeAll(self._reads, self._writes) return rv def getReaders(self): return self._reads.keys() def getWriters(self): return self._writes.keys() def callLater(self,howlong, *args, **kargs): rval = super(QtReactor,self).callLater(howlong, *args, **kargs) self.reactorInvocation() return rval def reactorInvocation(self): self._timer.stop() self._timer.setInterval(0) self._timer.start() def _iterate(self, delay=None, fromqt=False): """See twisted.internet.interfaces.IReactorCore.iterate. """ self.runUntilCurrent() self.doIteration(delay, fromqt) iterate = _iterate def doIteration(self, delay=None, fromqt=False): 'This method is called by a Qt timer or by network activity on a file descriptor' if not self.running and self._blockApp: self._blockApp.quit() self._timer.stop() delay = max(delay, 1) if not fromqt: self.qApp.processEvents(QEventLoop.AllEvents, delay * 1000) if self.timeout() is None: timeout = 0.1 elif self.timeout() == 0: timeout = 0 else: timeout = self.timeout() self._timer.setInterval(timeout * 1000) self._timer.start() def runReturn(self, installSignalHandlers=True): self.startRunning(installSignalHandlers=installSignalHandlers) self.reactorInvocation() def run(self, installSignalHandlers=True): if self._ownApp: self._blockApp = self.qApp else: self._blockApp = QEventLoop() self.runReturn() self._blockApp.exec_() class QtEventReactor(QtReactor): def __init__(self, *args, **kwargs): self._events = {} super(QtEventReactor, self).__init__() def addEvent(self, event, fd, action): """ Add a new win32 event to the event loop. """ self._events[event] = (fd, action) def removeEvent(self, event): """ Remove an event. """ if event in self._events: del self._events[event] def doEvents(self): handles = self._events.keys() if len(handles) > 0: val = None while val != WAIT_TIMEOUT: val = MsgWaitForMultipleObjects(handles, 0, 0, QS_ALLINPUT | QS_ALLEVENTS) if val >= WAIT_OBJECT_0 and val < WAIT_OBJECT_0 + len(handles): event_id = handles[val - WAIT_OBJECT_0] if event_id in self._events: fd, action = self._events[event_id] log.callWithLogger(fd, self._runAction, action, fd) elif val == WAIT_TIMEOUT: pass else: #print 'Got an unexpected return of %r' % val return def _runAction(self, action, fd): try: closed = getattr(fd, action)() except: closed = sys.exc_info()[1] log.deferr() if closed: self._disconnectSelectable(fd, closed, action == 'doRead') def timeout(self): t = super(QtEventReactor, self).timeout() return min(t, 0.01) def iterate(self, delay=None): """See twisted.internet.interfaces.IReactorCore.iterate. """ self.runUntilCurrent() self.doEvents() self.doIteration(delay) def posixinstall(): """ Install the Qt reactor. """ p = QtReactor() from twisted.internet.main import installReactor installReactor(p) def win32install(): """ Install the Qt reactor. """ p = QtEventReactor() from twisted.internet.main import installReactor installReactor(p) if runtime.platform.getType() == 'win32': #from win32event import CreateEvent, MsgWaitForMultipleObjects #from win32event import WAIT_OBJECT_0, WAIT_TIMEOUT, QS_ALLINPUT, QS_ALLEVENTS install = win32install else: install = posixinstall __all__ = ["install"] armory-0.92.3/devchanges.txt0000644000000000000000000001014312414772654014477 0ustar rootrootChangelog for Developers using the armoryengine codebase -- Refactored code. To get armoryengine utilities as before, you must use: from armoryengine.ALL import * -- Method addrStr_to_hash160() used to return just a 20-byte string. Now it returns both a prefix string. The prefix is either '\x00' (reg addr), or '\x05' (P2SH addr). Or the appropriate ones for your network. -- We have started replacing most things that use "addr160" values with "scrAddress" values. "ScrAddr" == Script/Address, and refers to a general TxOut scripts which may not be regular addresses. Could be P2SH, multisig, or something non-standard. -- A scrAddr is unique for a recipient, meaning that if two scripts return the same scrAddr, it means that the same private keys have control over it (example: one TxOut may use pay2pubkey, another may use pay2pubkeyhash. If they are to the same pubkey, they will have the same scrAddr. -- Use scrAddr_to_addrStr to convert from this new form to a base58-encoded address-string, if it has such a form (basically, regular adddresses and P2SH). Will throw a BadAddressError if not. This is all part of a more general move to handle arbitrary scripts instead of just the standard Pay2PubKeyHash scripts. Added a bunch of conversion methods: CREATE SCRIPT: hash160_to_p2pkhash_script( a160 ) # DUP HASH EQUAL CHKSIG hash160_to_p2shStr( a160 ) # HASH EQUAL pubkey_to_p2pk_script( a160 ) # CHECKSIG scrAddr_to_script( scraddr ) # works for RegAddr and P2SH pubkeylist_to_multisig_script([]) # NOT-TESTED-YET ADDR STRINGS: scrAddr_to_addrStr(scrAddr) script_to_addrStr(script) addrStr_to_scrAddr(b58str) addrStr_to_hash160(b58str) # Now returns (PREFIX, 20B) addrStr_is_p2sh(b58str) READ SCRIPT: script_to_scrAddr(script) script_to_p2sh_script(script) script_to_addrStr(script) -- Script identification used to be calculated in both the python and C++ in their own ways. Now, we have implemented C++ methods to do this, and leverage those methods through SWIG on the python side. Wherever you used to use "TXOUT_SCRIPT_*" constants when checking the output of getTxOutScriptType(scr), you now compare against the CPP_TXIN_* and CPP_TXOUT_* constants listed at the top of cppForSwig/BtcUtils.h, or around line 400 in armoryengine/ArmoryUtils.py (and listed here!): CPP_TXIN_STDUNCOMPR = 0 # Signature + PubKey65 CPP_TXIN_STDCOMPR = 1 # Signature + PubKey33 CPP_TXIN_COINBASE = 2 # Outpoint is ('00'*32, 'ffffffff') CPP_TXIN_SPENDPUBKEY = 3 # Signature-only CPP_TXIN_SPENDMULTI = 4 # OP_0 (M) Sig1 Sig2 ... (N) CPP_TXIN_SPENDP2SH = 5 # CPP_TXIN_NONSTANDARD = 6 # Everything else CPP_TXOUT_STDHASH160 = 0 # DUP HASH <20B> EQUAL CHKSIG CPP_TXOUT_STDPUBKEY65 = 1 # CHECKSIG CPP_TXOUT_STDPUBKEY33 = 2 # CHECKSIG CPP_TXOUT_MULTISIG = 3 # M ... N CPP_TXOUT_P2SH = 4 # HASH <20B> EQUAL CPP_TXOUT_NONSTANDARD = 5 # Everything else NOTE: The CPP_TXIN_SPENDP2SH identification should probably be renamed to CPP_TXIN_PROBP2SH, since it's not *theoretically* 100% reliable. It will be flagged like this only if it is a push-only script, AND the last PushData is, itself, a *STANDARD* TxOut script. It may very well be a p2sh-spending script but won't be flagged, if the subscript is non-standard. This is okay, because the network itself enforces this rule (a P2SH spend is standard, only if the subscript is standard). However, I suppose it is possible to have a TxIn script that gets labeled, but is not actually P2SHSPEND. However, I'm doubtful that such a script could be valid and make it's way through Bitcoin-Qt into the blk*.dat files. armory-0.92.3/r-pi/0000755000000000000000000000000012414772654012477 5ustar rootrootarmory-0.92.3/r-pi/r-pi_dl_packages.sh0000755000000000000000000000161512414772654016225 0ustar rootroot#! /bin/bash packages="libqtcore4 libqt4-dev python-qt4 python-twisted libconfig-file-perl libqt4-designer libqt4-scripttools libqt4-help libqt4-test libqtassistantclient4 libqtwebkit4 libqt4-declarative libqt4-script libqt4-xmlpatterns libqt4-dev-bin libqt4-qt3support libqt4-sql qt4-linguist-tools qt4-qmake python-psutil python-pyasn1 python-sip python-crypto python-openssl python-twisted-conch python-twisted-lore python-twisted-mail python-twisted-news python-twisted-runner python-twisted-words python-twisted-core python-twisted-web python-twisted-names python-twisted-bin python-zope.interface python-pkg-resources " arch="i386" for i do arg=$i done if [[ "$arg" == -* ]]; then arch=${i:1} fi if [ ! -d "$arch" ]; then mkdir $arch fi cd $arch for pkg in $packages; do apt-get -o APT::Architecture=$arch download $pkg done cd .. exit armory-0.92.3/r-pi/crosscompile.py0000644000000000000000000000224612414772654015557 0ustar rootrootimport os import subprocess import time def setEnv(var, val): print 'Setting environment var: $%s to %s' % (var,val) os.environ[str(var)] = str(val) def popen(cmdList, cwd=None): print '*'*80 print 'Executing: "%s"' % ' '.join(cmdList) proc = subprocess.Popen(cmdList, cwd=cwd) while proc.poll() is None: time.sleep(1) print 'Done with: "%s"' % ' '.join(cmdList) print '*'*80 verStr = '' for line in open('armoryengine/ArmoryUtils.py','r').readlines(): if line.startswith('BTCARMORY_VERSION'): c0 = line.find('(')+1 c1 = line.find(')') vquad = [int(istr.strip()) for istr in line[c0:c1].split(',')] verStr = '%d.%02d' % tuple(vquad[:2]) if (vquad[2] > 0 or vquad[3] > 0): verStr += '.%d' % vquad[2] if vquad[3] > 0: verStr += '.%d' % vquad[3] break print 'Armory version:', verStr instDir = 'armory_%s_raspbian-armhf' % verStr targz = '../' + instDir + '.tar.gz' os.makedirs(instDir) popen(['make', 'CXX=/home/alan/x-tools/arm-unknown-linux-gnueabi/bin/arm-unknown-linux-gnueabi-g++']) popen(['make', 'install', 'DESTDIR=%s'%instDir]) popen(['tar','-zcf', targz, 'usr'], cwd=instDir) armory-0.92.3/ArmoryDB.py0000644000000000000000000002103112414772654013656 0ustar rootroot####################################################################################################### # # Inconsistencies found in the DB map (https://dl.dropboxusercontent.com/u/1139081/BitcoinImg/armory_db_keyvalue_maps.png) as compared to the actual DB: # # In leveldb_headers: # StoredDBInfo (Key '\0'): # The value is 48 bytes long isntead of the 44 announced. Magic byte and Top block height are in their expected position # # In leveldb_blkdata # StoredTx: # Locktime at the end of the TxIns, remember to it away from there and pad at the end of TxOuts to proper unserialization # # StoredTxOut: # No spendness data appended at the end of each txout (yet) # ####################################################################################################### import os import struct from armoryengine.ArmoryUtils import ARMORY_HOME_DIR, unpackVarInt from armoryengine.Block import PyBlockHeader from armoryengine.Transaction import PyTx import leveldb #dbheaders_path = '/home/goat/.armory/databases/leveldb_headers' #dbblkdata_path = '/home/goat/.armory/databases/leveldb_blkdata' dbheaders_path = os.path.join(ARMORY_HOME_DIR, 'databases', 'leveldb_headers') dbblkdata_path = os.path.join(ARMORY_HOME_DIR, 'databases', 'leveldb_blkdata') ######################################################################################################## # front end class, implements the db parsing and querying methods. # opens DB on instantiation ######################################################################################################## class ArmoryDB: dbheaders = None dbblkdata = None def __init__(self): if(ArmoryDB.dbheaders==None): ArmoryDB.dbheaders = leveldb.LevelDB(dbheaders_path) ArmoryDB.dbblkdata = leveldb.LevelDB(dbblkdata_path) #################################################################################################### # parses block headers db # return a DBstatus object #################################################################################################### def getDBStatus(self): rtStat = DBstatus() rtStat.TopBlockInHeadersDB = self.getTopBlockInHeadersDB() rtStat.TopBlockInBlkDataDB = self.getTopBlockInBlkDataDB() headstart = '\x0200000000' headers = ArmoryDB.dbheaders.RangeIter(key_from = headstart, key_to = None, include_value = True) i = 0 rtStat.nMissingHeight = 0 rtStat.nDupHeight = 0 rtStat.MissingHeight = [] rtStat.DupHeight = [] for (key, value) in headers: height = struct.pack('I', key[1:5]) if(height!=i): rtStat.nMissingHeight = rtStat.nMissingHeight +1 rtStat.MissingHeight.append(height) nDups = struct.pack('B', value[0:1]) if (nDups>1): rtStat.nDupHeight = rtStat.nDupHeight +1 rtStat.DupHeight.append(height) i = i+1; return rtStat ################################################################################################### # fetch headers functions ################################################################################################### def getAllHeadersAtHeight(self, height): key = '\x02' keybody = struct.pack('>I', height) key = key +keybody try: headers = ArmoryDB.dbheaders.Get(key) except: return None nheaders = struct.unpack_from('B', headers) tlength = 1 +33*nheaders[0] pos=1 BlockHeaderList = [] while(posI', height) key = key +keybody try: headers = ArmoryDB.dbheaders.Get(key) except: return None nheaders = struct.unpack_from('B', headers) pos=1 blkkey = '\x01' + headers[pos+1:pos+33] val = ArmoryDB.dbheaders.Get(blkkey) rtBlock = PyBlockHeader() rtBlock.unserialize(val) return rtBlock ######## def getTopBlockInHeadersDB(self): head = ArmoryDB.dbheaders.Get('\0') val = struct.unpack('III' + 'I'*9, head) return val[2] ######## def getTopBlockInBlkDataDB(self): head = ArmoryDB.dbblkdata.Get('\0') val = struct.unpack('III' + 'I'*9, head) return val[2] ################################################################################################### # Txn fetching functions ################################################################################################### def myOwnUnpacker(self, val): data = val[2:] outputval = data[0:8] scriptsize, varintsize = unpackVarInt(data[8:]) scriptend = 8 + varintsize + scriptsize #print 'script length: %d, varintSize: %d, scriptEnd - dataSize: %d' % (scriptsize, varintsize, scriptend - len(data)) #print 'val length: %d' % (len(val)) ##### def myOwnUnpackerTxIn(self, val): data = val[38:] scriptsize, varintsize = unpackVarInt(data) data = val[38+varintsize:] scriptsize, varintsize = unpackVarInt(data[36:]) scriptend = 40 + varintsize + scriptsize print 'script length: %d, varintSize: %d, scriptEnd - dataSize: %d' % (scriptsize, varintsize, scriptend - len(data)) print 'len(val): %d' % (len(val)) dathash = val rtstr = ":".join("{0:x}".format(ord(c)) for c in dathash) print rtstr ##### def getTxnByKey(self, key): txIns = ArmoryDB.dbblkdata.Get(key) txoutkey = key + '\x00' txOuts = ArmoryDB.dbblkdata.RangeIter(key_from = txoutkey, key_to = None, include_value = True) txOutsVal = "" for (k, value) in txOuts: if(k[0:7]==key): txOutsVal = txOutsVal + value[2:] else: break txData = txIns[34:len(txIns)-4] + txOutsVal + txIns[len(txIns)-4:] RtTx = PyTx() RtTx.unserialize(txData) return RtTx ##### def getTxnByHash(self, Hash): HashLeftOver = Hash[4:32] key = '\x04' + Hash[0:4] try: val = ArmoryDB.dbblkdata.Get(key) except: return None nCandidates = unpackVarInt(val) pos = nCandidates[1] for i in range(0, nCandidates[0]): key = '\x03' + val[pos +i*6:pos +(i+1)*6] Candidate = ArmoryDB.dbblkdata.Get(key) CandidateHash = Candidate[6:34] if(CandidateHash==HashLeftOver): return self.getTxnByKey(key) return None ##### def getAllTxnByPrefix(self, Prefix): key = '\x04' + Prefix try: val = ArmoryDB.dbblkdata.Get(key) except: return None nCandidates = unpackVarInt(val) RtTxn = [] pos = nCandidates[1] for i in range(0, nCandidates[0]): key = '\x03' + val[pos +i*6:pos +(i+1)*6] rt = self.getTxnByKey(key) RtTxn.append(rt) return RtTxn ################################################################################################## # Look Up Blocks by Hash functions ################################################################################################## def headersDBHasBlockHash(self, Hash): key = '\x01' + Hash try: val = ArmoryDB.dbheaders.Get(key) return True except: return False ##### def blkdataDBHasBlockHash(self, Hash): key = '\x01' + Hash val = ArmoryDB.dbblkdata.Get(key) if(len(val)==84): key = '\x03' + val[80:84] try: val = ArmoryDB.bblkdata.Get(key) return True except: return False ################################################################################################### # DBStatus class, filled by ArmoryDB.GetStatus(), holds: # nDups ################################################################################################### class DBstatus: def __init__(self): TopBlockInHeadersDB=0 TopBlockInBlkDataDB=0 nMissingHeight=0 MissingHeight=[] nDupHeight=0 DupHeight=[] ################################################### ################################################### # end of lib ################################################### ################################################### armory-0.92.3/urllib3/0000755000000000000000000000000012414772654013204 5ustar rootrootarmory-0.92.3/urllib3/connectionpool.py0000644000000000000000000006343112414772654016616 0ustar rootroot# urllib3/connectionpool.py # Copyright 2008-2013 Andrey Petrov and contributors (see CONTRIBUTORS.txt) # # This module is part of urllib3 and is released under # the MIT License: http://www.opensource.org/licenses/mit-license.php import errno import logging from socket import error as SocketError, timeout as SocketTimeout import socket try: # Python 3 from queue import LifoQueue, Empty, Full except ImportError: from Queue import LifoQueue, Empty, Full import Queue as _ # Platform-specific: Windows from .exceptions import ( ClosedPoolError, ConnectionError, ConnectTimeoutError, EmptyPoolError, HostChangedError, MaxRetryError, SSLError, TimeoutError, ReadTimeoutError, ProxyError, ) from .packages.ssl_match_hostname import CertificateError from .packages import six from .connection import ( port_by_scheme, DummyConnection, HTTPConnection, HTTPSConnection, VerifiedHTTPSConnection, HTTPException, BaseSSLError, ) from .request import RequestMethods from .response import HTTPResponse from .util import ( assert_fingerprint, get_host, is_connection_dropped, Timeout, ) xrange = six.moves.xrange log = logging.getLogger(__name__) _Default = object() ## Pool objects class ConnectionPool(object): """ Base class for all connection pools, such as :class:`.HTTPConnectionPool` and :class:`.HTTPSConnectionPool`. """ scheme = None QueueCls = LifoQueue def __init__(self, host, port=None): # httplib doesn't like it when we include brackets in ipv6 addresses host = host.strip('[]') self.host = host self.port = port def __str__(self): return '%s(host=%r, port=%r)' % (type(self).__name__, self.host, self.port) # This is taken from http://hg.python.org/cpython/file/7aaba721ebc0/Lib/socket.py#l252 _blocking_errnos = set([errno.EAGAIN, errno.EWOULDBLOCK]) class HTTPConnectionPool(ConnectionPool, RequestMethods): """ Thread-safe connection pool for one host. :param host: Host used for this HTTP Connection (e.g. "localhost"), passed into :class:`httplib.HTTPConnection`. :param port: Port used for this HTTP Connection (None is equivalent to 80), passed into :class:`httplib.HTTPConnection`. :param strict: Causes BadStatusLine to be raised if the status line can't be parsed as a valid HTTP/1.0 or 1.1 status line, passed into :class:`httplib.HTTPConnection`. .. note:: Only works in Python 2. This parameter is ignored in Python 3. :param timeout: Socket timeout in seconds for each individual connection. This can be a float or integer, which sets the timeout for the HTTP request, or an instance of :class:`urllib3.util.Timeout` which gives you more fine-grained control over request timeouts. After the constructor has been parsed, this is always a `urllib3.util.Timeout` object. :param maxsize: Number of connections to save that can be reused. More than 1 is useful in multithreaded situations. If ``block`` is set to false, more connections will be created but they will not be saved once they've been used. :param block: If set to True, no more than ``maxsize`` connections will be used at a time. When no free connections are available, the call will block until a connection has been released. This is a useful side effect for particular multithreaded situations where one does not want to use more than maxsize connections per host to prevent flooding. :param headers: Headers to include with all requests, unless other headers are given explicitly. :param _proxy: Parsed proxy URL, should not be used directly, instead, see :class:`urllib3.connectionpool.ProxyManager`" :param _proxy_headers: A dictionary with proxy headers, should not be used directly, instead, see :class:`urllib3.connectionpool.ProxyManager`" """ scheme = 'http' ConnectionCls = HTTPConnection def __init__(self, host, port=None, strict=False, timeout=Timeout.DEFAULT_TIMEOUT, maxsize=1, block=False, headers=None, _proxy=None, _proxy_headers=None): ConnectionPool.__init__(self, host, port) RequestMethods.__init__(self, headers) self.strict = strict # This is for backwards compatibility and can be removed once a timeout # can only be set to a Timeout object if not isinstance(timeout, Timeout): timeout = Timeout.from_float(timeout) self.timeout = timeout self.pool = self.QueueCls(maxsize) self.block = block self.proxy = _proxy self.proxy_headers = _proxy_headers or {} # Fill the queue up so that doing get() on it will block properly for _ in xrange(maxsize): self.pool.put(None) # These are mostly for testing and debugging purposes. self.num_connections = 0 self.num_requests = 0 def _new_conn(self): """ Return a fresh :class:`HTTPConnection`. """ self.num_connections += 1 log.info("Starting new HTTP connection (%d): %s" % (self.num_connections, self.host)) conn = self.ConnectionCls(host=self.host, port=self.port, timeout=self.timeout.connect_timeout, strict=self.strict) if self.proxy is not None: # Enable Nagle's algorithm for proxies, to avoid packet # fragmentation. conn.tcp_nodelay = 0 return conn def _get_conn(self, timeout=None): """ Get a connection. Will return a pooled connection if one is available. If no connections are available and :prop:`.block` is ``False``, then a fresh connection is returned. :param timeout: Seconds to wait before giving up and raising :class:`urllib3.exceptions.EmptyPoolError` if the pool is empty and :prop:`.block` is ``True``. """ conn = None try: conn = self.pool.get(block=self.block, timeout=timeout) except AttributeError: # self.pool is None raise ClosedPoolError(self, "Pool is closed.") except Empty: if self.block: raise EmptyPoolError(self, "Pool reached maximum size and no more " "connections are allowed.") pass # Oh well, we'll create a new connection then # If this is a persistent connection, check if it got disconnected if conn and is_connection_dropped(conn): log.info("Resetting dropped connection: %s" % self.host) conn.close() return conn or self._new_conn() def _put_conn(self, conn): """ Put a connection back into the pool. :param conn: Connection object for the current host and port as returned by :meth:`._new_conn` or :meth:`._get_conn`. If the pool is already full, the connection is closed and discarded because we exceeded maxsize. If connections are discarded frequently, then maxsize should be increased. If the pool is closed, then the connection will be closed and discarded. """ try: self.pool.put(conn, block=False) return # Everything is dandy, done. except AttributeError: # self.pool is None. pass except Full: # This should never happen if self.block == True log.warning( "Connection pool is full, discarding connection: %s" % self.host) # Connection never got put back into the pool, close it. if conn: conn.close() def _get_timeout(self, timeout): """ Helper that always returns a :class:`urllib3.util.Timeout` """ if timeout is _Default: return self.timeout.clone() if isinstance(timeout, Timeout): return timeout.clone() else: # User passed us an int/float. This is for backwards compatibility, # can be removed later return Timeout.from_float(timeout) def _make_request(self, conn, method, url, timeout=_Default, **httplib_request_kw): """ Perform a request on a given urllib connection object taken from our pool. :param conn: a connection from one of our connection pools :param timeout: Socket timeout in seconds for the request. This can be a float or integer, which will set the same timeout value for the socket connect and the socket read, or an instance of :class:`urllib3.util.Timeout`, which gives you more fine-grained control over your timeouts. """ self.num_requests += 1 timeout_obj = self._get_timeout(timeout) try: timeout_obj.start_connect() conn.timeout = timeout_obj.connect_timeout # conn.request() calls httplib.*.request, not the method in # urllib3.request. It also calls makefile (recv) on the socket. conn.request(method, url, **httplib_request_kw) except SocketTimeout: raise ConnectTimeoutError( self, "Connection to %s timed out. (connect timeout=%s)" % (self.host, timeout_obj.connect_timeout)) # Reset the timeout for the recv() on the socket read_timeout = timeout_obj.read_timeout # App Engine doesn't have a sock attr if hasattr(conn, 'sock'): # In Python 3 socket.py will catch EAGAIN and return None when you # try and read into the file pointer created by http.client, which # instead raises a BadStatusLine exception. Instead of catching # the exception and assuming all BadStatusLine exceptions are read # timeouts, check for a zero timeout before making the request. if read_timeout == 0: raise ReadTimeoutError( self, url, "Read timed out. (read timeout=%s)" % read_timeout) if read_timeout is Timeout.DEFAULT_TIMEOUT: conn.sock.settimeout(socket.getdefaulttimeout()) else: # None or a value conn.sock.settimeout(read_timeout) # Receive the response from the server try: try: # Python 2.7+, use buffering of HTTP responses httplib_response = conn.getresponse(buffering=True) except TypeError: # Python 2.6 and older httplib_response = conn.getresponse() except SocketTimeout: raise ReadTimeoutError( self, url, "Read timed out. (read timeout=%s)" % read_timeout) except BaseSSLError as e: # Catch possible read timeouts thrown as SSL errors. If not the # case, rethrow the original. We need to do this because of: # http://bugs.python.org/issue10272 if 'timed out' in str(e) or \ 'did not complete (read)' in str(e): # Python 2.6 raise ReadTimeoutError(self, url, "Read timed out.") raise except SocketError as e: # Platform-specific: Python 2 # See the above comment about EAGAIN in Python 3. In Python 2 we # have to specifically catch it and throw the timeout error if e.errno in _blocking_errnos: raise ReadTimeoutError( self, url, "Read timed out. (read timeout=%s)" % read_timeout) raise # AppEngine doesn't have a version attr. http_version = getattr(conn, '_http_vsn_str', 'HTTP/?') log.debug("\"%s %s %s\" %s %s" % (method, url, http_version, httplib_response.status, httplib_response.length)) return httplib_response def close(self): """ Close all pooled connections and disable the pool. """ # Disable access to the pool old_pool, self.pool = self.pool, None try: while True: conn = old_pool.get(block=False) if conn: conn.close() except Empty: pass # Done. def is_same_host(self, url): """ Check if the given ``url`` is a member of the same host as this connection pool. """ if url.startswith('/'): return True # TODO: Add optional support for socket.gethostbyname checking. scheme, host, port = get_host(url) # Use explicit default port for comparison when none is given if self.port and not port: port = port_by_scheme.get(scheme) elif not self.port and port == port_by_scheme.get(scheme): port = None return (scheme, host, port) == (self.scheme, self.host, self.port) def urlopen(self, method, url, body=None, headers=None, retries=3, redirect=True, assert_same_host=True, timeout=_Default, pool_timeout=None, release_conn=None, **response_kw): """ Get a connection from the pool and perform an HTTP request. This is the lowest level call for making a request, so you'll need to specify all the raw details. .. note:: More commonly, it's appropriate to use a convenience method provided by :class:`.RequestMethods`, such as :meth:`request`. .. note:: `release_conn` will only behave as expected if `preload_content=False` because we want to make `preload_content=False` the default behaviour someday soon without breaking backwards compatibility. :param method: HTTP request method (such as GET, POST, PUT, etc.) :param body: Data to send in the request body (useful for creating POST requests, see HTTPConnectionPool.post_url for more convenience). :param headers: Dictionary of custom headers to send, such as User-Agent, If-None-Match, etc. If None, pool headers are used. If provided, these headers completely replace any pool-specific headers. :param retries: Number of retries to allow before raising a MaxRetryError exception. If `False`, then retries are disabled and any exception is raised immediately. :param redirect: If True, automatically handle redirects (status codes 301, 302, 303, 307, 308). Each redirect counts as a retry. Disabling retries will disable redirect, too. :param assert_same_host: If ``True``, will make sure that the host of the pool requests is consistent else will raise HostChangedError. When False, you can use the pool on an HTTP proxy and request foreign hosts. :param timeout: If specified, overrides the default timeout for this one request. It may be a float (in seconds) or an instance of :class:`urllib3.util.Timeout`. :param pool_timeout: If set and the pool is set to block=True, then this method will block for ``pool_timeout`` seconds and raise EmptyPoolError if no connection is available within the time period. :param release_conn: If False, then the urlopen call will not release the connection back into the pool once a response is received (but will release if you read the entire contents of the response such as when `preload_content=True`). This is useful if you're not preloading the response's content immediately. You will need to call ``r.release_conn()`` on the response ``r`` to return the connection back into the pool. If None, it takes the value of ``response_kw.get('preload_content', True)``. :param \**response_kw: Additional parameters are passed to :meth:`urllib3.response.HTTPResponse.from_httplib` """ if headers is None: headers = self.headers if retries < 0 and retries is not False: raise MaxRetryError(self, url) if release_conn is None: release_conn = response_kw.get('preload_content', True) # Check host if assert_same_host and not self.is_same_host(url): raise HostChangedError(self, url, retries - 1) conn = None # Merge the proxy headers. Only do this in HTTP. We have to copy the # headers dict so we can safely change it without those changes being # reflected in anyone else's copy. if self.scheme == 'http': headers = headers.copy() headers.update(self.proxy_headers) # Must keep the exception bound to a separate variable or else Python 3 # complains about UnboundLocalError. err = None try: # Request a connection from the queue conn = self._get_conn(timeout=pool_timeout) # Make the request on the httplib connection object httplib_response = self._make_request(conn, method, url, timeout=timeout, body=body, headers=headers) # If we're going to release the connection in ``finally:``, then # the request doesn't need to know about the connection. Otherwise # it will also try to release it and we'll have a double-release # mess. response_conn = not release_conn and conn # Import httplib's response into our own wrapper object response = HTTPResponse.from_httplib(httplib_response, pool=self, connection=response_conn, **response_kw) # else: # The connection will be put back into the pool when # ``response.release_conn()`` is called (implicitly by # ``response.read()``) except Empty: # Timed out by queue. raise EmptyPoolError(self, "No pool connections are available.") except (BaseSSLError, CertificateError) as e: # Release connection unconditionally because there is no way to # close it externally in case of exception. release_conn = True raise SSLError(e) except (TimeoutError, HTTPException, SocketError) as e: if conn: # Discard the connection for these exceptions. It will be # be replaced during the next _get_conn() call. conn.close() conn = None if not retries: if isinstance(e, TimeoutError): # TimeoutError is exempt from MaxRetryError-wrapping. # FIXME: ... Not sure why. Add a reason here. raise # Wrap unexpected exceptions with the most appropriate # module-level exception and re-raise. if isinstance(e, SocketError) and self.proxy: raise ProxyError('Cannot connect to proxy.', e) if retries is False: raise ConnectionError('Connection failed.', e) raise MaxRetryError(self, url, e) # Keep track of the error for the retry warning. err = e finally: if release_conn: # Put the connection back to be reused. If the connection is # expired then it will be None, which will get replaced with a # fresh connection during _get_conn. self._put_conn(conn) if not conn: # Try again log.warning("Retrying (%d attempts remain) after connection " "broken by '%r': %s" % (retries, err, url)) return self.urlopen(method, url, body, headers, retries - 1, redirect, assert_same_host, timeout=timeout, pool_timeout=pool_timeout, release_conn=release_conn, **response_kw) # Handle redirect? redirect_location = redirect and response.get_redirect_location() if redirect_location and retries is not False: if response.status == 303: method = 'GET' log.info("Redirecting %s -> %s" % (url, redirect_location)) return self.urlopen(method, redirect_location, body, headers, retries - 1, redirect, assert_same_host, timeout=timeout, pool_timeout=pool_timeout, release_conn=release_conn, **response_kw) return response class HTTPSConnectionPool(HTTPConnectionPool): """ Same as :class:`.HTTPConnectionPool`, but HTTPS. When Python is compiled with the :mod:`ssl` module, then :class:`.VerifiedHTTPSConnection` is used, which *can* verify certificates, instead of :class:`.HTTPSConnection`. :class:`.VerifiedHTTPSConnection` uses one of ``assert_fingerprint``, ``assert_hostname`` and ``host`` in this order to verify connections. If ``assert_hostname`` is False, no verification is done. The ``key_file``, ``cert_file``, ``cert_reqs``, ``ca_certs`` and ``ssl_version`` are only used if :mod:`ssl` is available and are fed into :meth:`urllib3.util.ssl_wrap_socket` to upgrade the connection socket into an SSL socket. """ scheme = 'https' ConnectionCls = HTTPSConnection def __init__(self, host, port=None, strict=False, timeout=None, maxsize=1, block=False, headers=None, _proxy=None, _proxy_headers=None, key_file=None, cert_file=None, cert_reqs=None, ca_certs=None, ssl_version=None, assert_hostname=None, assert_fingerprint=None): HTTPConnectionPool.__init__(self, host, port, strict, timeout, maxsize, block, headers, _proxy, _proxy_headers) self.key_file = key_file self.cert_file = cert_file self.cert_reqs = cert_reqs self.ca_certs = ca_certs self.ssl_version = ssl_version self.assert_hostname = assert_hostname self.assert_fingerprint = assert_fingerprint def _prepare_conn(self, conn): """ Prepare the ``connection`` for :meth:`urllib3.util.ssl_wrap_socket` and establish the tunnel if proxy is used. """ if isinstance(conn, VerifiedHTTPSConnection): conn.set_cert(key_file=self.key_file, cert_file=self.cert_file, cert_reqs=self.cert_reqs, ca_certs=self.ca_certs, assert_hostname=self.assert_hostname, assert_fingerprint=self.assert_fingerprint) conn.ssl_version = self.ssl_version if self.proxy is not None: # Python 2.7+ try: set_tunnel = conn.set_tunnel except AttributeError: # Platform-specific: Python 2.6 set_tunnel = conn._set_tunnel set_tunnel(self.host, self.port, self.proxy_headers) # Establish tunnel connection early, because otherwise httplib # would improperly set Host: header to proxy's IP:port. conn.connect() return conn def _new_conn(self): """ Return a fresh :class:`httplib.HTTPSConnection`. """ self.num_connections += 1 log.info("Starting new HTTPS connection (%d): %s" % (self.num_connections, self.host)) if not self.ConnectionCls or self.ConnectionCls is DummyConnection: # Platform-specific: Python without ssl raise SSLError("Can't connect to HTTPS URL because the SSL " "module is not available.") actual_host = self.host actual_port = self.port if self.proxy is not None: actual_host = self.proxy.host actual_port = self.proxy.port extra_params = {} if not six.PY3: # Python 2 extra_params['strict'] = self.strict conn = self.ConnectionCls(host=actual_host, port=actual_port, timeout=self.timeout.connect_timeout, **extra_params) if self.proxy is not None: # Enable Nagle's algorithm for proxies, to avoid packet # fragmentation. conn.tcp_nodelay = 0 return self._prepare_conn(conn) def connection_from_url(url, **kw): """ Given a url, return an :class:`.ConnectionPool` instance of its host. This is a shortcut for not having to parse out the scheme, host, and port of the url before creating an :class:`.ConnectionPool` instance. :param url: Absolute URL string that must include the scheme. Port is optional. :param \**kw: Passes additional parameters to the constructor of the appropriate :class:`.ConnectionPool`. Useful for specifying things like timeout, maxsize, headers, etc. Example: :: >>> conn = connection_from_url('http://google.com/') >>> r = conn.request('GET', '/') """ scheme, host, port = get_host(url) if scheme == 'https': return HTTPSConnectionPool(host, port=port, **kw) else: return HTTPConnectionPool(host, port=port, **kw) armory-0.92.3/urllib3/response.py0000644000000000000000000002415312414772654015421 0ustar rootroot# urllib3/response.py # Copyright 2008-2013 Andrey Petrov and contributors (see CONTRIBUTORS.txt) # # This module is part of urllib3 and is released under # the MIT License: http://www.opensource.org/licenses/mit-license.php import logging import zlib import io from ._collections import HTTPHeaderDict from .exceptions import DecodeError from .packages.six import string_types as basestring, binary_type from .util import is_fp_closed log = logging.getLogger(__name__) class DeflateDecoder(object): def __init__(self): self._first_try = True self._data = binary_type() self._obj = zlib.decompressobj() def __getattr__(self, name): return getattr(self._obj, name) def decompress(self, data): if not self._first_try: return self._obj.decompress(data) self._data += data try: return self._obj.decompress(data) except zlib.error: self._first_try = False self._obj = zlib.decompressobj(-zlib.MAX_WBITS) try: return self.decompress(self._data) finally: self._data = None def _get_decoder(mode): if mode == 'gzip': return zlib.decompressobj(16 + zlib.MAX_WBITS) return DeflateDecoder() class HTTPResponse(io.IOBase): """ HTTP Response container. Backwards-compatible to httplib's HTTPResponse but the response ``body`` is loaded and decoded on-demand when the ``data`` property is accessed. Extra parameters for behaviour not present in httplib.HTTPResponse: :param preload_content: If True, the response's body will be preloaded during construction. :param decode_content: If True, attempts to decode specific content-encoding's based on headers (like 'gzip' and 'deflate') will be skipped and raw data will be used instead. :param original_response: When this HTTPResponse wrapper is generated from an httplib.HTTPResponse object, it's convenient to include the original for debug purposes. It's otherwise unused. """ CONTENT_DECODERS = ['gzip', 'deflate'] REDIRECT_STATUSES = [301, 302, 303, 307, 308] def __init__(self, body='', headers=None, status=0, version=0, reason=None, strict=0, preload_content=True, decode_content=True, original_response=None, pool=None, connection=None): self.headers = HTTPHeaderDict() if headers: self.headers.update(headers) self.status = status self.version = version self.reason = reason self.strict = strict self.decode_content = decode_content self._decoder = None self._body = body if body and isinstance(body, basestring) else None self._fp = None self._original_response = original_response self._fp_bytes_read = 0 self._pool = pool self._connection = connection if hasattr(body, 'read'): self._fp = body if preload_content and not self._body: self._body = self.read(decode_content=decode_content) def get_redirect_location(self): """ Should we redirect and where to? :returns: Truthy redirect location string if we got a redirect status code and valid location. ``None`` if redirect status and no location. ``False`` if not a redirect status code. """ if self.status in self.REDIRECT_STATUSES: return self.headers.get('location') return False def release_conn(self): if not self._pool or not self._connection: return self._pool._put_conn(self._connection) self._connection = None @property def data(self): # For backwords-compat with earlier urllib3 0.4 and earlier. if self._body: return self._body if self._fp: return self.read(cache_content=True) def tell(self): """ Obtain the number of bytes pulled over the wire so far. May differ from the amount of content returned by :meth:``HTTPResponse.read`` if bytes are encoded on the wire (e.g, compressed). """ return self._fp_bytes_read def read(self, amt=None, decode_content=None, cache_content=False): """ Similar to :meth:`httplib.HTTPResponse.read`, but with two additional parameters: ``decode_content`` and ``cache_content``. :param amt: How much of the content to read. If specified, caching is skipped because it doesn't make sense to cache partial content as the full response. :param decode_content: If True, will attempt to decode the body based on the 'content-encoding' header. :param cache_content: If True, will save the returned data such that the same result is returned despite of the state of the underlying file object. This is useful if you want the ``.data`` property to continue working after having ``.read()`` the file object. (Overridden if ``amt`` is set.) """ # Note: content-encoding value should be case-insensitive, per RFC 2616 # Section 3.5 content_encoding = self.headers.get('content-encoding', '').lower() if self._decoder is None: if content_encoding in self.CONTENT_DECODERS: self._decoder = _get_decoder(content_encoding) if decode_content is None: decode_content = self.decode_content if self._fp is None: return flush_decoder = False try: if amt is None: # cStringIO doesn't like amt=None data = self._fp.read() flush_decoder = True else: cache_content = False data = self._fp.read(amt) if amt != 0 and not data: # Platform-specific: Buggy versions of Python. # Close the connection when no data is returned # # This is redundant to what httplib/http.client _should_ # already do. However, versions of python released before # December 15, 2012 (http://bugs.python.org/issue16298) do not # properly close the connection in all cases. There is no harm # in redundantly calling close. self._fp.close() flush_decoder = True self._fp_bytes_read += len(data) try: if decode_content and self._decoder: data = self._decoder.decompress(data) except (IOError, zlib.error) as e: raise DecodeError( "Received response with content-encoding: %s, but " "failed to decode it." % content_encoding, e) if flush_decoder and decode_content and self._decoder: buf = self._decoder.decompress(binary_type()) data += buf + self._decoder.flush() if cache_content: self._body = data return data finally: if self._original_response and self._original_response.isclosed(): self.release_conn() def stream(self, amt=2**16, decode_content=None): """ A generator wrapper for the read() method. A call will block until ``amt`` bytes have been read from the connection or until the connection is closed. :param amt: How much of the content to read. The generator will return up to much data per iteration, but may return less. This is particularly likely when using compressed data. However, the empty string will never be returned. :param decode_content: If True, will attempt to decode the body based on the 'content-encoding' header. """ while not is_fp_closed(self._fp): data = self.read(amt=amt, decode_content=decode_content) if data: yield data @classmethod def from_httplib(ResponseCls, r, **response_kw): """ Given an :class:`httplib.HTTPResponse` instance ``r``, return a corresponding :class:`urllib3.response.HTTPResponse` object. Remaining parameters are passed to the HTTPResponse constructor, along with ``original_response=r``. """ headers = HTTPHeaderDict() for k, v in r.getheaders(): headers.add(k, v) # HTTPResponse objects in Python 3 don't have a .strict attribute strict = getattr(r, 'strict', 0) return ResponseCls(body=r, headers=headers, status=r.status, version=r.version, reason=r.reason, strict=strict, original_response=r, **response_kw) # Backwards-compatibility methods for httplib.HTTPResponse def getheaders(self): return self.headers def getheader(self, name, default=None): return self.headers.get(name, default) # Overrides from io.IOBase def close(self): if not self.closed: self._fp.close() @property def closed(self): if self._fp is None: return True elif hasattr(self._fp, 'closed'): return self._fp.closed elif hasattr(self._fp, 'isclosed'): # Python 2 return self._fp.isclosed() else: return True def fileno(self): if self._fp is None: raise IOError("HTTPResponse has no file to get a fileno from") elif hasattr(self._fp, "fileno"): return self._fp.fileno() else: raise IOError("The file-like object this HTTPResponse is wrapped " "around has no file descriptor") def flush(self): if self._fp is not None and hasattr(self._fp, 'flush'): return self._fp.flush() def readable(self): return True armory-0.92.3/urllib3/packages/0000755000000000000000000000000012414772654014762 5ustar rootrootarmory-0.92.3/urllib3/packages/six.py0000644000000000000000000002655412414772654016153 0ustar rootroot"""Utilities for writing code that runs on Python 2 and 3""" #Copyright (c) 2010-2011 Benjamin Peterson #Permission is hereby granted, free of charge, to any person obtaining a copy of #this software and associated documentation files (the "Software"), to deal in #the Software without restriction, including without limitation the rights to #use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of #the Software, and to permit persons to whom the Software is furnished to do so, #subject to the following conditions: #The above copyright notice and this permission notice shall be included in all #copies or substantial portions of the Software. #THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR #IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS #FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR #COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER #IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN #CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. import operator import sys import types __author__ = "Benjamin Peterson " __version__ = "1.2.0" # Revision 41c74fef2ded # True if we are running on Python 3. PY3 = sys.version_info[0] == 3 if PY3: string_types = str, integer_types = int, class_types = type, text_type = str binary_type = bytes MAXSIZE = sys.maxsize else: string_types = basestring, integer_types = (int, long) class_types = (type, types.ClassType) text_type = unicode binary_type = str if sys.platform.startswith("java"): # Jython always uses 32 bits. MAXSIZE = int((1 << 31) - 1) else: # It's possible to have sizeof(long) != sizeof(Py_ssize_t). class X(object): def __len__(self): return 1 << 31 try: len(X()) except OverflowError: # 32-bit MAXSIZE = int((1 << 31) - 1) else: # 64-bit MAXSIZE = int((1 << 63) - 1) del X def _add_doc(func, doc): """Add documentation to a function.""" func.__doc__ = doc def _import_module(name): """Import module, returning the module after the last dot.""" __import__(name) return sys.modules[name] class _LazyDescr(object): def __init__(self, name): self.name = name def __get__(self, obj, tp): result = self._resolve() setattr(obj, self.name, result) # This is a bit ugly, but it avoids running this again. delattr(tp, self.name) return result class MovedModule(_LazyDescr): def __init__(self, name, old, new=None): super(MovedModule, self).__init__(name) if PY3: if new is None: new = name self.mod = new else: self.mod = old def _resolve(self): return _import_module(self.mod) class MovedAttribute(_LazyDescr): def __init__(self, name, old_mod, new_mod, old_attr=None, new_attr=None): super(MovedAttribute, self).__init__(name) if PY3: if new_mod is None: new_mod = name self.mod = new_mod if new_attr is None: if old_attr is None: new_attr = name else: new_attr = old_attr self.attr = new_attr else: self.mod = old_mod if old_attr is None: old_attr = name self.attr = old_attr def _resolve(self): module = _import_module(self.mod) return getattr(module, self.attr) class _MovedItems(types.ModuleType): """Lazy loading of moved objects""" _moved_attributes = [ MovedAttribute("cStringIO", "cStringIO", "io", "StringIO"), MovedAttribute("filter", "itertools", "builtins", "ifilter", "filter"), MovedAttribute("input", "__builtin__", "builtins", "raw_input", "input"), MovedAttribute("map", "itertools", "builtins", "imap", "map"), MovedAttribute("reload_module", "__builtin__", "imp", "reload"), MovedAttribute("reduce", "__builtin__", "functools"), MovedAttribute("StringIO", "StringIO", "io"), MovedAttribute("xrange", "__builtin__", "builtins", "xrange", "range"), MovedAttribute("zip", "itertools", "builtins", "izip", "zip"), MovedModule("builtins", "__builtin__"), MovedModule("configparser", "ConfigParser"), MovedModule("copyreg", "copy_reg"), MovedModule("http_cookiejar", "cookielib", "http.cookiejar"), MovedModule("http_cookies", "Cookie", "http.cookies"), MovedModule("html_entities", "htmlentitydefs", "html.entities"), MovedModule("html_parser", "HTMLParser", "html.parser"), MovedModule("http_client", "httplib", "http.client"), MovedModule("BaseHTTPServer", "BaseHTTPServer", "http.server"), MovedModule("CGIHTTPServer", "CGIHTTPServer", "http.server"), MovedModule("SimpleHTTPServer", "SimpleHTTPServer", "http.server"), MovedModule("cPickle", "cPickle", "pickle"), MovedModule("queue", "Queue"), MovedModule("reprlib", "repr"), MovedModule("socketserver", "SocketServer"), MovedModule("tkinter", "Tkinter"), MovedModule("tkinter_dialog", "Dialog", "tkinter.dialog"), MovedModule("tkinter_filedialog", "FileDialog", "tkinter.filedialog"), MovedModule("tkinter_scrolledtext", "ScrolledText", "tkinter.scrolledtext"), MovedModule("tkinter_simpledialog", "SimpleDialog", "tkinter.simpledialog"), MovedModule("tkinter_tix", "Tix", "tkinter.tix"), MovedModule("tkinter_constants", "Tkconstants", "tkinter.constants"), MovedModule("tkinter_dnd", "Tkdnd", "tkinter.dnd"), MovedModule("tkinter_colorchooser", "tkColorChooser", "tkinter.colorchooser"), MovedModule("tkinter_commondialog", "tkCommonDialog", "tkinter.commondialog"), MovedModule("tkinter_tkfiledialog", "tkFileDialog", "tkinter.filedialog"), MovedModule("tkinter_font", "tkFont", "tkinter.font"), MovedModule("tkinter_messagebox", "tkMessageBox", "tkinter.messagebox"), MovedModule("tkinter_tksimpledialog", "tkSimpleDialog", "tkinter.simpledialog"), MovedModule("urllib_robotparser", "robotparser", "urllib.robotparser"), MovedModule("winreg", "_winreg"), ] for attr in _moved_attributes: setattr(_MovedItems, attr.name, attr) del attr moves = sys.modules[__name__ + ".moves"] = _MovedItems("moves") def add_move(move): """Add an item to six.moves.""" setattr(_MovedItems, move.name, move) def remove_move(name): """Remove item from six.moves.""" try: delattr(_MovedItems, name) except AttributeError: try: del moves.__dict__[name] except KeyError: raise AttributeError("no such move, %r" % (name,)) if PY3: _meth_func = "__func__" _meth_self = "__self__" _func_code = "__code__" _func_defaults = "__defaults__" _iterkeys = "keys" _itervalues = "values" _iteritems = "items" else: _meth_func = "im_func" _meth_self = "im_self" _func_code = "func_code" _func_defaults = "func_defaults" _iterkeys = "iterkeys" _itervalues = "itervalues" _iteritems = "iteritems" try: advance_iterator = next except NameError: def advance_iterator(it): return it.next() next = advance_iterator if PY3: def get_unbound_function(unbound): return unbound Iterator = object def callable(obj): return any("__call__" in klass.__dict__ for klass in type(obj).__mro__) else: def get_unbound_function(unbound): return unbound.im_func class Iterator(object): def next(self): return type(self).__next__(self) callable = callable _add_doc(get_unbound_function, """Get the function out of a possibly unbound function""") get_method_function = operator.attrgetter(_meth_func) get_method_self = operator.attrgetter(_meth_self) get_function_code = operator.attrgetter(_func_code) get_function_defaults = operator.attrgetter(_func_defaults) def iterkeys(d): """Return an iterator over the keys of a dictionary.""" return iter(getattr(d, _iterkeys)()) def itervalues(d): """Return an iterator over the values of a dictionary.""" return iter(getattr(d, _itervalues)()) def iteritems(d): """Return an iterator over the (key, value) pairs of a dictionary.""" return iter(getattr(d, _iteritems)()) if PY3: def b(s): return s.encode("latin-1") def u(s): return s if sys.version_info[1] <= 1: def int2byte(i): return bytes((i,)) else: # This is about 2x faster than the implementation above on 3.2+ int2byte = operator.methodcaller("to_bytes", 1, "big") import io StringIO = io.StringIO BytesIO = io.BytesIO else: def b(s): return s def u(s): return unicode(s, "unicode_escape") int2byte = chr import StringIO StringIO = BytesIO = StringIO.StringIO _add_doc(b, """Byte literal""") _add_doc(u, """Text literal""") if PY3: import builtins exec_ = getattr(builtins, "exec") def reraise(tp, value, tb=None): if value.__traceback__ is not tb: raise value.with_traceback(tb) raise value print_ = getattr(builtins, "print") del builtins else: def exec_(code, globs=None, locs=None): """Execute code in a namespace.""" if globs is None: frame = sys._getframe(1) globs = frame.f_globals if locs is None: locs = frame.f_locals del frame elif locs is None: locs = globs exec("""exec code in globs, locs""") exec_("""def reraise(tp, value, tb=None): raise tp, value, tb """) def print_(*args, **kwargs): """The new-style print function.""" fp = kwargs.pop("file", sys.stdout) if fp is None: return def write(data): if not isinstance(data, basestring): data = str(data) fp.write(data) want_unicode = False sep = kwargs.pop("sep", None) if sep is not None: if isinstance(sep, unicode): want_unicode = True elif not isinstance(sep, str): raise TypeError("sep must be None or a string") end = kwargs.pop("end", None) if end is not None: if isinstance(end, unicode): want_unicode = True elif not isinstance(end, str): raise TypeError("end must be None or a string") if kwargs: raise TypeError("invalid keyword arguments to print()") if not want_unicode: for arg in args: if isinstance(arg, unicode): want_unicode = True break if want_unicode: newline = unicode("\n") space = unicode(" ") else: newline = "\n" space = " " if sep is None: sep = space if end is None: end = newline for i, arg in enumerate(args): if i: write(sep) write(arg) write(end) _add_doc(reraise, """Reraise an exception.""") def with_metaclass(meta, base=object): """Create a base class with a metaclass.""" return meta("NewBase", (base,), {}) armory-0.92.3/urllib3/packages/ordered_dict.py0000644000000000000000000002135012414772654017764 0ustar rootroot# Backport of OrderedDict() class that runs on Python 2.4, 2.5, 2.6, 2.7 and pypy. # Passes Python2.7's test suite and incorporates all the latest updates. # Copyright 2009 Raymond Hettinger, released under the MIT License. # http://code.activestate.com/recipes/576693/ try: from thread import get_ident as _get_ident except ImportError: from dummy_thread import get_ident as _get_ident try: from _abcoll import KeysView, ValuesView, ItemsView except ImportError: pass class OrderedDict(dict): 'Dictionary that remembers insertion order' # An inherited dict maps keys to values. # The inherited dict provides __getitem__, __len__, __contains__, and get. # The remaining methods are order-aware. # Big-O running times for all methods are the same as for regular dictionaries. # The internal self.__map dictionary maps keys to links in a doubly linked list. # The circular doubly linked list starts and ends with a sentinel element. # The sentinel element never gets deleted (this simplifies the algorithm). # Each link is stored as a list of length three: [PREV, NEXT, KEY]. def __init__(self, *args, **kwds): '''Initialize an ordered dictionary. Signature is the same as for regular dictionaries, but keyword arguments are not recommended because their insertion order is arbitrary. ''' if len(args) > 1: raise TypeError('expected at most 1 arguments, got %d' % len(args)) try: self.__root except AttributeError: self.__root = root = [] # sentinel node root[:] = [root, root, None] self.__map = {} self.__update(*args, **kwds) def __setitem__(self, key, value, dict_setitem=dict.__setitem__): 'od.__setitem__(i, y) <==> od[i]=y' # Setting a new item creates a new link which goes at the end of the linked # list, and the inherited dictionary is updated with the new key/value pair. if key not in self: root = self.__root last = root[0] last[1] = root[0] = self.__map[key] = [last, root, key] dict_setitem(self, key, value) def __delitem__(self, key, dict_delitem=dict.__delitem__): 'od.__delitem__(y) <==> del od[y]' # Deleting an existing item uses self.__map to find the link which is # then removed by updating the links in the predecessor and successor nodes. dict_delitem(self, key) link_prev, link_next, key = self.__map.pop(key) link_prev[1] = link_next link_next[0] = link_prev def __iter__(self): 'od.__iter__() <==> iter(od)' root = self.__root curr = root[1] while curr is not root: yield curr[2] curr = curr[1] def __reversed__(self): 'od.__reversed__() <==> reversed(od)' root = self.__root curr = root[0] while curr is not root: yield curr[2] curr = curr[0] def clear(self): 'od.clear() -> None. Remove all items from od.' try: for node in self.__map.itervalues(): del node[:] root = self.__root root[:] = [root, root, None] self.__map.clear() except AttributeError: pass dict.clear(self) def popitem(self, last=True): '''od.popitem() -> (k, v), return and remove a (key, value) pair. Pairs are returned in LIFO order if last is true or FIFO order if false. ''' if not self: raise KeyError('dictionary is empty') root = self.__root if last: link = root[0] link_prev = link[0] link_prev[1] = root root[0] = link_prev else: link = root[1] link_next = link[1] root[1] = link_next link_next[0] = root key = link[2] del self.__map[key] value = dict.pop(self, key) return key, value # -- the following methods do not depend on the internal structure -- def keys(self): 'od.keys() -> list of keys in od' return list(self) def values(self): 'od.values() -> list of values in od' return [self[key] for key in self] def items(self): 'od.items() -> list of (key, value) pairs in od' return [(key, self[key]) for key in self] def iterkeys(self): 'od.iterkeys() -> an iterator over the keys in od' return iter(self) def itervalues(self): 'od.itervalues -> an iterator over the values in od' for k in self: yield self[k] def iteritems(self): 'od.iteritems -> an iterator over the (key, value) items in od' for k in self: yield (k, self[k]) def update(*args, **kwds): '''od.update(E, **F) -> None. Update od from dict/iterable E and F. If E is a dict instance, does: for k in E: od[k] = E[k] If E has a .keys() method, does: for k in E.keys(): od[k] = E[k] Or if E is an iterable of items, does: for k, v in E: od[k] = v In either case, this is followed by: for k, v in F.items(): od[k] = v ''' if len(args) > 2: raise TypeError('update() takes at most 2 positional ' 'arguments (%d given)' % (len(args),)) elif not args: raise TypeError('update() takes at least 1 argument (0 given)') self = args[0] # Make progressively weaker assumptions about "other" other = () if len(args) == 2: other = args[1] if isinstance(other, dict): for key in other: self[key] = other[key] elif hasattr(other, 'keys'): for key in other.keys(): self[key] = other[key] else: for key, value in other: self[key] = value for key, value in kwds.items(): self[key] = value __update = update # let subclasses override update without breaking __init__ __marker = object() def pop(self, key, default=__marker): '''od.pop(k[,d]) -> v, remove specified key and return the corresponding value. If key is not found, d is returned if given, otherwise KeyError is raised. ''' if key in self: result = self[key] del self[key] return result if default is self.__marker: raise KeyError(key) return default def setdefault(self, key, default=None): 'od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od' if key in self: return self[key] self[key] = default return default def __repr__(self, _repr_running={}): 'od.__repr__() <==> repr(od)' call_key = id(self), _get_ident() if call_key in _repr_running: return '...' _repr_running[call_key] = 1 try: if not self: return '%s()' % (self.__class__.__name__,) return '%s(%r)' % (self.__class__.__name__, self.items()) finally: del _repr_running[call_key] def __reduce__(self): 'Return state information for pickling' items = [[k, self[k]] for k in self] inst_dict = vars(self).copy() for k in vars(OrderedDict()): inst_dict.pop(k, None) if inst_dict: return (self.__class__, (items,), inst_dict) return self.__class__, (items,) def copy(self): 'od.copy() -> a shallow copy of od' return self.__class__(self) @classmethod def fromkeys(cls, iterable, value=None): '''OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S and values equal to v (which defaults to None). ''' d = cls() for key in iterable: d[key] = value return d def __eq__(self, other): '''od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive while comparison to a regular mapping is order-insensitive. ''' if isinstance(other, OrderedDict): return len(self)==len(other) and self.items() == other.items() return dict.__eq__(self, other) def __ne__(self, other): return not self == other # -- the following methods are only used in Python 2.7 -- def viewkeys(self): "od.viewkeys() -> a set-like object providing a view on od's keys" return KeysView(self) def viewvalues(self): "od.viewvalues() -> an object providing a view on od's values" return ValuesView(self) def viewitems(self): "od.viewitems() -> a set-like object providing a view on od's items" return ItemsView(self) armory-0.92.3/urllib3/packages/ssl_match_hostname/0000755000000000000000000000000012414772654020635 5ustar rootrootarmory-0.92.3/urllib3/packages/ssl_match_hostname/_implementation.py0000644000000000000000000000730212414772654024375 0ustar rootroot"""The match_hostname() function from Python 3.3.3, essential when using SSL.""" # Note: This file is under the PSF license as the code comes from the python # stdlib. http://docs.python.org/3/license.html import re __version__ = '3.4.0.2' class CertificateError(ValueError): pass def _dnsname_match(dn, hostname, max_wildcards=1): """Matching according to RFC 6125, section 6.4.3 http://tools.ietf.org/html/rfc6125#section-6.4.3 """ pats = [] if not dn: return False # Ported from python3-syntax: # leftmost, *remainder = dn.split(r'.') parts = dn.split(r'.') leftmost = parts[0] remainder = parts[1:] wildcards = leftmost.count('*') if wildcards > max_wildcards: # Issue #17980: avoid denials of service by refusing more # than one wildcard per fragment. A survey of established # policy among SSL implementations showed it to be a # reasonable choice. raise CertificateError( "too many wildcards in certificate DNS name: " + repr(dn)) # speed up common case w/o wildcards if not wildcards: return dn.lower() == hostname.lower() # RFC 6125, section 6.4.3, subitem 1. # The client SHOULD NOT attempt to match a presented identifier in which # the wildcard character comprises a label other than the left-most label. if leftmost == '*': # When '*' is a fragment by itself, it matches a non-empty dotless # fragment. pats.append('[^.]+') elif leftmost.startswith('xn--') or hostname.startswith('xn--'): # RFC 6125, section 6.4.3, subitem 3. # The client SHOULD NOT attempt to match a presented identifier # where the wildcard character is embedded within an A-label or # U-label of an internationalized domain name. pats.append(re.escape(leftmost)) else: # Otherwise, '*' matches any dotless string, e.g. www* pats.append(re.escape(leftmost).replace(r'\*', '[^.]*')) # add the remaining fragments, ignore any wildcards for frag in remainder: pats.append(re.escape(frag)) pat = re.compile(r'\A' + r'\.'.join(pats) + r'\Z', re.IGNORECASE) return pat.match(hostname) def match_hostname(cert, hostname): """Verify that *cert* (in decoded format as returned by SSLSocket.getpeercert()) matches the *hostname*. RFC 2818 and RFC 6125 rules are followed, but IP addresses are not accepted for *hostname*. CertificateError is raised on failure. On success, the function returns nothing. """ if not cert: raise ValueError("empty or no certificate") dnsnames = [] san = cert.get('subjectAltName', ()) for key, value in san: if key == 'DNS': if _dnsname_match(value, hostname): return dnsnames.append(value) if not dnsnames: # The subject is only checked when there is no dNSName entry # in subjectAltName for sub in cert.get('subject', ()): for key, value in sub: # XXX according to RFC 2818, the most specific Common Name # must be used. if key == 'commonName': if _dnsname_match(value, hostname): return dnsnames.append(value) if len(dnsnames) > 1: raise CertificateError("hostname %r " "doesn't match either of %s" % (hostname, ', '.join(map(repr, dnsnames)))) elif len(dnsnames) == 1: raise CertificateError("hostname %r " "doesn't match %r" % (hostname, dnsnames[0])) else: raise CertificateError("no appropriate commonName or " "subjectAltName fields were found") armory-0.92.3/urllib3/packages/ssl_match_hostname/__init__.py0000644000000000000000000000071412414772654022750 0ustar rootroottry: # Python 3.2+ from ssl import CertificateError, match_hostname except ImportError: try: # Backport of the function from a pypi module from backports.ssl_match_hostname import CertificateError, match_hostname except ImportError: # Our vendored copy from ._implementation import CertificateError, match_hostname # Not needed, but documenting what we provide. __all__ = ('CertificateError', 'match_hostname') armory-0.92.3/urllib3/packages/__init__.py0000644000000000000000000000011212414772654017065 0ustar rootrootfrom __future__ import absolute_import from . import ssl_match_hostname armory-0.92.3/urllib3/util.py0000644000000000000000000005163712414772654014547 0ustar rootroot# urllib3/util.py # Copyright 2008-2013 Andrey Petrov and contributors (see CONTRIBUTORS.txt) # # This module is part of urllib3 and is released under # the MIT License: http://www.opensource.org/licenses/mit-license.php from base64 import b64encode from binascii import hexlify, unhexlify from collections import namedtuple from hashlib import md5, sha1 from socket import error as SocketError, _GLOBAL_DEFAULT_TIMEOUT import time try: from select import poll, POLLIN except ImportError: # `poll` doesn't exist on OSX and other platforms poll = False try: from select import select except ImportError: # `select` doesn't exist on AppEngine. select = False try: # Test for SSL features SSLContext = None HAS_SNI = False import ssl from ssl import wrap_socket, CERT_NONE, PROTOCOL_SSLv23 from ssl import SSLContext # Modern SSL? from ssl import HAS_SNI # Has SNI? except ImportError: pass from .packages import six from .exceptions import LocationParseError, SSLError, TimeoutStateError _Default = object() # The default timeout to use for socket connections. This is the attribute used # by httplib to define the default timeout def current_time(): """ Retrieve the current time, this function is mocked out in unit testing. """ return time.time() class Timeout(object): """ Utility object for storing timeout values. Example usage: .. code-block:: python timeout = urllib3.util.Timeout(connect=2.0, read=7.0) pool = HTTPConnectionPool('www.google.com', 80, timeout=timeout) pool.request(...) # Etc, etc :param connect: The maximum amount of time to wait for a connection attempt to a server to succeed. Omitting the parameter will default the connect timeout to the system default, probably `the global default timeout in socket.py `_. None will set an infinite timeout for connection attempts. :type connect: integer, float, or None :param read: The maximum amount of time to wait between consecutive read operations for a response from the server. Omitting the parameter will default the read timeout to the system default, probably `the global default timeout in socket.py `_. None will set an infinite timeout. :type read: integer, float, or None :param total: This combines the connect and read timeouts into one; the read timeout will be set to the time leftover from the connect attempt. In the event that both a connect timeout and a total are specified, or a read timeout and a total are specified, the shorter timeout will be applied. Defaults to None. :type total: integer, float, or None .. note:: Many factors can affect the total amount of time for urllib3 to return an HTTP response. Specifically, Python's DNS resolver does not obey the timeout specified on the socket. Other factors that can affect total request time include high CPU load, high swap, the program running at a low priority level, or other behaviors. The observed running time for urllib3 to return a response may be greater than the value passed to `total`. In addition, the read and total timeouts only measure the time between read operations on the socket connecting the client and the server, not the total amount of time for the request to return a complete response. For most requests, the timeout is raised because the server has not sent the first byte in the specified time. This is not always the case; if a server streams one byte every fifteen seconds, a timeout of 20 seconds will not ever trigger, even though the request will take several minutes to complete. If your goal is to cut off any request after a set amount of wall clock time, consider having a second "watcher" thread to cut off a slow request. """ #: A sentinel object representing the default timeout value DEFAULT_TIMEOUT = _GLOBAL_DEFAULT_TIMEOUT def __init__(self, total=None, connect=_Default, read=_Default): self._connect = self._validate_timeout(connect, 'connect') self._read = self._validate_timeout(read, 'read') self.total = self._validate_timeout(total, 'total') self._start_connect = None def __str__(self): return '%s(connect=%r, read=%r, total=%r)' % ( type(self).__name__, self._connect, self._read, self.total) @classmethod def _validate_timeout(cls, value, name): """ Check that a timeout attribute is valid :param value: The timeout value to validate :param name: The name of the timeout attribute to validate. This is used for clear error messages :return: the value :raises ValueError: if the type is not an integer or a float, or if it is a numeric value less than zero """ if value is _Default: return cls.DEFAULT_TIMEOUT if value is None or value is cls.DEFAULT_TIMEOUT: return value try: float(value) except (TypeError, ValueError): raise ValueError("Timeout value %s was %s, but it must be an " "int or float." % (name, value)) try: if value < 0: raise ValueError("Attempted to set %s timeout to %s, but the " "timeout cannot be set to a value less " "than 0." % (name, value)) except TypeError: # Python 3 raise ValueError("Timeout value %s was %s, but it must be an " "int or float." % (name, value)) return value @classmethod def from_float(cls, timeout): """ Create a new Timeout from a legacy timeout value. The timeout value used by httplib.py sets the same timeout on the connect(), and recv() socket requests. This creates a :class:`Timeout` object that sets the individual timeouts to the ``timeout`` value passed to this function. :param timeout: The legacy timeout value :type timeout: integer, float, sentinel default object, or None :return: a Timeout object :rtype: :class:`Timeout` """ return Timeout(read=timeout, connect=timeout) def clone(self): """ Create a copy of the timeout object Timeout properties are stored per-pool but each request needs a fresh Timeout object to ensure each one has its own start/stop configured. :return: a copy of the timeout object :rtype: :class:`Timeout` """ # We can't use copy.deepcopy because that will also create a new object # for _GLOBAL_DEFAULT_TIMEOUT, which socket.py uses as a sentinel to # detect the user default. return Timeout(connect=self._connect, read=self._read, total=self.total) def start_connect(self): """ Start the timeout clock, used during a connect() attempt :raises urllib3.exceptions.TimeoutStateError: if you attempt to start a timer that has been started already. """ if self._start_connect is not None: raise TimeoutStateError("Timeout timer has already been started.") self._start_connect = current_time() return self._start_connect def get_connect_duration(self): """ Gets the time elapsed since the call to :meth:`start_connect`. :return: the elapsed time :rtype: float :raises urllib3.exceptions.TimeoutStateError: if you attempt to get duration for a timer that hasn't been started. """ if self._start_connect is None: raise TimeoutStateError("Can't get connect duration for timer " "that has not started.") return current_time() - self._start_connect @property def connect_timeout(self): """ Get the value to use when setting a connection timeout. This will be a positive float or integer, the value None (never timeout), or the default system timeout. :return: the connect timeout :rtype: int, float, :attr:`Timeout.DEFAULT_TIMEOUT` or None """ if self.total is None: return self._connect if self._connect is None or self._connect is self.DEFAULT_TIMEOUT: return self.total return min(self._connect, self.total) @property def read_timeout(self): """ Get the value for the read timeout. This assumes some time has elapsed in the connection timeout and computes the read timeout appropriately. If self.total is set, the read timeout is dependent on the amount of time taken by the connect timeout. If the connection time has not been established, a :exc:`~urllib3.exceptions.TimeoutStateError` will be raised. :return: the value to use for the read timeout :rtype: int, float, :attr:`Timeout.DEFAULT_TIMEOUT` or None :raises urllib3.exceptions.TimeoutStateError: If :meth:`start_connect` has not yet been called on this object. """ if (self.total is not None and self.total is not self.DEFAULT_TIMEOUT and self._read is not None and self._read is not self.DEFAULT_TIMEOUT): # in case the connect timeout has not yet been established. if self._start_connect is None: return self._read return max(0, min(self.total - self.get_connect_duration(), self._read)) elif self.total is not None and self.total is not self.DEFAULT_TIMEOUT: return max(0, self.total - self.get_connect_duration()) else: return self._read class Url(namedtuple('Url', ['scheme', 'auth', 'host', 'port', 'path', 'query', 'fragment'])): """ Datastructure for representing an HTTP URL. Used as a return value for :func:`parse_url`. """ slots = () def __new__(cls, scheme=None, auth=None, host=None, port=None, path=None, query=None, fragment=None): return super(Url, cls).__new__(cls, scheme, auth, host, port, path, query, fragment) @property def hostname(self): """For backwards-compatibility with urlparse. We're nice like that.""" return self.host @property def request_uri(self): """Absolute path including the query string.""" uri = self.path or '/' if self.query is not None: uri += '?' + self.query return uri @property def netloc(self): """Network location including host and port""" if self.port: return '%s:%d' % (self.host, self.port) return self.host def split_first(s, delims): """ Given a string and an iterable of delimiters, split on the first found delimiter. Return two split parts and the matched delimiter. If not found, then the first part is the full input string. Example: :: >>> split_first('foo/bar?baz', '?/=') ('foo', 'bar?baz', '/') >>> split_first('foo/bar?baz', '123') ('foo/bar?baz', '', None) Scales linearly with number of delims. Not ideal for large number of delims. """ min_idx = None min_delim = None for d in delims: idx = s.find(d) if idx < 0: continue if min_idx is None or idx < min_idx: min_idx = idx min_delim = d if min_idx is None or min_idx < 0: return s, '', None return s[:min_idx], s[min_idx+1:], min_delim def parse_url(url): """ Given a url, return a parsed :class:`.Url` namedtuple. Best-effort is performed to parse incomplete urls. Fields not provided will be None. Partly backwards-compatible with :mod:`urlparse`. Example: :: >>> parse_url('http://google.com/mail/') Url(scheme='http', host='google.com', port=None, path='/', ...) >>> parse_url('google.com:80') Url(scheme=None, host='google.com', port=80, path=None, ...) >>> parse_url('/foo?bar') Url(scheme=None, host=None, port=None, path='/foo', query='bar', ...) """ # While this code has overlap with stdlib's urlparse, it is much # simplified for our needs and less annoying. # Additionally, this implementations does silly things to be optimal # on CPython. scheme = None auth = None host = None port = None path = None fragment = None query = None # Scheme if '://' in url: scheme, url = url.split('://', 1) # Find the earliest Authority Terminator # (http://tools.ietf.org/html/rfc3986#section-3.2) url, path_, delim = split_first(url, ['/', '?', '#']) if delim: # Reassemble the path path = delim + path_ # Auth if '@' in url: # Last '@' denotes end of auth part auth, url = url.rsplit('@', 1) # IPv6 if url and url[0] == '[': host, url = url.split(']', 1) host += ']' # Port if ':' in url: _host, port = url.split(':', 1) if not host: host = _host if port: # If given, ports must be integers. if not port.isdigit(): raise LocationParseError("Failed to parse: %s" % url) port = int(port) else: # Blank ports are cool, too. (rfc3986#section-3.2.3) port = None elif not host and url: host = url if not path: return Url(scheme, auth, host, port, path, query, fragment) # Fragment if '#' in path: path, fragment = path.split('#', 1) # Query if '?' in path: path, query = path.split('?', 1) return Url(scheme, auth, host, port, path, query, fragment) def get_host(url): """ Deprecated. Use :func:`.parse_url` instead. """ p = parse_url(url) return p.scheme or 'http', p.hostname, p.port def make_headers(keep_alive=None, accept_encoding=None, user_agent=None, basic_auth=None, proxy_basic_auth=None): """ Shortcuts for generating request headers. :param keep_alive: If ``True``, adds 'connection: keep-alive' header. :param accept_encoding: Can be a boolean, list, or string. ``True`` translates to 'gzip,deflate'. List will get joined by comma. String will be used as provided. :param user_agent: String representing the user-agent you want, such as "python-urllib3/0.6" :param basic_auth: Colon-separated username:password string for 'authorization: basic ...' auth header. :param proxy_basic_auth: Colon-separated username:password string for 'proxy-authorization: basic ...' auth header. Example: :: >>> make_headers(keep_alive=True, user_agent="Batman/1.0") {'connection': 'keep-alive', 'user-agent': 'Batman/1.0'} >>> make_headers(accept_encoding=True) {'accept-encoding': 'gzip,deflate'} """ headers = {} if accept_encoding: if isinstance(accept_encoding, str): pass elif isinstance(accept_encoding, list): accept_encoding = ','.join(accept_encoding) else: accept_encoding = 'gzip,deflate' headers['accept-encoding'] = accept_encoding if user_agent: headers['user-agent'] = user_agent if keep_alive: headers['connection'] = 'keep-alive' if basic_auth: headers['authorization'] = 'Basic ' + \ b64encode(six.b(basic_auth)).decode('utf-8') if proxy_basic_auth: headers['proxy-authorization'] = 'Basic ' + \ b64encode(six.b(proxy_basic_auth)).decode('utf-8') return headers def is_connection_dropped(conn): # Platform-specific """ Returns True if the connection is dropped and should be closed. :param conn: :class:`httplib.HTTPConnection` object. Note: For platforms like AppEngine, this will always return ``False`` to let the platform handle connection recycling transparently for us. """ sock = getattr(conn, 'sock', False) if not sock: # Platform-specific: AppEngine return False if not poll: if not select: # Platform-specific: AppEngine return False try: return select([sock], [], [], 0.0)[0] except SocketError: return True # This version is better on platforms that support it. p = poll() p.register(sock, POLLIN) for (fno, ev) in p.poll(0.0): if fno == sock.fileno(): # Either data is buffered (bad), or the connection is dropped. return True def resolve_cert_reqs(candidate): """ Resolves the argument to a numeric constant, which can be passed to the wrap_socket function/method from the ssl module. Defaults to :data:`ssl.CERT_NONE`. If given a string it is assumed to be the name of the constant in the :mod:`ssl` module or its abbrevation. (So you can specify `REQUIRED` instead of `CERT_REQUIRED`. If it's neither `None` nor a string we assume it is already the numeric constant which can directly be passed to wrap_socket. """ if candidate is None: return CERT_NONE if isinstance(candidate, str): res = getattr(ssl, candidate, None) if res is None: res = getattr(ssl, 'CERT_' + candidate) return res return candidate def resolve_ssl_version(candidate): """ like resolve_cert_reqs """ if candidate is None: return PROTOCOL_SSLv23 if isinstance(candidate, str): res = getattr(ssl, candidate, None) if res is None: res = getattr(ssl, 'PROTOCOL_' + candidate) return res return candidate def assert_fingerprint(cert, fingerprint): """ Checks if given fingerprint matches the supplied certificate. :param cert: Certificate as bytes object. :param fingerprint: Fingerprint as string of hexdigits, can be interspersed by colons. """ # Maps the length of a digest to a possible hash function producing # this digest. hashfunc_map = { 16: md5, 20: sha1 } fingerprint = fingerprint.replace(':', '').lower() digest_length, rest = divmod(len(fingerprint), 2) if rest or digest_length not in hashfunc_map: raise SSLError('Fingerprint is of invalid length.') # We need encode() here for py32; works on py2 and p33. fingerprint_bytes = unhexlify(fingerprint.encode()) hashfunc = hashfunc_map[digest_length] cert_digest = hashfunc(cert).digest() if not cert_digest == fingerprint_bytes: raise SSLError('Fingerprints did not match. Expected "{0}", got "{1}".' .format(hexlify(fingerprint_bytes), hexlify(cert_digest))) def is_fp_closed(obj): """ Checks whether a given file-like object is closed. :param obj: The file-like object to check. """ if hasattr(obj, 'fp'): # Object is a container for another file-like object that gets released # on exhaustion (e.g. HTTPResponse) return obj.fp is None return obj.closed if SSLContext is not None: # Python 3.2+ def ssl_wrap_socket(sock, keyfile=None, certfile=None, cert_reqs=None, ca_certs=None, server_hostname=None, ssl_version=None): """ All arguments except `server_hostname` have the same meaning as for :func:`ssl.wrap_socket` :param server_hostname: Hostname of the expected certificate """ context = SSLContext(ssl_version) context.verify_mode = cert_reqs # Disable TLS compression to migitate CRIME attack (issue #309) OP_NO_COMPRESSION = 0x20000 context.options |= OP_NO_COMPRESSION if ca_certs: try: context.load_verify_locations(ca_certs) # Py32 raises IOError # Py33 raises FileNotFoundError except Exception as e: # Reraise as SSLError raise SSLError(e) if certfile: # FIXME: This block needs a test. context.load_cert_chain(certfile, keyfile) if HAS_SNI: # Platform-specific: OpenSSL with enabled SNI return context.wrap_socket(sock, server_hostname=server_hostname) return context.wrap_socket(sock) else: # Python 3.1 and earlier def ssl_wrap_socket(sock, keyfile=None, certfile=None, cert_reqs=None, ca_certs=None, server_hostname=None, ssl_version=None): return wrap_socket(sock, keyfile=keyfile, certfile=certfile, ca_certs=ca_certs, cert_reqs=cert_reqs, ssl_version=ssl_version) armory-0.92.3/urllib3/__init__.py0000644000000000000000000000324512414772654015321 0ustar rootroot# urllib3/__init__.py # Copyright 2008-2013 Andrey Petrov and contributors (see CONTRIBUTORS.txt) # # This module is part of urllib3 and is released under # the MIT License: http://www.opensource.org/licenses/mit-license.php """ urllib3 - Thread-safe connection pooling and re-using. """ __author__ = 'Andrey Petrov (andrey.petrov@shazow.net)' __license__ = 'MIT' __version__ = '1.8' from .connectionpool import ( HTTPConnectionPool, HTTPSConnectionPool, connection_from_url ) from . import exceptions from .filepost import encode_multipart_formdata from .poolmanager import PoolManager, ProxyManager, proxy_from_url from .response import HTTPResponse from .util import make_headers, get_host, Timeout # Set default logging handler to avoid "No handler found" warnings. import logging try: # Python 2.7+ from logging import NullHandler except ImportError: class NullHandler(logging.Handler): def emit(self, record): pass logging.getLogger(__name__).addHandler(NullHandler()) def add_stderr_logger(level=logging.DEBUG): """ Helper for quickly adding a StreamHandler to the logger. Useful for debugging. Returns the handler after adding it. """ # This method needs to be in this __init__.py to get the __name__ correct # even if urllib3 is vendored within another package. logger = logging.getLogger(__name__) handler = logging.StreamHandler() handler.setFormatter(logging.Formatter('%(asctime)s %(levelname)s %(message)s')) logger.addHandler(handler) logger.setLevel(level) logger.debug('Added an stderr logging handler to logger: %s' % __name__) return handler # ... Clean up. del NullHandler armory-0.92.3/urllib3/exceptions.py0000644000000000000000000000644412414772654015747 0ustar rootroot# urllib3/exceptions.py # Copyright 2008-2013 Andrey Petrov and contributors (see CONTRIBUTORS.txt) # # This module is part of urllib3 and is released under # the MIT License: http://www.opensource.org/licenses/mit-license.php ## Base Exceptions class HTTPError(Exception): "Base exception used by this module." pass class PoolError(HTTPError): "Base exception for errors caused within a pool." def __init__(self, pool, message): self.pool = pool HTTPError.__init__(self, "%s: %s" % (pool, message)) def __reduce__(self): # For pickling purposes. return self.__class__, (None, None) class RequestError(PoolError): "Base exception for PoolErrors that have associated URLs." def __init__(self, pool, url, message): self.url = url PoolError.__init__(self, pool, message) def __reduce__(self): # For pickling purposes. return self.__class__, (None, self.url, None) class SSLError(HTTPError): "Raised when SSL certificate fails in an HTTPS connection." pass class ProxyError(HTTPError): "Raised when the connection to a proxy fails." pass class ConnectionError(HTTPError): "Raised when a normal connection fails." pass class DecodeError(HTTPError): "Raised when automatic decoding based on Content-Type fails." pass ## Leaf Exceptions class MaxRetryError(RequestError): "Raised when the maximum number of retries is exceeded." def __init__(self, pool, url, reason=None): self.reason = reason message = "Max retries exceeded with url: %s" % url if reason: message += " (Caused by %s: %s)" % (type(reason), reason) else: message += " (Caused by redirect)" RequestError.__init__(self, pool, url, message) class HostChangedError(RequestError): "Raised when an existing pool gets a request for a foreign host." def __init__(self, pool, url, retries=3): message = "Tried to open a foreign host with url: %s" % url RequestError.__init__(self, pool, url, message) self.retries = retries class TimeoutStateError(HTTPError): """ Raised when passing an invalid state to a timeout """ pass class TimeoutError(HTTPError): """ Raised when a socket timeout error occurs. Catching this error will catch both :exc:`ReadTimeoutErrors ` and :exc:`ConnectTimeoutErrors `. """ pass class ReadTimeoutError(TimeoutError, RequestError): "Raised when a socket timeout occurs while receiving data from a server" pass # This timeout error does not have a URL attached and needs to inherit from the # base HTTPError class ConnectTimeoutError(TimeoutError): "Raised when a socket timeout occurs while connecting to a server" pass class EmptyPoolError(PoolError): "Raised when a pool runs out of connections and no more are allowed." pass class ClosedPoolError(PoolError): "Raised when a request enters a pool after the pool has been closed." pass class LocationParseError(ValueError, HTTPError): "Raised when get_host or similar fails to parse the URL input." def __init__(self, location): message = "Failed to parse: %s" % location HTTPError.__init__(self, message) self.location = location armory-0.92.3/urllib3/fields.py0000644000000000000000000001353012414772654015026 0ustar rootroot# urllib3/fields.py # Copyright 2008-2013 Andrey Petrov and contributors (see CONTRIBUTORS.txt) # # This module is part of urllib3 and is released under # the MIT License: http://www.opensource.org/licenses/mit-license.php import email.utils import mimetypes from .packages import six def guess_content_type(filename, default='application/octet-stream'): """ Guess the "Content-Type" of a file. :param filename: The filename to guess the "Content-Type" of using :mod:`mimetimes`. :param default: If no "Content-Type" can be guessed, default to `default`. """ if filename: return mimetypes.guess_type(filename)[0] or default return default def format_header_param(name, value): """ Helper function to format and quote a single header parameter. Particularly useful for header parameters which might contain non-ASCII values, like file names. This follows RFC 2231, as suggested by RFC 2388 Section 4.4. :param name: The name of the parameter, a string expected to be ASCII only. :param value: The value of the parameter, provided as a unicode string. """ if not any(ch in value for ch in '"\\\r\n'): result = '%s="%s"' % (name, value) try: result.encode('ascii') except UnicodeEncodeError: pass else: return result if not six.PY3: # Python 2: value = value.encode('utf-8') value = email.utils.encode_rfc2231(value, 'utf-8') value = '%s*=%s' % (name, value) return value class RequestField(object): """ A data container for request body parameters. :param name: The name of this request field. :param data: The data/value body. :param filename: An optional filename of the request field. :param headers: An optional dict-like object of headers to initially use for the field. """ def __init__(self, name, data, filename=None, headers=None): self._name = name self._filename = filename self.data = data self.headers = {} if headers: self.headers = dict(headers) @classmethod def from_tuples(cls, fieldname, value): """ A :class:`~urllib3.fields.RequestField` factory from old-style tuple parameters. Supports constructing :class:`~urllib3.fields.RequestField` from parameter of key/value strings AND key/filetuple. A filetuple is a (filename, data, MIME type) tuple where the MIME type is optional. For example: :: 'foo': 'bar', 'fakefile': ('foofile.txt', 'contents of foofile'), 'realfile': ('barfile.txt', open('realfile').read()), 'typedfile': ('bazfile.bin', open('bazfile').read(), 'image/jpeg'), 'nonamefile': 'contents of nonamefile field', Field names and filenames must be unicode. """ if isinstance(value, tuple): if len(value) == 3: filename, data, content_type = value else: filename, data = value content_type = guess_content_type(filename) else: filename = None content_type = None data = value request_param = cls(fieldname, data, filename=filename) request_param.make_multipart(content_type=content_type) return request_param def _render_part(self, name, value): """ Overridable helper function to format a single header parameter. :param name: The name of the parameter, a string expected to be ASCII only. :param value: The value of the parameter, provided as a unicode string. """ return format_header_param(name, value) def _render_parts(self, header_parts): """ Helper function to format and quote a single header. Useful for single headers that are composed of multiple items. E.g., 'Content-Disposition' fields. :param header_parts: A sequence of (k, v) typles or a :class:`dict` of (k, v) to format as `k1="v1"; k2="v2"; ...`. """ parts = [] iterable = header_parts if isinstance(header_parts, dict): iterable = header_parts.items() for name, value in iterable: if value: parts.append(self._render_part(name, value)) return '; '.join(parts) def render_headers(self): """ Renders the headers for this request field. """ lines = [] sort_keys = ['Content-Disposition', 'Content-Type', 'Content-Location'] for sort_key in sort_keys: if self.headers.get(sort_key, False): lines.append('%s: %s' % (sort_key, self.headers[sort_key])) for header_name, header_value in self.headers.items(): if header_name not in sort_keys: if header_value: lines.append('%s: %s' % (header_name, header_value)) lines.append('\r\n') return '\r\n'.join(lines) def make_multipart(self, content_disposition=None, content_type=None, content_location=None): """ Makes this request field into a multipart request field. This method overrides "Content-Disposition", "Content-Type" and "Content-Location" headers to the request parameter. :param content_type: The 'Content-Type' of the request body. :param content_location: The 'Content-Location' of the request body. """ self.headers['Content-Disposition'] = content_disposition or 'form-data' self.headers['Content-Disposition'] += '; '.join(['', self._render_parts((('name', self._name), ('filename', self._filename)))]) self.headers['Content-Type'] = content_type self.headers['Content-Location'] = content_location armory-0.92.3/urllib3/connection.py0000644000000000000000000001614112414772654015720 0ustar rootroot# urllib3/connection.py # Copyright 2008-2013 Andrey Petrov and contributors (see CONTRIBUTORS.txt) # # This module is part of urllib3 and is released under # the MIT License: http://www.opensource.org/licenses/mit-license.php import sys import socket from socket import timeout as SocketTimeout try: # Python 3 from http.client import HTTPConnection as _HTTPConnection, HTTPException except ImportError: from httplib import HTTPConnection as _HTTPConnection, HTTPException class DummyConnection(object): "Used to detect a failed ConnectionCls import." pass try: # Compiled with SSL? ssl = None HTTPSConnection = DummyConnection class BaseSSLError(BaseException): pass try: # Python 3 from http.client import HTTPSConnection as _HTTPSConnection except ImportError: from httplib import HTTPSConnection as _HTTPSConnection import ssl BaseSSLError = ssl.SSLError except (ImportError, AttributeError): # Platform-specific: No SSL. pass from .exceptions import ( ConnectTimeoutError, ) from .packages.ssl_match_hostname import match_hostname from .packages import six from .util import ( assert_fingerprint, resolve_cert_reqs, resolve_ssl_version, ssl_wrap_socket, ) port_by_scheme = { 'http': 80, 'https': 443, } class HTTPConnection(_HTTPConnection, object): """ Based on httplib.HTTPConnection but provides an extra constructor backwards-compatibility layer between older and newer Pythons. """ default_port = port_by_scheme['http'] # By default, disable Nagle's Algorithm. tcp_nodelay = 1 def __init__(self, *args, **kw): if six.PY3: # Python 3 kw.pop('strict', None) if sys.version_info < (2, 7): # Python 2.6 and earlier kw.pop('source_address', None) self.source_address = None _HTTPConnection.__init__(self, *args, **kw) def _new_conn(self): """ Establish a socket connection and set nodelay settings on it :return: a new socket connection """ extra_args = [] if self.source_address: # Python 2.7+ extra_args.append(self.source_address) conn = socket.create_connection( (self.host, self.port), self.timeout, *extra_args ) conn.setsockopt(socket.IPPROTO_TCP, socket.TCP_NODELAY, self.tcp_nodelay) return conn def _prepare_conn(self, conn): self.sock = conn if self._tunnel_host: # TODO: Fix tunnel so it doesn't depend on self.sock state. self._tunnel() def connect(self): conn = self._new_conn() self._prepare_conn(conn) class HTTPSConnection(HTTPConnection): default_port = port_by_scheme['https'] def __init__(self, host, port=None, key_file=None, cert_file=None, strict=None, timeout=socket._GLOBAL_DEFAULT_TIMEOUT, source_address=None): HTTPConnection.__init__(self, host, port, strict=strict, timeout=timeout, source_address=source_address) self.key_file = key_file self.cert_file = cert_file def connect(self): conn = self._new_conn() self._prepare_conn(conn) self.sock = ssl.wrap_socket(conn, self.key_file, self.cert_file) class VerifiedHTTPSConnection(HTTPSConnection): """ Based on httplib.HTTPSConnection but wraps the socket with SSL certification. """ cert_reqs = None ca_certs = None ssl_version = None def set_cert(self, key_file=None, cert_file=None, cert_reqs=None, ca_certs=None, assert_hostname=None, assert_fingerprint=None): self.key_file = key_file self.cert_file = cert_file self.cert_reqs = cert_reqs self.ca_certs = ca_certs self.assert_hostname = assert_hostname self.assert_fingerprint = assert_fingerprint def connect(self): # Add certificate verification try: sock = socket.create_connection( address=(self.host, self.port), timeout=self.timeout, ) except SocketTimeout: raise ConnectTimeoutError( self, "Connection to %s timed out. (connect timeout=%s)" % (self.host, self.timeout)) sock.setsockopt(socket.IPPROTO_TCP, socket.TCP_NODELAY, self.tcp_nodelay) resolved_cert_reqs = resolve_cert_reqs(self.cert_reqs) resolved_ssl_version = resolve_ssl_version(self.ssl_version) # the _tunnel_host attribute was added in python 2.6.3 (via # http://hg.python.org/cpython/rev/0f57b30a152f) so pythons 2.6(0-2) do # not have them. if getattr(self, '_tunnel_host', None): self.sock = sock # Calls self._set_hostport(), so self.host is # self._tunnel_host below. self._tunnel() # Wrap socket using verification with the root certs in # trusted_root_certs self.sock = ssl_wrap_socket(sock, self.key_file, self.cert_file, cert_reqs=resolved_cert_reqs, ca_certs=self.ca_certs, server_hostname=self.host, ssl_version=resolved_ssl_version) if resolved_cert_reqs != ssl.CERT_NONE: if self.assert_fingerprint: assert_fingerprint(self.sock.getpeercert(binary_form=True), self.assert_fingerprint) elif self.assert_hostname is not False: #match_hostname(self.sock.getpeercert(), #self.assert_hostname or self.host) # TODO: At the very least, we should not totally nerf this # function for all hosts. But it does work for this # very isolated usecase, so I'm leaving it in here. # Can fix later if we need to print "***** FIXME *****" print " ** Had issues with bitcoinarmory.com validation;" print " ** SSLError: hostname 'scripts.bitcoinarmory.com'" print " ** doesn't match either of 'bitcoinarmory.com', " print " ** 'www.bitcoinarmory.com'. I am hardcoding the" print " ** certname into the bundled requests/urllib3" print " ** which breaks compatibility using it with any " print " ** HTTPS hosts other than bitcoinarmory.com." validDNS = ['bitcoinarmory.com', 'scripts.bitcoinarmory.com'] for key,val in self.sock.getpeercert().get('subjectAltName', []): if key=='DNS' and val in validDNS: break else: raise ssl.SSLError('Cert does not match bitcoinarmory.com') if ssl: # Make a copy for testing. UnverifiedHTTPSConnection = HTTPSConnection HTTPSConnection = VerifiedHTTPSConnection armory-0.92.3/urllib3/_collections.py0000644000000000000000000001463512414772654016244 0ustar rootroot# urllib3/_collections.py # Copyright 2008-2013 Andrey Petrov and contributors (see CONTRIBUTORS.txt) # # This module is part of urllib3 and is released under # the MIT License: http://www.opensource.org/licenses/mit-license.php from collections import Mapping, MutableMapping try: from threading import RLock except ImportError: # Platform-specific: No threads available class RLock: def __enter__(self): pass def __exit__(self, exc_type, exc_value, traceback): pass try: # Python 2.7+ from collections import OrderedDict except ImportError: from .packages.ordered_dict import OrderedDict from .packages.six import itervalues __all__ = ['RecentlyUsedContainer', 'HTTPHeaderDict'] _Null = object() class RecentlyUsedContainer(MutableMapping): """ Provides a thread-safe dict-like container which maintains up to ``maxsize`` keys while throwing away the least-recently-used keys beyond ``maxsize``. :param maxsize: Maximum number of recent elements to retain. :param dispose_func: Every time an item is evicted from the container, ``dispose_func(value)`` is called. Callback which will get called """ ContainerCls = OrderedDict def __init__(self, maxsize=10, dispose_func=None): self._maxsize = maxsize self.dispose_func = dispose_func self._container = self.ContainerCls() self.lock = RLock() def __getitem__(self, key): # Re-insert the item, moving it to the end of the eviction line. with self.lock: item = self._container.pop(key) self._container[key] = item return item def __setitem__(self, key, value): evicted_value = _Null with self.lock: # Possibly evict the existing value of 'key' evicted_value = self._container.get(key, _Null) self._container[key] = value # If we didn't evict an existing value, we might have to evict the # least recently used item from the beginning of the container. if len(self._container) > self._maxsize: _key, evicted_value = self._container.popitem(last=False) if self.dispose_func and evicted_value is not _Null: self.dispose_func(evicted_value) def __delitem__(self, key): with self.lock: value = self._container.pop(key) if self.dispose_func: self.dispose_func(value) def __len__(self): with self.lock: return len(self._container) def __iter__(self): raise NotImplementedError('Iteration over this class is unlikely to be threadsafe.') def clear(self): with self.lock: # Copy pointers to all values, then wipe the mapping # under Python 2, this copies the list of values twice :-| values = list(self._container.values()) self._container.clear() if self.dispose_func: for value in values: self.dispose_func(value) def keys(self): with self.lock: return self._container.keys() class HTTPHeaderDict(MutableMapping): """ :param headers: An iterable of field-value pairs. Must not contain multiple field names when compared case-insensitively. :param kwargs: Additional field-value pairs to pass in to ``dict.update``. A ``dict`` like container for storing HTTP Headers. Field names are stored and compared case-insensitively in compliance with RFC 2616. Iteration provides the first case-sensitive key seen for each case-insensitive pair. Using ``__setitem__`` syntax overwrites fields that compare equal case-insensitively in order to maintain ``dict``'s api. For fields that compare equal, instead create a new ``HTTPHeaderDict`` and use ``.add`` in a loop. If multiple fields that are equal case-insensitively are passed to the constructor or ``.update``, the behavior is undefined and some will be lost. >>> headers = HTTPHeaderDict() >>> headers.add('Set-Cookie', 'foo=bar') >>> headers.add('set-cookie', 'baz=quxx') >>> headers['content-length'] = '7' >>> headers['SET-cookie'] 'foo=bar, baz=quxx' >>> headers['Content-Length'] '7' If you want to access the raw headers with their original casing for debugging purposes you can access the private ``._data`` attribute which is a normal python ``dict`` that maps the case-insensitive key to a list of tuples stored as (case-sensitive-original-name, value). Using the structure from above as our example: >>> headers._data {'set-cookie': [('Set-Cookie', 'foo=bar'), ('set-cookie', 'baz=quxx')], 'content-length': [('content-length', '7')]} """ def __init__(self, headers=None, **kwargs): self._data = {} if headers is None: headers = {} self.update(headers, **kwargs) def add(self, key, value): """Adds a (name, value) pair, doesn't overwrite the value if it already exists. >>> headers = HTTPHeaderDict(foo='bar') >>> headers.add('Foo', 'baz') >>> headers['foo'] 'bar, baz' """ self._data.setdefault(key.lower(), []).append((key, value)) def getlist(self, key): """Returns a list of all the values for the named field. Returns an empty list if the key doesn't exist.""" return self[key].split(', ') if key in self else [] def copy(self): h = HTTPHeaderDict() for key in self._data: for rawkey, value in self._data[key]: h.add(rawkey, value) return h def __eq__(self, other): if not isinstance(other, Mapping): return False other = HTTPHeaderDict(other) return dict((k1, self[k1]) for k1 in self._data) == \ dict((k2, other[k2]) for k2 in other._data) def __getitem__(self, key): values = self._data[key.lower()] return ', '.join(value[1] for value in values) def __setitem__(self, key, value): self._data[key.lower()] = [(key, value)] def __delitem__(self, key): del self._data[key.lower()] def __len__(self): return len(self._data) def __iter__(self): for headers in itervalues(self._data): yield headers[0][0] def __repr__(self): return '%s(%r)' % (self.__class__.__name__, dict(self.items())) armory-0.92.3/urllib3/poolmanager.py0000644000000000000000000002142112414772654016062 0ustar rootroot# urllib3/poolmanager.py # Copyright 2008-2014 Andrey Petrov and contributors (see CONTRIBUTORS.txt) # # This module is part of urllib3 and is released under # the MIT License: http://www.opensource.org/licenses/mit-license.php import logging try: # Python 3 from urllib.parse import urljoin except ImportError: from urlparse import urljoin from ._collections import RecentlyUsedContainer from .connectionpool import HTTPConnectionPool, HTTPSConnectionPool from .connectionpool import port_by_scheme from .request import RequestMethods from .util import parse_url __all__ = ['PoolManager', 'ProxyManager', 'proxy_from_url'] pool_classes_by_scheme = { 'http': HTTPConnectionPool, 'https': HTTPSConnectionPool, } log = logging.getLogger(__name__) SSL_KEYWORDS = ('key_file', 'cert_file', 'cert_reqs', 'ca_certs', 'ssl_version') class PoolManager(RequestMethods): """ Allows for arbitrary requests while transparently keeping track of necessary connection pools for you. :param num_pools: Number of connection pools to cache before discarding the least recently used pool. :param headers: Headers to include with all requests, unless other headers are given explicitly. :param \**connection_pool_kw: Additional parameters are used to create fresh :class:`urllib3.connectionpool.ConnectionPool` instances. Example: :: >>> manager = PoolManager(num_pools=2) >>> r = manager.request('GET', 'http://google.com/') >>> r = manager.request('GET', 'http://google.com/mail') >>> r = manager.request('GET', 'http://yahoo.com/') >>> len(manager.pools) 2 """ proxy = None def __init__(self, num_pools=10, headers=None, **connection_pool_kw): RequestMethods.__init__(self, headers) self.connection_pool_kw = connection_pool_kw self.pools = RecentlyUsedContainer(num_pools, dispose_func=lambda p: p.close()) def _new_pool(self, scheme, host, port): """ Create a new :class:`ConnectionPool` based on host, port and scheme. This method is used to actually create the connection pools handed out by :meth:`connection_from_url` and companion methods. It is intended to be overridden for customization. """ pool_cls = pool_classes_by_scheme[scheme] kwargs = self.connection_pool_kw if scheme == 'http': kwargs = self.connection_pool_kw.copy() for kw in SSL_KEYWORDS: kwargs.pop(kw, None) return pool_cls(host, port, **kwargs) def clear(self): """ Empty our store of pools and direct them all to close. This will not affect in-flight connections, but they will not be re-used after completion. """ self.pools.clear() def connection_from_host(self, host, port=None, scheme='http'): """ Get a :class:`ConnectionPool` based on the host, port, and scheme. If ``port`` isn't given, it will be derived from the ``scheme`` using ``urllib3.connectionpool.port_by_scheme``. """ scheme = scheme or 'http' port = port or port_by_scheme.get(scheme, 80) pool_key = (scheme, host, port) with self.pools.lock: # If the scheme, host, or port doesn't match existing open # connections, open a new ConnectionPool. pool = self.pools.get(pool_key) if pool: return pool # Make a fresh ConnectionPool of the desired type pool = self._new_pool(scheme, host, port) self.pools[pool_key] = pool return pool def connection_from_url(self, url): """ Similar to :func:`urllib3.connectionpool.connection_from_url` but doesn't pass any additional parameters to the :class:`urllib3.connectionpool.ConnectionPool` constructor. Additional parameters are taken from the :class:`.PoolManager` constructor. """ u = parse_url(url) return self.connection_from_host(u.host, port=u.port, scheme=u.scheme) def urlopen(self, method, url, redirect=True, **kw): """ Same as :meth:`urllib3.connectionpool.HTTPConnectionPool.urlopen` with custom cross-host redirect logic and only sends the request-uri portion of the ``url``. The given ``url`` parameter must be absolute, such that an appropriate :class:`urllib3.connectionpool.ConnectionPool` can be chosen for it. """ u = parse_url(url) conn = self.connection_from_host(u.host, port=u.port, scheme=u.scheme) kw['assert_same_host'] = False kw['redirect'] = False if 'headers' not in kw: kw['headers'] = self.headers if self.proxy is not None and u.scheme == "http": response = conn.urlopen(method, url, **kw) else: response = conn.urlopen(method, u.request_uri, **kw) redirect_location = redirect and response.get_redirect_location() if not redirect_location: return response # Support relative URLs for redirecting. redirect_location = urljoin(url, redirect_location) # RFC 2616, Section 10.3.4 if response.status == 303: method = 'GET' log.info("Redirecting %s -> %s" % (url, redirect_location)) kw['retries'] = kw.get('retries', 3) - 1 # Persist retries countdown kw['redirect'] = redirect return self.urlopen(method, redirect_location, **kw) class ProxyManager(PoolManager): """ Behaves just like :class:`PoolManager`, but sends all requests through the defined proxy, using the CONNECT method for HTTPS URLs. :param proxy_url: The URL of the proxy to be used. :param proxy_headers: A dictionary contaning headers that will be sent to the proxy. In case of HTTP they are being sent with each request, while in the HTTPS/CONNECT case they are sent only once. Could be used for proxy authentication. Example: >>> proxy = urllib3.ProxyManager('http://localhost:3128/') >>> r1 = proxy.request('GET', 'http://google.com/') >>> r2 = proxy.request('GET', 'http://httpbin.org/') >>> len(proxy.pools) 1 >>> r3 = proxy.request('GET', 'https://httpbin.org/') >>> r4 = proxy.request('GET', 'https://twitter.com/') >>> len(proxy.pools) 3 """ def __init__(self, proxy_url, num_pools=10, headers=None, proxy_headers=None, **connection_pool_kw): if isinstance(proxy_url, HTTPConnectionPool): proxy_url = '%s://%s:%i' % (proxy_url.scheme, proxy_url.host, proxy_url.port) proxy = parse_url(proxy_url) if not proxy.port: port = port_by_scheme.get(proxy.scheme, 80) proxy = proxy._replace(port=port) self.proxy = proxy self.proxy_headers = proxy_headers or {} assert self.proxy.scheme in ("http", "https"), \ 'Not supported proxy scheme %s' % self.proxy.scheme connection_pool_kw['_proxy'] = self.proxy connection_pool_kw['_proxy_headers'] = self.proxy_headers super(ProxyManager, self).__init__( num_pools, headers, **connection_pool_kw) def connection_from_host(self, host, port=None, scheme='http'): if scheme == "https": return super(ProxyManager, self).connection_from_host( host, port, scheme) return super(ProxyManager, self).connection_from_host( self.proxy.host, self.proxy.port, self.proxy.scheme) def _set_proxy_headers(self, url, headers=None): """ Sets headers needed by proxies: specifically, the Accept and Host headers. Only sets headers not provided by the user. """ headers_ = {'Accept': '*/*'} netloc = parse_url(url).netloc if netloc: headers_['Host'] = netloc if headers: headers_.update(headers) return headers_ def urlopen(self, method, url, redirect=True, **kw): "Same as HTTP(S)ConnectionPool.urlopen, ``url`` must be absolute." u = parse_url(url) if u.scheme == "http": # For proxied HTTPS requests, httplib sets the necessary headers # on the CONNECT to the proxy. For HTTP, we'll definitely # need to set 'Host' at the very least. kw['headers'] = self._set_proxy_headers(url, kw.get('headers', self.headers)) return super(ProxyManager, self).urlopen(method, url, redirect, **kw) def proxy_from_url(url, **kw): return ProxyManager(proxy_url=url, **kw) armory-0.92.3/urllib3/request.py0000644000000000000000000001326012414772654015250 0ustar rootroot# urllib3/request.py # Copyright 2008-2013 Andrey Petrov and contributors (see CONTRIBUTORS.txt) # # This module is part of urllib3 and is released under # the MIT License: http://www.opensource.org/licenses/mit-license.php try: from urllib.parse import urlencode except ImportError: from urllib import urlencode from .filepost import encode_multipart_formdata __all__ = ['RequestMethods'] class RequestMethods(object): """ Convenience mixin for classes who implement a :meth:`urlopen` method, such as :class:`~urllib3.connectionpool.HTTPConnectionPool` and :class:`~urllib3.poolmanager.PoolManager`. Provides behavior for making common types of HTTP request methods and decides which type of request field encoding to use. Specifically, :meth:`.request_encode_url` is for sending requests whose fields are encoded in the URL (such as GET, HEAD, DELETE). :meth:`.request_encode_body` is for sending requests whose fields are encoded in the *body* of the request using multipart or www-form-urlencoded (such as for POST, PUT, PATCH). :meth:`.request` is for making any kind of request, it will look up the appropriate encoding format and use one of the above two methods to make the request. Initializer parameters: :param headers: Headers to include with all requests, unless other headers are given explicitly. """ _encode_url_methods = set(['DELETE', 'GET', 'HEAD', 'OPTIONS']) def __init__(self, headers=None): self.headers = headers or {} def urlopen(self, method, url, body=None, headers=None, encode_multipart=True, multipart_boundary=None, **kw): # Abstract raise NotImplemented("Classes extending RequestMethods must implement " "their own ``urlopen`` method.") def request(self, method, url, fields=None, headers=None, **urlopen_kw): """ Make a request using :meth:`urlopen` with the appropriate encoding of ``fields`` based on the ``method`` used. This is a convenience method that requires the least amount of manual effort. It can be used in most situations, while still having the option to drop down to more specific methods when necessary, such as :meth:`request_encode_url`, :meth:`request_encode_body`, or even the lowest level :meth:`urlopen`. """ method = method.upper() if method in self._encode_url_methods: return self.request_encode_url(method, url, fields=fields, headers=headers, **urlopen_kw) else: return self.request_encode_body(method, url, fields=fields, headers=headers, **urlopen_kw) def request_encode_url(self, method, url, fields=None, **urlopen_kw): """ Make a request using :meth:`urlopen` with the ``fields`` encoded in the url. This is useful for request methods like GET, HEAD, DELETE, etc. """ if fields: url += '?' + urlencode(fields) return self.urlopen(method, url, **urlopen_kw) def request_encode_body(self, method, url, fields=None, headers=None, encode_multipart=True, multipart_boundary=None, **urlopen_kw): """ Make a request using :meth:`urlopen` with the ``fields`` encoded in the body. This is useful for request methods like POST, PUT, PATCH, etc. When ``encode_multipart=True`` (default), then :meth:`urllib3.filepost.encode_multipart_formdata` is used to encode the payload with the appropriate content type. Otherwise :meth:`urllib.urlencode` is used with the 'application/x-www-form-urlencoded' content type. Multipart encoding must be used when posting files, and it's reasonably safe to use it in other times too. However, it may break request signing, such as with OAuth. Supports an optional ``fields`` parameter of key/value strings AND key/filetuple. A filetuple is a (filename, data, MIME type) tuple where the MIME type is optional. For example: :: fields = { 'foo': 'bar', 'fakefile': ('foofile.txt', 'contents of foofile'), 'realfile': ('barfile.txt', open('realfile').read()), 'typedfile': ('bazfile.bin', open('bazfile').read(), 'image/jpeg'), 'nonamefile': 'contents of nonamefile field', } When uploading a file, providing a filename (the first parameter of the tuple) is optional but recommended to best mimick behavior of browsers. Note that if ``headers`` are supplied, the 'Content-Type' header will be overwritten because it depends on the dynamic random boundary string which is used to compose the body of the request. The random boundary string can be explicitly set with the ``multipart_boundary`` parameter. """ if encode_multipart: body, content_type = encode_multipart_formdata(fields or {}, boundary=multipart_boundary) else: body, content_type = (urlencode(fields or {}), 'application/x-www-form-urlencoded') if headers is None: headers = self.headers headers_ = {'Content-Type': content_type} headers_.update(headers) return self.urlopen(method, url, body=body, headers=headers_, **urlopen_kw) armory-0.92.3/urllib3/contrib/0000755000000000000000000000000012414772654014644 5ustar rootrootarmory-0.92.3/urllib3/contrib/__init__.py0000644000000000000000000000000012414772654016743 0ustar rootrootarmory-0.92.3/urllib3/contrib/pyopenssl.py0000644000000000000000000003454712414772654017267 0ustar rootroot'''SSL with SNI_-support for Python 2. This needs the following packages installed: * pyOpenSSL (tested with 0.13) * ndg-httpsclient (tested with 0.3.2) * pyasn1 (tested with 0.1.6) To activate it call :func:`~urllib3.contrib.pyopenssl.inject_into_urllib3`. This can be done in a ``sitecustomize`` module, or at any other time before your application begins using ``urllib3``, like this:: try: import urllib3.contrib.pyopenssl urllib3.contrib.pyopenssl.inject_into_urllib3() except ImportError: pass Now you can use :mod:`urllib3` as you normally would, and it will support SNI when the required modules are installed. Activating this module also has the positive side effect of disabling SSL/TLS encryption in Python 2 (see `CRIME attack`_). If you want to configure the default list of supported cipher suites, you can set the ``urllib3.contrib.pyopenssl.DEFAULT_SSL_CIPHER_LIST`` variable. Module Variables ---------------- :var DEFAULT_SSL_CIPHER_LIST: The list of supported SSL/TLS cipher suites. Default: ``ECDH+AESGCM:DH+AESGCM:ECDH+AES256:DH+AES256:ECDH+AES128:DH+AES: ECDH+3DES:DH+3DES:RSA+AESGCM:RSA+AES:RSA+3DES:!aNULL:!MD5:!DSS`` .. _sni: https://en.wikipedia.org/wiki/Server_Name_Indication .. _crime attack: https://en.wikipedia.org/wiki/CRIME_(security_exploit) ''' from ndg.httpsclient.ssl_peer_verification import SUBJ_ALT_NAME_SUPPORT from ndg.httpsclient.subj_alt_name import SubjectAltName as BaseSubjectAltName import OpenSSL.SSL from pyasn1.codec.der import decoder as der_decoder from pyasn1.type import univ, constraint from socket import _fileobject, timeout import ssl import select from cStringIO import StringIO from .. import connection from .. import util __all__ = ['inject_into_urllib3', 'extract_from_urllib3'] # SNI only *really* works if we can read the subjectAltName of certificates. HAS_SNI = SUBJ_ALT_NAME_SUPPORT # Map from urllib3 to PyOpenSSL compatible parameter-values. _openssl_versions = { ssl.PROTOCOL_SSLv23: OpenSSL.SSL.SSLv23_METHOD, ssl.PROTOCOL_SSLv3: OpenSSL.SSL.SSLv3_METHOD, ssl.PROTOCOL_TLSv1: OpenSSL.SSL.TLSv1_METHOD, } _openssl_verify = { ssl.CERT_NONE: OpenSSL.SSL.VERIFY_NONE, ssl.CERT_OPTIONAL: OpenSSL.SSL.VERIFY_PEER, ssl.CERT_REQUIRED: OpenSSL.SSL.VERIFY_PEER + OpenSSL.SSL.VERIFY_FAIL_IF_NO_PEER_CERT, } # A secure default. # Sources for more information on TLS ciphers: # # - https://wiki.mozilla.org/Security/Server_Side_TLS # - https://www.ssllabs.com/projects/best-practices/index.html # - https://hynek.me/articles/hardening-your-web-servers-ssl-ciphers/ # # The general intent is: # - Prefer cipher suites that offer perfect forward secrecy (DHE/ECDHE), # - prefer ECDHE over DHE for better performance, # - prefer any AES-GCM over any AES-CBC for better performance and security, # - use 3DES as fallback which is secure but slow, # - disable NULL authentication, MD5 MACs and DSS for security reasons. DEFAULT_SSL_CIPHER_LIST = "ECDH+AESGCM:DH+AESGCM:ECDH+AES256:DH+AES256:" + \ "ECDH+AES128:DH+AES:ECDH+3DES:DH+3DES:RSA+AESGCM:RSA+AES:RSA+3DES:" + \ "!aNULL:!MD5:!DSS" orig_util_HAS_SNI = util.HAS_SNI orig_connection_ssl_wrap_socket = connection.ssl_wrap_socket def inject_into_urllib3(): 'Monkey-patch urllib3 with PyOpenSSL-backed SSL-support.' connection.ssl_wrap_socket = ssl_wrap_socket util.HAS_SNI = HAS_SNI def extract_from_urllib3(): 'Undo monkey-patching by :func:`inject_into_urllib3`.' connection.ssl_wrap_socket = orig_connection_ssl_wrap_socket util.HAS_SNI = orig_util_HAS_SNI ### Note: This is a slightly bug-fixed version of same from ndg-httpsclient. class SubjectAltName(BaseSubjectAltName): '''ASN.1 implementation for subjectAltNames support''' # There is no limit to how many SAN certificates a certificate may have, # however this needs to have some limit so we'll set an arbitrarily high # limit. sizeSpec = univ.SequenceOf.sizeSpec + \ constraint.ValueSizeConstraint(1, 1024) ### Note: This is a slightly bug-fixed version of same from ndg-httpsclient. def get_subj_alt_name(peer_cert): # Search through extensions dns_name = [] if not SUBJ_ALT_NAME_SUPPORT: return dns_name general_names = SubjectAltName() for i in range(peer_cert.get_extension_count()): ext = peer_cert.get_extension(i) ext_name = ext.get_short_name() if ext_name != 'subjectAltName': continue # PyOpenSSL returns extension data in ASN.1 encoded form ext_dat = ext.get_data() decoded_dat = der_decoder.decode(ext_dat, asn1Spec=general_names) for name in decoded_dat: if not isinstance(name, SubjectAltName): continue for entry in range(len(name)): component = name.getComponentByPosition(entry) if component.getName() != 'dNSName': continue dns_name.append(str(component.getComponent())) return dns_name class fileobject(_fileobject): def _wait_for_sock(self): rd, wd, ed = select.select([self._sock], [], [], self._sock.gettimeout()) if not rd: raise timeout() def read(self, size=-1): # Use max, disallow tiny reads in a loop as they are very inefficient. # We never leave read() with any leftover data from a new recv() call # in our internal buffer. rbufsize = max(self._rbufsize, self.default_bufsize) # Our use of StringIO rather than lists of string objects returned by # recv() minimizes memory usage and fragmentation that occurs when # rbufsize is large compared to the typical return value of recv(). buf = self._rbuf buf.seek(0, 2) # seek end if size < 0: # Read until EOF self._rbuf = StringIO() # reset _rbuf. we consume it via buf. while True: try: data = self._sock.recv(rbufsize) except OpenSSL.SSL.WantReadError: self._wait_for_sock() continue if not data: break buf.write(data) return buf.getvalue() else: # Read until size bytes or EOF seen, whichever comes first buf_len = buf.tell() if buf_len >= size: # Already have size bytes in our buffer? Extract and return. buf.seek(0) rv = buf.read(size) self._rbuf = StringIO() self._rbuf.write(buf.read()) return rv self._rbuf = StringIO() # reset _rbuf. we consume it via buf. while True: left = size - buf_len # recv() will malloc the amount of memory given as its # parameter even though it often returns much less data # than that. The returned data string is short lived # as we copy it into a StringIO and free it. This avoids # fragmentation issues on many platforms. try: data = self._sock.recv(left) except OpenSSL.SSL.WantReadError: self._wait_for_sock() continue if not data: break n = len(data) if n == size and not buf_len: # Shortcut. Avoid buffer data copies when: # - We have no data in our buffer. # AND # - Our call to recv returned exactly the # number of bytes we were asked to read. return data if n == left: buf.write(data) del data # explicit free break assert n <= left, "recv(%d) returned %d bytes" % (left, n) buf.write(data) buf_len += n del data # explicit free #assert buf_len == buf.tell() return buf.getvalue() def readline(self, size=-1): buf = self._rbuf buf.seek(0, 2) # seek end if buf.tell() > 0: # check if we already have it in our buffer buf.seek(0) bline = buf.readline(size) if bline.endswith('\n') or len(bline) == size: self._rbuf = StringIO() self._rbuf.write(buf.read()) return bline del bline if size < 0: # Read until \n or EOF, whichever comes first if self._rbufsize <= 1: # Speed up unbuffered case buf.seek(0) buffers = [buf.read()] self._rbuf = StringIO() # reset _rbuf. we consume it via buf. data = None recv = self._sock.recv while True: try: while data != "\n": data = recv(1) if not data: break buffers.append(data) except OpenSSL.SSL.WantReadError: self._wait_for_sock() continue break return "".join(buffers) buf.seek(0, 2) # seek end self._rbuf = StringIO() # reset _rbuf. we consume it via buf. while True: try: data = self._sock.recv(self._rbufsize) except OpenSSL.SSL.WantReadError: self._wait_for_sock() continue if not data: break nl = data.find('\n') if nl >= 0: nl += 1 buf.write(data[:nl]) self._rbuf.write(data[nl:]) del data break buf.write(data) return buf.getvalue() else: # Read until size bytes or \n or EOF seen, whichever comes first buf.seek(0, 2) # seek end buf_len = buf.tell() if buf_len >= size: buf.seek(0) rv = buf.read(size) self._rbuf = StringIO() self._rbuf.write(buf.read()) return rv self._rbuf = StringIO() # reset _rbuf. we consume it via buf. while True: try: data = self._sock.recv(self._rbufsize) except OpenSSL.SSL.WantReadError: self._wait_for_sock() continue if not data: break left = size - buf_len # did we just receive a newline? nl = data.find('\n', 0, left) if nl >= 0: nl += 1 # save the excess data to _rbuf self._rbuf.write(data[nl:]) if buf_len: buf.write(data[:nl]) break else: # Shortcut. Avoid data copy through buf when returning # a substring of our first recv(). return data[:nl] n = len(data) if n == size and not buf_len: # Shortcut. Avoid data copy through buf when # returning exactly all of our first recv(). return data if n >= left: buf.write(data[:left]) self._rbuf.write(data[left:]) break buf.write(data) buf_len += n #assert buf_len == buf.tell() return buf.getvalue() class WrappedSocket(object): '''API-compatibility wrapper for Python OpenSSL's Connection-class.''' def __init__(self, connection, socket): self.connection = connection self.socket = socket def fileno(self): return self.socket.fileno() def makefile(self, mode, bufsize=-1): return fileobject(self.connection, mode, bufsize) def settimeout(self, timeout): return self.socket.settimeout(timeout) def sendall(self, data): return self.connection.sendall(data) def close(self): return self.connection.shutdown() def getpeercert(self, binary_form=False): x509 = self.connection.get_peer_certificate() if not x509: return x509 if binary_form: return OpenSSL.crypto.dump_certificate( OpenSSL.crypto.FILETYPE_ASN1, x509) return { 'subject': ( (('commonName', x509.get_subject().CN),), ), 'subjectAltName': [ ('DNS', value) for value in get_subj_alt_name(x509) ] } def _verify_callback(cnx, x509, err_no, err_depth, return_code): return err_no == 0 def ssl_wrap_socket(sock, keyfile=None, certfile=None, cert_reqs=None, ca_certs=None, server_hostname=None, ssl_version=None): ctx = OpenSSL.SSL.Context(_openssl_versions[ssl_version]) if certfile: ctx.use_certificate_file(certfile) if keyfile: ctx.use_privatekey_file(keyfile) if cert_reqs != ssl.CERT_NONE: ctx.set_verify(_openssl_verify[cert_reqs], _verify_callback) if ca_certs: try: ctx.load_verify_locations(ca_certs, None) except OpenSSL.SSL.Error as e: raise ssl.SSLError('bad ca_certs: %r' % ca_certs, e) else: ctx.set_default_verify_paths() # Disable TLS compression to migitate CRIME attack (issue #309) OP_NO_COMPRESSION = 0x20000 ctx.set_options(OP_NO_COMPRESSION) # Set list of supported ciphersuites. ctx.set_cipher_list(DEFAULT_SSL_CIPHER_LIST) cnx = OpenSSL.SSL.Connection(ctx, sock) cnx.set_tlsext_host_name(server_hostname) cnx.set_connect_state() while True: try: cnx.do_handshake() except OpenSSL.SSL.WantReadError: select.select([sock], [], []) continue except OpenSSL.SSL.Error as e: raise ssl.SSLError('bad handshake', e) break return WrappedSocket(cnx, sock) armory-0.92.3/urllib3/contrib/ntlmpool.py0000644000000000000000000001120512414772654017061 0ustar rootroot# urllib3/contrib/ntlmpool.py # Copyright 2008-2013 Andrey Petrov and contributors (see CONTRIBUTORS.txt) # # This module is part of urllib3 and is released under # the MIT License: http://www.opensource.org/licenses/mit-license.php """ NTLM authenticating pool, contributed by erikcederstran Issue #10, see: http://code.google.com/p/urllib3/issues/detail?id=10 """ try: from http.client import HTTPSConnection except ImportError: from httplib import HTTPSConnection from logging import getLogger from ntlm import ntlm from urllib3 import HTTPSConnectionPool log = getLogger(__name__) class NTLMConnectionPool(HTTPSConnectionPool): """ Implements an NTLM authentication version of an urllib3 connection pool """ scheme = 'https' def __init__(self, user, pw, authurl, *args, **kwargs): """ authurl is a random URL on the server that is protected by NTLM. user is the Windows user, probably in the DOMAIN\\username format. pw is the password for the user. """ super(NTLMConnectionPool, self).__init__(*args, **kwargs) self.authurl = authurl self.rawuser = user user_parts = user.split('\\', 1) self.domain = user_parts[0].upper() self.user = user_parts[1] self.pw = pw def _new_conn(self): # Performs the NTLM handshake that secures the connection. The socket # must be kept open while requests are performed. self.num_connections += 1 log.debug('Starting NTLM HTTPS connection no. %d: https://%s%s' % (self.num_connections, self.host, self.authurl)) headers = {} headers['Connection'] = 'Keep-Alive' req_header = 'Authorization' resp_header = 'www-authenticate' conn = HTTPSConnection(host=self.host, port=self.port) # Send negotiation message headers[req_header] = ( 'NTLM %s' % ntlm.create_NTLM_NEGOTIATE_MESSAGE(self.rawuser)) log.debug('Request headers: %s' % headers) conn.request('GET', self.authurl, None, headers) res = conn.getresponse() reshdr = dict(res.getheaders()) log.debug('Response status: %s %s' % (res.status, res.reason)) log.debug('Response headers: %s' % reshdr) log.debug('Response data: %s [...]' % res.read(100)) # Remove the reference to the socket, so that it can not be closed by # the response object (we want to keep the socket open) res.fp = None # Server should respond with a challenge message auth_header_values = reshdr[resp_header].split(', ') auth_header_value = None for s in auth_header_values: if s[:5] == 'NTLM ': auth_header_value = s[5:] if auth_header_value is None: raise Exception('Unexpected %s response header: %s' % (resp_header, reshdr[resp_header])) # Send authentication message ServerChallenge, NegotiateFlags = \ ntlm.parse_NTLM_CHALLENGE_MESSAGE(auth_header_value) auth_msg = ntlm.create_NTLM_AUTHENTICATE_MESSAGE(ServerChallenge, self.user, self.domain, self.pw, NegotiateFlags) headers[req_header] = 'NTLM %s' % auth_msg log.debug('Request headers: %s' % headers) conn.request('GET', self.authurl, None, headers) res = conn.getresponse() log.debug('Response status: %s %s' % (res.status, res.reason)) log.debug('Response headers: %s' % dict(res.getheaders())) log.debug('Response data: %s [...]' % res.read()[:100]) if res.status != 200: if res.status == 401: raise Exception('Server rejected request: wrong ' 'username or password') raise Exception('Wrong server response: %s %s' % (res.status, res.reason)) res.fp = None log.debug('Connection established') return conn def urlopen(self, method, url, body=None, headers=None, retries=3, redirect=True, assert_same_host=True): if headers is None: headers = {} headers['Connection'] = 'Keep-Alive' return super(NTLMConnectionPool, self).urlopen(method, url, body, headers, retries, redirect, assert_same_host) armory-0.92.3/urllib3/filepost.py0000644000000000000000000000472012414772654015406 0ustar rootroot# urllib3/filepost.py # Copyright 2008-2013 Andrey Petrov and contributors (see CONTRIBUTORS.txt) # # This module is part of urllib3 and is released under # the MIT License: http://www.opensource.org/licenses/mit-license.php import codecs import mimetypes from uuid import uuid4 from io import BytesIO from .packages import six from .packages.six import b from .fields import RequestField writer = codecs.lookup('utf-8')[3] def choose_boundary(): """ Our embarassingly-simple replacement for mimetools.choose_boundary. """ return uuid4().hex def iter_field_objects(fields): """ Iterate over fields. Supports list of (k, v) tuples and dicts, and lists of :class:`~urllib3.fields.RequestField`. """ if isinstance(fields, dict): i = six.iteritems(fields) else: i = iter(fields) for field in i: if isinstance(field, RequestField): yield field else: yield RequestField.from_tuples(*field) def iter_fields(fields): """ .. deprecated:: 1.6 Iterate over fields. The addition of :class:`~urllib3.fields.RequestField` makes this function obsolete. Instead, use :func:`iter_field_objects`, which returns :class:`~urllib3.fields.RequestField` objects. Supports list of (k, v) tuples and dicts. """ if isinstance(fields, dict): return ((k, v) for k, v in six.iteritems(fields)) return ((k, v) for k, v in fields) def encode_multipart_formdata(fields, boundary=None): """ Encode a dictionary of ``fields`` using the multipart/form-data MIME format. :param fields: Dictionary of fields or list of (key, :class:`~urllib3.fields.RequestField`). :param boundary: If not specified, then a random boundary will be generated using :func:`mimetools.choose_boundary`. """ body = BytesIO() if boundary is None: boundary = choose_boundary() for field in iter_field_objects(fields): body.write(b('--%s\r\n' % (boundary))) writer(body).write(field.render_headers()) data = field.data if isinstance(data, int): data = str(data) # Backwards compatibility if isinstance(data, six.text_type): writer(body).write(data) else: body.write(data) body.write(b'\r\n') body.write(b('--%s--\r\n' % (boundary))) content_type = str('multipart/form-data; boundary=%s' % boundary) return body.getvalue(), content_type armory-0.92.3/armoryd.README0000644000000000000000000001256212414772654014172 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ ******************************************************************************** * * Project: Armory (armoryd) * Authors: Alan Reiner and Douglas Roark * Orig Date: 2014/06/21 * Descr: Armory is a full-featured Bitcoin client, offering a dozen * innovative features not found in any other client software! * Manage multiple wallets (deterministic and watching-only), * print paper backups that work forever, import or sweep private * keys, and keep your savings in a computer that never touches * the internet, while still being able to manage incoming payments, * and create outgoing payments with the help of a USB key. * * ***Armory has no independent networking components built in. * Instead, it relies on on the Satoshi client to securely connect * to peers, validate blockchain data, and broadcast transactions * for us. Although it was initially planned to cut the umbilical * cord to the Satoshi client and implement independent networking, * it has turned out to be an inconvenience worth having. * Reimplementing all the networking code would be fraught with bugs, * security holes, and possible blockchain forking. The reliance * on Bitcoin-Qt right now is actually making Armory more secure! * * armoryd is a command-line program comparable to Bitcoin Core's * bitcoind. armoryd allows users to use Armory functionality solely * from a command line, write scripts that implement Armory * functionality, etc. armoryd relies on a client/server model. If * armoryd is not already running on a computer, the first instance * will place armoryd in server mode. Once armoryd is running, users * may send commands to the armoryd server via JSON. A second * instance of armoryd may be used to send the commands, or any other * JSON client may be used. * * Please note that Armory and armoryd should not be run at the same * time!!! Any attempt to run both programs at the same time could * lead to unpredictable behavior, including wallet and lockbox * corruption. * * Upon startup, armoryd will attempt to load all wallets and * lockboxes in the default Armory data directory or, if overridden * by the "--datadir=X" argument, a user-defined directory. * * armoryd has access to all command line flags used by Armory. The * following are some examples of how to run armoryd. * * --SERVER-- * python armoryd.py - Run an armoryd server on mainnet. * python armoryd.py --testnet - Run an armoryd server on testnet. * python armoryd.py --datadir=/home/areiner/Armory_Wallets - Run * armoryd with wallets and lockboxes loaded from a non-standard * location. * * --CLIENT-- * python armoryd.py getwalletinfo - Receive info about the mainnet * wallet that is currently active on the armoryd server. * python armoryd.py getarmorydinfo - Get information about the * server version of armoryd that is currently running. * python armoryd.py getarmoryfunctions - Get a list of functions * available on the armoryd server. * python armoryd.py watchwallet sender@c.net watchCmd=remove - * Stop sending e-mail notifications from a given e-mail address. * python armoryd.py --testnet createustxtoaddress * n3QJ7oiaDHBMxtN5bckLDLBr98zeufEkMv 10 - Create an unsigned * transaction of 10 BTC to be sent to the given address on * testnet. * * In order to run armoryd, the user must have bitcoind installed on * the same computer as armoryd. As of June 2014, bitcoind can be * downloaded in binary form for Windows and Linux, alongside * Bitcoin Core downloads, while OS X users must build and install * their own binaries. Go to https://github.com/bitcoin/bitcoin for * more information on how to download, build and install the * bitcoind code. In addition, be sure to download the correct * branch for the latest build. For example, to download the source * code for v0.9.2, https://github.com/bitcoin/bitcoin/tree/0.9.2 is * the link to use, or, if using git, "0.9.2" is the correct branch. * ******************************************************************************** * * Please take a moment to donate some BTC! 1ArmoryXcfq7TnCSuZa9fQjRYwJ4bkRKfv * ******************************************************************************** armory-0.92.3/build_installer.bat0000644000000000000000000000106512414772654015476 0ustar rootrootREM This should only be run from cppForSwig\BitcoinArmory_SwigDLL directory copy ..\libs\Win32\BitcoinArmory_SwigDLL.dll ..\..\_CppBlockUtils.pyd C:\Python27\Lib\site-packages\PyQt4\pyrcc4.exe -o ..\..\qrc_img_resources.py ..\..\imgList.xml python ..\..\setup.py py2exe --includes sip,hashlib,json,twisted -d ..\..\ArmoryStandalone copy ..\..\img\*.ico ..\..\ArmoryStandalone copy ..\..\img\armory_logo*.png ..\..\ArmoryStandalone copy ..\..\default_bootstrap.torrent ..\..\ArmoryStandalone python ..\..\writeNSISCompilerArgs.py makensis.exe ..\..\ArmorySetup.nsi armory-0.92.3/extras/0000755000000000000000000000000012414772654013136 5ustar rootrootarmory-0.92.3/extras/frag_wallet.py0000644000000000000000000001406212414772654016002 0ustar rootrootfrom sys import path,argv path.append('..') from armoryengine import * import getpass print '' print '*'*80 print '* Executing wallet-fragmenting script. Split your Armory wallet ' print '* into N pieces, requiring any M to recover the wallet.' print '*'*80 print '' try: from subprocess import Popen, PIPE proc = Popen('git rev-parse HEAD', shell=True, stdout=PIPE) commitHash = proc.stdout.read().strip() print 'Found hash of current git commit:', commitHash except: commitHash = None if '--testnet' in argv: i = argv.index('--testnet') del argv[i] if len(argv)<2: print '' print 'USAGE: %s file.wallet [M] [N] ' % argv[0] print '' print 'Will produce N files, of which any subset of M of them is ' print 'sufficient to reproduce your wallet.' print '' exit(0) wltfile,M,N = argv[1:] try: M = int(M) N = int(N) except: print 'ERROR: Must specify integers for M and N' exit(0) if M>N: print 'ERROR: You must specify and M that is equal to or less than N' print ' You specified (M,N)=(%d,%d)' % (M,N) exit(0) if not 1 '.rjust(16), for betsz in betSizes: print ('%0.2f'%betsz).rjust(19), print '\n' print 'HouseEdge vvv'.rjust(16) for pct in [0.005, 0.01, 0.015, 0.02, 0.025, 0.03, 0.035]: print ('%0.1f%%'%(100*pct)).rjust(16), for betsz in betSizes: avg,var = calcAvgAndVar(targ, 1.0-2*pct ,F, betsz) avg = nBet * avg std = sqrt(nBet * var) avgStr = ('%0.3f'%avg).rjust(8) stdStr = ('%0.3f'%(3*std)).rjust(8) print '(%s : %s)' % (avgStr, stdStr), print ' ' armory-0.92.3/extras/createTxFromAddrList.py0000644000000000000000000001637012414772654017551 0ustar rootroot################################################################################ # # Copyright (C) 2011-2014, Armory Technologies, Inc. # Distributed under the GNU Affero General Public License (AGPL v3) # See LICENSE or http://www.gnu.org/licenses/agpl.html # ################################################################################ import sys sys.path.append('..') sys.path.append('.') from armoryengine import * from getpass import getpass def createTxFromAddrList(walletObj, addrList, recipAmtPairList, \ fee=0, changeAddr=None): """ Create an unsigned transaction. This method expects a wallet file, a list of addresses in that wallet, and then a list of recipients and amounts to send each one. !!! YOU MUST SPECIFY ALL BITCOIN VALUES IN SATOSHIS !!! You can either write it out explicitly -- 150000000 Or use floats and convert to long -- long(1.5*ONE_BTC) You must also specify an address to which you want change sent. It will only be used if necessary (i.e. if you don't specify your recip list to exactly match inputs minus fees) If no change address is specified, the next unused address will be retrieved from the walletObj """ if not TheBDM.isInitialized(): # Only executed on the first call if blockchain not loaded yet. print '\nLoading blockchain...' BDM_LoadBlockchainFile() # can add optional arg for blk0001.dat location # Check that all addresses are actually in the specified wallet for addr in addrList: atype, addr160 = addrStr_to_hash160(addr, False) if not walletObj.hasAddr(addr160): raise WalletAddressError, 'Address is not in wallet! [%s]' % addr print '\nUpdating wallet from blockchain' walletObj.setBlockchainSyncFlag(BLOCKCHAIN_READONLY) walletObj.syncWithBlockchain() print 'Total Wallet Balance:',coin2str(walletObj.getBalance('Spendable')) print '\nCollecting Unspent TXOut List...' # getAddrTxOutList() returns a C++ vector object, which must # be converted to a python object using the [:] notation: it's a weird # consequence of mixing C++ code with python via SWIG... utxoList = [] for addr in addrList: atype, addr160 = addrStr_to_hash160(addr) if atype==P2SHBYTE: raise P2SHNotSupportedError unspentTxOuts = walletObj.getAddrTxOutList(addr160, 'Spendable') utxoList.extend(unspentTxOuts[:]) # Display what we found totalUtxo = sumTxOutList(utxoList) totalSpend = sum([pair[1] for pair in recipList]) print 'Available: %d unspent outputs from %d addresses: %s BTC' % \ (len(utxoList), len(addrList), coin2str(totalUtxo, ndec=2)) # Print more detailed information pprintUnspentTxOutList(utxoList, 'Available outputs: ') ############################################################################# # IF YOU WANT TO CHANGE THE PRIORITIZATION OF HOW COINS ARE SELECTED: # It's not dynamically customizable, yet. But you can # go into armoryengine.py and look for the WEIGHTS list # around line 4550. Change the values to change the # optimization. ############################################################################# # PySelectCoins() assumes that the remaining will be sent to a change addr print 'Selecting coins based on unspent outputs, recipients, fee...' selectedUtxoList = PySelectCoins(utxoList, totalSpend, fee) print 'Checking that minimum required fee is satisfied for this tx...' minValidFee = calcMinSuggestedFees(selectedUtxoList, totalSpend, fee, len(recipList))[1] if minValidFee>fee: print '***WARNING:' print 'This transaction requires a fee of at least %s BTC' % coin2str(minValidFee) print 'Sending of this transaction *will fail*. Will you increase the fee?' confirm = raw_input('Increase Fee [Y/n]:') if 'n' in confirm.lower(): print 'ABORTING' return None fee = minValidFee selectedUtxoList = PySelectCoins(utxoList, totalSpend, fee) # Convert address strings to Hash160 values (and make a copy, too) def extractHash160(astr): atype, addr160 = addrStr_to_hash160(astr, False) return addr160 recip160List = [(extractHash160(pair[0]), pair[1]) for pair in recipList] # Add a change output if necessary totalSelect = sumTxOutList(selectedUtxoList) totalChange = totalSelect - (totalSpend + fee) if totalChange < 0: print '***ERROR: you are trying to spend more than your balance!' return None elif totalChange!=0: # Need to add a change output, get from wallet if necessary if not changeAddr: changeAddr = walletObj.getNextUnusedAddress().getAddrStr() recip160List.append( (extractHash160(changeAddr), totalChange) ) print 'Creating Distribution Proposal (just an unsigned transaction)...' print [(hash160_to_addrStr(r),coin2str(v)) for r,v in recip160List] # ACR: To support P2SH in general, had to change createFromTxOutSelection # to take full scripts, not just hash160 values. Convert the list # before passing it in scrPairs = [[hash160_to_p2pkhash_script(r), v] for r,v in recip160List] txdp = PyTxDistProposal().createFromTxOutSelection(selectedUtxoList, scrPairs) return txdp ################################################################################ if __name__ == '__main__': walletFile = 'armory_29KADwa1D_.wallet' if not os.path.exists(walletFile): raise FileExistsError, 'Wallet file does not exist! [%s]' % walletFile wlt = PyBtcWallet().readWalletFile(walletFile) # Only use these addresses for this tx addrList = ['1dyRSCSJdRiPgGYNTSE31Lodvs3Peiiqx', \ '131t9NSPV3U1DdyQsEEcEzyyYsWrAcm1ZX'] # Send money to these three outputs (change will be added if/where necessary) recipList =[('12V6i8PHhxyYWSEeYsXNr9kzwca1GrW5T8', long(0.2*ONE_BTC)), \ ('14CDNme1pFJxLKitdSMqTNETPeLzs1V4RD', long(0.5*ONE_BTC)), \ ('16GsZYhzJiv5BHTQaosrwpSpf9Unw3eLuC', long(1.1*ONE_BTC)) ] # Works with or without a change address specified #sendChangeTo = '151kQbcEdBDehW5gt3fahrHwfBBtEjSSAx' sendChangeTo = None # Remember, must specify amounts in SATOSHIs print 'Creating Unsigned Transaction...' txdp = createTxFromAddrList(wlt, addrList, recipList, 50000, sendChangeTo) txdp.pprint() print 'Transaction created, now sign it...' if wlt.useEncryption and wlt.isLocked: passphrase = SecureBinaryData(getpass('Passphrase to unlock wallet: ')) wlt.unlock(securePassphrase=passphrase) passphrase.destroy() print 'Signing transaction with wallet...' wlt.signTxDistProposal(txdp) print 'Transaction is fully signed?', print txdp.checkTxHasEnoughSignatures(alsoVerify=True) print 'Preparing final transaction...' pytx = txdp.getPyTxSignedIfPossible() print '\nRaw transaction (pretty):' pprintHex(binary_to_hex(pytx.serialize())) print '\nRaw transaction (raw hex, copy into http://bitsend.rowit.co.uk):' print binary_to_hex(pytx.serialize()) print '\nSigned transaction to be broadcast using Armory "offline transactions"...' print txdp.serializeAscii() armory-0.92.3/extras/breakDownWallet.py0000644000000000000000000001220512414772654016575 0ustar rootrootfrom armoryengine.PyBtcWallet import (PyBtcWallet, WLT_DATATYPE_KEYDATA, \ WLT_UPDATE_ADD) import os import sys from CppBlockUtils import SecureBinaryData from armoryengine.ArmoryUtils import (binary_to_base58, RightNow, ADDRBYTE) from armoryengine.BinaryPacker import * import random ############################################################################### def createNewWallet(wlt, rootEntry, newWalletFilePath, withEncrypt, kdfParam=None): """ This method will create a new wallet, using as much customizability as you want. You can enable encryption, and set the target params of the key-derivation function (compute-time and max memory usage). The KDF parameters will be experimentally determined to be as hard as possible for your computer within the specified time target (default, 0.25s). It will aim for maximizing memory usage and using only 1 or 2 iterations of it, but this can be changed by scaling down the kdfMaxMem parameter (default 32 MB). If you use encryption, don't forget to supply a 32-byte passphrase, created via SecureBinaryData(pythonStr). This method will apply the passphrase so that the wallet is "born" encrypted. The field plainRootKey could be used to recover a written backup of a wallet, since all addresses are deterministically computed from the root address. This obviously won't reocver any imported keys, but does mean that you can recover your ENTIRE WALLET from only those 32 plaintext bytes AND the 32-byte chaincode. We skip the atomic file operations since we don't even have a wallet file yet to safely update. DO NOT CALL THIS FROM BDM METHOD. IT MAY DEADLOCK. """ # Create the root address object rootAddr = rootEntry # Update wallet object with the new data # NEW IN WALLET VERSION 1.35: unique ID is now based on # the first chained address: this guarantees that the unique ID # is based not only on the private key, BUT ALSO THE CHAIN CODE wlt.useEncryption = withEncrypt wlt.addrMap['ROOT'] = rootAddr wlt.uniqueIDBin = (ADDRBYTE + str(random.getrandbits(48))[:5])[::-1] wlt.uniqueIDB58 = binary_to_base58(wlt.uniqueIDBin) wlt.labelName = '' wlt.labelDescr = '' wlt.lastComputedChainAddr160 = rootAddr wlt.lastComputedChainIndex = 0 wlt.highestUsedChainIndex = 0 wlt.wltCreateDate = long(RightNow()) wlt.kdf = kdfParam # We don't have to worry about atomic file operations when # creating the wallet: so we just do it naively here. wlt.walletPath = newWalletFilePath newfile = open(newWalletFilePath, 'wb') fileData = BinaryPacker() # packHeader method writes KDF params and root address headerBytes = wlt.packHeader(fileData) newfile.write(fileData.getBinaryString()) newfile.close() ############################################################################### def breakDownWallet(walletPath, fragSize): print 'breaking down wallet in packs of %d addresses' % fragSize print 'reading wallet' theWallet = PyBtcWallet().readWalletFile(walletPath) nAddresses = len(theWallet.addrMap) addrIndex = 0 wltIndex = 1 if walletPath[-7:] == '.wallet': newDir = walletPath[:-7] else: newDir = os.path.dirname(walletPath) if not os.path.exists(newDir): os.mkdir(newDir) rootAddr = theWallet.addrMap['ROOT'] withEncrypt = theWallet.useEncryption addrIter = theWallet.addrMap.iteritems() while nAddresses > 0 : print 'breaking down wallet from address #%d to #%d' % (addrIndex, addrIndex +fragSize-1) nAddresses -= fragSize newWalletPath = os.path.join(newDir, 'armory_wlt_%05d_.wallet' % wltIndex) wltIndex += 1 walletFragment = PyBtcWallet() createNewWallet(walletFragment, rootAddr, newWalletPath, withEncrypt, theWallet.kdf) fileData = BinaryPacker() i=0 try: while i < fragSize: addrItem = addrIter.next()[1] addrItem.chainIndex = -2 fileData.put(BINARY_CHUNK, '\x00' + addrItem.addrStr20 + addrItem.serialize()) #walletFragment.walletFileSafeUpdate([[WLT_UPDATE_ADD, \ #WLT_DATATYPE_KEYDATA, addrItem.addrStr20, addrItem]]) i += 1 except StopIteration: pass walletFile = open(newWalletPath, 'ab') walletFile.write(fileData.getBinaryString()) walletFile.close() addrIndex += i print 'Done' ############################################################################################### if len(sys.argv) < 2: print 'not enough arguments' sys.exit(0) walletPath = sys.argv[1] if len(sys.argv) < 3: fragSize = 0 else: fragSize = int(sys.argv[2]) if not os.path.exists(walletPath): print 'invalid wallet path' sys.exit(0) if not isinstance(fragSize, int) or fragSize == 0: fragSize = 5000 breakDownWallet(walletPath, fragSize) armory-0.92.3/extras/lookathex.py0000644000000000000000000000031112414772654015501 0ustar rootrootfrom sys import argv, path path.append('..') path.append('.') from armoryengine import * with open(argv[1], 'rb') as f: f.seek(long(argv[2])) k = f.read(1024) pprintHex( binary_to_hex(k)) armory-0.92.3/extras/testnetNonStdScript.txt0000644000000000000000000022260712414772654017711 0ustar rootroot******************************************************************************** * All non-standard scripts found on the Bitcoin test-network ******************************************************************************** Attempting to interpret script: Block: 13139 Tx: 0 ThisOut: fb73d48b12d03053a03f5c01f18befcf7c8726532b274f4b8810eb169fcf4ddb, 0 Raw Script: 4704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac Raw Tx: 01000000010000000000000000000000000000000000000000000000000000000000000000ffffffff070428f21d1c010affffffff0100f2052a01000000494704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac00000000 pprint: [PUSHDATA -- 71 BYTES:] 04000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17 OP_CHECKSIG Attempting to interpret script: Block: 13140 Tx: 0 ThisOut: 2890d741a44aa2dfca0658f607c16a2492b5dedfe114c627389893c5c69ff2a2, 0 Raw Script: 4704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac Raw Tx: 01000000010000000000000000000000000000000000000000000000000000000000000000ffffffff070428f21d1c013dffffffff0100f2052a01000000494704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac00000000 pprint: [PUSHDATA -- 71 BYTES:] 04000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17 OP_CHECKSIG Attempting to interpret script: Block: 13141 Tx: 0 ThisOut: a45ba9d0f33ea665ab0843b77f9a14ade6b0ff89adfa9a1900f4a5b98390d22f, 0 Raw Script: 4704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac Raw Tx: 01000000010000000000000000000000000000000000000000000000000000000000000000ffffffff070428f21d1c0103ffffffff0100f2052a01000000494704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac00000000 pprint: [PUSHDATA -- 71 BYTES:] 04000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17 OP_CHECKSIG Attempting to interpret script: Block: 13142 Tx: 0 ThisOut: 91d0f8e8ddde6293289ba35ebaa604d784a30aa0ce49edba0b79f56e4e233935, 0 Raw Script: 4704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac Raw Tx: 01000000010000000000000000000000000000000000000000000000000000000000000000ffffffff070428f21d1c0154ffffffff0100f2052a01000000494704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac00000000 pprint: [PUSHDATA -- 71 BYTES:] 04000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17 OP_CHECKSIG Attempting to interpret script: Block: 13143 Tx: 0 ThisOut: dda05411c6346c97c0c6f04601b1ad6edfbe34209e5a954c31742a95c3edb37f, 0 Raw Script: 4704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac Raw Tx: 01000000010000000000000000000000000000000000000000000000000000000000000000ffffffff070428f21d1c0164ffffffff0100f2052a01000000494704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac00000000 pprint: [PUSHDATA -- 71 BYTES:] 04000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17 OP_CHECKSIG Attempting to interpret script: Block: 13144 Tx: 0 ThisOut: 7b0482065e2b123c466426abdaa0f6132e1353b540141252f419a0e3ec5bf864, 0 Raw Script: 4704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac Raw Tx: 01000000010000000000000000000000000000000000000000000000000000000000000000ffffffff070428f21d1c0173ffffffff0100f2052a01000000494704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac00000000 pprint: [PUSHDATA -- 71 BYTES:] 04000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17 OP_CHECKSIG Attempting to interpret script: Block: 13145 Tx: 0 ThisOut: cbbc7883500b53a604ee86479629049e637a3d9f948a32d5816d633f6aca39c2, 0 Raw Script: 4704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac Raw Tx: 01000000010000000000000000000000000000000000000000000000000000000000000000ffffffff070428f21d1c0128ffffffff0100f2052a01000000494704000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17ac00000000 pprint: [PUSHDATA -- 71 BYTES:] 04000a0342000443d955e20dac59a23ed7beea83a96667576853f6650a98e7afb11646c7d6599bd45946a3b4296aa2c6c04a78d2baf685d4a1fdd2729d2e90c1d1db1195adbd17 OP_CHECKSIG Attempting to interpret script: Block: 26474 Tx: 1 ThisOut: 2f654d4d1d7246d1a824c5b6c5177c0b5a1983864579aabb88cabd5d05e032e2, 1 Raw Script: 526b006b7dac7ca9143cd1def404e12a85ead2b4d3f5f9f817fb0d46ef879a6c936b7dac7ca9146a4e7d5f798e90e84db9244d4805459f87275943879a6c936b7dac7ca914486efdd300987a054510b4ce1148d4ad290d911e879a6c936b6c6ca2 Raw Tx: 010000000371c06e0639dbe6bc35e6f948da4874ae69d9d91934ec7c5366292d0cbd5f97b0010000008a47304402200117cdd3ec6259af29acea44db354a6f57ac10d8496782033f5fe0febfd77f1b02202ceb02d60dbb43e6d4e03e5b5fbadc031f8bbb3c6c34ad307939947987f600bf01410452d63c092209529ca2c75e056e947bc95f9daffb371e601b46d24377aaa3d004ab3c6be2d6d262b34d736b95f3b0ef6876826c93c4077d619c02ebd974c7facdffffffffa65aa866aa7743ec05ba61418015fc32ecabd99886732056f1d4454c8f762bf8000000008c493046022100ea0a9b41c9372837e52898205c7bebf86b28936a3ee725672d0ca8f434f876f0022100beb7243a51fbc0997e55cb519d3b9cbd59f7aba68d80ba1e8adbb53443cda3c00141043efd1ca3cffc50638031281d227ff347a3a27bc145e2f846891d29f87bc068c27710559c4d9cd71f7e9e763d6e2753172406eb1ed1fadcaf9a8972b4270f05b4ffffffffd866d14151ee1b733a2a7273f155ecb25c18303c31b2c4de5aa6080aef2e0006000000008b483045022052210f95f6b413c74ce12cfc1b14a36cb267f9fa3919fa6e20dade1cd570439f022100b9e5b325f312904804f043d06c6ebc8e4b1c6cd272856c48ab1736b9d562e10c01410423fdddfe7e4d70d762dd6596771e035f4b43d54d28c2231be1102056f81f067914fe4fb6fd6e3381228ee5587ddd2028c846025741e963d9b1d6cf2c2dea0dbcffffffff0210ef3200000000004341048a33e9fd2de28137574cc69fe5620199abe37b7d08a51c528876fe6c5fa7fc28535f5a667244445e79fffc9df85ec3d79d77693b1f37af0e2d7c1fa2e7113a48acc0d454070000000061526b006b7dac7ca9143cd1def404e12a85ead2b4d3f5f9f817fb0d46ef879a6c936b7dac7ca9146a4e7d5f798e90e84db9244d4805459f87275943879a6c936b7dac7ca914486efdd300987a054510b4ce1148d4ad290d911e879a6c936b6c6ca200000000 pprint: 2 OP_TOALTSTACK OP_0 OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 3cd1def404e12a85ead2b4d3f5f9f817fb0d46ef OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 6a4e7d5f798e90e84db9244d4805459f87275943 OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 486efdd300987a054510b4ce1148d4ad290d911e OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_FROMALTSTACK OP_FROMALTSTACK OP_GREATERTHANOREQUAL Attempting to interpret script: Block: 26478 Tx: 1 PrevOut: 2f654d4d1d7246d1a824c5b6c5177c0b5a1983864579aabb88cabd5d05e032e2, 1 Raw Script: 4730440220151ad44e7f78f9e0c4a3f2135c19ca3de8dbbb7c58893db096c0c5f1573d5dec02200724a78c3fa5f153103cb46816df46eb6cfac3718038607ddec344310066161e01410459fd82189b81772258a3fc723fdda900eb8193057d4a573ee5ad39e26b58b5c12c4a51b0edd01769f96ed1998221daf0df89634a7137a8fa312d5ccc95ed8925483045022100ca34834ece5925cff6c3d63e2bda6b0ce0685b18f481c32e70de9a971e85f12f0220572d0b5de0cf7b8d4e28f4914a955e301faaaa42f05feaa1cc63b45f938d75d9014104ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1483045022074e01e8225e8c4f9d0b3f86908d42a61e611f406e13817d16240f94f52f49359022100f4c768dd89c6435afd3834ae2c882465ade92d7e1cc5c2c2c3d8d25c41b3ea61014104ce66c9f5068b715b62cc1622572cd98a08812d8ca01563045263c3e7af6b997e603e8e62041c4eb82dfd386a3412c34c334c34eb3c76fb0e37483fc72323f807 Raw Tx: 01000000012f654d4d1d7246d1a824c5b6c5177c0b5a1983864579aabb88cabd5d05e032e201000000fda0014730440220151ad44e7f78f9e0c4a3f2135c19ca3de8dbbb7c58893db096c0c5f1573d5dec02200724a78c3fa5f153103cb46816df46eb6cfac3718038607ddec344310066161e01410459fd82189b81772258a3fc723fdda900eb8193057d4a573ee5ad39e26b58b5c12c4a51b0edd01769f96ed1998221daf0df89634a7137a8fa312d5ccc95ed8925483045022100ca34834ece5925cff6c3d63e2bda6b0ce0685b18f481c32e70de9a971e85f12f0220572d0b5de0cf7b8d4e28f4914a955e301faaaa42f05feaa1cc63b45f938d75d9014104ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1483045022074e01e8225e8c4f9d0b3f86908d42a61e611f406e13817d16240f94f52f49359022100f4c768dd89c6435afd3834ae2c882465ade92d7e1cc5c2c2c3d8d25c41b3ea61014104ce66c9f5068b715b62cc1622572cd98a08812d8ca01563045263c3e7af6b997e603e8e62041c4eb82dfd386a3412c34c334c34eb3c76fb0e37483fc72323f807ffffffff01b0ad5407000000001976a9146a4e7d5f798e90e84db9244d4805459f8727594388ac00000000 pprint: [PUSHDATA -- 71 BYTES:] 30440220151ad44e7f78f9e0c4a3f2135c19ca3de8dbbb7c58893db096c0c5f1573d5dec02200724a78c3fa5f153103cb46816df46eb6cfac3718038607ddec344310066161e01 [PUSHDATA -- 65 BYTES:] 0459fd82189b81772258a3fc723fdda900eb8193057d4a573ee5ad39e26b58b5c12c4a51b0edd01769f96ed1998221daf0df89634a7137a8fa312d5ccc95ed8925 [PUSHDATA -- 72 BYTES:] 3045022100ca34834ece5925cff6c3d63e2bda6b0ce0685b18f481c32e70de9a971e85f12f0220572d0b5de0cf7b8d4e28f4914a955e301faaaa42f05feaa1cc63b45f938d75d901 [PUSHDATA -- 65 BYTES:] 04ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1 [PUSHDATA -- 72 BYTES:] 3045022074e01e8225e8c4f9d0b3f86908d42a61e611f406e13817d16240f94f52f49359022100f4c768dd89c6435afd3834ae2c882465ade92d7e1cc5c2c2c3d8d25c41b3ea6101 [PUSHDATA -- 65 BYTES:] 04ce66c9f5068b715b62cc1622572cd98a08812d8ca01563045263c3e7af6b997e603e8e62041c4eb82dfd386a3412c34c334c34eb3c76fb0e37483fc72323f807 Attempting to interpret script: Block: 26522 Tx: 1 ThisOut: c97f50966de82dbff23db3ee15b4f51bb0a9cbbf9e6d812acacecfa530347110, 1 Raw Script: 536b006b7dac7ca9143cd1def404e12a85ead2b4d3f5f9f817fb0d46ef879a6c936b7dac7ca9146a4e7d5f798e90e84db9244d4805459f87275943879a6c936b7dac7ca914486efdd300987a054510b4ce1148d4ad290d911e879a6c936b6c6ca2 Raw Tx: 010000000209c926931997dcea83cf407946b0ef44f402264f9384f5d9455f8358c5a7c8a1000000008b483045022100a381a781a6be2df787dcff802b4cf2fb53efd8a4d3a6d332f98777fdcc0e59db022058a35688243a386acc374f43effc6a7372cff8166023bb0915f4cbaf87e0251e014104ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1ffffffff2f654d4d1d7246d1a824c5b6c5177c0b5a1983864579aabb88cabd5d05e032e20000000048473044022060769d4823cebe01b52215f8bf62f739d59643e392ae24e2b90659b310c189d402204525e01e3f56ba468cbeb9666a21d781bc702276aa0b02fe41f3a8429dd2653e01ffffffff0270c2220000000000434104ff3d57c57a8a00f90424f1ebdb30223853501c43a54ca3a231603a82cefd2fd6920f107b609d512f45446acf6cc863fae36cfe9d3c145d025207e4e95bd1cf58ac001764070000000061536b006b7dac7ca9143cd1def404e12a85ead2b4d3f5f9f817fb0d46ef879a6c936b7dac7ca9146a4e7d5f798e90e84db9244d4805459f87275943879a6c936b7dac7ca914486efdd300987a054510b4ce1148d4ad290d911e879a6c936b6c6ca200000000 pprint: 3 OP_TOALTSTACK OP_0 OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 3cd1def404e12a85ead2b4d3f5f9f817fb0d46ef OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 6a4e7d5f798e90e84db9244d4805459f87275943 OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 486efdd300987a054510b4ce1148d4ad290d911e OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_FROMALTSTACK OP_FROMALTSTACK OP_GREATERTHANOREQUAL Attempting to interpret script: Block: 26524 Tx: 1 PrevOut: c97f50966de82dbff23db3ee15b4f51bb0a9cbbf9e6d812acacecfa530347110, 1 Raw Script: 493046022100c6abd6466c0cca354bebe9e9fb200ebd2924726a390eec8d76643cbb7959a070022100a5e02686e49819644d1f10d39fd59a41eb5c6f7bc28923f65cad72651fc8131401410459fd82189b81772258a3fc723fdda900eb8193057d4a573ee5ad39e26b58b5c12c4a51b0edd01769f96ed1998221daf0df89634a7137a8fa312d5ccc95ed89254930460221008e238f15d45c1d3739a6c65b6ad9689837f01685d0ded7adbff139e479d4a802022100b19ea60db5fdfc228a07b6d6b5115e148b861cd1085c4db1546da913a35a3f64014104ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1483045022100cd58f567dba08d9f33c59efd7271e105ab19a2e9e9f7ec423d93b2c5759636ad02206f6512f67a40051c8dd5a3910b371246a409d7589afcf019cc3550bbfcc41416014104ce66c9f5068b715b62cc1622572cd98a08812d8ca01563045263c3e7af6b997e603e8e62041c4eb82dfd386a3412c34c334c34eb3c76fb0e37483fc72323f807 Raw Tx: 0100000001c97f50966de82dbff23db3ee15b4f51bb0a9cbbf9e6d812acacecfa53034711001000000fda301493046022100c6abd6466c0cca354bebe9e9fb200ebd2924726a390eec8d76643cbb7959a070022100a5e02686e49819644d1f10d39fd59a41eb5c6f7bc28923f65cad72651fc8131401410459fd82189b81772258a3fc723fdda900eb8193057d4a573ee5ad39e26b58b5c12c4a51b0edd01769f96ed1998221daf0df89634a7137a8fa312d5ccc95ed89254930460221008e238f15d45c1d3739a6c65b6ad9689837f01685d0ded7adbff139e479d4a802022100b19ea60db5fdfc228a07b6d6b5115e148b861cd1085c4db1546da913a35a3f64014104ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1483045022100cd58f567dba08d9f33c59efd7271e105ab19a2e9e9f7ec423d93b2c5759636ad02206f6512f67a40051c8dd5a3910b371246a409d7589afcf019cc3550bbfcc41416014104ce66c9f5068b715b62cc1622572cd98a08812d8ca01563045263c3e7af6b997e603e8e62041c4eb82dfd386a3412c34c334c34eb3c76fb0e37483fc72323f807ffffffff01f0ef6307000000001976a9146a4e7d5f798e90e84db9244d4805459f8727594388ac00000000 pprint: [PUSHDATA -- 73 BYTES:] 3046022100c6abd6466c0cca354bebe9e9fb200ebd2924726a390eec8d76643cbb7959a070022100a5e02686e49819644d1f10d39fd59a41eb5c6f7bc28923f65cad72651fc8131401 [PUSHDATA -- 65 BYTES:] 0459fd82189b81772258a3fc723fdda900eb8193057d4a573ee5ad39e26b58b5c12c4a51b0edd01769f96ed1998221daf0df89634a7137a8fa312d5ccc95ed8925 [PUSHDATA -- 73 BYTES:] 30460221008e238f15d45c1d3739a6c65b6ad9689837f01685d0ded7adbff139e479d4a802022100b19ea60db5fdfc228a07b6d6b5115e148b861cd1085c4db1546da913a35a3f6401 [PUSHDATA -- 65 BYTES:] 04ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1 [PUSHDATA -- 72 BYTES:] 3045022100cd58f567dba08d9f33c59efd7271e105ab19a2e9e9f7ec423d93b2c5759636ad02206f6512f67a40051c8dd5a3910b371246a409d7589afcf019cc3550bbfcc4141601 [PUSHDATA -- 65 BYTES:] 04ce66c9f5068b715b62cc1622572cd98a08812d8ca01563045263c3e7af6b997e603e8e62041c4eb82dfd386a3412c34c334c34eb3c76fb0e37483fc72323f807 Attempting to interpret script: Block: 26529 Tx: 1 ThisOut: 26fa0de665f9222f7700bc381f387240ebd365a63d4baa8c2b524c7f47e4c600, 1 Raw Script: 536b006b7dac7ca9143cd1def404e12a85ead2b4d3f5f9f817fb0d46ef879a6c936b7dac7ca9146a4e7d5f798e90e84db9244d4805459f87275943879a6c936b7dac7ca914354dd34bfaed9a9a50bbc783b6e53be3f66c94a8879a6c936b6c6ca2 Raw Tx: 01000000020442f0d46b0899af97eeaf6d414b70847e0fab9366636e7e6a499d593d534cd6000000008c4930460221008ebc795713c5c9c9330b30c36ed2aad0350d3aa0dc10c15204948a17498c28940221008de4712ec48bbc5b9bc7ba4dc6aa633f8aa1a73717ace8b7c55c57ad4711562b014104adaf83b83d93bbbd0b72472c1b2bfc047af03aa72b4c278087160ec93c014b9fe88fcaa4da44364e5742bdcf5cb2064f9117980de0c79ab391edf9c15cf6a398ffffffff2278122cd2e4efd5b03bb2e02abfb83f5f77f007dcf1c15e8deba66bebd864c5010000008c493046022100fe37b7822ce435a5312678b26a540c4acef5d073dda87409e2da732e9c43e3bc0221008571d44743904825e1245992e2cd97c9b1e83c8b4197661007ac74a595b8a4a9014104d88467e7b0e70d303193443ba2ca79b72b02a9a5053255a19762f26d87af8d59e9ac979d9841e543bb3fe3762c5aa579a17411a22f1c867ee248b206f08710f1ffffffff02705fe202000000004341041e7ad65c1f28b0095049d49229faaa17443ef92d067d717b247c37a6480d86b4aada2f63e58d2f3c6eee21d98fa34f14b50e3c48cc9fd23ecccdc18b9add19abac405973070000000061536b006b7dac7ca9143cd1def404e12a85ead2b4d3f5f9f817fb0d46ef879a6c936b7dac7ca9146a4e7d5f798e90e84db9244d4805459f87275943879a6c936b7dac7ca914354dd34bfaed9a9a50bbc783b6e53be3f66c94a8879a6c936b6c6ca200000000 pprint: 3 OP_TOALTSTACK OP_0 OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 3cd1def404e12a85ead2b4d3f5f9f817fb0d46ef OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 6a4e7d5f798e90e84db9244d4805459f87275943 OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 354dd34bfaed9a9a50bbc783b6e53be3f66c94a8 OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_FROMALTSTACK OP_FROMALTSTACK OP_GREATERTHANOREQUAL Attempting to interpret script: Block: 26537 Tx: 1 ThisOut: 89a0022c8291b4328338ec95179612b8ebf72067051de019a6084fb97eae0ebe, 1 Raw Script: 516b006b7dac7ca914af3781eca2ec6fa25b0fbadece761dfd76853064879a6c936b6c6ca2 Raw Tx: 010000000126fa0de665f9222f7700bc381f387240ebd365a63d4baa8c2b524c7f47e4c600000000004847304402205e41ba81c112820e421f0fa65aac9ffd72a82a064bbd460b4cf935b56e00cc350220080362bb328378aa1ba21d71830ea2a3eddeb2a2ebe01ef9b3806b3fd6557a9201ffffffff02609f45010000000043410442e5a4dc990fe4c7189cffc96395d8526d7c22dd1f4462659143f756a7905f276da809b8dbf24cd6cbaa3a01538b4c63228fa1de9df8b284ff591e0439122185acc0fc9b010000000025516b006b7dac7ca914af3781eca2ec6fa25b0fbadece761dfd76853064879a6c936b6c6ca200000000 pprint: 1 OP_TOALTSTACK OP_0 OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] af3781eca2ec6fa25b0fbadece761dfd76853064 OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_FROMALTSTACK OP_FROMALTSTACK OP_GREATERTHANOREQUAL Attempting to interpret script: Block: 26602 Tx: 7 ThisOut: 1c9608650a912be7fa88eecec664e6fbfa4b676708697fa99c28b3370005f32d, 1 Raw Script: 526b006b7dac7ca914fc1243972b59c1726735d3c5cca40e415039dce9879a6c936b7dac7ca914375dd72e03e7b5dbb49f7e843b7bef4a2cc2ce9e879a6c936b6c6ca2 Raw Tx: 010000000189a0022c8291b4328338ec95179612b8ebf72067051de019a6084fb97eae0ebe000000004a4930460221009627882154854e3de066943ba96faba02bb8b80c1670a0a30d0408caa49f03df022100b625414510a2a66ebb43fffa3f4023744695380847ee1073117ec90cb60f2c8301ffffffff0210c18d0000000000434104a701496f10db6aa8acbb6a7aa14d62f4925f8da03de7f0262010025945f6ebcc3efd55b6aa4bc6f811a0dc1bbdd2644bdd81c8a63766aa11f650cd7736bbcaf8ac001bb7000000000043526b006b7dac7ca914fc1243972b59c1726735d3c5cca40e415039dce9879a6c936b7dac7ca914375dd72e03e7b5dbb49f7e843b7bef4a2cc2ce9e879a6c936b6c6ca200000000 pprint: 2 OP_TOALTSTACK OP_0 OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] fc1243972b59c1726735d3c5cca40e415039dce9 OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 375dd72e03e7b5dbb49f7e843b7bef4a2cc2ce9e OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_FROMALTSTACK OP_FROMALTSTACK OP_GREATERTHANOREQUAL Attempting to interpret script: Block: 26670 Tx: 1 PrevOut: 1c9608650a912be7fa88eecec664e6fbfa4b676708697fa99c28b3370005f32d, 1 Raw Script: 483045022017462c29efc9158cf26f2070d444bb2b087b8a0e6287a9274fa36fad30c46485022100c6d4cc6cd504f768389637df71c1ccd452e0691348d0f418130c31da8cc2a6e8014104e83c1d4079a1b36417f0544063eadbc44833a992b9667ab29b4ff252d8287687bad7581581ae385854d4e5f1fcedce7de12b1aec1cb004cabb2ec1f3de9b2e60493046022100fdc7beb27de0c3a53fbf96df7ccf9518c5fe7873eeed413ce17e4c0e8bf9c06e022100cc15103b3c2e1f49d066897fe681a12e397e87ed7ee39f1c8c4a5fef30f4c2c60141047cf315904fcc2e3e2465153d39019e0d66a8aaec1cec1178feb10d46537427239fd64b81e41651e89b89fefe6a23561d25dddc835395dd3542f83b32a1906aeb Raw Tx: 01000000011c9608650a912be7fa88eecec664e6fbfa4b676708697fa99c28b3370005f32d01000000fd1701483045022017462c29efc9158cf26f2070d444bb2b087b8a0e6287a9274fa36fad30c46485022100c6d4cc6cd504f768389637df71c1ccd452e0691348d0f418130c31da8cc2a6e8014104e83c1d4079a1b36417f0544063eadbc44833a992b9667ab29b4ff252d8287687bad7581581ae385854d4e5f1fcedce7de12b1aec1cb004cabb2ec1f3de9b2e60493046022100fdc7beb27de0c3a53fbf96df7ccf9518c5fe7873eeed413ce17e4c0e8bf9c06e022100cc15103b3c2e1f49d066897fe681a12e397e87ed7ee39f1c8c4a5fef30f4c2c60141047cf315904fcc2e3e2465153d39019e0d66a8aaec1cec1178feb10d46537427239fd64b81e41651e89b89fefe6a23561d25dddc835395dd3542f83b32a1906aebffffffff01c0d8a700000000001976a914fc1243972b59c1726735d3c5cca40e415039dce988ac00000000 pprint: [PUSHDATA -- 72 BYTES:] 3045022017462c29efc9158cf26f2070d444bb2b087b8a0e6287a9274fa36fad30c46485022100c6d4cc6cd504f768389637df71c1ccd452e0691348d0f418130c31da8cc2a6e801 [PUSHDATA -- 65 BYTES:] 04e83c1d4079a1b36417f0544063eadbc44833a992b9667ab29b4ff252d8287687bad7581581ae385854d4e5f1fcedce7de12b1aec1cb004cabb2ec1f3de9b2e60 [PUSHDATA -- 73 BYTES:] 3046022100fdc7beb27de0c3a53fbf96df7ccf9518c5fe7873eeed413ce17e4c0e8bf9c06e022100cc15103b3c2e1f49d066897fe681a12e397e87ed7ee39f1c8c4a5fef30f4c2c601 [PUSHDATA -- 65 BYTES:] 047cf315904fcc2e3e2465153d39019e0d66a8aaec1cec1178feb10d46537427239fd64b81e41651e89b89fefe6a23561d25dddc835395dd3542f83b32a1906aeb Attempting to interpret script: Block: 26776 Tx: 1 ThisOut: ff7cf8b2e1640fcfbd32392984291dda51fc85791464d069d0bbc4eaf2f92dec, 1 Raw Script: 516b006b7dac7ca91401a1fe614c7bb4672ad80c268fdd0a442e655977879a6c936b6c6ca2 Raw Tx: 010000000197b7764a5cb49b3a6a7fc3b36533b912cb05257b0b16a93d701580ecd498036f000000008a473044022071d33cc504c30db6614952e143ee98aadfc413046d68728bec980474c5746d310220179f48a1d100719ee06b5865b39a64499044bedb7b3dfafd29b1e97909d4b0820141040dbe34a8cb5ac1e53a149f38589c141b8307c2b8876e851f7b8ece035483a4f9bf2899840675496f91c996c064224cdc909ca0ab1490652ad8d5189e757f16abffffffff02703e140600000000434104518092f2ca0eb9ca487e0d48b053cf894ac44d286fea70c2b2c021fc4abb61004332420b539316084b2a2796305517f2a77feca4af6db465c39934df9ea99f87ac809698000000000025516b006b7dac7ca91401a1fe614c7bb4672ad80c268fdd0a442e655977879a6c936b6c6ca200000000 pprint: 1 OP_TOALTSTACK OP_0 OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 01a1fe614c7bb4672ad80c268fdd0a442e655977 OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_FROMALTSTACK OP_FROMALTSTACK OP_GREATERTHANOREQUAL Attempting to interpret script: Block: 26791 Tx: 1 ThisOut: 62924cf341e369a61d51905dbe01e289e8f1bd2cdf703741a39e90d6620c72e9, 1 Raw Script: 516b006b7dac7ca914825736d3a8f6e6133fa5c695f19509bd905be189879a6c936b6c6ca2 Raw Tx: 0100000001ff7cf8b2e1640fcfbd32392984291dda51fc85791464d069d0bbc4eaf2f92dec00000000484730440220023b7b19a500d28ad5a3e09fbe807fc83f499bcb8b1650fe84219c492c41dc6c022004a67cafbc87dfb983a0a2e48d6db2ffc88f75ea3ee9be0150fb1ec5ef9034da01ffffffff02b0656c0500000000434104b48dc2c3da4c7ddfe46c6620ce10e7d0c641d376c43fd32f3700573cd244aee26375e08667c77c9d6274041d05ef013ee1515ff89b1d414dcdd1d5b12cd1ec74ac809698000000000025516b006b7dac7ca914825736d3a8f6e6133fa5c695f19509bd905be189879a6c936b6c6ca200000000 pprint: 1 OP_TOALTSTACK OP_0 OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 825736d3a8f6e6133fa5c695f19509bd905be189 OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_FROMALTSTACK OP_FROMALTSTACK OP_GREATERTHANOREQUAL Attempting to interpret script: Block: 26796 Tx: 2 ThisOut: c8ae8f54587ca548f3c7eb9ad72848df27d344ffd6f59f0d489b34f7cd8d6581, 1 Raw Script: 516b006b7dac7ca9146ff89453da0dd528e3f9368b6f50aa9b9ab4d0aa879a6c936b6c6ca2 Raw Tx: 010000000162924cf341e369a61d51905dbe01e289e8f1bd2cdf703741a39e90d6620c72e900000000494830450221008131502e0e1bef6b92c35630f9b94945e2d4d8c822e1defc79020f176c4ba1f402200dc8827663e2b3d74bd50393c916e11c9b93c6a29b33703e0e2807003e73c10801ffffffff02f08cc40400000000434104ba54af19b40351cba85c3a09865347344033cfb196c0001125180d08ce6b7d78026367a9603e377977ade8495da1a5540895c024ca2839ef312ce20c5e809cdbac809698000000000025516b006b7dac7ca9146ff89453da0dd528e3f9368b6f50aa9b9ab4d0aa879a6c936b6c6ca200000000 pprint: 1 OP_TOALTSTACK OP_0 OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 6ff89453da0dd528e3f9368b6f50aa9b9ab4d0aa OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_FROMALTSTACK OP_FROMALTSTACK OP_GREATERTHANOREQUAL Attempting to interpret script: Block: 28379 Tx: 1 ThisOut: 5f40a4d67c2b3e119aa365dec253cab63bef2c8ea65fcadccad1dd7f9ee30db4, 1 Raw Script: 516b006b7dac7ca914520639a2d5c1203c20dc69dda871b677565ac39a879a6c936b7dac7ca914520639a2d5c1203c20dc69dda871b677565ac39a879a6c936b6c6ca2 Raw Tx: 01000000011c9608650a912be7fa88eecec664e6fbfa4b676708697fa99c28b3370005f32d0000000048473044022069ec3e1378dbc764120ca8029c6937befbd182568047fb509c62ecc7fbb247e7022079aa03e418c4ef184b313a3fe55fa429ed168b639f55d4cef22d48d4709f27af01ffffffff02903c6f00000000004341049e77272fd2c61df8adcedfde8d9a1240944df9d1c1b6160e0ffbdab8d351dd55d35273fd5fa2def4ee3b55bef52221fa992b8bc0fa321595c6df3c8068e26d51ac40420f000000000043516b006b7dac7ca914520639a2d5c1203c20dc69dda871b677565ac39a879a6c936b7dac7ca914520639a2d5c1203c20dc69dda871b677565ac39a879a6c936b6c6ca200000000 pprint: 1 OP_TOALTSTACK OP_0 OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 520639a2d5c1203c20dc69dda871b677565ac39a OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 520639a2d5c1203c20dc69dda871b677565ac39a OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_FROMALTSTACK OP_FROMALTSTACK OP_GREATERTHANOREQUAL Attempting to interpret script: Block: 28379 Tx: 2 ThisOut: e5f37d6e4513d68988dc4e8e104f39870be03e4394e06d41ac7802c11353a56a, 1 Raw Script: 516b006b7dac7ca914520639a2d5c1203c20dc69dda871b677565ac39a879a6c936b7dac7ca914520639a2d5c1203c20dc69dda871b677565ac39a879a6c936b6c6ca2 Raw Tx: 0100000002c97f50966de82dbff23db3ee15b4f51bb0a9cbbf9e6d812acacecfa5303471100000000048473044022025a9a14f4f6aebe7780a5b3335d90304e5e0e5e642f8c78ddada17ab4313ef42022034c98f1e13684156b3f0cbd7e451525bf6d5cfe1214df283d3567dba98897f8401ffffffff628b24833f8c84559c945b962114f255f6c6583ce3574445aed7630b02e0c586010000008c493046022100acaddb13aa57930347845060a1761b5d4eecb2cfea4de6015b1cd9caccecc7aa022100e8c32bac85e91ba7b5988cbc4f4ffc075bef9a59e2fcd02f60b1147b7743bcc0014104768e591a060541db7c14473df8e626f45bcab6336606ed52fee8c4ce48434ccefdee82ce455a94ebb5f0b5b5a232579e9eca82916beceb6ce02077e9a4b5b40fffffffff023080130000000000434104fccb1ed0a9b89611f0f46368adab1ae700453d3f7f6a2667578372105c553682fb9f812f8aa648b2d9bf91f88b1b193f2cda6c6975567a39fb49acff00982ccaac809698000000000043516b006b7dac7ca914520639a2d5c1203c20dc69dda871b677565ac39a879a6c936b7dac7ca914520639a2d5c1203c20dc69dda871b677565ac39a879a6c936b6c6ca200000000 pprint: 1 OP_TOALTSTACK OP_0 OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 520639a2d5c1203c20dc69dda871b677565ac39a OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 520639a2d5c1203c20dc69dda871b677565ac39a OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_FROMALTSTACK OP_FROMALTSTACK OP_GREATERTHANOREQUAL Attempting to interpret script: Block: 28389 Tx: 1 PrevOut: 5f40a4d67c2b3e119aa365dec253cab63bef2c8ea65fcadccad1dd7f9ee30db4, 1 Raw Script: 493046022100e399242383fa3930997b70b8c2f18426ec843eab537a78fe4bd61764c596393e0221009f27c09adbb4ba82a5b52a8b4ccf8388019cb76f12ca8eb4dea1d3b45221a764014104768e591a060541db7c14473df8e626f45bcab6336606ed52fee8c4ce48434ccefdee82ce455a94ebb5f0b5b5a232579e9eca82916beceb6ce02077e9a4b5b40f493046022100993cf3fe226ac9d678c31d771bd2197798dd03951ad2ad7743a5963487a2410b0221008cadc43ea2da9e7383d803b5f8c523b113ae0c6fa2c52ad8bcba358dda4e7d9b014104768e591a060541db7c14473df8e626f45bcab6336606ed52fee8c4ce48434ccefdee82ce455a94ebb5f0b5b5a232579e9eca82916beceb6ce02077e9a4b5b40f Raw Tx: 01000000015f40a4d67c2b3e119aa365dec253cab63bef2c8ea65fcadccad1dd7f9ee30db401000000fd1801493046022100e399242383fa3930997b70b8c2f18426ec843eab537a78fe4bd61764c596393e0221009f27c09adbb4ba82a5b52a8b4ccf8388019cb76f12ca8eb4dea1d3b45221a764014104768e591a060541db7c14473df8e626f45bcab6336606ed52fee8c4ce48434ccefdee82ce455a94ebb5f0b5b5a232579e9eca82916beceb6ce02077e9a4b5b40f493046022100993cf3fe226ac9d678c31d771bd2197798dd03951ad2ad7743a5963487a2410b0221008cadc43ea2da9e7383d803b5f8c523b113ae0c6fa2c52ad8bcba358dda4e7d9b014104768e591a060541db7c14473df8e626f45bcab6336606ed52fee8c4ce48434ccefdee82ce455a94ebb5f0b5b5a232579e9eca82916beceb6ce02077e9a4b5b40fffffffff0100000000000000001976a914520639a2d5c1203c20dc69dda871b677565ac39a88ac00000000 pprint: [PUSHDATA -- 73 BYTES:] 3046022100e399242383fa3930997b70b8c2f18426ec843eab537a78fe4bd61764c596393e0221009f27c09adbb4ba82a5b52a8b4ccf8388019cb76f12ca8eb4dea1d3b45221a76401 [PUSHDATA -- 65 BYTES:] 04768e591a060541db7c14473df8e626f45bcab6336606ed52fee8c4ce48434ccefdee82ce455a94ebb5f0b5b5a232579e9eca82916beceb6ce02077e9a4b5b40f [PUSHDATA -- 73 BYTES:] 3046022100993cf3fe226ac9d678c31d771bd2197798dd03951ad2ad7743a5963487a2410b0221008cadc43ea2da9e7383d803b5f8c523b113ae0c6fa2c52ad8bcba358dda4e7d9b01 [PUSHDATA -- 65 BYTES:] 04768e591a060541db7c14473df8e626f45bcab6336606ed52fee8c4ce48434ccefdee82ce455a94ebb5f0b5b5a232579e9eca82916beceb6ce02077e9a4b5b40f Attempting to interpret script: Block: 30297 Tx: 1 ThisOut: bb664ff716b9dfc831bcc666c1767f362ad467fcfbaf4961de92e45547daab87, 1 Raw Script: 537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae Raw Tx: 0100000001845ad165bdc0f9b5829cf5a594c4148dfd89e24756303f3a8dabeb597afa589b010000008b483045022063c233df8efa3d1885e069e375a8eabf16b23475ef21bdc9628a513ee4caceb702210090a102c7b602043e72b34a154d495ac19b3b9e42acb962c399451f2baead8f4c014104b38f79037ad25b84a564eaf53ede93dec70b35216e6682aa71a47cefa2996ec49acfbb0a8730577c62ef9a7cc20c740aaaaee75419bef9640a4216c2b49c42d3ffffffff02000c022900000000434104c08c0a71ccbe838403e3870aa1ab871b0ab3a6014b0ba41f6df2b9aefea73134ecaa0b27797620e402a33799e9047f86519d9e43bbd504cf753c293752933f4fac406f40010000000062537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae00000000 pprint: 3 OP_ROLL OP_DUP 2 OP_GREATERTHANOREQUAL OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 80677c5392220db736455533477d0bc2fba65502 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 02d7aa2e76d9066fb2b3c41ff8839a5c81bdca19 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 10039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_CHECKMULTISIG Attempting to interpret script: Block: 30297 Tx: 2 ThisOut: fcf73a05d4f3a6eb17c61d5b704056c7a47cd1371481976efafee76caf0294d1, 1 Raw Script: 537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae Raw Tx: 0100000001eb412b08755bfe42b7b3c132a7b43bdf4e2986520049ea06239f7d48c73ab3a3010000008a473044022016858b359be6969d9df3cd346a8c44e93fc1cf72f7700752d5658aa42a22e81602201b21643fe86489069e63fa33d14dc343a3276b0bf64880445944b58e7bbcecbb014104b38f79037ad25b84a564eaf53ede93dec70b35216e6682aa71a47cefa2996ec49acfbb0a8730577c62ef9a7cc20c740aaaaee75419bef9640a4216c2b49c42d3ffffffff02c0d682220000000043410481567eabebd0114c3f1795eb53bf7682ad1b30b99c7c138b91fb842b805143ced9cc6328cf02d544d9c7492c736861c1ec8db1e31606dad0d7d071ba7bdb000dac002d31010000000062537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae00000000 pprint: 3 OP_ROLL OP_DUP 2 OP_GREATERTHANOREQUAL OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 80677c5392220db736455533477d0bc2fba65502 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 02d7aa2e76d9066fb2b3c41ff8839a5c81bdca19 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 10039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_CHECKMULTISIG Attempting to interpret script: Block: 30297 Tx: 3 ThisOut: ca618ee16cc9c6132b839aac7f5dc66bb822b4c7e398bc5e5efa25d5d3bf871a, 1 Raw Script: 527a7651a269527a829178a914731cdb75c88a01cbb96729888f726b3b9f29277a879b69527a829178a914e9b4261c6122f8957683636548923acc069e8141879b6952ae Raw Tx: 0100000001628b24833f8c84559c945b962114f255f6c6583ce3574445aed7630b02e0c586000000008c493046022100defaededead339ec51529f3eb060fba2172644c1fbea58700aa4333310ec50530221009ccf905f56f4a7b1810fb9478d1c4aa0fc077e7f35cf22dc1983b193cf1ce855014104f3a4724ba206eb4b516acb179b2f9b08d7b2c62c0323e3a8344977c525d6fed0672e6c527606b3ecc1d58eebe56a5788ecddd88adc1e7d0fbf6b3a2ebb88b206ffffffff0270db74030000000043410437c0e608f3e10422c219653e438c02eff3c56985e06b2cdad1ef71951c88f9827521689f77f10e7a615420d570895b803fc247487a0b1b1cec2871bd0847f9b5ac809698000000000044527a7651a269527a829178a914731cdb75c88a01cbb96729888f726b3b9f29277a879b69527a829178a914e9b4261c6122f8957683636548923acc069e8141879b6952ae00000000 pprint: 2 OP_ROLL OP_DUP 1 OP_GREATERTHANOREQUAL OP_VERIFY 2 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 731cdb75c88a01cbb96729888f726b3b9f29277a OP_EQUAL OP_BOOLOR OP_VERIFY 2 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] e9b4261c6122f8957683636548923acc069e8141 OP_EQUAL OP_BOOLOR OP_VERIFY 2 OP_CHECKMULTISIG Attempting to interpret script: Block: 30297 Tx: 5 ThisOut: 095f02076ffa4d7b9f895e7787ad3931478a5a4331533f61f833c2a55d229dec, 1 Raw Script: 527a7651a269527a829178a914731cdb75c88a01cbb96729888f726b3b9f29277a879b69527a829178a9141a8a801d57d169fbac759adc2c537b2bf2225b72879b6952ae Raw Tx: 01000000015f40a4d67c2b3e119aa365dec253cab63bef2c8ea65fcadccad1dd7f9ee30db40000000048473044022064dc2cd8829a716fbca96bdd100ab1c84d1bef123871da94e2c9423a06350b57022043171f6beb58b0d547f699639d9c972343dff6c9c36cbf1976c30c3340d0850201ffffffff0210b850000000000043410496e71a3388bb2f18e3f6c439bb73fe9544f7e8c885241cf11d6cbd7e50ee8aa550eeeec28537a38f50371a6021d683bc62aa7e155cd92172950909be4445cee9ac40420f000000000044527a7651a269527a829178a914731cdb75c88a01cbb96729888f726b3b9f29277a879b69527a829178a9141a8a801d57d169fbac759adc2c537b2bf2225b72879b6952ae00000000 pprint: 2 OP_ROLL OP_DUP 1 OP_GREATERTHANOREQUAL OP_VERIFY 2 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 731cdb75c88a01cbb96729888f726b3b9f29277a OP_EQUAL OP_BOOLOR OP_VERIFY 2 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 1a8a801d57d169fbac759adc2c537b2bf2225b72 OP_EQUAL OP_BOOLOR OP_VERIFY 2 OP_CHECKMULTISIG Attempting to interpret script: Block: 30297 Tx: 6 ThisOut: b077ffd61fdfcc63dec01172ef59c432a73b26991bf495695ee2c0549802cfc1, 1 Raw Script: 537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae Raw Tx: 0100000001394f854b1062f95c3a34124c834315dbb489b1af428e8ad21790046e7571c0ea000000008a473044022043997d6e1a0d42d2c77d6e9d809e34db55fc922c910f46dac2d0e84b39af468202207a9a8ccef794b5e5353c5ae33a513fb3393fb890dbbb4a8bc1c6a84e936470c201410411af01a9c44ab38e0f3540951f2d297b227a070373d66dffc13705ce9d2a83299ec0b7dddb99298fe971a64af1c037e707f574898eeedc8183c292a1377c3a62ffffffff0280b37d1c00000000434104edec54ae8e1b2d36906b00c1717c847a6dc6ebac38626e80cc44cfb2972e7f24991dd29f17254edf5f732e963a2fc07e597973b517dc058da5a4a287a93023a3ac809698000000000062537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae00000000 pprint: 3 OP_ROLL OP_DUP 2 OP_GREATERTHANOREQUAL OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 80677c5392220db736455533477d0bc2fba65502 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 02d7aa2e76d9066fb2b3c41ff8839a5c81bdca19 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 10039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_CHECKMULTISIG Attempting to interpret script: Block: 30297 Tx: 9 ThisOut: 36430cc6d6ae9bc4868b26132f24252f80a5586a8b246d77365d1b193cfe1884, 1 Raw Script: 537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae4d1001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000075 Raw Tx: 0100000001445040326a69eb8e1cfd89ee128c33620fc9c853de6558c814238107d5a4a336010000008a47304402201ccb3b5623614eca0806d94daa71eb21794c45e35021489acfe20800a507d58e0220334f8150c4dcb6441eb90b4d82a59b3daa6d81baa006693dbe19a394fb75ffe60141048c006ff0d2cfde86455086af5a25b88c2b81858aab67f6a3132c885a2cb9ec38e700576fd46c7d72d7d22555eee3a14e2876c643cd70b1b0a77fbf46e62331acffffffff0230e511010000000043410492363f74e00e08e6605abb0746d6267cdfff6a1c62bbe1571087394e74854a6c3cc1efc52310fbc116b24a89ade5cfb63bdbf9386eb8d2c7fc61f50e5faa58bfac404b4c0000000000fd7601537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae4d100100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007500000000 pprint: 3 OP_ROLL OP_DUP 2 OP_GREATERTHANOREQUAL OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 80677c5392220db736455533477d0bc2fba65502 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 02d7aa2e76d9066fb2b3c41ff8839a5c81bdca19 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 10039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_CHECKMULTISIG [OP_PUSHDATA2 -- 272 BYTES:] 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000... OP_DROP Attempting to interpret script: Block: 30301 Tx: 6 PrevOut: bb664ff716b9dfc831bcc666c1767f362ad467fcfbaf4961de92e45547daab87, 1 Raw Script: 00493046022100d73f633f114e0e0b324d87d38d34f22966a03b072803afa99c9408201f6d6dc6022100900e85be52ad2278d24e7edbb7269367f5f2d6f1bd338d017ca460008776614401473044022071fef8ac0aa6318817dbd242bf51fb5b75be312aa31ecb44a0afe7b49fcf840302204c223179a383bb6fcb80312ac66e473345065f7d9136f9662d867acf96c12a42015241048c006ff0d2cfde86455086af5a25b88c2b81858aab67f6a3132c885a2cb9ec38e700576fd46c7d72d7d22555eee3a14e2876c643cd70b1b0a77fbf46e62331ac4104b68ef7d8f24d45e1771101e269c0aacf8d3ed7ebe12b65521712bba768ef53e1e84fff3afbee360acea0d1f461c013557f71d426ac17a293c5eebf06e468253e00 Raw Tx: 0100000001bb664ff716b9dfc831bcc666c1767f362ad467fcfbaf4961de92e45547daab8701000000fd190100493046022100d73f633f114e0e0b324d87d38d34f22966a03b072803afa99c9408201f6d6dc6022100900e85be52ad2278d24e7edbb7269367f5f2d6f1bd338d017ca460008776614401473044022071fef8ac0aa6318817dbd242bf51fb5b75be312aa31ecb44a0afe7b49fcf840302204c223179a383bb6fcb80312ac66e473345065f7d9136f9662d867acf96c12a42015241048c006ff0d2cfde86455086af5a25b88c2b81858aab67f6a3132c885a2cb9ec38e700576fd46c7d72d7d22555eee3a14e2876c643cd70b1b0a77fbf46e62331ac4104b68ef7d8f24d45e1771101e269c0aacf8d3ed7ebe12b65521712bba768ef53e1e84fff3afbee360acea0d1f461c013557f71d426ac17a293c5eebf06e468253e00ffffffff0280969800000000001976a9140817482d2e97e4be877efe59f4bae108564549f188ac7015a7000000000062537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae00000000 pprint: OP_0 [PUSHDATA -- 73 BYTES:] 3046022100d73f633f114e0e0b324d87d38d34f22966a03b072803afa99c9408201f6d6dc6022100900e85be52ad2278d24e7edbb7269367f5f2d6f1bd338d017ca460008776614401 [PUSHDATA -- 71 BYTES:] 3044022071fef8ac0aa6318817dbd242bf51fb5b75be312aa31ecb44a0afe7b49fcf840302204c223179a383bb6fcb80312ac66e473345065f7d9136f9662d867acf96c12a4201 2 [PUSHDATA -- 65 BYTES:] 048c006ff0d2cfde86455086af5a25b88c2b81858aab67f6a3132c885a2cb9ec38e700576fd46c7d72d7d22555eee3a14e2876c643cd70b1b0a77fbf46e62331ac [PUSHDATA -- 65 BYTES:] 04b68ef7d8f24d45e1771101e269c0aacf8d3ed7ebe12b65521712bba768ef53e1e84fff3afbee360acea0d1f461c013557f71d426ac17a293c5eebf06e468253e OP_0 Attempting to interpret script: Block: 30301 Tx: 6 ThisOut: 5f0fdf6fb87c1da740917bc183fcf589735c6da5d895136d32ed5928f5217ba1, 1 Raw Script: 537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae Raw Tx: 0100000001bb664ff716b9dfc831bcc666c1767f362ad467fcfbaf4961de92e45547daab8701000000fd190100493046022100d73f633f114e0e0b324d87d38d34f22966a03b072803afa99c9408201f6d6dc6022100900e85be52ad2278d24e7edbb7269367f5f2d6f1bd338d017ca460008776614401473044022071fef8ac0aa6318817dbd242bf51fb5b75be312aa31ecb44a0afe7b49fcf840302204c223179a383bb6fcb80312ac66e473345065f7d9136f9662d867acf96c12a42015241048c006ff0d2cfde86455086af5a25b88c2b81858aab67f6a3132c885a2cb9ec38e700576fd46c7d72d7d22555eee3a14e2876c643cd70b1b0a77fbf46e62331ac4104b68ef7d8f24d45e1771101e269c0aacf8d3ed7ebe12b65521712bba768ef53e1e84fff3afbee360acea0d1f461c013557f71d426ac17a293c5eebf06e468253e00ffffffff0280969800000000001976a9140817482d2e97e4be877efe59f4bae108564549f188ac7015a7000000000062537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae00000000 pprint: 3 OP_ROLL OP_DUP 2 OP_GREATERTHANOREQUAL OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 80677c5392220db736455533477d0bc2fba65502 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 02d7aa2e76d9066fb2b3c41ff8839a5c81bdca19 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 10039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_CHECKMULTISIG Attempting to interpret script: Block: 32065 Tx: 6 ThisOut: 26e71b89ad2bf8f5d634d0b9f6a6302abdc14877fdc4115a2429c7fc4168f4d6, 1 Raw Script: 401b0810f034dbf51f06c73c409417683fe127d44bd9f2e7533d59524af007951b0bb0c81038429a4ac2eaf938e9c8f35f02ce55f2f9de912137f8b60b314d7bd3ac Raw Tx: 0100000001ae516ac64815290e8aa926df83daba5b80e9c68ddc5ddb564c46160ad49cd61a010000008b48304502201d8fced732cecf743aed28b281357ddae11519099c1b331c6fa519daad02d9060221008535663d0d1123fb7150b707e862ef5ff133b8c670104420a6a093c073e0e4c70141041ba69468b84b7ba15c94f3f19a7872b4702747b35412366c06017e920b707f3521f158d615ab28c0e753b7fbb9c6dde3b8aea7b843e7c3d4793ab5ad79fc4bb3ffffffff024054890000000000434104dd318c308241d3b72bef26e74060aa8a91ad094fd6a9f722c90344c4092ec230947d50488c5ffe58eb5ce956ffe2072edc4b3233f5436c831da21f5f81a1e3f9ac40420f000000000042401b0810f034dbf51f06c73c409417683fe127d44bd9f2e7533d59524af007951b0bb0c81038429a4ac2eaf938e9c8f35f02ce55f2f9de912137f8b60b314d7bd3ac00000000 pprint: [PUSHDATA -- 64 BYTES:] 1b0810f034dbf51f06c73c409417683fe127d44bd9f2e7533d59524af007951b0bb0c81038429a4ac2eaf938e9c8f35f02ce55f2f9de912137f8b60b314d7bd3 OP_CHECKSIG Attempting to interpret script: Block: 35941 Tx: 4 ThisOut: 8389d7ea8ba3a279054d8a53500343f386222fec5130b7a1c87658fbe8e73fcf, 0 Raw Script: 03626f627576a914f5d746b03deb461dbb9712d847e495c462801acf88ac Raw Tx: 01000000010201012e87195246eb135545cebf555438052e590063c7af12e2cd9f14009d62010000008b483045022100f9bd6643ee402e3bf5467f9b3922518fbf96aae7033e2c190dabeed5ce5c6bbd02207fe1c1d2985604eca9ad5b5b15049844cd95b7c02ff4270b5bcb7d1759ce47ab014104ca6a38d3c323ab84893e95b1c902aa796626e89f2c299d4de66e6fd8f74a760f367753d67a95631aa04a2ffd6a7b140b743ce964b9bbd6d24bd8284e89cc0a45ffffffff0100e1f505000000001e03626f627576a914f5d746b03deb461dbb9712d847e495c462801acf88ac00000000 pprint: [PUSHDATA -- 3 BYTES:] 626f62 OP_DROP OP_DUP OP_HASH160 [PUSHDATA -- 20 BYTES:] f5d746b03deb461dbb9712d847e495c462801acf OP_EQUALVERIFY OP_CHECKSIG Attempting to interpret script: Block: 35941 Tx: 5 ThisOut: 1f998500c3be02ef5e5cecfff43178b46843abf11a3e4ccb42db5a04108d2bb2, 0 Raw Script: 03626f627576a914f5d746b03deb461dbb9712d847e495c462801acf88ac Raw Tx: 0100000001dfd3da8cbd23dc5a81a3cf9ebe2fbc2a3d46b1223f55d5ac4f4e175a45121f96010000008b48304502203c6f3d0824681fc533df1e24270cbf2db134e3d23f2d318a8ee568418cb8c4a9022100fccb6e96706a5b17b1bbebd0eda27bee8cc5bcf7bc25f57415b4a93e87ae0ed3014104ca6a38d3c323ab84893e95b1c902aa796626e89f2c299d4de66e6fd8f74a760f367753d67a95631aa04a2ffd6a7b140b743ce964b9bbd6d24bd8284e89cc0a45ffffffff0100e1f505000000001e03626f627576a914f5d746b03deb461dbb9712d847e495c462801acf88ac00000000 pprint: [PUSHDATA -- 3 BYTES:] 626f62 OP_DROP OP_DUP OP_HASH160 [PUSHDATA -- 20 BYTES:] f5d746b03deb461dbb9712d847e495c462801acf OP_EQUALVERIFY OP_CHECKSIG Attempting to interpret script: Block: 35954 Tx: 3 ThisOut: 4b7f302cbb1675689436b39cdb3298613aa618d3cf9c709d9a289a5ee60f3128, 0 Raw Script: 03626f627576a914aeaa402d32e476d080fabeb7d78362f6f92fc0b088ac Raw Tx: 0100000001f0da6200a76af736e5e0f99d632a2b9bc9ee254b4568c7682b8b0a285e8f2c08010000008b483045022026f3ec76fc3e009088ce47744847d74c52e8fce844311b656a0aade104a7f2c80221009e9136a670dbf47b01e32d087352fc50f6ad18d2050d8af5ded8eb823d3dafac014104ca6a38d3c323ab84893e95b1c902aa796626e89f2c299d4de66e6fd8f74a760f367753d67a95631aa04a2ffd6a7b140b743ce964b9bbd6d24bd8284e89cc0a45ffffffff0100e1f505000000001e03626f627576a914aeaa402d32e476d080fabeb7d78362f6f92fc0b088ac00000000 pprint: [PUSHDATA -- 3 BYTES:] 626f62 OP_DROP OP_DUP OP_HASH160 [PUSHDATA -- 20 BYTES:] aeaa402d32e476d080fabeb7d78362f6f92fc0b0 OP_EQUALVERIFY OP_CHECKSIG Attempting to interpret script: Block: 35954 Tx: 5 ThisOut: cf52669252c5fda5ff1cd73d56d14b518e543eb903940b0cbe02b410ef4446da, 0 Raw Script: 03626f627576a914aeaa402d32e476d080fabeb7d78362f6f92fc0b088ac Raw Tx: 0100000001d31fd3ae0040d938afb0203a867cc643f74f03c4518cb4a1b469ba83a9092eb6010000008b48304502210089f573e80dbe216f4ed9f56984d6cf5f73acc692d5def6a0ea103c11368d2bf30220579c73198c30fa10c8a98f7be19a4716af7127575c45faf2334d446682b4eeff014104ca6a38d3c323ab84893e95b1c902aa796626e89f2c299d4de66e6fd8f74a760f367753d67a95631aa04a2ffd6a7b140b743ce964b9bbd6d24bd8284e89cc0a45ffffffff0160decb1d000000001e03626f627576a914aeaa402d32e476d080fabeb7d78362f6f92fc0b088ac00000000 pprint: [PUSHDATA -- 3 BYTES:] 626f62 OP_DROP OP_DUP OP_HASH160 [PUSHDATA -- 20 BYTES:] aeaa402d32e476d080fabeb7d78362f6f92fc0b0 OP_EQUALVERIFY OP_CHECKSIG Attempting to interpret script: Block: 35954 Tx: 6 ThisOut: 4d972f49f500f64cbeb847d9bb2152bbf3f5112ebf6b35d401b4f59149f18c9b, 0 Raw Script: 03626f627576a914aeaa402d32e476d080fabeb7d78362f6f92fc0b088ac Raw Tx: 01000000017df6877d00345f6b5792190d7593e98fd9cd1ce1f6e47bae82672bd00840b275010000008b483045022100ed0f6885237715e149a6fe5e6cbf1f4ee10883a5d4fb251f3187bd272b281b4e022059368eed0370e37ae6ce3afaf0545b7141600a011b27fdb00b83b413ab5f6f74014104ca6a38d3c323ab84893e95b1c902aa796626e89f2c299d4de66e6fd8f74a760f367753d67a95631aa04a2ffd6a7b140b743ce964b9bbd6d24bd8284e89cc0a45ffffffff01605af405000000001e03626f627576a914aeaa402d32e476d080fabeb7d78362f6f92fc0b088ac00000000 pprint: [PUSHDATA -- 3 BYTES:] 626f62 OP_DROP OP_DUP OP_HASH160 [PUSHDATA -- 20 BYTES:] aeaa402d32e476d080fabeb7d78362f6f92fc0b0 OP_EQUALVERIFY OP_CHECKSIG Attempting to interpret script: Block: 35955 Tx: 3 ThisOut: da4613d83ecc2cd812d6540585ae017bf812c52a206289f51041997646f792cf, 0 Raw Script: 03626f627576a914aeaa402d32e476d080fabeb7d78362f6f92fc0b088ac Raw Tx: 0100000001629985246f2d5c4f0d8499e22d718defd3efdb5f7effd3685daeefb19789e3b2010000008c493046022100a673fae3bc8909b592fd95b029a60e13abcb70b3248d81ed1dd4f9deeaea1cab022100acc0c126540a676f89bc5c5197d77b0c4923f792ae0472a14f0fa6e238e55c2d014104ca6a38d3c323ab84893e95b1c902aa796626e89f2c299d4de66e6fd8f74a760f367753d67a95631aa04a2ffd6a7b140b743ce964b9bbd6d24bd8284e89cc0a45ffffffff01605af405000000001e03626f627576a914aeaa402d32e476d080fabeb7d78362f6f92fc0b088ac00000000 pprint: [PUSHDATA -- 3 BYTES:] 626f62 OP_DROP OP_DUP OP_HASH160 [PUSHDATA -- 20 BYTES:] aeaa402d32e476d080fabeb7d78362f6f92fc0b0 OP_EQUALVERIFY OP_CHECKSIG Attempting to interpret script: Block: 37542 Tx: 1 ThisOut: ec773291793de689c4044de8fd1c4a683e4757e30f872650902a6a52e5adbe0e, 1 Raw Script: 4104b54b5fc1917945fff64785d4baaca66a9704e9ed26002f51f53763499643321fbc047683a62be16e114e25404ce6ffdcf625a928002403402bf9f01e5cbd5f3dad4104f576e534f9bbf6d7c5f186ff4c6e0c5442c2755314bdee62fbc656f94d6cbf32c5eb3522da21cf9f954133000ffccb20dbfec030737640cc3315ce09619210d0ac Raw Tx: 0100000001762454943e95c6789bceef3f6651acbd105569bea99a27fe0ca6b61f7b4f18db000000004948304502201ad3af8c04435fc3780f4eb93f69532dfc56a51e3651b5adfc10b57915b1da6e022100e7aad9759ba379ad8b1e73b58e6f41de01631f116c4fd646d4ad8d3fbb3802f201ffffffff0200e08b29010000001976a914524816e4fa3903de1173ee91f9958c3023d3ebb088ac001bb70000000000864104b54b5fc1917945fff64785d4baaca66a9704e9ed26002f51f53763499643321fbc047683a62be16e114e25404ce6ffdcf625a928002403402bf9f01e5cbd5f3dad4104f576e534f9bbf6d7c5f186ff4c6e0c5442c2755314bdee62fbc656f94d6cbf32c5eb3522da21cf9f954133000ffccb20dbfec030737640cc3315ce09619210d0ac00000000 pprint: [PUSHDATA -- 65 BYTES:] 04b54b5fc1917945fff64785d4baaca66a9704e9ed26002f51f53763499643321fbc047683a62be16e114e25404ce6ffdcf625a928002403402bf9f01e5cbd5f3d OP_CHECKSIGVERIFY [PUSHDATA -- 65 BYTES:] 04f576e534f9bbf6d7c5f186ff4c6e0c5442c2755314bdee62fbc656f94d6cbf32c5eb3522da21cf9f954133000ffccb20dbfec030737640cc3315ce09619210d0 OP_CHECKSIG Attempting to interpret script: Block: 37542 Tx: 2 ThisOut: 110e15e59f9e116e209911a5e9d80b3a6c197ed94030c3abf59ad592d6ce669b, 1 Raw Script: 634104b54b5fc1917945fff64785d4baaca66a9704e9ed26002f51f53763499643321fbc047683a62be16e114e25404ce6ffdcf625a928002403402bf9f01e5cbd5f3dac674104f576e534f9bbf6d7c5f186ff4c6e0c5442c2755314bdee62fbc656f94d6cbf32c5eb3522da21cf9f954133000ffccb20dbfec030737640cc3315ce09619210d0ad4104481e02ffda81d4c86e75beb9f87b048733decd53781843091660d0f5e755878628f094088d229e05293e45cd181bb277354057f3f945a7860684a733760cfb83ac68 Raw Tx: 0100000001c8c5eb17f87d8e9959745e2e93f18f8add1fcd214434e12579e987a7cd47c2b90000000049483045022100e1433f26e06b290ecfd290ee00026a8255e67cbfd8ca0d489f27bae16a14c9e20220155f36eed630ccee317850a35ddce6830ae595167caf33cc762167f63a3358b301ffffffff02c09d7c29010000001976a9142d95b9c329ad298648d55c886d60c5c2f21bef1e88ac405dc60000000000cc634104b54b5fc1917945fff64785d4baaca66a9704e9ed26002f51f53763499643321fbc047683a62be16e114e25404ce6ffdcf625a928002403402bf9f01e5cbd5f3dac674104f576e534f9bbf6d7c5f186ff4c6e0c5442c2755314bdee62fbc656f94d6cbf32c5eb3522da21cf9f954133000ffccb20dbfec030737640cc3315ce09619210d0ad4104481e02ffda81d4c86e75beb9f87b048733decd53781843091660d0f5e755878628f094088d229e05293e45cd181bb277354057f3f945a7860684a733760cfb83ac6800000000 pprint: OP_IF [PUSHDATA -- 65 BYTES:] 04b54b5fc1917945fff64785d4baaca66a9704e9ed26002f51f53763499643321fbc047683a62be16e114e25404ce6ffdcf625a928002403402bf9f01e5cbd5f3d OP_CHECKSIG OP_ELSE [PUSHDATA -- 65 BYTES:] 04f576e534f9bbf6d7c5f186ff4c6e0c5442c2755314bdee62fbc656f94d6cbf32c5eb3522da21cf9f954133000ffccb20dbfec030737640cc3315ce09619210d0 OP_CHECKSIGVERIFY [PUSHDATA -- 65 BYTES:] 04481e02ffda81d4c86e75beb9f87b048733decd53781843091660d0f5e755878628f094088d229e05293e45cd181bb277354057f3f945a7860684a733760cfb83 OP_CHECKSIG OP_ENDIF Attempting to interpret script: Block: 37542 Tx: 3 ThisOut: 65b9981cb72deb3cf83f921b401e274d667a2cb3ababc1f44cb061a72944475c, 1 Raw Script: 634104b54b5fc1917945fff64785d4baaca66a9704e9ed26002f51f53763499643321fbc047683a62be16e114e25404ce6ffdcf625a928002403402bf9f01e5cbd5f3dac674104f576e534f9bbf6d7c5f186ff4c6e0c5442c2755314bdee62fbc656f94d6cbf32c5eb3522da21cf9f954133000ffccb20dbfec030737640cc3315ce09619210d0ac68 Raw Tx: 010000000909803983dbd8916270adb052f8456a5f5e0b81bbc1ff371b8d4191501d16b8ab010000008b4830450220640a900b5b816b3e9a310ab0351f9ff796ba0f7c2fb7d4ffdc57105bdf4c7ed5022100a38267a3d1b1b21057048b4790c117c746d1c7ede0791773400112943c174cfa014104d1f61dd120b2746890262217fa2145fe85f93dcd97ff9b0bd0e9f8717356271d5c665f7088de57b9f8430fd61496c01f339b8751792195385409dad3651fdf04ffffffff2c38b7a5eced7cfec6241444f7c4b93f80448c57404da68bf29feacafb976a4c010000008b483045022100e278457d622f75d1ad9f14a868db0fd296fe1b8d42067cbdf2d828b626329e21022057237cfdb4d0c65e63b0e3bbab3c13fd369e8db1d17431dbd32c3b38cd594bd6014104d1f61dd120b2746890262217fa2145fe85f93dcd97ff9b0bd0e9f8717356271d5c665f7088de57b9f8430fd61496c01f339b8751792195385409dad3651fdf04ffffffff3616d119934b2f532687c65b742f2716e8f4b68f0e4579644f26db6b2fb6cee1000000008c493046022100df3ad3c6efc881a10129ab1ffc57cc099ef2abd19b24c7a450118fa7b60ad017022100ffe78255c9d30ee4c2867f85480a45d9443b48d0ac5a81c923d324c3cf1f8060014104d1f61dd120b2746890262217fa2145fe85f93dcd97ff9b0bd0e9f8717356271d5c665f7088de57b9f8430fd61496c01f339b8751792195385409dad3651fdf04ffffffff6b554a05c8f26355a6d7d28708f3a0d664cb59b124754c4960eb701cc3a11d41010000008b4830450221008a30d4e0a0f4ec9e02c1a38e2119569c15423695bd6fd38cd229b03290d0ac16022062c55fac7791249668deb1b9656c1e4ae40e98c639d01e7c5a253249da95d423014104d1f61dd120b2746890262217fa2145fe85f93dcd97ff9b0bd0e9f8717356271d5c665f7088de57b9f8430fd61496c01f339b8751792195385409dad3651fdf04ffffffff6e0d2a2280050de3bb858f72920679034fb28278b6df79c8032e9748a3667984000000008b483045022005ec384e320c036d95036e700cfb68fa25ed61eba6b45bd54bd44e4bb84655e1022100ba79bc08e1bb03a569a041d9f7ad236e6bb9ae41418074d119e49a3a9fb99f3b01410470bde17be54e8365c883686bc1e9ac139aa43e5efa14eca329c59d55b593476f743296792a1c42fc94293553faeea695e46c64b9b1ad8353d19c0a9fdea70b6effffffff7240381b368763e0d11e21cd31d0081794690ec2f7b4891745f0a2a41f126190000000008b483045022004514f503e0dcc13e8ce3b8debadc4f65fdf6c8105af90fea207244886067487022100b5f4ad246f6592570694f171b7e463e163d9ad787496d28d1853a6755b18107b014104d1f61dd120b2746890262217fa2145fe85f93dcd97ff9b0bd0e9f8717356271d5c665f7088de57b9f8430fd61496c01f339b8751792195385409dad3651fdf04ffffffff79baa7e352c546fde04a9a56902a1dc0df960f8f12ad2dd174649696c31c6f45000000008b4830450220112baed5473046ebec9868d13226d7306ad3ece78c0bfe435e34ec576ed1676e022100c95cccfc65a05584f76a832fe706944260238e3714b314e83edd4d8a90f9e2b3014104d1f61dd120b2746890262217fa2145fe85f93dcd97ff9b0bd0e9f8717356271d5c665f7088de57b9f8430fd61496c01f339b8751792195385409dad3651fdf04ffffffff9951c8c9885906ba9dcb311672ad1c846f6396e11b1b6df704cc668bd3d30e38010000008a47304402207a3142597ff4cedbe5a517ac2a367bd4b821ff5c724c56ed8f9b22611ac0356e02206892ed3fe0315a02389a0cb161c9e4a1b9511fa11055bf29e788424df7b90d4f014104d1f61dd120b2746890262217fa2145fe85f93dcd97ff9b0bd0e9f8717356271d5c665f7088de57b9f8430fd61496c01f339b8751792195385409dad3651fdf04ffffffffb5f63085bf6f10c24cd5417423ad29b383d0d988e94fe96cb31b33d010fd2b42000000008a47304402203a862ccc68037869e920e45a9341eaae7d0f81ca9310738b66d29d801eb7a20b0220306950882a8c33dbbb0e0f028c2effcf57cb27ca2f072a3d365917f288c821a6014104d1f61dd120b2746890262217fa2145fe85f93dcd97ff9b0bd0e9f8717356271d5c665f7088de57b9f8430fd61496c01f339b8751792195385409dad3651fdf04ffffffff0240420f00000000001976a914c6ac130f39e7dd2a76387b2e100fe7319517478c88acc0d8a7000000000089634104b54b5fc1917945fff64785d4baaca66a9704e9ed26002f51f53763499643321fbc047683a62be16e114e25404ce6ffdcf625a928002403402bf9f01e5cbd5f3dac674104f576e534f9bbf6d7c5f186ff4c6e0c5442c2755314bdee62fbc656f94d6cbf32c5eb3522da21cf9f954133000ffccb20dbfec030737640cc3315ce09619210d0ac6800000000 pprint: OP_IF [PUSHDATA -- 65 BYTES:] 04b54b5fc1917945fff64785d4baaca66a9704e9ed26002f51f53763499643321fbc047683a62be16e114e25404ce6ffdcf625a928002403402bf9f01e5cbd5f3d OP_CHECKSIG OP_ELSE [PUSHDATA -- 65 BYTES:] 04f576e534f9bbf6d7c5f186ff4c6e0c5442c2755314bdee62fbc656f94d6cbf32c5eb3522da21cf9f954133000ffccb20dbfec030737640cc3315ce09619210d0 OP_CHECKSIG OP_ENDIF Attempting to interpret script: Block: 37546 Tx: 1 PrevOut: 110e15e59f9e116e209911a5e9d80b3a6c197ed94030c3abf59ad592d6ce669b, 1 Raw Script: 47304402203a588639b3047a536391064d3af6faa57f1fe4becb467c18832c30d3c1a60b0702207212f4d074f9c8c1cc2a0af0eef39e423e0417e56223801cefc61ad1f96ead3c0151 Raw Tx: 010000000477ac792b0ac7e36f5c59dc50c5a7671c788e9e5b7586177e771ed2d973439091000000008c493046022100b26dab88b40d18830df89ae926199ebc4efdb35e11a48144fd134df680b2b3c4022100b5af8b523a06174135ae34fa73ea351d3e68ba0796ce2470caa68f702903dffd014104a60078830657a604a7730f20329141c02c4c7460ddd0c12b236748c54b7c1521d1b191df2f7a7812946d906ce23ddc90e387e69e9e6af2c11c8d714978da3c88ffffffff110e15e59f9e116e209911a5e9d80b3a6c197ed94030c3abf59ad592d6ce669b010000004947304402203a588639b3047a536391064d3af6faa57f1fe4becb467c18832c30d3c1a60b0702207212f4d074f9c8c1cc2a0af0eef39e423e0417e56223801cefc61ad1f96ead3c0151ffffffff65b9981cb72deb3cf83f921b401e274d667a2cb3ababc1f44cb061a72944475c0100000049473044022001f14af56cf5d03723b72032c142c20a20ad103076b1f4483a3da774d7ca1e6f02204f4a1575475d8af1bc009f7a68504e5c7057e941181e94bae8d0c219602330610151ffffffffec773291793de689c4044de8fd1c4a683e4757e30f872650902a6a52e5adbe0e0100000092473044022032b5c7575c321c1bbd9bba04a6cab98624ab9aa498d129b978d7b6a3a9858e2102207598189a83e2b31fe84c8e85dea763126c6dc9f1eb889b73706a38168bf7c1e501493046022100a060a810f2163428aaf9d1fa1ecc147a9289d8334470f6243f7cac63b1bfdef3022100a04b1894235ba74a2077bc3144cd56dcc27e55b629154bcf9459b7cc0ececfc501ffffffff02c09a5e00000000001976a914f72bec41be74058777bc645a8eb246922b44001688ac808d643d000000008963410445dc6dadfd6267745b0a21a8f3850d14d44515928c895dddc99952f56f5cf12af8c57534051a6ea08a11891f66d049ad9f756f88d7ae94ae02839fb91cd365aeac6741047609caf19f9b912c68f5147ee24ee6750ad0564269bcc7883b39362c2980f971862f69a4be75bd9815260ff8a624c66a4ae06a31913067ce5a4d343bbb964335ac6800000000 pprint: [PUSHDATA -- 71 BYTES:] 304402203a588639b3047a536391064d3af6faa57f1fe4becb467c18832c30d3c1a60b0702207212f4d074f9c8c1cc2a0af0eef39e423e0417e56223801cefc61ad1f96ead3c01 1 Attempting to interpret script: Block: 37546 Tx: 1 PrevOut: 65b9981cb72deb3cf83f921b401e274d667a2cb3ababc1f44cb061a72944475c, 1 Raw Script: 473044022001f14af56cf5d03723b72032c142c20a20ad103076b1f4483a3da774d7ca1e6f02204f4a1575475d8af1bc009f7a68504e5c7057e941181e94bae8d0c219602330610151 Raw Tx: 010000000477ac792b0ac7e36f5c59dc50c5a7671c788e9e5b7586177e771ed2d973439091000000008c493046022100b26dab88b40d18830df89ae926199ebc4efdb35e11a48144fd134df680b2b3c4022100b5af8b523a06174135ae34fa73ea351d3e68ba0796ce2470caa68f702903dffd014104a60078830657a604a7730f20329141c02c4c7460ddd0c12b236748c54b7c1521d1b191df2f7a7812946d906ce23ddc90e387e69e9e6af2c11c8d714978da3c88ffffffff110e15e59f9e116e209911a5e9d80b3a6c197ed94030c3abf59ad592d6ce669b010000004947304402203a588639b3047a536391064d3af6faa57f1fe4becb467c18832c30d3c1a60b0702207212f4d074f9c8c1cc2a0af0eef39e423e0417e56223801cefc61ad1f96ead3c0151ffffffff65b9981cb72deb3cf83f921b401e274d667a2cb3ababc1f44cb061a72944475c0100000049473044022001f14af56cf5d03723b72032c142c20a20ad103076b1f4483a3da774d7ca1e6f02204f4a1575475d8af1bc009f7a68504e5c7057e941181e94bae8d0c219602330610151ffffffffec773291793de689c4044de8fd1c4a683e4757e30f872650902a6a52e5adbe0e0100000092473044022032b5c7575c321c1bbd9bba04a6cab98624ab9aa498d129b978d7b6a3a9858e2102207598189a83e2b31fe84c8e85dea763126c6dc9f1eb889b73706a38168bf7c1e501493046022100a060a810f2163428aaf9d1fa1ecc147a9289d8334470f6243f7cac63b1bfdef3022100a04b1894235ba74a2077bc3144cd56dcc27e55b629154bcf9459b7cc0ececfc501ffffffff02c09a5e00000000001976a914f72bec41be74058777bc645a8eb246922b44001688ac808d643d000000008963410445dc6dadfd6267745b0a21a8f3850d14d44515928c895dddc99952f56f5cf12af8c57534051a6ea08a11891f66d049ad9f756f88d7ae94ae02839fb91cd365aeac6741047609caf19f9b912c68f5147ee24ee6750ad0564269bcc7883b39362c2980f971862f69a4be75bd9815260ff8a624c66a4ae06a31913067ce5a4d343bbb964335ac6800000000 pprint: [PUSHDATA -- 71 BYTES:] 3044022001f14af56cf5d03723b72032c142c20a20ad103076b1f4483a3da774d7ca1e6f02204f4a1575475d8af1bc009f7a68504e5c7057e941181e94bae8d0c2196023306101 1 Attempting to interpret script: Block: 37546 Tx: 1 PrevOut: ec773291793de689c4044de8fd1c4a683e4757e30f872650902a6a52e5adbe0e, 1 Raw Script: 473044022032b5c7575c321c1bbd9bba04a6cab98624ab9aa498d129b978d7b6a3a9858e2102207598189a83e2b31fe84c8e85dea763126c6dc9f1eb889b73706a38168bf7c1e501493046022100a060a810f2163428aaf9d1fa1ecc147a9289d8334470f6243f7cac63b1bfdef3022100a04b1894235ba74a2077bc3144cd56dcc27e55b629154bcf9459b7cc0ececfc501 Raw Tx: 010000000477ac792b0ac7e36f5c59dc50c5a7671c788e9e5b7586177e771ed2d973439091000000008c493046022100b26dab88b40d18830df89ae926199ebc4efdb35e11a48144fd134df680b2b3c4022100b5af8b523a06174135ae34fa73ea351d3e68ba0796ce2470caa68f702903dffd014104a60078830657a604a7730f20329141c02c4c7460ddd0c12b236748c54b7c1521d1b191df2f7a7812946d906ce23ddc90e387e69e9e6af2c11c8d714978da3c88ffffffff110e15e59f9e116e209911a5e9d80b3a6c197ed94030c3abf59ad592d6ce669b010000004947304402203a588639b3047a536391064d3af6faa57f1fe4becb467c18832c30d3c1a60b0702207212f4d074f9c8c1cc2a0af0eef39e423e0417e56223801cefc61ad1f96ead3c0151ffffffff65b9981cb72deb3cf83f921b401e274d667a2cb3ababc1f44cb061a72944475c0100000049473044022001f14af56cf5d03723b72032c142c20a20ad103076b1f4483a3da774d7ca1e6f02204f4a1575475d8af1bc009f7a68504e5c7057e941181e94bae8d0c219602330610151ffffffffec773291793de689c4044de8fd1c4a683e4757e30f872650902a6a52e5adbe0e0100000092473044022032b5c7575c321c1bbd9bba04a6cab98624ab9aa498d129b978d7b6a3a9858e2102207598189a83e2b31fe84c8e85dea763126c6dc9f1eb889b73706a38168bf7c1e501493046022100a060a810f2163428aaf9d1fa1ecc147a9289d8334470f6243f7cac63b1bfdef3022100a04b1894235ba74a2077bc3144cd56dcc27e55b629154bcf9459b7cc0ececfc501ffffffff02c09a5e00000000001976a914f72bec41be74058777bc645a8eb246922b44001688ac808d643d000000008963410445dc6dadfd6267745b0a21a8f3850d14d44515928c895dddc99952f56f5cf12af8c57534051a6ea08a11891f66d049ad9f756f88d7ae94ae02839fb91cd365aeac6741047609caf19f9b912c68f5147ee24ee6750ad0564269bcc7883b39362c2980f971862f69a4be75bd9815260ff8a624c66a4ae06a31913067ce5a4d343bbb964335ac6800000000 pprint: [PUSHDATA -- 71 BYTES:] 3044022032b5c7575c321c1bbd9bba04a6cab98624ab9aa498d129b978d7b6a3a9858e2102207598189a83e2b31fe84c8e85dea763126c6dc9f1eb889b73706a38168bf7c1e501 [PUSHDATA -- 73 BYTES:] 3046022100a060a810f2163428aaf9d1fa1ecc147a9289d8334470f6243f7cac63b1bfdef3022100a04b1894235ba74a2077bc3144cd56dcc27e55b629154bcf9459b7cc0ececfc501 Attempting to interpret script: Block: 37546 Tx: 1 ThisOut: ab9f97d24b612e7fbf27ba5d29f0c7201ddca2db0dde304965a4c7691d77a3bb, 1 Raw Script: 63410445dc6dadfd6267745b0a21a8f3850d14d44515928c895dddc99952f56f5cf12af8c57534051a6ea08a11891f66d049ad9f756f88d7ae94ae02839fb91cd365aeac6741047609caf19f9b912c68f5147ee24ee6750ad0564269bcc7883b39362c2980f971862f69a4be75bd9815260ff8a624c66a4ae06a31913067ce5a4d343bbb964335ac68 Raw Tx: 010000000477ac792b0ac7e36f5c59dc50c5a7671c788e9e5b7586177e771ed2d973439091000000008c493046022100b26dab88b40d18830df89ae926199ebc4efdb35e11a48144fd134df680b2b3c4022100b5af8b523a06174135ae34fa73ea351d3e68ba0796ce2470caa68f702903dffd014104a60078830657a604a7730f20329141c02c4c7460ddd0c12b236748c54b7c1521d1b191df2f7a7812946d906ce23ddc90e387e69e9e6af2c11c8d714978da3c88ffffffff110e15e59f9e116e209911a5e9d80b3a6c197ed94030c3abf59ad592d6ce669b010000004947304402203a588639b3047a536391064d3af6faa57f1fe4becb467c18832c30d3c1a60b0702207212f4d074f9c8c1cc2a0af0eef39e423e0417e56223801cefc61ad1f96ead3c0151ffffffff65b9981cb72deb3cf83f921b401e274d667a2cb3ababc1f44cb061a72944475c0100000049473044022001f14af56cf5d03723b72032c142c20a20ad103076b1f4483a3da774d7ca1e6f02204f4a1575475d8af1bc009f7a68504e5c7057e941181e94bae8d0c219602330610151ffffffffec773291793de689c4044de8fd1c4a683e4757e30f872650902a6a52e5adbe0e0100000092473044022032b5c7575c321c1bbd9bba04a6cab98624ab9aa498d129b978d7b6a3a9858e2102207598189a83e2b31fe84c8e85dea763126c6dc9f1eb889b73706a38168bf7c1e501493046022100a060a810f2163428aaf9d1fa1ecc147a9289d8334470f6243f7cac63b1bfdef3022100a04b1894235ba74a2077bc3144cd56dcc27e55b629154bcf9459b7cc0ececfc501ffffffff02c09a5e00000000001976a914f72bec41be74058777bc645a8eb246922b44001688ac808d643d000000008963410445dc6dadfd6267745b0a21a8f3850d14d44515928c895dddc99952f56f5cf12af8c57534051a6ea08a11891f66d049ad9f756f88d7ae94ae02839fb91cd365aeac6741047609caf19f9b912c68f5147ee24ee6750ad0564269bcc7883b39362c2980f971862f69a4be75bd9815260ff8a624c66a4ae06a31913067ce5a4d343bbb964335ac6800000000 pprint: OP_IF [PUSHDATA -- 65 BYTES:] 0445dc6dadfd6267745b0a21a8f3850d14d44515928c895dddc99952f56f5cf12af8c57534051a6ea08a11891f66d049ad9f756f88d7ae94ae02839fb91cd365ae OP_CHECKSIG OP_ELSE [PUSHDATA -- 65 BYTES:] 047609caf19f9b912c68f5147ee24ee6750ad0564269bcc7883b39362c2980f971862f69a4be75bd9815260ff8a624c66a4ae06a31913067ce5a4d343bbb964335 OP_CHECKSIG OP_ENDIF Attempting to interpret script: Block: 39377 Tx: 2 ThisOut: be521dc4280bff0dfee92c3606d2e1c748ec9ed8692cfc35a8f5c631a2d63cc9, 1 Raw Script: 76a914c0c8d884f47c6e206c0bea693764b5e495c65d1188b0 Raw Tx: 0100000001110e15e59f9e116e209911a5e9d80b3a6c197ed94030c3abf59ad592d6ce669b000000008c493046022100e72c69662b3f97bfb9c549ac7539dad52b1308e78d7cec2e191f2732f88fa219022100f2b2177b05f4f4d3bda789ca4f070420bd19821bf3f6e73ca0327968ccc4a369014104630922f2b2951fae6734ae2caed94b23f9094295d7c521860361ebaa46f45432004e9304c10da2e78700514ef34a14d249af276c6104e2c7a3e75fc170f95d1effffffff0240ad8126010000001976a9144704a93e481704de4e44321ed6356203c85c07a488ac80f0fa02000000001976a914c0c8d884f47c6e206c0bea693764b5e495c65d1188b000000000 pprint: OP_DUP OP_HASH160 [PUSHDATA -- 20 BYTES:] c0c8d884f47c6e206c0bea693764b5e495c65d11 OP_EQUALVERIFY OP_NOP1 Attempting to interpret script: Block: 39399 Tx: 10 PrevOut: be521dc4280bff0dfee92c3606d2e1c748ec9ed8692cfc35a8f5c631a2d63cc9, 1 Raw Script: 00483045022100c044d2877e14ffd0d1a832fd65f8670937d26c15e9049d384febdfe53616a29d022073983873504caf70c9468147497dddc027cb895ab2548095069daeca5dc0c083014c87514104cbcdfa318634d9a31a0d43e0e266914cde11ae9eb15d39ebcb9d5169483826dd74a0af31b36fea6648e1d55862a7d7799f5b3f44bb4901b0ab555c648cb509044104338517576bf89b220338e01e171b366ad261bd07e9480b4e179a0c9580b91c9debecabd840141d4bb4a8da498c1a30c59fbce0a798bde6a3cda397aa93de600752ae Raw Tx: 0100000002ab9f97d24b612e7fbf27ba5d29f0c7201ddca2db0dde304965a4c7691d77a3bb000000008c493046022100866e834a7d2609a3a22a9c5ff13e301b4ad9f7fcb65dc3e8b27d07f3fc02084b022100eec81365b922db5707058379a1038dc0c8c6d547a31b494b2f05e607a62b9505014104c56c2ccd35260cef7b79c742b0cfc076f2e709f10191b9058a9116f18801834c5b14ace9aa99bc480092da29fc3f4dd8eccae151304cadfbcf07d4047d2e32d5ffffffffbe521dc4280bff0dfee92c3606d2e1c748ec9ed8692cfc35a8f5c631a2d63cc901000000d300483045022100c044d2877e14ffd0d1a832fd65f8670937d26c15e9049d384febdfe53616a29d022073983873504caf70c9468147497dddc027cb895ab2548095069daeca5dc0c083014c87514104cbcdfa318634d9a31a0d43e0e266914cde11ae9eb15d39ebcb9d5169483826dd74a0af31b36fea6648e1d55862a7d7799f5b3f44bb4901b0ab555c648cb509044104338517576bf89b220338e01e171b366ad261bd07e9480b4e179a0c9580b91c9debecabd840141d4bb4a8da498c1a30c59fbce0a798bde6a3cda397aa93de600752aeffffffff0270d75d00000000001976a9142869126e5a899e9d5e68acab40a91f7366bbe36088ac80f0fa02000000001976a9145ce6be8588bcdd09376e20eb7c0994ac0b6b142188b000000000 pprint: OP_0 [PUSHDATA -- 72 BYTES:] 3045022100c044d2877e14ffd0d1a832fd65f8670937d26c15e9049d384febdfe53616a29d022073983873504caf70c9468147497dddc027cb895ab2548095069daeca5dc0c08301 [OP_PUSHDATA1 -- 135 BYTES:] 514104cbcdfa318634d9a31a0d43e0e266914cde11ae9eb15d39ebcb9d5169483826dd74a0af31b36fea6648e1d55862a7d7799f5b3f44bb4901b0ab555c648cb509044104338517576bf89b220338e01e171b366ad261bd07e9480b4e179a0c9580b91c9debecabd840141d4bb4a8da498c1a30c59fbce0a798bde6a3cda397aa93de600752ae Attempting to interpret script: Block: 39399 Tx: 10 ThisOut: c71fecedb5193a9077dbdee79499034ef5df16ac6400601b78a473ff9e76ebf5, 1 Raw Script: 76a9145ce6be8588bcdd09376e20eb7c0994ac0b6b142188b0 Raw Tx: 0100000002ab9f97d24b612e7fbf27ba5d29f0c7201ddca2db0dde304965a4c7691d77a3bb000000008c493046022100866e834a7d2609a3a22a9c5ff13e301b4ad9f7fcb65dc3e8b27d07f3fc02084b022100eec81365b922db5707058379a1038dc0c8c6d547a31b494b2f05e607a62b9505014104c56c2ccd35260cef7b79c742b0cfc076f2e709f10191b9058a9116f18801834c5b14ace9aa99bc480092da29fc3f4dd8eccae151304cadfbcf07d4047d2e32d5ffffffffbe521dc4280bff0dfee92c3606d2e1c748ec9ed8692cfc35a8f5c631a2d63cc901000000d300483045022100c044d2877e14ffd0d1a832fd65f8670937d26c15e9049d384febdfe53616a29d022073983873504caf70c9468147497dddc027cb895ab2548095069daeca5dc0c083014c87514104cbcdfa318634d9a31a0d43e0e266914cde11ae9eb15d39ebcb9d5169483826dd74a0af31b36fea6648e1d55862a7d7799f5b3f44bb4901b0ab555c648cb509044104338517576bf89b220338e01e171b366ad261bd07e9480b4e179a0c9580b91c9debecabd840141d4bb4a8da498c1a30c59fbce0a798bde6a3cda397aa93de600752aeffffffff0270d75d00000000001976a9142869126e5a899e9d5e68acab40a91f7366bbe36088ac80f0fa02000000001976a9145ce6be8588bcdd09376e20eb7c0994ac0b6b142188b000000000 pprint: OP_DUP OP_HASH160 [PUSHDATA -- 20 BYTES:] 5ce6be8588bcdd09376e20eb7c0994ac0b6b1421 OP_EQUALVERIFY OP_NOP1 Attempting to interpret script: Block: 40216 Tx: 10 PrevOut: 2928d6ae9c0631cbb0b54b3d6216c181c932bd1f17d081fddf16c282916d8ee6, 0 Raw Script: 046a756e6b47304402200db2b8a266ee8b801d0118aac3b39756c208d4a23bf257290ee2d67f77bd680102202762840095251e9937dfba14d42673f2af7a42d122ec14faad6cccda501fd77d01410478cd76937688d9f14adc490287b74811f37204a36ccc9f92c11e814e7c7dc77fcd50f5078de873ef9e14a6f3e0ebfdb64b003825fe7a93867436844d5b523f16 Raw Tx: 01000000012928d6ae9c0631cbb0b54b3d6216c181c932bd1f17d081fddf16c282916d8ee6000000008f046a756e6b47304402200db2b8a266ee8b801d0118aac3b39756c208d4a23bf257290ee2d67f77bd680102202762840095251e9937dfba14d42673f2af7a42d122ec14faad6cccda501fd77d01410478cd76937688d9f14adc490287b74811f37204a36ccc9f92c11e814e7c7dc77fcd50f5078de873ef9e14a6f3e0ebfdb64b003825fe7a93867436844d5b523f16ffffffff0100e1f505000000001976a91425ed77c5c3974cc25aad95c4adcb26d68f74973188ac00000000 pprint: [PUSHDATA -- 4 BYTES:] 6a756e6b [PUSHDATA -- 71 BYTES:] 304402200db2b8a266ee8b801d0118aac3b39756c208d4a23bf257290ee2d67f77bd680102202762840095251e9937dfba14d42673f2af7a42d122ec14faad6cccda501fd77d01 [PUSHDATA -- 65 BYTES:] 0478cd76937688d9f14adc490287b74811f37204a36ccc9f92c11e814e7c7dc77fcd50f5078de873ef9e14a6f3e0ebfdb64b003825fe7a93867436844d5b523f16 armory-0.92.3/extras/createTestChain.py0000644000000000000000000001611412414772654016561 0ustar rootroot#! /usr/bin/python from pybtcengine import * from CppBlockUtils import BlockHeader as CppBlockHeader from CppBlockUtils import BlockHeaderRef as CppBlockHeaderRef from CppBlockUtils import Tx as CppTx from CppBlockUtils import TxIn as CppTxIn from CppBlockUtils import TxOut as CppTxOut from CppBlockUtils import BtcWallet as CppBtcWallet import os from time import time, sleep blkfile = open('/home/alan/.bitcoin/blk0001.dat','r') blkfile.seek(8,0) genBlock = PyBlock().unserialize(blkfile.read(80 + 1 + 285)) blkfile.close() print 'Genesis block header:' genBlock.blockHeader.pprint() print 'Genesis block tx:' genBlock.blockData.txList[0].pprint() satoshiPubKey = hex_to_binary('04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f') ################################################################################ def printHashEnds(theHash): intList = [ord(c) for c in theHash] print 'First 4 LE bytes: [%03d,%03d,%03d,%03d]' % tuple(intList[:4]), print 'First 4 BE bytes: [%03d,%03d,%03d,%03d]' % tuple(intList[::-1][:4]) def printBlkInfo(blk, suffix): print 'BLOCK (', suffix ,')' print ' Head :', binary_to_hex(blk.blockHeader.getHash()) for i,tx in enumerate(blk.blockData.txList): print ' Tx :', binary_to_hex(tx.getHash()) print '\n' print ' ', printHashEnds(blk.blockHeader.getHash()) for i,tx in enumerate(blk.blockData.txList): print ' ', printHashEnds(tx.getHash()) print '\n' print ' RawHeader :', binary_to_hex(blk.blockHeader.getHash()) pprintHex(binary_to_hex(blk.blockHeader.serialize()), indent=' '*12, withAddr=False) for i,tx in enumerate(blk.blockData.txList): print ' RawTx :', binary_to_hex(tx.getHash()) print ' PrevOut: (%s,%d)' % (binary_to_hex(tx.inputs[0].outpoint.txOutHash), \ tx.inputs[0].outpoint.index) pprintHex(binary_to_hex(tx.serialize()), indent=' '*12, withAddr=False) print '\n' ################################################################################ def createPyBlock(prevBlkHeader, txlist): print 'Creating block (%d tx): Computing nonce...' % len(txlist), extraNonce = random.randrange(2**32) txlist[0].inputs[0].binScript = int_to_binary(extraNonce, widthBytes=4) aGoodNonce = 0 numTries = 0 # Instead of changing the txin script as a nonce, we slightly modify # the timestamp newbh = CppBlockHeader() while aGoodNonce == 0: blk = PyBlock(prevBlkHeader, txlist) newbh = CppBlockHeader() newbh.unserialize_1_(blk.blockHeader.serialize()) tstamp = newbh.getTimestamp() newbh.setTimestamp(tstamp+numTries) aGoodNonce = newbh.findNonce() numTries += 1 blk.blockHeader.nonce = aGoodNonce blk.blockHeader.timestamp = newbh.getTimestamp() print 'Done!' return blk # We have to have a AddrA = PyBtcAddress().createFromPublicKey(satoshiPubKey) AddrB = PyBtcAddress().createFromPrivateKey(hex_to_int('bb'*32)) AddrC = PyBtcAddress().createFromPrivateKey(hex_to_int('cc'*32)) AddrD = PyBtcAddress().createFromPrivateKey(hex_to_int('dd'*32)) print 'Addr A: %s' % AddrA.getAddrStr(), ' (Satoshi)' for a,s in ([AddrB,'B'], [AddrC, 'C'], [AddrD, 'D']): print 'Addr %s: %s (PrivKey:%s)' % ( s, a.getAddrStr(), binary_to_hex(a.privKey_serialize())) btcValue = lambda btc: btc*(10**8) COINBASE = -1 #Block 1 Blk1_Tx0 = PyCreateAndSignTx( [COINBASE], [[AddrB, btcValue(50)]] ) Blk1 = createPyBlock(genBlock.blockHeader, [Blk1_Tx0] ) printBlkInfo(Blk1, '1') #Block 2 Blk2_Tx0 = PyCreateAndSignTx( [COINBASE], [[AddrB, btcValue(50)]] ) Blk2_Tx1 = PyCreateAndSignTx( [[AddrB, Blk1.tx(0), 0]], [[AddrC, btcValue(10)], \ [AddrB, btcValue(40)]] ) Blk2 = createPyBlock(Blk1.blockHeader, [Blk2_Tx0, Blk2_Tx1] ) printBlkInfo(Blk2, '2') #Block 3 Blk3_Tx0 = PyCreateAndSignTx( [COINBASE], [[AddrC, btcValue(50)]] ) # will be reversed Blk3_Tx1 = PyCreateAndSignTx( [[AddrB, Blk2.tx(1), 1]], [[AddrD, btcValue(40)]] ) # will be in both chains Blk3_Tx2 = PyCreateAndSignTx( [[AddrC, Blk2.tx(1), 0]], [[AddrD, btcValue(10)]] ) # will be reversed Blk3 = createPyBlock(Blk2.blockHeader, [Blk3_Tx0, Blk3_Tx1, Blk3_Tx2] ) printBlkInfo(Blk3, '3') #Block 4 Blk4_Tx0 = PyCreateAndSignTx( [COINBASE], [[AddrA, btcValue(50)]] ) Blk4_Tx1 = PyCreateAndSignTx( [[AddrB, Blk2.tx(0), 0]], [[AddrD, btcValue(50)]] ) # will be moved blk5A Blk4 = createPyBlock(Blk3.blockHeader, [Blk4_Tx0, Blk4_Tx1] ) printBlkInfo(Blk4, '4') #Block 3-alternate Blk3A_Tx0 = PyCreateAndSignTx( [COINBASE], [[AddrD, btcValue(50)]] ) Blk3A_Tx1 = PyTx().unserialize(Blk3.tx(1).serialize()) Blk3A_Tx2 = PyCreateAndSignTx( [[AddrC, Blk2.tx(1), 0]], [[AddrB, btcValue(10)]] ) Blk3A = createPyBlock(Blk2.blockHeader, [Blk3A_Tx0, Blk3A_Tx1, Blk3A_Tx2] ) printBlkInfo(Blk3A, '3A') #Block 4-alternate Blk4A_Tx0 = PyCreateAndSignTx( [COINBASE], [[AddrA, btcValue(50)]] ) Blk4A = createPyBlock(Blk3A.blockHeader, [Blk4A_Tx0]) printBlkInfo(Blk4A, '4A') #Block 5-alternate Blk5A_Tx0 = PyCreateAndSignTx( [COINBASE], [[AddrA, btcValue(50)]] ) Blk5A_Tx1 = PyTx().unserialize(Blk4.tx(1).serialize()) Blk5A = createPyBlock(Blk4A.blockHeader, [Blk5A_Tx0, Blk5A_Tx1] ) printBlkInfo(Blk5A, '5A') ################################################################################ # Now serialize the block data into .dat files so we can feed them into a # program that claims to handle reorgs def writeBlkBin(fileHandle, blk): fileHandle.write( hex_to_binary('f9beb4d9') ) fileHandle.write( int_to_binary(blk.getSize(), widthBytes=4) ) fileHandle.write( blk.serialize() ) def writeBlkPrettyHex(fileHandle, blk): fileHandle.write( 'f9beb4d9' + '\n') fileHandle.write( int_to_hex(blk.getSize(), widthBytes=4) + '\n'); fileHandle.write( prettyHex(binary_to_hex(blk.blockHeader.serialize()), \ indent=' '*6, withAddr=False) + '\n') fileHandle.write( int_to_hex(blk.getNumTx()) + '\n') for tx in blk.blockData.txList: fileHandle.write( prettyHex(binary_to_hex(tx.serialize()), \ indent=' '*6, withAddr=False) + '\n') fileHandle.write('\n') rtfile = open('reorgTest/reorgTest.hex','w') def pr(prstr): print prstr rtfile.write(prstr + '\n') pr('\n\nWriting blocks to ReorgTest/ directory') pr( 'File path: ' + 'reorgTest/blk_0_to_4.dat' ) blkFirstChain = open('reorgTest/blk_0_to_4.dat','wb') for blk in [genBlock, Blk1, Blk2, Blk3, Blk4]: writeBlkBin(blkFirstChain, blk) writeBlkPrettyHex(rtfile, blk) blkFirstChain.close() for blk,suffix in [[Blk3A,'3A'], [Blk4A, '4A'], [Blk5A, '5A']]: filename = 'reorgTest/blk_%s.dat' % suffix pr( 'File path: ' + filename + '\n') blkAlt = open(filename, 'wb') sleep(1) writeBlkBin(blkAlt, blk) writeBlkPrettyHex(rtfile, blk) blkAlt.close() pr( '\nDone!') armory-0.92.3/extras/dataIDTest.hex0000644000000000000000000000226612414772654015640 0ustar rootrootf9beb4d90100000055bd840a78798ad0da853f68974f3d183e2bd1db6a842c1feecf222a00000000ff104ccb05421ab93e63f8c3ce5c2c2e9dbb37de2764b3a3175c8166562cac7d51b96a49ffff001d283e9e700431ab55d201ff71220ebf8ab480bdcddd444f714ca13ade65787483ad8d408164ea4c794ff1ceac36209ebc31af95c1046b644bce3c6ea8db04ece7f2675a140c0201000000010000000000000000000000000000000000000000000000000000000000000000ffffffff0704ffff001d0102ffffffff0100f2052a01000000434104d46c4968bde02899d2aa0963367c7a6ce34eec332b32e42e5f3407e052d64ac625da6f0718e7b302140434bd725706957c092db53805b821a85b23a7ac61725bac000000000100000001c997a5e56e104102fa209c6a852dd90660a20b2d9c352423edce25857fcd3704000000004847304402204e45e16932b8af514961a1d3a1a25fdf3f4f7732e9d624c6c61548ab5fb8cd410220181522ec8eca07de4860a4acdd12909d831cc56cbbac4622082221a8768d1d0901ffffffff0200ca9a3b00000000434104ae1a62fe09c5f51b13905f07f06b99a2f7159b2225f374cd378d71302fa28414e7aab37397f554a7df5f142c21c1b7303b8a0626f1baded5c72a704f7e6cd84cac00286bee0000000043410411db93e1dcdb8a016b49840f8c53bc1eb68a382e97b1482ecad7b148a6909a5cb2e0eaddfb84ccf9744464f82e160bfa9b8b64f9d4c03f999b8643f656b412a3ac00000000ffe387bc110119a001ffee19000000000000043dd94eb922fbf4e21eedf05f7af1ec5477470955c523bfdd6carmory-0.92.3/extras/cli_sign_txdp.py0000644000000000000000000000703412414772654016342 0ustar rootroot#! /usr/bin/python import sys sys.path.append('..') sys.path.append('.') from armoryengine import * import getpass from sys import argv import os # Do not ever access the same wallet file from two different processes at the same time print '\n' raw_input('PLEASE CLOSE ARMORY BEFORE RUNNING THIS SCRIPT! (press enter to continue)\n') if len(argv)<3: print 'USAGE: %s ' % argv[0] exit(0) wltfile = argv[1] txdpfile = argv[2] if not os.path.exists(wltfile): print 'Wallet file was not found: %s' % wltfile if not os.path.exists(txdpfile): print 'Transaction file was not found: %s' % txdpfile wlt = PyBtcWallet().readWalletFile(wltfile) txdp = PyTxDistProposal().unserializeAscii( open(txdpfile,'r').read()) for a160 in txdp.inAddr20Lists: if not wlt.hasAddr(a160[0]): print 'ERROR: Not all transaction inputs can be signed by this wallet!' print ' Did you supply the correct wallet?' exit(0) print '********************************************************************************' print 'PLEASE VERIFY THE TRANSACTION DETAILS BEFORE SIGNING' print '********************************************************************************' btcIn = sum(txdp.inputValues) btcOut = sum([o.value for o in txdp.pytxObj.outputs]) btcFee = btcIn - btcOut print ' INPUTS: (%s)' % coin2str(btcIn).strip() for i,a160 in enumerate(txdp.inAddr20Lists): print ' %s -->\t%s' % (hash160_to_addrStr(a160[0]), coin2str(txdp.inputValues[i])) print ' OUTPUTS: (%s)' % coin2str(btcOut).strip() for i,txout in enumerate(txdp.pytxObj.outputs): a160 = TxOutScriptExtractAddr160(txout.binScript) if wlt.hasAddr(a160): print ' %s (change) <--\t%s' % (hash160_to_addrStr(a160), coin2str(txout.value)) else: print ' %s <--\t%s' % (hash160_to_addrStr(a160), coin2str(txout.value)) print ' %s <--\t%s' % ('Fee'.ljust(34), coin2str(btcFee)) confirm = raw_input('\nDoes this look right? [y/N]: ') if not confirm.lower().startswith('y'): print 'User did not approve of the transaction. Aborting.' exit(0) # If the wallet is encrypted, get the passphrase if wlt.useEncryption: print 'Please enter your passphrase to unlock your wallet: ' for ntries in range(3): passwd = SecureBinaryData(getpass.getpass('Wallet Passphrase: ')) if wlt.verifyPassphrase(passwd): break; print 'Passphrase was incorrect!' if ntries==2: print 'Wallet could not be unlocked. Aborting.' exit(0) print 'Correct Passphrase. Unlocking wallet...' wlt.unlock(securePassphrase=passwd) passwd.destroy() try: wlt.signTxDistProposal(txdp) except WalletLockError: print 'Error signing transaction. Wallet is somehow still locked' raise except: print 'Error signing transaction. Unknown reason.' raise if not txdp.checkTxHasEnoughSignatures(): print 'Error signing transaction. Most likely this is not the correct wallet.' exit(0) outfilename = '.'.join(txdpfile.split('.')[:-2] + ['signed.tx'] ) outfile = open(outfilename, 'w') outfile.write(txdp.serializeAscii()) outfile.close() print '\nSigning was successful! The signed transaction is located:' print '\t', outfilename, '\n' doDelete = raw_input('Would you like to delete the old unsigned transaction? [Y/n]: ') if not doDelete.lower().startswith('n'): os.remove(txdpfile) print '' print 'The *.signed.tx file can now be broadcast from any computer running ' print 'Armory in online mode. Click "Offline Transactions" and "Broadcast".' print '' armory-0.92.3/extras/manually_import_500k_addr.py0000644000000000000000000001166512414772654020466 0ustar rootroot################################################################################ # This takes a sample AddressEntry serialization as seen in the wallet files, # and appends 500k copies of it with private keys found in the wltfile. This # is useful for appending mass amounts of addresses to your wallet, though don't # expect ArmoryQt.py to work with 500k+ addresses. But the underlying C++ code # CAN handle it. Use a script like the following to get the balance of the # wallet after it has all your addresses: # # from armoryengine import * # wlt = PyBtcWallet().readWalletFile('wltwith1miladdr.wallet') # TheBDM.registerWallet(wlt) # # start = RightNow() # TheBDM.setBlocking(True) # TheBDM.setOnlineMode(True) # print 'Loading blockchain took %d seconds' % int(RightNow()-start) # # wlt.setBlockchainSyncFlag(BLOCKCHAIN_READONLY) # wlt.syncWithBlockchain() # print 'Full sync at %d seconds' % int(RightNow()-start) # print 'Wallet balance is: %s' % coin2str(wlt.getBalance('Spendable')) # # ################################################################################ import os import sys sys.path.append('..') from armoryengine import * print '*'*80 print '* WARNING: THIS SCRIPT IS VERY DANGEROUS! ' print '* IT DIRECTLY MODIFIES ARMORY WALLETS AT THE BINARY LEVEL.' print '* DO NOT USE WHILE ARMORY IS RUNNING! ' print '* MAKE A BACKUP OF YOUR WALLET BEFORE RUNNING THIS SCRIPT!' print '* ' print '* THIS SCRIPT IS A TOY, NOT GUARNATEED TO BE FIT FOR ANY' print '* PURPOSE. NO WARRANTIES, NO EXPECTATIONS. NO COMPLAINTS.' print '* Please.' print '*'*80 ans = raw_input('Yeah yeah, I get it... right? [y/N]: ') if not ans.lower().startswith('y'): exit(0) # Could use sys.argv but this script will be used, like, once. Hardcode it! wltID = '6hR6bAcW' # this was the ID of the wallet I tested with wltDir = '6hR6bAcW' # this was the ID of the wallet I tested with keyfile = '../allprivatekeys.txt' NLINESTOREAD = 500000 def extractPrivateKeyFromLine(line): # Modify this function according to the format of the private keys in keyfile # Currently assumes format, "::" # Sipa format is: # encodedKey = '\x80' + rawPrivKey32 + hash256('\x80'+rawPrivKey32)[:4] # len(encodedKey)==37 pcs = line.strip().split(':') return base58_to_binary(pcs[1])[1:-4] wltfile = os.path.join(ARMORY_HOME_DIR, 'armory_%s_.wallet' % wltID) wltfilebak = os.path.join(ARMORY_HOME_DIR, 'armory_%s_backup.wallet' % wltID) if not os.path.exists(wltfile): print 'ERROR: Wallet does not exist:', wltfile exit(1) if not os.path.exists(keyfile): print 'ERROR: Keyfile does not exist:', keyfile exit(1) # Remove the backup if it exists if os.path.exists(wltfilebak): os.remove(wltfilebak) # If you don't delete the backup, Armory will think the primary wallet # is corrupted and restore the backup exampleEntry = hex_to_binary( \ '0047b8ad 0b1d6803 260ce428 d9e09e2c d99fd3b3 5947b8ad 0b1d6803 260ce428 ' 'd9e09e2c d99fd3b3 59fb1670 0860fecd 00030000 00000000 00ffffff ffffffff ' 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ff71ca50 49feffff ' 'ffffffff ffffffff ffffffff ff000000 00000000 00000000 00000000 005df6e0 ' 'e2eeeeee eeeeeeee eeeeeeee eeeeeeee eeeeeeee eeeeeeee eeeeeeee eeeeeeee ' 'eec93a79 dd04a706 ad8f7311 5f905002 66f273f7 571df942 9a4cfb4b bfbcd825 ' '227202da bad1ba3d 35c73aec 698af852 b327ba1c 24e11758 936bb632 2fe93d74 ' '69b182f6 6631727c 7072ffff ffff0000 00000000 00000000 0000ffff ffff0000 ' '0000 '.replace(' ','')) print 'Showing the last 258 bytes:' pprintHex(binary_to_hex(exampleEntry)) keysIn = open(keyfile, 'r') wltOut = open(wltfile, 'ab') rawAddrEntry = exampleEntry[21:] addr20 = rawAddrEntry[:24] fixed1 = rawAddrEntry[ 24:108] prvkey = rawAddrEntry[ 108:144] pubkey = rawAddrEntry[ 144:213] fixed2 = rawAddrEntry[ 213:] addrDataToWrite = [] for i in xrange(NLINESTOREAD): line = keysIn.readline().strip() if len(line)==0: break privBin = extractPrivateKeyFromLine(line) pubBin = CryptoECDSA().ComputePublicKey(SecureBinaryData(privBin)).toBinStr() addr20 = hash160(pubBin) # Pre-PyBtcAddr Entry Header addrDataToWrite.append('\x00') addrDataToWrite.append(addr20) # PyBtcAddr itself addrDataToWrite.append(addr20) addrDataToWrite.append(computeChecksum(addr20)) addrDataToWrite.append(fixed1) addrDataToWrite.append(privBin) addrDataToWrite.append(computeChecksum(privBin)) addrDataToWrite.append(pubBin) addrDataToWrite.append(computeChecksum(pubBin)) addrDataToWrite.append(fixed2) #pprintHex( binary_to_hex( ''.join(addrDataToWrite) )) if i%1000==0 and not i==0: print 'Appended %d keys...' % i wltOut.write(''.join(addrDataToWrite)) addrDataToWrite = [] wltOut.write(''.join(addrDataToWrite)) wltOut.close() armory-0.92.3/extras/verify_dl_list.py0000644000000000000000000000521612414772654016532 0ustar rootrootimport sys sys.path.append('..') sys.path.append('/usr/share/armory') import os from armoryengine import * def extractSignedDataFromVersionsDotTxt(wholeFile, doVerify=True): """ This method returns a pair: a dictionary to lookup link by OS, and a formatted string that is sorted by OS, and re-formatted list that will hash the same regardless of original format or ordering """ msgBegin = wholeFile.find('# -----BEGIN-SIGNED-DATA-') msgBegin = wholeFile.find('\n', msgBegin+1) + 1 msgEnd = wholeFile.find('# -----SIGNATURE---------') sigBegin = wholeFile.find('\n', msgEnd+1) + 3 sigEnd = wholeFile.find('# -----END-SIGNED-DATA---') MSGRAW = wholeFile[msgBegin:msgEnd] SIGHEX = wholeFile[sigBegin:sigEnd].strip() if -1 in [msgBegin,msgEnd,sigBegin,sigEnd]: LOGERROR('No signed data block found') return '' print 'MESSAGE: ' print MSGRAW print 'SIGNATURE:' print SIGHEX if doVerify: Pub = SecureBinaryData(hex_to_binary(ARMORY_INFO_SIGN_PUBLICKEY)) Msg = SecureBinaryData(MSGRAW) Sig = SecureBinaryData(hex_to_binary(SIGHEX)) isVerified = CryptoECDSA().VerifyData(Msg, Sig, Pub) if not isVerified: LOGERROR('Signed data block failed verification!') return '' else: print 'SIGNATURE IS GOOD!' return MSGRAW def parseLinkList(theData): """ Plug the verified data into here... """ DLDICT,VERDICT = {},{} sectStr = None for line in theData.split('\n'): pcs = line[1:].split() if line.startswith('# SECTION-') and 'INSTALLERS' in line: sectStr = pcs[0].split('-')[-1].lower() if not sectStr in DLDICT: DLDICT[sectStr] = {} VERDICT[sectStr] = '' if len(pcs)>1: VERDICT[sectStr] = pcs[-1] continue if len(pcs)==3 and pcs[1].startswith('http'): DLDICT[sectStr][pcs[0]] = pcs[1:] return DLDICT,VERDICT if __name__=='__main__': fn = 'versions.txt' if not os.path.exists(fn): print 'File does not exist!' fn = '../versions.txt' if not os.path.exists(fn): print 'Really does not exist. Aborting.' exit(1) f = open(fn, 'r') allData = f.read() msgVerified = extractSignedDataFromVersionsDotTxt(allData, doVerify=False) DICT,VER = parseLinkList(msgVerified) print DICT for dl in DICT: print dl.upper(), VER[dl] for theOS in DICT[dl]: print ' ' + dl + '-' + theOS print ' ', DICT[dl][theOS][0] print ' ', DICT[dl][theOS][1] msgVerified = extractSignedDataFromVersionsDotTxt(allData) armory-0.92.3/extras/LastBlockHash.py0000644000000000000000000000277412414772654016204 0ustar rootrootimport sys sys.argv.append('--nologging') from armoryengine import BTC_HOME_DIR from utilities.ArmoryUtils import binary_to_int, LITTLEENDIAN, sha256, \ binary_to_hex, BIGENDIAN import hashlib import os BLOCK_SIZE_LENGTH = 4 MAGIC_NUMBER_LENGTH = 4 HEADER_LENGTH = 80 def getLastBlockFile(): # the current last block file number i = 80 blkFilePath = os.path.join(BTC_HOME_DIR, 'blocks', 'blk%05d.dat' % i) lastFile = None while True: try: with open(blkFilePath, 'rb') as f: lastFile = blkFilePath except IOError: break i += 1 blkFilePath = os.path.join(BTC_HOME_DIR, 'blocks', 'blk%05d.dat' % i) return lastFile def getFileSize(f): pos = f.tell() # Go to the end to get the file length f.seek(0,2) result = f.tell() f.seek(pos) return result def getNextBlockHash(f): fileOffset = f.tell() f.seek(MAGIC_NUMBER_LENGTH, 1) blkSize = binary_to_int(f.read(BLOCK_SIZE_LENGTH), LITTLEENDIAN) result = None if blkSize > 0: blkString = f.read(blkSize) blkHdrBinary = blkString[:HEADER_LENGTH] result = sha256(sha256(blkHdrBinary)) else: f.seek(0,2) return result def getLastBlockHash(blkFile): result = None with open(blkFile, 'rb') as f: fSize = getFileSize(f) while f.tell() < fSize: blockHash = getNextBlockHash(f) if blockHash != None: result = blockHash return result print binary_to_hex(getLastBlockHash(getLastBlockFile()), BIGENDIAN) armory-0.92.3/extras/unfrag_wallet.py0000644000000000000000000001667212414772654016356 0ustar rootrootfrom sys import path,argv import os import getpass path.append('..') from armoryengine import * if '--testnet' in argv: i = argv.index('--testnet') del argv[i] testRecon = False if '--test' in argv: testRecon = True i = argv.index('--test') del argv[i] if len(argv)<2: print '' print 'USAGE: %s ' % argv[0] print '' print 'Will produce N files, of which any subset of M of them is ' print 'sufficient to reproduce your wallet.' print '' exit(0) files = argv[1:] for filename in files: if not os.path.exists(filename): print 'ERROR: File does not exist: %s' % filename exit(0) frags = [] wltIdList = [] mList = [] fnumList = [] for filename in files: frags.append({}) with open(filename,'r') as f: allData = [line.strip() for line in f.readlines()] for line in allData: if line[:2].lower() in ['id','x1','x2','x3','x4','y1','y2','y3','y4','f1','f2','f3','f4']: frags[-1][line[:2].lower()] = line[3:].replace(' ','') m = hex_to_int(frags[-1]['id'][:2]) fnum = hex_to_int(frags[-1]['id'][2:4]) wltID = binary_to_base58(hex_to_binary(frags[-1]['id'][4:])) wltIdList.append([filename, wltID]) mList.append([filename, m]) fnumList.append([filename, fnum]) mset = set([x[1] for x in mList]) if len(mset)>1: print 'ERROR: Not all fragments use the same M-value!' for filename,m in mList: print ' %s: M=%d' % (filename, m) exit(0) idset = set([x[1] for x in wltIdList]) if len(idset)>1: print 'ERROR: Not all fragments are for the same wallet!' for filename,fid in wltIdList: print ' %s: %s' % (filename, fid) print 'If you are sure these are for the same wallet, check the "ID:" lines' exit(0) netbyte = base58_to_binary(wltIdList[0][1])[-1] if not netbyte==ADDRBYTE: print 'Wallet is for the wrong network!!!' print 'You are running on: %s' % NETWORKS[ADDRBYTE] if NETWORKS.has_key(netbyte): print 'Wallet is for: %s' % NETWORKS[netbyte] else: print 'Wallet is for: Unknown Network(%s)' % binary_to_hex(netbyte) exit(0) fnumset = set([x[1] for x in fnumList]) if len(fnumset)0: fragnum = fragMap['id'][2:4] fragMtrx.append( [hex_to_binary(fragnum), ''.join(f)] ) else: fragMtrx.append( [''.join(x), ''.join(y)] ) M = mList[0][1] testFrags = len(fragMtrx)>M wltID = wltIdList[0][1] sp = lambda x,n,s: s.join([x[i*n:i*n+n] for i in range((len(x)-1)/n+1)]) recon = ReconstructSecret(fragMtrx, M, 64) print 'Recovered paper backup: %s\n' % wltID pcs = [recon[i*16:(i+1)*16] for i in range(4)] for pc in pcs: print ' ', makeSixteenBytesEasy(pc) if not testRecon and len(argv[1:])>M: print '' print 'You have supplied more pieces (%d) than needed for reconstruction (%d).' % (len(argv[1:]), M) print 'Are you trying to run the reconstruction test instead of actually ' print 'recovering the wallet? If so, wallet recovery will be skipped. [Y/n]', response = raw_input('') if not response.lower().startswith('n'): testRecon = True if testRecon: import random print '' print 'Testing reconstruction on 20 subsets: ' dec = [(i,z[0],z[1]) for i,z in enumerate(fragMtrx)] for test in range(20): indices,xys = [0]*M, [[0,0] for i in range(M)] random.shuffle(dec) for j in range(M): indices[j], xys[j][0], xys[j][1]= dec[j] print ((' Using fragments (%s)' % ','.join(['%d']*M)) % tuple(sorted(indices))), sec = ReconstructSecret(xys, M, 64) print ' Reconstructed (first line of paper backup): %s' % makeSixteenBytesEasy(sec[:16]) exit(0) else: print '\nProceeding with wallet recovery...' print '' doEncr = raw_input('Would you like to encrypt the recovered wallet? [Y/n]: ') filename = 'armory_%s_recovered.wallet' % wltID name = 'Recovered wallet' descr = 'Wallet recovered from fragmented backup.' if doEncr.lower().startswith('y'): print 'Choose an encryption passphrase:' while True: passwd1 = getpass.getpass(' Passphrase: ') passwd2 = getpass.getpass(' Again: ') if not passwd1==passwd2: print 'Passphrases do not match! Try again...' elif len(passwd1)<5: print 'Passphrase is too short! Try again (5+ chars, 8 recommened)...' else: break print 'Set the key-stretching parameters:' kdfSec = 0.25 while True: try: inp = raw_input(' Seconds to compute (default 0.25): ') if len(inp.strip())==0: break kdfSec = float(inp) break except ValueError: raise print 'Bad value! Please enter compute time in seconds' kdfMaxMem = 32 while True: try: inp = raw_input(' Max RAM used, in MB (default 32): ') if len(inp.strip())==0: break kdfMaxMem = int(inp) break except ValueError: raise print 'Bad value! Please enter RAM usage in MB' passwd = SecureBinaryData(passwd1) print 'Creating new wallet...' newWallet = PyBtcWallet().createNewWallet( \ newWalletFilePath=filename, \ plainRootKey=recon[:32], \ chaincode=recon[32:], \ withEncrypt=True, \ securePassphrase=passwd, \ kdfTargSec=kdfSec, \ kdfMaxMem=kdfMaxMem, \ shortLabel=name, \ longLabel=descr, \ doRegisterWithBDM=False) newWallet.unlock(securePassphrase=passwd) else: newWallet = PyBtcWallet().createNewWallet( \ newWalletFilePath=filename, \ plainRootKey=recon[:32], \ chaincode=recon[32:], \ withEncrypt=False, \ shortLabel=name, \ longLabel=descr, \ doRegisterWithBDM=False) print 'Please wait while the address pool is being populated....' newWallet.fillAddressPool(doRegister=False) print '' print 'Successfully restored wallet!', filename print '' armory-0.92.3/extras/blk135687.hex0000644000000000000000000000423612414772654015117 0ustar rootroot01000000eb10c9a996a2340a4d74eaab41421ed8664aa49d18538bab59010000000000005a2f06efa9f2bd804f17877537f2080030cadbfa1eb50e02338117cc 604d91b9b7541a4ecfbb0a1a64f1ade70301000000010000000000000000000000000000000000000000000000000000000000000000ffffffff0804cfbb0a1a 02360affffffff0100f2052a01000000434104c2239c4eedb3beb26785753463be3ec62b82f6acd62efb65f452f8806f2ede0b338e31d1f69b1ce449558d7061 aa1648ddc2bf680834d3986624006a272dc21cac000000000100000003e8caa12bcb2e7e86499c9de49c45c5a1c6167ea4b894c8c83aebba1b6100f343010000 008c493046022100e2f5af5329d1244807f8347a2c8d9acc55a21a5db769e9274e7e7ba0bb605b26022100c34ca3350df5089f3415d8af82364d7f567a6a297f cc2c1d2034865633238b8c014104129e422ac490ddfcb7b1c405ab9fb42441246c4bca578de4f27b230de08408c64cad03af71ee8a3140b40408a7058a1984a9 f246492386113764c1ac132990d1ffffffff5b55c18864e16c08ef9989d31c7a343e34c27c30cd7caa759651b0e08cae0106000000008c4930460221009ec9aa 3e0caf7caa321723dea561e232603e00686d4bfadf46c5c7352b07eb00022100a4f18d937d1e2354b2e69e02b18d11620a6a9332d563e9e2bbcb01cee559680a 014104411b35dd963028300e36e82ee8cf1b0c8d5bf1fc4273e970469f5cb931ee07759a2de5fef638961726d04bd5eb4e5072330b9b371e479733c942964bb8 6e2b22ffffffff3de0c1e913e6271769d8c0172cea2f00d6d3240afc3a20f9fa247ce58af30d2a010000008c493046022100b610e169fd15ac9f60fe2b507529 281cf2267673f4690ba428cbb2ba3c3811fd022100ffbe9e3d71b21977a8e97fde4c3ba47b896d08bc09ecb9d086bb59175b5b9f03014104ff07a1833fd8098b 25f48c66dcf8fde34cbdbcc0f5f21a8c2005b160406cbf34cc432842c6b37b2590d16b165b36a3efc9908d65fb0e605314c9b278f40f3e1affffffff0240420f 00000000001976a914adfa66f57ded1b655eb4ccd96ee07ca62bc1ddfd88ac007d6a7d040000001976a914981a0c9ae61fa8f8c96ae6f8e383d6e07e77133e88 ac00000000010000000138e7586e0784280df58bd3dc5e3d350c9036b1ec4107951378f45881799c92a4000000008a47304402207c945ae0bbdaf9dadba07bdf 23faa676485a53817af975ddf85a104f764fb93b02201ac6af32ddf597e610b4002e41f2de46664587a379a0161323a85389b4f82dda014104ec8883d3e4f7a3 9d75c9f5bb9fd581dc9fb1b7cdf7d6b5a665e4db1fdb09281a74ab138a2dba25248b5be38bf80249601ae688c90c6e0ac8811cdb740fcec31dffffffff022f66 ac61050000001976a914964642290c194e3bfab661c1085e47d67786d2d388ac2f77e200000000001976a9141486a7046affd935919a3cb4b50a8a0c233c286c 88ac00000000 armory-0.92.3/extras/sample_armory_code.py0000644000000000000000000004110512414772654017355 0ustar rootrootimport sys sys.path.append('..') sys.path.append('.') from armoryengine import * from math import sqrt from time import sleep # Run at least one of the LoadBlockchain's if running anything after it run_WalletCreate = False run_LoadBlockchain_Async = False run_LoadBlockchain_Block = True run_WalletRescan = False run_DiffChangeList = True run_UniqueAddresses = False run_CumulativeSize = True run_TrafficCamera = False run_SatoshiDice = False ################################################################################ if run_WalletCreate: # NOTE: # ALL ADDRESSES THROUGHOUT EVERYTHING ARE IN 20-BYTE BINARY FORM (hash160/addr20) # Use hash160_to_addrStr() and addrStr_to_hash160() to convert... print '\n\nCreating a new C++ wallet, add a few addresses...' cppWallet = Cpp.BtcWallet() cppWallet.addAddress_1_( hex_to_binary('11b366edfc0a8b66feebae5c2e25a7b6a5d1cf31') ) # hash160 (hex) cppWallet.addAddress_1_( addrStr_to_hash160('1EbAUHsitefy3rSECh8eK2fdAWTUbpVUDN')[1] ) # addrStr cppWallet.addAddress_1_('\x1b~\xa7*\x85\t\x12\xb7=\xd4G\xf3\xbd\xc1\x00\xf1\x00\x8b\xde\xb0') # hash160 (bin) print 'Addresses in this wallet:' for i in range(cppWallet.getNumAddr()): print '\t', hash160_to_addrStr(cppWallet.getAddrByIndex(i).getAddrStr20()) print '\n\nRegistering the wallet with the BlockDataManager & loading...' TheBDM.registerWallet(cppWallet) ################################################################################ if run_LoadBlockchain_Async: """ By setting blocking=False, most calls to TheBDM will return immediately, after queuing the BDM to execute the operation in the background. You have to check back later to see when it's done. However, even when blocking is false, any functions that return data must block so the data can be returned. If you are in asynchronous mode, and don't want to ever wait for anything, always check TheBDM.getBDMState()=='BlockchainReady' before requesting data that will force blocking. """ start = RightNow() TheBDM.setBlocking(False) TheBDM.setOnlineMode(True) sleep(2) print 'Waiting for blockchain loading to finish', while not TheBDM.getBDMState()=='BlockchainReady': print '.', sys.stdout.flush() sleep(2) print 'Loading blockchain took %0.1f sec' % (RightNow() - start) topBlock = TheBDM.getTopBlockHeight() print '\n\nCurrent Top Block is:', topBlock TheBDM.getTopBlockHeader().pprint() ################################################################################ if run_LoadBlockchain_Block: start = RightNow() TheBDM.setBlocking(True) TheBDM.setOnlineMode(True) # The setOnlineMode should block until blockchain loading is complete print 'Loading blockchain took %0.1f sec' % (RightNow() - start) topBlock = TheBDM.getTopBlockHeight() print '\n\nCurrent Top Block is:', topBlock TheBDM.getTopBlockHeader().pprint() ################################################################################ if run_WalletRescan: print 'Inducing a rescan by adding a new address and requesting...' cppWallet.addAddress_1_( hex_to_binary('0cdcd0f388a31b11ff11b1d8d7a9f978b37bc7af') ) TheBDM.scanBlockchainForTx(cppWallet) print '\n\nBalance of this wallet:', coin2str(cppWallet.getSpendableBalance()) print 'Unspent outputs:' unspentTxOuts = cppWallet.getSpendableTxOutList(topBlock) for utxo in unspentTxOuts: utxo.pprintOneLine(topBlock) print '\n\nTransaction history of this wallet:' ledger = cppWallet.getTxLedger() for le in ledger: le.pprintOneLine() ################################################################################ if run_DiffChangeList: print '\n\n' print '-'*80 print 'Now for something completely different...' start = RightNow() print '\n\nCollect all difficulty changes...' print 'Block'.rjust(10), 'Difficulty'.rjust(14), '\t', 'Date' prevDiff = 0 maxDiff = hex_to_int('ff'*32) minDiff = maxDiff minDiffBlk = hex_to_int('ff'*32) for h in xrange(0,topBlock+1): header = TheBDM.getHeaderByHeight(h) currDiff = header.getDifficulty() thisHash = header.getThisHash() thisDiff = binary_to_int(thisHash); if thisDiff < minDiff: minDiff = thisDiff minDiffBlk = h if not prevDiff==currDiff: print str(h).rjust(10), print ('%0.1f'%currDiff).rjust(14), print '\t', unixTimeToFormatStr(header.getTimestamp()) prevDiff = currDiff from math import log print 'Took %0.1f seconds to collect difficulty list' % (RightNow()-start) print '\nBlock with the lowest difficulty:' print ' Block Num: ', minDiffBlk print ' Block Hash: ', int_to_hex(minDiff, 32, BIGENDIAN) print ' Equiv Difficult:', maxDiff/(minDiff * 2**32) print ' Equiv Diff bits:', log(maxDiff/minDiff)/log(2) print ' Block Header (hex): ' print ' ', binary_to_hex(TheBDM.getHeaderByHeight(minDiffBlk).serialize()) ################################################################################ if run_CumulativeSize: f = open('blksizelist.txt','w') cumul = 0 for h in xrange(0,topBlock+1): if h%10000 == 0: print '\tAccumulated %d blocks' % h header = TheBDM.getHeaderByHeight(h) cumul += header.getBlockSize() if (h%2016==0) or h+1>=topBlock: f.write('%d %d\n' % (h,cumul)) f.close() ################################################################################ if run_UniqueAddresses: start = RightNow() allAddr = set() totalTxOutEver = 0 for h in xrange(0,topBlock+1): if h%10000 == 0: print '\tScanned %d blocks' % h header = TheBDM.getHeaderByHeight(h) txList = header.getTxRefPtrList() for txref in txList: tx = txref.getTxCopy() for nout in range(tx.getNumTxOut()): txout = tx.getTxOut(nout) if txout.isStandard(): allAddr.add(txout.getRecipientAddr()) totalTxOutEver += 1 print 'Took %0.1f seconds to count all addresses' % (RightNow()-start) print 'There are %d unique addresses in the blockchain!' % len(allAddr) print 'There are %d standard TxOuts in all blocks' % totalTxOutEver ################################################################################ if run_TrafficCamera: # will fill this in later pass ################################################################################ if run_SatoshiDice: print '\n\nLet look at all the bets ever placed at SatoshiDice.com' # First, get the Satoshi dice page so we can extract the addresses and payouts import urllib httppage = urllib.urlopen('http://www.satoshidice.com').read().split('\n') # Given this line is part of the wager/addr table, get all the data from it def extractLineData(line): line2 = line.replace('<','~').replace('>','~').replace('=','~').replace(' ','~') pcs = line2.split('~') out = [] ltflag = False for pc in pcs: if pc=='lessthan': ltflag = True if ltflag and pc.isdigit(): out.append(pc) ltflag = False if pc.startswith('1dice') or pc.endswith('%') or pc.endswith('x'): out.append(pc) return out # We have a webpage and a method to process the relevant lines diceTargetMap = {} dicePctWinMap = {} diceWinMultMap = {} diceLoseMultMap = {} diceBetsMadeMap = {} diceBetsPaidOut = {} diceBetsMadeMapList = {} WIN, LOSE, REFUND = 0,1,2 for line in httppage: if 'lessthan' in line and '1dice' in line: targ,addr,winr,mult,hous,rtrn = extractLineData(line) diceAddr = addrStr_to_hash160(addr)[1] diceTargetMap[diceAddr] = int(targ) dicePctWinMap[diceAddr] = float(winr[:-1])/100.0 diceWinMultMap[diceAddr] = float(mult[:-1]) diceLoseMultMap[diceAddr] = 0.005 # looks to be a static 0.5% now, spread is all in the win mult diceBetsMadeMap[diceAddr] = 0 diceBetsPaidOut[diceAddr] = [0, 0, 0] diceBetsMadeMapList[diceAddr] = [] betsIn = {} sdRecvAmt = 0 sdRtrnAmt = 0 sdFeePaid = 0 totalBets = 0 def getTxFee(tx): btcIn, btcOut = 0,0 for i in range(tx.getNumTxIn()): btcIn += TheBDM.getSentValue(tx.getTxIn(i)) for i in range(tx.getNumTxOut()): btcOut += tx.getTxOut(i).getValue() return (btcIn - btcOut) # Approximation of a bet's variance isn't good enough for me. Assume fair # odds, compute exactly! These are the stats for SatoshiDice.com bank acct def computeWagerStats(amt, diceAddr): # SD loses money on winning bets, gains money on losing bets #afterFee = amt - 0.0005e8 #winAmt = afterFee - diceWinMultMap[diceAddr]*amt #winPct = diceTargetMap[diceAddr] / 65536.0; #losAmt = afterFee - diceLoseMultMap[diceAddr]*amt #losPct = 1-winPct # Modified calculation to produce theoretical numbers assuming better # game design payout = 0.97 afterFee = amt winAmt = afterFee - payout*amt winPct = diceTargetMap[diceAddr] / 65536.0; losAmt = afterFee - ((1-payout)/2)*amt losPct = 1-winPct avg = winPct*winAmt + losPct*losAmt var = (winPct*(winAmt-avg)**2) + (losPct*(losAmt-avg)**2) #print amt, diceTargetMap[diceAddr], diceWinMultMap[diceAddr], diceLoseMultMap[diceAddr] #print winAmt, winPct, losAmt, losPct #print avg, var, sqrt(var) #print coin2str(avg), coin2str(var), coin2str(sqrt(var)) #print '\n' return [avg, var] completedIn = 0.0 completedOut = 0.0 totalAvgSum = 0.0 totalVarSum = 0.0 firstSDTxPassed = False totalSDBytes = 0 totalBCBytes = 0 totalSDTx = 0 totalBCTx = 0 fileAllBets = open('sdAllBets.txt','w') try: for h in xrange(175000,topBlock+1): if h%10000 == 0: print '\tSearched %d blocks' % h header = TheBDM.getHeaderByHeight(h) txList = header.getTxRefPtrList() for txref in txList: tx = txref.getTxCopy() # Check every TxOut in this transaction for SatoshiDice bets txHash = tx.getThisHash() if firstSDTxPassed: totalBCBytes += tx.getSize() totalBCTx += 1 thisIsAWager = False for nout in range(tx.getNumTxOut()): txout = tx.getTxOut(nout) if txout.isStandard(): if dicePctWinMap.has_key(txout.getRecipientAddr()): # This is a SatoshiDice bet! firstSDTxPassed = True # Add this to the total tx/byte count, first time if not thisIsAWager: totalSDBytes += tx.getSize() totalSDTx += 1 thisIsAWager = True totalBets += 1 diceAddr = txout.getRecipientAddr() betAmt = txout.getValue() betWin = betAmt * diceWinMultMap[diceAddr] betLos = betAmt * diceLoseMultMap[diceAddr] firstTxIn = tx.getTxIn(0) bettorAddr = TheBDM.getSenderAddr20(firstTxIn) ## Create the serialized OutPoint, store the tx outpointStr = txHash + int_to_binary(nout, widthBytes=4) betsIn[outpointStr] = [betAmt, betWin, betLos, diceAddr, bettorAddr] sdRecvAmt += betAmt diceBetsMadeMap[diceAddr] += 1 winPct = diceTargetMap[diceAddr] / 65536.0; losPct = 1-winPct winMult = diceWinMultMap[diceAddr] losMult = diceLoseMultMap[diceAddr] fileAllBets.write('%s %d %f %f %f %f\n' % (coin2str(betAmt), diceTargetMap[diceAddr], winPct, winMult, losPct, losMult)) for nin in range(tx.getNumTxIn()): txin = tx.getTxIn(nin) op = txin.getOutPoint() opStr = op.getTxHash() + int_to_binary(op.getTxOutIndex(), widthBytes=4) returned = -1 if betsIn.has_key(opStr): betAmt, betWin, betLos, diceAddr, addr160 = betsIn[opStr] for nout in range(tx.getNumTxOut()): if addr160 == tx.getTxOut(nout).getRecipientAddr(): returned = tx.getTxOut(nout).getValue() sdRtrnAmt += returned sdFeePaid += getTxFee(tx) completedIn += betAmt completedOut += returned avg, var = computeWagerStats(betAmt, diceAddr) totalAvgSum += avg totalVarSum += var diceBetsMadeMapList[diceAddr].append(betAmt) totalSDBytes += tx.getSize() totalSDTx += 1 break if returned==-1: print 'Did not find recip, failed...' continue else: if returned <= betLos*1.25: diceBetsPaidOut[diceAddr][LOSE] += 1 elif abs(returned - betAmt) < betLos/2.0: diceBetsPaidOut[diceAddr][REFUND] += 1 else: diceBetsPaidOut[diceAddr][WIN] += 1 del betsIn[opStr] break except: raise print 'Unaccounted-for Bets:' i = 0 unacctBTC = 0 for key,val in betsIn.iteritems(): txid = binary_to_hex(key[:32 ]) outidx = binary_to_int(key[ 32:]) betAmt = val[0] sdAddr = val[3] recip1 = val[4] #print i, hex_switchEndian(txid), '%03d'%outidx, coin2str(betAmt), #print hash160_to_addrStr(sdAddr)[:8], hash160_to_addrStr(recip1)[:8] i += 1 unacctBTC += betAmt print 'Results:', unixTimeToFormatStr(RightNow()) print '' print 'Address'.rjust(10), print 'Target'.rjust(8), print 'Should Win'.rjust(12), '|', print '#Bets'.rjust(8), '|', print 'Win'.center(16), '|', print 'Lose'.center(16), '|', print 'Refunds'.center(17), '|', print 'Accounted-for' print '-'*118 totalBets = 0 diceAddrList = [] for a160,ct in diceBetsMadeMap.iteritems(): diceAddrList.append([a160, diceTargetMap[a160]]) diceAddrList.sort(key=(lambda x: x[1])) for a160,targ in diceAddrList: total = diceBetsMadeMap[a160] winners = diceBetsPaidOut[a160][WIN] losers = diceBetsPaidOut[a160][LOSE] refunds = diceBetsPaidOut[a160][REFUND] total2 = winners+losers print hash160_to_addrStr(a160)[:9].rjust(10), print str(targ).rjust(8), print ('%0.5f' % (targ/65536.)).rjust(12), print '|', str(total).rjust(8), print '|', str(winners).rjust(6), ('(%0.5f)'%(winners/float(total2))).rjust(8), print '|', str(losers).rjust(6), ('(%0.5f)'%(losers/float(total2))).rjust(8), print '|', str(refunds).rjust(6), ('(%0.5f)'%(refunds/float(total2))).rjust(8), print '|', '(%0.3f)'.rjust(10) % ((winners+losers+refunds)/float(total)) totalBets += total print '-'*118 print ' '*32, '|', str(totalBets).rjust(8), '|' print '' print '-'*118 print 'Total Bets Made: ', totalBets print 'Cumulative Wagers: ', coin2str(sdRecvAmt), 'BTC' print 'Cumulative Rewards: ', coin2str(sdRtrnAmt), 'BTC' print 'Cumulative Fees Paid: ', coin2str(sdFeePaid), 'BTC' print 'Cumulative Unreturned: ', coin2str(unacctBTC), 'BTC' print '----' print 'SD Profit/Loss From Games: ', coin2str(sdRecvAmt - sdRtrnAmt), 'BTC' print 'SD Profit/Loss With Fees: ', coin2str(sdRecvAmt - (sdRtrnAmt + sdFeePaid)), 'BTC' #f = open('bethist.txt','w') #for a160,targ in diceAddrList: #f.write(str(targ)+'\n') #f.write(' '.join([coin2str(b) for b in diceBetsMadeMapList[a160]])) #f.write('\n') #f.close() BtoMB = lambda x: float(x)/(1024*1024.) print 'Since Satoshi Dice started, there have been:' print 'Blockchain Tx: %d : SatoshiDice Tx: %d (%0.1f%%)' % (totalBCTx, totalSDTx, 100*float(totalSDTx)/totalBCTx) print 'Blockchain MB: %0.1f : SatoshiDice Tx: %0.1f (%0.1f%%)' % (BtoMB(totalBCBytes), BtoMB(totalSDBytes), 100*float(totalSDBytes)/totalBCBytes) armory-0.92.3/extras/__init__.py0000644000000000000000000000000012414772654015235 0ustar rootrootarmory-0.92.3/extras/armoryengine_basics.py0000644000000000000000000001117712414772654017542 0ustar rootroot#! /usr/bin/python import sys sys.path.append('..') from armoryengine import * # Integer/Hex/Binary/Base58 Conversions print '\nInteger/Hex/Binary/Base58 Conversions' print 1, hex_to_int('0f33') print 2, hex_to_int('0f33', BIGENDIAN) print 3, int_to_hex(13071) print 4, int_to_hex(13071, widthBytes=4) print 5, int_to_hex( 3891, widthBytes=4, endOut=BIGENDIAN) print 6, [int_to_binary(65535, widthBytes=4)] print 7, binary_to_int('ffff') print 8, binary_to_hex('\x00\xff\xe3\x4f') print 9, [hex_to_binary('00ffe34f')] print 10, binary_to_base58('\x00\xff\xe3\x4f') print 11, [base58_to_binary('12Ux6i')] print '\nHash functions:' print 12, binary_to_hex( sha256('Single-SHA256') ) print 13, binary_to_hex( hash256('Double-SHA256') ) print 14, binary_to_hex( hash160('ripemd160(sha256(X))') ) print 15, binary_to_hex( HMAC512('secret', 'MsgAuthCode') )[:24] print '\nMay need to switch endian to match online tools' addr160Hex = binary_to_hex( hash160('\x00'*65) ) print 16, hex_switchEndian( addr160Hex ) print 17, binary_to_hex( hash160('\x00'*65), BIGENDIAN ) print '\nAddress Conversions:' donateStr = '1ArmoryXcfq7TnCSuZa9fQjRYwJ4bkRKfv' donate160 = addrStr_to_hash160(donateStr) donateStr2 = hash160_to_addrStr(donate160) print 18, binary_to_hex(donate160) print 19, binary_to_hex(donate160, BIGENDIAN) print 20, donateStr2 print '\nBuiltin Constants and magic numbers:' print 21, 'BITCOIN_PORT: ', BITCOIN_PORT print 22, 'BITCOIN_RPC_PORT:', BITCOIN_RPC_PORT print 23, 'ARMORY_RPC_PORT: ', ARMORY_RPC_PORT print 24, 'MAGIC_BYTES: ', binary_to_hex(MAGIC_BYTES) print 25, 'GENESIS_BLK_HASH:', GENESIS_BLOCK_HASH_HEX print 26, 'GENESIS_TX_HASH: ', GENESIS_TX_HASH_HEX print 27, 'ADDRBYTE: ', binary_to_hex(ADDRBYTE) print 28, 'NETWORK: ', NETWORKS[ADDRBYTE] print 29, 'P2SHBYTE: ', binary_to_hex(P2SHBYTE) print 30, 'PRIVKEYBYTE: ', binary_to_hex(PRIVKEYBYTE) print '\nDetected values and CLI_OPTIONS:' print 31, ' Operating System :', OS_NAME print 32, ' OS Variant :', OS_VARIANT print 33, ' User home-directory :', USER_HOME_DIR print 34, ' Satoshi BTC directory :', BTC_HOME_DIR print 35, ' Armory home dir :', ARMORY_HOME_DIR print 36, ' LevelDB directory :', LEVELDB_DIR print 37, ' Armory settings file :', SETTINGS_PATH print 38, ' Armory log file :', ARMORY_LOG_FILE print '\nSystem Specs:' print 39, ' Total Available RAM : %0.2f GB' % SystemSpecs.Memory print 40, ' CPU ID string :', SystemSpecs.CpuStr print 41, ' Number of CPU cores : %d cores' % SystemSpecs.NumCores print 42, ' System is 64-bit :', str(SystemSpecs.IsX64) print 43, ' Preferred Encoding :', locale.getpreferredencoding() print '\nRandom other utilities' print 44, ' Curr unix time :', RightNow() print 45, ' Curr formatted time :', unixTimeToFormatStr(RightNow()) print 46, ' 123456 seconds is :', secondsToHumanTime(123456) print 47, ' 123456 bytes is :', bytesToHumanSize(123456) print '\nCoin2Str functions align the decimal point' print 48, ' coin2str(0.01 BTC) :', coin2str(0.01 * ONE_BTC) print 49, ' coin2str(0.01 BTC) :', coin2str(1000000, maxZeros=4) print 50, ' coin2str(0.01 BTC) :', coin2str(1000000, maxZeros=0) print 51, ' coin2str(0.01 BTC) :', coin2str(2300500000, maxZeros=0) print 51, ' coin2str(0.01 BTC) :', coin2str(160400000000, maxZeros=0) print 51, ' coin2str(0.01 BTC) :', coin2str(10000000, maxZeros=0) print '\nRaw crypto operations:' privKey = SecureBinaryData('\xa3'*32) pubKey = CryptoECDSA().ComputePublicKey(privKey) addrStr = hash160_to_addrStr( hash160(pubKey.toBinStr()) ) print 'Raw Private Key:', privKey.toHexStr() print 'Raw Public Key: ', pubKey.toHexStr() print 'Raw Address Str:', addrStr print 'Encoded PrivKey:', encodePrivKeyBase58(privKey.toBinStr()) print '\nPyBtcAddress Operations' addrObj = PyBtcAddress().createFromPlainKeyData(privKey) privKey = addrObj.serializePlainPrivateKey() pubKey = addrObj.serializePublicKey() addrStr = addrObj.getAddrStr() addr160 = addrObj.getAddr160() binSig = addrObj.generateDERSignature('A msg to be signed!') verified = addrObj.verifyDERSignature('A msg to be signed!', binSig) print 'Obj Private Key:', binary_to_hex(privKey) print 'Obj Public Key: ', binary_to_hex(pubKey) print 'Obj Address Str:', addrStr print 'Obj Address 160:', hex_switchEndian( binary_to_hex(addr160) ) print 'Obj Signature: ', binary_to_hex(binSig) print 'Obj SigVerifies:', verified print '\nUse .pprint() members of objects for debugging' addrObj.pprint() print '\nUse pprintHex to visually break up large blocks of hex' pprintHex( binary_to_hex( sha256('a')[:13] * 12 ) ) armory-0.92.3/extras/mysteryHex.py0000644000000000000000000004077712414772654015710 0ustar rootroot#! /usr/bin/python from os import path import sys from optparse import OptionParser sys.path.append('..') from pybtcengine import * HASHCODE_HEADER = 1 HASHCODE_MERKLE = 2 HASHCODE_TX = 3 ################################################################################ ################################################################################ def figureOutMysteryHex(hexStr, hashDict={}): binStr = hex_to_binary(hexStr) print '\n' + '-'*80 print '\nStarting hex data:', len(binStr), 'bytes' hexStr.replace(' ','') pprintHex(hexStr, ' ') print '\n' + '-'*80 # These search terms only give us hints about where things are. We have more # operations to determine if something is actually behind these strings hintStr = {} hintStr['Empty4B' ] = hex_to_binary('00000000' ) hintStr['Version' ] = hex_to_binary('01000000' ) hintStr['PkStart' ] = hex_to_binary('76a9' ) hintStr['PkEnd' ] = hex_to_binary('88ac' ) hintStr['SeqNum' ] = hex_to_binary('ffffffff' ) # These search terms are simple, self-explanatory terms. We find them, flag # them and we're done. simpleList = [] simpleList.append(['f9beb4d9', 'MagicNum', 'Main network magic bytes (f9beb4d9)']) simpleList.append(['fabfb5da', 'MagicNum', 'Test network magic bytes (fabfb5da)']) simpleList.append(['76657261636b', 'VERACK', 'Version acknowledgement message']) simpleList.append(['76657273696f6e', 'VersionMsg', 'Version declaration message']) simpleList.append(['61646472', 'AddressMsg', 'Address declaration message']) # To verify a timestamp, check it's between 2009 and today + 10days timeMin = time.mktime( (2009,1,1,0,0,0,0,0,-1)) timeMax = time.time() + 10*86400 # Exclusive list of [Name, startIdx, endIdx, hexSubstr, toPrintAfter] # Exlucsive means that if we already identified something there, we don't # search it again idListExcl = [] # Inclusive list of multipe random things. Inclusive means that even if # we already identified a transaction somewhere, we will still ID all the # scripts in it, even though it's technically already flagged as ID'd idListSimple = [] # This is a running mask of what bytes have been identified already maskAll = [0]*len(binStr) # This method will return all indices that match the substring "findBin" # excluding matches inside chunks already ID'd def getIdxListNotIdYet(findBin, theMask): versIdx = [] findIdx = binStr.find(findBin) while not findIdx == -1: if not theMask[findIdx] == 1: versIdx.append(findIdx) findIdx = binStr.find(hintStr['Version'],findIdx+1) return versIdx # Return all matches for the string, regardless of whether it's ID'd already def getIdxList(findBin): versIdx = [] findIdx = binStr.find(findBin) while not findIdx == -1: versIdx.append(findIdx) findIdx = binStr.find(findBin,findIdx+1) return versIdx ############################################################################ # Search for version numbers which will help us find Tx's and BlockHeaders ############################################################################ versIdx = getIdxListNotIdYet(hintStr['Version'], maskAll) for idx in versIdx: # Check for block Header: hash has leading zeros and timestamp is sane if idx<=len(binStr)-80: hashZeros = binStr[idx+32:idx+36] == hintStr['Empty4B'] validTime = timeMin < binary_to_int(binStr[idx+68:idx+72]) < timeMax if hashZeros and validTime: bin80 = binStr[idx:idx+80] blkhead = PyBlockHeader().unserialize(bin80) idListExcl.append(['BlockHeader', idx, idx+80, binary_to_hex(bin80), blkhead]) maskAll[idx:idx+80] = [1]*80 continue # If not a header, check to see if it's a Tx try: testTx = PyTx().unserialize(binStr[idx:]) if len(testTx.inputs) < 1 or len(testTx.outputs) < 1: raise Exception for inp in testTx.inputs: if not inp.intSeq==binary_to_int(hintStr['SeqNum']): raise Exception # If we got here, the sequence numbers should be sufficient evidence for # declaring this is a transaction txBin = testTx.serialize() txLen = len(txBin) txHex = binary_to_hex(txBin) idListExcl.append(['Transaction', idx, idx+txLen, txHex, testTx]) maskAll[idx:idx+txLen] = [1]*txLen except: # Obviously wasn't a transaction, either continue pubkeyList = [ ] # Try to find a PkScript pkIdx = getIdxListNotIdYet(hintStr['PkStart'], maskAll) for idx in pkIdx: if binStr[idx+23:idx+25] == hintStr['PkEnd']: addrStr = PyBtcAddress().createFromPublicKeyHash160(binStr[idx+3:idx+23]) extraInfo = addrStr.getAddrStr() idListSimple.append(['TxOutScript', idx, idx+25, extraInfo, '']) maskAll[idx:idx+25] = [1]*25 startCBPK = hex_to_binary('04') pkIdx = getIdxListNotIdYet(startCBPK, maskAll) for idx in pkIdx: if idx > len(binStr)-65: continue try: addrStr = PyBtcAddress().createFromPublicKey(binStr[idx:idx+65]) extraInfo = addrStr.calculateAddrStr() if not idx+65==len(binStr) and binStr[idx+65] == hex_to_binary('ac'): idListSimple.append(['CoinbaseScript', idx, idx+66, extraInfo, '']) maskAll[idx:idx+66] = [1]*66 else: idListSimple.append(['BarePublicKey', idx, idx+65, extraInfo, '']) maskAll[idx:idx+65] = [1]*65 if idx>0 and binStr[idx-1] == hex_to_binary('41'): idListSimple[-1][1] -= 1 # get the 41 that's there if it's a script maskAll[idx-1] = 1 except: pass # I guess this wasn't a PK after all... ############################################################################ # Random straightforward things to search for without any extra computation. ############################################################################ for triplet in simpleList: foundIdx = getIdxList( hex_to_binary(triplet[0])) for idx in foundIdx: idListSimple.append([triplet[1], idx, idx+len(triplet[0])/2, triplet[2], '']) # If we have a useful dictionary of hashes, let's use it if len(hashDict) > 0: for i in range(len(binStr)-31): if maskAll[i] == 1: continue str32 = binStr[i:i+32] if hashDict.has_key(str32): hashcode = hashDict[str32] if hashcode==HASHCODE_HEADER: hashCode = 'HeaderHash' elif hashcode==HASHCODE_MERKLE: hashCode = 'MerkleRoot' elif hashcode==HASHCODE_TX: hashCode = 'TxHash' else: hashCode = 'UnknownHash' idListSimple.append([hashCode, i, i+32, binary_to_hex(str32), '']) elif hashDict.has_key(binary_switchEndian(str32)): hashcode = hashDict[binary_switchEndian(str32)] if hashcode==HASHCODE_HEADER: hashCode = 'HeaderHash(BE)' elif hashcode==HASHCODE_MERKLE: hashCode = 'MerkleRoot(BE)' elif hashcode==HASHCODE_TX: hashCode = 'TxHash(BE)' else: hashCode = 'UnknownHash' idListSimple.append([hashCode, i, i+32, binary_to_hex(str32), '']) ############################################################################ # Done searching for stuff. Print results ############################################################################ for ids in idListExcl: print '' print '#'*100 idx0,idx1 = ids[1], ids[2] # If this is a Tx or BH, need to pprint the last arg hexToPrint = ['-'] * 2*len(binStr) if ids[0] == 'Transaction' or ids[0] == 'BlockHeader': hexToPrint[2*ids[1]:2*ids[2]] = ids[3] print 'Found: ', ids[0] print 'Size:', idx1-idx0, 'bytes' print 'Bytes: %d to %d (0x%s to 0x%s)' % (idx0, idx1, \ int_to_hex(idx0, 4, BIGENDIAN), \ int_to_hex(idx1, 4, BIGENDIAN)) pprintHex( ''.join(hexToPrint), ' ') print '' ids[4].pprint(1) print '' print '#'*100 # Print all the simple stuff onto a single bytemap print 'Other assorted things:' idListSimple.sort(key=lambda x: x[1]) hexToPrint = ['-'] * 2*len(binStr) ReprList = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz' for j,ids in enumerate(idListSimple): i1 = ids[1] i2 = ids[2] nb = i2-i1 maskAll[i1:i2] = [1]*nb hexToPrint[2*i1:2*i2] = ReprList[j]*2*nb hexToPrint = ''.join(hexToPrint) pprintHex(hexToPrint, ' ') print '' for j,ids in enumerate(idListSimple): print ' ', ReprList[j] + ':', ids[0].ljust(16,' '), ':', ids[3] print '\n\nUnidentified bytes' maskedBytes = ['--' if maskAll[i] == 1 else hexStr[2*i:2*i+2] for i in range(len(binStr))] pprintHex(''.join(maskedBytes)); ################################################################################ ################################################################################ def updateHashList(hashfile, blkfile, rescan=False): print '' print '\t.Updating hashlist from the blockchain file in your bitcoin directory' print '\t.This will take 1-5 min the first time you run this script (and on rescan)' print '\t\t.Hashfile: ', hashfile print '\t\t.BlockFile:', blkfile if not path.exists(hashfile) or rescan: hf = open('knownHashes.bin','wb') hf.write('\x00'*8) hf.close() hf = open(hashfile, 'rb') startBlkByte = binary_to_int(hf.read(8)) hf.close() assert(path.exists(blkfile)) blkfileSize = os.stat(blkfile).st_size bf = open(blkfile, 'rb') hf = open(hashfile, 'r+') hf.write(int_to_binary(blkfileSize, widthBytes=8)) hf.seek(0,2) # start writing at the end of the file # The first 8 bytes of the hashfile tells us where to start searching # blk0001.dat (so we don't recompute every time). We need to rewrite # this value every time bf.seek(startBlkByte, 0) # seek to this point in the file binunpack = BinaryUnpacker(bf.read()) newBlocksRead = 0 newHashes = 0 while( binunpack.getRemainingSize() > 0): binunpack.advance(4) # magic sz = binunpack.get(UINT32) # total bytes in this block thisHeader = PyBlockHeader().unserialize(binunpack) hf.write(thisHeader.theHash + '\x01') hf.write(thisHeader.merkleRoot + '\x02') thisData = PyBlockData().unserialize(binunpack) for tx in thisData.txList: hf.write(tx.thisHash + '\x03') newHashes += 2 + len(thisData.txList) if newBlocksRead==0: print '\n\t\tReading blocks...', newBlocksRead += 1 if(newBlocksRead%1000==0): if(newBlocksRead%10000==0): print '\n\t\tRead', newBlocksRead, 'blocks', print '.', sys.stdout.flush() print '\n\t.Updated hashfile with %d bytes / %d hashes / %d blocks from blkfile' % \ (blkfileSize-startBlkByte, newHashes, newBlocksRead) hf.close() if __name__ == '__main__': print '\nTry to identify Bitcoin-related strings in a block of data' parser = OptionParser(usage='USAGE: %prog [--binary|-b] -f FILE \n or: %prog unidentifiedHex') parser.add_option('-f', '--file', dest='filename', \ help='Get unidentified data from this file') parser.add_option('-k', '--blkfile', dest='blk0001file', default='', \ help='Update hashlist from this file (default ~/.bitcoin/blk0001.dat)') parser.add_option('-g', '--hashfile', dest='hashfile', default='./knownHashes.bin', \ help='The file to store and retrieve header/tx hashes') parser.add_option('-b', '--binary', action='store_false', dest='isHex', default=True, \ help='Specified file is in binary') parser.add_option('--byterange', dest='byterange', default='all', \ help='Bytes to read, --byterange=0,100') parser.add_option('-s', '--usehashes', action='store_true', dest='useHashes', default=False, \ help='Import header/tx hashes to be used in searching') parser.add_option('-u', '--noupdatehashes', action='store_false', dest='updateHashes', default=True, \ help='Disable searching blk0001.dat to update hashlist (ignored without -s)') parser.add_option('-r', '--rescanhashes', action='store_true', dest='doRescan', default=False, \ help='Rescan blkfile for header/tx hashes') #parser.add_option('-t', '--testnet', action='store_true', dest='testnet', default=False, \ #help='Run the script using testnet data/addresses') # Should add option for picking (start,end) bytes for files that are long #parser.add_option('-o', '--outfile', dest='outfile', default='', \ #help='Redirect results to output file') (opts, args) = parser.parse_args() fn = opts.filename isHex = opts.isHex blkfile = opts.blk0001file hashfile = opts.hashfile #outfile = opts.outfile if len(blkfile)==0 and opts.updateHashes: import platform opsys = platform.system() if 'win' in opsys.lower(): blkfile = path.join(os.getenv('APPDATA'), 'Bitcoin', 'blk0001.dat') if 'nix' in opsys.lower() or 'nux' in opsys.lower(): blkfile = path.join(os.getenv('HOME'), '.bitcoin', 'blk0001.dat') if 'mac' in opsys.lower() or 'osx' in opsys.lower(): blkfile = os.path.expanduser('~/Library/Application Support/Bitcoin/blk0001.dat') # A variety of error conditions if fn == None and len(args)==0: parser.error('Please supply hex data or a file with unidentified data\n') if not fn == None and not path.exists(fn): parser.error('Cannot find ' + fn) if fn == None and not isHex: parser.error('Cannot read binary data from command line. Please put it in a file and use -f option') if not path.exists(blkfile) and opts.useHashes and opts.updateHashes: print 'Cannot find blockdata file', blkfile, '... proceeding without updating hashes' opts.updateHashes = False if not opts.useHashes: print '\t(use the -s option to enable search for header/tx hashes from blk0001.dat)' byteStart,byteStop = 0,0 print opts.byterange if not opts.byterange=='all': byteStart,byteStop = [int(i) for i in opts.byterange.split(',')] # Update the knownHashes.txt file, if necessary if(opts.useHashes and opts.updateHashes): updateHashList(hashfile, blkfile, opts.doRescan) # If we plan to use it, populate a dictionary of hashes hashDict = {} if(opts.useHashes): hfile = open(hashfile, 'rb') skip = hfile.read(8) binaryHashes = hfile.read() hfile.close() print '\t.Reading %s (%0.1f MB)' % (hashfile, len(binaryHashes)/float(1024**2)) if not opts.updateHashes: print '\t (remove -u flag to update hashlist with recent blocks from blk0001.dat' nHash = len(binaryHashes) / 33 for i in range(nHash): loc = i*33 hash32 = binaryHashes[loc:loc+32] code = binaryHashes[loc+32] hashDict[hash32] = binary_to_int(code) print '\t.Hash dictionary populated with %d hashes from %s' % (len(hashDict),hashfile) binaryToSearch = [] if not fn == None: if not isHex: f = open(fn, 'rb') binaryToSearch = '' if byteStop<=byteStart: binaryToSearch = f.read() else: f.seek(byteStart,0); binaryToSearch = f.read(byteStop-byteStart) f.close() else: f = open(fn, 'r') hexLines = f.readlines() hexToSearch = ''.join([l.strip().replace(' ','') for l in hexLines]) if not byteStop<=byteStart: hexToSearch = hexToSearch[2*byteStart:2*byteStop] try: binaryToSearch = hex_to_binary(hexToSearch) except: print 'Error processing %s. If this is a binary file, please use the -b flag' % (fn,) exit(0) else: # pull data from the remaining arguments (which must be hex) hexToSearch = ''.join(args) binaryToSearch = hex_to_binary(hexToSearch.replace(' ','')) # Yeah, I know we just converted it to binary, now back to hex figureOutMysteryHex(binary_to_hex(binaryToSearch), hashDict) armory-0.92.3/extras/scriptTests.txt0000644000000000000000000002354612414772654016240 0ustar rootroot2-of-2 Transaction without OP_CHECKMULTISIG Testnet Tx Hash: 1c9608650a912be7fa88eecec664e6fbfa4b676708697fa99c28b3370005f32d PrevOutScript: 526b006b7dac7ca914fc1243972b59c1726735d3c5cca40e415039dce9879a6c936b7dac7ca914375dd72e03e7b5dbb49f7e843b7bef4a2cc2ce9e879a6c936b6c6ca2 CurrInScript: 483045022017462c29efc9158cf26f2070d444bb2b087b8a0e6287a9274fa36fad30c46485022100c6d4cc6cd504f768389637df71c1ccd452e0691348d0f418130c31da8cc2a6e8014104e83c1d4079a1b36417f0544063eadbc44833a992b9667ab29b4ff252d8287687bad7581581ae385854d4e5f1fcedce7de12b1aec1cb004cabb2ec1f3de9b2e60493046022100fdc7beb27de0c3a53fbf96df7ccf9518c5fe7873eeed413ce17e4c0e8bf9c06e022100cc15103b3c2e1f49d066897fe681a12e397e87ed7ee39f1c8c4a5fef30f4c2c60141047cf315904fcc2e3e2465153d39019e0d66a8aaec1cec1178feb10d46537427239fd64b81e41651e89b89fefe6a23561d25dddc835395dd3542f83b32a1906aeb CurrRawTx: 01000000011c9608650a912be7fa88eecec664e6fbfa4b676708697fa99c28b3370005f32d01000000fd1701483045022017462c29efc9158cf26f2070d444bb2b087b8a0e6287a9274fa36fad30c46485022100c6d4cc6cd504f768389637df71c1ccd452e0691348d0f418130c31da8cc2a6e8014104e83c1d4079a1b36417f0544063eadbc44833a992b9667ab29b4ff252d8287687bad7581581ae385854d4e5f1fcedce7de12b1aec1cb004cabb2ec1f3de9b2e60493046022100fdc7beb27de0c3a53fbf96df7ccf9518c5fe7873eeed413ce17e4c0e8bf9c06e022100cc15103b3c2e1f49d066897fe681a12e397e87ed7ee39f1c8c4a5fef30f4c2c60141047cf315904fcc2e3e2465153d39019e0d66a8aaec1cec1178feb10d46537427239fd64b81e41651e89b89fefe6a23561d25dddc835395dd3542f83b32a1906aebffffffff01c0d8a700000000001976a914fc1243972b59c1726735d3c5cca40e415039dce988ac00000000 Pretty TxIn Script: [PUSHDATA -- 72 BYTES:] 3045022017462c29efc9158cf26f2070d444bb2b087b8a0e6287a9274fa36fad30c46485022100c6d4cc6cd504f768389637df71c1ccd452e0691348d0f418130c31da8cc2a6e801 [PUSHDATA -- 65 BYTES:] 04e83c1d4079a1b36417f0544063eadbc44833a992b9667ab29b4ff252d8287687bad7581581ae385854d4e5f1fcedce7de12b1aec1cb004cabb2ec1f3de9b2e60 [PUSHDATA -- 73 BYTES:] 3046022100fdc7beb27de0c3a53fbf96df7ccf9518c5fe7873eeed413ce17e4c0e8bf9c06e022100cc15103b3c2e1f49d066897fe681a12e397e87ed7ee39f1c8c4a5fef30f4c2c601 [PUSHDATA -- 65 BYTES:] 047cf315904fcc2e3e2465153d39019e0d66a8aaec1cec1178feb10d46537427239fd64b81e41651e89b89fefe6a23561d25dddc835395dd3542f83b32a1906aeb Pretty TxOut Script: 2 OP_TOALTSTACK OP_0 OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] fc1243972b59c1726735d3c5cca40e415039dce9 OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 375dd72e03e7b5dbb49f7e843b7bef4a2cc2ce9e OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_FROMALTSTACK OP_FROMALTSTACK OP_GREATERTHANOREQUAL 2-of-3 Transaction without OP_CHECKMULTISIG Testnet Tx Hash: 2f654d4d1d7246d1a824c5b6c5177c0b5a1983864579aabb88cabd5d05e032e2 PrevOutScript: 526b006b7dac7ca9143cd1def404e12a85ead2b4d3f5f9f817fb0d46ef879a6c936b7dac7ca9146a4e7d5f798e90e84db9244d4805459f87275943879a6c936b7dac7ca914486efdd300987a054510b4ce1148d4ad290d911e879a6c936b6c6ca2 CurrTxInScript: 4730440220151ad44e7f78f9e0c4a3f2135c19ca3de8dbbb7c58893db096c0c5f1573d5dec02200724a78c3fa5f153103cb46816df46eb6cfac3718038607ddec344310066161e01410459fd82189b81772258a3fc723fdda900eb8193057d4a573ee5ad39e26b58b5c12c4a51b0edd01769f96ed1998221daf0df89634a7137a8fa312d5ccc95ed8925483045022100ca34834ece5925cff6c3d63e2bda6b0ce0685b18f481c32e70de9a971e85f12f0220572d0b5de0cf7b8d4e28f4914a955e301faaaa42f05feaa1cc63b45f938d75d9014104ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1483045022074e01e8225e8c4f9d0b3f86908d42a61e611f406e13817d16240f94f52f49359022100f4c768dd89c6435afd3834ae2c882465ade92d7e1cc5c2c2c3d8d25c41b3ea61014104ce66c9f5068b715b62cc1622572cd98a08812d8ca01563045263c3e7af6b997e603e8e62041c4eb82dfd386a3412c34c334c34eb3c76fb0e37483fc72323f807 CurrRawTx: 01000000012f654d4d1d7246d1a824c5b6c5177c0b5a1983864579aabb88cabd5d05e032e201000000fda0014730440220151ad44e7f78f9e0c4a3f2135c19ca3de8dbbb7c58893db096c0c5f1573d5dec02200724a78c3fa5f153103cb46816df46eb6cfac3718038607ddec344310066161e01410459fd82189b81772258a3fc723fdda900eb8193057d4a573ee5ad39e26b58b5c12c4a51b0edd01769f96ed1998221daf0df89634a7137a8fa312d5ccc95ed8925483045022100ca34834ece5925cff6c3d63e2bda6b0ce0685b18f481c32e70de9a971e85f12f0220572d0b5de0cf7b8d4e28f4914a955e301faaaa42f05feaa1cc63b45f938d75d9014104ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1483045022074e01e8225e8c4f9d0b3f86908d42a61e611f406e13817d16240f94f52f49359022100f4c768dd89c6435afd3834ae2c882465ade92d7e1cc5c2c2c3d8d25c41b3ea61014104ce66c9f5068b715b62cc1622572cd98a08812d8ca01563045263c3e7af6b997e603e8e62041c4eb82dfd386a3412c34c334c34eb3c76fb0e37483fc72323f807ffffffff01b0ad5407000000001976a9146a4e7d5f798e90e84db9244d4805459f8727594388ac00000000 Pretty TxIn Script: [PUSHDATA -- 71 BYTES:] 30440220151ad44e7f78f9e0c4a3f2135c19ca3de8dbbb7c58893db096c0c5f1573d5dec02200724a78c3fa5f153103cb46816df46eb6cfac3718038607ddec344310066161e01 [PUSHDATA -- 65 BYTES:] 0459fd82189b81772258a3fc723fdda900eb8193057d4a573ee5ad39e26b58b5c12c4a51b0edd01769f96ed1998221daf0df89634a7137a8fa312d5ccc95ed8925 [PUSHDATA -- 72 BYTES:] 3045022100ca34834ece5925cff6c3d63e2bda6b0ce0685b18f481c32e70de9a971e85f12f0220572d0b5de0cf7b8d4e28f4914a955e301faaaa42f05feaa1cc63b45f938d75d901 [PUSHDATA -- 65 BYTES:] 04ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1 [PUSHDATA -- 72 BYTES:] 3045022074e01e8225e8c4f9d0b3f86908d42a61e611f406e13817d16240f94f52f49359022100f4c768dd89c6435afd3834ae2c882465ade92d7e1cc5c2c2c3d8d25c41b3ea6101 [PUSHDATA -- 65 BYTES:] 04ce66c9f5068b715b62cc1622572cd98a08812d8ca01563045263c3e7af6b997e603e8e62041c4eb82dfd386a3412c34c334c34eb3c76fb0e37483fc72323f807 Pretty TxOutScript: 2 OP_TOALTSTACK OP_0 OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 3cd1def404e12a85ead2b4d3f5f9f817fb0d46ef OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 6a4e7d5f798e90e84db9244d4805459f87275943 OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_TUCK OP_CHECKSIG OP_SWAP OP_HASH160 [PUSHDATA -- 20 BYTES:] 486efdd300987a054510b4ce1148d4ad290d911e OP_EQUAL OP_BOOLAND OP_FROMALTSTACK OP_ADD OP_TOALTSTACK OP_FROMALTSTACK OP_FROMALTSTACK OP_GREATERTHANOREQUAL 2-of-3 Transaction [b]with[/b] OP_CHECKMULTISIG Attempting to interpret script: Block: 30301 Tx: 6 Testnet Tx Hash: bb664ff716b9dfc831bcc666c1767f362ad467fcfbaf4961de92e45547daab87 PrevTxOuScript : 537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae CurrTxInScript: 00493046022100d73f633f114e0e0b324d87d38d34f22966a03b072803afa99c9408201f6d6dc6022100900e85be52ad2278d24e7edbb7269367f5f2d6f1bd338d017ca460008776614401473044022071fef8ac0aa6318817dbd242bf51fb5b75be312aa31ecb44a0afe7b49fcf840302204c223179a383bb6fcb80312ac66e473345065f7d9136f9662d867acf96c12a42015241048c006ff0d2cfde86455086af5a25b88c2b81858aab67f6a3132c885a2cb9ec38e700576fd46c7d72d7d22555eee3a14e2876c643cd70b1b0a77fbf46e62331ac4104b68ef7d8f24d45e1771101e269c0aacf8d3ed7ebe12b65521712bba768ef53e1e84fff3afbee360acea0d1f461c013557f71d426ac17a293c5eebf06e468253e00 CurrRawTx: 0100000001bb664ff716b9dfc831bcc666c1767f362ad467fcfbaf4961de92e45547daab8701000000fd190100493046022100d73f633f114e0e0b324d87d38d34f22966a03b072803afa99c9408201f6d6dc6022100900e85be52ad2278d24e7edbb7269367f5f2d6f1bd338d017ca460008776614401473044022071fef8ac0aa6318817dbd242bf51fb5b75be312aa31ecb44a0afe7b49fcf840302204c223179a383bb6fcb80312ac66e473345065f7d9136f9662d867acf96c12a42015241048c006ff0d2cfde86455086af5a25b88c2b81858aab67f6a3132c885a2cb9ec38e700576fd46c7d72d7d22555eee3a14e2876c643cd70b1b0a77fbf46e62331ac4104b68ef7d8f24d45e1771101e269c0aacf8d3ed7ebe12b65521712bba768ef53e1e84fff3afbee360acea0d1f461c013557f71d426ac17a293c5eebf06e468253e00ffffffff0280969800000000001976a9140817482d2e97e4be877efe59f4bae108564549f188ac7015a7000000000062537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae00000000 Pretty TxIn Script: OP_0 [PUSHDATA -- 73 BYTES:] 3046022100d73f633f114e0e0b324d87d38d34f22966a03b072803afa99c9408201f6d6dc6022100900e85be52ad2278d24e7edbb7269367f5f2d6f1bd338d017ca460008776614401 [PUSHDATA -- 71 BYTES:] 3044022071fef8ac0aa6318817dbd242bf51fb5b75be312aa31ecb44a0afe7b49fcf840302204c223179a383bb6fcb80312ac66e473345065f7d9136f9662d867acf96c12a4201 2 [PUSHDATA -- 65 BYTES:] 048c006ff0d2cfde86455086af5a25b88c2b81858aab67f6a3132c885a2cb9ec38e700576fd46c7d72d7d22555eee3a14e2876c643cd70b1b0a77fbf46e62331ac [PUSHDATA -- 65 BYTES:] 04b68ef7d8f24d45e1771101e269c0aacf8d3ed7ebe12b65521712bba768ef53e1e84fff3afbee360acea0d1f461c013557f71d426ac17a293c5eebf06e468253e OP_0 Pretty TxOut Script: 3 OP_ROLL OP_DUP 2 OP_GREATERTHANOREQUAL OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 80677c5392220db736455533477d0bc2fba65502 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 02d7aa2e76d9066fb2b3c41ff8839a5c81bdca19 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_ROLL OP_SIZE OP_NOT OP_OVER OP_HASH160 [PUSHDATA -- 20 BYTES:] 10039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89 OP_EQUAL OP_BOOLOR OP_VERIFY 3 OP_CHECKMULTISIG armory-0.92.3/extras/extractKeysFromWallet.py0000755000000000000000000000722012414772654020017 0ustar rootroot#! /usr/bin/python # # IMPORTANT: This script extracts *EVERY KEY & ADDR* out of your wallet.dat # file and writes them to file!! This is usually a terrible # idea, but I made the script to help myself explore the file # format. # # Also, wallet.dat includes addresses you HAVE SEEN BUT DO NOT # OWN. This means that many of the addresses (especially the # ones without private keys) this script extracts don't actually # contribute anything to your wallet. # # NOTE: This was created before wallets ever used encryption. It's # probably fairly useless... but any unencrypted wallets created # before Bitcoin-Qt 0.6.0 would still be recoverable, even if # corrupted # # from sys import argv, path path.append('..') path.append('.') from armoryengine import * from CppBlockUtils import * pubfile = 'keylistpub.txt' pairfile = 'keylistpair.txt' if len(argv)<2: print 'USAGE:', argv[0], 'path/to/wallet.dat' for a in argv: print a exit(0) else: wallet = open(argv[1], 'rb') def pretty(theStr, width=32): if len(theStr) == 130: return ('\t\t' + theStr[2:2+64] + '\n\t\t' + theStr[2+64:]) else: return ('\t\t' + theStr) walletBytes = wallet.read() pubout = open(pubfile,'w') keyout = open(pairfile,'w') print 'Wallet is %d bytes ' % len(walletBytes) privKeyDict = {} pubKeyDict = {} for i in range(len(walletBytes)): if not walletBytes[i] == '\x04': continue else: try: potentialPubKey = SecureBinaryData(walletBytes[i:i+65]) if CryptoECDSA().VerifyPublicKeyValid(potentialPubKey): fileloc = int_to_hex(i, widthBytes=4, endOut=BIGENDIAN) print '\nFound PUBLIC key in file (0x%08s) / ' % (fileloc,), hash160 = potentialPubKey.getHash160() addrStr = hash160_to_addrStr(hash160) pubkeyHex = potentialPubKey.toHexStr() print ' Addr: %-34s' % (addrStr,), ' PrivKey:', # Now search for a private key that matches havePrivKey = False for j in [i-207,i-283]: if not walletBytes[j:j+2] == '\x04\x20': continue startIdx = j+2 endIdx = startIdx+32 potentialPrivKey = SecureBinaryData(walletBytes[startIdx:endIdx]) computedPub = CryptoECDSA().ComputePublicKey(potentialPrivKey) if( hash160 == computedPub.getHash160()): havePrivKey = True privkeyHex = potentialPrivKey.toHexStr() break if not havePrivKey: pubKeyDict[addrStr] = pubkeyHex print ' NOT_FOUND ', else: privKeyDict[addrStr] = (pubkeyHex, privkeyHex) print ' FOUND ', except: raise for k,v in privKeyDict.iteritems(): keyout.write('\nAddrStr : %s:\nPubX(BE): %s\nPubY(BE): %s\nPriv(BE): %s' % \ (k,v[0][2:2+64],v[0][2+64:2+64+64],v[1])) for k,v in pubKeyDict.iteritems(): pubout.write('\n%s:\n\tPubKey: %s' % (k,pretty(v))) print '' print '' print 'Total number of PUBLIC keys found: ', len(pubKeyDict) print 'Total number of PRIVATE keys (subset): ', len(privKeyDict) print '' print 'All public keys (including your own) saved to: ', pubfile print 'All public/private keypairs stored in hex in: ', pairfile print '' print '!!!' print 'Please protect your keypair file. It contains all the ' print 'information an attacker would need to steal your money!' print '!!!' print '' pubout.close() keyout.close() armory-0.92.3/extras/createTestBlocksForReadBlkUpdate.py0000644000000000000000000000327212414772654022014 0ustar rootrootfrom sys import path path.append('..') from armoryengine import * TheBDM.setBlocking(True) TheBDM.setOnlineMode(True) if not os.path.exists('testmultiblock'): os.mkdir('testmultiblock') fout = [] fout.append([0, 101, 'testmultiblock/blk00000.dat']) fout.append([0, 102, 'testmultiblock/blk00000_test1.dat']) # Add 1 block fout.append([0, 105, 'testmultiblock/blk00000_test2.dat']) # Add 3 blocks fout.append([106, 106, 'testmultiblock/blk00001_test3.dat']) # Just block split fout.append([107, 109, 'testmultiblock/blk00002_test4.dat']) # Another block split 3 blks fout.append([107, 110, 'testmultiblock/blk00002_test5.dat']) # Add block fout.append([110, 113, 'testmultiblock/blk00003_test5.dat']) # and split for start,end,theFile in fout: if os.path.exists(theFile): os.remove(theFile) lastLocation = [0]*len(fout) openfiles = [[trip[0], trip[1], open(trip[2],'wb')] for trip in fout] # Assume we are only reading into blk000000.dat, no split for h in range(120): head = TheBDM.getHeaderByHeight(h) blk = head.serializeWholeBlock(MAGIC_BYTES, True) for i,trip in enumerate(openfiles): start,end,theFile = trip if (start <= h <= end): theFile.write(blk) lastLocation[i] += len(blk) for start,end,opnfil in openfiles: opnfil.close() for i,trip in enumerate(fout): start,end,theFile = trip sz = os.path.getsize(theFile) f = open(theFile,'ab') if i<3: f.write('\x00'*(22000-sz)) else: f.write('\x00'*(1000-sz)) f.close() print 'Blocks written out:' for start,end,fn in fout: if end-start==0: print '\t%d in file: %s' % (end,fn) else: print '\t%d-%d in file: %s' % (start,end,fn) armory-0.92.3/extras/LatestBlocksFinder.py0000644000000000000000000000746212414772654017243 0ustar rootrootimport sys sys.argv.append('--nologging') from utilities.BinaryUnpacker import BinaryUnpacker from utilities.ArmoryUtils import binary_to_int, LITTLEENDIAN, binary_to_hex,\ sha256, BIGENDIAN from utilities.BinaryPacker import BINARY_CHUNK, UINT32, VAR_INT from collections import namedtuple import os from armoryengine import BTC_HOME_DIR n = 10 def getLastTwoFiles(): i = 79 blkFilePath = os.path.join(BTC_HOME_DIR, 'blocks', 'blk%05d.dat' % i) lastFile = None secondToLastFile = None while True: try: with open(blkFilePath, 'rb') as f: secondToLastFile = lastFile lastFile = [i,blkFilePath] except IOError: break i += 1 blkFilePath = os.path.join(BTC_HOME_DIR, 'blocks', 'blk%05d.dat' % i) return lastFile, secondToLastFile def getFileSize(f): pos = f.tell() # Go to the end to get the file length f.seek(0,2) result = f.tell() f.seek(pos) return result BLOCK_SIZE_LENGTH = 4 MAGIC_NUMBER_LENGTH = 4 HEADER_LENGTH = 80 TX_OUT_HASH_LENGTH = 32 TX_OUT_INDEX_LENGTH = 4 SEQUENCE_LENGTH = 4 VERSION_LENGTH = 4 TxOut = namedtuple('TxOut', ['txOutIndex', 'value', 'script', 'txOutType']) TxIn = namedtuple('TxIn', ['outpoint', 'script','sequence']) Tx = namedtuple('Tx', ['txHash', 'version', 'txInList', 'txOutList']) Block = namedtuple('Block', ['blkNum', 'blkSize', 'blkHdr', 'txCount', 'txBinary', 'txOffsetList', 'txList']) BlockHeader = namedtuple('BlockHeader', ['version', 'prevHash', 'merkleHash', 'time', 'bits', 'nonce' ]) def parseBlockHeader(blkHdrBinary): binunpack = BinaryUnpacker(blkHdrBinary) return BlockHeader(binunpack.get(UINT32), binunpack.get(BINARY_CHUNK, 32), binunpack.get(BINARY_CHUNK, 32), binunpack.get(UINT32), binunpack.get(UINT32), binunpack.get(UINT32)) def getBlockHeight(txBinary): binunpack = BinaryUnpacker(txBinary) binunpack.advance(VERSION_LENGTH) txInCount = binunpack.get(VAR_INT) binunpack.advance(TX_OUT_HASH_LENGTH + TX_OUT_INDEX_LENGTH) sigScriptLength = binunpack.get(VAR_INT) binunpack.advance(1) height = binary_to_int(binunpack.get(BINARY_CHUNK, 3)) return height def getNextBlock(f): fileOffset = f.tell() f.seek(MAGIC_NUMBER_LENGTH, 1) blkSize = binary_to_int(f.read(BLOCK_SIZE_LENGTH), LITTLEENDIAN) result = None if blkSize > 0: binunpack = BinaryUnpacker(f.read(blkSize)) blkHdrBinary = binunpack.get(BINARY_CHUNK, HEADER_LENGTH) txCount = binunpack.get(VAR_INT) txBinary = binunpack.get(BINARY_CHUNK, binunpack.getRemainingSize()) blockHeight = getBlockHeight(txBinary) result = [sha256(sha256(blkHdrBinary)), blockHeight, fileOffset] else: f.seek(0,2) return result # argument is an array that consists of a file descriptor with the file number def getAllBlocks(blkFileWithNumber): blkInfoList = [] with open(blkFileWithNumber[1], 'rb') as f: fSize = getFileSize(f) while f.tell() < fSize: blkInfo = getNextBlock(f) if blkInfo != None: blkInfoWithFileNum = [blkFileWithNumber[0]] blkInfoWithFileNum.extend(blkInfo) blkInfoList.append(blkInfoWithFileNum) return blkInfoList # only goes back 2 files so anything over 800 could get cut off # at 2 block files worth of data def getLastNBlocks(n=10): lastFile, secondToLastFile = getLastTwoFiles() lastBlocks = getAllBlocks(lastFile) if len(lastBlocks) < n: secondToLastBlocks = getAllBlocks(secondToLastFile) secondToLastBlocks.extend(lastBlocks) lastBlocks = secondToLastBlocks return lastBlocks[-n:] lastNBlocks = getLastNBlocks(3) for blk in lastNBlocks: print blk[0], binary_to_hex(blk[1], BIGENDIAN), blk[2], blk[3] armory-0.92.3/extras/findpass.py0000644000000000000000000002223512414772654015323 0ustar rootroot''' Created on Aug 30, 2013 @author: Andy Ofiesh ''' import sys sys.argv.append('--nologging') from sys import path, argv import os from armoryengine.PyBtcWallet import PyBtcWallet from armoryengine.ArmoryUtils import RightNow from CppBlockUtils import SecureBinaryData from operator import add, mul # Give an upper limit for any method to return # if the limit is exceded raise MaxResultsExceeded exception MAX_LIST_LEN = 20000000 class MaxResultsExceeded(Exception): pass class WalletNotFound(object): pass path.append('..') path.append('/usr/bin/armory') class PwdSeg(object): def __init__(self, known): self.known = known # Abstract method def getSegListLen(self): raise NotImplementedError("Subclass must implement getSegListLength()") # Abstract Generator def segListGenerator(self, maxResults=MAX_LIST_LEN): raise NotImplementedError("Subclass must implement getSegList()") yield None # Abstract method def getSegList(self, maxResults=MAX_LIST_LEN): raise NotImplementedError("Subclass must implement getSegList()") class UnknownCaseSeg(PwdSeg): def __init__(self, known): super(UnknownCaseSeg, self).__init__(known) getBothCases = lambda self, ch : [ch.lower(), ch.upper()] if ch.lower() != ch.upper() else [ch] def segListRecursiveGenerator(self, seg): if len(seg) > 0: for a in self.getBothCases(seg[0]): for b in self.segListRecursiveGenerator(seg[1:]): yield a + b else: yield '' def getSegListLen(self): return reduce(mul, [1 if ch.lower() == ch.upper() else 2 for ch in self.known]) def segListGenerator(self, maxResults=MAX_LIST_LEN): if self.getSegListLen() > maxResults: raise MaxResultsExceeded for seg in self.segListRecursiveGenerator(self.known): yield seg def getSegList(self, maxResults=MAX_LIST_LEN): return [seg for seg in self.segListGenerator(maxResults)] class KnownSeg(PwdSeg): def __init__(self, known): super(KnownSeg, self).__init__(known) def getSegListLen(self): return 1 def segListGenerator(self, maxResults=MAX_LIST_LEN): yield self.known def getSegList(self, maxResults=MAX_LIST_LEN): return [seg for seg in self.segListGenerator()] class UnknownSeg(PwdSeg): def __init__(self, known, minLen, maxLen): super(UnknownSeg, self).__init__(known) self.removeDups() self.minLen = minLen self.maxLen = maxLen def removeDups(self): self.known = ''.join(set(self.known)) def segListRecursiveGenerator(self, segLen): if segLen > 0: for a in self.known: for b in self.segListRecursiveGenerator(segLen-1): yield a + b else: yield '' def getSegListLen(self): return reduce(add, [len(self.known) ** i for i in range(self.minLen, self.maxLen + 1)]) def segListGenerator(self, maxResults=MAX_LIST_LEN): if self.getSegListLen() > maxResults: raise MaxResultsExceeded for segLen in range(self.minLen, self.maxLen + 1): for seg in self.segListRecursiveGenerator(segLen): yield seg def getSegList(self, maxResults=MAX_LIST_LEN): return [seg for seg in self.segListGenerator(maxResults)] class PasswordFinder(object): def __init__(self, wallet=None, walletPath=''): if wallet != None: self.wallet = wallet else: if not os.path.exists(walletPath): print 'Wallet does not exist:' print ' ', walletPath raise WalletNotFound self.wallet = PyBtcWallet().readWalletFile(walletPath) def countPasswords(self, segList, segOrdList): return reduce(add, [reduce(mul, [len(segList[segIndex]) for segIndex in segOrd]) for segOrd in segOrdList]) def recursivePasswordGenerator(self, segList): if len(segList) > 0: for a in segList[0]: for b in self.recursivePasswordGenerator(segList[1:]): yield a + b else: yield '' # Generates passwords from segs in segList # Example Input: [['Andy','b','c'],['1','2'],['!']] # The segOrdList contains a list of ordered # permutations of the segList: # Example Input: [[0,1,2],[2,0,1,],[0,1]] # Yields one password at a time until all permutations are exhausted # Example: Andy1!, Andy2!, b1!, b2!, c1!, c2!, # !Andy1, !Andy2, !b1, !b2, !c1, !c2, # Andy1, Andy2, b1, b2, c1, c2 # The above example is a test case found in test/FindPassTest.py def passwordGenerator(self, segList, segOrdList): for segOrd in segOrdList: orderedSegList = [segList[segIndex] for segIndex in segOrd] for result in self.recursivePasswordGenerator(orderedSegList): yield result def searchForPassword(self, segList, segOrdList=[]): if len(segOrdList) == 0: segOrdList = [range(len(segList))] passwordCount = self.countPasswords(segList, segOrdList) startTime = RightNow() found = False result = None for i,p in enumerate(self.passwordGenerator(segList, segOrdList)): isValid = self.wallet.verifyPassphrase( SecureBinaryData(p) ) if isValid: # If the passphrase was wrong, it would error out, and not continue print 'Passphrase found!' print '' print '\t', p print '' print 'Thanks for using this script. If you recovered coins because of it, ' print 'please consider donating :) ' print ' 1ArmoryXcfq7TnCSuZa9fQjRYwJ4bkRKfv' print '' found = True open('FOUND_PASSWORD.txt','w').write(p) result = p break elif i%100==0: telapsed = (RightNow() - startTime)/3600. print ('%d/%d passphrases tested... (%0.1f hours so far)'%(i,passwordCount,telapsed)).rjust(40) print p, if i % 10 == 9: print if not found: print '' print 'Script finished!' print 'Sorry, none of the provided passphrases were correct :(' print '' return result # Print help mess if less than 3 args: # arg[0] = script path # arg[1] = wallet path provided on command line # arg[2] = --nologging flag appended at beginning of script if len(argv)<3: print '***USAGE: ' print ' %s /path/to/wallet/file.wallet' % argv[0] exit(0) passwordFinder = PasswordFinder(walletPath=argv[1]) ############################################################ # User Specific Code is below. Only modify after this line ############################################################ # Here are all of the segment types that could possibly appear in the password # Use KnownSeg if you know the exact characters that make up a segment # Use UnknownCaseSeg if you know the characters but not the case of the letters (a-z) # Use UnknownSeg when you know what characters are in the segment, # but not the order nor the exact length # The example below is based on this scenario: # I know that my password begins with hello, not sure if it's capitalized or not # I always put some numbers at the end either an old address or birthday segment0 = UnknownCaseSeg("h") # Not sure of the case of the first letter segment1 = KnownSeg("ello") # definitely starts with hello segment2 = UnknownSeg("1234567890",minLen=2,maxLen=3) # former address 2 or 3 digits segment3 = KnownSeg("5/9/71") # My birthday segment4 = KnownSeg("11/30/46") # mom's birthday segmentList = [segment0.getSegList(), segment1.getSegList(), segment2.getSegList(), segment3.getSegList(), segment4.getSegList()] # Specify all of the combinations of segments to search # in this example there are 5 possible segments enumerated from 0 to 4 segmentOrderList = [[0,1], # maybe I got lazy and just used hello [0,1,2], # hello then an old address [2,0,1], # old address then hello [0,1,3], # hello + my birtday [0,1,4]] # hello + mom's birthday passwordFinder.searchForPassword(segmentList, segmentOrderList) # To run this script first download it and save it in the base directory of # Armory repository from git. For example mine is at C:\Users\Andy\BitcoinArmory # You can clone the repository from here https://github.com/etotheipi/BitcoinArmory # The latest version of this file can be found in the extras directory in the repo. # # You also need to copy _CppBlockUtils.pyd and CppBlockUtils.py from the library.zip # file in your Armory installation directory. For example mine is at: # C:\Program Files (x86)\Armory\library.zip # # Open a command line and go to the above folder and execute: # python findpass.py # On my computer I would run: # python findpass.py C:\Users\Andy\AppData\Roaming\Armory\armory_dUSL3JyD_.wallet # or I might move the wallet file to the same directory and just type: # python findpass.py armory_dUSL3JyD_.wallet armory-0.92.3/extras/dlscript.py0000644000000000000000000000211312414772654015331 0ustar rootroot#! /usr/bin/python import subprocess import os from sys import argv if len(argv)<3: print 'Usage: %s dirToDumpDpkgs ...' % argv[0] exit(1) outDir = argv[1] pkgs = argv[2:] if not os.path.exists(outDir): os.makedirs(outDir) cmd = ['apt-get', 'install', '--yes', '--print-uris'] cmd.extend(pkgs) output = subprocess.check_output(cmd).split('\n') output = filter(lambda x: x.startswith("'"), output) dllist = [out.split()[0][1:-1] for out in output] filename= [os.path.join(outDir, out.split()[1]) for out in output] md5list = [out.split()[-1].split(':')[-1] for out in output] try: for dl,fil,md5 in zip(dllist, filename, md5list): try: subprocess.check_output(['wget', '-O', fil, dl]) except Exception as e: print '***Error downloading file:', dl print '***Error: ', str(e) continue out = subprocess.check_output(['md5sum', fil]).split()[0] if not out==md5: print '***ERROR: MD5sum does not match!' raise except: for f in filename: if os.path.exists(f): os.remove(f) armory-0.92.3/extras/README0000644000000000000000000000153212414772654014017 0ustar rootrootThe scripts in this directory are mostly just toy script, or "scratch-paper" for some operation I needed to do once. The scripts show a variety of ways to access armory functionality, but there is no guarantee that they work for any apparent purpose (some were created for previous versions of Armory). The script, sample_armory_code.py is generally kept-up-to-date, and intended to have a variety of access patterns to illustrate the library usage. The script, cli_sign_script.py is a working implementation (as of v0.82) of signing and unsigned transaction from the command line using the full wlalet. However, there are still no guarantees even for the above two scripts. If you email me and ask for sample code for something, I am likely to put it in this directory and commit it with the project when I'm done, but not necessarily maintain it. armory-0.92.3/extras/PromoKit.py0000644000000000000000000003360012414772654015256 0ustar rootroot################################################################################ # # Copyright (C) 2011-2014, Armory Technologies, Inc. # Distributed under the GNU Affero General Public License (AGPL v3) # See LICENSE or http://www.gnu.org/licenses/agpl.html # ################################################################################ from getpass import getpass import os import sys # Must move and clear the Args list before importing anything # Otherwise it will process the args for this script. promoKitArgList = sys.argv # Clear and add --testnet unless you are running this on main net sys.argv = sys.argv[:1] import time from PyQt4.QtGui import * from pywin.scintilla import view from armoryengine.PyBtcWallet import PyBtcWallet from CppBlockUtils import SecureBinaryData from armoryengine.ArmoryUtils import makeSixteenBytesEasy, NegativeValueError, \ WalletAddressError, MIN_RELAY_TX_FEE, LOGINFO, hash160_to_p2pkhash_script from armoryengine.BDM import TheBDM from armoryengine.CoinSelection import calcMinSuggestedFees, PySelectCoins from armoryengine.Transaction import UnsignedTransaction from qtdefines import GETFONT, tr from qtdialogs import SimplePrintableGraphicsScene sys.path.append('..') sys.path.append('.') # Generates a list of new promo wallets def createWalletList(n, nameString): walletList = [] for i in range(n): name = "%s #%d" % (nameString, i) newWallet = PyBtcWallet().createNewWallet( \ withEncrypt=False, \ shortLabel=name, \ longLabel=name, \ doRegisterWithBDM=False) walletList.append(newWallet) return walletList # Pulled from qtdialogs. Assumes single sheet 1.35c backups def createPrintScene(wallet, amountString, expiresString): scene = SimplePrintableGraphicsScene(None, None) INCH = scene.INCH MARGIN = scene.MARGIN_PIXELS scene.resetCursor() scene.drawPixmapFile(':/armory_logo_h36.png') scene.newLine() scene.drawText('Paper Backup for Armory Wallet', GETFONT('Var', 11)) scene.newLine() scene.drawText('http://www.bitcoinarmory.com') scene.newLine(extra_dy=20) scene.drawHLine() scene.newLine(extra_dy=20) ssType = ' (Unencrypted)' bType = tr('Single-Sheet ' + ssType) colRect, rowHgt = scene.drawColumn(['Wallet Version:', 'Wallet ID:', \ 'Wallet Name:', 'Backup Type:']) scene.moveCursor(15, 0) suf = 'c' colRect, rowHgt = scene.drawColumn(['1.35'+suf, wallet.uniqueIDB58, \ wallet.labelName, bType]) scene.moveCursor(15, colRect.y() + colRect.height(), absolute=True) # Display warning about unprotected key data wrap = 0.9*scene.pageRect().width() container = 'this wallet' warnMsg = tr(""" WARNING: Anyone who has access to this page has access to all the bitcoins in %s! Please keep this page in a safe place.""" % container) scene.newLine() scene.drawText(warnMsg, GETFONT('Var', 9), wrapWidth=wrap) scene.newLine(extra_dy=20) scene.drawHLine() scene.newLine(extra_dy=20) numLine = 'two' descrMsg = tr(""" The following %s lines backup all addresses ever generated by this wallet (previous and future). This can be used to recover your wallet if you forget your passphrase or suffer hardware failure and lose your wallet files. """ % numLine) scene.drawText(descrMsg, GETFONT('var', 8), wrapWidth=wrap) scene.newLine(extra_dy=10) ########################################################################### # Finally, draw the backup information. bottomOfSceneHeader = scene.cursorPos.y() code12 = wallet.addrMap['ROOT'].binPrivKey32_Plain.toBinStr() Lines = [] Prefix = [] Prefix.append('Root Key:') Lines.append(makeSixteenBytesEasy(code12[:16])) Prefix.append('') Lines.append(makeSixteenBytesEasy(code12[16:])) # Draw the prefix origX,origY = scene.getCursorXY() scene.moveCursor(20,0) colRect, rowHgt = scene.drawColumn([''+l+'' for l in Prefix]) nudgeDown = 2 # because the differing font size makes it look unaligned scene.moveCursor(20, nudgeDown) scene.drawColumn(Lines, font=GETFONT('Fixed', 8, bold=True), \ rowHeight=rowHgt, useHtml=False) scene.moveCursor(MARGIN, colRect.y()-2, absolute=True) width = scene.pageRect().width() - 2*MARGIN scene.drawRect( width, colRect.height()+7, edgeColor=QColor(0,0,0), fillColor=None) scene.newLine(extra_dy=30) scene.drawText( tr(""" The following QR code is for convenience only. It contains the exact same data as the %s lines above. If you copy this backup by hand, you can safely ignore this QR code. """ % numLine), wrapWidth=4*INCH) scene.moveCursor(20,0) x,y = scene.getCursorXY() edgeRgt = scene.pageRect().width() - MARGIN edgeBot = scene.pageRect().height() - MARGIN qrSize = max(1.5*INCH, min(edgeRgt - x, edgeBot - y, 2.0*INCH)) scene.drawQR('\n'.join(Lines), qrSize) scene.newLine(extra_dy=25) scene.drawHLine(7*INCH, 5) scene.newLine(extra_dy=25) scene.drawText(tr(""" CONGRATULATIONS: You have received a Bitcoin Armory promotional wallet containing %s You may collect this money by installing Bitcoin Armory from the website shown above. After you install the software move the funds to a new wallet or any address that you own. Do not deposit any bitcoins to this wallet. You don't know where this paper has been! You have until %s to claim your bitcoins. After this date we will remove all remaining bitcoins from this wallet.""" % (amountString, expiresString)), GETFONT('Var', 11), wrapWidth=wrap) scene.newLine(extra_dy=25) return scene # This function will display a print dialog. It may hide behind other windows def printWalletList(walletList, amountString, expiresString): printer = QPrinter(QPrinter.HighResolution) printer.setPageSize(QPrinter.Letter) if QPrintDialog(printer).exec_(): painter = QPainter(printer) painter.setRenderHint(QPainter.TextAntialiasing) for wallet in walletList: scene = createPrintScene(wallet, amountString, expiresString) scene.getScene().render(painter) if wallet != walletList[-1]: printer.newPage() painter.end() # Assumes a secure wallet has been created and is provided. There should not be any # imported addresses in this wallet. It is assumed that all of this wallet's imported # addresses are about to be imported in this function def importAddrsToMasterWallet(masterWallet, walletList, addrsPerWallet, masterWalletName): masterWallet.unlock(securePassphrase = SecureBinaryData(getpass('Enter your secret string:'))) for wallet in walletList: for i in range(addrsPerWallet): addr = wallet.getNextUnusedAddress() masterWallet.importExternalAddressData(privKey = addr.binPrivKey32_Plain, pubKey = addr.binPublicKey65) return masterWallet # Distribute amount to each imported address in the wallet. def distributeBtc(masterWallet, amount, sendingAddrList): pytx = None setupTheBDM() try: recipValuePairs = [] utxoList = [] for sendingAddr in sendingAddrList: addr160 = sendingAddr.getAddr160() # Make sure the sending addresses are in the masterWallet if not masterWallet.hasAddr(addr160): raise WalletAddressError, 'Address is not in wallet! [%s]' % sendingAddr.getAddrStr() utxoList.extend(masterWallet.getAddrTxOutList(addr160)) for importedAddr in masterWallet.getLinearAddrList(): if importedAddr.chainIndex<0: recipValuePairs.append((importedAddr.getAddr160(),amount)) totalSpend = len(recipValuePairs)*amount fee = calcMinSuggestedFees(utxoList, totalSpend, MIN_RELAY_TX_FEE, len(recipValuePairs))[1] # Get the necessary utxo list selectedUtxoList = PySelectCoins(utxoList, totalSpend, fee) # get total value totalAvailable = sum([u.getValue() for u in selectedUtxoList]) totalChange = totalAvailable - (totalSpend + fee) # Make sure there are funds to cover the transaction. if totalChange < 0: print '***ERROR: you are trying to spend more than your balance!' raise NegativeValueError recipValuePairs.append((masterWallet.getNextUnusedAddress().getAddr160(), totalChange )) # ACR: To support P2SH in general, had to change createFromTxOutSelection # to take full scripts, not just hash160 values. Convert the list # before passing it in scrPairs = [[hash160_to_p2pkhash_script(r), v] for r,v in recipValuePairs] txdp = UnsignedTransaction().createFromTxOutSelection(selectedUtxoList, scrPairs) masterWallet.unlock(securePassphrase = SecureBinaryData(getpass('Enter your secret string:'))) # Sign and prepare the final transaction for broadcast masterWallet.signTxDistProposal(txdp) pytx = txdp.getPyTxSignedIfPossible() print '\nSigned transaction to be broadcast using Armory "offline transactions"...' print txdp.serializeAscii() finally: TheBDM.execCleanShutdown() return pytx def setupTheBDM(): TheBDM.setBlocking(True) if not TheBDM.isInitialized(): TheBDM.registerWallet(masterWallet) TheBDM.setOnlineMode(True) # Only executed on the first call if blockchain not loaded yet. LOGINFO('Blockchain loading') while not TheBDM.getBDMState()=='BlockchainReady': LOGINFO('Blockchain Not Ready Yet %s' % TheBDM.getBDMState()) time.sleep(2) # Sweep all of the funds from the imported addrs back to a # new addrin the master wallet def sweepImportedAddrs(masterWallet): setupTheBDM() recipValuePairs = [] utxoList = [] for importedAddr in masterWallet.getLinearAddrList(): if importedAddr.chainIndex<0: addr160 = importedAddr.getAddr160() utxoList.extend(masterWallet.getAddrTxOutList(addr160)) # get total value totalAvailable = sum([u.getValue() for u in utxoList]) fee = calcMinSuggestedFees(utxoList, totalAvailable, MIN_RELAY_TX_FEE, 1)[1] totalSpend = totalAvailable - fee if totalSpend<0: print '***ERROR: The fees are greater than the funds being swept!' raise NegativeValueError recipValuePairs.append((masterWallet.getNextUnusedAddress().getAddr160(), totalSpend )) # ACR: To support P2SH in general, had to change createFromTxOutSelection # to take full scripts, not just hash160 values. Convert the list # before passing it in scrPairs = [[hash160_to_p2pkhash_script(r), v] for r,v in recipValuePairs] txdp = UnsignedTransaction().createFromTxOutSelection(utxoList, scrPairs) masterWallet.unlock(securePassphrase = SecureBinaryData(getpass('Enter your secret string:'))) # Sign and prepare the final transaction for broadcast masterWallet.signTxDistProposal(txdp) pytx = txdp.getPyTxSignedIfPossible() print '\nSigned transaction to be broadcast using Armory "offline transactions"...' print txdp.serializeAscii() return pytx # Example execution generates 3 promo wallets and imports 2 address each to # a master wallet that is provided ''' walletList = createWalletList(100, 'Cambridge Bitcoin Meetup') masterWallet = importAddrsToMasterWallet( \ PyBtcWallet().readWalletFile('C:\\Users\\Andy\\AppData\\Roaming\\Armory\\armory_28Xrf4hbu_.wallet', False, False),\ walletList, 2, "Master Promo Wallet") printWalletList(walletList, "who knows how many bitcoins!?", "April 1st, 2014") ''' # Example execution distribute .0001 Btc to each imported address in a master wallet ''' masterWallet = PyBtcWallet().readWalletFile('C:\\Users\\Andy\\AppData\\Roaming\\Armory\\testnet3\\armory_2hzEdtr9c_.wallet', False, False) pytx = distributeBtc(masterWallet, 10000, masterWallet.getLinearAddrList(withImported=False)) ''' # Show help whenever the args are not correct def printHelp(): print 'USAGE: %s --create ' % sys.argv[0] print ' or: %s --distribute ' % sys.argv[0] print ' or: %s --sweep ' % sys.argv[0] exit(0) # Main execution path # Do not ever access the same wallet file from two different processes at the same time print '\n' raw_input('PLEASE CLOSE ARMORY BEFORE RUNNING THIS SCRIPT! (press enter to continue)\n') if len(promoKitArgList)<3: printHelp() operation = promoKitArgList[1] walletFile = promoKitArgList[2] if not os.path.exists(walletFile): print 'Wallet file was not found: %s' % walletFile masterWallet = PyBtcWallet().readWalletFile(walletFile, False, False) if operation == '--create': if len(promoKitArgList)<6: printHelp() else: numWallets = int(promoKitArgList[3]) addrsPerWallet = int(promoKitArgList[4]) walletLabel = promoKitArgList[5] walletList = createWalletList(numWallets, walletLabel) masterWallet = importAddrsToMasterWallet( \ masterWallet, walletList, addrsPerWallet, "Master Promo Wallet", ) # Didn't want to fit these into the argument list. Need to edit based on event printWalletList(walletList, "some amount of bitcoin. ", "July 1st, 2014") elif operation == '--distribute': if len(promoKitArgList)<4: printHelp() else: amountPerAddr = int(promoKitArgList[3]) distributeBtc(masterWallet, amountPerAddr, masterWallet.getLinearAddrList(withImported=False)) elif operation == '--sweep': sweepImportedAddrs(masterWallet) else: printHelp() armory-0.92.3/extras/sign_dl_list.py0000644000000000000000000000305712414772654016167 0ustar rootrootimport sys sys.path.append('..') sys.path.append('/usr/share/armory') import getpass import os from armoryengine import * # Use the parseDownloadList from verify script from verify_dl_list import * wltfile = open(os.path.join(ARMORY_HOME_DIR, 'signingwlt.txt'),'r') wltname = wltfile.readlines()[0].strip() wltpath = os.path.join(ARMORY_HOME_DIR, wltname) if not os.path.exists(wltpath): print 'No wallet!' wlt = PyBtcWallet().readWalletFile(wltpath) LOGINFO('Wallet to use: %s', wltpath) passwd = SecureBinaryData(getpass.getpass('Unlock wallet %s: ' % wltname)) while not wlt.verifyPassphrase(passwd): LOGWARN('Passphrase incorrect') passwd = SecureBinaryData(getpass.getpass('Unlock wallet %s: ' % wltname)) wlt.unlock(securePassphrase=passwd) LOGINFO('Wallet unlocked') Priv = SecureBinaryData('') for a160,addr in wlt.addrMap.iteritems(): if addr.chainIndex==1: Priv = addr.binPrivKey32_Plain.copy() if Priv.getSize()==0: LOGERROR('Private key not found!') exit(1) Pub = SecureBinaryData(hex_to_binary(ARMORY_INFO_SIGN_PUBLICKEY)) print 'Keys match? ', CryptoECDSA().CheckPubPrivKeyMatch(Priv, Pub) fn = 'versions.txt' if not os.path.exists(fn): LOGERROR( 'File does not exist! %s', fn) fn = '../versions.txt' if not os.path.exists(fn): LOGERROR('Really does not exist. Aborting. %s', fn) exit(1) sigData = open(fn, 'r').read() msgToSign = extractSignedDataFromVersionsDotTxt(sigData, doVerify=False) Msg = SecureBinaryData(msgToSign) result = CryptoECDSA().SignData(Msg, Priv) print 'Signature:', result.toHexStr() armory-0.92.3/extras/blk170.bin0000644000000000000000000000075212414772654014634 0ustar rootrootU xyڅ?hO=>+j,"*LB>c\,.7'd\fV,}QjI(>p*CAlIh(Ҫ c6|zlN3+2._4RJ%o4rW| -8![#ar[ɗnA j-` -5$#%7HG0D NEi2QIaӡ_?Ow2$H_A "H`lF""!v ʚ;CAb _k"%t7q0/窳sT_,!0;&*pO~lL(kCAۓۊkIS8.H.ױH\tDd. d?CVarmory-0.92.3/extras/test/0000755000000000000000000000000012414772654014115 5ustar rootrootarmory-0.92.3/extras/test/OnlineVersionOfEncryptedWallet.bin0000644000000000000000000003162112414772654022720 0ustar rootrootWALLET`s1RTestWallet1 (Watch) (Watching-only copy)]N CV5V*Dd`:y]]jwJ޶;_">txaX>6`U^_I6Fn}se9Fu˙04UȠ@†i04UȠ@†iG`:y ]]ܵc3W%J$GYW޾\qKDf(Rh =`AO;0W+-v1Rv1RNFS􈞕l \'dGNFS􈞕l \'dGW`:y]]OvZF#heخw xӛӳB[|Cx2ףm^$w1Rw1RiRSؠqiRSؠqͳEa_;h <,#x;v`ò%R s$d6(P Ƿ4EN\"lLv1Rv1R:`8khP̙0:`8khP̙0k\`:y ]]Ip Zs{-=m-$A)<Ĵl&ocGmŃ f$g"-b2*!ɗd*v1Rv1RQЬ$M.$QЬ$M.$ژ`:y ]]k-EO὾B!jD& $3~zIۄ}84nzL;q#w1Rw1Reu8~IwLџeu8~IwLџF`:y]]HެVZ9mL@(&xW ڔt^ %2u|QZ}\凈Z8@\LJg_,s̉v1Rv1R3UDzgl̲3UDzgl̲`:y]]l5gv闈:& hJ;֭y0be;׏ouLؠ Uꠎv1Rv1R7V\o|;\6)醖}7V\o|;\6)醖}45`:y]]Q.-v9X|7m2n(\GzV Hh\ڏ“Ƶn}Lv1Rv1R׺z",+(xh ׺z",+(xh xX`qPI]]w1Rw1R/AxV /AxV [M`:y]]Bh.&\6EW?}:˲= Hڮࢗ*Ch#Iӧ*R`>(aiĊs1Rs1RWuÛb`(K0\Ck5{)8*WuÛb`(K0\Ck5{)8*k<``:y]]Z 0@Lddg| $\N/Cę)\cUFiOWP̵( ~LH"Tv1Rv1RBl1Mt7> f &Bl1Mt7> f & ^t`:y ]]K`g?<֛=&d-#m/p%o46BH-BN Sb_gmpaJ|w1Rw1RŏVY[}Q?q!"l9qŏVY[}Q?q!"l9q `:y ]]Ve1W4 cV*=UoC7c}~fPrd[GMevH^̋H4I^(Ӆw1Rw1Rnᤕo8kx nᤕo8kx /`:y ]]f:m,'u똨Kc5= @} FfYcshbl#T3̽Yvx1Rx1Rͦޓ}#r݀ͦޓ}#rؕEj`:y]]or]:-lcFzS}MְqWzEo}ѕ3`s48<*pWpQw1Rw1R56xD S27(56xD S27(n`:y]]%rbaO~e hA׍+㴁Y 5fuW9SGyQJt¶GJ[Tc˴v1Rv1R;5DB;~R6;5DB;~R6f#1`:y]]4|8'T0q=$An%JFhE-3uv8FDWSVyaUƏgv1Rv1R=۲UE 7i 2=۲UE 7i 2`:y ]]"**អqX2HXbT=UƊ9?Tc#D@eB]0hlXx1Rx1Rؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]x1Rx1RCzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\x1Rx1RK~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!x1Rx1Rfq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c x1Rx1R5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B y1Ry1R`p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'Uay1Ry1RPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@armory-0.92.3/extras/test/OnlineVersionOfEncryptedWallet_backup.bin0000644000000000000000000055532512414772654024261 0ustar rootrootWALLET` RTestWallet1 (Watch) (Watching-only copy)]N CV5V*Dd`:y]]jwJ޶;_">txaX>6`U^_I6Fn}se9Fu˙04UȠ@†i04UȠ@†iG`:y ]]ܵc3W%J$GYW޾\qKDf(Rh =`AO;0W+-v1Rv1RNFS􈞕l \'dGNFS􈞕l \'dGW`:y]]OvZF#heخw xӛӳB[|Cx2ףm^$w1Rw1RiRSؠqiRSؠqͳEa_;h <,#x;v`ò%R s$d6(P Ƿ4EN\"lLv1Rv1R:`8khP̙0:`8khP̙0k\`:y ]]Ip Zs{-=m-$A)<Ĵl&ocGmŃ f$g"-b2*!ɗd*v1Rv1RQЬ$M.$QЬ$M.$ژ`:y ]]k-EO὾B!jD& $3~zIۄ}84nzL;q#w1Rw1Reu8~IwLџeu8~IwLџF`:y]]HެVZ9mL@(&xW ڔt^ %2u|QZ}\凈Z8@\LJg_,s̉v1Rv1R3UDzgl̲3UDzgl̲`:y]]l5gv闈:& hJ;֭y0be;׏ouLؠ Uꠎv1Rv1R7V\o|;\6)醖}7V\o|;\6)醖}45`:y]]Q.-v9X|7m2n(\GzV Hh\ڏ“Ƶn}Lv1Rv1R׺z",+(xh ׺z",+(xh xX`qPI]]w1Rw1R/AxV /AxV [M`:y]]Bh.&\6EW?}:˲= Hڮࢗ*Ch#Iӧ*R`>(aiĊs1Rs1RWuÛb`(K0\Ck5{)8*WuÛb`(K0\Ck5{)8*k<``:y]]Z 0@Lddg| $\N/Cę)\cUFiOWP̵( ~LH"Tv1Rv1RBl1Mt7> f &Bl1Mt7> f & ^t`:y ]]K`g?<֛=&d-#m/p%o46BH-BN Sb_gmpaJ|w1Rw1RŏVY[}Q?q!"l9qŏVY[}Q?q!"l9q `:y ]]Ve1W4 cV*=UoC7c}~fPrd[GMevH^̋H4I^(Ӆw1Rw1Rnᤕo8kx nᤕo8kx /`:y ]]f:m,'u똨Kc5= @} FfYcshbl#T3̽Yvx1Rx1Rͦޓ}#r݀ͦޓ}#rؕEj`:y]]or]:-lcFzS}MְqWzEo}ѕ3`s48<*pWpQw1Rw1R56xD S27(56xD S27(n`:y]]%rbaO~e hA׍+㴁Y 5fuW9SGyQJt¶GJ[Tc˴v1Rv1R;5DB;~R6;5DB;~R6f#1`:y]]4|8'T0q=$An%JFhE-3uv8FDWSVyaUƏgv1Rv1R=۲UE 7i 2=۲UE 7i 2`:y ]]"**អqX2HXbT=UƊ9?Tc#D@eB]0hlXx1Rx1Rؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]x1Rx1RCzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\x1Rx1RK~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!x1Rx1Rfq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c x1Rx1R5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B y1Ry1R`p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'Uay1Ry1RPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@ؐz:\͙Wfu;ؐz:\͙Wfu;a`:y]]{4n!BI^JMCa̼/9G`gOb#f‘G;v#ڷ3X|'<zIfOB_beΠzIfOB_beΠ@/=x`:y]]l]cEyV:Xt[?9}0*ǔt ~fWamK|E`=auy$OPqYc53y$OPqYc53?/`:y]]8mK![CGܭw|+2.:hjl2qs/ݧ˓P4M)gq㈐d4M)gq㈐d?Lb`:y]]mk6IslBAOCQyooƍNpMG'o\l΋cn?wvX8uOIVVx0*uOIVVx0*6`:y]]N4 N۝0LdF]lyJQvx<0VZ Eal )E  Y I^ T)E  Y I^ T2>`:y]]?*e{Y)"7o9EwɸW 'JU}| .BeXCCy]CzMq_f'72ACzMq_f'72A `:y]]'uK>ǐe w$2.UjX*=a $.4&N\q%'#"d!6\K~:jzf;DvUK~:jzf;DvUZ]`:y]]* O2TjA?cWtG ToHFn'Vݏ]AFq1Ȥ&M\!!!fq}Ygotfq}Ygot;`:y]] wBېuh%?}K^lA#t-)싽^YM7c 5VGJ k5VGJ kt`:y]]5Iٿ4@w/0Jd+*5"]e|݆͓j4'd1},B `p02#an4`p02#an4QV`:y]]=֎@뇩ƤZi<֤_S M 1- -ݯ)c0א'UaPi.o_iDoPi.o_iDod=`:y ]].ʖ~h" v@1;eKvr}@6U^@ g\L^\5W-GaԒiԒi 8`:y!]]u `@8&.-)ߗVnh:>S_ M unilPn t>BVYDB-=PvHSBVYDB-=PvHS\<`:y"]]7~l9[K 0_1N+ɣC+`Nl"Qv~Yܓ{˙d- 赔3'hi8J#T~ji8J#T~j>`:y#]] ٶ b&S!1f唍jG,n_}Ϣ3>\`:y&]]9"Ut_\b`ng2_T ^`{>E)rQ7RjlΌ|7&tdIOztdIOzox`:y']]2(~8PkZ%篫M*w7nGYS$"=WhrS?D7~5x'"@]a0xy5x'"@]a0xy9B`:y(]]nw 7CPB!W>՚ L x,qA=`u ?hKpNAJO}d¤YTW~GsO}d¤YTW~Gs0+\`:y)]]g} :'r093&3KuIQ+х\BNo$eT7x$Y@armory-0.92.3/extras/test/FindPassTest.py0000644000000000000000000000636312414772654017046 0ustar rootroot''' Created on Aug 26, 2013 @author: Andy ''' import sys sys.argv.append('--nologging') from extras.findpass import UnknownCaseSeg, MaxResultsExceeded, KnownSeg, \ UnknownSeg, PwdSeg, PasswordFinder, WalletNotFound import unittest seg1Input = 'abc' seg2Input = '123abcdef123ghijklmno123' segList1 = [['a','b','c'],['1','2'],['!']] segOrdList1 = [[0,1,2],[2,0,1,],[0,1]] expectedResult1 = ['a1!', 'a2!', 'b1!', 'b2!', 'c1!', 'c2!', \ '!a1', '!a2', '!b1', '!b2', '!c1', '!c2', \ 'a1', 'a2', 'b1', 'b2', 'c1', 'c2'] def expectedResultGenerator(expectedResult): for x in expectedResult: yield x class Test(unittest.TestCase): def testUnknownCaseSeg(self): seg1 = UnknownCaseSeg(seg1Input) segStringList1 = seg1.getSegList() self.assertEqual(8, len(segStringList1)) self.assertTrue(seg1Input.upper() in segStringList1) seg2 = UnknownCaseSeg(seg2Input) segStringList2 = seg2.getSegList() expectedSeg2Len = 2**len(seg2Input.translate(None, '123')); self.assertEqual(expectedSeg2Len, len(segStringList2)) self.assertTrue(seg2Input.upper() in segStringList2) self.assertRaises(MaxResultsExceeded, seg2.getSegList, expectedSeg2Len-1) def testKnownSeg(self): seg1 = KnownSeg(seg1Input) segStringList1 = seg1.getSegList() self.assertEqual([seg1Input], segStringList1) seg2 = KnownSeg(seg2Input) self.assertEqual(1, seg2.getSegListLen()) self.assertEqual([seg2Input], seg2.getSegList()) def testUnknownSeg(self): seg1 = UnknownSeg(seg1Input,2,3) self.assertEqual(36, seg1.getSegListLen()) segStringList1 = seg1.getSegList() self.assertEqual(36, len(segStringList1)) self.assertTrue(seg1Input in segStringList1) seg2Len = 5 seg2 = UnknownSeg(seg2Input, seg2Len, seg2Len) expectedSeg2KnownLen = len(set(seg2Input)) self.assertEqual(expectedSeg2KnownLen, len(seg2.known)) segStringList2 = seg2.getSegList() expectedSeg2Len = expectedSeg2KnownLen ** seg2Len self.assertEqual(expectedSeg2Len, len(segStringList2)) self.assertTrue(seg2Input[0] * seg2Len in segStringList2) self.assertRaises(MaxResultsExceeded, seg2.getSegList, expectedSeg2Len-1) def testPasswordFinder(self): # Name of wallet is the password followed by '.wallet' passwordFinder = PasswordFinder(walletPath='FakeWallet123.wallet') self.assertTrue(passwordFinder.wallet.isLocked) theExpectedResultGenerator = expectedResultGenerator(expectedResult1) for i, result in enumerate(passwordFinder.passwordGenerator(segList1, segOrdList1)): expectedResult = expectedResult1[i] self.assertEqual(expectedResult, result) self.assertEqual(len(expectedResult1), \ passwordFinder.countPasswords(segList1, segOrdList1)) passwordFinderSegList = [KnownSeg('Wallet').getSegList(), UnknownSeg('123', 3, 3).getSegList(), UnknownCaseSeg('Fake').getSegList()] expectedFoundPassword = 'FakeWallet123' foundPassword = passwordFinder.searchForPassword(passwordFinderSegList, segOrdList1) self.assertEqual(foundPassword, expectedFoundPassword) armory-0.92.3/extras/test/FakeWallet123.wallet0000644000000000000000000006640312414772654017605 0ustar rootrootWALLET`c]oRFake Wallet 1This is a fake wallet not to be used with any amount of bitcoins. This is used to experiment with password recovery. CˆQ! U/bXJLj:_n舆f6"7.dl$X`Pq+{0=2)EdC&PR^`p o?h?݌@2g{ɲy9ZưmF8~ўF?= f祹Dp9&$3I/`S ޑʂ"M epTD]c |%2Ѡۯ]c |%2Ѡۯ`Pq+{0=2)EdC&PR^\2NE"Cו9'?&*fy2o^F>nyxe昁̋@V*. 5q|}Kn5+296>ƼG u\RpiM~\RpiM~z-`Pq+{0=2)EdC&PR^`0#kb/M9,/iж3pgyU,2*KEʨ.gPG{) 0%&|▉T[ ]M`{xa꿰~V^yJ>BLMP_^yJ>BLMP_z`Pq+{0=2)EdC&PR^_;-Q24ڍ5v\ q{NǛ\ˊ1$Mw'lGs1񝨝 g|AJbkeVUq[p~/[M~6 $紆0{Yaګ3 $紆0{Yaګ3<#T`Pq+{0=2)EdC&PR^ɌILb,@\l)G4%ΨnivUE c@(=جtx<"v0]z=v5Qq0@.-*>Q(hnKXM!XB%@;M!XB%@;X&`Pq+{0=2)EdC&PR^tU࠮L<_$8LvKzA]E˝?&ߟb>˝?&o#`Pq+{0=2)EdC&PR^!Oq.j|ٶ< *Uhr|p»Qq4;Y_vkTLG?UJ3;Y!Hcr? `$@ I}[%i`qn@:9wy>+A?xqڄqiM.ވqڄqiM.Ɇ'`Pq+{0=2)EdC&PR^>S4<؆`k DBi+u4V6*x Ts黏0{UME-]ͯ:0%ΛbXMJ?:&c9% ʗ1'eL0uUiZXI6sRXI6sRk*Ƃ`Pq+{0=2)EdC&PR^}e"Xȴ(Ȥ{A'B)`P7`/Q{ CHU1"O@*w1_N{>T_<@~[pǔ4Zٚh$r0/Jiz,T+\7[s<$[7UAgI!<$[7UAgI!m(`Pq+{0=2)EdC&PR^ F#ʨn,'V/XgƚGzj(܊h䮜?řy z6xH M'R 8wS=%\ɅM]SofQYLKҒLU[{V2S';8t &x4[C ';8t &x4[C n[`Pq+{0=2)EdC&PR^ *Ty )KvȥWjidh k]* 5W)j} >Q|BPcqZIP}6Ģ|D=ihJF6亁%M"bsOˆ4&0rx-fg [ &0rx-fg [ SHA`Pq+{0=2)EdC&PR^ ݫq))Ǔ9#m BKHLƾXX7/*1C*7<{z gf91*[~1<ϬrM}U"C4KF=$?sb4/B/{Xvm\{Vܬ/{Xvm\{Vܬ?`Pq+{0=2)EdC&PR^ a),̒)fep- eAB]4\}V/Zӳ苂bg1Z}r5;sYv_=S'c$v̵S 7[}AMiv[ rSe6Wzk5T8r60T};lk5T8r60T};l:D`Pq+{0=2)EdC&PR^ Xz8@ mrvp1b$L:݀A*Ϳ_Ѧrk8fNto1Mxxό94~Gb3O|rzқk|!gOB3S#o-q)AD(c8q)AD(c8a``Pq+{0=2)EdC&PR^溓4'd#^`R#:LlƜ/Y8ZƜTLtPq-Z݋"\4|M+Ux'Vtfij'2Gsh"=E+ oJY"z<5,[H2g G3cEO_*"H+Ě!cEO_*"H+Ě!0/`Pq+{0=2)EdC&PR^g0e3vGKO/hW/ҳ-'rIRN5 ``Pq+{0=2)EdC&PR^>q%}%O.PjV)rqih$ߥXjN)ܫ'Y4F_0ѭ3\g |[<D{qU`oZN`JeXۻ)Ok $*;U㉖ 8Ok $*;U㉖ 8Ȓ.$`Pq+{0=2)EdC&PR^C@i}k.wVYHk }5ى= P5XQ{s A?4pu=1q*kXHxՆWvhoFS< c>(bCDE5C[a##!5C[a##!A`Pq+{0=2)EdC&PR^<^~PZ7SfD,  _F$ʹ0y@VеWҰxspyҮԤ(z,D|jls%ˋ4oY{BEN7d.牏F[); nuJP); nuJP`Pq+{0=2)EdC&PR^fo\fϠx UHtڊ6e{}S}$WUC5<0}˔tFe ˔A}xh8gBCOcl">b~p)t6YQ7^<:(~p)t6YQ7^<:(/#`Pq+{0=2)EdC&PR^sX5pIoM.6|U&KcI]3Rӹe\S#+HxL⣤a,Y޹RȒ sl+.VvLMz!fp-:2ϟQ>*N@l ?Z2ϟQ>*N@l ?Z<`Pq+{0=2)EdC&PR^r^% JuMj*=(,Ԝ V2KLt| T`3bm_@ p;IS`3 du[ !C$ZgH $;.Ge})Zɸh֦aXb{b9TeXѠ-]w`(V.TLY?91GL?a*՘e3gL?a*՘e3gJ`Pq+{0=2)EdC&PR^W|V_=0e%`g/~Og]=A`#U}gyCTIuUDVttR=oΔ`>KdbIGD&;^ƒӊ{]D&;^ƒӊ{]9`Pq+{0=2)EdC&PR^=N'H<(.IJ'h8Ocx v%Iwktuxs$z͡м\+_ȹ)[qE1WՐLiE&ު1.;Wh{Z8ML)%.;Wh{Z8ML)%-w `Pq+{0=2)EdC&PR^Vz|/P+Z-ښ/H4voĩvvU>I}޺xК fP``J_ ß2szוf.l^BQCZ|x ՒI𹀇Tؕ=x ՒI𹀇Tؕ=w`Pq+{0=2)EdC&PR^3pNF4UTKux4)lc)nϚ(m>Z.>-H T(T6zOö%;8 Q[ToN f῍2 ۵u?Qa.S,N\۵u?Qa.S,N\r`Pq+{0=2)EdC&PR^Ufc`3fS&oLם38ѶƢ''!Tb-W@\ʻW\Qvw?EP3+ԍ;:#2|. #'3<ͮt3x@ vFSS3w=2GcQ@E z=2GcQ@E z  `Pq+{0=2)EdC&PR^VR^N=ŠdiNGjiո0ިޯC%/. c5e4w u20O ќMnp_VD\Ζ-! *BU>|8(2l0p [|8(2l0p [t`Pq+{0=2)EdC&PR^=qZD@xGz \CfmZq״ښ 0'GuTd*v6Hp}J{TZ?L;]4xdo$2B)lY"'[PMiB)lY"'[PMiPJ`Pq+{0=2)EdC&PR^W~vkHTt3|Q.~3 7vYWLx%:ZykTS}*-\AVJ;f@ůZ 2gkDS\O %K:zLQByoX|OEdj5O.Ιx(-ѴNbgrW.Ιx(-ѴNbgrW`Pq+{0=2)EdC&PR^C;nlߵe_ފW_%X{׀/wcyFn$!O}9Ê=dSת5,#$S@Nhz~ _gf[Q+Yµ%j*6X{AlD_dGc1Z ,slNGc1Z ,slN˚`Pq+{0=2)EdC&PR^"׈u_` '~-$fשOƙ>?M7S*@*6r;uݞ|M[zbbQ5؃!^Y3tہQ$hrPgJIVb_ƓJG-߯JG-߯(-`Pq+{0=2)EdC&PR^#N0@ A${:=N]RH<TDRӐ10"ǤI3V!Xa  [pq_8vE2Z/g%l{|"?ܸNw31DT !ޮN0231DT !ޮN02 eJ`Pq+{0=2)EdC&PR^$qtS .'x]+wfN/a*ޒsgә($H="sT:y0Af'd#8x4*%A+!Ńm4nACUVrSHE&Kgmp" {B_q==OnPOo{B_q==OnPOoM@-`Pq+{0=2)EdC&PR^%D/ڻF [N]!"Se;"gVΜ0x5;Ã7]/L56UbFGqI\%`"CkW$W@{{·AaQ@T]-ddu&ӲD+2]-ddu&ӲD+2f`Pq+{0=2)EdC&PR^&U'зLKߙ/U!sa&j(h}>=w簿7$0%, uLO} qO'@A<%!' `Hy_z?lkVK+s-a&"T@K+s-a&"T@ `Pq+{0=2)EdC&PR^'%&O-̶=<톦p1%#m ޞ,j2Zͻ}K>sP񪉘(`fuoZlP5zg$j&YP-*WM}0uzv(6bMԚfԴzv(6bMԚfԴ)v`Pq+{0=2)EdC&PR^(Zn+݁#ynC^fîB)T{ ʊ0l:UO\^ݧm[PZֶK@O u*ء-w+EUׯ~Yoo>2ӿ sn~Ыo>2ӿ sn~ЫqΥ`Pq+{0=2)EdC&PR^)ةNb.iY~->5d Xxo~֋F+1bpD^X{|{l5ۥۻR )9M6ȿOC&_h!hi(B\kb}?#L>/+ -O|!boT>/+ -O|!boTC@`Pq+{0=2)EdC&PR^*DOABUu,p?Hõ5i#((nsFvQ mP-]/I%plb7E6v <WTC)Td'Y8^ݦxhkX\CaܜBB Ă\CaܜBB Ă3`Pq+{0=2)EdC&PR^+rFiP`<ܬ9Hh!C窉"ig-@D:9FY3 .rj=J1xG 'Q0/T^ U.I!Af}y]U9q>UR]U9q>URy#`Pq+{0=2)EdC&PR^,IJG|޷r33 P!4|+2z֜yR鷭zLz뽉zj]0"QgGwcynט>ލ{%wcxWB c?J'UnJEK FI;r+KUnJEK FI;r+K`Pq+{0=2)EdC&PR^- Ū>ހ9:@{|O h^`%93j <0^G` 0VҒU]G QGy,̪(2xam{xDNfOYbвEdwW-NC)EdwW-NC)6Ee`Pq+{0=2)EdC&PR^.2Kn)V0r.,8)ߠ~&w:s_=bvِO%q7[&u3\8QzȃƑEl=E+  (u\&To"/X!"v +-uyxAz0%v +-uyxAz0%)p`Pq+{0=2)EdC&PR^/\?oߩ|ZbcҊ6OKFUMY|ϫf#ܿa+c]p`P φP6BW5w--(?;-ۍj%J/#t_pdY!czJqkEF 6HHk`~ 6HHk`~ Wv(`Pq+{0=2)EdC&PR^0 ʪP'oSQY -sɧTc*1H\lj+:Uɺ[;D9+=3Ĺ`; 8`)BmVK {%.~I4|AH f"9mb+3 H]S NH]S N봚i`Pq+{0=2)EdC&PR^1 ؟{l ÇnCu]TKT!sȰa繁+%ki~>'':hp4w6SW-R߂H$V6@q|Z`j0 d2> feQ$u[{}(Q$u[{}(;t`Pq+{0=2)EdC&PR^2 N-\9ͶeKLq jP1DO uX_/`LNO^\OS "(PbIl,Y@D܆6P/{)iǭ]1]f>vy#\Y]1]f>vy#\Yz`Pq+{0=2)EdC&PR^3[=(镦<@帙_:~޷-=WwiK,d.8qNl /c #ܱZfPaihuxRiXE;y3æ'䴯 qwpvϲ. -(Cpvϲ. -(C ޖ`Pq+{0=2)EdC&PR^4Z2Q>wJ+%9iHqB*И"c0Pv#ޅ0Sn{&l2=S4 h*]u9W}r츔2-d)vߣy|k-7huHEw魑_Rw魑_R`Pq+{0=2)EdC&PR^5/)i:3pDX|jhyMPOmZ1l>E 3L  g'tN!N.d_G1BJ1jkL`ڀe0-"mC9cSȣKC9cSȣKg'>`Pq+{0=2)EdC&PR^6ʚ +1/q}Յ39I•L5{ 施u: ;=߁r bpU4WpG~gU*&bWƑ;Np9_ə[)_æ 7mһ@)_æ 7mһ@~ `Pq+{0=2)EdC&PR^7ݥ=ZX'ZhӰ8~e?R u-TZ^tH0G| 4M(]% mzY.U0Zѿ!X }'gv{g]Gק& c{>6\&Y脗Prۼ0o5 >脗Prۼ0o5 >JG`Pq+{0=2)EdC&PR^8)FRK b-Gӑ2u is1J퉛ɰO.ۘ:]5%Dp4 ..tM)m=l`Jp}.^j]7\hv\g(dU]7\hv\g(dU n`Pq+{0=2)EdC&PR^9S-)Zpyx_ߏ74[#"YZĨ'yIEǏg sLdbn>Z@GH"A:sscN'Zbfpp f+ Τ:Xa0eh %^wΤ:Xa0eh %^w9D/`Pq+{0=2)EdC&PR^:"2Wrۊ\Nz'm+{vMo(dٻ4ns p"'Wd/]/H,5j7}hߧ#xFfVP7+JE5@[C8ĩEJE5@[C8ĩExw{`Pq+{0=2)EdC&PR^;<d&*"'$!ySr11j9ìY20\D_Ms٪GoνszЕ?(h؎1%P#anO`s;,lLp.quhlď $VW6xa~9AJ]+6xa~9AJ]+ZΏ`Pq+{0=2)EdC&PR^<> 6V̞r%αCB0䵧L*kZrbjk%sOKryނ '6|KxBڄ]*K\QJ5y57xDIԃ/oi-%">BΧi N%+>BΧi N%+X`Pq+{0=2)EdC&PR^=@_C8$Y ĉ1rܓR|) tzX3oG9R͝K@n| >]~o3aAKW{r,\bN`Y?&8~QS=hQou߼ƁA&d4ܹF ,N/x2M4ܹF ,N/x2MY`Pq+{0=2)EdC&PR^>Y_MCuYrqoNLɃЭɁ1Wgn]19+NМ( 7ΆTAeզjiDJ K}6;Cmz#e&H`|o!a֚\C;q;Uo!a֚\C;q;U$`Pq+{0=2)EdC&PR^?(LБTdbXIe }+صI%v0C66ZH>;P)9*cs"(]q`td hgz W=`^<#>2VX!2oɫ^*PhJ0oucyPhJ0oucy``Pq+{0=2)EdC&PR^@{m0&(xL1]MkwŊ\O$mi CC߮2Q3y*9ch =hM=GN.>҅K˲/ didy4T"6ĠFffIf-gf:~dwFAXXѢdfKwFAXXѢdfK|;`Pq+{0=2)EdC&PR^AFEiu JܜMtKKks8&s8閨Ё^[N/-ZyXq$x]a*!C hFh iy'U4w },Ttjō>9Ttjō>9k`Pq+{0=2)EdC&PR^BRe0(ƈUu:T76_h*ujvǛ;REX60H^xD_y^! #722&`{Ĥg-;4.S!Ӡʋ0MG}Vw~߀s wAT)_{s wAT)_{ 1`Pq+{0=2)EdC&PR^Cg0ZhS: c R`Q{* S^< d^P=twɝuE@QgY~‰x! D4/!~vcOj|ƷO .(T/cY RJ3Em !|ƭ9"T{$QI=?!|ƭ9"T{$QI=?r`Pq+{0=2)EdC&PR^D(B}a!. Ō~+k+R#yff%9-u.,&v b/$(Y\t0"Wr0OUBJO= ;seAVi[F0Rfƞ/w XEԽvfƞ/w XEԽvS`Pq+{0=2)EdC&PR^EӱgmhV Ѣl1{ÁG)[oi![!.'B"MJigeoM mU?JR2c}ASjXFŠ#Dz:BKANWc?ӥ(bگ=ŕE4?{C]9Mگ=ŕE4?{C]9M> `Pq+{0=2)EdC&PR^Fut\;;Wkz2r|C* 1"0>{Ԏ;,]V睊AY;6*V~;A[Ȧ޶` $[ȘnSȞvZt`L5ȭ={q No8 ^qE.18 ^qE.1@3[`Pq+{0=2)EdC&PR^G0%Q>}^ClIyѓ,M8ې6X.S)v.*i`f;+I)n'ALEK.H~fO٬BsyxY6oy&) Pc2gLI*[˥#Pc2gLI*[˥#`Pq+{0=2)EdC&PR^HeBo'jYW⢆\OJ'ty y]a4e׻[JlyDn1ip/~hn1ip/~h`Pq+{0=2)EdC&PR^K-}_v$#̦s?֟m45ֳ k'NͿ=%I1Hd0Ϳ=%I1Hd0\`Pq+{0=2)EdC&PR^MvqI\ɖ×R_6Tc KT)jڪhG.dZ(HDTgE-0wdfFz_]E+nluIc:@e\e+;SFV12JGoC12JGoCm `Pq+{0=2)EdC&PR^NpL |+O' r;q֥btȲBuW*|4>3WKkYD2؝!dJ;mt7x7jx88+( ELt%} 1p.U }d1I ЎA4Y57Ad1I ЎA4Y57A;m`Pq+{0=2)EdC&PR^OE񰟣‹ln-$%!p !d H-\jc=Eg}ey_V ؙr`Pq+{0=2)EdC&PR^PS:O80:rL,p\Bljw+Oj$ b=էz,i#[*:|I ir1V8^(Dz"[k=~m$IEFX]Wۀq}.wlAkl#+cOY¨AS;hS;Y¨AS;hS;)(`Pq+{0=2)EdC&PR^SdWg&O;gߍ ];\;f.ϯ{RbBܚ|V5ߵ)te_ [H3'\a1b*!݆!EumNT;Nơo7Pto7Pt<]1`Pq+{0=2)EdC&PR^T˗?(ḩ?} ?u-ĢJ-NNI9C.rc}6"G<$ob㷭%nE̖سO@}S|8[Ҽ˅5kq!b_4rSt$/sRrSt$/sR`Pq+{0=2)EdC&PR^Uj(gOK%]>Y(ձPϿl?* t~W|* W'@l,+D؏]jdT7 w@+̼z/_awȹBeq ޔH&9mu8JS&9mu8JSp`Pq+{0=2)EdC&PR^V2PL}^6jd ӠK*-lU\) V&Ώ4P>ϐ :12̱:0sU f D|4Ć?E_Ao֪@U>k`Pq+{0=2)EdC&PR^[! ' cTRAk-u7yc|D\+Vr[~vͥҌ!dQTnk_Ϗ b{S+~%p6DyZs-m-VEk+;4j)W>ԠC#^ (TW>ԠC#^ (TA?i`Pq+{0=2)EdC&PR^\r/l4q T#RvĉMއ`Pq+{0=2)EdC&PR^]J)[s(ؗ(2f~1Q(dV១~aR$LpzLG"%ls4{q\?ǐ t8)o7j9!Ƌ!2^mN+w(/`R9A(Ԣh?!.؄Gz8?!.؄Gz8B`Pq+{0=2)EdC&PR^^Mv+h6"MKhXXOI51 ȎHrCSuafv+<;J+*m] މ$:{J+*m] މ$:{YW`Pq+{0=2)EdC&PR^`i<uO8k!4d'ytTnu`G.F3$dpvJF%;!G,JG"KC5Fh-Egu[%HAPS*W 9W I? ,9?}Cx2't kx"eCx2't kx"e `Pq+{0=2)EdC&PR^a5=xCK|_w uh ا5ӣcQSϼ;{;խ2û1;I8$yR|#/*Bzߢ5ߢ;RG?}sƎ?Bm^i2^m^i2^^.?`Pq+{0=2)EdC&PR^bEU$HrhBih7ܙ-a=g|kLVwbd< w^}IFUvrDۈ%(kzz9%o :𮔸mXR˻82v0.԰Inp$k0.԰Inp$k\`Pq+{0=2)EdC&PR^cfq`GQBn?xl"܎g-S4Äq-Y>W j$daG]L3|\Or#s*meM:Г5nyxe昁̋@V*. 5q|}Kn5+296>ƼG u\RpiM~\RpiM~z-`Pq+{0=2)EdC&PR^`0#kb/M9,/iж3pgyU,2*KEʨ.gPG{) 0%&|▉T[ ]M`{xa꿰~V^yJ>BLMP_^yJ>BLMP_z`Pq+{0=2)EdC&PR^_;-Q24ڍ5v\ q{NǛ\ˊ1$Mw'lGs1񝨝 g|AJbkeVUq[p~/[M~6 $紆0{Yaګ3 $紆0{Yaګ3<#T`Pq+{0=2)EdC&PR^ɌILb,@\l)G4%ΨnivUE c@(=جtx<"v0]z=v5Qq0@.-*>Q(hnKXM!XB%@;M!XB%@;X&`Pq+{0=2)EdC&PR^tU࠮L<_$8LvKzA]E˝?&ߟb>˝?&o#`Pq+{0=2)EdC&PR^!Oq.j|ٶ< *Uhr|p»Qq4;Y_vkTLG?UJ3;Y!Hcr? `$@ I}[%i`qn@:9wy>+A?xqڄqiM.ވqڄqiM.Ɇ'`Pq+{0=2)EdC&PR^>S4<؆`k DBi+u4V6*x Ts黏0{UME-]ͯ:0%ΛbXMJ?:&c9% ʗ1'eL0uUiZXI6sRXI6sRk*Ƃ`Pq+{0=2)EdC&PR^}e"Xȴ(Ȥ{A'B)`P7`/Q{ CHU1"O@*w1_N{>T_<@~[pǔ4Zٚh$r0/Jiz,T+\7[s<$[7UAgI!<$[7UAgI!m(`Pq+{0=2)EdC&PR^ F#ʨn,'V/XgƚGzj(܊h䮜?řy z6xH M'R 8wS=%\ɅM]SofQYLKҒLU[{V2S';8t &x4[C ';8t &x4[C n[`Pq+{0=2)EdC&PR^ *Ty )KvȥWjidh k]* 5W)j} >Q|BPcqZIP}6Ģ|D=ihJF6亁%M"bsOˆ4&0rx-fg [ &0rx-fg [ SHA`Pq+{0=2)EdC&PR^ ݫq))Ǔ9#m BKHLƾXX7/*1C*7<{z gf91*[~1<ϬrM}U"C4KF=$?sb4/B/{Xvm\{Vܬ/{Xvm\{Vܬ?`Pq+{0=2)EdC&PR^ a),̒)fep- eAB]4\}V/Zӳ苂bg1Z}r5;sYv_=S'c$v̵S 7[}AMiv[ rSe6Wzk5T8r60T};lk5T8r60T};l:D`Pq+{0=2)EdC&PR^ Xz8@ mrvp1b$L:݀A*Ϳ_Ѧrk8fNto1Mxxό94~Gb3O|rzқk|!gOB3S#o-q)AD(c8q)AD(c8a``Pq+{0=2)EdC&PR^溓4'd#^`R#:LlƜ/Y8ZƜTLtPq-Z݋"\4|M+Ux'Vtfij'2Gsh"=E+ oJY"z<5,[H2g G3cEO_*"H+Ě!cEO_*"H+Ě!0/`Pq+{0=2)EdC&PR^g0e3vGKO/hW/ҳ-'rIRN5 ``Pq+{0=2)EdC&PR^>q%}%O.PjV)rqih$ߥXjN)ܫ'Y4F_0ѭ3\g |[<D{qU`oZN`JeXۻ)Ok $*;U㉖ 8Ok $*;U㉖ 8Ȓ.$`Pq+{0=2)EdC&PR^C@i}k.wVYHk }5ى= P5XQ{s A?4pu=1q*kXHxՆWvhoFS< c>(bCDE5C[a##!5C[a##!A`Pq+{0=2)EdC&PR^<^~PZ7SfD,  _F$ʹ0y@VеWҰxspyҮԤ(z,D|jls%ˋ4oY{BEN7d.牏F[); nuJP); nuJP`Pq+{0=2)EdC&PR^fo\fϠx UHtڊ6e{}S}$WUC5<0}˔tFe ˔A}xh8gBCOcl">b~p)t6YQ7^<:(~p)t6YQ7^<:(/#`Pq+{0=2)EdC&PR^sX5pIoM.6|U&KcI]3Rӹe\S#+HxL⣤a,Y޹RȒ sl+.VvLMz!fp-:2ϟQ>*N@l ?Z2ϟQ>*N@l ?Z<`Pq+{0=2)EdC&PR^r^% JuMj*=(,Ԝ V2KLt| T`3bm_@ p;IS`3 du[ !C$ZgH $;.Ge})Zɸh֦aXb{b9TeXѠ-]w`(V.TLY?91GL?a*՘e3gL?a*՘e3gJ`Pq+{0=2)EdC&PR^W|V_=0e%`g/~Og]=A`#U}gyCTIuUDVttR=oΔ`>KdbIGD&;^ƒӊ{]D&;^ƒӊ{]9`Pq+{0=2)EdC&PR^=N'H<(.IJ'h8Ocx v%Iwktuxs$z͡м\+_ȹ)[qE1WՐLiE&ު1.;Wh{Z8ML)%.;Wh{Z8ML)%-w `Pq+{0=2)EdC&PR^Vz|/P+Z-ښ/H4voĩvvU>I}޺xК fP``J_ ß2szוf.l^BQCZ|x ՒI𹀇Tؕ=x ՒI𹀇Tؕ=w`Pq+{0=2)EdC&PR^3pNF4UTKux4)lc)nϚ(m>Z.>-H T(T6zOö%;8 Q[ToN f῍2 ۵u?Qa.S,N\۵u?Qa.S,N\r`Pq+{0=2)EdC&PR^Ufc`3fS&oLם38ѶƢ''!Tb-W@\ʻW\Qvw?EP3+ԍ;:#2|. #'3<ͮt3x@ vFSS3w=2GcQ@E z=2GcQ@E z  `Pq+{0=2)EdC&PR^VR^N=ŠdiNGjiո0ިޯC%/. c5e4w u20O ќMnp_VD\Ζ-! *BU>|8(2l0p [|8(2l0p [t`Pq+{0=2)EdC&PR^=qZD@xGz \CfmZq״ښ 0'GuTd*v6Hp}J{TZ?L;]4xdo$2B)lY"'[PMiB)lY"'[PMiPJ`Pq+{0=2)EdC&PR^W~vkHTt3|Q.~3 7vYWLx%:ZykTS}*-\AVJ;f@ůZ 2gkDS\O %K:zLQByoX|OEdj5O.Ιx(-ѴNbgrW.Ιx(-ѴNbgrW`Pq+{0=2)EdC&PR^C;nlߵe_ފW_%X{׀/wcyFn$!O}9Ê=dSת5,#$S@Nhz~ _gf[Q+Yµ%j*6X{AlD_dGc1Z ,slNGc1Z ,slN˚`Pq+{0=2)EdC&PR^"׈u_` '~-$fשOƙ>?M7S*@*6r;uݞ|M[zbbQ5؃!^Y3tہQ$hrPgJIVb_ƓJG-߯JG-߯(-`Pq+{0=2)EdC&PR^#N0@ A${:=N]RH<TDRӐ10"ǤI3V!Xa  [pq_8vE2Z/g%l{|"?ܸNw31DT !ޮN0231DT !ޮN02 eJ`Pq+{0=2)EdC&PR^$qtS .'x]+wfN/a*ޒsgә($H="sT:y0Af'd#8x4*%A+!Ńm4nACUVrSHE&Kgmp" {B_q==OnPOo{B_q==OnPOoM@-`Pq+{0=2)EdC&PR^%D/ڻF [N]!"Se;"gVΜ0x5;Ã7]/L56UbFGqI\%`"CkW$W@{{·AaQ@T]-ddu&ӲD+2]-ddu&ӲD+2f`Pq+{0=2)EdC&PR^&U'зLKߙ/U!sa&j(h}>=w簿7$0%, uLO} qO'@A<%!' `Hy_z?lkVK+s-a&"T@K+s-a&"T@ `Pq+{0=2)EdC&PR^'%&O-̶=<톦p1%#m ޞ,j2Zͻ}K>sP񪉘(`fuoZlP5zg$j&YP-*WM}0uzv(6bMԚfԴzv(6bMԚfԴ)v`Pq+{0=2)EdC&PR^(Zn+݁#ynC^fîB)T{ ʊ0l:UO\^ݧm[PZֶK@O u*ء-w+EUׯ~Yoo>2ӿ sn~Ыo>2ӿ sn~ЫqΥ`Pq+{0=2)EdC&PR^)ةNb.iY~->5d Xxo~֋F+1bpD^X{|{l5ۥۻR )9M6ȿOC&_h!hi(B\kb}?#L>/+ -O|!boT>/+ -O|!boTC@`Pq+{0=2)EdC&PR^*DOABUu,p?Hõ5i#((nsFvQ mP-]/I%plb7E6v <WTC)Td'Y8^ݦxhkX\CaܜBB Ă\CaܜBB Ă3`Pq+{0=2)EdC&PR^+rFiP`<ܬ9Hh!C窉"ig-@D:9FY3 .rj=J1xG 'Q0/T^ U.I!Af}y]U9q>UR]U9q>URy#`Pq+{0=2)EdC&PR^,IJG|޷r33 P!4|+2z֜yR鷭zLz뽉zj]0"QgGwcynט>ލ{%wcxWB c?J'UnJEK FI;r+KUnJEK FI;r+K`Pq+{0=2)EdC&PR^- Ū>ހ9:@{|O h^`%93j <0^G` 0VҒU]G QGy,̪(2xam{xDNfOYbвEdwW-NC)EdwW-NC)6Ee`Pq+{0=2)EdC&PR^.2Kn)V0r.,8)ߠ~&w:s_=bvِO%q7[&u3\8QzȃƑEl=E+  (u\&To"/X!"v +-uyxAz0%v +-uyxAz0%)p`Pq+{0=2)EdC&PR^/\?oߩ|ZbcҊ6OKFUMY|ϫf#ܿa+c]p`P φP6BW5w--(?;-ۍj%J/#t_pdY!czJqkEF 6HHk`~ 6HHk`~ Wv(`Pq+{0=2)EdC&PR^0 ʪP'oSQY -sɧTc*1H\lj+:Uɺ[;D9+=3Ĺ`; 8`)BmVK {%.~I4|AH f"9mb+3 H]S NH]S N봚i`Pq+{0=2)EdC&PR^1 ؟{l ÇnCu]TKT!sȰa繁+%ki~>'':hp4w6SW-R߂H$V6@q|Z`j0 d2> feQ$u[{}(Q$u[{}(;t`Pq+{0=2)EdC&PR^2 N-\9ͶeKLq jP1DO uX_/`LNO^\OS "(PbIl,Y@D܆6P/{)iǭ]1]f>vy#\Y]1]f>vy#\Yz`Pq+{0=2)EdC&PR^3[=(镦<@帙_:~޷-=WwiK,d.8qNl /c #ܱZfPaihuxRiXE;y3æ'䴯 qwpvϲ. -(Cpvϲ. -(C ޖ`Pq+{0=2)EdC&PR^4Z2Q>wJ+%9iHqB*И"c0Pv#ޅ0Sn{&l2=S4 h*]u9W}r츔2-d)vߣy|k-7huHEw魑_Rw魑_R`Pq+{0=2)EdC&PR^5/)i:3pDX|jhyMPOmZ1l>E 3L  g'tN!N.d_G1BJ1jkL`ڀe0-"mC9cSȣKC9cSȣKg'>`Pq+{0=2)EdC&PR^6ʚ +1/q}Յ39I•L5{ 施u: ;=߁r bpU4WpG~gU*&bWƑ;Np9_ə[)_æ 7mһ@)_æ 7mһ@~ `Pq+{0=2)EdC&PR^7ݥ=ZX'ZhӰ8~e?R u-TZ^tH0G| 4M(]% mzY.U0Zѿ!X }'gv{g]Gק& c{>6\&Y脗Prۼ0o5 >脗Prۼ0o5 >JG`Pq+{0=2)EdC&PR^8)FRK b-Gӑ2u is1J퉛ɰO.ۘ:]5%Dp4 ..tM)m=l`Jp}.^j]7\hv\g(dU]7\hv\g(dU n`Pq+{0=2)EdC&PR^9S-)Zpyx_ߏ74[#"YZĨ'yIEǏg sLdbn>Z@GH"A:sscN'Zbfpp f+ Τ:Xa0eh %^wΤ:Xa0eh %^w9D/`Pq+{0=2)EdC&PR^:"2Wrۊ\Nz'm+{vMo(dٻ4ns p"'Wd/]/H,5j7}hߧ#xFfVP7+JE5@[C8ĩEJE5@[C8ĩExw{`Pq+{0=2)EdC&PR^;<d&*"'$!ySr11j9ìY20\D_Ms٪GoνszЕ?(h؎1%P#anO`s;,lLp.quhlď $VW6xa~9AJ]+6xa~9AJ]+ZΏ`Pq+{0=2)EdC&PR^<> 6V̞r%αCB0䵧L*kZrbjk%sOKryނ '6|KxBڄ]*K\QJ5y57xDIԃ/oi-%">BΧi N%+>BΧi N%+X`Pq+{0=2)EdC&PR^=@_C8$Y ĉ1rܓR|) tzX3oG9R͝K@n| >]~o3aAKW{r,\bN`Y?&8~QS=hQou߼ƁA&d4ܹF ,N/x2M4ܹF ,N/x2MY`Pq+{0=2)EdC&PR^>Y_MCuYrqoNLɃЭɁ1Wgn]19+NМ( 7ΆTAeզjiDJ K}6;Cmz#e&H`|o!a֚\C;q;Uo!a֚\C;q;U$`Pq+{0=2)EdC&PR^?(LБTdbXIe }+صI%v0C66ZH>;P)9*cs"(]q`td hgz W=`^<#>2VX!2oɫ^*PhJ0oucyPhJ0oucy``Pq+{0=2)EdC&PR^@{m0&(xL1]MkwŊ\O$mi CC߮2Q3y*9ch =hM=GN.>҅K˲/ didy4T"6ĠFffIf-gf:~dwFAXXѢdfKwFAXXѢdfK|;`Pq+{0=2)EdC&PR^AFEiu JܜMtKKks8&s8閨Ё^[N/-ZyXq$x]a*!C hFh iy'U4w },Ttjō>9Ttjō>9k`Pq+{0=2)EdC&PR^BRe0(ƈUu:T76_h*ujvǛ;REX60H^xD_y^! #722&`{Ĥg-;4.S!Ӡʋ0MG}Vw~߀s wAT)_{s wAT)_{ 1`Pq+{0=2)EdC&PR^Cg0ZhS: c R`Q{* S^< d^P=twɝuE@QgY~‰x! D4/!~vcOj|ƷO .(T/cY RJ3Em !|ƭ9"T{$QI=?!|ƭ9"T{$QI=?r`Pq+{0=2)EdC&PR^D(B}a!. Ō~+k+R#yff%9-u.,&v b/$(Y\t0"Wr0OUBJO= ;seAVi[F0Rfƞ/w XEԽvfƞ/w XEԽvS`Pq+{0=2)EdC&PR^EӱgmhV Ѣl1{ÁG)[oi![!.'B"MJigeoM mU?JR2c}ASjXFŠ#Dz:BKANWc?ӥ(bگ=ŕE4?{C]9Mگ=ŕE4?{C]9M> `Pq+{0=2)EdC&PR^Fut\;;Wkz2r|C* 1"0>{Ԏ;,]V睊AY;6*V~;A[Ȧ޶` $[ȘnSȞvZt`L5ȭ={q No8 ^qE.18 ^qE.1@3[`Pq+{0=2)EdC&PR^G0%Q>}^ClIyѓ,M8ې6X.S)v.*i`f;+I)n'ALEK.H~fO٬BsyxY6oy&) Pc2gLI*[˥#Pc2gLI*[˥#`Pq+{0=2)EdC&PR^HeBo'jYW⢆\OJ'ty y]a4e׻[JlyDn1ip/~hn1ip/~h`Pq+{0=2)EdC&PR^K-}_v$#̦s?֟m45ֳ k'NͿ=%I1Hd0Ϳ=%I1Hd0\`Pq+{0=2)EdC&PR^MvqI\ɖ×R_6Tc KT)jڪhG.dZ(HDTgE-0wdfFz_]E+nluIc:@e\e+;SFV12JGoC12JGoCm `Pq+{0=2)EdC&PR^NpL |+O' r;q֥btȲBuW*|4>3WKkYD2؝!dJ;mt7x7jx88+( ELt%} 1p.U }d1I ЎA4Y57Ad1I ЎA4Y57A;m`Pq+{0=2)EdC&PR^OE񰟣‹ln-$%!p !d H-\jc=Eg}ey_V ؙr`Pq+{0=2)EdC&PR^PS:O80:rL,p\Bljw+Oj$ b=էz,i#[*:|I ir1V8^(Dz"[k=~m$IEFX]Wۀq}.wlAkl#+cOY¨AS;hS;Y¨AS;hS;)(`Pq+{0=2)EdC&PR^SdWg&O;gߍ ];\;f.ϯ{RbBܚ|V5ߵ)te_ [H3'\a1b*!݆!EumNT;Nơo7Pto7Pt<]1`Pq+{0=2)EdC&PR^T˗?(ḩ?} ?u-ĢJ-NNI9C.rc}6"G<$ob㷭%nE̖سO@}S|8[Ҽ˅5kq!b_4rSt$/sRrSt$/sR`Pq+{0=2)EdC&PR^Uj(gOK%]>Y(ձPϿl?* t~W|* W'@l,+D؏]jdT7 w@+̼z/_awȹBeq ޔH&9mu8JS&9mu8JSp`Pq+{0=2)EdC&PR^V2PL}^6jd ӠK*-lU\) V&Ώ4P>ϐ :12̱:0sU f D|4Ć?E_Ao֪@U>k`Pq+{0=2)EdC&PR^[! ' cTRAk-u7yc|D\+Vr[~vͥҌ!dQTnk_Ϗ b{S+~%p6DyZs-m-VEk+;4j)W>ԠC#^ (TW>ԠC#^ (TA?i`Pq+{0=2)EdC&PR^\r/l4q T#RvĉMއ`Pq+{0=2)EdC&PR^]J)[s(ؗ(2f~1Q(dV១~aR$LpzLG"%ls4{q\?ǐ t8)o7j9!Ƌ!2^mN+w(/`R9A(Ԣh?!.؄Gz8?!.؄Gz8B`Pq+{0=2)EdC&PR^^Mv+h6"MKhXXOI51 ȎHrCSuafv+<;J+*m] މ$:{J+*m] މ$:{YW`Pq+{0=2)EdC&PR^`i<uO8k!4d'ytTnu`G.F3$dpvJF%;!G,JG"KC5Fh-Egu[%HAPS*W 9W I? ,9?}Cx2't kx"eCx2't kx"e `Pq+{0=2)EdC&PR^a5=xCK|_w uh ا5ӣcQSϼ;{;խ2û1;I8$yR|#/*Bzߢ5ߢ;RG?}sƎ?Bm^i2^m^i2^^.?`Pq+{0=2)EdC&PR^bEU$HrhBih7ܙ-a=g|kLVwbd< w^}IFUvrDۈ%(kzz9%o :𮔸mXR˻82v0.԰Inp$k0.԰Inp$k\`Pq+{0=2)EdC&PR^cfq`GQBn?xl"܎g-S4Äq-Y>W j$daG]L3|\Or#s*meM:Г50 and (time.time() - start)>timeout: print 'Process exceeded timeout, killing it' killProcess(pid) out,err = process.communicate() if len(err.strip())>0: print '***ERROR in subprocess: cmd:', cli_str print '***ERROR in subprocess: err:', err return [out,err] def getAllHashes(fnlist): hashes = [] for fn in fnlist: out,err = execAndWait('sha256sum %s' % fn, skipAsk=True) hashes.append(out.strip()) return hashes def ASSERT(isTrue, txt): if not isTrue: print '***ERROR:', txt exit(1) # Copied from armoryengine.py def getVersionString(vquad, numPieces=4): vstr = '%d.%02d' % vquad[:2] if (vquad[2] > 0 or vquad[3] > 0) and numPieces>2: vstr += '.%d' % vquad[2] if vquad[3] > 0 and numPieces>3: vstr += '.%d' % vquad[3] return vstr def readVersionString(verStr): verList = [int(piece) for piece in verStr.split('.')] while len(verList)<4: verList.append(0) return tuple(verList) def getVersionInt(vquad, numPieces=4): vint = int(vquad[0] * 1e7) vint += int(vquad[1] * 1e5) if numPieces>2: vint += int(vquad[2] * 1e3) if numPieces>3: vint += int(vquad[3]) return vint def getVersionNumber(fn): if fn.endswith('.msi') or fn.endswith('.deb') or fn.endswith('.dmg'): try: verQuad = readVersionString(fn.split('_')[1].split('-')[0]) verInt = getVersionInt(verQuad) return verInt, getVersionString(verQuad) except: print 'WARNING: Could not parse installer filename: %s' % fn return 0,'' instDir = '.' if len(sys.argv) < 2 else sys.argv[1] ASSERT(os.path.exists(instDir), 'Directory does not exist') suffixes = set(['_amd64.deb', '_i386.deb', '_win64.msi', '_win32.msi', '_OSX.dmg']) latestVerInt = 0 latestVerStr = '' for fn in os.listdir(instDir): vi,vs = getVersionNumber(fn) if vi>latestVerInt: latestVerInt = vi latestVerStr = vs for suf in suffixes: if fn.endswith(suf): suffixes.remove(suf) break print '\nVersion number found: ("%s", %d)' % (latestVerStr, latestVerInt) ASSERT(len(suffixes)==0, 'Not all installers found; remaining %s' % str(suffixes)) off32 = os.path.join(instDir, 'armory_deps_10.04_32bit') off64 = os.path.join(instDir, 'armory_deps_10.04_64bit') ASSERT(os.path.exists(off32), 'Need armory32 deps dir to create offline bundles') ASSERT(os.path.exists(off64), 'Need armory64 deps dir to create offline bundles') instFiles = [] deb32 = '' deb64 = '' for fn in os.listdir(instDir): fullfn = os.path.join(instDir,fn) if getVersionNumber(fn)[0]==latestVerInt: instFiles.append(fullfn) if fn.endswith('.deb'): if 'i386' in fullfn: deb32 = fullfn elif 'amd64' in fullfn: deb64 = fullfn print '\nAll installation files:' for f in instFiles: print ' ', f print 'All armory debs:' print ' ', deb32 print ' ', deb64 print '\nPlease verify the pre-signed SHA256 hashes!' hashes = getAllHashes(instFiles) for h in hashes: print ' ',h.strip() raw_input('Make sure the .msi files are signed... continue?') print '\nSigning debian packages' execAndWait('dpkg-sig -s builder -m "Alan C. Reiner" -k fb596985 %s' % deb32) execAndWait('dpkg-sig -s builder -m "Alan C. Reiner" -k fb596985 %s' % deb64) print '\nCopying signed debian pacakges to offline directories' newOff32 = os.path.join(instDir, 'Armory_Offline_Bundle_10.04-32bit') newOff64 = os.path.join(instDir, 'Armory_Offline_Bundle_10.04-64bit') if os.path.exists(newOff32): shutil.rmtree(newOff32) if os.path.exists(newOff64): shutil.rmtree(newOff64) print '\nCopying trees' shutil.copytree(off32, newOff32) shutil.copytree(off64, newOff64) shutil.copy(deb32, newOff32) shutil.copy(deb64, newOff64) # I freakin hate tar... it never does what I want... which is to not have # to os.chdir in a python script... print '\nTarring the offline bundle directories...' tar32 = 'armory_%s-beta_OfflineBundle_Ubuntu-10.04-32bit.tar.gz' % latestVerStr tar64 = 'armory_%s-beta_OfflineBundle_Ubuntu-10.04-64bit.tar.gz' % latestVerStr newOff32_abs = newOff32 newOff64_abs = os.path.abspath(newOff64) prevdir = os.getcwd() os.chdir(instDir) execAndWait('tar -zcf %s Armory_Offline_Bundle_10.04-32bit/*' % (tar32)) execAndWait('tar -zcf %s Armory_Offline_Bundle_10.04-64bit/*' % (tar64)) os.chdir(prevdir) instFiles.extend([os.path.join(instDir, tar32), os.path.join(instDir, tar64)]) instFiles.sort() newHashes = getAllHashes(instFiles) for h in newHashes: print ' ', h.strip() hashfn = os.path.join(instDir, 'armory_%s-beta_sha256sum.txt' % latestVerStr) hashfile = open(hashfn, 'w') print newHashes for hline in newHashes: if len(hline.strip()) > 0: h,fn = hline.split() basefn = os.path.basename(fn) print ' ', h, basefn hashfile.write('%s %s\n' % (h,basefn)) hashfile.close() execAndWait('gpg -s --output %s --clearsign %s ' % (hashfn+'.asc', hashfn)) os.remove(hashfn) # GIT SIGN armory-0.92.3/versions.txt0000644000000000000000000003471012414772654014246 0ustar rootroot#------------------------------------------------------------------------------- # https://raw.github.com/etotheipi/BitcoinArmory/master/versions.txt # Maintain this file in the repo so that Armory can always find info # about the latest version. This is a good way to document progress, # anyway... # # We also bundle in signed information needed to download and verify # the latest version of the Satoshi client. We use ATL's public key # hardcoded into armoryengine.py, for which the private key is on the # offline computer. This is necessary because Armory is not guarnteed # to have access to a GPG utility, but of course it can verify ECDSA # signatures... # # We can also use the first line to simply get the the latest version # number instead of trying to determine from the installer filenames # (which isn't too hard... unless it's later changed and then the # older version of Armory can't decode the new version strings) # # -----BEGIN-SIGNED-DATA-------------------------------------------------------- # SECTION-INSTALLERS-SATOSHI 0.8.1 # Linux http://sourceforge.net/projects/bitcoin/files/Bitcoin/bitcoin-0.8.1/bitcoin-0.8.1-linux.tar.gz 6d7f023a9df1a436c51de83f7cd751f162be9b4fb1c06da05545f9fba7cb2a98 # MacOSX http://sourceforge.net/projects/bitcoin/files/Bitcoin/bitcoin-0.8.1/bitcoin-0.8.1-macosx.dmg dddc563af906e766900868970fd2146a1cad792fd7089f034d46ad0e838ce99f # Windows http://sourceforge.net/projects/bitcoin/files/Bitcoin/bitcoin-0.8.1/bitcoin-0.8.1-win32-setup.exe 2d447daad6cba12a4dd29de4ffbbd00c5634f45818d39cc12ce27ad964c905a6 # SECTION-INSTALLERS-ARMORY 0.88 # No download links needed yet # -----SIGNATURE---------------------------------------------------------------- # 284651a0c1a5f41152f8332452831c35db0e0294dc36edac2d76e5ca0e1257370a480a2686e03cd8505e76811959aec4d125503a0efb6c960d6b38af0a8d2900 # -----END-SIGNED-DATA---------------------------------------------------------- # #------------------------------------------------------------------------------- VERSION 0.88 - Windows Users: PLEASE UNINSTALL PREVIOUS VERSIONS! The installer fails to completely overwrite previous versions of Armory. Either uninstall Armory first, or install this version, then run the installer again and select "Repair Installation." - Auto-Management of Bitcoin Software (with version notification) This version now requires you to _not_ run Bitcoin-Qt in the background. Armory will run it for you. You can change its behavior in the "File"->"Settings" menu, including reverting to the previous, user-managed method. - New Troubleshooting Webpage If you are having trouble with Armory, especially the new version that has auto-management of Bitcoin software, visit https://bitcoinarmory.com/troubleshooting-armory/ - Mac/OSX Version Now Available! Thanks to forum users, "higuys" and "Red Emerald," we now have a working prototype *.dmg file for OSX. It does not work on all OSX systems, but should work on newer ones. We are working to expand compatibility with more versions of OSX. NOTE: the new auto-management of Bitcoin software is disabled in OSX due to some issues with the way that software is packaged. - Signed Windows Installers Native code signing using offline, Class 2 SSL certificate. Installer will now say "Verified Publisher: Alan Reiner" when you install in Windows. GPG-signed hash files will still be made available, using offline GPG key: 0x98832223 - Unicode/Non-ASCII Issues Resolved Armory does not yet have full unicode support, but some features were upgraded to accommodate non-English(US) systems better. - Clickable "(?)" Objects The blue "(?)" objects in the interface are mouse-over tooltips that give you more information when you hover over them. They have now been updated to display the tooltips when you click on them. - Passphrase Entry: On-Screen Keyboard You can now use your mouse with an on-screen keyboard to enter your passphrase when unlocking a wallet. This is convenient for those that prefer point-and-click, and also has potential to mitigate simple keyloggers. - Fragmented Backup Scripts (Expert Only) Two new scripts added to "extras" directory: "frag_wallet.py" and "unfrag_wallet.py". These scripts can be used to split your wallet into pieces/fragments using Shamir's Secret Sharing. This is only available from the command line, but will be integrated into the application itself in the next release. The new interface will include restoring fragmented backups created with these scripts. - New Ubuntu 10.04 offline bundles (32- and 64-bit) Recompiled offline bundle with some usability updates, as well as a 64-bit version. Both are still compiled for Ubuntu 10.04 since that version has a very wide hardware compatibility set. >>>>>>> backupcenter #------------------------------------------------------------------------------- # VERSION 0.87 - Inflatable QR Codes Everywhere! QR codes added to multiple areas where addresses are displayed, including the "Create Clickable Link" window which displays the full payment request in the QR code. Double-click on any QR code to inflate it to full screen. - Added Paper Backup info to "Backup Individual Keys" If you have a lot of imported keys, you can now backup everything using the "Backup Individual Keys" dialog. It displays the same four lines as on your paper backup, at the top of the key list. Also added option to include the address pool to the backup. - New Right-Click Menu Options The "Transactions" ledger and address lists have new options, including links to view the data on blockchain.info. - Real support for Bitcoin-Qt/bitcoind 0.8+ Prior attempt at supporting 0.8 Satoshi client was broken due to incomplete information about the changes. Support has finally been implemented and tested. - Bugfix: Copying Payment Requests The "Copy to Clipboard" button on the payment request dialog never worked reliably. It now copies actually-clickable links that should paste correctly into other applications, such as email apps (Outlook, Thunderbird), and message composition forms in webbrowser email sessions. - Bugfix: P2Pool Transactions Importing wallets with P2Pool transactions no longer crashes Armory - Bugfix: Sweeping and Importing Addresses Some problems with sweeping have been resolved. Importing addresses already contained in other wallets is prohibited now. It used to just produce weird answers, now it appears to produce crashes. - Billions of Little Bug Fixes Special thanks to forum user "subSTRATA" who identified many DOZEN minor bugs and suboptimal features. Most of them have been fixed or upgraded, to create a smoother experience, overall. #------------------------------------------------------------------------------- VERSION 0.86.3 - Right-click Ledger Options Added right-click menu to ledger for quick access to transaction and wallet information. - Offline-Sign Confirmation & Warnings Offline signing now displays appropriate warnings about what users should verify for before signing and broadcasting. - Added Comments to Coin Control (Expert Mode) Abbreviated comments are now show in the coin control selection window, with full comments availble via mouse-over text. - Bugfix: Disappearing Addresses Some startup operations were inadvertantly "rewinding" wallets with unused addresses, causing those addresses to disappear from the address list, and then shown again when the user requested another address. Resolved. - Bugfix: Ledger Sorting All fields in the primary ledger are sortable. Some fields become unsortable as a side-effect of ledger optimizations in v0.85. #------------------------------------------------------------------------------- VERSION 0.86 - Added "Coin Control" (Expert Mode Only) Expert usermode now has the ability to control the specific input coins for each transaction, as well as redirect the change output to a custom address or return it to one of the inputs. - Bugfix: Double-Transactions A bug was causing transactions to show up twice for wallets that were just created. This was resolved by simply restarting Armory. Restarting is no longer required. #------------------------------------------------------------------------------- VERSION 0.85 - Official Beta Release! - Multi-threaded, no-wait loading! Armory now loads immediately and does all blockchain scanning and rescanning in the background. All wallet management operations are available while you wait! - Manual "bitcoin:" URL entry. If clicking on "bitcoin:" links doesn't work on your OS, you can right-click and copy the address string. There is now a button on the "Send Bitcoins" window that gives you a space to copy the URL and prefill the transaction for you. - Preparation for Bitcoin-Qt 0.8+ Bitcoin-Qt 0.8+ will change up the datadir file organization that Armory depends on. Added code to auto-detect this condition and switch to it automatically. - Bugfix: No more missing zero-confirmation transactions A network bug was interfering with the receipt of nearly 50% of all incoming, zero-confirmation transactions. They would only appear once they had made it into the blockchain. Armory should now see 100% of such transactions. - Restore Encrypted Backup You can now restore paper backups directly to an encrypted wallet file. - Manual Keypool Extension (Expert mode only) Wallet properties now tells you how many addresses have been generated for your wallet, and lets you generate more, in case a wallet recovery operation did not find all your coins. Alternatively, there is a new option, "--keypool=X", to specify how many addresses Armory should watch beyond your last used address in each wallet. - *Broke OSX paper backup printing The new multi-threading code has highlighted some bugs in the PyQt implementation that ships with with homebrew on OSX. So far, no workaround has been found, and users are encouraged to manually write down information on your paper backup. #------------------------------------------------------------------------------- VERSION 0.82.2 - URL/Link Creator Right click on an address in your address book, or press "Create Clickable Link" when you get a new address. Use this to email payment requests to others, or post payment information on webpages. - Minimize-to-system-tray The file menu now has a "Minimize" option, and you can set it to minimize-by-default when you click the "x" on the top window bar. - Logging system implemented All information normally written to console is now saved to a log file in the Armory home directory. This makes it much easier, to report bugs/crashes, especially for Windows users. Please use "File"-->"Export Log File" to save a copy and send it with your bug reports. - Specify Change Address (Expert Mode Only!) The send-bitcoins window now has options in the bottom-left corner to specify how you want change outputs to be constructed. Either recycle change into existing addresses, or specify an address. - New "MAX" button New button for each recipient in the send-bitcoins window. Given the values already entered for other recipients and the transaction fee, it will compute the max spendable balance for this recipient and insert it into the "Amount" field. - Version Checking and Notification When you start Armory, it will automatically check versions.txt in the master branch of Armory on github. It will then notify you if your version is older than the latest one. - Removed Bitcoin-Qt Wallet Migration This was causing more confusion than it was helping. Given that very few users will benefit from it anymore, it has been removed until the new wallet format is finished. - Fixed SelectCoins Bug Many users reported issues sending coins under some circumstances. #------------------------------------------------------------------------------- VERSION 0.81 - Export Transactions Window Export your transaction history in *.csv format. You can select which wallets to export, sort order, and date format. - Options/Preferences Dialog Set your default transaction fee, date formats, usermode, and system tray notifications! - Bug fix (Major: spend zero-conf change) If Armory needed to use zero-confirmation outputs to construct your transaction, it would crash. This has been fixed. - Bug fix (Major: address importing) There was an incompatibility between old address importing code and the new blockchain engine. All import/sweep operations should work as expected now #------------------------------------------------------------------------------- VERSION 0.80 - New Blockchain Engine! Rewrite of the blockchain engine (under-the-hood) that won't crash when the blk000X.dat file splits at 2 GB. It also makes it easier to later implement saving data between loads so that it only takes a long time the first time you load, or when you import new addresses. - Balances zero-conf tx and sent-to-self change There was previously multiple issues with the way that Armory was adding up balances that included change outputs and zero-confirmation outputs. This should be fixed - Coinbase Transaction Display Coinbase transactions (such as mining in P2Pool) now display properly, and will be not be considered spendable until 120 confirmations armory-0.92.3/writeNSISCompilerArgs.py0000644000000000000000000000066412414772654016347 0ustar rootroot''' Created on Sep 24, 2013 @author: Andy ''' import sys from string import join sys.argv.append('--nologging') from armoryengine.ArmoryUtils import BTCARMORY_VERSION # need back up 2 directories because this is run from # \cppForSwig\BitcoinArmory_SwigDLL and the output is # expected in the base directory f = open("../../CompilerArgs.nsi", 'w') f.write('!define VERSION ') f.write('.'.join(map(str, BTCARMORY_VERSION))) f.close() armory-0.92.3/armorymodels.py0000644000000000000000000012704112414772654014724 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ from os import path import os import platform import sys from PyQt4.QtCore import * from PyQt4.QtGui import * from CppBlockUtils import * from armoryengine.ALL import * from qtdefines import * from armoryengine.MultiSigUtils import calcLockboxID sys.path.append('..') sys.path.append('../cppForSwig') WLTVIEWCOLS = enum('Visible', 'ID', 'Name', 'Secure', 'Bal') LEDGERCOLS = enum('NumConf', 'UnixTime', 'DateStr', 'TxDir', 'WltName', 'Comment', \ 'Amount', 'isOther', 'WltID', 'TxHash', 'isCoinbase', 'toSelf', 'DoubleSpend') ADDRESSCOLS = enum('ChainIdx', 'Address', 'Comment', 'NumTx', 'Balance') ADDRBOOKCOLS = enum('Address', 'WltID', 'NumSent', 'Comment') TXINCOLS = enum('WltID', 'Sender', 'Btc', 'OutPt', 'OutIdx', 'FromBlk', \ 'ScrType', 'Sequence', 'Script', 'AddrStr') TXOUTCOLS = enum('WltID', 'Recip', 'Btc', 'ScrType', 'Script', 'AddrStr') PROMCOLS = enum('PromID', 'Label', 'PayAmt', 'FeeAmt') class AllWalletsDispModel(QAbstractTableModel): # The columns enumeration def __init__(self, mainWindow): super(AllWalletsDispModel, self).__init__() self.main = mainWindow def rowCount(self, index=QModelIndex()): return len(self.main.walletMap) def columnCount(self, index=QModelIndex()): return 5 def data(self, index, role=Qt.DisplayRole): COL = WLTVIEWCOLS row,col = index.row(), index.column() wlt = self.main.walletMap[self.main.walletIDList[row]] wltID = wlt.uniqueIDB58 if role==Qt.DisplayRole: if col==COL.Visible: return self.main.walletVisibleList[row] elif col==COL.ID: return QVariant(wltID) elif col==COL.Name: return QVariant(wlt.labelName.ljust(32)) elif col==COL.Secure: wtype,typestr = determineWalletType(wlt, self.main) return QVariant(typestr) elif col==COL.Bal: if not TheBDM.getBDMState()=='BlockchainReady': return QVariant('(...)') bal = wlt.getBalance('Total') if bal==-1: return QVariant('(...)') else: dispStr = coin2str(bal, maxZeros=2) return QVariant(dispStr) elif role==Qt.TextAlignmentRole: if col in (COL.ID, COL.Name): return QVariant(int(Qt.AlignLeft | Qt.AlignVCenter)) elif col in (COL.Secure,): return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) elif col in (COL.Bal,): if not TheBDM.getBDMState()=='BlockchainReady': return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) else: return QVariant(int(Qt.AlignLeft | Qt.AlignVCenter)) elif role==Qt.BackgroundColorRole: t = determineWalletType(wlt, self.main)[0] if t==WLTTYPES.WatchOnly: return QVariant( Colors.TblWltOther ) elif t==WLTTYPES.Offline: return QVariant( Colors.TblWltOffline ) else: return QVariant( Colors.TblWltMine ) elif role==Qt.FontRole: if col==COL.Bal: return GETFONT('Fixed') return QVariant() def headerData(self, section, orientation, role=Qt.DisplayRole): colLabels = ['', 'ID', 'Wallet Name', 'Security', 'Balance'] if role==Qt.DisplayRole: if orientation==Qt.Horizontal: return QVariant( colLabels[section]) elif role==Qt.TextAlignmentRole: return QVariant( int(Qt.AlignHCenter | Qt.AlignVCenter) ) # This might work for checkbox-in-tableview #QStandardItemModel* tableModel = new QStandardItemModel(); #// create text item #tableModel->setItem(0, 0, new QStandardItem("text item")); #// create check box item #QStandardItem* item0 = new QStandardItem(true); #item0->setCheckable(true); #item0->setCheckState(Qt::Checked); #item0->setText("some text"); #tableModel->setItem(0, 1, item0); #// set model #ui->tableView->setModel(tableModel); # Perhaps delegate for rich text in QTableViews #void SpinBoxDelegate::paint(QPainter *painter, const QStyleOptionViewItem &option, const QModelIndex &index) const #{ #QTextDocument document; #QVariant value = index.data(Qt::DisplayRole); #if (value.isValid() && !value.isNull()) { #QString text("This is highlighted."); #text.append(" ("); #text.append(value.toString()); #text.append(")"); #document.setHtml(text); #painter->translate(option.rect.topLeft()); #document.drawContents(painter); #painter->translate(-option.rect.topLeft()); #} # This was an almost-successful attempt to use a delegate to manage visibility # Will kind of hack around it, using a simpler delegate and a QTableView # signal to do the toggling ''' class AllWalletsCheckboxDelegate(QStyledItemDelegate): """ Taken from http://stackoverflow.com/a/3366899/1610471 """ def __init__(self, parent=None): super(AllWalletsCheckboxDelegate, self).__init__(parent) def createEditor(self, parent, option, index): """ Without this, an editor is created if the user clicks in this cell.""" return None def paint(self, painter, option, index): if not index.column() == WLTVIEWCOLS.Visible: QStyledItemDelegate.paint(self, painter, option, index) else: # Paint a checkbox without the label. checked = bool(index.model().data(index, Qt.DisplayRole)) check_box_style_option = QStyleOptionButton() if (index.flags() & Qt.ItemIsEditable) > 0: check_box_style_option.state |= QStyle.State_Enabled else: check_box_style_option.state |= QStyle.State_ReadOnly if checked: check_box_style_option.state |= QStyle.State_On else: check_box_style_option.state |= QStyle.State_Off check_box_style_option.rect = self.getCheckboxRect(option) #if not index.model().hasFlag(index, Qt.ItemIsEditable): #check_box_style_option.state |= QStyle.State_ReadOnly QApplication.style().drawControl(QStyle.CE_CheckBox, check_box_style_option, painter) def editorEvent(self, event, model, option, index): """ Change the data in the model and the state of the checkbox if the user presses the left mousebutton or presses Key_Space or Key_Select and this cell is editable. Otherwise do nothing. """ if index.column()==WLTVIEWCOLS.Visible: #if not (index.flags() & Qt.ItemIsEditable) > 0: #return False # Do not change the checkbox-state if event.type() == QEvent.MouseButtonRelease or \ event.type() == QEvent.MouseButtonDblClick: if event.button() != Qt.LeftButton or \ not self.getCheckboxRect(option).contains(event.pos()): return False if event.type() == QEvent.MouseButtonDblClick: return True elif event.type() == QEvent.KeyPress: if event.key() != Qt.Key_Space and \ event.key() != Qt.Key_Select: return False else: return False # Change the checkbox-state self.setModelData(None, model, index) return True else: return False def setModelData(self, editor, model, index): """ The user wanted to change the old state in the opposite """ newValue = not bool(index.model().data(index, Qt.DisplayRole)) model.setData(index, newValue, Qt.EditRole) def getCheckboxRect(self, option): check_box_style_option = QStyleOptionButton() check_box_rect = QApplication.style().subElementRect( \ QStyle.SE_CheckBoxIndicator, check_box_style_option, None) check_box_point = QPoint( option.rect.x() + option.rect.width() / 2 - check_box_rect.width() / 2, option.rect.y() + option.rect.height() / 2 - check_box_rect.height() / 2) return QRect(check_box_point, check_box_rect.size()) def sizeHint(self, option, index): if index.column()==WLTVIEWCOLS.Visible: return QSize(28,28) return QStyledItemDelegate.sizeHint(self, option, index) ''' ################################################################################ class AllWalletsCheckboxDelegate(QStyledItemDelegate): """ Taken from http://stackoverflow.com/a/3366899/1610471 """ EYESIZE = 20 def __init__(self, parent=None): super(AllWalletsCheckboxDelegate, self).__init__(parent) ############################################################################# def paint(self, painter, option, index): bgcolor = QColor(index.model().data(index, Qt.BackgroundColorRole)) if option.state & QStyle.State_Selected: bgcolor = QApplication.palette().highlight().color() if index.column() == WLTVIEWCOLS.Visible: isVisible = index.model().data(index) image=None painter.fillRect(option.rect, bgcolor) if isVisible: image = QImage(':/visible2.png').scaled(self.EYESIZE,self.EYESIZE) pixmap = QPixmap.fromImage(image) painter.drawPixmap(option.rect, pixmap) else: QStyledItemDelegate.paint(self, painter, option, index) ############################################################################# def sizeHint(self, option, index): if index.column()==WLTVIEWCOLS.Visible: return QSize(self.EYESIZE,self.EYESIZE) return QStyledItemDelegate.sizeHint(self, option, index) ################################################################################ class LedgerDispModelSimple(QAbstractTableModel): """ Displays an Nx10 table of pre-formatted/processed ledger entries """ def __init__(self, ledgerTable, parent=None, main=None, isLboxModel=False): super(LedgerDispModelSimple, self).__init__() self.parent = parent self.main = main self.ledger = ledgerTable self.isLboxModel = isLboxModel def rowCount(self, index=QModelIndex()): return len(self.ledger) def columnCount(self, index=QModelIndex()): return 13 def data(self, index, role=Qt.DisplayRole): COL = LEDGERCOLS row,col = index.row(), index.column() rowData = self.ledger[row] nConf = rowData[LEDGERCOLS.NumConf] wltID = rowData[LEDGERCOLS.WltID] wlt = self.main.walletMap.get(wltID) if wlt: wtype = determineWalletType(self.main.walletMap[wltID], self.main)[0] else: wtype = WLTTYPES.WatchOnly #LEDGERCOLS = enum( 'NumConf', 'UnixTime','DateStr', 'TxDir', # 'WltName', 'Comment', 'Amount', 'isOther', # 'WltID', 'TxHash', 'isCoinbase', 'toSelf', # 'DoubleSpend') if role==Qt.DisplayRole: return QVariant(rowData[col]) elif role==Qt.TextAlignmentRole: if col in (COL.NumConf, COL.TxDir): return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) elif col in (COL.Comment, COL.DateStr): return QVariant(int(Qt.AlignLeft | Qt.AlignVCenter)) elif col in (COL.Amount,): return QVariant(int(Qt.AlignRight | Qt.AlignVCenter)) elif role==Qt.DecorationRole: pass elif role==Qt.BackgroundColorRole: if wtype==WLTTYPES.WatchOnly: return QVariant( Colors.TblWltOther ) elif wtype==WLTTYPES.Offline: return QVariant( Colors.TblWltOffline ) else: return QVariant( Colors.TblWltMine ) elif role==Qt.ForegroundRole: #if self.index(index.row(),COL.DoubleSpend).data().toBool(): if rowData[COL.DoubleSpend]: return QVariant(Colors.TextRed) if nConf < 2: return QVariant(Colors.TextNoConfirm) elif nConf <= 4: return QVariant(Colors.TextSomeConfirm) if col==COL.Amount: #toSelf = self.index(index.row(), COL.toSelf).data().toBool() toSelf = rowData[COL.toSelf] if toSelf: return QVariant(Colors.Mid) amt = float(rowData[COL.Amount]) if amt>0: return QVariant(Colors.TextGreen) elif amt<0: return QVariant(Colors.TextRed) else: return QVariant(Colors.Foreground) elif role==Qt.FontRole: if col==COL.Amount: f = GETFONT('Fixed') f.setWeight(QFont.Bold) return f elif role==Qt.ToolTipRole: if col in (COL.NumConf, COL.DateStr): nConf = rowData[COL.NumConf] isCB = rowData[COL.isCoinbase] isConfirmed = (nConf>119 if isCB else nConf>5) if isConfirmed: return QVariant('Transaction confirmed!\n(%d confirmations)'%nConf) else: tooltipStr = '' if isCB: tooltipStr = '%d/120 confirmations'%nConf tooltipStr += ( '\n\nThis is a "generation" transaction from\n' 'Bitcoin mining. These transactions take\n' '120 confirmations (approximately one day)\n' 'before they are available to be spent.') else: tooltipStr = '%d/6 confirmations'%rowData[COL.NumConf] tooltipStr += ( '\n\nFor small transactions, 2 or 3\n' 'confirmations is usually acceptable.\n' 'For larger transactions, you should\n' 'wait for 6 confirmations before\n' 'trusting that the transaction is valid.') return QVariant(tooltipStr) if col==COL.TxDir: #toSelf = self.index(index.row(), COL.toSelf).data().toBool() toSelf = rowData[COL.toSelf] if toSelf: return QVariant('Bitcoins sent and received by the same wallet') else: #txdir = str(index.model().data(index).toString()).strip() txdir = rowData[COL.TxDir] if rowData[COL.isCoinbase]: return QVariant('You mined these Bitcoins!') if float(txdir.strip())<0: return QVariant('Bitcoins sent') else: return QVariant('Bitcoins received') if col==COL.Amount: if self.main.settings.get('DispRmFee'): return QVariant('The net effect on the balance of this wallet ' 'not including transaction fees. ' 'You can change this behavior in the Armory ' 'preferences window.') else: return QVariant('The net effect on the balance of this wallet, ' 'including transaction fees.') return QVariant() def headerData(self, section, orientation, role=Qt.DisplayRole): COL = LEDGERCOLS if role==Qt.DisplayRole: if orientation==Qt.Horizontal: if section==COL.NumConf: return QVariant() if section==COL.DateStr: return QVariant('Date') if section==COL.WltName: return QVariant('Lockbox') if self.isLboxModel else QVariant('Wallet') if section==COL.Comment: return QVariant('Comments') if section==COL.TxDir: return QVariant() if section==COL.Amount: return QVariant('Amount') if section==COL.isOther: return QVariant('Other Owner') if section==COL.WltID: return QVariant('Wallet ID') if section==COL.TxHash: return QVariant('Tx Hash (LE)') elif role==Qt.TextAlignmentRole: return QVariant( int(Qt.AlignHCenter | Qt.AlignVCenter) ) ################################################################################ class LedgerDispSortProxy(QSortFilterProxyModel): """ Acts as a proxy that re-maps indices to the table view so that data appears sorted, without actually touching the model """ def lessThan(self, idxLeft, idxRight): COL = LEDGERCOLS thisCol = self.sortColumn() def getDouble(idx, col): return float(self.sourceModel().ledger[idx.row()][col]) def getInt(idx, col): return int(self.sourceModel().ledger[idx.row()][col]) #LEDGERCOLS = enum('NumConf', 'UnixTime', 'DateStr', 'TxDir', 'WltName', 'Comment', \ #'Amount', 'isOther', 'WltID', 'TxHash', 'toSelf', 'DoubleSpend') if thisCol==COL.NumConf: lConf = getInt(idxLeft, COL.NumConf) rConf = getInt(idxRight, COL.NumConf) if lConf==rConf: tLeft = getDouble(idxLeft, COL.UnixTime) tRight = getDouble(idxRight, COL.UnixTime) return (tLeftrConf) if thisCol==COL.DateStr: tLeft = getDouble(idxLeft, COL.UnixTime) tRight = getDouble(idxRight, COL.UnixTime) return (tLeft0) addrList = filter(hasBalance, addrList) if self.noChange: notChange = lambda a: (self.wlt.getCommentForAddress(a.getAddr160()) != CHANGE_ADDR_DESCR_STRING) addrList = filter(notChange, addrList) if self.usedOnly and TheBDM.getBDMState()=='BlockchainReady': isUsed = lambda a: (len(self.wlt.getAddrTxLedger(a.getAddr160(), 'Full')) > 0) addrList = filter(isUsed, addrList) self.addr160List = [a.getAddr160() for a in addrList] @TimeThisFunction def reset(self): self.filterAddrList() super(WalletAddrDispModel, self).reset() def rowCount(self, index=QModelIndex()): return len(self.addr160List) def columnCount(self, index=QModelIndex()): return 5 def data(self, index, role=Qt.DisplayRole): COL = ADDRESSCOLS row,col = index.row(), index.column() if row>=len(self.addr160List): return QVariant('') addr = self.wlt.addrMap[self.addr160List[row]] addr160 = addr.getAddr160() addrB58 = addr.getAddrStr() chainIdx = addr.chainIndex+1 # user must get 1-indexed if role==Qt.DisplayRole: if col==COL.Address: return QVariant( addrB58 ) if col==COL.Comment: if addr160 in self.wlt.commentsMap: return QVariant( self.wlt.commentsMap[addr160] ) else: return QVariant('') if col==COL.NumTx: cppAddr = self.wlt.cppWallet.getScrAddrObjByKey(Hash160ToScrAddr(addr160)) return QVariant( len(cppAddr.getTxLedger()) + \ len(cppAddr.getZeroConfLedger())) if col==COL.ChainIdx: if self.wlt.addrMap[addr160].chainIndex==-2: return QVariant('Imported') else: return QVariant(chainIdx) if col==COL.Balance: if not TheBDM.getBDMState()=='BlockchainReady': return QVariant('(...)') cppAddr = self.wlt.cppWallet.getScrAddrObjByKey(Hash160ToScrAddr(addr160)) return QVariant( coin2str(cppAddr.getFullBalance(), maxZeros=2) ) elif role==Qt.TextAlignmentRole: if col in (COL.Address, COL.Comment, COL.ChainIdx): return QVariant(int(Qt.AlignLeft | Qt.AlignVCenter)) elif col in (COL.NumTx,): return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) elif col in (COL.Balance,): if not TheBDM.getBDMState()=='BlockchainReady': return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) else: return QVariant(int(Qt.AlignRight | Qt.AlignVCenter)) elif role==Qt.ForegroundRole: if col==COL.Balance: if not TheBDM.getBDMState()=='BlockchainReady': return QVariant(Colors.Foreground) cppAddr = self.wlt.cppWallet.getScrAddrObjByKey(Hash160ToScrAddr(addr160)) val = cppAddr.getFullBalance() if val>0: return QVariant(Colors.TextGreen) else: return QVariant(Colors.Foreground) elif role==Qt.FontRole: hasTx = len(self.wlt.cppWallet.getScrAddrObjByKey(Hash160ToScrAddr(addr160)).getTxLedger())>0 cmt = str(self.index(index.row(),COL.Comment).data().toString()) isChange = (cmt==CHANGE_ADDR_DESCR_STRING) if col==COL.Balance: return GETFONT('Fixed',bold=hasTx) if col==COL.ChainIdx: return GETFONT('Var') else: doBold = hasTx and not isChange doItalic = isChange return GETFONT('Var',bold=doBold, italic=doItalic) elif role==Qt.ToolTipRole: if col==COL.ChainIdx: cmt = str(self.index(index.row(),COL.ChainIdx).data().toString()) if cmt.strip().lower().startswith('imp'): return QVariant('This is an imported address. Imported ' 'addresses are not protected by regular paper ' 'backups. You must use the "Backup Individual ' 'Keys" option to protect it.') else: return QVariant('The order that this address was ' 'generated in this wallet') cmt = str(self.index(index.row(),COL.Comment).data().toString()) if cmt==CHANGE_ADDR_DESCR_STRING: return QVariant('This address was created by Armory to ' 'receive change-back-to-self from an oversized ' 'transaction.') elif role==Qt.BackgroundColorRole: if not TheBDM.getBDMState()=='BlockchainReady': return QVariant( Colors.TblWltOther ) cppAddr = self.wlt.cppWallet.getScrAddrObjByKey(Hash160ToScrAddr(addr160)) val = cppAddr.getFullBalance() if val>0: return QVariant( Colors.SlightGreen ) else: return QVariant( Colors.TblWltOther ) return QVariant() def headerData(self, section, orientation, role=Qt.DisplayRole): COL = ADDRESSCOLS if role==Qt.DisplayRole: if orientation==Qt.Horizontal: if section==COL.ChainIdx: return QVariant( '#' ) if section==COL.Address: return QVariant( 'Address' ) if section==COL.Comment: return QVariant( 'Comment' ) if section==COL.NumTx: return QVariant( '#Tx' ) if section==COL.Balance: return QVariant( 'Balance' ) elif role==Qt.TextAlignmentRole: if section in (COL.Address, COL.Comment): return QVariant(int(Qt.AlignLeft | Qt.AlignVCenter)) elif section in (COL.NumTx,): return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) elif section in (COL.Balance,): return QVariant(int(Qt.AlignRight | Qt.AlignVCenter)) return QVariant() ################################################################################ class WalletAddrSortProxy(QSortFilterProxyModel): """ Acts as a proxy that re-maps indices to the table view so that data appears sorted, without actually touching the model """ def lessThan(self, idxLeft, idxRight): COL = ADDRESSCOLS thisCol = self.sortColumn() strLeft = str(self.sourceModel().data(idxLeft).toString()) strRight = str(self.sourceModel().data(idxRight).toString()) if thisCol==COL.Address: return (strLeft.lower() < strRight.lower()) elif thisCol==COL.Comment: return (strLeft < strRight) elif thisCol==COL.Balance: return (float(strLeft.strip()) < float(strRight.strip())) elif thisCol==COL.ChainIdx: left = -2 if strLeft =='Imported' else int(strLeft) rght = -2 if strRight=='Imported' else int(strRight) return (left0: # We had a BDM to help us get info on each input -- use it scrAddr,val,blk,hsh,idx,script = txinListFromBDM[i] dispInfo = self.main.getDisplayStringForScript(script, 60) addrStr = dispInfo['String'] wltID = dispInfo['WltID'] if not wltID: wltID = dispInfo['LboxID'] if not wltID: wltID = '' dispcoin = '' if not val else coin2str(val,maxZeros=1) self.dispTable[-1].append(wltID) self.dispTable[-1].append(addrStr) self.dispTable[-1].append(dispcoin) self.dispTable[-1].append(binary_to_hex(hsh)) self.dispTable[-1].append(idx) self.dispTable[-1].append(blk) if ustx is None: self.dispTable[-1].append(CPP_TXIN_SCRIPT_NAMES[scrType]) else: isSigned = ustx.ustxInputs[i].evaluateSigningStatus().allSigned self.dispTable[-1].append('Signed' if isSigned else 'Unsigned') self.dispTable[-1].append(int_to_hex(txin.intSeq, widthBytes=4)) self.dispTable[-1].append(binary_to_hex(txin.binScript)) else: # We don't have any info from the BDM, display whatever we can # (which usually isn't much) recipAddr = '' recipAddr = TxInExtractAddrStrIfAvail(txin) atype, a160 = '','' if len(recipAddr) > 0: atype, a160 = addrStr_to_hash160(recipAddr) wltID = self.main.getWalletForAddr160(a160) self.dispTable[-1].append(wltID) self.dispTable[-1].append(a160) self.dispTable[-1].append('') self.dispTable[-1].append(binary_to_hex(txin.outpoint.txHash)) self.dispTable[-1].append(str(txin.outpoint.txOutIndex)) self.dispTable[-1].append('') self.dispTable[-1].append(CPP_TXIN_SCRIPT_NAMES[scrType]) self.dispTable[-1].append(int_to_hex(txin.intSeq, widthBytes=4)) self.dispTable[-1].append(binary_to_hex(txin.binScript)) def rowCount(self, index=QModelIndex()): return len(self.dispTable) def columnCount(self, index=QModelIndex()): return 10 #TXINCOLS = enum('WltID', 'Sender', 'Btc', 'OutPt', 'OutIdx', 'FromBlk', 'ScrType', 'Sequence', 'Script') def data(self, index, role=Qt.DisplayRole): COLS = TXINCOLS row,col = index.row(), index.column() wltID = self.dispTable[row][COLS.WltID] if role==Qt.DisplayRole: return QVariant(self.dispTable[row][col]) elif role==Qt.TextAlignmentRole: if col in (COLS.WltID, COLS.Sender, COLS.OutPt): return QVariant(int(Qt.AlignLeft | Qt.AlignVCenter)) elif col in (COLS.OutIdx, COLS.FromBlk, COLS.Sequence, COLS.ScrType): return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) elif col in (COLS.Btc,): return QVariant(int(Qt.AlignRight | Qt.AlignVCenter)) elif role==Qt.BackgroundColorRole: if self.dispTable[row][COLS.WltID] and wltID in self.main.walletMap: wtype = determineWalletType(self.main.walletMap[wltID], self.main)[0] if wtype==WLTTYPES.WatchOnly: return QVariant( Colors.TblWltOther ) elif wtype==WLTTYPES.Offline: return QVariant( Colors.TblWltOffline ) else: return QVariant( Colors.TblWltMine ) elif role==Qt.FontRole: if col==COLS.Btc: return GETFONT('Fixed') return QVariant() def headerData(self, section, orientation, role=Qt.DisplayRole): COLS = TXINCOLS if role==Qt.DisplayRole: if orientation==Qt.Horizontal: if section==COLS.WltID: return QVariant('Wallet ID') if section==COLS.Sender: return QVariant('Sender') if section==COLS.Btc: return QVariant('Amount') if section==COLS.OutPt: return QVariant('Prev. Tx Hash') if section==COLS.OutIdx: return QVariant('Index') if section==COLS.FromBlk: return QVariant('From Block#') if section==COLS.ScrType: return QVariant('Script Type') if section==COLS.Sequence: return QVariant('Sequence') if section==COLS.Script: return QVariant('Script') elif role==Qt.TextAlignmentRole: if orientation==Qt.Horizontal: if section in (COLS.WltID, COLS.Sender, COLS.OutPt): return QVariant(int(Qt.AlignLeft | Qt.AlignVCenter)) elif section in (COLS.OutIdx, COLS.FromBlk, COLS.Btc, COLS.Sequence, COLS.ScrType): return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) ################################################################################ class TxOutDispModel(QAbstractTableModel): def __init__(self, pytx, main=None, idxGray=[]): super(TxOutDispModel, self).__init__() self.tx = pytx.copy() self.main = main self.txOutList = [] self.wltIDList = [] self.idxGray = idxGray[:] for i,txout in enumerate(self.tx.outputs): self.txOutList.append(txout) def rowCount(self, index=QModelIndex()): return len(self.txOutList) def columnCount(self, index=QModelIndex()): return 6 #TXOUTCOLS = enum('WltID', 'Recip', 'Btc', 'ScrType') def data(self, index, role=Qt.DisplayRole): COLS = TXOUTCOLS row,col = index.row(), index.column() txout = self.txOutList[row] dispInfo = self.main.getDisplayStringForScript(txout.binScript, 60) wltID = '' if dispInfo['WltID']: wltID = dispInfo['WltID'] elif dispInfo['LboxID']: wltID = dispInfo['LboxID'] stype = BtcUtils().getTxOutScriptTypeInt(txout.binScript) stypeStr = CPP_TXOUT_SCRIPT_NAMES[stype] if stype==CPP_TXOUT_MULTISIG: M,N = getMultisigScriptInfo(txout.binScript)[:2] stypeStr = 'MultiSig[%d-of-%d]' % (M,N) if role==Qt.DisplayRole: if col==COLS.WltID: return QVariant(wltID) if col==COLS.ScrType: return QVariant(stypeStr) if col==COLS.Script: return QVariant(binary_to_hex(txout.binScript)) if col==COLS.Btc: return QVariant(coin2str(txout.getValue(),maxZeros=2)) if col==COLS.Recip: return QVariant(dispInfo['String']) if col==COLS.AddrStr: return QVariant(dispInfo['AddrStr']) elif role==Qt.TextAlignmentRole: if col==COLS.Recip: return QVariant(int(Qt.AlignLeft | Qt.AlignVCenter)) if col==COLS.Btc: return QVariant(int(Qt.AlignRight | Qt.AlignVCenter)) if col==COLS.ScrType: return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) elif role==Qt.ForegroundRole: if row in self.idxGray: return QVariant(Colors.Mid) elif role==Qt.BackgroundColorRole: if wltID and wltID in self.main.walletMap: wtype = determineWalletType(self.main.walletMap[wltID], self.main)[0] if wtype==WLTTYPES.WatchOnly: return QVariant( Colors.TblWltOther ) if wtype==WLTTYPES.Offline: return QVariant( Colors.TblWltOffline ) else: return QVariant( Colors.TblWltMine ) elif role==Qt.FontRole: if col==COLS.Btc: return GETFONT('Fixed') return QVariant() def headerData(self, section, orientation, role=Qt.DisplayRole): COLS = TXOUTCOLS if role==Qt.DisplayRole: if orientation==Qt.Horizontal: if section==COLS.WltID: return QVariant('Wallet ID') if section==COLS.Recip: return QVariant('Recipient') if section==COLS.Btc: return QVariant('Amount') if section==COLS.ScrType: return QVariant('Script Type') elif role==Qt.TextAlignmentRole: if orientation==Qt.Horizontal: if section==COLS.WltID: return QVariant(Qt.AlignLeft | Qt.AlignVCenter) if section==COLS.Recip: return QVariant(Qt.AlignLeft | Qt.AlignVCenter) if section==COLS.Btc: return QVariant(Qt.AlignHCenter | Qt.AlignVCenter) if section==COLS.ScrType: return QVariant(Qt.AlignHCenter | Qt.AlignVCenter) return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) ################################################################################ class SentToAddrBookModel(QAbstractTableModel): def __init__(self, wltID, main): super(SentToAddrBookModel, self).__init__() self.wltID = wltID self.main = main self.wlt = self.main.walletMap[wltID] self.addrBook = [] # SWIG BUG! # http://sourceforge.net/tracker/?func=detail&atid=101645&aid=3403085&group_id=1645 # Must use awkwardness to get around iterating a vector in # the python code... :( for abe in TheBDM.getAddressBook(self.wlt.cppWallet): scrAddr = abe.getScrAddr() try: addr160 = addrStr_to_hash160(scrAddr_to_addrStr(scrAddr))[1] # Only grab addresses that are not in any of your Armory wallets if not self.main.getWalletForAddr160(addr160): abeList = abe.getTxList() ntx = len(abeList) txhashlist = [] for i in range(ntx): txhashlist.append( abeList[i].getTxHash() ) self.addrBook.append( [scrAddr, txhashlist] ) except Exception as e: # This is not necessarily an error. It could be a lock box LOGERROR(str(e)) pass def rowCount(self, index=QModelIndex()): return len(self.addrBook) def columnCount(self, index=QModelIndex()): return 4 def data(self, index, role=Qt.DisplayRole): COL = ADDRBOOKCOLS row,col = index.row(), index.column() scrAddr = self.addrBook[row][0] if scrAddr[0] in [SCRADDR_P2PKH_BYTE, SCRADDR_P2SH_BYTE]: addrB58 = scrAddr_to_addrStr(scrAddr) addr160 = scrAddr[1:] else: addrB58 = '' addr160 = '' wltID = self.main.getWalletForAddr160(addr160) txList = self.addrBook[row][1] numSent = len(txList) comment = self.wlt.getCommentForTxList(addr160, txList) #ADDRBOOKCOLS = enum('Address', 'WltID', 'NumSent', 'Comment') if role==Qt.DisplayRole: if col==COL.Address: return QVariant( addrB58 ) if col==COL.NumSent: return QVariant( numSent ) if col==COL.Comment: return QVariant( comment ) if col==COL.WltID: return QVariant( wltID ) elif role==Qt.TextAlignmentRole: if col in (COL.Address, COL.Comment, COL.WltID): return QVariant(int(Qt.AlignLeft | Qt.AlignVCenter)) elif col in (COL.NumSent,): return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) elif role==Qt.FontRole: isFreqAddr = (numSent>1) return GETFONT('Var', bold=isFreqAddr) return QVariant() def headerData(self, section, orientation, role=Qt.DisplayRole): COL = ADDRBOOKCOLS if role==Qt.DisplayRole: if orientation==Qt.Horizontal: if section==COL.Address: return QVariant( 'Address' ) if section==COL.WltID: return QVariant( 'Ownership' ) if section==COL.NumSent: return QVariant( 'Times Used' ) if section==COL.Comment: return QVariant( 'Comment' ) elif role==Qt.TextAlignmentRole: if section in (COL.Address, COL.Comment, COL.WltID): return QVariant(int(Qt.AlignLeft | Qt.AlignVCenter)) elif section in (COL.NumSent,): return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) return QVariant() ################################################################################ class SentAddrSortProxy(QSortFilterProxyModel): def lessThan(self, idxLeft, idxRight): COL = ADDRBOOKCOLS thisCol = self.sortColumn() strLeft = str(self.sourceModel().data(idxLeft).toString()) strRight = str(self.sourceModel().data(idxRight).toString()) #ADDRBOOKCOLS = enum('Address', 'WltID', 'NumSent', 'Comment') if thisCol==COL.Address: return (strLeft.lower() < strRight.lower()) else: return super(SentAddrSortProxy, self).lessThan(idxLeft, idxRight) ################################################################################ class PromissoryCollectModel(QAbstractTableModel): # The columns enumeration def __init__(self, main, promNoteList): super(PromissoryCollectModel, self).__init__() self.main = main self.promNoteList = promNoteList def rowCount(self, index=QModelIndex()): return len(self.promNoteList) def columnCount(self, index=QModelIndex()): return 4 def data(self, index, role=Qt.DisplayRole): COL = PROMCOLS row,col = index.row(), index.column() prom = self.promNoteList[row] #PROMCOLS = enum('PromID', 'Label', 'PayAmt', 'FeeAmt') if role==Qt.DisplayRole: if col==COL.PromID: return QVariant(prom.promID) elif col==COL.Label: return QVariant(prom.promLabel) elif col==COL.PayAmt: return QVariant(coin2str(prom.dtxoTarget.value, maxZeros=2)) elif col==COL.FeeAmt: return QVariant(coin2str(prom.feeAmt, maxZeros=2)) elif role==Qt.TextAlignmentRole: if col in [COL.PromID, COL.Label]: return QVariant(int(Qt.AlignHCenter | Qt.AlignVCenter)) else: return QVariant(int(Qt.AlignLeft | Qt.AlignVCenter)) elif role==Qt.ForegroundRole: if col == COL.PayAmt: if prom.dtxoTarget.value>0: return QVariant(Colors.TextGreen) elif col == COL.FeeAmt: if prom.feeAmt>0: return QVariant(Colors.TextGreen) elif role==Qt.FontRole: if col in [COL.PayAmt, COL.FeeAmt]: return GETFONT('Fixed') return QVariant() def headerData(self, section, orientation, role=Qt.DisplayRole): colLabels = ['Note ID', 'Label', 'Funding', 'Fee'] if role==Qt.DisplayRole: if orientation==Qt.Horizontal: return QVariant(colLabels[section]) elif role==Qt.TextAlignmentRole: return QVariant( int(Qt.AlignHCenter | Qt.AlignVCenter) ) armory-0.92.3/BitTornado/0000755000000000000000000000000012414772654013675 5ustar rootrootarmory-0.92.3/BitTornado/selectpoll.py0000644000000000000000000000461612414772654016424 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from select import select, error from time import sleep from types import IntType from bisect import bisect POLLIN = 1 POLLOUT = 2 POLLERR = 8 POLLHUP = 16 class poll: def __init__(self): self.rlist = [] self.wlist = [] def register(self, f, t): if type(f) != IntType: f = f.fileno() if (t & POLLIN): insert(self.rlist, f) else: remove(self.rlist, f) if (t & POLLOUT): insert(self.wlist, f) else: remove(self.wlist, f) def unregister(self, f): if type(f) != IntType: f = f.fileno() remove(self.rlist, f) remove(self.wlist, f) def poll(self, timeout = None): if self.rlist or self.wlist: try: r, w, e = select(self.rlist, self.wlist, [], timeout) except ValueError: return None else: sleep(timeout) return [] result = [] for s in r: result.append((s, POLLIN)) for s in w: result.append((s, POLLOUT)) return result def remove(list, item): i = bisect(list, item) if i > 0 and list[i-1] == item: del list[i-1] def insert(list, item): i = bisect(list, item) if i == 0 or list[i-1] != item: list.insert(i, item) def test_remove(): x = [2, 4, 6] remove(x, 2) assert x == [4, 6] x = [2, 4, 6] remove(x, 4) assert x == [2, 6] x = [2, 4, 6] remove(x, 6) assert x == [2, 4] x = [2, 4, 6] remove(x, 5) assert x == [2, 4, 6] x = [2, 4, 6] remove(x, 1) assert x == [2, 4, 6] x = [2, 4, 6] remove(x, 7) assert x == [2, 4, 6] x = [2, 4, 6] remove(x, 5) assert x == [2, 4, 6] x = [] remove(x, 3) assert x == [] def test_insert(): x = [2, 4] insert(x, 1) assert x == [1, 2, 4] x = [2, 4] insert(x, 3) assert x == [2, 3, 4] x = [2, 4] insert(x, 5) assert x == [2, 4, 5] x = [2, 4] insert(x, 2) assert x == [2, 4] x = [2, 4] insert(x, 4) assert x == [2, 4] x = [2, 3, 4] insert(x, 3) assert x == [2, 3, 4] x = [] insert(x, 3) assert x == [3] armory-0.92.3/BitTornado/torrentlistparse.py0000644000000000000000000000157212414772654017700 0ustar rootroot# Written by John Hoffman # see LICENSE.txt for license information from binascii import unhexlify try: True except: True = 1 False = 0 # parses a list of torrent hashes, in the format of one hash per line in hex format def parsetorrentlist(filename, parsed): new_parsed = {} added = {} removed = parsed f = open(filename, 'r') while True: l = f.readline() if not l: break l = l.strip() try: if len(l) != 40: raise ValueError, 'bad line' h = unhexlify(l) except: print '*** WARNING *** could not parse line in torrent list: '+l if parsed.has_key(h): del removed[h] else: added[h] = True new_parsed[h] = True f.close() return (new_parsed, added, removed) armory-0.92.3/BitTornado/download_bt1.py0000644000000000000000000010313212414772654016624 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from zurllib import urlopen from urlparse import urlparse from BT1.btformats import check_message from BT1.Choker import Choker from BT1.Storage import Storage from BT1.StorageWrapper import StorageWrapper from BT1.FileSelector import FileSelector from BT1.Uploader import Upload from BT1.Downloader import Downloader from BT1.HTTPDownloader import HTTPDownloader from BT1.Connecter import Connecter from RateLimiter import RateLimiter from BT1.Encrypter import Encoder from RawServer import RawServer, autodetect_ipv6, autodetect_socket_style from BT1.Rerequester import Rerequester from BT1.DownloaderFeedback import DownloaderFeedback from RateMeasure import RateMeasure from CurrentRateMeasure import Measure from BT1.PiecePicker import PiecePicker from BT1.Statistics import Statistics from ConfigDir import ConfigDir from bencode import bencode, bdecode from natpunch import UPnP_test from sha import sha from os import path, makedirs, listdir from parseargs import parseargs, formatDefinitions, defaultargs from socket import error as socketerror from random import seed from threading import Thread, Event from clock import clock from __init__ import createPeerID try: True except: True = 1 False = 0 defaults = [ ('max_uploads', 0, "the maximum number of uploads to allow at once."), ('keepalive_interval', 120.0, 'number of seconds to pause between sending keepalives'), ('download_slice_size', 2 ** 14, "How many bytes to query for per request."), ('upload_unit_size', 1460, "when limiting upload rate, how many bytes to send at a time"), ('request_backlog', 10, "maximum number of requests to keep in a single pipe at once."), ('max_message_length', 2 ** 23, "maximum length prefix encoding you'll accept over the wire - larger values get the connection dropped."), ('ip', '', "ip to report you have to the tracker."), ('minport', 10000, 'minimum port to listen on, counts up if unavailable'), ('maxport', 60000, 'maximum port to listen on'), ('random_port', 1, 'whether to choose randomly inside the port range ' + 'instead of counting up linearly'), ('responsefile', '', 'file the server response was stored in, alternative to url'), ('url', '', 'url to get file from, alternative to responsefile'), ('selector_enabled', 1, 'whether to enable the file selector and fast resume function'), ('expire_cache_data', 10, 'the number of days after which you wish to expire old cache data ' + '(0 = disabled)'), ('priority', '', 'a list of file priorities separated by commas, must be one per file, ' + '0 = highest, 1 = normal, 2 = lowest, -1 = download disabled'), ('saveas', '', 'local file name to save the file as, null indicates query user'), ('timeout', 300.0, 'time to wait between closing sockets which nothing has been received on'), ('timeout_check_interval', 60.0, 'time to wait between checking if any connections have timed out'), ('max_slice_length', 2 ** 17, "maximum length slice to send to peers, larger requests are ignored"), ('max_rate_period', 20.0, "maximum amount of time to guess the current rate estimate represents"), ('bind', '', 'comma-separated list of ips/hostnames to bind to locally'), # ('ipv6_enabled', autodetect_ipv6(), ('ipv6_enabled', 0, 'allow the client to connect to peers via IPv6'), ('ipv6_binds_v4', autodetect_socket_style(), "set if an IPv6 server socket won't also field IPv4 connections"), ('upnp_nat_access', 1, 'attempt to autoconfigure a UPnP router to forward a server port ' + '(0 = disabled, 1 = mode 1 [fast], 2 = mode 2 [slow])'), ('upload_rate_fudge', 5.0, 'time equivalent of writing to kernel-level TCP buffer, for rate adjustment'), ('tcp_ack_fudge', 0.03, 'how much TCP ACK download overhead to add to upload rate calculations ' + '(0 = disabled)'), ('display_interval', .5, 'time between updates of displayed information'), ('rerequest_interval', 5 * 60, 'time to wait between requesting more peers'), ('min_peers', 20, 'minimum number of peers to not do rerequesting'), ('http_timeout', 60, 'number of seconds to wait before assuming that an http connection has timed out'), ('max_initiate', 40, 'number of peers at which to stop initiating new connections'), ('check_hashes', 1, 'whether to check hashes on disk'), ('max_upload_rate', 0, 'maximum kB/s to upload at (0 = no limit, -1 = automatic)'), ('max_download_rate', 0, 'maximum kB/s to download at (0 = no limit)'), ('alloc_type', 'normal', 'allocation type (may be normal, background, pre-allocate or sparse)'), ('alloc_rate', 2.0, 'rate (in MiB/s) to allocate space at using background allocation'), ('buffer_reads', 1, 'whether to buffer disk reads'), ('write_buffer_size', 4, 'the maximum amount of space to use for buffering disk writes ' + '(in megabytes, 0 = disabled)'), ('breakup_seed_bitfield', 1, 'sends an incomplete bitfield and then fills with have messages, ' 'in order to get around stupid ISP manipulation'), ('snub_time', 30.0, "seconds to wait for data to come in over a connection before assuming it's semi-permanently choked"), ('spew', 0, "whether to display diagnostic info to stdout"), ('rarest_first_cutoff', 2, "number of downloads at which to switch from random to rarest first"), ('rarest_first_priority_cutoff', 5, 'the number of peers which need to have a piece before other partials take priority over rarest first'), ('min_uploads', 4, "the number of uploads to fill out to with extra optimistic unchokes"), ('max_files_open', 20, 'the maximum number of files to keep open at a time, 0 means no limit'), ('round_robin_period', 30, "the number of seconds between the client's switching upload targets"), ('super_seeder', 0, "whether to use special upload-efficiency-maximizing routines (only for dedicated seeds)"), ('security', 1, "whether to enable extra security features intended to prevent abuse"), ('max_connections', 50, "the absolute maximum number of peers to connect with (0 = no limit)"), ('auto_kick', 1, "whether to allow the client to automatically kick/ban peers that send bad data"), ('double_check', 1, "whether to double-check data being written to the disk for errors (may increase CPU load)"), ('triple_check', 0, "whether to thoroughly check data being written to the disk (may slow disk access)"), ('lock_files', 1, "whether to lock files the client is working with"), ('lock_while_reading', 0, "whether to lock access to files being read"), ('auto_flush', 0, "minutes between automatic flushes to disk (0 = disabled)"), ('dedicated_seed_id', '', "code to send to tracker identifying as a dedicated seed"), ] argslistheader = 'Arguments are:\n\n' def _failfunc(x): print x # old-style downloader def download(params, filefunc, statusfunc, finfunc, errorfunc, doneflag, cols, pathFunc = None, presets = {}, exchandler = None, failed = _failfunc, paramfunc = None): try: config = parse_params(params, presets) except ValueError, e: failed('error: ' + str(e) + '\nrun with no args for parameter explanations') return if not config: errorfunc(get_usage()) return myid = createPeerID() seed(myid) rawserver = RawServer(doneflag, config['timeout_check_interval'], config['timeout'], ipv6_enable = config['ipv6_enabled'], failfunc = failed, errorfunc = exchandler) upnp_type = UPnP_test(config['upnp_nat_access']) try: listen_port = rawserver.find_and_bind(config['minport'], config['maxport'], config['bind'], ipv6_socket_style = config['ipv6_binds_v4'], upnp = upnp_type, randomizer = config['random_port']) except socketerror, e: failed("Couldn't listen - " + str(e)) return response = get_response(config['responsefile'], config['url'], failed) if not response: return infohash = sha(bencode(response['info'])).digest() d = BT1Download(statusfunc, finfunc, errorfunc, exchandler, doneflag, config, response, infohash, myid, rawserver, listen_port) if not d.saveAs(filefunc): return if pathFunc: pathFunc(d.getFilename()) hashcheck = d.initFiles(old_style = True) if not hashcheck: return if not hashcheck(): return if not d.startEngine(): return d.startRerequester() d.autoStats() statusfunc(activity = 'connecting to peers') if paramfunc: paramfunc({ 'max_upload_rate' : d.setUploadRate, # change_max_upload_rate() 'max_uploads': d.setConns, # change_max_uploads() 'listen_port' : listen_port, # int 'peer_id' : myid, # string 'info_hash' : infohash, # string 'start_connection' : d._startConnection, # start_connection((, ), ) }) rawserver.listen_forever(d.getPortHandler()) d.shutdown() def parse_params(params, presets = {}): config, args = parseargs(params, defaults, 0, 1, presets = presets) if args: if config['responsefile'] or config['url']: raise ValueError,'must have responsefile or url as arg or parameter, not both' if path.isfile(args[0]): config['responsefile'] = args[0] else: try: urlparse(args[0]) except: raise ValueError, 'bad filename or url' config['url'] = args[0] elif (config['responsefile'] == '') == (config['url'] == ''): raise ValueError, 'need responsefile or url, must have one, cannot have both' return config def get_usage(defaults = defaults, cols = 100, presets = {}): return (argslistheader + formatDefinitions(defaults, cols, presets)) def get_response(file, url, errorfunc): try: if file: h = open(file, 'rb') try: line = h.read(10) # quick test to see if responsefile contains a dict front,garbage = line.split(':',1) assert front[0] == 'd' int(front[1:]) except: errorfunc(file+' is not a valid responsefile') return None try: h.seek(0) except: try: h.close() except: pass h = open(file, 'rb') else: try: h = urlopen(url) except: errorfunc(url+' bad url') return None response = h.read() except IOError, e: errorfunc('problem getting response info - ' + str(e)) return None try: h.close() except: pass try: try: response = bdecode(response) except: errorfunc("warning: bad data in responsefile") response = bdecode(response, sloppy=1) check_message(response) except ValueError, e: errorfunc("got bad file info - " + str(e)) return None return response class BT1Download: def __init__(self, statusfunc, finfunc, errorfunc, excfunc, doneflag, config, response, infohash, id, rawserver, port, appdataobj = None): self.statusfunc = statusfunc self.finfunc = finfunc self.errorfunc = errorfunc self.excfunc = excfunc self.doneflag = doneflag self.config = config self.response = response self.infohash = infohash self.myid = id self.rawserver = rawserver self.port = port self.info = self.response['info'] self.pieces = [self.info['pieces'][x:x+20] for x in xrange(0, len(self.info['pieces']), 20)] self.len_pieces = len(self.pieces) self.argslistheader = argslistheader self.unpauseflag = Event() self.unpauseflag.set() self.downloader = None self.storagewrapper = None self.fileselector = None self.super_seeding_active = False self.filedatflag = Event() self.spewflag = Event() self.superseedflag = Event() self.whenpaused = None self.finflag = Event() self.rerequest = None self.tcp_ack_fudge = config['tcp_ack_fudge'] self.selector_enabled = config['selector_enabled'] if appdataobj: self.appdataobj = appdataobj elif self.selector_enabled: self.appdataobj = ConfigDir() self.appdataobj.deleteOldCacheData( config['expire_cache_data'], [self.infohash] ) self.excflag = self.rawserver.get_exception_flag() self.failed = False self.checking = False self.started = False self.picker = PiecePicker(self.len_pieces, config['rarest_first_cutoff'], config['rarest_first_priority_cutoff']) self.choker = Choker(config, rawserver.add_task, self.picker, self.finflag.isSet) def checkSaveLocation(self, loc): if self.info.has_key('length'): return path.exists(loc) for x in self.info['files']: if path.exists(path.join(loc, x['path'][0])): return True return False def saveAs(self, filefunc, pathfunc = None): try: def make(f, forcedir = False): if not forcedir: f = path.split(f)[0] if f != '' and not path.exists(f): makedirs(f) if self.info.has_key('length'): file_length = self.info['length'] file = filefunc(self.info['name'], file_length, self.config['saveas'], False) if file is None: return None make(file) files = [(file, file_length)] else: file_length = 0L for x in self.info['files']: file_length += x['length'] file = filefunc(self.info['name'], file_length, self.config['saveas'], True) if file is None: return None # if this path exists, and no files from the info dict exist, we assume it's a new download and # the user wants to create a new directory with the default name existing = 0 if path.exists(file): if not path.isdir(file): self.errorfunc(file + 'is not a dir') return None if len(listdir(file)) > 0: # if it's not empty for x in self.info['files']: if path.exists(path.join(file, x['path'][0])): existing = 1 if not existing: file = path.join(file, self.info['name']) if path.exists(file) and not path.isdir(file): if file[-8:] == '.torrent': file = file[:-8] if path.exists(file) and not path.isdir(file): self.errorfunc("Can't create dir - " + self.info['name']) return None make(file, True) # alert the UI to any possible change in path if pathfunc != None: pathfunc(file) files = [] for x in self.info['files']: n = file for i in x['path']: n = path.join(n, i) files.append((n, x['length'])) make(n) except OSError, e: self.errorfunc("Couldn't allocate dir - " + str(e)) return None self.filename = file self.files = files self.datalength = file_length return file def getFilename(self): return self.filename def _finished(self): self.finflag.set() try: self.storage.set_readonly() except (IOError, OSError), e: self.errorfunc('trouble setting readonly at end - ' + str(e)) if self.superseedflag.isSet(): self._set_super_seed() self.choker.set_round_robin_period( max( self.config['round_robin_period'], self.config['round_robin_period'] * self.info['piece length'] / 200000 ) ) self.rerequest_complete() self.finfunc() def _data_flunked(self, amount, index): self.ratemeasure_datarejected(amount) if not self.doneflag.isSet(): self.errorfunc('piece %d failed hash check, re-downloading it' % index) def _failed(self, reason): self.failed = True self.doneflag.set() if reason is not None: self.errorfunc(reason) def initFiles(self, old_style = False, statusfunc = None): if self.doneflag.isSet(): return None if not statusfunc: statusfunc = self.statusfunc disabled_files = None if self.selector_enabled: self.priority = self.config['priority'] if self.priority: try: self.priority = self.priority.split(',') assert len(self.priority) == len(self.files) self.priority = [int(p) for p in self.priority] for p in self.priority: assert p >= -1 assert p <= 2 except: self.errorfunc('bad priority list given, ignored') self.priority = None data = self.appdataobj.getTorrentData(self.infohash) try: d = data['resume data']['priority'] assert len(d) == len(self.files) disabled_files = [x == -1 for x in d] except: try: disabled_files = [x == -1 for x in self.priority] except: pass try: try: self.storage = Storage(self.files, self.info['piece length'], self.doneflag, self.config, disabled_files) except IOError, e: self.errorfunc('trouble accessing files - ' + str(e)) return None if self.doneflag.isSet(): return None self.storagewrapper = StorageWrapper(self.storage, self.config['download_slice_size'], self.pieces, self.info['piece length'], self._finished, self._failed, statusfunc, self.doneflag, self.config['check_hashes'], self._data_flunked, self.rawserver.add_task, self.config, self.unpauseflag) except ValueError, e: self._failed('bad data - ' + str(e)) except IOError, e: self._failed('IOError - ' + str(e)) if self.doneflag.isSet(): return None if self.selector_enabled: self.fileselector = FileSelector(self.files, self.info['piece length'], self.appdataobj.getPieceDir(self.infohash), self.storage, self.storagewrapper, self.rawserver.add_task, self._failed) if data: data = data.get('resume data') if data: self.fileselector.unpickle(data) self.checking = True if old_style: return self.storagewrapper.old_style_init() return self.storagewrapper.initialize def getCachedTorrentData(self): return self.appdataobj.getTorrentData(self.infohash) def _make_upload(self, connection, ratelimiter, totalup): return Upload(connection, ratelimiter, totalup, self.choker, self.storagewrapper, self.picker, self.config) def _kick_peer(self, connection): def k(connection = connection): connection.close() self.rawserver.add_task(k,0) def _ban_peer(self, ip): self.encoder_ban(ip) def _received_raw_data(self, x): if self.tcp_ack_fudge: x = int(x*self.tcp_ack_fudge) self.ratelimiter.adjust_sent(x) # self.upmeasure.update_rate(x) def _received_data(self, x): self.downmeasure.update_rate(x) self.ratemeasure.data_came_in(x) def _received_http_data(self, x): self.downmeasure.update_rate(x) self.ratemeasure.data_came_in(x) self.downloader.external_data_received(x) def _cancelfunc(self, pieces): self.downloader.cancel_piece_download(pieces) self.httpdownloader.cancel_piece_download(pieces) def _reqmorefunc(self, pieces): self.downloader.requeue_piece_download(pieces) def startEngine(self, ratelimiter = None, statusfunc = None): if self.doneflag.isSet(): return False if not statusfunc: statusfunc = self.statusfunc self.checking = False for i in xrange(self.len_pieces): if self.storagewrapper.do_I_have(i): self.picker.complete(i) self.upmeasure = Measure(self.config['max_rate_period'], self.config['upload_rate_fudge']) self.downmeasure = Measure(self.config['max_rate_period']) if ratelimiter: self.ratelimiter = ratelimiter else: self.ratelimiter = RateLimiter(self.rawserver.add_task, self.config['upload_unit_size'], self.setConns) self.ratelimiter.set_upload_rate(self.config['max_upload_rate']) self.ratemeasure = RateMeasure() self.ratemeasure_datarejected = self.ratemeasure.data_rejected self.downloader = Downloader(self.storagewrapper, self.picker, self.config['request_backlog'], self.config['max_rate_period'], self.len_pieces, self.config['download_slice_size'], self._received_data, self.config['snub_time'], self.config['auto_kick'], self._kick_peer, self._ban_peer) self.downloader.set_download_rate(self.config['max_download_rate']) self.connecter = Connecter(self._make_upload, self.downloader, self.choker, self.len_pieces, self.upmeasure, self.config, self.ratelimiter, self.rawserver.add_task) self.encoder = Encoder(self.connecter, self.rawserver, self.myid, self.config['max_message_length'], self.rawserver.add_task, self.config['keepalive_interval'], self.infohash, self._received_raw_data, self.config) self.encoder_ban = self.encoder.ban self.httpdownloader = HTTPDownloader(self.storagewrapper, self.picker, self.rawserver, self.finflag, self.errorfunc, self.downloader, self.config['max_rate_period'], self.infohash, self._received_http_data, self.connecter.got_piece) if self.response.has_key('httpseeds') and not self.finflag.isSet(): for u in self.response['httpseeds']: self.httpdownloader.make_download(u) if self.selector_enabled: self.fileselector.tie_in(self.picker, self._cancelfunc, self._reqmorefunc, self.rerequest_ondownloadmore) if self.priority: self.fileselector.set_priorities_now(self.priority) self.appdataobj.deleteTorrentData(self.infohash) # erase old data once you've started modifying it if self.config['super_seeder']: self.set_super_seed() self.started = True return True def rerequest_complete(self): if self.rerequest: self.rerequest.announce(1) def rerequest_stopped(self): if self.rerequest: self.rerequest.announce(2) def rerequest_lastfailed(self): if self.rerequest: return self.rerequest.last_failed return False def rerequest_ondownloadmore(self): if self.rerequest: self.rerequest.hit() def startRerequester(self, seededfunc = None, force_rapid_update = False): if self.response.has_key('announce-list'): trackerlist = self.response['announce-list'] else: trackerlist = [[self.response['announce']]] self.rerequest = Rerequester(trackerlist, self.config['rerequest_interval'], self.rawserver.add_task, self.connecter.how_many_connections, self.config['min_peers'], self.encoder.start_connections, self.rawserver.add_task, self.storagewrapper.get_amount_left, self.upmeasure.get_total, self.downmeasure.get_total, self.port, self.config['ip'], self.myid, self.infohash, self.config['http_timeout'], self.errorfunc, self.excfunc, self.config['max_initiate'], self.doneflag, self.upmeasure.get_rate, self.downmeasure.get_rate, self.unpauseflag, self.config['dedicated_seed_id'], seededfunc, force_rapid_update ) self.rerequest.start() def _init_stats(self): self.statistics = Statistics(self.upmeasure, self.downmeasure, self.connecter, self.httpdownloader, self.ratelimiter, self.rerequest_lastfailed, self.filedatflag) if self.info.has_key('files'): self.statistics.set_dirstats(self.files, self.info['piece length']) if self.config['spew']: self.spewflag.set() def autoStats(self, displayfunc = None): if not displayfunc: displayfunc = self.statusfunc self._init_stats() DownloaderFeedback(self.choker, self.httpdownloader, self.rawserver.add_task, self.upmeasure.get_rate, self.downmeasure.get_rate, self.ratemeasure, self.storagewrapper.get_stats, self.datalength, self.finflag, self.spewflag, self.statistics, displayfunc, self.config['display_interval']) def startStats(self): self._init_stats() d = DownloaderFeedback(self.choker, self.httpdownloader, self.rawserver.add_task, self.upmeasure.get_rate, self.downmeasure.get_rate, self.ratemeasure, self.storagewrapper.get_stats, self.datalength, self.finflag, self.spewflag, self.statistics) return d.gather def getPortHandler(self): return self.encoder def shutdown(self, torrentdata = {}): if self.checking or self.started: self.storagewrapper.sync() self.storage.close() self.rerequest_stopped() if self.fileselector and self.started: if not self.failed: self.fileselector.finish() torrentdata['resume data'] = self.fileselector.pickle() try: self.appdataobj.writeTorrentData(self.infohash,torrentdata) except: self.appdataobj.deleteTorrentData(self.infohash) # clear it return not self.failed and not self.excflag.isSet() # if returns false, you may wish to auto-restart the torrent def setUploadRate(self, rate): try: def s(self = self, rate = rate): self.config['max_upload_rate'] = rate self.ratelimiter.set_upload_rate(rate) self.rawserver.add_task(s) except AttributeError: pass def setConns(self, conns, conns2 = None): if not conns2: conns2 = conns try: def s(self = self, conns = conns, conns2 = conns2): self.config['min_uploads'] = conns self.config['max_uploads'] = conns2 if (conns > 30): self.config['max_initiate'] = conns + 10 self.rawserver.add_task(s) except AttributeError: pass def setDownloadRate(self, rate): try: def s(self = self, rate = rate): self.config['max_download_rate'] = rate self.downloader.set_download_rate(rate) self.rawserver.add_task(s) except AttributeError: pass def startConnection(self, ip, port, id): self.encoder._start_connection((ip, port), id) def _startConnection(self, ipandport, id): self.encoder._start_connection(ipandport, id) def setInitiate(self, initiate): try: def s(self = self, initiate = initiate): self.config['max_initiate'] = initiate self.rawserver.add_task(s) except AttributeError: pass def getConfig(self): return self.config def getDefaults(self): return defaultargs(defaults) def getUsageText(self): return self.argslistheader def reannounce(self, special = None): try: def r(self = self, special = special): if special is None: self.rerequest.announce() else: self.rerequest.announce(specialurl = special) self.rawserver.add_task(r) except AttributeError: pass def getResponse(self): try: return self.response except: return None # def Pause(self): # try: # if self.storagewrapper: # self.rawserver.add_task(self._pausemaker, 0) # except: # return False # self.unpauseflag.clear() # return True # # def _pausemaker(self): # self.whenpaused = clock() # self.unpauseflag.wait() # sticks a monkey wrench in the main thread # # def Unpause(self): # self.unpauseflag.set() # if self.whenpaused and clock()-self.whenpaused > 60: # def r(self = self): # self.rerequest.announce(3) # rerequest automatically if paused for >60 seconds # self.rawserver.add_task(r) def Pause(self): if not self.storagewrapper: return False self.unpauseflag.clear() self.rawserver.add_task(self.onPause) return True def onPause(self): self.whenpaused = clock() if not self.downloader: return self.downloader.pause(True) self.encoder.pause(True) self.choker.pause(True) def Unpause(self): self.unpauseflag.set() self.rawserver.add_task(self.onUnpause) def onUnpause(self): if not self.downloader: return self.downloader.pause(False) self.encoder.pause(False) self.choker.pause(False) if self.rerequest and self.whenpaused and clock()-self.whenpaused > 60: self.rerequest.announce(3) # rerequest automatically if paused for >60 seconds def set_super_seed(self): try: self.superseedflag.set() def s(self = self): if self.finflag.isSet(): self._set_super_seed() self.rawserver.add_task(s) except AttributeError: pass def _set_super_seed(self): if not self.super_seeding_active: self.super_seeding_active = True self.errorfunc(' ** SUPER-SEED OPERATION ACTIVE **\n' + ' please set Max uploads so each peer gets 6-8 kB/s') def s(self = self): self.downloader.set_super_seed() self.choker.set_super_seed() self.rawserver.add_task(s) if self.finflag.isSet(): # mode started when already finished def r(self = self): self.rerequest.announce(3) # so after kicking everyone off, reannounce self.rawserver.add_task(r) def am_I_finished(self): return self.finflag.isSet() def get_transfer_stats(self): return self.upmeasure.get_total(), self.downmeasure.get_total() armory-0.92.3/BitTornado/RateMeasure.py0000644000000000000000000000403512414772654016466 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from clock import clock try: True except: True = 1 False = 0 FACTOR = 0.999 class RateMeasure: def __init__(self): self.last = None self.time = 1.0 self.got = 0.0 self.remaining = None self.broke = False self.got_anything = False self.last_checked = None self.rate = 0 self.lastten = False def data_came_in(self, amount): if not self.got_anything: self.got_anything = True self.last = clock() return self.update(amount) def data_rejected(self, amount): pass def get_time_left(self, left): t = clock() if not self.got_anything: return None if t - self.last > 15: self.update(0) try: remaining = left/self.rate if not self.lastten and remaining <= 10: self.lastten = True if self.lastten: return remaining delta = max(remaining/20,2) if self.remaining is None: self.remaining = remaining elif abs(self.remaining-remaining) > delta: self.remaining = remaining else: self.remaining -= t - self.last_checked except ZeroDivisionError: self.remaining = None if self.remaining is not None and self.remaining < 0.1: self.remaining = 0.1 self.last_checked = t return self.remaining def update(self, amount): t = clock() t1 = int(t) l1 = int(self.last) for i in xrange(l1,t1): self.time *= FACTOR self.got *= FACTOR self.got += amount if t - self.last < 20: self.time += t - self.last self.last = t try: self.rate = self.got / self.time except ZeroDivisionError: pass armory-0.92.3/BitTornado/ConfigReader.py0000644000000000000000000014613612414772654016612 0ustar rootroot#written by John Hoffman from ConnChoice import * from wxPython.wx import * from types import IntType, FloatType, StringType from download_bt1 import defaults from ConfigDir import ConfigDir import sys,os import socket from parseargs import defaultargs try: True except: True = 1 False = 0 try: wxFULL_REPAINT_ON_RESIZE except: wxFULL_REPAINT_ON_RESIZE = 0 # fix for wx pre-2.5 if (sys.platform == 'win32'): _FONT = 9 else: _FONT = 10 def HexToColor(s): r,g,b = s.split(' ') return wxColour(red=int(r,16), green=int(g,16), blue=int(b,16)) def hex2(c): h = hex(c)[2:] if len(h) == 1: h = '0'+h return h def ColorToHex(c): return hex2(c.Red()) + ' ' + hex2(c.Green()) + ' ' + hex2(c.Blue()) ratesettingslist = [] for x in connChoices: if not x.has_key('super-seed'): ratesettingslist.append(x['name']) configFileDefaults = [ #args only available for the gui client ('win32_taskbar_icon', 1, "whether to iconize do system try or not on win32"), ('gui_stretchwindow', 0, "whether to stretch the download status window to fit the torrent name"), ('gui_displaystats', 1, "whether to display statistics on peers and seeds"), ('gui_displaymiscstats', 1, "whether to display miscellaneous other statistics"), ('gui_ratesettingsdefault', ratesettingslist[0], "the default setting for maximum upload rate and users"), ('gui_ratesettingsmode', 'full', "what rate setting controls to display; options are 'none', 'basic', and 'full'"), ('gui_forcegreenonfirewall', 0, "forces the status icon to be green even if the client seems to be firewalled"), ('gui_default_savedir', '', "default save directory"), ('last_saved', '', # hidden; not set in config "where the last torrent was saved"), ('gui_font', _FONT, "the font size to use"), ('gui_saveas_ask', -1, "whether to ask where to download to (0 = never, 1 = always, -1 = automatic resume"), ] def setwxconfigfiledefaults(): CHECKINGCOLOR = ColorToHex(wxSystemSettings_GetColour(wxSYS_COLOUR_3DSHADOW)) DOWNLOADCOLOR = ColorToHex(wxSystemSettings_GetColour(wxSYS_COLOUR_ACTIVECAPTION)) configFileDefaults.extend([ ('gui_checkingcolor', CHECKINGCOLOR, "progress bar checking color"), ('gui_downloadcolor', DOWNLOADCOLOR, "progress bar downloading color"), ('gui_seedingcolor', '00 FF 00', "progress bar seeding color"), ]) defaultsToIgnore = ['responsefile', 'url', 'priority'] class configReader: def __init__(self): self.configfile = wxConfig("BitTorrent",style=wxCONFIG_USE_LOCAL_FILE) self.configMenuBox = None self.advancedMenuBox = None self._configReset = True # run reset for the first time setwxconfigfiledefaults() defaults.extend(configFileDefaults) self.defaults = defaultargs(defaults) self.configDir = ConfigDir('gui') self.configDir.setDefaults(defaults,defaultsToIgnore) if self.configDir.checkConfig(): self.config = self.configDir.loadConfig() else: self.config = self.configDir.getConfig() self.importOldGUIConfig() self.configDir.saveConfig() updated = False # make all config default changes here if self.config['gui_ratesettingsdefault'] not in ratesettingslist: self.config['gui_ratesettingsdefault'] = ( self.defaults['gui_ratesettingsdefault'] ) updated = True if self.config['ipv6_enabled'] and ( sys.version_info < (2,3) or not socket.has_ipv6 ): self.config['ipv6_enabled'] = 0 updated = True for c in ['gui_checkingcolor','gui_downloadcolor','gui_seedingcolor']: try: HexToColor(self.config[c]) except: self.config[c] = self.defaults[c] updated = True if updated: self.configDir.saveConfig() self.configDir.deleteOldCacheData(self.config['expire_cache_data']) def importOldGUIConfig(self): oldconfig = wxConfig("BitTorrent",style=wxCONFIG_USE_LOCAL_FILE) cont, s, i = oldconfig.GetFirstEntry() if not cont: oldconfig.DeleteAll() return False while cont: # import old config data if self.config.has_key(s): t = oldconfig.GetEntryType(s) try: if t == 1: assert type(self.config[s]) == type('') self.config[s] = oldconfig.Read(s) elif t == 2 or t == 3: assert type(self.config[s]) == type(1) self.config[s] = int(oldconfig.ReadInt(s)) elif t == 4: assert type(self.config[s]) == type(1.0) self.config[s] = oldconfig.ReadFloat(s) except: pass cont, s, i = oldconfig.GetNextEntry(i) # oldconfig.DeleteAll() return True def resetConfigDefaults(self): for p,v in self.defaults.items(): if not p in defaultsToIgnore: self.config[p] = v self.configDir.saveConfig() def writeConfigFile(self): self.configDir.saveConfig() def WriteLastSaved(self, l): self.config['last_saved'] = l self.configDir.saveConfig() def getcheckingcolor(self): return HexToColor(self.config['gui_checkingcolor']) def getdownloadcolor(self): return HexToColor(self.config['gui_downloadcolor']) def getseedingcolor(self): return HexToColor(self.config['gui_seedingcolor']) def configReset(self): r = self._configReset self._configReset = False return r def getConfigDir(self): return self.configDir def getIconDir(self): return self.configDir.getIconDir() def getTorrentData(self,t): return self.configDir.getTorrentData(t) def setColorIcon(self, xxicon, xxiconptr, xxcolor): idata = wxMemoryDC() idata.SelectObject(xxicon) idata.SetBrush(wxBrush(xxcolor,wxSOLID)) idata.DrawRectangle(0,0,16,16) idata.SelectObject(wxNullBitmap) xxiconptr.Refresh() def getColorFromUser(self, parent, colInit): data = wxColourData() if colInit.Ok(): data.SetColour(colInit) data.SetCustomColour(0, self.checkingcolor) data.SetCustomColour(1, self.downloadcolor) data.SetCustomColour(2, self.seedingcolor) dlg = wxColourDialog(parent,data) if not dlg.ShowModal(): return colInit return dlg.GetColourData().GetColour() def configMenu(self, parent): self.parent = parent try: self.FONT = self.config['gui_font'] self.default_font = wxFont(self.FONT, wxDEFAULT, wxNORMAL, wxNORMAL, False) self.checkingcolor = HexToColor(self.config['gui_checkingcolor']) self.downloadcolor = HexToColor(self.config['gui_downloadcolor']) self.seedingcolor = HexToColor(self.config['gui_seedingcolor']) if (self.configMenuBox is not None): try: self.configMenuBox.Close() except wxPyDeadObjectError, e: self.configMenuBox = None self.configMenuBox = wxFrame(None, -1, 'BitTorrent Preferences', size = (1,1), style = wxDEFAULT_FRAME_STYLE|wxFULL_REPAINT_ON_RESIZE) if (sys.platform == 'win32'): self.icon = self.parent.icon self.configMenuBox.SetIcon(self.icon) panel = wxPanel(self.configMenuBox, -1) self.panel = panel def StaticText(text, font = self.FONT, underline = False, color = None, panel = panel): x = wxStaticText(panel, -1, text, style = wxALIGN_LEFT) x.SetFont(wxFont(font, wxDEFAULT, wxNORMAL, wxNORMAL, underline)) if color is not None: x.SetForegroundColour(color) return x colsizer = wxFlexGridSizer(cols = 1, vgap = 8) self.gui_stretchwindow_checkbox = wxCheckBox(panel, -1, "Stretch window to fit torrent name *") self.gui_stretchwindow_checkbox.SetFont(self.default_font) self.gui_stretchwindow_checkbox.SetValue(self.config['gui_stretchwindow']) self.gui_displaystats_checkbox = wxCheckBox(panel, -1, "Display peer and seed statistics") self.gui_displaystats_checkbox.SetFont(self.default_font) self.gui_displaystats_checkbox.SetValue(self.config['gui_displaystats']) self.gui_displaymiscstats_checkbox = wxCheckBox(panel, -1, "Display miscellaneous other statistics") self.gui_displaymiscstats_checkbox.SetFont(self.default_font) self.gui_displaymiscstats_checkbox.SetValue(self.config['gui_displaymiscstats']) self.security_checkbox = wxCheckBox(panel, -1, "Don't allow multiple connections from the same IP") self.security_checkbox.SetFont(self.default_font) self.security_checkbox.SetValue(self.config['security']) self.autokick_checkbox = wxCheckBox(panel, -1, "Kick/ban clients that send you bad data *") self.autokick_checkbox.SetFont(self.default_font) self.autokick_checkbox.SetValue(self.config['auto_kick']) self.buffering_checkbox = wxCheckBox(panel, -1, "Enable read/write buffering *") self.buffering_checkbox.SetFont(self.default_font) self.buffering_checkbox.SetValue(self.config['buffer_reads']) self.breakup_checkbox = wxCheckBox(panel, -1, "Break-up seed bitfield to foil ISP manipulation") self.breakup_checkbox.SetFont(self.default_font) self.breakup_checkbox.SetValue(self.config['breakup_seed_bitfield']) self.autoflush_checkbox = wxCheckBox(panel, -1, "Flush data to disk every 5 minutes") self.autoflush_checkbox.SetFont(self.default_font) self.autoflush_checkbox.SetValue(self.config['auto_flush']) if sys.version_info >= (2,3) and socket.has_ipv6: self.ipv6enabled_checkbox = wxCheckBox(panel, -1, "Initiate and receive connections via IPv6 *") self.ipv6enabled_checkbox.SetFont(self.default_font) self.ipv6enabled_checkbox.SetValue(self.config['ipv6_enabled']) self.gui_forcegreenonfirewall_checkbox = wxCheckBox(panel, -1, "Force icon to display green when firewalled") self.gui_forcegreenonfirewall_checkbox.SetFont(self.default_font) self.gui_forcegreenonfirewall_checkbox.SetValue(self.config['gui_forcegreenonfirewall']) self.minport_data = wxSpinCtrl(panel, -1, '', (-1,-1), (self.FONT*8, -1)) self.minport_data.SetFont(self.default_font) self.minport_data.SetRange(1,65535) self.minport_data.SetValue(self.config['minport']) self.maxport_data = wxSpinCtrl(panel, -1, '', (-1,-1), (self.FONT*8, -1)) self.maxport_data.SetFont(self.default_font) self.maxport_data.SetRange(1,65535) self.maxport_data.SetValue(self.config['maxport']) self.randomport_checkbox = wxCheckBox(panel, -1, "randomize") self.randomport_checkbox.SetFont(self.default_font) self.randomport_checkbox.SetValue(self.config['random_port']) self.gui_font_data = wxSpinCtrl(panel, -1, '', (-1,-1), (self.FONT*5, -1)) self.gui_font_data.SetFont(self.default_font) self.gui_font_data.SetRange(8,16) self.gui_font_data.SetValue(self.config['gui_font']) self.gui_ratesettingsdefault_data=wxChoice(panel, -1, choices = ratesettingslist) self.gui_ratesettingsdefault_data.SetFont(self.default_font) self.gui_ratesettingsdefault_data.SetStringSelection(self.config['gui_ratesettingsdefault']) self.maxdownload_data = wxSpinCtrl(panel, -1, '', (-1,-1), (self.FONT*7, -1)) self.maxdownload_data.SetFont(self.default_font) self.maxdownload_data.SetRange(0,5000) self.maxdownload_data.SetValue(self.config['max_download_rate']) self.gui_ratesettingsmode_data=wxRadioBox(panel, -1, 'Rate Settings Mode', choices = [ 'none', 'basic', 'full' ] ) self.gui_ratesettingsmode_data.SetFont(self.default_font) self.gui_ratesettingsmode_data.SetStringSelection(self.config['gui_ratesettingsmode']) if (sys.platform == 'win32'): self.win32_taskbar_icon_checkbox = wxCheckBox(panel, -1, "Minimize to system tray") self.win32_taskbar_icon_checkbox.SetFont(self.default_font) self.win32_taskbar_icon_checkbox.SetValue(self.config['win32_taskbar_icon']) # self.upnp_checkbox = wxCheckBox(panel, -1, "Enable automatic UPnP port forwarding") # self.upnp_checkbox.SetFont(self.default_font) # self.upnp_checkbox.SetValue(self.config['upnp_nat_access']) self.upnp_data=wxChoice(panel, -1, choices = ['disabled', 'type 1 (fast)', 'type 2 (slow)']) self.upnp_data.SetFont(self.default_font) self.upnp_data.SetSelection(self.config['upnp_nat_access']) self.gui_default_savedir_ctrl = wxTextCtrl(parent = panel, id = -1, value = self.config['gui_default_savedir'], size = (26*self.FONT, -1), style = wxTE_PROCESS_TAB) self.gui_default_savedir_ctrl.SetFont(self.default_font) self.gui_savemode_data=wxRadioBox(panel, -1, 'Ask where to save: *', choices = [ 'always', 'never', 'auto-resume' ] ) self.gui_savemode_data.SetFont(self.default_font) self.gui_savemode_data.SetSelection(1-self.config['gui_saveas_ask']) self.checkingcolor_icon = wxEmptyBitmap(16,16) self.checkingcolor_iconptr = wxStaticBitmap(panel, -1, self.checkingcolor_icon) self.setColorIcon(self.checkingcolor_icon, self.checkingcolor_iconptr, self.checkingcolor) self.downloadcolor_icon = wxEmptyBitmap(16,16) self.downloadcolor_iconptr = wxStaticBitmap(panel, -1, self.downloadcolor_icon) self.setColorIcon(self.downloadcolor_icon, self.downloadcolor_iconptr, self.downloadcolor) self.seedingcolor_icon = wxEmptyBitmap(16,16) self.seedingcolor_iconptr = wxStaticBitmap(panel, -1, self.seedingcolor_icon) self.setColorIcon(self.seedingcolor_icon, self.downloadcolor_iconptr, self.seedingcolor) rowsizer = wxFlexGridSizer(cols = 2, hgap = 20) block12sizer = wxFlexGridSizer(cols = 1, vgap = 7) block1sizer = wxFlexGridSizer(cols = 1, vgap = 2) if (sys.platform == 'win32'): block1sizer.Add(self.win32_taskbar_icon_checkbox) # block1sizer.Add(self.upnp_checkbox) block1sizer.Add(self.gui_stretchwindow_checkbox) block1sizer.Add(self.gui_displaystats_checkbox) block1sizer.Add(self.gui_displaymiscstats_checkbox) block1sizer.Add(self.security_checkbox) block1sizer.Add(self.autokick_checkbox) block1sizer.Add(self.buffering_checkbox) block1sizer.Add(self.breakup_checkbox) block1sizer.Add(self.autoflush_checkbox) if sys.version_info >= (2,3) and socket.has_ipv6: block1sizer.Add(self.ipv6enabled_checkbox) block1sizer.Add(self.gui_forcegreenonfirewall_checkbox) block12sizer.Add(block1sizer) colorsizer = wxStaticBoxSizer(wxStaticBox(panel, -1, "Gauge Colors:"), wxVERTICAL) colorsizer1 = wxFlexGridSizer(cols = 7) colorsizer1.Add(StaticText(' Checking: '), 1, wxALIGN_BOTTOM) colorsizer1.Add(self.checkingcolor_iconptr, 1, wxALIGN_BOTTOM) colorsizer1.Add(StaticText(' Downloading: '), 1, wxALIGN_BOTTOM) colorsizer1.Add(self.downloadcolor_iconptr, 1, wxALIGN_BOTTOM) colorsizer1.Add(StaticText(' Seeding: '), 1, wxALIGN_BOTTOM) colorsizer1.Add(self.seedingcolor_iconptr, 1, wxALIGN_BOTTOM) colorsizer1.Add(StaticText(' ')) minsize = self.checkingcolor_iconptr.GetBestSize() minsize.SetHeight(minsize.GetHeight()+5) colorsizer1.SetMinSize(minsize) colorsizer.Add(colorsizer1) block12sizer.Add(colorsizer, 1, wxALIGN_LEFT) rowsizer.Add(block12sizer) block3sizer = wxFlexGridSizer(cols = 1) portsettingsSizer = wxStaticBoxSizer(wxStaticBox(panel, -1, "Port Range:*"), wxVERTICAL) portsettingsSizer1 = wxGridSizer(cols = 2, vgap = 1) portsettingsSizer1.Add(StaticText('From: '), 1, wxALIGN_CENTER_VERTICAL|wxALIGN_RIGHT) portsettingsSizer1.Add(self.minport_data, 1, wxALIGN_BOTTOM) portsettingsSizer1.Add(StaticText('To: '), 1, wxALIGN_CENTER_VERTICAL|wxALIGN_RIGHT) portsettingsSizer1.Add(self.maxport_data, 1, wxALIGN_BOTTOM) portsettingsSizer.Add(portsettingsSizer1) portsettingsSizer.Add(self.randomport_checkbox, 1, wxALIGN_CENTER) block3sizer.Add(portsettingsSizer, 1, wxALIGN_CENTER) block3sizer.Add(StaticText(' ')) block3sizer.Add(self.gui_ratesettingsmode_data, 1, wxALIGN_CENTER) block3sizer.Add(StaticText(' ')) ratesettingsSizer = wxFlexGridSizer(cols = 1, vgap = 2) ratesettingsSizer.Add(StaticText('Default Rate Setting: *'), 1, wxALIGN_CENTER) ratesettingsSizer.Add(self.gui_ratesettingsdefault_data, 1, wxALIGN_CENTER) block3sizer.Add(ratesettingsSizer, 1, wxALIGN_CENTER) if (sys.platform == 'win32'): block3sizer.Add(StaticText(' ')) upnpSizer = wxFlexGridSizer(cols = 1, vgap = 2) upnpSizer.Add(StaticText('UPnP Port Forwarding: *'), 1, wxALIGN_CENTER) upnpSizer.Add(self.upnp_data, 1, wxALIGN_CENTER) block3sizer.Add(upnpSizer, 1, wxALIGN_CENTER) rowsizer.Add(block3sizer) colsizer.Add(rowsizer) block4sizer = wxFlexGridSizer(cols = 3, hgap = 15) savepathsizer = wxFlexGridSizer(cols = 2, vgap = 1) savepathsizer.Add(StaticText('Default Save Path: *')) savepathsizer.Add(StaticText(' ')) savepathsizer.Add(self.gui_default_savedir_ctrl, 1, wxEXPAND) savepathButton = wxButton(panel, -1, '...', size = (18,18)) # savepathButton.SetFont(self.default_font) savepathsizer.Add(savepathButton, 0, wxALIGN_CENTER) savepathsizer.Add(self.gui_savemode_data, 0, wxALIGN_CENTER) block4sizer.Add(savepathsizer, -1, wxALIGN_BOTTOM) fontsizer = wxFlexGridSizer(cols = 1, vgap = 2) fontsizer.Add(StaticText('')) fontsizer.Add(StaticText('Font: *'), 1, wxALIGN_CENTER) fontsizer.Add(self.gui_font_data, 1, wxALIGN_CENTER) block4sizer.Add(fontsizer, 1, wxALIGN_CENTER_VERTICAL) dratesettingsSizer = wxFlexGridSizer(cols = 1, vgap = 2) dratesettingsSizer.Add(StaticText('Default Max'), 1, wxALIGN_CENTER) dratesettingsSizer.Add(StaticText('Download Rate'), 1, wxALIGN_CENTER) dratesettingsSizer.Add(StaticText('(kB/s): *'), 1, wxALIGN_CENTER) dratesettingsSizer.Add(self.maxdownload_data, 1, wxALIGN_CENTER) dratesettingsSizer.Add(StaticText('(0 = disabled)'), 1, wxALIGN_CENTER) block4sizer.Add(dratesettingsSizer, 1, wxALIGN_CENTER_VERTICAL) colsizer.Add(block4sizer, 0, wxALIGN_CENTER) # colsizer.Add(StaticText(' ')) savesizer = wxGridSizer(cols = 4, hgap = 10) saveButton = wxButton(panel, -1, 'Save') # saveButton.SetFont(self.default_font) savesizer.Add(saveButton, 0, wxALIGN_CENTER) cancelButton = wxButton(panel, -1, 'Cancel') # cancelButton.SetFont(self.default_font) savesizer.Add(cancelButton, 0, wxALIGN_CENTER) defaultsButton = wxButton(panel, -1, 'Revert to Defaults') # defaultsButton.SetFont(self.default_font) savesizer.Add(defaultsButton, 0, wxALIGN_CENTER) advancedButton = wxButton(panel, -1, 'Advanced...') # advancedButton.SetFont(self.default_font) savesizer.Add(advancedButton, 0, wxALIGN_CENTER) colsizer.Add(savesizer, 1, wxALIGN_CENTER) resizewarningtext=StaticText('* These settings will not take effect until the next time you start BitTorrent', self.FONT-2) colsizer.Add(resizewarningtext, 1, wxALIGN_CENTER) border = wxBoxSizer(wxHORIZONTAL) border.Add(colsizer, 1, wxEXPAND | wxALL, 4) panel.SetSizer(border) panel.SetAutoLayout(True) self.advancedConfig = {} def setDefaults(evt, self = self): try: self.minport_data.SetValue(self.defaults['minport']) self.maxport_data.SetValue(self.defaults['maxport']) self.randomport_checkbox.SetValue(self.defaults['random_port']) self.gui_stretchwindow_checkbox.SetValue(self.defaults['gui_stretchwindow']) self.gui_displaystats_checkbox.SetValue(self.defaults['gui_displaystats']) self.gui_displaymiscstats_checkbox.SetValue(self.defaults['gui_displaymiscstats']) self.security_checkbox.SetValue(self.defaults['security']) self.autokick_checkbox.SetValue(self.defaults['auto_kick']) self.buffering_checkbox.SetValue(self.defaults['buffer_reads']) self.breakup_checkbox.SetValue(self.defaults['breakup_seed_bitfield']) self.autoflush_checkbox.SetValue(self.defaults['auto_flush']) if sys.version_info >= (2,3) and socket.has_ipv6: self.ipv6enabled_checkbox.SetValue(self.defaults['ipv6_enabled']) self.gui_forcegreenonfirewall_checkbox.SetValue(self.defaults['gui_forcegreenonfirewall']) self.gui_font_data.SetValue(self.defaults['gui_font']) self.gui_ratesettingsdefault_data.SetStringSelection(self.defaults['gui_ratesettingsdefault']) self.maxdownload_data.SetValue(self.defaults['max_download_rate']) self.gui_ratesettingsmode_data.SetStringSelection(self.defaults['gui_ratesettingsmode']) self.gui_default_savedir_ctrl.SetValue(self.defaults['gui_default_savedir']) self.gui_savemode_data.SetSelection(1-self.defaults['gui_saveas_ask']) self.checkingcolor = HexToColor(self.defaults['gui_checkingcolor']) self.setColorIcon(self.checkingcolor_icon, self.checkingcolor_iconptr, self.checkingcolor) self.downloadcolor = HexToColor(self.defaults['gui_downloadcolor']) self.setColorIcon(self.downloadcolor_icon, self.downloadcolor_iconptr, self.downloadcolor) self.seedingcolor = HexToColor(self.defaults['gui_seedingcolor']) self.setColorIcon(self.seedingcolor_icon, self.seedingcolor_iconptr, self.seedingcolor) if (sys.platform == 'win32'): self.win32_taskbar_icon_checkbox.SetValue(self.defaults['win32_taskbar_icon']) # self.upnp_checkbox.SetValue(self.defaults['upnp_nat_access']) self.upnp_data.SetSelection(self.defaults['upnp_nat_access']) # reset advanced too self.advancedConfig = {} for key in ['ip', 'bind', 'min_peers', 'max_initiate', 'display_interval', 'alloc_type', 'alloc_rate', 'max_files_open', 'max_connections', 'super_seeder', 'ipv6_binds_v4', 'double_check', 'triple_check', 'lock_files', 'lock_while_reading', 'expire_cache_data']: self.advancedConfig[key] = self.defaults[key] self.CloseAdvanced() except: self.parent.exception() def saveConfigs(evt, self = self): try: self.config['gui_stretchwindow']=int(self.gui_stretchwindow_checkbox.GetValue()) self.config['gui_displaystats']=int(self.gui_displaystats_checkbox.GetValue()) self.config['gui_displaymiscstats']=int(self.gui_displaymiscstats_checkbox.GetValue()) self.config['security']=int(self.security_checkbox.GetValue()) self.config['auto_kick']=int(self.autokick_checkbox.GetValue()) buffering=int(self.buffering_checkbox.GetValue()) self.config['buffer_reads']=buffering if buffering: self.config['write_buffer_size']=self.defaults['write_buffer_size'] else: self.config['write_buffer_size']=0 self.config['breakup_seed_bitfield']=int(self.breakup_checkbox.GetValue()) if self.autoflush_checkbox.GetValue(): self.config['auto_flush']=5 else: self.config['auto_flush']=0 if sys.version_info >= (2,3) and socket.has_ipv6: self.config['ipv6_enabled']=int(self.ipv6enabled_checkbox.GetValue()) self.config['gui_forcegreenonfirewall']=int(self.gui_forcegreenonfirewall_checkbox.GetValue()) self.config['minport']=self.minport_data.GetValue() self.config['maxport']=self.maxport_data.GetValue() self.config['random_port']=int(self.randomport_checkbox.GetValue()) self.config['gui_font']=self.gui_font_data.GetValue() self.config['gui_ratesettingsdefault']=self.gui_ratesettingsdefault_data.GetStringSelection() self.config['max_download_rate']=self.maxdownload_data.GetValue() self.config['gui_ratesettingsmode']=self.gui_ratesettingsmode_data.GetStringSelection() self.config['gui_default_savedir']=self.gui_default_savedir_ctrl.GetValue() self.config['gui_saveas_ask']=1-self.gui_savemode_data.GetSelection() self.config['gui_checkingcolor']=ColorToHex(self.checkingcolor) self.config['gui_downloadcolor']=ColorToHex(self.downloadcolor) self.config['gui_seedingcolor']=ColorToHex(self.seedingcolor) if (sys.platform == 'win32'): self.config['win32_taskbar_icon']=int(self.win32_taskbar_icon_checkbox.GetValue()) # self.config['upnp_nat_access']=int(self.upnp_checkbox.GetValue()) self.config['upnp_nat_access']=self.upnp_data.GetSelection() if self.advancedConfig: for key,val in self.advancedConfig.items(): self.config[key] = val self.writeConfigFile() self._configReset = True self.Close() except: self.parent.exception() def cancelConfigs(evt, self = self): self.Close() def savepath_set(evt, self = self): try: d = self.gui_default_savedir_ctrl.GetValue() if d == '': d = self.config['last_saved'] dl = wxDirDialog(self.panel, 'Choose a default directory to save to', d, style = wxDD_DEFAULT_STYLE | wxDD_NEW_DIR_BUTTON) if dl.ShowModal() == wxID_OK: self.gui_default_savedir_ctrl.SetValue(dl.GetPath()) except: self.parent.exception() def checkingcoloricon_set(evt, self = self): try: newcolor = self.getColorFromUser(self.panel,self.checkingcolor) self.setColorIcon(self.checkingcolor_icon, self.checkingcolor_iconptr, newcolor) self.checkingcolor = newcolor except: self.parent.exception() def downloadcoloricon_set(evt, self = self): try: newcolor = self.getColorFromUser(self.panel,self.downloadcolor) self.setColorIcon(self.downloadcolor_icon, self.downloadcolor_iconptr, newcolor) self.downloadcolor = newcolor except: self.parent.exception() def seedingcoloricon_set(evt, self = self): try: newcolor = self.getColorFromUser(self.panel,self.seedingcolor) self.setColorIcon(self.seedingcolor_icon, self.seedingcolor_iconptr, newcolor) self.seedingcolor = newcolor except: self.parent.exception() EVT_BUTTON(self.configMenuBox, saveButton.GetId(), saveConfigs) EVT_BUTTON(self.configMenuBox, cancelButton.GetId(), cancelConfigs) EVT_BUTTON(self.configMenuBox, defaultsButton.GetId(), setDefaults) EVT_BUTTON(self.configMenuBox, advancedButton.GetId(), self.advancedMenu) EVT_BUTTON(self.configMenuBox, savepathButton.GetId(), savepath_set) EVT_LEFT_DOWN(self.checkingcolor_iconptr, checkingcoloricon_set) EVT_LEFT_DOWN(self.downloadcolor_iconptr, downloadcoloricon_set) EVT_LEFT_DOWN(self.seedingcolor_iconptr, seedingcoloricon_set) self.configMenuBox.Show () border.Fit(panel) self.configMenuBox.Fit() except: self.parent.exception() def Close(self): self.CloseAdvanced() if self.configMenuBox is not None: try: self.configMenuBox.Close () except wxPyDeadObjectError, e: pass self.configMenuBox = None def advancedMenu(self, event = None): try: if not self.advancedConfig: for key in ['ip', 'bind', 'min_peers', 'max_initiate', 'display_interval', 'alloc_type', 'alloc_rate', 'max_files_open', 'max_connections', 'super_seeder', 'ipv6_binds_v4', 'double_check', 'triple_check', 'lock_files', 'lock_while_reading', 'expire_cache_data']: self.advancedConfig[key] = self.config[key] if (self.advancedMenuBox is not None): try: self.advancedMenuBox.Close () except wxPyDeadObjectError, e: self.advancedMenuBox = None self.advancedMenuBox = wxFrame(None, -1, 'BitTorrent Advanced Preferences', size = (1,1), style = wxDEFAULT_FRAME_STYLE|wxFULL_REPAINT_ON_RESIZE) if (sys.platform == 'win32'): self.advancedMenuBox.SetIcon(self.icon) panel = wxPanel(self.advancedMenuBox, -1) # self.panel = panel def StaticText(text, font = self.FONT, underline = False, color = None, panel = panel): x = wxStaticText(panel, -1, text, style = wxALIGN_LEFT) x.SetFont(wxFont(font, wxDEFAULT, wxNORMAL, wxNORMAL, underline)) if color is not None: x.SetForegroundColour(color) return x colsizer = wxFlexGridSizer(cols = 1, hgap = 13, vgap = 13) warningtext = StaticText('CHANGE THESE SETTINGS AT YOUR OWN RISK', self.FONT+4, True, 'Red') colsizer.Add(warningtext, 1, wxALIGN_CENTER) self.ip_data = wxTextCtrl(parent = panel, id = -1, value = self.advancedConfig['ip'], size = (self.FONT*13, int(self.FONT*2.2)), style = wxTE_PROCESS_TAB) self.ip_data.SetFont(self.default_font) self.bind_data = wxTextCtrl(parent = panel, id = -1, value = self.advancedConfig['bind'], size = (self.FONT*13, int(self.FONT*2.2)), style = wxTE_PROCESS_TAB) self.bind_data.SetFont(self.default_font) if sys.version_info >= (2,3) and socket.has_ipv6: self.ipv6bindsv4_data=wxChoice(panel, -1, choices = ['separate sockets', 'single socket']) self.ipv6bindsv4_data.SetFont(self.default_font) self.ipv6bindsv4_data.SetSelection(self.advancedConfig['ipv6_binds_v4']) self.minpeers_data = wxSpinCtrl(panel, -1, '', (-1,-1), (self.FONT*7, -1)) self.minpeers_data.SetFont(self.default_font) self.minpeers_data.SetRange(10,100) self.minpeers_data.SetValue(self.advancedConfig['min_peers']) # max_initiate = 2*minpeers self.displayinterval_data = wxSpinCtrl(panel, -1, '', (-1,-1), (self.FONT*7, -1)) self.displayinterval_data.SetFont(self.default_font) self.displayinterval_data.SetRange(100,2000) self.displayinterval_data.SetValue(int(self.advancedConfig['display_interval']*1000)) self.alloctype_data=wxChoice(panel, -1, choices = ['normal', 'background', 'pre-allocate', 'sparse']) self.alloctype_data.SetFont(self.default_font) self.alloctype_data.SetStringSelection(self.advancedConfig['alloc_type']) self.allocrate_data = wxSpinCtrl(panel, -1, '', (-1,-1), (self.FONT*7,-1)) self.allocrate_data.SetFont(self.default_font) self.allocrate_data.SetRange(1,100) self.allocrate_data.SetValue(int(self.advancedConfig['alloc_rate'])) self.locking_data=wxChoice(panel, -1, choices = ['no locking', 'lock while writing', 'lock always']) self.locking_data.SetFont(self.default_font) if self.advancedConfig['lock_files']: if self.advancedConfig['lock_while_reading']: self.locking_data.SetSelection(2) else: self.locking_data.SetSelection(1) else: self.locking_data.SetSelection(0) self.doublecheck_data=wxChoice(panel, -1, choices = ['no extra checking', 'double-check', 'triple-check']) self.doublecheck_data.SetFont(self.default_font) if self.advancedConfig['double_check']: if self.advancedConfig['triple_check']: self.doublecheck_data.SetSelection(2) else: self.doublecheck_data.SetSelection(1) else: self.doublecheck_data.SetSelection(0) self.maxfilesopen_choices = ['50', '100', '200', 'no limit '] self.maxfilesopen_data=wxChoice(panel, -1, choices = self.maxfilesopen_choices) self.maxfilesopen_data.SetFont(self.default_font) setval = self.advancedConfig['max_files_open'] if setval == 0: setval = 'no limit ' else: setval = str(setval) if not setval in self.maxfilesopen_choices: setval = self.maxfilesopen_choices[0] self.maxfilesopen_data.SetStringSelection(setval) self.maxconnections_choices = ['no limit ', '20', '30', '40', '50', '60', '100', '200'] self.maxconnections_data=wxChoice(panel, -1, choices = self.maxconnections_choices) self.maxconnections_data.SetFont(self.default_font) setval = self.advancedConfig['max_connections'] if setval == 0: setval = 'no limit ' else: setval = str(setval) if not setval in self.maxconnections_choices: setval = self.maxconnections_choices[0] self.maxconnections_data.SetStringSelection(setval) self.superseeder_data=wxChoice(panel, -1, choices = ['normal', 'super-seed']) self.superseeder_data.SetFont(self.default_font) self.superseeder_data.SetSelection(self.advancedConfig['super_seeder']) self.expirecache_choices = ['never ', '3', '5', '7', '10', '15', '30', '60', '90'] self.expirecache_data=wxChoice(panel, -1, choices = self.expirecache_choices) setval = self.advancedConfig['expire_cache_data'] if setval == 0: setval = 'never ' else: setval = str(setval) if not setval in self.expirecache_choices: setval = self.expirecache_choices[0] self.expirecache_data.SetFont(self.default_font) self.expirecache_data.SetStringSelection(setval) twocolsizer = wxFlexGridSizer(cols = 2, hgap = 20) datasizer = wxFlexGridSizer(cols = 2, vgap = 2) datasizer.Add(StaticText('Local IP: '), 1, wxALIGN_CENTER_VERTICAL) datasizer.Add(self.ip_data) datasizer.Add(StaticText('IP to bind to: '), 1, wxALIGN_CENTER_VERTICAL) datasizer.Add(self.bind_data) if sys.version_info >= (2,3) and socket.has_ipv6: datasizer.Add(StaticText('IPv6 socket handling: '), 1, wxALIGN_CENTER_VERTICAL) datasizer.Add(self.ipv6bindsv4_data) datasizer.Add(StaticText('Minimum number of peers: '), 1, wxALIGN_CENTER_VERTICAL) datasizer.Add(self.minpeers_data) datasizer.Add(StaticText('Display interval (ms): '), 1, wxALIGN_CENTER_VERTICAL) datasizer.Add(self.displayinterval_data) datasizer.Add(StaticText('Disk allocation type:'), 1, wxALIGN_CENTER_VERTICAL) datasizer.Add(self.alloctype_data) datasizer.Add(StaticText('Allocation rate (MiB/s):'), 1, wxALIGN_CENTER_VERTICAL) datasizer.Add(self.allocrate_data) datasizer.Add(StaticText('File locking:'), 1, wxALIGN_CENTER_VERTICAL) datasizer.Add(self.locking_data) datasizer.Add(StaticText('Extra data checking:'), 1, wxALIGN_CENTER_VERTICAL) datasizer.Add(self.doublecheck_data) datasizer.Add(StaticText('Max files open:'), 1, wxALIGN_CENTER_VERTICAL) datasizer.Add(self.maxfilesopen_data) datasizer.Add(StaticText('Max peer connections:'), 1, wxALIGN_CENTER_VERTICAL) datasizer.Add(self.maxconnections_data) datasizer.Add(StaticText('Default seeding mode:'), 1, wxALIGN_CENTER_VERTICAL) datasizer.Add(self.superseeder_data) datasizer.Add(StaticText('Expire resume data(days):'), 1, wxALIGN_CENTER_VERTICAL) datasizer.Add(self.expirecache_data) twocolsizer.Add(datasizer) infosizer = wxFlexGridSizer(cols = 1) self.hinttext = StaticText('', self.FONT, False, 'Blue') infosizer.Add(self.hinttext, 1, wxALIGN_LEFT|wxALIGN_CENTER_VERTICAL) infosizer.SetMinSize((180,100)) twocolsizer.Add(infosizer, 1, wxEXPAND) colsizer.Add(twocolsizer) savesizer = wxGridSizer(cols = 3, hgap = 20) okButton = wxButton(panel, -1, 'OK') # okButton.SetFont(self.default_font) savesizer.Add(okButton, 0, wxALIGN_CENTER) cancelButton = wxButton(panel, -1, 'Cancel') # cancelButton.SetFont(self.default_font) savesizer.Add(cancelButton, 0, wxALIGN_CENTER) defaultsButton = wxButton(panel, -1, 'Revert to Defaults') # defaultsButton.SetFont(self.default_font) savesizer.Add(defaultsButton, 0, wxALIGN_CENTER) colsizer.Add(savesizer, 1, wxALIGN_CENTER) resizewarningtext=StaticText('None of these settings will take effect until the next time you start BitTorrent', self.FONT-2) colsizer.Add(resizewarningtext, 1, wxALIGN_CENTER) border = wxBoxSizer(wxHORIZONTAL) border.Add(colsizer, 1, wxEXPAND | wxALL, 4) panel.SetSizer(border) panel.SetAutoLayout(True) def setDefaults(evt, self = self): try: self.ip_data.SetValue(self.defaults['ip']) self.bind_data.SetValue(self.defaults['bind']) if sys.version_info >= (2,3) and socket.has_ipv6: self.ipv6bindsv4_data.SetSelection(self.defaults['ipv6_binds_v4']) self.minpeers_data.SetValue(self.defaults['min_peers']) self.displayinterval_data.SetValue(int(self.defaults['display_interval']*1000)) self.alloctype_data.SetStringSelection(self.defaults['alloc_type']) self.allocrate_data.SetValue(int(self.defaults['alloc_rate'])) if self.defaults['lock_files']: if self.defaults['lock_while_reading']: self.locking_data.SetSelection(2) else: self.locking_data.SetSelection(1) else: self.locking_data.SetSelection(0) if self.defaults['double_check']: if self.defaults['triple_check']: self.doublecheck_data.SetSelection(2) else: self.doublecheck_data.SetSelection(1) else: self.doublecheck_data.SetSelection(0) setval = self.defaults['max_files_open'] if setval == 0: setval = 'no limit ' else: setval = str(setval) if not setval in self.maxfilesopen_choices: setval = self.maxfilesopen_choices[0] self.maxfilesopen_data.SetStringSelection(setval) setval = self.defaults['max_connections'] if setval == 0: setval = 'no limit ' else: setval = str(setval) if not setval in self.maxconnections_choices: setval = self.maxconnections_choices[0] self.maxconnections_data.SetStringSelection(setval) self.superseeder_data.SetSelection(int(self.defaults['super_seeder'])) setval = self.defaults['expire_cache_data'] if setval == 0: setval = 'never ' else: setval = str(setval) if not setval in self.expirecache_choices: setval = self.expirecache_choices[0] self.expirecache_data.SetStringSelection(setval) except: self.parent.exception() def saveConfigs(evt, self = self): try: self.advancedConfig['ip'] = self.ip_data.GetValue() self.advancedConfig['bind'] = self.bind_data.GetValue() if sys.version_info >= (2,3) and socket.has_ipv6: self.advancedConfig['ipv6_binds_v4'] = self.ipv6bindsv4_data.GetSelection() self.advancedConfig['min_peers'] = self.minpeers_data.GetValue() self.advancedConfig['display_interval'] = float(self.displayinterval_data.GetValue())/1000 self.advancedConfig['alloc_type'] = self.alloctype_data.GetStringSelection() self.advancedConfig['alloc_rate'] = float(self.allocrate_data.GetValue()) self.advancedConfig['lock_files'] = int(self.locking_data.GetSelection() >= 1) self.advancedConfig['lock_while_reading'] = int(self.locking_data.GetSelection() > 1) self.advancedConfig['double_check'] = int(self.doublecheck_data.GetSelection() >= 1) self.advancedConfig['triple_check'] = int(self.doublecheck_data.GetSelection() > 1) try: self.advancedConfig['max_files_open'] = int(self.maxfilesopen_data.GetStringSelection()) except: # if it ain't a number, it must be "no limit" self.advancedConfig['max_files_open'] = 0 try: self.advancedConfig['max_connections'] = int(self.maxconnections_data.GetStringSelection()) self.advancedConfig['max_initiate'] = min( 2*self.advancedConfig['min_peers'], self.advancedConfig['max_connections']) except: # if it ain't a number, it must be "no limit" self.advancedConfig['max_connections'] = 0 self.advancedConfig['max_initiate'] = 2*self.advancedConfig['min_peers'] self.advancedConfig['super_seeder']=int(self.superseeder_data.GetSelection()) try: self.advancedConfig['expire_cache_data'] = int(self.expirecache_data.GetStringSelection()) except: self.advancedConfig['expire_cache_data'] = 0 self.advancedMenuBox.Close() except: self.parent.exception() def cancelConfigs(evt, self = self): self.advancedMenuBox.Close() def ip_hint(evt, self = self): self.hinttext.SetLabel('\n\n\nThe IP reported to the tracker.\n' + 'unless the tracker is on the\n' + 'same intranet as this client,\n' + 'the tracker will autodetect the\n' + "client's IP and ignore this\n" + "value.") def bind_hint(evt, self = self): self.hinttext.SetLabel('\n\n\nThe IP the client will bind to.\n' + 'Only useful if your machine is\n' + 'directly handling multiple IPs.\n' + "If you don't know what this is,\n" + "leave it blank.") def ipv6bindsv4_hint(evt, self = self): self.hinttext.SetLabel('\n\n\nCertain operating systems will\n' + 'open IPv4 protocol connections on\n' + 'an IPv6 socket; others require you\n' + "to open two sockets on the same\n" + "port, one IPv4 and one IPv6.") def minpeers_hint(evt, self = self): self.hinttext.SetLabel('\n\n\nThe minimum number of peers the\n' + 'client tries to stay connected\n' + 'with. Do not set this higher\n' + 'unless you have a very fast\n' + "connection and a lot of system\n" + "resources.") def displayinterval_hint(evt, self = self): self.hinttext.SetLabel('\n\n\nHow often to update the\n' + 'graphical display, in 1/1000s\n' + 'of a second. Setting this too low\n' + "will strain your computer's\n" + "processor and video access.") def alloctype_hint(evt, self = self): self.hinttext.SetLabel('\n\nHow to allocate disk space.\n' + 'normal allocates space as data is\n' + 'received, background also adds\n' + "space in the background, pre-\n" + "allocate reserves up front, and\n" + 'sparse is only for filesystems\n' + 'that support it by default.') def allocrate_hint(evt, self = self): self.hinttext.SetLabel('\n\n\nAt what rate to allocate disk\n' + 'space when allocating in the\n' + 'background. Set this too high on a\n' + "slow filesystem and your download\n" + "will slow to a crawl.") def locking_hint(evt, self = self): self.hinttext.SetLabel('\n\n\n\nFile locking prevents other\n' + 'programs (including other instances\n' + 'of BitTorrent) from accessing files\n' + "you are downloading.") def doublecheck_hint(evt, self = self): self.hinttext.SetLabel('\n\n\nHow much extra checking to do\n' + 'making sure no data is corrupted.\n' + 'Double-check mode uses more CPU,\n' + "while triple-check mode increases\n" + "disk accesses.") def maxfilesopen_hint(evt, self = self): self.hinttext.SetLabel('\n\n\nThe maximum number of files to\n' + 'keep open at the same time. Zero\n' + 'means no limit. Please note that\n' + "if this option is in effect,\n" + "files are not guaranteed to be\n" + "locked.") def maxconnections_hint(evt, self = self): self.hinttext.SetLabel('\n\nSome operating systems, most\n' + 'notably Windows 9x/ME combined\n' + 'with certain network drivers,\n' + "cannot handle more than a certain\n" + "number of open ports. If the\n" + "client freezes, try setting this\n" + "to 60 or below.") def superseeder_hint(evt, self = self): self.hinttext.SetLabel('\n\nThe "super-seed" method allows\n' + 'a single source to more efficiently\n' + 'seed a large torrent, but is not\n' + "necessary in a well-seeded torrent,\n" + "and causes problems with statistics.\n" + "Unless you routinely seed torrents\n" + "you can enable this by selecting\n" + '"SUPER-SEED" for connection type.\n' + '(once enabled it does not turn off.)') def expirecache_hint(evt, self = self): self.hinttext.SetLabel('\n\nThe client stores temporary data\n' + 'in order to handle downloading only\n' + 'specific files from the torrent and\n' + "so it can resume downloads more\n" + "quickly. This sets how long the\n" + "client will keep this data before\n" + "deleting it to free disk space.") EVT_BUTTON(self.advancedMenuBox, okButton.GetId(), saveConfigs) EVT_BUTTON(self.advancedMenuBox, cancelButton.GetId(), cancelConfigs) EVT_BUTTON(self.advancedMenuBox, defaultsButton.GetId(), setDefaults) EVT_ENTER_WINDOW(self.ip_data, ip_hint) EVT_ENTER_WINDOW(self.bind_data, bind_hint) if sys.version_info >= (2,3) and socket.has_ipv6: EVT_ENTER_WINDOW(self.ipv6bindsv4_data, ipv6bindsv4_hint) EVT_ENTER_WINDOW(self.minpeers_data, minpeers_hint) EVT_ENTER_WINDOW(self.displayinterval_data, displayinterval_hint) EVT_ENTER_WINDOW(self.alloctype_data, alloctype_hint) EVT_ENTER_WINDOW(self.allocrate_data, allocrate_hint) EVT_ENTER_WINDOW(self.locking_data, locking_hint) EVT_ENTER_WINDOW(self.doublecheck_data, doublecheck_hint) EVT_ENTER_WINDOW(self.maxfilesopen_data, maxfilesopen_hint) EVT_ENTER_WINDOW(self.maxconnections_data, maxconnections_hint) EVT_ENTER_WINDOW(self.superseeder_data, superseeder_hint) EVT_ENTER_WINDOW(self.expirecache_data, expirecache_hint) self.advancedMenuBox.Show () border.Fit(panel) self.advancedMenuBox.Fit() except: self.parent.exception() def CloseAdvanced(self): if self.advancedMenuBox is not None: try: self.advancedMenuBox.Close() except wxPyDeadObjectError, e: self.advancedMenuBox = None armory-0.92.3/BitTornado/launchmanycore.py0000644000000000000000000003112012414772654017254 0ustar rootroot#!/usr/bin/env python # Written by John Hoffman # see LICENSE.txt for license information from BitTornado import PSYCO if PSYCO.psyco: try: import psyco assert psyco.__version__ >= 0x010100f0 psyco.full() except: pass from download_bt1 import BT1Download from RawServer import RawServer, UPnP_ERROR from RateLimiter import RateLimiter from ServerPortHandler import MultiHandler from parsedir import parsedir from natpunch import UPnP_test from random import seed from socket import error as socketerror from threading import Event from sys import argv, exit import sys, os from clock import clock from __init__ import createPeerID, mapbase64, version from cStringIO import StringIO from traceback import print_exc try: True except: True = 1 False = 0 def fmttime(n): try: n = int(n) # n may be None or too large assert n < 5184000 # 60 days except: return 'downloading' m, s = divmod(n, 60) h, m = divmod(m, 60) return '%d:%02d:%02d' % (h, m, s) class SingleDownload: def __init__(self, controller, hash, response, config, myid): self.controller = controller self.hash = hash self.response = response self.config = config self.doneflag = Event() self.waiting = True self.checking = False self.working = False self.seed = False self.closed = False self.status_msg = '' self.status_err = [''] self.status_errtime = 0 self.status_done = 0.0 self.rawserver = controller.handler.newRawServer(hash, self.doneflag) d = BT1Download(self.display, self.finished, self.error, controller.exchandler, self.doneflag, config, response, hash, myid, self.rawserver, controller.listen_port) self.d = d def start(self): if not self.d.saveAs(self.saveAs): self._shutdown() return self._hashcheckfunc = self.d.initFiles() if not self._hashcheckfunc: self._shutdown() return self.controller.hashchecksched(self.hash) def saveAs(self, name, length, saveas, isdir): return self.controller.saveAs(self.hash, name, saveas, isdir) def hashcheck_start(self, donefunc): if self.is_dead(): self._shutdown() return self.waiting = False self.checking = True self._hashcheckfunc(donefunc) def hashcheck_callback(self): self.checking = False if self.is_dead(): self._shutdown() return if not self.d.startEngine(ratelimiter = self.controller.ratelimiter): self._shutdown() return self.d.startRerequester() self.statsfunc = self.d.startStats() self.rawserver.start_listening(self.d.getPortHandler()) self.working = True def is_dead(self): return self.doneflag.isSet() def _shutdown(self): self.shutdown(False) def shutdown(self, quiet=True): if self.closed: return self.doneflag.set() self.rawserver.shutdown() if self.checking or self.working: self.d.shutdown() self.waiting = False self.checking = False self.working = False self.closed = True self.controller.was_stopped(self.hash) if not quiet: self.controller.died(self.hash) def display(self, activity = None, fractionDone = None): # really only used by StorageWrapper now if activity: self.status_msg = activity if fractionDone is not None: self.status_done = float(fractionDone) def finished(self): self.seed = True def error(self, msg): if self.doneflag.isSet(): self._shutdown() self.status_err.append(msg) self.status_errtime = clock() class LaunchMany: def __init__(self, config, Output): try: self.config = config self.Output = Output self.torrent_dir = config['torrent_dir'] self.torrent_cache = {} self.file_cache = {} self.blocked_files = {} self.scan_period = config['parse_dir_interval'] self.stats_period = config['display_interval'] self.torrent_list = [] self.downloads = {} self.counter = 0 self.doneflag = Event() self.hashcheck_queue = [] self.hashcheck_current = None self.rawserver = RawServer(self.doneflag, config['timeout_check_interval'], config['timeout'], ipv6_enable = config['ipv6_enabled'], failfunc = self.failed, errorfunc = self.exchandler) upnp_type = UPnP_test(config['upnp_nat_access']) while True: try: self.listen_port = self.rawserver.find_and_bind( config['minport'], config['maxport'], config['bind'], ipv6_socket_style = config['ipv6_binds_v4'], upnp = upnp_type, randomizer = config['random_port']) break except socketerror, e: if upnp_type and e == UPnP_ERROR: self.Output.message('WARNING: COULD NOT FORWARD VIA UPnP') upnp_type = 0 continue self.failed("Couldn't listen - " + str(e)) return self.ratelimiter = RateLimiter(self.rawserver.add_task, config['upload_unit_size']) self.ratelimiter.set_upload_rate(config['max_upload_rate']) self.handler = MultiHandler(self.rawserver, self.doneflag) seed(createPeerID()) self.rawserver.add_task(self.scan, 0) self.rawserver.add_task(self.stats, 0) self.handler.listen_forever() self.Output.message('shutting down') self.hashcheck_queue = [] for hash in self.torrent_list: self.Output.message('dropped "'+self.torrent_cache[hash]['path']+'"') self.downloads[hash].shutdown() self.rawserver.shutdown() except: data = StringIO() print_exc(file = data) Output.exception(data.getvalue()) def scan(self): self.rawserver.add_task(self.scan, self.scan_period) r = parsedir(self.torrent_dir, self.torrent_cache, self.file_cache, self.blocked_files, return_metainfo = True, errfunc = self.Output.message) ( self.torrent_cache, self.file_cache, self.blocked_files, added, removed ) = r for hash, data in removed.items(): self.Output.message('dropped "'+data['path']+'"') self.remove(hash) for hash, data in added.items(): self.Output.message('added "'+data['path']+'"') self.add(hash, data) def stats(self): self.rawserver.add_task(self.stats, self.stats_period) data = [] for hash in self.torrent_list: cache = self.torrent_cache[hash] if self.config['display_path']: name = cache['path'] else: name = cache['name'] size = cache['length'] d = self.downloads[hash] progress = '0.0%' peers = 0 seeds = 0 seedsmsg = "S" dist = 0.0 uprate = 0.0 dnrate = 0.0 upamt = 0 dnamt = 0 t = 0 if d.is_dead(): status = 'stopped' elif d.waiting: status = 'waiting for hash check' elif d.checking: status = d.status_msg progress = '%.1f%%' % (d.status_done*100) else: stats = d.statsfunc() s = stats['stats'] if d.seed: status = 'seeding' progress = '100.0%' seeds = s.numOldSeeds seedsmsg = "s" dist = s.numCopies else: if s.numSeeds + s.numPeers: t = stats['time'] if t == 0: # unlikely t = 0.01 status = fmttime(t) else: t = -1 status = 'connecting to peers' progress = '%.1f%%' % (int(stats['frac']*1000)/10.0) seeds = s.numSeeds dist = s.numCopies2 dnrate = stats['down'] peers = s.numPeers uprate = stats['up'] upamt = s.upTotal dnamt = s.downTotal if d.is_dead() or d.status_errtime+300 > clock(): msg = d.status_err[-1] else: msg = '' data.append(( name, status, progress, peers, seeds, seedsmsg, dist, uprate, dnrate, upamt, dnamt, size, t, msg )) stop = self.Output.display(data) if stop: self.doneflag.set() def remove(self, hash): self.torrent_list.remove(hash) self.downloads[hash].shutdown() del self.downloads[hash] def add(self, hash, data): c = self.counter self.counter += 1 x = '' for i in xrange(3): x = mapbase64[c & 0x3F]+x c >>= 6 peer_id = createPeerID(x) d = SingleDownload(self, hash, data['metainfo'], self.config, peer_id) self.torrent_list.append(hash) self.downloads[hash] = d d.start() def saveAs(self, hash, name, saveas, isdir): x = self.torrent_cache[hash] style = self.config['saveas_style'] if style == 1 or style == 3: if saveas: saveas = os.path.join(saveas,x['file'][:-1-len(x['type'])]) else: saveas = x['path'][:-1-len(x['type'])] if style == 3: if not os.path.isdir(saveas): try: os.mkdir(saveas) except: raise OSError("couldn't create directory for "+x['path'] +" ("+saveas+")") if not isdir: saveas = os.path.join(saveas, name) else: if saveas: saveas = os.path.join(saveas, name) else: saveas = os.path.join(os.path.split(x['path'])[0], name) if isdir and not os.path.isdir(saveas): try: os.mkdir(saveas) except: raise OSError("couldn't create directory for "+x['path'] +" ("+saveas+")") return saveas def hashchecksched(self, hash = None): if hash: self.hashcheck_queue.append(hash) if not self.hashcheck_current: self._hashcheck_start() def _hashcheck_start(self): self.hashcheck_current = self.hashcheck_queue.pop(0) self.downloads[self.hashcheck_current].hashcheck_start(self.hashcheck_callback) def hashcheck_callback(self): self.downloads[self.hashcheck_current].hashcheck_callback() if self.hashcheck_queue: self._hashcheck_start() else: self.hashcheck_current = None def died(self, hash): if self.torrent_cache.has_key(hash): self.Output.message('DIED: "'+self.torrent_cache[hash]['path']+'"') def was_stopped(self, hash): try: self.hashcheck_queue.remove(hash) except: pass if self.hashcheck_current == hash: self.hashcheck_current = None if self.hashcheck_queue: self._hashcheck_start() def failed(self, s): self.Output.message('FAILURE: '+s) def exchandler(self, s): self.Output.exception(s) armory-0.92.3/BitTornado/ServerPortHandler.py0000644000000000000000000001331312414772654017661 0ustar rootroot# Written by John Hoffman # see LICENSE.txt for license information from cStringIO import StringIO #from RawServer import RawServer try: True except: True = 1 False = 0 from BT1.Encrypter import protocol_name default_task_id = [] class SingleRawServer: def __init__(self, info_hash, multihandler, doneflag, protocol): self.info_hash = info_hash self.doneflag = doneflag self.protocol = protocol self.multihandler = multihandler self.rawserver = multihandler.rawserver self.finished = False self.running = False self.handler = None self.taskqueue = [] def shutdown(self): if not self.finished: self.multihandler.shutdown_torrent(self.info_hash) def _shutdown(self): if not self.finished: self.finished = True self.running = False self.rawserver.kill_tasks(self.info_hash) if self.handler: self.handler.close_all() def _external_connection_made(self, c, options, already_read): if self.running: c.set_handler(self.handler) self.handler.externally_handshaked_connection_made( c, options, already_read) ### RawServer functions ### def add_task(self, func, delay=0, id = default_task_id): if id is default_task_id: id = self.info_hash if not self.finished: self.rawserver.add_task(func, delay, id) # def bind(self, port, bind = '', reuse = False): # pass # not handled here def start_connection(self, dns, handler = None): if not handler: handler = self.handler c = self.rawserver.start_connection(dns, handler) return c # def listen_forever(self, handler): # pass # don't call with this def start_listening(self, handler): self.handler = handler self.running = True return self.shutdown # obviously, doesn't listen forever def is_finished(self): return self.finished def get_exception_flag(self): return self.rawserver.get_exception_flag() class NewSocketHandler: # hand a new socket off where it belongs def __init__(self, multihandler, connection): self.multihandler = multihandler self.connection = connection connection.set_handler(self) self.closed = False self.buffer = StringIO() self.complete = False self.next_len, self.next_func = 1, self.read_header_len self.multihandler.rawserver.add_task(self._auto_close, 15) def _auto_close(self): if not self.complete: self.close() def close(self): if not self.closed: self.connection.close() self.closed = True # header format: # connection.write(chr(len(protocol_name)) + protocol_name + # (chr(0) * 8) + self.encrypter.download_id + self.encrypter.my_id) # copied from Encrypter and modified def read_header_len(self, s): l = ord(s) return l, self.read_header def read_header(self, s): self.protocol = s return 8, self.read_reserved def read_reserved(self, s): self.options = s return 20, self.read_download_id def read_download_id(self, s): if self.multihandler.singlerawservers.has_key(s): if self.multihandler.singlerawservers[s].protocol == self.protocol: return True return None def read_dead(self, s): return None def data_came_in(self, garbage, s): while True: if self.closed: return i = self.next_len - self.buffer.tell() if i > len(s): self.buffer.write(s) return self.buffer.write(s[:i]) s = s[i:] m = self.buffer.getvalue() self.buffer.reset() self.buffer.truncate() try: x = self.next_func(m) except: self.next_len, self.next_func = 1, self.read_dead raise if x is None: self.close() return if x == True: # ready to process self.multihandler.singlerawservers[m]._external_connection_made( self.connection, self.options, s) self.complete = True return self.next_len, self.next_func = x def connection_flushed(self, ss): pass def connection_lost(self, ss): self.closed = True class MultiHandler: def __init__(self, rawserver, doneflag): self.rawserver = rawserver self.masterdoneflag = doneflag self.singlerawservers = {} self.connections = {} self.taskqueues = {} def newRawServer(self, info_hash, doneflag, protocol=protocol_name): new = SingleRawServer(info_hash, self, doneflag, protocol) self.singlerawservers[info_hash] = new return new def shutdown_torrent(self, info_hash): self.singlerawservers[info_hash]._shutdown() del self.singlerawservers[info_hash] def listen_forever(self): self.rawserver.listen_forever(self) for srs in self.singlerawservers.values(): srs.finished = True srs.running = False srs.doneflag.set() ### RawServer handler functions ### # be wary of name collisions def external_connection_made(self, ss): NewSocketHandler(self, ss) armory-0.92.3/BitTornado/RateLimiter.py0000644000000000000000000001142112414772654016467 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from traceback import print_exc from binascii import b2a_hex from clock import clock from CurrentRateMeasure import Measure from cStringIO import StringIO from math import sqrt try: True except: True = 1 False = 0 try: sum([1]) except: sum = lambda a: reduce(lambda x,y: x+y, a, 0) DEBUG = False MAX_RATE_PERIOD = 20.0 MAX_RATE = 10e10 PING_BOUNDARY = 1.2 PING_SAMPLES = 7 PING_DISCARDS = 1 PING_THRESHHOLD = 5 PING_DELAY = 5 # cycles 'til first upward adjustment PING_DELAY_NEXT = 2 # 'til next ADJUST_UP = 1.05 ADJUST_DOWN = 0.95 UP_DELAY_FIRST = 5 UP_DELAY_NEXT = 2 SLOTS_STARTING = 6 SLOTS_FACTOR = 1.66/1000 class RateLimiter: def __init__(self, sched, unitsize, slotsfunc = lambda x: None): self.sched = sched self.last = None self.unitsize = unitsize self.slotsfunc = slotsfunc self.measure = Measure(MAX_RATE_PERIOD) self.autoadjust = False self.upload_rate = MAX_RATE * 1000 self.slots = SLOTS_STARTING # garbage if not automatic def set_upload_rate(self, rate): # rate = -1 # test automatic if rate < 0: if self.autoadjust: return self.autoadjust = True self.autoadjustup = 0 self.pings = [] rate = MAX_RATE self.slots = SLOTS_STARTING self.slotsfunc(self.slots) else: self.autoadjust = False if not rate: rate = MAX_RATE self.upload_rate = rate * 1000 self.lasttime = clock() self.bytes_sent = 0 def queue(self, conn): assert conn.next_upload is None if self.last is None: self.last = conn conn.next_upload = conn self.try_send(True) else: conn.next_upload = self.last.next_upload self.last.next_upload = conn self.last = conn def try_send(self, check_time = False): t = clock() self.bytes_sent -= (t - self.lasttime) * self.upload_rate self.lasttime = t if check_time: self.bytes_sent = max(self.bytes_sent, 0) cur = self.last.next_upload while self.bytes_sent <= 0: bytes = cur.send_partial(self.unitsize) self.bytes_sent += bytes self.measure.update_rate(bytes) if bytes == 0 or cur.backlogged(): if self.last is cur: self.last = None cur.next_upload = None break else: self.last.next_upload = cur.next_upload cur.next_upload = None cur = self.last.next_upload else: self.last = cur cur = cur.next_upload else: self.sched(self.try_send, self.bytes_sent / self.upload_rate) def adjust_sent(self, bytes): self.bytes_sent = min(self.bytes_sent+bytes, self.upload_rate*3) self.measure.update_rate(bytes) def ping(self, delay): if DEBUG: print delay if not self.autoadjust: return self.pings.append(delay > PING_BOUNDARY) if len(self.pings) < PING_SAMPLES+PING_DISCARDS: return if DEBUG: print 'cycle' pings = sum(self.pings[PING_DISCARDS:]) del self.pings[:] if pings >= PING_THRESHHOLD: # assume flooded if self.upload_rate == MAX_RATE: self.upload_rate = self.measure.get_rate()*ADJUST_DOWN else: self.upload_rate = min(self.upload_rate, self.measure.get_rate()*1.1) self.upload_rate = max(int(self.upload_rate*ADJUST_DOWN),2) self.slots = int(sqrt(self.upload_rate*SLOTS_FACTOR)) self.slotsfunc(self.slots) if DEBUG: print 'adjust down to '+str(self.upload_rate) self.lasttime = clock() self.bytes_sent = 0 self.autoadjustup = UP_DELAY_FIRST else: # not flooded if self.upload_rate == MAX_RATE: return self.autoadjustup -= 1 if self.autoadjustup: return self.upload_rate = int(self.upload_rate*ADJUST_UP) self.slots = int(sqrt(self.upload_rate*SLOTS_FACTOR)) self.slotsfunc(self.slots) if DEBUG: print 'adjust up to '+str(self.upload_rate) self.lasttime = clock() self.bytes_sent = 0 self.autoadjustup = UP_DELAY_NEXT armory-0.92.3/BitTornado/HTTPHandler.py0000644000000000000000000001313012414772654016322 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from cStringIO import StringIO from sys import stdout import time from clock import clock from gzip import GzipFile try: True except: True = 1 False = 0 DEBUG = False weekdays = ['Mon', 'Tue', 'Wed', 'Thu', 'Fri', 'Sat', 'Sun'] months = [None, 'Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec'] class HTTPConnection: def __init__(self, handler, connection): self.handler = handler self.connection = connection self.buf = '' self.closed = False self.done = False self.donereading = False self.next_func = self.read_type def get_ip(self): return self.connection.get_ip() def data_came_in(self, data): if self.donereading or self.next_func is None: return True self.buf += data while True: try: i = self.buf.index('\n') except ValueError: return True val = self.buf[:i] self.buf = self.buf[i+1:] self.next_func = self.next_func(val) if self.donereading: return True if self.next_func is None or self.closed: return False def read_type(self, data): self.header = data.strip() words = data.split() if len(words) == 3: self.command, self.path, garbage = words self.pre1 = False elif len(words) == 2: self.command, self.path = words self.pre1 = True if self.command != 'GET': return None else: return None if self.command not in ('HEAD', 'GET'): return None self.headers = {} return self.read_header def read_header(self, data): data = data.strip() if data == '': self.donereading = True if self.headers.get('accept-encoding','').find('gzip') > -1: self.encoding = 'gzip' else: self.encoding = 'identity' r = self.handler.getfunc(self, self.path, self.headers) if r is not None: self.answer(r) return None try: i = data.index(':') except ValueError: return None self.headers[data[:i].strip().lower()] = data[i+1:].strip() if DEBUG: print data[:i].strip() + ": " + data[i+1:].strip() return self.read_header def answer(self, (responsecode, responsestring, headers, data)): if self.closed: return if self.encoding == 'gzip': compressed = StringIO() gz = GzipFile(fileobj = compressed, mode = 'wb', compresslevel = 9) gz.write(data) gz.close() cdata = compressed.getvalue() if len(cdata) >= len(data): self.encoding = 'identity' else: if DEBUG: print "Compressed: %i Uncompressed: %i\n" % (len(cdata),len(data)) data = cdata headers['Content-Encoding'] = 'gzip' # i'm abusing the identd field here, but this should be ok if self.encoding == 'identity': ident = '-' else: ident = self.encoding self.handler.log( self.connection.get_ip(), ident, '-', self.header, responsecode, len(data), self.headers.get('referer','-'), self.headers.get('user-agent','-') ) self.done = True r = StringIO() r.write('HTTP/1.0 ' + str(responsecode) + ' ' + responsestring + '\r\n') if not self.pre1: headers['Content-Length'] = len(data) for key, value in headers.items(): r.write(key + ': ' + str(value) + '\r\n') r.write('\r\n') if self.command != 'HEAD': r.write(data) self.connection.write(r.getvalue()) if self.connection.is_flushed(): self.connection.shutdown(1) class HTTPHandler: def __init__(self, getfunc, minflush): self.connections = {} self.getfunc = getfunc self.minflush = minflush self.lastflush = clock() def external_connection_made(self, connection): self.connections[connection] = HTTPConnection(self, connection) def connection_flushed(self, connection): if self.connections[connection].done: connection.shutdown(1) def connection_lost(self, connection): ec = self.connections[connection] ec.closed = True del ec.connection del ec.next_func del self.connections[connection] def data_came_in(self, connection, data): c = self.connections[connection] if not c.data_came_in(data) and not c.closed: c.connection.shutdown(1) def log(self, ip, ident, username, header, responsecode, length, referrer, useragent): year, month, day, hour, minute, second, a, b, c = time.localtime(time.time()) print '%s %s %s [%02d/%3s/%04d:%02d:%02d:%02d] "%s" %i %i "%s" "%s"' % ( ip, ident, username, day, months[month], year, hour, minute, second, header, responsecode, length, referrer, useragent) t = clock() if t - self.lastflush > self.minflush: self.lastflush = t stdout.flush() armory-0.92.3/BitTornado/SocketHandler.py0000644000000000000000000003161612414772654017004 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information import socket from errno import EWOULDBLOCK, ECONNREFUSED, EHOSTUNREACH try: from select import poll, error, POLLIN, POLLOUT, POLLERR, POLLHUP timemult = 1000 except ImportError: from selectpoll import poll, error, POLLIN, POLLOUT, POLLERR, POLLHUP timemult = 1 from time import sleep from clock import clock import sys from random import shuffle, randrange from natpunch import UPnP_open_port, UPnP_close_port # from BT1.StreamCheck import StreamCheck # import inspect try: True except: True = 1 False = 0 all = POLLIN | POLLOUT UPnP_ERROR = "unable to forward port via UPnP" class SingleSocket: def __init__(self, socket_handler, sock, handler, ip = None): self.socket_handler = socket_handler self.socket = sock self.handler = handler self.buffer = [] self.last_hit = clock() self.fileno = sock.fileno() self.connected = False self.skipped = 0 # self.check = StreamCheck() try: self.ip = self.socket.getpeername()[0] except: if ip is None: self.ip = 'unknown' else: self.ip = ip def get_ip(self, real=False): if real: try: self.ip = self.socket.getpeername()[0] except: pass return self.ip def close(self): ''' for x in xrange(5,0,-1): try: f = inspect.currentframe(x).f_code print (f.co_filename,f.co_firstlineno,f.co_name) del f except: pass print '' ''' assert self.socket self.connected = False sock = self.socket self.socket = None self.buffer = [] del self.socket_handler.single_sockets[self.fileno] self.socket_handler.poll.unregister(sock) sock.close() def shutdown(self, val): self.socket.shutdown(val) def is_flushed(self): return not self.buffer def write(self, s): # self.check.write(s) assert self.socket is not None self.buffer.append(s) if len(self.buffer) == 1: self.try_write() def try_write(self): if self.connected: dead = False try: while self.buffer: buf = self.buffer[0] amount = self.socket.send(buf) if amount == 0: self.skipped += 1 break self.skipped = 0 if amount != len(buf): self.buffer[0] = buf[amount:] break del self.buffer[0] except socket.error, e: try: dead = e[0] != EWOULDBLOCK except: dead = True self.skipped += 1 if self.skipped >= 3: dead = True if dead: self.socket_handler.dead_from_write.append(self) return if self.buffer: self.socket_handler.poll.register(self.socket, all) else: self.socket_handler.poll.register(self.socket, POLLIN) def set_handler(self, handler): self.handler = handler class SocketHandler: def __init__(self, timeout, ipv6_enable, readsize = 100000): self.timeout = timeout self.ipv6_enable = ipv6_enable self.readsize = readsize self.poll = poll() # {socket: SingleSocket} self.single_sockets = {} self.dead_from_write = [] self.max_connects = 1000 self.port_forwarded = None self.servers = {} def scan_for_timeouts(self): t = clock() - self.timeout tokill = [] for s in self.single_sockets.values(): if s.last_hit < t: tokill.append(s) for k in tokill: if k.socket is not None: self._close_socket(k) def bind(self, port, bind = '', reuse = False, ipv6_socket_style = 1, upnp = 0): port = int(port) addrinfos = [] self.servers = {} self.interfaces = [] # if bind != "" thread it as a comma seperated list and bind to all # addresses (can be ips or hostnames) else bind to default ipv6 and # ipv4 address if bind: if self.ipv6_enable: socktype = socket.AF_UNSPEC else: socktype = socket.AF_INET bind = bind.split(',') for addr in bind: if sys.version_info < (2,2): addrinfos.append((socket.AF_INET, None, None, None, (addr, port))) else: addrinfos.extend(socket.getaddrinfo(addr, port, socktype, socket.SOCK_STREAM)) else: if self.ipv6_enable: addrinfos.append([socket.AF_INET6, None, None, None, ('', port)]) if not addrinfos or ipv6_socket_style != 0: addrinfos.append([socket.AF_INET, None, None, None, ('', port)]) for addrinfo in addrinfos: try: server = socket.socket(addrinfo[0], socket.SOCK_STREAM) if reuse: server.setsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR, 1) server.setblocking(0) server.bind(addrinfo[4]) self.servers[server.fileno()] = server if bind: self.interfaces.append(server.getsockname()[0]) server.listen(64) self.poll.register(server, POLLIN) except socket.error, e: for server in self.servers.values(): try: server.close() except: pass if self.ipv6_enable and ipv6_socket_style == 0 and self.servers: raise socket.error('blocked port (may require ipv6_binds_v4 to be set)') raise socket.error(str(e)) if not self.servers: raise socket.error('unable to open server port') if upnp: if not UPnP_open_port(port): for server in self.servers.values(): try: server.close() except: pass self.servers = None self.interfaces = None raise socket.error(UPnP_ERROR) self.port_forwarded = port self.port = port def find_and_bind(self, minport, maxport, bind = '', reuse = False, ipv6_socket_style = 1, upnp = 0, randomizer = False): e = 'maxport less than minport - no ports to check' if maxport-minport < 50 or not randomizer: portrange = range(minport, maxport+1) if randomizer: shuffle(portrange) portrange = portrange[:20] # check a maximum of 20 ports else: portrange = [] while len(portrange) < 20: listen_port = randrange(minport, maxport+1) if not listen_port in portrange: portrange.append(listen_port) for listen_port in portrange: try: self.bind(listen_port, bind, ipv6_socket_style = ipv6_socket_style, upnp = upnp) return listen_port except socket.error, e: pass raise socket.error(str(e)) def set_handler(self, handler): self.handler = handler def start_connection_raw(self, dns, socktype = socket.AF_INET, handler = None): if handler is None: handler = self.handler sock = socket.socket(socktype, socket.SOCK_STREAM) sock.setblocking(0) try: sock.connect_ex(dns) except socket.error: raise except Exception, e: raise socket.error(str(e)) self.poll.register(sock, POLLIN) s = SingleSocket(self, sock, handler, dns[0]) self.single_sockets[sock.fileno()] = s return s def start_connection(self, dns, handler = None, randomize = False): if handler is None: handler = self.handler if sys.version_info < (2,2): s = self.start_connection_raw(dns,socket.AF_INET,handler) else: if self.ipv6_enable: socktype = socket.AF_UNSPEC else: socktype = socket.AF_INET try: addrinfos = socket.getaddrinfo(dns[0], int(dns[1]), socktype, socket.SOCK_STREAM) except socket.error, e: raise except Exception, e: raise socket.error(str(e)) if randomize: shuffle(addrinfos) for addrinfo in addrinfos: try: s = self.start_connection_raw(addrinfo[4],addrinfo[0],handler) break except: pass else: raise socket.error('unable to connect') return s def _sleep(self): sleep(1) def handle_events(self, events): for sock, event in events: s = self.servers.get(sock) if s: if event & (POLLHUP | POLLERR) != 0: self.poll.unregister(s) s.close() del self.servers[sock] print "lost server socket" elif len(self.single_sockets) < self.max_connects: try: newsock, addr = s.accept() newsock.setblocking(0) nss = SingleSocket(self, newsock, self.handler) self.single_sockets[newsock.fileno()] = nss self.poll.register(newsock, POLLIN) self.handler.external_connection_made(nss) except socket.error: self._sleep() else: s = self.single_sockets.get(sock) if not s: continue s.connected = True if (event & (POLLHUP | POLLERR)): self._close_socket(s) continue if (event & POLLIN): try: s.last_hit = clock() data = s.socket.recv(100000) if not data: self._close_socket(s) else: s.handler.data_came_in(s, data) except socket.error, e: code, msg = e if code != EWOULDBLOCK: self._close_socket(s) continue if (event & POLLOUT) and s.socket and not s.is_flushed(): s.try_write() if s.is_flushed(): s.handler.connection_flushed(s) def close_dead(self): while self.dead_from_write: old = self.dead_from_write self.dead_from_write = [] for s in old: if s.socket: self._close_socket(s) def _close_socket(self, s): s.close() s.handler.connection_lost(s) def do_poll(self, t): r = self.poll.poll(t*timemult) if r is None: connects = len(self.single_sockets) to_close = int(connects*0.05)+1 # close 5% of sockets self.max_connects = connects-to_close closelist = self.single_sockets.values() shuffle(closelist) closelist = closelist[:to_close] for sock in closelist: self._close_socket(sock) return [] return r def get_stats(self): return { 'interfaces': self.interfaces, 'port': self.port, 'upnp': self.port_forwarded is not None } def shutdown(self): for ss in self.single_sockets.values(): try: ss.close() except: pass for server in self.servers.values(): try: server.close() except: pass if self.port_forwarded is not None: UPnP_close_port(self.port_forwarded) armory-0.92.3/BitTornado/piecebuffer.py0000644000000000000000000000365412414772654016536 0ustar rootroot# Written by John Hoffman # see LICENSE.txt for license information from array import array from threading import Lock # import inspect try: True except: True = 1 False = 0 DEBUG = False class SingleBuffer: def __init__(self, pool): self.pool = pool self.buf = array('c') def init(self): if DEBUG: print self.count ''' for x in xrange(6,1,-1): try: f = inspect.currentframe(x).f_code print (f.co_filename,f.co_firstlineno,f.co_name) del f except: pass print '' ''' self.length = 0 def append(self, s): l = self.length+len(s) self.buf[self.length:l] = array('c',s) self.length = l def __len__(self): return self.length def __getslice__(self, a, b): if b > self.length: b = self.length if b < 0: b += self.length if a == 0 and b == self.length and len(self.buf) == b: return self.buf # optimization return self.buf[a:b] def getarray(self): return self.buf[:self.length] def release(self): if DEBUG: print -self.count self.pool.release(self) class BufferPool: def __init__(self): self.pool = [] self.lock = Lock() if DEBUG: self.count = 0 def new(self): self.lock.acquire() if self.pool: x = self.pool.pop() else: x = SingleBuffer(self) if DEBUG: self.count += 1 x.count = self.count x.init() self.lock.release() return x def release(self, x): self.pool.append(x) _pool = BufferPool() PieceBuffer = _pool.new armory-0.92.3/BitTornado/bencode.py0000644000000000000000000001735712414772654015663 0ustar rootroot# Written by Petru Paler, Uoti Urpala, Ross Cohen and John Hoffman # see LICENSE.txt for license information from types import IntType, LongType, StringType, ListType, TupleType, DictType try: from types import BooleanType except ImportError: BooleanType = None try: from types import UnicodeType except ImportError: UnicodeType = None from cStringIO import StringIO def decode_int(x, f): f += 1 newf = x.index('e', f) try: n = int(x[f:newf]) except: n = long(x[f:newf]) if x[f] == '-': if x[f + 1] == '0': raise ValueError elif x[f] == '0' and newf != f+1: raise ValueError return (n, newf+1) def decode_string(x, f): colon = x.index(':', f) try: n = int(x[f:colon]) except (OverflowError, ValueError): n = long(x[f:colon]) if x[f] == '0' and colon != f+1: raise ValueError colon += 1 return (x[colon:colon+n], colon+n) def decode_unicode(x, f): s, f = decode_string(x, f+1) return (s.decode('UTF-8'),f) def decode_list(x, f): r, f = [], f+1 while x[f] != 'e': v, f = decode_func[x[f]](x, f) r.append(v) return (r, f + 1) def decode_dict(x, f): r, f = {}, f+1 lastkey = None while x[f] != 'e': k, f = decode_string(x, f) if lastkey >= k: raise ValueError lastkey = k r[k], f = decode_func[x[f]](x, f) return (r, f + 1) decode_func = {} decode_func['l'] = decode_list decode_func['d'] = decode_dict decode_func['i'] = decode_int decode_func['0'] = decode_string decode_func['1'] = decode_string decode_func['2'] = decode_string decode_func['3'] = decode_string decode_func['4'] = decode_string decode_func['5'] = decode_string decode_func['6'] = decode_string decode_func['7'] = decode_string decode_func['8'] = decode_string decode_func['9'] = decode_string #decode_func['u'] = decode_unicode def bdecode(x, sloppy = 0): try: r, l = decode_func[x[0]](x, 0) # except (IndexError, KeyError): except (IndexError, KeyError, ValueError): raise ValueError, "bad bencoded data" if not sloppy and l != len(x): raise ValueError, "bad bencoded data" return r def test_bdecode(): try: bdecode('0:0:') assert 0 except ValueError: pass try: bdecode('ie') assert 0 except ValueError: pass try: bdecode('i341foo382e') assert 0 except ValueError: pass assert bdecode('i4e') == 4L assert bdecode('i0e') == 0L assert bdecode('i123456789e') == 123456789L assert bdecode('i-10e') == -10L try: bdecode('i-0e') assert 0 except ValueError: pass try: bdecode('i123') assert 0 except ValueError: pass try: bdecode('') assert 0 except ValueError: pass try: bdecode('i6easd') assert 0 except ValueError: pass try: bdecode('35208734823ljdahflajhdf') assert 0 except ValueError: pass try: bdecode('2:abfdjslhfld') assert 0 except ValueError: pass assert bdecode('0:') == '' assert bdecode('3:abc') == 'abc' assert bdecode('10:1234567890') == '1234567890' try: bdecode('02:xy') assert 0 except ValueError: pass try: bdecode('l') assert 0 except ValueError: pass assert bdecode('le') == [] try: bdecode('leanfdldjfh') assert 0 except ValueError: pass assert bdecode('l0:0:0:e') == ['', '', ''] try: bdecode('relwjhrlewjh') assert 0 except ValueError: pass assert bdecode('li1ei2ei3ee') == [1, 2, 3] assert bdecode('l3:asd2:xye') == ['asd', 'xy'] assert bdecode('ll5:Alice3:Bobeli2ei3eee') == [['Alice', 'Bob'], [2, 3]] try: bdecode('d') assert 0 except ValueError: pass try: bdecode('defoobar') assert 0 except ValueError: pass assert bdecode('de') == {} assert bdecode('d3:agei25e4:eyes4:bluee') == {'age': 25, 'eyes': 'blue'} assert bdecode('d8:spam.mp3d6:author5:Alice6:lengthi100000eee') == {'spam.mp3': {'author': 'Alice', 'length': 100000}} try: bdecode('d3:fooe') assert 0 except ValueError: pass try: bdecode('di1e0:e') assert 0 except ValueError: pass try: bdecode('d1:b0:1:a0:e') assert 0 except ValueError: pass try: bdecode('d1:a0:1:a0:e') assert 0 except ValueError: pass try: bdecode('i03e') assert 0 except ValueError: pass try: bdecode('l01:ae') assert 0 except ValueError: pass try: bdecode('9999:x') assert 0 except ValueError: pass try: bdecode('l0:') assert 0 except ValueError: pass try: bdecode('d0:0:') assert 0 except ValueError: pass try: bdecode('d0:') assert 0 except ValueError: pass bencached_marker = [] class Bencached: def __init__(self, s): self.marker = bencached_marker self.bencoded = s BencachedType = type(Bencached('')) # insufficient, but good as a filter def encode_bencached(x,r): assert x.marker == bencached_marker r.append(x.bencoded) def encode_int(x,r): r.extend(('i',str(x),'e')) def encode_bool(x,r): encode_int(int(x),r) def encode_string(x,r): r.extend((str(len(x)),':',x)) def encode_unicode(x,r): #r.append('u') encode_string(x.encode('UTF-8'),r) def encode_list(x,r): r.append('l') for e in x: encode_func[type(e)](e, r) r.append('e') def encode_dict(x,r): r.append('d') ilist = x.items() ilist.sort() for k,v in ilist: r.extend((str(len(k)),':',k)) encode_func[type(v)](v, r) r.append('e') encode_func = {} encode_func[BencachedType] = encode_bencached encode_func[IntType] = encode_int encode_func[LongType] = encode_int encode_func[StringType] = encode_string encode_func[ListType] = encode_list encode_func[TupleType] = encode_list encode_func[DictType] = encode_dict if BooleanType: encode_func[BooleanType] = encode_bool if UnicodeType: encode_func[UnicodeType] = encode_unicode def bencode(x): r = [] try: encode_func[type(x)](x, r) except: print "*** error *** could not encode type %s (value: %s)" % (type(x), x) assert 0 return ''.join(r) def test_bencode(): assert bencode(4) == 'i4e' assert bencode(0) == 'i0e' assert bencode(-10) == 'i-10e' assert bencode(12345678901234567890L) == 'i12345678901234567890e' assert bencode('') == '0:' assert bencode('abc') == '3:abc' assert bencode('1234567890') == '10:1234567890' assert bencode([]) == 'le' assert bencode([1, 2, 3]) == 'li1ei2ei3ee' assert bencode([['Alice', 'Bob'], [2, 3]]) == 'll5:Alice3:Bobeli2ei3eee' assert bencode({}) == 'de' assert bencode({'age': 25, 'eyes': 'blue'}) == 'd3:agei25e4:eyes4:bluee' assert bencode({'spam.mp3': {'author': 'Alice', 'length': 100000}}) == 'd8:spam.mp3d6:author5:Alice6:lengthi100000eee' try: bencode({1: 'foo'}) assert 0 except AssertionError: pass try: import psyco psyco.bind(bdecode) psyco.bind(bencode) except ImportError: pass armory-0.92.3/BitTornado/RawServer.py0000644000000000000000000001510712414772654016173 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from bisect import insort from SocketHandler import SocketHandler, UPnP_ERROR import socket from cStringIO import StringIO from traceback import print_exc from select import error from threading import Thread, Event from time import sleep from clock import clock import sys try: True except: True = 1 False = 0 def autodetect_ipv6(): try: assert sys.version_info >= (2,3) assert socket.has_ipv6 socket.socket(socket.AF_INET6, socket.SOCK_STREAM) except: return 0 return 1 def autodetect_socket_style(): if sys.platform.find('linux') < 0: return 1 else: try: f = open('/proc/sys/net/ipv6/bindv6only','r') dual_socket_style = int(f.read()) f.close() return int(not dual_socket_style) except: return 0 READSIZE = 100000 class RawServer: def __init__(self, doneflag, timeout_check_interval, timeout, noisy = True, ipv6_enable = True, failfunc = lambda x: None, errorfunc = None, sockethandler = None, excflag = Event()): self.timeout_check_interval = timeout_check_interval self.timeout = timeout self.servers = {} self.single_sockets = {} self.dead_from_write = [] self.doneflag = doneflag self.noisy = noisy self.failfunc = failfunc self.errorfunc = errorfunc self.exccount = 0 self.funcs = [] self.externally_added = [] self.finished = Event() self.tasks_to_kill = [] self.excflag = excflag if sockethandler is None: sockethandler = SocketHandler(timeout, ipv6_enable, READSIZE) self.sockethandler = sockethandler self.add_task(self.scan_for_timeouts, timeout_check_interval) def get_exception_flag(self): return self.excflag def _add_task(self, func, delay, id = None): assert float(delay) >= 0 insort(self.funcs, (clock() + delay, func, id)) def add_task(self, func, delay = 0, id = None): assert float(delay) >= 0 self.externally_added.append((func, delay, id)) def scan_for_timeouts(self): self.add_task(self.scan_for_timeouts, self.timeout_check_interval) self.sockethandler.scan_for_timeouts() def bind(self, port, bind = '', reuse = False, ipv6_socket_style = 1, upnp = False): self.sockethandler.bind(port, bind, reuse, ipv6_socket_style, upnp) def find_and_bind(self, minport, maxport, bind = '', reuse = False, ipv6_socket_style = 1, upnp = 0, randomizer = False): return self.sockethandler.find_and_bind(minport, maxport, bind, reuse, ipv6_socket_style, upnp, randomizer) def start_connection_raw(self, dns, socktype, handler = None): return self.sockethandler.start_connection_raw(dns, socktype, handler) def start_connection(self, dns, handler = None, randomize = False): return self.sockethandler.start_connection(dns, handler, randomize) def get_stats(self): return self.sockethandler.get_stats() def pop_external(self): while self.externally_added: (a, b, c) = self.externally_added.pop(0) self._add_task(a, b, c) def listen_forever(self, handler): self.sockethandler.set_handler(handler) try: while not self.doneflag.isSet(): try: self.pop_external() self._kill_tasks() if self.funcs: period = self.funcs[0][0] + 0.001 - clock() else: period = 2 ** 30 if period < 0: period = 0 events = self.sockethandler.do_poll(period) if self.doneflag.isSet(): return while self.funcs and self.funcs[0][0] <= clock(): garbage1, func, id = self.funcs.pop(0) if id in self.tasks_to_kill: pass try: # print func.func_name func() except (SystemError, MemoryError), e: self.failfunc(str(e)) return except KeyboardInterrupt: # self.exception(True) return except: if self.noisy: self.exception() self.sockethandler.close_dead() self.sockethandler.handle_events(events) if self.doneflag.isSet(): return self.sockethandler.close_dead() except (SystemError, MemoryError), e: self.failfunc(str(e)) return except error: if self.doneflag.isSet(): return except KeyboardInterrupt: # self.exception(True) return except: self.exception() if self.exccount > 10: return finally: # self.sockethandler.shutdown() self.finished.set() def is_finished(self): return self.finished.isSet() def wait_until_finished(self): self.finished.wait() def _kill_tasks(self): if self.tasks_to_kill: new_funcs = [] for (t, func, id) in self.funcs: if id not in self.tasks_to_kill: new_funcs.append((t, func, id)) self.funcs = new_funcs self.tasks_to_kill = [] def kill_tasks(self, id): self.tasks_to_kill.append(id) def exception(self, kbint = False): if not kbint: self.excflag.set() self.exccount += 1 if self.errorfunc is None: print_exc() else: data = StringIO() print_exc(file = data) # print data.getvalue() # report exception here too if not kbint: # don't report here if it's a keyboard interrupt self.errorfunc(data.getvalue()) def shutdown(self): self.sockethandler.shutdown() armory-0.92.3/BitTornado/zurllib.py0000644000000000000000000000630312414772654015734 0ustar rootroot# Written by John Hoffman # see LICENSE.txt for license information from httplib import HTTPConnection, HTTPSConnection, HTTPException from urlparse import urlparse from bencode import bdecode import socket from gzip import GzipFile from StringIO import StringIO from urllib import quote, unquote from __init__ import product_name, version_short VERSION = product_name+'/'+version_short MAX_REDIRECTS = 10 class btHTTPcon(HTTPConnection): # attempt to add automatic connection timeout def connect(self): HTTPConnection.connect(self) try: self.sock.settimeout(30) except: pass class btHTTPScon(HTTPSConnection): # attempt to add automatic connection timeout def connect(self): HTTPSConnection.connect(self) try: self.sock.settimeout(30) except: pass class urlopen: def __init__(self, url): self.tries = 0 self._open(url.strip()) self.error_return = None def _open(self, url): self.tries += 1 if self.tries > MAX_REDIRECTS: raise IOError, ('http error', 500, "Internal Server Error: Redirect Recursion") (scheme, netloc, path, pars, query, fragment) = urlparse(url) if scheme != 'http' and scheme != 'https': raise IOError, ('url error', 'unknown url type', scheme, url) url = path if pars: url += ';'+pars if query: url += '?'+query # if fragment: try: if scheme == 'http': self.connection = btHTTPcon(netloc) else: self.connection = btHTTPScon(netloc) self.connection.request('GET', url, None, { 'User-Agent': VERSION, 'Accept-Encoding': 'gzip' } ) self.response = self.connection.getresponse() except HTTPException, e: raise IOError, ('http error', str(e)) status = self.response.status if status in (301,302): try: self.connection.close() except: pass self._open(self.response.getheader('Location')) return if status != 200: try: data = self._read() d = bdecode(data) if d.has_key('failure reason'): self.error_return = data return except: pass raise IOError, ('http error', status, self.response.reason) def read(self): if self.error_return: return self.error_return return self._read() def _read(self): data = self.response.read() if self.response.getheader('Content-Encoding','').find('gzip') >= 0: try: compressed = StringIO(data) f = GzipFile(fileobj = compressed) data = f.read() except: raise IOError, ('http error', 'got corrupt response') return data def close(self): self.connection.close() armory-0.92.3/BitTornado/__init__.py0000644000000000000000000000273112414772654016011 0ustar rootrootproduct_name = 'BitTornado' version_short = 'T-0.3.17' version = version_short+' ('+product_name+')' report_email = version_short+'@degreez.net' from types import StringType from sha import sha from time import time, clock try: from os import getpid except ImportError: def getpid(): return 1 mapbase64 = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz.-' _idprefix = version_short[0] for subver in version_short[2:].split('.'): try: subver = int(subver) except: subver = 0 _idprefix += mapbase64[subver] _idprefix += ('-' * (6-len(_idprefix))) _idrandom = [None] def resetPeerIDs(): try: f = open('/dev/urandom','rb') x = f.read(20) f.close() except: x = '' l1 = 0 t = clock() while t == clock(): l1 += 1 l2 = 0 t = long(time()*100) while t == long(time()*100): l2 += 1 l3 = 0 if l2 < 1000: t = long(time()*10) while t == long(clock()*10): l3 += 1 x += ( repr(time()) + '/' + str(time()) + '/' + str(l1) + '/' + str(l2) + '/' + str(l3) + '/' + str(getpid()) ) s = '' for i in sha(x).digest()[-11:]: s += mapbase64[ord(i) & 0x3F] _idrandom[0] = s resetPeerIDs() def createPeerID(ins = '---'): assert type(ins) is StringType assert len(ins) == 3 return _idprefix + ins + _idrandom[0] armory-0.92.3/BitTornado/subnetparse.py0000644000000000000000000001253112414772654016604 0ustar rootroot# Written by John Hoffman # see LICENSE.txt for license information from bisect import bisect, insort try: True except: True = 1 False = 0 bool = lambda x: not not x hexbinmap = { '0': '0000', '1': '0001', '2': '0010', '3': '0011', '4': '0100', '5': '0101', '6': '0110', '7': '0111', '8': '1000', '9': '1001', 'a': '1010', 'b': '1011', 'c': '1100', 'd': '1101', 'e': '1110', 'f': '1111', 'x': '0000', } chrbinmap = {} for n in xrange(256): b = [] nn = n for i in xrange(8): if nn & 0x80: b.append('1') else: b.append('0') nn <<= 1 chrbinmap[n] = ''.join(b) def to_bitfield_ipv4(ip): ip = ip.split('.') if len(ip) != 4: raise ValueError, "bad address" b = [] for i in ip: b.append(chrbinmap[int(i)]) return ''.join(b) def to_bitfield_ipv6(ip): b = '' doublecolon = False if ip == '': raise ValueError, "bad address" if ip == '::': # boundary handling ip = '' elif ip[:2] == '::': ip = ip[1:] elif ip[0] == ':': raise ValueError, "bad address" elif ip[-2:] == '::': ip = ip[:-1] elif ip[-1] == ':': raise ValueError, "bad address" for n in ip.split(':'): if n == '': # double-colon if doublecolon: raise ValueError, "bad address" doublecolon = True b += ':' continue if n.find('.') >= 0: # IPv4 n = to_bitfield_ipv4(n) b += n + '0'*(32-len(n)) continue n = ('x'*(4-len(n))) + n for i in n: b += hexbinmap[i] if doublecolon: pos = b.find(':') b = b[:pos]+('0'*(129-len(b)))+b[pos+1:] if len(b) != 128: # always check size raise ValueError, "bad address" return b ipv4addrmask = to_bitfield_ipv6('::ffff:0:0')[:96] class IP_List: def __init__(self): self.ipv4list = [] self.ipv6list = [] def __nonzero__(self): return bool(self.ipv4list or self.ipv6list) def append(self, ip, depth = 256): if ip.find(':') < 0: # IPv4 insort(self.ipv4list,to_bitfield_ipv4(ip)[:depth]) else: b = to_bitfield_ipv6(ip) if b.startswith(ipv4addrmask): insort(self.ipv4list,b[96:][:depth-96]) else: insort(self.ipv6list,b[:depth]) def includes(self, ip): if not (self.ipv4list or self.ipv6list): return False if ip.find(':') < 0: # IPv4 b = to_bitfield_ipv4(ip) else: b = to_bitfield_ipv6(ip) if b.startswith(ipv4addrmask): b = b[96:] if len(b) > 32: l = self.ipv6list else: l = self.ipv4list for map in l[bisect(l,b)-1:]: if b.startswith(map): return True if map > b: return False return False def read_fieldlist(self, file): # reads a list from a file in the format 'ip/len ' f = open(file, 'r') while True: line = f.readline() if not line: break line = line.strip().expandtabs() if not line or line[0] == '#': continue try: line, garbage = line.split(' ',1) except: pass try: line, garbage = line.split('#',1) except: pass try: ip, depth = line.split('/') except: ip = line depth = None try: if depth is not None: depth = int(depth) self.append(ip,depth) except: print '*** WARNING *** could not parse IP range: '+line f.close() def set_intranet_addresses(self): self.append('127.0.0.1',8) self.append('10.0.0.0',8) self.append('172.16.0.0',12) self.append('192.168.0.0',16) self.append('169.254.0.0',16) self.append('::1') self.append('fe80::',16) self.append('fec0::',16) def set_ipv4_addresses(self): self.append('::ffff:0:0',96) def ipv6_to_ipv4(ip): ip = to_bitfield_ipv6(ip) if not ip.startswith(ipv4addrmask): raise ValueError, "not convertible to IPv4" ip = ip[-32:] x = '' for i in range(4): x += str(int(ip[:8],2)) if i < 3: x += '.' ip = ip[8:] return x def to_ipv4(ip): if is_ipv4(ip): _valid_ipv4(ip) return ip return ipv6_to_ipv4(ip) def is_ipv4(ip): return ip.find(':') < 0 def _valid_ipv4(ip): ip = ip.split('.') if len(ip) != 4: raise ValueError for i in ip: chr(int(i)) def is_valid_ip(ip): try: if not ip: return False if is_ipv4(ip): _valid_ipv4(ip) return True to_bitfield_ipv6(ip) return True except: return False armory-0.92.3/BitTornado/inifile.py0000644000000000000000000001103112414772654015662 0ustar rootroot# Written by John Hoffman # see LICENSE.txt for license information ''' reads/writes a Windows-style INI file format: aa = "bb" cc = 11 [eee] ff = "gg" decodes to: d = { '': {'aa':'bb','cc':'11'}, 'eee': {'ff':'gg'} } the encoder can also take this as input: d = { 'aa': 'bb, 'cc': 11, 'eee': {'ff':'gg'} } though it will only decode in the above format. Keywords must be strings. Values that are strings are written surrounded by quotes, and the decoding routine automatically strips any. Booleans are written as integers. Anything else aside from string/int/float may have unpredictable results. ''' from cStringIO import StringIO from traceback import print_exc from types import DictType, StringType try: from types import BooleanType except ImportError: BooleanType = None try: True except: True = 1 False = 0 DEBUG = False def ini_write(f, d, comment=''): try: a = {'':{}} for k,v in d.items(): assert type(k) == StringType k = k.lower() if type(v) == DictType: if DEBUG: print 'new section:' +k if k: assert not a.has_key(k) a[k] = {} aa = a[k] for kk,vv in v: assert type(kk) == StringType kk = kk.lower() assert not aa.has_key(kk) if type(vv) == BooleanType: vv = int(vv) if type(vv) == StringType: vv = '"'+vv+'"' aa[kk] = str(vv) if DEBUG: print 'a['+k+']['+kk+'] = '+str(vv) else: aa = a[''] assert not aa.has_key(k) if type(v) == BooleanType: v = int(v) if type(v) == StringType: v = '"'+v+'"' aa[k] = str(v) if DEBUG: print 'a[\'\']['+k+'] = '+str(v) r = open(f,'w') if comment: for c in comment.split('\n'): r.write('# '+c+'\n') r.write('\n') l = a.keys() l.sort() for k in l: if k: r.write('\n['+k+']\n') aa = a[k] ll = aa.keys() ll.sort() for kk in ll: r.write(kk+' = '+aa[kk]+'\n') success = True except: if DEBUG: print_exc() success = False try: r.close() except: pass return success if DEBUG: def errfunc(lineno, line, err): print '('+str(lineno)+') '+err+': '+line else: errfunc = lambda lineno, line, err: None def ini_read(f, errfunc = errfunc): try: r = open(f,'r') ll = r.readlines() d = {} dd = {'':d} for i in xrange(len(ll)): l = ll[i] l = l.strip() if not l: continue if l[0] == '#': continue if l[0] == '[': if l[-1] != ']': errfunc(i,l,'syntax error') continue l1 = l[1:-1].strip().lower() if not l1: errfunc(i,l,'syntax error') continue if dd.has_key(l1): errfunc(i,l,'duplicate section') d = dd[l1] continue d = {} dd[l1] = d continue try: k,v = l.split('=',1) except: try: k,v = l.split(':',1) except: errfunc(i,l,'syntax error') continue k = k.strip().lower() v = v.strip() if len(v) > 1 and ( (v[0] == '"' and v[-1] == '"') or (v[0] == "'" and v[-1] == "'") ): v = v[1:-1] if not k: errfunc(i,l,'syntax error') continue if d.has_key(k): errfunc(i,l,'duplicate entry') continue d[k] = v if DEBUG: print dd except: if DEBUG: print_exc() dd = None try: r.close() except: pass return dd armory-0.92.3/BitTornado/CreateIcons.py0000644000000000000000000001254212414772654016452 0ustar rootroot# Generated from bt_MakeCreateIcons - 05/10/04 22:15:33 # T-0.3.0 (BitTornado) from binascii import a2b_base64 from zlib import decompress from os.path import join icons = { "icon_bt.ico": "eJyt1K+OFEEQx/FaQTh5GDRZhSQpiUHwCrxCBYXFrjyJLXeXEARPsZqUPMm+" + "AlmP+PGtngoLDji69zMz2zt/qqtr1mxHv7621d4+MnvK/jl66Bl2drV+e7Wz" + "S/v12A7rY4fDtuvOwfF4tOPXo52/fLLz+WwpWd6nqRXHKXux39sTrtnjNd7g" + "PW7wGSd860f880kffjvJ2QYS1Zcw4AjcoaA5yRFIFDQXOgKJguZmjkCioB4T" + "Y2CqxpTXA7sHEgVNEC8RSBQ0gfk7xtknCupgk3EEEgXlNgFHIFHQTMoRSBQ0" + "E+1ouicKmsk7AomCJiGOQKKgSZIjkChoEucIJAqaZDoCiYImwb4iydULmqQ7" + "AomC1kLcEQ/jSBQ0i+MIJAqaBXMEElVdi9siOgKJgmZhfWWlVjTddXW/FtsR" + "SBQ0BeAIJAqaonAEEgVNoTgCiYKmeByBREHaqiVWRtSRrAJzBBIFTdE5AomC" + "phBPpxPP57dVkDfrTl063nUVnWe383fZx9tb3uN+o7U+BLDtuvcQm8d/27Y/" + "jO3o5/ay+YPv/+f6y30e1OyB7QcsGWFj", "icon_done.ico": "eJyt1K2OVEEQhuEaQbJyMWgyCklSEoPgFvYWKigsduRKbLndhCC4itGk5Erm" + "Fsh4xMdbfSoMOGDpnuf89Jyf6uqaMdvRr69ttbdPzJ6xf4Eeeo6dXa3vXu/s" + "0n49tsP62OGw7bpzcDwe7fj1aOcvn+x8PltKlg9pasVxyl7u9/aUe/Z4gxu8" + "xy0+44Rv/Yp/vujDbxc520Ci+hYGHIF7FDQXOQKJguZGRyBR0DzMEUgU1GNi" + "DEzVmPJ6YfdAoqAJ4hUCiYImMH/HOPtEQR1sMo5AoqDcJuAIJAqaSTkCiYJm" + "oh1N90RBM3lHIFHQJMQRSBQ0SXIEEgVN4hyBREGTTEcgUdAk2FckuXpBk3RH" + "IFHQWoh74mEciYJmcRyBREGzYI5AoqprcVtERyBR0Cysr6zUiqa7rh7WYjsC" + "iYKmAByBREFTFI5AoqApFEcgUdAUjyOQKEhbtcTKiDqSVWCOQKKgKTpHIFHQ" + "FOLpdOL9fLcK8nY9qUvHu66i8+x2/i77eHfH77h/0VofAth23Xuoz/+2bX8Y" + "29HP7WXzB+f/5/7Lcx7V7JHtB9dPG3I=", "black.ico": "eJzt1zsOgkAYReFLLCztjJ2UlpLY485kOS7DpbgESwqTcQZDghjxZwAfyfl0" + "LIieGzUWSom/pan840rHnbSUtPHHX9Je9+tAh2ybNe8TZZ/vk8ajJ4zl6JVJ" + "+xFx+0R03Djx1/2B8bcT9L/bt0+4Wq+4se8e/VTfMvGqb4n3nYiIGz+lvt9s" + "9EpE2T4xJN4xNFYWU6t+JWXuXDFzTom7SodSyi/S+iwtwjlJ80KaNY/C34rW" + "aT8nvK5uhF7ohn7Yqfb87kffLAAAAAAAAAAAAAAAAAAAGMUNy7dADg==", "blue.ico": "eJzt10EOwUAYhuGv6cLSTux06QD2dTM9jmM4iiNYdiEZ81cIFTWddtDkfbQW" + "De8XogtS5h9FIf+81H4jLSSt/ekvaavrdaCDez4SZV+PpPHoicBy9ErSfkQ8" + "fCI6Hjgx6f7A+McJ+r/t95i46xMP7bf8Uz9o4k0/XMT338voP5shK0MkjXcM" + "YSqam6Qunatyf7Nk7iztaqk8SaujNLfzIM0qKX88ZX8rWmf7Nfa+W8N61rW+" + "7TR7fverHxYAAAAAAAAAAAAAAAAAAIziApVZ444=", "green.ico": "eJzt1zEOgjAAheFHGBzdjJuMHsAdbybxNB7Do3gERwaT2mJIBCOWlqok/yc4" + "EP1fNDIoZfZRFLLPa5120krS1p72kvZ6XAeGHLtHouzrkTQePOFZDl5J2g+I" + "+08Exz0nZt2PjH+coP/bvveEaY2L+/VN13/1PSbe9v0FfP+jTP6ziVmJkTQ+" + "MISZaO6SujSmyu3dkpmbdKil8iptLtLSnWdpUUn58yn3t6J39l/j3tc2XM91" + "Xd/tNHt296sfFgAAAAAAAAAAAAAAAAAATOIOVLEoDg==", "red.ico": "eJzt10EOwUAYhuGv6cLSTux06QD2dTOO4xiO4giWXUjG/BVCRTuddtDkfbQW" + "De8XogtS5h9FIf+81GEjLSSt/ekvaavbdaCVez0SZd+PpPHoicBy9ErSfkQ8" + "fCI6Hjgx6f7AeOcE/d/2QyceesaD+g1/1u+e+NwPF/H99zL6z2bIyhBJ4y1D" + "mIb6LqlK5/a5v1syd5F2lVSepdVJmtt5lGZ7KX8+ZX8rGmfzNfa+e8N61rW+" + "7dR7fverHxYAAAAAAAAAAAAAAAAAAIziCpgs444=", "white.ico": "eJzt1zsOgkAYReFLKCztjJ2ULsAed6bLcRnuwYTaJVhSmIwzGBLEiD8D+EjO" + "p2NB9NyosVBK/C3L5B+XOmykhaS1P/6StrpfBzoUp6J5nyj7fJ80Hj1hLEev" + "TNqPiNsnouPGib/uD4y/naD/3b59wtV6xY199+in+paJV31LvO9ERNz4KfX9" + "ZqNXIsr2iSHxjqGxspha9Sspc+f2qXNK3FXalVJ+kVZnaR7OUZrtpbR5FP5W" + "tE77OeF1dSP0Qjf0w06153c/+mYBAAAAAAAAAAAAAAAAAMAobj//I7s=", "yellow.ico": "eJzt1zsOgkAYReFLKCztjJ2ULsAedybLcRkuxSVYUpiM82M0ihGHgVFJzidY" + "ED03vgqlzN+KQv5+qf1GWkha+9Nf0lbX60AX556ORNnXI2k8eiKwHL2StB8R" + "D5+IjgdOTLo/MP5xgv5v+8ETd/3iYf2W/+oHTLzth4t4/3sZ/WszZGWIpPGO" + "IUxE8yupS+eq3H9smTtLu1oqT9LqKM3tPEizSsofT9nfitbZfow979awnnWt" + "bzvNnt/96osFAAAAAAAAAAAAAAAAAACjuABhjmIs", "black1.ico": "eJzt0zEOgkAUANEhFpZSGTstTWzkVt5Cj8ZROAIHMNGPWBCFDYgxMZkHn2Iz" + "G5YCyOLKc+K54XSANbCPiSV2tOt/qjgW3XtSnN41FH/Qv29Jx/P7qefp7W8P" + "4z85HQ+9JRG/7BpTft31DPUKyiVcFjEZzQ/TTtdzrWnKmCr6evv780qSJEmS" + "JEmSJEmSJEmSpPnunVFDcA==", "green1.ico": "eJzt0zEKwkAQRuEXLCyTSuy0DHgxb6F4shzFI+QAgpkkFoombowIwvt2Z4vh" + "X5gtFrJYRUGca/Y7WAFlVLTY0vf/1elxTwqP3xoKf5B/vjIenp+fOs+r/LWT" + "/uQ34aGpUqQnv+1ygDqHagnHRVRG+2H6unfrtZkq6hz5evP7eSVJkiRJkiRJ" + "kiRJkiRJ0nwNoWQ+AA==", "yellow1.ico": "eJzt0zEKwkAQRuEXLCxNJXZaCl7MW8Sj5SgeIQcQ4oS1UDTJxkhAeN/ubDH8" + "C7PFQhGrLIlzx/kEW+AYFS0OpP6/atuXPSk8fKsv/EX+/cpweH5+6jyf8kn+" + "k0fCfVPlyE/+2q2CZgP1Gi6rqILuw6R69uh1mTrqGvlmv/y8kiRJkiRJkiRJ" + "kiRJkiRpvjsp9L8k", "alloc.gif": "eJxz93SzsEw0YRBh+M4ABi0MS3ue///P8H8UjIIRBhR/sjAyMDAx6IAyAihP" + "MHAcYWDlkPHYsOBgM4ewVsyJDQsPNzEoebF8CHjo0smjH3dmRsDjI33C7Dw3" + "MiYuOtjNyDShRSNwyemJguJJKhaGS32nGka61Vg2NJyYKRd+bY+nwtMzjbqV" + "Qh84gxMCJgnlL4vJuqJyaa5NfFLNLsNVV2a7syacfVWkHd4bv7RN1ltM7ejm" + "tMtNZ19Oyb02p8C3aqr3dr2GbXl/7fZyOej5rW653WZ7MzzHZV+v7O2/EZM+" + "Pt45kbX6ScWHNWfOilo3n5thucXv8org1XF3DRQYrAEWiVY3" } def GetIcons(): return icons.keys() def CreateIcon(icon, savedir): try: f = open(join(savedir,icon),"wb") f.write(decompress(a2b_base64(icons[icon]))) success = 1 except: success = 0 try: f.close() except: pass return success armory-0.92.3/BitTornado/CurrentRateMeasure.py0000644000000000000000000000205112414772654020025 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from clock import clock class Measure: def __init__(self, max_rate_period, fudge = 1): self.max_rate_period = max_rate_period self.ratesince = clock() - fudge self.last = self.ratesince self.rate = 0.0 self.total = 0l def update_rate(self, amount): self.total += amount t = clock() self.rate = (self.rate * (self.last - self.ratesince) + amount) / (t - self.ratesince + 0.0001) self.last = t if self.ratesince < t - self.max_rate_period: self.ratesince = t - self.max_rate_period def get_rate(self): self.update_rate(0) return self.rate def get_rate_noupdate(self): return self.rate def time_until_rate(self, newrate): if self.rate <= newrate: return 0 t = clock() - self.ratesince return ((self.rate * t) / newrate) - t def get_total(self): return self.totalarmory-0.92.3/BitTornado/parseargs.py0000644000000000000000000001043712414772654016243 0ustar rootroot# Written by Bill Bumgarner and Bram Cohen # see LICENSE.txt for license information from types import * from cStringIO import StringIO def splitLine(line, COLS=80, indent=10): indent = " " * indent width = COLS - (len(indent) + 1) if indent and width < 15: width = COLS - 2 indent = " " s = StringIO() i = 0 for word in line.split(): if i == 0: s.write(indent+word) i = len(word) continue if i + len(word) >= width: s.write('\n'+indent+word) i = len(word) continue s.write(' '+word) i += len(word) + 1 return s.getvalue() def formatDefinitions(options, COLS, presets = {}): s = StringIO() for (longname, default, doc) in options: s.write('--' + longname + ' \n') default = presets.get(longname, default) if type(default) in (IntType, LongType): try: default = int(default) except: pass if default is not None: doc += ' (defaults to ' + repr(default) + ')' s.write(splitLine(doc,COLS,10)) s.write('\n\n') return s.getvalue() def usage(str): raise ValueError(str) def defaultargs(options): l = {} for (longname, default, doc) in options: if default is not None: l[longname] = default return l def parseargs(argv, options, minargs = None, maxargs = None, presets = {}): config = {} longkeyed = {} for option in options: longname, default, doc = option longkeyed[longname] = option config[longname] = default for longname in presets.keys(): # presets after defaults but before arguments config[longname] = presets[longname] options = [] args = [] pos = 0 while pos < len(argv): if argv[pos][:2] != '--': args.append(argv[pos]) pos += 1 else: if pos == len(argv) - 1: usage('parameter passed in at end with no value') key, value = argv[pos][2:], argv[pos+1] pos += 2 if not longkeyed.has_key(key): usage('unknown key --' + key) longname, default, doc = longkeyed[key] try: t = type(config[longname]) if t is NoneType or t is StringType: config[longname] = value elif t in (IntType, LongType): config[longname] = long(value) elif t is FloatType: config[longname] = float(value) else: assert 0 except ValueError, e: usage('wrong format of --%s - %s' % (key, str(e))) for key, value in config.items(): if value is None: usage("Option --%s is required." % key) if minargs is not None and len(args) < minargs: usage("Must supply at least %d args." % minargs) if maxargs is not None and len(args) > maxargs: usage("Too many args - %d max." % maxargs) return (config, args) def test_parseargs(): assert parseargs(('d', '--a', 'pq', 'e', '--b', '3', '--c', '4.5', 'f'), (('a', 'x', ''), ('b', 1, ''), ('c', 2.3, ''))) == ({'a': 'pq', 'b': 3, 'c': 4.5}, ['d', 'e', 'f']) assert parseargs([], [('a', 'x', '')]) == ({'a': 'x'}, []) assert parseargs(['--a', 'x', '--a', 'y'], [('a', '', '')]) == ({'a': 'y'}, []) try: parseargs([], [('a', 'x', '')]) except ValueError: pass try: parseargs(['--a', 'x'], []) except ValueError: pass try: parseargs(['--a'], [('a', 'x', '')]) except ValueError: pass try: parseargs([], [], 1, 2) except ValueError: pass assert parseargs(['x'], [], 1, 2) == ({}, ['x']) assert parseargs(['x', 'y'], [], 1, 2) == ({}, ['x', 'y']) try: parseargs(['x', 'y', 'z'], [], 1, 2) except ValueError: pass try: parseargs(['--a', '2.0'], [('a', 3, '')]) except ValueError: pass try: parseargs(['--a', 'z'], [('a', 2.1, '')]) except ValueError: pass armory-0.92.3/BitTornado/bitfield.py0000644000000000000000000001017412414772654016034 0ustar rootroot# Written by Bram Cohen, Uoti Urpala, and John Hoffman # see LICENSE.txt for license information try: True except: True = 1 False = 0 bool = lambda x: not not x try: sum([1]) negsum = lambda a: len(a)-sum(a) except: negsum = lambda a: reduce(lambda x,y: x+(not y), a, 0) def _int_to_booleans(x): r = [] for i in range(8): r.append(bool(x & 0x80)) x <<= 1 return tuple(r) lookup_table = [] reverse_lookup_table = {} for i in xrange(256): x = _int_to_booleans(i) lookup_table.append(x) reverse_lookup_table[x] = chr(i) class Bitfield: def __init__(self, length = None, bitstring = None, copyfrom = None): if copyfrom is not None: self.length = copyfrom.length self.array = copyfrom.array[:] self.numfalse = copyfrom.numfalse return if length is None: raise ValueError, "length must be provided unless copying from another array" self.length = length if bitstring is not None: extra = len(bitstring) * 8 - length if extra < 0 or extra >= 8: raise ValueError t = lookup_table r = [] for c in bitstring: r.extend(t[ord(c)]) if extra > 0: if r[-extra:] != [0] * extra: raise ValueError del r[-extra:] self.array = r self.numfalse = negsum(r) else: self.array = [False] * length self.numfalse = length def __setitem__(self, index, val): val = bool(val) self.numfalse += self.array[index]-val self.array[index] = val def __getitem__(self, index): return self.array[index] def __len__(self): return self.length def tostring(self): booleans = self.array t = reverse_lookup_table s = len(booleans) % 8 r = [ t[tuple(booleans[x:x+8])] for x in xrange(0, len(booleans)-s, 8) ] if s: r += t[tuple(booleans[-s:] + ([0] * (8-s)))] return ''.join(r) def complete(self): return not self.numfalse def test_bitfield(): try: x = Bitfield(7, 'ab') assert False except ValueError: pass try: x = Bitfield(7, 'ab') assert False except ValueError: pass try: x = Bitfield(9, 'abc') assert False except ValueError: pass try: x = Bitfield(0, 'a') assert False except ValueError: pass try: x = Bitfield(1, '') assert False except ValueError: pass try: x = Bitfield(7, '') assert False except ValueError: pass try: x = Bitfield(8, '') assert False except ValueError: pass try: x = Bitfield(9, 'a') assert False except ValueError: pass try: x = Bitfield(7, chr(1)) assert False except ValueError: pass try: x = Bitfield(9, chr(0) + chr(0x40)) assert False except ValueError: pass assert Bitfield(0, '').tostring() == '' assert Bitfield(1, chr(0x80)).tostring() == chr(0x80) assert Bitfield(7, chr(0x02)).tostring() == chr(0x02) assert Bitfield(8, chr(0xFF)).tostring() == chr(0xFF) assert Bitfield(9, chr(0) + chr(0x80)).tostring() == chr(0) + chr(0x80) x = Bitfield(1) assert x.numfalse == 1 x[0] = 1 assert x.numfalse == 0 x[0] = 1 assert x.numfalse == 0 assert x.tostring() == chr(0x80) x = Bitfield(7) assert len(x) == 7 x[6] = 1 assert x.numfalse == 6 assert x.tostring() == chr(0x02) x = Bitfield(8) x[7] = 1 assert x.tostring() == chr(1) x = Bitfield(9) x[8] = 1 assert x.numfalse == 8 assert x.tostring() == chr(0) + chr(0x80) x = Bitfield(8, chr(0xC4)) assert len(x) == 8 assert x.numfalse == 5 assert x.tostring() == chr(0xC4) armory-0.92.3/BitTornado/PSYCO.py0000644000000000000000000000015012414772654015140 0ustar rootroot# edit this file to enable/disable Psyco # psyco = 1 -- enabled # psyco = 0 -- disabled psyco = 0 armory-0.92.3/BitTornado/natpunch.py0000644000000000000000000001737112414772654016100 0ustar rootroot# Written by John Hoffman # derived from NATPortMapping.py by Yejun Yang # and from example code by Myers Carpenter # see LICENSE.txt for license information import socket from traceback import print_exc from subnetparse import IP_List from clock import clock from __init__ import createPeerID try: True except: True = 1 False = 0 DEBUG = False EXPIRE_CACHE = 30 # seconds ID = "BT-"+createPeerID()[-4:] try: import pythoncom, win32com.client _supported = 1 except ImportError: _supported = 0 class _UPnP1: # derived from Myers Carpenter's code # seems to use the machine's local UPnP # system for its operation. Runs fairly fast def __init__(self): self.map = None self.last_got_map = -10e10 def _get_map(self): if self.last_got_map + EXPIRE_CACHE < clock(): try: dispatcher = win32com.client.Dispatch("HNetCfg.NATUPnP") self.map = dispatcher.StaticPortMappingCollection self.last_got_map = clock() except: self.map = None return self.map def test(self): try: assert self._get_map() # make sure a map was found success = True except: success = False return success def open(self, ip, p): map = self._get_map() try: map.Add(p,'TCP',p,ip,True,ID) if DEBUG: print 'port opened: '+ip+':'+str(p) success = True except: if DEBUG: print "COULDN'T OPEN "+str(p) print_exc() success = False return success def close(self, p): map = self._get_map() try: map.Remove(p,'TCP') success = True if DEBUG: print 'port closed: '+str(p) except: if DEBUG: print 'ERROR CLOSING '+str(p) print_exc() success = False return success def clean(self, retry = False): if not _supported: return try: map = self._get_map() ports_in_use = [] for i in xrange(len(map)): try: mapping = map[i] port = mapping.ExternalPort prot = str(mapping.Protocol).lower() desc = str(mapping.Description).lower() except: port = None if port and prot == 'tcp' and desc[:3] == 'bt-': ports_in_use.append(port) success = True for port in ports_in_use: try: map.Remove(port,'TCP') except: success = False if not success and not retry: self.clean(retry = True) except: pass class _UPnP2: # derived from Yejun Yang's code # apparently does a direct search for UPnP hardware # may work in some cases where _UPnP1 won't, but is slow # still need to implement "clean" method def __init__(self): self.services = None self.last_got_services = -10e10 def _get_services(self): if not self.services or self.last_got_services + EXPIRE_CACHE < clock(): self.services = [] try: f=win32com.client.Dispatch("UPnP.UPnPDeviceFinder") for t in ( "urn:schemas-upnp-org:service:WANIPConnection:1", "urn:schemas-upnp-org:service:WANPPPConnection:1" ): try: conns = f.FindByType(t,0) for c in xrange(len(conns)): try: svcs = conns[c].Services for s in xrange(len(svcs)): try: self.services.append(svcs[s]) except: pass except: pass except: pass except: pass self.last_got_services = clock() return self.services def test(self): try: assert self._get_services() # make sure some services can be found success = True except: success = False return success def open(self, ip, p): svcs = self._get_services() success = False for s in svcs: try: s.InvokeAction('AddPortMapping',['',p,'TCP',p,ip,True,ID,0],'') success = True except: pass if DEBUG and not success: print "COULDN'T OPEN "+str(p) print_exc() return success def close(self, p): svcs = self._get_services() success = False for s in svcs: try: s.InvokeAction('DeletePortMapping', ['',p,'TCP'], '') success = True except: pass if DEBUG and not success: print "COULDN'T OPEN "+str(p) print_exc() return success class _UPnP: # master holding class def __init__(self): self.upnp1 = _UPnP1() self.upnp2 = _UPnP2() self.upnplist = (None, self.upnp1, self.upnp2) self.upnp = None self.local_ip = None self.last_got_ip = -10e10 def get_ip(self): if self.last_got_ip + EXPIRE_CACHE < clock(): local_ips = IP_List() local_ips.set_intranet_addresses() try: for info in socket.getaddrinfo(socket.gethostname(),0,socket.AF_INET): # exception if socket library isn't recent self.local_ip = info[4][0] if local_ips.includes(self.local_ip): self.last_got_ip = clock() if DEBUG: print 'Local IP found: '+self.local_ip break else: raise ValueError('couldn\'t find intranet IP') except: self.local_ip = None if DEBUG: print 'Error finding local IP' print_exc() return self.local_ip def test(self, upnp_type): if DEBUG: print 'testing UPnP type '+str(upnp_type) if not upnp_type or not _supported or self.get_ip() is None: if DEBUG: print 'not supported' return 0 pythoncom.CoInitialize() # leave initialized self.upnp = self.upnplist[upnp_type] # cache this if self.upnp.test(): if DEBUG: print 'ok' return upnp_type if DEBUG: print 'tested bad' return 0 def open(self, p): assert self.upnp, "must run UPnP_test() with the desired UPnP access type first" return self.upnp.open(self.get_ip(), p) def close(self, p): assert self.upnp, "must run UPnP_test() with the desired UPnP access type first" return self.upnp.close(p) def clean(self): return self.upnp1.clean() _upnp_ = _UPnP() UPnP_test = _upnp_.test UPnP_open_port = _upnp_.open UPnP_close_port = _upnp_.close UPnP_reset = _upnp_.clean armory-0.92.3/BitTornado/iprangeparse.py0000644000000000000000000001235312414772654016733 0ustar rootroot# Written by John Hoffman # see LICENSE.txt for license information from bisect import bisect, insort try: True except: True = 1 False = 0 bool = lambda x: not not x def to_long_ipv4(ip): ip = ip.split('.') if len(ip) != 4: raise ValueError, "bad address" b = 0L for n in ip: b *= 256 b += int(n) return b def to_long_ipv6(ip): if ip == '': raise ValueError, "bad address" if ip == '::': # boundary handling ip = '' elif ip[:2] == '::': ip = ip[1:] elif ip[0] == ':': raise ValueError, "bad address" elif ip[-2:] == '::': ip = ip[:-1] elif ip[-1] == ':': raise ValueError, "bad address" b = [] doublecolon = False for n in ip.split(':'): if n == '': # double-colon if doublecolon: raise ValueError, "bad address" doublecolon = True b.append(None) continue if n.find('.') >= 0: # IPv4 n = n.split('.') if len(n) != 4: raise ValueError, "bad address" for i in n: b.append(int(i)) continue n = ('0'*(4-len(n))) + n b.append(int(n[:2],16)) b.append(int(n[2:],16)) bb = 0L for n in b: if n is None: for i in xrange(17-len(b)): bb *= 256 continue bb *= 256 bb += n return bb ipv4addrmask = 65535L*256*256*256*256 class IP_List: def __init__(self): self.ipv4list = [] # starts of ranges self.ipv4dict = {} # start: end of ranges self.ipv6list = [] # " self.ipv6dict = {} # " def __nonzero__(self): return bool(self.ipv4list or self.ipv6list) def append(self, ip_beg, ip_end = None): if ip_end is None: ip_end = ip_beg else: assert ip_beg <= ip_end if ip_beg.find(':') < 0: # IPv4 ip_beg = to_long_ipv4(ip_beg) ip_end = to_long_ipv4(ip_end) l = self.ipv4list d = self.ipv4dict else: ip_beg = to_long_ipv6(ip_beg) ip_end = to_long_ipv6(ip_end) bb = ip_beg % (256*256*256*256) if bb == ipv4addrmask: ip_beg -= bb ip_end -= bb l = self.ipv4list d = self.ipv4dict else: l = self.ipv6list d = self.ipv6dict pos = bisect(l,ip_beg)-1 done = pos < 0 while not done: p = pos while p < len(l): range_beg = l[p] if range_beg > ip_end+1: done = True break range_end = d[range_beg] if range_end < ip_beg-1: p += 1 if p == len(l): done = True break continue # if neither of the above conditions is true, the ranges overlap ip_beg = min(ip_beg, range_beg) ip_end = max(ip_end, range_end) del l[p] del d[range_beg] break insort(l,ip_beg) d[ip_beg] = ip_end def includes(self, ip): if not (self.ipv4list or self.ipv6list): return False if ip.find(':') < 0: # IPv4 ip = to_long_ipv4(ip) l = self.ipv4list d = self.ipv4dict else: ip = to_long_ipv6(ip) bb = ip % (256*256*256*256) if bb == ipv4addrmask: ip -= bb l = self.ipv4list d = self.ipv4dict else: l = self.ipv6list d = self.ipv6dict for ip_beg in l[bisect(l,ip)-1:]: if ip == ip_beg: return True ip_end = d[ip_beg] if ip > ip_beg and ip <= ip_end: return True return False # reads a list from a file in the format 'whatever:whatever:ip-ip' # (not IPv6 compatible at all) def read_rangelist(self, file): f = open(file, 'r') while True: line = f.readline() if not line: break line = line.strip() if not line or line[0] == '#': continue line = line.split(':')[-1] try: ip1,ip2 = line.split('-') except: ip1 = line ip2 = line try: self.append(ip1.strip(),ip2.strip()) except: print '*** WARNING *** could not parse IP range: '+line f.close() def is_ipv4(ip): return ip.find(':') < 0 def is_valid_ip(ip): try: if is_ipv4(ip): a = ip.split('.') assert len(a) == 4 for i in a: chr(int(i)) return True to_long_ipv6(ip) return True except: return False armory-0.92.3/BitTornado/BT1/0000755000000000000000000000000012414772654014263 5ustar rootrootarmory-0.92.3/BitTornado/BT1/PiecePicker.py0000644000000000000000000002771312414772654017032 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from random import randrange, shuffle from BitTornado.clock import clock try: True except: True = 1 False = 0 class PiecePicker: def __init__(self, numpieces, rarest_first_cutoff = 1, rarest_first_priority_cutoff = 3, priority_step = 20): self.rarest_first_cutoff = rarest_first_cutoff self.rarest_first_priority_cutoff = rarest_first_priority_cutoff + priority_step self.priority_step = priority_step self.cutoff = rarest_first_priority_cutoff self.numpieces = numpieces self.started = [] self.totalcount = 0 self.numhaves = [0] * numpieces self.priority = [1] * numpieces self.removed_partials = {} self.crosscount = [numpieces] self.crosscount2 = [numpieces] self.has = [0] * numpieces self.numgot = 0 self.done = False self.seed_connections = {} self.past_ips = {} self.seed_time = None self.superseed = False self.seeds_connected = 0 self._init_interests() def _init_interests(self): self.interests = [[] for x in xrange(self.priority_step)] self.level_in_interests = [self.priority_step] * self.numpieces interests = range(self.numpieces) shuffle(interests) self.pos_in_interests = [0] * self.numpieces for i in xrange(self.numpieces): self.pos_in_interests[interests[i]] = i self.interests.append(interests) def got_have(self, piece): self.totalcount+=1 numint = self.numhaves[piece] self.numhaves[piece] += 1 self.crosscount[numint] -= 1 if numint+1==len(self.crosscount): self.crosscount.append(0) self.crosscount[numint+1] += 1 if not self.done: numintplus = numint+self.has[piece] self.crosscount2[numintplus] -= 1 if numintplus+1 == len(self.crosscount2): self.crosscount2.append(0) self.crosscount2[numintplus+1] += 1 numint = self.level_in_interests[piece] self.level_in_interests[piece] += 1 if self.superseed: self.seed_got_haves[piece] += 1 numint = self.level_in_interests[piece] self.level_in_interests[piece] += 1 elif self.has[piece] or self.priority[piece] == -1: return if numint == len(self.interests) - 1: self.interests.append([]) self._shift_over(piece, self.interests[numint], self.interests[numint + 1]) def lost_have(self, piece): self.totalcount-=1 numint = self.numhaves[piece] self.numhaves[piece] -= 1 self.crosscount[numint] -= 1 self.crosscount[numint-1] += 1 if not self.done: numintplus = numint+self.has[piece] self.crosscount2[numintplus] -= 1 self.crosscount2[numintplus-1] += 1 numint = self.level_in_interests[piece] self.level_in_interests[piece] -= 1 if self.superseed: numint = self.level_in_interests[piece] self.level_in_interests[piece] -= 1 elif self.has[piece] or self.priority[piece] == -1: return self._shift_over(piece, self.interests[numint], self.interests[numint - 1]) def _shift_over(self, piece, l1, l2): assert self.superseed or (not self.has[piece] and self.priority[piece] >= 0) parray = self.pos_in_interests p = parray[piece] assert l1[p] == piece q = l1[-1] l1[p] = q parray[q] = p del l1[-1] newp = randrange(len(l2)+1) if newp == len(l2): parray[piece] = len(l2) l2.append(piece) else: old = l2[newp] parray[old] = len(l2) l2.append(old) l2[newp] = piece parray[piece] = newp def got_seed(self): self.seeds_connected += 1 self.cutoff = max(self.rarest_first_priority_cutoff-self.seeds_connected,0) def became_seed(self): self.got_seed() self.totalcount -= self.numpieces self.numhaves = [i-1 for i in self.numhaves] if self.superseed or not self.done: self.level_in_interests = [i-1 for i in self.level_in_interests] if self.interests: del self.interests[0] del self.crosscount[0] if not self.done: del self.crosscount2[0] def lost_seed(self): self.seeds_connected -= 1 self.cutoff = max(self.rarest_first_priority_cutoff-self.seeds_connected,0) def requested(self, piece): if piece not in self.started: self.started.append(piece) def _remove_from_interests(self, piece, keep_partial = False): l = self.interests[self.level_in_interests[piece]] p = self.pos_in_interests[piece] assert l[p] == piece q = l[-1] l[p] = q self.pos_in_interests[q] = p del l[-1] try: self.started.remove(piece) if keep_partial: self.removed_partials[piece] = 1 except ValueError: pass def complete(self, piece): assert not self.has[piece] self.has[piece] = 1 self.numgot += 1 if self.numgot == self.numpieces: self.done = True self.crosscount2 = self.crosscount else: numhaves = self.numhaves[piece] self.crosscount2[numhaves] -= 1 if numhaves+1 == len(self.crosscount2): self.crosscount2.append(0) self.crosscount2[numhaves+1] += 1 self._remove_from_interests(piece) def next(self, haves, wantfunc, complete_first = False): cutoff = self.numgot < self.rarest_first_cutoff complete_first = (complete_first or cutoff) and not haves.complete() best = None bestnum = 2 ** 30 for i in self.started: if haves[i] and wantfunc(i): if self.level_in_interests[i] < bestnum: best = i bestnum = self.level_in_interests[i] if best is not None: if complete_first or (cutoff and len(self.interests) > self.cutoff): return best if haves.complete(): r = [ (0, min(bestnum,len(self.interests))) ] elif cutoff and len(self.interests) > self.cutoff: r = [ (self.cutoff, min(bestnum,len(self.interests))), (0, self.cutoff) ] else: r = [ (0, min(bestnum,len(self.interests))) ] for lo,hi in r: for i in xrange(lo,hi): for j in self.interests[i]: if haves[j] and wantfunc(j): return j if best is not None: return best return None def am_I_complete(self): return self.done def bump(self, piece): l = self.interests[self.level_in_interests[piece]] pos = self.pos_in_interests[piece] del l[pos] l.append(piece) for i in range(pos,len(l)): self.pos_in_interests[l[i]] = i try: self.started.remove(piece) except: pass def set_priority(self, piece, p): if self.superseed: return False # don't muck with this if you're a superseed oldp = self.priority[piece] if oldp == p: return False self.priority[piece] = p if p == -1: # when setting priority -1, # make sure to cancel any downloads for this piece if not self.has[piece]: self._remove_from_interests(piece, True) return True if oldp == -1: level = self.numhaves[piece] + (self.priority_step * p) self.level_in_interests[piece] = level if self.has[piece]: return True while len(self.interests) < level+1: self.interests.append([]) l2 = self.interests[level] parray = self.pos_in_interests newp = randrange(len(l2)+1) if newp == len(l2): parray[piece] = len(l2) l2.append(piece) else: old = l2[newp] parray[old] = len(l2) l2.append(old) l2[newp] = piece parray[piece] = newp if self.removed_partials.has_key(piece): del self.removed_partials[piece] self.started.append(piece) # now go to downloader and try requesting more return True numint = self.level_in_interests[piece] newint = numint + ((p - oldp) * self.priority_step) self.level_in_interests[piece] = newint if self.has[piece]: return False while len(self.interests) < newint+1: self.interests.append([]) self._shift_over(piece, self.interests[numint], self.interests[newint]) return False def is_blocked(self, piece): return self.priority[piece] < 0 def set_superseed(self): assert self.done self.superseed = True self.seed_got_haves = [0] * self.numpieces self._init_interests() # assume everyone is disconnected def next_have(self, connection, looser_upload): if self.seed_time is None: self.seed_time = clock() return None if clock() < self.seed_time+10: # wait 10 seconds after seeing the first peers return None # to give time to grab have lists if not connection.upload.super_seeding: return None olddl = self.seed_connections.get(connection) if olddl is None: ip = connection.get_ip() olddl = self.past_ips.get(ip) if olddl is not None: # peer reconnected self.seed_connections[connection] = olddl if olddl is not None: if looser_upload: num = 1 # send a new have even if it hasn't spread that piece elsewhere else: num = 2 if self.seed_got_haves[olddl] < num: return None if not connection.upload.was_ever_interested: # it never downloaded it? connection.upload.skipped_count += 1 if connection.upload.skipped_count >= 3: # probably another stealthed seed return -1 # signal to close it for tier in self.interests: for piece in tier: if not connection.download.have[piece]: seedint = self.level_in_interests[piece] self.level_in_interests[piece] += 1 # tweak it up one, so you don't duplicate effort if seedint == len(self.interests) - 1: self.interests.append([]) self._shift_over(piece, self.interests[seedint], self.interests[seedint + 1]) self.seed_got_haves[piece] = 0 # reset this self.seed_connections[connection] = piece connection.upload.seed_have_list.append(piece) return piece return -1 # something screwy; terminate connection def lost_peer(self, connection): olddl = self.seed_connections.get(connection) if olddl is None: return del self.seed_connections[connection] self.past_ips[connection.get_ip()] = olddl if self.seed_got_haves[olddl] == 1: self.seed_got_haves[olddl] = 0 armory-0.92.3/BitTornado/BT1/Filter.py0000644000000000000000000000046612414772654016070 0ustar rootrootclass Filter: def __init__(self, callback): self.callback = callback def check(self, ip, paramslist, headers): def params(key, default = None, l = paramslist): if l.has_key(key): return l[key][0] return default return None armory-0.92.3/BitTornado/BT1/btformats.py0000644000000000000000000000752712414772654016651 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from types import StringType, LongType, IntType, ListType, DictType from re import compile reg = compile(r'^[^/\\.~][^/\\]*$') ints = (LongType, IntType) def check_info(info): if type(info) != DictType: raise ValueError, 'bad metainfo - not a dictionary' pieces = info.get('pieces') if type(pieces) != StringType or len(pieces) % 20 != 0: raise ValueError, 'bad metainfo - bad pieces key' piecelength = info.get('piece length') if type(piecelength) not in ints or piecelength <= 0: raise ValueError, 'bad metainfo - illegal piece length' name = info.get('name') if type(name) != StringType: raise ValueError, 'bad metainfo - bad name' if not reg.match(name): raise ValueError, 'name %s disallowed for security reasons' % name if info.has_key('files') == info.has_key('length'): raise ValueError, 'single/multiple file mix' if info.has_key('length'): length = info.get('length') if type(length) not in ints or length < 0: raise ValueError, 'bad metainfo - bad length' else: files = info.get('files') if type(files) != ListType: raise ValueError for f in files: if type(f) != DictType: raise ValueError, 'bad metainfo - bad file value' length = f.get('length') if type(length) not in ints or length < 0: raise ValueError, 'bad metainfo - bad length' path = f.get('path') if type(path) != ListType or path == []: raise ValueError, 'bad metainfo - bad path' for p in path: if type(p) != StringType: raise ValueError, 'bad metainfo - bad path dir' if not reg.match(p): raise ValueError, 'path %s disallowed for security reasons' % p for i in xrange(len(files)): for j in xrange(i): if files[i]['path'] == files[j]['path']: raise ValueError, 'bad metainfo - duplicate path' def check_message(message): if type(message) != DictType: raise ValueError check_info(message.get('info')) if type(message.get('announce')) != StringType: raise ValueError def check_peers(message): if type(message) != DictType: raise ValueError if message.has_key('failure reason'): if type(message['failure reason']) != StringType: raise ValueError return peers = message.get('peers') if type(peers) == ListType: for p in peers: if type(p) != DictType: raise ValueError if type(p.get('ip')) != StringType: raise ValueError port = p.get('port') if type(port) not in ints or p <= 0: raise ValueError if p.has_key('peer id'): id = p['peer id'] if type(id) != StringType or len(id) != 20: raise ValueError elif type(peers) != StringType or len(peers) % 6 != 0: raise ValueError interval = message.get('interval', 1) if type(interval) not in ints or interval <= 0: raise ValueError minint = message.get('min interval', 1) if type(minint) not in ints or minint <= 0: raise ValueError if type(message.get('tracker id', '')) != StringType: raise ValueError npeers = message.get('num peers', 0) if type(npeers) not in ints or npeers < 0: raise ValueError dpeers = message.get('done peers', 0) if type(dpeers) not in ints or dpeers < 0: raise ValueError last = message.get('last', 0) if type(last) not in ints or last < 0: raise ValueError armory-0.92.3/BitTornado/BT1/Choker.py0000644000000000000000000001045412414772654016054 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from random import randrange, shuffle from BitTornado.clock import clock try: True except: True = 1 False = 0 class Choker: def __init__(self, config, schedule, picker, done = lambda: False): self.config = config self.round_robin_period = config['round_robin_period'] self.schedule = schedule self.picker = picker self.connections = [] self.last_preferred = 0 self.last_round_robin = clock() self.done = done self.super_seed = False self.paused = False schedule(self._round_robin, 5) def set_round_robin_period(self, x): self.round_robin_period = x def _round_robin(self): self.schedule(self._round_robin, 5) if self.super_seed: cons = range(len(self.connections)) to_close = [] count = self.config['min_uploads']-self.last_preferred if count > 0: # optimization shuffle(cons) for c in cons: i = self.picker.next_have(self.connections[c], count > 0) if i is None: continue if i < 0: to_close.append(self.connections[c]) continue self.connections[c].send_have(i) count -= 1 for c in to_close: c.close() if self.last_round_robin + self.round_robin_period < clock(): self.last_round_robin = clock() for i in xrange(1, len(self.connections)): c = self.connections[i] u = c.get_upload() if u.is_choked() and u.is_interested(): self.connections = self.connections[i:] + self.connections[:i] break self._rechoke() def _rechoke(self): preferred = [] maxuploads = self.config['max_uploads'] if self.paused: for c in self.connections: c.get_upload().choke() return if maxuploads > 1: for c in self.connections: u = c.get_upload() if not u.is_interested(): continue if self.done(): r = u.get_rate() else: d = c.get_download() r = d.get_rate() if r < 1000 or d.is_snubbed(): continue preferred.append((-r, c)) self.last_preferred = len(preferred) preferred.sort() del preferred[maxuploads-1:] preferred = [x[1] for x in preferred] count = len(preferred) hit = False to_unchoke = [] for c in self.connections: u = c.get_upload() if c in preferred: to_unchoke.append(u) else: if count < maxuploads or not hit: to_unchoke.append(u) if u.is_interested(): count += 1 hit = True else: u.choke() for u in to_unchoke: u.unchoke() def connection_made(self, connection, p = None): if p is None: p = randrange(-2, len(self.connections) + 1) self.connections.insert(max(p, 0), connection) self._rechoke() def connection_lost(self, connection): self.connections.remove(connection) self.picker.lost_peer(connection) if connection.get_upload().is_interested() and not connection.get_upload().is_choked(): self._rechoke() def interested(self, connection): if not connection.get_upload().is_choked(): self._rechoke() def not_interested(self, connection): if not connection.get_upload().is_choked(): self._rechoke() def set_super_seed(self): while self.connections: # close all connections self.connections[0].close() self.picker.set_superseed() self.super_seed = True def pause(self, flag): self.paused = flag self._rechoke() armory-0.92.3/BitTornado/BT1/Uploader.py0000644000000000000000000001150612414772654016413 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from BitTornado.CurrentRateMeasure import Measure try: True except: True = 1 False = 0 class Upload: def __init__(self, connection, ratelimiter, totalup, choker, storage, picker, config): self.connection = connection self.ratelimiter = ratelimiter self.totalup = totalup self.choker = choker self.storage = storage self.picker = picker self.config = config self.max_slice_length = config['max_slice_length'] self.choked = True self.cleared = True self.interested = False self.super_seeding = False self.buffer = [] self.measure = Measure(config['max_rate_period'], config['upload_rate_fudge']) self.was_ever_interested = False if storage.get_amount_left() == 0: if choker.super_seed: self.super_seeding = True # flag, and don't send bitfield self.seed_have_list = [] # set from piecepicker self.skipped_count = 0 else: if config['breakup_seed_bitfield']: bitfield, msgs = storage.get_have_list_cloaked() connection.send_bitfield(bitfield) for have in msgs: connection.send_have(have) else: connection.send_bitfield(storage.get_have_list()) else: if storage.do_I_have_anything(): connection.send_bitfield(storage.get_have_list()) self.piecedl = None self.piecebuf = None def got_not_interested(self): if self.interested: self.interested = False del self.buffer[:] self.piecedl = None if self.piecebuf: self.piecebuf.release() self.piecebuf = None self.choker.not_interested(self.connection) def got_interested(self): if not self.interested: self.interested = True self.was_ever_interested = True self.choker.interested(self.connection) def get_upload_chunk(self): if self.choked or not self.buffer: return None index, begin, length = self.buffer.pop(0) if self.config['buffer_reads']: if index != self.piecedl: if self.piecebuf: self.piecebuf.release() self.piecedl = index self.piecebuf = self.storage.get_piece(index, 0, -1) try: piece = self.piecebuf[begin:begin+length] assert len(piece) == length except: # fails if storage.get_piece returns None or if out of range self.connection.close() return None else: if self.piecebuf: self.piecebuf.release() self.piecedl = None piece = self.storage.get_piece(index, begin, length) if piece is None: self.connection.close() return None self.measure.update_rate(len(piece)) self.totalup.update_rate(len(piece)) return (index, begin, piece) def got_request(self, index, begin, length): if ( (self.super_seeding and not index in self.seed_have_list) or not self.interested or length > self.max_slice_length ): self.connection.close() return if not self.cleared: self.buffer.append((index, begin, length)) if not self.choked and self.connection.next_upload is None: self.ratelimiter.queue(self.connection) def got_cancel(self, index, begin, length): try: self.buffer.remove((index, begin, length)) except ValueError: pass def choke(self): if not self.choked: self.choked = True self.connection.send_choke() self.piecedl = None if self.piecebuf: self.piecebuf.release() self.piecebuf = None def choke_sent(self): del self.buffer[:] self.cleared = True def unchoke(self): if self.choked: self.choked = False self.cleared = False self.connection.send_unchoke() def disconnected(self): if self.piecebuf: self.piecebuf.release() self.piecebuf = None def is_choked(self): return self.choked def is_interested(self): return self.interested def has_queries(self): return not self.choked and len(self.buffer) > 0 def get_rate(self): return self.measure.get_rate() armory-0.92.3/BitTornado/BT1/FileSelector.py0000644000000000000000000002102412414772654017214 0ustar rootroot# Written by John Hoffman # see LICENSE.txt for license information from random import shuffle from traceback import print_exc try: True except: True = 1 False = 0 class FileSelector: def __init__(self, files, piece_length, bufferdir, storage, storagewrapper, sched, failfunc): self.files = files self.storage = storage self.storagewrapper = storagewrapper self.sched = sched self.failfunc = failfunc self.downloader = None self.picker = None storage.set_bufferdir(bufferdir) self.numfiles = len(files) self.priority = [1] * self.numfiles self.new_priority = None self.new_partials = None self.filepieces = [] total = 0L for file, length in files: if not length: self.filepieces.append(()) else: pieces = range( int(total/piece_length), int((total+length-1)/piece_length)+1 ) self.filepieces.append(tuple(pieces)) total += length self.numpieces = int((total+piece_length-1)/piece_length) self.piece_priority = [1] * self.numpieces def init_priority(self, new_priority): try: assert len(new_priority) == self.numfiles for v in new_priority: assert type(v) in (type(0),type(0L)) assert v >= -1 assert v <= 2 except: # print_exc() return False try: files_updated = False for f in xrange(self.numfiles): if new_priority[f] < 0: self.storage.disable_file(f) files_updated = True if files_updated: self.storage.reset_file_status() self.new_priority = new_priority except (IOError, OSError), e: self.failfunc("can't open partial file for " + self.files[f][0] + ': ' + str(e)) return False return True ''' d['priority'] = [file #1 priority [,file #2 priority...] ] a list of download priorities for each file. Priority may be -1, 0, 1, 2. -1 = download disabled, 0 = highest, 1 = normal, 2 = lowest. Also see Storage.pickle and StorageWrapper.pickle for additional keys. ''' def unpickle(self, d): if d.has_key('priority'): if not self.init_priority(d['priority']): return pieces = self.storage.unpickle(d) if not pieces: # don't bother, nothing restoreable return new_piece_priority = self._get_piece_priority_list(self.new_priority) self.storagewrapper.reblock([i == -1 for i in new_piece_priority]) self.new_partials = self.storagewrapper.unpickle(d, pieces) def tie_in(self, picker, cancelfunc, requestmorefunc, rerequestfunc): self.picker = picker self.cancelfunc = cancelfunc self.requestmorefunc = requestmorefunc self.rerequestfunc = rerequestfunc if self.new_priority: self.priority = self.new_priority self.new_priority = None self.new_piece_priority = self._set_piece_priority(self.priority) if self.new_partials: shuffle(self.new_partials) for p in self.new_partials: self.picker.requested(p) self.new_partials = None def _set_files_disabled(self, old_priority, new_priority): old_disabled = [p == -1 for p in old_priority] new_disabled = [p == -1 for p in new_priority] data_to_update = [] for f in xrange(self.numfiles): if new_disabled[f] != old_disabled[f]: data_to_update.extend(self.storage.get_piece_update_list(f)) buffer = [] for piece, start, length in data_to_update: if self.storagewrapper.has_data(piece): data = self.storagewrapper.read_raw(piece, start, length) if data is None: return False buffer.append((piece, start, data)) files_updated = False try: for f in xrange(self.numfiles): if new_disabled[f] and not old_disabled[f]: self.storage.disable_file(f) files_updated = True if old_disabled[f] and not new_disabled[f]: self.storage.enable_file(f) files_updated = True except (IOError, OSError), e: if new_disabled[f]: msg = "can't open partial file for " else: msg = 'unable to open ' self.failfunc(msg + self.files[f][0] + ': ' + str(e)) return False if files_updated: self.storage.reset_file_status() changed_pieces = {} for piece, start, data in buffer: if not self.storagewrapper.write_raw(piece, start, data): return False data.release() changed_pieces[piece] = 1 if not self.storagewrapper.doublecheck_data(changed_pieces): return False return True def _get_piece_priority_list(self, file_priority_list): l = [-1] * self.numpieces for f in xrange(self.numfiles): if file_priority_list[f] == -1: continue for i in self.filepieces[f]: if l[i] == -1: l[i] = file_priority_list[f] continue l[i] = min(l[i],file_priority_list[f]) return l def _set_piece_priority(self, new_priority): was_complete = self.storagewrapper.am_I_complete() new_piece_priority = self._get_piece_priority_list(new_priority) pieces = range(self.numpieces) shuffle(pieces) new_blocked = [] new_unblocked = [] for piece in pieces: self.picker.set_priority(piece,new_piece_priority[piece]) o = self.piece_priority[piece] == -1 n = new_piece_priority[piece] == -1 if n and not o: new_blocked.append(piece) if o and not n: new_unblocked.append(piece) if new_blocked: self.cancelfunc(new_blocked) self.storagewrapper.reblock([i == -1 for i in new_piece_priority]) if new_unblocked: self.requestmorefunc(new_unblocked) if was_complete and not self.storagewrapper.am_I_complete(): self.rerequestfunc() return new_piece_priority def set_priorities_now(self, new_priority = None): if not new_priority: new_priority = self.new_priority self.new_priority = None # potential race condition if not new_priority: return old_priority = self.priority self.priority = new_priority if not self._set_files_disabled(old_priority, new_priority): return self.piece_priority = self._set_piece_priority(new_priority) def set_priorities(self, new_priority): self.new_priority = new_priority self.sched(self.set_priorities_now) def set_priority(self, f, p): new_priority = self.get_priorities() new_priority[f] = p self.set_priorities(new_priority) def get_priorities(self): priority = self.new_priority if not priority: priority = self.priority # potential race condition return [i for i in priority] def __setitem__(self, index, val): self.set_priority(index, val) def __getitem__(self, index): try: return self.new_priority[index] except: return self.priority[index] def finish(self): for f in xrange(self.numfiles): if self.priority[f] == -1: self.storage.delete_file(f) def pickle(self): d = {'priority': self.priority} try: s = self.storage.pickle() sw = self.storagewrapper.pickle() for k in s.keys(): d[k] = s[k] for k in sw.keys(): d[k] = sw[k] except (IOError, OSError): pass return d armory-0.92.3/BitTornado/BT1/makemetafile.py0000644000000000000000000002212512414772654017263 0ustar rootroot# Written by Bram Cohen # multitracker extensions by John Hoffman # see LICENSE.txt for license information from os.path import getsize, split, join, abspath, isdir from os import listdir from sha import sha from copy import copy from string import strip from BitTornado.bencode import bencode from btformats import check_info from threading import Event from time import time from traceback import print_exc try: from sys import getfilesystemencoding ENCODING = getfilesystemencoding() except: from sys import getdefaultencoding ENCODING = getdefaultencoding() defaults = [ ('announce_list', '', 'a list of announce URLs - explained below'), ('httpseeds', '', 'a list of http seed URLs - explained below'), ('piece_size_pow2', 0, "which power of 2 to set the piece size to (0 = automatic)"), ('comment', '', "optional human-readable comment to put in .torrent"), ('filesystem_encoding', '', "optional specification for filesystem encoding " + "(set automatically in recent Python versions)"), ('target', '', "optional target file for the torrent") ] default_piece_len_exp = 18 ignore = ['core', 'CVS'] def print_announcelist_details(): print (' announce_list = optional list of redundant/backup tracker URLs, in the format:') print (' url[,url...][|url[,url...]...]') print (' where URLs separated by commas are all tried first') print (' before the next group of URLs separated by the pipe is checked.') print (" If none is given, it is assumed you don't want one in the metafile.") print (' If announce_list is given, clients which support it') print (' will ignore the value.') print (' Examples:') print (' http://tracker1.com|http://tracker2.com|http://tracker3.com') print (' (tries trackers 1-3 in order)') print (' http://tracker1.com,http://tracker2.com,http://tracker3.com') print (' (tries trackers 1-3 in a randomly selected order)') print (' http://tracker1.com|http://backup1.com,http://backup2.com') print (' (tries tracker 1 first, then tries between the 2 backups randomly)') print ('') print (' httpseeds = optional list of http-seed URLs, in the format:') print (' url[|url...]') def make_meta_file(file, url, params = {}, flag = Event(), progress = lambda x: None, progress_percent = 1): if params.has_key('piece_size_pow2'): piece_len_exp = params['piece_size_pow2'] else: piece_len_exp = default_piece_len_exp if params.has_key('target') and params['target'] != '': f = params['target'] else: a, b = split(file) if b == '': f = a + '.torrent' else: f = join(a, b + '.torrent') if piece_len_exp == 0: # automatic size = calcsize(file) if size > 8L*1024*1024*1024: # > 8 gig = piece_len_exp = 21 # 2 meg pieces elif size > 2*1024*1024*1024: # > 2 gig = piece_len_exp = 20 # 1 meg pieces elif size > 512*1024*1024: # > 512M = piece_len_exp = 19 # 512K pieces elif size > 64*1024*1024: # > 64M = piece_len_exp = 18 # 256K pieces elif size > 16*1024*1024: # > 16M = piece_len_exp = 17 # 128K pieces elif size > 4*1024*1024: # > 4M = piece_len_exp = 16 # 64K pieces else: # < 4M = piece_len_exp = 15 # 32K pieces piece_length = 2 ** piece_len_exp encoding = None if params.has_key('filesystem_encoding'): encoding = params['filesystem_encoding'] if not encoding: encoding = ENCODING if not encoding: encoding = 'ascii' info = makeinfo(file, piece_length, encoding, flag, progress, progress_percent) if flag.isSet(): return check_info(info) h = open(f, 'wb') data = {'info': info, 'announce': strip(url), 'creation date': long(time())} if params.has_key('comment') and params['comment']: data['comment'] = params['comment'] if params.has_key('real_announce_list'): # shortcut for progs calling in from outside data['announce-list'] = params['real_announce_list'] elif params.has_key('announce_list') and params['announce_list']: l = [] for tier in params['announce_list'].split('|'): l.append(tier.split(',')) data['announce-list'] = l if params.has_key('real_httpseeds'): # shortcut for progs calling in from outside data['httpseeds'] = params['real_httpseeds'] elif params.has_key('httpseeds') and params['httpseeds']: data['httpseeds'] = params['httpseeds'].split('|') h.write(bencode(data)) h.close() def calcsize(file): if not isdir(file): return getsize(file) total = 0L for s in subfiles(abspath(file)): total += getsize(s[1]) return total def uniconvertl(l, e): r = [] try: for s in l: r.append(uniconvert(s, e)) except UnicodeError: raise UnicodeError('bad filename: '+join(l)) return r def uniconvert(s, e): try: s = unicode(s,e) except UnicodeError: raise UnicodeError('bad filename: '+s) return s.encode('utf-8') def makeinfo(file, piece_length, encoding, flag, progress, progress_percent=1): file = abspath(file) if isdir(file): subs = subfiles(file) subs.sort() pieces = [] sh = sha() done = 0L fs = [] totalsize = 0.0 totalhashed = 0L for p, f in subs: totalsize += getsize(f) for p, f in subs: pos = 0L size = getsize(f) fs.append({'length': size, 'path': uniconvertl(p, encoding)}) h = open(f, 'rb') while pos < size: a = min(size - pos, piece_length - done) sh.update(h.read(a)) if flag.isSet(): return done += a pos += a totalhashed += a if done == piece_length: pieces.append(sh.digest()) done = 0 sh = sha() if progress_percent: progress(totalhashed / totalsize) else: progress(a) h.close() if done > 0: pieces.append(sh.digest()) return {'pieces': ''.join(pieces), 'piece length': piece_length, 'files': fs, 'name': uniconvert(split(file)[1], encoding) } else: size = getsize(file) pieces = [] p = 0L h = open(file, 'rb') while p < size: x = h.read(min(piece_length, size - p)) if flag.isSet(): return pieces.append(sha(x).digest()) p += piece_length if p > size: p = size if progress_percent: progress(float(p) / size) else: progress(min(piece_length, size - p)) h.close() return {'pieces': ''.join(pieces), 'piece length': piece_length, 'length': size, 'name': uniconvert(split(file)[1], encoding) } def subfiles(d): r = [] stack = [([], d)] while len(stack) > 0: p, n = stack.pop() if isdir(n): for s in listdir(n): if s not in ignore and s[:1] != '.': stack.append((copy(p) + [s], join(n, s))) else: r.append((p, n)) return r def completedir(dir, url, params = {}, flag = Event(), vc = lambda x: None, fc = lambda x: None): files = listdir(dir) files.sort() ext = '.torrent' if params.has_key('target'): target = params['target'] else: target = '' togen = [] for f in files: if f[-len(ext):] != ext and (f + ext) not in files: togen.append(join(dir, f)) total = 0 for i in togen: total += calcsize(i) subtotal = [0] def callback(x, subtotal = subtotal, total = total, vc = vc): subtotal[0] += x vc(float(subtotal[0]) / total) for i in togen: fc(i) try: t = split(i)[-1] if t not in ignore and t[0] != '.': if target != '': params['target'] = join(target,t+ext) make_meta_file(i, url, params, flag, progress = callback, progress_percent = 0) except ValueError: print_exc() armory-0.92.3/BitTornado/BT1/track.py0000644000000000000000000013430012414772654015742 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from BitTornado.parseargs import parseargs, formatDefinitions from BitTornado.RawServer import RawServer, autodetect_ipv6, autodetect_socket_style from BitTornado.HTTPHandler import HTTPHandler, months, weekdays from BitTornado.parsedir import parsedir from NatCheck import NatCheck from T2T import T2TList from BitTornado.subnetparse import IP_List, ipv6_to_ipv4, to_ipv4, is_valid_ip, is_ipv4 from BitTornado.iprangeparse import IP_List as IP_Range_List from BitTornado.torrentlistparse import parsetorrentlist from threading import Event, Thread from BitTornado.bencode import bencode, bdecode, Bencached from BitTornado.zurllib import urlopen, quote, unquote from Filter import Filter from urlparse import urlparse from os import rename, getpid from os.path import exists, isfile from cStringIO import StringIO from traceback import print_exc from time import time, gmtime, strftime, localtime from BitTornado.clock import clock from random import shuffle, seed, randrange from sha import sha from types import StringType, IntType, LongType, ListType, DictType from binascii import b2a_hex, a2b_hex, a2b_base64 from string import lower import sys, os import signal import re import BitTornado.__init__ from BitTornado.__init__ import version, createPeerID try: True except: True = 1 False = 0 defaults = [ ('port', 80, "Port to listen on."), ('dfile', None, 'file to store recent downloader info in'), ('bind', '', 'comma-separated list of ips/hostnames to bind to locally'), # ('ipv6_enabled', autodetect_ipv6(), ('ipv6_enabled', 0, 'allow the client to connect to peers via IPv6'), ('ipv6_binds_v4', autodetect_socket_style(), 'set if an IPv6 server socket will also field IPv4 connections'), ('socket_timeout', 15, 'timeout for closing connections'), ('save_dfile_interval', 5 * 60, 'seconds between saving dfile'), ('timeout_downloaders_interval', 45 * 60, 'seconds between expiring downloaders'), ('reannounce_interval', 30 * 60, 'seconds downloaders should wait between reannouncements'), ('response_size', 50, 'number of peers to send in an info message'), ('timeout_check_interval', 5, 'time to wait between checking if any connections have timed out'), ('nat_check', 3, "how many times to check if a downloader is behind a NAT (0 = don't check)"), ('log_nat_checks', 0, "whether to add entries to the log for nat-check results"), ('min_time_between_log_flushes', 3.0, 'minimum time it must have been since the last flush to do another one'), ('min_time_between_cache_refreshes', 600.0, 'minimum time in seconds before a cache is considered stale and is flushed'), ('allowed_dir', '', 'only allow downloads for .torrents in this dir'), ('allowed_list', '', 'only allow downloads for hashes in this list (hex format, one per line)'), ('allowed_controls', 0, 'allow special keys in torrents in the allowed_dir to affect tracker access'), ('multitracker_enabled', 0, 'whether to enable multitracker operation'), ('multitracker_allowed', 'autodetect', 'whether to allow incoming tracker announces (can be none, autodetect or all)'), ('multitracker_reannounce_interval', 2 * 60, 'seconds between outgoing tracker announces'), ('multitracker_maxpeers', 20, 'number of peers to get in a tracker announce'), ('aggregate_forward', '', 'format: [,] - if set, forwards all non-multitracker to this url with this optional password'), ('aggregator', '0', 'whether to act as a data aggregator rather than a tracker. If enabled, may be 1, or ; ' + 'if password is set, then an incoming password is required for access'), ('hupmonitor', 0, 'whether to reopen the log file upon receipt of HUP signal'), ('http_timeout', 60, 'number of seconds to wait before assuming that an http connection has timed out'), ('parse_dir_interval', 60, 'seconds between reloading of allowed_dir or allowed_file ' + 'and allowed_ips and banned_ips lists'), ('show_infopage', 1, "whether to display an info page when the tracker's root dir is loaded"), ('infopage_redirect', '', 'a URL to redirect the info page to'), ('show_names', 1, 'whether to display names from allowed dir'), ('favicon', '', 'file containing x-icon data to return when browser requests favicon.ico'), ('allowed_ips', '', 'only allow connections from IPs specified in the given file; '+ 'file contains subnet data in the format: aa.bb.cc.dd/len'), ('banned_ips', '', "don't allow connections from IPs specified in the given file; "+ 'file contains IP range data in the format: xxx:xxx:ip1-ip2'), ('only_local_override_ip', 2, "ignore the ip GET parameter from machines which aren't on local network IPs " + "(0 = never, 1 = always, 2 = ignore if NAT checking is not enabled)"), ('logfile', '', 'file to write the tracker logs, use - for stdout (default)'), ('allow_get', 0, 'use with allowed_dir; adds a /file?hash={hash} url that allows users to download the torrent file'), ('keep_dead', 0, 'keep dead torrents after they expire (so they still show up on your /scrape and web page)'), ('scrape_allowed', 'full', 'scrape access allowed (can be none, specific or full)'), ('dedicated_seed_id', '', 'allows tracker to monitor dedicated seed(s) and flag torrents as seeded'), ] def statefiletemplate(x): if type(x) != DictType: raise ValueError for cname, cinfo in x.items(): if cname == 'peers': for y in cinfo.values(): # The 'peers' key is a dictionary of SHA hashes (torrent ids) if type(y) != DictType: # ... for the active torrents, and each is a dictionary raise ValueError for id, info in y.items(): # ... of client ids interested in that torrent if (len(id) != 20): raise ValueError if type(info) != DictType: # ... each of which is also a dictionary raise ValueError # ... which has an IP, a Port, and a Bytes Left count for that client for that torrent if type(info.get('ip', '')) != StringType: raise ValueError port = info.get('port') if type(port) not in (IntType,LongType) or port < 0: raise ValueError left = info.get('left') if type(left) not in (IntType,LongType) or left < 0: raise ValueError elif cname == 'completed': if (type(cinfo) != DictType): # The 'completed' key is a dictionary of SHA hashes (torrent ids) raise ValueError # ... for keeping track of the total completions per torrent for y in cinfo.values(): # ... each torrent has an integer value if type(y) not in (IntType,LongType): raise ValueError # ... for the number of reported completions for that torrent elif cname == 'allowed': if (type(cinfo) != DictType): # a list of info_hashes and included data raise ValueError if x.has_key('allowed_dir_files'): adlist = [z[1] for z in x['allowed_dir_files'].values()] for y in cinfo.keys(): # and each should have a corresponding key here if not y in adlist: raise ValueError elif cname == 'allowed_dir_files': if (type(cinfo) != DictType): # a list of files, their attributes and info hashes raise ValueError dirkeys = {} for y in cinfo.values(): # each entry should have a corresponding info_hash if not y[1]: continue if not x['allowed'].has_key(y[1]): raise ValueError if dirkeys.has_key(y[1]): # and each should have a unique info_hash raise ValueError dirkeys[y[1]] = 1 alas = 'your file may exist elsewhere in the universe\nbut alas, not here\n' local_IPs = IP_List() local_IPs.set_intranet_addresses() def isotime(secs = None): if secs == None: secs = time() return strftime('%Y-%m-%d %H:%M UTC', gmtime(secs)) http_via_filter = re.compile(' for ([0-9.]+)\Z') def _get_forwarded_ip(headers): header = headers.get('x-forwarded-for') if header: try: x,y = header.split(',') except: return header if is_valid_ip(x) and not local_IPs.includes(x): return x return y header = headers.get('client-ip') if header: return header header = headers.get('via') if header: x = http_via_filter.search(header) try: return x.group(1) except: pass header = headers.get('from') #if header: # return header #return None return header def get_forwarded_ip(headers): x = _get_forwarded_ip(headers) if not is_valid_ip(x) or local_IPs.includes(x): return None return x def compact_peer_info(ip, port): try: s = ( ''.join([chr(int(i)) for i in ip.split('.')]) + chr((port & 0xFF00) >> 8) + chr(port & 0xFF) ) if len(s) != 6: raise ValueError except: s = '' # not a valid IP, must be a domain name return s class Tracker: def __init__(self, config, rawserver): self.config = config self.response_size = config['response_size'] self.dfile = config['dfile'] self.natcheck = config['nat_check'] favicon = config['favicon'] self.parse_dir_interval = config['parse_dir_interval'] self.favicon = None if favicon: try: h = open(favicon,'r') self.favicon = h.read() h.close() except: print "**warning** specified favicon file -- %s -- does not exist." % favicon self.rawserver = rawserver self.cached = {} # format: infohash: [[time1, l1, s1], [time2, l2, s2], [time3, l3, s3]] self.cached_t = {} # format: infohash: [time, cache] self.times = {} self.state = {} self.seedcount = {} self.allowed_IPs = None self.banned_IPs = None if config['allowed_ips'] or config['banned_ips']: self.allowed_ip_mtime = 0 self.banned_ip_mtime = 0 self.read_ip_lists() self.only_local_override_ip = config['only_local_override_ip'] if self.only_local_override_ip == 2: self.only_local_override_ip = not config['nat_check'] if exists(self.dfile): try: h = open(self.dfile, 'rb') ds = h.read() h.close() tempstate = bdecode(ds) if not tempstate.has_key('peers'): tempstate = {'peers': tempstate} statefiletemplate(tempstate) self.state = tempstate except: print '**warning** statefile '+self.dfile+' corrupt; resetting' self.downloads = self.state.setdefault('peers', {}) self.completed = self.state.setdefault('completed', {}) self.becache = {} # format: infohash: [[l1, s1], [l2, s2], [l3, s3]] for infohash, ds in self.downloads.items(): self.seedcount[infohash] = 0 for x,y in ds.items(): ip = y['ip'] if ( (self.allowed_IPs and not self.allowed_IPs.includes(ip)) or (self.banned_IPs and self.banned_IPs.includes(ip)) ): del ds[x] continue if not y['left']: self.seedcount[infohash] += 1 if y.get('nat',-1): continue gip = y.get('given_ip') if is_valid_ip(gip) and ( not self.only_local_override_ip or local_IPs.includes(ip) ): ip = gip self.natcheckOK(infohash,x,ip,y['port'],y['left']) for x in self.downloads.keys(): self.times[x] = {} for y in self.downloads[x].keys(): self.times[x][y] = 0 self.trackerid = createPeerID('-T-') seed(self.trackerid) self.reannounce_interval = config['reannounce_interval'] self.save_dfile_interval = config['save_dfile_interval'] self.show_names = config['show_names'] rawserver.add_task(self.save_state, self.save_dfile_interval) self.prevtime = clock() self.timeout_downloaders_interval = config['timeout_downloaders_interval'] rawserver.add_task(self.expire_downloaders, self.timeout_downloaders_interval) self.logfile = None self.log = None if (config['logfile']) and (config['logfile'] != '-'): try: self.logfile = config['logfile'] self.log = open(self.logfile,'a') sys.stdout = self.log print "# Log Started: ", isotime() except: print "**warning** could not redirect stdout to log file: ", sys.exc_info()[0] if config['hupmonitor']: def huphandler(signum, frame, self = self): try: self.log.close () self.log = open(self.logfile,'a') sys.stdout = self.log print "# Log reopened: ", isotime() except: print "**warning** could not reopen logfile" signal.signal(signal.SIGHUP, huphandler) self.allow_get = config['allow_get'] self.t2tlist = T2TList(config['multitracker_enabled'], self.trackerid, config['multitracker_reannounce_interval'], config['multitracker_maxpeers'], config['http_timeout'], self.rawserver) if config['allowed_list']: if config['allowed_dir']: print '**warning** allowed_dir and allowed_list options cannot be used together' print '**warning** disregarding allowed_dir' config['allowed_dir'] = '' self.allowed = self.state.setdefault('allowed_list',{}) self.allowed_list_mtime = 0 self.parse_allowed() self.remove_from_state('allowed','allowed_dir_files') if config['multitracker_allowed'] == 'autodetect': config['multitracker_allowed'] = 'none' config['allowed_controls'] = 0 elif config['allowed_dir']: self.allowed = self.state.setdefault('allowed',{}) self.allowed_dir_files = self.state.setdefault('allowed_dir_files',{}) self.allowed_dir_blocked = {} self.parse_allowed() self.remove_from_state('allowed_list') else: self.allowed = None self.remove_from_state('allowed','allowed_dir_files', 'allowed_list') if config['multitracker_allowed'] == 'autodetect': config['multitracker_allowed'] = 'none' config['allowed_controls'] = 0 self.uq_broken = unquote('+') != ' ' self.keep_dead = config['keep_dead'] self.Filter = Filter(rawserver.add_task) aggregator = config['aggregator'] if aggregator == '0': self.is_aggregator = False self.aggregator_key = None else: self.is_aggregator = True if aggregator == '1': self.aggregator_key = None else: self.aggregator_key = aggregator self.natcheck = False send = config['aggregate_forward'] if not send: self.aggregate_forward = None else: try: self.aggregate_forward, self.aggregate_password = send.split(',') except: self.aggregate_forward = send self.aggregate_password = None self.dedicated_seed_id = config['dedicated_seed_id'] self.is_seeded = {} self.cachetime = 0 self.cachetimeupdate() def cachetimeupdate(self): self.cachetime += 1 # raw clock, but more efficient for cache self.rawserver.add_task(self.cachetimeupdate,1) def aggregate_senddata(self, query): url = self.aggregate_forward+'?'+query if self.aggregate_password is not None: url += '&password='+self.aggregate_password rq = Thread(target = self._aggregate_senddata, args = [url]) rq.setDaemon(False) rq.start() def _aggregate_senddata(self, url): # just send, don't attempt to error check, try: # discard any returned data h = urlopen(url) h.read() h.close() except: return def get_infopage(self): try: if not self.config['show_infopage']: return (404, 'Not Found', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, alas) red = self.config['infopage_redirect'] if red: return (302, 'Found', {'Content-Type': 'text/html', 'Location': red}, 'Click Here') s = StringIO() s.write('\n' \ 'BitTorrent download info\n') if self.favicon is not None: s.write('\n') s.write('\n\n' \ '

BitTorrent download info

\n'\ '
    \n' '
  • tracker version: %s
    • \n' \ '
  • server time: %s
    • \n' \ '
\n' % (version, isotime())) if self.config['allowed_dir']: if self.show_names: names = [ (self.allowed[hash]['name'],hash) for hash in self.allowed.keys() ] else: names = [ (None,hash) for hash in self.allowed.keys() ] else: names = [ (None,hash) for hash in self.downloads.keys() ] if not names: s.write('

not tracking any files yet...

\n') else: names.sort() tn = 0 tc = 0 td = 0 tt = 0 # Total transferred ts = 0 # Total size nf = 0 # Number of files displayed if self.config['allowed_dir'] and self.show_names: s.write('\n' \ '\n') else: s.write('
info hashtorrent namesizecompletedownloadingdownloadedtransferred
\n' \ '\n') for name,hash in names: l = self.downloads[hash] n = self.completed.get(hash, 0) tn = tn + n c = self.seedcount[hash] tc = tc + c d = len(l) - c td = td + d if self.config['allowed_dir'] and self.show_names: if self.allowed.has_key(hash): nf = nf + 1 sz = self.allowed[hash]['length'] # size ts = ts + sz szt = sz * n # Transferred for this torrent tt = tt + szt if self.allow_get == 1: linkname = '' + name + '' else: linkname = name s.write('\n' \ % (b2a_hex(hash), linkname, size_format(sz), c, d, n, size_format(szt))) else: s.write('\n' \ % (b2a_hex(hash), c, d, n)) ttn = 0 for i in self.completed.values(): ttn = ttn + i if self.config['allowed_dir'] and self.show_names: s.write('\n' % (nf, size_format(ts), tc, td, tn, ttn, size_format(tt))) else: s.write('\n' % (nf, tc, td, tn, ttn)) s.write('
info hashcompletedownloadingdownloaded
%s%s%s%i%i%i%s
%s%i%i%i
%i files%s%i%i%i/%i%s
%i files%i%i%i/%i
\n' \ '
    \n' \ '
  • info hash: SHA1 hash of the "info" section of the metainfo (*.torrent)
    • \n' \ '
  • complete: number of connected clients with the complete file
    • \n' \ '
  • downloading: number of connected clients still downloading
    • \n' \ '
  • downloaded: reported complete downloads (total: current/all)
    • \n' \ '
  • transferred: torrent size * total downloaded (does not include partial transfers)
    • \n' \ '
\n') s.write('\n' \ '\n') return (200, 'OK', {'Content-Type': 'text/html; charset=iso-8859-1'}, s.getvalue()) except: print_exc() return (500, 'Internal Server Error', {'Content-Type': 'text/html; charset=iso-8859-1'}, 'Server Error') def scrapedata(self, hash, return_name = True): l = self.downloads[hash] n = self.completed.get(hash, 0) c = self.seedcount[hash] d = len(l) - c f = {'complete': c, 'incomplete': d, 'downloaded': n} if return_name and self.show_names and self.config['allowed_dir']: f['name'] = self.allowed[hash]['name'] return (f) def get_scrape(self, paramslist): fs = {} if paramslist.has_key('info_hash'): if self.config['scrape_allowed'] not in ['specific', 'full']: return (400, 'Not Authorized', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, bencode({'failure reason': 'specific scrape function is not available with this tracker.'})) for hash in paramslist['info_hash']: if self.allowed is not None: if self.allowed.has_key(hash): fs[hash] = self.scrapedata(hash) else: if self.downloads.has_key(hash): fs[hash] = self.scrapedata(hash) else: if self.config['scrape_allowed'] != 'full': return (400, 'Not Authorized', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, bencode({'failure reason': 'full scrape function is not available with this tracker.'})) if self.allowed is not None: keys = self.allowed.keys() else: keys = self.downloads.keys() for hash in keys: fs[hash] = self.scrapedata(hash) return (200, 'OK', {'Content-Type': 'text/plain'}, bencode({'files': fs})) def get_file(self, hash): if not self.allow_get: return (400, 'Not Authorized', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, 'get function is not available with this tracker.') if not self.allowed.has_key(hash): return (404, 'Not Found', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, alas) fname = self.allowed[hash]['file'] fpath = self.allowed[hash]['path'] return (200, 'OK', {'Content-Type': 'application/x-bittorrent', 'Content-Disposition': 'attachment; filename=' + fname}, open(fpath, 'rb').read()) def check_allowed(self, infohash, paramslist): if ( self.aggregator_key is not None and not ( paramslist.has_key('password') and paramslist['password'][0] == self.aggregator_key ) ): return (200, 'Not Authorized', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, bencode({'failure reason': 'Requested download is not authorized for use with this tracker.'})) if self.allowed is not None: if not self.allowed.has_key(infohash): return (200, 'Not Authorized', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, bencode({'failure reason': 'Requested download is not authorized for use with this tracker.'})) if self.config['allowed_controls']: if self.allowed[infohash].has_key('failure reason'): return (200, 'Not Authorized', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, bencode({'failure reason': self.allowed[infohash]['failure reason']})) if paramslist.has_key('tracker'): if ( self.config['multitracker_allowed'] == 'none' or # turned off paramslist['peer_id'][0] == self.trackerid ): # oops! contacted myself return (200, 'Not Authorized', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, bencode({'failure reason': 'disallowed'})) if ( self.config['multitracker_allowed'] == 'autodetect' and not self.allowed[infohash].has_key('announce-list') ): return (200, 'Not Authorized', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, bencode({'failure reason': 'Requested download is not authorized for multitracker use.'})) return None def add_data(self, infohash, event, ip, paramslist): peers = self.downloads.setdefault(infohash, {}) ts = self.times.setdefault(infohash, {}) self.completed.setdefault(infohash, 0) self.seedcount.setdefault(infohash, 0) def params(key, default = None, l = paramslist): if l.has_key(key): return l[key][0] return default myid = params('peer_id','') if len(myid) != 20: raise ValueError, 'id not of length 20' if event not in ['started', 'completed', 'stopped', 'snooped', None]: raise ValueError, 'invalid event' port = long(params('port','')) if port < 0 or port > 65535: raise ValueError, 'invalid port' left = long(params('left','')) if left < 0: raise ValueError, 'invalid amount left' uploaded = long(params('uploaded','')) downloaded = long(params('downloaded','')) peer = peers.get(myid) islocal = local_IPs.includes(ip) mykey = params('key') if peer: auth = peer.get('key',-1) == mykey or peer.get('ip') == ip gip = params('ip') if is_valid_ip(gip) and (islocal or not self.only_local_override_ip): ip1 = gip else: ip1 = ip if params('numwant') is not None: rsize = min(int(params('numwant')),self.response_size) else: rsize = self.response_size if event == 'stopped': if peer: if auth: self.delete_peer(infohash,myid) elif not peer: ts[myid] = clock() peer = {'ip': ip, 'port': port, 'left': left} if mykey: peer['key'] = mykey if gip: peer['given ip'] = gip if port: if not self.natcheck or islocal: peer['nat'] = 0 self.natcheckOK(infohash,myid,ip1,port,left) else: NatCheck(self.connectback_result,infohash,myid,ip1,port,self.rawserver) else: peer['nat'] = 2**30 if event == 'completed': self.completed[infohash] += 1 if not left: self.seedcount[infohash] += 1 peers[myid] = peer else: if not auth: return rsize # return w/o changing stats ts[myid] = clock() if not left and peer['left']: self.completed[infohash] += 1 self.seedcount[infohash] += 1 if not peer.get('nat', -1): for bc in self.becache[infohash]: bc[1][myid] = bc[0][myid] del bc[0][myid] elif left and not peer['left']: self.completed[infohash] -= 1 self.seedcount[infohash] -= 1 if not peer.get('nat', -1): for bc in self.becache[infohash]: bc[0][myid] = bc[1][myid] del bc[1][myid] peer['left'] = left if port: recheck = False if ip != peer['ip']: peer['ip'] = ip recheck = True if gip != peer.get('given ip'): if gip: peer['given ip'] = gip elif peer.has_key('given ip'): del peer['given ip'] recheck = True natted = peer.get('nat', -1) if recheck: if natted == 0: l = self.becache[infohash] y = not peer['left'] for x in l: del x[y][myid] if natted >= 0: del peer['nat'] # restart NAT testing if natted and natted < self.natcheck: recheck = True if recheck: if not self.natcheck or islocal: peer['nat'] = 0 self.natcheckOK(infohash,myid,ip1,port,left) else: NatCheck(self.connectback_result,infohash,myid,ip1,port,self.rawserver) return rsize def peerlist(self, infohash, stopped, tracker, is_seed, return_type, rsize): data = {} # return data seeds = self.seedcount[infohash] data['complete'] = seeds data['incomplete'] = len(self.downloads[infohash]) - seeds if ( self.config['allowed_controls'] and self.allowed[infohash].has_key('warning message') ): data['warning message'] = self.allowed[infohash]['warning message'] if tracker: data['interval'] = self.config['multitracker_reannounce_interval'] if not rsize: return data cache = self.cached_t.setdefault(infohash, None) if ( not cache or len(cache[1]) < rsize or cache[0] + self.config['min_time_between_cache_refreshes'] < clock() ): bc = self.becache.setdefault(infohash,[[{}, {}], [{}, {}], [{}, {}]]) cache = [ clock(), bc[0][0].values() + bc[0][1].values() ] self.cached_t[infohash] = cache shuffle(cache[1]) cache = cache[1] data['peers'] = cache[-rsize:] del cache[-rsize:] return data data['interval'] = self.reannounce_interval if stopped or not rsize: # save some bandwidth data['peers'] = [] return data bc = self.becache.setdefault(infohash,[[{}, {}], [{}, {}], [{}, {}]]) len_l = len(bc[0][0]) len_s = len(bc[0][1]) if not (len_l+len_s): # caches are empty! data['peers'] = [] return data l_get_size = int(float(rsize)*(len_l)/(len_l+len_s)) cache = self.cached.setdefault(infohash,[None,None,None])[return_type] if cache and ( not cache[1] or (is_seed and len(cache[1]) < rsize) or len(cache[1]) < l_get_size or cache[0]+self.config['min_time_between_cache_refreshes'] < self.cachetime ): cache = None if not cache: peers = self.downloads[infohash] vv = [[],[],[]] for key, ip, port in self.t2tlist.harvest(infohash): # empty if disabled if not peers.has_key(key): vv[0].append({'ip': ip, 'port': port, 'peer id': key}) vv[1].append({'ip': ip, 'port': port}) vv[2].append(compact_peer_info(ip, port)) cache = [ self.cachetime, bc[return_type][0].values()+vv[return_type], bc[return_type][1].values() ] shuffle(cache[1]) shuffle(cache[2]) self.cached[infohash][return_type] = cache for rr in xrange(len(self.cached[infohash])): if rr != return_type: try: self.cached[infohash][rr][1].extend(vv[rr]) except: pass if len(cache[1]) < l_get_size: peerdata = cache[1] if not is_seed: peerdata.extend(cache[2]) cache[1] = [] cache[2] = [] else: if not is_seed: peerdata = cache[2][l_get_size-rsize:] del cache[2][l_get_size-rsize:] rsize -= len(peerdata) else: peerdata = [] if rsize: peerdata.extend(cache[1][-rsize:]) del cache[1][-rsize:] if return_type == 2: peerdata = ''.join(peerdata) data['peers'] = peerdata return data def get(self, connection, path, headers): real_ip = connection.get_ip() ip = real_ip if is_ipv4(ip): ipv4 = True else: try: ip = ipv6_to_ipv4(ip) ipv4 = True except ValueError: ipv4 = False if ( (self.allowed_IPs and not self.allowed_IPs.includes(ip)) or (self.banned_IPs and self.banned_IPs.includes(ip)) ): return (400, 'Not Authorized', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, bencode({'failure reason': 'your IP is not allowed on this tracker'})) nip = get_forwarded_ip(headers) if nip and not self.only_local_override_ip: ip = nip try: ip = to_ipv4(ip) ipv4 = True except ValueError: ipv4 = False paramslist = {} def params(key, default = None, l = paramslist): if l.has_key(key): return l[key][0] return default try: (scheme, netloc, path, pars, query, fragment) = urlparse(path) if self.uq_broken == 1: path = path.replace('+',' ') query = query.replace('+',' ') path = unquote(path)[1:] for s in query.split('&'): if s: i = s.index('=') kw = unquote(s[:i]) paramslist.setdefault(kw, []) paramslist[kw] += [unquote(s[i+1:])] if path == '' or path == 'index.html': return self.get_infopage() if (path == 'file'): return self.get_file(params('info_hash')) if path == 'favicon.ico' and self.favicon is not None: return (200, 'OK', {'Content-Type' : 'image/x-icon'}, self.favicon) # automated access from here on if path in ('scrape', 'scrape.php', 'tracker.php/scrape'): return self.get_scrape(paramslist) if not path in ('announce', 'announce.php', 'tracker.php/announce'): return (404, 'Not Found', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, alas) # main tracker function filtered = self.Filter.check(real_ip, paramslist, headers) if filtered: return (400, 'Not Authorized', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, bencode({'failure reason': filtered})) infohash = params('info_hash') if not infohash: raise ValueError, 'no info hash' notallowed = self.check_allowed(infohash, paramslist) if notallowed: return notallowed event = params('event') rsize = self.add_data(infohash, event, ip, paramslist) except ValueError, e: return (400, 'Bad Request', {'Content-Type': 'text/plain'}, 'you sent me garbage - ' + str(e)) if self.aggregate_forward and not paramslist.has_key('tracker'): self.aggregate_senddata(query) if self.is_aggregator: # don't return peer data here return (200, 'OK', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, bencode({'response': 'OK'})) if params('compact') and ipv4: return_type = 2 elif params('no_peer_id'): return_type = 1 else: return_type = 0 data = self.peerlist(infohash, event=='stopped', params('tracker'), not params('left'), return_type, rsize) if paramslist.has_key('scrape'): # deprecated data['scrape'] = self.scrapedata(infohash, False) if self.dedicated_seed_id: if params('seed_id') == self.dedicated_seed_id and params('left') == 0: self.is_seeded[infohash] = True if params('check_seeded') and self.is_seeded.get(infohash): data['seeded'] = 1 return (200, 'OK', {'Content-Type': 'text/plain', 'Pragma': 'no-cache'}, bencode(data)) def natcheckOK(self, infohash, peerid, ip, port, not_seed): bc = self.becache.setdefault(infohash,[[{}, {}], [{}, {}], [{}, {}]]) bc[0][not not_seed][peerid] = Bencached(bencode({'ip': ip, 'port': port, 'peer id': peerid})) bc[1][not not_seed][peerid] = Bencached(bencode({'ip': ip, 'port': port})) bc[2][not not_seed][peerid] = compact_peer_info(ip, port) def natchecklog(self, peerid, ip, port, result): year, month, day, hour, minute, second, a, b, c = localtime(time()) print '%s - %s [%02d/%3s/%04d:%02d:%02d:%02d] "!natcheck-%s:%i" %i 0 - -' % ( ip, quote(peerid), day, months[month], year, hour, minute, second, ip, port, result) def connectback_result(self, result, downloadid, peerid, ip, port): record = self.downloads.get(downloadid, {}).get(peerid) if ( record is None or (record['ip'] != ip and record.get('given ip') != ip) or record['port'] != port ): if self.config['log_nat_checks']: self.natchecklog(peerid, ip, port, 404) return if self.config['log_nat_checks']: if result: x = 200 else: x = 503 self.natchecklog(peerid, ip, port, x) if not record.has_key('nat'): record['nat'] = int(not result) if result: self.natcheckOK(downloadid,peerid,ip,port,record['left']) elif result and record['nat']: record['nat'] = 0 self.natcheckOK(downloadid,peerid,ip,port,record['left']) elif not result: record['nat'] += 1 def remove_from_state(self, *l): for s in l: try: del self.state[s] except: pass def save_state(self): self.rawserver.add_task(self.save_state, self.save_dfile_interval) h = open(self.dfile, 'wb') h.write(bencode(self.state)) h.close() def parse_allowed(self): self.rawserver.add_task(self.parse_allowed, self.parse_dir_interval) if self.config['allowed_dir']: r = parsedir( self.config['allowed_dir'], self.allowed, self.allowed_dir_files, self.allowed_dir_blocked, [".torrent"] ) ( self.allowed, self.allowed_dir_files, self.allowed_dir_blocked, added, garbage2 ) = r self.state['allowed'] = self.allowed self.state['allowed_dir_files'] = self.allowed_dir_files self.t2tlist.parse(self.allowed) else: f = self.config['allowed_list'] if self.allowed_list_mtime == os.path.getmtime(f): return try: r = parsetorrentlist(f, self.allowed) (self.allowed, added, garbage2) = r self.state['allowed_list'] = self.allowed except (IOError, OSError): print '**warning** unable to read allowed torrent list' return self.allowed_list_mtime = os.path.getmtime(f) for infohash in added.keys(): self.downloads.setdefault(infohash, {}) self.completed.setdefault(infohash, 0) self.seedcount.setdefault(infohash, 0) def read_ip_lists(self): self.rawserver.add_task(self.read_ip_lists,self.parse_dir_interval) f = self.config['allowed_ips'] if f and self.allowed_ip_mtime != os.path.getmtime(f): self.allowed_IPs = IP_List() try: self.allowed_IPs.read_fieldlist(f) self.allowed_ip_mtime = os.path.getmtime(f) except (IOError, OSError): print '**warning** unable to read allowed_IP list' f = self.config['banned_ips'] if f and self.banned_ip_mtime != os.path.getmtime(f): self.banned_IPs = IP_Range_List() try: self.banned_IPs.read_rangelist(f) self.banned_ip_mtime = os.path.getmtime(f) except (IOError, OSError): print '**warning** unable to read banned_IP list' def delete_peer(self, infohash, peerid): dls = self.downloads[infohash] peer = dls[peerid] if not peer['left']: self.seedcount[infohash] -= 1 if not peer.get('nat',-1): l = self.becache[infohash] y = not peer['left'] for x in l: del x[y][peerid] del self.times[infohash][peerid] del dls[peerid] def expire_downloaders(self): for x in self.times.keys(): for myid, t in self.times[x].items(): if t < self.prevtime: self.delete_peer(x,myid) self.prevtime = clock() if (self.keep_dead != 1): for key, value in self.downloads.items(): if len(value) == 0 and ( self.allowed is None or not self.allowed.has_key(key) ): del self.times[key] del self.downloads[key] del self.seedcount[key] self.rawserver.add_task(self.expire_downloaders, self.timeout_downloaders_interval) def track(args): if len(args) == 0: print formatDefinitions(defaults, 80) return try: config, files = parseargs(args, defaults, 0, 0) except ValueError, e: print 'error: ' + str(e) print 'run with no arguments for parameter explanations' return r = RawServer(Event(), config['timeout_check_interval'], config['socket_timeout'], ipv6_enable = config['ipv6_enabled']) t = Tracker(config, r) r.bind(config['port'], config['bind'], reuse = True, ipv6_socket_style = config['ipv6_binds_v4']) r.listen_forever(HTTPHandler(t.get, config['min_time_between_log_flushes'])) t.save_state() print '# Shutting down: ' + isotime() def size_format(s): if (s < 1024): r = str(s) + 'B' elif (s < 1048576): r = str(int(s/1024)) + 'KiB' elif (s < 1073741824L): r = str(int(s/1048576)) + 'MiB' elif (s < 1099511627776L): r = str(int((s/1073741824.0)*100.0)/100.0) + 'GiB' else: r = str(int((s/1099511627776.0)*100.0)/100.0) + 'TiB' return(r) armory-0.92.3/BitTornado/BT1/Encrypter.py0000644000000000000000000002450012414772654016611 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from cStringIO import StringIO from binascii import b2a_hex from socket import error as socketerror from urllib import quote from traceback import print_exc try: True except: True = 1 False = 0 MAX_INCOMPLETE = 8 protocol_name = 'BitTorrent protocol' option_pattern = chr(0)*8 def toint(s): return long(b2a_hex(s), 16) def tobinary(i): return (chr(i >> 24) + chr((i >> 16) & 0xFF) + chr((i >> 8) & 0xFF) + chr(i & 0xFF)) hexchars = '0123456789ABCDEF' hexmap = [] for i in xrange(256): hexmap.append(hexchars[(i&0xF0)/16]+hexchars[i&0x0F]) def tohex(s): r = [] for c in s: r.append(hexmap[ord(c)]) return ''.join(r) def make_readable(s): if not s: return '' if quote(s).find('%') >= 0: return tohex(s) return '"'+s+'"' class IncompleteCounter: def __init__(self): self.c = 0 def increment(self): self.c += 1 def decrement(self): self.c -= 1 def toomany(self): return self.c >= MAX_INCOMPLETE incompletecounter = IncompleteCounter() # header, reserved, download id, my id, [length, message] class Connection: def __init__(self, Encoder, connection, id, ext_handshake=False): self.Encoder = Encoder self.connection = connection self.connecter = Encoder.connecter self.id = id self.readable_id = make_readable(id) self.locally_initiated = (id != None) self.complete = False self.keepalive = lambda: None self.closed = False self.buffer = StringIO() if self.locally_initiated: incompletecounter.increment() if self.locally_initiated or ext_handshake: self.connection.write(chr(len(protocol_name)) + protocol_name + option_pattern + self.Encoder.download_id) if ext_handshake: self.Encoder.connecter.external_connection_made += 1 self.connection.write(self.Encoder.my_id) self.next_len, self.next_func = 20, self.read_peer_id else: self.next_len, self.next_func = 1, self.read_header_len self.Encoder.raw_server.add_task(self._auto_close, 15) def get_ip(self, real=False): return self.connection.get_ip(real) def get_id(self): return self.id def get_readable_id(self): return self.readable_id def is_locally_initiated(self): return self.locally_initiated def is_flushed(self): return self.connection.is_flushed() def read_header_len(self, s): if ord(s) != len(protocol_name): return None return len(protocol_name), self.read_header def read_header(self, s): if s != protocol_name: return None return 8, self.read_reserved def read_reserved(self, s): return 20, self.read_download_id def read_download_id(self, s): if s != self.Encoder.download_id: return None if not self.locally_initiated: self.Encoder.connecter.external_connection_made += 1 self.connection.write(chr(len(protocol_name)) + protocol_name + option_pattern + self.Encoder.download_id + self.Encoder.my_id) return 20, self.read_peer_id def read_peer_id(self, s): if not self.id: self.id = s self.readable_id = make_readable(s) else: if s != self.id: return None self.complete = self.Encoder.got_id(self) if not self.complete: return None if self.locally_initiated: self.connection.write(self.Encoder.my_id) incompletecounter.decrement() c = self.Encoder.connecter.connection_made(self) self.keepalive = c.send_keepalive return 4, self.read_len def read_len(self, s): l = toint(s) if l > self.Encoder.max_len: return None return l, self.read_message def read_message(self, s): if s != '': self.connecter.got_message(self, s) return 4, self.read_len def read_dead(self, s): return None def _auto_close(self): if not self.complete: self.close() def close(self): if not self.closed: self.connection.close() self.sever() def sever(self): self.closed = True del self.Encoder.connections[self.connection] if self.complete: self.connecter.connection_lost(self) elif self.locally_initiated: incompletecounter.decrement() def send_message_raw(self, message): if not self.closed: self.connection.write(message) def data_came_in(self, connection, s): self.Encoder.measurefunc(len(s)) while True: if self.closed: return i = self.next_len - self.buffer.tell() if i > len(s): self.buffer.write(s) return self.buffer.write(s[:i]) s = s[i:] m = self.buffer.getvalue() self.buffer.reset() self.buffer.truncate() try: x = self.next_func(m) except: self.next_len, self.next_func = 1, self.read_dead raise if x is None: self.close() return self.next_len, self.next_func = x def connection_flushed(self, connection): if self.complete: self.connecter.connection_flushed(self) def connection_lost(self, connection): if self.Encoder.connections.has_key(connection): self.sever() class Encoder: def __init__(self, connecter, raw_server, my_id, max_len, schedulefunc, keepalive_delay, download_id, measurefunc, config): self.raw_server = raw_server self.connecter = connecter self.my_id = my_id self.max_len = max_len self.schedulefunc = schedulefunc self.keepalive_delay = keepalive_delay self.download_id = download_id self.measurefunc = measurefunc self.config = config self.connections = {} self.banned = {} self.to_connect = [] self.paused = False if self.config['max_connections'] == 0: self.max_connections = 2 ** 30 else: self.max_connections = self.config['max_connections'] schedulefunc(self.send_keepalives, keepalive_delay) def send_keepalives(self): self.schedulefunc(self.send_keepalives, self.keepalive_delay) if self.paused: return for c in self.connections.values(): c.keepalive() def start_connections(self, list): if not self.to_connect: self.raw_server.add_task(self._start_connection_from_queue) self.to_connect = list def _start_connection_from_queue(self): if self.connecter.external_connection_made: max_initiate = self.config['max_initiate'] else: max_initiate = int(self.config['max_initiate']*1.5) cons = len(self.connections) if cons >= self.max_connections or cons >= max_initiate: delay = 60 elif self.paused or incompletecounter.toomany(): delay = 1 else: delay = 0 dns, id = self.to_connect.pop(0) self.start_connection(dns, id) if self.to_connect: self.raw_server.add_task(self._start_connection_from_queue, delay) def start_connection(self, dns, id): if ( self.paused or len(self.connections) >= self.max_connections or id == self.my_id or self.banned.has_key(dns[0]) ): return True for v in self.connections.values(): if v is None: continue if id and v.id == id: return True ip = v.get_ip(True) if self.config['security'] and ip != 'unknown' and ip == dns[0]: return True try: c = self.raw_server.start_connection(dns) con = Connection(self, c, id) self.connections[c] = con c.set_handler(con) except socketerror: return False return True def _start_connection(self, dns, id): def foo(self=self, dns=dns, id=id): self.start_connection(dns, id) self.schedulefunc(foo, 0) def got_id(self, connection): if connection.id == self.my_id: self.connecter.external_connection_made -= 1 return False ip = connection.get_ip(True) if self.config['security'] and self.banned.has_key(ip): return False for v in self.connections.values(): if connection is not v: if connection.id == v.id: return False if self.config['security'] and ip != 'unknown' and ip == v.get_ip(True): v.close() return True def external_connection_made(self, connection): if self.paused or len(self.connections) >= self.max_connections: connection.close() return False con = Connection(self, connection, None) self.connections[connection] = con connection.set_handler(con) return True def externally_handshaked_connection_made(self, connection, options, already_read): if self.paused or len(self.connections) >= self.max_connections: connection.close() return False con = Connection(self, connection, None, True) self.connections[connection] = con connection.set_handler(con) if already_read: con.data_came_in(con, already_read) return True def close_all(self): for c in self.connections.values(): c.close() self.connections = {} def ban(self, ip): self.banned[ip] = 1 def pause(self, flag): self.paused = flag armory-0.92.3/BitTornado/BT1/StreamCheck.py0000644000000000000000000000746412414772654017041 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from cStringIO import StringIO from binascii import b2a_hex from socket import error as socketerror from urllib import quote from traceback import print_exc import Connecter try: True except: True = 1 False = 0 DEBUG = False protocol_name = 'BitTorrent protocol' option_pattern = chr(0)*8 def toint(s): return long(b2a_hex(s), 16) def tobinary(i): return (chr(i >> 24) + chr((i >> 16) & 0xFF) + chr((i >> 8) & 0xFF) + chr(i & 0xFF)) hexchars = '0123456789ABCDEF' hexmap = [] for i in xrange(256): hexmap.append(hexchars[(i&0xF0)/16]+hexchars[i&0x0F]) def tohex(s): r = [] for c in s: r.append(hexmap[ord(c)]) return ''.join(r) def make_readable(s): if not s: return '' if quote(s).find('%') >= 0: return tohex(s) return '"'+s+'"' def toint(s): return long(b2a_hex(s), 16) # header, reserved, download id, my id, [length, message] streamno = 0 class StreamCheck: def __init__(self): global streamno self.no = streamno streamno += 1 self.buffer = StringIO() self.next_len, self.next_func = 1, self.read_header_len def read_header_len(self, s): if ord(s) != len(protocol_name): print self.no, 'BAD HEADER LENGTH' return len(protocol_name), self.read_header def read_header(self, s): if s != protocol_name: print self.no, 'BAD HEADER' return 8, self.read_reserved def read_reserved(self, s): return 20, self.read_download_id def read_download_id(self, s): if DEBUG: print self.no, 'download ID ' + tohex(s) return 20, self.read_peer_id def read_peer_id(self, s): if DEBUG: print self.no, 'peer ID' + make_readable(s) return 4, self.read_len def read_len(self, s): l = toint(s) if l > 2 ** 23: print self.no, 'BAD LENGTH: '+str(l)+' ('+s+')' return l, self.read_message def read_message(self, s): if not s: return 4, self.read_len m = s[0] if ord(m) > 8: print self.no, 'BAD MESSAGE: '+str(ord(m)) if m == Connecter.REQUEST: if len(s) != 13: print self.no, 'BAD REQUEST SIZE: '+str(len(s)) return 4, self.read_len index = toint(s[1:5]) begin = toint(s[5:9]) length = toint(s[9:]) print self.no, 'Request: '+str(index)+': '+str(begin)+'-'+str(begin)+'+'+str(length) elif m == Connecter.CANCEL: if len(s) != 13: print self.no, 'BAD CANCEL SIZE: '+str(len(s)) return 4, self.read_len index = toint(s[1:5]) begin = toint(s[5:9]) length = toint(s[9:]) print self.no, 'Cancel: '+str(index)+': '+str(begin)+'-'+str(begin)+'+'+str(length) elif m == Connecter.PIECE: index = toint(s[1:5]) begin = toint(s[5:9]) length = len(s)-9 print self.no, 'Piece: '+str(index)+': '+str(begin)+'-'+str(begin)+'+'+str(length) else: print self.no, 'Message '+str(ord(m))+' (length '+str(len(s))+')' return 4, self.read_len def write(self, s): while True: i = self.next_len - self.buffer.tell() if i > len(s): self.buffer.write(s) return self.buffer.write(s[:i]) s = s[i:] m = self.buffer.getvalue() self.buffer.reset() self.buffer.truncate() x = self.next_func(m) self.next_len, self.next_func = x armory-0.92.3/BitTornado/BT1/DownloaderFeedback.py0000644000000000000000000001253112414772654020342 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from cStringIO import StringIO from urllib import quote from threading import Event try: True except: True = 1 False = 0 class DownloaderFeedback: def __init__(self, choker, httpdl, add_task, upfunc, downfunc, ratemeasure, leftfunc, file_length, finflag, sp, statistics, statusfunc = None, interval = None): self.choker = choker self.httpdl = httpdl self.add_task = add_task self.upfunc = upfunc self.downfunc = downfunc self.ratemeasure = ratemeasure self.leftfunc = leftfunc self.file_length = file_length self.finflag = finflag self.sp = sp self.statistics = statistics self.lastids = [] self.spewdata = None self.doneprocessing = Event() self.doneprocessing.set() if statusfunc: self.autodisplay(statusfunc, interval) def _rotate(self): cs = self.choker.connections for id in self.lastids: for i in xrange(len(cs)): if cs[i].get_id() == id: return cs[i:] + cs[:i] return cs def spews(self): l = [] cs = self._rotate() self.lastids = [c.get_id() for c in cs] for c in cs: a = {} a['id'] = c.get_readable_id() a['ip'] = c.get_ip() a['optimistic'] = (c is self.choker.connections[0]) if c.is_locally_initiated(): a['direction'] = 'L' else: a['direction'] = 'R' u = c.get_upload() a['uprate'] = int(u.measure.get_rate()) a['uinterested'] = u.is_interested() a['uchoked'] = u.is_choked() d = c.get_download() a['downrate'] = int(d.measure.get_rate()) a['dinterested'] = d.is_interested() a['dchoked'] = d.is_choked() a['snubbed'] = d.is_snubbed() a['utotal'] = d.connection.upload.measure.get_total() a['dtotal'] = d.connection.download.measure.get_total() if len(d.connection.download.have) > 0: a['completed'] = float(len(d.connection.download.have)-d.connection.download.have.numfalse)/float(len(d.connection.download.have)) else: a['completed'] = 1.0 a['speed'] = d.connection.download.peermeasure.get_rate() l.append(a) for dl in self.httpdl.get_downloads(): if dl.goodseed: a = {} a['id'] = 'http seed' a['ip'] = dl.baseurl a['optimistic'] = False a['direction'] = 'L' a['uprate'] = 0 a['uinterested'] = False a['uchoked'] = False a['downrate'] = int(dl.measure.get_rate()) a['dinterested'] = True a['dchoked'] = not dl.active a['snubbed'] = not dl.active a['utotal'] = None a['dtotal'] = dl.measure.get_total() a['completed'] = 1.0 a['speed'] = None l.append(a) return l def gather(self, displayfunc = None): s = {'stats': self.statistics.update()} if self.sp.isSet(): s['spew'] = self.spews() else: s['spew'] = None s['up'] = self.upfunc() if self.finflag.isSet(): s['done'] = self.file_length return s s['down'] = self.downfunc() obtained, desired = self.leftfunc() s['done'] = obtained s['wanted'] = desired if desired > 0: s['frac'] = float(obtained)/desired else: s['frac'] = 1.0 if desired == obtained: s['time'] = 0 else: s['time'] = self.ratemeasure.get_time_left(desired-obtained) return s def display(self, displayfunc): if not self.doneprocessing.isSet(): return self.doneprocessing.clear() stats = self.gather() if self.finflag.isSet(): displayfunc(dpflag = self.doneprocessing, upRate = stats['up'], statistics = stats['stats'], spew = stats['spew']) elif stats['time'] is not None: displayfunc(dpflag = self.doneprocessing, fractionDone = stats['frac'], sizeDone = stats['done'], downRate = stats['down'], upRate = stats['up'], statistics = stats['stats'], spew = stats['spew'], timeEst = stats['time']) else: displayfunc(dpflag = self.doneprocessing, fractionDone = stats['frac'], sizeDone = stats['done'], downRate = stats['down'], upRate = stats['up'], statistics = stats['stats'], spew = stats['spew']) def autodisplay(self, displayfunc, interval): self.displayfunc = displayfunc self.interval = interval self._autodisplay() def _autodisplay(self): self.add_task(self._autodisplay, self.interval) self.display(self.displayfunc) armory-0.92.3/BitTornado/BT1/__init__.py0000644000000000000000000000001512414772654016370 0ustar rootroot# placeholderarmory-0.92.3/BitTornado/BT1/Storage.py0000644000000000000000000005073012414772654016246 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from BitTornado.piecebuffer import BufferPool from threading import Lock from time import time, strftime, localtime import os from os.path import exists, getsize, getmtime, basename from traceback import print_exc try: from os import fsync except ImportError: fsync = lambda x: None from bisect import bisect try: True except: True = 1 False = 0 DEBUG = False MAXREADSIZE = 32768 MAXLOCKSIZE = 1000000000L MAXLOCKRANGE = 3999999999L # only lock first 4 gig of file _pool = BufferPool() PieceBuffer = _pool.new def dummy_status(fractionDone = None, activity = None): pass class Storage: def __init__(self, files, piece_length, doneflag, config, disabled_files = None): # can raise IOError and ValueError self.files = files self.piece_length = piece_length self.doneflag = doneflag self.disabled = [False] * len(files) self.file_ranges = [] self.disabled_ranges = [] self.working_ranges = [] numfiles = 0 total = 0l so_far = 0l self.handles = {} self.whandles = {} self.tops = {} self.sizes = {} self.mtimes = {} if config.get('lock_files', True): self.lock_file, self.unlock_file = self._lock_file, self._unlock_file else: self.lock_file, self.unlock_file = lambda x1,x2: None, lambda x1,x2: None self.lock_while_reading = config.get('lock_while_reading', False) self.lock = Lock() if not disabled_files: disabled_files = [False] * len(files) for i in xrange(len(files)): file, length = files[i] if doneflag.isSet(): # bail out if doneflag is set return self.disabled_ranges.append(None) if length == 0: self.file_ranges.append(None) self.working_ranges.append([]) else: range = (total, total + length, 0, file) self.file_ranges.append(range) self.working_ranges.append([range]) numfiles += 1 total += length if disabled_files[i]: l = 0 else: if exists(file): l = getsize(file) if l > length: h = open(file, 'rb+') h.truncate(length) h.flush() h.close() l = length else: l = 0 h = open(file, 'wb+') h.flush() h.close() self.mtimes[file] = getmtime(file) self.tops[file] = l self.sizes[file] = length so_far += l self.total_length = total self._reset_ranges() self.max_files_open = config['max_files_open'] if self.max_files_open > 0 and numfiles > self.max_files_open: self.handlebuffer = [] else: self.handlebuffer = None if os.name == 'nt': def _lock_file(self, name, f): import msvcrt for p in range(0, min(self.sizes[name],MAXLOCKRANGE), MAXLOCKSIZE): f.seek(p) msvcrt.locking(f.fileno(), msvcrt.LK_LOCK, min(MAXLOCKSIZE,self.sizes[name]-p)) def _unlock_file(self, name, f): import msvcrt for p in range(0, min(self.sizes[name],MAXLOCKRANGE), MAXLOCKSIZE): f.seek(p) msvcrt.locking(f.fileno(), msvcrt.LK_UNLCK, min(MAXLOCKSIZE,self.sizes[name]-p)) elif os.name == 'posix': def _lock_file(self, name, f): import fcntl fcntl.flock(f.fileno(), fcntl.LOCK_EX) def _unlock_file(self, name, f): import fcntl fcntl.flock(f.fileno(), fcntl.LOCK_UN) else: def _lock_file(self, name, f): pass def _unlock_file(self, name, f): pass def was_preallocated(self, pos, length): for file, begin, end in self._intervals(pos, length): if self.tops.get(file, 0) < end: return False return True def _sync(self, file): self._close(file) if self.handlebuffer: self.handlebuffer.remove(file) def sync(self): # may raise IOError or OSError for file in self.whandles.keys(): self._sync(file) def set_readonly(self, f=None): if f is None: self.sync() return file = self.files[f][0] if self.whandles.has_key(file): self._sync(file) def get_total_length(self): return self.total_length def _open(self, file, mode): if self.mtimes.has_key(file): try: if self.handlebuffer is not None: assert getsize(file) == self.tops[file] newmtime = getmtime(file) oldmtime = self.mtimes[file] assert newmtime <= oldmtime+1 assert newmtime >= oldmtime-1 except: if DEBUG: print ( file+' modified: ' +strftime('(%x %X)',localtime(self.mtimes[file])) +strftime(' != (%x %X) ?',localtime(getmtime(file))) ) raise IOError('modified during download') try: return open(file, mode) except: if DEBUG: print_exc() raise def _close(self, file): f = self.handles[file] del self.handles[file] if self.whandles.has_key(file): del self.whandles[file] f.flush() self.unlock_file(file, f) f.close() self.tops[file] = getsize(file) self.mtimes[file] = getmtime(file) else: if self.lock_while_reading: self.unlock_file(file, f) f.close() def _close_file(self, file): if not self.handles.has_key(file): return self._close(file) if self.handlebuffer: self.handlebuffer.remove(file) def _get_file_handle(self, file, for_write): if self.handles.has_key(file): if for_write and not self.whandles.has_key(file): self._close(file) try: f = self._open(file, 'rb+') self.handles[file] = f self.whandles[file] = 1 self.lock_file(file, f) except (IOError, OSError), e: if DEBUG: print_exc() raise IOError('unable to reopen '+file+': '+str(e)) if self.handlebuffer: if self.handlebuffer[-1] != file: self.handlebuffer.remove(file) self.handlebuffer.append(file) elif self.handlebuffer is not None: self.handlebuffer.append(file) else: try: if for_write: f = self._open(file, 'rb+') self.handles[file] = f self.whandles[file] = 1 self.lock_file(file, f) else: f = self._open(file, 'rb') self.handles[file] = f if self.lock_while_reading: self.lock_file(file, f) except (IOError, OSError), e: if DEBUG: print_exc() raise IOError('unable to open '+file+': '+str(e)) if self.handlebuffer is not None: self.handlebuffer.append(file) if len(self.handlebuffer) > self.max_files_open: self._close(self.handlebuffer.pop(0)) return self.handles[file] def _reset_ranges(self): self.ranges = [] for l in self.working_ranges: self.ranges.extend(l) self.begins = [i[0] for i in self.ranges] def _intervals(self, pos, amount): r = [] stop = pos + amount p = bisect(self.begins, pos) - 1 while p < len(self.ranges): begin, end, offset, file = self.ranges[p] if begin >= stop: break r.append(( file, offset + max(pos, begin) - begin, offset + min(end, stop) - begin )) p += 1 return r def read(self, pos, amount, flush_first = False): r = PieceBuffer() for file, pos, end in self._intervals(pos, amount): if DEBUG: print 'reading '+file+' from '+str(pos)+' to '+str(end) self.lock.acquire() h = self._get_file_handle(file, False) if flush_first and self.whandles.has_key(file): h.flush() fsync(h) h.seek(pos) while pos < end: length = min(end-pos, MAXREADSIZE) data = h.read(length) if len(data) != length: raise IOError('error reading data from '+file) r.append(data) pos += length self.lock.release() return r def write(self, pos, s): # might raise an IOError total = 0 for file, begin, end in self._intervals(pos, len(s)): if DEBUG: print 'writing '+file+' from '+str(pos)+' to '+str(end) self.lock.acquire() h = self._get_file_handle(file, True) h.seek(begin) h.write(s[total: total + end - begin]) self.lock.release() total += end - begin def top_off(self): for begin, end, offset, file in self.ranges: l = offset + end - begin if l > self.tops.get(file, 0): self.lock.acquire() h = self._get_file_handle(file, True) h.seek(l-1) h.write(chr(0xFF)) self.lock.release() def flush(self): # may raise IOError or OSError for file in self.whandles.keys(): self.lock.acquire() self.handles[file].flush() self.lock.release() def close(self): for file, f in self.handles.items(): try: self.unlock_file(file, f) except: pass try: f.close() except: pass self.handles = {} self.whandles = {} self.handlebuffer = None def _get_disabled_ranges(self, f): if not self.file_ranges[f]: return ((),(),()) r = self.disabled_ranges[f] if r: return r start, end, offset, file = self.file_ranges[f] if DEBUG: print 'calculating disabled range for '+self.files[f][0] print 'bytes: '+str(start)+'-'+str(end) print 'file spans pieces '+str(int(start/self.piece_length))+'-'+str(int((end-1)/self.piece_length)+1) pieces = range( int(start/self.piece_length), int((end-1)/self.piece_length)+1 ) offset = 0 disabled_files = [] if len(pieces) == 1: if ( start % self.piece_length == 0 and end % self.piece_length == 0 ): # happens to be a single, # perfect piece working_range = [(start, end, offset, file)] update_pieces = [] else: midfile = os.path.join(self.bufferdir,str(f)) working_range = [(start, end, 0, midfile)] disabled_files.append((midfile, start, end)) length = end - start self.sizes[midfile] = length piece = pieces[0] update_pieces = [(piece, start-(piece*self.piece_length), length)] else: update_pieces = [] if start % self.piece_length != 0: # doesn't begin on an even piece boundary end_b = pieces[1]*self.piece_length startfile = os.path.join(self.bufferdir,str(f)+'b') working_range_b = [ ( start, end_b, 0, startfile ) ] disabled_files.append((startfile, start, end_b)) length = end_b - start self.sizes[startfile] = length offset = length piece = pieces.pop(0) update_pieces.append((piece, start-(piece*self.piece_length), length)) else: working_range_b = [] if f != len(self.files)-1 and end % self.piece_length != 0: # doesn't end on an even piece boundary start_e = pieces[-1] * self.piece_length endfile = os.path.join(self.bufferdir,str(f)+'e') working_range_e = [ ( start_e, end, 0, endfile ) ] disabled_files.append((endfile, start_e, end)) length = end - start_e self.sizes[endfile] = length piece = pieces.pop(-1) update_pieces.append((piece, 0, length)) else: working_range_e = [] if pieces: working_range_m = [ ( pieces[0]*self.piece_length, (pieces[-1]+1)*self.piece_length, offset, file ) ] else: working_range_m = [] working_range = working_range_b + working_range_m + working_range_e if DEBUG: print str(working_range) print str(update_pieces) r = (tuple(working_range), tuple(update_pieces), tuple(disabled_files)) self.disabled_ranges[f] = r return r def set_bufferdir(self, dir): self.bufferdir = dir def enable_file(self, f): if not self.disabled[f]: return self.disabled[f] = False r = self.file_ranges[f] if not r: return file = r[3] if not exists(file): h = open(file, 'wb+') h.flush() h.close() if not self.tops.has_key(file): self.tops[file] = getsize(file) if not self.mtimes.has_key(file): self.mtimes[file] = getmtime(file) self.working_ranges[f] = [r] def disable_file(self, f): if self.disabled[f]: return self.disabled[f] = True r = self._get_disabled_ranges(f) if not r: return for file, begin, end in r[2]: if not os.path.isdir(self.bufferdir): os.makedirs(self.bufferdir) if not exists(file): h = open(file, 'wb+') h.flush() h.close() if not self.tops.has_key(file): self.tops[file] = getsize(file) if not self.mtimes.has_key(file): self.mtimes[file] = getmtime(file) self.working_ranges[f] = r[0] reset_file_status = _reset_ranges def get_piece_update_list(self, f): return self._get_disabled_ranges(f)[1] def delete_file(self, f): try: os.remove(self.files[f][0]) except: pass ''' Pickled data format: d['files'] = [ file #, size, mtime {, file #, size, mtime...} ] file # in torrent, and the size and last modification time for those files. Missing files are either empty or disabled. d['partial files'] = [ name, size, mtime... ] Names, sizes and last modification times of files containing partial piece data. Filenames go by the following convention: {file #, 0-based}{nothing, "b" or "e"} eg: "0e" "3" "4b" "4e" Where "b" specifies the partial data for the first piece in the file, "e" the last piece, and no letter signifying that the file is disabled but is smaller than one piece, and that all the data is cached inside so adjacent files may be verified. ''' def pickle(self): files = [] pfiles = [] for i in xrange(len(self.files)): if not self.files[i][1]: # length == 0 continue if self.disabled[i]: for file, start, end in self._get_disabled_ranges(i)[2]: pfiles.extend([basename(file),getsize(file),int(getmtime(file))]) continue file = self.files[i][0] files.extend([i,getsize(file),int(getmtime(file))]) return {'files': files, 'partial files': pfiles} def unpickle(self, data): # assume all previously-disabled files have already been disabled try: files = {} pfiles = {} l = data['files'] assert len(l) % 3 == 0 l = [l[x:x+3] for x in xrange(0,len(l),3)] for f, size, mtime in l: files[f] = (size, mtime) l = data.get('partial files',[]) assert len(l) % 3 == 0 l = [l[x:x+3] for x in xrange(0,len(l),3)] for file, size, mtime in l: pfiles[file] = (size, mtime) valid_pieces = {} for i in xrange(len(self.files)): if self.disabled[i]: continue r = self.file_ranges[i] if not r: continue start, end, offset, file =r if DEBUG: print 'adding '+file for p in xrange( int(start/self.piece_length), int((end-1)/self.piece_length)+1 ): valid_pieces[p] = 1 if DEBUG: print valid_pieces.keys() def test(old, size, mtime): oldsize, oldmtime = old if size != oldsize: return False if mtime > oldmtime+1: return False if mtime < oldmtime-1: return False return True for i in xrange(len(self.files)): if self.disabled[i]: for file, start, end in self._get_disabled_ranges(i)[2]: f1 = basename(file) if ( not pfiles.has_key(f1) or not test(pfiles[f1],getsize(file),getmtime(file)) ): if DEBUG: print 'removing '+file for p in xrange( int(start/self.piece_length), int((end-1)/self.piece_length)+1 ): if valid_pieces.has_key(p): del valid_pieces[p] continue file, size = self.files[i] if not size: continue if ( not files.has_key(i) or not test(files[i],getsize(file),getmtime(file)) ): start, end, offset, file = self.file_ranges[i] if DEBUG: print 'removing '+file for p in xrange( int(start/self.piece_length), int((end-1)/self.piece_length)+1 ): if valid_pieces.has_key(p): del valid_pieces[p] except: if DEBUG: print_exc() return [] if DEBUG: print valid_pieces.keys() return valid_pieces.keys() armory-0.92.3/BitTornado/BT1/Statistics.py0000644000000000000000000001514612414772654016776 0ustar rootroot# Written by Edward Keyes # see LICENSE.txt for license information from threading import Event try: True except: True = 1 False = 0 class Statistics_Response: pass # empty class class Statistics: def __init__(self, upmeasure, downmeasure, connecter, httpdl, ratelimiter, rerequest_lastfailed, fdatflag): self.upmeasure = upmeasure self.downmeasure = downmeasure self.connecter = connecter self.httpdl = httpdl self.ratelimiter = ratelimiter self.downloader = connecter.downloader self.picker = connecter.downloader.picker self.storage = connecter.downloader.storage self.torrentmeasure = connecter.downloader.totalmeasure self.rerequest_lastfailed = rerequest_lastfailed self.fdatflag = fdatflag self.fdatactive = False self.piecescomplete = None self.placesopen = None self.storage_totalpieces = len(self.storage.hashes) def set_dirstats(self, files, piece_length): self.piecescomplete = 0 self.placesopen = 0 self.filelistupdated = Event() self.filelistupdated.set() frange = xrange(len(files)) self.filepieces = [[] for x in frange] self.filepieces2 = [[] for x in frange] self.fileamtdone = [0.0 for x in frange] self.filecomplete = [False for x in frange] self.fileinplace = [False for x in frange] start = 0L for i in frange: l = files[i][1] if l == 0: self.fileamtdone[i] = 1.0 self.filecomplete[i] = True self.fileinplace[i] = True else: fp = self.filepieces[i] fp2 = self.filepieces2[i] for piece in range(int(start/piece_length), int((start+l-1)/piece_length)+1): fp.append(piece) fp2.append(piece) start += l def update(self): s = Statistics_Response() s.upTotal = self.upmeasure.get_total() s.downTotal = self.downmeasure.get_total() s.last_failed = self.rerequest_lastfailed() s.external_connection_made = self.connecter.external_connection_made if s.downTotal > 0: s.shareRating = float(s.upTotal)/s.downTotal elif s.upTotal == 0: s.shareRating = 0.0 else: s.shareRating = -1.0 s.torrentRate = self.torrentmeasure.get_rate() s.torrentTotal = self.torrentmeasure.get_total() s.numSeeds = self.picker.seeds_connected s.numOldSeeds = self.downloader.num_disconnected_seeds() s.numPeers = len(self.downloader.downloads)-s.numSeeds s.numCopies = 0.0 for i in self.picker.crosscount: if i==0: s.numCopies+=1 else: s.numCopies+=1-float(i)/self.picker.numpieces break if self.picker.done: s.numCopies2 = s.numCopies + 1 else: s.numCopies2 = 0.0 for i in self.picker.crosscount2: if i==0: s.numCopies2+=1 else: s.numCopies2+=1-float(i)/self.picker.numpieces break s.discarded = self.downloader.discarded s.numSeeds += self.httpdl.seedsfound s.numOldSeeds += self.httpdl.seedsfound if s.numPeers == 0 or self.picker.numpieces == 0: s.percentDone = 0.0 else: s.percentDone = 100.0*(float(self.picker.totalcount)/self.picker.numpieces)/s.numPeers s.backgroundallocating = self.storage.bgalloc_active s.storage_totalpieces = len(self.storage.hashes) s.storage_active = len(self.storage.stat_active) s.storage_new = len(self.storage.stat_new) s.storage_dirty = len(self.storage.dirty) numdownloaded = self.storage.stat_numdownloaded s.storage_justdownloaded = numdownloaded s.storage_numcomplete = self.storage.stat_numfound + numdownloaded s.storage_numflunked = self.storage.stat_numflunked s.storage_isendgame = self.downloader.endgamemode s.peers_kicked = self.downloader.kicked.items() s.peers_banned = self.downloader.banned.items() try: s.upRate = int(self.ratelimiter.upload_rate/1000) assert s.upRate < 5000 except: s.upRate = 0 s.upSlots = self.ratelimiter.slots if self.piecescomplete is None: # not a multi-file torrent return s if self.fdatflag.isSet(): if not self.fdatactive: self.fdatactive = True else: self.fdatactive = False if self.piecescomplete != self.picker.numgot: for i in xrange(len(self.filecomplete)): if self.filecomplete[i]: continue oldlist = self.filepieces[i] newlist = [ piece for piece in oldlist if not self.storage.have[piece] ] if len(newlist) != len(oldlist): self.filepieces[i] = newlist self.fileamtdone[i] = ( (len(self.filepieces2[i])-len(newlist)) /float(len(self.filepieces2[i])) ) if not newlist: self.filecomplete[i] = True self.filelistupdated.set() self.piecescomplete = self.picker.numgot if ( self.filelistupdated.isSet() or self.placesopen != len(self.storage.places) ): for i in xrange(len(self.filecomplete)): if not self.filecomplete[i] or self.fileinplace[i]: continue while self.filepieces2[i]: piece = self.filepieces2[i][-1] if self.storage.places[piece] != piece: break del self.filepieces2[i][-1] if not self.filepieces2[i]: self.fileinplace[i] = True self.storage.set_file_readonly(i) self.filelistupdated.set() self.placesopen = len(self.storage.places) s.fileamtdone = self.fileamtdone s.filecomplete = self.filecomplete s.fileinplace = self.fileinplace s.filelistupdated = self.filelistupdated return s armory-0.92.3/BitTornado/BT1/HTTPDownloader.py0000644000000000000000000002101012414772654017425 0ustar rootroot# Written by John Hoffman # see LICENSE.txt for license information from BitTornado.CurrentRateMeasure import Measure from random import randint from urlparse import urlparse from httplib import HTTPConnection from urllib import quote from threading import Thread from BitTornado.__init__ import product_name,version_short try: True except: True = 1 False = 0 EXPIRE_TIME = 60 * 60 VERSION = product_name+'/'+version_short class haveComplete: def complete(self): return True def __getitem__(self, x): return True haveall = haveComplete() class SingleDownload: def __init__(self, downloader, url): self.downloader = downloader self.baseurl = url try: (scheme, self.netloc, path, pars, query, fragment) = urlparse(url) except: self.downloader.errorfunc('cannot parse http seed address: '+url) return if scheme != 'http': self.downloader.errorfunc('http seed url not http: '+url) return try: self.connection = HTTPConnection(self.netloc) except: self.downloader.errorfunc('cannot connect to http seed: '+url) return self.seedurl = path if pars: self.seedurl += ';'+pars self.seedurl += '?' if query: self.seedurl += query+'&' self.seedurl += 'info_hash='+quote(self.downloader.infohash) self.measure = Measure(downloader.max_rate_period) self.index = None self.url = '' self.requests = [] self.request_size = 0 self.endflag = False self.error = None self.retry_period = 30 self._retry_period = None self.errorcount = 0 self.goodseed = False self.active = False self.cancelled = False self.resched(randint(2,10)) def resched(self, len = None): if len is None: len = self.retry_period if self.errorcount > 3: len = len * (self.errorcount - 2) self.downloader.rawserver.add_task(self.download, len) def _want(self, index): if self.endflag: return self.downloader.storage.do_I_have_requests(index) else: return self.downloader.storage.is_unstarted(index) def download(self): self.cancelled = False if self.downloader.picker.am_I_complete(): self.downloader.downloads.remove(self) return self.index = self.downloader.picker.next(haveall, self._want) if ( self.index is None and not self.endflag and not self.downloader.peerdownloader.has_downloaders() ): self.endflag = True self.index = self.downloader.picker.next(haveall, self._want) if self.index is None: self.endflag = True self.resched() else: self.url = ( self.seedurl+'&piece='+str(self.index) ) self._get_requests() if self.request_size < self.downloader.storage._piecelen(self.index): self.url += '&ranges='+self._request_ranges() rq = Thread(target = self._request) rq.setDaemon(False) rq.start() self.active = True def _request(self): import encodings.ascii import encodings.punycode import encodings.idna self.error = None self.received_data = None try: self.connection.request('GET',self.url, None, {'User-Agent': VERSION}) r = self.connection.getresponse() self.connection_status = r.status self.received_data = r.read() except Exception, e: self.error = 'error accessing http seed: '+str(e) try: self.connection.close() except: pass try: self.connection = HTTPConnection(self.netloc) except: self.connection = None # will cause an exception and retry next cycle self.downloader.rawserver.add_task(self.request_finished) def request_finished(self): self.active = False if self.error is not None: if self.goodseed: self.downloader.errorfunc(self.error) self.errorcount += 1 if self.received_data: self.errorcount = 0 if not self._got_data(): self.received_data = None if not self.received_data: self._release_requests() self.downloader.peerdownloader.piece_flunked(self.index) if self._retry_period: self.resched(self._retry_period) self._retry_period = None return self.resched() def _got_data(self): if self.connection_status == 503: # seed is busy try: self.retry_period = max(int(self.received_data),5) except: pass return False if self.connection_status != 200: self.errorcount += 1 return False self._retry_period = 1 if len(self.received_data) != self.request_size: if self.goodseed: self.downloader.errorfunc('corrupt data from http seed - redownloading') return False self.measure.update_rate(len(self.received_data)) self.downloader.measurefunc(len(self.received_data)) if self.cancelled: return False if not self._fulfill_requests(): return False if not self.goodseed: self.goodseed = True self.downloader.seedsfound += 1 if self.downloader.storage.do_I_have(self.index): self.downloader.picker.complete(self.index) self.downloader.peerdownloader.check_complete(self.index) self.downloader.gotpiecefunc(self.index) return True def _get_requests(self): self.requests = [] self.request_size = 0L while self.downloader.storage.do_I_have_requests(self.index): r = self.downloader.storage.new_request(self.index) self.requests.append(r) self.request_size += r[1] self.requests.sort() def _fulfill_requests(self): start = 0L success = True while self.requests: begin, length = self.requests.pop(0) if not self.downloader.storage.piece_came_in(self.index, begin, self.received_data[start:start+length]): success = False break start += length return success def _release_requests(self): for begin, length in self.requests: self.downloader.storage.request_lost(self.index, begin, length) self.requests = [] def _request_ranges(self): s = '' begin, length = self.requests[0] for begin1, length1 in self.requests[1:]: if begin + length == begin1: length += length1 continue else: if s: s += ',' s += str(begin)+'-'+str(begin+length-1) begin, length = begin1, length1 if s: s += ',' s += str(begin)+'-'+str(begin+length-1) return s class HTTPDownloader: def __init__(self, storage, picker, rawserver, finflag, errorfunc, peerdownloader, max_rate_period, infohash, measurefunc, gotpiecefunc): self.storage = storage self.picker = picker self.rawserver = rawserver self.finflag = finflag self.errorfunc = errorfunc self.peerdownloader = peerdownloader self.infohash = infohash self.max_rate_period = max_rate_period self.gotpiecefunc = gotpiecefunc self.measurefunc = measurefunc self.downloads = [] self.seedsfound = 0 def make_download(self, url): self.downloads.append(SingleDownload(self, url)) return self.downloads[-1] def get_downloads(self): if self.finflag.isSet(): return [] return self.downloads def cancel_piece_download(self, pieces): for d in self.downloads: if d.active and d.index in pieces: d.cancelled = True armory-0.92.3/BitTornado/BT1/StorageWrapper.py0000644000000000000000000011263512414772654017612 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from BitTornado.bitfield import Bitfield from sha import sha from BitTornado.clock import clock from traceback import print_exc from random import randrange try: True except: True = 1 False = 0 try: from bisect import insort except: def insort(l, item): l.append(item) l.sort() DEBUG = False STATS_INTERVAL = 0.2 def dummy_status(fractionDone = None, activity = None): pass class Olist: def __init__(self, l = []): self.d = {} for i in l: self.d[i] = 1 def __len__(self): return len(self.d) def includes(self, i): return self.d.has_key(i) def add(self, i): self.d[i] = 1 def extend(self, l): for i in l: self.d[i] = 1 def pop(self, n=0): # assert self.d k = self.d.keys() if n == 0: i = min(k) elif n == -1: i = max(k) else: k.sort() i = k[n] del self.d[i] return i def remove(self, i): if self.d.has_key(i): del self.d[i] class fakeflag: def __init__(self, state=False): self.state = state def wait(self): pass def isSet(self): return self.state class StorageWrapper: def __init__(self, storage, request_size, hashes, piece_size, finished, failed, statusfunc = dummy_status, flag = fakeflag(), check_hashes = True, data_flunked = lambda x: None, backfunc = None, config = {}, unpauseflag = fakeflag(True) ): self.storage = storage self.request_size = long(request_size) self.hashes = hashes self.piece_size = long(piece_size) self.piece_length = long(piece_size) self.finished = finished self.failed = failed self.statusfunc = statusfunc self.flag = flag self.check_hashes = check_hashes self.data_flunked = data_flunked self.backfunc = backfunc self.config = config self.unpauseflag = unpauseflag self.alloc_type = config.get('alloc_type','normal') self.double_check = config.get('double_check', 0) self.triple_check = config.get('triple_check', 0) if self.triple_check: self.double_check = True self.bgalloc_enabled = False self.bgalloc_active = False self.total_length = storage.get_total_length() self.amount_left = self.total_length if self.total_length <= self.piece_size * (len(hashes) - 1): raise ValueError, 'bad data in responsefile - total too small' if self.total_length > self.piece_size * len(hashes): raise ValueError, 'bad data in responsefile - total too big' self.numactive = [0] * len(hashes) self.inactive_requests = [1] * len(hashes) self.amount_inactive = self.total_length self.amount_obtained = 0 self.amount_desired = self.total_length self.have = Bitfield(len(hashes)) self.have_cloaked_data = None self.blocked = [False] * len(hashes) self.blocked_holes = [] self.blocked_movein = Olist() self.blocked_moveout = Olist() self.waschecked = [False] * len(hashes) self.places = {} self.holes = [] self.stat_active = {} self.stat_new = {} self.dirty = {} self.stat_numflunked = 0 self.stat_numdownloaded = 0 self.stat_numfound = 0 self.download_history = {} self.failed_pieces = {} self.out_of_place = 0 self.write_buf_max = config['write_buffer_size']*1048576L self.write_buf_size = 0L self.write_buf = {} # structure: piece: [(start, data), ...] self.write_buf_list = [] self.initialize_tasks = [ ['checking existing data', 0, self.init_hashcheck, self.hashcheckfunc], ['moving data', 1, self.init_movedata, self.movedatafunc], ['allocating disk space', 1, self.init_alloc, self.allocfunc] ] self.backfunc(self._bgalloc,0.1) self.backfunc(self._bgsync,max(self.config['auto_flush']*60,60)) def _bgsync(self): if self.config['auto_flush']: self.sync() self.backfunc(self._bgsync,max(self.config['auto_flush']*60,60)) def old_style_init(self): while self.initialize_tasks: msg, done, init, next = self.initialize_tasks.pop(0) if init(): self.statusfunc(activity = msg, fractionDone = done) t = clock() + STATS_INTERVAL x = 0 while x is not None: if t < clock(): t = clock() + STATS_INTERVAL self.statusfunc(fractionDone = x) self.unpauseflag.wait() if self.flag.isSet(): return False x = next() self.statusfunc(fractionDone = 0) return True def initialize(self, donefunc, statusfunc = None): self.initialize_done = donefunc if statusfunc is None: statusfunc = self.statusfunc self.initialize_status = statusfunc self.initialize_next = None self.backfunc(self._initialize) def _initialize(self): if not self.unpauseflag.isSet(): self.backfunc(self._initialize, 1) return if self.initialize_next: x = self.initialize_next() if x is None: self.initialize_next = None else: self.initialize_status(fractionDone = x) else: if not self.initialize_tasks: self.initialize_done() return msg, done, init, next = self.initialize_tasks.pop(0) if init(): self.initialize_status(activity = msg, fractionDone = done) self.initialize_next = next self.backfunc(self._initialize) def init_hashcheck(self): if self.flag.isSet(): return False self.check_list = [] if len(self.hashes) == 0 or self.amount_left == 0: self.check_total = 0 self.finished() return False self.check_targets = {} got = {} for p,v in self.places.items(): assert not got.has_key(v) got[v] = 1 for i in xrange(len(self.hashes)): if self.places.has_key(i): # restored from pickled self.check_targets[self.hashes[i]] = [] if self.places[i] == i: continue else: assert not got.has_key(i) self.out_of_place += 1 if got.has_key(i): continue if self._waspre(i): if self.blocked[i]: self.places[i] = i else: self.check_list.append(i) continue if not self.check_hashes: self.failed('told file complete on start-up, but data is missing') return False self.holes.append(i) if self.blocked[i] or self.check_targets.has_key(self.hashes[i]): self.check_targets[self.hashes[i]] = [] # in case of a hash collision, discard else: self.check_targets[self.hashes[i]] = [i] self.check_total = len(self.check_list) self.check_numchecked = 0.0 self.lastlen = self._piecelen(len(self.hashes) - 1) self.numchecked = 0.0 return self.check_total > 0 def _markgot(self, piece, pos): if DEBUG: print str(piece)+' at '+str(pos) self.places[piece] = pos self.have[piece] = True len = self._piecelen(piece) self.amount_obtained += len self.amount_left -= len self.amount_inactive -= len self.inactive_requests[piece] = None self.waschecked[piece] = self.check_hashes self.stat_numfound += 1 def hashcheckfunc(self): if self.flag.isSet(): return None if not self.check_list: return None i = self.check_list.pop(0) if not self.check_hashes: self._markgot(i, i) else: d1 = self.read_raw(i,0,self.lastlen) if d1 is None: return None sh = sha(d1[:]) d1.release() sp = sh.digest() d2 = self.read_raw(i,self.lastlen,self._piecelen(i)-self.lastlen) if d2 is None: return None sh.update(d2[:]) d2.release() s = sh.digest() if s == self.hashes[i]: self._markgot(i, i) elif ( self.check_targets.get(s) and self._piecelen(i) == self._piecelen(self.check_targets[s][-1]) ): self._markgot(self.check_targets[s].pop(), i) self.out_of_place += 1 elif ( not self.have[-1] and sp == self.hashes[-1] and (i == len(self.hashes) - 1 or not self._waspre(len(self.hashes) - 1)) ): self._markgot(len(self.hashes) - 1, i) self.out_of_place += 1 else: self.places[i] = i self.numchecked += 1 if self.amount_left == 0: self.finished() return (self.numchecked / self.check_total) def init_movedata(self): if self.flag.isSet(): return False if self.alloc_type != 'sparse': return False self.storage.top_off() # sets file lengths to their final size self.movelist = [] if self.out_of_place == 0: for i in self.holes: self.places[i] = i self.holes = [] return False self.tomove = float(self.out_of_place) for i in xrange(len(self.hashes)): if not self.places.has_key(i): self.places[i] = i elif self.places[i] != i: self.movelist.append(i) self.holes = [] return True def movedatafunc(self): if self.flag.isSet(): return None if not self.movelist: return None i = self.movelist.pop(0) old = self.read_raw(self.places[i], 0, self._piecelen(i)) if old is None: return None if not self.write_raw(i, 0, old): return None if self.double_check and self.have[i]: if self.triple_check: old.release() old = self.read_raw( i, 0, self._piecelen(i), flush_first = True ) if old is None: return None if sha(old[:]).digest() != self.hashes[i]: self.failed('download corrupted; please restart and resume') return None old.release() self.places[i] = i self.tomove -= 1 return (self.tomove / self.out_of_place) def init_alloc(self): if self.flag.isSet(): return False if not self.holes: return False self.numholes = float(len(self.holes)) self.alloc_buf = chr(0xFF) * self.piece_size if self.alloc_type == 'pre-allocate': self.bgalloc_enabled = True return True if self.alloc_type == 'background': self.bgalloc_enabled = True if self.blocked_moveout: return True return False def _allocfunc(self): while self.holes: n = self.holes.pop(0) if self.blocked[n]: # assume not self.blocked[index] if not self.blocked_movein: self.blocked_holes.append(n) continue if not self.places.has_key(n): b = self.blocked_movein.pop(0) oldpos = self._move_piece(b, n) self.places[oldpos] = oldpos return None if self.places.has_key(n): oldpos = self._move_piece(n, n) self.places[oldpos] = oldpos return None return n return None def allocfunc(self): if self.flag.isSet(): return None if self.blocked_moveout: self.bgalloc_active = True n = self._allocfunc() if n is not None: if self.blocked_moveout.includes(n): self.blocked_moveout.remove(n) b = n else: b = self.blocked_moveout.pop(0) oldpos = self._move_piece(b,n) self.places[oldpos] = oldpos return len(self.holes) / self.numholes if self.holes and self.bgalloc_enabled: self.bgalloc_active = True n = self._allocfunc() if n is not None: self.write_raw(n, 0, self.alloc_buf[:self._piecelen(n)]) self.places[n] = n return len(self.holes) / self.numholes self.bgalloc_active = False return None def bgalloc(self): if self.bgalloc_enabled: if not self.holes and not self.blocked_moveout and self.backfunc: self.backfunc(self.storage.flush) # force a flush whenever the "finish allocation" button is hit self.bgalloc_enabled = True return False def _bgalloc(self): self.allocfunc() if self.config.get('alloc_rate',0) < 0.1: self.config['alloc_rate'] = 0.1 self.backfunc( self._bgalloc, float(self.piece_size)/(self.config['alloc_rate']*1048576) ) def _waspre(self, piece): return self.storage.was_preallocated(piece * self.piece_size, self._piecelen(piece)) def _piecelen(self, piece): if piece < len(self.hashes) - 1: return self.piece_size else: return self.total_length - (piece * self.piece_size) def get_amount_left(self): return self.amount_left def do_I_have_anything(self): return self.amount_left < self.total_length def _make_inactive(self, index): length = self._piecelen(index) l = [] x = 0 while x + self.request_size < length: l.append((x, self.request_size)) x += self.request_size l.append((x, length - x)) self.inactive_requests[index] = l def is_endgame(self): return not self.amount_inactive def am_I_complete(self): return self.amount_obtained == self.amount_desired def reset_endgame(self, requestlist): for index, begin, length in requestlist: self.request_lost(index, begin, length) def get_have_list(self): return self.have.tostring() def get_have_list_cloaked(self): if self.have_cloaked_data is None: newhave = Bitfield(copyfrom = self.have) unhaves = [] n = min(randrange(2,5),len(self.hashes)) # between 2-4 unless torrent is small while len(unhaves) < n: unhave = randrange(min(32,len(self.hashes))) # all in first 4 bytes if not unhave in unhaves: unhaves.append(unhave) newhave[unhave] = False self.have_cloaked_data = (newhave.tostring(), unhaves) return self.have_cloaked_data def do_I_have(self, index): return self.have[index] def do_I_have_requests(self, index): return not not self.inactive_requests[index] def is_unstarted(self, index): return ( not self.have[index] and not self.numactive[index] and not self.dirty.has_key(index) ) def get_hash(self, index): return self.hashes[index] def get_stats(self): return self.amount_obtained, self.amount_desired def new_request(self, index): # returns (begin, length) if self.inactive_requests[index] == 1: self._make_inactive(index) self.numactive[index] += 1 self.stat_active[index] = 1 if not self.dirty.has_key(index): self.stat_new[index] = 1 rs = self.inactive_requests[index] # r = min(rs) # rs.remove(r) r = rs.pop(0) self.amount_inactive -= r[1] return r def write_raw(self, index, begin, data): try: self.storage.write(self.piece_size * index + begin, data) return True except IOError, e: self.failed('IO Error: ' + str(e)) return False def _write_to_buffer(self, piece, start, data): if not self.write_buf_max: return self.write_raw(self.places[piece], start, data) self.write_buf_size += len(data) while self.write_buf_size > self.write_buf_max: old = self.write_buf_list.pop(0) if not self._flush_buffer(old, True): return False if self.write_buf.has_key(piece): self.write_buf_list.remove(piece) else: self.write_buf[piece] = [] self.write_buf_list.append(piece) self.write_buf[piece].append((start,data)) return True def _flush_buffer(self, piece, popped = False): if not self.write_buf.has_key(piece): return True if not popped: self.write_buf_list.remove(piece) l = self.write_buf[piece] del self.write_buf[piece] l.sort() for start, data in l: self.write_buf_size -= len(data) if not self.write_raw(self.places[piece], start, data): return False return True def sync(self): spots = {} for p in self.write_buf_list: spots[self.places[p]] = p l = spots.keys() l.sort() for i in l: try: self._flush_buffer(spots[i]) except: pass try: self.storage.sync() except IOError, e: self.failed('IO Error: ' + str(e)) except OSError, e: self.failed('OS Error: ' + str(e)) def _move_piece(self, index, newpos): oldpos = self.places[index] if DEBUG: print 'moving '+str(index)+' from '+str(oldpos)+' to '+str(newpos) assert oldpos != index assert oldpos != newpos assert index == newpos or not self.places.has_key(newpos) old = self.read_raw(oldpos, 0, self._piecelen(index)) if old is None: return -1 if not self.write_raw(newpos, 0, old): return -1 self.places[index] = newpos if self.have[index] and ( self.triple_check or (self.double_check and index == newpos) ): if self.triple_check: old.release() old = self.read_raw(newpos, 0, self._piecelen(index), flush_first = True) if old is None: return -1 if sha(old[:]).digest() != self.hashes[index]: self.failed('download corrupted; please restart and resume') return -1 old.release() if self.blocked[index]: self.blocked_moveout.remove(index) if self.blocked[newpos]: self.blocked_movein.remove(index) else: self.blocked_movein.add(index) else: self.blocked_movein.remove(index) if self.blocked[newpos]: self.blocked_moveout.add(index) else: self.blocked_moveout.remove(index) return oldpos def _clear_space(self, index): h = self.holes.pop(0) n = h if self.blocked[n]: # assume not self.blocked[index] if not self.blocked_movein: self.blocked_holes.append(n) return True # repeat if not self.places.has_key(n): b = self.blocked_movein.pop(0) oldpos = self._move_piece(b, n) if oldpos < 0: return False n = oldpos if self.places.has_key(n): oldpos = self._move_piece(n, n) if oldpos < 0: return False n = oldpos if index == n or index in self.holes: if n == h: self.write_raw(n, 0, self.alloc_buf[:self._piecelen(n)]) self.places[index] = n if self.blocked[n]: # because n may be a spot cleared 10 lines above, it's possible # for it to be blocked. While that spot could be left cleared # and a new spot allocated, this condition might occur several # times in a row, resulting in a significant amount of disk I/O, # delaying the operation of the engine. Rather than do this, # queue the piece to be moved out again, which will be performed # by the background allocator, with which data movement is # automatically limited. self.blocked_moveout.add(index) return False for p, v in self.places.items(): if v == index: break else: self.failed('download corrupted; please restart and resume') return False self._move_piece(p, n) self.places[index] = index return False def piece_came_in(self, index, begin, piece, source = None): assert not self.have[index] if not self.places.has_key(index): while self._clear_space(index): pass if DEBUG: print 'new place for '+str(index)+' at '+str(self.places[index]) if self.flag.isSet(): return if self.failed_pieces.has_key(index): old = self.read_raw(self.places[index], begin, len(piece)) if old is None: return True if old[:].tostring() != piece: try: self.failed_pieces[index][self.download_history[index][begin]] = 1 except: self.failed_pieces[index][None] = 1 old.release() self.download_history.setdefault(index,{})[begin] = source if not self._write_to_buffer(index, begin, piece): return True self.amount_obtained += len(piece) self.dirty.setdefault(index,[]).append((begin, len(piece))) self.numactive[index] -= 1 assert self.numactive[index] >= 0 if not self.numactive[index]: del self.stat_active[index] if self.stat_new.has_key(index): del self.stat_new[index] if self.inactive_requests[index] or self.numactive[index]: return True del self.dirty[index] if not self._flush_buffer(index): return True length = self._piecelen(index) data = self.read_raw(self.places[index], 0, length, flush_first = self.triple_check) if data is None: return True hash = sha(data[:]).digest() data.release() if hash != self.hashes[index]: self.amount_obtained -= length self.data_flunked(length, index) self.inactive_requests[index] = 1 self.amount_inactive += length self.stat_numflunked += 1 self.failed_pieces[index] = {} allsenders = {} for d in self.download_history[index].values(): allsenders[d] = 1 if len(allsenders) == 1: culprit = allsenders.keys()[0] if culprit is not None: culprit.failed(index, bump = True) del self.failed_pieces[index] # found the culprit already return False self.have[index] = True self.inactive_requests[index] = None self.waschecked[index] = True self.amount_left -= length self.stat_numdownloaded += 1 for d in self.download_history[index].values(): if d is not None: d.good(index) del self.download_history[index] if self.failed_pieces.has_key(index): for d in self.failed_pieces[index].keys(): if d is not None: d.failed(index) del self.failed_pieces[index] if self.amount_left == 0: self.finished() return True def request_lost(self, index, begin, length): assert not (begin, length) in self.inactive_requests[index] insort(self.inactive_requests[index], (begin, length)) self.amount_inactive += length self.numactive[index] -= 1 if not self.numactive[index]: del self.stat_active[index] if self.stat_new.has_key(index): del self.stat_new[index] def get_piece(self, index, begin, length): if not self.have[index]: return None data = None if not self.waschecked[index]: data = self.read_raw(self.places[index], 0, self._piecelen(index)) if data is None: return None if sha(data[:]).digest() != self.hashes[index]: self.failed('told file complete on start-up, but piece failed hash check') return None self.waschecked[index] = True if length == -1 and begin == 0: return data # optimization if length == -1: if begin > self._piecelen(index): return None length = self._piecelen(index)-begin if begin == 0: return self.read_raw(self.places[index], 0, length) elif begin + length > self._piecelen(index): return None if data is not None: s = data[begin:begin+length] data.release() return s data = self.read_raw(self.places[index], begin, length) if data is None: return None s = data.getarray() data.release() return s def read_raw(self, piece, begin, length, flush_first = False): try: return self.storage.read(self.piece_size * piece + begin, length, flush_first) except IOError, e: self.failed('IO Error: ' + str(e)) return None def set_file_readonly(self, n): try: self.storage.set_readonly(n) except IOError, e: self.failed('IO Error: ' + str(e)) except OSError, e: self.failed('OS Error: ' + str(e)) def has_data(self, index): return index not in self.holes and index not in self.blocked_holes def doublecheck_data(self, pieces_to_check): if not self.double_check: return sources = [] for p,v in self.places.items(): if pieces_to_check.has_key(v): sources.append(p) assert len(sources) == len(pieces_to_check) sources.sort() for index in sources: if self.have[index]: piece = self.read_raw(self.places[index],0,self._piecelen(index), flush_first = True ) if piece is None: return False if sha(piece[:]).digest() != self.hashes[index]: self.failed('download corrupted; please restart and resume') return False piece.release() return True def reblock(self, new_blocked): # assume downloads have already been canceled and chunks made inactive for i in xrange(len(new_blocked)): if new_blocked[i] and not self.blocked[i]: length = self._piecelen(i) self.amount_desired -= length if self.have[i]: self.amount_obtained -= length continue if self.inactive_requests[i] == 1: self.amount_inactive -= length continue inactive = 0 for nb, nl in self.inactive_requests[i]: inactive += nl self.amount_inactive -= inactive self.amount_obtained -= length - inactive if self.blocked[i] and not new_blocked[i]: length = self._piecelen(i) self.amount_desired += length if self.have[i]: self.amount_obtained += length continue if self.inactive_requests[i] == 1: self.amount_inactive += length continue inactive = 0 for nb, nl in self.inactive_requests[i]: inactive += nl self.amount_inactive += inactive self.amount_obtained += length - inactive self.blocked = new_blocked self.blocked_movein = Olist() self.blocked_moveout = Olist() for p,v in self.places.items(): if p != v: if self.blocked[p] and not self.blocked[v]: self.blocked_movein.add(p) elif self.blocked[v] and not self.blocked[p]: self.blocked_moveout.add(p) self.holes.extend(self.blocked_holes) # reset holes list self.holes.sort() self.blocked_holes = [] ''' Pickled data format: d['pieces'] = either a string containing a bitfield of complete pieces, or the numeric value "1" signifying a seed. If it is a seed, d['places'] and d['partials'] should be empty and needn't even exist. d['partials'] = [ piece, [ offset, length... ]... ] a list of partial data that had been previously downloaded, plus the given offsets. Adjacent partials are merged so as to save space, and so that if the request size changes then new requests can be calculated more efficiently. d['places'] = [ piece, place, {,piece, place ...} ] the piece index, and the place it's stored. If d['pieces'] specifies a complete piece or d['partials'] specifies a set of partials for a piece which has no entry in d['places'], it can be assumed that place[index] = index. A place specified with no corresponding data in d['pieces'] or d['partials'] indicates allocated space with no valid data, and is reserved so it doesn't need to be hash-checked. ''' def pickle(self): if self.have.complete(): return {'pieces': 1} pieces = Bitfield(len(self.hashes)) places = [] partials = [] for p in xrange(len(self.hashes)): if self.blocked[p] or not self.places.has_key(p): continue h = self.have[p] pieces[p] = h pp = self.dirty.get(p) if not h and not pp: # no data places.extend([self.places[p],self.places[p]]) elif self.places[p] != p: places.extend([p, self.places[p]]) if h or not pp: continue pp.sort() r = [] while len(pp) > 1: if pp[0][0]+pp[0][1] == pp[1][0]: pp[0] = list(pp[0]) pp[0][1] += pp[1][1] del pp[1] else: r.extend(pp[0]) del pp[0] r.extend(pp[0]) partials.extend([p,r]) return {'pieces': pieces.tostring(), 'places': places, 'partials': partials} def unpickle(self, data, valid_places): got = {} places = {} dirty = {} download_history = {} stat_active = {} stat_numfound = self.stat_numfound amount_obtained = self.amount_obtained amount_inactive = self.amount_inactive amount_left = self.amount_left inactive_requests = [x for x in self.inactive_requests] restored_partials = [] try: if data['pieces'] == 1: # a seed assert not data.get('places',None) assert not data.get('partials',None) have = Bitfield(len(self.hashes)) for i in xrange(len(self.hashes)): have[i] = True assert have.complete() _places = [] _partials = [] else: have = Bitfield(len(self.hashes), data['pieces']) _places = data['places'] assert len(_places) % 2 == 0 _places = [_places[x:x+2] for x in xrange(0,len(_places),2)] _partials = data['partials'] assert len(_partials) % 2 == 0 _partials = [_partials[x:x+2] for x in xrange(0,len(_partials),2)] for index, place in _places: if place not in valid_places: continue assert not got.has_key(index) assert not got.has_key(place) places[index] = place got[index] = 1 got[place] = 1 for index in xrange(len(self.hashes)): if have[index]: if not places.has_key(index): if index not in valid_places: have[index] = False continue assert not got.has_key(index) places[index] = index got[index] = 1 length = self._piecelen(index) amount_obtained += length stat_numfound += 1 amount_inactive -= length amount_left -= length inactive_requests[index] = None for index, plist in _partials: assert not dirty.has_key(index) assert not have[index] if not places.has_key(index): if index not in valid_places: continue assert not got.has_key(index) places[index] = index got[index] = 1 assert len(plist) % 2 == 0 plist = [plist[x:x+2] for x in xrange(0,len(plist),2)] dirty[index] = plist stat_active[index] = 1 download_history[index] = {} # invert given partials length = self._piecelen(index) l = [] if plist[0][0] > 0: l.append((0,plist[0][0])) for i in xrange(len(plist)-1): end = plist[i][0]+plist[i][1] assert not end > plist[i+1][0] l.append((end,plist[i+1][0]-end)) end = plist[-1][0]+plist[-1][1] assert not end > length if end < length: l.append((end,length-end)) # split them to request_size ll = [] amount_obtained += length amount_inactive -= length for nb, nl in l: while nl > 0: r = min(nl,self.request_size) ll.append((nb,r)) amount_inactive += r amount_obtained -= r nb += self.request_size nl -= self.request_size inactive_requests[index] = ll restored_partials.append(index) assert amount_obtained + amount_inactive == self.amount_desired except: # print_exc() return [] # invalid data, discard everything self.have = have self.places = places self.dirty = dirty self.download_history = download_history self.stat_active = stat_active self.stat_numfound = stat_numfound self.amount_obtained = amount_obtained self.amount_inactive = amount_inactive self.amount_left = amount_left self.inactive_requests = inactive_requests return restored_partials armory-0.92.3/BitTornado/BT1/T2T.py0000644000000000000000000001641512414772654015255 0ustar rootroot# Written by John Hoffman # see LICENSE.txt for license information from Rerequester import Rerequester from urllib import quote from threading import Event from random import randrange from string import lower import sys import __init__ try: True except: True = 1 False = 0 DEBUG = True def excfunc(x): print x class T2TConnection: def __init__(self, myid, tracker, hash, interval, peers, timeout, rawserver, disallow, isdisallowed): self.tracker = tracker self.interval = interval self.hash = hash self.operatinginterval = interval self.peers = peers self.rawserver = rawserver self.disallow = disallow self.isdisallowed = isdisallowed self.active = True self.busy = False self.errors = 0 self.rejected = 0 self.trackererror = False self.peerlists = [] self.rerequester = Rerequester([[tracker]], interval, rawserver.add_task, lambda: 0, peers, self.addtolist, rawserver.add_task, lambda: 1, 0, 0, 0, '', myid, hash, timeout, self.errorfunc, excfunc, peers, Event(), lambda: 0, lambda: 0) if self.isactive(): rawserver.add_task(self.refresh, randrange(int(self.interval/10), self.interval)) # stagger announces def isactive(self): if self.isdisallowed(self.tracker): # whoops! self.deactivate() return self.active def deactivate(self): self.active = False def refresh(self): if not self.isactive(): return self.lastsuccessful = True self.newpeerdata = [] if DEBUG: print 'contacting %s for info_hash=%s' % (self.tracker, quote(self.hash)) self.rerequester.snoop(self.peers, self.callback) def callback(self): self.busy = False if self.lastsuccessful: self.errors = 0 self.rejected = 0 if self.rerequester.announce_interval > (3*self.interval): # I think I'm stripping from a regular tracker; boost the number of peers requested self.peers = int(self.peers * (self.rerequester.announce_interval / self.interval)) self.operatinginterval = self.rerequester.announce_interval if DEBUG: print ("%s with info_hash=%s returned %d peers" % (self.tracker, quote(self.hash), len(self.newpeerdata))) self.peerlists.append(self.newpeerdata) self.peerlists = self.peerlists[-10:] # keep up to the last 10 announces if self.isactive(): self.rawserver.add_task(self.refresh, self.operatinginterval) def addtolist(self, peers): for peer in peers: self.newpeerdata.append((peer[1],peer[0][0],peer[0][1])) def errorfunc(self, r): self.lastsuccessful = False if DEBUG: print "%s with info_hash=%s gives error: '%s'" % (self.tracker, quote(self.hash), r) if r == self.rerequester.rejectedmessage + 'disallowed': # whoops! if DEBUG: print ' -- disallowed - deactivating' self.deactivate() self.disallow(self.tracker) # signal other torrents on this tracker return if lower(r[:8]) == 'rejected': # tracker rejected this particular torrent self.rejected += 1 if self.rejected == 3: # rejected 3 times if DEBUG: print ' -- rejected 3 times - deactivating' self.deactivate() return self.errors += 1 if self.errors >= 3: # three or more errors in a row self.operatinginterval += self.interval # lengthen the interval if DEBUG: print ' -- lengthening interval to '+str(self.operatinginterval)+' seconds' def harvest(self): x = [] for list in self.peerlists: x += list self.peerlists = [] return x class T2TList: def __init__(self, enabled, trackerid, interval, maxpeers, timeout, rawserver): self.enabled = enabled self.trackerid = trackerid self.interval = interval self.maxpeers = maxpeers self.timeout = timeout self.rawserver = rawserver self.list = {} self.torrents = {} self.disallowed = {} self.oldtorrents = [] def parse(self, allowed_list): if not self.enabled: return # step 1: Create a new list with all tracker/torrent combinations in allowed_dir newlist = {} for hash, data in allowed_list.items(): if data.has_key('announce-list'): for tier in data['announce-list']: for tracker in tier: self.disallowed.setdefault(tracker, False) newlist.setdefault(tracker, {}) newlist[tracker][hash] = None # placeholder # step 2: Go through and copy old data to the new list. # if the new list has no place for it, then it's old, so deactivate it for tracker, hashdata in self.list.items(): for hash, t2t in hashdata.items(): if not newlist.has_key(tracker) or not newlist[tracker].has_key(hash): t2t.deactivate() # this connection is no longer current self.oldtorrents += [t2t] # keep it referenced in case a thread comes along and tries to access. else: newlist[tracker][hash] = t2t if not newlist.has_key(tracker): self.disallowed[tracker] = False # reset when no torrents on it left self.list = newlist newtorrents = {} # step 3: If there are any entries that haven't been initialized yet, do so. # At the same time, copy all entries onto the by-torrent list. for tracker, hashdata in newlist.items(): for hash, t2t in hashdata.items(): if t2t is None: hashdata[hash] = T2TConnection(self.trackerid, tracker, hash, self.interval, self.maxpeers, self.timeout, self.rawserver, self._disallow, self._isdisallowed) newtorrents.setdefault(hash,[]) newtorrents[hash] += [hashdata[hash]] self.torrents = newtorrents # structures: # list = {tracker: {hash: T2TConnection, ...}, ...} # torrents = {hash: [T2TConnection, ...]} # disallowed = {tracker: flag, ...} # oldtorrents = [T2TConnection, ...] def _disallow(self,tracker): self.disallowed[tracker] = True def _isdisallowed(self,tracker): return self.disallowed[tracker] def harvest(self,hash): harvest = [] if self.enabled: for t2t in self.torrents[hash]: harvest += t2t.harvest() return harvest armory-0.92.3/BitTornado/BT1/Connecter.py0000644000000000000000000002165712414772654016570 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from BitTornado.bitfield import Bitfield from BitTornado.clock import clock from binascii import b2a_hex try: True except: True = 1 False = 0 DEBUG = False def toint(s): return long(b2a_hex(s), 16) def tobinary(i): return (chr(i >> 24) + chr((i >> 16) & 0xFF) + chr((i >> 8) & 0xFF) + chr(i & 0xFF)) CHOKE = chr(0) UNCHOKE = chr(1) INTERESTED = chr(2) NOT_INTERESTED = chr(3) # index HAVE = chr(4) # index, bitfield BITFIELD = chr(5) # index, begin, length REQUEST = chr(6) # index, begin, piece PIECE = chr(7) # index, begin, piece CANCEL = chr(8) class Connection: def __init__(self, connection, connecter): self.connection = connection self.connecter = connecter self.got_anything = False self.next_upload = None self.outqueue = [] self.partial_message = None self.download = None self.send_choke_queued = False self.just_unchoked = None def get_ip(self, real=False): return self.connection.get_ip(real) def get_id(self): return self.connection.get_id() def get_readable_id(self): return self.connection.get_readable_id() def close(self): if DEBUG: print 'connection closed' self.connection.close() def is_locally_initiated(self): return self.connection.is_locally_initiated() def send_interested(self): self._send_message(INTERESTED) def send_not_interested(self): self._send_message(NOT_INTERESTED) def send_choke(self): if self.partial_message: self.send_choke_queued = True else: self._send_message(CHOKE) self.upload.choke_sent() self.just_unchoked = 0 def send_unchoke(self): if self.send_choke_queued: self.send_choke_queued = False if DEBUG: print 'CHOKE SUPPRESSED' else: self._send_message(UNCHOKE) if ( self.partial_message or self.just_unchoked is None or not self.upload.interested or self.download.active_requests ): self.just_unchoked = 0 else: self.just_unchoked = clock() def send_request(self, index, begin, length): self._send_message(REQUEST + tobinary(index) + tobinary(begin) + tobinary(length)) if DEBUG: print 'sent request: '+str(index)+': '+str(begin)+'-'+str(begin+length) def send_cancel(self, index, begin, length): self._send_message(CANCEL + tobinary(index) + tobinary(begin) + tobinary(length)) if DEBUG: print 'sent cancel: '+str(index)+': '+str(begin)+'-'+str(begin+length) def send_bitfield(self, bitfield): self._send_message(BITFIELD + bitfield) def send_have(self, index): self._send_message(HAVE + tobinary(index)) def send_keepalive(self): self._send_message('') def _send_message(self, s): s = tobinary(len(s))+s if self.partial_message: self.outqueue.append(s) else: self.connection.send_message_raw(s) def send_partial(self, bytes): if self.connection.closed: return 0 if self.partial_message is None: s = self.upload.get_upload_chunk() if s is None: return 0 index, begin, piece = s self.partial_message = ''.join(( tobinary(len(piece) + 9), PIECE, tobinary(index), tobinary(begin), piece.tostring() )) if DEBUG: print 'sending chunk: '+str(index)+': '+str(begin)+'-'+str(begin+len(piece)) if bytes < len(self.partial_message): self.connection.send_message_raw(self.partial_message[:bytes]) self.partial_message = self.partial_message[bytes:] return bytes q = [self.partial_message] self.partial_message = None if self.send_choke_queued: self.send_choke_queued = False self.outqueue.append(tobinary(1)+CHOKE) self.upload.choke_sent() self.just_unchoked = 0 q.extend(self.outqueue) self.outqueue = [] q = ''.join(q) self.connection.send_message_raw(q) return len(q) def get_upload(self): return self.upload def get_download(self): return self.download def set_download(self, download): self.download = download def backlogged(self): return not self.connection.is_flushed() def got_request(self, i, p, l): self.upload.got_request(i, p, l) if self.just_unchoked: self.connecter.ratelimiter.ping(clock() - self.just_unchoked) self.just_unchoked = 0 class Connecter: def __init__(self, make_upload, downloader, choker, numpieces, totalup, config, ratelimiter, sched = None): self.downloader = downloader self.make_upload = make_upload self.choker = choker self.numpieces = numpieces self.config = config self.ratelimiter = ratelimiter self.rate_capped = False self.sched = sched self.totalup = totalup self.rate_capped = False self.connections = {} self.external_connection_made = 0 def how_many_connections(self): return len(self.connections) def connection_made(self, connection): c = Connection(connection, self) self.connections[connection] = c c.upload = self.make_upload(c, self.ratelimiter, self.totalup) c.download = self.downloader.make_download(c) self.choker.connection_made(c) return c def connection_lost(self, connection): c = self.connections[connection] del self.connections[connection] if c.download: c.download.disconnected() self.choker.connection_lost(c) def connection_flushed(self, connection): conn = self.connections[connection] if conn.next_upload is None and (conn.partial_message is not None or len(conn.upload.buffer) > 0): self.ratelimiter.queue(conn) def got_piece(self, i): for co in self.connections.values(): co.send_have(i) def got_message(self, connection, message): c = self.connections[connection] t = message[0] if t == BITFIELD and c.got_anything: connection.close() return c.got_anything = True if (t in [CHOKE, UNCHOKE, INTERESTED, NOT_INTERESTED] and len(message) != 1): connection.close() return if t == CHOKE: c.download.got_choke() elif t == UNCHOKE: c.download.got_unchoke() elif t == INTERESTED: if not c.download.have.complete(): c.upload.got_interested() elif t == NOT_INTERESTED: c.upload.got_not_interested() elif t == HAVE: if len(message) != 5: connection.close() return i = toint(message[1:]) if i >= self.numpieces: connection.close() return if c.download.got_have(i): c.upload.got_not_interested() elif t == BITFIELD: try: b = Bitfield(self.numpieces, message[1:]) except ValueError: connection.close() return if c.download.got_have_bitfield(b): c.upload.got_not_interested() elif t == REQUEST: if len(message) != 13: connection.close() return i = toint(message[1:5]) if i >= self.numpieces: connection.close() return c.got_request(i, toint(message[5:9]), toint(message[9:])) elif t == CANCEL: if len(message) != 13: connection.close() return i = toint(message[1:5]) if i >= self.numpieces: connection.close() return c.upload.got_cancel(i, toint(message[5:9]), toint(message[9:])) elif t == PIECE: if len(message) <= 9: connection.close() return i = toint(message[1:5]) if i >= self.numpieces: connection.close() return if c.download.got_piece(i, toint(message[5:9]), message[9:]): self.got_piece(i) else: connection.close() armory-0.92.3/BitTornado/BT1/Rerequester.py0000644000000000000000000003426212414772654017152 0ustar rootroot# Written by Bram Cohen # modified for multitracker operation by John Hoffman # see LICENSE.txt for license information from BitTornado.zurllib import urlopen, quote from urlparse import urlparse, urlunparse from socket import gethostbyname from btformats import check_peers from BitTornado.bencode import bdecode from threading import Thread, Lock from cStringIO import StringIO from traceback import print_exc from socket import error, gethostbyname from random import shuffle from sha import sha from time import time try: from os import getpid except ImportError: def getpid(): return 1 try: True except: True = 1 False = 0 mapbase64 = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz.-' keys = {} basekeydata = str(getpid()) + repr(time()) + 'tracker' def add_key(tracker): key = '' for i in sha(basekeydata+tracker).digest()[-6:]: key += mapbase64[ord(i) & 0x3F] keys[tracker] = key def get_key(tracker): try: return "&key="+keys[tracker] except: add_key(tracker) return "&key="+keys[tracker] class fakeflag: def __init__(self, state=False): self.state = state def wait(self): pass def isSet(self): return self.state class Rerequester: def __init__(self, trackerlist, interval, sched, howmany, minpeers, connect, externalsched, amount_left, up, down, port, ip, myid, infohash, timeout, errorfunc, excfunc, maxpeers, doneflag, upratefunc, downratefunc, unpauseflag = fakeflag(True), seed_id = '', seededfunc = None, force_rapid_update = False ): self.excfunc = excfunc newtrackerlist = [] for tier in trackerlist: if len(tier)>1: shuffle(tier) newtrackerlist += [tier] self.trackerlist = newtrackerlist self.lastsuccessful = '' self.rejectedmessage = 'rejected by tracker - ' self.url = ('?info_hash=%s&peer_id=%s&port=%s' % (quote(infohash), quote(myid), str(port))) self.ip = ip self.interval = interval self.last = None self.trackerid = None self.announce_interval = 30 * 60 self.sched = sched self.howmany = howmany self.minpeers = minpeers self.connect = connect self.externalsched = externalsched self.amount_left = amount_left self.up = up self.down = down self.timeout = timeout self.errorfunc = errorfunc self.maxpeers = maxpeers self.doneflag = doneflag self.upratefunc = upratefunc self.downratefunc = downratefunc self.unpauseflag = unpauseflag if seed_id: self.url += '&seed_id='+quote(seed_id) self.seededfunc = seededfunc if seededfunc: self.url += '&check_seeded=1' self.force_rapid_update = force_rapid_update self.last_failed = True self.never_succeeded = True self.errorcodes = {} self.lock = SuccessLock() self.special = None self.stopped = False def start(self): self.sched(self.c, self.interval/2) self.d(0) def c(self): if self.stopped: return if not self.unpauseflag.isSet() and ( self.howmany() < self.minpeers or self.force_rapid_update ): self.announce(3, self._c) else: self._c() def _c(self): self.sched(self.c, self.interval) def d(self, event = 3): if self.stopped: return if not self.unpauseflag.isSet(): self._d() return self.announce(event, self._d) def _d(self): if self.never_succeeded: self.sched(self.d, 60) # retry in 60 seconds elif self.force_rapid_update: return else: self.sched(self.d, self.announce_interval) def hit(self, event = 3): if not self.unpauseflag.isSet() and ( self.howmany() < self.minpeers or self.force_rapid_update ): self.announce(event) def announce(self, event = 3, callback = lambda: None, specialurl = None): if specialurl is not None: s = self.url+'&uploaded=0&downloaded=0&left=1' # don't add to statistics if self.howmany() >= self.maxpeers: s += '&numwant=0' else: s += '&no_peer_id=1&compact=1' self.last_failed = True # force true, so will display an error self.special = specialurl self.rerequest(s, callback) return else: s = ('%s&uploaded=%s&downloaded=%s&left=%s' % (self.url, str(self.up()), str(self.down()), str(self.amount_left()))) if self.last is not None: s += '&last=' + quote(str(self.last)) if self.trackerid is not None: s += '&trackerid=' + quote(str(self.trackerid)) if self.howmany() >= self.maxpeers: s += '&numwant=0' else: s += '&no_peer_id=1&compact=1' if event != 3: s += '&event=' + ['started', 'completed', 'stopped'][event] if event == 2: self.stopped = True self.rerequest(s, callback) def snoop(self, peers, callback = lambda: None): # tracker call support self.rerequest(self.url +'&event=stopped&port=0&uploaded=0&downloaded=0&left=1&tracker=1&numwant=' +str(peers), callback) def rerequest(self, s, callback): if not self.lock.isfinished(): # still waiting for prior cycle to complete?? def retry(self = self, s = s, callback = callback): self.rerequest(s, callback) self.sched(retry,5) # retry in 5 seconds return self.lock.reset() rq = Thread(target = self._rerequest, args = [s, callback]) rq.setDaemon(False) rq.start() def _rerequest(self, s, callback): try: def fail (self = self, callback = callback): self._fail(callback) if self.ip: try: s += '&ip=' + gethostbyname(self.ip) except: self.errorcodes['troublecode'] = 'unable to resolve: '+self.ip self.externalsched(fail) self.errorcodes = {} if self.special is None: for t in range(len(self.trackerlist)): for tr in range(len(self.trackerlist[t])): tracker = self.trackerlist[t][tr] if self.rerequest_single(tracker, s, callback): if not self.last_failed and tr != 0: del self.trackerlist[t][tr] self.trackerlist[t] = [tracker] + self.trackerlist[t] return else: tracker = self.special self.special = None if self.rerequest_single(tracker, s, callback): return # no success from any tracker self.externalsched(fail) except: self.exception(callback) def _fail(self, callback): if ( (self.upratefunc() < 100 and self.downratefunc() < 100) or not self.amount_left() ): for f in ['rejected', 'bad_data', 'troublecode']: if self.errorcodes.has_key(f): r = self.errorcodes[f] break else: r = 'Problem connecting to tracker - unspecified error' self.errorfunc(r) self.last_failed = True self.lock.give_up() self.externalsched(callback) def rerequest_single(self, t, s, callback): l = self.lock.set() rq = Thread(target = self._rerequest_single, args = [t, s+get_key(t), l, callback]) rq.setDaemon(False) rq.start() self.lock.wait() if self.lock.success: self.lastsuccessful = t self.last_failed = False self.never_succeeded = False return True if not self.last_failed and self.lastsuccessful == t: # if the last tracker hit was successful, and you've just tried the tracker # you'd contacted before, don't go any further, just fail silently. self.last_failed = True self.externalsched(callback) self.lock.give_up() return True return False # returns true if it wants rerequest() to exit def _rerequest_single(self, t, s, l, callback): try: closer = [None] def timedout(self = self, l = l, closer = closer): if self.lock.trip(l): self.errorcodes['troublecode'] = 'Problem connecting to tracker - timeout exceeded' self.lock.unwait(l) try: closer[0]() except: pass self.externalsched(timedout, self.timeout) err = None try: h = urlopen(t+s) closer[0] = h.close data = h.read() except (IOError, error), e: err = 'Problem connecting to tracker - ' + str(e) except: err = 'Problem connecting to tracker' try: h.close() except: pass if err: if self.lock.trip(l): self.errorcodes['troublecode'] = err self.lock.unwait(l) return if data == '': if self.lock.trip(l): self.errorcodes['troublecode'] = 'no data from tracker' self.lock.unwait(l) return try: r = bdecode(data, sloppy=1) check_peers(r) except ValueError, e: if self.lock.trip(l): self.errorcodes['bad_data'] = 'bad data from tracker - ' + str(e) self.lock.unwait(l) return if r.has_key('failure reason'): if self.lock.trip(l): self.errorcodes['rejected'] = self.rejectedmessage + r['failure reason'] self.lock.unwait(l) return if self.lock.trip(l, True): # success! self.lock.unwait(l) else: callback = lambda: None # attempt timed out, don't do a callback # even if the attempt timed out, go ahead and process data def add(self = self, r = r, callback = callback): self.postrequest(r, callback) self.externalsched(add) except: self.exception(callback) def postrequest(self, r, callback): if r.has_key('warning message'): self.errorfunc('warning from tracker - ' + r['warning message']) self.announce_interval = r.get('interval', self.announce_interval) self.interval = r.get('min interval', self.interval) self.trackerid = r.get('tracker id', self.trackerid) self.last = r.get('last') # ps = len(r['peers']) + self.howmany() p = r['peers'] peers = [] if type(p) == type(''): for x in xrange(0, len(p), 6): ip = '.'.join([str(ord(i)) for i in p[x:x+4]]) port = (ord(p[x+4]) << 8) | ord(p[x+5]) peers.append(((ip, port), 0)) else: for x in p: peers.append(((x['ip'].strip(), x['port']), x.get('peer id',0))) ps = len(peers) + self.howmany() if ps < self.maxpeers: if self.doneflag.isSet(): if r.get('num peers', 1000) - r.get('done peers', 0) > ps * 1.2: self.last = None else: if r.get('num peers', 1000) > ps * 1.2: self.last = None if self.seededfunc and r.get('seeded'): self.seededfunc() elif peers: shuffle(peers) self.connect(peers) callback() def exception(self, callback): data = StringIO() print_exc(file = data) def r(s = data.getvalue(), callback = callback): if self.excfunc: self.excfunc(s) else: print s callback() self.externalsched(r) class SuccessLock: def __init__(self): self.lock = Lock() self.pause = Lock() self.code = 0L self.success = False self.finished = True def reset(self): self.success = False self.finished = False def set(self): self.lock.acquire() if not self.pause.locked(): self.pause.acquire() self.first = True self.code += 1L self.lock.release() return self.code def trip(self, code, s = False): self.lock.acquire() try: if code == self.code and not self.finished: r = self.first self.first = False if s: self.finished = True self.success = True return r finally: self.lock.release() def give_up(self): self.lock.acquire() self.success = False self.finished = True self.lock.release() def wait(self): self.pause.acquire() def unwait(self, code): if code == self.code and self.pause.locked(): self.pause.release() def isfinished(self): self.lock.acquire() x = self.finished self.lock.release() return x armory-0.92.3/BitTornado/BT1/fakeopen.py0000644000000000000000000000443112414772654016427 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from string import join class FakeHandle: def __init__(self, name, fakeopen): self.name = name self.fakeopen = fakeopen self.pos = 0 def flush(self): pass def close(self): pass def seek(self, pos): self.pos = pos def read(self, amount = None): old = self.pos f = self.fakeopen.files[self.name] if self.pos >= len(f): return '' if amount is None: self.pos = len(f) return join(f[old:], '') else: self.pos = min(len(f), old + amount) return join(f[old:self.pos], '') def write(self, s): f = self.fakeopen.files[self.name] while len(f) < self.pos: f.append(chr(0)) self.fakeopen.files[self.name][self.pos : self.pos + len(s)] = list(s) self.pos += len(s) class FakeOpen: def __init__(self, initial = {}): self.files = {} for key, value in initial.items(): self.files[key] = list(value) def open(self, filename, mode): """currently treats everything as rw - doesn't support append""" self.files.setdefault(filename, []) return FakeHandle(filename, self) def exists(self, file): return self.files.has_key(file) def getsize(self, file): return len(self.files[file]) def test_normal(): f = FakeOpen({'f1': 'abcde'}) assert f.exists('f1') assert not f.exists('f2') assert f.getsize('f1') == 5 h = f.open('f1', 'rw') assert h.read(3) == 'abc' assert h.read(1) == 'd' assert h.read() == 'e' assert h.read(2) == '' h.write('fpq') h.seek(4) assert h.read(2) == 'ef' h.write('ghij') h.seek(0) assert h.read() == 'abcdefghij' h.seek(2) h.write('p') h.write('q') assert h.read(1) == 'e' h.seek(1) assert h.read(5) == 'bpqef' h2 = f.open('f2', 'rw') assert h2.read() == '' h2.write('mnop') h2.seek(1) assert h2.read() == 'nop' assert f.exists('f1') assert f.exists('f2') assert f.getsize('f1') == 10 assert f.getsize('f2') == 4 armory-0.92.3/BitTornado/BT1/Downloader.py0000644000000000000000000005524212414772654016743 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from BitTornado.CurrentRateMeasure import Measure from BitTornado.bitfield import Bitfield from random import shuffle from BitTornado.clock import clock try: True except: True = 1 False = 0 EXPIRE_TIME = 60 * 60 class PerIPStats: def __init__(self, ip): self.numgood = 0 self.bad = {} self.numconnections = 0 self.lastdownload = None self.peerid = None class BadDataGuard: def __init__(self, download): self.download = download self.ip = download.ip self.downloader = download.downloader self.stats = self.downloader.perip[self.ip] self.lastindex = None def failed(self, index, bump = False): self.stats.bad.setdefault(index, 0) self.downloader.gotbaddata[self.ip] = 1 self.stats.bad[index] += 1 if len(self.stats.bad) > 1: if self.download is not None: self.downloader.try_kick(self.download) elif self.stats.numconnections == 1 and self.stats.lastdownload is not None: self.downloader.try_kick(self.stats.lastdownload) if len(self.stats.bad) >= 3 and len(self.stats.bad) > int(self.stats.numgood/30): self.downloader.try_ban(self.ip) elif bump: self.downloader.picker.bump(index) def good(self, index): # lastindex is a hack to only increase numgood by one for each good # piece, however many chunks come from the connection(s) from this IP if index != self.lastindex: self.stats.numgood += 1 self.lastindex = index class SingleDownload: def __init__(self, downloader, connection): self.downloader = downloader self.connection = connection self.choked = True self.interested = False self.active_requests = [] self.measure = Measure(downloader.max_rate_period) self.peermeasure = Measure(downloader.max_rate_period) self.have = Bitfield(downloader.numpieces) self.last = -1000 self.last2 = -1000 self.example_interest = None self.backlog = 2 self.ip = connection.get_ip() self.guard = BadDataGuard(self) def _backlog(self, just_unchoked): self.backlog = min( 2+int(4*self.measure.get_rate()/self.downloader.chunksize), (2*just_unchoked)+self.downloader.queue_limit() ) if self.backlog > 50: self.backlog = max(50, self.backlog * 0.075) return self.backlog def disconnected(self): self.downloader.lost_peer(self) if self.have.complete(): self.downloader.picker.lost_seed() else: for i in xrange(len(self.have)): if self.have[i]: self.downloader.picker.lost_have(i) if self.have.complete() and self.downloader.storage.is_endgame(): self.downloader.add_disconnected_seed(self.connection.get_readable_id()) self._letgo() self.guard.download = None def _letgo(self): if self.downloader.queued_out.has_key(self): del self.downloader.queued_out[self] if not self.active_requests: return if self.downloader.endgamemode: self.active_requests = [] return lost = {} for index, begin, length in self.active_requests: self.downloader.storage.request_lost(index, begin, length) lost[index] = 1 lost = lost.keys() self.active_requests = [] if self.downloader.paused: return ds = [d for d in self.downloader.downloads if not d.choked] shuffle(ds) for d in ds: d._request_more() for d in self.downloader.downloads: if d.choked and not d.interested: for l in lost: if d.have[l] and self.downloader.storage.do_I_have_requests(l): d.send_interested() break def got_choke(self): if not self.choked: self.choked = True self._letgo() def got_unchoke(self): if self.choked: self.choked = False if self.interested: self._request_more(new_unchoke = True) self.last2 = clock() def is_choked(self): return self.choked def is_interested(self): return self.interested def send_interested(self): if not self.interested: self.interested = True self.connection.send_interested() if not self.choked: self.last2 = clock() def send_not_interested(self): if self.interested: self.interested = False self.connection.send_not_interested() def got_piece(self, index, begin, piece): length = len(piece) try: self.active_requests.remove((index, begin, length)) except ValueError: self.downloader.discarded += length return False if self.downloader.endgamemode: self.downloader.all_requests.remove((index, begin, length)) self.last = clock() self.last2 = clock() self.measure.update_rate(length) self.downloader.measurefunc(length) if not self.downloader.storage.piece_came_in(index, begin, piece, self.guard): self.downloader.piece_flunked(index) return False if self.downloader.storage.do_I_have(index): self.downloader.picker.complete(index) if self.downloader.endgamemode: for d in self.downloader.downloads: if d is not self: if d.interested: if d.choked: assert not d.active_requests d.fix_download_endgame() else: try: d.active_requests.remove((index, begin, length)) except ValueError: continue d.connection.send_cancel(index, begin, length) d.fix_download_endgame() else: assert not d.active_requests self._request_more() self.downloader.check_complete(index) return self.downloader.storage.do_I_have(index) def _request_more(self, new_unchoke = False): assert not self.choked if self.downloader.endgamemode: self.fix_download_endgame(new_unchoke) return if self.downloader.paused: return if len(self.active_requests) >= self._backlog(new_unchoke): if not (self.active_requests or self.backlog): self.downloader.queued_out[self] = 1 return lost_interests = [] while len(self.active_requests) < self.backlog: interest = self.downloader.picker.next(self.have, self.downloader.storage.do_I_have_requests, self.downloader.too_many_partials()) if interest is None: break self.example_interest = interest self.send_interested() loop = True while len(self.active_requests) < self.backlog and loop: begin, length = self.downloader.storage.new_request(interest) self.downloader.picker.requested(interest) self.active_requests.append((interest, begin, length)) self.connection.send_request(interest, begin, length) self.downloader.chunk_requested(length) if not self.downloader.storage.do_I_have_requests(interest): loop = False lost_interests.append(interest) if not self.active_requests: self.send_not_interested() if lost_interests: for d in self.downloader.downloads: if d.active_requests or not d.interested: continue if d.example_interest is not None and self.downloader.storage.do_I_have_requests(d.example_interest): continue for lost in lost_interests: if d.have[lost]: break else: continue interest = self.downloader.picker.next(d.have, self.downloader.storage.do_I_have_requests, self.downloader.too_many_partials()) if interest is None: d.send_not_interested() else: d.example_interest = interest if self.downloader.storage.is_endgame(): self.downloader.start_endgame() def fix_download_endgame(self, new_unchoke = False): if self.downloader.paused: return if len(self.active_requests) >= self._backlog(new_unchoke): if not (self.active_requests or self.backlog) and not self.choked: self.downloader.queued_out[self] = 1 return want = [a for a in self.downloader.all_requests if self.have[a[0]] and a not in self.active_requests] if not (self.active_requests or want): self.send_not_interested() return if want: self.send_interested() if self.choked: return shuffle(want) del want[self.backlog - len(self.active_requests):] self.active_requests.extend(want) for piece, begin, length in want: self.connection.send_request(piece, begin, length) self.downloader.chunk_requested(length) def got_have(self, index): if index == self.downloader.numpieces-1: self.downloader.totalmeasure.update_rate(self.downloader.storage.total_length-(self.downloader.numpieces-1)*self.downloader.storage.piece_length) self.peermeasure.update_rate(self.downloader.storage.total_length-(self.downloader.numpieces-1)*self.downloader.storage.piece_length) else: self.downloader.totalmeasure.update_rate(self.downloader.storage.piece_length) self.peermeasure.update_rate(self.downloader.storage.piece_length) if not self.have[index]: self.have[index] = True self.downloader.picker.got_have(index) if self.have.complete(): self.downloader.picker.became_seed() if self.downloader.storage.am_I_complete(): self.downloader.add_disconnected_seed(self.connection.get_readable_id()) self.connection.close() elif self.downloader.endgamemode: self.fix_download_endgame() elif ( not self.downloader.paused and not self.downloader.picker.is_blocked(index) and self.downloader.storage.do_I_have_requests(index) ): if not self.choked: self._request_more() else: self.send_interested() return self.have.complete() def _check_interests(self): if self.interested or self.downloader.paused: return for i in xrange(len(self.have)): if ( self.have[i] and not self.downloader.picker.is_blocked(i) and ( self.downloader.endgamemode or self.downloader.storage.do_I_have_requests(i) ) ): self.send_interested() return def got_have_bitfield(self, have): if self.downloader.storage.am_I_complete() and have.complete(): if self.downloader.super_seeding: self.connection.send_bitfield(have.tostring()) # be nice, show you're a seed too self.connection.close() self.downloader.add_disconnected_seed(self.connection.get_readable_id()) return False self.have = have if have.complete(): self.downloader.picker.got_seed() else: for i in xrange(len(have)): if have[i]: self.downloader.picker.got_have(i) if self.downloader.endgamemode and not self.downloader.paused: for piece, begin, length in self.downloader.all_requests: if self.have[piece]: self.send_interested() break else: self._check_interests() return have.complete() def get_rate(self): return self.measure.get_rate() def is_snubbed(self): if ( self.interested and not self.choked and clock() - self.last2 > self.downloader.snub_time ): for index, begin, length in self.active_requests: self.connection.send_cancel(index, begin, length) self.got_choke() # treat it just like a choke return clock() - self.last > self.downloader.snub_time class Downloader: def __init__(self, storage, picker, backlog, max_rate_period, numpieces, chunksize, measurefunc, snub_time, kickbans_ok, kickfunc, banfunc): self.storage = storage self.picker = picker self.backlog = backlog self.max_rate_period = max_rate_period self.measurefunc = measurefunc self.totalmeasure = Measure(max_rate_period*storage.piece_length/storage.request_size) self.numpieces = numpieces self.chunksize = chunksize self.snub_time = snub_time self.kickfunc = kickfunc self.banfunc = banfunc self.disconnectedseeds = {} self.downloads = [] self.perip = {} self.gotbaddata = {} self.kicked = {} self.banned = {} self.kickbans_ok = kickbans_ok self.kickbans_halted = False self.super_seeding = False self.endgamemode = False self.endgame_queued_pieces = [] self.all_requests = [] self.discarded = 0L # self.download_rate = 25000 # 25K/s test rate self.download_rate = 0 self.bytes_requested = 0 self.last_time = clock() self.queued_out = {} self.requeueing = False self.paused = False def set_download_rate(self, rate): self.download_rate = rate * 1000 self.bytes_requested = 0 def queue_limit(self): if not self.download_rate: return 10e10 # that's a big queue! t = clock() self.bytes_requested -= (t - self.last_time) * self.download_rate self.last_time = t if not self.requeueing and self.queued_out and self.bytes_requested < 0: self.requeueing = True q = self.queued_out.keys() shuffle(q) self.queued_out = {} for d in q: d._request_more() self.requeueing = False if -self.bytes_requested > 5*self.download_rate: self.bytes_requested = -5*self.download_rate return max(int(-self.bytes_requested/self.chunksize),0) def chunk_requested(self, size): self.bytes_requested += size external_data_received = chunk_requested def make_download(self, connection): ip = connection.get_ip() if self.perip.has_key(ip): perip = self.perip[ip] else: perip = self.perip.setdefault(ip, PerIPStats(ip)) perip.peerid = connection.get_readable_id() perip.numconnections += 1 d = SingleDownload(self, connection) perip.lastdownload = d self.downloads.append(d) return d def piece_flunked(self, index): if self.paused: return if self.endgamemode: if self.downloads: while self.storage.do_I_have_requests(index): nb, nl = self.storage.new_request(index) self.all_requests.append((index, nb, nl)) for d in self.downloads: d.fix_download_endgame() return self._reset_endgame() return ds = [d for d in self.downloads if not d.choked] shuffle(ds) for d in ds: d._request_more() ds = [d for d in self.downloads if not d.interested and d.have[index]] for d in ds: d.example_interest = index d.send_interested() def has_downloaders(self): return len(self.downloads) def lost_peer(self, download): ip = download.ip self.perip[ip].numconnections -= 1 if self.perip[ip].lastdownload == download: self.perip[ip].lastdownload = None self.downloads.remove(download) if self.endgamemode and not self.downloads: # all peers gone self._reset_endgame() def _reset_endgame(self): self.storage.reset_endgame(self.all_requests) self.endgamemode = False self.all_requests = [] self.endgame_queued_pieces = [] def add_disconnected_seed(self, id): # if not self.disconnectedseeds.has_key(id): # self.picker.seed_seen_recently() self.disconnectedseeds[id]=clock() # def expire_disconnected_seeds(self): def num_disconnected_seeds(self): # first expire old ones expired = [] for id,t in self.disconnectedseeds.items(): if clock() - t > EXPIRE_TIME: #Expire old seeds after so long expired.append(id) for id in expired: # self.picker.seed_disappeared() del self.disconnectedseeds[id] return len(self.disconnectedseeds) # if this isn't called by a stats-gathering function # it should be scheduled to run every minute or two. def _check_kicks_ok(self): if len(self.gotbaddata) > 10: self.kickbans_ok = False self.kickbans_halted = True return self.kickbans_ok and len(self.downloads) > 2 def try_kick(self, download): if self._check_kicks_ok(): download.guard.download = None ip = download.ip id = download.connection.get_readable_id() self.kicked[ip] = id self.perip[ip].peerid = id self.kickfunc(download.connection) def try_ban(self, ip): if self._check_kicks_ok(): self.banfunc(ip) self.banned[ip] = self.perip[ip].peerid if self.kicked.has_key(ip): del self.kicked[ip] def set_super_seed(self): self.super_seeding = True def check_complete(self, index): if self.endgamemode and not self.all_requests: self.endgamemode = False if self.endgame_queued_pieces and not self.endgamemode: self.requeue_piece_download() if self.storage.am_I_complete(): assert not self.all_requests assert not self.endgamemode for d in [i for i in self.downloads if i.have.complete()]: d.connection.send_have(index) # be nice, tell the other seed you completed self.add_disconnected_seed(d.connection.get_readable_id()) d.connection.close() return True return False def too_many_partials(self): return len(self.storage.dirty) > (len(self.downloads)/2) def cancel_piece_download(self, pieces): if self.endgamemode: if self.endgame_queued_pieces: for piece in pieces: try: self.endgame_queued_pieces.remove(piece) except: pass new_all_requests = [] for index, nb, nl in self.all_requests: if index in pieces: self.storage.request_lost(index, nb, nl) else: new_all_requests.append((index, nb, nl)) self.all_requests = new_all_requests for d in self.downloads: hit = False for index, nb, nl in d.active_requests: if index in pieces: hit = True d.connection.send_cancel(index, nb, nl) if not self.endgamemode: self.storage.request_lost(index, nb, nl) if hit: d.active_requests = [ r for r in d.active_requests if r[0] not in pieces ] d._request_more() if not self.endgamemode and d.choked: d._check_interests() def requeue_piece_download(self, pieces = []): if self.endgame_queued_pieces: for piece in pieces: if not piece in self.endgame_queued_pieces: self.endgame_queued_pieces.append(piece) pieces = self.endgame_queued_pieces if self.endgamemode: if self.all_requests: self.endgame_queued_pieces = pieces return self.endgamemode = False self.endgame_queued_pieces = None ds = [d for d in self.downloads] shuffle(ds) for d in ds: if d.choked: d._check_interests() else: d._request_more() def start_endgame(self): assert not self.endgamemode self.endgamemode = True assert not self.all_requests for d in self.downloads: if d.active_requests: assert d.interested and not d.choked for request in d.active_requests: assert not request in self.all_requests self.all_requests.append(request) for d in self.downloads: d.fix_download_endgame() def pause(self, flag): self.paused = flag if flag: for d in self.downloads: for index, begin, length in d.active_requests: d.connection.send_cancel(index, begin, length) d._letgo() d.send_not_interested() if self.endgamemode: self._reset_endgame() else: shuffle(self.downloads) for d in self.downloads: d._check_interests() if d.interested and not d.choked: d._request_more() armory-0.92.3/BitTornado/BT1/NatCheck.py0000644000000000000000000000541212414772654016317 0ustar rootroot# Written by Bram Cohen # see LICENSE.txt for license information from cStringIO import StringIO from socket import error as socketerror from traceback import print_exc try: True except: True = 1 False = 0 protocol_name = 'BitTorrent protocol' # header, reserved, download id, my id, [length, message] class NatCheck: def __init__(self, resultfunc, downloadid, peerid, ip, port, rawserver): self.resultfunc = resultfunc self.downloadid = downloadid self.peerid = peerid self.ip = ip self.port = port self.closed = False self.buffer = StringIO() self.next_len = 1 self.next_func = self.read_header_len try: self.connection = rawserver.start_connection((ip, port), self) self.connection.write(chr(len(protocol_name)) + protocol_name + (chr(0) * 8) + downloadid) except socketerror: self.answer(False) except IOError: self.answer(False) def answer(self, result): self.closed = True try: self.connection.close() except AttributeError: pass self.resultfunc(result, self.downloadid, self.peerid, self.ip, self.port) def read_header_len(self, s): if ord(s) != len(protocol_name): return None return len(protocol_name), self.read_header def read_header(self, s): if s != protocol_name: return None return 8, self.read_reserved def read_reserved(self, s): return 20, self.read_download_id def read_download_id(self, s): if s != self.downloadid: return None return 20, self.read_peer_id def read_peer_id(self, s): if s != self.peerid: return None self.answer(True) return None def data_came_in(self, connection, s): while True: if self.closed: return i = self.next_len - self.buffer.tell() if i > len(s): self.buffer.write(s) return self.buffer.write(s[:i]) s = s[i:] m = self.buffer.getvalue() self.buffer.reset() self.buffer.truncate() x = self.next_func(m) if x is None: if not self.closed: self.answer(False) return self.next_len, self.next_func = x def connection_lost(self, connection): if not self.closed: self.closed = True self.resultfunc(False, self.downloadid, self.peerid, self.ip, self.port) def connection_flushed(self, connection): pass armory-0.92.3/BitTornado/ConnChoice.py0000644000000000000000000000216712414772654016265 0ustar rootrootconnChoices=( {'name':'automatic', 'rate':{'min':0, 'max':5000, 'def': 0}, 'conn':{'min':0, 'max':100, 'def': 0}, 'automatic':1}, {'name':'unlimited', 'rate':{'min':0, 'max':5000, 'def': 0, 'div': 50}, 'conn':{'min':4, 'max':100, 'def': 4}}, {'name':'dialup/isdn', 'rate':{'min':3, 'max': 8, 'def': 5}, 'conn':{'min':2, 'max': 3, 'def': 2}, 'initiate': 12}, {'name':'dsl/cable slow', 'rate':{'min':10, 'max': 48, 'def': 13}, 'conn':{'min':4, 'max': 20, 'def': 4}}, {'name':'dsl/cable fast', 'rate':{'min':20, 'max': 100, 'def': 40}, 'conn':{'min':4, 'max': 30, 'def': 6}}, {'name':'T1', 'rate':{'min':100, 'max': 300, 'def':150}, 'conn':{'min':4, 'max': 40, 'def':10}}, {'name':'T3+', 'rate':{'min':400, 'max':2000, 'def':500}, 'conn':{'min':4, 'max':100, 'def':20}}, {'name':'seeder', 'rate':{'min':0, 'max':5000, 'def':0, 'div': 50}, 'conn':{'min':1, 'max':100, 'def':1}}, {'name':'SUPER-SEED', 'super-seed':1} ) connChoiceList = map(lambda x:x['name'], connChoices) armory-0.92.3/BitTornado/parsedir.py0000644000000000000000000001161412414772654016063 0ustar rootroot# Written by John Hoffman and Uoti Urpala # see LICENSE.txt for license information from bencode import bencode, bdecode from BT1.btformats import check_info from os.path import exists, isfile from sha import sha import sys, os try: True except: True = 1 False = 0 NOISY = False def _errfunc(x): print ":: "+x def parsedir(directory, parsed, files, blocked, exts = ['.torrent'], return_metainfo = False, errfunc = _errfunc): if NOISY: errfunc('checking dir') dirs_to_check = [directory] new_files = {} new_blocked = {} torrent_type = {} while dirs_to_check: # first, recurse directories and gather torrents directory = dirs_to_check.pop() newtorrents = False for f in os.listdir(directory): newtorrent = None for ext in exts: if f.endswith(ext): newtorrent = ext[1:] break if newtorrent: newtorrents = True p = os.path.join(directory, f) new_files[p] = [(os.path.getmtime(p), os.path.getsize(p)), 0] torrent_type[p] = newtorrent if not newtorrents: for f in os.listdir(directory): p = os.path.join(directory, f) if os.path.isdir(p): dirs_to_check.append(p) new_parsed = {} to_add = [] added = {} removed = {} # files[path] = [(modification_time, size), hash], hash is 0 if the file # has not been successfully parsed for p,v in new_files.items(): # re-add old items and check for changes oldval = files.get(p) if not oldval: # new file to_add.append(p) continue h = oldval[1] if oldval[0] == v[0]: # file is unchanged from last parse if h: if blocked.has_key(p): # parseable + blocked means duplicate to_add.append(p) # other duplicate may have gone away else: new_parsed[h] = parsed[h] new_files[p] = oldval else: new_blocked[p] = 1 # same broken unparseable file continue if parsed.has_key(h) and not blocked.has_key(p): if NOISY: errfunc('removing '+p+' (will re-add)') removed[h] = parsed[h] to_add.append(p) to_add.sort() for p in to_add: # then, parse new and changed torrents new_file = new_files[p] v,h = new_file if new_parsed.has_key(h): # duplicate if not blocked.has_key(p) or files[p][0] != v: errfunc('**warning** '+ p +' is a duplicate torrent for '+new_parsed[h]['path']) new_blocked[p] = 1 continue if NOISY: errfunc('adding '+p) try: ff = open(p, 'rb') d = bdecode(ff.read()) check_info(d['info']) h = sha(bencode(d['info'])).digest() new_file[1] = h if new_parsed.has_key(h): errfunc('**warning** '+ p +' is a duplicate torrent for '+new_parsed[h]['path']) new_blocked[p] = 1 continue a = {} a['path'] = p f = os.path.basename(p) a['file'] = f a['type'] = torrent_type[p] i = d['info'] l = 0 nf = 0 if i.has_key('length'): l = i.get('length',0) nf = 1 elif i.has_key('files'): for li in i['files']: nf += 1 if li.has_key('length'): l += li['length'] a['numfiles'] = nf a['length'] = l a['name'] = i.get('name', f) def setkey(k, d = d, a = a): if d.has_key(k): a[k] = d[k] setkey('failure reason') setkey('warning message') setkey('announce-list') if return_metainfo: a['metainfo'] = d except: errfunc('**warning** '+p+' has errors') new_blocked[p] = 1 continue try: ff.close() except: pass if NOISY: errfunc('... successful') new_parsed[h] = a added[h] = a for p,v in files.items(): # and finally, mark removed torrents if not new_files.has_key(p) and not blocked.has_key(p): if NOISY: errfunc('removing '+p) removed[v[1]] = parsed[v[1]] if NOISY: errfunc('done checking') return (new_parsed, new_files, new_blocked, added, removed) armory-0.92.3/BitTornado/clock.py0000644000000000000000000000115512414772654015344 0ustar rootroot# Written by John Hoffman # see LICENSE.txt for license information from time import * import sys _MAXFORWARD = 100 _FUDGE = 1 class RelativeTime: def __init__(self): self.time = time() self.offset = 0 def get_time(self): t = time() + self.offset if t < self.time or t > self.time + _MAXFORWARD: self.time += _FUDGE self.offset += self.time - t return self.time self.time = t return t if sys.platform != 'win32': _RTIME = RelativeTime() def clock(): return _RTIME.get_time()armory-0.92.3/BitTornado/ConfigDir.py0000644000000000000000000002451512414772654016122 0ustar rootroot#written by John Hoffman from inifile import ini_write, ini_read from bencode import bencode, bdecode from types import IntType, LongType, StringType, FloatType from CreateIcons import GetIcons, CreateIcon from parseargs import defaultargs from __init__ import product_name, version_short import sys,os from time import time, strftime try: True except: True = 1 False = 0 try: realpath = os.path.realpath except: realpath = lambda x:x OLDICONPATH = os.path.abspath(os.path.dirname(realpath(sys.argv[0]))) DIRNAME = '.'+product_name hexchars = '0123456789abcdef' hexmap = [] revmap = {} for i in xrange(256): x = hexchars[(i&0xF0)/16]+hexchars[i&0x0F] hexmap.append(x) revmap[x] = chr(i) def tohex(s): r = [] for c in s: r.append(hexmap[ord(c)]) return ''.join(r) def unhex(s): r = [ revmap[s[x:x+2]] for x in xrange(0, len(s), 2) ] return ''.join(r) def copyfile(oldpath, newpath): # simple file copy, all in RAM try: f = open(oldpath,'rb') r = f.read() success = True except: success = False try: f.close() except: pass if not success: return False try: f = open(newpath,'wb') f.write(r) except: success = False try: f.close() except: pass return success class ConfigDir: ###### INITIALIZATION TASKS ###### def __init__(self, dir_root): """ Modified by ACR, for Armory-specific download """ config_ext = '.armorydl' self.dir_root = dir_root if not os.path.isdir(self.dir_root): os.mkdir(self.dir_root, 0700) # exception if failed self.dir_icons = os.path.join(dir_root,'icons') if not os.path.isdir(self.dir_icons): os.mkdir(self.dir_icons) for icon in GetIcons(): i = os.path.join(self.dir_icons,icon) if not os.path.exists(i): if not copyfile(os.path.join(OLDICONPATH,icon),i): CreateIcon(icon,self.dir_icons) self.dir_torrentcache = os.path.join(dir_root,'torrentcache') if not os.path.isdir(self.dir_torrentcache): os.mkdir(self.dir_torrentcache) self.dir_datacache = os.path.join(dir_root,'datacache') if not os.path.isdir(self.dir_datacache): os.mkdir(self.dir_datacache) self.dir_piececache = os.path.join(dir_root,'piececache') if not os.path.isdir(self.dir_piececache): os.mkdir(self.dir_piececache) self.configfile = os.path.join(dir_root,'config'+config_ext+'.ini') self.statefile = os.path.join(dir_root,'state'+config_ext) self.TorrentDataBuffer = {} ###### CONFIG HANDLING ###### def setDefaults(self, defaults, ignore=[]): self.config = defaultargs(defaults) for k in ignore: if self.config.has_key(k): del self.config[k] def checkConfig(self): return os.path.exists(self.configfile) def loadConfig(self): try: r = ini_read(self.configfile)[''] except: return self.config l = self.config.keys() for k,v in r.items(): if self.config.has_key(k): t = type(self.config[k]) try: if t == StringType: self.config[k] = v elif t == IntType or t == LongType: self.config[k] = long(v) elif t == FloatType: self.config[k] = float(v) l.remove(k) except: pass if l: # new default values since last save self.saveConfig() return self.config def saveConfig(self, new_config = None): if new_config: for k,v in new_config.items(): if self.config.has_key(k): self.config[k] = v try: ini_write( self.configfile, self.config, 'Generated by '+product_name+'/'+version_short+'\n' + strftime('%x %X') ) return True except: return False def getConfig(self): return self.config ###### STATE HANDLING ###### def getState(self): try: f = open(self.statefile,'rb') r = f.read() except: r = None try: f.close() except: pass try: r = bdecode(r) except: r = None return r def saveState(self, state): try: f = open(self.statefile,'wb') f.write(bencode(state)) success = True except: success = False try: f.close() except: pass return success ###### TORRENT HANDLING ###### def getTorrents(self): d = {} for f in os.listdir(self.dir_torrentcache): f = os.path.basename(f) try: f, garbage = f.split('.') except: pass d[unhex(f)] = 1 return d.keys() def getTorrentVariations(self, t): t = tohex(t) d = [] for f in os.listdir(self.dir_torrentcache): f = os.path.basename(f) if f[:len(t)] == t: try: garbage, ver = f.split('.') except: ver = '0' d.append(int(ver)) d.sort() return d def getTorrent(self, t, v = -1): t = tohex(t) if v == -1: v = max(self.getTorrentVariations(t)) # potential exception if v: t += '.'+str(v) try: f = open(os.path.join(self.dir_torrentcache,t),'rb') r = bdecode(f.read()) except: r = None try: f.close() except: pass return r def writeTorrent(self, data, t, v = -1): t = tohex(t) if v == -1: try: v = max(self.getTorrentVariations(t))+1 except: v = 0 if v: t += '.'+str(v) try: f = open(os.path.join(self.dir_torrentcache,t),'wb') f.write(bencode(data)) except: v = None try: f.close() except: pass return v ###### TORRENT DATA HANDLING ###### def getTorrentData(self, t): if self.TorrentDataBuffer.has_key(t): return self.TorrentDataBuffer[t] t = os.path.join(self.dir_datacache,tohex(t)) if not os.path.exists(t): return None try: f = open(t,'rb') r = bdecode(f.read()) except: r = None try: f.close() except: pass self.TorrentDataBuffer[t] = r return r def writeTorrentData(self, t, data): self.TorrentDataBuffer[t] = data try: f = open(os.path.join(self.dir_datacache,tohex(t)),'wb') f.write(bencode(data)) success = True except: success = False try: f.close() except: pass if not success: self.deleteTorrentData(t) return success def deleteTorrentData(self, t): try: os.remove(os.path.join(self.dir_datacache,tohex(t))) except: pass def getPieceDir(self, t): return os.path.join(self.dir_piececache,tohex(t)) ###### EXPIRATION HANDLING ###### def deleteOldCacheData(self, days, still_active = [], delete_torrents = False): if not days: return exptime = time() - (days*24*3600) names = {} times = {} for f in os.listdir(self.dir_torrentcache): p = os.path.join(self.dir_torrentcache,f) f = os.path.basename(f) try: f, garbage = f.split('.') except: pass try: f = unhex(f) assert len(f) == 20 except: continue if delete_torrents: names.setdefault(f,[]).append(p) try: t = os.path.getmtime(p) except: t = time() times.setdefault(f,[]).append(t) for f in os.listdir(self.dir_datacache): p = os.path.join(self.dir_datacache,f) try: f = unhex(os.path.basename(f)) assert len(f) == 20 except: continue names.setdefault(f,[]).append(p) try: t = os.path.getmtime(p) except: t = time() times.setdefault(f,[]).append(t) for f in os.listdir(self.dir_piececache): p = os.path.join(self.dir_piececache,f) try: f = unhex(os.path.basename(f)) assert len(f) == 20 except: continue for f2 in os.listdir(p): p2 = os.path.join(p,f2) names.setdefault(f,[]).append(p2) try: t = os.path.getmtime(p2) except: t = time() times.setdefault(f,[]).append(t) names.setdefault(f,[]).append(p) for k,v in times.items(): if max(v) < exptime and not k in still_active: for f in names[k]: try: os.remove(f) except: try: os.removedirs(f) except: pass def deleteOldTorrents(self, days, still_active = []): self.deleteOldCacheData(days, still_active, True) ###### OTHER ###### def getIconDir(self): return self.dir_icons armory-0.92.3/qtdialogs.py0000644000000000000000000230552412414772654014204 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ import functools import shutil import socket import sys import time from zipfile import ZipFile, ZIP_DEFLATED from PyQt4.QtCore import * from PyQt4.QtGui import * from armoryengine.ALL import * from armorycolors import Colors, htmlColor from armorymodels import * import qrc_img_resources from qtdefines import * from armoryengine.PyBtcAddress import calcWalletIDFromRoot from announcefetch import DEFAULT_MIN_PRIORITY from ui.UpgradeDownloader import UpgradeDownloaderDialog from armoryengine.MultiSigUtils import calcLockboxID, createLockboxEntryStr,\ LBPREFIX, isBareLockbox, isP2SHLockbox from ui.MultiSigModels import LockboxDisplayModel, LockboxDisplayProxy,\ LOCKBOXCOLS from armoryengine.PyBtcWalletRecovery import RECOVERMODE NO_CHANGE = 'NoChange' MIN_PASSWD_WIDTH = lambda obj: tightSizeStr(obj, '*' * 16)[0] STRETCH = 'Stretch' CLICKED = 'clicked()' BACKUP_TYPE_135A = '1.35a' BACKUP_TYPE_135C = '1.35c' BACKUP_TYPE_0_TEXT = tr('Version 0 (from script, 9 lines)') BACKUP_TYPE_135a_TEXT = tr('Version 1.35a (5 lines Unencrypted)') BACKUP_TYPE_135a_SP_TEXT = tr('Version 1.35a (5 lines + SecurePrint\xe2\x84\xa2)') BACKUP_TYPE_135c_TEXT = tr('Version 1.35c (3 lines Unencrypted)') BACKUP_TYPE_135c_SP_TEXT = tr('Version 1.35c (3 lines + SecurePrint\xe2\x84\xa2)') MAX_QR_SIZE = 198 MAX_SATOSHIS = 2100000000000000 ################################################################################ class DlgUnlockWallet(ArmoryDialog): def __init__(self, wlt, parent=None, main=None, unlockMsg='Unlock Wallet', \ returnResult=False, returnPassphrase=False): super(DlgUnlockWallet, self).__init__(parent, main) self.wlt = wlt self.returnResult = returnResult self.returnPassphrase = returnPassphrase ##### Upper layout lblDescr = QLabel("Enter your passphrase to unlock this wallet") lblPasswd = QLabel("Passphrase:") self.edtPasswd = QLineEdit() self.edtPasswd.setEchoMode(QLineEdit.Password) self.edtPasswd.setMinimumWidth(MIN_PASSWD_WIDTH(self)) self.edtPasswd.setSizePolicy(QSizePolicy.Fixed, QSizePolicy.Expanding) self.btnAccept = QPushButton("Unlock") self.btnCancel = QPushButton("Cancel") self.connect(self.btnAccept, SIGNAL(CLICKED), self.acceptPassphrase) self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) buttonBox = QDialogButtonBox() buttonBox.addButton(self.btnAccept, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) layoutUpper = QGridLayout() layoutUpper.addWidget(lblDescr, 1, 0, 1, 2) layoutUpper.addWidget(lblPasswd, 2, 0, 1, 1) layoutUpper.addWidget(self.edtPasswd, 2, 1, 1, 1) self.frmUpper = QFrame() self.frmUpper.setLayout(layoutUpper) ##### Lower layout # Add scrambled keyboard (EN-US only) ttipScramble = self.main.createToolTipWidget(\ 'Using a visual keyboard to enter your passphrase ' 'protects you against simple keyloggers. Scrambling ' 'makes it difficult to use, but prevents even loggers ' 'that record mouse clicks.') self.createKeyButtons() self.rdoScrambleNone = QRadioButton('Regular Keyboard') self.rdoScrambleLite = QRadioButton('Scrambled (Simple)') self.rdoScrambleFull = QRadioButton('Scrambled (Dynamic)') btngrp = QButtonGroup(self) btngrp.addButton(self.rdoScrambleNone) btngrp.addButton(self.rdoScrambleLite) btngrp.addButton(self.rdoScrambleFull) btngrp.setExclusive(True) defaultScramble = self.main.getSettingOrSetDefault('ScrambleDefault', 0) if defaultScramble == 0: self.rdoScrambleNone.setChecked(True) elif defaultScramble == 1: self.rdoScrambleLite.setChecked(True) elif defaultScramble == 2: self.rdoScrambleFull.setChecked(True) self.connect(self.rdoScrambleNone, SIGNAL(CLICKED), self.changeScramble) self.connect(self.rdoScrambleLite, SIGNAL(CLICKED), self.changeScramble) self.connect(self.rdoScrambleFull, SIGNAL(CLICKED), self.changeScramble) btnRowFrm = makeHorizFrame([self.rdoScrambleNone, \ self.rdoScrambleLite, \ self.rdoScrambleFull, \ STRETCH]) self.layoutKeyboard = QGridLayout() self.frmKeyboard = QFrame() self.frmKeyboard.setLayout(self.layoutKeyboard) showOSD = self.main.getSettingOrSetDefault('KeybdOSD', False) self.layoutLower = QGridLayout() self.layoutLower.addWidget(btnRowFrm , 0, 0) self.layoutLower.addWidget(self.frmKeyboard , 1, 0) self.frmLower = QFrame() self.frmLower.setLayout(self.layoutLower) self.frmLower.setVisible(showOSD) ##### Expand button self.btnShowOSD = QPushButton('Show Keyboard >>>') self.btnShowOSD.setCheckable(True) self.btnShowOSD.setChecked(showOSD) if showOSD: self.toggleOSD() self.connect(self.btnShowOSD, SIGNAL('toggled(bool)'), self.toggleOSD) frmAccept = makeHorizFrame([self.btnShowOSD, ttipScramble, STRETCH, buttonBox]) ##### Complete Layout layout = QVBoxLayout() layout.addWidget(self.frmUpper) layout.addWidget(frmAccept) layout.addWidget(self.frmLower) self.setLayout(layout) self.setWindowTitle(unlockMsg + ' - ' + wlt.uniqueIDB58) # Add scrambled keyboard self.layout().setSizeConstraint(QLayout.SetFixedSize) self.changeScramble() self.redrawKeys() ############################################################################# def toggleOSD(self, *args): isChk = self.btnShowOSD.isChecked() self.main.settings.set('KeybdOSD', isChk) self.frmLower.setVisible(isChk) if isChk: self.btnShowOSD.setText('Hide Keyboard <<<') else: self.btnShowOSD.setText('Show Keyboard >>>') ############################################################################# def createKeyboardKeyButton(self, keyLow, keyUp, defRow, special=None): theBtn = LetterButton(keyLow, keyUp, defRow, special, self.edtPasswd, self) self.connect(theBtn, SIGNAL(CLICKED), theBtn.insertLetter) theBtn.setMaximumWidth(40) return theBtn ############################################################################# def redrawKeys(self): for btn in self.btnList: btn.setText(btn.upper if self.btnShift.isChecked() else btn.lower) self.btnShift.setText('SHIFT') self.btnSpace.setText('SPACE') self.btnDelete.setText('DEL') ############################################################################# def deleteKeyboard(self): for btn in self.btnList: btn.setParent(None) del btn self.btnList = [] self.btnShift.setParent(None) self.btnSpace.setParent(None) self.btnDelete.setParent(None) del self.btnShift del self.btnSpace del self.btnDelete del self.frmKeyboard del self.layoutKeyboard ############################################################################# def createKeyButtons(self): # TODO: Add some locale-agnostic method here, that could replace # the letter arrays with something more appropriate for non en-us self.letLower = r"`1234567890-=qwertyuiop[]\asdfghjkl;'zxcvbnm,./" self.letUpper = r'~!@#$%^&*()_+QWERTYUIOP{}|ASDFGHJKL:"ZXCVBNM<>?' self.letRows = r'11111111111112222222222222333333333334444444444' self.letPairs = zip(self.letLower, self.letUpper, self.letRows) self.btnList = [] for l, u, r in zip(self.letLower, self.letUpper, self.letRows): if l == '7': # Because QPushButtons interpret ampersands as special characters u = 2 * u if l.isdigit(): self.btnList.append(self.createKeyboardKeyButton('#' + l, u, int(r))) else: self.btnList.append(self.createKeyboardKeyButton(l, u, int(r))) # Add shift and space keys self.btnShift = self.createKeyboardKeyButton('', '', 5, 'shift') self.btnSpace = self.createKeyboardKeyButton(' ', ' ', 5, 'space') self.btnDelete = self.createKeyboardKeyButton(' ', ' ', 5, 'delete') self.btnShift.setCheckable(True) self.btnShift.setChecked(False) ############################################################################# def reshuffleKeys(self): if self.rdoScrambleFull.isChecked(): self.changeScramble() ############################################################################# def changeScramble(self): self.deleteKeyboard() self.frmKeyboard = QFrame() self.layoutKeyboard = QGridLayout() self.createKeyButtons() if self.rdoScrambleNone.isChecked(): opt = 0 prevRow = 1 col = 0 for btn in self.btnList: row = btn.defRow if not row == prevRow: col = 0 if row > 3 and col == 0: col += 1 prevRow = row self.layoutKeyboard.addWidget(btn, row, col) col += 1 self.layoutKeyboard.addWidget(self.btnShift, self.btnShift.defRow, 0, 1, 3) self.layoutKeyboard.addWidget(self.btnSpace, self.btnSpace.defRow, 4, 1, 5) self.layoutKeyboard.addWidget(self.btnDelete, self.btnDelete.defRow, 11, 1, 2) self.btnShift.setMaximumWidth(1000) self.btnSpace.setMaximumWidth(1000) self.btnDelete.setMaximumWidth(1000) elif self.rdoScrambleLite.isChecked(): opt = 1 nchar = len(self.btnList) rnd = SecureBinaryData().GenerateRandom(2 * nchar).toBinStr() newBtnList = [[self.btnList[i], rnd[2 * i:2 * (i + 1)]] for i in range(nchar)] newBtnList.sort(key=lambda x: x[1]) prevRow = 0 col = 0 for i, btn in enumerate(newBtnList): row = i / 12 if not row == prevRow: col = 0 prevRow = row self.layoutKeyboard.addWidget(btn[0], row, col) col += 1 self.layoutKeyboard.addWidget(self.btnShift, self.btnShift.defRow, 0, 1, 3) self.layoutKeyboard.addWidget(self.btnSpace, self.btnSpace.defRow, 4, 1, 5) self.layoutKeyboard.addWidget(self.btnDelete, self.btnDelete.defRow, 10, 1, 2) self.btnShift.setMaximumWidth(1000) self.btnSpace.setMaximumWidth(1000) self.btnDelete.setMaximumWidth(1000) elif self.rdoScrambleFull.isChecked(): opt = 2 extBtnList = self.btnList[:] extBtnList.extend([self.btnShift, self.btnSpace]) nchar = len(extBtnList) rnd = SecureBinaryData().GenerateRandom(2 * nchar).toBinStr() newBtnList = [[extBtnList[i], rnd[2 * i:2 * (i + 1)]] for i in range(nchar)] newBtnList.sort(key=lambda x: x[1]) prevRow = 0 col = 0 for i, btn in enumerate(newBtnList): row = i / 12 if not row == prevRow: col = 0 prevRow = row self.layoutKeyboard.addWidget(btn[0], row, col) col += 1 self.layoutKeyboard.addWidget(self.btnDelete, self.btnDelete.defRow - 1, 11, 1, 2) self.btnShift.setMaximumWidth(40) self.btnSpace.setMaximumWidth(40) self.btnDelete.setMaximumWidth(40) self.frmKeyboard.setLayout(self.layoutKeyboard) self.layoutLower.addWidget(self.frmKeyboard, 1, 0) self.main.settings.set('ScrambleDefault', opt) self.redrawKeys() ############################################################################# def acceptPassphrase(self): self.securePassphrase = SecureBinaryData(str(self.edtPasswd.text())) self.edtPasswd.setText('') if self.returnResult: self.accept() return try: if self.returnPassphrase == False: unlockProgress = DlgProgress(self, self.main, HBar=1, Title="Unlocking Wallet") unlockProgress.exec_(self.wlt.unlock, securePassphrase=self.securePassphrase) self.securePassphrase.destroy() else: if self.wlt.verifyPassphrase(self.securePassphrase) == False: raise PassphraseError self.accept() except PassphraseError: QMessageBox.critical(self, 'Invalid Passphrase', \ 'That passphrase is not correct!', QMessageBox.Ok) self.securePassphrase.destroy() self.edtPasswd.setText('') return ############################################################################# class LetterButton(QPushButton): def __init__(self, Low, Up, Row, Spec, edtTarget, parent): super(LetterButton, self).__init__('') self.lower = Low self.upper = Up self.defRow = Row self.special = Spec self.target = edtTarget self.parent = parent if self.special: super(LetterButton, self).setFont(GETFONT('Var', 8)) else: super(LetterButton, self).setFont(GETFONT('Fixed', 10)) if self.special == 'space': self.setText('SPACE') self.lower = ' ' self.upper = ' ' self.special = 5 elif self.special == 'shift': self.setText('SHIFT') self.special = 5 self.insertLetter = self.pressShift elif self.special == 'delete': self.setText('DEL') self.special = 5 self.insertLetter = self.pressBackspace def insertLetter(self): currPwd = str(self.parent.edtPasswd.text()) insChar = self.upper if self.parent.btnShift.isChecked() else self.lower if len(insChar) == 2 and insChar.startswith('#'): insChar = insChar[1] self.parent.edtPasswd.setText(currPwd + insChar) self.parent.reshuffleKeys() def pressShift(self): self.parent.redrawKeys() def pressBackspace(self): currPwd = str(self.parent.edtPasswd.text()) if len(currPwd) > 0: self.parent.edtPasswd.setText(currPwd[:-1]) self.parent.redrawKeys() ################################################################################ class DlgGenericGetPassword(ArmoryDialog): def __init__(self, descriptionStr, parent=None, main=None): super(DlgGenericGetPassword, self).__init__(parent, main) lblDescr = QRichLabel(descriptionStr) lblPasswd = QRichLabel("Password:") self.edtPasswd = QLineEdit() self.edtPasswd.setEchoMode(QLineEdit.Password) self.edtPasswd.setMinimumWidth(MIN_PASSWD_WIDTH(self)) self.edtPasswd.setSizePolicy(QSizePolicy.Fixed, QSizePolicy.Expanding) self.btnAccept = QPushButton("OK") self.btnCancel = QPushButton("Cancel") self.connect(self.btnAccept, SIGNAL(CLICKED), self.accept) self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) buttonBox = QDialogButtonBox() buttonBox.addButton(self.btnAccept, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) layout = QGridLayout() layout.addWidget(lblDescr, 1, 0, 1, 2) layout.addWidget(lblPasswd, 2, 0, 1, 1) layout.addWidget(self.edtPasswd, 2, 1, 1, 1) layout.addWidget(buttonBox, 3, 1, 1, 2) self.setLayout(layout) self.setWindowTitle('Enter Password') self.setWindowIcon(QIcon(self.main.iconfile)) ################################################################################ class DlgBugReport(ArmoryDialog): def __init__(self, parent=None, main=None): super(DlgBugReport, self).__init__(parent, main) tsPage = 'https://bitcoinarmory.com/troubleshooting' faqPage = 'https://bitcoinarmory.com/faqs' lblDescr = QRichLabel(tr(""" Send a bug report to the Armory team

If you are having difficulties with Armory, you should first visit our troubleshooting page and our FAQ page which describe solutions to many common problems.

If you do not find the answer to your problem on those pages, please describe it in detail below, and any steps taken to reproduce the problem. The more information you provide, the more likely we will be able to help you.

Note: Please keep in mind we are a small open-source company, and do not have a formal customer support department. We will do our best to help you, but cannot respond to everyone!""") % (tsPage, faqPage, htmlColor('TextBlue'))) self.chkNoLog = QCheckBox('Do not send log file with report') self.chkNoLog.setChecked(False) self.btnMoreInfo = QLabelButton('Privacy Info') self.connect(self.btnMoreInfo, SIGNAL(CLICKED), \ self.main.logFilePrivacyWarning) self.noLogWarn = QRichLabel(tr(""" You are unlikely to get a response unless you provide a log file and a reasonable description with your support request.""") % htmlColor('TextWarn')) self.noLogWarn.setVisible(False) self.connect(self.chkNoLog, SIGNAL('toggled(bool)'), \ self.noLogWarn.setVisible) self.lblEmail = QRichLabel(tr('Email Address:')) self.edtEmail = QLineEdit() self.edtEmail.setMaxLength(100) self.lblSubject = QRichLabel(tr('Subject:')) self.edtSubject = QLineEdit() self.edtSubject.setMaxLength(64) self.edtSubject.setText("Bug Report") self.txtDescr = QTextEdit() self.txtDescr.setFont(GETFONT('Fixed', 9)) w,h = tightSizeNChar(self, 80) self.txtDescr.setMinimumWidth(w) self.txtDescr.setMinimumHeight(4*h) self.lblOS = QRichLabel(tr(""" Note: if you are using this computer to report an Armory problem on another computer, please include the operating system of the other computer and the version of Armory it is running.""")) self.btnSubmit = QPushButton(tr('Submit Report')) self.btnCancel = QPushButton(tr('Cancel')) self.btnbox = QDialogButtonBox() self.btnbox.addButton(self.btnSubmit, QDialogButtonBox.AcceptRole) self.btnbox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) self.connect(self.btnSubmit, SIGNAL(CLICKED), self.submitReport) self.connect(self.btnCancel, SIGNAL(CLICKED), self, SLOT('reject()')) armoryver = getVersionString(BTCARMORY_VERSION) lblDetect = QRichLabel( tr(""" Detected: %s (%s) / %0.2f GB RAM / Armory version %s
(this data will be submitted automatically with the report)""") % \ (OS_NAME, OS_VARIANT[0], SystemSpecs.Memory, armoryver)) layout = QGridLayout() i = -1 i += 1 layout.addWidget(lblDescr, i,0, 1,2) i += 1 layout.addWidget(HLINE(), i,0, 1,2) i += 1 layout.addWidget(lblDetect, i,0, 1,2) i += 1 layout.addWidget(HLINE(), i,0, 1,2) i += 1 layout.addWidget(self.lblEmail, i,0, 1,1) layout.addWidget(self.edtEmail, i,1, 1,1) i += 1 layout.addWidget(self.lblSubject, i,0, 1,1) layout.addWidget(self.edtSubject, i,1, 1,1) i += 1 layout.addWidget(QLabel(tr("Description of problem:")), i,0, 1,2) i += 1 layout.addWidget(self.txtDescr, i,0, 1,2) i += 1 frmchkbtn = makeHorizFrame([self.chkNoLog, self.btnMoreInfo, 'Stretch']) layout.addWidget(frmchkbtn, i,0, 1,2) i += 1 layout.addWidget(self.noLogWarn, i,0, 1,2) i += 1 layout.addWidget(self.btnbox, i,0, 1,2) self.setLayout(layout) self.setWindowTitle(tr('Submit a Bug Report')) self.setWindowIcon(QIcon(self.main.iconfile)) ############################################################################# def submitReport(self): if self.main.getUserAgreeToPrivacy(True): self.userAgreedToPrivacyPolicy = True else: return emailAddr = unicode(self.edtEmail.text()).strip() emailLen = lenBytes(emailAddr) subjectText = unicode(self.edtSubject.text()).strip() subjectLen = lenBytes(subjectText) description = unicode(self.txtDescr.toPlainText()).strip() descrLen = lenBytes(description) if emailLen == 0 or not '@' in emailAddr: reply = MsgBoxCustom(MSGBOX.Warning, tr('Missing Email'), tr(""" You must supply a valid email address so we can follow up on your request."""), \ noStr=tr('Go Back'), yesStr=tr('Submit without Email')) if not reply: return else: emailAddr = '' if descrLen < 10: QMessageBox.warning(self, tr('Empty Description'), tr(""" You must describe what problem you are having, and any steps to reproduce the problem. The Armory team cannot look for problems in the log file if it doesn't know what those problems are!."""), QMessageBox.Ok) return maxDescr = 16384 if descrLen > maxDescr: reply = MsgBoxCustom(MSGBOX.Warning, tr('Long Description'), tr(""" You have exceeded the maximum size of the description that can be submitted to our ticket system, which is %d bytes. If you click "Continue", the last %d bytes of your description will be removed before sending.""") % (maxDescr, descrLen-maxDescr), \ noStr=tr('Go Back'), yesStr=tr('Continue')) if not reply: return else: description = unicode_truncate(description, maxDescr) # This is a unique-but-not-traceable ID, to simply match users to log files uniqID = binary_to_base58(hash256(USER_HOME_DIR)[:4]) dateStr = unixTimeToFormatStr(RightNow(), '%Y%m%d_%H%M') osvariant = OS_VARIANT[0] if OS_MACOSX else '-'.join(OS_VARIANT) reportMap = {} reportMap['uniqID'] = uniqID reportMap['OSmajor'] = OS_NAME reportMap['OSvariant'] = osvariant reportMap['ArmoryVer'] = getVersionString(BTCARMORY_VERSION) reportMap['TotalRAM'] = '%0.2f' % SystemSpecs.Memory reportMap['isAmd64'] = str(SystemSpecs.IsX64).lower() reportMap['userEmail'] = emailAddr reportMap['userSubject'] = subjectText reportMap['userDescr'] = description reportMap['userTime'] = unixTimeToFormatStr(RightNow()) reportMap['userTimeUTC'] = unixTimeToFormatStr(RightNowUTC()) reportMap['agreedPrivacy'] = str(self.userAgreedToPrivacyPolicy) combinedLogName = 'armory_log_%s_%s.txt' % (uniqID, dateStr) combinedLogPath = os.path.join(ARMORY_HOME_DIR, combinedLogName) self.main.saveCombinedLogFile(combinedLogPath) if self.chkNoLog.isChecked(): reportMap['fileLog'] = '' else: with open(combinedLogPath, 'r') as f: reportMap['fileLog'] = f.read() LOGDEBUG('Sending the following dictionary of values to server') for key,val in reportMap.iteritems(): if key=='fileLog': LOGDEBUG(key.ljust(12) + ': ' + binary_to_hex(sha256(val))) else: LOGDEBUG(key.ljust(12) + ': ' + val) expectedResponseMap = {} expectedResponseMap['logHash'] = binary_to_hex(sha256(reportMap['fileLog'])) try: import urllib3 http = urllib3.PoolManager() headers = urllib3.make_headers('ArmoryBugReportWindowNotABrowser') response = http.request('POST', BUG_REPORT_URL, reportMap, headers) responseMap = ast.literal_eval(response._body) LOGINFO('-'*50) LOGINFO('Response JSON:') for key,val in responseMap.iteritems(): LOGINFO(key.ljust(12) + ': ' + str(val)) LOGINFO('-'*50) LOGINFO('Expected JSON:') for key,val in expectedResponseMap.iteritems(): LOGINFO(key.ljust(12) + ': ' + str(val)) LOGDEBUG('Connection info:') LOGDEBUG(' status: ' + str(response.status)) LOGDEBUG(' version: ' + str(response.version)) LOGDEBUG(' reason: ' + str(response.reason)) LOGDEBUG(' strict: ' + str(response.strict)) if responseMap==expectedResponseMap: LOGINFO('Server verified receipt of log file') cemail = 'contact@bitcoinarmory.com' QMessageBox.information(self, tr('Submitted!'), tr(""" Your report was submitted successfully!

You should receive and email shortly from our support system. If you do not receive it, you should follow up your request with an email to %s. If you do, please attach the following file to your email:

%s

Please be aware that the team receives lots of reports, so it may take a few days for the team to get back to you.""") % (cemail, cemail, combinedLogPath), QMessageBox.Ok) self.accept() else: raise ConnectionError('Failed to send bug report') except: LOGEXCEPT('Failed:') bugpage = 'https://bitcoinarmory.com/support/' QMessageBox.information(self, tr('Submitted!'), tr(""" There was a problem submitting your bug report. It is recommended that you submit this information through our webpage instead:

%s""") % (bugpage, bugpage), QMessageBox.Ok) self.reject() ################################################################################ # Hack! We need to replicate the DlgBugReport... but to be as safe as # possible for 0.91.1, we simply duplicate the dialog and modify directly. # TODO: There's definitely a way to make DlgBugReport more generic so that # both these contexts can be handled by it. class DlgInconsistentWltReport(ArmoryDialog): def __init__(self, parent, main, logPathList): super(DlgInconsistentWltReport, self).__init__(parent, main) QMessageBox.critical(self, tr('Inconsistent Wallet!'), tr(""" Important: Wallet Consistency Issues Detected!

Armory now detects certain kinds of hardware errors, and one or more of your wallets was flagged. The consistency logs need to be analyzed by the Armory team to determine if any further action is required.

This warning will pop up every time you start Armory until the wallet is fixed""") % (htmlColor('TextWarn')), QMessageBox.Ok) # logPathList is [wltID, corruptFolder] pairs self.logPathList = logPathList[:] walletList = [self.main.walletMap[wid] for wid,folder in logPathList] getWltStr = lambda w: 'Wallet "%s" (%s)' % \ (w.labelName, w.uniqueIDB58) if len(logPathList) == 1: wltDispStr = getWltStr(walletList[0]) + ' is' else: strList = [getWltStr(w) for w in walletList] wltDispStr = ', '.join(strList[:-1]) + ' and ' + strList[-1] + ' are ' lblTopDescr = QRichLabel(tr(""" Submit Wallet Analysis Logs for Review
""") % htmlColor('TextWarn'), hAlign=Qt.AlignHCenter) lblDescr = QRichLabel(tr(""" Armory has detected that %s inconsistent, possibly due to hardware errors out of our control. It strongly recommended you submit the wallet logs to the Armory team for review. Until you hear back from an Armory representative, we recommend:
  • Do not delete any data in your Armory home directory
  • Do not send or receive any funds with the affected wallet(s)
  • Create a backup of the wallet analysis logs
""") % (wltDispStr)) self.chkIncludeReg = QCheckBox(tr("""Include all log files""")) self.chkIncludeWOW = QCheckBox(tr("""Include watch-only @{wallet|wallets}@""", pluralList=len(walletList))) self.chkIncludeWOW.setChecked(False) self.chkIncludeReg.setChecked(True) self.btnMoreInfo = QLabelButton('Privacy Warning') self.connect(self.btnMoreInfo, SIGNAL(CLICKED), \ self.main.logFileTriplePrivacyWarning) btnBackupLogs = QPushButton(tr("Save backup of log files")) self.connect(btnBackupLogs, SIGNAL('clicked()'), self.doBackupLogs) frmBackup = makeHorizFrame(['Stretch', btnBackupLogs, 'Stretch']) self.lblEmail = QRichLabel(tr('Email Address:')) self.edtEmail = QLineEdit() self.edtEmail.setMaxLength(100) self.lblSubject = QRichLabel(tr('Subject:')) self.edtSubject = QLineEdit() self.edtSubject.setMaxLength(64) self.edtSubject.setText("Wallet Consistency Logs") self.txtDescr = QTextEdit() self.txtDescr.setFont(GETFONT('Fixed', 9)) w,h = tightSizeNChar(self, 80) self.txtDescr.setMinimumWidth(w) self.txtDescr.setMinimumHeight(int(2.5*h)) self.btnSubmit = QPushButton(tr('Submit Data to ATI')) self.btnCancel = QPushButton(tr('Cancel')) self.btnbox = QDialogButtonBox() self.btnbox.addButton(self.btnSubmit, QDialogButtonBox.AcceptRole) self.btnbox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) self.connect(self.btnSubmit, SIGNAL(CLICKED), self.submitReport) self.connect(self.btnCancel, SIGNAL(CLICKED), self, SLOT('reject()')) armoryver = getVersionString(BTCARMORY_VERSION) lblDetect = QRichLabel( tr(""" Detected: %s (%s) / %0.2f GB RAM / Armory version %s
(this data will be included with the data submission""") % \ (OS_NAME, OS_VARIANT[0], SystemSpecs.Memory, armoryver)) layout = QGridLayout() i = -1 i += 1 layout.addWidget(lblTopDescr, i,0, 1,2) i += 1 layout.addWidget(lblDescr, i,0, 1,2) i += 1 layout.addWidget(frmBackup, i,0, 1,2) i += 1 layout.addWidget(HLINE(), i,0, 1,2) i += 1 layout.addWidget(self.lblEmail, i,0, 1,1) layout.addWidget(self.edtEmail, i,1, 1,1) i += 1 layout.addWidget(self.lblSubject, i,0, 1,1) layout.addWidget(self.edtSubject, i,1, 1,1) i += 1 layout.addWidget(QLabel(tr("Additional Info:")), i,0, 1,2) i += 1 layout.addWidget(self.txtDescr, i,0, 1,2) i += 1 frmChkBtnRL = makeHorizFrame([self.chkIncludeReg, self.chkIncludeWOW, self.btnMoreInfo,]) layout.addWidget(frmChkBtnRL, i,0, 1,2) i += 1 layout.addWidget(self.btnbox, i,0, 1,2) self.setLayout(layout) self.setWindowTitle(tr('Send Wallet Logs to ATI')) self.setWindowIcon(QIcon(self.main.iconfile)) ############################################################################# def submitReport(self): self.userAgreedToPrivacyPolicy = False if self.main.getUserAgreeToPrivacy(True): self.userAgreedToPrivacyPolicy = True else: return emailAddr = unicode(self.edtEmail.text()).strip() emailLen = lenBytes(emailAddr) subjectText = unicode(self.edtSubject.text()).strip() subjectLen = lenBytes(subjectText) description = unicode(self.txtDescr.toPlainText()).strip() descrLen = lenBytes(description) if emailLen == 0 or not '@' in emailAddr: QMessageBox.warning(self, tr('Missing Email'), tr(""" You must supply a valid email address so we can follow up on your submission."""), QMessageBox.Ok) return maxDescr = 16384 if descrLen > maxDescr: reply = MsgBoxCustom(MSGBOX.Warning, tr('Long Description'), tr(""" You have exceeded the maximum size of the description that can be submitted to our ticket system, which is %d bytes. If you click "Continue", the last %d bytes of your description will be removed before sending.""") % (maxDescr, descrLen-maxDescr), \ noStr=tr('Go Back'), yesStr=tr('Continue')) if not reply: return else: description = unicode_truncate(description, maxDescr) # This is a unique-but-not-traceable ID, to simply match users to log files uniqID = binary_to_base58(hash256(USER_HOME_DIR)[:4]) dateStr = unixTimeToFormatStr(RightNow(), '%Y%m%d_%H%M') osvariant = OS_VARIANT[0] if OS_MACOSX else '-'.join(OS_VARIANT) reportMap = {} reportMap['uniqID'] = uniqID reportMap['OSmajor'] = OS_NAME reportMap['OSvariant'] = osvariant reportMap['ArmoryVer'] = getVersionString(BTCARMORY_VERSION) reportMap['TotalRAM'] = '%0.2f' % SystemSpecs.Memory reportMap['isAmd64'] = str(SystemSpecs.IsX64).lower() reportMap['userEmail'] = emailAddr reportMap['userSubject'] = subjectText reportMap['userDescr'] = description reportMap['userTime'] = unixTimeToFormatStr(RightNow()) reportMap['userTimeUTC'] = unixTimeToFormatStr(RightNowUTC()) reportMap['agreedPrivacy'] = str(self.userAgreedToPrivacyPolicy) fileUploadKey = 'fileWalletLogs' # Create a zip file of all logs (for all dirs), and put raw into map zpath = self.createZipfile() with open(zpath, 'rb') as f: reportMap[fileUploadKey] = f.read() LOGDEBUG('Sending the following dictionary of values to server') for key,val in reportMap.iteritems(): if key==fileUploadKey: LOGDEBUG(key.ljust(12) + ': ' + binary_to_hex(sha256(val))) else: LOGDEBUG(key.ljust(12) + ': ' + val) expectedResponseMap = {} with open(zpath, 'rb') as f: expectedResponseMap['fileWalletLogsHash'] = \ binary_to_hex(sha256(f.read())) try: import urllib3 http = urllib3.PoolManager() headers = urllib3.make_headers('ArmoryBugReportWindowNotABrowser') response = http.request('POST', BUG_REPORT_URL, reportMap, headers) responseMap = ast.literal_eval(response._body) LOGINFO('-'*50) LOGINFO('Response JSON:') for key,val in responseMap.iteritems(): LOGINFO(key.ljust(12) + ': ' + str(val)) LOGINFO('-'*50) LOGINFO('Expected JSON:') for key,val in expectedResponseMap.iteritems(): LOGINFO(key.ljust(12) + ': ' + str(val)) LOGDEBUG('Connection info:') LOGDEBUG(' status: ' + str(response.status)) LOGDEBUG(' version: ' + str(response.version)) LOGDEBUG(' reason: ' + str(response.reason)) LOGDEBUG(' strict: ' + str(response.strict)) if responseMap==expectedResponseMap: LOGINFO('Server verified receipt of log file') cemail = 'contact@bitcoinarmory.com' QMessageBox.information(self, tr('Submitted!'), tr(""" Your report was submitted successfully!

You should receive and email shortly from our support system. If you do not receive it, you should follow up your request with an email to %s. You should hear back from an Armory representative within 24 hours.""") % (cemail, cemail), QMessageBox.Ok) self.accept() else: raise ConnectionError('Failed to send bug report') except: LOGEXCEPT('Failed:') bugpage = 'https://bitcoinarmory.com/support/' QMessageBox.information(self, tr('Submission Error!'), tr(""" There was a problem submitting your data through Armory. Please create a new support ticket using our webpage, and attach the following file to it:

%s

Click below to go to the support page to open a new ticket.

%s""") % (zpath, bugpage, bugpage), QMessageBox.Ok) try: strOut = 'Raw response from server:\n' strOut += response.text LOGINFO(strOut) except: # Get here if response._body doesn't exist... never got that far pass self.reject() ############################################################################# def createZipfile(self, zfilePath=None, forceIncludeAllData=False): """ If not forceIncludeAllData, then we will exclude wallet file and/or regular logs, depending on the user's checkbox selection. For making a user backup, we always want to include everything, regardless of that selection. """ # Should we include wallet files from logs directory? includeWlt = self.chkIncludeWOW.isChecked() includeReg = self.chkIncludeReg.isChecked() # Set to default save path if needed if zfilePath is None: zfilePath = os.path.join(ARMORY_HOME_DIR, 'wallet_analyze_logs.zip') # Remove a previous copy if os.path.exists(zfilePath): os.remove(zfilePath) LOGINFO('Creating archive: %s', zfilePath) zfile = ZipFile(zfilePath, 'w', ZIP_DEFLATED) # Iterate over all log directories (usually one) for wltID,logDir in self.logPathList: for fn in os.listdir(logDir): fullpath = os.path.join(logDir, fn) # If multiple dirs, will see duplicate armorylogs and multipliers if not os.path.isfile(fullpath): continue if not forceIncludeAllData: # Exclude any wallet files if the checkbox was not checked if not includeWlt and os.path.getsize(fullpath) >= 8: # Don't exclude based on file extension, check leading bytes with open(fullpath, 'rb') as tempopen: if tempopen.read(8) == '\xbaWALLET\x00': continue # Exclude regular logs as well, if desired if not includeReg and fn in ['armorylog.txt', 'armorycpplog.txt']: continue # If we got here, add file to archive parentDir = os.path.basename(logDir) archiveName = '%s_%s_%s' % (wltID, parentDir, fn) LOGINFO(' Adding %s to archive' % archiveName) zfile.write(fullpath, archiveName) zfile.close() return zfilePath ############################################################################# def doBackupLogs(self): saveTo = self.main.getFileSave(ffilter=['Zip files (*.zip)'], defaultFilename='wallet_analyze_logs.zip') if not saveTo: QMessageBox.critical(self, tr("Not saved"), tr(""" You canceled the backup operation. No backup was made."""), QMessageBox.Ok) return try: self.createZipfile(saveTo, forceIncludeAllData=True) QMessageBox.information(self, tr('Success'), tr(""" The wallet logs were successfully saved to the following location:

%s

It is still important to complete the rest of this form and submit the data to the Armory team for review!""") % \ saveTo, QMessageBox.Ok) except: LOGEXCEPT('Failed to create zip file') QMessageBox.warning(self, tr('Save Failed'), tr("""There was an error saving a copy of your log files"""), QMessageBox.Ok) ################################################################################ class DlgNewWallet(ArmoryDialog): def __init__(self, parent=None, main=None, initLabel=''): super(DlgNewWallet, self).__init__(parent, main) self.selectedImport = False # Options for creating a new wallet lblDlgDescr = QRichLabel(tr(""" Create a new wallet for managing your funds.
The name and description can be changed at any time.""")) lblDlgDescr.setWordWrap(True) self.edtName = QLineEdit() self.edtName.setMaxLength(32) self.edtName.setText(initLabel) lblName = QLabel("Wallet &name:") lblName.setBuddy(self.edtName) self.edtDescr = QTextEdit() self.edtDescr.setMaximumHeight(75) lblDescr = QLabel("Wallet &description:") lblDescr.setAlignment(Qt.AlignVCenter) lblDescr.setBuddy(self.edtDescr) buttonBox = QDialogButtonBox(QDialogButtonBox.Ok | \ QDialogButtonBox.Cancel) # Advanced Encryption Options lblComputeDescr = QLabel(\ 'Armory will test your system\'s speed to determine the most ' 'challenging encryption settings that can be performed ' 'in a given amount of time. High settings make it much harder ' 'for someone to guess your passphrase. This is used for all ' 'encrypted wallets, but the default parameters can be changed below.\n') lblComputeDescr.setWordWrap(True) timeDescrTip = self.main.createToolTipWidget(\ 'This is the amount of time it will take for your computer ' 'to unlock your wallet after you enter your passphrase. ' '(the actual time used will be less than the specified ' 'time, but more than one half of it). ') # Set maximum compute time self.edtComputeTime = QLineEdit() self.edtComputeTime.setText('250 ms') self.edtComputeTime.setMaxLength(12) lblComputeTime = QLabel('Target compute &time (s, ms):') memDescrTip = self.main.createToolTipWidget(\ 'This is the maximum memory that will be ' 'used as part of the encryption process. The actual value used ' 'may be lower, depending on your system\'s speed. If a ' 'low value is chosen, Armory will compensate by chaining ' 'together more calculations to meet the target time. High ' 'memory target will make GPU-acceleration useless for ' 'guessing your passphrase.') lblComputeTime.setBuddy(self.edtComputeTime) # Set maximum memory usage self.edtComputeMem = QLineEdit() self.edtComputeMem.setText('32.0 MB') self.edtComputeMem.setMaxLength(12) lblComputeMem = QLabel('Max &memory usage (kB, MB):') lblComputeMem.setBuddy(self.edtComputeMem) self.edtComputeTime.setMaximumWidth(tightSizeNChar(self, 20)[0]) self.edtComputeMem.setMaximumWidth(tightSizeNChar(self, 20)[0]) # Fork watching-only wallet cryptoLayout = QGridLayout() cryptoLayout.addWidget(lblComputeDescr, 0, 0, 1, 3) cryptoLayout.addWidget(timeDescrTip, 1, 0, 1, 1) cryptoLayout.addWidget(lblComputeTime, 1, 1, 1, 1) cryptoLayout.addWidget(self.edtComputeTime, 1, 2, 1, 1) cryptoLayout.addWidget(memDescrTip, 2, 0, 1, 1) cryptoLayout.addWidget(lblComputeMem, 2, 1, 1, 1) cryptoLayout.addWidget(self.edtComputeMem, 2, 2, 1, 1) self.cryptoFrame = QFrame() self.cryptoFrame.setFrameStyle(STYLE_SUNKEN) self.cryptoFrame.setLayout(cryptoLayout) self.cryptoFrame.setVisible(False) self.chkUseCrypto = QCheckBox("Use wallet &encryption") self.chkUseCrypto.setChecked(True) usecryptoTooltip = self.main.createToolTipWidget( 'Encryption prevents anyone who accesses your computer ' 'or wallet file from being able to spend your money, as ' 'long as they do not have the passphrase.' 'You can choose to encrypt your wallet at a later time ' 'through the wallet properties dialog by double clicking ' 'the wallet on the dashboard.') # For a new wallet, the user may want to print out a paper backup self.chkPrintPaper = QCheckBox("Print a paper-backup of this wallet") self.chkPrintPaper.setChecked(True) paperBackupTooltip = self.main.createToolTipWidget( 'A paper-backup allows you to recover your wallet/funds even ' 'if you lose your original wallet file, any time in the future. ' 'Because Armory uses "deterministic wallets," ' 'a single backup when the wallet is first made is sufficient ' 'for all future transactions (except ones to imported ' 'addresses).\n\n' 'Anyone who gets ahold of your paper backup will be able to spend ' 'the money in your wallet, so please secure it appropriately.') self.btnAccept = QPushButton("Accept") self.btnCancel = QPushButton("Cancel") self.btnAdvCrypto = QPushButton("Adv. Encrypt Options>>>") self.btnAdvCrypto.setCheckable(True) self.btnbox = QDialogButtonBox() self.btnbox.addButton(self.btnAdvCrypto, QDialogButtonBox.ActionRole) self.btnbox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) self.btnbox.addButton(self.btnAccept, QDialogButtonBox.AcceptRole) self.connect(self.btnAdvCrypto, SIGNAL('toggled(bool)'), \ self.cryptoFrame, SLOT('setVisible(bool)')) self.connect(self.btnAccept, SIGNAL(CLICKED), \ self.verifyInputsBeforeAccept) self.connect(self.btnCancel, SIGNAL(CLICKED), \ self, SLOT('reject()')) self.btnImportWlt = QPushButton("Import wallet...") self.connect(self.btnImportWlt, SIGNAL("clicked()"), \ self.importButtonClicked) masterLayout = QGridLayout() masterLayout.addWidget(lblDlgDescr, 1, 0, 1, 2) # masterLayout.addWidget(self.btnImportWlt, 1, 2, 1, 1) masterLayout.addWidget(lblName, 2, 0, 1, 1) masterLayout.addWidget(self.edtName, 2, 1, 1, 2) masterLayout.addWidget(lblDescr, 3, 0, 1, 2) masterLayout.addWidget(self.edtDescr, 3, 1, 2, 2) masterLayout.addWidget(self.chkUseCrypto, 5, 0, 1, 1) masterLayout.addWidget(usecryptoTooltip, 5, 1, 1, 1) masterLayout.addWidget(self.chkPrintPaper, 6, 0, 1, 1) masterLayout.addWidget(paperBackupTooltip, 6, 1, 1, 1) masterLayout.addWidget(self.cryptoFrame, 8, 0, 3, 3) masterLayout.addWidget(self.btnbox, 11, 0, 1, 2) masterLayout.setVerticalSpacing(5) self.setLayout(masterLayout) self.layout().setSizeConstraint(QLayout.SetFixedSize) self.connect(self.chkUseCrypto, SIGNAL("clicked()"), \ self.cryptoFrame, SLOT("setEnabled(bool)")) self.setWindowTitle('Create Armory wallet') self.setWindowIcon(QIcon(self.main.iconfile)) def importButtonClicked(self): self.selectedImport = True self.accept() def verifyInputsBeforeAccept(self): ### Confirm that the name and descr are within size limits ####### wltName = self.edtName.text() wltDescr = self.edtDescr.toPlainText() if len(wltName) < 1: QMessageBox.warning(self, 'Invalid wallet name', \ 'You must enter a name for this wallet, up to 32 characters.', \ QMessageBox.Ok) return False if len(wltDescr) > 256: reply = QMessageBox.warning(self, 'Input too long', \ 'The wallet description is limited to 256 characters. Only the first ' '256 characters will be used.', \ QMessageBox.Ok | QMessageBox.Cancel) if reply == QMessageBox.Ok: self.edtDescr.setText(wltDescr[:256]) else: return False ### Check that the KDF inputs are well-formed #################### try: kdfT, kdfUnit = str(self.edtComputeTime.text()).strip().split(' ') if kdfUnit.lower() == 'ms': self.kdfSec = float(kdfT) / 1000. elif kdfUnit.lower() in ('s', 'sec', 'seconds'): self.kdfSec = float(kdfT) if not (self.kdfSec <= 20.0): QMessageBox.critical(self, 'Invalid KDF Parameters', \ 'Please specify a compute time no more than 20 seconds. ' 'Values above one second are usually unnecessary.') return False kdfM, kdfUnit = str(self.edtComputeMem.text()).split(' ') if kdfUnit.lower() == 'mb': self.kdfBytes = round(float(kdfM) * (1024.0 ** 2)) if kdfUnit.lower() == 'kb': self.kdfBytes = round(float(kdfM) * (1024.0)) if not (2 ** 15 <= self.kdfBytes <= 2 ** 31): QMessageBox.critical(self, 'Invalid KDF Parameters', \ 'Please specify a maximum memory usage between 32 kB ' 'and 2048 MB.') return False LOGINFO('KDF takes %0.2f seconds and %d bytes', self.kdfSec, self.kdfBytes) except: QMessageBox.critical(self, 'Invalid Input', \ 'Please specify time with units, such as ' '"250 ms" or "2.1 s". Specify memory as kB or MB, such as ' '"32 MB" or "256 kB". ', QMessageBox.Ok) return False self.accept() def getImportWltPath(self): self.importFile = QFileDialog.getOpenFileName(self, 'Import Wallet File', \ ARMORY_HOME_DIR, 'Wallet files (*.wallet);; All files (*)') if self.importFile: self.accept() ################################################################################ class DlgChangePassphrase(ArmoryDialog): def __init__(self, parent=None, main=None, noPrevEncrypt=True): super(DlgChangePassphrase, self).__init__(parent, main) layout = QGridLayout() if noPrevEncrypt: lblDlgDescr = QLabel('Please enter an passphrase for wallet encryption.\n\n' 'A good passphrase consists of at least 8 or more\n' 'random letters, or 5 or more random words.\n') lblDlgDescr.setWordWrap(True) layout.addWidget(lblDlgDescr, 0, 0, 1, 2) else: lblDlgDescr = QLabel("Change your wallet encryption passphrase") layout.addWidget(lblDlgDescr, 0, 0, 1, 2) self.edtPasswdOrig = QLineEdit() self.edtPasswdOrig.setEchoMode(QLineEdit.Password) self.edtPasswdOrig.setMinimumWidth(MIN_PASSWD_WIDTH(self)) lblCurrPasswd = QLabel('Current Passphrase:') layout.addWidget(lblCurrPasswd, 1, 0) layout.addWidget(self.edtPasswdOrig, 1, 1) lblPwd1 = QLabel("New Passphrase:") self.edtPasswd1 = QLineEdit() self.edtPasswd1.setEchoMode(QLineEdit.Password) self.edtPasswd1.setMinimumWidth(MIN_PASSWD_WIDTH(self)) lblPwd2 = QLabel("Again:") self.edtPasswd2 = QLineEdit() self.edtPasswd2.setEchoMode(QLineEdit.Password) self.edtPasswd2.setMinimumWidth(MIN_PASSWD_WIDTH(self)) layout.addWidget(lblPwd1, 2, 0) layout.addWidget(lblPwd2, 3, 0) layout.addWidget(self.edtPasswd1, 2, 1) layout.addWidget(self.edtPasswd2, 3, 1) self.lblMatches = QLabel(' ' * 20) self.lblMatches.setTextFormat(Qt.RichText) layout.addWidget(self.lblMatches, 4, 1) self.chkDisableCrypt = QCheckBox('Disable encryption for this wallet') if not noPrevEncrypt: self.connect(self.chkDisableCrypt, SIGNAL('toggled(bool)'), \ self.disablePassphraseBoxes) layout.addWidget(self.chkDisableCrypt, 4, 0) self.btnAccept = QPushButton("Accept") self.btnCancel = QPushButton("Cancel") buttonBox = QDialogButtonBox() buttonBox.addButton(self.btnAccept, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) layout.addWidget(buttonBox, 5, 0, 1, 2) if noPrevEncrypt: self.setWindowTitle("Set Encryption Passphrase") else: self.setWindowTitle("Change Encryption Passphrase") self.setWindowIcon(QIcon(self.main.iconfile)) self.setLayout(layout) self.connect(self.edtPasswd1, SIGNAL('textChanged(QString)'), \ self.checkPassphrase) self.connect(self.edtPasswd2, SIGNAL('textChanged(QString)'), \ self.checkPassphrase) self.connect(self.btnAccept, SIGNAL(CLICKED), \ self.checkPassphraseFinal) self.connect(self.btnCancel, SIGNAL(CLICKED), \ self, SLOT('reject()')) def disablePassphraseBoxes(self, noEncrypt=True): self.edtPasswd1.setEnabled(not noEncrypt) self.edtPasswd2.setEnabled(not noEncrypt) def checkPassphrase(self): if self.chkDisableCrypt.isChecked(): return True p1 = self.edtPasswd1.text() p2 = self.edtPasswd2.text() goodColor = htmlColor('TextGreen') badColor = htmlColor('TextRed') if not isASCII(unicode(p1)) or \ not isASCII(unicode(p2)): self.lblMatches.setText('Passphrase is non-ASCII!' % badColor) return False if not p1 == p2: self.lblMatches.setText('Passphrases do not match!' % badColor) return False if len(p1) < 5: self.lblMatches.setText('Passphrase is too short!' % badColor) return False self.lblMatches.setText('Passphrases match!' % goodColor) return True def checkPassphraseFinal(self): if self.chkDisableCrypt.isChecked(): self.accept() else: if self.checkPassphrase(): dlg = DlgPasswd3(self, self.main) if dlg.exec_(): if not str(dlg.edtPasswd3.text()) == str(self.edtPasswd1.text()): QMessageBox.critical(self, 'Invalid Passphrase', \ 'You entered your confirmation passphrase incorrectly!', QMessageBox.Ok) else: self.accept() else: self.reject() class DlgPasswd3(ArmoryDialog): def __init__(self, parent=None, main=None): super(DlgPasswd3, self).__init__(parent, main) lblWarnImgL = QLabel() lblWarnImgL.setPixmap(QPixmap(':/MsgBox_warning48.png')) lblWarnImgL.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) lblWarnTxt1 = QRichLabel(\ '!!! DO NOT FORGET YOUR PASSPHRASE !!!', size=4) lblWarnTxt1.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) lblWarnTxt2 = QRichLabel(\ 'No one can help you recover you bitcoins if you forget the ' 'passphrase and don\'t have a paper backup! Your wallet and ' 'any digital backups are useless if you forget it. ' '

' 'A paper backup protects your wallet forever, against ' 'hard-drive loss and losing your passphrase. It also protects you ' 'from theft, if the wallet was encrypted and the paper backup ' 'was not stolen with it. Please make a paper backup and keep it in ' 'a safe place.' '

' 'Please enter your passphrase a third time to indicate that you ' 'are aware of the risks of losing your passphrase!', doWrap=True) self.edtPasswd3 = QLineEdit() self.edtPasswd3.setEchoMode(QLineEdit.Password) self.edtPasswd3.setMinimumWidth(MIN_PASSWD_WIDTH(self)) bbox = QDialogButtonBox() btnOk = QPushButton('Accept') btnNo = QPushButton('Cancel') self.connect(btnOk, SIGNAL(CLICKED), self.accept) self.connect(btnNo, SIGNAL(CLICKED), self.reject) bbox.addButton(btnOk, QDialogButtonBox.AcceptRole) bbox.addButton(btnNo, QDialogButtonBox.RejectRole) layout = QGridLayout() layout.addWidget(lblWarnImgL, 0, 0, 4, 1) layout.addWidget(lblWarnTxt1, 0, 1, 1, 1) layout.addWidget(lblWarnTxt2, 2, 1, 1, 1) layout.addWidget(self.edtPasswd3, 5, 1, 1, 1) layout.addWidget(bbox, 6, 1, 1, 2) self.setLayout(layout) self.setWindowTitle('WARNING!') ################################################################################ class DlgChangeLabels(ArmoryDialog): def __init__(self, currName='', currDescr='', parent=None, main=None): super(DlgChangeLabels, self).__init__(parent, main) self.edtName = QLineEdit() self.edtName.setMaxLength(32) lblName = QLabel("Wallet &name:") lblName.setBuddy(self.edtName) self.edtDescr = QTextEdit() tightHeight = tightSizeNChar(self.edtDescr, 1)[1] self.edtDescr.setMaximumHeight(tightHeight * 4.2) lblDescr = QLabel("Wallet &description:") lblDescr.setAlignment(Qt.AlignVCenter) lblDescr.setBuddy(self.edtDescr) self.edtName.setText(currName) self.edtDescr.setText(currDescr) buttonBox = QDialogButtonBox(QDialogButtonBox.Ok | \ QDialogButtonBox.Cancel) self.connect(buttonBox, SIGNAL('accepted()'), self.accept) self.connect(buttonBox, SIGNAL('rejected()'), self.reject) layout = QGridLayout() layout.addWidget(lblName, 1, 0, 1, 1) layout.addWidget(self.edtName, 1, 1, 1, 1) layout.addWidget(lblDescr, 2, 0, 1, 1) layout.addWidget(self.edtDescr, 2, 1, 2, 1) layout.addWidget(buttonBox, 4, 0, 1, 2) self.setLayout(layout) self.setWindowTitle('Wallet Descriptions') def accept(self, *args): if not isASCII(unicode(self.edtName.text())) or \ not isASCII(unicode(self.edtDescr.toPlainText())): UnicodeErrorBox(self) return if len(str(self.edtName.text()).strip()) == 0: QMessageBox.critical(self, 'Empty Name', \ 'All wallets must have a name. ', QMessageBox.Ok) return super(DlgChangeLabels, self).accept(*args) ################################################################################ class DlgWalletDetails(ArmoryDialog): """ For displaying the details of a specific wallet, with options """ ############################################################################# def __init__(self, wlt, usermode=USERMODE.Standard, parent=None, main=None): super(DlgWalletDetails, self).__init__(parent, main) self.setAttribute(Qt.WA_DeleteOnClose) self.wlt = wlt self.usermode = usermode self.wlttype, self.typestr = determineWalletType(wlt, parent) if self.typestr == 'Encrypted': self.typestr = 'Encrypted (AES256)' self.labels = [wlt.labelName, wlt.labelDescr] self.passphrase = '' self.setMinimumSize(800, 400) w, h = relaxedSizeNChar(self, 60) viewWidth, viewHeight = w, 10 * h # Address view self.wltAddrModel = WalletAddrDispModel(wlt, self) self.wltAddrProxy = WalletAddrSortProxy(self) self.wltAddrProxy.setSourceModel(self.wltAddrModel) self.wltAddrView = QTableView() self.wltAddrView.setModel(self.wltAddrProxy) self.wltAddrView.setSortingEnabled(True) self.wltAddrView.setSelectionBehavior(QTableView.SelectRows) self.wltAddrView.setSelectionMode(QTableView.SingleSelection) self.wltAddrView.horizontalHeader().setStretchLastSection(True) self.wltAddrView.verticalHeader().setDefaultSectionSize(20) self.wltAddrView.setMinimumWidth(550) self.wltAddrView.setMinimumHeight(150) iWidth = tightSizeStr(self.wltAddrView, 'Imp')[0] initialColResize(self.wltAddrView, [iWidth * 1.5, 0.35, 0.4, 64, 0.2]) self.wltAddrView.sizeHint = lambda: QSize(700, 225) self.wltAddrView.setSizePolicy(QSizePolicy.Preferred, QSizePolicy.Expanding) self.wltAddrView.setContextMenuPolicy(Qt.CustomContextMenu) self.wltAddrView.customContextMenuRequested.connect(self.showContextMenu) self.wltAddrProxy.sort(ADDRESSCOLS.ChainIdx, Qt.AscendingOrder) self.connect(self.wltAddrView, SIGNAL('doubleClicked(QModelIndex)'), \ self.dblClickAddressView) # Now add all the options buttons, dependent on the type of wallet. lbtnChangeLabels = QLabelButton('Change Wallet Labels'); self.connect(lbtnChangeLabels, SIGNAL(CLICKED), self.changeLabels) if not self.wlt.watchingOnly: s = '' if self.wlt.useEncryption: s = 'Change or Remove Passphrase' else: s = 'Encrypt Wallet' lbtnChangeCrypto = QLabelButton(s) self.connect(lbtnChangeCrypto, SIGNAL(CLICKED), self.changeEncryption) exportStr = 'Data' if self.wlt.watchingOnly else 'Copy' lbtnSendBtc = QLabelButton('Send Bitcoins') lbtnGenAddr = QLabelButton('Receive Bitcoins') lbtnImportA = QLabelButton('Import/Sweep Private Keys') lbtnDeleteA = QLabelButton('Remove Imported Address') # lbtnSweepA = QLabelButton('Sweep Wallet/Address') lbtnExpWOWlt = QLabelButton('Export Watching-Only %s' % exportStr) lbtnBackups = QLabelButton('Backup This Wallet') lbtnRemove = QLabelButton('Delete/Remove Wallet') #lbtnRecover = QLabelButton('Recover Password Wallet') # LOGERROR('remove me!') # fnfrag = lambda: DlgFragBackup(self, self.main, self.wlt).exec_() # LOGERROR('remove me!') self.connect(lbtnSendBtc, SIGNAL(CLICKED), self.execSendBtc) self.connect(lbtnGenAddr, SIGNAL(CLICKED), self.getNewAddress) self.connect(lbtnBackups, SIGNAL(CLICKED), self.execBackupDlg) # self.connect(lbtnBackups, SIGNAL(CLICKED), fnfrag) self.connect(lbtnRemove, SIGNAL(CLICKED), self.execRemoveDlg) self.connect(lbtnImportA, SIGNAL(CLICKED), self.execImportAddress) self.connect(lbtnDeleteA, SIGNAL(CLICKED), self.execDeleteAddress) self.connect(lbtnExpWOWlt, SIGNAL(CLICKED), self.execExpWOCopy) #self.connect(lbtnRecover, SIGNAL(CLICKED), self.recoverPwd) lbtnSendBtc.setToolTip('Send bitcoins to other users, or transfer ' 'between wallets') if self.wlt.watchingOnly: lbtnSendBtc.setToolTip('If you have a full-copy of this wallet ' 'on another computer, you can prepare a ' 'transaction, to be signed by that computer.') lbtnGenAddr.setToolTip('Get a new address from this wallet for receiving ' 'bitcoins. Right click on the address list below ' 'to copy an existing address.') lbtnImportA.setToolTip('Import or "Sweep" an address which is not part ' 'of your wallet. Useful for VanityGen addresses ' 'and redeeming Casascius physical bitcoins.') lbtnDeleteA.setToolTip('Permanently delete an imported address from ' 'this wallet. You cannot delete addresses that ' 'were generated natively by this wallet.') # lbtnSweepA .setToolTip('') lbtnExpWOWlt.setToolTip('Export a copy of this wallet that can ' 'only be used for generating addresses and ' 'monitoring incoming payments. A watching-only ' 'wallet cannot spend the funds, and thus cannot ' 'be compromised by an attacker') lbtnBackups.setToolTip('See lots of options for backing up your wallet ' 'to protect the funds in it.') lbtnRemove.setToolTip('Permanently delete this wallet, or just delete ' 'the private keys to convert it to a watching-only ' 'wallet.') #lbtnRecover.setToolTip('Attempt to recover a lost password using ' # 'details that you remember.') if not self.wlt.watchingOnly: lbtnChangeCrypto.setToolTip('Add/Remove/Change wallet encryption settings.') optFrame = QFrame() optFrame.setFrameStyle(STYLE_SUNKEN) optLayout = QVBoxLayout() hasPriv = not self.wlt.watchingOnly adv = (self.main.usermode in (USERMODE.Advanced, USERMODE.Expert)) def createVBoxSeparator(): frm = QFrame() frm.setFrameStyle(QFrame.HLine | QFrame.Plain) return frm if True: optLayout.addWidget(lbtnSendBtc) if True: optLayout.addWidget(lbtnGenAddr) if hasPriv: optLayout.addWidget(lbtnChangeCrypto) if True: optLayout.addWidget(lbtnChangeLabels) if True: optLayout.addWidget(createVBoxSeparator()) if hasPriv: optLayout.addWidget(lbtnBackups) if adv: optLayout.addWidget(lbtnExpWOWlt) if True: optLayout.addWidget(lbtnRemove) # if True: optLayout.addWidget(lbtnRecover) # Not sure yet that we want to include the password finer in here if adv: optLayout.addWidget(createVBoxSeparator()) if hasPriv and adv: optLayout.addWidget(lbtnImportA) if hasPriv and adv: optLayout.addWidget(lbtnDeleteA) # if hasPriv and adv: optLayout.addWidget(lbtnSweepA) optLayout.addStretch() optFrame.setLayout(optLayout) self.frm = QFrame() self.setWltDetailsFrame() totalFunds = self.wlt.getBalance('Total') spendFunds = self.wlt.getBalance('Spendable') unconfFunds = self.wlt.getBalance('Unconfirmed') uncolor = htmlColor('MoneyNeg') if unconfFunds > 0 else htmlColor('Foreground') btccolor = htmlColor('DisableFG') if spendFunds == totalFunds else htmlColor('MoneyPos') lblcolor = htmlColor('DisableFG') if spendFunds == totalFunds else htmlColor('Foreground') goodColor = htmlColor('TextGreen') self.lblTot = QRichLabel('', doWrap=False); self.lblSpd = QRichLabel('', doWrap=False); self.lblUnc = QRichLabel('', doWrap=False); self.lblTotalFunds = QRichLabel('', doWrap=False) self.lblSpendFunds = QRichLabel('', doWrap=False) self.lblUnconfFunds = QRichLabel('', doWrap=False) self.lblTotalFunds.setAlignment(Qt.AlignRight | Qt.AlignVCenter) self.lblSpendFunds.setAlignment(Qt.AlignRight | Qt.AlignVCenter) self.lblUnconfFunds.setAlignment(Qt.AlignRight | Qt.AlignVCenter) self.lblTot.setAlignment(Qt.AlignRight | Qt.AlignVCenter) self.lblSpd.setAlignment(Qt.AlignRight | Qt.AlignVCenter) self.lblUnc.setAlignment(Qt.AlignRight | Qt.AlignVCenter) self.lblBTC1 = QRichLabel('', doWrap=False) self.lblBTC2 = QRichLabel('', doWrap=False) self.lblBTC3 = QRichLabel('', doWrap=False) ttipTot = self.main.createToolTipWidget(\ 'Total funds if all current transactions are confirmed. ' 'Value appears gray when it is the same as your spendable funds.') ttipSpd = self.main.createToolTipWidget(\ 'Funds that can be spent right now') ttipUcn = self.main.createToolTipWidget(\ 'Funds that have less than 6 confirmations') self.setSummaryBalances() frmTotals = QFrame() frmTotals.setFrameStyle(STYLE_NONE) frmTotalsLayout = QGridLayout() frmTotalsLayout.addWidget(self.lblTot, 0, 0) frmTotalsLayout.addWidget(self.lblSpd, 1, 0) frmTotalsLayout.addWidget(self.lblUnc, 2, 0) frmTotalsLayout.addWidget(self.lblTotalFunds, 0, 1) frmTotalsLayout.addWidget(self.lblSpendFunds, 1, 1) frmTotalsLayout.addWidget(self.lblUnconfFunds, 2, 1) frmTotalsLayout.addWidget(self.lblBTC1, 0, 2) frmTotalsLayout.addWidget(self.lblBTC2, 1, 2) frmTotalsLayout.addWidget(self.lblBTC3, 2, 2) frmTotalsLayout.addWidget(ttipTot, 0, 3) frmTotalsLayout.addWidget(ttipSpd, 1, 3) frmTotalsLayout.addWidget(ttipUcn, 2, 3) frmTotals.setLayout(frmTotalsLayout) lblWltAddr = QRichLabel('Addresses in Wallet:', doWrap=False) self.chkHideEmpty = QCheckBox('Hide Empty') self.chkHideChange = QCheckBox('Hide Change') self.chkHideUnused = QCheckBox('Hide Unused') self.chkHideEmpty.setChecked(False) self.chkHideChange.setChecked(self.main.usermode == USERMODE.Standard) self.chkHideUnused.setChecked(self.wlt.highestUsedChainIndex > 25) self.connect(self.chkHideEmpty, SIGNAL(CLICKED), self.doFilterAddr) self.connect(self.chkHideChange, SIGNAL(CLICKED), self.doFilterAddr) self.connect(self.chkHideUnused, SIGNAL(CLICKED), self.doFilterAddr) headerFrm = makeHorizFrame([ lblWltAddr, \ STRETCH, \ self.chkHideEmpty, \ self.chkHideChange, \ self.chkHideUnused]) btnGoBack = QPushButton('<<< Go Back') self.connect(btnGoBack, SIGNAL(CLICKED), self.accept) bottomFrm = makeHorizFrame([btnGoBack, STRETCH, frmTotals]) layout = QGridLayout() layout.addWidget(self.frm, 0, 0) layout.addWidget(headerFrm, 1, 0) layout.addWidget(self.wltAddrView, 2, 0) layout.addWidget(bottomFrm, 3, 0) # layout.addWidget(QLabel("Available Actions:"), 0, 4) layout.addWidget(optFrame, 0, 1, 4, 1) layout.setRowStretch(0, 0) layout.setRowStretch(1, 0) layout.setRowStretch(2, 1) layout.setRowStretch(3, 0) layout.setColumnStretch(0, 1) layout.setColumnStretch(1, 0) self.setLayout(layout) self.setWindowTitle('Wallet Properties') self.doFilterAddr() hexgeom = self.main.settings.get('WltPropGeometry') tblgeom = self.main.settings.get('WltPropAddrCols') if len(hexgeom) > 0: geom = QByteArray.fromHex(hexgeom) self.restoreGeometry(geom) if len(tblgeom) > 0: restoreTableView(self.wltAddrView, tblgeom) def remindBackup(): result = MsgBoxWithDNAA(MSGBOX.Warning, 'Wallet Backup', \ 'Please backup your wallet! ' '

' 'Making a paper backup will guarantee you can recover your ' 'coins at any time in the future, even if your ' 'hard drive dies or you forget your passphrase. Without it, ' 'you could permanently lose your coins! ' 'The backup buttons are to the right of the address list.' '

' 'A paper backup is recommended, ' 'and it can be copied by hand if you do not have a working printer. ' 'A digital backup only works if you remember the passphrase ' 'used at the time it was created. If you have ever forgotten a ' 'password before, only rely on a digital backup if you store ' 'the password with it!' '

' '' 'Read more about Armory backups', None, yesStr='Ok', \ dnaaStartChk=True) self.main.setWltSetting(wlt.uniqueIDB58, 'DNAA_RemindBackup', result[1]) wltType = determineWalletType(wlt, main)[0] chkLoad = (self.main.getSettingOrSetDefault('Load_Count', 1) % 5 == 0) chkType = not wltType in (WLTTYPES.Offline, WLTTYPES.WatchOnly) chkDNAA = not self.main.getWltSetting(wlt.uniqueIDB58, 'DNAA_RemindBackup') chkDont = not self.main.getSettingOrSetDefault('DNAA_AllBackupWarn', False) if chkLoad and chkType and chkDNAA and chkDont: from twisted.internet import reactor reactor.callLater(1, remindBackup) lbtnBackups.setText('Backup This Wallet' \ % htmlColor('TextWarn')) ############################################################################# def doFilterAddr(self): self.wltAddrModel.setFilter(self.chkHideEmpty.isChecked(), \ self.chkHideChange.isChecked(), \ self.chkHideUnused.isChecked()) self.wltAddrModel.reset() ############################################################################# def setSummaryBalances(self): totalFunds = self.wlt.getBalance('Total') spendFunds = self.wlt.getBalance('Spendable') unconfFunds = self.wlt.getBalance('Unconfirmed') uncolor = htmlColor('MoneyNeg') if unconfFunds > 0 else htmlColor('Foreground') btccolor = htmlColor('DisableFG') if spendFunds == totalFunds else htmlColor('MoneyPos') lblcolor = htmlColor('DisableFG') if spendFunds == totalFunds else htmlColor('Foreground') goodColor = htmlColor('TextGreen') self.lblTot.setText('Maximum Funds:' % lblcolor) self.lblSpd.setText('Spendable Funds:') self.lblUnc.setText('Unconfirmed:') # if self.main.blkMode in (BLOCKCHAINMODE.Offline, BLOCKCHAINMODE.Rescanning): if TheBDM.getBDMState() in ('Uninitialized', 'Offline', 'Scanning'): totStr = '-' * 12 spdStr = '-' * 12 ucnStr = '-' * 12 else: totStr = '%s' % (btccolor, coin2str(totalFunds)) spdStr = '%s' % (goodColor, coin2str(spendFunds)) ucnStr = '%s' % (uncolor, coin2str(unconfFunds)) self.lblTotalFunds.setText(totStr) self.lblSpendFunds.setText(spdStr) self.lblUnconfFunds.setText(ucnStr) self.lblBTC1.setText('BTC' % lblcolor) self.lblBTC2.setText('BTC') self.lblBTC3.setText('BTC') ############################################################################# def saveGeometrySettings(self): self.main.writeSetting('WltPropGeometry', str(self.saveGeometry().toHex())) self.main.writeSetting('WltPropAddrCols', saveTableView(self.wltAddrView)) ############################################################################# def closeEvent(self, event): self.saveGeometrySettings() super(DlgWalletDetails, self).closeEvent(event) ############################################################################# def accept(self, *args): self.saveGeometrySettings() super(DlgWalletDetails, self).accept(*args) ############################################################################# def reject(self, *args): self.saveGeometrySettings() super(DlgWalletDetails, self).reject(*args) ############################################################################# def showContextMenu(self, pos): menu = QMenu(self.wltAddrView) std = (self.main.usermode == USERMODE.Standard) adv = (self.main.usermode == USERMODE.Advanced) dev = (self.main.usermode == USERMODE.Expert) if True: actionCopyAddr = menu.addAction("Copy Address") if True: actionShowQRCode = menu.addAction("Display Address QR Code") if True: actionBlkChnInfo = menu.addAction("View Address on %s" % BLOCKEXPLORE_NAME) if True: actionReqPayment = menu.addAction("Request Payment to this Address") if dev: actionCopyHash160 = menu.addAction("Copy Hash160 (hex)") if dev: actionCopyPubKey = menu.addAction("Copy Raw Public Key (hex)") if True: actionCopyComment = menu.addAction("Copy Comment") if True: actionCopyBalance = menu.addAction("Copy Balance") idx = self.wltAddrView.selectedIndexes()[0] action = menu.exec_(QCursor.pos()) # Get data on a given row, easily def getModelStr(col): model = self.wltAddrView.model() qstr = model.index(idx.row(), col).data().toString() return str(qstr).strip() addr = getModelStr(ADDRESSCOLS.Address) if action == actionCopyAddr: clippy = addr elif action == actionBlkChnInfo: blkchnURL = BLOCKEXPLORE_URL_ADDR % addr try: import webbrowser webbrowser.open(blkchnURL) except: QMessageBox.critical(self, tr('Could not open browser'), tr(""" Armory encountered an error opening your web browser. To view this address on blockchain.info, please copy and paste the following URL into your browser:

%s""") % (blkchnURL, blkchnURL), QMessageBox.Ok) return elif action == actionShowQRCode: wltstr = 'Wallet: %s (%s)' % (self.wlt.labelName, self.wlt.uniqueIDB58) DlgQRCodeDisplay(self, self.main, addr, addr, wltstr).exec_() return elif action == actionReqPayment: DlgRequestPayment(self, self.main, addr).exec_() return elif dev and action == actionCopyHash160: clippy = binary_to_hex(addrStr_to_hash160(addr)[1]) elif dev and action == actionCopyPubKey: astr = getModelStr(ADDRESSCOLS.Address) addrObj = self.wlt.getAddrByHash160( addrStr_to_hash160(astr)[1] ) clippy = addrObj.binPublicKey65.toHexStr() elif action == actionCopyComment: clippy = getModelStr(ADDRESSCOLS.Comment) elif action == actionCopyBalance: clippy = getModelStr(ADDRESSCOLS.Balance) else: return clipb = QApplication.clipboard() clipb.clear() clipb.setText(str(clippy).strip()) ############################################################################# def dblClickAddressView(self, index): model = index.model() if index.column() == ADDRESSCOLS.Comment: # Update the address's comment. We apparently need to reset the model # to get an immediate comment update on OS X, unlike Linux or Windows. self.main.updateAddressCommentFromView(self.wltAddrView, self.wlt) if OS_MACOSX: self.wltAddrView.reset() else: addrStr = str(index.model().index(index.row(), ADDRESSCOLS.Address).data().toString()) atype, addr160 = addrStr_to_hash160(addrStr, False) dlg = DlgAddressInfo(self.wlt, addr160, self, self.main) dlg.exec_() ############################################################################# def changeLabels(self): dlgLabels = DlgChangeLabels(self.wlt.labelName, self.wlt.labelDescr, self, self.main) if dlgLabels.exec_(): # Make sure to use methods like this which not only update in memory, # but guarantees the file is updated, too newName = str(dlgLabels.edtName.text())[:32] newDescr = str(dlgLabels.edtDescr.toPlainText())[:256] self.wlt.setWalletLabels(newName, newDescr) self.labelValues[WLTFIELDS.Name].setText(newName) self.labelValues[WLTFIELDS.Descr].setText(newDescr) ############################################################################# def changeEncryption(self): dlgCrypt = DlgChangePassphrase(self, self.main, not self.wlt.useEncryption) if dlgCrypt.exec_(): self.disableEncryption = dlgCrypt.chkDisableCrypt.isChecked() newPassphrase = SecureBinaryData(str(dlgCrypt.edtPasswd1.text())) dlgCrypt.edtPasswd1.clear() dlgCrypt.edtPasswd2.clear() if self.wlt.useEncryption: origPassphrase = SecureBinaryData(str(dlgCrypt.edtPasswdOrig.text())) dlgCrypt.edtPasswdOrig.clear() if self.wlt.verifyPassphrase(origPassphrase): unlockProgress = DlgProgress(self, self.main, HBar=1, Title="Unlocking Wallet") unlockProgress.exec_(self.wlt.unlock, securePassphrase=origPassphrase) else: # Even if the wallet is already unlocked, enter pwd again to change it QMessageBox.critical(self, 'Invalid Passphrase', \ 'Previous passphrase is not correct! Could not unlock wallet.', \ QMessageBox.Ok) if self.disableEncryption: unlockProgress = DlgProgress(self, self.main, HBar=1, Title="Changing Encryption") unlockProgress.exec_(self.wlt.changeWalletEncryption) # self.accept() self.labelValues[WLTFIELDS.Secure].setText('No Encryption') self.labelValues[WLTFIELDS.Secure].setText('') self.labelValues[WLTFIELDS.Secure].setText('') else: if not self.wlt.useEncryption: kdfParams = self.wlt.computeSystemSpecificKdfParams(0.2) self.wlt.changeKdfParams(*kdfParams) unlockProgress = DlgProgress(self, self.main, HBar=2, Title="Changing Encryption") unlockProgress.exec_(self.wlt.changeWalletEncryption, securePassphrase=newPassphrase) self.labelValues[WLTFIELDS.Secure].setText('Encrypted (AES256)') # self.accept() def getNewAddress(self): if showRecvCoinsWarningIfNecessary(self.wlt, self.main): DlgNewAddressDisp(self.wlt, self, self.main).exec_() self.wltAddrView.reset() def execSendBtc(self): # if self.main.blkMode == BLOCKCHAINMODE.Offline: if TheBDM.getBDMState() in ('Offline', 'Uninitialized'): QMessageBox.warning(self, 'Offline Mode', \ 'Armory is currently running in offline mode, and has no ' 'ability to determine balances or create transactions. ' '

' 'In order to send coins from this wallet you must use a ' 'full copy of this wallet from an online computer, ' 'or initiate an "offline transaction" using a watching-only ' 'wallet on an online computer.', QMessageBox.Ok) return if TheBDM.getBDMState() == 'Scanning': QMessageBox.warning(self, 'Armory Not Ready', \ 'Armory is currently scanning the blockchain to collect ' 'the information needed to create transactions. This typically ' 'takes between one and five minutes. Please wait until your ' 'balance appears on the main window, then try again.', \ QMessageBox.Ok) return self.accept() DlgSendBitcoins(self.wlt, self, self.main, onlyOfflineWallets=False).exec_() self.wltAddrModel.reset() def changeKdf(self): """ This is a low-priority feature. I mean, the PyBtcWallet class has this feature implemented, but I don't have a GUI for it """ pass def execBackupDlg(self): if self.main.usermode == USERMODE.Expert: DlgBackupCenter(self, self.main, self.wlt).exec_() else: DlgSimpleBackup(self, self.main, self.wlt).exec_() def execPrintDlg(self): if self.wlt.isLocked: unlockdlg = DlgUnlockWallet(self.wlt, self, self.main, 'Create Paper Backup') if not unlockdlg.exec_(): return if not self.wlt.addrMap['ROOT'].hasPrivKey(): QMessageBox.warning(self, 'Move along...', \ 'This wallet does not contain any private keys. Nothing to backup!', QMessageBox.Ok) return OpenPaperBackupWindow('Single', self, self.main, self.wlt) def execRemoveDlg(self): dlg = DlgRemoveWallet(self.wlt, self, self.main) if dlg.exec_(): pass # not sure that I don't handle everything in the dialog itself def execKeyList(self): if self.wlt.useEncryption and self.wlt.isLocked: dlg = DlgUnlockWallet(self.wlt, self, self.main, 'Unlock Private Keys') if not dlg.exec_(): if self.main.usermode == USERMODE.Expert: QMessageBox.warning(self, 'Unlock Failed', \ 'Wallet was not be unlocked. The public keys and addresses ' 'will still be shown, but private keys will not be available ' 'unless you reopen the dialog with the correct passphrase', \ QMessageBox.Ok) else: QMessageBox.warning(self, 'Unlock Failed', \ 'Wallet could not be unlocked to display individual keys.', \ QMessageBox.Ok) return dlg = DlgShowKeyList(self.wlt, self, self.main) dlg.exec_() def execDeleteAddress(self): selectedList = self.wltAddrView.selectedIndexes() if len(selectedList) == 0: QMessageBox.warning(self, 'No Selection', \ 'You must select an address to remove!', \ QMessageBox.Ok) return row = selectedList[0].row() addrStr = str(self.wltAddrView.model().index(row, ADDRESSCOLS.Address).data().toString()) atype, addr160 = addrStr_to_hash160(addrStr) if atype==P2SHBYTE: LOGWARN('Deleting P2SH address: %s' % addrStr) if self.wlt.addrMap[addr160].chainIndex == -2: dlg = DlgRemoveAddress(self.wlt, addr160, self, self.main) dlg.exec_() else: QMessageBox.warning(self, 'Invalid Selection', \ 'You cannot delete addresses generated by your wallet. ' 'Only imported addresses can be deleted.', \ QMessageBox.Ok) return def execImportAddress(self): # if TheBDM.getBDMState()=='Scanning': # QMessageBox.warning(self, 'Armory Not Ready', # 'Armory is currently in the process of scanning the blockchain ' # 'for your existing wallets. This operation must finish before ' # 'you can import or sweep private keys. ' # '

' # 'Try again after your balances and transaction history appear ' # 'in the main window.', QMessageBox.Ok) # return if not self.main.getSettingOrSetDefault('DNAA_ImportWarning', False): result = MsgBoxWithDNAA(MSGBOX.Warning, \ tr("""Imported Address Warning"""), tr(""" Armory supports importing of external private keys into your wallet but imported addresses are not automatically protected by your backups. If you do not plan to use the address again, it is recommended that you "Sweep" the private key instead of importing it.

Individual private keys, including imported ones, can be backed up using the "Export Key Lists" option in the wallet backup window."""), None) self.main.writeSetting('DNAA_ImportWarning', result[1]) # Now we are past the [potential] warning box. Actually open # the import dialog dlg = DlgImportAddress(self.wlt, self, self.main) dlg.exec_() try: self.parent.wltAddrModel.reset() except AttributeError: pass ############################################################################# def execExpWOCopy(self): """ Function executed when a user executes the \"Export Public Key & Chain Code\" option. """ # This should never happen.... if not self.wlt.addrMap['ROOT'].hasChainCode(): QMessageBox.warning(self, 'Move along... This wallet does not have', \ 'a chain code. Backups are pointless!', \ QMessageBox.Ok) return # Proceed to the actual export center. dlg = DlgExpWOWltData(self.wlt, self, self.main) if dlg.exec_(): pass # Once executed, we're done. ############################################################################# def saveWalletCopy(self): fn = 'armory_%s_.wallet' % self.wlt.uniqueIDB58 if self.wlt.watchingOnly: fn = 'armory_%s.watchonly.wallet' % self.wlt.uniqueIDB58 savePath = self.main.getFileSave(defaultFilename=fn) if len(savePath) > 0: self.wlt.writeFreshWalletFile(savePath) self.main.statusBar().showMessage(\ 'Successfully copied wallet to ' + savePath, 10000) # def recoverPwd(self): # passwordFinder = PasswordFinder(wallet=self.wlt) # A possible way to remove an existing layout # def setLayout(self, layout): # self.clearLayout() # QWidget.setLayout(self, layout) # # def clearLayout(self): # if self.layout() is not None: # old_layout = self.layout() # for i in reversed(range(old_layout.count())): # old_layout.itemAt(i).widget().setParent(None) # import sip # sip.delete(old_layout) ############################################################################# def setWltDetailsFrame(self): dispCrypto = self.wlt.useEncryption and (self.usermode == USERMODE.Advanced or \ self.usermode == USERMODE.Expert) self.wltID = self.wlt.uniqueIDB58 if dispCrypto: mem = self.wlt.kdf.getMemoryReqtBytes() kdfmemstr = str(mem / 1024) + ' kB' if mem >= 1024 * 1024: kdfmemstr = str(mem / (1024 * 1024)) + ' MB' tooltips = [[]] * 10 tooltips[WLTFIELDS.Name] = self.main.createToolTipWidget( 'This is the name stored with the wallet file. Click on the ' '"Change Labels" button on the right side of this ' 'window to change this field') tooltips[WLTFIELDS.Descr] = self.main.createToolTipWidget( 'This is the description of the wallet stored in the wallet file. ' 'Press the "Change Labels" button on the right side of this ' 'window to change this field') tooltips[WLTFIELDS.WltID] = self.main.createToolTipWidget( 'This is a unique identifier for this wallet, based on the root key. ' 'No other wallet can have the same ID ' 'unless it is a copy of this one, regardless of whether ' 'the name and description match.') tooltips[WLTFIELDS.NumAddr] = self.main.createToolTipWidget( 'This is the number of addresses *used* by this wallet so far. ' 'If you recently restored this wallet and you do not see all the ' 'funds you were expecting, click on this field to increase it.') if self.typestr == 'Offline': tooltips[WLTFIELDS.Secure] = self.main.createToolTipWidget( 'Offline: This is a "Watching-Only" wallet that you have identified ' 'belongs to you, but you cannot spend any of the wallet funds ' 'using this wallet. This kind of wallet ' 'is usually stored on an internet-connected computer, to manage ' 'incoming transactions, but the private keys needed ' 'to spend the money are stored on an offline computer.') elif self.typestr == 'Watching-Only': tooltips[WLTFIELDS.Secure] = self.main.createToolTipWidget( 'Watching-Only: You can only watch addresses in this wallet ' 'but cannot spend any of the funds.') elif self.typestr == 'No Encryption': tooltips[WLTFIELDS.Secure] = self.main.createToolTipWidget( 'No Encryption: This wallet contains private keys, and does not require ' 'a passphrase to spend funds available to this wallet. If someone ' 'else obtains a copy of this wallet, they can also spend your funds! ' '(You can click the "Change Encryption" button on the right side of this ' 'window to enabled encryption)') elif self.typestr == 'Encrypted (AES256)': tooltips[WLTFIELDS.Secure] = self.main.createToolTipWidget( 'This wallet contains the private keys needed to spend this wallet\'s ' 'funds, but they are encrypted on your harddrive. The wallet must be ' '"unlocked" with the correct passphrase before you can spend any of the ' 'funds. You can still generate new addresses and monitor incoming ' 'transactions, even with a locked wallet.') tooltips[WLTFIELDS.BelongsTo] = self.main.createToolTipWidget( 'Declare who owns this wallet. If you click on the field and select ' '"This wallet is mine", it\'s balance will be included in your total ' 'Armory Balance in the main window') tooltips[WLTFIELDS.Time] = self.main.createToolTipWidget( 'This is exactly how long it takes your computer to unlock your ' 'wallet after you have entered your passphrase. If someone got ' 'ahold of your wallet, this is approximately how long it would take ' 'them to for each guess of your passphrase.') tooltips[WLTFIELDS.Mem] = self.main.createToolTipWidget( 'This is the amount of memory required to unlock your wallet. ' 'Memory values above 64 kB pretty much guarantee that GPU-acceleration ' 'will be useless for guessing your passphrase') tooltips[WLTFIELDS.Version] = self.main.createToolTipWidget( 'Wallets created with different versions of Armory, may have ' 'different wallet versions. Not all functionality may be ' 'available with all wallet versions. Creating a new wallet will ' 'always create the latest version.') labelNames = [[]] * 10 labelNames[WLTFIELDS.Name] = QLabel('Wallet Name:') labelNames[WLTFIELDS.Descr] = QLabel('Description:') labelNames[WLTFIELDS.WltID] = QLabel('Wallet ID:') labelNames[WLTFIELDS.NumAddr] = QLabel('Addresses Used:') labelNames[WLTFIELDS.Secure] = QLabel('Security:') labelNames[WLTFIELDS.Version] = QLabel('Version:') labelNames[WLTFIELDS.BelongsTo] = QLabel('Belongs to:') # TODO: Add wallet path/location to this! if dispCrypto: labelNames[WLTFIELDS.Time] = QLabel('Unlock Time:') labelNames[WLTFIELDS.Mem] = QLabel('Unlock Memory:') self.labelValues = [[]] * 10 self.labelValues[WLTFIELDS.Name] = QLabel(self.wlt.labelName) self.labelValues[WLTFIELDS.Descr] = QLabel(self.wlt.labelDescr) self.labelValues[WLTFIELDS.WltID] = QLabel(self.wlt.uniqueIDB58) self.labelValues[WLTFIELDS.Secure] = QLabel(self.typestr) self.labelValues[WLTFIELDS.BelongsTo] = QLabel('') self.labelValues[WLTFIELDS.Version] = QLabel(getVersionString(self.wlt.version)) topUsed = max(self.wlt.highestUsedChainIndex, 0) self.labelValues[WLTFIELDS.NumAddr] = QLabelButton('%d' % topUsed) self.labelValues[WLTFIELDS.NumAddr].setAlignment(Qt.AlignLeft | Qt.AlignVCenter) opendlgkeypool = lambda: DlgKeypoolSettings(self.wlt, self, self.main).exec_() self.connect(self.labelValues[WLTFIELDS.NumAddr], SIGNAL(CLICKED), opendlgkeypool) # Set the owner appropriately if self.wlt.watchingOnly: if self.main.getWltSetting(self.wltID, 'IsMine'): self.labelValues[WLTFIELDS.BelongsTo] = QLabelButton('You own this wallet') self.labelValues[WLTFIELDS.BelongsTo].setAlignment(Qt.AlignLeft | Qt.AlignVCenter) else: owner = self.main.getWltSetting(self.wltID, 'BelongsTo') if owner == '': self.labelValues[WLTFIELDS.BelongsTo] = QLabelButton('Someone else...') self.labelValues[WLTFIELDS.BelongsTo].setAlignment(Qt.AlignLeft | Qt.AlignVCenter) else: self.labelValues[WLTFIELDS.BelongsTo] = QLabelButton(owner) self.labelValues[WLTFIELDS.BelongsTo].setAlignment(Qt.AlignLeft | Qt.AlignVCenter) self.connect(self.labelValues[WLTFIELDS.BelongsTo], SIGNAL(CLICKED), \ self.execSetOwner) if dispCrypto: self.labelValues[WLTFIELDS.Time] = QLabelButton('Click to Test') self.labelValues[WLTFIELDS.Mem] = QLabel(kdfmemstr) for ttip in tooltips: try: ttip.setAlignment(Qt.AlignRight | Qt.AlignTop) w, h = relaxedSizeStr(ttip, '(?)') ttip.setMaximumSize(w, h) except AttributeError: pass for lbl in labelNames: try: lbl.setTextFormat(Qt.RichText) lbl.setText('' + lbl.text() + '') lbl.setContentsMargins(0, 0, 0, 0) w, h = tightSizeStr(lbl, '9' * 16) lbl.setMaximumSize(w, h) except AttributeError: pass for i, lbl in enumerate(self.labelValues): if i == WLTFIELDS.BelongsTo: lbl.setContentsMargins(10, 0, 10, 0) continue try: lbl.setText('' + lbl.text() + '') lbl.setContentsMargins(10, 0, 10, 0) # lbl.setTextInteractionFlags(Qt.TextSelectableByMouse | \ # Qt.TextSelectableByKeyboard) except AttributeError: pass # Not sure why this has to be connected downhere... it didn't work above it if dispCrypto: self.labelValues[WLTFIELDS.Time].setAlignment(Qt.AlignLeft | Qt.AlignVCenter) self.connect(self.labelValues[WLTFIELDS.Time], SIGNAL(CLICKED), self.testKdfTime) labelNames[WLTFIELDS.Descr].setAlignment(Qt.AlignLeft | Qt.AlignTop) self.labelValues[WLTFIELDS.Descr].setWordWrap(True) self.labelValues[WLTFIELDS.Descr].setAlignment(Qt.AlignLeft | Qt.AlignTop) lblEmpty = QLabel(' ' * 20) layout = QGridLayout() layout.addWidget(tooltips[WLTFIELDS.WltID], 0, 0); layout.addWidget(labelNames[WLTFIELDS.WltID], 0, 1); layout.addWidget(self.labelValues[WLTFIELDS.WltID], 0, 2) layout.addWidget(tooltips[WLTFIELDS.Name], 1, 0); layout.addWidget(labelNames[WLTFIELDS.Name], 1, 1); layout.addWidget(self.labelValues[WLTFIELDS.Name], 1, 2) layout.addWidget(tooltips[WLTFIELDS.Descr], 2, 0); layout.addWidget(labelNames[WLTFIELDS.Descr], 2, 1); layout.addWidget(self.labelValues[WLTFIELDS.Descr], 2, 2, 4, 1) layout.addWidget(tooltips[WLTFIELDS.Version], 0, 3); layout.addWidget(labelNames[WLTFIELDS.Version], 0, 4); layout.addWidget(self.labelValues[WLTFIELDS.Version], 0, 5) i = 0 if self.main.usermode == USERMODE.Expert: i += 1 layout.addWidget(tooltips[WLTFIELDS.NumAddr], i, 3) layout.addWidget(labelNames[WLTFIELDS.NumAddr], i, 4) layout.addWidget(self.labelValues[WLTFIELDS.NumAddr], i, 5) i += 1 layout.addWidget(tooltips[WLTFIELDS.Secure], i, 3); layout.addWidget(labelNames[WLTFIELDS.Secure], i, 4); layout.addWidget(self.labelValues[WLTFIELDS.Secure], i, 5) if self.wlt.watchingOnly: i += 1 layout.addWidget(tooltips[WLTFIELDS.BelongsTo], i, 3); layout.addWidget(labelNames[WLTFIELDS.BelongsTo], i, 4); layout.addWidget(self.labelValues[WLTFIELDS.BelongsTo], i, 5) if dispCrypto: i += 1 layout.addWidget(tooltips[WLTFIELDS.Time], i, 3); layout.addWidget(labelNames[WLTFIELDS.Time], i, 4); layout.addWidget(self.labelValues[WLTFIELDS.Time], i, 5) i += 1 layout.addWidget(tooltips[WLTFIELDS.Mem], i, 3); layout.addWidget(labelNames[WLTFIELDS.Mem], i, 4); layout.addWidget(self.labelValues[WLTFIELDS.Mem], i, 5) self.frm = QFrame() self.frm.setFrameStyle(STYLE_SUNKEN) self.frm.setLayout(layout) def testKdfTime(self): kdftimestr = "%0.3f sec" % self.wlt.testKdfComputeTime() self.labelValues[WLTFIELDS.Time].setText(kdftimestr) def execSetOwner(self): dlg = self.dlgChangeOwner(self.wltID, self, self.main) if dlg.exec_(): if dlg.chkIsMine.isChecked(): self.main.setWltSetting(self.wltID, 'IsMine', True) self.main.setWltSetting(self.wltID, 'BelongsTo', '') self.labelValues[WLTFIELDS.BelongsTo].setText('You own this wallet') self.labelValues[WLTFIELDS.BelongsTo].setAlignment(Qt.AlignLeft | Qt.AlignVCenter) self.labelValues[WLTFIELDS.Secure].setText('Offline') else: owner = unicode(dlg.edtOwnerString.text()) self.main.setWltSetting(self.wltID, 'IsMine', False) self.main.setWltSetting(self.wltID, 'BelongsTo', owner) if len(owner) > 0: self.labelValues[WLTFIELDS.BelongsTo].setText(owner) else: self.labelValues[WLTFIELDS.BelongsTo].setText('Someone else') self.labelValues[WLTFIELDS.Secure].setText('Watching-Only') self.labelValues[WLTFIELDS.BelongsTo].setAlignment(Qt.AlignLeft | Qt.AlignVCenter) self.labelValues[WLTFIELDS.Secure].setAlignment(Qt.AlignLeft | Qt.AlignVCenter) class dlgChangeOwner(ArmoryDialog): def __init__(self, wltID, parent=None, main=None): super(parent.dlgChangeOwner, self).__init__(parent, main) layout = QGridLayout() self.chkIsMine = QCheckBox('This wallet is mine') self.edtOwnerString = QLineEdit() if parent.main.getWltSetting(wltID, 'IsMine'): lblDescr = QLabel( 'The funds in this wallet are currently identified as ' 'belonging to you. As such, any funds ' 'available to this wallet will be included in the total ' 'balance displayed on the main screen. \n\n' 'If you do not actually own this wallet, or do not wish ' 'for its funds to be considered part of your balance, ' 'uncheck the box below. Optionally, you can include the ' 'name of the person or organization that does own it.') lblDescr.setWordWrap(True) layout.addWidget(lblDescr, 0, 0, 1, 2) layout.addWidget(self.chkIsMine, 1, 0) self.chkIsMine.setChecked(True) self.edtOwnerString.setEnabled(False) else: owner = parent.main.getWltSetting(wltID, 'BelongsTo') if owner == '': owner = 'someone else' else: self.edtOwnerString.setText(owner) lblDescr = QLabel( 'The funds in this wallet are currently identified as ' 'belonging to ' + owner + '. If these funds are actually ' 'yours, and you would like the funds included in your balance in ' 'the main window, please check the box below.\n\n') lblDescr.setWordWrap(True) layout.addWidget(lblDescr, 0, 0, 1, 2) layout.addWidget(self.chkIsMine, 1, 0) ttip = self.main.createToolTipWidget( 'You might choose this option if you keep a full ' 'wallet on a non-internet-connected computer, and use this ' 'watching-only wallet on this computer to generate addresses ' 'and monitor incoming transactions.') layout.addWidget(ttip, 1, 1) slot = lambda b: self.edtOwnerString.setEnabled(not b) self.connect(self.chkIsMine, SIGNAL('toggled(bool)'), slot) layout.addWidget(QLabel('Wallet owner (optional):'), 3, 0) layout.addWidget(self.edtOwnerString, 3, 1) bbox = QDialogButtonBox(QDialogButtonBox.Ok | \ QDialogButtonBox.Cancel) self.connect(bbox, SIGNAL('accepted()'), self.accept) self.connect(bbox, SIGNAL('rejected()'), self.reject) layout.addWidget(bbox, 4, 0) self.setLayout(layout) self.setWindowTitle('Set Wallet Owner') def showRecvCoinsWarningIfNecessary(wlt, main): numTimesOnline = main.getSettingOrSetDefault("SyncSuccessCount", 0) if numTimesOnline < 1 and not TheBDM.getBDMState() == 'Offline': result = QMessageBox.warning(main, tr('Careful!'), tr(""" Armory is not online yet, and will eventually need to be online to access any funds sent to your wallet. Please do not receive Bitcoins to your Armory wallets until you have successfully gotten online at least one time.

Armory is still beta software, and some users report difficulty ever getting online.

Do you wish to continue?"""), QMessageBox.Cancel | QMessageBox.Ok) if not result == QMessageBox.Ok: return False wlttype = determineWalletType(wlt, main)[0] notMyWallet = (wlttype == WLTTYPES.WatchOnly) offlineWallet = (wlttype == WLTTYPES.Offline) dnaaPropName = 'Wallet_%s_%s' % (wlt.uniqueIDB58, 'DNAA_RecvOther') dnaaThisWallet = main.getSettingOrSetDefault(dnaaPropName, False) if notMyWallet and not dnaaThisWallet: result = MsgBoxWithDNAA(MSGBOX.Warning, 'This is not your wallet!', \ 'You are getting an address for a wallet that ' 'does not appear to belong to you. Any money sent to this ' 'address will not appear in your total balance, and cannot ' 'be spent from this computer.

' 'If this is actually your wallet (perhaps you maintain the full ' 'wallet on a separate computer), then please change the ' '"Belongs To" field in the wallet-properties for this wallet.', \ 'Do not show this warning again', wCancel=True) main.writeSetting(dnaaPropName, result[1]) return result[0] if offlineWallet and not dnaaThisWallet: result = MsgBoxWithDNAA(MSGBOX.Warning, 'This is not your wallet!', \ 'You are getting an address for a wallet that ' 'you have specified belongs to you, but you cannot actually ' 'spend the funds from this computer. This is usually the case when ' 'you keep the full wallet on a separate computer for security ' 'purposes.

' 'If this does not sound right, then please do not use the following ' 'address. Instead, change the wallet properties "Belongs To" field ' 'to specify that this wallet is not actually yours.', \ 'Do not show this warning again', wCancel=True) main.writeSetting(dnaaPropName, result[1]) return result[0] return True ################################################################################ class DlgKeypoolSettings(ArmoryDialog): """ Let the user manually adjust the keypool for this wallet """ def __init__(self, wlt, parent=None, main=None): super(DlgKeypoolSettings, self).__init__(parent, main) self.wlt = wlt self.addressesWereGenerated = False self.lblDescr = QRichLabel(\ 'Armory pre-computes a pool of addresses beyond the last address ' 'you have used, and keeps them in your wallet to "look-ahead." One ' 'reason it does this is in case you have restored this wallet from ' 'a backup, and Armory does not know how many addresses you have actually ' 'used. ' '

' 'If this wallet was restored from a backup and was very active after ' 'it was backed up, then it is possible Armory did not pre-compute ' 'enough addresses to find your entire balance. This condition is ' 'rare, but it can happen. You may extend the keypool manually, ' 'below.') self.lblAddrUsed = QRichLabel('Addresses used: ', doWrap=False) self.lblAddrComp = QRichLabel('Addresses computed: ', doWrap=False) self.lblAddrUsedVal = QRichLabel('%d' % max(0, self.wlt.highestUsedChainIndex)) self.lblAddrCompVal = QRichLabel('%d' % self.wlt.lastComputedChainIndex) self.lblNumAddr = QRichLabel('Compute this many more addresses: ') self.edtNumAddr = QLineEdit() self.edtNumAddr.setText('100') self.edtNumAddr.setMaximumWidth(relaxedSizeStr(self, '9999999')[0]) self.lblWarnSpeed = QRichLabel( 'Address computation is very slow. It may take up to one minute ' 'to compute 200-1000 addresses (system-dependent). Only generate ' 'as many as you think you need.') buttonBox = QDialogButtonBox() self.btnAccept = QPushButton("Compute") self.btnReject = QPushButton("Done") self.connect(self.btnAccept, SIGNAL(CLICKED), self.clickCompute) self.connect(self.btnReject, SIGNAL(CLICKED), self.reject) buttonBox.addButton(self.btnAccept, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnReject, QDialogButtonBox.RejectRole) frmLbl = makeVertFrame([self.lblAddrUsed, self.lblAddrComp ]) frmVal = makeVertFrame([self.lblAddrUsedVal, self.lblAddrCompVal]) subFrm1 = makeHorizFrame([STRETCH, frmLbl, frmVal, STRETCH], STYLE_SUNKEN) subFrm2 = makeHorizFrame([STRETCH, \ self.lblNumAddr, \ self.edtNumAddr, \ STRETCH], STYLE_SUNKEN) layout = QVBoxLayout() layout.addWidget(self.lblDescr) layout.addWidget(subFrm1) layout.addWidget(self.lblWarnSpeed) layout.addWidget(subFrm2) layout.addWidget(buttonBox) self.setLayout(layout) self.setWindowTitle('Extend Address Pool') ############################################################################# def reject(self): if self.addressesWereGenerated and not TheBDM.getBDMState() in ('Offline', 'Uninitialized'): QMessageBox.warning(self, 'Rescan Required', \ 'New addresses have been generated for your wallet, but their ' 'balances are not yet reflected on the main screen. You must ' 'initiate a blockchain rescan before this happens. Press the ' 'button on the dashboard to do a rescan, or simply restart Armory', \ QMessageBox.Ok) super(DlgKeypoolSettings, self).reject() ############################################################################# def clickCompute(self): # if TheBDM.getBDMState()=='Scanning': # QMessageBox.warning(self, 'Armory is Busy', \ # 'Armory is in the middle of a scan, and cannot add addresses to ' # 'any of its wallets until the scan is finished. Please wait until ' # 'the dashboard says that Armory is "online."', QMessageBox.Ok) # return err = False try: naddr = int(self.edtNumAddr.text()) except: err = True if err or naddr < 1: QMessageBox.critical(self, 'Invalid input', \ 'The value you entered is invalid. Please enter a positive ' 'number of addresses to generate.', QMessageBox.Ok) return if naddr >= 1000: confirm = QMessageBox.warning(self, 'Are you sure?', \ 'You have entered that you want to compute %d more addresses ' 'for this wallet. This operation will take a very long time, ' 'and Armory will become unresponsive until the computation is ' 'finished. Armory estimates it will take about %d minutes. ' '

Do you want to continue?' % (naddr, int(naddr / 750.)), \ QMessageBox.Yes | QMessageBox.No) if not confirm == QMessageBox.Yes: return cred = htmlColor('TextRed') self.lblAddrCompVal.setText('Calculating...' % \ cred) def doit(): currPool = self.wlt.lastComputedChainIndex - \ self.wlt.highestUsedChainIndex fillAddressPoolProgress = DlgProgress(self, self.main, HBar=1, Title='Computing New Addresses') fillAddressPoolProgress.exec_( \ self.wlt.fillAddressPool, currPool + naddr, isActuallyNew=False) self.lblAddrCompVal.setText('%d' % \ (cred, self.wlt.lastComputedChainIndex)) self.addressesWereGenerated = True self.main.forceNeedRescan = False # We use callLater so that we can let the screen redraw with "Calculating..." from twisted.internet import reactor reactor.callLater(0.1, doit) ################################################################################ class DlgNewAddressDisp(ArmoryDialog): """ We just generated a new address, let's show it to the user and let them a comment to it, if they want. """ def __init__(self, wlt, parent=None, main=None): super(DlgNewAddressDisp, self).__init__(parent, main) self.wlt = wlt self.addr = wlt.getNextUnusedAddress() addrStr = self.addr.getAddrStr() wlttype = determineWalletType(self.wlt, self.main)[0] notMyWallet = (wlttype == WLTTYPES.WatchOnly) offlineWallet = (wlttype == WLTTYPES.Offline) lblDescr = QLabel(\ 'The following address can be used to receive bitcoins:') self.edtNewAddr = QLineEdit() self.edtNewAddr.setReadOnly(True) self.edtNewAddr.setText(addrStr) self.edtNewAddr.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) btnClipboard = QPushButton('Copy to Clipboard') # lbtnClipboard.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) self.lblIsCopied = QLabel(' or ') self.lblIsCopied.setTextFormat(Qt.RichText) self.connect(btnClipboard, SIGNAL(CLICKED), self.setClipboard) def openPaymentRequest(): msgTxt = str(self.edtComm.toPlainText()) msgTxt = msgTxt.split('\n')[0][:128] dlg = DlgRequestPayment(self, self.main, addrStr, msg=msgTxt) dlg.exec_() btnLink = QPushButton('Create Clickable Link') self.connect(btnLink, SIGNAL(CLICKED), openPaymentRequest) tooltip1 = self.main.createToolTipWidget(\ 'You can securely use this address as many times as you want. ' 'However, all people to whom you give this address will ' 'be able to see the number and amount of bitcoins ever ' 'sent to it. Therefore, using a new address for each transaction ' 'improves overall privacy, but there is no security issues ' 'with reusing any address.') frmNewAddr = QFrame() frmNewAddr.setFrameStyle(STYLE_RAISED) frmNewAddrLayout = QGridLayout() frmNewAddrLayout.addWidget(lblDescr, 0, 0, 1, 2) frmNewAddrLayout.addWidget(self.edtNewAddr, 1, 0, 1, 1) frmNewAddrLayout.addWidget(tooltip1, 1, 1, 1, 1) if not notMyWallet: palette = QPalette() palette.setColor(QPalette.Base, Colors.TblWltMine) boldFont = self.edtNewAddr.font() boldFont.setWeight(QFont.Bold) self.edtNewAddr.setFont(boldFont) self.edtNewAddr.setPalette(palette); self.edtNewAddr.setAutoFillBackground(True); frmCopy = QFrame() frmCopy.setFrameShape(QFrame.NoFrame) frmCopyLayout = QHBoxLayout() frmCopyLayout.addStretch() frmCopyLayout.addWidget(btnClipboard) frmCopyLayout.addWidget(self.lblIsCopied) frmCopyLayout.addWidget(btnLink) frmCopyLayout.addStretch() frmCopy.setLayout(frmCopyLayout) frmNewAddrLayout.addWidget(frmCopy, 2, 0, 1, 2) frmNewAddr.setLayout(frmNewAddrLayout) lblCommDescr = QLabel(\ '(Optional) Add a label to this address, which will ' 'be shown with any relevant transactions in the ' '"Transactions" tab.') lblCommDescr.setWordWrap(True) self.edtComm = QTextEdit() tightHeight = tightSizeNChar(self.edtComm, 1)[1] self.edtComm.setMaximumHeight(tightHeight * 3.2) frmComment = QFrame() frmComment.setFrameStyle(STYLE_RAISED) frmCommentLayout = QGridLayout() frmCommentLayout.addWidget(lblCommDescr, 0, 0, 1, 2) frmCommentLayout.addWidget(self.edtComm, 1, 0, 2, 2) frmComment.setLayout(frmCommentLayout) lblRecvWlt = QRichLabel('Bitcoins sent to this address will ' 'appear in the wallet:', doWrap=False) lblRecvWlt.setWordWrap(True) lblRecvWlt.setAlignment(Qt.AlignHCenter | Qt.AlignTop) lblRecvWlt.setMinimumWidth(tightSizeStr(lblRecvWlt, lblRecvWlt.text())[0]) lblRecvWltID = QLabel(\ '"%s" (%s)' % (wlt.labelName, wlt.uniqueIDB58)) lblRecvWltID.setWordWrap(True) lblRecvWltID.setTextFormat(Qt.RichText) lblRecvWltID.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) buttonBox = QDialogButtonBox() self.btnDone = QPushButton("Done") self.connect(self.btnDone, SIGNAL(CLICKED), self.acceptNewAddr) buttonBox.addButton(self.btnDone, QDialogButtonBox.AcceptRole) frmWlt = QFrame() frmWlt.setFrameShape(STYLE_RAISED) frmWltLayout = QGridLayout() frmWltLayout.addWidget(lblRecvWlt) frmWltLayout.addWidget(lblRecvWltID) frmWlt.setLayout(frmWltLayout) qrdescr = QRichLabel('Scan QR code with phone or other barcode reader' '

(Double-click to expand)') qrdescr.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) qrcode = QRCodeWidget(addrStr, parent=self) smLabel = QRichLabel('%s' % addrStr) smLabel.setAlignment(Qt.AlignHCenter | Qt.AlignTop) frmQRsub2 = makeHorizFrame([STRETCH, qrcode, STRETCH ]) frmQRsub3 = makeHorizFrame([STRETCH, smLabel, STRETCH ]) frmQR = makeVertFrame([STRETCH, qrdescr, frmQRsub2, frmQRsub3, STRETCH ], STYLE_SUNKEN) layout = QGridLayout() layout.addWidget(frmNewAddr, 0, 0, 1, 1) layout.addWidget(frmComment, 2, 0, 1, 1) layout.addWidget(frmWlt, 3, 0, 1, 1) layout.addWidget(buttonBox, 4, 0, 1, 2) layout.addWidget(frmQR, 0, 1, 4, 1) self.setLayout(layout) self.setWindowTitle('New Receiving Address') self.setFocus() from twisted.internet import reactor if TheBDM.getBDMState()=='BlockchainReady': reactor.callLater(0.1, TheBDM.saveScrAddrHistories) try: self.parent.wltAddrModel.reset() except AttributeError: # Sometimes this is called from a dialog that doesn't have an addr model pass def acceptNewAddr(self): comm = str(self.edtComm.toPlainText()) if len(comm) > 0: self.wlt.setComment(self.addr.getAddr160(), comm) self.accept() def rejectNewAddr(self): # self.wlt.rewindHighestIndex(1) try: self.parent.reject() except AttributeError: pass self.reject() def setClipboard(self): clipb = QApplication.clipboard() clipb.clear() clipb.setText(self.addr.getAddrStr()) self.lblIsCopied.setText('Copied!') ############################################################################# class DlgImportAddress(ArmoryDialog): def __init__(self, wlt, parent=None, main=None): super(DlgImportAddress, self).__init__(parent, main) self.wlt = wlt lblImportLbl = QRichLabel('Enter:') self.radioImportOne = QRadioButton('One Key') self.radioImportMany = QRadioButton('Multiple Keys') btngrp = QButtonGroup(self) btngrp.addButton(self.radioImportOne) btngrp.addButton(self.radioImportMany) btngrp.setExclusive(True) self.radioImportOne.setChecked(True) self.connect(self.radioImportOne, SIGNAL(CLICKED), self.clickImportCount) self.connect(self.radioImportMany, SIGNAL(CLICKED), self.clickImportCount) frmTop = makeHorizFrame([lblImportLbl, self.radioImportOne, \ self.radioImportMany, STRETCH]) self.stackedImport = QStackedWidget() # Set up the single-key import widget lblDescrOne = QRichLabel('The key can either be imported into your wallet, ' 'or have its available balance "swept" to another address ' 'in your wallet. Only import private ' 'key data if you are absolutely sure that no one else ' 'has access to it. Otherwise, sweep it to get ' 'the funds out of it. All standard private-key formats ' 'are supported except for private keys created by ' 'Bitcoin-Qt version 0.6.0 and later (compressed).') lblPrivOne = QRichLabel('Private Key') self.edtPrivData = QLineEdit() self.edtPrivData.setMinimumWidth(tightSizeStr(self.edtPrivData, 'X' * 60)[0]) privTooltip = self.main.createToolTipWidget(\ 'Supported formats are any hexadecimal or Base58 ' 'representation of a 32-byte private key (with or ' 'without checksums), and mini-private-key format ' 'used on Casascius physical bitcoins. Private keys ' 'that use compressed public keys are not yet ' 'supported by Armory.') frmMid1 = makeHorizFrame([lblPrivOne, self.edtPrivData, privTooltip]) stkOne = makeVertFrame([HLINE(), lblDescrOne, frmMid1, STRETCH]) self.stackedImport.addWidget(stkOne) # Set up the multi-Sig import widget lblDescrMany = QRichLabel(\ 'Enter a list of private keys to be "swept" or imported. ' 'All standard private-key formats are supported. ') lblPrivMany = QRichLabel('Private Key List') lblPrivMany.setAlignment(Qt.AlignTop) ttipPrivMany = self.main.createToolTipWidget(\ 'One private key per line, in any standard format. ' 'Data may be copied directly from file the "Backup ' 'Individual Keys" dialog (all text on a line preceding ' 'the key data, separated by a colon, will be ignored).') self.txtPrivBulk = QTextEdit() w, h = tightSizeStr(self.edtPrivData, 'X' * 70) self.txtPrivBulk.setMinimumWidth(w) self.txtPrivBulk.setMinimumHeight(2.2 * h) self.txtPrivBulk.setMaximumHeight(4.2 * h) frmMid = makeHorizFrame([lblPrivMany, self.txtPrivBulk, ttipPrivMany]) stkMany = makeVertFrame([HLINE(), lblDescrMany, frmMid]) self.stackedImport.addWidget(stkMany) self.chkUseSP = QCheckBox(tr(""" This is from a backup with SecurePrint\xe2\x84\xa2""")) self.edtSecurePrint = QLineEdit() self.edtSecurePrint.setFont(GETFONT('Fixed',9)) self.edtSecurePrint.setEnabled(False) w, h = relaxedSizeStr(self.edtSecurePrint, 'X' * 12) self.edtSecurePrint.setMaximumWidth(w) def toggleSP(): if self.chkUseSP.isChecked(): self.edtSecurePrint.setEnabled(True) else: self.edtSecurePrint.setEnabled(False) self.chkUseSP.stateChanged.connect(toggleSP) frmSP = makeHorizFrame([self.chkUseSP, self.edtSecurePrint, 'Stretch']) #frmSP.setFrameStyle(STYLE_PLAIN) # Set up the Import/Sweep select frame # # Import option self.radioSweep = QRadioButton('Sweep any funds owned by these addresses ' 'into your wallet\n' 'Select this option if someone else gave you this key') self.radioImport = QRadioButton('Import these addresses to your wallet\n' 'Only select this option if you are positive ' 'that no one else has access to this key') # # Sweep option (only available when online) if TheBDM.getBDMState() == 'BlockchainReady': self.radioSweep = QRadioButton('Sweep any funds owned by this address ' 'into your wallet\n' 'Select this option if someone else gave you this key') self.radioSweep.setChecked(True) else: if TheBDM.getBDMState() in ('Offline', 'Uninitialized'): self.radioSweep = QRadioButton('Sweep any funds owned by this address ' 'into your wallet\n' '(Not available in offline mode)') elif TheBDM.getBDMState() == 'Scanning': self.radioSweep = QRadioButton(tr(""" Sweep any funds owned by this address into your wallet""")) self.radioImport.setChecked(True) self.radioSweep.setEnabled(False) sweepTooltip = self.main.createToolTipWidget(\ 'You should never add an untrusted key to your wallet. By choosing this ' 'option, you are only moving the funds into your wallet, but not the key ' 'itself. You should use this option for Casascius physical bitcoins.') importTooltip = self.main.createToolTipWidget(\ 'This option will make the key part of your wallet, meaning that it ' 'can be used to securely receive future payments. Never select this ' 'option for private keys that other people may have access to.') # Make sure that there can only be one selection btngrp = QButtonGroup(self) btngrp.addButton(self.radioSweep) btngrp.addButton(self.radioImport) btngrp.setExclusive(True) frmWarn = QFrame() frmWarn.setFrameStyle(QFrame.Box | QFrame.Plain) frmWarnLayout = QGridLayout() frmWarnLayout.addWidget(self.radioSweep, 0, 0, 1, 1) frmWarnLayout.addWidget(self.radioImport, 1, 0, 1, 1) frmWarnLayout.addWidget(sweepTooltip, 0, 1, 1, 1) frmWarnLayout.addWidget(importTooltip, 1, 1, 1, 1) frmWarn.setLayout(frmWarnLayout) buttonbox = QDialogButtonBox(QDialogButtonBox.Ok | \ QDialogButtonBox.Cancel) self.connect(buttonbox, SIGNAL('accepted()'), self.okayClicked) self.connect(buttonbox, SIGNAL('rejected()'), self.reject) layout = QVBoxLayout() layout.addWidget(frmTop) layout.addWidget(self.stackedImport) layout.addWidget(frmSP) layout.addWidget(frmWarn) layout.addWidget(buttonbox) self.setWindowTitle('Private Key Import') self.setLayout(layout) ############################################################################# def clickImportCount(self): isOne = self.radioImportOne.isChecked() if isOne: self.stackedImport.setCurrentIndex(0) else: self.stackedImport.setCurrentIndex(1) ############################################################################# def okayClicked(self): pwd = None if self.chkUseSP.isChecked(): SECPRINT = HardcodedKeyMaskParams() pwd = str(self.edtSecurePrint.text()).strip() self.edtSecurePrint.setText("") if len(pwd) < 9: QMessageBox.critical(self, 'Invalid Code', tr(""" You didn't enter a full SecurePrint\xe2\x84\xa2 code. This code is needed to decrypt your backup. If this backup is actually unencrypted and there is no code, then choose the appropriate backup type from the drop-down box"""), QMessageBox.Ok) return if not SECPRINT['FUNC_CHKPWD'](pwd): QMessageBox.critical(self, 'Bad Encryption Code', tr(""" The SecurePrint\xe2\x84\xa2 code you entered has an error in it. Note that the code is case-sensitive. Please verify you entered it correctly and try again."""), QMessageBox.Ok) return if self.radioImportOne.isChecked(): self.processUserString(pwd) else: self.processMultiSig(pwd) ############################################################################# def processUserString(self, pwd=None): theStr = str(self.edtPrivData.text()).strip().replace(' ', '') binKeyData, addr160, addrStr = '', '', '' try: binKeyData, keyType = parsePrivateKeyData(theStr) if pwd: SECPRINT = HardcodedKeyMaskParams() maskKey = SECPRINT['FUNC_KDF'](pwd) SBDbinKeyData = SECPRINT['FUNC_UNMASK'](SecureBinaryData(binKeyData), ekey=maskKey) binKeyData = SBDbinKeyData.toBinStr() SBDbinKeyData.destroy() zeroes32 = '\x00'*32 if binKeyData==zeroes32: QMessageBox.critical(self, tr('Invalid Private Key'), tr(""" You entered all zeros. This is not a valid private key!"""), QMessageBox.Ok) LOGERROR('User attempted import of private key 0x00*32') return if binary_to_int(binKeyData, BIGENDIAN) >= SECP256K1_ORDER: QMessageBox.critical(self, 'Invalid Private Key', \ 'The private key you have entered is actually not valid ' 'for the elliptic curve used by Bitcoin (secp256k1). ' 'Almost any 64-character hex is a valid private key ' 'except for those greater than: ' '

' 'fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141' '

' 'Please try a different private key.', QMessageBox.Ok) LOGERROR('User attempted import of invalid private key!') return addr160 = convertKeyDataToAddress(privKey=binKeyData) addrStr = hash160_to_addrStr(addr160) except InvalidHashError, e: QMessageBox.warning(self, 'Entry Error', 'The private key data you supplied appears to ' 'contain a consistency check. This consistency ' 'check failed. Please verify you entered the ' 'key data correctly.', QMessageBox.Ok) LOGERROR('Private key consistency check failed.') return except BadInputError, e: QMessageBox.critical(self, 'Invalid Data', 'Something went terribly ' 'wrong! (key data unrecognized)', QMessageBox.Ok) LOGERROR('Unrecognized key data!') return except CompressedKeyError, e: QMessageBox.critical(self, 'Unsupported key type', 'You entered a key ' 'for an address that uses a compressed public key, usually produced ' 'in Bitcoin-Qt/bitcoind wallets created after version 0.6.0. Armory ' 'does not yet support this key type.') LOGERROR('Compressed key data recognized but not supported') return except: QMessageBox.critical(self, 'Error Processing Key', \ 'There was an error processing the private key data. ' 'Please check that you entered it correctly', QMessageBox.Ok) LOGEXCEPT('Error processing the private key data') return if not 'mini' in keyType.lower(): reply = QMessageBox.question(self, 'Verify Address', \ 'The key data you entered appears to correspond to ' 'the following Bitcoin address:\n\n\t' + addrStr + '\n\nIs this the correct address?', QMessageBox.Yes | QMessageBox.No | QMessageBox.Cancel) if reply == QMessageBox.Cancel: return else: if reply == QMessageBox.No: binKeyData = binary_switchEndian(binKeyData) addr160 = convertKeyDataToAddress(privKey=binKeyData) addrStr = hash160_to_addrStr(addr160) reply = QMessageBox.question(self, 'Try Again', \ 'It is possible that the key was supplied in a ' '"reversed" form. When the data you provide is ' 'reversed, the following address is obtained:\n\n\t ' + addrStr + '\n\nIs this the correct address?', \ QMessageBox.Yes | QMessageBox.No) if reply == QMessageBox.No: binKeyData = '' return # Finally, let's add the address to the wallet, or sweep the funds if self.radioSweep.isChecked(): if self.wlt.hasAddr(addr160): result = QMessageBox.warning(self, 'Duplicate Address', \ 'The address you are trying to sweep is already part of this ' 'wallet. You can still sweep it to a new address, but it will ' 'have no effect on your overall balance (in fact, it might be ' 'negative if you have to pay a fee for the transfer)\n\n' 'Do you still want to sweep this key?', \ QMessageBox.Yes | QMessageBox.Cancel) if not result == QMessageBox.Yes: return else: wltID = self.main.getWalletForAddr160(addr160) if not wltID == '': addr = self.main.walletMap[wltID].addrMap[addr160] typ = 'Imported' if addr.chainIndex == -2 else 'Permanent' msg = ('The key you entered is already part of another wallet you ' 'are maintaining:' '

' 'Address: ' + addrStr + '
' 'Wallet ID: ' + wltID + '
' 'Wallet Name: ' + self.main.walletMap[wltID].labelName + '
' 'Address Type: ' + typ + '

' 'The sweep operation will simply move bitcoins out of the wallet ' 'above into this wallet. If the network charges a fee for this ' 'transaction, you balance will be reduced by that much.') result = QMessageBox.warning(self, 'Duplicate Address', msg, \ QMessageBox.Ok | QMessageBox.Cancel) if not result == QMessageBox.Ok: return # if not TheBDM.getBDMState()=='BlockchainReady': # reply = QMessageBox.critical(self, 'Cannot Sweep Address', \ # 'You need access to the Bitcoin network and the blockchain in order ' # 'to find the balance of this address and sweep its funds. ', \ # QMessageBox.Ok) # return # Create the address object for the addr to be swept sweepAddr = PyBtcAddress().createFromPlainKeyData(SecureBinaryData(binKeyData)) targAddr160 = self.wlt.getNextUnusedAddress().getAddr160() self.main.confirmSweepScan([sweepAddr], targAddr160) # Regardless of the user confirmation, we're done here self.accept() elif self.radioImport.isChecked(): if self.wlt.hasAddr(addr160): QMessageBox.critical(self, 'Duplicate Address', \ 'The address you are trying to import is already part of your ' 'wallet. Address cannot be imported', QMessageBox.Ok) return wltID = self.main.getWalletForAddr160(addr160) if not wltID == '': addr = self.main.walletMap[wltID].addrMap[addr160] typ = 'Imported' if addr.chainIndex == -2 else 'Permanent' msg = tr('The key you entered is already part of another wallet you own:' '

' 'Address: ' + addrStr + '
' 'Wallet ID: ' + wltID + '
' 'Wallet Name: ' + self.main.walletMap[wltID].labelName + '
' 'Address Type: ' + typ + '

' 'Armory cannot properly display balances or create transactions ' 'when the same address is in multiple wallets at once. ') if typ == 'Imported': QMessageBox.critical(self, 'Duplicate Addresses', \ msg + 'To import this address to this wallet, please remove it from the ' 'other wallet, then try the import operation again.', QMessageBox.Ok) else: QMessageBox.critical(self, 'Duplicate Addresses', \ msg + 'Additionally, this address is mathematically linked ' 'to its wallet (permanently) and cannot be deleted or ' 'imported to any other wallet. The import operation cannot ' 'continue.', QMessageBox.Ok) return if self.wlt.useEncryption and self.wlt.isLocked: dlg = DlgUnlockWallet(self.wlt, self, self.main, 'Encrypt New Address') if not dlg.exec_(): reply = QMessageBox.critical(self, 'Wallet is locked', 'New private key data cannot be imported unless the wallet is ' 'unlocked. Please try again when you have the passphrase.', \ QMessageBox.Ok) return self.wlt.importExternalAddressData(privKey=SecureBinaryData(binKeyData)) self.main.statusBar().showMessage('Successful import of address ' \ + addrStr + ' into wallet ' + self.wlt.uniqueIDB58, 10000) ####################################################################### if TheBDM.getBDMState() == 'BlockchainReady': nblk = TheBDM.numBlocksToRescan(self.wlt.cppWallet, wait=True) if nblk < 2016: self.wlt.syncWithBlockchain(0) QMessageBox.information(self, 'Import Successful', \ 'The address was imported into your wallet successfully, and ' 'all the information needed to acquire its balance was already ' 'available without rescanning the global transaction history. ' 'The address will appear in the address list of this wallet.', \ QMessageBox.Ok) else: doRescanNow = QMessageBox.question(self, 'Rescan Needed', \ 'The address was imported successfully, but your wallet balance ' 'will be incorrect until the global transaction history is ' 'searched for previous transactions. Armory must go into offline ' 'mode for a several minutes while this scan is performed.' '

' 'Would you like to do the scan now? Pressing "No" will allow ' 'you to stay in online mode, but your balances may be incorrect ' 'until you press the rescan button on the dashboard, or restart ' 'Armory.', QMessageBox.Yes | QMessageBox.No) if doRescanNow == QMessageBox.Yes: LOGINFO('User requested rescan immediately after import') self.main.startRescanBlockchain() else: LOGINFO('User requested no rescan after import. Should be dirty.') self.main.setDashboardDetails() ####################################################################### elif TheBDM.getBDMState() == 'Scanning': warnMsg = (\ 'The address was imported successfully, but your wallet balance ' 'will be incorrect until the global transaction history is ' 'searched for previous transactions. Armory is currently in the ' 'middle of a blockchain scan, but it will start another scan as ' 'soon as this one is complete. Wallet and address balances will ' 'not be available until these operations are completed.', \ QMessageBox.Ok) self.main.startRescanBlockchain() self.main.setDashboardDetails() self.main.walletListChanged() try: self.parent.wltAddrModel.reset() except: pass self.accept() ############################################################################# def processMultiSig(self, pwd=None): thisWltID = self.wlt.uniqueIDB58 inputText = str(self.txtPrivBulk.toPlainText()) inputLines = [s.strip().replace(' ', '') for s in inputText.split('\n')] binKeyData, addr160, addrStr = '', '', '' if pwd: SECPRINT = HardcodedKeyMaskParams() maskKey = SECPRINT['FUNC_KDF'](pwd) privKeyList = [] addrSet = set() nLines = 0 for line in inputLines: if 'PublicX' in line or 'PublicY' in line: continue lineend = line.split(':')[-1] try: nLines += 1 binKeyData = SecureBinaryData(parsePrivateKeyData(lineend)[0]) if pwd: binKeyData = SECPRINT['FUNC_UNMASK'](binKeyData, ekey=maskKey) addr160 = convertKeyDataToAddress(privKey=binKeyData.toBinStr()) if not addr160 in addrSet: addrSet.add(addr160) addrStr = hash160_to_addrStr(addr160) privKeyList.append([addr160, addrStr, binKeyData]) except: LOGWARN('Key line skipped, probably not a private key (key not shown for security)') continue if len(privKeyList) == 0: if nLines > 1: QMessageBox.critical(self, 'Invalid Data', \ 'No valid private key data was entered.', QMessageBox.Ok) return # privKeyList now contains: # [ [A160, AddrStr, Priv], # [A160, AddrStr, Priv], # [A160, AddrStr, Priv], ... ] # Determine if any addresses are already part of some wallets addr_to_wltID = lambda a: self.main.getWalletForAddr160(a) allWltList = [ [addr_to_wltID(k[0]), k[1]] for k in privKeyList] # allWltList is now [ [WltID, AddrStr], [WltID, AddrStr], ... ] if self.radioSweep.isChecked(): ##### SWEEPING ##### dupeWltList = filter(lambda a: len(a[0]) > 0, allWltList) if len(dupeWltList) > 0: reply = QMessageBox.critical(self, 'Duplicate Addresses!', \ 'You are attempting to sweep %d addresses, but %d of them ' 'are already part of existing wallets. That means that some or ' 'all of the bitcoins you sweep may already be owned by you. ' '

' 'Would you like to continue anyway?' % \ (len(allWltList), len(dupeWltList)), \ QMessageBox.Ok | QMessageBox.Cancel) if reply == QMessageBox.Cancel: return cppWlt = Cpp.BtcWallet() for addr160, addrStr, SecurePriv in privKeyList: cppWlt.addScrAddress_1_(Hash160ToScrAddr(addr160)) # If we got here, let's go ahead and sweep! addrList = [] for addr160, addrStr, SecurePriv in privKeyList: pyAddr = PyBtcAddress().createFromPlainKeyData(SecurePriv) addrList.append(pyAddr) targAddr160 = self.wlt.getNextUnusedAddress().getAddr160() self.main.confirmSweepScan(addrList, targAddr160) else: ##### IMPORTING ##### # allWltList is [ [WltID, AddrStr], [WltID, AddrStr], ... ] # Warn about addresses that would be duplicates. # Addresses already in the selected wallet will simply be skipped, no # need to do anything about that -- only addresses that would appear in # two wlts if we were to continue. dupeWltList = filter(lambda a: (len(a[0]) > 0 and a[0] != thisWltID), allWltList) if len(dupeWltList) > 0: dupeAddrStrList = [d[1] for d in dupeWltList] dlg = DlgDuplicateAddr(dupeAddrStrList, self, self.main) if not dlg.exec_(): return privKeyList = filter(lambda x: (x[1] not in dupeAddrStrList), privKeyList) # Confirm import addrStrList = [k[1] for k in privKeyList] dlg = DlgConfirmBulkImport(addrStrList, thisWltID, self, self.main) if not dlg.exec_(): return if self.wlt.useEncryption and self.wlt.isLocked: # Target wallet is encrypted... unlockdlg = DlgUnlockWallet(self.wlt, self, self.main, 'Unlock Wallet to Import') if not unlockdlg.exec_(): QMessageBox.critical(self, 'Wallet is Locked', \ 'Cannot import private keys without unlocking wallet!', \ QMessageBox.Ok) return nTotal = 0 nImport = 0 nAlready = 0 nError = 0 for addr160, addrStr, sbdKey in privKeyList: nTotal += 1 try: if not self.main.getWalletForAddr160(addr160) == thisWltID: self.wlt.importExternalAddressData(privKey=sbdKey) nImport += 1 else: nAlready += 1 except Exception, msg: # print '***ERROR importing:', addrStr # print ' Error Msg:', msg # nError += 1 LOGERROR('Problem importing: %s: %s', addrStr, msg) raise if nAlready == nTotal: MsgBoxCustom(MSGBOX.Warning, 'Nothing Imported!', 'All addresses ' 'chosen to be imported are already part of this wallet. ' 'Nothing was imported.') return elif nImport == 0 and nTotal > 0: MsgBoxCustom(MSGBOX.Error, 'Error!', tr(""" Failed: No addresses could be imported. Please check the logfile (ArmoryQt.exe.log) or the console output for information about why it failed (and email support@bitcoinarmory.com for help fixing the problem). """)) return else: if nError == 0: if nAlready > 0: MsgBoxCustom(MSGBOX.Good, 'Success!', \ 'Success: %d private keys were imported into your wallet. ' '

' 'The other %d private keys were skipped, because they were ' 'already part of your wallet.' % (nImport, nAlready)) else: MsgBoxCustom(MSGBOX.Good, 'Success!', \ 'Success: %d private keys were imported into your wallet.' % nImport) else: MsgBoxCustom(MSGBOX.Warning, 'Partial Success!', \ '%d private keys were imported into your wallet, but there were ' 'also %d addresses that could not be imported (see console ' 'or log file for more information). It is safe to try this ' 'operation again: all addresses previously imported will be ' 'skipped.' % (nImport, nError)) ####################################################################### if TheBDM.getBDMState() == 'BlockchainReady': nblk = TheBDM.numBlocksToRescan(self.wlt.cppWallet, wait=True) if nblk < 2016: self.wlt.syncWithBlockchain(0) QMessageBox.information(self, 'Import Successful', \ 'The addresses were imported into your wallet successfully, and ' 'all the information needed to acquire their balances were already ' 'available without executing a rescan. ' 'The address will appear in the address list of this wallet.', \ QMessageBox.Ok) else: doRescanNow = QMessageBox.question(self, 'Rescan Needed', \ 'The addresses were imported successfully, but your wallet balance ' 'will be incorrect until the global transaction history is ' 'searched for previous transactions. Armory must go into offline ' 'mode for a several minutes while this scan is performed.' '

' 'Would you like to do the scan now? Pressing "No" will allow ' 'you to stay in online mode, but your balances may be incorrect ' 'until you press the rescan button on the dashboard, or restart ' 'Armory', QMessageBox.Yes | QMessageBox.No) if doRescanNow == QMessageBox.Yes: LOGINFO('User requested rescan immediately after import') self.main.startRescanBlockchain() else: LOGINFO('User requested no rescan after import. Should be dirty.') self.main.setDashboardDetails() ####################################################################### elif TheBDM.getBDMState() == 'Scanning': warnMsg = tr(\ 'The addresses were imported successfully, but your wallet balance ' 'will be incorrect until the global transaction history is ' 'searched for previous transactions. Armory is currently in the ' 'middle of a blockchain scan, but it will start another scan as ' 'soon as this one is complete. Wallet and address balances will ' 'not be available until these operations are completed.', \ QMessageBox.Ok) self.main.startRescanBlockchain() self.main.setDashboardDetails() try: self.main.walletListChanged() except: pass try: self.parent.wltAddrModel.reset() except AttributeError: pass self.accept() ############################################################################# class DlgVerifySweep(ArmoryDialog): def __init__(self, inputStr, outputStr, outVal, fee, parent=None, main=None): super(DlgVerifySweep, self).__init__(parent, main) lblQuestion = QRichLabel(\ 'You are about to sweep all funds from the specified address ' 'to your wallet. Please confirm the action:') outStr = coin2str(outVal, maxZeros=2) feeStr = ('') if (fee == 0) else ('(Fee: %s)' % coin2str(fee, maxZeros=0)) frm = QFrame() frm.setFrameStyle(STYLE_RAISED) frmLayout = QGridLayout() # frmLayout.addWidget(QRichLabel('Funds will be swept...'), 0,0, 1,2) frmLayout.addWidget(QRichLabel(' From ' + inputStr, doWrap=False), 1, 0, 1, 2) frmLayout.addWidget(QRichLabel(' To ' + outputStr, doWrap=False), 2, 0, 1, 2) frmLayout.addWidget(QRichLabel(' Total %s BTC %s' % (outStr, feeStr), doWrap=False), 3, 0, 1, 2) frm.setLayout(frmLayout) lblFinalConfirm = QLabel('Are you sure you want to execute this transaction?') bbox = QDialogButtonBox(QDialogButtonBox.Ok | \ QDialogButtonBox.Cancel) self.connect(bbox, SIGNAL('accepted()'), self.accept) self.connect(bbox, SIGNAL('rejected()'), self.reject) lblWarnImg = QLabel() lblWarnImg.setPixmap(QPixmap(':/MsgBox_warning48.png')) lblWarnImg.setAlignment(Qt.AlignHCenter | Qt.AlignTop) layout = QHBoxLayout() layout.addWidget(lblWarnImg) layout.addWidget(makeLayoutFrame(VERTICAL, [lblQuestion, frm, lblFinalConfirm, bbox])) self.setLayout(layout) self.setWindowTitle('Confirm Sweep') ############################################################################## class DlgConfirmBulkImport(ArmoryDialog): def __init__(self, addrList, wltID, parent=None, main=None): super(DlgConfirmBulkImport, self).__init__(parent, main) self.wltID = wltID if len(addrList) == 0: QMessageBox.warning(self, 'No Addresses to Import', \ 'There are no addresses to import!', QMessageBox.Ok) self.reject() walletDescr = 'a new wallet' if not wltID == None: wlt = self.main.walletMap[wltID] walletDescr = 'wallet, %s (%s)' % (wltID, wlt.labelName) lblDescr = QRichLabel(\ 'You are about to import %d addresses into %s.

' 'The following is a list of addresses to be imported:' % \ (len(addrList), walletDescr)) fnt = GETFONT('Fixed', 10) w, h = tightSizeNChar(fnt, 100) txtDispAddr = QTextEdit() txtDispAddr.setFont(fnt) txtDispAddr.setReadOnly(True) txtDispAddr.setMinimumWidth(min(w, 700)) txtDispAddr.setMinimumHeight(16.2 * h) txtDispAddr.setText('\n'.join(addrList)) buttonBox = QDialogButtonBox() self.btnAccept = QPushButton("Import") self.btnReject = QPushButton("Cancel") self.connect(self.btnAccept, SIGNAL(CLICKED), self.accept) self.connect(self.btnReject, SIGNAL(CLICKED), self.reject) buttonBox.addButton(self.btnAccept, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnReject, QDialogButtonBox.RejectRole) dlgLayout = QVBoxLayout() dlgLayout.addWidget(lblDescr) dlgLayout.addWidget(txtDispAddr) dlgLayout.addWidget(buttonBox) self.setLayout(dlgLayout) self.setWindowTitle('Confirm Import') self.setWindowIcon(QIcon(self.main.iconfile)) ############################################################################# class DlgDuplicateAddr(ArmoryDialog): def __init__(self, addrList, wlt, parent=None, main=None): super(DlgDuplicateAddr, self).__init__(parent, main) self.wlt = wlt self.doCancel = True self.newOnly = False if len(addrList) == 0: QMessageBox.warning(self, 'No Addresses to Import', \ 'There are no addresses to import!', QMessageBox.Ok) self.reject() lblDescr = QRichLabel(\ 'Duplicate addresses detected! The following ' 'addresses already exist in other Armory wallets:' % htmlColor('TextWarn')) fnt = GETFONT('Fixed', 8) w, h = tightSizeNChar(fnt, 50) txtDispAddr = QTextEdit() txtDispAddr.setFont(fnt) txtDispAddr.setReadOnly(True) txtDispAddr.setMinimumWidth(w) txtDispAddr.setMinimumHeight(8.2 * h) txtDispAddr.setText('\n'.join(addrList)) lblWarn = QRichLabel(\ 'Duplicate addresses cannot be imported. If you continue, ' 'the addresses above will be ignored, and only new addresses ' 'will be imported to this wallet.') buttonBox = QDialogButtonBox() self.btnContinue = QPushButton("Continue") self.btnCancel = QPushButton("Cancel") self.connect(self.btnContinue, SIGNAL(CLICKED), self.accept) self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) buttonBox.addButton(self.btnContinue, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) dlgLayout = QVBoxLayout() dlgLayout.addWidget(lblDescr) dlgLayout.addWidget(txtDispAddr) dlgLayout.addWidget(lblWarn) dlgLayout.addWidget(buttonBox) self.setLayout(dlgLayout) self.setWindowTitle('Duplicate Addresses') ############################################################################# class DlgAddressInfo(ArmoryDialog): def __init__(self, wlt, addr160, parent=None, main=None, mode=None): super(DlgAddressInfo, self).__init__(parent, main) self.wlt = wlt self.addr = self.wlt.getAddrByHash160(addr160) self.addrLedger = wlt.getAddrTxLedger(addr160) self.addrLedger2 = [[wlt.uniqueIDB58, le] for le in self.addrLedger] self.ledgerTable = self.main.convertLedgerToTable(self.addrLedger2) self.ledgerTable.sort(key=lambda x: x[LEDGERCOLS.UnixTime]) self.mode = mode if mode == None: if main == None: self.mode = USERMODE.Standard else: self.mode = self.main.usermode dlgLayout = QGridLayout() cppAddr = self.wlt.cppWallet.getScrAddrObjByKey(Hash160ToScrAddr(addr160)) addrStr = self.addr.getAddrStr() lblDescr = QLabel('Information for address: ' + addrStr) frmInfo = QFrame() frmInfo.setFrameStyle(STYLE_RAISED) frmInfoLayout = QGridLayout() lbls = [] # Hash160 if mode in (USERMODE.Advanced, USERMODE.Expert): bin25 = base58_to_binary(addrStr) lbls.append([]) lbls[-1].append(self.main.createToolTipWidget(\ 'This is the computer-readable form of the address')) lbls[-1].append(QRichLabel('Public Key Hash')) h160Str = binary_to_hex(bin25[1:-4]) if mode == USERMODE.Expert: network = binary_to_hex(bin25[:1 ]) hash160 = binary_to_hex(bin25[ 1:-4 ]) addrChk = binary_to_hex(bin25[ -4:]) h160Str += '%s (Network: %s / Checksum: %s)' % (hash160, network, addrChk) lbls[-1].append(QLabel(h160Str)) lbls.append([]) lbls[-1].append(QLabel('')) lbls[-1].append(QRichLabel('Address:')) lbls[-1].append(QLabel(addrStr)) lbls.append([]) lbls[-1].append(self.main.createToolTipWidget( 'Address type is either Imported or Permanent. ' 'Permanent ' 'addresses are part of base wallet, and are protected by printed ' 'paper backups, regardless of when the backup was performed. ' 'Imported addresses are only protected by digital backups, or manually ' 'printing the individual keys list, and only if it was backed up ' 'after the keys were imported.')) lbls[-1].append(QRichLabel('Address Type:')) if self.addr.chainIndex == -2: lbls[-1].append(QLabel('Imported')) else: lbls[-1].append(QLabel('Permanent')) # Current Balance of address lbls.append([]) lbls[-1].append(self.main.createToolTipWidget( 'This is the current spendable balance of this address, ' 'not including zero-confirmation transactions from others.')) lbls[-1].append(QRichLabel('Current Balance')) balCoin = cppAddr.getSpendableBalance(self.main.currBlockNum, IGNOREZC) balStr = coin2str(balCoin, maxZeros=1) if balCoin > 0: goodColor = htmlColor('MoneyPos') lbls[-1].append(QRichLabel(\ '' + balStr.strip() + ' BTC')) else: lbls[-1].append(QRichLabel(balStr.strip() + ' BTC')) # Number of transactions txHashes = set() for le in self.addrLedger: txHashes.add(le.getTxHash()) lbls.append([]) lbls[-1].append(self.main.createToolTipWidget( 'The total number of transactions in which this address was involved')) lbls[-1].append(QRichLabel('Transaction Count:')) lbls[-1].append(QLabel(str(len(txHashes)))) for i in range(len(lbls)): for j in range(1, 3): lbls[i][j].setTextInteractionFlags(Qt.TextSelectableByMouse | \ Qt.TextSelectableByKeyboard) for j in range(3): if (i, j) == (0, 2): frmInfoLayout.addWidget(lbls[i][j], i, j, 1, 2) else: frmInfoLayout.addWidget(lbls[i][j], i, j, 1, 1) qrcode = QRCodeWidget(addrStr, 80, parent=self) qrlbl = QRichLabel('Double-click to inflate') frmqr = makeVertFrame([qrcode, qrlbl]) frmInfoLayout.addWidget(frmqr, 0, 4, len(lbls), 1) frmInfo.setLayout(frmInfoLayout) dlgLayout.addWidget(frmInfo, 0, 0, 1, 1) # ## Set up the address ledger self.ledgerModel = LedgerDispModelSimple(self.ledgerTable, self, self.main) self.ledgerView = QTableView() self.ledgerView.setModel(self.ledgerModel) self.ledgerView.setItemDelegate(LedgerDispDelegate(self)) self.ledgerView.hideColumn(LEDGERCOLS.isOther) self.ledgerView.hideColumn(LEDGERCOLS.UnixTime) self.ledgerView.hideColumn(LEDGERCOLS.WltID) self.ledgerView.hideColumn(LEDGERCOLS.WltName) self.ledgerView.hideColumn(LEDGERCOLS.TxHash) self.ledgerView.hideColumn(LEDGERCOLS.isCoinbase) self.ledgerView.hideColumn(LEDGERCOLS.toSelf) self.ledgerView.hideColumn(LEDGERCOLS.DoubleSpend) self.ledgerView.setSelectionBehavior(QTableView.SelectRows) self.ledgerView.setSelectionMode(QTableView.SingleSelection) self.ledgerView.horizontalHeader().setStretchLastSection(True) self.ledgerView.verticalHeader().setDefaultSectionSize(20) self.ledgerView.verticalHeader().hide() self.ledgerView.setMinimumWidth(650) dateWidth = tightSizeStr(self.ledgerView, '_9999-Dec-99 99:99pm__')[0] initialColResize(self.ledgerView, [20, 0, dateWidth, 72, 0, 0.45, 0.3]) ttipLedger = self.main.createToolTipWidget(\ 'Unlike the wallet-level ledger, this table shows every ' 'transaction input and output as a separate entry. ' 'Therefore, there may be multiple entries for a single transaction, ' 'which will happen if money was sent-to-self (explicitly, or as ' 'the change-back-to-self address).') lblLedger = QLabel('All Address Activity:') lblstrip = makeLayoutFrame(HORIZONTAL, [lblLedger, ttipLedger, STRETCH]) frmLedger = makeLayoutFrame(VERTICAL, [lblstrip, self.ledgerView]) dlgLayout.addWidget(frmLedger, 1, 0, 1, 1) # Now add the right-hand-side option buttons lbtnCopyAddr = QLabelButton('Copy Address to Clipboard') lbtnViewKeys = QLabelButton('View Address Keys') # lbtnSweepA = QLabelButton('Sweep Address') lbtnDelete = QLabelButton('Delete Address') self.connect(lbtnCopyAddr, SIGNAL(CLICKED), self.copyAddr) self.connect(lbtnViewKeys, SIGNAL(CLICKED), self.viewKeys) # self.connect(lbtnSweepA, SIGNAL(CLICKED), self.sweepAddr) self.connect(lbtnDelete, SIGNAL(CLICKED), self.deleteAddr) optFrame = QFrame() optFrame.setFrameStyle(STYLE_SUNKEN) hasPriv = self.addr.hasPrivKey() adv = (self.main.usermode in (USERMODE.Advanced, USERMODE.Expert)) watch = self.wlt.watchingOnly self.lblCopied = QRichLabel('') self.lblCopied.setMinimumHeight(tightSizeNChar(self.lblCopied, 1)[1]) self.lblLedgerWarning = QRichLabel(\ 'NOTE: The ledger shows each transaction input and ' 'output for this address. There are typically many ' 'inputs and outputs for each transaction, therefore the entries ' 'represent only partial transactions. Do not worry if these entries ' 'do not look familiar.') optLayout = QVBoxLayout() if True: optLayout.addWidget(lbtnCopyAddr) if adv: optLayout.addWidget(lbtnViewKeys) # if not watch: optLayout.addWidget(lbtnSweepA) # if adv: optLayout.addWidget(lbtnDelete) if True: optLayout.addStretch() if True: optLayout.addWidget(self.lblCopied) optLayout.addWidget(self.lblLedgerWarning) optLayout.addStretch() optFrame.setLayout(optLayout) rightFrm = makeLayoutFrame(VERTICAL, [QLabel('Available Actions:'), optFrame]) dlgLayout.addWidget(rightFrm, 0, 1, 2, 1) btnGoBack = QPushButton('<<< Go Back') self.connect(btnGoBack, SIGNAL(CLICKED), self.reject) bottomStrip = makeLayoutFrame(HORIZONTAL, [btnGoBack, STRETCH]) dlgLayout.addWidget(bottomStrip, 2, 0, 1, 2) self.setLayout(dlgLayout) self.setWindowTitle('Address Information') def copyAddr(self): clipb = QApplication.clipboard() clipb.clear() clipb.setText(self.addr.getAddrStr()) self.lblCopied.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) self.lblCopied.setText('Copied!') def makePaper(self): pass def viewKeys(self): if self.wlt.useEncryption and self.wlt.isLocked: unlockdlg = DlgUnlockWallet(self.wlt, self, self.main, 'View Private Keys') if not unlockdlg.exec_(): QMessageBox.critical(self, 'Wallet is Locked', \ 'Key information will not include the private key data.', \ QMessageBox.Ok) addr = self.addr.copy() dlg = DlgShowKeys(addr, self, self.main) dlg.exec_() def sweepAddr(self): # This is broken, and I don't feel like fixing it because it's not very # useful. Maybe some time in the future it will be resolved. return """ if self.wlt.useEncryption and self.wlt.isLocked: unlockdlg = DlgUnlockWallet(self.wlt, self, self.main, 'Sweep Address') if not unlockdlg.exec_(): QMessageBox.critical(self, 'Wallet is Locked', \ 'Cannot sweep an address while its keys are locked.', \ QMessageBox.Ok) return addrToSweep = self.addr.copy() targAddr160 = self.wlt.getNextUnusedAddress().getAddr160() ####################################################################### # This is the part that may take a while. Verify user will wait! # The sync/confirm call guarantees that the next sync call will # return instantaneously with the correct answer. This only stops # being true when more addresses or wallets are imported. if not self.main.BDM_SyncAddressList_Confirm(addrToSweep): return ####################################################################### finishedTx, outVal, fee = self.main.createSweepAddrTx(addrToSweep, targAddr160) if outVal<=fee: QMessageBox.critical(self, 'Cannot sweep',\ 'You cannot sweep the funds from this address, because the ' 'transaction fee would be equal to or greater than the amount ' 'swept.', QMessageBox.Ok) return if outVal==0: #print 'NO FUNDS' QMessageBox.critical(self, 'Nothing to do', \ 'This address does not contain any funds. There is nothing to sweep.', \ QMessageBox.Ok) return QMessageBox.information(self, 'Sweep Address Funds', \ 'Sweeping an address will transfer all funds from the selected ' 'address to another address in your wallet. This action is not normally ' 'necessary because it is rare for one address in a wallet to be compromised ' 'but not the others. \n\n' 'If you believe that your entire wallet has been compromised, ' 'you should instead send all the funds from this wallet to another address ' 'or wallet.', QMessageBox.Ok) # Finally, if we got here, we're ready to broadcast! dispIn = 'address %s' % addrToSweep.getAddrStr() dispOut = 'wallet "%s" (%s) ' % (self.wlt.labelName, self.wlt.uniqueIDB58) if DlgVerifySweep(dispIn, dispOut, outVal, fee).exec_(): self.main.broadcastTransaction(finishedTx, dryRun=False) """ def deleteAddr(self): pass ############################################################################# class DlgShowKeys(ArmoryDialog): def __init__(self, addr, parent=None, main=None): super(DlgShowKeys, self).__init__(parent, main) self.addr = addr lblWarn = QRichLabel('') plainPriv = False if addr.binPrivKey32_Plain.getSize() > 0: plainPriv = True lblWarn = QRichLabel(\ 'Warning: the unencrypted private keys ' 'for this address are shown below. They are "private" because ' 'anyone who obtains them can spend the money held ' 'by this address. Please protect this information the ' 'same as you protect your wallet.' % htmlColor('TextWarn')) warnFrm = makeLayoutFrame(HORIZONTAL, [lblWarn]) endianness = self.main.getSettingOrSetDefault('PrefEndian', BIGENDIAN) estr = 'BE' if endianness == BIGENDIAN else 'LE' def formatBinData(binStr, endian=LITTLEENDIAN): binHex = binary_to_hex(binStr) if endian != LITTLEENDIAN: binHex = hex_switchEndian(binHex) binHexPieces = [binHex[i:i + 8] for i in range(0, len(binHex), 8)] return ' '.join(binHexPieces) lblDescr = QRichLabel('Key Data for address: %s' % self.addr.getAddrStr()) lbls = [] # lbls.append([]) # lbls[-1].append(QLabel('')) # lbls[-1].append(QRichLabel('Address:')) # lbls[-1].append(QLabel(addr.getAddrStr())) lbls.append([]) binKey = self.addr.binPrivKey32_Plain.toBinStr() lbls[-1].append(self.main.createToolTipWidget(\ 'The raw form of the private key for this address. It is ' '32-bytes of randomly generated data')) lbls[-1].append(QRichLabel('Private Key (hex,%s):' % estr)) if not addr.hasPrivKey(): lbls[-1].append(QRichLabel('[[ No Private Key in Watching-Only Wallet ]]')) elif plainPriv: lbls[-1].append(QLabel(formatBinData(binKey))) else: lbls[-1].append(QRichLabel('[[ ENCRYPTED ]]')) if plainPriv: lbls.append([]) lbls[-1].append(self.main.createToolTipWidget(\ 'This is a more compact form of the private key, and includes ' 'a checksum for error detection.')) lbls[-1].append(QRichLabel('Private Key (Base58):')) b58Key = encodePrivKeyBase58(binKey) lbls[-1].append(QLabel(' '.join([b58Key[i:i + 6] for i in range(0, len(b58Key), 6)]))) lbls.append([]) lbls[-1].append(self.main.createToolTipWidget(\ 'The raw public key data. This is the X-coordinate of ' 'the Elliptic-curve public key point.')) lbls[-1].append(QRichLabel('Public Key X (%s):' % estr)) lbls[-1].append(QRichLabel(formatBinData(self.addr.binPublicKey65.toBinStr()[1:1 + 32]))) lbls.append([]) lbls[-1].append(self.main.createToolTipWidget(\ 'The raw public key data. This is the Y-coordinate of ' 'the Elliptic-curve public key point.')) lbls[-1].append(QRichLabel('Public Key Y (%s):' % estr)) lbls[-1].append(QRichLabel(formatBinData(self.addr.binPublicKey65.toBinStr()[1 + 32:1 + 32 + 32]))) bin25 = base58_to_binary(self.addr.getAddrStr()) network = binary_to_hex(bin25[:1 ]) hash160 = binary_to_hex(bin25[ 1:-4 ]) addrChk = binary_to_hex(bin25[ -4:]) h160Str = '%s (Network: %s / Checksum: %s)' % (hash160, network, addrChk) lbls.append([]) lbls[-1].append(self.main.createToolTipWidget(\ 'This is the hexadecimal version if the address string')) lbls[-1].append(QRichLabel('Public Key Hash:')) lbls[-1].append(QLabel(h160Str)) frmKeyData = QFrame() frmKeyData.setFrameStyle(STYLE_RAISED) frmKeyDataLayout = QGridLayout() # Now set the label properties and jam them into an information frame for row, lbl3 in enumerate(lbls): lbl3[1].setFont(GETFONT('Var')) lbl3[2].setFont(GETFONT('Fixed')) lbl3[2].setTextInteractionFlags(Qt.TextSelectableByMouse | \ Qt.TextSelectableByKeyboard) lbl3[2].setWordWrap(False) for j in range(3): frmKeyDataLayout.addWidget(lbl3[j], row, j) frmKeyData.setLayout(frmKeyDataLayout) bbox = QDialogButtonBox(QDialogButtonBox.Ok) self.connect(bbox, SIGNAL('accepted()'), self.accept) dlgLayout = QVBoxLayout() dlgLayout.addWidget(lblWarn) dlgLayout.addWidget(lblDescr) dlgLayout.addWidget(frmKeyData) dlgLayout.addWidget(bbox) self.setLayout(dlgLayout) self.setWindowTitle('Address Key Information') ############################################################################# class DlgEULA(ArmoryDialog): def __init__(self, parent=None, main=None): super(DlgEULA, self).__init__(parent, main) txtWidth, txtHeight = tightSizeNChar(self, 110) txtLicense = QTextEdit() txtLicense.sizeHint = lambda: QSize(txtWidth, 14 * txtHeight) txtLicense.setReadOnly(True) txtLicense.setCurrentFont(GETFONT('Fixed', 8)) from LICENSE import licenseText txtLicense.setText(licenseText()) self.chkAgree = QCheckBox('I agree to all the terms of the license above') self.btnCancel = QPushButton("Cancel") self.btnAccept = QPushButton("Accept") self.btnAccept.setEnabled(False) self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) self.connect(self.btnAccept, SIGNAL(CLICKED), self.accept) self.connect(self.chkAgree, SIGNAL('toggled(bool)'), self.toggleChkBox) btnBox = makeHorizFrame([STRETCH, self.btnCancel, self.btnAccept]) lblPleaseAgree = QRichLabel(\ 'Armory Bitcoin Client is licensed under the Affero General ' 'Public License, Version 3 (AGPLv3)' '

' 'Additionally, as a condition of receiving this software ' 'for free, you accept all risks associated with using it ' 'and the developers of Armory will not be held liable for any ' 'loss of money or bitcoins due to software defects.' '

' 'Please read the full terms of the license and indicate your ' 'agreement with its terms.') dlgLayout = QVBoxLayout() frmChk = makeHorizFrame([self.chkAgree, STRETCH]) frmBtn = makeHorizFrame([STRETCH, self.btnCancel, self.btnAccept]) frmAll = makeVertFrame([lblPleaseAgree, txtLicense, frmChk, frmBtn]) dlgLayout.addWidget(frmAll) self.setLayout(dlgLayout) self.setWindowTitle('Armory License Agreement') self.setWindowIcon(QIcon(self.main.iconfile)) def reject(self): self.main.abortLoad = True LOGERROR('User did not accept the EULA') super(DlgEULA, self).reject() def accept(self): self.main.writeSetting('Agreed_to_EULA', True) super(DlgEULA, self).accept() def toggleChkBox(self, isEnabled): self.btnAccept.setEnabled(isEnabled) ############################################################################# class DlgIntroMessage(ArmoryDialog): def __init__(self, parent=None, main=None): super(DlgIntroMessage, self).__init__(parent, main) lblInfoImg = QLabel() lblInfoImg.setPixmap(QPixmap(':/MsgBox_info48.png')) lblInfoImg.setAlignment(Qt.AlignHCenter | Qt.AlignTop) lblInfoImg.setSizePolicy(QSizePolicy.Fixed, QSizePolicy.Fixed) lblInfoImg.setMaximumWidth(50) lblWelcome = QRichLabel('Welcome to Armory!') lblWelcome.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) lblWelcome.setFont(GETFONT('Var', 14)) lblSlogan = QRichLabel('The most advanced Bitcoin Client on Earth!') lblSlogan.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) lblDescr = QRichLabel(\ 'You are about to use the most secure and feature-rich Bitcoin client ' 'software available! But please remember, this software ' 'is still Beta - Armory developers will not be held responsible ' 'for loss of bitcoins resulting from the use of this software!' '

' 'For more info about Armory, and Bitcoin itself, see ' 'frequently ' 'asked questions.') lblDescr.setOpenExternalLinks(True) lblContact = QRichLabel(\ 'If you find this software useful, please consider pressing ' 'the "Donate" button on your next transaction!') spacer = lambda: QSpacerItem(20, 20, QSizePolicy.Fixed, QSizePolicy.Expanding) frmText = makeLayoutFrame(VERTICAL, [lblWelcome, spacer(), \ lblDescr, spacer(), \ lblContact ]) self.chkDnaaIntroDlg = QCheckBox('Do not show this window again') self.requestCreate = False self.requestImport = False buttonBox = QDialogButtonBox() frmIcon = makeLayoutFrame(VERTICAL, [lblInfoImg, STRETCH]) frmIcon.setMaximumWidth(60) if len(self.main.walletMap) == 0: self.btnCreate = QPushButton("Create Your First Wallet!") self.btnImport = QPushButton("Import Existing Wallet") self.btnCancel = QPushButton("Skip") self.connect(self.btnCreate, SIGNAL(CLICKED), self.createClicked) self.connect(self.btnImport, SIGNAL(CLICKED), self.importClicked) self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) buttonBox.addButton(self.btnCreate, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnImport, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) self.chkDnaaIntroDlg.setVisible(False) frmBtn = makeLayoutFrame(HORIZONTAL, [self.chkDnaaIntroDlg, \ self.btnCancel, \ STRETCH, \ self.btnImport, \ self.btnCreate]) else: self.btnOkay = QPushButton("OK!") self.connect(self.btnOkay, SIGNAL(CLICKED), self.accept) buttonBox.addButton(self.btnOkay, QDialogButtonBox.AcceptRole) frmBtn = makeLayoutFrame(HORIZONTAL, [self.chkDnaaIntroDlg, \ STRETCH, \ self.btnOkay]) dlgLayout = QGridLayout() dlgLayout.addWidget(frmIcon, 0, 0, 1, 1) dlgLayout.addWidget(frmText, 0, 1, 1, 1) dlgLayout.addWidget(frmBtn, 1, 0, 1, 2) self.setLayout(dlgLayout) self.setWindowTitle('Greetings!') self.setWindowIcon(QIcon(self.main.iconfile)) self.setMinimumWidth(750) def createClicked(self): self.requestCreate = True self.accept() def importClicked(self): self.requestImport = True self.accept() def sizeHint(self): return QSize(750, 500) ############################################################################# class DlgImportPaperWallet(ArmoryDialog): def __init__(self, parent=None, main=None): super(DlgImportPaperWallet, self).__init__(parent, main) self.wltDataLines = [[]] * 4 self.prevChars = [''] * 4 for i, edt in enumerate(self.lineEdits): # I screwed up the ref/copy, this loop only connected the last one... # theSlot = lambda: self.autoSpacerFunction(i) # self.connect(edt, SIGNAL('textChanged(QString)'), theSlot) edt.setMinimumWidth(tightSizeNChar(edt, 50)[0]) # Just do it manually because it's guaranteed to work! slot = lambda: self.autoSpacerFunction(0) self.connect(self.lineEdits[0], SIGNAL('textEdited(QString)'), slot) slot = lambda: self.autoSpacerFunction(1) self.connect(self.lineEdits[1], SIGNAL('textEdited(QString)'), slot) slot = lambda: self.autoSpacerFunction(2) self.connect(self.lineEdits[2], SIGNAL('textEdited(QString)'), slot) slot = lambda: self.autoSpacerFunction(3) self.connect(self.lineEdits[3], SIGNAL('textEdited(QString)'), slot) buttonbox = QDialogButtonBox(QDialogButtonBox.Ok | \ QDialogButtonBox.Cancel) self.connect(buttonbox, SIGNAL('accepted()'), self.verifyUserInput) self.connect(buttonbox, SIGNAL('rejected()'), self.reject) self.labels = [QLabel() for i in range(4)] self.labels[0].setText('Root Key:') self.labels[1].setText('') self.labels[2].setText('Chain Code:') self.labels[3].setText('') lblDescr1 = QLabel( 'Enter the characters exactly as they are printed on the ' 'paper-backup page. Alternatively, you can scan the QR ' 'code from another application, then copy&paste into the ' 'entry boxes below.') lblDescr2 = QLabel( 'The data can be entered with or without ' 'spaces, and up to ' 'one character per line will be corrected automatically.') for lbl in (lblDescr1, lblDescr2): lbl.setTextFormat(Qt.RichText) lbl.setWordWrap(True) layout = QGridLayout() layout.addWidget(lblDescr1, 0, 0, 1, 2) layout.addWidget(lblDescr2, 1, 0, 1, 2) for i, edt in enumerate(self.lineEdits): layout.addWidget(self.labels[i], i + 2, 0) layout.addWidget(self.lineEdits[i], i + 2, 1) self.chkEncrypt = QCheckBox('Encrypt Wallet') self.chkEncrypt.setChecked(True) bottomFrm = makeHorizFrame([self.chkEncrypt, buttonbox]) layout.addWidget(bottomFrm, 6, 0, 1, 2) layout.setVerticalSpacing(10) self.setLayout(layout) self.setWindowTitle('Recover Wallet from Paper Backup') self.setWindowIcon(QIcon(self.main.iconfile)) def autoSpacerFunction(self, i): currStr = str(self.lineEdits[i].text()) rawStr = currStr.replace(' ', '') if len(rawStr) > 36: rawStr = rawStr[:36] if len(rawStr) == 36: quads = [rawStr[j:j + 4] for j in range(0, 36, 4)] self.lineEdits[i].setText(' '.join(quads)) def verifyUserInput(self): def englishNumberList(nums): nums = map(str, nums) if len(nums) == 1: return nums[0] return ', '.join(nums[:-1]) + ' and ' + nums[-1] errorLines = [] for i in range(4): hasError = False try: data, err = readSixteenEasyBytes(str(self.lineEdits[i].text())) except (KeyError, TypeError): data, err = ('', 'Exception') if data == '': reply = QMessageBox.critical(self, 'Verify Wallet ID', \ 'There is an error on line ' + str(i + 1) + ' of the data you ' 'entered, which could not be fixed automatically. Please ' 'double-check that you entered the text exactly as it appears ' 'on the wallet-backup page.', \ QMessageBox.Ok) LOGERROR('Error in wallet restore field') self.labels[i].setText('' + str(self.labels[i].text()) + '') return if err == 'Fixed_1' or err == 'No_Checksum': errorLines += [i + 1] self.wltDataLines[i] = data if errorLines: pluralChar = '' if len(errorLines) == 1 else 's' article = ' an' if len(errorLines) == 1 else '' QMessageBox.question(self, 'Errors Corrected!', \ 'Detected' + article + ' error' + pluralChar + ' on line' + pluralChar + ' ' + englishNumberList(errorLines) + ' in the data you entered. Armory attempted to fix the ' + 'error' + pluralChar + ' but it is not always right. Be sure ' 'to verify the "Wallet Unique ID" closely on the next window.', \ QMessageBox.Ok) # If we got here, the data is valid, let's create the wallet and accept the dlg privKey = ''.join(self.wltDataLines[:2]) chain = ''.join(self.wltDataLines[2:]) root = PyBtcAddress().createFromPlainKeyData(SecureBinaryData(privKey)) root.chaincode = SecureBinaryData(chain) first = root.extendAddressChain() newWltID = binary_to_base58((ADDRBYTE + first.getAddr160()[:5])[::-1]) if self.main.walletMap.has_key(newWltID): QMessageBox.question(self, 'Duplicate Wallet!', \ 'The data you entered is for a wallet with a ID: \n\n \t' + newWltID + '\n\nYou already own this wallet! \n ' 'Nothing to do...', QMessageBox.Ok) self.reject() return reply = QMessageBox.question(self, 'Verify Wallet ID', \ 'The data you entered corresponds to a wallet with a wallet ID: \n\n \t' + newWltID + '\n\nDoes this ID match the "Wallet Unique ID" ' 'printed on your paper backup? If not, click "No" and reenter ' 'key and chain-code data again.', \ QMessageBox.Yes | QMessageBox.No) if reply == QMessageBox.No: return passwd = [] if self.chkEncrypt.isChecked(): dlgPasswd = DlgChangePassphrase(self, self.main) if dlgPasswd.exec_(): passwd = SecureBinaryData(str(dlgPasswd.edtPasswd1.text())) else: QMessageBox.critical(self, 'Cannot Encrypt', \ 'You requested your restored wallet be encrypted, but no ' 'valid passphrase was supplied. Aborting wallet recovery.', \ QMessageBox.Ok) return if passwd: self.newWallet = PyBtcWallet().createNewWallet(\ plainRootKey=SecureBinaryData(privKey), \ chaincode=SecureBinaryData(chain), \ shortLabel='PaperBackup - %s' % newWltID, \ withEncrypt=True, \ securePassphrase=passwd, \ kdfTargSec=0.25, \ kdfMaxMem=32 * 1024 * 1024, \ isActuallyNew=False, \ doRegisterWithBDM=False) else: self.newWallet = PyBtcWallet().createNewWallet(\ plainRootKey=SecureBinaryData(privKey), \ chaincode=SecureBinaryData(chain), \ shortLabel='PaperBackup - %s' % newWltID, \ withEncrypt=False, \ isActuallyNew=False, \ doRegisterWithBDM=False) def fillAddrPoolAndAccept(): progressBar = DlgProgress(self, self.main, None, HBar=1, Title="Computing New Addresses") progressBar.exec_(self.newWallet.fillAddressPool) self.accept() # Will pop up a little "please wait..." window while filling addr pool DlgExecLongProcess(fillAddrPoolAndAccept, "Recovering wallet...", self, self.main).exec_() ################################################################################ class DlgSetComment(ArmoryDialog): """ This will be a dumb dialog for retrieving a comment from user """ ############################################################################# def __init__(self, parent, main, currcomment='', ctype='', cwhat='Comment', maxChars=144): super(DlgSetComment, self).__init__(parent, main) self.setWindowTitle('Modify Comment') self.setWindowIcon(QIcon(self.main.iconfile)) buttonbox = QDialogButtonBox(QDialogButtonBox.Ok | \ QDialogButtonBox.Cancel) self.connect(buttonbox, SIGNAL('accepted()'), self.accept) self.connect(buttonbox, SIGNAL('rejected()'), self.reject) layout = QGridLayout() lbl = None if ctype and currcomment: lbl = QLabel('Change %s %s:' % (ctype, cwhat)) if not ctype and currcomment: lbl = QLabel('Change %s:' % cwhat) if ctype and not currcomment: lbl = QLabel('Add %s %s:' % (ctype, cwhat)) if not ctype and not currcomment: lbl = QLabel('Add %s:' % cwhat) self.edtComment = QLineEdit() self.edtComment.setText(currcomment[:maxChars]) h, w = relaxedSizeNChar(self, 50) self.edtComment.setMinimumSize(h, w) self.edtComment.setMaxLength(maxChars) layout.addWidget(lbl, 0, 0) layout.addWidget(self.edtComment, 1, 0) layout.addWidget(buttonbox, 2, 0) self.setLayout(layout) ############################################################################# def accept(self): if not isASCII(unicode(self.edtComment.text())): UnicodeErrorBox(self) return else: super(DlgSetComment, self).accept() ################################################################################ class DlgRemoveWallet(ArmoryDialog): def __init__(self, wlt, parent=None, main=None): super(DlgRemoveWallet, self).__init__(parent, main) wltID = wlt.uniqueIDB58 wltName = wlt.labelName wltDescr = wlt.labelDescr lblWarning = QLabel('!!! WARNING !!!\n\n') lblWarning.setTextFormat(Qt.RichText) lblWarning.setAlignment(Qt.AlignHCenter) lblWarning2 = QLabel('You have requested that the following wallet ' 'be removed from Armory:') lblWarning.setTextFormat(Qt.RichText) lblWarning.setWordWrap(True) lblWarning.setAlignment(Qt.AlignHCenter) lbls = [] lbls.append([]) lbls[0].append(QLabel('Wallet Unique ID:')) lbls[0].append(QLabel(wltID)) lbls.append([]) lbls[1].append(QLabel('Wallet Name:')) lbls[1].append(QLabel(wlt.labelName)) lbls.append([]) lbls[2].append(QLabel('Description:')) lbls[2].append(QLabel(wlt.labelDescr)) lbls[2][-1].setWordWrap(True) # TODO: This should not *ever* require a blockchain scan, because all # current wallets should already be registered and up-to-date. # But I should verify that this is actually the case. wltEmpty = True if TheBDM.getBDMState() == 'BlockchainReady': wlt.syncWithBlockchain() bal = wlt.getBalance('Full') lbls.append([]) lbls[3].append(QLabel('Current Balance (w/ unconfirmed):')) if bal > 0: lbls[3].append(QLabel('' + coin2str(bal, maxZeros=1).strip() + ' BTC')) lbls[3][-1].setTextFormat(Qt.RichText) wltEmpty = False else: lbls[3].append(QLabel(coin2str(bal, maxZeros=1) + ' BTC')) # Add two WARNING images on either side of dialog lblWarnImg = QLabel() lblWarnImg.setPixmap(QPixmap(':/MsgBox_warning48.png')) lblWarnImg.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) lblWarnImg2 = QLabel() lblWarnImg2.setPixmap(QPixmap(':/MsgBox_warning48.png')) lblWarnImg2.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) # Add the warning text and images to the top of the dialog layout = QGridLayout() layout.addWidget(lblWarning, 0, 1, 1, 1) layout.addWidget(lblWarning2, 1, 1, 1, 1) layout.addWidget(lblWarnImg, 0, 0, 2, 1) layout.addWidget(lblWarnImg2, 0, 2, 2, 1) frmInfo = QFrame() frmInfo.setFrameStyle(QFrame.Box | QFrame.Plain) frmInfo.setLineWidth(3) frmInfoLayout = QGridLayout() for i in range(len(lbls)): lbls[i][0].setText('' + lbls[i][0].text() + '') lbls[i][0].setTextFormat(Qt.RichText) frmInfoLayout.addWidget(lbls[i][0], i, 0) frmInfoLayout.addWidget(lbls[i][1], i, 1, 1, 2) frmInfo.setLayout(frmInfoLayout) layout.addWidget(frmInfo, 2, 0, 2, 3) hasWarningRow = False if not wlt.watchingOnly: if not wltEmpty: lbl = QRichLabel('WALLET IS NOT EMPTY. Only delete this wallet if you ' 'have a backup on paper or saved to a another location ' 'outside your settings directory.') hasWarningRow = True elif wlt.isWltSigningAnyLockbox(self.main.allLockboxes): lbl = QRichLabel('WALLET IS PART OF A LOCKBOX. Only delete this wallet if you ' 'have a backup on paper or saved to a another location ' 'outside your settings directory.') hasWarningRow = True if hasWarningRow: lbls.append(lbl) layout.addWidget(lbl, 4, 0, 1, 3) self.radioExclude = QRadioButton('Add this wallet to the "ignore list"') self.radioExclude.setEnabled(False) self.radioDelete = QRadioButton('Permanently delete this wallet') self.radioWatch = QRadioButton('Delete private keys only, make watching-only') # Make sure that there can only be one selection btngrp = QButtonGroup(self) btngrp.addButton(self.radioExclude) btngrp.addButton(self.radioDelete) if not self.main.usermode == USERMODE.Standard: btngrp.addButton(self.radioWatch) btngrp.setExclusive(True) ttipExclude = self.main.createToolTipWidget(\ '[DISABLED] This will not delete any files, but will add this ' 'wallet to the "ignore list." This means that Armory ' 'will no longer show this wallet in the main screen ' 'and none of its funds will be added to your balance. ' 'You can re-include this wallet in Armory at a later ' 'time by selecting the "Excluded Wallets..." option ' 'in the "Wallets" menu.') ttipDelete = self.main.createToolTipWidget(\ 'This will delete the wallet file, removing ' 'all its private keys from your settings directory. ' 'If you intend to keep using addresses from this ' 'wallet, do not select this option unless the wallet ' 'is backed up elsewhere.') ttipWatch = self.main.createToolTipWidget(\ 'This will delete the private keys from your wallet, ' 'leaving you with a watching-only wallet, which can be ' 'used to generate addresses and monitor incoming ' 'payments. This option would be used if you created ' 'the wallet on this computer in order to transfer ' 'it to a different computer or device and want to ' 'remove the private data from this system for security.') self.chkPrintBackup = QCheckBox(tr(""" Print a paper backup of this wallet before deleting""")) if wlt.watchingOnly: ttipDelete = self.main.createToolTipWidget(tr(""" This will delete the wallet file from your system. Since this is a watching-only wallet, no private keys will be deleted.""")) ttipWatch = self.main.createToolTipWidget(tr(""" This wallet is already a watching-only wallet so this option is pointless""")) self.radioWatch.setEnabled(False) self.chkPrintBackup.setEnabled(False) self.frm = [] rdoFrm = QFrame() rdoFrm.setFrameStyle(STYLE_RAISED) rdoLayout = QGridLayout() startRow = 0 for rdo, ttip in [(self.radioExclude, ttipExclude), \ (self.radioDelete, ttipDelete), \ (self.radioWatch, ttipWatch)]: self.frm.append(QFrame()) # self.frm[-1].setFrameStyle(STYLE_SUNKEN) self.frm[-1].setFrameStyle(QFrame.NoFrame) frmLayout = QHBoxLayout() frmLayout.addWidget(rdo) ttip.setAlignment(Qt.AlignLeft | Qt.AlignVCenter) frmLayout.addWidget(ttip) frmLayout.addStretch() self.frm[-1].setLayout(frmLayout) rdoLayout.addWidget(self.frm[-1], startRow, 0, 1, 3) startRow += 1 self.radioDelete.setChecked(True) rdoFrm.setLayout(rdoLayout) startRow = 6 if not hasWarningRow else 5 layout.addWidget(rdoFrm, startRow, 0, 1, 3) if wlt.watchingOnly: self.frm[-1].setVisible(False) printTtip = self.main.createToolTipWidget(tr(""" If this box is checked, you will have the ability to print off an unencrypted version of your wallet before it is deleted. If printing is unsuccessful, please press *CANCEL* on the print dialog to prevent the delete operation from continuing""")) printFrm = makeLayoutFrame(HORIZONTAL, [self.chkPrintBackup, \ printTtip, \ 'Stretch']) startRow += 1 layout.addWidget(printFrm, startRow, 0, 1, 3) if wlt.watchingOnly: printFrm.setVisible(False) rmWalletSlot = lambda: self.removeWallet(wlt) startRow += 1 self.btnDelete = QPushButton("Delete") self.btnCancel = QPushButton("Cancel") self.connect(self.btnDelete, SIGNAL(CLICKED), rmWalletSlot) self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) buttonBox = QDialogButtonBox() buttonBox.addButton(self.btnDelete, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) layout.addWidget(buttonBox, startRow, 0, 1, 3) self.setLayout(layout) self.setWindowTitle('Delete Wallet Options') def removeWallet(self, wlt): # Open the print dialog. If they hit cancel at any time, then # we go back to the primary wallet-remove dialog without any other action if self.chkPrintBackup.isChecked(): if not OpenPaperBackupWindow('Single', self, self.main, self.wlt, \ tr('Unlock Paper Backup')): QMessageBox.warning(self, tr('Operation Aborted'), tr(""" You requested a paper backup before deleting the wallet, but clicked "Cancel" on the backup printing window. So, the delete operation was canceled as well."""), QMessageBox.Ok) return # If they only want to exclude the wallet, we will add it to the excluded # list and remove it from the application. The wallet files will remain # in the settings directory but will be ignored by Armory wltID = wlt.uniqueIDB58 if self.radioExclude.isChecked(): reply = QMessageBox.warning(self, tr('Verify Intentions'), tr(""" Are you sure you want to remove this wallet from your Armory dashboard? The wallet file will not be deleted, but you will no longer have access to the wallet or its funds unless you re-enable it through the "Wallets"->"Excluded Wallets" menu."""), \ QMessageBox.Yes | QMessageBox.Cancel) if reply == QMessageBox.Yes: self.main.removeWalletFromApplication(wltID) self.main.settings.extend('Excluded_Wallets', wlt.walletPath) self.main.statusBar().showMessage(\ 'Wallet ' + wltID + ' was added to the ignore list.', 20000) self.main.accept() self.accept() else: self.reject() else: if wlt.watchingOnly: reply = QMessageBox.warning(self, 'Confirm Delete', \ 'You are about to delete a watching-only wallet. Are you sure ' 'you want to do this?', QMessageBox.Yes | QMessageBox.Cancel) elif self.radioDelete.isChecked(): reply = QMessageBox.warning(self, 'Are you absolutely sure?!?', \ 'Are you absolutely sure you want to permanently delete ' 'this wallet? Unless this wallet is saved on another device ' 'you will permanently lose access to all the addresses in this ' 'wallet.', QMessageBox.Yes | QMessageBox.Cancel) elif self.radioWatch.isChecked(): reply = QMessageBox.warning(self, 'Are you absolutely sure?!?', \ 'This will permanently delete the information you need to spend ' 'funds from this wallet! You will only be able to receive ' 'coins, but not spend them. Only do this if you have another copy ' 'of this wallet elsewhere, such as a paper backup or on an offline ' 'computer with the full wallet. ', QMessageBox.Yes | QMessageBox.Cancel) if reply == QMessageBox.Yes: thepath = wlt.getWalletPath() thepathBackup = wlt.getWalletPath('backup') if self.radioWatch.isChecked(): LOGINFO('***Converting to watching-only wallet') newWltPath = wlt.getWalletPath('WatchOnly') wlt.forkOnlineWallet(newWltPath, wlt.labelName, wlt.labelDescr) newWlt = PyBtcWallet().readWalletFile(newWltPath) newWlt.setBlockchainSyncFlag(BLOCKCHAIN_READONLY) newWlt.syncWithBlockchain() os.remove(thepath) os.remove(thepathBackup) self.main.walletMap[wltID] = newWlt self.main.statusBar().showMessage(\ 'Wallet %s was replaced with a watching-only wallet.' % wltID, 10000) elif self.radioDelete.isChecked(): LOGINFO('***Completely deleting wallet') os.remove(thepath) os.remove(thepathBackup) self.main.removeWalletFromApplication(wltID) self.main.statusBar().showMessage(\ 'Wallet ' + wltID + ' was deleted!', 10000) self.parent.accept() self.accept() else: self.reject() ################################################################################ class DlgRemoveAddress(ArmoryDialog): def __init__(self, wlt, addr160, parent=None, main=None): super(DlgRemoveAddress, self).__init__(parent, main) if not wlt.hasAddr(addr160): raise WalletAddressError('Address does not exist in wallet!') if not wlt.getAddrByHash160(addr160).chainIndex == -2: raise WalletAddressError('Cannot delete regular chained addresses! ' 'Can only delete imported addresses.') self.wlt = wlt self.addr = wlt.addrMap[addr160] self.comm = wlt.getCommentForAddress(addr160) lblWarning = QLabel('!!! WARNING !!!\n\n') lblWarning.setTextFormat(Qt.RichText) lblWarning.setAlignment(Qt.AlignHCenter) lblWarning2 = QLabel('You have requested that the following address ' 'be deleted from your wallet:') lblWarning.setTextFormat(Qt.RichText) lblWarning.setWordWrap(True) lblWarning.setAlignment(Qt.AlignHCenter) lbls = [] lbls.append([]) lbls[-1].append(QLabel('Address:')) lbls[-1].append(QLabel(self.addr.getAddrStr())) lbls.append([]) lbls[-1].append(QLabel('Comment:')) lbls[-1].append(QLabel(self.comm)) lbls[-1][-1].setWordWrap(True) lbls.append([]) lbls[-1].append(QLabel('In Wallet:')) lbls[-1].append(QLabel('"%s" (%s)' % (wlt.labelName, wlt.uniqueIDB58))) addrEmpty = True if TheBDM.getBDMState() == 'BlockchainReady': # wlt.syncWithBlockchain() bal = wlt.getAddrBalance(addr160, 'Full') lbls.append([]) lbls[-1].append(QLabel('Address Balance (w/ unconfirmed):')) if bal > 0: lbls[-1].append(QLabel('' + coin2str(bal, maxZeros=1) + ' BTC')) lbls[-1][-1].setTextFormat(Qt.RichText) addrEmpty = False else: lbls[3].append(QLabel(coin2str(bal, maxZeros=1) + ' BTC')) # Add two WARNING images on either side of dialog lblWarnImg = QLabel() lblWarnImg.setPixmap(QPixmap(':/MsgBox_warning48.png')) lblWarnImg.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) lblWarnImg2 = QLabel() lblWarnImg2.setPixmap(QPixmap(':/MsgBox_warning48.png')) lblWarnImg2.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) # Add the warning text and images to the top of the dialog layout = QGridLayout() layout.addWidget(lblWarning, 0, 1, 1, 1) layout.addWidget(lblWarning2, 1, 1, 1, 1) layout.addWidget(lblWarnImg, 0, 0, 2, 1) layout.addWidget(lblWarnImg2, 0, 2, 2, 1) frmInfo = QFrame() frmInfo.setFrameStyle(QFrame.Box | QFrame.Plain) frmInfo.setLineWidth(3) frmInfoLayout = QGridLayout() for i in range(len(lbls)): lbls[i][0].setText('' + lbls[i][0].text() + '') lbls[i][0].setTextFormat(Qt.RichText) frmInfoLayout.addWidget(lbls[i][0], i, 0) frmInfoLayout.addWidget(lbls[i][1], i, 1, 1, 2) frmInfo.setLayout(frmInfoLayout) layout.addWidget(frmInfo, 2, 0, 2, 3) lblDelete = QLabel(\ 'Do you want to delete this address? No other addresses in this ' 'wallet will be affected.') lblDelete.setWordWrap(True) lblDelete.setTextFormat(Qt.RichText) layout.addWidget(lblDelete, 4, 0, 1, 3) bbox = QDialogButtonBox(QDialogButtonBox.Ok | \ QDialogButtonBox.Cancel) self.connect(bbox, SIGNAL('accepted()'), self.removeAddress) self.connect(bbox, SIGNAL('rejected()'), self.reject) layout.addWidget(bbox, 5, 0, 1, 3) self.setLayout(layout) self.setWindowTitle('Confirm Delete Address') def removeAddress(self): reply = QMessageBox.warning(self, 'One more time...', \ 'Simply deleting an address does not prevent anyone ' 'from sending money to it. If you have given this address ' 'to anyone in the past, make sure that they know not to ' 'use it again, since any bitcoins sent to it will be ' 'inaccessible.\n\n ' 'If you are maintaining an external copy of this address ' 'please ignore this warning\n\n' 'Are you absolutely sure you want to delete ' + self.addr.getAddrStr() + '?', \ QMessageBox.Yes | QMessageBox.Cancel) if reply == QMessageBox.Yes: self.wlt.deleteImportedAddress(self.addr.getAddr160()) try: self.parent.wltAddrModel.reset() self.parent.setSummaryBalances() except AttributeError: pass self.accept() else: self.reject() ################################################################################ class DlgWalletSelect(ArmoryDialog): def __init__(self, parent=None, main=None, title='Select Wallet:', descr='', firstSelect=None, onlyMyWallets=False, wltIDList=None, atLeast=0): super(DlgWalletSelect, self).__init__(parent, main) self.balAtLeast = atLeast if self.main and len(self.main.walletMap) == 0: QMessageBox.critical(self, 'No Wallets!', \ 'There are no wallets to select from. Please create or import ' 'a wallet first.', QMessageBox.Ok) self.accept() return if wltIDList == None: wltIDList = list(self.main.walletIDList) # Start the layout layout = QVBoxLayout() # Expect to set selectedId wltFrame = SelectWalletFrame(self, main, HORIZONTAL, firstSelect, onlyMyWallets, wltIDList, atLeast, self.selectWallet) layout.addWidget(wltFrame) self.selectedID = wltFrame.selectedID buttonBox = QDialogButtonBox() btnAccept = QPushButton('OK') btnCancel = QPushButton('Cancel') self.connect(btnAccept, SIGNAL(CLICKED), self.accept) self.connect(btnCancel, SIGNAL(CLICKED), self.reject) buttonBox.addButton(btnAccept, QDialogButtonBox.AcceptRole) buttonBox.addButton(btnCancel, QDialogButtonBox.RejectRole) layout.addWidget(buttonBox) layout.setSpacing(15) self.setLayout(layout) self.setWindowTitle('Select Wallet') def selectWallet(self, wlt, isDoubleClick=False): self.selectedID = wlt.uniqueIDB58 if isDoubleClick: self.accept() ############################################################################# def excludeChange(outputPairs, wlt): """ NOTE: this method works ONLY because we always generate a new address whenever creating a change-output, which means it must have a higher chainIndex than all other addresses. If you did something creative with this tx, this may not actually work. """ maxChainIndex = -5 nonChangeOutputPairs = [] currentMaxChainPair = None for script,val in outputPairs: scrType = getTxOutScriptType(script) addr = '' if scrType in CPP_TXOUT_HAS_ADDRSTR: scrAddr = script_to_scrAddr(script) addr = wlt.getAddrByHash160(scrAddr_to_hash160(scrAddr)[1]) # this logic excludes the pair with the maximum chainIndex from the # returned list if addr: if addr.chainIndex > maxChainIndex: maxChainIndex = addr.chainIndex if currentMaxChainPair: nonChangeOutputPairs.append(currentMaxChainPair) currentMaxChainPair = [script,val] else: nonChangeOutputPairs.append([script,val]) return nonChangeOutputPairs ################################################################################ class DlgConfirmSend(ArmoryDialog): def __init__(self, wlt, scriptValPairs, fee, parent=None, main=None, \ sendNow=False, pytxOrUstx=None): super(DlgConfirmSend, self).__init__(parent, main) layout = QGridLayout() lblInfoImg = QLabel() lblInfoImg.setPixmap(QPixmap(':/MsgBox_info48.png')) lblInfoImg.setAlignment(Qt.AlignHCenter | Qt.AlignTop) changeRemoved = False sendPairs = [] returnPairs = [] for script,val in scriptValPairs: scrType = getTxOutScriptType(script) if scrType in CPP_TXOUT_HAS_ADDRSTR: scraddr = script_to_scrAddr(script) addr160 = scrAddr_to_hash160(scraddr)[1] if wlt.hasAddr(addr160): returnPairs.append([script,val]) else: sendPairs.append([script,val]) else: # We assume that anything without an addrStr is going external sendPairs.append([script,val]) # If there are more than 3 return pairs then this is a 1%'er tx we should # not presume to know which pair is change. It's a weird corner case so # it's best to leave it alone. # 0 return is an exact change tx, no need to deal with it so this # chunk of code that removes change only cares about 1 and 2 return pairs. # if 1 remove it, if 2 remove the one with a higher index. # Exception: IF no send pairs, it's a tx for max to a single internal address if len(sendPairs)==1 and len(returnPairs)==0: # Exactly one output, exact change by definition doExcludeChange = False doShowAllMsg = False doShowLeaveWlt = False elif len(sendPairs)==0 and len(returnPairs)==1: doExcludeChange = False doShowAllMsg = False doShowLeaveWlt = True elif len(returnPairs)==0: # Exact change doExcludeChange = False doShowAllMsg = False doShowLeaveWlt = False elif len(returnPairs)==1: # There's a simple change output doExcludeChange = True doShowAllMsg = False doShowLeaveWlt = False elif len(sendPairs)==0 and len(returnPairs)==2: # Send-to-self within wallet, with change, no external recips doExcludeChange = True doShowAllMsg = False doShowLeaveWlt = True else: # Everything else just show everything doExcludeChange = False doShowAllMsg = True doShowLeaveWlt = True if doExcludeChange: returnPairs = excludeChange(returnPairs, wlt) # returnPairs now includes only the outputs to be displayed totalLeavingWlt = sum([val for script,val in sendPairs]) + fee totalSend = sum([val for script,val in returnPairs]) + totalLeavingWlt sendFromWalletStr = coin2strNZS(totalLeavingWlt) totalSendStr = coin2strNZS(totalSend) lblAfterBox = QRichLabel('') # Always include a way to review the tx when in expert mode. Or whenever # we are showing the entire output list. # If we have a pytx or ustx, we can add a DlgDispTxInfo button showAllMsg = '' if doShowAllMsg or (pytxOrUstx and self.main.usermode==USERMODE.Expert): showAllMsg = tr(""" To see complete transaction details click here""") def openDlgTxInfo(*args): DlgDispTxInfo(pytxOrUstx, wlt, self.parent, self.main).exec_() self.connect(lblAfterBox, SIGNAL('linkActivated(const QString &)'), openDlgTxInfo) lblMsg = QRichLabel(tr(""" This transaction will spend %s BTC from Wallet "%s" (%s) to the following recipients:""") % (totalSendStr, htmlColor('TextBlue'), wlt.labelName, wlt.uniqueIDB58)) if doShowLeaveWlt: lblAfterBox.setText(tr(""" * Starred outputs are going to the same wallet from which they came and do not affect the wallet's final balance. The total balance of the wallet will actually only decrease %s BTC as a result of this transaction. %s""") % \ (sendFromWalletStr, showAllMsg)) elif len(showAllMsg)>0: lblAfterBox.setText(showAllMsg) addrColWidth = 50 recipLbls = [] ffixBold = GETFONT('Fixed') ffixBold.setWeight(QFont.Bold) for script,val in sendPairs + returnPairs: displayInfo = self.main.getDisplayStringForScript(script, addrColWidth) dispStr = (' '+displayInfo['String']).ljust(addrColWidth) coinStr = coin2str(val, rJust=True, maxZeros=4) if [script,val] in returnPairs: dispStr = '*'+dispStr[1:] recipLbls.append(QLabel(dispStr + coinStr)) recipLbls[-1].setFont(ffixBold) if fee > 0: recipLbls.append(QSpacerItem(10, 10)) recipLbls.append(QLabel(' Transaction Fee : '.ljust(addrColWidth) + coin2str(fee, rJust=True, maxZeros=4))) recipLbls[-1].setFont(GETFONT('Fixed')) recipLbls.append(HLINE(QFrame.Sunken)) if doShowLeaveWlt: # We have a separate message saying "total amount actually leaving wlt is..." # We can just give the total of all the outputs in the table above recipLbls.append(QLabel(' Total: '.ljust(addrColWidth) + coin2str(totalSend, rJust=True, maxZeros=4))) else: # The k recipLbls.append(QLabel(' Total Leaving Wallet: '.ljust(addrColWidth) + coin2str(totalSend, rJust=True, maxZeros=4))) recipLbls[-1].setFont(GETFONT('Fixed')) if sendNow: self.btnAccept = QPushButton('Send') lblLastConfirm = QLabel('Are you sure you want to execute this transaction?') else: self.btnAccept = QPushButton('Continue') lblLastConfirm = QLabel('Does the above look correct?') self.btnCancel = QPushButton("Cancel") self.connect(self.btnAccept, SIGNAL(CLICKED), self.accept) self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) buttonBox = QDialogButtonBox() buttonBox.addButton(self.btnAccept, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) frmTable = makeLayoutFrame(VERTICAL, recipLbls, STYLE_RAISED) frmRight = makeVertFrame([ lblMsg, \ 'Space(20)', \ frmTable, \ lblAfterBox, \ 'Space(10)', \ lblLastConfirm, \ 'Space(10)', \ buttonBox ]) frmAll = makeHorizFrame([ lblInfoImg, frmRight ]) layout.addWidget(frmAll) self.setLayout(layout) self.setMinimumWidth(350) self.setWindowTitle('Confirm Transaction') ################################################################################ class DlgSendBitcoins(ArmoryDialog): def __init__(self, wlt, parent=None, main=None, prefill=None, wltIDList=None, onlyOfflineWallets=False, spendFromLockboxID=None): super(DlgSendBitcoins, self).__init__(parent, main) layout = QVBoxLayout() self.spendFromLockboxID = spendFromLockboxID self.frame = SendBitcoinsFrame(self, main, tr('Send Bitcoins'), wlt, prefill, wltIDList, onlyOfflineWallets=onlyOfflineWallets, sendCallback=self.createTxAndBroadcast, createUnsignedTxCallback=self.createUnsignedTxAndDisplay, spendFromLockboxID=spendFromLockboxID) layout.addWidget(self.frame) self.setLayout(layout) self.sizeHint = lambda: QSize(850, 600) self.setMinimumWidth(700) # Update the any controls based on the initial wallet selection self.frame.fireWalletChange() ############################################################################# def createUnsignedTxAndDisplay(self, ustx): self.accept() if self.spendFromLockboxID is None: dlg = DlgOfflineTxCreated(self.frame.wlt, ustx, self.parent, self.main) dlg.exec_() else: dlg = DlgMultiSpendReview(self.parent, self.main, ustx) dlg.exec_() ############################################################################# def createTxAndBroadcast(self): self.accept() ############################################################################# def saveGeometrySettings(self): self.main.writeSetting('SendBtcGeometry', str(self.saveGeometry().toHex())) ############################################################################# def closeEvent(self, event): self.saveGeometrySettings() super(DlgSendBitcoins, self).closeEvent(event) ############################################################################# def accept(self, *args): self.saveGeometrySettings() super(DlgSendBitcoins, self).accept(*args) ############################################################################# def reject(self, *args): self.saveGeometrySettings() super(DlgSendBitcoins, self).reject(*args) ################################################################################ class DlgOfflineTxCreated(ArmoryDialog): def __init__(self, wlt, ustx, parent=None, main=None): super(DlgOfflineTxCreated, self).__init__(parent, main) layout = QVBoxLayout() reviewOfflineTxFrame = ReviewOfflineTxFrame(self, main, "Review Offline Transaction") reviewOfflineTxFrame.setWallet(wlt) reviewOfflineTxFrame.setUSTX(ustx) continueButton = QPushButton('Continue') self.connect(continueButton, SIGNAL(CLICKED), self.signBroadcastTx) doneButton = QPushButton('Done') self.connect(doneButton, SIGNAL(CLICKED), self.accept) ttipDone = self.main.createToolTipWidget(\ 'By clicking Done you will exit end the offline transaction process for now. ' 'When you are ready to sign and/or broadcast the transaction, click the Offline ' 'Transactions button in the main window, then click the Sign and/or ' 'Broadcast Transaction button in the Select Offline Action dialog.') ttipContinue = self.main.createToolTipWidget(\ 'By clicking Continue you will continue to the next step in the offline ' 'transaction process to sign and/or broadcast the transaction.') bottomStrip = makeHorizFrame([doneButton, ttipDone, STRETCH, continueButton, ttipContinue]) frame = makeVertFrame([reviewOfflineTxFrame, bottomStrip]) layout.addWidget(frame) self.setLayout(layout) self.setWindowTitle(tr('Review Offline Transaction')) self.setWindowIcon(QIcon(self.main.iconfile)) def signBroadcastTx(self): self.accept() DlgSignBroadcastOfflineTx(self.parent,self.main).exec_() ################################################################################ class DlgOfflineSelect(ArmoryDialog): def __init__(self, parent=None, main=None): super(DlgOfflineSelect, self).__init__(parent, main) self.do_review = False self.do_create = False self.do_broadc = False lblDescr = QRichLabel(\ 'In order to execute an offline transaction, three steps must ' 'be followed:

' '\t(1) Online Computer: Create the unsigned transaction
' '\t(2) Offline Computer: Get the transaction signed
' '\t(3) Online Computer: Broadcast the signed transaction

' 'You must create the transaction using a watch-only wallet on an online ' 'system, but watch-only wallets cannot sign it. Only the offline system ' 'can create a valid signature. The easiest way to execute all three steps ' 'is to use a USB key to move the data between computers.

' 'All the data saved to the removable medium during all three steps are ' 'completely safe and do not reveal any private information that would benefit an ' 'attacker trying to steal your funds. However, this transaction data does ' 'reveal some addresses in your wallet, and may represent a breach of ' 'privacy if not protected.') btnCreate = QPushButton('Create New Offline Transaction') broadcastButton = QPushButton('Sign and/or Broadcast Transaction') if not TheBDM.getBDMState() == 'BlockchainReady': btnCreate.setEnabled(False) if len(self.main.walletMap) == 0: broadcastButton = QPushButton('No wallets available!') broadcastButton.setEnabled(False) else: broadcastButton = QPushButton('Sign Offline Transaction') else: if len(self.main.getWatchingOnlyWallets()) == 0: btnCreate = QPushButton('No watching-only-wallets available!') btnCreate.setEnabled(False) if len(self.main.walletMap) == 0 and self.main.netMode == NETWORKMODE.Full: broadcastButton = QPushButton('Broadcast Signed Transaction') btnCancel = QPushButton('<<< Go Back') def create(): self.do_create = True; self.accept() def broadc(): self.do_broadc = True; self.accept() self.connect(btnCreate, SIGNAL(CLICKED), create) self.connect(broadcastButton, SIGNAL(CLICKED), broadc) self.connect(btnCancel, SIGNAL(CLICKED), self.reject) lblCreate = QRichLabel(tr(""" Create a transaction from an Offline/Watching-Only wallet to be signed by the computer with the full wallet """)) lblReview = QRichLabel(tr(""" Review an unsigned transaction and sign it if you have the private keys needed for it """)) lblBroadc = QRichLabel(tr(""" Send a pre-signed transaction to the Bitcoin network to finalize it""")) lblBroadc.setMinimumWidth(tightSizeNChar(lblBroadc, 45)[0]) frmOptions = QFrame() frmOptions.setFrameStyle(STYLE_PLAIN) frmOptionsLayout = QGridLayout() frmOptionsLayout.addWidget(btnCreate, 0, 0) frmOptionsLayout.addWidget(lblCreate, 0, 2) frmOptionsLayout.addWidget(HLINE(), 1, 0, 1, 3) frmOptionsLayout.addWidget(broadcastButton, 2, 0, 3, 1) frmOptionsLayout.addWidget(lblReview, 2, 2) frmOptionsLayout.addWidget(HLINE(), 3, 2, 1, 1) frmOptionsLayout.addWidget(lblBroadc, 4, 2) frmOptionsLayout.addItem(QSpacerItem(20, 20), 0, 1, 3, 1) frmOptions.setLayout(frmOptionsLayout) frmDescr = makeLayoutFrame(HORIZONTAL, ['Space(10)', lblDescr, 'Space(10)'], \ STYLE_SUNKEN) frmCancel = makeLayoutFrame(HORIZONTAL, [btnCancel, STRETCH]) dlgLayout = QGridLayout() dlgLayout.addWidget(frmDescr, 0, 0, 1, 1) dlgLayout.addWidget(frmOptions, 1, 0, 1, 1) dlgLayout.addWidget(frmCancel, 2, 0, 1, 1) self.setLayout(dlgLayout) self.setWindowTitle('Select Offline Action') self.setWindowIcon(QIcon(self.main.iconfile)) ################################################################################ class DlgSignBroadcastOfflineTx(ArmoryDialog): """ We will make the assumption that this dialog is used ONLY for outgoing transactions from your wallet. This simplifies the logic if we don't have to identify input senders/values, and handle the cases where those may not be specified """ def __init__(self, parent=None, main=None): super(DlgSignBroadcastOfflineTx, self).__init__(parent, main) self.setWindowTitle('Review Offline Transaction') self.setWindowIcon(QIcon(self.main.iconfile)) signBroadcastOfflineTxFrame = SignBroadcastOfflineTxFrame( self, main, "Sign or Broadcast Transaction") doneButton = QPushButton('Done') self.connect(doneButton, SIGNAL(CLICKED), self.accept) doneForm = makeLayoutFrame(HORIZONTAL, [STRETCH, doneButton]) dlgLayout = QVBoxLayout() dlgLayout.addWidget(signBroadcastOfflineTxFrame) dlgLayout.addWidget(doneForm) self.setLayout(dlgLayout) signBroadcastOfflineTxFrame.processUSTX() ################################################################################ class DlgShowKeyList(ArmoryDialog): def __init__(self, wlt, parent=None, main=None): super(DlgShowKeyList, self).__init__(parent, main) self.wlt = wlt self.havePriv = ((not self.wlt.useEncryption) or not (self.wlt.isLocked)) wltType = determineWalletType(self.wlt, self.main)[0] if wltType in (WLTTYPES.Offline, WLTTYPES.WatchOnly): self.havePriv = False # NOTE/WARNING: We have to make copies (in RAM) of the unencrypted # keys, or else we will have to type in our address # every 10s if we want to modify the key list. This # isn't likely a big problem, but it's not ideal, # either. Not much I can do about, though... # (at least: once this dialog is closed, all the # garbage should be collected...) self.addrCopies = [] for addr in self.wlt.getLinearAddrList(withAddrPool=True): self.addrCopies.append(addr.copy()) self.rootKeyCopy = self.wlt.addrMap['ROOT'].copy() backupVersion = BACKUP_TYPE_135A testChain = DeriveChaincodeFromRootKey(self.rootKeyCopy.binPrivKey32_Plain) self.needChaincode = (not testChain == self.rootKeyCopy.chaincode) if not self.needChaincode: backupVersion = BACKUP_TYPE_135C self.strDescrReg = (\ 'The textbox below shows all keys that are part of this wallet, ' 'which includes both permanent keys and imported keys. If you ' 'simply want to backup your wallet and you have no imported keys ' 'then all data below is reproducible from a plain paper backup.' '

' 'If you have imported addresses to backup, and/or you ' 'would like to export your private keys to another ' 'wallet service or application, then you can save this data ' 'to disk, or copy&paste it into the other application.') self.strDescrWarn = (\ '

' 'Warning: The text box below contains ' 'the plaintext (unencrypted) private keys for each of ' 'the addresses in this wallet. This information can be used ' 'to spend the money associated with those addresses, so please ' 'protect it like you protect the rest of your wallet.') self.lblDescr = QRichLabel('') self.lblDescr.setAlignment(Qt.AlignLeft | Qt.AlignTop) txtFont = GETFONT('Fixed', 8) self.txtBox = QTextEdit() self.txtBox.setReadOnly(True) self.txtBox.setFont(txtFont) w, h = tightSizeNChar(txtFont, 110) self.txtBox.setFont(txtFont) self.txtBox.setMinimumWidth(w) self.txtBox.setMaximumWidth(w) self.txtBox.setMinimumHeight(h * 3.2) self.txtBox.setSizePolicy(QSizePolicy.Fixed, QSizePolicy.Preferred) # Create a list of checkboxes and then some ID word to identify what # to put there self.chkList = {} self.chkList['AddrStr'] = QCheckBox('Address String') self.chkList['PubKeyHash'] = QCheckBox('Hash160') self.chkList['PrivCrypt'] = QCheckBox('Private Key (Encrypted)') self.chkList['PrivHexBE'] = QCheckBox('Private Key (Plain Hex)') self.chkList['PrivB58'] = QCheckBox('Private Key (Plain Base58)') self.chkList['PubKey'] = QCheckBox('Public Key (BE)') self.chkList['ChainIndex'] = QCheckBox('Chain Index') self.chkList['AddrStr' ].setChecked(True) self.chkList['PubKeyHash'].setChecked(False) self.chkList['PrivB58' ].setChecked(self.havePriv) self.chkList['PrivCrypt' ].setChecked(False) self.chkList['PrivHexBE' ].setChecked(self.havePriv) self.chkList['PubKey' ].setChecked(not self.havePriv) self.chkList['ChainIndex'].setChecked(False) namelist = ['AddrStr', 'PubKeyHash', 'PrivB58', 'PrivCrypt', \ 'PrivHexBE', 'PubKey', 'ChainIndex'] for name in self.chkList.keys(): self.connect(self.chkList[name], SIGNAL('toggled(bool)'), \ self.rewriteList) self.chkImportedOnly = QCheckBox('Imported Addresses Only') self.chkWithAddrPool = QCheckBox('Include Unused (Address Pool)') self.chkDispRootKey = QCheckBox('Include Paper Backup Root') self.chkOmitSpaces = QCheckBox('Omit spaces in key data') self.chkDispRootKey.setChecked(True) self.connect(self.chkImportedOnly, SIGNAL('toggled(bool)'), self.rewriteList) self.connect(self.chkWithAddrPool, SIGNAL('toggled(bool)'), self.rewriteList) self.connect(self.chkDispRootKey, SIGNAL('toggled(bool)'), self.rewriteList) self.connect(self.chkOmitSpaces, SIGNAL('toggled(bool)'), self.rewriteList) # self.chkCSV = QCheckBox('Display in CSV format') if not self.havePriv: self.chkDispRootKey.setChecked(False) self.chkDispRootKey.setEnabled(False) std = (self.main.usermode == USERMODE.Standard) adv = (self.main.usermode == USERMODE.Advanced) dev = (self.main.usermode == USERMODE.Expert) if std: self.chkList['PubKeyHash'].setVisible(False) self.chkList['PrivCrypt' ].setVisible(False) self.chkList['ChainIndex'].setVisible(False) elif adv: self.chkList['PubKeyHash'].setVisible(False) self.chkList['ChainIndex'].setVisible(False) # We actually just want to remove these entirely # (either we need to display all data needed for decryption, # besides passphrase, or we shouldn't show any of it) self.chkList['PrivCrypt' ].setVisible(False) chkBoxList = [self.chkList[n] for n in namelist] chkBoxList.append('Line') chkBoxList.append(self.chkImportedOnly) chkBoxList.append(self.chkWithAddrPool) chkBoxList.append(self.chkDispRootKey) frmChks = makeLayoutFrame(VERTICAL, chkBoxList, STYLE_SUNKEN) btnGoBack = QPushButton('<<< Go Back') btnSaveFile = QPushButton('Save to File...') btnCopyClip = QPushButton('Copy to Clipboard') self.lblCopied = QRichLabel('') self.connect(btnGoBack, SIGNAL(CLICKED), self.accept) self.connect(btnSaveFile, SIGNAL(CLICKED), self.saveToFile) self.connect(btnCopyClip, SIGNAL(CLICKED), self.copyToClipboard) frmGoBack = makeLayoutFrame(HORIZONTAL, [btnGoBack, \ STRETCH, \ self.chkOmitSpaces, \ STRETCH, \ self.lblCopied, \ btnCopyClip, \ btnSaveFile]) frmDescr = makeLayoutFrame(HORIZONTAL, [self.lblDescr], STYLE_SUNKEN) if not self.havePriv or (self.wlt.useEncryption and self.wlt.isLocked): self.chkList['PrivHexBE'].setEnabled(False) self.chkList['PrivHexBE'].setChecked(False) self.chkList['PrivB58' ].setEnabled(False) self.chkList['PrivB58' ].setChecked(False) dlgLayout = QGridLayout() dlgLayout.addWidget(frmDescr, 0, 0, 1, 1) dlgLayout.addWidget(frmChks, 0, 1, 1, 1) dlgLayout.addWidget(self.txtBox, 1, 0, 1, 2) dlgLayout.addWidget(frmGoBack, 2, 0, 1, 2) dlgLayout.setRowStretch(0, 0) dlgLayout.setRowStretch(1, 1) dlgLayout.setRowStretch(2, 0) self.setLayout(dlgLayout) self.rewriteList() self.setWindowTitle('All Wallet Keys') def rewriteList(self, *args): """ Write out all the wallet data """ whitespace = '' if self.chkOmitSpaces.isChecked() else ' ' def fmtBin(s, nB=4, sw=False): h = binary_to_hex(s) if sw: h = hex_switchEndian(h) return whitespace.join([h[i:i + nB] for i in range(0, len(h), nB)]) L = [] L.append('Created: ' + unixTimeToFormatStr(RightNow(), self.main.getPreferredDateFormat())) L.append('Wallet ID: ' + self.wlt.uniqueIDB58) L.append('Wallet Name: ' + self.wlt.labelName) L.append('') if self.chkDispRootKey.isChecked(): binPriv0 = self.rootKeyCopy.binPrivKey32_Plain.toBinStr()[:16] binPriv1 = self.rootKeyCopy.binPrivKey32_Plain.toBinStr()[16:] binChain0 = self.rootKeyCopy.chaincode.toBinStr()[:16] binChain1 = self.rootKeyCopy.chaincode.toBinStr()[16:] binPriv0Chk = computeChecksum(binPriv0, nBytes=2) binPriv1Chk = computeChecksum(binPriv1, nBytes=2) binChain0Chk = computeChecksum(binChain0, nBytes=2) binChain1Chk = computeChecksum(binChain1, nBytes=2) binPriv0 = binary_to_easyType16(binPriv0 + binPriv0Chk) binPriv1 = binary_to_easyType16(binPriv1 + binPriv1Chk) binChain0 = binary_to_easyType16(binChain0 + binChain0Chk) binChain1 = binary_to_easyType16(binChain1 + binChain1Chk) L.append('-' * 80) L.append('The following is the same information contained on your paper backup.') L.append('All NON-imported addresses in your wallet are backed up by this data.') L.append('') L.append('Root Key: ' + ' '.join([binPriv0[i:i + 4] for i in range(0, 36, 4)])) L.append(' ' + ' '.join([binPriv1[i:i + 4] for i in range(0, 36, 4)])) if self.needChaincode: L.append('Chain Code: ' + ' '.join([binChain0[i:i + 4] for i in range(0, 36, 4)])) L.append(' ' + ' '.join([binChain1[i:i + 4] for i in range(0, 36, 4)])) L.append('-' * 80) L.append('') # Cleanup all that sensitive data laying around in RAM binPriv0, binPriv1 = None, None binChain0, binChain1 = None, None binPriv0Chk, binPriv1Chk = None, None binChain0Chk, binChain1Chk = None, None self.havePriv = False topChain = self.wlt.highestUsedChainIndex extraLbl = '' # c = ',' if self.chkCSV.isChecked() else '' for addr in self.addrCopies: # Address pool if self.chkWithAddrPool.isChecked(): if addr.chainIndex > topChain: extraLbl = ' (Unused/Address Pool)' else: if addr.chainIndex > topChain: continue # Imported Addresses if self.chkImportedOnly.isChecked(): if not addr.chainIndex == -2: continue else: if addr.chainIndex == -2: extraLbl = ' (Imported)' if self.chkList['AddrStr' ].isChecked(): L.append(addr.getAddrStr() + extraLbl) if self.chkList['PubKeyHash'].isChecked(): L.append(' Hash160 : ' + fmtBin(addr.getAddr160())) if self.chkList['PrivB58' ].isChecked(): pB58 = encodePrivKeyBase58(addr.binPrivKey32_Plain.toBinStr()) pB58Stretch = whitespace.join([pB58[i:i + 6] for i in range(0, len(pB58), 6)]) L.append(' PrivBase58: ' + pB58Stretch) self.havePriv = True if self.chkList['PrivCrypt' ].isChecked(): L.append(' PrivCrypt : ' + fmtBin(addr.binPrivKey32_Encr.toBinStr())) if self.chkList['PrivHexBE' ].isChecked(): L.append(' PrivHexBE : ' + fmtBin(addr.binPrivKey32_Plain.toBinStr())) self.havePriv = True if self.chkList['PubKey' ].isChecked(): L.append(' PublicX : ' + fmtBin(addr.binPublicKey65.toBinStr()[1:33 ])) L.append(' PublicY : ' + fmtBin(addr.binPublicKey65.toBinStr()[ 33:])) if self.chkList['ChainIndex'].isChecked(): L.append(' ChainIndex: ' + str(addr.chainIndex)) self.txtBox.setText('\n'.join(L)) if self.havePriv: self.lblDescr.setText(self.strDescrReg + self.strDescrWarn) else: self.lblDescr.setText(self.strDescrReg) def saveToFile(self): if self.havePriv: if not self.main.getSettingOrSetDefault('DNAA_WarnPrintKeys', False): result = MsgBoxWithDNAA(MSGBOX.Warning, title='Plaintext Private Keys', \ msg='REMEMBER: The data you ' 'are about to save contains private keys. Please make sure ' 'that only trusted persons will have access to this file.' '

Are you sure you want to continue?', \ dnaaMsg=None, wCancel=True) if not result[0]: return self.main.writeSetting('DNAA_WarnPrintKeys', result[1]) wltID = self.wlt.uniqueIDB58 fn = self.main.getFileSave(title='Save Key List', \ ffilter=['Text Files (*.txt)'], \ defaultFilename='keylist_%s_.txt' % wltID) if len(fn) > 0: fileobj = open(fn, 'w') fileobj.write(str(self.txtBox.toPlainText())) fileobj.close() def copyToClipboard(self): clipb = QApplication.clipboard() clipb.clear() clipb.setText(str(self.txtBox.toPlainText())) self.lblCopied.setText('Copied!') def cleanup(self): self.rootKeyCopy.binPrivKey32_Plain.destroy() for addr in self.addrCopies: addr.binPrivKey32_Plain.destroy() self.rootKeyCopy = None self.addrCopies = None def accept(self): self.cleanup() super(DlgShowKeyList, self).accept() def reject(self): self.cleanup() super(DlgShowKeyList, self).reject() ################################################################################ class DlgTxFeeOptions(ArmoryDialog): def __init__(self, wlt, parent=None, main=None): super(DlgTxFeeOptions, self).__init__(parent, main) lblDescr = QLabel(\ 'Transaction fees go to people who contribute processing power to ' 'the Bitcoin network to process transactions and keep it secure.') lblDescr2 = QLabel(\ 'Nearly all transactions are guaranteed to be ' 'processed if a fee of 0.0005 BTC is included (less than $0.01 USD). You ' 'will be prompted for confirmation if a higher fee amount is required for ' 'your transaction.') ################################################################################ class DlgAddressProperties(ArmoryDialog): def __init__(self, wlt, parent=None, main=None): super(DlgAddressProperties, self).__init__(parent, main) ################################################################################ def extractTxInfo(pytx, rcvTime=None): ustx = None if isinstance(pytx, UnsignedTransaction): ustx = pytx pytx = ustx.pytxObj.copy() txHash = pytx.getHash() txOutToList, sumTxOut, txinFromList, sumTxIn, txTime, txBlk, txIdx = [None] * 7 txOutToList = pytx.makeRecipientsList() sumTxOut = sum([t[1] for t in txOutToList]) txcpp = Tx() if TheBDM.getBDMState() == 'BlockchainReady': txcpp = TheBDM.getTxByHash(txHash) if txcpp.isInitialized(): hgt = txcpp.getBlockHeight() if hgt < TheBDM.getTopBlockHeight(): headref = TheBDM.getHeaderByHeight(hgt) txTime = unixTimeToFormatStr(headref.getTimestamp()) txBlk = headref.getBlockHeight() txIdx = txcpp.getBlockTxIndex() else: if rcvTime == None: txTime = 'Unknown' elif rcvTime == -1: txTime = '[[Not broadcast yet]]' elif isinstance(rcvTime, basestring): txTime = rcvTime else: txTime = unixTimeToFormatStr(rcvTime) txBlk = UINT32_MAX txIdx = -1 txinFromList = [] if TheBDM.getBDMState() == 'BlockchainReady' and txcpp.isInitialized(): # Use BDM to get all the info about the TxOut being spent # Recip, value, block-that-incl-tx, tx-that-incl-txout, txOut-index haveAllInput = True for i in range(txcpp.getNumTxIn()): txinFromList.append([]) cppTxin = txcpp.getTxInCopy(i) prevTxHash = cppTxin.getOutPoint().getTxHash() if TheBDM.getTxByHash(prevTxHash).isInitialized(): prevTx = TheBDM.getPrevTx(cppTxin) prevTxOut = prevTx.getTxOutCopy(cppTxin.getOutPoint().getTxOutIndex()) txinFromList[-1].append(TheBDM.getSenderScrAddr(cppTxin)) txinFromList[-1].append(TheBDM.getSentValue(cppTxin)) if prevTx.isInitialized(): txinFromList[-1].append(prevTx.getBlockHeight()) txinFromList[-1].append(prevTx.getThisHash()) txinFromList[-1].append(prevTxOut.getIndex()) txinFromList[-1].append(prevTxOut.getScript()) else: LOGERROR('How did we get a bad parent pointer? (extractTxInfo)') #prevTxOut.pprint() txinFromList[-1].append('') txinFromList[-1].append('') txinFromList[-1].append('') txinFromList[-1].append('') else: haveAllInput = False txin = PyTxIn().unserialize(cppTxin.serialize()) scraddr = addrStr_to_scrAddr(TxInExtractAddrStrIfAvail(txin)) txinFromList[-1].append(scraddr) txinFromList[-1].append('') txinFromList[-1].append('') txinFromList[-1].append('') txinFromList[-1].append('') txinFromList[-1].append('') elif ustx is not None: haveAllInput = True for ustxi in ustx.ustxInputs: txinFromList.append([]) txinFromList[-1].append(script_to_scrAddr(ustxi.txoScript)) txinFromList[-1].append(ustxi.value) txinFromList[-1].append('') txinFromList[-1].append(hash256(ustxi.supportTx)) txinFromList[-1].append(ustxi.outpoint.txOutIndex) txinFromList[-1].append(ustxi.txoScript) else: # BDM is not initialized haveAllInput = False for i, txin in enumerate(pytx.inputs): scraddr = addrStr_to_scrAddr(TxInExtractAddrStrIfAvail(txin)) txinFromList.append([]) txinFromList[-1].append(scraddr) txinFromList[-1].append('') txinFromList[-1].append('') txinFromList[-1].append('') txinFromList[-1].append('') txinFromList[-1].append('') if haveAllInput: sumTxIn = sum([x[1] for x in txinFromList]) else: sumTxIn = None return [txHash, txOutToList, sumTxOut, txinFromList, sumTxIn, txTime, txBlk, txIdx] ################################################################################ class DlgDispTxInfo(ArmoryDialog): def __init__(self, pytx, wlt=None, parent=None, main=None, mode=None, \ precomputeIdxGray=None, precomputeAmt=None, txtime=None): """ This got freakin' complicated, because I'm trying to handle wallet/nowallet, BDM/noBDM and Std/Adv/Dev all at once. We can override the user mode as an input argument, in case a std user decides they want to see the tx in adv/dev mode """ super(DlgDispTxInfo, self).__init__(parent, main) self.mode = mode FIELDS = enum('Hash', 'OutList', 'SumOut', 'InList', 'SumIn', 'Time', 'Blk', 'Idx') self.data = extractTxInfo(pytx, txtime) # If this is actually a ustx in here... ustx = None if isinstance(pytx, UnsignedTransaction): ustx = pytx pytx = ustx.getPyTxSignedIfPossible() self.pytx = pytx.copy() if self.mode == None: self.mode = self.main.usermode txHash = self.data[FIELDS.Hash] haveWallet = (wlt != None) haveBDM = TheBDM.getBDMState() == 'BlockchainReady' # Should try to identify what is change and what's not wltLE = None IsNonStandard = False fee = None txAmt = self.data[FIELDS.SumOut] # Collect our own outputs only, and ID non-std tx svPairSelf = [] svPairOther = [] indicesSelf = [] indicesOther = [] indicesMakeGray = [] idx = 0 for scrType, amt, script, msInfo in self.data[FIELDS.OutList]: # If it's a multisig, pretend it's P2SH if scrType == CPP_TXOUT_MULTISIG: script = script_to_p2sh_script(script) scrType = CPP_TXOUT_P2SH if scrType in CPP_TXOUT_HAS_ADDRSTR: addrStr = script_to_addrStr(script) addr160 = addrStr_to_hash160(addrStr)[1] scrAddr = script_to_scrAddr(script) if haveWallet and wlt.hasAddr(addr160): svPairSelf.append([scrAddr, amt]) indicesSelf.append(idx) else: svPairOther.append([scrAddr, amt]) indicesOther.append(idx) else: IsNonStandard = True indicesOther.append(idx) idx += 1 txdir = None changeIndex = None svPairDisp = None if haveBDM and haveWallet and self.data[FIELDS.SumOut] and self.data[FIELDS.SumIn]: fee = self.data[FIELDS.SumOut] - self.data[FIELDS.SumIn] ldgr = wlt.getTxLedger() for le in ldgr: if le.getTxHash() == txHash: wltLE = le txAmt = le.getValue() # If we found the LE for this tx, then we can display much # more useful information... like ignoring change outputs, if le.isSentToSelf(): txdir = 'Sent-to-Self' svPairDisp = [] if len(self.pytx.outputs)==1: txAmt = fee triplet = self.data[FIELDS.OutList][0] scrAddr = script_to_scrAddr(triplet[2]) svPairDisp.append([scrAddr, triplet[1]]) else: txAmt, changeIndex = determineSentToSelfAmt(le, wlt) for i, triplet in enumerate(self.data[FIELDS.OutList]): if not i == changeIndex: scrAddr = script_to_scrAddr(triplet[2]) svPairDisp.append([scrAddr, triplet[1]]) else: indicesMakeGray.append(i) else: if le.getValue() > 0: txdir = 'Received' svPairDisp = svPairSelf indicesMakeGray.extend(indicesOther) if le.getValue() < 0: txdir = 'Sent' svPairDisp = svPairOther indicesMakeGray.extend(indicesSelf) break # If this is a USTX, the above calculation probably didn't do its job # It is possible, but it's also possible that this Tx has nothing to # do with our wallet, which is not the focus of the above loop/conditions # So we choose to pass in the amount we already computed based on extra # information available in the USTX structure if precomputeAmt: txAmt = precomputeAmt layout = QGridLayout() lblDescr = QLabel('Transaction Information:') layout.addWidget(lblDescr, 0, 0, 1, 1) frm = QFrame() frm.setFrameStyle(STYLE_RAISED) frmLayout = QGridLayout() lbls = [] # Show the transaction ID, with the user's preferred endianness # I hate BE, but block-explorer requires it so it's probably a better default endianness = self.main.getSettingOrSetDefault('PrefEndian', BIGENDIAN) estr = '' if self.mode in (USERMODE.Advanced, USERMODE.Expert): estr = ' (BE)' if endianness == BIGENDIAN else ' (LE)' lbls.append([]) lbls[-1].append(self.main.createToolTipWidget('Unique identifier for this transaction')) lbls[-1].append(QLabel('Transaction ID' + estr + ':')) # Want to display the hash of the Tx if we have a valid one: # A USTX does not have a valid hash until it's completely signed, though longTxt = '[[ Transaction ID cannot be determined without all signatures ]]' w, h = relaxedSizeStr(QRichLabel(''), longTxt) tempPyTx = self.pytx.copy() if ustx: finalTx = ustx.getBroadcastTxIfReady(verifySigs=False) if finalTx: tempPyTx = finalTx.copy() else: tempPyTx = None lbls[-1].append(QRichLabel('' '[[ Transaction ID cannot be determined without all signatures ]]' '')) if tempPyTx: txHash = binary_to_hex(tempPyTx.getHash(), endOut=endianness) lbls[-1].append(QLabel(txHash)) lbls[-1][-1].setMinimumWidth(w) if self.mode in (USERMODE.Expert,): # Add protocol version and locktime to the display lbls.append([]) lbls[-1].append(self.main.createToolTipWidget('Bitcoin Protocol Version Number')) lbls[-1].append(QLabel('Tx Version:')) lbls[-1].append(QLabel(str(self.pytx.version))) lbls.append([]) lbls[-1].append(self.main.createToolTipWidget( 'The time at which this transaction becomes valid.')) lbls[-1].append(QLabel('Lock-Time:')) if self.pytx.lockTime == 0: lbls[-1].append(QLabel('Immediate (0)')) elif self.pytx.lockTime < 500000000: lbls[-1].append(QLabel('Block %d' % self.pytx.lockTime)) else: lbls[-1].append(QLabel(unixTimeToFormatStr(self.pytx.lockTime))) lbls.append([]) lbls[-1].append(self.main.createToolTipWidget('Comment stored for this transaction in this wallet')) lbls[-1].append(QLabel('User Comment:')) if haveWallet and wlt.getComment(txHash): lbls[-1].append(QRichLabel(wlt.getComment(txHash))) else: lbls[-1].append(QRichLabel('[None]')) if not self.data[FIELDS.Time] == None: lbls.append([]) if self.data[FIELDS.Blk] >= 2 ** 32 - 1: lbls[-1].append(self.main.createToolTipWidget( 'The time that you computer first saw this transaction')) else: lbls[-1].append(self.main.createToolTipWidget( 'All transactions are eventually included in a "block." The ' 'time shown here is the time that the block entered the "blockchain."')) lbls[-1].append(QLabel('Transaction Time:')) lbls[-1].append(QLabel(self.data[FIELDS.Time])) if not self.data[FIELDS.Blk] == None: nConf = 0 if self.data[FIELDS.Blk] >= 2 ** 32 - 1: lbls.append([]) lbls[-1].append(self.main.createToolTipWidget( 'This transaction has not yet been included in a block. ' 'It usually takes 5-20 minutes for a transaction to get ' 'included in a block after the user hits the "Send" button.')) lbls[-1].append(QLabel('Block Number:')) lbls[-1].append(QRichLabel('Not in the blockchain yet')) else: idxStr = '' if not self.data[FIELDS.Idx] == None and self.mode == USERMODE.Expert: idxStr = ' (Tx #%d)' % self.data[FIELDS.Idx] lbls.append([]) lbls[-1].append(self.main.createToolTipWidget( 'Every transaction is eventually included in a "block" which ' 'is where the transaction is permanently recorded. A new block ' 'is produced approximately every 10 minutes.')) lbls[-1].append(QLabel('Included in Block:')) lbls[-1].append(QRichLabel(str(self.data[FIELDS.Blk]) + idxStr)) if TheBDM.getBDMState() == 'BlockchainReady': nConf = TheBDM.getTopBlockHeight() - self.data[FIELDS.Blk] + 1 lbls.append([]) lbls[-1].append(self.main.createToolTipWidget( 'The number of blocks that have been produced since ' 'this transaction entered the blockchain. A transaciton ' 'with 6 more confirmations is nearly impossible to reverse.')) lbls[-1].append(QLabel('Confirmations:')) lbls[-1].append(QRichLabel(str(nConf))) if svPairDisp == None and precomputeAmt == None: # Couldn't determine recip/change outputs lbls.append([]) lbls[-1].append(self.main.createToolTipWidget( 'Most transactions have at least a recipient output and a ' 'returned-change output. You do not have enough enough information ' 'to determine which is which, and so this fields shows the sum ' 'of all outputs.')) lbls[-1].append(QLabel('Sum of Outputs:')) lbls[-1].append(QLabel(coin2str(txAmt, maxZeros=1).strip() + ' BTC')) else: lbls.append([]) lbls[-1].append(self.main.createToolTipWidget( 'Bitcoins were either sent or received, or sent-to-self')) lbls[-1].append(QLabel('Transaction Direction:')) lbls[-1].append(QRichLabel(txdir)) lbls.append([]) lbls[-1].append(self.main.createToolTipWidget( 'The value shown here is the net effect on your ' 'wallet, including transaction fee.')) lbls[-1].append(QLabel('Transaction Amount:')) lbls[-1].append(QRichLabel(coin2str(txAmt, maxZeros=1).strip() + ' BTC')) if txAmt < 0: lbls[-1][-1].setText('' + lbls[-1][-1].text() + ' ') elif txAmt > 0: lbls[-1][-1].setText('' + lbls[-1][-1].text() + ' ') if not self.data[FIELDS.SumIn] == None: fee = self.data[FIELDS.SumIn] - self.data[FIELDS.SumOut] lbls.append([]) lbls[-1].append(self.main.createToolTipWidget( 'Transaction fees go to users supplying the Bitcoin network with ' 'computing power for processing transactions and maintaining security.')) lbls[-1].append(QLabel('Tx Fee Paid:')) lbls[-1].append(QLabel(coin2str(fee, maxZeros=0).strip() + ' BTC')) lastRow = 0 for row, lbl3 in enumerate(lbls): lastRow = row for i in range(3): lbl3[i].setAlignment(Qt.AlignLeft | Qt.AlignVCenter) lbl3[i].setTextInteractionFlags(Qt.TextSelectableByMouse | \ Qt.TextSelectableByKeyboard) frmLayout.addWidget(lbl3[0], row, 0, 1, 1) frmLayout.addWidget(lbl3[1], row, 1, 1, 1) frmLayout.addWidget(lbl3[2], row, 3, 1, 2) spacer = QSpacerItem(20, 20) frmLayout.addItem(spacer, 0, 2, len(lbls), 1) # Show the list of recipients, if possible numShow = 3 rlbls = [] if svPairDisp is not None: numRV = len(svPairDisp) for i, sv in enumerate(svPairDisp): rlbls.append([]) if i == 0: rlbls[-1].append(self.main.createToolTipWidget( 'All outputs of the transaction excluding change-' 'back-to-sender outputs. If this list does not look ' 'correct, it is possible that the change-output was ' 'detected incorrectly -- please check the complete ' 'input/output list below.')) rlbls[-1].append(QLabel('Recipients:')) else: rlbls[-1].extend([QLabel(), QLabel()]) rlbls[-1].append(QLabel(scrAddr_to_addrStr(sv[0]))) if numRV > 1: rlbls[-1].append(QLabel(coin2str(sv[1], maxZeros=1) + ' BTC')) else: rlbls[-1].append(QLabel('')) ffixBold = GETFONT('Fixed', 10) ffixBold.setWeight(QFont.Bold) rlbls[-1][-1].setFont(ffixBold) if numRV > numShow and i == numShow - 2: moreStr = '[%d more recipients]' % (numRV - numShow + 1) rlbls.append([]) rlbls[-1].extend([QLabel(), QLabel(), QLabel(moreStr), QLabel()]) break # ## for i, lbl4 in enumerate(rlbls): for j in range(4): lbl4[j].setTextInteractionFlags(Qt.TextSelectableByMouse | \ Qt.TextSelectableByKeyboard) row = lastRow + 1 + i frmLayout.addWidget(lbl4[0], row, 0, 1, 1) frmLayout.addWidget(lbl4[1], row, 1, 1, 1) frmLayout.addWidget(lbl4[2], row, 3, 1, 1) frmLayout.addWidget(lbl4[3], row, 4, 1, 1) # TxIns/Senders wWlt = relaxedSizeStr(GETFONT('Var'), 'A' * 10)[0] wAddr = relaxedSizeStr(GETFONT('Var'), 'A' * 31)[0] wAmt = relaxedSizeStr(GETFONT('Fixed'), 'A' * 20)[0] if ustx: self.txInModel = TxInDispModel(ustx, self.data[FIELDS.InList], self.main) else: self.txInModel = TxInDispModel(pytx, self.data[FIELDS.InList], self.main) self.txInView = QTableView() self.txInView.setModel(self.txInModel) self.txInView.setSelectionBehavior(QTableView.SelectRows) self.txInView.setSelectionMode(QTableView.SingleSelection) self.txInView.horizontalHeader().setStretchLastSection(True) self.txInView.verticalHeader().setDefaultSectionSize(20) self.txInView.verticalHeader().hide() w, h = tightSizeNChar(self.txInView, 1) self.txInView.setMinimumHeight(2 * (1.4 * h)) self.txInView.setMaximumHeight(5 * (1.4 * h)) self.txInView.hideColumn(TXINCOLS.OutPt) self.txInView.hideColumn(TXINCOLS.OutIdx) self.txInView.hideColumn(TXINCOLS.Script) self.txInView.hideColumn(TXINCOLS.AddrStr) if self.mode == USERMODE.Standard: initialColResize(self.txInView, [wWlt, wAddr, wAmt, 0, 0, 0, 0, 0, 0]) self.txInView.hideColumn(TXINCOLS.FromBlk) self.txInView.hideColumn(TXINCOLS.ScrType) self.txInView.hideColumn(TXINCOLS.Sequence) # self.txInView.setSelectionMode(QTableView.NoSelection) elif self.mode == USERMODE.Advanced: initialColResize(self.txInView, [0.8 * wWlt, 0.6 * wAddr, wAmt, 0, 0, 0, 0.2, 0, 0]) self.txInView.hideColumn(TXINCOLS.FromBlk) self.txInView.hideColumn(TXINCOLS.Sequence) # self.txInView.setSelectionMode(QTableView.NoSelection) elif self.mode == USERMODE.Expert: self.txInView.resizeColumnsToContents() self.txInView.setContextMenuPolicy(Qt.CustomContextMenu) self.txInView.customContextMenuRequested.connect(self.showContextMenuTxIn) # List of TxOuts/Recipients if not precomputeIdxGray is None: indicesMakeGray = precomputeIdxGray[:] self.txOutModel = TxOutDispModel(self.pytx, self.main, idxGray=indicesMakeGray) self.txOutView = QTableView() self.txOutView.setModel(self.txOutModel) self.txOutView.setSelectionBehavior(QTableView.SelectRows) self.txOutView.setSelectionMode(QTableView.SingleSelection) self.txOutView.verticalHeader().setDefaultSectionSize(20) self.txOutView.verticalHeader().hide() self.txOutView.setMinimumHeight(2 * (1.3 * h)) self.txOutView.setMaximumHeight(5 * (1.3 * h)) initialColResize(self.txOutView, [wWlt, 0.8 * wAddr, wAmt, 0.25, 0]) self.txOutView.hideColumn(TXOUTCOLS.Script) self.txOutView.hideColumn(TXOUTCOLS.AddrStr) if self.mode == USERMODE.Standard: self.txOutView.hideColumn(TXOUTCOLS.ScrType) initialColResize(self.txOutView, [wWlt, wAddr, 0.25, 0, 0]) self.txOutView.horizontalHeader().setStretchLastSection(True) # self.txOutView.setSelectionMode(QTableView.NoSelection) elif self.mode == USERMODE.Advanced: initialColResize(self.txOutView, [0.8 * wWlt, 0.6 * wAddr, wAmt, 0.25, 0]) # self.txOutView.setSelectionMode(QTableView.NoSelection) elif self.mode == USERMODE.Expert: initialColResize(self.txOutView, [wWlt, wAddr, wAmt, 0.25, 0]) # self.txOutView.resizeColumnsToContents() self.txOutView.setContextMenuPolicy(Qt.CustomContextMenu) self.txOutView.customContextMenuRequested.connect(self.showContextMenuTxOut) self.lblTxioInfo = QRichLabel('') self.lblTxioInfo.setMinimumWidth(tightSizeNChar(self.lblTxioInfo, 30)[0]) self.connect(self.txInView, SIGNAL('clicked(QModelIndex)'), \ lambda: self.dispTxioInfo('In')) self.connect(self.txOutView, SIGNAL('clicked(QModelIndex)'), \ lambda: self.dispTxioInfo('Out')) self.connect(self.txInView, SIGNAL('doubleClicked(QModelIndex)'), self.showTxInDialog) self.connect(self.txOutView, SIGNAL('doubleClicked(QModelIndex)'), self.showTxOutDialog) # scrFrm = QFrame() # scrFrm.setFrameStyle(STYLE_SUNKEN) # scrFrmLayout = Q self.scriptArea = QScrollArea() self.scriptArea.setWidget(self.lblTxioInfo) self.scriptFrm = makeLayoutFrame(HORIZONTAL, [self.scriptArea]) # self.scriptFrm.setMaximumWidth(150) self.scriptArea.setMaximumWidth(200) self.frmIOList = QFrame() self.frmIOList.setFrameStyle(STYLE_SUNKEN) frmIOListLayout = QGridLayout() lblInputs = QLabel('Transaction Inputs (Sending addresses):') ttipText = ('All transactions require previous transaction outputs as ' 'inputs. ') if not haveBDM: ttipText += ('Since the blockchain is not available, not all input ' 'information is available. You need to view this ' 'transaction on a system with an internet connection ' '(and blockchain) if you want to see the complete information.') else: ttipText += ('Each input is like an $X bill. Usually there are more inputs ' 'than necessary for the transaction, and there will be an extra ' 'output returning change to the sender') ttipInputs = self.main.createToolTipWidget(ttipText) lblOutputs = QLabel('Transaction Outputs (Receiving addresses):') ttipOutputs = self.main.createToolTipWidget( 'Shows all outputs, including other recipients ' 'of the same transaction, and change-back-to-sender outputs ' '(change outputs are displayed in light gray).') self.lblChangeDescr = QRichLabel( tr("""Some outputs might be "change." Click for more info"""), doWrap=False) self.lblChangeDescr.setOpenExternalLinks(True) inStrip = makeLayoutFrame(HORIZONTAL, [lblInputs, ttipInputs, STRETCH]) outStrip = makeLayoutFrame(HORIZONTAL, [lblOutputs, ttipOutputs, STRETCH]) frmIOListLayout.addWidget(inStrip, 0, 0, 1, 1) frmIOListLayout.addWidget(self.txInView, 1, 0, 1, 1) frmIOListLayout.addWidget(outStrip, 2, 0, 1, 1) frmIOListLayout.addWidget(self.txOutView, 3, 0, 1, 1) # frmIOListLayout.addWidget(self.lblTxioInfo, 0,1, 4,1) self.frmIOList.setLayout(frmIOListLayout) self.btnIOList = QPushButton('') self.btnCopy = QPushButton('Copy Raw Tx (Hex)') self.lblCopied = QRichLabel('') self.btnOk = QPushButton('OK') self.btnIOList.setCheckable(True) self.connect(self.btnIOList, SIGNAL(CLICKED), self.extraInfoClicked) self.connect(self.btnOk, SIGNAL(CLICKED), self.accept) self.connect(self.btnCopy, SIGNAL(CLICKED), self.copyRawTx) btnStrip = makeHorizFrame([self.btnIOList, self.btnCopy, self.lblCopied, 'Stretch', self.lblChangeDescr, 'Stretch', self.btnOk]) if not self.mode == USERMODE.Expert: self.btnCopy.setVisible(False) if self.mode == USERMODE.Standard: self.btnIOList.setChecked(False) else: self.btnIOList.setChecked(True) self.extraInfoClicked() frm.setLayout(frmLayout) layout.addWidget(frm, 2, 0, 1, 1) layout.addWidget(self.scriptArea, 2, 1, 1, 1) layout.addWidget(self.frmIOList, 3, 0, 1, 2) layout.addWidget(btnStrip, 4, 0, 1, 2) # bbox = QDialogButtonBox(QDialogButtonBox.Ok) # self.connect(bbox, SIGNAL('accepted()'), self.accept) # layout.addWidget(bbox, 6,0, 1,1) self.setLayout(layout) self.layout().setSizeConstraint(QLayout.SetFixedSize) self.setWindowTitle('Transaction Info') def extraInfoClicked(self): if self.btnIOList.isChecked(): self.frmIOList.setVisible(True) self.btnCopy.setVisible(True) self.lblCopied.setVisible(True) self.btnIOList.setText('<<< Less Info') self.lblChangeDescr.setVisible(True) self.scriptArea.setVisible(False) # self.mode == USERMODE.Expert) # Disabling script area now that you can double-click to get it else: self.frmIOList.setVisible(False) self.scriptArea.setVisible(False) self.btnCopy.setVisible(False) self.lblCopied.setVisible(False) self.lblChangeDescr.setVisible(False) self.btnIOList.setText('Advanced >>>') def dispTxioInfo(self, InOrOut): hexScript = None headStr = None if InOrOut == 'In': selection = self.txInView.selectedIndexes() if len(selection) == 0: return row = selection[0].row() hexScript = str(self.txInView.model().index(row, TXINCOLS.Script).data().toString()) headStr = 'TxIn Script:' elif InOrOut == 'Out': selection = self.txOutView.selectedIndexes() if len(selection) == 0: return row = selection[0].row() hexScript = str(self.txOutView.model().index(row, TXOUTCOLS.Script).data().toString()) headStr = 'TxOut Script:' if hexScript: binScript = hex_to_binary(hexScript) addrStr = None scrType = getTxOutScriptType(binScript) if scrType in CPP_TXOUT_HAS_ADDRSTR: addrStr = script_to_addrStr(binScript) oplist = convertScriptToOpStrings(hex_to_binary(hexScript)) opprint = [] prevOpIsPushData = False for op in oplist: if addrStr is None or not prevOpIsPushData: opprint.append(op) else: opprint.append(op + ' (%s)' % addrStr) prevOpIsPushData = False if 'pushdata' in op.lower(): prevOpIsPushData = True lblScript = QRichLabel('') lblScript.setText('Script:

' + '
'.join(opprint)) lblScript.setWordWrap(False) lblScript.setTextInteractionFlags(Qt.TextSelectableByMouse | \ Qt.TextSelectableByKeyboard) self.scriptArea.setWidget(makeLayoutFrame(VERTICAL, [lblScript])) self.scriptArea.setMaximumWidth(200) def copyRawTx(self): clipb = QApplication.clipboard() clipb.clear() #print "Binscript: " + binary_to_hex(self.pytx.inputs[0].binScript) clipb.setText(binary_to_hex(self.pytx.serialize())) self.lblCopied.setText('Copied to Clipboard!') ############################################################################# def showTxInDialog(self, *args): # I really should've just used a dictionary instead of list with enum indices FIELDS = enum('Hash', 'OutList', 'SumOut', 'InList', 'SumIn', 'Time', 'Blk', 'Idx') try: idx = self.txInView.selectedIndexes()[0].row() DlgDisplayTxIn(self, self.main, self.pytx, idx, self.data[FIELDS.InList]).exec_() except: LOGEXCEPT('Error showing TxIn') ############################################################################# def showTxOutDialog(self, *args): # I really should've just used a dictionary instead of list with enum indices FIELDS = enum('Hash', 'OutList', 'SumOut', 'InList', 'SumIn', 'Time', 'Blk', 'Idx') try: idx = self.txOutView.selectedIndexes()[0].row() DlgDisplayTxOut(self, self.main, self.pytx, idx).exec_() except: LOGEXCEPT('Error showing TxOut') ############################################################################# def showContextMenuTxIn(self, pos): menu = QMenu(self.txInView) std = (self.main.usermode == USERMODE.Standard) adv = (self.main.usermode == USERMODE.Advanced) dev = (self.main.usermode == USERMODE.Expert) if True: actCopySender = menu.addAction("Copy Sender Address") if True: actCopyWltID = menu.addAction("Copy Wallet ID") if True: actCopyAmount = menu.addAction("Copy Amount") if True: actMoreInfo = menu.addAction("More Info") idx = self.txInView.selectedIndexes()[0] action = menu.exec_(QCursor.pos()) if action == actMoreInfo: self.showTxInDialog() if action == actCopyWltID: s = str(self.txInView.model().index(idx.row(), TXINCOLS.WltID).data().toString()) elif action == actCopySender: s = str(self.txInView.model().index(idx.row(), TXINCOLS.Sender).data().toString()) elif action == actCopyAmount: s = str(self.txInView.model().index(idx.row(), TXINCOLS.Btc).data().toString()) #elif dev and action == actCopyOutPt: #s1 = str(self.txInView.model().index(idx.row(), TXINCOLS.OutPt).data().toString()) #s2 = str(self.txInView.model().index(idx.row(), TXINCOLS.OutIdx).data().toString()) #s = s1 + ':' + s2 #elif dev and action == actCopyScript: #s = str(self.txInView.model().index(idx.row(), TXINCOLS.Script).data().toString()) else: return clipb = QApplication.clipboard() clipb.clear() clipb.setText(s.strip()) ############################################################################# def showContextMenuTxOut(self, pos): menu = QMenu(self.txOutView) std = (self.main.usermode == USERMODE.Standard) adv = (self.main.usermode == USERMODE.Advanced) dev = (self.main.usermode == USERMODE.Expert) if True: actCopyRecip = menu.addAction("Copy Recipient Address") if True: actCopyWltID = menu.addAction("Copy Wallet ID") if True: actCopyAmount = menu.addAction("Copy Amount") if dev: actCopyScript = menu.addAction("Copy Raw Script") idx = self.txOutView.selectedIndexes()[0] action = menu.exec_(QCursor.pos()) if action == actCopyWltID: s = self.txOutView.model().index(idx.row(), TXOUTCOLS.WltID).data().toString() elif action == actCopyRecip: s = self.txOutView.model().index(idx.row(), TXOUTCOLS.AddrStr).data().toString() elif action == actCopyAmount: s = self.txOutView.model().index(idx.row(), TXOUTCOLS.Btc).data().toString() elif dev and action == actCopyScript: s = self.txOutView.model().index(idx.row(), TXOUTCOLS.Script).data().toString() else: return clipb = QApplication.clipboard() clipb.clear() clipb.setText(str(s).strip()) ################################################################################ class DlgDisplayTxIn(ArmoryDialog): def __init__(self, parent, main, pytxOrUstx, txiIndex, txinListFromBDM=None): super(DlgDisplayTxIn, self).__init__(parent, main) lblDescr = QRichLabel(tr("
TxIn Information
")) edtBrowse = QTextBrowser() edtBrowse.setFont(GETFONT('Fixed', 9)) edtBrowse.setReadOnly(True) edtBrowse.setLineWrapMode(QTextEdit.NoWrap) ustx = None pytx = pytxOrUstx if isinstance(pytx, UnsignedTransaction): ustx = pytx pytx = ustx.getPyTxSignedIfPossible() txin = pytx.inputs[txiIndex] scrType = getTxInScriptType(txin) typeName = CPP_TXIN_SCRIPT_NAMES[scrType] txHashBE = binary_to_hex(txin.outpoint.txHash, BIGENDIAN) txIdxBE = int_to_hex(txin.outpoint.txOutIndex, 4, BIGENDIAN) seqHexBE = int_to_hex(txin.intSeq, 4, BIGENDIAN) opStrings = convertScriptToOpStrings(txin.binScript) senderAddr = TxInExtractAddrStrIfAvail(txin) srcStr = '' if not senderAddr: senderAddr = '[[Cannot determine from TxIn Script]]' else: wltID = self.main.getWalletForAddr160(addrStr_to_hash160(senderAddr)[1]) if wltID: wlt = self.main.walletMap[wltID] srcStr = 'Wallet "%s" (%s)' % (wlt.labelName, wlt.uniqueIDB58) else: lbox = self.main.getLockboxByP2SHAddrStr(senderAddr) if lbox: srcStr = 'Lockbox %d-of-%d "%s" (%s)' % \ (lbox.M, lbox.N, lbox.shortName, lbox.uniqueIDB58) dispLines = [] dispLines.append('Information on TxIn:') dispLines.append(' TxIn Index: %d' % txiIndex) dispLines.append(' TxIn Spending: %s:%s' % (txHashBE, txIdxBE)) dispLines.append(' TxIn Sequence: 0x%s' % seqHexBE) if len(txin.binScript)>0: dispLines.append(' TxIn Script Type: %s' % typeName) dispLines.append(' TxIn Source: %s' % senderAddr) if srcStr: dispLines.append(' TxIn Wallet: %s' % srcStr) dispLines.append(' TxIn Script:') for op in opStrings: dispLines.append(' %s' % op) wltID = '' scrType = getTxInScriptType(txin) if txinListFromBDM and len(txinListFromBDM[txiIndex][0])>0: # We had a BDM to help us get info on each input -- use it scrAddr,val,blk,hsh,idx,script = txinListFromBDM[txiIndex] scrType = getTxOutScriptType(script) dispInfo = self.main.getDisplayStringForScript(script, 100, prefIDOverAddr=True) #print dispInfo addrStr = dispInfo['String'] wltID = dispInfo['WltID'] if not wltID: wltID = dispInfo['LboxID'] if not wltID: wltID = '' wouldBeAddrStr = dispInfo['AddrStr'] dispLines.append('') dispLines.append('') dispLines.append('Information on TxOut being spent by this TxIn:') dispLines.append(' Tx Hash: %s' % txHashBE) dispLines.append(' Tx Out Index: %d' % txin.outpoint.txOutIndex) dispLines.append(' Tx in Block#: %s' % str(blk)) dispLines.append(' TxOut Value: %s' % coin2strNZS(val)) dispLines.append(' TxOut Script Type: %s' % CPP_TXOUT_SCRIPT_NAMES[scrType]) dispLines.append(' TxOut Address: %s' % wouldBeAddrStr) if wltID: dispLines.append(' TxOut Wallet: %s' % dispInfo['String']) dispLines.append(' TxOUt Script:') opStrings = convertScriptToOpStrings(script) for op in opStrings: dispLines.append(' %s' % op) edtBrowse.setHtml(('
'.join(dispLines)).replace(' ', ' ')) btnDone = QPushButton(tr("Ok")) self.connect(btnDone, SIGNAL('clicked()'), self.accept) layout = QVBoxLayout() layout.addWidget(lblDescr) layout.addWidget(edtBrowse) layout.addWidget(makeHorizFrame(['Stretch', btnDone])) self.setLayout(layout) w,h = tightSizeNChar(edtBrowse, 100) self.setMinimumWidth(max(w, 500)) self.setMinimumHeight(max(20*h, 400)) ################################################################################ class DlgDisplayTxOut(ArmoryDialog): def __init__(self, parent, main, pytxOrUstx, txoIndex): super(DlgDisplayTxOut, self).__init__(parent, main) lblDescr = QRichLabel(tr("
TxOut Information
")) edtBrowse = QTextBrowser() edtBrowse.setFont(GETFONT('Fixed', 9)) edtBrowse.setReadOnly(True) edtBrowse.setLineWrapMode(QTextEdit.NoWrap) ustx = None pytx = pytxOrUstx if isinstance(pytx, UnsignedTransaction): ustx = pytx pytx = ustx.getPyTxSignedIfPossible() wltID = '' dispLines = [] txout = pytx.outputs[txoIndex] val = txout.value script = txout.binScript scrAddr = script_to_scrAddr(script) scrType = getTxOutScriptType(script) dispInfo = self.main.getDisplayStringForScript(script, 100, prefIDOverAddr=True) #print dispInfo addrStr = dispInfo['String'] wltID = dispInfo['WltID'] if not wltID: wltID = dispInfo['LboxID'] if not wltID: wltID = '' wouldBeAddrStr = dispInfo['AddrStr'] dispLines.append('Information on TxOut:') dispLines.append(' Tx Out Index: %d' % txoIndex) dispLines.append(' TxOut Value: %s' % coin2strNZS(val)) dispLines.append(' TxOut Script Type: %s' % CPP_TXOUT_SCRIPT_NAMES[scrType]) dispLines.append(' TxOut Address: %s' % wouldBeAddrStr) if wltID: dispLines.append(' TxOut Wallet: %s' % dispInfo['String']) else: dispLines.append(' TxOut Wallet: [[Unrelated to any loaded wallets]]') dispLines.append(' TxOut Script:') opStrings = convertScriptToOpStrings(script) for op in opStrings: dispLines.append(' %s' % op) edtBrowse.setHtml(('
'.join(dispLines)).replace(' ', ' ')) btnDone = QPushButton(tr("Ok")) self.connect(btnDone, SIGNAL('clicked()'), self.accept) layout = QVBoxLayout() layout.addWidget(lblDescr) layout.addWidget(edtBrowse) layout.addWidget(makeHorizFrame(['Stretch', btnDone])) self.setLayout(layout) w,h = tightSizeNChar(edtBrowse, 100) self.setMinimumWidth(max(w, 500)) self.setMinimumHeight(max(20*h, 400)) class GfxViewPaper(QGraphicsView): def __init__(self, parent=None, main=None): super(GfxViewPaper, self).__init__(parent) self.setRenderHint(QPainter.TextAntialiasing) class GfxItemText(QGraphicsTextItem): """ So far, I'm pretty bad at setting the boundingRect properly. I have hacked it to be usable for this specific situation, but it's not very reusable... """ def __init__(self, text, position, scene, font=GETFONT('Courier', 8), lineWidth=None): super(GfxItemText, self).__init__(text) self.setFont(font) self.setPos(position) if lineWidth: self.setTextWidth(lineWidth) self.setDefaultTextColor(self.PAGE_TEXT_COLOR) def boundingRect(self): w, h = relaxedSizeStr(self, self.toPlainText()) nLine = 1 if self.textWidth() > 0: twid = self.textWidth() nLine = max(1, int(float(w) / float(twid) + 0.5)) return QRectF(0, 0, w, nLine * (1.5 * h)) class GfxItemQRCode(QGraphicsItem): """ Converts binary data to base58, and encodes the Base58 characters in the QR-code. It seems weird to use Base58 instead of binary, but the QR-code has no problem with the size, instead, we want the data in the QR-code to match exactly what is human-readable on the page, which is in Base58. You must supply exactly one of "totalSize" or "modSize". TotalSize guarantees that the QR code will fit insides box of a given size. ModSize is how big each module/pixel of the QR code is, which means that a bigger QR block results in a bigger physical size on paper. """ def __init__(self, rawDataToEncode, maxSize=None): super(GfxItemQRCode, self).__init__() self.maxSize = maxSize self.updateQRData(rawDataToEncode) def boundingRect(self): return self.Rect def updateQRData(self, toEncode, maxSize=None): if maxSize == None: maxSize = self.maxSize else: self.maxSize = maxSize self.qrmtrx, self.modCt = CreateQRMatrix(toEncode, 'H') self.modSz = round(float(self.maxSize) / float(self.modCt) - 0.5) totalSize = self.modCt * self.modSz self.Rect = QRectF(0, 0, totalSize, totalSize) def paint(self, painter, option, widget=None): painter.setPen(Qt.NoPen) painter.setBrush(QBrush(QColor(0, 0, 0))) for r in range(self.modCt): for c in range(self.modCt): if self.qrmtrx[r][c] > 0: painter.drawRect(*[self.modSz * a for a in [r, c, 1, 1]]) class SimplePrintableGraphicsScene(object): def __init__(self, parent, main): """ We use the following coordinates: -----> +x | | V +y """ self.parent = parent self.main = main self.INCH = 72 self.PAPER_A4_WIDTH = 8.5 * self.INCH self.PAPER_A4_HEIGHT = 11.0 * self.INCH self.MARGIN_PIXELS = 0.6 * self.INCH self.PAGE_BKGD_COLOR = QColor(255, 255, 255) self.PAGE_TEXT_COLOR = QColor(0, 0, 0) self.fontFix = GETFONT('Courier', 9) self.fontVar = GETFONT('Times', 10) self.gfxScene = QGraphicsScene(self.parent) self.gfxScene.setSceneRect(0, 0, self.PAPER_A4_WIDTH, self.PAPER_A4_HEIGHT) self.gfxScene.setBackgroundBrush(self.PAGE_BKGD_COLOR) # For when it eventually makes it to the printer # self.printer = QPrinter(QPrinter.HighResolution) # self.printer.setPageSize(QPrinter.Letter) # self.gfxPainter = QPainter(self.printer) # self.gfxPainter.setRenderHint(QPainter.TextAntialiasing) # self.gfxPainter.setPen(Qt.NoPen) # self.gfxPainter.setBrush(QBrush(self.PAGE_TEXT_COLOR)) self.cursorPos = QPointF(self.MARGIN_PIXELS, self.MARGIN_PIXELS) self.lastCursorMove = (0, 0) def getCursorXY(self): return (self.cursorPos.x(), self.cursorPos.y()) def getScene(self): return self.gfxScene def pageRect(self): marg = self.MARGIN_PIXELS return QRectF(marg, marg, self.PAPER_A4_WIDTH - marg, self.PAPER_A4_HEIGHT - marg) def insidePageRect(self, pt=None): if pt == None: pt = self.cursorPos return self.pageRect.contains(pt) def moveCursor(self, dx, dy, absolute=False): xOld, yOld = self.getCursorXY() if absolute: self.cursorPos = QPointF(dx, dy) self.lastCursorMove = (dx - xOld, dy - yOld) else: self.cursorPos = QPointF(xOld + dx, yOld + dy) self.lastCursorMove = (dx, dy) def resetScene(self): self.gfxScene.clear() self.resetCursor() def resetCursor(self): self.cursorPos = QPointF(self.MARGIN_PIXELS, self.MARGIN_PIXELS) def newLine(self, extra_dy=0): xOld, yOld = self.getCursorXY() xNew = self.MARGIN_PIXELS yNew = self.cursorPos.y() + self.lastItemSize[1] + extra_dy - 5 self.moveCursor(xNew - xOld, yNew - yOld) def drawHLine(self, width=None, penWidth=1): if width == None: width = 3 * self.INCH currX, currY = self.getCursorXY() lineItem = QGraphicsLineItem(currX, currY, currX + width, currY) pen = QPen() pen.setWidth(penWidth) lineItem.setPen(pen) self.gfxScene.addItem(lineItem) rect = lineItem.boundingRect() self.lastItemSize = (rect.width(), rect.height()) self.moveCursor(rect.width(), 0) return self.lastItemSize def drawRect(self, w, h, edgeColor=QColor(0, 0, 0), fillColor=None, penWidth=1): rectItem = QGraphicsRectItem(self.cursorPos.x(), self.cursorPos.y(), w, h) if edgeColor == None: rectItem.setPen(QPen(Qt.NoPen)) else: pen = QPen(edgeColor) pen.setWidth(penWidth) rectItem.setPen(pen) if fillColor == None: rectItem.setBrush(QBrush(Qt.NoBrush)) else: rectItem.setBrush(QBrush(fillColor)) self.gfxScene.addItem(rectItem) rect = rectItem.boundingRect() self.lastItemSize = (rect.width(), rect.height()) self.moveCursor(rect.width(), 0) return self.lastItemSize def drawText(self, txt, font=None, wrapWidth=None, useHtml=True): if font == None: font = GETFONT('Var', 9) txtItem = QGraphicsTextItem('') if useHtml: txtItem.setHtml(toUnicode(txt)) else: txtItem.setPlainText(toUnicode(txt)) txtItem.setDefaultTextColor(self.PAGE_TEXT_COLOR) txtItem.setPos(self.cursorPos) txtItem.setFont(font) if not wrapWidth == None: txtItem.setTextWidth(wrapWidth) self.gfxScene.addItem(txtItem) rect = txtItem.boundingRect() self.lastItemSize = (rect.width(), rect.height()) self.moveCursor(rect.width(), 0) return self.lastItemSize def drawPixmapFile(self, pixFn, sizePx=None): pix = QPixmap(pixFn) if not sizePx == None: pix = pix.scaled(sizePx, sizePx) pixItem = QGraphicsPixmapItem(pix) pixItem.setPos(self.cursorPos) pixItem.setMatrix(QMatrix()) self.gfxScene.addItem(pixItem) rect = pixItem.boundingRect() self.lastItemSize = (rect.width(), rect.height()) self.moveCursor(rect.width(), 0) return self.lastItemSize def drawQR(self, qrdata, size=150): objQR = GfxItemQRCode(qrdata, size) objQR.setPos(self.cursorPos) objQR.setMatrix(QMatrix()) self.gfxScene.addItem(objQR) rect = objQR.boundingRect() self.lastItemSize = (rect.width(), rect.height()) self.moveCursor(rect.width(), 0) return self.lastItemSize def drawColumn(self, strList, rowHeight=None, font=None, useHtml=True): """ This draws a bunch of left-justified strings in a column. It returns a tight bounding box around all elements in the column, which can easily be used to start the next column. The rowHeight is returned, and also an available input, in case you are drawing text/font that has a different height in each column, and want to make sure they stay aligned. Just like the other methods, this leaves the cursor sitting at the original y-value, but shifted to the right by the width of the column. """ origX, origY = self.getCursorXY() maxColWidth = 0 cumulativeY = 0 for r in strList: szX, szY = self.drawText(tr(r), font=font, useHtml=useHtml) prevY = self.cursorPos.y() if rowHeight == None: self.newLine() szY = self.cursorPos.y() - prevY self.moveCursor(origX - self.MARGIN_PIXELS, 0) else: self.moveCursor(-szX, rowHeight) maxColWidth = max(maxColWidth, szX) cumulativeY += szY if rowHeight == None: rowHeight = float(cumulativeY) / len(strList) self.moveCursor(origX + maxColWidth, origY, absolute=True) return [QRectF(origX, origY, maxColWidth, cumulativeY), rowHeight] class DlgPrintBackup(ArmoryDialog): """ Open up a "Make Paper Backup" dialog, so the user can print out a hard copy of whatever data they need to recover their wallet should they lose it. This method is kind of a mess, because it ended up having to support printing of single-sheet, imported keys, single fragments, multiple fragments, with-or-without SecurePrint. """ def __init__(self, parent, main, wlt, printType='SingleSheet', \ fragMtrx=[], fragMtrxCrypt=[], fragData=[], privKey=None, chaincode=None): super(DlgPrintBackup, self).__init__(parent, main) self.wlt = wlt self.binMask = SecureBinaryData(0) self.binPriv = wlt.addrMap['ROOT'].binPrivKey32_Plain.copy() self.binChain = wlt.addrMap['ROOT'].chaincode.copy() # This badBackup stuff was implemented to avoid making backups if there is # an inconsistency in the data. Yes, this is like a goto! try: if privKey: if not chaincode: raise KeyDataError self.binPriv = privKey.copy() self.binChain = chaincode.copy() if self.binPriv.getSize() < 32: raise KeyDataError except: LOGEXCEPT("Problem with private key and/or chaincode. Aborting.") QMessageBox.critical(self, tr("Error Creating Backup"), tr(""" There was an error with the backup creator. The operation is being canceled to avoid making bad backups!"""), QMessageBox.Ok) return self.binImport = [] self.fragMtrx = fragMtrx self.doPrintFrag = printType.lower().startswith('frag') self.fragMtrx = fragMtrx self.fragMtrxCrypt = fragMtrxCrypt self.fragData = fragData if self.doPrintFrag: self.doMultiFrag = len(fragData['Range']) > 1 # A self-evident check of whether we need to print the chaincode. # If we derive the chaincode from the private key, and it matches # what's already in the wallet, we obviously don't need to print it! testChain = DeriveChaincodeFromRootKey(self.binPriv) self.noNeedChaincode = (testChain == self.binChain) # Save off imported addresses in case they need to be printed, too for a160, addr in self.wlt.addrMap.iteritems(): if addr.chainIndex == -2: if addr.binPrivKey32_Plain.getSize() == 33 or addr.isCompressed(): prv = addr.binPrivKey32_Plain.toBinStr()[:32] self.binImport.append([a160, SecureBinaryData(prv), 1]) prv = None else: self.binImport.append([a160, addr.binPrivKey32_Plain.copy(), 0]) # USE PRINTER MASK TO PREVENT NETWORK DEVICES FROM SEEING PRIVATE KEYS # Hardcode salt & IV because they should *never* change. # Rainbow tables aren't all that useful here because the user # is not creating the password -- it's *essentially* randomized # with 64-bits of real entropy. (though, it is deterministic # based on the private key, so that printing the backup multiple # times will produce the same password). SECPRINT = HardcodedKeyMaskParams() start = RightNow() self.randpass = SECPRINT['FUNC_PWD'](self.binPriv + self.binChain) self.binCrypt32 = SECPRINT['FUNC_KDF'](self.randpass) LOGINFO('Deriving SecurePrint code took %0.2f seconds' % (RightNow() - start)) MASK = lambda x: SECPRINT['FUNC_MASK'](x, ekey=self.binCrypt32) self.binPrivCrypt = MASK(self.binPriv) self.binChainCrypt = MASK(self.binChain) self.binImportCrypt = [] for i in range(len(self.binImport)): self.binImportCrypt.append([ self.binImport[i][0], \ MASK(self.binImport[i][1]), \ self.binImport[i][2] ]) # If there is data in the fragments matrix, also convert it if len(self.fragMtrx) > 0: self.fragMtrxCrypt = [] for sbdX, sbdY in self.fragMtrx: self.fragMtrxCrypt.append([sbdX.copy(), MASK(sbdY)]) self.binCrypt32.destroy() # We need to figure out how many imported keys fit on one page tempTxtItem = QGraphicsTextItem('') tempTxtItem.setPlainText(toUnicode('0123QAZjqlmYy')) tempTxtItem.setFont(GETFONT('Fix', 7)) self.importHgt = tempTxtItem.boundingRect().height() - 5 # Create the scene and the view. self.scene = SimplePrintableGraphicsScene(self, self.main) self.view = QGraphicsView() self.view.setRenderHint(QPainter.TextAntialiasing) self.view.setScene(self.scene.getScene()) self.chkImportPrint = QCheckBox(tr('Print imported keys')) self.connect(self.chkImportPrint, SIGNAL(CLICKED), self.clickImportChk) self.lblPageStr = QRichLabel(tr('Page:')) self.comboPageNum = QComboBox() self.lblPageMaxStr = QRichLabel('') self.connect(self.comboPageNum, SIGNAL('activated(int)'), self.redrawBackup) # We enable printing of imported addresses but not frag'ing them.... way # too much work for everyone (developer and user) to deal with 2x or 3x # the amount of data to type self.chkImportPrint.setVisible(len(self.binImport) > 0 and not self.doPrintFrag) self.lblPageStr.setVisible(False) self.comboPageNum.setVisible(False) self.lblPageMaxStr.setVisible(False) self.chkSecurePrint = QCheckBox(tr(""" Use SecurePrint\xe2\x84\xa2 to prevent exposing keys to printer or other network devices""")) if(self.doPrintFrag): self.chkSecurePrint.setChecked(self.fragData['Secure']) self.ttipSecurePrint = self.main.createToolTipWidget(tr(""" SecurePrint\xe2\x84\xa2 encrypts your backup with a code displayed on the screen, so that no other devices on your network see the sensitive data when you send it to the printer. If you turn on SecurePrint\xe2\x84\xa2 you must write the code on the page after it is done printing! There is no point in using this feature if you copy the data by hand.""")) self.lblSecurePrint = QRichLabel(tr(""" IMPORTANT: You must write the SecurePrint\xe2\x84\xa2 encryption code on each printed backup page! Your SecurePrint\xe2\x84\xa2 code is %s. Your backup will not work if this code is lost! """) % \ (htmlColor('TextWarn'), htmlColor('TextBlue'), self.randpass.toBinStr(), \ htmlColor('TextWarn'))) self.connect(self.chkSecurePrint, SIGNAL("clicked()"), self.redrawBackup) self.btnPrint = QPushButton('&Print...') self.btnPrint.setMinimumWidth(3 * tightSizeStr(self.btnPrint, 'Print...')[0]) self.btnCancel = QPushButton('&Cancel') self.connect(self.btnPrint, SIGNAL(CLICKED), self.print_) self.connect(self.btnCancel, SIGNAL(CLICKED), self.accept) if self.doPrintFrag: M, N = self.fragData['M'], self.fragData['N'] lblDescr = QRichLabel(tr(""" Print Wallet Backup Fragments

When any %d of these fragments are combined, all previous and future addresses generated by this wallet will be restored, giving you complete access to your bitcoins. The data can be copied by hand if a working printer is not available. Please make sure that all data lines contain 9 columns of 4 characters each (excluding "ID" lines).""") % M) else: withChain = '' if self.noNeedChaincode else 'and "Chaincode"' lblDescr = QRichLabel(tr(""" Print a Forever-Backup

Printing this sheet protects all previous and future addresses generated by this wallet! You can copy the "Root Key" %s by hand if a working printer is not available. Please make sure that all data lines contain 9 columns of 4 characters each.""") % withChain) lblDescr.setContentsMargins(5, 5, 5, 5) frmDescr = makeHorizFrame([lblDescr], STYLE_RAISED) self.redrawBackup() frmChkImport = makeHorizFrame([self.chkImportPrint, \ STRETCH, \ self.lblPageStr, \ self.comboPageNum, \ self.lblPageMaxStr]) frmSecurePrint = makeHorizFrame([self.chkSecurePrint, self.ttipSecurePrint, STRETCH]) frmButtons = makeHorizFrame([self.btnCancel, STRETCH, self.btnPrint]) layout = QVBoxLayout() layout.addWidget(frmDescr) layout.addWidget(frmChkImport) layout.addWidget(self.view) layout.addWidget(frmSecurePrint) layout.addWidget(self.lblSecurePrint) layout.addWidget(frmButtons) setLayoutStretch(layout, 0, 1, 0, 0, 0) self.setLayout(layout) self.setWindowIcon(QIcon(':/printer_icon.png')) self.setWindowTitle('Print Wallet Backup') # Apparently I can't programmatically scroll until after it's painted def scrollTop(): vbar = self.view.verticalScrollBar() vbar.setValue(vbar.minimum()) from twisted.internet import reactor reactor.callLater(0.01, scrollTop) # if len(self.bin # reactor.callLater(0.5, warnImportedKeys) def redrawBackup(self): cmbPage = 1 if self.comboPageNum.count() > 0: cmbPage = int(str(self.comboPageNum.currentText())) if self.doPrintFrag: cmbPage -= 1 if not self.doMultiFrag: cmbPage = self.fragData['Range'][0] elif self.comboPageNum.count() > 0: cmbPage = int(str(self.comboPageNum.currentText())) - 1 self.createPrintScene('Fragmented Backup', cmbPage) else: pgSelect = cmbPage if self.chkImportPrint.isChecked() else 1 if pgSelect == 1: self.createPrintScene('SingleSheetFirstPage', '') else: pg = pgSelect - 2 nKey = self.maxKeysPerPage self.createPrintScene('SingleSheetImported', [pg * nKey, (pg + 1) * nKey]) showPageCombo = self.chkImportPrint.isChecked() or \ (self.doPrintFrag and self.doMultiFrag) self.showPageSelect(showPageCombo) self.view.update() def clickImportChk(self): if self.numImportPages > 1 and self.chkImportPrint.isChecked(): ans = QMessageBox.warning(self, tr('Lots to Print!'), tr(""" This wallet contains %d imported keys, which will require %d pages to print. Not only will this use a lot of paper, it will be a lot of work to manually type in these keys in the event that you need to restore this backup. It is recommended that you do not print your imported keys and instead make a digital backup, which can be restored instantly if needed.

Do you want to print the imported keys, anyway?""") % \ (len(self.binImport), self.numImportPages), \ QMessageBox.Yes | QMessageBox.No) if not ans == QMessageBox.Yes: self.chkImportPrint.setChecked(False) showPageCombo = self.chkImportPrint.isChecked() or \ (self.doPrintFrag and self.doMultiFrag) self.showPageSelect(showPageCombo) self.comboPageNum.setCurrentIndex(0) self.redrawBackup() def showPageSelect(self, doShow=True): MARGIN = self.scene.MARGIN_PIXELS bottomOfPage = self.scene.pageRect().height() + MARGIN totalHgt = bottomOfPage - self.bottomOfSceneHeader self.maxKeysPerPage = int(totalHgt / (self.importHgt)) self.numImportPages = (len(self.binImport) - 1) / self.maxKeysPerPage + 1 if self.comboPageNum.count() == 0: if self.doPrintFrag: numFrag = len(self.fragData['Range']) for i in range(numFrag): self.comboPageNum.addItem(str(i + 1)) self.lblPageMaxStr.setText(tr('of %d') % (numFrag,)) else: for i in range(self.numImportPages + 1): self.comboPageNum.addItem(str(i + 1)) self.lblPageMaxStr.setText(tr('of %d') % (self.numImportPages + 1,)) self.lblPageStr.setVisible(doShow) self.comboPageNum.setVisible(doShow) self.lblPageMaxStr.setVisible(doShow) def print_(self): LOGINFO('Printing!') self.printer = QPrinter(QPrinter.HighResolution) self.printer.setPageSize(QPrinter.Letter) if QPrintDialog(self.printer).exec_(): painter = QPainter(self.printer) painter.setRenderHint(QPainter.TextAntialiasing) if self.doPrintFrag: for i in self.fragData['Range']: self.createPrintScene('Fragment', i) self.scene.getScene().render(painter) if not i == len(self.fragData['Range']) - 1: self.printer.newPage() else: self.createPrintScene('SingleSheetFirstPage', '') self.scene.getScene().render(painter) if len(self.binImport) > 0 and self.chkImportPrint.isChecked(): nKey = self.maxKeysPerPage for i in range(self.numImportPages): self.printer.newPage() self.createPrintScene('SingleSheetImported', [i * nKey, (i + 1) * nKey]) self.scene.getScene().render(painter) painter.end() # The last scene printed is what's displayed now. Set the combo box self.comboPageNum.setCurrentIndex(self.comboPageNum.count() - 1) if self.chkSecurePrint.isChecked(): QMessageBox.warning(self, 'SecurePrint Code', tr("""
You must write your SecurePrint\xe2\x84\xa2 code on each sheet of paper you just printed! Write it in the red box in upper-right corner of each printed page.

SecurePrint\xe2\x84\xa2 code: %s

NOTE: the above code is case-sensitive!""") % \ (htmlColor('TextBlue'), self.randpass.toBinStr()), \ QMessageBox.Ok) if self.chkSecurePrint.isChecked(): self.btnCancel.setText('Done') else: self.accept() def cleanup(self): self.binPriv.destroy() self.binChain.destroy() self.binPrivCrypt.destroy() self.binChainCrypt.destroy() self.randpass.destroy() for a160, priv, compr in self.binImport: priv.destroy() for x, y in self.fragMtrxCrypt: x.destroy() y.destroy() def accept(self): self.cleanup() super(DlgPrintBackup, self).accept() def reject(self): self.cleanup() super(DlgPrintBackup, self).reject() ############################################################################# ############################################################################# def createPrintScene(self, printType, printData): self.scene.gfxScene.clear() self.scene.resetCursor() pr = self.scene.pageRect() self.scene.drawRect(pr.width(), pr.height(), edgeColor=None, fillColor=QColor(255, 255, 255)) self.scene.resetCursor() INCH = self.scene.INCH MARGIN = self.scene.MARGIN_PIXELS doMask = self.chkSecurePrint.isChecked() if USE_TESTNET: self.scene.drawPixmapFile(':/armory_logo_green_h56.png') else: self.scene.drawPixmapFile(':/armory_logo_h36.png') self.scene.newLine() self.scene.drawText('Paper Backup for Armory Wallet', GETFONT('Var', 11)) self.scene.newLine() self.scene.drawText('http://www.bitcoinarmory.com') self.scene.newLine(extra_dy=20) self.scene.drawHLine() self.scene.newLine(extra_dy=20) ssType = ' (SecurePrint\xe2\x84\xa2)' if doMask else ' (Unencrypted)' if printType == 'SingleSheetFirstPage': bType = tr('Single-Sheet ' + ssType) elif printType == 'SingleSheetImported': bType = tr('Imported Keys ' + ssType) elif printType.lower().startswith('frag'): bstr = tr('Fragmented Backup (%d-of-%d)') % (self.fragData['M'], self.fragData['N']) bType = bstr + ' ' + tr(ssType) if printType.startswith('SingleSheet'): colRect, rowHgt = self.scene.drawColumn(['Wallet Version:', 'Wallet ID:', \ 'Wallet Name:', 'Backup Type:']) self.scene.moveCursor(15, 0) suf = 'c' if self.noNeedChaincode else 'a' colRect, rowHgt = self.scene.drawColumn(['1.35' + suf, self.wlt.uniqueIDB58, \ self.wlt.labelName, bType]) self.scene.moveCursor(15, colRect.y() + colRect.height(), absolute=True) else: colRect, rowHgt = self.scene.drawColumn(['Wallet Version:', 'Wallet ID:', \ 'Wallet Name:', 'Backup Type:', \ 'Fragment:']) baseID = self.fragData['FragIDStr'] fragNum = printData + 1 fragID = tr('%s-#%d') % \ (baseID, htmlColor('TextBlue'), fragNum) self.scene.moveCursor(15, 0) suf = 'c' if self.noNeedChaincode else 'a' colRect, rowHgt = self.scene.drawColumn(['1.35' + suf, self.wlt.uniqueIDB58, \ self.wlt.labelName, bType, fragID]) self.scene.moveCursor(15, colRect.y() + colRect.height(), absolute=True) # Display warning about unprotected key data wrap = 0.9 * self.scene.pageRect().width() if self.doPrintFrag: warnMsg = tr(""" Any subset of %d fragments with this ID (%s) are sufficient to recover all the coins contained in this wallet. To optimize the physical security of your wallet, please store the fragments in different locations.""") % \ (htmlColor('TextBlue'), self.fragData['M'], \ htmlColor('TextBlue'), self.fragData['FragIDStr']) else: container = 'this wallet' if printType == 'SingleSheetFirstPage' else 'these addresses' warnMsg = tr(""" WARNING: Anyone who has access to this page has access to all the bitcoins in %s! Please keep this page in a safe place.""" % container) self.scene.newLine() self.scene.drawText(warnMsg, GETFONT('Var', 9), wrapWidth=wrap) self.scene.newLine(extra_dy=20) self.scene.drawHLine() self.scene.newLine(extra_dy=20) if self.doPrintFrag: numLine = 'three' if self.noNeedChaincode else 'five' else: numLine = 'two' if self.noNeedChaincode else 'four' if printType == 'SingleSheetFirstPage': descrMsg = tr(""" The following %s lines backup all addresses ever generated by this wallet (previous and future). This can be used to recover your wallet if you forget your passphrase or suffer hardware failure and lose your wallet files. """ % numLine) elif printType == 'SingleSheetImported': if self.chkSecurePrint.isChecked(): descrMsg = tr(""" The following is a list of all private keys imported into your wallet before this backup was made. These keys are encrypted with the SecurePrint\xe2\x84\xa2 code and can only be restored by entering them into Armory. Print a copy of this backup without the SecurePrint\xe2\x84\xa2 option if you want to be able to import them into another application.""") else: descrMsg = tr(""" The following is a list of all private keys imported into your wallet before this backup was made. Each one must be copied manually into the application where you wish to import them. """) elif printType.lower().startswith('frag'): fragNum = printData + 1 descrMsg = tr(""" The following is fragment #%d for this wallet. """) % (htmlColor('TextBlue'), printData + 1) self.scene.drawText(descrMsg, GETFONT('var', 8), wrapWidth=wrap) self.scene.newLine(extra_dy=10) ########################################################################### # Draw the SecurePrint box if needed, frag pie, then return cursor prevCursor = self.scene.getCursorXY() self.lblSecurePrint.setVisible(doMask) if doMask: self.scene.resetCursor() self.scene.moveCursor(4.0 * INCH, 0) spWid, spHgt = 2.75 * INCH, 1.5 * INCH, if doMask: self.scene.drawRect(spWid, spHgt, edgeColor=QColor(180, 0, 0), penWidth=3) self.scene.resetCursor() self.scene.moveCursor(4.07 * INCH, 0.07 * INCH) self.scene.drawText(tr(""" CRITICAL: This backup will not work without the SecurePrint\xe2\x84\xa2 code displayed on the screen during printing. Copy it here in ink:"""), wrapWidth=spWid * 0.93, font=GETFONT('Var', 7)) self.scene.newLine(extra_dy=8) self.scene.moveCursor(4.07 * INCH, 0) codeWid, codeHgt = self.scene.drawText('Code:') self.scene.moveCursor(0, codeHgt - 3) wid = spWid - codeWid w, h = self.scene.drawHLine(width=wid * 0.9, penWidth=2) # Done drawing other stuff, so return to the original drawing location self.scene.moveCursor(*prevCursor, absolute=True) ########################################################################### ########################################################################### # Finally, draw the backup information. # If this page is only imported addresses, draw them then bail self.bottomOfSceneHeader = self.scene.cursorPos.y() if printType == 'SingleSheetImported': self.scene.moveCursor(0, 0.1 * INCH) importList = self.binImport if self.chkSecurePrint.isChecked(): importList = self.binImportCrypt for a160, priv, isCompr in importList[printData[0]:printData[1]]: comprByte = ('\x01' if isCompr == 1 else '') prprv = encodePrivKeyBase58(priv.toBinStr() + comprByte) toPrint = [prprv[i * 6:(i + 1) * 6] for i in range((len(prprv) + 5) / 6)] addrHint = ' (%s...)' % hash160_to_addrStr(a160)[:12] self.scene.drawText(' '.join(toPrint), GETFONT('Fix', 7)) self.scene.moveCursor(0.02 * INCH, 0) self.scene.drawText(addrHint, GETFONT('Var', 7)) self.scene.newLine(extra_dy=-3) prprv = None return if self.doPrintFrag: M = self.fragData['M'] Lines = [] Prefix = [] fmtrx = self.fragMtrxCrypt if doMask else self.fragMtrx try: yBin = fmtrx[printData][1].toBinStr() binID = self.wlt.uniqueIDBin IDLine = ComputeFragIDLineHex(M, printData, binID, doMask, addSpaces=True) if len(yBin) == 32: Prefix.append('ID:'); Lines.append(IDLine) Prefix.append('F1:'); Lines.append(makeSixteenBytesEasy(yBin[:16 ])) Prefix.append('F2:'); Lines.append(makeSixteenBytesEasy(yBin[ 16:])) elif len(yBin) == 64: Prefix.append('ID:'); Lines.append(IDLine) Prefix.append('F1:'); Lines.append(makeSixteenBytesEasy(yBin[:16 ])) Prefix.append('F2:'); Lines.append(makeSixteenBytesEasy(yBin[ 16:32 ])) Prefix.append('F3:'); Lines.append(makeSixteenBytesEasy(yBin[ 32:48 ])) Prefix.append('F4:'); Lines.append(makeSixteenBytesEasy(yBin[ 48:])) else: LOGERROR('yBin is not 32 or 64 bytes! It is %s bytes', len(yBin)) finally: yBin = None else: # Single-sheet backup if doMask: code12 = self.binPrivCrypt.toBinStr() code34 = self.binChainCrypt.toBinStr() else: code12 = self.binPriv.toBinStr() code34 = self.binChain.toBinStr() Lines = [] Prefix = [] Prefix.append('Root Key:'); Lines.append(makeSixteenBytesEasy(code12[:16])) Prefix.append(''); Lines.append(makeSixteenBytesEasy(code12[16:])) Prefix.append('Chaincode:'); Lines.append(makeSixteenBytesEasy(code34[:16])) Prefix.append(''); Lines.append(makeSixteenBytesEasy(code34[16:])) if self.noNeedChaincode: Prefix = Prefix[:2] Lines = Lines[:2] # Draw the prefix origX, origY = self.scene.getCursorXY() self.scene.moveCursor(20, 0) colRect, rowHgt = self.scene.drawColumn(['' + l + '' for l in Prefix]) nudgeDown = 2 # because the differing font size makes it look unaligned self.scene.moveCursor(20, nudgeDown) self.scene.drawColumn(Lines, font=GETFONT('Fixed', 8, bold=True), \ rowHeight=rowHgt, useHtml=False) self.scene.moveCursor(MARGIN, colRect.y() - 2, absolute=True) width = self.scene.pageRect().width() - 2 * MARGIN self.scene.drawRect(width, colRect.height() + 7, edgeColor=QColor(0, 0, 0), fillColor=None) self.scene.newLine(extra_dy=30) self.scene.drawText(tr(""" The following QR code is for convenience only. It contains the exact same data as the %s lines above. If you copy this backup by hand, you can safely ignore this QR code. """ % numLine), wrapWidth=4 * INCH) self.scene.moveCursor(20, 0) x, y = self.scene.getCursorXY() edgeRgt = self.scene.pageRect().width() - MARGIN edgeBot = self.scene.pageRect().height() - MARGIN qrSize = max(1.5 * INCH, min(edgeRgt - x, edgeBot - y, 2.0 * INCH)) self.scene.drawQR('\n'.join(Lines), qrSize) self.scene.newLine(extra_dy=25) Lines = None # Finally, draw some pie slices at the bottom if self.doPrintFrag: M, N = self.fragData['M'], self.fragData['N'] bottomOfPage = self.scene.pageRect().height() + MARGIN maxPieHeight = bottomOfPage - self.scene.getCursorXY()[1] - 8 maxPieWidth = int((self.scene.pageRect().width() - 2 * MARGIN) / N) - 10 pieSize = min(72., maxPieHeight, maxPieWidth) for i in range(N): startX, startY = self.scene.getCursorXY() drawSize = self.scene.drawPixmapFile(':/frag%df.png' % M, sizePx=pieSize) self.scene.moveCursor(10, 0) if i == printData: returnX, returnY = self.scene.getCursorXY() self.scene.moveCursor(startX, startY, absolute=True) self.scene.moveCursor(-5, -5) self.scene.drawRect(drawSize[0] + 10, \ drawSize[1] + 10, \ edgeColor=Colors.TextBlue, \ penWidth=3) self.scene.newLine() self.scene.moveCursor(startX - MARGIN, 0) self.scene.drawText('#%d' % \ (htmlColor('TextBlue'), fragNum), GETFONT('Var', 10)) self.scene.moveCursor(returnX, returnY, absolute=True) vbar = self.view.verticalScrollBar() vbar.setValue(vbar.minimum()) self.view.update() ################################################################################ def OpenPaperBackupWindow(backupType, parent, main, wlt, unlockTitle=None): if wlt.useEncryption and wlt.isLocked: if unlockTitle == None: unlockTitle = tr("Unlock Paper Backup") dlg = DlgUnlockWallet(wlt, parent, main, unlockTitle) if not dlg.exec_(): QMessageBox.warning(parent, tr('Unlock Failed'), tr(""" The wallet could not be unlocked. Please try again with the correct unlock passphrase."""), QMessageBox.Ok) return False result = True verifyText = '' if backupType == 'Single': result = DlgPrintBackup(parent, main, wlt).exec_() verifyText = tr(""" If the backup was printed with SecurePrint\xe2\x84\xa2, please make sure you wrote the SecurePrint\xe2\x84\xa2 code on the printed sheet of paper. Note that the code is case-sensitive!""") elif backupType == 'Frag': result = DlgFragBackup(parent, main, wlt).exec_() verifyText = tr(""" If the backup was created with SecurePrint\xe2\x84\xa2, please make sure you wrote the SecurePrint\xe2\x84\xa2 code on each fragment (or stored with each file fragment). The code is the same for all fragments.""") doTest = MsgBoxCustom(MSGBOX.Warning, tr('Verify Your Backup!'), tr(""" Verify your backup!

If you just made a backup, make sure that it is correct! The following steps are recommended to verify its integrity:
  • Verify each line of the backup data contains 9 columns of 4 letters each (excluding any "ID" lines).
  • %s
  • Use Armory's backup tester to test the backup before you physically secure it.

Armory has a backup tester that uses the exact same process as restoring your wallet, but stops before it writes any data to disk. Would you like to test your backup now? """) % verifyText, yesStr="Test Backup", noStr="Cancel") if doTest: if backupType == 'Single': DlgRestoreSingle(parent, main, True, wlt.uniqueIDB58).exec_() elif backupType == 'Frag': DlgRestoreFragged(parent, main, True, wlt.uniqueIDB58).exec_() return result ################################################################################ class DlgBadConnection(ArmoryDialog): def __init__(self, haveInternet, haveSatoshi, parent=None, main=None): super(DlgBadConnection, self).__init__(parent, main) layout = QGridLayout() lblWarnImg = QLabel() lblWarnImg.setPixmap(QPixmap(':/MsgBox_warning48.png')) lblWarnImg.setAlignment(Qt.AlignHCenter | Qt.AlignTop) lblDescr = QLabel() if not haveInternet and not CLI_OPTIONS.offline: lblDescr = QRichLabel(\ 'Armory was not able to detect an internet connection, so Armory ' 'will operate in "Offline" mode. In this mode, only wallet' '-management and unsigned-transaction functionality will be available. ' '

' 'If this is an error, please check your internet connection and ' 'restart Armory.

Would you like to continue in "Offline" mode? ') elif haveInternet and not haveSatoshi: lblDescr = QRichLabel(\ 'Armory was not able to detect the presence of Bitcoin-Qt or bitcoind ' 'client software (available at http://www.bitcoin.org). Please make sure that ' 'the one of those programs is...
' '
(1) ...open and connected to the network ' '
(2) ...on the same network as Armory (main-network or test-network)' '
(3) ...synchronized with the blockchain before ' 'starting Armory

Without the Bitcoin-Qt or bitcoind open, you will only ' 'be able to run Armory in "Offline" mode, which will not have access ' 'to new blockchain data, and you will not be able to send outgoing ' 'transactions

If you do not want to be in "Offline" mode, please ' 'restart Armory after one of these programs is open and synchronized with ' 'the network') else: # Nothing to do -- we shouldn't have even gotten here # self.reject() pass self.main.abortLoad = False def abortLoad(): self.main.abortLoad = True self.reject() lblDescr.setMinimumWidth(500) self.btnAccept = QPushButton("Continue in Offline Mode") self.btnCancel = QPushButton("Close Armory") self.connect(self.btnAccept, SIGNAL(CLICKED), self.accept) self.connect(self.btnCancel, SIGNAL(CLICKED), abortLoad) buttonBox = QDialogButtonBox() buttonBox.addButton(self.btnAccept, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) layout.addWidget(lblWarnImg, 0, 1, 2, 1) layout.addWidget(lblDescr, 0, 2, 1, 1) layout.addWidget(buttonBox, 1, 2, 1, 1) self.setLayout(layout) self.setWindowTitle('Network not available') ################################################################################ def readSigBlock(parent, fullPacket): addrB58, messageStr, pubkey, sig = '', '', '', '' lines = fullPacket.split('\n') readingMessage, readingPub, readingSig = False, False, False for i in range(len(lines)): s = lines[i].strip() # ADDRESS if s.startswith('Addr'): addrB58 = s.split(':')[-1].strip() # MESSAGE STRING if s.startswith('Message') or readingMessage: readingMessage = True if s.startswith('Pub') or s.startswith('Sig') or ('END-CHAL' in s): readingMessage = False else: # Message string needs to be exact, grab what's between the # double quotes, no newlines iq1 = s.index('"') + 1 iq2 = s.index('"', iq1) messageStr += s[iq1:iq2] # PUBLIC KEY if s.startswith('Pub') or readingPub: readingPub = True if s.startswith('Sig') or ('END-SIGNATURE-BLOCK' in s): readingPub = False else: pubkey += s.split(':')[-1].strip().replace(' ', '') # SIGNATURE if s.startswith('Sig') or readingSig: readingSig = True if 'END-SIGNATURE-BLOCK' in s: readingSig = False else: sig += s.split(':')[-1].strip().replace(' ', '') if len(pubkey) > 0: try: pubkey = hex_to_binary(pubkey) if len(pubkey) not in (32, 33, 64, 65): raise except: QMessageBox.critical(parent, 'Bad Public Key', \ 'Public key data was not recognized', QMessageBox.Ok) pubkey = '' if len(sig) > 0: try: sig = hex_to_binary(sig) except: QMessageBox.critical(parent, 'Bad Signature', \ 'Signature data is malformed!', QMessageBox.Ok) sig = '' pubkeyhash = hash160(pubkey) if not pubkeyhash == addrStr_to_hash160(addrB58)[1]: QMessageBox.critical(parent, 'Address Mismatch', \ '!!! The address included in the signature block does not ' 'match the supplied public key! This should never happen, ' 'and may in fact be an attempt to mislead you !!!', QMessageBox.Ok) sig = '' return addrB58, messageStr, pubkey, sig ################################################################################ def makeSigBlock(addrB58, MessageStr, binPubkey='', binSig=''): lineWid = 50 s = '-----BEGIN-SIGNATURE-BLOCK'.ljust(lineWid + 13, '-') + '\n' ### Address ### s += 'Address: %s\n' % addrB58 ### Message ### chPerLine = lineWid - 2 nMessageLines = (len(MessageStr) - 1) / chPerLine + 1 for i in range(nMessageLines): cLine = 'Message: "%s"\n' if i == 0 else ' "%s"\n' s += cLine % MessageStr[i * chPerLine:(i + 1) * chPerLine] ### Public Key ### if len(binPubkey) > 0: hexPub = binary_to_hex(binPubkey) nPubLines = (len(hexPub) - 1) / lineWid + 1 for i in range(nPubLines): pLine = 'PublicKey: %s\n' if i == 0 else ' %s\n' s += pLine % hexPub[i * lineWid:(i + 1) * lineWid] ### Signature ### if len(binSig) > 0: hexSig = binary_to_hex(binSig) nSigLines = (len(hexSig) - 1) / lineWid + 1 for i in range(nSigLines): sLine = 'Signature: %s\n' if i == 0 else ' %s\n' s += sLine % hexSig[i * lineWid:(i + 1) * lineWid] s += '-----END-SIGNATURE-BLOCK'.ljust(lineWid + 13, '-') + '\n' return s class DlgExecLongProcess(ArmoryDialog): """ Execute a processing that may require having the user to wait a while. Should appear like a splash screen, and will automatically close when the processing is done. As such, you should have very little text, just in case it finishes immediately, the user won't have time to read it. DlgExecLongProcess(execFunc, 'Short Description', self, self.main).exec_() """ def __init__(self, funcExec, msg='', parent=None, main=None): super(DlgExecLongProcess, self).__init__(parent, main) self.func = funcExec waitFont = GETFONT('Var', 14) descrFont = GETFONT('Var', 12) palette = QPalette() palette.setColor(QPalette.Window, QColor(235, 235, 255)) self.setPalette(palette); self.setAutoFillBackground(True) if parent: qr = parent.geometry() x, y, w, h = qr.left(), qr.top(), qr.width(), qr.height() dlgW = relaxedSizeStr(waitFont, msg)[0] dlgW = min(dlgW, 400) dlgH = 150 self.setGeometry(int(x + w / 2 - dlgW / 2), int(y + h / 2 - dlgH / 2), dlgW, dlgH) lblWaitMsg = QRichLabel('Please Wait...') lblWaitMsg.setFont(waitFont) lblWaitMsg.setAlignment(Qt.AlignVCenter | Qt.AlignHCenter) lblDescrMsg = QRichLabel(msg) lblDescrMsg.setFont(descrFont) lblDescrMsg.setAlignment(Qt.AlignVCenter | Qt.AlignHCenter) self.setWindowFlags(Qt.SplashScreen) layout = QVBoxLayout() layout.addWidget(lblWaitMsg) layout.addWidget(lblDescrMsg) self.setLayout(layout) def exec_(self): def execAndClose(): self.func() self.accept() from twisted.internet import reactor reactor.callLater(0.1, execAndClose) QDialog.exec_(self) ################################################################################ class DlgECDSACalc(ArmoryDialog): def __init__(self, parent=None, main=None, tabStart=0): super(DlgECDSACalc, self).__init__(parent, main) dispFont = GETFONT('Var', 8) w, h = tightSizeNChar(dispFont, 40) ########################################################################## ########################################################################## # TAB: secp256k1 ########################################################################## ########################################################################## # STUB: I'll probably finish implementing this eventually.... eccWidget = QWidget() tabEccLayout = QGridLayout() self.txtScalarScalarA = QLineEdit() self.txtScalarScalarB = QLineEdit() self.txtScalarScalarC = QLineEdit() self.txtScalarScalarC.setReadOnly(True) self.txtScalarPtA = QLineEdit() self.txtScalarPtB_x = QLineEdit() self.txtScalarPtB_y = QLineEdit() self.txtScalarPtC_x = QLineEdit() self.txtScalarPtC_y = QLineEdit() self.txtScalarPtC_x.setReadOnly(True) self.txtScalarPtC_y.setReadOnly(True) self.txtPtPtA_x = QLineEdit() self.txtPtPtA_y = QLineEdit() self.txtPtPtB_x = QLineEdit() self.txtPtPtB_y = QLineEdit() self.txtPtPtC_x = QLineEdit() self.txtPtPtC_y = QLineEdit() self.txtPtPtC_x.setReadOnly(True) self.txtPtPtC_y.setReadOnly(True) eccTxtList = [ \ self.txtScalarScalarA, self.txtScalarScalarB, \ self.txtScalarScalarC, self.txtScalarPtA, self.txtScalarPtB_x, \ self.txtScalarPtB_y, self.txtScalarPtC_x, self.txtScalarPtC_y, \ self.txtPtPtA_x, self.txtPtPtA_y, self.txtPtPtB_x, \ self.txtPtPtB_y, self.txtPtPtC_x, self.txtPtPtC_y] dispFont = GETFONT('Var', 8) w, h = tightSizeNChar(dispFont, 60) for txt in eccTxtList: txt.setMinimumWidth(w) txt.setFont(dispFont) self.btnCalcSS = QPushButton('Multiply Scalars (mod n)') self.btnCalcSP = QPushButton('Scalar Multiply EC Point') self.btnCalcPP = QPushButton('Add EC Points') self.btnClearSS = QPushButton('Clear') self.btnClearSP = QPushButton('Clear') self.btnClearPP = QPushButton('Clear') imgPlus = QRichLabel('+') imgTimes1 = QRichLabel('*') imgTimes2 = QRichLabel('*') imgDown = QRichLabel('') self.connect(self.btnCalcSS, SIGNAL(CLICKED), self.multss) self.connect(self.btnCalcSP, SIGNAL(CLICKED), self.multsp) self.connect(self.btnCalcPP, SIGNAL(CLICKED), self.addpp) ########################################################################## # Scalar-Scalar Multiply sslblA = QRichLabel('a', hAlign=Qt.AlignHCenter) sslblB = QRichLabel('b', hAlign=Qt.AlignHCenter) sslblC = QRichLabel('a*b mod n', hAlign=Qt.AlignHCenter) ssLayout = QGridLayout() ssLayout.addWidget(sslblA, 0, 0, 1, 1) ssLayout.addWidget(sslblB, 0, 2, 1, 1) ssLayout.addWidget(self.txtScalarScalarA, 1, 0, 1, 1) ssLayout.addWidget(imgTimes1, 1, 1, 1, 1) ssLayout.addWidget(self.txtScalarScalarB, 1, 2, 1, 1) ssLayout.addWidget(makeHorizFrame([STRETCH, self.btnCalcSS, STRETCH]), \ 2, 0, 1, 3) ssLayout.addWidget(makeHorizFrame([STRETCH, sslblC, self.txtScalarScalarC, STRETCH]), \ 3, 0, 1, 3) ssLayout.setVerticalSpacing(1) frmSS = QFrame() frmSS.setFrameStyle(STYLE_SUNKEN) frmSS.setLayout(ssLayout) ########################################################################## # Scalar-ECPoint Multiply splblA = QRichLabel('a', hAlign=Qt.AlignHCenter) splblB = QRichLabel('B', hAlign=Qt.AlignHCenter) splblBx = QRichLabel('Bx', hAlign=Qt.AlignRight) splblBy = QRichLabel('By', hAlign=Qt.AlignRight) splblC = QRichLabel('C = a*B', hAlign=Qt.AlignHCenter) splblCx = QRichLabel('(a*B)x', hAlign=Qt.AlignRight) splblCy = QRichLabel('(a*B)y', hAlign=Qt.AlignRight) spLayout = QGridLayout() spLayout.addWidget(splblA, 0, 0, 1, 1) spLayout.addWidget(splblB, 0, 2, 1, 1) spLayout.addWidget(self.txtScalarPtA, 1, 0, 1, 1) spLayout.addWidget(imgTimes2, 1, 1, 1, 1) spLayout.addWidget(self.txtScalarPtB_x, 1, 2, 1, 1) spLayout.addWidget(self.txtScalarPtB_y, 2, 2, 1, 1) spLayout.addWidget(makeHorizFrame([STRETCH, self.btnCalcSP, STRETCH]), \ 3, 0, 1, 3) spLayout.addWidget(makeHorizFrame([STRETCH, splblCx, self.txtScalarPtC_x, STRETCH]), \ 4, 0, 1, 3) spLayout.addWidget(makeHorizFrame([STRETCH, splblCy, self.txtScalarPtC_y, STRETCH]), \ 5, 0, 1, 3) spLayout.setVerticalSpacing(1) frmSP = QFrame() frmSP.setFrameStyle(STYLE_SUNKEN) frmSP.setLayout(spLayout) ########################################################################## # ECPoint Addition pplblA = QRichLabel('A', hAlign=Qt.AlignHCenter) pplblB = QRichLabel('B', hAlign=Qt.AlignHCenter) pplblAx = QRichLabel('Ax', hAlign=Qt.AlignHCenter) pplblAy = QRichLabel('Ay', hAlign=Qt.AlignHCenter) pplblBx = QRichLabel('Bx', hAlign=Qt.AlignHCenter) pplblBy = QRichLabel('By', hAlign=Qt.AlignHCenter) pplblC = QRichLabel('C = A+B', hAlign=Qt.AlignHCenter) pplblCx = QRichLabel('(A+B)x', hAlign=Qt.AlignRight) pplblCy = QRichLabel('(A+B)y', hAlign=Qt.AlignRight) ppLayout = QGridLayout() ppLayout.addWidget(pplblA, 0, 0, 1, 1) ppLayout.addWidget(pplblB, 0, 2, 1, 1) ppLayout.addWidget(self.txtPtPtA_x, 1, 0, 1, 1) ppLayout.addWidget(self.txtPtPtA_y, 2, 0, 1, 1) ppLayout.addWidget(imgPlus, 1, 1, 2, 1) ppLayout.addWidget(self.txtPtPtB_x, 1, 2, 1, 1) ppLayout.addWidget(self.txtPtPtB_y, 2, 2, 1, 1) ppLayout.addWidget(makeHorizFrame([STRETCH, self.btnCalcPP, STRETCH]), \ 3, 0, 1, 3) ppLayout.addWidget(makeHorizFrame([STRETCH, pplblCx, self.txtPtPtC_x, STRETCH]), \ 4, 0, 1, 3) ppLayout.addWidget(makeHorizFrame([STRETCH, pplblCy, self.txtPtPtC_y, STRETCH]), \ 5, 0, 1, 3) ppLayout.setVerticalSpacing(1) frmPP = QFrame() frmPP.setFrameStyle(STYLE_SUNKEN) frmPP.setLayout(ppLayout) gxstr = '79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798' gystr = '483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8' lblDescr = QRichLabel(tr(""" Use this form to perform Bitcoin elliptic curve calculations. All operations are performed on the secp256k1 elliptic curve, which is the one used for Bitcoin. Supply all values as 32-byte, big-endian, hex-encoded integers.

The following is the secp256k1 generator point coordinates (G):
Gx: %s
Gy: %s""") % (gxstr, gystr)) lblDescr.setTextInteractionFlags(Qt.TextSelectableByMouse | \ Qt.TextSelectableByKeyboard) btnClear = QPushButton('Clear') btnClear.setMaximumWidth(2 * relaxedSizeStr(btnClear, 'Clear')[0]) self.connect(btnClear, SIGNAL(CLICKED), self.eccClear) btnBack = QPushButton('<<< Go Back') self.connect(btnBack, SIGNAL(CLICKED), self.accept) frmBack = makeHorizFrame([btnBack, STRETCH]) eccLayout = QVBoxLayout() eccLayout.addWidget(makeHorizFrame([lblDescr, btnClear])) eccLayout.addWidget(frmSS) eccLayout.addWidget(frmSP) eccLayout.addWidget(frmBack) eccWidget.setLayout(eccLayout) calcLayout = QHBoxLayout() calcLayout.addWidget(eccWidget) self.setLayout(calcLayout) self.setWindowTitle('ECDSA Calculator') self.setWindowIcon(QIcon(self.main.iconfile)) ############################################################################# def getBinary(self, widget, name): try: hexVal = str(widget.text()) binVal = hex_to_binary(hexVal) except: QMessageBox.critical(self, 'Bad Input', \ 'Value "%s" is invalid. Make sure the value is specified in ' 'hex, big-endian' % name , QMessageBox.Ok) return '' return binVal ############################################################################# def multss(self): binA = self.getBinary(self.txtScalarScalarA, 'a') binB = self.getBinary(self.txtScalarScalarB, 'b') C = CryptoECDSA().ECMultiplyScalars(binA, binB) self.txtScalarScalarC.setText(binary_to_hex(C)) for txt in [self.txtScalarScalarA, \ self.txtScalarScalarB, \ self.txtScalarScalarC]: txt.setCursorPosition(0) ############################################################################# def multsp(self): binA = self.getBinary(self.txtScalarPtA, 'a') binBx = self.getBinary(self.txtScalarPtB_x, 'Bx') binBy = self.getBinary(self.txtScalarPtB_y, 'By') if not CryptoECDSA().ECVerifyPoint(binBx, binBy): QMessageBox.critical(self, 'Invalid EC Point', \ 'The point you specified (B) is not on the ' 'elliptic curved used in Bitcoin (secp256k1).', QMessageBox.Ok) return C = CryptoECDSA().ECMultiplyPoint(binA, binBx, binBy) self.txtScalarPtC_x.setText(binary_to_hex(C[:32])) self.txtScalarPtC_y.setText(binary_to_hex(C[32:])) for txt in [self.txtScalarPtA, \ self.txtScalarPtB_x, self.txtScalarPtB_y, \ self.txtScalarPtC_x, self.txtScalarPtC_y]: txt.setCursorPosition(0) ############################################################################# def addpp(self): binAx = self.getBinary(self.txtPtPtA_x, 'Ax') binAy = self.getBinary(self.txtPtPtA_y, 'Ay') binBx = self.getBinary(self.txtPtPtB_x, 'Bx') binBy = self.getBinary(self.txtPtPtB_y, 'By') if not CryptoECDSA().ECVerifyPoint(binAx, binAy): QMessageBox.critical(self, 'Invalid EC Point', \ 'The point you specified (A) is not on the ' 'elliptic curved used in Bitcoin (secp256k1).', QMessageBox.Ok) return if not CryptoECDSA().ECVerifyPoint(binBx, binBy): QMessageBox.critical(self, 'Invalid EC Point', \ 'The point you specified (B) is not on the ' 'elliptic curved used in Bitcoin (secp256k1).', QMessageBox.Ok) return C = CryptoECDSA().ECAddPoints(binAx, binAy, binBx, binBy) self.txtPtPtC_x.setText(binary_to_hex(C[:32])) self.txtPtPtC_y.setText(binary_to_hex(C[32:])) for txt in [self.txtPtPtA_x, self.txtPtPtA_y, \ self.txtPtPtB_x, self.txtPtPtB_y, \ self.txtPtPtC_x, self.txtPtPtC_y]: txt.setCursorPosition(0) ############################################################################# def eccClear(self): self.txtScalarScalarA.setText('') self.txtScalarScalarB.setText('') self.txtScalarScalarC.setText('') self.txtScalarPtA.setText('') self.txtScalarPtB_x.setText('') self.txtScalarPtB_y.setText('') self.txtScalarPtC_x.setText('') self.txtScalarPtC_y.setText('') self.txtPtPtA_x.setText('') self.txtPtPtA_y.setText('') self.txtPtPtB_x.setText('') self.txtPtPtB_y.setText('') self.txtPtPtC_x.setText('') self.txtPtPtC_y.setText('') ################################################################################ class DlgAddressBook(ArmoryDialog): """ This dialog is provided a widget which has a "setText()" method. When the user selects the address, this dialog will enter the text into the widget and then close itself. """ def __init__(self, parent, main, putResultInWidget=None, \ defaultWltID=None, \ actionStr='Select', \ selectExistingOnly=False, \ selectMineOnly=False, \ getPubKey=False, showLockboxes=True): super(DlgAddressBook, self).__init__(parent, main) self.target = putResultInWidget self.actStr = actionStr self.returnPubKey = getPubKey self.isBrowsingOnly = (self.target == None) if defaultWltID == None: defaultWltID = self.main.walletIDList[0] self.wlt = self.main.walletMap[defaultWltID] lblDescr = QRichLabel('Choose an address from your transaction history, ' 'or your own wallet. If you choose to send to one ' 'of your own wallets, the next unused address in ' 'that wallet will be used.') if self.isBrowsingOnly or selectExistingOnly: lblDescr = QRichLabel('Browse all receiving addresses in ' 'this wallet, and all addresses to which this ' 'wallet has sent bitcoins.') lblToWlt = QRichLabel('Send to Wallet:') lblToAddr = QRichLabel('Send to Address:') if self.isBrowsingOnly: lblToWlt.setVisible(False) lblToAddr.setVisible(False) rowHeight = tightSizeStr(self.font, 'XygjpHI')[1] self.wltDispModel = AllWalletsDispModel(self.main) self.wltDispView = QTableView() self.wltDispView.setModel(self.wltDispModel) self.wltDispView.setSelectionBehavior(QTableView.SelectRows) self.wltDispView.setSelectionMode(QTableView.SingleSelection) self.wltDispView.horizontalHeader().setStretchLastSection(True) self.wltDispView.verticalHeader().setDefaultSectionSize(20) self.wltDispView.setMaximumHeight(rowHeight * 7.7) self.wltDispView.hideColumn(WLTVIEWCOLS.Visible) initialColResize(self.wltDispView, [0.15, 0.30, 0.2, 0.20]) self.connect(self.wltDispView.selectionModel(), \ SIGNAL('currentChanged(const QModelIndex &, const QModelIndex &)'), \ self.wltTableClicked) # DISPLAY sent-to addresses self.addrBookTxModel = None self.addrBookTxView = QTableView() self.addrBookTxView.setSortingEnabled(True) self.connect(self.addrBookTxView, SIGNAL('doubleClicked(QModelIndex)'), \ self.dblClickAddressTx) self.addrBookTxView.setContextMenuPolicy(Qt.CustomContextMenu) self.addrBookTxView.customContextMenuRequested.connect(self.showContextMenuTx) # DISPLAY receiving addresses self.addrBookRxModel = None self.addrBookRxView = QTableView() self.addrBookRxView.setSortingEnabled(True) self.connect(self.addrBookRxView, SIGNAL('doubleClicked(QModelIndex)'), \ self.dblClickAddressRx) self.addrBookRxView.setContextMenuPolicy(Qt.CustomContextMenu) self.addrBookRxView.customContextMenuRequested.connect(self.showContextMenuRx) self.tabWidget = QTabWidget() self.tabWidget.addTab(self.addrBookRxView, 'Receiving (Mine)') if not selectMineOnly: self.tabWidget.addTab(self.addrBookTxView, 'Sending (Other\'s)') # DISPLAY Lockboxes - Regardles off what showLockboxes says only show # Lockboxes in Expert mode if showLockboxes and self.main.usermode == USERMODE.Expert: self.lboxModel = LockboxDisplayModel(self.main, \ self.main.allLockboxes, \ self.main.getPreferredDateFormat()) self.lboxProxy = LockboxDisplayProxy(self) self.lboxProxy.setSourceModel(self.lboxModel) self.lboxProxy.sort(LOCKBOXCOLS.CreateDate, Qt.DescendingOrder) self.lboxView = QTableView() self.lboxView.setModel(self.lboxProxy) self.lboxView.setSortingEnabled(True) self.lboxView.setSelectionBehavior(QTableView.SelectRows) self.lboxView.setSelectionMode(QTableView.SingleSelection) self.lboxView.verticalHeader().setDefaultSectionSize(18) self.lboxView.horizontalHeader().setStretchLastSection(True) #maxKeys = max([lb.N for lb in self.main.allLockboxes]) for i in range(LOCKBOXCOLS.Key0, LOCKBOXCOLS.Key4+1): self.lboxView.hideColumn(i) self.lboxView.hideColumn(LOCKBOXCOLS.UnixTime) self.tabWidget.addTab(self.lboxView, 'Lockboxes') self.connect( self.lboxView, SIGNAL('doubleClicked(QModelIndex)'), self.dblClickedLockbox) self.connect(self.lboxView.selectionModel(), \ SIGNAL('currentChanged(const QModelIndex &, const QModelIndex &)'), \ self.clickedLockbox) else: self.lboxView = None self.connect(self.tabWidget, SIGNAL('currentChanged(int)'), self.tabChanged) self.tabWidget.setCurrentIndex(0) ttipSendWlt = self.main.createToolTipWidget(\ 'The next unused address in that wallet will be calculated and selected. ') ttipSendAddr = self.main.createToolTipWidget(\ 'Addresses that are in other wallets you own are not showns.') self.lblSelectWlt = QRichLabel('', doWrap=False) self.btnSelectWlt = QPushButton('No Wallet Selected') self.useBareMultiSigCheckBox = QCheckBox('Use Bare Multi-Sig (No P2SH)') self.useBareMultiSigCheckBox.setVisible(False) self.ttipBareMS = self.main.createToolTipWidget( tr(""" EXPERT OPTION: Do not check this box unless you know what it means and you need it! Forces Armory to exposes public keys to the blockchain before the funds are spent. This is only needed for very specific use cases, and otherwise creates blockchain bloat.""")) self.ttipBareMS.setVisible(False) self.btnSelectAddr = QPushButton('No Address Selected') self.btnSelectWlt.setEnabled(False) self.btnSelectAddr.setEnabled(False) btnCancel = QPushButton('Cancel') if self.isBrowsingOnly: self.btnSelectWlt.setVisible(False) self.btnSelectAddr.setVisible(False) self.lblSelectWlt.setVisible(False) btnCancel = QPushButton('<<< Go Back') ttipSendAddr.setVisible(False) if selectExistingOnly: lblToWlt.setVisible(False) self.lblSelectWlt.setVisible(False) self.btnSelectWlt.setVisible(False) ttipSendWlt.setVisible(False) self.connect(self.btnSelectWlt, SIGNAL(CLICKED), self.acceptWltSelection) self.connect(self.btnSelectAddr, SIGNAL(CLICKED), self.acceptAddrSelection) self.connect(self.useBareMultiSigCheckBox, SIGNAL(CLICKED), self.useP2SHClicked) self.connect(btnCancel, SIGNAL(CLICKED), self.reject) dlgLayout = QGridLayout() dlgLayout.addWidget(lblDescr, 0, 0) dlgLayout.addWidget(HLINE(), 1, 0) dlgLayout.addWidget(lblToWlt, 2, 0) dlgLayout.addWidget(self.wltDispView, 3, 0) dlgLayout.addWidget(makeHorizFrame([self.lblSelectWlt, STRETCH, self.btnSelectWlt]), 4, 0) dlgLayout.addWidget(HLINE(), 5, 0) dlgLayout.addWidget(lblToAddr, 6, 0) dlgLayout.addWidget(self.tabWidget, 7, 0) dlgLayout.addWidget(makeHorizFrame([STRETCH, self.useBareMultiSigCheckBox, self.ttipBareMS, self.btnSelectAddr]), 8, 0) dlgLayout.addWidget(HLINE(), 9, 0) dlgLayout.addWidget(makeHorizFrame([btnCancel, STRETCH]), 10, 0) dlgLayout.setRowStretch(3, 1) dlgLayout.setRowStretch(7, 2) self.setLayout(dlgLayout) self.sizeHint = lambda: QSize(760, 500) # Auto-select the default wallet, if there is one rowNum = 0 if defaultWltID and self.main.walletMap.has_key(defaultWltID): rowNum = self.main.walletIndices[defaultWltID] rowIndex = self.wltDispModel.index(rowNum, 0) self.wltDispView.setCurrentIndex(rowIndex) self.setWindowTitle('Address Book') self.setWindowIcon(QIcon(self.main.iconfile)) self.setMinimumWidth(300) hexgeom = self.main.settings.get('AddrBookGeometry') wltgeom = self.main.settings.get('AddrBookWltTbl') rxgeom = self.main.settings.get('AddrBookRxTbl') txgeom = self.main.settings.get('AddrBookTxTbl') if len(hexgeom) > 0: geom = QByteArray.fromHex(hexgeom) self.restoreGeometry(geom) if len(wltgeom) > 0: restoreTableView(self.wltDispView, wltgeom) if len(rxgeom) > 0: restoreTableView(self.addrBookRxView, rxgeom) if len(txgeom) > 0 and not selectMineOnly: restoreTableView(self.addrBookTxView, txgeom) ############################################################################# def saveGeometrySettings(self): self.main.writeSetting('AddrBookGeometry', str(self.saveGeometry().toHex())) self.main.writeSetting('AddrBookWltTbl', saveTableView(self.wltDispView)) self.main.writeSetting('AddrBookRxTbl', saveTableView(self.addrBookRxView)) self.main.writeSetting('AddrBookTxTbl', saveTableView(self.addrBookTxView)) ############################################################################# def closeEvent(self, event): self.saveGeometrySettings() super(DlgAddressBook, self).closeEvent(event) ############################################################################# def accept(self, *args): self.saveGeometrySettings() super(DlgAddressBook, self).accept(*args) ############################################################################# def reject(self, *args): self.saveGeometrySettings() super(DlgAddressBook, self).reject(*args) ############################################################################# def setAddrBookTxModel(self, wltID): self.addrBookTxModel = SentToAddrBookModel(wltID, self.main) # self.addrBookTxProxy = SentAddrSortProxy(self) self.addrBookTxProxy.setSourceModel(self.addrBookTxModel) # self.addrBookTxProxy.sort(ADDRBOOKCOLS.Address) self.addrBookTxView.setModel(self.addrBookTxProxy) self.addrBookTxView.setSortingEnabled(True) self.addrBookTxView.setSelectionBehavior(QTableView.SelectRows) self.addrBookTxView.setSelectionMode(QTableView.SingleSelection) self.addrBookTxView.horizontalHeader().setStretchLastSection(True) self.addrBookTxView.verticalHeader().setDefaultSectionSize(20) freqSize = 1.3 * tightSizeStr(self.addrBookTxView, 'Times Used')[0] initialColResize(self.addrBookTxView, [0.3, 0.1, freqSize, 0.5]) self.addrBookTxView.hideColumn(ADDRBOOKCOLS.WltID) self.connect(self.addrBookTxView.selectionModel(), \ SIGNAL('currentChanged(const QModelIndex &, const QModelIndex &)'), \ self.addrTableTxClicked) ############################################################################# def disableSelectButtons(self): self.btnSelectAddr.setText('None Selected') self.btnSelectAddr.setEnabled(False) self.useBareMultiSigCheckBox.setChecked(False) self.useBareMultiSigCheckBox.setEnabled(False) ############################################################################# # Update the controls when the tab changes def tabChanged(self, index): if not self.isBrowsingOnly: if self.tabWidget.currentWidget() == self.lboxView: self.useBareMultiSigCheckBox.setVisible(self.btnSelectAddr.isVisible()) self.ttipBareMS.setVisible(self.btnSelectAddr.isVisible()) selectedLockBox = self.getSelectedLBID() self.btnSelectAddr.setEnabled(selectedLockBox != None) if selectedLockBox: self.btnSelectAddr.setText( createLockboxEntryStr(selectedLockBox, self.useBareMultiSigCheckBox.isChecked())) self.useBareMultiSigCheckBox.setEnabled(True) else: self.disableSelectButtons() elif self.tabWidget.currentWidget() == self.addrBookTxView: self.useBareMultiSigCheckBox.setVisible(False) self.ttipBareMS.setVisible(False) selection = self.addrBookTxView.selectedIndexes() if len(selection)==0: self.disableSelectButtons() else: self.addrTableTxClicked(selection[0]) elif self.tabWidget.currentWidget() == self.addrBookRxView: self.useBareMultiSigCheckBox.setVisible(False) self.ttipBareMS.setVisible(False) selection = self.addrBookRxView.selectedIndexes() if len(selection)==0: self.disableSelectButtons() else: self.addrTableRxClicked(selection[0]) ############################################################################# def setAddrBookRxModel(self, wltID): wlt = self.main.walletMap[wltID] self.addrBookRxModel = WalletAddrDispModel(wlt, self) self.addrBookRxProxy = WalletAddrSortProxy(self) self.addrBookRxProxy.setSourceModel(self.addrBookRxModel) # self.addrBookRxProxy.sort(ADDRESSCOLS.Address) self.addrBookRxView.setModel(self.addrBookRxProxy) self.addrBookRxView.setSelectionBehavior(QTableView.SelectRows) self.addrBookRxView.setSelectionMode(QTableView.SingleSelection) self.addrBookRxView.horizontalHeader().setStretchLastSection(True) self.addrBookRxView.verticalHeader().setDefaultSectionSize(20) iWidth = tightSizeStr(self.addrBookRxView, 'Imp')[0] initialColResize(self.addrBookRxView, [iWidth * 1.3, 0.3, 0.35, 64, 0.3]) self.connect(self.addrBookRxView.selectionModel(), \ SIGNAL('currentChanged(const QModelIndex &, const QModelIndex &)'), \ self.addrTableRxClicked) ############################################################################# def wltTableClicked(self, currIndex, prevIndex=None): if prevIndex == currIndex: return self.btnSelectWlt.setEnabled(True) row = currIndex.row() self.selectedWltID = str(currIndex.model().index(row, WLTVIEWCOLS.ID).data().toString()) self.setAddrBookTxModel(self.selectedWltID) self.setAddrBookRxModel(self.selectedWltID) if not self.isBrowsingOnly: wlt = self.main.walletMap[self.selectedWltID] self.btnSelectWlt.setText('%s Wallet: %s' % (self.actStr, self.selectedWltID)) nextAddr160 = wlt.peekNextUnusedAddr160() self.lblSelectWlt.setText('Will create new address: %s...' % \ hash160_to_addrStr(nextAddr160)[:10]) # If switched wallet selection, de-select address so it doesn't look # like the currently-selected address is for this different wallet if not self.tabWidget.currentWidget() == self.lboxView: self.disableSelectButtons() self.selectedAddr = '' self.selectedCmmt = '' self.addrBookTxModel.reset() ############################################################################# def addrTableTxClicked(self, currIndex, prevIndex=None): if prevIndex == currIndex: return self.btnSelectAddr.setEnabled(True) row = currIndex.row() self.selectedAddr = str(currIndex.model().index(row, ADDRBOOKCOLS.Address).data().toString()) self.selectedCmmt = str(currIndex.model().index(row, ADDRBOOKCOLS.Comment).data().toString()) if not self.isBrowsingOnly: self.btnSelectAddr.setText('%s Address: %s...' % (self.actStr, self.selectedAddr[:10])) ############################################################################# def addrTableRxClicked(self, currIndex, prevIndex=None): if prevIndex == currIndex: return self.btnSelectAddr.setEnabled(True) row = currIndex.row() self.selectedAddr = str(currIndex.model().index(row, ADDRESSCOLS.Address).data().toString()) self.selectedCmmt = str(currIndex.model().index(row, ADDRESSCOLS.Comment).data().toString()) if not self.isBrowsingOnly: self.btnSelectAddr.setText('%s Address: %s...' % (self.actStr, self.selectedAddr[:10])) ############################################################################# def dblClickAddressRx(self, index): if index.column() != ADDRESSCOLS.Comment: self.acceptAddrSelection() return wlt = self.main.walletMap[self.selectedWltID] dialog = DlgSetComment(self, self.main, self.selectedCmmt, 'Address') if dialog.exec_(): newComment = str(dialog.edtComment.text()) addr160 = addrStr_to_hash160(self.selectedAddr)[1] wlt.setComment(addr160, newComment) ############################################################################# def getSelectedLBID(self): selection = self.lboxView.selectedIndexes() if len(selection)==0: return None row = selection[0].row() idCol = LOCKBOXCOLS.ID return str(self.lboxView.model().index(row, idCol).data().toString()) ############################################################################# def dblClickedLockbox(self, index): self.acceptLockBoxSelection() ############################################################################# def clickedLockbox(self, currIndex, prevIndex=None): if prevIndex == currIndex: return row = currIndex.row() if not self.isBrowsingOnly: self.btnSelectAddr.setEnabled(True) self.useBareMultiSigCheckBox.setEnabled(True) selectedLockBoxId = str(currIndex.model().index(row, LOCKBOXCOLS.ID).data().toString()) self.btnSelectAddr.setText( createLockboxEntryStr(selectedLockBoxId, self.useBareMultiSigCheckBox.isChecked())) # Disable Bare multisig if mainnet and N>3 lb = self.main.getLockboxByID(selectedLockBoxId) if lb.N>3 and not USE_TESTNET: self.useBareMultiSigCheckBox.setEnabled(False) self.useBareMultiSigCheckBox.setChecked(False) self.useBareMultiSigCheckBox.setToolTip(tr(""" Bare multi-sig is not available for M-of-N lockboxes on the main Bitcoin network with N higher than 3.""")) else: self.useBareMultiSigCheckBox.setEnabled(True) ############################################################################# def dblClickAddressTx(self, index): if index.column() != ADDRBOOKCOLS.Comment: self.acceptAddrSelection() return wlt = self.main.walletMap[self.selectedWltID] dialog = DlgSetComment(self, self.main, self.selectedCmmt, 'Address') if dialog.exec_(): newComment = str(dialog.edtComment.text()) addr160 = addrStr_to_hash160(self.selectedAddr)[1] wlt.setComment(addr160, newComment) ############################################################################# def acceptWltSelection(self): wltID = self.selectedWltID addr160 = self.main.walletMap[wltID].getNextUnusedAddress().getAddr160() if not self.returnPubKey: self.target.setText(hash160_to_addrStr(addr160)) else: pubKeyHash = self.getPubKeyForAddr160(addr160) if pubKeyHash is None: return self.target.setText(pubKeyHash) self.target.setCursorPosition(0) self.accept() ############################################################################# def useP2SHClicked(self): self.btnSelectAddr.setText( createLockboxEntryStr(self.getSelectedLBID(), self.useBareMultiSigCheckBox.isChecked())) ############################################################################# def acceptAddrSelection(self): if isBareLockbox(str(self.btnSelectAddr.text())) or \ isP2SHLockbox(str(self.btnSelectAddr.text())): self.acceptLockBoxSelection() else: atype,a160 = addrStr_to_hash160(self.selectedAddr) if atype==P2SHBYTE and self.returnPubKey: LOGERROR('Cannot select P2SH address when selecting a public key!') QMessageBox.critical(self, tr("P2SH Not Allowed"), tr(""" This operation requires a public key, but you selected a P2SH address which does not have a public key (these addresses start with "2" or "3"). Please select a different address"""), \ QMessageBox.Ok) return if self.target: if not self.returnPubKey: self.target.setText(self.selectedAddr) else: pubKeyHash = self.getPubKeyForAddr160(a160) if pubKeyHash is None: return self.target.setText(pubKeyHash) self.target.setCursorPosition(0) self.accept() ############################################################################# def acceptLockBoxSelection(self): if self.target: self.target.setText( createLockboxEntryStr(self.getSelectedLBID(), self.useBareMultiSigCheckBox.isChecked())) self.target.setCursorPosition(0) self.accept() ############################################################################# def getPubKeyForAddr160(self, addr160): if not self.returnPubKey: LOGERROR('Requested getPubKeyNotAddr, but looks like addr requested') wid = self.main.getWalletForAddr160(addr160) if not wid: QMessageBox.critical(self, tr('No Public Key'), tr(""" This operation requires a full public key, not just an address. Unfortunately, Armory cannot find the public key for the address you selected. In general public keys will only be available for addresses in your wallet."""), QMessageBox.Ok) return None wlt = self.main.walletMap[wid] return wlt.getAddrByHash160(addr160).binPublicKey65.toHexStr() ############################################################################# def showContextMenuTx(self, pos): menu = QMenu(self.addrBookTxView) std = (self.main.usermode == USERMODE.Standard) adv = (self.main.usermode == USERMODE.Advanced) dev = (self.main.usermode == USERMODE.Expert) if True: actionCopyAddr = menu.addAction("Copy Address") if dev: actionCopyHash160 = menu.addAction("Copy Hash160 (hex)") if True: actionCopyComment = menu.addAction("Copy Comment") idx = self.addrBookTxView.selectedIndexes()[0] action = menu.exec_(QCursor.pos()) if action == actionCopyAddr: s = self.addrBookTxView.model().index(idx.row(), ADDRBOOKCOLS.Address).data().toString() elif dev and action == actionCopyHash160: s = str(self.addrBookTxView.model().index(idx.row(), ADDRBOOKCOLS.Address).data().toString()) atype, addr160 = addrStr_to_hash160(s) if atype==P2SHBYTE: LOGWARN('Copying Hash160 of P2SH address: %s' % s) s = binary_to_hex(addr160) elif action == actionCopyComment: s = self.addrBookTxView.model().index(idx.row(), ADDRBOOKCOLS.Comment).data().toString() else: return clipb = QApplication.clipboard() clipb.clear() clipb.setText(str(s).strip()) ############################################################################# def showContextMenuRx(self, pos): menu = QMenu(self.addrBookRxView) std = (self.main.usermode == USERMODE.Standard) adv = (self.main.usermode == USERMODE.Advanced) dev = (self.main.usermode == USERMODE.Expert) if True: actionCopyAddr = menu.addAction("Copy Address") if dev: actionCopyHash160 = menu.addAction("Copy Hash160 (hex)") if True: actionCopyComment = menu.addAction("Copy Comment") idx = self.addrBookRxView.selectedIndexes()[0] action = menu.exec_(QCursor.pos()) if action == actionCopyAddr: s = self.addrBookRxView.model().index(idx.row(), ADDRESSCOLS.Address).data().toString() elif dev and action == actionCopyHash160: s = str(self.addrBookRxView.model().index(idx.row(), ADDRESSCOLS.Address).data().toString()) atype, addr160 = addrStr_to_hash160(s) if atype==P2SHBYTE: LOGWARN('Copying Hash160 of P2SH address: %s' % s) s = binary_to_hex(addr160) elif action == actionCopyComment: s = self.addrBookRxView.model().index(idx.row(), ADDRESSCOLS.Comment).data().toString() else: return clipb = QApplication.clipboard() clipb.clear() clipb.setText(str(s).strip()) ################################################################################ def createAddrBookButton(parent, targWidget, defaultWltID=None, actionStr="Select", selectExistingOnly=False, selectMineOnly=False, getPubKey=False, showLockboxes=True): btn = QPushButton('') ico = QIcon(QPixmap(':/addr_book_icon.png')) btn.setIcon(ico) def execAddrBook(): if len(parent.main.walletMap) == 0: QMessageBox.warning(parent, 'No wallets!', 'You have no wallets so ' 'there is no address book to display.', QMessageBox.Ok) return dlg = DlgAddressBook(parent, parent.main, targWidget, defaultWltID, actionStr, selectExistingOnly, selectMineOnly, getPubKey, showLockboxes) dlg.exec_() btn.setMaximumWidth(24) btn.setMaximumHeight(24) parent.connect(btn, SIGNAL(CLICKED), execAddrBook) btn.setToolTip('Select from Address Book') return btn ################################################################################ class DlgHelpAbout(ArmoryDialog): def __init__(self, putResultInWidget, defaultWltID=None, parent=None, main=None): super(DlgHelpAbout, self).__init__(parent) imgLogo = QLabel() imgLogo.setPixmap(QPixmap(':/armory_logo_h56.png')) imgLogo.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) lblHead = QRichLabel('Armory Bitcoin Wallet : Version %s-beta' % \ getVersionString(BTCARMORY_VERSION), doWrap=False) lblWebpage = QRichLabel('https://www.bitcoinarmory.com') lblWebpage.setOpenExternalLinks(True) lblCopyright = QRichLabel(u'Copyright \xa9 2011-2014 Armory Technologies, Inc.') lblLicense = QRichLabel(tr(u'Licensed under the ' '' 'Affero General Public License, Version 3 (AGPLv3)')) lblLicense.setOpenExternalLinks(True) lblHead.setAlignment(Qt.AlignHCenter) lblWebpage.setAlignment(Qt.AlignHCenter) lblCopyright.setAlignment(Qt.AlignHCenter) lblLicense.setAlignment(Qt.AlignHCenter) dlgLayout = QHBoxLayout() dlgLayout.addWidget(makeVertFrame([imgLogo, lblHead, lblCopyright, lblWebpage, STRETCH, lblLicense])) self.setLayout(dlgLayout) self.setMinimumWidth(450) self.setWindowTitle('About Armory') ################################################################################ class DlgSettings(ArmoryDialog): def __init__(self, parent=None, main=None): super(DlgSettings, self).__init__(parent, main) ########################################################################## # bitcoind-management settings self.chkManageSatoshi = QCheckBox(tr(""" Let Armory run Bitcoin-Qt/bitcoind in the background""")) self.edtSatoshiExePath = QLineEdit() self.edtSatoshiHomePath = QLineEdit() self.edtSatoshiExePath.setMinimumWidth(tightSizeNChar(GETFONT('Fixed', 10), 40)[0]) self.connect(self.chkManageSatoshi, SIGNAL(CLICKED), self.clickChkManage) self.startChk = self.main.getSettingOrSetDefault('ManageSatoshi', not OS_MACOSX) if self.startChk: self.chkManageSatoshi.setChecked(True) if OS_MACOSX: self.chkManageSatoshi.setEnabled(False) lblManageSatoshi = QRichLabel(\ 'Bitcoin-Qt/bitcoind management is not available on Mac/OSX') else: if self.main.settings.hasSetting('SatoshiExe'): satexe = self.main.settings.get('SatoshiExe') sathome = BTC_HOME_DIR if self.main.settings.hasSetting('SatoshiDatadir'): sathome = self.main.settings.get('SatoshiDatadir') lblManageSatoshi = QRichLabel(\ 'Bitcoin Software Management' '

' 'By default, Armory will manage the Bitcoin engine/software in the ' 'background. You can choose to manage it yourself, or tell Armory ' 'about non-standard installation configuration.') if self.main.settings.hasSetting('SatoshiExe'): self.edtSatoshiExePath.setText(self.main.settings.get('SatoshiExe')) self.edtSatoshiExePath.home(False) if self.main.settings.hasSetting('SatoshiDatadir'): self.edtSatoshiHomePath.setText(self.main.settings.get('SatoshiDatadir')) self.edtSatoshiHomePath.home(False) lblDescrExe = QRichLabel('Bitcoin Install Dir:') lblDescrHome = QRichLabel('Bitcoin Home Dir:') lblDefaultExe = QRichLabel('Leave blank to have Armory search default ' 'locations for your OS', size=2) lblDefaultHome = QRichLabel('Leave blank to use default datadir ' '(%s)' % BTC_HOME_DIR, size=2) self.btnSetExe = createDirectorySelectButton(self, self.edtSatoshiExePath) self.btnSetHome = createDirectorySelectButton(self, self.edtSatoshiHomePath) layoutMgmt = QGridLayout() layoutMgmt.addWidget(lblManageSatoshi, 0, 0, 1, 3) layoutMgmt.addWidget(self.chkManageSatoshi, 1, 0, 1, 3) layoutMgmt.addWidget(lblDescrExe, 2, 0) layoutMgmt.addWidget(self.edtSatoshiExePath, 2, 1) layoutMgmt.addWidget(self.btnSetExe, 2, 2) layoutMgmt.addWidget(lblDefaultExe, 3, 1, 1, 2) layoutMgmt.addWidget(lblDescrHome, 4, 0) layoutMgmt.addWidget(self.edtSatoshiHomePath, 4, 1) layoutMgmt.addWidget(self.btnSetHome, 4, 2) layoutMgmt.addWidget(lblDefaultHome, 5, 1, 1, 2) frmMgmt = QFrame() frmMgmt.setLayout(layoutMgmt) self.clickChkManage() # bitcoind-management settings ########################################################################## # We check for internet connection on each startup. self.chkSkipOnlineCheck = QCheckBox(tr(""" Skip online check on startup (assume internet is available, do not check)""")) skipOnlineChk = self.main.getSettingOrSetDefault('SkipOnlineCheck', False) self.chkSkipOnlineCheck.setChecked(skipOnlineChk) self.chkSkipVersionCheck = QCheckBox(tr(""" Skip periodic version queries to Armory server""")) skipVerChk = self.main.getSettingOrSetDefault('SkipVersionCheck', False) self.chkSkipVersionCheck.setChecked(skipVerChk) self.chkDisableTorrent = QCheckBox(tr(""" Disable torrent download (force synchronization via Bitcoin P2P)""")) disableTorrent = self.main.getSettingOrSetDefault('DisableTorrent', False) self.chkDisableTorrent.setChecked(disableTorrent) ########################################################################## # Privacy Settings privacyStats = self.main.getSettingOrSetDefault('SkipStatsReport', False) privacyTor = self.main.getSettingOrSetDefault('UseTorSettings', False) lblPrivacyTitle = QRichLabel("Privacy Settings") lblPrivStatsDescr = QRichLabel(""" When this software checks for updates and security alerts, it sends your operating system and Armory version to ATI server for statistical purposes. No attempt is made to identify you. No IP addresses are logged by ATI servers. You can continue to receive notifications but not send any statistical information.""") lblPrivTorDescr = QRichLabel(""" If you are going to use Armory and Bitcoin Core with a proxy (such as Tor), you should disable all Armory communications that might operate outside the proxy.""") self.chkPrivacyStats = QCheckBox(tr(""" Disable OS and version reporting""")) self.chkPrivacyTor = QCheckBox(tr(""" Enable settings for proxies/Tor""")) self.connect(self.chkPrivacyTor, SIGNAL('toggled(bool)'), self.chkPrivacyStats.setDisabled) self.chkPrivacyStats.setChecked(privacyStats) self.chkPrivacyTor.setChecked(privacyTor) # Privacy Settings ########################################################################## lblDefaultUriTitle = QRichLabel(tr(""" Set Armory as default URL handler""")) lblDefaultURI = QRichLabel(tr(""" Set Armory to be the default when you click on "bitcoin:" links in your browser or in emails. You can test if your operating system is supported by clicking on a "bitcoin:" link right after clicking this button.""")) btnDefaultURI = QPushButton(tr('Set Armory as Default')) frmBtnDefaultURI = makeHorizFrame([btnDefaultURI, 'Stretch']) self.chkAskURIAtStartup = QCheckBox(tr(""" Check whether Armory is the default handler at startup""")) askuriDNAA = self.main.getSettingOrSetDefault('DNAA_DefaultApp', False) self.chkAskURIAtStartup.setChecked(not askuriDNAA) def clickRegURI(): self.main.setupUriRegistration(justDoIt=True) QMessageBox.information(self, tr('Registered'), tr(""" Armory just attempted to register itself to handle "bitcoin:" links, but this does not work on all operating systems. You can test it by going to the Bitcoin Armory website and clicking the link at the bottom of the homepage."""), QMessageBox.Ok) self.connect(btnDefaultURI, SIGNAL(CLICKED), clickRegURI) ############################################################### # Announcements and Alerts lblAnnounce = QRichLabel(tr(""" Armory Technologies, Inc. will periodically post announcements and security alerts. ATI will also use this channel to notify you of new Armory versions. All these notifications are signed by an offline private key controlled exclusively by ATI.""")) self.radioAnnounce1024 = QRadioButton(tr(""" (Level 1) All announcements including testing/unstable versions""")) self.radioAnnounce2048 = QRadioButton(tr(""" (Level 2) Standard announcements and notifications""")) self.radioAnnounce3072 = QRadioButton(tr(""" (Level 3) Only important announcements and alerts""")) self.radioAnnounce4096 = QRadioButton(tr(""" (Level 4) Only critical security alerts""")) self.chkDisableUpgradeNotify = QCheckBox(tr(""" Disable software upgrade notifications """)) self.chkDisableUpgradeNotify.setChecked( \ self.main.getSettingOrSetDefault('DisableUpgradeNotify', False)) lblDisableAnnounce = QRichLabel(tr(""" If you must completely disable all notifications from the Armory team, you can run Armory with the "--skip-announce-check" flag from the command-line, or add it to the Armory shortcut target""") % htmlColor('DisableFG')) btnGroupAnnounce = QButtonGroup(self) btnGroupAnnounce.addButton(self.radioAnnounce1024) btnGroupAnnounce.addButton(self.radioAnnounce2048) btnGroupAnnounce.addButton(self.radioAnnounce3072) btnGroupAnnounce.addButton(self.radioAnnounce4096) btnGroupAnnounce.setExclusive(True) minPriority = self.main.getSettingOrSetDefault('NotifyMinPriority', \ DEFAULT_MIN_PRIORITY) if minPriority >= 4096: self.radioAnnounce4096.setChecked(True) elif minPriority >= 3072: self.radioAnnounce3072.setChecked(True) elif minPriority >= 2048: self.radioAnnounce2048.setChecked(True) elif minPriority >= 0: self.radioAnnounce1024.setChecked(True) btnResetNotify = QPushButton(tr('Reset Notifications')) frmBtnResetNotify = makeHorizFrame([btnResetNotify, 'Stretch']) def resetNotifyLong(): self.main.notifyIgnoreLong = set() self.main.notifyIgnoreShort = set() self.main.writeSetting('NotifyIgnore', '') QMessageBox.information(self, tr('Settings Changed'), tr(""" All notifications have been reset!"""), QMessageBox.Ok) self.connect(btnResetNotify, SIGNAL(CLICKED), resetNotifyLong) txFee = self.main.getSettingOrSetDefault('Default_Fee', MIN_TX_FEE) lblDefaultFee = QRichLabel(tr(""" Default fee to include with transactions:
""")) lblDefaultDescr = QRichLabel(tr(""" Fees go to users that contribute computing power to keep the Bitcoin network secure. It also increases the priority of your transactions so they confirm faster (%s BTC is standard).""") % \ coin2strNZS(MIN_TX_FEE)) ttipDefaultFee = self.main.createToolTipWidget(tr(""" NOTE: some transactions will require a certain fee regardless of your settings -- in such cases you will be prompted to include the correct value or cancel the transaction""")) self.edtDefaultFee = QLineEdit() self.edtDefaultFee.setText(coin2str(txFee, maxZeros=1).strip()) lblDefaultFee.setMinimumWidth(400) self.connect(self.edtDefaultFee, SIGNAL('returnPressed()'), self.accept) ############################################################### # Minimize on Close lblMinimizeDescr = QRichLabel(tr(""" Minimize to System Tray
You can have Armory automatically minimize itself to your system tray on open or close. Armory will stay open but run in the background, and you will still receive notifications. Access Armory through the icon on your system tray.

If select "Minimize on close", the 'x' on the top window bar will minimize Armory instead of exiting the application. You can always use "File"\xe2\x86\x92"Quit Armory" to actually close it.""")) moo = self.main.getSettingOrSetDefault('MinimizeOnOpen', False) self.chkMinOnOpen = QCheckBox(tr('Minimize to system tray on open')) if moo: self.chkMinOnOpen.setChecked(True) moc = self.main.getSettingOrSetDefault('MinimizeOrClose', 'DontKnow') self.chkMinOrClose = QCheckBox(tr('Minimize to system tray on close')) if moc == 'Minimize': self.chkMinOrClose.setChecked(True) ############################################################### # System Tray Notifications -- Don't work right on OSX lblNotify = QRichLabel('Enable notifcations from the system-tray:') notifyBtcIn = self.main.getSettingOrSetDefault('NotifyBtcIn', not OS_MACOSX) notifyBtcOut = self.main.getSettingOrSetDefault('NotifyBtcOut', not OS_MACOSX) notifyDiscon = self.main.getSettingOrSetDefault('NotifyDiscon', not OS_MACOSX) notifyReconn = self.main.getSettingOrSetDefault('NotifyReconn', not OS_MACOSX) self.chkBtcIn = QCheckBox('Bitcoins Received') self.chkBtcOut = QCheckBox('Bitcoins Sent') self.chkDiscon = QCheckBox('Bitcoin-Qt/bitcoind disconnected') self.chkReconn = QCheckBox('Bitcoin-Qt/bitcoind reconnected') self.chkBtcIn.setChecked(notifyBtcIn) self.chkBtcOut.setChecked(notifyBtcOut) self.chkDiscon.setChecked(notifyDiscon) self.chkReconn.setChecked(notifyReconn) if OS_MACOSX: lblNotify = QRichLabel('Sorry! Notifications are not available on Mac/OSX') self.chkBtcIn.setChecked(False) self.chkBtcOut.setChecked(False) self.chkDiscon.setChecked(False) self.chkReconn.setChecked(False) self.chkBtcIn.setEnabled(False) self.chkBtcOut.setEnabled(False) self.chkDiscon.setEnabled(False) self.chkReconn.setEnabled(False) ############################################################### # Date format preferences exampleTimeTuple = (2012, 4, 29, 19, 45, 0, -1, -1, -1) self.exampleUnixTime = time.mktime(exampleTimeTuple) exampleStr = unixTimeToFormatStr(self.exampleUnixTime, '%c') lblDateFmt = QRichLabel('Preferred Date Format:
') lblDateDescr = QRichLabel(\ 'You can specify how you would like dates ' 'to be displayed using percent-codes to ' 'represent components of the date. The ' 'mouseover text of the "(?)" icon shows ' 'the most commonly used codes/symbols. ' 'The text next to it shows how ' '"%s" would be shown with the ' 'specified format.' % exampleStr) lblDateFmt.setAlignment(Qt.AlignTop) fmt = self.main.getPreferredDateFormat() ttipStr = 'Use any of the following symbols:
' fmtSymbols = [x[0] + ' = ' + x[1] for x in FORMAT_SYMBOLS] ttipStr += '
'.join(fmtSymbols) fmtSymbols = [x[0] + '~' + x[1] for x in FORMAT_SYMBOLS] lblStk = QRichLabel('; '.join(fmtSymbols)) self.edtDateFormat = QLineEdit() self.edtDateFormat.setText(fmt) self.ttipFormatDescr = self.main.createToolTipWidget(ttipStr) self.lblDateExample = QRichLabel('', doWrap=False) self.connect(self.edtDateFormat, SIGNAL('textEdited(QString)'), self.doExampleDate) self.doExampleDate() self.btnResetFormat = QPushButton("Reset to Default") def doReset(): self.edtDateFormat.setText(DEFAULT_DATE_FORMAT) self.doExampleDate() self.connect(self.btnResetFormat, SIGNAL(CLICKED), doReset) # Make a little subframe just for the date format stuff... everything # fits nicer if I do this... frmTop = makeHorizFrame([self.lblDateExample, STRETCH, self.ttipFormatDescr]) frmMid = makeHorizFrame([self.edtDateFormat]) frmBot = makeHorizFrame([self.btnResetFormat, STRETCH]) fStack = makeVertFrame([frmTop, frmMid, frmBot, STRETCH]) lblStk = makeVertFrame([lblDateFmt, lblDateDescr, STRETCH]) subFrm = makeHorizFrame([lblStk, STRETCH, fStack]) ############################################################### # SelectCoins preferences # NOT ENABLED YET -- BUT WILL BE SOON # lblSelectCoin = QRichLabel('Coin Selection Preferences:') # lblSelectCoinDescr = QRichLabel( \ # 'When Armory constructs a transaction, there are many different ' # 'ways for it to select from coins that make up your balance. ' # 'The "SelectCoins" algorithm can be set to prefer more-anonymous ' # 'coin selections or to prefer avoiding mandatory transaction fees. ' # 'No guarantees are made about the relative anonymity of the ' # 'coin selection, only that Armory will prefer a transaction ' # 'that requires a fee if it can increase anonymity.') # self.cmbSelectCoins = QComboBox() # self.cmbSelectCoins.clear() # self.cmbSelectCoins.addItem( 'Prefer free transactions' ) # self.cmbSelectCoins.addItem( 'Maximize anonymity' ) # self.cmbSelectCoins.setCurrentIndex(0) # i+=1 # dlgLayout.addWidget(lblSelectCoin, i,0) # dlgLayout.addWidget(self.cmbSelectCoins, i,1) # i+=1 # dlgLayout.addWidget(lblSelectCoinDescr, i,0, 1,2) ############################################################### # Save/Cancel Button self.btnCancel = QPushButton("Cancel") self.btnAccept = QPushButton("Save") self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) self.connect(self.btnAccept, SIGNAL(CLICKED), self.accept) self.cmbUsermode = QComboBox() self.cmbUsermode.clear() self.cmbUsermode.addItem('Standard') self.cmbUsermode.addItem('Advanced') self.cmbUsermode.addItem('Expert') self.usermodeInit = self.main.usermode if self.main.usermode == USERMODE.Standard: self.cmbUsermode.setCurrentIndex(0) elif self.main.usermode == USERMODE.Advanced: self.cmbUsermode.setCurrentIndex(1) elif self.main.usermode == USERMODE.Expert: self.cmbUsermode.setCurrentIndex(2) lblUsermode = QRichLabel('Armory user mode:') self.lblUsermodeDescr = QRichLabel('') self.setUsermodeDescr() self.connect(self.cmbUsermode, SIGNAL('activated(int)'), self.setUsermodeDescr) frmLayout = QGridLayout() i = 0 frmLayout.addWidget(HLINE(), i, 0, 1, 3) i += 1 frmLayout.addWidget(frmMgmt, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.chkSkipOnlineCheck, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.chkDisableTorrent, i, 0, 1, 3) i += 1 frmLayout.addWidget(HLINE(), i, 0, 1, 3) i += 1 frmLayout.addWidget(lblPrivacyTitle, i, 0, 1, 3) i += 1 frmLayout.addWidget(lblPrivStatsDescr , i, 0, 1, 3) i += 1 frmLayout.addWidget(self.chkPrivacyStats , i, 0, 1, 3) i += 1 frmLayout.addWidget(lblPrivTorDescr, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.chkPrivacyTor, i, 0, 1, 3) i += 1 frmLayout.addWidget(HLINE(), i, 0, 1, 3) i += 1 frmLayout.addWidget(lblDefaultUriTitle, i, 0) i += 1 frmLayout.addWidget(lblDefaultURI, i, 0, 1, 3) i += 1 frmLayout.addWidget(frmBtnDefaultURI, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.chkAskURIAtStartup, i, 0, 1, 3) i += 1 frmLayout.addWidget(HLINE(), i, 0, 1, 3) i += 1 frmLayout.addWidget(lblDefaultFee, i, 0) frmLayout.addWidget(ttipDefaultFee, i, 1) frmLayout.addWidget(self.edtDefaultFee, i, 2) i += 1 frmLayout.addWidget(lblDefaultDescr, i, 0, 1, 3) i += 1 frmLayout.addWidget(HLINE(), i, 0, 1, 3) i += 1 frmLayout.addWidget(subFrm, i, 0, 1, 3) i += 1 frmLayout.addWidget(HLINE(), i, 0, 1, 3) i += 1 frmLayout.addWidget(lblMinimizeDescr, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.chkMinOnOpen, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.chkMinOrClose, i, 0, 1, 3) i += 1 frmLayout.addWidget(HLINE(), i, 0, 1, 3) i += 1 frmLayout.addWidget(lblNotify, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.chkBtcIn, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.chkBtcOut, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.chkDiscon, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.chkReconn, i, 0, 1, 3) i += 1 frmLayout.addWidget(HLINE(), i, 0, 1, 3) i += 1 frmLayout.addWidget(lblAnnounce, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.radioAnnounce1024, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.radioAnnounce2048, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.radioAnnounce3072, i, 0, 1, 3) i += 1 frmLayout.addWidget(self.radioAnnounce4096, i, 0, 1, 3) i += 1 frmLayout.addWidget(lblDisableAnnounce, i, 0, 1, 4) i += 1 frmLayout.addWidget(self.chkDisableUpgradeNotify , i, 0, 1, 3) i += 1 frmLayout.addWidget(frmBtnResetNotify , i, 0, 1, 3) i += 1 frmLayout.addWidget(HLINE(), i, 0, 1, 3) i += 1 frmLayout.addWidget(lblUsermode, i, 0) frmLayout.addWidget(QLabel(''), i, 1) frmLayout.addWidget(self.cmbUsermode, i, 2) i += 1 frmLayout.addWidget(self.lblUsermodeDescr, i, 0, 1, 3) frmOptions = QFrame() frmOptions.setLayout(frmLayout) self.scrollOptions = QScrollArea() self.scrollOptions.setWidget(frmOptions) dlgLayout = QVBoxLayout() dlgLayout.addWidget(self.scrollOptions) dlgLayout.addWidget(makeHorizFrame([STRETCH, self.btnCancel, self.btnAccept])) self.setLayout(dlgLayout) self.setMinimumWidth(650) self.setWindowTitle('Armory Settings') # NOTE: This was getting complicated for a variety of reasons, so switched # to manually constructing the options window. May come back to this # at a later time. # # Let's create a scalable list of options. Each row of this list looks like: # # [OptionType, SettingsName, DefaultValue, BoldText, NormalText, Tooltip] # # SettingsName is the string used in self.main.getSettingOrSetDefault() # OptionType can be one of: # {'Checkbox', 'LineEdit', 'Combo|Opt1|Opt2|...', 'Separator', 'Header'} # # "Separator adds a horizontal-ruler to separate option groups, and "Header" # is basically a textual separator with no actual option # self.Options = [] # self.Options.append( ['LineEdit', 'Default_Fee', MIN_TX_FEE, \ # 'Default fee to include with transactions.', \ # 'Fees go to users that contribute computing power ' # 'to keep the Bitcoin network secure (0.0005 BTC is ' # 'standard).', \ # 'NOTE: some transactions will require a fee ' # 'regardless of your preferences -- in such cases ' # 'you will be prompted to include the correct ' # 'value or abort the transaction']) ############################################################################# def accept(self, *args): if self.chkManageSatoshi.isChecked(): # Check valid path is supplied for bitcoin installation pathExe = unicode(self.edtSatoshiExePath.text()).strip() if len(pathExe) > 0: if not os.path.exists(pathExe): exeName = 'bitcoin-qt.exe' if OS_WINDOWS else 'bitcoin-qt' QMessageBox.warning(self, 'Invalid Path', \ 'The path you specified for the Bitcoin software installation ' 'does not exist. Please select the directory that contains %s ' 'or leave it blank to have Armory search the default location ' 'for your operating system' % exeName, QMessageBox.Ok) return if os.path.isfile(pathExe): pathExe = os.path.dirname(pathExe) self.main.writeSetting('SatoshiExe', pathExe) else: self.main.settings.delete('SatoshiExe') # Check valid path is supplied for bitcoind home directory pathHome = unicode(self.edtSatoshiHomePath.text()).strip() if len(pathHome) > 0: if not os.path.exists(pathHome): exeName = 'bitcoin-qt.exe' if OS_WINDOWS else 'bitcoin-qt' QMessageBox.warning(self, 'Invalid Path', \ 'The path you specified for the Bitcoin software home directory ' 'does not exist. Only specify this directory if you use a ' 'non-standard "-datadir=" option when running Bitcoin-Qt or ' 'bitcoind. If you leave this field blank, the following ' 'path will be used:

%s' % BTC_HOME_DIR, QMessageBox.Ok) return self.main.writeSetting('SatoshiDatadir', pathHome) else: self.main.settings.delete('SatoshiDatadir') self.main.writeSetting('ManageSatoshi', self.chkManageSatoshi.isChecked()) self.main.writeSetting('SkipOnlineCheck', self.chkSkipOnlineCheck.isChecked()) self.main.writeSetting('DisableTorrent', self.chkDisableTorrent.isChecked()) # Reset the DNAA flag as needed askuriDNAA = self.chkAskURIAtStartup.isChecked() self.main.writeSetting('DNAA_DefaultApp', not askuriDNAA) try: defaultFee = str2coin(str(self.edtDefaultFee.text()).replace(' ', '')) self.main.writeSetting('Default_Fee', defaultFee) except: QMessageBox.warning(self, 'Invalid Amount', \ 'The default fee specified could not be understood. Please ' 'specify in BTC with no more than 8 decimal places.', \ QMessageBox.Ok) return if not self.main.setPreferredDateFormat(str(self.edtDateFormat.text())): return if not self.usermodeInit == self.cmbUsermode.currentIndex(): modestr = str(self.cmbUsermode.currentText()) if modestr.lower() == 'standard': self.main.setUserMode(USERMODE.Standard) elif modestr.lower() == 'advanced': self.main.setUserMode(USERMODE.Advanced) elif modestr.lower() == 'expert': self.main.setUserMode(USERMODE.Expert) if self.chkMinOrClose.isChecked(): self.main.writeSetting('MinimizeOrClose', 'Minimize') else: self.main.writeSetting('MinimizeOrClose', 'Close') self.main.writeSetting('MinimizeOnOpen', self.chkMinOnOpen.isChecked()) # self.main.writeSetting('LedgDisplayFee', self.chkInclFee.isChecked()) self.main.writeSetting('NotifyBtcIn', self.chkBtcIn.isChecked()) self.main.writeSetting('NotifyBtcOut', self.chkBtcOut.isChecked()) self.main.writeSetting('NotifyDiscon', self.chkDiscon.isChecked()) self.main.writeSetting('NotifyReconn', self.chkReconn.isChecked()) oldTorSetting = self.main.getSettingOrSetDefault('UseTorSettings', False) self.main.writeSetting('SkipStatsReport',self.chkPrivacyStats.isChecked()) self.main.writeSetting('UseTorSettings', self.chkPrivacyTor.isChecked()) if self.chkPrivacyTor.isChecked() and not oldTorSetting: annURL = 'https://bitcoinarmory.com/announcements/' QMessageBox.warning(self, 'Disable Security Alerts?', tr(""" You have chosen to disable all Armory communications that are incompatible with proxies/Tor. This includes checking for security alerts. If you leave this option checked, it is highly recommended that you manually check for updates in the "Announcements" tab on the main window from another online Armory installation and/or bookmark our announcements page:

%s""") % (annURL,annURL), QMessageBox.Ok) if self.radioAnnounce1024.isChecked(): self.main.writeSetting('NotifyMinPriority', 0) elif self.radioAnnounce2048.isChecked(): self.main.writeSetting('NotifyMinPriority', 2048) elif self.radioAnnounce3072.isChecked(): self.main.writeSetting('NotifyMinPriority', 3072) elif self.radioAnnounce4096.isChecked(): self.main.writeSetting('NotifyMinPriority', 4096) self.main.writeSetting('DisableUpgradeNotify', \ self.chkDisableUpgradeNotify.isChecked()) self.main.createCombinedLedger() super(DlgSettings, self).accept(*args) ############################################################################# def setUsermodeDescr(self): strDescr = '' modestr = str(self.cmbUsermode.currentText()) if modestr.lower() == 'standard': strDescr += \ ('"Standard" is for users that only need the core set of features ' 'to send and receive bitcoins. This includes maintaining multiple ' 'wallets, wallet encryption, and the ability to make backups ' 'of your wallets.') elif modestr.lower() == 'advanced': strDescr += \ ('"Advanced" mode provides ' 'extra Armory features such as private key ' 'importing & sweeping, message signing, and the offline wallet ' 'interface. But, with advanced features come advanced risks...') elif modestr.lower() == 'expert': strDescr += \ ('"Expert" mode is similar to "Advanced" but includes ' 'access to lower-level info about transactions, scripts, keys ' 'and network protocol. Most extra functionality is geared ' 'towards Bitcoin software developers.') self.lblUsermodeDescr.setText(strDescr) ############################################################################# def doExampleDate(self, qstr=None): fmtstr = str(self.edtDateFormat.text()) try: self.lblDateExample.setText('Sample: ' + unixTimeToFormatStr(self.exampleUnixTime, fmtstr)) self.isValidFormat = True except: self.lblDateExample.setText('Sample: [[invalid date format]]') self.isValidFormat = False ############################################################################# def clickChkManage(self): self.edtSatoshiExePath.setEnabled(self.chkManageSatoshi.isChecked()) self.edtSatoshiHomePath.setEnabled(self.chkManageSatoshi.isChecked()) self.btnSetExe.setEnabled(self.chkManageSatoshi.isChecked()) self.btnSetHome.setEnabled(self.chkManageSatoshi.isChecked()) ################################################################################ class DlgExportTxHistory(ArmoryDialog): def __init__(self, parent=None, main=None): super(DlgExportTxHistory, self).__init__(parent, main) self.cmbWltSelect = QComboBox() self.cmbWltSelect.clear() self.cmbWltSelect.addItem('My Wallets') self.cmbWltSelect.addItem('Offline Wallets') self.cmbWltSelect.addItem('Other Wallets') self.cmbWltSelect.addItem('All Wallets') for wltID in self.main.walletIDList: self.cmbWltSelect.addItem(self.main.walletMap[wltID].labelName) self.cmbWltSelect.insertSeparator(4) self.cmbWltSelect.insertSeparator(4) self.cmbSortSelect = QComboBox() self.cmbSortSelect.clear() self.cmbSortSelect.addItem('Date (newest first)') self.cmbSortSelect.addItem('Date (oldest first)') self.cmbSortSelect.addItem('Transaction ID (ascending)') self.cmbSortSelect.addItem('Transaction ID (descending)') self.cmbFileFormat = QComboBox() self.cmbFileFormat.clear() self.cmbFileFormat.addItem('Comma-Separated Values (*.csv)') fmt = self.main.getPreferredDateFormat() ttipStr = 'Use any of the following symbols:
' fmtSymbols = [x[0] + ' = ' + x[1] for x in FORMAT_SYMBOLS] ttipStr += '
'.join(fmtSymbols) self.edtDateFormat = QLineEdit() self.edtDateFormat.setText(fmt) self.ttipFormatDescr = self.main.createToolTipWidget(ttipStr) self.lblDateExample = QRichLabel('', doWrap=False) self.connect(self.edtDateFormat, SIGNAL('textEdited(QString)'), self.doExampleDate) self.doExampleDate() self.btnResetFormat = QPushButton("Reset to Default") def doReset(): self.edtDateFormat.setText(DEFAULT_DATE_FORMAT) self.doExampleDate() self.connect(self.btnResetFormat, SIGNAL(CLICKED), doReset) # Add the usual buttons self.btnCancel = QPushButton("Cancel") self.btnAccept = QPushButton("Export") self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) self.connect(self.btnAccept, SIGNAL(CLICKED), self.accept) btnBox = makeHorizFrame([STRETCH, self.btnCancel, self.btnAccept]) dlgLayout = QGridLayout() i = 0 dlgLayout.addWidget(QRichLabel('Export Format:'), i, 0) dlgLayout.addWidget(self.cmbFileFormat, i, 1) i += 1 dlgLayout.addWidget(HLINE(), i, 0, 1, 2) i += 1 dlgLayout.addWidget(QRichLabel('Wallet(s) to export:'), i, 0) dlgLayout.addWidget(self.cmbWltSelect, i, 1) i += 1 dlgLayout.addWidget(HLINE(), i, 0, 1, 2) # ACR: Had some sorting issues that seemed unnecessary, so I just # disabled the sort option entirely. The user can sort it # however they want once it's loaded into their spreadsheet app #i += 1 #dlgLayout.addWidget(QRichLabel('Sort Table:'), i, 0) #dlgLayout.addWidget(self.cmbSortSelect, i, 1) #i += 1 #dlgLayout.addWidget(HLINE(), i, 0, 1, 2) i += 1 dlgLayout.addWidget(QRichLabel('Date Format:'), i, 0) fmtfrm = makeHorizFrame([self.lblDateExample, STRETCH, self.ttipFormatDescr]) dlgLayout.addWidget(fmtfrm, i, 1) i += 1 dlgLayout.addWidget(self.btnResetFormat, i, 0) dlgLayout.addWidget(self.edtDateFormat, i, 1) i += 1 dlgLayout.addWidget(HLINE(), i, 0, 1, 2) i += 1 dlgLayout.addWidget(HLINE(), i, 0, 1, 2) i += 1 dlgLayout.addWidget(btnBox, i, 0, 1, 2) self.setLayout(dlgLayout) ############################################################################# def doExampleDate(self, qstr=None): fmtstr = str(self.edtDateFormat.text()) try: exampleDateStr = unixTimeToFormatStr(1030501970, fmtstr) self.lblDateExample.setText('Example: %s' % exampleDateStr) self.isValidFormat = True except: self.lblDateExample.setText('Example: [[invalid date format]]') self.isValidFormat = False ############################################################################# def accept(self, *args): if self.createFile_CSV(): super(DlgExportTxHistory, self).accept(*args) ############################################################################# def createFile_CSV(self): if not self.isValidFormat: QMessageBox.warning(self, 'Invalid date format', \ 'Cannot create CSV without a valid format for transaction ' 'dates and times', QMessageBox.Ok) return False COL = LEDGERCOLS # This was pretty much copied from the createCombinedLedger method... # I rarely do this, but modularizing this piece is a non-trivial wltIDList = [] typelist = [[wid, determineWalletType(self.main.walletMap[wid], self.main)[0]] \ for wid in self.main.walletIDList] currIdx = self.cmbWltSelect.currentIndex() if currIdx >= 4: wltIDList = [self.main.walletIDList[currIdx - 6]] else: listOffline = [t[0] for t in filter(lambda x: x[1] == WLTTYPES.Offline, typelist)] listWatching = [t[0] for t in filter(lambda x: x[1] == WLTTYPES.WatchOnly, typelist)] listCrypt = [t[0] for t in filter(lambda x: x[1] == WLTTYPES.Crypt, typelist)] listPlain = [t[0] for t in filter(lambda x: x[1] == WLTTYPES.Plain, typelist)] if currIdx == 0: wltIDList = listOffline + listCrypt + listPlain elif currIdx == 1: wltIDList = listOffline elif currIdx == 2: wltIDList = listWatching elif currIdx == 3: wltIDList = self.main.walletIDList else: pass totalFunds, spendFunds, unconfFunds, combinedLedger = 0, 0, 0, [] wltBalances = {} for wltID in wltIDList: wlt = self.main.walletMap[wltID] id_le_pairs = [[wltID, le] for le in wlt.getTxLedger('Full')] combinedLedger.extend(id_le_pairs) totalFunds += wlt.getBalance('Total') spendFunds += wlt.getBalance('Spendable') unconfFunds += wlt.getBalance('Unconfirmed') wltBalances[wltID] = 0 # will be accumulated # Each value in COL.Amount will be exactly how much the wallet balance # increased or decreased as a result of this transaction. ledgerTable = self.main.convertLedgerToTable(combinedLedger, showSentToSelfAmt=False) # Sort the data chronologically first, compute the running balance for # each row, then sort it the way that was requested by the user. allBalances = 0 ledgerTable.sort(key=lambda x: x[LEDGERCOLS.UnixTime]) for row in ledgerTable: rawAmt = str2coin(row[COL.Amount]) wltBalances[row[COL.WltID]] += rawAmt allBalances += rawAmt row.append(wltBalances[row[COL.WltID]]) row.append(allBalances) """ sortTxt = str(self.cmbSortSelect.currentText()) if 'newest' in sortTxt: ledgerTable.sort(key=lambda x: x[LEDGERCOLS.UnixTime], reverse=True) elif 'oldest' in sortTxt: ledgerTable.sort(key=lambda x: x[LEDGERCOLS.UnixTime]) elif 'ascend' in sortTxt: ledgerTable.sort(key=lambda x: hex_switchEndian(x[LEDGERCOLS.TxHash])) elif 'descend' in sortTxt: ledgerTable.sort(key=lambda x: hex_switchEndian(x[LEDGERCOLS.TxHash]), reverse=True) else: LOGERROR('***ERROR: bad sort string!?') return """ wltSelectStr = str(self.cmbWltSelect.currentText()).replace(' ', '_') timestampStr = unixTimeToFormatStr(RightNow(), '%Y%m%d_%H%M') filenamePrefix = 'ArmoryTxHistory_%s_%s' % (wltSelectStr, timestampStr) fmtstr = str(self.cmbFileFormat.currentText()) if 'csv' in fmtstr: defaultName = filenamePrefix + '.csv' fullpath = self.main.getFileSave('Save CSV File', \ ['Comma-Separated Values (*.csv)'], \ defaultName) if len(fullpath) == 0: return f = open(fullpath, 'w') f.write('Export Date:, %s\n' % unixTimeToFormatStr(RightNow())) f.write('Total Funds:, %s\n' % coin2str(totalFunds, maxZeros=0).strip()) f.write('Spendable Funds:, %s\n' % coin2str(spendFunds, maxZeros=0).strip()) f.write('Unconfirmed Funds:, %s\n' % coin2str(unconfFunds, maxZeros=0).strip()) f.write('\n') f.write('Included Wallets:\n') for wltID in wltIDList: wlt = self.main.walletMap[wltID] f.write('%s,%s\n' % (wltID, wlt.labelName.replace(',', ';'))) f.write('\n') headerRow = ['Date', 'Transaction ID', '#Conf', 'Wallet ID', 'Wallet Name', 'Credit', 'Debit', 'Fee (paid by this wallet)', 'Wallet Balance', 'Total Balance', 'Label'] f.write(','.join(headerRow) + '\n') for row in ledgerTable: vals = [] fmtstr = str(self.edtDateFormat.text()) unixTime = row[COL.UnixTime] vals.append(unixTimeToFormatStr(unixTime, fmtstr)) vals.append(hex_switchEndian(row[COL.TxHash])) vals.append(row[COL.NumConf]) vals.append(row[COL.WltID]) vals.append(self.main.walletMap[row[COL.WltID]].labelName.replace(',', ';')) wltEffect = row[COL.Amount] txFee = getFeeForTx(hex_to_binary(row[COL.TxHash])) if float(wltEffect) >= 0: vals.append(wltEffect.strip()) vals.append('') vals.append('') else: vals.append('') vals.append(wltEffect.strip()[1:]) # remove negative sign vals.append(coin2str(txFee).strip()) vals.append(coin2str(row[-2])) vals.append(coin2str(row[-1])) vals.append(row[COL.Comment]) f.write('%s,%s,%d,%s,%s,%s,%s,%s,%s,%s,"%s"\n' % tuple(vals)) f.close() return True ################################################################################ class DlgRequestPayment(ArmoryDialog): def __init__(self, parent, main, recvAddr, amt=None, msg=''): super(DlgRequestPayment, self).__init__(parent, main) if isLikelyDataType(recvAddr, DATATYPE.Binary) and len(recvAddr) == 20: self.recvAddr = hash160_to_addrStr(recvAddr) elif isLikelyDataType(recvAddr, DATATYPE.Base58): self.recvAddr = recvAddr else: raise BadAddressError('Unrecognized address input') # Amount self.edtAmount = QLineEdit() self.edtAmount.setFont(GETFONT('Fixed')) self.edtAmount.setMaximumWidth(relaxedSizeNChar(GETFONT('Fixed'), 13)[0]) if amt: self.edtAmount.setText(coin2str(amt, maxZeros=0)) # Message: self.edtMessage = QLineEdit() self.edtMessage.setMaxLength(128) if msg: self.edtMessage.setText(msg[:128]) self.edtMessage.setCursorPosition(0) # Address: self.edtAddress = QLineEdit() self.edtAddress.setText(self.recvAddr) # Link Text: self.edtLinkText = QLineEdit() defaultHex = binary_to_hex('Click here to pay for your order!') savedHex = self.main.getSettingOrSetDefault('DefaultLinkText', defaultHex) if savedHex.startswith('FFFFFFFF'): # An unfortunate hack until we change our settings storage mechanism # See comment in saveLinkText function for details savedHex = savedHex[8:] linkText = hex_to_binary(savedHex) self.edtLinkText.setText(linkText) self.edtLinkText.setCursorPosition(0) self.edtLinkText.setMaxLength(80) qpal = QPalette() qpal.setColor(QPalette.Text, Colors.TextBlue) self.edtLinkText.setPalette(qpal) edtFont = self.edtLinkText.font() edtFont.setUnderline(True) self.edtLinkText.setFont(edtFont) self.connect(self.edtMessage, SIGNAL('textChanged(QString)'), self.setLabels) self.connect(self.edtAddress, SIGNAL('textChanged(QString)'), self.setLabels) self.connect(self.edtAmount, SIGNAL('textChanged(QString)'), self.setLabels) self.connect(self.edtLinkText, SIGNAL('textChanged(QString)'), self.setLabels) self.connect(self.edtMessage, SIGNAL('editingFinished()'), self.updateQRCode) self.connect(self.edtAddress, SIGNAL('editingFinished()'), self.updateQRCode) self.connect(self.edtAmount, SIGNAL('editingFinished()'), self.updateQRCode) self.connect(self.edtLinkText, SIGNAL('editingFinished()'), self.updateQRCode) # This is the "output" self.lblLink = QRichLabel('') self.lblLink.setOpenExternalLinks(True) self.lblLink.setTextInteractionFlags(Qt.TextSelectableByMouse | Qt.TextSelectableByKeyboard) self.lblLink.setMinimumHeight(3 * tightSizeNChar(self, 1)[1]) self.lblLink.setAlignment(Qt.AlignVCenter | Qt.AlignLeft) self.lblLink.setContentsMargins(10, 5, 10, 5) self.lblLink.setStyleSheet('QLabel { background-color : %s }' % htmlColor('SlightBkgdDark')) frmOut = makeHorizFrame([self.lblLink], QFrame.Box | QFrame.Raised) frmOut.setLineWidth(1) frmOut.setMidLineWidth(5) self.lblWarn = QRichLabel('') self.lblWarn.setAlignment(Qt.AlignVCenter | Qt.AlignHCenter) self.btnOtherOpt = QPushButton('Other Options >>>') self.btnCopyRich = QPushButton('Copy to Clipboard') self.btnCopyHtml = QPushButton('Copy Raw HTML') self.btnCopyRaw = QPushButton('Copy Raw URL') self.btnCopyAll = QPushButton('Copy All Text') # I never actally got this button working right... self.btnCopyRich.setVisible(True) self.btnOtherOpt.setCheckable(True) self.btnCopyAll.setVisible(False) self.btnCopyHtml.setVisible(False) self.btnCopyRaw.setVisible(False) frmCopyBtnStrip = makeHorizFrame([ \ self.btnCopyRich, \ self.btnOtherOpt, \ self.btnCopyHtml, \ self.btnCopyRaw, \ STRETCH, \ self.lblWarn]) # self.btnCopyAll, \ self.connect(self.btnCopyRich, SIGNAL(CLICKED), self.clickCopyRich) self.connect(self.btnOtherOpt, SIGNAL('toggled(bool)'), self.clickOtherOpt) self.connect(self.btnCopyRaw, SIGNAL(CLICKED), self.clickCopyRaw) self.connect(self.btnCopyHtml, SIGNAL(CLICKED), self.clickCopyHtml) self.connect(self.btnCopyAll, SIGNAL(CLICKED), self.clickCopyAll) lblDescr = QRichLabel(\ 'Create a clickable link that you can copy into email or webpage to ' 'request a payment. If the user is running a Bitcoin program ' 'that supports "bitcoin:" links, that program will open with ' 'all this information pre-filled after they click the link.') lblDescr.setContentsMargins(5, 5, 5, 5) frmDescr = makeHorizFrame([lblDescr], STYLE_SUNKEN) ttipPreview = self.main.createToolTipWidget(\ 'The following Bitcoin desktop applications try to ' 'register themselves with your computer to handle "bitcoin:" ' 'links: Armory, Multibit, Electrum') ttipLinkText = self.main.createToolTipWidget(\ 'This is the text to be shown as the clickable link. It should ' 'usually begin with "Click here..." to reaffirm to the user it is ' 'is clickable.') ttipAmount = self.main.createToolTipWidget(\ 'All amounts are specifed in BTC') ttipAddress = self.main.createToolTipWidget(\ 'The person clicking the link will be sending bitcoins to this address') ttipMessage = self.main.createToolTipWidget(\ 'This will be pre-filled as the label/comment field ' 'after the user clicks the link. They ' 'can modify it if desired, but you can ' 'provide useful info such as contact details, order number, ' 'etc, as convenience to them.') btnClose = QPushButton('Close') self.connect(btnClose, SIGNAL(CLICKED), self.accept) frmEntry = QFrame() frmEntry.setFrameStyle(STYLE_SUNKEN) layoutEntry = QGridLayout() i = 0 layoutEntry.addWidget(QRichLabel('Link Text:'), i, 0) layoutEntry.addWidget(self.edtLinkText, i, 1) layoutEntry.addWidget(ttipLinkText, i, 2) i += 1 layoutEntry.addWidget(QRichLabel('Address (yours):'), i, 0) layoutEntry.addWidget(self.edtAddress, i, 1) layoutEntry.addWidget(ttipAddress, i, 2) i += 1 layoutEntry.addWidget(QRichLabel('Request (BTC):'), i, 0) layoutEntry.addWidget(self.edtAmount, i, 1) i += 1 layoutEntry.addWidget(QRichLabel('Label:'), i, 0) layoutEntry.addWidget(self.edtMessage, i, 1) layoutEntry.addWidget(ttipMessage, i, 2) frmEntry.setLayout(layoutEntry) lblOut = QRichLabel('Copy and paste the following text into email or other document:') frmOutput = makeVertFrame([lblOut, frmOut, frmCopyBtnStrip], STYLE_SUNKEN) frmOutput.layout().setStretch(0, 1) frmOutput.layout().setStretch(1, 1) frmOutput.layout().setStretch(2, 0) frmClose = makeHorizFrame([STRETCH, btnClose]) self.qrStackedDisplay = QStackedWidget() self.qrStackedDisplay.setSizePolicy(QSizePolicy.Fixed, QSizePolicy.Preferred) self.qrWaitingLabel = QRichLabel('Creating QR Code Please Wait', doWrap=False, hAlign=Qt.AlignHCenter) self.qrStackedDisplay.addWidget(self.qrWaitingLabel) self.qrURI = QRCodeWidget('', parent=self) self.qrStackedDisplay.addWidget(self.qrURI) lblQRDescr = QRichLabel('This QR code contains address and the ' 'other payment information shown to the left.', doWrap=True) lblQRDescr.setAlignment(Qt.AlignTop | Qt.AlignHCenter) frmQR = makeVertFrame([self.qrStackedDisplay, STRETCH, lblQRDescr, STRETCH], STYLE_SUNKEN) frmQR.layout().setStretch(0, 0) frmQR.layout().setStretch(1, 0) frmQR.layout().setStretch(2, 1) frmQR.setMinimumWidth(MAX_QR_SIZE) self.qrURI.setMinimumHeight(MAX_QR_SIZE) dlgLayout = QGridLayout() dlgLayout.addWidget(frmDescr, 0, 0, 1, 2) dlgLayout.addWidget(frmEntry, 1, 0, 1, 1) dlgLayout.addWidget(frmOutput, 2, 0, 1, 1) dlgLayout.addWidget(HLINE(), 3, 0, 1, 2) dlgLayout.addWidget(frmClose, 4, 0, 1, 2) dlgLayout.addWidget(frmQR, 1, 1, 2, 1) dlgLayout.setRowStretch(0, 0) dlgLayout.setRowStretch(1, 0) dlgLayout.setRowStretch(2, 1) dlgLayout.setRowStretch(3, 0) dlgLayout.setRowStretch(4, 0) self.setLabels() self.prevURI = '' self.closed = False # kind of a hack to end the update loop self.setLayout(dlgLayout) self.setWindowTitle('Create Payment Request Link') from twisted.internet import reactor reactor.callLater(1, self.periodicUpdate) hexgeom = str(self.main.settings.get('PayReqestGeometry')) if len(hexgeom) > 0: geom = QByteArray.fromHex(hexgeom) self.restoreGeometry(geom) self.setMinimumSize(750, 500) def saveLinkText(self): linktext = str(self.edtLinkText.text()).strip() if len(linktext) > 0: # TODO: We desperately need a new settings file format -- the one # we use was more of an experiment in how quickly I could # create a simple settings file, but it has quirky behavior # that makes cryptic hacks like below necessary. Simply put, # if the hex of the text is all digits (no hex A-F), then # the settings file will read the value as a long int instead # of a string. We add 8 F's to make sure it's interpretted # as a hex string, but someone looking at the file wouldn't # mistake it for meaningful data. We remove it upon reading # the value from the settings file. hexText = 'FFFFFFFF'+binary_to_hex(linktext) self.main.writeSetting('DefaultLinkText', hexText) ############################################################################# def saveGeometrySettings(self): self.main.writeSetting('PayReqestGeometry', str(self.saveGeometry().toHex())) ############################################################################# def closeEvent(self, event): self.saveGeometrySettings() self.saveLinkText() super(DlgRequestPayment, self).closeEvent(event) ############################################################################# def accept(self, *args): self.saveGeometrySettings() self.saveLinkText() super(DlgRequestPayment, self).accept(*args) ############################################################################# def reject(self, *args): self.saveGeometrySettings() super(DlgRequestPayment, self).reject(*args) ############################################################################# def setLabels(self): lastTry = '' try: # The lastTry = 'Amount' amtStr = str(self.edtAmount.text()).strip() if len(amtStr) == 0: amt = None else: amt = str2coin(amtStr) if amt > MAX_SATOSHIS: amt = None lastTry = 'Message' msgStr = str(self.edtMessage.text()).strip() if len(msgStr) == 0: msgStr = None lastTry = 'Address' addr = str(self.edtAddress.text()).strip() if not checkAddrStrValid(addr): raise errorIn = 'Inputs' # must have address, maybe have amount and/or message self.rawURI = createBitcoinURI(addr, amt, msgStr) except: self.lblWarn.setText('Invalid %s' % lastTry) self.btnCopyRaw.setEnabled(False) self.btnCopyHtml.setEnabled(False) self.btnCopyAll.setEnabled(False) # self.lblLink.setText('
'.join(str(self.lblLink.text()).split('
')[1:])) self.lblLink.setEnabled(False) self.lblLink.setTextInteractionFlags(Qt.NoTextInteraction) return self.lblLink.setTextInteractionFlags(Qt.TextSelectableByMouse | \ Qt.TextSelectableByKeyboard) self.rawHtml = '%s' % (self.rawURI, str(self.edtLinkText.text())) self.lblWarn.setText('') self.dispText = self.rawHtml[:] self.dispText += '
' self.dispText += 'If clicking on the line above does not work, use this payment info:' self.dispText += '
' self.dispText += 'Pay to:\t%s
' % addr if amt: self.dispText += 'Amount:\t%s BTC
' % coin2str(amt, maxZeros=0).strip() if msgStr: self.dispText += 'Message:\t%s
' % msgStr self.lblLink.setText(self.dispText) self.lblLink.setEnabled(True) self.btnCopyRaw.setEnabled(True) self.btnCopyHtml.setEnabled(True) self.btnCopyAll.setEnabled(True) # Plain text to copy to clipboard as "text/plain" self.plainText = str(self.edtLinkText.text()) + '\n' self.plainText += 'If clicking on the line above does not work, use this payment info:\n' self.plainText += 'Pay to: %s' % addr if amt: self.plainText += '\nAmount: %s BTC' % coin2str(amt, maxZeros=0).strip() if msgStr: self.plainText += '\nMessage: %s' % msgStr self.plainText += '\n' # The rich-text to copy to the clipboard, as "text/html" self.clipText = (\ ' ' '' '' '

' '' '' '%s
' 'If clicking on the line above does not work, use this payment info:' '
Pay to: %s') % \ (self.rawURI, str(self.edtLinkText.text()), addr) if amt: self.clipText += ('
Amount' ': %s' % coin2str(amt, maxZeros=0)) if msgStr: self.clipText += ('
Message' ': %s' % msgStr) self.clipText += '

' def periodicUpdate(self, nsec=1): if not self.closed: from twisted.internet import reactor self.updateQRCode() reactor.callLater(nsec, self.periodicUpdate) def updateQRCode(self, e=None): if not self.prevURI == self.rawURI: self.qrStackedDisplay.setCurrentWidget(self.qrWaitingLabel) self.repaint() self.qrURI.setAsciiData(self.rawURI) self.qrURI.setPreferredSize(MAX_QR_SIZE - 10, 'max') self.qrStackedDisplay.setCurrentWidget(self.qrURI) self.repaint() self.prevURI = self.rawURI def clickCopyRich(self): clipb = QApplication.clipboard() clipb.clear() qmd = QMimeData() if OS_WINDOWS: qmd.setText(self.plainText) qmd.setHtml(self.clipText) else: prefix = '' qmd.setText(self.plainText) qmd.setHtml(prefix + self.dispText) clipb.setMimeData(qmd) self.lblWarn.setText('Copied!') def clickOtherOpt(self, boolState): self.btnCopyHtml.setVisible(boolState) self.btnCopyRaw.setVisible(boolState) if boolState: self.btnOtherOpt.setText('Hide Buttons <<<') else: self.btnOtherOpt.setText('Other Options >>>') def clickCopyRaw(self): clipb = QApplication.clipboard() clipb.clear() clipb.setText(self.rawURI) self.lblWarn.setText('Copied!') def clickCopyHtml(self): clipb = QApplication.clipboard() clipb.clear() clipb.setText(self.rawHtml) self.lblWarn.setText('Copied!') def clickCopyAll(self): clipb = QApplication.clipboard() clipb.clear() qmd = QMimeData() qmd.setHtml(self.dispText) clipb.setMimeData(qmd) self.lblWarn.setText('Copied!') ################################################################################ class DlgNotificationWithDNAA(ArmoryDialog): """ This dialog will be used for automatic popups when notifications come in, as well as displaying specific notifications if viewed and selected in the Announcements tab. """ def __init__(self, parent, main, nid, notifyMap, showBtnDNAA=True): super(DlgNotificationWithDNAA, self).__init__(parent, main) self.notifyID = nid isUpgrade = ('upgrade' in notifyMap['ALERTTYPE'].lower()) isTesting = (notifyMap['ALERTTYPE'].lower()=='upgrade-testing') #if notifyMap is None: #notifyMap = self.main.almostFullNotificationList[nid] priority = int(notifyMap['PRIORITY']) shortDescr = notifyMap['SHORTDESCR'] longDescr = notifyMap['LONGDESCR'] startTime = long(notifyMap['STARTTIME']) minver = notifyMap['MINVERSION'] maxver = notifyMap['MAXVERSION'] minExclude = minver.startswith('>') maxExclude = maxver.startswith('<') minver = minver[1:] if minExclude else minver maxver = maxver[1:] if maxExclude else maxver LTE = '\xe2\x89\xa4' GTE = '\xe2\x89\xa5' if isUpgrade: currVerStr = getVersionString(BTCARMORY_VERSION) versionString = tr("""You are using version %s
""") % currVerStr elif minver=='*': versionString = tr('Affects Armory versions: ') if maxver=='*': versionString = 'Affects all Armory versions' elif maxExclude: versionString += tr('before %s
' % maxver) else: versionString += tr('%s%s
' % (LTE, maxver)) elif minExclude: versionString = tr('Affects Armory versions ') if maxver=='*': versionString += tr('after %s
' % minver) elif maxExclude: versionString += tr('between %s and %s
' % (minver, maxver)) else: versionString += tr('after %s, %s%s
' % (minver, LTE, maxver)) else: versionString = tr('Affects Armory versions ') if maxver=='*': versionString += tr('%s%s
' % (GTE,minver)) elif maxExclude: versionString += tr('%s%s and before %s
' % (GTE, minver, maxver)) else: versionString += tr('%s%s and %s%s
' % (GTE,minver,LTE,maxver)) startTimeStr = '' if startTime > 0: if isUpgrade: for verStr,dateStr,updList in self.main.changelog: if verStr==notifyMap['MAXVERSION'][1:]: startTimeStr = tr('Released: %s
' % dateStr) break else: startTimeStr = unixTimeToFormatStr(startTime, 'Date: %B %d, %Y
') if isUpgrade: iconFile = ':/MsgBox_info48.png' headerSz = 4 if isTesting: titleStr = tr('New Armory Test Build') headerStr = tr("""New Testing Version Available!""") else: titleStr = tr('Upgrade Armory') headerStr = tr("""Armory is out-of-date!""") elif 0 <= priority < 2048: iconFile = ':/MsgBox_info48.png' titleStr = tr('Information') headerSz = 4 headerStr = tr("""General Notification""") elif 2048 <= priority < 4096: iconFile = ':/MsgBox_warning48.png' titleStr = '' headerSz = 4 headerStr = tr(""" Important Information from Armory Technologies, Inc.""") elif 4096 <= priority < 5120: iconFile = ':/MsgBox_critical64.png' titleStr = tr('Alert') headerSz = 4 headerStr = tr(""" Security Alert from Armory Technologies, Inc.""") elif 5120 <= priority: iconFile = ':/MsgBox_critical64.png' titleStr = tr('Alert') headerSz = 4 headerStr = tr(""" Critical Security Alert from Armory Technologies, Inc.""") lblHeader = QRichLabel(tr(""" %s
""") % \ (headerSz, htmlColor('TextWarn'), headerStr), \ doWrap=False, hAlign=Qt.AlignHCenter) lblTopInfo = QRichLabel(tr(""" %(shortDescr)s
%(startTimeStr)s
%(versionString)s """) % locals()) lastWord = '' if not isUpgrade: lastWord = tr(""" If new versions of Armory are available, you can get them using our secure downloader """) lblBottomInfo = QRichLabel(tr(""" You can access all alerts and announcements from the "Announcements" tab on the main Armory window.""") + lastWord) def doUDD(href=None): self.accept() self.main.openDLArmory() lblBottomInfo.setOpenExternalLinks(False) self.connect(lblBottomInfo, SIGNAL('linkActivated(const QString &)'), doUDD) # Setup the long descr def openLink(url): #print 'opening ', url import webbrowser webbrowser.open(str(url)) self.txtLongDescr = QTextBrowser() self.txtLongDescr.setHtml(longDescr) self.txtLongDescr.setOpenExternalLinks(True) notifyIcon = QLabel() pixfile = QPixmap(iconFile) notifyIcon.setPixmap(pixfile) notifyIcon.setAlignment(Qt.AlignHCenter | Qt.AlignVCenter) btnDismiss = QPushButton(tr('Close')) btnIgnoreLong = QPushButton(tr('Do not popup again')) btnDownload = QPushButton(tr('Secure Download')) btnIgnoreLong.setVisible(showBtnDNAA) def openUpgrader(): self.accept() self.main.openDLArmory() self.connect(btnDismiss, SIGNAL(CLICKED), self.acceptShortIgnore) self.connect(btnIgnoreLong, SIGNAL(CLICKED), self.acceptLongIgnore) self.connect(btnDownload, SIGNAL(CLICKED), openUpgrader) if not isUpgrade: btnDownload.setVisible(False) # You cannot permanently ignore a critical security alert! if priority >= 5120: btnIgnoreLong.setVisible(False) layout = QVBoxLayout() frmTop = makeHorizFrame([notifyIcon, 'Space(20)', lblTopInfo]) frmTop.layout().setStretch(0, 0) frmTop.layout().setStretch(1, 0) frmTop.layout().setStretch(2, 1) frmButton = makeHorizFrame(['Stretch', \ btnDismiss, \ btnIgnoreLong, \ btnDownload]) layout.addWidget(lblHeader) layout.addWidget(HLINE()) layout.addWidget(frmTop) layout.addWidget(self.txtLongDescr) layout.addItem(QSpacerItem(20, 20)) layout.addWidget(lblBottomInfo) layout.addWidget(frmButton) layout.setStretch(0, 0) layout.setStretch(1, 0) layout.setStretch(2, 0) layout.setStretch(3, 1) layout.setStretch(4, 0) layout.setStretch(5, 0) layout.setStretch(6, 0) self.setLayout(layout) self.setMinimumWidth(500) # TODO: Dear god this is terrible, but for my life I cannot figure # out how to move the vbar, because you can't do it until # the dialog is drawn which doesn't happen til after __init__ from twisted.internet import reactor reactor.callLater(0.05, self.resizeEvent) self.setWindowTitle(titleStr) self.setWindowIcon(QIcon(iconFile)) def resizeEvent(self, ev=None): super(DlgNotificationWithDNAA, self).resizeEvent(ev) vbar = self.txtLongDescr.verticalScrollBar() vbar.setValue(vbar.minimum()) def acceptLongIgnore(self): self.main.notifyIgnoreLong.add(self.notifyID) self.main.notifyIgnoreShort.add(self.notifyID) self.main.writeSetting('NotifyIgnore',''.join(self.main.notifyIgnoreLong)) self.accept() def acceptShortIgnore(self): self.main.notifyIgnoreShort.add(self.notifyID) self.accept() ################################################################################ class DlgUriCopyAndPaste(ArmoryDialog): def __init__(self, parent, main): super(DlgUriCopyAndPaste, self).__init__(parent, main) self.uriDict = {} lblDescr = QRichLabel('Copy and paste a raw bitcoin URL string here. ' 'A valid string starts with "bitcoin:" followed ' 'by a bitcoin address.' '

' 'You should use this feature if there is a "bitcoin:" ' 'link in a webpage or email that does not load Armory ' 'when you click on it. Instead, right-click on the ' 'link and select "Copy Link Location" then paste it ' 'into the box below. ') lblShowExample = QLabel() lblShowExample.setPixmap(QPixmap(':/armory_rightclickcopy.png')) self.txtUriString = QLineEdit() self.txtUriString.setFont(GETFONT('Fixed', 8)) self.btnOkay = QPushButton('Done') self.btnCancel = QPushButton('Cancel') buttonBox = QDialogButtonBox() buttonBox.addButton(self.btnOkay, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) self.connect(self.btnOkay, SIGNAL(CLICKED), self.clickedOkay) self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) frmImg = makeHorizFrame([STRETCH, lblShowExample, STRETCH]) layout = QVBoxLayout() layout.addWidget(lblDescr) layout.addWidget(HLINE()) layout.addWidget(frmImg) layout.addWidget(HLINE()) layout.addWidget(self.txtUriString) layout.addWidget(buttonBox) self.setLayout(layout) def clickedOkay(self): uriStr = str(self.txtUriString.text()) self.uriDict = self.main.parseUriLink(uriStr, 'enter') if len(self.uriDict.keys()) > 0: self.accept() class DlgCoinControl(ArmoryDialog): def __init__(self, parent, main, wlt, currSelect=None): super(DlgCoinControl, self).__init__(parent, main) self.wlt = wlt lblDescr = QRichLabel(\ 'By default, transactions are created using any available coins from ' 'all addresses in this wallet. You can control the source addresses ' 'used for this transaction by selecting them below, and unchecking ' 'all other addresses.') self.chkSelectAll = QCheckBox('Select All') self.chkSelectAll.setChecked(True) self.connect(self.chkSelectAll, SIGNAL(CLICKED), self.clickAll) addrToInclude = [] totalBal = 0 for addr160 in wlt.addrMap.iterkeys(): bal = wlt.getAddrBalance(addr160) if bal > 0: addrToInclude.append([addr160, bal]) totalBal += bal frmTableLayout = QGridLayout() self.dispTable = [] frmTableLayout.addWidget(QRichLabel('Address'), 0, 0) frmTableLayout.addWidget(VLINE(), 0, 1) frmTableLayout.addWidget(QRichLabel('Balance'), 0, 2) frmTableLayout.addWidget(VLINE(), 0, 3) frmTableLayout.addWidget(QRichLabel('Comment'), 0, 4) frmTableLayout.addWidget(HLINE(), 1, 0, 1, 5) for i in range(len(addrToInclude)): a160, bal = addrToInclude[i] fullcmt = self.wlt.getCommentForAddress(a160) shortcmt = fullcmt if shortcmt == CHANGE_ADDR_DESCR_STRING: shortcmt = 'Change Address' fullcmt = '(This address was created only to receive change from another transaction)' elif len(shortcmt) > 20: shortcmt = fullcmt[:20] + '...' self.dispTable.append([None, None, None]) self.dispTable[-1][0] = QCheckBox(hash160_to_addrStr(a160)) self.dispTable[-1][1] = QMoneyLabel(bal) self.dispTable[-1][2] = QRichLabel(shortcmt, doWrap=False) self.dispTable[-1][0].setChecked(currSelect == None or (a160 in currSelect)) if len(shortcmt) > 0: self.dispTable[-1][0].setToolTip('' + fullcmt) self.dispTable[-1][1].setToolTip('' + fullcmt) self.dispTable[-1][2].setToolTip('' + fullcmt) self.connect(self.dispTable[-1][0], SIGNAL(CLICKED), self.clickOne) frmTableLayout.addWidget(self.dispTable[-1][0], i + 2, 0) frmTableLayout.addWidget(VLINE(), i + 2, 1) frmTableLayout.addWidget(self.dispTable[-1][1], i + 2, 2) frmTableLayout.addWidget(VLINE(), i + 2, 3) frmTableLayout.addWidget(self.dispTable[-1][2], i + 2, 4) frmTable = QFrame() frmTable.setLayout(frmTableLayout) self.scrollAddrList = QScrollArea() self.scrollAddrList.setWidget(frmTable) self.sizeHint = lambda: QSize(frmTable.width() + 40, 400) lblDescrSum = QRichLabel('Balance of selected addresses:', doWrap=False) self.lblSum = QMoneyLabel(totalBal, wBold=True) frmSum = makeHorizFrame([STRETCH, lblDescrSum, self.lblSum, STRETCH]) self.btnAccept = QPushButton("Accept") self.btnCancel = QPushButton("Cancel") self.connect(self.btnAccept, SIGNAL(CLICKED), self.acceptSelection) self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) buttonBox = QDialogButtonBox() buttonBox.addButton(self.btnAccept, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) layout = QGridLayout() layout.addWidget(lblDescr, 0, 0) layout.addWidget(self.chkSelectAll, 1, 0) layout.addWidget(self.scrollAddrList, 2, 0) layout.addWidget(frmSum, 3, 0) layout.addWidget(buttonBox, 4, 0) layout.setRowStretch(0, 0) layout.setRowStretch(1, 0) layout.setRowStretch(2, 1) layout.setRowStretch(3, 0) layout.setRowStretch(4, 0) self.setLayout(layout) self.recalcBalance() self.setWindowTitle('Coin Control (Expert)') def clickAll(self): for dispList in self.dispTable: dispList[0].setChecked(self.chkSelectAll.isChecked()) self.recalcBalance() def clickOne(self): self.recalcBalance() def recalcBalance(self): totalBal = 0 for dispList in self.dispTable: if dispList[0].isChecked(): atype, a160 = addrStr_to_hash160(str(dispList[0].text()), False) totalBal += self.wlt.getAddrBalance(a160) else: self.chkSelectAll.setChecked(False) self.lblSum.setValueText(totalBal) def acceptSelection(self): self.coinControlList = [] for dispList in self.dispTable: if dispList[0].isChecked(): atype, a160 = addrStr_to_hash160(str(dispList[0].text()), False) bal = self.wlt.getAddrBalance(a160) self.coinControlList.append([a160, bal]) if len(self.coinControlList) == 0: QMessageBox.warning(self, 'Nothing Selected', \ 'You must select at least one address to fund your ' 'transaction.', QMessageBox.Ok) return self.accept() ################################################################################ class DlgQRCodeDisplay(ArmoryDialog): def __init__(self, parent, main, dataToQR, descrUp='', descrDown=''): super(DlgQRCodeDisplay, self).__init__(parent, main) btnDone = QPushButton('Close') self.connect(btnDone, SIGNAL(CLICKED), self.accept) frmBtn = makeHorizFrame([STRETCH, btnDone, STRETCH]) qrDisp = QRCodeWidget(dataToQR, parent=self) frmQR = makeHorizFrame([STRETCH, qrDisp, STRETCH]) lblUp = QRichLabel(descrUp) lblUp.setAlignment(Qt.AlignVCenter | Qt.AlignHCenter) lblDn = QRichLabel(descrDown) lblDn.setAlignment(Qt.AlignVCenter | Qt.AlignHCenter) layout = QVBoxLayout() layout.addWidget(lblUp) layout.addWidget(frmQR) layout.addWidget(lblDn) layout.addWidget(HLINE()) layout.addWidget(frmBtn) self.setLayout(layout) w1, h1 = relaxedSizeStr(lblUp, descrUp) w2, h2 = relaxedSizeStr(lblDn, descrDown) self.setMinimumWidth(1.2 * max(w1, w2)) ################################################################################ # STUB STUB STUB STUB STUB class ArmoryPref(object): """ Create a class that will handle arbitrary preferences for Armory. This means that I can just create maps/lists of preferences, and auto-include them in the preferences dialog, and know how to set/get them. This will be subclassed for each unique/custom preference type that is needed. """ def __init__(self, prefName, dispStr, setType, defaultVal, validRange, descr, ttip, usermodes=None): self.preference = prefName self.displayStr = dispStr self.preferType = setType self.defaultVal = defaultVal self.validRange = validRange self.description = descr self.ttip = ttip # Some options may only be displayed for certain usermodes self.users = usermodes if usermodes == None: self.users = set([USERMODE.Standard, USERMODE.Advanced, USERMODE.Expert]) if self.preferType == 'str': self.entryObj = QLineEdit() elif self.preferType == 'num': self.entryObj = QLineEdit() elif self.preferType == 'file': self.entryObj = QLineEdit() elif self.preferType == 'bool': self.entryObj = QCheckBox() elif self.preferType == 'combo': self.entryObj = QComboBox() def setEntryVal(self): pass def readEntryVal(self): pass def setWidthChars(self, nChar): self.entryObj.setMinimumWidth(relaxedSizeNChar(self.entryObj, nChar)[0]) def render(self): """ Return a map of qt objects to insert into the frame """ toDraw = [] row = 0 if len(self.description) > 0: toDraw.append([QRichLabel(self.description), row, 0, 1, 4]) row += 1 ################################################################################ class DlgInstallLinux(ArmoryDialog): def __init__(self, parent, main): super(DlgInstallLinux, self).__init__(parent, main) import platform self.distro, self.dver, self.dname = platform.linux_distribution() lblOptions = QRichLabel(\ 'If you have manually installed Bitcoin-Qt or bitcoind on this system ' 'before, it is recommended you use the method here you previously used. ' 'If you get errors using this option, try using the manual instructions ' 'below.') self.radioUbuntuPPA = QRadioButton('Install from bitcoin.org PPA (Ubuntu only)') self.radioDlBinaries = QRadioButton('Download and unpack binaries (All Linux)') btngrp = QButtonGroup(self) btngrp.addButton(self.radioDlBinaries) btngrp.addButton(self.radioUbuntuPPA) btngrp.setExclusive(True) self.connect(self.radioDlBinaries, SIGNAL(CLICKED), self.clickInstallOpt) self.connect(self.radioUbuntuPPA, SIGNAL(CLICKED), self.clickInstallOpt) ########################################################################## # Install via PPA lblAutoPPATitle = QRichLabel('Install PPA for me (Ubuntu only):') lblAutoPPA = QRichLabel(\ 'Have Armory install the PPA for you. The does not work on all ' 'systems, so try the manual instructions below, if it fails. ' 'Using the PPA will install the Bitcoin software using your ' 'system\'s package manager, and you will be notified of updates along with ' 'other software on your system.') self.btnAutoPPA = QPushButton('Install Bitcoin PPA') self.connect(self.btnAutoPPA, SIGNAL(CLICKED), self.doPPA) self.btnAutoPPA.setToolTip(\ 'Click to install the Bitcoin PPA for Ubuntu') frmDoItForMeBtn = makeHorizFrame([STRETCH, \ self.btnAutoPPA, \ STRETCH]) lblInstallPPATitle = QRichLabel('Manual PPA Installation:', doWrap=False) lblInstallPPA = QRichLabel(\ 'Open a terminal window and copy the following three commands ' 'one-by-one, pressing [ENTER] after each one. You can open a terminal by hitting ' 'Alt-F2 and typing "terminal" (without quotes), or in ' 'the "Applications" menu under "Accessories".') lblInstallPPACmds = QRichLabel(\ 'sudo add-apt-repository ppa:bitcoin/bitcoin' '
' 'sudo apt-get update' '
' 'sudo apt-get install bitcoin-qt bitcoind') lblInstallPPACmds.setFont(GETFONT('Courier', 10)) lblInstallPPACmds.setTextInteractionFlags(Qt.TextSelectableByMouse | \ Qt.TextSelectableByKeyboard) frmCmds = makeHorizFrame([lblInstallPPACmds], STYLE_SUNKEN) self.frmPPA = makeVertFrame([ \ lblAutoPPATitle, \ lblAutoPPA, \ frmDoItForMeBtn, \ HLINE(), \ lblInstallPPATitle, \ lblInstallPPA, \ frmCmds], STYLE_SUNKEN) # Install via PPA ########################################################################## ########################################################################## # Install via Manual Download lblManualExperiment = QRichLabel(\ 'Download and set it up for me! (All Linux):' '

' 'Armory will download and verify the binaries from www.bitcoin.org. ' 'Your Armory settings will automatically be adjusted to point to that ' 'as the installation directory.') btnManualExperiment = QPushButton('Install for me!') self.connect(btnManualExperiment, SIGNAL(CLICKED), self.tryManualInstall) self.chkCustomDLPath = QCheckBox('Select custom download location') lblInstallManualDescr = QRichLabel(\ 'Manual download and install of the Bitcoin software:
' '
    ' '
  1. Go to ' 'http://www.bitcoin.org/en/download
    2. ' '
  2. Click on the link that says "Download for Linux (tgz, 32/64-bit)"
    3. ' '
  3. Open a file browser and navigate to the download directory
    4. ' '
  4. Right-click on the downloaded file, and select "Extract Here"
    5. ' '
' '
' 'Once the downloaded archive is unpacked, then click the button below ' 'to open the Armory settings and change the "Bitcoin Installation Path" ' 'to point to the new directory. Then restart Armory') lblInstallManualDescr.setOpenExternalLinks(True) btnInstallSettings = QPushButton('Change Settings') self.connect(btnInstallSettings, SIGNAL(CLICKED), self.main.openSettings) frmChngSettings = makeHorizFrame([ STRETCH, \ btnInstallSettings, \ STRETCH], \ STYLE_SUNKEN) btnAndChk = makeHorizFrame([btnManualExperiment, self.chkCustomDLPath]) frmManualExper = makeHorizFrame([STRETCH, btnAndChk, STRETCH]) self.frmManual = makeVertFrame([ \ lblManualExperiment, \ frmManualExper, \ HLINE(), \ lblInstallManualDescr, \ frmChngSettings, \ STRETCH]) # Install via Manual Download ########################################################################## self.stkInstruct = QStackedWidget() self.stkInstruct.addWidget(self.frmPPA) self.stkInstruct.addWidget(self.frmManual) btnOkay = QPushButton("OK") self.connect(btnOkay, SIGNAL(CLICKED), self.accept) layout = QVBoxLayout() layout.addWidget(lblOptions) layout.addWidget(self.radioUbuntuPPA) layout.addWidget(self.radioDlBinaries) layout.addWidget(HLINE()) layout.addWidget(self.stkInstruct) layout.addWidget(makeHorizFrame([STRETCH, btnOkay])) self.setLayout(layout) self.setMinimumWidth(600) self.radioUbuntuPPA.setChecked(True) self.clickInstallOpt() self.setWindowTitle('Install Bitcoin in Linux') from twisted.internet import reactor reactor.callLater(0.2, self.main.checkForLatestVersion) ############################################################################# def tryManualInstall(self): dlDict = self.main.downloadDict.copy() if not 'SATOSHI' in dlDict or not 'Linux' in dlDict['SATOSHI']: QMessageBox.warning(self, 'Not available', \ 'Armory does not actually have the information needed to execute ' 'this process securely. Please visit the bitcoin.org and download ' 'the Linux version of the Bitcoin software, then modify your ' 'settings to point to where it was unpacked. ', QMessageBox.Ok) return if not self.chkCustomDLPath.isChecked(): installPath = os.path.join(ARMORY_HOME_DIR, 'downloaded') if not os.path.exists(installPath): os.makedirs(installPath) else: title = 'Download Bitcoin software to...' initPath = self.main.settings.get('LastDirectory') if not OS_MACOSX: installPath = unicode(QFileDialog.getExistingDirectory(self, title, initPath)) else: installPath = unicode(QFileDialog.getExistingDirectory(self, title, initPath, \ options=QFileDialog.DontUseNativeDialog)) if not os.path.exists(installPath): if len(installPath.strip()) > 0: QMessageBox.warning(self, 'Invalid Directory', \ 'The directory you chose does not exist. How did you do that?', \ QMessageBox.Ok) return #print dlDict['SATOSHI']['Linux'] theLink = dlDict['SATOSHI']['Linux'][0] theHash = dlDict['SATOSHI']['Linux'][1] dlg = DlgDownloadFile(self, self.main, theLink, theHash) dlg.exec_() fileData = dlg.dlFileData if len(fileData) == 0 or dlg.dlVerifyFailed: QMessageBox.critical(self, 'Download Failed', \ 'The download failed. Please visit www.bitcoin.org ' 'to download and install Bitcoin-Qt manually.', QMessageBox.Ok) import webbrowser webbrowser.open('http://www.bitcoin.org/en/download') return fullPath = os.path.join(installPath, dlg.dlFileName) LOGINFO('Installer path: %s', fullPath) instFile = open(fullPath, 'wb') instFile.write(fileData) instFile.close() newDir = fullPath[:-7] if os.path.exists(newDir): shutil.rmtree(newDir) os.makedirs(newDir) launchProcess(['tar', '-zxf', fullPath, '-C', installPath]) self.main.writeSetting('SatoshiExe', newDir) QMessageBox.information(self, 'Succeeded', \ 'The download succeeded!', QMessageBox.Ok) from twisted.internet import reactor reactor.callLater(0.5, self.main.executeModeSwitch) self.accept() ############################################################################# def clickInstallOpt(self): if self.radioUbuntuPPA.isChecked(): self.stkInstruct.setCurrentIndex(0) elif self.radioDlBinaries.isChecked(): self.stkInstruct.setCurrentIndex(1) else: LOGERROR('How is neither instruction option checked!?') ############################################################################# def loadGpgKeyring(self): pubDirLocal = os.path.join(ARMORY_HOME_DIR, 'tempKeyring') # if os.path.exists(pubDirLocal): pubDirInst = os.path.join(GetExecDir(), 'PublicKeys') gpgCmdList = ['gpg'] cmdImportKey = ('gpg ' '--keyring ~/.armory/testkeyring.gpg ' '--no-default-keyring ' '--import %s/AndresenCodeSign.asc') cmdVerifyFile = ('gpg ' '--keyring ~/.armory/testkeyring.gpg ' '--verify bitcoin.0.8.1.tar.gz') ############################################################################# def doPPA(self): out, err = execAndWait('gksudo install_bitcoinqt', timeout=20) tryInstallLinux(self.main) self.main.settings.delete('SatoshiExe') self.accept() ################################################################################ def tryInstallLinux(main): def doit(): #print '\n' #print '***** Executing auto-install in linux...' out, err = execAndWait('gksudo "apt-get remove -y bitcoin-qt bitcoind"', \ timeout=20) out, err = execAndWait(('gksudo apt-add-repository ppa:bitcoin/bitcoin; ' 'gksudo apt-get update; ' 'gksudo "apt-get install -y bitcoin-qt bitcoind"'), \ timeout=120) try: TheSDM.setupSDM() from twisted.internet import reactor reactor.callLater(0.1, main.executeModeSwitch) QMessageBox.information(main, 'Success!', \ 'The installation appears to have succeeded!') except: LOGINFO('***** Printing output\n' + out) LOGINFO('***** End print output\n') LOGINFO('***** Printing errors\n' + err) LOGINFO('***** End print errors\n') QMessageBox.warning(main, 'Unknown Error', \ 'An error was reported while trying to install the Bitcoin ' 'software. The following information is given:

%s' % err, \ QMessageBox.Ok) raise DlgExecLongProcess(doit, 'Installing Bitcoin Software...', main, main).exec_() ################################################################################ class DlgInstallWindows(ArmoryDialog): def __init__(self, parent, main, dataToQR, descrUp='', descrDown=''): super(DlgInstallWindows, self).__init__(parent, main) ################################################################################ class DlgDownloadFile(ArmoryDialog): def __init__(self, parent, main, dlfile, expectHash=None, msg=''): super(DlgDownloadFile, self).__init__(parent, main) self.dlFullPath = dlfile self.dlFileName = os.path.basename(self.dlFullPath) self.dlSiteName = '/'.join(self.dlFullPath.split('/')[:3]) self.dlFileSize = 0 self.dlFileData = '' self.dlDownBytes = 0 self.dlExpectHash = expectHash self.dlStartTime = RightNow() self.dlVerifyFailed = False self.StopDownloadFlag = False self.lblDownloaded = QRichLabel('') self.barWorking = QProgressBar() self.barWorking.setRange(0, 100) self.barWorking.setValue(0) self.barWorking.setFormat('') lblDescr = QRichLabel(\ 'Please wait while file is downloading' '' % htmlColor('TextBlue'), hAlign=Qt.AlignHCenter) frmDescr = makeHorizFrame([lblDescr], STYLE_RAISED) frmInfo = QFrame() layoutFileInfo = QGridLayout() layoutFileInfo.addWidget(QRichLabel('File name:', bold=True), 0, 0) layoutFileInfo.addWidget(QRichLabel(self.dlFileName), 0, 2) layoutFileInfo.addWidget(QRichLabel('From site:', bold=True), 1, 0) layoutFileInfo.addWidget(QRichLabel(self.dlSiteName), 1, 2) layoutFileInfo.addWidget(QRichLabel('Progress:', bold=True), 2, 0) layoutFileInfo.addWidget(self.lblDownloaded, 2, 2) layoutFileInfo.addItem(QSpacerItem(30, 1, QSizePolicy.Fixed, QSizePolicy.Expanding), 0, 1, 3, 1) layoutFileInfo.setColumnStretch(0, 0) layoutFileInfo.setColumnStretch(1, 0) layoutFileInfo.setColumnStretch(2, 1) frmInfo.setLayout(layoutFileInfo) self.STEPS = enum('Query', 'Download', 'Verify', 'Count') self.dispSteps = ['Getting file information', \ 'Downloading', \ 'Verifying signatures'] self.lblSteps = [] for i in range(self.STEPS.Count): self.lblSteps.append([QRichLabel('', doWrap=False), QRichLabel('')]) layoutSteps = QGridLayout() for i in range(self.STEPS.Count): layoutSteps.addWidget(self.lblSteps[i][0], i, 0) layoutSteps.addWidget(self.lblSteps[i][1], i, 1) frmSteps = QFrame() frmSteps.setLayout(layoutSteps) frmSteps.setFrameStyle(STYLE_SUNKEN) self.dlInstallStatus = self.STEPS.Query self.updateProgressLabels() lblExtraMsg = QRichLabel(msg) btnCancel = QPushButton("Cancel") self.connect(btnCancel, SIGNAL(CLICKED), self.reject) frmCancel = makeHorizFrame([STRETCH, btnCancel, STRETCH]) frm = makeVertFrame([frmDescr, \ frmInfo, \ self.barWorking, \ frmSteps, \ lblExtraMsg, \ frmCancel]) layout = QVBoxLayout() layout.addWidget(frm) self.setLayout(layout) self.setMinimumWidth(400) def startBackgroundDownload(dlg): thr = PyBackgroundThread(dlg.startDL) thr.start() #print 'Starting download in 1s...' from twisted.internet import reactor reactor.callLater(1, startBackgroundDownload, self) self.main.extraHeartbeatSpecial.append(self.checkDownloadProgress) self.setWindowTitle('Downloading File...') def reject(self): self.StopDownloadFlag = True self.dlFileData = '' super(DlgDownloadFile, self).reject() def accept(self): self.StopDownloadFlag = True super(DlgDownloadFile, self).accept() def startDL(self): self.dlInstallStatus = self.STEPS.Query keepTrying = True nTries = 0 self.httpObj = None while keepTrying: nTries += 1 try: import urllib2 self.httpObj = urllib2.urlopen(self.dlFullPath, timeout=10) break except urllib2.HTTPError: LOGERROR('urllib2 failed to urlopen the download link') LOGERROR('Link: %s', self.dlFullPath) break except socket.timeout: LOGERROR('timed out once') if nTries > 2: keepTrying = False except: LOGEXCEPT('Error while trying to urlopen the download link') break if self.httpObj == None: self.StopDownloadFlag = True return self.dlFileSize = 0 for line in self.httpObj.info().headers: if line.startswith('Content-Length'): try: self.dlFileSize = int(line.split()[-1]) except: raise LOGINFO('Starting download') self.dlInstallStatus = self.STEPS.Download bufSize = 32768 bufferData = 1 while bufferData: if self.StopDownloadFlag: return bufferData = self.httpObj.read(bufSize) self.dlFileData += bufferData self.dlDownBytes += bufSize self.dlInstallStatus = self.STEPS.Verify hexHash = binary_to_hex(sha256(self.dlFileData)) LOGINFO('Hash of downloaded file: ') LOGINFO(hexHash) if self.dlExpectHash: if not self.dlExpectHash == hexHash: LOGERROR('Downloaded file does not authenticate!') LOGERROR('Aborting download') self.dlFileData = '' self.dlVerifyFailed = True else: LOGINFO('Downloaded file is cryptographically verified!') self.dlVerifyFailed = False self.dlInstallStatus = self.STEPS.Count # one past end def checkDownloadProgress(self): if self.StopDownloadFlag: from twisted.internet import reactor reactor.callLater(1, self.reject) return -1 if self.dlFileSize == 0: return 0.1 self.updateProgressLabels() try: if self.dlInstallStatus >= self.STEPS.Download: self.barWorking.setVisible(True) trueRatio = float(self.dlDownBytes) / float(self.dlFileSize) dispRatio = min(trueRatio, 1) if self.dlFileSize > 0: self.barWorking.setValue(100 * dispRatio) self.barWorking.setFormat('%p%') dlSizeHuman = bytesToHumanSize(self.dlDownBytes) totalSizeHuman = bytesToHumanSize(self.dlFileSize) self.lblDownloaded.setText('%s of %s' % (dlSizeHuman, totalSizeHuman)) if self.dlInstallStatus > self.STEPS.Verify: from twisted.internet import reactor reactor.callLater(2, self.accept) return -1 else: return 0.1 except: LOGEXCEPT("Failed to check download progress") return -1 def updateProgressLabels(self): # Highlight the correct labels and show checkmarks for i in range(self.STEPS.Count): if i == self.dlInstallStatus: self.lblSteps[i][0].setText(self.dispSteps[i], bold=True, color='Foreground') self.lblSteps[i][1].setText('...', bold=True) elif i < self.dlInstallStatus: self.lblSteps[i][0].setText(self.dispSteps[i], color='Foreground') self.lblSteps[i][1].setPixmap(QPixmap(':/checkmark32.png').scaled(20, 20)) else: self.lblSteps[i][0].setText(self.dispSteps[i], \ bold=False, color='DisableFG') if self.dlInstallStatus >= self.STEPS.Verify: self.barWorking.setValue(100) if self.dlVerifyFailed: self.lblSteps[self.STEPS.Verify][1].setPixmap(QPixmap(':/MsgBox_error32.png').scaled(20, 20)) ################################################################################ class QRadioButtonBackupCtr(QRadioButton): def __init__(self, parent, txt, index): super(QRadioButtonBackupCtr, self).__init__(txt) self.parent = parent self.index = index def enterEvent(self, ev): pass # self.parent.setDispFrame(self.index) # self.setStyleSheet('QRadioButton { background-color : %s }' % \ # htmlColor('SlightBkgdDark')) def leaveEvent(self, ev): pass # self.parent.setDispFrame(-1) # self.setStyleSheet('QRadioButton { background-color : %s }' % \ # htmlColor('Background')) ################################################################################ class DlgBackupCenter(ArmoryDialog): ############################################################################# def __init__(self, parent, main, wlt): super(DlgBackupCenter, self).__init__(parent, main) self.wlt = wlt wltID = wlt.uniqueIDB58 wltName = wlt.labelName self.walletBackupFrame = WalletBackupFrame(parent, main) self.walletBackupFrame.setWallet(wlt) self.btnDone = QPushButton('Done') self.connect(self.btnDone, SIGNAL(CLICKED), self.reject) frmBottomBtns = makeHorizFrame([STRETCH, self.btnDone]) layoutDialog = QVBoxLayout() layoutDialog.addWidget(self.walletBackupFrame) layoutDialog.addWidget(frmBottomBtns) self.setLayout(layoutDialog) self.setWindowTitle("Backup Center") self.setMinimumSize(640, 350) ################################################################################ class DlgSimpleBackup(ArmoryDialog): def __init__(self, parent, main, wlt): super(DlgSimpleBackup, self).__init__(parent, main) self.wlt = wlt lblDescrTitle = QRichLabel(tr(""" Protect Your Bitcoins -- Make a Wallet Backup!""")) lblDescr = QRichLabel(tr(""" A failed hard-drive or forgotten passphrase will lead to permanent loss of bitcoins! Luckily, Armory wallets only need to be backed up one time, and protect you in both of these events. If you've ever forgotten a password or had a hardware failure, make a backup! """)) # ## Paper lblPaper = QRichLabel(tr(""" Use a printer or pen-and-paper to write down your wallet "seed." """)) btnPaper = QPushButton(tr('Make Paper Backup')) # ## Digital lblDigital = QRichLabel(tr(""" Create an unencrypted copy of your wallet file, including imported addresses.""")) btnDigital = QPushButton(tr('Make Digital Backup')) # ## Other lblOther = QRichLabel(tr(""" """)) btnOther = QPushButton(tr('See Other Backup Options')) def backupDigital(): if self.main.digitalBackupWarning(): self.main.makeWalletCopy(self, self.wlt, 'Decrypt', 'decrypt') self.accept() def backupPaper(): OpenPaperBackupWindow('Single', self, self.main, self.wlt) self.accept() def backupOther(): self.accept() DlgBackupCenter(self, self.main, self.wlt).exec_() self.connect(btnPaper, SIGNAL(CLICKED), backupPaper) self.connect(btnDigital, SIGNAL(CLICKED), backupDigital) self.connect(btnOther, SIGNAL(CLICKED), backupOther) layout = QGridLayout() layout.addWidget(lblPaper, 0, 0) layout.addWidget(btnPaper, 0, 2) layout.addWidget(HLINE(), 1, 0, 1, 3) layout.addWidget(lblDigital, 2, 0) layout.addWidget(btnDigital, 2, 2) layout.addWidget(HLINE(), 3, 0, 1, 3) layout.addWidget(makeHorizFrame([STRETCH, btnOther, STRETCH]), 4, 0, 1, 3) # layout.addWidget( VLINE(), 0,1, 5,1) layout.setContentsMargins(10, 5, 10, 5) setLayoutStretchRows(layout, 1, 0, 1, 0, 0) setLayoutStretchCols(layout, 1, 0, 0) frmGrid = QFrame() frmGrid.setFrameStyle(STYLE_PLAIN) frmGrid.setLayout(layout) btnClose = QPushButton('Done') self.connect(btnClose, SIGNAL(CLICKED), self.accept) frmClose = makeHorizFrame([STRETCH, btnClose]) frmAll = makeVertFrame([lblDescrTitle, lblDescr, frmGrid, frmClose]) layoutAll = QVBoxLayout() layoutAll.addWidget(frmAll) self.setLayout(layoutAll) self.sizeHint = lambda: QSize(400, 250) self.setWindowTitle(tr('Backup Options')) ################################################################################ # Class that acts as a center where the user can decide what to do with the # watch-only wallet. The data can be displayed, printed, or saved to a file as a # wallet or as the watch-only data (i.e., root key & chain code). class DlgExpWOWltData(ArmoryDialog): """ This dialog will be used to export a wallet's root public key and chain code. """ def __init__(self, wlt, parent, main): super(DlgExpWOWltData, self).__init__(parent, main) # Save a copy of the wallet. self.wlt = wlt self.main = main # Get the chain code and uncompressed public key of info from the wallet, # along with other useful info. wltRootIDConcat, pkccET16Lines = wlt.getRootPKCCBackupData(True) wltIDB58 = wlt.uniqueIDB58 # Create the data export buttons. expWltButton = QPushButton(tr('Export Watching-Only Wallet File')) clipboardBtn = QPushButton(tr('Copy to clipboard')) clipboardLbl = QRichLabel(tr(''), hAlign=Qt.AlignHCenter) expDataButton = QPushButton(tr('Save to Text File')) printWODataButton = QPushButton(tr('Print Root Data')) self.connect(expWltButton, SIGNAL(CLICKED), self.clickedExpWlt) self.connect(expDataButton, SIGNAL(CLICKED), self.clickedExpData) self.connect(printWODataButton, SIGNAL(CLICKED), \ self.clickedPrintWOData) # Let's put the window together. layout = QVBoxLayout() self.dispText = tr(""" Watch-Only Root ID:
%s

Watch-Only Root Data:""") % tr(wltRootIDConcat) for j in pkccET16Lines: self.dispText += '
%s' % tr(j) titleStr = tr('Watch-Only Wallet Export') self.txtLongDescr = QTextBrowser() self.txtLongDescr.setFont(GETFONT('Fixed', 9)) self.txtLongDescr.setHtml(self.dispText) w,h = tightSizeNChar(self.txtLongDescr, 20) self.txtLongDescr.setMaximumHeight(9.5*h) def clippy(): clipb = QApplication.clipboard() clipb.clear() clipb.setText(str(self.txtLongDescr.toPlainText())) clipboardLbl.setText(tr('Copied!')) self.connect(clipboardBtn, SIGNAL('clicked()'), clippy) lblDescr = QRichLabel(tr("""
Export Watch-Only Wallet: %s

Use a watching-only wallet on an online computer to distribute payment addresses, verify transactions and monitor balances, but without the ability to move the funds.""") % \ (htmlColor('TextBlue'), wlt.uniqueIDB58)) lblTopHalf = QRichLabel(tr("""
Entire Wallet File

(Recommended) An exact copy of your wallet file but without any of the private signing keys. All existing comments and labels will be carried with the file. Use this option if it is easy to transfer files from this system to the target system.""") % \ (htmlColor('TextBlue'))) lblBotHalf = QRichLabel(tr("""
Only Root Data

Same as above, but only five lines of text that are easy to print, email inline, or copy by hand. Only produces the wallet addresses. No comments or labels are carried with it.""")) btnDone = QPushButton(tr('Done')) self.connect(btnDone, SIGNAL('clicked()'), self.accept) frmButtons = makeVertFrame([clipboardBtn, expDataButton, printWODataButton, clipboardLbl, 'Stretch']) layoutBottom = QHBoxLayout() layoutBottom.addWidget(frmButtons, 0) layoutBottom.addItem(QSpacerItem(5,5)) layoutBottom.addWidget(self.txtLongDescr, 1) layoutBottom.setSpacing(5) layout.addWidget(lblDescr) layout.addItem(QSpacerItem(10, 10)) layout.addWidget(HLINE()) layout.addWidget(lblTopHalf, 1) layout.addWidget(makeHorizFrame(['Stretch', expWltButton, 'Stretch'])) layout.addItem(QSpacerItem(20, 20)) layout.addWidget(HLINE()) layout.addWidget(lblBotHalf, 1) layout.addLayout(layoutBottom) layout.addItem(QSpacerItem(20, 20)) layout.addWidget(HLINE()) layout.addWidget(makeHorizFrame(['Stretch', btnDone])) layout.setSpacing(3) self.setLayout(layout) self.setMinimumWidth(600) # TODO: Dear god this is terrible, but for my life I cannot figure # out how to move the vbar, because you can't do it until # the dialog is drawn which doesn't happen til after __init__. from twisted.internet import reactor reactor.callLater(0.05, self.resizeEvent) self.setWindowTitle(titleStr) def resizeEvent(self, ev=None): super(DlgExpWOWltData, self).resizeEvent(ev) vbar = self.txtLongDescr.verticalScrollBar() vbar.setValue(vbar.minimum()) # The function that is executed when the user wants to back up the full # watch-only wallet to a file. def clickedExpWlt(self): currPath = self.wlt.walletPath pieces = os.path.splitext(currPath) currPath = pieces[0] + '.watchonly' + pieces[1] saveLoc = self.main.getFileSave('Save Watching-Only Copy', \ defaultFilename=currPath) if not saveLoc.endswith('.wallet'): saveLoc += '.wallet' self.wlt.forkOnlineWallet(saveLoc, self.wlt.labelName, \ '(Watching-Only) ' + self.wlt.labelDescr) # The function that is executed when the user wants to save the watch-only # data to a file. def clickedExpData(self): self.main.makeWalletCopy(self, self.wlt, 'PKCC', 'rootpubkey') # The function that is executed when the user wants to print the watch-only # data. def clickedPrintWOData(self): self.result = DlgWODataPrintBackup(self, self.main, self.wlt).exec_() ################################################################################ # Class that handles the printing of the watch-only wallet data. The formatting # is mostly the same as a normal paper backup. Note that neither fragmented # backups nor SecurePrint are used. class DlgWODataPrintBackup(ArmoryDialog): """ Open up a "Make Paper Backup" dialog, so the user can print out a hard copy of whatever data they need to recover their wallet should they lose it. """ def __init__(self, parent, main, wlt): super(DlgWODataPrintBackup, self).__init__(parent, main) self.wlt = wlt # Create the scene and the view. self.scene = SimplePrintableGraphicsScene(self, self.main) self.view = QGraphicsView() self.view.setRenderHint(QPainter.TextAntialiasing) self.view.setScene(self.scene.getScene()) # Label displayed above the sheet to be printed. lblDescr = QRichLabel(tr(""" Print Watch-Only Wallet Root

The lines below are sufficient to calculate public keys for every private key ever produced by the full wallet. Importing this data to an online computer is sufficient to receive and verify transactions, and monitor balances, but without the ability to spend the funds.""")) lblDescr.setContentsMargins(5, 5, 5, 5) frmDescr = makeHorizFrame([lblDescr], STYLE_RAISED) # Buttons shown below the sheet to be printed. self.btnPrint = QPushButton('&Print...') self.btnPrint.setMinimumWidth(3 * tightSizeStr(self.btnPrint, 'Print...')[0]) self.btnCancel = QPushButton('&Cancel') self.connect(self.btnPrint, SIGNAL(CLICKED), self.print_) self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) frmButtons = makeHorizFrame([self.btnCancel, STRETCH, self.btnPrint]) # Draw the sheet for the first time. self.redrawBackup() # Lay out the dialog. layout = QVBoxLayout() layout.addWidget(frmDescr) layout.addWidget(self.view) layout.addWidget(frmButtons) setLayoutStretch(layout, 0, 1, 0) self.setLayout(layout) self.setWindowIcon(QIcon(':/printer_icon.png')) self.setWindowTitle('Print Watch-Only Root') # Apparently I can't programmatically scroll until after it's painted def scrollTop(): vbar = self.view.verticalScrollBar() vbar.setValue(vbar.minimum()) from twisted.internet import reactor reactor.callLater(0.01, scrollTop) # Class called to redraw the print "canvas" when the data changes. def redrawBackup(self): self.createPrintScene() self.view.update() # Class that handles the actual printing code. def print_(self): LOGINFO('Printing!') self.printer = QPrinter(QPrinter.HighResolution) self.printer.setPageSize(QPrinter.Letter) if QPrintDialog(self.printer).exec_(): painter = QPainter(self.printer) painter.setRenderHint(QPainter.TextAntialiasing) self.createPrintScene() self.scene.getScene().render(painter) painter.end() self.accept() # Class that lays out the actual print "canvas" to be printed. def createPrintScene(self): # Do initial setup. self.scene.gfxScene.clear() self.scene.resetCursor() # Draw the background paper? pr = self.scene.pageRect() self.scene.drawRect(pr.width(), pr.height(), edgeColor=None, \ fillColor=QColor(255, 255, 255)) self.scene.resetCursor() INCH = self.scene.INCH MARGIN = self.scene.MARGIN_PIXELS wrap = 0.9 * self.scene.pageRect().width() # Start drawing the page. if USE_TESTNET: self.scene.drawPixmapFile(':/armory_logo_green_h56.png') else: self.scene.drawPixmapFile(':/armory_logo_h36.png') self.scene.newLine() warnMsg = tr(""" WARNING: This is not a wallet backup!

Please make a regular digital or paper backup of your wallet of your wallet to keep it protected! This data simply lets you monitor the funds in this wallet but gives you no ability to move any funds.""") self.scene.drawText(warnMsg, GETFONT('Var', 9), wrapWidth=wrap) self.scene.newLine(extra_dy=20) self.scene.drawHLine() self.scene.newLine(extra_dy=20) # Print the wallet info. colRect, rowHgt = self.scene.drawColumn(['Watch-Only Root Data', 'Wallet ID:', 'Wallet Name:']) self.scene.moveCursor(15, 0) colRect, rowHgt = self.scene.drawColumn([tr(''), self.wlt.uniqueIDB58, self.wlt.labelName]) self.scene.moveCursor(15, colRect.y() + colRect.height(), absolute=True) # Display warning about unprotected key data. self.scene.newLine(extra_dy=20) self.scene.drawHLine() self.scene.newLine(extra_dy=20) # Draw the description of the data. descrMsg = tr(""" The following five lines are sufficient to reproduce all public keys matching the private keys produced by the full wallet.""") self.scene.drawText(descrMsg, GETFONT('var', 8), wrapWidth=wrap) self.scene.newLine(extra_dy=10) # Prepare the data. self.wltRootIDConcat, self.pkccET16Lines = \ self.wlt.getRootPKCCBackupData(True) Lines = [] Prefix = [] Prefix.append('Watch-Only Root ID:'); Lines.append(self.wltRootIDConcat) Prefix.append('Watch-Only Root:'); Lines.append(self.pkccET16Lines[0]) Prefix.append(''); Lines.append(self.pkccET16Lines[1]) Prefix.append(''); Lines.append(self.pkccET16Lines[2]) Prefix.append(''); Lines.append(self.pkccET16Lines[3]) # Draw the prefix data. origX, origY = self.scene.getCursorXY() self.scene.moveCursor(10, 0) colRect, rowHgt = self.scene.drawColumn(['' + l + '' \ for l in Prefix]) # Draw the data. nudgeDown = 2 # because the differing font size makes it look unaligned self.scene.moveCursor(10, nudgeDown) self.scene.drawColumn(Lines, font=GETFONT('Fixed', 8, bold=True), \ rowHeight=rowHgt, useHtml=False) # Draw the rectangle around the data. self.scene.moveCursor(MARGIN, colRect.y() - 2, absolute=True) width = self.scene.pageRect().width() - 2 * MARGIN self.scene.drawRect(width, colRect.height() + 7, \ edgeColor=QColor(0, 0, 0), fillColor=None) # Draw the QR-related text below the data. self.scene.newLine(extra_dy=30) self.scene.drawText(tr(""" The following QR code is for convenience only. It contains the exact same data as the five lines above. If you copy this data by hand, you can safely ignore this QR code. """), wrapWidth=4 * INCH) # Draw the QR code. self.scene.moveCursor(20, 0) x, y = self.scene.getCursorXY() edgeRgt = self.scene.pageRect().width() - MARGIN edgeBot = self.scene.pageRect().height() - MARGIN qrSize = max(1.5 * INCH, min(edgeRgt - x, edgeBot - y, 2.0 * INCH)) self.scene.drawQR('\n'.join(Lines), qrSize) self.scene.newLine(extra_dy=25) # Clear the data and create a vertical scroll bar. Lines = None vbar = self.view.verticalScrollBar() vbar.setValue(vbar.minimum()) self.view.update() ################################################################################ class DlgFragBackup(ArmoryDialog): ############################################################################# def __init__(self, parent, main, wlt): super(DlgFragBackup, self).__init__(parent, main) self.wlt = wlt self.randpass = None self.binCrypt32 = None lblDescrTitle = QRichLabel(tr(""" Create M-of-N Fragmented Backup of "%s" (%s)""") % \ (wlt.labelName, wlt.uniqueIDB58), doWrap=False) lblDescrTitle.setContentsMargins(5, 5, 5, 5) self.lblAboveFrags = QRichLabel('') self.lblAboveFrags.setContentsMargins(10, 0, 10, 0) frmDescr = makeVertFrame([lblDescrTitle, self.lblAboveFrags], \ STYLE_RAISED) self.maxM = 5 if not self.main.usermode == USERMODE.Expert else 8 self.maxN = 6 if not self.main.usermode == USERMODE.Expert else 12 self.currMinN = 2 self.maxmaxN = 12 self.comboM = QComboBox() self.comboN = QComboBox() for M in range(2, self.maxM + 1): self.comboM.addItem(str(M)) for N in range(self.currMinN, self.maxN + 1): self.comboN.addItem(str(N)) self.comboM.setCurrentIndex(1) self.comboN.setCurrentIndex(2) def updateM(): self.updateComboN() self.createFragDisplay() updateN = self.createFragDisplay self.connect(self.comboM, SIGNAL('activated(int)'), updateM) self.connect(self.comboN, SIGNAL('activated(int)'), updateN) self.comboM.setMinimumWidth(30) self.comboN.setMinimumWidth(30) btnAccept = QPushButton(tr('Close')) self.connect(btnAccept, SIGNAL(CLICKED), self.accept) frmBottomBtn = makeHorizFrame([STRETCH, btnAccept]) # We will hold all fragments here, in SBD objects. Destroy all of them # before the dialog exits self.secureRoot = self.wlt.addrMap['ROOT'].binPrivKey32_Plain.copy() self.secureChain = self.wlt.addrMap['ROOT'].chaincode.copy() self.secureMtrx = [] testChain = DeriveChaincodeFromRootKey(self.secureRoot) if testChain == self.secureChain: self.noNeedChaincode = True self.securePrint = self.secureRoot else: self.securePrint = self.secureRoot + self.secureChain self.chkSecurePrint = QCheckBox(tr(""" Use SecurePrint\xe2\x84\xa2 to prevent exposing keys to printer or other devices""")) self.scrollArea = QScrollArea() self.createFragDisplay() self.scrollArea.setWidgetResizable(True) self.ttipSecurePrint = self.main.createToolTipWidget(tr(""" SecurePrint\xe2\x84\xa2 encrypts your backup with a code displayed on the screen, so that no other devices or processes has access to the unencrypted private keys (either network devices when printing, or other applications if you save a fragment to disk or USB device). You must keep the SecurePrint\xe2\x84\xa2 code with the backup!""")) self.lblSecurePrint = QRichLabel(tr(""" IMPORTANT: You must keep the SecurePrint\xe2\x84\xa2 encryption code with your backup! Your SecurePrint\xe2\x84\xa2 code is %s. All fragments for a given wallet use the same code.""") % \ (htmlColor('TextWarn'), htmlColor('TextBlue'), self.randpass.toBinStr(), \ htmlColor('TextWarn'))) self.connect(self.chkSecurePrint, SIGNAL(CLICKED), self.clickChkSP) self.chkSecurePrint.setChecked(False) self.lblSecurePrint.setVisible(False) frmChkSP = makeHorizFrame([self.chkSecurePrint, self.ttipSecurePrint, STRETCH]) dlgLayout = QVBoxLayout() dlgLayout.addWidget(frmDescr) dlgLayout.addWidget(self.scrollArea) dlgLayout.addWidget(frmChkSP) dlgLayout.addWidget(self.lblSecurePrint) dlgLayout.addWidget(frmBottomBtn) setLayoutStretch(dlgLayout, 0, 1, 0, 0, 0) self.setLayout(dlgLayout) self.setMinimumWidth(650) self.setMinimumHeight(450) self.setWindowTitle('Create Backup Fragments') ############################################################################# def clickChkSP(self): self.lblSecurePrint.setVisible(self.chkSecurePrint.isChecked()) self.createFragDisplay() ############################################################################# def updateComboN(self): M = int(str(self.comboM.currentText())) oldN = int(str(self.comboN.currentText())) self.currMinN = M self.comboN.clear() for i, N in enumerate(range(self.currMinN, self.maxN + 1)): self.comboN.addItem(str(N)) if M > oldN: self.comboN.setCurrentIndex(0) else: for i, N in enumerate(range(self.currMinN, self.maxN + 1)): if N == oldN: self.comboN.setCurrentIndex(i) ############################################################################# def createFragDisplay(self): self.recomputeFragData() M = int(str(self.comboM.currentText())) N = int(str(self.comboN.currentText())) lblAboveM = QRichLabel(tr('Required Fragments '), hAlign=Qt.AlignHCenter, doWrap=False) lblAboveN = QRichLabel(tr('Total Fragments '), hAlign=Qt.AlignHCenter) frmComboM = makeHorizFrame([STRETCH, QLabel('M:'), self.comboM, STRETCH]) frmComboN = makeHorizFrame([STRETCH, QLabel('N:'), self.comboN, STRETCH]) btnPrintAll = QPushButton('Print All Fragments') self.connect(btnPrintAll, SIGNAL(CLICKED), self.clickPrintAll) leftFrame = makeVertFrame([STRETCH, \ lblAboveM, \ frmComboM, \ lblAboveN, \ frmComboN, \ STRETCH, \ HLINE(), \ btnPrintAll, \ STRETCH], STYLE_STYLED) layout = QHBoxLayout() layout.addWidget(leftFrame) for f in range(N): layout.addWidget(self.createFragFrm(f)) frmScroll = QFrame() frmScroll.setFrameStyle(STYLE_SUNKEN) frmScroll.setStyleSheet('QFrame { background-color : %s }' % \ htmlColor('SlightBkgdDark')) frmScroll.setLayout(layout) self.scrollArea.setWidget(frmScroll) BLUE = htmlColor('TextBlue') self.lblAboveFrags.setText(tr(""" Any %d of these %d fragments are sufficient to restore your wallet, and each fragment has the ID, %s. All fragments with the same fragment ID are compatible with each other! Click here to read more about our backup system.
""") % \ (BLUE, M, BLUE, N, BLUE, self.fragPrefixStr)) ############################################################################# def createFragFrm(self, idx): doMask = self.chkSecurePrint.isChecked() M = int(str(self.comboM.currentText())) N = int(str(self.comboN.currentText())) lblFragID = QRichLabel('Fragment ID:
%s-%d' % \ (self.fragPrefixStr, idx + 1)) # lblWltID = QRichLabel('(%s)' % self.wlt.uniqueIDB58) lblFragPix = QImageLabel(self.fragPixmapFn, size=(72, 72)) if doMask: ys = self.secureMtrxCrypt[idx][1].toBinStr()[:42] else: ys = self.secureMtrx[idx][1].toBinStr()[:42] easyYs1 = makeSixteenBytesEasy(ys[:16 ]) easyYs2 = makeSixteenBytesEasy(ys[ 16:32]) binID = self.wlt.uniqueIDBin ID = ComputeFragIDLineHex(M, idx, binID, doMask, addSpaces=True) fragPreview = 'ID: %s...
' % ID[:12] fragPreview += 'F1: %s...
' % easyYs1[:12] fragPreview += 'F2: %s... ' % easyYs2[:12] lblPreview = QRichLabel(fragPreview) lblPreview.setFont(GETFONT('Fixed', 9)) lblFragIdx = QRichLabel('#%d' % (idx + 1), size=4, color='TextBlue', \ hAlign=Qt.AlignHCenter) frmTopLeft = makeVertFrame([lblFragID, lblFragIdx, STRETCH]) frmTopRight = makeVertFrame([lblFragPix, STRETCH]) frmPaper = makeVertFrame([lblPreview]) frmPaper.setStyleSheet('QFrame { background-color : #ffffff }') fnPrint = lambda: self.clickPrintFrag(idx) fnSave = lambda: self.clickSaveFrag(idx) btnPrintFrag = QPushButton('View/Print') btnSaveFrag = QPushButton('Save to File') self.connect(btnPrintFrag, SIGNAL(CLICKED), fnPrint) self.connect(btnSaveFrag, SIGNAL(CLICKED), fnSave) frmButtons = makeHorizFrame([btnPrintFrag, btnSaveFrag]) layout = QGridLayout() layout.addWidget(frmTopLeft, 0, 0, 1, 1) layout.addWidget(frmTopRight, 0, 1, 1, 1) layout.addWidget(frmPaper, 1, 0, 1, 2) layout.addWidget(frmButtons, 2, 0, 1, 2) layout.setSizeConstraint(QLayout.SetFixedSize) outFrame = QFrame() outFrame.setFrameStyle(STYLE_STYLED) outFrame.setLayout(layout) return outFrame ############################################################################# def clickPrintAll(self): self.clickPrintFrag(range(int(str(self.comboN.currentText())))) ############################################################################# def clickPrintFrag(self, zindex): if not isinstance(zindex, (list, tuple)): zindex = [zindex] fragData = {} fragData['M'] = int(str(self.comboM.currentText())) fragData['N'] = int(str(self.comboN.currentText())) fragData['FragIDStr'] = self.fragPrefixStr fragData['FragPixmap'] = self.fragPixmapFn fragData['Range'] = zindex fragData['Secure'] = self.chkSecurePrint.isChecked() dlg = DlgPrintBackup(self, self.main, self.wlt, 'Fragments', \ self.secureMtrx, self.secureMtrxCrypt, fragData, \ self.secureRoot, self.secureChain) dlg.exec_() ############################################################################# def clickSaveFrag(self, zindex): saveMtrx = self.secureMtrx; doMask = False if self.chkSecurePrint.isChecked(): response = QMessageBox.question(self, 'Secure Backup?', tr(""" You have selected to use SecurePrint\xe2\x84\xa2 for the printed backups, which can also be applied to fragments saved to file. Doing so will require you store the SecurePrint\xe2\x84\xa2 code with the backup, but it will prevent unencrypted key data from touching any disks.

Do you want to encrypt the fragment file with the same SecurePrint\xe2\x84\xa2 code?"""), \ QMessageBox.Yes | QMessageBox.No | QMessageBox.Cancel) if response == QMessageBox.Yes: saveMtrx = self.secureMtrxCrypt; doMask = True elif response == QMessageBox.No: pass else: return wid = self.wlt.uniqueIDB58 pref = self.fragPrefixStr fnum = zindex + 1 M = self.M sec = 'secure.' if doMask else '' defaultFn = 'wallet_%s_%s_num%d_need%d.%sfrag' % (wid, pref, fnum, M, sec) #print 'FragFN:', defaultFn savepath = self.main.getFileSave(tr('Save Fragment'), \ [tr('Wallet Fragments (*.frag)')], \ defaultFn) if len(toUnicode(savepath)) == 0: return fout = open(savepath, 'w') fout.write('Wallet ID: %s\n' % wid) fout.write('Create Date: %s\n' % unixTimeToFormatStr(RightNow())) fout.write('Fragment ID: %s-#%d\n' % (pref, fnum)) fout.write('Frag Needed: %d\n' % M) fout.write('\n\n') try: yBin = saveMtrx[zindex][1].toBinStr() binID = self.wlt.uniqueIDBin IDLine = ComputeFragIDLineHex(M, zindex, binID, doMask, addSpaces=True) if len(yBin) == 32: fout.write('ID: ' + IDLine + '\n') fout.write('F1: ' + makeSixteenBytesEasy(yBin[:16 ]) + '\n') fout.write('F2: ' + makeSixteenBytesEasy(yBin[ 16:]) + '\n') elif len(yBin) == 64: fout.write('ID: ' + IDLine + '\n') fout.write('F1: ' + makeSixteenBytesEasy(yBin[:16 ]) + '\n') fout.write('F2: ' + makeSixteenBytesEasy(yBin[ 16:32 ]) + '\n') fout.write('F3: ' + makeSixteenBytesEasy(yBin[ 32:48 ]) + '\n') fout.write('F4: ' + makeSixteenBytesEasy(yBin[ 48:]) + '\n') else: LOGERROR('yBin is not 32 or 64 bytes! It is %s bytes', len(yBin)) finally: yBin = None fout.close() qmsg = tr(""" The fragment was successfully saved to the following location:

%s

""") % savepath if doMask: qmsg += tr(""" Important: The fragment was encrypted with the SecurePrint\xe2\x84\xa2 encryption code. You must keep this code with the backup in order to use it! The code is case-sensitive!

%s

The above code is case-sensitive!""") % \ (htmlColor('TextWarn'), htmlColor('TextBlue'), self.randpass.toBinStr()) QMessageBox.information(self, 'Success', qmsg, QMessageBox.Ok) ############################################################################# def destroyFrags(self): if len(self.secureMtrx) == 0: return if isinstance(self.secureMtrx[0], (list, tuple)): for sbdList in self.secureMtrx: for sbd in sbdList: sbd.destroy() for sbdList in self.secureMtrxCrypt: for sbd in sbdList: sbd.destroy() else: for sbd in self.secureMtrx: sbd.destroy() for sbd in self.secureMtrxCrypt: sbd.destroy() self.secureMtrx = [] self.secureMtrxCrypt = [] ############################################################################# def destroyEverything(self): self.secureRoot.destroy() self.secureChain.destroy() self.securePrint.destroy() self.destroyFrags() ############################################################################# def recomputeFragData(self): """ Only M is needed, since N doesn't change """ M = int(str(self.comboM.currentText())) N = int(str(self.comboN.currentText())) # Make sure only local variables contain non-SBD data self.destroyFrags() insecureData = SplitSecret(self.securePrint, M, self.maxmaxN) for x, y in insecureData: self.secureMtrx.append([SecureBinaryData(x), SecureBinaryData(y)]) insecureData, x, y = None, None, None ##### # Now we compute the SecurePrint(TM) versions of the fragments SECPRINT = HardcodedKeyMaskParams() MASK = lambda x: SECPRINT['FUNC_MASK'](x, ekey=self.binCrypt32) if not self.randpass or not self.binCrypt32: self.randpass = SECPRINT['FUNC_PWD'](self.secureRoot + self.secureChain) self.binCrypt32 = SECPRINT['FUNC_KDF'](self.randpass) self.secureMtrxCrypt = [] for sbdX, sbdY in self.secureMtrx: self.secureMtrxCrypt.append([sbdX.copy(), MASK(sbdY)]) ##### self.M, self.N = M, N self.fragPrefixStr = ComputeFragIDBase58(self.M, self.wlt.uniqueIDBin) self.fragPixmapFn = ':/frag%df.png' % M ############################################################################# def accept(self): self.destroyEverything() super(DlgFragBackup, self).accept() ############################################################################# def reject(self): self.destroyEverything() super(DlgFragBackup, self).reject() ################################################################################ class DlgUniversalRestoreSelect(ArmoryDialog): ############################################################################# def __init__(self, parent, main): super(DlgUniversalRestoreSelect, self).__init__(parent, main) lblDescrTitle = QRichLabel(tr(""" Restore Wallet from Backup""")) lblDescr = QRichLabel(tr("""You can restore any kind of backup ever created by Armory using one of the options below. If you have a list of private keys you should open the target wallet and select "Import/Sweep Private Keys." """)) lblRestore = QRichLabel(tr("""I am restoring a...""")) self.rdoSingle = QRadioButton(tr('Single-Sheet Backup (printed)')) self.rdoFragged = QRadioButton(tr('Fragmented Backup (incl. mix of paper and files)')) self.rdoDigital = QRadioButton(tr('Import digital backup or watching-only wallet')) self.rdoWOData = QRadioButton(tr('Import watching-only wallet data')) self.chkTest = QCheckBox(tr('This is a test recovery to make sure my backup works')) btngrp = QButtonGroup(self) btngrp.addButton(self.rdoSingle) btngrp.addButton(self.rdoFragged) btngrp.addButton(self.rdoDigital) btngrp.addButton(self.rdoWOData) btngrp.setExclusive(True) self.rdoSingle.setChecked(True) self.connect(self.rdoSingle, SIGNAL(CLICKED), self.clickedRadio) self.connect(self.rdoFragged, SIGNAL(CLICKED), self.clickedRadio) self.connect(self.rdoDigital, SIGNAL(CLICKED), self.clickedRadio) self.connect(self.rdoWOData, SIGNAL(CLICKED), self.clickedRadio) self.btnOkay = QPushButton('Continue') self.btnCancel = QPushButton('Cancel') buttonBox = QDialogButtonBox() buttonBox.addButton(self.btnOkay, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) self.connect(self.btnOkay, SIGNAL(CLICKED), self.clickedOkay) self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) layout = QVBoxLayout() layout.addWidget(lblDescrTitle) layout.addWidget(lblDescr) layout.addWidget(HLINE()) layout.addWidget(self.rdoSingle) layout.addWidget(self.rdoFragged) layout.addWidget(self.rdoDigital) layout.addWidget(self.rdoWOData) layout.addWidget(HLINE()) layout.addWidget(self.chkTest) layout.addWidget(buttonBox) self.setLayout(layout) self.setMinimumWidth(450) def clickedRadio(self): if self.rdoDigital.isChecked(): self.chkTest.setChecked(False) self.chkTest.setEnabled(False) else: self.chkTest.setEnabled(True) def clickedOkay(self): # ## Test backup option doTest = self.chkTest.isChecked() if self.rdoSingle.isChecked(): self.accept() dlg = DlgRestoreSingle(self.parent, self.main, doTest) if dlg.exec_(): self.main.addWalletToAppAndAskAboutRescan(dlg.newWallet) LOGINFO('Wallet Restore Complete!') # self.main.startRescanBlockchain() # TheBDM.rescanBlockchain('AsNeeded', wait=False) elif self.rdoFragged.isChecked(): self.accept() dlg = DlgRestoreFragged(self.parent, self.main, doTest) if dlg.exec_(): self.main.addWalletToAppAndAskAboutRescan(dlg.newWallet) LOGINFO('Wallet Restore Complete!') # TheBDM.main.startRescanBlockchain() elif self.rdoDigital.isChecked(): self.main.execGetImportWltName() self.accept() elif self.rdoWOData.isChecked(): # Attempt to restore the root public key & chain code for a wallet. # When done, ask for a wallet rescan. self.accept() dlg = DlgRestoreWOData(self.parent, self.main, doTest) if dlg.exec_(): LOGINFO('Watching-Only Wallet Restore Complete! Will ask for a' \ 'rescan.') self.main.addWalletToAppAndAskAboutRescan(dlg.newWallet) ################################################################################ # Create a special QLineEdit with a masked input # Forces the cursor to start at position 0 whenever there is no input class MaskedInputLineEdit(QLineEdit): def __init__(self, inputMask): super(MaskedInputLineEdit, self).__init__() self.setInputMask(inputMask) fixFont = GETFONT('Fix', 9) self.setFont(fixFont) self.setMinimumWidth(tightSizeStr(fixFont, inputMask)[0] + 10) self.connect(self, SIGNAL('cursorPositionChanged(int,int)'), self.controlCursor) def controlCursor(self, oldpos, newpos): if newpos != 0 and len(str(self.text()).strip()) == 0: self.setCursorPosition(0) ################################################################################ class DlgRestoreSingle(ArmoryDialog): ############################################################################# def __init__(self, parent, main, thisIsATest=False, expectWltID=None): super(DlgRestoreSingle, self).__init__(parent, main) self.thisIsATest = thisIsATest self.testWltID = expectWltID headerStr = '' if thisIsATest: lblDescr = QRichLabel(tr(""" Test a Paper Backup

Use this window to test a single-sheet paper backup. If your backup includes imported keys, those will not be covered by this test. """)) else: lblDescr = QRichLabel(tr(""" Restore a Wallet from Paper Backup

Use this window to restore a single-sheet paper backup. If your backup includes extra pages with imported keys, please restore the base wallet first, then double-click the restored wallet and select "Import Private Keys" from the right-hand menu. """)) lblType = QRichLabel(tr("""Backup Type:"""), doWrap=False) self.version135Button = QRadioButton(tr('Version 1.35 (4 lines)'), self) self.version135aButton = QRadioButton(tr('Version 1.35a (4 lines Unencrypted)'), self) self.version135aSPButton = QRadioButton(tr('Version 1.35a (4 lines + SecurePrint\xe2\x84\xa2)'), self) self.version135cButton = QRadioButton(tr('Version 1.35c (2 lines Unencrypted)'), self) self.version135cSPButton = QRadioButton(tr('Version 1.35c (2 lines + SecurePrint\xe2\x84\xa2)'), self) self.backupTypeButtonGroup = QButtonGroup(self) self.backupTypeButtonGroup.addButton(self.version135Button) self.backupTypeButtonGroup.addButton(self.version135aButton) self.backupTypeButtonGroup.addButton(self.version135aSPButton) self.backupTypeButtonGroup.addButton(self.version135cButton) self.backupTypeButtonGroup.addButton(self.version135cSPButton) self.version135cButton.setChecked(True) self.connect(self.backupTypeButtonGroup, SIGNAL('buttonClicked(int)'), self.changeType) layoutRadio = QVBoxLayout() layoutRadio.addWidget(self.version135Button) layoutRadio.addWidget(self.version135aButton) layoutRadio.addWidget(self.version135aSPButton) layoutRadio.addWidget(self.version135cButton) layoutRadio.addWidget(self.version135cSPButton) layoutRadio.setSpacing(0) radioButtonFrame = QFrame() radioButtonFrame.setLayout(layoutRadio) frmBackupType = makeVertFrame([lblType, radioButtonFrame]) self.lblSP = QRichLabel(tr('SecurePrint\xe2\x84\xa2 Code:'), doWrap=False) self.editSecurePrint = QLineEdit() self.prfxList = [QLabel(tr('Root Key:')), QLabel(''), QLabel(tr('Chaincode:')), QLabel('')] inpMask = '
The error occured on line #%d.""") % lineNumber, \ QMessageBox.Ok) LOGERROR('Error in wallet restore field') self.prfxList[i].setText('' + str(self.prfxList[i].text()) + '') return inputLines.append(rawBin) if self.chkEncrypt.isChecked() and self.advancedOptionsTab.getKdfSec() == -1: QMessageBox.critical(self, 'Invalid Target Compute Time', \ 'You entered Target Compute Time incorrectly.\n\nEnter: (ms, s)', QMessageBox.Ok) return if self.chkEncrypt.isChecked() and self.advancedOptionsTab.getKdfBytes() == -1: QMessageBox.critical(self, 'Invalid Max Memory Usage', \ 'You entered Max Memory Usage incorrectly.\n\nnter: (kb, mb)', QMessageBox.Ok) return if nError > 0: pluralStr = 'error' if nError == 1 else 'errors' QMessageBox.question(self, tr('Errors Corrected'), tr(""" Detected %d @{error|errors}@ in the data you entered. Armory attempted to fix the @{error|errors}@ but it is not always right. Be sure to verify the "Wallet Unique ID" closely on the next window.""", nError, nError), \ QMessageBox.Ok) privKey = SecureBinaryData(''.join(inputLines[:2])) if self.isLongForm: chain = SecureBinaryData(''.join(inputLines[2:])) if self.doMask: # Prepare the key mask parameters SECPRINT = HardcodedKeyMaskParams() pwd = str(self.editSecurePrint.text()).strip() if len(pwd) < 9: QMessageBox.critical(self, 'Invalid Code', tr(""" You didn't enter a full SecurePrint\xe2\x84\xa2 code. This code is needed to decrypt your backup. If this backup is actually unencrypted and there is no code, then choose the appropriate backup type from the drop-down box"""), QMessageBox.Ok) return if not SECPRINT['FUNC_CHKPWD'](pwd): QMessageBox.critical(self, 'Bad Encryption Code', tr(""" The SecurePrint\xe2\x84\xa2 code you entered has an error in it. Note that the code is case-sensitive. Please verify you entered it correctly and try again."""), QMessageBox.Ok) return maskKey = SECPRINT['FUNC_KDF'](pwd) privKey = SECPRINT['FUNC_UNMASK'](privKey, ekey=maskKey) if self.isLongForm: chain = SECPRINT['FUNC_UNMASK'](chain, ekey=maskKey) if not self.isLongForm: chain = DeriveChaincodeFromRootKey(privKey) # If we got here, the data is valid, let's create the wallet and accept the dlg # Now we should have a fully-plaintext rootkey and chaincode root = PyBtcAddress().createFromPlainKeyData(privKey) root.chaincode = chain first = root.extendAddressChain() newWltID = binary_to_base58((ADDRBYTE + first.getAddr160()[:5])[::-1]) # Stop here if this was just a test if self.thisIsATest: verifyRecoveryTestID(self, newWltID, self.testWltID) return dlgOwnWlt = None if self.main.walletMap.has_key(newWltID): dlgOwnWlt = DlgReplaceWallet(newWltID, self.parent, self.main) if (dlgOwnWlt.exec_()): if dlgOwnWlt.output == 0: return else: self.reject() return else: reply = QMessageBox.question(self, 'Verify Wallet ID', \ 'The data you entered corresponds to a wallet with a wallet ID: \n\n \t' + newWltID + '\n\nDoes this ID match the "Wallet Unique ID" ' 'printed on your paper backup? If not, click "No" and reenter ' 'key and chain-code data again.', \ QMessageBox.Yes | QMessageBox.No) if reply == QMessageBox.No: return passwd = [] if self.chkEncrypt.isChecked(): dlgPasswd = DlgChangePassphrase(self, self.main) if dlgPasswd.exec_(): passwd = SecureBinaryData(str(dlgPasswd.edtPasswd1.text())) else: QMessageBox.critical(self, 'Cannot Encrypt', \ 'You requested your restored wallet be encrypted, but no ' 'valid passphrase was supplied. Aborting wallet recovery.', \ QMessageBox.Ok) return shortl = '' longl = '' nPool = 1000 if dlgOwnWlt is not None: if dlgOwnWlt.Meta is not None: shortl = ' - %s' % (dlgOwnWlt.Meta['shortLabel']) longl = dlgOwnWlt.Meta['longLabel'] nPool = max(nPool, dlgOwnWlt.Meta['naddress']) self.newWallet = PyBtcWallet() if passwd: self.newWallet.createNewWallet( \ plainRootKey=privKey, \ chaincode=chain, \ shortLabel='Restored - %s%s' % \ (newWltID, shortl), \ longLabel=longl, \ withEncrypt=True, \ securePassphrase=passwd, \ kdfTargSec = \ self.advancedOptionsTab.getKdfSec(), \ kdfMaxMem = \ self.advancedOptionsTab.getKdfBytes(), isActuallyNew=False, \ doRegisterWithBDM=False) else: self.newWallet.createNewWallet( \ plainRootKey=privKey, \ chaincode=chain, \ shortLabel='Restored - %s%s' % \ (newWltID, shortl), \ longLabel=longl, \ withEncrypt=False, \ isActuallyNew=False, \ doRegisterWithBDM=False) fillAddrPoolProgress = DlgProgress(self, self.main, HBar=1, Title="Computing New Addresses") fillAddrPoolProgress.exec_(self.newWallet.fillAddressPool, nPool) if dlgOwnWlt is not None: if dlgOwnWlt.Meta is not None: from armoryengine.PyBtcWallet import WLT_UPDATE_ADD for n_cmt in range(0, dlgOwnWlt.Meta['ncomments']): entrylist = [] entrylist = list(dlgOwnWlt.Meta[n_cmt]) self.newWallet.walletFileSafeUpdate([[WLT_UPDATE_ADD, entrylist[2], entrylist[1], entrylist[0]]]) self.newWallet = PyBtcWallet().readWalletFile(self.newWallet.walletPath) self.accept() # Class that will create the watch-only wallet data (root public key & chain # code) restoration window. ################################################################################ class DlgRestoreWOData(ArmoryDialog): ############################################################################# def __init__(self, parent, main, thisIsATest=False, expectWltID=None): super(DlgRestoreWOData, self).__init__(parent, main) self.thisIsATest = thisIsATest self.testWltID = expectWltID headerStr = '' lblDescr = '' # Write the text at the top of the window. if thisIsATest: lblDescr = QRichLabel(tr(""" Test a Watch-Only Wallet Restore

Use this window to test the restoration of a watch-only wallet using the wallet's data. You can either type the data on a root data printout or import the data from a file.""")) else: lblDescr = QRichLabel(tr(""" Restore a Watch-Only Wallet

Use this window to restore a watch-only wallet using the wallet's data. You can either type the data on a root data printout or import the data from a file.""")) # Create the line that will contain the imported ID. self.rootIDLabel = QRichLabel(tr('Watch-Only Root ID:'), doWrap=False) inpMask = '
"""), QMessageBox.Ok) LOGERROR('Error in root ID restore field') LOGERROR('Error Type: %s', errType) LOGERROR('Error Value: %s', errVal) return # Save the version/key byte and the root ID. For now, ignore the version. inRootVer = inRootChecked[0] # 1 byte inRootID = inRootChecked[1:7] # 6 bytes # Read in the root data (public key & chain code) and handle any errors. for i in range(nLine): hasError = False try: rawEntry = str(self.pkccList[i].text()) rawBin, err = readSixteenEasyBytes(rawEntry.replace(' ', '')) if err == 'Error_2+': # 2+ bytes are wrong, so we need to stop. hasError = True elif err == 'Fixed_1': # 1 byte is wrong, so we may be okay. nError += 1 except: hasError = True # If the root ID is busted, stop. if hasError: lineNumber = i+1 reply = QMessageBox.critical(self, tr('Invalid Data'), tr(""" There is an error in the root data you entered that could not be fixed automatically. Please double-check that you entered the text exactly as it appears on the wallet-backup page.

The error occured on line #%d.""") % \ lineNumber, QMessageBox.Ok) LOGERROR('Error in root data restore field') return # If we've gotten this far, save the incoming line. inputLines.append(rawBin) # Set up the root ID data. pkVer = binary_to_int(inRootVer) & PYROOTPKCCVERMASK # Ignored for now. pkSignByte = ((binary_to_int(inRootVer) & PYROOTPKCCSIGNMASK) >> 7) + 2 rootPKComBin = int_to_binary(pkSignByte) + ''.join(inputLines[:2]) rootPubKey = CryptoECDSA().UncompressPoint(SecureBinaryData(rootPKComBin)) rootChainCode = SecureBinaryData(''.join(inputLines[2:])) # Now we should have a fully-plaintext root key and chain code, and can # get some related data. root = PyBtcAddress().createFromPublicKeyData(rootPubKey) root.chaincode = rootChainCode first = root.extendAddressChain() newWltID = binary_to_base58(inRootID) # Stop here if this was just a test if self.thisIsATest: verifyRecoveryTestID(self, newWltID, self.testWltID) return # If we already have the wallet, don't replace it, otherwise proceed. dlgOwnWlt = None if self.main.walletMap.has_key(newWltID): QMessageBox.warning(self, tr('Wallet Already Exists'), tr("""The wallet already exists and will not be replaced."""), QMessageBox.Ok) self.reject() return else: # Make sure the user is restoring the wallet they want to restore. reply = QMessageBox.question(self, 'Verify Wallet ID', \ 'The data you entered corresponds to a wallet with a wallet ' 'ID: \n\n\t' + binary_to_base58(inRootID) + '\n\nDoes this ' 'ID match the "Wallet Unique ID" you intend to restore? ' 'If not, click "No" and enter the key and chain-code data ' 'again.', QMessageBox.Yes | QMessageBox.No) if reply == QMessageBox.No: return # Create the wallet. self.newWallet = PyBtcWallet().createNewWalletFromPKCC(rootPubKey, \ rootChainCode) # Create some more addresses and show a progress bar while restoring. nPool = 1000 fillAddrPoolProgress = DlgProgress(self, self.main, HBar=1, Title="Computing New Addresses") fillAddrPoolProgress.exec_(self.newWallet.fillAddressPool, nPool) self.accept() ################################################################################ class DlgRestoreFragged(ArmoryDialog): def __init__(self, parent, main, thisIsATest=False, expectWltID=None): super(DlgRestoreFragged, self).__init__(parent, main) self.thisIsATest = thisIsATest self.testWltID = expectWltID headerStr = '' if thisIsATest: headerStr = tr("""Testing a Fragmented Backup""") else: headerStr = tr('Restore Wallet from Fragments') descr = tr(""" %s

Use this form to enter all the fragments to be restored. Fragments can be stored on a mix of paper printouts, and saved files. If any of the fragments require a SecurePrint\xe2\x84\xa2 code, you will only have to enter it once, since that code is the same for all fragments of any given wallet. """) % headerStr if self.thisIsATest: descr += tr("""

For testing purposes, you may enter more fragments than needed and Armory will test all subsets of the entered fragments to verify that each one still recovers the wallet successfully.""") lblDescr = QRichLabel(descr) frmDescr = makeHorizFrame([lblDescr], STYLE_RAISED) # HLINE self.scrollFragInput = QScrollArea() self.scrollFragInput.setWidgetResizable(True) self.scrollFragInput.setMinimumHeight(150) lblFragList = QRichLabel(tr('Input Fragments Below:'), doWrap=False, bold=True) self.btnAddFrag = QPushButton(tr('+Frag')) self.btnRmFrag = QPushButton(tr('-Frag')) self.btnRmFrag.setVisible(False) self.connect(self.btnAddFrag, SIGNAL(CLICKED), self.addFragment) self.connect(self.btnRmFrag, SIGNAL(CLICKED), self.removeFragment) self.chkEncrypt = QCheckBox('Encrypt Restored Wallet') self.chkEncrypt.setChecked(True) frmAddRm = makeHorizFrame([self.chkEncrypt, STRETCH, self.btnRmFrag, self.btnAddFrag]) self.fragDataMap = {} self.tableSize = 2 self.wltType = UNKNOWN self.fragIDPrefix = UNKNOWN doItText = tr('Test Backup' if thisIsATest else 'Restore from Fragments') btnExit = QPushButton(tr('Cancel')) self.btnRestore = QPushButton(doItText) self.connect(btnExit, SIGNAL(CLICKED), self.reject) self.connect(self.btnRestore, SIGNAL(CLICKED), self.processFrags) frmBtns = makeHorizFrame([btnExit, STRETCH, self.btnRestore]) self.lblRightFrm = QRichLabel('', hAlign=Qt.AlignHCenter) self.lblSecureStr = QRichLabel(tr('SecurePrint\xe2\x84\xa2 Code:'), \ hAlign=Qt.AlignHCenter, doWrap=False, color='TextWarn') self.displaySecureString = QLineEdit() self.imgPie = QRichLabel('', hAlign=Qt.AlignHCenter) self.imgPie.setMinimumWidth(96) self.imgPie.setMinimumHeight(96) self.lblReqd = QRichLabel('', hAlign=Qt.AlignHCenter) self.lblWltID = QRichLabel('', doWrap=False, hAlign=Qt.AlignHCenter) self.lblFragID = QRichLabel('', doWrap=False, hAlign=Qt.AlignHCenter) self.lblSecureStr.setVisible(False) self.displaySecureString.setVisible(False) self.displaySecureString.setMaximumWidth(relaxedSizeNChar(self.displaySecureString, 16)[0]) # The Secure String is now edited in DlgEnterOneFrag, It is only displayed here self.displaySecureString.setEnabled(False) frmSecPair = makeVertFrame([self.lblSecureStr, self.displaySecureString]) frmSecCtr = makeHorizFrame([STRETCH, frmSecPair, STRETCH]) frmWltInfo = makeVertFrame([STRETCH, self.lblRightFrm, self.imgPie, self.lblReqd, self.lblWltID, self.lblFragID, HLINE(), frmSecCtr, 'Strut(200)', STRETCH], STYLE_SUNKEN) fragmentsLayout = QGridLayout() fragmentsLayout.addWidget(frmDescr, 0, 0, 1, 2) fragmentsLayout.addWidget(frmAddRm, 1, 0, 1, 1) fragmentsLayout.addWidget(self.scrollFragInput, 2, 0, 1, 1) fragmentsLayout.addWidget(frmWltInfo, 1, 1, 2, 1) setLayoutStretchCols(fragmentsLayout, 1, 0) walletRestoreTabs = QTabWidget() fragmentsFrame = QFrame() fragmentsFrame.setLayout(fragmentsLayout) walletRestoreTabs.addTab(fragmentsFrame, "Fragments") self.advancedOptionsTab = AdvancedOptionsFrame(parent, main) walletRestoreTabs.addTab(self.advancedOptionsTab, "Advanced Options") self.chkEncrypt.setChecked(not thisIsATest) self.chkEncrypt.setVisible(not thisIsATest) self.advancedOptionsTab.setEnabled(not thisIsATest) if not thisIsATest: self.connect(self.chkEncrypt, SIGNAL(CLICKED), self.onEncryptCheckboxChange) layout = QVBoxLayout() layout.addWidget(walletRestoreTabs) layout.addWidget(frmBtns) self.setLayout(layout) self.setMinimumWidth(650) self.setMinimumHeight(500) self.sizeHint = lambda: QSize(800, 650) self.setWindowTitle(tr('Restore wallet from fragments')) self.makeFragInputTable() self.checkRestoreParams() ############################################################################# # Hide advanced options whenver the restored wallet is unencrypted def onEncryptCheckboxChange(self): self.advancedOptionsTab.setEnabled(self.chkEncrypt.isChecked()) def makeFragInputTable(self, addCount=0): self.tableSize += addCount newLayout = QGridLayout() newFrame = QFrame() self.fragsDone = [] newLayout.addWidget(HLINE(), 0, 0, 1, 5) for i in range(self.tableSize): btnEnter = QPushButton(tr('Type Data')) btnLoad = QPushButton(tr('Load File')) btnClear = QPushButton(tr('Clear')) lblFragID = QRichLabel('', doWrap=False) lblSecure = QLabel('') if i in self.fragDataMap: M, fnum, wltID, doMask, fid = ReadFragIDLineBin(self.fragDataMap[i][0]) self.fragsDone.append(fnum) lblFragID.setText('' + fid + '') if doMask: lblFragID.setText('' + fid + '', color='TextWarn') self.connect(btnEnter, SIGNAL(CLICKED), \ functools.partial(self.dataEnter, fnum=i)) self.connect(btnLoad, SIGNAL(CLICKED), \ functools.partial(self.dataLoad, fnum=i)) self.connect(btnClear, SIGNAL(CLICKED), \ functools.partial(self.dataClear, fnum=i)) newLayout.addWidget(btnEnter, 2 * i + 1, 0) newLayout.addWidget(btnLoad, 2 * i + 1, 1) newLayout.addWidget(btnClear, 2 * i + 1, 2) newLayout.addWidget(lblFragID, 2 * i + 1, 3) newLayout.addWidget(lblSecure, 2 * i + 1, 4) newLayout.addWidget(HLINE(), 2 * i + 2, 0, 1, 5) btnFrame = QFrame() btnFrame.setLayout(newLayout) frmFinal = makeVertFrame([btnFrame, STRETCH], STYLE_SUNKEN) self.scrollFragInput.setWidget(frmFinal) self.btnAddFrag.setVisible(self.tableSize < 12) self.btnRmFrag.setVisible(self.tableSize > 2) ############################################################################# def addFragment(self): self.makeFragInputTable(1) ############################################################################# def removeFragment(self): self.makeFragInputTable(-1) toRemove = [] for key, val in self.fragDataMap.iteritems(): if key >= self.tableSize: toRemove.append(key) # Have to do this in a separate loop, cause you can't remove items # from a map while you are iterating over them for key in toRemove: self.dataClear(key) ############################################################################# def dataEnter(self, fnum): dlg = DlgEnterOneFrag(self, self.main, self.fragsDone, self.wltType, self.displaySecureString.text()) if dlg.exec_(): LOGINFO('Good data from enter_one_frag exec! %d', fnum) self.displaySecureString.setText(dlg.editSecurePrint.text()) self.addFragToTable(fnum, dlg.fragData) self.makeFragInputTable() ############################################################################# def dataLoad(self, fnum): LOGINFO('Loading data for entry, %d', fnum) toLoad = unicode(self.main.getFileLoad(tr('Load Fragment File'), \ [tr('Wallet Fragments (*.frag)')])) if len(toLoad) == 0: return if not os.path.exists(toLoad): LOGERROR('File just chosen does not exist! %s', toLoad) QMessageBox.critical(self, tr('File Does Not Exist'), tr(""" The file you select somehow does not exist...?

%s

Try a different file""") % toLoad, \ QMessageBox.Ok) fragMap = {} with open(toLoad, 'r') as fin: allData = [line.strip() for line in fin.readlines()] fragMap = {} for line in allData: if line[:2].lower() in ['id', 'x1', 'x2', 'x3', 'x4', \ 'y1', 'y2', 'y3', 'y4', \ 'f1', 'f2', 'f3', 'f4']: fragMap[line[:2].lower()] = line[3:].strip().replace(' ', '') cList, nList = [], [] if len(fragMap) == 9: cList, nList = ['x', 'y'], ['1', '2', '3', '4'] elif len(fragMap) == 5: cList, nList = ['f'], ['1', '2', '3', '4'] elif len(fragMap) == 3: cList, nList = ['f'], ['1', '2'] else: LOGERROR('Unexpected number of lines in the frag file, %d', len(fragMap)) return fragData = [] fragData.append(hex_to_binary(fragMap['id'])) for c in cList: for n in nList: mapKey = c + n rawBin, err = readSixteenEasyBytes(fragMap[c + n]) if err == 'Error_2+': QMessageBox.critical(self, tr('Fragment Error'), tr(""" There was an unfixable error in the fragment file:

File: %s
Line: %s
""") % (toLoad, mapKey), \ QMessageBox.Ok) return fragData.append(SecureBinaryData(rawBin)) rawBin = None self.addFragToTable(fnum, fragData) self.makeFragInputTable() ############################################################################# def dataClear(self, fnum): if not fnum in self.fragDataMap: return for i in range(1, 3): self.fragDataMap[fnum][i].destroy() del self.fragDataMap[fnum] self.makeFragInputTable() self.checkRestoreParams() ############################################################################# def checkRestoreParams(self): showRightFrm = False self.btnRestore.setEnabled(False) self.lblRightFrm.setText(tr(""" Start entering fragments into the table to left...""")) for row, data in self.fragDataMap.iteritems(): showRightFrm = True M, fnum, wltIDBin, doMask, idBase58 = ReadFragIDLineBin(data[0]) self.lblRightFrm.setText('Wallet Being Restored:') self.imgPie.setPixmap(QPixmap(':/frag%df.png' % M).scaled(96,96)) self.lblReqd.setText(tr('Frags Needed: %d') % M) self.lblWltID.setText(tr('Wallet: %s') % binary_to_base58(wltIDBin)) self.lblFragID.setText(tr('Fragments: %s') % idBase58.split('-')[0]) self.btnRestore.setEnabled(len(self.fragDataMap) >= M) break anyMask = False for row, data in self.fragDataMap.iteritems(): M, fnum, wltIDBin, doMask, idBase58 = ReadFragIDLineBin(data[0]) if doMask: anyMask = True break # If all of the rows with a Mask have been removed clear the securePrintCode if not anyMask: self.displaySecureString.setText('') self.lblSecureStr.setVisible(anyMask) self.displaySecureString.setVisible(anyMask) if not showRightFrm: self.fragIDPrefix = UNKNOWN self.wltType = UNKNOWN self.imgPie.setVisible(showRightFrm) self.lblReqd.setVisible(showRightFrm) self.lblWltID.setVisible(showRightFrm) self.lblFragID.setVisible(showRightFrm) ############################################################################# def addFragToTable(self, tableIndex, fragData): if len(fragData) == 9: currType = '0' elif len(fragData) == 5: currType = BACKUP_TYPE_135A elif len(fragData) == 3: currType = BACKUP_TYPE_135C else: LOGERROR('How\'d we get fragData of size: %d', len(fragData)) return if self.wltType == UNKNOWN: self.wltType = currType elif not self.wltType == currType: QMessageBox.critical(self, tr('Mixed fragment types'), tr(""" You entered a fragment for a different wallet type. Please check that all fragments are for the same wallet, of the same version, and require the same number of fragments."""), QMessageBox.Ok) LOGERROR('Mixing frag types! How did that happen?') return M, fnum, wltIDBin, doMask, idBase58 = ReadFragIDLineBin(fragData[0]) # If we don't know the Secure String Yet we have to get it if doMask and len(str(self.displaySecureString.text()).strip()) == 0: dlg = DlgEnterSecurePrintCode(self, self.main) if dlg.exec_(): self.displaySecureString.setText(dlg.editSecurePrint.text()) else: return if self.fragIDPrefix == UNKNOWN: self.fragIDPrefix = idBase58.split('-')[0] elif not self.fragIDPrefix == idBase58.split('-')[0]: QMessageBox.critical(self, tr('Multiple Walletss'), tr(""" The fragment you just entered is actually for a different wallet than the previous fragments you entered. Please double-check that all the fragments you are entering belong to the same wallet and have the "number of needed fragments" (M-value, in M-of-N)."""), \ QMessageBox.Ok) LOGERROR('Mixing fragments of different wallets! %s', idBase58) return if not self.verifyNonDuplicateFrag(fnum): QMessageBox.critical(self, tr('Duplicate Fragment'), tr(""" You just input fragment #%d, but that fragment has already been entered!""") % fnum, QMessageBox.Ok) return if currType == '0': X = SecureBinaryData(''.join([fragData[i].toBinStr() for i in range(1, 5)])) Y = SecureBinaryData(''.join([fragData[i].toBinStr() for i in range(5, 9)])) elif currType == BACKUP_TYPE_135A: X = SecureBinaryData(int_to_binary(fnum + 1, widthBytes=64, endOut=BIGENDIAN)) Y = SecureBinaryData(''.join([fragData[i].toBinStr() for i in range(1, 5)])) elif currType == BACKUP_TYPE_135C: X = SecureBinaryData(int_to_binary(fnum + 1, widthBytes=32, endOut=BIGENDIAN)) Y = SecureBinaryData(''.join([fragData[i].toBinStr() for i in range(1, 3)])) self.fragDataMap[tableIndex] = [fragData[0][:], X.copy(), Y.copy()] X.destroy() Y.destroy() self.checkRestoreParams() ############################################################################# def verifyNonDuplicateFrag(self, fnum): for row, data in self.fragDataMap.iteritems(): rowFrag = ReadFragIDLineBin(data[0])[1] if fnum == rowFrag: return False return True ############################################################################# def processFrags(self): if self.chkEncrypt.isChecked() and self.advancedOptionsTab.getKdfSec() == -1: QMessageBox.critical(self, 'Invalid Target Compute Time', \ 'You entered Target Compute Time incorrectly.\n\nEnter: (ms, s)', QMessageBox.Ok) return if self.chkEncrypt.isChecked() and self.advancedOptionsTab.getKdfBytes() == -1: QMessageBox.critical(self, 'Invalid Max Memory Usage', \ 'You entered Max Memory Usage incorrectly.\n\nnter: (kb, mb)', QMessageBox.Ok) return SECPRINT = HardcodedKeyMaskParams() pwd, ekey = '', '' if self.displaySecureString.isVisible(): pwd = str(self.displaySecureString.text()).strip() maskKey = SECPRINT['FUNC_KDF'](pwd) fragMtrx, M = [], -1 for row, trip in self.fragDataMap.iteritems(): M, fnum, wltID, doMask, fid = ReadFragIDLineBin(trip[0]) X, Y = trip[1], trip[2] if doMask: LOGINFO('Row %d needs unmasking' % row) Y = SECPRINT['FUNC_UNMASK'](Y, ekey=maskKey) else: LOGINFO('Row %d is already unencrypted' % row) fragMtrx.append([X.toBinStr(), Y.toBinStr()]) typeToBytes = {'0': 64, BACKUP_TYPE_135A: 64, BACKUP_TYPE_135C: 32} nBytes = typeToBytes[self.wltType] if self.thisIsATest and len(fragMtrx) > M: self.testFragSubsets(fragMtrx, M) return SECRET = ReconstructSecret(fragMtrx, M, nBytes) for i in range(len(fragMtrx)): fragMtrx[i] = [] LOGINFO('Final length of frag mtrx: %d', len(fragMtrx)) LOGINFO('Final length of secret: %d', len(SECRET)) priv, chain = '', '' if len(SECRET) == 64: priv = SecureBinaryData(SECRET[:32 ]) chain = SecureBinaryData(SECRET[ 32:]) elif len(SECRET) == 32: priv = SecureBinaryData(SECRET) chain = DeriveChaincodeFromRootKey(priv) # If we got here, the data is valid, let's create the wallet and accept the dlg # Now we should have a fully-plaintext rootkey and chaincode root = PyBtcAddress().createFromPlainKeyData(priv) root.chaincode = chain first = root.extendAddressChain() newWltID = binary_to_base58((ADDRBYTE + first.getAddr160()[:5])[::-1]) # If this is a test, then bail if self.thisIsATest: verifyRecoveryTestID(self, newWltID, self.testWltID) return dlgOwnWlt = None if self.main.walletMap.has_key(newWltID): dlgOwnWlt = DlgReplaceWallet(newWltID, self.parent, self.main) if (dlgOwnWlt.exec_()): if dlgOwnWlt.output == 0: return else: self.reject() return reply = QMessageBox.question(self, tr('Verify Wallet ID'), tr(""" The data you entered corresponds to a wallet with a wallet ID:
{}
Does this ID match the "Wallet Unique ID" printed on your paper backup? If not, click "No" and reenter key and chain-code data again.""").format(newWltID), QMessageBox.Yes | QMessageBox.No) if reply == QMessageBox.No: return passwd = [] if self.chkEncrypt.isChecked(): dlgPasswd = DlgChangePassphrase(self, self.main) if dlgPasswd.exec_(): passwd = SecureBinaryData(str(dlgPasswd.edtPasswd1.text())) else: QMessageBox.critical(self, tr('Cannot Encrypt'), tr(""" You requested your restored wallet be encrypted, but no valid passphrase was supplied. Aborting wallet recovery."""), QMessageBox.Ok) return shortl = '' longl = '' nPool = 1000 if dlgOwnWlt is not None: if dlgOwnWlt.Meta is not None: shortl = ' - %s' % (dlgOwnWlt.Meta['shortLabel']) longl = dlgOwnWlt.Meta['longLabel'] nPool = max(nPool, dlgOwnWlt.Meta['naddress']) if passwd: self.newWallet = PyBtcWallet().createNewWallet(\ plainRootKey=priv, \ chaincode=chain, \ shortLabel='Restored - %s%s' % (newWltID, shortl), \ longLabel=longl, \ withEncrypt=True, \ securePassphrase=passwd, \ kdfTargSec=self.advancedOptionsTab.getKdfSec(), \ kdfMaxMem=self.advancedOptionsTab.getKdfBytes(), isActuallyNew=False, \ doRegisterWithBDM=False) else: self.newWallet = PyBtcWallet().createNewWallet(\ plainRootKey=priv, \ chaincode=chain, \ shortLabel='Restored - %s%s' % (newWltID, shortl), \ longLabel=longl, \ withEncrypt=False, \ isActuallyNew=False, \ doRegisterWithBDM=False) # Will pop up a little "please wait..." window while filling addr pool fillAddrPoolProgress = DlgProgress(self, self.parent, HBar=1, Title="Computing New Addresses") fillAddrPoolProgress.exec_(self.newWallet.fillAddressPool, nPool) if dlgOwnWlt is not None: if dlgOwnWlt.Meta is not None: from armoryengine.PyBtcWallet import WLT_UPDATE_ADD for n_cmt in range(0, dlgOwnWlt.Meta['ncomments']): entrylist = [] entrylist = list(dlgOwnWlt.Meta[n_cmt]) self.newWallet.walletFileSafeUpdate([[WLT_UPDATE_ADD, entrylist[2], entrylist[1], entrylist[0]]]) self.newWallet = PyBtcWallet().readWalletFile(self.newWallet.walletPath) self.accept() ############################################################################# def testFragSubsets(self, fragMtrx, M): # If the user entered multiple fragments fragMap = {} for x, y in fragMtrx: fragMap[binary_to_int(x, BIGENDIAN) - 1] = [x, y] typeToBytes = {'0': 64, BACKUP_TYPE_135A: 64, BACKUP_TYPE_135C: 32} isRandom, results = testReconstructSecrets(fragMap, M, 100) def privAndChainFromRow(secret): priv, chain = None, None if len(secret) == 64: priv = SecureBinaryData(secret[:32 ]) chain = SecureBinaryData(secret[ 32:]) return (priv, chain) elif len(secret) == 32: priv = SecureBinaryData(secret) chain = DeriveChaincodeFromRootKey(priv) return (priv, chain) else: LOGERROR('Root secret is %s bytes ?!' % len(secret)) raise KeyDataError results = [(row[0], privAndChainFromRow(row[1])) for row in results] subsAndIDs = [(row[0], calcWalletIDFromRoot(*row[1])) for row in results] DlgShowTestResults(self, isRandom, subsAndIDs, \ M, len(fragMtrx), self.testWltID).exec_() ########################################################################## class DlgShowTestResults(ArmoryDialog): ####################################################################### def __init__(self, parent, isRandom, subsAndIDs, M, nFrag, expectID): super(DlgShowTestResults, self).__init__(parent, parent.main) accumSet = set() for sub, ID in subsAndIDs: accumSet.add(ID) allEqual = (len(accumSet) == 1) allCorrect = True testID = expectID if not testID: testID = subsAndIDs[0][1] allCorrect = testID == subsAndIDs[0][1] descr = '' nSubs = len(subsAndIDs) fact = lambda x: math.factorial(x) total = fact(nFrag) / (fact(M) * fact(nFrag - M)) if isRandom: descr = tr(""" The total number of fragment subsets (%d) is too high to test and display. Instead, %d subsets were tested at random. The results are below """) % (total, nSubs) else: descr = tr(""" For the fragments you entered, there are a total of %d possible subsets that can restore your wallet. The test results for all subsets are shown below""") % total lblDescr = QRichLabel(descr) lblWltIDDescr = QRichLabel(tr(""" The wallet ID is computed from the first address in your wallet based on the root key data (and the "chain code"). Therefore, a matching wallet ID proves that the wallet will produce identical addresses.""")) frmResults = QFrame() layout = QGridLayout() row = 0 for sub, ID in subsAndIDs: subStrs = [str(s) for s in sub] subText = ', '.join(subStrs[:-1]) dispTxt = tr(""" Fragments %s and %s produce a wallet with ID "%s" """) % (subText, subStrs[-1], ID) chk = lambda: QPixmap(':/checkmark32.png').scaled(20, 20) _X_ = lambda: QPixmap(':/red_X.png').scaled(16, 16) lblTxt = QRichLabel(dispTxt) lblTxt.setWordWrap(False) lblPix = QLabel('') lblPix.setPixmap(chk() if ID == testID else _X_()) layout.addWidget(lblTxt, row, 0) layout.addWidget(lblPix, row, 1) row += 1 scrollResults = QScrollArea() frmResults = QFrame() frmResults.setLayout(layout) scrollResults.setWidget(frmResults) btnOkay = QPushButton('Ok') buttonBox = QDialogButtonBox() buttonBox.addButton(btnOkay, QDialogButtonBox.AcceptRole) self.connect(btnOkay, SIGNAL(CLICKED), self.accept) mainLayout = QVBoxLayout() mainLayout.addWidget(lblDescr) mainLayout.addWidget(scrollResults) mainLayout.addWidget(lblWltIDDescr) mainLayout.addWidget(buttonBox) self.setLayout(mainLayout) self.setWindowTitle('Fragment Test Results') self.setMinimumWidth(500) ################################################################################ class DlgEnterSecurePrintCode(ArmoryDialog): def __init__(self, parent, main): super(DlgEnterSecurePrintCode, self).__init__(parent, main) lblSecurePrintCodeDescr = QRichLabel(tr(""" This fragment file requires a SecurePrint\xe2\x84\xa2 code. You will only have to enter this code once since it is the same on all fragments.""")) lblSecurePrintCodeDescr.setMinimumWidth(440) self.lblSP = QRichLabel(tr('SecurePrint\xe2\x84\xa2 Code: '), doWrap=False) self.editSecurePrint = QLineEdit() spFrame = makeHorizFrame([self.lblSP, self.editSecurePrint, STRETCH]) self.btnAccept = QPushButton("Done") self.btnCancel = QPushButton("Cancel") self.connect(self.btnAccept, SIGNAL(CLICKED), self.verifySecurePrintCode) self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) buttonBox = QDialogButtonBox() buttonBox.addButton(self.btnAccept, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) layout = QVBoxLayout() layout.addWidget(lblSecurePrintCodeDescr) layout.addWidget(spFrame) layout.addWidget(buttonBox) self.setLayout(layout) self.setWindowTitle(tr('Enter Secure Print Code')) def verifySecurePrintCode(self): # Prepare the key mask parameters SECPRINT = HardcodedKeyMaskParams() securePrintCode = str(self.editSecurePrint.text()).strip() if len(securePrintCode) < 9 or \ sum([1 if c in BASE58CHARS else 0 for c in securePrintCode]) < len(securePrintCode): QMessageBox.critical(self, tr('Invalid Code'), tr(""" You didn't enter a full SecurePrint\xe2\x84\xa2 code. This code is needed to decrypt your backup file."""), QMessageBox.Ok) return if not SECPRINT['FUNC_CHKPWD'](securePrintCode): QMessageBox.critical(self, tr('Bad Encryption Code'), tr(""" The SecurePrint\xe2\x84\xa2 code you entered has an error in it. Note that the code is case-sensitive. Please verify you entered it correctly and try again."""), QMessageBox.Ok) return self.accept() ################################################################################ class DlgEnterOneFrag(ArmoryDialog): def __init__(self, parent, main, fragList=[], wltType=UNKNOWN, securePrintCode=None): super(DlgEnterOneFrag, self).__init__(parent, main) self.fragData = [] BLUE = htmlColor('TextBlue') already = '' if len(fragList) > 0: strList = ['%d' % (BLUE, f) for f in fragList] replStr = '[' + ','.join(strList[:]) + ']' already = tr(""" You have entered fragments %s, so far. """) % replStr lblDescr = QRichLabel(tr(""" Enter Another Fragment...

%s The fragments can be entered in any order, as long as you provide enough of them to restore the wallet. If any fragments use a SecurePrint\xe2\x84\xa2 code, please enter it once on the previous window, and it will be applied to all fragments that require it.""") % already) self.version0Button = QRadioButton(BACKUP_TYPE_0_TEXT, self) self.version135aButton = QRadioButton(BACKUP_TYPE_135a_TEXT, self) self.version135aSPButton = QRadioButton(BACKUP_TYPE_135a_SP_TEXT, self) self.version135cButton = QRadioButton(BACKUP_TYPE_135c_TEXT, self) self.version135cSPButton = QRadioButton(BACKUP_TYPE_135c_SP_TEXT, self) self.backupTypeButtonGroup = QButtonGroup(self) self.backupTypeButtonGroup.addButton(self.version0Button) self.backupTypeButtonGroup.addButton(self.version135aButton) self.backupTypeButtonGroup.addButton(self.version135aSPButton) self.backupTypeButtonGroup.addButton(self.version135cButton) self.backupTypeButtonGroup.addButton(self.version135cSPButton) self.version135cButton.setChecked(True) self.connect(self.backupTypeButtonGroup, SIGNAL('buttonClicked(int)'), self.changeType) # This value will be locked after the first fragment is entered. if wltType == UNKNOWN: self.version135cButton.setChecked(True) elif wltType == '0': self.version0Button.setChecked(True) self.version135aButton.setEnabled(False) self.version135aSPButton.setEnabled(False) self.version135cButton.setEnabled(False) self.version135cSPButton.setEnabled(False) elif wltType == BACKUP_TYPE_135A: # Could be 1.35a with or without SecurePrintCode so remove the rest self.version0Button.setEnabled(False) self.version135cButton.setEnabled(False) self.version135cSPButton.setEnabled(False) if securePrintCode: self.version135aSPButton.setChecked(True) else: self.version135aButton.setChecked(True) elif wltType == BACKUP_TYPE_135C: # Could be 1.35c with or without SecurePrintCode so remove the rest self.version0Button.setEnabled(False) self.version135aButton.setEnabled(False) self.version135aSPButton.setEnabled(False) if securePrintCode: self.version135cSPButton.setChecked(True) else: self.version135cButton.setChecked(True) lblType = QRichLabel(tr("""Backup Type:"""), doWrap=False) layoutRadio = QVBoxLayout() layoutRadio.addWidget(self.version0Button) layoutRadio.addWidget(self.version135aButton) layoutRadio.addWidget(self.version135aSPButton) layoutRadio.addWidget(self.version135cButton) layoutRadio.addWidget(self.version135cSPButton) layoutRadio.setSpacing(0) radioButtonFrame = QFrame() radioButtonFrame.setLayout(layoutRadio) frmBackupType = makeVertFrame([lblType, radioButtonFrame]) self.prfxList = ['x1:', 'x2:', 'x3:', 'x4:', \ 'y1:', 'y2:', 'y3:', 'y4:', \ 'F1:', 'F2:', 'F3:', 'F4:'] self.prfxList = [QLabel(p) for p in self.prfxList] inpMask = ' 127 ############################################################################# def verifyUserInput(self): self.fragData = [] nError = 0 rawBin = None sel = self.backupTypeButtonGroup.checkedId() rng = [-1] if sel == self.backupTypeButtonGroup.id(self.version0Button): rng = range(8) elif sel == self.backupTypeButtonGroup.id(self.version135aButton) or \ sel == self.backupTypeButtonGroup.id(self.version135aSPButton): rng = range(8, 12) elif sel == self.backupTypeButtonGroup.id(self.version135cButton) or \ sel == self.backupTypeButtonGroup.id(self.version135cSPButton): rng = range(8, 10) if sel == self.backupTypeButtonGroup.id(self.version135aSPButton) or \ sel == self.backupTypeButtonGroup.id(self.version135cSPButton): # Prepare the key mask parameters SECPRINT = HardcodedKeyMaskParams() securePrintCode = str(self.editSecurePrint.text()).strip() if len(securePrintCode) < 9 or \ sum([1 if c in BASE58CHARS else 0 for c in securePrintCode]) < len(securePrintCode): QMessageBox.critical(self, 'Invalid Code', tr(""" You didn't enter a full SecurePrint\xe2\x84\xa2 code. This code is needed to decrypt your backup. If this backup is actually unencrypted and there is no code, then choose the appropriate backup type from the drop-down box"""), QMessageBox.Ok) return if not SECPRINT['FUNC_CHKPWD'](securePrintCode): QMessageBox.critical(self, 'Bad Encryption Code', tr(""" The SecurePrint\xe2\x84\xa2 code you entered has an error in it. Note that the code is case-sensitive. Please verify you entered it correctly and try again."""), QMessageBox.Ok) return elif self.isSecurePrintID(): QMessageBox.critical(self, 'Bad Encryption Code', tr(""" The ID field indicates that this is a SecurePrint\xe2\x84\xa2 Backup Type. You have either entered the ID incorrectly or have chosen an incorrect Backup Type."""), QMessageBox.Ok) return for i in rng: hasError = False try: rawEntry = str(self.edtList[i].text()) rawBin, err = readSixteenEasyBytes(rawEntry.replace(' ', '')) if err == 'Error_2+': hasError = True elif err == 'Fixed_1': nError += 1 except KeyError: hasError = True if hasError: reply = QMessageBox.critical(self, tr('Verify Wallet ID'), tr(""" There is an error in the data you entered that could not be fixed automatically. Please double-check that you entered the text exactly as it appears on the wallet-backup page.

The error occured on the "%s" line.""") % \ str(self.prfxList[i].text()), QMessageBox.Ok) LOGERROR('Error in wallet restore field') self.prfxList[i].setText('' + str(self.prfxList[i].text()) + '') self.destroyFragData() return self.fragData.append(SecureBinaryData(rawBin)) rawBin = None idLine = str(self.edtID.text()).replace(' ', '') self.fragData.insert(0, hex_to_binary(idLine)) M, fnum, wltID, doMask, fid = ReadFragIDLineBin(self.fragData[0]) reply = QMessageBox.question(self, tr('Verify Fragment ID'), tr(""" The data you entered is for fragment:

%s

Does this ID match the "Fragment:" field displayed on your backup? If not, click "No" and re-enter the fragment data.""") % \ (htmlColor('TextBlue'), fid), QMessageBox.Yes | QMessageBox.No) if reply == QMessageBox.Yes: self.accept() ################################################################################ def verifyRecoveryTestID(parent, computedWltID, expectedWltID=None): if expectedWltID == None: # Testing an arbitrary paper backup yesno = QMessageBox.question(parent, tr('Recovery Test'), tr(""" From the data you entered, Armory calculated the following wallet ID: %s

Does this match the wallet ID on the backup you are testing?""") % computedWltID, QMessageBox.Yes | QMessageBox.No) if yesno == QMessageBox.No: QMessageBox.critical(parent, tr('Bad Backup!'), tr(""" If this is your only backup and you are sure that you entered the data correctly, then it is highly recommended you stop using this wallet! If this wallet currently holds any funds, you should move the funds to a wallet that does have a working backup.



Wallet ID of the data you entered: %s
""") % computedWltID, \ QMessageBox.Ok) elif yesno == QMessageBox.Yes: MsgBoxCustom(MSGBOX.Good, tr('Backup is Good!'), tr(""" Your backup works!

The wallet ID is computed from a combination of the root private key, the "chaincode" and the first address derived from those two pieces of data. A matching wallet ID guarantees it will produce the same chain of addresses as the original.""")) else: # an expected wallet ID was supplied if not computedWltID == expectedWltID: QMessageBox.critical(parent, tr('Bad Backup!'), tr(""" If you are sure that you entered the backup information correctly, then it is highly recommended you stop using this wallet! If this wallet currently holds any funds, you should move the funds to a wallet that does have a working backup.

Computed wallet ID: %s
Expected wallet ID: %s

Is it possible that you loaded a different backup than the one you just made? """ % (computedWltID, expectedWltID)), \ QMessageBox.Ok) else: MsgBoxCustom(MSGBOX.Good, tr('Backup is Good!'), tr(""" Your backup works!

The wallet ID computed from the data you entered matches the expected ID. This confirms that the backup produces the same sequence of private keys as the original wallet!

Computed wallet ID: %s
Expected wallet ID: %s

""" % (computedWltID, expectedWltID))) ################################################################################ def finishPrintingBackup(parent, btype=None): openTestDlg = False msg = tr(""" Please make sure that any printed backups you create (excluding any "ID" lines) have nine columns of four letters each each. If you just made a paper backup, it is important that you test it to make sure that it was printed or copied correctly. Most importantly, """) if btype == None: QMessageBox.warning(parent, tr('Test Your Backup!'), tr(""" """)) ################################################################################ class DlgReplaceWallet(ArmoryDialog): ############################################################################# def __init__(self, WalletID, parent, main): super(DlgReplaceWallet, self).__init__(parent, main) lblDesc = QLabel(tr(""" You already have this wallet loaded!
You can choose to:
- Cancel wallet restore operation
- Set new password and fix any errors
- Overwrite old wallet (delete comments & labels)
""")) self.WalletID = WalletID self.main = main self.Meta = None self.output = 0 self.wltPath = main.walletMap[WalletID].walletPath self.btnAbort = QPushButton('Cancel') self.btnReplace = QPushButton('Overwrite') self.btnSaveMeta = QPushButton('Merge') self.connect(self.btnAbort, SIGNAL('clicked()'), self.reject) self.connect(self.btnReplace, SIGNAL('clicked()'), self.Replace) self.connect(self.btnSaveMeta, SIGNAL('clicked()'), self.SaveMeta) layoutDlg = QGridLayout() layoutDlg.addWidget(lblDesc, 0, 0, 4, 4) layoutDlg.addWidget(self.btnAbort, 4, 0, 1, 1) layoutDlg.addWidget(self.btnSaveMeta, 4, 1, 1, 1) layoutDlg.addWidget(self.btnReplace, 4, 2, 1, 1) self.setLayout(layoutDlg) self.setWindowTitle('Wallet already exists') ######### def Replace(self): self.main.removeWalletFromApplication(self.WalletID) datestr = RightNowStr('%Y-%m-%d-%H%M') homedir = os.path.dirname(self.wltPath) oldpath = os.path.join(homedir, self.WalletID, datestr) try: if not os.path.exists(oldpath): os.makedirs(oldpath) except: LOGEXCEPT('Cannot create new folder in dataDir! Missing credentials?') self.reject() return oldname = os.path.basename(self.wltPath) self.newname = os.path.join(oldpath, '%s_old.wallet' % (oldname[0:-7])) os.rename(self.wltPath, self.newname) backup = '%s_backup.wallet' % (self.wltPath[0:-7]) if os.path.exists(backup): os.remove(backup) self.output =1 self.accept() ######### def SaveMeta(self): from armoryengine.PyBtcWalletRecovery import PyBtcWalletRecovery metaProgress = DlgProgress(self, self.main, Title='Ripping Meta Data') getMeta = PyBtcWalletRecovery() self.Meta = metaProgress.exec_(getMeta.ProcessWallet, WalletPath=self.wltPath, Mode=RECOVERMODE.Meta, Progress=metaProgress.UpdateText) self.Replace() ############################################################################### class DlgWltRecoverWallet(ArmoryDialog): def __init__(self, parent=None, main=None): super(DlgWltRecoverWallet, self).__init__(parent, main) self.edtWalletPath = QLineEdit() self.edtWalletPath.setFont(GETFONT('Fixed', 9)) edtW,edtH = tightSizeNChar(self.edtWalletPath, 50) self.edtWalletPath.setMinimumWidth(edtW) self.btnWalletPath = QPushButton('Browse File System') self.connect(self.btnWalletPath, SIGNAL('clicked()'), self.selectFile) lblDesc = QRichLabel(tr(""" Wallet Recovery Tool:
This tool will recover data from damaged or inconsistent wallets. Specify a wallet file and Armory will analyze the wallet and fix any errors with it.

If any problems are found with the specified wallet, Armory will provide explanation and instructions to transition to a new wallet. """) % htmlColor('TextWarn')) lblDesc.setScaledContents(True) lblWalletPath = QRichLabel(tr('Wallet Path:')) self.selectedWltID = None def doWltSelect(): dlg = DlgWalletSelect(self, self.main, tr('Select Wallet...'), '') if dlg.exec_(): self.selectedWltID = dlg.selectedID wlt = self.parent.walletMap[dlg.selectedID] self.edtWalletPath.setText(wlt.walletPath) self.btnWltSelect = QPushButton(tr("Select Loaded Wallet")) self.connect(self.btnWltSelect, SIGNAL(CLICKED), doWltSelect) layoutMgmt = QGridLayout() wltSltQF = QFrame() wltSltQF.setFrameStyle(STYLE_SUNKEN) layoutWltSelect = QGridLayout() layoutWltSelect.addWidget(lblWalletPath, 0,0, 1, 1) layoutWltSelect.addWidget(self.edtWalletPath, 0,1, 1, 3) layoutWltSelect.addWidget(self.btnWltSelect, 1,0, 1, 2) layoutWltSelect.addWidget(self.btnWalletPath, 1,2, 1, 2) layoutWltSelect.setColumnStretch(0, 0) layoutWltSelect.setColumnStretch(1, 1) layoutWltSelect.setColumnStretch(2, 1) layoutWltSelect.setColumnStretch(3, 0) wltSltQF.setLayout(layoutWltSelect) layoutMgmt.addWidget(makeHorizFrame([lblDesc], STYLE_SUNKEN), 0,0, 2,4) layoutMgmt.addWidget(wltSltQF, 2, 0, 3, 4) self.rdbtnStripped = QRadioButton('', parent=self) self.connect(self.rdbtnStripped, SIGNAL('event()'), self.rdClicked) lblStripped = QLabel('Stripped Recovery
Only attempts to \ recover the wallet\'s rootkey and chaincode') layout_StrippedH = QGridLayout() layout_StrippedH.addWidget(self.rdbtnStripped, 0, 0, 1, 1) layout_StrippedH.addWidget(lblStripped, 0, 1, 2, 19) self.rdbtnBare = QRadioButton('') lblBare = QLabel('Bare Recovery
Attempts to recover all private key related data') layout_BareH = QGridLayout() layout_BareH.addWidget(self.rdbtnBare, 0, 0, 1, 1) layout_BareH.addWidget(lblBare, 0, 1, 2, 19) self.rdbtnFull = QRadioButton('') self.rdbtnFull.setChecked(True) lblFull = QLabel('Full Recovery
Attempts to recover as much data as possible') layout_FullH = QGridLayout() layout_FullH.addWidget(self.rdbtnFull, 0, 0, 1, 1) layout_FullH.addWidget(lblFull, 0, 1, 2, 19) self.rdbtnCheck = QRadioButton('') lblCheck = QLabel('Consistency Check
Checks wallet consistency. Works will both full and watch only
wallets.' ' Unlocking of encrypted wallets is not mandatory') layout_CheckH = QGridLayout() layout_CheckH.addWidget(self.rdbtnCheck, 0, 0, 1, 1) layout_CheckH.addWidget(lblCheck, 0, 1, 3, 19) layoutMode = QGridLayout() layoutMode.addLayout(layout_StrippedH, 0, 0, 2, 4) layoutMode.addLayout(layout_BareH, 2, 0, 2, 4) layoutMode.addLayout(layout_FullH, 4, 0, 2, 4) layoutMode.addLayout(layout_CheckH, 6, 0, 3, 4) #self.rdnGroup = QButtonGroup() #self.rdnGroup.addButton(self.rdbtnStripped) #self.rdnGroup.addButton(self.rdbtnBare) #self.rdnGroup.addButton(self.rdbtnFull) #self.rdnGroup.addButton(self.rdbtnCheck) layoutMgmt.addLayout(layoutMode, 5, 0, 9, 4) """ wltModeQF = QFrame() wltModeQF.setFrameStyle(STYLE_SUNKEN) wltModeQF.setLayout(layoutMode) layoutMgmt.addWidget(wltModeQF, 5, 0, 9, 4) wltModeQF.setVisible(False) btnShowAllOpts = QLabelButton(tr("All Recovery Options>>>")) frmBtn = makeHorizFrame(['Stretch', btnShowAllOpts, 'Stretch'], STYLE_SUNKEN) layoutMgmt.addWidget(frmBtn, 5, 0, 9, 4) def expandOpts(): wltModeQF.setVisible(True) btnShowAllOpts.setVisible(False) self.connect(btnShowAllOpts, SIGNAL('clicked()'), expandOpts) if not self.main.usermode==USERMODE.Expert: frmBtn.setVisible(False) """ self.btnRecover = QPushButton('Recover') self.btnCancel = QPushButton('Cancel') layout_btnH = QHBoxLayout() layout_btnH.addWidget(self.btnRecover, 1) layout_btnH.addWidget(self.btnCancel, 1) def updateBtn(qstr): if os.path.exists(unicode(qstr).strip()): self.btnRecover.setEnabled(True) self.btnRecover.setToolTip('') else: self.btnRecover.setEnabled(False) self.btnRecover.setToolTip(tr('The entered path does not exist')) updateBtn('') self.connect(self.edtWalletPath, SIGNAL('textChanged(QString)'), updateBtn) layoutMgmt.addLayout(layout_btnH, 14, 1, 1, 2) self.connect(self.btnRecover, SIGNAL('clicked()'), self.accept) self.connect(self.btnCancel , SIGNAL('clicked()'), self.reject) self.setLayout(layoutMgmt) self.layout().setSizeConstraint(QLayout.SetFixedSize) self.setWindowTitle('Wallet Recovery Tool') self.setMinimumWidth(550) def rdClicked(self): # TODO: Why does this do nohting? Was it a stub that was forgotten? LOGINFO("clicked") def promptWalletRecovery(self): """ Prompts the user with a window asking for wallet path and recovery mode. Proceeds to Recover the wallet. Prompt for password if the wallet is locked """ if self.exec_(): path = str(self.edtWalletPath.text()) mode = RECOVERMODE.Bare if self.rdbtnStripped.isChecked(): mode = RECOVERMODE.Stripped elif self.rdbtnFull.isChecked(): mode = RECOVERMODE.Full elif self.rdbtnCheck.isChecked(): mode = RECOVERMODE.Check if mode==RECOVERMODE.Full and self.selectedWltID: # Funnel all standard, full recovery operations through the # inconsistent-wallet-dialog. wlt = self.main.walletMap[self.selectedWltID] dlgRecoveryUI = DlgCorruptWallet(wlt, [], self.main, self, False) dlgRecoveryUI.exec_(dlgRecoveryUI.doFixWallets()) else: # This is goatpig's original behavior - preserved for any # non-loaded wallets or non-full recovery operations. if self.selectedWltID: wlt = self.main.walletMap[self.selectedWltID] else: wlt = path dlgRecoveryUI = DlgCorruptWallet(wlt, [], self.main, self, False) dlgRecoveryUI.exec_(dlgRecoveryUI.ProcessWallet(mode)) else: return False def selectFile(self): # Had to reimplement the path selection here, because the way this was # implemented doesn't let me access self.main.getFileLoad ftypes = 'Wallet files (*.wallet);; All files (*)' if not OS_MACOSX: pathSelect = unicode(QFileDialog.getOpenFileName(self, \ tr('Recover Wallet'), \ ARMORY_HOME_DIR, \ ftypes)) else: pathSelect = unicode(QFileDialog.getOpenFileName(self, \ tr('Recover Wallet'), \ ARMORY_HOME_DIR, \ ftypes, \ options=QFileDialog.DontUseNativeDialog)) self.edtWalletPath.setText(pathSelect) ############################################################################### class DlgProgress(ArmoryDialog): """ Progress bar dialog. The dialog is guaranteed to be created from the main thread. The dialog is modal, meaning all other windows are barred from user interaction as long as this dialog is within its message loop. The message loop is entered either through exec_(side_thread), which will which will lock the main threa and the caller thread, and join on the side thread The dialog reject() signal is overloaded to render it useless. The dialog cannot be killed through regular means. To kill the Dialog, call Kill() or end the side thread. Either will release the main thread. The caller will still join on the side thread if you only call Kill() To make a progress dialog that can be killed by the user (before the process is complete), pass a string to Interrupt. It will add a push button with that text, that will kill the progress dialog on click. The caller will still be joining on the side thread. Passing a string to Title will draw a title. Passing an integer to HBar will draw a progress bar with a Max value set to that integer. It can be updated through UpdateHBar(int) Passing a string TProgress will draw a label with that string. It can be updated through UpdateText(str) """ def __init__(self, parent=None, main=None, Interrupt=None, HBar=None, Title=None, TProgress=None): self.running = 1 self.Done = 0 self.status = 0 self.main = main self.parent = parent self.Interrupt = Interrupt self.HBar = HBar self.Title = Title self.TProgress = None self.procressDone = False self.lock = threading.Lock() self.condVar = threading.Condition(self.lock) self.btnStop = None if main is not None: main.emit(SIGNAL('initTrigger'), self) else: return while self.status == 0: time.sleep(0.01) self.connectDlg() def connectDlg(self): self.connect(self, SIGNAL('Update'), self.UpdateDlg) self.connect(self, SIGNAL('PromptPassphrase'), self.PromptPassphrase) self.connect(self, SIGNAL('Exit'), self.Exit) def UpdateDlg(self, text=None, HBar=None, Title=None): if text is not None: self.lblDesc.setText(text) if HBar is not None: self.hbarProgress.setValue(HBar) if self.Done == 1: if self.btnStop is not None: self.btnStop.setText('Close') else: self.Kill() def UpdateText(self, updatedText, endProgress=False): self.Done = endProgress if self.main is None: return self.running self.emit(SIGNAL('Update'), updatedText, None) return self.running def UpdateHBar(self, value, maxVal, endProgress=False): self.Done = endProgress if self.main is None: return self.running progressVal = 100*value/maxVal self.emit(SIGNAL('Update'), None, self.HBarCount*100 +progressVal) if progressVal >= 100: self.HBarCount = self.HBarCount + 1 return self.running def AskUnlock(self, wll): self.condVar.acquire() self.emit(SIGNAL('PromptPassphrase'), wll) self.condVar.wait() self.condVar.release() return self.Passphrase def PromptPassphrase(self, wll): self.condVar.acquire() dlg = DlgUnlockWallet(wll, self, self.main, "Enter Passphrase", returnPassphrase=True) self.Passphrase = None self.GotPassphrase = 0 if dlg.exec_(): #grab plain passphrase if dlg.Accepted == 1: self.Passphrase = dlg.securePassphrase.copy() dlg.securePassphrase.destroy() self.condVar.notify() self.condVar.release() def Kill(self): if self.main: self.emit(SIGNAL('Exit')) def Exit(self): self.running = 0 self.done(0) def exec_(self, *args, **kwargs): ''' If args[0] is a function, it will be called in exec_thread args[1:] is the argument list for that function will return the functions output in exec_thread.output, which is then returned by exec_ ''' exec_thread = PyBackgroundThread(self.exec_async, *args, **kwargs) exec_thread.start() self.main.emit(SIGNAL('execTrigger'), self) exec_thread.join() if exec_thread.didThrowError(): exec_thread.raiseLastError() else: return exec_thread.output def exec_async(self, *args, **kwargs): if len(args) > 0 and hasattr(args[0], '__call__'): func = args[0] if not 'Progress' in kwargs: if self.HBar > 0: kwargs['Progress'] = self.UpdateHBar else: kwargs['Progress'] = self.UpdateText try: rt = func(*args[1:], **kwargs) except Exception as e: self.Kill() raise e pass self.Kill() return rt def reject(self): return def setup(self, parent=None): super(DlgProgress, self).__init__(parent, self.main) css = """ QDialog{ border:1px solid rgb(0, 0, 0); } QProgressBar{ text-align: center; font-weight: bold; } """ self.setStyleSheet(css) layoutMgmt = QVBoxLayout() self.lblDesc = QLabel('') if self.Title is not None: if not self.HBar: self.lblTitle = QLabel(self.Title) self.lblTitle.setAlignment(Qt.AlignCenter) layoutMgmt.addWidget(self.lblTitle) if self.HBar is not None: self.hbarProgress = QProgressBar(self) self.hbarProgress.setMaximum(self.HBar*100) self.hbarProgress.setMinimum(0) self.hbarProgress.setValue(0) self.hbarProgress.setMinimumWidth(250) layoutMgmt.addWidget(self.hbarProgress) self.HBarCount = 0 if self.HBar: self.hbarProgress.setFormat(self.Title +': %p%') else: layoutMgmt.addWidget(self.lblDesc) if self.Interrupt is not None: self.btnStop = QPushButton(self.Interrupt) self.connect(self.btnStop, SIGNAL('clicked()'), self.Kill) layout_btnG = QGridLayout() layout_btnG.setColumnStretch(0, 1) layout_btnG.setColumnStretch(4, 1) layout_btnG.addWidget(self.btnStop, 0, 1, 1, 3) layoutMgmt.addLayout(layout_btnG) self.minimize = None self.setWindowFlags(Qt.Window | Qt.FramelessWindowHint) self.setModal(True) self.setLayout(layoutMgmt) self.adjustSize() btmRight = self.parent.rect().bottomRight() topLeft = self.parent.rect().topLeft() globalbtmRight = self.parent.mapToGlobal((btmRight+topLeft)/2) self.move(globalbtmRight - QPoint(self.width()/2, self.height())) if self.Title: self.setWindowTitle(self.Title) else: self.setWindowTitle('Progress Bar') self.hide() ################################################################################# class DlgCorruptWallet(DlgProgress): def __init__(self, wallet, status, main=None, parent=None, alreadyFailed=True): super(DlgProgress, self).__init__(parent, main) self.connectDlg() self.main = main self.walletList = [] self.logDirs = [] self.running = 1 self.status = 1 self.isFixing = False self.needToSubmitLogs = False self.checkMode = RECOVERMODE.NotSet self.lock = threading.Lock() self.condVar = threading.Condition(self.lock) mainLayout = QVBoxLayout() self.connect(self, SIGNAL('UCF'), self.UCF) self.connect(self, SIGNAL('Show'), self.show) self.connect(self, SIGNAL('Exec'), self.run_lock) self.connect(self, SIGNAL('SNP'), self.setNewProgress) self.connect(self, SIGNAL('LFW'), self.LFW) self.connect(self, SIGNAL('SRD'), self.SRD) if alreadyFailed: titleStr = tr('Wallet Consistency Check Failed!') else: titleStr = tr('Perform Wallet Consistency Check') lblDescr = QRichLabel(tr(""" %s

Armory software now detects and prevents certain kinds of hardware errors that could lead to problems with your wallet.
""") % (htmlColor('TextWarn'), titleStr)) lblDescr.setAlignment(Qt.AlignCenter) if alreadyFailed: self.lblFirstMsg = QRichLabel(tr(""" Armory has detected that wallet file Wallet "%s" (%s) is inconsistent and should be further analyzed to ensure that your funds are protected.

This error will pop up every time you start Armory until the wallet has been analyzed and fixed!""") % \ (wallet.labelName, wallet.uniqueIDB58, htmlColor('TextWarn'))) elif isinstance(wallet, PyBtcWallet): self.lblFirstMsg = QRichLabel(tr(""" Armory will perform a consistency check on Wallet "%s" (%s) and determine if any further action is required to keep your funds protected. This check is normally performed on startup on all your wallets, but you can click below to force another check.""") % (wallet.labelName, wallet.uniqueIDB58)) else: self.lblFirstMsg = QRichLabel('') self.QDS = QDialog() self.lblStatus = QLabel('') self.addStatus(wallet, status) self.QDSlo = QVBoxLayout() self.QDS.setLayout(self.QDSlo) self.QDSlo.addWidget(self.lblFirstMsg) self.QDSlo.addWidget(self.lblStatus) self.lblStatus.setVisible(False) self.lblFirstMsg.setVisible(True) saStatus = QScrollArea() saStatus.setWidgetResizable(True) saStatus.setWidget(self.QDS) saStatus.setMinimumHeight(250) saStatus.setMinimumWidth(500) layoutButtons = QGridLayout() layoutButtons.setColumnStretch(0, 1) layoutButtons.setColumnStretch(4, 1) self.btnClose = QPushButton('Hide') self.btnFixWallets = QPushButton('Run Analysis and Recovery Tool') self.btnFixWallets.setDisabled(True) self.connect(self.btnFixWallets, SIGNAL('clicked()'), self.doFixWallets) self.connect(self.btnClose, SIGNAL('clicked()'), self.hide) layoutButtons.addWidget(self.btnClose, 0, 1, 1, 1) layoutButtons.addWidget(self.btnFixWallets, 0, 2, 1, 1) self.lblDescr2 = QRichLabel('') self.lblDescr2.setAlignment(Qt.AlignCenter) self.lblFixRdy = QRichLabel(tr(""" Your wallets will be ready to fix once the scan is over
You can hide this window until then
""")) self.lblFixRdy.setAlignment(Qt.AlignCenter) self.frmBottomMsg = makeVertFrame(['Space(5)', HLINE(), self.lblDescr2, self.lblFixRdy, HLINE()]) self.frmBottomMsg.setVisible(False) mainLayout.addWidget(lblDescr) mainLayout.addWidget(saStatus) mainLayout.addWidget(self.frmBottomMsg) mainLayout.addLayout(layoutButtons) self.setLayout(mainLayout) self.layout().setSizeConstraint(QLayout.SetFixedSize) self.setWindowTitle('Wallet Error') def addStatus(self, wallet, status): if wallet: strStatus = ''.join(status) + str(self.lblStatus.text()) self.lblStatus.setText(strStatus) self.walletList.append(wallet) def show(self): super(DlgCorruptWallet, self).show() self.activateWindow() def run_lock(self): self.btnClose.setVisible(False) self.hide() super(DlgProgress, self).exec_() self.walletList = None def UpdateCanFix(self, conditions, canFix=False): self.emit(SIGNAL('UCF'), conditions, canFix) def UCF(self, conditions, canFix=False): self.lblFixRdy.setText('') if canFix: self.btnFixWallets.setEnabled(True) self.btnClose.setText('Close') self.btnClose.setVisible(False) self.connect(self.btnClose, SIGNAL('clicked()'), self.reject) self.hide() def doFixWallets(self): self.lblFixRdy.hide() self.adjustSize() self.lblStatus.setVisible(True) self.lblFirstMsg.setVisible(False) self.frmBottomMsg.setVisible(False) from armoryengine.PyBtcWalletRecovery import FixWalletList self.btnClose.setDisabled(True) self.btnFixWallets.setDisabled(True) self.isFixing = True self.lblStatus.hide() self.QDSlo.removeWidget(self.lblStatus) for wlt in self.walletList: self.main.removeWalletFromApplication(wlt.uniqueIDB58) FixWalletList(self.walletList, self, Progress=self.UpdateText, async=True) self.adjustSize() def ProcessWallet(self, mode=RECOVERMODE.Full): ''' Serves as the entry point for non processing wallets that arent loaded or fully processed. Only takes 1 wallet at a time ''' if len(self.walletList) > 0: wlt = None wltPath = '' if isinstance(self.walletList[0], str): wltPath = self.walletList[0] else: wlt = self.walletList[0] self.lblDesc = QLabel('') self.QDSlo.addWidget(self.lblDesc) self.lblFixRdy.hide() self.adjustSize() self.frmBottomMsg.setVisible(False) self.lblStatus.setVisible(True) self.lblFirstMsg.setVisible(False) from armoryengine.PyBtcWalletRecovery import ParseWallet self.btnClose.setDisabled(True) self.btnFixWallets.setDisabled(True) self.isFixing = True self.checkMode = mode ParseWallet(wltPath, wlt, mode, self, Progress=self.UpdateText, async=True) def UpdateDlg(self, text=None, HBar=None, Title=None): if text is not None: self.lblDesc.setText(text) self.adjustSize() def accept(self): self.main.emit(SIGNAL('checkForNegImports')) super(DlgCorruptWallet, self).accept() def reject(self): if not self.isFixing: super(DlgProgress, self).reject() self.main.emit(SIGNAL('checkForNegImports')) def sigSetNewProgress(self, status): self.emit(SIGNAL('SNP'), status) def setNewProgress(self, status): self.lblDesc = QLabel('') self.QDSlo.addWidget(self.lblDesc) #self.QDS.adjustSize() status[0] = 1 def setRecoveryDone(self, badWallets, goodWallets, fixedWallets, fixers): self.emit(SIGNAL('SRD'), badWallets, goodWallets, fixedWallets, fixers) def SRD(self, badWallets, goodWallets, fixedWallets, fixerObjs): self.btnClose.setEnabled(True) self.btnClose.setVisible(True) self.btnClose.setText('Continue') self.btnFixWallets.setVisible(False) self.btnClose.disconnect(self, SIGNAL('clicked()'), self.hide) self.btnClose.connect(self, SIGNAL('clicked()'), self.accept) self.isFixing = False self.frmBottomMsg.setVisible(True) anyNegImports = False for fixer in fixerObjs: if len(fixer.negativeImports) > 0: anyNegImports = True break if len(badWallets) > 0: self.lblDescr2.setText(tr(""" Failed to fix wallets!""") % \ htmlColor('TextWarn')) self.main.statusBar().showMessage('Failed to fix wallets!', 150000) elif len(goodWallets) == len(fixedWallets) and not anyNegImports: pluralStr = ' is' if len(goodWallets)==1 else 's are' self.lblDescr2.setText(tr(""" Wallet%s consistent, nothing to fix.""") % (htmlColor("TextBlue"), pluralStr)) self.main.statusBar().showMessage(tr(""" Wallet%s consistent!""") % \ pluralStr, 15000) elif len(fixedWallets) > 0 or anyNegImports: if self.checkMode != RECOVERMODE.Check: self.lblDescr2.setText(tr(""" There may still be issues with your wallet!
It is important that you send us the recovery logs and an email address so the Armory team can check for further risk to your funds!""") % \ (htmlColor('TextWarn'))) #self.main.statusBar().showMessage('Wallets fixed!', 15000) else: self.lblDescr2.setText('

\ Consistency check failed!

') self.adjustSize() def loadFixedWallets(self, wallets): self.emit(SIGNAL('LFW'), wallets) def LFW(self, wallets): for wlt in wallets: newWallet = PyBtcWallet().readWalletFile(wlt) self.main.addWalletToApplication(newWallet, walletIsNew=True) if TheBDM.getBDMState() in ('Uninitialized', 'Offline'): TheBDM.registerWallet(newWallet, isFresh=True, wait=False) else: self.main.newWalletList.append([newWallet, True]) self.main.emit(SIGNAL('checkForkedImport')) # Decided that we can just add all the logic to #def checkForkedSubmitLogs(self): #forkedImports = [] #for wlt in self.walletMap: #if self.walletMap[wlt].hasForkedImports: #dlgIWR = DlgInconsistentWltReport(self, self.main, self.logDirs) #if dlgIWR.exec_(): #return #return ################################################################################# class DlgFactoryReset(ArmoryDialog): def __init__(self, main=None, parent=None): super(DlgFactoryReset, self).__init__(parent, main) lblDescr = QRichLabel(tr(""" Armory Factory Reset

It is strongly recommended that you make backups of your wallets before continuing, though wallet files will never be intentionally deleted! All Armory wallet files, and the wallet.dat file used by Bitcoin-Qt/bitcoind should remain untouched in their current locations. All Armory wallets will automatically be detected and loaded after the reset.

If you are not sure which option to pick, try the "lightest option" first, and see if your problems are resolved before trying the more extreme options.""")) self.rdoSettings = QRadioButton() self.lblSettingsText = QRichLabel(tr(""" Delete settings and rescan (lightest option)""")) self.lblSettings = QRichLabel(tr(""" Only delete the settings file and transient network data. The databases built by Armory will be rescanned (about 5-45 minutes)""")) self.rdoArmoryDB = QRadioButton() self.lblArmoryDBText = QRichLabel(tr(""" Also delete databases and rebuild""")) self.lblArmoryDB = QRichLabel(tr(""" Will delete settings, network data, and delete and Armory's databases, forcing a rebuild and rescan (45 min to 3 hours)""")) self.rdoBitcoinDB = QRadioButton() self.lblBitcoinDBText = QRichLabel(tr(""" Also re-download the blockchain (most extreme)""")) self.lblBitcoinDB = QRichLabel(tr(""" This will delete settings, network data, Armory's databases, and the Bitcoin software databases. Bitcoin-Qt/bitcoind will have to download the 15+ GB blockchain again. Only use this if you suspect blockchain corruption, such as receiving StdOut/StdErr errors on the dashboard (8-72 hours depending on your connection)""")) self.chkSaveSettings = QCheckBox('Do not delete settings files') optFrames = [] for rdo,txt,lbl in [ \ [self.rdoSettings, self.lblSettingsText, self.lblSettings], \ [self.rdoArmoryDB, self.lblArmoryDBText, self.lblArmoryDB], \ [self.rdoBitcoinDB, self.lblBitcoinDBText, self.lblBitcoinDB]]: optLayout = QGridLayout() txt.setWordWrap(False) optLayout.addWidget(makeHorizFrame([rdo, txt, 'Stretch'])) optLayout.addWidget(lbl, 1,0, 1,3) if len(optFrames)==2: # Add option to disable deleting settings, on most extreme option optLayout.addWidget(self.chkSaveSettings, 2,0, 1,3) optFrames.append(QFrame()) optFrames[-1].setLayout(optLayout) optFrames[-1].setFrameStyle(STYLE_RAISED) self.rdoSettings.setChecked(True) btngrp = QButtonGroup(self) btngrp.addButton(self.rdoSettings) btngrp.addButton(self.rdoArmoryDB) btngrp.addButton(self.rdoBitcoinDB) frmDescr = makeHorizFrame([lblDescr], STYLE_SUNKEN) frmOptions = makeVertFrame(optFrames, STYLE_SUNKEN) self.btnOkay = QPushButton(tr('Continue')) self.btnCancel = QPushButton(tr('Cancel')) buttonBox = QDialogButtonBox() buttonBox.addButton(self.btnOkay, QDialogButtonBox.AcceptRole) buttonBox.addButton(self.btnCancel, QDialogButtonBox.RejectRole) self.connect(self.btnOkay, SIGNAL(CLICKED), self.clickedOkay) self.connect(self.btnCancel, SIGNAL(CLICKED), self.reject) layout = QVBoxLayout() layout.addWidget(frmDescr) layout.addWidget(frmOptions) layout.addWidget(buttonBox) self.setLayout(layout) self.setMinimumWidth(600) self.setWindowTitle(tr('Factory Reset')) self.setWindowIcon(QIcon(self.main.iconfile)) ### def clickedOkay(self): if self.rdoSettings.isChecked(): reply = QMessageBox.warning(self, tr('Confirmation'), tr(""" You are about to delete your settings and force Armory to rescan its databases. Are you sure you want to do this?"""), \ QMessageBox.Cancel | QMessageBox.Ok) if not reply==QMessageBox.Ok: self.reject() return touchFile( os.path.join(ARMORY_HOME_DIR, 'rescan.flag') ) touchFile( os.path.join(ARMORY_HOME_DIR, 'clearmempool.flag')) touchFile( os.path.join(ARMORY_HOME_DIR, 'delsettings.flag')) self.accept() elif self.rdoArmoryDB.isChecked(): reply = QMessageBox.warning(self, tr('Confirmation'), tr(""" You are about to delete your settings and force Armory to delete and rebuild its databases. Are you sure you want to do this?"""), \ QMessageBox.Cancel | QMessageBox.Ok) if not reply==QMessageBox.Ok: self.reject() return touchFile( os.path.join(ARMORY_HOME_DIR, 'rebuild.flag') ) touchFile( os.path.join(ARMORY_HOME_DIR, 'clearmempool.flag')) touchFile( os.path.join(ARMORY_HOME_DIR, 'delsettings.flag')) self.accept() elif self.rdoBitcoinDB.isChecked(): delSetText = 'delete your settings and ' if self.chkSaveSettings.isChecked(): delSetText = '' reply = QMessageBox.warning(self, tr('Confirmation'), tr(""" You are about to %sdelete all blockchain databases on your system. The Bitcoin software will have to redownload 15+ GB of blockchain data over the peer-to-peer network again which can take from 8 to 72 hours depending on your system speed and connection.

Are you absolutely sure you want to do this?""") % delSetText, \ QMessageBox.Cancel | QMessageBox.Yes) if not reply==QMessageBox.Yes: QMessageBox.warning(self, tr('Aborted'), tr(""" You canceled the factory reset operation. No changes were made."""), QMessageBox.Ok) self.reject() return if not self.main.settings.get('ManageSatoshi'): # Must have user shutdown Bitcoin sw now, and delete DBs now reply = MsgBoxCustom(MSGBOX.Warning, tr('Restart Armory'), tr(""" Bitcoin-Qt (or bitcoind) must be closed to do the reset! Please close all Bitcoin software, right now, before clicking "Continue".

Armory will now close. Please restart Bitcoin-Qt/bitcoind first and wait for it to finish synchronizing before restarting Armory."""), wCancel=True, yesStr="Continue") if not reply: QMessageBox.warning(self, tr('Aborted'), tr(""" You canceled the factory-reset operation. No changes were made."""), QMessageBox.Ok) self.reject() return # Do the delete operation now deleteBitcoindDBs() else: reply = QMessageBox.warning(self, tr('Restart Armory'), tr(""" Armory will now close to apply the requested changes. Please restart it when you are ready to start the blockchain download again."""), QMessageBox.Ok) if not reply == QMessageBox.Ok: QMessageBox.warning(self, tr('Aborted'), tr(""" You canceled the factory reset operation. No changes were made."""), QMessageBox.Ok) self.reject() return touchFile( os.path.join(ARMORY_HOME_DIR, 'redownload.flag') ) # Always flag the rebuild, and del mempool and settings touchFile( os.path.join(ARMORY_HOME_DIR, 'rebuild.flag') ) touchFile( os.path.join(ARMORY_HOME_DIR, 'clearmempool.flag')) touchFile( os.path.join(ARMORY_HOME_DIR, 'cleartorrent.flag')) if not self.chkSaveSettings.isChecked(): touchFile( os.path.join(ARMORY_HOME_DIR, 'delsettings.flag')) self.accept() QMessageBox.information(self, tr('Restart Armory'), tr(""" Armory will now close so that the requested changes can be applied."""), QMessageBox.Ok) self.accept() ################################################################################# class DlgForkedImports(ArmoryDialog): def __init__(self, walletList, main=None, parent=None): super(DlgForkedImports, self).__init__(parent, main) descr1 = '

Forked imported addresses have been \ detected in your wallets!!!

' descr2 = 'The following wallets have forked imported addresses:

' + \ '
'.join(walletList) + '' descr3 = 'When you fix a corrupted wallet, any damaged private keys will be off \ the determinstic chain. It means these private keys cannot be recreated \ by your paper backup. If such private keys are encountered, Armory saves \ them as forked imported private keys after it fixes the relevant wallets.' descr4 = '

- Do not accept payments to these wallets anymore
\ - Do not delete or overwrite these wallets.
\ - Transfer all funds to a fresh and backed up wallet

' lblDescr1 = QRichLabel(descr1) lblDescr2 = QRichLabel(descr2) lblDescr3 = QRichLabel(descr3) lblDescr4 = QRichLabel(descr4) layout2 = QVBoxLayout() layout2.addWidget(lblDescr2) frame2 = QFrame() frame2.setLayout(layout2) frame2.setFrameStyle(QFrame.StyledPanel) layout4 = QVBoxLayout() layout4.addWidget(lblDescr4) frame4 = QFrame() frame4.setLayout(layout4) frame4.setFrameStyle(QFrame.StyledPanel) self.btnOk = QPushButton('Ok') self.connect(self.btnOk, SIGNAL('clicked()'), self.accept) layout = QVBoxLayout() layout.addWidget(lblDescr1) layout.addWidget(frame2) layout.addWidget(lblDescr3) layout.addWidget(frame4) layout.addWidget(self.btnOk) self.setLayout(layout) self.setMinimumWidth(600) self.setWindowTitle('Forked Imported Addresses') ### ################################################################################ class DlgBroadcastBlindTx(ArmoryDialog): def __init__(self, main=None, parent=None): super(DlgBroadcastBlindTx, self).__init__(parent, main) self.pytx = None lblDescr = QRichLabel(tr(""" Copy a raw, hex-encoded transaction below to have Armory broadcast it to the Bitcoin network. This function is provided as a convenience to expert users, and carries no guarantees of usefulness.

Specifically, be aware of the following limitations of this broadcast function:
  • The transaction will be "broadcast" by sending it to the connected Bitcon Core instance which will forward it to the rest of the Bitcoin network. However, if the transaction is non-standard or does not satisfy standard fee rules, Bitcoin Core will drop it and it will never be seen by the Bitcoin network.
  • There will be no feedback as to whether the transaction succeeded. You will have to verify the success of this operation via other means. However, if the transaction sends funds directly to or from an address in one of your wallets, it will still generate a notification and show up in your transaction history for that wallet.
""")) self.txtRawTx = QPlainTextEdit() self.txtRawTx.setFont(GETFONT('Fixed', 9)) w,h = relaxedSizeNChar(self.txtRawTx, 90) self.txtRawTx.setMinimumWidth(w) self.txtRawTx.setMinimumHeight(h*5) self.connect(self.txtRawTx, SIGNAL('textChanged()'), self.txChanged) lblTxInfo = QRichLabel(tr('Parsed Transaction:')) self.txtTxInfo = QPlainTextEdit() self.txtTxInfo.setFont(GETFONT('Fixed', 9)) self.txtTxInfo.setMinimumWidth(w) self.txtTxInfo.setMinimumHeight(h*7) self.txtTxInfo.setReadOnly(True) self.lblInvalid = QRichLabel('') self.btnCancel = QPushButton(tr("Cancel")) self.btnBroad = QPushButton(tr("Broadcast")) self.btnBroad.setEnabled(False) self.connect(self.btnCancel, SIGNAL('clicked()'), self.reject) self.connect(self.btnBroad, SIGNAL('clicked()'), self.doBroadcast) frmButtons = makeHorizFrame(['Stretch', self.btnCancel, self.btnBroad]) layout = QVBoxLayout() layout.addWidget(lblDescr) layout.addWidget(self.txtRawTx) layout.addWidget(lblTxInfo) layout.addWidget(self.txtTxInfo) layout.addWidget(self.lblInvalid) layout.addWidget(HLINE()) layout.addWidget(frmButtons) self.setLayout(layout) self.setWindowTitle(tr("Broadcast Raw Transaction")) ############################################################################# def txChanged(self): try: txt = str(self.txtRawTx.toPlainText()).strip() txt = ''.join(txt.split()) # removes all whitespace self.pytx = PyTx().unserialize(hex_to_binary(txt)) self.txtTxInfo.setPlainText(self.pytx.toString()) LOGINFO('Valid tx entered:') LOGINFO(self.pytx.toString()) self.setReady(True) except: LOGEXCEPT('Failed to parse tx') self.setReady(False) self.pytx = None ############################################################################# def setReady(self, isTrue): self.btnBroad.setEnabled(isTrue) self.lblInvalid.setText("") if not isTrue: self.txtTxInfo.setPlainText('') if len(str(self.txtRawTx.toPlainText()).strip()) > 0: self.lblInvalid.setText(tr("""Raw transaction is invalid!""") % htmlColor('TextWarn')) ############################################################################# def doBroadcast(self): txhash = self.pytx.getHash() self.main.NetworkingFactory.sendTx(self.pytx) time.sleep(0.5) msg = PyMessage('getdata') msg.payload.invList.append( [MSG_INV_TX, txhash] ) self.main.NetworkingFactory.sendMessage(msg) hexhash = binary_to_hex(txhash, endOut=BIGENDIAN) if USE_TESTNET: linkToExplorer = 'http://blockexplorer.com/testnet/tx/%s' % hexhash dispToExplorer = 'http://blockexplorer.com/testnet/tx/%s...' % hexhash[:16] else: linkToExplorer = 'https://blockchain.info/search/%s' % hexhash dispToExplorer = 'https://blockchain.info/search/%s...' % hexhash[:16] QMessageBox.information(self, tr("Broadcast!"), tr(""" Your transaction was successfully sent to the local Bitcoin Core instance, though there is no guarantees that it was forwarded to the rest of the network. On testnet, just about every valid transaction will successfully propagate. On the main Bitcoin network, this will fail unless it was a standard transaction type. The transaction had the following hash:

%s

If this is test You can check whether it was seen by other nodes on the network blockchain.info (this link will not work on testnet):

%s""") % \ (hexhash, linkToExplorer, dispToExplorer), QMessageBox.Ok) self.accept() ################################################################################# class DlgPrivacyPolicy(ArmoryDialog): def __init__(self, main=None, parent=None, popupType='generic'): super(DlgPrivacyPolicy, self).__init__(parent, main) lblHeader = QRichLabel(tr(""" Armory Technologies, Inc. Privacy Policy"""), hAlign=Qt.AlignCenter) if popupType=='generic': descrTxt = tr(""" Unless explicitly disabled, Armory periodically contacts ATI servers for alerts and software updates. These checks expose your IP address, software version, and operating system to ATI servers, as well as any other servers in-route. No other information is collected without your explicit permission, which will be obtained when such information is requested, such as submitting a bug report with your log files.

By using this software and submitting this information to ATI, you are agreeing to the ATI privacy policy at the link below. The page also includes information about changing Armory's default privacy settings.""") elif popupType=='submitbug': descrTxt = tr(""" You are submitting a bug report to ATI servers. Your log files will be included unless you explicitly unselected it from the bug submission screen. Armory log files do not contain any security-sensitive information, but some users may consider the information to be privacy-sensitive. The log files may identify some addresses and transactions that are related to your wallets. No signing keys are ever written to the log file that would allow another party to move or spend your funds.

By using this software and submitting this information to ATI, you are agreeing to the ATI privacy policy at the link below.""") else: LOGERROR("Unknown popup type: %s", popupType) descrTxt = tr(""" By using this software and submitting this information to ATI, you are agreeing to the ATI privacy policy at the link below. The page also includes information about changing Armory's default privacy settings.

""") lblURL = QRichLabel(tr("""
%s

""") % \ (PRIVACY_URL, PRIVACY_URL), hAlign=Qt.AlignHCenter) lblURL.setOpenExternalLinks(True) lblDescr = QRichLabel(tr("""
%s""") % descrTxt) self.chkUserAgrees = QCheckBox(tr(""" I have read and agree to the ATI privacy policy""")) self.btnContinue = QPushButton('') self.connect(self.chkUserAgrees, SIGNAL('toggled(bool)'), self.btnContinue.setEnabled) self.connect(self.btnContinue, SIGNAL('clicked()'), self.accept) frmBtn = makeHorizFrame(['Stretch', self.btnContinue]) mainLayout = QVBoxLayout() mainLayout.addWidget(lblHeader) mainLayout.addWidget(lblDescr) mainLayout.addWidget(lblURL) mainLayout.addWidget(self.chkUserAgrees) mainLayout.addWidget(frmBtn) self.setLayout(mainLayout) if popupType=='submitbug': self.chkUserAgrees.setVisible(True) self.chkUserAgrees.setChecked(False) self.btnContinue.setEnabled(False) self.btnContinue.setText(tr('Continue')) else: self.chkUserAgrees.setVisible(False) self.chkUserAgrees.setChecked(False) self.btnContinue.setEnabled(True) self.btnContinue.setText(tr('Ok')) self.setWindowTitle(tr("Privacy Policy")) # Put circular imports at the end from ui.WalletFrames import SelectWalletFrame, WalletBackupFrame,\ AdvancedOptionsFrame from ui.TxFrames import SendBitcoinsFrame, SignBroadcastOfflineTxFrame,\ ReviewOfflineTxFrame from ui.MultiSigDialogs import DlgMultiSpendReview armory-0.92.3/README0000644000000000000000000001116312414772654012512 0ustar rootroot################################################################################ # # # Copyright (C) 2011-2014, Armory Technologies, Inc. # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ ******************************************************************************** * * Project: Armory * Author: Alan Reiner * Orig Date: 13 July, 2011 * Descr: Armory is a full-featured Bitcoin client, offering a dozen * innovative features not found in any other client software! * Manage multiple wallets (deterministic and watching-only), * print paper backups that work forever, import or sweep private * keys, and keep your savings in a computer that never touches * the internet, while still being able to manage incoming payments, * and create outgoing payments with the help of a USB key. * * Multi-signature transactions are accommodated under-the-hood * about 80%, and will be completed and integrated into the UI soon. * * ***Armory has no independent networking components built in. * Instead, it relies on on the Satoshi client to securely connect * to peers, validate blockchain data, and broadcast transactions * for us. Although it was initially planned to cut the umbilical * cord to the Satoshi client and implement independent networking, * it has turned out to be an inconvenience worth having. * Reimplementing all the networking code would be fraught with bugs, * security holes, and possible blockchain forking. The reliance * on Bitcoin-Qt right now is actually making Armory more secure! * * ******************************************************************************** * * Please take a moment to donate 1.0 BTC! 1ArmoryXcfq7TnCSuZa9fQjRYwJ4bkRKfv * ******************************************************************************** * * * Building Armory from Source: * http://bitcoinarmory.com/index.php/building-armory-from-source * * ******************************************************************************** * * Armory contains over 25,000 lines of code, between the C++ and python * libraries. This can be very confusing for someone unfamiliar with the * code (you). Below I have attempted to illustrate the CONOPS (concept of * operations) that the library was designed for, so you know how to use it * in your own development activities. There is a TON of sample code in * the following three files: * * [ C++ ] cppForSwig/BlockUtilsTest.cpp * [ Python ] unittest.py, extras/sample_armory_code.py * * But of course, sample code alone does not make great documentation. I will * attempt to provide reference info for everything else you need to know, here. * For a list of library features, see the STATUS table in the README. Note * that all features with an X in either column are accessible in SWIG. * ******************************************************************************** * *** Dependencies *** - Crypto++ Linux: Install package "libcrypto++-dev" Windows: Download from "http://www.cryptopp.com/#download" - SWIG Linux: Install package "swig" Windows: "http://www.swig.org/download.html" (MSVS: Copy swigwin-2.x directory next to cryptopp as "swigwin") - Python 2.6/2.7 Linux: Should be preinstalled... Windows: "http://www.python.org/getit/" - Python Twisted -- asynchronous networking Linux: Install package 'python-twisted' Windows: "http://twistedmatrix.com/trac/wiki/Downloads" - PyQt 4 (for Python 2.X) Linux: Install "libqtcore4", "libqt4-dev" and "python-qt4" Windows: "http://www.riverbankcomputing.co.uk/software/pyqt/download" - qt4reactor.py -- combined eventloop for PyQt and Twisted All OS: https://launchpad.net/qt4reactor Windows Only: qt4reactor relies on pywin32 (for win32event module) http://sourceforge.net/projects/pywin32/files/pywin32/ - pywin32 - py2exe (OPTIONAL - if you want to make a standalone executable in Windows) Windows: http://www.py2exe.org/ armory-0.92.3/txjsonrpc/0000755000000000000000000000000012414772654013662 5ustar rootrootarmory-0.92.3/txjsonrpc/ChangeLog0000644000000000000000000002107312414772654015437 0ustar rootroot2012.01.06 * Added a Makefile that will eventually replace the admin scripts. * Added *ignore files. * Updated Makefile with improved (and more) targets as well as support for both bzr and git. * Added a silly version script (used by the Makefile). * Fixed the MANIFEST.in file (this addresses a long-standing bug in this version of txJSON-RPC). * Incremented the version number due to the bug fix for the included docs in the source build. * Fixed the virtual-env build make target. * Fixed up the dist util module to account for the renamed README. * Fixed the json import for modern versions of Python. * Removed web2 support. * Updated HISTORY file. 2009.11.09 * Removed the version hack and determined version of the request made to the server by message format/spec support. 2009.11.08 * Added import checks in auth.py. * Added test case for auth imports. * Fixed up the import unit tests with reloads. * Added unit tests for realm test case. * Restructured the get* methods for the web and web2 modules. * Added unit tests for wrapped resource test case. * Removed version 1 test methods in JSONRPC test case. * Added unit tests for jsonrpclib.dumps. * Added unit tests for jsonrpc.BaseProxy. * Updated defs with svn branch. * Added unit tests for base query factory. * Started a test case for the jsonrpclib loads function. * Fixed the server's render callback where the version was being passed as unicode instead of an int. * Touched up a unit test. * Updated the spec docs with a change. 2009.11.07 * Added authentication support with cred for twisted.web2-based JSON-RPC reources. * Updated history file. * Added test case for auth imports. 2009.11.06 * Reverted trunk to pre-version-work point. * Cherry-picked the change that added missing deferred returns in two tests. * Cherry-picked the change that added the testing helper subpackage. * Cherry-picked the change that added the doctest runner. * Cherry-picked changes to the examples and updated the example-runner. * Added authentication infrasturcture so that twisted.web-based txJSON-RPC servers can be written to support twisted.cred. 2009.10.22 * Added support for version 1.0 of the JSON-RPC spec to jsonrpclib. * Finished the pre-version 1.0 spec. * Updated the version 1.0 spec with response examples. * Updated web and web2 JSON-RPC to extract and pass the id and version parameters. 2009.10.21 * Updated the QueryFactory to take a version parameter in the constructor. * Added a payload creator that uses the version to determine which payload to build. * Changed the constructor to use a new private method for creating the payload. * Changed the async Proxy classes in web and netstring to accept a version parameter in the constructor as well as in the callRemote method. * Updated license file with more recent copyright info. * Added an exmaple for web client. * Updated netstring JSON-RPC with support for version parameters in contructor and callRemote. * Added a jsonrpc module for abstracting base-classes and removing redundancy between the three JSON-RPC implementations. * Added a BaseProxy class. * Import cleanup. * Moved more common methods into the base query factory class. * Created a BaseSubhandler subclass for http and netstring RPC classes. * Removed session code from netstring RPC test. * Moved introspection into base module. * Changed introspection to behave like a mixin instead of a subclass. * Updated JSON-RPC web2 to use new base classes. * Updated JSON-RPC web2's Introspection class to use the base introspection class. 2009.10.20 * Added clean.sh admin script. * Cleaned up TODO file. * Updated meta file with more data and incremented the version to 0.3. * Added utils subpackage. * Updated setup.py to use the new utils subpackage. * Added docs. * Updated README. * Cleaned up lots of unused imports. * Formatting tweaks. * Added a call to strip for the help-string-returning methods. * Added a maxLength attribute to QueryFactory for custom settings by users. * Updated proxy to instantiate QueryFactory with an optional maxLength override. * Updated history file. * Cleaned up examples. * Added an admin script for testing examples. * Updated the commit script to run the exmaple tests. * Added missing error handling in commit script. * Added PYTHONPATH to example runner commands. * Removed PYTHONPATH from admin/defs.sh. * Removed debugging echo statement from commit.sh. * Removed manual PYTHONPATH setting in example runner. * Formatting tweaks. * Updated TODO and README. * Added admin upload script. * Added placeholders for version spec files. * Added missing deferred returns in two tests. * Added testing helper subpackage. * Added doctest runner. * Added manifest file. * Updated the commit script to run the doctest runner. * Added headings to the spec files. * Added request info to the specs. * Added versioned request functions to jsonrpclib.py and updated the ServerProxy with a version-sensitive dispatcher. * Removed non-pertinent sections from pre-version 1 spec. 2008.11.10 * Added a test for None/null. * Added a serializer for Python datetime -> JSON. * Updated the version. * Updated the commitAndPush script to pass the skip_tests parameter (and fixed its filename extention). * Added missing sudo to cleanup function. * Removed unused clean script (and made sure that the other scripts use the clean function). * Converted checkBuild to function and removed script. * Made the error function take a message parameter. * Updated the bzr push command for svn. * Fixed failing test for new "none" check. * Removed sudo calls from admin scripts. * Updated the ChangeLog with missing notes from earlier today. * Moved version info into meta package file. 2008.07.18 * Added more admin scripts. 2008.07.16 * Applied a patch from Moshe Zadka: "When getting a long reply, the client library, using code from xmlrpclib, will attempt to call feed multiple times with partial messages. The supplied parser assumes feed will only be called with a complete message." 2008.06.15 * Added Fault class. * Updated SimpleParser to properly return results when using jsonrpclib (synchronous, blocking code). * Added Transport and ServerProxy. * Added web example (in addition to the already-extant web2 example). * Removed extraneous print/debug code. * Incremented version number. * Added missing NOT_FOUND to web.jsonrpc. * Updated the version number. 2008.06.14 * Removed extraneous while space. * Added NoSuchFunction class. 2008.06.11 * Updated the commit script to work with bzr-svn. * Added a path hack to commit.sh for running trial. * Renamed adytum to txjsonrpc. * Moved web and web2 up and renamed twisted to netstring. * Removed .pyc files. * Tweaked the commit script. * Added license. * Removed ez_setup.py. * Updated TODO. * Renamed the main package from adytum to txjsonrpc. * Updated setup.py. * Removed ez_setup support. * Removed setuptools support. * Changed to the new way of flushing logs in twisted.trial. * Adjusted tests to use the new package and subpackage names. * Adjusted examples to use the new package and subpackage names. * Incremented the version number. * Removed trial path hack from commit.sh. * Test commit to svn and bzr from a freshly checked out branch. * Cool! It worked. Removed testfile. * Changed the commit script to point to 'main' on launchpad. * One more change to the launchpad destination in the commit script. * Updated the stat script to use bzr instead of svn. 2006.05.07 * Added a.t.jsonrpc.RPCFactory to __all__. * Renamed some of the variables in the examples to be more accurate. 2006.05.06 * Added a beginning sketch of JSON over TCP in protocols.json. * Some protocol tweaks. * Added test top-level directory as well as an adytum.twisted-level test directory. * Converted a.t.w2.jsonrpc and the client portion of a.t.w.jsonrpc to use the NetstringReceiver protocol for JSON-RPC over TCP. * Removed protocol code, since we don't need a custom protocol for JSON-RCP over TCP. * Commented out the support for returning a dict with keys "result" and "error" as it seems like unessary overhead for now. Someone convince me otherwise, and I'll put it back in. * Changed methodology for adding subhandlers. * Fixed introspection. 2006.05.05 * Added directory place holders and __init__.py files. * Added basic files. * Copied jsonrpc.py from the adytum library. * Moved proto-jsonrpclib code out of a.t.web.jsonrpc and into adytum.jsonrpclib. * Added copies of t.w2.xmlrpc and tests and renamed them to jsonrpc. * a.t.w2.jsonrpc has been ported and passes all tests. * Updated setup.py. * Added ez_setup.py. * Added client and server examples. * Made adytum and adytum.twisted setuptools namespaces. * Updated the example client. * Updated the TODO file. armory-0.92.3/txjsonrpc/jsonrpclib.py0000644000000000000000000001204512414772654016403 0ustar rootroot""" Requires simplejson; can be downloaded from http://cheeseshop.python.org/pypi/simplejson """ import xmlrpclib from datetime import datetime try: import json except ImportError: import simplejson as json # From xmlrpclib. SERVER_ERROR = xmlrpclib.SERVER_ERROR NOT_WELLFORMED_ERROR = xmlrpclib.NOT_WELLFORMED_ERROR UNSUPPORTED_ENCODING = xmlrpclib.UNSUPPORTED_ENCODING INVALID_ENCODING_CHAR = xmlrpclib.INVALID_ENCODING_CHAR INVALID_JSONRPC = xmlrpclib.INVALID_XMLRPC METHOD_NOT_FOUND = xmlrpclib.METHOD_NOT_FOUND INVALID_METHOD_PARAMS = xmlrpclib.INVALID_METHOD_PARAMS INTERNAL_ERROR = xmlrpclib.INTERNAL_ERROR # Custom errors. METHOD_NOT_CALLABLE = -32604 # Version constants. VERSION_PRE1 = 0 VERSION_1 = 1 VERSION_2 = 2 class Fault(xmlrpclib.Fault): pass class NoSuchFunction(Fault): """ There is no function by the given name. """ class JSONRPCEncoder(json.JSONEncoder): """ Provide custom serializers for JSON-RPC. """ def default(self, obj): if isinstance(obj, datetime): return obj.strftime("%Y%m%dT%H:%M:%S") raise TypeError("%r is not JSON serializable" % (obj,)) def dumps(obj, **kwargs): try: version = kwargs.pop("version") except KeyError: version = VERSION_PRE1 try: id = kwargs.pop("id") except KeyError: id = None if isinstance(obj, Exception): result = None error = {'fault': obj.__class__.__name__, 'faultCode': obj.faultCode, 'faultString': obj.faultString} else: result = obj error = None if version == VERSION_PRE1: if result: obj = result else: obj = error else: obj = {"result": result, "error": error, "id": id} return json.dumps(obj, cls=JSONRPCEncoder, **kwargs) def loads(string, **kws): unmarshalled = json.loads(string, **kws) # XXX there's going to need to be some version-conditional code here... # for versions greater than VERSION_PRE1, we'll have to check for the # "error" key, not the "fault" key... and then raise if "fault" is not # None. if (isinstance(unmarshalled, dict) and unmarshalled.has_key('fault')): raise Fault(unmarshalled['faultCode'], unmarshalled['faultString']) return unmarshalled class SimpleParser(object): buffer = '' def feed(self, data): self.buffer += data def close(self): self.data = loads(self.buffer) class SimpleUnmarshaller(object): def getmethodname(self): return self.parser.data.get("method") def close(self): if isinstance(self.parser.data, dict): return self.parser.data.get("params") return self.parser.data def getparser(): parser = SimpleParser() marshaller = SimpleUnmarshaller() marshaller.parser = parser return parser, marshaller class Transport(xmlrpclib.Transport): """ Handles an HTTP transaction to an XML-RPC server. """ user_agent = "jsonrpclib.py (by txJSON-RPC)" def getparser(self): """ Get Parser and unmarshaller. """ return getparser() def _preV1Request(method="", params=[], *args): return dumps({"method": method, "params": params}) def _v1Request(method="", params=[], id="", *args): return dumps( {"method": method, "params": params, "id": id}) def _v1Notification(method="", params=[], *args): return _v1Request(method=method, params=params, id=None) def _v2Request(method="", params=[], id="", *args): return dumps({ "jsonrpc": "2.0", "method": method, "params": params, "id": id}) def _v2Notification(method="", params=[], *args): return _v2Request(method=method, params=params, id=None) class ServerProxy(xmlrpclib.ServerProxy): """ XXX add missing docstring """ def __init__(self, uri, transport=Transport(), version=VERSION_PRE1, *args, **kwds): xmlrpclib.ServerProxy.__init__(self, uri, transport, *args, **kwds) self.version = version def __request(self, *args): """ Call a method on the remote server. XXX Is there any way to indicate that we'd want a notification request instead of a regular request? """ request = self._getVersionedRequest(*args) # XXX do a check here for id; if null, skip the response # XXX in order to do this effectively, we might have to change the # request functions to objects, so that we can get at an id attribute response = self.__transport.request( self.__host, self.__handler, request, verbose=self.__verbose ) if len(response) == 1: response = response[0] return response def _getVersionedRequest(self, *args): if self.version == VERSION_PRE1: return _preV1Request(*args) elif self.version == VERSION_1: return _v1Request(*args) elif self.version == VERSION_2: return _v2Request(*args) armory-0.92.3/txjsonrpc/LICENSE0000644000000000000000000000217612414772654014675 0ustar rootrootCopyright (c) 2001-2004 Twisted Matrix Laboratories Copyright (c) 2006-2009 Duncan McGreggor Copyright (c) 2009 Canonical Ltd Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. armory-0.92.3/txjsonrpc/__init__.py0000644000000000000000000000000012414772654015761 0ustar rootrootarmory-0.92.3/txjsonrpc/meta.py0000644000000000000000000000042412414772654015162 0ustar rootrootdisplay_name = "txJSON-RPC" library_name = "txjsonrpc" version = "0.3.1" author = "Duncan McGreggor" author_email = "oubiwann@adytum.us" license = "BSD, GPL" url = "http://launchpad.net/%s" % library_name description = "Code for creatig Twisted JSON-RPC servers and clients." armory-0.92.3/txjsonrpc/web/0000755000000000000000000000000012414772654014437 5ustar rootrootarmory-0.92.3/txjsonrpc/web/__init__.py0000644000000000000000000000000012414772654016536 0ustar rootrootarmory-0.92.3/txjsonrpc/web/jsonrpc.py0000644000000000000000000002116012414772654016467 0ustar rootroot# Copyright (c) 2001-2004 Twisted Matrix Laboratories. # See LICENSE for details. """ A generic resource for publishing objects via JSON-RPC. Requires simplejson; can be downloaded from http://cheeseshop.python.org/pypi/simplejson API Stability: unstable Maintainer: U{Duncan McGreggor} """ from __future__ import nested_scopes import urlparse import xmlrpclib from twisted.web import resource, server from twisted.internet import defer, reactor from twisted.python import log from twisted.web import http from txjsonrpc import jsonrpclib from txjsonrpc.jsonrpc import BaseProxy, BaseQueryFactory, BaseSubhandler # Useful so people don't need to import xmlrpclib directly. Fault = xmlrpclib.Fault Binary = xmlrpclib.Binary Boolean = xmlrpclib.Boolean DateTime = xmlrpclib.DateTime class NoSuchFunction(Fault): """ There is no function by the given name. """ class Handler: """ Handle a JSON-RPC request and store the state for a request in progress. Override the run() method and return result using self.result, a Deferred. We require this class since we're not using threads, so we can't encapsulate state in a running function if we're going to have to wait for results. For example, lets say we want to authenticate against twisted.cred, run a LDAP query and then pass its result to a database query, all as a result of a single JSON-RPC command. We'd use a Handler instance to store the state of the running command. """ def __init__(self, resource, *args): self.resource = resource # the JSON-RPC resource we are connected to self.result = defer.Deferred() self.run(*args) def run(self, *args): # event driven equivalent of 'raise UnimplementedError' self.result.errback(NotImplementedError("Implement run() in subclasses")) class JSONRPC(resource.Resource, BaseSubhandler): """ A resource that implements JSON-RPC. Methods published can return JSON-RPC serializable results, Faults, Binary, Boolean, DateTime, Deferreds, or Handler instances. By default methods beginning with 'jsonrpc_' are published. """ # Error codes for Twisted, if they conflict with yours then # modify them at runtime. NOT_FOUND = 8001 FAILURE = 8002 isLeaf = 1 def __init__(self): resource.Resource.__init__(self) BaseSubhandler.__init__(self) def render(self, request): request.content.seek(0, 0) # Unmarshal the JSON-RPC data. content = request.content.read() parsed = jsonrpclib.loads(content) functionPath = parsed.get("method") args = parsed.get('params') id = parsed.get('id') version = parsed.get('jsonrpc') if version: version = int(float(version)) elif id and not version: version = jsonrpclib.VERSION_1 else: version = jsonrpclib.VERSION_PRE1 # XXX this all needs to be re-worked to support logic for multiple # versions... try: function = self._getFunction(functionPath) except jsonrpclib.Fault, f: self._cbRender(f, request, id, version) else: request.setHeader("content-type", "text/json") d = defer.maybeDeferred(function, *args) d.addErrback(self._ebRender, id) d.addCallback(self._cbRender, request, id, version) return server.NOT_DONE_YET def _cbRender(self, result, request, id, version): if isinstance(result, Handler): result = result.result if version == jsonrpclib.VERSION_PRE1: if not isinstance(result, jsonrpclib.Fault): result = (result,) # Convert the result (python) to JSON-RPC try: s = jsonrpclib.dumps(result, version=version) except: f = jsonrpclib.Fault(self.FAILURE, "can't serialize output") s = jsonrpclib.dumps(f, version=version) request.setHeader("content-length", str(len(s))) request.write(s) request.finish() def _ebRender(self, failure, id): if isinstance(failure.value, jsonrpclib.Fault): return failure.value log.err(failure) return jsonrpclib.Fault(self.FAILURE, "error") class QueryProtocol(http.HTTPClient): def connectionMade(self): self.sendCommand('POST', self.factory.path) self.sendHeader('User-Agent', 'Twisted/JSONRPClib') self.sendHeader('Host', self.factory.host) self.sendHeader('Content-type', 'text/json') self.sendHeader('Content-length', str(len(self.factory.payload))) if self.factory.user: auth = '%s:%s' % (self.factory.user, self.factory.password) auth = auth.encode('base64').strip() self.sendHeader('Authorization', 'Basic %s' % (auth,)) self.endHeaders() self.transport.write(self.factory.payload) def handleStatus(self, version, status, message): if status != '200': self.factory.badStatus(status, message) def handleResponse(self, contents): self.factory.parseResponse(contents) class QueryFactory(BaseQueryFactory): deferred = None protocol = QueryProtocol def __init__(self, path, host, method, user=None, password=None, version=jsonrpclib.VERSION_PRE1, *args): BaseQueryFactory.__init__(self, method, version, *args) self.path, self.host = path, host self.user, self.password = user, password class Proxy(BaseProxy): """ A Proxy for making remote JSON-RPC calls. Pass the URL of the remote JSON-RPC server to the constructor. Use proxy.callRemote('foobar', *args) to call remote method 'foobar' with *args. """ def __init__(self, url, user=None, password=None, version=jsonrpclib.VERSION_PRE1, factoryClass=QueryFactory): """ @type url: C{str} @param url: The URL to which to post method calls. Calls will be made over SSL if the scheme is HTTPS. If netloc contains username or password information, these will be used to authenticate, as long as the C{user} and C{password} arguments are not specified. @type user: C{str} or None @param user: The username with which to authenticate with the server when making calls. If specified, overrides any username information embedded in C{url}. If not specified, a value may be taken from C{url} if present. @type password: C{str} or None @param password: The password with which to authenticate with the server when making calls. If specified, overrides any password information embedded in C{url}. If not specified, a value may be taken from C{url} if present. @type version: C{int} @param version: The version indicates which JSON-RPC spec to support. The available choices are jsonrpclib.VERSION*. The default is to use the version of the spec that txJSON-RPC was originally released with, pre-Version 1.0. """ BaseProxy.__init__(self, version, factoryClass) scheme, netloc, path, params, query, fragment = urlparse.urlparse(url) netlocParts = netloc.split('@') if len(netlocParts) == 2: userpass = netlocParts.pop(0).split(':') self.user = userpass.pop(0) try: self.password = userpass.pop(0) except: self.password = None else: self.user = self.password = None hostport = netlocParts[0].split(':') self.host = hostport.pop(0) try: self.port = int(hostport.pop(0)) except: self.port = None self.path = path if self.path in ['', None]: self.path = '/' self.secure = (scheme == 'https') if user is not None: self.user = user if password is not None: self.password = password def callRemote(self, method, *args, **kwargs): version = self._getVersion(kwargs) # XXX generate unique id and pass it as a parameter factoryClass = self._getFactoryClass(kwargs) factory = factoryClass(self.path, self.host, method, self.user, self.password, version, *args) if self.secure: from twisted.internet import ssl reactor.connectSSL(self.host, self.port or 443, factory, ssl.ClientContextFactory()) else: reactor.connectTCP(self.host, self.port or 80, factory) return factory.deferred __all__ = ["JSONRPC", "Handler", "Proxy"] armory-0.92.3/txjsonrpc/jsonrpc.py0000644000000000000000000001617412414772654015723 0ustar rootrootfrom twisted.internet import defer, protocol from twisted.python import reflect from txjsonrpc import jsonrpclib class BaseSubhandler: """ Sub-handlers for prefixed methods (e.g., system.listMethods) can be added with putSubHandler. By default, prefixes are separated with a '.'. Override self.separator to change this. """ separator = '.' def __init__(self): self.subHandlers = {} def putSubHandler(self, prefix, handler): self.subHandlers[prefix] = handler def getSubHandler(self, prefix): return self.subHandlers.get(prefix, None) def getSubHandlerPrefixes(self): return self.subHandlers.keys() def _getFunction(self, functionPath): """ Given a string, return a function, or raise jsonrpclib.NoSuchFunction. This returned function will be called, and should return the result of the call, a Deferred, or a Fault instance. Override in subclasses if you want your own policy. The default policy is that given functionPath 'foo', return the method at self.jsonrpc_foo, i.e. getattr(self, "jsonrpc_" + functionPath). If functionPath contains self.separator, the sub-handler for the initial prefix is used to search for the remaining path. """ if functionPath.find(self.separator) != -1: prefix, functionPath = functionPath.split(self.separator, 1) handler = self.getSubHandler(prefix) if handler is None: raise jsonrpclib.NoSuchFunction(jsonrpclib.METHOD_NOT_FOUND, "no such sub-handler %s" % prefix) return handler._getFunction(functionPath) f = getattr(self, "jsonrpc_%s" % functionPath, None) if not f: raise jsonrpclib.NoSuchFunction(jsonrpclib.METHOD_NOT_FOUND, "function %s not found" % functionPath) elif not callable(f): raise jsonrpclib.NoSuchFunction(jsonrpclib.METHOD_NOT_CALLABLE, "function %s not callable" % functionPath) else: return f def _listFunctions(self): """ Return a list of the names of all jsonrpc methods. """ return reflect.prefixedMethodNames(self.__class__, 'jsonrpc_') class BaseQueryFactory(protocol.ClientFactory): deferred = None protocol = None # XXX add an "id" parameter def __init__(self, method, version=jsonrpclib.VERSION_PRE1, *args): # XXX pass the "id" parameter here self.payload = self._buildVersionedPayload(version, method, args) self.deferred = defer.Deferred() def _buildVersionedPayload(self, version, *args): if version == jsonrpclib.VERSION_PRE1: return jsonrpclib._preV1Request(*args) elif version == jsonrpclib.VERSION_1: return jsonrpclib._v1Request(*args) elif version == jsonrpclib.VERSION_2: return jsonrpclib._v2Request(*args) def parseResponse(self, contents): if not self.deferred: return try: # Convert the response from JSON-RPC to python. result = jsonrpclib.loads(contents) #response = jsonrpclib.loads(contents) #result = response['result'] #error = response['error'] #if error: # self.deferred.errback(error) if isinstance(result, list): result = result[0] except Exception, error: self.deferred.errback(error) self.deferred = None else: self.deferred.callback(result) self.deferred = None def clientConnectionFailed(self, _, reason): if self.deferred is not None: self.deferred.errback(reason) self.deferred = None clientConnectionLost = clientConnectionFailed def badStatus(self, status, message): self.deferred.errback(ValueError(status, message)) self.deferred = None class BaseProxy: """ A Proxy base class for making remote JSON-RPC calls. """ def __init__(self, version=jsonrpclib.VERSION_PRE1, factoryClass=None): self.version = version self.factoryClass = factoryClass def _getVersion(self, keywords): version = keywords.get("version") if version == None: version = self.version return version def _getFactoryClass(self, keywords): factoryClass = keywords.get("factoryClass") if not factoryClass: factoryClass = self.factoryClass return factoryClass class Introspection(BaseSubhandler): """ Implement the JSON-RPC Introspection API. By default, the methodHelp method returns the 'help' method attribute, if it exists, otherwise the __doc__ method attribute, if it exists, otherwise the empty string. To enable the methodSignature method, add a 'signature' method attribute containing a list of lists. See methodSignature's documentation for the format. Note the type strings should be JSON-RPC types, not Python types. """ def __init__(self, parent): """ Implement Introspection support for an JSONRPC server. @param parent: the JSONRPC server to add Introspection support to. """ BaseSubhandler.__init__(self) self._jsonrpc_parent = parent def jsonrpc_listMethods(self): """ Return a list of the method names implemented by this server. """ functions = [] todo = [(self._jsonrpc_parent, '')] while todo: obj, prefix = todo.pop(0) functions.extend([prefix + name for name in obj._listFunctions()]) todo.extend([(obj.getSubHandler(name), prefix + name + obj.separator) for name in obj.getSubHandlerPrefixes()]) functions.sort() return functions jsonrpc_listMethods.signature = [['array']] def jsonrpc_methodHelp(self, method): """ Return a documentation string describing the use of the given method. """ method = self._jsonrpc_parent._getFunction(method) return (getattr(method, 'help', None) or getattr(method, '__doc__', None) or '').strip() jsonrpc_methodHelp.signature = [['string', 'string']] def jsonrpc_methodSignature(self, method): """ Return a list of type signatures. Each type signature is a list of the form [rtype, type1, type2, ...] where rtype is the return type and typeN is the type of the Nth argument. If no signature information is available, the empty string is returned. """ method = self._jsonrpc_parent._getFunction(method) return getattr(method, 'signature', None) or '' jsonrpc_methodSignature.signature = [['array', 'string'], ['string', 'string']] def addIntrospection(jsonrpc): """ Add Introspection support to an JSONRPC server. @param jsonrpc: The jsonrpc server to add Introspection support to. """ #jsonrpc.putSubHandler('system', Introspection, ('protocol',)) jsonrpc.putSubHandler('system', Introspection(jsonrpc)) armory-0.92.3/txjsonrpc/auth.py0000644000000000000000000000243112414772654015175 0ustar rootrootfrom zope.interface import Interface, implements try: from twisted import web except ImportError: web = None from twisted.cred.portal import IRealm, Portal class HTTPAuthRealm(object): implements(IRealm) def __init__(self, resource): self.resource = resource def logout(self): pass def requestAvatar(self, avatarId, mind, *interfaces): if web.resource.IResource in interfaces: return web.resource.IResource, self.resource, self.logout raise NotImplementedError() def _wrapTwistedWebResource(resource, checkers, credFactories=[], realmName=""): if not web: raise ImportError("twisted.web does not seem to be installed.") from twisted.web import guard defaultCredFactory = guard.BasicCredentialFactory(realmName) credFactories.insert(0, defaultCredFactory) realm = HTTPAuthRealm(resource) portal = Portal(realm, checkers) return guard.HTTPAuthSessionWrapper(portal, credFactories) def wrapResource(resource, *args, **kwargs): if web.resource.IResource.providedBy(resource): return _wrapTwistedWebResource(resource, *args, **kwargs) elif web2.iweb.IResource.providedBy(resource): return _wrapTwistedWeb2Resource(resource, *args, **kwargs) armory-0.92.3/qrcodenative.py0000644000000000000000000006315212414772654014675 0ustar rootrootimport math #QRCode for Python # #Ported from the Javascript library by Sam Curren # #QRCode for Javascript #http://d-project.googlecode.com/svn/trunk/misc/qrcode/js/qrcode.js # #Copyright (c) 2009 Kazuhiko Arase # #URL: http://www.d-project.com/ # #Licensed under the MIT license: # http://www.opensource.org/licenses/mit-license.php # # The word "QR Code" is registered trademark of # DENSO WAVE INCORPORATED # http://www.denso-wave.com/qrcode/faqpatent-e.html class QR8bitByte: def __init__(self, data): self.mode = QRMode.MODE_8BIT_BYTE self.data = data def getLength(self): return len(self.data) def write(self, buffer): for i in range(len(self.data)): #// not JIS ... buffer.put(ord(self.data[i]), 8) def __repr__(self): return self.data class QRCode: def __init__(self, typeNumber, errorCorrectLevel): self.typeNumber = typeNumber self.errorCorrectLevel = errorCorrectLevel self.modules = None self.moduleCount = 0 self.dataCache = None self.dataList = [] def addData(self, data): newData = QR8bitByte(data) self.dataList.append(newData) self.dataCache = None def isDark(self, row, col): if (row < 0 or self.moduleCount <= row or col < 0 or self.moduleCount <= col): raise Exception("%s,%s - %s" % (row, col, self.moduleCount)) return self.modules[row][col] def getModuleCount(self): return self.moduleCount def make(self): self.makeImpl(False, self.getBestMaskPattern() ) def makeImpl(self, test, maskPattern): self.moduleCount = self.typeNumber * 4 + 17 self.modules = [None for x in range(self.moduleCount)] for row in range(self.moduleCount): self.modules[row] = [None for x in range(self.moduleCount)] for col in range(self.moduleCount): self.modules[row][col] = None #//(col + row) % 3; self.setupPositionProbePattern(0, 0) self.setupPositionProbePattern(self.moduleCount - 7, 0) self.setupPositionProbePattern(0, self.moduleCount - 7) self.setupPositionAdjustPattern() self.setupTimingPattern() self.setupTypeInfo(test, maskPattern) if (self.typeNumber >= 7): self.setupTypeNumber(test) if (self.dataCache == None): self.dataCache = QRCode.createData(self.typeNumber, self.errorCorrectLevel, self.dataList) self.mapData(self.dataCache, maskPattern) def setupPositionProbePattern(self, row, col): for r in range(-1, 8): if (row + r <= -1 or self.moduleCount <= row + r): continue for c in range(-1, 8): if (col + c <= -1 or self.moduleCount <= col + c): continue if ( (0 <= r and r <= 6 and (c == 0 or c == 6) ) or (0 <= c and c <= 6 and (r == 0 or r == 6) ) or (2 <= r and r <= 4 and 2 <= c and c <= 4) ): self.modules[row + r][col + c] = True; else: self.modules[row + r][col + c] = False; def getBestMaskPattern(self): minLostPoint = 0 pattern = 0 for i in range(8): self.makeImpl(True, i); lostPoint = QRUtil.getLostPoint(self); if (i == 0 or minLostPoint > lostPoint): minLostPoint = lostPoint pattern = i return pattern def createMovieClip(self): raise Exception("Method not relevant to Python port") def makeImage(self): pass #boxsize = 10 #pixels per box #offset = 4 #boxes as border #pixelsize = (self.getModuleCount() + offset + offset) * boxsize #im = Image.new("RGB", (pixelsize, pixelsize), "white") #d = ImageDraw.Draw(im) #for r in range(self.getModuleCount()): #for c in range(self.getModuleCount()): #if (self.isDark(r, c) ): #x = (c + offset) * boxsize #y = (r + offset) * boxsize #b = [(x,y),(x+boxsize,y+boxsize)] #d.rectangle(b,fill="black") #del d #return im def setupTimingPattern(self): for r in range(8, self.moduleCount - 8): if (self.modules[r][6] != None): continue self.modules[r][6] = (r % 2 == 0) for c in range(8, self.moduleCount - 8): if (self.modules[6][c] != None): continue self.modules[6][c] = (c % 2 == 0) def setupPositionAdjustPattern(self): pos = QRUtil.getPatternPosition(self.typeNumber) for i in range(len(pos)): for j in range(len(pos)): row = pos[i] col = pos[j] if (self.modules[row][col] != None): continue for r in range(-2, 3): for c in range(-2, 3): if (r == -2 or r == 2 or c == -2 or c == 2 or (r == 0 and c == 0) ): self.modules[row + r][col + c] = True else: self.modules[row + r][col + c] = False def setupTypeNumber(self, test): bits = QRUtil.getBCHTypeNumber(self.typeNumber) for i in range(18): mod = (not test and ( (bits >> i) & 1) == 1) self.modules[i // 3][i % 3 + self.moduleCount - 8 - 3] = mod; for i in range(18): mod = (not test and ( (bits >> i) & 1) == 1) self.modules[i % 3 + self.moduleCount - 8 - 3][i // 3] = mod; def setupTypeInfo(self, test, maskPattern): data = (self.errorCorrectLevel << 3) | maskPattern bits = QRUtil.getBCHTypeInfo(data) #// vertical for i in range(15): mod = (not test and ( (bits >> i) & 1) == 1) if (i < 6): self.modules[i][8] = mod elif (i < 8): self.modules[i + 1][8] = mod else: self.modules[self.moduleCount - 15 + i][8] = mod #// horizontal for i in range(15): mod = (not test and ( (bits >> i) & 1) == 1); if (i < 8): self.modules[8][self.moduleCount - i - 1] = mod elif (i < 9): self.modules[8][15 - i - 1 + 1] = mod else: self.modules[8][15 - i - 1] = mod #// fixed module self.modules[self.moduleCount - 8][8] = (not test) def mapData(self, data, maskPattern): inc = -1 row = self.moduleCount - 1 bitIndex = 7 byteIndex = 0 for col in range(self.moduleCount - 1, 0, -2): if (col == 6): col-=1 while (True): for c in range(2): if (self.modules[row][col - c] == None): dark = False if (byteIndex < len(data)): dark = ( ( (data[byteIndex] >> bitIndex) & 1) == 1) mask = QRUtil.getMask(maskPattern, row, col - c) if (mask): dark = not dark self.modules[row][col - c] = dark bitIndex-=1 if (bitIndex == -1): byteIndex+=1 bitIndex = 7 row += inc if (row < 0 or self.moduleCount <= row): row -= inc inc = -inc break PAD0 = 0xEC PAD1 = 0x11 @staticmethod def createData(typeNumber, errorCorrectLevel, dataList): rsBlocks = QRRSBlock.getRSBlocks(typeNumber, errorCorrectLevel) buffer = QRBitBuffer(); for i in range(len(dataList)): data = dataList[i] buffer.put(data.mode, 4) buffer.put(data.getLength(), QRUtil.getLengthInBits(data.mode, typeNumber) ) data.write(buffer) #// calc num max data. totalDataCount = 0; for i in range(len(rsBlocks)): totalDataCount += rsBlocks[i].dataCount if (buffer.getLengthInBits() > totalDataCount * 8): raise Exception("code length overflow. (" + buffer.getLengthInBits() + ">" + totalDataCount * 8 + ")") #// end code if (buffer.getLengthInBits() + 4 <= totalDataCount * 8): buffer.put(0, 4) #// padding while (buffer.getLengthInBits() % 8 != 0): buffer.putBit(False) #// padding while (True): if (buffer.getLengthInBits() >= totalDataCount * 8): break buffer.put(QRCode.PAD0, 8) if (buffer.getLengthInBits() >= totalDataCount * 8): break buffer.put(QRCode.PAD1, 8) return QRCode.createBytes(buffer, rsBlocks) @staticmethod def createBytes(buffer, rsBlocks): offset = 0 maxDcCount = 0 maxEcCount = 0 dcdata = [0 for x in range(len(rsBlocks))] ecdata = [0 for x in range(len(rsBlocks))] for r in range(len(rsBlocks)): dcCount = rsBlocks[r].dataCount ecCount = rsBlocks[r].totalCount - dcCount maxDcCount = max(maxDcCount, dcCount) maxEcCount = max(maxEcCount, ecCount) dcdata[r] = [0 for x in range(dcCount)] for i in range(len(dcdata[r])): dcdata[r][i] = 0xff & buffer.buffer[i + offset] offset += dcCount rsPoly = QRUtil.getErrorCorrectPolynomial(ecCount) rawPoly = QRPolynomial(dcdata[r], rsPoly.getLength() - 1) modPoly = rawPoly.mod(rsPoly) ecdata[r] = [0 for x in range(rsPoly.getLength()-1)] for i in range(len(ecdata[r])): modIndex = i + modPoly.getLength() - len(ecdata[r]) if (modIndex >= 0): ecdata[r][i] = modPoly.get(modIndex) else: ecdata[r][i] = 0 totalCodeCount = 0 for i in range(len(rsBlocks)): totalCodeCount += rsBlocks[i].totalCount data = [None for x in range(totalCodeCount)] index = 0 for i in range(maxDcCount): for r in range(len(rsBlocks)): if (i < len(dcdata[r])): data[index] = dcdata[r][i] index+=1 for i in range(maxEcCount): for r in range(len(rsBlocks)): if (i < len(ecdata[r])): data[index] = ecdata[r][i] index+=1 return data class QRMode: MODE_NUMBER = 1 << 0 MODE_ALPHA_NUM = 1 << 1 MODE_8BIT_BYTE = 1 << 2 MODE_KANJI = 1 << 3 class QRErrorCorrectLevel: L = 1 M = 0 Q = 3 H = 2 class QRMaskPattern: PATTERN000 = 0 PATTERN001 = 1 PATTERN010 = 2 PATTERN011 = 3 PATTERN100 = 4 PATTERN101 = 5 PATTERN110 = 6 PATTERN111 = 7 class QRUtil(object): PATTERN_POSITION_TABLE = [ [], [6, 18], [6, 22], [6, 26], [6, 30], [6, 34], [6, 22, 38], [6, 24, 42], [6, 26, 46], [6, 28, 50], [6, 30, 54], [6, 32, 58], [6, 34, 62], [6, 26, 46, 66], [6, 26, 48, 70], [6, 26, 50, 74], [6, 30, 54, 78], [6, 30, 56, 82], [6, 30, 58, 86], [6, 34, 62, 90], [6, 28, 50, 72, 94], [6, 26, 50, 74, 98], [6, 30, 54, 78, 102], [6, 28, 54, 80, 106], [6, 32, 58, 84, 110], [6, 30, 58, 86, 114], [6, 34, 62, 90, 118], [6, 26, 50, 74, 98, 122], [6, 30, 54, 78, 102, 126], [6, 26, 52, 78, 104, 130], [6, 30, 56, 82, 108, 134], [6, 34, 60, 86, 112, 138], [6, 30, 58, 86, 114, 142], [6, 34, 62, 90, 118, 146], [6, 30, 54, 78, 102, 126, 150], [6, 24, 50, 76, 102, 128, 154], [6, 28, 54, 80, 106, 132, 158], [6, 32, 58, 84, 110, 136, 162], [6, 26, 54, 82, 110, 138, 166], [6, 30, 58, 86, 114, 142, 170] ] G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0) G18 = (1 << 12) | (1 << 11) | (1 << 10) | (1 << 9) | (1 << 8) | (1 << 5) | (1 << 2) | (1 << 0) G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1) @staticmethod def getBCHTypeInfo(data): d = data << 10; while (QRUtil.getBCHDigit(d) - QRUtil.getBCHDigit(QRUtil.G15) >= 0): d ^= (QRUtil.G15 << (QRUtil.getBCHDigit(d) - QRUtil.getBCHDigit(QRUtil.G15) ) ) return ( (data << 10) | d) ^ QRUtil.G15_MASK @staticmethod def getBCHTypeNumber(data): d = data << 12; while (QRUtil.getBCHDigit(d) - QRUtil.getBCHDigit(QRUtil.G18) >= 0): d ^= (QRUtil.G18 << (QRUtil.getBCHDigit(d) - QRUtil.getBCHDigit(QRUtil.G18) ) ) return (data << 12) | d @staticmethod def getBCHDigit(data): digit = 0; while (data != 0): digit += 1 data >>= 1 return digit @staticmethod def getPatternPosition(typeNumber): return QRUtil.PATTERN_POSITION_TABLE[typeNumber - 1] @staticmethod def getMask(maskPattern, i, j): if maskPattern == QRMaskPattern.PATTERN000 : return (i + j) % 2 == 0 if maskPattern == QRMaskPattern.PATTERN001 : return i % 2 == 0 if maskPattern == QRMaskPattern.PATTERN010 : return j % 3 == 0 if maskPattern == QRMaskPattern.PATTERN011 : return (i + j) % 3 == 0 if maskPattern == QRMaskPattern.PATTERN100 : return (math.floor(i / 2) + math.floor(j / 3) ) % 2 == 0 if maskPattern == QRMaskPattern.PATTERN101 : return (i * j) % 2 + (i * j) % 3 == 0 if maskPattern == QRMaskPattern.PATTERN110 : return ( (i * j) % 2 + (i * j) % 3) % 2 == 0 if maskPattern == QRMaskPattern.PATTERN111 : return ( (i * j) % 3 + (i + j) % 2) % 2 == 0 raise Exception("bad maskPattern:" + maskPattern); @staticmethod def getErrorCorrectPolynomial(errorCorrectLength): a = QRPolynomial([1], 0); for i in range(errorCorrectLength): a = a.multiply(QRPolynomial([1, QRMath.gexp(i)], 0) ) return a @staticmethod def getLengthInBits(mode, type): if 1 <= type and type < 10: #// 1 - 9 if mode == QRMode.MODE_NUMBER : return 10 if mode == QRMode.MODE_ALPHA_NUM : return 9 if mode == QRMode.MODE_8BIT_BYTE : return 8 if mode == QRMode.MODE_KANJI : return 8 raise Exception("mode:" + mode) elif (type < 27): #// 10 - 26 if mode == QRMode.MODE_NUMBER : return 12 if mode == QRMode.MODE_ALPHA_NUM : return 11 if mode == QRMode.MODE_8BIT_BYTE : return 16 if mode == QRMode.MODE_KANJI : return 10 raise Exception("mode:" + mode) elif (type < 41): #// 27 - 40 if mode == QRMode.MODE_NUMBER : return 14 if mode == QRMode.MODE_ALPHA_NUM : return 13 if mode == QRMode.MODE_8BIT_BYTE : return 16 if mode == QRMode.MODE_KANJI : return 12 raise Exception("mode:" + mode) else: raise Exception("type:" + type) @staticmethod def getLostPoint(qrCode): moduleCount = qrCode.getModuleCount(); lostPoint = 0; #// LEVEL1 for row in range(moduleCount): for col in range(moduleCount): sameCount = 0; dark = qrCode.isDark(row, col); for r in range(-1, 2): if (row + r < 0 or moduleCount <= row + r): continue for c in range(-1, 2): if (col + c < 0 or moduleCount <= col + c): continue if (r == 0 and c == 0): continue if (dark == qrCode.isDark(row + r, col + c) ): sameCount+=1 if (sameCount > 5): lostPoint += (3 + sameCount - 5) #// LEVEL2 for row in range(moduleCount - 1): for col in range(moduleCount - 1): count = 0; if (qrCode.isDark(row, col ) ): count+=1 if (qrCode.isDark(row + 1, col ) ): count+=1 if (qrCode.isDark(row, col + 1) ): count+=1 if (qrCode.isDark(row + 1, col + 1) ): count+=1 if (count == 0 or count == 4): lostPoint += 3 #// LEVEL3 for row in range(moduleCount): for col in range(moduleCount - 6): if (qrCode.isDark(row, col) and not qrCode.isDark(row, col + 1) and qrCode.isDark(row, col + 2) and qrCode.isDark(row, col + 3) and qrCode.isDark(row, col + 4) and not qrCode.isDark(row, col + 5) and qrCode.isDark(row, col + 6) ): lostPoint += 40 for col in range(moduleCount): for row in range(moduleCount - 6): if (qrCode.isDark(row, col) and not qrCode.isDark(row + 1, col) and qrCode.isDark(row + 2, col) and qrCode.isDark(row + 3, col) and qrCode.isDark(row + 4, col) and not qrCode.isDark(row + 5, col) and qrCode.isDark(row + 6, col) ): lostPoint += 40 #// LEVEL4 darkCount = 0; for col in range(moduleCount): for row in range(moduleCount): if (qrCode.isDark(row, col) ): darkCount+=1 ratio = abs(100 * darkCount / moduleCount / moduleCount - 50) / 5 lostPoint += ratio * 10 return lostPoint class QRMath: @staticmethod def glog(n): if (n < 1): raise Exception("glog(" + n + ")") return LOG_TABLE[n]; @staticmethod def gexp(n): while n < 0: n += 255 while n >= 256: n -= 255 return EXP_TABLE[n]; EXP_TABLE = [x for x in range(256)] LOG_TABLE = [x for x in range(256)] for i in range(8): EXP_TABLE[i] = 1 << i; for i in range(8, 256): EXP_TABLE[i] = EXP_TABLE[i - 4] ^ EXP_TABLE[i - 5] ^ EXP_TABLE[i - 6] ^ EXP_TABLE[i - 8] for i in range(255): LOG_TABLE[EXP_TABLE[i] ] = i class QRPolynomial: def __init__(self, num, shift): if (len(num) == 0): raise Exception(num.length + "/" + shift) offset = 0 while offset < len(num) and num[offset] == 0: offset += 1 self.num = [0 for x in range(len(num)-offset+shift)] for i in range(len(num) - offset): self.num[i] = num[i + offset] def get(self, index): return self.num[index] def getLength(self): return len(self.num) def multiply(self, e): num = [0 for x in range(self.getLength() + e.getLength() - 1)]; for i in range(self.getLength()): for j in range(e.getLength()): num[i + j] ^= QRMath.gexp(QRMath.glog(self.get(i) ) + QRMath.glog(e.get(j) ) ) return QRPolynomial(num, 0); def mod(self, e): if (self.getLength() - e.getLength() < 0): return self; ratio = QRMath.glog(self.get(0) ) - QRMath.glog(e.get(0) ) num = [0 for x in range(self.getLength())] for i in range(self.getLength()): num[i] = self.get(i); for i in range(e.getLength()): num[i] ^= QRMath.gexp(QRMath.glog(e.get(i) ) + ratio) # recursive call return QRPolynomial(num, 0).mod(e); class QRRSBlock: RS_BLOCK_TABLE = [ #// L #// M #// Q #// H #// 1 [1, 26, 19], [1, 26, 16], [1, 26, 13], [1, 26, 9], #// 2 [1, 44, 34], [1, 44, 28], [1, 44, 22], [1, 44, 16], #// 3 [1, 70, 55], [1, 70, 44], [2, 35, 17], [2, 35, 13], #// 4 [1, 100, 80], [2, 50, 32], [2, 50, 24], [4, 25, 9], #// 5 [1, 134, 108], [2, 67, 43], [2, 33, 15, 2, 34, 16], [2, 33, 11, 2, 34, 12], #// 6 [2, 86, 68], [4, 43, 27], [4, 43, 19], [4, 43, 15], #// 7 [2, 98, 78], [4, 49, 31], [2, 32, 14, 4, 33, 15], [4, 39, 13, 1, 40, 14], #// 8 [2, 121, 97], [2, 60, 38, 2, 61, 39], [4, 40, 18, 2, 41, 19], [4, 40, 14, 2, 41, 15], #// 9 [2, 146, 116], [3, 58, 36, 2, 59, 37], [4, 36, 16, 4, 37, 17], [4, 36, 12, 4, 37, 13], #// 10 [2, 86, 68, 2, 87, 69], [4, 69, 43, 1, 70, 44], [6, 43, 19, 2, 44, 20], [6, 43, 15, 2, 44, 16], # 11 [4, 101, 81], [1, 80, 50, 4, 81, 51], [4, 50, 22, 4, 51, 23], [3, 36, 12, 8, 37, 13], # 12 [2, 116, 92, 2, 117, 93], [6, 58, 36, 2, 59, 37], [4, 46, 20, 6, 47, 21], [7, 42, 14, 4, 43, 15], # 13 [4, 133, 107], [8, 59, 37, 1, 60, 38], [8, 44, 20, 4, 45, 21], [12, 33, 11, 4, 34, 12], # 14 [3, 145, 115, 1, 146, 116], [4, 64, 40, 5, 65, 41], [11, 36, 16, 5, 37, 17], [11, 36, 12, 5, 37, 13], # 15 [5, 109, 87, 1, 110, 88], [5, 65, 41, 5, 66, 42], [5, 54, 24, 7, 55, 25], [11, 36, 12], # 16 [5, 122, 98, 1, 123, 99], [7, 73, 45, 3, 74, 46], [15, 43, 19, 2, 44, 20], [3, 45, 15, 13, 46, 16], # 17 [1, 135, 107, 5, 136, 108], [10, 74, 46, 1, 75, 47], [1, 50, 22, 15, 51, 23], [2, 42, 14, 17, 43, 15], # 18 [5, 150, 120, 1, 151, 121], [9, 69, 43, 4, 70, 44], [17, 50, 22, 1, 51, 23], [2, 42, 14, 19, 43, 15], # 19 [3, 141, 113, 4, 142, 114], [3, 70, 44, 11, 71, 45], [17, 47, 21, 4, 48, 22], [9, 39, 13, 16, 40, 14], # 20 [3, 135, 107, 5, 136, 108], [3, 67, 41, 13, 68, 42], [15, 54, 24, 5, 55, 25], [15, 43, 15, 10, 44, 16], # 21 [4, 144, 116, 4, 145, 117], [17, 68, 42], [17, 50, 22, 6, 51, 23], [19, 46, 16, 6, 47, 17], # 22 [2, 139, 111, 7, 140, 112], [17, 74, 46], [7, 54, 24, 16, 55, 25], [34, 37, 13], # 23 [4, 151, 121, 5, 152, 122], [4, 75, 47, 14, 76, 48], [11, 54, 24, 14, 55, 25], [16, 45, 15, 14, 46, 16], # 24 [6, 147, 117, 4, 148, 118], [6, 73, 45, 14, 74, 46], [11, 54, 24, 16, 55, 25], [30, 46, 16, 2, 47, 17], # 25 [8, 132, 106, 4, 133, 107], [8, 75, 47, 13, 76, 48], [7, 54, 24, 22, 55, 25], [22, 45, 15, 13, 46, 16], # 26 [10, 142, 114, 2, 143, 115], [19, 74, 46, 4, 75, 47], [28, 50, 22, 6, 51, 23], [33, 46, 16, 4, 47, 17], # 27 [8, 152, 122, 4, 153, 123], [22, 73, 45, 3, 74, 46], [8, 53, 23, 26, 54, 24], [12, 45, 15, 28, 46, 16], # 28 [3, 147, 117, 10, 148, 118], [3, 73, 45, 23, 74, 46], [4, 54, 24, 31, 55, 25], [11, 45, 15, 31, 46, 16], # 29 [7, 146, 116, 7, 147, 117], [21, 73, 45, 7, 74, 46], [1, 53, 23, 37, 54, 24], [19, 45, 15, 26, 46, 16], # 30 [5, 145, 115, 10, 146, 116], [19, 75, 47, 10, 76, 48], [15, 54, 24, 25, 55, 25], [23, 45, 15, 25, 46, 16], # 31 [13, 145, 115, 3, 146, 116], [2, 74, 46, 29, 75, 47], [42, 54, 24, 1, 55, 25], [23, 45, 15, 28, 46, 16], # 32 [17, 145, 115], [10, 74, 46, 23, 75, 47], [10, 54, 24, 35, 55, 25], [19, 45, 15, 35, 46, 16], # 33 [17, 145, 115, 1, 146, 116], [14, 74, 46, 21, 75, 47], [29, 54, 24, 19, 55, 25], [11, 45, 15, 46, 46, 16], # 34 [13, 145, 115, 6, 146, 116], [14, 74, 46, 23, 75, 47], [44, 54, 24, 7, 55, 25], [59, 46, 16, 1, 47, 17], # 35 [12, 151, 121, 7, 152, 122], [12, 75, 47, 26, 76, 48], [39, 54, 24, 14, 55, 25], [22, 45, 15, 41, 46, 16], # 36 [6, 151, 121, 14, 152, 122], [6, 75, 47, 34, 76, 48], [46, 54, 24, 10, 55, 25], [2, 45, 15, 64, 46, 16], # 37 [17, 152, 122, 4, 153, 123], [29, 74, 46, 14, 75, 47], [49, 54, 24, 10, 55, 25], [24, 45, 15, 46, 46, 16], # 38 [4, 152, 122, 18, 153, 123], [13, 74, 46, 32, 75, 47], [48, 54, 24, 14, 55, 25], [42, 45, 15, 32, 46, 16], # 39 [20, 147, 117, 4, 148, 118], [40, 75, 47, 7, 76, 48], [43, 54, 24, 22, 55, 25], [10, 45, 15, 67, 46, 16], # 40 [19, 148, 118, 6, 149, 119], [18, 75, 47, 31, 76, 48], [34, 54, 24, 34, 55, 25], [20, 45, 15, 61, 46, 16] ] def __init__(self, totalCount, dataCount): self.totalCount = totalCount self.dataCount = dataCount @staticmethod def getRSBlocks(typeNumber, errorCorrectLevel): rsBlock = QRRSBlock.getRsBlockTable(typeNumber, errorCorrectLevel); if rsBlock == None: raise Exception("bad rs block @ typeNumber:" + typeNumber + "/errorCorrectLevel:" + errorCorrectLevel) length = len(rsBlock) / 3 list = [] for i in range(length): count = rsBlock[i * 3 + 0] totalCount = rsBlock[i * 3 + 1] dataCount = rsBlock[i * 3 + 2] for j in range(count): list.append(QRRSBlock(totalCount, dataCount)) return list; @staticmethod def getRsBlockTable(typeNumber, errorCorrectLevel): if errorCorrectLevel == QRErrorCorrectLevel.L: return QRRSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 0]; elif errorCorrectLevel == QRErrorCorrectLevel.M: return QRRSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 1]; elif errorCorrectLevel == QRErrorCorrectLevel.Q: return QRRSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 2]; elif errorCorrectLevel == QRErrorCorrectLevel.H: return QRRSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 3]; else: return None; class QRBitBuffer: def __init__(self): self.buffer = [] self.length = 0 def __repr__(self): return ".".join([str(n) for n in self.buffer]) def get(self, index): bufIndex = math.floor(index / 8) val = ( (self.buffer[bufIndex] >> (7 - index % 8) ) & 1) == 1 print "get ", val return ( (self.buffer[bufIndex] >> (7 - index % 8) ) & 1) == 1 def put(self, num, length): for i in range(length): self.putBit( ( (num >> (length - i - 1) ) & 1) == 1) def getLengthInBits(self): return self.length def putBit(self, bit): bufIndex = self.length // 8 if len(self.buffer) <= bufIndex: self.buffer.append(0) if bit: self.buffer[bufIndex] |= (0x80 >> (self.length % 8) ) self.length+=1 armory-0.92.3/windowsbuild/0000755000000000000000000000000012414772654014342 5ustar rootrootarmory-0.92.3/windowsbuild/Windows Build Instructions.docx0000644000000000000000000005011212414772654022357 0ustar rootrootPK!!}[Content_Types].xml (MO@&f]`pP<*v Y4@QҤ}+]D IY72Ӕ{a&55 zHm0e(g&ցz-)wB~)NKk҃{Oy>$ dcJpPR" H7 )=8So ဍJUH"4aϬk:Crfs%їn[ Ts]$͊lr'AV *̆yKOm{@>%{m7V%LbǼ$I'Th[! ճ{6Ges,sCbNRS;AA3yHA9b3djPK!N _rels/.rels (JA a}7 "Hw"w̤ھ P^O֛;<aYՠ؛`GkxmPY[g Gΰino/<<1ⳆA$>"f3\ȾTI SWY ig@X6_]7~ fˉao.b*lIrj),l0%b 6iD_, |uZ^t٢yǯ;!Y,}{C/h>PK!,s[tfC word/_rels/document.xml.rels (Vr03?d|'n/-3=p0ymȒn꘯gӔ֡&HrVo{݋Me&wP;FI<&`˴-y4A6YH0| I', GF%(*`$wP/J f11'Yی_4o{lZS ,=q(9R0ڮ8 .l]ױotGDg1 ADixPf͖ҮXXxreᛟ$2W[dDF Hn)$fs 9DfUpmp%R=t@j wMM"O¹@9P{QgL[ΎuPo ܏wvb|&r͂MJ,-qu2u_amׇONE2^[ ]WK\Im!o_n19|zk[w-7\* =yekX~j^$7 5-ֺޭSͰUŃ7PK!l1f<Jword/document.xml]nH_`ߡZ ,-Y'=PdYbqY%+U?, վ^]dS$eER,Y?в(֩S;nny,}U +ߧt7~5y%}dn܉~wOпJM)r\=s۠>?|rѣu9H|S8ۡGDOѓn\SX#y#N8>DZHWU. uq(v7ZO~~}% dfнL^a{NwM4vfK/~艾d{~౳Pj9N+Vz5ekϱ_yuyuo:w6G3ymUX.n9;NBZtTIH'EQ;]U(ډCCq<3N}ԃk\'MnUdĈb.y|+ͯK8xDȲCKvq0`~x+[} } VFA{ֿI/ͅh2;hO輑F{,b"\t]a0%޹Lb:-g3˞K|6 A%!Bօm qHuLiʉ.gox ijJz+^kpM+&R6ID9ak_o=ՃM( ܨϗ &k MN}9 TG:p@8^{3oSd{:ik&(@mL^h/ Hr7IhA&ADΆxV @1nl5 o^Ne\Wk|q6&@ "@ 2Ap8>%0y|UD|z XpbS#SQֲ'HJJȦ'*pUf8B" X '#.vC;gv|=Fp㇚ﾭ_͢{i@ xDr5x-~GZDW̕45ȏC=OW_:? 6ӜЮ SFY@Q6[QgӔYkļ1 Ul^\A(%W19$H[0:?~/nBpvܛmdoόZ6B<$[vH[~,#ߪDR{;PؒcdJA\3~dvӛd>0%X[256 c&\875#h|Ri Ɋ&wz{p2L0bIc. -sg7Tݥc:0a:g2ϟމ׎{gY~2,=9  A`n7iʒi89M J)W'I%YDiGC/:sq)Ԩ!fq\sUsv$+gKU֖JkH׫"a4hT`C#ΓC~@V3".sBA2Xeu! AVɚYH;3X/9A+{9Z9!޹#O,~V}QUtB!U4oh]aS1u}fk\q.HӸ>&>Ӽ~0y R ag؉ZH2]}4ElC:bǭ ziM̕N[&ml'e%qCl:*eOTt- E3 D0j_- *s4S3^6hj|vYGh:zMׂc|1%tlVjXZliS7B5$ոӻ.k+m4zv/Et[*e͓ÏIF~A#"`n1$@ލԀa!ZϧO~O`qKabK^ua9ZR>袂՚GY| W\6QGsX}7W~V*ǞrH PΏglF#(tr[GDa$Ye&zh2 -BSPXz_'"Tع@r9@ܽO!-S/dn&ϱwu+4FZ_E_9gzϩ[{JYr}v0GubL,KmbAh>y (fxQ"" >a]$o%@sJߐnbeMQB 6d??hOz(++7M=Z0L[Z@l;ywo (W(wTf?zY9P,tyX̗3P5;MW$v?xocxÀwtMԨ3,y[2tw\Щgໂꋵ4rJ4Q&+R Z Lj !#Vs[^iELorhwn'i>@W'2/8$'+<qۂ`aA{/8\CE"$GeQ }ݟ{Y<SҋO|rtU/hP3B x"鼡R(]OcaK5$εK._`cN e &k`w? %D`%}v -XU'ID#]>mvg` 7]G霗a#'3 /NDyZhK}]{\oWPv/dxV9[T%,9Cx"۬;(X\h@eSk^ϥ"]tQ_VÒOd%ZDNxdXrKDbz`CuU,hֵ1%a"{U`9$4DJ_#mHnKֹ̺;s]uŠknpI|rd wy}`mB|ͨRG4Ҋr^YrweY#kZ7b3n9ny."uN-*WX1.jD3)̧{e&,ULe2tfʠSn&)b0 G*I_4P2Ap'gI颮vևEc+ 7oI9FU}66Ey}랖Ȃ0+It_tI4k>/fVh%<$W葾; 2.NC)Oɧ>][zҰDFsQ c1N웣ˏzׂҍH鲈L ^uש?dx]j8J-iCz.@&ajE\A-_l?~ 3$Xڋ6cаl,\Uxkiˑ']e!ӏɅ ͇6[GQC =vJC/}pyv9@`њtUe[c)4$ !)O^rC$y@/yH*񄴽)޵߻UDb`}"qۋJחX^)I`nEp)liV[]1M<OP6r=zgbIguSebORD۫qu gZo~ٺlAplxpT0+[}`jzAV2Fi@qv֬5\|ʜ̭NleXdsjcs7f W+Ն7`g ȘJj|h(KD- dXiJ؇(x$( :;˹! I_TS 1?E??ZBΪmU/?~xY'y5g&΋/ɋ>GMGeD3Vq%'#q$8K)fw9:ĵ x}rxwr:\TZaG*y8IjbRc|XŻǿI u3KGnD1NIBs RuK>V.EL+M2#'fi ~V vl{u8zH *:(W☕ ~JTe\O*tHGHY}KNP*ݾ˦TѼ9/#A7qZ$*c?qUnwN%Oi4 =3N)cbJ uV4(Tn 7_?m-ٛ{UBwznʜ"Z xJZp; {/<P;,)''KQk5qpN8KGbe Sd̛\17 pa>SR! 3K4'+rzQ TTIIvt]Kc⫲K#v5+|D~O@%\w_nN[L9KqgVhn R!y+Un;*&/HrT >>\ t=.Tġ S; Z~!P9giCڧ!# B,;X=ۻ,I2UWV9$lk=Aj;{AP79|s*Y;̠[MCۿhf]o{oY=1kyVV5E8Vk+֜\80X4D)!!?*|fv u"xA@T_q64)kڬuV7 t '%;i9s9x,ڎ-45xd8?ǘd/Y|t &LILJ`& -Gt/PK!sǽ word/settings.xmlV[o6~`y$Gb!Na;"^)DDxIYq}I15(VI|st+M_DU0EC~}yڌo67  vƀYı!}%$ Ő Vk$2"Sh! h=>NUgܳ Rk bԇ0i5Wێ-;=@}Ie^BBSuiAG}BbUC$- %gM1+Ġ8PKJ#$Oz VD57J ׈YC*HwuǟJ(x%Z $#B'cJ(%G@o8і__!L(CL,aΜtlV!NI0YO$Ld |ICh77|9Y뾹.Y%yvs=dA5LdF^Nt}6]w{C=xdjWvHn>OnXmzR+°s< +fEC;KHϸ eg"V*JoSH̥ЭGy$,u[A(QY0XyD|Ҋ롪[o0>Aڧv5ݥOzfyjH+ δ@>`yLLmtfE :-}'(n E䓠Hb30@Dѣc_`a.k^hͅE:jAJu xKW4&ЎUvDK؀F(-?PK!X 5Iword/styles.xml\Ks6wS{pd=b%*׉Ϥi3EB&$Tw! ŅL9&a/I}fYE}xn^^^i"e ϯ˼xY4L…)h3e)tEgHAWYۍ'k}r["N"CE ;˭{2'I pJ05Q's|Nx0iLa dG,QTt;)Sn'E-9fhQK8ɇ-q.7]RpP|.fEB:J*|Urq/}LYJE''_%c|3ӼV{Z"[rty Λ'yЧwFSg_y 7]gho접jX~\Lg.?sMٹ-D:CEzyT>.əGC<*'|/9ˀ@RPK|yLNOXδllR@ypjٽ`MI@qN-I,oZFꢔsެAaț4 y!oP X`8J oMrv32/7A6yPF, 5,Cuaț4 y!o0M @ɻd8&`9s*yUɛC\qs&8;&owjj,gհ ypK0h, n!oFÐ7h& C 2ypj @`MrFɛ (ީ9jX X/ɛCNrh&h4 y!oP X`8J gz0@U&9sC#yM@qvMgՐ7A5,Cuațٛ @8 E.n  C 2ypj @`Mry[zϠ@8 ,"+};'`bKxPUEOb%@P|sWNa:?RIpVX0o@P\˓dxBζY.A%@X"w AGNu>0t3V;p2*eUR&}F9FWj ]9բϟf3(Cͬ@XUu+(Սlm=]G=H/_$R s\T41Ꮓn|" "XYp؉w=an7aVVt_+w")Df"c!v""!l #fMF,WKm F cc$G&G!,ilr~pUX~M%Am1Rї@@5Blۇl]9kV(D>?ú\I0ku1Q*ntXGl^j[|ճem4X[ϴ٫ӛz{eǵ7R9tFsf9G3MD:S윌Eֶm]f;;ncU,:EfyԷUjU7&T_ 9\񺒷p-m_A{^)T|wEQ-f2 Z\yRbYj:809QkW6ʯx#%,TO5}-e(ɽ^q,Ywf]G{D_eKww s3__+C5yx:/1O 2PK! &Lword/stylesWithEffects.xml\[s۶~?3?p+TNx&MȞ>CdqL^q4cц"KOWiQz˲j4JY*DbD8ۭ^$t<_q"kxiVݑDL,Xi1r#58 XXaUd隡5],X]Ka#4,WJE|TE:=,WY"q#P=?>ʻz^}_PUlƒIc 0DsϿZ,:et*3]PN{B胓Ŕ.^e_5ȥs0W P.wW2T7W^1EUΔO_3c~5ӼUZXd複647O">Oɍֱ8u8 n6-A"UXȚtg_~ l[ Ys;Z<%t=YzyT.ICC<*'U,bܯY@JPK~yLM/XִllJ@upjٽP&::Zf&kIj1*sQu dN!o0M @ɻd8&`Ys2ypͣ*7ȚRN?@ɛb6&`L`#` Caț4 y!o0MO Ñ7˚ ɛdML b 䍻7:@u&XGBJPː7 $1j&X4 y!o0MO Ñ7˚ ɛdML knh$o܌ߝ (7::B500Fv@ژvm>35dQ B͎%jI;5:C{W j|hYk͡m<7Q]]RFҳ>I_qKJaw.;8j[~*B/ w7 Ui蘵M;韥;Q3SD6cSw_:EtRǺSă<\d %$:84G/PKw乽nT5`)ÃW}j;"j-L+AM[ʨKiD<\DwV2yକhC,tnGI)wzUVtf΁*U1QٚYF{Mg਺@ Y'" E'vN7m-0ɻͫw6OD,\"i<{p `45-F 2HS9$~(`=2םUvX~/Bg pS>n"`-wWjSmd7v ު͕H JmQ5F_LJi C06g5w͍rTS@wc7%,DIQPK!gldocProps/app.xml (Sn0?ǔ'H5ACjeHd_ߥTtSt}hv4N{AY,,H(]O׋QFhkpY0w'X{G .F`,v"LlZ߉H2۶J⽕ofUu=ip#a90.񣤍I_xssZD?=il쀍YmV)b_X~}sl /d$mu ,K紒"ⱷH k6(߼^CL26 flи"x+t@`0 word/fontTable.xmlێ0E+"qBhˆ"D>)i !cowp H4$ۭ4|}-H-Sֈ7uZX!R3Rz_aV`N3_.}WwyK%1)ƍqE!xo^  RVprǸm+g5ki&&J΂-vNh 4O?u,WȮujFQVzŌaTF=^m ttNƀ́q'LKu:v Hft$| l<^m6"kT$ ^$Ү?|Y3%s'MK! @j Ѝ_HPXʅĉoHΈD>0S0Fd#8rr}Ls0:p0,qrsZB":C)x`޼wb-⁳2뻮 &I̙`sَq|0>s 8#DH8Gc֜qh3p O3$i&n Ί~E 2@y+-bdn ,SZĚ&ý.f m`({pȘA$yP?}XgQUIa2Z:pK3?rʪt<{Ta;̼]'ݺKaE2)dÖ h*$G"  lkJ WCqU0Y28}|p飯j%Ih0 Eword/fontTable.xmlPK-!6MQGword/webSettings.xmlPK-!ab)Iword/numbering.xmlPK ILarmory-0.92.3/windowsbuild/GNU Affero General Public License (AGPL) Version 3.0.rtf0000644000000000000000000016514312414772654025521 0ustar rootroot{\rtf1\ansi\ansicpg1252\uc1\deff0\stshfdbch0\stshfloch0\stshfhich0\stshfbi0\deflang1033\deflangfe1033{\fonttbl{\f0\froman\fcharset0\fprq2{\*\panose 02020603050405020304}Times New Roman;} {\f2\fmodern\fcharset0\fprq1{\*\panose 02070309020205020404}Courier New;}{\f36\froman\fcharset238\fprq2 Times New Roman CE;}{\f37\froman\fcharset204\fprq2 Times New Roman Cyr;}{\f39\froman\fcharset161\fprq2 Times New Roman Greek;} {\f40\froman\fcharset162\fprq2 Times New Roman Tur;}{\f41\froman\fcharset177\fprq2 Times New Roman (Hebrew);}{\f42\froman\fcharset178\fprq2 Times New Roman (Arabic);}{\f43\froman\fcharset186\fprq2 Times New Roman Baltic;} {\f44\froman\fcharset163\fprq2 Times New Roman (Vietnamese);}{\f56\fmodern\fcharset238\fprq1 Courier New CE;}{\f57\fmodern\fcharset204\fprq1 Courier New Cyr;}{\f59\fmodern\fcharset161\fprq1 Courier New Greek;} {\f60\fmodern\fcharset162\fprq1 Courier New Tur;}{\f61\fmodern\fcharset177\fprq1 Courier New (Hebrew);}{\f62\fmodern\fcharset178\fprq1 Courier New (Arabic);}{\f63\fmodern\fcharset186\fprq1 Courier New Baltic;} {\f64\fmodern\fcharset163\fprq1 Courier New (Vietnamese);}}{\colortbl;\red0\green0\blue0;\red0\green0\blue255;\red0\green255\blue255;\red0\green255\blue0;\red255\green0\blue255;\red255\green0\blue0;\red255\green255\blue0;\red255\green255\blue255; \red0\green0\blue128;\red0\green128\blue128;\red0\green128\blue0;\red128\green0\blue128;\red128\green0\blue0;\red128\green128\blue0;\red128\green128\blue128;\red192\green192\blue192;\red204\green204\blue204;}{\stylesheet{ \ql \li0\ri0\widctlpar\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \fs24\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 \snext0 Normal;}{\*\cs10 \additive \ssemihidden Default Paragraph Font;}{\* \ts11\tsrowd\trftsWidthB3\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\trcbpat1\trcfpat1\tscellwidthfts0\tsvertalt\tsbrdrt\tsbrdrl\tsbrdrb\tsbrdrr\tsbrdrdgl\tsbrdrdgr\tsbrdrh\tsbrdrv \ql \li0\ri0\widctlpar\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \fs20\lang1024\langfe1024\cgrid\langnp1024\langfenp1024 \snext11 \ssemihidden Normal Table;}{\s15\ql \li0\ri0\widctlpar \tx916\tx1832\tx2748\tx3664\tx4580\tx5496\tx6412\tx7328\tx8244\tx9160\tx10076\tx10992\tx11908\tx12824\tx13740\tx14656\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \f2\fs20\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext15 \styrsid3877315 HTML Preformatted;}}{\*\latentstyles\lsdstimax156\lsdlockeddef0}{\*\pgptbl {\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0 \ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0 \brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp0\itap0\li0\ri0\sb0\sa0}{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1 \li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0 \sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp239\itap0\li0\ri0\sb0\sa0\brdrt \brdrs\brdrw15\brdrcf17 \brdrl\brdrs\brdrw15\brdrcf17 \brdrb\brdrs\brdrw15\brdrcf17 \brdrr\brdrs\brdrw15\brdrcf17 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1 \li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0 \sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp120\itap0\li0\ri0\sb0\sa0}{\pgp\ipgp223\itap1 \li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0 \sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp140\itap0\li0\ri0\sb0\sa0}{\pgp\ipgp223\itap1 \li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0 \sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp208\itap1\li0\ri0\sb0\sa0}{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1 \li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0 \sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp259\itap0\li0\ri0\sb0\sa0\brdrt\brdrnone\brsp40 \brdrl\brdrnone\brsp40 \brdrb\brdrnone\brsp40 \brdrr\brdrnone\brsp40 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl \brdrnone\brsp240 }{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }{\pgp\ipgp155\itap0\li0\ri1500\sb0\sa0}{\pgp\ipgp223\itap1\li0\ri0\sb0\sa0\brdrl\brdrnone\brsp240 }}{\*\rsidtbl \rsid3877315\rsid7430913\rsid7825306\rsid8616255\rsid15162665} {\*\generator Microsoft Word 11.0.5604;}{\info{\title ********************************************************************************}{\author vbox}{\operator vbox}{\creatim\yr2012\mo4\dy18\hr15\min47}{\revtim\yr2012\mo4\dy18\hr15\min49}{\version5} {\edmins6}{\nofpages8}{\nofwords4960}{\nofchars28276}{\nofcharsws33170}{\vern24689}}\margr1620 \widowctrl\ftnbj\aenddoc\noxlattoyen\expshrtn\noultrlspc\dntblnsbdb\nospaceforul\hyphcaps0\formshade\horzdoc\dgmargin\dghspace180\dgvspace180\dghorigin1800 \dgvorigin1440\dghshow1\dgvshow1\jexpand\viewkind1\viewscale100\pgbrdrhead\pgbrdrfoot\splytwnine\ftnlytwnine\htmautsp\nolnhtadjtbl\useltbaln\alntblind\lytcalctblwd\lyttblrtgr\lnbrkrule\nobrkwrptbl\snaptogridincell\allowfieldendsel\wrppunct \asianbrkrule\rsidroot3877315\newtblstyruls\nogrowautofit \fet0\sectd \linex0\endnhere\sectlinegrid360\sectdefaultcl\sectrsid3877315\sftnbj {\*\pnseclvl1\pnucrm\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl2\pnucltr\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl3\pndec\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl4\pnlcltr\pnstart1\pnindent720\pnhang {\pntxta )}}{\*\pnseclvl5\pndec\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl6\pnlcltr\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl7\pnlcrm\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl8\pnlcltr\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl9\pnlcrm\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}\pard\plain \s15\ql \li0\ri0\widctlpar\tx916\tx1832\tx2748\tx3664\tx4580\tx5496\tx6412\tx7328\tx8244\tx9160\tx10076\tx10992\tx11908\tx12824\tx13740\tx14656\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid3877315 \cbpat8 \f2\fs20\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 {\b\fs16\cf2\insrsid3877315\charrsid3877315 ***************************************}{\b\fs16\cf2\insrsid7825306 \par }{\fs16\cf2\insrsid3877315\charrsid3877315 \~\~Armory -- Bitcoin Client Software \par \par \~\~Copyright (C) 2011-2012, }{\fs16\cf2\insrsid7825306 \par }{\fs16\cf2\lang1035\langfe1033\langnp1035\insrsid7825306 }{\fs16\cf2\lang1035\langfe1033\langnp1035\insrsid15162665 }{\fs16\cf2\lang1035\langfe1033\langnp1035\insrsid3877315\charrsid7825306 Alan C. Reiner }{ \fs16\cf2\lang1035\langfe1033\langnp1035\insrsid7825306 \par }{\fs16\cf2\lang1035\langfe1033\langnp1035\insrsid15162665 }{\fs16\cf2\lang1035\langfe1033\langnp1035\insrsid7825306 }{\fs16\cf2\lang1035\langfe1033\langnp1035\insrsid3877315\charrsid7825306 \par }{\fs16\lang1035\langfe1033\langnp1035\insrsid3877315\charrsid7825306 \par }{\fs16\insrsid3877315\charrsid3877315 This program is free software: you can redistribute it and/or modify}{\fs16\insrsid7825306 }{\fs16\insrsid3877315\charrsid3877315 it under the terms of the GNU Affero General Public License as}{\fs16\insrsid7825306 }{\fs16\insrsid3877315\charrsid3877315 published by the Free Software Foundation, either version 3 of the}{\fs16\insrsid7825306 }{\fs16\insrsid3877315\charrsid3877315 License, or (at your option) any later version. \par \par This program is distributed in the hope that it will be useful,}{\fs16\insrsid7825306 }{\fs16\insrsid3877315\charrsid3877315 but WITHOUT ANY WARRANTY; without even the implied warranty of}{\fs16\insrsid7825306 }{\fs16\insrsid3877315\charrsid3877315 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the}{\fs16\insrsid7825306 }{\fs16\insrsid3877315\charrsid3877315 GNU Affero General Public License }{\fs16\insrsid7825306 }{\fs16\insrsid3877315\charrsid3877315 for more details. \par \par }\pard \s15\ql \li0\ri0\widctlpar\tx916\tx1832\tx2748\tx3664\tx4580\tx5496\tx6412\tx7328\tx8244\tx9160\tx10076\tx10992\tx11908\tx12824\tx13740\tx14656\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid7825306 \cbpat8 {\b\fs16\cf2\insrsid7430913 \par }{\b\fs16\cf2\insrsid7825306\charrsid3877315 ***************************************}{\b\fs16\cf2\insrsid7825306 \par }\pard \s15\ql \li0\ri0\widctlpar\tx916\tx1832\tx2748\tx3664\tx4580\tx5496\tx6412\tx7328\tx8244\tx9160\tx10076\tx10992\tx11908\tx12824\tx13740\tx14656\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid3877315 \cbpat8 { \fs16\insrsid3877315\charrsid3877315 \~\~\~ \par If you wish to use this work in a way not compliant with the AGPLv3 license, please contact me to work out an agreement for}{\fs16\insrsid7825306 }{\fs16\insrsid3877315\charrsid3877315 dual-licensing. alan.reiner@gmail.com}{\fs16\insrsid3877315 \par \par }{\fs16\insrsid3877315\charrsid3877315 \par \par }\pard \s15\ql \li0\ri0\widctlpar\tx916\tx1832\tx2748\tx3664\tx4580\tx5496\tx6412\tx7328\tx8244\tx9160\tx10076\tx10992\tx11908\tx12824\tx13740\tx14656\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid7825306 \cbpat8 { \b\fs16\cf2\insrsid7825306\charrsid3877315 ***************************************}{\b\fs16\cf2\insrsid7825306 \par }\pard \s15\ql \li0\ri0\widctlpar\tx916\tx1832\tx2748\tx3664\tx4580\tx5496\tx6412\tx7328\tx8244\tx9160\tx10076\tx10992\tx11908\tx12824\tx13740\tx14656\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid3877315 \cbpat8 { \b\fs16\cf2\insrsid7825306\charrsid3877315 \par }{\b\fs16\insrsid3877315\charrsid3877315 \~}{\b\fs16\insrsid8616255 }{\b\fs16\insrsid3877315\charrsid3877315 \~}{\b\fs16\cf2\insrsid3877315\charrsid3877315 GNU AFFERO GENERAL PUBLIC LICENSE \par }{\b\fs16\cf2\insrsid7825306 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 \~}{\b\fs16\cf2\insrsid8616255 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 \~\~\~Version 3, 19 November 2007 \par }{\b\fs16\cf2\insrsid7825306 \par }{\b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{ \b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{ \b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{ \b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{ \b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{ \b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{\b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{ \b\fs16\cf2\insrsid3877315\charrsid3877315 -}{\b\fs16\cf2\insrsid7825306 }{\fs16\insrsid3877315\charrsid3877315 \par }{\fs16\insrsid7825306 \par \par }{\fs16\insrsid3877315\charrsid3877315 Copyright \'a9 2007 Free Software Foundation, Inc. \par Everyone is permitted to copy and distribute verbatim copies of this license \par document, but changing it is not allowed. \par \par Preamble \par \par The GNU Affero General Public License is a free, copyleft license for software \par and other kinds of works, specifically designed to ensure cooperation with the \par community in the case of network server software. \par \par The licenses for most software and other practical works are designed to take \par away your freedom to share and change the works. By contrast, our General Public \par Licenses are intended to guarantee your freedom to share and change all versions \par of a program--to make sure it remains free software for all its users. \par \par When we speak of free software, we are referring to freedom, not price. Our \par General Public Licenses are designed to make sure that you have the freedom to \par distribute copies of free software (and charge for them if you wish), that you \par receive source code or can get it if you want it, that you can change the \par software or use pieces of it in new free programs, and that you know you can \par do these things. \par \par Developers that use our General Public Licenses protect your rights with two \par steps: (1) assert copyright on the software, and (2) offer you this License \par which gives you legal permission to copy, distribute and/or modify the software. \par \par A secondary benefit of defending all users' freedom is that improvements made in \par alternate versions of the program, if they receive widespread use, become \par available for other developers to incorporate. Many developers of free software \par are heartened and encouraged by the resulting cooperation. However, in the case \par of software used on network servers, this result may fail to come about. The GNU \par General Public License permits making a modified version and letting the public \par access it on a server without ever releasing its source code to the public. \par \par The GNU Affero General Public License is designed specifically to ensure that, \par in such cases, the modified source code becomes available to the community. It \par requires the operator of a network server to provide the source code of the \par modified version running there to the users of that server. Therefore, public \par use of a modified version, on a publicly accessible server, gives the public \par access to the source code of the modified version. \par \par An older license, called the Affero General Public License and published by \par Affero, was designed to accomplish similar goals. This is a different license, \par not a version of the Affero GPL, but Affero has released a new version of the \par Affero GPL which permits relicensing under this license. \par \par The terms and conditions for copying, distribution and modification follow: \par \par ******************************************************************************** \par \par TERMS AND CONDITIONS \par \par 0. Definitions. \par "This License" refers to version 3 of the GNU Affero General Public License. \par \par "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. \par \par "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. \par \par To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. \par \par A "covered work" means either the unmodified Program or a work based on the Program. \par \par To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under a pplicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. \par \par To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. \par \par An interactive user interface displays "Appropriate Legal Not ices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that li censees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. \par \par 1. Source Code. \par The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. \par \par A "Standard Interface" means an interface that either is an official standard defined by a recognized stan dards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. \par \par The "System Libraries" of an executable work include anything, other than the work as a whole, th at (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation i s available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to pr oduce the work, or an object code interpreter used to run it. \par \par The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, includin g scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. \par \par The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. \par \par The Corresponding Source for a work in source code form is that same work. \par \par 2. Basic Permissions. \par All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms y our unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equival ent, as provided by copyright law. \par \par You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered w orks for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. \par \par Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. \par \par 3. Protecting Users' Legal Rights From Anti-Circumvention Law. \par No covered work shall be deemed part of an effective technological measure under any app licable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. \par \par When you convey a covered work, you waive any legal power to forbid ci rcumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforc ing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. \par \par 4. Conveying Verbatim Copies. \par You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absen ce of any warranty; and give all recipients a copy of this License along with the Program. \par \par You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. \par \par 5. Conveying Modified Source Versions. \par You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: \par \par a) The work must carry prominent notices stating that you modified it, and giving a relevant date. \par b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". \par c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. \par d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. \par A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and it s resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. \par \par 6. Conveying Non-Source Forms. \par You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: \par \par a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. \par b) Convey the object code in, or embod ied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses t h e object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physi cally performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. \par c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternati ve is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. \par d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equival ent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the C orresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of wh at server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. \par e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. \par A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. \par \par A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, r egardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industria l or non-consumer uses, unless such uses represent the only significant mode of use of the product. \par \par "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modifi ed versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely bec ause modification has been made. \par \par If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not a pply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). \par \par The requirement to provide Installation Information does not include a requirement to continu e to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself material ly and adversely affects the operation of the network or violates the rules and protocols for communication across the network. \par \par Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special passwor d or key for unpacking, reading or copying. \par \par 7. Additional Terms. \par "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the e ntire Program remains governed by this License without regard to the additional permissions. \par \par When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. \par \par Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: \par \par a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or \par b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or \par c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or \par d) Limiting the use for publicity purposes of names of licensors or authors of the material; or \par e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or \par f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contra ctual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. \par All other non-permissive additional terms are considered "further restrictions" within the meaning of sect ion 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. \par \par If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. \par \par Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. \par \par 8. Termination. \par You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). \par \par However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable mean s prior to 60 days after the cessation. \par \par Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of v iolation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. \par \par Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. \par \par 9. Acceptance Not Required for Having Copies. \par You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a conse quence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. \par \par 10. Automatic Licensing of Downstream Recipients. \par Each time you convey a covered work, the recipient automatically receives a licen se from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. \par \par An "entity transaction" is a transaction transferring control of an organ ization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatev e r licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with re asonable efforts. \par \par You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, a nd you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. \par \par 11. Patents. \par A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". \par \par A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infrin ged only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. \par \par Each contributor grants yo u a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. \par \par In the following three p aragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a p arty means to make such an agreement or commitment not to enforce a patent against the party. \par \par If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, yo ur conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. \par \par If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the cover ed work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. \par \par A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, und e r which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in conne c tion with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. \par \par Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. \par \par 12. No Surrender of Others' Freedom. \par If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covere d work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conve ying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. \par \par 13. Remote Network Interaction; Use with the GNU General Public License. \par Notwithstandi ng any other provision of this License, if you modify the Program, your modified version must prominently offer all users interacting with it remotely through a computer network (if your version supports such interaction) an opportunity to receive the Cor r esponding Source of your version by providing access to the Corresponding Source from a network server at no charge, through some standard or customary means of facilitating copying of software. This Corresponding Source shall include the Corresponding So urce for any work covered by version 3 of the GNU General Public License that is incorporated pursuant to the following paragraph. \par \par Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work lice nsed under version 3 of the GNU General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the work with which it is combined will remai n governed by version 3 of the GNU General Public License. \par \par 14. Revised Versions of this License. \par The Free Software Foundation may publish revised and/or new versions of the GNU Affero General Public License from time to time. Such new versions will be simi lar in spirit to the present version, but may differ in detail to address new problems or concerns. \par \par Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU Affero General Public License "o r any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU Af fero General Public License, you may choose any version ever published by the Free Software Foundation. \par \par If the Program specifies that a proxy can decide which future versions of the GNU Affero General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. \par \par Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. \par \par 15. Disclaimer of Warranty. \par THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. \par \par 16. Limitation of Liability. \par IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER P ARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. \par \par 17. Interpretation of Sections 15 and 16. \par If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civ il liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. \par \par }\pard\plain \ql \li0\ri0\widctlpar\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid3877315 \fs24\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 {\fs16\insrsid3877315\charrsid3877315 END OF TERMS AND CONDITIONS}{\fs16\insrsid3877315 \par }{\fs16\insrsid7430913 \par \par \par }\pard\plain \s15\ql \li0\ri0\widctlpar\tx916\tx1832\tx2748\tx3664\tx4580\tx5496\tx6412\tx7328\tx8244\tx9160\tx10076\tx10992\tx11908\tx12824\tx13740\tx14656\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid7430913 \cbpat8 \f2\fs20\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 {\b\fs16\cf2\insrsid7430913\charrsid3877315 ***************************************}{\b\fs16\cf2\insrsid7430913 \par }{\fs16\insrsid7430913\charrsid3877315 \par This li}{\fs16\insrsid7430913 cense applies to all source code \par in this project EXCEPT}{\fs16\insrsid7430913\charrsid3877315 : \par \~\~\~\~ \par \~\~\~\~\~\~\~\~\~\~cppForSwig/cryptopp/* \par \~\~\~\~\~\~\~\~\~\~qtreactor4.py \par \~\~\~\~\~\~\~\~\~\~qrcodenative.py \par \~\~\~\~ \par Everything in the cryptopp directory }{\fs16\insrsid7430913 \par }{\fs16\insrsid7430913\charrsid3877315 is considered public domain according \par t}{\fs16\insrsid7430913 o http://www.cryptopp.com and the two \par python files are copyrighted by others \par but freely distributed with original \par copyright notices intact. \par }{\fs16\insrsid7430913\charrsid3877315 \par \par }\pard\plain \ql \li0\ri0\widctlpar\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid3877315 \fs24\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 {\fs16\insrsid7430913\charrsid3877315 \par }}armory-0.92.3/windowsbuild/Armory_Setup_64bit.warsetup0000644000000000000000000027203712414772654021612 0ustar rootroot C:\Program Files (x86)\Jgaa's Internet\War Setup\Licenses false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false 0 false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false 0 3 0 true GNU Affero General Public License (AGPL) Version 3.0 armory-0.92.3/windowsbuild/Armory_Setup_32bit.warsetup0000644000000000000000000016736512414772654021614 0ustar rootroot C:\Program Files\Jgaa's Internet\War Setup\Licenses false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false 3 false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false false 0 3 0 true GNU Affero General Public License (AGPL) Version 3.0 armory-0.92.3/img/0000755000000000000000000000000012414772654012404 5ustar rootrootarmory-0.92.3/img/armory_logo_h36.png0000644000000000000000000006005412414772654016130 0ustar rootrootPNG  IHDR%#)sRGBbKGD pHYs.#.#x?vtIME "( IDATx_v6fkKZ'''VVVm)PiQ   J P  !I kؒqAx1 C 5h3fj-;O ### 42 5#+++MS [j"PA1o !!!\ChFS+DA,2 5 _4DB_vVVVVVT x%TW<UVVVVVT1lLS{-* " D x  hQ+0In j6s$$$ =7 |&[K `IPPgF "d J'$ɑ}Ɍ [K,` P ?$<4 0xƄP6es ?5h1db 2RCPCQC _(vo>[ &2 }u29}C*,`'h*"1Z@RDE)?HR>t[#[f% e=aEn!P o><7.7$+VILj"{l  zqJI y A:GB8z >ץe#`#F'<a8'@ۺ+ &Q4}Ej(((oZtX|-M!7=يQC 很޺ -b2.3غ+++^ z|&&&wz###N .Bu|0IDATv!!!%/xf<#+2 ݰp 4~!̓9***&&&A(5o yẁ̔:̓9M T \! ^#Έ ZX̔:e#i"4{(g˔:666q&i {k H,dW˔;˔;w%2m  $!<)))"""|'}' Ahs222r'!2EnʤZ T8^"ʣȢ---C555]!IENDB`armory-0.92.3/img/armory_logo_fullres.png0000644000000000000000000022275612414772654017215 0ustar rootrootPNG  IHDRf"sRGBbKGD pHYs.#.#x?vtIME 2$Q IDATxw|\ՙNѨ˶,24cBh giMȦn !dِFچ$mmp&j+]fFؚs9=}{`0U't|s^:;Es}~CgU9*ߣCl䱯˖Sc'lX>r{ v,Ұm}3h^[1tw'l}6XL aKJ`6(G /(H}>ܤ PM LtA#:0m!岯< |8UF U ]؞x/ab:OɪZ?c`0`(N2;J7\q*GM3)6>_]RU O1 V0Œ`0Dyd#T`}َTq{;ǾNEU > >i`0b`0Sk @2 9p3n.o3) hX!O&zwl}[.z9ǿnk)W>.576`0L`J-2xOsMM9HʫXM׷ѵV>zm>'9O0 Ä$5 Zd:Fi$^3I\*V}m 3DwLzOGq`q*g,6X) GVL`0&xT`0Ծ(`LC8;{7j(կ'OO|Yb{2Y^&z`0 he`0&Vk7k@SeN߻w}]|*?e0`0`0& V3Sy4ϩVһzCۂ3m% I+I 3dDd"E 5j| ;)1 DUEBMl*ru'6adu 3}Rf3 3-<,Q7f7?EL]zɀ@c߾``0a0FX xMϺ:ȭ\5_9)ZhFpm೑ʚ`ђd[%;H33^Ɣc0S0Q@SLd[ uQ;Eb:5٧оlFP0`00c8,_&oa& wofb)!K 0f Sf1D[;0S0q5&083XVŒcʮXi_ۍ0S0h `CQD"K PwP; %%* "Wխ~.pk9LNӘI+8 T'0y8‘&#T(̠InT)PݶŒّ*4=%ln =`0 űL6DY(#$2ܯf0a1xyMQӠI)ʤ2p 2Cl߰{#ؙq 61v7vO9_RwYQp!3Wr O݆ 嬏>a`0 nj &7+Vh~\+Ĺdd8F{,3$'hʪ#N aOʜsMtƴ#>x@erD} 6ef.JڜFwN:FSi9B_l*BpO4a0 aafbŊ3 )4o TH)ODL&qHRs/J>%cV(ҏΚ׃dL)rfܓtFiqiQjK۲wҴojMhB8e{e'2m?{m/qYR*̏dg@c0 3ǝ,_YD|hWioUOqFcl~kQ^ '@9K.Nr{Ga)84aɥoi7 o(\ʔLgEK&Oޘ"9f"Nsqza:"`>ZsSeDgp᷆5v>g) m&LAZ!ۗ~:ʥ7V};GOx2 ;f&hl} aʉW)9L># 13EE"1U]4b. X ӇEd#O|hEj+PEٸ/=%؀OfA@; ]找ahvR.GsIisz~Wzy:Nӧu* JHuilfu2HiQhN7ҴĶ?h$@x2:`So1Ե/7nc*±~3`0afbŊ8'e:*]wPxg|eg++pi]tԱl-?ܝ,bJ8۷}{+"M6aNll/W5%JyR7 ^^eU6 <_`J籴Y %Vm"Єg,3<9+I;$6khs&^Kq 8O(k;T`0L+Vtޯ-7?٭i8;Օ,e οEXf|Z~%N:%eJg[z,`Q w o0"c)TIOH)dRY\f{Y'NhC~*{hxR LÌ X@c2ز{q1"Gl~,}ᴔl=4ͿE [+F1 1S̩'WfoRVPqH('_*8\d~m`->pIrlFb۷ްU6bWUzcJʦk΋ޟB=dfg=|Ѿu2YMfnvOѳYڏ\LK7r4jsc{y~ヤQd$0ر.>=vj6 x/g acfŊAi$LQ8EXj+XGG3 /EF`W-:%ohc)ol1OL`M4mc;{~ɫc^%}&$wM$Bw?ٵؙq !&Zĺ $@S)/F1 IfjyUުCKq $F&o"h+r7/_%^㫾Uxx$2%ͼ'ό. ܈?$x;_4X[؟ٿsq!A7J6/rN&f9Vi|V?f*`0&&o-FU"Rh V3Mmk DZ;)QOrPTp?HWbA "O>pq(CE8DSvZIpiY./+\E}|B:ϭN߂ޱ߹}ۙ6{-1TUvM(]RNęz `FDT=XŪoE[44:kާENSWڀϩx,\KdGe_B++j"h 呶3YQL4laK~n,_綊gql}'kv1T.i*️ }oIQo~|+mEwc&Aۖ*v./@SN1N5`0$0sէ<0B0LBUv )W(u%ns]704ISE㙥d*Pp\~IZjJ*p'E*]_wT*eȘ ._\}b{={幵 F 5@oj;E/2J9q@c0 awUW蕪>O~_nzQ}݆4=K Tm)Xh 8YaFUBB SpܟǑ-68¥_-Y`z xXMd]יeѿ0nqgs~yer ^xޮy,-fg3|2'IEBz 4L7R+>(}} `3+W>^E&VV0.~w(*X!`8UxթLUW1bAN!n`K3[C߫ckA~;%3S*9K4lzbzm\?> fω%'Vd+ٵ<3IHzF=}l]1+>Hc0 a'\t+E`4hy#ȍo-k6Ia 3ʚ}{+oa!;˗A UEBHD;2%3*T=7PdkQx"sEVTxF \c e&b_pA|_/)~ȵШl%dGI'a 2&̤&6ހMeTaHF1 aiUe S`J0"`^D{pmd'@rl "|=z>"2j k >R#٥L@UkI}UXKߠW"2(k7 BӋLbG鏧H>= N<!+gLz[L X^b=h˔Y!㘆AFD":::T`0&-EUW T:ȐnU-7߰n`b|_Vrl ɫ o\U=RU<s"eUd!|46Œ7WQh^#-Xž7:SCO/m/H&cݗ2c{n? Lh\Hp%[|syb{cܵ8atIԩS5k@s u?}T`0&-^誫+'j0蒍{5#g?O8ϡHۊV{X9,^7j#ڙj,O ;pˌ1eA:@/UՇbL5о#Ld$D*o;D&yEaI *\^&5*b]zhn?, p4C8`L.V8T`0&b)UC+W>!R\q%ªkkU _AXM:2{{J[⤪TQE­`q3WAHnE, z'~wwm$rw|o}p,̏%2wpp;#⢅kB`ssAOǒi򫛹FE<yK4W9EW~fu&T=e'$~?-Ӝ&$Y{rH:N=ϲsz@3EGGӦ7T'aXf*`0& rQUSŧ(7#x3[oWŒvq+p3ʷqXŽTb^+>cb?+8?q&:ڬIF{س vn"2wLƬY3ΨGS`4Ԝ0r$+z|Qa*KZMU!Lq';@n'ɕgxuM"2C1cETɬdJf>"0~\wO"*sKL4xɫޙ<4ɻX{@ MDB5 ueyNm3eqv:u*;='v; 0C~)z6JM[CnŘ àx"2m!"U Dtƒ݉)v NLj}w}mH DHy sDӫʭ6Q^L4NscZO9e&2*{ v:$= & A:;;(Qfl`0<ZYywr,ěV5 c' *:e wS?œцGj")jٴɪ Uȁ!"et 쟮a7wg#tğwT:`cqJOfYvgkݑi#frIzSa3@S.MMMtvvRW7vc,+CG鯛 a"3Lj4U*N4+BHqĻ?{u>.O]DT5**F+܊w,C;dCjy UgBU3sKvaM#{:νf1OՐ ٭Lrz{cv4 ɬhJLZL>@`_?hf P ]:vw[v&(=wIN>›kVowVx"Smf̨NHdj )7ՠ V'd?$ӟӢq yҏ7"M5pv&E@m& X7F[eKoNvmyb0L0477[I1 PLXaf!有(E\Ǣ7;f{۵L*m)4_)\K:+p%˘ePYBBgA RC_`t]w SѬx#O<,"W+61/3L5XGu=4Zfdٻ['\,J.=3fϞM(z@RݦQ PL܈e \P0%B2#C$2D@(Dmpt Togd~+WX2teeUUԱ2:;N!-fX*vMi]XHY;2mA3DDfJ%mgk5#SgMN8fH2g`K:::6mbhV`I&b) M f3H[RTEPBBϞmu`8HK;+ZޮܕN/sAGwj K<ͫcehIpʱ2NT%QwpưD@Jskzyg84vqX?<ͱsUiu}-pϵ'mz @$P{ehK%k&[<$7L -#KfAm9gm+qϖeaY*X ,xJDlq2PH6ma.]J 6`0&0MEE%b)m.i a(zm1LC}K;"8c~򾹷\\ jw|:EQT5eXZ"v4)rjFj?mEHv="HN}|1G8g@X"YWhuc}r3?{lęÅ[˴U;iOSgց@s4mmmL2#ﺃc>0ۢWHOqQՐv-  Sպmblɒ%yw]x1O=D  <<^j2Թ7AUUb)! ,!f"-A"N Ng5 +ƘiJKZgMu@#:F/9|u]VQwF=ר~{IumBMv FM9Eh8u[i~{WUhlvfOt}vNO3P/jS6Y'8lSA픻ۦu+h!mqdl|NխPѧATG FacgUaIQ-^8 4u:C=aҶmTu[9r/$pzyO"ض=$0:pφ#"D˴1S7!"ݰ^]BZ9gꁖu=A$9{iw3Y~}o}{Ya6rpD$DLH ~0x,5&ЗwWzO-O `YP@ 0P?k> ?OضM"ID$] ĝ jYDH$2px |7F\DN m0_:s &o S.KUuWTcT5LvÇFUm"=qPUu版D$Y?(~@½ywvbY#"]g`?Х1"vQqIy}f>_=mr R޹z}wʽ;>1{gИFDjeY&˴1pO>hXD^D=mW۶M ~۶  O{҉'ؘd:8C (c.˲͕eY[&7z"#l6 m?)2vNt]]6BF,֩ZL# VHTZϥm1XpVAqf XUqɮ߱F{fU@Lf Ծ@c'VCQuPgW38{ݖ|b@X[R߹lf Aa&;BdPTGAoW; \h/^a" }oN]l{ q TUT pQ&*f70sSUC>ϭ|?n3?T*89' $]&)"EiyTU0A2zx+fIrL1O9QqT"򗆆dRGicıa,}\("-&޹{~&]c-"f>Smafo.k EdL:V,!}6'Ls˛,/QmF{)ݠdܲ;@LDb$U5iU"nݹuP`tҠ/"/W׾}PuojOh}_>l߿L`jRU-e=l*bWhRpB Dd:F[qfN8_;ʰ1d,4"Ֆ,Y2SUWճEdeYqwQqn}8[ie/ &SJ4!+\y{O{ҡtݜ.Q,bCo?X];y,3N6cs("-G`5͔I|sn[ªkA`Àp,Kdbe&Ϩ*mwQA1 zNyrJ|}fpɝA{R9+YJ l5}.7zı3u\A9U]8ztN˲m;SjUŋ,[ڵkٸq.Y$ U736|^[LjHز_er]6s*&%nyHdi%C[+|cfTi!THHpH'J4$Q^I]@P8jjPGy79wq>ϭ'pald#(;h6ҽ{@}K;m3F"N]}Y%V͉06gKvMp0Ny̆=DW0,T5 ITDz*h֌JU{lZꟗ.^Db>R4Y=$xU=GU2lT4!aY/NRn|1jUJf.{Ｌɲ:]U@t!ipEFW_:yU5Z/˽K?s\}`+k W.gNܾ+ ȉt:=nD}u:f=$5m^K?F;47Ε}nm^t!Y/"Taҥޤypt]p+v/.wq_2l … ٸqߓ-Zt^""uvsXS暛ŒLqW 4[;ld@f8*KTTqU!hzM1_vW#eld҃"!uw~s'Gm{'9dE,7 ʪUc1 OI˒Lw;geeFE9Ŏh"X¹UUnw{/*~v@ ШSܱ)O N hT{NKy .FY\C\7ˑbMF:h|#w`L#{#}[&HI6Ux  ue2Р؀YU BbḓHK0B"n1;7ja pJ: b1nab8]JШoyߘ˼0/R՗Jv};ٜ1-ЕOPoHi@{l5X]h oNnpE.ې% j]PG="r'p+@L&H$ŖqM/&Ly4i7?!\t͕z*$[T8TR泗G󮋰LsE;OXJ6B)w"MrD8D$?G+vG'ߕ@beɒ%m_}!n]{}VgQQurՕVA/SɌ8 bj$'\\Y”g7KlϹ83at~Wѩx={C}Ӕ!C<܆;VI2 ]cG|n! ds!'0~4r so~F8(m ymmQr:yY%7R]TDJ列/:>_܈#Ex`8Nҧt>ۅ|: [lӭ4.$o}ğH9ࡘT_*aj cP!zk׮e6OݥVnZ =Iob[Dj^}o;ZD("Juq")"mn$=@oU3;wԯWC`wb+s㯠m^r֩nvGm`M4t=ntuuXM"VU=}%9&?@y~-"v"*W#DiA-WīJ4iKd ݗ;\{f{mVi^'yĨ&u{ l~bUA}a˘j'C|}$v=L1PzU|[#A_4fAi-LS??1!h꿺 7Ps;đg*jFZ"Sdb7 7-m{K}5vXi'PGdq*HPGK)w O~K=]UdU=YD~," QDz<해ge lBKE;=fd9ZU.FQpB5g T5K4/ߨ(Ȅj "r|%je$&p-vx^OB1OJ.#,{ߣ^`.pzHrRAA)|Rp{exKD#tLKӓC);9ȭ71)DiIPw!& v 9#l oac]r{||&3'z8xg6X 4-KݥîSlR/ڙ,>8OK]rη%rN7;HO,)4'L{Ok;B;Uڥ^lnk?TկJ6n54y8D)!y>,5ɋROXz&5މH/e*Qi,g/_6&C$=tF2:5dҊ2-$t]k p#u}@Vhh^S١QC$ );|!O ɓ7߮!:v?˲Ib^H!TU}-:3 F1l0YY[4H{"+n ݌Y>DoX(c% 89`y'w%}mUOH]lG/e;϶YZ ,*8>TmؿR hI&GC 8ҥʩɹV$O[K؄<_]CW"/$߮5ńR'Œ |YUI*G!,E$*6,!\w-_,_Fj|B~^D^I+G)qwrq2L84R7e nP'KsbFË̑~Ĺ8Xkr%hFq8o+E\!* Fx+Q7E]$)I7֜9sh"̛7/ޤG&0yz;?Y}m,}bdɈHʅ$_fђϙ9-$qo‘oٺ':Mzgx}kp&]{H%yc^<9|pz("2Jjưd .GmxN$H2OPcYzܗ6#ӛg{e"SȎ;M>ʷ@_֦oݴ.|8y|o9b+5"rR#HE[ `{34p$8p][|^Xe~2-s+[_YVf19!"p?ɑ,@ե5.qxW3'Gg+ՠEJ mű<>DP94K !F2r1c85qBBmϕZw::@f(.$ :EqYOP'6:,ra0ue锌|J7GQt~V@M)( &^n)/͗YҫZ)5/k(i4/V79lgp]r=N3MًfҝJAS騛[W"ڷjƟ8$Q"2f{n9d3 0S5Y؋QrCQ*c8݌ǚ3N'"Kˬ}謗}h&6ieגB5w8===Xhϟrz8&ݶqEpC3^u͔L⊸euȊ:Y)ܖ{ԍ3\""s( (v41#׺7W>"h_vu.geWbtE'"oMP 74ٵ^thr9.91ͨh` j4}2ޡ) $,М'`K[?o9#"pY3`}˚ =:mw14k-+rFYiJMn4Q g9SbW}.ͧ8&1rglěT̽"Y&ee k 6%I|Jz}r>>}\Ok+HBɜ(-` )ͧmo?oBGsʘ4O Dӧoܒ8-^d̞=jT$@yxJ{pfA0ttҫȫDdqP5)a_T,&+=3>_D^Q.t9"kw:Bx5{CӤ]o7;K5J\khJ+D/CF?KQ>,n'D}D#s]@ ήj!cz3iŊ'9v,K禖?aO~o$yaĥtuS6ɥkxjВ*$!*@LM˜ R/*2Х#}c'hy:o6=1SC yr Yk+7on<_|l'Fk'QBL&=и[DYߓeS׮];_DޘֳNQGJ]g\hY3-4&pO|6\\pʜ {W/o `$\'f)S$a5TK `o\t@70:tw?T96"}|%"1ݛ?|,^===VDv3 Vߏ9f*I>ס7I^I&g 3ϼQ:;\NUR)52&xS}eup9"YoqphaVDBRZD\4\8@$cuBgSJe[:d8 Gh#yET !T*'@3g8kH|:е]㙕эׁe.$$J 3D3KdZ$@jS\Ӆ, `ZtgE2&B:uN|;lquڱt8j[/gdR,ݖɲ|%O{9 ͬ%Șt=!UGN}cS`oȼN} @ID#q_ tuY3J7|,ӇJ$!ֵX=Dt=1y@D>cq:4S끙ח{7_Wj_gzNAHX#`,v1@n"F'<?椟vݛ۲{çTMS`tr>G S3#(oEi$kfƮA<3snݺ\KrS?Cגf-I::i8 $WJEI\mEhu)kB,9YODh81+*] (*pFəz5>*+?dTzm(D5: /FR:.ٷ!}΋ $Epx FW"+I9nKdd"2<u(7PӥYw㯧҆@ۼB0LSjG" }pY٪DJ%2QU*Eї(:͇h]c2SFf("W~ /~+Wlk/Z2OI;shq!I3?zJi%RJ]\󩿨* Z`fsH|YD9a眱DIYT_C,DhtS z =O6zrO)s'{`'͔;FҥKߟ|o&BT=ʉ͐xt&=Ňq)J 3-uiYNBӬ1Ogݏ~-(n@Ƥ6ЮȊ.ٲL،$'0ٌ8rewx:pr&! Tkcoη͈\dƶ 5%)cEٳ裏^HU8% 9O3WH$N׳k:[msKׇz`¦\Ҽw ]9(.*J=ʘJ~$\_֔_/fj>֩~]M \M,4 'xb$RJ@תu2Vqp!(`iE[*~/y΋. @orO3LO5䠡 yT^usATj/(>H9IphV_yc3ӑ .X--*(hp99$jKtF4bAA',d u.[`A ;743|Q0N,:!M2XC\`/T$ u 0`&8[oöywqdPo.W1tiʺ8^JR$ejxLj2גg'iM<!#\/" (<4!CU9`h&^] ɪr9^˰C7_ 2s gy3l'֝oyA,.]%8%C/bxlI|4jULp$ueNe^ɟnܸ"&ӾN7XOO,Y tDxG!3(@Az$R/}ě..%S5I]|Qgd뇆~ -jRJ\` wȺ ,CzRp8YkI` ف2`V}E#:IfQ7Tmڣii +RQ /DQ7nxDn2, v>ոNA vNe$ct)9&hKk~q<y!yh7B> ǥ}:ܧW5׶V='@F[E^vmoֹ 3i]w*$mg`1ҁsl~]pm"=&%EfnlHPheAZ[NDޤ!éMٹjժ+W+i2:UMfgop֜'"Mz'gQ:i}z3"@4˒R*)A8Q@G) l=|9ۿ'Q@H]smܸ7^II`;] EfϞ>tcn"kf-]: bp֭['\p8W8]#/+0Lh~j $Nf$ד9bxd7Y6:44*ա' #q8_g\(gBuu9^"" )ٹͧ#B#5FlLIBٮmXM/Xk}a4ZoACZhhId6$K1ər+>"U[@y;A\nkCR{f qd)鴉ƩFL]tvwl:Ղ=\=$*cͩimF2,T IDAT](#>`֭$~mH";A(9f&V[OD.%z}~V@fK붙/sfٲe$_*"+"gihAH1m^8av>u8.xEF1cIw)9,1PBHrf[#\4 QF}C}>&jW:DoEȢ21 ieO}Kzl _;IgXSFe˖1?L)A|''ƙR:t| _xn xٲeQE/N/HJ3zզ;u?N =ƭQN^0%2] l<ĹJr{pN!2R66Gʼnb`s1EQ2P3ФoT߸qƍ?AM$F=)}w֬YXx1ΝD; eFBex QϜ̚5k$.4[ҌY,'"IEd|AD6$?&""Ұ0;X4V\yGTӊf]m6j}-=fF }=v0DCrߴ|7]R qEs7-do e&sw|::qjN]\"^P+H\)4+ʗ"s͟?3Ow{5.."d.WȺi.+Luv* ijY-#cՙ).WƔ ZF1ןEoZ@=ytl(##>q,[%džfT:vJ Z \_zþA2=\͛HCiٝYߒْLO:4,}W+D(JD$_g, ͑g陛~!h4e#h52U:o8'*H!>,i#S[j$#'P:29s3 *L l䬾NڦM_~W;\CK̝;gy&*JL #?B}z4ӄΌ3Ӽl֮]O7H5':ܬO_O'4(>&8| qz;Ӊ忈|\.qH[WW[Jmn`Flc3}!ƣ͘=b%}ЌH9[l}۔v%!?"9 UQ` dz<6МM&-/"B[Xdt-N^ S#$%EȟfĀfgro +62PYvN@@#6KO&Ull̲8| KNsHVCQp8ExIdee^r1@ߵ`_ԡ5e˖]tglٖy}M.pmh I GR2].[ {Ŋ+"jo9-9@y񕯛(m)J^;!"?j,e_92 T3Rp~P e(#tH$*n`|t8*3Y մq`w27?JnGH8JReWT`#"YP"D!1F 0Zc+v*lӇ^<;}CZ(o8h#y<8ZD r3ڤ5%9Mhr,ZF3x#1 L@(h!Ϊ=YN0_1oڭ0gkA(#` tZF9h~ף(z%ia}PiӠDkf2>Ri{u9F"+V`Ϟ+V-VZ_Oox)<;5i?zPՀ:ɑDWlҗe*I"J@^=&`GY3e41$b0crt3,Ixvn2@MreeΩ@>@m٬f$7om9:".^ (x== | ME'&CFM|yH1uGQ4b-+Ep_W7ʊ&O,"8)WU*2#Z[JoJ(z m&!cRvD;zUnr&VD.^| SSaN,;ҍ"r/2:+W`؜_߼fjQtL|\.JZqV0+4.@WF@\EVֽ+sKFQd=J$E썢vxڵkW!+xs+DJ9$Z)(dE{TJ!"d67~h>,Ǽ`—f|&A鶌0]?]g|g]>d+\fB,?$KGOFze(ڵkcعsʕ+o[)uc4]@CTJ%NG)~(j$=JEh%ni.0& DDky_KKSDX @e!@3R\ Pu@wa)J3ʠ՛čN:>M1RܟڴiS /}FE}hܹE/0}WޅePJ `W2fP$e;"#! y %U*RJ] r|]J]%F_YJr3F2ڎOWjewĠC$&X{Sx)4KXH"z/'u (eeȚq^/"$/FjGӉpE:K)uiCmʀRj"E< 5I%c rd]:$ RK%;2%Cni/{"IUD !4˒b_|7{(TFlۋS֋D&/٪@_, ٶs(KFǖF:ddk I;uZrvtl{ǵRd\D_Å1ghV(vuMv=ѰΛ1UNŽҫ-xR J2lR` NJ}c]}1[վҁ -[LR&Y(@i$UP !؃!ꂎH:.CGPƬ QrG\D۽6nX oxû(9gH[ǞFēY1U_W#<}kxʕ=$ojq r}mm1wz@mلlhusYiI7xOOϽz(]m5`8־aPhDHe?٢icˀ~_"z4KZF,!k4Ef4 ? @mŊfyRfb:I⚿n4~t\#<1D"r2㐌PG3J"J ~cXٳY>."pFR*#7(}qFDƌΝ;hf ^S$ț iV f)>xR S;2\Jz}1)gI Ɂ\hwp)_SJ}}}j^Mr1VfdRAg z6V."$yg^Q"ӿo۶mKWV>Xz8 Uv'@P9 ăDdGxFa7IO-g D)@T%:Yn\DNbb$#gd\΃^D'H‰p'h$H/YDe:8b3hc"'%#qcO1.~K]u2-*@F7C$?#"ES]Oh#ҙT)i , 9AɞHo__{{{G8e޶⮵j] WJ]/_9f˗/pqƇ gڡg5."4qf 0F\k#i)~]{C瘁3|=ry(@u=? ^~رc ~5^7Y<D˥,:ڒݤ OKC}utGDK6>\@DȾ?q!2\?x俋ȗ`ۚm2sdiE/kRo2&/*ޖmjey8&A_1i(u ~ @OTlGࣘ Aw*I a8~&@|8[v:yT9; >r*t4Ǻ `gGbZjjF h}AeDtrM$@7KAܓ:84da]r0Ӄ *.Q5HcHGF7]R9N'qdY5H(# Y/fi⹗oY 9_e͠AM&7#PF Ky$owKZRjB>)~53'4 _Vן do>c#2}݇)ɘA3c GT@ȖN߾Aё!PןlCFLft'0C0x'͘)N.,튎L16rձ4S3xd"$yL(9z '#O"1:j=5cKD q_繘plAp&Z$ #mKN_1t:%HbFJ:4CF&Ptjcˈ#g0۾EnWF7\Q1)PgA bNd& )IT;(btv9]GCƸM䕑y/ E=JfkuCgFo:2)c>ɥFI$U  =AT5PSM>>Cˀt@OOOO%TFvu4*Ndtɕvj}q!$^(L2e{tuǎ3$a#u0mgef+>4gR}$"&4ufhVV'$NoɨKpTւNܶdYpue$R j 8ʐS|1(kNM$ y0uّE_{MbJцOiBziHrB9=HR kRku=TLc9u9zڲX:C$AZN q}㑼okR4Xs7—(,mەZ " }Οm}d$ϸG`ɿVc!>>cyfLZ've8U; 1a:4C6Y%C9H9oP*"5TF\qRƣ\9Ё6\Eڡu׮]"򐈼Elk^*$S94)% Ʌ":7hݬ`RhvÞK|Z_9eLn(_J`2Ż΂ނ;2)cL{LUQa|t Z~M20F@Ɣ^v[UDn#m*\#:go!Ph 0J T2W^&"Xผk_JiZ;$"dL(#ԙ{"@$|RW|/-xC#^k_T_w2:?#Y890$z٦\Dy1+>'4֢("I*4BA.g2-R&RI>-kF8sϋeJ R0i2-2Wx1qgd`f;2s\rhl| r@N5&۱̙t2K:hf)su3א~ltm貫3%Wisb{9ҧs+ېQhΝ;+}$?flΉ2R= Gv|Nz_)L)u=58vto]qE"r'|#kvkgf)S+ً!y'~!R#PF&vQ16:F ]-CZ[#cJ 6< "[ eHȑ#8z(j1%Hܢg1?xNzWIZۧM~F0FQu,|4Ddf,X6̮2I{.-aΫ\9%랲B\i>ǯ]䨤d/=/I M2g.\iǮq%"FA/=2:p5$W P`/?hf`[jĶfl%}>k%l2lQАȿlSF`6!ƻϵ?=pdst `^>OȨO|`!@)5?TOֆZh6 d2RJ:KzNAT'ז-[bԿ 巓ȋf\ * U'jKHO-e>78EMNG'\MخnN`FbT GJ;NyΓ@.d iB( EZj -`'U9dL@Ӎzĉ0yF-۫!gx:\x.pji˨I~$eTzIӝ/N9F{`Kz\,"7vd=cnRpv"!Glqq!-qWetlqE@$>h֞ \ru0ZL{|]m,Ȱ)"WTy]ݴlE, ]#Pay.yʔ:)X A s \GkG#9d8ARJx YgSY"ߎ 0+װEq2p{HR/=`ɵ5("Gs(n]ωH~MRl/ЗF-(zkkwɿPJ2T֒B`0s,uE|>W0ǩxeI9f ^Efh'fw'cO1ǯq3͢§%DZCн]Qm6CaÆf뤓 M7(ߏ1#ME)ps1+zu]flp·tp (冈 (Jѱ6d@ɟI~^N" T8ӭ===KېkvCt mhWF3+ьŌ sBkp@D+hud}֗P@32fhNy1t/x^2&UJ] eOyډīsr8ffq#K? V%$ZmE/=j9F©-:\:I~^jdne ,Fm|,@$iVzcoMƴySѤ;шY5$n( K1dZk 1]G~ hyr:Rp?=N!ߺ5vBJs"rR?CFv+@I^Ҏ8)@s1+ 19O& WzȄzf eC;$ukͽ^>m0p$R2:Cەbsu&{^s4"z5j#GUYIA.+ ?~%S~6l8Vytcu9rG PILъLS[b "s4pBFնcȦWJCo|"imsYƸ1Z$;f9Y* zX&"Ls.?VC=&9tȒ3yQ9Ȓ^\j||#'>BkJ5&2XnH8fȰ'ϸZgr4Z#62lǤt "^T׆ lVW8%<^}/R^l U # nUVuhff~6ԮNKqݻVTi?f]m\3΂ŹdYtܻ K҃z][T*a׮]]#cY;f*Ğ0O&XOu9vg~|i[V !ATR=LJj`Ӈ^<Á0<<<)޵bE(_&]3^⯳:-؀I`CY=!5(a}o-o,{S˜<-|y\V*3dx\{u^<{8w2 `m-f 9V<ёݎ[7r9s(O7iyc|ioV$52݈rCdID^,">xe@8V;E9,6hn߄l[F ̜u_]\T*d4ކK=&Oۖu|'ZyK{D'N32}gkw_Ow[mI3y2oE?d| l v頁ODQF1QT׳"&DԿLAJӅJ#k׮H ୉;aH!]0MwMVUDvJYuJ%Ҋg(:aݼ,#heL#?z~gpmrr[;{1$YgGҩBi%7 U>@̢(r ]68] Djs|>lGJdյZ2ҏA$עI"L[o|lGl>jH^ @ ā'W@`-?3 0kCnq*`+E(+e/dI>3ئؓ˗/˗˲eˢ+VTVX<(e%cA'sȘ1ݳgO,".,æfHhkDH\ +}QfJ!k4'e8```P.fMނ|O6x`{)w.!țTǦi%? oKmQj+f6l[n2\'cccHց[T8+7:9 ĦxQl2p>~4od"!;ZR=G֧]nI6:"iJ2kDށZ6C36do-1$#Ml#c]( O.pceiD.k;i)^d|&R 5:Bd}5!PJU2źalFI ,YHUlhoDž"d,^Y1춌.eɔi^6>AJVǟ<LN#">4ZZTBuS3T\zT* guԯ8bHH{(ݬLŜOU߭` fu yq붂J BL`K-J;HF]יc.9rf3q y$Hdo9׎~1q` ه>{聁cVߑMkiv#ͽeʧ} ~4 > !}ost%0#,,*h"(*-&p$)C}]O+o p ߗft 8)Z{='M+ [> u/-]ɓ'F R"EgБi*WBHyhl<"[DM+`Cq`Q9_p !QV lgnqPYmrdsϦU%|4p+lO!u?cSY[.8nYMdUZvzXDZܙ%H)՗tbzto (lfW ]OI>Rׇ}e()W.&/`ݍ S dG;su&=d4u / "P^J ׳xқF1 @ywYD+Itn^>εC9t`HDNj>_Pӷus[l3tjBS t?f/b~o>nqm3q*K_@+K_ƏZ҄xWw (]Cx||‰':eAf-.c]L]ׯp%5T\7'9y?b6[׳"x\>։""ss4yyl"L K%kZwj2'qK{u:~ɿ 6BH۞qBzg0R"O|!#.,+\.D;"xGvl:M^NrnwR='_Di+ QyۀNu_2]2NVٮ ΢d?nuAG08tnGL3ϱyi9;?ӿe@ $md%=O4 ؽ{7w= "L͚}q= 9]<\NL|]>h479gWte:ZrFRh ΀S>w?t;'g^Bߛpƴis sQXXtҥgg@l赹n)ؤ}{SGĉ8x :nKQ|@JS1M|2W$iȤeLOh@ɔ^_=:"EөԀTxaTTtq5_{(w⹍NҪPM}\Z)+=S}t7(z^qXߣ(>Q["CDfG1ۜ})%jջ8H&YfS}b)EpfSWqUP=77ܯ<97}nſ =79#Omm|V)ѣr46u4묢- uɅ^f4X5k(oFU#X&ˋ2"C lUc^CCyZSƑ`>:.-f-C7m>1>>~g{Rrhr6ryåRi|˭[KHVS2NLy=zeek<.BEh@(oܖ}׷gP}}3"r/x13'/aP-E(~XV띬(N+fS;Ddj9,NV%,sC{78R@G˥6]iϵ1 FTo'o_ڇv"j4n >45޽{'$|lnEwdzG:?|pF_oH;$ѕFi;2ZFo-{&vawq?mSfC3.= -׵v\ČEPHh0q.+i-5mjniyXcg"9,{:X \D^Yt|Bb< 3𣤵xZ-zߝWCv`gckyN[ r Iˡx IDATU9Z0;甈Qd~Do0"v(1BF!r$" ym}p`y=?r$Hdh7+xۇ88MA1h]dHp lku5 [&9yS08<$xN T7sַ!#"|kg^r@2Yڲ4 b?(ylZJ~u[W6 '[/tr,Vgـq066mI6]`݁ofv'} 6adXr0q3B+X:QU﫾`t?;Uu9s]TKq̯`I7"&)z}5 rz)oGR>Z(q8|?R sYwKr7 M;ϒcv5m۶ə0QjuEIB_(~? [ 赍w"֭[1IeE*+Rh 0B<22=C߼5߼\^Q9kFD`T;aj8,V'f^BxBkJ'  ۯW\ nǙnft$bAk?~m"eqwD3˗/`%|B\WڌkŨy!j-Z+<sDts.Xl=K]V38a;uZ)BTLRA֑&?W=_.(RV&{來l*P& PeMe2 xa 0 >5%~x<.HWV[-96^o& }HCp3y暎k1Zr Z[Sljfe]yd3*ɡܷ6"'ۻ= @N_jGFmݺuy%O~`I7| ^Ȱ΋Ğ8LiD FzyAH@kq|>cI rЄ 's}`\%~3ݻWQ$}b ?PF.1 ( w|v)W,C\9K!Ch/n57hJNnAuNC"f0”k\.* I\)3L)#RO֥(.tJrI^%n]p2sn} nnݺpJzMϮQǶyr]"5ӈfh)Ez7&3`ˌ`&o{o^ '_`ӽ(aȱ7Ӽq0|Xa$LB%9D4>~/4f|Ċ~ؖ θ z0f{FkW:eW0Ba]e 3[t0uor"sRoUT+1x4"Tt֭cO0sDO!C>#e ԭn(iyu14qĸx1"Ok)ix%E2i^2<'k~a[}%ʑ@ _o?DFSп=%IY'T* S;"//Zpo޽AFb߸p$f^!6)xAB"CHu$!A0-*J7؈tFK Ӎ@dRZT˧=IOa`%:&8T*-Ydk?h5f\d2ȡd?7EQ&Ue\'Ѧڔ$hnAZ$j5 Ǿ߁$CT Y(:L(MD%~y3WksY4]2{|wWWW]'9rÇcǎQxs]| K`,;tcv<>O 1MoJꥮgG/N0h$ [)J m2(>j дĂwG&d?S_w0Z}Պ#M<EXx;67n1q(ZtLH^`)|i&(( 2Ө,TFBڪE&b(eٳ2Z|Hg`߭OpYpV*ڪwʅ@0F@w<3)6e_gt.nxSginZN!|>dhw7}{W$)Kh"zt2rOV[n":;֍e&aJi1z>LD<y:*{+ XN,Gi ]7_wD463s-ML:TQiXVpestۜT3:y`mt{4U604^.Dr>)KL &4OH!&LI&^cf mٲş7oz_$ ̼* ĺD`M'ݸK:/'GiV gAp6K r<3Q,(ªnW[[|+B+O|-X}gg,# `2 feO8MD8Ao-ӏ|6|g֣c,O> _~>[^EnŊ 0IBɍA3r`y1:CܤD"TuXR:Ʀ iH f>^[Tn&z)D\ [ "Vg~;\Z~1׹D֎ csR]ְQIBJ1z}ID-\7R ˖-3<3j͛y݁:K2^.)_WL:,ADFѸ]osKh4Rm#cW [Ks^Ec9cg.k DW$p 7/gs !UrMr` 1^CD7a>i;+9bV<0 ՖROs(fz\'J`&3WSGȹSVqҥ 9IcGDD6qEHKbZWc~:(;Y# U**J"C{/_+V&p(3^bi1N:ޚ= B[GW[d6ؾ}q`m%LȻFd#m2$akv5_{ GTvwpaT}~TxYiN^O?o,L'JT+e YU0Dg;ZM8X|91.01a, a(I dI633I,{tD6cDk+3 4;%ϴ$pRYSzf!C{1`{^¨Lti l* R3Eظ+T))h?6[-]_Vuvv5E3i`QN<`{T:a6"6 @r$gLB,F9]xP&LOra2F\5w\Z1sߋ6`T!ĶIo<´1)d8 0j:m4@ZGc$C7>\$J#duItNFw^r0 $tr94s,]JDGDg.U}L?w-X^(I؞tb}KԮt c~Xu|sTbH`YHdR'b,f$$}WM?Kv<>ՋS/wfK ;;e\Px>LM`Oos}spŧ>57zgNE`fJRTړca0DF=B4cd'2h6~!d: XKL7E F#XZ.K2u(5ۤ%:%ַ@ku8צ(%Wa}(A)W)Juv-!/֙azN1(' !GO@"W"4g"` –aRRmaynDϹ ` Hqq%KiMVј{q*휰=)* "ZJDcr3BB9 Kb4e森2\5IXUg-DwM9`ۏLu٪*nĻ5/3g:?xe\o/\w43۶m{D鑝5B96J&ƺG>ED_}oJ-[ކ7 T~@K/Ŷ$ܳ}8dTZ)$"4Ss&_" 01gqǞ-+8!XPSF`Z*"el!{G%Vw_גY*3h  p++CSp-Ʈ՘J*SOI9:%DFe00󅙛s8 yL]$0l4d<}z\uT5DDeQT VW&Yc#3ksh2$1 !qKuk3uvt}0^SFQiќh겭S^/G} D# kGl@(6bִ^9:\'.,S}&hugdYbD\#DtQR(C{6ZjԬ͛7%Q:`L4Q7)d( q`&R+DɆ/xcj&!qmK#Ưx2XR;GE2e<:]ϷJ4IZ𺦃Oezq.}S3}sH^بٌc;TmJ VydCT},.āqSJ|>J"Z:pX-ʂiT )NfJ5Pyck-+{@6[)ru>% IRJErR)deKٺAg;B{ *LZ%C5.s0Ӂy$)6ewV[7jOJ DtT!՘&CYtFm}!k5!UGkE-rHRU\Lx_f ov12(62<ܤxHt}aRvܥSф ƦaitL.5J<H,wB{W>DD?EA,y6lF =ibo "d@wwwh7ZKDqDZ}GAt`-bL6^䈟5_ ֽY`w]bV5`8GFTjq$Q9J̝8mUe(o3ϟЃg;#L{|ZNuHZR1gYq}a*B2UzK܁G olҭtcћ䳎,DɦuOMcDԗґ8 }2DT'ASPU[nSE˔a V_:Ow+\HBGWD.,7 C2m!^-[.V^n *=u-cq%tIARfk1F8*#y&AdU}cP]SMnll\RK@Sr OqO@^`b'mc\?YK/FɖL#Czox@_ I\U%pKơ)YI7U{ Qk{<\-2駟-~":&ujȚ`)3dd g┨c)+odto,+WnM@4 igD&_Gk*v[C3N$}Bj8N:&GdQQ19K.5,W" [iHU NLQ`f̝;803mD pwDx+ ޜC f!xٕT\ s(/#l $͊6o`nO_zsL_ f8$ )o@"" Lo` ƞl7yLCh IDATc#-ee7y]+pc/X ?RL?&*2:n_LVʛi4ZXAQ5:EWDfI4OD"C7Y q*%ɽmr۴i#DH9V#d$TDhQ-L݆hf?x2C)e .$غGYdD4!h$}71-(-󇈰pBFDgus'e%2UtE/G˸ȰF` E؀|4E!֟g`5oKV엜"S'Xy.IWM$'۸яMs_6&AF380P$^޿8%˜OҸ`b^XaۇpK|hjd| ¿5~7 0SBtNkmd _x ۄU *6,3:%[.|dD:̐d$i "CܹK)<)Q&O1IB@(.U5lK9M)SV*)$afid/)[x dŽ9f80iRJprTQ2I$uɐ<ԁmq7ٖ>Qu ~5V69 \w3}%X> CyL!Ne0bf8{owV;/|/?05X(-NkoJWiŊsGDsuJ"Vt[|XIܖl3m0*D7Uߙ-*Ʊ2R#SsbU6xh!3ϔ(l2]FHgLJ'Oy;Ђ.cك"glQ]=0= ~59:sRhy^EEaÆ #XhQ Lcd.,|9%fyߕ4T`IYtռL{Fi<AwaAUSqi(Ag&@GDՈd^kNgs8u=>WEs.2h Lz#ɲC<ӞidfhDU[F1~ #cG:j?ߗ *_;;uƴ-3 :8t&uw9GL6cENJ=B]!ow.7hphѝU"6ߡzR@'305 0] 1] cqP*jܤ;.G31Wǁi *+rHC 7SY vpfqT*Fx+LNkx-?]Rg!׸sJKnUm+@uc[|SfI ٪Ũ64SWIҸy Vΰ>Jd.4rad䟉٦ F3_]T{E=PO74f>DD"Yp p $tL&y,MUoSd_iS\?U#ӜP|_12Z@: t ΦW1ry'S$>گpV [̓uWz|mCO1z"z /JGlcB4s(r+K|_`'E<4o:g_Zo{1`I_He9*GSȰIqk'BDJaگ|̭++&V @T\)2*eT6ϤCuNNO#8034fߴ"xjX W1|WKvo+B`FB#)k.y :fO^%?2 1 @03sFP̤T y7qeDJ{a6AP.ݻkelf=3? C.6remt,1r(7~|7u73h(gԔ:bz2W 𰍙 a:"lTfJ:$L\$Q!Js@ȥr`5q/ k90e91":&8afGDAD[ EJjD?b]ʕPy)F0sL" LQK@S3uQfU`j KԜh!#s{0D^q`… x> ȟ[q""F!< 2a ve>?lc]޻q)m8v1t@ΐ0T<".FFdNyJ )":RhhlP.P762a*@F[651@sݏO:ۿ/_$e䵓p-3s%&jj]wf26mڴg+rņStm1Y7@/4ed{c\z#\O^+jjt:X]D4+Ș#@ZOD3Ey@?FOcϧNs"^:tJ"V66&L}3pAfԻF_QxԄw1) bJus9\h1w23iT&-w"oc|7@̥vQwL[S?N5"TDwo/sФ!U(0 F?bN9}Zg (uNT|1: <&w!yu_TrUZ0e`/8p6L:W76@mhn2h~lvs޿>3_CDKhِQ) W@%ZU"V5s]'iSt#f4m{YG >[TzӦM~)܌07Aջ8lrbM`p1S*p32@eqWUdҝ?.H=8FD¦sZdd\L e~`ѢE8'y*axYsWJk t Xq97\ x)a1 T0a0W2F! Ocb(^ |:_}Փ_11$8p8҆e:^jA_3$Ãde?鍓U[I>M5R,tķ'7|=­`1q$dr*cա;XmaD]&dJSJvi4os'gDg`+D ^/( ǘ72ɥʸs<pʶRiTcs;1Dcet}qs8p1L<\T T0&%#%!5QK=R79)ȑYrJR,Z9{Jr~UU,TGhW ylm`|Le6l v&t"+ms%c3JH*}մ$yefa'>w+ =L+8]Kx?0zOS4ўL#Tvf~xY^;rj dn 3_AD'JJ<"'g,9Ǥ2Uj^ȚQH‘cI+خ#+uef^! 凛S]We)3W`WCkG2H6L&6R4cEF\K 2xg7 F"r~5ײmHu@?aO5m&DWV\~Ȥ"RVϤIe*}0s?9UϠzgM bWmrT9=K$@Oh(K\:roWT$١3̼7XLp! 6M1BD_dbiZifyMG8PpǁOW y@e"0X݉[[Vr9oޤskPqDy د[TvȎ!f3&K!0#*EJN6bVME63V_Hsx ]`rJB7? 7)Rg@ELRT5E,hފ5_"=<2L|l*)3c{*`T&,B%8iӦ#Dt?3r@LL=4E-I!,G5 $}Ydh@WDnw]yQm@kl\KW6bV0XOs/=.a$GmyjT&@]bM#|QF.P.iq#c5f> (OiM<2]E8̴(* T2PϾwR+ ^Kpu hDLcZ~:qcdr[dqMٸq KU„?M4U?*K"*{ND[ǏQF5gǏwTƴK qKhKv+dp*T|]<T?R'=TfwL2Ψp4#oFC@42 `.{KZnV# AHЭ 9brEƈ4umr^e"/L c 4JÇ2% ¹9e+"訔1dF?ȫrҫѹ=\~-J~ 4Z@** J;t$ !|QWEؔ`C56cSN1Q)ڶT5:Eۤ8'&b0sDOVhh$"Bge5p(?G266 U)eĔǟ|w0ZD2?<ϩU0}H^lDH4JdD]*mnZֈ\ 1Eʆe ٰYeʩ*Qlϋ1_Q'"ߖzjН2cǎ"cT2)*\ݼA*؆I(St^l%{'aʷ*]S  ~DTNz-IP$ȶ~ =/'i8mPXKyjb&9o,PtD}烨o\? v>ơ(O^7zCt]_s8?fg,YAZPYҦxHe3ok2gNVJt6&cnr[ިZf`uJ5y*t<3*wk>BERZB2 F1n*]3P~&j[nGcA>v<2^*wId:L>!o(3-JD(Sj%S^O0"U.Rհ c1 `OMyXYe_Mcz"dm8_Dt3 " ,@0N<+%J: ` Ppe"ɠLnp 3STG<\nh[MsM^l.K@= sU~Fk(#ٹi\luEH?\8\ `;v&N[hhIS-*b2ڐӲ0x ! R/AXH2a1,#q0 ɄW7LwSYRf IV:D bI%ĸ9!xm G{Զ~;GalzjV8!L|T¥\j _Ql/ 2GK^* Wrߓ%uUtF(Jĥ2f"C7i]e \Hr UΈ< LOL- $ ~)3?_R#4D]~fe/:б+ IDAT2gHɥuH_kRg滙y ZYL\]]\S)vݽtWTQ..kTk}y7)1fugp)KWJIo^^#s#;1 mdvǁN<03|0-uAt}͚ **_3 ~J!LhF57y:8*˯dž>gz&=Q4=-}ms79e[ј5Dta);2oMUI˖JX1my0{#`l%:Ua߁pU\Iya{w9ov8\. d`*s#k 8p -HQ^x%*g 4,W;CzmDr{$p'(cH+W@DgѼʎUQxde6ED Bq)4B={ۨڈ{¦Bѯp;+aAh}GCW@eWSd1)ӳ&H+H%J5TvpigவDi.Pȓʔ'HwX_.V\.g^Ӷy:Rی˾+?C>\w۳䙼uzn ZZe.눒MR]Eƈ3>S.1I*c3=ښ"\Βd1fnqT"L2:65*۲q A[ʟOq>^`ƤoF7b,YM/s<ѿ9{vc̜ jJᩣAs*+:nj~ ;T^ 1) 0v{R6dϜ۰g?'ID1* H x38wQƠg2(a"z1Q_ +(K ϑz":cH \kV#JWKr,u%5hhl83/bɚy.p:Sn' j5WaÆ̠`r$Apb63JOgZ6ɴKQJL@ڪk^$HfMtUmP_(IN!̼t6+$u9u}WH L3-̘8qbKU2FCKlj$g#80>us@ 8 L&T%  4*.#@T;ǓYau7`,pJ4 ~;Q;};D k8 Bϖb좋P~ Jf1֙}0SV&,DGpܻ 1yJs^1q 1 |+VL'i@$`5d\O!CIwmUӽ np2UlP AƣYn5Cu\y}/Ŧ*UF{T":E*1s/}QGFaS hk'/ߍtw8 !_@P\]Cr_ҁ.ħW=Atmmϣ3JKs002"hӼ C3.ӌRߣymg[23Sfb igƮTaLʔBpRf‡&K9ש;p,P(M@Eg"&$}G6w:yA$ʠRG':TO8Y@PFDkaٯM^u?=o*CQ;޴3;eDFu^zNxhb:YTB3 '_G؛ج$<3AW6 ~fi.=II[U %r VXyӪɞkt<C)l&P&XRv]Y ];_D4.v"QN O` y9kGC~wr7^f^~ذw)_r̟FKIk]i/qYkJ9J,*RЌ$hM>CD0sͥ"S]Ғ\e3LD8pƍh&')mwM`L23k'`(SԳ~b/pL0&U e \lX@`-~uq227YĀW[ A(6 (B zw?ϡosh(AxCF@q6Tv 1bzcgÈd@~NY `9d<ʟFQ)BŻݥRDBFF\^ko_$_BQoSjysSj]xUO3f|ra=Trn3?!Enx2 {QoA]˗_UbsdetiEϤexZJ6;mh-'3s !2C0(Rqyr9 >/}ؔ5&E#1CE E)E_i8)å~#_~3ViU2)gDtVW!-chxpfۮ[ Dbf>R nm8R=ζ$#rIhcQ;$gXT% DK`+>BO2]"zuemuٯb~?SM9 |9ȳ{u}gH+_B f^^'/| 6w"Z)S)ƱI( l"z3LXޔ%my,2Fi!GҳҁA8+p&1J2[ q4vh4B)d 23|!>~ۮ7eax/R<I^a^\JN<(ĖR+NODȒ+JɇgcĎf`OT T ʸFu=GKwgR[}hvӝ'ou?!f<Hd$Mh=  L  5-Z \O_@n[u>3 ^xaW=7;M dr#,%ԎF4[Q+Yf7z4 x`qΣoqO_c]e>-\r!L6M*bE8HDXCD}:bDx>u݄+)_#\fX 2Q$y>O&W37{:Wa&sU1j"ASZzr%^<>m=(lNq/k}'/ >B" ,oqa ;+(#m8tr41TzK]\bK8!ID4hRE(#Cd! a\;y_yt zRE{v[ymAɴ=kךD0sIFЙtmUHDts(E/+˜FjP4J@H39Z%tD qh SG@4aGƃqUIc c1+ɰ׎p?$0 %~'>uۀ#RH~d'<}+xSH@QšQ'mcf@3GY4=?tTI!c\(t#_8]UD4Ȉ6CUFyfV$GMeOuCR4ͬ_cyg(260q8{4n~ZUiNT{.2b${`2~-b#`#Q#o EG;}D4?~δʨd} YkRtJFaZϸ쇇w޶2̳,0KPE dS"{^mjeJՐLF}9~ŃO JR&h^^fy~nJDD2)OS|S=+6ey Z-טuuuSMrjc:F[ǁb4<` #gLbG(Bna ϔU äoGoh`\s3E=/sX*T& EaC:N~5:_*C0՛丝קӳ.fvH5"!Jj{"z8AFu2FscU~!17~"8Nj,EC$d0") aN^pw.jj8YdhD6 xa_h"/sYBe8hڵ2":JD[||/5b7/*YSyU,u3g}6 d%"jц<)hY x<۾_\s:82s!^P"ͅo%fD )"vG}IGko:T%z$?3s/3DG\/ D4#5hQ?EH>[WEI={N_$G"`y*3oR#Ȱ|s;cYJQ =p ]/Gyj TK"F?AА*GߦtiK2P*RhwFЫv,GfSTJgQR#6ym`1k0ej+p "Dky Y 24&|O"o"Cow}Y8[΁=}~~ardl4_U#3igGESJAF)\̼v876=!{D4y̋y M%$2ID4O/ySAdqŭDEcDt 2Ѷ0?H>2s`7߮[q]vm}ժUwx*8Rp!c$uߍ~XCz={QO!z /ke&Y A"j!BޙQ]{Z06[`B &!$LM6fI^2@L&뼙LLe$}A!I7Ylll˫Ȓ-ZVK[RKGӷUu=GG`uM*af̖{E?zTWU=l>$WFP&'u3QўJ|,5crTaF%NF$/Hp΃K;'sZNk;5Å#S͜L'P7YvqQ ~D' =e=Tlfz\Ty^wU NFl$MJseq";v=-DqUIU}tM_@kG8r 6r5T'&WIc/;^vB}),(bޣ#($qބ{ |}+31_{Ƒ^ٞP>o<_?J99g>c 3Aqzb~LAG) ¢S%uxiEw=RpЂ+po҂BG0b?p\@Æ[s"5Ko?(j< _G G:ԛh6Iwqw]q ݺ5JejƤ[AJ3egqȰ\Q"WTـAlV¤ʼnxfn%q:ww$ #xD-MÒ mݣ:p,Һٛ\f 02lfRE&…2y+ 491lWv"ND6yn#;ctgi\G+@\\=5~t{sBMq\4Ӆh; EgI7=xoԐ{08BF0c,YrݗB]hIUYDEA2abϐݚ$7ݿRmJ"Nt0mNneNd{̴F+cf,)x5sC9'4 0&>. dgrYu]j@xEO''̔j-]> (DއޯڙhC4@7Y50mjne15D\kq $ЈN5 0ʖ uKo+z"Bu 2Gc@ڇ]aX^5(3d:["L#?5@nב 3oD綵q''tܘixac?d[7y͌&DMWzZǾ*Nkia-nV_~ 2U;_z/49Ġyv;vBnZJF5zdFSp=/)Q+*/"Ŕ>=<\UoI X/jowTFA".6̣[c{1q8ivǩyBf\z/^:{3YalL'{iz;g_ [:ahi?MRf!FKB6BL&_N$o7k ~u6ED{EaJ24A&7]D;gV{@6[Dix(=yʄ2b^3F>)TiKXvTنazPV|HHĞB*1h`GP{и2rn%LI$ޯ?7hxF/|}FMep/Ԣ1cEcËD*:.ȱ1 0AOoZ޼>/ l곈א{a>Hxz#B4볥@X"7T~4 v!K=aGǼf5BqԜj.b 0rfG-.\|8"HH6ᕽ : )KA2BC~G20 0Gf*.u?>w LhW5H} ZZ>֊*T(xH Seaǚx׃@L4b&{*O㧳n!."1 3R/RD:LnnW"o{.ہww&}лi8(36!c22M|$RIr=D=w>50 ̱/pȕ@cρ[E Ѽ|ٯ$r 5KX=j#ɤ8bQRLLJmr}|~$Hdu/UZU%OhFŋ/\&L,aO4Z#Lx-~ttn|%/yXl0I,&>Wz<QRT2CX5J~[{n5'F/4I6FD"D2<EDv鞏i#"2\ =hr2C cfX$&ތET_ig݌T&@[c2aFcL X^;Wҕ"GE+mNmx3͌Y=lE\8]927ήCg6aX".PU [DHY%cA~'٢Ú0ƶ2M^/!vr#Fo 0&&̔~*#GW!uaGlڪĴo<rl38D"sz}lo\K{!T=6ƘH$ڒoJ$> }4{y2~3$>eLJJ:VҎ'?::/l{6yG\D0`ۘJ3drk} w¢ߗ9?O%ӱ0 ðdt=_OS8>/%%uShğ/ak|.!%vdv:IIK$G0 ښ9̴)3cfLC<6,ujq2tę߷{@OP<2&3XDq]E;z_դ-/\?ߗZ&-(td{uӣأ*.zu^_>v˫I1tozmtG_/Nξߘ(s诣F^m 0&+MizUuN6IFcSe{-ﳶ2c(˩Zz7P8'HlhaZsY_S WwBhrSW})b%vH=[De5ȉ9Lփ{hkka_fSO_K`0BoM0 MO!A"Dě{9$lqf';}!E7N90 cffT8O6N-=9wXh)W%z2>N/\nc>i7eD%;/Ezmҙ商l}ds l2Bi3t IχѨ 30&Z*^a*$δ!޿O}÷ax<ì ƗkW_|E$.(Ë/šX8NuI-yd2iKOi*0dmFv>{3>)hFg=>ET)ߌT,}~APT5a1fWReµQ`/-%p }c{- iqҫt|P8B[e$?(]/Cy!w\n=Tٚi(4jhۛDuU5QR"ݸsLr>cha*&̔1׮UC H$M{SohSo2C[ex `LE d܇5q!͑o c[ٟ6qf4iIhrǼeQ$`%%_Ʃ->v6ӹ['2&Vc 0)s[M׵¥"[ <}\ri h! 鏡(]Y8+a_k$eײo2ʦ.֌ 43M"f`7^KU&zw<}7/Z`0 Xhp*yh)?UU<-ӄllץ*T[`,Ed?Q c'S* cRv|Z3P9T&"9qf& N$]Ioy ,Ρ7k5]λȉC0 16 ׭D4X)#cu)W{Gjt&vu8.P@337q%ׄ{g4bScpg-ŝTcdv ~Ctr"s-a12lrqDEOZ}7"A1e ߧ7Dx~D%à݇N)pLTQfPL-U1S2[#Ž)AIm kH0 cx!kpQ9]q]14Q_gztQUD}~Z'"FI֙a5v(3<b4&hu-G1.Hos@zK"t=mi ̻ w"kL0 cHw!ݭU3AE꓈= 쫊VE.ʠZ'cGRʆ.%|6YzDpqaGW:Z? dHE-Y;ȴE?gkͷ,@a1g5Z eVwuǦ§m10Es cF^#CR-xѣ/3P]8#KVFDؘ0=*;e;|zrry,]?EPr*$~EL9]Hʄa 3=τlzڶM=oHE 3a 3P9k9yc@ _g=YE1u0af,\ڊ Ŷ 3%fQ 0sΫO0w}ӴKRfURuwNʄa 392W[ =**M1 0aƘt͍wa E ۾w}FP~um0af\| aV%&̔XɕrfሂI 3x O;[97>?J14Sz03aFUt;wΡ"oaŒ1i {,P=~w{3aBE'b^2 3/80fV 3%fr@faLxa&ơ-un{cRp03LauC?H0 Äc3SUy}6'O{ DfF.^G8jSl0Saf<ř0 37㏛9akAfK}Yw#3Q`M0s/܇nx laaŒчoT`ʺn{v6Xm]2L)ga&:'TBMTL)03͒w|&[p 3O8cjM(a&Dێ$~Izi[9'03LaAd 0 f 0aƄ_όjbL h.?uUBiۑ'hts.j 1& S鹷y:I0 gM`aRu end38b#8p9FB]T[8y FUtXEՂO"Hm 9upoCQ_{5a0ca +JhJMh42SRr 5ѱw݄ о]A+pJ#dϘ8ca&adv)av_mL)nm# 兇-xv7= :g,r 6 0ae7IENDB`armory-0.92.3/img/keyhole_gray.png0000644000000000000000000000532112414772654015575 0ustar rootrootPNG  IHDRd[bKGD pHYs  tIME(' * ^IDATxM,W]S]]U3# ^BM\ BnTpPlܸt#.txB$ҍ!Ưnӧ]f|ԽTO]~=={5j-><|x 0z7G9w@c0_^Vfl_t ć ¿c=!`|uׁ 0n ½tk0~>VW`|fg'WAGY. F{B vi?8 w r|&+. FSl6}m- ܯUш sm)\ {,ެI@&ffa^gXTy24apppP0 ð~m"bZQUUZz -|4,DDQx<.`>d^/˲EQ?@d|!@GQd2!c8f<C>0eIyr(=ypC OC1LH8IdR3z,$IrdXX,jpMk_4Y/t9$IHӔ4MwXaFL3"lɲ,X,eYm#90>Vii2Lv"lm0,󜪪\' Š(v|78OySkI]EIp||IԾU"gccȢ(\0 9Y}+3%8>>-u(B[)Lq - 5amg7It'\v ؅N&gдN&4`9{C}./"kfDQ6Noc=D ͫ&S$gYV.!.*MS$)`fB8Ð8ehۥ2qL~#dd}PHmOGu@"+϶ L&H_0]VmHlMB5|f]'vs #@lO/is%}eGK(1'+'wv4Yon!=}<c-M'0@1q+@zyͱ&^0d_h X<}l604] f6^`~z@3 桇 Cl73&Yo>I(Il6Mz/0 PewDLTCRl2m;74_& eY5ʺBZ%s Ms!*(".K{yX,j Ls% ƚZ+JӔÚ1]RUY0pҰ+kZW9NCrtZ R=4a[=uID@+6l5 ]N5 ͫĻYX2r u}V ԃwm6Pm`ȍ 6ּAd\nܵYi!-Jt% `еҞ h^]G!65K{\]&ˌi|;$mgNUM%6v]DsR"$39!].k^2]8ZK("rX= ǮiZX!35Wј:s֘c,oP%'A4Ralߧ~&KA\4G4@;|s`MW SBf}\{1dirV~BРmj&(3cװHV_x7Y춦s޾Yҷsoes - Z6gݞPe! &KnL´e\i&Nk>CLM`(8J6ZkIr33.Q}#w`mYT4?d/d>SU{s~*M¦NW757ye,|#lglͦ4_b}6aDJ_0AeѶeWqiqf= < o}]ܬ{!ﮯ=J~`5JT,io}Gu> <{?NN7ɮP}fS]SA7mٿon o!rc7\F prhna+oK~Ɏ|\᯶s~!UnA IENDB`armory-0.92.3/img/loadicon_2.png0000644000000000000000000000254012414772654015124 0ustar rootrootPNG  IHDRr ߔsBIT|d pHYsitEXtSoftwarewww.inkscape.org<IDATHmTesˬd+}rS1vꃐRHh BX "BaYEђeaV`.*T/bޙ{Ӈ2.09&"+7a IDډ0! @Y%j8#e `c@ll Oq9E!d ,Ngk@xexipF?&q\QR`,eyS3z|Ν+V :DQ9iZ0ko(gC̊ĭƗOCÚƖK]C.>3{VkI1If5=[7JNA1 Rv߱u55gρUul {`HUH&%N<eD&Xc0 lhhS&X1E 55(p-N˳D0 Kjy>85.F|D_M4QD@MkįGIENDB`armory-0.92.3/img/frag3f.png0000644000000000000000000003373612414772654014276 0ustar rootrootPNG  IHDR\rfbKGD pHYs  tIME0&b0 IDATx}gWY"V @ $hy{zfgz;{PGYTfUX+W!@HTfرÜX,¬A@лz0K>0` 5^c5?*p `:mxk6:p@@WW@h_= urn^}ʱCy~^} $ {tc:\g!`?:PW,' tt)ÊH>WqA^t+^sA B9酺tS/ p*@!=4[([y=>`86@N kWp8 (^y pR=:&SuL#N*  ZCE\0`*WVEŃ*;++ƀf  l 6C C0 0hvz/^I7xMJ#|NuA8y R V(=```,ѾKE!:|^./G+*=A9i5m:gK>uC/M/B^/yLE9ܤ3e.!%\x!:'d S@#&t21;,g.',k` +0%_0OǟU~@ͪKDDܣ&F6"_?k"T'?I6 ߚZ^T`{o r~ o#Jv]ut"Uv1/R]hfPP)>~ [#CO  FQpua~_Xcƛ<.vs~?cO~3 xK X7 0(0p88SEėҭG:AAw>76$ _=~_X,^t2äe/S$]e=ur 4׮v ōp)k8q/SAs?G"! Z8B/'䒦}0@WM'(4Cި\鯒GWtW|&@4Q)A+a:pBOxĽm8KyUDhl[m$–N t~Ǚ@Pcr" gs;ӚwbRL hg"l!ǏBm/t-;>%UJ0J"*Aa 9\W!6s?>7stبٗi =7VFD3vFx&ݗ 2&J z*|*:og&l!Z+Wi&\srT쪔:cz5-M a 88SAp|_)gFz2Gf`yYNԧ>A2Ϩ_t4Gp=J8:b=qfـ pvMty?2 hE}j@`iҁfa:i& ;'Dys| @@*U7   J;DHLtgd(ӢY uѾփ 8i&6?WH%\E}3.a]\ot lqo+p~k n-@-u0kJ)f&p~c?K W?`BY#@`R1S9 Vaȟ/k?}p}V3k ÝY`d5v#9Icp?VGpdoY31i8]KZl36GvH9f-7kB&' ~$<\z  ep?Df W?|߬/s! p})%+pFίY9N-7kbl-xL#O /bȏds|CR8!#^77kar}gRbppaB/gf-2@4 9nBaWe~;8s~Q ~)G0LLoz W"_?A#H@`שfO&cw0!P}p~0؄>L`|`IT "=  P]8 c,BD' WLt3eRI{ˁ^Q3 'i iy%`j}D|S=oofVge#T, g$ˠ47 W4of.yx;}f @ yM#lyɼR$;Hv_,|ф_m173K瘊S\TZ~%IW֌U H]H^MaV|^m, ո|ЕR ]ӏ DtreAtF H3H~Õ1XY*-$,,x>s} ޛpffـ,$D @%Ho_ Ze̲e#p9ʱ\/|"$vY-YӀ2,)zUkL23<-{"~oPD*\"\5d99$hΕA)13?530K-+^cxOj,՛"c%_VFTKc`̬>,@I& +R1A))+$i9Aff.FiWnΕOr$#pFkfV [nJvJ8op<ۢYӀM\'WAfSF)`=ff7Y6Ҁ ?0̬,N!' . }AH*/o?3L JaBg*p:gfh=q;&+pgpL33k$HO,Wۂr^©7i~w_-4ofP}1 |s1-3f^)\p%H6O,} ȹF̚' ! .i@Σ3ffML% u1:Rzb̬i,ҀI/:@L!i?>5 I_bc?dGB84oft&u 1EbvԗYk!p߸Nk?ffMH/  (Koױ3r#LP~-8̚[b :@W?*J&j̬y40O D#ffͮt3O?ɑ'p%؉?ff` 7O߆SOa~5{ 0 oD̬5Ҁ>~>p-73k4`@0?4p̬%@@t!}墿,%ZB0׮?@'?ffc20 ?r2 ZJR @3$)sSX̬ON%6kfz @`8)@*IZ `fr CrP9_T N4`fZ'rpk@YKcO`ff P.̬5MrpH^pjYK9A )&MN_03kmC! <3t@ [fVy/ a/ro=63p҇X p9@L@7QPZP4tQ_/)1>\nǿ<շꓛogjECXA{<#>(9R}'?Tv] 4] Z*}@:޷>خ41JWVLE-qT@A>p? 8#X#p|@4s @$͚센'H6ࣻ bwf5{y W[wV-Gz!*;9KJ-lF@>_9!ctu]DYwtg*Dr|[.  *]8*ށts}O0t݋^PzLWJjse"?gKt#JJ 3,ShR'"TAt`90}7nLwٌyW*O@ /d@G6/%?xCsM @>ďfY6P7ly翅+2BbMV) 8s"{;fdG!o@Dn .Yӝƙ,wE4|73u_\AʆY66eg{CC$;/`m.zyq:,[g DuwXm_% L{s78: 8D$va"z"jb9kS<&bxF!j}w3JXƎ\0GP/ǝsW}EcKY-.,ϯJ(}y" {*ItA =mS bLozLWw߫<Ybw2Da}`т^K J5?=Q@ra-);2Y1w/iY1mҰmC$Bb/48BU< c~Lw_JcVĴ 㖜Z[qmL6_#y%`>6c);wqyLemŢm6v\in4Cr!0Vp|?ϿڌJ/rݾ[l~+ʆƎuۼ.lw,}!);Y?|qqc}'*cʆܕ;geo#dg冂d4zl#Ta|A4ՖU}+H1@pi"qm6v 8WK|/eo8Y:zҹw1]ݾMCe-ٲ)}ڊ+ 'cm8932@vQ,S~qHqFC^jёS]xSC_~FtVc~, ckP%טH9[uni8egw_3Z}L @˼J)}N3*mRuP1B6m~HsNvX4 fLWwu(jSv:.ݾky~=DcǾ>`3U֔x-BqU}2( P]԰s.VNt}1f{^6f Wb:WXET/&ʊi:uӀ1]}ʎjtu tel+C@ )Tާ,l5m!5, Pt\YO1ݬw%,uNˌ鶹> z ?(&O3괱cgtQ0VIFHn1'b);R֓p1]9e_tтcmchiFtJLJ|/==_IDATa j&#z_HƃfO#ّcW}쳈-q);-=?v\4k茶barKgOP(Ӂ74iw8e'nL7Sv)t+>eǬ~@ǝv, iFgUiU_%}>K㸺+P \g*qD ,1w&IJeJo XӌqX>_u8He*p;A9J ,1+t>eGG4{ntmX|x>^*c޼ "6߬OM#HtokRX1Ę߾););:Ϸ^z庌/H+iosb;[ʡ%iXUbVJ03;1,O:XjLw[ǎ6Zl$D;,d+ &Ǚ|@:VI|ݾ[SvdLo]B4lsVFKr\esoskHp-Ӏw);jqʎ?+y>wqg@3rvpŲްL,H7Hzm 'K7w{n Sv߾+ZUIjcZP]J1p 1I&TԿڜ#); |3X}4رMYNtO4R\&g=R?eGl"*YoD(5vFU(%U{J2\o 7E DjL5t}׬}@OƝf,cǺTw ZroQQh{PN:e獢o:<߬ HxQ}*){vE$ @"!ƙp^$kB9}"t<_wmL,˴@ ӎK-gZ #$ S&8n$ Ȣlʘʎ11]ZۊDG}ǎEߤ,οROd!lc~9Y-">lceO(SK4 ?q'P)ŝt?t͚CBiYOg&_Ui`Ke }oqcK|}FN3Ij7Vb Bip9eigFo $Ot}׬}Iӎ>ͨ*'vO&!(t>sW7%ZjLN1kv 8E4Rd3v,$/3]N?Y \Wi@cҾkcfV,m~Ph}Bߑ6wdȟ3S +,Ӏ0e* H);SvG >Зd_G/2#Vr :.~");fc9lM@X:V򋩕a2j;`4./Dd[oF@W@pN҈v:p~ c~M|VT*@Ȯ_2r _i"Z7k;}v4i*\D+(9aO} WFjf֒='c"A$t;RH8,܌ H6r~YwN|`$({}/ x݁KO":*µC$B׿O63ku1ߤ@_ID;df )fRIפRHBpmCAh_Fᚁg}"A"O h_E$CU*hzgf-&I@m/G)xACeII ozYdwL `ɦhu3Uܶ~UDc#o=Z 7O 1$ۡ~'s5+ (~g3F6&5]z̟uh0Qff 2p ~p%_ ߿ ?Ms Dî Xar NۚBL?U5O؂S*qy x=@1#kA(h֤ίYC:H` }*~H35S(?Y@FfMrSB:OM8gRL| 92k|3x&mZyЬɜ_NžG '~Ġ2c|sF %I!\^e `ք7t>z"N֮Y<1JZߏxrJ.5.~i?)?1_Pt7{W\h8dt @t`A1:4?ZL#"=O1ߦU܇+ Eˉ]30kƵpLJ!t_ao@OЯ KfL0#;F3܌^-l1*_dR҃.^o XЬߏ])E7pu} ?D+$@}]YW9S80P9!` & [^ XǠYV/ը Iڟ7W7ѯ4\ L_ փ 8)`VlycDj?DT?aO31hs"!nD^08Qb ?dy#\}BR_G:/4 zw^!RS@?\_A_7EO,wÉsp߁k%7;ꀑ71L@:* 0şG`o"]+%p~Qe}t~Y)$]/p+k36&! j*B4īLcH[,bs|nLB&0ty<Fpo8(8ңUE@ i05\呥f1{p+"伋 ?>M eg:S[@sK27yY~-uU u7=x ={Dk.~?\}nO|Ts~_-h&nf|H#Q"* Ep~|u@4wy99 lٔ]L&1vZ@G} p뺾K0hF%HyfeéMM l)d0!B Tob0N <`e:Dۨ%g`Q?_܃n3fuR"&p7?}JNS T* EY޸[R6/{ Gt'וKO<53I l+8Ft`7w-iJЭ~ pVN$uљtpC<)MF!M&lچwRh9$HFľ$7QD1>$D S Z*oQ#GIHطF/9 o;P |8⍽r)A؀ ' o[-|S+WۿWڛT/Mm__ľd?-x`qJG*7;o@EN:SqHҔo|ml`p A8~N1q8:4\_38#ߙsqV|c _ 9"󈦵 ]\'}#p| o0ץQ_m嶲W;hr-@ R֙B/ HHQl5Wg ,\ӗcAZ#0'ynI׫XY5Or= }2rZ4hg#zkN!~B6lH匨AҬ a{2v^R3y$.W!_z_DAcC|OR)6-.]8btb:ktSt]D3_V/kj/b@u?9}Xet_F[7tg1QuX "{ W.\@0җhS}:|;Щ^rFQz(֍N?{Q,_*E;dboI_ ꈽAP**9RJm>bRP`@R#2s20W[VZ{c#Z2h3ӈr}^K6ߎ t-x_)>YsF{t|I U}D bBbSs:T)L}C*u 0h;. >Ard>=7O 4AF @pތ N@+@8%] :]8IŽ%w=K^Q>̯w{%:s~Ԓlɥh\3Lt9[AoF֩1.C+pWܹqnVN?WE>=}ٻ=gG 7] 2 E2}Ř:#^X V@pW19Po"X.I7hFVh/N :lJ8AץVBUUN s-DR{ Na&kHAX!4Z]w7w(Q7)07hU0Rg&rϼt)@7URb.NY J']f[xG];rY@pKFF 3! jtw]ԥy$w(ZǞTT0 sD71#AeHeam 0ȰԗGeC,G=T(o`7rP 5y^l#5 8Q{^Gwsz|<IENDB`armory-0.92.3/img/asterisk_orange.png0000644000000000000000000000153712414772654016300 0ustar rootrootPNG  IHDRasRGBbKGD pHYs  tIME7,7IDAT8ˍkHo9眗iR+kv?QF] GdaIH hTHMQHJ(1 PԬլ 5ڲms͹}N?X_=OX IIvӊDU_4HyB\•#dkIZay~>z˶k٢4fw`5`8ĔjQ+ww \aTIg[ xdq DPaR@&$3rmYؤYԜv#k5h9\v;SVk#t~B؇z\ ^Hyj=Hޚ() ?v7ǂF/p8ށ;yIxt2:jh9UlT\{İ.;>8*dɤ/_7O13.7Ir3DJȅW$=L L"V.o6I1bf&-Q*Ĝ+ |5AG{\͞k亴K-#e!iY=y:N6@}#o^%o :(UXZ&.>UN5G"|]p_X4;3So_-ۻ[-#2"j ymt1>oƿ ,l %m000\* 1$3 /1cٰ4C _+S %K p#eoN $4X G)))ضM+++&  TH(XI%J/:vX&9 "E #H װ֮6l6  CDt&&&6$$$'9+++Li<  vu0K^>=T Ϻ˖_  fr^"yD- /'1]b'T>S'z;΃Xϼ M!TpQ%%%#*OBE>'SFnIqC+*e%F IDAT0x,ps jx Hp"K Z?Q#L'v],p,p je^EJ""" _BN)@ )Ȧp 1-qd-q  lk  -6-)m; ަM$8 - {]t_ llV~j|G!aX o###SzK'1+JA F,kp#[ߦNM^   Oa I #zO} |oIa[*0 n{ K~222glOڢJ&^ܤL3xu =w @V  } 111TܤLڢJ3ovqM IDATZM[ &5]lC͗@V z u B`z  ,b8>#ʔ6rnz:::cP{_oNp>Q KiNa$$$R  H 6 5l#ɍNjWOTxi^>uuzA hB ƊĄ^(Z~WDu@t  y| ?d)KB, BW Ł}+(_GKZN@s("g s ?={$xK Y ytVmf;_Ccr=p:ms= LL kCzxMc IDAT ]"[@ qlj 9m6jG" f ( c-:#[A7gf 5j4j  \c[^j#  $\c6 )9 31h0e$ nOfgc4@4"D8tĄPp  z~.W+"""qo.K&1G |y3`*0/Mդnh~+++CM }mQ000Rx$G -bD" yiyr\ IDATVB 8} <ʈp!&vh#?  BJm֞ju]sn(!ݡ/V  ӧiΜ)<e fg;T$^d shٳbڱ M9eYY`c$/-31Y תת 0h7!VM8ojpqۋ'''٤"""X 3.0& pus,,,ڰO, 2X-    ./+Š *a;"S+++###444QX&pُD&P; Ʌ61ϑvK IDATH&M%7_g}n5͊̈́UNT(Y'|h ,Ssxь---]'  4"qڠa)d(q &ICشC555f&Yڕ2 r$@Ҍs E/yAp!!!l&3Q#)ɞX6bӌY/xkBoJF IDATq)\A _ʞXʞW.ta+0ykCt(u'9#ʝW.uD,0xB5iw'y'w4/f̭ʝV/w.va0xA5h] {' {'S(*FQѱʝUʝUp5h\\555 ~( }'*;f/ ӱٽʝTʜT6g5g\P(Z5RZS ̖gʜSʜS?6f\[Pa IDAT' Jנzp֠yʜS6f[[ɲנz.dנzʜRʜR6e6e[ZL֟z֟yp֟z5ץ}ʛQʛQ6dZZנzu#נzʛPʛP6dZנyʛO6e6cYs%555ʛN6cYYMM#IDATʚN6f6bXt%ʚMʚMXXKʚLʚLʙIWruVIENDB`armory-0.92.3/img/splashlogo.png0000644000000000000000000007076712414772654015306 0ustar rootrootPNG  IHDRY1sRGBbKGD pHYs  tIME Z IDATxw}K:nF$@HQ"%[- ۻY]{;{g}9cώ8H,[ɒLb@؍9XUU/un)@ltW^wAO$Z;% UoRJ϶-`X TɶQ)`g&''Oiqf?]J_uu^л!-) Û@)(/_fhhK/  :t,ŋx  m]]] />}nǶm0 x|~<^pphhO .0NtGGoROd>ٳ{- U^[~|GGG]c777T*_mgYm ;0 җ\5>{?ӟk_d HP?K_R7WW>w-e0 ?L>/|8 N2DW׺?JǶmo`0ޅ|ӟB?rikkݝ;v˯|mMMM7b0 bfffg>7~ĉ?+9ƕ':::G?'ܒH$o`0xǧ>g g7گ}!-`0 |ZZZ6?UF1z;;;_'=nZ {^د>piddd0lkk;c`0/ϟ(,ۿG~1`0 }})ͼ+ |ӂoƯg5 C=7ܰ>stlX|l.RK$kⷿ6Ӣ`0 !G9?ů]\?l`0ejj`d``BY,@}Fl ,WqO~tڵ\E`0]v>8't2 |8ԓ[\A`0a}D04e2~Ո`0V˺ug?ڔr'?ߝN͕3 êrvQ79!׹ z} Jp]u:B᱅N̋?eFo pA>400MuGJ?`0YlxZJPUg*_#}ش1 ÚG\V\  aMZB/P\QJSCPm.@-wQQ[c0#Y#> gwq*27yܱ3I{%4B1wl\㸮 ! C&''y!oq;|fBnrڌ+kqxӍ)sY S,t2G4)\; 06Ƌ|Yؙ]i9Kbl 7tcɧj{ח4`X^M o~sHX.8bA_5]sgh`xח2aȩSyꩧx'FQ$!]BfB-BC52gF|Fgnߖmtwu8[1p7RK/_:^9T,6QZ ( BB AjFO-P57{X"rCfo.bkz r?|<;w!RʪFX"ъmUttEI4U-LCR&𮤫 UAggg")<ړQ'X0'P!&@2x6RDCB&tW賣̶.dSK51h) Lѓ#8QJ361/s N ]SD n``L16̇u&WXPCP(Rj:D8)6+QX (L/LNVt{aj@9=/iqm6)Sc0cxM*&3/י C/ pQߥqB-j%T^3lHt*R,(-V2+nڡ!G7 L8q??A{7ɮݑE+f\@).(&rm6NIHf31v KI%(nV)Ψ[cE|篔`tZOGJXgKr%B%LOM359pGhIk.2Սv]bB99<]7Mˎm-(Q*^0'Ҷ%x\Wϖ";e G Fp bWSΜķ,^X.#5Sݴ>THYueӅ( *wlwe!yw6#za3NbezAp.MBnJq!:PLi>2urD5sļyH+*v^`z}=ZҒ#M`|/pa"E Xnfe( 2gL/qn-6-*B5a&DzaFH6굂;,@y2tu.@g:$4mDVܖM,w%\F=uG}ΏD]7$ew Fp tfry?g)EeXm !5i(0t3? V[@%DGTs*!>D*K>/ӫyn}:ml :#8\,RBjM)Q}6C]|`.⹚6&yPu^Nf&\Oi@2ۉjNi9h4\'Krc7$ifW+5B :?u{(b%m"w۔^mNNtؙů=4kX\cs>[b&MnӒ:uE #8(aXhr)hAZ FtE,c -,+fn}*rDn ٱ3$ɴmMfW\379@:Nl UH"M*!TzNk /r`z0NXmہukFHwe2vʉ婀3=wJ$q,8#8? )|0ڌ/@MW8ɶ;l1jAW 9n Er΍8 ;>'ؖ>-Y{; hrlETk?Gi ^i }'Nۮnhs^H+\ 4.rvg2ػڍ Gۋ֚)>* )BGh\~օX(OԚheq>Sb/s (M6ҳ7ՌKcT0Oh@_@!%_ mK3u<*>8 bE-'_[`$YQ Fp o7M3/ 8n+'bH-t2n!5(O!F"F#tV'v"V>Kj)kͲkNG^|eN>Rj^ʨzG[[[T*^ƞ>j-UDc5M  Fp o+Z9B«OTHu.$ cZQZؼJg')sf&pSYV%G6tB.|ӟC/2/P(4IEts?fI&X9!,ܩ =J7-ꬖh)6t/85>D89*뚧-.` ANȫDBCYD*dD]lxh"aYxjg,<wشi#-͜8qgΠGThqrD&RHˡ!OZE2d׮]$INq{ 7 6-GmՍFLx3b/-W%:pۖZUƄ or51Tm_㬳6Wx شT:r3J@ʅm].7p WbڐsхN,Tv j5#M"?M C/Q. Z۩ߘQi%7o"N<=퓛T*,EXL`0cx;&Z'~yхau`ƹB$T3 PެK# 2a|5V; H)hoog mmV5"6riE@ek`['f0{쇮%zE IDAT]ݾV#kc|50\.Q.)(Vp-nkvRy<0[Dv^ksVJbzz v* Bjї-jvhN{31lQ֚5l}TӸu?7Pl!;o^~F2aT$EJ%rx ͤ%D)OڂRj^ﵹFkMTbddQ a̮D?5wnw7&iBO[u8,AiT3 ˶:O:r(_b*W&88%@b(A7@ķpA"tZ7YoYaflaffa 65bYb7;pR+x8")PCuJ8ly /UPٯqº{XV0DɄG}{ɦ\4X쥫ǮP*z֞$G[[;wlqPLOO3;B󇴎Bj5 8Qmq8AM UP %ҢW%O:.MBDl3Ophp1Þv64sat'\⵳qa&z-.֧Sq;aA}kt4YXuZR)[eK?r ?|E"Bi|oϙ+:ZkF"hMK32~tGыQ&.8ٲX/""ҁupm R{[H%5 x j\]~ARsM_du[+ڽ .Mhkrip"Y&}7p)^"!D^Q8M%zɡ!dbE #8Xm4B艡Ɥ7p[* &a~ŕuQJM]Mp׵ =xS?.2 gCe&K6fiMi>vs6X[KnY-tK/A卮ˆPvDHwk^6Bve`X񍑹Lsrh/k@αo%ĬVU|BD,74~:>rG#*F?M&59מk,'HBB32.rRu{m:,^XЊs~#Sc6{zS!`5S.) Ⲭճ%.s\;Yd*? Fp o?Jg&Psr6WFA}齡זt%y 83y1Z.?П%ɆA(o<3ȣ/qiJv4ٲ$*3C3Ee^>]ٓoGґXR#7::FT^Vp58B(ڸ,spBwܕ2qU٧_:rq8:(٩ lZb&)[v`[OU[fY @Znc[ "Z@bdlIqK˦J*R9z|>iHf#^A7Zˀ*ћBp|YBhzC+sÿGHtu %hϺ|Iջ쇼qa/'g)R:qxxEVZ ʊxL7:qؽz[k R.l A\{]շsR!r8*XYY(n]]T2Ež ZU%BD݄x}^:c40Y!uVaOO8=SSl]g\?3Wx*ml湘/9BH"VZ"c2{8#85~ =t]*.2MDJZ\f2ξ>-ci}#c<6 /:E Ԣo zt``Lfi~$ۻu]Q)UW#f-qJtKD EH+l[5sp W35 d4 Wt, 踽M&zD})lW=}~5sc/k捲wkFg4l6 dbbb;~A!p2K֍+kX8U6Qr4fٹ+-?z+C;y V@)^:2_xRzj!%rxFHGhڨ_ )Ã>!}I&* R\l,q'LeEW[5V$ 0 ~1~Ք嗲Xi&U.…̋}[P1:C i5 ױ+lhd.dP(}l1R;%XjwAkBU6q&;b&X6kS,E]g=6Mu(JG5rKGέJAʋ\:QJMA}K) `GSnzS iiIKs9Ma%=[`p"7KuG%Ce |}i MVw'd[O֋QMsQ?۹w7,A.Zg9N!F)[`oژ8v,jJZ~Qš)P-_`{KK΍H{Q&pnBfznpahAX2JXsr 23 Fp W^@ZB"Z9+UH>k/ Zkҁ Tg_9E[Q̒Ƕ׺pqpN`5Srҹ$@hI>D%pg7YXFm WƆ5w8/ CeX#/"8:zv r|B[vb-*'Aj rT7u4j mvC98ۥ6ѝ( ߁/*:(XW3V51?}Ao'yEoLlױq*?ieHح; /=>M7ރ;eAqMNՁР& WKs"4w3^ t .EO^V̝mwe@ `fHPZr]Zl+ ٲ NNmƿ蠀նHtM೾Uco Fp W a~| Iki5YIùjW=;t(L 7>QzG4xlc +sRu!^ZC6׶5\\f+9 z X7N0}3ſVMD;BDcѐd܄`0cx:qU(zzIX)k H0^|Qw9u| uz?q_ɶM C:rzɷ$DhLrPI@`6mS:~Av܈4Ə~uQtq~=VTzm\8"8u  /pUTP@Z U7a07_-?ruaӌs/N8c/ m[י8#8DsBsX+\b_"A 5LЕҤ8V#p6=w]K03 /5(!q88M/5sWeI,)VFyf_"?/b =Qxpq'HmvD}4a#:n"wffcn0ca)tqv,Sm1UA&@֤hKBګ,懷*kKǠx \0daht*:0b/+ qiEi,#Y,4²X48 `aq݀ռ}'B5+*>yI>rK?fl˸/9Pq* G1o_E>J :&cURF&:? '@_~ K}~,dKֺ*/+3ܯ~O A9u`v\BHjJ6qUBC_o!$WqMp(Q`]hj'l!iXa`zL"6D4Q/.nZƛF3K!s]l^4Vݦ᚛ona^<|ɓnJO/=4m%t5߅19?6}GZY_=Z?6!1EC6TSDgp]-ؖ& #8ՠ:Q+[bvrOP:ȣ_fo䧫YS9KW0r D٨'@_~m jt '&$QJH7 ɍ@e Hm>+b"dqwsIk_ĉKNu;z:Nn.Yqxm#SM$6]O>Ɵ6G!TqB V9nsN},P0UFr Ng1QЊņX*BcYt뮻|?/^l:ʬ?}ﻗ,441GHIÿH#w.동9*D溅| iof]BG{; Eu< 9{ b6F9;͛6aznq|i eUjpCZknw}8U]#<p<ܶ.GI 3G(OypEWl4(@Ff#ՖuMtCivr2*+{5^y<":#|68W_%-2hm-[G?ʮ];q]׸{]wd.&ar^w'A&>΅o~ŪBt]݈ J"V0)IwdK%E#l!&"I$ .Bl"=>g'T*JMA&s,RIl,#8C* BzItuW~¥3_#~OxеZT..%8jdG mR%EqD5ea[\q'eYܰw/v"9{ܼ*ذa= |`^t<h+Mۭt 33y9F6x܆h:K IDAT@ 0IъI N?T}Wwk\*Ӷm2~|Cpa|VݳO|'#H4<`0c0,B޺#iЯvLd#EB MJ\rjelramui/ p 1WpNKtvvCc288޽{ٷvlقeYFh ?n.O%7 `1?;(lwh}Pq_4n$$51cd1dLn3Yf;wI&IL5AB4@UPꦗj<_?|^jyyyysN#- S@w] Ģ߹i`U@]VY @)2 R6i *-u)HN LՑc=BQ%Ԙ C6357pf?x:{4{0p)%Nk\mhSlu7``>)\by RI!%[Q3#I DnICdE"!gb@㷰[ÂՓӊ7  <+2pE5 %Q`%xg28h<ʼnYUhnE&Qڋ]"h$DuOflD;r"{"Ӈ+Xtm9XQQ5ц24bpVZy* <(8hv,sVp]c7ZaZLF fɈ" C 2f">gnEՎ5;Zʊ[(uec gԣpV9m (i V!@Գ&Nwn7j 6:>ФCQ :s~&z5#, |,@uCqZJV V R 0 d29d2&Ų,B삁i0 @Ưj˲]4 BB{r80L]4Hpaٰq&9R;},+VEtGƨ#C!!!>;u4?=FCi סT*![nCQQ7y322mf$''dz UUՒؽO̟7K`)M\_X ZX޽\ J6 +-,CECAAaBB&AT|*\ ZeeNȀ\& Es5 R86 Ξõʐ̘Ǩ(Z[_y\t֯GIIiP Z?w}UUزuV=Zq{7 p__xv/Ea~؅ ++knkksNKM<~;s J_ }]ŷ7_E#FwV,\ּe^GtPaZq syvݻwW\cǂ{3gCԅq& A4|_ ]:sMMF|zTUU-{MQ***s.l6:df͚A-EQسg/nܸ{ڵkrwzDk \ys"gn71L]1)Bee֯Q6PMM -[C||k} k~y >cfJ;(,<Uk}oFo>CʺSԦ'O 771^y](g{v4M?V=?q'VYsn<R_~>Ku{(l݆>;؟Ӡrwp0poO~go3@SNA*^vµv߰7oy[[[{w o|M ˲8z(]ߟk}o2&Q׭Gs󍀟S_oa0_UX>}RZ8uuuXs9r4 dw^2?iiiX՗x}k=|(' PRR )ԙ<5f:a)!\n_4fY._K;0 aیTx+p᮹ckkQXX(I #--hj2p]aIx/Fܐ,$Y8RCWxZ[e2A,_*$O|8DEE544o9ޞhf͚;ＣGMpv"d| nB$ 0JEx|.]ƕ+ar]Bq0^Ā:E,ԩhkk |.~0IArrrPn,ohlhy+#jl7 ~2OW/O)NÜVDz,ً/7n`׮pN}טw{=.o}8]"yEZM0y}%&MW^ykŤJ8o@Zj\n4 "##!(!d}*0lR( ( WSlܸ #wsX( }gũSiNQ^rU46:]p~BD(*JFMF8hFMM +ZZ[s6f3;}/EQX,퍒刌F ,f ZZ[`ٝ'+] C|dxg^Mﷴ࣏>ƨ#1w>oXfM>#ɇHKK% vR|Eaɒ%EQXk_vwa@F/QQQ~ӧMòeK1`F446w;p8By466gBllolZ1cƽ\tfw9+UߞĄ]uQDIVpҋ3&22 +T*@3 23m X<(fuWy6׮⅋&" t'<ϣOJ ? ʢl6C_W\}?Vk{vKۿGMm /L]Þ6Oxׯfa۶UhnnFs?\.Ã<W(BuYJqI kLs'%V=v 'njHKKYca@nnSBV@JJ2% uQVveeWW 0xFYT*Òe(++sϛ!ɎxIII]^Wf)gdd ;+Ca}Z8{ !Q81 Ccذa`hWq9IQ] i?>UU~+eܷx|Vv <!CbF5^J? & ==0ݱY;w''#nC":: 0 RF|NR0o\Wx?B1ZZZ3MJѰaC ] `Y;+*$B3R6GtcfCl]477KJ~*x}Q4Mcl5*>q'˰`AZZ,!C*kfÎ;yf{įt: `3gӡjpxGMM-Y.dw8vbb"zĂ-BBᇗaرEW񖞅ylۺ Z!+|Ņ~~xJ?Ç{un^_wӦpd` aϸ/%H%DFFbr$Ia<ϷgV)|h<ܯ]{`#X|߿6ڰmv_VE6yZN^&kzrEVٳ~z}׎J%rr&#sN۷/.X՗,XeeWzIA.Vړ:5MӐaEŋa| Wap/.m}9|=&t_d9rf͚iJpph1A8ogx}½_-fl֠}80˓ 24s\\qxcw`֭ӽ/4X=mMp QvK@LL 233=fd4h ƍW)͆=0!r mmmh) 0QrREQYhvRR9 4}qIRƍ~j(((nj~}RR&ې5GEh[||шm[!99iiaS:Z}-N8^5hƙ3Ek/\ch4g.˱`|wrg6yVҋHLtu;m߶Ǐɭv}1{[ꂒݒDCRIڐLQ8CR/EM&.]Dɳl~˗x1 1o\$%%M)¬Y31zh,yAWg툔[hq$eË/ЫMT8zTޔ EQXxΝcbSO,Z[[3 ,7o%K[9V=|N,L1ju ;N%ߏY3gt۳WT`>>hX@*!it8xnܸuX$%%aᢅ\ͱt@u_KoΟ/)@UUuPWdw˲XxQHHrb](C# 466b)HKM9wq;\"+**o.HGws]U8rgZPlmmB&Xv6Mr ɟŸ+}ڟ<>}*+1s unߏ<7nFDDp]Sjo:+\jȑ#hhhQ3^p@}޲ETSIDAT4%%%|JXPYE|b7ЦOgƍPU]#}"..'N#|;ֆ/ʕI.55'L5*td5ߪMN\2P[7cFҺpY ӹkhƍahjn0r<HHH\iL4 JS0Nss3v}R@Ttmވ믯رٸYqdʕng%댍Zԟ}ݧ$CTۿtG㩟?[p86#^fpΝ;W%kCAAnϙ0p@>1!9(@eesM-a*1-ܞ3.]rKdbQƠAzd2 8} >[aJ]܏˲,QqaX$hm9( QQQ1b( f\~Nỵ6'u.5izB\gppjz} wv.\"92d.5Q#Gᇗa!z>}[nC~~~)qrǷ7`0xLmjsELttP#IM}歿oǡÇ1iD(JDh4PTҤ( j>>4*g{Oŋ#vnkmCj_pi,IX{js-.Lor7No cqA|cGQ>x_ȇTZZ-[bCl&#_R!)))dҐ#c[{[6lf0~<&LܼN3}g,|Jfe$s_ZZlڴcOiCF( qq"Hc!-Ә8qo,|.== ـ' 6wC:! OSz{?a`Z@2&3gB.K~iexKٝmp OBIIKD-<̄C=$a`04e5d 0k̐ŇëԪjtGQ8)deӧ+܅rÆ pHJJBTTF>ﭜ7s8phLJd ,ܳvaڧd2Yg ƫ JfV)S=fP^^ }$  qde[ IK`hFҢ{oUi4L:mN\@111;6[LדIIIFbb<z WRWl6 64d$C,yziΙ3gp ukG8ɓ u7^@mmmwNuY< lrm}ĈxDZu۶N._B0u̟73P Ĩ(qd$DJH__R2HLt$7w)R4LtNKK >hjjT{Ch_>QFOEE_;:jSј?o}"iX̚5d졥?^~3\Ps_R_z '7X1 N+j3ɓ0jԨGK1 'W~z5‡Zٳj% D3&`wZ82dXÇ \.9]Pjc $ej̺!;ӭ b X>],_-xGDDnvւ%+k Fqf3"4ot̎@l@7I] 0 rrr{Y{b)Hl0@kU*nm^ye̘1qqq>̇qge2 9"""0x ,^O=siW:NAq+ VQ6@79z۶oGJJJ@d9ۻ:SOkjy@&=?@W*+ą4@TT%EyV%%]NFf47Ayi'^U ""*@:.Elj,^/Ba)?7mFmm-, l6fKi`ZQbQ@RATBRAc׷/ш 4C#>>^e (nm.[3Pr@ 8o|i|"66߆ڵ_jZ$˖-7\|]9FPZ~0))|6~РA-HII >A{l6qBJHHzƌ{#O@ nhܽ;!9^`J/t:q/RZ&O@ nBf3>ö~ecssoVP7+2NFyW#˕ ÐG 7_|{d2cM G ">>-F,_0?riB/|q1o޺~÷&yCC;U G R&NJJZAYws4i"d2@ zeqX>6nԴo>,@k۝hd8dfV5JNINx4ɞC qP[[ ^Z|9SQYMS{_Y B6- ǝTуrY,OӴR&cd={yp3ƒe,qVL@t˲WFr @=qefk5IENDB`armory-0.92.3/img/loadicon_1.png0000644000000000000000000000257412414772654015132 0ustar rootrootPNG  IHDRr ߔsBIT|d pHYsitEXtSoftwarewww.inkscape.org<IDATH[lU9翻r-r1E Ĩ,iBABRh!5Q@i\Eh"X0,)b4ҋR -{_;g3gQUrIDi1]@3[UsTCsmYb[z‹\7<,UuHh9sG555a5x^}&1sT@{iLp__XugVZ꿘>XɏX'`3#HX;& JKQ0C^f!R"24i 8WT g=2^M@GpK(ZnQ>g8eP '0نn? 0 4,.. T5$ε1lCeO3f'" 7o.T=2C\|u2 ۼukL@vsǢ>4\ӼKN?//Fnu}peEEEgځ)1Ω0KkQI;JD6w)u}aNdĉ 0pǎNw'[6t(hm7]vߑ%^eTD2smmm`p8u.]jA/~p Ro?}<B~R%wP")oQ\k `NF"oQ)VUOH%r QQ뵪7::Zti>KZ XvT)ǀrdqT0 $dnNGU)_Q)=IENDB`armory-0.92.3/img/addr_book_icon.png0000644000000000000000000000212612414772654016047 0ustar rootrootPNG  IHDRw=sRGBbKGD pHYs  tIME#!L~aIDATHǵoU?ΝnYb E}>!11>&ƿ'}3/&F%AąF (46νLJm&7#ww3UvBDN'ξρڇ Z_<"%3QTBN8W7ʅHDN:tcґTբ^Vh&2UDuRmK-n61?gμ z݂0GT!`X](q PDT"VEHb(@Z58c`#Zʠ@Up6N@"BQ+p܊ k(b_fAo鼍gs0PLVԕ\x͗S {a3GM}ĵk/ YJjݒ:>?o_MN1-ɣ= fZﱴ@! n~Am$wX\"j2Lx7 >s$ʼn^1!`xt ' V`Y'c_T4Bp8e9dp1DAn %͑FQd 4(lץ8uy$PA%WE|Nb4+IȲ]Y'C Wۃ˛}~;"Vzԁ Rr]<IENDB`armory-0.92.3/img/button-yellow.png0000644000000000000000000004554512414772654015753 0ustar rootrootPNG  IHDR\rfgAMA asRGB cHRMz&u0`:pQ<bKGDC pHYs   vpAgg܊IIDATxweGu=u gzrV@BdIbw?w18 Mp , `0ޅ5g0aJH"H(Fhr^u^OOg:Nj^USN:@ X\~J 5@D`6@I36jkXLXe}zS !c%ҿ ȝJd(9N "=(k_IkY(f%=H/n| `ppQ7㥑(UŰY$ނYAXЍ#D ".b1!@$ V*%CGaa2MN"J IO:^d]!zgˇ9t5b\\%$#)wv&Ud#3}ֿzjFyjp:.)Zu|o b9e䞌$r$#~/{0 5!a@Z8)'50|FPʅ-;7ߗNI'VQ=b:pOp{ؕ"q/0ԫ%f~9Ysj-u^@8"ǸD=Fvtȼr;otF1#Frv? F<kTS p}]X0XnB5")^$zD$..7fiQxhgBf~_ CשX%e=S-/x@8>y~h%fFEq_EiO0'hOvH 8^$z.zȰߧs&m{-oLN)O\ Tl.l~9),9f|]-AL#(kyOtD/ΩI{1IQep{9ޯ1g 8Eyp.¹||(!ŹD"5$]kWJ$IUjj sQ3 pl|?VOc6c;Bb+I_zk"mxR'cGR/ iқMOTpwP,tQ,tS(tQ,tV\G[\--q\8*L~11PꯓҖm$IJu|TcT*cL()%;(fV̹⍟Gcc-B\Y퀑iَa[5nYpI5櫻U'B+e"鹆G=ǎ#J:&u(G>A!ACwVչB8.Erq(vcFÓT7KaDyHBDܜ#rPB)/R}>e Gbrvzg'][h@G.s@'O]yEζ(&'f$D?c;qGQ* *fYC;]ضӱkc&G.ߨ|[+ɭfE5XkJܲ7]gbbuNW&SǍԡWaq}CDmDOvz{B(e_ È TBK)PM[/شEhkyZR+ӿi>_MX3 ҄ĽX$ F5z҄qr2Я$I޾Qb{شrzwٱ|,h>/]ɜiĩnVft#|(I|Y-UǰacE&m9,OQωҟ+/Y&Yn.x{`܁iN׋.ޛC[4a=x@ԩz9:лn{/a){<{gYT$"tt^\GJ!BNލ/ul+Ӣ-ZF-䯢> |XpA+!o qrRxHkz"P. [8rb7{vm5l轄8/_?KenF |eh3лI;|j9_>8ExHm" sj'+)NS_beٲ zE)Ǭ![%)0!Na4o9`qns\|c6GLDyǎ(8g Nmyw<ΎMQ~e/pZp?Ij)K \qU֝sޛwlRHЪW߹ TH o/Ivx}Zodx>ϱ-"ٴrvx!r+שFzEVb`@]Ç>i_xxĎ]n ̪jڇEtlS^V8wV3|]PRp|Hs\By%sY3vwne'eU**QNGIbq+#zdNqj Xu:jw8Z y*:GO1{O|Gyo}4w<\Fxa Ʃ{Ӽ1b\~U]sPqʇ1V; JpQ oj)k=.1\Td׎'sc\.OcmgGDH L+3  .2b7ky3?VEB9ZZaKQ.Y6v9_'K=)#ٳI4%W AL0Etwm# DV >u8;'t̖hA`?z+w]Ӕ~'0V#+k{8~%4q;cG\- m34i}8]ʕᦖ@.]'-ZOsu\ ?I7Nrt;H<ۈ{v\Ƕ-Ɋ1rV$ cp fL\T djjkWy[-֏ . *Ow.'[]jj|7 \ǎm ?<ORLK4ŗEh6rYU޸^ݲv ЄkcZm G}s5ım˵8 s"(ioe|4YJ@Ha# ]bv@`WzǏ/_c,r 3SodUDشa\ao^4Αc'I)BttIWa"QND펗.O.m|r|b;tN ovz2WV y*%ܜ#kgѾ1M7/Bwvv︎K6v% P*O3[ z'-וak|6 j'"W.sO`bwgx2R$bDZmD&7_ʖCF:vIRCWamJGM|{uKW%| =+1)7?9g@Dؼ*QN=ٔӞ>ۄ]b!Uođ;_^ $I5"qvRS'G}z;Lih߈?+ 8_0];uTk i񴵧E;EY?[>.ϵ 2), X׽v=8*rx J`m_(9xh*VYeV/Kּcak=%.bSm/fow6mIcG=;'s2o^,oWv hscO}?LK)Fo?g6uݻ?J_gN j%|WEt y IX}VD.GKS~8X,콏<7>ReJeOaޙù3<~˷RO^/#0&rM'Tӆ(ZfFG&:/R kmul꽒c'|OC.2̒b|w1j@_ 69uէN(MKB8!BjmJuVTiVۺufľ~aar-3sjccƩ=-'#Bgf@CbfB˱J&Tc3`gّ*,N+<|]N/ Bgr &%I1L=mY%\LұY( ] JAm(B.h]N4EQHr|)8_Iiާrz?]{".{Cᬿ&Ԓq  B[G }oc 5X!`?x!5% C|Fگk;S_Ю * rud  t9 Ŭ`8ؕbܾP׹ g=mtIi‰94aWGÃjQYqjujuAHY 9^lj_XUgD4E`t3n޶\}J_xTЪ M3s9zw1Q:)uBwZ/v7R 7B BJ9R_LWz;0CBYdԢ7ѾkLjZ3M&7"Oo<3I\L@TQceC=%wkA.<VEtwdԗn76K CqHl1 q7nZ7E޿ZMu3"m"r)a!]`!:*ڊi+c|3O]B.#ѕHQ$z)~C~=t34`-O'r9.dro ã8v](_S?u.} R暖Ҹ1<`l؜%1gM_y_9+ ,щ{q<+ܚ0r،ȿ.Ut*jԹAּ6Akg6@bssvƇxHTL2̆u2l~Qaf_`0$+NK%tmTJȠeo {&slT6DݙTR0cP(t 0Z]$r]pZ=P,Í;Io,V#ZD5T:I|@yz5]`¼2| "c|j]vMV BVb 7e|~sRfD ѶV+0:\<sq\CΕЮKM(ԆO v,_N~ٜ1Pu[|\)034Ob;$FߥbW,tjEևc Tiެ_R|b HE(:0xM\"K(;+>skO#E9:aG2wBE;ߺ[\}m2r c 2,]o4:qbr6vX:= ɧ\żoO=2k%t~5ooͨI(k,@爢¬2ʔ5=ڄ'OeEpMf} `"{,ּAQ.޶!]|.DRo )^kXQpƞkgQ0K2)85~~9)pNS ٔQR>ߙU1&ձ'%.n/ꤞ/RDZjBj$~"'Ti(w$ 8*E 2k cs敲QB5dungNG!Ҁ4 'L(*Ey$Lsa:^ e_[!l{coG:rDQY}tsQTՆzh8b|NQP=sIR&8^VO5u jyfTCԒ1 u눢YiE-\27Ke/E(*{A%Z jcȬUSD-V3BPQMPj >nNX qT$ DP7LѫU3uOWNk%_2^ӿ'N)٨&}Tsq[}ijėI|匥sշt mc]@i2/3<3v6fR~]CgjIOEmq{:tpaqnJLQᵖ':iѽ+H~RiB'wwS6>;R+0K$EH5U/hP 0LuNɩ`3&ߙL 3iY1{?+_'sve<5 b! II揇30"`SH"6Gvfe1Mq j,AeqepjYS|[Z-@ 0Yp DlS +LfɫmF @="_H[V__W ,A"KLatm%t#o9͓H΄3,;" & X~1931m&596g=s JBVv&otbl:4@`9h8̶`X64c`Dېilr4XB$H6!H7 @meŷ4Ҝd H!*3b{fZj[L`+lflFf/덙΂Ɖ-,V$~LX?ͳ,w0JF)s0,!f;x+μ;]gl7 Mim8zwY w\&M{UwC z-T,z,;@ in" @YN#]@ Iirrv0P<93+:EHP{:-;Zm@`2m&+vS"sl"Kk b6쏧}@UL ,#2#n)A+@ĴHCꤵ0k=.@`*;by[ @ ripֆ~3Yڐ X6p,7H??mzi$-,M8aH@D[Z7$ـK#%Xu|kaTVjM?y`YPt lfYna``cFJGSvH?~Of8ߜ ~dU`~F X*TӒ%I;7 s?D,, `y5<ư VC0@`%$PHD?M\[7aIDU{M-`ԧZVIjJ(,WQ_#k쏪7ӟi#~5=Z$  Xp<3;jΑSc0B6㊦s"IR+ { w&y->ZC/"M ZڃEjksTkwg*c05 2@`jU `-k})*^S=e_$u'>{#?L(^Wgemƃj~_kf$1U2PYf^bp4[Vd. Ki]>7fv_@.VU?@b⠠Abj:Mon} {Px|c|^H.'A KdǛ@F92 Bd-caR=jv3ӀOg.*f|~iDq:s`MjTi۬_6lWݢn<2ԪP,wkJjh!n}~9#fܚؠ4bc"af7j әSJڍԢgoD]$*6;\ À@`4of7a@P˚v`|0,XRݣp[_5SŸ5 zM~LSӤGn@#IWMs=|wUm((ONR6ʥzfLz9+w>魪gf,^allᡄ`l45TT?y=sf^y}MWT' Ty/́@?4uYb꿢|;7,{Qj@ pr孙W0;egJr@FFuB.~j5?L}y=\>qLEMUՏg,񱰇x p2YtGK?gc{vo?xfc'0<.a`f] ?-Oz95"C:_91f8Y~j("0>j,YlBU y2p7 o_S9fǨKp 08@ijxK7)[^ êjFQCJ(.#/E֟DM??^i\8}L*sM7I< V@I8;I}i߬|~~=:so1/eY!CC33i/=>tuGA@3%;y6/Weq޻MS34GJʴPBY N+RiΛ@f%*4>e|.B4Dҕ}i˄?UW.T"{Q+fav=|PϖkdL5yCmzF,FϪ-fa1د '@ 0>cp0[n57WW[8/ڂ~aۋ"{u͎1N+#ma,LLh1\n[8صDZ(X U8Sવêۮ׾W/5-AT+Y6y8~X9}r^S'GS2mS-yQ&=״$},}2r_. :+Y'!P(pA &ȽOy:3/+?^k[Fx[u$O;/:΀^ǕWGU&w{[SMN4yI.Ǐ%{sP}UP`p@9'S"*,zP̞3Ϳ7'J5?,c7SՌ} 㩶^.^3PU%GgsZ7L-t?wzEq1_1\rEĎ. Vp@jLI18WX\={w#<%5ۋqۚ:ipM쒥V's˶mn']vXANjHSDZ5-J(gIzfϾT_:w_~eݷ{߁N kA2&tѮ)PzO.Lk^O^\FeV}t=%݁e" l c#FWe.Ȭ¯^kjջ 8A<_SD\t {,} Io4wǖSV!2$hX3^'<욈ލ+5BicҞUv fw|x VT_U ̸z.ё!;{#u_>3TQ{C0w.,`*}NDe/DܦVߩT`x( bbǏ*{6mTNk"_.ql(pwُ29{Ή:^$ 3#a۱#~徻=2~ߣ>yky)|]&Z \g,sa7\.qq80*>ρZ9g^w #G߷ܕhΊfzT{ mRY"ꫡZu_0p@y9?Mg{M^:nD5][ !>$Y/OuK1 A::gb`38`wٷ3SU77~ޫAkV7Q;}S3F]-F0sEξ#]?ݳ ?͈%G? >{)U]=+zx7rω m¥WF\t#' D$ 9}Jy&^?moŊ5l EV!H78Jbz7W@y(+JR4ӊ3js* jlD\ F78e#r4Ǐ*Iwa#؟/wMϊX 0_8b2}sѦn@'\|yĥWDb6q<TgGPG~JqJ7]@WȩלDo٪dΥW^a=@-ݬcݞS}0y|9ׅ:?V`:OljU4=H ]FS' IFrU sDH|bw;ϘufZSP/F`~]oUϫ "[~ݹc5[W<,b6GJc⨲^OGU{sr3vL&} +(vʬs8EP, {.IÈzEEA\4Ȑ>ϡJenѧ}z̿3[1ʪL*qi;k0 |&t<}*r{pIrOQ[gf579K IP9v;qq/zgH_M[_u#? @RUh;M~30}fa|04Յɫ N"8!2`3(`veWEl0,X@R{='+ff'^ol|~@ gA^\"{>( ;v9.ܱacP+4aRy=f:؇^?xkC : E0۪I!scfGS5ݔc^o|J;GL<9,w5x~PI.w^)^윛5pƌA"RdžM|#2X$c V<;K|s~ U=nhoK rWpX3 W)D1q.~+V,u[GEѶqrprD:o|>WyoasCSf9ۯW `E܋De"ѵYۓeHEֻ"Ƕ펮n ~a揎Ǐ(GzmNcf}BUEb3'_.=kR4xrڊJ9bg4 ;:;v;6oq ah񦩙x:?qL9GML1wG{xu k_DŎkEE/t"D AҼ;v;6oz z. gZ\2S'AZ6' 5Lj߁n_//k^Lw^>"IqDduHf~yc'u`532?j: szJ 3;b*5䛍;$';%E/q|(Bu2PTAV1cp8m8 *jg+fM.,s>_G:΁j“DWgD{CЄ %[غ](PcW+VJJ9;qT으өG0w&L|@Ϲx@"&,GG9KVTMI6\jt8֭z zSA.gI/0epܙxl C14d/_y=f^U}wD1>~V#/{-$M%Rq'D#Az(dp!_ EzRe-rB.߼\P tM12l FՊE:Fؠޡ_6Spuܖb2Y"$狸g;vb *čRQ6 S_BB(MҰ`?e" \JNL4(RN3&lRM? a젙~KUBg:|28MP^O=Eq\,s」' 6m\Z(}:8"ysgs]tFUA銺'I?`rYغ}Co7T9QQ =7Bbio\Lk0vNqF*m:|X,Rmni{[fzx{11\υLP o>Afrsi qDt7`ww1Q=wL0ӕ광 |oJ/,X$~oo,`v>6#q&"׈D{q &RGCjfw1!޲pԡ*) ]/ k[F~5ەwb(. ;1)u.z]luus{ DՏ2?U; Mptn?QRr_ByVNȏ?[_O7:KDckE%"n3![fXڽ40+<1Q`2 ea?Mk}X}@D"咋#6"v] \IhFÈ5U0ƸOE8Q͒֓)8r| (YxX( n lI 0cĤA: =H*80Fڛ&Cf!9.pcT*D8NB!(UJԊ `LYNh&$sQE"G͈$ rT PH |2FYlB%JsI4 )^Ndx+= g!rqZa˔cBs+7YyH5MQ "x; @ $=8p;tEXtcommentEdited by Paul Sherman for WPClipart, Public Domain4%tEXtcreate-date2008-10-14T16:40:21-04:00=%tEXtdate:create2010-01-11T09:43:40-07:00r%tEXtdate:modify2010-01-11T09:43:40-07:00*2tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?%tEXtmodify-date2008-10-14T16:40:21-04:00biwtEXtSourceWPCliparta$tEXtSource_URLhttp://www.wpclipart.com/4IENDB`armory-0.92.3/img/arrow_down32.png0000644000000000000000000000235712414772654015447 0ustar rootrootPNG  IHDR szzsRGBbKGD pHYsIIEtIME5 oIDATXkVU_sL,d).%i&MQJ D?(aAABE*Q)AZV)Iss<۞{>pr۳|8{y|xP&(U5}'tZUx/'sٗ . TaTCyI;D-3_τ.fȆ0 ? %E52wXDL܎Lb`(:HCq @-Rj ] 9Ο:)8u.;qĝ:3ʠ-O"nSl |Oz6"S0 p(ApnLB5#̝S?E#p0XP PU㡪 Wv6J\>v@ltFgP7 d1SEJOBLz'wҚW*^˫\: p9Fo:"28@hPbdNIeq:²n]:l7j"T Ma= Jܼ-/N5mj<]~'8He WUKOV\? 6!Xk0` &7‚7u=Y4 wCxPWk+6.jb <>!x1D$.8罦?oA/=qUGCm@gG~)Ɠ\/D)AzMNmʼn4}ƣp4ڼvD"MDF8J sqo=)_ݓLP00꾗ԉb󄇦b~:\#_qc 5:]jlʽtyv k-"$O%_o>;rr'&dvqkg__2{.T[tמj-!yHI` Pv6; WWf7xv:ݷ;L]"umHfŽQVQtG xiֲC/_97[^lcT"6gB/[v_@0ȨU ^^Y0| ۰i˩sa±b`w[͘7{P)n$[IENDB`armory-0.92.3/img/frag2f.png0000644000000000000000000002567712414772654014302 0ustar rootrootPNG  IHDR\rfbKGD pHYs  tIME1.uǢC IDATx}WYtdb_ c\.5|3=/s{0}Wi22Xʈw{ϫV0ty k8kf8Ư0:`W>8p`&*8Pu Z"|(5J˥?!< 5J$Q%E?p>A8`a3A09E:`+5^5+aK~ϭr宐jU?Q/M}t t{&&]Cx?ׄCHhЧ+G͟yDЏU0T%+{GoCNMLF|!}? Wcɕyu17Mz^ ?8J/U ϟġ @m~owşKiooTT`9u g #{ L.Mi{:Iҟz]"RQҢ >x?߂K4MQBPH8HA7%-~_&&?$}M FhMv݃1`>"%")&hB`/M;$"^Wum^=b{sM<pK"E f!X@HQZ0uro.sgfQ—#?\%>tKHz꽑q\K~py^=\> zR!eoUR /J6}NտH$G䍄!57pMGЃ݅A_n)I{Yv鵂:q%/D{"E(mQoac^"B ])߾9ǞTX}cpuxJx?U+~Nl[]euׄqkkC/tKWvvm.x\:}Nz%,z^ϧ\/D[$*/m|a&pUe`aS4\m谠'.'ؿI*wO{s]⋽?ķWE2U Arc ᒾᒅ+|=+w{t)g$#E`0fW{BM}_Q+Y?f3·]D0 kpՂn ]F|Nվx0`TO3e~VI<{iO=+t[n "KgJ;\oaY%y,"l6YGcX|"an|@W^jW h>%.';&vhj‚(C)>d8-!Aq7\#\vw (A8y&g_͗d>n@oQƕ+B ZGXf`+6IΊ ۈ ='nB ז )˟Rί0KG_mEխla`<,5(Aƈ/}p?klK_ɾ/D=:!-J#ߓ蛧MKj?+} *mķ %!(uyTMZK~Qy|0˟'vX7$K*WXB0@g}U֑3#eZ~Y).ɷJ_P6"n@B|{|2CJio ?ǘ6\ohZ~i=k'IYV($g?J 3\r0"bEMJ"\ \rOKdI qB\= @|K5IW':'=\wpP#| `l#10d}\[gI>C" :!{ )$UϫK_6m7P.P#!AfBD H!gI?LR__".o=UjKlI+cZN /M=kT^oC^pe" eys3-@3ĕZ{gjIW_+/-"-1,oh uz*$4$_'p ?eT'?;\E6Bz<2NOI__ ɿbߐxx77bBAM+B~? 7w: _O@!5F n#$~o%%\/o!%9MԞ)"p :DQ2O;_ypz/_kR&RX@xDg.XvZeB'O)yIHsߐVf!*p#vMTuA2wq7'K,gHxԞ]}}620q n'\"0)Wj_) 8c F6_2O"H)_5Cۿ )RvQlЉCo!p?GV~邝lAwpI+!ܺ1½gnvE]# D`1i}1l i=?#߄B+~C=U+$4 2ۿ 7'% ݔg|U9h8/qW&M#KE@&Z<rPכ{pS}2ïPV+v80sN> -&?ʟ$׵eMn'VM [y8㽺 "d7x>`ZExXmUK @dG(rtWzazg|@xS.LᲡ@pI}|7,o0 'Q0(_A@'Sn55zop#[`pƺ ᒂyϕ JIGԎƱy*ڟpx#.Q+'A2@>CxG#˄kk04vɵe!CsSN)11 @o%#݄ %'Io>~˰zGP-crj bE;&%v?kٱ`YYr:U.'j_m7}^ia `麽GnMrW|k6 C&x؜DnuBI*>m D?/>+n&id0 E`|k lb{K٠p96?/+?Wjwu.b 2 &gt\@\"Gv],`?51r!TI> h(ji8-yohay \W.Z\@ =\o#ެ;p-g?.6]&\sRu*N_{l`h 4"ޢaտDذp.@vzH6b-*IW5ÕBYn@ bZ-7نaCQ6o~C{]m zqAIп&7yř=,7r .Ǐao1w޿w"Wm.H:;}s/xa_$Nk9;m.@/s3пO*?g]~b}}a@?ȘaM"~6(\`h/d۰YrbиHv=Nl7:ʀëYN:#̿E˯9n0tq8cg0t6 Ta@].kqn a$Pg.?sLĭ˦"K Fϑ5aqRx?ye|?[ Ta `Hu"`0xo= | !0!Nw٦/Zo0> b/TA/ew)f lP=@`Ȅ#Gx"K  ̈@͂/{F8Io 9!_%Pd-h0d1 @P;`ȤLhD |#c_9`0t܇ S``&%x5ƩH P* l#$Na 0Ϗ`f0 Ǵ2| d!alC_C  ^@: j 8%˰03GD`e(h0∀9!9%{B9sC` yHNM UQ' `U!MC2 u9_`-'aI/2 D@ɇ/LjHG!>ho9fL/Ƀ61 郔Tc o`0d @ge[a!PPh&00 s&CwB00 |   M,0/g I p@I!?i4+=9#6 r%>]8!(0`X\y&Cv/Va- 02l DƐl7!8;{O 1À>_^S!S@"6sC6 pH @6e(`!-pL矗>0 J qT88«V 0ʊ( A Z D (G$q>Z"`H?OC)a%d. g`0d"?VPUL:  v=k 0L^*>U] m 6` \2 BFCn0@'2o`0;p?g.`S! UD-`0ezA WA:0kCj A7 tcr_/jUns-A\ zyy+,\9C:HZV~$FyF@8`H] ૎!h`t_}F8<5 X`0+REt0N[pMU t@v8ÁA!5z4'%]Q0p} o@ ~5@ʁ7(`0X%TGl8p[I0ϭ`0t|@m8a̰Bp X`0tK]j >$/(MA* #``0_BFNc% ؤ#́; 0:b6 *W@4p9-@ 0or:,ui ـ3% v @T7̀Ajw9  @j&.*E0 ݂ _ua7H$DB!$C mNVνo$KlDM C5 WKo'jbzK|@aL 0|D(7rpՀtIƄ'I~sծr3Er6h'``.sC\ݎZ'`;*L\ŠjbU\PO$jU߮Utc#~sCKWesgX X,#5"<0Z*qV$ M"?e!@x)hۆ b @d Q$.@ {)\e`@`.`hɕfV$@VDmRm-Sl0!>e'ho,5xN]|WV?yIc)/^Q67%jy>xWM@Bƅ%!Y{UL s_i{G57PVO=ϓ\[^or3g <`0Ԓ_~>oD@TW +5Hkچ8X<dPz@u C9ӁI{2'@CPmɿHΔ.Ó t .!8J& )(X>`8Y.i.:G}UTBp.! .[إQ,`07oDM?W$!x0!8!S._|ǭTt/ϕ /)3$  B%  =˖|ȭmLN\A\ I\p}zo vqU8+Rx W⛢ f'0"K&=20/_/r%+iTw 8\Bp/n>睚z(θ`ҿ܉*+MsnTZe q K۴-MYa'i>U"=+XeХ䗭ސ/Vي@t$|5ذK~I [F mU$E` \%G$- %?_%\bү^>`W| \e1_R"00tSt uN>`2A>@u 2N~i}MqKK~mH>`1ͤ $H+d"`Ȱ7s嗸Rc:Q c8 @IDAT *J}> #+彫77 >MB# {s XuI3ؼ긿w B{tqE@N8٤X!N 7Je Jx@??p#$N@D@ \1k6:';YPHS}P'9nLI?c 2$%:Аܾrf`+Jr 3 M I0%dB!n\O6i-:[p@䠡 ;':MЩW&"r>܆"1E@Q" {IJ ^ p{ ",ut +{%I=Pdv0 7U/Ǚ[^ +XK(MEoSYrZ&)$C 2[`Gd?sTix"GV/`N@*}CX%x uݳ!U$/'5]WvpT @#EIqE`f$ap=;-Ih8M`iI=Uc23Á)BSw J3gIB/ҥ.s ޛ#킴ʑOJ puև=0IH0D11|.!yhaAY~o"oV D.)+^{2Wc~~a`ܐ@zsP<x2bdBл !ܻWY?jX,E!Sӄ&|.ZX2!=T)!ț_$ee L#a`/`oc$!A4,SaEE=\wWgK}UjQwFMSxNH0 $n`a\>Z֔Ʊlߣ,Z㬋~w) 5H ~TG- &.-<XY]%*/PQ!A1ҺP>pz`bM{X  5y?ʲ:0nS7IZ%AS1RG`.Q4e2o ܬA7Az_U߿W\e23P'$K^a^;ܓۂLywQ)F{b}i9_enEbZ"!AonXd>\_Z&@ Znw>(1Xv$D &m|?㿠?kߕ3!A׾az+fDlXzgr B^=jWP*ߣn'WR;>.| {$]%J|\ʪS%:pr݅삜d0*+?U犿! `7+z:"B02 ä7}Q}U%~k/~шoTNARӿGGpt8W> C?B ^^yM-*o'F|V (MBn1WpxoCй>+#/$b7hH=_+ppp.>pO>DV koB5ca7j!|9nL``.?['D5Գŗi/'-WJzJJ6GaV1nW,l*z1A 03+MX6Eew?2;!Ez6HH )sꚁK(qAWQ2LvMzYK$lGbK+W'''HoAC$8I?Eaanz!CZἲ^e?f3]HwaIENDB`armory-0.92.3/img/conf2t_nonum.png0000644000000000000000000000053312414772654015522 0ustar rootrootPNG  IHDR$&9sRGBbKGD pHYs  tIMEa)IDATX햽AFJ)dzZV{ңh6Q(El-MVd2ɝǩ<7Ȍd 4 '*nG$B"$B"$B"$B"BD:t"+8P׈_:_vXSQYsH(g1M4c& EH?*D|kq( WyT#vXIENDB`armory-0.92.3/img/armory_icon_green_fullres.png0000644000000000000000000011173712414772654020361 0ustar rootrootPNG  IHDR/?GsRGBbKGD pHYs.#.#x?vtIME  z IDATxy`T>$3}WV ]nZVb^v H.-+~_K iIdB֙10g9GkBf99s^y>Ĭڴ^Ty,Vȿ῔/kc# $Rn@ `y! H$ iȻSwD@",D (dSoJ+nJ+,"$ɨ@0%_TPՈ7RDD2o Ѝ$(b@"bٽѿl|q1X"$)] P$r 2IU X3?cMEa^%xڽH$@WCp^P@+*:@( 품t'I$b I ;֔v`;Rpn?K"Jr$Db @,;5m" j* (D7QV1 ২aۚF^*[0$Q`]4&wu !D`@"(1oPWE@m4 H$ jo(hxPqP N1pJ^zH$)P zt>j8EQX/ @  H$'}}ׇw$^ERT H@0rH<$/YDOP,Xxc Fc+jw㳟y]L&D`Y\xf$j hOBK)B _8$(b@"LEUx클BUh$AQ;}k{)`Ϗ$(z@"HZxmL>ndPaUy)I5؆4*fj DI?YOR#Xr;ּLK ${P55q (bL ZnO k^nǚD"0 2`m J|TPkMDp)?W4=&8  H$%^8{d,U)P+Nq޿LY!pZFyG'H$;(X:;03µ]\ Za |$ҐjI Hafބ+YvwT 3ˣ>ϷX')6^`̱G>/^BDĔHqFōRavK6\$)T<x"$ĈV">svyAFJAXװMAJp@"0 HU g 7RJ{mk9?_lmC6zH9%HI2`Ŋ:탿96`CyZu2ȓ?|)uE H$Z AK(9U1ʀs݌ڰ%  H$h``Ġ`TLUD  H$*k\LVM"n!8 H$uhYcg$-6WmI$c'"AZlQe<8di&QĀD"e#hhAtq|8=$#uPj6DH$)g*͇N# $4WIJ`N'K>6'@ 1#2HЬA :5FmSm@wWKP6]Z 8cdP$QĀDu-BKPcd=UQ bo=+ф™W:NIk~_<_^؍#w44Su0{fSߝǑ_8-oE]z\ֽލG Xe1#vI 6wjy? @z&"F8g jh`vaE3DQ&~~=$`ZV_PZ Fީ=tUFZuѨv[<>?~"$ @jTg~HX/ndQ [BSz@(,U+qtqS yE , +  WōBb~z$%; o$a( /GQkC[ 1s1 &|+USܞkϨ:o{ %)н{f ;QQ$ĺ./_<_A| W޺6% )yjAkc3@Ȣ?òl_@ C)RDCoS 9wm-9{u4tf$K"t191ȁTEK!JЮAccJQ`T󻶮sS&$^dSSr(U=4zg';zIiI(I]^*6S]fqckzs(bR4R`qDqXXt y%Rv4Ěo@e8EQgpƜE kp&-ZeR.(']o># *fXލpƣԣ`eQ-*.:  $i੦3k|7]|&xg@XUg G)t5(2  $6%Ȑ`*7(V/'_H })*(2hPAncPP5LHUTg!.] _3{$-t4(~dȓ9 .,G< :/ U1*6=n{ Y7&b -dSMU5( '#O;0%@K @^{^8{g:z`盬{6OY5*^'QE Xh+o>Lu[+Su1(Q& p󦑊<ɕڳs8R'BV.7`p( QeS3 .Ƣ??ҳO9d=)?`<DGĀ!8Z0QnDa1Cf8bbq# vA]9 Am}L|;je"JP: q@ئWeA /``idAs-4© ZxwVא>Y[vJ:9?a7 )S߱|8THK#zN8 ǭOw00`y"JPIg)aŽ-p:u컞==B=Tgey"q_ٖ? J N~"k=YvW2KҀE /Qr_\p_@߱ՓvIvH>ii9j`X;=;)잼K4hȇo\{QOcShm"JڱtlJBqکbLoq/ 5UBkO @ 0 6F͢`pJ,*fa|j#9gzs'VIǠ;p pC؍tR*f* 麼P9g;7Aħ)>m~Eo׸z;:]@ C4Ĕfl*fNI2(|R_őp.'=mS {q AQ`yf`aPa7Ddf7U1wE+94 Y7'UFJASh 6jB$ -&)s x sPoYAqp{*fm8W:;?o OC6r1.М%10Y> S3@N/?Rzr ͤFo|cn>G 6#^Ygʎ YjdslK,o钪#нS,Ly7fNA@ ݨW.B.A5K nqu.'L `UR`u^"@,Ge a͓f fbabm'X㕗%AWYojss8O(byb &4\x b{t:;˩^fO=Fk_ v&$UAqqaCqZM~s ´M V!{o')tS)^GE'ⲯò,Djc`b&*P'IB$ +>W=&#媇2T:41”r (`P\50(   ґvIvhYb:fLЦd@আCD}=G_F?~E eJaүbZ Sō'5<<:hDeeܛ1M|E {)\G}mۿw(Q%IPGE~K =bP ̦._&%x̞qp>xpI]\/I= 2AOO Q@A. 臭yca5m #[_aĝ;B׉zUwFS^<4X4s=$O=-O_RUҐAqE\`d0#"|yĄ>p`9%sga&GNg?'^RL{*ySScCziS?Qߕx'2EbSƹxSXIofQ4!>> wIT̹/dzѨ3h"o2Z xޘAe1H?} oFUwmˎ>. 1Duֵ@%1Db0D&7_H`H7*I DS*\/r:uј'bod80O_ e0_$@ FIBeW݉? 1"D Fk=dFbIW  0|Y 1p%GD ͖B̸(6@Y0rm,-pϠT4<} mT[p{)jD W|eWE`< }@]4:4 -a 0̶] P$2`R`00ݾ% r"?xVOny?<2pL[po~ dDUw~ `BƗh P$ąno\ADc+ [-{RK|`z1p/ J+Bp@iCL6ͼە\y5DMD ;= *O :0@iY|TQ,kVSɈAo`dKx)!jǴW|0 -A%0_J IDAT 9UH66.Z|7|* 5> 1,?WW;ȷSWT |PY VM6Ϻ׬A»a.B-LB]'9߈ȯ DQHU5 XDAhP|f`0 O-krB8 xp4`wbo\AŌRK{!e/ ; s >y `+27r5]dVwލ5ȟb>m0!~24V a#@PVĄQA2]^` "ؔ/FO0yaT^׈G H%b[o1r/]ׇ_-c0p y'/,dPTn/!=W@xl~ŋ?e0ΤM%bМoKFTP$)բ(Ԉ*I0  rE:%%O DKuV'߼1yf^Beח1 (DRP^~Dk®1ɉJX.Cϡ`. H5΀?Ox;6 Y&ʪ@(ܕ`p{E0" "2@T5i0o_߇~w 7e W7εA%X*+*(S<\Hxe( o5ʹ |~75EFAMGeGELUvQ\K?/҉_l%L@ x/ k7`>U q~TEo ͔o|68sɋy;*2R:?^e^Li% _&pii$*( SZpX ]`P`5Ec2e"` C(ʗ@ LP1,8lK!cp ! 0FMEgTE*2xmy0wp#\FP .^:X ص(WFLN``.uݰ:;ǂЂE<a ΂`H>Xl%dP$ vVuޓoBa 5ZjAOePd !=5 ڽ/5 b ?_p49d c|z J3k5W`}o ;u\ VBEa+*2q7yQ(`Pl4{q?X'Q\.LpjC-0Ge FO %\ GZ0]׃>^H1 ݋.'Q"I*2;&D JqTXvxņ,F l:k8Rx`n_Bm (_7a0DZ`pќ Y ʃt9ʃpu.B`|pu9߆PA>!Xwag"srؠHRLU2(8U/_ :p,ne xw4 $7I .^8[v,żC4p)ePL +>wL6L/IcOP"z?=`.RJ*(+ KߠIW|GOkeR`8/YNgo WhL $32.Kqr]9연%8|Ѹ` # + @Q\T^s)]Z+ƺvA>ZO?G]…`MtEL8wZkzqN&:`N`, ʖuֹI90(*aAŪo}hm+ w] 1i?UOOަp*._Y4m^ueMGh _ F2,ʖ@4GRyV,Pa y&ʪ oxr-/ ?^2…ȠQ,& L:H *zQyS,YȷSd .%Z:SXD ?`,>0Y+}<o ,oxf :Ӵ Ft?a`0X: Oa_yU!#[`pќr]oD,"dI`0P3ȳC2_7!rNPaʪ@1uv64%h^ bm b*F%^X{WǭOŒv+38y`':# SW$eS9pa~xCy94\vk_wSꃁWb2<ٽo\V ,ƛI^T\үw=Sꆤ̆ L&f͚O $ajuT {Mz/ H5* qj%pl;- W^ڏ'g^ vX4Ӈ:߁ a+N](͆JHR|u;-QI2yQ$U#?T frifP@lL4Ně0Y_jocG=k_(]t0H9/;q+F"Q|3TEP~c:M$;^rIqŇ+3ǹDwǻ%IA|gssXPO-¯0c /K5P mYF_Vha1["X6|;1}N>6Ν@,JEj|q>hnnhnn~qC2g*..ٳ?1$0S@ MY=0` ZYs,&|@0Q(گy`ZL㳕Qu~,žsNw7ISd $%"O!ZURXS6"Hn/B_30֝0mE*n3Id)rC xpD+zNF$Df#Vss#^B(1cʲ5PJS* * x#ь` (XwTGh`t V%Ʀ\yyy5VCB, /N, ܚEOĀF_BAt<.' Baa!f̘Km`Ƶb|(gho*^C&ӇS;KEŌ< jQ -%ԓ&VZd0#]`ꡛY=s(Ƀ@^ڽݱF@`&_=R1sV͇>k9wD?j`5h fFQ1 YF`x0:OlA? % k PX `vQ##r`a2^v )B \HeՐ J_+f܁BS9C#R`bk  VX g%?uK( Y*r1`}WE^S3apHs2X3J`! T8Cv{" Sh4`q]!//3f`Zoe U<4zʨׅz Ƞ|IEA eՐp7K iWE QFB^v@!0H@C X.kLQ%i-nBs<}y!1Q% p\$.56A6.5R@0TŸXzHF> WiDB#E ǐF !KNY(#&¢!~ ? O_MU&"I ޢ3fpWX pѣ[w0X]((b7 Y <8 >ObdPhA0PY\M;s` gI*R*ӏS< P Gaaa+eR=bv)`xH@7Nd<MVC-/T_a%?+Z@FhspC$7wpBW_HQhO.lW= Ġh$.~V&Lf\9rfAEd+_*U]FO`B~/=c1 M5 8"jЛQ} Kq,{ \g , >kݵRPVf".X"A,W")#Xua,|H"2QE .z$dQ^[S-#OXw#ʠH\` (3_,{ԠU0prXxK*Vpnx*u21g1[)U w#@1mPQ 2l^Go0&U~0!Yy?1P^#<=ꂲJUea-#0 A,HrTD#lvm;kL.仹ʠm` bzC-#h$AW|nĢԋt ^ۀf.'+o4nWx W"F \5H]`Ν Dk%OS@ 0`x iA )b;vNaBrPܼ+X*=g IUd!-#Ģt#$zai5_h]]]2'buT.+0TŸXzHsh@t#D,AW* > A=#܀Ua)q#@eMkcf$ -D&H RxTP0ǍHHI F vROt0B&Af#lg$(u yQ)?%$c0TŸz8ft4_i))ƪԢw0Kg`LĠ"8c0rX =@5(MNKeB!l-7jFLF (\R'U劇Ĝ7,^oc6g!@cCci _?gtq@ǀ㡉ኇHsw6AK+!" ?pRBD 3^:X̂;vi?@[j_ j>ۊFG"F?j:}7ٳP&)-SĀ7a۵+G!\ D"QCxhke~?N>@ @wq)pȫ0e@w6ˋ/n| ƍ$P 5zE v~;wn+crk-_P/j^I_-Ƞ G \^^oچ(j0^:XMpW<xbr/ P*2B‘dSX 0QH"lѮT$zVKލpF Lکr©Z00 ܧ5կ !{:Z2IJm|ލGqƣ5YZ:4bTK Tq9Us@S7$xNC{JJ(6xEΫ//%a ɍGI-p1 TE$|9U$iۧ;}zhlPUB[e4S=ֳ@%_*ML$KCu0.'_ 8Ht$A0dr`dQelMDžq9mٴqJvmQe`I%uD=Q9Q0_ G .s\:1+feUd/ϔ89t0SBE):Q%QdAVM`!𩎦_~j 88o@&;kNr?p"@n@A,i/;$DAJw?$K OI@1+%02#0((% ܻs/uu*FVLAD!90(J:?|⹜*) '*ZJHQ 6 8M=8Dߩ-Zؚa%:!oTn5A1p1h` 0} t'Y]%EwO,,7 x"U @Y.NڄOU0)Uኇ 2_ӱ< $Պ^ {R}1 myꄟ arAɈŻYJ0/ 07b sȰ R6s/faҁsDc)-rEzQM"E )}͇DLW=$0P~}/>aEoEž).!z|aeWͮEn(aAbh:R8ضBuKm!^b Ģ2d*TPYs(X.Z+yMU.% v^&V ΀pGǞcEL\{}nT9IvItY5 ,?r/O wlTE! R@g@;쎋]Vo Y*6Rr eP;pe< Eኇ@r$C$&z։%}"Ej.$jaZ%TP{O0,%! o")nsm E;/=kQ M˺l1 Pxw)!S*Z R @U>"נqBS3}aBS(C!TEb>d xL[׍RHFߺSh ^ZZrjuqA1U@| 00voRTw7$Պ8lީۘt .,yhF;EIޠ(CmO$097Yy Mvv%0B W=:H#!Affu@NTPxSqSWR15f;!ܞ]"CKO! jQ"@nK36q :TPx`7qy刁 0r:A`D$8Hj /b0zT NIҧǟ:`FxIĀM0r /R *t=Ok{xm\D8~W/BA'QpEu&3fO F LAk(H/D >Do蜈 /鼬\ v$x4( Pp*T|p#,Y0$b񪇓iٌs({VC6Zs8JMР( P\?抅95E7U#0Yy ;(kk` my|{jϒmJo&JnTh~ NDK bzЪq>E 8{v`K#^P@7G 抅()^ftk F)U?xjp%DbF#b5?֋.ھ-sa|Ah.U1pp r-]lD|KBؽ0HFBC(Yg/_`D h<(:qQéT/&6 8F7QuVQvEVEkFjD y9c2!J@neY,&yS:RE 2U H/D n. YY:3;Ek8E P*bVjD {z +YэLExsM w|V-FK ѥ)'> PdyV'R ED 4ퟣA9e<zQKPf BĽ2Qژf%"0UvJd?brCc`WK㭡U "J?qA+0pF 2ph:QQ@=xlyQq#^VĠRa7ST=P#0S 5!["g.vUt1a2ѠU%BMT|g4 Qq#eǐAQJ۠HiV#܀AA $ԊWD!S1r!rb*?Dk%ЪyѠ5RVʭNtDm @.$Id>X5H 4o(U`OA*ӝ Q+Cv҄EjmQIǪ>]G1I;? K#A11p2 1R%2E֏tЙ ӷ0(*(:x@Ze (TPU':1id0( E )!oT۱˩2YI"E XhvE5J=5( Vd <%Ex Qh=Az\TE<HUp,{ r9HC]IWHsIa4 d7Q9aLP|7Qt7y)(du`ZJHFĬ;n[ok6X yb!JQpÆ1(UN/n ,Cc#,b?g K9 2͊^/<\{J@7}#lj-} yrf#l.%HU:Q+eOv܌';n*J`lTE dDkPtP'f͇ܬ}0+eeD p$IP<}}CMlG JU$0HۨfjQVO:ـɗ2H"< V -L Q|#l} !JIɪ3m0\:[Le(AƙmDRByȿt* eZe;>l!UPCMUxlkNݡ>F$l! =+3(?_{W:Q/o@yA^t4(H) PP"4L¶y/#m@;H]V`Sb±w:az=ӴU5VAk?<~}(#HRSنKVz}-L33ˁ^xƠd5b`884#@VjZBTE)՗yW> u!gPww-~AUAo9c;i';""LoDƛ)UDV4}K7(;Y"Ih,fy\L A$ަZEE7>~=e,@ӣ@"e.l!,7={Ҭ#:B@a6`ȕlG7y hxz#DMo}Uĭ"M+,$d;o~ {:0h$mAtwQONAlIF*WX梏d f߁kCA19D``:bPW4CۻWRz.y̋2HFwQ졽tK 0` ϸ)/G@~i$m/'nc0·{4XX8$nqIHB?V+ivwvwfٙ|g=<_s ˾A'NAQÍ޹0.3G/eٖ:mD${6|o=l `\ Ɗm@Ea꿃P[R jRm6=z ^$5C?Hizo#.@h00ǒ uߏ/ mOb`PAi2 n3WT8kX=2lJgoL60n$J A9`\cJc7(ο $lPlVJ{yԍk-ϡ2RJD~=tb9FCrt~7v|@ [/]ògaP G~.]hWJ[3XI]hzu_Gof+yUBCB*6(X79Mb%hl!䅷<|>.P# "7C oCt~{%Y 1 ޏ^;$%7UTmx ":8^qCѯ/A8_!d?[dk[bG+s{C7!I*&b|FA/D̘|&.; fLlkfu2mo3n&\D 1ўD1_$N8z&m_ji_]}%K;5gX8C;G(?aGz3'ؑ}5a0R'oWd؏ha}̺$-3͂0+F9GDStIgEuFS(MIۉOtk2#/sc.FTm}O1מb|l6|Nŷ>F /]?S{W?wfEKǍ PE`;{ nY&#LNlb0L1}ZoXOg)3fL#va,;g-uymk^8|=G86{<W  8 ԰r?E` =WEh[Fo`%uP 5&0ET0&`T`C}=Xsut%W&D|1ôS2z~t&<.V0ؙx 7!Ga_qJFx ~0}0=`0B V2 ,BKs80g|I7S ZY[^5/B8) AB`XYAo[LaD_oL100DO'؜`r{ 1@%A`0 bAaa+*UaiHkPx?`CnF+lS#xCG~_WC%:@W#X`JV]q>&GoҸmӅ3 k3 0k$Fض?|8Ӻvb$Q.ᵿOF}!ըd᝷/NH!s@٩@s,ǽ (au0K1lljjjQL`w IDAT8͟.bP%Qq`wBgaɓ+9'BLz9R,fsAjDN?!b0+1;(: g~c{>T̾FAg)RLWm̉!͠g:;0Z@% 60fk͆-BD &~ZU71݂ݍ37JG "$=}=bwj@e,E퟇RL"c'!v?7-~DR F߷XP2h ; rKཚpSv0ͱtu#RwljXoD dk\xmzMMM*:!e;B@-A`TŹ(_H J}w{[X!) Jfdv rܗ?PUt`G`.{J` #t?o I`>08sKg EzbKۏZ-%( x}вF `̋v|sS 8#A!pXs5HrU etQ3ѨWo{0p+𧚇 bPПCt'GU"UǞTT^@o}I YݒmTh\u]yq(V?w. O ?9;W|˱/ D(. d2qѭIKP:z+y:ZYxW' s I|-.rlRv*AC*ևguA ,o(EBY=?BA=|e ݲ+u3Kv > y]~s F@lfo5G 7#$CSׇ|oP;ɯZE hAeh;}ݗ Aof úT/5 (Z M84|jCm`PIL=mЍ ';9AR5 t1Go4Nމ8d9j84]R$fR~'.@0xd2=`cMo9AK. PxW| !75HrUet[2STA{;x/AxO9pT1+JR:lQ8j.I7 ;PsL`@剋ne0H zsA evFMcjF@ dW6xO'@PpUt^0e0$S7IUT0!a2ꮇnk RDF32ftj!$zz#nyfY T.i(bRf:ÖYr=8}/A^qR5,^Y\tP dK\܇PׇȺy#7FYI;#,(H sl'Q7mlYz4fI}>DO)kvU4Vjcg]z={ǢG  `3a!f#o0S|gg^3S?Ʈm{3ǤϘqROr037i"\,F:Yy30tM|YRRڒC~ Vzp2%z_TL {Ig=䁙`"0,~&n?\vLFz, ` oݪ:0wlն4CԃwuBw%~ K*b0߳[h~ rXh Fn~_! 2f1{Ysp_)0 f3UG^Ηf ^:`=/UCJ<_:ֶ۩;g z.kG ދ%߬łA^Upc, .̪[#UC f wPRWZ@-S64(AJ`ו?^pݠH`1`0~8 2 ]dk[֋;td?0ANMmttuM 1lqmOË2 }(? 0< vz0fdBm-끷a5` ͪʶrw|D~86{R:=`sԲKTA1% "n"3r+**P؇g%oMk(Z>2ǞoW,J)E |R]7Ƞр/s>oDf]yT9+Z~ΨH`!G+BǟG2*~[lA&4({CtttU)@#N,nAg.J?jeث0u ]kYz3ݲ"`㗶Ata~["Afke2R2|]qpw4%Fų U-oQ4@\u6?m M;5ݲ`㗶܉}̼Q 7xIq4)QNY(4X=o,!.00-((TibYJU` V=[*1U^tL$ -2[PAy{γ–cC 5Q|)(}?zK׃-YM֫LP0>P'~ .ËޮAj esۿ,b+nR/pQۃPw 8RPԦHP/mEf~ i(A{C Q'`>,`Iǡ38P<&zgtuBDG4AzCp11%m bL+A\)c淾zE E!2ͳ^O rvC7f/9 pӂAQQj[6XPpdžN}:B@AC\^ M<*U 7t6еԓ3S4IlқʝyΖmUOuxN:5nwnD'wS47b+cx Dh{уiCW?8:CɠHӇ^;>I}g\FC 5 )N.'  $dP$M?AlD@bv%")hp pJ0ڲm\L"")x?yh0Kvf / > fl;H1f@ȠH.TCxB (|p}K 3]( 1BПy%@|2(ҎL`" "`}/% u"As08;n%[dP$Y5l UUU<:su˽#Կ!urxi?AJDqTݬɠ٪PTwï8i>`{_9IMR׫| ڗ F^+>regȠHB(ALhf`S ZU-T6t` lԡOA?7KrZHUA"kPlIRAFA=@ $.{`u IE zf dV% Zꡃ_{AL XC+Q 1rxsكAQvyq+,5bTEF>#zPjfU-X@DvO0u`ܞq[lB/ޱl0dP$@W :sA0HnP eki ަn@48CBBO iB}E ]$Mq/[{[˲A?se5pw<,9Tr@j[3VmSu$%`FODV#7N}2EzguKJER~A 5(JF4&u R dPT Tf^UO7c9taC!;[0:譾)γ̸A|?B0DQY 6j|'bünZ]1gW h !n\[CV/θN[K+o%" @G( _*\dPLTN8q߷ Ap:ȹ,fyҀpx(UK(X@9ML~\8s0H-[ōZQ C2(J5#P o)Ta^İG rOȹlLߛh<[*('" (Fϧ'1_1P A1y< ˃VHj0y=rn˜x(>Q^WdP$AD!B, x x%jPayp )9z+'0W('f&Y|(^}yw(EyVY~SdP$E7/  ! ,W,yY7ҸȠjF -`X+0ӲDV``*V/v޽z1I %7[ >(+E 'N\+NJ4rH(Xшsj%RRxi)3T?K(nTK=@>Օ)X 2=4t0y>0u Qaw+QPnN[_#b(ɗ>FRIr4X%%%ˠ)=ۓCr*& n&zaan;KRIxΊro o}_'j'_\fq`TEw>̓<XVV,++KA@ec4tAw01}OB}G`]ءFSpʛ՜q-:UPԘ{⧊̞={ډF!jAOF Ͼ2[.MэF8(]~o([_~NytO\`o]+GPhxHfBVt,++kF#2@U'G"UF Q7Wۢ67Zv͇Ξ9{ jg_Y{klB")naܹ1A@ˠ PPߌ{\ډG`(`<̤7t$UE8+Ƙ؟_o ,"O;t $bPPYI:*F'&p^3V=a&՘'}W1c} ;ϊ%e;VbX(F]ru|GqLھxP['7nD‚SӶ9NwǭsϘ؏T}m~aks:]YYȌ}=3q"D϶brFV⤮'Nx!';}qR>Π(l}s H3h4((L|rud :T<^WR_&U1j_]1ʵw~/qޜyWдSEY B(P4`<˪h}cKK[Ƞ0q#N}wȾn^ +v4GGIp\HL=efnHDT<^MC3Hn(Rd>i~oT(+N2(Y{JQPFg,0:Nj+nN0g|2=!i=M/IDAT XOMcPYxSI)IZCLd^ 2(M}o6 R;"p8>hAԋjfCIIIRk$f-`C,AKT #L n86YoA)_J?F:t )BqTzN9h.k@k`HP{CW2&9ʷ[Nm2(N}бo0:86atƱ?2C*JK( 68wN2((̯aFy{!2r~kȇK؉vt5b ԬѲA煅Jڍ@S |g/Ew{!z-}U " *B>T3NZ k1z,f͚BmݤNT@ugC^+HŸwCl+ \9gZ߇gOk@ɖJ_$0P6գS{wze{Fmo-:&#!§!3SgåF嫁㦒!//sQP!,{#݈$* ϪT#[Nf \s%+c ov4. >ckh \8nE(SmT>{u C7b {|<|0DF[}tE28n@PzYdE Lut3R3h-U1'FtB?hb;謹 |@c Ъx>21*}%Հj'CFg t^sS R{Cdq'#38Vi߹~}Je[gX'“CȐ=ӿ)F#JJJTS8Y2K7%K/ik d?v'6 {1FoUi0LT;BJK5ND`^Z2bj9Y  +Dtpz:/GŃp{1\Gj1E п@`  LTP:u'|_QEޯGߊwnm2tR3֋hxn@Z#rFFk6AB7Y ګj5b0 ׊n'Q`MztJ˝#5b( hq2dCE %zĞgfPt- zb Y-z:HpNthA*eYhq2DETZKUf76 dSljhyyGJ g7u"xMM!(C;/(qǦѲƙT QE R/ʧZ3"旟MvEʮ}dY?cf3,cqfcfiqDE R.ZP~@x$à o~R YFxf,q@=UuhjjBqq1xѮ}JQCUY_D| @Nbd<1+]Xf %:gglw'EH;?BF%3HU]d< lDxtlг?rtalx='p"2t5EL A`Y=FO`0a]Aޯu"gkB$ai`HQȢ?YjyR`ꡟ<)hov!fq`V$_6RcP@^x8HԤߒ wli!E R5x"KU=6:ӵa×S @8qF vP",7`\-MΈR^?L)TV'`HQ 6Q#P@>⡓RS&Ums1N*VDSMh@Xaͺg3"Z "ɕԡI)W= BÛ[*fݳFӠHCRRAj@ljxs+ @P, zd0g`rĀ<i ?N+33 ޠ;1(Tx +ޡP iҫa7DD8pZM˟^3O$v{C$ɒY7-t vXM>w}rI~'`HQ<^ C4]bIkØuyEռ"38:T=NcP$YՅ@ @ENU$0fcF׿׿IA238(-(z 5UvA ʩS'W=FP.8敩ʒ쇜Q^ɬ_+`C$Id$  ?ID}N#P+TZf0D0'@RST:A hͦJYQoV1o-wX^3A(Mp;-N%!v;E (b.eP: | }BPgJdGJm݌#/C NQJЁ.{>uL` ׾F X@X 5J-u3 bQ:2b:2 & NRfp mkM[ϗϗQ$+YY(Z@` tV=޼?^{4y OtXjLjжv G~ά̑Ƈ.=Bc.fZ _z?؀ 5[bEXߟ(<#@.e 2Kh@XOI{T5g>m*!fUL3h)UI/DBbQ8F?BP5I ""aᕿFPb5ɖEOO"@-IA- V|i5AICRӮFK׆Ե#Rste$_A+_ΦH XIP@Q VPĀ"J5h|o#/LO!P@"I`ڲ QĀ@j7i(j YCCCiMEhAʔoFH# _OP@p YJ: 0_q%h)UJ_H~y?5I}Xd#uܻmDy&:Hi`) bppPQ$2^P ,{a,;9Գij)Z z\^ͪix({@g8(x PƧ,NKKt5RM*"I`%QC-& MZ_I>,ƇQ7f| - Ú-r:2PccaIENDB`armory-0.92.3/img/arrow_left32.png0000644000000000000000000000242312414772654015424 0ustar rootrootPNG  IHDR szzsRGBbKGD pHYsIIEtIME5 rIDATXkUUks:dAi dF 2BIS, $=iEJQrߑhg=3s ,>87z+)x&uQyj?j|.D 6j\5Sݻo (/J`ܫ̸{ߘ&8x@DkO,q̷loOiٵ%0yYȶU ci/3}s.(m.l[8{Ť>}8u5kLy[9v0 Sz 5̺"dldCz.1S&('!}JoA-)ܷDcTb{V[o}1ƥ1t9yW0 5ybm,^c_mVc"㶛w %yd;̛V]U0D1x ǜ,$xSzV@3!AdÆB .\ `~|W@c=rXyl ðѮ88"Y #]oujDRDQ* MHS]`O$>;so~U}GFXKRMLkk1 սVZPcn*_}DqLEyQ 5޻'\1ʼn5UQOO?O>@֍ʊ8IHke2eXqcM\kVVX06$qLOx9]{T_3G[CV-Ja,;"l^j!gaLGG#I"dYPI"GFo=b! KVivf-L/.+%i`ek$IjD餠ZzaqLo_A| ɤCV-6*˘XIDpH;,\GJd˜Nc3**5(vt۳?vZ9gcjn+<׋HV7@:FtS0Yu*j%Žۗ2g(gd̵8>gjH>#G<{Xλx# q)k'j0( Gz|B'YG,ci;0$c\ݲOO8L,03#c\]Z4;]㫋{=~%I.2:6|#[˝t+Z<^'""rHDJ'>46q&ȰH{-_(+$]+@i$#|]%KDڀ+tv)cզDhmQ e6InPy\YR.H7w=meRuܹ*jf[t2qauB+A[z_Cv> ZZ7 o+k CQIENDB`armory-0.92.3/img/checkmark32_orange.png0000644000000000000000000000262712414772654016551 0ustar rootrootPNG  IHDR szzsRGB pHYs  tIME 0c)IDATXWmLG~v ~ÞՈU41J#(Xi6imMiHmi1ڊQh[z,'qL=N&$O&w}YRG4x/?*.{1LΒ(6WC 1IS&=%Niv6*KqKuiPӜ\GJ}֑@eQ16n OM]mY>+FhL~WdFgQu3eTx+Ǟ4Bc9"Y-*՜sTπP[Ill2*Oe ;K{G5 T9ڤPAB~@AɚFpfGpO(pokD+k{v (>'T_;HɝC\v,8k5)Q{~)])(| xw3@)Tjmp3sHQW$Xw0h]Ѝ 0X 5+ E{qwt.iA?X  =|} }GukB>3iaz&$[Y.A"rZ΃S-akzEa֗MC}SنY5Q %O%HXk3VQ'-[@)nr>r]oeDBRc北hX vC;ym8wa6fٻFr{-$ +gUB`SNN̽n蛟-UXd?n%dE;B;u!P{ 5l9\Tّ_S)-E,W w5*! MO,4N0caU 4.m;pT S[h5EBkg|nD#r^#_^:%,&~ϰotH~UFbC4)ρ(=CVyx궕'FZCxۅ}/O.QC qˉ*rI#\Dy(wUrjaǀ!l?@ulPBhhtC>+s{Δ,-!}x_N[pG2! >>Ƃ~֥muW~6 oѦT6/^d  00݂aVBt + [i_Pn!WAlaoހ k470IENDB`armory-0.92.3/img/armory_logo_white_text_h72.png0000644000000000000000000027004112414772654020373 0ustar rootrootPNG  IHDRFH\4sRGBbKGD pHYs.#.#x?vtIME:5i IDATxq8ZќJY555 QZ$$$ %%%\###Y6 IDAT  8nQP~%;OM!!! Z7= _M yL ;{֖" $?qɋp?"    )17'/5TBDC)))nI IDAT  !#%-3$+2(C 000'5H+ %m000\*G$3 /1cٰ4C _+S %K p#eo***X...%%% +++""" ///888(X+++8Zҝ'4Ink& ['&9] 6l6Cl@,,,?000%R'''juA###1<:# $$$ N...GF~֒U,,,Ee'{wf "1˖8v- 2I6yo!Aa///C r $Lc%%%!I]...111s+E}T.,,,E', ϼ M!Tf H?]G =9///ֹ)S<KqC[ x  IDAT0x,ps jL"ulʶ~&QApJ000A,,p,p jh7% [)D (...6 F---Ȧp(-qd-q  lk@33o* 8...5b)cަMz,,,  {]t_ llH%%%pԄ--- /OD%%%C.q,6- 3/***B*$ڣ'///   Oa I #zO?6###~r{6p|[ $ !DMi{;,()XXX(((_$$$v\000O =w @)))'''c$<,,,9u(((***&&&t)000A3N))))!!!tR4 IDATcS###81C͗@V e B("""s13 >$$$tG111>ʔ6rnz:::cP0."""޸Vry>ɏ26R---g+\ ~+++CA K"A00058#ɍ;w[W~xcv%%%Tc~000>b\ ###޶I~Doj 111  8j///ƊĄ^(Z~WDu@t  $8###r ?             ..._h%J{ c---            ///j I000 Ł}+(_GKZN@s("k |...5###v]...7 /// ytVmf;_Ccr=p:ms= )V Ǒ:ST2~*** IDAT  ON uv---E@2 qlj 9m6jG" X0ҧ### }є 0A7gf 5j4j  /B yX:###96e 4446 )599# 31hJ]$ yǑ89p93###ޯVv7v; @65"D8tĄP>C R###} """pU""".    ### %|y3`*0/Mդ|Ə7:q+++***զp'''@se  $9,,,Ӱ[x9ܝ7$G -b%R̐ .Ad###E###Z6W IDAT;]5"B 8}ʈ 2r|'''m5Yɒ:..%%%܄000<<#?  BJm֞Ls,,,[ g&&&///Y(!?ݡ=/V  ӧiΜ)<e  '''uv)))~...C<%%%$" ^^Be7# Цݺ ,\B  MKݩk///= >///%%%0%%%---(9V"""---+-3Lw     12-s 0h7;T ,,,'''"""    RY,, Ϥcn З*a;444U&pُE&P;mϑvNry IDATI&N%7_M o; ͊̈́UNU(Y'|A ,Ssxь---]'?  4"qڠb)d(q&ICشC555g&Yڕ2* r$@Ҍs E/yAp!!!l&3Q 4+ɞX6bӌY/xkBo IDATr)\ LʞXʞW.ta+0ykCt(v' 1ʝW.uD,0xB5iw'y'w E\̭ʝV/w.va0xA5h]{'{'S(] ;ѱʝUʝUp5h\\555~(}'*;Ֆe ӱٽʝTʜT6g5g\P(R [S ̖gʜSʜS?6f\[;- IDAT~'X Jנzp֠yʜS6f[[ɲנz.dנzʜRʜR6e6e[ZL֟z֟yp֟z5ץ}ʛQʛQ6dZZנzu#נzʛPʛP6dZנyʛO6e6cYs%555ʛN6cYYMM~;IDATʚN6f6bXt%ʚMʚMXXKʚLʚLʙIW՞uIENDB`armory-0.92.3/img/folder.png0000644000000000000000000002705112414772654014372 0ustar rootrootPNG  IHDR\rfbKGDC pHYsIIE vpAgg܊,IDATxk,u>}νs_E3`%!&cHDA0D Ha<!/I `F G AnM@֧@qL NƑc1cf23RΜ{Ϲ;wvUWUt=w=NZ{)%Ou01fa0{ +cX0 aV ǰ`=1fa0{ +cX0 aV ǰ`=1fa0{ +cX0 aV ǰ`=1~޹sC=u?"oK/κo=su?2|楗^ɺo:Q }q^zFݠowwt;w~!9s0EWgիWRJ8}LR?VW2oڗ$ >|_:Oo%~GmGpppP:x=}t6۫&kw;~*?ϞtflK/4 i_SO16or*G>駟Ny ?jc](IS۫>۲;%|QE `Vܐ$Iܴ/ҧ `s&WS}{ow=k}C CЋ(QBdclYnwhnVj_z*n޼L |ӟ}!](RZ%C 6B6X!qvvgynݺe*C ]Jف?NOl|ⶺΫ*t>ӽ\ppk׮Q5Q( ITM9yUlN!ƍ899) iM@BB8Nmt&CqݶY6o:t܃7nPSVLkVVRYDZW:RU+\%clM{Myf5\'?Of "a}ݜhT-E{*x Ny^`5[]kzqTl 2g(Ve\6@zۘq08.{1hvVlH)I (sK˫ʭ;oKݴWq#cܼy<8 4J)!Up]';F}(^im_Nm}ѣGp]ׯ_o~LcD )1ύ5iZ8:@\u}ܺu /_x/2| _a y( 3K`:V`Mۻh2:fwzuldBfUx~/BZu:,?B:/~~fK& f !E!ГKK*vi5վ"A֭[TkT! 5~a/}KI^F!$I zjػZ:fZ``lk"Bl΅%>d G3>v/d<X8(v2s2}ulZ/bhW<Ҭ\'|2:̶ŦUwu~n++L3$Yרc*oU*G@2}?!HmL&xꩧ#u>s=ŷ.\ urcڧhMmkfn{>{4룣#!ᶂt:^njswEx*m(E 0B^:go}M.۬7f-;'xO=Tf-46ǷݿWms?я/# Ksh19HLr@xA&nk߆͛xއk׮5"緵*6A~? S+-s~qU|].@o49c}ܸq7n1(⽘-Z#SM/}YFe'tԌ 1u,Y7m*(Au110AɴvԹu:8qEQaКJ/{4B%Lt_s%P\_gtOuǷq V=d{ `ݲ}b4^VMD6@E10\YWQTy6׬gs c):A+Vf3\zՔN !aN@+PL VPe\<[%k긢/oZ;:x]rtjU !UV P"mm oE`}=ڷ"(S{HHAZ' xU`#?U yLUm&m~#Ud4>eW|?XD\SF#+mSۯ 4m[X5@Vm{m]c>>Νl#6ׅue 4ٶi#h*?` \1* V( À5rU\Su6UuyuؤM X-l6Pj X4 X ?t!}C)>΄!{iIhW@U?X"p]I"rufZ/M]+o+^ zrpuhPSYh/B:8健+W) M(xj䶍u0doExy0@[-?WZsCL.cwC⽻E 4'kl}c4e2A-}?WY}Oև>E)UM6_=d+&}+޺@Rte(4~Fj0[!Gy/gG(M]Ka6#Ka~&u/ !xYZy嚚Z++ bvy )E2Iː56?K^u-XfA'fle\2t{qpLKEOZL>٫ ~nHR"YV [\.+f D,%aS^-88*ïhG^`l)H0J>k3瓭c¤F2?H sc_/ @ n'<(alT#L#O7jyqjNSf(|SyRMN Ի~-[߯js̃ q2\`.?k Ð>:1r,u0-zo92[v*^b_%$Cj TJ6;˷>F~]fy.b/gd0{P]G6eh,:+V6y΢ܒYHν{ej]6c F@YR+fS:`PyAD \gfDZQ 98/Kȑ$( ͦ8??#Э5&t ̦# Ŷ*fB2q(9tp(al.a,p0/Ua0pcj9ct] _Y[0l0NDD?]d-fsEojRrF7av J5|qz{CA#j`g60Y_( l~ @&q]QgAAO\W.n;P`#P7.آLE@Xp~@.@:2pF!S DC,-fQT=f@RMU<8(og4t_1"ә1e-g^SZoM&f9_AY4ٽ^]m<(hB,=`6yDTp:p г`j4MLiRa]G ]0B\W_0H_td0E-x0XTӀG#W& 8Fkq@&\bDrYۼjH`֌=AjthNu?JAV6҃$N8"NA?sGqp=8}AfB/ ZAu `Xu':%0 c7|JxMGQnxpH?~EFd?ӀGJ뺅 `\j4#|l0C#QىrfӀ] ReUH$.&faR;s#=7XX^CPjL 6WJ{ݻ{{V[ HA/Hͥ8iԳ*8/Ѻ!;! RfcLSdMt1Xhuz/6` J$Qe^·opHEQcPmGDxwbY LHc?[~nӻ  \W-UdPveÁ3f}sng8I(JP)}v R,C}BmJ0VLOBbְ”lw yB$ L0q!/LB"WPk8= lC/k}6 : POVD,LDX)OAH'k_Z */kŖـLI@@~>, [ ]9p{,,RC}>En PAb,dHSB+80r  U80NYd=Y03 ^Ȏ@@9,Fl@`:"GY/0~BP`*H L4GYƮۥL&I)t I A AF ̪$@螀gk \c BŠ k B9o ӂ0v"#ӀzrtaN8W+MxR)0&) !X$~bPTFL8\cK"$.XS0 L 0+ A@ep4 X C:aBsAAH U EWBJg5hل<SE:p=_74``fDL*`j_utrB0F1M .@6w.CmRb@Xw ѼgCd.(}8u,sz`Pj @e.wTf^@Ӆ\z5me'!=T=s.я(2νdi?׸(x/BXon]Tk i 0܀ RJf3aX ^ʣR`4?_B&22@P LAL@u*=2.$ ۊG]nYQ3r1r4`oь.j]H|;u4*< G4 @ h'2)3gv*#vB`x1 D`gjqcӀ] zUOJ0oiW++3O8+ `A gR}`.hDTG%1Lx.ҠaZԐ1\8FWJ =3T / @dž4`W|QB [@"B_,@YKts1$}P9Qlx\ n '`9-(ͅ~%J)Ӯg֍PiD1 A 45]j`8qz<#qL(5<;lܿr^@=_P]U&`1_Ѩ8_F5:.:6XY/Rt,@@Y8`aڸo$;q\zBCp-"Bp]|!7׼Q;6t|W]|GEd0@N472"P]ͣW& `\$I8$I(d2Y(j%kꊅGp)u Q `K12w]77 sKL^ (L0N+N(D >=/h [U;eFbMItLj8( =VNNk{_Ċ Av3 ;Eh#Qv0Gl#J(T ݶ3nTـjdP cUga!V.NE8ܐ@*8T` )$A,]b @ĆOٜw2䝔-Րn3ܽ=T8áuHQMY`hN Mwaa8;#Sy(\!DD)(IS>S~^|( l# (Pp TaP`e8nqTG .@ߌ_ N? #H-BW"RfVNZu+>qa}(u]n9 к Іctk'.4Y|+Ys(Ohq&Iu11s]0J)|_LB]oZ<οT@P¯$R=й5X,l@j\@S$^b~$,L{K +"2lOV"s3%H ?hZS` 什?fׄ 锶Q K ([*N *Q3OHd* 4#%P[Cb$d (J>R+++P#Ї[~* }2"l\ aV]#@7܁ZPc,_qlefE|JAogaa>߉Di+D MON"W T*ECO|bBT*ͨ|ToՈ HB*2th=rQh}E%P<r8Ρ^^ĹAq3G/YZ g?)-}ڲ8&OP®oRĸ2,L[s[;ۍcѣ|(.¯9h/%ׅ.n˖aqo5;m m/wCoYTjBڟx}jlc,bOSA-\T`1x  LuP)04\S9%@ZFQ)u]`6) sكfC,$m2ck6Z'%}NO)[0rZ/Ju#Tԑ~ɏ ΒҶ KDQLv?C;GŷU6¯/g PT!,)[Iyl3SrWb+gkL F]}%@YŞK&`cI۠e h/VY6R?|t\g8,mgXDckL. ?|R:p^naGru[U3,|79}! |=7N3x ".O??YCR2g+0)0݌ œ!HB%GWgv<믽)o}w@^*_^^d70w5o<^?B'oz DQ _q o|WOP#KujYzk[<~YVS1;ˍ0ðnRq+A7}NOOϧW'? LˀSسy G5P"(~Ȫ)ַ$I^O[ ?2ӇoBQQd1>a9T~mb:ξ?$wlaֆ/o_|Q$akbh]i.<WX[vxx_OݏƇO11l"ގ.ޛ>x0 $Iݶ6ÂU)`)Ц+G?ã !M0]ղ[w><2AM{t.q$Ǒ(U:I4{ַ_{fnL RsYt rW 'Fu4EE .lMIQѲjF^ v KQئςJ͇Fmn0LȊűoV6,8H)Ead&&xQ*X΁FYpsNlЉ2Xu@Lox֯VfF6c 4P6IA.cVeWu}dY'&7Ԕ1[զ_%#,, ( F,k*NLGZMMDvyM ؘϯ i8WY'6~\֩-P(|֯3̐TYTUߧhPD"(*z tMZZ:uR l* Ld&ˏU*E0+:WYKEP5X1Y0@S/C 7] TY@31f$Bo#}zW-Pm *}=U JOB)' nT]I2c l0@t92 a:1fa0{ +cX0 aV ǰ`=1fa0{ +cX0 aV ǰ`=1fa0{ +cX0 aV ǰ`=1h%tEXtdate:create2010-02-20T23:24:36-07:00q\%tEXtdate:modify2010-01-11T08:57:14-07:00O릆2tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?tEXtSoftwarewww.inkscape.org<tEXtSourceTango Icon LibraryT:tEXtSource_URLhttp://tango.freedesktop.org/Tango_Icon_LibraryȭIENDB`armory-0.92.3/img/folder24.png0000644000000000000000000000161312414772654014534 0ustar rootrootPNG  IHDRw=bKGD pHYsIIEtIME aIDATHݕ=keUϽ7FUh@rL "v6iSD6FA4#(eD8|瞯ZMnnD6}ֳߵuNt_^^ /QQN\pO[p ʕɔǓǒ^T+++! *P؛O#{M[oN]o  3) 3 <Io%555!!!e HԐ )"Ct u)N\q p.\ۙ\+! ҤaǟsM`LS IDATNZn  f[ۚ% մڲvƚL>W0  e([&[a&Z  Ӳӣ\۽JֲJ3  $XZ  Ř۰q۾MIհH9D 3g%Y, ⿌ݴw OG~lG~Ҭa IDATB#W"X   ߹~F}p f F TS ޳sǗE}D|,EzR+}S ط߱p˞-D|/M^n 0G L^E A΁8h :x.'wW IDATɯѼQI$$Qđ{ܾkAy}@|O]q 5#);U^o3&U ި=u!U.O]r%+&  W=<,02 :%J+Ê/N\q  %6#Λ (X7؜ 07l QË/Saq(-8 l /98U'    &M  5 +] 0f <;L IDATڵ "y;h;iƘN\p$8/;'Ȝ$  (: { $H+Xƍ1M[oKH 1  $,$.ٻ )# j .]0 lȎ1{1v? @+  'EAv.SҾʓ{"8r4'J^8 .[ "<  #$A  mBL IDATf8h8gș5F^>Ic0@+!on 67B- ׹" ' ڣ' ._ q˓2˺:B~  4:gϩ+  , b h/:9 72 72 $@t3Z Z*BB .!"r  z׫ IDAT>+3;3;  !&&  F QTF    <P    ky[ O̓3=;,u^ IDAT'ZHG=(C;*!j 6'  d6Z  ll IDATQ?#  !!! 6  q1}6    !!!!!!  {2      """Im ]ʑ1]x IDAT>32 ƌ1 rN"   X    p`- IDATA ̏2 +++L &8 % 777 6Z$ IDAT2C%  o+ ;%   q*ƍ0f #P=#    2L}=8    (rSʐ2~ y IDAT7  +7̒5s3  yP <͒7ޣʎ2>/D6    AFg̓8S%x!J #  GK,'!t'Y  {iV IDAT    YYs%mV ] Qpg ^ Ş   T\XW z+4l`[ y͚g͚  j44 V5jM) _^?777 ȏ1>իV&i E567]]/ "^R IDATܓJ"^    (y_e:\܇[2 /a 1y<~V4xZۊ  BU V͚M  Ruu[YCY0  A 6ݠGAn<YF2 Ȏ1]! 3a 6DS((R IDAT?4$X$X4 9  GV͚M   " M#X"W, 6 A͚M 7% j VmT 3  HH6AңG$  '+<@<S\  B-A5  V6x!.RS+ I IDAT %  1Hu6R* ۠ "QP.  @O9"  |F#ʮ9$_ `Q !{I+bOOdN* aG;9T{* NZ- ɏ1 IDAT{@!C*MM-* -A w 2<P  M"{E1NC 'S @ 9Ux 1 *X@ $N }@gS IDAT 6D`ǫ+ )UH& Ǎ0@ C5RzU*  ; 3p' -   , 9| 7y  4 sB7 2 A$Q  IDAT@*A3  B8Uw#M >C5 5A_Bȫ- "-g ;0צ{@+@88QwU- /l 9 Β~MM"ȼ@>!U)   >)b rԝ IDAT&f~>+A6)dʃԜ%˿u~=EBF   ?=4eŋ2(>,) Äǎ .m3}6Ԛʁ@)N#"* ;FŃsD3֭h )T #I  +kBםԗ*d4 IDATq `m g! ?^"G޻$`9 ݽԫҦ* @ ,ǜ{@sM +!GݾuE>կٵ3j1[Ͷ"@}wK'Ɏ( !F> R6˞T@sM zyP%&! ƒ  2l L͒3Q IDAT?@RvК@2.?@Dž͑@<3  7>hL  'U: A6 +~'Uzت|ܱe( IDAT$>%# :H50m ףo̒2$A%( {3"0k+` ϑ} >)+  |*8~5 ˈΌ)A:-  A>&V/g+ѓ(.=/~  >l IDAT\ +]/g t۪0:30{ o#2l#Iޮzް=Y"V   جR& +,)v*f/>̐3<`"9:.,2$ z   Ț6;<9sp  Y$uex IDAT =s=W֙t9<5<om  #i  {ٝ{;;>?l +lڨ[{цՓ͑4=>>jj  a7Jb@;EBfg  ]-'@\ IDATG33>=-!df" GE0 *(wṁB!DGHb :K/u5̇D=HHk% d A HH9PK^ t.q$K> IDAT_HK;L\\  x JF1ˢK;KLYX  /K $f$L7ULMXU  9Yr]NH:OOU   o&7ˏsk.8 IDATL;QPR  ) c(OUgRSQ  b9߸A߸B *[sYVa9SRQ N4іZ3 5V-ˎ;{&pk$ܭG!&#3q$555555 XWjV IDAT:S9{&_13 '$; 5p$555555<V9}%I2- /% 8p${:R:')O ۧ?#4p$F9W<'J٠C$!7p$k'N IDATWVG "]+؝@ոV}' e ڡ9%"; :X;'%pj0 &$q%AV9'0, $"=t,`V IDAT[V;XYAv= 2X) үXF9Ic-| "_N-wY "-_Nkr A֟yF ėZqmӋJ tp8 ~֟y5֟y-W{ @jÚX?i˜_A֠y뜮 IDATM2:+_!;    ]נz)_ס{*aG֠z'a G E֠z'aٟy٠zR7k;֠zAS IDAT'^٢y*aHL֟y(`ؠy'_ U֠z'^٢{(_c^֟y{(_*taeןyR IDAT(^آ|*`ןy*`"wןy)^ע{-iۣ|*a֟y*a_|h֟y*a)a*a)aJt IDAT=O IDAT=O IDAT{     l IDAT  0?s fL8 !,& wBw6]cW[=],=lG @B$   -2Q6:b< Z%?+or<cBZX +x"` IDATvVs3 Z ;+I PQQJ4h3f9*E Yf\6g=Se\ f #K$/35Bu(;~F2Z0 pW E!Q E _}G IDAT-}&SSSZ ru{ 'M ,0dH]pEz<5NB y?') pqBSsw \[HV-5 +?l>NaV *8'N>.B    #3vo+mV> IDATqYl%D6$ 8I\ d   44>  5E k^&jHBkE?E `%2?6D)v#N `xUxAo|cE q"{H\Q}g+GA9'7?! l};k{&_j IDAT^ g+R  c:t(\,8:=&R%]?3lN^ 9N] k FA27;>U<5 *$@P4( IDAT!O @FK ?>,a9:>K/IKP'h;KA 2T#nLwZ5 GbU.PA,| A@DW*^g)e&P *N~M o IDATl1B L)KZ{_] Jgx; [b~w6%)%ch/8>pwiR~C JPy9Er b : PJAX IDAT: U @ iFE9S6@ ii /v& 08h o] #mD(5DE?o *4h  R i+5N IDAT;$@{L5P]i'  rC&a3%SBJ$@M  )a- YY=%zg d IU~ 8[[ IDAT76KA U+ N,cc5<X<W^<O~_~F<F IDAT(@K#T#rh C>*W*(Wjx! IDATuJ0hS1  lKQ@$> JG8 , 06$ 6;" 3+%#Nk^ IDAT{LB0 IDATqb IDAT  ) IDAT=O IDAT{acp IDAT=O IDAT=O IDAT=OQIDATuIENDB`armory-0.92.3/img/button-purple.png0000644000000000000000000004562112414772654015742 0ustar rootrootPNG  IHDR\rfgAMA asRGB cHRMz&u0`:pQ<bKGDC pHYs   vpAgg܊I>IDATxy%YU=7"ޒ{Kwu[u74 6ЍlOg~eGYAD n8Ot@P@f_^ګ*Es~{YYY/^fVeVfVo}"3xs9\@ վr<ӾzA(q ڷXAXg|[FӾ>؁`(bf&#A\F8ia>EU~=,W H\hDy6r(Xۈ_PB}xӟB@]baf`8r'F - ڛҲfVGm@q쨐W,,5hpשk+';V ~ށG1 #P㓥hIHf'ÒD@ I[n__)d@jAm"D8d-y;FR?2WmXe斶B~!1c͸Ul6*+W3&13X7AwީuȤ%@cyj_fm=D{ ?ߗcKH)~.8J:ݲO_;øǓ'&ם}༲uݼp"$!egޓ\ w8y{(җ`ܓpBõ>g``,whJm_L!`1Ѓx'8CT(q%v/]/n)S?jӜZ޻[J8}aH(KB,l~6~(Sd dFj^LR!nNjh~J,f,9Jeʃ}(V)V P#I%jR"*'>;g>?-a%`uYEkqjnМӘ1>C}l Y_Za=IU.vmbL|v><0f'ߵ> g&nX;JPj=?&?K^jznl1"[i1 $__nI1Kvrrdbz4,cq? !Cr/Weዷǰm~[eEA>\͔I:ʱe S9;&\mb7BxMOG~ؚg"j :US8钸7IPbW^\):z#:Yr.ܹ폽{/bhr|j՗ul1q(Ogh0"vat冗K`֭}]+pB6cRnrtbK(ƨp?YkՓ2#lg/g; 5A A3O9;e FgH,67fͮbjj-{ 0%\[W9 JԩQRbI܏Νwztkuo_]26]Z}?3|c!mr%])s•n;R>B qM_mzDk.pmĘ9Eou&ٕoz4@n1G8i9q*x\ԽoqğgraOkM<¡o=:BEH?D;؍,~Xk#?FBɮ@=Y ໼]PQbw9w [}(ukvsSbDIfzi+zq[sù"( (qdQ P3z6*j4h(ֹo`]+uWˉWH)ڴnyЏrc]33\]\l|'Q9 =ZD}8{x>]AgTyl=n1nQZ5?R?f1[ljCV|_gG%X#NbD/XL* [I|@ O˶k.4P @kα;7gn6qua.jH`-_L2{E:c`]* d~˕PwÌYm^-]L)T2~+A^Gn{C߼dm^&bNGH?F톉)03mj+{Ou8Xw ໼j4XR_XQZe` 鲝\ky{f{ ?=ji) ܀..ۥ 4M1#{i{R\i?0H {̱ l^Pej1,Յ,NZj*nx YkF|7cPqQZW_//ڷr?Fq/qqDxڻt \ܵ0stM3ej8*4$N|k%:&y i+Go8G?O*%.jv<2\?l]C.M\(V7N2:˜J w8j{T0{ގ$D 7րXumD!?*IՎHOOp {ڙ}}kK{a! 5YbJ`ѳƼ>{Շw'ѩR2cܖޖYޘUT~{noU-Yd]')_\?nwT1auq r @$;1_`t5Ãd=/Wu1<6as֝7,GT R&5x;Á J%xif{%7άP`U7x"V)E?Nv *Z`mZjڎ-n@iAjG'ȺXcs û ؗgKYWA|7Ĉ/V6>=JP_3k 1Rp_H>$ LUJ%<֔#jW?ϳ%!n9$.z|ƽ(uK {̮'_Aᵱz$(!\t^Bukq?c I_JMor }9r>OHؽU<^:E)cSdL m+xMDw68;7}9{W),\]+j g=z y|7!E"@\-9+2Cuπ,ѽ_NJ3:ߏ}ۆؽ+#lz7G Ϝ2c-8WDۊ&wR&v? F""om.~˕g!#6E&1ۮ q*Ӎ3BAJLĠdļ3j2[n朸[bGtzU43wп}dez@Kb6_}Ӵg,AGta_ĉr"Hxw$J_R$Q=$M*b^w M9Z0!CQa׳H ~??+v˦kQ$;!uzQ?f潻>Y],BcH4NN4NjQ,wݼK?ٟ-\ef'qEZGlmF"Myy/[)B.?s4.|Z$<N0㗻qub|WQ%rQRn~q&u6MTJN%l +f+%ZSuZ3‚ ("Tz FLqb^~/Wx- d8y$Ž1ΈK IT}^XB.;=u >:f3HRJⶐ0,0~yӁM0'bLk-[B!!+?X p I@+Ԭ}S#*%TjˊY"H}?͋J~ M-RHL4tT+BTH?3311"B+m(q|@l.€ (+Qfz%[! uYY5F|L,aی/+K=+ hU$UO 7X\)t) 8;Bw$.r?%p~NXv`R-ͬ8a)dX%8[%0X$ Ed(@J,/O=^)oxV09!* (1i +{$ӧ3E_R-d[u ,-mɯ@`'DxQ~[F'?X꧁E_ ~>Fni>GEXsW/kp>c q K3=!(sEPg-WNr!rKY+&P1TMOVk[EVOmNH 5EsldBip)TQ-س:>KT^FT%z.MMe__hP6"{ }:/rع j)b"rjl\!Tj)W I+ya gȾ J^~oocϪg s5҉o4-EkP͔YFxJQ@NH$6 \P[IVdV2o0.H9\"\9&rVSx Χ0jWj-|3Eٙ֊nf[j Tp;UYcɳwg[`"""'[wzG^ =Ǯ"Hu+>kv䦣*I=pI>-|ìY#%kz[[TO]Z05ZuZ3l +Ñx֮R pj'h2 j\tTӵXR;d?A5#OQE3of[S߽`F~F]2<v<1~<7. X4*H##wDbd3-N ARG֢ VLf̎5<&m |+4tk3O{KofKBౡȹ' ekސÐzf;\ цxv2 3= `qY;UPui+j4=tr2-A"ye '}PvbvEѣQ !̰[_oN{HpQ4f\!N*O)Tgm:3VF6;Y3ayU =sk ߖĢfא,EF"^7\dY۠&3s4\K *v1)_L=H0RV`6ud*˘d )w=(ȣ:9g(Seʻ̼.Y7u6pYt6}&R1W|G NP)%fu}l*%dtřٕ/xӮvb+*qǷWI=1nKdN 3 \{Tv dpl[g(vٶEy0]s_?CC9@`-ay^|{^&. xe4N>sa`H_9?i @L0+H05̙Ŝi `KD&ݣ֞-p24ǩZŧa C0NWAh??o@ׁ &@2BTꝗyH̬P0s+uàl^^P=*?X,Xf&EnC9@`mShqeC_WzNA-C"[@`һ1S#P@`˃zaڙDK X `+]K@` rZy @ԌQB XXfd h:IPc؝)L $ VezefN~)B1@`=z*35zO3h)[`O@ ]`Uo4lj!=:}W`f:IN[$>?Z~U;5* X{tbO>X:@?e'|`>~#kr\>L0̺]t0>3̛;i{w3dV6@( ESe4)@@ X`*p N_)A8hg!)Z0W|aVnؑ/6!2?hKtN҂Ef~ ͏ɢCikP 35]@Jk|`;t 8TP`V@ Xhoᠧa50?" b73T3c3eS z,|.ﺩ49t?y?vllkBy@`mX[& (ء3rg"rP:"yvg#!W}k+L3; 4C= `?1<*Fk)po]A-.8GiYϥ<'͸[ w)<ݪzbIb@`H͓cw_xN|0 gl) +@ 7*ypY^58ߩ' <fhZqk̾>u {Pש' yBMWzx=lߩU ;"a [V|ST_+D|D>c>0HTFP p0niaC +^hie3IDа=9($+M2m 0c˰~A [5̍3 IFJVh_ kQsy2R0 0f0 VØfa/h]3H_I#TS<%Y!Y>7SQ,*AgQulfzoQ  Vfhea]`<c.J+mtr-=3̼~Ea?d)YEl>v08YlcVÉwN>bZf ,3M˘&2#-KR1 %c^ Z=,{3{А#Ȓ-I2D;4YA:~՝&a ۅex&Qi濐b?,FgYr>&nz/uqtFjp'OyښlLZ)uS %.Y`;KBu붏:R% &C:3:T3LK_ k_t1ߛZ($8c-Y"5Gw󟚪fYv gc8?>I1(%QƬ^ __?8+s2UæI:e %la[ۤ5uIULw]s1GdQr\C< aP*a%@` dxFm^QG~RF>a4- ޱ♰FOeC ]AR3kGOqܦ qXF,XϨM,ߋ߂;s=Ֆv@`rfǢM1;(Sc)d! @c:ծ]f :gz>]MMao5la[a)=kjap,k,[݅ 1FuA>Tn2j3^coRD׽n 6r‚,MNkvJyeQ&SN3Eӂ N 'lO\@4c:S(7y}8/e%?֏$Sn0 evPde[5XԬ>+.^OhTB/qo/yS)XN b҉&)~Xf&> 0Pg1fjyaI1~}y5GT"NnB/(-욂u-lgssvOʓ6|[y {ٍrgzY3قV瀎` P؜y2]0S_;9'tCM~_/](/qenh.%Xsqxkxjh?!m %μij!Gdy:UkӼ 2N^e:Af .`ZGvh}krG[Њ]ϊJۧǏFq9}F\ @D1e~6}^ӊ=濆B1Y18U)@Np@&{>w+~M祫M^tIu v3"\pjQP4/2[+~met.I="➍-Exlr}XP}(S칯zK}L[r}mJURW^{{Rgx¶7<^O;uk^S'O-+ˆkO^3la[19=}2}\D-rO+b F$7%n3!2XO(zq=;~T 8s{6Ag xtjN 1auRbH 8珑guS{=v>vޯsÀݘNL[}[dӣ$Mr@`U8jSܫH{daCmUUqx{ͨߏęf_l`FmCLXJwOV[?kowhz^Zʋ1xD$~j} *EUMq?Ĥ5z iE3~1"|b/}5:ǾUѱV6c6mMp?6S3C{2V)a<u5{&NL1J m%78wE-s{]L6>tXA֔Uxb< m._C6M"R-KCȗzPOp?Dtaziɻo}I~Qsѻ]%"t۸*N(, 4'AޡyZ Yn9 gse}2cw#< ';&u4I$kXA:Fj|A=G510̿?ƻ֨5^(-$ɍs/{R~kwL:0`ʚ0(i0:w~Nbxu&rſ,^ cO.+T`Q\@`A:1ξbbf_-Ujڷhּ0r% ki2$*b& /455>`UkǗgocѬ+ y!Dܯ89q,<.n7aWp#-J\*=j t)kr&L2%YMX^nA {ցX!b`\jbotQ.r :7ȵ.vavw£,vPǹN-z瘽ˉ;hf"̷6`x/aC"%r.^ g-FE.w[*ΰT۱@:<'h=hg>b~6u+₲{'0I4v]=y@qNaR& Âu/u~W9Y7z!GCw .F\"y1^ñ qu |s@rLж꟪*LyO=۶ y/m%{9bebvv X)G84eo?;\#usuv1qnhG0RbUn;[@[U 1~=~nE >k+#>ڷ\ qbF_vqfvzm2n=4tz-\c.f/=#<;VV cqWs^,Aء#UI6q67@*8oHg:z:N9/3T~@տ/>XϚe(p3A 1ыD/.~@{>a.s[ S!A VN6,堎rD'hp5Oy@p iRZҢlGEg%rZQ"f1n CR ÃecOZ:#$'lt νfoTDQc \[=lH4G8@e SW!rĹK-pRan21.XKFIadqHǙ&-]0UfW^~Z0@08zq qB\!FJ{=C;m[ʸ8b<'-2ßOFSO(37j\n8 YH!QSmg" [ndaW,`nO1uGt6CR,z{ zUZ`Z^3ЅDDdX5虈ܖ9^J(ۍM$KA݅)A6cZ mC:>+4,jL܈ br@sU/3$rAyKCЍuP&aPlr}*$T$&nOX#e4ڡC 5ip{y!_'5U{j7Ś$(EZO$P3ιs{ŝ׶]M&c}pAW2臨'Ƙ&A ?uN=Ob#Q 1TX$Yp^,N^*=aYN $T2ReD }RBL"1%y".F)ahIFZLX 3nufIX~983cTo32C}&»\p!~S3#xN^$=9YZr.<OJm%P* }RZYbJĹji[iG<ݒ9(ۂ޴:)5kR5R eZԬ5g֤;2ZjfT}<0p5=!^LPͼ]S]&N^\S@.5`1RȕCpmfAB4_~f?+>~n[YGWlf`u>iƿ*pBT4HPx F#m[ yy8y\m8\ vz$bvSg ]̼JDDŽg;nBdD$y˅vS}c՘hrݫ}A裕GQ̗' \*=I$r8f0n^6|^S`勎?:Z! {|x/dc=u/"*[AwD"w5`{MRc6HA` ZN7g;,#0=W7YH1vҳ򻡗_uXcܺÓB\vHqva -QM F?P|-2RUs2 h!|cJ3?n0*aDM EZ-f?Iלw 8ko?R$̙&c"8wG6(UVb" IŮ,fZedM !XS˴y{Da!F <%eTc6/P GI{jr` `FtEXtSourceWPCliparta$tEXtSource_URLhttp://www.wpclipart.com/4IENDB`armory-0.92.3/img/checkmark32_blue.png0000644000000000000000000000266212414772654016224 0ustar rootrootPNG  IHDR szzsRGB pHYs  tIME  .DIDATXWmPTU~+ !(ƤBɘ6' MKґjJ-#& uPD*AZ>]`cqw]kݽ{= \V0gk}`VWn|ͣ憋iAk~GMq8_h\QiOFp)R6;1&HDtNQVr΄aՙgsGq3|}`QSnq>uՂ;Rc"AЌ!p>]ǶWZz46{FP>3 ԩuCw! X;գmB{7hL[6?ZzFk:C!+2 ϊ%<1&*! K'A\P̒oS>oWHBB㊄hyocnDf<;_+oM]zmX{cK!p.LZr?!ؙZeڙ47*uhp2഑az{`Qecux8@1Knל(vTΐ0G.Nu{LSz ʼnᵄin{reASgbxÑoϖ`:)W SZH5mcI`01BfclT(]1gB^ 辣a)Z*ժHDYk64D\V7{,1wX׸UIᣦ]qD --*W;' Vڕu!^$,}̙q`gQ4 K2_7^\&%Z ߼y~RXDA!|cV0czuLn©s/Lx04~X MZcCӺ=[=PE`" ,'uGժĤ3ѡ3*Wi+ ϷB oR~ o|I] \_y00nn/=@ } a0 ~N=17SIENDB`armory-0.92.3/img/conf4t.png0000644000000000000000000000077212414772654014315 0ustar rootrootPNG  IHDR$&9sRGBbKGD pHYs  tIME ijFHzIDATXNP?ZTb0H"q >k.\pcVDw-]/RL䴙td \bc<ŌiS i#PҌ.i%r\$W2A;y_Ցkc?UI \B}֪5ZQ*C2=C#^)L#:x:b u*+ 6LY9c`CΟ'厰. L)xA~ETр0.c\ OY"{IENDB`armory-0.92.3/img/armory_logo_h48.png0000644000000000000000000012167412414772654016141 0ustar rootrootPNG  IHDR0<sRGBbKGD pHYs.#.#x?vtIME  :B IDATx555/8U0!!!###E)***  w***,,,$$$9$$$Jv)J  -XDO<P  ***1<K### %%%6 ̩ ### ܌$$$&T \S+k4 IDAT+++վd  D***?  444c @@@ H%%%P KF%%%*5 /[Z1/8 msE***֝'''5g.Izٽ)))&> VC(((}Q(((Q"""v PIy %%%###s###'''h%%%+<HNMه'''M#SUUUK !!!OP܈$&&&Bj%%%<"PΧl2_@lʐ4we#VVVt ͓3&&&I'''4 ޾"""-;34-;;;5svvv$$$6 3"V1`I5^$/E͕9;ti*!e"\p&AAA^>'''X/VH'''-`edd### 5 8 5 ʟ[0=̗B&4fw]T%*** ....x((('''1վޢl b&'''\(ǗS5aʞT/.͙GS5] >WٽRy(Ef%%)))QG*Z,,,8!!!<x:)))CCC+++UDO W[˟X̛R˛L7V*- BP^ %J." l&&& +++!!!5!!!-###$ UUQ HY! Kt ʐ0+++OBd,,,G!-!!!--- 1"""YM7( ?7Py.QN̐%%%%"z IDATm///d&&&6e LLL!!!PPܿ%%%A>]_ : 8߹ +++@V3444444443^B[  X_X;     Iݴ̉&\ $$$,,,&&&an"""###O+++w e$ϣquu߻ B'a⸹***I@pkm***$"""(@  -  dzm'شծМٯ 1l " 46}M)))***֟*** R %%%ۻ'''T,,,4///?-5+++RPb ?L :dŖݽ (]1+̒3***+++(((---+++&&&&&&)))+++)))******,,,)))'''=>R $  n&A ߷y="UΒ5=xj , b1V.z)7$̦i:k#H#̦i@>A:< [[)(555e{. IDAT! ?DHLf>r%W&(|;=O+olKѷ4444)333<S)Ae .&]u/:V;,@iz~⫋V9XD٢}w *a~kh֟{)`נz)`%\)_)`1JIDAT%io@IENDB`armory-0.92.3/img/conf5t.png0000644000000000000000000000103412414772654014306 0ustar rootrootPNG  IHDR$&9sRGBbKGD pHYs  tIME lJIDATXMKQ&DDD,EAˈB\ AT( 3(>LMWD# Ý{`8Kcm .1_.DT#O=Ve$?<}u(d2I;dQ6_S-@Mix:eS$W)"QnX40]G4H1]EqIRUnX\J%8?uQ5)@@wlj>8;NʈZQ o&q٤.Z }Zr&z|9I"g=ne؇’lobg3Mۗ 9'ȡB8"QBA0RnojϲaXаdshij\/ %m000\* 1$3 /1cٰ4C _+S %K peo#***X...%%% +++""" ///888(X+++8Zҝ$1FnJ/:vX*&9] 6l6Cl@,,,?000%R'''juA###1<:# $$$ N...GF~֒U,,,EE5  'V "1˖8v-2 I6yo!Aa///C r $Lc%%%!I]...111s+E}T.,,,E'z;΃Xϼ M!Tf H?]G =9///ֹ)S<KqC+*e%O IDATE?s jL"ulʶ~&QApJ000'v]=,o jh7% [)D (...6 F---Ȧp 1,pd,p  lk@33o* 8...5b)cަMz,,, - {]t_ llH%%%pԄ--- /OD%%%C.q,6- 3/***B*$ڣ'///   Oa I #zO?6###~r{6p|[ $ !DMi{;,()XXX(((_$$$v\000O  =w @)))'''c$<,,,9u(((***&&&t)000A3N))))!!!tA8 IDATcS###81Ct@V e B("""s13 >$$$tG111>#rLnz:::cP0."""޸Vry>ɏ26R---g+\ ~+++CA K"A00053ˏ8t[~Wxcv%%%Tc~000>b\ ###޶I~Doj 111  8j///ƊĄ^(~ Ct?s WDu@t $8###r ?             ..._h%J{ c---            ///j I000 Ƃ}+(ZN@s("k |...5###v]...7 /// ytVm;crs=p:m= )V Ǒ:ST2~*** IDAT  ON uv---E@= 2rnkq G9m6j" X0ҧ### }є 0A6ff 5j  /B yX:###96e 4446 )79i59# 3J$ yǑ89p93###ޯVv7v; @8g65"D8tĄP>C R###} """pU""".    ### %|y1^*0/Mդ|Ə7:q+++***զp'''@se  $9,,,Ӱ[x/k97$G -b%R̐ .Ad###E###Zp%I IDAT1]l;5"B 8}ʈ 2r|'''m5Yɒ:..%%%܄000/0#<<?  BJm֞Ls,,,[ g&&&///Y(!).?=-T  ӧiΜ)<ee  '''uv)))~...C<%%%$#^^)ev Цݺ ,\B  MKݩ 9ݩk///= >///%%%0%%%---(9V"""---+-3>Yt     12-s 0h7;T ,,,'''"""    RY,, Ƞ2X-З*a;444U&pُE'P; Ʌ61ϑv3B[ IDATJ(O'7_g}n5͊̈́ UNU)Y'|h ,Ssxьь---]'  *\4"qڠqڠa)e)q ([(Z&ICǕشC555i)Yؕ2 r$444s E/yAp!!!n(o'3R#)́1/x/xBD46f IDATq)\A _a+k0yCt(v(9#D,0xB5ix(z(w4/f̭a/w.v0xA5h] |( |(S(*FQѱʝUʝUp5h\\555 ~(*: f+   ʝT6d6g\q$$$$PY'Z5RZS ̖gʜSʜS?6f\[x IDAT(& -ZנzʜS6d6f[r%Ȣ.dנzʜRʜR6e6e[ZL֟z֟yp5֟zץ}ʛQʛQ6dZZנzuu)` נzʛP6e6dZs%###נyʛO6e6cYs%555ʛN6cYYMMȞvIDATʚN6f6bXt%ʚMʚMXXKʚLʚLʙIWh,}IENDB`armory-0.92.3/img/conf2t.png0000644000000000000000000001302112414772654014302 0ustar rootrootPNG  IHDR$&9sRGBbKGD pHYs  tIME .#GiIDATX yT**Thh! ]2 .2:-/ (0<OO{rP ŪrHЛi+=-)e0,) +)@,1!&!r\! IENDB`armory-0.92.3/img/armory48x48.ico0000644000000000000000000002267612414772654015146 0ustar rootroot00 %(0` a*a*a*a*a*a* a*Ta*a*<a*sV3`*Ga*a*a*a*a*~a*a*yY0a)`)`*a*a*a*a*a*a*<<ߘfޕdޔaܑ^ۏ\]555555555555555555 555== =a=<;<<<<<;;<C/Zg5iޕdޔaܑ^ۏ\z܏[555555 555555555555555555>555>; =R===<;<<<;;;EUfff4ܓbޖeޔaܑ^ۏ\555555h555555555555555555555555w555 D:5>>K=<===<;<<;:CVagfffT؍Zߖeޔaܑ^ۏ\555g555555555555555555555555555445-14'4$??>>ɴ=><===<;<;<Rbeefef^fևOߖfޔaܑ^ߑ]OC:I444555555555555555555555555555344/34sM6m5=? ?ԁ>=>><===<;<Jaddeefe+ccK̀Nߗfޔaݒ^zR?:7444555555555555555555444444975XD6j9t9p6@?g>>>=>><=<<>GXbbcdedba^r^0c5zIfޔaݒ^UJ@9444555555555555444134765[F8bv;s9p6`@Z?>?>=>><<<GT]``bcddbovVFY3^7c6uDߖeޔaݑ^ʆXQD;134555555555344.14VD8d?wB{Aw>u;s9r6o3&@F?>?>=>><APW[]_`bcddyT=U8֍Y8^8c6rAܓaޔaܑ^ڎ[nLJ@9.13344024=96eB|G}E{Cy@w>v;t8]5@?>?>=>>HRVX[]_`bc/}T9 V9Y8^8c6o>ڏ^ޔaܑ^ۏ\ݏZXvMgN=}Y@ՂL؂KH}E{Cz@u=d9VB6Y9x;-@?>?>>AINRUX[]^`ecc|T9V9Y8^8c6l:׌[ޔaܑ^ۏ\ۍYٌW݋USމP׃MՁJH~F{Ch=}T9U;u?y>t;N@ ?>?>>DINRUX[\^bxQ9W9qY8^8c6i7ՉWޔaܑ^ۏ\ۍYڌWىT؇RׅO׃MւJ܂HoBlM9G=6nB|Cy@v=t;p@ ?>?>>DINRUX[\.W9TY8^8c6f4ӇTޔaܑ^ۏ\ۍYڌWىT؇RׅOփMIyT==85444>96uC|By@v=t;s9@?>?>>CINRUXY\W9AY8^8c6e3ЂNݓaܑ^ۏ\ۍYڌWىT؇RׅON=95034445555<85nB|Cy@v=t;A?p>?>=CINRVWf6W9Z8^7c6f4}Hݓ`ܑ^ۏ\ۍYڌWىT؇R׆P8344555555555:75f@}Cy@v=t;q6?S>?>=BINRUV6Yd6h6e6.tQ;^6ec6f4xBݒ_ܑ^ۏ\ۍYڌWىTE؆R555}555555555865]>}Cy@v=t;r7 >@??>=AINRUV Wc5d6]f6g5h4 c5)f4r<ܑ^ܑ^ۏ\ێZKڋW وS555O555555555655~V<~Cy@v=t;r82?/??>=@INRUV^7`7b6.c6Ưd5f6h5i4j5%e0n7ܑ^ܑ^ԃR888'555444444444mN:}Cy@v=t:r8D???>=?INRUV"^70`6b7c6d5f6h5i4j5l4^n%v9ܑ^ܐ]VVVUUUuIII888444444cI9zBy@v=t:r8X? ?ڽ?>=>INRVVU\8]7^6`7b7c6d5f6h5i4j5l4m3q7ޔaVVVVVVVVVVVVOOO<<<233YE8vAy@v=t:r8wq5?ګ?>==HNRVWZ-j[8]8^7`7b7c6d5f6h5i4j4n6t:u;AVVVVVVUUUVVVVVVUUUCCCN?6r@y@v=t:r7q6??َ?>==GNRV$WZ1[8]8^7`7b7c6d5f5h5k6u=x?v=t;VVVVCUUUVVVVVVVVVUUUUVV]RKoAy@v=t:r7q6 ?m?>==ENRUXZ1[7]8^7`7b7c6d5i8s>{CzBx?v=t;us8555CCCUUUVVVUUUVVVVVVVVVUUVyaQyDy@v=t:r7q6?L?>==CNRUXZH[6]8^7`6a6e7t@|FG|DzBx?v=t;s9555555444I555AAATTTVVVUUUVVVVVUXVUrI|By@v=t:r7r6?+>>==ANRUXeZn[3]8^6_6m@рKՁKրI~G|DzBx?v=t:s9 555(555555444555999PPPWWWUUUTUV}bQ~E{By@v=t:r7p5*.D ?==>NRUXGZ[0^8e<~LڈRׄNւLՀI~G|DzBx?v=t:۵i8555555555555555555555444444IIITUUVVV|I}E{By@v=t:r7p5Tn[O'pT>^MN$B>=MRUX[Yxe9xKۋVډT׆QׄNւLՀI~G|DzBx?v=v:J=5545555555555555555555555444024CCClN؁H}E{By@v=t:r7p5er^Pr^PqZImRCHHn>J RGS^QzIԉX܎YڋV؈S׆Q܇O߆M݄JG|DzBx?v=x:L>5444555555555555555555344.13YG:iEҀJH}E{By@v=t;r7ep5q^Pr^Pr]NsUBlOG?MwVItN׎\ܐ]ێ[یXڋV؈SڇQfEJ>8}V>uDEzBx?v=w:hI6344555555555555444/23@:7lIԃOׄNւKH}E{By@v=s9 p5r^Pr^Pr]Or^Pq^QtXGc@ь^cݓ`ܐ]ێ[یXڋV؈SUA.13444134134ZF8vAx?v=v:T6134555555444555@;7^FيUۉT׆QׄNւKH}E{By@уJu<r^P`r^Pr^Pr]On\OŌbfޔbݓ`ܐ]ێ[ڌXڋVr444555555444&.3o?y?v=v:_7034444/13E>9vYDÁVZڋV؈S׆QׄNւKH}FLy@r^Pr^P+r^Pr^Po\O}\fޔbݓ`ܐ]ێ[qڍX555p555555555,14c=y?v=u:i7-24665{]HW_ސ\ڍYڋV؈S׆QׄNւKSH |Er^Pr^Pr^Pr^Pmp]OsXfޔbݓ`ܐ]ۍZ555U555555555.24W;z@v=t:s8987\ܔdޔaܑ^ۏ\ۍYڋV؈S׆Qd׃M ՀIr^Pr^Pn\O-jTgޕc%ݹݑ^555:555555555034hK9z@v=t:t8QA7Ɖ_eޔaܑ^ۏ\ڍYڋV؇Rؕ`؅Pr^P555 555555555234N@6{@v=t:t8jJ8|Yeޔaܑ^ۏ\ڍZ2ىT~dRߘf555555555555444455{?v=t:s8S7nRfޔaܑ^Bۏ\555.555555445.24r>v=t:r8f6͂dNiKݓa ܐ]555555555555/24ght:p6555xR9@?x0????@??armory-0.92.3/img/circle_green.png0000644000000000000000000011616312414772654015543 0ustar rootrootPNG  IHDR\rfgAMA asRGB cHRMz&u0`:pQ<bKGDC pHYs   vpAgg܊IDATxeq߽mGVUY; Ab!A@zH E =6-P5f3-$HHْ4H BKVݷDDfefQ[{/ǏK<?%nAi@P#@5 Qf f`x=HNVHAh #a_%>7Ľw]TUC@ @ Ah`B@ @I/ZxBof@#&𛀑0H,B]%`F00%5Z?%^bK^@[r rUBE@+((aPZWmz› ꪆB,ݙW;ȹ`P &wXBȐe N)S UQ'"7X b?^:xH ~y m2b1!@!0Sjf"`aBRf> G P@@ !HJ%5 v9 Y~IJ,·^phusH `%T1E!0UR`BJ*$DbB52b]{n|&7@@~Z40YQDB bE0#} ğ?GW5t2Akcth(2C,#,C@1ӛQ3#-#@"  HwOe5Sa7M:Ff;0A4j`0!*@fDLE(`PDP]hp,?aO4>3XrV9(FEP0d $TA Ph!鮁4$i!;U#ԌL M" Mr"Nm TˎP` 3`b֊-VV%/aO$K4___FBG er4&0S5@% % ь4%T0 >37]7)V?eBL3cJcj4`nF3# Q(B3֌ 34 2XA%;}c*?~b>'oXj9Ԇ,#'`$\ A7thԣ#Q!FQY @Z:$i^?,TEh3Z612?Bhj5) jFj fFۦͿPM͠0PІ*$umχK|oPL'QFoA@(A1iH1N HB BFQ QF*TETD@H*3#̈́@WI %ހLBL^0^4*# *jRbT30ZM3DQj,U?jh`@oS@r($lKp?}Rr`9͂Bl 4zKFs)LL9UL F2(h bT)MILiSCy4AM?9T^XurSDadL]L)*FզBѢ*4hjFZdB0`3: MJU3Jb)QN3) MhfhzJb0,L`P1@iq;_,IX:_ۿ V (PHP!nPE7Rh4BQDHN!HE@QZ`41LRDLE^#=6J!Le; gݐVUD|o{+)v`9UX /^3q7H35a35JAL MQp,hfʻJ0J7LL qc??7#oV s`2+!HoaPh )ćS@RbdA1qx( Is{Dcj^@n{eeXe*UfRO%1|=w_Z,`8L&YKDZe|53Uq!G19(@TR,Z40P5:4Q͢94SvEn _|oGOxב?GY %~N{qN&BhFa (b0<% i!y fb4xy޿&`)YȤjg2v{|ms kYЬ֊xj"k*5ɹ1A[Qe 01 3:>FR b&b 8q+^b걕d\Fbc]'e$Cۋ "<>2h!CQŔfDBi Y 40U! <[zNx #h3#!ق_94)<sk;n>#9~O ?LP^"|>];1ڍ-RWƱAs2Gx3? :(B>: zKg uzعISY7ٓ`4WXkjnlMaHFO")20s2ͳ5jw>(f'җ~~;>4dY=  (lw|to-_Tٿ8 &gz>{-a$-VPsTW2f$CbVvG>hA˝zx0uq7j215*`~{р6߳Hn߀ QZMQfƯj^9L|CL4dڐf}xjoGysDeN R@2 Uμ <+vu+vm.Z_| ^?;q}`V^3}^7/ɹAr桅 XHgܖ-]ֻ٥7*q](9'=5FBwi!HECRP0\њʚ03?=Fo=u"dX9ci&NqJdX %o` ,tHƏlfyN{%loZ[k^[/ qQWZ'Z*y-DZ=҉υ2 - ֽbs[ꊝ oӽ~_V@,XiFQ& jU̢wؠ^q ŧFwu`!,#Y*${z'b O{ː CY˶6;o; J?|]8nlT:j>8Az~ ֯Lc8v̦@3oΥ9#dfʕlg[Fw.a`RVee) 0wj>j5 Yr @ @f R5x[iB9\mZV ȀÃz><7^SB,rfd l!#a{ Sz/e9 B(Zsv{u< Ho%kNgVqjջkɍ֨:7¿n&ZD-A-A CN NOR|Oks@])PrVDQO1ڴzWL 9E[݀%0۹߽Dr0fHтTcd1D&bm3cO|WWu5?Ýؽ4{c4JZTS@Z X00 S4 5KfBIې ܨnd>1\,x@ $u-!?I @F` ˲j-"M 9J@ Zt#iE]FQ?ڸQ aF:8 $Jibs3 ?+ׯ'RU+MS *jge,Z :Q\nEgeb{ jӗƛ|6!ЩBLB ADTIk )~Q1lcm̳gW/_~=W+^6:z] J`{%Xt$p&wn{Tf6È b|m2+,+j&"AκXkT3W{3?AkdXz[ 42C ShHE^yӦ$M>?2Cx7]eF"]j#u0rŌB ]Y ^22"okϞXX2Z={kOv]j}@S1k1#qקb>oӜ%{K39_SY!qpGHFC=1 jj"j+ڧF~Zor_xƍx8QT*wV`3S4#2BT{ 7mj"Fb3a@,HddH O^#7H&LB67=~^Ʈ'RdMYF1o':4oԖz@7H`mo' .DHb(MWN-NJaDFG҄gkSڝ\]]G/b&P KU$G4QbZ3vW=ܹ:@[;jX:o} [%Ba `t:WMD$q'D&띈[ KC^*ayen!`".hŶ~%zXED\+IMGLH#*DĄZz2 n%f̳,dk[/9}qWG[r9~t72nl$Yl^8ŏ=?ՐYAfyYk0zeuA2d?˻h8%K%J$+0kXњaH) $Lv'o뇊o7ߘNP$@PSk!%%#A$2HN2',@ n /m^ޗ o߿4KٸLuC~g <ۑӅ2m6x@ ?`ȉy@!򎠷1Ro6'ʲaPcZյ3Ω!֤TP>!j#Hť0Nr ,L*)>Pxnᙗo/mpo~ИIR$0A2"ŒDwdgYqz\/=wڍ\<\|P6:3n7ɝ|{-Xjl %ZZZ !駎W" VΆݯZuM3KRkKRutw{陃ISpw!B3ŋ_~wxA%0"@B $E#HdEf'L ? _8֯_\?}8ZKZw.vdu;g?+F[DR6&rmAw=cw-#' j_&ŕq:h5M̕.Ħ0`52Z xw%i7"amc$ ȚsB{|7~w(HAV _yk~Z~G·7QȈSwkNPd#x-Ns?<4)uuE󎠳hFԥ|qGyf7a1FTl@r=ⲉ b$=z >N2NE+_ux7 2q"?P2Prac̅h Vj]8ů>Tw>rpr?;'z/vqż-C¼1!u->Vu/< Pr~@]`FgJ#ӲzƢk. Mi{QkCJX)_X;l=G2fJCl|,O_ 34m[ xY'H:7mleA0ay/ }D@,u3s !0d)ֺ^}ag+`'te֗?8/ mn]hK>G$n<0ßɝdx3";χӃ2 n('Dӊk'YwvSu;nGq1Le"x鵞Jbz[_܃BRD+/G0xo:YXdLTaL\gWDR?2! 25| sS?ӧ^k'xi{s}$'Nɢȋ֙ƗgGT?+rꌛSs͍-f[oLjњٝ-X<5 ɐ\#hy[XM7)'Nj~jWGdRHkNW:1-tI?O{H(^~"~0#x#" P X0pn`N>N~W|^?鿼4\8Zl%ڙ.v"@hu?6.`}AwE ft3&q3kzXCO:Cpvݙ~ׂ:`z~1H8|-0d~#s% @aaz0=;^/~r7[Fh_Z;;x34#B4,9XrXVmovػQN*UӦ@1_Dgx`q( u|W¯w~y7@E^G4 >\Dr^.BbyKϵpf9RLoȳү>s/}ϯ÷8غf|K^UʟtE@Jy}($ˑ!_5CYP 'R )FhM+bڇl̼ˈYDv5/?C?X_W2i4CI9s}Eօg]}g88yW﵎?J;\;U7ߧ^ۂ>p-a9N2e@0NF~f3k;U6:U"s-(oA;JH- {5[>7j&̲b "> |jojtçy^<{՗+76>k׆fz? C!!+.CAl=3-o{߫ۢ"HquPg!>:9N" U>9 Kk<3bDq՗/lQ: yҘ >㊜BHI׵=2 OŅϮ^Zkk?> {n9;ߜwCe0ހrQ8^  '̜[6~EMD^η Yמ?p<ƛȤ,DL&fdKs'$_{᫫_q+{H\}/tߤwC?:hf!. {y[8+4 Xq5qsTӓWG:jfCC%PMӇM_  <0ܳaH)2dJ&in0dO >? [y_:wO_J;]nVe(3֞P%j&E' 'X5_2ZI5󸹲ZˣzX՜\aDLei*5o=T8u*/Q ndH3!H?s/׶\ο` _H{fOcv?!jrV0Ϣ-hu'#E,HVw+<{utP꺜:δCGi>%4Lۄ)Mqc`_[o}w:@7oJ@.-A(\_+Bbgkξ7|]wouOxZ{/O 7}Rq0y[Պʡ4#q5 zkmWFx.Ni`Sb1 ÃF ^y}!ۿmXROE' !C$(Ig~J/?я;$Gޤ,syp0$p8~3M@ :jp=$ ୷oA97|12q |/snDr Ym+υ?[߾6(\4 ^l|#]kSIM_Ǫ4<8 tOtWaXn|:k3M:iځ&v -ػMwZ5ʦī_}s=MfY@!⥀D )MO0z׾.Uw.kM&a[OfKC]*q` "q@GN׻2l_6D{ '-` a_~/7ހA@ɽO ROi_@\_zykKS/sV- ~ͷO?Npը+OP8_J[/?#D{+vyxcpY _qhI^5d:-6RMg@HˁW{|:{"C0}`M蟥e9_o^gگ=/o?hB϶~Ik{iKnT[8>b-뛫yk|a\F2: SMzéET 8ckct iS`-c. A^}O~ 'YEKo~aNƋq{x7%ž%?brcnXА v7 NQ6v6׶K]GZ ya_DhJP((XϞw{oB E=b| cJFAFSޏ").>_zJݕI=\Wr\l XbvyGPtItaD=XkJY{5^o>I5ҩR nM:Ш'I;3,ᥗ_g]{~˿+ lEH?e3#Л,6׷;e{k?O?=7-{% {iKcjN |{ZXW;x@5zo^N#b%.|<' }֮ۂ Hd1 m } D.: ?3y{?ٛ1m]9A-spƿĭpa^1ܫ+[ZM_u}bo:BւX@L  9 92d/b߽'OsG_Im%8G z ۏ,;օϮ?b9I`Bk;'lf -96J\4(hVͶ7;dZ01ZECc h-Z4Z9 ` Qu&>ϋue((2Z bhRf32y-.zLw?87-\V/`|EK_Nq;+.W}ż%0F|l~olXZ Z;#[F.zˌ@KIm2~ĩ= ƴOfP|s+v߼Q>!J 6Ϸ:q.{ƿΨ_Fulkr{5`\AzMS?֫Zd`; 9,"4 @OT@ K0yH76vA?6{Drl[xH8 ߨmxx$^;z{թq݆Yˈ(D."4HZJ\p}t5 dft_(h@ y_xdtusɾM l6ϵ2X^q}pp4)0d3EӶNAc|΋_>&!h,O}l  K 6o2~:wW."dO X*Q2 ̑z"RlUkOJ'Ÿds-vNYK<X(JkmW Yua=})*H[ɹ˃q&ԉA@%ٰI7 W? S3iWYe?=: =?Zw&lq1_ٻxDp}5:1ܻE*0[9ܭ>ڰ3~eFز4"Yf`fdDR%ݽ7~ b8)P@̉>̐s+r귮Vo`|3 ,:shE4%/IBGS8W0kBf _Y1]h(b/Ax j#m|@rO $4KTD"8 zݕ|s]jWq\R3-UxhXѓq]YOW+3.X1w'tԧ_;NX  D@ZD&Lǭ ;Ȋ ͌B7,!;{Js(heXYKؗO~s|-DYKv1y9ԟ Ã` (v:Qj6^[tNyp45Φ]Z-Hg߹y[ & !LHAD3gs7O;2{'˶-o j@puT4(7@4!4-A #@;Lo~y#cg:#A&{({'__+YA'HA&F!:p@Ü\^?Fֽ8а@zk4wkӸj@ghGC\:[>.:Sl`H1BQ?-@P>2S^Ayj/9jPψ՝&K<҄T 8 Qk-ݼvwMDN| YJ جo~2W3 }ȄC3eF.iBo@g=c{ey/#)kmf3t3VfQ8*1ʯ\X;gۭN @;,L6!Ao!|Ưa< `H4J?,+6&+_{ʿҖxr1>1.vBFngLVH]9z*rbD`TM'8[MH{@RAU&oXD $Zrڥ׆Pt{_K<H+bmՋzP0S].?r:BY:-gmkjӥ&"([>:!3I崵( D"|N677;ǿ7tT+[9C~鿴%l"y%aS.1vm3?=zYG@nh|@(M|Aon`"0gDw8m\*:(\:f-Aw3;i _Ez֥bxYvM/YH`drrJ ER,"nB$eMD0J`s{?mՃxI=>` '<=/EbP'hgtsEIdFThR7 qrAOv4DVMFU`byG Beas˃r=_cz+5Nt9B3NnB$0$m^[W^-?]NXC]*&]8(@o#_HU۶\m քs5X0/+HW! ְfKD|4R0 J!G] A{%,{K,L'yKʼrR0խ|$?Ə⧔݆] _p_[>uoR4*E|4[U+j'@g-|y/!v€GK"*vLiaFis3) 043{T UNXr, K f aT@Ѡbscy3$??Cg-A{ҒS^q^S-bXK{hYRޞ n&fX 4;^\p;Bu|*3bN3I5#swd[b#(GX.Ne134&n{j @2PZQEET(&Wϗ:X36Z K,QM؎DU,1k+\$y{ %jsQLI3H}|ނk1H#*FCF# n5̮>?œ z${_VxѤ ] Yo;i`::k: z`P]|; )~m^Nb>(ydeXeprA91K?b݀0a0Z#%U1/;5|&@c 72I |`"E'+g&z=xn f,˰YtJSs F'i<,6u,F@T % `n383{kNpzcX*,XGEw27u+/F(ĵ!4#ZA\ekzYA`5@Ђ3 [fB3^Yk\B"EWϓ/bypr D=:_cPɳ<|<7=s3֬0DT`07N;B@`ub*)""yW:}zntdO(r+ xJPt@6P(hkQyA-\4 ,>9jBV:ʙ`IF 5@|1NT޲dD.%5BuPq>_kI+&ݍ' & }4Q`Ҁ0#"-5` iRpPۛ8UsGJYKNP]bx#!V34 clu;q%..t(D* A*ĔAAg*;;ED)(H1XIh_jp %nOBPǃC.ȊiFDت4939a02"” 05F%!Rwj%XLjX΋uhZ9X4 `>˓ƃfITHhGzZ"PW0 %lV /_Qf_.FMIT*.j {̹bf`%@r-- 9ւB2ɕʜ!9l9um <<ʤ5$vo= s-syD?؅0LjuFQ(1 IcjI)$PZwTo,d]/\Ki{>w>k<Qy4Ja-"eE5YЅ>j:n=gXXNalɖ`s e ӟӯ©{f&;pn̼(E(!aUbF!`)>,1ZK%,OӻAD!$9jP4 0_؛ҁ ^/: c9?ߋ ,;{2Xb;aqi(<GS@J(lyn ?̽7'u-PmATzz116 PYwpTYx,qPJ5.V O%6^`G4~s>{M\[fAN2_ul܆D .~[vxa';0U"Ú#Gi^пg6"ii.OX5C2Yt%k',$w tj/59 i{Ҡ ),q!-L|\zkDE=``t%'4oD'tI'}i 3Pu¥a3 &EFBb6rt?eĽǓ:xt<4g*Hz\y! EaKܕ=7$! ;UJɉ,,S K!Qr1+6@h`0xvÅx4F]7xy?%Nz-qpvM4,81!4рTe>3۟9VX^%nt7xg^_(,6pdi31+0jКC1ί.!ic\ 7hI}ՖX Acs+ڱ9 8: >@'TM3yB4 A?y:nO2q4c @?@!a})ȝlV - ]Lg'D놓lDL'ć&f B!AonBhIO^^Iy+pc?d`f7GL̎G 2B4x· au}R=eq޿ޜlL4qgg5C-z,qC6=B"h(s8Ml4QXɹYR}r~;[jQ{YTA kۻ18HOK o3tڲ==c4NWBoO?VP oaax䑩MFU!NPV ݅:aegx:iN0"Si4ђS?n Pz>?˅WԌҠ4KBG-%N~Z$uL& D;Abk2M* 4FB.'#Nofn@  I,PC7 A[V%j`NJQMF@1:-L14lrXtƱ; saѐ㨼SVVX%}rf #"# & i SiGUhaB ½4 hœONtd9N`\ 0g"@]-ΙȬ]Akۜ=SM@Z 4_xQb4cF5E%]QRAE38:,G?;0֐u'1(*Hzɘa43S_Y$@S`j"?ɋ@ a@'!Ɖ͢Fv~;3"6ȿ2C֗N`'@#)uDzfa0'|PS@]ç4 V(PUeR 1XB&{@&jZaUq=HH>' :K' rӯ&5 |]j_uLE~M%:M +e:7 տ HD0`LO LLeYj_'̀jGؿtK<Yq [M#B,Vh4zLP^s"%aP(4i+pzkNnFvX2FюN*j-3tƲ; lk4iլIMc#*} Pa~V[ !B?R *lu4E=h_ffSPzlAUĎ ȥ_%WƟ o-ce+]g!|34`wjz΋ULQ(Q?SoCU5]!P:@x+ . ,BKo|e*{??V"@"~jʺh`rNiAͥlB9cWw Ԅ wyP͢ &l^keW&yh(Ewx@  ,upz(K,q2R  +i*17}ovlA5B-"6Г= (:rXO XQij'< dNs0Tb3 31MJ3LP Mpo4<[}zveͪGѪ[|<π3WA &K,qK 92og_ʝ;z]̍_5j۪;0`2҅[vU:V&@2 So:,̞XQY3S 4LhP?(uؽ^:`Μ7|-+9Ӌ''@d@`LZ$O4~g VxH5%Z⸩a2HsLdZUo gONcHK S /}M@9YC4FRH QH+̬AI=jx(G҅BPH`gēa@&@`6Wx0hҼ8 !'v&hNFТP/u:c9 2AHAMrh-৿L!HkʵBjK.$o 9[6 ױZ`B'[E&5,`;\,ZXv7ıF8q7>x$i7yOOVrblb"D 4 U5@c:ǭz"uQk4L>"Z/ݽ.9:a--ՅR4{(*VmswƺȾ>ƅȥ߾18,ϳhfYP@&?2B-FH.@j`:d^Y`V~vX >MHF}k|pފG Љ Me!GG6v٭*\߀d "0a- B4Y^hhU#""ro폁@hGp%A)[$:ek0j9ß9khU}+2A4KD3DkoRբwG0Y}?j k0 Em(B)^ }A2tR~өVt D\z\"Dd\,F15AL!=ES5b ԌTgŠޱd48bx꽕|k8-`a}l0z'^촊m.ב=p_JN F))וKCm||6ڀ`"!#O\7"8 >0`.ԨPQ*ՔBlh: 54&CEMv j 7ђ8x8oOW_5(Gд ۋNd}F:^G". Q⤣o #rDD/$5S A`T*U#1XǃnuN4bgU6~i#560gwf |O7kl\fVA7|3=<'@F F3h_oc9v ]PI BM-j$*U3c˶S}Hk;oQݒt'!glzOY2nDlmJycՒB!} zly(氺ڹ<+@EJJT"zC%"?@)aPIcU<@S p2+zp(zXɃ|M ?B!Z^I}vU딧 o+,XPKAjs2'EA5RMtlj|`Xuwmߩb،2ז9ᦨltKR4[gi#g%O$ P0SdE^*0گ_7[qi40Ӛ3ï Pu`H{DprD@ ,DWH¨fb% VO>†{5( Z'>g9e5~>͂%n{ꣽ"SCZ^zEo9ӯt>OƥXVTU^4I 4-osӘWkILMM5L!f Ѡ:uݣr~ĸr2C) %=a?4L@ [{hx#WlX1عyrdY>.3&bpD @MuEFh|1!QzZ5H{6:Z}Z5Bw1пQ59 ֑q}m`)I@Ԁ,)&C?+TE 5 / %b`/+X /n kTSQa>'_ fh*Vd:$G7[j{s}Gm2>_ doÑGŴ^=;]Dc De@ Xs׀I<25bLDa4մPNHCM"դdr]yXyN@=Q T6}FpVRbɼVmqJ#{7.N`([\Eo5@CIB hi_xm='7\7PUXf最d@g#fF2ԪZS?^s 8^Y30_ l_D`An}1WWla%B+.URBӿ) 1+B>}h0mp/1LtA2P7} `tQ3CP2dxP|]Xim &È񜿲Co .t66ђ^*h==QKAf=^BɼGz\77*T΍IӳbKۃsQMyHxk.Q~-K@! @ *!0 d^֙~y@gZeGVG? Adl˶ (|G hf SoJ) L m[ æWq(q(H #2 tƂ(O '1YTmFfM8xʨ/V컫ͅ(`܏GLCin~T0 za;ivRg=Bf;wvGdky.t3>{iʤO''0)-i!߿+ɏ>֗_JU@0$wo$ 0! 2AD'+-6h+$ҕ͌RPDaBA`B:BHz3Ϭ^Z0BX{ &jVp^kcMc㵀ϊZ@:a+6zT4c1"+Xw6𗝏GWwkq1oo=>ɤ&,7 maai[}{n7#Vꪢh&.`Td攉u}g=l]8(e=D ҺRh~9AFצ7QTz Qk/·3ՏȴJ ̐1C`2ԒXy݇ 5WW+/٥ӿ:79UPV؂7Ew._35J ʹRB-HqqdtF"ìȍzvk+_Qfq?[ctާm(m7 GN0v|yE٢=4zjH'."Kv 8}'AYmu[q"tjd+׫Fsz=>d2493~LN+ ?ћ0F ??y[>kGohDNuk3$k3Huk^xyɍ(Ji%.% BQ;\'k''hb ABcsSNŕW4{!ߘ,}kՑֲ;{}5 @M# UKl7a&P}:LՐ +[T0IOV:k3oNfc-3m"}ȦmW=.q ȯlr֖uF|r^1RF6gMށUX0hTB͘vz?PkU'׳ݳz k +4)8>1m >larsͷMZS_ ڌ0F ܨޖ80xFiBIOٟRcqҚq9hR7=(`G o m:=s|`f}LHL9͒Lͧo稿4([O@!'j}jfhT)5.VvzL^^'Ӟ Yb[!t+d+SհN^ yn/N{Ν8Ҝ[i"g)0Mi3l XocoUfl=5XKkV#7umEDo:'x`¦ާ²L hک}0\sBrD1`.i3z_c%*aLh'iR!Ӵ`Yw%:X^~_md^FКT`||QX:eQ&W*j4}2yORlx;`zMb R0ڌ.0ʻ[sWs 05hlDt\!ӥ(`% h<\yga_mu.LRA) j98 /t!U'S4ʺٺ0ƥ3?߻<؍;wiʈOTTſ?~W@W눙9t|PVY; Օaĕ, 0(7[)a mdAF~ZүmOi{h8tn)jWb3wzݷ׿`H IGHR@$&$` Q[~f,룗Fq[ʼn_>uj65J'9`̤}b_ZI3E=D8?p h-οpz뙿:VC##҇} k?0a_m w-e?'!YJ XB|Aiex8񎾽>y^|fJy.mk O~j#m}̮\j20&00t?_{ǃ"񹴬ĹLn"0KY2$+/Ym&sֆӘQ[zBT`lelH=ƍKe cpa?<ۘƉ83dܧ?9DDxRjd x2_z3W@LgF<dPoX:%BB1rͽ9c&VO辠7m/ܘ+{{QT %P#U\w#ϿsIxaAh29^A$! &eUΚ;|aXdQ+6Bh([Inz}Sxeȷ|gjqi v(pĐ! f!)ojf&?;{>P &!>-*cw@)KX^~Vn?>d D&$}3E9ǻPW*\? eRf<ε_ػAh8ml1 ci7(8􃭾7o-;6($ 0?IdBNDdTWӇH׫z)8*Z=[$Q0N>³j{ C5<7حqñ邾9۱W?to^ڽcCx`ɡYjJ+:7˵A|?_9~ uH%Xx1RB@z0`%!u]hgLVϗ:Tql ƊjƐ5h5`IʴT`!! ";jl3ڧl~vOjZ{2-0҈ 4ƠBw{.]z b-Ie&]T p"S?N drJuqXeS@]cmf0E \:%Ԏl}luK{_}oҌO[T|Nw^^?3fN~0 mHb؈44DK)pSuϞ=s~ŗ^ dfzD%5a#S@jFUo쮝nż̸:Y@g5,( aS'X ׎G|}0$j;5vbgV^^D1! T Q9.~n{*_=@W:sEqt 7 TSȟd5oO419DǙ%' >{ܗ_B2@I n?Ƃ9ϓM@51F}OuyAC6XpCdD{%vN@tUm1 o ~RbrgB۱W?x]pJU#C@$%mOĄd4/leO~ӽ/^D^ 4^x>:|Vz=`YM0zoڲ[#4E3pҏa/:$=X$Ph{&l\bS8}}o.{xi2 A ߏ!`C`ӿN.̢s _z@jMw8W*X& lde$ꘊ Lg8eapۂaҍqO;pχfgpi~I~ht箹3]om+>CM@:O45Sj@Vuijss{ []~^ǒ N0"Vh:$'f̖N`Am V 7>y[3W~[}5Kyo8B+T$"҇F@E9}so>?8.`Ñ_дM3a**a'7C'q9~r"y ̽K'p_0>`6F>?:O#.H~xpx)PH'MdbP\m`"4L}tCU$. e$nHCW1*FQULn)Al"4f ̏m]:RCHPFޥ OwL|rzxMGcMRhK>&t_@}5~>;_^ҌnZ~O%6Gl &E X}PrE(jDT NtJ~E`gӽ&gʏt | `@΅%裾>Ge6a~n^) btYԔ s4b<0e*&Wv&P hBCDm%cN) 2AXّ!2:ۿR.ItIş^a݃}SM}l~ԧ06+֘^Q |G@o^y `I>͋abMIQ€#5ٹDNEXv/Py#QJ,<`kdʱc;^-(49Ks?֏LXsO;IӼִf?aU8xگ^8'mB|W !mGQRCaFǓVyjut rhu#Ni.OXHb1bsukcWpX8!NXZ0' Y0 0`&jth`!9R\pbPoM?08ɧx |to/( >ͅ=g5 H3 tyً2=p=K5T`R a '4駼GZW׻;;n!()AxJ]w̵ u[FXBVG`8A*|]6[+muٙuy'/V7$00Όߒ|feڌ=]i~BO{xNPVM̱ŪX_~G򻇗A_mggCx͍ؐ^(v<ϭ@wzgμA 7S`2Bjhb4*KV/۩tW֏50*F5$yG84s,}0OY<ڰµ|c.l{g:/ W^߭G&d=z enp df -Ĉ񽇔;x !LMa2elX &(NH@$zIUp(6׶'հYu8Z3kޗ-9v]٭uDN5DJvpdG;eےh*V1 3KHU \絏rEy67`ف"f9J{}X|n<|~ws0x`{c!r`/A.RΕq.|Gw ;DFa`0O)֞ ;j7lhq͝+݆E27zDk%:u2StEDB-Zt?x3Ʌկ~_ h́qA8߄diьHPqz2[nmoVDg*kv{ݰdx `PG#d ?R\(5|hNqq_ǭk.~y0q3?C=\`CC'GPsbP*p'"1%9Zg&]mIDAT J`JUTKSTFz-h^ALs^%P`46fh#c|{?rS77_ ݗyTb>Ժ;#B)s9Hɖ@!^3U h  ׿*$g.w1 * M*"[WhBIj&Nfnof|mWO݈ ;])V4 `SWa l1Ӿgt_8bN;烠bݍ[9zu=g?`ã>v)ַ9<y`fmǏ=@Fzn|/:]\.0dybH8{Q6& &7_) FLm2Q;y8~wwF76&jTN"zׇf=IZKΏzxOr3G@! J94u hkbvp 'ŷOw&.nN^>Ol*haN7q'N$%mkBdC6$~0凨X9+h y7<lac|t(\D!NJ@IYYAkAɺE=lm\{a+7wjfϵ{$Tc[WKz~gI2 l CC{tzZ{JgϹv|剏cps:{;6=Mģ2K٤W#7i@s8 h2#N*CBr;[pwǟӣÓYk VBn4`Vr,ι4R\W!HDuZ/I~gr~I_ZnQ8>aO~.r ^%<Y"PITj9,(T>Wv][]2Ńk^1o61= OB=7ʑC֞qkهN蚈n̢)|"bxdԚ'*_cѤoƝ{|m+޽`"T]WzlzϞ^Cm?+>#e6hxL}y*~]^ƴott";#) %` 7 DMd@&@s[[[Sw4Mk9BOW,\ ڡ9TcrQք/ Nr%Bb/t ]sS:Yw+(?.㖿1Տ5'''>tR&Qt-~Z-v^2&}bE@E|r9s!:OCQe+t,*—yΕS l$  t}Zo#Vd_QGU0*&qMp_$|u^h>]46RqVV5G_,ҏ}z},o&}"ܹJ .m%̓$8Bd#1G@\bdQQ1'WzߞjG{ϷE<âkb\Q*/ A:88d]lpU;]ͦxݯl:oiC{I2-؂ZX~UoioYUO ͐J1!r>eߤ<G\.I] >-B P$'VQ(N=wEQU1ԣ-9Ny6Na46NfMEw"C$Q7%ybx?JTNvliVs>x2=lfMt}B'[[S쮷Z%_UG ?+"uX_"L#"20n>gU3 X8;]MxJUuȷ=,Lt(..'Wb˭pU|1 GH~ѝ qWGjTNP *N wAW؎n?v8^dv뻮R ʳրÞJx%V?g @t:lD7/_UϞ+of"X$K17P$*"ڋ%N@@d_, ٱ@pby|Qh4*}ʪjq(7ւG|Ʌr.6  Djb.غ•(]ʹ@jIJǷr8.Sѡ/.浶X'̟ͻcw<;Ob>1cQ if>{'>+)4VJ}kםV[DH i$D.ǥ(Vꨧ2E@zG"Y0 #Hv!aؑ@u+%BDɳπ`` '+y87WxRWγra\Sw\W\_pj<TBzEDEg,zs\0wa8 :1Ϛk>*B A2O\~>YATd|i=WX-+(*Zu hT,,?~MAa!R 2,` ~%D(APmoLJ+sp4+0~rY/'s}6@9:*h4*|᜕o6{[QGZ )F̀\7o^&4B(ȍ[`Qx6<!IlŀT'D. XrY9`]W($! >8u*4 FFDދ۟S:̽P `N5Z]k!CSOoI?CqKXpbC_QL[vK^Q{Kʔ( z@9X^^${MSAo z O gj bxP$Ks 12(};ߔڔ9+,`Z CX)6g*Կ e=.F&|r oCQZÜh ”# "f̤0 9ˉF)vaiLWZ&0ӝ6tg:(cnW:Ʋ9dZ{Nn`^X([`v5?~ 4-:_1 |)? o{W9 Pxs0lSDbVc{*)jn?s>뱞F̐&`Y?U.K[?~ >5yDx@JtyضY9iF,e&`0dpYEg7WC FMAs?R)!QM'^%Аu2!`44ϏOYPy>{+$ʛ@CVL}9("<_Bч=d .7åDsbn3}`P`X|CY a?ۮO;v5[cvZpRR%%,9 L{& Y.%q Cс- $ "[d*9KASgrQJ d)=Wo^^eO1٣d٥Ybq}GTTˎK i#%.8~jy?@7rRct)%<"\3ppjRrEZRH~KJfas+n'Fp|FϖH8Ax̺@PNn9(⾗}>L/'}%|oC^ _㤝$A w08EBbj#HGSzpHHM KzX s!z4Ŝ8 (h'""#"(+B1r Nݥr ߰Λ(\'$v +EG9%؁ҙŴJ.edaFZxyAOzKڜ g-6F. k0c~4GtgG,~k8OTd+tVe5C02@CjNIݗ,ɿ:G%tEXtdate:create2010-01-11T09:43:36-07:00Q%tEXtdate:modify2010-01-11T09:43:36-07:002tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?tEXtSourceWPCliparta$tEXtSource_URLhttp://www.wpclipart.com/4IENDB`armory-0.92.3/img/armory_rightclickcopy.png0000644000000000000000000012116412414772654017526 0ustar rootrootPNG  IHDRCRsRGBbKGD pHYs  tIME /]Z IDATx}u`#O]$$@V\[qZ-V JPP(N {d?NB{f:}~;;;;;;;0NN_FD; کک]S;S;vjvjvNNȵk׶u #Q$]VHKk4zXYl&Wk+4*8)T$z&\!I)CZnBUP70BU2VRabFL"֨Y4E6+\)I+x@(%\)-B:1D!Vj*2QbfXHjyUj$%$yJi ?E&gҖkt*8)T( nŸ]X3BYk+[/(QJ)00\f~RWr ZQ,_VYWZYh&9eXO540,mo&.(_" +ktEe*z:݀甙+مUZ=#P%JBS^5 2JdAu>߄?" #eWX(%&D#Z9O)Cq<[nfT,MIk4zKӤdV6 )9eJIE %RN_ ?:U]IEg5ï2Vda#¶D7JkL*J(4ß]~L]/AtkrqbfHH ] y>-R%kWpi,'8-4>Vw?To` Mك5 <ǮU䔞oħ 8g195uBtǑY0,8 .:^__qZ$t/>*P@n?O}3/\}²ڄsb䬲W"x>L ϫ 4nHх'

~%<*5\zqQY0?I~][g8De|²ူ‹wW#0K⢒ LY 9t)Zsq"G/$dU_\}rˏBr+ku/ 샰iF#{?Z c8~%"*5Hp'6.p`qן&Egku:ÓȬA  +.Ĥ݉Sעs˳ +ߏL/50ܝԇ:C=ผy_RYrf RVI^I<ZDd>~qFQa~IIiULxP^$WO1Á4BȠ9}C>p%*mW~6u {Ɏ+ɉç q3 BPvbZ{0uJ$m/Ŕi(y V._CYKת;CD6UqQ@\˷=-@؛T.ph5Ⅳfz C/fU)zAS5Oݝ"C#[kiB_^pc #Hz o{&#Bv seјU~y-q/xW`BJ-pt]:gI "NWsW:tji*]8#s0?:u}jڜ1C/ϯ>y3=l:,]H5Bj-VyK0BVB*/Z4Ǖd>]ݜ7~t%Mk惾>t~3 >4M H4iHI$5tMqbG[+E磷\*mg?fYO9ٛ»/]ţƟ.=?\C,OKpܶ9{Ƥ ﾗ_=ݗ/:5=rky3KQ|wmUN v$DF͗5g!9|k}i OSSyڶԓBLL~ǨI.-1FԺξ(konf״꜔E[) r/O9R9Toɓg\/!ߝox[8'2heҏ.=g(f/H1}!vwAkk3~{&K3"(rƧ˒sytҁ<zt~-Đ9}>a{n2Жd|trߴI %(Jr<%6~:~8Ή7>p\2}MKϜеzHF qŸY<w#?ߚ×ߺSw՝\{ n>gtw[4|2E\W{yN=c2~zʫUѵUw.%eV_7~y;JwGvY7}x6<*X4Y63R\euEog?%|4yaSDg“;&GFoOXڬ?y*_v{0k5[5vC·l wn/~k691@wy'2.E6o&9osQ]>|(glbD_73y̰-۲ g̻k?uEuZk?827Ld[1yo{08icM[P=,+M;gèmaEF1[)ݸvr$6?(1S_fj|6 ظU]ǽ'm[klxpdvO+0novQiE1ņfy Em7d\:7~vla q_1=?g5fRV=qEckSܦ[181q֭y7뛶y}q;k\V MuWbNy֏44yWFjZT܏Wlpr.^6ߘ1.:noMSm.+#4xq#nV52v1EjEo-tɅc>W=*G^qG1?ㄓojW˰jlˏne @BNyrΟuRu+}{n_[mXq3!];m?_yVa.m˧mqus7 o8Ø-߆[ \EҴyf=m~6[4`\+Us^& _O psO$N9% 8 ޣ]ILIFn)+aFeNiE$(ĝأ5etqeT5ٌs.!ujSM$=`$63)vDזVje@wIPr0Ѧπ|P30%t6ybj`-"PUNZ45ɥ30߸$×9sfVvjk7ɧkCUҨ2U,&cϾ8{ rj1yZۏTWɖ|V(7jYb:_ǰ lD\B ;Է&TY81ɮNe$ս7)מT'v9 (R#"p\,}W;Q}25ע9XS`rv}BLIHeyګhr=)f5+Z_\FL$X1 \?A$9 F`xe>0 l(2RX!(ycMӟW)ᤐ qzZDɆZbRl%|}!T Ad' z@Q}cj#tA< 1˼ &˩# Xq+?1j("Z4S[ýZ4H3Q3W;lQRp MjJ"}"I6&2APaYBѤ؎ƨ$-&lE-gNED}`${&+( ٙj/ԛ˨F"RRc$? d\^4}| !0,a o;xȗV6`(X2kkUg)dB3uȮ}E7kˈ>tBϟ@ W%M'Bo>v&8g)j%X@ܨ4qC$ߵ_e}Iu#}kӔAԁk05@ B Vr3pj*.G)`UU#+***,NBؚ*\P#l !O}K G$yVK%dgY-#o CZmvU*X2Z#@Rs$ŚdYA ķsA™ s w4QPĩGLԴ[X$dF b@dsk0?,\SVu¶T"T x!AEFZ%EUQqa[4O\mf&) &7 FWMoVv_376m`O}֮^sC*n NK{;V^~ 7557.?>yŌy0's.sgXVo0jr1|gs]MC^ߊ̭mG0ϨbX8 5Vէ*U{gq0iQv*q<?h 0ֵQ#8g9.[UUFxŀ1`}#%<[QD&FDxya*ʵ=-MD֨r 1RVfaX6;|tzh7OBRb.Ye9kbM$~}<cz]qo9ƀԍʝڷ &[@8e|ct:}I@0qR :@(Qexayӈ5euBN~Ү^Y~_M ?~yU k-\W/4l30I ,$nVA.=셺L F#y @zg~:'|:NF\ 6\,7<͛2zy+(0qgk?ka &?#A'ߍs+=84Ʀo3Ҩ.(s{tO_k#5?IĞ۷`Lga ֤zZƀ:=yYԹ]|A-KZ8ΘUܹCh)zO2bnU4F7hMp(9Y&Ƃg*ivorl8A**V۱uZw~m^UߍrX8gH[o'Rʥs&_ttIUܮ\Z`! =h,z#48Fƀx@;x "úbgr'. HCZ_bYM Lx._Rs28V4mK<76mS<|i#_X"Ha8`K7 GABQBOח:"@iڢu SMsaÈ$g7ͪó&6 P[Uř ;c*w+㿂^plڥAPTXQt7(#ItrxwkOsԲ~Ζ!,=0,,['#꙳7}=Vkh׎6wCRs{/9S Egwvw1\!)*(݉&ɫvJ*4*3^nO#bӊ\\xdL*޵APDPYh(h`퍧9U~=-C:9[{nc..n{r8M:sN*^Hzjv n꘴QY^n/{؝cՈv&ת$.{Z?ΊM-rW vVf MT,ݍ?s3Zgh<n{3(9\ﹻexB^h|>`+sYN3ـ⽸RGګҊ47Wh$z؝` <%wJ6 ID$"u/L>be,lWKa,x.3gK{)`n63$}*Bd=xa]ݺ?e먌``l9oԮGcwH_~=EhgD˛~~'&^V,]!2TɩkSV,e!2ژ'3f"f+3`#v|OOs >>Y2Q?ȼu=Xه↩ )׶ｘP%;{)Z AUJ1OnӰAq+aY>;Td^ /Pt5n1Ir:ON czNtD[)y~۱^3f}rάpz(}~y'!W~ځf%r3?dL{s7.C1y)s"Fy}оěЄ]yd@{o?{$kR[?obٶ6.xzqo{]3 e!0:b,ta>3|cDUC'TM2]M}{wWa?&t!Pvk豟](سtzV߱2@"MA®]5ƺӤȻ 3#` 3,G (x֐WCJu };:[x1 Cګ$ 0<ҺGMa֘TK:`V}wz~p߹z2.?7 YUXwIcyRBRt\RRAu7K) NEڧ$t=? :u JDjG/U'iNLb|1[ ҙû( R;o+snٱg IMʏKBϓ>Jy0n&%F}=TuwmW/*f>ZOowi̻f|yeL!NluL/Ϊ$zv#" C_ v`8;N:?5݌*\xjm*y9߿Us7+B_nKa~ߢ=|\aq&*J2t^~0w<&?q}wu&zڽ7q{vw֮Y)c@-/:݉gyЯA5iF"i(0X=[wW0P*X2qA;|tcF٤TXH~ڗ.~?ǽ1n b/]^lɲ\-C S&H>щ=k󻚿3}݉%cx}ۅ!|Eǐ.{&{v~"\zփ-q,MM !ce!t20,fTm L0 gԯF !@3)#!DD}3 QmOMYef 2w<-e59,T0m: c8F9ܔ6\-Wy@g^#.m"J;-hg1jO&GLNSuï',YaMEEFFŖ3" &!PQsΤտz_o24 tVzJɫ`@[<ݻ r2i0M)¯K^U|b+|$U Ͷ3 ${,{Xɻz;HH,88{1KIgyk͟|ݑGz8SEё:OaV?3HbT6:Q, wC2J2"##㳬`8r2": j!{[ 틙Iy^wI:}t9G'Gյ'ԓ>{+4*Ӡ :Jw:ڒB )ai5Fh.$oteVtfm&@@$-DR$IE#zlH{5M%bE-4)wxC0Hv759Zc;T!9z D W~ܑ5?8%C9h $RwhEG@H FWxn 1ƀHR3)ju>r;%eU*T9Nn6r -G&ZsqG @Rꞣ-vpOtۧu?}EQ$1ߺ$% A Hئ G~L6Kvdo;գk@B!'P4M##cJ@,l gQ^]樍lM=MCkS^_l~|rA=/m!Sq;Ƭ"є.ULl d.f b8qMS`4؟ D"1Z#Xwav2(e\urwF3~S&a+Ο>nsR EUώ>Mex̦wiw;fʂ"N7"JoSB)/D EBE#f}',T$sc~D ED1 Z$H"EW~ +>X':~QӗA a@@"ʪ۴B-GȭcieTP$Ig.,Rew#!L(#*h!?C$c.TEAb\,2]yoɫfjYM_L+Mx\z6] ~:ŋk!d%f×l0iD{u64ȝp߉] apy''GGE0O@,&Exo'݇Ojޅ=|cSx݌2O!0X8WHO+N8yeC7D^{E@4v~j܍6wb_lt mdzX 7+"I/ӱvl;byw_u%AV[ʬ|e@PI^آCɮkߎ;T cCz,oy< |XE@$jN2ңe]" ցidUtNɎV*oecٮzngs^UC,YƝCVP~ )+\B!<++RHf3$=")JZZC~+o 㳃J 4E^4@lؑʥYa"73lUU5޾=T>O$@]{"\Up.W'{(rk&Q9!/H<}6XPy!U65Iˑ c"s+ n8$O`aOSSr Ia.~aF9Ogߪ)33A,$4'Dgg !ٙBBb:78}OdaaaY|d^݆vtϨظr*3qW|]g~̀C꥽2r?fit-hw=p=ބY".c߹tE?12=c52a3|)~{"A9/vΑ.[P7>(ūnco\xTok[G{1є;D:Y_7 [\⁳%sQ3ڔfɞ>Լd`Y&0PĉSZ$1u񝅻"UwgʷX}niR/Z9O{ʨ;vѴת?Μ8 6-ITg=XӝGXwHq!nJ^zl.0/uׯgtҟ_:>®QTڏɾg/ UV}||wE[SV~byifkUJa>^/x6 IDAT Lgfm÷S-^0TXWUd:hʓc˛;HEIPC_Sꫥ@ )) Ҫ!bxmUzFgHm~성4)Ռ aC^R2@;aC~jB~T X]fҟly~fyÔ Q bI0ۼ)G*tXd / w_~;p'Jh4L *%I"͢Wݾ]5ؼRZST)$jD R`T L"RFd" N94.,HmJ"3| &F@.So=ï]heɇxb64cHR̓8fZ" QBR8C RRF"Ւm75Y0U^ϋ:9#Г/6["$CNj+tA6t,4ƀ^?Ϧbh ߜ߶r!\e&i!6S)R6S+-ۣCKgA>*~߶"\ܹ or2:?3,[Ꞟ 9QPskkk\kZ朳0"Ar ;1~<>LOwUS'{z{uuݤs.`ͺYȬ1 ԸC=*642ߔ)q'֒ 3ntgϫd-#B$65f;2n%i'guC]7.8 %:|@ |$5nA%6#L=@Uû-x;v%ǟ l'mP>*|sA"/ă]͍).b?@'zqit8@CG?| qn>gW^dvxgwo{..m#, ˯eio_ 'Ƞc;D^>gGoa5y-**%ZI2ғSԹ̉fH6_N$wz] (2VVDz_MR @bSԤ@;U98;yBX`m2Kf;p @EmY }ڌ^p29=q^x"|$cf_9tB]tѧ_=߄@|A/.Pv/%5Qo~ՆqH<€Q>T)1BR4le*L2rF _ o8tNiQQTp91(>EQ@Sa/&"H_JT)f⼂܂_@bb ¼=!s @,}1By32Qf;< u ty34?n/Ż[e&ӂ}5pΣnVTn]{#IyC̲%gfN8kt,X'}u{FoK1Bgjh5¸CC~fDQ7]\7}|PǾA{~Oϑӎљ_ɣEUCQVmwhꆸʯAgn @$O~^0FckK!,f9rj>,Ͳ4ê5Q1f4T3J5P3 5-Wr-S5(2D.QۧD*Q4(S*\E+ԴBE+ԴR(iFUQӥcXeeX8c9c9NS>>DU+X\5 A` %vqk/!?E\|pw(QhZ҇C 2X|%,8{)DAAqKؼq oN a`Ӽ޵r~bcul 5Q-/5ÎG Uʜw&35t׋Nu 5%ٺ`ػsg鏧CEGC<5=ʰۥ%-5\.Ig|nו Rj|QM-IkGĉ+}"$hs!qO:J!i`. ]OM^!>:MT (N8s_ǻjZ>Ytq~W^cZgҳu6C#^wE&=4̂ʋ}01T7À-s@"ܞ 5q[ ͯ#>u콴>2O\dݓ\ 4V\puWݩe=uz{u鼬#=(JyjѠt^AT)T[S)R|` {i$mrDr $u\qi:"v{~@@0ypqqo+.ac 䀀 ̨7D3qYI|P eb06*HJ AkKc#_˒p*%PNn(fv{Dۉp7fR*#*6F_A}u+߄%q/NەByڈEݦ޷9!jp?ѾA% % 6u #,|~οl[DWݰWm ̲:Z ԭg.}?h׋:[m暨S3k+ 3R扅p02>t]3S6M$ kTs a.o脓FJ%=h mDPSޭMFO<[lV2J9iKӜXZjσ8 @hs::[CD&]WZYfEM8iEˆluÙ{/x{٢) !?ϺAE ?̽p\eZQ;y*kZH0GI4.8;vuoeoOt%'_U҂ғBvVP{.u@H_ GRXL+VS``iV=zO J?ҹt bI w\eNe-~ڷhunOBىG2wWZI?k5M H~n! Ptw'd 4Ɖ;]ލ N-x,]y0%HG<ן)x|PP hO{'@!ʔ!0s][[韜ߌL !R-'QBHhݺ4aEBH$ x$*uH`2Q|ߺ)5OG8 @tj߯G>r/C|IETZ"W3RHKd* VYL&$=XOO\ALA=oUH3RejmӁS'feU[EҲmw-*ydAlp3j\.JJlLU̘Č⢢w9k4ػt)T Se2y^iYPs% ~in3a@`21jdw$;V"V,Q_ wWzuޛwo߾{.c܇8=h\'ׁҤWRBa#a;xrpmu OZM`ߥo kbiqaNFËvG BppՅ[2}] @+*L&ҟxwu >DyDvVߦr<*}W \6/fT2)@*LC}]랷o\4gb>wyoM'T1{ i9U vi:/?{|~%gvY}Qؠ6a Y#{RO\N8Q.8#R^yQAڲ!; |_ ):9wD)QS޿.p ݲ3_0xDhS~:8ΑoP(yj݋K2_y;l^5}σdS_S,kNzo¡w-+w 0EqR&KyiRffLa8:snipjEa׼ΓNN-|Z¡+Mjq斥0,]~ԡHVs;:1W [l1V0lܼmmo^'r@9iwa;Na:*R`f=^=c.8mcy\b5(kvwݰN] wX{?9s6v M.;PLˤR@dvٓ#:wvpK'?˱O2~68Hfrg9sO|q}~ALd1zۯp'ewcZJPU_mUiD )ciE|ߓL>~I *A<%Ohj U0& 4sa^-4^.+׈Qէ,iѸa=3*7ջz8" 5r0!0ƴË%ؙ8?븴"#6΍@l֫k/h@xHxz"[+x}Q}VZ<$iv~.p'S `c@ԮA#7 Lkᙎ̓ =aU ;v&t=PiתE]/xtEc?gKo_O/>מgmoFdTGZ-b%:Eb?+QWa\5}sbTƫWU䲫 Ꟙ}sYݶ IDATC9ؒWEc^aad{ ~Q4WcOsnupM 06v:im3N%$0*vM>iۢX/z[*\+~Yp3yflFulŴ`qU  +@*з1j[tyK1K3|jN:w Bb h{ozԿN>.'.ؐ Lwg锉By* 3j#R I9Rb8@O P$U*X+J$TfO M;},[ڟ?#+,h >t D剩+kN-1_Mc%o/WHw$x$!oW=BGO܌+,S9ANFB{OsOU 1kE2AG{|LN}XI{8\[M64fDow550 տkέJͰ_ry7˩gc;Fzl!E=ih@%B~8Θ Ox%`m' VWݦZG7N*Q泪.~jߴ -M)W oǚM׽ny_) c mTka YqFEGsQi${]yYbG4:|ђ9nFr_/0MDl'?W_rj+2mDsi!R{ /!4`Y|̱,lK"ݠq~} dzqk=|?*0Ջ;%4nRZ/*\ʊUJd&`[w7n~gmuq̞ ;̸[YZNXӴ 9ZclJeѷ͘ғzkc0{} 8A݆ŒO(8m@JpȎiK83aIP,)YB $9yV~}R0gRVqonf:XSJK2cs 5A a1ɕ)} 1ǒ&^,7"XAWAه WWT\*sP 䄟<*i5$[ un}> qnx^Q]m%'oS6pn$a֨eqZL:)XlvsM^`sS(/~Bc}\45xz 2&>.SRbCIƽK>r@@$I ;twʀ?$dɱ(lصW?꒔*; VM1ɍv孌$1Ctb~BO ,UH$%S|!aD|\;SaϮZ~}|X 䚉_\܌ߧQ=\]'Ǚ -c ͺ8~cD&bˬ-Fk@Lͬ5 ͫyv,@L}!%8b疔6:$VˋR 1{ PEonPPX4?)F*4{[1UҔTZj6&bNY /Ҹ\!X"薝*Oa)]~Z gΐlzzɣp * |i[bSvޔ/^_}yF/{nup;d_`O_H@B @@ Ⱥ6=[永UQ mr{Z鱫tYגG tiZ̝Sѓ!_Gl̷:&'yzY.ګr֫(_ޞYBh=݉DFfctKj*EFB\FYF"/]^Zy`zL4K3_g&~&|J(=B*+1&+Q")J2BQԡcg\]H$T13{dI;Gm) p\|QNމmli:%0vz[׾&g4xDCOEf`k'[O#韈0UfؼFKwgTR͂HW)3i4=_ۼ_qމ)}np8f}JeۻjNrܻtC|Jhܚ[:鹳Oi~dtSW-U%p͙ >k8xퟓ}@|%10zw)4J56F#( ']\ ˄YL1 0bjf2uY'_4k9\ e%q![2b z}VU-Cvt\fZ)Hںx 7Њa>UŚ)fͫ'%-)olīZ! L~ Ոt59y؉\e#J R2 ݅"Ȏ@tߓ"З4pDtz@LlIrb1(eXP^€!f9}ih%UH)PN|I"H*E7Ϳ8|R@ִR|TK@Qͧws1Ș޾}1푾@Ajݫ4X ;r{G=uObebbq Vq +toIF(Ҧ܉W~+!Үo݆Lq1߿ C!vtA{sOӖ9ó{\q*!DyG<{ ~`=nNn;d˷]?z/V7%*k_-8ӫ Qގ 6two8`a}EGWRgO},?~\l7`]@f ԙَ#7omXag sEqJ,N}!HY)sxDmZhպu6?NPfFE}H(E=̻;Ftmn>Xk %7f7mk`L8Ά5(0ϬGDۍK{NZ3 êR̨ q"9ZMn3T ˹\k:gcZ_8U|gij}8RGϢaUjQA$*"*&uTG_TVׯ婆j_iZkO(7jTKT3^ˇ) ʾZzuZ*,ů( }Ux4 s}1{+㠩L3$T18y`"JkxBm&ٵY@bZҦ??7^$*"z&Vή"M$ Vlj/B9Uѻ/}0xNQ%3^ے~{7AYף5[@B |BXں4p6o%BS{)pq11 ˍo+{qhh$B?85ߏ@֦i9ɬg9},R?[өǠP #+)N+0iƲY=Iz9ij^&| na&/HV~83۳oeS!Ӟʛ3Uw)[C{n)J 2SSy]11M͏^37Wn,[+aaO P ~>~nRO|V5ʸr_ ˑ[f2J.˹kFMnNmiՔ#JsӽwH$h[Y ӻ8V̯e)l~#4{{vnc*^)4硚BuUK*V9P ;()7M']y_ϙrO+.D!?A aWccYDGsCϛ蛪P;TZ{SR7λ Bo?pٓJITu 8pySrN"!_ǰӿ41%6-M!,~^BHh5`C1{[,xsB+h(S^]VDf•NŇy.;֓ ι$CvC=k+BCPaĎn MB:f޳R)ўSɒ̳Ou3Iӹ~7gޠ6tܐ _ao]%ޓT>^Fq7ji(O v#Y^r"MB"sUEϟf v!v{Xfs2a.j#ޑtl*'AG۹KWȩQB8n"q޿^SV8u}ltIm'^-NŠm!S/Wؿ*5aq0ULm΂;;Ռ  o6ur w']֬_[FУZ,|!KiG{ <`wQz~%Fs_ =;m'C,nM  X.6piu G/dW_ʑJ 7ڪl)u|~ =cBdko:|\d~.ȾzȊBzj߲GgޯՔY9{ݨ}Hoݾh;w^tK;6J$qot_Йx{xΔpd'p /۠A+.H:sŨbEMڄ&)WHpx>?-Zh{o'y#7.nmaS)(= 9>ZZ6K TELbhya>2tgl|'qsm^gwyٷ,KoLv@԰Ѕ?wϹ<ߊ=h=߰I=u)&t e S>m!~buKM:Qq,0>Sѻٮ:nܸs!!yΩ1S8B>)БK$#՘U<{n" Ͽ1nwN=Xkzh:ss" ).Prt4/v5"~Zpru4ZUbt'rB;ŷ?1`pN< 1PN8}jrC>K~|o5؍6|LIG+GWn]YֺݶĴ^r"nJO104l齼$ V5էq$FCGG-_t &6>ƵOמlʃ盶&[ ܒx|#q]qSk pFY—K75Ͻ1 >x]Ԇ ]u!:O\+5)657ף()^S#1V|.Qs$_ 8g@0ى2Ң0;9EaDQ G05ah0jfA\%A=}!W]8̰4+p7g& K34qlٝr!6w035 Y~"!4`LIaZLohigCZ]3u0XYCGR.NjzVV|$d䳘o&3B8-&o⎵I qB 1ЎQMezJd 0nO YD4 d Eh߼ESž$70oN?Glo-  `H~Df~&:ÆkVpNū+zm޶ߊܸO%IͫzyQ#N]$ /r)ؿTu߭1$y,'\[@e@smlH%a%jG(810z_ˠHȏzqw4 vbr>Ƥı >eF}NТen+Ϊ(@B$GQJ/lIQpP3t~Àʈ -T bގ$=|=ŔmvV4a`8 )Y* d2RfkHj[7n_JQcCM|)kG4ìaYr'>LԤޡۉ9{Hƕs פr %嫈G__?r*̫v!Wz{4a;z4amiIYG7E9Zd chLS)(U["CrꫛG*AQ *Qpim('O`pA!M feӗq뻗 yl:՞ D  bXDb4+,PU )"_ƁQ*UbN=e}' BjّK;:!QQ&L{VYN* !ii_ IDAT`krT&0ߵbP-G0  x !a hVfY9g׷=vr(ao`Y*y-)#HUE2j,Xar?{ u,y\isusJW"AVӐ>(YI%C`KqTlnh(Ehj.aIKG9˜cY ZSX`9ΉIal:D,ol}lj1qa3YYfNܻυK [ug")2w'Ju&CApILay^N6់TQR  'QW,Q(r眔ɱX2>&%r z#hߨa Рzs#rWH}r٢)$E":Ym_AҁOYx0+/3@o~g5gzDiF5/'47AakD}rtR}2 A䈕ӧ칔A /_檞 Gjk]Bۀ{2q^Nt(V P# Yr˧JԈ) l4̀ĿٱLX ^cë91lR$VJ4p,YJc/#}U߻{LOl~pX޼!EMӬ<[Nm,Ǯ#PU0chZRf۶bK}Z"VU)qNM5iikaHy{Ɗ\&`N{y7oӸ )qeiN`GeI91aO,K%2XUAI Ȭ`ؐ=cKuvL,meY8va ,a9yj!$fY4w󲊽}1@*88 Gx2=FY_K($g2JXa5Иү۫;05c9q t\J2jyaKI(c*rZ8oaQ*[ϩXi @u2wU乯th0AkF[Yq!|:#a!Ӧ1uia&c]8fU_?XHtaU<9 5ՇECl֜[i8ޞuzǯ1r^58tȔ Ѳ[y/?]F#AX*;y>},n{F!ZRJ-NZPS)P]Ǟ9u"o- x`#Bܡ0+s:.E!ml0ۮ/D_xoWWf޿˨8˗i)ti%sBZQqDPd!"%"!F@(9u}}<̙ENyM&"i|!ɿV"rSj(mQmHR@0 La@.d (A'")P*^LXcT d(LT Q/5G'I52hy>}q^`ZUcȴG]sW8>7+>7S95N$h}Q~!!lu1*h{K,p̚o/w!!ؗ7o*3JQZ뉵_u̡ (_6g_@݃LͭHH$`7]tuRܼm=k7|߭s̗=uL'#UoFseo 1{Og6~,+}gkzh(u𽕁[Nբ@GgVh{QnkWE=<~RZ0hʋow n מMpKe7æ[S(rƃ9sCyM<1j m9"B ,ٺ^k2|Z^j(cƍ>tzI޿X<%7\w;zvg-[\_K&U9g뜬)1WXpV"R&iWu"2-Yl~e\xRuu H陋TmYiń rޖ@WBA+V,~O-} fN3DvjJ/ *N^25 '[0˻ |^?x_߹J`x¢6|?{h/r[\67ùCB)!$2YeYFDIbyT^_lYc#S>HM,.TW׊' f'%ݜ=V;rMM3ksݜ)mfv\1BHvv3!ܹs ˣ;E}YoyEŕpp<@6'*RYY_O6-444AwwؘN q1j!\8k1:YI'h&؈ ixjH3 iVLN L;cƌ{>4n#I4lqS}εjiJbG_#Y6?Cֺ?O+VX{OOBeBUMN>u_C[$΍A <}6ݞ?CĐ`VC,?_vyro@DJiSED!00p746S 4/v"N;\6|fdzr.C_Nޯ1[l ˡgKW.woQH>pRDCɳ d%jJ  T{)*PȐ5V%[8X_fà䬝Z]"% 2B L NY7eSS/.8[LM ʦeppLzΚol?[-zh|zEyj\6cM6c~>{10tKyl  #Sd3)r4u 862Gi\&WtטS5T'8]Ű*\Ap7 4sρ?_yR~Ձ8SҞԏy96T?* &'رiwzt@ #0)r%YQdHFCwQF~i{]TAEO;$aG,|$%A_W\+grpOu')c?zF~};֒NctPK~h^znq8mh[XKl;oL;zxΟK\ؾS]NY Du؛Y;.cؽ C}Cix,t^~";] CۿaV4"#D-!΃ħl01 rϫ)ښ>j]_E$8m^dJvvoq8m!DqTmYޠ}W>i?O2bWM"i9i<-%$eR:_nGBQ8Vc6pKF"ѝ:eZwRx05)rܣOZRr7p?>}z"֔dPxf7{پz$ݭ9_0O](= DƹNRwܓӰn!h f+jM IR_v63"ң%Bsкwn'd"+1ƽ ۿH>{M[0r`̀ %dQ"˨p;f@l |;QkdOV9Hx|~Ŕuޑ2PE Y'Zh=(,DfV7F5jʣӾ_wsC g+d:Q-żH y8[;mSE`׎^Z7?SGtLݟQ}\b˫H=ib[d"!fL2KmXuցNB;u(SSNM+SzY/9 <wH#s̙3+/7m(8v`vsbկ^[;vXq8ARN>}"x^p8\8kpp8}s{c\8kԶbD-BW & υʢD-|a#u3!I.!La0*7֨ADG MPǪ)! [}NAq4uGx͒ҋɵUppGPܾpp8\8kpp8vS\v'kwEq8t]VMp7aOL 1v&~<ƅiC݃X>B*՟޻G% CB(_Jծ?nƜv7Ƕ" 2~&exw[@f-'r+j:0ѭՁ֤J=SwTפP=82N:ov}̠>$"&@sf9[6G,Ko}[`.tJN->;yp<8l:zEDmXlZUuPzLns(\0' W?M;)2AǬ~>|D虫6ɳb*΄MMOi]<ꕛ~|1LVMf{1wWtH~L}yI #8 1^0! b׽3a.)3ոYc**5k]Il&SYd9\{fnn-v =gxDZ81NK b# n'-HI4:1lٽ}V꽍P[RYe.M?|4I͟;+4Ok!;ol"z;wsG3~SSR$XRs{.4d=cl:i}%7OCUkw;=4: mH@3*V=];b/Zm=埥e޾7;O_U_fT#E9] h,3u h{)]|֟)cpL?}N?c[=S;xރwu #>0\rX ;fPAɩLgL1zx$(rʜ;FiQPIc:ڇ;FjD)?WT6\n B^ Dr;an"Z.gB|%7 򋻼#UN$"*2CĦ̙2jHGI-\Ub*\oaUVE }N;sVWV} /<: d %[(V/!:FީCO2DE (k= P4+%㲔+j- 053X!j$/<_i3^Fi>upW){ Fl0>LU@F42BCxcIkjJa3<ƅùGxIG}s8}õpq8>ù+#C2IENDB`armory-0.92.3/img/conf3t_nonum.png0000644000000000000000000000044312414772654015523 0ustar rootrootPNG  IHDR$&9sRGBbKGD pHYs  tIME,WEIDATXұ Pi/S,A( FS=A4H$.хs{ a_tv$'H H A!gYQZWgپg0`bƯ.!H 8^|[/Gs^;a} ,@)0F̀'P>{IENDB`armory-0.92.3/img/splashlogo_testnet.png0000644000000000000000000006344512414772654017047 0ustar rootrootPNG  IHDRY1sRGBbKGD pHYs  tIME 0],6 IDATxwx\ysŢw{Ŧ.QPYՑbɱܫ$ȱc;훛8.˵dYVDIL5R(EI=cpHi>σ y̜;;BJT Xt{< 8i˪1SM\a( 6ie% KӴ&3: c^Jޔ%8B.˲._|̥K5Ӧy*DEe%UUi1 B1,ˢ֖Z[imiM }w[u)y oƵEW]s;(`JP(Sf񡇂/>|)mkmiJ)ç!|eezO[oq++ )Ȯ;x=@4])e!_Pe?~ss麮BPiկ?HG}?t[|"w}so^z BqF0_kXSBpKZU|?,()-U_KP(>tuvo|?)S&8>򊊟^dμy( Ňquu})<:SRZy |g) Q(1~n}{wWgcy /BwYyn/=Jl #@^ sZtOBZ8BҲu/23.  }uΎ+9!DMiY.R #[oa}[Z;;:ΓR6Lp⒒mXz΅+W*Q( o_o}twu-RNv}VQRRt%6 B•+oKJJVgsI7tܪx B1~ n⒒Q<-g.[ׯ/R!j Bq"4W\ٳc۶bm b񴺺6lV_PJTP(#˖u69rr牮FQ\RǟyFBP(NJ~A?LiqI"kq:,ZJQP(Y`"r3O !Ҳ۷זWTT( Eִqޒ%3?N^ ;ﾻPBP(R^Qw]|iT G᫨<} ߯JNP(,;uCpJJK{-PbPp8Fw0 B{-()- -!gwٳ1fHY4M;)Q(ﺋ^8PUvPapw?xMUUWMݦ ܿ_}5͍g`kM34u&TA)>rtmR"Ыkj56"R(MoE8@/YcAJD^//gt/ENUjkۛA K.\"Kٲ~ֿʐ{-)oqa]BT|$Ж a` 3qG*bt?BF(OSg8CYL*]PPrwng5t:.S%P_g FJphi"3&-o~vRreNWB]yR ʼn0Mg~^z7re] Y;xIʔ$S*dŇŢŋB0k9xU(IU v|)%{":4frjMQEPeY|_}mh2 {(_hsMy\4_}Ňiӧ{\.WVXT4RX*[o}$Va?eϮ]x՗d͆ ePR(Ni**+EaQtΨR%P X5|ocYVtoN-;CA$!ڰ{C:/KfQTVUp:gҲj**+U(d[l0~f21 t';`'3`a  )YUJ*ⴴpUcRҲr`@GZL =`F0|ᑥ2#;/v[VsW>JJ5MܺQ(iYqb#DC B 4HAt}k׺-æX]4m膡Fޱ7{h:; ò# c|GpqY̬shԊS\t C7!B18Ar7$Ypnt( }8L)F"%Y0%K)S;SSt:Ν{ڏf^"椹w>֤ݓ EʅHiKvs0ZFBmU¨!ԲjBF֭[ֽ;œ +OfȾ^30|H3J"ٗ)qT3vU`לUȊyh+℘4[^ /B"7yfcrq>ݔ;&$=tw-%dòX+Ȍt.0VC|Ӽ5OB B@4c׮~Z[;2Gh.#kM]I^x;ȁfW,˧$G8c1h:y_Ds]^Xr d˾gn P;Xf+NSEr@2i_?yeEv==ozR6nn)NFkW dVhXnѦP"iFewY;gmψp={__Fq +y_ˍ#22{3.F",3GH2gk8fG3Rҵ駸KPT/2kn?{wP^G15$Fp)DR4ɸi=xkZG̼y9+@uK5t˳55%8߳y0Ȝ(_5`w;`&NaDB H#t"=জ[KGup9't…JQQ%%%YBѿ=֔K !(U(rMx~eI^-OXhН{ڈpy1\싔Rn^`^˯ u^yE~|>^اG Mz\[YT %8 &n'nKuK"$ΥJDC=(" !q<"'kU551vR$C{kƙ{QRhc)@Q(QL0}i=dׅnXxd(S7RJR8VtÁ7 {|q~4N'g.[ƙ˖qޅH9˻f7=LijZbrV|n"PH'N<7>&R7 xB=myo?ҝd g,Y\cD\S[6|*(&'4/%]8-Ln'$m;̬9a)(,sm5Ji ktj %8%Mmr$BZ7ucYihdva WS5ؘi ^Aj IDAT}AEfAH)iL29;d]]cKDۻ/B BqBz{.LLx^URQcˮ|+ϭ˧SZ8(~ˮVy0[ww0Y>"H[# zAĸjy5n1twՀ= q9N D[7R-O(Ȅq{]Yߤɮ\TYt&>E,]kv{꽌htyBٕO0lqw{BU7C17B<&|fG5.Q{b yz/Lk[75ᲝCMG1H)v}),& 6j?>kH+@[<?o@%g0)/5{\\B bh7Xy\%4&}uk_po+sNT]B b-{=̡ &̖ o, 0tT}$ h\5q\uWe~4=:RZG1OGo 7az=@ɜ)ͯUAG1 PN[z#xTԖ(ģM n=*MQ3k}Ni ֺRDwҾ ÏD]h${>@pWK`3S91%UVs5fw/]?ݻ^E+=1((&D2J$SjC,Ⱦfney`8rk?(sayffy#ߨ8dH3N;#x?={!Lsd8$f9Ѵ3̸#:'9Qli"砝#F (JXx\jKB b H[n|t2tŸ_|tH`CH;ꆮcڌ0h]1&4<5da3V Jp]COG?pdO^é?&x_zv!sg?. }FUkCGbaFr&שґ%g`/' 苚1((&w4/ E, hK xC;"ϳ#?MG{ I3=fKpt4NH;9:%2" #/([q~Rܪ1((&9Uݼf25Bi:-=t_:gLe< {Zʖ=t*fcz.nR.{VQZ]av(Q\p," ީPx.;6i tEZ$VڢD,A^υ>2EQ^k<8Tj+;ڕ$-YGHI Kcv߀3ރ^8dɰ4PAG1\FU`NRt[`*¸A4LG]Z\%pƨ y{8hWRQ%ǰ3JO|yic$_Fًӌ-WQS(QLVTΠpWIS^yQz;'W|̤I(it;(.t`d=8| PpKXwI뭌[GIłW`$Vb]89FYuYK5p_3`O&^DDTҤh'.Džfho/ ,np:lLf| DMigЫ/C ̂ N kPBbΞ@5>wŻ$-RJ$iOfx&RSj %8)F˖Y%Ju3ۛ^>HҘRJ\'n!CBHUmx;./",q>vz%g߮S*:X}0LD%ɓ*€B pՅsjhoj# AAЇC6s%pBDzl]q\v62ַHS2J:҂l|.E_voƍZfN6 %8SҼix=mXw?b]hqx|.4MCĺJunۥph\z啬2^|Y޴~J-$yu p,ũKuW3L $b FTt²,n8Aq$>4M0Gkv95] qݼe --SBȞ9\&$!qhB1q\(?3,صc,ZY]87vn:pMGqkK/:3SwoTkgHLHF9j@ю2:N1dR3Exŋ}6v'(UT%U(Q|Ȭ-̸i<LG3{@&۫MeYMA AlH`\n!N ݦs-7u$ɜ\wJlJp^:Gyc<,=RJҦ$m%4twH~mݐcKzr*\vyu=7<_u|Xk GMgN3^8vo;0%iɬ@*Bh]@#V,;Ƭd`"qUlްW׭;Bn9|EʧPhR|>05 < Y5e!toF:BЍ1VU;K .`ETΖ-YwWpյ*Q(Q(J|{k8 ;:ILx$ tl6Tm@~>7|3sގ#Z;a쬳;>ch %8 dT\+#oӁmRZ:T"YHtlv=p8Xt).%N^]˲DZU.ĶiӺ=ZBq:sw;{VӣtƎfb/3!@)Ā%e mhp2 xO7ѵc]!-'Rw:i!qt+k).A 8XDZ)%~vƒaZESC/>,o_+WrW2kUʂӻP0` 5乊2^ ޝG+7W!`@#$i"L, $l.o's94 jƴ:> Xx1Ej(>484'THM`!E*vw3vSJ18bcILb !ܺL/dV&<;A=. CE(K/UFG^ͧf޽<ﻼ4q8`# 7@mp$)bĵ8BcI :}CGfs))q>5%.yYG8m޷YUEaG 4vd,ڤMkn*X4E܈bi2#fbdHiiK 8 fVR(Q(Ng+}*\6җ<#tIߝFhHl$4,6R"xDe+ ]wRVPKGh%R"b$Ցbm>^I0% eEf7RJ: uODTQ?]} Do>U\TIz'/Bcw4Ss#k34Hkǁe*F2%<^>B Baei*fMo{>ye!LM'r:U8M,[˗nuc((v,)^To&ڲi8I<$ap+xlͨTAG 1;p,wv1.b?iÙ0mEy>YTgoץ _GH6-9 p#9m|#TV(Q(yyo}]Ֆk冋0sB B0t+Y@EI>v6?yZ n\DEPv@3fV1`f~3IgUqdnB Bqr>7<^Y&{!%'M U,PP(Q(Kp:6>ֽ <6)s(6ۧVg猙U %8 \l+MCk#%ĕgQQPP(Q(rciuqɲJl %8 Pexf"4U BPP( %8 BP(Q( BP(Q( B BP(( BGP(ed2I2@J醁B'p,˲F"9KsNFn8=HJ&sFӉD8$ٷBrF)%x+FJI:X4J__x4,kz4GLi!~4 ׋#χa9XT2o7޶nN}TX4:H)1 ǃi9Wɤv'ʋ]Iݽ-6Fs̒RV}6s͛t{zxGHCO':TVUQYUEix}1?so{׮4Y|9K-ß+ ȃH$Xƛop\y I0DaRdf==tuvH$HӤ˲FP]3e7 :v/(¢"^/aPPX8TJJK߿&/漓:nb̛GiYEEYk8gv~x}>jT;ټa G()-傕+6M Ήع};_gyT*5Q@~>ԧt̽_*x|p !Rp8 8s?K/~~;z+ｗ V̙ʺu/DTVUqIpzٽk:p IX߅XuLOdH)~~`} /.򫮲_ C?U;@ ?3s?3G}FaQU|_-o$kGşooUiٯM8JgUN7l߶m)QAwn%Ljf䙋te޽y<ô gHi<tr[E_o/pU޵+6r* /ῇa֬^wط|կ:e գo_2?O=5kijlO4`x<|oOw8gm:x&p<籇Ht7OkNwnZ~M&~ДhӉ4MZW֭JHk0h4m`q;^FsWO62R N !xe:yFkKӉVxG|Ɔ1秳ppchuy:MӘ5gw}7-NF"!gk/dTou4RJZ-L?˟l޷g1kSŲ;H3,kٻ{i'6#Y' ~_šF05gzZcopDlU}6>u-YYTOY#n.o,XhJvTCضuhH6z|e:>R5M tMI %L1/HG,' __#?ӳi4kV@>NO4 ou.)+Bp:y B#'9vjNtg}i~}{z&lhNl\k:^~yt;cX=<#LԞX,}pIPFr.çsF?x" H{zz?t(+1ƋDk?Y=?s$yX:#5ǯ͙O~=vx~cS*6Xž={زiIG+b֜91V:;߻wgFx"Wױd32t:=!nܚcɲev=ufVW2䅵k<v31H8L}6q6#~FGkǏ GdedkX3eA=|nnIt|yb1V?(of>p(?x—5]7)H}=?]G<ϽYO?v*ԃKL .ȹd5MPXTn*D"YubuEԱNeo}-*VwttDb^x[~+G~^v܉ ϛ2(TUVzJ GoLzv6\pT*2Q_Wg`/8h₸dfdN3ץ,7y憡Ç{ԥ ]\T #d2* F:h4}Qt>EzZ gJRR+tPg:wƼ ٪9O)rs{@XhsҿW*f["sGIq1<_).] D"޽s'n,Ba¤I۔L6mؠۛ(Lq1z4 0Sgƒ,u&|5V^H$=CB0hP 'bĉ8FPhZJVB_DA~>rчʿw/M\8w;~٨ɾ=c~0*J޽{"zۅcܹx #s0z>z4ΜcMZsb@, rsys fΝ lߺUd~989;cGZEvq7WXׯcuEUu&XFGyn{8.^ zH E޽#"ۣWR`{N-*QQph7 yZZGK҉GtL0Ѐ[99(#,U3@&$ <"Bo [>TVTlNt={n1#DG#,<\ߨ,nt:D"AL\o.1y4׏3'yC#9C`SQlm޽1oR66pT*]UUy#\ H#0tpFDpHos\8J2 5tQ_;/V8V-6_yqݻs6m qZTVT(t°#kQS]:|knha9wASL P"[j O=Ȩf][7`V}  GG'2?^ ƃ,^33ա6lقD6p\AvVAm.cՃBBr 7N ~SdHĵ DKtRtt5[6<3HHL44v^&ݽ$[谏ӵ[7ZKCC>ϺD󃣣U߾ɅkJ2ϕ^䛧(k)f.s'j 0( .4^%yyBL_0ᱳ/Μ _??6p o<M^IIB@&a[o!8$ 9?VBp6,a?SOofYH3}=;V0⪧EwDd$d2oTil4YZZK@` $ 3F괆<T6EL* f8vWŔE*+bLGl9rlڶ ,U;Ncc#nglfc9K$ z4<..n}]c;]\]1et$e>XӶvByn {y ,.x~!=LaT*qq{ϞVW:tKqQN=j`/#zżvoǷ}JX8&ٮf~ ]L~^3-dž7f;"6ha-+Sǟk}\>0gHR3YBYOXBKÚ5 ve2wXeHe};vۯnˈ]e㈽dA3L֬ɓa؜HO4}y S#{wAט8DFE~a~T4-/]RiU:}]* a| JJK2X,i{xz"6>Gt) ~Q(n|0WPl||bKo$Th[|h CH|KjYYYXd -#*k( A!!hgF\0rW8S ̹O?:Nߓپ}1jX<ؔillĎƭ7BEzaق׽;ƽ k6)B 8o^?ުdid'1' EK9g*Ƅ>SI+7kvT*r'-6ռ$Kkkr]3s31Q߂:y|c 1U[l,> ʕ:fNÂE0et}k[fp(qUh4 ٦\II-82 ={".!5cSTؼqժ'~j5 „+ Y,6ئc]+.q؂(JJBn̲0&fzsLKWNKta5(0  ĻKZv0g|6{M+{]1iTDuQ8:ۼ ɉNCA0adBPzѣyWLC#8{Vke3hT*u~ 2̃`}u|N^ׯRSRp)X=~k1z4BBC*XܔjiXk#"Қl1_cft)ӱ 5vŢ%K${>s7&.o3;IR+w_}Y+͘ Ÿ_]PM?ox=Ze߀FKԟ`*{ϞIJa鉘8lߺ@ApDP8푙:}kBhM6kKVzsP]UF;EQ=h5K$L9M;_Θ=2 sOo& n4/oo|XY66p*+sf3S>n{CD>go2oߺrp-d-}GVވOLĀI0wc^|۷nEfF^wѣy_Z5( ^^3> SPso1kjjUfn{EP moh0vpDo3gbرep,ė_FMu5|5r5}_1119gUOK(yΜ:%o;a5֧ ¥iizNKߙۙ\w q89?|ΜydG6j+<()AjJ  J$!!1ѠD[AG wUUmoXVZj:y:X0sFP ]7lзn 3e 8ʿ'#Bھ))FiBdE6r<Z'c6X7\ֺwص*-0T*qU̚2*%Z3fFdT･LJjal,^lr5k-ԤƼw+CX Jh4&SiB3㧥 {qe^w?|SǏTX:wz  Ąɓ {bΙSpQ*NȄZd .E}=.[s0sLlmOzCȞtK/>燘8U W"<`!]э5]jBkD"ܺyy 梾wnd2Q,XbS>L9̉,YYxheo`6!e$I$[u!O`M(3;KkװmL6b~TvH"P(PUYsg0""״Z-jkj鸏3rsqQK!spH q>ZM_!s>ዕ+AQ:ui휣>?{G­7yBG)y$`hXNNN:EEȻw97nM@]]]D`k}kk'Z\|^F;92-L}ZƁ{1-.R)DG޳U*TWWcۖ--sb%11H97nXHE.쳏z<<}̲LD"@$T۷q1%ojJ{  ͛ L93E=? ׮^\r= Jig 5%:!c2c4\-;J\j< XYv6|2P0䃱&n#!x;')'N|k!WJOj4[Z/NȷAL%GL\ڬ!`B虦MZ!ce[.C!8ُ+iLqmp}SϡX,E¢YcN 5h+V-E')).ƾGEy9oC2&pssx$gg ?_DOĤS* )0(wf-LS`ڵȺrŬfΝGzrGDrߚ]Eۂ{(4, ÑfTfrm5p[+Ft7 ‚Ec?o8V\(/,DʉOTBZ[Cs*NΘ[X* cȰaˀX!2*^2S\n4>ЦEQE+*[s۪kƀ=OUHNIq1EZj>XM)K -Qvn 8|.gfr%Vq1GFpLp=quN?'O^ L&;s׮}? JJ5|B* ٔkknٻZ[*dL\s5c V?Qcs Lm2X[SǏYrk'jb<7pWŚY` cd3KłCȂFϙ,vg|!.㎸oݻejZbK/YW/gsr= ceС7`6&@D"]\ȑ6mooV'Vߠj0_Rck3$LX,@&Oa#G i+\hCG#$hqiSSUYiP]kK$tFR~mr0x0DGf3'B={J))m0-ƈHJJ\?<"li0m,'&ҴTpDpGJ Dl|<^{M|č?D"NLp"nnnIEb}88851Bzb憁C 6>o2)Z-͚ƙ}DO//AٹEK?Pr2o;vJJl%dHprrT*AA>jس'[QR"Bͳih,6[Kdg|bϮʮ:FmfŅ_j;|p DoH N;fVy~UCYL&\2~([˽\梡AP:!(8XDx޾-؅;Fg~aIhl߾ϟg{ A~ }TVTUUȽs(/ZXX,\.@}|www].lbstEha;wP\T$H!"2j >ug?*Aό3zhcXX(84F^7@O @ Vъu:]C[ Tht bDRV@ X H"EUe_@ J! ōjup=;r Vk3z2G")>ގ//7|8 s/>kv=ig P.NF鳧O% Pr2በju}Ue孒b }|}Ll(O? (BmM cb80ϝa%˖w>P*]۷k7nDA^~tz~sSFښ{ƌA\ι[l,5kP]],%OCUUV޲WTyyJVKti&h>f"׮Ecc#]}׿Xl&{N?"K/>GŬs}}{: q%?/OR \LOW<Tx#[(ױS'4e ֮^ k IISu=;+sLPX{VQ K?Z+Y7@ RHQu1=1O??xRDFEaݷߢCH)!];̜;7n۷y?e|2ߎ'`ggwh*Y\Tim/ :ÖN4 0 i;sW6?iIDATPr2.?ii/0plٱ5/]?-Ï?kqсLp!'۶Um+Wډ?_}9GGG̞7?r}1:/]ϿU.Ī+&?;vAwIMp(ҊD˙O4oY{xV2@  HAQVp w{R.].˕fnxgbJNFd&w+^tC;mbk|8RZ}*+ȪJ^{M?'3@ Lhs۶zNw¡(JP(a[9=v!߿`g>}cXFWOO|_|aqtt{˖am󜧌Of @۰aB_{ >|ŊSgvǻ)ӧcxr+fݾgN?'O"?/ J%^2{v4u*3z/GטfOAt 7yaO=[_F@ ee0*5w.d`.˗,a͚55_T8"+WBA0JJ#:4(f(TWŋxquMulei4Y9"/oOбS'2@zv6w#š\D:cD.Kt].'#I TWgLLY{(Ee3lXV%I NZ- VYZR2Ϙ1p@Tz;'gyH.@ 8Y8o^휜uJWSNVQ^ݻ6[@@ L6[װwrBFp >$9zy{_ߢz'%!icoU0+ *{SQ^>Ϟ9#L oΞ9{yB`Ӥt JKwcӆ *2dӆ )(+-M(P rH$bj7xNâ7߬ݳkיqEo¡YѡcWݷϳ- `<Ÿ#*o^E([pyw%'{Gu@@ <ܺyc +PRz}}~ODn~~ۆʕrorw {%L(re̎/9g;D@ <( |reWTWT*ZL4Y;r΋/]1c;F4@ .Z֯W}UTWU&C8.wrr>iTƏwܵ+`\z{v۶eBPl.+-7EQ P8 boo@+ 2DI`ooO2@ <4 Ξ>۶U9tH \R\Q(j: | wv)841 0P@Bt(+-EqQJQ\TD+^ Œn3P8 cGD" tFoX`OL @ht*{\,jsn5(R( i5IENDB`armory-0.92.3/img/armory_icon_fullres.icns0000644000000000000000000063500012414772654017343 0ustar rootrooticns:is32@:Ub[476:8;PRY]MPPKZC'46:@jGBDX^]h6557:CdZNNO8 KKXZV39=5BSRG?<-RTSIC<532AI?8N8JE=85;OQ>8<46:<)_WZN>9;639ZqE8>9[?4<\WM08@98@`XQ>:@9&EbLCH@::оO_527;8,¶j^765465ཷwK`c`54¢n$)<+02=75+-+.254'k:@:f^^AW 28np~z|q(,2>uhrH]h-J{BM~urnVG_uxv<.1U~xrI=BSXj~wL5vt_?>HT7j[l'D|q?>IVZZVXoWL{r@>BR_d[Uuq_wgp??==K`h\}6-;_ng?>==:>S`5731B ?>?>=<8K675<> 6J`aqwP+[i=Fnba_g25# DN@rr0u0;½3!/GӠYp%dX_ǚg&NܹI'/u# |l5=>M\XVCH2Vh*㩌ή Q8%B 681+U >8:4F>h!׆/5s8mk< V@ik+Bv"4hVT/|&SXe5u D+i]>^x?il32 5A3:OWMffd5 464;;6;T^6R]PedYdcdc5 =;6A[W[]UPIk`]^65 6>;3Kg[agROPPMPT_Yca_Y857>;3Sf][VJFGHP3MVe`[XA/5548?;4Qh`ZVRNLJB<=?PO^i_\Y@5c4:?:64CX]WRNJD??:MQPPSKCXe^XUX345=?:6525DSTOJFB'x7_[SBKuDW\TRFAEB>;656526DLJFA=9;=K>nTJWRNKFB>;5650=LEB>96rkp+AKOJFB>;53AUTEB>96P376>GGB>;D]<47IXVWKA>96<68756=A?;<9GVUXVUXTA>96-9776646:;3E#EYVVXR>@>96B7766554559698Ž)U*5_bZ72544;@>:622ľDabW65459:7[ľn\b]25456ƾRc`]^S5/+4˿Kl_]eN56þw.4Sb^_\5a*+(&9USM5x'**++"13 5Σ~5/*"Izx )*5%\h5 1B0czluo^v5 655mwpiߎ^K654:rxed^ju>5562@wx_p~~^VmT#561IzxYjzuvx^_ZyW767/P{wV0T|xxt^|_\l/16czwM105Y}zfr]X_]PGZyj`y|wvD275/8^}zwstfeWI=GRSb}zwu?35575,AxywspNPA==ISXXZi~|zwtn35543CQ_~zwsp?>>KSW[]\`o}{wt@47IXWSo}vsq?>?LRWZ\_aafryxuvUHVUXV[xwsq?=@LRWZ\_adeglstn~ FYVVXRBtxsq?=ALSVW\_acfhjlrruq^RXM4?{wsp?<=BLSVUU\acfhksq^7@60H}vs@??=CLRVVY`bbfihbn$560Putt?>DLRWtU[a\TS]at(170Xutt@??>ELRWZZ]b[SW]ayK2-cutt@??>FMRW[^_`_XW]ah=_xss@??>AKTW[_adEXV]a|z^Znyz@??a>=>IW]^ace;U]bpI5Jq}zj[tl@??>>=<@P_cbddX[e9.513Np{wsmm@??>>==<:CVefef`i7656506Qos;@>=>>= ::F\hhdo.5 650:U=6=??>>= <<=:;Jactx563>= <<=<9;Pm456R]w>=<;GZj5=<H\b_]o5=;;<269P f5 4;=:70Qb[`b5 <=:7562_^R\^_[ccd5 ==:82Si7[YZ[WPLgbega5 6>=:82Vf`^_bVTRP Q^Y_^_^^_\5 7?<:74\f`^[XPNNOP EIXfaccZYY6549?<:68dd`^[XVRQPKFGIP QNZgb`]\[V954:@<:77Zgb][XVSPLHIEMDP N]fb_][WUA.54<@<:744EZa\XVSPMKB@AB?P Qfia_]ZXV@54=@<:75525FX[VSPMKHEEH=;;LROKIFDA?<:75*645IXVIEB?=:75k.:56?JMIFDA?<:O;5L3:PXVWPDB?=:75R297756@HGDA?<:;955364BVWUVVWHA@=:75>687647?DB?<:;;558seXVWSB?=:7419876 47=?=::;655D^UVXJA@=:7>;876(5447:;8:D`DSWVVUWVA4A@=:88]76543?/X\\]VXQ;28C?=:88765(8?RIUYVW\TYWJ5459C?=:88866765;1/7ZbTXXTI6694464;C?=:8877?@6655684:`_\YPDR?454=C?=:87576 773?b^\YWTV;054?C?=:666f98772Ed^\YWTQM;54AC?=:>B698772Kd]\YWTQON745 CC?=:;<98773Rd^\YWTQOMH>547DB@=;,:998774Xc^\YWTQOLJIC96CD@=; *q;98766^b^\YWVSQMJGEC=8;86+.5HPh``U45'447:86785Li`^\.56 5տYXg`^\][5-@bea^\dM5/5{Ȧ9iba^\\Z56ü:?gg`]5t5/*3Qca[[^5^/.**(&6OghZ5S.-)**++'$95 !//+)*-(1^]*(.Cg}{xvsru_`^_[RH>JRQ\w{zxuvE265*63/Ci}zxvtrn[a`WLB=>LRVWVb|}|zxuuC35)66/:l|{xvtqpJ*2D?=>?MQUX[YZh~|zxvs.5 645IXWz~zxvtqp>=ANQUXZ\^\_n~|zxvtN.5 3:PXWSezxvtqp?+>>=CNQUXZ[]_`_cq~|zxvtt]65364BVWUVVUu|xvtqp?>>=ENQUXZ[]^`bcbht{{xvt258seXVTa|xvtro?>>=FNQUXZ[]^`bceffluxvt=55D^UVXKszvtrw?>(GNQUWZ[]^`bcefhijosurtzDSWVVUWV@:wyvtrr?>HMQUWXZ]^`bcefhiklmypV XQ;0C|xvtrr?+>>?IMQUWVY^^`acefhiklowTYWJ541J~xvtrr?+>>@IMQUWXY]cbacefhijf`ng5694460Rwvtrr?>=AIMQU[_Ua_`dfggddfp}T560[wvtrr?>=BIMQUW!Yifbcffgb^beuC$65561cwvtqq?+>>CIMQUX]aX\dcbbUZ^cdzH46553k~xvtwz?,>>CIMQUXZYZ_^cgVUVY^cd<0566r}xvttu=?>>DIMQUX[]\_cc`WVVY^cd|X7/<{zxvttuB@??>>DIMQUX[]dhacbWVVY^bftL:ryuutuA@??>>AINQUXZ]_a\Zd[VUY^bh}iJWuzstv@@??>,?GRVXZ]_abcebOUY^aluR[{y|x\H]o@@??>,===<=;=:=<<9>Pcheefgb&656613Le`Zo?>?>=<<=;9@Ufifed5650*#*n>9=<=;9CXhfgm5K>pp>=< =::EYn5;77a=>>=<=;CWo5=< ;GZa`j5=<=IW_aa_^l5<=:IV`abb^[MPo5<a]Yabad`h<=Eha_exI==K[aa52Gϟ5 ϠSߜ5 4;*Бޛ5 6/ݦ܏ց547כڋrrqt^܀561Cmځوrv܀܂5 6.S_؀ׅr;Oހ857+gYՂrvj݀L658*|FӀr tjt58,ִ11o!Ӂr&skz:9786&٠-7*6|рЃrpuހ'-*5_ۊ*884)=Ӏ.rstrrq|e6sޡYt*75583)FрrtvqsuF >ڀ\-75,681*Pqrlsa" aX065*78-2L5K"65+645KXYgk#53:PXXM'{Ε85364BVWUVVSς.58seXVXOx΂$рJ55D^UV"WWMπDSWVVUWW>Cvڀ܂VXQ<,SS=TYWJ56,cFٕ569448*vЀ u658*рЀ]O7557+рЀ[3766/рZE*476рЀ ˁ9'Dр/k?%]ޮg%;ܱnՔc%O/+*DŚD(81)Mj>565568/+W͂525 67-.b e6577,0ṕ ӆ5 75(  56oK΀1҈56E9:(݀ڋ5 =݊5M5P}bi5|ܞ$`OPd}h8mk 0njY<ͷ_<%/Ӷ(*sBp{ \SN`z85" j s)K:6*[`6W?i#?!g b93w C@9S:\e"ZF oA ~-{='] ^!R<@.el"28TQpmhDI"".8[Qw5uT7it32_5+$9@@>52>=5 6I9AI<;<<;5.4:?;<<:95 4;>=<;;:87785 =>=<;:87865565 6>>=<;:98756545 6>>=<;:9876/>6547?>=<;:9876545;fyf549?==<;:98765453gdeed54:?==<;:9876557Bb_cb54=<;:9876562Piccbaa_d\_5>?>=<;:9876553Whdcba^[^]^^]56??>=<;:9876554]hdcba`_`b\[\\[547@?>=<;:9876548bgdcba`_^]\]ZYQJK^jnfe5!49@>>=<;:987663>=<;:987662Ahedcba`_^]\[ZYXWVRTUP EE]kldcaab5%4<@>>=<;:987662Hjedcba`_^]\[ZYXTQUTVXSP OQN_gdcabahW`5"=@>>=<;:987662Njedcba`_^]\[ZYXWVVWSRP bfddc7`_``^5#?@?>=<;:987662Ujedcba`_^]\[ZYXWVUTSTPP Refddcbaab^]5*6@@?>=<;:987654]hedcba`_^]\[ZYXWVUTSRQQOMMNP OSffedcba`_^^\[5-47A@?>=<;:987655Xkgccba`_^]\[ZYXWVUTSRQONNMGILPOVgeedcba`_^]\\ZYYZ5 49A??>=<;:98765G_hdaa`_^]\[ZYXWVUTSRPPOKCLKJPNYheedcba`_^]\[ZZXUWX5 4:A??>=<;:9876526K`fb__^]\[ZYXWVUTSRPPOMLMOIHPN]heedcba`_^]\[ZWTWVXZV5 4=<;:9875!6528N`c_]]\[ZYXWVUTSRPPOMLLJJKGFFGPO`heedcba`_^]\[ZYXYZUUVVT5 >A??>=<;:9875!642;P`a]\[ZYXWVUTSRPPOMLLJIHHGEDDEPcgeedcba`_^]\[ZYXWVWWSO5 ?A??>=<;:9875!642=R_^ZZYXWVUTSRPPOMLLJIHGEDDCDECPORffeedcba`_^]\[ZYXWVUTRO45 6AA??>=<;:9875!633@S][XXWVUTSRPPOMLLJIHGFETBABBAPQejeddcba`_^]\[ZYXWVUTSRQNI45 47B@@?>=<;:9865634BU\YVVUTSRPPOMLLJIHGFEDCCD@?PQI:@Wggcbba`_^]\[ZYXWVUTSSRL;<54 ;B@@?>=<;:98656535DUYVTTSRPPOMLLJIHGFEDCBA>=PQPD:969DZfda``_^]\[ZYXWVUTSSRPR/5447=<;:9865!6537FUWTSRPPOMLLJIHGFEDCBA@??><:;<P9RM>:74A.5:G\da__^]\[ZYXWVUTSSRPPK5355446=<;:9865!6539HSTRPPOMLLJIHGFEDCBA@?><:;:C09P9QH;;3<ӏ=.7=<;:985 43:ISROOMLLJIHGFEDCBA@?>=<K989:7P"QOB:90Y{6/8=N^`][[ZYXWVUTSSRQPOIGKJIGFEDCBA@@?>=<;:98543=<;::;76P=<;:97544=JOMKJIHGFEDCBA@?>=<;:987750P>QPE;:0S¼Z-29AS][XXWVUTSSRQPONMLKJIHGFEDCBA@@?>=<;:97535?JLJIHGFEDCBA@?>=<;:987556P?QNA<56{½K,37DU[YWVUTSSRQPONMLKJIHGFEDCBA@@?>=<;:96544FKIHGFEDCBA@?>=<;:987656QRQRI>;0M½-C768GVYVUTSSRQPONMLKJIHGFEDCBA@@?>=<;:97544DUMIIGFEDCBA@?>=<;:98765*KNND=74u½++;86:IVWTSSRQPONMLKJIHGFEDCBA@@?>=<;:98<538MXWTIHGFEDCBA@?>=<;:987655?IF=0H¿+,;8875=<;:99;.53?TXVVWNHGFEDCBA@?>=<;:987655Öa/:8#765>MTSPPONMLKJIHGFEDCBA@@?>=<;:99>65645GWWVTIGFEDCBA@?>=<;:987655ӳI498766@NRPONMLKJIHGFEDCBA@@?>=<;:9#53:OXVWOFFEDCBA@?>=<;:987655Ŀ΃8757CNQNMLKJIHGFEDCBA@@?>=<;:953@UWVIFEDCBA@?>=<;:987655Ŀ.:8759DNNLKJIHGFEDCBA@@?>=<;:95646IXVWPEEDCBA@?>=<;:987644Ŀ+;87649EMLJIHGFEDCBA@@?>=<;:953;QXVIDDCBA@?>=<;:98769?Ŀu-:87655;FKJHGFEDCBA@@?>=<;:9543CVWUVWQDDCBA@?>=<;:986Y1:87655=FIGFEDCBA@@?>=<;:99:5=47KXVWJCCBA@?>=<;:986C5987656>FGEDCBA@@?>=<;:,6:5JXVXVWSDCBA@?>=<;:9864987657?EECBA@@?>=<;:;;:557EXUV WKBBA@?>=<;:986-:876548?DCA@@?>=<;::;:QWZVUEBA@?>=<;:987656+;8765448?BA??>=<;::;:VXMABA@?>=<;:987556܀j.:8765 449?@?>=<;:;;VWWE4@CA@?>=<;:9879:6i19876545:>>=<;:VUXS>26BBA@?>=<;:98798765459==;VXM7357CBA@?>=<;:9878-87654369;;6;VWWE44649DBA@?>=<;:987987654643:VUXS=35 4:DBA@?>=<;:987ހ388F?876543VXL7365 4=<;:987876547GQqoaVWWE4454=DBA@?>=<;:98667876541(45a`a_VXS=354?DBA@?>=<;:9889776545;Nvs_^VWVXL7365 ADBA@?>=<;:987654 55/Qe[__]\VPokC445 6BCBA@?>=<;:98~7;:76565 3Wc__^]][YZ[V/,235 7DCBA@?>=<;:98765665 6\b__^][ZZY]VY5 48DCBA@?>=<;:9878876567646554:`a`_^]\[= XWXYW54:ECBA@?>=<;:987865655B776553?c``_^]\[ZYYZVWU54=<;:9568 67656876562Ed``_^]\[ZYXWTSTT54>ECBA@?>=<;:99:8 645568876562Ke``_^]\[ZYXWVUUTRQQR5 4@ECBA@?>=<;:962989976562Re``_^]\[ZYXWVUTSRRQW5P5 BECBA@?>=<;:98͂6Q9876553Xd``_^]\[ZYXWVUTSR,OOQ5 CECBA@?>=<;:9876556]c``_^]\[ZYXWVUTSRQPQRN>5 7DDCBA@?>=<;:9988987654:ab``_^]\[ZYXWVUTSRQPOON>-548EDCBA@?>=<;:88997898763?daa`_^]\[ZYXWVUTSRQPOONH854:FDCBA@?>=<;:*29 9::98762Dfaa`_^]\[ZYXWVUTSRQPOONLP545 4=<;: 98762Kfaa`_^]\[ZYXWVUTSRQPOONMLG;445 4>FDCBA@?>=<;:;9876 2Rfaa`_^]\[ZYXWVUTSRQPOONMLLKD9445 4@FDCBA@?>=<;:σ9876"53Weaa`_^]\[ZYXWVUTSRQPOONMLKJJH@745 4AFDCBA@?>=<;:9876$56]daa`_^]\[ZYXWVUTSRQPOONMLKJIHHE=645 CFDCBA@?>=<;:987634:acaa`_^]\[ZYXWVUTSRQPOONMLKJIHGFFB;5456EFDCBA@?>=<;99:9987673>ecaa`_^]\[ZYXWVUTSRQPOONMLKJIHGFEDD@944;CECBA@?>=<;>;98766672Dfbba`_^]\[ZYXWVUTSRQPOONMLKJIHGFEDCCB=735;BCA@?>=<;98766672Jgbba`_^]\[ZYXWVUTSRQPOONMLKJIHGFEDCBAA@;635=<;9876672Qgbba`_^]\[ZYXWVUTSRQONMLKJIHGFEDCBA@??=9547==;8447;=<;½9876 5]ebba`_^]\[ZYX%UL@7334=<<;96448:<<;:9876659bdcba`_^]\[Z[ZSG;434545=HLJIHGFEDCBA@?>=<<;:975457 7987664>edcba`_^]\[YOA634535>HJHGFEDCBA@?>=<<;:987653 H987673Dgccba`_^][]J2356546?GHFEDCBA@?>=<<;:987654"sB;9987672Jhccba`_^][]D36547?FFDCBA@?>=<<;:987654$M.:;87673Qhccba`_^]\\?35448@EDBA@?>=<<;:98765z30;987664Xgccba`_^]\Z:45448?CB@?>=<<;:98765' ^,4;8776 ]fccba`_^]]W75449?A@>=<<;:98765 G+7:7659beccba`_^\^S45 459>?><<;:98765+7-984>eedcba`_^\^N35 459<=;;:98765!j-24Chddcba`_^\_H265 469;;:98765 J/Kiddcba`_^\^I26569:98765 k(Siddcba`_^]\^65688765!E0Xhddcba`_^]\[]56556!26]hddcba`_^]\[dH5326ʧ (vwvuutsrqqg}p562Ezvvuutsrqqpoph561N|vvuutsrqqpo{e560W}vvuutsrqqpnp_561a|vvuutsrqpp|a53i{vvuutsrqpqD,l547qyvvuutsrqrl:/y53=vxwvuutsrqse54562Ezwwvuutsrqt^1;_NQ561L}wwvuutsrpuV.D^_p5$60V}vwvuutsrptN,O^ DC5&61_}wwvuutsrqsF+[^ ]bZ5$62h|wwvuutsrrp?,h^ ]n;5$7p{wwvuutsrsk9.u^ ]b5+3;vywwvuutsrte53^ \g5.62Czxwwvuutsqu]25{~^_[n561K}xxwvuutsquT155Z{^_Zv5-60T~wxwvuutsquL165.8b^_Z5,60^~wxwvuutsrsC26574.h~}|{zzyxwvuut|js^+_YQPSREIRUVRWrxU75Icy}{ zyyxwvuuttp;35630Cn~}|{zzyxwvusrssr^*_]UOPRM@<@MOPQSTUXYWVg"~}|{{zyyxwvuusw[1656505T{~}|{zzyxwvuutsrqppq^A_\RLOOG>=>>6=> =HNNPQSTUWXYZ'[[]\Ze{~}|{{zyyxwvuutsm53?TXVWSp~~}|{zzyxwvuutsrqpADEC@=> =JMNPQSTUWXYZ [[\]^\\i~}|{{zyyxwvuutst?5645GWWVU[~}}|{zzyxwvuutsrqp??I?> ?KMOPQSTUWXYZ'[[\]]^_]^n~}|{{zyyxwvuutssr53:OXVWSk}}|{zzyxwvuutsrqp?> =@LMOPQSTUWXYZ#[[\]]^^_`^br~}|{{zyyxwvuuts53@UWVUXz~}|{zzyxwvuutsrqp?>3=BLMOPQSTUWXYYZZ[[\]]^^_`aa_eu~}|{{zyyxwvuuts5646IXVWSf||{zzyxwvuutsrqp?>3=DLMOPQSTUWXYYZZ[[\]]^^_``aba`hy~}|{{zyyxwvuuts53;QXVv|{zzyxwvuutsrqprt?>3=FLMOPQSTUWXYYZZ[[\]]^^_``aabcbbl{~}|{{zyyxwvuuts543CVWUVWTa|{zzyxwvuutsrqppq?>5HLMOPQSTUWXYYZZ[[\]]^^_``aabbcdbdo|~}|{{zyyxwvuuttst5=47KXVTq~{zzyxwvuutsrqp?>6?ILMOPQSTUWXYYZZ[[\]]^^_``aabbcddedfr}}|{{zyyxwvuut{tt5JXVXVT]|{zzyxwvuutsrqp?>2@JLMOPQSTUWXYYZZ[[\]]^^_``aabbcddeffeit}}{{zyyxwvuut557EXUVWTl~zzyxwvuutsrq?>3=AJKMOPQSTUWXYYZZ[[\]]^^_``aabbcddeefggfkv|{zyyxwvuutQWZV U[y{yyxwvuutsrq?>&=CKKMOPQSTUWXYYZZ[[\]]^^_``aabbcddeefggh nw{zxxwvuutV YJk~yyxwvuutsrq?>3=DKKMOPQSTUWXYYZZ[[\]]^^_``aabbcddeefgghhiijpwzxwvuutVWWE4n}yyxwvuutsrqrrq?>2FJKMOPQSTUWXYYZZ[[\]]^^_``aabbcddeefgghhiijjkqwxvuutVUXS>19v|yyxwvuutsrq?>*GJKMOPQSTUWX[YZZ[[\]]^^_``aabbcddeefgghhiijkmsvvusstVXM743?z{yyxwvuutsrq?>?HJKMOPQSTUWXUX[\]]^^_``aabbcddeefgghhiijkklostvttVWWE4461F}zzyxwvuutsrq?> @HJKMOPQSTUW(XZ]]\\]]^^_``aabbcddeefgghhiijkkllmmnpnnsVUXS=35561Myzyxwvuutsrq?> =AHJKMOPQSTUW[#HX]]^^_``aabbcddeefgghhiijkkllmnnonmVXL7365560Vyzyxwvuutsr?> =BIJKMOPQSTUW[XS\\]^_``aabbcddeefgghhiijkkllmq:VWWE445 60^yzyxwvuutsr?>=CIJKMOPQSTUWWXWX\]^_"``aabbcddeefgghhiijkkllnqnllmVXS=35 62gyzyxwvuutsr?>EHJKMOPQSTVWd^W^`_``aabbcddeefgghhiijkklmljoJVWVXL7365 4n~zzyxwvuutsr?>EHJKMOPQSTVWVVW^_a_aabbcddeefgghhiijklmkimhVPokC445 48t}zzyxwvuutsr?> ?FHJKMOPQSTVW#_ca``acbccddeefgghhiijjildegijklV/,235 3=z|zzyxwvuutsr?> @FHJKMOPQSTVWabc"ddeefgghhiihjkhcfghikn562E}{zzyxwvuutsr?> AGHJKMOPQSTVbcdeefgghhijhbflfhjjqdK561Lzyxwvuutsr?>BGHJKMOPQSTUWWVWbcedeefgghi]`abdfhjiv560Tz yxwvuutstss?> BGHJKMOPQSTUVWXdfefghic]_aabdfhji{560]zyxwvuuts?>CFHJKMOPQSTVWUVVXegihhc[^`_abdfhjh561ezyxwvuuts?> DFHJKMOPQSTUWYYf%goUZ[[^_abdfhjis53mzyxwvuuts@!9?>?DFHJKMOPQSTUWXYYXYg&UYZZ\^_abdfhjjSޅ65 7t~{zzyxwvuuts@AA?> ?DFHJKMOPQSTUWX\Z'X[YYZ\^_abdfhilS75 3@EFHJKMOPQSTUWXYa[)VXWWXZ\^_abdfhhpQ6562B~|{zzyxwvuutrrs@?>AEFHJKMOPQSTUWXYZTYY[*V]ZWXZ\^_abdfhgtt?76561J{{zzyxwvuutfls@?>AEFHJKMOPQSTUWXYZ]\,VTTWXZ\^_abdfhgy61665 60R{{zzyxwvut@?>BDFHJKMOPQSTUWXYZ[\\[\]/UVUUWXZ\^_abdfhfuM22665 60Z{{zzyxwvutu@?>BDFHJKMOPQSTUWXYZ[1]V,WYZ\^_abdfhglE0365 60c{{zzyxwvut@@A@?>?BDFHJKMOPQSTUWXYZ[\`^2UVUUWYZ\^_abdfhhd>0465 3k{{zzyxwvut@?>?CDFHJKMOPQSTUWXYZ[\\`]^AUVUUWYZ\^_abdfhj|[905656r{{zzyxwvut@?>?CDFHJKMOPQSTUWXYZ[\]_ba`EUVUUWYZ\^_abdfgn}~vR514:{z{zzyxwvuusst@?>@CDFHJKMOPQSTUWXYZ[\]^_`a``aEU\VUWYZ\^_abdgfr~}|~oK21Mr}yzyxwvuut@?>?BDFHJKMOPQSTUWXYZ[\]^^__^]ab@TRRUWYZ\^_abdgex~~}|z}~gC,4Tvzxxwvuvt@?>?BFIJKMOPQSTUWXYZ[\]^^_``abc$TSSUWYZ\^_abdge~~~}|{zy}za=,8[x}wvvu@?>@EJLMOPQSTUWXYZ[\]^^_``aacSTay{u@?>=@HNOPQSTUWXYZ[\]^^_``aabbvdT%UWXZ\^_abdffdLm~~}|{zzyxvwzpQ3-Dfzxttut@?><==<=EOUWXYZ[\]^^_``aabbccdde#!TSSUWXZ\^_abdeldD2/4603Pw~~~}|{zzyxwwvusvvcB-2L@?>=<>HSWWXYZ[\]^^_``aabbccd#ebHUSUWXZ\^_abedptR8/26656506Vz}~}|{zzyxwwvutsrvpf}r@?>==<;ANY[[\]^^_``aabbccdedXSSUWXZ\^_abec|X075640=`}{z yxwwvuttsrqppo@?>=<;CR\]\]^_``aabbccdegTRUWXZ\^_abecL065630Ae~yxwwvuttsrqppono@?>=<= ;= <:=K\ba`abbccdeffgfa[[^_acci{356614Op|xuuttsrqp@?>=< :>N_cabbccdefge`^_acbnp065 6507Sr{vstsrqp@>>?>=< =;9@Raebccdefgdaacata/65 650:Xsytrrqp?@@?>=<=;9BUcecdefdca{ f/65640=\tvqp?>=<=::EYefcdefda 75 631A`ttppop?>=<=::G\gedefcb5632Ddqkqp>=<:=<=<9=Obhedf dag565#p>?>>=<=<9?Rdheef c`l56]bxt>=<=;9AUfiefb_r5>=<=;9DYghefeb_y5=<=::G\hhefda_5=<=:;I_ihba`5=<=9R^^_`h5=/<:AU\\^_a`by5==Q=<:FWYZ\^`a ]d{5<;MUUVY^ab`]h<;ANSSTY`a b_^j<DOPQRZabb_^o<?NS]baX`cD<6NLMU`baS{<DIIMZba<MUQ]ba<Pdaaaaaaaaa65575Ѐ5 >w5т568,рЁ53с563<р̂560JрЀ57-\рЀϱ57+pрЀ݀57*рЀ̌Â57,рЀހ561рЀZ#ރ564:рA*݀݁561GԀрճ53݀݁57-Yցрؠ+@ހ܂۲uSYߑ57+kЀрڋ%O߀ހ݂گrtՁގ58*Ѐрu"b߀ހ܁٬rs@?ގ57+Ѐрa!v߀ހ܀Ղ٨r pyj݋56/ЀрO$߀ހ܀ۀفإrqԂ݉549ׁр?(߀ހ܀ۀځفأrpy߁߂܇561Dԁрְ41߀ހ܀ۀڀـ؁ןrsn߀ނ݁܆57.UҀр ؜,5ހ܀ۀڀف֜rsl߀ށ݄ۄ57+hҀр څ+65tހ܀ۀڀـك֘rtk߀ށ݁ځ57*}Ҁрp+85*9܀ۀڀـ؀؂Օrtj߀ށ݀݃ڀ57*ҀрZ-7584)A܀ۀڀـׂՓrsm߀ށ܁ځً56/ҀсH06582)Kڀۀڀـ׀ՃԒrq߀ށ܁ہڀċ56ҀԽ:465 680+Vۀڀـ׀րՀԁӏrspz߀ށ܁ۀ0562CҀ֬165 67.-bڀـ׀րҍrsoށ܁ۀځį0569.MԀҀٗ,7577,1oׁـ׀րՀӂҊrtxށ܁ۀڀdf5 870+-xҀځ*75 75+7|ـ׀րՀԂӁъruxzzw܁ۀڀ4855772+.KӀҀk+7584)>ր׀րՀӁчrtu{~v|}܁ۀڀܾ6*45-+@pӀҀрW.75 82)G׀րՀӀςЅrss}w3 E}}܁ۀڀپw96`ӀҀF165 681*Q׀րՀӀҀ_σrqpt~\S܀ۀڀـ 㿻ԀӀҀպ845 68/,]րՀӀҀсЁςrqnnwt9bۀڀـՀԀӀҀة/65 77-0iրՀӀҀрЀ΂r oknx^ *p݂ڀـ؀րՀԀӀҀڕ+7576+5v߁ՀӀҀрЂςr sqkipq=8~ڀـ؀׀րՀԀӀҀ|*8575*8ՀӀҀрЀ͂sohhr_  Hځـ؀׀րՀԀӀҀՊ)7546BKՀӀҀрЀ҂ oqqjdjnADـ؀׀րՀԀӀҀр9538M[RpՀӀҀрЀ΂ b[^am_"W܁؀׀րՀԀӀҀр5 3?TXUXNӀӀҀрЀ΃+4#o؀׀րՀԀӀҀрN5 645GWWVVWReրӀҀрЀ΂2 ׀րՀԀӀҀс53:OXVXMӀҀрЀ΂ׁրՀԀӀҀуБ53@UWVWT[ӀҀрЀ΁/ڀրՀԀӀҀу5646IXVXMӀҀрЀ͂G؁ՀԀӀҀтЁ53;QXVTӀҀрЀ؁^ՀԀӀҀтЃ543CVWUVXOyӀҀрЂρtՀԀӀҀтЅ5=47KXVWPӀҀрЂρԀӀҀЇ5JXVXVWQmӀҀрЂρ ՀӀҀтЉ557EXUVXNрҀрЂρ5ӀҀтЋQWZVWScՀҀрЂρ!LԀҀтЋVZEҀрЂπ#fҀсЍVWWE5ҀрЂρ&fтЌVUXS>0?րҀрЂπ'сЎVXM740LԀҀрЂπ+GЎVWWE447-[؁ҀрЁρ+,ЏV UXS=3557+lрҀрЂ'c̑V XL736558*рҀрЁρ*ױލVWWE4457*рҀрЁπ&ۂ݌VXS=357.рҀрЁπ"܊VWVXL73653ځҀрЁπ&û݂܉VPokC44563<ׁҀрЁπ!êށۈV/,23561GӀҀрЀρ!݁܂ۆ57.WӀҀрЁπ݀ۛڅ57+gӀҀрЀπ߀݀܂ق57*yӀҀуЁ߀݀܀ځف58*ӀҀуЀ݀܀ۃ57,ӀҀуЀр݀܀ہق؋561ӀҀуЀ߀݀܀ہڀ6549ӀҀтЁ߀݀܀ہڀفs8561DӀҀуЀހ݀܀ہڀـn756/QӀҀтЀހ݀܀ہڀ؀I8757,cӀҀЁހ݀܀ہڀ؀6,6757*tӀҀтЀހ݀܀ہڀ؀ٽh/.7657*ӀҀтЀ-ހ݀܀ہڀ؁ެX+08657+ӀҀсЁހ݀܀ہڀ؁ٛJ)385560ӀҀтЀހ݀܀ہڀ؁׀ Њ?*4746؀ӀҀсЁހ݀܀ہڀ؁׀x5,4AӀҀсЁހ݀܀ہڀ؁׀ր ޹g/-iЀҀӬЁ{{ހ݀܀ہڀ؁׀ր۪W"1|ҀсЁ~}}ހ݀܀ہ؀ր׀րՀ֜I<сЁ|~}}ހ݀܀ۀ ׀րՀԀΊ;IЂ~}}ހ݀܀̓eրՀԀy0"XЁ|~}}ހ݀۱s@++.aԁՀԀӀ ڷg''gɂ~}|ހ݀ȐS/*2776,1mՀԀӀ بV!.n|ހ݁جm;)/686576+6zҀԀӀҀ ʹ܂Bm|ހ $-4875 84*>ԀӀҀр΂Rszހv+:5 673)FӀҀрς΂kހa,75 681*OрҀрЀρ΂ PހM065 68/,YҀрЀρ΂jހ<365 67-/eрЀρ΂ 7ހ26576,3pρЀρ΂  T߀ހ+75 75*9}Ѐρ΃  s߀ހ)8574*@΀πΆ3ހ)75 72*Hρ·|ހ95670+RπΉ ހ݀5 67/-[ϋ&߀ހ݁577,4mI߀ހ݂ߟ575Ώn߀ހ݂ڠ58{ؑ߀ހ݃ܤ5߀ހ݃5;߀ހ݃܁5 ]߀ހ݃܃5 ~߀ހ݃܅5 6߀ހ݂܈5N߀ހ݃܈5  hހ݂܋5|ހ܍54݂܏5 Kܑ݃5 _ l}y 2ptt{ploxxUtejxm5`^g}P~n9t8mk@ f:s vaPH8"oY@N ~ `E1,Kez  a\-kAnQ)9S%u  "X;s 8<XU'&@od+qS2z 9H`#cB|mO6 b'>3i  w{hF"''@p5cLB-Q`$cD#"Dhl bG'T!?]7x=&fSR+D<r" f(VuA'~" {] YY }]@m%5(1)vQCC18fi(Lf8#mU mt2QSe8+1(5"JFoid Z#?oAaM*)tJpjE $& AjZgF3()|HoiF5&(6vT_#8Q`m>~%#e> 8DXQ, umR(!#>8XNQ umeH(J",>8XQ6m#8dQ5mf.,VLbOnm/%L<Yric08B jP ftypjp2 jp2 Ojp2hihdrcolr"cdefjp2cOQ2d#Creator: JasPer Version 1.900.1R \@@HHPHHPHHPHHPHHP]@@HHPHHPHHPHHPHHP]@@HHPHHPHHPHHPHHP]@@HHPHHPHHPHHPHHP ߂8"SYx)Aݍd~cW0Lnrbߋ24.QlxCф..Sl*߂8$ćO Keg;ڄ 2"ltّ"3Ŀ]B[ . :8b߂`TNe\3qGqRN|.qD^l#'ɖ-tU-FQH'\T4fܪe_߂H| USI4z 7ez Bi~Ώq&%jxfTeŝN瞥/.gj(~  wua$KlO0 x-kPhq̇K;WQ001:nAY0ljLsJՊH+ T.;chM)aQE- __tESv8[5P;99]Β\U&TndφŰಲt{9<@Dyi>7j7lj.Cر5^Se WEI}\~A%feR7]sG`?Ţkח.H3Oi4ȁΕmh?O2DĹAYr~| \+ׄ_W ϋzuѽ0Q ? 6)ʀ=hB g3g~ Q$0,ɟOG>{ ҏ`zW(K_cK=|i>,rOpn>3a3ck #e >nIuBQ {}&WFQ+ &{98 %'?ZiV'YJTHP0/1TuCkF#x_%L4YW=qlߚ-O$`9]FH( =5ŲsC;OFO-aQ:V>nP+=gevCMe#Gq{%(6dg|.{:2,*>D"1XG1|sYɯ) T`u/3 bxq*D @ ?zc*L$C?" `=uSWğec܏3','K3g Sil7r9ePmPꊭJ. eΤoMҢWt{0MCw0=m'`NucG0N>0>rL;䊇4w)50f)Q@j1.- ؍zsHڻU5NaV*cuTArt]WxgKEp8W¼8b Y$zM,/dP=].YTjVvr[VF>ƤشO [G^_5WDց. dHx-]EQ-p bp D[G;1'p7\Zu&ŤĞ4RIC*ϥ Mr-HZ/QKA7\@MΟ >fVE.Y>LNncp < Hn[Qk-P GhD,8+ / <5B?7Ĥ6ReqGSa1!2NlYhT֝^O8ʜV_:RF `ſ]rLȎ#rY*q*'AFYwwFzn/C#Qi=sGfh(L69V8o`'gm RѪoVOΥ(+}KC0,Wj!P:>Z-ԏE`Ȱ6ەp' ,k_ԯIş 6#eqFfMre8Ik`iVͩ)@ &dNe y|PjjXkӖ_!_,e*Iٞd<Ucc3do7T#o駿޴嵐q'lľ1_ NI9ub.:DD!7Q}D920Y۱V @ zb~gNc~YPICDh$w+ZsqH.AA _Q :KMi-+sC8)1X B@k6I”nڍ;iHUD4ŭТ=}Qf0۹MyE>,՜.?ȟ?;0AzH;;Z5[ּFJ5Nڐ.&j7з `X26u% {}K>16;u[*{'u>xW`OP3YV֏|aGS9N]-6'WS]d3z٬ B_h߇;]pO5\3- &ꘘ/z2Umu#eq79|+<%?ul;\,ؤ=o/K>P٩cZ ]'Ivv-n/FJ9r0ֈ;zⰑ1qf5)ni-v ~׊ŷNB1u6>|PQ+G7NP?<&X OA58rH@*C4Ao9Ga#;FP㯚?T_ 8y $J0IGC~MJiyD ͩMFg`jߏj|sb 5õs)hiW+Gǭ/,g0U bKiZfG mepۦAY*1%^<a+g`I%-vZ!w"4/w="8sT>jԡCk(fT_CT(Ak?)(;0CyћmxMiux]w'"ӽ,W%}o.guAZWHyѻgPm;OI9ĭk-%ZL\#c@>$j; CSiYRB/wo ø> jJ'l ҋs Yw|*'4Q"X7rBM/\06)uJbϟore~oLj/~WѸ5neg--W6QK<G,N!PpTa>j55@fd/ROL."~ysGBhN~~cO.+993$ԟSSL!g-Av&94EG~<כH-Gm8L؄} \B;`)Ha2IQ?εY ?gvr-)uHGBVwEVD»+B"3) ^3Ż0-0#qԐjc6A *~I-{U/erFnW^𣏡eq4p|e0 7I}wD^TLKxjh#FRKm;A`{w{+ԛ+dm<碒q* q3*+ `(ܿoGyQ$"&[P95V`y/b e\4hv=fX:#pY}@|[Zm~f!C#ӑi\׶]3DXrF+oɱ*] -\%-WhA,it]#WOl^֭ûl$0ޤ uk"e аUâw?wXh06ȭ۩f {'[8.@z9 T~.MLOV9$#ƀruY8!cW2|#ԞU zy,6l0=Z<,RT>FUqXw3V&_U|~zeU·NPBN ±Lw"7+[^hA=?IO2/1&|УG_~ > ^vxH~3n;c!?xI`iA8,RUFla^-9L) EI7h#^GCن~{9tX~˙'>+=G/"1z* =ncOcz_}lh#acBEf ]7hdc˭ў; Ot]]}aȟQ$l0זJ䢿 /7EnV6ｦS"Dq^dP'JI5:uˮO!9vUPf)@r: Dj.G1h ;:H"Iwe\E\>yO;چAѲ C]Ȝ3l+ˀYt@[_ǰ@v!we8F\ɖqm.ea)*"e醹d)ӊ@ lQGIBuɏTz޾B6蝣T3cT( i{)MJƼ'popk7v]2;x/~$4SD\G>1%1IX5 W`)9yPOflD|B-9i'XG;uTEʟB=.:R}FLx3+C#\=@Le0.-lԳ7( [H.ct}]SpHoL)g8pkVDlm;ˆ}B9P<='B*KNYnI!hZR[L_YT*ȶlf*6g v;iO; ដa'H#saIkXI=kqڈEh9sJM8wD 9?ׄ T}n't/>F/!Q"_aSnp25-K9#aXĄvsOK\i3 7Lͧi ?)Jn)-|=;&PKg5KNO6Pޕ]d誶5{ln%<أSvȍ>j?5 dx={-c32Xgu~Jh$[9Z*G^Eԍ9r˗NBdL/ҔPŔuAOؔ{ft1(8{~o˰tjcF{HװG:͙.rۄO($W,ix,RI bo1;tt,H5ha|`\X]21K l E$gS~O`rF`G$f.rXŇFâIo|_#:ӈz?_5̺v(8_\{tLdWInʅ_+[+$S/X޳[:.5C6+%N!O9Jљms=Q=KNzv,1Vi$}5,ʃ =1@<տ` ^ʲQznovŔY{mCAS:\BdX*lB!71,,KxfWO!wqƀ͋lɎF(7:sd۬DvZvj3k+dq4_ڗ(l)5uVn{疇9U&uڙ!nT7Q3t$~a-#z? &N+m( kNrTL/I9W릀5M$P@r:]jHڊxv+׆/|[1}ڔDʣ|SUodp6 UZz6LH3HY%4^ Du' Z.Nc/ # _7ы,jzFcs[O0ne10up` !s\@q;H|s߂ uoT)I.0YJ(̚Z0t(-0g|w KĜDI(T\zmR)|O^=w#W9 j1l4Lԁu"^#mޣDñ%<C3!>6p;ɃwF{x9gr7C#Q{Dv;Fr+M*29)ueF;ZYGCu:<"~[}$0"0aT9Hu+ܝ ]E} d&;8`oX>fN;]=#Cr"*HF`5ɄDŧMWMbOݗm~8rX8%j>G2IdQuN~oiG;oh_'F q8C8 4(%UeBvHW2R%oWhsdyJ2[@qGjqT(׻m5cMͣ,ADk0 U dIEcPSA |(VL+uT񲕷qWF,"J7|5M΢*~?I w*9,S=#.{v"Oqm< n5 6b?h{l4PԉU[A$j0jhz/ٹYAR#ΌlXFk !?u {zET&NiHb߆ZbS? ;/f5B젯횫ce%a?4 )*b{M I\YenH_eb!QtB>opfQpL8zUPyJ?`GBsd$2p?z#nBAτr9eTSTqǑ0:~٪Pb*6W.<335D^[ 7JvU[aKA~8iدc=zS&HPI>G(wƀyF>C9xNHVgi$yd 7 4ۯ+9MrNb~q͆zS5TAT8z0c\F9[ {VBY5 g-3 B(.ŕig%\/>H3ҁf jh\bsZئ̌ ꯊ6`26!$/pP(,T3Bw{ֵ1ظC{G9\bXWx(PJv!Za.ފⷫz?(R$6qT,g A<~vsxpJOl_V*4Bj=Otf~yJ d u͍-¾bh KߘK{!}KWNo&Qݖz?IJrU,O'ʺ]<4Т)4UJJCϡſq˶l{5E&hKa]>L)9O]ݕ7>g&N!K%wEsC"dsk"5SaGIӂSE߸UgPCvـ݈ȶ rHQr? 2&;xlkfcV ͆͠7hV }:@xU ^Ł0وS3E*WGHWQ-ՇT 붏Xd˧{*ew쎵/%vn+=Dޟ0vږ^Q}8jCsưeWbc_,uO"~1zD1+s!+hd)|ļ=h294-Ҥ3Wdl_(wY*U.0&t. |^ןT9.ú-IF, Y(GZUʔ -X 2XW DԩF>,P7 *f}e7U='FtV~|tsٞ՘cM_a&]Ī.h|QUU]ঢ SidvX$7Ą ርtmy W s0$I5Ma OdU)elUvFɮ=/g/1xPl t!NkE&_.NG}] Ht-t9>"ŹYB!us:%yT씊ہ' ֔{DsP >{ze&? .@wY=Дr@F|>8Un~C-5$;M=`"7MV:`Q>+b'(vm"fGܫ|s̿VrUȍP(ƦAx([ o6gHe.@CݞOM/mLjβ{c` ,f-sؿpW59la\+fbmeN aeVoRq !א &v -T Z1r* at\ئh3gN&  @|EI]5!A`o3%ZoV2Cv#L]Fy{FX9MrߌȽas!2RdIpDоgM0`褧'q[_D92qѺ'QD+PZ>՛ +OC H7w(,eM@ : CnZ˽W5:jW, g3;>,UK|[^AANrE!r~J{4g@\ܲ 8 t!w: reЎɇea#+Ki햗1< [mSF:<~!\e3 Nϟ_Q`1ZEvccO)%C:\qM&J!j \J6Nca*Ѵ<+e ֙%iǯ=;sw} 8?S\;PW)GLHZ~JJ:PPШBF՟u7O(yAD0 idvxo0d>]4W/"HS߲_EVe=6@kDʘbh@CRĞde@じ~[x^"PE}y\>sVm=L.hܰ RIĮwz(({Me+b{dCHAo&?&B bG WOP׈BXxV[;lyiO'&I>8FZ~? -C)ߛr42sw -pJ (LK'qgD?jߝ]$B%yp&kuL&0C6C$byh|KԤ3{lp8jg!堐(6l/:̲X@<%lV,h3 GYJ}*w'!Tp+ݝiċBhBC+1j8rdTQ~`2*3`4y9Qo{E^lKd&Μ 7I^5jUWyLjJOq=s9l*:,Jvp>Gj0-Mi d77z٘6+WGJɳ͗:ke x7ŵ*]Dd"xՍ^{lBM$2 hB@|[yGMY"[R3]Il\kG g #97H҅Stzϸ+8kрI:uMpq6%_ە-sQ-հ.*B. c mƅm܁w)ѢH'2Pcn6 j5fimU э恬vo ݰHٴ ) v#XPyU#^;&87 ,O( `.>K9苂C C'a}Bcۨ[fKLZajtSY> E}[hpGw L)/\ؐi:e&1_cuz-)Gq4AK*;S]&iX{df1Kiu岣v\#*k}$ixm}㊛Y+͈}tJܱ1 yS&7 <&{x;y].諈Z,ujhHF8|„];=}Sr!B}O?h3:T{.y+PNG +C"`4Շco;X-#h8xc͒k z ҅}[9Qd|;pѼ9ǞI%Xz:~Z<3j kTkgskp{>c?a>L\ww>ڻ;\%$/2>1X / Å@We.HUӗ]4&؋5@!H0YH>& ^C',^clmC]8j,^A 6 `+|bZJ98+B;:Q;Q$;]D+ˠL{w$A#DC&H2J Ș|7fwRO=^bUm0oMAøeſh-!. AsC..ׇW1# 1KaM V 4%継0Ј4̞vČ A,xMVt$!ES~CDxum%O]'5B͡w0m6,jmոLAvVᢓ)֓Sonwl6C nˊͣ2 ߾B64Gw|Ғ,YPs -QT2" j}m̠qRV[嵎BwmEXmѲ`AWaHqYx\q=s!2ܧ[W@ v…{ńtC'E-Tr(\o&JcȃJ̺"JN",G'Q=õLL4tUٵM; K=1l"ͨ"b(TbQNS@?6:VP#[ޟaC"pc 1Gq6C_&T~UsVsn!_v\kB tܱ|VLe'E~ DZf%R%4R}ْu TDYlxHqT$*Y_vx,:T'0xyl! Zbj~z$cy= & l7@0OdM<>gۓ\vNY\rIHJx(D5xą@_ , V1Sj(Ֆn䀡xzw yDΫ7H\ ~CX{5˜$\$j0M\ a񁋠U)䷏J! Z/ '~8,7{M02,Z1b4S'ZԎ$zThx 5m#\1ש\\H!BgX,xON by]7={aa8g82[bdQe!9-", &x=H *Fؑ Kn'U;SBTf9X;XZ'r!C-.Qq+ i6n**zIqL]W`I]Hq%iÞXA~%مUW”AGU |7-qXi~m(AQ_C FMgG?8-`uSt9gՁaμ#6w*D4sO[㯝ICtXK'zV\t㕨ez:Aw {PFz-i_2Dؗ`e/Dխ^8:%NIZz\S芼s%G 7̛/XXmMsڬc (-ܕi2xI219,@ ERsؾBk70~9kL9LP\L ӬBx[T kH[h(0|}%3%Bf^0Z!>HN?I8jg!61, :^&1"Voeأi< rGqZJWV+s+,>ŅbцYA`z ^{Bwx kq4|kxQRө]|K!҃OBg˸-.ZP6"g3\bᖲ s5N)SssCAkHhv6ŤtJoY 6nBY\3ХdW F >[Q^hϰ_*IgCnsMxA)Þiqhb\ 61 tR'[ot }Ṍ+#)o]EO!pqG2ę)0]gч *xS1c"%O}N =zS/v*%+zFE{SP U0b-%%ӎ4R1`G/H*$ZƪX؊êHj8zR7co[HP2HnO22鷃h  E+9!3F8CSa)8L_XHP6NS *dwjkݡL g{ pѮZ.+*BKsiH43g>MɏĂ 65`7L+GXvZ[b^֏jOI?ui6,kaGZ8PkDLL`Fo8w*prQfqqS΂LYE:VG/ ^_f88(Wm'_pc >jk%7Hl`|E9-W6whtV.B ,%܋U]2|y 3:QunͩϮ'|Xs @AR@U/TI{ܴnyZ& -Bju>!׆ld TݢǶhi:GVGHoL,xоS-1= Yɻ8Jz#W":Io|Lġ¢Uq=\y8 GF ={۲0KOIYlO&d5hwLS{y%{UnRrY=Ċhj ĨۢEaRDnBÔSwXX2g Y~h߮=KW(jF c֭}ιx뛣E0nSn9Tb[z-VCo+JQ5Mʃ\dg{{]XUm԰$ jCq<j_!e6bz}z5)✇&5\RUP6@ Hxy[Iw?bŝrRO_GX$4v_9Ve{1joXw[Y?h|7ycX,t>e4Ѳ>-ye8VC 8_yL97^_ڼhޞ֚%ڼokt Hʓ"ʷq,fS4\RG_?< XNEHnҨȿQH,>IRf^H(ivE§;BTM2#!fV}kQ7*ݛicvjz-+ U{u;*VaH:8bt86e[q"p"8FêʆpW90yO)sȩSR*߱`z( _o?R%:#G;l78P:> }ZW\=k*A/]=8x'*2O UNWrϞZOMIqF/^N7`V=agn%ӡi<2p_s+_m1fub<{tJC5|շN@8#Y^FYJЄRUGBEܟ0QU߂@`7M-y*#| A{+/f@x{)͙ ̗Ĥ - xNoDϑtѵI`R*n%M˖/&g)R߂NqTCmbZx40,ɈOaы*l>:Z_Dұ aD,7FB9jD+.e)qL wF\Kyі[HjyjMx/J^'C鱧f?* SȽUMĺqZm4roDU_?*؁`PzZFx|<,Y]=Q\2), ࢝eIj!K*FªH,FW1Ri1^>QLA& yKM;α 6;JT)p܁Z$0>ѲoNnsIEdU2~f2jE}X8j>ҿw^B9(eHd PH-BŲ<*vr?\5M GQ3Uw hq-r>,w,#=YLƧq)+4Z%X.|5M=f3egwBd@@uӚ>-*l PL5Le361]YDX# nsyvwrCCDE?_F@s+A ltj“*c* T=,\55cyod&}3K6XqsJ3’:_Ђ8{ڀE.IW737URG\a-cV,z1'#٫|vk8pBCVE&ҖLT~V"Q惪!~wy4P5e*]0ӻ VrL$s6cxɧu1HAZ?{̣ZXSghI3 U;2f_΢]ݛèNS~B]&Χ#ڙu܃ãԢWmḞ(_ _X>zdϹ*x~f|l5̪'<]3[:0%Ӿʠ5ȽI>\+ 4:DHwqW}+zW R3!3]aeNÇKl{X+(5rz¿UV"C Bt Bƙb% Ťi~񛁬bZ>,ޒbaZ"7ƴV#*L/QغZ .A4GY?e`Jw2"ˈsJ*i1/Fk՜*:̉xYA48˄0'EN&rt7mָG x93/FpPczePrU' xqw a.c9\+@4MW)b,AkJA7:}#)S4X#sor<Mnh@"R|#0cSJJ7nAīGv_̍p+e(t"1zA]Z>0;nS`o1,qM? 8d&ʄ[b(ObQUz۱ÏZ]t'/J'ZߟrS?NqDѓ^s[N mȇuj:E1X G1o|@3߃dn6ff&C&"j$Lϲj˨iJ6oHE:$U~5;Affw3hܟП'}H1pe: xupt m0("6yUs4c"4[]81܋P\rRRrSJX\_eϬY bNJs3ؑJiO ;G| ѤjK#u~wQlvUy:~x`0!|?wI#Y73O$/hnhC* 0TȏP6ݚ#U0du2 7w>趕1!tIoEt=7$IOm5D #icqP?!@lh\9_#L_6x 2P Rn+,=O+qtYum47E{R5bЋg!N! j8![>(ύ .?j;E(_/~em1()HSs@CcŽHS-RqP*ԓC8l; X${% v5WX2ZCvfj5ſU$` w`ƺ8]~cd3a랾\ǭd|`m1Ju-GU2gY] p jґA?HV WFai[q}r|r{GݙNo w=xV_;b鰬LQ4}8ovrWY-B q}5T/b9Abp3Wd;A- maRIe+ FQ+4J͑4{p?-E&D̝P)?'יy8( hN_jЊy'H{FX5C^%:VRQ4b(H#%lz4_%Vp}㮀xct rMGXNEo?ɥCh Z쏛*& t5B;6K7' Oj4vAp'܈ig\L],CƅTA~ ˄9B/_ɣ?U[Sc)NP=$OU+37~Jw9cm*z*b5>=W(7ߡ*$W&H3ZQQwH6m]nOW!D;?[onH1"|rt' ,s &*MrܵBr-CvW[tgj8q^&j!c8}BcJyS_ފCAeju=uMtfB1ZXuy F<O ЌTǍgCם:1\}tny$g" T  ߥcuV9Ÿۣ)}']?ݾq?m۔'_Kc1kGWF{SMEi ,k*_l&3W&9.CFR~'^ Js:![1ݮř%CE' *k:9E3t6HI>.F n v3@^4}5N6ۖr Gd OFЙP c HcE*Q?,õI0Ӓs 6 yL/>~pzηoAen1#Zc_b&bHps/E4:CTp]y{dRb*NiU&kMiX®ӂ!<<Xb-mL"䩳dԠCz'[G6f%qɷJHvÿ+c_/Y4Oer6* VG{__q{G?\sWڒpDYeed县Y$؃dVM KI[э)aփܫ}{à[*` Y!bc ".׊3Un6c}ITyuXwkFVxٽ~=Zՠgn/ tmk3T$,$6+.ZL-<-g0VjҦW&i&)ʢ<. G߇QhG"ּg1w;s(s,zjΑ@Y5oCF`9"jq*~ M*)Po"}]V\7ӎCoԥ?Eavy5x?󍀏u $V/qhb;Y1*@j!LqW%  KY}㮒rr q^kly Cڣ ̍GsuOНtwpvf$ȎX8 Q ׃}WQv;wgjnMh-iqO[T5#OWs5bhm>A3t7f;]Qv:>C%JY|)*7!xݎ~)xQpp[ni;TܭHOIg!nL,au|mʨ}ZE6ҹ` dp pb=Dh1 \}vɖf .ufvwUqcçpi>ulU?=} ~GؚDx!r|vY2]e@FNG^!P1z>^]ηX1#ߏaDzѱHD|^co$LaWfe$Q4#aodO^ΡǨZv1H&v`1[1)Cg;SpV^_'[DX}.ď/b44Nl#%:bsH;/Mʿ9o ~k:7ߖ(ٜCyr߯ q^c^vi#і1 )J8DЁ(lL2DXιC^~}L8|KP]3ƚEQ"8QW6o<+j*_&?`qEw/3 <L޶^Տ, )Hoe}u} al$|YTYFiaND+uy}t9^h.Whx{bWw8?ز;(1e%~.P;ʉ_1x|l4VBwQnTx˅x Ibl@k #?tzx7W糊8-^ ,11@٧}*焊¨ b"ƙk2'^,#8ȷ/#HLfP̔YT"f'Lf`9ZVMR1w1Iܣ+AnHpt!/P67mOอB*I崯22|"[Nķ&ʇ'׫عض`F3}^߅sSybyi G[WKJjNG_v ɖpM_3jUR5m2CĽg1qj1wI#,IaQ Ucu ,&Ɩ"/|^ѱ& mNke&õ3l :}syhhXID(sCAڙdf Eh\j`tc]?t7-GmZLc4tF$Ɵ &Vs-bPi"/=έrSk% +n:!`b-,v{^CW dPzHIl۽oy'6öS! ' 3Ӣ%>1ҵ:48ib\1nDd/lR`kN ͭlۦCsa)'}K>iHP(tt{YI5gDi[ؗx_cz*S޵a0敾BnWԧ * N@Ubo5@iǧN)l g~1wamc/JE0^uz[F%H54D7NL=w#<jc&mHLOf/mR˅-'VP! żAb}HQ^!?RmdH JK^ϰGvR{QGyyqM[x1Ǐ``g=R`l}Xu( :^q&e=@)>o_M QZP|d ) DNJhGc,o Q2?H/2Y>0.[+'9VTSwi Bo _Rяy3Z3aI7k!C̎NruG,_fuE7!THx3ڪղߨp<z֔BFw~LN O)!B]|ϓc Hy :eWv\{QKIp?'E&CŲrPH@T fZTs#}YKH)BI?'@է _>S߸%YE²( dDVg?ѓ!=1<7`g`310 OL_C}>yoA)YX!1;xP 3 - `Fm4t>8 tY"beKZB J%nʺ$f >!7ߦ㺨a/oF5LGg,p`'wmݕ@B/v683d \u~8Czl 4~br`gÖ|0'mUKgP$`hB"JSS~ɩRR0ʚ'sP0ĔȈr-R~5Y L0À^6ʖK8_&W e͝ å@dAJKwaAVýk-M$i)ZG6 Z z!5A mD"0cң3Y~KEk;̵غ[L0fFT0{Tz;ۯYp6aLUzo;6/P3c[G1*ebI9Af7q0MI+ 6*J{635X6$Q@&Ce;H"fOFQ.#4^Ÿ Nh{+!LA.m@Ƒ 'yiS{crJh$VMm'~;G:4h]3hͅsGؾ :ɲv'0Vs8%? tvBhq64S jJ90ڧ[<2,BO9];||:Xdcq}}\_ xdcHNW K*0$;* J٢Z5zInTgw|bPg \cA_fGIi4eDS&-9(bB<^ ">I9$(\ؒcqy>fh,zC/|uhxmh/d@]M42 YVۡ yR_ |N "?`gn J9&.bQb0 $ u2q ^c:ty B+wF ]yox$M2\7!ě{4o! !iMƿ& GƫXMS*Bm~}F1`WrPDT6cBoH(PQ1N 21%YQuo֣k G>`2%_.\Ǧ#xBA,rco͚D!aiND[Q'+v~+LX A658A#kSƙ]jA~1ص ϻ)e9\/c\z'4 ۚ @^z@3@<$mH2V%/W S&뛐(.T8xN3?6яs=ei4\6ʐPۤټbe;FDo[^"+gڕj _+\t7!47m~ DjVG4L຺Œ\v^8 SGEV筗Zle!ZZ5b} +ЗXࡂ|ϔOeqK`H}׼֎XTEEVt."vޫٮGzJ&]7\}MK&N |X)2s4fCZtf W3,DSrbXQ"dh-Xlv>ei*K6nG'<܅=E.tIM)a.z\zš_b[m&r&\ƛ}QUѥG[v Gоe3267-Ii>ܜ3uW|I+gw_F Ta:0?=d)p!:b\w4;dĤxJ[2$X@,ЅgF\}]`Zp5b/CxႦRc!q=e|;!U#{7ޑ szJp YzRuU^#< (Wu9+?Xo0'Ps% 'p?ŸʩՔ.9iɐJ/pNtkT^+r͋A®w$-`ŇzX].x suZhӳ-fst}Vl˹cY 8qvܤ7W񱀅_Reᕢ6?㻷G{Yqί9NaRg10KttR?g)[@rx]7~;ulLÊr"h%g@C j0kؙkX(#E~7I PB_m)T~iIE@QH*w ˙D& AZ|bޣMAR *u/ U?z\z8JؐkJA#)Αߩ}B=B |^Wlnr3'' %Tb~CA~j u鞫,ށx#O\MJRnoj`,KǑ9:pDxV BUX2^!K?|5~ldTѻq2T}ؘ*o@vP/'xq:90ohgG_a fj4+i.Qh5/W0\,L{b/ (T/D޼tg4bqWo'ӵV V"Lt)T@5uWɿ| ]^k );(p2'rux cp:RmAa"VVWTy k(ZXhg#\]ytŲ\cu&"}$4Roy8pϏѲȋ 0pHLU2nR-z \^kR/+1LY<]Ӈt" RnA"./#P7(Pw/)S6jVnfE;>Op~OK,Lc;x]*aGS-7:Y:2F{#ޓLކ?TЗ3ۿèp o ɉ|qY;Ф.!7d쫉ost= %K>Hg)IqqPP=QDÍo+,I&NWPꨧ(g3HlmL7P[m6htOUpAmYK,bCDhԞZV 8F91=Oi,ʘi @)c2uKYn#PvEXIL;ڎ85{ܠ cΝKjiN;wvXo>FrQxK ]Tb)Cb^lCӯK}i>zw$x܍tDb+ G|xV}n "5ev ERS3K Y6ݪC"-TۻYn̸o]"pzK$똺64 <]?*WWokWevD7KÔPY:Z#Dei>KN:ߧQKӆj\Dn+F0FhNIஃ ( u7 &kW| mi<͛t3/;$@,[H,,6A3TPabp^GJ-v!MIՀ]gR3dSv"@"^8Vuo͈77WEy4]- $i3t*FiPѳcK.lg &lKH3/%F)+96:,%5}{H8giXjfZw%t |''{#4"@@U<:5\VE霭#s M~DS[]F?{]/ft@cM<YB2d]ǝT@6A?jf^lh~<8&$sNV!3NX|ke:Ƿe^+o3hB}'IHd:Y#Avw|LճWE|gL;*@jo{(d[NhFW%G?s՞=Lō^ [^o⥉m _qŋBDR`55#RA|G ߓF" fFf. ɱX)WK*K/|(ap=C~)7x@ۏ㍕vqiF> !i۫'f噙Y)8VdA$QM+TV>=2#F"WFN;#FJk?O\)جyx r6B%R h4 =I h 1HWvi+9T?KlP͘ v$f6E*'O޽%5u!\A(jST`g=Zs$o>!sS5vQB-Xø];Tb4zNd!{V=Qӎ/XEϿ* 6^-gXf `Ѡ=&B1b)64,t\غv +E&[hXeZȷj>jCpa 1 5X䁫I/ v|M^eѯ9ތ=S9'RK}+ROr_Ք,R|:,@N`7p}/jBP3̩J2$b&I KoiX-aeڟ>@b!m7b\}H˔'|itY72l/ moUX{^L{Ƶ6 }Q7\6 A5&s;֯<vRn<'<٢YKg\:\ hҮ3 +׼]YOnSF$UYͼц:m4N{mmK8k< "m ,rH[YZֱQ}zЕ-uĻg 㹷%ob?Ev~(YXh$WNVq^GZL׍ 6( C' ]-\&Yu>KWqLygtTn @JOqd8hIP` ٯA? uO=TAj_\M}K0T,Qz0Ètk7nݙXTl\?6h"5f恉>ّHr8\Dp|%{& Z0>icv=Q_6oDŽBsey>jHhs*;MbZXTR|i56ߤqaKV:|˵@#oNYG`>+!7}+>NY7eXGN/.Y\P8rS3vMdQILWU%`HRSfZ榶{a+hŠs5G(.x c8Hclz7F K<, e7h8`>y26|Q!"#M̢)p7SU%;22\tP#:,1u([]Җt#ES$Q Qcq;ذ+vxW{}@ûstv* s]ԓ/jax4w0@+:Vq!}D jץpyW1P.jsrow&MC+03밵qi<1ѻ8)>9kFLRq>Me^A0-l~N881 `=1F8DDAϐkzD7^oWE-.%o*EBcL.Yn}tDUwx!L{d!N̕s D,aЎֵLuB7v å_ȤٖcW!!Te*֙ mU/P[nbtjsF7;졈֍rMIi5vvNwv ڙ] y&͇ ߒAX7LC5jɍ{Aj#gVmfȜf!wvkXyD .>U$%˿MARwŭ6,@oUzH^\r|5uG*y+[9Z{9cǫ|Fjf)ⓧ e6d'r&M߻{ҁߧ?pomQU_=; ]' X7N= .*-0zGI"UP xrтzT?={#?68 oǍ8iH}z=?ԃ v8BV 6H-ۘIw*C)ab#FJ~'8ٔJ-:B\ߩ%SE/a;'r*Յq]5K{C:M?Z-p KNMO8R9xjfM ~/0;6;@wigyF 7xYwh{1)h Xg0QbV;* (ܢ e~-``KK͎M$H(~$MGhO}4ϒ=zZ-)TRk۪)asPׯ緦$< Y, yCdHI=7lPNMd%XV |8^Z{_?CXLi3.)iN, Jd~jj7vCJ3xzV:]Cཧzs,NK wg8srvB4:|NJXL7_,~/sF{r)wn䌃lzMHn1׆ AKDv5u͗uu'k~L^r A<\i |Qd,$MkTcm4g3Y [v.3"`$.T흑D/_RRP\{)m>]Dq&ąIJ%9i Sҕ2{#p}Mm_v=Mi`&v"H&qXV#L'uP3 `e/ o@$P%`c 𧰙 ĘPRЫXaj/fA.!PPkFd&R WeG$bqi2|R7iv J`XNMX%V5Qy:6޿;{' QcOy)<k!X]/ECgs~0cuhsXiB ;9~Z6/w (Vq!>S.. *kbtի^k Mjw# ^gOK"p7ucd6Jkd}$ln')]ui\QM׾:P|%wxmK跙YAs NJfc {,K~3OFXk2g^.FXF҃6\}[Sq`6 RF83d\_NYxr;FY:eҎD@)礬W"l q3C*vJǥƳm8̯$AR\ƒ[z!Btp*6]hU=YRgP6- B\Ҝ3 G gd11di+VE{cZGLkn^]\,t6։4Ļߪ.弪*n<ԙϪv{wR]+kf+M%8zsQi#UzG&_r@[Vw"y[7=zVl _ERR`Hé¿FL"D3^[ ;p@ܟ>gStvzhV >%ǃcb4[{T3Y[YAץV|&98Uw]$W'xQq~990t,OGMA| K1{#Y)*q /GDȡ Nd[Iu\9cءڮg NP’+ LCx)P(Oǯ>Xn+)pQ1اxn/!kS׌ YK9vweI>[K Y$lcak[ЧRN,'a8);LXy4E۶W0||,Ŧ7.PPHB!xT~N_cN@3Ns5rW ˧XIIeA<?g}`RrUw%YD g|S ƎH!THSr^jbi-T#PUǝ`!Pqm[]3=Qx3GV/ÞKQOK0K0?cڞL%?j.dP~Fxu+H5TĹsbG54qBc36uCAϸz\tSKhYe;[tF,Y+;r5c3aw Vy'W!nb}GEszOV..Ѿ:yh[=kvz;K8xHw)@T*>05UE* VQBsh10K`"> (S`PaV (PTrͶts:($xO(U%_27jg/JKE4F(]L-<`(wj=,M}H/oq`rhEEJ6`n _,?.yȁLhoe~+9Լj uiS]C J c%%hr=پ["!< !}j͙y/䋄j~E1vl'[͝z.Vhb+w:n#5qS.C,J㫃C6Teɥg$UogM?ןAJ:sT-3d¡<S \uɠR$cfصۣYʹ"XSIyU,|3zjƍ\Ӧm}-Yc$3[);V-(b]Tj|_%bBq3L MM)b[M+4'Eorc#A\ߜRn![#ﳤ"~=_:L. *3j'l'0[,bbJ&l ù Bac32-%R^F浛wSE]l}: C @Ɇ*V%5%-JƃZ2Y:D6`&m/D?m5 {##N=PyAhKi2y]M,=@u"/Ka'M\8Cz^ l&Ch90x D:=yn'i{gDFԾrg D*|c*5?dfߌ]4N(ηU-@;~eĤwk7R "_j EȦo:1xe3%>9DT\sӧؚDi,7vh3׊6;]"Kel '39PjMD?`!rSo&@3 Ic;CfVU>Kc" c4b[!9Ǖ &Gѫp^/k#EQ $e*Fn?@o0ahwY%&x溂nDa$r+.l)T9cSW-`B"x{r8O44/ĕIgﲰ:"Q+tH%Ul1;-PwՔ:yAwy=R6|Hּl%L+6REfaZFcjI땁g&gtׇ JЂE`NA)7_`HMxV CoEeo\S}/п`- )tgw<]Ob\u[ &kXgF rX*ļĀ `>Jr7vIE6^aHA{aEٲnR;ZЯ'M΄]M@6rTib~_ Cn aBȩbѥW/bcJE(Mb~%fꌨ'S9|b(dл4KQ⬛MF$j%8i*cID sr;JX W9F$cZ}zS2=FÓ6ܝ8`v5L.lJCetu`+zR%!~ lg+c}g sܓ I)4  ﺍcRx UAXU 1Jܣ.sn̔(ýDCL0Qug! 5!CTblN"YvV7gS%muorb0o؈o?i>]<dʴ:aKjX=n\1k?yur+|؁c6_3بrtja1V*g8"ލ$d0-Y ׿ܝY ϪN{ r{B*8￧QȄ^=U;Zī`+q9vHP3]{Bfm<7S}[BUP@2>qg2>tKs[gөڞ`1B ڔ7"] ~p;ψ6<̽:iM?{*DьdO!l]sJZh!>q4 ]\t53ں FbFѶAROEqrG=Dm\dw2Sx+kXf^RzzXN!xƊK;ՠo9x{F0PPAX`dwmOUzL$3La2˷I'C<>O2ZD¶X /,vקB3Y6}!oƜP0\2ETQGm>CeGNQkVv{ I%b.]ŭ(h@}伟A2֎.61/4Xu)^ ?覀BڈEK1e_Ѭs HPu6}0~nd?l VlPc}xR{DNIt0 cQc ބ^ Ks\N(ۋm@%Pʑ@0S~/ݘsn䰥BR ]_G4j iRhڏܕ9cۂ@=C7TiyǑSX1Rsg:#/_,2}}ngOe5ʳ5ĽTqDp0|=?c3vHP`"/m(aT5 H sMe8e Iԑ:EE0u_GսdBmwa˧nt)F&MH(=Wh5Yh;*WGtOhrj H}F\/,h]/3*M%a`tNA$=K,gfk+T)42%Ʃ))VqVNAF6qÑm%eV:aXN0ů ?|i,%jFܖE~b{7I> o֧Xy_)RTE#m/J}FL6RWVE?Fd|hx/+ }~;W}/a_GcFI=RĹ]J=ĪlrZ$ϕ7N䐭C۠D%a_:9@֎ad ?Ep9+7o`{gHO-ck(E?a6^8ŋzt؈͵>1 Yq/ ́.(:\/!E=>:plK]qWx8 ɠ9Lkv @qCkq[Qd?Gޫ,~nv`nݼ⺃LRܐmX26[yTAӢh{{zg7YR^yc0(j?Qk{~?x@G#)k۾"HϜncUX>TNȚgq7Ŋwp@kpXIL22;f3xä0BF!d|"svt;r[[`Hʻt{lo%.T0(J1C6nȭךZw+cqg"E#<=.;Q2;,(enp{m]UQg㫃DCUġ GEtOq@4vn4E lj뵃ff{څWvk?N_wj(:1) 0utT%XA#%pe`.Cb>FVqTWd7@}>B\,.>a{Ov+uEd'p0s;Jhj_o?TЎ6ktSSyV9?{WΞ<o{89sÓa4O)Q?y [)Fɛ!P"MX됄mS~|)e z P|5eu~E]UNL*ni? LayW yc~ ^ <Ӳr|W+iä r!T gnBU"I*3/szTX`? ,p%EdHY”fta}L&e(z\`i|V$m C$\nӡJ:=~rGb\mH{?%BRϹipazNA2W:-$n\C37R.N2DΊPL^B{lŤk=m)dO%M+.ߝHqYNr jfωmpf2y`I%=?MFz < :)( SE/H#'}/OЃ zB-b,H"<.n,˜5摢,dFIm<1z53 YKx!0T֢3̟bQıfρ~<;) LuF$Ӹ,O1* g\,gI@7P̛Y9> >ʟWڒ}!225iUT]”K< GZP;|!5r? oh4 GC|]T%)Quh5P}DٟqXl7Qiy40 in_lMr 36-g@9: %J$k㿜"#}{A*TX=:"lʹ!*?b9^왭iׄͳEdAX8jc՘Z7N:^+4m8u"IG oO&!glAyƇ 15!y崧v>A^3NR/9 fJ H HMN&;JVQczZxc@a`n!"ST{.88Nd=. I]V7d&E$Tj8}kĕtگw+8PHGU_{/@\\SM ic09s jP ftypjp2 jp2 Ojp2hihdrcolr"cdefjp2cOQ2d#Creator: JasPer Version 1.900.1R \@@HHPHHPHHPHHPHHP]@@HHPHHPHHPHHPHHP]@@HHPHHPHHPHHPHHP]@@HHPHHPHHPHHPHHP 2߅x67&?m4&[<κtxOc>m߇m>ܵΥ"/8K v9heS&)#.Q#ͤ&\nyA-/ .?LOa"$HĄd] |*<ѐDRT;8 :qC934g jW[w6 IQ{2~mmN}G>$j4:@v08dɈ;iCXrsk@p߆x9EP OڈO2 ɸ~S\{r[)02^pT*׈Mc{nЧ'-mqfsYYq;U4V` }uB\[][mͮ69XeAyJ)AS$NqIy@FG s"ӍW`}FNhwiBbDkR ?,y9G(V㊽Oե߆8=тl/$4N핺~''|f7ꢍsDPcmp;u?%8dHUCƶ|  Dt~Gh aZY:݋T!d~aGQ~Uw-]JܕzA*
_5)jE! 3ds.5&{ۥ36~Ÿye`'eZ"dj7v *OaC|՗pJ6&tMo)R)}(6 ayu_MĮbI2sotB8Tǁ^?(X7!?@&b{9Z3| tҎo# W1&򮒏Ѷ3oS̱D͖ )[xc5&w)[7N)GD@ Y{_0WȂ׸:BPW.EbX+,nhj2*BȎ3x5=Xr]lUxT]uxTKpw^Kfa C-_rc'?ń+"+zz2Pc!w _~?2{Jl`hޤ̽"7quȭhK12l-3.2N^5ss?΢ՃϮ*ȳot 5PL>i4MY藀W Vd 1@{ )1q7`gB& \e|̡M+3moufd=3'P6QqF'zY1okf\ phgVW vB U?Z|)>Z'utğy?;0AzH~RjM*~᜘vZR>Bc͗vǫ{F{ (j+9EʫH Gjw0c/b)HD/ 5ٴ. sŻ.`Pj'9;IdOOK5fψ8dwdXnnU_U+zCn.~պ@+x02Ƿ<'tkEA#~v4TQ%h{SCN@`Qaphs-ϮZ iZ}*JXjjǞ̙u6)i )Zi/ # +[nNrf+e]k}uݖAJ\P"(>m\92="G_k'$ =3_&ţ8iL!?}!Y7|ƫВq# XŒ@6^INT|9_k9a/\wwO?9;&N0u^gg?-dbc~cDb T)V ]8BAOc//)Ֆ%&T*%0NkrgxQU,Rh#Tq0is Lߝ~v4@6ng > r2<%"$S釪ȫ:95cF&hl4ϗߩ'L^]ƈV ϸiÂΠy5eUjjχW)GjJu/d`Hg/Cf3IN,YIw49^hR">Z=ZLl-tXhR,=ŧ-u=EnJ|80S]nheh`8H+6,F\ȩސY843 ld0}*B0B͸;1q>y o/$nfH;➰gZ˟h`Xh.[=iMqyX |K"GSͻ2uz)AX]!bysjLq>Veu<;י h֌2 Z KҸ۵L6G2TӐʅHA]~_ᚔ~ZB$Aj#PDJ@ G*%p ]@?i, *MpHw_WqS?yfxpׁE/+űx H懄xDһ)iw_ zn RQ= TH[]-?h>|L)~[p֛=p{żԑV#/&}w%CgKpݦ<Έ=}֔p9#e M?~Qa4(JR2:%GB*c0;m a<MR|=n.DhL b,-*B+ZNXRQ:ʼn)m"sv_dߦ- jT%`?|7'5Y F^g˱y^AQz'uj(֝|Υ5خ9/C[h3YJ\mVK R:rW aDm_)W |amf{1A6?HMw+/FCb*uͲ _`R^N\p qY1 i=LRlֈt[/SV43|j%]iDUdܕ `^6R/̯[ُâ8woC@̂&!g-}CΩI=f~x_boDkVw- /\qˣ$˾csτDxKҐL6l87aIM5(t}xtW9hٰ̡NM^!Wk4C,JFUXMn0g݆B6/ۑ^KI 4{m?ʭFa0֞-g,P^TVOjrcC!?fUk'dIv$Sn"|l8W\Y>RbU$bJEpuevlAȰHVԋG'ë.Uh0rHcG< - 6/4|P,!ԅRAsnzOӱ$DDr0Q@wqj+%.8~Iq,&w1A-xmh͉P$ҔV}֎1zɀȢB8δ!wAz+8;yq$Clдz YJk bz?lMj|}82qiGS,> y>LЪΰVQcQ =%[OTa6ZZX~k }T\atw_kEF #(v^ </?!MS $DND |"4i!xS'Ƈ>55HZFHaY.U$/4IΌ.H o~xI}J hbT62̤>N`ϐGvWo$3<-tGӵ`9zMa$<2Nwd_0&S~HwHJ7ߒK|Pv` V;iQ\ˀ>5ZaISA ;3NFHׂҵ utcRPLDbZ6zQ?HHrsvmfkj:*T'[$Y@_K/ᅗ24(vAlމ([偕qB?;_b)eu2ub_2dz1T[?/Cų ReV4hH Vc);'z6@n12CGSҊx<€{8  \(vLXHqvǒZr]"r" *bjWej/1\(W(hUTg!d;Q2P¸ZCiB5@/OFDpjqBzϵF6(^a\DS|G,BSj"0}\*d= 1/\Drj /!:L,jӇ '.ۈu]ukGMcB T\cE3ڮ]b+' {w5#LkI楒)Cp''͎UeU- y]=P:.oL02!y0w&oz}FYi4!>\ *S/XXRMU'âIol~ v:>8,K%5]BFs`k+:Ke7rPЖ?|J~S 2Lw/{AC5_U7\ Ҍ{/Vm$4vF-!wcݠ(7+oSDh?=HdL'qa;pGjJ:j~f7 ɣ+ʙ^1zӯ˵yI1@!_uէ (k[AZ7L>Qx'#O:E}7G ͺE+*O6 5FRuzz [ȬɧCб!T (/I cNk@Ō t0rBGz,!Z"~MU:9nڝo?2{-*S!yA@Wk.0#J>0(?sv^jgxϋHdw|P@6.q @6wPjfp%g PF%Y0JWWbmB zK}T2T]%gM~-Qjs&iVl_ܳ16fJmմ& DCZ>iCHÇqfCk 2f"UfC1պϮK͟8C%$OLyvB2Pfp{Ո$.;j^`]+j=matH(-xμݍp%)jv%lmt@ :0X^cɷ$2H`CN Q*Ev.xW:w"mcl^v{۲K=+n9ϴV&|O*|2'F)&5a({M =+TFqľKw܎?ﶹ4WQ`ԡ2%E@) VOic1x\j.٨u%0|})9l"RiO@k%^S@TtGU wW%],|Ž mȔi(G_%[vEI7DX*,_Mڨ0ؒbȆTM@KM4[]/:m-;"p=:0 C{AI#C\I-M̏=)1r=jSeÄܟ[̘ 栃b#mOգT~%lj* ||ҕ5vb=;Ql W2rpU ˄G~wT߭sYn:#o"ZfƌzLC2:v77|lv%H.Bӄϥ+yPܑ.qHgS|%vfeyE2:/>D n=vYdIX 5KXJHLtSHm ltͱ:J47|GР+RyZs#q!ԭ̒5Betqb }v!G#HQzkFN3a+]6y"&E>}7N2I~ L@e>d3|{ZuvI{R~uC&3vqߞj@`@-nG+)L+PJ"SŜ ϕ7%sIKsE!?"^bD^0aC3gu7HffQ5#JZL!X.)uGBc*L LIqby*3|jMz&H^ ([uMI7XC49Y:o%$>6(yx{-c& 64(SGԔjG0K,qĊoʇ&Crt9ab;}.iWEVa52k3|u 2qf)O :^ӠZ'Hܚt3F ٖ"6(_c}SW(,l%cTw甡޶EQǗ_mR zh.,M4M 7jx$]:{ߢ>߃;MY*SjPpL>^̺mGR[^"(TĘ/ŷ vgC!CP⶝?19r%26u@-.5 N=Qː{1s\# *&\p5)M& 'gqz9YFY,>`hȢu{hvA8I6WQrcLož;KFط2{@⥁ `~/U^$xݛrG\1NϜMo3kpe2 ܋?O|}$-=Fձ);ݪf?ťM+\ﴟ^R$a{/GA-¤[x\QۋZBI([ IM;a+MW@'EU}rXg[|2D(nBCUK=ԪA@iINOJ*WCUr˾,C"`JM|=9un6>E'9/OpJ9p10Q8)TiitXtw ?S?#)1?=Cy.29b ^d~zIo`^\ , d aO!70y@ ;s}w뾶ϙjܥr T)RΪN:Y(5ۻrz(VmT"!Wj}:`4 ϝYϸ ?,@;G6%?ӱNMObm5},;}wa lljm zƫ# %%[7gL9Iq>#椢#5R TԈȡ`6npYlk}FꊷЅIų&hAA ZBmi57%dk׻Fd?.%P<獜Sb2*G*U2uNhiU+6wl 2T{%d+ťz|dUiYy'nZG -+=E]z !dwUuXz)y {z0$knH?o 6tGPL(&U g[l8)7RkFՋlYwɎV<4,L kUi_QppsyKbJyQ\5IώEQ]tgڋӔ*X6wWh[yĆn At@i@i;992s,!8/ϒwX~AVgq4G]uBU{]-K'd+OKxE/JI/Ϳ8(82*_Fo ޤa&?~Qـxj@I:# {>><6~t]rbКkm>ZdžXֶt? nC?ag+ynn(#ҲKY>]|~jV0Zqh w3??JqďvfׇT$r١Ed ĞwMmt"ֆ(foqxĈNJm©M pO< phe\s[l?oLu!5!< (z ƅԾs* lݚ3B~y&s'11[-9ÕlXR%],z3P{͆~G+X=̱m6IB)ʍ,==,4Hi:?0Mc!e2".M> `>iNNXqg'&5\=-!Zjr6k^])SST8h9߬.憽_H8']W`X$uJBs[k8 eT aUI+4$ ( zZ ^bvWr0zdo8&içGE %8$2hwӊf+F:lr'{T,Nsݭ*,'l贝hZNmc'xeu@PըxsLOFm9TpW$+ho65%{$іW`#ۄj@jdYw{]&0Zt0zPPo[ag.d6"Y%: K8ȡ=at2О7)N.avU 'h4PJ1} PwH".*IϼdCs8Z=+f%q6 -+83\ڨn ι:}J:O7|A d*58F,jN$S?Ygy |aLͱn8._#.Oٌ赟a-J\D,U(~1{Y jO;? tw0 _ /D<|ߢ#DBiXy+Ӓ9U-/=ҠţķI~& v[5@'0'A䆊h;ܶC\b6TAc]0hse=J܀P#` /yzeqcG. Uʁ~Z5'.yr__5I3#{B:&!g|B"y,aB2VobC-. !f4wF`sD#{cGSvDcK엉H,冇_A^zCLPZw/b)2m1ic $~ۛWNQeEzڂhVJ8A8l$Cwaw6swizq2 MpCT%d@,է ?N4Ӓʡ yhDO芴[c׶Z=# N#MoY&>OPp1SFԇv[;ǼUm ib-`; je2ՙ)CbAd TYw 8Ķ̬ trqOU;3֡K-2:&-rø"ltN;iȯr̠IÈ ^Cd\xY_ GHAwS'-eFi*EeK_ѷ,u. -sS/.`QC( 2䛽q5LU[r8@S8 ?)y<Nb aE A|qlUݻt=G|>'}Zqb#B%mF3 lc.pìS8Q{NS\F e}ܶ>b}}{9];}\R!a,}=N&,@:Z.D s&ުgT A25 ůtiAc‚y, ~GDn !J ;ꋯY ,ASncI3J,Yo5?vƒc12$NKQke0Ugl_[XU ` bdw8:_*r+un0##ai_1QrL_̵hfv m`oݸ jc\yS;W2!ж9S򛜛0z2TٸoqV6oDX橑rN?nTMe? ql&JfƎRdAy2A]fx<<%+3̰Ibm"nÙ{@r"~V߇q&%y*SŰVܜs H8Mb[i5o",; Hҗv06ӢHS Th9  02OXR.b#س67p8* L{~NQ? SrjBfhG2b$_v~=z> @BFAq)])WZk̷ M`fQPH|EVFP2, 2΃6W*ʫt'iOgmᾁe;:KRQ[f%B4*vuc _%AhX=S28?/Wn/@kJ` aG MbG"@@y=0v>rwswno2=A+%G)]u~e+ej~%gUe%M-P"%#*YG4Dpqys\-]~ELΞN3P ]HZʎN@pb1Lm8xpXqjh^@Om_q<+0F6طN*t*So@f+~<{HEj jNyz?c3h5 I*T ia fpTѽނ241QuXr)KY^٥iC?ى/ҧ ),Is+9zIrtUЇa﬒^,O]W3U{:T?(nۭkZ$=_^5{WqwCK5wOb㉚hw|w*k9<\@d,ndaCЅq Z: |xsTT4}"tc}<b[oڇ <33^\q'A2 L[Rf",Ȓq*8?\CcV }Ra]]`c_)M<^fK't4qFV(({ ǔٗĿjڼ\t}df[gH"$b bй)o[BKW1LT\mBɦ³LN*52meե;xU!~)֝j**[6NQp=O~c wq9J>剀uZM7ȇv&B :ϻS`$ɹ-~!TF؟&`I2Ͱ;;a^"iT3] qeł PفBU+P *GWz0n>57`-KcuL ʙ}߲8pGSXB7b@}a@`|oQ=Ozk/Zqe^\(VH G:HzEX_AYU󍘢E;%R` R'-}e'H*ZX͋ 2}?sLmC Oo+K]`f}>%0K[k}h,g!,bKiBm\R9J +!lFzyֻԤӕrOGη]4'ʺYLVDlbڴrhTcA昅~"p}O&(GzݲsAk_̨Ʉ_@dؙжC֡`vf4{뤔'!B݈ҕX>*cA3tpҔbW*c2 y +g;ktK22p|VeG`s}6Q8_*ؐOVٯ-i٦6w`QpD*!# RDByrMۈS~*,΍F4% +/Yp">mz-B |#rQLѳ6D.cVe>S/jy}- ^+m$Fa+Ez4r?U.ghFOuWJRm=?K)V5[LXi7޹'a_#:fg'逸 !q>JMA1QfhǧȊ,sNPЉ3f.,+œR"6Rve :Z>=%aR ۸e$6ڑV6ӉE;|[^hf[.Hr ?$JlshbFU)QI[^JZCիn[wF~Gi>{{@v1lYؐlǗN)Rp6lYLƌxPA3p:J(I^KDntrngpObh}9B0߭8gN+A"-0A[=,f$ ]:x; hH"QSr|֮2HfRWe*RFɱ`->]Q[%9j){o JDV4ϒuftu]n-Yc݁eo_xpn%j <;Xcr`ˠG7(w)"`ZNXdʂ,P@zy8 8-RKY ݂*H}6uHO(e\eL9NħJVehC$N>Te&*ɀZk)K1ڎDXzW5P# K5㇔tt_puuQp$Vfۮ7 ׄ [_GOr>F.`du/e gŻM+Ʋ Z(YUdéB0 -bZYIev&HA)#m1{ʇu<0J!]MDN'3)aw*M 'ȥ8 (ծi]~Wc;_Z]O㌚{C(n8'3a:քh*8kr+~nԺttKoXQr Q+VcA[f$GO:y;A@J2Cڧ"󆓺Wl 5^mQ++[wN+ɀ٫YA[xڐ$rOt CmysdʼnJe[qX 3)5PGr>Y䃥O‡ Ԭ8)n",'s#S5?*MAzֆx cm8Cb&d'Hέ.ZTaL(gxÚ5G )&_D,[Gá-dY `Eʺ?zm]>讅ݯ \j}6^Kߍv~t @R.7` Ud__ׂ3!!ixw%`YzGlO(T4c{F J%5 dH ~LYaWo榐8R V ,^q6+S4Yv m9ɩ :p2s?c?xh}z^q4v$ {0ӆ|XO~TrQe4duMgV1$BZ>;N.Yv߲P,NjKd#Ef̆ʲHڄgVr>$y? r3rgu2inPK-P&bSOsWd-KL嗜%mRY2IhCkICU4{\IE2|t>Eʏ S,er>se>ֺHND\ʳShpPBz˔O@OYk9)R1UiD3E"{}wmXȡr2j#]EE%E!'}Q)_}tԀ\zX'm҂pLt.Ht~.c9MJ95d>UP~8գ<w#:i<]<?xi E_U@M Z%A!zn&xx%`qQ}( SuPcWEC)"K/.[i ޣ2NKvEty+q+n]<3kڕas)4?sܴdPg8uPD#&-(:V&q*{FiCr`N 76*-_Ժo%Ќ91=SZj e`ћn5X9zOJ*4@oS|2Cj%6^^O7R/)$ESHȷm5SP'(Z <]SYQX'}sPנK G^urgpWRmdjrm~}^w-Ks)geMhKIp}vI5?q 5q2~>[/T45X ԕ oRXy*Jeej9 :ae EVTe&bpYQb•ҩ|Ug=cs[.|̂ YlN]#RMҔ;&x^G[9ilX)z g Pq{nsr)@Ԧcb2-$hIJ1QL' +SVFvÙ= _G[PeF:G?8PgFGlze&{T$b]p8jFÏp{KGDjY+ bWh}w+(;kvfۆK[<Ϥdv#}P Y! 71E4(`xRA9^nu*Q݌U)n[݌Gwa7# {K[9TL<_0XXk%CKLû02q)}RpD7kץr- %W\>kwSOBs ) 9aU c$7%CAq_% kb(\%LnotQmU;">)D=;e=ۉœjB@TT3xzHMqUZ(C2VuόS$t!!e;DY Yvc~ұ(t鵪], t.OϛH6(A 2:zw&Q:LAi8WWJEU@>A es0m Tpޓ ,)s# gjބ)wC]\ t"*ek[;ZM~[jQ]]g {0ӾX7PVb?pW NJ Q [$T j!,=aGxS)Y O)4v!ҌNX>Q+`>`=uY:j;P^up؎mmQj4WqU8nF$d5ޛ4iws%nnT6+l,k9u1ò,c/ hzx: t}oS\Q7obc6uM?/e W9n}&kXp(`AIM-`}ٜR WIh!$B+2VpF@580{bDjx%8W]BtåqCcK-οxhb:Mf+q |J`k'_?rOOߏ|g(B™"Eߛr d֬d)ϛ9eЧK^X(d^%s>w f~hll@Dc5~ -uePFRAR&I vpoFCJcPUVzkq1$W3cCbB8$.|‡1&ۀԂ`O{l!~iur XctWJ |$1RI£7=^xK2&c=K2=}'}R[O+KMnc#W猓WcGlȻjD v_ZUØI4C߼b%UG#$\Y|>;-2@^ 2㢤gxϒ1fDwHgsh)HWz2wA@˰Tȼep.<Krt1Q\Elt)0Kw%E)\='`9.kvu|T1[Wt71,t֜_KDa9;)sZ瀎K^RI.#б~YA0Oܗ-MVIiPPʫWNt it~ɺNTt.Pzc-R7F{fqN(I@LFYoHu^i٫Kiq٠:ԃdG?t,Aϖ^@Jʐt *ʛ9vB'bu\Il%Y'Mb}]Wc_oO'*zzHa_oBcBgZ' 2+B0Sp[Llc~tĂxϨo\ R6FȬأb.Nwn{8М] U7Z;@HOwiڭb/@ycJ$ R1T\dѩwygW6V}|NEfͣ u%eXq>xâx|[BG}TQ ݥ|‚F(C/"\+l.uOt;=ké伄;9Jw?NcUOaqK-O ʛl8KA59_oC +Om;5'6W-4-c " OUJIr0J;Xz96^:~på`7酭ž3\4$HBt7ɉ ,jULXY݆yeldt9Κɹ'# _}Uw?=hBQKV&=v{J~nҶ,@M TU"Eccu|2.nmɓpC&ԼMNӡw O{SPt:Eɗo9Ga:чNx\9#q\?FYI!2-da n-7% 6#-3H.F,\y}ܹ% p4R8KݲnN]be2WH\EAere7#ew">ή0z|c A+QsQ_e` Մ IDq9 o9 v/(_L;`@DE:Aۋ gq У] ]|CV'A[_}ͳ[PkL7|x*a\f40tc" .\*2˯Gҋi,!&xZCRj f)kF8r A {KatL OwXR tKX'Wd7Il,Xw3 |?G+UjpѩoznBZ@zЕ/#7~n &&OsjB%W8Lq{)+~չHXӷy,{0>VIoqvt7/g, ]@)%ϻV{$+G[&H}y-1['H D ƅ#٧*6idO>_YD H{c]0UDEKBDP]JBpЯ (ڍ#_=ծ.<',2(ĥ*?}-7&ECɼϛIџ%!J|Dv6(?y"v\Vb;Hr{(ƶzV*8prES #enӻL9ƟPBm}5+r_yxɘ0_ 8&4!i Bw!$P(YbۙeydwRG2fO1ۙf9b8LG2u/AF_#n"ˊmWAbA㥉& nHY ,(}qܩ9' d\r lXgT"rlb{*AI"v,ep0F 0UPx볦"LC\|zߥ#n*7Vob"}%SVf0͢iF6Cu\у"IDK gk RTv M jm%i)0+"!֘,U[.#f4ܻĀ K!l!Zkָf^EyTj\uM"tIyXթQܑŝ G0G"d‚sHRhK۟>9)"9o5NMLlAӁgA2>|y( Qȵ׃@ALM8<)`ш~{54oc(۾\0J)FyOC @51K@@vGT@YVa<_{yɉjw[J{s<ؽLt5l4*A[՜ކ`:"8TvƠn~tOQ)ϰ4/2[~ς@B/E^Ò9#x9H]=5+Wo КW 0Y8#*Mz\&"s;*9I݈w(I[^jh3J\O体&)`GСtH[|{)%vWk= tPa%d%,GUzd~fd{(8Y1R'&ɿ}~mդVt\/9k:Yhs HW*8P;m~9^4E)kF@ M_%\%̜ ɲRDPTж ,ErL|F~1̀KL~vS&xW +Vמ{-9%]&Xpl`qT$#_D$ ASA)˿L=_Yƛ{^(>}c'%]"(GBg&$pZSNXRB*Pz]-, `iPDȡI8m}Z,䴝[C#Y"&ZV!5-ьYvqzH9(l ׏S\R}o|zUqHFLT/GK+wm!Xц`d.C6{>Hdn)u*7I3 P}s^ҙ|hZ"4!gW:_B*e'`7x'Zb bgF啥ZO߶Mzn0 Mt@r&j&rL#zYY`X*<9D5 -V1pO@I#flwY,)d.ڿn,XRw:ҕI! 4iU & a!ak?^bW 2J.G)eaVn/`)I0(L+ͦ. @lWil/ Zp c LmQ0a luiuf0D)j{d8fZY3>%az:7 m`܄2G3>7~|I2^x #(:M{F&@gyKӥZˇg a @bS< ZHkC~mOQXJeq/!2Sºi[S;:TJFs@S/Xqz6*i&E-xx%2e;-𔣆3>P|_Bk"Bu˚THtՋ` ˠQE> }ohK+PtKMc۞ڻ3cʜ?H#uq::x02"Nڅ0d ZS=^S/ *p̣Pn$xH?>+O5WfF!K[Ďh6DQ2퉶}n# 0AŚp.8{F5YKxo?_)[o9tx((wz9;!oDONUo s-~nBk=ĘgV ߓnf+oop!o(4ۏn3TuےpS:X-F#<|_)*pN)+exaaM{S+Pi0g-[ywl|) 4w+kTȱĹb"A a^$))~[sղ ?ŽLs2](˜]'ܴZ#\//4. ӅY/rWr<.XexQՔ[2PP9l3T:A+H]Jk SreM>*tnFm.gzm?p K亠I+Gx~`bx%eZV^}鯻1F!GRjÝjkLͫ 82 ~es3zfiSZ lIe}:c,¶^ܘ#"|v3-ҳK(u#OؙdXrctʋC[9nmRW \C <(z`xZЅFQpig{ XsDK4;5BY.Pyf݃q9{Cg-1i?Aڮ~묚'. 4%w=p8>ܒ&pEp*UE '!>?/2}NCEdkWqGyo̘-RǕfԜ;O{ߗ{eo3jR”FZ&FBTxYrDtH \b2b`P0Ac*!vIjoKG' R,ЫFRLk+'0 UQBWf*R޷^;eT;C..Ye{bKSqRɲ /&jO؂Q 4Moc,>%1/D(LvC`"~ȓ[M.ٹ`&~6m>~W& 1!2y/_xu@ōp!`檂T:s(pLYqQNj{:r\"bsMҮC?WdT<!2:mC5.Kbʢ`|6r=)XV={ا mxA;"l 8$8Ew;Uծ±6NU8pG-,9эB2$hw^GɈp83F3A*J 8b9%Yq_qq1*wPţUcE Ҁz>I9ks%ohT[ Yu9ϫƈgz!z:d(x$dAhbZt,ehD?!*(TԷN Ði>Vc! Q?}~շwkѣQop4q:"\lat5a'R1(%[ʜ@$In*`>OFC[*j+hyG`k=*]]@a0v!= c@aa=1 ''2v%Á:Wob{od5l'S0S|H}028LT]~j6|Iܝ}4<1*"a~r\efa%ÈcG?.k)/gX8l Cg$aBӠRe& L,srO"M),.)-tBM?PwlD%,iS.GVD8ǻFzJHbMu~x5kwܑ K}2XLyF) @4=;WOc9EGu,RvGz\k0β߀K6f$/bVs1 C=8[K0ĈO-y`'(0pl' ܆iִ>*Dl$zv¾x}ՊO`b!hotǢK TH您Ե^JD4/X -0F3RɺEyJiЕm_DH E9EM\gHt>y^Qy*(Â]kbuO߾ml-)5R2G^\83?\vr&  PspA'(v+#24dUmQ! {]+35V,}ٸnmZ#0by]iR*"D%LbKVA)2JQI [PO\H+du dښgl@0i ˑq"(Ԋekvͅ}cGpʼm)/12;¢kgI/Q=Vk)8a VFJԎ(3. (;k*U<,?>BO۱;d떈SsI'8>M5sC A.}qoNiϖEVv{wQ i?*? I.v|ȟgiu^3 ߄[!4 שO9 /pdK bSOۥVSq"dΑGÜ3ɺX'TV,~Ʈo76؞Rֳyuv*P$nzEk?t/ q03sNL_T:ڛymtq\k5Ea]/vA}ߌG{2խf>1 ̔;4R=CϡA] Acj!yJ,!U.x$_ T8x<΂xH|q3l`ܢѼ-i8_xNkwBG}T%uV' x8̊[ߙ[eZ%1풃XLe[99Pw k%_U\2WN\Zj2~]Qd˺Gv^غi? = HA -m|A&?rx25;:ѫxJOPиþ2,kiİcY¥9=F޳[4yP^Xf5J8ك (el(J'ecT1j'xcVxu, o+x\^$04ϰvIp]l:&U2m4n뱛wȺ]|uZ\3tlȤz58@,8! [i\Ph帴[ڃhOM{C+kga36iX='cre76Pe,+Ė3'ףy RA/@7j[ZH73}'[ٳ)}M #oN02mgŃ,Bf.=j:|flN閥YJXnrZFn5q&J{ep)6fl: T*YFqA4?D+@D*L%Lq7كxR,g_~W!XB{IU!`Y[^Dt",Gw1⓪QV0+=T:)A7h5j LDd?"ʲAT?Mbզł Z~ÑN[7_;(br sh825*o.ݿ9D+2NN"u00>ª =dD S1S7mYTw^nƑi'G˟9Vh4EC!&$f֥*kV.pA>ܮb?}{Ϡ,.1ǙC}I<\dCHaN U fgiRD#f܈[5NuehځIPM[1lXYa.3~B㗮=Q]AsW|-Ȫ!z5؋xI'T&UEc/.1#)_svE38=! vJPbQUw1<i |%st0dz.@p@a4PQD"3 1>j˾ޱlN`nh5a q AN7-d-cgrH메\y`m1'm8P_5™}(nB_bb:M t&kbx&?x (qYgFNV*ݦ`՛5JցfՆ`17]饄.'`WKxT)q\7 I>P nZӒo>'O&.D(-zU-¿11lCQ()l54c4ü$SдNhK\fa?{sY`3(nrdV>'1 u3D zt@ HUnDJom [Ii^.t0t2EXda* ,9>v(v*naRh9!ac,D5(Mbt$.C٧>5<:6!rS XЫNp~޼Mb.Y͔Oee&8,dٖ&+w*%qM!oAťK}8E ?ir.7+ʓO.Q\02Zr oB:Z>ke\ZcWb hQX$R݌($ϱҵ7 "}vŭx1J!火7dyD0Y)ь p8,M.єcBx:(ڵZ]0rl׼wbkFjBצ ]Fdb j pp)K,VIń i |APE(ɞlnh,1ylfUsNerF(0w}yM19r9Vz_9Aՙ~$,uJF,&X6Mطir\ 8nT{zH& 0UÓ1 )*jKR1Vj پ?~^e*[&Hڐudn?aF;kf|}@*B>pgr=9 dFy8"v))U 8|;NB:7R #(kXaKnwbK vCP[D"pĸg|ɔJy&Y=- lNM`q'͒ ;⼂CȻ*1Iyd_S15y u*%˫,[zZ,{DJٍ bݳb;KvrK"C۟9BGV;@1˵>"Ϸ-۵5Voζ gZ0+ibk>)g~u' }CVLtcIA*8SFST@️VA u=I@NGR%l,"o'P|[ca'miV6PxSIhxw:p8qkUwD0`Np*X k1VRVkUT%9gQ5 f ^5JQ[$^?X<>7$+41bsEvav~2I'| X}&H7=SVON$z;'ST,WTZ/T ul5ZtPѬYngt"&şe(Q^ōE`1hgM:N &hstB{bz9[~G̣٢t!Q,Yv\HD7ۉ8_ 9 칪\TזQԄ~Ӽ8] [I4kƂ%)D:J@qECo֩WnxuKcAimAu=NQi/llh@[ɛc#9Pꒆ 89n47ycߌeU_lJkƥ̌ O(d\<{X}n5#o\YлBщ;=Df+ )Z0Z0ߔ-MsP,<7-;4PO;6(G}'1N$0 ğ 4."QZP:^ Py{}z8G+XKƼ9)j]Xan}$lt,H\l}IMf".BF9fD0DZIZ 'hHI_!ԙGſ mJs6e#m*hιB4)>(Ҭ[z?}j 0 a`9^e㙟t ]T;^k\/ ̈́H;8 <2-}.ԺW biKw3ukh}#zRirsI̓cj̅"/1^^K[2qՄʏ8 cLIJ)z!qδs亂luc \~/h`B5Т0_O,܇}/8x3޹2q#VS/w`"mJEx7Tw_V:%FJ0VҤ~QWx3J4Ik:ui,I95N zsx3TbgM)m7O^uxqFl=V~oV{y=4̙G)$ܾ! h^TvI.C`QoѲOâkfLwxz?(Bހ; keBTȁ+&*!-2QȜ1Dow>G6!EQŗ6DKDu򃋏(@=/㎋\2m>'0^xضLIdJfMRwvg~}0 S 1TMާ?WmU<V1cic uY@T$ol9,+`C幅ħ$ r?Q! CgX4\C{/6Wͤ{7}N3ZUCAm!D|C"ny|_u!s'i{, `UΎhDnb0*s_+0`TD B0A^)ĤI:?ȪUPcܢϋ^ [#-N-D\/P,?is}& ',z->X9 _ K. ֈUj.ma TAkN,_Ս|n8uygBf-eof(1셌yVD8 K.Xp1@6y q?Ets Ӷho ; :!,/ Z;1iiƘh$V>ֆ6~VU\"M !3PtGF{3pVtm7¦8=pL=2O:T։F X6yvo!H,VV;-"eJ_!荲D߉OmTu:`jB[.2R`Z+Գo_HkG1H^gb/$wfNUGBs$Tbecyxz&rAg!v4@UA%.ϝIA|d3w7`@wmUV>>Gl&gYh<JIv^KizǛtɝX7%%єWk Y@%ZtA:F%GVL}KC)&B3][&7+' k<,n%Ø$I# cNpm8[sE@h>pIqƒ J)@pc)\p%IVe]S8\0Խ0G-^Sj>sqn/dn͓v)LݍķL>~,q"PhlĂVG<>ȃNMWDc! -ԷZB ,v m߰"f*x`JȨeT,7[':I#NQw1dhQJ{)M.}!/ ~:k WЗIGʔ*VS OOw>m%"|aY*)CZ[EKp:!Xf$MB ;:s6bh*<1&s&с=&h #o\#cDlRt7":uhGS0^M UJhh@棵w/%R2S"OjE2:)jMWc.Eٓ;IrabDMQ|zq.C<gd !bt)%=2dzK'wiAmK9걐iUjzwT_3oZWfe `J6YĪ!j>8xD$oZjeux!OypT?'^4)R{Sl߷y4zaU;ͥ5O\) l5VNv 1|TKHMuva\*4==|o-hs"0ToM`E85G:iwnRS_S$L>m-dm^[Ȫf/upJֶ^າE@Wh@ںժ&10aRa4J޽z1,QLGՆi"5QUAg%xm!O]ЃVw~v/pT2-'q;rs 5HKn\1gY4ȣ `֯WS8+o.kx=f VX#e Aի]̀rh73q|z#߁wE;>Ofnۨ3@+=Bu@* 4-U"!\^h)S~\ͫ'[=H>cν݀IY./8JAj Մ )ĀXSA~}7_!?֐EO0Aqk1L<ٚD$#̜-H}KvaL @nФί)L E\9|7h5[d&V8HI,jh[oi۵ZZҦ xMN{E~I\Hܧ3 ,fb_1vF/{'  xҭ i_"4b7\ C~;_K] n&Vp2`cU_ )SD ɮ;`ET\s56#uUdr`l@j>fli^z݂ .Ad ̍~|fƯ^(J/D1+ꃠ{LOu娧 lH >i!Ln.(sRak̍P]APQkğŋ[C7D;`yo|\ƖԷA',b˓2owkVtNmƿNBzWpR}b$V*]b00JeOzy$ŲXV<_?a V\lE'=u蟞nݓ9H Sc%dT]٨h~,zD(K)CJdްja AV%Ro-c@,GLYce7z oMҰ*iMRcO~ Q$#H ;nNi@ :yܿi"58L{jٱ*bH6aR1׾"z *{. |XbO#ǘCu? |d3f4!oB}Ȍ)i5kFBrĭ;=M;^i>Wt. <'2hrg ¡{J.[+3ڟmD3ȾirE¨1Gxt:͢iG^zl+6UUQC6O:ǂQ~4"s0RLNmT9 =/L=o;p'7,w>9I5bY)g(>AX&8Gw~<<-K]qZ*i;_,nsۥDA^}PH3dD|N#x>lDA ǖׄjpl8'P* }v2aDch#^`Fl\d16ᓲ^S 0te1y6 _2_& xϩOJ\}SiL.wF[W(a4μw&Ic\u?Q}6̂MW3oQL2HvZź} ~t|@Q4!;hxc݂֘S,"s=k{ ? wsO4Y88]C8u3Gc\Yt5tYrmQ(asE ֖ٛC~"9Dc^N@ y]xߢ O=grPr*K:=NuϘ}&zӣKORY~`+p# G(Kr5v߉+;|vQc*8ڬ7N2HmoR͸^zFT8.E9rf0 N%ʔTז#_e2Hu*6J;~Z=ȍU{] 7 ^D~+ز5S++Kn DbgH}S>3{hgT?ֱM0Rn3*.Qs$?j1@INX8.Ot6FG`Y#hj)}+06Wi"R-|G4'`un[Nqk`=3e 6ci%V4Fbgq+͊uF>T 9Maxmm ѢSP3r*V1L #ּ(=h}|.̛>C`j0,B,6޾,{x'B&k_%#ǹO4ý.Z̪I^"D$8gΦTd^:5}+KpVԒf~oy9-Vb'8ʯudn?aLEn]uT o)M/oƔw!UY o Paf5bA.J%̗ `_0Y@Pͪ˪F@J7z7lA(-eZJ>2C/ &3#[ ІnK IZʠ%D>*̖y Wck3H Rӎ*}F9ͭ%Bå:Ymյ_y[2pFA}nԼX_O&9_c۾67b98DRm\w,6wLg7O#} Z|4xy a"ټ2F,IrU8][yϽ?$Xb4K6 r'uUC#c0!nNMPD8$+"ĔO})NP*R;O)Fɩ][IϽ3+(=AJ&cwI-KIL!HSrȵsof$Vc0(2ڊϛU.v˺&uK1w}=’9{G.tU'NlK5Rdo֣`mӓڛf;9sR pS%D' :'e7G0IO50׀9c!ΙcgΏb<>IOv1Ͱ7C_',л[D Űk0<UyVMiq gg#j TPl68TTn9֟"S>pm5aH~iBAɓR\P v)i^x7D;J 3%X?m#t)}k1I;wD@:`qH WE@\DxYBC€,Z7CQ| y`c:o`Z֠ߞ8y ';!ثky8F帤쯧o,bɀe}hO-^!JXc췦zqT5(k9u__o ¡,}Pd \$zg%B`f; ^" *ґ5qkGIʶV3iI ē7Հb-V^d)uATRwiqՓة9~s;~X8KԴ%"}w@8TWJK9Lfנ]c{h oBje?pJkE5TP8uZޢI!9~&W)ȑE< _9lH6_)\Kc7޹/إYnnM> n\OSE=&]%V$}UBLRJ6<'hq:ztC+ed?qA.: +c<> -ھ{ߏ륛_e! AGո t)%/$J`) bAK i"tcL{?*$hqD`omZ#"Y!1_v`S/H恎݆nU`8 cD2ʲY!62|cب~bObg `7."ɯaLjS{*KS6'aؐQ}[r*꾜UƌjlibI“\OV%KjU'&!S챮:9YN׃E%rE7Xz!#L{;'YT5''bV^AQVddDde:|;6Ry] R31Mj7E]nrf*}rE/p08+X!ovJ"_ f #5:2)"czjϤ& (k{~.H}cѓnwy7yQD`MU6W*T:xMJ~~a(wC#ۋ=>UR$H;FZWZ*1ﺺA\BencyG%#̧/#.<Dw&M F խjySyGMmآ[1J.,(Aaʁ^jh dq,yS|W!b#Ι,+Hƨ`8k1yMf<[B3ޑo9_@#iYVo1#{ڹ 8aڽS1%R*Chc89^0x4@1:0~ @|xW/}8xD귲 $^ug8"w^7z.º-> YA~~WBwh` Q5ebqe.ܤp_r k&nU`|h[yZ=#` /@COd+.B$4MeO gRo-9-b^n)m0ro֤S47@d葌;:`vX߱R1$׺#T cKs,+Jf9,$Xo:9O#>K䣍̂@HYjYf CY^\L &m{ux,FC.us / ;@ތ` ʥPAO|-o I]0+Oe^̶ ApX,q2'fG*'z3\} .f1dfeD~ˣbC) Ӑp\4ikr{?ú'If)K6 dW4#9JU^X#BPa36?SkqfU/Z.惬1S?^\Gp(/p(Z1dzI)˛#y۞l]^wzG!@ 6%vB{)%l]APeְRBºE-5Bf3|ڭJ g.p:V?D\Wb*Vْk t,瞤xf oH D46\/[<ڪ;bu!h;"Wo@JӮt-Vv;,flܱ, t- ؒpжϾ90z~:S@VfRE-j4<i.q3!i oP\c+%7X4B#צiExru'(X[ ^NAeWw&Hc#c4du 'Ii$|& ^)mE x 7_^3\WjSa,݊OaJl%$ꑧ\?3XVq[X1_f7r1$CG-gT5֑v(LlZNܒʶ\tm?玈{IoIRWnG yu"w(|֝]T̷ǘ*";a'IwYj7xGi *vY'Pfg9[S;@3W35@$P<[/Atg#4M 'o =0iW!}CL)UxuXuoamdyqѵ-S'^h cLjmgdrQ5n#Q)QCl ~R:~ 8TOFGbR5{||MFP}N(M7ma8Nq&gpښ2L½jM8{*_H^uuGLXsEj%I~nFMT7AD[[*M%b5̇UIitF; &w<_>C,3~4q]0Zx$b @;_ZB۝|Cat^.7J9T岈 dȪPG7Klٽ+R<!Vl5QۛD0iWOo Ț'\ͫp]?_KVmGK[;ZJu2FHDġn}R"[ۏὟàOy67nݯ!7?nװ_EzZ Ѷ\`/b$8EuTTHöL`mt+1Ehɪ5oSL*V]]?Y6%ZEԮsqQGymF^ ‚GIh{2vՖY9`&) wloKOAYG81DXR*-*>I z(hȗ1ötd JtcaMLf,[@b [of{i_|*U\UZrcYLœzS Ra~8 AVhaVqiYRHU('aIPBRDtIPwoWQ⿝:BO n7pSED5 -9"ZqOg`Ny^f9rPe&Ƌ0P.I|ۼa.`E_sok4fHë\-*r |-GşX Nj`T&4$yZo3?|S{'Ϋ=QU {GB<ՁAg7.ܘ xL#wbxD++^},;-">V :F9EtS8r" = v̦l(\~*B`ͺiV 79]L0H_3?oO5YbXYa<*#v>>l; Ц5T3GIMOu?uwu:Rܱ(!u_ ?X2{j/ ӭ0\r h>-Q;E4=2Z$Ӈke7O/@y['Oi!/ {q{#]9X9}U~ +0C%d!v @@ͱj3{ hfR7QZ4/A?~}Vuz|_}ꄐZPVЦuƠG$AE?ElBӬ5f f/fzYX *GKdu-ʠ[VI*-MST6pwZߗR7D^Ѱ3*MDtdA@zB)9ԧ4Q8*\#4D(40W4@o򘧙r{eڦ5ɄP`eOAA 1'ȣ5F*P{ZuXN +;/`E`6 @p`Gj6miy'>k}( nj(-N7Ny3p񞱑%bxw@uU%p \V1kH $\.\ >D͟Y=^'Oqn5qElIDZakzDi0эhutGQ\P=GY͟K MH2p`L;'?zkh ->41C4 UǾ4 nMp9]Mg̀ Z]y5T Gdj%T;$P܊x% e@y7 Zu^~~3]Vu@%J)EBU [Vr#sM 0_<\ H\$?0)'tۄ@v(\ńROsv3W̺ ݔyߑ-];))%N:s&4p7b \~0yw/@. K-=*SO ?^Srb2V)˅b sLQ,E̠uL*kK엻T =gH`;LNuu?(3צ0r2^-8j)X EF7|¾Y4N~NWܖC݆K؄:<t :z&D Ԓ񍝢ipe-K_u: B]OFBLWMr; 8QE[Uhu(-i4OTaYȴ0s5[/0˲ڣ|om,ҤUYQܛ[rKRy=`1iJ WWȑJ1Q}x[KlpYn :>H:2Q8-<%^Eː_ER)dKB;WR"aUgf+o~rQaVmy/beB锰Tw%C']k.) &r;$iyVF@ swb8]rݺLuE ' w[)0@zB.<Rb/cF΍V;Hnt|BRXLO R_P`Y}` lQ!`k(; dixr+BIsF$KE3O|#>Y5])7z\arT@uxΰ|o,"=?^uaEf諛ӱv)BѬOF;C`Cs{*mN0@i16µl hO@phH?cʙ^ $ijb@PknERkk5*rԝpo ҹ1Ai͔Q4#/a(J˿Bfs>MneH QX@-xL"w|BN5=Ԅ~Gc%oO%C6q>>IFA E )xiJ'HMjVx=MaI<垤D((df;0OdE`` V5P]f[@V;xīj{fșF+yuU_o>XZfCX?~acB7&w81-ᇾ֞^z,|AjTK(qJ56*PB7\(c33"zȀa_".3O#B Ž:ɆF_o2OLDd1o٘X5|jAzGl@=[% "/:!_O%q)3۞Z7A}c^WmDXhκuFӞkNQ2YZFG(&3C0ِQH*mZҦř O}}A?:;l&Q[#~ S:̨vcf1-gʰ%\OR/dǵ¦DI)(]ؠ*z kK`z­#(O!tAU^`ke@F=Nd &1t6l;i iOHӞ2$O;./^4֜1&d+_hpfR]O}LkVO1nϫd۹jkO۰S}[ON7]nPoۣեˆKu6.7WmnSihۧOuh?$6>\s\-qC#:K|6!{f)uƣɗNZ9qüO<B g ~X(cx)W/oH&"d)+,i1~D@2E/+>[ZWu=)\D@!W}1/3mdL?jPOl o~}v˦&b lGH8c2)W6MMCp;%cGM+ H + T%OIN$Z.CuW1/ 0WV^1N2L:]trE iSV`uĐ>3jטUgU&_BKp|Ld۾ca8}E>t,iEGLOGJ.Kcs:d+=Bӂ/M_zQ]#9Լ6UG 怣Rz$!4Roi{ =phB( ;2q#`ʿU# |"ҙUB^ԁ "MGMg)?WiIk=C /g~7ܩf {ԋہ RS7vSf[jg] 6r и!D]GRA~S@ JrؔXfgڞ.%EO.0 o4 æ,ڲ//Mk{ܑ&dTN 5/bI[Mz۳Ow*JDWDR0:t̺3i}Z]eGH.l|vX\ۡ,i8y!w#=^SB/?ӓ.)k <,JI ](6=%Fďn_K!\MQ+1mw3 3Ɨ@QЕ% \TثC. C{ !kk]Ԏ>16Sȓ ,!_:XΣq^mJg95&_Nn29wt҆;߿{B,cFH!{*4= XblQmA>cC ӟQ8V 7+9V;0~ DZFIvp=gNJ 켲'˦v 8En&4k zFBBdBA!:9~ %6=zr"!6.|r!ε)Ɓs4a}P?'6Æ $ $]#Qg+UO+n/lr$^E*t 5x^eW,'=A~H {S mw7g=6.g"(>$-U h1l5qb✑e 2i@+)e_[oN;4=;˳!}`FG;b:< BrcERЩ uI~7]eXK_NY|ʽg[kpq]/b/O?T}lSZ~՚`dyOS~B*),v(uE RTߋj\bZ?t\`cp.lb}Uf@҅aw(Yg)foXhmW_KN'8y }$̈^[Dq0yj`Iayםvf~["rr%-zKϒҌ.EN?r:8c= {?x1q (J"Z~ GL(et6([J4*< $S,RK[>(.9i+oZ-ZhMʲלi2L}aYӎ}M?4Sj/}*,ωW/g!B,z¯KZڙ?|ce>Ʒ~<_wLK8,sǼǽ C|&TL?7 mZg|Hp].vbӕVF".Bg-RG=Dwel9̿;MvT!U{,_\7VPZa1Yc ,cA$Z_BBf]Rf^'T8ogLYrrgl<V3@Hc(5Jh 2"jzIpnU+ոWç~g6SMŬ=+׃ 3*][BQ-y6]*0TAz!LFGQJ;<q'F"]T=ɒ-1OU.ER_ TP5TL0O]SWSLJ4/C84my,: A#)2# Hr'q)vˌ<Ɣp,¹AqIRw}>aj$\.laܺzVcQb׈UeV"CݧW%p&f{vV>;$L+teoJ8]TnG^IN?]PQ $=pcݲ7P,\ (Z,r@AGGٌٔO\x/_dq+B ilPڎp7˿5L&vވr⺬ SDäp3׃H;|c>0!(@13QW{+mcg18Lz?טXZQoNYZO42 RzVd~(.Irr`4X &ϐ&hd# Ylz]JQBDD"R^ SGʭ_M6?[6 @R !/'LINuɬdaђ'B,צc_vR,@ŲMuG)YLט僄Mz{Wb#qPe!'XY{o ˖ oڐD(5hn&7;׾aE-f-""98hLCٺ*&;E?Db"Dqde)dcQ1mN9b߆_7i"굒dy}crK(6KQؗ8{}a(7 ;]GC*B3=C̹4y5QYK>IՆV ;`]`h 4=0W[W `z!ܠ2Ud=Dz DjKPVˆʐ5f';=.BJ}M7/oJ3VžrhU2@wd^Sx,,oPPMݑ-=}0(°\Z4I=1Ҷl?B UE*1MnQr` qA۹ВLTwvzFZ*E~0:gFV>hLW 7[Ij$ Y+u-3Rg`1LrL((2W{)4٤kXGgR`nkw_,:"{R[⺵ewR˸کd0KAxX(Nӄs_¦M⿽%KQ%lFc##6sLIB1L;zH_BTcb!x'ILCgSO)x9EPj^Dymsrj wY&IɅZƌD]N2"-违t[&æ|`>/X: [lHpFs.Ic2 +XUfTsӧsulN쿍/P nfV9;MB"p:0Nfׇ9RNYغë_HMpSK( Ų3qC-GQdIth޵0roFvip#ǚPћ  w܀v3 bPp;LbCLyfPA?(S9d&C^H {[;~}7D3QKYj C`hN(\Ɗ L_|Ɵ? z"&bJF+I)x}: G.]aP#eĢEm`*pem(V2|@ DCmT86t8^н{1&q@R[z~:C?x+/_qk~at5|~Xz3bCG2]MLNw m8`XnK!-E$4Ew C>C"R7!* 5t1C U7fIU!1) le.s1xyڙMceM}'@݌`id7]vR(GzA#؜'>O %b n}2K\DbKBfF+N^sOT!$VB1DAbsp92.G4tQS-aγ.W7;֍OcUg[q]G6/y7Qqߠ JF?7pOdgO)_zI*N3Y&"%W}9sҥʜOn o2Wj1z “Ҿ$t,V I+M(NCQ^hz|C(jΡ6ŌYOgN&.Nv; }6cqmn ʨp;h:%>gVL36XăA]I[SϤj%);G*W;/ݞ.l^w h].QO*U=a;Bd cmqK>_՘"*kuIț,[9Jt:ѽ%&Fx^27A,[z2yySj;*0I?[ Ix14ю3`_{QKĉursnE֯!&xp *1W03QADk-_fhaO MtBn1Dz*{A^e)kes.ۮӯYG]%o plq_kTrvKÜ ʬd5j8 +N 07&ll^h6|sa_S>Vv{^C/%[߮kv}0SWx5T ߖ]$`:0(\O|*x[rNDc;Až'tRqRA+R;~P:3`R?_0E'zݗ27O.E}ǰccѺz[ :ioo )H+m.n(!CfcQeejnQdy4Ǜ&y1YmJUSUcja˽U >4B{_x&%]ofri2j*ȕĤŬ/$*<1/GGYGQ[!Lhi!1D*@ߧƗn'bIA c:|ke\b+obHvM3zhvPJ* > ?P&`*Ý{Sk|GXN*]?ycyү8M #`!xIua~5Y[JHb2s#Ÿ;ғҝt;=((Df x͵ab73\|8*=Aw]If*@3NG NDVILAȅZ.-Kwf}+h&rN?^oYicQGcbZ~CڈbLkto<pul{E~jޅp$.x$C9cБQs`-;/M*؅N? %ZGo׶ }A-#F!Z:.V!ԁepOqR_:? c^؞QZ2FIC קDc07GD/YZ*Mrc?XOH`u[cǂQȬKj$WrH`S|ylINU=sU]Ǧ0-P搣4_|9qd&|rKsj@s G={2~te1jK4*,Hl|s@=XM ^{[(]-ykr&>Q*7."vA*8 5/_ҬبKϊrHvmWiоGl2j"xiϸ QnHw8C4&=Q2[z i?NN b\KenBdTLeKS FcXhIVq bLNJVuAPxѲ@Uf&!..F.;Lɠ8X hvִ%KU%ҧ5 7}Hzӱ zbipUCBx(|7W_Ʃ=Xma!xd[w>Ԑ3.&uiōEcJ%6 >C +u2r)g50#7J9*40 }v5v5mI(aE1Ml@Fr -<7I;Gt ˻6LRNl_|.+^w;Ug0 (6JsM:x+!EJ* f0 kI3Lq9r*gmRwC-xgLay]77%xq@"MUzJS9o$0Q3<- z1ôx>/zFs5WeڧB:Jܯ.rUWjn'o;0Jl5{ O ckn >>?Zf0<D+,K2v vGnsG-.7I%C?.Z5;Y+48@6S^-$F0fp:WsD5{۷kl91_'j\[oG~QbINSݤ=&$c1š=I qd,RЃFl$3)G>鯡r^'bⱦ 8i uh:]:MLXĽPnP*qy))Z\.1cAUƗ  .^eZ.&F0!:ճ ]Yi eiT%]yW}K^w8`X-YBtNn^'^JM:%y;Wv~Q{@"IS`ؑ#nO7ANӇx _2gm t.|`ws'H& I; [L#abKCǣ&:'hWb . $/;5Q?wHڛ;.X*T$$;.n"jUd(3r̯~~%8ܽ-<- z{GQ HٌG /sP ɋ ^߬Y8 3ⵣN킋2vF*gXϩr3"&E,[ ~1c@8aҺUMĹ)A˸$<,O'v&EݛK~]}`$swqMqX-KAm ^ wUGVAw>sΜ&. eӒ:3l*SI9SD#q2,a;ZSwۻ>a=na:$zI#/d f;*{j̷oE} I (Hc|E*Dj)\lEQ5 2)Iiz\5j=P OGBw^=C4ڑRv6Z̓T3qW|u@1Ft1g.~98]}}"L * se ##vf*4tvIL9y euA c.Ţ/8qQυݕZǯTRS%Ή^+ρAxxeG7sΔz2/~Y"BxTJvOrx61cf\ĺkEq_R]teQrA^c']홀޸Vv5.9N]xpa>6ΤV0sX_<@ `ds0=)Ac7f ɂh?`f9M"cz6?VE::6j32%p5I*mNŕ\O]X>"R(9;*>b?b7 S7s(`W'Ճ[8גE|֘Kc9W^&R~ qX~.(\t1ņy_ED0;2m+Uu䨃@~46E C9^L+3E_P8z?0*ml flk[; 6M.Um0ù'&2XjxVL6 J8%60|l?K8Af Zߵ1+:|/fw\IǎB~V.̽ ߌ=ة;"h9}ڼϫXf'd*.ijѓPlu\ g-";-*>Bzv7:i"۸>+{ 6ar\_T`]r3ϳX)fZadX ޮb}ƘZa3u,)dPrM=ѲiZQ_I_A@9:ǔW:4a:!' g,q/5 ȡئo.Ak=adޗ͝p4N)X #jdRcFyH#.kFO`&H)CKʫ-s8肛:6Oq A}.H6Ż`g0`S>7z[ܒpoiL `B(&¦0t*MNw鎛-c@Ա ɵ7f!Ĉ:ZeʜNQ2C[<轒QA7 ԃJn8NtoG:GJCONDFY%nj-3+ˆbMqBAROzfIR neb)5MY"&va+ ^Vݡ eQ]ʃK-8i:-˳棱K:j_j;+QAK1 X+O 'JQPoej7u[ud5 ϭ`QbPd `02U_ݭ0see?\($p0C~QܲK΢l7 '% O3L#j6}-*Æ%ے7~uUA>2]^y=7%"`JlOz wxZ~)[P"α*/kZCXEQQLZ[ֶ\C󰯇7YO =7%%c Xs$^,)C ȏ'}'+iV?VT)+Rϝ&&=< mQcDl;W*;G:R& <xT:mxxr_bwDG@kFr&[`l!۟Y 7DcUR~G}eŒ㢎N?>7ZuEМViO:KgvybSY2 ̺vno5ţF&x|1TKlpsF=aQUeT{Hɱ],w?c872 D[z4SroS#Sd?{+MlWZW{N(=#%2ԘBY  pSv>A m{xp]E2So vA^L)u l YCoO1׷PCP@ix5IR-z̚jā(#oy45dOB)i(؀w RH/0]F6dՎ/bDgr3mSˈc4ÝOnz {{?UKH,dՐ)(z&Ho շU?U\€ r.M &$=U #^ _ N9tb0a:i{=)js]nE! p5aljT(:eTgj[7'Wa/X9esi_4rGzBu}X5jZ̕SF%HҁToboD]kk*&8>`?]ff-)n|T=Ӻ7%7S j)qZN5r>KMQ0~">R37 ,|(66\z/- ASZVFWg6Au15wr7:_96d]Ge.D g[;G B밻(UݢJn A|Súh-l{mS#o{J1EFbXzt\9Σ6 _h0]d⭕4tJ.a `G:pz؛gҁk0'!éP2,&~Cۜ9Bso#oõ7fzI,;Z˧[u (ӽyfUJ/EMGVN1Y҉Gz* FhF9xa@dQx"R37oZ^TD\?tn,fS%ew `!8O.Cژ9B?-0I<ƹaM;"z_ OIy+{!m2v q^UXp`̵KkUޤ'ƪ14qꤊpzVhZ E;RQ`g*N#c.:P4g;SNyx ԂU8zX5qaƜvnj#u+^[9C ) X07nHcXn 'AbGܤ ]jW4 De:@/G#ʣx)[hB럡$;cΨ{Un{c0%_+ 7lfOqŮKSf 9!Ә.#bB(V6j;_~5 [je Uͮ)>iz"E rM[5s4K`sJD0`=]jM9vH?.n"sIH; %5)kXe!}WՔݮ 2+ sbvh X}da iN1w>L-{|`PonΙ)DhJq&S'RY3x;~dM]Ap[ M1CP% ?̫,(` ]_UB3J?=bk:fgkn"M](m (4> RT\֮ JoC>9Q,U'w N 9,(<"UĖ漷}muX} xW}lh1~}kU{e,BK'~UHX2g_HOԶU=(.9|Ԫc !wCdfEX7O6㋣|tL3ʍ 9l?."vxa9nJ1pR]لQasQH=5'm-b hL"et<Lȉ#%'WG.KOyN#.,_yPQO&Q>t.LNy| ' 7[ImKZ2s3^!5ÿ˵Ku@g݂>:oT\=2IܛOm!!̢Y'$L7 []tp(EȻY9Vdn-!~L?l]EM8CE 9*.g11Q4 aPH^ H5dwq J~WhҦܼѺYDo5ɹvlġU 5MQfd~[;nHW A}裊j=T1 % a >J?5,3ݏ2$iޠ#9mשx]~k_^Θ  6Б\f>}2JIXos^J;uצP(@dJrhYRieml +OHqE`Iq!c2kB[$RZxg'ajl MR#0(|{Q]3@>Xg ŀ%$&F©=Jy-}(Y+HDwR%2LSJxEuw33<5sԺxARvq[ܞk\ m-0>A\*? b 8dŐEk3MivnMF; ҭϵHsQ껥>ǝz XH#L)f UR~܌d:ҰǴmBP!DɅz-rQ͎3n= t>KD@?\mW6Ͱ6iM#w$"[ 0B/n17ؤ?LG Hqȳo)w^L`h֊gHtEEYwvUi mcQbP0gϠ0KI\Z _yх#gp$DemDiWS~?O/ͦ$~@@+/JE+qcb̛_dGVo'l|&f9b!5͆C-L#d@}Lyjҷ?-ȓ'Vh:X`ۛsJ)0d)D1h7Enۋlpb^Qbdf [y`"Li0}X 1E!nBY7qL !E^n zU.{s%~`y-Df@pSm.m=Tܤ|naPvF:VٰJ.}-]ˆXb涫ד"Tճei'ml+7 MI$vY$^Y@ZH9a]5ݻ΂NѪ/8h=؝;R`_Ʊ:B}"͠gx$xqN~ Xˌt3}GN0s5DVb qVBUi2ªJU7ئfTu'ARXhr+*vx2;`ۖ8;<*[8TU<0x5O}v%EGj+ձa _,ܠzAhKWEèߊ}TY1$:UJN7\].:A$B]&_06  zֵR?jZ)&t%XTU0d%78U03r֚^c+${ּLp ̋F4d+ԲO+D31z.<;|`7%pnM#p#55# v.gekr;{~KOIv ².H ? ,nj2e~H EU6}&P `Hj0_%Oy-`k$dOpl,#gk$mL|PPeDKcpYh~e/$t' @#Ixh%6\>[ vyǔ% E!]N}3러Ȃ:<ֽFAW0`2?6X( >CrNzćLHD X* ijmRj\UWmѸC~͋jH~%8:(JHhϴ\"KJw]o?{oE[_|N-/ U:T_ނ1 Eoو`9GlT 'y,VCD`Zqqk,(t)1h-CM>ܯ3 d~oH yP ̥y99|¸Ԟ;AD==WR ;4#_5+^2S_L!e7+ՌKkOi$cnzdwx\au*٬RnHh0NC>7HdAtk3V|^L),r<סl;% IbUۍz! Vأ_\2G8)>3mѤaIOY rd;A']W[KquGep ZtȅG8?oJv82LQM:po͘ kx]Wà4MޢBJl" &.1S6I٪$k+GgT3q&:SӜ>-'z]j1< b|LZ+JeOMtho+OϜ5vۂ1@C =VWnZKPQa:t@Q/|/y=NVэMYo޽#]ԯ(!̽P< aэ UB׽'\|{ WQEqIJګbCŤ+@}F?^ZqtU1vhg\k;qΧ 9j߿K`tAɥerٹY;Wy<=לn/4* 7HbL..OiomtG?|L=ˌe7Yv$xǝFw*MuM ,x+#Ax 6lAñXx4~ї}G͗Rϓ>*R+Dv I(Iӿ/K!iXh 0<5s[wa|T97s 1h6ǀy] CU_ J{2ɤzaT!HO4:f%/v brsT,]7q0ݎ7,jZr!-+12R[41edI#?tKK G_d JrP6vm/.ֻ^.Ca&L採IPL"WbTI^:UU'% 1*?K.yX++o:R =9g7{qYϹ]Q9ũAJԨ>XGOpT'eFf̛͙Օ%Tȝ1ibG6\[l4+٩s %\q 홨$AVȦF@RI0 9^5^;WpRL/=-3pPsBQZL:NZH_(~CA iӈ ECT%(A ϏEoxûWC`nȭs׺vk嵉 Ven+u8#D=乖 `ʶ<%/gn "u gi6;=9{l]Oyu7ly.H:PbEQBxXW.C vY'15fDP>6=ly\+jz})^čFXmZ^É1XD}KP%5f?԰N߼7yN֬b@'Գ+ 5^0 qIrNWxO21ŰwkPMw{|2'@;8a*ැ P-v4 Vlp~&9>g7O[_~BV\_]S v2+%S")KӿZ8Y,dYabz굆76oK`͏x'^]PioѹojN$6&<+\ vvs xe;{ʫ׻ $F)K m9Ty;Vg\e ի?%:0醺l cX4GcOiqLՔyfYYtE[~7LLw7(dF&:2ԣn!?Ф4]1nEQwbCIMűG7qʭP6Wz6V$<9)>喫Rk[vI YxÄ&?c,⁅86-]BP`j]‚lK-iFj7`"L]Lh;ՑE0 :4y̬CWÀE, @(, |vPDiFNJ0^a3eQNˮt0D } Ԍvi'+2|2IB^hI<$$]-a +[Gf|B%{24w[dh#azz>+$ *Khj@!}S#Խu3ڮ1 pFl# qaM跣i]Fѷ)X3\y8OCr{CM-kEӦ!`}# wæ8(?OqqnΥu*`}^D J\i*]yж9Ib ``@ RxHu.w4K <0Q)x!V6ZK+w!$3ˤa[j(Y~>E1- \(5*Og=ܙ Ph7Kt{*U уhbI$u"b *z[P!jH+UW+|vFyЕfKNP'nb}&[z{qW4(I;3J2+&)5_Y7?HK<,d~ lwX7ճ]I**cߙx B4cR K^sJ)MCtixP,Vb7e_JCq9#zD7vƯZ%};}@3/ufzD3lo!Ùppwc, Ng&8뻮s{~SqOp̫` ^=d~!b~p!9)k#vlnvcN%j is \6vت0*lx!"`Yn0lzE4G+s30=/-T;RdU{6e7gxqB)Pˣʪm g10fnYv: -[/0Z N*(dqFF{F55={yr,?4xϹ΢ĹHlxZtt.t\jeȊDq"b&ݮ !a>=OaKb<j_Zibf$}$zsJD>%?qF[P%UrcnVTRmA۵#8.'lk]-!45;M=Ȧ5V&grcWqcvbhB%Z5cZDdqg#9xc=%bdy7Zt>$H5%y($b:?ƤM.O3W(LQJŢgziƠF)^9c śJZO&-^JLFqZ+do=`׹{2!X,&}>o% b[3F_%R (2x,xLv1$Ȩg_{bc/-SU{5@?UاTs,FBp} 3+Ed]j 9nFT&/@7E9Uxh/,o.M9w=ÃWn_8tcР?qCAW9\ߦWGnI|w7To*+*O; ] ۟|bkI \ju0@<;ہƑ-T=VX'^;y=?Os4]Al>UN6YTߡ*4ZonI9R&4]-qzko9*;l?K ,Y3?nX5, H DhK3)W/;xc w̢f /q6(u/,JVOp-RD(/WE0#T--<)U:X8t`}| Q+DzmvN g|КWΞ|_ XT)9.> @WP5 >v6 '7osy TMf&jlLuZYMᒴ딓uH^A=?zl^<YN|D{ O/#,L3s2}%)D?D hyt%R@D ڬZ9- *a\T9Mf}=[٨W\Nx[`1tebbUNkf':ߒ41ZNBؠyڠ Mxʌrwq1֍JiaN>)@n\+hH%f+('}\SMe{Z팃 WMU}2R.3*CϡP@P?bY2S?#mx{"Hęe0WD5 .SY~ȀWjLze{ ~J<Ξ[/ag2bto+_6}>Q5~W@6& ~(I2"-l; _ $E33I 扁'ȵGuol<}`;OjC&v,%]163Y >7^F-o|{ZzMw:eD;c9AԮҽiK:Pe vf! u >M31$q| 6:h^֦?F8b<>󳷟ǰgսZ)YEz% 9O#8dKS$0}}§u$ ơ`L@ĕL "zzRۡuI\"oiEެY HBX~qp>+4(n3fr)8bCQn O8rxķi(AY{!0{/AUvu MuA%-D/Fާ&Xr }O螛d!*9fMpGv՞VVKRv_M1TYsN7$\>AiD0:֒2"_^o)4~eȣj V?A?}([$Wq -YG6ޜw2C% u nr @azvESk[;(g{BxD*N;_9*G_yT\1ZmlJM}KAU.UBѫƿG"RdzkŠY 2dt֡ðHC/k1sZC6cq,c30wBg;W[ĎYyA[~IJ|^/xjc klhF.9~X5ܛMk˶AX p׮?gRWKqM锬`; ZGXu߰,+6oXrr=n'ɰyIa6 8k8~&(0D _ +FeͪUgz!C'3>,Gӕ2gu]˛H|ch.,TMHW02*` KKMEu뢪X/p;-/Qk.?TwC gO2-H$w8g;O}N O S@3"F@2QRM }ΦC+&')=]U[7wD$: < CÌG|"HɮBV}n҉)5LJJk`\/Ol'"  s\y]u%2 [Քs^`lpHWwFwt.cP-U0jݑ EE uR8aqߋI49] j UbW,I ũd\"읡]E|Q5a\&jp6G[a0k_'~(Į$ ~P~6("hI1V0(@3Dr_vzv 6b}ilJȽi#?Ѹ? !B-C! \R+/%x$Sg>y#\2T;a1 +mF}aw08|+-z&(1sfwjL0ßq\66% SLTQߌju['jA-mvAd#mX&^!pcrfB>rWm-&1 ɊUzMF_KxtN]Uv6EOIeA\K9FUghA_ֹTߟotT5akitP7ށi.Y9n0fA[WW$ 7`vho|/Ͷa~8΀abdn. Tu[iqy˧Ό-c^(c)*TcL2COOV}XEPAQSu5#"JA%(6H@1sjQX= d "Wɘ{@rDvͷ?#euy{mVO.5@˷ٴBؙ;[Vw; Nm~6T)غtqq, |n?߾BQG!BU6slr9lVĽկbd{3L>I1K I>OQIg@9{ beP%_VQw˳c,?jB1x kPhf|ݲ:jzmZ2)6 SכY :X?kdhK$}K]m~]!75-!s)\۵п oqGZ%|f[CvT,B@ѶbI&p*߿ZU3EzC{ n-m/e\V9lYmC /u:RKKyGq"!&NIJx2fuM>I'i`Q!'܉x>.af'p:u7NfH{OٿF Rs&v5TPxǜt?L=ҳ7v8qDԪݢ53}sx9PV-lo+oq?9fquxE)5C{u~Rµ@un'mgAs$))mYܝ6Q|q rV_J!k.ʔRKq4l0$D8?љ \9*-)SSa@@T(߹H/ǿ|EeB bȣHZXDQ)䓯_WS/qZ{;%֐mϩrA~HN5viu!_5Gkl#~;%(+ROF9Ymٚ`Lipr&~(?&juA#Sm  "M^ơ,M/ )B(-jE# Tz{"j5zhҿ4:lxa|qH".1pqʣ3|?&cCPx6_α35vuƦ`}LK\QQVM 9>av=s!BR^K6_{(":mx0S:7.O/?$Zȿa̋O>h؏f~R_U?7nz̙-bOY_&PQqQDQʗ5I7ƭq%>*)$5hїE&6~seSgõ7fzI,ĨSx5Z i;m W=UX6sڈgq;FK$B)MJ" -i^~h*h|-Jnf]CxPS4\ VO놬^yj6,7r_ŎN(IUv:ZUSr:n#1™rT#P jAxq_Z1# ZGZᘚRw)՗|r.%~=yEH^vq#|xSu]fԛ,j7|2)EmvG2$ҫ rvvCLy;:R:Clzm#&B'snE:=RUݧ;#.3WZ;F#i /ڷ*OyW~Y$0<^&3Y#1O;#偬xݹ4ҤAr@zC* ]7 g]b3ŐPZiiF9v&Y,qy=L4P+apf 9OA0&pe%vqހŃV<\"ߑy#//jЄX:x8ݚ iM53m(Ρo۪鹲wXეKtJ]T 5ȾB 'y 1ZoI7`ޯ͸RuhbhQ|lKh ۨeȡKv|o?,2ս.䛝]u#mu?῟/Y_n Sn 2C{}{6m}MLpo  OC[?Y_E7ܯ}5kٽ}?Kὐ;O.Y6/&0 'a:K=f8C ob]+2]t]^+3R5b!;xT-ү/%n [9z0eQs_ؔR%NsPFL>>`X%ɠ^f>PgMd9 xkLՠ=Zz8UXskC( !3zkmrfdNMB~݇?1PeB <_.I*aUv3,c1 co`@r_B#},]=$fv^''b-o2sҵnZwj> .{ ʫfUSCFƜD3"\SVMx&{)Z߿@y 19#߃NVcJg_ڎ e#yiuŅ=(chí Y?s/:ڂh /'?ۨ :\h|CNp@7Hȼ.}BHl·F^ Qw՚V,AKċ[wigfmKUHX2!T1YrUbzLQZ@|NFiu}nALAVfXf'&pPj5{]TtO, T<:s/523ֿn.4: :Ց[猧Nhqmg#'w}[t{iaWЉ,`M ٿxSyC|Tdaq8g%!f) SF!i>>vӰk}\"eE߬vYmLB4 J<!]i +(6dz/kB]}BwR{"frNTLE%/ kQ<2_ES=&E bZ./\+=_ekq~(QASL߉:U{}s@42Nk׹{Z{VײsLՖQ~MC{HH@SA@o|AGWfH{ွACy=f<H"u P[1 2@6(!wGe͡q!5a>3aMQ˱ӕiYRS5Ǖ'ӵC89Xt#-ŲM@QSٌv}hH$GMcDP$ActrB@ <# s3k_S*<c`RVKD맍h8+7zKLucѻp|,h%zU3hXZU Kp$`iU~dZ<66NU\Rxߐ ċ6Gi#ݿѯlJI X,J*C?_I wK#n g&-`@̍[ mu l- ' i0(fHӻO(T1=픥/RW |:Q &AW t>W߈/m'h,͕g3GYa&h e }uF;P8zn i7ҿUy>g#IEŮ|c>/&:sN=ꂰOd%0q_{\Zzo]A>dCycg62 `s/@0S\Coɢ)8QR<ߩM2s[8Bi\:; $2=M c巴mKրO)\׌T=' rk5-Y7L[w07G'Lnj(+FO De8d\7#PӍt0T\_ʣI^%3nErjKdrŨBY|$ȱR/_XNOo/0% 0+(qDFDjA8^8w3,R:~Wˮ ]Ϻ7չDg"i>S_ъ sa Oy]1|A?Y_5$6CIu>' nS4U(pJ7d I/$QtemѴ3Ȁk/a*M^hu'%YkuŦd+H], =@fA EߕRѴYKGb A&{xt'Ϭyq"a;YE. S 5*)H͠:ܾVa˲LkeA{^07:iNS;'{75534H<ýq|F_aX^A!Bx][H&@1 =V+7V]O*7W/m3S f6!KC)NUcLdj-мbLʟN[hohrOVضlaaY wȥҿt#]ӥ=;PLI[ŨG ?w~'po4NA .7FG "Dvf[^s0N%dќEq/y_Ϯ usYi% ]Q=CfE¤I&y.i5+ADw?sd)ZăB#{e`ϾIܴ$u:XR(2 9qqcsKC7㬿1E*gZ!n2)hFߟP_, W}AL0D/T9.T|R!/zqq:҉Q,4*<>MBplx>>T29} h4{`M&F }5̀qef@}e/ t٘"989xSLv?SEd-hoH`%b7iGyԲDMB݂ͷ{'nv"+._+RmZi8yuU80D1׵XǴD,F#μhЂz#*'|8~P%zp=v!q^,ES.CHLS!LqmZgfA&%W3Up?ѝןǜK̦ܙQ63NEQ~ ^5CTaXz SԐ>6vt;?2.8 lvDѡv貀>Hn`ˌO"4Vꎠ>IleD&`T?l03oi4>e/xEDǏV~Gb?b7a|uf&g% u(baZuШ /']iSwN2?mx͑Gc^&<XSԌcيtSVhx?sVfɿyxPeI$ǢGNNI40P-R4>[JX/|7d}|4B?$r:6viŁg!\QtBaE2F.ֱL;f۶ Q)ޱLp0ѽJk!tByCLW8D&^AE >f}<,ҫ3jitDgORq{{y^`xYI K Lso>j#. ڦtwsb7qvУnNؼѸSMÐ7D hɫ9]LmuXeJXQ l,q piS k+*#5NE< e)S6_eu ?@ՠٌ[!! ӓї%D(Cr^ hÅPFռxB\\Ez 6]_ZВ 7YBT GEuG6z &Q)F3<`{{h@pr`Ls2H/^8NWxnZ-,_dyaS,Eϸ֜[[(o&Z/B~q1Ne- VRw~WҔz8օO69JhB׮M{NAfc~{N`ox(Jېʸ~jBq ^'Ji m! 98//4  )DNay9(QQH v> mnʑr- ibMK0Sdo`#Kw:/+e"n+Lg,+u͟C_!F뀓:f/9ౌ9 wYٙfgc-ݗE$ţ~GW;gD^(ׄ,7Y8B:ШR70D^r3 ahL v9a~m))BIц}n3չͩ]TM\%ʃhR(kqy>2sR0u<(j5{jIJ[EjR7Kh7!0y~*r;zeǏy2GUR^a p6Y=Uڦ$F7aZ+E2rܾE\%t7q;5'] aPDH%/i766iHY[;2С G):kdL0y MtGx+NU'=إfh,76-yDg$\^NT5oi| 3Wg{7 x }ˆ{G]kږЀk~ ~h A\n[Hv[RbA77W]+7ż&TݠE }(aʢNsX |&1$07WYPfCk}{&3Jtrhթ|H]_vz{ ؇0`ȝX L)3XC򳺘_;pvqR t=)de7$((&Ai ^YKhg xKO0G=sq㒠uuc`hs~Os- ݍ sYa4 JRIY5,71rQжH[Ȳm{@\-ʩ/ρ2{6r0m[%qީt4? X5uW9e#gO)%4iG 8SPH"'jtzd9^Z't;xt4vxS O9mh;Amۍ8I];^gT#6t9I<{X;l'y&Eb8FJ4eDThZFQ# .mw~gZKX y%#9>8>VJf-ГH I& z[lq_ YnJiyS{s5^}A4aA$7BD-4,>qVx#7C/'.ᎋ]n4;q&H;"v2}M4hV 9\-0BGX7K1r;cJ`dmxWc?v]$:Ax+Όm LAs֊Lwv~g (0Xiw$rƻCG>fZ2<,i)3'qcðP%VVU?yC4.F-D' ]OwOTU8#t`8kʾMX;8h UTxXMT0x_EED|/fW ڐA|<,cb1QzI fr1еX,ٜ~ 3V"(Yg ER]a 40l_Y 0P}8q`bG{FCm#< #i oU>!yHKm!~1%JrZA6r[QR[й1Fe"߰ 26J.&"@,jv @a5Ntų[[Fa #M;[ՋG  [rzp@` i>g?d'uygy%Yq+m{!3s@b JޠrMWS({GھaS/Z)Dh XVOI2@)yk#c2"M͐CQ6uztҼ%--،OəS D+äxAQjN )Ϸ6rW VU.d V]6J|$xn$;e|*ysͰV+GeInbHsA(mQw2 ^g?3 T`hR;eq`0 eR*[hu(°JC/3ʨCMr4BD_Aoit>3nqC95kxiF\}m}*蟏gwx^R]RB{ZxNxxk|tk\aӳ bھj6<_c̈$.!p8 sT$ÎtY?@ΰJ tU˕` 74n砕Q&'7PBVm\~<s$۲Y]%ם~&g;upB>(YCZލ [Dr= =%(PG 8hψ2 ;PЩ j0%ٛ~,zR7!a7ӧxVK( k(bb.X<: =xA{-yn0;iXѵ&Nؖ: 6H̟w=o&`3U+1}ބv(PsLc1UVCu(!,rG{e`]}I oaFD0߼kzN|Pe: x=N5~dU,iE²/Փxʴ5 9?HI6)=EG6@(3p I/N-2mgObbҏۅ*+^iEMƟкx_oـN46l.`.\K6j5lEh[(Ν9ұsaV>rNx,mdx5ZB $i%$(.]R7y+L$>;պ(+5uE ~b=mVt# щdad2AZI@A7.Hi.aؖwMĭURYɣ٬ޤNۛi\3 _pЄ{xu6% A&CBP:ԕ?IغU-7%fJkW89 zX1lUq\AG5k4 z+X۞U-V `,<ǜ rEd!ũvEψ]=K/o!-<RTO IsyG Y5 D^Sh~p o4}so'ѣ`e[ 5y Ni<3k|Rz%OHR&FY :;$l^">- fP I:ϨO IY6?OuV 0n-&$m1%W%hҋٽ`= NL.(w]'#bUAr!7[]PJYVHyW)2ඖ9ESon:XO-svh?GjHϚyx^F,Ajon%<4C.Ѭ֑3sOx[O8kuKRܠ+q?rCm"o[mmOpD@^yԝEpTvl0{*J"Ca@Ļ:/*tDQ_&vG6qLm<6!*|rWH6’rrȯyɁƋ+5L\UD5{4gTJr`'33T2DZ%jNYSQԐ D37|/&K ۔hŢ(,cXPWګo7C/s5>\Q:x{LmSغ,j&xݽZqANHgQ_K7ԁ0 E"L64 VUag"htJ_k v>?n\Rٍ…Le]UWR%&)5f{s鿀5|OSj,T袂$F^"7lv>aF "Q¶knJ ckאQ/n;vY;9tF"s I[̻u}K|#- $ ~sT@)GI.lm@Džt2IqST ],ZWgv嘙0Q=RIW~܉UR/G'G6yUQ̱=8/_~1s䊗B:#aWޖӗٍE(GCtz?jU2.*T_Y.w{ 7YIIнF<zݧԙ>UK?˼lפvU}ąFBŔh"`%(F-r;

Sc42.1ü:kO/̒{ܵ(CsvZ83guLfnbIAe:D]%UD^R4whC@Ib7\~oqj}1*ounON oV.ng:yCj!'?[IvZzTؿVyG >ɝ@EiG?L,dG=&{!MQMr&6iQ3E¹ `kE%WX! 5yс|HRG֤W&h ^+ UTW)PYRq\Bd:IogaL)6Acp6'sь`)fu5q|L?2Nq,39C>Y@9U* .w R9xX6@ԞhX g}RKYM;k'~8z VhMڴbDs1֧g$F%.|8%= ]x1iCt;CE$Z6Aɳu4; \.Q~[l 601-ؕ C;ӓrxh4Bk繮@7uMsUOx'КNV%--zRoVȞ쑰~n3Pc $e?P'3oRZ*Ϋb6fko0{KbBW}LU*ul]/uiW[ta1buWQ/q[Yű' wD銶}!;yQٌ|N6kĖxsē$>KsjioϯG*JNUK;RB1;p`໬M0 1;[#qݯEBSg"!8j%ߪ6 ޺]] F.%^Z`A@Z? ؿ L[X.X2bP{W~2XcRL p:z*XE9{\H'>ƞ1V3ӓ ,. BrvCO6\Y!LoenOkUěn+n_U7vSg}5}+>[N6k_ۣm)km7_msj_X~CCmgk?ۡ6ԟ[mkGi6_WeEɎ^q<ܓ@oG)Ӳgf,%QAJ1&Dbd穦mmbQE/鯞$l&%+sB%ڠЗHw,Myy^'- نу. (ovnx ħŅ~@*t;G>) w[Y\VZ0q kdmFn|Xn1m'&Ti3\c V*9ʲ)4MS$T^!0+ ?#5V|:UjcJOw/쏦3@ؔ]I0yի :_%Mta:/a|7u`[ &\Np3M}M} aNQ Tz*)wXN*Z9Wc| Z<ט8Ni3s/<63((8eM[mp]@ZJ1lb  丬ce>ȫ6[hgIYP2ZV}Ok٦~XeUnZv!_K> ӻhMbU U cCuΜbqGÔ(2`-=ii@ׂu)l%.,d[x$eεN,hWPP$F'ޔk/4 iV;3V^lo^} "!+(G-RBk6p잔:&DUM]ӊIӁ /egwз^dK֨+;&`@/:FVϭp@&xWcX+c(SG?I"3ߋ'Ŵ^jm"4uN#7x"`tv(4@G=Kb#˙Vm3Թ04!EbXzH̰fb8Z&{}Q幫VZ7kܞsq駬2AWUFg P ca׏ c"xyTtiQ˵rc=҂UxU3S'0 ӫޢ4*3%$p)ق;ø"Z ʨm=Fb9*}ɧyDҮ2ё5$nyaPi#V^DsN_qGsa~9h>sy{x,t${Isˌ+57(Qvj#6H J:za޽AD }hwv[ਵzJsRWzZN ޞDU:;5uc$B;0 AVa[Z8)1fG[C5:)`% XKσn/5TL⋬Gm Z:2wOG)&otyT0{)oVz{ H$e _` 76z.Qe(#332sQxW6SMyel u-ҎL }q>88n2ʟ۳zmNkRo{Kƴ% (8Zb=_ *sƣ}l&npiތf9ÿqTЪLIBN mNAJM3"G J- !&dף8jyT2Y]Q ~zMUKf*ҩEfPp= 'dKwO/yZ@Evȶ$o(" #kEcxkWR a*VT?B']¶:lu}?'DEz!2ofsz"ŇH"j _zimwM]`˅Ʀ)ʃ9DG)^X< Zm k!9 ŻL͎\9"BZVBa&c)FL0POql/䙱hr.t49?i^*O] z`$~>p NHS"{Y8dyZcJ Ǽ:1ۤQ_0=R}:.NP+^~P\Cd;WU9š8`2ea>1 ql $sxdl(@:*Z ?[2r_.JJE3Z?}څI$ Z]>Nӻ"q3hvcxZ3T|rY5O䬗E8}fv *; fD^M^X'k)1Ց5b M-#wU A:/9U_ƺ0o7x;PyU̲>êO @aD\u.Nu5/f2`ğW-د{8\6, `~ y~^h OR?'#2N{T촊`GTZaEgSeeM]xA\ i { ,f0_9gh۠!upLmGDV.SĕT/aQޕYֿ1pHm6O FkcfBщ W Pef+[i)12e'RM"0TO"'3%8:gXqWl>>w!RND7Hǽ@~KfI=I2z#z@9 (Ca1~MD][nZIk Mi{HDgMJÇѫF?4j< r$yWv;&궰s9?P[;k`=tOviq6#,O!eѺV|.׊PvfR\&Ӷn8YVT\Q^ |RqǝTAT1, @t8 /Ɵ n$eT #YO.r k0OѢȝo{ǜ|rIiZh,rM{{ߠ(z-|}7Z=궵Ch\@X7*GhmT6kZù tx^-2֪k7/ppa}mౡ{J (Sv$b?[o&lAZG+]#`ĊLW3Q)lv,~."o+SHQf<')t0cWe.|ĮK|-w׺|v t~d.U`LWN ĚN%~.с Ǧ;>C .OgB|sg=B^]rLK44\;B3=,Ǹ;ʜ)_s [my׽ 1#U{rE3GFi^Oja$-0h*b + G[:̖l8煺&dOhAr|#;}qy!@y3 CaHX6ԯ.y-۱q__ȘaF0,X$|Ĵm3դf,9}5`'ं1@LǺQBŵ.\P?ځ3׶WYGp yC< 0=GdJO^)?&WI!*tGՁKD?2[^_](#쾋1p2mw5}3o=վ#`5uUcԠ+ޔ芘QIÃ\zfIܾ>+"x%K p}V@0 t_TK inPVq̥_ߍ)i>We7!%'DZ!Jar1[{~'N]x>iy(vo,( *J]~-OےxY~(4.Ǔ Es{7.h V :[QJlo.|mb;̅oXYV]X^u$:~[h⢖ | Z+Fw!fm{rԳphR-_ W2+d{tFԸ?&goř͖n6̆Wo>mzsu( g9\01ex:,|IƎ*ѷXZy|uT [T 6vf:gИ~-]n[jX-&XhYShJ@ڰ-18i f yB(9UjnMY .e">o Uw> 8?AP'Hr"[Hj:{22N4Ժ&mP j(oT1ÌuH##%V$gÓbƤ[v9{?E_8z٘ 8鴿`=:SF0MPQ%@z]/) axGQK`~lH]ԽO/5̓r] %<Z㛆c8%o_՟IV@O[!*cw䲶a18?tQ#,bv ^ l&-B-y,ѵIB VDtc2:~e_%3 /ʅyQ=8m@KpZ)-)L $՝|\Lg>|疚lv|ɳNfu̖:GHHkQ&?Ј݃)oml>D_UU4(cOjxah YPI;_UwMGH5ɟG8<36xA j \/^!,'W.c/b5gs&uk%Z8Yr]SBf`6E "1ڟ@4Hj 8e86-Ed-qRt8__u--1]}D7i[%®+ &I#N/G []֡r@]7vg/"i7w)?`ΕbZߞs-u@XKbKy(Д$+ALN 퍈dʋ,W)][<7e[d_A;HhufE£Bv4q0e= mb`ޜPm6¬TtXG2΋(8mi0T-⛗$y} 6D@Miҩ>#YI*V¿0!Cw B*8Eke-#dpe%ũeh2 uZ(xEnTXp*9w0n*)Zy$|+R@ņM:A$n*: e%u 1q{8ΎMtkdo:WXɕ!%;mc,#S1g J|dc -y~, O=CLٮ"h-0c!K.QEȣz~@y3!'W cv*z %7H'^J;E{LR TY!=Or iTqsJt;p`;odF kIvT[^]>@D=\߫~Z(0w@!hTnݯ;oQ"P`eDv>[U @/xwZ _8}4ݻN/XhŘFU٨̈TjcBXV`$I^P=IuPJXN3#pMFϢ{#3?v? 1_e` 4_zV|wd|$Hߕ1Aߌ H[~pzcV1K=2_r1EG^iYG>~`u۷5}׫c?mDyRPyAZw~/nҤ U BGen--l E X^&QtAh֞ƯI¼;@n(E_(4_@֬#hJ_|pN| L_t1I $n68aT IJzd #xKVɊ\O L %&;I[p8P?DzfawVODP-w,^[,抭 C675awUt lJt *tz%Ydd8E5SSNvN_8Q<~jP}q8ũr[608Yq7Sh>O8 џ ƫh#FXi᥉݁^]z#ATXk`onJW-D_#c55ߧrP7ݰl0nSz! ;o2;i.]pT'YdAL+G+"19!L)PN>)Mt]gtT'b:B $HF0p%MF P1SMuh7#}ˇ9WJBP WL|\ 3Ib5/ qY i(ʻ;v5Qu;h Tߠ.ZʽA Ø{fYʻoG#J}Ͻ^cgN%`MJKy^L'jМ3dI~qx.{M+<">:^!633 0g8hзϱr74Hj|59;G'YFA^U˟{K%4-Ԧ{PhQW2i퐤ǎJdO%m^(Ϲ՛]ĬiJձnaBaVvI/+u/*$FgjdAob'N6-wtX _ sٳpld,b4;{ݻm V]/zK5g+WQ|Vao)سs%HY&̰.|T90P [DrlK<#{s_l3}0P@9>9*K)1˲Q^`/?K8yqAb% Œ|8$% mQ< ( hJ_ef jLAlV ηinRl0/XZ{W#vnM FoRMSfY(ɯ b)SA1H )+ߥ2 h~MX>?W,Gr4v'?w(4T1=ו9?؟AӵsniY`ߒ]TY7Ni @S/f+'45eGQm~fUH:&s`8f0ƬAbGNydK4w2 1p]8jb܊ZD3~h3^ am6:YdQ>_4% cѢJCHMu_PsQԱ#p3 .@ zgM=eoV?SjUKRk1krf{ˬI> wr\@dAv{ t rш}œ5GL>:VQ7%ȥ,wA,HW'o5uq|s[F`4#bi1_}q}G7dL:<}mPaw8۸I+<)6rX+<(Aaj` # CNUb0+ql>ȴ/"&C2Dޙ試B~XR55y-W} g+5v NUs`dzڭ*gЬ1Xnq#]dr(eyhх|+)brhJw3ߤpuPV4%~vi?NǖFN2xlr1_1*(׀eX@U=S*s)Ǡͭ  L'Uצ!B; {n\@ŧ ũ>b*CΫ}=~2a] 'dQܫ.d"b>3E ^=HQ<-5o@0"lNNyOAj!1AvÒO|~3Z-T0gS(CR9#133vP8:H> ͬTT2Xی:+GU\81IT7(/½ jXЀ$}p.,%I L xM fM|A"t*ZX=V0*Mu%'˨:+QgbM7yOՀ&ӂ߉ħ²y fzZ? U <*?T w5А%nJN#|?T<ʿ*}%aɛg=Yeo#qx4g4酜7ٴ\H"֊қQwQ[Ȓ0;З?s0ϰ gc|5FV[ x6`s4I_t8`*O:92L``ǔ );,܃_݆Xs-ǛNGnTjWnɻ-HDUtWa*ñ $5o8-Ua(1;L?OƝ F fb=ӫd!7/_K&a꟫~<`D qA]+RTY½H@ K?_$_oOk~ I+˚씿J99rjQ3:dt>~~/si>| EQ1armory-0.92.3/img/circle_yellow.png0000644000000000000000000011626312414772654015757 0ustar rootrootPNG  IHDR\rfgAMA asRGB cHRMz&u0`:pQ<bKGDC pHYs   vpAgg܊IDATxw$q&>3K. H9 gw8s;w[f#@A-;JFjURt{=DfVuUw3+"2=L=1O|;APf04B0Ps *`bQ 03~ $"F md1Q|To4S(D3XfbJ+H0 @4Ԍ0V F `q!믆f n@( H/ U64 )Jx_VVրU HBR   `!T i bT*‚+<`jʮ+oƑ 0S X^  A5PHX P B>+A g|ej|׾bXvܜ $j0,S#`C}P2Q 0@=,W3(0 m nƎ\92 1A"`DT!L Q-r۹fvl1ѣ$9(_E =4zEGԄYUϰRiF 3PSsVhF]$Ih͒fK)C.hn<ՠ M03HYAaP(̈́ AU F3n_@ !&"MT DeS!<`җ^FsȰ~ -,GJ0eJ *R(hBHO JPR( QJgr: ̆h @AK #a#x- jdR35ȡQ,*"Ԡ@-B P)5I D طAoK(6룾OL 'o3TG}30]{ a$ 0Jgo#oR]! ($!B)!HSFC;t놄ɘ 0cQ@3F/"AA3xiAD&43AfEi`FEG,bWE` Y ! ݣ |ej>|w b&#`)2Ve B!|?3!(4!iJ*4&2kX*@pUa u}CB`Hhf`TTiB5A,k<02UfMۥ! Lh(-ɟɣJ|*ejQ/X6ffѪ*0(H;"M :朹` <; O23@3"3fJ1f(E@FW`a&*)X8.#b4M<H@$$XQ@3)M Fhh QQhT(XZ4D3Pċ } 9v0XC/lQE>U25w)W`67gFsh=߆p& `4!Med ͕>hF]icoVMsZ2_v|TmM st4*R*""Bi45%酎An09*Nb1_!̀?|L Gȷ}Ad+P s31P U@1RL{nT*4Ib @T!=gf ABBz;nu?_uO#3<\'H`~fBAcP3Q)MTU!Fg(-Q4aK`"`BZDT P(1 N djn#ǐ(y^7KsXBG !AH34!D#!U<Jzcj$[@F#dTK-<$G|[r׎8DT]sf&EX4(M(d80Q@3$S^b+@s! a:F/R 1!l ajn#SC~ۿ9N}鳬=+=~w^]<("8Iߟ, DDJ-0IZ$%'T&9 Oy#bC$t-219tp]0ZzQ_N I3Bsj%A050*iF(DHR@0QS@.&@~zTRUaU: t@2CeXEI7Y8` @VD~"~!G'Ox( `@dY}d$^'"7ww_,sX dYhe KC>}&>}sk/η~=xt]>JؤW;v?Y`2d9Fnyk+o~~omlu[Wf@Vb~Zd *P1Ejd |Ԋjjx222*O8y+6$H}*CҌFq/h>+=37 PBRcsO{j_o]?MuBޯKRld&%4AI2¾@VjʖS`VMڃjUzN Gl- @f@Yш՛.{U:AV T0V *+VyHǦjVj0E @`*@6 EOC~U | H9E@ I~HQt K_ @ZGZǎ,>Lk8t_X>[//7 gE?3ݢi)y@++_ E  , DD !x@ tp"ISnø33 Fc8|^\b n1HBuaAy9Zλonn:"4$F0PQ"Z ʌ̢Y*iB2RQMcVҔR>kF Cy&( <$H@ ?I<| g񑑒϶f;/?{J#w2)>#ﶊOf<|?C6=}K:hf.Oo+ °Rfj sLj3w`붛 }h쥲`%kƠ@^@-#ỏRVM9`Mڍ|~S'fgf :AYVc%f*unԳFC@]nĨJb x;Bܓ<ߜ8M({$= 1a!{J{|ed"!_X\i>/=ܩ~}_}wafOOciJ?mwxOh#=^@BMXScI`e W4hx!ƀ"\?}uGvW  %L++zS-făit@E~zpOM~ 6,Kyl30D/yɅ0',H~Cl4?W=or;O0EoLoE0[Is,l^+mQoKi8qczQAlCc;Խ@1_/D0od+wU\`&9ϭ,zX<}NU5ƺ9k7kcSL1 SZu ЌiD+z$}G}J>5 G <sa@J&KzaH>/<1eAZAbaa_>w~=/cǞ{O7rG !03-&8Z()ߗLD 9!@h4'NYzw??:r;11P454ZsVaZOc)*i" UwT@fȲ%A0C~27mn [Ǟ::t@leU%'+׍!u x]eZA@Z=^:D!3pg,;ow~#Zhz}M $A53?3y{NDh#))%o&dhrd)TU; 6auS'Z+Yqz4F|a L{|H&յ?{?% !QΔxӏxl 7fYf̂Pġ-  `.L\gYط>s7~:>O=u=ќ9s+ 'eRf#}wxM2-asC*NHve!||?@c@ 0v+_8zNݮ6 @cb@ -od.0X' LqD C ȏhi/?/4,2Mp$1<%g"C`FJAaA07hZͧ=ۿ 7Y's4'ٚ{Qm \Tomw!;'5 r!$"Mdf؃sjև&SG,C[:(P] id&^2Vaj‘afguZCƏ>Z.bՆiu[C@!iU;n8vE7ǟ:^jNv6vM3|z ǼEm-ᤞX3zę37/>k3?]/y`LDD@_K% w- 8t׿=q_?9%:3t4lek|#y6p<~wegpϯPs; 7O+P0 oka_\:VnuݞeWK,! o5~U 1e"7xQ_/O?}f`aS}!XL‚4+ R̶fN=/2|0Ǝdi^,[:+͸,f%b %wX ef#0 ƾG/#nAP6;N& ƬZ@ԩJ<]XvC;q M%29!H d&dFa!p~|_9{߼?oXZcgO4Z93<%aS`G\J-!ԃ[04!#䋬 #pp--έno+U^d#CLmRr pp ?Ëگ|{@2c3}D .\GC<`Ekv_~w~?oW ͙ٜy>|ii|r.ʇf`0ÝU|^M0 [xtahyv;Uo͗Y YM`z6!,}Pj!p'. R +VhO bgT"V?ѿ:lWuJ0*-d{FIz)JDx,.>b^yk<v@/D|{3f盿~ぅ[w@kyG!LyBڵ*"G8X WT A]f8C'{7g6ڎ Xʣt !>jRpD %UT8;$GȅB!a" @ '%2 Cؘ_h~ /7oC?ibfE6'SȝS#V]A":u *,OB E*.SF^bnvϿt跿K;V:S) ̾yb23Sr]swOQu2HSxFz$"+ok-?@$ÀaUzE3g^oN5|h E@!@JyՊy?(Yxo_= ggybOZPOCۀ)9pD1a&vQ}v+ۃxgi#K!*w> 08}vRA'Iwơ#O7_9wO?:[.zO½0cZ9' e2UY-<8=z~*>=P 4 G@<}~PxIJ)20H=,$d}7~ ϼS>['K}ϰ:@<{eH1KTBF*LenZ:u^UN>M37##cv%."@ AL F/(,D8tܯg~sV ZO_R_%As 3g$jo1#P7!dT)a) s+WKZj^!V96 ێy Nzt_=v"G'2 rH&`.Ae?s!/c[a~Uw~~D[ώuN=gTe5" dknf@k8 mXLܩjzAP Mz_.w ',|7f^9{#_,6ޡR2˖КIBNnTrd`FF3Jf@)XE-¦mY{feyvnmի׷U5yII驄9>PGL`/ Gpy@d$5$u DR}fy3_|G)9eO e+*T|iz @j L K +[3UP ƿRm%RSH٧᭷/7&rh̄~ H6\E' L˿_|G 5׾DLO 577~;ri>||[q?Q-R`^`k0U!5Y鉒Cɪ\Y94f]`vyyqmȕ[[=8C~z$@}~Ȏ1`ܙO0 NAMP"P蛒iǰ7 _'WcKEp|̽$![=?!{6!=BV-LmRyۥT1P#A8' CӧD$!d9&Eg5 @ !X/r3f"ˋ3-KVWF'͙s}aN";c1}\khD8RXB㙓o| /.<՚kv`Da9 9fKh%DdߋOd_}Gz!iB@ 32J^n>}d'7:aQOn{SSydx@iwh19udoE4s}ʵ #|-@ fVħBB@~RY s@X &2c B4Z͙_~7~ߛUWey~N|vyO~2%}H}!_bcLA0*ob >fzpiWi͠fPWɣT}.mΟ? ,rRw @A!+?_7wQ5#1U|lݰl~f+ A|qqnvuؕk7:[UYi!0 &C?- M8>1|+_&@&`ON3~'-Wzٚ)>ʱuVoѵGT)q>e'нdd`f,kPz65bqWÇ/JL|a,!"L"'!3X xt/ Է @F"ϳ8/xV:Z 0f\*:zT> r n<~C"-:SMA|Iwxዟko( hZiAZAs@0 ,w9א.} 'D b !~'fj=7?hȀf4*}z]NH*o]=-ǐ0 n^z˟?zdRȲ },&:/9GPg 2c B6/ ^ )NrPd"-,h~E}~q$ݷF0Tr{yYA,IM/>/af5CQM30.2Pkp` >Ah[{E~쑕;/޲ig*E8: PhA/aG}KvnaaqF-,(`,>eT^iݫ]so=>;?TC}fKK[_\b&nOUݫL*R&AX3?DZh4Oz+ M|Ϟ޿?ϋD ,x0$=-/W$ȟ>wd{oioLߗgX({WmgLGZ;GBR s@aapop+ޕP4$BA%P`) ͗3󭋟xcgp䅘zO ӳe]4x, 4hm$nA}8{3G/R`C@  %W]6 ݕȲ 7f1 uS'O+;?P4RyO&`;ez:A9CD 7XZϝ^};3G~ORow. <ԿĄOS-2@``ÇΝ>2{to=|X!/b7/&/wⅧclHaa!buv@A30c( giM l5gs+~t5Lxih/T$Sx HΩ"V@i9ߟ}̍WVf=>>i@NCQ0IxcxDbT|٧w"<:¹7Lx /2ui?'S"\wFD8%/8wq ϛY nµۗh^9UHxnA BT RYVO.\zK-#3aALC<2܀UBE^(3ŕgo %#QG#P]bZ!O!f#r[`_TD fln~xTl9 |f| S(G)E9X o_y򓇯>ov^@ !!c ׽cau[}CRl2CCpǯڢY~IY3toO)jpLe|ts7kf {=@`IP`o ‚{i@MOZA8b6L̻[6Ad3Sy¥vZJ3G:@ȋCu'C&g9yflEⳎrx@PH= +`Y F0Ȱ|ht!W1I|ROn0Pn Y~VG,mYM f"qg֎\{{m#F) H0@1H1GQB>oо+/7[ E ȋ{*OWVbKAȲ77by}H9X32$Ռ!D(jfcAk6vF)b@fs&?TB7&fB5wO%bI7Nũc'Z"h2jN sv8`~ڞi()D_._? d>RC{ʓ!jpk0 dK[p)n9q,M*}h|H l {ΞS |ا$cI &^?rYX䀘}?<nǝQUP펽!|q]LP9[ʟ(06+9H ~ww.oy E JO,I9A,+Cayq@ȗ LT$1R<(-"`5?qhLQR@dt| I%i4 #0扻㑄zrB%z@مXJ̿',P>a?!SzrΕ;3E,wY 8 [ypq}T4 ė@8EȀX2ab + fi_тyA)T̄"8YlhiNȲ]}`Oqޯ!U&_yJo'SGZ3s Ӂ-Mh1_D F_ӱc.@JE! AIFfBShGMAfR౒}}bi_,vuf"ƅP¡}k-fIq_,$C=`=DaʪBUU TFHЄbBW/4ga{vQq?UMljTL9ypBg\͈X=8i6G81 ߽ 1ewNP%@2UEE- )KK 'i L `gdOe*;ptxF?Lcsh44z/ :G31CQ' FE ƁPIQDA1R, ++ 3s3k'LƧdRO>|H2! Y о}!,N$&"` QpLjַ o5O"zF!Ihe'e!X[KCVQ?\1jvEaa[j/7E6 _M=0PPe34 T*K3Xȁ[/scwD'4-†}f;\^>Ԝ'+; y>;)?W$ PO#01 ** b1uA:0;?>k ݦ1 +D'z[DD HhNYD3,-lu/ +c:&vTtZ" +B@#Mx5ζldl%|zO%jC3grnH7;|@ggf4{8@F &2!wa4sh:/ԡ E 8L VޗhS0i?Y Q;p"U.ͭ-EcB3w)ȋF0l88< A5ьq $U;Ls6;z8۟eG"NTrg!-vK9h,u["H`ޟc;ԧKC")0"`42 A$ԤheRo6 c223plXYEJ6sfdi}Iz 0/y^٨@77Q}寙H+1RgKD;c:XZnTb:XE@b9WG* "T/1Xia)p" Ҡ@W R @ pvf6o5eRS$2wy2c(K ,R?~0^ Vtf|V:ֻcsŀ15,b4x[j4 d&y8|hq/z;*,gC>N۰ףl8,hj x_+{JlQKԀ8dA(4q/!8@0ORO*SS " w; dnIT O /[]1[nl&B2@ 1A0<.T͢WНMX 0K s"-`Ġ:uHIƾt sX؟~> hu@|W ϟǜ2P$$F7N H_dRΎhbT{49lW)t|UP@wӻ3!v!30͠ 4'z61ԍg1[?JZ8~*SxpRQ|,="4D,`ǀ?:r.V위Do TSP|Ę8;;-5Dyd4xe ܻ E,Br`"Ȫ\m bd,@+Ќ  5!GmN!`b &ry]2"_a2{ NBdYX]jߣ>Sʣ Naϒb _t@0m5x%K.6g!Q15"iՐ!k%?gmLe*I^?Ҹ_{`B͠Cg.7nz-Fl^Ylӧi[gj"7è; z3V=^|g.2"X$rC0LeL0޸rQpGol50y#F_ێ7fyrLe*S;.{3*wuјk_kTp ״? DQV2ip*Sd?vFM'oCx== 4>HF`+Ne*#k#hrv.ϮߪGawt\QGT2I?{sV,;n2510;8خw*cѷ= OpǝٚV260.Ɩvr1Ͻ=a5qv0 fw۾,32Ϝ8I TkknU lpl  .@#`AQlj`qL4vm~IF TIƷiK@YJ9(5IiuHHLyi {/ Fup>arG+W0ݝ4Kܻ *tb_Q~]ZYch:IEP.Yܦ1<{0+*/DSxPuO{zz>&c>1@QOm5bʼb--O8WŔ#0ϢDډY?WꃼTq Cc;h\IkD FU-5@mP6U}ǘxe 3ݙ Kh:ΠYlh,af>ot[To,AJd]P$t! 2(N?TԆ41u7`9p~Qّi1I Ck ~Y >CS@;X1"ƆUs" B /Tvc=(WV皣?&S/k;E;hĆ*Jݑnc]>MNTS.@J j$J~@jK0Ҿ&A KLBXNkfa%`Mc\pFH`*!wGV4T1T~cH*F3Q %mXKX@!|*D1*F#i3f0Xi4㮥f]%![F`*Ox` 6X b4j[yj wiJ]eMDh*"`0S#ju\9 un;?iIF`2<ʓ$j)v-5R 0k_tj[cUk G4)p> z(BG(T?ԨR^6{SqKLci$0'SDd=.mnkn1zFz XR $j/EP 0 Bs `$L̴fڍFlڇ&v^%ES`p*OHhb10f{ab +usbXi{E}{$xNYZ$M>aQ+n~oJ/Mcl U<<&^ $tl6/e6TW,N(LDGs6*J+@ֺ͠uo Mc{D NB1Ngj#Or"{@ 9$bTʵedP+[1*$U*(zܫdîJB@,f&j&j.?A퉚M  @i=)9+Nvlc K~c(NЄN6412kk[/]oz `e@ecQ( #x0@E)~x[Q})&M,@fLnSip?x27jT4`gcЮ1NXjVeP?בd7ٯcO/Xj XX J@Ɓ*iz.vn;.E@i`$*07iHew qF I/<QZB6&{(&?"߸8wmQ0Mgy!۝ؗ(v6S`DԑDT4T Wn~o~(`,<\C( 3`X =YGJͽ@ף2q_͋snƄZ'S4$o5vr@# $5|_07GHTQcuڭw/|#m33fT)y\egD ]Y2B`8k!ȋ]_6gǰdko(^Rv$4|88Ԝ?~T?G30AIU$kJyiNV{ 6VU(7C@a|TV,9i!4e;U jg89/|p/onX ? w=DCI|cfac,:,hT5hYW߿OM&0}RG4{ˣK_v2$`o2pj%/`m_IX"`kkց%Zp VY Kgx\w4b@B ∢oP33/dݚ Lvכ.1,!Vg< OCS [ˤ(KyQ1sXAx W?Bqĺ)O)_xûGXTPR, 4U**E A;xk^;Sf%`\ϼ<^Qtre ]+͗YL! ;~1_u5e퟼1V7%A `@@P}UHh`E4E V҂[7?y}U ˜7ާ0 " /'ܻ< g+:eL~М;%K}.`g^?q{j* if"֘O'L뿈??Woo0ѻ }3 < HA6)TA*76/_~'G˚I~}=,Lens2YK1EڱRH: [eS\bu 0^uzk`߽ڿ;P9@xWWS(L,g*"1PcTnye$g0Xٿ]p&=lE^IMa1G34UM%R̘/(Z{I@?~o$OЧYo/29 i#sw(CY2xpLhݝyb_=É( E;=~ xO_pOԐ47L0Zh$ePonx{|Mo-Lg (=~ʝ[n}oܸcs>6 KN[^]yI ;PJ``0&B40q di_=LVׇ\ n@8Q@bzaYqV`8zsb}>;\6+m|B./hY|aWOĠ~p_= <}}D/!m'gV~wuwc^EM3_n1H@굁HX%*Zݺh76/ď**m?`#p'@ɉEWS}Xd0o>HL `7Y<޽yVTZ4dv˜{X}cʁEU9fd% VV?ON`UGݑ"4:,/Hk^ɖ '+g?n HCmT 0$Mp{z"L SSKST ,Aw76\t_LN84m"}B<lxK]LSyDB__eiK8{{z5P6a(ݭޏ~}Ѳ}9NĠw)LSisor:5I%/I߶zlV޺zm}3jU=~3:D!}kj lHZM!^ό1.]w[[ϾY`f:o[,F xsȳ/ v3TN?}[?{mJ-iUS؈c5xwC>6… 8wFR~HIo 'Hi 3ý*3|uhuXza`f%Jk޽rPZ e{Zu|E$GX~uGV/'Mknk1)g/~zzfK%W~(IId x܆R/Ō$} IB ;Wh3e׳^E[+D6F 紂 ~@E s4WXkK]6)??Gׯ=f&!dM#]w6L%vs/@ `u+ |7 2!R ~Ϻ# s #U |97^mjr$g=}R]tnUaJV`]B :kMoNrc!f77ğ^gΞG,Q{`&c`A#%ȭnYэCbmtx]ڄ Csך@Ǔ=鷓^uC1ʂ!{مϽZP/ t At,E,|0Q~r_>}qE" 1n!vi0*0jrJ?E%OOWe~xVe@w6XgF ? 0#6b'徎9}4"$ !I2  ,>6ۭxh<)XoziVaV2VEZ4q,i0{5h.A4>HB~/;޸z?u_@'yM лh%}L~ߌHwo|dE,^ ܹstaX"x*ʃN~JoqV0T5H4n#˗ihЩzDk¼YoH1ɏZzyoǫt:[ɻwI%:A@Ӭ$X~73[]_߿{prUɨgu@ŒSp~:N6YX< ݢTP!WHc`jI${SrpcL}V?{͵MSC7BуIҴ_e4`ׅkoyO{xG*&&ߏa2FaOm9423݂ |ijr_$d {(UD̚x?յ!סڀV_Q#`G ?|@Wf}Az=5SQo S P=HQ@A_WG4djXm,_ػD85S)/W-tnNGL_W+WU~$ ohok44{pPm_|{D jf,0bC@w#ǏGyocL lj l}ܻ"kC-)v*?WO.^|sPO}Ji40|)??Sj"oLM8-)A#B2=z[r,϶fMlhLbat@186ox$A#0q!bEcaTP[nl1nҏ_ʵ~6KkЏ]]J3c=Zbf"7^䄟5oΝ;Bk=Q)HL$4_jcsvx=ڌYc؄iYHn@;QF)d@јEQ̍~}(I~xKK?|kWN 'mm8շcW|ջ4O1wqy+w.\g= U . R{][ۚߚ[85828zˬ?i4vO`g ~{GN gG "Esy>3~4&/˷^Xן~jߩ?fCЯZbN1߭<[gN8YH,d`o@͹ŧN#!cP4o0Wrj| @\@5Š /v)յ}/yeac|ZjADG!mq?xɾpΞ=;lQ m ʐ FF[խͥPn#AUC CH[Z'JUwo'THdy X~"7̴9蕵_.~ri ?K!臶 ~g}5ר^?x߸<޹sO¬ _X]i>9l/_/߸z7k<'1li7 )Oh <o<p|8CxsFR+I}4[wL UJGR耚15Ulꡃ β$`jU B9K &h<~7Q4fзWF: f6X;bQ>;_xOvo}z߭9ʿ8@p0F0MԸv߿Kw_{ݳEDh>LFpMKD?K:/>.6%qz7Vv4(U\H,acz*1V]^9sKyjm߾V8XEu3JAB&H t27"$e,oL^^"zd+|^G㟽vwȰ6w\64H3/nk¹Sۣvca.~߼>sFDhq70?A)@2iY.?Rw^]YY)fL)sh~ZE9 BIw@M rC  <?p?/ƺI?* z`>,,)__  L+'W7˲tw2m_a]z <+3Tf'?{<%Ugh / Q oԵW7J=ykyy5"-NH*b1- dLL '/<~YVsUwCZ".dly&!\w֟ݾ7.onoEiP[x}'}. *#ၾOq >Rߝ3KZ>1҆=>Q@=Sf jN|ܼ~0/fY ޗuu]9ޞ $AR)(KhG[~O#RWC옴LNhNgCw "صAy]x PwD*Je dF$H3|/ $%E 30kP.b:z' ^سaR>{}{{‡N&pJ?w0x5hF*`HD^|IDAT>~w޹}< &0,A17yd`oͲ[` E@ *"of+/7J S-nw]0{;MHAJʲBYTHXXVM][w> LǬ~ߟu31*V#2^>gÄ@ H5}$rHx7HPo 9oN> #ȍ@0Zufѥó͕cU$EBZW:"gc R 7#4BQCo˘~cx/0 ŷݛ?ݷwx|0R] Al `#g#yQxC@|CEAߑ=^tL!T$ @_Y@Ӈ֩Z]Ok{\쌦O;U)i kx-tL.* z@xyi"(EQ@$s:CS=M>@Daχ{Q ?޵kM[{9|jxwYv SG 6Nљ1_;""!  K#P90؀&C H V0Pdvl?蹏~xb9ǕvWyO(IT'X[)D>0C$^0揟L),K-p;=-`.{.rץךy]7BS}jm34_bL6ӧ']7oڦ*t ›ƴ։1 SS}t3j5FPv4TTS53;{m O\y |><4_<t qFLkLHyzz/lڿ(Ohմh{a`B DC2aA d b0@ d HV EQNn' /+nc(>fYClJpfjfhi(O4- o]}_T:npy@ g *"X#`` *3T+ՕS7^?;ﬖNZw9gQPTLFk}Yqpo{vkm&X~'΁1Sg_K7oL&juyǒsk 6utT PsڰaåC  e( CEAIb%F h ɀ`AIEeŠ 0QH5O:kg^8wԝ:er]R(NNň␱G,yXd ˯ +sXUK[gz:E\G[_)ч]>j]=W|$}Mμ'BE Z +4(̳M*ƤU+-dyc,D bsP9E@aYR4AI2,PZ@%"p:>}j{ϭ?}۴+/k9 i8#[Ӧa+> hf=CԘ_ޯJԟ=+'eAV.@YD3N3 p6 D`j}mcsO{|O<}|Ayiii݁5݃;|t1YBҊBZu3|o35/>:5N);@X@ Lхwz(k&Z;UߚK^+WL'Y bH#s {㺬EA P/!jyhDR&__o~#Y^}'P@}銏pxIT$ D ~P1+jmp䱵gN<3;ۉ;~2=+ ˢyZ2U@d C%CRG}5罬5T0AufjSa՚%5!Tld7kύw͋FӶժڄoz'R,{l@k`@g}}! ͊3Gॗ_i +,>U yȸw)3 %/sBH*`ybk>eg}S=>Uݞ^,R?Q"!JdJ|2.(nꝙ50m·WkeޮTjNǯ|ykv~klR]ۨYߧW{ >jC_(rF^T/4ϥ*Dж壥# Y^|9oSvH~Z/$Ńe# ?}gF7-DLЧPH3 *J/ᙄr¯cRYVJylnN?}؉+ۃbwMWd:rW!~ uN*~@22Ȋv&'v\xye?mFiծ5GY+4k,}gy$9KЀ:݇SHefQ{- W>GT<ϟTֆWl@ f62 %wYyH%0[d%п̏!dRQiPVa~p7և+[+ӫBk40|):|]b]Q< q`S:k֦Wn\wSquMvֶmv]^q pЀl>Xropyzo 9}S~ >u\͇ *(Ͷş7zY^HmG򦱨>ZCg8{=n'rg (A !@ E ,H)ʢ*aqm6:qp^ʕA"u>MG cX' [r:2:iMӝ͚[`qpmso\ݳh<͚f6Mf+o΃ql ]zm(~NՇ̂곉^p@-4!!Y>KQ?m+( ꣂ DH'@D2PL+ڗ`ӑHJTjY jeeP=vzqrsqlmz8[?++pЭESQ&b" DhV b LemT3հƭnVɬLf>1~sxw]ulҵfu;LjզS4h;s֧|Sy; 4 }pL叙1%gJ/oOkodCf4"Z{OCAC$ `se&P`Y%K @ZXG(T$0%2JulcePV$4Jyf{q|YiUm9(,ڲ*۲*,J[BBIUAXVmӴmݰ۲벝ڍ4vm25thXwָN'AUF;d ؁";,?caX9|9`ҧ6]{`)g ۣM_вl Rlų1Ĝ įL̊kS:sf`!n3 x)89-ѩTeEF"ʰ*7תL"/2jZיFiZUDg3?6nnH@L]h`? []Pu ^ }\[Lͩϊ;uxMσ` 1bj<(8;hX":Wۛ3{Y } (2?ҥS`7JjmAn}'^YCՅn!s YgRT QBs=VyXlTr_vʘ|(`f;ޖ,Hх^,:D ΛHyڜ#NZZ973 E- K< ` 2 Q/Э}fS1X1AUD0#;, e@P\8P QD(EGhw\H( tzRug9NŢhJu܎i^ %Q,?OgK7=B%Ao<8D9@^{|VnAPbAX=`suTH;f8t-i|Y҃%IKb:-Y 펨?/aC6jƋ2fj(FxY_~r_+03&[2Z&^fHXLp܁$w*j0jtGnow ,0@2\~XHxyQY):b^F& HX#k|⟾jt(QBJo T DT33(!j& :hP40(YW)^xK. 3p3uA_Goz./`(uGB*Q\he k YU>ʋG4fShA T@C4w əl/%C(;D9Mjvм!@s 5!׏E^N5ɕuUQ : ,y>| KF$3E Ќ7:$t0'1&!rGBu)IENDB`armory-0.92.3/img/MsgBox_question32.png0000644000000000000000000000406312414772654016410 0ustar rootrootPNG  IHDR szzsRGBbKGD pHYs  tIME`d'LIDATXWklTܻo3xr6AmUU"w[)jUmQ!"&rꆔ4UEH]B MPc?ֻkޙ91&+]{Ϝwsfhmͬswd@:(=pt%s5Hq1wyHy_Owls3f . @ pYUÏ=NޝɛW>"hf k}q ٧c<9C`x1:}zbGzo4:} kR :@̈́/o LۜB)˜1v])׭/y[F&F, hYmKhϑ8YsZja._ qc|_n-XDֶy}GikO=T+Ӷf_[3k L)jؖ&0[ R~rOv#O&} Vɴ֣ toc,SOL1L:|~Tb\)YZO37ZG>d2xyz="uQ55>r( B>@nдfTm1]x D"1q'L&X,t:ԡs7uv 9 >]E JH<9 s"$D|6looG"#iWb](՚BEt!/Ɯ~݉Dbc?iIJ)ǁZR;> jr9IENDB`armory-0.92.3/img/conf5t_nonum.png0000644000000000000000000000045112414772654015524 0ustar rootrootPNG  IHDR$&9sRGBbKGD pHYs  tIME$-IDATX1 @EѫdA]$kHm#6n H@S;q"i@H1n7ia2: p{ld_$P[lNٲ,?[H H H 1&,7˙70m01VaM IENDB`armory-0.92.3/img/red_X.png0000644000000000000000000000167512414772654014164 0ustar rootrootPNG  IHDRabKGD pHYs  tIME)JIDAT8UMlUEfk4mEE(+"A RE1QqǢ0VD !6YP.-}wܙqES+v=ī'&'K#?e)@(~ уݰI$ o}M;Pp|;JϜ*0AxǞ褟r9Mn@1܈ g]Ck}ҀOb4AQo۷d1oK@CD_vCJe7vr>tNBN> 3ծ9nuvV89DȒ{s eu'7i3̩)%=jے5z/=dz8'X &<},zww 9<ј?mFcѼ9`ZA!rO@Ѷ ŪI ׌aKΖ-ЋU2&8v!k~(19&1v騧\\I55j(_n6ZJ]֕/>Yy|AuɁ^膨mzTl΀Q;&0ឹ c_?agE#.63A82qw W? X_ yDDDs>-;P8Z{x{ @z0KC\4ST\Meǻ☸(YY+q89W(5|iOîHBȝ֛צÐE|(k<%;J2qrKXĿ TJ"C _Ż:+"!bK.k l!(r7a@gIENDB`armory-0.92.3/img/logo_vert_black_text.png0000644000000000000000000012501612414772654017317 0ustar rootrootPNG  IHDR!%RsRGBbKGD pHYs.#.#x?vtIME)"# IDATxw]Us礃 $!(""/RD@,¥ ˋJ}Z@ \^D/% BrRNm9~ާ::kU93o >?rw s2{lޣʞ";?a>XuwqCŋ#bV # 8U%bCᾫ)t̙9sPVEnpBwppx50w\.\8B@a ׵ !VH6~ n?7N;88d>wX6@rXsvA}0^sXo͛G)'(rHs kࣕ9g.D~s.XH7"NhѢDcL9X 0qzBϣm);88Bwppd,Z%͞=0 GyVמ[cfbԅ'3Gv;(&s*=֘׸.(۴7g;cXiw;88ykY"oLK^ bd/wa]g>{ۏ^, \RP<ٳdU N'yy6T")kEX&1TO]spp gf…xuY@]+dskC_ #boN‡)O~篜|3 :88ȼٳgST0:ziZ}kih"T<取Mqz)>rSr28OZ㻦/rSp:88^c#ȼ>)La g8#'-S ~mZ7*c{DZk+1/),C< I׺uNёH;ױ_*p窫{&ӵ#LNwVnT@PZ+:1߀xy4Fw%[(W?zg~PN/8cF%󱐐`Uf%X~^PcGވ@;z6V AuRt`;˘ P0'8'8'vppn?WVEUck9S|] X{OLߨ#NUr媀x9oܑWxF9|n|݁vppxRNlIٍ.sՀ7?9b;o?qgS|_lUcofÀ;)le oϙZU .ZJ7*eRkwRƟjwAmdDOsEko=܉2w|= \;Y_^)|l [6^y! 3T;\Qx;%YbڶFH3d]L汢 ) 6~ S{IMu_݉atyYpA#?uG x9>zS|^lez귞zMzoVoE"؆qn i!QUMV(Meo/Y›?{;<:wpppS䈓ω(I89v@{%1<<G<&$0 /os^'^;y9ۤEUJ]5qrm?V, 4B6W7U{fZXwc ]Wnz{^ycvppO>O:`DHNA5z*J%)>,Ƴw}{cD8cXk"b1v>FJΪH BRG쪈ivgm1zr== IUoP߼dzÃ(_zaw;88BwV_x G?+ʰ lôƤ,3t]Mxvd2C . ekAHZ=O"b%~zNN׾5e&h$ WDRYء}1˵ZUdܥ~pMN~u_{_}qؿ;I]/o #柍TKV@micT7$n_$37"ؘ%d]SL=7!Z4Ѓt ̘?^Q* Q =ۈ9mfQUOPmQZ9%wp\s4w8&Ήu5էUZ=oKdmaQ8ʥp#B?72^ !{עScR EROgx%$ԇ$ -[-tm-AUD%lѝSEVokCd9ʒr[.ʣk{)t+wtuIʣR" TP Ƌi:|.?;bf] mQ}cYuQ1zOC/Uڏjb-BɌD'~G zxA禒yf` o] Bwx7]W#.Q(nMҽkk誨 ,nT$bpyB?Ks{n4Ĝ}SՎ$ʞD ? N͜ g a*\k1fO-aw5_?NiG<m zoS;}RTvga\F.FQ GVG6oiH,1cKy%d~seK'p{y1L dkoׇͮ aK`-~K'YXdMiF(QvݮK`M]P_Y%ЙPy}þ)Ksppő'QF5J"`G*:KV;fƉr`:xfb5qK9ǑnlڏtbbkLz*ڭ?LH[oAZHė~i5עkF˔7AY2^G􊨪x!rwta=;G6ϻkG?;~yYLWTeG$6G]*#LeX}o_[:?WmݳUc=I,S)~98撱F(Xlը"{!05^LmQz6$>B lXn 2G+& {m5̻w]7>կ;85t-;o6V@t5]/'&y"VLmTn{M^HO+߲Skb~wrT*(qxc.}όQl)R;$mہBĝFV 逇ɪ> ~ϵEKO aKȁ$m{6ϙثVxsp )t7yIFkaKML ejNBUm҅W)t]3W\Tz%;y:1*;+u7;{Ԓ}KΝ_هa82aR֔BH rLV!Nz&:J&> ˭Br=a=|ީuG[ YN464)A'I0+W*~[׾MT~` V=C&̪j;g讞b=DpQ/D}*4LV1m3'WT6 u ;ϨM FQT,vQ9M1&֍$8y.]X^mhܙQfxj5ej"xb=_oLƜ&2b7!ro\38%)F%s! c"9Y NhP@/}nH쁿>F57usj궛~d&9 Bo,vkr̿w84MPg8ՠJbèl2׿&"-Ӑ)6fŽPGP˳_0cuNxv00ȔII y7\/ [ß|IGt-g'|(n1Zw:o1b_w98Bwpx%!*Jqzo[[W mv|RD"-LT LTH Eu.}Oj-?cQ8򢥬lwKDdf3:u."-=BdLeRJ}PB|ҵ\Nڦ_h'd8)N]`p1P[>cҤQw|!(B XlMJr:kk-PX_4TBg=MD H"jWx-"VAHl [4oFalT>*]`6d!F6LTwhcegzWׂz-$y"KѨ"~*,}/W>%Z"RYq-Ex#GM1W0i>+Q<^ygj|څ;8l~xC$FA Zh-$?7* 2hM<cƪfo2V$ȱ~{CFq^4z;¶bZ"bWmUՎ:n[mP3k4SdS`+0 "&]?/_w_KXo63w+]aGeSjkBS6ɔKh^r_?g6[Gr&FMƛ~9*`YcF{ZOb4'q8r/5sjIZg{!VIYUUQJDYjU(>0"jzu5h 4Dߏb"c˃T.c?S|Dg6"Q=SSErFa$b Q9ڴBaij%KIunAHIٔ)Ki5I@BY2c< ][nXϰj)= +QMoA~y4q(R ܻ0?g1ΊB]N;˭;8Bwp۬"#EX 0PFK3:e wEr]:Y\ED/j-ЁoIsx _g! Kmjh׈ }~qK, .!Yoe\ƚoIa5uXXf\І{ms~g.3fQ6 -9 ̝^- Z`EBAIT[lcHh>@r|~k$,4S'BhI6̱SD@yLa Uw~Nj$#ڡXojL:JҘ''FHuf$#0V |mracai/?FqA/MABkݣC2(t 6riLT*>Lu}u H~xKVFf3|"up0sX}5A~B%(a CU|7$CoC/B"$("⥶nKc7R3^ }O6;un%&yczesٲDH4GAу CmSODogVN4r Hz޿{~Bup0j Mp&x!wðf1 -GbjT!d lU IDATc|Mxycpu.i ^Y.NC$]Ct$]2s.CEPkƘfCٞ`TXB&~t /üAve_O\YFB{? T`l x6LU.@ BkQnaЁ?1_~rѧIJLw`R\TKC6rYՑBO֨=liz~ܔLV~^ [KnҺ?S: !(LКmLdVD_W),brI˺hu| ٬yV'5w)yKgt:'IqL̞FjLco@=ڵa=OMz|~sH^Wp֯[)2d XK+QS߸/9"cTH8+VZeh)I#"Ke9(;wX$; dWJ&QEli`V5cr%qFBnZ!v:Ū&=b+j`?FqrQ:0[(IFYVl<0cY$bE_Tu"~; D6fhӛ5Ӭ/`*h]x& *6$~Q^aZc(Y RjөjQ**wXZYL)0 h<7Q3TXtfoqS}!4BI"g@$XDm|@ѮXd^-@=(=ȑbp%30 x&;R>>lZѰ(DmB+k4ƌlc(qOEkIny Dc{c2823ID%k/݃hi'ԠO Ȋ:(c򄥵W-ҷ LK&d]k H]CtfM* Š5 G(t)xV|n}ik|sMlRBG{NQ3% UJ!CEKJ(Q}##BD-cb+BC쮫`CR`L#<2Dqj~*N1iq= ,+ 5V~shBO?XeÓU2 1otԮF#Sc| VP^uOx$F6}BgB't2t!`DؐUȚ:BϮ:CGR{Q8;.[)wୠݼ˕᪔P6y:ġEQ ۆkBP ]l'!D* e)S(n֚B[`x**aC HBOH7kJ_E] kjl>Bi(^o!vq=#obq ^4 \E ?Nؚ#xJ$:B_+ 3XiCP#w+[sآI"J0\Z449&ǮR/o<X02J.EGHQďfr̦)bXhI)DO_[hX ]Ss(޳#hQ룶m JȺȿ>udZ y egY|ٟGi{hXaEV=}Zxq~#[n@b7ୁdJ}tPŋyGD (Xԃ !W5tQR"]7,XhE]-"GjVs5UɐL飵_͆ޭXkiiia뭷3~ςW%d։TӦ[CwbXA ^zqӂϚ,Ae=VىJ'wF'kF&p0`H7x䠑\ZJ1 w"։Mo_MoEWkZpco<;Z^*"1م,KcJWU1ttt0m4aPfo%}/.cR٨IŦۉl…C 4U=YU&s"R)n^/U̘1# g ?i/-gkN UG[Y3qdr/.w#tﮦ^*1ɨ0zKF^#ۓ１XڸxS kCP)1v}/>U0\Ѳ[{E=)GW6|hѢ 8)PJ#4쑈^E)S0}t BLt2N˚?_vsx^-8gw:8Bwp7z HJiysl# Up7 #R1Lˈ1QǷ<̆ϳg(CbW.FzRoo-睪]I]Uhq w2sLLyu!yE@CZV6je(nJ6󗼟_S7h-~_w:8BwpTҨni6m;% h2x+@I < Қ~st]k #Q|ihW?dž<<(,I%[ <ҢE~ޓXg^!̚5ml:z&~QSI6c9G %Aב-#,#J{w& ׷7VxCCѿvAxu6.->wU$"4oĮ̘1ӧKPPk lVU<" 1>Tr%|D.!ämPMiĖ1m'&uNHaZ7SBI֐ jCײ~͋ _MP-!Fl6qmoo"r \,պiiia̙ݍyڨYXi$u rCˢutKAy`^NJa;~44i&ʩs] oBc<\!g־%mUL41velX-SRI6{,-X,={MƘvww'%rIո1l=!*טƞJ1!9ø.OJh_ĘMG֐3m:oAi&GgAɛo]QNCsߞXE$UUJb5Tc ɩ@8ew=vmW6Ɯ-1Qײ>z0FӚ}լ_"hΘ(sHJ}5{2qt ;l!ؒn.Vڝ=oBgƵVѣe<( R7qFU[2v}a%aP0 G3Ffd:Fn`=kT7v;H3+&1"Atp,}WyxO=AdjS8)#Yx-Z[ 9] 56M 6Gq@FQ) ~** L0@2Wz աWvm7EkmK'Dj]n൐+-'?$u{^?FmBwp0 U|/5m(>Ye+cjdBLSuIjYKVff{k NH^1^df34uà.@Qj}txoVLԃ5k6}OU:#_{/OM~⧪ϋ?n&pSG厸zϋ l|] 7~m_(ZQ&!A eEXc ~*"V4-@gV)jן$VI>TBgѰ6Wާuhd֎B)H.NGեz?ǭKgc[zZ=dLU5͛VȮf66F7%%J8DixjF'w}WnQGcQ:2Ec b5W$R(j qQ+Z EEtp$4I =9ݛpOĚE5$HX,駏 SRf>q'I$_@I*N5 R!tk_?r͓q־ggڨjYf=J%V@XŴ@?!K˂V:W\w:8Bwph6hrYtL EroLQ0&vKl[~I8ly r>Ƚe2TܳMʊL~6y/&&xjjh<=2sj '_7+']ʑ/~񋪈XLk-ZU."aH__VJ$UjoAf㍮yU stp0|+ۃj,h").~HsN3_$>/P1n>*oEJԠĦ 1i{M͆ꆬ؂ODTᅶ4653QSyYƏڵnzbs&^;OxB\f͚5[ntZ|WO?,x`~3 Q>|~ |OJ J s~7bM_jU> ʳQsLQn4?2S}ˁگW%bmjc]A9'9骚JonTX'!׻ f1`)DP 0NLI:MTzV`dh #t<,p%uiZ5f=^bIyR\Umv/|y(gP=/goq[21b]&ʲ ~wrpf tMf_'^O΋?x LJa &nqV[իWS.{Vӊ(.fjKQT< "up0)4# D$9ͬkܔE=h&h2r|<,';C<Y(ftXTa\)u[_&?L,S||(OC?IoWCD*gw}:8Bwphϓ~eMd)DOe5DvΉ44sx47~.PnUt>Vyf6HX il<ӋM[cEÔ_->ǟ_5|'[ *i~!5/O /٤JիWW$ üWk=Ү io]ʃj AT4F421oHMh'k̓ъ1ly {p ]km(B]66iHf#63BE㤸bVcXA3FWTS;N|lD ظoq&l0B'4bxsqv X\U籮švIAOj'x+Q¹*}5eNXci(WT$UGDjz7UF\`8 51bjp8귀U1&8\]#0i/1]U:Ǹ\q- 6o H}h=88BwpTGa_}qoZ[["'^w꛴0RVkC HYY?<$o,%@i( ע@N;470(*nP'?Y2-诉wr4*d*Hb\iPqViXk/77j)K{(炈+dcN2y`<_@tklb{zGxP5qո*zYi~&˖ze^>&@ Nb/{;D U% Hٹ*A43VU=jؓݜR8!"1| 1BP2. W)5Ù16*'ԩtmx0"^"|{+SVG$6xc Uș?x|Grf3*Q,P=70.yw\WyϹwfVlrKciajBB  ؐbBf]`Hppʲ{$U{{̙33[3N{ݸiNO_tjkSKY=XnʄjA[/h"(֙o@J5=xUzrs;Y;?W$wSE2Rb:Â=5c5Еq Й}.Ruv{_F+3wGqXs8(;CR.GD6wҙsM,[b Qgsdq/Rlj0_wD&B kOiƂ`"?&jC?e^u/M[vSUuj ֲdt6|9F@` 3*q7y'D/4Wt9sW9D|AoXw {o;i6)yU')6ىԋ)v"4"L0>DXAt<񵴃A?pON]Xԅf:QT+&[zGUJdޓ@+Ox)0i,Ҽ\w_1&YԵ&K\AޮL VHs׷= {#t>w3lKcR7rwqR|;I;47<@Ek82cPթYz j)4<HyjѬ\Z^AL Kg]lUd ١Z@ qIHݣ3fREs,:+pI*%c3{Wqt_ѤcB E[sӳ(!u[MjVb ռL}zwcbzb|Q0B_32Mqg*$4R_H%ꆽZS#UH(U.-$2? VmqY>:c|68]r2SkǛ :++!!. z@@Wxιh`,#ufx9LZ_/Kyˆ72gO=IuGZ/"= 24RYhormh{yG("TblZEz&LHL4s7$wVKK8} ).DpT6f\/3Sۯ"Sby2{w77ui,M `4+g:S{Z1OEu,10jJsw)|ԔQM@siӻ &/)X-[  1ݾU`Pa0Q6)sJ9Ja!"RUoWUf*G;P[<owQ6Šw1Ƙ%sW5^s;*zI70>wKMisje 4gҍ+k#]w3/'Y\Kv;Q}4MU$/r l*{ ZGX~6%r_YL5±/x>&ìT̾pO qbҁMeyם3W0&T=etjK\A#dCahrҡ R#3:IԷknT4f,̮'#Ů-W]w >3PT4s a6#ݷ=  *l :cB㓹1 VQ"Eْ][aP#=g敶y{?z#;Y*ņm<hĪo1P=jEob ܗO5ņR}Z4d6]~ȆtrV]ֆ~O~FzsbTPkfR6k,rD{Je%؇n\Vͮ{]O.˰ipwd{i8[NW4ɝꊠ9nR.}0e#Eݕ+ߺ&.T/?-6 t+ou?ڕGhj.0nm W-g}ڌL'rFm_IygOBw?}׳j 3b7&/ _>eźC,Fg@ 􀀉kzcc'(=YLk쎌0@dr#VXEevK w{3xh5w_YON2o*+ܼ7ClƗ NRLd'/!z5wmr=v FL$1_T$bSz<Ҽ<Lhd}VUHGTŨtQ4l,{UGҺ = {yo+N۾+4UaSU^Y#`2,@--hz` X^Wmx+i̿.=mk= @Fҍ]DQ)Nsoa-VbJz;+BgR}SEmǯ*/8Yj &Um` {I:tc͟DrV\U2ig]7HFeˏc<H#&$^Sp=-**~Qj>? >1(sqg-4(0F&_>qlu;Q\L\qd. ?kΉ)D[~:]y #䮉ڼΜOM @]aL0Tԩ=@sqQ5ՌkfE^E Vԣ?Ws#|[ϔ!}*JFsU\1"]vfY憷[ȉ'|?c#OR]s3Cw^ʶX1%D' ]5w'<BxzcéQf5 ]S+z3 D:ZŘ:a5KF+~n/keak5|1MI}Tp珯zJV"Op>|ٮ4ŨKthAq)SԐo6no*p2֞HfԞg/m#ۈDCVG]3UB8CtM :BJ]' &ވPb> n L):Q][oF>gua`ςųG@8/b2۰,\洝9Ϩ=ٗW#?>:[J q!k݈=m]Cm,KSԾP\ٹֳi= GCn}^Jy<3  We r#0TG = c,f=W|2@A&u5< )DuR8w[6w#<\ jI:[;}W8BcQb:&"n/FZD2 1z$L] ./0ǯ3YjkP'.F᧘ 6a󀠡L{>89fk3mJ mfnSksr=qr9_fd5bYe=:ߥsy)SƵ^/ڪ5AQO5ū9&i#`j@Vo˫*R J#`:nbfBZŦUL\ED9uBF BTS"d ]}TQT[uYbG=ClL 6ai%}ˈMs2MnNEƍyOhC!a!B*|c>jy^QV\pbު,Uaij)M $xEA{^0ށxfT27bJ<_:8̦-vm"1QokOf[:yǰc6MwAu3T#*&X2*lR57=,g%{_p1K&~]RUsݶnJSN"<'V)=-Xxb ,_MCMjM7VRDOq=j0b,dVUc}{jqm qS֫ꄞFV1G~I/9:ئB-]u7MaBNٍIr ӋekD:ATPYgp/:k!||A =3! m{t8DyS}w?NQ6fy~FlJT2Kb رq9e=,_qꟋț{Bt/O}R/>6 n} IW\,) q/X(úO`\R_f@;hT8:8:/-swjnY]̥,/vGضn#>[d^Lo -MI32:,z==%{_;G1R a^cjrk$6s!_tzU~T:\U۬ `stw~"Gd׍1*FĘHmb0bg=H]y><8z dpp PVbط<נlˠupԮp^h;i6$n}$3׬{Iޭ/HkQ#gcc O\"Ҿ⨐n\Ch#&~na cf;ʵЋ{Cq"`z4]+MoKsD爳>V@ 􀀧]pp-p? ]X\"XY!MGdX0X߅bk}k3Զz[?M10,Eb |q\1h*DemZ ?ORU}OU 8r-[r~Xɕ>7{5*Ԩ6LwFzAb[Y|",g%{3 z4o<oK\uF$ȭ%6QdBUr3ZӻP0:EzajaR]t`6H-s&^[]sm"/a,0{lfϙ(//@D֊1Fǁ~'YlOfUa! = 邓nP99ONzR aVp_ey&~5 B~؇X9w{e;@xya ߭بsXB".KtMb K.n{BD|Ν@yIc)X=;UUND.\+8∬˭O!k3^\{ᏽX&a -a& IDATjЗktjꨭQj-mk[7%s8wkl gb'>w|;Ŕ$)Q*EPRZ-L[:5Gq %"ga-.~ݿf6^9)}޸~s{N9/Y< z@'ߐ>$aϞ߾ذ~-D,-'r^e# y\Qe!vK=g%ZX ̄eiF,d-sl3jDQDR$@j"1XlYzaBU|0sy=<g㸌t>WUl>Wc6Z w}7Gy$K. %O kg^x%7(_\Dvhp+13[p6xusmn%[=<C#-xd#>xp}vx`0'TjݦVO/_βeF(Z\ ܛ{{vv< Sg׆[jޞ8U(6RD?}}}v2 _q+#_A=>U>I9M܏H1f2 ~1AL=)i$IUpy03?"LS)v\û_xpBw-lٲ;cUu%PSU䮅,q>j8"fU.]M7H< z@_/W g mI$_*gETV521Ny9~Y=k``;V3[# |1Q&<ͽn)}๓MUsz$ykVQrk-lP 5x,Y&}@ g3Ko0U'֌|XT߈(uo|}2d5nhT\}|=O=zbf&=k翊m<"MP, \gUŤS3Av11lo^l"AUHi_922rQ;2?#BF%x4Dt}j(rZ2,"su4-#&(w٧HHkyR1kkyԒ!"F*es[o6 cE]Ƙh;<o>u\vw\y qVTD3͙zc[)XrɎqFȹudr<?Pٟk罌=)"D)&& # k*̞EGeMI眯}$ SGuTd߾dɒzW?}k @]W!#+Oljg@* sU9BgX6eSܭ4r҉Sn/[zX{$Nf{i>%k!)0P3(֙3LmB;{;/|.f/D=X[emZT}1۩͛Np&N'4/Meu3H @(`%_#6s?ˎ3',%Wcs“?'-_&AM,)QT.n6I]0puƞf׫fZ;!~jSΞʽ<ŻrݗΏ5n@3 = `xz0M$DV,oW Aff6V/{Kn6Xb, p%;q^[殢y2՜]wn~Ϫ cԘx;_< z@<qcC[oJj|Dfof_sdRY֑J}F*c\^~gWT1ǬꅪJoٷ޽+yMȀg0= ` ?:![`fiQ7coykZýZrݗ&ϵ*QUk\Sn@'MR璏r9K?0 z@@@W5u'8p#}[yow}J2<ǚ[iT-y:~N̮ڨ^(#.AgU = `,x  o){~o1ب*}".-"buƝk#QDꊬ5Vk|`6{p๟FUҏ 0~=^׊g~Ͻwaak;/;xP?Hm= ##YVưk?_!b=w}8OsO0B<^v#pйq%喫'7EgV"VD+"YlNïnWwix lF8Cx?ǜ!H]٩G*Yz2HfzDNxoλ4@;?ͽδ|Ytw:U>B$0U;uh}{4?%D ظpgxoٸrċ ,WNV~+fc`i壶w%sW4􀀀N~˥J䔭"+?Kq)CBx:s.gq;O.i No!5>V~=S1D~΅m;τ xs.jw }a蘀g/B=􀀀 RI4@T(HDUmlX"XkQUDD5`VR@@ gv1L"V`n}*n.^U0nRc`w"2WDzs.HZ}hܛ'4M"2Z[#"FUg;TWDg0nޔD$RUi1KEfO{تDdxXUMOǞaZ;ӭZuQj"Ri:2ߌZPU#4v9SDLtzoƘ9Ezi AU#"_RՁ6O>N? ۔ Yk5,wEQ!It.vU}'xMTTu\$"Yku@ǩ#S$tƪZREdY<10IUgjC?{} lt5`;fYT^cLu2D gZEDR u]"r'BDn7VգEd8+\;\j >cf旦1w^0Q2沊!";aUֈƘUudwU=LDhj_^%"[Uvc̗TuE֩Zs1hx_j'#E_8k:DDdkD&|-I)"u"uNCDTDl0?c}Q30U5\75Xc̏1{MA|S+^g}bo)Ƙ ם1(6y1~cVcL}sk3ش|5ڬK11eby()[OZXȟ?!"]1o P)5Ƥ-i:mX*v3e9"rj dwAaӵӰɨ"RD^Iۦr=mn8{Zs}4oz"i95"UO@S)zLc̐/H-ﵚ/m6Ԧ޵HOPQ=gODނm+Џ1CܿvEuƘ5Ƙ&۴#߃?0NE(rߟN|.ƘXkIӴ=i&T4M&>DzoBN _pNXtCvBL#drkc͝4M|4z.w2?{YW'!Laِo-h[XrMqVEqc>n7g^XƩ9WiJE5 6cjPc̫kv{o.O"yϲd;==EѫI }0yHIe28cc̟ȑ bUyO{N%9Üf7&Cȼn9ݙxqWU`c̋84M)JT "0wiE<y;[oZwzg꽧-|I_/˟J_fk>Yj7`Om7N~YU0m*P/ȏuTc BxcٗKI"1(eeykO}Y~ZCUVSͅp<'v4EOch3] Y힏 ZZٌby7i3\ #cfSik"rsb6yhvζ>3VumhwD|AQh=bGkTë_)h=7_DިB|mME+Ӱ:%̌SzVxMBJ;e/kx8$NIJѭRrM˨Dm جYʓ9xYảkc}ɐjmUCUUkGs&!6_+"bU9?ٺ'`Z (SWt<+7(;ef'm;RUUo(O\ڴAqf뒪n={ّ1qJޞ(J"^'%D.ο\3zjZ$u [ZcV}x/4I:E's9QUr+d149F\&U@t҇n#A ,S)ҩG._^; VD|18K۶mM-xF)"j^{}X3|S|`8VjxKAg'GcqToO'h3l.؋=JRT򍴨v3-N~1q"Dd1~w{HDMF[Xsv}/03`dɺ Wi9O [ċ}pVs?R4e۳ LZvb<4/t?&ba~RD6T0_4mg8>jcE ΔD aӼwWAUl)0:֨VM}ON$$N־ܛZZ ޯizo緒2 F:wUq7Q&i(64shTg'aN7Ƙ{ŹSEU}9nڑ/4MdyEV>=m ߴ>r#p3lizZ*_sϷdk:Bg}csܹLw,%NZi~M36QV{$`؄I?K ?/KKsNwt":"'#YBڤc%8~O$(Qկ{VDS2 Mg4j௫.j <OkqVo_0L9{8.rB\BI3n YnxU jabjS}ZƘ{ } Ac#"MU|2;6׹OD^G{gC("Lj9-6"rZx֘o.QZ5U"VI(m^<ۨz1f4MDQ4Hc XkkƘAc#DQGT^6+XDT#UQEƫy IjIܭOlWȿZk7cTy:cL m= xAEuLiۤCEUS7MUdԚ+h{ȣrSj %`U|jZnue$U[i45StyGNLDW뷉7$ԱcNһ0sêzvZϻ]%"?Od5k8sG"\c/Tug`]+$׎z5Tu4L4Ȁv~n Tu!0ciEO,~dÕ5Ϧb/j5[$ZY |̅WE;9NNATT:=_oκcLVtбp!NNDq_M YD8g?oGSJ蹔*@7_gxailMN?)E[kTR\sZ{ACo0=c#@x:-kk"LtRK"r1n,XjU=i:M;=׈ȭ9!c_IU)oRMVf6EF;EqPb}dmբߎZU"%C7ϟujRޯVջrYWӥ}(vu3-hhnT*"nR.Gq`;3DxՏe.4S49NS\.zтNO>\PƘ߈85%~$ov,Ӑeh43Z{B<ߍzoF,&yh1LqǦiz|7Dҩv;vj$q_Dxcav ֮]kUJyߐ,Z'YkO;wga{QGxU*jJez \.$(89/"&KLeT+Vf}ړzlnۣPsoEQTs2/##:g-JYo7ch]@ik=bqBv f*U|~:Sm5FپA!.7\522yt{;i'Xe/ (M*|εNih@1y{=BkɏեO'k:Q&"屮[8ЪCcޣy<5iQDi4M%"ǩOňbRW'D]Uݩv>֑N.t`[eP4q14w;wwEQtVE2YFV1L2ŎcTq%Vx{y24mR`10o IN֙?}N5ɬv!sT*-Tգk(ځU6|K'* b"I%``_:oxiM/"0pj$g+ZX&2.*弚,g%q/TW VωA1a^UY/Ht+`6{!U"^!"},ޮU{JtY4qIESɼK% sXUTz$jPԪꋁ3sg:1cFs 0^TEIȹzD# H'kIHqY|OئQwKp"bЉfi6v'c U?ֶ$^b[B[=ᣫTZ_(re[.Wxt1M$ޮ98U=SMsM^idz.\C {]}?"rN8.}2튪>_DbJ^O(SU +Lt0|s{m@Ui~JVp;E*U]SZvIVX ߦ$yRyV7ck][9we5P.ZBd|6 t}vPԊwNx#87t7}#-_-CZ60NU7cFU޵KvUos޹3TĒ!@!1bx hU@Z$U >*T!"(T"@b@& "&d2̝}^^w{'5wv9g?k-"z' E2yjDPET !qwdYu{ 龶iA[QMYm2C(f~-K0pf>̼+襏 ID`ݼ-[P:w2 iStHBL̯bMט#ĔE c8ēge1"ETV_pǙ20Zh:e5fxw zpL{e$V83cT9e c4"z3g3\Ksgm(yyS" "ڎ !̆eħh$/|pHRC~Vi|s&5UkZ̋*zWÅ`0H1g:GL!+K n~lyD0?ib&I\wNpKkSf>/i@JYWfDt0S\ ,c4/IDt3/c*Cf4D>2# _KM"TJ%֠>%֗k:^.jLnCe6c{8/%oU'7eM.|Mͺ2H1wѩ)_"ȥ҅G %:G HK7T 2(?,}XaUϘ$"I>&EX *LJ۔T ]"Jފ&Wdc(G@L"zWd`Ņ Rv]pOVreks [N"ѣwqrW {`4v(cMP-x?&U R,{Dhp߀5C3W> YJ&k*`G#xcA(zjA_,kCutyPXLY2 D(7 76ƘUMޅq:qٹUB@6Yo޷.^_gDsV5 tWU6{LyɆ"U٧ʻ(чo9pP55mat9%,p3WEaRGh[hp8=THkH#%ĴQ y~W>O"+gin_^"du.3U:?a'iʴU!3r4 uiW<չ:yooKPN ՕQR۷MH U,CKpaWycD^k.3),wA42G82,}sgfסyx>θw_8W87*onͮ58:$z/Ȅ>-HkN,ȉ{ֈ|@$Oc5#nUpU:?///_pfJiș&,m!l/vޯ&,qr#uf[rd8z*P3) іWۘm,:X"C=DAIDFBu˱WS9oq ~fQ %Ȟd2XHXm/kY*#e%I4%;^6WфRBَ -g+++}wA'Md %ޕf~\ea^=ߢ8f~JvP7lm>ʃ)"0_Dtt$Y#|}ʈ䀁k]@= ] `gbg `nH YGsTv1&LUsw߻Z{uee ][mMQD$!y%"iS}>np 6e|P/*Zvi \rG^ Oa"Z1 :"ZqĬG`@9hѺr1βl&$iA[oʠȻ>k4vKL.], EK̏iy}JaݟCJ}7]d8Uq @\̢"*$I>m} ڄpWP2Oi~kW<$I P [(N H%,\Gѩgnc̣~c.1^AbODcwa:yHD11 b~V,M'ʼ27p9IO1}{D9&j.ሿ/[2+ضmLؕEUCwg}TLЅEMm۶È70kyB_;I]H}M~wHF$eh,4ցjc%.m+WDXHPRe *h'M+ "Zt^kʶVxWeY9XNJ'ۚ6wD92n^?_hꐖJIx5oQuV1Oj<ߓGW^gz,"Bj䣌FrL.jRƴ?˯}'K벯BΗ{2ӈcE7[VbQIKT[10lsYj`D+4M:KKtZ9fı:|ƘmI u OXlW+e~ ry$^lEB`co/ c1~ I/w=^.o~ `| LDt=kuCyE,ۼz ~^=r5q^/+D?Z73 ~U uuqYڂ5_ib1+Q4uJ=ї*cݔkO!j%jrÿ0tQ:B95mR!wS)DOx2cBGDtiʼHx}3E¡{sw{6'QzM9u-eĦ5^<]Dx49Cx<~nhn2O7@~šqN;c齫ψ,mDPa7\ןZ:WɆ=\NBG||}$0\YA+ԓaD;NqM8Xw }zJڒv/j<ēg>˰ZWt$1do:ITeb e=^suD, HD&hyϨ7u'yIfhWe:[yRIDqjYٺk+”yL_a^W"GR#yK˛z%˳,{p<,ky/pYA5(aA$|ci}\y,)X[y#H. :j{o3ڻ u)4`<g \ RIDAToc p;D:ϯ"˲{̇L6p|~յ!o mD{Y\zh1qn$I \М J-g\\U3Y0MO>QQռ纱p]qbII Mө&Z mY=qe{R"کjxޥ1jmy?I"GDFy%\MыʶMj,$+^]ψVk;u#QR6sǗm9/Ͼ~|4R% {ն9oQ9X*8Ŕ&\̏0W˪kIsR " &m [yCM_3 MM77-7u[ >!'< k0(,]rZkpx'cO<_cW13lwc_1$ ;vt7syw6kHa8=g괩nzU՗ruZȩ(m$BʊE96i/ JDj9q 3_45*r qDt91!hY-z`-&S .f-Qjae !k.夆s;!O]_Zhwا8%Q)L? Ks=ϵ eE).NsD|?,'`Ͽ `@DۘyYc ׈hy~1Dt#Ufq$dY'Z$+h>&2aժEYaw 9Ի߱)c0iQk[2^: I$I^fI1]h1Nkm`N֢s R!1kO7(OsSΘ|OkSany<7j `6asycDtJ-ȍ17gYvg ͥ^q+N'j>w Goz&ƓpM Dtc珴Ke_i xf>qDt{}6EbXLڞ `7km]r, !랅I먦cL(,ˆuu1'0S:읱6k=M%Dij:"ɺl\%[Gf2j|N ߌ<7m ̃(J݇e ߮LPM~rz4A^v}kmk1PQm nf*;찹=mYұPKEɆ.%z Ԙ^BOʄ31OEXVzy|, cYٹ]ZmުdV0~=1 zq6LG/)tCm=s-i |I/oͪZ >ʂ.룫AUMʾd+hXfn("if)baزX[~ e6! ˾qsLApKax(es&:ԣ5E|2eXѬ tj[7X'],2ok6>YV#$nzsVk*ڄ7ú7E#m36yօ$'V&RzCu+zI!CAց62n^~:h˾.JzQgGO)Y-Kmehf kQ^V>UPw.] Yt4V_N;?!"Fmd>͞X罩'kf InIiڥ{N&ba-KQfiW=ch*9Z eR]#Գ8.:,:?id٤ipb [m%l,G.ux\i$ԽEfkI,纈H>i@ȧ#YaoyM 2>ꝰ</Z댯'MaX$IҩҒYkkkD0F6t+[ ins\GP%V_]]ܔ&57̍C=WoaՋXoB-tQ^]P)4"AsL/s_=J jLe 3vV]ɭrHUylFE7k@nix徊Aqd,Puфڿ-*qKcIENDB`armory-0.92.3/img/inkscapeIconFactory.svg0000644000000000000000000015227012414772654017072 0ustar rootroot image/svg+xml 0 1 2 3 4 5 Back Cancel Accept OK Done No Yes armory-0.92.3/img/MsgBox_error32.png0000644000000000000000000001025312414772654015670 0ustar rootrootPNG  IHDR szzsRGBbKGD pHYsIIEtIME  '+IDATX   [{d{{ #{ bzz ⰰEE!{axx ⱱCC{`vvⲲAA{_ttⲲ??{_ttⱱWWW^qqᰰ"%XWW]ooᱱqq ee"XVV zcuuᯯwwUU jjdd#]XX z.. !nndd&&44YY !nnaa__00__ ﷷuu^^ dd##ddOO jj jjpp %% rrLL *&& rrII 7bb rrDD oo 9nn kk99 ˌ2xx: Ň  '' ˃̥ 11 h@\\33 xx11 ii@h=HH ooff z  aNNܮ g  `LL۱!V `HHڶ$H 0N`FFڹ&""L XCDD)$$X w]>>] Xn & $IENDB`armory-0.92.3/img/scroll_up_18.png0000644000000000000000000000136012414772654015424 0ustar rootrootPNG  IHDRVΎWsRGBbKGD pHYs  tIME 'MX+pIDAT8͓OHTQƿs{3LOfÁ,BŒ$HpJnZp+ -UahUڹ C,̙7{ZL$MVrϹw/h3+hs˹1}#}H \2-v/ioDJɂḬ8ЄTЉTerVY)$Y_H$"HDD@58F:Bb|*?}rM:*c1_ (,LQEg,iu-& \Ϲ ]KS \05o Kq`Z}KS,8|^œsq{1Ù +ɧM]Vߋ938ӥЃKϸtI٢ЁB5o~ܶ4PL'C,??SN9tϹV߻Eca zNo8Gc==i8~rU8v>qyXd9Z ,K@e\z3N?pRG83?8<P,OR-kL:< \1 K`ާK.\ Uv #!{#g[ÃsGNE@1wgb$ox*)0 k{ Aexi~T, V?` z΅:nqٽN4pa?r(@®7ޡ /Wà v6zΉ=ڻ3g~ 3cxaQ -Ǧ›ޣ*y%g\ W\lƢ Km s|^_o/n~,^e(hy׿_18_a`Xm8SM\,:`5qm8s}U{~#ZL~Ѿ $JDŽ>zY6Ã_ 0XhS{>J]j-.<*r&Kw}oqTƒp˺1sMsosKmsT9gu hc㽁:Qh/ #!Ip,cEۃajK-߹װ8oho)PϲWy.ƊǴ6{YnX}7-4`zXh1E4.8w%V)KCo׃3ڙ'P||{pz ܲ>Sx9-a p=ZjXdl>[z ODb`Ԋ|`) ṝOA!ΌiGGׂGlK-9gأO͛7o>>U$NJGw}蓘ӯRwJQJOY|OaxUX|h6[,L2\q< ,50rX,xc3sm3z7aZ KXOe\ތNZIVz3ۗ' i?-O]?}do)O5u\r&$CTeg]bs`/j=) Vxxcţz;=ʻƒzΚ?`ܰ0I>InqgK!?qhd=]y6Sl=PdzۿE;73gi|0 p=g%xދۯ~}Ė^#!'YjR_G{. E3cnZ"h,4,]۔0c 1k<^<-Rᗍ =4 W a[M=cLEK` p=g|׾׋;{]@jW&JQZ|Zچqe'k(XhaTwVhoG'ʼnZ B}-ت3`Ź|1C- KZ.N[O ïFY~a-@kT]y#N^f\Ϲ;C,KM9*3Wڋ vl?jt^ ? D&O|`4 5{X/6 ,4߹seKY4 sTI'[݇-|™6=j@6#Q*Z޴~ܸAGC/$]]ơg?␖H ~Ӯaj9&-̟l ^=5V[/W C4P(En.:` 2<8NNE>X,-T5}4|bnʕ"^c^u)u(Hpal1꿊C#;ҮyQxƅ)X4/ܰһ^‘/FՎ$A?|oJ9ƒ7I%p=w,(>YEnSd2q%^. _U@޻~aǓH.3MK\9c?]%aΜ9x`1O PN+Fs)} [ 7KӋ민 `/]@`'9}MܙZ*2{*ҫFp޾*xoh޸?2pRa @7E'wo,Կc9[ 4(iG4g^2<+3ӮͰOl26^}V,_MV>*ʉdeD3!5 Tޥƺ oǞ#-jn6ycud0|ݢ `tz'|N{/dZmB0]4mI]繞Vѵz k,aC}=ӡ xioVҫVsq}Ã6%h!+ {xMo0V\-[Q mo \'oye 'Ã}zMd?u0zY0W{*:xKF9ɴ:_\{7fy?;vB n-u\Eer}8sqz2FxG&6L Ps)&573Oo=\".WMo80_2Dg_Qy|L^+e7qhd1O 3xi"!"Ѓ4(7F$J i$CsՉmmdު]g~5#)O,8H5s&~eoa3GWL -V0)_y:?Cp!M7d|ZLv FvykWm² sAbJ9G{)azU^[ErU>% #Xc6[m)ǒ #ڂ-&Dx <GDcUwƒG]9LY#4}'qqg|K. yq>Wgͤ|Qp fIQcA pmIL 4`sѤ`?\?7ϻ^tY.:5<يOTCV+b|,@erPKadmSj$**(UKG>&Id;q2|ȼ ozga99wSpO=R{|UEʺTTJ mw9DR<-.߲%Zbذ8Ġ7UTQTeEE_ kC;}Oy/=WÃjrgaJ9gKL9& 8 qu9T$Quyq`G,REəǢY/(,4gUQP|IdY $?m]sG`9P͛6ۘgjgQ Ji@1zIMUmIę˳gXDl 2Qf=#̅蟟QQL+ ąd2BJyNu: vJcJ@׷hƀ6}&z1KBNhcA %lk8$ yfٸ~,Ԫ]N\FX) b@/W (TFQ C 'LydxpoZŔ _ʸy=8oTC04_JꌯFr͡b=BbzS#(„|XH0ukDTQcrHJQ#@-F Co&9Үщhp=F[N;\ 861_~MJ3 `Gwp 3(ByQX.RݰF*2ūfvRPq\)\BATyi5H .\ WÃ`XLc /STsI$T@YL[~=@EՂULG1ZB29E i?dLi I@RxecJcxu)$sNяnfND-WxO- |G%BэP!" 5?k}ABpJ_S|QGE넋H d@I"EH 3/s7:\@c7y8nR!5իxpjK:~,xbZxjڌ̰j. gw{.LBbۡk, \,4+c.F2Jn">tB0k3@)Y%t1d+1Eq&8N?Xp=co3`Uq':}"eCs;\rHR)V'p8H( Cx݌P%nPZAF@|U^_7;1xj'Q*+63w}@Hc+h` ڀ gti@V2W\I(ŽH8SF7%h Vl0e^pqc#zK$7CA #fAl|ʄ9<875G9}*WKmۏ8r-_yGqa_E?:G=Y]Ś# E 0\< /i"?A ځnӛAY ߌ`J ["EG9W[*ogzx 9+!5H'b`+(bXwXlDD ^Sa Ƣ 2a+DZT{Jg A(b_AD6b;/مj nUt0ڞ\9^6s66;3Y<+u9Te}TvU=< -w3ULQ mrp9D@`H" TQHiCQNS;e22iZOgt4г,aF֕ΡÃp=7Gr{ o-̛o"-}ycbpp]Ea;eK<|JBUAcb? O^BTP>G2hĐB&2EBm*Ͷ?3ԕR?cqչ.=9Fm Sg?e ϕ}x%K#ՙ܃ Nr#-"[  \P.P?'0(`|ңW 7$ig{UGQ/1<ׂݧ; mKDel^s.X|GQy^j8PqE<2ra(,Veړ̃Ia%3 aIBU^Ƒ-D5܇/ÿ!) 2!$AaMH4 4[xp.CqnO9wE.ZX,,<::((L\J߄[pQ!҂k6>x!mFc|׋'KU4G-K瞛rFT9 xG헫E-D JA} d|邚DjBKoƲ 53(9ń#*DܴuKɖLsΆ& ,ƒyCWuQX'Pku_!\ҴBc#8< {Z{j/eq} D7@ʯKDTQKP~d%J 5O+Us>3ң a{i":k3ud*j 8Vwf8*؃cT'S}3!@vƅԲQ_ć=4a6H$Ã{U5ڂ\q< ,51ou0w UR~PGgz"=ʏvP@[`p4baXǡ(TFk@6*H?H&B5C(L'5"&-i$\n nq=M:eW2N^|9$p|>qs(V;\H#6Cm\ ǡMp83+NX+7 U0! uy>\s`#8V8hS 9]Xx8PHy%ߜ d9R8_~ "Gi46E7n3jU+ٺJzK9 9R(!՝r VwVR;lƀ6!xJ04MBk0QH-F!Ŧ3#j&V0bS8^Z݉ZP0a`d8$ 1R:?iVw0i TǠ%ځ8{KX(`kB&b`l' 1i/QTL<P=|0 NJH_"$lbm@% X XUʶ.7}D8<c"0H<:H*CgjB$1CM$.CYY*6ے@sa Něo 3O14c塠 B@ rF,'Bhb7#AEs` ;aI9G/I0\<oz)4@r ?LҢ P/xXMG9FJ " O>%0{Sga""7+> 7 ~?Oap|'!A.Oҙ HA˳A#] D;)$4X A?' ٵjwJ j~V 5MCYWHAl@8|QP'Nj#%:!,,;Q)iuPݠ(8p_p]߮׉@_$@CˀlXT(+&spYn%O)07"PD@6N1P'J Q)&y_V--_@ZuBЅ<$?2.h{ $`Xxu翂 `4e|F | X#X5 2?s@`JNHc;PH~jO|Q>V x(Hu"` G 0c̀% ala|,SI2H;~^c{0 n7[ Ku" g~P޺_K",*P*pE"P^HIDGBl`` Nh` KK~ Zr.T߇x>B. nFGH@Ml忹PXhP+EZ@ @YV8kOˠ H[}@|}ne@M]EA ϒHP _uJHJ/:fjIy%^֢ht4ԏi՟$ ҇y A\V"_T-cp²Q?g?iP'8F3TP!6`TJXpbz 0Oj+Ժ{Jb,k j/ pŧ@ͦTJT+2νB/6 04s@Y7{%*wӢ @vC0̥bPGS8%YIyaZ8M uO}?Hb&rSEsa5zb,| N<[τ/_&|D2&;ҦQ8њpOʉ$IULTFy%&~֑ ^eǔPjM%:Q1Q!7$hLPU 33@AL S;T|&B%]-4Xi(vGPq}@,AZyƗ,!(L$?@| I Q-iP*C(; 6f4)dH1nOZzP&r v^a4XpZy*-1Q4gq] 0W2qh$XP@R~U\3XM =@vCޯ'FKɨV|Kv \#E 2yP7Z cyE%myC1ى@-'ڐv҈kr 7*Bι/*D;0sNii`po@o@ 2Km_C !2 lW[҄Hy4Qtu@_C&* &TQ29k5!2JiNy;!@]"CWЫūJ@N(V BLF{bW'@%!>Z#wҚP5 5e@M$ǃ vw1BW!=("撪,r$B@u8g& 8ږ+&K׆"/'ӓ}!\DQܐn !)I *}V~_h m&6arF-3'hth wdP*7 1eM)CgZ uqeɯkžgH:/m&\',?9tH2&t4!Mz II3rB&XH .A QMSE(Cr-)?Qk G(M;7 >KK_A#5CPSca'=ٹg$ LO!ҜY5(@lP# : :$&IQiZs4!pΔIaYtX Y`|9B ga urOhdsSz8B@l_ 7-L#~MYJR iie ?HzHrq uqd%/o޼Z>N@SlmFi %":j^P?)?Ky$O+4Zy "0^Ĕ 5Z=ʹ4eB$$!&{ˇ Ge={k1fM,SzK[[cgP[[y5_M3Af?l꟟|Kֽ4FDSNa /k 3wŠ]fΒ#%UF]-FDZq*P]D򋋃[^5npkm_K&0_Xk^ 2ʚ?s/~ֽc7UL^%IDuI:l|Т-g ?bxfeLY9eLxxA33LxM<OK 1HאIH_>#OKYx-zx Q1GV#CpjXR$#ApU@™"k NMϼ3Cnד/}J(#'uVŦ⿷O0ƙnDU$=G2+PcfZM\D19pՎ&}I.6DɊ}4^LVÅ2b"KhE#Nh9? i5" ;8iPAU~ AQ; F/455}iԨQ-":a\-EDD2IA䖺^f1jx$SgNq.in~EPXUrD,bcW~rDDĈKTO(3󟑷0[pƍ{w%R|#J@EA+ǻW֒eF5XXZ}0H Wus*TK@qJU& E*){)ٻg++kpE1.)?6.}cY1 qKEfo|_UO'(s] Nr@g h\d5^T.Ӧ=M\ק&_DJU= p ~#y׷%{G &IcA+n b- mJU־k_m:`SU FUۖ!6PWn_{IIENDB`armory-0.92.3/img/scroll_down_24.png0000644000000000000000000000173412414772654015751 0ustar rootrootPNG  IHDRw=sRGBbKGD pHYs  tIME 1S\IDATHk\U|{&C2.J U.܈+Z"]A0ڏE#Bh(EZ$I&Фm4 d&NT,}//=3`ɘ Ϡ@)V4{ш(jG( !s&;_OaS)-Q(XmIlBbR,N (>Dg;ߦ*~bibhJč[OѤ&%i!nR][eʢU#>zGXYGɖ=^|ʯwe?!ehbM{jS)%s?VV}n (vaٱdK$=Ȗ(Ic9)jLdgaO@{E;kDRh) w;()%ST-GGͅWS!VNPHEaȈ!5){Gm5=pWr_,%bE*giow22=2ƻ\>g5VC w2ywcLO-N}m19y(+g9I 8Y,W"}yUGuAؑ_ې]܏\555555d555=><9=<;;<CX~Jdݑ^d555 555K5555554440245=<>é<=;;DTffuUd؎\LA:P555555555344134SA5V6-?+>ؤ>><;AR_fcU`mFfȅX<96555444,14C;6Z:l9p7`??>==LZ`cekWV\8i:cڏ]TE;-13554W>vCx?t:m6fp(??>AOX\_b>V8o\8h9ې]ݑ^ZyMwI܃JzDo>[:g;{<?Y>>GQW[DV9P\8g8֊Wݑ^ڍX܊T؅NrEpO;qP;~Bw=t;?.>>FPWY/bcdM;\8g8ӅQݒ^ۍXڈSzKwD<6/24lN:~Bv>>666A;5}Bu;u@uAQW[L^7a6c5l9v?w>t;QVVVVVVWWWZTPv@u>=@QWv[\]6b8xDG{Cw>t:q5556555???TTTRUVjM|AuP Wr]fpC؆Q؄NրH{Cw>k9+14445444333:;;bXRGzAu_8344444023C<7vU@yHGzAue9953244{[E{PوR؄L~GzA=~Dr^Or]O1m[Oĉ`bܐ]OیW ,444034_G8z>g8vWBņ\َ\یX؇RׄM9}FzAr^P\pq555555x344D<6z?i7uPܔcܐ]ڍXucׄMr^Pߖd555E444035x>o8nHבaܐ\ڋV5555558,14͸l}G_y9-`/YWvAoBT =e0ѿ;|C^ENڋ^z`"0P "! P^*[ed )LBˀG}b;h>' -@lll@'}zad^ BXE(*?G(coALQQ(dz>V_!z^7{ԒPE{mQ'ܸbf8 ||>U#.2҆^)PD`;*1>hIe*; BxGSUݷ .Wt+YS_QE}t P=NdoP4\t_Fp+qWWK;&LZPm8@'=``4]pqOv8&d^/ݟFazg7 %{~=ˍ_tʵ]y{zL+>$ |*2|`&ݽr]wzL aBæ BpRwxd+&+d DbeLh2X~LAyw*wezgmTeʄ8"9LΉwNב(zgX0D{Fk 6J+7xe[ϽL杌^'ys^%8@k]ئ-0s;LW;=^~ND`ɰT"'N튶S{/?O~(;ʞ}9]^+`$g3.nYQlqtP;Pm l_I%-uRg߾g+15|q&7Rl\AгȂ0g̣0Hm)@#}ZDqٷ-_ 0WZ0nd̝4y ?P< ^ebH6^1("mCDRrJ4uybκmY.+|-qoo4y30QwT/r+rf#tg v U__ 궇z 짷(B[{_ ,vsR]Z_ڋ_ufjAbF"6D-\Yl૟޺oMA. K|+@Ipׅ1]_y*.o0H=uQ[G( v sx?r?gRRe_ IOκh"6F@nt:p*ܳ q>[[nFd2zY0Y7I|VGP8gOn.4ׅMN <0jHż~C!5;K7ŵ^YJz $0;2ؾq CP#NPP_ twSi7} Onv8˵pkOpP74M8qwm~N>i߿Q sm-}OEŢ`c }N{lYƸI_Ɠ<ɲ ^hpgs(3@1:T ]A*#|0iZ×/_ʷر \ȉ(/EL$J0n䃀p{(߼Y)> T;>PF ,j;Qʠ,yv"߇,tOj8oK&C8{g/cO0wL& }Qζd4D(dfuDlgz1ȿ^`,zL,|B2RΝW AmM#`ΗT}XFt!if C(ec T/Sb[2w @(o*`?kJ)7AK)h{3vPJ}tqbe>uez6z-,`A`#!QlE%'\8ڑLZq&܋>/v7o[.gݶi%Fy(BkTfpz}V{kcy~Yf) &Š,kq&DCzjR+pZκTκuq)[If6$m:;1F 2V7}bM5(En:/,>)eTmbkkҒ/+y벵?uגLC{$ BiQH¬>#XHæ)z֓ؑF7 x(+{@vEj 4u%B(@v?Wθe'gcY$dBv`"9``XhFmf]Lu[J2H)JE\BdJCSr:)-51FWf(h8?w'Z@0k\oɥuL*/Oobpjqчެ?T{2%uJj L!l)_dۦF}?3n)m.EX׏>Gkp 3eabߋhjz3oE[YL @=)f y $;;rƋ4lE=kNt븛K/wcB;K,fMqb'f ɣ ;odWپ]lk!_? 8 f'oAV5 ]aig強X9M59 uAuKAj@&2;Ě=;Nx' "vutپo^'P x?,\hXc5 Aز=@8ŕI z (>^I=䃁?i鴒\H :~FѡQ'j3<+:zW|]GfoضƎf4O& Pפn0Au0$`FT;<6`ۦ,Y*7"vN7']0ItQt˔!GAuXi/J)`!WK+RSh8 2^NYq_-=>I֧rA*W$O I6eb w ج7Ftu=3|8|W&\VN4{]Y*ssǻvl%H}R?ƎԷj+Cp~رJVno fJll6Sڞr?lm*@tPMl;1h1`KC97ɻ66*zD;hC\6߫Lj{"q1feë3ovoLϓNDP "PӀ3dWzw&WM\SA0,0FلUJ\/AE4a1 PJOr`P1_<L?jErJN;Bl%ɄjN]ToK4l|z)c2!IPzȎS&cݥ&phF*%10F|Rض0h~A=YYau1D |}~6AJWH3mob[]skr$J⧁50xh&UXUmhkZ ]GAs9GXAs; makuH&s>榚'(׎{Âwy)ȣ6hc=WDREhn#Nwu>Cߠ*d ۶EzHKDmu-IsPK#7?j5O2P2ۧz*$Ǟ(_8-kG4gβpֳߝ"e#F :Ӏm꼂uSqZ䨔 !G?[=7W Wk˜4X֋MҚT>FLm/NMږnŮ5p_ZZ'em,*ਯƝc}q{tĴYSe+\#"Nqq1nJQUz|qޟc؍^Wmu8d a!\^\_$ܘ]}5XcYH)Z6"B߾}6lX\ѮQA*sf[f`α>~,96;_u]d؝ThVLv:J9V HqBeYÀu Zn} O1U : EuȖVK-=6iQ<6h{*Y<9L`fr+z6YlY[a߿.E:v01qf P #F ???gl_%x#i Ӣ,=6 v36 ww#귱t5[a6cPzթw-z r"nСC[)Q@Ju+X[H^Y#yp}'@LKucM+P[HbYSK¸nA̲<+iСC۷o,51n| 1,#!i^-ڿ)&J)XVybu(et!H)lR>-³,aÆafk/Ie_5m•am*XҶ+GMlGڭ(_B>!K}qc, $Ε5Ր!C$FIZ ҭ=y^M >(DEWkزvH(`^63,P(eY 8݆L#FPPPQ@:\`ٱ>A r`{_{[75lg7P(eC0zm6gz9]yO,A00^o<5&kC _جgThʍٺy{g\-z Gj{%RXF *=×ye[tWj I -Lpc=[֗99,}a9-;8݃#w2|p)(p*ywQ"'*]3Lܻos0%(;6 3P. _b3WSi5͍[KZN2dȯ_Z} GYȮST)^0@fE)M]m5kއ[?㰜Ld'kl벴'Q^& u괕j6*@?(J)0u5U45Ӳdj]3Z8͸V..JcڵD#aBP:ݸ0UGYUhjLbjB)g.(DݶjTSkѺf lٲ͛7cEReG^qT@ @U Qnd/(M FIҘp:0vpwLro,6~5;")XqlO".Q8k s(qP(is6TA9rԩScd%]+"zw\$6P0iV8SZg PoZ?)~wc@^]J ܠ471z X| +vaW_QQQ$U'daaМ_wx!FYBLUeVz/ 엮p,uB wAD4utjSTKDmrlt5gl ՗M Iu/Px1f W}*\k>[qhll"q2ǏgԩE:0bti|?$L}S/\~^|(]mfFijP(%K.[:xVp ,02fD/ w*һ Ptg?E;P{GcdSn@:D"֬YC}}}B_$jt'S`pMؼ}K U1_2(Z*"pN9*SObԩg=謹Q}A-s:Ijv‹Yf?+/`<vDP2r=G\Ue\Oc( HL`S@ $7 bɠ~_3wZyv6!pZ2P>ߎSh"Xf Wu닮NI1jYAP푓e?g0ٟ_3V~5#̻ۙ73b|~_SS2ʟ*b ͹.wIVNM0 "[&0Ygpǘeg_\C?Qü{heԩ/F86l2ʟNQlLv@ }`K+L/f3y<{h#@wߘ%/ hr3f,Ɋt$`ձAe-Pq+p ؃^s-Bփ5XtB_|tb % t^84gS)( tMYHpdI "% wcΓ< aFͤ =zSh?|l.wXȢ^1W 8I!deo\ց.ItP"}t _OԺO}ݯ3QCJQm=wRxov,AqnE ?RZijWJQEYXf枟6&rb-bpeI"SA.x}a C'HB#b#bW_{TɈZ!ZTˤ힮f{{ēh-$L݀yVW™G=13lhI(/ }~G^yٿoę;PHu w՞wgYV%Ar7+D$[n =LTtjn0hjol3q'V'θzcg:=XPl=|@RK+Vr䥯Urt@ Ԋs,8wJ0s<ފvAA: Kw0stGƲظ*sXhO8◘Yyԡ$+,Hgs-I)JuFB =#wSP(*@@ѩ&IIQaw`3ZOOaoc=} }西(wwfk|!QsX 9wtƞis?!vhk/Ծg[6 4`?^Z{d81>˜''0 \GV d~z8e" pY8#2Z Nn`A>ŚMWu Q>zyjlc4STPz#G_L-p`W@^0B?[E8`m  ~ug0飼?OD=*6| .sIn }ǜ R4}E)s2 D[/ pm2eYGf<0fEgM9,i F`WĎ卞7_wee4l̳n-}[lS2`G ?z7mE!̮<v1Ęw>'>xrV"z>)nQA0 ,-x. 7@͙Șdeo? )u4DZ<hu\ =1afy g@N3l"2EOfP+0Q @+fY@Vcd/\ |x-uzmvθyϸT~Ki҉B,\g(edbڴ;^OD/bAC,8c;%cνD DѰ4 |v-?W~s)1GE915TЛDJ3$ł$<8S{([[PD@|2 T~S{wb$˧`"@歀s5{edξ;3~sEȤP&Bwc3I\ UJ}DyNJ˒8z;ų50?q rg2_|ӗ߸?qiW׍Fs&KN@1 {ߩ;.$MvƄ !|FKQzݶ<8NqitϘl&0@Amn#G d $^Yqs(*3Kze]`w<5尤Mw(LBroI*`x/.H5FE zܰWz×zBA*YdNp|rs >b9p@? O-\CbѶH͢x+k=S,KBȫ:XBd%OA=~' vkCwg;jKeqA#E@ t?ǵ׷k6qO6J=N|=F#fH)MWOR>.y ‚F^ĞUgM GDv F^ BW20K!vfH)3Ow$WU-XQ'zs=pV@D =o0aĎaً߻ #vfvWF 8p,m<)PU!= ך@I,%JAn2'(y`xEl)u .(@tU;*I:Bw)y-($Dxc"ZdL>}zGbQJΏ OQyݞ:^L;گoQ6v"1@߾)J墮` "93U՝R\oĚ)70FB !!@>utʎt(+"~X 0W |GfqZSJet*P֠mJ,I8@+yUAU|_Qr (QxoÝ>|4*};38.@wCO>KZg-Uv({Aߓ'OXԳ}֍8SBmI`qyV r 8QUkE3S܃d;k^FN{ ~!D.hX3PtTT/A|FU @˯ K&)@M:GoC-BI^bc pU2ER(eҼC8Lzqg]J[+;-> -VMR;./8eec^ A(F@^Bа j>%"( ;Pz`U4Ɩ`d V]T]+!ݲKaa~y:9(4wE=Hg2>zDW *ȼ5w/D( TE[=zxO$ԕ3B0Pwa "=Z1=k,Z0yuz$!)!P06Z`qyRM,-bKTXl=f(;wuUS8;M娟`|v&G1f}Res nW锨# tL wi}fYc!nk ӫ.Rˁld~_FpX% q )nZk#O[ ZR~22^۽lQ[I=+} {(ebG0w?A! 1loBvڣʦryMESO >U_r,'@qƔAsj|zk_DՂ'o"+T}zvS#~>8ʎ`x;"îi UHRہ%s0a]͈>=b+i@U% x$rݏ4 L jg(v uÀ # ssO):d@-i|o_]YtҼձ,X*>_N>-5gl{Z,:XP)E4X[k@RBiZf pFwvEۭI%I Z_:߸U~1Q{` 5 ĉFpּ 7~SJ-(P(&JABZFu՗€ǓNkh~9xfbl_Ql dؾ9~9CRQ4  |5Sɂ - (r"&­6_ld&n!a՗bM!2[1MfTk?e͊S}^ڵ b;ygΨ/:Z:Ϯ,){; @2ۜc0*/hX} ՗q9@e ]wg|}@>+*fC PD5ZwS֔gcp+zwцdTg5Zqj0f6o>^/e8A>q%iC􅳒X˝oP($}=ۦ53onFū+{oh*u\!7 kiU>xfW_ƋtaWw!DO)HVJ)OwFp]I+c\!X]z\oѩ=^ 6V_ϼ/,CQ}]hVHud_#F P4ip&R.L~]FQ`bbzYz%HeHe11|SwyuOiF) Ҹ537͂ԛe\/,HB)0{:#\W}KrJ 'FNp t 0{q殾=#F{ ՝yW@AV(o-E︭NPA6YoYSJ'<8|/ (4O *\k:`|w Q0d~]>H&g(Pff3~Onc¥/1vw܀>\ZힳR6BҧB+Hˋ?wqhr Bf5J Gj$/M3e>G Rn&= (|EbX]OE{U<nOLe;~}>~bK Az99k2,MEitXKv-Fx}H pv@m*T 0*Pƻ̹#%Po!\ޗSD+RW{@Yf80f>uM(փR(AMS$Q %WsH40<µ|? *P@xg͖_OY)]_ulE>`ZD͸E}>Y8FTElu[N_ 2.NbG) Ӽ!?v#DۺtHXiio 2gSB FZ 1WwOaX%-,,8h9SEm{=XI馑uz݁45ôU0ҿf>En9^kc,Hh O82DҞ1( DӬHCIg\iuiя㳾knk ܛ6CTN@DQW )oj#QJ9\4Uo|v B-CǑ<2-:g3;2P׸6eªJPlFɻ[  XJ|&+(/p ~NtÈN&~Oe,=dZK8oN^M.󔽁•0ml&ʟJAwIDATe,K`Ҧ"B^eUof'a ^ Y&ʐ9oz3Q3̃6ceX U3__xi|[>?ӝe튳KY`"vlgo..!==L~{zKçGjzy(XUP fXqqUXu5?oQVJ%:rvEW;"za c/ Ov%!0. 3W;SQk }ŅP7XزSﮧ vs Ҵ#LU7صB_q} c(nWmv})[/vPXPwB[[lY@w:R8̻Lu?̹ǘ9=v:NdM>CxmvJDBv#H۸EEEƲ,k8]-NE;2؟M-TY#;*6fzq(#T̙_S >oal5]tH,_8Ѫ\_ NT9_qؚcq. Yuhdq| ̴n/%0λlqD,˚.SG☇Rf1ߙ31~<$%~?;:=*-{xmsizWwt]k^9G;qW{@GȈ|+`LuJTC1Q5"uk2=8|ㅫHɔ B8lKF~-˺=Ӊg1GO>z'r]l3cÜ5zA'fӸs˲NָvV8ZG [L/U0=> P3V"2|b 9/)u kY~d`{\; YՇ6q|%; T}8Kw9&l,% eD-|q (๫NeYV?EwhY֨LcgXk?8:X `L{`u"tio︹PIII&FZٴ'·`eYyh|cj$~hjeY6~x|o͇G|=]ܯzʧRx xg)|UF)~m PT p7@!Гb+߈˲ևB=BZ ̰_rB|T5C0><";7LS6hQ70[^eY[o~#?MQ v@8s2it Xl Z0KgXBFFe=:qq|fا)KF(}3\ ʡ!5.e^̠=ne˲l o-ʘkoX8Ͱg8CP:Ŵzh9,X am ^$`dd!Kx+7Dl!i\kYɴ =^:fn抠 {KafS=sb3ə'7>PgYx`[e_ dYme;8ù'͐?∖bg6 (TB_% {Ys'ib, zS6-H5]nf)0$J )BC4TY#@n͇icQ3LPh(ͽ'qMR_!N|yN{ M5&2_jŰj@F:nkLE10iuph7x9~"NR#%ђ V K ŅӆܗCy0Rs `pmKL~7X3%,癐l1Mm7h ;)} mHa-Ŏ;~ ¿Th\'m8yď%0vוZT 9KVt!=o 1R HD;J X%b{aqz O/IG1;Rv&aT.9/aJ<{V#qY<\/3n2j"Q "6yf'9/ l@p=w7J PXOŹwǻR Вx5%"`,2'%a 䉄/gk4N *,YnHD-J5`e4.}^d{Ӓe$8&?O~p˲9;zߞ'G.7]z߂_]j"x"HÑ8/)1H2F^q̜|` f9Mee[,{Ni0d`EP. r$aw˱[`[6RB,aKۀo@T|ٮs,N'w <^{ A/I'Tr;׊RX_9IN*yB-s` |j(M D p bn>ߜh`b}Mx巫Z.޵׬hlN8&*E'4u w+p˝T65?5N*=}-2-N*yz޵&E@QovJ>_0(zktRɝ2_4)EBJnN,A'|-VI%ߨw<ԈX_EQEQEQEQEQ&LH7IENDB`armory-0.92.3/img/frag8f.png0000644000000000000000000000755612414772654014304 0ustar rootrootPNG  IHDRHHUGsBIT|d pHYsaa?itEXtSoftwarewww.inkscape.org<IDATx͜{T՝?0$- (c10L7(BP#5QI]fS\#.>PDP{{x DS kl_hED'v [ukn{~;99wI@F'ÁWW7P{ 3L&_\wʻy!0 6Hz_2z L&ۀCvC{j `j40$xl` @~ Tr} ۗwSjqUQ A+ tnN k̫r'QCA@"2b;0ja_YMuE;0Opm$IJdƄ!S)!JTg͸q'3#yw?r" ѵnoשV3;xI3˒gnV#&`xOgҙy=Cygm 4O7fXJd@s˗/짃AY:\6)S;益}QIc 3[,JZGa/^AW\}Fh3Q\X}&N/\*;Ì|1efQre 2#(`Iҽ,!Lx7lf6^kJdfu 0363ʑ3LɕA:)#+Ǐ`5""[̾]ڦ׀| XzXQ^ ""2\M*AR5 ɛmiT uYBw/9&:(DSSSXONŕqA1Ⴃy3Nf;6IJ3 .= !@19#RI&qک *CRt~ ̐" X)b͑4OBi2XI'Xh{=5sfE;e; Hٽ^p& 6osX, \W^|Vw?LpF$]x <ݓJu6P"$"'O& A8/Y`\ͤjj$&r"p7ܳ|G\eIOQA\lJ&6h]-ȯXy{Jvȋ/X?gΜJe")3ہ[`X {Ӂ%䷛vYfPtgD}I Eɤ3డÎy9%j JU},[wX -8`i+̾,}ʒTgdɤ3 * cvJ0\Ws0W`6/F;4I+eaxp}M!6Ӏ9V#b/ޙ2Q.EIGܾ )C] yzLf57 Ed28%p ) $Q-nH^=9weh` `lT*2;qKeܼXd@GDҪɪ& 45Qxda5tpcUaj\dXc: x8WbA} IF5i%ΛkNa'0܀q_0e`b4duwU`8~TB~ QcpGWheO^iIH{(KŒQIENDB`armory-0.92.3/img/armory_logo_h44.png0000644000000000000000000002071312414772654016125 0ustar rootrootPNG  IHDR,#vgAMA abKGD pHYs.#.#x?vtIME 30Q IDATxy|\e3ImҖifOQi R* ӂ ?Ev ~TD" TQh6iҬM miK,3><7L'iA|~蜼5d>9| iNay2,]k(/})˘,e֜9o.y#/6/5e{M+[RX6A:tu[lJ"Kd `޼yΝ{U{ƌq1 W!;f T/׹wg,GMMMIS0Uπ "Sow݆o>;]_Rǿ6+,#-<`%"g|Q4Pɟ,b SND.;qK[./.cf%s.]|,h|qu5v}|$o9Ulr+Ox,+~Z:}~` +A峁=N~%_]|N=K1APslwkCpH@)`⨪ mKAD("=_ 5C_GVRYX{i\깗^/{ShE9 מ%WT.h8IJϽAf6D^[[=MAxջOo{VbYzs.ŷsٗMRł| t/P5PÒz@S L@>x"nwпc<JvAmr@/Z1yVyD?."ogs^K_A* SĘ*T\ @ ~bUbcy(INzc+%\l$m!Xq-b<$Jq|VJ\}g~W`w KX~ל*ŪQՠ@f ?vu1{TU5k2c$#UEDV?AաQy~444 )S())wO1֨j`N @*" իWFU>< yIv}UUmݧF^SUmKKԐIUUUSSS1i/mz;|/TUMyh"s@GUQ,( &"/544H|"2g(v /TZ[,1> <PIjkks<ϫjU+"ŪZqU}$E_UwnUU5---;ý644ā Y<#3YƘׁݵfxb5"|=qU^ 6[ϙ{|.ۮtPV՜I<~^w񩍚SP" LZ*~F-165y}϶?p!$Y&+!o-^ *A`V ^kծxFzMM_Ԩr`/(1 SM[h^LD`>$"׬^zW]]k֬gƘE!P‡vPJ$TD$\LZ{s״nEz3pL֎z}F]xhS+[ZZ#FHkĔ)S.|g3 " A^{pV[[f͚EGGG&/6s1{[疕,]tE+gv>-3r/YGlY7ٺ]VE** %R LQw 8 *ƈ8%wr}Q$E/@TWWSUUXkRUnQ%<>bz4&2)Bp}0bI"r  iK5%Wu!O~ |߶Igg'O֞i< U<̲֎sS>GM灪k'$#: N] t4`ƍW9_V:ީZUϚ5kFGGC|ڏAL[jiiYttD5zvO.$1bC*6(z䵞*q/\1jܴ|Ez^6)999:q$&LJ6{֠&ap&EYԌXv-@~XU=kJZuLU] ">oU _3dtHkH)"k6ʟ hSK"`>lzww7eeedƉ:/PI2c_C3afχ2.BU -7U3---ma1' 5󽜱&yM`D `#M>1/d^oh\2_={VEd{aaL~$?sN 0;aϪ3T"ȡ@al &H Rf̘jUr6D3 4lWFUW#jSU0iC{VDBL| @H2y477oSKTue~B/R9s|UZ;&!q]ZZZhF,rxVaV@*ê{5ƫ(1ٕD@n_-]]];FKWyw~U$lD+#E6 ¾jUqvzIA\X#N)dUMWWtwwي z+++9{WћM@ʳSB:Y1Fs󶶶>j 3ft9j]k-Ƙf}S>Q)"IU|X /@BuH;RM$1د}{H bݠ`Q:묳B_/"al۲h(@6Z[SC}}}SՏe'G}߼~zU'U--""SҊ,1ivɁ$IDrbW MX} 1hH1fի_ݧ* WURUUn u`1򎎎Yf1R1lLqSRzm)([#Ѧ՛x,&RbzΝ;l"*b09`a~FЀL}8DG6lN ~""cƘzfUUlo"[-8pkebIExժUs#L|#J,;Jte0`ycbbгӴ)lQ~ܘi+zkC#'UcԩS3؃ 1B \PKÆ&p=sqQ.8YU~%6]P^|=c"ξGAڭrH =9sl"PDw0wɹRBam>}zmq@303Llc̹ CyC=B"ۢW:I04 ej+ KMv34ÒאTkfxKu/:&Vb@< bo[DիW?0l2w^L eFD֊e"[}e~ÜJC! /!L1[dvh"g(?{|9* >zs%W58""\Z11L^ #lM"6Lj2Ɯ"nI"rҦcuQZZyEd3~]nY˒ 2a8AdӅ&893-DqnFX32J$z)7v<}ݽ{;brnхgvͻ \8TO զJQKA1: >YU\D3yQc̡"_._2KZ{yuk׮oTzjCTDv+Gy6N|+++׫*{{{{&cܠm;xUＴK"H9_p"<+"FDںn42sL1lWDu65)i `yÙda xf0ԫ+9ѹGXU0g1s46º3v~Zl6D+8? w) 555FD4uᑃh%@(0[X__[KKKWz"ezgggh 5ktY  "ke ݽayg.""ikbX8&"OTuK,^^^8cƘ| cTwOѐ. wyX<-V}ʕ+W,VTTl1>SP I~7 ,B[\4fM|{`Z]=HaH]/>wӰMbub )|ETYD")Rg ؅qFs'tFX,۪/ȑ"(41tTL<͛7#"_UՓD$'GF)6ZEoG&:+Pb)I?u\w: k֬a/!088h^Yg;@mZQIy4bI[RMMH A?!?U0T*+j9J8q3Lxb{ċĀмE*^L3HM$LTB!cH$b^J\:Da]$P8n",4X}+q6燯%*~[Ž~43zsUp\(thEUFjE<_.(1dl2yrbIk' +z(=Po*Y5aޥFD|c̝h2>S__-$aŵ)S5Ceh,P&MN3(̋pT;UuGz+~6^`@D뚪 kCsS ?wdW7: =XBD6ZҲ%_UUխt.^<zVDv-_"@tYkA9}tmCP)=NvCa^do:ʦaJ"$CTX |& <=7862|1.ZUgp{T'&Aۯ^}#N=;N 9^Imٲ.je3F:ʮ]%%%שqD*WX,K $M"c~O2(> [n YSSs6 u#G:0ydJcc#D>੺?c<zL@XZ뷴 Sgn #y&vxy:$I"3'Wl:&~.z~hD?P>*>o墥P hjvQho0)9!)'7/;7gn"{c46l("1LqzSK}Dӷ*Z=n vգĥ{cAn(J!Bo_o$ /:ǨԩI喤0; VU"BJz|QEE5 91113a\c#Bl|q:4Owp6DKͪ8t;^+^uYeB#VGfţS~? 4KTY?IJ{D @Vxi=n*s:`) [1'Mќ` Үș`U;`-KЎ}N_5"ޫMZ#Hrߗ:ƌKƝ^|EmjjjQկդf-<{}MMMO[?7MJ.K:h;J8v qon x.*Q$)q+`` y|̙Ê+@{ccyyyUMMM7ư|ԲFư67TaleI"7Ă>1c򊻧Nn׾;ӵ͛72.KYCG™oe>?`. EUQf%,FQpf jϿdЫD'B,uKnʱ[yeZ{ 7CϸjOP\wލ;֝ӑCcQYA $qK7e񲑷IENDB`armory-0.92.3/img/lockedIcon.png0000644000000000000000000000127712414772654015173 0ustar rootrootPNG  IHDR(^\sBIT|d pHYs  tEXtSoftwarewww.inkscape.org<(؈uuukD!QޜE.\0}ܾ8L"Ok֬MpՈ($4g}uׯuϴkSѤHO.]I& j"D$+!"iTHODU:-:[7J)EM?y{{]??ҩRj?"@$B;uiP(z '\ Vs sAypq-~ND$~=p ">5vA DNN]g^2t}7ZstzrAEPotƭ. pʍȼ>0|a5h,3V &p!^9F=}ٮR4 qwǬg`i@D |xfh@"%է߲pn^x uzRx0NU݉,[X0XY˯3,#_ RBg#Pu0?~N ?*3dZi6F&O|?u{LbkDc8_):,FQ Jg|"<xMg G} 6s8 @J|p?=1 D\cRÓ/dg_hVYf:ekޚr[-է!-ѻbkğrYNq}<`><'b Q!2[Jfҗ֮]HWRvd`f L{3L \iuSAU e ea'c 7c-"-vk7MZALk(B2c^{o֡Jj:XJD@Df1Jf"ʕk8N> $u*$"0ƔKd]s _m gO*?<*'`B"6Q5y02,,a j JޠNq0 9eaz^ "AD҇4ݴ-;m~V)5 [>6-":3^jv^)aSk5~ `o)u?-[{Ǐ/D/JDJD~s-b<#Dd.0KDV3f2[*Dy"zA*R8NUZ_>y|[^#eufF.#U3v9r(rjFN!baE`r֙ٗqB!?\ SPXnA`Ϲnud`=+Xo<>}/tvv ðA)5jK-ȍA{Mk=('|Uה.XkUqy'|r#z'ѳ"24q, TD**Fwcέ{@D%[eZ_p5Z뗈hdNQJ+&33qa.@l#G4ve2lذA1qD$~Yc>;]wͪb$qc[k/rs3 X'GQ4T:jhyIOk,zAB*Lxv|c&Ż""RJ 0 )}om9\EI1DQl6""'hEc 6IE{x i^ _]/?p Q@ Tm`BEڏj?nRd՗wN`wĠA2PeOZzC%dNT!+\_nl<%b)xE823`Uy yߋw݈hRfD[_Sjw^KDC)n'cE<ߖmgJD֊a~W7oޚn42 ;)EJ;к~5(DU`X`޾pxw瞷\vDydF.;:s2ֈ'M( "vc0Γ*f*&.d2SE$BDW(n `C?juxFk]VbYGD ۦrdHcZ뛔RE^On^=O7H)%,ve^EkJD vdb!"!Nd,t6f$3K{R:eJUqNԩS8ו9^FDtIE0^);E)|s_ (,9{ EK2Z5 *]EhmY =nDq9N9۱jbf G^ ~c *++s~)"*i"*~9%S& y?"y-9^ s|r8ܿs{ԗdw 7{#%" yI\&UDZwOWM֗ҁs=Zi"HS?r%%18T)~ q"ޗmW̤HF ܨ{G0yZ[u} 9s#DYfիa<<%qZ{vE$N˝p5Ev+|GM13ڵkԫɅ}h.;8'"-4DdQᰗ23_Zh%Jxlv.r RmJ"OFG"CЗ,^~9ps#kEE >ϡ*"OD3*V5Gz33+031X4«c |") ge(#Pwݓ8vrBpѢt>Ÿ圞C't{1yD􏎎ijj|>T*l+Zͯ?oT"c stсJWF\Z'+=Xa*D"ci}ƘLq53R qU^?Sw"0 c~r1A ^|f,3rI¬Z6q{%"\`\ /@u9Ebѿ-VbwVpWoG;_ˮ㿐@8F,iG;n4EDE_}T8@K\5nż_Fu:)̜!w{ouE(Y*whK:F)uGqI"ݍLfϛ;#"( $(o$|#G;J"Z$ o ZD\Eё"qX<"ru#}~S =*PAPnY~=헳=hA{RJ]Ev (O⣌,;#4s7< bE:'@f^՗U9a4?_7T,%Rd = 9O8svֺtAkGD" {Ƙ)Dd6wWi: ],Nf{r5 3ٿ9.;f+ԈTW{q|Wc}' (WAg*\RZ}FoL(0BDEXh&I W(NUJm}¤u1ўq'_])`f":nֆx]w:B\`'2LPJMxYo־~r W{+kpQ#ev&: lgL>d2Y:\Gߜ,û EU`[ ˁ;DYr AD&&KtZk!"XFD+| p5\qr'ED|Y 2ˋ贸!/#UJ ۿ)W|r<*(J߫+d}߳c5 ,e{h  J1ѫ}Ytmk'_/+gSǢg`*q\@V#M@9%s8,. 'q_;?CDWc IzkAHBk +CDZR'{DY+hHf2^{qrI<6x!"RD43'(IQRj~/bU˕f) l'5C?r&e ,EVD'hCCQm{Y$PUVXɈ a{ݕL*~r˞Km ZY7}X9(]Տu7R}&\`t6Q@OJW =^A_kMpO+NJ{e[<\bؔpvl=HYk_Zs/3"a.ѸCkZZ {jȵ{#K&q' ++2`D@9ɑp"B >Eh{*tS^|pи6jłzZzx5yqKk/pDE;Kd+~fcfn/>\/"83`"/v#昙;_ȟy=7y2ޣ@$XA~*& 5# ` aǬ/"f{Dh-o ȭY]@lc2r&̺C*]7o#"`5z@^Dnd2x܋h/Zkh][+"1Zc\؈ZfnMEC!VD'>= X\RCDfoɾ=YC""3+E"ڋSY3(Ey%@l`>-pGkrei>[>dusnsSXBR/=Yn|vH y# *j4X QL> laz3?7CԀu r^{׀BG+xc{@`h_*sjS Iv#N<l;C> >9h}Gn|7EQlRO8KG h.#܍; @] TTnwwUR@*ܺTo& @йilY0_DvAѧH,l;3IYc$ Me ;tƉl6KWQӅ7j'A?I2UO2нၺ9DTlC.{ 3fRMbsX/6qA2® O5@@g! |2f+,BF皗 {O*i[A,oN',h>jc5W,, à $kI%@ZUH;dU w4544{;.r8Wܺ=IGNK%"2M{ n`!J)>:[@7 d0`t* wx/hhh#"=SJQףnO%"E0Qp/F7"Ɲ&k60o/ [ r,wkj`-X=4}˜b笯^D!GE:z̞IDAT)RlՈ%勏Cxą8q>w+Z#\{O<^DV644刟ĸ' K23qA`(H3d]( Jtr6!v #SWWGpHa8Y \cZ‘yV" -9XǠN_$ES0-,?]qmu5 %(!"%ZhC˪.HW?ȡ 13>K[j ( u>[9H8w_*k<  "X~-f,(HTA `pt $8נVALM~w (Obm=,i08V@RCp)("H}M ғP* e "Pb P!'m=hY! P:pTN"AAC d\ackGA{/J>Ku]Íf=L<+&xaRQ؂/ @ D'sU P8jk8TJڳ*T M РpPWB@(o4U-):$P7>Ѳ6Xo[EP(\T  VV$T@j!0R P%t  @Q oD@j9 XbB*1[JT()Ds G"k JdРX2;!ԣupx%Go5#W SLm\L9Kťה‡@QdzBXu-@%zt  P:5H< x +ݓH; -/"B'Ή1g.PHfy$.@|>kʪ ] ek|P ޫNU;"%T)i#@@U B2% T% *1 flA #a{޿|ط##{ Mlmp( =H-ݦcbe0@ BJb"B)S0SRpCt:48✓p<MK ߜlM2 р) )I$Ӡ 4uQUeF OAԆj%y5:l{-ySU Ajp`#FR @A | =5=yT[h? Ph ,aa5 KT@!(SUh_| t5I͠0]5wt򵩝RHhD\ QK8Z,L3x$v$P(i'a9e.%ƽz9+ mB9fe/4!2j0ZIM:Qi I[oy4 *%U%eKgA^`gI_ƴxmʢwwfU]yP4 B[ ߪ 4~kc@d jWUH4 10 ⠭`Ee/*4ؾb8T|{_oErA.)']- b@tUعN':ҵ^v'!.M]8oAoc5HFV "=GV{7nޘVu]7!DK.A /t!T,w2}T97^ѝS01GBO(zgS迢aUˬ! 4VۡuN|I sӅ]U]"`u=F(EkVtkC$Ms͇EvNY2OSi4I@(0lқEƪ-ǔ>`)4M@ԨFF{`|icA% z2fט:-;n]y8=,jB5bBP`=F/A >u(Yh`HF@}'<o_ Y2PtC@DR8b)G&ҷ V ]eFۧg^N\:/{UQ)kЦ$ $Ae̳ yȳYfy흿MFn#6FU]jUje7a l1 q4O?ϲQO꿜Ww|tò(*)>@m@YjC64؀j^)נ^[WFC =4C>yO@T \ nUEDļZp8!X.dYI2ӧm?7ͯHr_<;oVҕEyo MSY^ca!R:纕У HhGQV:+ exgk*Z>AIh>ș?ߒ>2ߜ]k{ӢiDG &Q <% [$V Iş}{ҥK@SyB$7< \ۓ܃Rc3jL`SE 9p?aaZqP0?,M՜ӯ*Z!Mdi`Ѡ~3RIOiQUTu08tZQ׍;+k DY/`Qo?uVOܼr}*fZƼA-40("҂4T.  8| jfD$ɥjoe}xB$|J -]`?G¹N=|Q4m;jv0ʲjy[9ܽ_ݗ++}.''L!(0Ͱ?(ཷ`rAWzB1W0l?,7._ۛuUQ ZDZC4 "b0+4o +(Ay2<߸ :2F)8aҋ}2! ?h$IAv<ïWӧ** >^Rz~рy!5]]>~Ikco]NԲi`t ]0L I ?Ex{iHDӖPet wϸړ.!@#QE24LykޘΞj^s{yш1F>yޮ .{Nj':fϻ2;sL}uDϠkLg?CTM t<$IްÍA߮prb^T! ]. uPT4P6 !Z^CPj:^7aXK. 0S2G "tu-wGI pPB$J[I&ιdskSϝ:;d|ՃW%sD0ɈYj%:DӼ⨞?v^C{$I:G(8kس`a­=98(GH@wv?x͛EQ19HTPT Լ<ZG q >!~ucc,o!@;gv> =y7@L4U&I qBR",/Y} P$S3) DI~^'^{}~^L pl'`jcO?sgNqӉxg?ry<EYjp#N{ }lM="= ] (g%Y5d#MOm<(7H p< h/m B "qYRdsO}ؗ7qX"5!ʙ[N"db}BIED JF #ȄƓI_>.e?ޘ]ڹ7ώ]gdQ9gOmg$y'K-،z>6c AXu*A9XF.NOo^|KۻUv#[5S v3@4|}?Qip%kȕ.s 40 ʼn8GTV#3Y_|+v~u;Wٿuઢjk}lFodX)C3EUkh1W۞o. A/gxq# uY)\gOoɒuQڋ "p@#pH $-1&Ht˯/G+oXSA9G:um00" aJJJaJ0S2EFl0/ϼkaOkaI>n lF|9^8s^^'hu YoIJh{=!BY66]GK!pB =lGL-ʐ`aA1/S'[iYYP lJ A%Nbs\c _;?ya_4~ D@"Fm0`9(L@23s>sf)o;l8⹳x,1W{=x"s9u6(' ,?^eU*wM޲vҝlG ʪ55Yv`E9M"LlI{ Қ(hC,StBC`V?Q5s::&>$Ή)?-G0Y_| |LϾsmw<;3VSH|1ǭ'(ǭwǪ'ecbl>ѵ6 EY [yoI`2r4iʺdn{|@YTud⩍tYAIaXjt[m[mP6+VW^śo E)+TOGش#$/")fƓq_?\mƞتO^8sŒމ?8 {GpRіr?)tQUh?t9zYɘi.,N(X5yH:?OӲ(5<2.f08󌮿QD^`͡^|=2y筇}i:yd _2O&a1EJ8p m!IBHS|'IWW\~{ýCKi Od4/W|]QpOk *¼,)I(Kx̼`4`22tPo<"=Os[[[uVQ̃ڨ1i}|ڟRZea.2 I?٣|$ K0PNT~c構ɾD)˿HYŋ_|_4[ߺ3(5ѕ{ꂜڈ+ VfŭؗܛKn4L,mi`cY]%H-x٬ixDgEt -畓o N[æLu,g*@ ARM :O MCtRLY#aT)DA= [/nmsytp'S| 2nikAT[yp;wXo]4]ک~΢P7 p$$Nݩx7úI0 f$TبJđ xWju^ J's]O)Nۀ S~$A,!|scWxs۹u?J| 0KW|36qz| `܁h*F@/onOɠw}EQ%yG{GB-i0qqbz{re FS^??knNgX1:um`~, ^B{f&ٳH&L4|8{3!4%"А}Te_}+/7wG3Bӧ̅s̳勽$my ky`rgnNYL.Cy`PVbB IVIsc65Ft6]_)W; :D,x4?z g7xOO#IHaD@$$22MI<KW_ʳz~͝{Qw"x /=sz"e1$P(zY*9ljj^2ܜΦ>-hQš;[o@$VD ,)@ s=g!-N8k=~A{[_ "H5_}f\mc+>N22Γ}roV?򱡁J4ޣe+y'!O2l& u#l,X~҅IJ?s/Egot o\l9  t[g HII1*?2c6{_~OoSs}/;i yv{;6u&޿vo#Y)e]iz[c#3X4e͢Bq|`,[2E.Lc"NF48_ě?{j.]dǛ)S <>1*/#$2ueIKeo\͏i.魭empO\-کqEU!Mj*CULs{5C>ȇǓ>YEn\~<FTDvM?}zvT.KBHETb}?!/b>0EIso=oUwyuzkhȽU$aͭ F53hsQogߩ*!;6/Jjpx/o`7 DGL{If-ieaS}\ݝ `guEV|>Aآ1O3D!L煽=n(t8~XVMpc2PK-%hOT|X /"zp_B6 tY 8gccHq6\D>JFH j0K4g']7+;_pgʿv,Y<_r5nvw뺎A+%P4F.@UQ+3ς)BP'17L,/ DF"d/zѭ+;ŬP_|JlLX+#-=V%jby2Kҕirzؒ uN`c1\ޟ|h @`h7-x6HUW^[?7FK.A5@D(iIllņ- J~ampg헌l<W^fy޳՞^.p8/-H*‡sI3tAlIĥY%b(@(@?vKx?/|*D,sD?D$r?n %潼 q_ۿ:sޘiqY+ZNx^ψG$14~ (dHa?l'zjYV>(i:O KV`@U ZB//3PmUpDֿC:!\G >f.qٳ>Yw^^W]_? S<π_+Z>AǠa}ΊEYcE2L{to+-*̓eǑC X!0NG|6d_C5.LBJBZHN" ؕ|Ωr)\8׿4k_ہʺ@ E)Iyp|w7u RFߧ͇Bv@X lC3\@D * fx' & /?¥%8.pbm?6G$KE&Ճ/MP,A~gʿF8~7۷Y?<\M'γF5 +٬ jUpJ $ @N«/|㟚7. MёIw.9wh˝v]g3ųg8++cwk߅:=l6ݛr?K?} ;!"Y+Zi%7wvƮAg"oeB]֜zC g42@s(3TmAu B@nD;6 '$Ѯ-9"6u$ϳ٧;76ˢ\Ix8|q.$p0a:=[[KA`r~x@1@f%A T`Q$4h;(I=#KK2&)Y%ڿs"ӧ{:):;SCg3s}Lf9_xS#c@ҘoxhRAŽ@:)=Ez=3qs8i;x8a?EX+Z,fEcc<*(fv~xa,k !4L "<gn>ߑp8R+UF*jeAo姿2)4dp":_c*hw@\!Im& /Ӥʾpv$Ir) D0S2%HiF@bm@8$\w Dudiy'%he ?˲sϜCtw:inIj3rGve-Vڅ;{tv1aiA}ToUFLa$KB1*Ḽ3x'6a`" #T0y$ Bdof__OeC{=܆g屖C̋2˂̩v &I~zrt_XB[[ @oA!vY"? g!@H8wj3˳7~8`[*Ӑiˡb<`2.YJT٭ y)3)R}$"'_ _9Jp^D֩`&*? q² ;7/UnɘcW/'u Am.@pzkn[L~jԦ81P3IX ` QO)%h csT()NA4?wa秪? `kc^ҏwp=vxd4xTPp>- } yƥaUހFmW 'RPS?! !ZQiHQXSF?.>L_d2ʤ۲e-O,{'TNmn--uUs7dd{""10#@ EXĊl;HIx{p(-Ҡ5+D(t#@Dve7?[i5/-]꿖ϟM=zozN#fx$M2@Scj-'@& J7d`!w׉A"*1CsiϟE_(E&,K+e-G+{(Պ@&ؚj8v/>@s[3.AaT9N=BJ_[O4R [ͦ8R x@qj(dj`2d[S UQul檊aO# ~-O#@1$:bZgϝ8$IJh D i"rLb`r+͸AR !d(JQRTO?8qOL~i?F/؀;VǴf-w!˸HGU{F+`1/QO3ygV:4 @kC 8w"mwDsDhGQHg=!VT0tyGgnfbVJWS#Iv/z_cj4el$=4 PLKdHZ`?!#}xTH!(PNܟ PvGRU( T)鶶Vgj1֛ƃ!,cі/þ$kY˃[*Xm -UŬ +>ujtL)T^=f nzhs0sq E/q6Z!PkEg߀$Ng'ZyT`s2> -C( p$xF9FttGo@Da(\t`5 5%r-݂oqTT"ɩᩋ̿XՊj~oMq'>'OV7 .!d4drV9zNh\ H;9}Ȋ#Au:*"@766<^/K=h,IYdI`:eb4](7iqOc(Ѕ0h{uAqPQ|;9/ jj@UA:BwzF(z1d8Წy-H|ļ(V=I,c4pN<#Z].Z4`ІF'PHI@z8Qsg p6<,KtuX?SybQt?sw3i|?$ƣa;o9 H&{1^UW?B!BS ftDRD4,@lDpeBS6[K?h0h|~p0/ Ts ˆNm H[[U~3D /TBdqǖ|;A3jhV 4#@ ] +q=J1+?壭e-DBQU =,I.)bD!yIR +ht>5&ո~DB@n;59{:Tx*+l4à#[w,ÿKyΖ|ex0m70.A6 !5SنD0B!P UTa @"pDB8Rh?4M]޹<_ ˬ_c-kyEêR@A%r@(%hd`:J5 /TBwk P@a&,gPqXI^/dM%zGZ} ɤPmar1 o{ r`.%?l!*"AE UEUd2Ŭ Ra`?cvK(j9 z2>A5dp*IvDSe_l FcqP sy @dLh PE"0$q΍Qb]5rASJjt-0(VdJ904Rd4v$<:@FDn)q, *mʸ[ 9: A@@9uU!a5Q>ym%j3& ֓ײۋ*0/<*+s|jvz4m2_s5,P,**EzB4@@\Nt:vuFRT)YTrcx]UepNV.{#mDkT[i ԭ^ľ66LN@0P(F,K,0^1Jt͆bMAP !4.g,H!zy9궮݁Oʪ:R4(r9#! Jۿ ԑ,"F`cG-Hx'^kVYXpkYˉBeY[0$I$ zJ6Д`;m{~;2\b $*Y ʷ"1D-yD0hLhkXξ[w//  L.m@;u}-^}βڍ D w<4@!Q@@:U q.Q_,D?Ƈ}lY[Gt FZIoY)p) m'`giap"0 :3+ZcgxkCNYQl玟G섯e-hPMCIfiʺJ>ziD pt! *@AY {BC DE#B#qHꔓĹB $`PPƕqFDe!k=@tZrwBpΝ~lbe@4 $ A HPR`h;X#KOzio "̐epН i+yDNWXWB(0 V[sm<zP8 fZ*PI'Y"fUT t&!uF`-kCu1;SaUi<'|O-QcU "SpHhLF::X !$$MTEU2 #bVײ;C $Ym>h]"lE^ As$3.ZFRq* YUA{G‰{DNZxIz@q^M?B|]2+vo,+P Ӭj і\HdH]'J@'Ee-<̻WqJ8ZLX:#z|e4U$b̠$۞DNPBtm!U!p\OZZ>jՌ8nPvd  V7T& (|ڸ{M0YuZy8w):uۧK&[u="APt}T`Hc]6U.zkY=5~,_|@wuKY%Hn>(j!Hʽ89X+׎V#O0oFbLQQ悬|&]$$YZr>,\?U5hZ)c-B wX JqR2曭r$y$[c Y_)BݴKvUCX2¥.(Zna9xӫi vb#chQKd亜SU4QX%kZ/9*GR_>R@{v {|OX>q)Pmg BUuo.b%N,,YCԏ H"d]|زVs".MX-@6t߆Kˬ1BK vjv ш5rFBl H>\׵|:zB] Y/[c'r<ΨOǫ}A}U6Ez%/*cHF@ӈ\G BvnHl((@-Emź:AN"A\ZlQ!sMuBJ(GL[od1u^ H=/ 67<aR 3@"en 4k_;,0P 'Kn```;sȘ`>P 6̲FS5}k y2f]\M uI΁=Fu2M;$݆F8A彇=|GeȳlCeFā E=# W~EPV5OIPCqkPm@U%jhs5Au]R痳Av~;H(xRBI]@.5C|s,OrYڵvz1pNf)ziZ%Ưf tw^"5 ׃NTmA[k<UM JD0@U%C]~oss ^@YUyuQռ'D`S ]bn!à[kY\@@$ e(nMùz1ozh;4QU8`5@AUEB`Հ(/<[-!`:/V]'նcRHd\ˊyV#I:9k"P<yQ>`$Y?[ >@yN3V{SdMHbH&BYUKdLՅA]'@Eg,3Thm0"͖0  O !|,}/Z)ʧ$BQO>Xr0CgO2 F}qL#Ĕ`:e$-IdyJfŬmh=1@j3I }+ TK а?;!D?W~d:olwb!FU*S5yTxi@hwnboe\H*ki<@r% MsÀ3%or/Hd,=1J1?bpr[9Y}.J[]Fh \g`8{!% ^IKx/55RRG:~;|?EbLbՠTxKRa K6 SKTw[Cc`M6roqχ9z'WY*O+,T2o^b~Qhhh Q?/?W U0@VL$mQe_;0 ]-4k{)9quCoCw>yw[lKuZ]ޟ.e;@E-=XmI}r5eРF"-HCl?41 ^oau`w AAc; 8}B$y|#׆9pO^!uG4P4lgiEWQ-1 j`{wt^ U1qu4 i xUmS=(Md9Bw: > u# `?Ă0wNܧ sH-P*FPz%:@_U}7-Ƈ8 lc;n|>b{&4Ao:݊B%)GkAqko_8tCк5l*w" %&@n#'!עF *lV@@ /j^&hhnد\ao )/'?NdȆ#X' o/"ɬ3/+ :OJ apZݚ%Z';󛗋(ѺroTtOO!)FS`E@P/Jh, giWi6N?zrЯ)U/@_5#0$yl#g9]V77s|$ <nkYU-X"Q?4iN!*:_;8iFN ׻>!tH`3LIu]7Wo^p2s]2iWXIyaGK^@I(3̆91延 sx89dӚ[:+PC^ۻrȿR kU_jO>ǟX.Pmhl .5+PTUY_/o3N]/i?J2nbm&dȇy[9AA2&,AYs!Q>8U;X"Ѭj+wo?VPT},f'E'A h@AH\*@Mۜр֭59|???;積 LFX1֔ %}\Vʻ<[L URրҷW8w$Kc{:A.うڍUu$M[#V İ{'`'gwҋ@ +!NDRF< !N%T7lw/R\@,`I8$ysw#$!DQH!%,Ҭvܺnݑa:4A%HI"Rybhsyb64/K|p*?L'g[_|tMX33fP hA-6}Ϳo@8>"_HoPwvw۷lkr~T({&8lQ~KJHT3MY}xJOs|9Uō]%c0OWo\\uGQ"% qZMt߹#RKhVHU֌ԯ\GBeSUeuyßkp2hZ\+7nj]aH@SݾSq|*9ꅷ㪻yҞ,#q`]~yIoS|kp og1o @ߏ6U"B[t^vҖʂMqFύF$(?;8Xr7zoM?lgc;;68,mF")"e2k[ ZnC`<@L)ݼurYl֡Zy 6z~U]ʍN[#_;Ww._#?P)t{o~wwnb-R*5PhKKLeYV?e2[igT.vNj^kyyğrܸY!hl޺:_,I0ŷߖ\Rww5F / e$#i&`, J!!pu]8;5:}5/hX 6F#:纲 @o{ʂky/TL XP[_Cmo|kKiL"`C%8c ,ͦ;WIaUrUF`-ĸ78F󭪸v&ӅkJhff}ܻ뽏>KPm]ߎVX$Ju;$w[o_D7xIo#* @MQU)Rq~5~*Tz,e ˪hd0ZbIpP`-LY`(v̷4KuFS{NCD73XߔK?FMmq֣Tvkh-_2Gh"h xezss'Yo DP`Ҷ wTρ<1ORlG\+Z,#HFί~psc'c|H?A;_+!z'ݟ_0IE[4OR *k5o@.kOOmH:[2+Kiaꪝ5'.4GY˝#ڜ`4ncO>zUwIjl7.67#حf:o+ T6H2SA? xMمU! jۣb?(Ua5> NW-UUY%FԐU](T0r?Q ~kWn\]i}vsg?NUu`F.P#P*jGot']g괡 Z#VlL2exEF35|{mo}KYqC‡Wi{BMQ' !q`ߺS\~}u_0 {do0- 0&!헱&uA4Ρ=xwp92rŔ@+J$ Tm]rV&MEUA5tm@m+뱋y.">G~P%r g\d㳣G4MOa^S( #ߟ?MY,~g:dss5X"]{[E+1'P\WJm BU4r*8 #IA@F#N >ìIo1_{OkӍbw|6Um?%1#8W*qҴߖ~{?ͿċhJ hHlPU+P!) zK?m."VYز@?n]X}^a72& \Y~fy}6?{[v-oJ~X8PAYio>c@ ~Ϯ=0OrOn  ԰J4dc<e݆A9+ }jRڑ']r߰knk74hDMok7-aTUg՟%%fn2p Ҳ??p ( $AXoAF5XhD uֶsM٤M㻭4s^ ̒Ĭ<ܩ0Q~_*7L6:<3ug^JU/(3))@{(TTkU2Flϧg/3կ=Br\(yD+ T S/T[3?V9"&* [_BPQ?S~xЫ= l|!qh-r66Hfb^"`*6x8Y$atbk#"lp:{]yYv- t0ٍr;k?ɡgP_.ԶON?u~]q^SΏ˯`BB6k\btmCr^ &Ymp.k̋ Ƙ{!1I?Gu:_ ŷu'e`o%??$WQ(QZ1_Ad/҆ks?N7|_E4>nh&]84X*T{xk7l\@uFbtmrW' pD?Hnw{?ݸus'J~T`6_RQlΈwU8G9?s@C@R^ tnoн>cUVdt0o=_ wÕ뗯MӒyXvI?M FO5,{r_ og Dlā'征1``YT:otxf6O|GìQևpq_,'VLnt]y}t痫)0gjKeIy$i)U?C_A$ek7"( \Nx<7W1@]LtM {fiL|Nĉ8c Oi{GuVt|uӉ??zNH?Ҕ}kn?0D#H;9ffߝ}_z%ntWmaBN.+[ UY99O`4YUP % gX&w9$ϥ`.go]xVuvKIrw~TUͬGpz,f"mV@`"3* P{'r [o^} m-J:=V%c`UaoGr2\D@~(ӹt#^I'xb zII<fP[;ZQ׭NܵAݺ̔] =DGvFf_\A@x0q 4B&23۰`*!vEʲ 3xc<&O l,MIy5vDʍ(ìaփ;!5m?҉wkFbJȔ4N.0_ @P6釠A]n7⁜bӯ`s&]ڿ}케E发,99SWES{Lg 1>i_ #wq@Rqg} Kw]_V5~~^y?^QUS~`*4f.b~Fj/j~giLhn1zm+0yڒ.h7ƿisps<L0*&Sf34ǠߣkC&P :9x I ٷp:譽՗>lGgλr:#dn`-%aC?ͪ vmIf;_ds6yz^z=Xst!,TKZ!AS~r4(~z(;xPVW0RF@UU7ݛz|5JzYLS7̖iTlInsCM C(bHz?Q$`JO~o#̐dI6 1X5d޼9 tQ;"+3+nf=8]6uUpKcJ(R^DJ<fEY1^?wב{t]T.j㻺o߼˻!l>گL| i( F9'Ā6=z ~[6j'-!y06R16m(dIMS t}bZ h@B֜# #hő}yY}]|}|C7"1@h2T޼o❛o}rz|*F6|lOP Z2~:7*m5/q(qH PQc'1>{C+0+*L|l#NjyC CL*@EYh.]?_ѭkiLŇ\麜[b"~h#7Y~v 'ƹ<3@r˧0m"J`rs!P.V.p*|&$: (tbTu j4<6!ڗ"" IcZԘ%<ևYo߾xPLu~2]k Cđ(1-*ԾO%7%{ap= !zt q>_wi ķk~R:К| B$Rog=yR~o~\ ^4<$f4(Hi!Y" XE,&U 0W GY"SobD5$||1/0q%j_=DI"ƈ{'x] dV8:>bhR.}ү3^?#W"7w"?J3M_S/ϗr. o[~"br 5A?@iϘmNY'vḱ8!kCiwܻ>gwT.pX}?,=}2Dk1N3Pn4[n lWCE+Q<kd?ƈ>yKݼf;_;0MӗOV4 )݆t㶞|~~䡟޻nlN|DξoֹU~Ϲ"2%Ὡs#HOQtQetI*5 Z@ &Ye9?_Ix~y,O ݰn4HYVIU}\>طb;OpNp+27h}{rĶޚ.`gљ^_/uǧF9{hp=ak:+fMC^_ߺ{vӬ)P R#h qeVV;I !:sryNM9s@=ژlT0JU*Br ݡߟNv滳1Di !d Vm:*TD!0øaw*?f@x=*GAr%;X4 bĦK.=]'wÛwڶ]&~1%SyOF0OdV:=B~vr i䈫׏cT|տ 4.Z~$r.Q x }ׄR%J@j N5b-"Y|>={_<ٿtMˣqݪh=cg6ǓܙPWۃ(i3wzy=?̓? ۾7LpfCX-NNqxte"ĸ9'φb}W?}ԝ+l3OCm JB  R1F:!> ʹG0sǞ%k8IDDF*5Tg]ۇ4|T΋wvl6/Rcv!M OOvIh6Z_l@5 J1U\>LvnCA߸|\; O->şΰ0.A4W$|FOt)-H_s{ؙɏ~#@p sΡ8@QR(E*5U!T$*uUWK<}ğc?YKv10#(hQ ;ܝ1k#G&_rֽcduڌ6~~`}ҨExɩE{ǟC9wv{y[rBh:+-Ufȕ^8q8drG89K57E=R :a~(\R*%2CdhTHu]W?ܾl7!jT$P%f ~y Qy7]27k˕f0>0/s_${fNjVm9|MP΋{+vkyr !:xVg%`Eau}AĀH!>؞jxA4Y^񏰌%JgX$K`6JȂB!‰ȒIA*X IT8*GVu]{vK{au46ósV(0L0N;q6,<2]뼝-}Cj$ !k^.\Ь,WCQzӽioōnݺ\.B'Ђh)v[&BNA+(J-VPcqVtG"2Jr2!%stW_zND_.ӠOۇGӐѯzz9y %8F-"ke@EJ̞ M\޹qyzI֊h9~B)UN`q1CE9 +LXg3/2z#ᜤxhP`ie*EJPQA $Y/zRvgv'ߩtU_C?`Plȥ4lF0g|KDZeY*+xE<^sx\0!R{SzS~NQx=F`S{JJ6pF=I<)?,/":RHcy 92-enB@툠G#PJȭNjt)Ir2T;y?dAvM>nq3Y9W_,Hæ}(iǣo-[ݣŽru]Gi6xÞi̛[^Y-h7?4)TE)*~K/ sv7Z|f*Nw`aɄJEc¨HA(P/gfd>;hRkXހKLH;E]jZ ph w<\'wNVGrj!QDQau@NB?&ŷ=DAIIJ1̒S"[ۿ-:\j*Љf܏3ZHNP/@) P(!rP` /,b6Mw;;j7/wv\gN 3DLbk>F(E"GPQUc`U9-ipqiwrWr6]? !8HPw N9xHAlߔkЌ\ܟ򨿶_|+ @_}^ : R 1voٸƴ hr - Vb #Ptopd3-gOhO!T]ӕ%O27i>dKEǑ.rR Q K,돗W߬dyt}wc 5ǼqH[gVʿ=(VqQ/M# #zs~"|GMu@HvwK `{!6S_P xflo=GOsN&U]%|Uto0ˢxIb*M[d_noMmtuCV}[1rU\N!}1ݪ_mEQ a0@` =mJ>` OAt_~d*YBȮ~(I`xLW/ot~ P Y;#B%OF4AA Ej,BPJ#d(:zI>_߷C\pEq'ޑtuY鬬 7~p&O-~˦黡`a4B$ v.iav03jA680WQx.crdzJJÀ }+rɷ2ؔW_}Q*rH<"XOacYj)ǙdG'OrH)VԐW |;G;TtIʫRȓq5mcr03B&X~.qHa>@ Ƽ뒛r d ;cyV{KӦ ΣԷoʷdCv@\$DA 40eax)T''Y(&҆޼)?F`l`T))6v>u~wi'h`#qmFϛ()FSaXK.`U"!f_&q9s5w bU^?{Γ\W^ HLCdoH ]B B|ȓ#R9F8evXI"IO3k#`sn=`LV\H hC͏^$P|1TQ aouJѩy_T. CʕWl(_88v(@ O ʊJ(v; Pif-XS])E&ǽJFo [.ad +l<㍷rqxj@(z:uYaFaS>@8L<[3yl(6ZkcI[>\c~ P~o>.Y7@Q̑CRhe@Ro7xO{ p&oQZĥ>+'^Mu˅r姯8SC%k YVWry!9-/2 `I%奣.CrB:!KDZ˫L=D @"= 7Ck(:f;Sʖ7Z dUjQ#j]G%fpAgpvG!Kkh@Dxd::`_ʉJ]?7iJ!׷#EAG $T20Dҡ3w욒ז憲& &`pd`δ?c9DÚsMi:I)B鿜\ߓ/"s0=Θz%0/ 5ɿۿ.:7Ob\:vs e̎t"es=""xGykIӧ4M)`'=tT)ۂrE钁vy@$Aml}3C(e\>BQ`xͿԧ[#k ۤE!(<yo( ^O@[PXXLE1r%UǚBpTҷj D% N0JK}@F%?o(y pNO~ ߿^|9 + xEDț;(:dЙ{Fa;8"3 D^Pf`hJa xx[yG/iawh\?' gL"SQa7?!*2$BJ (5o<6 pw~A%tEXtdate:create2010-01-11T09:43:40-07:00r%tEXtdate:modify2010-01-11T09:43:40-07:00*2tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?tEXtSourceWPCliparta$tEXtSource_URLhttp://www.wpclipart.com/4IENDB`armory-0.92.3/img/armory_logo_h72.png0000644000000000000000000027004112414772654016127 0ustar rootrootPNG  IHDRFH\4sRGBbKGD pHYs.#.#x?vtIME !cP7 IDATxq8ZќJY555 QZ$$$ %%%\###Y6 IDAT  8nQP~%;OM!!! Z7= _M yL ;{֖" $?qɋp?"    )17'/5TBDC)))nI IDAT  !#%-3$+2(C 000'5H+ %m000\*G$3 /1cٰ4C _+S %K p#eoN $4X G)))ضM+++&  TH(XI%k&n[&9 "E #H װ֮6l6  CDt&&&6$$$'9+++Li<  vu0K^>em{Ϻ˖_  fr^"yD- /'1]b'T>S', ϼ M!TpQ%%%#*OBE>'SFnIqC[  IDAT0x,ps jx Hp"K Z?Q#LA,,p,p je^EJ""" _BN)@ )Ȧp(-qd-q  lk  -6-)m; ަM$8  {]t_ llV~j|G!aX o###SzK'1+JA F,kp#[ߦNM^   Oa I #zO} |oIa[*0 n{ K~222glOڢJ&^ܤL3xu =w @V  } 111TܤLڢJ3ovqRQ IDATZM[ &5]lC͗@V z u B`z  ,b8>ʔ6rnz:::cP{_oNp>Q KiNa$$$R  H 6 58#ɍNjWOTxi^>uuzA hB ƊĄ^(Z~WDu@t  y| ?d)KB, BW Ł}+(_GKZN@s("g s ?={$xK Y ytVmf;_Ccr=p:ms= LL kCz IDAT ]"[@2 qlj 9m6jG" f ( c-:#[A7gf 5j4j  \c[^j#  $\c6 )59 31h0e$ nOfgc4@65"D8tĄPp  z~.W+"""qo.K&1G |y3`*0/Mդnh~+++CM }mQ000Rx9$G -bD" yiyr̐ IDAT;VB 8} <ʈp!&vh<<#?  BJm֞ju]sn(!?ݡ=/V  ӧiΜ)<e fg;T$^BdC shٳbڱ M9eYY`c$/-B3Lתת 0h7!VM8ojpqۋ'''٤"""X 3.0& pus,,,ڰO,  cn    ./+Š *a;"S+++###444QX&pُE&P;mϑv IDATI&N%7_M o; ͊̈́UNU(Y'|A ,Ssxь---]'?  4"qڠb)d(q&ICشC555g&Yڕ2* r$@Ҍs E/yAp!!!l&3Q 4+ɞX6bӌY/xkBo IDATr)\ LʞXʞW.ta+0ykCt(v' 1ʝW.uD,0xB5iw'y'w E\̭ʝV/w.va0xA5h]{'{'S(] ;ѱʝUʝUp5h\\555~(}'*;Ֆe ӱٽʝTʜT6g5g\P(R [S ̖gʜSʜS?6f\[;- IDAT~'X Jנzp֠yʜS6f[[ɲנz.dנzʜRʜR6e6e[ZL֟z֟yp֟z5ץ}ʛQʛQ6dZZנzu#נzʛPʛP6dZנyʛO6e6cYs%555ʛN6cYYMM~;IDATʚN6f6bXt%ʚMʚMXXKʚLʚLʙIWzIENDB`armory-0.92.3/img/conf6t.png0000644000000000000000000001302112414772654014306 0ustar rootrootPNG  IHDR$&9sRGBbKGD pHYs  tIME 0|zIDATX yT x /| =  #YKO ,覉Br #CUH~ -览 Fl,6<]C髂< 騆 >f3@ ;z5d97ጱx驅E:xP6A 骃 28xYR7:G8b\  *F %HXy (  [uG 3 0E Efd ) !o=|PxIENDB`armory-0.92.3/img/unlockedIcon.png0000644000000000000000000000126612414772654015534 0ustar rootrootPNG  IHDR(^\sBIT|d pHYs  tEXtSoftwarewww.inkscape.org<3IDATXݘkAoi"~%\`"⁍$&ӨB ? A+;`c$6vt1)b%1i=As.hZܬ7{q<3ϼ03;3tHkTfiS#n>` 7H$0 In F"ǁ7 pިn]9xƟc !`*8F"%-0nT+iBbsF\M`$ Th ´Q.QAMi}@1.48vpr$&! 9|٨n \s$knچ4xr~$&y{8 wz7\;lﰱ S/TG09`0,"gUu,Y?@wyA)AL~v,'x5X K6v`=j/fP[ ۄ7]4֟υ-;࣍U_Ihpص.MqK\}%J`ߜ$O# lJSE&p@V*ac5񁞆+~{U,}2IENDB`armory-0.92.3/img/armory_logo_h56.png0000644000000000000000000002674112414772654016137 0ustar rootrootPNG  IHDR8޵sRGBbKGD pHYs.#.#x?vtIME6 IDATxyx]U?k{oN<&M4Ik68082"PA^I@}}QAQPDA@@p@^W鐤IJ& ޳{NrrroVy{97ɹgOkZߵ>d%+ogYl~eKWf;(+Yy+ ճ$g#2ښ¹߾5w] */rPv%9x6=4/x /dd%k@e˖ \O,"W&-f~ZJU;6qe%+YdHjkk)\͕x8 2z۞*짍7gG,+Y &˖-Za+&*A+Im,>/.ଛ&C~?GU*p0CDT%Xĉ!A{;ItݦM -y9pdG/+Yy;g_q}{RrkjUu<ԊN ޥ)QХ%ϸa]CUpw;Ș Ϻ1n?_8yĈMl3zq.Zvu1DGdޱhk-ɶ?2 NVZubͪn~}{5hf%+B_£?1hLW7\ķLMxέ-n볥 n\ʃV.N<qb·DFLM ^r^s·"[w$1W7k;g_<$ǟ}zM$8E$rs~nrcEgeQanӻcԷ|WQثWj_{?sqvt7۟O$±\Li̥=7я)WZ}޵\h.MqG7jɫPIU,Qaw51XJ!R0LSK2 տZ︮]wzl߮^ߟwz͹=PK@bO7I4#n((~1w" 8+ha \<Eޯ'Gbo'[)L:Xq%&X8Z XXg'7u=}J~Xk!H&oycaJ8K7jlld…˺uF5k?&"#!yQTTq]רXk#uGUc4'''rʁv˲D$aox_xGKWVV>IxLFsФEBC . bUpuUs}5lx8޳r3n.L~ZUnǮMt{`&Q7Ne-Hn1ֵ$]Wlt`xۋ7lj/\I6.\իWSUU5NUjǠh6^Z2555Ml +Xw$%.666&(8kjjJE8N<|[W^k׎ $UUU3"bE$XLsnjllLWQ555x@vWƳ5$"KDv="T] 8N 0M7^1ecƁ.ΚUM#P_Gx|$n #PD/皿q+yuvu߳U;n6³˥Izoj萰`#1r]O"Ʋ4+3TPKy|ࣆ2^17_T#cabk."U<@kk;ZAUJ:fX5Lccz'M2BNϊWZi]4c6POUSޫIx_bUbyyZZZ(++2.---~gYk礩.Ut޽Os&WmrySx#C#4А8d?;le5twI"LL'gTK*`jʡPTTi)(Gd*"Sy*]f,Vw3} t&» PQQ!玀$x"eO{Cc1M <_~"ǔ(--ǧS"Rygy#!PM7n._2F/ucUSR9|4)"7].JT}Q_-++ҁq)++;LU么S)=z-p[[-J8LfJϸ9KzqBp HA[έmFown2> +> TU8q"'O gۓ^[Az}J>GdXDUZk=`@>/GVA! *gs wqzډY}֯_?9%%%x SfTU=+ 8IGB]˪'ƍdҁ}x\c=yhTW>WJJJ&^ǧDUR՚4L]?jժa㓑]wxgUd 70!NE!$Spc w~bɟ@$FLZ]gҥXkkkV3O8qb~nn@=goUM-U6>QUYY9Z{)K6ר|/t&NlkkcGPTUՍNU#PhWU{CXyOgjX okI:SҠGKJJnjkk0w\6lHus[vW)A+`}lx*U-JC! }'@vUP>pQ&3J/""a78CRloo_5o޼,Ux8zI,;H$V~U5W@ Epc.43#Z<?ë3U|*H̙ƍ;wn ,@?0im$>Wm7ET^U[[[wʊ<S[sI;?? vgkc9EU/_Z<4WVV^ ܭB}.>8N+ɓ8TZ^f͚~rc& [hX'^ 8@KRࢲ| NwHFqP݅'DsVheyh4-uO7qm0na8rP~v`\ zM}^. z~HDJXq[̙SqQ4$w Feee#Uuapض@sw+l0{7mڴ}ںZ1cL0z_31  $ap!Ơe---{ ,SUB'4ҍgt]wC[[݇^L "+۪hjj"L;s[ .;w:UU?Ƚ+"ϩk׮ t͘9bMW BT.C͠?T> qim޽D<"`愥SO=|ppk=йc'IwXh/@bQmU 6ذa˪&CX;Ӭt|VgEJTKUj-mizƹ`^ٳcz8$OxyZ W2ZNN,n`Ӂ.$,X9C rJBM$qe"%9zijj\׆aZk/S/KX$W]vAq?Z=d2Ɏ;$Ob򦄋o:(cg…っUuV%Dpg] 0w\ ~ds[@#nBsTU Ht M ֽ8mETy^4+`>1FȤE^+Qǀ#/lFD"{h~ϵN0(//n <+HȞZvշd6W677?ύ#9B(K@S$fGvmo1k s#"("]"h4" /JLRaBA6+;= zV|!k~zkբO=kW}_R Og޴MZ~~Y%<^{lU*D!L҂wr~gCaJ{ZiٻED rr|-_'…bψJkPKU ݾ OZk>-2C2,ԏO8X,6SUj}[[[׎ŵ I~z}gF #ϘI*=mX0!%%%ӁSi֫SW^5?6,,5 ^yv|>eQ^݀ՊZvcGD1r#r77וx~X%! f1Z?3- ~Iӿ-L2067TaHbp[ZZOc2e(,ė~/^٧8y ͵IJQhz<0= ;Bu1H-Kθ~oU/.)n}F: !ɛ'- V y9.DRQ| '"džEd8>MJUG֠yȰ>"'?YhQ555NCC@:}& ^}CD cj9ͫk8wyt mGd8ADJ?v}uAױtGs=N[RSS󹠾$mmmdYKXWc7 F#C-!-W pr̝;ju?>ӮY&ƹHe4Ƣ "C#(5 {$oCuhY;)Yۋ\5555жL\|XU#T Ѐ 1555K|"t'<VhU{S("WȧDj[}H%"_~-))ﰢo!c8""?BоsM +4奇gm؇wg7ѴaaIG Ǻ⯓O_1^hE0W(JDM[p:* ⛞A8&*amMǕ)! xUzd\:p10NU9p7׬Y?qpTqpVm:++5`SH>//:`8ʽVU[%O2 x p։o@&?*m tx{qަ&!"xi$ {}7l9"ʌ1HY,:g|"7t.efm:D2&*.b)TMr z%2=5IJDhmi8V~!𿄈cRΰ#+u4! /~wi_Mƪ7ׯ_o,X7k"^&Hڊȳ>5e_cccWMMM P`<\IvAC">x [j՞L4{' |?:=QKdS.T.sژ e@#H]7 }mtst9^)[LTd(Ejt$b2`H17V)Gmp)CrG3[V`ެ< ɛaDD:tm3_-Pss]ӱͤ 7lutW}M $†ݟ-hYkwȍ{G/uΜ9NeK3>_D6U A#T!tN] ı?[w~۲oHGڇL2%E%>"LW=Vy߲aeO<0fpl'Ǝ:^Q9F FbD:+d 7ty#;jQ"q.ܙ$ڟؓl g2 B"UdȚ5k6ȍ%ꃽ3K"Ncҭ4 /. f2VkkEZ޵nƍTWy.ya9J5]4}A+g^ǟ 8ޡ˙%ի$xfO&2$᲎ 3\c2@(TcE@vǝ]6oA7TE#C].M$zTK{ }[V3PGq};N͛"qAA{s455}Y%~]"rϐdfUXRnC`ef|^&EJJ;~[2Ȏw ;B ,"q<&/-|yeUEW&H"2Ԯީ@$j tN٪M Yn:[]]ͪU|=m 8U2>Nz-"75҇`m%A4}ЛTz]eW&Ì"#e EXsw5,~^ Xchl߹-b}ED=ķ7BdDg3`u&R& ENx!g 饪 ^;*SSS/lxm^:‰2H X+[sM}.eLvX9C G>;a$ꪖZ<+|^|U^ !Ct'Ǧ,g1ljޫnRYQ_:"vٲeL,p_ψHk]]]l"2𺌬d%+F`2">?*9IXerzi6e^$ F!.t2MEpגbOqW!Pz~w΍[GJV&bފ@!ϒHțd,J6"PQr_%9;JYU$,€PuDK*r"EҿQe=WfG)+YJ@>\@.:νv{Ͻ6aYL"[5sMX! @:ZXuW#O--IENDB`armory-0.92.3/img/arrow_up32.png0000644000000000000000000000236412414772654015122 0ustar rootrootPNG  IHDR szzsRGBbKGD pHYsIIEtIME6O-tIDATX[lUE5OSC[JR4`wA&h@Jb(1>bF}D b"RJ˥`[J/ާ=\{|`%k5{ &8'^kQM>^ ֲ@+%OʧlzԎ {4?U5E~ޝ3˿,))}? 3lџhjU5"f$[)Xm8TL/.W=>Y^=rWIvwu=7~V#>'x]m?~~q -_1hISYT{`\rXڐ5|² st X\AD&`{fyc6̩3랾nmg Cc7nZ5b-q2.sG%Fq{Gڧ8w,YۤMTL[n-.u颕zXz(/͸q!OJ R̚<~v PU0:/9*9ëx-u~H̄ 21{Hk?ƀB:{OR8q 3ھkE˰/ypoœ&ބAQ'<!V#'*JC2{F??ն*գ+.*x0 7V!xJTU(%cjWw!_үj3zh`?wQl%:^ٸyb;T36!1* lM!$3}gwE-[ 5~ހ1L" kXAİ>;_|\D 9߄ͳX# "*U\bHwAn]`kH8i0FFt)׋1 U Q-hFb9/V:dƅ+қ̫' ރz{0X9 cwqC `< GQGbͧ(YJ5qR@0#08 >L"|m+"vh.hd%Y=Q/yu>!kY`6|3 2Z9٧b=ϛˈ%vf!G˂ cOg_Td]#Ymznhx> H@ŵ}9U > *RߓeWvս9z k$qPԼZ )I6 +W=w@Ѽ6Esw(&,xrwŘ,&Kdiۚx2D/C,Dq>!Y,9d)jVa bR-ύݖ EA<9fïua5 `{i&3BLquxK1f G b2 <]J#~"%On-^faHO@Xu)o{JCF8çhbl%wWX E|&2P槡(B(zSJ ( }Av- [+M;S hOA!ifj~.HAu_buF?BMt ݜ~Ґ=+2 +I[uuB`4<4|ъ]xݭ^ɺp0i;FAAykOt O)%Mή(J񴞜ux42S\4iXh 䐛{B?x ߣA(#ͱѣءBS>ZkуT( oh֮iڳePT)ଷŷK$mh>RN{d @W/\- 4EӴCzEAA&)v6Ժ'uUCE<q`K 8;]rItM4M;//oRvv.DY *1jq0Zt4R ,6m9uxv8. z[ʞ.nsvzL<E4Ƅl ^Q%f\=Fq-.~n7>_81*iʹ XOLs[fquɺf::|ú.Lr{^9 MFh SqF_nˀ9!?>ƥnm'B ,YKz\پ./158rrUX*-)Z 8E*jobJqπ=n^`o! :>G{y?R1~PsK$,kqj &~@"֦e)b_EFMpQeP2we=`AVG@tRǛxhkAЯV_0~@%BU(U2C2W%*v.e'M0 ni xYOuǫ>>0wQKב&`euԆ7G\)P&8,6^7)հ7#x8F ;oZV`ӥD;&c.H#Kj֔Z-^BY5ysJ|,)z~g1 ̞%SV!+9w&Ǘz` MT c!{;akm۞>R :=8YMpƧOcq+dCӐA,.UzЕW&nf#B1`| 铟ŐCھ|_ݶyZLV;̞8z2|xԷ|H:2 iI 1 c5}KcNhwy)SC>Ֆ/+$sKlkO mzf8^9w4Q0Y^L$ZEG(4G5xWn2s2;8;eTOxH"/;o,s{f#C%聓Mұ ,657"Jy0AmJց_2[;)[CdU cuxmUw|D4[/v-z3a!lFWPnB(6r]ڊ%S g)Wr|ΣUxk>mCx+Cv}BBAE DO}pJgƓ(bߪW! lVKuB -z6(zRu[Ju%vǁZ6YFE Bx=^ݞNf2c>Qx6޶\d2ui~Oj0Ayzj&-'u%Xp-r;09"^ͭ47Kxmz1Fz!&oS ߮&Aŋ|@xwܰb#pa(?hmq_sGtu&wMӮ~G8 y}6v/!<>?Nv't;uhwP.E5\mWm[ 03puMӂ O=`CMR_W9|tI|> p` f\4iOׁx6*0AӴSzt(%]שq!~95"8i|Hhvi C)c2ƲSr@ߦrpH8!8ؓiWӴBrpio:g -B(p Sq*LF_†U@i 76W?ݽ.dО3cS  ZJjʔgA7¹wҜ,b J@V W2z *?af*}-p+%/۸'zK$15O L 3` ZFl̜4 H|L$"= {@͠E(.#G,`P /' Oߵ $+W5vqGG kOJ f4b+}K6!L .gS . yH7"M 1N3fO!q=G8T*yF5J n͚  )7|G c4.Bq@ "3` >$XO k9 %-A|G $ Z6}tE wB L*nHz  R.>"H:"Sܫѕ  |N.>  ٧͌ ʓ˅̌Ҡ ۵sDnݳ  ,i  h4P ԗ ~RU rAٮl |4 Π m9ʎq#f-J)8 Ҟ ,"4ӡ/]*$. ڰ,=] k9 8"٭%4 Y  "&О2d1\! ( t G.F)&*߹ !)Ҟȃ )MҠ,Y1b"'@+= '1nI  ! #(g߿ S !$ #*BM"' "I+o  Bh]%!$  '00z (1U;IDAT  ~ 8A ;0     $; 3  m{IENDB`armory-0.92.3/img/button-seagreen.png0000644000000000000000000004577412414772654016235 0ustar rootrootPNG  IHDR\rfgAMA asRGB cHRMz&u0`:pQ<bKGDC pHYs   vpAgg܊IIDATxyeIU%}١ uPQA`PVDDFeAqP@PiTihhnz%\}YY/*Ef{%^'N8@ .>7Xb8h1[A`3)`p/v KHP+j ʙpxȤ\H#8B"G" D{@1$h5 WE\xXڠ0VA<ę0#F$T"r$Fn},na@?ƀ+v"E,&;cLv֔F$Uzʹ0,000,0Eq%%X-VQؙVuvsr⁛{0b"qVXn#Vf`mp"qdB݁x+ 4 *H%$ rD#G0=.JR3F}Jj APt 4~T\Eܥe続`;"3Ht?ƃ"ܟݦ~NF84>T=ӷ~QEσflx,8t{K){"/j߄Mv܇?|ׄadǽ1 bPaGA'a<12l0&m(fCu= DV`/G%Rkk۾PZy0 zRPęq5:7XBu eh!.K 2"  K !xqyt<]D=n9T[:ˢICo~ӷz Zq}1Z=%yzw#pY,R^7 a,Gǘ }sЎ7C8@E{Pyd,ٱ3c,fXN`Cةaѻӏ_ LBf%HOY=[ YՏ ]:8K%lwj8w3潄؂\VH>FQ#W ~"|^)6QEOFN e}h61p\,53U8n|bfG1*\|XkY%y^,XdY {lx4c'jdqg5ڞl5#"n2(rP 5=}!5;ۜ"puL%(_REo4BS,S,1PbcXGOD).PcJqbTfo=2eA&T:$aZ(GF8<:puZj4 >!b6mn:ܪl@E1ݝ+8%X/ҩËS|6P䙱Kb k v=A=8UgƷmj;T/7lgMw/k{+C)˄L," D*F_c0G942PeOSoC.gV%qVg1 |Ĭf3ŢQ<edťls:{3yUYOE"k8l>>t s&au=}l5l_EoDW\$\6?EЗP!mKTӔJROgI0TͨXLfH۰hVdZ %`7~NMOQg.m/#.`~܂"W;rٻMT}=Г;fO_bJe.Y+׬gk*](0i- cZQE먚$0>COp2N-=1n*ܥ[p6"]ByLS5\vq>=Q OE^]cH׼>h6QEF؇Rwzzdp ^ˎU()F1yvtH)#*:ƮGs-3"A(8Bꦣ)ٻ)o%)x| ra+E1K79=?m>? > 6okYCΘˍe& Acn,ƙmc[* yܖKYG1BG&:>wce˕׬"2xWU7ނDƵƐ`+>=nA~$ en.974~,N+sߌB֬1[.5vwfQ%g$=Ng ̠T$ھHＮyk0(pV+[$&qJ^\j'؛eiqu]۶q 'k5="vu*8[ƨ>+WFI}8g6;fFz0_h]{9:>:bq6b$z27_%0}:5{Kd.Rx LpϧűVrMr=t鑖Oof>=9~ɖG}2ټlRyzʥOjy >S6܆D_-;'’R{A2SӞ(* ڂse{}blXMۯUks$,<267?Ƚ'[f+p[c'\2_i)2{uEDګfj ~>Z.53Jq ĭuъTӄ;䶃{8] dK+/!lkw`P;<韓>~ĝ9Q`wν2ܱYs8xxĆQʸ螼fc܏vN~~dլ꾨tBE{PHj;5t@!m*\o[v-RbhKPg0Pdjڌ#G޶ݨ*y/?wQ%EIumsfkwk,MEess`t}-4$nFMXϭ<;\^ $ѣ:TU{wzqay;σ02kz8>1xRo Ulx ?1(@l4*7{Y#89Fϴk?Lk/i\v#Oں9<6D,R W_۲aVQ o1NkFN/lXM.+.f[SC(,j-Xщ1&&ӒO)ޣ#cS|xz`dg-RgW ^Sp;q1ϟdmk{ie ^+ΞPc mQji:M z[&)rNF?>_MkUl?@$be!. ZV?q2Tj ^=r׍[/{^n_] o9yIl=N;zmo-X]F-1Nl{Xݛ[6QŎ%#"z1{~و*O=ӁEqpO)&꡻Puix?!d?w RmŸsw~寡DީGJ*%"^(4' VU,0iUfYVbx|tn ʏ{43t:6:F9P*_*O3RjiRslxe/Gd` H,x*nsSԆ"*^ z0E`]W/EO4ؔ@ wX]fͱAO@xFHޥ_FnM܉l|F䇜zjT t UTbDFp9ӂ!BͧݞGZ_fy\y/3Gԡ. ZL@knz EF036؋j5)\Cg{g? `OEnܜI+y9;.fTfxҤÒP4MCW d@԰ӣ _ ➆㳷wE+ҟwdRDf=jiŧ][rk Nb!*y;9Ά/- 7Ž&6 ilx|A6DK)+4%!8;C"NV'x5[-:qHcnkI )Z=Kk9G1'g= jtiZ#GpRkwlx hkl-Xgrjgڊ!HFj Z|R!r\F[u#gz!\o7|sY}.\ X\~᳛CXi?+{"(Q^Z؝ȥιnwϲppl&~\r9,V]ߜd"3X_tƮb*oo(WDP s-L\a`[SXI="4Fڮjjk,&PHfT: 9$!ݹ J>W7/},*i9q?X>gvբ2>* 8Q4%F&bZJb[X퐟Բ| - ٭ ˜B7|TVELzA]S5t[~nlv 7㐟E䅕Y=*ӝU~ 校ht@2YlmwſX_9y@fa8g5MaO\O|}j%{*؇&T}WAL{l߹ )rTP'~y:7m-ܪ梥b˷#$g$o9v _!“K.X\vZDT97QLWSts9bE.˝,&R3KTҔD=*L .PdEO\ܢ؋P >UmXPW/1}yzXɓe#ױ$<|2nӬ$9sHBQtY)E("QD۝Jc9t.K]4a"&x;$ۗ‚iOS*"2*?\7F5^YX6VK4 )1}2E\gt〨Ce=9yUՙާT| fȔq]$RZ (ܒd?uԽg"MMjԼǛ6?78π1MꜬM@D [۳BէU΢lP!Àu j}̑3pn`9ђg+k$kYMjc#l|5ȓ@(rSn8yv^6viBͧY H^m9` aE֔+qM[YfmΑq2N%M^Rvnљ !Iov;O{*E2h:K.8S4= 793{?m۷|{oy:iB_ĚR7=Bfȷ9^Ts&iVrl\sO^X͉u=%)X00<I-?Mq6vE1]q]6 n~lj2*iB>bzY2!XU:2]hJX5#5O%M9Q&Y3az(!)?E(ϫes00HUIP*>eDJAIB9)řщLW^8;/R4sU)5Q]ϭDoGʉ*]q.lsXCVN?RrG# -?ɡLIӟ tJ c$~(jFJjh#|#S. 1n ĭ#fف_|+hw@jiI69̕J;ՕJrV(EtEQ<ı3{լp!5|Jiη0}.f3C4EVL]eϸ5 F9rc 0s%1OIud#װ-8jյNfLN޽J]S3,6m ,("ק>YZN9+uGfY׶luR)&eD$AD%[]t EQ3 SeY2㿳g06uWΘFT]:[-2+|˄z5~bL~dqF.myc+I #1OI"d29NsC6Igc8Ӭw)B)#"gV5 jvl0J--HjΝ&%h7 WOq9 |Jeo]6~7[+E+;kg_hSK,N83$fMٵVQۚǰb KyEԲ PV5Mmp)hb ՆZ^3Y P=j6ٺ4Si,2̑W3[mGg[>Xe"tik* -;Xz$}"ݢg[rk'Io bhc;W ҮY *ֶK̦%l`6JWJ1"6^L1?X4lkL"|bGɘ3.=_1:ـY D)m--eOCUXH+z6 z SAAs=7y$GYz̲Lmb9M+) hfkg`f%m1 ` -%9,?~o[5 /&dЌ(?qMX,Gew4#o3,@ 棛3.t0~i!vbJ^~L99ruN, Tt00X4sEz2 Y'` ,f_feL@ ]`˗6@ bh SPn0XZDM f˝+=`\{1VD`@2 [8,m< |io6]gJmFBIf# } m/)3:9/@`1G-,PHH,WmB0h,?.c|c @`ٓ Xi\ T?ͅ@VL jfXmBj@HUiu@\t@Z j凵sMGw[2 ţs"ˁGOOWu-&g6  k /f֯N{y@?b741DтrBђcx-VqZ&l ,O.:3 @FvfK@ YlnU,^g)5;ĭiu3$D;5`wS1E|zdӽk4XN)S?ZYEM`1!Ē/vqMnqL㌠倩[ &Pj"yd?XNxOW0!ƫPTG"SYyknd@ᝠo9 pX}#/H0Z`'[ol' `GE3o?ՆsG[}v9"qD(4ڶCjP; k&9n@oPl-#,{8LZ~*L{ipq}"=k׷~eU&"'}-ϝ]kXc x15>-?+jz]^l!tx<`f{>i1X"t Kӹ€jI]S69ƨ'ROs_,UN>f+pfr/03} b@'ՓvF̸#_r_VPWU0 >&)aa@ p6-zPe{5=f0ZR)R*@ p'mjvٸV"OkuZ&{—[ow Vs7Z 8 xe[͆7yԳ?{\{k 3vsN %PVYܢq7*{yc\ @8z*T lܕj#L)Q|s0aƯ :u$, 6V#I:o3%U2hf'm#@`ZZū[?\ MP(jص-D RbWg'n~ +7$Gb$_#ҕjX,1VOj k lܛ;]i|)+qi`KWؽ w=Sx~WfåUԏ*6>TaM=rx$Z:NEŪuRkg 갘LL^3xşbfz;sUNKʅTˍϒuwm̗ ;.'HKacت)g` XXذKrz!]B~v)d*,6:{!̾<} S|xvYF62SJ(BISlx,7̫}k1?Yn!@맼عٙ RE&p@\БqZkxgUGSD[8x֯[Oky7lh4L Jl0C͌n:m~(Wj),\*d󕡄ʂ::1blBU?Ϊ|-כo8SD}=;=ij |V8;|!WOYnЁc--@=:2Yyjqvgi.2SsW<{Pf؉lןTUS7Egj?{ >o鹬 q1ll"_O>뜽{w]cOCo؉Yo a~~87 }OVdzz{UC e=5D1P#꯵j7*{Ni"-ރnt^r)ޣX~܌7o˼za~X$ 0&O^gĹ@nEt sUj^?I.,~)'{oa/8ȹ'AzqW@ʄ傁c;jT׫LTG/?[/j@ë~67_A-(wA p;tU?WSaV@F KY0c2' ".vj=>W{Ќ!,~hޗn/;'K5T^ CJ(8,U7T A gN>=.؎۸vn%Xnv~Aok$xӀ3ľ>{Vz0)Dz96¯fu5 בmG$֯!zRX:t'l3 U*%]"z؃ǀ9܇T(AYZt5tAȉy:yҘM|=~$kf%W {S^|sr}.ΰOE&bI?A@`>S{vg}y`é[ u~;SWo<.<.w@=i(ކ /PP6?d>^^\lV=_c3lOM8n% P.g?MU?h>ا߫k߁~taWpHְq\o#` ADSCwݏ=T4U:}r$>3{cE?$E&s'ïDVv1vt&ãkr=9S,"ou=.轱sm{2G|UUE?.ldv+X5&|ӷ> E۪jzgn64FzNIBP(;vb# mڪWLzΆebO$rm pr 3Q]]īտܺKw'F着3?IQW-D'l?u)@o#XLDstU^_iot/t)f?Vo 7D2rko]_08PKL_oj:ezW~,? ~ _q UCH97O1o`&x ?ȭfF*mz^$vKDh|6:=2  q |+{w܅60DMM__B;_ߥ`e+ _>HD85UVڥkROc'HmI!GI{OMW=fL "܇8x_wνJ:}k#Ho;2yo).Ft%@_V3Ixa Y ڃ>t=>M#;g!l `&4P4mmӌS I F&C;nrEK{Gpy}f_RAH\ZvA., ۝ȫ'n՜O۰pn/#ڲ qf `eS#5|9vMO=;H'[0yߦ{A40Rhzkvd{q,wD Il==?|jy`|g"N?TWo`ypqMj׋[_r" 9tq6]y n*CѲCR;`/V-ِ7qRW5w}O\ φHzEϊWF=^-d۾hǶ,~ aΧ=v{?p#S7y3q8V~ڎqq+z'7s,7K"~ډlZ^*Vom\ EldVaC#,dw&A5w.A}nOQk,^"*>щ<߉<Ӊ[𹚳"Hm\۲ElŮ VKQQqVgs5 09>BT AWDEPxB\wI$󜸟n?A;p֭BV =]!]Ja bcP}zz$7=fmR(ۗϖ\˅xs`'=D~2aB_?SkWA h+f5i֣WkSocgşI6o{/͙P3(G֋?5$J@1~$~>yrSD\`Y5[Տ8;p–iٍr2vGtfZNc3a?=M:V;E]jbΕS0_~빙ň\{CDn@w@Q;"P."=]@?nE˙PLǭzTS|5 VOV&*:<0^Z ۔lXEYi5SOh {Jq6='\ lxxu|={yM+4!nNUB{2P*f!r qrFg0im`=xz%Pe>QBnb)&"\kdgU 7I&. (sUͲ*qCp?%;1=WA.6CXJN (B)3>Z]S43Uc㧚Kfq5ݰ/ٿuBTП#A,yPC#$נ\'=ED~ ׈Ⱥy/>:Wdҹxff^þhj H씚eot>sC0A,6R jP*=JvnG0~Cü05WzZ!.ANEPK+tEm~ڗKO.w 0$CeeØ!oz;b>x{PQN:+"wHG8#zMnV-t8,oafwAEc:`&g( S0]Z?" ;G hώͺQfP{b6tm> #eίRY-BUυ([>,N(E1jZMF푓k02&9-P2(caM:%TUu>`7 8=QKV)fx{4A,W~7cRE%5Nl&`"֋> zJMQJ, ɰ<IYo>0av0pHb0;Y (6 Z: Vox f:ӻfPA@DB@BjVO V5U1WqhIoƙiFrN\`PxeVLX(%0#IǤL8\h&.60@iFܸ ; /_v;tEXtcommentEdited by Paul Sherman for WPClipart, Public Domain4%tEXtcreate-date2008-10-14T16:40:20-04:00 B%tEXtdate:create2010-01-11T09:43:39-07:00޸%tEXtdate:modify2010-01-11T09:43:39-07:00yf2tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?%tEXtmodify-date2008-10-14T16:40:20-04:00|vtEXtSourceWPCliparta$tEXtSource_URLhttp://www.wpclipart.com/4IENDB`armory-0.92.3/img/x-office-address-book.png0000644000000000000000000004540312414772654017173 0ustar rootrootPNG  IHDR\rfbKGDC pHYsIIE vpAgg܊I^IDATxi$uݛk~zY ! 4B mʐ4l"ۊЈC#VDbH  !0 1 l=KWsr*2^w~Uu~y|0Ɛ"E4H"ErH E)Hq#%)b"]R@w1RH.FJ)R>(8 p!۬쓏_!9,/\|G|iG, bR$o{>d\4tpIOT|'>3K/\@ǒ"g|L/\U_F:S&}`/\$%~X;J)Ξ=?gWP,ͩddPJ`2&`2 ` 01Ymƈ{7xp֎qҏoȈ~_|WB֏h훌g9ҥk7ݭ}t4\oq0Sc$?߅\.?XlR0XTӶ"0P{u6#!Y97ss;05{۾4o{Fm? |5ro 2 mǖ8VG>^|j i!  #xCw S<&X7 D܇__(Uv\vGǒ>q0>.*~Nߋ?|^ndoxNf`PM b1w䀹"gqoE;Ot'm,̚4$w~_чESWxw>Y!:ci&3a Fρgsڙ&lfrdۆ<ķ!gwGn7 Fj6Crq~Q(AA A&tWpv8xK<>ߋlFMA7t3i4Mi % "Wnlՠ`лG ؝)lZxR( 'X1@m<{$0g2` C3 PJL@ B /)@3Lg*PT@6#{O 6 ?=ir,[rY{[5}0o֓fkzkt4t{Q:xڶ4(#|'3#fO'}~8}{,+ҟav\Y N1{Z 9/T](?-Q8"8(X\(zڛ#֠f+&) ς( gs Pmt+O?Av疴V+OH类S?ta@ |Rmv-ݧ sI[>Bz|8샻EZ)ƃ;( @\ƙ}ܶК4wQyj o&qnI[dIѣ^B 4d{:=ئWJ)>ḓ1__3=_,"dY‘e6tNRd3^@xS,Ay8z g&TyAvDSa"H;œOl{8 5@6pv[O) r}Ij 7s8@!K^D1ۋH E$[;0ks7g(H !A9oGz?2@uӮȉxgՅ_Θ%W&@U屳fOpR@0`ttP ة8oif{ș2o78+l6g`Bq%aXA@.u 73Hu쁀REeRPZ@!Hd7o=j̺ÀVNRg eVGB=bg @WNOf2>``` LpPBU%PBv+xenn$|wa:` ;nfg R$@W4GnNZn'̬PgxX$ O̙l t>nӄToA5 5ZZĎDtE-B(h`JO)HlF&9[k,^@(؅Ƞu=OLքlOjCltS.)qe#S$J yy}W|bV~ȏ|uu^3FOcwsYw0ZwR1蝎 ךkM`}$UʣT~S~AύP'>- r rv%A?TӑGv{B9JCY%I3 (t0d(pՁ(pw+J e:;T=0u]Hv҇ AA,TFc|n. h8AMsF)DSu5UGL%2`[QpqTF' IʯOh t4ֶNp`|t+%<" (?X" !̚7CuuB6C 4 "ˋtY̬rSren7߽5YAz0mWPX߂֒>Bl1 KyTWakN&A7wcM>`(%N@09* gp@jPiy'CaH nS^% D zo;VB'iRa@QWٙxus>-?[N3ɇϔe l]<$AA~c'V3ŔDhYZNE'Be`Ftӄ@lu XH&WѨq 6C)U"h}ZpY9$ȧp9Pd8p]3iJWoArEu (AG\SaD H%9oe6jJ ڇToaL р"CU,T)PdN908쁙gQX19:,EʅDtU*/AhnW٩j!5ZX|* ! ګ8xb8Ԍ("M\@Lҵ[PC(hќ/”x%,r{}01M=v1TQ{Q)@o{Ssd2Ҁ[9T1wyml_WeV*.H9]\ֶ!ÅƚEH1KTYWTs`h@J8iS"aX/\<6]FQ@6A2]m,\>7%ՓG.l40p1/Aݯ%z2ahS4E\3T(_Y1!Eݐ$XO_;w,QC7v"GR0 I"2xEB(!)0H$z zOe,<{WlV, gVPzMl?pz**C)J0H\}:ӄnAT}%fO~mͯZ}"^ϙ!J 1cu9Aܥ {V'XQ9u B[+!6nTqqÁKsEajƧgrV2 !XWW kJ%U{t(=AA9y s :E-.^c|f@)勁U)H@,ZGN"[ξ;t/* Iٕ@qT75{  `{S}O @]=@gx ⵍ@mMQHh jǗnClN^(W* hV`}qt6;>(8KP !@+{LTFf2zp3{Wu<&p9zGC^G*z.CBVƓwH0$~&5J?s Z6b@ QSgJ}yG0MjB[(-B yd|~˜F^SKK/t<_z5Й!B -?5˴^I8at=4DbPu(:vj'>CaJ":,ZLt4JH6[EĎ P01TcU.od3 x;_u])!ʹ PBp=lZnq^ X[;To: G?avK@6!SՍ٩H ,A?&PԎ̣~d7FЍI:t) ]@amkh;݁ToB-^0ʐ$APZ(/f& Mr$[;Ǘ&Su,r'&N m,\D5ǝJF_EfX(A<9\xf,UEr!Zb9U~=J6NCjUVQ_wXAE S.FZ{."EZBwv[~-TǗߋml3(a3C2~,w7ҟ,X|'QXiR0BP9u4@ sצXSXۂ\kb.H)F3< ő@uJ1 An8(ȉDf؄Vgϳ-&E.'>3@(r`*?JN* m.'K5 ^CP1X!,(ShQ!1h@4X~y-9UɃR9GL_HU$x`E>mL@fsodF)jG',\>ȷQnW4  )R3z?p>X}PJˇ.%A  v- a"3zX1M]^Љh(Q0[nW@O#GO8Oj!~`]ڌDI|wp@u2)[/^=KyK9bi{,ZWu Z x VJ^Ւat y 96?< I̽pqL2[Ƒ8ynĥT,,#]њ+0uy kR̔D0rAjўpHȍ$h6r#TvlC7Z5Bc`P]4tЀ0JXnqCjP7,å%9F}=FEl G#/!z@PdV>9Ӏ\pg EA@]M,޸JYXeP{~``e gE"@;emZ ,k3Cj2d"ahhNTjJ;@\DqN*7EY1rzW_L!JD] z:F B{dT, dĝq*pPw}B 2ow b!X3Pcf(!|90tڱEby~-8&'՗JG<SnF#sCPb.&:@(,Ge6Yp?V5 )ߚ?]WR{Z2cSGC]N@f }ڏ >1PJ(QʂyٸB?hbG8!N5|qb)<誌v,VrJ#i 7u> KXlSxꭑh95ywPyqɉ`9klDK=) "`2V,h AߴMlvc@N,cLb""b6Ԕc*%̱ ,| n,?-p Pb "J l@a9`F4pAб:;u^,@ ~"rs#;`&S=]Nq@\JJ"ʰ";N'`5IV\Bh NƲfTU{@o3MCq0_CcWϕL;zO|+N'ਘ Ч(yXJpK  n d1,i`JOP p@|\th#(bWZ0%o%@D5 ?Ǒ 0xL x0:)@ Jq)ĸ0ˀOLw(@7%- : 3Ƃ ~C:$% ܵpԏrÁcDq,* 0bт> Y;Ni FfM ("7-xX]ǘ<30 k昫,xIqFR)mƤ"Lp[&l8=NS% ꨪ)f @?i`X>Pc (`A}d} 2\ѳmh@Kg>X.,8#E ă,-!nL򻸋j^NWtRrt!Q4/QKhq0Xi_,$x Gܣ;B't%)ՍLS4MV3< p @-xbf|@DAxsD+Tם@LS %[ѕ7''d 0*r 4 H)nY<ʱLC6*s:Aq' 0mU(Z }x[}#' bC@ `EgJ*?xр50t G,@Ӓ]0 5'qдY%:G*p6r!vY6?,AN ib'Bd_ 8rs;F%<2x> ,At'W 4h,Ư~0E)` ~RP8r.LG, ykAqcR fU Ä@(NTQ P57]Y4^B (SqJ@6S5;qtP O@ hNԽ@vk/p X~{5f`uMɐ٭" Y1< @Q$(KLzY:nsػ|@UHsn5,XŃŇA|hqKu/#7װUߎ4R*tomc7P\E{n攗@Qh]G7Cnp9B&E$n7v`P-v 20tTRbz(_w0Q:ڥڅրRCփ$S &hA5 כH"9>SRh< "wAZۭH>/|U|﷉@&VSCVQ[Y= ϠXBv{t.T7U(-AQw r*:eAuJv1cӯ/8X. e൛mq[=dT`z?"$O Q-"wqjǗ!ך}tݳ| H"+a2y[{WpvGJ%ӲrU=a kutJqj s` LnWP?(vϝk7N!{Q 2< EċP\IcsJ;m/~)Ҿ{8l]Q;99_OU/;g\@<4-`J"vϝhśQs7I@sNG)&4Ze#puX<4WB^G+`^dϹ$MM9,88{;d!h,3::|AFpW]IH|PHNs #G]@o:0WYx@+daH).jnOljJ"v<.rw& .Q=8c ` ͥ9ԗ3<]JZp!7X1}kMCL K3O@0X pK-As|qKsTcvl"7nCF0%TO,I2ͥ2 CA3LT6D#DҘ&Xq%_%"y}8 ^(!5K5٭{ E޽udTj,UΣ].CSC)d?),U!k`<+E^'48ͫ"pb%Ac (TFhG_~}Bv*N1g2քuP$0JaJVY`vl! yɃ1~rٛ#'h9B̐( 5bc[z1b3[H1Mm&$o~р>W'0QP~Qk&,{M"SaS@LL/:\m EܛzD,@6j"P5螔,zHRW-b6|NLejd_k4EF C XZ;gi^ƲD"qr,`9Vܨ:*KOhXxDBxgr-ZPU+{?n0GjD5 *Mw) :u>{i7ݚL,At/am9lY@QQ B/#LtV֭ . ʓX{t'Mna+Ppk{"uo0Т3>рaT ^0߃U*V7!UbKP f :ڀ YL`-9 {_j@a*Q9} a厔jK/YR܇y& k[X|otm̦? `~GÁ}esx& N XnMZro(Ez85\ƐGfGaYZ{ڠ>ە@Tjm<نn<yڀr#AfDFc|=v$a*wX7d T+/)H&Wֱeo턲^ k[):Y.рu*M| LB/\mTIpjk/JoRV%1ӁaXefdj@LN \¥Pƻ،1 `_T% P(-FLk #u r(:  #( ^\ LPA찕,[߳ "hv=0 5Ė*t4P1L1Y?  ykY%*Bw 4BbJ%K> ZܡS`f"M#P),*{ӭȁE^Eք=a@])f< @ SW=GHeb@M|PvҀG `6EonCI(@ 1•^بf)x_0G(H2qX`[H$:67 h@ 0HS0L["UN \-D"<9PI\o ɉ;&wɋ t}[%(1PT)bzIWR$ .@ %G 8pQ'@ # nEAw6B ro,g)FZ*6F9XMSH1et4#*K2Y (!HIѻ@EJZ E`-஺d@]O1meQ@. :8pʮ|?J)@/~"E#Ӟ\\#'F,GJ#e(/ /8d*>`LcDc̞38e/!HE^V;8=H bv'Jb )RLUBy:pKvC{wޛD@dorDo SR6р[ |,eAu4ޛDծf:#H<ŝ ?qP^4>qeЈ7+c'Ʒ؟>$bbIr_,XI4 8h. a`JZH 9{1>)@TY ( ]Fſxcfߐd#ˁ],]H9op΄ `+/dT%$)G$E ( uWՉ.w1V5HLIJL-IoP `WN=ȍqm7\[^u$1 $8zJy JSJd1L%=fZ"$c Jr2[##Z962: pk(4}N.uˢ\/&)#by^"(H I"TEʐ%P00H""A`̽>s8!_霴7!5LW@|~ߏ|p7=_crkr:{C-q_gɹ6RWcHdT U%0 `?H H;ϝ$Ŷ:uCAĝ߱ sEjEY , 61LQiYۺ$p #*%pm}`%Od0@ P F\7dD3;&TP89k%d !VU΃U+l~0펿10̴h&LzMysnvdX?o'۾uqz]\dE 0 *`֚Ԑ (Z%eݴjk=m4-4m4-;Z?yԄlaȜzӏ~ISf~ $8 t|`2Kz0v~m׮m`mm >9u)a~1OX&m0& x"LM}%`0\8G0Lh5~s X[ۚeJ"^YS_ HP`r` n0&i2|k{ϿK̗3 C6P/pLHlN^;{!bޯg=o wA)=~=گkڽ_kwu3og {^z9w[G堍A ?4|*/8 $ nd F_7pf0, ?# 9Hw)RAxnmE;e4SWQ.Hwũ/K`&ut`Ng4az.7sp( ;g]?-6rSJ7>SLjx믣Zkjjw[E |>I?&b r`F7IGt>J>, ģ>+ol6npS 4Ѽiȿ/Ӹ3\F'?'PV)E {oMA0?xǧ^6} OYOxu\zЎEޟ{w ~`,1?M= %_~]7}wdǏ>r RJOceb)&/}~S,H|=헱?|I x!AɻQ_}:~7Ez'S0P]y6_t|vH)#̗@>u^յH-O>>1S'n0@7ҫ7nlsX(֛/nׁa߻'>_$C@dNŞ#ÿܗfZܼU܏(P ci0 LTzmchg"ʜU87 H ~w/]a:͢WGvv<$i&#|L\K?Œaˀ"sTofܹb61_: --!L0,5g(;b'q^FL__(c oVq]\_|Z Z,Lt5FaYE0qmIV_[yg"!+kx42s`PL꺜Z]\9z侸@''!dӂIwassf o D;|\~xi>8 1D&FE;[nݻߖ&֫rx |D.zMx[N n4 G1 7Q< ٷ7]Q(T_y,/'uH :2O^xo @Y(n`4 L!_"]7pƦ-V/ˣkෞ*.?Z7u:sx&ޏV߶xsx㍛&B]/&c zk[ݭb~~?yH`:}4L |uo~llVҫkc^N;Z3'n@POQ"~E.?#'O,_뷾_͖4>ݿ^>dpaVI@7 #Ԛ/x;nЕc e0E]gOCdYFB:gUƯ_|U( )G].gW޶bM;3nwPk^x{vc*UK1 {OP- |`Qctwn= cw#Mӱ_o-4ow3z/kkciH1 [gΣ8whHV 2 |ǃ qEvfBw䙹#}.#xG+r5,R13'pVAUok;>[߇O=uo=$Ѝݯo+7qks7+6vP7N?/0`{϶8}?>] Ʀib{~U

9pHO.<2%@`%{zLߺ4(!;G﷋,w_s\C#Pa xmX0 'o~Ĺ|pPk K_~~"a{_RDe$k-R !$JP,>n]~jۍ]ܾ?_ (|oӿhh@J{zI7F\N@{MS1ol㥗O &CF`{N @ r*LCg^_[5M[4cxӃ=H '{ӀQܓhk0q&̋/~=Vw;2S8𓲓:0DHDdo=F?KVk{ GJRjpkZZ}alpǔx᛿~':߼?ÿ7_đ9O}l)f☆pGY%܏w,-g}(,o.^x2z3J [;/?o? p6%$a$ .>pYùs'lPFm2;wہyvy3O̾uSd>88Wg;|+X1C ;ZG͗Uk>؇~pT7ӿ/BLM(%`ʶq5"{7zc>97_;f?~ ' #S±9s;;Y-| (R$c|n_F#s?=SGO?ZL X}506V@৽ϫS2޾uꕍ\}ϟsP#Ql?1(\y%S܂(eQXcAis1o^q7cw ٠-:O76_|cl{Xq-DٻufrYM۱u6c55M6mw=cm1i4 w׏i83M}^;m\A{:a`H!>$pi8 #k97G}ά*0c̴r ?b'ovSl6=kޛn" `#Q~ {[(GRH?0k tCqXi. /}}#Ex˳ ŊIض'2`N~6w"E\`# q : %4^}={2R'`1*CoԽ#Q)g&mXW12Q E3L,*$J1<A]q7 ydU`$L~7bSg7~n"np,ױ4='b^RH1+f! LsK?oSH7z Db?Au!^{?[)RčaSAI fe@J)?3=#53b3IX)!ޫ}@y0?8%@|ř8:8t褜ՊS dǁ;RH RYw1RH.FJ)R:@dl%tEXtdate:create2010-01-25T08:30:07-07:00N6%tEXtdate:modify2010-01-11T08:57:01-07:00y2tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?tEXtSoftwarewww.inkscape.org<tEXtSourceTango Icon LibraryT:tEXtSource_URLhttp://tango.freedesktop.org/Tango_Icon_LibraryȭIENDB`armory-0.92.3/img/arrow_right.png0000644000000000000000000004433112414772654015446 0ustar rootrootPNG  IHDR\rfbKGDC pHYsIIE vpAgg܊G4IDATx}wŝfvVڕ0"D`H3B6c ̳=پ|w}s>D$e !!Visztɻ3TUWUկ~M(ШN AFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFCFDLl˂{9$W[rOcC/7./ rwNcCkH6'fC*XlN-wG4.4T6&x-ٜPH9wЃ&͉Ё&J %ĄrwSch@@!n󨫭WIx+ٜ8}(?4T N;v.u0i,Xۄ(w_5 MIw>rܩ"M^H6'-w_5M a||i8Ua>A@Wj Ѿvt 3d867 zq/5j*6k; v`UH:]?_8j6ٜA9A1 B!nJ1ë3Ɣhw⛸P ds*K] 3GH>j:_͉_$ų** {Đ C vMx-nxA_(ٜS&#[wr3` ]]h.;6|F>|,Hh !_B/|߱;Än>#G)A~aDCM %H}@*dEǝ#|DI6',h ' %d=ІZ[0[mo>U]ds{ @B|vp ӇWs0Xw'+Kϻ6#M6'':PzL=QYK0|mŵc \wg1 S֒`bGIC@łrOB Yv#1̝} #r*_[Qh@ᾬ۹ }];UV0? S—}*LXۄW{\,D9 fyHg!ߺ~8i{9}Kc` }cSPo K #t?8wU7_[8Tݭds K=/Im 8e +pw/`^|/p^PWaLX&hHPwƙ' g-rd vlM'5lέQ@K9qlGZ "! :}\W-|wovl–ëaRNS_/7ݠ >F+(V4T |nJ|qHe̘x ;:IzؼrZ!=lN/RAs121_?.s3M8ۏr8Ο}%kP]ڥ^M*É4Bp2>Ri u@vllm>[{noR.+XW 0ٜ/>dL;ŞN ¥٥($BMAp Ϡvսznؑ#;a|QݔuRՌ©S.ĈD5aGa<a^f# DP =}W0{ BB;"wmp9D/OR:/$T 4 "U$:}{q9)W_M|N1ݺ{ 1 *k @,ެ 03-C!?#[|V<;bC@ /E@׃1C̳QKč㊹74& }Kx!{jLPlE&$R0FfL)i|hvm{"^KN_yjudsbZ"QHLlȵ:, )L7#CDZ'kC#b!#Rlj}l F8 qatc?F,PT  8q$O@"~bWvnF!v,$^x`vϒpwR~+<I'7|S'*Çz?%jp8,.mO&&Lj}Na:Qj˴ηRc4?N9T~La2v]9',JPp?jg0݇uh>X7..< dI9K~pT#@IQޜ-y[pSwҜ?ޘ ;/LBO+$lf.Ǟvٳx=>qo\9 B"AY5aB/pHGfvmÆK6~is„ɪq dgPD~D[^m@iT>Dh.󵜨,o2ߣL:Q(pI<ChSi5e?`af]`$wS~oGz=/b v,'&;}&:3`rr"pdF> =ӓ )( AF v9}amW`M|Ž*u>|Ds[X9=X{1ȋ`iUᔙsTSg4ă圿°'&HѴ*"d$=amkap:(jyHn_WfZv8򓎯Li$Rc͞p{7s^ucqşsP{dsߓ͉xt)1 gʫ-̔88@A|m B` @lӷ aw>Hė;C6lD:B\g7mp)K4w/ζ ̇H\r'T! T/ʽ d s Nf7wQ3רݯ}HH\zZ;o(Y[[W1e$#0#+:_/tT*DX2\2Sa* !Gm\;,=˂f Jv픂0Ypҋ"[fHniGD`SqǵaX NCp~Ys 1 hfcsA U #@)%B V3i/s^{ۏ$uG@0,X9ٜ-L/4*$E肶 ddAzݸ^q@N lKPhbAO7Xow<-l ?:uJX&cEmr n.Hԫ&glN//$* sZ%’slwgȑ|ڧi3{|{g7F FMm:S5lN|HSdL?AQ%NC(K)0Z ZU(gGY)>ކc]H*쬺$u*XE`,1~GAGo|&|"v$(R~{!tmC ucp9P'*ٜq91lhv/M|2`u>5w,d λRߒ$@eyW2qX1'\asb\߃s 溹" ~ oyPEGweŻH\p695q@3͉2AN;S{2/p5]sU S[6Y;/fY}"ޱ PKDN bt]'b/ӻ&Vu]m11I PӄakzaO(Ao<,~UkS J f22r@Mo?R,H"X jQSxzx4k+]8{UHq I |"_E,Z'j/aԲ `w]e?uWl9s^:T+$/s`G CBߟBhR;5MћD ^y$ CPGmM=jkPCM%.шs_cٮY6t7TeAa}O9źߝG7`ˑ՜sB- Y2pjAtdßi5HB/z3Q!zҹCt7ՅT30␀##Q_ۈX7v5Z̙~&6#J)ҽhY*lZj- aiQKs]:~ f/`Mz)׸B0ѹ׊m2K O6R״'ħ5٥{IdFD?LItSMu4 <bW4g/<B(bG#ҽHs0jb %QhD"n=D4mbp 0c@BD.9*4W/\C,HeP rK:8o4 5wۏv-B7r^BI~I >.r v'Նt'_tpBl2O^߃@"!3v #FK45ڂv:% Bg$3|il ˟@OVJ6',Hwb N ק|9n9~3˩-6(G{{vMn  <[ku#(nr莉%g4:afh[CїXKj%{:l8D8ɟg#O&5ЗB[ށV|x-ڽi#%8k0sɸ{0vUÊ<0,,*p"d/RVyNe9fBV1P$ǧݏ r{O+IEkl_ý;ї,P8O e"w~G!`9^</1yt̻L4SUIv..l/G7}9/ ᬂ 2bpnpVVCmI w+Tݻ$&zhݎqgzS;* 7 %) {~27[aLxpڬUUu7g  Y'7 pJoiycY "/̄ X-X9!d#4V@mI3cLj}a|+#_WN;SMdoy0k[y]Ɲ8A"^Ĩ؍3z\yZ lײ ]FCEXm,x&^݁ekxZ֤9-6Z>GY ld^q[?` Ӄ#}c=toFWLfgw0U_3Qg $%R^ 0v= dПF&FS6I$߆,. *`;b2+v(,әR/0{npU`z;\D .`;=3KLv"B`it;zRȘCwͪ)/`Tk;;րqfvET$E+5Іg܀xisisqRX'8 #GcSV|sq{ xOɭ|i8gր 59ZYk2q & :pw7vwnM8 w>U @A YC`o&,`GS0clrV Ee۩K򖁭g]3Qu&k&-ZdfS N9t2tO%-4˽g,pK%h BeV g"h 6sft؏2"KFHɀL|{/x\eLm@oo38W`i }0z1F~aOb YPo붿=m 8;2m Pn; xd-jup歘8j|HMͫTUWEGEŊǭkY&݄%^Uҋ ?n.CDM^z`F>dA~B]̦A籤DXR)\vH^$Z2@qX\OSxe3u`w,H.Nc@13Ә`i WᳳyVc~)^ϛV!3"CS02) fzaRo}͒8'-۲T 29_`i[ 8&6 gކښ:i~Oo-{mTUpc˂*w y'9>yWuLO*<^ GߑZ@sz>o K)d 2F is:e! Q%pO8"8 n'O q+n+MV ! ? {5 D;?t8{UUpS˂u)o i KQR写AO*Bb?#'~A,f}M>_ܶGI ~ LI70`R& ;?A3>G $q2r+ S7*Gf$YG` #Q( 8eX!W124y2MX9fFU)mY%F du31S=GuJ $` _ ~bD2e wcD/%[ p !!%7&ū(f aiP5?B䟈!GpS8ǙBcR& 0 BE=k;ZeOr}P; w M~:$tE*p|lPhDr;Ra#c`ۋyU),H.K!E* ,n|RA-YBO@b&RH9aI"WX1, p lNQ~I8GUEZ_by0d"CiZ8 Ah 6lˊmW6F`0s)´6AF,?_|۬J2J2߈\9R;W~$4.X2%BL PjUܧ%Օ+I fLva5=g,- Ds<KW@`+I.֝xiHeAWK:56B}f  F@%X\ir+_9!×/\t( V\;إp'x? |Y-4T#1}՘9~bb;/RS^ⷭkw,5U`@Y ~H(~"( dfw~P ;}6{(䀧erANYs}>r`+6^ fފIAaw?|K5i+-/HC=dIl@6'D*u?\PsWi}QVZ 95<G"ifaI/`DX#Y1*(gkP筟eb@Y OQ%@z\߱22}9,Z,T Ō $@KS0e&6vcpTֻ3ֲYpTT>#VU_X4ٺs~֗YJ,=H@g;!{~?k M1K?3C­Ǟs1'7#ͧ=ncFR(m%'!Otk P /f"V"Qz@>@QF ({$O*|}7HvX+ln0(NzN4W}&KM,ܷ-fb l()±j) v7UK`zi #aY݊sžmK/ȓm𑀔/xOq]ϟ ƕfib 8fIrыku7;I D f@@wH*<8$~nQȳ~%VE4P I= %&?c3S<3dw `DH$CD#ߎ)EV1p27EQSP {@n s[._2HEC?C$Dsd3" :V@Sd$hNj-OaEdEG{o7Zʔ( q AP3G$;1\~(*_BU9RR@4W*Sw. ];5xRQC0 pL 3Α:P_TiǍi) PU)97BE!s&Iv촿Lr~ŵ) 0CrXŶ 4;,]"hybZE/ JMܷ\"!@lg^@Lvm;yy=źʷ\ +*IɄc1[QF=]Xq8( JqkOgd h.V[ ( ,O D1%I@S/\s2ٌdp K0+'XL3NYӮ$¥z ߺ޼{k@c|1@1 ,#濼L4g#Aqr~3_P,"2K0{C]ʊ1ҐL͋ڶR) 82'E"OA!I.I6e?B,.A?Q#Kmx˦~B` k-ye G|bB$p1mlyＷo{ *k~f&߫HZ[cDˀR9Uߣ͉.ފ@ O|iDyn/\D."LK݊|H0=f,_o~) &..ވoCS(0E`_;3A QA4b@D#nd*K:C""i/8YZޓxb'wȃ!|ծ pvK˜I{<׌͠>v˯knj엍^^$,׈ޢ*;? B=A`B~4Odq9 +x-$wxꨏi7"Nj~e:%BWO2M:y֗ͭ |.Z[^e=FYr| r`ޓ?4$ jXDeeN@iNGNwd0Ki:ONxW@=vb'Jz ywݰ||4zIRsni!>]{E@`\[aC\cgU9葅`!9SČ1sdr`uXr1Ld|(M!$DPہK :9wL_4sk~:NJYL.XٕęVl$b#p1q I)ZVk6i`_e~0C!ޒAQwAG؞IrTS[ֶd&AGH '3N|Ӕ +'zPm&ECMcKxiٟ}"b w6I~R:߆(A8aY֤du|R`F^ c[&?uPw x4XVao>bʌނx==]xnc8*ͧ&B߼rB&k}`虘2z&"ĥ`3]  |R,HFTetZq+7|N@.s/1_znYǍ(Θt^8Jn !Q"q~aG$p^*.3wAT͇Zӿ.ހsކSKea`Ibejp#~o<  X. Qȵ RUћo䒬hLk^dkuAz:"jr"-WZ; '&/A=Fm~s޾MKc.1`?v"ΟzkFI_?Џ<}=IӾ^}(i@Q)% mjqEWa}&?M J8'7 Nkil3/=6i>5:KMFtDzh/j_b@>_R+R`)1ђ {/rOHNQ\ G]z bEʰt?v:_xUe߃+t*yE4z$mF3FD}0!R)=Or4BO LGI7aB i05)X]*:A/Ҩ\Hk"P-ƟHFϑI $0*/PEhX8,paǹϞTar V-!3W(3eVx%c58}Z?[n%+lnȺ?d~@Fc!=[-|{Lva*;/Hg AQ-9+ 袙r# 8gS;Ezaxu"lشVu5f!4/_1,q?@ɗE%J)%W kq* k#[^UG6>WR۔W}\ qډ8g⭨5J߇g_~{_EOl,G |>,s^^Te:?6YP\M/K9[݇{@6]n ^9wZ)uӋA:w߁;_7pŸ ꑕNbsJ@+kBhbs!5DcqspҘKm}; c /HcW0a9K_փB½l UyX X:XO !A 6 K.~1}G0a—㬅=䜒$wTP.i*8eD :W5ɑ.(x9Fq4lZۢc_\7L } eRs;pq!=jjy";/̒ ioAC|4PlxXs-"l~롬ms(^V^ [&e# /[{ wzi==]xr8t䀼ymG?m^lD KVl˔ %cgQBh0'4yi2)|;/꧍<5] 4<]i޿wGZ6-~/ePPH?2<P+P{ d%CHEKG'1c y&W%AyCr C2 q|DHb%D(3((dSOs(Fpָ1:1EڜaxyXqFQu3`!P e$SBھP>k~e3ނ(ycؽo=k?atC@-o)IB?$(A"|v@02y 235'ӛCJ[m8'}Ge=mJW(K,z0do !lln%"=4*3F٣/50Z)z);v{?xX ҲzYZ,{!|E Q\sӎDFg˄ }4ͯ8˕L?ĥ#v<#镇R3ٹOR[QKJH,rq d.7Dk~Y9eI%iLb֨)lۄg^x+}T}Ӣ.,XDbXg)F&*/)gERZv?Nцǟ{^ݛ16J{>K8WR(ߊ|Ò0˂Wo){Sϫzט۵<(雪A岵Ԓ&[yN#B]P.  Ki|3>o|}W7PK;a+TT8T G}H jR/X yHaYZ,h@% !YL}LXZ\5_t*E>*zS;SFKPq!b+;=xjh=_z[a4̦ހrXIT,8Pk-H~ʔ<| U"4H@:(oXYȖM!@Ɐ ^H 8xԡ3 qZ&, 1uKÜi^Zיx(O\"B@lV3 do v-5j~-Ņ&Av_P.V9B^?N,HC~k/-4A? dz| onɷ=TR CT𵰗DC#ϔEd?X39>줏^. h> `A36I& *F(4hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT14hhT1? %tEXtdate:create2010-02-20T23:26:15-07:00;\%tEXtdate:modify2010-01-11T08:57:13-07:00L2tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?tEXtSoftwarewww.inkscape.org<tEXtSourceTango Icon LibraryT:tEXtSource_URLhttp://tango.freedesktop.org/Tango_Icon_LibraryȭIENDB`armory-0.92.3/img/busy.gif0000644000000000000000000001505712414772654014065 0ustar rootrootGIF89a *  !!!"""###$$$%%%&&&'''((()))***+++,,,---...///000111222333444555666777888999:::;;;<<<===>>>???@@@AAABBBCCCDDDEEEFFFGGGHHHIIIJJJKKKLLLMMMNNNOOOPPPQQQRRRSSSTTTUUUVVVWWWXXXYYYZZZ[[[\\\]]]^^^___```aaabbbcccdddeeefffggghhhiiijjjkkklllmmmnnnooopppqqqrrrssstttuuuvvvwwwxxxyyyzzz{{{|||}}}~~~! NETSCAPE2.0!,  H *,ȭ`'[0?5A,-iƈ2U $AL1q`,S$DLOVԮ0?*7Tְx-`UtzR}Xeɒ -+A@ 4*JOTɒ7sr*6[UT#(8P;F4)#7 u'2Ċ)Û-ەY$(y^kw%0WڵM^n~֩Q_uֿH*RBRJ)h=4V;pM(KAҜ-O3((T-r A͙"@Ōb -c*b( $NN.)#)N.sč~)4) )b'%eK)t% 3J)V(7'(MAKYС)4*iH!,  HA*,`28s[$aA,XUemƈ]a$b22q&E4$( gO\D m$ cpɓm qUo *M{#%J ;YL\RУ:{دzŽ+H`@!/4w7s;ylgQnb.=), *r=;6ȅ /)t,ĒP,"P=lx A7@Ōb -c*b( $)N.)LM#)N.Q tč)]I) Lb'!eK)ϙ 3J)V(%(MAKС)4*)H!,  H'R*,5K['e]TpG 2%@k3gQHDur#BsڼzIpWRKNJ< CU*>#fq!qUoଟ}(R8[C AU?CiH',Z $G;,YR \Sn5gk[Bcf $Tugs< ^MW`*%H})l㗷Jʛg8dɂ?;}'sIb#JzŽ+aA<//4׍\Qrɑ!'2ЕHt ds-@dF%4q[-bX ,7e'AWP)( !,  H*X*,`7R6\'eA,-kumƈ2U $Af+c80Hf. *Uܕ`;TB󧱔@|JjWZo(v5^TJ@z<{K ,jZJUJrϜm 2ݭRwRr|ꖾ`*ENR6 m3dq{7/aVNtKzNݕ좹D!'5, u [GMG@XYNZq ҤnD2 e:raIAF-Ys $$g#p#g8a( 1F(2P4AP:P5+*" P1C0AH Hx@`@ D(I"jYILl.EWDK1 pbGARdBW,&` !,  H*X*,`7R6\'eA,-kumƈ2U $Af+c80Hf. *Uܕ`;TB맱@|JjWZo(v5^TJ@z<{K ,jZJUJrϜm 2ݭRwRr|ꖾ`*ENR6 m3dq{7ݱܸ+EqRf:nTWУ]T{޾0'9qY ɉRKA@~pMBXB5` 'd4C.#!!o *`rI+@q|`(D%2 }$L8 ă -H,!4lAE GЖ&0Tg0VT%ƗSr02 ^m o,B+)dApW0LLa !,  H*X*,`7R6\'eA,-kumƈ2U $Af+c80Hf. *Uܕ`;TB󧱔@|JjWZo(v5^TJ@z<{K ,jZJUJrϜm 2ݭRwRr|ꖾ`*ENR6 mS3qYݱd# f"żh!8Hla^iދZ'*>lT y01bQgIZإ 8N$,ORP"Bsb$T%T-@#̗@T3I% $) C1p!7d2QFQ(I a@1@\rI2Z T $TH"b &̦_G%C%ADYPx$(H!,  H*X*,`7R6\'eA,-kumƈ2U $Af+c80Hf. *Uܕ`;TB맱@|JjRƂo(v5^T2@z<{K ,jZJUle@gֶlV)S}% x:uK`ȹt9s,aEc缵mwvw,o•AOZΜT)/QDFz @XC 0F(?]/0%f˜?wJp%2ynhS-\C -:ǒN$tn%̨m$QڽQ8%>Y%I+O)RУ*˗׻-ի{[2税O:d 8sL2W YrrQ?ZA_CKA!#*EP,O=LGZŁ_4RI&C)C)(8LG7C(P?8+8P;,P2\2O4 t$2Jb'ض &؅%-b )I?ҒmIAߘ㡌R;armory-0.92.3/img/arrow_right_blue_24x24.png0000644000000000000000000000157612414772654017324 0ustar rootrootPNG  IHDRw=sRGB pHYs  tIME 47IDATHǵku?gv&Mشd״]KZHBFC(b Q_ EPT MRR1*ML4evskЄa7|?9w#J-ãƱd@fy:r;|={55ٕXi_&\qVT?n^jFSn4tv{ƿdsN cc[ex}?w t> OAPd7qώ)襶~9O&pnxXM3Y(b+  6P k"T2Ј1s0RQ*$+U&5|gRXkBfT~oS Ğdc$Rpzlom&,>-?=l}{طծ%MS)/" IH4HFD2j<45ɩOT:Y4{}`+uxW/m\s{oTݩZ*.b@P͜q@@ .AofY'IENDB`armory-0.92.3/img/frag4f.png0000644000000000000000000003060512414772654014267 0ustar rootrootPNG  IHDR\rfbKGD pHYs  tIME2k_Yz IDATx]iWW$"@$@%#n{鶧m˭} }(j> UP/Z"Uqc}APY}-\m"^mtЭ^W\0`@~Q~";p` {ysl:p  WW@`_=u|Hk* %?v{'g^d`~NkWo~'$##}[«'0̷ $@7N~Q B*6T?3u [*@>Jx!=ET| `[)FF+_LC w)G 9R.& }R8T6ba!CJN@C_d}ů(ca~ ow«J:\(BZ)Z8`(EN2XU aW S##,^<~ =4RHMLj[*DXe~ndYd%o'n P'^R71 GٿOo>0`Ja jPIN u zg5Q >r"I`o-#@5}ha"Cz  TsTKI *N0A> Ip{I+*Hq%I{TFF~;"GH\̠ID 7k$ x?R?IO2v.$wXH(I + xM"g`G J (IF\}hoЯVlHFF__](mU{giNpNK7δU"bOj|(U-aDq _(N[Z:kҹ`}J |D\hpM!?2w !cw͗ )G 2{*DeA Fޱmzɇ_%;* .߁+iZ+mszn_>?"?$4C.=A#p՚is/I+ ȡ n$ G_^2qu\ew%Gsuyhgm?2g+H^grsS<_ Z*,ZI~׌o*JWU[$Hz.'A -'A/4pMxFe`‚C0r{W}q'^ۮa甗/\tD˰N@f6`X*aA(<"abq^P 7_Hy{Ո#GI ^^m2,8i{5)Cd3JGI+reeEX 5'oØ •͘ uQO߂_V sY~I<{v@tC"`-f DMPk@\k7!>[H2\BOjĢq]:Ʒ2,XbnY@D奈.oފ |=xEK9=j3CB|+ ^dA3V@Q_ߴpoH׉Zw\E Eo[j_  E}#J?&eTb77ކ"HH!A? cBKV_FL_%{~ST&A^O=$ ӭ$w()E Dޑ7 ~K`W-C ,zyʕZ• HՀx|nHY}tR%h5#'/!{Oޓv| /WF|')!PE/R=!ω윐@Nҧ9 D .[%gH~I%zYdgvQH0;KC,\r0$e"Zzd 2, M &q%o5otP)"=M@: {:S_2po ?I &PR$Y0QQw e.؇t|"w׿&*@T "rZGY#(>\gLp #n\*zY%H@*U Y% (\g^Ჭi|ZQ=;TfU UGo@H9  \ '%KJ]̚UI 5铙\J8ep*tmQ?x$Y-LOgW69f%'epi?Tov2A W.$Y=H`_t `Ձ4w%?Bܚc߬Ns[_#>MnԳY(3:?øIb~__>o %p -$ c5;R3oJ} ??k}A+\g2oYV@77~8ܩ DuI&z[1Ώy_|K%`Y,Y"ԧ=z +LT$\EK)%o ͲJ}pk %00/q \rn/w".Ȓ}f'H+ki_jnW\o $ Dj(2{_T$1;oր$pX8+WjRw|yHo1?35is#7zR|$n5^>1 fMDzf Yj*_ GpuО_E\ .g7k&yg[ΝXf> "%B|N_r/>5S>@KjoÕ>ߒ%}39o X%̚$Y;Tq E/b/=ϙ8F3* ~eH7ksp#2س܆n?2I33?,6nn1Z5ר'^/Ik,  M O2NImkX̬\HbqBF)$ J'+ ff呀qQ+^&JT9ffRi?Cy4l#p}/8BfLR*B2% *CLC_˯> ?3jL?7t=ħ|>PXYuTynH/ Kxw*}Z~|D|I3ʫ1S,pv 駘ff#D.k%_XKMJZH~38Qbua V-OϿ>cۉ>ffiL^Dmpɿ1o_pjn=$^ #z_}|̬*@ v%gJH*XV C߷p-밺YL5*  /&}p 2϶iYkYKj9a@x/&#K`]k,73m04 6u稂.JIH(%e `zjkҽ;€Zt_tl̬.*@:x'P' /?+ɦ]X㏙Y@o\"@ꈺw@/Y̬${b9L_#s\'p='L՗$?ΐmAa/< C>!>Ȓff% S/,8=}9mݗY6H*`o;#"cY%3$ /\0?O俙Y€z5sbqưT `q߲ffٰP?"('WJ ̲4B]#IJ`,s&MA#ZA$nY%)A CW䟙Y2Zal矙YC;\<@NTe7GK-'z O&̲dG0T/DblsXA5D0$J_++>p5oY]aG>$] 3lmx? $_lDg73~Ew ,Ë{R303˾TxЌK29#Ǹ.hYc8>] =$̬! R|*yz@43k~ݡ؅1P|gv-hfX N?8PpbYC)!xYÑ@ `XX"5HjUm9U=  S>73k0O:} r&dKb3 ?;l^Y/Qvv̾.3%M y c0|7M"H#33煕*W'$f{\ ::<RefFw"^!|'gDੁ!TH>f_8 2Y ffk633033303330333033krVln+ hq!Bx(=$(dD9^y so{|*.x u/;A/{`'?5B{܃tR8>p-G_47.Y~ e3tMnNS{+$ټp7L>8Xga,`kqz^*8= ==pϼǽ8$ `X{|0Ȧ3%? %?lXYཝ"6OKภpX>6#zkvuǙ%SbQ='IDL:/ pd-8t{˭$GgKOv@.=R &$lYU@;+yB9!Ζ ޿. 0cfVWxS=|11oWj=P5 vol֨|}݈Y`fV_yH`=0[4ifV_k#+wvx'`ffV?*E_`;+UJAI3`ffV9(k/F> KP c:O5ql>wV 03II^<0!AB{agΙV`A@,hfV[+V a ,`fVu @!sLm­B A8ff-e=P'I Dd"._',y ƷɇB"7(v$KK( !yE\ r̪OW[U P(BX[<@/cU>'$ ,xCPr`'TINzĜNΤ="y5IL0.0̬&1$Ogp^;k ~Ŭ)̬_Ɖ5_I@Kd#&4103Io"DliODs^&\ Y`fV/pJBL?*d'3 q4g}"wz=W 9BDV 03pW7/,0KY`fV9/zT]16 嗕/:!$y a68t3ϣ֟J($ۼ š݌k*Y+[xxk·u<&sT0 T6۠YzY;M?_(r_VhYx" 25,!hҿ!&Fә7H+Ԕd_|$pvYKq>F 9b=p:?PdgKQkꗏJɄQ ff wk6='e@P(A)\*Y-,,tC0rIy#&?b(Ӌz^xr_@P8 }xxbІ8!-[s(Y#ٟB|Οo MVx@.pUEQGlA63*9IDATk|E\RvU ঎ޒ tB~mz 5􏈍7Tξ|&L_'%6 $'JBD( ]Pw)m6@fM>ҿ~y a^ȢE[d=2̚%θRʥη=%ֶ/#+.J {,*`h&HݎsGK[5("Q20xE bi wh&Ïj/Hx\P M&)C` t>/1 N ʩgۧ_/>/@ @䊔)R RP l%`]K 5`qf_u bPȜGµ7Pd_y{A eؒ6͘cbRPB?5cvr"KtL㋲Yּ#?S,3 wbiҿ*@8 @Bg$AJ3N0H_ *fwuU'+8z"9^y+A e #p?SOlgOܿɸ5'U؂kY 17 S9&YYF ,#{bjj)d>zYR$#z_f F%C. =АPn9U]?1~k_{7LFzOS $I D~LOb`5J՝ ~Hx/*xhh',9h~-3 'F2@G"'ʃo蜀CRH$Ed%f W ykϯߨV߆% DKrc)I>+ >c*\rft$w6 &? om'ibf@,|-Bv7M^PZH`VD|Vb~?x?QnI@<{3yx_F|ʐ`B3% >Gz;Te>g{@f:V58^D.1؛|#CGBC*$X$"^}sU{p'J3EEHg]Enp'CzySE c.@k_Tb"_3x_:EJ}f̿5gd$ΞB\drK8 5bl8(A>K2R򏤔\Io SJ}~Vx<F[HMh.7j gr|Iߥw3#>O{oe% lL%b4_~.~(o&if>B$goM)x_OmԹ߰@>ĠiX[p_TpdaAC}i;WYF|eGJ>Gbug$ '|J-({RD]KLM. XXxrrKMqt#N(R[AW:9!F7Ue7` ߗ2/ M^ ^gn D0WJOY$ח.\;ei @7`2}q`ʐ@r Tj`?ˈ ύH$_Z/`wr; EBN Gg-$׽5Ѻ1Da)6E$+%ԛO33\ג?-\O#7ܑuQ#|+AVM؄K>(#$(,u$D j6EC Ooe_.@+A HrPr V )-" "XPDpʇ=6`L/0#KiDb?{!UAF!B@K*1|}'x&Hݗ_ppm /. 6<\=>Ač@ApB89^*\r&fZ)_b+$$$A*w}yNR}GS/{TMiZ(DmK>C> TNbM |-?EٹOB5@iB((oVsr uA`;Dp}X_q&k_EEz:"%r3y . AĴFrK. $4ٛߧM2\_Aμ\?U@_sURz8Z,(i}D`IXpH "tR"^v"K! m~nׁy 1DBAz{R^}Oznǿ(o/]3/UJp~-9윰`j= I"\^&@@>]$d(dn$:u?3HH>.^~L<ٖ]*Y[mv/z[/E%0  *DEI]N1]K yיwͿ!+y X^OFho߭v'zOЄ.R_- VFDO_ƊAn>!M9Hb{B9^|}T# j>I/U[FArA\]_fBW8qUGb?hY].y-~}n 5G|#D0xeMjA瑃~\`>UHT(R}x(Sye@v$\M5WyUM|4U"ZGPe78H?$ =fdzV- \s|MU3T3w uF|G V-%"#=:]@rV$bϩ^:vm^%)%j9Zm`v!${u^amV Ij5ص N//!nI[b!$hriMÌ$A:tl1r8,)^(/xaD<L4l 92*H[Ѥ Ev/\Y9O,7h62(E-UN\ņjBmD (ޅ3 "U, FF BUONK>֛%$ F:}Z. МL.&"ou9湹grLx)A\BR Xs,2\d1GVem(i. $v_OHw |F'-0bIENDB`armory-0.92.3/img/preferences256.png0000644000000000000000000007773312414772654015671 0ustar rootrootPNG  IHDR\rfbKGDC pHYsIIE vpAgg܊~6IDATxw`uَNJ%J,*tS>4 `$??!@Il .](QbQD%zowg,fg, JK;ms9I4#j@yz <򸉑yq#/&F^M#yG71 =S)lqhmk3WkPԾڿ?g8)?|F \ |xp._ꛞ]#-'N1|xOcS}_ /r@k[s- 6Q44MPXXH$aTU]|n< õæsǏ͇mہo;D[lM܇֍*e$ pI[P>>4PVnV8y IP/޽=,//(iǹCGg;SgC}?v,h9q7HǏ}v[ _T`AMv}UUbqF9# Mj~j;ڿ+o{ H$Pz˲L 7p]7[ۚ+Wn`8Y|,/pi9qZNVdX^}6Qmyo:HY̐A4"Hq,<`C}jፂ'kw%Ybמ=T2<8H/_Ȃֶ2YD6lO&጗Aenw#IwDH$/l?no]6rw`qAJ榊&ǹx|;# L!˲LAAA֡A2dvv^zA. W:ZN Km[R 4ݶ EҹLNL8~Zߜ@k[_`=<ؓTW; Ɔ6x^g`"`vvN?بhnbg8Y |:xȲ̮LmAB@4/]fdhin%J^OiC:UUiBMu-%qc.cd2Z \.,S[bu2`ˑjZDˉ{'Mo{r U̵d$I 4NKϽZ_{xkC^,GOhFGg;9  `c=󕕖s[duӧ^?rWZN| z4 "cn' )rvHs$Iˍ Ο7DC:ZNym((g=mXLslom<~lY}9׈"Ai<={xCaaaA5 ٽ G>VZNc ?%`ÆV}eRjZPQUnՅϴ8n]0pX@t-q;>Ð,STT$<_,cllo}u{n-'Nzψ%InG[mh?-D~3"Ϝ!uF+pi9#,꛾< E/cr(**yCGii۶։`Ƽrdj-$biV})@A[n?LQq.ۀ[N\yhoz]u_xS=8g1bٷw@ֶ5*mrNb:>n6j"Y$IBUx^ve#w[N|N`P"yP?=GJDQQQ:|FBvSTT:a$m7ZNx-/.);o `?-TMCQwBr!j:rKyݼX47<𽧿mܗ cq>{9i7d`ˉދPU];((0^O~$k^KJvDdKX&47]Fx|t/dp2:y<ծEN7,ZNCwJ͛[xs*Weћ1fg*zh2+`Pԃ.aGGGwkЬbrǖ-¥e;V-'NzZN< WYٵ{'{Evv>IEAQWBŸrSukcO/5`P4=H {!EujR2HCT9tAm5 TPWhpE5"?@ @C}0`iZAHeQk":4VQ} ;o0X Yēɜ}1}WUo<~lYb: !K(qZax.kmk 'A '/+-λ老gN(F,\R8;3ծnCgcu?ya6xr:nkEˉE_'\n]5uLFJ$xb&Ifb4H=/8ix,=B8L$lуI8_|] ']mvSI¡[M>ƿ) RʖNUCSUTUCM-&r nܼMX*5xB/T}M8IpTVT?g=-'NzdYf]lٺ՘-5GMWsg[$P%t?BalD%>_.y `PBO啁DBl“eyXY)ou]}'PűT5[=n7Og媦"P-^Z M H$K6$ UUmenB(;IK'.#1)SsFl5N?rMjhBr@Ju!Zۚ,k6l8,N0.i@g'x6m\JiM%TEcGb9;N/Kק4dو`C쬨~s?\NW^6`ߛӈY?$I鞪WQ,T~|:>D`D_8ڼĶi63dYJ -}4ÃN.ƿxX~5j?lhmkzujf t"PPPT:+xR=nH,N8ρjN2TK~mY'M#LpǾmf@k[9 ֶvj Q8 B$i)}D˳[7is|jRO\%T FɟֶEiv>J1]ĝNzzeGe\.h)$k"iZ/~e5S PA3JRՀ1&'&E x_cÖkNhmk>3 z|qmCX,dC;Ae\njhS?IY~[eMNSU`Ίq 55 F"  {,.֔hmk~o1ӭmg\[X-VǞ!Aovb{nH 2n> iiB>bQv5lֶ7f2[ۚ ~(@ɒ]<lR`X"r HR#CEˋ_\Z!N%2?$v::=|!(8&|P/70߹3ͤ[Lzӄb*JN ӣLqќBc }KUm͏_l$I}ؾ>0p:ֶEV]I*K헱P(y U#a - 3VvMSMuvW{H :ov[ڰ򉷳mzy̏DcہSm͏47"5a1Eɔ;&H N{,"0XX纹=>YTk   DWn' Ȥc;xn7wq1ϵ5` |3.'!P57 ^0'A*)~:U`EpInknғLLLL~![3Yւc~뢖{y~pЅamͥfw0 x6ijdaڜP Z:[s3yX$(04?vyahyMuwoqʢxamgЃP[Sˏ())f.ĸ6n(h:9X$ lR Fϋd44 EU!|>V ";FVG[nqʢS|7eaXq!l{LUU=riS7Jeqhcr}LVUGb[22ǭ0VMM055#ǸM$2EQ2>wG_omk^m͇ɿ]Tg^q]|>|?׹,1u'ZN܊D3s4$/I JR b}lX_a,;'tJ7q@d2I4%I&|󏌎TS Me1h9q6+eMvj7^pI .[ c}qgfE7s25%uardm, 葀IIq1a4< Y6͙ !ɲ^&IȲiNIZ0:,c":/UeZ}X@$,[7\*ggg B޷[[ۚꛖp$Ïm6G_p8: \˽^o&&'gTmh9q&pJˊ.i ӄ#jʲR|^OjYBp>~uZkǏv͇"29{=[(BUUaR}qo31! T)R{M꛲Jֶf on7o{ ֭['$i6MbeSS#,ėsBu"wZ#u۶/֦Jk[dC}Sòr ]:Yػ s],STW6{@ 211(JR ^[(ȅnEk[Wǃ̹ n78(DCC!BfffNZE:p=xPߴbiDh9qRk$I]ZSllQ}·€iHh)zD`l`-h/}=}>-0D7*xh,B$% g 2;;KpvD2q}{{W'Fss#ǀU\.;H3_4/!.;Vgf!F@J Řxɯx=֎xZf 6FӴXdY)+c8$EcQDM793IyvpȲlnnVgϽ!(aújvڪge.hq:{I&TWRUrbnTQT]B?&>>뚁RY)rf!a7L|WR_o$x<.@,/Z$x3ֶx-'N]TJCϸD2IGNJUW' _*Zl<~e#!@k[s`sHy[eߞ} "XwnUU!f@ @aaG@4gv еo9qʹ.$Y^"rGx\'muƼ1;nQD0:Yuc- ?pI(ANX߸  ;)((V05S89nXp'++ʸ@&'I.utƨ`ڹ<6N-{xw\Xsg-?po~-B^,[G0::s g@e6n܈]S-hQr^Fr[,/+ ɯ( ڻGTWUyCڟ4U0.ux7o`9L4ϟp5^\sllɜi:DBx\ݶ{}͓58y?/).vϭHʕlٸs$pD͓?;֤HOok3 IzKJ՞~"H Z$v딷}8r8d}.*,q9J{gPrnD9=oǞZwyxA#?SГ~aDݽk hĘQN&8iY`HDIl-1' B@q3<<$jӧG@8n9q;XyLk$QJg3A*ٶe#vk#1]$y&уr|qkR0w ¡APTryXyʲ㡮 6e֭['  {|y,2tq\o-l9qr:+uo?G*SӳTVQuSLH$ιg~qI@3ZۚoAdCGǩ(+e׎zF_SF8󗙙 tmwr5 #r ;Ȇd䞲,}vG799c<6l Xh^|$'5w(H|}8@iЪF)/+am{:#g]fzƖE~ZXsf2yQūWr:rXαy=q ]087TTTPUU%(  W- ?=w=,BGFsUEw\qx#]۷Z>?ygu5{нɞ՗wLTkBh݇V&I:;; @KJJXn5&&&lڃCNC{Y._Ih ,sT+ 7@iI1{vnC2?w)S4?kyF7;+iWeYǏg^0yZa`tt4}-3JKKu<8SSSj~z\.:bgw$\$q}T0u"?ƹ+O |Yq ֶbۜ۶G~Ҳ{BI?2:‹/yWڢ ǖRSSxMC'-0H$| `d̮YHmF'&JqQ!{wme24%Oz3m. ='I#}ɮi qDwַ<PU^[0v^;66f754oIE _.Wp%Ё]l\/DSS\JaA}3i Ξogt\8l|%̀VH-8sڧ={xs?AQxWn|-B!`(B__XL؛QUe1 |3,_|{tSط#o ڻ%  qc^ևum_DOo[oxNC k?7SҽY0H7W^^NeeFGG 3gՍ}>6!_ֳw ϹwWS ; ۽KD$/u0<"Gx.sqCֶ @" ڌ7oa}lٲҲ%33~Wsd{e"M kxOmmmzy.]k׎;%͆B\܉c]1MӈǓmǏ%y@ydZۚ>ܚ1ر 7P^VNQQ1YMxFݙ'*##ËN/fw+3’H&e\L把 522Bؒ:8SSS$I|{/pbu[7g6 E"ԁax'\Ш'sp HO@b!2%"ɲN*A"@w':g7?.y\`y?4 }ϻmuǛ@,cxx8C0-ȳpR'zEyKK 63& W:߽%BAAڻ!5=)Ptx=G _qjrdi^7m7/r2| 3;z_;_SM,6ȏLAj*[+FJ]#I??Ŧ✝F4&`~fM Ig^BUBAϽwrG7P{vp վ!t k132_ahHhJsn沱^z>8@@>L w [j!O?̕peM^W'Z ]8dcɐk M/@5pB!cKQqs)-ݽLM;`"o;36lbmK 2"/47=d[ZH$>ؘp!Mh_>'\v9?8o`vm;Y'%7m÷yN+py,:AC}w@"糟4BAFpұ)H&wd<CÌMov ?8¥n۱[7=h 9mkr Ir  M~ =mbʲL/>}Q&]dYS^*^0482N~@CDFnZzo|Νۨ?VKPO{$f :#Yi"Iߺ1|8۽B rr-ǎr鯚ST=rˡ[3YoWoT#mq*~.ފBN6cC|Bnu/œctov 2NoҺ |~  F3TU即_cbBO>FB^QmEx =h&t&(^ ۫5%%O3_S uN|c: $' qA@ \.[SW*$gS@C}S>!/ꎶT>οb!I\EPRRr$;ز),]Wٓ\iVཷ~I())wD^3g~$^P/+hnX@і:`%ǀk<n=)FL0ȕC㜿$&=ؒ$Q\\,@,^捳g.O67}aYMXEm)BOn+OgÞ ~_l#E \nf׎ g#5<{ 쫣 ҒBH4«sgDѕc꛾v3!/V uG[=a{@֍ݵMo8R{;;?8.vȿq} xnx<#HUB!^}eΞ;K,f`GRޒy,yHhb^qQU^LmM%^|*%Muuh4xCl۲{&rJ;mD2,;ycd,CFbTVk/s¹D()L67]w"/VuG[$$Nx=.Wkfj<4MC4 4}Ui +ł-ǹp[79dtm߰Fq&! J$D /]c47uc+-nlbﮭTUU I:."/E~7Ѹd0F(H_Z:gpDC߅4)O$xm7 ] Jx1$I,FyGpECQXz]#/VuG[>$v`6y^~cevɤk3l8)UXEQk&dW:ٲi=pDѱ ΞoG'U,STTdS].p8044ȏ^W.قЇ z3xGіg-yݱ{O(\.,2& <OƪEc/**Hęxӧ>} !/uG[n dL{|M!sq箪A4TUCQ4FRQPTydIhUl$8 ]. ܺ|>Ib]MHD(!$Sq6qH&p"!`&Ad2).,D(I?fz:q/ӧ|VuX/^>Vs$Il]_΁;mj?L8xP,Cf!?@28P H*CI.l7Oh,g_]M%~-x=yDk2כB!E8&H&ؽswaFaןNuG[~ho)TWW?>e*C47[k_`x2¥ީtP$Aσ$Ktrӳ6ZzGfB,=M%y-|^dY M X= 3fsy8L&m@EQ++*QUh4j39<troXbm"u߽m6?1fBq/ϟb*K$(}: JPS]A$eF L1x\[]{>;˲AZǓu8jNB@4P6'(m$ITVV( HPضx-ϟ>5yęOnbhK = #Fٳggg̳8 ?EUR$m\$g:2h*HBgZ)! 2(3A )L)*w>g_MX*9 iN6! 2$p8$Zԙ#?pqߗ'h ;~s$ITSRRA20"6UwMӐ%B/hHL19o>X_U;5 P;={T^{ｏn9,{' |Miɍ?'b1Gg!es42U@EQxu.\:*Ѹ dC}V}YK[Kػg22ɉ ȂȯiJ, @*i,6J~ Qÿix*o\.&@aaa:c;F3ac뱪mݻRd_|j4kyp;Yk+ص}d_4gbDɜo˕"DBotDRM߇N{ { :TUsY} oKDaaan&r<'[(2ZM(B,{{מ)|`ߟF^\ꎶ!Po-*+ns-u۷?3 YI5usH)ozEQ8}.'&PPP17B@"-ځ%ۧ УVk[sjGX$ꎶguٻט5M#O21]QT8s(/dS?˥KdU껓4! QZR=ؽk^zﴶ5_i@іG5۷ K BQ`8Nܘ`> U|sz2Bz<!qx<.  $Lf / TTT{v-2GnGWZQwУd0(ej߅ RQTE?a_ =oB ?%#  DgO}vax^DU&` pX5<5ܹ]v̑5r!/-o>%_a^'2<&TL~ ~ e"ɯ kUǀ-^<gOW84 cؼB|th5OXnvsnQ{/5 72 Gmyٱw2ȯj*Ób_B_x - %$.)(ÀmEy٧w"?RNED1o 0DRpB21M[ۺ;vlmk^kyR} ddylTŁ -+ "%RvK}dxdEIL~M[NJ,Ni]\VF"yiz{ =,7;6Wr`. 2ȯiS±S=o\LW fzN.3=Np%J~My=Α$Tc;@C} Npg}>a|>&` 9H$Dǫj[F,.^-[Rm׫֭ ꎶ4N~7VwJJ2ɏLP4e|TsQuQ5` M8WIB]ĝ$&JґQV쳑?WSo|]Xw < $!D,=19hF4ܱ͛u6ֶo_UA^PwE;W[ |lTɾ};)//b&l81/Y'{/(J afFQUIv2̢%^<.W5$'6C@nvvg}A,ˎQ%"MX ("TU.G"f!Ivf-lڴY[>.'T(~ZWZgJEYYSuREEץ"TO 0;ާ 9M|7.HmkL/QQ췑_4zzD0|STPԅ OL̩32*In 0h坆VB ۄ,ڹammk[Ϯ˸ ꎶϢ3P^nS%즸آk3Q&g%S~IMDh\o E՘%49&$u_'$\n]Hrz4 |(:$Fń9Łvt!0lSO3:f$2znkN@+ M 0DC3ѨMqڽ[Q[Skm_Zۚ߹#/R;R<> B6Uq 6D9^cn |n±${'QTn#C$I\mY@ X 3G~UQ5ګu`Z711allT8 5"*p&/va۶TU'ϴ5e9@^uG[/tj+T{v~M&|nBz&H**SCDfS䗐d9#S To id ũBsQb7ܖC䀆ss[P1?}qqfM;& B!|>vnR~+mwܛ@і#%lTx~NnYsͩWW>p]㨊PT} s7&:3! %c%4j0#g47u#Ü> >ȲL HAbsFd!'!`znyM عc;z7Zۚ/;@і_@OܑIl-eۦ؍ _We>ÖSہOiQCUT;o""<ȩm$]uc%".5َ殧, M;CLNM NBf hi-(B!۹^wR\d[)Yxh2+2$X*_ ulXˮmKz[{ 7[;Jmx2%uzGod]?=E48vMd]G'rjH +X_]DσpB'Ӣfw=ոzm[lax6o½w2qzc=:d"A`|-˕\|IixIhF^p -}ɲuܾ-[7W_;4XwIo$nK=2}S\:"7 s`0ȒĆbaϯiCOY9bnk[0<[n㞻ĦZL& ,dVlvSXh_ 86>JWW'\E>iZmpS -Z\.m9o'55FN4Ipƒ^.SoNInٮ1Miz~LѶƄN~A.w x*𮮧TVk;(.'%M&,^t>̈́cDB@ sK/ Gy\>ו*ׅ+< w_exB9;v>eϴmrA \d^95?v-3\z {t8(BEE-LGC4`5==JKKI$x=^&''׻ӧNp ꎶ@leʹ.jj2\`,s|pf=YǥrJwWR3{7Sw܄AUEBDΎnGϬhmki?޽9tD3NG[@ ϗ%L4::HQC}m%Z %ꎶ< {fOc }l{ng=1Ǔ|t!}=xaGd_29.BB@xWqj~U5{@'!rsk0"!d+ elC}'Wu/ꎶl> iAJK,s09{δ6y|R?_klliȌ"$ɌIEI())B!{bt̶b }ns3Pwl>;oݣ'`$+nRZ7k GMyROg'_oLIuXS,c&g"&?TVֶ |Z^(C!L쬍VL*!`@:خ5nC47"+ּ;rOdycM:DxB%IRc|yΜ$/=ב^ΫizT+h:G33Bh/t8MEt=M359`,,,[ر}eN>ل g!0==EoU:;;v]#0֬;ڲ\|VlP[#.I{~m2Y *K iұＰ䣛$\{o"& B]O5>nhmknZ^TT^.ffflcR9 kDB`rB`br~ۯ0;kxxZXF@j@=fx.cls_U5)i/=7}=2vZ|}VJJJ8 u&D9<"!rV#nehxW. ٞ)eܕš _D[%7q("IhB[}fũǝ;}\}UI2D<&:sd79U~YrA*φ" ^D/v0:!ԝTWW.ZۚR,+-clZg#LOO<$"Xq2xB`xxa.]D$b}xC}Ӫ}vmy?3PS]ɛ:̬j -U:{5/ m2pGeec6M@QPU5C<'PdSzأ26>ƅ D~WYePwEh1#sm{ٳscjb G򫪊$KM=~k>;{ϯj\+#1;GxzD~|v~O-AAƪb3*= iK57]Y6^!@і^÷:<9)D~EQ{]ys3ffuk׼'E`9ǃ6F7K#͍5MwY_i'j  7D Mjj sh*Y l޴EodY4Cd2X\bȲLe6mLRI23;hfDڈGWWE;r=,@uqnLsIE%K\s6}[ iV-c-s$y± Shh$|dxf% MpdԖvB{?of5֭_;vif <F\z~s$@ `3 q;9{hR MZɶ]qPw}ZWPCM} e%꩹^>,mvL~#^7x/DE?1wEM?- ad_\[㶑fr{vzV5{ mܸwqæ>0 # "$I6_`ݺuՌeee6b( .N0{ꛄq#oT4eӗǗޞgW`+I9@~UUp #eaEa}UP+NJ~T"H[GWw'}6t/sd26Fciۙ..RYñجETWװeV)jd^N-MO<|UvtU%]2%n^9E|y.LrS>>Str1?^ˣ_4ܪ>He8"My!~X^}@`ِry71W`8g Ζo`xxެ h===(̌=BSMu-UUն%dHo> lXL$dI$ȯgD5.[O0E]O &#dS˅dsP߮TnOYFd"IwwcbsOV(ի=  4+J9/4M# {`vv b`0C\.*+"|ds5{/IcStBR=%|mwpj^_9͉p,HXx@&Mv~3N>i9Ԕȯ*} x:PF 8m颷*ÃB!PRR;i9ޙqAiiUUբ_[\13` A>u(,ȌiH*.>'o.s;=4?>_>NDd"Hf|Y{u>κuNBD֔hT;KH 8 5n"_#S7~~#ݶv멹-|>%*Lw*I#ik7/\}n+O ?=N)u= > M3i_5kFgg} ێmo{O]]oM5MK5E65׮Da-zݔfNiD 1/SOI/0ӯqœYɯi3=$caHi2H.לcOƪ9o?]aX]Z r']O5hk%/MCUU;?Ȩ]@(CP]]hX,e>Az4hU~;#kz/=}{2}^ 5916G,O N/Y|2\{N>r QUZ㶑?OpU'sg=:L47MO*W`ttF E+++ETg(dz+v*J 0? *:{4Ο*/Hz}ELlO&I?}?CϘM)w;M‍q0K/v Mc@F=EQ~Gm$7Lx"hsD&GQJ/.> 4I";oJ-Xm!kc|癘n9_4fGS!L;ٻ0M\/2E6#I\cxL8?F+Gf҇[ <2$W/#ɺfEyf/]\\ `IC^OOrP8tvvʌ0c"pll mA mWUg0O hk #?" VXқZ#^~ԔvY|S$&ǧt#|,k"Ȣz8WÑ`0('Hpe/...e$4Mdff>c<* |DKGKl!RјmU$A8sp;vUBs{@o4g#B%G'caBC)),g:&͑Gq+t *?:\C-%ia}VI'9l;g G˟Ɣ'2s%gWRRj|aa!ktww344ĺup\  ӲW٠0ˊe IZ1قyyskB_17cLMG/^\4QUfFu{YO/qy!2v(J~Uho&*/I`|dI\oͫ 豭öSYZh~LӴ.9q%GG쥴4c{ [4GPTT+k&&_V,Kf?CLF_3Ƚ kHzlo8d|אXWU⥄ø_ dtZFriaPXwGmd'w;}D,oo{4-#UO4M !gm&AWC{8 ëWF0;sv}Ӫ>$N>>>Ҁ Eո#tQgȽw :_2 Kn|$r2 pQ GSӴyp8D{FFm M`(\~=F*..fƍi@:ǸpxUU%g0~,AM\x*l=wx5Mc}4D?J2Ltsg,>mc.CLNdž~ZN:.#ςƋZHC(>v{5\T0d,TVVfꖖqF())z).. 6PYY|>3' twu ~CNXau IHϦ[2T%|1J2*i)uЛJ_:Ơ墰B_ʚ)7,V}vv/=WmUL7>7o`,'}IdxzH9nЯ\kFhrhΛ{JB"p:MP| 8sv^gZT\O˜=h׏}gߧiZj6==MWgc#™k5MSSSCyy96:bjkkD,兗2 ip6kAF|ZA:&E; }+ ĕ y˝iƓ Pե$sf;'Oe@rKLR.) ?D{{55yw*`&ۻ[r)3_["o2}ۏyn݆__k[ݶOImuTWP(zEQ2{p}cjWg/h1Ay ˅KGp$ /='$?>+]Ec+W \a#fJd^s #RZR&AE4k >O6g$@ğ $epn4ehdd*ˆˬ*sO}-DKE Z'-+/ڷceO"ͥWU >n_Hz1MӘ =w1%y0PKsۧ-e{EMj/[].A9kC yc5>gNHMr\DbIIuOBDC<-qMd UũbtO#&B"Dٞ5xd+[w>CyWعBYY$IʰaFGG`jj܃ּDH48gϞ7YF4zO>D] g=V ~?~> { %E<\rI*!b _4(wN7"+D=oE?WJ<YnrYaDηeٶRgwe,0s HX‹=?T.-0*,)8  s^];G Ÿ́%~>_O|uO%Y'Cm+{wZ[jbrF']EI>3,ICqȯ*M~Yq(L%7 c{j2zvmCS!w g15 _9-tBq9d"Ϸw~f-3^r٣MӦCп~ =V: ,'P?npۡغ>M~3ñ!45 5 %'2=BgZէ{f'?H,A~489&m|_m̞~LFݩ7 I,ɲ$K495{c^sSpUwIvC8(IMw4)3N04 S$aǍ䚟[j 83LMYWiĹL W6j*xxjd{10ͷ~\;Ak~e)zإ6Tf-Jg-)#Vb_^lg{Bn=ZJ\z{Q|Z@.Ba!{ΥYsq Sݢx;Pk({.L2<>EMU9b4 KGIKFQ4G˲LYEyV<`2:vof:O.W"gBp-9z,9K˲b{{o_@Ux[.uKY̻-2~, 1o(}>nu'Ņ 0 EHj= rvH)!a}% Mc%#O=o!/ri \öd9zeu[=y!kقc-BiXkE(=[;& ^E~"7x\.FQۅNHh/11e&cWOd4&B;XJ 8 4Nu%R{g<߻߽cTcgzk's1_$M5WvK$Is:ʊBu $!5Maf|>ڏf{^4,DV-![BqڞxVgu*SY6̧,#a$~8_Ї <\B?ײa&I55lTCQo1׀X8@_?#cS4mZx"De!D s!BT~rPṘsNv+o|~(lOK$ *{iG Tuj:ϋ|Q_s-i_Re}w*[Rȵl϶cxp x X@y.e8mo~[C,STy=.$hh4N4%&h:W|1jBb\Bb&X>ٶsG\oV[d.cM?wozH{뼿r&?8^%rr'ܽR~ +rgQ6RoNKIvd+v?~S\[Z_0(g %Od1b ײ\zt:rS\뫹gSPHΡ MU_48*s z`S\|e}ZRlok,A>k,[u Ow-^)xH];&NFk/|;>3h-dh~= ֺŔ}I}6_0#v|9RHtr4axaXr(/}Dv6KV]5HIkj: hJrPUj2|㹩R,![BE!EKͶTҽ\Qقދ$|3Z@`w&ۋ/R4e6,s m!v.߅[aBgZmnż c照 mg+n!e8- XԿV`Ɇ k u(_H{үhOX,Hd80&r;_].ߝrŵL"/X6~-bn'J\H8w(w>_3a|s76,>o-S|cX PnBAw1 -[(r%ֲh <tBt|A{JE|96<  }&o,^3,^[-`/jn`/We#,^#h&A@@3.`Q.XO4@fbF¹Bqa! t`7Ӝuݫewi@; OewA@4yE `V+~~z!6{ X+ʋF_;Dx7p)~p._#3w. !4 #-i9 ~8F :_@R"ܬ/ǎq|#T;R qq|+X@o[ ]{$dz)> 5O`:>B9r'ȁ3> @JR XgA2 u@G)@W9@g `5(?`ZЂwD,##AeH 4hVm_0!YrFP@apA |OیMAD_Oė&  y0Vga//?CZE`TȗuaaY{! fAeF 0\jBdE@p $z e _h2bP m*.sDS @:\(OqDO L-Bc@ [-*-Y§mK A뒂 ] K~t-ܤL Dx\Tʟ1#rNEԈ ?nOI~y2ˣ:+ "{2o7`Y4X@U%MB2gP屘SuXE %?{_?:MM h2 D-r@T ȟm\s[~iZ.?F}3_7#ݗ}3 "PvCOʍ)P!u%SN@.?{qcvﶗ.BpP&w!oC_F ~!3(j%_tUcU)%Ȭ!c~x-` ߣ!w=.LY- ? ѩ[x998v:>wӉ1ΝeK>֍3\IApc w ?S?}4s`L&s@j?QhgdF X5P9,QB3-`iq @>^oěA+5=| {=,?Đӟ{C$h3F`42c0dD`Uc l*;ȭP0M1m E!.\qzz:~ҽd|o6vX[W~卾d\vÃ)DXg6a lRi,"O$?'ȤRhcS.4O>oKܛ2m~׶llBxï|F_>'gğ:i29(O n1Y"\ p @c:/~i̟HGq%H~NoĽ1>3w:_Eܷu:l??>Zb9{bˆgg  LRh# (U,6OMP`I!Gj`.CQ0 }ccy#ۧ O~i_9~G|~ D@%0[oTtJNA%J]J5 cJ˲߱6B9||AJIk 0 $1}ϟƘ0.flj O_u:kx뭷414__~WW?pAKgJ` dtJ FHm2 2:edA/9KH~ّH2vF7%5|.//GĹ&+c_.x)^|~h['z6CZM V;NAyÐӾ$XFu4U3CF~xCec{d?3%ƫIwX,x?_ɓ'xYc_ "N;UJ)3 4M`;t۴J$xrJ`trQ#1Mh2AFF9fه>}*㎔!DI3w܋ _Pc s .̀dvh[: Na_ӏOpvv_q*X IQ "KFO 7$RN\P"͕Aw?$#Q > Hm9ɘm.z?^MXh&L`u}&L`ųֱϟ?0 o>H;Wh(1O+B^F<v(a$l`GAy4xF?;!#59BT HwaRJvsJm{396]&x=z7xR̿+_2R/}/ (!UmgA~74k.,yM3,Ǡ&QMn߁fce\Lbf4Mm$Zߔ "\]]EGcPТMC(hE08Q\ 䧠W( L6쥿 x%vW_zKj LO_FID`FӴ899EihmӣGжFL@^/?vӰs ,Ӷ-a?q`MdĞ0 +m`<5^x'Oo>5 <хh/ CHTD(/I*TJߴQwx1 & B9j`US4Ct>Vp\bвI/ *WW~gIF q/f^x1KH:_wN]t{cUcS/x7J/nNUf@Y NJZL]5N9B I\{dN1-ۣϸ};ݚf [,J*1mkaGI<7? \&6)h\7,# B .$8fGr KR)Ț,> PÜ9-Mr 0~r`0&deRuĢ3bJCVӐ]4cIQDחιuĶj>SZ}HR2aཙ6X,ˠ \]]˗k vj|!UX}as9ΊYrد."m&Vk4vmѶVk ֠m4P[ uAA۲=asxcǛ6 (XkeS(ց{7a HN\O)c2}RAb?r![/DLoÈ qh/˄OIuXlm%ـ0~ cu3Bݥ&P^sͳֱWWWov) `$ 8̘@a̕Nma dɍ(r;E`+:0 *`y>``?CiK9~3DY7z0>m[uյz.>˶1I 5 v¿s=?Rڗ:р1Z j_:&RU߷aƘ0&65\bZ`e#ᆅ[1Dnϸ9ň3t f17>+h"řE8&`̺2%܏0c pH$b`(9J!20Srvnxl@^[?@~S_w|> fc(Q&%cVR+5\]Q$~(춻RрH95Bo?`"h$O%091@k5Ԡsg['fL N wžtҞV}0IV Q|+KH^85XΙMkGD`03ڶ By|SBu+WB,[M@؛6sk$Vcp ď—N{LH:"8? <%NA-q?L}y\_S˔CF"bwHn+SiAv H&Mxao:ḿ}̜GѣG0Ƅ՚s5Fm/vhc&[cƝ#ݺi|S"DX8%rD @! i›4m0k[,F6!IjX^rgޔǘ(3-;a01_7=M7flc 63 y睠-@h Pmnk@4@ܢzw|"@I:c" $m@V zzTV7Z˔ zNkZk ^pF,$~a "Л$}0MogϞٳgx뭷c?cxhί!{EJ)(RPmREn;<1} TL! ?@q̂A3fKa Gs!e b-a7eBH+9sRJD' LuLmYOӧho&|MfֶWrn 2ouڲv5H]8,!yA2q, 88=CH ̘#a$v]k:3gZ_ucپتmYANN{h4MhhTh&@T<׎}m;rim xF!s|=[m6}^轧_$9t&r%B:P6%21\sc˄9$m&==u_74xG?|fpN?󎽮?09&3GwZ= "c#!:]X- e'ABP`jT6m.[K9 M%3b3 r.&p$ ـ-S,M@z|c|džFM@0<5lp%!m ;;F=c`!C6 XEokYnCuu$:;I!` B.jYi0.ǫ9qKH䨓kLy|/6 e0eHAKQKcuÀ:oؘ֭tyq, qDZ0<.r|~-y@(~?5;?*7/{OTݣK4ΏZ‹_*צ@ěu@7!u}`y~G<=$=dCʵ sFZ۟cЛ>q(w6!=x b206+E;۷\(#~"tMVpc4cPx7F/MX,ynbo+!ḿd|WZ&Oˬ9JTҞñ' o*h Zg^#H&s!5Ci0>TX:DkwğI"OvRE"m; hl+Ud`Sc N52h[mM 4pm m{L5@;Qףrk[l k.'N+ $A<[{g3#('~I4ʦE@lqgzBY$ E"^Epأ SI=&7Թ@)6v_ǔFu*r54A( O2"cH&M"O%F }' !d22'k\z{a@^9o[@z%KKIT1?s&aWz#Rip3w {4ʩ16,&oL@m(_2wc9xAL/u>Ԕ=9Du@lVXt+{< Fأ P5zcXi>sd OQɯ#2U1F2ѫ:&,vf% >]\݁ό`{f_Sb+qckN7`:xs :u6M7=g"$x o> XSR؄5nM V>yOc=ltv3ݶO~3%y1,{Ѥ K&;5 g}zO&ބo#57uǶ7bQ.Mn[ Au:65va֘>Dz"y1fr%ˀ$!>"Nve$ko+!>_{%p|V?&vj$݃J;q6ER]NƱ{ x, v7!|К[}->Wq0{ᘽQoT8\HԹ6ǟ=c !U5H%P}g l b@]1~8-i@o6GyB‘}\“mMkl<6ޣ MyO>%)@1+O]+F 0b !>@Gy[!GC\,څ+5fłdbX0K<6 ={ @ZUJ0R_&7ߎsFp>9x&[Iol+}nA0hD/ |%^$rIA7.y6!A 8 rzsA`cSZx3?)V375٬+Me^a˾+/plAcQ&k\k:A ditʠ# qM8Y 1Z(m+YY¸z{v6?[ Q$|,sU ,]8ǟK_l\O %?4aP ͎AEl`Kc@ΆAؠ50NSXCKlx筏>h^8zn0Ɩ=z$`}_Ḧܹ́'.l]5SKgtZY*D$VJ˗N>Orc̞ L4`Zn[$/Xk/x040y, H#yv~Ls_9^v$an@`b~@F5K+k=vNKqSzq (OVL@AFLxRh *[>\x($ .jO+:pmĨ@j (LhgڟaQeiǘ𳅷 SvNL&rLLyAsk/ ~xx㫏OT˲胖h_% ?zwK{̝"~\F_, @> <ߛ'hC@V]J07sۛAݓyw A`>reJڹu**Rb3 P3ePԉ D NBn+%BaBK<vyuא1$D"!ف^(uI$ p, ]>jaKa:?Afm1R?I>:^WYkr44Ye_A"cpm3n t䂰NU ҋ!v ؝ bpR`K߃cA^  x3^&0Ԁd${MF6 Y''] é-`0 PXkK42Fy9Y-Z IVKd~FvR56羛}#P4[NRKffOt՘lb19+O w>62܁), 2w ݷ(0hEZfN4\{fi\n5&+pa,lW8x㖜xgBܧ^39qWbn\:g$a?]Bbn :(0@6G4؃D >&9fsXH$aP|27FK; M`6Ad@~܀Ip2 W]m|h KYo(vUZ8Upi4ú!c"K̶1A&m6 ?PʧsP<93rfrt>87` /f7Wl=;ckkCHp6JNf1bOj?uy۱V(@mz1>m;7`l Q֭e6 6 էbM@<6Lf"Qtׇ#B$́,cC( @m j .,8<movY8e^_4+O}(M|I`k_X (R\'ݢw>oZZ?[k1 Mb `dI&MT_/8c6MX¸ilQQlt,m[l_bn >U,P-a=n5[LH5Eh1_M6?ykaW&\=Ly @h4 BHT=lzC)!hb P/&ը@݀AN{7 ո16 {`K=Ng ghyKCN{"'?ğ14 ˜Q9JmT/MH"ڮAQz&o1XG`R} `5 н `[0+0EIXi%~c}J #z}m%+Kju>H&`T~"!Džm_&7HN<}WX"x3bo ~s Ft_8_-e |0Vo]3R&$&k5*oH. iɯX} b֒2n[;In`ؖ钋R l "T &Gh6hI> L/(3 oL3/lmmv]"7-&7qظ c%4c:$kc&@ꨍa Cr+\\\lLw>:+ p=x5^ ?6zoRޭo+ oMةÜI^]OFۆ!`9I#M  eCnK&sF\8O`0 .*2TA2-a02G 2WsDa0 'dFi Q\W `cիh}?â|z]up ܫ1G3@ g;(8 ž^5JC"(6PԃM&k c&ݒ@iN7 ؘĩ{ U=ʯ97r (jha 5&r yjc^$@^Ko >I=b=!mO,$?Na&5 &6PPJ.9OsiAg {U5a;j9ЊhGtu-W.t T \&f.czpH䟷j7;u4$6ls Ð9'h h۫bg!qGn W셃mxOG84pNy'--CrRm4܁ٚ >5#;Mc ڶ[ױwi>uS!FHIyQ!5/5Ǝ>D›݃m`2h8Fndvv4_iϸTh&0,ɁF75I$Za|uj]{r {>m3|$M؁l ggg!8۶CMt-0 .;+ nCqoȩh7!W Z'L}AH|(+k{ߐrՇ&0E A9}`uUF ~iU4 k%Fa7\dȗNoqZ[ߠlL?u-F- 9-~yX,0+2Z>cIan5@D9#|x 0B*dTwhϊDㄞ@^qnT3r?ZW?@Jډs@(Om*jn<^MA$3t0O@/U"!u L L:Sf⥿KBR$W).ɮ5T h> [m(oWsm5mUmOޟ *^M9C;g:'[5[ =Mgx ߯Y4ipf@+/ @NL0s@m"Gk /ؼlI`6ܠ-4 :hӀhf?b}0Z'?!v$)j)*P Y/+)ż-{SgBho}Ml@5m[x-% )Wj~z3H_vEA#^g>iaL[kڂsP`X}߾xJa@"iX+顚;ßxkg%0+|SJh h0P _$x/A$| 0J|JޟC}*B?`0~-^B"m@}bתjfG,0Ok1\Ӏgm3.Z OM) /[q~&B#2b4nDJh xOOD!P4D#&iN/bPin\f` E#ҥ[ov(g@tisa{`L~eD/9 e?Fr(`6J~|d_D_|Ͽދ@)d ZPJYM}ނ/Oa! 1ԧ(geCO$zVoPB>'@%9?JIAM8JAjW7`rgnBux?s軮 cUxppr<*$:gRO678D?x=yVSYߚl0a܃9}0`V"!h1(C ?LMBc0-C'n0hBn|rFy_s}CHzEN@ &u\hF&1-9Xaw9 CЫM@)?3` hS(U(1am[7GH? J@;"I?9c v3{RMKkMLA ધ)艬@m(uó3B+> `R*sIbFW L{횒7j8d)Hzھ'܄9~L<$>L,ʴ) u௖t Jƌ@IH6l3/D]³f#{Nu@BP(Z1@5 mڐ+PO$'Qa?l@6B⟤ a@t4`훉fkK[ ,H~择 `zrf@Ac `j\ہ:@$z6*rξ!vۍ_g oB(0/r,Ǝ(aY.q㘁9a9ZY0 ^-c}~HW^kmc0dBʾ~ WpTnH6񧑙dl?i2HCBPH~N@t}A+hk`[='{&Ul0s puuc|vBW;KϥH:YA 9TL+iSN7UpoPyUH@ B3cb'ܫ0F0Ȯ ~_H:uhSf(M'dO}:x_{{_8 A)C"䭹cR z a> 1Ro?th;=p`g/yYm~M_DKFA7 lc`I$`QX,P _e@doÆDs\΋ F;5JF۶{=%)4GrB1%Xe \ ~6`Io3e';H Z@)}=',]>@!tm5]^M2l6C/]ypLXP65 pf`4$?v^& Z(~v_ef j F!jdp"?]0'/j//,^ع 0Ƹ IE`j^Ex73dLh{LIZTțǧOfmJ5V K mM#̣t` n&ρ uED*66W]3~U r st]>x1fκ^`9+໼'&@yrg?e 9mÌ AD6aP ބl" Hi€Zf0M[>:Z9ab dmLqOiO10j#2XiGרP;V% p6ar|Kj k@E f`ÿ]S|{bv cW9 A͘I`Xap[mF1Ӏk(0Ƌ/F?gw]Q>4*.`׎t!НP,tmE p[9~~ Z5\8 Nij*p(Z׵h0 S<05HKv7"4馠\u ZEQA3c,÷>'Ͽ/\v|b90R/x )+VM cw%Z5Ppu:a@O ]' 3,b6*>?5Ub5a,}>),T DUiu]Lp~:-73tx`00nK.A{d"Q>T.a`(tW=iNĪnH4 %q)r9_5YF/ō*WvD;Q4Q p7}0</7.+d4HϸaMwM!*K8K|n />$p*dDZӀ=Iڃ1&ځ7*:R|'8)(9|F)`E!6jɉu%MҌ۟$]d)hCONN0͢m;r {6''MNy>-J Tx~: beL Wt|cE+h]ucM/{90oR"٬ [І-갫X 8n@[89_"܀r(a;Rb>jZٌ]&wu4``&`@r13|K'L;Wf kSwF0`yVp*<S339/^T=?jfUQ)4#  `MAe6`lH E<՞U`CE|KpqNqHDͨ&I@+RGH0(iJ>Dm+E1e}o ڶ 0(֥i+%+J909S3|*R*1 }3 %0!9̶Tz+Jiǝ`&3m[4Mpb0}y:b]ۀ7-00܊[kJ3O4)̚|jWR$b9{6 \XҀe/@{ }mƕ CALҤSY:tBmˁqqc~-*̃(#1^Asi^MR 5!Tbu_+Qz&L8 3WPдjdC l} [p r{q_ML$m3 p1yecAp_jO_}V`Zp~~u dfEzQ8qJL|*ff C12v/4 R*i*kt?ZQ^{w?@tP. Q"Ժ:\[PNkz.Wݖ4`&Tځf]5362t:~.AuO\1!ȮtQP_S؇t˸ ? +U&gVʦ9}6ߟJ __^ޒR`@`0 !X)%Se{;=w2T૯ MKh,iW`9CTm7#t{fwË> ?p@*D@ӵ#iv ;=??m({q zLML@׎M;޾JLAL`[[R0'X.Ś R,CgG(#XM5R899IR\.utD 6_}??kbs)hlR_,@!#Qigs9B/:~0b<9lJ@ڶUkHʸoĴ/hkg (W??=|ӟ7kfY0V !EPwBBT% #z' l~bXx) mۢlbTtw1Uf9 lBpr7/_H^=XеhC2 /εqi3a&Bi@Pa \x_,^"cKnP֍XEm1Z x/܍ \\\c~\+=>Žb{q̋~ltމ 5cWWWwZ..o ޻x\tۻ]GAxyWxbO?>b:$h[ 8|;3?3s׿9Qs~o(*z0[Ƙ6?s-e.[o'\.o> >WZrVTU 4SXn{۸ڷac}#⯨Ϙ?_zo<5}clJS\Lm_^^.oƘouE/~ )U%q#Цj+nk Мp>!u0ճ{G~ Xbٺ4'±]oZ?z|o]~.3 r"T c{ā4Ə}׻^|4Z=0GMgg'f=,^|7~=D }r`3[)Ȥ}?/4OBC vTQQ{6rzcSL` D< ksXxhJ\DTw{&06!-\HQjaOIU84)N J4v즠./@rU`U3RH`& T=x h+-80)T"⌫$ҤXj}Wok lk9&}_"?%K>~EŮ+Ʀy4m?pj@gh'\U]PiCTUߔl8['/M/wyUUW *b1UYG;ab C<9OI|b5۹)`zq2pј5X3`(PSW ST*08ԗ O5uUqدZ@ž1UxÅuIXe \+_6ĿN@šk9M^w/+0n} TS܀cpP|qdۨU84?nKorMې7XQrP7ŭbpLA&@!w^1ݡTT<`TPQQ@EFeTT<`TPQQ@EFeTT<`TPQQ@EFeTT<`TPQQ@EFeTT<`TPQQ@EFeTT<`TPQQ@EFe?!px8%tEXtdate:create2010-02-20T23:26:15-07:00;\%tEXtdate:modify2010-01-11T08:57:07-07:002tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?tEXtSoftwarewww.inkscape.org<tEXtSourceTango Icon LibraryT:tEXtSource_URLhttp://tango.freedesktop.org/Tango_Icon_LibraryȭIENDB`armory-0.92.3/img/circle_red.png0000644000000000000000000011506512414772654015215 0ustar rootrootPNG  IHDR\rfgAMA asRGB cHRMz&u0`:pQ<bKGDC pHYs   vpAgg܊IDATx$Yr cCeexho%oۯ%AӪDR3k̪.U''+Czxcf`0 h@#d@jNf=9p4mbpvCz:'?iOf3`" N>Aoozz**VS<ࣿ%o xj*kvJ<>̌wPM'^KuLTB1Tv3uURyL|;yڧhT<ַ! j+<JZ 4(CIM hh#h$oX x`[)BH(+HN3xP {Y/Fٕ"!  )*P*T(AJH"hӑP R"Q%Ad "`ApGq%^>N(˿˧}T<5[#8(W K OA 08* D" i ETA!F9="(=CP`P OGPKHExQx R‹iLʮzAKBRPߦJT|Fx뭷 Z33!xRG@"!TOO!@08!*PJ!GT%P8IjAA hI"BAPX* UUE(+QdABQtyBd&`_im{L[o?+uE  AP^$@c.PTTJҬt sUvɻUnt A*)V=PTxB5(PB<@V(BJ.Bn__?sxx @ٲ^P*%!'$QbBRf!(THsӕ_* bJ" Rc/i ܧU Y`^JRU,1 U`Ň* QB ;TVG )2诟T<&[.2E&]?cԛ,] U!PZ4 T8%{ I1T-( T SPPuG$&C$5d fB Tƒb"Q BgV!+Uj1@  BMR4TB =Fa'@rovt4a]BU PcD7? h/Td@U|Pu A| *A58U h@P*% Ӵ(7@cH >/S)\ HCZ Zi,f*BQ%(4TPJ@B(N`i= d !*Uc2(Ec&P,__^Y{94xrJ#Tu J B`TTzTӁ>D @bx4@5T1<2b U/ f W(ϦJTo{` !j&"T*ht*ʼn0ߔ@bQЉ0PU * tKT0@+k MzMQj,E0"HGaB| -'QTDC5>j30hPѠ!!Xr%M5@B Rt/ş?}ڗ38hvfJr^(H̷rPHZ/qoݑTāAhp` ERRboFVdĚ!X/^5}gs4g\C+| JЄ=X ACQ V(!@ rAUEbT\E(MwQǹ|c"~D By@:'p\}™B1@j" =PHJTBYA@3a:ur:]%ٿj5(l$[UNJj#͝Ng//-| r!h4]"X2dHՠ`U@U@UD+驰z@PLʊʈV^C_Fڰtg' px$i RH@qQNF}'ެ+8E#B+؉!) H#P(NI98a=-5$D2ij.siHu5W%.i` UEI Y6(<"yf_KeVlPZzm`E$!^(}(G~D&PJO|z x>(}&xPC hЀ4ce@P9 A)߾==x7nր:s ٕCҒy| uhU58*E&C+OgQ7; T]H8ISI5773[gY֪eٱ8ݝk{R]v۳I?e+ln& Q3N(炍Ѱ:R+Az4O\Lӝ-v֝mt37tN}>Zz2 =7<2PzP؀0oBUJTժi_O /HSbZlddi3Ykz>x`zK(APxz^U^G j Dvc$#EQS, ?|<J7S@"%H0cby:TU 3|ؘ EsH:U~]P}Ydfh$Y>{}މd}[b[[NR(PIxO;TH$Z pNA}h6w˥~}s=s}ce'Yz[;{+~,˲4 ?լ=DTZA E נ%D U (,4DfjP {*E - ]zMtUx/p)vJ|*Q P-O[/!fF!3.(6: 8:8,K|x1b{K٭g15E]jYZ~!9HAjZ|_Xﮭ~17ūNt˲,e=K@V (,M9hI«4ڡ)y&U!*Z*DnΔO ›o{"q 3k4!b*[)|]ґQiq;)"4S! !G8W˒ٹ|KWOY} 7_;+ޞ^/ {{c:9X`BuŅ|ՋV߻Vow7,-+B 2B@i jA6LUoqG H2e 8 iEJc%0 $1 A7& -=IV' +c7\*7 \~f$!yVR"q<(N*OdW >l4i4kW_߼*o^w]߁si!ISfYVCtIʀUn,qI'`Bʠsy, &^w [Rõ|=z{w./~qͭ~Y 8JСB+E,%FhP NP^`ϗ"\) o/( BD#ЉYsi/ԏ9:s(Oqk ׮vLyJ} ,CVc^Ge*iVUe,r䃾}EҗrRPLH77tiiw'F+Ν^1},K oGaCTG 5*'=!M+rz_S7|\- s`&x9DFn>M)=Q̕ >(@@I,,NͿK'>[.ݹsol~g?UsHFFY4m}4aٟ;9>}e9!M!Wp*Gǎ~xȑz'PtBqea,* ) b\cA( K/+\(w #ňDl䆈 ׳0]??.Mӹť#GT/|+?kחF};l4h4Lk5HLU19@:OH=)d10v!:lA?#E@l<(~dqowvoom|P U P)XVbU9=!3@D" @.}nVo_DSK8::|Q9?GXDw_0Q9./O=>ż|ĕ+h]zmolPsjlZh4̲ \r`_¸@jY:ooB7~jVG;cy_!e|0@^""HHZQ ~B2g*D4ן%F#;~eW~~OI"24[-6[-?&>?~7i ~^7* qN"rJab#QY롳^eQe,C2?Y]cǮ~rhq{214( -jՂ1؈!F Z@WhuG'Tqa̲ޑbuQftQ F|H˵ׯ^?zS/_>qkh4jh6i݅G *g\88\TOyNۢgN(du58gOf7x_y9bX@@Ш+%hIBd&Vh!I:|;_S.\Ѻ9$x%t Y}MI(t?$.]\Ym|y/ܼs++[r{$Ml83;k^Ťۍ)P^sHu\&;u_vjׅ~%a\9;3ow @NET+,,@B+^AF"xUx%.AQ+xύx7#`M;!ADzpIdDI~)L{vرr巒nh]E,,[0'S+i? 0siUIC0.! }hAYSAj 9~~z?d{e^ $rU RP s r#PxUYn!h z:p}9<7s.\Z-C#M:؆o}|:8crVq>R7L $Fzh+__k/եmhqZ,C{\ =e_h^0w $At ÃAݝkc"Z-_9W^jÍ띝^Xn 5b"z%eЪRgjو$8x- B(gK+V=r;w= tC(ˢj B6n[[whGB72V'yϬd\ 1(iBDĉБ P0%0#% Pn7^>svW ǿP^@g9gg*ss'-׮UgBcP\}>z㯥(EQ,!`"K33j>"Ѩ+d%77g:'-׏dI(uӛd8 Z{o7켲Ep| ~kO8gRo@ #XN5vs`"dJhJJ*"ĬY"-i}o~tVo}qCt0&h6¹Ei:bru? 8(OG?g"(͘TY sC1Qy발`N[G婅E/P.VXMdmPh[%\!PPD3x_)pPQB(t0UT:0DŽt E2)E2Ą>3⫯.Jgѽ?NB?I̴\Z]+|=heGq)<*'If4e0(B J۝ΉVjǎuZ^!n[qE"ik=ӈ1g vCZy_>𴿋!p8u1$$"LhAK\mv~'~'-oߦŁX?MS,,/sayi?A/aò,!~1 Z-@|{{rt08=VlͶ;>4ڠE_vMX^4I x3x}<# &_L~3=~UaBG'Ng?)@撤vĩc/;׋/DO.Lͻy&O$^4 qT q.'2MYUBK=V qQtiG'"bH"d*dF2SJJh撴v_n} )UGYtI`ai ++ƬeWeB7Jx,C|4,؟?nF'MnNН⵳;OW 3t?}??ByaY~ ,PIf\).7U kXdPP}E:Ǐ&ɂ<[Jep#7`lx=b6-MQ oy|e\t驝৪.\*fKd   ɇbISs?Ozu@m$ss\^[Z^)Ǎy\$@ T.I(xFzCXH}6vwWȑc[Nv_9jz¨ZGVteٗqO>5ƅ7LQf`8.KI$U&p,O̺kӧ~c{_{o- .I.'䛺cvTuX6TӒ)&Ⱦ=E[i+_=˗?{O( K&Ksu/۬""G^?)DFamnvŗ^Yw:;pRq6WgYUZInB($M|UH@>0tz5Xmeefn)Çv/AVz%r+W^p vHCB2}>!%v^bTdBf/,4׏Gr}}f+GH#X0TހIĐI2nY?{3p̭/BH!:sƄ餚zUcOe/;ٿ_]\2p/E.,/}MyF5 UIZ.IPo4X%<e' qj++7k`0#`Gq 1)+!}_7O#( .IO ' G"GllD~sfIegOZ֭;ťKmv1簸CUq|icYx@?9zɘDF*h}+˶~ aTӠԸ±EOh:G!O{3Q'OL}bY8̃HcojEBfdIN9;oY^<뷷'}9`ۿpPG?u <J( $q$8DF>I%k#ɑ#۷t;#+&VBc*vxO*o~8qqq)8::Nd'%q1Gjds~ckG~ʰ7 YxpO]'I2Rj/> ̪ Oڸdw1.:$ ^VK xDgKI*sgIBI>բh#D,jgj<+;y wGNM B.I P.nwv9'Nܺ睲ȃ:.޾ uX"1j*T:WOF <1o"/D&8N-Z8+!Ų63ȉ3lo}sOIகM^T4%C='A_Oi @a4֬Т(xB {{"')'OT}\cy)BIBh|Uk/o.,?}h ?XXZTx:H8Rp"Ht!'PE'i@(r΀K˭VzcwѻrPFAebm6M K/?/+__A8,-ܴqä_E%QBOx?cQַt&q[W&(PڮDDjgLYըK_'o׮9E#N'w$EVBzfZn ZMY9{Qv} X=*/QZñ?zX@=FɄ E 'J~ 6+uNδe++\iH$8}KL9(_ޣV O@"՘(m,P4;v/wˢ1b> .aE`yή|ǿK-xdzIVsB M>6S3AWV43ssc >V Krh!{Vā뤌iVRCZkn_$* *@V,!/ZBpq䑞 с.@@TGROp0DBEB0kkGW^~KDO㰥+S8xZ0cށ6M̏XңYt՟Œԡ)FjfP84I=QclNsUo?+%HIf.q٩3g~yk~,?q0#V}X復!pjkx>=Xl /wWs,@2=X5B*_|=BY׿u!a @!F{F%|y,4lϽ~wׂiԡo+c NC@YjCB=C~m ` ڜoϦ^u5X:0ED82TK=<;$RI1lNJVo_9wϾ'_nxɯVaym ѓ~Sx|\ _{*j:DnwP6leejvC& bUU I(AE{7G  v1_⋔qT-_[9v)>E1D_}ȅS1b ,a-)Ӳ>7ڻG\Y{{`9`@Ufªp8CD-5@ū/{1<䡒?3߰'H&Aa)!ҋHKG޿kOf[6gc?)$T{}`naz}F㏎|ucgf)Rj@fAdP$Iܖ)6՚00uBAhZyM BH8 @4=y?Ï^[[Yd'j|x|`QcggGb~6ax~a",_KEzY'F D q#qoRiDm "BPH$ (UM q KU|?b|08&i;1hļ<Պ>VǏ݀¸MU?ŅW:_n|_2 5qey+;~6ZiV~a U>؆A[o}})o|P\ pVo@ՑtjdYz~aqW7n̏[hh?g>kmDgoOuh6l&!t:[[/5I  C/f zޗ$sTrXwP3~h`? ^X}aZzKƭVwb=7WUa};9G\Xo\$:csqZPt~p_ ')`Կ8I S#K4=vdW|2?ߞ]&> bg !Czx.v+;;gf d\@ `Yk b4nCw~ÀOUo\x.J0 UdfażxG_7_ ӽ1n!"^;uky\` sb+=+2-%yr㼧8}נ48B>[eqp $&~zrV}`0S|B@9 h4Po4F7oo'_t٪V &°Sn Dvo.Uxhky~QP,.PuVXկ &(S?SǓhzVffg'xa0޸8{kssm'.Uhz)F 0 Xm|P= ëҩ(BTZ_85wΑ 93j Z)>gwdsBkϔHRM ˂LHuyR _}㻧xPsdrF⏽iU$M3k_ntĈs{; z.|o?I$;gڭQ9 T1(Vhb#z=e O2 F/ҟ*3ssN\zy7_Y;|sXyt\͙6 ns[$ISUMzH.HA$ c8^H)]wU]0Iqii?ʀjYD܉յ78>% x:zd$=C󻝓YŭZiW?E@)wwzO#SU3P ~ L=޸zu>Ceh4 OFe8@ "dIЗVFEa@0 PK@Un/ס 7ހ>-G *PǪW!aB79'M4߾)|"cT=$Xk40QW܍ǎ[pIR5ڭQ8@6#"Ԧz8*QlZPW7$s3 ׮)lntG͙;#*cKD I/ NDbMKQCPW W`Q?C<l/GHEGBWk4s۷_ BfYCO[b{ l*}FIJFR$ABWUM֑{EAU*$&T0`YHWc_L)>/z'VVah8U:Y?rR,i:6dw*/ RcϾCpe`PnA|:ղ}BztPkoc?D(iSczc tFx견*1 QS9Gix@TߏP$Ճb޽ƪYbDZ[hnl n2OYL`?k* wengYkjVUCx4 b{:*<a T!N4dфtJO8Wjܺu('IRF . d;3Kאָ!"H{R/B(} [z6C*'ǥ` XP*L@cc@RB\ 4`ys8l)ۓ}yfhLPC@eskk.I$QG"hX}a18ʋ[@B :OQR%NU_I65ۺ!Mӊ81/J'H]xϙ Q*ЄB$̵Vts0/y9 e֥I A zba~}9o}[q jb Qh N6nHMA3L)8-x""5JGہF^ao06E! 4(2"G h LmԼ_Բ~ ;8%}0./TQ儁$ $a !meCRZĆ Z֟ELR( Tbހs[9&PtS'8+[U0S[ZV ]!H ı!(}+*Yi|^4H(ԁ*0Y2vgbਸ਼HB 8S2 @8&CiUwwgYqAtUVf}&:h@*ԸcXO :"-+8@b)^pk,^5!hFp GH`DZ <18oh^!.\@$pP U]t!aI6?)xѠ!@)p<)LB?V1D*+ 4$ KFOJyڤ*gZembߢ3pL1|a?VЄkZ)+|Ǩ>!(6!( !PA%:ъo!6[9g k~ӜSߖ"b$\SW+[)†眽S-%qS48X8jkjKs[#_HtC. 9p)sx(aBx?c<1ZKއ$D9ԏbx7[hW/g񆪒!|:oz1L1}0qAe,?@GoLU)*CTZkՆ_ ^*)xP-%8G!c3L Sv0JXߜS^S<6-%aeʼnL*mX{G%x=}NbǐܣhV !LI 0v}Iоs NSLqPNd~ xn|&T#)DҐ8@J/7R,"A$9 CIN&pa\>Gyxv?@_. 6`5(b&wA$)_il1H/7CwGCC2l5x)w} @M_a$P-qo^Mxać iRp)q]=(>ima=7㩄ϲFzl)pta4M!ڣ ʲ ^cX!HS|!xA5Dl6{2=pIpvxSLa?pr(8Q EQxT<}?Ë{l(F?`{!H5~FG?ݴ<"a>40$vsذ;.ꀨ9@C1pL$:nmiUUCݐe` LقSFퟤC8Tv$)¨oܼ?:2jB0ͣR*b`*BF}Wbʲ5p_*%P?9E!z)\j}%f>?F$\%4J(G?8ƃ2@,1h5( xʸ<5 {Md (cx;N/e9qk5vž/3f-oVrU3h8QK 00!HхUzNy(a;;4xsI@\Jj7Mi00&TcOؼ!;2c D`ժb)ZŠbȲ_\Y?F:0 $I)"VL;סW{?(p2( *??>ze* q츕4hy>?w'J!OÅX@)>O $M\yODTN*()p Q[z`)dPO*^dt+T-n8_Uscs4NƧ0OOzV/!4=Tx$鳬 DUP 5:[e%AúCȃ;AJR9J d t:,9 ߳,ۈ` @;+0T]%D@}Ck\UUei}پeYI,9`֞cP@yʇC&!T$0@yBQVQjҺ2W̢(ཟ,oGsG -90I?HS- 2+؝WDFEZвP IsH xNU,=`a0;IkPJP JQ@d T J?6]߯P9H@xLm@))8 -o%YfSZy`zpm/ip>Be0ep4l7[Eཹ!` A j9r9D; V Uޯnټv%Lx%arp:ls`i K/d"p" &쮮niWYƑCyG/=eGށ9E 4Jj @€p}zUZ)eY sT3X(|*Sz27Lw|$pp >Cf _9bOLԢs̝~o%P J1 kܣz!r3Kxk BI "H^BPzzHp_c i >9Ғƭg{H${~Wit\Z]ey_qgP`"`Ѡ@ P >(Z` *AB#AuY[\sc@ۅy-c(Ϧv_1!$Z͒zKK9DJSE#Ыdl~0EP( MX,go@7{P@8 H"#PUbdyp?pM ~J3{o^gT筭x </ pC u{_ wVowˢPjxzAU^a؈q6߇* `POUO@_~w+2??580tk&r5pIg♪C@Zfs>n񿆀p h ,, >sUx%~С'0>~(u &C ze ATk:a@[O.G u;Gœ qO92JX2'9J>lbD6@rGj@8 Xx8D|;AP@>x[AsHN\Y,VG>0`?8ssd%Nn9B߿9NN2^Zy{0 [@BG dq |C3r JM Q%rDA,dgggȑwd~~G9}aċ&FzÂ>s5ϣ):$7M5,-?_(J +NV?9p,+'05 ʠ -# ]m_ҕmS(W J78̌‚g<~!yyF]MM> =u&vV7EWB>z*^U'do|q;JW\`{|0BA  EVy[/qoe}a<6:o<27j !6Ie_ꌪ9{aOVWw= ބaֿPX@\E/n { 2 ATazBKAKݹuȏ.d Z 73N%} 2Xqd".WVk6v:{}U *rX g0d@U~e2|BUU_Ъ >x>N#-INw0 |xǹSEhP3?fg!(7A!!zgu7˼(}@ r j8X *t8t? J !H h@y#Z%@2DYŇeykwen.T1u/1m7{v~^i"x86f+W8/ #QCNV./^zc}@j$ FF@*w+'T ;?R5f՟ȑ*bowO?ygjLTMFBYE@ffF1 S!&y@`*ͦl/rc @n?:(tHpS~h^RnlRZ$CUJ|oo/'qWǏ]N'Gc[Ň*="ySgS>|ƅGcbo؇xAF2fPNe ⢿rV> ޏCQU?]a;w={?׸ěAA-*02R@/non_==,/*f  !`ww 30ϟm/`$eV5XX%/Wٴ~|3tcʊ t!V 'ߛu%r5P@i8и@|۴yάΠ( 6c bI j8%ݝ;G|lϐvv^6;IlܜUZ-c~E^-3<ݭ Kne_?v2/*A z1PcZjU=ힾ͛7qq Bخ1S#@$Tz=h϶ny9lo;@OV2U!Nefɮ,p6¾q%D44ZY{,sCP]ycc}]:ԵZ:yle#!0Ja B! =S_!p8}ֻ4H VQjտvq5i Vvv 8f! іGJH݆,,@2˦>h\g~ Y^G֮])#*7˯F1U` }Y JW@ 6Az2&!%dZ^kgN5O|鱳FQAwYcß62@ٖjcLQyn "ƷÄVi'r:Rx7e; ax!cgPT@AE:򋝽;S| Kpg{[&s#%P@zLϝp7+!jUS [Uy R6Ƹ HB>j] lj>/9@됺M*33;;݊}ɿ TcRzNpBJՀ6( Z.@Y(j}:7oTnnjLV^ү?o l\Jcsu K}vc?[mxbp$c`o_ӏc;?t4&FP /þGʯJq}.Ο?KPRh%q<(9˓rv{OA *.^3]̈}Yb?D'_{]v%S? "S"O_e.]_DMHPڪnO+R./,bunnִ(P-/FI1%OO$f]N 5GW7ı\ZǺtHt?QKcv _SCzzJ Uͷ7%?>u'R)PhYR@QLC)/s80k[5N_h:U\<}(@*׿kdrO~=WMq@ AeؽTx_W=}Éռ!A>)^8T~,!=lolL~D,.Ʃ|\ Q#0_;硊b\dtΜ~ NZWVO`h@_{?g|w|٪!P4˗/sbGQy5'tes׹rXv_N&@$U0-}fqr5]ZBWoѣx{NY ?f ~r [s5*(PxH/_ƹsb$^z$b.*`>]jawW0Y9j@QnP`M/~/8:_wCeW==( rBK+>G"|8 bCZ{ L ֔ȯ޾G8wjd@f\6׫qɣ8*`ww$< ,Pq{=lmlL2$G''O|]^'&0 W -U?&ժlߣ}@j5>ܫ`bEA P訕1WEA |x̙{jI`{ssrh`ݻ OO)@_%6'} vϞŅvwCǿWPk5OYNT (zxP@Kv\Rmj;(h6)qFDRйCI)sTtp ic~nntvIvt١Uz6y V~J'*wKj@`G.~\iu6TtBx睋q9Ś?>;)!;*`AT9Bz= {{e 9HhP%$S%0cGf 7Q'յ?z2SW>UUr9uߺoRcLEWxl\גss UV1Ɠ7 n呵lk{1FJ8I@Yr8jJ`A%3!}ƻ"7=/[;!q׿ h'R;ũ9>^Vßo <0 hちbX_y y yAqxw-Oݽh4A$MG 4T Ĕ%@*665x&f'N_/gw}scӗcnjD׬?$sV_ C5 c|U\y Ο=<Q Onk`%B*"N7:X.ֵW)wj5!؂S%0CmoL &6}$$kkk},He ?R+P*He%6ݍ!)wc{eҫH`-{*j 6mALssqn.,)a0B`0@^FJ.^`~@ ?`4ߍ;wTǛ|D5䯿ˏ{nwLJ|jhQY$-X4рĚax"3Ͽ|8N XPD("JgЀn76fj㺻 3p(CS/``S++_{uϝtvGr_LYjπaq?p'T!6vﱺt<2x @tK OAxS'7WV9'@Y[ ܥD8US;w&jM>x^y=H <|O @CPynOۺqik `0!:&2x&ҕ\%v<?e~U;CM˒)8f{>USR`Ν1m"/.~+omN7Qd+,QOH'WOkZnI(`J6/P96_;~h-4Br j-Ī@[%"Md_X%0 @`ƈi?oawgX~Οϯo?δ~rkc}{#У- u`2Q،?#(}'wB Rɸh,8Y  slW=rg-M|)tP_"GeꀽH NB"l6qܹ⃯}mE^tXK e_>o?j %lHoO\xPB%*аEPYj5X\@(x-֎9KX ՗C֑^xqrP xoe}_T%"" zԷ>jnooQ!M |?|T?(TEX|&7/]^=!Q>@*'{ۋAsY}4IE: O ~眑i@s|!ꪘQ;D\_D;W|/]^ݸQyr>bO?d @Gn~c_iu?V; J!LLU!!pDcaPc//u]C\[}$ 9ڬ듽M[HpH0UO*CE۷uw{i2|W_͵xuc}݄Z!^1P`@P.?2X],T!P:ꫯ^`kL(!R%*nQi8(wT;cGojsͼX {W~_K!ih,$*R3!3^wnn}w̨{׾_FqGDʸч}=S6߮v~L/ᥗΣ[Ϫ1 `mA @YXe{حzetDZf0 sdY6*6b*:7 0U;ZucU=ܹuK3q^Vy{wnoESE?n-T2 Q ho?z3U@/9HfNl 0+,X,UW/ lywf q * EQ%%+52Sos$1f߸{ﱽwiښ/uW~??s{,ʻYFQ lrv,hP@Ub~u?lx .{Gf^" U.1oy?sl'B&!, *9êe BUj> +x.AXRcI|0ۺjO}.lllEQ뿛W~zWҫu*tKx"TOSQpsȲvZ*E61fu(K'`&R,  wVWnEqkBYi(XHKDݥQf]h?/~Nߗ;;;nٍn^\Y~څDoƛ(TPj5/ Q£,<S9eOM|E\x_x ͡ (qjQ*C-0LB3啽eV\ >QHz 4V lЈA8i*!}1c_](mt70Z87{Կ|QS#ɇۏn98\i¯ T `l'??{=hSSreqfAƃ2pu &^j66,| j_z( =KViJ{(1:@[;W/~o;{NtI|wPTHۡm{=4= ,G`x)< MQ at1(w ],CW~Ə>ڼ]UaZoRu\mҌj?ߧ+x?eZ"QT}UBbƠJ)XFP5íAo's<$eQAC=.@ m(? b! 9Fjivd|{ۛY{Z̯+С/@@`ü0fT{P-=YDCUӘeiaeئXBTE`JPz=Q(_9gPFb4`?vaĆ"91`^Nq%c>m  l !aCDİ`LJ ƒGE4@Ց?D1U_ϔojx퟼̏.lt{^.!&&zy~%^!J?^ϠϘ޻W&@-jT@SE(V U>Y^V_]ݛO4h EN~3s8,IxX~`\EVZx0UQE-4b{X|A]`w=[n~ }(/eY=1^Uo#  ~ xz~#~&3pNJPMCqWVy F6]*1Ev{zy؍I9 >A@n@U9ʲD$t m/&M<" $ԼG{d! ~Nw`~ѣZ/~᝿Y^{;tB֭g#mxG~T=F쾊,`^Cj xv-gR8  bs8T)P %j4~[(KWZ]#ZхTAn,c0 aU9P5E 2n~,Qwu@>I=pgwsы7677~W}keҎ*73ZۥQR4MUhK&1*gUgX{}W^9 UK$;q瘲Zk]V/N%TW/ ֳ;ǎ^k/,K\Joa2p@u ՒQ/ԋ \HG{UlarPGf`phH٩Sګ?}}cwgwׇҬY*_MCd1^߸Si\\Y~9>85O@H1uXꔒjI^fU4H(ɔ&?O AJY40GLL([BXݵ^VuA}Cɬ*dg{/YPQsIDATAx<|ٿg;w&PӬG?&x<ưx򄏙BBF#y?4&Wעdeϥ}̚y~Bs}={}J1§4t#|:y pNn2Q8^Ooֿ~:fY}#(+!an_ VT/۴ &!$9!|G=?G?|)t3wí@{06 fh|CqU;)}6 X]GՐ/%EcDW,l}s "l( SqQt~y?Ϳع_^g?ݼu14J:Zdtlεu㱁;"f!s@!!H!Hg >8tK$S$bs ?3<\|tl;r䷶+WK;|],)@!Pfap.hqڵ:bUB l#wxŴ,Ok~ɤG$k] \8DP1Z5#P##51ZˆP FU]Ξ^h{~r[/ݐX[_dmw>MI0W>gfTNzrfW>#)rKio/ٌ|,){Ʉ~uѓ…gѳ׾='`:Mb|mWI;GtsHg6o]?Ƿ̧yo[e8s .@l@'0Z|d%BE!$mwW~^yp%O_ stx*Z`D B0UnTuuۣ[~qw vwLǾ} 0bߣ:4mm$KǍ)kW;;_a<{w>{t[X,V_ Fb3 \~T@$s!hRz|O|rKLx8V+z@ښdz1x޼?>?sņB<8n9>{F*x̪ᝳa%lvI=4(|۶hFmӠ:]wR! {Ɋ 8t{B{rM0򨒧lSJ}bDk<ܙ3J5;?nߺ|m6M8#f ؿIXEIdBJ/b~Iͺ+crPڵkH^eh`" QgZX ՃDCU'kޟ{cڽoۻR(RM=L|xG89]Oџ&z$=Xx3K_f{_,tw]^blفh 49kVdŗ O.?Rl3\JKX{PWṚB聼ff0PPa z%D@BN2\h2L&;!}s6r򙽽Çc4L9W\}WeٮrM&hpLo?xn{p>kiS2gKY˳-~hBSzN\ރu~90W?.>8MY-`Kbvv#  XAP̊. <hCѨڜzq <ƣGW?Y?n $;5CH;Xpu=N&g|q3{&{wAڶbcN1M-P@-V( cQPxIי{ @Ƴ)[^??\v 1˅$o6@xIwdr°uN$f*sHz:Bj4jt1s}ܺpqk7ܽc?ٶ!=z#ԶS,q+ܼD66Xhv3g9wnzkmv]v}Jܬ)2wÐ}yZT J?(>2h(+e?&̇=K&*`% 2XL"Hɹ]^];9Xb1/k>i F;h>-f+ kPzĬ}V^JYW^;Ye^M>rE|G1!7/![~q PY y 3Jn%O0\=*ADX1o`߇#||jO `oǣP!%br>F?(?DHt+FGNѻO-vuTKԬp['Ivۘf#ȣ+ɾ#A賛b 6S%a={AJqZï7+&"W? bX %$Kdb?IN 򫫿B[W±'VQ^n#I@&٬ +@P'|o~? ) ru56Et,%|:$Qrd l٣%$XGv'-yS'6 =Yz,?O:p&H"e R]SI Gߦ٨H8SW\vU%(`]# +y3ŭAVrtiU]!QtkVXoEsy˘(>;$t9^,1zQ2Md,=ٵLV3(|=̽w)nMۢ ň~{,B nGΐ@^R&(5Kġ$;Z˹1K _ X*)fۗ 8%6@JοP^Uw4_VU,ȁV3-=)@r\g)1bW,rj2wp|n<%^\KN|>YۭS2?H=O'\LtJ L*MmjIm07>59DxKP #|''F RaQ\kʎ;PZ,geC ۛ2byQ*3A9,~pѠ5m9oI~!yI7!&Z`kL 0陂4 B Ps"-C [/$`aB尛C>|p952p=k9'It^!:8bs'J)|¹#s )@Y_\&Ⱥ,T _e9F󋇖5_ x\3 QaiVl!qh psOQ =![blխ?$L ɇS?G*A#!3??'ek2kȔ&09)9϶`%\530* ZbLEn~&A2?#ai!7݃NLRʋޙ N0vuRӸ{y?S僿. ~^!ޡ >StE%+ EV"d|;A+ Sx mKnqYB/AR^3e@Cb! dS"ȄDʙ/y P !r Y>*xnaClzD s9wd̓( PVUC,ᮾ]c}c D9eggAĺdGF/jT+^YW O8Ȩq F4pQ(ևi(L"Q|L V7b}o#ǫrʼɫGcybLܥRj)f5Hgy+QVc86 95R=ƘLOO-qtQ`~eeCҷ!QP 7D;0WU[*āmXGp,i nw3PRjtqQ%F-F?L n tPUꪫ;Td0,ܖ H_ԁ<,Q^dߐUEWU\;]¹Eהl[ uQRfPL&5MMM0\ƄGc4` IRl~id#ٳkjkk':Vm'#{s߱aÆdggXkKyK!??]9޾X y1rqJbR#%R9EZcڿXCiIENDB`armory-0.92.3/img/MsgBox_info32.png0000644000000000000000000001025312414772654015472 0ustar rootrootPNG  IHDR szzsRGBbKGD pHYs  tIME -ׄ;0+IDATX     !*X>.(/ NXK) 쨵. !7 3L  ! дz!% B +C-D[ %ռq # }6 *E. $04   "F$# A 4L&  1N D# YI  $$YJ ?* 13a N1 , C B, ouC,'  (   _Y)                    ȫ   ȩ   #  C /FEm ). 0 +I8" j @  #  1F!&1 B<#36< 4-/ <* "   xl^^IENDB`armory-0.92.3/img/keyhole_white.png0000644000000000000000000001055712414772654015762 0ustar rootrootPNG  IHDRd[bKGD pHYs  tIME :~IDATxKl\YZ~[m8Bm Y ,X @ H,Hl,` !iFhf`ӱ;npzNqR\E|\Wi'st騤rLp?,.\|=Fx txJ@'Zo 7&WλOƄ~' 0> D=pX`ӘC~Z0~Lġo/S6Q x[GA91ݤe 9q ,AHcbb^m<A#b*Ч(:0~^GgףfoC60iNۍ|x^n7nKբhPש4MZVNC۵8-2M\rzTU%  B |>t:u*bQBbH\Zh4h:X8_|4>d ˅'3==M" 3==M<'1rHZT*O6%ɐfId2 ZvsE$ U`DQΜ9,q&''ux<\vMԹeL&Ǐb{{T*>JE , 7/Z>H$B2daasα[oE<' t(ʉ^GѹR>dccK>^[-;(vVpE"`aaK.q%I$B!]GN8PzNX$N:[1[DlbbZFXZne ,kx<λﾫ[Sd@ `*"0auC0mࢌow:hׯ_gii94M3]Nt211AZebHՒ%=/ߒ2z9s W\ayy/299vDp(Z-<\j*SD^ZI@Ν;Hmk0 8.j%rK2vFͱ4>o$0G"wavvH$%/_ F|~~g t<*Cpi$Ifggu'VR,Swzzd2I,w ZXgrbKașbWafffH$zhb(vffd2BY ]\ 133C,9q.8~d|LNNH$&3viSSSa]{]ʰ\DC&;;.׋*M'N~F;u-l9x^ǭM4F}9zx<)jEN'oƔ7C"d{1Ia[Lo (24T@u825t"2|mAFޖ"7et]&Zf)emCYnW/h4VL SA#!"\T-Q&Je4J^KryDl4}R(t@FB7MrT\.gFh4r9>}J.+VEPٳgdYH+nKR!Jr,)i={FP`&;D^.Tr,Rd-^dٳgT*nKZ%Nc2 z]%ѣG#Kwr9=zģGߗt:J%vvvɓ'RY]k`ggR$ӝ2h4d2lnn~_SbwjR)666$Hr&a{<5(ukXl6d2ܽ{U޽K6.vh4fܿX,F8ϣe6vm<>|dYtq+CXǃA'oP(Cn޼_|Bt@Jj}/lu(J<~[n:ϟ?7B4 aBJ}JZ55Zm* rZ,[.~ZF6ess7or ܹӧO-. zJ-/Q-F(r=X[[c}}T*eY@t@W^T*駋¬Iia#:Εe2  2 ZͲC5KTrL>'S*t:= R8E-gY{.1kkkܹsmAQVmE!^fʍ7$Nq6dX*4: 6?T D"TjB"[rh6NM4.k IEW>o(QEmdPw0tA4"ލa!'hTo:J,c)B-+m" t@݃c@N@4C(:qzD0DPUs[b \""cDzm[=MSc7UUmӢֶt:u"v}o Fb0Q9YFq"+aBǀ| RzG ;YZdPB!=*;^"E/rCuMIz9#hcXC-C4Ѩ~.D>oL|!z0,EknŶc݌kd`o NؚseF#"۪倈#[UU æėa]zkgp4yn]MӤx02SͲxH(k9 Bb1SϹsf[;#]5IIq'Oan!b) 2^c[b%wJ{ aPJ{U1 I2 G f|=v LNNZO2-bBJ{=b<˷&R~x5 C7|1:epCeD9+9DX{V'Y.IqV>84RK@gN@1U%gi,ccR1# XlBHߊ)\aTAn#fCn]fN43)u9S6Pg3`9Hmbo G)v HGvE !;PEu?V'fUU Xd c-rS4MӟPǦ2ijS2f~{@۬Ŋ^#vp_ֱ(ydD;$[< )&D[ $ M |hyvG%ϙ>"k(2)U61yXۿ O1koERܫz&G{FEb}á4jf:D~EQت~atz<^lK|(@ NGZ.nK>?tw:aVE6޽{ +'߲Jd g$%.CA>i ,rS]qzA07#>}׆@qVRm@i2/#>*HHq`$ޠ0 dOE6xʛ:r@Dcx`ַǙO1_: xq)qtK1Pǯ?:XmðPᘘ6ݘ=#KŁ2Ͽ¢=TDŽYʹɋ1,$qW^8V| k~ tZb?Ԁin&IENDB`armory-0.92.3/img/circle_blue.png0000644000000000000000000011771112414772654015372 0ustar rootrootPNG  IHDR\rfgAMA asRGB cHRMz&u0`:pQ<bKGDC pHYsHHFk> vpAgg܊IDATxWdYv~WΈ̈HQQP2Hˆ@61c4kJ~y1_2Fi6al h0+RːW8b5{PWE,剖w.@N_x(qCpp(6 YMuP)C `a*03 ;P6w ~vӐi/>{.tBH~q¥A_b)JeP\ᵅAdAj$:S U`3xTa@ h K?@$A# (%]%dd&pP$0>K<[o!B@ V;`m!SSB@PHxL 3@ F8$T 5Ц`sr* RjpAX& )f4(?}ocBe Gfi,#G,KqrFU,`ѓ0 UQ`tP*<,zvGR X A\L!# [lh c`ĥX fBChd,(LP3 0 <`%k؄Ȳ2 [i"4J![o}TU@ez>B'i sS'T(@sPQhp*@ FL h"P@ -!@`΢÷?Ln;F͌ M'ߏdjHy fAH[ Z- R~WL<`yoìY΍Bfb !Fsf0@ -f Tb F̄H1P_@ӗofB I@4Ġ1hQfX0QCa0(b4 1.0e ̕Q@ùri}ϒwBǀeJ@HR !H B (`](&;L8҉Qsp&4sGҙL t$T/4AL(&tJ8#E*BML $̉b4!(Rb:8h?ИB¢Q4 o=|k;=e孷ނg H&M2;XT:#vx(F}+iBPbQAҙєMRD`1#08.dO/?id,F  T(a0FSNLcDk!T 3TT(s} <ղ4_Bz;cB*LI3QMM b P`&jjT1h aJդ03(jb`Db3^|-;`BF DqB(@R 415*Fh a6E:DM"&?%m1X(0=Bm!:kKdӶXP1U% AUĠT"RT4jj_OTT  L 3 Q~.!Fz;ta2~Actx*u{ƾ[J*HJ@PbH)((B &Lb* D)d)SFHT ѧ$|Y/݌&R2fŀA`14U# F%tJSPU#lAUF*AF*TS4Lm| Ch*R14s[? `_<  5:XpNߒ=Q"P) B1PP(80bO" C2 f;!adˤNs !bFQJMc2L,BT5f "`Sf %@ÈkVSFcƩ)J0JX3% S2xDdQ(wA  1f!`dDDaE`bT+ $+`%DĢ$?<1/\0SB7A4GoӚf$P#F0%$)# R!4D7ܵ[[YV6NV iݵۛҭ*~6:neƖZf$ eh~$9r'` XIX)E>B1\zܬ&beY F{{;EB(Z˪ t S8B@0 pۂfjZI0ZH5Hj)Ph05J>7/%qS1$4HWPR^g.&h)\wF ."@7""g޷Z[]YkuzNusamThmOpܬquEYxN=5>q&)bof^=I(avB{mZzFbU{7&׷a1O&I]kк Ac*11'fus!`f1; JSD1EM rru}Y>ry QK{9)̀u,DtO_h^#zi 9˜w^7ygmΜR?8ʅ2{i 5c ꆓ ?tV$D$]V'(ۙ7Yeg- ?fS꽭εb4UuBP f%``4fuL, # # FXň@Mc2C`cbQZcw}7|QC-OB@/Im=I!C{Б b"Bp{i^WֻS{ v'YVݟTRAJh]2nc3:-ՙZ7c'/'EYjk~2)u0 $k)bs@ ZJ!,FSRcP` ңr7]S o?A YL'Pq:3::_™Fo۹u}o`eF@*aB2 k KMQLj  R"c?~|Cg zr28q# ԑ#x gX*=Hǘ{=bރHz':vvMt\bw&H쏫()Δwpe^Ny+C+3]z\("pNJZ\D^Lg)3jРРjU,ku(!L ccA[vI_~~/vw񸪪QWxTsWMdXmd T*T i*, r r<=h?[͢}7cWTnG4fGBΡnv{7 =Wj)E <0)*'%&&eɸBQV$phcj VTg^NtZJWn{/y[?Owvw'eY'eG 4M҄ ƚ*Ei$P35"\DCPV ݽ/"To" E x pSH8Ic (O(MI2Hُ3Ok3/\\k_ ?=q?;xR͇U&'Z v^AnE|)Q}ޯk !(k '6ʪ ;}ܫNo"tۙvf>pl÷n}z}oow\L*V"aUb+Pa"RT OjjB@ :f  L}<{V^5«ި`YFU&tN붱fe>?{ǡo>"#pǃhҒ&J Ajջ z nVwݍ⯻?=7o\FEZ!)ECP3ET44TjEEZY@S5E %~ =ԛd!k&>CTܣnZ̋y8șB}z)DRkEQVcL&lY,'VÉy]EOo~BUKh15`(Dd,QCTc` (89`' _kFOx752GfA]l%,=DB(RU?xA,^@F/@r9y ^NX[#|m{ G=wNiZnYOtҒj 8\AQ<:5:|{vM' 6wB'[rb53!E!nnp ac`B;[8)[}g;ի{EYMYeDjEhTks(4EOy:[qVH-Ox7_k> 9xZBANH{F1S~o %X]m{W_vn mBog+=ng+fi[SΩO`/{p,bx 42m wpkgFzO~5޹ݽqU֥f҈fӂLdH"z+X {w?ço3wA 7d08s#iROZ apN ],%ŧ!C,#{Nv +[{~Rw:-lxrsNLr <72յ9E{b |*אuzgF'"R5,*l֞Pa| uNw.>YW!FLi@ DHMT7CI!c} ~|VՄzӵ1"ml `1qsǚ38'FqO: oԉ(?7o_-lOw:<>;=ݤj+ 05ͱyV+cGsCU?[;DQV=t :m 񩾾i_};IQY2` P)"BQ,X*iS(f ehX o}#$Zj,[qRE_Rh/Q$#%# f,jOw_qMOvkzΛ4/KOq}чtQho hspD'D79d 'F?3?fWǝqg0҅9şTR*qhY`2E? P/ $:se :;&TbT2՗kgOlvFV\!"C 6#Qdd7p[ҕ\3^}o+O<) 4wdr"p")8.#DodNCj[Ο]9囯d/rk|jk"s~mx ^pZW{t^#Q/[1$`bۖE!TVp0!ȱcfPCYV05GӂIS7k;E~>Rť-h="%Z4͛)?wy瑜'@  0R=PNbO'tCf". 'Cz+m?+NnU?ŭQ>T~ Yq_~錜\ez?'w;)̍)aC,tB/>ӠIeܱECv[XY!:( E嫗gV{nո !G6GPT&|s?c`vlYN.]w}_Q8o:"I8bBGo ~$2'0#!!wgN_~/G_XZ|D.tNogQܲŭQooTRu@¹iYw8 ;ŷc,'-㫙FEUdJ~UP5Ŵq%J6~qu)qkbIW,A ~B̼H$Z`fF^y?od.\x8͉hO6cOҋ^?⏑`o ?>OoM3C~ /?ŋOSy6΀:^ٕEcp_ffjBP8'%D2b밪kLXh (I+_謞>wUe⾥d;L*"i!U g`P1:\yɈ7^y@"niIś~ɚ\D Dkmv^z^u?~ͷ>1\M4^k^tVNmR^!U/V_in1 iVgQ5EѸ!컜N;j GuZ^zqOSgm\T~Z|,ϝZ/V0*OİӃ&Ԯ0M N;J#T "`Tjʅյd_ LA 04Ι3gDk/Nc1s A>qv_ŋ,Ft#'@Yŋkk/}'ĉ^xNW{Sg^یp IqQ9I< N$ Lqi\i|pavdWմy=HLlJn'ǻC&ŔR7.ÿbΞ=7{#_LHi ~e'`Yg4Y[/^\]yd?>_@uAw;yFdV0[b8.Pm@Xt9 <45I^Zk']2vxz`TH+9c G(_ (s grNG-{L-N1G;+.Ds`ꀢRqکZ+ܬIU L cߢcakjh8wu|ᣭ /yKk;;fm>s<}rr{PσU?j]Uq pVBPFEi"N;gVO8e9 ( F@Ryk(x?ѣ#~dW~WP%꬞:{:K{f?2R>9,/^ZdO>1:?y= *>̃)w` #s=eeFgY륋/|1On 7_T^|N?F?| &%ʳYZ$``X7X6O!7D@C<&̠a3R*LGbx xHft 1bAs M7.ODfO K/?azOnʥiWW?r@sOU,̳źI A GP*uNtW6{ N!͚zڤQ!43#Fh^1:u8''3l&AzH}D.LٛHxp0F`4e[S._LFe2My$`Zhh4_~n.Y d×]w88(>JDyҋV^W7Fg$y/tߎ9U(OA?~;RBSz6ڭ{cԵNӁVoON͗ex̉0äP׊n'?&uZhqII1NlmM:~T nȘ=%&"hnRLꫯ?~F^|@PX'EKdҐyP~yk87O?ݱ7ma\<+f^"c;A/u (^OYn_~/mn$x3J¹MpvsF}3y?Q9OJ8v̡iqoSU֊J-o6Vzus7!.~aFE v 4m""2o&T ΃zP$~<BɌIf_|J_[aS'xu/+28"GΈY˲9$4v x$1Mqwo4[3uWW*Wݼ:*T)mDhNT-| _Ʉ 3qp ?2yn]ymgɇolODgTlW.JsRrOr&TQ8>| / ޕpkw̠36Ipf)1T܇,^/0z}e/?^5qr$=u+}/ƛЬD֊?qDĉ@ŹG~fn}嵟:],zkҬv;-\xV:cI=eYN InE2 7`8Y8cBⅳ;0T5allXcf.iӘ!$k% 6H& /PBБHED HuеZYvō/^)N"`}}'VT{>{6 ą& әH)W/7* u8{j >)O:o ;8}rm*gY::#V7Ϭ;Z$s3gӲ;q?y.k|lϯC?JҒ P GlYx3v;O_xnX[[E! B=nu2_S";q(h*$qz=؞d6`s@`\ގ& &`UW_{:{2wǿyUH!QsO: ?c__=(ɍ|2ei]$3#]+zVӧ梀S?yfÉk dqy2K :'ks d >cR1͠B,@zW*߻? )9̩u湿}_T0OspđXߞ΢+n "3CJR4` -X4tdbw{ܦ0cI!<'$WGtY:D=t/LElUXV+ÙS;Xց[UkOudn%{f"GMi 9Izw5ַ ELbD XAХ)@ʼo\8u}~ٙx/8sjws{Kydz=N&%al2 -qRKS#0+$g(Y&'+cB*0hM߭ٯqQMOapcO[fO,*`k{X?8KￔCʲ΁67v(`Trh Ξγ,hAFkS cFSï! }`@%Pl:O tGљN7o]xqk$??.|[N,3$K+|'r#nX X ι+Y  J:@LAnk*%O,oDNln7vGØ͍.%oBĎpAIbs}|4D ~v3.95 5ܿm @7o΁P$ru,B,AՓ/)o썪LX~cs}Ⱥe,3"K+p[;63-t1p\ 9[gF`ʵ【E%X74p4XUxQči@@(ƶS vμ5Z^^8_S%q @'6WW5H1,B^'^^Yl[p|7>#Hdk6>.m-ۉ*$(FJ4U'OR7|t @#G`~W-D/ML̿A Э m37g k=r$KￔgH:``lz( X]mR5k?z߉D6?0816sÿOH ]JpZTJKxcKqn}`W3_qtaR \c 23t;9z<&A7ީ޻f.ROvr v8a}p hA?$(H1 D &/N\{mm{ċAC3/噒xOqYw =ko;9wa63VMbz`BC#"O3RTQ)ffxy:t'iZܜ,b`0D+-;'鵧'1X#bp0}/2lŲB#D @j{k¬Ok^_/KB0XX*j@F+\Tl7Vz=,-ߙqR M" E文,D-z&QK@% Dh ds'έp\yg; zm藿 CY~hT(}#1 (a;'Oez|#d`D2bā~HZ/O$F!4D8N"3Z?3skafhr9:X: ' qhYgH6S~ſԚ7"uM#ٗ05!(LNj0 bAYrzRa#6:s\RrDfO14J]pj/MF26 cj H*i~"0ЙBLc/_CT4T(*"FPĹ`?QQ/rN /9BgiZ6̑!`DEHKt_{+FTHUHMfBmF "0歃 NfΡiKGyM>yȴA1o1 w c%Ԡ&@KODaN7̓DP?6%f^ \<:{9e^Rr{Q5EYrs~^ ,+f+NGjB& 'Nh0-Ab &:ifq2ę59{,n:G,@KY˪b'ɑtp08 gO @H(fԄ)`j@@E *F#Fj$l噛|soT90ʎZRrB8KCj@i0S$!C)4#j6դ),7(1!R ԸyoR&5W+Y\D5N) ;mzU$s\];3f!؂y"peK`)K +"ȼ_ j$d*Qo)BoHycP!L "/A!Ph\A-.apB^Lt0)v"LJ,KY}VF2Xb 4MiCj۱+g_ V KqOPH@fbqq% hF XkO*=!ܒl)KH1HC5@%nb h:8L@i4bL ""I%Sc{2`/AK8EbsTxL3)s s6@m,3wK6Cb}?y/K)R.#A;v'[,f! )aSN{IXb /-iq7Y6~XR0fd,偊O-i5tty @ ̞5s<"schgXRtp^bͮI]sώCDXk[,>ĉ;,mR%u"wU5%Tܾi }Ȝe@;KA0Ujm{;3;jPQ$:w|)Kid ;$fvZ,xEߡi۠{g}R9a$m<dOBDwI!:_v"˳s0]cB‹քws<452{c6꒰S=xa сs<Q  fd8׻S,yed^B@U-AA52Bu9o p.DJ!I8Aj5$]Kkeuw/)‡Lh%mpjKW1C}fRI]h8NڭOkS:|d&PSH,Q%UJXMF$ZaHoQTÁs[$/KlIźv3͜zӀrfY 9H=^It'J3%. H"fPnyуHQEsjHjA#F`)ϰD @&b:-$zmUeYȾBc/]\iI3HuL;% @10 cTLr [EbR<%vw,D.ke,:h Iy 5{;ɨJl~ʘ,ax P3Mf@,*?(T,V-LC5Z=<ɤed7OӁXW'h'D/8ɪQ@hbq`Nӏ:u!B P5X0 4T_lȳg泀Ip?c,qGɺO9b{VMMePV51w#6U|,XL fH^2   D@W! 0qGM[ɤZ [ ^nI2WT9/'x1"$ =ԹZI@,+e3A.հ CP@ `s@$01r ++!Vję#KL&fjmN7Nze,L&ȝ)+F-XTKBN2pҌOb\a\*~Ј ws{-i- \h@ENFQaf)I~-AkxdU@`X `RLTLLSDhEd0$0.JTUV:qAPcĤ _WHY g븧<3ƽ57#2cմek# At;--0pT,L1C(?簼w84͊-e ҌAF!uA:}+I5 {2CP#I{ Lk Kyi69A d~_F1ݐXϼZAcA É͐BS0Uݶ&MR09VŃ3Y"$f3psOLc>3%sNk1ۋ+nN#sr, ϣGʑSI;s4h-Rgqj:E @(&M_D%oK " FX TFH5@rBh*ANfuJ5g{t[1({^ZgT <={sV֪g y/Ib4.PBw0;eq0Vm<)@01 Y+ &@8ڛk8@j(@&J0UU˽+nZԯ4mv\>S<+ In-gf' HXn0~3)1]9aS&f c @TZ[-Vg^f3q)Y1;ә 9trܓ>8_2Vz9 'kg\x;͉T;[eUD_R~i,ާBD7l^A4|d2WZF4X8M h0PUUG{-WSAGGFCns/.ϼV漽y Fb;t|_oWuHfhZ3 h9;e"/@ KkQiT(Քnh8a& vFSJFƖݖG2%xĥn~'{p#P oGр$L Fu"-F`_%NELbTA,'4Z0hJ¤(}n0)J Ŕ 5GղkgS;!:)u| "bj59+7G_7<<8.`E rɰsL`4RM%,@T ;7v:R|l[hȇbka,NV {mLvZu@b8h4zTؿiaĉaZ%*OGev{;6aK_b;2M?oF/݀0 L>:r,FATaF(LQ4fHBU`vύtzV5viQLKㅺ-==`/#-3PտWtڋD^+szj 47r)dF~P V%f@ Ԕ&*`~"N}핶۝`[S3 x;!tayLŧgYӪs P'swfiD4^ZֻgQJ:4,>QVGUz6@,>>GPF!α` ~N+`d! 0KQ mdnY,<*yλ3r5ܸXbnoS_1VcPrjPPFrPQ0-%~pq[ L j մa lTEHp װ8XVew󳛫nNLA |5@W!&NGp@cheQI nv[˳6?1v89ax\J)'OSF.Lޡj,EFTQ5R$3;{ۣvu7r8 %xBiNO"FyN~'N_'r?}?9ڇZv-r7?bC;x:h $r, D"@\nȿ 9wfb"04XY=p6-lL 7oY Z׊Z(I׊"Lc: ?cQS-Ϝ@|2&T'*/a1tZDBomߘ Z2i, k3'4X}N}O7N;w gqh쀚Z8c[ȯoGokgȽ,w]f_SJ/Uxꭺ˳QJ_ͦ?0q^ܝq M m C"V& DAҁvUvssgF??Դ\<\]!~jvyuR'cZ, s1=hN<->Ѩsv.pn*$V+&iy; {uU] A@ UJgQ`y-P`XlXG@@P[7um锠رѡ(?-Jr/#&tZ,:|4 ##vA'CʖCS_FZΡ?I3g[_/%`%جNE ݞ f=-ĥiMM!f>j̀B6w8s~;E$Am<)x.^8 *(@! ~W~A*ƥ@LKFP% IGp \ :[mo\wƢcU-K4|YL U*s&+dF4lnv4le85XKw9zº.+ 3'ݴ!lPHl\ɵzgoow 1'c #M`Zdd򉗕 ~7G} )Iq 5gJ 4f@5O_?s~(IQwۜ(kE+{{!Amjf=cܑɅ5WS_j,Z:.;݅V7Iroڛ'9P4)AQ73:4[G枞;;0L_1@];̦9J ZB]nݸ۫~Ӛv,Zց}Ii~`>O.TugWBjekn׊(7t ĐHm DņϠh?ǚ=7nǝ,@PS3βNbE"XF{hOriA[VVG8 gii<_V^1womck`f8=? `&4L<Ђ%7X\`u\ ` `;4l$`U+juսN>tƭIk[Y+"q`Ї;4?)*|~uky͕vX^jQ)g00F 5s[1~/r"`#_NĞk D$՟HZJB ¸}udeLdr!j, k=?R f駖DHEo;s[v¹ A'}1`#Fǩ҃DbPR0@ߺg.]J,3U("ӌSÌ0d+N4,9iBTUM3`mh$eڂ'yaem-}r}~٧2gg6}׻_d2 aሰSX U Ā+rms+ǚ*@D%~$<PUY\l+(˦A7wqskV%]LL΀F&"" }j j|M+ʅmlMV[~8f1܏Tvۅ͏byfkyf 2m :e HW "d2jwooՙ}bm k>%B5)]e-Q '~oFi_WohY@Fwvn] !?KI1aۀLH8i JŗW .I]:4b/DR mmQ58l'޼4,W4ޤ 2-o ZKy:X_!cB܋S֏lC}Aوb_,ml1zR4-,K$sc}q˦hlު'5~bPJ7poK}Nǟ^| M# '"()&LnhPj\X[-yNJHUPk}6v:6Fe*hy>$ǟޘ_m; 'wW1!CІg# qi {|% ۖXFJcESTp0cAdjp_p3e"~sk_:P$aR)L0̔?I37lJ>hTa[oTv_HVŝL ɽ0+ 1۷`Ak EoSM3V#ډ`i[nAWO}vbR.Y}\|pCӺ}Թ%eUT+xi\ceR)P8 lQ-H%d ,AKgXY]9WU|M\3wod9[t~?OJ>J!FH c̈i~ KtԹK`N Qb0㍍ڥSPEYauGV31cx-Rxﱺ,_,׷g7tZWtG_?۾u};N"G3ğ ɘ[3~`#J\o^G?z/8Fi @b) E2I1'{E-AdRBհcsmF`)^sXY%|5Y/B;Uj՟޼FHP_sޟC_4I[7㾜n@ozP'Ki(h:"6B!,vQUNerjf~z\`tb4. B @25,R0vg79}xFrmم?l}GddVG GHVp6ow~tdkG!4g lLEXXV EQS4<8#wlYaHbL%hhq3hݘ~GpWЪ PhM Mo ?iibbF=mN~qTj´<i6SA/ ɈhNUKώx:nJ, :`8Abu`i%vPOvbcUo\+j 0U%l`8}hEDZfc3LBo4aօ6 TÛ9g̺L  67kȺ熓u\"J(^Vj2\vr"ޡ?WGް/mOٷ@[ºFoɭ~YQ'z~MHbF G_H>пb~6BC$j"J(cVL"Q4&z%nOOjHx#Pk|?4K80X՞<ǟݰ/n-pе~/nf GHi 췌 ro>|Wa#]# FIȽ>2S] =XUJX/mjScMێKFk7c],Cz?ϯނ秮f>\?Oݽ4>$"3XA&Mb})q}qm jʿoمx-|;;;;ӊPhCK~h_Rǁ47w4rʕ8ۗzo\ [\: [DdQTVNFV`Dl@-uV6kbjk>cr.Ñ'DFo[$Lڍ~ٚOr?΂)60mrEL ff.'n}]r5Bi`S0D&oӈ, ƻ|=8q2#1̱mM}K£kȗFy.,lɤ{]w$?ٞOj^R&60_iaC+,c"ђ+47R?/q7^?VGeAM@@hR3ExJlnVE Z?P)uHu_g[{hwGFz``>| ۓ_}_zwwg/Sn?ai(cşHP_cF#'$xGv{@XG&.z#xW6o}6/.vmj)(¢nuE)i:jAM%WmBUPJ4ϞqmWПM ʿ> 4?rvhԳ lMa?PlF K^QT#<~qe6ESk @:z;\ 'TaӜĢ'А|%--h";h? X_ ZpHCÉ':>._8͕'Eixwtf6ͪ6B,G ڭ3)PpK#t:_{slsm6dg϶?wZ})? k[ȉY TZ[6A1ͯNq dvI6j`DnƊ(SDqY:uyچsIYyCPPn{.4jmemi,thۋW3ܸ>j{G8׳+?w4p;叡 X{_$ueEX9~qLHB-PoGքLQ" tk9[ ;;# /!-! }>?C1!.\?)z_ ϨZ0p i0Z﹜];e]>ۑ20_PiRX%8}:tr?t /V3'娀fUDFF\PF(G#dy~pr>: ϟt_>(׷gs߃}6c\\RQR:" a$BN@|?ӱ|_ Ʌf ĹA?2"qV(m`jKQu>,M\V(jIDAT?]LL]V۠ Vŭ9֣, u`p!SCg8R.y./b7qys!ۀ{ŪVvtB B#3; RH(!V N gYYG%\vgO͗^lV";x;c<ys÷>8}"c\#&O< oS~5..^xOā@Nj)&bBگfewIv}fKbBV5Ųƭ9 NE"7;!HA`ډ]7 eyYW ³Gn1^s|7lv4:FB-=}o B2haT^0.?"jY!NƏ< ;c^ IBE{_(m0V +}Hh6ǵ_\WWvwhu&]F4XDX88a "R&]3LKR/<",CVȊ.ϡzgoxHb+uޠs'4)}\4)=Ї`ZWo` m3>=; _9|;WxyoMzSg @ aOaH;- haU^ydAQU8d2r )!,R,sd2fػ/gT̚hQBjC8$*NJ;#g0Ȝl:Ai #Sg">}S>~x Q7 ?A)%nhDvw病iwlvr\u>QZAkY"Yy (>J*UWW~ucc_Auz/ԩU*  CX%L1c"R(!(G;g;R?7q/Eag{s{۲3EQ%ŅqARC~lOS$;zoX.*5w#7.vٕ|;G1V @%*""ZR<>}O[ُ޸jpO2I^+J ;5c|:"BB%DP0sN'~iƿ:޿1:.8)ƣS읙teOV,9)")}}0FZ (l9g3Non]|qgZԭvٕl׎nꦩC֤3T~aS JyV@bsư?SB3qg%"_`ꧠ!u#x©- A<@Xc:fjvv=?|&;//˧m:V/*\~Q{[2( ;4cp&&jrZ?7)JCs@mcU5Vu8|Yۿj;ӂ_W\^~LJ󺮫BMů!L=!@I [M"Qwy,7ʒ s9<@W*߼PbL1QUcSX:dTqS% $޾0F(DiS  )"/ww&Oa3/ӷhht^NtnN^MU1NFٞ`{{,e#ZݚWuSCE5DjSxydl@#$ 荽!)q7!gw>K?z4kEǟֆ ~_&@jxTsXQ h.DA  @!"REQN]oT/ŗxYuZ_阧ZUeIXq񨀋0һϓ4<8. i[,5)}Uw!N~~'| s٭|}uѭE]7utۍX.z6k5KS>)u﾿1o~C @&3+$L->4CQ$ H`"0c?ru.Lƣݳ{e|pyVM']n+#ا\93EckRb:x\3Edx4X>i;4MiSêjv]T0*3n n-ۃQwWժjڶ!CCIk@\{}S >~XiC'wX} A~x}>o-|j!qI֞O@8 "D.œ\ @ LSJ sZGr:Mvl?whW~;Yw5w<1dUAg GEA% u{OA:жCU5XU EthڮȻKXNY8ee-]uWrYw>4$c bNc Ѭypߋm 8'z 5tH+y @2.q}M$:B::!3 Xܔ^(EJ 00"|k5lv;_~gMv~^rjj: N~lq4$"3<ϐr 8EnGsȌ!@}]]Gy4MI_ ON߻FEƝIm\dՍ;˫W>>ϏWM6!8>\HRx}'g 6m=t[7_$!m5/OcY4ɛA!"ݘ҈Ik 8*xPh)RF79nڼiãex0L8y3v;Om=Ҭ.-UkxA?IdFVuQ"Tި'{;Q?%xrz"WLʌu[EXL(\յkpQUuy߆:/ Ҋpk7H]!=mS%2hTCY,$$x"#BazTQ(vZ)" nx~), `g؈ $sYQt2w:s9:V878Z˺40r,0Cs̩Lʜy&a{$$17ub~i dR.N%o--`~/ށ=}|@ P>Y!Iy @o}"~}|gVp8VnL!PN NTIk$d$)DA l\59,˲xRۓb8Lw/m|峦 i9\.fS)d(wPyRBVi;ϺÃnq`8^VE]7M}袧\4rkl; FAr~. AVs{V=/okp7B8 Q"-%VA("I{c "Qᙃ4D5˳,,LbD'5T㽆M.zN  @ll)H5<=[Z#D友bON~O~+/{-$b@lSQڞbj  #>*`HfhmF@kcũSլ(ʬȳto'n Ⱥ?x| @/D(#q v~ E bG!l@A83@@!V۸DY'Sp"Ѹ(Q!.| 7v2H1ѸrO\#ST{%5E!R) xEh3 8GzơYQo}Zmv$!4 Q7O/0mmWn6$qx܋"bK PyGo<|[."rQ(|E1466@!b87%7b14}4Y,sΩ-TETu4q" FT;)aSMXеMX߶>:|gJyX}=3Ӌ=E>y.a >?ǿ+5)pohs k\E'FҢ %cyZxky B >kgI@q}+_G&DAF <~1TlXd&sEE0'-gJ,70T 5"AI` E_gƯߗ1r:X{'M<6 5= 95"zdGяR$TŰ.E2(oR6B[ fWj )zX+} iB#ΐ?يK}Izo}ֆwǎ`Ǒ/@`D {`xJlP Vqē7s|F!nm߂Ec l.X506Y8.VvL ',OæA }?I6I JmggN"RجoVb@ h.7Q!s+߿ iE7 t1VAeJK&b}}ҐWb{ζ0Z>e A@YWɓd1hQ.&'AcIk º<'1ɻw.f A/Koπ! GUN _ 0QAjTd}nE .A@D0=E."T9 i";5F-IM45_d\!c}?F$ k_ ""bcrj|{ὃs. A*4ߌP4bv}8 |H>hVҫ ~ȨV}0Hq̮Ql&=g] Gbz{7-|%Dzx#kqSp&BT1@%'D\l\aWY<NjQBTgJ臙h=H&ԹwMjN8{LN`ymBx?^7%hNN UAx`_za'FN }|; P X~EXSZ*u+bA /#$hT` EMc]zm5jKtı85WiϢd$Ɏ`%v1dG솃J4}ITBSʩx@[A%^EX[W2UAAb)!Tf;5/)pIiEӯR$Iy@L Ҧ`0Fg㧍!Hk!AC:7pyا !!]DנЮ5c bB88ЙT@eʸq5`K#)`Tb_;tEXtcommentEdited by Paul Sherman for WPClipart, Public Domain4%tEXtcreate-date2009-02-13T03:57:27-05:00dw%tEXtdate:create2010-01-11T09:43:44-07:00ca%tEXtdate:modify2010-01-11T09:43:44-07:002tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?%tEXtmodify-date2009-02-13T03:57:27-05:00uCtEXtSourceWPCliparta$tEXtSource_URLhttp://www.wpclipart.com/4IENDB`armory-0.92.3/img/armory32x32.ico0000644000000000000000000001027612414772654015121 0ustar rootroot  ( @ a*a*a*tV3a)a*a*a*a*<0 ^,a)`*a*a*`)ъV<<<;XJR[1a)`)a*e/׍Z/;<<<<;:Hw^3d-όZݓ`ۏ\s555555555555==<<<<<<9*QzFޖeݓ`ۏ\5555555555555559555<==<<<;:Iafs=ߗfݓ`ۏ\555Z555555555555555555D:5?>X====<<:E]fffnigݓ`ܐ\875;555555555555555555444/34[5?4>=>===;AWdddfBbf?=>=<?Paacde}WB]6b4gݓ`َ\555444555444344`H9xAx?u;q7n3 @>?===HY[_acd1W9]8b4َ\ݓ`ۏ\nLI?9655MA8yG~FzBx>r:[6@^>?=@MSX[_atcW9՘]8c5фRݓ`ۏ\ۍYڊU܉RׄMՁJ}FzBd;qN:w>t;@>>?>EMSX[bW9]8c6{Hݓ`ۏ\ۍYڊU؇Q׃MցJqC664tD{Bw>t;2@>?>EMSXZoU9W9]8d6t@ޓ`ۏ\ۍYڊU؇Q߇OM@8344344f@{Bw>t;L>?=EMSWV9]7ڬd6q<ޔaۏ\ۍYڊU؇QK444555444~V={Bw>s:??=DMSVBWb7e6g5Kd6n8ޕbۏ\ۍYs555555444ZF9{Bw>s:?ܴ?=BMSV\Wb6Yc6e6h5j5l6TߕcڍZۍY>>>z333455<85{Bw>s9?}?=@MSW]73_7b7c6e6h5j5l4r7 VVVVVVNNN666965zBw>s9_?H?==MSWƘZ.]8_6b7c6e6h5k5r9us9q6"?0?==LSXZ-]8_6b7c6e6q<{Cx?t;555VVVUUUVVVUUUYWUzBw>s9q6D??==LSXZB]8_6a6l;ԀI~FzBx?t;555555R444KKKVVVVVVTUVsI{Bw>s9q6e@==KSXiZj\7c:ӂOׄNցJ~FzBx?t;555?555555555444>>>WWWaZT~F{Bw>s9q6p]P pXGPI`=IS"W]GʁQۋV׆QׄNցJ~FzBx?u;*04555555555555555344578{L}F{Bw>s9q6r^Pr\MnQD(JcUf{Iݑ^ۍYيU׆QiEaA~F{Cx?v;I=5555555555444124_DՃNՁJ}F{Bw>s:4r^Pr^Pq^QkGߖdݓaܐ]ڍYيU؇RC024234/24d>x?u;pL6555444.13rVCԈUډSׄOՁJ}F{BX~Er^Pr^Pr^PvYeݓ`ܐ]ڍYe555555555yS:y?u;\6133\K?ԍ\ݏ\ڋV؈SׄOՁJr^Pr^PpgSeݓa܏\555}555555_G8z?t;h6[ߖdݒ_ێ[ڋV؈SׅNr^Pr]O k~555G555555E<6{?t;k7qTޕdݒ_ێ[یW555 555555,14{?t;n7oVFޕdݓ_ڍZ555555555,14q=t;q76BFݒ_555555,14e;t;q7555X9!t:? <|߁>><0p?armory-0.92.3/img/loadicon_5.png0000644000000000000000000000261712414772654015134 0ustar rootrootPNG  IHDRr ߔsBIT|d pHYsitEXtSoftwarewww.inkscape.org< IDATH}he?yޛ $^ùӍdLC^@HJ´2IstcMAbbBNEL! b nln~{wzs~s9U%]H)(tcڞVLUS~j-0#iCr\`+pL*MBy E>/LBŲ2cj[tU ^U/'i'Ey`3P~Qd'&K}e2[ s|GϘ\`#YH p> +n&<ދ FP ْsϞIcƌ6~@1N`9xb8@vEuĶ;FuD>ڧvGv U8ppFD+5n1ON" [Af]`@`\qq&`9 AkLD;!!1V6̕Tb ejemfPTKvڕ\RڬZ!" =: Gph&UhTC\X[e pډ<(kr[[;2%||&b&<x`ZjLqΔ{`Shzƴ?fڙr!6bX{3 q"u.k|5δ<ܜT;/39d̮jy>!>H~pyy$etO`og_JXZ `Пk Tѓ+o6YUM{1@OU3Yb̐cpרް9>zMlKGv틪o)/-/[,4YY߹jȩpe8b'4`a OfuhUQ&160 8ef` 1:|#Rl & y}&;rfnsYځ=}2P3zxssO}ĉrzNmik^WQ讨P`߻v`}v )H~+\[3 U{yj0,K=t'UCrcn WMpB=li\ ^A@UXq\5;J)L((.5fjPkTK.TY^.e! ROySt!LT 1GU`W^i߶k߾LqX'"ϋ 3˹ %b]K2=N >9ef -<,fP='u* I{K}[5vzOK4IENDB`armory-0.92.3/img/arrow_right32.png0000644000000000000000000000240012414772654015602 0ustar rootrootPNG  IHDR szzsRGBbKGD pHYsIIEtIME57] IDATX{VEg>,m],C2r +zQPibAF`=DCh-'붆R\>v}}~߽3s~k99g\bNxT y`^d~2B瞗Ks0 UqayӖS4R\Bm┅]9ͳJUW2:f8ӏA#$|Lx wrV>Zdb }Yڬw8PM !"c ∠4fYzzOUDI{jB& 89ܰD 0" zWWO]TNzeWsh IX'1x8qIX>9_κLK{8g*pj.ObcI8a™J$CC( mGhֱiJt3C i&u98oI|1& $Hs/D:<\\l܌z[Vq֣(q#~}V~3w,]\FQTL^kBd6(D8QbNQ9X-e%7x]PLs.ѦZ a( Qq +F' B`m¨ͨ|Vo1[N0(FL`?D c@*o4VP8:Yw)wzjr>-;SA0LH$}IQĂ*\k~<2v-?=)LYt }0`М#粈K Ta0q>Yz]u{xK(۾EI E~#w3Ld&$EQH&dW%/$K?ת^ʒ(ɔ55Xe,8儜0$p;)"wFs..syp3Ŵg?3![/>C9* g@T!Ca @J*(񍶝 H At['ho'})sy~EQ@sA e(!NIuSդJ A"Sf0@UWZR$2@@ P *dOOiKx/M @|)}8(A* @"*P%#$@HJ^VT:{# Md!hzJ"KKD '} >27OHod]hP`@ud $pJyH 0 N"x{ @ .PklǐPTpB(T> fM4S1OOOe|CYBh RˤS mmNDH:ZN0S)2jSRJA!T @Qg8([9c)5"=,H $ٯP0RJK@EAC RPxh ?*UUhePQ*S[??ҷ3-s ˊ-Bd!$(>B8Rix>.ϖQ#a , !N٣2 A%@(j %9R%0U%QᠢT:*T:bZIlB&(x%K-IU 4Q PH@{A͡Q(U >(4kP @Ȩ*b‘B DG$PU-Lܧ|_F%@;S@[ R C F a99:"* xIQP\(A & T!b~~ iD ?J R= qRT[_AI Ab EAU5TzO*"PIj@P~ˇ:qȊtSkX(J4|K;UGH\VAP,~0RHdtAe"R)p@)(AUT@Q2PTU*%jRljN(YqqE|jcb$Xa^@0DB20B(%kTh *AU \PB %lG1Z0@U4M1қ`=Ex"d膀a "-[}UA @ұ^$BU*(B \T"A N`I2Ίp`ߪAmWj([[zMq`5hDAI`&"u>($je@C* UY;PpBP !K:U) Ĺ1 7nz$HHhɬ[2zj(A,@ګX j=:RTJ@EI`B"Bb1q@ͫ̀+XXpV68h?l[b}UBP DC@BPaA@ePC1 `5 JJ%5IKxwl #enf_;߹.n#M qtA\J kz(V+,T-g^tC"n(A) ZE*$EDqHG.Ϡ >xc 1XT%35 q4"Q<5zQ264jX݀ *cTEADUKkXknOOF{jdn\E$B%p -!jYg0KŭVs$RtSa0CP`\BD$kv"d" WZV+OI2T3Hr!b0`+煺WxWzM|Iy0,7| 4 x< !:,c@H7"(EAEUTYaU֍$ | XI!Q$?W07~;o%D& s DKh0mD^""  GRp1Rw0(,`uX4I]5JFt+˽v!ądV;B^&B#~[~C |Fh;a[}2p#(y_?f`gny=s-Py(}5h ASà?{Ճ >y @XT5(tb CP=*EBo >o7fB'i=hXk)4BJz._]:U8@]tQ!OZr@$IK2lw^.Y[lw7R'W:n|2)֓0\qZ!O>!BOGMҠRitTm7wn [7v,a>!x5y jJzA'k''C1jPe BBKjOcxDQן~ϝҗm ]( z!yU` tN+@3<=]N($q.˲v;XYntr˯/&'X-jq XN}A -=:U+PP(i$ !4ಮLFH:}4>սtV7s}k7_ ޔ_ zy ZyP%Xg`PDm@kT9=A,UE?=[\EȢBKL2EBk@2q)3DD *#E^D̽G !)]HH:$IJf'9=Z>+N-q|GIuLu!?p 48Ƅ%5=QHL5R![Ε]]z}pV`<E>*˲,5*zDm,Z'Rq'#dNҷީE=n(og}<3^]Oy^1}^C it /f+#Yh~U,\߸zckooggw4{[ J@K(;1;t If^_[7F #Wml|T*C>z@-Z*Y iTh `^ D т>Ϸ77޸hB,@)̜g]bPV?-Cv-K耐(\-fǏYI6^X8xmYnRZlFd>JVߗW:) .C5dm&Y .i@\ dB5V4h#e_P|"%BP" ;~64ᚋNm\ѵ_|p~^E k YZKD1<@`T jyE`G+dd(Q`|ҷ#|W߮`MhLRTŠ8#΂#E2nT#4|'&f;]^YkX[Xxi5?j+e)΄᭦Hc kYHie mv5H6]ڄ$*)ta'f6F_mgPc帏|tŸb|0qgf H µV.m |2^{wlaL? J1@U[-HHd)3P8@7ˎ9t~$"LDs >Pc>uD`@B0Q 4h$k4ӵ+g_<Ғ^uAp+ e~rI$C kt,]F^]:TRrXc+R}W%/x`}>|1!Gz +08(8{?}ʭ[hkRt* %)o@% D#I  ]Ry8|(͟/}K}I2!j|D(F`bq&Vz0HD$K{ Kk -_`>+n;(=Pu$C쮰[Ga'SdڛYb} oaWG+ROvy/-^qkgow\EI> *寶$P"X~r!^55(kH$Zb8 <=ŋ!F`8N`-b|XJt"nWG2#k¾Z$I ˍ3N/z<9w"טo[Y9އyYU IhVꮡ]EL6o }O`|p[Ṃ>嶏W֊le|ZqoߐKW>=,6P\R>$  oFTCP&h:5rg/~ 7.NF"q"tP&wB'ˑ`.~"y3 @Ԅ[Μ>4~5 \;GI(PP|wUx c̚]ˀ)~/HzYP'̾] U/"ȇU>Ab%~T{x(!71عGr$S!A\>;J~޺w/_{;QEjPEQhC^#9 6@F.EQ8-^/| Hf彴a˺YPAEb<XǑLHq D'LN s绷~C.*7_h&etWN`1<<(VVC84{&:I?kЙ祉jR$f$}a--l]&q?˄| pEɝ~?۷._35"ˆsLB5 sE(Hh B,dObPj<.7=d6LT\D8yBGh,Z%# 16:_<;ua E/-wՠYIvO] U]U]mQUڨ:}T0Na/ Ig%HZ92(c0좿s +::؂-Hf4V'v3?}gw?[[[h0A+ ;P,4h|ʆ bO0ʠ-/y\SɄR[7:9' dJD "%̠5YcW^{Է>;._/6%#}Α$E{8VN}kg"ճlxcVzGY@eG(2ǀMN}"c|*IA(#:ҪM _Vw/Zt cmy>޺,C$5| *ƈ)7pk fj Bxy$W7޸4U`J&.xP\B$tZ0'0w?%% ĉbN/i|8 7K{)I^<΅ZXK|r#UR֩J\=(<{g=+/.K25`)Å4%FmH Y!.iVqõ쇗>F 42W""CЩ e (I+ z{`1?!dp (BI6Pe=0!%0LU5!fF~ +/ܹ[md.fwwZMJ ̆@I YiIOO*j@>Ǻw}{3ƀ;wz8h{?y~Ǫ:eC59@s% ͣTU= iW( 3Tʯe$I@!-+ zBILIIE$0%LdPdI4VWu^coXbοNkrK vW/ ,K^bMw&ġj#FX4cc |hsKKh]>$mcb h}kPmtNvl;i#JuIE=.T0q~ aD'J}<7)K,$Ә7,VO:OIf S 2Y5'O/}y8oK'.c`FeM,ȍs,K^fNGlʣv-Yc}2$?\@{aL&|P)c">Q{pzyn8=`:,17&y13'{!QuVDEX ;Ox ŋA%pbxH2&"gEĕ_(YLedfBf ˭/7_,p秿\}}_Sxk\> V`jKɁy\{E>xt'CD{a 2@}Y=v]wWZ'ֺ\돴(&% < 3et "l5u/WE RpΥ'wJ?EZpFP41dF_b=[H(2 3BRfͲFqޯ~_Y/?e&5ױv+\;%itћ?!%|w൲kZևS3Mo0v{drdQʈ7pu] @$'!P7{rrxl0Aj@=Q*@DX˯w}đTo*] tHQR$1,ێP)>Ę\V+@2k6[/ך<ߤ?fQˏ0~hckx^8NTE䉹sXQgywư|f4s}̑Pd_"mY:e1JkP}ihmSX[vC.JxiP2BvF_e@\8R \<}F3o15;DNtL@1IĹF(X][o/(~~/םñz/~MS`a-sOBUo_߷Wy<*B(CC N^ t$4L B=}~@;܉;w8Lͱ%8Ct eɀU$@\p*p[gV~'6hଞ/R %y@D+;ٗo,c}(BtF{)}nO=Nŏ,3cdFq Wߒݟ|3A]΃8V؋_3ytf_ϯ|cm} ,7@Yk$`=:/HFO,-aaw4ʃ/8$9z՚`*3hDN؁0 /?5F0oa=IR @MDl8B TJ{3Yi~־}oO{ N}~[?mvz\;f{hw*>ڳ%—X5% ]҈VQB fE>|8, Ő.{+bgv,rhV)?*Ƙ2K<-F :8:Q ڈ{`JSƘ6_gobS&Ւ; l,XJ=3)F <4Ѩ~ZP@X>z$iuX0A^Bg8p6l|b6n;O׷#_@UeI R%B(Ѯ+lyNSa8s,He(\;Eb'"X?#)Qڝ_;S|qoG\Os_FgٞxD3*mףݛcXpq ]ڬ?pIcL&ǃ`4?pd|rsonas+ zOuG)6l44yu'fO"Q HAbi"aw2-2'l_o[o_]+U5>UyہL%?;c]LXU zO 4;}>&`dNنA>iL^ n6  ]ٯ?{2'b|M9dIg#d]5COH?K ?q.;qTW|ů~{{1yc<үJoldhvWh-r<؁/"#8[iSqso0BR%. BAQJc6= \\,p q <6o/U8U8q1F!"iUW2M5N:k~%aǿRo&s@ʤƹqS&s՟+>Poİ(C1ƃ]PFgJ` F3c8Yiͥ;p!  D:\XB.ܫ/ORΜC`I'dI!6m3fexB +D~ͯ{#9ii$4xٝ P m쮲J"NN63;to8x0u3ȐUe-{J)[0)`2k;/ұ7NWѻ$( īȬc/;ǧB?d|տWy*Oф+!QiS:O#[hf<tqc4rl,Qu: +@W'7h c ~GvR8{r&m"6E9\d!2VzW8۽/~{~ˏC+Dnju,1F{@Fc(CPP raycqYL5PyThE2gD")xݏxd.BĚ|q!-ї:FA5yko0e}iaʬ\2;:Ih}$YI֊F m[xbt!4ŀX][YJr`}"ؾRj@Q*P(epW# 8s,)ĦwPhca(K{lj4֏|zg}K}/ +Os:9)۞QýzIJ5fg6<؛tb}qi9l{rU $55*T*ʈ:8 81wpI(\ hz\Gt8FweH~k_|1}v}mOEoJq_*7^~UC"$7#dm&Y{r( $iG8NRd%'[WSTb1fJS 5A6\/WЏ /{HC( G.6͏5_?T7ҋ_leﭯIzK\>j{Ga(\>?rd9>F'zP kv8Dy,6JPlJ}|5.Ȕ5𠺏`. C5o&r,%M=?!1^āf՗ϯ}}ʿ8 ҉WzKkΏA_9>fo*1@C68ؽZB9DJڵ[ÁFtR=t\#]83{O8{zJ(lV(q"H(Db/MӴ/-}4C9bQtWp&~̕~ 6xGZ ؏Up' ~f* d˯|0  XPAnPih*Hh_;=|C3߸8AŬpt.finlLWJHFj&lumz2ߔ;n>(U;z8, y?9"/1|Fgq 1h P_ 1o~BB9nC: kD*T PK 1 QwT*οvC9ԇb~71J_T&)t6S"g$$-g] R믟} ~OZ19@68vWm(\M\tIȚ=nV3!HK ־7_D*P= '-:HH֚x'oxI$.G [I4Nz'*y7%,;ϕSս=+3'Ʃ8%iM#? @IX-~PVcWZ!"Tjz_?[g6F>vGgGN9V-D(Z/0[\\nKg^:~o;nuJ([u{W$ioasy2=w}Yic #K [KV\]5cca1UP).r\|"ڭ1Dn'RE^ SYe/_'urFVo3Lgm.?K>A$h/rtp _4ncPz!F5ڄZ`4F^aF qϖ~'+lz/"2^2L$"kdJg|ͪ#K_ >G&:W<;$>vo\ N.k[rՕE$P6@dJmȨH$t51N+?*|ŋ N$E! Qb"H"?;L4~g_xw^*GD*;'WE\:ϓ~ϛ<[ޖ>(0LP`s6 ƍOv˝(l`2(#UXSx9!~\9u *:? i#K_8oz1hctc{^ٻ$#Հpa+l/l`ꖥ!+-%IPhFDH6ZJSZ g7)$sLEz/P N#-O5Wr \X?[,?NnKB}2[k25l/ v]w7Q D:WHoJqwKn-q@4.$1WGKx"Dđ ap_'yYHɇĝgd'O]9qa{WS*k/`$ֳZ4?_d*!.cC mtwmiRfoAC1XoZ=3W.r_L/AHqq_DV"Uդ4^=~|U?Jg͗"X:vQ-s<3xyx3^KX>Zd,^yXz4Afc! sڈ/8璍'{[_eWIP4XX?WS:ss(|֬@U!6?8Z5,9Pᵅ_\[]^pΙd FL0 n.v߳ P/zwF+Dt /_Kte?gB[S n`92qX8ϴEꮊr/sgv 0o сpđX0fh]'od5Kh Bp "[HMHr؉ޭ >ON*Z 쮞wsyDkS@_`oCe^m2osӞ.C9^|}cme!ILQkC*H L4UQP@ o==R Ѽ &34wz/UINv҉esf$ұ9wLd"m v;c+ Li+NyH 8Pb@tp|ܓ!GP€@J1O:*8[\\kmo./osQA6]:牿%eU ؿuE|``^;H>zu}y+" T@?i̯U^T96LܽЧ7޸,sqRU#)j?Ҭ,oV+/Jy>O3|幓qW)B{Co _l'K8HB"*b ,I5(hSgw4淁@$Aj08 QS$k3Fe?uS?FVߺsyޥO{i/huVOhlYOdYT:$ wFůI(?wL gY* Vƒ_s+ͳ$yp_{qR|Ttܧ1 1/Y4>HYr}of?.Aw,i?yWRKu_}U5;K'hp _8\K4QTq4L~.3"F*( @#I$2$sҟ EU,疋'U [:Pϳ0gboODHtNqJ \~cL4XWp衱.YUB@'Ho}  b[]Yne;JM{ۋǐs ,Н˃c^kb/"h/@qq |/]vά.v"b+$C#(J*A@o#wH@Zۯs ͛ "TV~J5닋]0MW%:'gH̓syU1DC9%hVh-&lǗJ6bϩ 2m[@Vq'5;:h+ +,85BT hyHlu3 .<єhvWh/ fL=Rɇ vf C!cYB}WlwOgVO_# @3$pwGR pTV`jx{YCQ5$ڋY}?@Bcw!DQUx/YvO,v:_?|ԟ*=zwIA !Q~CЙqjd@+vkaL\E6^بr_w6Hu6U^D 6N,r%e9گj=8Je ߾mlI)A _@U 1`Nc q,)_+6{hx\dXt QnVwaWncV;[ *t#7@QDÑ{r Q1P)@3\Muӛvmp2,ψ+J 7#Wkgp2ƻnmh5ZLF8Y2cn-e !(A(TĨ@[[Yld%-%hA +*FXdG}2s+%U۽F@ME^6H8"Љ9"֒ H}DȚ]dgvbF@BJ) T5E kR!)K ͕lpNJΊy&|y&`rGb-Lh钹"[kkYZ$ljG51JA4o6 HF:!@(pBZOuZf:G{2CRw'M\@6๓|xóE  Z_nghEw~0|NlQc|ެ~|SA@ H5<*騤X`*$2wbapJ}>cP?\<]0씨*2ݍY=7Z%1j1P [Nx =P"JP((KDI[o ay&E&Iし?[lH>ܟ)Q15MXt_K,85SpJ0̶E8ER0;0%% H.e, N@Z$١щs2owyϕ*0쨆Ir4ڋ8r,fNو5 84D  L$daAp\."H:U "Rɐd-Ys!ğspaz(IF61(l`qe! `X/:e )BI&#<Q&(Pg#DmXF3WlbX>`匬Ճ\yz]_D +H\ښc$ngJ'Œ'8i#5ɹ @" %It@ @9V&uQmig}!D%, (i"m'/Jd-ιzgd=@8yHI#O0J)iAPAi:Et(6:p!8|^$|t0 D5(8]rLi[c^Ab?4y0`-!(J*H"U !?@2|`I1?n1L G+sG~<[(̒Yk!2~W =ve)K]{- A0`` _ԿiSAE*P*]B@)1h3ɡJI{+tyG4e.O^[RA_ 1E t6 d 2#:ؼN+*B J? `:i QPup e6f$QC:H6С Sv+C}9K6!.}4,t-7mYVƱeXJ xAuBBHQt5 q[_n0X KOe.ψe9FaI6;@7Z"Xwb&*+&9xXP4 X*j*T%hU`h|ʮ!IrlO<=+}l`*=hYKal(@ !*H o$PV~Mc jA*dhދ{XS$K &s.GQU İ%BB6$o3 LV<@@harE4JT#VXB**, j(@ 6t_Pĉsyy>i9W # ;%/!mgrIReME'cX{B"yaπ:c .LV~$lI[dc Gd2^D§$\>n#t;VT@@eYe57.ąݶ)\APWBZHUD巢bI2^,G R+ΒSsE|~H2PI7YVx8 տ2SͫU0;B5vBaŕ=zND|3eLn蓗%wy,n\// NLNTVD 2yV ;9BQ )?0# $@11}~e.$ /Ta35o(#D/4Ue`:h8GaxE]L%f٣el &Ps`.ώ<wv$[$'ihh=o9 0!@ ʮu012 ay>V&I2˺[;8I Vz^TT̂S_ST^@ 9JtO :ܛ<}T?Ƒ qT^%eu/KA>S7â #{ %5#0Ccc|qj;{㹳5>\5=hIqι|)k⡬UZ+įw;{p<%=9kS!sŒiA1ɝvşW>#G Ke^x:dn]ѹH!+)UJoeНwW|] 0Bd @=S\ 69}\yOҸEXGRr[<28],pw" Ut_"ڿc&xA;+9H@^;epy$ǯSCcnw&P!Y?I;DPx'd$ e_fdbD3R"Jg`=b4Ts KE&GEKi]sQg= _U/ޛCʃ;p.G8,K@ ޵so3|W+rbpYOR5 ;a#0+ 4_'`Ucv(y@B̼5"F`nùWLw*o{…bJ $bl ]r=IPK+Db)EjyHsB9*I|\>GBNْ<|1a'㨛ļ<$*rF PL2$|E3^g]X'$")xQ#eR/BHҚ')s+HE q -@9Nj:(0UŸEjPbպgt$EW H|Xؒ˜,@1> T!xcf>vI}U${)$`TU# K^ɠ qvPhPnHCY<>܋X (ٝubtF_T a4(4hejO@+8?<جЩ s4TMePP5) @EC4T_a5:\#W%*isxB2iI> yB$A&C@xDL!VeG = !0 =JB)$VdPU̓toƶ޸hбVY$VF 1 <D\ٝ|T,~ Q>*=+Uc. h5(E#g $Px%U*^DH Am(jܭlPk G5Ca}ZB{U>,P=.sydMR>m6FV!TDjUQyFcߙdmӇ@Q*[t>& @  2`h&{0 K(Y`I UhJBA 5Pθ{m5G$ەˢȇ{۬zBgP<03T~`450P:o: |JM'$ 2%$(i:{O4} dH(#moeYWZ ^5shPYX9%@H8/~54f f@&$ikVc!4ZKc qDH`<6V`>Vv0J@ TE+1@5p*!qqx3'PԒA *PU Z䟕b avU=Sv|1s#LL]]g@TĄ ʘ4 TzK@DTJ*P TW" jn A~Hטh6"`t13l!s$zM$EƂÞ1fF;3 C,}; #04RJ ʪ:xhߌB6JxTaj%=~4;aCi,V]2ҡ|<Z^is/y66A6"\sENꂇeo"LiF/ͽ ` OTLU%!"C6@PQ 1 ay%[@lÀ2HݼT,JUqEH_G4 D-76i< %9sU-ixT|*@3//\@ATD( TB(Y5D1`tp+@xZ=${ϊԊZĞKE5cߚP4սOvky *h 1F?@==M  Ah&h?(`nK0[M6~bՋjৄ#pħ)-& Cl/LxH[(GBn.6?B(KX+ X#£4P'HB%TΒ@5;ppP\w?-50z{€Y!/_fg+y<˴sT$E05xl_gc:]#[Y,P-Z¸|ʪ5S @ {m{sY(`0K 8] E>..7\}_V+I 7`++ OS JGIc}lXO,xe؁|fnEgdhu0be p򍭃`'=b202yNBc_ԻdHW- xBbMe'a?h[M upm" zBAD!/I՟?QJ$k0suRI(v׆HU Ա, Vi bhVxE$،!Ƣ@Fo x_^ܵGU|GB}c_ O8x7܌GZG33 B\voe6`{`w/HZaWn\*FGe++'I@SwS;?_B((% 2h0n `{RRUݭѻ[͟ƱO\֝:dj ƃYӯQA~:̟عq\g-7 4 ȚL>}1'hU?le|i~_C(P02y''wܵ޹+PШ 6)(T@W0j]qq㤹XN@Wt'we z^1GбϝWp>a*>OdO!H v?,-^QʯF`8\-t*sW7$T"T$Pj:B=t?(Z?,,dk7gupﶒ$x?Bq96/rnGؿ. [SsWu&">'nT pndݹOc{ªQ?`4&'޽\cSt @V~ƀU*Z"qwf~P`[6^"z7ol_;4'ػy8< OJJTa³3FڊNuo{֤Y_Kq}(zye՛;/8sP+@Yea-59C|}L\` 5 ZB?Y#aA?~yZ)/@.n~`0=VUvӻ#rcޠkF!@$6bJ%]! .M]1&M?Y&j(z#%k\l~cc9onT'3AOH(k~*AEIUdT(^:{O;Oˑ}^O2 l0O{! HA@҈Vh=c.R:بjIS53BT}y8863$m6;D;=$'nu-?ڊO+#%kPYU|{tOyOٛ_][7HQ!POBIv*y̓ :nk(me1@{aicꓣ5;VJIqo(]HM I=Ϥ I2}Rr{s]@ur͏~yצobdtA~?hh8(te܎Bs0T 1.;x~s6j9J10F1 *=X4X(P {? $g~+Uv>y[@(|rAXF5̲z8s%æۺSsy5;hwW&]wC voܖ$'~}&? B,XZ_wiź==??FjǏ<ِ{{ώ}sgq.vȇ{عFTNJ.]yrJҟbL`ޗ`Xw胖!h  ̓j=enrΆ8eEkQ: I5嗩D1͏At֟HOnZ݃B]tA 4|ĞvRJBV[ITHA񃓋t}1B)/^ؠK0@eq=I1'y.*Փ/я`m>X8Ι䃽ǀ}}U#'+=z6UDA?|f,"hl䌸@" @f W"Z8~_uiKcBOAzO5Th9xI`%m~0.U=^~O>.>CUC1"9j?c65'ipL\wy(I/o5X^,1F08&!?p|^7&ݑL;O'縞"y:츈Voij=ؾ^C9FSzu⏮^ʲN WʡBrU X Z1(l"2J |hOXYX)PAF3LPYWhX=7` w6:ltJ +sydBt^XLG-\_0ۺf/^?wo_޾}[}'Y* G1R"#s@"^~z(Ե^9~h*EUUP,`?*B"o.<8-8 >z` fw;H2;W~_y/ K~Qى>>}EL)r%-WƊ;B"E~h ￏ^>o'T^)kx pvʢ,6gx7Q_Z(Ph4ܟ41Hݴf`y{NqX8 oZ?zֶ/C@gԜ-+叝jqDo4/~C;‡:һ4U#y#{m8qPjt#?r;'V -OOP! 1Z 44] >gx ws-DpubTCIυ߽w"LGQ|Q@=vaY.<8(yk^)."ʤhbcd.P 8{cjSk1w^011ԉ}(kN{?e ?.ه{GALa@Ȁ¾ZͿO:&(ӮuJ&|8yX$BWW: Y;6rDB@NJ{cآ;r40@Z5!VkNz:aU2akd F!P5! *x?i)V@A@Y#(Rv.2sy"B2K뇔|GmT_Җs_ ^ywُ%>zG':&PD=1_`?je{<#lΡ%2Kчm@U ̓4VFPzkSmӉAQC.F`.۽8oJ-rԟU >L~vkkkcܧ7+G I?'1e?|d |/IB֨|X%fK` z^ +NJʃFy+0#hVGSn'7˲:h􋫿U,SQv {z(~&tK/ @ͻ'zY)~ Vn* -Q_^Z()O-h(R$9dl9+N)y\Gwq@kgg?rx7)CdzP7b[\uL){Qǣ _׾TjWĄWj<T(&X `F_Bp0Jq *%'mCY*L ˷VfyE?;l>F6̚xLGb8/``'ϸTZũ̌ou%Q1.~՛x{Wcb?R~ VǫRؔx{^}X\7]8akk`0,w|Y@o_L |&\`]]b^`6$`]xF3E"k[ZChϾ"7qk3*~?<U0޺_jOl5j'inmC?-K^ppMSacj受D^Vq3PX97GDqyPRat(NΚW~Z?|mx<XlnG6Os^|4S㴁TcInҥKȾ!ZzRzš7G׃AAJ|18Su^ bIdޗ-u]W}r`Rl~?@M@;n-jVh,EIL5WNw:g>B2rړ 7@:z9a!M0c8@.c__-лLa:|X67~wTu5??MuJ0Q4akW/xo?{W^{&N&BE̝iﾂLut}Xp% 85'yS/O6Vj9] :\8A9?] Cν'+& 7w A8GG@]Lpb o>_}n忻}ow(17EWx\~˘_ti@x=@.z+w|ix۸z j(YKz@,$ƞ®sXyzPglmzWPM,Mstn=Y ayopyoc껺 9X}'$9e__7w{(=K*/,@Fi!z!$]Ĭ*>TsΟ/]_;~Ntv͇[ <&Mi{­?)'|WXLw1]D' i>~go\S+#O Ha:/$"R,H)AT0&xa7#"@$~tʙ+xe;Eo[!-P5XHe#%sBʲ=Z/wh{419m,تDE]RlC'+ z;:q*'H&Hy!riZcN}+ >?+5)$=`Ư,W?˿ŝ[~,|< [X1aCX$ILh$5d"A|0S#&zڥkk۔{Lq)AVm#l`yYk a6/" Ekv3V8I <3ڒ Ivf(ը,&b;[‚ C\z{IY. \`ED]~A^AJQCXC3  =cuV(C3;MIu (M!cFa@,V$B0M0%A$c<67F^L^~-Mk!42=ol p1ܸ$Yo 60|1'U6z\{taٞ.>$\S.X? _y*c\|[>݃ɤ,T!ίR@X P9K`@ }hl&^4w<]OBYC XGZwh%`EM fd2yTD6Ƙ,z [k򗮬)&Ž-WZW/DdW>ߕϙaYhF[H1aCM;L2F\z^s1C9;oJx; V=/$=|ͳq~o~s0TW$+gJ:@IJ aE (+G70gw(oODZ2IZ#&!AF% C $# $C 5y677Fߺпk/؇W{n[e*˞DQX$!nIo7F~Izf%zД3TMo8>M"Ia!moUdϽxƟo?lvv'e(w0(euR(h@C4o}'%Ҝ*g77K I 1q͘ CVZ H2HUP.DHoIF֕˽#)Ʈ80^qdD!!Kæ`lZdW=|OEMؑw5\S.g,G M:OTz$9moȷ˙ya~GtʢtTzTjUG(EXRAXa5_|tYX g o[oU@׿M^ \vQPH H]"$ Ed2d"Z1}c^|emze|+w,s_Mx rKLĩ"H{#IڇaF$$4Մn8>#튝t;AM$ _U 4M@S9rZ//Yҧ=t@m6ݘݙ>y{0quMC.jTTѕFw qll'SH1Mx4y~ @bQCݐbĂK AJ  `UZb*1&K<׳7W֓mǙ+5 `Еev_jh]L&D ^׽ \ ;.識G/I` 6J&nmbޝx2uY;* ^]}KlW+%R'ЂtrOPаj>A:O뫐ƍU5k7.$#:k%aL`L0 1Z}@hA OE$5ƦYˆA~y3zi]<~s^N5Xߔoq'~7 /U>_@l1)m>"ҍN77޿_>wO*+CRKTdJ*mQ"XCPM>}$)?e@7٣ x HtXX  &%HjMҴG ⋃] X%tjC>wy`$h@bĦ=ͽ#tsxtvvay<EYwu,}5(5DpG~5D*5jO :@J|!q5|Vyo xk`=FYCy%!` `t@C%0(tB#H IByD &I(_&í_W6 kI5{)#i橫tB2pqy'(M 6 BI4ͫdk2iG<ۙɢYL--}T@-"5F;%>/X#j}XNC;II1h<%O >$卛בT@&r0Z)@hw1PUA ŠvX@sD^AVID&IǛ}իr1HHe+M!mowo|> If5Ӎ6ŬI&s?ý) 3ۛ(*ijһ@#zU6~N5B5&\;OGveR#<#<_|^o#)k W D!I#+PB3QXQey^06'idb+bmI˒8u~jAn]2居F3 l*zx+s 0" xbFɰ-J.jigM6ߙlQ{WUSUUsQ똣JJYgU 4BT B;@lV>M5uo|~u$zZ>MD0 6LBY` hYrV`l&V5c, zyb%lkI=HQe4i.M& 뙁o ' M:NWMS{iuC[>$u`d^΋o<ܢ|Q{OzSDL^8@HPLȔ9{/@,~W_$ì>D lH$'o9>5 ( ֱ , < X0*hJA٩ `т,>A Dy clfĈR(y& ˒ԆE ד8t>ߝzYוwu|**eUOpHpTeٛHCmX{]'uAgg|˖5Dyux&!Bu(k;F@Xa(40b2""k_ATf JD 5( .O D/ypV>ńGP#4p9 /lW1zJOP[X뼄QZ,-zWw_ߧsȏcL&$hl`B~>C* h *.c-!,H#"4S;`uI^,wTF}a.BVS VX-犅^qJ?$ E? e qZB9S?!3 UB+G*PL Cm3nRo[ hs KG//b,Q6)(1Ta^mT"@$NڴtC-4Q9vvqZuCwuu g x K?G@z7?7޳* ruWP3f@Gv/ 4V"*0`0K>&,q@Z]X"D?de^ǥB "Z Om2/nzBRB5J7/SSȍzyz 3Jv;J(&Ħ#H'`ie[P P<$+ʏ@4q@{eK{UuxcE (9|pOܞ>e [еw.| %kT"rAnx<X#Zzbt%T5NH±UPU2&vA x}[ =IA;;o'`l^@ˎT'6$ U]#aS%o#N(7B>3gAsa- @=qA@  4 riB"0z"zX@@$eKup˒+hO} {%UU6S%Ѥ̋DQ#=]sc3kd>gcOJ #Y BcFc5QVj]3Fd֖8$ EDG L2$L2$L2$L2d d^I$_dҤI;vldv=x nXO}&)LXįzs31?՘p1%5\}?1[L2JQQ~ҤI p< ~+߾01([L2 #nf,]&M:Z;])5T@D]~=v|&!rLZd.]'~,D*I;k$p̏|ߢǯsg,V+L7 g^?x_/LJD"#($ +=J@-?wƢc~q.;}l2iLe} 4@ @Fh8ID'O}7* {*f2'_>qN>my8_ W|UQ {>fξr)(ǷVU#A0DsxKѸ|#~*ߟp9*qM$a"T'Or*,!+Qĉyn8x􅧆DƢz y; \@gL| ɋ4 HHDn"r w&lU3䋃jOG'Mm榍PO8i;uڂA)l6C 'TD\Z/Ǣ_k 4~/Ed"Oa7î{/'knѤXk{y|_Bv_5ھcx=]yX-ѻb]rL 13}f'`&@2Ac H1 ׽6mT~mwT(ЯDa Wͫ JG@$A@Cٰ d|0lЊւPZg~2k^+ֺA2aXt]~sRlB0@)U V#ڒ RkETÉL[E:aR %ð$]*%?)OAuMp},)^_'Q0"6|cAQ0T0a@+QxD\.$`KQÑ16rbYzߚܸl+"a4Z6DkRj(m$aowPcBI |߯+aث3+z?.[ѣGw"!"C J7‰D=9Flk"9@y# !, c#g-Rc _q"Ć'ؠ~Yt l0XKk! a-ϩ9RP( ! D9WZ$ZONߓ}V)ݖ*Zk/1Z{yuHb93\ZիOvm;]'s$(#Ut*2GaxyYYI=yKDoIֶ#TGnZߖr}rt)jlRWI7AZZ[#"{H]Q,◜V=S3ƢyD0`E},<(ę|VhSyO-gn{ApV @>H,M=$6ɿI `XyO@V-~8Laɜe'y  2CbȐ!ˠ[>n,N&q3箬<"PIÉFc\[nE6Yv8%p%309pPk< 8ID ,N}HQbX.Ҏٙ:Zk/s`v׻k⿝ J) m)NwAKZ^ax ɫRFk\Z`76a49,,hCmXx.֮I'xjkk0 @#F`~\]1a>r61Fk`6B@R/a{)r!a<!iWZVS &0Q8 #Kt> km!q@0 fJwYk30kDZlm04c6Zk7Zk1-$[yI7qD BCW(qb#v-y3L46P(x.ikkyI~%.:mxF) ð%"RX@ "ֺ @_C}y%b+o2e!d 2tRhX͍Qot,Bwjjjsmp{qRJ( R(Fy݋hr`d\gZ#'"q,/첡.OZ.uOWJJ{y 1,)*,>8@K ǵ!R@B\MJ"֠q#ׯU`Μ9: 'H=0,-,Yi@Y'0YDP7zϠH}0 Q^^$UڀIJ4ml%e$C7"9P۔`.1"-'OO Ên]Y(ebo3<C_%˜1[FDE=#(]Ԕ,Bk=?R+ˡ/cJ$4"0 OpRʺ)É^[(\ LGuR1@l(v. A-vYꩧ0k֬@D.v˖.\NBgK<1f{)'"ɱ wG N9c8b^uuuIH;6A'2KcI~#@Yk.c>UD]-v<b;en!+RA5b:i*qH1@yA7cEo}CU"2ZDfHEj m՞қn˒4vz :6@P&VSX |tCp S?y6 }I`|5-W\ "&"1ա1:62+}h>0<nL!RjVKK ˓60"})ҹ5XaH^=a∫BqW<ϫMI" px?z? #<#uԋ_Z{Q,sM)Uqs4aVZ :vTL6ANzBIJDNSuP.%MA U԰TM*%kzwOo+J~rLwLHtR+%?ڳFy[s" J0Xڷp5׌5p{/}LC<>q[9k׮%ɲ$ϗ!kKUxkWIVƹ}}Bk>]Gsx`ƹWR̢"m{6'"ww/ŵG(YyeUw $vJ3Z{C$i\.MJm!^JtiGr];n5/v"rXQGy3/#x$Y5t"#A9;Aݱ L5;ZIaOlنIR6)Su1}R)fsbJSB+qUBwm1'h*D߀~ԋC.=GZOrͅ籒Ӥ^B!R c>A5@%|!ZI\Rjʓ$,9zE.[[x+ÇR~*%=|qM_3לWnp5?=}ξD<]N` u"c/ioo2Ɂ.i*ī;/Huߗ܂\T 0{kBUBu%H'"Iq$wn`qodOqeK~7Y!Rjhz1M\͋UG^<[ߕ$GDvj* euZku$i8Aas} *KPpx~20.U'rQ $S:e-?w m* Z@tt EEb=Eɜ0 $yQ[z)yM@Jt&M#EQDnZ)1'YDn9q<m&"+tJ $RmmrL0-L֏L8lP_ԹE2ܣOsh` Vg@-8|&dQa1be^7䕈ȗRܸ|/ԳƘ791t֋*n!E BڐT y2bz`o#*PwxW#gLЌsмonI6 ~wD>we;5DF(/˵mYs/,~i4,Z'Qd>u=0!zkmC -v n 1$ק'msNZ;uHD $:5{ 5LcVTfBx]?OU mK [\K.n%@"@(-BF2yM)FP ,D (eV|R~} mF ޾Ђe/ތ`rXS(U Gn6 a[#^00uM&?h&B= }ylF!mDh"^D>ZP(xR,YRjֺ_ }SD><5E]ԲIr~W5fr ADdIWc5 06444,0`܅B!wX %;s٪j֮}?(sCGp\'Vb2ƌ,2V'1ܛTKk[Vi붚vׂsڈ`)n* + D옟XvkvrUmGaвn:BD^0OWlLFn I&>Jq+P2bQGM j?jW[_h^ cQ%͠x}C* c:=ED4F_-k">@@ 3L2_vHDG5#I\.o/ڀ+̀G|쀆OW/!芁o ڎ;@"" J,9?`@k=;5fF UIJmuOǻ%ٜ F'a㾓l&t#U|C_TgbB1178[e``;;^vE5uɩ8qQJo<G'Ե555ϖ4LC_AW~>%ę'rJ;5Z`j3Qҹ̎cΜ9/8d5 9."&e?L_(ZJÉCIDATLaTc]7hU9j|5۹Vjɡ$yskkkpooذ%ֶ͝I&|P@0)ϸ ~m#<*G#qm'*>q.uu/7$L ?Y x-rOAJ#<$̖'LI 8_b]ӍFlgLhi%֜-M&/@swxqݠJ5&{G0>%xq._<;$}O]t븋M1yb"f#7{X٪dK2i1ߦ}mvǹc/ieI&dI&dI&dI&dI/҉j-"IENDB`armory-0.92.3/img/visible2.png0000644000000000000000000000465512414772654014643 0ustar rootrootPNG  IHDRHHUGbKGD pHYs  tIME-N3 :IDATxsǿ%K96a'!!nҐSʣC Rcp+dz/|pfGc3sG{])Xb%Xb%Xb%Xb%'~gzf[Ky|IIFJRZDQTTg4A4*i1*iXGP+i[RIRQEZ䘒bc Hz1)i2EYOHu@MI%ݗ@ҊuIq_ t\Ҭ$tr\gA鴎 c#IX,P>3.阤HCRkoi:dl¬5UYr4[^j IeXP,vBDxcd>iԖ I-Yi䱸 9+WI4<661|nvsI̷cD 3b!"a3;h-@)+s͚jiRY"/$'"%ذtg 6%DVg\nKpCG&iæm,|ٜ PxNVcB(f7 $?sΰ?&/o$*q};LaIz8';a3.j#>[mJˍV7Aqw␇[s滛')e>sìH2 &nƸg_!.ku2u`9K,4=9 L܀һ=fgu4.˵Dĭr`شAZ10M|VMmù;YX)W%]w4%yPp‰ZF) LplfENXa$b$ Mes0% ypƯW{b⥈5]dJ:V؅Edu.SWM:V?X6}/I)Ed55r 1 ~ +WL}(7&_6fؤ0ǜ{S̑s I_&sMkΝh3QMbv9\72Fb6|Q(yNp9( \識Zl/ts#8NE4y3],d?trM<6:9Ë\ ,I`O\+ ,F|yң "C\H@2M8)MMV%)rI?D`Ss.-#<{J |3xrRޤyZ3ͮ((Nͳ|Iߐ}ƚR_9qI8iգMXTf)FLk!k3ws/.Q|Li˳<5ϙ g޻e3 Wa@q 8vq٠k~0Ψawa3݁7_ş&`Ηws?{hmwd9JpMݘ\fN׎`*pEe|19X1KEkQ"]o{5Βc9s&(>oED9SUZ!0rH+o|s$s#S T17Ө]E4 ROsvY63viVQLɜ)\5/Sa&}7Jo~MB?"yMM08ӯ9MzoZW)nP')fP#f-<3rԋhǵ ^Tf6mZ 1|vYl8O Ky$LiKd} ,_z >&^Σ&3/Cu/B'Λ0>/o&>$ӣIu6`3C&t=JعJɪ;4̚l~NsJTC_z5 =gҀL(sByO9^7y|u  , '8Oٹr a1u1qOxߋR]O+?|-%+ h@G<יP\e$OR4 ϵ?d?WX=G#"iFӣ?~ɷ~}WȮz;)*/] V7L .+.֭q`d`5ѽ=\ էΕ:PMi@sk)Ve'`9O/@aڶ8deX f?+.gg^rQvHTs9'B2y]ڢː)C.$7[s3*|+߱/9tZ)?S8ux:DJ/ \2:Aqq]u;h쳓-\XA^'\(z/D,Q7fK(INc9-t5BgSNbDP@Śi\pYOńqD:673*hʁ+*BiX#1Ɛu'Gw?Ub;mnPxIIN4 ˲'N_MA U% GoGI^bh?{}]]]1c"bQ'kOF0g)y:P*{iG?a(On KUED>|Xd|2 z2Mnm>ȹ@p DBeM6:TU(VѸ欝Pm 2.۵x" W @o5O4< g_`jkkT* ?s~" P՟_ TIpáVU/Mf ۷X,66"c sA% ) (p+p%ϯCw -PdՍWj6#ʪ춙\tؓi xDJB9guGg2D, E lTyIpۻ2H,貇/:A5BE |gTUC#04 ߵsSS'3h^_o=hJn0 EA b|`E*J.[7e=F(W._hLnBAs#8l[;xu&^ f( nAiAhL#v=uQzc}go P+@ׇߺ 1>R(=N45`Ud}eVGQL12Q,X"b/N0SaK"VhS?ab H@ٯ2`ɖ- "Cל}GN'ѷoi}+:.b< ,gf|M0LGN7Nv*I?oR='[!oe7ZM|# UE|.Blt`DkZ=(}si/ DY_8б!,/<@hڶ]QvmQzZۋ_}/X4^7F(6_r(jWDo2JOc|@@Aj^ XYm?V7LeNgFn6Tg^3A"ExilY,!j%C[,y5i 'X/^Κ}ԯoT]*>u_]U]IENDB`armory-0.92.3/img/logo_vert_black_text_antialiased.png0000644000000000000000000013621312414772654021656 0ustar rootrootPNG  IHDR!%RsRGBbKGD pHYs.#.#x?vtIME IDATxy$uy~UgFae6Y@#U.,DL%hQĨxzCfD}9kU}U]ݧϙ3@yqޞ|? ?U8P88 øCM6a^"y8[0c'po ~}1o< Q1ǿIWDVQl$Aspp ᅄ7|ƍx`fXTx,(V[N;88 E *N?,!qD]O7p[뺍@:88\+6mdXKN֊=u[9m-2tVwpBwppx.i&l2K~ Q^7t<VX'MnrΈw3vpp ῒ7mڔvyZ \ k.6]mןmq;/yDQ"Se"s4\ ~Ú%8-–?Ćma۟mr')tl`֭Ƙ9X0yzJm)†:2wppuka(EYe޾o/_?0oC|ǻWbÆ l۶s9FѣqUEm1܃S;fVGul]s8T6^,hg2xoIh;[qm.ܺn5 d}eL ?RkVy(&}?ƻI]U6;ŏN^$#oJPZ?E苿!7\}/oJUJ낛}ÚDA-_>3kָg't-&n2Ϻlڵk.%ls[}1 D`< fVq6n].|%9ymȭ5jFgjb1cSރ̸k,A,0y[6gČ7acUNT 5ZwmaU@/r'w'\;!\.&wTP4nO$_mӤPNT|R]v\l*Vέ(wCjZ^c-/)'Cyk׮Y > }sd;88Ӈs9iۖJ%Z_;ԉڒD@[񦦦ƘUƘ/$"BXkA?תuf. hU፟zISN;88Bwpx/מ}b>wuF>)'eeEr%ȕP[=M*}?==gy|TDXv%$\:h6 "!ı6o LFHzZxNO>辔\RO k$׮uoz'eqe,Wy~Kgn뮻8:KؖC~iHID~QD>''v:^M 45GPDEQ%@* 1曇R6)7IÑA y߇+\ ~X!{s+Ӆ][).&w7Ddphm'/UҵVaE5HNf-%nT&7.ă }Q;8W\7ro<1xV5=̯C|1ie?#R1f3swe@D5".vT 1ɏg6'w4&%+w_Gt_|=_Ƈ^A|w~>oU/8ɕaz!tm_qNn{EZ% Þ]ږznʉR25Iko]Ax6DoJpa~['JDbŏm'RO~>s,\ݗ^wmUI "GĠy%4%xg= WС؟MfYDEH;l}700,ꏢKM@ v)T8UȕtC]!'}ln<Q})% Ư /WZio*[D[^%wppS}\ro˯BVűk׈ZTܔ4Piy\Vkb߲e QuW^M\>l[ZJr^U// Qr_i~ӷSX4xyhDDҍ@^j^z ?/9|qv..M>%&9#+[sx[~-5_.jZ|gLZ7M&j[%'EB܌ŒT[ۤ]*䖂F F55lwzN>{"@Z5|~LD>%.T\ULjU:o:6cjb+{ jG1Z ?H` &WDHh-s ,.A8˨ޡtP.zy A?\>'|Bwpp 'oxK\vWa=&iTr-I;F}#t&^ubwq &Qt6o,Z{ose<2Aj 3k{=̈ǡvFkc.|D!U"j)ͬ5@rO$FYr~J~2aQMQDk>.X]œ#t,.~ՙ+˯F5Hb⋻QTL{hIj,=ý@hjxOSL}s{S>zp_qѫG7O׷1-[`I pٲeXkFj7>( ǞnO|qhNoQj]^N>!+\8P} K3Y?ka"%|#t.*+J23K2n\EUnҿ$ ȕj*3YV!*8 %cA+O谋n_/+G)Q?GKn`ۨ\ؒaP=0gPʗ^z)|~<%'j1 ECxܜBsPK|X<-O9KBѬ9IA埤yZ.oQ)KhC'/uG;&*xZWoui5mb\&~1¾ԋ0(xlPC, ew?Bn焫0Lط4W/F0( KK6ؠr&eBP^13g^kO^UAOnT^_ e{go^1?F"}Crp Jk&%q~I v8W@awǙE~Ror4 ec#[.o>Z"TO᳈mr`~؍2žM/13EѬyޜos)N$&.TGZ({ilzjUx% O[?3X|_ߚн܇~Ժ&\ b ^\v]i_y:[-|#P1UHh<_4q;Nuff0 [.2?0 BZ,ZLq rdb 6`F^t$7ͼf<6U=O k-uǫFχ|4rE揿s?t܏)t*`%!ou%`5i cw<Ꙥ:iyDC_-vK1UkDs;eG{jD~blH“_l1[/#}jj*!尤,"]AJ_]GW@4!6$jC@ㄸ(cQ #uQDT5 LԾ3명BCŒ-7q ?>z/6sI[Lw'"JǾx]!2}rOU1JIjywf>#2 \% 8fII|ުybi&'1覛Paxx3ewَp'ylxxXA`eڢ}!v HaU`- arЏoFҷh5^a(^ hzUt@تb3u"r߈?C{#8hVLsjn 7}kOw5GX$tzkm*0S7xC{()Ib+M#rF<叽p$b*qo6;ahjGm&2M9\T zs]N~Mˢݟ=WOŢ20KGxSs*i։GG\q Clol5^q(>FtHε\J zWiFY>rnݿ$Us֏s$=XzvmW@ڎT\ ^cE=^¥}67ګ^!ImhKlv*^A/`KKy]` ` ? <+>k^io z]Th)jaxHVP2DBZO=Er8j=CǜIiI4 3zUuz\R,(YrgW뻥bY~U /{6To|*[ws;^ <뺵@)P3mOLaI[K;KkÝZe!'r6 %^gd L5qbO$&+y1PTB? 3?̍-[H>U-jܵcK>dL.GCt dxmX>;=[nY9ݳ|TD>$8NmϑxՕL>~|?5!pxq[Ĉifă%{UWhaղ ''6vM2 ò|l7tT;BdCUm]Z]4BoUOeƽXJ !a´^ מ"YZݻwؘyދKEkzi38_bEϔ*iQ.s SQ!C?BlL}߂'7tTCzi8Tp]"jю tƙ}s*fcMkoLےiȩS޽ujӄʕ缓|w\3޳c.<~?y!˯:v}$8RD;a$nnB+{}vw!߷>#*lJ(Ҫs_~:$'4_*xwkQkEZAQ+4&!8)c_[ l`xK=FAbـy<l|`ѶVU]m>QQVӡ=AE0ԭLAqF**XH(Vډsg_~+܏' 1v3z0LU#\F9x2GgokO2ϑc|cċީ"_Gdeב}F AdA?nʬoi_OrEv8zUS1FDdTU=STQe' u7lX 8]s{8in{/#tb)gT&UT9ڈ nZLd鴶jҌ%N_3,gfr&2A]vUF%mCqZnг<.LLRY"QNE9CծFj6WB=-zt;bZ("ec R ޒS1}K;Tacj~&ESI yQc#4&% ` ｋ=w:8Bwpk IDATx9%gZ+`a1Yn bxjE?Դ=)QIB]\ y  s؉vVBjMFן{~C1 ]2 }gdeڠ~,Qg |>8-}6g V`7+>~>CQorGFK6n~Қ&%j k4'981xh^Bom9Q|}[X 8]EQhMo`ꨙ7Z֠^@-g>w:8Bwp8XzvbhLW('B#J[?=RB=E,4EpzQYWOx:s#]HaB/Qe1rBVfۮjA{x1U!PM*{9\>.ޫNlNgSix<`^;~UO(4IU7Y)+^ӿlc^E1^1.ҎB/`r;TlLٻzX`eМ|0ɗtx0E"]m^qҊg }AV+եdݫW!-?Q{t*GGa!x9jm|yHJfuxAusxqKAA1`-M<(*p[w ^iIDV-Qզń cuL^iWbVtۉ yBVO6 pL? P79~$oՔM97c( W !@|j-VA~qG4q6i7@Y*ykUm;FXzuq]Z\ҫS\\G#N?"'T%j"O"UZ|IIBnXVAařx/H]a{;?EZ+M%Z>nʿ/(V ['vYn)v~矴\y,DF'V׫# ʬ8J3T03 J}#9񠟶BWkUzٍES"䍲(/8%E:zgL$GgiT*&]]rZ*:&S /Piϋ;iIygg/Pϫ܂D50^VfêYdN>'"'hA8D$!~ s|[Iq_EtmKzǩJQfj%'G%;8'{^ N ցuD҇ (RjMKalLJypB͂/,@.(RAVA,R00ߤeZ쓀z<31)6k+4Z|ƴJ#垰l/ĂEZI891π  `zEzu{޾N{w'BUL8ԙ'T f U tufҤ)r j<-{]S56EXM]=bO3{vZh$ x[ރa qAB=Mnrhw}qfD3TK/)u |wO.'h b0('yYN MNEN3vC,63f˥:XfKѴgl£''sدQ@y|IjC)-'?h4B(MҨtMTM=;BzwlNAkQZl0LOohD8 9=㚴`a'NoSwps漞NL@C>`g7vN#DhjWLt!v\ BO[vgK^1V~^.nܯkhH(QC2MbJ`a@Y~ӴԡIBNO?!"Gg`a``9{pAlna+hH "DO`0"+JGg;Y[zB|oģ7&/6ݬ QFJ֬]_Jvm.NJ@NyK1vp,4ZfqJc^ڎD*#kژXy+~z xk﮵iyR*M;l1)k '4cHPpd= ] nB XE%"hV0 JVPFp.p &!nnБ%oEuP(088$aݨ%v¾cPof.xZ5/([\U]w;,6)*Mg.U!`:Gr\s2I)ҭz(ŗGe }X5= Y2}SCج]Tk{zbvz ZzM6i>KRP(6KEVի&3u:UUR&iܭCJ%Ll{6|"BX`fAm6͚Ir͔ wi]|O'B:%g$)Yy4)oh@άyF>&?Fe Qm]cE:K^s'9n7-h4RT y_־ =h>d4K#[ Yy 322rg:#?5~KW?+6|~hcV COX2 ;1$9)1眗͚Zcޗҽ٦U=I$ZSbW%W(fʓ(L:=l l kp׮OvZk|~KU?wn kBZ(dll!| n2.b,boClk3[$K쭯sC_mNH<5mm~Z. X]:]^{@V~9nkg7Pl!߫i ڈzuݔШăb g0o1Da÷sq;z5=("Vwܓnۤ[TJ]ڭgyRO$I]~j#Z~GZL6ΫNZ,9Pℸ9ʨs)~`Ðze=4jIiϞ~}BD+f}|l.b?묳tŊn &''+߫geettTŢJ:J]y57 ,;３,n-188ȯʯ駟n`hhhZ{|LD |x46?Kwltzk\؃_{ >vG~\2}^_~]|& 3~s,Hih)3teЮ p?6ܚaC Bw6+@hlEAzy􁤎=3'=HofnlucdѢEҲ/2]dItw7UAU}1˃EIf <t?rM=%{ ɕwbj<\JOOU[i ``XPXvg,-# g{t UE=aNwx֭lݺ5GP`xx\.sqmݺ!"_(><< =vV;D]8{(qB$D 2un/tfmY&թCM*ʂ;!:m|s4Pٺu+zYYqݼR՗]vY&덾C"L8eO:Fpݘ`v,r&nL#tG_LRZhvj/ +2S{>{,y#ڪA^0*JZپ.:i)_?ShDA𻐼)LP| TnH[JXficPo9Úq?ew>tURE3a|/z5ϥIx[-0mىE "InyB澑_8A!g!m>mZ װmj:E2MPEaGS#GLZezG<- ^~=|#Y-s fY~5[UݙT e[JOc߶?#$I#8gSZO9M)~›?P^ .7:{ϞQVڵ=ɪxHEC̎z_i8 pVܼ{\;'0 E;N:\vA099xgt_@C}a A&mPW!A &H`MhrVh619nfޙttaYjJQQb믴zj`-(s64 ۧálI]+F$SSS"A$7¿H]k6ttWN eqp3G^ՓԟL6-C[g_I ar=7% v+ ,VeF7KzN; ̻i,5=c r6T٬{;^G-w,Z<z]R}orP[ogܼ_;^QDQz:nbcĵhɍ7HT9T%% fbb~GT*"UD Ȕˮg/t/ 󶳤U3ɲ#s,|wsȢXEy IDAT,Bl9uVlgX]y.`|d{8EYBX;Q^ԻGNzJ&܂pJ s4YAÓzҥuiEg6ʇyu (?Ͳ2Ɗ=7#hj*vEZRP.ʪU]jj"jUe'z]˒ygBg8`s~Bwphӑց]P|"l`}M,خSkif[_@t$9U,.nW߯Qc k)zDr>;nS,)dګ\ֱh7} Lmi_ةov^vԏꏊKKߞ{_肯7oDQ"0 bbbZzQJZ[ \OfYy8;_&ᑿQԠbmR9*K ٽ?NwO#EE~]Z崦$Y d#4yypf?I4u>ܷf}YȘyt齹JitMNUݿ x)Wˏvmn[kFr%K͡kFU$"_/˻d̶ +.A:zܗowsL0Ǵs( #Fj/59zJ<6u2* 10\ʣ;/x+C `DMXi(RoT;{V,5>OAn(H={.;FuZr V]G.yمZ=3zGTpxVJTe*Wx]e,?س~2JԩSy#Q:m-0KShk*(0^kYsp"6S>nL/Y #DdU.&%stM_\RB8 6ѿ9^::mEFc_־޽uN){9"Y-[ZO~SlΌ*C X9}.^g;=NER:TK żQxaF- N^wx[??r\˕q4^~f1d]vzɺ즥zU=`|$Bnf] 9b"k]˚#tJy LϺ-16+#JM&R`s@2e={le'^2yۄF|l jl9Rox8k/\V5*P̺f6<"wxuCK.ɏr}fsCc6ZSD@)<"dު~^࿕CȂE|4/T(qZ6HEDdMJ٭L!C»MZË;_ ]˚#t#O*4:Pחb9m5rBoiCI/"öޏDX aiʾ.UKN E-|RB)ΗKS9 T(Lg]°p ?|Fz}2(~jvAߍT#,bO!*ѵ&[̣W^m}|-YRnϞ=211!" ,c5 ƀhsʺx'E[KvpSUMܪ3]>{0[ԣ6 =$V)5Myv:emV(f~m7rߚj|(Xm)3a$`xI[s8D>_K?oG@$e=A3larǒE] P}&&mX' A1Uj= z(K]eΗǾoNѪkYsx;B|V,ㇴ6SjCX(׶Xmh3Xl#Caϼm;~}EA)(n T&box:.QoX8GjhٷVC_w^?ooRtMV GF׋j9Q"xT_O[8??Y)>'z}Ux+RVUnʁHiJFƿ5)hGe";v) ڪgo) Paů|3 m"Е̇;s𓯱z!J7?1ibMMV{+WJצX/B!=qt|δ>FA &mE;!UC^ vxÅ=C-. Y9DYhkI3jmgStƸ">gnmq#{?~"1!VNP<5q> e|c* aX8e*\ Zܯ*__CmG4UʫZqr*=]9'5^&w |@D>aҵթHnulҗ4nĄE9ivHˬ񒐻ϼG26_#t`j3Ĵ',H%^]',"jQ -ֵE~Sت>TE`\H]2ľF~e8k&otʡPAbG5g΄+k&?,,]fe#K@E+EEVKG5@ A`Dw^cqMMG—D/^:_/W\qٳn)l2^?}y|x?GzRPNt ;8Bwpq [(n (CJ*f*?V:s ICyF265?mۿz/RO^"o~ro9a'T#$}Z;ԅ>ckg},WDT',NQ鬒lؽykz 5 bAx˭9K=ۄ؛c5*Yc(< 09lڌ&ձSx;8Bwpe-X5uoD2uiTœyUt,|[M p%䔡*2UT]q,vMF} &I3˨̒r-γf+*^|\C{W׮\P/뤾g) ,MrQ22mnj :ܟfqsy 2 aP 8;4݄bәv9Ku:mn悸,$4=YWr+tż*6O1 D힯e[soèĚxJҖ{N;892s l΀)*ƟEIάDȉ`D$3gU ՘A'9R/P%diAi^WzпP\dZ4kIY(|4?./F/ 7ONuݟ{8(΄j˴L-kV4吠cތ(Ip#tG&,zn{ƀru%H;tfǠTַ?W$&QI`ٙmoz!}0Vf\{Ԛ@$6534W 0ľ.28- Y)m7 *u^LToEBTH\"ˆTuppjKmk80D veMxG=>~Wy}A_ll292|K殽WuoH+Zs>" $}ӟVkN1]ixYcsL] Ae!DFEp#tS;8!\vcHO!YDxXTdýsM`lؽ&Q"r< H=% ";EwD s?ZX-f}N/C?,ொ~Fuzq BmE[0J >CBrEr$ ݏl$ހ}VAŶ^%3*vXԵe2?W1i{ / G_.},dpA e%YiQUbv˼{fGV('!x=D"tt['WM"i2wV*trv `j ";UH05ٕZS7ic@$+?Koc:F_PG\.>KZtY E^T`#t#[|0 d/2:`!K-` _Rj/[OႭ7@l:|p{~! :uD%^>#ti^uybӺQ GL`$6Q\Xdaz{'Xr̛k<%3n4bS#O"&6E%Ϣpkɯ^u8 DՄL^t0Cծȵ98Bw6C1\ZLWTl+)0bΛh|zZ+ē6ynC?G:$kEg2y#OoT-ڑ9/ X~= ڟ^E㔏N'LMdpm~S~tG yץD`)RoYku DɅ^Z6 wj,~{:T> |a_*[c2Cg+qiO/.cA=9 ĉ<}` qc]57A~c~zj6!VL:aXKvx gqCX6 *u.UF*I'm:oM!(-;λ+>7zZym|cUsy~}mQ0?j'5U9K>DxA\ZLJ&gVvBwpm~˻0Hg_'32)e`*2l-%[7*Jݷ4V450 |Kz*; ȷV̒+EW#D_!u!f61cu Vy~QP?# SUh /RϩkB2;O.馊놵C!1ű?{?uWNHɫ5Lb`3sx!vFɷcR[eC8~{(Dn&XtKϧq4v)ХDoÎj~œ/Twp;8BwpWTm^ǽ"R&rm\ӌHUb2dʒzUfv)n-i)^4ZCT]*XoG=cSo[S T'I^6i|/3ɓZ):Eu(OMy!3X""T'j:νsjC5O"(.FrzGbO܎?N =Y~#b2[BBwxsDž-B6:q֘s53bY'J'gRHnE-8S\TGUu q ފuh^bq<ۺ'ǚz U CeBGXPP{ -@:QZ]3>![Y`g4LW %mkZ*lj/ט$EV>Zq"qv,'$|o=/GrhX|FOjr8F~%Dj+6ZA[+gqУY'?2CgŭBBcU,A,/MKi/MZ䮙=!G8\dks}lOyM`PR70pmbqy,k*>0UDa ! IDATG#ŗ!QHߓ~򤪵;8gxcՎ Ǟd*ŴE Ӻ5)NfV"j^E@Ru*=#e`uAW^3& PZ[sy^dN ֒qS{ 7pG|[9*"O|GFN `N"uvC۽zЧ܏C+|Ѝ8d#Q~sM j X`*3=s'0&4 ;Q1VF豈׼F ^m6BoPM<^W 0TR{yDƍ&6&LJ^R!eȄtP|mY/0ƣIOO7rSEq7VgCP#DCAu 09HUA?B~fK=ʇ+sDyjdqNZPQ|{CTAl ;%POUēQ{Y(Yxi'yv-[ی)D5ŗ¸.vYlhn"[=`$/&uU,^)kq T1zJOoO]=>t3lX>=*GvR&,a }捁а;= =ݨ1i: S|ǿ;~‡+o^𑣖uZ80v(U7seH*URv==P\VJ=XȵMofbݵ*LT`U0IĤ4MZ3>򭦇6)D17GY%3,"<`?Ύ!}~F%)cE ~*h< 8v(v+@+)C%|\[' ~GƊ|}{ț1 .z[ c"<0&OMՋLW:BQѢ _. ]NCgE{o5X`EZ뚩!|j>W\69:GAT}GעŴq+k7rNջb.X*EXG1vi9jZNJƮ8ʸ/؏Z7*d6 ;} d39$hm\0cLz DZG2$j{ɱ\S88¦]֥px0)>? ]!4,X2uB5/Uw8zoxj>nu4H9-HSac"Az;ϊkYsp]kw7 *abm MQ_FFEOަTs9X˔:AI+3벪ZECf[ۦB7$|- F=Tt\ioser|^>Lήn{zFN#tM2oVGwN< tϞ=vٲeaE`TD:gg!~Nl[mq>6[NpQ#*_8G?Nۯ{r޴:W &/tx%ǺDm&*T O# aB>`֢sѯdvBoYl?#}0VIT{V77sZ>,!y6χ|pBfhgld[*L]c]ODK}߯ 8"wxFC)pI7{)a`-D}˦A(”6M٩Y^_e ^'U"RE3=6xҚGdKQVµzzfwm:)ġuڅP}:&}Ft-'2yr.V^Mwo6ʌ/Ո0ⱢrQ+JI+KoU{M6kmP.{1_O kX<ޒU17w3<;l޽:Urw@Jk;-?KyN\Sn"tfv ڸSpRu&4>]_{y~;̖aZ0Px'J|6z+rꪫTDu֕+| U=D IvaU'}ZDT*۷w^WCw?&_p'|(\AD6b$mn- 6 wߎ^p<Ǹm-K9zLϰg9tWgѧ8U830?yfn7S2 E/.gr;'p˄V~_iO:Œ%+T*.00RcOzt7 &K٦JyGOlygbwpLg׮ G5c|0/ OlkVC^JE_ :B,'VUŠb`mNӢānNB'Ӟ6.ɗgv"q(~#eC_%GţR:3׋4 < g|dWc'Npi:;;rM{Uw};ERBj.k"CcAUC0yT5͗;8D9T /3W+hTOw)l4Z?+Q}*v&LgHy:eE< IQ6$-n؇N V6BzќGHp—r:!^箦9w5VEq6)g~1-rC$M6!a&}{M60 0 ;Dxy= Xд^ʪx1fԁ\O|[/_zi r4=C`rs͹kĹ) 39E/ FBNYbd^NH&}2˽|>S>ko "ݴnPU?c|>X,VvB~uK_:v@I9ăRTj,mj)0x6 *U%Q.NiuE2 y73k?.M<`Ywtv՚kg%t+ɦ* FΟܶM$-[PVA*52WU "ZzcccyV+DTsAGQ7G?%_U砯аnPH߅\ï ru~O:ͬ 7&sfm=B r}GQ:Q&T E/\¾N]ad!wM$**6~߷oNONvcJxƍDQ{Y[|g߾}lܸU{7JE|ϻ@a+DDKs!vG?ַQ5q.[` n-7Qۺ ٱ3Z-{\Z3Zzhޣ՘+GHyʯAJDU& \ĢEYJEMZ"2e$~z Ð(( 200w^ʔdaXP(Fz{{7*wp㋛W쎹鋛%z }--FO +woR܈!G$,F5 7(tKJRNjKzڠi컦3]=ƽ./Ϋ x*>J(eX$/¾t6HsQ唢v3U τ-[066ƺuؾ}{###{-a:Ynn߾ݩrG=ދBYb)VgGfdS %2Z+ y,g~U:? kO%vf5%3-w^-.uuxTH 3PA+ٱ%~|b\Nn 88998FD]] +.CEah WOvզSUt¡) Y7(1p,xm7'5c&yDLoQ~z٬(?䕉LMUz-C:I#ݣ#cUŒL1АSN;8<`#ywoV,K"I\Ҥ=Mgv!6"K"H¥ oA+xIxa X5T8[ɝ7p_XQKǤ-xZ7k錖" br]1o+޲}[;8<:^%.Xz+z@bZΥSӴɗ- ~MfZ|m^_X˘ SyXSwl淲kBOWCsY&\X:}WᙅmW%Ԓ0wąsQ}ny;b ]#R܈r="PW \&i;W>[T&Uya.OP#q[*FڤԙN xP1F:X߉:λIU;888BwpxZ b2} ]JH͞U`݅+[xl,9BS>Wp}{ z5@D~^ʅ/{Qg環z Ht8,"(VU߿+vp:|w :wŷiSx 0n\Mn-C^?eDf= ]7̍CUGV>=hN<?D"e A}ߍiu6ox`bǃk" T(V=b.`-LY7֠#0~lgXODz;88xNo}<`ƱSՖ,:-M)=J_v~u]<rUuf6.Ң)ߜ'>i!pY{.~?"(hcQAB#Zsk \|("?V^T*y|((1._( IDATXѡ7늠0u ;8C7tEdaDDۇ% CDP`ˉh`!;N;EF"jw0"{2buWA3!>]y~g1iA[<񝹝ID5]n\w2WkYo31^x&_7t .""#" cf7{t.%Ir^7px̜7\6A2O¡Mb-|3*"'Z%vVSHй CDF9}6L@ߓ} \}"uDf揈ȵ" "z,Ѭ7.O#o3;D䒪ѩ`p-3HmxiEJQ{UDk|r< Dt7cL1fT3ƭrKDt h bbIjkf»n/f$I07KDrfw2hٽ"6WZ*ؗd]f|3S$wB)ޫ~|=@|43_d;QJKS̹y>3tc/i_q,CkLDt1&*53@n1 ]ID'U6FRj :dˡg:vNX%~9Imڴ=@5mBϲGfޫ 5OI*Tzb0ԱյƔD$?P.y@c̯z/1u<{}8;m*H=I$ɿXTuZʙ9WÌ1L[p!"|r0"O g/l(v}Y7B(󌲵yK{3VWYY$yy3USOb曝 (h-]oCYg7f~K+uFн=Z4O#jI䒖ky8$IzfkJ̘ a槹kVZ:@?TdTЕ˴$yZј0K]I2+MӔLD.U͞VI/!MsxPl$aEgR^8_T+"r43q y-1sWYK4XYt 3O-xeYSD~*9>gH-wa"Ns?\YK*(T`pkܻ$LD*"ayGe=f*>яߙ+tOt J"P582',gcy}nkwkDd+3bɲ ̌nLDpOGc?;ETd'Ƚ,fjYE?OC{>g(%8DJhe r]v=df^)z:s=&1Q{ Sw { | щ$Izt 騁oxw?V D/1dYCel=viEVBIN Ro;=[DWd'a.:B(4,@q+]6`H)2X7kx_vnͲwD6z 7<,k$ kkxw5R~sij{$"t+"ƵҚqI':"p٦ٝi<[מ$4d dE$Tjufl~MDLDӟܜ AذuGDh9}˖- 3cϞ=׊$I:D k%n!yzDPf>#˲߷(;Y5yJG_t&"r^RJ<}mQszEypI#D.D`iXs֩R.Oa(|m0^]v^{Y]]u8s__H кVc8`25婈lp?EnW#' zdf(J&8ktd):Þt_9A{u `H-zM&5NT"EEvfT$G:GD ["|ugn7Ǐ剆0$3&^)̝108;ͼϺkig.'7xe25@o}-}RDmKrqS@lѯ`uN-UMpxzrg4鸤ŵhRF"2: 7h)Zkks(_"4$<%>2`yn$[ûxP %Sñu ;D~GDFkA+"ǶAqͱFtVJ%4%7siz<5B>u?l1WXnG"3l٦4Vx\==. )YWHC[-O@[~)%߲Q =OUamHM1{I?-`2/]nMN1G>r(4M_eme&IT}#;>s UD\ l՚+O 1 6zk`yyyӺB׋"4MDrBg!d"kNcM|2g1Tm:c;DY+CcґD~|҆`u("z"#4~=93)$#Ed?q~yKDDcn;in;rp.ʊ?ly6"fy~G${0Xc̼M %IN,lmr8=\D."{GPռV0,I *|e{ s 3s[2uc=18;(R?l"mp*D$'wa"& oN9ϻտ{.IPgH*"p1@tDY}Aw {#܋?oU/n3*'8I+KE "rz[D~,Բ(`":O0|~^z0'DdUDa)޹D&9Y곉~̼dp `C~5Jw %'rv -NJez@M=vz2Nܿdy箶:"z|<˲- k,"731橨8?DDpc(9=-3מ=ԑ]{`3*giySVs-i̼޺/1E;"r=gYvhM\ӴBAset:% ,FySE(v0E=X:&{>y_ =" uqՍsDl#.2c/r~27oGlT`dp,2'"bne4ev} љCJMm [5N2w @7d?vau祸ǘ|c:2>+ƘX2([s[@DpPR據L22=y<'c. ;uֆ, ^ktEǩ:t& 0Hv20MsEdt]cc^HН"3pƋ1g.whc"7ZHa 1]z@-i D< 33(a{gѵJH !ys?+"'XOga`}[TZ4)RdqO]uY&u)#1Xa3ƅZӽ'kc!,IJ>4]t c"29mSE|kR6~ ?L0uGٰ6;EODec Xfokt]\--1/ʤVHVI׈z^hG'|Ӄ!"DtS-4MN+70jOzSC_a+Jzh̃Yo 9@OR=N "OgI{De#K!": n{J!E6fȏ1L" T%wȥnfZ/kU@ _5gT_ǫ|N}vudkuIUD'V- *3ƘD%d½*0Di!ȯ8WD@әJhUFl(YPy1fK9r].z+Cup~ʰ. Ƙ=r\yƚOX!@o*%>R#o|ِ|*{/a?F$QޱNB7\Ch ;CY<ن{ht<>ayhq`Q=_&"tT7zeG:yzNi f~,b\I%IoB1I" $$VD5lI>JYnQ:Y$&pLJs9  =t<3^f23<:p|{!&K1gi i_1doMRp+TFzNdktQAIuB\euzfբt:1LiR$Ij'X DgKXp4#Cnz"+eٍ387?d^B^uU[ }6MӃDT 9E%1ЄDj?#k;[t{!Gh{"\aWU[*':ȺC%Ir81/j[%ꍹ*",ZgYv D5OYځyk`i¹뚨 `\Bпu \넀܇N%H(oxWJgɏINu:6uοzh%Y:;Ρ99ԏc QDv=Sf$T[zK): 3DdW$Bh3~ꑮ$ED6c?p1n=h8]LD_>WI[uRZ2)L=S-{'":jz΃˚9mmz~ODƘ$ ܖ")":&| צN%. } +*+(\m퇴`f  ]cӳs[#(SĒm ao\ }pwB޹tj7u62ciKDC`uB,v1Winy pW"zMNT5$InІҘ`BBf"Z"Xǖ/Ց#h}SBMÊ^ $9~FԔtgݧ2CS}$^T:$+E2\\^{7 g u@Dp 1~(LDMc{~iW$quʔgrǛYgB,տn&z& `头k+Eh9z͛7wEDԁb x &TMwԖ2p/"rWoڴ)3FЮq^%:M_7TUkغ7[ L 6˲[jf#XAHy#o=yb""CD`ˋ67r >u(mmxh yPQ'~kv1\!{A'M`΂gY3=ۓ$_caN<ϯ?p 7Ig @כl4Ɔp KSoHq+4K^ 7g[N#8 d0^ZJ^ DDN4VW֫Ԧ8/TQf9tl9gݷmb@+{n۶"֟]c S{PKq*[0[u&ω!SFu<+UBD/+/r2VѤScRT{{c>e2[mvNDLK~M+gK `m[ɗ hbnX&wyU&fTuD|Ֆ3ƌc"^"Egsqe3%I+ ڨ)G>FUw`ubY(gnTf9"Ԕ~IR;=#mp0J2"&JוN8K&I1Ì1۽DW\hE_WWW^\Dt}պwe | I$IASa_i֘GVn mgdy A7["" re mW0~/wF]BD o}a*!Èy|1措Y km^o͓ܼ:>k6ybcfRvW!Xf3uN 0l{znmo1f1f4gQa&+::βWӎ3&"(VwƘK1֝oS$C($q7]o1C^ﯺJMy %NlU;-T] }A^v}cTv %4cb u"hЛ"ݻwc˖-s_\6YgӔZ.J6LSJE+=@L6CTE^HIl4ǟDb,k#;wmd56m7:U+̲_xt:V,S cf )GrSBYu[6zUh?m 9p8;I\duܴkJ%M榍hO֝lSEBB. [+bí:f_9&N'׵03es$'1ug򝛾PԔEaQg<F 'tIgmO*Fp&)a0{hdUduqj Lcw&axifA,M^hMC px#Lz;56x7A莛<:rgPu濮Zo%@ړ],Me~f kQ^|~R΋CͦᷟНIGa;עdO{H17q9 u'-*6'ivgݚt9>u"/Yd kQ^i:^eg ][%G8Ueld\I46:Yu~ҶyɲI^TeHX^֏&]D#,27Nt rػoh"sb2b=+65i[!;WVVfG}*,--~.<Nj:kr]IL3d_tܮ./fKT󲚨O!ӦR?-ikHJ_ô MƤ# SZtNb"6g?ʯ:|}Ӑh9@< ȀP`(Ah\sP| -L%S&KLO,%0)"j/i~sds_<9Muؾ}olQ`NZgY@hDj%[%b@C T@qTp2.^2q朎KM0i*Yڏ4ħ[_-4鰳겾JEJ׮v@m-`J’"/}^o~?0>8{:1htD$Ssh/ܳ&^^b[3^@`f?o]/y1!賄v ,D%ϋqi,peđwrZgbalˊo0 Bww7>X >Fvė#6?} >@p՞Ax/ MRo eӗYܼd~+pk<)c}QWʅ w@8+,|OxFCXr'S홛x.<rX+x` "1/վsO pFihh]__^}n| 7C⦅?%{~?1ol{+}> :5ecxl)-O"%kg({"Ƿa:%?Z565d@~~;6I Hͼ~kp[0 `rҲuq#!7'/%i{7N3~}(p#u&W@~@lAoW^86KH k eZal =$wo9 tuf~*3{w?}>s&zro&mVN&^zO)fȾ )~n`| B!+-@m-l 3>`3Āֵy oj7#+V>>W_}8^34+ã0d-9v[adY4b3BܺwYuM$ıni`hd&Y%se6l듟ZN4d Ҏ"tJra,p$0pHt`BB!*`h0:m@c+WҴlǚ5]>g6}~/THվ,VIӚ 8zӶ&vokٳ`e="Y<'ghi PM ĉ]N3`_1& Q =wC7 h>?7YЀ%,s$yf;< y@,ɕ!hkeI9z,G*Exba@U 1@ {7G x:?͊R\CQ vk +iT9Wii*p?ؐND!G 9`Nz5Ū6ˊTl)QOrU'5VSH-dU`C'@DgZ fEe^@Q9nM_yAyY,JUG"8*+m7(Va{([uSۀֵV>Q Tw\66H$ fq j)`! QT\Y\ݔ>zpEP,D~?}+pOğ?:W)=bb1,I5D9JdA@ )d |~_ZQT4+yi'K?@L@a"B H٬۲k^@U\6]pG%wu+u^^M*4p^uQxBUاrȑ =Z-=G (/([1W-''wpIUI%JeXC@%"d2@bR`*e>` v,(_Y:ee$*Or"?,b4MO iTBW\  b53r{NwE \ЦLWq~{K#6hgνaK`hWK1ū_v 6^"00oJ:22U___*Ǐmֶ$31~npE |TJ>Eކ:|X{qVDs3$;E㸼IHjؔ(=p^{qtcCXEl/+6Z\.IUknNgm2-\2uE.'dcjcjsqc'||U.w9]&4Zx,q63ɸNKmS#̗~|䙪^E\#X>; 7hgz~ \So.KpPϟƵp<`QB62y"o;wb/1mWzb%j'i3ݦ^qqk#\͑sU(B{8&A|dL[oR6asDt#w޲ s|sQ/<ׇ/4Y\~ekgUTU0q t.s㬧=ܹ{}Cz4>x}~z'Һߛة؞5 by5G *gx' zhA>1:Մ%p\ NU0TGGGži? M}cOU=˖fuгIث@ot7V 7v.k} 2O*ew!;) xף)_SUd͊){m@ ]٣aɸ''8Qm5 &'|81J*sjU0h}͟zH . pccb5y̤pO _恾-Sɍ[ N2Iӎ7|%?j7o}ԙ)5X] ̉xvf!(.kj; T ZƆD<;'#M @3"s8p 1诽v P7+`tܷ5ۻߊ:y\1+C84C&dSqYLM s&Ķ s+Rvu=:::27/ pMf=LFYu/Wjw=V} (T8' GTC~b @&i"aUf2L 1;&Sk>3{y"ioo7odw=xqaMDŚ&o^u?4GA+ ź`*(yEKF۴91aSj 0"p @GMᰜih{ÍCYfE@IKDLN7iE͹SOju0vݱ坝a!,PM *&0 h!23M1s 02؈]L&ե=9ξ|53G,٩rDa%$dJΝ<>-$!`frF%33V&3Byal޼wԧiB;tlrYPYIENDB`armory-0.92.3/img/armory_icon_32x32.png0000644000000000000000000000406512414772654016301 0ustar rootrootPNG  IHDR szzsRGBbKGD pHYs.#.#x?vtIME  +!eIDATXý{pT?ww( k*J* Vl*6X^UyT8X(:JmVt@C Gb$H{ZG;׽pa)~ c.x,c藾Wӵw(//@{S|*rztݧ/PtDijO~Hk,{PG8EܶHITN]^[rpʣuL]^r@Azug[ Mjyܒꕯ7[*f,bhŌUn}@}DkճvjΙ^? K۰/ "𽱋_^]U*EDP~RstNTźm8jA8N8]Լt ~ f oɬYAI&I9>ZQjY3#,j( mW;$ʧG|m_;- ai}}c0ef8mD7f K''+ss8&( _U8ě"LVԤ'kL|D"G$PjALczc(eB^}]uK|Ԯ7c9M;_;}e5pg$ ,DM+1n r5'8" `;:bQ @EA5dzCȚۖz SZ²L.+`< ȭx$3T;/? `L4'suK G ݏ 0Ee 19 <ޙ;d@ӬܯS'A$N+)7֑:β![B eWZN4CY\|TOW4^;KPV)ȏ2=AUDKh\$Z nХ7K&Wg hVxr N6"c>JLEV)..h-I6D6ҸaUOa8""}*yg.~}XT E N+v1A)cזo$p|\)h.Z;;ZV-TzƞtFboY iy^ѭC96 +nڢ 9'?BN|zGhWbX''FUVVP_]nۢ.E*B^o(]JzL&PǞ(ZsFGȬ#۷*kF2(^.h$ÊQ(,.?;wȦO#wK#aVPA^89 R.}N\/]]Q<( |b\Fs/dD具IENDB`armory-0.92.3/img/frag7f.png0000644000000000000000000000770612414772654014300 0ustar rootrootPNG  IHDRHHUGsBIT|d pHYsaa?itEXtSoftwarewww.inkscape.org<CIDATx͜yTՕǿU54A(p!qp\bP"V7T&$Fc1|E j UՍ`'1AԘ76A `wWZkyt=νlL ff=zU` ok%! 3 MFmS@MNS } hsaIwⴡC (@o |عOޣs0ˁs]-E@#` 0 ) `W`!2`2p+nRWδ3;xX "VI2`p.𦙝Z)p%l0HIzRvΓ,LeN578M1Ų['nJ 3C%}PwOךپ.,up`08<,b[[[J e|q[)CYfItP`Y, cҩӸݭ<&%(LD"?q"cXf +ePt3 ˟ׅ lpI1(7htLD*H$tP0z(^}Ujjj6C39ńTtB%e]3ۉ57y Xa(13+ԱlξY"p| WU0Pbt%0FVj-ul@'Αm63s> X'iI Ili)y0?466v2 K&H IqUAy3\ы7lp q'yf<;p#F`=Sm6VZUhX'`IZbId>ȥAHz'%Io{" _ LQ_PhPD) `.x*G? o2yx;s :IJE@Z\g̎/G;3ARLd Cr oW>uO x&+NSpC^o"ų{޲eˆwttH\h4+6$?^!";t4]:$Y&}C`I =خx?^fSD@K,gt f -픯8? 3VЅ 'nll*:TTLͷ%T_uUb) vSSӀHܐǷ9`BW0D 9SbCCE J3{ h#'J* RI 2 ^N@ bAC?d2 LHZ ĭKc Ɇ.pxPdC,t7c hV'DS HS2(Õnf84Kg?^& M[!@Y[7YӴ J-ӞwT)Jt p jfBi`%}Z nX`AmۚFvR'O>>PQ VRfa`aZҏzr3{duoR ylXbExȑ]&:O1d2嶶aϻܠK)yI}qdcpq.\DIuy[n׃#P,`@,=):#% ^bExk{٧H).>3bTS$uV7LJ^̀͘1#o-q_AuҥKw=Jkll,ٱ``/L\@g?,v*q/+M(+Ό_G?F>ux'pgnM([,)~|˟%7qrb4eM EVX[[IQ3Sv̔tV)ĿXPH4bcY`[K*o2 ރ!&ܟL& @#Mbq(3[+cPdDőh(YL< tJ::`5"iOقA۶~u!μzԿDf $g+Ě޸\ `P t9vԠΈQ1WystV>|y'3@J)\kֱT 1Dz1s/;4HR̚qs #ȓ8g@9$,h1F13;Tҡθ[P8*;Yv(\do|D")"lv`~`^x\MM=f~BJL&G{c֫:Fۇ+9rP8|ʊ@Qtmfh-BkJw5议[pS*{@8z!H&d0]pSi9M?rxplY42GRc Y8PRޭ}ѢE˳ NK444`F?ſ a3h"  N̎S ;" vIOSBElD"⢘Ay;˫y"ȥ\.% Vr$^8|en̏;-UI/xE.Dy\F t'}o̙,-|,.THbR͒uؾ}EHL&guB3Bf'Iplf% YY^s8Xbfddί)8 ,bIsLc.CCfCdn%A&T%<}oeKJiD<O*yAҟp-f-B1WM{pG"GAo?-;.p9;#8,0.7O 4^˺w `n .,.v#./ye! ŅLz}. &qNO!\s-0Zx]kX,?T8`;*N~hTS@=+rK.WPf+ŵQLx:Ϻ[GֶV_֘%8Pʸy}NGcqSpO˸+|o3/3. kIENDB`armory-0.92.3/img/scroll_up_24.png0000644000000000000000000000166612414772654015432 0ustar rootrootPNG  IHDRw=sRGBbKGD pHYs  tIME 1%@6IDATHMh\U{߼&3˛D4%6LhQQ V[ P  "".EAnHiJ pE4IC=.ngmܻ=k\;P۞S{99z|x7esx OamTw)RQs9|gp nS~PmUͪ\>G#mD ~9kZR!#%ch@|lrJ+-Zi2lwd侙5u윾}!3& AݢG_ijر515q,-5&"՗fMA=> x&K 0L "KG3ٛuJRnE7;@H+m oko{}{pG+/C^iQ {XgIDUkM; ïC}9zr8h)F4k( n9\WD% _7yS@r(y͚PH!xr,ըZl,Zx>*E#LtmbQrSd _?'{PJ"ELaz$ "w(|-].+xÉN>`ý1^D!8$z UJrmo#bU!`{{'[Ӫ]EJ.}tbAwppΡp _HaaEA=g+~՟IU[ )(4XN zsݞ {G|0/IENDB`armory-0.92.3/img/plus_orange.png0000644000000000000000000000111112414772654015422 0ustar rootrootPNG  IHDRasRGBbKGD pHYs  tIME8IDAT8˕ҽnAއO _IIKADK  (Qhhy㻝ۡHkKxFߌfVX|Iz5zK}~Uͽ,101&Vd9`]6l4s*).7H͂[RVܝ{"bsrG[I#I6&vR,܅O&88v)9FU16J҈Ň-9W^yk$1λESURK-錡Y #/|Xm} XoQ*Ot9&_!3OrXgغAgX A*jo}%VCa U'LVm݃ɣ_v jgxxvnnQ"TlR4m#CF̀1m.:)7\T';F%؆\}p7m;d,2laQ'AIENDB`armory-0.92.3/img/arrow_down.png0000644000000000000000000003625212414772654015303 0ustar rootrootPNG  IHDR\rfbKGDC pHYsIIE vpAgg܊;IDATx}y}WwH#i43%*Hb&dw;yv>qK2qG$~~1B hAhA}4}{UUWro;siMwm]|_Wu LHZ44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*Z44*iW`as5u>`Tl$it`\)j1i cs5_]-iE'zؙvE3t ">WS_.Үp iWBc v%3DG> * Z44*Z=} CqRx>V6 nZ q+߉uLVRWכ:zu-/Wa׆V ~ qH餳Ă8Y +=BݳQX((!0) PBϮqHN};*ES6 #Do&x4*C~# (gIXP\c!qJ# hH$;bvu1A)Cz5O1:xe@Bd碠f9jhih(rg '*CxB>6^T.Pʴ"rYț7 0u܍hAd="@κ Tgߣ-#L$\ Fn,XbA @ Q(iqX̕$Y҂U"5 :; 9_f}ei- Vp?_f=I@@R9&MQx= TA @H_>-5i#9 62Es ( hć2@rT*]Ӆb%(ZLZ J jR-iB F]t@#EPLZ4R`BV"``ҟԡ`8ckHZJNO]G҇2/<;Q뮻C @ɑ$*+-/hHE%-RJGRm D*[MI2y@ @R&&z)&:qZ 1D 9 \TjF$2isGHͤe] T<,M .)6(*`\t% -EBJU'#I:Ndw!o&fk -EF Ԧi|)h HQ$$\sL¹|,+YQ2h(1 g\n ZA̖>ԧ`M/H/Q2h(œzE3 "d3K3D!?c0l"(DLt_~P[{ɋB]N[g- !=: ]r͔XP,hPTI_,IZdfY$gF8PC @bgԟ7$5PB2ry24"|>]hp9E'1!IRk;(+)$V5^\ UB @ 3CZd )D4J6-D}-v8l}@D @{1(a݅ |U-"]Iz̡Bvzuw!TࣀZ>`C-Ir ;bBuWG@\tslDC-E (fx.2(:N]|?y5Ҁ7: p&<oa-EBSEʠ[^z!݅&ٝ0\_Sc D7=NHVwUҰч\7 QD5@i0`i8-ECBYi_hH/qޢG2ewcUaH,|7|K Z[ĤOU0ֱ-J,+.o11i?)A.(X -|&v!~m5~vEd(Q?= cD[ 0}wg#V%#v8"73qR6,R o}l-+򍯂/l]CN?\\͝iWDrLe-DvIrwv甄Pģ"!cCPj []S'cS3vEхϊ Td a*2vd(8v ŨMA5 nح/+x9M/f`%ŷ =F;=I62a`d@գ2U=P;iWLr0V7// q?I:`;PVg Y+NVmEE?v 7Ob$. Q'rxc8 iWBԝVcj d񓚦ч~1yaCγ8ʘXt>mp)5 A;eY>҃RafZhGIpN=!='I wo]?^&?oh/ػ/[݂πR PD2)0^#7wvm@.']cV,N] jds57k1h＄sى1\+ý(\n,5]Px^s_vpwvلwlxf 'N"Nls S{C>W{rKQ5c0qPySDl붿"g[OJqPNշ"X8:L;;nŅ䗤 yZ`5y-2Һ%^KYnx%wsZf^:/"O#}NAEF%_;?ވ㧎m5 QU B@ՠ<_X/8wj# Wj>=Lcni7Bp)C$?D0hj9Bҍ^0(gA,ڃTE j<_'ȶpL:@ީΦ!Yδq2݈b_rݲr'&t_FgPj:b~#0#H %(\z w( M%)o>Ws+&q&Ÿ<޷`SRi~ױʠ# v8CPw6W}rĺQ^iϙl/>#+a:kol 3U'8#u5c4f̮v,Kz|6jt&X\`)o7~9]mBEXB/ `Lϥ-|0e'`w|nbH, O~,s"ՙZ|a`|D_`nK گɮ 1 UE ૲G`u9xf2@8poXCx,Lxs9~gp&8 0wMBxA+P}l{lC1@OHOM/UÉ@ ` ,n۞zH2ff4憩O)$$=kV3-:xX+NZgqsKg<_hq3 O t_SJkci:wEX5ӈS$?ڀg^ׯf[f(y!6| h7χӜxn\>5Lr ^Ϣ@D&&Qfʯ;VuH \!Lf'H&Tga  ܭuI om 8[Dr4^ U7-^caTV%%FY[;<R_q}7øXw\7 ;:ۨkܗz m rxkBxxn+w L9p w۲*q/|yH~Ab-r@ ~,m-'{f|It{K.W1_A d[XÃGŸ\n?^ue 2u׋Oi0{Ɯg] WO8s{0E:+zf\d$M8Ok`Ϡ:S&߉՛8l1~qX >@#^5M|>al'.mkUzL,W8`X2>)(#?=D ϣ0pbxޫ Q_3.[un/yݗ4]G0hCٚA{ ҋ-!Qo~ l>7+gKb\0r:W`GG_2 lx/ K`*S;;^`q %4q>`Qk]2Y.= pSAT@1_xnc d@pߌ1nT _M[xn[%ʶǓ{ #Vnx7X?y;U)?s~zkECpKcŃ&7R6LK/%Hx-yDo1@qb u9 p#gM8غg=N>z]8jlK,{h=x#zpVWׂ[[G)&.tE'؋ tBzYr smn7!p0a.nj+ljwd'S.le/@ı0kgxoH~"R\=\lw SV}cOU0BM* ɿh;y06oW.:$IY)7^E*k8̚0X[W3x-#= 'l// /T`d2w]šw^ŢbAW{6g,@c'Kaw#?GH> RFkH!zF|'x`3qbQ`V*XҫXTÃ?[/jx5ڪZ܊>>SaeIZ/_r/g:sex*»ԳLHP APwO~-gF7p+@vPz+ '@x}ӏ`yk 3]85:5xJ"!?c.˝b<խ-8&$8qkP+B :?n|u%*j,KmިHB<w-oW7|N Yy3+'d $`{$澻& oڳW i} D5n7u-cscێ-l%{!*V[Y=1;oR~.)C~r i.cD^EzɣyL&?![#0nOy }u4ŚP=PdTTÃُ#~hV]2Fw!gd } #`,gObBo`*+O)>B 1̒^tw`%Kzk>wKhs>n;Ǜـv%&q$7҅'DA~. E\:S>jqI/#?7z=ݲGWxs٪{y-%Ȑ LF׌@3pe h!@ݧ|#nlx_-꾿w2Yٙ;L{v.ŋ%r~-j(4|B<׃/=<S]j Ogw?gć"!!s?} ._H'=`okznwGg[ I'# Zd[Ctx ^cN?u5cqs}0W$I~3D3JƒIF"l4E1"s^I`;pKܳp.=^'jd/Vc Ãۏ0Ӂj0#~"gL~.t'-냚~L{ l'>̥wpֿZ"# Z$fw`ﳁ|(51c! # r }|7N OzN<I$伜HA}tu#$Hw4W|k0Kz} ZҫXhP j(\y ߟ~Pbvn]1pY$ L>s|"ȍ;G zuZL-L} F`0ׇek_F__$ G<:Kn$hW1.B>;a)7!𥱎խ.PB~_. !?WPe"Ljbզ%hk.5 \ҫXh@+˝'}ӞDè&/0( A>K䤗AL~O1"pG1V-J~QB#*utbنEsP~Up/}G2}NDjqCj=͗Y R`cq[ |f[K.Dh{xP6޼5Zcj`Ȑj'HKElU *mjX5_Cx{˛dzK+Z""hxԙظS>$\7 XNh>fqÌqyN(<ҡ>!aN$ p4cAH_k_W-WAÃUL{;no~ b˜9<-u2"PǽB ݀nz𜁵t8@#Ą=-Db9֟K@1 މx!ǔ?` 2Lzi+ֿkX??|DC @aXq.9#|Sz\?3VU* P DS[yK|]h#9:EL5'͆m+pY-vdOÃO8"y,_ :{L$jԭl; U棢 ?W/)_n3̑]7cl?@Xي50"0f>[٢m5wIhB @lkoê_S=My g{֟ݕ&?cR+5]W;w<:/URGZqP$O>G`B4̝l{dc⣐Xs1;_@.rj=-O"Cj|ׁWC Q%J- hxp'{ґ ֦c_ o]3]#E)hc'PWL#7k\ !n߄'N[&4}F}̟izk'*FabqrI/g[?0 Zrxp[+p4gZ[zaB!eB9'sI7Haf{okcoӃ%Ͷʟ(ZtxpW[rTɏ)|jR r)Z /|.rh(aۋwX:NzzЍ q!BDZ*oHEA}xmzLZz0%~C/54P"Ã$;y޾RJ uqw/%R"v$_)P]5 &ч%o^^%ZJl3SxoViicnƇ8pvn@.ݍbLu/IMa1\*;'Ɖ/\C-%FÃ[pgon3`³&uKݸ}U.V"jQ Ã)jf]w?o\7f.f+vޭ\ﲭKi_V%B  lxU(3?A)hqaԉ±"KӨqIrXaoFQ0D|}K j2p$fx0)][VcO@Æ4Cn20fyA+yjqHZP=҅ngvB)ƮZ HE`N!ĠXKzd|n/c).w_>pͅ?Gz.!*XыoB1~a<[<#O> n5wu=t̅Ln=~?K_~ah8oȖ!J5]~мÕG{\kDd7iҁU묯>=̙E4v?;P݌͏JZ*.OWŶQLB;I?26QCVL2Q?Ai;jxܯ{g e?z3)TQy@=]xm" J6 )kyQ+nNBPq ) H̎+oxzzdՋ׃,k(;Z\*򄽤' ^FgGPwjy%j $[b_6l A}ae+Pk';? olx(P_=< Fia;p9Y})BE^aA9Ǟ7(.o8g_&nI~ӣ?w×z\|ϧ20A^6᝭Ȋ@'r)'+ց'nQJʉse#< ~i z|תYۀo/<,Kp>XTǫ--!8W"~'&0BBZ$^LqQ/z?U ٽ}g0{Vo 2^z/-)9>{~c%{bI S6@>+$ORBexOvW_q{ zEJ~lj#_&>}{>&%nEo UHaK0!=揾:xr0Dz{F׮]v*R'Ji@j0AJh(Exzt" 8Ō՛˲ǔo?J;)$җ~ϸi@*PY q 'o@2zk (ei-ѿ3;?xEi?e~#’իL%CY!EP}Il33;WoB}WZ~ds}ݲb$P]RZ^Trs$3FH`$ j[^1 MS>f?Vu7H:ʃ+͗A ܏3Z%M)Ih*F8Cmq-"wė@u ''!Aq 1Tu(; OpCA y/{œeAdQ'%iXQӆNj|Ca%DIS>+ ¹;PDR($OAՅXlX}Ѐ([(%WBૠg$m2,~8iGAair$F +[PwPV4Z/%1KaB+2I.C K"qXx8(+ /8nAXڂ-ĩa'\K'CX5$%RWY kp/"W +v?qAD`,~lA Ứ3 ‚ M';&E1%_1~~䰑Ɨ)AI5> $iӶ}gN"71wBI‚I AF>q`"7w:FC|k) q]C$]A@w+'x Ux+E*=|6Aآ`l&'A]S0ʕ 1~܋Ace߳]#A뎨u;A':Ue:5~ B}O0Z )^7 #(>QR8Nj}6F/XԂ %HC$[G{(]#_{EL `Q lh4VAjBI$.?BPs`I!xP4AiۇTs_0:ۊ^6X BpXE K%$M퍓|EߡF2'_jN:?xVڌqV^-#__G׊_]3djsS XT*evI|KSK<#߁fǨ?Bh]uvK/#q`o#B-^JrPT J~&E([~X#A]=?J ?REBk f<b4S֊ ߿hWIfǹ ;B0D9BD8O[LY~۩'gqHxCrT/Eq-#gEw_;A-IE9᡽<@3D_B_" b$&%%F\ 9# LЦ HNH00MvRM] Mg |C I_=2"v~yWhH.俋P. X$ŧoYTY8f溉P mگY~ÑZo87u E6ʬ/t2"MvQoYk6$tߗlCN8 JV'㌒&0쉀E[M"s $U$_Ȣ\n"A09TTv$q?_L j ?X̒"/WE7M'EM8]|"8g=aw * y~U۵{:^;L~+!,SP;"3@QVߟhjBDW);Hmr5#_:0'֩q߅0sɄcUX}E6:!q?&Ʉ߬/\;0K;xR_* & y'PCEUT.PK73dn1BYDrN`B0pw$;B!P&w6`pYB%*w÷Ǡ-BEf`vn_IXe8_cơ˨\pzm\|@|\Ԝ-f~~A8}I `"7 pz8 :]F@dϙezE~A8s=`\purIߒVZ!`cZu)YBSZ=rs4lU"$ȶkGQ &'õ[q' ;opIQ#ZsWZB`/Yt7>{ Z\?M/twZu'Q|_ dAwF'f-f*Z!zuFq`PtΣ[E}0KΞeJ D8gǴc7:/컀nZYv`o}X~ܝ8ιG<oOAȇ U3cǜAn%.B[ v}1i|pP!A_r;6l.`>^R~gǡ>!o. h5DGqZhϿ Q쬀kn!$DM#NA7ƀ>r9:_C+_Eӂ+ \e@Aw >4T"@/|dq*4+ynb$ wPH $A&x z^GMbV!\ L;QFe0.6nI: s+J%JTB1H{>P:ub'LdX.N c @:Au!FtE8G0/ūWX芨 C`0(/|l`ʠ 7Č#*C4/E}z3߂P\E1E0o_@)|;p(% Xͯ?rE~ V<$HA(0D,x:P #\9A(.l$x .\ +E=P`m@$n9B@@J(}P*ۦB9jj>Ч SA(Y $PP PF9U\N*~P*T#{4x P\EvN]A(PQvYBy `W@J| \ F](BjUs|.8**]" 5r~5` * B62cb BlX]A(%7"Z &lCBl@P`NZq~׎Dh@ * >ɿE1P+PI:I؏ l"P r`x! BQu\P [V%P8 r};m~pU1@ i P[h Bါ"k@hX`> AP,On/&= *E~hl!dcD@2)l _o4(|@@A(N_l@APozHX: //qOR] M} +P;P`WOfPE( R  'C~6ſCAȻ_0ONoO;_X_ s|Q۰.`C1@rgm7IA@Aȣ9}7s>,RCgB'@v[l&@|ur-ttl:!Li4X!{9f$H?6tA:]1@6 lb|N($B@ _{SXX擙@Aoſ^#5NL:od d}_]pp'A<6aA_#7xAnX+n&`\ dRv˭'yRa?@PqLTh4M\@[տ}7s0s႐Z"U.AA9^D S @ SA,oϲxYJƃ!]y\@:o# _?:VW:<7VG@._|9yxܩ 5^q v|+r5Zm -W :s l~|;r&khT*,+z*"NЖ߆~%μh+Q K# &9qγR1+BE8gr} q. Tv #FP\boG}$_{ճ\ ;Nn  ]A877)B2#ZG(xDCz/\_ C?pVG IAp - gqSmi "0 EA?%Z:WYkA8_@h@n✅v8+֦x ` 8]Bg@Q@Z¸K&. AW LIor7b{Vv&6 L8>n$A89?-LCvq],`OA8v3)cu[&l۵swC0J G~+PV/E\WaF)AAHM-9vu4R=@߹ܿѹRzp63 m]s4c. X=@" ۽7sm&! @?8_@('ߒ#kg\D~;\FvKW0tgCW B~ҷqp; ۷$"J~_wn(l.$gt!(4( NyoK+uMC&c p"Pe7 \Cr 5$gg>!j'1H> DI{<wB;*;Z"0% BZ} .ݗIp"`ŸNTho3{&&_GVYFI=w^6 gFơ=Y& {DrFQ[y;XT6KT)41(dH32ɟfƙ-y DB_Em]{P3)Nlss@" dC=6B JRN"pD, lcg?g۞i"'ۑ ]K-G8oaC>'b"Y}%B--d'zaVBV}"#sAr_eDM3 FsaݵnڹDWZ s%&*6_=*!6!IoqPs'NC_`/C-Ŋy-5eCrn{yy}eNu6^i z SV_Yhwf #_X5BpE$aJ\]"^*xH0,7 syG=g[y&`mJHwmXB 7-O\De4$,[re]3]c ig쾍#=yzQ,  v E8d.i o!dB?izqa_dzp˽K5 ]xłgLjWR@ ԝX  a$+:VJ{kWsvwUg2z{~_?߁)+X5+PAy>2 JH#NxʟM+8/.`WqB&K9GY( 1AS}|A$MIsBE[PW `&=Dz^ݭLf9DB?!pnEiKX96}VJ-K\` 8Fc8?d&f(W!ojGGywؾy~qsǸ|T{&uE &pAi:Ekphp'D. N`F֊<%_݁Eu9+QđNx- ŕ|?(\uuz5+^`5zseӓ &`"5rR\1F,~*K>lqJw+A²/dwV1pꦵ] EC0|!ξo'`bfClXмXfDeʊVӇfJwa][B璘"}K*O RpxGWAL xj=qŢ^8pdO.L@zH+e .3 ղDpWS (M'`R@3X@2;#p[”߾ZWϽ' 7߾O";_~ <-4,oD=ō"nOgRӈL֋7 )_aUT1ЍA ዯLlLnSaCA5\C:~b)n>#>뀋57^6mqBtBUxgQ2.EH7L{Ή-cT|2IS V\kz`=Iv 7οDӑGfM@%WF1)_W^\ ]n}ӧ(~#̕_%~\a&.zY(#d֝ ABrU>))j_4I$ ^XDN z) O AΔs }!=- Tk7K[}hZiKK:C⥄|^bڟـ+gܲ Cl5Uu -t9 ܜʐ?) WҾpH$=Ʋֈ*eNEp`I 2ܔ`qt@HdEQ@ȪFd0tU^]֎x+ʗjL9%XV} V} ^+<[S`WzL%Ke5. # XP!Ԇ")*ȥ`l߀_?3x=Y%= @8(̄Ҡ۸V0-mKnAEp^E'@d( GH^}&ܴy*,vV,@8A,9gM#5pܳ_֋6!?@{jF4,ʰaկqE-- zOLe JYp@HgWYS80Rp V=-h3xUBm8PUxxoi.$AAΔ *YQnN-Xݫ-iţqVzaɽnT`~t9^(x`UUOdbא%8rO%Je9gqqӴ數of}Emա\p$WY+p'V2N782r4g&YƘȘ󺜃sb R(%U߂(\t 9Ts(bD' z7օy?XP {.XzV@]̔-Ngf5sc⪪lݖ!$ tR Dξ;_yz ƧEKݛ6BV2f ("#y 30a|5 o$0 rAЪ"+yFoUITpt$1L`*B8Kaq{w0}O}}P=u EQ ,1aOu;tbyk|q&5T6iH @Q Y%G^@k2\+ugil~c#Qy7g-Hb~R cxh21ND(jU;PevOIyG*1>=x2},v-Thu xrnto8$B D/Ayit٫d}OFh&i{*ּHJCV2& 6W$kd(LQ_2U9ֱ~4vںhX!ρ<95.tjǏN60+CM%]Z$ђZLJoz`lqkb*@'1h]@ &Cp!cé(=]j&_p$` ׵ӥ3y-mf&jZnbksb߆Rj#T( ؊lܱCMC z)DaFNd<ņΉ?4ĹlyBZ@AAaļsLv8Ba 8/˭2mIMiuࢇB4`skL|{zoR-*}7t'O"o+$}sЦLeSz("l+7}cXAEɴࡈJRsIt:$2t0VTn@<õ`VNM*3a8!kD=ECV@(LM mNL`CU}brY wE pU x+ɻ2K'I}c )U#& RNAEA(HXK^ C>N r_D]UBEͰ}v['!NfY)@pDlxt7eVъ0*k$JȲdnMD*Ҝt"Dּ.)`)*.zN2%W{^T?B0:E8Kхh_N=uI0gNcJCUTۗҀu HY"ӿ=~k`:q=]Xl"ScKjBDACW#ԺJX˚(c%'0BVNW  !_@J'# 2%N W-$yա<D8S:)>_A|dIܧ=NVV@L6G*@FI>q h(x!Pdv aUQ?:mVRHHZw {+ N`$r-ꥴ<|R Ţus˄rC!ԇܞ EU U RWqvf4EC:>==(r J@1"#W#@\VjP"QK*"@!|<(P UQ* d"4fdL䇦mdۑMbRvʒZ0vˍ'!z7"/rhDx*0^ =T‘Ve>éӼk0ۗa3|Vn B"9bXauG Ï>HTy#B~B!1I9C3&a:@iϹ. |6a%čl6u(dBVhk8c b.T,b9K? l(L IENDB`armory-0.92.3/img/scroll_down_18.png0000644000000000000000000000143312414772654015750 0ustar rootrootPNG  IHDRVΎWsRGBbKGD pHYs  tIME &#D*gIDAT8͔k\U{b"(Ѝ"lF, n(p!nZM-UK"BҤ$43if;]DFMV~prqM+\ NΣDwƦi0 `y51AEIY!'D҄zĬ17c꺦nׇW/Y}Y!'9EV|"#il< K '?xlygb_L1$E(hִ ל(c)V}v|,f{y2VJXQV"fV,?: IٞlMh@J2 >kNJX -+"zsvz+1 Ǔ "ś:%HђOiu=]yG:VQl[r .H;-0.1=X6~U*N&fJk?{ttuzjI313v 'fmAw tmxj821Ng:.7༜0 gcx*ZŪLV7Wokf6-ΜϔZr~[EC~: vN,=3J#IENDB`armory-0.92.3/img/MsgBox_warning48.png0000644000000000000000000002230712414772654016216 0ustar rootrootPNG  IHDR00WsRGBbKGD pHYs  tIME Fw IDATh0$<ַ^  )E$؞b)."T ȧi,*/0Ȓʪ0432Q%Ğx  ”ʭz(*-/šE/⽆  д ήk%&,+ǣ6<˵#'"̭д]!"%'ͮ*L׳( )&ǧվM%-"#׽[ݬzB  /z9w  (`*@ "9'2lϬ)   +%›Һ73   xʪ)"*"꼖y εG'  ƅǣ( ( 缓jɬX  ĎƤ%&廒^Ťk  ѹ¢#$编M#㾝x  Ӳģ{ ?1ܷ ȭ Ǧjǧ2=۱ȣƪ\δ%Oϯ 꿞ͰLժ^ڤt@   0o*Ѹ?   ϶p֜i0   2y+Һ70  )WEE8k |ҕ] % *&]ܭsk̰I% 0- ַ뿡浑f¦[ yÏܾ͊Q   //n+   ,&h;IDAT 0I ,HƟ~Ơ  Bm7VrDa&  %+TQrIENDB`armory-0.92.3/img/process-stop-4.png0000644000000000000000000005542412414772654015726 0ustar rootrootPNG  IHDR\rfbKGDC pHYsIIE vpAgg܊YoIDATxwx\W?9ڨ4eIU\eNI,.d B |CewT$!Nf^[rFL?ѝ;{gzGfN9y40 Dx ]P>pI;"*tW KO1t"ox HwE2UȜ]tcN&KwE2M4%bV6z )IwE2M4 %hmE˕ Q~CMҾ Q[S0|!81!vgJnq/*+ù˗ÞmSĞA╖2݉'q"49)LGf|#%nvTXR\r+0-T~JgpeiL4=[HW@hjJXffs")sP &~R\nr?Ϳ#U%$$T>9alAgw  399P ^Bp?pr bk17_ky ɥ5&έ[q  <=-,Mjgi UfdK}Jb_gd:/|gbay硡K#,Ry qhL4B KKKn:Q *H%jhh\fKF"ؾe `~a/v Ӹ+s@ ~xVv6*/,-`hQ,}eVUs@8-'n 8H ,y_hg2G ׭Sd RW#F6 SU@^u5W&غu+NapK Fʕ(++úuDL9[X #=$AI#IH`DIZSa"p$ʶ6b.(}L >|XF ⣡6oق3==nyyǏ÷kWzjyS|hzI@m-J[[k " ۲ݽ&NanR@CJ K c~@f%dA~ ϦֆJk׭XG 0{)+ H@aŋQC~}whr*k̖d Zۍ_,19}z~'T4XkB77S~e {zC |aWYdzi;Pֆ bd9;Fە3DEIa[$p00w)k̔Y"௖Zy1hSP$~Qvt$";7;JiuKu+92k5q~#/V^|1D=t#>դTnUF&`0 QH= 8=7n`w7֝vy@2Of%x 𴵡\t(GCԸT/7|f@ M8 ,\HMbItZ;<" %=pG~>X.(@UxpG>">xgqRJ".{[i:3I Z.Ysxsv uu$(! >/ ֖'_p1?B۹S' eȞޣ2QCb;10Fy..Y 55(f7/!(L/!E`G Nn7֬aoIz[LCF?=޽ "b[pqk+Jv K o$}b)R `eRTbXz}F1Z{n-I@RX#G1aQ 3C`YY.^% "|Bb rnm҅ syh7/2mRO~ZA $3F¸(M9KQ؈ܲ2au`IK*oX-+{r,klիyH7c ;u-lqMIS⢑K##3 ۍK¢Un.%,#Ghf{`OD $%j"++Qd Y?E"yGA,[8;ܻ;0"B=DȞI/ гgBSSD3jqnK J]P ,#t1b 2.([,[%Ky(5&$K?'b$`-eGA͒eQ G~0zhYMb*x ik',}xPx1[SF6B"@ȁ$D I ćc@#+]?oV55$ 4<414i-y]7ﭷpYM$W 93UEcH0{gHZZh$_8`B^BiUU([\ i"s[xMa8[I"Rk?{(h3g^~.A<0 jjͰ&;L KbUU(mi+Wb~S5o"s3\rR| E6p$WK #8j=B $ Á p$ۏh Q{NOP,=jmm'ɔ~hAØs${Rtw$434IJϜA-Mrt= zːM8 ~?K7jI b(f +K2OTP]fY "Eѫ:/ .Cq[ROF]mQQ ~NC7HMo ~?z>`‘@s3#I,{Wh׮^ ySSݴ a @Fp1&H{XԂ뮓&I m@{bhz:NEuuX#,g$|T7x Y ]_~Zxr}6!_0ak?'I@' NFvr4+D p`"5~Q],X@v0k~mDu@7$7MMX{@[o%OI*:H-Ƽ]$rᇥI`߾/ۍ!m/C]oR 4z^%L^BVg65# OUX#7RemEFޚU4Yr4R b#C^˒X5 `DPw ""ѻ?"<?z,'BO4`oI8USF\tyh|6!"VWc ~@4 |MJ)9sF1'qOHuɟzh9SS$z4ա 6GҚ&/!G磴?1"D}+xՔT8[($ ~Tr!La!zy%$`uJUr ǎQ"^PQ{⇾-' @p i 5y>?9 @kCKͰ%[ZIv`/!x q)EIC]pk'YӜ&oZ-Ƽݻ]I4ܻ?QQ[/OA>5 A"#l)%<{Mx'a'NIm_&&*u$O +G>J|eݗvSku>b`UG KaJz`wG:OPGFIhﭷOiPE4rKJZ1@O?q"Q%;~a(i'n>Q8yZhz@f0 V.\Z45͐ČxS,ͳ9%%(Ǻ .`xXz3+ y']C*x$ N NԒnO:"yqQ_ ōI@0C`FQ8V!Ӷ[Y!'&{`9 F,AISH2 (}f(mF?fuJI >lC upH_LLmqC`Jj~xW7Em Kzz>u*1"TT~zK*~k$-$p$(aGϡCF"}@[SyyCF)ہԼpEE*'Ycn@_zuHL+8)ۍ4է4^(#_>;`ST=;/҆Fs1:(_1 DG&L+![($ ɏ} wFji),D?_8841|$qjc!РHң ㆯ%FbF̙0x0f5=6]`M:w&I`ޞ=?M.Kmmo:$l0/̙d?=B%F: _uNtЂ.8E6ě@vFaقz8N`YM9#oؐ~9MjQ >ʒ||( L{E%ۍNwWڶbq w@Lo5Lma 4Hfi&@Qw7558v4aNA18#\Ii |>xN" S~8yW#F}ZȕWb+6\~?Hk5L;,4I#SP9=p@=R{~ANCC9'nѩ:%-qb~6BB3Onπ ,Em!MOkk%Z;D)0.~;Vè?cPiʁGtoࡇT9ViTpp%|T9{EB ZR1j ` Fː0*)ATmzkAΝ|f_JWG]. <+VPG300odO\. U_ x%9))V%n : vv2ep'OWo<ǎ^' {{S}5S50*nrdf᜞Q\"CȌiZ:ki6rx@:.-raYMRo(<Ǐ+^'4f %588~J}.yaiX3 Fѯ()P8J55Qj4*Mm(&a`AxV90: ɓNjIp~vcT>n  ]4]3@LI0{WGJjIM 90=o~3AR1XPv' 49uJE] AxnIODSU9eU^*I@&hEÉkENLH  h8>3g ĞVL9LkCBPK*ʎmvGM7%.3 ]whQ3//}QT\<'Y>i6 )Z!#1 3 ԦWA諮(wi\",)(Нw"t)D?՗R5R8fH5 M<RP" /(/dD0|=I7r!B@wvt΍;)q*7s*U:T\B29NaY0&@lyi`R2[/y8#Ѥ cirx1 rKGB~M,t;-Щ5$Hh'b IytYS~Hee'Oh}k;ް6.V'9m>~&ݢ+ ~w`RruPe*˓̯e}Bʾ}8퓝mS"z|YCC(6>?HAZCl_#s8 $u tn(KoIb2ZP2b@ފ}鍲ZE%a/vtNUzmH}at~ #2H_/YƙaHl^HU&hn. W8pߟ/-bF'.呥f3k+~ [b3{5jO 0Òe* PrmqH +aG{ A7/U!Pi[lIS|@L0t@tvۑ}h~h#ۆQ/R ~8]gj4'6JWMn@.N"=*7 7<فoGFxS!ZۆQ#Khsj?à;va:5du.\2PMn@i\Lj'3n\8 ?Tg'?AMCJȂ_I^ F; h6E?$Q}99ԑ(4j6<?9a1Q@׸6߬)Ȥ2 ,+$I!(E?11M%F?kt?ٌ/xh0ZRefkd&@h$FЛM7A'pPQC=3JYV&ZYЊԸTp"d .@?(A-!856FjqGdL"@H࿜m"p=),0y6@~؏Kz\FG:ܳ`|t!s"S>ZxS@zFWn<)s8PwUX??l!^Qs0q-(/XSZ !z> <20'$y ~#짌epb)s8PMSTnCFv}*Dю[nA/ p@n.jJ@xp!Ov?M 3MYv6yZb?Dt|,3@#`rs1y, 8~E#ǻDxp0>[fō0|/@ d=ehpӉr@2Y݆hLK*YЬ144P@&/9묛Z1L@FAe8hA$~f <>(T?K7݄…T+E˚5 X)[٨E $Y@}gD IʜNROa0R/&FFnՋč7вv::l!*: #@ ŋ3ZDXnOr2A 0rPSK$ BC3IY~>].ꅗLQ&njF}3F_%#%UOH`5@ᥫ:&wqdO K!ķ X~} ́? F-Bp2 ݀[n*ɧ7 X|%q8k>MQ lmTBBL|f@>~>~Y X|ӅBEe[XK Վ&9:/e(/.i?-,Uf^_Irs1…X|e|Jk@Kj&j椬 RU@iӁ@(jNF,rU> ~#zq{h=D 4A)4_)…Z .ə!z wc#| &vD'o*/7WZgLN&zF B'0oi\Ō  /)+)LFD<Ƃ&Ƚd/)zW-wUẂf,ٰuOHdE@ѻ8l~]n 0lȹ86n`?s:~\TPL, P*wSS XbYyXsJK./ˉVY@FGկ@|D |A؎-C %+!Ѻ[Z,;oEFOjB[WZ MUOEEIW7 H?BRBp>P ȕ~j_ QRowK |S񍪗%MʥsDB(+/G孕ZF>RaAxX0#Kx(Ӊ/@K ~S}QkP*ƛF9Avy0ZXo~Qj? 8MOٜ !IC#`I`%EXO+ dc}}#v+-*2Jha!7ҝ,M '"~AǺf ad?0l1M@` 1N'&7>;h~3>Ab rZ@}vPGM>vd8#̀S= :xnB~8 hwRL"\]Mh܋cg?kV~`@s崂: ~**ப.&Hʧ+H+gQd?0U]?x7@ƍts FcvSK_& m*,}ЭĖr`dk=6*+ᦍ4H_(zFzuQ :^=!O߁|uqsǓH@iݵ\>Ŀ P|Kb?oVbKi VUzXN-,5 vӫJT/2 :^{kt'a('@֩S7T:?3| W%K]617P @,̐}Fj~Bo3WU0)$OwxUɺǦ,A8 ӧM g49l˿dԲaxKP:ɰC8P?SW'QLK\qd?0kSݷ,۷B* `;u4+m?>7 ́e˰ _0lٰ\O4h%7>RV] p9P/~Իo>tx"}:^~Ytv䓰ing?+n,[e_er~@v`ʨ)GsjDԤ7>GQ*I޽8K?Q hӲ’g>ÒX_5/7sMdU@]%L=O_:o|%~hZ$$~Qѩ}"l/gB!8z ӧ5޶:1O!\YIX˿%}fe cr#8e'U:o*))S}Rd 8{n>@K/\>ك#/@_F ?#K;Fggc쓟dI~Fx `I55P#ǾeD4EUzGπ_h݋_oO%pv/I"掠D? ́+?erJi:ĸ4igv_Z ur%߈82>'&ݻgH6;ӰHh'lm؀0Khb \|Orj+Ӌ8oO+(藾$:aeЌ#`OQkE.rm"ݵ Gpb! (yoۍ>6C߻fdeg^JSu^M*7 U)=9R9rsz#ZXY"@O&Ϳ{7:_xAMLE\h@$g'?pi)9통Toi ~ 7M^>4H(yFmrr4nSG~܉#>`9uwn;1V=J՜?)CKk{*gY@ /OoĆdLyӃgEdb/_M=;w0GBD% IB߶ 9ْ)Ϳs':ݱyFxzzg"9߾?|>^GFR^ʶ 06رNQe z1 D8{7&hbӃ3$W /-~NzoUtvqH9߾9Ti{L$jPHÝm0B"pJ __T6&]0A;9{{zi)8g񩾝;?'۷_~,vl)i?Bv쀳λ.W(&vy@{Bx$_`/*BE!K'D4d d"ޱtst p tNt>&𛽚g6Η_N $xP%8d(]@ 0քD>z%;0|dʥEE%FbQ޾%9 /FdrgoGj?Ll݊O=~j/2-s';SVM|y]Z*)ͣúJa%T6F 'o/,D$P hlF8m&@_ wILN쳰۶Y$pk@ޮ]p=J%敏/-~%ykjjPLV fglg%R(FX\`#pfH<&*e8蓼ۋ_4=ǂB:۶h-[$:;q${7 ~T_~m-*s`A6< 0psBQ;)K:nrrfr)s &DpjVV-CK/&25矇Mh:pm83~.Oف7@V\!y3 S_(>ټg@9>_TnDf/!73PBPЀ< Zzj}I!DOKJV֬AE!{<8[wE>ۦ󷿱#?{lѿ5#ϗ5k_N'0v;]۝@J?Q t!(--OxX1|a&Ptx  \ P*"ĂU77dD~DGGGQSa6N9 SSg/(w_R~Pv-}+\r ¼3@ή] PR\Lƫ6  1K I(-XB@ofD44"#<:$K6W]wpe%6lpߟq%? \\ڵX|T"gvׯ(Gw#Lf Q,|坘«|aTO F%:%<#\) oތJ=! Gdl qD#j:ݎ櫯FѢEǃ+4l~?r_|u͛EjDJI@N-_؈Bw|r/wvbJ|!hg(4^BKޏ \bxo@{$(*ݎ~ ́JL} LO#g/T7o?yւ%$ f8w37l6*(˝ FpsN%~  !|x' 29>j*p4nRX0SS!:5 d6\3Cz+*X; ~JݼGzjփ9^.IٽGP$geeyyԼx~G;b ob$|9.L\5H0LMI@ظBRD p~D*H p$x1e r0v;4_{-??_8M@)NrvMѣ؂i0;鐔x B9[,: MN"4>Ԁ4IW9hZ5́_:N2 999hjnM9L'&>0o$I)+<1Xz'tVZ"85 TWnn.9nTaDI9x"$իQC#Axj '@BgSp+W8n"~N֮Ţ/})~aDWvsOF?/?MMMgeQ}S|a>ɒ/!1O,Z / Gp̩[SUU]0ٳ8{N<핟fdee%=@w7 R i#l>ֆɋxbN:1zZs2 MMȲ٨Յ=g" HKȗ<ʕmmM?')~uh;xNaeNمXw>}⇟py; v/! !OX+SiڸA:.sZw+**BCc#lEKܧm'OX1|ab/%0, IN41HwHuL-;U\R T3 OO>0HXK< Dk+Z[#8MO twώzbyGD>h{ /G&p7'Y,{^e娫;Gx_tb9/!Ka e˰#q74|wT=W/xۍuu#(:v GWj9h$H`R,p7$n^)Ϗ&Nt,T#x ,@,@ߏSoHwzYlOUU])H;;+s.~O_I /b~?^NS2Z2K<)$0w"f?:=W::0M?#%QK*$piSZ@L8189[`W>%<OO#G7ed4@0-V%G9}SZVZI')z{\#'r F epy'Y3lS|^L韘띝#YA%R$'#74`9ϔcDaz=LZDf}6+~ON^NR~b_DB~> i9cI,k"?Kwtbm]%1.~84 \C !$cq!%1g _9'iAؼS2gcp8дhQ=}<[ǎ!B#bEF1Ç AHORvp- MA4I"9eF+>^?8>2wE.[Kxg22h#sM v!UKWJy&|HwgZVҲQ864"tF_c0   'k ""$:,[z4?I\3gcrrr$#>8A-/c@Ҡ Qj'u_)  @8 P$cRpU`fٙ^\4$#C&rIgx>F˙%Mi4X~9 &I d:zŮJ/)rI~ 堗 X$l}EM~sikgI z qjV¦y 2+??M--U]b%#  @ʯ-#5U [bB2dVe\hlnFqaD.~~~&6HQrg%Q]i% ~%&w1xD@ի$`QЌV?]Q: :z(AGRP0?$OX^\ iRe^:n#==ؽ};hf0jP̲+< .`lDHR(0psn^„!Q.V ~èeC9Kq7#b$ۋ]$PjU9I&̪{.FfGz(7Fa`2ҦsV00@#(-~Go/v($ ry0&h;:G7 {T3 i}Be= ;MEjzOҕ],+ (yǃձ)¤EwƸŒDpմdRqf\^UըVPd87::0D3t? ܼy|5z:JJ(d+;bZWUVN `f$((C|\KyR者3 ፎ S. 'a)>H`zꨙbҁ| IIz8*{Kv ~Jm6_V$? #GDrIxXob/P>ߔ@QԔC۰JY<_n#ضc<& lXaQXxaRn<rsM5G֒>黁 h5ZEXr&x%d'IJx>a_ Z}Fj[ E C!$H^;Nw{r o?@q,|ųBPtjUXy/AD~r!0bxql 1API=dad2&=$1rq$9C$ σlZjMj4ZoK )oB2h@,L1!( X:|ѾC^J0% .*FIjreR} V?!5iIp x~YICK6mTgY9CT&O \"K4(WZv`|W;⃒8P4 ZH@Jh羋2 |N2╗R֋irU_Xazp%|) jd 9hD2.r%6R;_o/%w#@]Kr2+  7ʦW hWH/5ㅀ´ Z4i2 bǍ+!@J(0+tg92k %g@s/~P|@@dW3 åF|0CPy KřAYA /,ըRr@])ॄQ.Y *HGQtbaR zuځ^NW st1@6ț4rk f(/%g=E!U}}8P2J_17j@Yp^(s #"w*UJ|V+jb].^N xgJV@.4Z#g߫%I@*&r)Jg A?ve2G#1{LPqJfhqj?v2G)9(5 yck┚js OD=1 DN??,i#E DBU- .'tfɜbAdN$2Gs2'gY,?fCkx,B%tEXtdate:create2010-02-20T23:26:18-07:00g=A%tEXtdate:modify2010-01-11T08:57:12-07:00,;2tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?tEXtSoftwarewww.inkscape.org<tEXtSourceTango Icon LibraryT:tEXtSource_URLhttp://tango.freedesktop.org/Tango_Icon_LibraryȭIENDB`armory-0.92.3/img/conf4t_nonum.png0000644000000000000000000000043712414772654015527 0ustar rootrootPNG  IHDR$&9sRGBbKGD pHYs  tIME-IDATX1@_N`vԔ;XxceC(h"qm27}d@f!=@ wؓƞET,r85u $@ $@ 9ѹM<.(ﮄMMr` ܌wBk^Osk&tIENDB`armory-0.92.3/img/button-green.png0000644000000000000000000004535412414772654015536 0ustar rootrootPNG  IHDR\rfgAMA asRGB cHRMz&u0`:pQ<bKGDC pHYs   vpAgg܊HIDATxyeIU=rڗnznM\EEGAYuDQq8; @w@ZKך{nz˪VEe{{#='N8q"H$l>do |Pi0uWu "ITo``Oc^:.If8>(Fh4Q09Nس3H뒂ZnCrR }[( IWNC"BN/.322n0rK ÒPg@HfիN "fGpLBjd;Pp\-Yx 4Pq8Վ/>3l/fDP"iv 1tWiR̚ӆYAe40Ʊ~d$2PCWuKGf `y`Ь'0d onCx# ޲C* r+)]r-$%`_U@#X6afi6졩ooEYec=U=r'&hK/:'2GlHFnj>LO7#e/٬P a97u RWb(U.s79܋/0 /ɐ78?04Ɓ5T>_W Ѵ&xKNMX!^apѣ O . ^"/>oUa7ouPD {Z;ebWd|S-م#*୏WhxDW$nIR9t@N1~df~?yZ?\S{?ZVh|Q-|J; } сxDp*˴pWyI_'%^ҡ˷|6 Yuu#4 4fkRsŰL8'yq ˭%ZEH*BR\iNgǕ05 {Di~L?{g:vժ~,Q,w<;'RN+nB+c Ah1iƌƄќ1zBAw3b/P )!ʃByX(˜piVR!(Ag3m|Q Wsi7QtMT]Grg$UK]^3jy=i Ԙ0j:'I9 )sf)dV<_tS*JA2l$- P FlF-?b84_OQt͏CDLy{$s\$HrFf~Kјڨ2sܨٌ m.:~#0O] IYHBvQꇤGXY}5h{5E%Fvb2}!q /lj9w*i/崗ԧuC-LМ= *N@l^iW&_.|x(AyRnU+?XF̸+fi.; ӿsM~1RFsM>"`2q fh8yL7ͭo Sꣷ<@_ys0AiO^iԗgev~Esv0瑳~3ԔFVژW֧3Yc:duFVP3k'tfG0xc}۩ ο"&u-t6Ѭ1:}84$Fd:J5v f} p ?'",7@ =ܴ('*eN5x'q;IޓH.OWFS#b\O[w{Bz1{\Deԗkn CBFcG84TזY4rSGfꓭÖP \8+tOeVCEcƟIIYP^H^o񒔻mm!eQepqo-w v헳cp//˟+ξo`ͬgxzs!hO{'ϱC4ڒAR}{*[%Xjf5~nj&cx03\H3^7:%=cJsz9-fov_Ǟ-QN{N9GC_4nH[/u CƂ6:#jS$s8geҋU^~ω'(' TGf'7kd׵\u ҷԗܑZsOpp: } 9])uMYc&Xjٯdr lH`}%^HSW~RUqLRN<Z{=~.}=W}Ccatm*ۄWyۧc m?t7ֺVeo(%T*uϦG'CJ '[. ^ž紂woTD5Ǟqpq2͊2lسRhj+/WCl8[PIoB*YS=a?cHX<{oʽ7[s|`ǎ˃`:`v9v\lY2 >_m QoyK>/֥V{휾c\8o%yOs:}S$Yr^8u38,FS7 ֽx}P C^{RWy?TBF>z7#M\:9&*[6oz B=ؑ{x2_Z0ִo5S2 ^ACKʬ5W '^/} .u烦}~um:W0Ik}:%m{H}#m/ ٹhDp%'#ܻNPU =L\$C,nVlpsݱ lKO5lI_y4B}h9D2r%P*ݠ͔{'vܬkU@_J;?Z'QJ&+3ͩS1H?S,^@n՞ٳ_oI'ThN;k#VxNL 'W~ >Adrf>9ϥ;֜Ӱ`ā@қ')IҟHb{~){ K|WN'j9:k0+ʊ8b$f̿Arρ[ ^aU7 1hZㇴ}`{y\J?zxZ-e5BR~(Ij%)fUs~ >/o$^)1q@ONǵso7|KWMN*8)Ya PӍvWdU#" #fLSUQoTU~@p#И<}w9rɎkJ*3Dz\.Կ gNK˜a_j(U z̻b-'kHV1ܻm{J~<>`+xWNyӹջOU$?ը[o#q'"֔?)츎"Q776zK4nq<˰KrܰT3׾}wἓ$iLSq,oŖGLꐸ ^dԩ`y $qך־ VqxI/(V*KR_0PjdC`| /(cJ&l)XDds+hx-PWҒOޓJ廥Xwalþ]{W^ini*_IP˦.ꐔ;XN0p5_!%bCҭБIW$c/KN<]+>eɉuߦዙj4;XJiT ')!巙fܹR">i/'Rzy0u0 ʃr9/Y|PWت¢ΪTiL2S0ͷ w2l>j3&L%y%И0j%nLN%E[QQlljxkpcdyoPQ*íU;\S\[=c {o1񿜺A%;m? *}+L7'iN h1`Na®W IC_z>xfwz!Foqzm vmsJ3C:Vú*DkS<;gzag+as*' *`Z5zT0Pfth0s( ENۼ &VH;-,jZRz ߰'* lDDaQ1zwY#<fa%ݦnN.O;!Hs?/LL [F^쳘RK˹ov@,+^εbvAQ_bg;WY5jVx1~/t/[9m Go`ؿQT7B_y9ǏgV60t3oo7ӹӚw%Rzdq>βzaTodQWت+ROa80Qi/   \x/eQ0e9 ;O57]de3,kCS˃4NjjM ?[`:mc[\%¨?L?Y}yc/ iMl+RϮ ))>V I8%Ÿm2s pܿI͠Uoe>;aMGcT^ NQ7JCqqνϟ}uYe^k{)Nܷ~p[Ų| 0^c,F87efD0 q.s_i /kd/~?k,AOEJ&m9v߹a0o%:"kGKsv"*+Ud՗3@{Z;.^Yο!wH Z5at1V)+t:hnkpEIr^XbOhjL=gE0GN }u6h"%\^]G>kݟb$-:9 mnLғrMd޿M+K9ƒʈ `v퓀qwbo+1fLN0Գĕd]]/r.bӹ!\\I|uq3"mUE@-|`30X4}ZⵟOnSvg8{ ; u#N7lg޷/ɪ:p2;vVSA3F9C=4C5ZIeaq @K*I?/csqnfZO $6#MifwŃݕp/W 3b cd0PԗI|D<%[8kA3ΑizVj4BF5t;m?XADq|JG%飒Qe, [c@ɷXgMD^G$mc-% 9q8IpΓHB˔|RCJxa}I݋YF6\3mPf6hdU2m |=hƤ$.'`JҋKsόPU?JŸ}fx&Y\]4rY4;Vam5Ci: ͩx+C8Oy̱^BWN-}V]!ZDo:`>J%4Lyh?UvKd!xr;i%r)sRZR8/il&ˮDzh@#7Hbp8LW(R_"q)ޕZц!fJSda%_U|34ǩ6'`PVm:%3j"?HĿ0e,3pi ߀_ung(\Ci%̴fCx,RR+-K!W'!gi͔vLjՉgOؗyg2e?_fmL+8,0V=B#vͲ , <<> W_Z2zûdRH} <caUW@3jCz6ChizLiLPfM,o#mcLG8)8[_7FKr,㍀jVb<4KBK}%OJs/r&553mr/\#g>jl*I}eA}Ԕ`l Y5o3Y.{H؎ @? 4#ФDnL|+B))rk.y^[s)N?b4ai:P8~vcy!L5M)%=267gZ}k^װw6ϠA*vw6an!s2ċǻ`'+Yin1mM5i,x 5mמ[BNh++Og4}=Ⴕ@9`Wloaa|s^ƖVhdU&#x%_{H}NNA6غ9,d[ Q26~flRl8 [v 43$)χ]mrۇ QjTRI>xdYZ6=g! %Wʣץ mZ6V;+s:/~l΄_8^\ڢ +ЖZYol/?lϿ`K;5/ nulu@6 .7ub۞UZ?mk8:ws؂Ouq5M@)L̮}wéU%RȊfk5>gjeX&~v)Nq5g'=h_| p$Y{4q vNHm>0cWD .~p`(yG"e fc7~{? ;E4%XDzgG"g8@.]):$ B Dd҉s^KӌSNHH0_?zCAl0-,3MHd=b-gfCG/Zp|!LG"L/ 678t48KUT<~h6G) Y[H:J  Ͻ}OD'K8 !0YK;3f e~4C೹l$Y&&f W&NH:#vȺƊ$b ;u"Ȇ&1:Xfxl  HdbKX/vai $aIPC:/.Hdb3yͼZfD_:YD-M-;u:D j @:%S8!K[RlՀeɵ uDD?@5i;1lљ ?L;)#l. LeqSHd]Sl&nyXiviw"sJ4"-981X cb2^3D6&Fd\?S7q 7D'Kdnb/~ʿcf4AG"N#3N}A fr(jHd}0eB E= N\ZJ@bXp$ Mi q/6Q80H?YWج=jv!BݐDNjD"0;_8g c, P`FsD"CYc! =)ǔ8Dr3T 3*S:,diVdOtX$9X;md=jןb(8GP7Y;%`׺)"͇6:. 6\PwrZ "CݰD"g\PӠfYq~dn &. 0/ 9;H>VDMǃ?:*=nmB> f5K,^eN;,EyHGߋp4΢L!.#I$Y)%s ̌LwrlSun-; _Hd #͚৾ofls-i|?4{ZЀP_fD6Y=/G OmSK8- 3q:!kORz|f7|S"fq*san>]Y.-˯EhHd\ƴY|=qg~SveS—a?&!nHC\(ء,X=r4'Ul| ZtD"AV3U [\t܌Osv>SLoS !&>be5v2%)g7YBAZ ۔Z# LoEҿ}v_0[Ѡߚihps:Z!?[9?._pD&ᝉs7;TG@"F-L=wqZ|a*c4&Ƥ!ӨIJJceE~t~n8}?9oz"N‘Hh3-`RO=_z?juaD">43T9x?9~Yh oHf0s( F+ mBx+_Qo\Y:qF{|g!B_@cʨښbe#H45͂7>3gWh*p 0sDV*d5>RW5ofݯ+ U+ި9c2K, 1%˛f7["z h0 `ҘA)H>ToEYf vHOÞofa 62 v^kK,XFc2h64|o~ݬ+wGf]RP 2$f@$2q6>12Ϛ+{E~Sh{C?Ԅ_v'J f<濰'2m5I[k`"V>nfVPhʘzx}s$Y0Cqj;ϭ +/I"Y>Q:/̰Aj&Lڲ \6ӊ{yZ@|ʰLd8cblqy✱'Am{oNpU"ƍ>D6 ~NL5|Zᯝ;v xw_x*:%RO"C874;4{Ksg`O'VMj >Y&g4fl$O;_ao,nZvV~T(䯽Kӱ;ۮ1p&4)㝲wMm~&}wW~V5YKƫatͪ8 h DM&VwN4ۯj?;}v+ x_TQ/8qv塐J#9':LP:maՠ=tVڗq]z~R3HW{OzD"kk?hXv:f&c#Y׻3R{JD^pۊ&dUlqPߥR㩆2 KXq|Κ<_!jtluD{=o}aJ7Ec =Bi ja2h@;F;M/Ş5I- >'K\Ѐ+.ID"## 0'Uïԕz^d׾Ă "R)n܄xP@d2s8@ 00ձ`>Z_^]m;&}y%"4@K, yx LQ@+54WDgEY}{~zb53%utXVc!!e}@}rIofI~@+ȕs^A5`w"™FyPbN#y߱%M5h3_Lk}k\L=xF~&.}+ڨqk==[-JoV_849w_3^ħ/xAyXqgFd0s8vo19y}:gY_1v;UBm P39/%UGD4aj?}In0nXs||>@ϖgj!9q;:}&ԡ:j$=PufD5`r^zg9o)֕8z+\'Onr~@@*.CFVi??jt!,d?.;~k+ѶZGp^%qo{W:\q%b> 9H`q=JLLg;c+ўugr yPGAnܮ B71@ l{"Oia,|%hîorou-:oo`)^p\"/w'NqqeW1L%-|/|IM_/ֺY,o_$}&h53F}IwY1X=a$=By@|Gd=#-g֍4erǶ^U7{AD>]N\gf[lE@diZ#t3,Cܵ>y9,fZ}H~NG}޺ֵ ) /z?Ëwɏn>׳U~of,nOܩ!?@X2,f:4uMϺX p:˰_:9wz8y^DQ ln$?9p`@h,P 'LUܾkqyσ4+8~og܉hbfLmmرcU Z/9nP>ńKa0:' vOB/1iL14˓RV{Yig_SME5'^ʜZL} <{ x \%JK}>4`Q5|Y(0sNP|%0&_5LfL/NY H;!8;q/34H*yqeH#i}1yTB 5}Z-F>a 0-X̮7^2LQn_7z>]h#JOc _$ߚkQW3&(֥̚AU + S~:\s&S,7 4/NۜKvv(rn^kB#lZkC#7O<9|#jḚ^PR5չɋ~4^։pfc땞IJ`#ycʉS*y|LW3 9GM<|Vsۼ} x5 ?]}NrΑ[.snw$"aQe1er'\Mǂf6jr99^.| ?]%W2(.p ]ۙ+^'Y%f0}T{\دxLf_49j8굮)۟K2/DܛsKF1Z%_Z~di}]+Z="gCAʽjƝm+x4 `WLA֠$]MN\듴3 _SNgm1yP{B>?Vf6?]縹ߎsj7P* yyW +Ȏ9& PƩFhK_ܦkcvN}},yXXٟ3]jkmNÑֺgMg絿GVWG.ۜsov.r`k1( {C8v9|9=ZCZQ{YSt.zg1S Uee ׺kǦVa(翗4s\s۝Ȟe7ѼAecGn<,$28y͜Uژ1}ؘxF*8n#5GW!Cg\늯-^se|Vܷ9≮gп1pP28Ӈ:ƕɃazj)xJ ̎_zϗB!|K@n|7㽼DDN%F<luu*[R_PhsU):Bs*_5s̘:7;w:fff_JjI_:Gy΄ ݀sjΉ^WyvCЎyÄҀP+lw$bpT-BmAY-:dFƔ1 >e>ƗUElF7D7/g,M]W5#ڨR0gCSMR05^$˰(]@<'hHTDD^}w=Йs.$eWԗoyVJB+$p侄vŕTf{Qo11 Pc% Q5[M> Q"*??xý։{sn_x,,7WG%=r-AZcf3][saѬk3Fs&Za'>{ԴifOM&|ژν!*3{"tŢ!VB܊p%Z礠+yR5[~8VVT ~*(Oi۟)QW4T,mSP mθZ‰{ Wg8\8KOaj {@>ObFٹsV3 _{ q"afLvjf7[zEsV$4BB'F\_q; >A.o|l 9w$ C"ܧjTg8s`N ?7xݻH] nx;q7\睻Xp{ ;Y_y>)CU'+f'kɁ|jp5a?MZ@H,'&Jv=Mlq *FlhT 0x8Xxx8px Nz0x;7QS^s`s}Pv26klD`}@ #!sBuvBO ! dqgyxL8 9=!tpwïK|/¡jl:@jBMCꌊ9* PJ 'OwIլnȀ02:Pj*P+yÐ ^wa[.Q#\>(+'dE!B%)a@_o(PMrnqd% `_) N@H$0 ћ';tEXtcommentEdited by Paul Sherman for WPClipart, Public Domain4%tEXtcreate-date2008-10-14T16:40:20-04:00 B%tEXtdate:create2010-01-11T09:43:43-07:00%tEXtdate:modify2010-01-11T09:43:43-07:00_0S2tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?%tEXtmodify-date2008-10-14T16:40:20-04:00|vtEXtSourceWPCliparta$tEXtSource_URLhttp://www.wpclipart.com/4IENDB`armory-0.92.3/img/frag5f.png0000644000000000000000000004144012414772654014267 0ustar rootrootPNG  IHDR\rfbKGD pHYs  tIME2^5 IDATx}WwIl4NEf54yR4 CEP 4|9}$Q4 22232++<]|0g&~|= ߿:p`6] |v#Y>G9p O? +oAC ^=#O3$ gPDz" (?p?տ;]{W AE{hGS(?>h1^ԓ)/7O{r9#0*0%lgG._{Xmi4Q㊺OWh!~Mo Cq"wgs)H1mV(ŏK8qف5z}*O3A2rވU r*p`>k-<xhZO/^~=cS;؃&0j! *X!)vp@hS\p?X^^<|D^^Y;آ`>gQ^bA)\ϒ(Ziq6 C]+>@0LFD<@ֱ}y=KcN#͗Z$2I& #`B!xV&4GQ| y*0XAa@!C2|=G& !?ʷC^ü *<@ ћOooO)ooSzxɣPiimC,skdo& ,1W@GFkkmvVkaJ#ph QIQ3x gBGiBϩo͵TYJ!|Cڳ|""c`GBN _{ä x@BTO;מ] TiwuCΑ gK=~UǮw>Hul*q[}_En/Es 9Uhe~Kq <'|Ͱ#ax}ox.Y \y#z g2wic/0b Dݫ>O,r 8iw6k?dC_T߭~_wmѻ|# uí{MG I!+x`+,8IfLW4V_=gj֗eމtaJNha 'Âvfa~D>I_M/(:=zkW]ԜdnC[ߎm?+?aA:5quA7u~@&'ҁL@T 61~x+^ZSiPVR3Z HH -niܠ-LyZ^6|GX$׆[{eb؀q~Q-]. [E2{{yxE7`yad`"4{dz,sk=ܐ?$bUwFަ ."El@F?[Jዎt6Gx})0{Fp!l@X ƦA ZL-fre4Lf{?0ޟ%:'B>Uzy1W0 {L6@~)/ [)/Ôחx_I)x$OJOT߃`_I0 |Vߋ;f,H4߃.@*Ow{i[{/^fb_0ܼ-Q~>OFp Fn7h(lbי[_W4yǰ^>+a^ }PV&6~Q݁I(ٗkFygWB6 !5 &5~)݅IS滊Hj"٣F콾_)$-6SI l 6O )6c?{罾_5 T2x` P#fEDS<~$cXk&&6dTdߧhӼ )~Z,ǕWL@i%0~wa{S_'j×[ E^y1OKCq[DcS~ =^Fm6D6|"+㟪HG Qj%i^v6|~D ?%ɾ5~5S80dVda?ބf~,_%1! ) ?0ɾ5j&O=26!a F0qF*OLe Ϥ/%|W,e1DӅm 59ig|20m>IA@tPx L~us\u%I/ƿLo߯VyDwK"@=Bs d;s 0{uWo27~Zdu} `^N ` _~af2_#CÁz$:Boa\y/&Nժ+]2=D'wk J+&: L$ސ{A@]\{DSY~o~Ȍ/azYj8mFyNm:LaT~`>W;$T4"2L'NlEW(do1"*:z Lp &&_y~y(<;Pb70HkoGD-ϙhqJ~U#5gbt_1q s&>a2һB=_X/x7aʃ4C4@!cn'`~I~qW6`ܦ"`*cn}S{o 1^xCCIQyt{NjJhפ-~ۅIG }թ 0@[ j(P5X]~6wO/WamkLF%8܂IS?`'40~ψtYԩ%/Z$ _) T+ Sxq0އ|dOz0OD6˯P*,%DWɀъq5_jh pWi=+>A v (mТIt/_1~~U:CHW *M3^6 //;SfCJICґ1D &_n< W2*߳H# S~rYI> N9R|d`|O˭Z7.IY@.{0棵//*mh}ImcKO}=˯@-&dPoIR˒멿_~U m@a0L.o,`SjI5s @o10%`?kx˯B!v$\@O(K5@j^_6]X@Y`xd_S[Wj a,hÎ_F{/$|_~'CJƞ)2e[Lc9!LO˯ڱ-ʲrF, 3˵/3ޑ_~Ֆ(0 ^7Me =[|˯wzeJAE/{ {Q>95Y~ /h%[3%D$U{+ r;SK}$#ou׌G*2EPD~+,ÌZ){_u z5 D aP1Ô\o:YPR+1 p` ]0)ETaAd<Ws=Y@\4(2%2M&,̍&gdyW ,` 0 Ӕw c 1Ü*ׄ  ` f6` 1M/P +gaJ ,ǀ&ȃ_~ 2+|q T „sץ0@W6% +Ղ_ô0XV`Bi97WaeoNBk0-V,O `N<ׅsmhx=5Lb:\ y0YL' u3P&Hi`Of0` j˾ r5c4Ar?0qj`0B0W`Q HG~5џY`kqi2Vxܿ ]q ߷^`Ч~k0DZl`ZG0+[FKRc~)"y>R BGT0Y$\OY` a0zM+0؊ݟO,/֯"uyK9}#F$HJ!In> |&$=s@޷)fN6z}NBw ]Cb 8A wpj;tIJD@j.<|#Nҽ _` JOLY`00L`P?XHǂ <4DzDpAGyZ9_>J\vi-(PNyh?E0Qg8`@bF1^+LhDk67+՗kzl.T՟:}-q_iKpzste3pqRTʤ &BS5(脏t3G$-ֹh'4{IO=m gSJ%WoJ2NU\%`dCbzbGYI@w.jf`KYiq,M@56#5^3 rr$ x0rVq')yBš" !H67f z|@O"j'8\J (=#Rt,WIE7Z,$KPfPke*|DL߷<}ĺ`|}+?ltCI].$ڲЬdT 3Bzܹ(!Hkm2T_EmZ N`(r \tOX4џ}̅7۴`x%Cv8#!8'!8Z%f0z'4mZ-&I$eOXFז$ɱkuJ3bvv)3vԚ7+WǠ_(*I.. YF;5۬#Lvb p0!@7+`ҟP˛jmqvlӊ蕩]nߘ@)YZw٦mZ g]T `bm̓J Px#sЀC'Pq)ʵVkip˕df?A7f%5 &-0eBK.lofe^zڱ;WK0kV*w ˋXPg%oF_TCnP7P* P[0ȕݟ03sQy)]rK Sè!vkiJdOOBR9"M斕+O?5o. On 7XG $M K1(*5 ;%\oX4T4. HS ;\+I~ ]ϚD4k5җ}&qY!D^^>'4=kCpxɏ߅"L9{<_;<ԍt)tuܫuR uad_Ip7K?0r OP ]p/rg#p8|P!\?? 0uaDWԃ4X K5gW}íO*6% xk2B~#C45_ QD݄z +״B N<3yk8O IDATM:sx> 侮 +=g=`Zz$x L]8p B ^ïYw0 1])to1\ѽ}dt5Ҡ ז%EK\rPߍHLs? 5r/Sk Vk{µgrLr Ε$^(~? D+To 5z Zσ 8V91>D&.N/ GvXl>D4`+#|K#%>;'1{e +Z!hmKkd99G$f;"06T?`x1~<C>~āy Cdq\ ?x6*/s|$U& +M'6Rl^ '4W*| (L\J>٠ٸw HϝKïV%9@"* ʌr]/h'2Q!b zhc̢>X]/R/߆t_-}GFdD)&!8_4|(- =+ \ci"y">Xm/RҜ㒁x$ Nox&í4(SriK+gF@ XRČq67 iχVlƍLMa&XzpGMI}eϯ/I}S) T8[R*G^*\=6r1 z(CJ5QT`F'JK}]ŤRt w+A$ zf"9eP}!s1p%0h,I}'L+u? %)zXRatܔɭI= ɻ|>qي lкIfU<LF ꯬7%8DeRagNk^*\ [y7! '|Ww?4c)ˍ͔ $0?gv~cOH.i7T* zz,2O__uBB+ט  ($E=ϫfH}dT[C) $ WW][mIPƝBj~j|Fg~ ~-MK껈 )$ )Ra$ K˳$^;Uvs .@LN"*W"{ 2H"(Rˡ$mlZr @`m9Uh!K0 R_1R_'RϨ^[HiHqgh50R[' -Z'_榆a|fܯog3dǑ\q0ߪ)ylɤݜ$A{wp)OzXP8Nj{NJ;zZZR(`ODTaҠTV.͵yC;<[.}7n3:|#REnUd$1ny+l;lUS}g2w/DS}$Rߔ@@+NTXk+u%%;d=cp%zѽ%m-tܼmRERz$JGz ,BꛈV*}3KYnB%ǡKIƒ*T8&rΒVE@%(0m-l)' gp_Ӓ$9V*} S{"aZ$KѤR[4~-kqf}ڌKר./F?ue@M""a5;QzR_m "j-E.S]4Z*|b( R$Ÿu[D|ʞ5ʁD¶raxwa-,1ו'KIM)BH!j GQ*CڂkR]6~UTB+7Eg_)YܬUD6S(`fe\A_zI%h::Wc̣}wՑh  +0|T,@z:y!HY껁h37|OcI>UX0Sq'"SUU ӂE&qFP@FfK(D-v7| GH\m𖡆KUPZ]Iz3S"/FX@?reR@Q͒>W*]BH}S d [DV"rmHc<ӢPy%r$v{C6X@i/k4@H}SP`Iu>AJB4//L)" IUOX&IO09"Z?ƈ8[J82 )5շc)tT@K7siTO$ )/E_5/,rH&K.Cij~bphPNNIfͧY hLq ޲KݤV)YG ѻR52ǴTƄ)Z$8t pVQ© `m4ݧApTOF*,ftz/@$"icYZ'A`=TH(0hɲ}brg%R_Jɯc)>CuRaY-L1{$cm6,LitBpsd83 ))n 6{ԷH.Ս-zoK}]uX2IߢpPM1Ro IGS:mF{K(BĮ$4| pHO[)Y1`oZ* 0-.DbG~)% VHЖR`v(52\w>"ZIQ{hohөMryf%S׭|@TO)C&9WzsԩM &x(mmY>rZ m*ꫳr|ɯV؅p2UXOJ*lzdlSRԿf 7}o[m|&lT E>@2qTa-AS/Z+ 2srkBk E^ssFp\FS#*'(]ٹb8K}  **,` _$d/Pwjʩ5,+ 0}Sgf-%Vr-m<[eשMr**l9LgUDd] '4稢Ͽ`b+Fufh a. 7շLC|_wXy$Ra{Tغxf2J=/n Y#D^nV/uxdE 1䧧zoc"Ҡ\ºY*J S]p6f2 zdq}CV>5+e9c^mܒdBT PZ.|&  1s=U8V*lbuW}uJ&u,}%>D%ۼw5 VL=uԷq$RaN* Rߘ]Cqp%AnN%NYs&M]' Ώ+qd( )Lk*/mP -= \L'}w$oM]DytwS7x1)0)R󕸿ҩ{o•H4xq@rH`D>@TBHh!` >lf b@$$ pM p* x C4mHIZJ~2K}; q`Lځ d+(rlxOD؀Ҋw1 pDޥWfYT_ݍ%S}t]Ť\*:~܌PXNEɆTFT( #EDB↹aRLSλ ?0\ ˳ԗ 46xô\8TOɔTS9$7KRV g49l!`{F$\ dD/D}rgS2ɰ7N@`K1(b0~L2ŧA\l]2tSVrv5#0"Oӆa3ovl+8f\wL$/nɰF]~l-~j2pf{{J4!I?DGaoEr|ӏ9nxL@Ga*/0kZ{`2S0:0~8\@34#)V2Ż ӗ9dadp?$% FeZx FFۿ@/zJ_B0YC=D %V`K˨ SJQ, 7aa*3MewW`4~}Njƿh׽cCr  V`@?{l^&L gM?sQ _( V4`1ٗ<r)iѐn@&ӓ$"4K`P;(?Mv9/wrx})IG$ߐ|T+{؊@L q-culցkj9CxG Ch _tN p?fa|.Nrը{x^”~cH2 [P q`Th RT \C@lc'H5U,6?vE~B(GDs!sbɾ l`9@7THCM6MaT_o#f$O`襵a e1TRQ{a\!{yT6 > gѕ2x"ܱ.'3?MVȃA,iܫ)Eokˌ T &"C*)}B6 bAA%Z<<  >u! /9801zGh342ӣ*?Ia㾵d}H @2Xa~>Hr$ gJff{D⦶$(חЃѰ)V!XW4_/٫}[RgkaHe墪L3\B+C ((cr/])42 E{Rңo_?eg{!ﶝ ;󴨦\uJ;̍ S9l:D8GYW`CQCiP@:o$׋G=TF߇R1z& !k^Wz* h 5yH BRPN%`<-P!grkҍۦ\e/~~Rއ)Q|;Ηd HEqI9*?У- AZ:bLJ/!¡ yHw8l!F!cL)qn%ŵge%zXl !JxzP30Ba(yDkWu {72LhFu*_Gƪc~jOe^%H'$ ŔoA..7QIkaHa uqŐt9- pG9m+L=4mQ=S  #&z-mdF>kc} OD6L~M:y<}lUO# B  hP.tNjruB65e;3 P+:gQ#lm}:tY8Vlٮyhǖ92C?;1\h4yMJl=-6U_0Sh^MpbD"4 B23 VjVQQZhD>A(&NJZP__oH:T5PSSywrg^v{pB7,f#X! 77;wvVz59\ׯ0ge@.gF(*)555PŖU2/pYIoey&9 !a(dg[X²Ғ@w/()9ۦaBTٰ)jX//njj׽zɔ1r4*:)%Q5G!HFaؔ\a vϦ9yyF? AK)d2 |她wQ\f6g+b( Xp8ƾz`OMYrss2%4EϢ i5?;vLق2EQK yBH$`ɶSPzPDӲE&vY N@фq= z6hin<0t\EB,&?]i_PTMi?Qm4۔.fFq  &3\cD`sڏSZ*-eYvq&M$Er4ׯ/Af 6]A_/P Bxh{'vvm]KwH$R >S bL)J 1$; @1!MDooiJ) 95-k[^?u/h h&2T`TބԴVU. =u: :ǝ_xpLH:%Krg-B@\ G._x SJ˧ؖJeeƼR%X&tGg6@@ @&9.?3) EUd("Q)$}7_p=q@$<|"RDS#EjڕM+6yZbw_95\>eS?ErFAIENDB`armory-0.92.3/img/conf1t_nonum.png0000644000000000000000000000053012414772654015516 0ustar rootrootPNG  IHDR$&9sRGBbKGD pHYs  tIME!0IDATX1 PDgĈ)`a#B*"'K K6Nl"nygءJ@Ŧ@$c8ɐdHq!K2d@6͂#le?ݖ< 22 2 /U~+,Zgߒܯg8 5ķ}dZ{kݡ:Mh|57+"2Z\Dd2@OY9y@IENDB`armory-0.92.3/img/logo_vert_white_text.png0000644000000000000000000215343112414772654017367 0ustar rootrootPNG  IHDR!%RsRGBbKGD pHYs.#.#x?vtIME%hh IDATx{V- IDAT=O IDAT=O IDAT=O IDAT&;l{444222H)6Igw=u7`a=6N r/ ѯ)G " C4Q>w‰2;tŌ1 IDAT Zh. L4NM   ټ4$? $ K.=wň0Ō1 )2 [D@ ׹ɟ b8;t:u <? ܼܵuˠ_- 7q6oȒ?5o w!  j~6  ҫҪro(5n8nˑ12l'.81 *  96_V: 7  >. 7d4jΕ22lʛSaq(-86Q  85ٮ o# @  IDAT   ;. 6eΔ5'/89 KI  6;֯ |  GD  ) #;6ʚM[oK9-,+ 4+O r #1 'Z3߿3` =B3H{1V  !1 4$n˨f#7;羁 8-V!Q5'J^6P+,`"  0+@ 'U#M# $ IDATBBʚ5F^+g"$14S>7`IB25.   "2$1 &T "G.  H=̓4:l3($H # "8% $  Ӓ  A !@ ͒32mΓ39nn'X=N!6   *Fɚʚl7.Z(M9'2   <>ʛ$R IDAT>60X BM '4   @6 ɛ %H*Y702    6.ϒ5Fe/ #d|7/]  3p= 'oT2* Mr͐4&d IDAT':x, ̐/͏P =Dž \Uo4y;   p111WL 1 )   @>    Ϲ444[H  #=K  ξj^    ̕4Uݘ IDAT(ͽfi  ߽D ,ɏ4Ϊ`r̔1 ͗bh  { \{w IDAT> ] #  222Yd     (((r   NC3 IDATA ((7ny IDAT ɒ3;#)oUv#!̪u<We=̩t˩sR`ǐ1SOv'^p ˌ/T IDAŢrRi3l]p%\2˧oʦmV^\o%[>˦l˥la} ]\r&Y  !ͦjtnm [Zt'Y ɔ7{! IDAŢg˥htln YYs%mV8ΥfrbdoXW z+V8gEˣc̣c[pTfgB Vs&W  ș<>ˣb̢`ˢ_:U7zRVu)T  IDAT΢^ˡ\f<l~*] 60VTw'WP777 ɑ1ͣZ͡[5hߜN5 [j$TS|*R|'R%B6 ̠X[b۰!p!i)RRz(P  ̟WjqA~?l&QM|+P  ȟT̞UgifQ _[_ IDAT A}j N|+MO/BΠQ5a ^ @/MOz+L{----?ɏ1 }W˟O̝NϢ*hH&M{- )   &yRE_LJB QU> y u]Kn@ IDAT( mW6R$~+H# @$I_^ʮMi PH,  ]43: Y-  *OY9T{gr  Ir IDAT{@U3R +g   Ō2*-#VGH" )WO 9mf=.= (U*6s.@Z9Ux58v ,b Ʌ2>D= IDAT  ǫ 'R6w &R@1 bZM]5Rz0 (W 7xE đ3;q*_`A ! -e 4t/ ŏ2 %{]^b0 2p*])%~ IDAT@ c].`^8Uw A /j&W%޵گ sh` eaȫ$I0n&Z ֣͐ @:M ?"D.x.8Qw2Y    +,  Ȏ2  Z]3b +d,g=ߴ͌۬ Ґآ d IDAToG`b  4&۫3<!ްG +v_]agSd7Rx 0ҤŌɐ  9+g-n ђݯ p7] 8-Ladɮ ޻ ? $K  >,!P,(6)Eoɣe@   VAad7Tvܺد $J "F Q3߯@ = v IDAT  Ma ڷ   џ &P/  ,m p{==b  ː7?%45@   pDdA}'ʝ   21+YF,r}% գա0Ʈ IDAT /tr  բ͐ @ # 79C̎̎ 3k@< M    K7;!L= ͕2A6  XUg ;Ӛ͊i IDAT>$= ]a)   .?:H!$A %>cH)   K095 >6" >j /'  ׵ǟAfi"  .& ѨҐ8=0f 4Vm IDAT 3%$   ɚ0:30cf I,SoaӎԒ0s1345Y_  3[]߬Ԑޫ ~ܦЍ8<@78>0ި~ oޥ6;<9tKWd IDATtBЃieδ2R9<5<Jz Gqhή~{;>bDq) ~556=>>cjy222@; B[NU(  b; IDAT222RR-333>=-!Xf  * 000Yzw444B!DGH{I',T D=HAt.\8aGH9PKI s#͠>_333Lh IDATK;LwZ*|Zk~333K;KLwa(@ |\W3337H; Ib?  :K.25us'333El5333NH:OO`o KQγXtj222<z IDATL;QccWAM^yi3338Uga77dM&M %Ws%5553332229S<2bI 4 >#Fr%444@@@; @eI @ - , Bs'U IDAT:ST[dO+ڿ<V9!k\ L$" Yn#{:R:5_M ) 6  # hq$9W<?aG =%  7`+Ña IDATWVfl-$ T ‘aUXcxr4 p Ξla:X; /Y8˓d  ءz'^٢~AV9Y6Idih R ڣz=H IDAT;W8[9Hb  m٢|(_٢{F9Ic Qf1z٢|)_ס|3Pn Or"ڢ}*aߧ @wڣ}(_֟ybd IDATM2:UC/Blء|ҽ*^ע{)_ա{ahנz(b֢z'a)JV5۟v)`נ|'aٟz'`)X`٢|(`ؠzNaV *8'N>.B    #3vo+m IDATqYl%D6$ 8I\ d   44>  5E k^&jHBkE?E `%2?6D)v#N `xUxAo|cEq"{H\Q}g+GA9'7?! l};k{ p IDAT^ g+R   c:t(\,8:=&R%]?3lN^ 9N] k FA27;>U<5 *$@Po IDAT!O @FK?>,a9:>K/IKP'h;KA 2T#nLwZ5 GbU.PA,| A@DW*^g)e&P  *N~M1o IDATl1B L)KZ{_] Jgx; Qw6%)%---Qlh>pwiR~C JPy9Er b : PJAOl' IDAT: U @ iFE9S6@ ii /v& 08ho]#mD(5DE?o *4h   Ri_ IDAT;$@{ L5P]i'  rC&a3%SBJ$@M  )a- YY= %zg d IU~ 8Kp IDAT76KA U+ N,cc5<X<W^ <O~_~F<u IDAT(@K#T#rh C>*W*(Wjx{ IDATuJ0hS1 lKQ@$> JG8 , 06$ 6;" 3+%#bhc: IDAT{LB0 IDATqb IDAT  ) IDAT=O IDAT{acp IDAT=O IDAT=O IDAT=OQIDATXVLNWIENDB`armory-0.92.3/img/arrow_right_24x24.png0000644000000000000000000000157612414772654016315 0ustar rootrootPNG  IHDRw=sRGB pHYs  tIME wXIDATHǵku?gv&Mشd״]KZHBFC(b Q_ EPT MRR1*ML4evskЄa7|?9w#J-ãƱd@fy:r;|={55ٕXi_&\qVT?n^jFSn4tv{ƿdsN cc[ex}?w t> OAPd7qώ)襶~9O&pnxXM3Y(b+  6P k"T2Ј1s0RQ*$+U&5|gRXkBfT~oS Ğdc$Rpzlom&,>-?=l}{طծ%MS)/" IH4HFD2j<45ɩOT:Y4{}`+uxW/m\s{oTݩZ*.b@P͜q@@ .AofY'IENDB`armory-0.92.3/img/keyhole_blue.png0000644000000000000000000001072512414772654015566 0ustar rootrootPNG  IHDRd[bKGD pHYs  tIME71bIDATxKdYZqߏȈ̪ʜc?jf܌ .\p!(B(Pt Qh݉Ш0 23[7nYȈqF GfeUWuƹfV8TeWs{g?l&/ǘ{X& '7⧁Zmg~J5Tjs?jS/<]̥(ĥo3xN,HOgS~Z`$i:acbuԱ:caQ9Yt2L0]fMSh>qX(RJOaX~Nwyܸp5LAӌ4XuS#7д* #*)WzY_1 'UOj)uct=LA 1͢׏5ma3tt^a{KloߡӹxBȈ:r:3㐸 EpQw-f{y0 ZtqFq_0l!#sSmgmm7`k-:IukNS0i|># OX,mx[tMasunx5UEfhD"T,%_7 m~N}q][s&>GG +dBtvg4:b6 / ,舣{g4*RX9HOc?-_MWVApLOwLFJC1 YL= 44zlF"n{9:Gt 54dLXV]I뒳ePˬLv )6;q# v Z-M˧ %C.{{tO:G䂲^VE)FdSS 88a)]7[ZCA@sZlJ.pHݏx=?P^!;E.^BNNS)Z۸n Ӵ l6a2%cqI@Yf1idPZ*)˒ĎEј =b#=zvV2  LX a~N6vZ_1/.g srrH##{z;FGL&A6GbP(C*ׯedo^@} {ﲷw9>a8GGwyn>YuQ: Y"G"Wݐ*d9YJ!A# bOodV|z)j8jJV躎i8N].FVH$:ڲzr$cI=hXV4ajJɺ^<@jmyI,,4]4m9It!mbA@Ѫ%"L[.gDCǩyml^Jvka6Mm`Y>T[}IJB﻽ZZ,WUI:[Ĥ@$0\_+,Yh/IR&aK(͓eke9y4`\1]j)nX,2I2U)sNB)"#e4q /"-"4~ތizTV y.Zg|ӆ4荊ˈ4%p܇Az0+Fb5j3$b/8'%ekUkm ,P/4hX)"xoHF zDc;@])%rHq/V{A *,)0O\w HhR܋&FO`E䊒Z*lB}x{:ŕ}+Q378H__WHhaY.ڋm w#ã_'Urڠ`0{zR"ހ_&nb`ZPiX'@ʃ?Bog1?d<>;%}mRK³;b@K8>x;nj}&'6>q;!Q4.E8SQ?{yr%y F^R{ׁ__7?SڒuVC#]Siji |Nl@ڒ]R/߻?+}7BͼֲEV;ߟHc:`Ϝ'Ez @PVz/tOqe\]t3Z!IENDB`armory-0.92.3/img/armory_logo_green_h56.png0000644000000000000000000002231612414772654017311 0ustar rootrootPNG  IHDR8'EsRGBbKGD pHYs.#.#x?vtIME66-pD IDATx}y|չ9,I@mBQVkպ R٫nֶu^Zk.ֶ$@! 7YB–usǼgre&L(xo|23g}~yGyGyGyG>[<*++Q\\ErO~t}-'O[$<:Dcvȁo|<'Hi2|'UZ'˽ȣD򕕕 O ń @W[.֠yQ ߧɮ]ގʳR !ʙ8`w|o,ͮ͹`ѓMXuk[yϤQ^^f^MD/v(eDE˛_DU`Fo</Zp}m\Ӽ%q0(@:E@$z X '>_x<[ѹpiyY{;G&/[t}gY7)W3__nJ40M,+9 `! +8*0ѦxxSG/SKxȣO^}^Y [\趥Ky [~艦G|/>)r2 CSA戵HdIY~#5.zno}^}[JtL eKWwp# 1ˉ("zZg"b;mnC7c y_軵/]cVFo'=hťnA Vxd }^p>̹ ̠DЪ AE"0"GlpW68j0D=3G9S_x9=bowϯ6e1oɦ+Mb94#b>Xa@ X4 D_Ʈ?TǸjμϼgC>{ݧEEELIIQ\\ZZz擟Xs*++h׼覄Caͩ甈̙3"OԿE`ϻ@ LDO ?KA8d;ܿoKr6L@ L l`HJ@v"V,ðR#1E@dlP ,%TJ){tp㳓^avR33d$B037744$~iiiR*5Bh7(9A}}SJ&֚mDx{-B=hjj r !uwEDm{c?S1)2L1P"A""" ;'ZP(4 @6s$Z2>h>0Gtl­Fg")u?OaYֆ7%r"ɲ,0OҲeW߱%ǘP/2q]c1nJRp))$ H{J2b(l[9.(~L igÖ J1dH"B@m] Ff1O&CBMD^o NS\PSS8fnBL41s53a0>*..~Nc,k8^=Լ{DLgJPVeÛ^–?`?X Q!JeX?!" " y ;__ 0eS P1[qKU֖RQ/4ԗMmbnF}7꟝5 )--c~-t¤&\Sk6YKKKQ#3 ;LnhRJ2yY׉Dt%%%7A5^s/9%$CЯu`d23xRg̙#Y˘T{pK7!DR555H?:ezo~Z*/1}S}/0ہmucWG-uCX~ö сMxz)#liS"m gZ/ O֧-,,R"X3\ff9;8)fS(-tR"E%p3_l&`̿ifqƣ9͜93-///rssg̜c4v03eY+))9peR9.kMo)9OcD9#! lq.s]`}%~ 0#N˛[I̼1{oϚ#\T_oub7 #<؇OZa(%75 TUU@UU5m+~˲0}t?~|ĘJ%&[AAb!PZs87)zu@ͬ[nMZZmR<`@J9 PJE4 31g~g{JƾFJdmm/z{#\y:onAc×fD*iǍ`b_TFo!gØ D,-"s͚5u 8c֬Y'A31RƁc/;>BI"Tu6E3fXGTJ6So555)**Z4ه2sɔdhL_3϶hlуDte`Ξђ͛7cƌhooGNN4f{f^1A/6XT+DvpppKJJg"mB 55HضCDDDJ)B(Jo<ܦ5Qtݜ8c~OmE(Rj)3,v \3yo޼9[ _"bÊb9^RJaYd 젝Ǜ:A *RC0 s XIسOE0m@c0l?εp3ujlܸP(W9|3 H@`2X|Hw.ԛ̜#`C~ @L3 ~ԟZ[[M# mN d9Oeg&:>21*4vvvq?ghqu3P9ذa9|mmm$@}~~GRjVZ0Bjlld1\A۶WM_KDyns{ӦM`'8Q3f"33|0C^}"7 >\g[d"Kjgm{tPJI؇{DD]jW^ }G Pwz' w3 ݦaC) J)7'~Aaaa^=!5mvi+П}|w J̉`_Z ##22"rVVV!3.Kz ĵ7lؠߟ-!˲9l(+ i9^"0>R25Y+R__?8\PJ]y=]ik./hhh5ˑR|AcfX#A]oMfG`5$*\@ 0ch(\Ť_x^:옒Ùc"B"\LDW:6]vL\kyp "f>$7RJ{4N?lRJ477]C0a fpրy3bl3f544 EXʙ4/zH)/;;{"I\YvVcccJOJ9Y|J*]#Zw{*tDS6 ˕ᳱڛOIs v%h T^._?+_*۾'+{4cW?moD䮮.8p(c"lxy*8-[-[hswcffoFCsMx%oəB">Bd1󥆠"swiE*9X/>}zmۚ2222| 3ܼ6^B<={5883ӵf@ֶmr UaVڤ !@feY;$LY>[l3gDKK޼~`K:R-7773g֮]{\q>yx"~?(`kX-fbogcfLcAg@|>5w;ʙ3oE7a/;_2s)XfDjllDQQ %SLY \9 f~eA(7c(^%"%É\/rAubԨ[aXW[[H)wS'*\H ַ*t?N(8\Xb3Koug03I >?Tμ%3^v45Y`/5kB<3q@'ӲELXcS jG˲p0E9Zhk7^?51|̱@rKKA}|5$Ru(2Qpb4ۢr8ƺBHw@DAf>؟!D״.̣;vP8t&0޴kD =6&H}_n`ˤXL |-[GW ޻qeuP#w +3 N .X ƹtыay2wYcҟn]BiaDtNSSٰ3g]"gMuYun=VJ}@DokDQ<\_3s%Z&̻>gfn09,#(P*82ZeZBnˉ0mO2w1dvU+pƋ'$:|ԁo>HP3Z<`ږI@VaXs˿mI?;T b4nMcwi CL?̨5Gmm-JJJNp4AL"?d4* \TSS9bCKKDtv Fsfɮ.Au;77GD4)a8wf敭vnnnO1#|̧*N5 8sawf7$MD.PjUH?s9q3qG@# ?NigDq Tr#j^ѡLnI3&f<7$NB Ahlk{^X"""ADmmm%,D]ڼǜ+ul v"j8 we2݇xټ-i7bBj|fXL3g "J`@RoAG!$6guӝO<{ 5gH;K00@ H;k9;7`Gz|1nذeeeg8ȁG}A'QK G!DZiijkk/ar' yZ!ě|Y./I9Q":N+ZL Ʊ5BJuuu i^&h FgJBr:Z~=gj^ 1"qANA !`,e=62 v:  |s@揰j~vu 7fvPɏ`-/zBuw !Z˒Lä,466[4Lz"Y# Mpp" xH w3hkkmmmB3\3д:E zDq]Bre3b+N\Tp"Z`(~aYEsD4js|OUGVܞb[VtfF~"(RxzX|]a iB2#7ݏxὝPr$bOS𥿂k;Y wd_׸6Q `*Ffב>/OSMZZ_"җt)TQQjV0t̯OJS{`cWу ;# J]f~*5UWW疘eeeR(#"yJx~:Q 37QRC}@vl^k gc>0Ab. +mv  wݰ _?̹eyt8HlEڲ}T+"^<7"Ku=@8u?FO0+9\̗Z_W |p/Oepz_SUI$֐^.g/֞ ӹ$"!Pȕft1qcD; #;^f1s' j I6{^{ nv#QkZ?Ws ;S}R6CxQ1j'0~Dv,TTTbfu37UUU@o{;GG jP!պs da %~pnm@=o|T rxj[Gc`s:߉5kּVQQJȣ|y4M[.Z3PBa;? LR>{z0`y̷]f_:󭫪L_ݻw}QUU#z?Tq;+T&ꞹcQ~oW<%*n Zkŋ %g@yGyGyGyGy4 ob^ IENDB`armory-0.92.3/img/MsgBox_info48.png0000644000000000000000000002230712414772654015504 0ustar rootrootPNG  IHDR00WsRGBbKGD pHYs  tIME  4! IDATh0$EP8  (%,%'~O    G.=%  K.&  O1S( ft$,  oDz@0#ӴK=)G.gG.M07% $|U420.! " |U52ѲM3#Y?7*$ B)cH/NsM0!E1>0 V?%0"Mr݇1#/$ 1$݈  'M N'~}[ \PQF  EP B* Q:  Y?+O;)p :U ;(kPA    +sR9B2" ~eOL2 sW>@)  u  )  $*/*/"+)'+/(( ' ,))T='+U<'E1. D2 _E/ -"" _B cH0 V5%e$ /zV9xXS2$fzV;z/!lQ:,"o{V;yD;7\BH ]D,B;7t, cB' A.ԋn[-q+B.Սr^,E[B.zdWF{ŀ uU;UJFࠦD  ]G6L7a//9+ၲKc|;IDAT N<+<(555KQ8  $*'>::I](QIENDB`armory-0.92.3/img/visible.png0000644000000000000000000000507112414772654014552 0ustar rootrootPNG  IHDRPPbKGD pHYs B(xtIME+ - IDATxWTǿw^ oPL6ژihVZD f^l3@$ks{9ϳD%J(QD%J(QD%J_B32ͥӜR3u/ 帊\I`NI$rpݽ$I4$i%b҄y}I[6$m*!J\IRQIt^k1oGҚIν n'\%I 颤) @k̫ I $~@49/i&%MKtE%X7 *MY5I$4%m|>hs96h9*c5rl}l⚤E@|5}"629!%U`܌>WMY.Zu6l5Q q~эY\'~~p\6&'~lh]"Ys3ٔ) =o+H$Kz{zfcI5ˢF`\>]5#KQKl6 o60xЫK9f=Ή]=|뽀?$EҟaUWWs 5vo$M׀3-H>jl",-:On]9Uf{{%}% 0 ur lZ_%Csxf {1l܆Rk&ǣe7vՂ <=  KH$ ]f89)除0eȳqy`*[-Xxu2f-F- zصΥ%xwNNYOBIgخ}9\&Zfk%А 2: Sk(KI0601JCfW5J< xisNYfcNpc\ͬq6Kk%,|qBw`jL`.a@8Y\mNew.dp2eb;ؼ[K$PlWP0 hEùXFb޶x.Z]X_{u^fUtIU2x5]@u!TG=g9Ł+&$.3l۔Z}xZgsZz\c#Q?UƮ?"C2&\wQ@;VQLv̑oi¨V6%b>+.v4[)uƐR FY%:RV˸xexefyivx8,0ЌryW#ԫL̈,'. 1a!%gIW}L{ve<: IOpq\\MzӢJsKb]W$ ߙ1UWvib2ă.IIqØ7Ɗ .7nX.AL]>OΓSaKw *[whTmŒn%V_vst.Az/*lQ||dw21 1$w +>ތDvY91i?6(\!WտrguL\t( ͑'ߢb4.IFw.鹠p,!J\w]GNjU7lVMv؄>EU3DN}z޿!mYS23vJ%fS\ | %뱤ݥq.El؝i2h zjfvݮpօDUWP]v6mM]A{>Jc,vئNi"j{߁5(tjLnf%69%0ʼ2,3 rNGǡVP-jo-4J! M8֤$ei0+VXEy5 @3#f7&{YޞNh#s CrAtmH^ﶨb. <. S-KMsW CWY&y\POiVYvcoؒ tGQՊc]Qo7]P!Sۙ&ECw[uJy;}"v~QKꭵ:&չg5oX׻]IXsOκ6k.E#l.25 8u PZskfl:ui}]& Aη8gXһm9\Ōz%LtL5+]yJ_Q+YH` ~JHo6FÊFO\'d{f2,v=J"+k΁ֹ!ui&Mom5}6$OwlL~;uC5Ljp/ui:l*nqd7"@ !np&*j6z`NX8 31`FZlNp˥_ljshӻU:_̩/1;u CUF&k5/8tn1w q<;C{.%ƻd!*"xd=P|my:֡gh}\%ʘ0P%d(_Dųpp˹AkT"Lj=1$xڞ`P0Pdi(w洯J@EȞ~E*!qcd֕F74W.=.D܋;߁mBWQij +LHCd_>4<7_z%r |ᣮMU.3ω+Cc]w.ԃZ-uQ>:vI:OFD`B(#Z 54s/,̞|d(hm籵c-z:?rW/f``ZQxuיTXhcgsG 7 f8#Nv#X@&k51[tif>`T]v3{J?/; X hhqC݀0P&2Yk:',>v>n[Lk9{rtq%[ dy@lr:oc^*wq'ml\Rne҂/W5PGA0u!u$VZr b!& ܲۘ6#ܾ#=B(%m|O)f?G#NI4uȉze\UDŽ C| .ߐjDCJ=1I@da(d*N> >hsb0׋1bHx~_/B)"su8 ,ࠒrNFhT˖m.|W?q:jmBx1Rurss("^{14Jj*&y/ p]Zf)u7qE Oڱ]{5%pW,S{XPdd!e^?Rcq-[ᴺ;1`E&k5)4G5,4 IygȺw |/o+b 2hF/ɂǸOվuYdڛ+WCOx!u zϡ>v cR "`Wa$?VXo&= EAUk H$ O1!f7mĺj[B==F ;'L:zS g-'}M -CA csjN>F4%R0m,2zP䌩1!{<@$L$84WaM=} &LZ£ө&˖\󏹎8};s}ZB/ i M|0 8jkO:7kz)4vg[d[PxG#2]|`HVkvl@k(!pQ7 V_h!jذ&n~. ù"90 "Jk-IuIw.~AqӲ虧@|Ǜwmt"lx7 վV4ׅ|AF̐cOpJ; }.ߗ Uӿ\j5h"LֲPxagui;r6n^ |o%Ecd,$aj񧖢h{ ĵh{v49Ws./Dݙ`nBg (rR{Tm=_:!L֚™x:m1'$b,TF5I!$KfvG.Nތn;n!kG9D"Lj+ui9(\D 0|Pn75N1<_䅅H"\|!:7ÂWw}ùWK~iQw8f, D ?A&@ZӨxN; \ybM(?p w`þ7wFLte+(:/`zr2O(Cdr,aU|k;Ə^r wyG&PO!6y0 LZ6T|(s9f70w`sjWK.|¯D_T4S䚇Mޘ R$$3X|$U9sÚ@#HWv;Z*;܉=z,9${~1\B\Nl#J/NKA Z=g֣//0탼 ʗZ)@ypЯ%AZW1؎8Dd ?0 A] TX,=:4Jb};q*8yg_\Iۮ_l%G`P-gp& vɓ)grn-&HAt'B[gx [|xa{QI0'xϋ ?g00. $T|cs/Yӎ Frkwr6HHKg q6ˡR/"j2YFh'Mmŵ|>)Gg/nOծBy4? &-\O<a 2Qe3M>.m w7{UbeVI݋>3&k| 3fy|외npشʳ*A][~C'T`S*"z&jS5G: ցtZ&}A&Y,jxFxC"!<{=u>Bw!> 89Jd X<Z}~K)ՂF )P pH#@ yt\8bq`۽ّwrxo #'|A%5@t&} yxq-Y|+|~Y,=AHz1lɃY:R(k@+ϲ"H X  MhLM0_\ZO:'wqSO:M=wpu{#/N\_{:0tPiMϙro]]0BF@^}#;܎ޑYZaP(k@Wѩp`ƈ=> ߷ДnEcMV{~P=Ԯ5@":;sT#h5k0eKmL}wvʦ. -))9 bp//xE /Pȃ%bp-E<􌴣a <`/2Hd#? 0,+^& b;9;݅y346 MVظF Z l0_/0.Xq,szЊhJu*ZشUA4"NfJA 2Y 0dyI%)(HC-frE3Ҏ QH%]i TkZII@ FP{*hhEKDN+ٙSx;񻗟C8sc0ߏKa'ahҶN!TB,x{WcL'= qM\!|"~͞{;܎v Cd >dE"I/H$-*0bwЊְGFH_DXqGn'Qxg\](cџFG.DSC ͹0hs<ٽg'z!)O`+)!O/$9纰36v-Vav !# 1V Ts% c-!/ĿLprI)TT7|7܁=\xg$/nL&Vܑp5|FjN0ż'v|HD2(N 7 S+e tyifY#hr;ҁ6`cֵC;sB$Ox|*)eN'IhEɄTrQCc@> (f@#笸#%J=xp/Yc);ltǖӻ}]pChb'qBp*Z^L`L^X Cl8<}.6t=5y 4HY0#X9JXi=DIBr1rz$ 0ϹLLUPXqGLڂ~Ͽ$xX%l:a;Kq cR4ZSH4bz;8I=_來R֕7 ]}@W:@R?HNOy"%űze)Tqz/ BI362=<>["^E3a"b+"y{Q!X&)c ,;r3YlO8KXzNY^Jaϟu2ښ╭OO3wÝt-d4[Ђ&M M@'d*g &֗v/r=95o W^j@FSۛn @sE ɂB& P6xǶ`&x pj<[kV z-ҍ2<-/o~=47|I-h H ЂTX*5sxkA;R̟Qy{9g6!g#LJa;#9l>8|:(jѡm>$߽f" @II@p1FxY. jj\a~pBv+[7mF_O)#ASgaٱŊ-[g!"*&)E:p)Ι+dCBp^B^x(KN K " 5VN%Y ǫ'nrT݃ξdM `8bmP [^HU *vA΀ZUIOezOP{M+z]$UWPy{`Gé3j?{1]X{ct J23IkBd x'DL0$ZUP)[Ev'4DPI9~P_TC9WQ'Xv)/|*P?$b#Ri}U8i9:0qrGqAQ1A̙OH楏@ 8TD㑀W @7$EH z QQRXˀD.\B%@,H+i޼+~Kn:<1l%l f4k&L:A Z&%&3i{*@e !/ L|rBJ”hi0" Hh'Ѱ d@b\~p764 pۇx{;IVfMom#?FLPeHKgqQDmϘDG 1 !mq(SZqUƔb2XA+<۾o7 }TN<ܽ.`p7d턍iFoZ_EI#%>!2 $[B"];I(PqTb^tdV/?о_ ~{ҍg)zq[`LWF׈YJ 2 @xYÇ>*  @,zQC KI84*]hr @PGd6>p^a< g~ )+GzB0uV! fXxU#@ AP 1gR a яǞ<+UU %D7wo s`+/OyC'/GބId-q?e kNAHۊfj(# &@,(DRh%j)@OY@uedY0fP? :@|=2҇;u֯{Mo>K݂MyS:#. 4"l@mAJжOgAL?vw?z@ܓѮm6Ewwgm~b F}0کJiX~/<$ VK1Y(KE)yɡMe@h<#oFD[JCMf$AEvs۩!<ϱqfR8iXt2H>I:կďfSaџ Y]NIJh I!T J&Ә r@%lǯ;zY) "sͯuy܅ꎚvڬXW5@gGԡ-qf4~*ş /ɠ„/\ . 7Fr/ ?1M7@AnPƝO0*[- Ru]-O^s}Ok%`ׇ_iJbqHB?LRʑgT/9u4&Siԁj;ؿݻι;Gr>qvo"bRϾ GO= ṿxakP/^U|Dr ?#A?=vwoO2|A銬$Ԃ0mʋJz4o~yw7$TS3 ѧǗ]I8mӱEpqUSP/@JqX,04t-;^sl+FĘo0]||Iӆbyރӈ<Pt˵*M<ݫL~:9}YXto:b"uuDIS,-u美)6^ŮWƜ4,VAĩ3vWݕp/U+oz9g2r3Zy~Ȥ@s:V|h&Fp$H"iqKq{'`-YvΪGh^A޻_ߋ8`z'K:k V)^P$M$u$YTU!FL/%R24Nзj?x` y{'Fg6[pOh:E`!f(,Hu/!R"1yhJjzN>˻rn涴W@/~=ؾo9))S)(XZ"0yOaH'c@ń,uUCL+Drnn4Ƌa{gR#O<[^ta NyR,F@ &m@b'5+mk1-iDsfVzɏ۷i_3A)!Dݷ8qe1+ѕ~T;Y/)gB {Я~nr [c7azBce DUDPt(1A)#*nPuP:̊&nڤ%viE)ڟُulsRwڋ>r7{H!T3ΜsZO7Itt"*izJ3i@[#A(e++⒃iV:78Wt_܋{#1RX42,"@GiŽ'\ǀf PPs/#h ?b#ӌ&v@@vp]bGU |ma%5N#9 CZÙ3GcE3L ~9k Fqʍ;_#j ?Pc BAiFC'IG󓟡.> u_A `$?D&8gt3fH%TG_{\M_ K@K7}K͙r1EP1*)8֏Ϳ+7n؂1H0gϺ 3peKiŅ_mK ¤#*V^~~x& E7 [v|~c#E =㾇ޮ6ppXA,O4pXAB)"y&@ 3P fQ'n9lzu 5Bߋͻ P>6R,r/ͪE5T] %:Ij Nq )@ P b9P ʫb Ƈ+#xH>V'vN~%RHc,x(yCz%:0TQ󫜹Vuj<f䱰 wl=>7cWm0y!Μi4? ~ XIɱRc bVI),er#ȯ3CC U+~ 8xXY7cRzmTb@K"D;|ex$,#J+9Ȓu1@F@'9)8kMt$a6,(}̑sg@Lإj$5B>~nc#_ o{Gݹ4ki3'ɝ֍ƴK"еf Tj׵(8$s[)GITDУm~'A<}ذmu.R8~8vR0N?.,vč/Xq9kiOa\͒Hx"KI7&P}ٽ)Sv/Pcx Y9yqO"l%P0y{q"Biw1 @JLJhbdPWlߞďtogl'z_h5[ÄR%.@DNDh<?0C!P&IBq8Z.W`3[Xyk~}wIdL ^ Dq=sEv> D@,k@W'9Z$!U|}{jۖq?BW_;|/QzGӀk M)tx Ek(O')g5S̵?߹_Ʃcc[1ED@RB.A-k\J Id 3J>Ě_ )]o8soQ4?m[]8T, _%tLEZ_Ą%eJ̧@I]g]|ޓNOQcz)oTZ ӀIH*sc?`4Ä' Қ?'r֧vmC+R~Ӎ'. dPk?3p.?@"몄%Pp՞.5 CζrL$W:>~m`??;c_%`#a`☾:A)L~{[&~x1tlR%`|`` POKK O[^t E꫄%  l${I7KỐƶWw{dq̜; FZ 4i1`Yϱq ݰU[Q\kۨooE]XYQ*Zìt:vDju3j f ``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``P0``PD(۾%tEXtdate:create2010-02-20T23:26:15-07:00;\%tEXtdate:modify2010-01-11T08:57:06-07:00޷12tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?tEXtSoftwarewww.inkscape.org<tEXtSourceTango Icon LibraryT:tEXtSource_URLhttp://tango.freedesktop.org/Tango_Icon_LibraryȭIENDB`armory-0.92.3/img/conf0t_nonum.png0000644000000000000000000000056612414772654015526 0ustar rootrootPNG  IHDR$&9sRGBbKGD pHYs  tIME PhIDATX!0! ̡Pp <K8 ʖV*c mE$%B%4Xdk(yc|]w17L^#@UBuF%g|O oWh(˳aTm,\T_F&&P߀گP c,C$Oa|( !28~c$]П=9<1"v9 s*p+T(C]z$9| bIENDB`armory-0.92.3/img/conf0t.png0000644000000000000000000001302112414772654014300 0ustar rootrootPNG  IHDR$&9sRGBbKGD pHYs  tIME  ^IDATX yT**T|>>| Q W +#V, ,,-        **0./0KA>$NAHAZA~Zÿ1&!{ћ05IENDB`armory-0.92.3/img/bitcoinlogo.png0000644000000000000000000000646612414772654015436 0ustar rootrootPNG  IHDR&(7sRGBbKGD pHYs  tIME $p IDATXõiYw2x'Mmݦi#(J B*> *,A-(Mbhfk:v%^f_;w}Ç݌&9wrx=B)!%:xo͒~?ku: fOCyF - (E1KmYm={2K6~57_OX ɐfqvFenI&X7%L%iHg =ho_4T6ngΝdK J`ؠLp(O261UF{_do-/AO;GG2 wnh-icSǎwA'A }!'o{ݷke4*4 a$y2v<B-(/q#0dk_g74߽cGqwj@:356~Omw =erqF|>sSS)R 2P&NF+-'nek?<s%~Xܳ#҄qOscLOE!FFI\jA"#[ZunG)"iRqS\>/~zsCk}1&rѓgp\H8֎" }Îm!NRi9Ib0ʩCkNŽܽ)y#mV{عᮃ7yv ¢wx/w9f˭)#3Nܩ^ܫ [up]D_mrCoا!Po㧶4R! SIsEut$= &3?5vaYĹ7~D!eL aDesgYm'}NWnBơ!p V òRaǓ J&^ ʤlܲ!p T i2.L iǥP=$~}/c% 70:K.IBF B@D#" 2HdDQv%Pf(8lZE\ys:߳riđv `Ha@|Ҧۨ8 ]dn=Ep\fm qbK&ˡ5C\JB#|ֶe+(BC05?0k?C3X@jߥXg>\%hׇX mjZVLȨA$ | eZNĈXDfyΜ Re/}>l<2qEi\QCJyJ%T^^Nc1dLX"Ma!)b~U ±efP?]i5Aer˝WTd㢬JMF[HI gm+EB= 1KbH i*+W t'>`N av ?Si"_7IP xQB*\题fctR#l m}~h6mJ$( VR^"B* D{B(0|![B< [?{Jy91ؚx5֢U0sĀXEOs8vn;a&;#]G"ѭelߓEE!QN*$S*Qw#xRL>ķB)$Wсrw9do-gaeAJAE5ZX;GXʵHG~org^Iq2<թccftY/;Jɥ|u&i%Ea>iiX 3J0LARLDi}߿"^{)1=׼z$_ERlw+&TK%;̘Is=J<ܷnSw2}K Dz(.mh|A S,U\gB5PuQ#`5SD'L(}'ĺt&OOLeʼn45f&YQPotW[L*Xuc3Wl$@*jwlc!n/%a3`d5HߧtXXjp<_=há)aQkV?-pV`R+jW]c5:NG!Lt2hcbak! X'VΏRhյa*KեR0qnn[nv\R7piz Xw]z-ոޭR< ~NqqqҵaO}0IENDB`armory-0.92.3/img/view-refresh-4.png0000644000000000000000000006715412414772654015676 0ustar rootrootPNG  IHDR\rfbKGDC pHYsIIE vpAgg܊lIDATxwu'-'%e\mKb%QYD%+d˴Ng,G}ADz-JbLIe4@t~f x{aZX݀Zhqh1ZXh1ZXh1ZXh1ZXh1ZXh1ZXh1ZXh1ZXh1ZXh1ZXh1ZXŐ݀ՌH4&`+KХvνO)s63N8go9@ZWhLp%m~+-PpᡉFU E"Xk\@[cxI32<4Frh1 h rh x#CnЅH4^bU"ym`mT' 1snЅH46_zw=b"o\K|> AmA/^>IJy={E*eP)Rd YL錂TZF2C2-c1ЕQ?C?Z]Dc<ᡷ-h 'UR B#CE(E0ȵژ5P`!Q`f1fROb>F6WII?p'G{)"Vӑw-H4 IǺv # )fsxfcȪ f8=>cgO/K'| Y΅.4DOA&[q0 ] F|\߃ .܇Mk:1#"hH*S@@@3?aZ6  AVfDZӳZD2 ?ZW9'7Zz_=b"_(={mc/pfmQl7K%eDNi% AQYsI==c󘜉Ҋ1z;tB:ԣX PQ']عD( # (u3ꌄqnC&6*sHĶuH,$s8tb11J]MtmF="ῂOѧX>2 rm:]bM_;D(`#;+``EfQ`Qb˟r_.gAg 6(i*xNQ1a,FOLa|jZѬIh?FT< hdxCh˪ch, /|߃+㍗o`A8`3Etgb;JY0 `e D1@_z2 TL3xBE<_T%hw2H=ڳ@$ە $\qq?r=0f#qdye8c:T5r !DQ C0S,&s81kGqr o a  .-y`dxѦUt7<|GĶx~OLi3=-?nJcՌi綇~(@߲Cc~ɪڑi95%On+5"ػ ς;G>Vv] w+_1:IҴnX>hfJiI!\c\o-SmA3J&%XiF]ͅy1%^>x͹5* tdx講 ̀H4hk'B.|dxh"FKy!fK/;J?/x6D3\L;fr*ͦ¾8rrʭzf#Ќ B$ zy("XD=w2H4v+4}?%|;p%%sN 0k: $j# ap[QB dar>_ÁcHs4Z6kw#Cz!'o}6zx3' DO9lq9z;7ۍL~0$Zx=$Q0y=J02L-gtM`! @sͲ1uCwv6\w=3qkF>Uv^pAA#f9.!~pD?@|.븬RVnZ*D x2tNJh+,Q XĻ߰xոn(^_b$ţ("X!ق[.Q7&vAyF?%^^'o ok:ؔq49]vѿ_2]Y)$="^QN#l b"\m/?ѣdJƾ _^&n4[q!WW\*@$"lߏ_밮Y{RΩO*&W?nt-< Khz+ZlZ߃a #@uS{o}h7C|˹goE#6WHʆ+(C:b.E28[\<؎y>]ز8:] H4H4x/h/oR_[oR=-me81tVRɌZ<"߱rtw$hl"د_Z2- "ϕVvD֭+esSf}TN-#0N/- rff>wE;"Xjxyu>stۧnm*F$[ p}^6_ILyej5;3#&vqu[w_z˩/ˀn[Q~~!!RW-ƚ'I>k!Zƿ:<^*bv)DFqM(I}}'>zN [ tU,>pjP)B ADB 캤_GN`ߡsvH } ". غ]8`X$ ǖ5`@3=t?nf U 40 +܈kܸBmG@u.A&0 Sђ]`?BLHhK&B4]ozV\?{K I>mQ~}[6Vg"#K7fui|.&k;+oOIĭbR! jF)J{W:؆xJF*+WҦUʠ 2lo-7_>3cvW @'}R1xa%t[*PtBwv|6ͯ? ]yhN׵lav{ Qh @E0Ӷ A*KBV(ΦAA+jfy)aӏw^/ ]c݆ݴ^`0TyJsMmMuZ\p^+oc[m L IjKЃ)5k/.]PVIc(C*eej E6 +Pd eE$BDx$I bW4ѲrD`6mx%MBPTOte:K0!.TTsithvlBWxU[ƭ@E2͑- ["W4X'~uS)L&06| t BUuSA!QJx%}"> m~u@8C(E0-RCAlxDAbYy(eXHȘOۮ%dzH5]뺭3ރfDAZ3o:b|.'muOM"h[t/7lS% EGE3K^¹NO,`6urVy3! lD*i{y;=at xy {dB@' "|^1( EVό51 1bؙG:dk{tbz;xXJ!ni'.,~5|Rƙs߹V ;ބ! gσpJ4/fFONd*-"Bƴ0߃6:> !t}-RB!$+P)ENaȩ:`)Q0Ҫ<0UL =a;Q;7wݏg_=˷c`ޅi)T&v{˭f @w,;~\4z%Vx9wɬC'ggt  DHg f5!* " N"^M#qɌdF\OAڃ^lhM=Xߎp>T$Gף W'K9$3r:.,j2霊c =u6Kl+ZXr-Z%?)!ך{k!8y~j22^;:^=d|}P(DUTZ|ɲXHLci|Chm'.ԃ0>OmnAWRddaS)\BF<-WgtiPé$z}Xө+`eRQ2yG&kkr7X@Sm298p T*,T Z)Pg`Y<4HZ 6 bTY'qb|Oz҇a' I)ccٷ3x&EԧfHJqt|I\< &k|ժ-i(;;,!L$* ќk$s@ӦPT6Wɨ_r!*moGAV(gM=0ĮmkcK?;&7~M8 Hr겆.2ɲF*8ǧx=H{B1ē)"/ =ԨNշ;WC$gr ^80amOnܵ ;1X @+"ʩ9Ydd͈XLӌa9KdVsq<3nTookn,^8zf"Nx=Fk_FğhtZ12sZu@ ظ>OYGg_;<(}XFVI 'ێ^pNL-Fzt_ꨔa ?:K6`u)3~>5>nPF:.t8Eb5a@<b ^:HtA hQO4QO!n(⻸ߊc#C_v*OS3Wq1+wIXDoWm&e,0z\kvṕD0Y+c#'pGl# Jؚ7_y&0dgW /47bdx(=2<5h^h` 8vvw< 9tj=/zh,mXf?ã< jc0Ӧ4"JG^8p?zEOgI0]] ?LͰ1HC%m EXbw?98h >WtQ12<`#02<\m-ǏܢT5"@:O?#`uĸh @f‹7:(*Ï?`:+򣻣"|Q @,'y/c5 #C/ Jh;lW11|q`P naS>p &~M|^]큒cSKxc\,3~GwBHd?d!iBœ +m ڎN nW.U3Gbv>a\qQ}aof3bltDb]ံYw?9t/ u:D%8'voɪT%Ri??:~;/02<$ -pL.?|/˶DNz}*F:OzGV #OɗO{ |։]'p >k(10t2lgFF>m3v='pba)Mm ".h6 fV`ZNt!#WpG_w;<2Fw. ͟^0KVƐNgyAz32g¨%d, 9jqYI -ٟCXExc}'b $4pPƎ*T.Xbڂ^TΗ6Z l޸eGt-~\$2drg_FR:k+wfbߺoFA %l]FӦ14Wʹ%O͘ih BD]ߵ(B"Gt}c(鬗1_$ 6J3BU(~ad91 Q$h IUw`[LÓ%IT;áL@PB@B z kZ5,@ o+B Khh++/wtc'\m@!)Ȋj+6rCn+V4hCi5}]yK=ۍpX,k#l9,Fp5)C.|ҁB~p0z{ ZWh> '!UR#GsY ?}G~DϏ^O#0HfA(U)1:o6JL$賖QT_<3#*擇$\ gfR]5gEqmUa&x="$AӘ{;FP:_j {6^, J*2_G  ?+sjT Y9RD!`vq|4y$PWϔA - cH!k:HRƓZ p;9^+^ZdY6o5ߦ$$ 8zfgJ]{'Xn2T7je@]=( AB 1lWz ߺ=aNM'чg)YbmMZHP {F!cHFb7 ~CYl10 l TH1|4#Xwf[n܎`(5Kc!U[f :@NVqb|`G8xJĤXfc,HѰYQz y/H(!2 dL+[X)_hKKlWJ%^bj1[Hj&㟉Y*@ Hg\+|T $8!xAbP !id,h.Dc_Y^{z,v1)ܬ5rss&VvY$ζ:8oVTHR%7~-,hv۶7YRCyV+MѝYynhIb(\p IgdEd@M{[haR';@7;6hzBݤtwGwƑ?fp(Ψ*0 ~7m:D~7mo aY 'P7q\4dI׷E4=@2qHc/NT@z]JX_Sxܴƶ bC/> .Fa 86DVoevFcUi7;CB2(1 ~W^yJ <fGf !ڽH16.XD^hQK`y$~ho+ _FSIv{56 R^XDIlat&6;`?0@AB$iF$UVZ Gం|edT Φ!XysA*ljaL33;qCA=t#B Il@+P ;|aoæ5 y-DaZb&xͶ -J{dH0 l##Dq(!,)²#EPA0f#C ZV^ƍ6cE0КO3hM-t {^FTSNe;B xX~h?ibӢ (H(hJ yBȂ($4CZS5A$~wն5xL[ZN0Qˁm0hzO T/+LK|-ӉP4fAE!/@\PhЂ =x.6힑Lqb2Bro^㟋E@uoQ!$!8=l"t"J0WEũ@oF${' % 7m % &Eb-HU!IRXF l|@G5 @IQMntZ(A$.pp~Nx=֔1J 'oҤ?ɭжx=h`+<0󜥼E=tY#IӊɨJ !8H4FFDcx@5q~pw;5B*!έj< !o>YGwKlBb))\f8u1hπ5O|W3\eM!~70LhÂ+9EO;,O f/}l?(h D`|e'xX`vIj~݂"WU#샶g bPW+0ǶsM?J.J dZPت {MdDž7FH4vZ,x3L6<|Z32jZ-#)3b{ށD3 )J$q /)=!Π+e5A%  |`9^8B]ov^2T @/oU,ei1 7u!˚(8M!p,%Ŀʃ汗s!`x%M_o ~_6ƻ۪џa;r1gw !Ar \? :T\O\ֲGDc ^^wn{ebbNҲq@% GmK<1;Dm]{ ,I$6 nX ƮS8͏r=bqIo>K&7D;v ܈pMΌ5uFx XmdxFwDc9y^|900 0~UŹyfVДc9ѯ U5 df0ccti hTΐNkkd "X7g4!<8Wm_TX*LװGԡy OS?`B+Xգp~s]rbU[8?u8p4"ƌ v. оj`ѧ gh]lH*/HyJ}hk-j^UH+Ө> 7FnD ͏f6ݬ-ۍnD 4C.!yWjaUE|22<4膴pF@p!(`@ !! ݛX^+# "=GNt6=Gѯ[Зs] 0Bt 2D7~bގ~(2Y.FC$J k^Nn^7}Շ fZ JLl@~aG~!j>dyC){{0NR#~'rZ "X:~@ W;ARb嗔[CH_9 ClKX—dFǙ9IPOtB}y= 3! O7̾.'1'SuemtAԱeLeo1] ϏNWej?s2 ?33wڤ: bHGšZonƠROQ_-TTXVbJe0~TP(aCg{SI䉃FTZ(  ~{o{tȻ@]\S`r E:aGЃ6/?GHuç,B{33&33zzRyuc͠XB?Zi>u vxdxG~F5!z5)F?Ox-<#+/NIj'?bwc|s~ _%I*c)5#ӶDuQ $zG30"E7' pc%D?y dk\gx>RF(eDz2e32mCy*\I ! .S͠p`5Zit=} i}H 6WP Ω+ P(cI!WJWw:+Rk$FşxJ|®GnP2̗,,c VX%xLf``H93Tq97kWG_|U|Tʂ%|ßT+Rzbua͠3v,+p Oz{GU ( P*,Cd毠B%`.G5Pk>g h92xn>62<)L3 Tʂ*eAYaf !,gAcZԣ8qCF+7Zm>t6>h>K~ 1BesTTZv*ЕjPJҫ]mG4 l]0ZMǏC'#CߥJZ_:KUQYa!: gƧg zOSJhZncd?xeozv!2(c *%c [ 'ouUsv p͙霊{:} 2RSU*f,‡ 8N7rq0fPJ@87Z#~A XU۪x.ᡯ4.h2/!D>hDVw3N[9e˦b f9pk:1<{1~A)*R !Jߩ27>ۅ-0|H$2(FBe3eUم+R̛x=@xIضgJe|dxhoa@h#">0 f6|陹YՁL+.%Sr`ϳKᑑwH46PYŠU * @bU6{ߖH&km @a f`@F, hz=ضq){DcCBP)e>T)y-"P]MQUZ]om,G30gy\}2T!:qMY; v65G/FoG10-,n#^EW\M+!|_RхXFpg;f'PJ%=A3Jͥinf#܍/x-t!BHP|UeQO{Pʡe.2=}:˕L(] H{SYL.f̒A;Xߎ}xǕ<O$I/|PʶR|*c>A$= ^F!=i1sWNLͽ׶䇸.w4pKf!qn6 ͔>nچ*C> `O$۵j@LN2+՗m[{V2dl$ h JcK#9uFڌL Ei`E~0.hoH4"X]^_HT'BW)B8s&LQjOJb[ime\KiPм90Cgȋ|>֝ x!ÑhBeleKe' VU***zfz6K>˪D>B4C mcf`Հchvx2uYj,_ҏj>vl$sw_HLL[JO;{dQ@A`oQUd֣v̫= F/IdS22Pņ}vmXV R7x!}3 /_QG$( GQٶPe21OmWo$2wɑx=@ɗ/ ݂UUM!U-@# Azl :A$ JNW$2̣LxMpE 9~歌1] A0D{geK!H@Yט ,[/S] s0. 8o7\ 4O.(eԖ2(^RmX!'E^=s[6 "(g0?ȹ2\ dLX5]Ves*z}ysyE;aNNa L%O"؃Сp%2 k^I"ZZW|ba~N& @€ae.8\jN @י"@|1YOc>Ә PAO߹q;vm_dwƾ.olO57J~Q ] eBp͖?yg&'JxpG`e ɊЪJ@,~Zʩ ˞"AW[/Y* CmeOD0Fl 0ZiD7O^dmuH``HU6z۽]-st񢻟: Q twD#Sn0P>k VV@=E9Y:CIU/ǯ>]>[fMs9]x?s-~K-@9vή_'鳇oI'K,@ c.fS('FV@ S5fZa>C*'$*l`3( PUw_ݛD)c*t^;l~&ux=\_ 2hPb4L1zmSY^Q@!d"~f#imN3SH$l7w6|}i㵟؁+S`#m~ ~x%l0 .uD'OO!/Aڹiן׾M<?//M:Y}{wwᛯ7?!|tgv=tf u%6Pf`%P8 VJ﷊  ኀHd$ ty+H/܍8;S/Dݞ@ǻo;{C>Qp7Qk _օw\ b@ZJ.y&A X;A SV. K%RuPnTusNۮ-dL-fp\MË)}a…ق;0.Љ}mKԙ]|爚K?_\?t^^Ee{"H흸 @YgDw8)!?sL @l @waly)tTNދ:qJ}"9ՖWjʯCX Ql( ,$eux%Yk.^ۉ6L-q4ff֜[%__?6i9=?S*rSn9@.~v^<(uK;7KFL+0@{r&f4k@Ettwotd%*pOٗTc4(Y-ZfXDN n9nM ~%oLOVI{yf}6 3 NVDnܴhn rWtr݌~y>-zM.{vg"1JGi/.JLqY!-HO/y5T^F4X&!?$`CoS,5{Ŧ`+n^S!U TdFI@qPW ;7`)3%LN/`aa 5KDzI _6UC__ji%xji|Oߓe /]N?.Oy3ငްօ十Sr\ISR. nt=WBo/!B88 b&ƾeJSf0Hg< ɟ^ 9-pwV0$c:,˩RƤTVA* ߢ3=oƆ,r\\KK\!滥gT6cH`J`ԵxIA0G@/~/Lk^eTܨ 2ۻQl30G{NG'ڸhWI0ERӗgr*̦ 6#S94^]A/|^Ďbe @=@W\?f擘]|jD FC"S0Ac*vp͖N0z6 Ҙ^`~)x"*g,U\]P[]h i+!~;ni~n4n ]&pU#)%~W@!c!)c6^ε) i@OgUix%B~Q{[DI":B^hG:bn1$H2˚ReThL# !c0 R^xQ DIDgg;:xJAO)E";2no|2 e~w=!P,e0 E=J++F>' J:ΩHe,,&Bb)UPLCW變: )=EM(;j q0}crќ π$`$|^s=.hCGS4="1)ghŔI/CMY>cXJ+XJ+I|"L0V # zd;U(RH$RH$RN᭛>]aw!IR%~۶;;X'1z;3!q~"R1V˭XL<?~S^ĵl A9BˏDx2\#ޕpLt  ӈYLH~A ivB!DK ,SB>~>HM ,įI 8מ; !+/'hW]2-N*s-v$ qS0>Ng󣘚[7\N?^>!M%g#rNMwyݬby+ 4_2LZdՏE჈σ6*0T EQNgB6C& YBy yLeY|L+e! -J&sg /ubuefג8~?x#klX:?S_đS2=%-Bgȣ7U"v0EZ6LMᕝs*Y"|^X ft.u1b$#$v(ePU2AQ)2YBVTPJAUR)UA) D(BI DI$iyIԶܲ-"_a'~;g湎?*vGGIbpfua\/r$ ykDE{/+S횜^Oõ.eG4;zH6K0a1\e]O`Ri fDG >ajK EQ̋"OSO׎ i+a:Nj¤Ao`Z>eLsY\6gg]8_L\贳b|`E3VR"6pşR}'se39]%XȎ# ˳宐!WVx*T:0!*HDx$bSo5)Yn'D (#08Ҡ;g(=e7~^MͥrȏF1jVb&+;:#`-wb| aQQ)RY]!&҈dKʣѿ|}be*Aɩ8ӅI$Q(Lpa  t7T>5=33$W#wS*b;疦GfaPӍAUӀ$>Ïۏ8ZM?Ӌ_ͫdrxCx|II"iڳVK"6!YZi{F7滭ϘfLLfpKY-尐!Qʪ*LKky g?Ue"+SȊnXt ~F*p_xe7PrRl5 7.|-faoOf<X/)x{_!B,c 16w]Kv=A"  hKx r֩RpvKI^u?*_ '' Dc1 2hVfum:P_R8;lRΖNeG~@ͥeK8MG(tyXO|sۨd{}xs#?x/Ui<~<894r2}}~l!]~d++_KR3AV)r EV;SUdd'Uߩ>%~dV3dȟG.9ߏ?(?;.Za`Y n%Ngp,JsF*g{d^w?K~ ׻1ѣc}85(DI>Iƾ :\IJ LzѿxZ_wdSvz{ uCOnib3_`fN#Js:n)}cM闣v}H!OGNš5Ԟ1@N>> Eџ,rQLs㫩ß?G]t,OmrjGvmd COǞq͟E&|DP_;o?cr~U-iQ Sy$1Rji5 V\37v! Z0̇?gʼn?7j'`i@2dTEQ<ȍ@OĆt᳓lр)?ie˺`R03(U?c(*j(F| @NxnY9p@9־hOK;?"EFg_Wg_/XqhCe{T-=dN"{7tSϫ4 fr{>>wQ]\TUcx}x8YCP @߽(P+2XNS~3056iUǧ?S6ld@)T=ձH+8 \?zd?r27pG;fhj.;?O%t8YV0zzj?*4LZ?€O B2Щ-K&dE<+=瘾)?F|圌c~F3laI;GuY `3xÈYG`17>3ݓܧ&bO=[o}ĮYG)lhv3'ƈ=L7e$2 2 dVI d]T"U*8gP>!sc:&Y+Ӟ4h9 i<}c܈41uw?Ne|3z~51yU!t8ǞidŽFO=5~ v旜-+j_sYz{?!:36է s'~%;rⱯbjó]kj5`M< <>'b?}W"rgw{7?Mx{/"-`8r|mÖ _ >ڼi'2ϯS~+-W9gpm _(933܀y_KN{mʸSkYbJ?^rn {xf|xi~H/%Wvբ5:_ٽO~߱} ă2<6śJ0a(!U*yk!;O/K3[܂c~9|s9_ЄJΝҫג,x ``MšrX53 Ӌ Npy^u?p;`m ֭Ɩ}h- ꁙgLKjҍM*' 87-F'LnӰџȦ3sdbgk9%u7DLU{>p%j庝U^[߹y u9 !hƵ(k&fZ+a|Lng-ƿi?KzNw;3X %C+󈟪s3ssr?/qpμ2˹uQW ѯTPв]`NM_]8RwCTX|jOOMW\K.{Gm=7aK\G@_'6AG}7ZBE4wc/Pd-q1\tz;Î D>o'⧔">|ȗsq_KtJ3αs\nss3YjK9WA;.،UܳL7 ֽ!m vcpC0eY,cP5u)2J4o, ͫJxFc`vR,-ı8:>x܁??}\b6vsbH'F0[l ops*庝U^(5nkw~Hףޞ }aLAAG6X)foc>2B/.O|̼I؞w&YAaPѾp}?/dY,-đ\Jځ*#|c MaNA%+?ڵ$jM9n!kw}ׁ^TAцvtwz <#Oho@ bA c@䙄&0Fo3pmg7xK qH=%`TOϟ>CͥTTN 竹V-2U1__e+ nKoi䝢7U =6tCEg# 3#H2eHL O;0 ɢ 0ȊT"T"t*jF3u;R3'RXa֢Ί_˕PPo zbz)T=x}g\ƴr+U^ڳw;o"haB!?:;цpHJGa-%5 LR?esH%RH&6gƿwoGU&ײn P+`=w]u:{N?JU]Პ|ڶyBݻH*^mB!?B!??$Q $@[rğ?w`&ՁVݚ12 " ɔTe"gf!r7uj&y>,!?uo'8]tT*c\$4>/_{zwt"Y6C6b%>>>~~vH}75҃Ƨ?eŝ~ gs92 Y\P%ġN0kS2c*PB.Yvi*}kkw\kMD6!x$xQ!IA$ %(7D{(EPBUs27~`TƧG <7e`sTGvuu-u R9}?,>Վ2kx <.T !0!9=o>yBw^Աk;*r9K(*ɹ'&=yﾤI$z ܍$l(lϊtڷro}֩ڼrϋ oɱ'=^v}jn#T93[~rԞ'Ͻx8ؚ攷\/WvE0ƘaZ<6zWf(S;_næL#nmksk_|7-[=KDi5> N6s艽sLpj]p pʫ|%G~7ܔC=9w^_s零_(BǿF|nUTɞUM#ܔiXQܾP Tn_{cHP B֩ c; {Bo=E}R#_5SP)cp3ʻ-Wki \7a# ?c P]r圮_.:՜Wp3ݪ+- T[lA3\2S#R2|%r+NՎnR!zczMwjXjd08Z%Fe-O+-)-widKU1D+w螺̗Zp18=|y|ѽk61*t|0Dʼn'!@HRDZEdESD:XYrKO>v@D6,EDU"H- 8 NA:R?~|xm`#P:"@5MWVPm-b wd,PB TtE@ipѠ "IENDB`armory-0.92.3/img/moneyCoinbase.png0000644000000000000000000000563212414772654015713 0ustar rootrootPNG  IHDRK♑sRGBbKGD pHYs  tIME1We IDAThՙ{y缗 + .FT-V4M[f2qLM'dҴf65AM1؎f/x)F Bwv{;o]k 939y}1*-sl?4:Zrr361SEiuB"Ɗ)tqS=4ϋ1Etx%o1oêR KR;ZEҒv1ƈ*#B(9s΅ѥ>KxU![׵ȕՍ"EAvM,%]5FF#®Ǵ Ftq=ṯJ%]6P 8 jB| t%W =qm예BKX:4ЗVB:DReDQ :a/ -i0 Te:H+B4S9:oy@X&G"ݬ BBw>1I@Ngn-Aip$L@!NlՁ6vd;QB0c /Dx[RsO6} 9.Zt|)򼝓G1ҧD '| 3FGMX[W DUAQKK"kcr\ԙrԊkɒ129CIg| T\Y$ۆ]y^8ZjvY c, \ j0Q_:fLn yv i8ƈ%_7fZ])/=?<=Ò^Zs-XR`^hm8YrJCcRLsR`YGT] z+-Ӭ=GҔRWt8+#nxTd?!WdeS\ERQtb ]1{`9 4E6ndcv#6Gvk }А:=;.x2x!S)l~RӐ[M6XTI+ Oy&2VqO"99k~}DF2@ 8cHG`4 =-Rd)%,hm[  @/@14G:Xn5~cnZ%;;_8غk`W._ZOCQ4$]St(bM@QV2gϲ4kYΒ6JO{ =m-t55g 簰y.5VQXP&C˃ೆܰ hSqZkhpq㫡:^o,}b󻫷y?(_%irGKH};F7,0`βϒEDnh'|l<  "rr4Di 8^iQ*xs׎} %2|iY[k ` 5k[V!"Έ>p'TP)q1Jٜ"r|LF10kӁA ֶ&q:sږeͽr!mu;nqϓom t]ݧzb83V9̼J817]P[)P,׸sΨJLq ~PyW=& z:eKڌ%_31wJ}{؂괁??ܓ…7\r,Iizwݠ%> :mǑq+tKnjkZ\y_zӑ̌Wgf طws[(0zt3L-.?S顽$kGq*Hum YPkVWѽg_0aQܽn2o /լn{_n9-&Ws2)a[e=!F(#,u(D h{yZqU]{ 00\ˤض͝ΆpqL?UtscEg4RJ6߸푬YpWAX OX&<}]oӌ+}M<51kÖI5UVXP82ɦ,)'qG^sV6aS}췬w_(ټ07G3Yd#_̱P \ Ub$o| GY#^?\`dn3Ϭ3`ǧY {;ySlTvtJVݘRkk!_}mw|At^j柟>oT:ffo"}Ҡ1~9%B?jMm.oƘV1CT3wAscG9ť͉KY3YM:]L Ag 9QIENDB`armory-0.92.3/img/loadicon_3.png0000644000000000000000000000263512414772654015132 0ustar rootrootPNG  IHDRr ߔsBIT|d pHYsitEXtSoftwarewww.inkscape.org<IDATHhU?9̛NK#lX(Fi&有%ɤ`HTtiEDhfΰ95PAFjL"I۽{~ݻ?<9=<_QUS!)+U%Vo@1roРA?UWWR͘1#<,61&.۶m- u"@&6NH$?W\*PT깼@y * ÉXZIw)nW߿H$<`35t+ǎ;=E=Ltըxބ] (,,,:}"2nݺuxސ@U[&zm͚ӿ} S?55`Hs:0WJ"1]qUuh(957FA rsv}#so `okŢpw/4O^l+g=:Pt;8֓Q$qKzuuzyw~#y!Z5LT\yh,o!gm ;oZ?uyGT; 'OvKYytz A*|lnӞH/򪮈x1?H'߄m/nœQ32< vF̙Ͽ8P}M͍E  < > H{_;ZGH <2W9_{q:[.|0a{sI=J<c&,D=-u8/Wuu-kOCHY` Q Qiz[> 6;pm֘+j S6>{N W9,Νo0-?DRLD$tB3Iޜ?cכiC%v%fQUD;F0oя.o\f -w hx_֕5=WiY`0vN%`THN o>߰y>5@qiihѷrE(}xrÂ~@QUuR`+.3Ws i:SddFeMёW]paF٫9FK/UV6&2榙Dڵ3mZc:0B|D"1RC{6mWK ."0cc4Er*t#NIENDB`armory-0.92.3/img/MsgBox_critical24.png0000644000000000000000000000067212414772654016336 0ustar rootrootPNG  IHDRw=bKGD pHYs,OtIME/gfGIDATHǵ1N@?Z!l2IfQ$St`it:=9j+PJ$:NB3ۑNu Qt:p}\FL} 67{.A!XLrG|MW\~]Y`濭2ZPIENDB`armory-0.92.3/img/armory_icon_fullres.png0000644000000000000000000010150512414772654017171 0ustar rootrootPNG  IHDR}ԾsRGBbKGD pHYs.#.#x?vtIME *8 IDATx}w|\Ź3ۤUd$ ^!bS,SrS+ , ɗpmR2ն %7\ե8jwϞsj93[XhQ^;C??ѯ/#u\ 5,,CB]@ I JO'@|N@ Dy  awKNA &|k=@ < (M z`R0@,`KfW?poL@L jth_D΀ AWT8*it?JmϴgZiP "_(QI8|߲<}u[>m%n%0A? 4 S9{2@zrM~W8&l_ "_5&oɉ ջ@*i[=\ k0WFSŖ޹8[q.@ 3E떕qI΅`2Vʷا8Ҿp/"b 4WLZ6@25j03ԁÝV|X֥$OM L #_I &`τ..9pI  "_ sUxdUFr@rje`!l+57V  `{\& "܅.y|KQ LX41@ Hʔ:θȐ"RE)<OGi$ BZ($19QʤLڸVi8`VSD"` $XфVa2!M :I.K.beN)<3I(?7=IDL &$bG;!<8eo""&*J')k26;0C%)nI\;`ш$:GHۛ.B{p"8O-s$7#"&:LNRdC)8b7uYCnn "&dۛ. rD,G?Lq <nX7!"&"N&Q\TZV@j.8Y5p=1@ ˑf:I0O̻WgDT'҈&@D:z(lr P 1{vxoP+8[^FDL &4 Y$eM eGğ}1Ķ:W(P ~XWI8\í Z*8Nb)4GM>$"&L6=M~7 (Q]Xzc吜Zb# ƫ&5LL>NR Dy8A8%.Ha\ y>@628j]p A&hwSW$82MXoUzK\R0UY0:* X~zHb.‘/I8ܩCn uC͸fxGV6'mp҃K$XWO"ޗ!H \2Svjr:ҽ֕5X4I Aʆ"E,ˡt'!H)؜}azl!0>I6<ˉ3S;M{|Kr +!9zmd`s@DĂM_"^eTR6D $tJIhK+C'K:!yC yru@sUqC2K6ʇ ɝ7=Ij8 xVX!^p+G U`3$EL ;ԡEI _$5"7VH` G-%3hƓ/AGpӓhm򊘄{8[ J%H&i8j-n4IC< s:Ss|2B2H*!ej*u"+$&3w\Xo bI8R ppl cLWt'_@$Y k mv  S2ΡV RZR]ݸ"b"`7 h:CܰfщX\,ZRğzO|$Z!%k=T#ĂIkzc" yS'( -)F#8j].\v.bqBʨUQq['@02Kp\z/]-": xmNVMl5?~>{G/{ :TZ'ޡţ!kWK1QP%*`+T 1r'>&J"#E, 3U> QL‘FB T `%A X$F uTYǻON:aZp`v_{lHD,1i H\`628j}qտş IZMC:}j1&U΅!kQ{ X,iߒYȺRFA(\J"ɿş|D,+ F X AxU&3  Cď5"VV fN#P )*sG-|KK" YS!9^Q` ;a=ZD@I["V)(Kgy.0rXdce\V&SƩvV!,q-j7B`&Z0à;j- |HX[ XPX<.궲9i!V~_}$D$ C3O'^ݩu<3#&&_ ?&"&%qZTmw0WDz"`Xks48R (S#\l`"&\TtBSf)5BBz8oD,.C:I8J0Ր)V1HLH QB}q'$zQ몇BBhey0uhRIQPqC\#,֪8x 4T ls;aE˂eй0P0)1F /J"ŕJMC}1pr,^MuIQʇsEbNX8OsA1=MpKDc/G BlALRKjX2耕N)`o Q~ uFDch&/J2BԖZXf,Yj"N,4KUpVV1 `'ΰqN:Y Ʌ3qX 8jUU?kOY RZ(|sۉ}OD R<"!Hr89"`&Z,]/$Uf3^Ä/r|{;`/ AjH-u5a?/ N@Gۄ]G6#fJ3j18j]$b#*H^yQ?* E-BtYZ6g}Ӿx"ߏI4, <ЙkaD4HD5` xwGz&DxQm>TeL1TIg㺃hz^PN. G@ j yL2͞8_#DW^Wy;Q188 oӭǴ!H tf %vv6*C+ŁUFZ^%yL+gfGӄ摈E']Zc.(,P?V #'tѿt;:HDfh3/"VJ± 9Ot ~6 ބX؇B+{@Rh3ZQsܻsK"*DZ5Lld"gC^I qw :yD4JpM9#bx9r9V1pl-_mE`Sb5Xf\#wA}ѨBqkQ뜻p] Iz-/8 ԖRyDBױ ?GE40t>{Gsڮ@l,CWp'i%4a2j}f;>S>k ׉ Aj*<- \!] ذ67ZuǴ"k!7֢mXTM^ ɋ)Bi))Zf ' Eƕh!H] ~"beC7NI`BXM %:8i{&ϟ A r;w{ LJ`s 84CD bJm9a$oDF4 l;!4(I6R[EnBoD6ĠoZ|'z>|1 ]Rb61fZD #f*D?H(;T@tRhgRtއ}  i%d5@ ,tGft=4h8H(;BʦT3a=+`;o7:<}4R62G~׊#/+ѹcZ5 `kn·“4܃>bP\T%*-D,Ur8GӋI`h*|pp0iW< ث7ͅ(-vXgy>S3Yz8_t Bm:x4`fZ@%B&Œo-noii_# Y:qL?f M,P  Aʆ>]7CvQ3jYwyުَ G% ӵ}1ݱN$d`5L0·a.=I f覑]b&?q%>N" 6RSk 1̈XN'Hhm4ZA N_w_~2':oڍq1=eLzfÔ)&"Ubf) Kad7 PoTB7\z" :,Eh˒_ J^O\ KVnU[3lWMw- -# pW?™ >4/"`< V,6L*-,GO~abDl2EW?`0"h Djv&̶"R̸ثdfy3K'S^~P +}8Jz^QL2Xfp7tޏ\5cN9ւbX i*eJ!"1 (DS.$dM?P'o>~a- K1gԀ D#Œg;M1xc6}>%|^S  )_`C3K[8腻Ӆ -g f-FOq!نD,E(}6&-%eSa$AxSLk׮޶ k\ jg8߀tVZ#"8Q^ RX;|iz!F|Ƣ8ė68{?{a/FZ3`w\f"2m3BW6LiCu"nNFV1(d`ȡ8~\/9NNH'Ưr44Éނb;p4\' xz LR [ IDAT(>2Z1>MOA*( IwB>ئJpr2)XQG-MpBS91q\|\7Wrc5 XRN[ .;p&w~V"c tbEA1)5ͅui"w) 퇧 BqG-(5.301M@c{,L]v30Ŗ?π_`:fNǢaxzyEC# ߑ0Y`%l0@ c(gY:jM~U%̽ s=@ ~~ tD놽t2LTqeG#,>m[ͥZf _g$8aaC7 s;`E4-2[2'`0(΄ _# Z؉8o(A_~D#aLZ. $b sT"bgBu|EI6驧z#GgDhVS#2]+F_Û^~nz74"foN0By!nCG0 >TbbɮP ?>Y)~3}M4pwD 0iI4!>c8 Ǥ3J~"2TuW=8'^8X)̒2$Ŀ݇d2fʨEȂ)I<4׺2Xc:+E lT!Hgs{#2{O ]Y߈-O oE2zm:oD#aFyLG>ϣw-(P K2pNXp Bk,n7_ؠ"mY,x?Y_B7{̈9ƍnz nrRTnٺ$ޙv$S1gIlgGq8!=ԎWƼ'33sLJ‘z&?wdCv7t`dXlE܅?i؟յbп`QJN[V zC|X,̞={&`#.1Aopr|<}op+c;b`)(3O\+9jD$@{ 3OAadV'&*ĬXhQmI "L:f&=K_"+A+ x$ #u{+C[Q;|2ND@>c-wR xоt@$DZF766566^r "X1L&L:3fHJCbkpir 򿍯{_TiMzR_`+v-@7~=G"%G-i7 #buva0sLG~2E+Ljh At+ËQۨX6+ Xh;R tj%D E-IBC4i***2g3BDL^#CaG#**9 :sX,7oMMH+8q]cc !w0L>}, H"A_ `\H*@VNX ~ z𜷱q]\B̞=n #U(EϺD0'c'Ѻ݇[ h P"awcc}È'c֬YZ)?ZuE5 ~SbpipzĴA y>o wgbME+w("L&fΜɓ=v uQ&Mp{7=7v3?<1'ګ (vUyGJ!:YyK+pAAI$車39|npqqup3lZ<η G62"⥠b0eʔb{9Kuv:`˹&`~D; zS4 2 'n",v98 hTGĐ*ՂbG͆ٳgN2'x,BrȒ5_T#mP#bbT.ܝѾ ~OM_+'MN8AެC퍄!uzP퍆C=] 4Tu{Fĕ0h q$s1$tΨE#sEQ`i+]>܂VD"AB2gT as:d.`Qr Z7f:g ==l=GQK=4h1È:!NTъTpcM!H~Q΀Sa:\I۠ x"1b$d.` aip=j a&cQ tF#GhzuC\.a9K'%9_"`=j0N~.Gw4B_{+zCnpFįCtQ@9pVz'tN x{t?;"Ѵ{-R{% K޲2qӳP`Mg"fCv`6chh`̙yM'+\@3&Ŝ;0 K]uw4yimj̉w)NsFc !K$Jb=C-x>.[Dh$X $s&V:!HN X@ a'A4BAkE(%Ǒ<hI_4_4+pG x5d2a̙K'w/"`l <^7샷 9je]gXCf#NRެ6aQÒR:6{\x9^-)K"I $snvo.9GJE" a*H1x;}t?U\2MBqVg"d. %b{k/SE4A-IbzBAuXz㍍E q"豽YM0+9XB& s&}pw@o;0upݣyd6dH{auk~ و o}.zQKKI 3g:dNЁ\4_Hؽp ~(H"C<^I i͗|9̂EXك8ߘ<]]FBR"^x uN2'먿 6 * Z$`G@L&hF0w1~#:D RZUB1KqDB ߍh4b[QK][$3`!H&A"sn{: <i?"o3X4`9OMG9u w=W\"&QأOna*|@UG;n' n#NSocrlH yF,ݍ.CA9ae:PjI哀A*RO٭" <] D3V8 Roޒs4h  0ہwPTG-=E$|_*KW*8gN& s&,m!@o% a v֍Es,te"(9 u"&bS@NliޣsKD&vE݋H8#qO[,L;q$0>y\q[*xckms&SL,<=ZtrR)6(62勀AMw`2ӌ }s6z26Pc?ѣG qo%#|Ch,XJʀ%08G·#a.&^>z^t>nGE$$oE0lL,!NY-:b{L1.Y|F̘R3O??@+}L9!z-m0<@_R:Z"</bQχqCLX'SIΑLYymOO5 ^Pr\5ngEMdQʧppUNr{DYy_VжYCk LJ_poowo߁d@Ts"@8C$ʓ0BbΉ8Rss-&Dd*cfMmCvi,"nVz @e,NPltVÚJQD!riBH<\ T"f|{q8^v᜙uFE p2l,xU\ғb,:%bU ^/=3N$`Mb1pc}M|FPBO%P ׮ދkW냈9TqAggg^s9 H:a~U;o7+V J!$s7mMIkW!p8#G``` "b0 dTŖ-O$jX{) ddrW5I8)*&ge!r!-O Aʚ':H'oS%n*M'|&`hۃ=&.Ǔst~ar]9ճՌ%!"m ׂ4Wnf5 {_{lsy-5^\Cl& 6rR@`GV^qͣ{pͣbq<9GT<ќ*^i}[~}kۖ_ߺ*.;w)T&tD VL 8, ,жeӖuPť L4 p-Ҋ,&π A2QͯnYwɠDBBb52|!X|ђyؚ$jSRw`=׊iܲn}TqIQH&gƉM\њYO¬d A"|p{˺j=8PN23"KWk<)E*YNB KTN7>:B@^ G9`lZ8T5 Ljʇ5Aĭhoo,f XX',* Q"^{cۖ7q@ɳ;DҎβ-kbe". >ԌqmM^LТWA* \gh߲[^oԊKٳ|qI ;w/ %b{\S ֌?S[[[7=zThY6?0kGY+! Y AJzWM[^ q>\gܳ4O݃ހQK'tgF)OU*p$ݠE^AL>Tg˯=OQ[L΃-Qy8OGlM9+: z#8jUU效+M`gToг >N׹:=V\L΃- ⪷z? 2 bwԪzKܭ i\+"G0 K׶mյ+.Qgؽ<[*W|I7EKfbi ᨵ݊[s"7ߥEReWñWn]1y6j-5RNaWʘ1t74'D,u5I:aYtd4/~mR:w.#ͺ%[= \< *" p\Aw_#Bť8Lp9SqNuOw+INR@ }$ې/^87hl"W;Wi_ ߒ"Vp`- IDATQdE>UԦ+,y< W۶D"& Lb*&g69X4r/=eZ?01O]) LJCP`6 A/\i WYq^"ꘜ9_O)k R(PˀV0fG؅exD':n뉄q+.I&+U29VǏ##%o0\vLX W@$|{ WKɹoJ^(@ְ,B aG߅KSSl9aMϐz"<?mKW,8-}mrVdV I.$G-` .l?VpXblx*.zEJfx$ap(*%ލY J!+ mP_R+Y7U@Q1};jl)\:qBC`Iz@K' ?w{sW$*.mHg>P+ySI 8@LZ&kGp Z`ɵX TpD|y._+.T6>eL(cGSnM/Uq5LEQ0SASu XJ/D™e>wKTn}ˣL<_wA\䜇$JAʨtHG ;XD| ̹^UV)7J:/կ]ضx~J&s@3Q^The_ |~jpV./{i`(Qm# yC\D! 4 HzݍY &A!,]Olc Mx,˔6] dfL Qν~/Yւ^EX!HrQsrR lQݑ5ƨj\Uo@ \)JH-;2k`e J/O|-Mb>\"`&xEnFq,"aM(5ߠ#A3IG-)`umZSbQ-7vH <48>VMU"8i^CyJ.Ua%B Lî.~m.=QԦ*` tG0&BFw tF}2RF-v?U*H Z$`aM&:]NjtȺTp8L?R4grB};`es#~R$ #+7+y1"ܥU!HrD"V~Uzg)B  ʈsتBlIXTA MWC X`^kӢ>QXCR^7B#LfJS:j t7Asz00IyޛzZxlq|vn0of d*brpT!HcG xE3\h4If1 إh,]Nj8MV^ LcF 8C8C1+Dmz xk6RR `ew9Co5_]L ;_ >'C})ba ph [)K3r\ARni:6Hx|,xmX%_)mYb)Ejl`&<NXC6$w;ܫ~O іUYTL(;IpD2># Fܛ ~-ǑNQJB<(;(vBn3AOqC@ <3‘0 9ca?JXcANX'B5P԰!Hd~EW(phQ2e d# "5VH$p:(I\0k? eհN?:DW;U*8*wX?LI8ć>jJTP||ɸܡ$ʂ%b !>*[`WPh'6!)Zm5|U?/EIq!`([-[ eRD) cMvHUa( Z$`qC*) xF~2LZ{(r,"=܈jXX`dwx`]]CkGFp>:Ps/ٰK X=)`E*,mX0!՚:|_l\*6݃Б5{oאַ̛Hk1CpNP). &X\2 ivD1DzvKMtII:>Ge#Q٘i'1U+ٌY`w=sZ1 nG<Gx[߇/"Vp#X,h a"\Yz^opxQ2U,|$l`<.lgdQ+|x[%9w}S).09Fc C:nҧYړYh% (`?QXONQ ?_["7i \ocscrDA8p@2lۉ/ޅ% ( )K`0IQ ?-{ܖHEɇ`hq { #?;o,D5>=)&fvG}絤O>#~cDi\{דRF-w!鈖 0 6)ΐx}ϣ >{F7_+T ܙÆOpÇ81{$m)7z=\+d:-3fL&& 'kAψd4,΃+`* nzFIM3Bڜ)"c8%t밥OZP_T>y@B<^XQ+rB^wrxO/ "#"iWzK$&YG`v\QЁ?w>O%ӔOˍ:8|15Ñ` !"\ [;`T+`;瑌B{~EKG-M*`;ʱC{#J1Ĺ Z'lI$3H*`"XNsijӈz >xѾR[jihH sptÖйǹL!Hڍѿ'vuHD\8{?b-n{ ?Q+&t|*iH {:C}a`z0F3Gذ%q=Ax?Q~y=|B(:la<*E;+}ގhv\ W]*LNP8F:y{=+fʬ2}_C  ?k}| fΘ3db0$ߑk{c-e'Q0 Ccz|1~g 3vXN,'_j4؂ !83 %R zU&-7+=?ڣRP&W޶i{sM9AlStRئAt\Ӝ2xǻi>?"F;8yyٯ="`2? o(pT`3+'zH=7E]XWMSIIEt餍8&8fډF5*H)-`"w.%i{KVN6'CǨ$ C¸aH~5 [ Z!)[idF|+=?ƒ4sFfΨ: CwIZ1%m4* i1n=ZMwisXyN\bf6F 'WěE_aE%fOǴ"ష ý5D| ֊(2X$ࡏ[ xW={_cY?Ld~1tQ\(I[gC$+%{mJ]'W>ޔ2v\CKr Ӗ$S sM2Q_7%t(]\-A%$V vS6 ?@Cow%{_E@ X*QwIcZK[zKL3g10:ipTJCTv1$EyvJ1PS\➦4Tah^ >7첧!Θq{\K+$ ğѽ "2Xaz? S6E!3)X]9qȨr灿;3"E~C,' ȾoLXWȇЙ?:T3(/!2jZ gz# 8@NWOfrܤ;!~:JAM >;ż.iuȨvp@&r=XeZUU(&[ 4p߉|v<!:GZ*?tu6_#=(VՁV-lY!UR\>14f2ܯ(藭~6@: x|#$Ny!ǍdR|v%q*Xfx- IDAT&."V[4-/F%NR(>#N3|[5~D [[ ^f@dOC#!%eܯۉA:a~4wYy)V+3}DgAsݝ%th("?pLtY@p ߟ443=3@[.u;w1kkE8FԿhO!D;6%y}iExWk x#i犚T!h'MB/9SAAG9_@>-J/ \ uc`crs߾)DyPT|!s@UŒ FmHXm#ֈ$$Ck_ 5s9EHf UҀ|\|AjxjǏ~LF8+x2.GdCKH#"cb ^T̬4{1+hX_ m1cBդ$ =ZNnʜ$` O7&0$ZAo^7סXk?YBF- b?^"ǐ: xu#ߪ\* }!9.`XJ+5KTBa8{=Xh\dҪD_!uI YԿ,q[5]G@P13V'U =N5D@̏rL+:QK#z5Z0 fD#EF-B:f\՚%5KԀ`Y@lhC|T~Rx,'U'#k!M1Sy\T@ZP7#tH66 A~/pfs4>2?|Sݎ$ ,qrٚ'vyJ3fc54}5u)p.n'nmA ZP(G *; A[mLLQKZfEH!̯!f@E`J@*MKj; g b򉰯v(pș@kkkk7;^oc4)_HdbWr&'b˓ PrL7;~?Nf5kZlIC$^/Ue 9 ^fy tjD<8ݭ|tTNLH]AaEZvun88C!n0\∧uf1MXD~9BOf_0,c+ > ߋA##IՓ#|%Z0ZjΕ7QtB@gʗUDF- h(uie:u@3+{AF:}ǻG\>R7߫|/Ԁ{p:s\&sLQ+jPooCRtŃeX@p]+3;JLtj-災 I]jK2lg_ ٢6,߷!e/(Ěz@PL '߆U`qDGF獬t\Ӈ³ڎ`"Vn ߰9Aܣk a /3ΌY|wups.@k RQ܃$fVASC壦|!l |^qi̭L]z+@NIիxzyǴprրfC2jG$s~ʥ{? >^Ӣ+Hpy"t5)ԉzG}飃}N9\GF- (Z"9VhnWQ VjjP?l[pszV5Ò' etYxo3Ůh9cn9G@8ԥ4x"'>Ta Hb5/|`cLjzwĪp $w@B >JEk}q3Њs+85"0Rrwd|JFrXTElk-\8/v? 'paݾOk3cVp-]рYao| N6`6]]ZjP_@n$w..Ua }n!R7޿* Iȥge2 P#F@,cPc8]C]Cjw.kUa{EH>p_r$4glpJ}]arJj@|䧺]c-Y)U$Ud&3!SLQը,-~pf@W\i$4xEC K|"x;ՁIGdj*u'Ȩ!9SYu)`esZ-{={pCe0|}sm ִaɻ`V42u)YǴ XZ0nV7dCܑ!WrӋ{-a";iEW}*ji G:K]j ހE bD\|nmUqv$g҇0sҞ35AƝg5U҂:+ޜ}'`YWPÜh$%ىa [@v!9.uds2URYƩ?ByjJ3:ZSZ. nxNErRC!?~|goRvWH*lɜ-}"( ޚ >dZX҇-nA͟x҈,o Wuɨps>>/i$hov뙭4KGlt$Kﳮ^v#pX?Ǜ8yy [ _Kn=Z,8oU-ESXT`YM ŠG8 Lo7- dy=JF-VjoU-AiJF$RiPW 9gQy5h* xؿ%w#vTx9i +K/@т kȨIAu2b.7j0_Ko^8Ƴ(|:rhɨ oU3wODX***Bmm6U _v, Jn,u@^ȱy;Q ԟ8^*jYjl?8o%>%qN6A`R^Cee%˯(\$ m ^8-bXv`ҤI0qH @}mm!gQݏ|mDS+FRknx[)涐F̡̍?(%[JQKZ<~OD{c/:FxRgq$38flx6MH nqiQ sapadǴ)7`bE*E3(`U+N!|f&߀j[g],l6TTTd-M4Ow7 X3gKBlPp96LNiݱgdԒAMO"t >n#RJ3QAeee8qbVsB' .JHJqn)‘ѩeb0inU6\S΂J6uEǹ qbx]8r(*ĴP\TIfT9[݈Pl@oOS>o[0N5 j~NFm– FZW# |G GNN}L'E:+`{̦ fAK&֛Vb ,# G@]8.`wpmO>@|%&' A0aB^ʏzO'|M()HiUAGaB{C\ "g9#L]j=cdBuu5 `$||Fc V o4cU/ɨ@Ru,$HWĹOqCxa s{s}LELy2逮WվZӰ;l(Dp?@8?Y]u, 8z9I%zq;!|E#sj^-f(:W o؊Ƽi*O0< BV^:ȖCܞ T:GqKN.ٚ3^wkUvh3_%:n.Lx}.;7=W9@ܞ b**XuAF*ΑZQ&d9X=cjZYxqِy | |ƠB æw7S2jfCuuuVj9g-@|Ғٓ X8370oi{E"˼Ipê68{hk !2e1SsQN2T;<[ Z=s#zF*j oOXʳ?CIK\mO߃TR>A<[\\7ӚEs'wLkfnĄQ[_M%q8%}9c C0JV:Opɀ=[ PUUrي-ARO0^` qsͬfc[ 9ЌD1Kpd^h8$_"&Y5By@7X~L%7;y1?$qm;S3ϙv/}+Q%ϤGHKݚL6TW]Qw9J)9& h%BpO{jũͮ"3e jl&ܞSm-q SLa*7#yJK"k7VR R ~ӹ7irXz{{; /@4ХLݴ|MyT6AB9ɬ|o^v Sqp2*Hyګ]Q@فsQlfa\#P#P bj&IfC{7 )jHAbqZ)HX.Vuڋ:=vfH nZd`3P9Is{3{Qq7gdqz+e' >EkgaK9dO#y!烬SI]t())agң{QV~KV&km*F-"\ɩFjZ~NWƋFMA8 orj V=$ek'RqUSҸoA9$$*V,5a%ծ?œ^{)\t pXS{Oh`[p|o%+ķ9XyZl;|>DQ(8rvқeMd ǐI-Ӵаb@n]V$I  HHS:Ccl`Ұ̜z!մu).ߞɊKi  ’D NQlkY_8LQAb%hںN l[祺R |2ZA  A) D_dy\lfl],VJ["O5G$u>f.{* 0褔%봆WBXot?-ߥ[R#:ތ+ZC"!H'lg xA]QK!IDAT 5rťv {d[:P@PD ("aRt=< r&$J!'N"͛"I0:gc)1<* VhE4 7yĿЀ2'O}}}Yz xY(ooSCXB(X Yr&G߸ a|IWxёQa 8Bp43$+)-4-(m_QOOOV{)-#3Ew);5j /aAtuu!>hJjo`(awx𯑏&cm"x o+@L1G77ո(ێnqb=?oiY+28_ܘ>>XGkxnĹb%8آ)fwX0яM>#mOo'0\9=._|7E}dIcD=+ܐbgRD?i{~iHK֞7=5^/+Pt>G`9&doND$! .?ǡ&arK(xHC.|VKP^.>Z2_\y K000B Lԏm"-iĔa y(~ܨ)4J.&!=-k R`* %-CiYNdQJ&$aBdqFddiFyg'maMPYX} gc,ҒajSY1"&GDh#ULĤaZ20>LBCaJ1{68C[HGV`'!i!!AB&3^# !K61Jϵ0R 33w3rPVM41LCGL>q\ 2fu#`S&o3}gxA8 *˲՘:TYgTQB p]={]TBZRۈR[גSJM4X-;c֘3LYھ472&,Ф2-{`ӿ+\U^9b=+>Fڲ>q#Q,7o _J@~&p Wpf=tP@F=i L=8gam,OUQFM2#7R%q|3#=Hm# w6mLe"Ry~ Vi6~0$:ׄ03t=;G\y!3[~'4PFHQxmzAXVS+G  LˬbV2i8#1ڈs4#dqV7()\=a+zO8x×00.mCэ!yF ip۔W$Umx콰K o ;axcH&DxF)*[J"k hG= xEwepLBEDdQQoB\>{ύ<-; }Hs#KVgKeLDZu3^uEa : {nCy ăCPN%>GwgxcD>v߮-K}>gGW|[lzW  p]Lۼ`lC&}U릪 _|J^D0W>CR<֥}.\qQw{ke]%-}W%xշL u(3n($m3rI}x[G޾&Ֆ0 ,_ױĶŻt5u:[.1Je:ݙr)c$Dwjpfc!)彥yETk!~m1 ӪK=sF7FG7yLPt0!,OLLܚp~kΌRgq|A˙iK입wѿg܈ށ/4NY-s)o33cy GF֑<< biH1w_>NOuh6 uνWܞ$a1:btaQyfb-eL:hGyPetiy^Vl$%]co"k,f;&Ϲ *D9іIqHajyNQD@]:@kWBuZW l,]\k8o^e9*6_i|TVIj R\[\!وJ,ٴy8TZ!YWYW2UR=fl1HU>A-z}J]u*9=VM sC9o'dK*kFDTjrsR m⌎6s ωsxI]m&lF]36K"Mt)]١뽫T|A+6<^MR=phyZzڴvŅJmFI+[(w"tm_:IbůiP' n$%FS5I{TW~UaR#y@:&VOUиd8+ i(qRAM4IM -o6T8yRܣvY:j<@^D%)fkκ\cl/#u[;]UHq+vq<W+o;ɢ1*cٹߓ8u??c]gЋ`03<餔dB(Sʪ2 EPSqqqO\9/4'DS}T)53ՋmjpcY{ aqӨQ \ ,P!;(Ku$JƵ6qYBU!@Ҭ{Es`ږu06@ɩ^|!{¡ [n1~R0]8bK@[Z/\O [%{ tնPn1ֶE/voԥ0FERs6b̀bmZGwE|Z?-6w1 x$yEqIENDB`armory-0.92.3/img/conf3t.png0000644000000000000000000001302112414772654014303 0ustar rootrootPNG  IHDR$&9sRGBbKGD pHYs  tIME /CIDATX yT**Thh&" -' BSK50І|/+/*''%z0 84  95/,   3/!%"  95   ,)# !r k-!IENDB`armory-0.92.3/img/moneyIn.png0000644000000000000000000000333312414772654014532 0ustar rootrootPNG  IHDRK♑sBIT|d pHYs  tEXtSoftwarewww.inkscape.org<XIDATh]lWgfvvf&$.I@R6U BoE|DJAHEjU)H $x U 6mIĎfwv{xY{7DKW3s?{GT=xwہ'TTVdוݶVZƱz-6'vUG:EDUdezxF|ry(Ud.ZRIE2::a|mqqt#|FJ:] qSոg/Ouq&?wgrwFԂmo#GyV6e$ Ib0&Rۥqs~vke4 mkS_v]+`TfM@N}3YFDQDEA@X,R CA&9Qĭd) E\yD A>6??4_ge0S:J\^/yʙk[b1L0DuIӻ,ck,Bh i;<\{bEUqb#v8[}nG~9D(-R8n+^Oflپ}(( YȪwwjxiw.vdFW}ˡ.fuc{vu^Ay8~;|cBRs|LmǶ `i>gU74MLӛe>{4\f)~ow8 0z~HuK4Q$Ai.<4edOl˦8IZ-1b5j!j!T$f+pͶUJeuZ&W >Y$D: N]FbW\VpMWssvnPz>/ԯ~ƯHB~N["ԁqCȺd=߷(U7_/>p@  /&, ]{IENDB`armory-0.92.3/img/frag6f.png0000644000000000000000000004275312414772654014300 0ustar rootrootPNG  IHDR\rfbKGD pHYs  tIME4.if IDATx}WTYN2 (ZjiUuU[^A-Ey~8{s#7ssY+(ý'ر#P,BPG6m{cy((|1zhCM>>z{*Hǁ1l =ï>:h2^ zQ>n2v{N]}t#d #> =/`FIoa9 'z ^nm>F0owd}nn }Eb`ᔠpd<` !C>i"'&vA1A1'1xЭ=1A` ^a2EK~^®D0uuO'u?Rky "1 |2j} "4imN4qdKocB_1@d|& 0PW~+`.OQwu™  |0_g0iWq$Wy`AHp/zb:oG}(À~:@>5  +@&Oh'i_xD70MuYiVl2|!]_{AX=@+spb5,|x:#H:M?1o' 1_z bx}n'f|.%j5|{}2\zE0[4,?CF?GNk;5+!M@FP8@ 0|G<%cHy0|Vj>_! lw|뚀@^M¥y F\S(=,Hii7<P o]|4z U>~i~0ㄏX 6@0J>bX`$Y֊{O 4_)?O|[v#xɰIx؎ gxǯ [BOq UD(<:w>|?zwV ~qI|7) ;DZ}Ӱ޿c;7kogq $m`"zJpyp ܾZ 2|U6V &=j\ _D8[cQ/Ti꓿J7R].k5b@e8I+礅_!8R ;Y5Up6'+%SӾ=n– 6ވ'~!RW+WpiL58KK8A(扆WA`iWN#\n/Ⱦ4P_,4F|Gcܳ]]j&H{4O _OR/OT2ᤓ?uK 0:Tp q 'p׀qD57_Ic@߃c_d_\ iZDXk \w+Vkp=A㗼;0= ajUl@ h4'bUN+20B 8U89Ñ~o2鏫Aʆ'K0D@8mr_"/w*ELz 0PcWLE݂c1h .翉拫@ "|Ľm'B^Ef "iO?!<31hqZg4~ l4L#% G:RoG㏫A5ՐF KG~'lhqѲ*U7 Ǎ,Jd⫸H[y2$ 폫==e~=AwQ|@ Wcwp{4#;ExTޫ<4mYl* T[}>3_7$|jgP'<5fi~MM=*>p,G㏫CB^ z:uac,33G?y\qR}Hn,JhV @bW3fž:P_ܮW@R7N.Iéz:1P8%mcĪ5K-=@?T?N ~ǍI.|B}@Z)S#'G*!⊡@B[A:z@p\k(UӻK݁c+l#?" o/WkLx]ɻj0~ hD$⊫0 xݴ+ HHI)檿c:cW\mUĞ椯Z{>""US߯>J{D+#?ܮ HjP@X W\ z_c̃T݅ o1H }BND&<pBpUȄl5Mo|A0a|+`C1b{ͼhpڀb[>_?ܙ~z͟  qUR+E\tofj6 A\1H<18D`H޵5 h`0Dcxe E~  '>BINq>I* ynM0f'tN^m 0y!3HGxLX0B x` bp>ÂX3W'z}6t0&9 SjCq$G xW3.mU($: mG ~6,6ㅈxO~`@ $/`aɟ󊝃*%$ J*M |qHo!>p?oҀ/DYq\|1[p,5XV-Gvz *y5O#L_ZI/`nFC yTxaĴa\Mf*ۡ!p5Ht]b߇׿F< ^4 Nn: -\3>9>Y#?Wjν+0O1*؂R+cHs!v{~ '(g_1PH`eHӆ3du/^l{7ڟp% irL^ ?Fae=PKf9zύQ ?e⸮:ߦm÷o36+s%7x#ѧno^B=) !6]z_=d0hܞZ^8RφXA,;q.9:k}RoiKe^A ǛL.AHE2n/~l\Bp7ϟ/OoT6̒Ox1mW=cofffJPHw ns/x!|?LIG/1(~!C>vGíV?af1ӆ8ZzŸ~x(.v@/? >%xMb_濄X1eǾ~5Jeőh8ߖJkEb^H쌶B[[Q",0nbUMݥpf<|XY$/ ?0ʎkQ,;n~tߢLw~^{DeQwi=bLH*5,rbPXY!Je ^ 4$J-^L Cf*q仳wv>仍>0@Tqڸİ:F6tú׶[ʎPc;(8#?tqYe+HT) X%l0$ J!u{P(&^ig!E~ 6 ?@ˎmb++>gcZȦ2wL q%w5<)6f<Of2҆*;!+eǖmiF2wKthlZulZ&èmߡpodY7sFqV7"~cTvˊgQ*+@Xw_q今K6 P*6 aa$=hl?eV?KMPnw8=J廭( !X)(%%y0?ZYE&[vTV<6~CZCe1[ t[- m EН }۸!3BktCZ_\ IDAT <9b4k "+w~M~4k<׽]ˮB_{)[z+!wr !^+B-fd/؏@ 8pf _ܷФѶ%G ӌ }@8H m$I @ֳ Aj3xN3?iF 4(zU_skyZ%pVBn^4O9j"K 8g0vic-Y7Q:Uء7%32\b/+=#TӼ~ *(rf iR̉;gceŝ\vl1n"| 5-!Ў\$y~tX;S#iu=M4C*#(ij[.6f`e`zvXa^JhPz>(EW+0nq~+wZz6¤e/,jqV ?` ҆Tv,@C=@’uCSL\Mh8_](ӵ?8FO-3Xr겲cA˗/UQJR6'v誀@Y.>]/jjپuh|_{Fm4M҆K?1ӆ]4m( xjcUioo `p?P 2Ư-(S%߭Ufݮcgomm[ƴ2UP4>@+ߠG:Ư!w^Hh rfN5$!ifPk7xϏ*UZ^2x)*;Vlw?-o p,y*rClPYl2㷵皲cq=_lPZ{^O)˛v, YUy]欲{?e&l6ê;uM0DԅT 3AWd9o#Η|/ӽmz*+w;X[4">? @9a3 T|D/EN 9 :Ru!Uq7g|Lח6LwM26;,Xm͖]vwRƅ_VmʎEa6z75)$Dar\Htھ.=@2]MٱtY{bd6|++$W~@ZɊm[2:j5j|Z,=KHӁ<8\. GU Nz5Vڑq~@ˊ7[~\7ZAN3v|]Ӻ* ˶E _Z$*hR-7vq_kQ{!ƒ|7Lw/5҆6,Jڲjež~ -?;_<^C.)uW,0`a@Fc6Lwi_zme`qc++Κv|% 6"--_;.Ʈ9FCDa1h,ؓFi6Lwt;Yizy{*;L?b 2!a1ϴ=G-4W Tx%'xLj4G2ijGU2]+*@v?`ےeTZ_V|a1ÂF DjO U^5XxĖZM -+Pi\=À2];e6@eGݜEiݖ*mc~`?g|҆VVl= H/і;8LM? L^OP(2]S˩z);Ye#m~g-jIe=~`^g!B.^K\S<˄xa>j̇b|( tE܊q~fɊǚ2'v);}u3ZͲ$֪/2Y}J) '[wMӵz"J!tە#x=\,; LV,Ɋst7=U˰D{B~R"+=ZqoTWbeM٩gdqqʎ~&,B핟ʎmX YO3VPVgYʤ#ܲd€Q8pώK /ӝfko~e{OtA~ӌ$+.7bٱ6<w|%}>P (ф u_y 9o;i.USL]C;? d%+ +/|{AXT٭+$ڥNK4XWСL0(61ok~@Cp/ftfy+;.l i.=~'$DMYD* 87=7}|WB֔);׵OىZ++?]k5sHے7]iK㸼I=>A9Vp:>2p iw .tQ`XfMّ.:N3ueml*<߷ \Ҭ72IRwkT r=s仓4];e.w%pdYZ~P?xHV&?Kq^&鈨 %•: M e>^);pqN,ӍвGOٱBr݊_F:)宠/@ȝA=VD`L>DڌcU/s>1Cr ?Ub^~@6$"\Ow-T(N4NȺx1 X)%8qop~em3e'k^Rpq:Yw&fߺOHS{ O*]:?;"TKE"W{+Η|4q~t?'{\,;E}C|"RlB55 x G&Ϛn4+;fT&U0A1^t ~&ሆ5#% ~=4?E4]l-Vq@~ KVT::,OwqrRb!]PpOJ* qj#WcO<_j? ɇy.4G@e.-+߿++\A{RMk*SƬjn`҂pii5LKt1 G20V>m~)?^&/9gTZpẤ x' ~‰  QZp'<^t: Xc&Hl4Do-q0!A8T'?U@R)=?mM?C4%[A V1~MzH <_"iSƐ6E4U+>yG5-üӡ}߿hS rՂ!ЍʵbK'=> ,{⊫YOqZ4?s/OL -+UC07twFSTNX(")W{!˩\j_p9UT)2~0J 590^ BpA &4^)?3#:7و`P DkI'4C}Wbz0&3~O~yR~ @S~WX>`N| Y|@/ݩ4~X#uo5Ox'l ~5jX]R BEV u1? .>2ڟ2r^I  !RP%'7F {;j*m Rs(Cp`\^R|$P3 xA &1oV0{M\dV@?cQh`@ rq5L/p%1  7_)x|*q@ ϜA]HFo a\4~_;JءƯR9\ h3 $|A /=VK})2_6 ᡮ&?4f~d=@7cUMl'W .]}W={y@:!e*@yJDGXi](g<J(i& Ŷ}B@`7iq]E*XJW5/ONo!Ư‹p}ƞײG븸f/ʣLKQ ~ߋtHKV1MWN~ߩU1~_L"FQZ2|iq(31<T! ;mg~/WU@ɦxƺ@?=U#cc.G~\:78_ H#p޷' Af ApWb]e8]oTu 7 C(T@2*'b&H y-Pt{xO}ji.tբ(?ߦ`\D1AǜbK9}477];ng!-idy~U,8;Wgi##M/ O*W4S pw3)cI7x7{h16ӓQA^oOqbox? _O 䓶HjM lq\ Cs_az Jo` >)h}߆K}kpޱ5 גyD#]yr= !øoo㶣nz[~JyXiAէIH3k`^c]3ZЛ{ ')R6s CvD hwtkQr6>2hyI+TS;M^ qtեiзDh8_Opdc9-i1K܏-S| ~'t7ɓ) ܃kT򊏷| ?ͪLrkHw+h)/1i {J2o|+"Foc^N=ǑΚQeo؜s<kvm&$"RxC,o #$=<7O5>N I/1$ޥ?cdL:V7|)6 oR|%P(Q*":-(?"{dj?xl08aڐ@4|WI}N'=QVo]Y/>S-kB2j5/n#tU RQq;LpOzyE=ZK~iQ805:kO%x-dx`IDAT" T~ r0re:-2#n7g.Cg]K?0B ~̸ؾ^/w3o'6Ђa܀] U.ti a# o5>6y#M_ 3l2U9 !B}ݩ_8lFŨ,wUXnCƽOh-/񞿢0* XDN!O&}0Щ8Q]}-{Hˢbs et0Gz4'-=oc7|w^')6AuUsz=tto0.|I i%ֹV 7aP.҂]nmz`ЏT Rj+$GW9Bچ}Ȁf|=S2CUohiHUnvdrE~D{d̸u"0+\~þ9N[ҁL2tbߝ5cN^3 g7ȳۡ^&g8..DaZ kVTg_ ՙ+4C =Wő yi盐 &0uLG5F^{J1_ϥ.3>/4OVDGnP=`b<3vbx?xGJ_ DÏPG2@0^A85b5~6ʓ799d#T "QZ:}(1mA՘G6{'O{aɽ5WjR( W@ w봗K5Vo Gh4HWCZr(rUːwE0(13/cG-@/6Gr X`+w1„N|nt?!\zǜg1,`ЍҲV {|X`"l;Z^,o "9gXI/3} l J'OV&ku6^.lV yøT,PjU,#@F* o,C8j4r~R*0iƾ6RIs[GЙ`UG#(\zA7"{2+㯊όRyviq i_àSB4X^  Tx3l@A>~'Jj\:3JT$Jx_J%`;0?y 0`ݫ(n"x\s-Ղ%',ͳ?EGaUIENDB`armory-0.92.3/img/armory_icon_64x64.png0000644000000000000000000001061512414772654016311 0ustar rootrootPNG  IHDR@@iqsRGBbKGD pHYs.#.#x?vtIME  iHN౎bxB%Z;[+_~#ogB`m\Z~ioQ+/?PmT0w,:"łHcN`0@1Ksl f/wf}o:Ac={7U b XK=g0=cۙy/Yq*S @y!ѡ{C.8̸qa@舿_7-?p9 9Im,'87Ixmʯ5 fܸp!pL ? ae6^/42 yt`jϛ ֘I.5:RV@"l)H@H} z wd"ye"5gobם W=3wā3n\]Dl`b]9؞1HD7W38n?/\ \yu"w&xS+Dzl/g.}d_Z{5橭1H`OԴ!ƊeתRxs2m \W{{}WuPQx- 5eBO_]Fen n;SD`ku u#Խx3M"\I4Knɓ QKn6 G5~8 a?E§j^xd| k0?0` ji=47n_Y`barNBr좱h{3st-UdFI9m"n$&c5G7<2LX@+9 4)-1.=hQci1dX>\@pmP6?྿Sԍq&0 [ѯl\2qۺp>iuNc%Έ`]v%|ϚKr b%& @朗؆oB5 ԍ{g( /cVX]XmUƸA/g[J X++8u- r9٧TO0v=O=n647BLkKwB'A CU[R*Y#G`e+@~}A߯\=\DQ |=Bt,Lq]J͡Qcb b\8o&εV> RRRmۉLE -D"ZztBϮ^իW6xE'ORYY ` SyN 1yvY#D'I\A1H{$ݿ8|5uG/Jt @͢YnS096}';:j˲wnիWV.D";xwZMaIǻ`:Ayi8ƟiwV[8 EuT.-O|&+JKK](qJ?hM|d/G\żSg< @yoH|/mpAW.wtϔkL;v4+*oz%Dy?~5m}fN\ nt~V5`]v;h񥋧Ώ.a-/?S3Ƅ2hO.VNb^0ͫ_zz3?-M nWn^q4ss[$oox/|-~Pa'R ?]@ӌvki g:kni } }D X{ĠLOv]3' نΧO=3#,ri i@%7)ͺ뭡'fЬA/ reqtd.;##N4lZ2#6ZFdM<b隁fgͼ/Q.KPi??;Dk^u^=s紟>1GNme9rg7p,F@mo;Ԟ )^FZEx\zbptOzUSE(S05Dp$ ݌?ykŽ7rymKx|6ʔu MKW*N}QO Fж(1B(1ecbpf?!x2` biJILA-A|x/؁6|9 <v>3| ҵƢDryr(,܁诪] jmVNaoL鰷VatDwO@aat傤E`єs{AnO`iػxfŲ7Γ\=1$P }$feCr>7'Fl_c\O 4V qe"^p (?v k#MfJB0  T7jeL?]~>.9i|>#ڢM՞aWB| |yh}î޿wsW9#* $IiUU%? C &BՍ(v&Ҋ1ybD/@JnOs;9mQZ+=/ *hǽV[> 'LLO} b k]AvNBs׹'(AͶ1 hzgJN 7 eU჎L3vZn{Q˟^+uq_q:*x3vVCz&8ltC8%loz$oٲuX5mEKכi y mAU=^wޫ 5:`0](=8N?`E "ㄺ7.Yox"Ϯ7xDo%!`o a~ F2YaX&NkVrH"X2YN H v[ESMmIn[7VB9R!uS787ecq { <dJ3;3=}{=}~GTUA|"F  8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8&uرcS>l:ODlPxy}zzZ:Sa *c>| E5==34cǎ|48v_h8+ͨ3i7?@ԙ I;:3AZرc<$!3:۶m֭[d*dYq9CNnzzZ:~&u`>buR.o} Rɸk n;SEZ}Ap2~’bÇC}nK1<<u322+koy 1`QH[laE H *rST#<Օv:fnn.,»gȏa 8 8 8 8 8 8 8 8 8~ƞ4.BT*\a@ i]Sp#V"w#n YwqL+ S\YYB4]II\4O+t @? &U6iG^u㊃ !I{+TI8& abbѱI&iEB (!4!Ond c|>t!$* x(n!qL @8 ƕ# @!& '2U`͓;! E?O:! 2.F€ǚ4c^`I0$$+ @º% %$Ȉ̤xÍXUfY{ê0IJ( I2.t 7` & 4 Mp#Ax,TH'7 @ K4^񓚎y}z77[4x6$%rj ND:H!0/k2$կtH!nRQ.}S*~~zOi @ qQQ*Li6$u||S::AM( Sٝ ,˶w$WXqNvjTy)DUUO,ˎw0X(nLN+4I2ҰYH!^f͚N'-Ay)Jd2󔇤Wj<( bq``tUU}I1%J V;.F|?Ҡ&'k|Ľ$1@ pkn6mdzSTU,..z^n0\G"ɄRyXMoF| R;vCpq=ka<35oϞ=H^zqGy̍FÔW.CEl6!d2S 5:M. IaO>Ç5~,˲/M+lH{y H?2FGG{3 >㡇j )HCatttQ<v~ICyB!iRl6kڴiN|5h5slٲN֌,&ML}BOaU'-eҼsann?$;333?&$Խ QCk{܉sMr:qɋ4X fFCCC=ZSk_rXm o{8 $i#}aǎTz .Vp]]YY1 l޼wuqn Ie :mB{'2jYo"=ʲz)xx2 ި@[1S"7qi^h35A>L_Y"5r$IzJm6|ͦL$ V( *711ﾛCG'si"o"PV-ipAl\ ˒$}2 ~$I7x~㳟,}zcWN<%eÆ عs' уf1::ʴ˗/dK>רaoڵ-NA@%ZoZ B^n=o~1ϮF{b ?r e ")Z^[6US:C}vx>Wu /MtdF"ZVf&Bx:5uu aMX)NM#N& Oh2n3zLԓ},//3 hUpW0`,pӾ#Q:6\|ˁ0Q f)`J;D*1ُEzAX[l6L&L20Fu}<~?-:;Y<zFrKE t h7'E ?{U ԪU*747IQd3l*KRMhmZfVR rJj ' @zuSM%UU Zj EQmU]~j˗/aqqKK%u "(VVP( #Nz';[&e:=, ue+ .],.^W_#+jՎf.g܏hzv,`ݺu8w,Q(d(ji%,,\… 󘟟ŋqݵD.Z֨7LpS\$? 8;p&&cr+dN'`++J˸|2pl6QVQ.K.T*/9yao4ݦӻ i~ [1<03xwZJR-xѿwSDAh4!#a>PU6-P :(br?9KXt#v{Y"iGiZ\5оb?ϟ?x!Axwvۤm48L =]6L@Qdr33gF-pٳg/l6P;O:٠<@`o0YV ywΜٳ$Drh6Iw= I;>>꽘AVQٸqSڃMAgg`aa!@~l6|O=tk*wj=O;]f$'>qLqi׏[n/pUWbll,BN8wΜ9o .0۹~zWqIdɼm۶b=x5 <ēAe add?p߅,@`M X@ Ka"">Cg[ܐN@dY{ｘ &k###] $q`\f/CڅwA;{u$y&_ ضm+^xg{]-H@Eu}U쮯'SpPnpa~<7@zj3WX;xLG讓+fy_gS7xVHhfll2_&'KXaM2Ù8ܴ/=4r}. %YÀ)Xܝ "3IAߨJDcRn@ %˂(S%HY Uj0~D_ BD0 Ax#~~ a@J`LX' $ H^  6Q/%bD{&@Di$4 @: $a 2~F   Ir=0$q`b$5O;I)`UeX!@QT_*A=?A Vcc"Qa:$o6KEu9^Z o)`f@4ֹ@`P,mdnDt"@;*AAS'ġ:th5P0?\<A5e TDf3ruhlP;:H:ڧGEyU=ϝ;{f!BYkxn^nQBtۜWDzpF^Ap(0_h(`Uַ3t;w[嗍p9ZNp%Ds*Np`}-U-]47`3z`#]&! aPUsdY~ `4~_@0|" 4Wr\JNx7]!ؑ"P݅I v_.^wb 0v`;`ƛX^^6WU;UtҲC tæbƍرcGﮂX72Dk~C*ߚp̧Yj蟕^d7??]?跻oY(+ntG0::@@}Q9w;l9 +8ƛc};ߍa2+=K Ν|BIXP(yf !AkqyGu+;ӻ"DT \t z0EQ|N>mz>ofkVUUz{fggt2z&= $8<ϖJ$A\\\ 7g5Ϯ t M̓[o]vd2SQ-H VSN>zw{dd$Ok~ਪRwǏ:m{öc?X#1سg5SSS,"2 2 A(r6#j#]a}VFo޾T=A[_e8nպͼy(kVo|Ӣڏwm}1}a[ 3buqD:g-Wۍ *;kF ?ЭX`z,WtDZ@p.AD :V,cDL۾DUUU'F>``\HYqBs556Tش8~5v`wttD@ċ+ہmD`"+D\` `/VMA\ W؊p Zm}$D0zớU385~`~7 k8_SMN?# `>w[u`7 ~)` `KA o8cb;}֑8L@gC` C@ <=nEIǠ'Mrvo7MӀaж6xj騑{3~qǮ })k"o? Q E ΛGk*DڣNi;Fj$@oM+:eP@o,/6~#n;C3z=@ϙ]@? >Ƈ؊@F't9#w 8&(a=GG. O4 q"~ȱnN\@ bEl@HAZQ 8 8 8 8 8?.b۞tEXtAuthorJakub Steiner/%tEXtdate:create2010-02-20T23:26:23-07:00dnX%tEXtdate:modify2010-01-11T08:56:58-07:00é62tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?tEXtSoftwarewww.inkscape.org<tEXtSourceTango Icon LibraryT:tEXtSource_URLhttp://tango.freedesktop.org/Tango_Icon_Libraryȭ tEXtTitlePrinter&IENDB`armory-0.92.3/img/wallet_16x12.png0000644000000000000000000000105012414772654015237 0ustar rootrootPNG  IHDR OysRGB pHYs  tIME 7HIqIDAT(ϥkSQ?gy4tu) B/;8 bG.1C^cQڤP~W[hx֠RJ)m""~2ɆGk+/chZDQ+x*$I kY^X58Yn NL [syrsRX]s)9ZςXkIӔn;Qsz= Zrz>sJE=,~_8>fs!IXPz(M1 b hD"ZU7`o%=RR,˰bhi4h9<찾~o_O¬0 IMNuQXRYg?#"e9/3zS9V_*UDd aE._$IENDB`armory-0.92.3/img/loadicon_0.png0000644000000000000000000000246512414772654015130 0ustar rootrootPNG  IHDRr ߔsBIT|d pHYsitEXtSoftwarewww.inkscape.org<IDATHmhu?{CxIeny_J\ 1Pb.ĔHQKf1_(Y1;E,5h0f%w. m}_/sz:9s>w_qQD@3!$69Y"R ǁPHp7Q`! (s-@%|ŗ<|37n7.?9GA,oEpQJ1 7GOD#]\yM@s#feG ` u:pAxA9==L{1n+w:"PD J83"?HII*`{vXv" FCX;ux;2_}gN|b)nkK=˗/{ss7;>y{$ ȍ =ogfovtvG:2Hׅz5h ]L+p8\Od^sc1EoΕ犚d PXF0S v#7$٧ ,ZLF}R]}GTv{55$yTM 9:իThI2?:h>ѐhT/b@dwF̩owmdMiޢ~2WUUY`NV WM55^Snf~[u/؄һf7oMZjTܹn҂.}v͚ &y-^Zpٿr;{M۶uɉ^GcŮuo`ϕ21L=qG ladH!|Cb|Xn1IzQb xIENDB`armory-0.92.3/img/sent_to_self.png0000644000000000000000000000255712414772654015607 0ustar rootrootPNG  IHDRw=sRGBbKGD pHYs  tIME  "8IDATHǵoW?͌c3uMSAҠRe"<+Ujⱀ-K?  тDQYREH- 'CҖďyx<73=,3T$$槟=s9{*~QfN5`:sӉAx9sSFr0h;q,{'>;ݖsX} @g3by|=$g;J<`.YdqV/E3+OkD|aT&ǚl!*@ tVZ7 &Wuw9ZZ!M@s8NLsz"uIUCOWg1dB RnQ_MXڮaብI=*JDMދOdFU겸QGE!/ &?\ ;Byrt PM FF']:^ƭ8I>ڜ|} sNm3>Y )w7ʤ8S:[C2_G*>5s?ˑ}=#CcI:Por_`ckh`#&B֋MHfn5$ זW{8:7g S_p~e{=;Q(ne9ulCsᝓX~$:IIcPRIYiCN\\_xar(j?d66Mib (KX3}陗oLP8}u®He}Nd*F-WlCBH 9q xYvGeGn :i4;+mC{zlYuu罽??{CzzkZvv罽""*11!?9{zhZxx缼!!)//$?4{ze[xx缼""(..&@.{zb\xx绻""(--)@({z `]yy溺!!',,,A"{z ]]yy湹!!%++/A{z Z^yy幹   %**2Bzz W^yy常BB FF !!#((5Czz U_yy游柟uu 銊}} !!"&&9C  S`zz巷柟>>LL ꌌUU== !! $$>LL 뎎TT<<  ##?C½栠>>쏏ZZ 쑑UUmmtt  99^^ 퓓SSPP 88EE__ RRWW 44JJ]] QQ^^ --OOZZOOaa''SSXXNNcc !!WW||JJff [[ii__llccoo"hhrrKB} IDAT %%uu))NN" jj@@ee$ gg>>aa-ҹ cc==]].Ҵff==XX88.SSbb::  TT55/XX ]]77ǕOO11/]]""ZZ55Ϧ˚KK..0bb##UU22УʕFF++1hh%% !!11Пɏ99DD33 ЛȉΗCB55.. Е::**~~ &&&DC 33..,, Б==&&||)((zDD44:: Ѝ俿;; {{'''zzuD33/22㹹 2Ї<{{%$$ozEF (>>ؘ ͒$##`zFH(::#!!RzEI);;!EzEJ(999zEK)77.zDK)77 &{:H)44"!!, 0D*44$$$9 (A*33&%%E">+11(''P_x://  [Zs+e VH1pنu% txKIDAT#(V+IENDB`armory-0.92.3/img/armory_icon_green_24x24.png0000644000000000000000000000323012414772654017454 0ustar rootrootPNG  IHDRw=sRGBbKGD pHYs.#.#x?vtIME  8\|IDATHǍ}lg?m(ҔQ-*H$17\:$꒱*31`o!X "nmiｿe. :=sN 0cRYdswz'ƚ$IgI_-괹#[kxwXyz t3ZU܅>_4}eoƵhmvVc꟞/h))E4 J[re[~;4y׏ynb69r5_)qK-H~yK[N~k@+ jl伜|)c=RCN,-#Cr}x-[pD5>zz~`xajR`Mj^LbL E/M)TI [_Pk5e',·F=Jo_p6e_ھ侣/qRړ)Z$n@ݢqD^VԊ ^9OU;M'?׎- @lesQ1|UtO'Wڎ@PnHVDkyӒ4Իqo1u’X^Tj'+*Wҩahxl2<21]Àfje, F] rS+ bڐ7Rd9ּvKDtQPAcFb U 9|eepc""&MؒH]ON`{t:nrT""Z*# <蚡{M;;->>&\344xv3RH' q`~Tb@ĈP0Mϰ[~e&#шk`B7tte1ţ 01~1s4Ѩ1IōGUS3ir=ג;fa%*48Q́A(up TT)(َ}DP+~_z]\JMly o_x* C/WI("cq^r9#" "ױOXk#V흻~~P*1Vo@CYdlT ZU]QUGkVְ~\+qng7&#RRRRvI6lc``DR_+aP.kVrDrSmX^Eu DadBC~TW%%YrPЉi@85Gֻ"=f$a$/);=_~.lF$M9-ܤMawm`HFKA@fY6"G9$NY pDd03y9ztET< PJx%$In0.wf"ҏޅ`f6'"ef<."}ΘcWNom6CxxhCorǥ\\'ҳ %Iд7fSfv@o[qj*ֆuķ|FpN6"5(W<G}Er̊GTk?,w_.8(C\j^sϗ4 k'#8jOb<`Y.`_5&ciઓ}&Q<9xBW[I׊KGXCn X|ʨb˲Ө~g<}>7X5X x%QcL-i$}YڜGiZݜpN{k4,k4_5 !ؗr"$ p5>-@TgC;ǦH^-IzD4Yͱ#A͌u ＩPh:B'!(Pn&T*N(7ߗ.*aY6'M!-??9pj!*$$r%%-P`7ޯ}? RcΌB;OKׂ!(! 0Q' :9(RYj53!(pX AD#oo I2"$$A\r7 zZا՘B[&u8c.֐!rk)6_;iZ펱b̰YGTOd<D4쉨vpu@H3I׋O.G$93%TU3ƃr"1F f``e0^D]YYf!{-us"_Ẩ :Yc;9}$XJk'8˙VcsfʱB[={qfde)TDv/^Be٧VIpme?_C;)kG I|ɞ;-d(pn Jm^7yPx櫒6^\*5-]ޱ/v$JSw]w8L!,#!o5ȪUz y[H.|J 2(qJNh&9U,5>?5nlf|t/xl{!R/qcaIӋV@Ƴ5r)55{J( CTFF VHH+||2oP!ū7[foT54f33&'MNP:9I^W-^[c[}N8q\8v'F|< ?<Ɗ\Cxl94rGkW'L84l% \03|R(}x{ڳHIer\ƗJa\d8sZV%VMN2{83ǎ1}0I3dR0,;'I19 EB,쿙G\)=D##gVz -^ $$y$i{k Sr0SfK"9\Pgh>F.]{NvCC8@ܼ^ܚ2k2߷"eU :;7-Ш3w$3Ǐ1s(Ӈ3uՉ BB83|v~ڳi\:vzG,gUI3c:ޖ-IQs͹wH:稽^sj{mI72 %2"ʃC$}}xO go^Lkuǎqǘ83ǏQ@9)S؝8.O=_dea0a'L3ǷJ:-kecv;E^#ZۜOʓr2(2^VOeCCl)ۯ.f`Ҿ_e^4hpgǏ1uO=OP'4Z3NvzecV[ZFKu,{bT- %^*INIK*zo93dʣ TP=cpnF/ˮ`eS)"}Y3qE9eԦ8xaƟzgˠ5;,QzjFcӌ;*] @&Xj{ŻrM^"@f<NFޭњraF.]7eWпm.I Y[gkNҜ@P3{O=`Awl,sqZ|uE:VAX9f\w\ '@vI_4IrΕʑKt$ahv]w;}_:NLy9{~N!tM0佉R1sX˳o=v_p )1R*SJz. E͉`<\̻8f%0vTG6Dz RL7΍Cr:|V["Oה^tZG2־f~yp+bM7IZ^(k@ ^cvS?Ρ{kئu'pyZXG|Bٟ1ǓA \0 (.Kɕ+/{Z\y8}}/c`¡#BVc9opj{Ẳđ!h-_n dHwvdR. zm`<;Gi_?ۯnL0Nd(™j,,pI긶v=YhE#i7n,M %SR.UҶ^.axxLi{!63\0v\|±{yG_cӄ1e6>IJrs/^Y3i(OdFkx϶.K.kD߬H3rSz14;Ze+RU%[nZ},7>k97wD7J+s2scny.ny.໐!}晻Nu](n,yV=Y)'W4}19.inIұb{8&Z9}sɋ^¶˯<cG9r:ZF |VsQz-\Rv&66 h*w]T౦nKHJevx3TFe{Gs/T';*"\]r\zJ  L;Ls ,=#9W5ofQ7=L0VQr]x9_8S(B/yz aF Y 0 'lzq+mS #OHo1{#y3tцC{q+^n9ub)3\atsTOD󬨟µ'՘1Be9s% 2fwT;a-{);IJxqwD*.⽭(ЙkLh8j:leώf e,k>8u ڐ7yF_v[w_]0eƷ>v=F.?o۶}O`P] M}jT]k犕Υ8w)?- e|Zw |ƈ/J}=LyY$_*ٷpm/ "bCPai}5CfQ-,g 6E,€Kϸr݄i'C>o _p^E=pYYso641#1r~fOM HDZ% v7O`(*.rN?Pi2+ 7FR/bϳo%Ib={2ǏA:Q(F+sF6DЂ  SJ_$mk&RW?i!ozyc1hعsǏCgL>Ziҹ jHǽoNoK`7Gx$M+t f'g-He.z }ӳsI ots'UL*gst-/ BM|xn}/s]wA9 2JJn¯X#O\Nn]}ݪp Sx^/&ĩV̑ʗ;پH*pm$"3ZV?s)Ph],v/IZ!O׊;q]3F_9ϯiSm648Hv%.0F j^r,x9!CXm#ɿr$M"5ZwE/22{۫w4P,>w(yg2+(ާ`Gny)AWʕ?4ۉMq_Cx/I?^vEtf-VF3p'9pWff:EG5hYxRϿ|)/񞽷Ʈo. y aȖT{C_ZmƼp}ٟ^-ڗ-o /<61vIr:KlL9Eq幸$=ߖ'PksՊb|Ql-"wa6(RsE|}-\7;/irC>k_罰pN?y+Dmcz꩓KY(Y8paƭ>yQjR*{z$WJgyϮ%\8gXColɉ%CP(u !JF8!@h͇_<}ǮTzUH` J٣G,oN_fE_,LږBq\5žc}ZN &~Έ .R* |R$k8j];Z4*D( \DZ]ġry]ޒjwgYt,;~oJ)[8鸶4&@܊X!15ԁ Tը4ˊuDdve>fh5n/*Ĺ7r%k+Lq W]2zRtY ٚ;8%"_pQ;F^Dݠ3Ҝk;IZ@TͺfF Ǚ8U$6kp+ã]}-G’{ ʒ4se-yeKZ\nJp;gɗo||m[˳6`48H6;djfEC7j$?^[ΥJ~3j7x<3vf`.Pę54cW]KI33K2ޕ"e?@W*.hO_[5V(8ZI/izI'~0x:Wtyכ/qÍTFFヺ&]| El緕9S]0C)mӆWMܾN;RG3vek֊X0u7DOͶ ˬ@Qv0a_y6WЪ NX$?$sj{ڻYKْ YekӤ\f+hLLai|RÆ`\~ܵZ*,i饝zɋ^<<̶JLl5ap5ThLӘjkdVD.SOpL󯮑}tsU,lN^.IzNsSg6}c;HMalزyϪ.Ix? Y7TPFtpI@?.a9[_`ٕ˷tsgreOƮt`0 k@65W*dSSdm[.q }M}40\A:Ut(P^LuiӦy/h- 0u $ɫM$;'p'P!RTǃ<)"m߉+΄ƇtmwVn6*? 8C"t;7L˹8y3 quw*^M\RZR#֯_#X}: \п{7S';̪qJ]W_s!x 1dxFImacID:0P/h YW.JolL(̣N(ut;yFԾLi8`Œ$/.|ϒǗ˘Ӑ!]bXk _*ѷ}Y)A(3 AZs+TZ Q?Ý[Z" @ a]su-Ҧ"TFGMKmo/gmQ _gsg> TxːXg%PZ"1 p,P( BffL#[>;Ɲ> _Y)˩HS>uI=s1')6Zb>4ORdS]1VO]-|XqЊ^k%I[?F}c Ҷԕqd9` XMCݙ2cmwjfLu pU]>SܿR,vpdNov\Y ֣ٴ-(r,q%'T#!!>)^[ǰyYӵ E 4}i)_}1{RNqw!>u3jf=)%aaC)F%9i>l9^##TMqi W*5C W*K%3E=b6J{Jhɫsss*yBtk5[^ qҁAJ#G T[6ӄFJA11${5d/-|}cFi[A؀ɚZdjQqi_(J_×J̦ecY*54Q/x-ysw6FwTɦ&f:IevJC#<~+zPS?udFȶH|>25U&_]dރa7ϋt1"BRʡTj* N;2d]8>Ц.#ԋDs>eV10Nyl ݩME;J^9`o U5\ID?q3+6:! ipIR8+b( {qBVadW yFV  vEؗTiLM͑QN_ G6N>~>bX'@~I>C Ud8y)ޗ:fkog,6Ea)B3%Ii _7I1_|c5/9^LayFxͲ -Z#lC3FF)˕cXW稝:I^d(d$3+!|.VW7NJDtِejimP* I+ȼNnjQKiӃި7gݨʠަ.hS;y$ I__9gjh ;PF!{:_3{nemLұXXa^^*bfp23t04WNW0viU[m|^Yk ]ћZak^$sm;5<\U$á-Z`jvk&t;x01䟳*i9̰~PܜqT& 7aAA5],'4hQ8e흈[Y^v r3.̮i7wtZ9)J m)@7eF@̀ >qI۱m1ٸyg~\z-/;Wa: ؖ(slZCN$IFU07X( ΜNB0U~F+$v+fv 7 nNSJ.SH rD. ymgfWY1JXiaIz5coHHd]vj"HO<}9 K5G@a7plGK,wv(?HŬ\'y5] {?K,`$"[ Z`C\ K,=) _s;HdCM&;'izU, Xzq77D֙c f\SR#%8R}(@h:dO7|BXR:CD"[T҅CGvH$1YI/2$@ɢY8D6 ˵Šld-a+G ٸ,kŒ®wF(Hdb,KX/r,`h$٤}g 2 ź ,-HB%1n\hD"e,Y,ߋ{eKGl\ " -QU@$Q.kb9_ŲـȆN-gHgxH$q!0.Ab6`$q`OX\jH &^{0L">_[8!kSuV@$rN?mV:4_ rgg,fsS10(90WOCWMGz=BΪO|oLc!Z0 +G3.4'$79.rB@$3`tίԠ[κ`ƃǖb\@$"&j>_8Ks2 sW'c8ZHOd޿S/0jK՟nӢ>?[5dExx"8zC xgVs^P+ N8+X><5cAQ:Mz9+wM92gPmfTkyWE?Zzp"(18(YBk|9Q4|˂~tuJpJg3xg,^!"KL Ŋq@ft)!,o8bU8YC+ 9I^E'1qJ 9͉ڽo_&+R!%uޏ` ז=}p$œ5B᱆pRGRϧ=zZ>B^CYXD5g4D61 u>WSa/)~_Cx~F11"[SA9C"!:Us/Eo("^N/&ގ|mb1NB*ͫj#7O5/u>L=!dLɘisFL .M%N%W=ZHdq(WkRy~P/ڜǚI@Ÿt 5Vl ߁e,_ n!W;B}mgx_4rI?wInkK>V\4x Ͳυ\<ϼ~պ> /է1^.uڷj.Z ʔ#y|ּ\ߋ1$I3܋i& Ų8aE8+O˘U#c΋.?tIA` *{F*;F"P̩uL%qoq^ ~/c6)q2mofP5]D6=Y\i< ~ûS=?wކZoh=)?`#nq;`c") }s8o f [qyӱѣޝ?-"x, 2g@Vݩ"T0걞@dS<,W 󷻱/7*_߆É9dۀ{[ .jOxVٳ-D΁V|LU5_3՟}|}oa-_%HJ!˿e7".:("OOxfʷjz~4Ͽ,s/pZ7 oFUDU\Wf@+_,Kkh#p7gW_Dن=àa`Ub R"|Ç#]"ц5f~N4+ϦR_$evTD-"n3X(;> r(>s0SYɗ7tZCA98sKa콚c8}~''j%5%O[fU{kI>3LH`voZ~q,a|[N Esk`W\hb\8+JaF{ggۡon}h#^F\*]j nG1R lx3g_f<ӗlj- KJ ^Z/Z?p+-`\,.\QlIP3Fq&ŹKŭ,&c0}Ա;qx?*ъګ΋S"LS}\U{epzծ[Z5fBfqZl"y2XV1#t=w=>!ʷIK5KWx -~py/"I8(lr3=Di:eT8+'Q"/R3쨆q ߽kh`[,g- H}##׋sx(BO/`g"ls$ U)"x0{넆pT?nf7kIZbf$߹@_1;qh^$_"Zv& 9awKQbH.V#VxkͩC1/$ |M7AqUz7%*xW?x'e=yĹk+Lڍ(m^¨*M AX8lARO5_ǃ2_|jnߊ0I[qZoD#oJg$sszqĻgQpÅW,y6a'T:]Q$4Ԙlnmu jgS[S k (ew- ,xG_1<(m~jz^s^UX[@E"*OT ^@8c=,[h]զϩ12뵨76kr"=eUO fl"*sM_*\ĽUۀ+'CܼeW(sF@+d@C NHYpBUg,ߩdZ{s%*U.Il r"/^-"sq LU8fgMfܟɩ̌kmXeд Y$0C^{)"FeMf{M+fs\ }QoK?)"ĸT{.RQXfp1a!thVK2=u'q8FHD،gs7;mj7"q `$+>ܸ 0 -5޹l;Eٝ pEOC` NH*jUK@ًGKkls 1*FؙPjp Y"8,#H,03@z|$* O5ˍ BDRQF.'l;lhn6H(fs~E\h3 f 3N9pLThP(fԏ8@jnvj9]uHpq3A-8OBT2N FtEXtSourceWPCliparta$tEXtSource_URLhttp://www.wpclipart.com/4IENDB`armory-0.92.3/img/armory16x16.ico0000644000000000000000000000217612414772654015125 0ustar rootroot h(  <`)ka*&<0NL\҉`)`(q=<<;AKzɅP`555>5557865===<<Rf̃Rݒ_ #555555444=85?t>=<Jaea^s{KՍ\,03444034d=r8?>BT^aY7uEޒ_~RcC|Gz@^:=?ߏ>IV\CZ8Ѽp?ޓ`ڌW؆OwT=`H9{@s;(?i>IUf5\8=j9ߔaڌW~N334B;6{@s:I?G>GU_7`7e6i5m3EV[:`7d5o:v=VVVHVVVHMPv?s9 A?BV[95{>a@bڍY؆QڐYr^Pߖd555N+14x=l;e1(3$k;rw ?!p@?armory-0.92.3/img/armory64x64.ico0000644000000000000000000004107612414772654015135 0ustar rootroot@@ (B(@ a*a*a*a*@a*a*a*a*ga*a*a*a*`*a*4a*a*a*a*a*a*a*{Z.a)a*a*a*a*a*a*a*a*a*a*<>Ŕ><======;<<<<<:H`eeffffncuvGޖeݔcޔaܒ_ܐ]܏[555I555555555555555555555555555555555555555555555034mI4 ?>l>>><======;<<<:D\eeeefffe>dp?ߗfݔcޔaܒ_ܐ]\*!555555555555555555555555555555555555555555555/24P@5d7p5?D>=>>><======;<;AWdcceeefefdbYl>><======;>Pbabcceeef e^_z^.b6h9gݔcޔaܒ_ܐ]̇X,02555555555555555555555555555555555344@:5Z:z=t;s9q7o5p3@@>???=>>><====<>K__`abcceed0_X4[7_7b6d5hݔcޔaܒ_ܐ]]-13555555555555555555555555555444:75|T;|Ax?v=t;s9q7o5p4@K@>???=>>><==<=H[\^_`abcceeA~T8X9[7_7b6d4ّ_ݔcޔaܒ_ܐ]]J@9555555555555555555555444555iL:~E{CzAx?v=t;s9q7o5p4@)@>???=>>><=<DUXZ\^_`abccd%ezR8~T9X9[7_7b6d5хSݔcޔaܒ_ܐ]ސ[eI/23444555555555555234]H:H~F|D{CzAx?v=t;s9r7q5p4@@>???=>>><ANSVXZ\^_`abc[dxQ9~T9X9[7_7b6e5yGݔcޔaܒ_ܐ]܏[܎Y׊V{PVF;/24234TD9zJׂJH}F|D{CzAx?v=u;m8D:4SA6e:@>???=>=?HNPSVXZ\^_`ab c~T9ӈX9[7_7b6e5p<ݕcޔaܒ_ܐ]܏[ڍYڋWڊU܊T~NwKمNփLցJH}F|D{CzAx?t=\E6B:5k=w=u<u;@>???=>BGKNPSVXZ\^__.bT9X9[7_7b6e6m9ޕdޔaܒ_ܐ]܏[ڍYڋWڊU؈S؇R؆PքNփLցJH}F|D{C{AwQ9<85c>|Aw>u???=>DGKNPSVXZ\]oT9KX9[7_7b6e6k7ޕdޔaܒ_ܐ]܏[ڍYڋWڊU؈S؇R؆PքNփLցJH~FE_=445kN;~F{By@w>u???=>DGKNPSVXZ\~S9X9[7_7b6e6j5ޕeޔaܒ_ܐ]܏[ڍYڋWڊU؈S؇R؆PքNփLցJ׀HlB;86344555{U<}EzBy@w>u???==DGKNPSVXZZ\X9[7_7b6e6h4ݔbޔaܒ_ܐ]܏[ڍYڋWڊU؈S؇R؆PքN׃LxHN@8344555555555^G9~FzBy@w>u???==BGKNPSVXZX9[7_7b6e6h4ֈVޔaܒ_ܐ]܏[ڍYڋWڊU؈S؇R؆PքNP7234555555555555555A;6FzBy@w>u???==BGKNPSVXZX8[7_7b6e6i4~Iޔaܒ_ܐ]܏[ڍYڋWڊU؈S؇R؆Pc{E555555555555555555*03FzBy@w>u???==AGKNPSVWHW9[8*_7b6e6i4t=ޔaܒ_ܐ]܏[ڍYڋWڊU؈S؇R ؆P555i555555555555555,14wDzBy@w>u@GKNPSVe6f5>^7 b6̱e6i4m6ݓ`ܒ_ܐ]܏[ڍYڋWيU555H555555555555555.24oBzBy@w>u?GKNPSVwc6d6e6f6g5h54b6e6i4l6ݓ`ܒ_ܐ]܏[ڍY5ڌW555&555555555555555134g@zBy@w>u>HKNPSV`7a7b5d6e6f6g5h5i5wj5i5Gl5ݓ`ܒ_ܐ]Z܏[///444555555555555444`>zBy@w>u=GKNPSV^7`7`7la7c5d6e6f6g5h5i5k5l4 =ݒ_VVV^^^GGG444555555555555V<{By@w>u=FKNPSVV\8]7:_7`7a7c5d6e6f6g5h5i5j5l5m3!o4VVVVVVRRR666444555555iL:|By@w>u=DKNPSVW9U8\8]7]6_7`7a7c5d6e6f6g5h5i5j5l5m3n4qVVV)VVVVVVUUUVVV:::444555QA7}Cy@w>u=AKNPSVV`X9Z8Ζ\7]7]6_7`7a7c5d6e6f6g5h5i5j5l4p7t;VVVVVVVVVVVVVVVUUUHHH444:75Cy@w>u>@KNPSV5XY4[8\8]7]6_7`7a7c5d6e6f6g5h5i4n8w>v=t;t:VVVVVVFVVVVVVVVVVVVVVVVVVVVVRRR,15|Cy@w>u>?KNPSVXY0[8\8]7]6_7`7a7c5d6e6f6g4k7w@zAx?v=t;s9VVVVVVVVVVVVVVVVVVVVVVVVUUULRUyBy@w>u>>KNPSVXY,[8\8]7]6_7`7a7c5d6d5g6vA}E{CzAx?v=t;s9S555YYYbUUUVVVVVVVVVVVVVVVVVVVVVUUVgM{By@w>u>=KNPSVXYF[8\8]7]6_7`7a7b5d6s@ցJ~G}E{CzAx?v=t;s9555555555;;;RRRVVVVVVVVVVVVVVVVVVVVVSUV{FzBy@w>u>=HNPSVXfYl[8\8]7]6_7`6a7n>׃MցJH~G}E{CzAx?v=t;s9555555555j555555555333KKKVVVUUUVVVVVVVVVUUVoL|EzBy@w>u?=>>=ENPSVXGZ[7\8]7]6_6h<քOׄNւLցJH~G}E{CzAx?v=t;s9r8555555555T555555555555555555444@@@UUUVVVVVVVVUVVV~G|EzBy@w>u>=ANPSVX.Z[5\7\7`8҄Q؇R؆PքNւLցJH~G}E{CzAx?v=t;s9t8555555A555555555555555555555555555555666SSSVVVUUVxK~G|EzBy@w>u>>NPSVX6Z[4\8ˁPيUىT؇R؆PքNւLցJH~G}E{CzAx?v=t;s9I=53555555555555555555555555555555555555444555GGG`YUՀI~G|EzBy@w>uNPSV~XHW4yMٌYیXڋV؉T؇R؆PքNւLցJH~G}E{CzAx?v=t;t9>85445555555555555555555555555555555555555024cK<KՀI~G|EzBy@w>uuur^Pr^Pr^Pr^Pr^Pr]OxaRiߗeޕcޔaܒ_ܐ]܎[ڍYڋWڋV؉Tc؇R555T555555555555555*/3|Ax?v=t;s9s8554555555555555344;86`G[ڌWيUوS׆QׄOփLՂKՀI~G|EӇNr^Pr^P_r^Pr^Pr^Pr^Ps^Pgޗeޕcޔaܒ_ܐ]܎[ڍYڋW5559555555555555555,14s@x?v=t;s9s8<75555555444765nTC_܏\ڍZڌWيUوS׆QׄOփLՂKՀIԁJr^Pr^Pr^Pr^Pp]Oדeߗeޕcޔaܒ_ܐ]ێ[ۍY555555555555555555/24k>x?v=t;s9r8B:5444555^M@bܒ_ܐ]܏\ڍZڌWيUوS׆QׄOփLՂK ՀIr^Prr^Pq]O^ߗeޕcޔaܒ_܏\܏[555555555555555555244b=x?v=t;s9r8H<5PD=ԑcޕdޔbܒ_ܐ]܏\ڍZڌWيUوS׆QׄO+ׄLւKr^Pr^P q]OtXߗeޕcޓa$555555555555555445X:y?v=t;s9r8hH5rXGgޕdޔbܒ_ܐ]܏\ڍZڌWيUوSU׆QNLIgSߗeA555555555555555555lM9z?v=t;s9r8W6MD u;X9??p???ǀ???armory-0.92.3/img/checkmark32.png0000644000000000000000000000267512414772654015221 0ustar rootrootPNG  IHDR szzsRGB pHYs  tIME PIOIDATXWkLW~ׯΥP p)7/fqY23y03sqBMc ͘n̘ucL` ^&qZ*TJok9U[eēs}B)l r{ DN/Oٜ 8i\4U[}bz\"U) $&pk57N.bݯfl6#av2Ֆ,ͻ# I_jpu&. #cr M9ܗf9E'ӧ]w1"σxhD(Fm۝ر_q~m<)1|V+ܠ'!tcprbO,4fvCX]4=o3>PZ+KK1 ?fbw_?m2e01Mh5y 20=}Fs|Ձ́C7&$MV$5oUf4| lܩgVJf<a A`Ԣm>]W ORmh:ǣ\WSE wQVPʣC> i d!NXۿɤ 6dt:^ȩ(ZA +uC&]8Vhm~n$esC) g)zCn'}fbUhqbGÄrޮ+oOR㒩{b@]BUUq7RlݲtG8 A gxP9u n ܄av)E-Q\SU/ӣXs972#"1FvjcEˣ1Y5f/cО dڋ5)4>.GN-+uC& }dah74t9")+cmn7EaJ(CqC/$y\ ^+Y;˃>'B.!Nv݉\~4+cŪ2yr|~ϰ79@~b̊ҵ3WD)>d"75J,Vy:f5W/\ZQ!H ȯi9|%PgXjG9@MB d[:f2XBH ^%|@t&]ϭWy9!$xxdx'!̨=@!D&T*ee`81dbAq}z R[=pv裔Ux_M΁IENDB`armory-0.92.3/img/keyhole_red.png0000644000000000000000000001103312414772654015402 0ustar rootrootPNG  IHDRd[bKGD pHYs  tIME(hśIDATxK$GZȪYfvb]bH8q H8 7dҮ "䵗g؞~T׻͡"jrz{<wEfָB ]S8p瀟 |$Hx@ Ib|L ~xu~4YX&xix~}`|c/ ,?,W>j?lGlqx_{f݌ج~\娔@m`YԷ9@/x Y}Ƈ^²#B9m9m mlY@,*vO i;u,liYk4l_!@8˘)$aDjyNeyN^z*_ - MqhKIu.]ϣ#%mץ$VyNLq1"jq3M4%2q?~^e!`)co4m4Ss8KB4e$~r0s0q8q[;"fIB\=0Q`~ZB~*0e!8 Q`͖xŝ~txzk =ץ8KI(zkzBpץylym)q s,#', ߶}.w:Ǘ.O۞Gqp z΃KՑ.e-mO~|)JJS`<.raXR8,siZzYݭRb Ə]}߶rmˢ)%*q_@ 峀 |G:B<.u:< {{<UR}Dٓ49ω,(Q4BHv/.OdKeI\^QDbަ|~6lG ;;K5U0r,M18&JS*48l)p*xf{/k6i82U̲rJ$Y("p4FqM}-M)nOz<Mc+o4xlv'h"TtnԶ2Ow|ݦ-%v'L-)jT˥Nm¤[`qjed5G[-.w<t]wBJ!.Ot:dT]^(׶iIIKJc6q@JR.7XaYz,uD<ۦ)%m/w[bĆ}U3fӜ0*KS8DzXTZ,hK60Ye o-M2|5CfE+}w !,I=, Y?t ,dVH0I5&ZZB+c$YۇDBRE֞7ۊ7%$sfI0 Fђbi0Y||IgUh$DmF&>JSsn 0MڸyNw-\05r81KV[i3cnM|0Cc\_#=qSX@V6&qqE|8rs:]ᵐ4p6hĭYy4I=qc歓uaX/feK^?>&P ]s(ktī1c^?>cޟLq)y90ᐆаm\U% 5cEypI;8=lxYTZ_g!%%ԧ/17c{x߾>2kKHў̒[ϔ9Isݦ뺸%תXc 0yF^SJidܕsuD4TC2Ғnt1ri݁JQYg$a˳X0 qƈp:{>R *JDDq0RòWR$9xg8䵣#^>8;GG\+NWHQR"mED8f $漠hcNrEœ8f!0dNjdա<% >Ϲrr|pkGG=p{6cĆV4S_28W;Wݟyk0f]cN Taȑ:_E@VT Y=TGey,% T=D|v)%>ob7XRî!u%]ʮzJe-b׸@JR{z@UmՔrUjt9ZG߽zGE>m]"t\_Y$D AGJvT:io>+x;˶/;N|LÆu]RYI:z>PgtOe*8.t/ pj;nʥHȽԉf*ֲWl6m+ˢ8j:6h.2ќ*ؐB_A*(!,^{CR?y벫覦Zi-%*SX *(#[wjhk#!ig (muS!kvX ngϖ{(\qdİBBYEKX*D۬jtuFWƴ2eg)6j(U$#%:kaCNgpO)ZJB:*e?oWGK^& *> \F*M\/{{Ư&UKJw(IGWf"RA@_WiTI2IqˤgѰ!Ѭah0nzv5w" XI|NW@{;W;@䥲<*HqI(L+@+bR܃xZE\@|{@dU@AjJd-@pdxDiIsE]' W+ $?0S;ֻ (D"vYƟXK]ݪڇҧJ gc4"JTd!dWMjVgaL` adL`4$NN| z.nbʓkcֻF́(z; x'=pAU+SH_ln י_RID)11r,IY(pNOW&ʎiӁ:A7@ԅW\YRU\XEwSD:Xߝ󨪖E䔪H2=!y"suH Ɔx7==~^jspQd?=gh܄V?'3}#`C92U$N:AsOJ L1, )"zcxulv.\~tf VѤ i j߲dw{P6~0  .?D(ﳕ6:Si d.[.Ww `9QH@ yFB$7fQYu@kuE+h\$?gC(bًt#nƹRcm $tOzn՚C?R `qp 4+B7EViqedcE9\x]VS#d]+hu\:˴-TC՟Ϻ|*~kէX)(9-gNSO1>ƶȡ~@;n{ $HꯋPdȅ"D+2E@M*PO0ѴYZ?wlHJކt@)tLJ>Jy}*siÛMeP2 K$O:A3Hl1ZÏƑ& m2VƏcatr$ocns3Xw$Jt#=1}2gBhqz'FS!Z}F{:n,o.d l/B?r?v MF}32sK\ TM/VA7$.`>L/߲<ƖL]˜~&s|X݅A!(W?=EMjc^l o)Dft'c'}u"k}4mD bZ4D##&.X_7fog%i%sܙeaU,Ol­h/Kwb͚DOqɧc -:7Fecvb^?t舰Mue¹8wz^2ʕSx!92ʩӓU%mTB ӷB7R\h`ꧼߧKRXҵ Qy;țH~*r#[|0~b(¯>b]\zveǎ.:;_=9˙.}Brjpc'y~f I mw'feB9Ϝ>Vq !"|'͹P1Pʻ *ұ 7ȰgwW^. v˯ ִ@$٣c<)~#WT!1{1{/ ]V,ARKS~O}nn9=pC Dro{?ts,uvĜw랿.F_o cd"ByG+>QKN>*?\ݰ>\7܏^wcy{!J Kp'O<Ǜ;.`/]bl7'KS_=V3xjo}ge"-<`d1u8%)|t&)vS-:۱RBy%>:2Ig=y xe;*&@&&zw'OOMX\q!wc)s$rۊ>:ͦMP9m5pK!P-F7c#̯ۨUګpuؾ3)% =x;xu_lm_`/\+I\^w|z7`ټA`q$/M?;t>ןGL&\x/yy\p(2aĈ+ᩧ2:~ *b\:YPjIS~Y?nRTJysɯbpI{G&ȎP{*̶Kdv^/a7 B
ݥy5ڍ@VÝx <٦~XtJ[vJ Zp'12ViRJbw_X qjt I:4xzsOoc~T0ﱆ'W&q>?y=U)җ\7@ccV:BO}@dط={J-L*ޡhRA:b'mvd /:.X[nƵ^s;_-JboөQܳN7]}{{xsn-%lD`|"{q' W!,n T5rN_vouwZ!ӝ67Kf?_q>N.5%me/;:۪lm% 8y# V[ H1;5N Na>EF!}3#p..~Gơ8 UwC%k{y5dO"+]!J7x럿kord. Xkػbrrp40Yw(bL] N4b1r깛K6Ƙ{PN-m@I,p'ğ8r3Oq ۖ5 i2a#ךX 6™z-H2%DGȪ߰޷,W},?G vZOׅ_B W}9y:`rL8P:!%#t*<ߧipsOS ew)^G\^=ԡ>P0x^z֘uGczcٶCeʕ: 1X>죕a-52a蟬@V* $&c}w? Su_x5WYK!tҒ.m鼨ArK<82Ykأp贃<~>W}Q m⇎=>Sg\q^tRrKI# }c}mHT)>^s8#^G%j~b=ox]f#8:89X\? _( (SV.tE&D?=C:sξx= D"łyO[kחf;:ݺ;Δ`)-%ﯮ}EN. fkɗ#:Eң''Cg}W (N=nbN9nv/;u}xτM79T XHkܱDZ}-:9 +UcqM|,YW~ WEVT07)f7?Zr͕0gD6gTC|cTY'Hza\QZj  7?{Snv165͂i?N .7_qõ{+|7aZ[3]+!yjRaZ ư_{38; e:,bl~6Rl*tB^aYna?3N/?8 h~&j14kpZkSOc0eYqzo^ΧHܖQW#//Dj8=;}7\{..8?τS'Y3Ш!md!@SH\K#R@ԡws#Yk?}7A8XbݧFq=*m*yzE)ʭwe*$p.V;G,RR'vm B駓D߆&-kzkk|@h82?l}c}5z{ñ+uMӎww85TZs ÅCRA:{>cT| ?['?gm-2oF4n~R^i@Uٹ}8U6`k_Bo/=6<{qF(F%.:V ;b]/E/ǖkɶUfc-*U`r*͗!VFHGOߩ/qW9շT##l)]=~H.vZ?Aq;FLN% ǏȫH12UOWյ^usyɿ#9\<7M vΧ[~Jan-]LWt2.H+{|ƗF8?Wg8o-rm9~|a1W];:ٹF5"(gv''9=Ti*:9v"}^Kb+/pNxnVODCP hn}{z"S7Ãn]}fwiq'd͊ԧ)ZePUo1kڹ:SŎ^kobUZ-G,ҁW  t ^^JH{.#;F|S[qSW-H/n1 V#e@1Qu;X)[}ts'{`"#?zy+o-~o-Q ~9YJ]Y.x]LguYH@TTOLL͗Ճ*e:# ߚ_+ EjII'GĢ~}Ez{>WWff je _E5 Q$v/Y׷2p ٘mmr^Y_a Pjs]4>}%N ;z jDkNU`b%m]7u})pߥdž₄XB>O`NF*-jm Fz/ ^ [ 3n+~ F;7FV__|ٯIBDWg /}էZD[(A4Wg 2Y_c::bjo+*Td=볏m0v,OPї\rZgQ1WizMz<yE!C8x^U L^iyÒ۱<0NGC`^ZiZY=y^A lq7F(DȊy:bW l3RK@umXCd.^\|Ï32q^%AletΏQlxӀbgӗ$Ǘچ+/>huooRO-tώ`#АfAoZ2%mI(r^fy, KW7}~T nyNm*:;) ]qV,I۳KZLJC{ |xՌɩJ-#I}.,|d!u@5ʩrT9Ìqd+{>wE&PK$$I.ZNYZ 6h|0V;4Rc@QDZK#,7ݘqg "9Wzo-`x{|3NϱV JR1W xuΦa;O5ӮQK/:_/DnQM12HwWfN[uH>89XZθ-TM:G <: >\gwy %y%:*2BX(Q,3[ae_Q+ZFQ:Ռ$ux?jī2>Pdtl/cUkXkKsk'm_zϼe+Ȯҭ<'fƟ<'SpIy860SJ#w6Fu'd~%xվ!sZF{K_}bJmt;G5ê|o@k r`GTTr1 T%rKRF B(V ?c=*Z&D5 0#+|$Wg-+s!0~ hK],g(Њm&rvϒ|vCggU;ujI>.xСj|!bV=T:2E0bQ ,Xk#>{uG~VU#9Hmo݆6~M˜l8P-T}WU$? :Z}#bk @$rti?h@`C=*2y:*c i@`#J^[lXh^@ȳUVr.$(٘y+  BcǙo(Ta̫5V7[g;$d f:E~݈#p1{#+{UlT-z}dwy8= -"t4$:65ҕen/G wҼHt0P%TuAf/ZV06,m 80j[a ؐ5w_*/ԣ@`ic+Fq?UF82} k06Զ]#݃cLg:|Zȑ 6@ i9Mt-yRDj{ eV&`DK5V~.u-":G. l\.DxoaEMc ehS^U#  H@ Y6d6hGK< ,nQNmZ3̷JlAƥt|UI6*<8DgU5Ӷ}@FxU5c!k 2O PPD@`H$ !m-ud-/!P qihClD#[j+s#&@ L[!?_L@`á YG1MaRTMlT0-6m 8ǞMgu0_VxD?) 3KP e1x/6,\{ekMo #.ET4!@, 2?i2W=2 g30Eѣ3ڋtD!˚,[X...Ao!hZSi3b1-f R\.,%4} SZxSMsK X/@޷<i??T @,YZ4yM{xG5^rN>|1K@8O>Aq^њy%ڇ>]K Fz¾@lj-_^/[]=8tOhӶ `g-xA+އ=c9.Cbcn!i{wX9e.k S&@M*i:Ɵ^R+MU1kZE]D!((Xk%hڨ٬~e ;/Y$w U$79\֌;9E/Zv;['VV& U:Eߠש$'re8ԝ[/Z)5 wܻ|Tm ]xhm2l VMkuʝj$,@π\V&zY pPh;! SϽ;MN#]`@`X˸U4בQe]z|lT^9"͐iLJ2iV? xy_Qط EMe;tj4, +ehy,O+|% ^ }3A8c3"7CYZBkHg?!D88MCi:P;*;S3+svF~sCsC'RO3;tbm!^ >30wZL / X>ZG-zwQFj'3μoS[1-8tb* Ke`Oyw3R^yB_Gu+ ,- ^3PbWsV8,KNF̥$CO# Kvo`?XYIc£mmZDF{ G8᥌M/VIZz+Nӆ` ;U7'CwxW<;{mmif2#;+~4$bf'JYL9HġyPCHENs~:іvLjg ]c4݉}Q(;ЉdOfƽʑ^R^9M?1NsO8_UOW-~Umqв86foqHrбlV{H:̿޷j :蠋/:?iX|Iq ? Q=6/ϼS'S`WU#3VQŏB'G˂Ə ZV9HU? 2joӛtW_2Fni,A(&br4OZlٯfwH'UW6BE̫EZņUVg#myP kVӌw6k|$fwl{ Ϛ5%hcOkAOY= ?XaW26.ß~ms p󧏴~eZs^ Ndf-a_Eݩov!pFQ`sɧ`c֬=k>W}wmd>['*` f]zɧ񧟥eL#Ҷ/ϬiMȞ>AǐbG^[ $ccOԅ9e{aF`}tCOto!Cqd<7K=ݹ. {jqN.O; cgS/:^LR be?@GR\&KAO<ڔ{?eoIXQNƺwv KU"PDZ[$Y2W 7s:1X׊!Hؿ]*[7t,U^U-5"m&Z@:BXo>[0p_m_{MOF&_?VկAK+ϫ^bD.iOheE!``?s}է{u durΧAL-U=Z =ٶޭlat|.c?4?._Q~rl Jn t^^`=O;8낎=@.mV4Pw"!F\g3x)d ?޻qu\(S<0[Бf?|NU}Y%V_;/"߭5W=_:漫1"k*~9K}-}0*U9'w0_I&o-nl kr}8zf&N.{.e?|_-eZ _+,szWpP*Z@'0KFξKv~ɗ]} =j&]/""*cSE c\;$,^,^Z$gwOJl_ꏣ|C"\.B^i4TḴKpAؘkKasMbH=~5r7A_@W FO>˓ąn`#hm wg^٧zs޿kLzz̊ `^} J FzN+%%)tryI8w3׿'/b;'\īX0%f뽀#?n9XPnJ=a^'A#:5|MkK*3SLn3es[G`xFwy{pPe|.Xa(PplCФ?١ᇎ-9UMy>|ڹ$pY ~2w#oV-~:SO@}?ظn `s %cb,8yaMw=u vbH~ycU!.bw'(L 6:"RisG}UT=sY4| [1һKH f菱AlDDeSOi7LVܫ|~.;[U3{OH")TN:[S480xm{J \*clo2F ݹU3߲{ͼGP/Lr `t<,4b1vckVbLtd,s؅tĎ޼r\w+F#%ɜsښ%h@ZCkeV z7{Kpli.p&O6bR)2Q5<{rr9(kMB K5/GP}9}49A`GWZ_@?woyب \D,E)"l7F{Vv PAc*(7@H$S$h>D( # >!Ij2M?i+X>gԂbAiTqcRB(HjQ,BGAȜ$f.kZChFI*f2l3DﵾpE|sE \}} dsv߉̉ <`1ώ8KQr!Ї@P[߆I$jl n` ?!t~;tEXtcommentEdited by Paul Sherman for WPClipart, Public Domain4%tEXtcreate-date2008-10-14T16:40:19-04:00Hr%tEXtdate:create2010-01-11T09:43:37-07:00X%tEXtdate:modify2010-01-11T09:43:37-07:00)Y2tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?%tEXtmodify-date2008-10-14T16:40:19-04:00 >FtEXtSourceWPCliparta$tEXtSource_URLhttp://www.wpclipart.com/4IENDB`armory-0.92.3/img/moneySelf.png0000644000000000000000000002126012414772654015054 0ustar rootrootPNG  IHDRK♑sRGBbKGD pHYs  tIME 3P`z IDATh">%{H"kx!D^t :*۟J  c @    ~FhB_    <3%&)z$+ 4t  rf. !!5f*s@  (ret B   "&< "\Oti#    mD# 51:. ti!3 H G8<w{ %?,:   vk&  ##  ti ضvJӶL&浽R bW0"n/ (f 6Q   " (*9   -W< O 5 ''5=  5H ̦  M    Z5& !1$7 ! 'Z   0!9|m$    A!H7P=   E'C{8    T&K. ˕7, Գ      NA  O/* f|$IDATД0^lIENDB`armory-0.92.3/img/circle_orange.png0000644000000000000000000011525212414772654015714 0ustar rootrootPNG  IHDR\rfgAMA asRGB cHRMz&u0`:pQ<bKGDC pHYs   vpAgg܊IDATxٟ\gvsN 9 SXT.Uɥ* n~~S?ܗ߯TUԒݖ-\39xη}߉!3 &qk3yUhlͣStP Fl* LA4*4S4 ah5* 6i4}!L@Ld `.lae/ЩU6>]**rCX *0 F!Ac @E4$UE&P% /0@U W@ Q@҂ ( 1!+Ch449hDȆ]axx23P f#&!XA20!r 4 4DdP Rb!4B*2"FYr~d AP28H X` aDIXEdBID^D+PuC.I0hG ƒxR+? H҂@T"VjCUh 00FGF h Fm'. @CL`)BQ-ݘbT(*4ѪA3TWp'f~'׿3p8Rc}c*"DdD9!TBD f4HP@B )p71R -L4!뾩OXc1?&T/E 4!J"4SJA0}MT@dBO4>aO =lZCbE$`bQH*=&0bdBM f Hr ]1~]ǃf!WE*H"S'5` 0) `(4VzWQ*hH&A-C B(ȟϟpjp+րZ{e 0!*'@]R@ $sb4(4*`$ ,En  tW0#+0Ah&D4Mwn(fh4B*LQ<мTޯLBPE,b"FJ#(JE_Up/)^@ ݁7q@gvK U,I!0C [L xWQ *i4*M듢RڕEjSS1F7 C45QX4)f`*h1>Af`F#*D` DBi%Ro0x_{}ѿP BOMLĄOkA<Q!*!RG_M`F RG^'28tM~^4fVIK6iJ(8HU ( *T=Dn(hL-TL1 JSD 2Pl&4NE]V8FS2/ ;M@MNO!$po͸t{UE& 48 @pↂ&@ss0 Ɋ C)GU6 USMukq/{N hFEPpTTܢbꍏbJQjTQE+F#7aB2".]k"m23I~׾_^/\EB ^&S h$B"H%{  "bd(Bq{R* (DDLA@KK||D%2Yݳ4*h4T4XQEA^ yy<6urskT*3/`=πE A "HRiա%,!Uͨ{iwL#R"a_r<_y Rd! JyޝG5N"S*$("xmĕD0("ڀ4ͬٞ˲ƁbZߘϪ|XYnse+r`UO*F@`j@B^+wKC+oDž][Ja޻pvK`Яnef o D ݿ3&x0TE Fzh)=yTy̓ +R ?þd拿>~w (Y` o)薣*_긙[W|@o#8`4x7޽`BRElߞRZٰo1[>Z'kʹL\@=]a T}xB @T PK^eS-NXquM\?|z9`fXǪp0B-znT<_$2P,a-@ S JS j)1:Z"wg?; ,W/_ŁU04[]C\h|{{" /@cPX"" f,dEE3,/-7}˃ZG-t2 ^}ow9ۮO($ SHYjg0Z6zJybG[w;F*jI]``uD U*E#E@4: ,aLLS+^w8P🞲h1ߐok7P](TȐfs>xCuIk d̽~ (f6u,oƞ={GW+G7-xco$v[(7݃ZmW # (9/Xd/e~kDž Wsn͝pyܵF*ᠲ+s Cef<:hTf Ƅ0FyjTHк ,Ϸ}0/"Oă,P(2d&iDE&B( P#Wz B!4|~qOs+qJ#+/,fr0 ku 6щ>CLG 3 r^~xnZ߿Z]xunTFi*T`VV>ʍ+"bjxDaAajGXm WdOO>8y ӧQF π)( #T v@DA! 3K!njF3[Xiػ4w@cgVnp8Ҳ}|dxj+gk"~.[=׭b|; ¬I *+~{wgQ^o" )*=CZ`$$'7}䷈M %@7=X,ATK3 04`ټb >X}?{rp`/' +LԘD:PIMH!YU eA]L(pi'fd9!oP/kX-ؾ1Bޞ[,:<}\y_ΆW̬w9+&ɬdM 4P$/TʼKmKU=Z3T=7XdGn)U`ք5aov/Ņ7:qe}mW28(1(1a꟧" RٌiIM2xԂ/<1൯p>C!ࡾYJOF9J{~#3 텥Ç>y叿prp, aA!>Y'<|hY D>/y,"M}Iy>Ktuf!ƞjvA"*vBl?% hp6\7݉r(^+h쉽Ƒ~x\˛F!)@ AiL)QPQՀS&"?ckN> Ce"d*^g5o'/330#%HRxKLDÇ\~ K}!VZX&Fy| VrO^#iS362Oݶ07i"BDR![wZzz0X3 6`UaM'^HOG7sչ/mt:}X4@i-UjVO0j:,u-l*|/_~tb4ad!3@ C '-~c&t#fy&!k/?>7Rpw  H6連|njxJnJ=?')8>l f9?O@rHFbo1%܄o 7؟4TۍXcO^POOWl~xڕp$0h`l `V2PD2hfRTi~R˺cg^k*<,C 1EiWɌž1 _"ϋ}ڟ;uW~+h>8Q|0{ƲW+ʖp)~iE|T nDHQBa3n!B5hib ɓuެm>~gpunڵp8 JFญ)-3g Ux '_iT2 LL{g:mckPRA@ x&0ɭ>L(uK9="[s g< 0orֿi`slyF^?Rq۽*|C (!䔼Q'FJ"aفo }6Pٶ .KoW|oxK``%)bš IP+ 4(M hP"x#ӧ_`P"0yŌi:Ft%PU<E29)DEcs_yđo[_(Q MT?KV)Q;q`Lswb0ЪD,{hLVnPt[,8ti7%BXǗ'[*^eKL({:w *[zϐ?YU Vї䣁G|KydS_"Ef ",#AdB B0 $@|2\eCaI(VlC~_oN{ zWe[?b;Ktέ+ Joꇕlw `=O?[ BD7)!E^nk9 b3F(bͣ߉z忿K^80@JhmL{J0(%@w 4sZ.0&f*w<鯞`̘;VȐS̓Dd00d 'P-x~w^]|}f[`p-ٮ"Ⳕ#d>;yzWͶ]~b^@,e+ .΋GpSQϗ?㪃Zk6;*3 յ>V9"a+"! x#x¸<g#\%d ~ `F0$rd>?xi׿Tÿ^s|d0e9囨SP]iFbu%)bkGnb^# pO F1`xcs{Wm3U9^/ kΘ3r5_|;G'$)Q)xg Cq%xa?X^[{Ad&  +Ç.D?*6g$xaw0`_%-'DBp䔤d!"[?K?7?Ug'l8jt{ֆ,,t*ݻ1(aG܎d@|h 4i:t?Q&rXɶ?rtU=tm,΄Ɲǡ5 /Ż~?8x 2۩H\dK$  ϿGWع,%Z,6Wn?@??ru% e˙sbӣXnʜ][}vdnpqŨ,1q{_bridiFEf5=FH}Cv;9A(ez(tc|KuZUágI%InܼIIAS/ϼPC5OFUUPR`<黰|j;];Oxxod2"3eZ*{XCHۅ6_֞DJX;xxOo] #Ñ[0FEA  8~8ΜyxF}4b 2?!4 zʟ|dFKs'_Xϯ_n}' ?3,>G&2ɇO?S;YN4R|hXQ\#AEwdux >̀uou_m^u`DxS*pI{>pNޙe,P"!CfH&A#{\SϿm~W-t_ 9&`stBnw-v'Y@UYFl 0ky􁺳;ɪy=ƒ;~~3N3cq=81PuQFsC3k`$0<kr@~5:)$kpǠC`N>:0S‘e.v7j~26HMœǰ6>"F3? }/["EACBCDH I xQP@7^WW>/ߴ6v<)t5![Uioj=ۃND`$P,`1DR: eMln_-W6zN=82_N/_݋?:@1uA#,LpIg}# fy +͟P~^6d鄰bD0m%3sO ŔcҐ>Oy@KVuYĵbHZWb)6 mtA"GHWx:u fyܧ0P"-RvP([FĩWg_B/fw7[:!l,oV{g#+b! mr]3Zn|܏AOK. A@&ye`@B5|[t 鯝FU $(3$|I:x Y(<+J/7͟Xv/'oHg-aك!Bé`!,oZڿz>u@GAQ8=J܈1"0b1āSؑc<"+xd|?1ȃ4y/Oe A>7yHq1p%B-ۋs#69?kЍ ac8,PwHFKTE\#˝AE}8}4!'%B]$Oz943ٻ۟67U]t\x6Lbz6&wjysP THkhrpx9[4vq[S@bR_ &iуz#!B3/.| #6kPI,}D R, }?ߖz"zqm>*,S h,>B!kӁd[z]4:We=,d/ ^fZ{Knr-E8)##{$0/}K~9FWyM|հ`"4&`hnU s?ۿؼ/?"a f@"ח8ė_E|~9GOUW <@ib-q#Z4Pr!t,-s7;N͜s0".%^!Ko$ڋS'_Ļ{{nN> *,,G!;3fBBNC"q>V?+?/&>ω(Le7X]VFJ8i=YnjawJөzog3;="A|TL$(xGگ007f$$wnC0sRg 9[} <>{|^?l?u*09Iѻ̔)פF `֢V?{۶:iv*3QOabޕ>e!iszjN<'^{s=5Ǟ=PD>( Q's"ŞՃs/a'd;M|=̔Y:Z;04Р 7ئ@[yYȎ^>ڬʡzZ'RNT |AY"4 N$p?Cp?@W^}ٿ^+'. ; gr7rӚ@,EkGwYtTqf(.͵ؑK76,#u]|\! LU1x,gcȲ0#H`M=QfElKx*˷so'Oy垝Y ,D0mDdj@s>./-ŵjzh5  "%pi0B!_BaLB$2ϐeŁC.gW^?/aT^l,C чs?dd(4l@OaыmAk~BRpxUw) F IW WȌR3˻BzIʟWE$߻z`pů߶:o`}R)|'(#.!>T#;M[5(X!lYK(7r0|Xj!EPi]#`mPc/Ǚ_J Ae7BH.E=g_8{{?_2o.וkO.Sy<&w,Sf ZAfE{Rӆ;Mέ,.d7*՝? p'4)qDwqg0޾rw2+R!4@a*>5o83A!-P4E|op&;D;w73ʎ@,2+pZ@qxvkr{= Px$)S@`N3KqQqSxO /  2B (F! 3DFlie_+''#g:q6wU~?3yX߸lo{0!s5_ssm 506`0%72C5kDF-SGv!(BdL$ L0̫a(\y|㏗?We]`w|:N,ۈAgEڋ 7:YPnX/5)pœxO|*/&qD >Q/},BȊ#G/~k?}S:Z~:gn`! 175lP9߰%nwqeWjf MIx:@'!/??cß* ̛x $x5 ף ܀`67sGOn[^?[w(,ɝɽw({;_ 6LL,/ޗ>Fլ7\l(HkccN0!d$tB3dܱx+a7IHChȊFQ:ubWV?PnL|RF&8 !5r.>|;߸ 8ȚG4ruЯŃWBȚfhVhXXMG0dfz+9h}a*wl " `0&d0Wh}hF>71ђU,l^18(_E>TWSp"_zZd@D0s6l/Ӵ`ZBdDoocP}y/2x =}7@nh4SG}֯L ,(훆w!d&R__ck>:jW衽{рWe4 n(EܩQ+ w0S2!$,m)|$$}3WNߔι/^H?) Kϑn;dRn{x4kM 1! &BkpA[Ϭ]k\` SdtS3}6b`^xs·V[,BTG#/gf͹Vx$UX߯ ݏL#%WL'q*Zs// u*P֠;iDp!|4!q|`[؃"3!h !?pbӔd-܁Mݱ<])zlv?| >Lnq?2'"rTAAi5B'`ە6R:_-&0E{^"Hbs'V?yӈ?Yt)LXJi5XM=YӯmlpxgNWFډQ ,##Q8ȍr WrLd!| Im?`eY~ g߁.1LY?GD5`ؽfs/].~WH0z~ck )uc oaߖQRU"-0~:-,,5>¡gפw5 `{?vO[ ؀lO8 +ŋ^~pk^4 RGa( ,3#$fq#O4vFD0;xAB91D'hh,,? T #=t+L]"K`%~xn<N3m&  --,@(bA1  \g[_ƕQEvGd&O k%ȗ0JB냗_<Є }>|g/2W;r;glܛQucD=zXx`r[( " 'QkT( 0N!x;tKpi0RH0o&0u0+F~Ň_J!{gʿNÖɮ@[G0<ŕ(F9{NXXᓵ#`%?Z*E |7HC[YοhdO|>y~fP>Kݢ:WW76su/ǨZ3deIi! |Nnj`b! s8Ev+'xq'nvߑ̼L܏ i,W#mQ@QhxC{$€@Nb`JPIM M!z><)FNS$f` , g-Wg?:T;k͕w&OF@c2g @p~ 7y ;gpnxR&n d -A_>FҤ 77o75E{/6&i ~@"Hپs>W8E챹)μ zd[΀P$8h /?rr[D 9]kXpCv18&.R YMiW} MiB$C`j>CBhL?f{>쳭0&"`se\L,B Xvl`5y&;jX Y!!CJFT`=u:f<\4fR|iB@#$ҞK7^h >zvzBqaoˉ[ Z;Avigu6. &H0n5mU?xv5B 9S3!Ti  [0,dyvzkOko.MH#eekEΖ`y8վp|r{>H 9X 9&@1 MѮ  #ũD^ F$1bHo1wCB6Wå\/ cM@F0BISSA2Y]vuȚSLe˾ d LEYiM-E6C@RH8sDU@ R0TiJ1\V6Z-KhgL&1W ` y>osdVL|i@+D#bb!8gQX T`$RѻN L3fػ7ecd<2JL+Ax;-Vha6Vع&B,a)Se߁WCHT JLA:>!;,nêw5 g)3`4B>vlڅGJK$zI1BW@`5$Mz̼x(&hz{A$YI |`vd&-f@L!h/;0ڭufO A-bHBX5  ̗ !PEhn0sZQJR{Ȉ3LUv>qM,Fptn jd"r *T~MbF*>d.ZYB6E,`&OܱѤƒ;:A@ 9|6!5?Gmf@,u! !;@jUR 3TY3s MãL dd3?ܡh,1l'"2l.5Bmk Ox0LZAL EC 1X0IHDcfc8gfS`4x&O̢#iL)0q#0)qi[Z98=DFL h0TRKA~ w"f;f2;SvL*`|.[f{21*א`A"0_Jt@%hCd!)x_ ,&3d1) N2  enc/ ä@Z%j0"kpbP0APcP_,3\^\,Xd$B5-7 XXPoP6ੑY T'o6hN x^ҀWx}LfDMU&ocwՓF/;J3Lإvh#C@sXk&m 8m ܙP LnSm7$柘Yl{vyxzFLfSx]DuT*|-0z?fEd7KQ.ꬠNۉnhN_ M_<d&Stb7b6]3dm0#J=nXnc֚LM`;$_ l.u 2~AY,#h6u(033I-;fijGBöoluf S>l69(0+Ap',=~1]| Lf 霚:p;HwA{ LD)7G]?E'i(ӿI667˭2ߴ|Ah/tg2$^N711tܓ_f36ө>zzy#ҾݭlpL}?iYd2d&OP/%hԁ @z`R5P3$?J `E@ +@@a=Q{zU6Lz,l`B$afT E@SI ?U$jgϏQ+pD_H`)DK P@AeYcMOB ;%7)af %l&Б$Ca]vq @k$x15kҍ0tb_\',#FqGȲksb˄]3ydN`~m$\\݊`$Fk A!WD_#%|2Q0+ڱ0۳lnZ5qfF`&OHR`BV0*:VjUATA!%P# ьуKO1nmF=&xS$pGl F/ibJBATʳO @B$T/&*ʈhp`_3XUq* u`;}ŒIF <BBBgB. ݨ, * %IT$d! @oM1^/7y5ƝVwl"@X۞P`^.lCR_6Aa#-$W  xO5%,2 FUffa?^)\eVwA$마)#0 <2TP YлjS˛+^V~;a RH5Qֵ=) #(f:$-QAĢwRPP{Nuq1@{mwO@Kn;0z6όLHB6 'K8t[d=SUs"7qQb)S{iVD@Q3IԢ P%MS$z!p~WNᖫczF$k3L@ Yc tzdMtwcCbQy0'i4 &޽$LihͨjPjԢ]^Ehw ] ,4GDkRl(@ [淮oVdKp$yh'\`=$$TVTO4&yhPSի76z7*d15E& t4ܵ1!6okwuѣpvLa>S-5ډWxc{8L 4IdVV0dTZL-R`/!0ʁ^,]nNi$ž=[L+䶅P2^%y[줾b4=0@+U``Zy,J@z!SYN~1[.cTO) NZ 3/"="`{@IP=`FbJÍj?,]1$¬t [-9X,gr&X,@{ ͽ`c,rL~mϓG!(2Z+%)+lxt;ֆAT P D6 `GI0 JB p?6Xk%pWEeb)ħL ZEZQ%Fboἆ4;NDv3N`(Rxl,' N`ugdit{De^6@fm|q F `"%4bPQSj@QKtV7+}.^cȧL.n{ M (ƞ\b!ONPul2s׵LJ{| 6L(j-"L8(B C)03D-*JU7Hi@5W7e>Yߜi7s]c`ş}D) Ŷ$ B$,N?C(ZQŲ¸üS  >4 Ne C:(@b T4@5*rRlcZ\88 Ad.@ ,+[atcd,Oƴ3@#|A@- oa*&tBo3A@U<0XGCT.pF7vh8TpHE }rzOB] 0eD0+6vzU5[S&AffSHԩa# DbhzugR>&Ϝ+f`T3jt$`B"-sivc{/S= (4Nf퉴ɽM7VxeUJ~$ Y_%OTX,a(m\L ăt3-UzT i$-:3"" UYuV8xYkFe'<~B1I &M>z4ă{Oǟxb[y4mIаuxjr9Q_Qل[q/E5(4(T}FK#rXB̛ZT6 (hx˥!7 kBZ[TiZQcPŎu ,_3C_1܌)'FſnL@N0i3_JhG j QGDTfZݸq7$@LVn%!3E19+@.'Y؉C`ədp [[)G Z P\tO>l]?PqGьtP*UM,GQ{K<Ͼbqz6kU&{5v>(`9%pf>PܘN*Sz*H?aMX5gmWخ !`6fC@#~zrOJ QQ5 Ț,ƪ]Z8=X\)GO(>eV,RO X->;ak?T͍篯wbI140xAvY?ήǴk(#̧~58UB#azmUݭW > 6l^І[)7+} 47{,qJ̀ZTP},=>-$[;y7Wۗzn(@ifoqj 7W^q_摿itreh]Dq8 ߻ػv,``b!u!/?!Cw.6Uow*ea`f A6B<75yBd &r TCPz10&+PE^NqDK-`1S-A>! x>ϥ:A8b|1ޛLk.lbIՅ O>Иl# nnnL{dR|  ]foM@,a}SrT)lt!Yu?;׿pAܚ{tPW1πG y$Ҁ8%^+'a{El,$ģT{oevu`rK^w/ a!`4Oԗ~jHx5Qi U#YYMM\+[?kZcd3XEۅSn PǬK!لүxa/ky)ۣ&7wT]?޷=ovYCCK1hz% 3ny5-Wf^V0:A鯲xh8 YzmAwو:yB'P/Ų +dG%{}|:X#H(K2.޿{Ŧi˗o]+e9poAnz4?t H}_L3N""}iX5V_~/_d-]>j[[80k;aec, d- nsCëEo<$1D $h4ww`k[x^1(=򉔤O,$Ċo f4 7(\V2UFT0V *~okž~zy7PB4ҺBX2tCI! N|ŴS.yK{j4f~]Z}];L<7%dyM#b +~y.Rg| ggI_ѐ69wx$ r`ck?v?vv퀕_T` Æb9' ]Z>۔I9`PB4^H9i -uiF+Keߵ]?=ϚY<޿rf) %?ot[2T ~@ ^0[nJcOvu/]xVP嫛?zG+L֔%5XΉ&.'׶}faI2 k ߘ`Z̞K{޿zmmXM(( Dnq ߣZ(蛃7`jj U_RAa"`eԏmdctS>Ǽ I4MlH7fU^?)\ ܿsy.`ھs ƌPSXLx fsRWlˇ~QtGUfV֮ڽV5?8~杏W0qֳU] ^wTbpIR z@BHɰ`>-صW"Kq@.GI4Z-qm~`(&n«޾/\vҪ G >4U|߽Ƨp:9r *PzGJU`Wq#@226>T`V*Ӝ >'E7weob(+oazY 7'~7`S;6vLkQ[jT gi, VnmGg~d Ph.G6^,Cؾ:w/&6.Ys_||VA?н|@`AAK?Ĵsw;L̙w/t8HP@@xI@RSQJmHHK 1 h 6S`S]jfL6ˆo:AXg~Wr0  g` Fğu^ރ7|S!!$!$Akkx@jȭ=`ϴ7Nr@$AġY=`WyJ;_$l&}ƅk\4]д}b🯿vlen{:0s$_g@ ;O>l=Д!'Z/ a J6~r_?g} TTIx"w=2L6Xu.b:-_fg7;6}ʏd )9Cw.p2h{S`HS%:ʄR`ND1*{p{l|/'0P}X$Gu$9n; ɃXLm̌Lj&~ㅷҥ7 S?wzt:[f6׹D~̿:nbTpWʟK%X L})Q "fZ-^`82R0`y{O={9V}Ynfkgܾܞ h6wQ~bag6;j:@0YL##? vΜy_8EB )A B>A!yT$ 1FnuU/?q|>T](!U]04ȼ=zj?]oFFO۾""h6;>!Oχ]ֻrիr؅%ЩA?f.{鿺f}[pkx=Sǡ-EP<+0H0bHنn.rg%.ϓd/Y*0ە[]$$h6wx_7Φa6~Ţ7^ /ﮟ[pT_!!?&_6ب闰w;8|2"G*z0[QWEgie_uhnPKP,R`L *FH13ܝ4 4F#cG6&/G9 믾߉oloj_;9B KC wW{Fs ,BD%q3'rae׷u۷uhuX7̨Bt Lh`m)Smfyj%tVuL瞍?}+WEF/O }o bqF~{r 'ѵ2J D7´^d"`/bf Ym,-e(7 IT=/:^N寑~wSw03|ܷ9ӳ/_a`dca==SJ* 3:0r?p 3C'Fb TB176a]_Fz!X8̝4|z!( N7v>u>nK1b}Go|x)]!M4KvOKz ;c' @/Jj]USq 'Ic5 KG, 5t}q0a@:M,ɝ +?̇նכE]o|fƹnws ;$;ɪq`D ZIvn:9"]_=5gϞwKG{fУHGB;!c9pX~{x. 0ZMLnKjYhh*u.¶MS{|:+?7omoKHRT`}pS1 =cC:bX.R{Ǥ櫮PҢLV #>@+o!ΌL>AE1"T\n}d^lmS;6t\c^]woMND%w|xg`J 9QGO' 0jDӉ7`\Lnj0m[DV+X4O׻-W2n|vK/UU*1ߎ'/nEejoпuA5LCZ(ƺ(8|&#k60Ո^xe웋 A3p-ǮF umv43l 3.Y"t%^ʱUV͟ퟝxzY]]NӰпllH{ [nv>^zY* [k&0'!t=W]}xXffZ:h2!^`spfN !h" 0Qߺ9ֶ8q|}|zYHvII0_$0G@ZGF#<96 GPGfsʶ<]?3u=i-/hU^9:_6 n0a:>G/$F1b!޶x$34huFyXBz*Ozo,W0KJ񵮥߄ ? hsLh]x睳8 HH)'+LfwX]ػPi$vD(;8ciۊYw=g?Kk,|@벿#a?l|QQS=~֭oH`ZFfg0]ٻ {vPb'80ᡪ dm2ŝ ֒ SZ|64yPugws'W_,셫jN?L={H>F#R/| < _Etf#; ֿԈ`MtaƪVwxޕEP|BZ7>Q <e͢ FzԝTa|ͅ?x.ɮ9gDF7Ci"[~L$CL`Xw 9Np^^Ha94%`ȠF&ous=WY}szЍSF@Kpd wMS` <5F ~s4"DwA3N~[ycg}|Z9 ?W~:i/'C6;gLh̙38u$w@ iԜ' .Vj^yjoNdհ8?*pËY{$! iƶE+!4 yv_KX9n@1o֗7~QWqG5jV_gW8= /ߎ?3of)7%6Z"ۄ#p6>b۫V6nR$:u (;.К ;h( <@q8;|i?oԭ_wBSJ`**Ex&ks n8rdyP4H?Qot Cm5VKk\84\8 -bBo$%hh EeQdȳm"_m|[0Sj8m{իeY&~ 'U*# Ҽ16 oC9c|x38IW"|0h-2Ɇlce0礩T;Nq\>\fIġo"֡d40$-r <""(" 8m7:S!?`ܬ}Hχ]c?7;golXu !$;:A}w^C1} {4Q.㎀ z8m S^w:Cׯ3WbWt|0N -@r24whЏp|[y8ulzNƩ=|ɘ>*շxIlL-bPC9ؕ{I\n/-MC tphqhj"fiRe{q\16Ƣ/qso~=ѵnt-|̒[ *U/߇| 3Ĉ7޺}~R8s N>%JFJҡ4hL:JAmTP'S+Үoll,^CJSsС$l80@ 0Y;f F!!xR+~y}Igj o׋o͵W__7}|`+[Ǧ~G~>H=o{]G8q,JS ?a$i1p *i:ejNhyc+|ceL 6XCu M fF d2Vѷul<&i- ?w\~m=8'dgDUSzHa?4|>Nݩ<ξ}^8KUڝ ja$5L! -A/ō塏ۋm,Aq6Pu=-1x(0eF e C=~ Lnte懆v00i֫o}v[돖wX9uΟ<JEjN)u@0oOHo}/p!Tx BƜJn)FAgAVhÛDw IFӅn1&83J Əq!6?4] 8r_uAjžT>v 9hnQMks7o}R~3N 1)L}>}f0 H"U螾uַZs$s<Siw /|)̇ XOiPrEUEJ Hnn٭k٫J-#@/B)SD䨠%cK9CXU+ |?z޸(DǞL!,x~wx?~;֭[{=kIDAT/=?q(,xǏt7,:YߞZN{?=6v db.|2NĨS.119Z+)ͦ7{vxYPciJ!4)gMǾ2VВiFx`5\CyoB*dm^!Xb?OW_|ë7Ã~b/1!̕d1 >|b^ iJ2Z@rKI &^:zU**, 1:8G R^x_ӻʀ(IqWB^_ fMq~p8v󉼋/vsr)Oa.'H[򫰂0k ! S1QI)u<f 7?j/|ǫKKMlH AA= ~;E"w!9Z"ub6h}<;kބ`@WԎOO #}׬)\7nG7wa0׷C ZANALNj#3Ts ?ͽ>A_Lby啟 %K@Y3 h kYQdM44(k h 5fքmlY}~I?+3b9~Up 6j145=9d I\妆sq {M*95R7auDozqt>nٝ}k|$m33SSASxˮo'ffgm=NB%&$#6x7޸7]}w.^?`>LBFg 3j5B#1p$18@l@4$GgV~_\3݇mvVwp2XK[ 6̴Y\A}Ff]1Ri-LenkPq5\(;zEyNRuC=e{_*{fՍ{}7;4gşg JBlaj!)EE^ )&e n4pʏks,LiN4gm kFTc`#_F FE Ij@Guӌl]'/>r3z>L?k4 @sj 7x:**ã͛1~@];b<ԯWG-{v/|n|ӛ{a7ogC$)k^M ͔>E "IJ3I2Ȁ7_}_G[?AV6Xj` ,B=F cI5O.m&il'ٵvƀzԫjI_!e s~ca~7Ja$6khùs>O|?~k{s qp b `&/([QcL^syB%,S]4\o)xFH!xc 5 D f a!5(&TuӬo|^Zꅥ*ۛAw7? %^eZe_nJv\q + MJqx(mX-Cz6ONΟW~ɍ1o)~UnOyIl?Wz(<.WQ`HT}{K+?F"PGkYY;bnsD @-&P=_h@߂c]huVן,=񣭝?x;gtmvh A*e"<#;5*}crL?݃9ѻP||ە+[|zO>wv6ikSJY{oyB b&{_j!9¯!jy֧U1Ӌ?EA3t)~d$ >@2H(U5@EjP҅B Xu3Znn]cٗyq>^r^u;@cp9s0lQ U6` F@/xQOzT\SWx)J _X?7ͿK:nzշ?kcsxp8kg6Ʈؙ_9\Y1 9Z($ ʡ +ogiǷ!(?4B 4#`  AI@-G3e#14 PT\BVG6VVXzikwn=]{r9mN0G|9O*{,,-#LVϽ+9 JͰ@X:^g{7έdrvatCa&`}sAWGEAI)7I?!qy \e(e <:a dz[I0\T "QC}4^JtC@ Ԏ'u]7hi9-;ϭzz+|lU7qaw`ck;v@A֎9^vڽ;9hy7I[(>;hK>u+zo )|we5E.]zaiIg.D2P"`EiA1u ?HVUTKf}musvv빵'xb;M\c0)4@O9[U-Ajk4ٞ΍?n}۽?ޫw>xw?L&mX(}˞~qx Ǖ?\@ qG%5L*$%'Ӌ}"`JJtmWrZLߨ\x }`hţ$ C &)HH3`ʞ kH5pQ~\W*U-k+K3룕 yau|c֦:jUk+,R@x-={?G|&1ЦVd)>b}r+ݽ>ۼu`spmn'dumcJ1+(;y\^~D a.2?ORX[Z5]Yf0LQ(cޫ4 *D TScS[6Ld?N}l6``J)u]v6OK{3e/G`ʊE^.({xO t/T:>%7~ʃd$3/wr"݀(D"TWV%r r'Pɣ)TPeCPcՑc!L4̖QSW@$jkcyemj)Ⱥ L$3(TSdfOSΫv{<Nf$* mn2t)Lv32$2їd4u`A=#E;d4?o(R1=Zu5p^A @yF2\艁 E,PDC^\zlr$#H\[)iΞ$-Tu eBIÙ#KA 2y[4ga&d‘#1|?rqn/# ';x^RP% x{_VjPʕH2SŽ(`eXO%FZ&&#hvcP</3FeBa&wؓ9yHpBHs)2FVK2zeNFA@@̠=BbgB4Aܗ$o*P\rTh!R 1d"ѣLl(5+TgsJ< ._6B tųg'.FpEs2?f|\BƇ W)U ":q<28'$2^IydP>m049:, `h @0e9z OXQUO/ G'6W }cxQFd"k\p?yJYk=y#p? hH2lp볐lL'<LJ }cuBQ ޝ`Q0]s0rizr!ZI_Uwӟ) G.dD 4ȟɐ_G#%/6.;b} ˸\:7ft}a A,c{zo D6 $0䐾t. yZPEDqTߗ=}ͼRWҾ'YP:B#B)ąO*~<3,%$h6r%LRr 1CD V衸W s@ G=9#2vOFaepd7"~^F@ǚ Ȋ# Wք^]17L{$g+#FAA<2\tB(ط`!pAʨ\fL;st yAuϑ~[? BJ.?L/F7mF/@^VY &GGsKo(9"Doލgƽiw|Mg&b))Vc}iiCJzU(Mb~x$a9e xC*~6Kw/K୲( չ O8IA2)uȝ !g/.;PD+ciGe,"xH113"x̟D'fj~NQxg"m٧L(ZL#sAϝE} ob&D钸P yBRemc^g; t'R'6VAQhx~`=Ϯ%`ԭ`6:B廋e}wY{ "9T`"GYE&!\k򚃘s}90\ eμ8ALnR2W|+O N@!Z@oR? :ߦ<2gyW  a>a8'A7 &wXCejF[YR/c C}}1L奫SYp>UTBv*y'nY& 2,!צ="ҟ!xh+ LFA0rn 0x@ɱHy  rz򔛾p@Q? |8R pB!vcIsdt-, Ɯ{! =+W.f@4@9-(e U K@ ' ;O$֠p"-]J}Tx <9@8QLH1!@etobHD o(W2t钫Wp/*ak $BtA4Ȅ=tͫk[tw>/W0<2S%e0#7E@\ڠ9` <7xRۃ tۿ ȼ`&SjD2#Ri PX%tEXtdate:create2010-01-11T09:43:43-07:00%tEXtdate:modify2010-01-11T09:43:43-07:00_0S2tEXtLicensehttp://en.wikipedia.org/wiki/Public_domain?tEXtSourceWPCliparta$tEXtSource_URLhttp://www.wpclipart.com/4IENDB`armory-0.92.3/PublicKeys/0000755000000000000000000000000012414772654013702 5ustar rootrootarmory-0.92.3/PublicKeys/ReinerPersonal.asc0000644000000000000000000000326312414772654017326 0ustar rootroot-----BEGIN PGP PUBLIC KEY BLOCK----- Version: GnuPG v1.4.10 (GNU/Linux) mQGiBEaXbMERBACTkLa0pQdp1SuOi2gxneJyR20Kc0nyAF3IPJEHPuT5rrbWCIQV o9Fial5AFWdWoYb8ryvKWL4If9eSrgC7PPtVF+0jDxRfsmmKOt3KcvBzDtWB5QAd GAAEb88yEY9xpB5LmD84vcPErFXjRdqSd0W7p8hf3j8b/hAyxiEt/KgIgwCgssnt dj2682c4shDXDKUc1jZntnkD/36OIaShAKWlqvHE6cWWa+i5e9r3fFYKCKBXDKWz cfNWjuk0zD0BZdeYvvbmtAE2W9YhMXbgJ++rzCr92hAU1yrdbC5rkSjJ8Hyu5OLd EzcZySzVr0w4KdcQR1lJvafbvHz84IxmlNhmXdjry6dWuYVfPUnmG7QBU6f4cidf BE9kBACJH7v/nPbb+Y8tI3uANlCK8Mr828SbhdZgTv1GHWHbTGNMR248+4CY7H/N wT6KUbfkGiJNAY1kBcErIiLl23b2JBUovq+YQoxJvVAVytM+icECxwhDMB3BnMFi xEZ2hQP+oyU934t+kQdpHMV6RRz8wSHJudY1URL2su0KLnFTbbQ5QWxhbiBDLiBS ZWluZXIgKFBlcnNvbmFsIEdQRyBLZXkpIDxhbGFuLnJlaW5lckBnbWFpbC5jb20+ iGAEExECACAFAkaXbMECGyMGCwkIBwMCBBUCCAMEFgIDAQIeAQIXgAAKCRBh0chb lEoq/ZvoAJ9RyvocNVrz7dWVbdk+nwdhL8/DZACgma64OsRN0As+bQZ+KUnByFfG V6a5Ag0ERpds1hAIAMe4U2JHCwTUnbnRWOTRMTDnW/Wj1iz4UvlzL5SgyeDXaqHZ j4NkuPMdeqLM82dzUGSTSffkV0zpdgb1jlIg2qx+Z14UHDRNNV3A8927jv7i8lYo UX6R0LyDrAg7kDlDT6EQg8jcMYfANcpuN1iItXP01jBoSLVHPbOEh12+CaHVEEgn /pwpfkf6AXC4ysc4GXqM3PURw2YCZ4jHiMBy7/t9GwHY9wYqEvQ/OEKyx7tdn8/E ni5y9Jo2CyCBhjHQPy1opp8l7TjAJ2wjeUoC9SbybQ1CncVoKOecVHzjV+0NP0QV V7YNWESLnp+b3L3S61G3zbrgss4Hb/HjH+R7ZbcABA0H+gOkZettA+M0i6UgyXkY VXUnz9gKPNHK+/GTymTUuZlqkIr004WTDw8+Q348/SA1E2Yo/J+byh5ipPYT1Fig 1nCrvKgYdWXDFnedA1WnbWWuveohG314XhRkTQOSlZCJP3QKo67Zh+oJTk4EJNjW Nz4FWf9UXFBms2Bh/ywMO+wbBtgy5JkQ4hONlQo5lQhjhxinTgFR4rjlEqpxk9DK m6mdOlXlypAfWe+r28yg15jgqANV2drV3kp0jHCv65r3CI2RyKDXdZvSUi+xjXc9 zCsRkherdneTCvztedzGJ3R+gNgXGK22D93evk6Z6/h+zOtYCQXqX4QfsPMY0cRS oYOISQQYEQIACQUCRpds1gIbDAAKCRBh0chblEoq/f1HAJ9b6SBdROrwCRRUXgmU B6/kNRquywCfadcqJ5hz5D7wQdUUZS4bznW+8JE= =1TvC -----END PGP PUBLIC KEY BLOCK----- armory-0.92.3/PublicKeys/AndresenPersonal.asc0000644000000000000000000001405212414772654017637 0ustar rootroot-----BEGIN PGP PUBLIC KEY BLOCK----- Version: SKS 1.1.0 mQGiBEy8srURBADlAamWM3TkgAKyVBVftUsg5aZ3zOA5UAlg+yI/6bzfTkYLtspALQ6typam ac9re+lqnWdDMa4qVwSmaOMxLOlGhCWWfmA38QprU+ZfuesnxWrVAMG8TDHLT2vBCa+9iC50 soo/imsDqqe6ujm7a+Pd1KSNvFR5KXgEgeEHSiyEqwCg3iAaDH3lNWzNOgJgi8PUiszqbcsD /2mfNBYJsazYabXcbNdh8VheNnyK2KLUE8Lg1WzUld/Sd1gu67oPSFfTiFZ5OBjdHI/XmlFA T4r4eNy1IIf0nELJWWQ6hlzm0a0/DO4bBUoapjUjAYWDyeeeALDHK7EQboqtwWBlRONyY/+y B9usgbvAK2khRlzBhQonGJEsFpdQA/9bQzVgpEE1q/ZSnvLp0nOFA3E51SS9uvGGnAdQMjwD p7iGBzh7gRz4ko1kLG3Sa5fNe21VvlKFcMTaZN9Pd5fDd7gEoDkjUDlf9lRX+YT5zf+SSoeC IGuNMVzsf8Z2H414dYDOJPBkhYWcqFhGhz11QtWgug5n8GaewC2YOiPU8LQoR2F2aW4gQW5k cmVzZW4gPGdhdmluYW5kcmVzZW5AZ21haWwuY29tPohGBBARAgAGBQJNu3woAAoJEJeHQGco cRHuOSgAn06gKIr9qzfZXR//q2jCtNPmB/HTAJ41UyEkArCnUwMfpkkRYsMIocKHXYhGBBAR AgAGBQJOUqO1AAoJEMWoY/xqTKoUzjsAoK+S08d+sxR16aKD2qACz+EpOo/eAJoCCVzEfCwZ qZKJjVqhJeZN4Vn91ohGBBARAgAGBQJO6m9BAAoJEGZfwR3VPpWDe0EAnAkfQPvu4ERYACtk W0Bo3lbyDtz8AKCLTP0bV7IjGJ+qRR1aSQ6cBYKUXohGBBIRAgAGBQJOiSVKAAoJEOf5OL7J VZSy41EAn09re5+8CBNFfx/GSE7siG+P2DMZAJ4uLiV16vTjKDjlW3VKRIMdBTgOqohmBBMR AgAmBQJMvLK1AhsDBQku/geABgsJCAcDAgQVAggDBBYCAwECHgECF4AACgkQdYgkL74406h8 rwCgyMwSbwfJ+t3B2IRbhnDIsLo4UtAAnRqMmznLBNLe97fbWYjkcgiAkr2UiQEcBBABAgAG BQJOGL1xAAoJEHNq4Lhm3vtS8MEIAI0wdw9FpjQWQ1k98+Z8gLs3HFB/b1sVH7wgeLqpY+5k 8t//wCZBusQOUnzADqZsCdapqx1xdlECfcX8LL4SmM/rwfxBye0wGTLk7ebZbNmA1uE+jGfX m0g7UZbL1S49+N1Eexh06eW4h49mv9XGaaoMt1+JzMyPcnF9/cGnKVN9+ltczzWwYaGyRe8d DdGzJ+CQNIqLpCNqBMkcY5ROdVJgfg2XrupqCrrf7IMcfzqtINPTwYdOQrUEv3H1CpOKTFe4 1kTfoioTuqMUQ1cLsJoEzV8tBSi+eTQ8q86s73JCCS4S7mzaV9woh8R0Pkimbpe4SpoOD5Ba d1Y7np9NUv2JARwEEAECAAYFAk7qbCwACgkQdIELASNGyabnkAgAnGecQXTwy7HU4fo1nu61 grtNk1MUSSYCk3Aq/Zg4jRTKs3TMw8HMu8x8CLBXMNv9ZxFgzkL/SUDh9WxLONA62M+iTxm+ SgOsXyVlgNM5+Ez2WZLUtaQfJpaR9R0IVLpiBrW6cLb6KOcOInvh8hhbYNJk5NFFlmbHHkNd 4C28QYtPuHRK3nPzIQ8SNtiLEqzrvT+0C256bFJOvFlIy/TMj0YpBzNq2pf/PqGrZGxP84ZS EWKNU/foyC27M9Bx8coWX3YdOIM5KRHpH3yqYcklxvL/+vXCLyzWDUHcnp3Pqg/nWHkhQNhJ nLdNcpELjMP/axy6WNxrWs1QddLYhi1nb4kBIAQQAQgACgUCTq9S4QMFAXgACgkQqdCZPgQU M2LT7Af/ZxRy+/w6Iqac/VlyGxIV8wyv03dAHsKvI4LZoCuOFtopeky4tHjp3zPaI7o6goVE bK1l1Z9uKc7T57dbnOEwlyF+bImkfBMgecCjiA51ru2sGluzqJyQPF2vG/pMH/m8pcoATYhD LyM51EQ7P/3d1q2GCi1PCHZschc2sfOoz6bS2Xmx0IahKO1m5Im+rX3M2RmJ0cAgaqhwtalX iHEd7sYfbNlu3AL9g2sRsXQOgV8fgrDS9UlBHrOtgEnzl7OpnRkbq90F99fHm8aYryUwUg1M GXHFHV1CjKmXHBMJXLi9uul4xj/UPy0i/WIFCvtPgoi7YV/dVT57JSsA4UD3dIkCHAQQAQIA BgUCTeFcygAKCRAa4dNQQ+COVDJCEADIIcTkaEqQXKNIvLgIdjloMZzzJLCk6wZac69W2imf lNwdkFjikulbzGbZ28w67FmsniksYnQPdI3fKL4u+I4jORr4bEW/JY/ZfoZ06JsmJCGnkfUt kOzGLXlBtx1KDcQ3GVex8gNicS2sP8Kn49JsrrjNL9RC0un41ufjoMJ16quO+DurpELRyWzl qPUyepKwmcmDPypa2VI/Yl5fO36AG0U9ICZl1dQlWR+4qvHH2ivlSbdXw5e+jhRsfZEYDM9F MYXbEI9OWiUNhcNzSpJ51Y0bSlraxbhDo/ctHl/9O5T5L1tZO7fGYHgzt4OSxpjH6LBpocyD 77zKvcHZsOLgvVKiJ4T8sTkMEv0vnAqh9OBgVPRefcjyIx8nIyWL66M9hi/FiK0jwkNgpWef 05KSfTHeXKNHl0+Fl8UtE6/VZ+BdeI7Zc37oAmbxX8Rl/1Ou/ko5cJVCrIjVwwB8M+NvxJsP LZ/FSJVPZGy2+epwcl0PZANcI7/oCwoS9VCJhTiOZAUnnP3rKkmfNcu+ODX4HM+bSCKWQvZP ivAn4LrzNyZnLjHeeZrOEbPt6WkvIXmQORUaYHEV/eFYJWc54S7mKS+xXOVEOmRyCK/szfB0 yec37yeF8Ddn0llk8TJ1gxrwOSizxu5ugbKmJuwnbX/O9QGqByA91tC57fBDocEkYokCHAQQ AQIABgUCTevzkQAKCRCcxbkull1pqQ1KD/0VmN/S6yHnHEZZeFJOnNIDOGS1p0UsB4OOLMuA 1TLjuWuOxNXKsTlyTBQyjFHxTmasC9IpUgt501HhLiXEblAZi/SL7U4hbJyP4eeDFCBJEG+P jEK2KWPWVBUubmLqdAQ093d2hgik+gzBMMEtGdXSyivIV/vgFeEXemDI7zZOBrcrtq1fDIOi liCKAYzWIZltCt/Mb5u9BY+k7Ny45Nt9olYeDDnPzerNZbqAZor4ndZMZ3feux2IzNcW8rk1 plJrP2vVeWgVt9kKCmQyY8ctcaA4B8G7T4wZC2zaryFeygVqwKswdUqvvnsSRQqimCnCkBHH zzcJuvDEcOUFZL09pwIaIH9RZKPomLJvsYhouONrpKyUYiaCtyV3t0jQTaQi8ASqkowY02XG PxbDw0hHsJHWsPjemNzi7HZoItqn9D9G8L3dbpoeWRUjk3BjgZczHA+U/esET6jZO6AZYi6c bTPLSAe5ZJFuNyQYt6MWBxtKQJaxtpOYxFayy8joY2ZSeN/1YYKF52GB59J0rjZ7vvgQd3Jb mpJLpQTabJvhIrR8WeaoWiIDYW1HUXFKEAqEPxnMMc8N3RMHnhaCz9FuZq1o/VR+3SwSdB17 Jidl9/KDjtgRiWZQHrcX18dY8LbQwf8AGyLZWrQtNhcvkUzT1/UI+YD/R3S3wo00I2oidokC HAQQAQIABgUCTxqaWQAKCRBfT0eIWSHWnFAfD/4+nlKiKalEu+FHUWBj4LUX6ffRnvwlwR4q NmBeEAjFtvVRLSO0186IgaTq2FRuyi5544HcO+1kry+YMsci0cSARQGxyoiWcOv7r0yS/O/o USZ8u8I6zKuOfgay8cSbaaszJVSirQVn5VXlcK5CeV7OYYhSOtwlbiH63DKEn6YFLNgt6ivS ushfNzfG+IScX0AnOB7Z380lfLPbleiYVsHodxY190J7O3o6h6tcevBB89euUWnqV2zwYFS3 IF65YZ5MBbEStMWpaKx4FvxEBUo3Q8bEuwesbrTtXN2JRdCrm4zlvTAZbOc9NkiONGvgFKRQ Z+zCWnywZIA5EghS/AVbaMtWlc+NIY6/bHqhesKf+V0VvwPheKtTotwrhgH0uKMgY10zqCiY 87EhURDuOcWi4mjRsFWwW1xAo+UXxrolClOWyu4CKN47+5gcX2iCkE0/Wm7zyegxL7yaHWpd zHI/wNLeZjThLMyfjDlbGaL3uLego+Wt4zdDAhYCIP0aXIWmL0RkEcD1kilk3vmgDg47EdEf TUxhyySiOGmAi9+pjd/hl4IiRLjVoNbxjuGUVy+xccUiagevqmH9ldwcv/JLj5C3mATNGvtQ 1q+j/iNIXXHMCboSvNf8olAMUpC5Lvvnd1DZMEVyTJU4/lcyimCNs7f3TXKlZ7J/GrxhiOP5 IIkCHAQRAQIABgUCT/1mhgAKCRDaY7QG7+f7GN8pEADHqvQj+znqUajk+NxDFdkQJ56Wcfvv W/Bn7MgZYkjf0G6mGGy1HDnVzF+eW9j4DIxQwRi2YScC4O67rEXwtnjxxmH1JSqm7xAlTiim WO+qr3oOObUMKHOC4Kj0J8vxaC5ink1KUfrMrBbHfOAayDYxlK1kDnpFFAcpIWTmsZw3qn4k LCwAF6Ol7YxsjsvKw+d2XR0d8tQgcDM6s3EmcALzO37G2i6dVjRxA0xEC82slMVU3AMif6Qe oJIAoyM2YXRXJztwLLveJ9mWzEa0QEAPS6m7aj0+ZDqbIpVeYVv2Vh0ihnx4VzqE4of/qSFW jgn6F1k9muih9x+J/xMGBgh3p4QxBBQL5GswntlBHDlDkL4VIMD/fFmWOuhwbo+lDXYrbnum 0H50yc8NfdmRi66OHCSzwwZhkSsbhVAQVToVQQloPhj8ECOJxwl2+iHhyxx4bZlL8oET3Laj 4Dd7rdEKyCfkdCtGnBud98nlB92IZLLvBy6YrUrrkqgGo6Zsw2MkDysyPpndPa4lBHrPQGm/ fCStnRiVZPcY/rCPe7CTD+HAH+sa/NY59SplC2JAOCqCjRPmkSMIeFfZi66DM6dbf5cQqgAl tlXVbVFpG38e0hXWg9iRm7HpqGPuYdFLRjAN1J1yFYp3KLs/vORDoGXgy5NtJyd1uALizVw5 2Lq8brkCDQRMvLK1EAgAy3S2DxBcM/QxDB6ECA/1EhukAT/C11VgsvvOGlrEf0jD9pOwZqrY gRDgGb6vY03+P+lqGJFPvrw1IqtkHn5gp1EnzYg+03FQEDput9SoO05AkFN02WOa8yfAwKId g7zLmIVla9IK75SXBesdANv2KKX0dQTu0javOy6Bv2anWxYIozTXjwVxHwxhtE9HYF5GQCrH +r/64EGFo0oDsdY5/3B+6KaLpuMchi1QxPrFN2igVMGljldYS1B1lcIAuxcF7Pp8Vj1YrUeE YummBpRU66pfQ260IqWsmxU0bG3ZQq0hKcM+bCivxRN2kUqOfvl+n4+fdLjhDx7bvUQ7QXAn jwADBQf/f4Qs5fDlWREdn2sjk8AmrmG7f9tQ/kb0Ceu2xTDIj8RIFnMrnmZqRdmeSl3Otc/J jGvN9cFDXZJHK9gUq9hRCAK5aaMp8GBz3iss8tYYYV8Xcu7jjm4nIDzJzsfeGUbr3P8Q/CzA y20NraQGZ/kwl78BO37yMTgp6+iSlJndhqUClZxUm30vbaN6SJp2XvDi8KBaAV0NwgVYiaOb 2C1Bxx/joCLNvD1fvH3EFSU1EKZAzozYN3zxXfP2Bs2hOefjE6mnK+VaEkemlMHjKUQhRzW+ TxL/x7GOpuEOcqVyQTMFmWZQ7YjyZ502lj8AmSxaI98xBNlYFRkrqMVDA4rD0YhPBBgRAgAP BQJMvLK1AhsMBQku/geAAAoJEHWIJC++ONOoMQkAn2t1BRd9TteFCpp8riRVE4opPmAbAKC4 guQeg4TduXyUSloXb4odoUFq1w== =wYlM -----END PGP PUBLIC KEY BLOCK----- armory-0.92.3/PublicKeys/AndresenCodeSign.asc0000644000000000000000000001643712414772654017560 0ustar rootroot-----BEGIN PGP PUBLIC KEY BLOCK----- Version: SKS 1.1.0 mQINBE7qTzUBEADQKA9dQD2ZqDovaYjy+msrk4DhRPhuyJfhjJdqqVielMwFIGVaCIEt3svK Qf0aT2H3R+X+dscQ3QTP7MJB7Wv5kQeDdsrW05Y36yolYGHyFf9Ys+xlXnfTvBGhHeYkIPlu 0bfQ48rLxqGQ9ezM0k/BoYsu1KtLO//B6jopm0toafit8w+fZlEWF4zAQ4YYn4PdjFxE2Brk AjpbqM6fyK+WYNMF+kGEi/KV4Rrjo4DNf6ouVPsYdG9TXpMRweXWgugLD+zbPmdsINaooSnu k60uEdNgr4TcpkTzjJlfUUNnR5MXYRkEb7fZ+8q9IN/FOABWR10c1E6iXCXgZpyU53ldeo0L qOYlrb21ylviYCfaAT87GpFzBaAAUlSxsb0cfeXdg+6d5E9jkj1veMEIPbKWSn5gm4Bnnqr4 pzb09MgbfeEEeBl940YwFd72IoJ/fwJaanaDifs23wMestnDteHfCfTnMo9NSjtwHU+Ktq6X Wrcp28ugcqXBqLEf1GdPPBsqiJxirTJAGP8XMVzJ6GO8ximdU4a2jpDxmum5lCATu9Vs00I0 tprD+VBty000bSUi7+1uiCajY1577lhP6Je88zuki9U6YJJAYBQtdAvQKTssygoTYM0AJ4aJ H+RH+J7EDjytqN6WJbrhcKiewuFUkqb71vL23aPjwlNRqIBIWQARAQABtDtHYXZpbiBBbmRy ZXNlbiAoQ09ERSBTSUdOSU5HIEtFWSkgPGdhdmluYW5kcmVzZW5AZ21haWwuY29tPohGBBAR AgAGBQJO6m8gAAoJEGZfwR3VPpWDPPMAoIWDVzgTjyTd1alNqpPH66D5ea0KAKCFxd9JNbR+ w/UgQ6bCykK1ySmUJIhGBBARAgAGBQJO6n4HAAoJEOf5OL7JVZSybSAAnj9+owDRy29NZCht dx3d4cx6P5F8AJ0T3EqOJ66Wf0Pq6gQK0GExPr6y74hGBBARCgAGBQJO6lZbAAoJEHWIJC++ ONOoEugAniKfvmG+cJwH+EqT49rNwK4RPflVAKDdIi9HatHlL4+C4g0j1DQflB4YaYkBHAQQ AQIABgUCTuptPAAKCRB0gQsBI0bJpjSJB/9TcxBiz69C6F1duFR06yTERSFZkcKBCDvflEco QmtoLfQRBOEUkOOgM8eUW1gmh2FACdBhbnLbbEFBl28EgKneMWgReqRrCDaslHEwgXBUJomP ddCh2UrhiSwfx4OSt2U5Qte/iFyUWj115C+04o2yeijurh51RhgOQjPrLO8fWYJ133/eA616 Z8pXVmpSKKlYY8sT3vdO9u678nrloF/bS5+3vASsNi3fJ/o4pU+K7xg99tQnlL5Y8+7LUK8K sdZZ0Glkff35hHOtwdn1tB42hjC74z63ZhgweWrKOxkLMzpNqps2HigZvPv+lawRthj/kRyF Y5rSe7eVvvVJgELNiQIcBBABAgAGBQJPGpgOAAoJEF9PR4hZIdachXkQAIqtZwvpqmTTnzfD aoGV37BPDir6cp7eqITQVIXMbg0VQ7oITMVV5K3vLZs15jZfZvYRJTDJAXLK8/53ILNCAuUj ocusFIg3UPwwk/cLBxdRs87qeMe7vEtZMmQBP3qvb7/tMNLJg5pz8BDVmrs72cwaUtpLhXfQ tWirJNfjG6BXoPI4Dgmsrht6ZPKpqAHHgGQ9NYBWuwBO6HVYEQye3n3ddKR4mogUAp6rfsCc ESBmJhFnA354uhryRHzXDKFGWuc3hCTx27uDaK4Oyw7j9JswHWwAeKkhnNSNrgwlenyO3vY8 bAfYZNiMCri8JyM8CkiJLuzs1hQ/xWJUAk/ngMb8dZzbWfXHo4Fhr4w8V+GlB0i/kapRCRmO pqhjibl/CRGEaJPxNZ3JgzCpcUL/zP3PF/P2jwWxaTlAp0VBTM+gycfwEBitSrAqAOZLtK1o RbPOAeuKMqmp1FuCdJLGo7PJbVTNdMNYOj50ZrG+NvS+dohatqPCggqAOTevIEGtcU/FddhH 4c/YY+6Q/WPFADRpP0aXAnDtIS5Df/7QsNNoZbWP04dMwJCySjS9WF8s2Js7O99wyYxpb3tJ 4tDve/n5A4QwUf3SZDXJTjx3cNbZM/66V9ktTwOzf9iEc5tHEhX0x7S20hF7FyjdvsxlwlZ/ 40ChiaAvAiio1zboIO58iQIcBBEBAgAGBQJP/WZdAAoJENpjtAbv5/sYiJkP/12J3Hj81XYQ g/R5hDtX+U+lKsLrjHumSeKTCKPLq87UzhpuhtvpdwNmIK79wpl6oaRb2PQv0Lc+9a47AIVW JPIGIpGLsGs2YUsq2iTHLhco2aBnKByQoQwz0AXQaW7FMdilVaXWsg3Ss3jDBNKJNXOWp06b Z6eeZfrXHSBeCVglwgsUoxAp5CTXwYShQPPfrP04ZSbBNW+Iz5aXSl7emApdx67+LgBiOdi2 UKOPZz4OAZGdewr7D6aReFiFj9p5RYYBII7V+kEYyiIwGhwn0AoCqmXCrPS/rWHvAi8HWpQ6 hdQj4nDl/pH4BBH11QSK1Q8NOIrSuas2NMlG1NEiRnNMTrZXGK86/LyDBlTaQFtzyu4B7Zgg hqzLPBvwVDs/iBEIhcec1CVA24Gu+3/VCGoSAj5Wm9dFa/+BKX7swusoi6PBkxqlB0/v8TZg HZ81ttzvLipG59B/cQQD/Wum1F4LqMMkjkoR+n3A4IZB0ZAWqidwb29znR1LTpevFLjmZw99 UnMkSWAc1Up9r0XjI0IGDkQxZy+c8HqJulKw3g7NksNtewwTWwr4jjypUFe1d4pRujUZwAU/ Z42dlt6eXfBWS5W21C6zF5nZXjIwFRz16mZOweLzso7f5siDkb5A+kDNrWCsBzY8qEZad2dy 0yoRTmB+TDQh7GZ6zNm5JVSGiQIxBBMBAgAbAhsDAh4BAheABQJO6lEpBQsJCAcDBRUKCQgL AAoJECnZ7msfxzDBlHcP/0LfIH1RTd+FTz+wdiWH7KiSJJthH1iLtnBKb6F05iM+GXeGflJk JeSbcQUoHtcdyjVqVZdM9Af73C7HoMz1b4moBlfCFb+5lWTqZvxcAU0eXTyum2afXOhu88PQ VYdPwPJNNBEbHFNnllG/FtEn7BAm1JsAUpehkI7iNPqYbzD6xyi+aZ/yZWfNSHbeOXLAgzxH 0NFkvfxYusLijNmTwoBO0ZbzYeE7SOSMdUdUUmEHv22lv9m4RtrrdRbslhuphPJXnG6ITaP1 o9NhCMth8M2P00v1rfLWA3noS9WX6gU6CUWd7er7u8uQYR5PKFxPWK1AL3tc4yz4+iZFW9f/ 3PmJRDAW2x7vH08LWqM1XSvK3sa8Akz4mgLIXxBOAoGkyPUswpTEhICIL8vsxTYhdIjwhlLf iTZdDFnJCChC2dLi/iDc+Edw64m4UMI5vq2DTzNF2X2HFBQMjeim/zWKwZzAB7apT5TZsDOz tXJAVD9LRwoKzgNpefGQclbAXP9PoeE/1jBNRpSZiYSx3MWdSbmoGK/KWMh+6isR+hhkkziO GK6a1S8hN3uQBT5l9g88g0DIh0E9OA3Ns+LfydQBcqpKN2DzrjYDN5Q7YBhs/6yuU3cM5Zin addwKsc/LuQWHFFJeibNyj2Lta4XirORkXI2US+D3iduHQYCcZtiJuCpiQI4BBMBAgAiBQJO 6k81AhsDBgsJCAcDAgYVCAIJCgsEFgIDAQIeAQIXgAAKCRAp2e5rH8cwwYNJD/9q2w/lb9vb ipeAmAxrfwoSNR5X3yIAgr9hJxRJ3szPWowVnTsaYVqWmtgnKzLWwOGIsCz5gDkFxN0PtG9r lTJRm6UvH6j9ZcQBmkx4bsYiOA45DNdCoLykhqvFscr9bJe5dOyH6XlB2B3GjhgmfGOMpQ83 cb5JlGNEFz48yZ575nyZq44CpeoYPzZkxHYNjMd6cS4nbhIbb1HyL961qHN1bWFV8A9OxTyZ KH6EQibVh61SIfdbg93n1nssTajM21EhXuQHjfdfeXAYOdihDs2izChiaPJOqKcJcUtc1aPJ fUd8fbqMIfhMZ/awl3+uWJobqXWb13oIm6QJLosImgV9qIzV7BBQ7qrCFlqcqlIG/LhDEX0n cn/pSV11Yb5/Rm0KLdPL/wgHGh5QL9mXOw4prtyQ2J9DdEMnjjrPWeYir03GwtOZv4+/slee 5U/wM2Y2SIf07pjUboxVYpWS73GpeWCsBPSTkHCerBb7xuugcfJ2b9rSKpN7SQfUiCe8+p2E dzeQcB5biXFPwQxV4ck+agJ7XwSlXJRhDFXiEwH5SR5BVE/uX4sQLLZMwbwUpFwPVc85n2fs 0wmDFAiwv/m3oGFU9fEXLnpnpNJopJ0gkF2G3IFezoI2+U1vOdRBYM58UWXOtRzbsgyzo84Z ImNqrFC48MIcoW7ofHMrWM2rPYkEHAQQAQIABgUCT3EjOAAKCRC9ApQkIfSInyXmH/95/ZS0 Y+7oetaKGAgNbJWAXFc2yZNbe24NqedF1sRbw21HOfoWQS1jrw5vDlyVps5iHiuUg1lU2o67 ocDWB1xKaEzwDiEkdmT2ZwL5JHdyKdWXl8bBuH499X+gWleM3CQwVBTT7TKVfbrfujrEITmh uCBKxZ0VuTrNnxV6mbYofxaIlqtO66yI24bDNvpmXliCsEl4gkdZt+Z4saYQ79ekSl8DIQEA Y+iHoC7xzGjIuimq+lz1sW/dkWWEwQSikssKmDV36pYbSUV5WRiatMxseoJ+LGAnISfGH59K XsR8wYFC5LWa4LIB4o/OCicWC/X7HnFP2darWJ3ZIWB9El+CAKLSwJXGDamCa1/wWCZLga58 MVW9+uQu1UfaE+XZlMBclqgWJG7FOK1UGij4sCOKr5aciVoUNzR+uEGlaawOf9sFXqShY//X JtPtLMcnUrPC7vJ+9q4YkHKUYe0Q9GEZqLhmDFOF1J562/CR+qcvo7FEoVz+i+DLyhpEaoYY JFp/xONOlscLb1jVH5DNKZQfYlF2+ngu+0HYSGlBoFAuzvOUBDijWYoRGDBzlof8ywrpK3es PDIgMH4ik2E9FmZDD1ts/S56I7WAT+Qv4WvUD5a6/8XSomLP4pRpbrD4Gj1Ibnwcn1iISK3F bIPjcD3lwFEWN/Du6Q2C9QFT6LExtPceaGjWBWMiiGhvDGM7D9r+rH6MNvxCXLQppP60xdPB mtSfWUWUEqtMIFCvlS0LUR5cQJ13x1xjtPWCp/JQIXcqt/Nny3qAoD8+od4PWgSnKlBggDRj jkIfAeB0VlpVVFAq/VVat+y+cZ5+1RAHJbFemre8AS6HBWFYh5Yfl3emL4qQNKodP03jvwy7 Bczlz4vXJJk8FigvjVUsawfsgAZ2pvYododo7cipkBXFi99CObzwGm6iXdIoiyoZvKDfP6rU S95FtYFT8nHM/b5LAYVgzafw1KQg7jzlFeUJtvT1I+bBZkCHcgNuMS1vjjlOGc/6HcOE1i0N 8XYOeKg1DLLvMwHPHBO2p8iFlnQEe7Wwd8mqjn5wM4Z81ZCh1alx9aKZuWI/LfrEcigiGn40 O5mHP7Y/RLV5Pzbg1b8UDU7DLgpFxpFtmzokew4CsT2TXNZnAJuJNg6s9zK5ewvaF83t7bNd uwwjshpOYF3zmaFcHWsJhP2dQYvaUhHB/cYuoL5My4mNyg/fQnuOmbgz4hxd6gZ1VPC+Nbp8 15EH42h7lj4oxq6sSa2lN57SqyMc9wT8pfZGxdHpmsWDrkN2xOQRihPKycXIaAh+mS2VgPVQ S9F34GyHQdo+QHxc6Y5W0sWfdiWmbdd3/Y7yq/we6iwYFExDdJPGaMXXhd5SO4qluQINBE7q TzUBEACjHxWtPnclyRaZPrkEdBPoE+tsdFJVUrVMtldwQhzHqzyVhRckoC8Ck8rotPi9SPV/ j2jwc7kj4WnW1lGYPemKIDa18WO/8Q/6tQ5ASGTFhIj1F6JbSOq0Ua66kyLiFZqWTf8q0r+u KtN7OgNF2m4QjyaVxD3U036bTQW3Jt7YES0iomgVF4lAHkwPxwB5jPdvNXtVsg4clQ+dc29u JdUuhgvnv0jiyQ3YBUrdWW4a4xe29KER/wCJC0uQ06AJFeD63lQacAX2E1WaTTM91Drzzn5B vP7xXiWPsZjPvCNWDxoLJ6eSQYLUIfETrvTrhH/BppHPYWfhAPGRhJYCG4kmoGdeM/KpZwF4 6SqgOQ0QA5Vtc1S1Y9K1E5mr+z7QTMHuTLWsUvXv6I24XAOgxL41Z+QlKOmpJmRGUZ8X2ikX fAknJp6B1FPtTBzXepBIOBP8/7nUFD6zc8YrtOka2+ON63R0hJbPe6vqK7aTTpjrQ+k7H3/M Nhet8AIlDNI6cw/HCw1JbfR3F5G5H1vBi8cbB8s3R+p5ymMnLn6ULXGgwD9AaEyYtaufb5N5 wuSLHwrt3JiNGDcJUgJYhyADxz5zWJDq6onTUpan0EYuWHg/+NhuBwa4iASQZKuJPibVgVpf XssfXEnldY2jrohtxz5YUBVol07p1mnmoqXWH56jpQARAQABiQIfBBgBAgAJBQJO6k81AhsM AAoJECnZ7msfxzDBZm8P/24LJHk1fjXDTJO35SgljZTDl6d238XgN1MiCWz48c8mFqr3+/QE lzliUWqrZWROuOfDcwhPm+1en3m8L6oKuQLw2Vt4HRT9U7LAGylcpBmni5CZG4rQ+WReXZGp J7jruaIK9iSHpFIAU9s65rzsJ5O10gpRTfaMyg1MJBd9RLy3m9/Ik11N1MTKZpWAa/9z93aU 1s5XFgXYsBITuH/Rfw8KZw0UfQ8yMCEvLnxwg58rtuFw/WXVBrVkN/TcI+UMpWac5/JVeCWt zyeiuDxLEnZDHmNlzqbj35khw1K/z24bOcIiIPURKEWRkLbIbCuirW2u0wowE+irImYuk10O R/LQ8gOomPvUhWNFRCTN1c7SmFhtKkzgClchcpCOz8m34Q95CbDcW7fMVLWMEalhQnxeSR+U Fiuw9ku2l4RD7xjl8Id3orUKxJhql9J7ag/5zDCR34yn6D57txIUcDw6w2mh/IllIEsn1WB9 7aSHOwIe7lF26EgsUC53V4eTsBrA+K3xjGQGDSIUYEbXsqr5GmSvI5lXcGEjewDrTG1LMrxt J7sPrWH/SKTBPLzNxU9WsN0PpIEHaWRMVHk14rHdmYCQNd3LDLeqFe5TuRvo+H/5dF8dbZK/ baIpeRUkVSIK5JgNZ4XChlyJwIdYmvNIIKFrtLEpedB5aTlhBibpJmxc =C3PW -----END PGP PUBLIC KEY BLOCK----- armory-0.92.3/PublicKeys/ReinerCodeSign.asc0000644000000000000000000000610512414772654017234 0ustar rootroot-----BEGIN PGP PUBLIC KEY BLOCK----- Version: GnuPG v1.4.10 (GNU/Linux) mQINBE9MSnQBEACk81H2LPHm6wnodFU4qgEuswJJ5tRzTWU5kl+aIuxQ5iyVIF21 aOR0M0TLW0N7qAfGawXIf4nSPt5ohE2k1YVEsD/wVzICtsDi8AzwhMoRpDPIREi9 5NLKOUOmsTCM/1CYvmFhI741y/SeoLVimFBDlnUrDg8ivH+6gh0zgHJLigjUPmz5 dA+ea7n9iFluoGoSVudmBAytDlvYPrDH1nWWdpv+lfIIjFHc7k6y4wuD0H3W3UmQ RIo3JfvLsvbY01vZIyPPRGzCn3/3bbv1dOkoF8FBMOkCgq+dohD5u8yEs/ePz2GI aiWkTNFsX/N0MR/r+ce96Pekt6j5LYbXqo5hZOO6jZ+foidzoVK3GnHGU07wBRgf Rd7MeaV07dZaIwlyym0RpF0INPt7iI9jJBW0qJGCFWkpl5gXk5N0U+MAGN4bMHAp tybmOJo4pctaXcByzWGNVjDRhJCRgjD9o0Frlond0We1iPyxw3+ZDBbjjXH586El MxJwdUUtfn96DsmRMyIAdc30Pzo6FBl0SEEBakz2Lt4d/AgKcbb/D6g+z0zOHfrc etf6mxPWEW9x1cCB3+7IQ6sEcpF7a/UcPIFqsjGo5VFIkGdu7oKqN5wP6lbnmwBI 3r2pUnhxFlXBq0JqQS7rIJqpXBkS8XyH6Tsw4FWILaHK1kl1fa2EFBHwqwARAQAB tDtBbGFuIEMuIFJlaW5lciAoQXJtb3J5IFNpZ25pbmcgS2V5KSA8YWxhbi5yZWlu ZXJAZ21haWwuY29tPokCOAQTAQIAIgUCT0xKdAIbAwYLCQgHAwIGFQgCCQoLBBYC AwECHgECF4AACgkQSrFq6piDIiO3xA//cu7equV8b6ScuAyVwCEhvGG/Cf5Dh3nR IhLCbcYe1KjQ2XHKpjA5LxgJDgZRYzUwswDRkHThZgwHBmxOc56ZFn/DYd5uA60j B/++pb+IlymEb+khetHgQPE/cY4B+NM8lG1qUMWfCUOK/soUK76Dv5LDxuxygMbH jylWEh6LwrhUUTdzhQfxvKI0hpdS6k+8njdQcvFTlouqbORAUrgOyjl4/bdKNd2S Dpuz6iJYmTJ8keW8kcH/CWOl9kHCyOTGckVPTfnTueaVc0idb6bbTlsRRWRo3qxi pUw3o6yInU1ImMEIpVp3zgVkDBAoIQVq/lSqXNs4+5WmGD1Mv0DM47WB8IvS/jQR clvdegNKG3sOurnLmv6HPauE2hUF1hbO/aVabon/AtxFdrRIgUI2pkJSw/aHNys4 fKg5npJWc+V1o+zEZSNyckxHnMu5zIfj7vtP+aMHtI17YjKrJ88WzR/d3P2oGT0s rbWD0GKJk8vBXKFJiq/uFse8kJtzjyvr0Rydm+O0BzfRHTD777aha+kW8iI8Prxm JarQ4zgy8kKOANlqKqXouSc2TpIMlLUxgnSIv7xKSYZp9oOka2M8zIHhKyACwcCC mcnyRZK//23IZGzN50smRrSZgzFbp2xrb7v+0RklkQpQb6snzJSNjyG4miJiWRZw +zrNmueZ6ra5Ag0ET0xKdAEQANwKOrNbQIgUAlQ7sjXURYMhgaWZvRW8C8ZPcIbM TcUAqOuUS4A/d9k7Q4AJOiuQHyfVzBZC7Q6iUZm9iUyS84q5x8mVwYM+KjF4Etbe QZqztps5deIJfAHy/GsSWv8GQdvKGH7l5REcba/+8IdIrqlgff6j8GD2lZXvLoOm eL2TmJuzCFLZRveUHppjHCx2IBYPnJQqScIHPLequaKZwDPngJPofZkHGkIWAzKW mgJWcIlXlGVCs7BqgmIoniZk2pO+kj7Z6FqmTReHgCkl2sFzwCe3/QpLLGCBa6Er gxeAo91rOlJejmZTxkdIzMyw8BmLm6xJgUwB7vpf+Vsp1dv2s9RdFnD2DZKrYmmi 3Lemz26zSVw1peFNSW7ApuOND9GjNvJfST0cWbRN8Ckqtoij86JE8gIlzGGa7Uyu pT4/3Bw9mdRinkQUCc37URrWiZg5pxHGPEiE3RJQGnXbXsaSIeiFDL8dQcypqLSL N2lcSauXVauqdmYZvk4EW5DW7/dw2WbePsEkgLoiVH68DhGB6Qd/5EjxehMdntwc XAXfQho1dlkcDljwPu+1MxDQAlOdht3eMVmdNaQK3QVMyLeRmynNA4DUotckT6mN sctRidGJODE/q/f2A19apRuXgNIkijWVbbkVWJ8+XC+7V9Q3Z3Ir2NJMxv/Jokg6 SUD/ABEBAAGJAh8EGAECAAkFAk9MSnQCGwwACgkQSrFq6piDIiMdHxAAiqlvWHO4 vRlBIn3GUf/ZHN5HGA039onE4piD8iQDX+zHo4K7csO/jn8fJfln+9RIF/pB7PIv U+eEDw06xb9xnDwul5xId+v794szZLsio4WYGNb1lzvTAHolEB5xtv1a24Ta8suK nGPxSmC/uTjmkIANTFj6099fuiuuWB8dw0At0Qj+AwSr4cXju4k1e4NsCKVLvxo3 Q9kTtoL1GnzBQvaRW9AGm4ynH5K8aWo4MqR33+EBDOwJ5NDJBkMrlcw+GYU6Z87o ldCtEFg5iGrwZAhpN3wLt1WH/ZGBlYAUEQ+jXwcuzZuB8TcTIw/paGwHu7vn9jRP 1gghJnZp/KTe2B/e1h69qRD1n91NI7lGsENDFYI9WF8z3ALbmNz4kNhlZxjlsbMH NUCVdjBJp87KuIb5slK1mQEp3/Db3GdmUaEGoYZODwWCQIHz52806ofxy9vo5/F7 V32ldUc+AinhQfhtne//U2yaIJ6Gv3yiuJGegQcQEm3TjOiqXFPkm1gU/4q76tp8 wWjv/N+SUvHtbPa+cwVjMkvdo6OyXXj3INp40GnuXa+05ujmX8cv8tGXP0kb3PpF nIRy2FIoQ/jEBhvHIm+PznZdgON4ZoXmzXYyPDu+c85Cb4mN4xS2t5ahFKZMDbkl YAmM8m30X2wN2GFa4lLy0FeHmIxXqXZ9WOg= =S5E4 -----END PGP PUBLIC KEY BLOCK----- armory-0.92.3/cppForSwig/0000755000000000000000000000000012414772654013713 5ustar rootrootarmory-0.92.3/cppForSwig/testswig.py0000755000000000000000000001463412414772654016151 0ustar rootroot#! /usr/bin/python ################################################################################ # # # Copyright (C) 2011, Alan C. Reiner # # Distributed under the GNU Affero General Public License (AGPL v3) # # See LICENSE or http://www.gnu.org/licenses/agpl.html # # # ################################################################################ from sys import path as PYPATH, argv PYPATH.append('..') from btcarmoryengine import * from datetime import datetime from os import path import platform opsys = platform.system() blkfile = '' if 'win' in opsys.lower(): blkfile = path.join(os.getenv('APPDATA'), 'Bitcoin', 'blk0001.dat') if 'nix' in opsys.lower() or 'nux' in opsys.lower(): blkfile = path.join(os.getenv('HOME'), '.bitcoin', 'blk0001.dat') if 'mac' in opsys.lower() or 'osx' in opsys.lower(): blkfile = os.path.expanduser('~/Library/Application Support/Bitcoin/blk0001.dat') if len(sys.argv) > 1: blkfile = sys.argv[1] print '*'*80 print 'Importing BlockUtils module...', #from CppBlockUtils import * import CppBlockUtils as Cpp print 'Done!' print '' print 'Constructing BlockDataManager... ', bdm = Cpp.BlockDataManager().getBDM() print 'Done!' print '' print 'Loading blk0001.dat... ' bdm.readBlkFile_FromScratch(blkfile) print 'Done!' print '' print 'Organizing the blockchain... ', bdm.organizeChain(); print 'Done!' print '' print '*'*80 print 'Getting top block of the chain... ', top = bdm.getTopBlockHeader() top.pprint() print 'Done!...' print '' print 'Getting top block prevHash ... ', prevhash = top.getPrevHash() print binary_to_hex(prevhash, BIGENDIAN) print 'Done!' print '' print 'Testing SWIG typemaps!' pyhashstr = hex_to_binary('a4deb66c0d726b0aefb03ed51be407fbad7331c6e8f9eef231b7000000000000') head100k = bdm.getHeaderByHash(pyhashstr) print 'Got header:', head100k.getBlockHeight() bdstr = head100k.getPrevHash() print 'This BinaryData obj should\'ve been converted to pystr', binary_to_hex(bdstr) print 'Getting almost-top-block' topm1 = bdm.getHeaderByHash(prevhash) topm1.pprint() print 'Done!' print '' print 'Getting Block 170...' topm1 = bdm.getHeaderByHeight(170) topm1.pprint() print 'Done!' print '' print 'Accessing some top-block properties...' print 'Difficulty:', top.getDifficulty() print 'Diff Sum :', top.getDifficultySum() print 'Timestamp :', top.getTimestamp() print '' print '*'*80 print 'Accessing some transactions...' someBlk = bdm.getHeaderByHeight(100014) print 'TxList for block #', someBlk.getBlockHeight() topTxPtrList = someBlk.getTxRefPtrList() print 'NumTx:', len(topTxPtrList) for txptr in topTxPtrList: print '\n' print 'Tx:', binary_to_hex(txptr.getThisHash(), BIGENDIAN)[:16], blkHead = txptr.getHeaderPtr() print 'Blk:', blkHead.getBlockHeight(), print 'Timestamp:', unixTimeToFormatStr(blkHead.getTimestamp()), nIn = txptr.getNumTxIn() nOut = txptr.getNumTxOut() print '(in,out) = (%d,%d)' % (nIn, nOut) for i in range(nIn): txptr.getTxInRef(i).pprint() for i in range(nOut): txptr.getTxOutRef(i).pprint() print '*'*80 print '\n\nPrint some random scripts:' someBlk = bdm.getHeaderByHeight(100014) print someBlk.pprint() for tx in someBlk.getTxRefPtrList(): print 'Tx:', binary_to_hex(tx.getThisHash()) for i in range(tx.getNumTxIn()): print 'TxIn:', i txin = tx.getTxInRef(i) binScript = txin.getScript() if txin.isCoinbase(): print 'Script: ' print ' ' print ' ', binary_to_hex(binScript) else: pprintScript(binScript) print '' for i in range(tx.getNumTxOut()): print 'TxOut:', i binScript = tx.getTxOutRef(i).getScript() pprintScript(binScript) print '' print '*'*80 print '\n\nScanning Blockchain for transactions...', addrStr1 = hex_to_binary("abda0c878dd7b4197daa9622d96704a606d2cd14"); addrStr2 = hex_to_binary("11b366edfc0a8b66feebae5c2e25a7b6a5d1cf31"); addrStr3 = hex_to_binary("f62242a747ec1cb02afd56aac978faf05b90462e"); addrStr4 = hex_to_binary("baa72d8650baec634cdc439c1b84a982b2e596b2"); addrStr5 = hex_to_binary("6300bf4c5c2a724c280b893807afb976ec78a92b"); addrStr6 = hex_to_binary('0e0aec36fe2545fb31a41164fb6954adcd96b342'); # The _1_ methods are to avoid quirks with SWIG related using overloaded methods # requiring arguments that were typemap'd (BinaryData, in this case) cppWallet = Cpp.BtcWallet() cppWallet.addAddress_1_(addrStr1); cppWallet.addAddress_1_(addrStr2); cppWallet.addAddress_1_(addrStr3); bdm.scanBlockchainForTx_FromScratch(cppWallet); print 'Done!' print 'Wallet addresses: ', cppWallet.getNumAddr() for i in range(cppWallet.getNumAddr()): addr = cppWallet.getAddrByIndex(i) print '\t', hash160_to_addrStr(addr.getAddrStr20()), print '\tBalance:', coin2str(addr.getBalance()) print 'Getting Ledger for addresses:' ledger1 = cppWallet.getTxLedger() for i,l in enumerate(ledger1): print i, print '\tFrom/To:', hash160_to_addrStr(l.getAddrStr20()), print '\tBlock:', l.getBlockNum(), print '\tAmt:', coin2str(l.getValue()), txptr = bdm.getTxByHash(l.getTxHash()) headptr = txptr.getHeaderPtr() htime = headptr.getTimestamp() print '\tRcvd:', unixTimeToFormatStr(htime) print '\n\nAdding address to wallet that has non-std tx. Rescan wallet:' cppWallet.addAddress_1_(addrStr4) cppWallet.addAddress_1_(addrStr5) cppWallet.addAddress_1_(addrStr6) bdm.scanBlockchainForTx_FromScratch(cppWallet); print 'Done!' print 'Wallet addresses: ', cppWallet.getNumAddr() for i in range(cppWallet.getNumAddr()): addr = cppWallet.getAddrByIndex(i) print '\t', hash160_to_addrStr(addr.getAddrStr20()), print '\tBalance:', coin2str(addr.getBalance()) print 'Getting Ledger for addresses:' ledger1 = cppWallet.getTxLedger() for i,l in enumerate(ledger1): print i, print '\tFrom/To:', hash160_to_addrStr(l.getAddrStr20()), print '\tBlock:', l.getBlockNum(), print '\tAmt:', coin2str(l.getValue()), txptr = bdm.getTxByHash(l.getTxHash()) headptr = txptr.getHeaderPtr() htime = headptr.getTimestamp() print '\tRcvd:', unixTimeToFormatStr(htime) print '' print 'Getting unspent TxOuts for addresses:' utxolist = bdm.getUnspentTxOutsForWallet(cppWallet) pprintUnspentTxOutList(utxolist, "All utxos:") armory-0.92.3/cppForSwig/leveldbwin/0000755000000000000000000000000012414772654016046 5ustar rootrootarmory-0.92.3/cppForSwig/leveldbwin/build/0000755000000000000000000000000012414772654017145 5ustar rootrootarmory-0.92.3/cppForSwig/leveldbwin/build/msvc10/0000755000000000000000000000000012414772654020256 5ustar rootrootarmory-0.92.3/cppForSwig/leveldbwin/build/msvc10/snappy/0000755000000000000000000000000012414772654021570 5ustar rootrootarmory-0.92.3/cppForSwig/leveldbwin/build/msvc10/snappy/snappy.vcxproj0000644000000000000000000002012712414772654024521 0ustar rootroot Debug Win32 Debug x64 Release Win32 Release x64 {72639F93-D2E6-4220-AA46-E24C502E470C} Win32Proj snappy StaticLibrary true Unicode v110 StaticLibrary true Unicode v110 StaticLibrary false true Unicode v110 StaticLibrary false true Unicode v110 $(ProjectName)_d $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ $(SolutionDir)libs\$(Platform)\ $(ProjectName)_d $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ $(SolutionDir)libs\$(Platform)\ $(SolutionDir)libs\$(Platform) Level3 Disabled WIN32;_DEBUG;_LIB;%(PreprocessorDefinitions) ..\..\..\snappy_src;..\..\..\win32_impl_src\; Windows true Level3 Disabled WIN32;_DEBUG;_LIB;%(PreprocessorDefinitions) ..\..\..\snappy_src;..\..\..\win32_impl_src\; Windows true Level3 MaxSpeed true true WIN32;NDEBUG;_LIB;%(PreprocessorDefinitions) ..\..\..\snappy_src;..\..\..\win32_impl_src\; MultiThreaded Windows true true true Level3 MaxSpeed true true WIN32;NDEBUG;_LIB;%(PreprocessorDefinitions) ..\..\..\snappy_src;..\..\..\win32_impl_src\; Windows true true true armory-0.92.3/cppForSwig/leveldbwin/build/msvc10/snappy/snappy.vcxproj.filters0000644000000000000000000000303612414772654026170 0ustar rootroot {4FC737F1-C7A5-4376-A066-2A32D752A2FF} cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx {93995380-89BD-4b04-88EB-625FBE52EBFB} h;hpp;hxx;hm;inl;inc;xsd Source Files Source Files Source Files Header Files Header Files Header Files Header Files Header Files armory-0.92.3/cppForSwig/leveldbwin/README.txt0000644000000000000000000000052012414772654017541 0ustar rootrootThis file directory is maintained in the repo solely for snappy compression support. The code itself doesn't require snappy, but the original port needed it in order to compile on Windows in MSVS. As soon as I figure out how to cut the umbilical cord, I will remove the snappy project from the MSVS solution and remove this directory.armory-0.92.3/cppForSwig/leveldbwin/snappy_src/0000755000000000000000000000000012414772654020227 5ustar rootrootarmory-0.92.3/cppForSwig/leveldbwin/snappy_src/snappy-stubs-internal.cc0000644000000000000000000000344312414772654025024 0ustar rootroot// Copyright 2011 Google Inc. All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #include #include #include "snappy-stubs-internal.h" namespace snappy { void Varint::Append32(string* s, uint32 value) { char buf[Varint::kMax32]; const char* p = Varint::Encode32(buf, value); s->append(buf, p - buf); } } // namespace snappy armory-0.92.3/cppForSwig/leveldbwin/snappy_src/snappy.cc0000644000000000000000000010771312414772654022061 0ustar rootroot// Copyright 2005 Google Inc. All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #include "snappy.h" #include "snappy-internal.h" #include "snappy-sinksource.h" #include #include #include #include namespace snappy { // Any hash function will produce a valid compressed bitstream, but a good // hash function reduces the number of collisions and thus yields better // compression for compressible input, and more speed for incompressible // input. Of course, it doesn't hurt if the hash function is reasonably fast // either, as it gets called a lot. static inline uint32 HashBytes(uint32 bytes, int shift) { uint32 kMul = 0x1e35a7bd; return (bytes * kMul) >> shift; } static inline uint32 Hash(const char* p, int shift) { return HashBytes(UNALIGNED_LOAD32(p), shift); } size_t MaxCompressedLength(size_t source_len) { // Compressed data can be defined as: // compressed := item* literal* // item := literal* copy // // The trailing literal sequence has a space blowup of at most 62/60 // since a literal of length 60 needs one tag byte + one extra byte // for length information. // // Item blowup is trickier to measure. Suppose the "copy" op copies // 4 bytes of data. Because of a special check in the encoding code, // we produce a 4-byte copy only if the offset is < 65536. Therefore // the copy op takes 3 bytes to encode, and this type of item leads // to at most the 62/60 blowup for representing literals. // // Suppose the "copy" op copies 5 bytes of data. If the offset is big // enough, it will take 5 bytes to encode the copy op. Therefore the // worst case here is a one-byte literal followed by a five-byte copy. // I.e., 6 bytes of input turn into 7 bytes of "compressed" data. // // This last factor dominates the blowup, so the final estimate is: return 32 + source_len + source_len/6; } enum { LITERAL = 0, COPY_1_BYTE_OFFSET = 1, // 3 bit length + 3 bits of offset in opcode COPY_2_BYTE_OFFSET = 2, COPY_4_BYTE_OFFSET = 3 }; // Copy "len" bytes from "src" to "op", one byte at a time. Used for // handling COPY operations where the input and output regions may // overlap. For example, suppose: // src == "ab" // op == src + 2 // len == 20 // After IncrementalCopy(src, op, len), the result will have // eleven copies of "ab" // ababababababababababab // Note that this does not match the semantics of either memcpy() // or memmove(). static inline void IncrementalCopy(const char* src, char* op, int len) { DCHECK_GT(len, 0); do { *op++ = *src++; } while (--len > 0); } // Equivalent to IncrementalCopy except that it can write up to ten extra // bytes after the end of the copy, and that it is faster. // // The main part of this loop is a simple copy of eight bytes at a time until // we've copied (at least) the requested amount of bytes. However, if op and // src are less than eight bytes apart (indicating a repeating pattern of // length < 8), we first need to expand the pattern in order to get the correct // results. For instance, if the buffer looks like this, with the eight-byte // and patterns marked as intervals: // // abxxxxxxxxxxxx // [------] src // [------] op // // a single eight-byte copy from to will repeat the pattern once, // after which we can move two bytes without moving : // // ababxxxxxxxxxx // [------] src // [------] op // // and repeat the exercise until the two no longer overlap. // // This allows us to do very well in the special case of one single byte // repeated many times, without taking a big hit for more general cases. // // The worst case of extra writing past the end of the match occurs when // op - src == 1 and len == 1; the last copy will read from byte positions // [0..7] and write to [4..11], whereas it was only supposed to write to // position 1. Thus, ten excess bytes. namespace { const int kMaxIncrementCopyOverflow = 10; } // namespace static inline void IncrementalCopyFastPath(const char* src, char* op, int len) { while (op - src < 8) { UNALIGNED_STORE64(op, UNALIGNED_LOAD64(src)); len -= op - src; op += op - src; } while (len > 0) { UNALIGNED_STORE64(op, UNALIGNED_LOAD64(src)); src += 8; op += 8; len -= 8; } } static inline char* EmitLiteral(char* op, const char* literal, int len, bool allow_fast_path) { int n = len - 1; // Zero-length literals are disallowed if (n < 60) { // Fits in tag byte *op++ = LITERAL | (n << 2); // The vast majority of copies are below 16 bytes, for which a // call to memcpy is overkill. This fast path can sometimes // copy up to 15 bytes too much, but that is okay in the // main loop, since we have a bit to go on for both sides: // // - The input will always have kInputMarginBytes = 15 extra // available bytes, as long as we're in the main loop, and // if not, allow_fast_path = false. // - The output will always have 32 spare bytes (see // MaxCompressedLength). if (allow_fast_path && len <= 16) { UNALIGNED_STORE64(op, UNALIGNED_LOAD64(literal)); UNALIGNED_STORE64(op + 8, UNALIGNED_LOAD64(literal + 8)); return op + len; } } else { // Encode in upcoming bytes char* base = op; int count = 0; op++; while (n > 0) { *op++ = n & 0xff; n >>= 8; count++; } assert(count >= 1); assert(count <= 4); *base = LITERAL | ((59+count) << 2); } memcpy(op, literal, len); return op + len; } static inline char* EmitCopyLessThan64(char* op, int offset, int len) { DCHECK_LE(len, 64); DCHECK_GE(len, 4); DCHECK_LT(offset, 65536); if ((len < 12) && (offset < 2048)) { int len_minus_4 = len - 4; assert(len_minus_4 < 8); // Must fit in 3 bits *op++ = COPY_1_BYTE_OFFSET | ((len_minus_4) << 2) | ((offset >> 8) << 5); *op++ = offset & 0xff; } else { *op++ = COPY_2_BYTE_OFFSET | ((len-1) << 2); LittleEndian::Store16(op, offset); op += 2; } return op; } static inline char* EmitCopy(char* op, int offset, int len) { // Emit 64 byte copies but make sure to keep at least four bytes reserved while (len >= 68) { op = EmitCopyLessThan64(op, offset, 64); len -= 64; } // Emit an extra 60 byte copy if have too much data to fit in one copy if (len > 64) { op = EmitCopyLessThan64(op, offset, 60); len -= 60; } // Emit remainder op = EmitCopyLessThan64(op, offset, len); return op; } bool GetUncompressedLength(const char* start, size_t n, size_t* result) { uint32 v = 0; const char* limit = start + n; if (Varint::Parse32WithLimit(start, limit, &v) != NULL) { *result = v; return true; } else { return false; } } namespace internal { uint16* WorkingMemory::GetHashTable(size_t input_size, int* table_size) { // Use smaller hash table when input.size() is smaller, since we // fill the table, incurring O(hash table size) overhead for // compression, and if the input is short, we won't need that // many hash table entries anyway. assert(kMaxHashTableSize >= 256); int htsize = 256; while (htsize < kMaxHashTableSize && htsize < input_size) { htsize <<= 1; } CHECK_EQ(0, htsize & (htsize - 1)) << ": must be power of two"; CHECK_LE(htsize, kMaxHashTableSize) << ": hash table too large"; uint16* table; if (htsize <= ARRAYSIZE(small_table_)) { table = small_table_; } else { if (large_table_ == NULL) { large_table_ = new uint16[kMaxHashTableSize]; } table = large_table_; } *table_size = htsize; memset(table, 0, htsize * sizeof(*table)); return table; } } // end namespace internal // For 0 <= offset <= 4, GetUint32AtOffset(UNALIGNED_LOAD64(p), offset) will // equal UNALIGNED_LOAD32(p + offset). Motivation: On x86-64 hardware we have // empirically found that overlapping loads such as // UNALIGNED_LOAD32(p) ... UNALIGNED_LOAD32(p+1) ... UNALIGNED_LOAD32(p+2) // are slower than UNALIGNED_LOAD64(p) followed by shifts and casts to uint32. static inline uint32 GetUint32AtOffset(uint64 v, int offset) { DCHECK(0 <= offset && offset <= 4) << offset; return v >> (LittleEndian::IsLittleEndian() ? 8 * offset : 32 - 8 * offset); } // Flat array compression that does not emit the "uncompressed length" // prefix. Compresses "input" string to the "*op" buffer. // // REQUIRES: "input" is at most "kBlockSize" bytes long. // REQUIRES: "op" points to an array of memory that is at least // "MaxCompressedLength(input.size())" in size. // REQUIRES: All elements in "table[0..table_size-1]" are initialized to zero. // REQUIRES: "table_size" is a power of two // // Returns an "end" pointer into "op" buffer. // "end - op" is the compressed size of "input". namespace internal { char* CompressFragment(const char* input, size_t input_size, char* op, uint16* table, const int table_size) { // "ip" is the input pointer, and "op" is the output pointer. const char* ip = input; CHECK_LE(input_size, kBlockSize); CHECK_EQ(table_size & (table_size - 1), 0) << ": table must be power of two"; const int shift = 32 - Bits::Log2Floor(table_size); DCHECK_EQ(kuint32max >> shift, table_size - 1); const char* ip_end = input + input_size; const char* base_ip = ip; // Bytes in [next_emit, ip) will be emitted as literal bytes. Or // [next_emit, ip_end) after the main loop. const char* next_emit = ip; const int kInputMarginBytes = 15; if (PREDICT_TRUE(input_size >= kInputMarginBytes)) { const char* ip_limit = input + input_size - kInputMarginBytes; for (uint32 next_hash = Hash(++ip, shift); ; ) { DCHECK_LT(next_emit, ip); // The body of this loop calls EmitLiteral once and then EmitCopy one or // more times. (The exception is that when we're close to exhausting // the input we goto emit_remainder.) // // In the first iteration of this loop we're just starting, so // there's nothing to copy, so calling EmitLiteral once is // necessary. And we only start a new iteration when the // current iteration has determined that a call to EmitLiteral will // precede the next call to EmitCopy (if any). // // Step 1: Scan forward in the input looking for a 4-byte-long match. // If we get close to exhausting the input then goto emit_remainder. // // Heuristic match skipping: If 32 bytes are scanned with no matches // found, start looking only at every other byte. If 32 more bytes are // scanned, look at every third byte, etc.. When a match is found, // immediately go back to looking at every byte. This is a small loss // (~5% performance, ~0.1% density) for compressible data due to more // bookkeeping, but for non-compressible data (such as JPEG) it's a huge // win since the compressor quickly "realizes" the data is incompressible // and doesn't bother looking for matches everywhere. // // The "skip" variable keeps track of how many bytes there are since the // last match; dividing it by 32 (ie. right-shifting by five) gives the // number of bytes to move ahead for each iteration. uint32 skip = 32; const char* next_ip = ip; const char* candidate; do { ip = next_ip; uint32 hash = next_hash; DCHECK_EQ(hash, Hash(ip, shift)); uint32 bytes_between_hash_lookups = skip++ >> 5; next_ip = ip + bytes_between_hash_lookups; if (PREDICT_FALSE(next_ip > ip_limit)) { goto emit_remainder; } next_hash = Hash(next_ip, shift); candidate = base_ip + table[hash]; DCHECK_GE(candidate, base_ip); DCHECK_LT(candidate, ip); table[hash] = ip - base_ip; } while (PREDICT_TRUE(UNALIGNED_LOAD32(ip) != UNALIGNED_LOAD32(candidate))); // Step 2: A 4-byte match has been found. We'll later see if more // than 4 bytes match. But, prior to the match, input // bytes [next_emit, ip) are unmatched. Emit them as "literal bytes." DCHECK_LE(next_emit + 16, ip_end); op = EmitLiteral(op, next_emit, ip - next_emit, true); // Step 3: Call EmitCopy, and then see if another EmitCopy could // be our next move. Repeat until we find no match for the // input immediately after what was consumed by the last EmitCopy call. // // If we exit this loop normally then we need to call EmitLiteral next, // though we don't yet know how big the literal will be. We handle that // by proceeding to the next iteration of the main loop. We also can exit // this loop via goto if we get close to exhausting the input. uint64 input_bytes = 0; uint32 candidate_bytes = 0; do { // We have a 4-byte match at ip, and no need to emit any // "literal bytes" prior to ip. const char* base = ip; int matched = 4 + FindMatchLength(candidate + 4, ip + 4, ip_end); ip += matched; int offset = base - candidate; DCHECK_EQ(0, memcmp(base, candidate, matched)); op = EmitCopy(op, offset, matched); // We could immediately start working at ip now, but to improve // compression we first update table[Hash(ip - 1, ...)]. const char* insert_tail = ip - 1; next_emit = ip; if (PREDICT_FALSE(ip >= ip_limit)) { goto emit_remainder; } input_bytes = UNALIGNED_LOAD64(insert_tail); uint32 prev_hash = HashBytes(GetUint32AtOffset(input_bytes, 0), shift); table[prev_hash] = ip - base_ip - 1; uint32 cur_hash = HashBytes(GetUint32AtOffset(input_bytes, 1), shift); candidate = base_ip + table[cur_hash]; candidate_bytes = UNALIGNED_LOAD32(candidate); table[cur_hash] = ip - base_ip; } while (GetUint32AtOffset(input_bytes, 1) == candidate_bytes); next_hash = HashBytes(GetUint32AtOffset(input_bytes, 2), shift); ++ip; } } emit_remainder: // Emit the remaining bytes as a literal if (next_emit < ip_end) { op = EmitLiteral(op, next_emit, ip_end - next_emit, false); } return op; } } // end namespace internal // Signature of output types needed by decompression code. // The decompression code is templatized on a type that obeys this // signature so that we do not pay virtual function call overhead in // the middle of a tight decompression loop. // // class DecompressionWriter { // public: // // Called before decompression // void SetExpectedLength(size_t length); // // // Called after decompression // bool CheckLength() const; // // // Called repeatedly during decompression // bool Append(const char* ip, uint32 length, bool allow_fast_path); // bool AppendFromSelf(uint32 offset, uint32 length); // }; // // "allow_fast_path" is a parameter that says if there is at least 16 // readable bytes in "ip". It is currently only used by SnappyArrayWriter. // ----------------------------------------------------------------------- // Lookup table for decompression code. Generated by ComputeTable() below. // ----------------------------------------------------------------------- // Mapping from i in range [0,4] to a mask to extract the bottom 8*i bits static const uint32 wordmask[] = { 0u, 0xffu, 0xffffu, 0xffffffu, 0xffffffffu }; // Data stored per entry in lookup table: // Range Bits-used Description // ------------------------------------ // 1..64 0..7 Literal/copy length encoded in opcode byte // 0..7 8..10 Copy offset encoded in opcode byte / 256 // 0..4 11..13 Extra bytes after opcode // // We use eight bits for the length even though 7 would have sufficed // because of efficiency reasons: // (1) Extracting a byte is faster than a bit-field // (2) It properly aligns copy offset so we do not need a <<8 static const uint16 char_table[256] = { 0x0001, 0x0804, 0x1001, 0x2001, 0x0002, 0x0805, 0x1002, 0x2002, 0x0003, 0x0806, 0x1003, 0x2003, 0x0004, 0x0807, 0x1004, 0x2004, 0x0005, 0x0808, 0x1005, 0x2005, 0x0006, 0x0809, 0x1006, 0x2006, 0x0007, 0x080a, 0x1007, 0x2007, 0x0008, 0x080b, 0x1008, 0x2008, 0x0009, 0x0904, 0x1009, 0x2009, 0x000a, 0x0905, 0x100a, 0x200a, 0x000b, 0x0906, 0x100b, 0x200b, 0x000c, 0x0907, 0x100c, 0x200c, 0x000d, 0x0908, 0x100d, 0x200d, 0x000e, 0x0909, 0x100e, 0x200e, 0x000f, 0x090a, 0x100f, 0x200f, 0x0010, 0x090b, 0x1010, 0x2010, 0x0011, 0x0a04, 0x1011, 0x2011, 0x0012, 0x0a05, 0x1012, 0x2012, 0x0013, 0x0a06, 0x1013, 0x2013, 0x0014, 0x0a07, 0x1014, 0x2014, 0x0015, 0x0a08, 0x1015, 0x2015, 0x0016, 0x0a09, 0x1016, 0x2016, 0x0017, 0x0a0a, 0x1017, 0x2017, 0x0018, 0x0a0b, 0x1018, 0x2018, 0x0019, 0x0b04, 0x1019, 0x2019, 0x001a, 0x0b05, 0x101a, 0x201a, 0x001b, 0x0b06, 0x101b, 0x201b, 0x001c, 0x0b07, 0x101c, 0x201c, 0x001d, 0x0b08, 0x101d, 0x201d, 0x001e, 0x0b09, 0x101e, 0x201e, 0x001f, 0x0b0a, 0x101f, 0x201f, 0x0020, 0x0b0b, 0x1020, 0x2020, 0x0021, 0x0c04, 0x1021, 0x2021, 0x0022, 0x0c05, 0x1022, 0x2022, 0x0023, 0x0c06, 0x1023, 0x2023, 0x0024, 0x0c07, 0x1024, 0x2024, 0x0025, 0x0c08, 0x1025, 0x2025, 0x0026, 0x0c09, 0x1026, 0x2026, 0x0027, 0x0c0a, 0x1027, 0x2027, 0x0028, 0x0c0b, 0x1028, 0x2028, 0x0029, 0x0d04, 0x1029, 0x2029, 0x002a, 0x0d05, 0x102a, 0x202a, 0x002b, 0x0d06, 0x102b, 0x202b, 0x002c, 0x0d07, 0x102c, 0x202c, 0x002d, 0x0d08, 0x102d, 0x202d, 0x002e, 0x0d09, 0x102e, 0x202e, 0x002f, 0x0d0a, 0x102f, 0x202f, 0x0030, 0x0d0b, 0x1030, 0x2030, 0x0031, 0x0e04, 0x1031, 0x2031, 0x0032, 0x0e05, 0x1032, 0x2032, 0x0033, 0x0e06, 0x1033, 0x2033, 0x0034, 0x0e07, 0x1034, 0x2034, 0x0035, 0x0e08, 0x1035, 0x2035, 0x0036, 0x0e09, 0x1036, 0x2036, 0x0037, 0x0e0a, 0x1037, 0x2037, 0x0038, 0x0e0b, 0x1038, 0x2038, 0x0039, 0x0f04, 0x1039, 0x2039, 0x003a, 0x0f05, 0x103a, 0x203a, 0x003b, 0x0f06, 0x103b, 0x203b, 0x003c, 0x0f07, 0x103c, 0x203c, 0x0801, 0x0f08, 0x103d, 0x203d, 0x1001, 0x0f09, 0x103e, 0x203e, 0x1801, 0x0f0a, 0x103f, 0x203f, 0x2001, 0x0f0b, 0x1040, 0x2040 }; // In debug mode, allow optional computation of the table at startup. // Also, check that the decompression table is correct. #ifndef NDEBUG DEFINE_bool(snappy_dump_decompression_table, false, "If true, we print the decompression table at startup."); static uint16 MakeEntry(unsigned int extra, unsigned int len, unsigned int copy_offset) { // Check that all of the fields fit within the allocated space DCHECK_EQ(extra, extra & 0x7); // At most 3 bits DCHECK_EQ(copy_offset, copy_offset & 0x7); // At most 3 bits DCHECK_EQ(len, len & 0x7f); // At most 7 bits return len | (copy_offset << 8) | (extra << 11); } static void ComputeTable() { uint16 dst[256]; // Place invalid entries in all places to detect missing initialization int assigned = 0; for (int i = 0; i < 256; i++) { dst[i] = 0xffff; } // Small LITERAL entries. We store (len-1) in the top 6 bits. for (unsigned int len = 1; len <= 60; len++) { dst[LITERAL | ((len-1) << 2)] = MakeEntry(0, len, 0); assigned++; } // Large LITERAL entries. We use 60..63 in the high 6 bits to // encode the number of bytes of length info that follow the opcode. for (unsigned int extra_bytes = 1; extra_bytes <= 4; extra_bytes++) { // We set the length field in the lookup table to 1 because extra // bytes encode len-1. dst[LITERAL | ((extra_bytes+59) << 2)] = MakeEntry(extra_bytes, 1, 0); assigned++; } // COPY_1_BYTE_OFFSET. // // The tag byte in the compressed data stores len-4 in 3 bits, and // offset/256 in 5 bits. offset%256 is stored in the next byte. // // This format is used for length in range [4..11] and offset in // range [0..2047] for (unsigned int len = 4; len < 12; len++) { for (unsigned int offset = 0; offset < 2048; offset += 256) { dst[COPY_1_BYTE_OFFSET | ((len-4)<<2) | ((offset>>8)<<5)] = MakeEntry(1, len, offset>>8); assigned++; } } // COPY_2_BYTE_OFFSET. // Tag contains len-1 in top 6 bits, and offset in next two bytes. for (unsigned int len = 1; len <= 64; len++) { dst[COPY_2_BYTE_OFFSET | ((len-1)<<2)] = MakeEntry(2, len, 0); assigned++; } // COPY_4_BYTE_OFFSET. // Tag contents len-1 in top 6 bits, and offset in next four bytes. for (unsigned int len = 1; len <= 64; len++) { dst[COPY_4_BYTE_OFFSET | ((len-1)<<2)] = MakeEntry(4, len, 0); assigned++; } // Check that each entry was initialized exactly once. CHECK_EQ(assigned, 256); for (int i = 0; i < 256; i++) { CHECK_NE(dst[i], 0xffff); } if (FLAGS_snappy_dump_decompression_table) { printf("static const uint16 char_table[256] = {\n "); for (int i = 0; i < 256; i++) { printf("0x%04x%s", dst[i], ((i == 255) ? "\n" : (((i%8) == 7) ? ",\n " : ", "))); } printf("};\n"); } // Check that computed table matched recorded table for (int i = 0; i < 256; i++) { CHECK_EQ(dst[i], char_table[i]); } } REGISTER_MODULE_INITIALIZER(snappy, ComputeTable()); #endif /* !NDEBUG */ // Helper class for decompression class SnappyDecompressor { private: Source* reader_; // Underlying source of bytes to decompress const char* ip_; // Points to next buffered byte const char* ip_limit_; // Points just past buffered bytes uint32 peeked_; // Bytes peeked from reader (need to skip) bool eof_; // Hit end of input without an error? char scratch_[5]; // Temporary buffer for PeekFast() boundaries // Ensure that all of the tag metadata for the next tag is available // in [ip_..ip_limit_-1]. Also ensures that [ip,ip+4] is readable even // if (ip_limit_ - ip_ < 5). // // Returns true on success, false on error or end of input. bool RefillTag(); public: explicit SnappyDecompressor(Source* reader) : reader_(reader), ip_(NULL), ip_limit_(NULL), peeked_(0), eof_(false) { } ~SnappyDecompressor() { // Advance past any bytes we peeked at from the reader reader_->Skip(peeked_); } // Returns true iff we have hit the end of the input without an error. bool eof() const { return eof_; } // Read the uncompressed length stored at the start of the compressed data. // On succcess, stores the length in *result and returns true. // On failure, returns false. bool ReadUncompressedLength(uint32* result) { DCHECK(ip_ == NULL); // Must not have read anything yet // Length is encoded in 1..5 bytes *result = 0; uint32 shift = 0; while (true) { if (shift >= 32) return false; size_t n; const char* ip = reader_->Peek(&n); if (n == 0) return false; const unsigned char c = *(reinterpret_cast(ip)); reader_->Skip(1); *result |= static_cast(c & 0x7f) << shift; if (c < 128) { break; } shift += 7; } return true; } // Process the next item found in the input. // Returns true if successful, false on error or end of input. template void DecompressAllTags(Writer* writer) { const char* ip = ip_; for ( ;; ) { if (ip_limit_ - ip < 5) { ip_ = ip; if (!RefillTag()) return; ip = ip_; } const unsigned char c = *(reinterpret_cast(ip++)); if ((c & 0x3) == LITERAL) { uint32 literal_length = c >> 2; if (PREDICT_FALSE(literal_length >= 60)) { // Long literal. const uint32 literal_length_length = literal_length - 59; literal_length = LittleEndian::Load32(ip) & wordmask[literal_length_length]; ip += literal_length_length; } ++literal_length; uint32 avail = ip_limit_ - ip; while (avail < literal_length) { if (!writer->Append(ip, avail, false)) return; literal_length -= avail; reader_->Skip(peeked_); size_t n; ip = reader_->Peek(&n); avail = n; peeked_ = avail; if (avail == 0) return; // Premature end of input ip_limit_ = ip + avail; } bool allow_fast_path = (avail >= 16); if (!writer->Append(ip, literal_length, allow_fast_path)) { return; } ip += literal_length; } else { const uint32 entry = char_table[c]; const uint32 trailer = LittleEndian::Load32(ip) & wordmask[entry >> 11]; const uint32 length = entry & 0xff; ip += entry >> 11; // copy_offset/256 is encoded in bits 8..10. By just fetching // those bits, we get copy_offset (since the bit-field starts at // bit 8). const uint32 copy_offset = entry & 0x700; if (!writer->AppendFromSelf(copy_offset + trailer, length)) { return; } } } } }; bool SnappyDecompressor::RefillTag() { const char* ip = ip_; if (ip == ip_limit_) { // Fetch a new fragment from the reader reader_->Skip(peeked_); // All peeked bytes are used up size_t n; ip = reader_->Peek(&n); peeked_ = n; if (n == 0) { eof_ = true; return false; } ip_limit_ = ip + n; } // Read the tag character DCHECK_LT(ip, ip_limit_); const unsigned char c = *(reinterpret_cast(ip)); const uint32 entry = char_table[c]; const uint32 needed = (entry >> 11) + 1; // +1 byte for 'c' DCHECK_LE(needed, sizeof(scratch_)); // Read more bytes from reader if needed uint32 nbuf = ip_limit_ - ip; if (nbuf < needed) { // Stitch together bytes from ip and reader to form the word // contents. We store the needed bytes in "scratch_". They // will be consumed immediately by the caller since we do not // read more than we need. memmove(scratch_, ip, nbuf); reader_->Skip(peeked_); // All peeked bytes are used up peeked_ = 0; while (nbuf < needed) { size_t length; const char* src = reader_->Peek(&length); if (length == 0) return false; uint32 to_add = min(needed - nbuf, length); memcpy(scratch_ + nbuf, src, to_add); nbuf += to_add; reader_->Skip(to_add); } DCHECK_EQ(nbuf, needed); ip_ = scratch_; ip_limit_ = scratch_ + needed; } else if (nbuf < 5) { // Have enough bytes, but move into scratch_ so that we do not // read past end of input memmove(scratch_, ip, nbuf); reader_->Skip(peeked_); // All peeked bytes are used up peeked_ = 0; ip_ = scratch_; ip_limit_ = scratch_ + nbuf; } else { // Pass pointer to buffer returned by reader_. ip_ = ip; } return true; } template static bool InternalUncompress(Source* r, Writer* writer, uint32 max_len) { // Read the uncompressed length from the front of the compressed input SnappyDecompressor decompressor(r); uint32 uncompressed_len = 0; if (!decompressor.ReadUncompressedLength(&uncompressed_len)) return false; // Protect against possible DoS attack if (static_cast(uncompressed_len) > max_len) { return false; } writer->SetExpectedLength(uncompressed_len); // Process the entire input decompressor.DecompressAllTags(writer); return (decompressor.eof() && writer->CheckLength()); } bool GetUncompressedLength(Source* source, uint32* result) { SnappyDecompressor decompressor(source); return decompressor.ReadUncompressedLength(result); } size_t Compress(Source* reader, Sink* writer) { size_t written = 0; int N = reader->Available(); char ulength[Varint::kMax32]; char* p = Varint::Encode32(ulength, N); writer->Append(ulength, p-ulength); written += (p - ulength); internal::WorkingMemory wmem; char* scratch = NULL; char* scratch_output = NULL; while (N > 0) { // Get next block to compress (without copying if possible) size_t fragment_size; const char* fragment = reader->Peek(&fragment_size); DCHECK_NE(fragment_size, 0) << ": premature end of input"; const int num_to_read = min(N, kBlockSize); size_t bytes_read = fragment_size; int pending_advance = 0; if (bytes_read >= num_to_read) { // Buffer returned by reader is large enough pending_advance = num_to_read; fragment_size = num_to_read; } else { // Read into scratch buffer if (scratch == NULL) { // If this is the last iteration, we want to allocate N bytes // of space, otherwise the max possible kBlockSize space. // num_to_read contains exactly the correct value scratch = new char[num_to_read]; } memcpy(scratch, fragment, bytes_read); reader->Skip(bytes_read); while (bytes_read < num_to_read) { fragment = reader->Peek(&fragment_size); size_t n = min(fragment_size, num_to_read - bytes_read); memcpy(scratch + bytes_read, fragment, n); bytes_read += n; reader->Skip(n); } DCHECK_EQ(bytes_read, num_to_read); fragment = scratch; fragment_size = num_to_read; } DCHECK_EQ(fragment_size, num_to_read); // Get encoding table for compression int table_size; uint16* table = wmem.GetHashTable(num_to_read, &table_size); // Compress input_fragment and append to dest const int max_output = MaxCompressedLength(num_to_read); // Need a scratch buffer for the output, in case the byte sink doesn't // have room for us directly. if (scratch_output == NULL) { scratch_output = new char[max_output]; } else { // Since we encode kBlockSize regions followed by a region // which is <= kBlockSize in length, a previously allocated // scratch_output[] region is big enough for this iteration. } char* dest = writer->GetAppendBuffer(max_output, scratch_output); char* end = internal::CompressFragment(fragment, fragment_size, dest, table, table_size); writer->Append(dest, end - dest); written += (end - dest); N -= num_to_read; reader->Skip(pending_advance); } delete[] scratch; delete[] scratch_output; return written; } // ----------------------------------------------------------------------- // Flat array interfaces // ----------------------------------------------------------------------- // A type that writes to a flat array. // Note that this is not a "ByteSink", but a type that matches the // Writer template argument to SnappyDecompressor::DecompressAllTags(). class SnappyArrayWriter { private: char* base_; char* op_; char* op_limit_; public: inline explicit SnappyArrayWriter(char* dst) : base_(dst), op_(dst) { } inline void SetExpectedLength(size_t len) { op_limit_ = op_ + len; } inline bool CheckLength() const { return op_ == op_limit_; } inline bool Append(const char* ip, uint32 len, bool allow_fast_path) { char* op = op_; const int space_left = op_limit_ - op; if (allow_fast_path && len <= 16 && space_left >= 16) { // Fast path, used for the majority (about 90%) of dynamic invocations. UNALIGNED_STORE64(op, UNALIGNED_LOAD64(ip)); UNALIGNED_STORE64(op + 8, UNALIGNED_LOAD64(ip + 8)); } else { if (space_left < len) { return false; } memcpy(op, ip, len); } op_ = op + len; return true; } inline bool AppendFromSelf(uint32 offset, uint32 len) { char* op = op_; const int space_left = op_limit_ - op; if (op - base_ <= offset - 1u) { // -1u catches offset==0 return false; } if (len <= 16 && offset >= 8 && space_left >= 16) { // Fast path, used for the majority (70-80%) of dynamic invocations. UNALIGNED_STORE64(op, UNALIGNED_LOAD64(op - offset)); UNALIGNED_STORE64(op + 8, UNALIGNED_LOAD64(op - offset + 8)); } else { if (space_left >= len + kMaxIncrementCopyOverflow) { IncrementalCopyFastPath(op - offset, op, len); } else { if (space_left < len) { return false; } IncrementalCopy(op - offset, op, len); } } op_ = op + len; return true; } }; bool RawUncompress(const char* compressed, size_t n, char* uncompressed) { ByteArraySource reader(compressed, n); return RawUncompress(&reader, uncompressed); } bool RawUncompress(Source* compressed, char* uncompressed) { SnappyArrayWriter output(uncompressed); return InternalUncompress(compressed, &output, kuint32max); } bool Uncompress(const char* compressed, size_t n, string* uncompressed) { size_t ulength; if (!GetUncompressedLength(compressed, n, &ulength)) { return false; } // Protect against possible DoS attack if ((static_cast(ulength) + uncompressed->size()) > uncompressed->max_size()) { return false; } STLStringResizeUninitialized(uncompressed, ulength); return RawUncompress(compressed, n, string_as_array(uncompressed)); } // A Writer that drops everything on the floor and just does validation class SnappyDecompressionValidator { private: size_t expected_; size_t produced_; public: inline SnappyDecompressionValidator() : produced_(0) { } inline void SetExpectedLength(size_t len) { expected_ = len; } inline bool CheckLength() const { return expected_ == produced_; } inline bool Append(const char* ip, uint32 len, bool allow_fast_path) { produced_ += len; return produced_ <= expected_; } inline bool AppendFromSelf(uint32 offset, uint32 len) { if (produced_ <= offset - 1u) return false; // -1u catches offset==0 produced_ += len; return produced_ <= expected_; } }; bool IsValidCompressedBuffer(const char* compressed, size_t n) { ByteArraySource reader(compressed, n); SnappyDecompressionValidator writer; return InternalUncompress(&reader, &writer, kuint32max); } void RawCompress(const char* input, size_t input_length, char* compressed, size_t* compressed_length) { ByteArraySource reader(input, input_length); UncheckedByteArraySink writer(compressed); Compress(&reader, &writer); // Compute how many bytes were added *compressed_length = (writer.CurrentDestination() - compressed); } size_t Compress(const char* input, size_t input_length, string* compressed) { // Pre-grow the buffer to the max length of the compressed output compressed->resize(MaxCompressedLength(input_length)); size_t compressed_length; RawCompress(input, input_length, string_as_array(compressed), &compressed_length); compressed->resize(compressed_length); return compressed_length; } } // end namespace snappy armory-0.92.3/cppForSwig/leveldbwin/snappy_src/snappy-internal.h0000644000000000000000000001252612414772654023532 0ustar rootroot// Copyright 2008 Google Inc. All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Internals shared between the Snappy implementation and its unittest. #ifndef UTIL_SNAPPY_SNAPPY_INTERNAL_H_ #define UTIL_SNAPPY_SNAPPY_INTERNAL_H_ #include "snappy-stubs-internal.h" namespace snappy { namespace internal { class WorkingMemory { public: WorkingMemory() : large_table_(NULL) { } ~WorkingMemory() { delete[] large_table_; } // Allocates and clears a hash table using memory in "*this", // stores the number of buckets in "*table_size" and returns a pointer to // the base of the hash table. uint16* GetHashTable(size_t input_size, int* table_size); private: uint16 small_table_[1<<10]; // 2KB uint16* large_table_; // Allocated only when needed DISALLOW_COPY_AND_ASSIGN(WorkingMemory); }; // Flat array compression that does not emit the "uncompressed length" // prefix. Compresses "input" string to the "*op" buffer. // // REQUIRES: "input_length <= kBlockSize" // REQUIRES: "op" points to an array of memory that is at least // "MaxCompressedLength(input_length)" in size. // REQUIRES: All elements in "table[0..table_size-1]" are initialized to zero. // REQUIRES: "table_size" is a power of two // // Returns an "end" pointer into "op" buffer. // "end - op" is the compressed size of "input". char* CompressFragment(const char* input, size_t input_length, char* op, uint16* table, const int table_size); // Return the largest n such that // // s1[0,n-1] == s2[0,n-1] // and n <= (s2_limit - s2). // // Does not read *s2_limit or beyond. // Does not read *(s1 + (s2_limit - s2)) or beyond. // Requires that s2_limit >= s2. // // Separate implementation for x86_64, for speed. Uses the fact that // x86_64 is little endian. #if defined(ARCH_K8) static inline int FindMatchLength(const char* s1, const char* s2, const char* s2_limit) { DCHECK_GE(s2_limit, s2); int matched = 0; // Find out how long the match is. We loop over the data 64 bits at a // time until we find a 64-bit block that doesn't match; then we find // the first non-matching bit and use that to calculate the total // length of the match. while (PREDICT_TRUE(s2 <= s2_limit - 8)) { if (PREDICT_FALSE(UNALIGNED_LOAD64(s2) == UNALIGNED_LOAD64(s1 + matched))) { s2 += 8; matched += 8; } else { // On current (mid-2008) Opteron models there is a 3% more // efficient code sequence to find the first non-matching byte. // However, what follows is ~10% better on Intel Core 2 and newer, // and we expect AMD's bsf instruction to improve. uint64 x = UNALIGNED_LOAD64(s2) ^ UNALIGNED_LOAD64(s1 + matched); int matching_bits = Bits::FindLSBSetNonZero64(x); matched += matching_bits >> 3; return matched; } } while (PREDICT_TRUE(s2 < s2_limit)) { if (PREDICT_TRUE(s1[matched] == *s2)) { ++s2; ++matched; } else { return matched; } } return matched; } #else static inline int FindMatchLength(const char* s1, const char* s2, const char* s2_limit) { // Implementation based on the x86-64 version, above. DCHECK_GE(s2_limit, s2); int matched = 0; while (s2 <= s2_limit - 4 && UNALIGNED_LOAD32(s2) == UNALIGNED_LOAD32(s1 + matched)) { s2 += 4; matched += 4; } if (LittleEndian::IsLittleEndian() && s2 <= s2_limit - 4) { uint32 x = UNALIGNED_LOAD32(s2) ^ UNALIGNED_LOAD32(s1 + matched); int matching_bits = Bits::FindLSBSetNonZero(x); matched += matching_bits >> 3; } else { while ((s2 < s2_limit) && (s1[matched] == *s2)) { ++s2; ++matched; } } return matched; } #endif } // end namespace internal } // end namespace snappy #endif // UTIL_SNAPPY_SNAPPY_INTERNAL_H_ armory-0.92.3/cppForSwig/leveldbwin/snappy_src/snappy-sinksource.h0000644000000000000000000001150212414772654024074 0ustar rootroot// Copyright 2011 Google Inc. All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #ifndef UTIL_SNAPPY_SNAPPY_SINKSOURCE_H_ #define UTIL_SNAPPY_SNAPPY_SINKSOURCE_H_ #include namespace snappy { // A Sink is an interface that consumes a sequence of bytes. class Sink { public: Sink() { } virtual ~Sink(); // Append "bytes[0,n-1]" to this. virtual void Append(const char* bytes, size_t n) = 0; // Returns a writable buffer of the specified length for appending. // May return a pointer to the caller-owned scratch buffer which // must have at least the indicated length. The returned buffer is // only valid until the next operation on this Sink. // // After writing at most "length" bytes, call Append() with the // pointer returned from this function and the number of bytes // written. Many Append() implementations will avoid copying // bytes if this function returned an internal buffer. // // If a non-scratch buffer is returned, the caller may only pass a // prefix of it to Append(). That is, it is not correct to pass an // interior pointer of the returned array to Append(). // // The default implementation always returns the scratch buffer. virtual char* GetAppendBuffer(size_t length, char* scratch); private: // No copying Sink(const Sink&); void operator=(const Sink&); }; // A Source is an interface that yields a sequence of bytes class Source { public: Source() { } virtual ~Source(); // Return the number of bytes left to read from the source virtual size_t Available() const = 0; // Peek at the next flat region of the source. Does not reposition // the source. The returned region is empty iff Available()==0. // // Returns a pointer to the beginning of the region and store its // length in *len. // // The returned region is valid until the next call to Skip() or // until this object is destroyed, whichever occurs first. // // The returned region may be larger than Available() (for example // if this ByteSource is a view on a substring of a larger source). // The caller is responsible for ensuring that it only reads the // Available() bytes. virtual const char* Peek(size_t* len) = 0; // Skip the next n bytes. Invalidates any buffer returned by // a previous call to Peek(). // REQUIRES: Available() >= n virtual void Skip(size_t n) = 0; private: // No copying Source(const Source&); void operator=(const Source&); }; // A Source implementation that yields the contents of a flat array class ByteArraySource : public Source { public: ByteArraySource(const char* p, size_t n) : ptr_(p), left_(n) { } virtual ~ByteArraySource(); virtual size_t Available() const; virtual const char* Peek(size_t* len); virtual void Skip(size_t n); private: const char* ptr_; size_t left_; }; // A Sink implementation that writes to a flat array without any bound checks. class UncheckedByteArraySink : public Sink { public: explicit UncheckedByteArraySink(char* dest) : dest_(dest) { } virtual ~UncheckedByteArraySink(); virtual void Append(const char* data, size_t n); virtual char* GetAppendBuffer(size_t len, char* scratch); // Return the current output pointer so that a caller can see how // many bytes were produced. // Note: this is not a Sink method. char* CurrentDestination() const { return dest_; } private: char* dest_; }; } #endif // UTIL_SNAPPY_SNAPPY_SINKSOURCE_H_ armory-0.92.3/cppForSwig/leveldbwin/snappy_src/snappy-sinksource.cc0000644000000000000000000000450012414772654024232 0ustar rootroot// Copyright 2011 Google Inc. All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #include #include "snappy-sinksource.h" namespace snappy { Source::~Source() { } Sink::~Sink() { } char* Sink::GetAppendBuffer(size_t length, char* scratch) { return scratch; } ByteArraySource::~ByteArraySource() { } size_t ByteArraySource::Available() const { return left_; } const char* ByteArraySource::Peek(size_t* len) { *len = left_; return ptr_; } void ByteArraySource::Skip(size_t n) { left_ -= n; ptr_ += n; } UncheckedByteArraySink::~UncheckedByteArraySink() { } void UncheckedByteArraySink::Append(const char* data, size_t n) { // Do no copying if the caller filled in the result of GetAppendBuffer() if (data != dest_) { memcpy(dest_, data, n); } dest_ += n; } char* UncheckedByteArraySink::GetAppendBuffer(size_t len, char* scratch) { return dest_; } } armory-0.92.3/cppForSwig/leveldbwin/snappy_src/snappy-stubs-internal.h0000644000000000000000000003375712414772654024701 0ustar rootroot// Copyright 2011 Google Inc. All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Various stubs for the open-source version of Snappy. #ifndef UTIL_SNAPPY_OPENSOURCE_SNAPPY_STUBS_INTERNAL_H_ #define UTIL_SNAPPY_OPENSOURCE_SNAPPY_STUBS_INTERNAL_H_ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include #include #ifdef HAVE_SYS_MMAN_H #include #endif #include "snappy-stubs-public.h" #if defined(__x86_64__) // Enable 64-bit optimized versions of some routines. #define ARCH_K8 1 #endif // Needed by OS X, among others. #ifndef MAP_ANONYMOUS #define MAP_ANONYMOUS MAP_ANON #endif // Pull in std::min, std::ostream, and the likes. This is safe because this // header file is never used from any public header files. using namespace std; // The size of an array, if known at compile-time. // Will give unexpected results if used on a pointer. // We undefine it first, since some compilers already have a definition. #ifdef ARRAYSIZE #undef ARRAYSIZE #endif #define ARRAYSIZE(a) (sizeof(a) / sizeof(*(a))) // Static prediction hints. #ifdef HAVE_BUILTIN_EXPECT #define PREDICT_FALSE(x) (__builtin_expect(x, 0)) #define PREDICT_TRUE(x) (__builtin_expect(!!(x), 1)) #else #define PREDICT_FALSE(x) x #define PREDICT_TRUE(x) x #endif // This is only used for recomputing the tag byte table used during // decompression; for simplicity we just remove it from the open-source // version (anyone who wants to regenerate it can just do the call // themselves within main()). #define DEFINE_bool(flag_name, default_value, description) \ bool FLAGS_ ## flag_name = default_value; #define DECLARE_bool(flag_name) \ extern bool FLAGS_ ## flag_name; #define REGISTER_MODULE_INITIALIZER(name, code) namespace snappy { static const uint32 kuint32max = static_cast(0xFFFFFFFF); static const int64 kint64max = static_cast(0x7FFFFFFFFFFFFFFFLL); // Logging. #define LOG(level) LogMessage() #define VLOG(level) true ? (void)0 : \ snappy::LogMessageVoidify() & snappy::LogMessage() class LogMessage { public: LogMessage() { } ~LogMessage() { cerr << endl; } LogMessage& operator<<(const std::string& msg) { cerr << msg; return *this; } LogMessage& operator<<(int x) { cerr << x; return *this; } }; // Asserts, both versions activated in debug mode only, // and ones that are always active. #define CRASH_UNLESS(condition) \ PREDICT_TRUE(condition) ? (void)0 : \ snappy::LogMessageVoidify() & snappy::LogMessageCrash() class LogMessageCrash : public LogMessage { public: LogMessageCrash() { } ~LogMessageCrash() { cerr << endl; abort(); } }; // This class is used to explicitly ignore values in the conditional // logging macros. This avoids compiler warnings like "value computed // is not used" and "statement has no effect". class LogMessageVoidify { public: LogMessageVoidify() { } // This has to be an operator with a precedence lower than << but // higher than ?: void operator&(const LogMessage&) { } }; #define CHECK(cond) CRASH_UNLESS(cond) #define CHECK_LE(a, b) CRASH_UNLESS((a) <= (b)) #define CHECK_GE(a, b) CRASH_UNLESS((a) >= (b)) #define CHECK_EQ(a, b) CRASH_UNLESS((a) == (b)) #define CHECK_NE(a, b) CRASH_UNLESS((a) != (b)) #define CHECK_LT(a, b) CRASH_UNLESS((a) < (b)) #define CHECK_GT(a, b) CRASH_UNLESS((a) > (b)) #ifdef NDEBUG #define DCHECK(cond) CRASH_UNLESS(true) #define DCHECK_LE(a, b) CRASH_UNLESS(true) #define DCHECK_GE(a, b) CRASH_UNLESS(true) #define DCHECK_EQ(a, b) CRASH_UNLESS(true) #define DCHECK_NE(a, b) CRASH_UNLESS(true) #define DCHECK_LT(a, b) CRASH_UNLESS(true) #define DCHECK_GT(a, b) CRASH_UNLESS(true) #else #define DCHECK(cond) CHECK(cond) #define DCHECK_LE(a, b) CHECK_LE(a, b) #define DCHECK_GE(a, b) CHECK_GE(a, b) #define DCHECK_EQ(a, b) CHECK_EQ(a, b) #define DCHECK_NE(a, b) CHECK_NE(a, b) #define DCHECK_LT(a, b) CHECK_LT(a, b) #define DCHECK_GT(a, b) CHECK_GT(a, b) #endif // Potentially unaligned loads and stores. #if defined(__i386__) || defined(__x86_64__) || defined(__powerpc__) #define UNALIGNED_LOAD16(_p) (*reinterpret_cast(_p)) #define UNALIGNED_LOAD32(_p) (*reinterpret_cast(_p)) #define UNALIGNED_LOAD64(_p) (*reinterpret_cast(_p)) #define UNALIGNED_STORE16(_p, _val) (*reinterpret_cast(_p) = (_val)) #define UNALIGNED_STORE32(_p, _val) (*reinterpret_cast(_p) = (_val)) #define UNALIGNED_STORE64(_p, _val) (*reinterpret_cast(_p) = (_val)) #else // These functions are provided for architectures that don't support // unaligned loads and stores. inline uint16 UNALIGNED_LOAD16(const void *p) { uint16 t; memcpy(&t, p, sizeof t); return t; } inline uint32 UNALIGNED_LOAD32(const void *p) { uint32 t; memcpy(&t, p, sizeof t); return t; } inline uint64 UNALIGNED_LOAD64(const void *p) { uint64 t; memcpy(&t, p, sizeof t); return t; } inline void UNALIGNED_STORE16(void *p, uint16 v) { memcpy(p, &v, sizeof v); } inline void UNALIGNED_STORE32(void *p, uint32 v) { memcpy(p, &v, sizeof v); } inline void UNALIGNED_STORE64(void *p, uint64 v) { memcpy(p, &v, sizeof v); } #endif // The following guarantees declaration of the byte swap functions. #ifdef WORDS_BIGENDIAN #ifdef _MSC_VER #include #define bswap_16(x) _byteswap_ushort(x) #define bswap_32(x) _byteswap_ulong(x) #define bswap_64(x) _byteswap_uint64(x) #elif defined(__APPLE__) // Mac OS X / Darwin features #include #define bswap_16(x) OSSwapInt16(x) #define bswap_32(x) OSSwapInt32(x) #define bswap_64(x) OSSwapInt64(x) #else #include #endif #endif // WORDS_BIGENDIAN // Convert to little-endian storage, opposite of network format. // Convert x from host to little endian: x = LittleEndian.FromHost(x); // convert x from little endian to host: x = LittleEndian.ToHost(x); // // Store values into unaligned memory converting to little endian order: // LittleEndian.Store16(p, x); // // Load unaligned values stored in little endian converting to host order: // x = LittleEndian.Load16(p); class LittleEndian { public: // Conversion functions. #ifdef WORDS_BIGENDIAN static uint16 FromHost16(uint16 x) { return bswap_16(x); } static uint16 ToHost16(uint16 x) { return bswap_16(x); } static uint32 FromHost32(uint32 x) { return bswap_32(x); } static uint32 ToHost32(uint32 x) { return bswap_32(x); } static bool IsLittleEndian() { return false; } #else // !defined(WORDS_BIGENDIAN) static uint16 FromHost16(uint16 x) { return x; } static uint16 ToHost16(uint16 x) { return x; } static uint32 FromHost32(uint32 x) { return x; } static uint32 ToHost32(uint32 x) { return x; } static bool IsLittleEndian() { return true; } #endif // !defined(WORDS_BIGENDIAN) // Functions to do unaligned loads and stores in little-endian order. static uint16 Load16(const void *p) { return ToHost16(UNALIGNED_LOAD16(p)); } static void Store16(void *p, uint16 v) { UNALIGNED_STORE16(p, FromHost16(v)); } static uint32 Load32(const void *p) { return ToHost32(UNALIGNED_LOAD32(p)); } static void Store32(void *p, uint32 v) { UNALIGNED_STORE32(p, FromHost32(v)); } }; // Some bit-manipulation functions. class Bits { public: // Return floor(log2(n)) for positive integer n. Returns -1 iff n == 0. static int Log2Floor(uint32 n); // Return the first set least / most significant bit, 0-indexed. Returns an // undefined value if n == 0. FindLSBSetNonZero() is similar to ffs() except // that it's 0-indexed. static int FindLSBSetNonZero(uint32 n); static int FindLSBSetNonZero64(uint64 n); private: DISALLOW_COPY_AND_ASSIGN(Bits); }; #ifdef HAVE_BUILTIN_CTZ inline int Bits::Log2Floor(uint32 n) { return n == 0 ? -1 : 31 ^ __builtin_clz(n); } inline int Bits::FindLSBSetNonZero(uint32 n) { return __builtin_ctz(n); } inline int Bits::FindLSBSetNonZero64(uint64 n) { return __builtin_ctzll(n); } #else // Portable versions. inline int Bits::Log2Floor(uint32 n) { if (n == 0) return -1; int log = 0; uint32 value = n; for (int i = 4; i >= 0; --i) { int shift = (1 << i); uint32 x = value >> shift; if (x != 0) { value = x; log += shift; } } assert(value == 1); return log; } inline int Bits::FindLSBSetNonZero(uint32 n) { int rc = 31; for (int i = 4, shift = 1 << 4; i >= 0; --i) { const uint32 x = n << shift; if (x != 0) { n = x; rc -= shift; } shift >>= 1; } return rc; } // FindLSBSetNonZero64() is defined in terms of FindLSBSetNonZero(). inline int Bits::FindLSBSetNonZero64(uint64 n) { const uint32 bottombits = static_cast(n); if (bottombits == 0) { // Bottom bits are zero, so scan in top bits return 32 + FindLSBSetNonZero(static_cast(n >> 32)); } else { return FindLSBSetNonZero(bottombits); } } #endif // End portable versions. // Variable-length integer encoding. class Varint { public: // Maximum lengths of varint encoding of uint32. static const int kMax32 = 5; // Attempts to parse a varint32 from a prefix of the bytes in [ptr,limit-1]. // Never reads a character at or beyond limit. If a valid/terminated varint32 // was found in the range, stores it in *OUTPUT and returns a pointer just // past the last byte of the varint32. Else returns NULL. On success, // "result <= limit". static const char* Parse32WithLimit(const char* ptr, const char* limit, uint32* OUTPUT); // REQUIRES "ptr" points to a buffer of length sufficient to hold "v". // EFFECTS Encodes "v" into "ptr" and returns a pointer to the // byte just past the last encoded byte. static char* Encode32(char* ptr, uint32 v); // EFFECTS Appends the varint representation of "value" to "*s". static void Append32(string* s, uint32 value); }; inline const char* Varint::Parse32WithLimit(const char* p, const char* l, uint32* OUTPUT) { const unsigned char* ptr = reinterpret_cast(p); const unsigned char* limit = reinterpret_cast(l); uint32 b, result; if (ptr >= limit) return NULL; b = *(ptr++); result = b & 127; if (b < 128) goto done; if (ptr >= limit) return NULL; b = *(ptr++); result |= (b & 127) << 7; if (b < 128) goto done; if (ptr >= limit) return NULL; b = *(ptr++); result |= (b & 127) << 14; if (b < 128) goto done; if (ptr >= limit) return NULL; b = *(ptr++); result |= (b & 127) << 21; if (b < 128) goto done; if (ptr >= limit) return NULL; b = *(ptr++); result |= (b & 127) << 28; if (b < 16) goto done; return NULL; // Value is too long to be a varint32 done: *OUTPUT = result; return reinterpret_cast(ptr); } inline char* Varint::Encode32(char* sptr, uint32 v) { // Operate on characters as unsigneds unsigned char* ptr = reinterpret_cast(sptr); static const int B = 128; if (v < (1<<7)) { *(ptr++) = v; } else if (v < (1<<14)) { *(ptr++) = v | B; *(ptr++) = v>>7; } else if (v < (1<<21)) { *(ptr++) = v | B; *(ptr++) = (v>>7) | B; *(ptr++) = v>>14; } else if (v < (1<<28)) { *(ptr++) = v | B; *(ptr++) = (v>>7) | B; *(ptr++) = (v>>14) | B; *(ptr++) = v>>21; } else { *(ptr++) = v | B; *(ptr++) = (v>>7) | B; *(ptr++) = (v>>14) | B; *(ptr++) = (v>>21) | B; *(ptr++) = v>>28; } return reinterpret_cast(ptr); } // If you know the internal layout of the std::string in use, you can // replace this function with one that resizes the string without // filling the new space with zeros (if applicable) -- // it will be non-portable but faster. inline void STLStringResizeUninitialized(string* s, size_t new_size) { s->resize(new_size); } // Return a mutable char* pointing to a string's internal buffer, // which may not be null-terminated. Writing through this pointer will // modify the string. // // string_as_array(&str)[i] is valid for 0 <= i < str.size() until the // next call to a string method that invalidates iterators. // // As of 2006-04, there is no standard-blessed way of getting a // mutable reference to a string's internal buffer. However, issue 530 // (http://www.open-std.org/JTC1/SC22/WG21/docs/lwg-defects.html#530) // proposes this as the method. It will officially be part of the standard // for C++0x. This should already work on all current implementations. inline char* string_as_array(string* str) { return str->empty() ? NULL : &*str->begin(); } } // namespace snappy #endif // UTIL_SNAPPY_OPENSOURCE_SNAPPY_STUBS_INTERNAL_H_ armory-0.92.3/cppForSwig/leveldbwin/snappy_src/snappy.h0000644000000000000000000001535712414772654021725 0ustar rootroot// Copyright 2005 and onwards Google Inc. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // A light-weight compression algorithm. It is designed for speed of // compression and decompression, rather than for the utmost in space // savings. // // For getting better compression ratios when you are compressing data // with long repeated sequences or compressing data that is similar to // other data, while still compressing fast, you might look at first // using BMDiff and then compressing the output of BMDiff with // Snappy. #ifndef UTIL_SNAPPY_SNAPPY_H__ #define UTIL_SNAPPY_SNAPPY_H__ #include #include #include "snappy-stubs-public.h" namespace snappy { class Source; class Sink; // ------------------------------------------------------------------------ // Generic compression/decompression routines. // ------------------------------------------------------------------------ // Compress the bytes read from "*source" and append to "*sink". Return the // number of bytes written. size_t Compress(Source* source, Sink* sink); bool GetUncompressedLength(Source* source, uint32* result); // ------------------------------------------------------------------------ // Higher-level string based routines (should be sufficient for most users) // ------------------------------------------------------------------------ // Sets "*output" to the compressed version of "input[0,input_length-1]". // Original contents of *output are lost. // // REQUIRES: "input[]" is not an alias of "*output". size_t Compress(const char* input, size_t input_length, string* output); // Decompresses "compressed[0,compressed_length-1]" to "*uncompressed". // Original contents of "*uncompressed" are lost. // // REQUIRES: "compressed[]" is not an alias of "*uncompressed". // // returns false if the message is corrupted and could not be decompressed bool Uncompress(const char* compressed, size_t compressed_length, string* uncompressed); // ------------------------------------------------------------------------ // Lower-level character array based routines. May be useful for // efficiency reasons in certain circumstances. // ------------------------------------------------------------------------ // REQUIRES: "compressed" must point to an area of memory that is at // least "MaxCompressedLength(input_length)" bytes in length. // // Takes the data stored in "input[0..input_length]" and stores // it in the array pointed to by "compressed". // // "*compressed_length" is set to the length of the compressed output. // // Example: // char* output = new char[snappy::MaxCompressedLength(input_length)]; // size_t output_length; // RawCompress(input, input_length, output, &output_length); // ... Process(output, output_length) ... // delete [] output; void RawCompress(const char* input, size_t input_length, char* compressed, size_t* compressed_length); // Given data in "compressed[0..compressed_length-1]" generated by // calling the Snappy::Compress routine, this routine // stores the uncompressed data to // uncompressed[0..GetUncompressedLength(compressed)-1] // returns false if the message is corrupted and could not be decrypted bool RawUncompress(const char* compressed, size_t compressed_length, char* uncompressed); // Given data from the byte source 'compressed' generated by calling // the Snappy::Compress routine, this routine stores the uncompressed // data to // uncompressed[0..GetUncompressedLength(compressed,compressed_length)-1] // returns false if the message is corrupted and could not be decrypted bool RawUncompress(Source* compressed, char* uncompressed); // Returns the maximal size of the compressed representation of // input data that is "source_bytes" bytes in length; size_t MaxCompressedLength(size_t source_bytes); // REQUIRES: "compressed[]" was produced by RawCompress() or Compress() // Returns true and stores the length of the uncompressed data in // *result normally. Returns false on parsing error. // This operation takes O(1) time. bool GetUncompressedLength(const char* compressed, size_t compressed_length, size_t* result); // Returns true iff the contents of "compressed[]" can be uncompressed // successfully. Does not return the uncompressed data. Takes // time proportional to compressed_length, but is usually at least // a factor of four faster than actual decompression. bool IsValidCompressedBuffer(const char* compressed, size_t compressed_length); // *** DO NOT CHANGE THE VALUE OF kBlockSize *** // // New Compression code chops up the input into blocks of at most // the following size. This ensures that back-references in the // output never cross kBlockSize block boundaries. This can be // helpful in implementing blocked decompression. However the // decompression code should not rely on this guarantee since older // compression code may not obey it. static const int kBlockLog = 15; static const int kBlockSize = 1 << kBlockLog; static const int kMaxHashTableBits = 14; static const int kMaxHashTableSize = 1 << kMaxHashTableBits; } // end namespace snappy #endif // UTIL_SNAPPY_SNAPPY_H__ armory-0.92.3/cppForSwig/leveldbwin/snappy_src/snappy-stubs-public.h0000644000000000000000000000554112414772654024331 0ustar rootroot// Copyright 2011 Google Inc. All Rights Reserved. // Author: sesse@google.com (Steinar H. Gunderson) // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Various type stubs for the open-source version of Snappy. // // This file cannot include config.h, as it is included from snappy.h, // which is a public header. Instead, snappy-stubs-public.h is generated by // from snappy-stubs-public.h.in at configure time. #ifndef UTIL_SNAPPY_OPENSOURCE_SNAPPY_STUBS_PUBLIC_H_ #define UTIL_SNAPPY_OPENSOURCE_SNAPPY_STUBS_PUBLIC_H_ #if 1 #include #endif #if 1 #include #endif #define SNAPPY_MAJOR 1 #define SNAPPY_MINOR 0 #define SNAPPY_PATCHLEVEL 3 #define SNAPPY_VERSION \ ((SNAPPY_MAJOR << 16) | (SNAPPY_MINOR << 8) | SNAPPY_PATCHLEVEL) #include namespace snappy { #if 1 typedef int8_t int8; typedef uint8_t uint8; typedef int16_t int16; typedef uint16_t uint16; typedef int32_t int32; typedef uint32_t uint32; typedef int64_t int64; typedef uint64_t uint64; #else typedef signed char int8; typedef unsigned char uint8; typedef short int16; typedef unsigned short uint16; typedef int int32; typedef unsigned int uint32; typedef long long int64; typedef unsigned long long uint64; #endif typedef std::string string; #define DISALLOW_COPY_AND_ASSIGN(TypeName) \ TypeName(const TypeName&); \ void operator=(const TypeName&) } // namespace snappy #endif // UTIL_SNAPPY_OPENSOURCE_SNAPPY_STUBS_PUBLIC_H_ armory-0.92.3/cppForSwig/old_not_very_good_tests.cpp0000644000000000000000000024726312414772654021372 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// #include #include #include #include #include #include "UniversalTimer.h" #include "BinaryData.h" #include "BtcUtils.h" #include "BlockUtils.h" #include "EncryptionUtils.h" //#include "FileDataPtr.h" #include "PartialMerkle.h" #include "leveldb_wrapper.h" #include "leveldb/db.h" using namespace std; //////////////////////////////////////////////////////////////////////////////// void BaseTests(void); void TestReadAndOrganizeChain(string blkdir); void TestFindNonStdTx(string blkdir); void TestReadAndOrganizeChainWithWallet(string blkdir); void TestBalanceConstruction(string blkdir); void TestReadAndUpdateBlkFile(string blkdir); void TestScanForWalletTx(string blkdir); void TestReorgBlockchain(string blkdir); void TestZeroConf(void); void TestCrypto(void); void TestMerkle(void); void TestECDSA(void); void TestPointCompression(void); void TestFileCache(void); void TestReadBlkFileUpdate(string testblockdir, string blkdir); void TestOutOfOrder(string blkdir); void TestLevelDB(string testLDBDir, string blkfilepath=""); void TestLDBScanBlockchain(string testdbpath); void TestLdbBlockchainUtils(string blkdir); //////////////////////////////////////////////////////////////////////////////// void printTestHeader(string TestName) { cout << endl; for(int i=0; i<80; i++) cout << "*"; cout << endl << "Execute test: " << TestName << endl; for(int i=0; i<80; i++) cout << "*"; cout << endl; } bool copyFile(string src, string dst) { uint32_t srcsz = BtcUtils::GetFileSize(src); if(srcsz == FILE_DOES_NOT_EXIST) return false; BinaryData temp(srcsz); ifstream is(src.c_str(), ios::in | ios::binary); is.read((char*)temp.getPtr(), srcsz); is.close(); ofstream os(dst.c_str(), ios::out | ios::binary); os.write((char*)temp.getPtr(), srcsz); os.close(); return true; } string pathJoin(string dir, string file) { int const TOTALSZ = dir.size() + file.size() + 10; char * path = new char[TOTALSZ]; sprintf(path, "%s/%s", dir.c_str(), file.c_str()); string ret(path); return ret; } BinaryData h2b(string s) { return BinaryData::CreateFromHex(s); } int main(void) { BaseTests(); BlockDataManager_LevelDB::GetInstance().SelectNetwork("Test"); //string blkdir("/home/alan/.bitcoin"); //string blkdir("/home/alan/.bitcoin/testnet/"); //string blkdir("C:/Users/VBox/AppData/Roaming/Bitcoin"); string blkdir("C:/Users/Andy/AppData/Roaming/Bitcoin/testnet"); //string multitest("./multiblktest"); //printTestHeader("Read-and-Organize-Blockchain"); TestReadAndOrganizeChain(blkdir); //printTestHeader("Wallet-Relevant-Tx-Scan"); TestScanForWalletTx(blkdir); //printTestHeader("Find-Non-Standard-Tx"); //TestFindNonStdTx(blkdir); //printTestHeader("Read-and-Organize-Blockchain-With-Wallet"); //TestReadAndOrganizeChainWithWallet(blkdir); //printTestHeader("Test-Balance-Construction"); //TestBalanceConstruction(blkdir); //printTestHeader("Read-and-Update-Blockchain"); //TestReadAndUpdateBlkFile(multitest); //printTestHeader("Blockchain-Reorg-Unit-Test"); //TestReorgBlockchain(""); //printTestHeader("Test-out-of-order calls"); //TestOutOfOrder(blkdir); //printTestHeader("Testing Zero-conf handling"); //TestZeroConf(); printTestHeader("Testing merkle-root calculation"); TestMerkle(); //printTestHeader("Crypto-KDF-and-AES-methods"); //TestCrypto(); //printTestHeader("Crypto-ECDSA-sign-verify"); //TestECDSA(); //printTestHeader("ECDSA Point Compression"); //TestPointCompression(); //printTestHeader("Testing file cache"); //TestFileCache(); //printTestHeader("Testing LevelDB"); //TestLevelDB("blk0001db", blkdir + string("/blk0001.dat")); //TestLDBScanBlockchain("blk0001db"); //printTestHeader("Testing LDB Blockchain utilities"); //TestLdbBlockchainUtils(blkdir); ///////////////////////////////////////////////////////////////////////////// // ***** Print out all timings to stdout and a csv file ***** // Any method, anywhere, that called UniversalTimer // will end up having it's named timers printed out // This file can be loaded into a spreadsheet, // but it's not the prettiest thing... UniversalTimer::instance().print(); UniversalTimer::instance().printCSV("timings.csv"); cout << endl << endl; char pause[256]; cout << "enter anything to exit" << endl; cin >> pause; } void assertError(bool isTrue, string msg) { if(isTrue) return; cerr << "***ERROR: Failed BaseTest. Msg:" << endl; cerr << msg.c_str() << endl; exit(1); } void BaseTests(void) { BinaryData pushScript1 = h2b("493046022100c6abd6466c0cca354bebe9e9fb200ebd2924726a390eec8d76643cbb7959a070022100a5e02686e49819644d1f10d39fd59a41eb5c6f7bc28923f65cad72651fc8131401410459fd82189b81772258a3fc723fdda900eb8193057d4a573ee5ad39e26b58b5c12c4a51b0edd01769f96ed1998221daf0df89634a7137a8fa312d5ccc95ed89254930460221008e238f15d45c1d3739a6c65b6ad9689837f01685d0ded7adbff139e479d4a802022100b19ea60db5fdfc228a07b6d6b5115e148b861cd1085c4db1546da913a35a3f64014104ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1483045022100cd58f567dba08d9f33c59efd7271e105ab19a2e9e9f7ec423d93b2c5759636ad02206f6512f67a40051c8dd5a3910b371246a409d7589afcf019cc3550bbfcc41416014104ce66c9f5068b715b62cc1622572cd98a08812d8ca01563045263c3e7af6b997e603e8e62041c4eb82dfd386a3412c34c334c34eb3c76fb0e37483fc72323f807"); BinaryData pushScript2 = h2b("00493046022100c6abd6466c0cca354bebe9e9fb200ebd2924726a390eec8d76643cbb7959a070022100a5e02686e49819644d1f10d39fd59a41eb5c6f7bc28923f65cad72651fc8131401410459fd82189b81772258a3fc723fdda900eb8193057d4a573ee5ad39e26b58b5c12c4a51b0edd01769f96ed1998221daf0df89634a7137a8fa312d5ccc95ed89254930460221008e238f15d45c1d3739a6c65b6ad9689837f01685d0ded7adbff139e479d4a802022100b19ea60db5fdfc228a07b6d6b5115e148b861cd1085c4db1546da913a35a3f64014104ce6242d72ee67e867e6f8ec434b95fcb1889c5b485ec3414df407e11194a7ce012eda021b68f1dd124598a9b677d6e7d7c95b1b7347f5c5a08efa628ef0204e1483045022100cd58f567dba08d9f33c59efd7271e105ab19a2e9e9f7ec423d93b2c5759636ad02206f6512f67a40051c8dd5a3910b371246a409d7589afcf019cc3550bbfcc41416014104ce66c9f5068b715b62cc1622572cd98a08812d8ca01563045263c3e7af6b997e603e8e62041c4eb82dfd386a3412c34c334c34eb3c76fb0e37483fc72323f807"); vector splitPush = splitPushOnlyScript(pushScript1); cout << "Splitting push-only script" << endl; for(uint32_t i=0; i txOutScripts; vector txOutTypes; vector hash160s; vector txOutLDBKeys; txOutTypes.push_back( TXOUT_SCRIPT_STDHASH160 ) txOutScripts.push_back( h2b("76a914a134408afa258a50ed7a1d9817f26b63cc9002cc88ac")); txOutHash160s.push_back( h2b("a134408afa258a50ed7a1d9817f26b63cc9002cc")); txOutLDBKeys.push_back(h2b("00a134408afa258a50ed7a1d9817f26b63cc9002cc")); txOutTypes.push_back( TXOUT_SCRIPT_STDPUBKEY65 ); txOutScripts.push_back( h2b("4104b0bd634234abbb1ba1e986e884185c61cf43e001f9137f23c2c409273eb16e6537a576782eba668a7ef8bd3b3cfb1edb7117ab65129b8a2e681f3c1e0908ef7bac")); txOutHash160s.push_back( h2b("6da6f1bd6c6380633bc667ba232611f5bf864be2")); txOutLDBKeys.push_back(h2b("006da6f1bd6c6380633bc667ba232611f5bf864be2")); txOutTypes.push_back( TXOUT_SCRIPT_STDPUBKEY33 ); txOutScripts.push_back( h2b("21024005c945d86ac6b01fb04258345abea7a845bd25689edb723d5ad4068ddd3036ac")); txOutHash160s.push_back( h2b("0c1b83d01d0ffb2bccae606963376cca3863a7ce")); txOutLDBKeys.push_back(h2b("000c1b83d01d0ffb2bccae606963376cca3863a7ce")); // This was from block 150951 which was erroneously produced by MagicalTux // This is not only non-standard, it's non-spendable txOutTypes.push_back( TXOUT_SCRIPT_NONSTANDARD ); txOutScripts.push_back( h2b("76a90088ac")); txOutHash160s.push_back( BtcUtils::BadAddress_); txOutLDBKeys.push_back(h2b("ff76a90088ac")); // P2SH script from tx: 4ac04b4830d115eb9a08f320ef30159cc107dfb72b29bbc2f370093f962397b4 (TxOut: 1) // Spent in tx: fd16d6bbf1a3498ca9777b9d31ceae883eb8cb6ede1fafbdd218bae107de66fe (TxIn: 1) // P2SH address: 3Lip6sxQymNr9LD2cAVp6wLrw8xdKBdYFG // Hash160: d0c15a7d41500976056b3345f542d8c944077c8a txOutTypes.push_back( TXOUT_SCRIPT_P2SH ) txOutScripts.push_back( h2b("a914d0c15a7d41500976056b3345f542d8c944077c8a87")); // send to P2SH txOutHash160s.push_back( h2b("d0c15a7d41500976056b3345f542d8c944077c8a")); txOutLDBKeys.push_back( h2b("05d0c15a7d41500976056b3345f542d8c944077c8a")); //realCoinbaseOut = "04b6acd549c083cb0d31ee975eb8c2ad7a41be61f0a47bc5d75e919d42704e5642d72f1804bcbab60dbd33f041d3c9edde57704a061a22c5e3cf93debf5f35daaeac" //spendcb = "47304402201ffc44394e5a3dd9c8b55bdc12147e18574ac945d15dac026793bf3b8ff732af022035fd832549b5176126f735d87089c8c1c1319447a458a09818e173eaf0c2eef101" //has160 = 957efec6af757ccbbcf9a436f0083c5ddaa3bf1d //addrStr 1EdTpNBiPNPbEE4kASow2F4pUpES9jeTJE vector txInScripts; vector txInPrevHashes; vector txInTypes; vector txInHash160s; prevHashCB = h2b("0000000000000000000000000000000000000000000000000000000000000000"); prevHashReg = h2b("894862e362905c6075074d9ec4b4e2dc34720089b1e9ef4738ee1b13f3bdcdb7"); txInTypes.push_back(TXIN_SCRIPT_STDUNCOMPR) txInScripts.push_back( h2b("493046022100b9daf2733055be73ae00ee0c5d78ca639d554fe779f163396c1a39b7913e7eac02210091f0deeb2e510c74354afb30cc7d8fbac81b1ca8b3940613379adc41a6ffd226014104b1537fa5bc2242d25ebf54f31e76ebabe0b3de4a4dccd9004f058d6c2caa5d31164252e1e04e5df627fae7adec27fa9d40c271fc4d30ff375ef6b26eba192bac")) txInPrevHashes.push_back(prevHashReg); txInHash160s.push_back(h2b("c42a8290196b2c5bcb35471b45aa0dc096baed5e")); txInTypes.push_back(TXIN_SCRIPT_STDCOMPR); txInScripts.push_back( h2b("47304402205299224886e5e3402b0e9fa3527bcfe1d73c4e2040f18de8dd17f116e3365a1102202590dcc16c4b711daae6c37977ba579ca65bcaa8fba2bd7168a984be727ccf7a01210315122ff4d41d9fe3538a0a8c6c7f813cf12a901069a43d6478917246dc92a782")); txInPrevHashes.push_back(prevHashReg); txInHash160s.push_back("03214fc1433a287e964d6c4242093c34e4ed0001"); txInTypes.push_back(TXIN_SCRIPT_COINBASE) txInScripts.push_back( h2b("0310920304000071c3124d696e656420627920425443204775696c640800b75f950e000000")); txInPrevHashes.push_back(prevHashCB); txInHash160s.push_back( BtcUtils::BadAddress_); // Spending P2SH output as above: fd16d6bbf1a3498ca9777b9d31ceae883eb8cb6ede1fafbdd218bae107de66fe (TxIn: 1, 219 B) // Leading 0x00 byte is required due to a bug in OP_CHECKMULTISIG txInTypes.push_back(TXIN_SCRIPT_SPENDP2SH) txInScripts.push_back( h2b("004830450221009254113fa46918f299b1d18ec918613e56cffbeba0960db05f66b51496e5bf3802201e229de334bd753a2b08b36cc3f38f5263a23e9714a737520db45494ec095ce80148304502206ee62f539d5cd94f990b7abfda77750f58ff91043c3f002501e5448ef6dba2520221009d29229cdfedda1dd02a1a90bb71b30b77e9c3fc28d1353f054c86371f6c2a8101475221034758cefcb75e16e4dfafb32383b709fa632086ea5ca982712de6add93060b17a2103fe96237629128a0ae8c3825af8a4be8fe3109b16f62af19cec0b1eb93b8717e252ae")); txInPrevHashes.push_back(prevHashReg); txInHash160s.push_back( BtcUtils::BadAddress_); txInTypes.push_back(TXIN_SCRIPT_SPENDPUBKEY) txInScripts.push_back( h2b("47304402201ffc44394e5a3dd9c8b55bdc12147e18574ac945d15dac026793bf3b8ff732af022035fd832549b5176126f735d87089c8c1c1319447a458a09818e173eaf0c2eef101")); txInPrevHashes.push_back(prevHashReg); txInHash160s.push_back( BtcUtils::BadAddress_); //txInHash160s.push_back( h2b("957efec6af757ccbbcf9a436f0083c5ddaa3bf1d")); // this one can't be determined uint32_t nOutTest = txOutScripts.size(); TXOUT_SCRIPT_TYPE outType; BinaryData a160Out_1, a160Out_2; BinaryData keyOut_1, keyOut_2; for(uint32_t test=0; test txInScripts; vector txInPrevHashes; vector txInTypes; vector txInHash160s; // Test difficulty-to-double vector diffBits; vector diffDbls; diffBits.push_back(h2b("ffff001d")); diffDbls.push_back(1.0); diffBits.push_back(h2b("be2f021a")); diffDbls.push_back(7672999.920164138); diffBits.push_back(h2b("3daa011a")); diffDbls.push_back(10076292.883418716); for(uint32_t test=0; test const & ledger = wlt.getAddrByIndex(i).getTxLedger(); for(uint32_t j=0; j const & ledgerAll = wlt.getTxLedger(); for(uint32_t j=0; j sortedUTOs = bdm.getUnspentTxOutsForWallet(myWallet, 1); vector sortedUTOs = myWallet.getSpendableTxOutList(); int i=1; cout << " Sorting Method: " << i << endl; cout << " Value\t#Conf\tTxHash\tTxIdx" << endl; for(int j=0; j levect = wlt.getAddrLedgerEntriesForTx(txSelf); //for(int i=0; i wltList; wltList.push_back(&wlt1); wltList.push_back(&wlt2); bdm.registerWallet(&wlt1); bdm.registerWallet(&wlt2); ///////////////////////////////////////////////////////////////////////////// cout << "Reading data from blockchain... (with wallet scan)" << endl; TIMER_START("BDM_Load_Scan_Blockchain_With_Wallet"); bdm.SetBlkFileLocation(blkdir, 4, 1); bdm.parseEntireBlockchain(); TIMER_STOP("BDM_Load_Scan_Blockchain_With_Wallet"); cout << endl << endl; ///////////////////////////////////////////////////////////////////////////// cout << endl << "Organizing blockchain: " ; TIMER_START("BDM_Organize_Chain"); bool isGenOnMainChain = bdm.organizeChain(); TIMER_STOP("BDM_Organize_Chain"); cout << (isGenOnMainChain ? "No Reorg!" : "Reorg Detected!") << endl; cout << endl << endl; cout << endl << "Updating wallet (1) based on initial blockchain scan" << endl; TIMER_WRAP(bdm.scanBlockchainForTx(wlt1)); cout << "Printing Wallet(1) Ledger" << endl; wlt1.pprintLedger(); cout << endl << "Updating wallet (2) based on initial blockchain scan" << endl; TIMER_WRAP(bdm.scanBlockchainForTx(wlt2)); cout << "Printing Wallet(2) Ledger" << endl; wlt2.pprintLedger(); cout << endl << "Rescanning wlt2 multiple times" << endl; TIMER_WRAP(bdm.scanBlockchainForTx(wlt2)); TIMER_WRAP(bdm.scanBlockchainForTx(wlt2)); cout << "Printing Wallet(2) Ledger AGAIN" << endl; wlt2.pprintLedger(); cout << endl << "ADD a new address to Wlt(1) requiring a blockchain rescan..." << endl; // This address contains a tx with a non-std TxOut, but the other TxOuts are valid myAddress.createFromHex("6c27c8e67b7376f3ab63553fe37a4481c4f951cf"); wlt1.addAddress(myAddress); bdm.scanBlockchainForTx(wlt1); wlt1.pprintLedger(); cout << endl << "ADD new address to wlt(2) but as a just-created addr not requiring rescan" << endl; myAddress.createFromHex("6c27c8e67b7376f3ab63553fe37a4481c4f951cf"); wlt2.addNewAddress(myAddress); bdm.scanBlockchainForTx(wlt2); wlt2.pprintLedger(); cout << endl << "Create new, unregistered wallet, scan it once (should rescan)..." << endl; BtcWallet wlt3; myAddress.createFromHex("72e20a94d6b2ed34a3b4d3757c1fed5152071993"); wlt3.addAddress(myAddress); wlt3.addAddress(myAddress); bdm.scanBlockchainForTx(wlt3); wlt3.pprintLedger(); cout << endl << "Rescan unregistered wallet: addr should be registered, so no rescan..." << endl; bdm.scanBlockchainForTx(wlt3); wlt3.pprintLedger(); cout << endl << endl; cout << "Getting Sent-To Address List for Wlt1:" << endl; vector targAddrVect = wlt1.createAddressBook(); for(uint32_t i=0; i txList = targAddrVect[i].getTxList(); cout << targAddrVect[i].getAddr160().toHexStr() << " " << txList.size() << endl; for(uint32_t j=0; j utxoF = wlt.getFullTxOutList(topBlk); vector utxoS = wlt.getSpendableTxOutList(topBlk); cout << "FULL:" << endl; for(uint32_t i=0; i const & ledgerAll2 = wlt.getTxLedger(); for(uint32_t j=0; j const & ledger = wlt.getAddrByIndex(i).getTxLedger(); for(uint32_t j=0; j result; ///// cout << "Pushing Block 3A into the BDM:" << endl; copyFile(blk3A, "reorgTest/blk00000.dat"); bdm.readBlkFileUpdate(); cout << "Is last block reorg? " << (bdm.isLastBlockReorg() ? 1 : 0) << endl; ///// cout << "Pushing Block 4A into the BDM:" << endl; copyFile(blk4A, "reorgTest/blk00000.dat"); bdm.readBlkFileUpdate(); cout << "Is last block reorg? " << (bdm.isLastBlockReorg() ? 1 : 0) << endl; ///// cout << "Pushing Block 5A into the BDM:" << endl; copyFile(blk5A, "reorgTest/blk00000.dat"); bdm.readBlkFileUpdate(); cout << "Is last block reorg? " << (bdm.isLastBlockReorg() ? 1 : 0) << endl; if(bdm.isLastBlockReorg()) { cout << "Reorg happened after pushing block 5A" << endl; bdm.scanBlockchainForTx(wlt); bdm.updateWalletAfterReorg(wlt); } cout << "Checking balance of entire wallet: " << wlt.getFullBalance()/1e8 << endl; vector const & ledgerAll3 = wlt.getTxLedger(); for(uint32_t j=0; j const & ledger = wlt.getAddrByIndex(i).getTxLedger(); for(uint32_t j=0; j 8) { cout << endl << endl; cout << "Inserting another 0-conf tx..." << endl; uint64_t txtime = brr.get_uint64_t(); TxRef zcTx(brr); bool wasAdded = bdm.addNewZeroConfTx(zcTx.serialize(), txtime, true); if(wasAdded) bdm.rescanWalletZeroConf(wlt); cout << "UltBal: " << wlt.getFullBalance() << endl; cout << "SpdBal: " << wlt.getSpendableBalance() << endl; cout << "UncBal: " << wlt.getUnconfirmedBalance(currBlk) << endl; wlt.pprintLedger(); cout << "Unspent TxOuts:" << endl; vector utxoList = wlt.getSpendableTxOutList(currBlk); uint64_t bal = 0; for(uint32_t i=0; i txList(7); // The "abcd" quartets are to trigger endianness errors -- without them, // these hashes are palindromes that work regardless of your endian-handling txList[0].createFromHex("00000000000000000000000000000000000000000000000000000000abcd0000"); txList[1].createFromHex("11111111111111111111111111111111111111111111111111111111abcd1111"); txList[2].createFromHex("22222222222222222222222222222222222222222222222222222222abcd2222"); txList[3].createFromHex("33333333333333333333333333333333333333333333333333333333abcd3333"); txList[4].createFromHex("44444444444444444444444444444444444444444444444444444444abcd4444"); txList[5].createFromHex("55555555555555555555555555555555555555555555555555555555abcd5555"); txList[6].createFromHex("66666666666666666666666666666666666666666666666666666666abcd6666"); cout << "Merkle Tree looks like the following (7 tx): " << endl; cout << "The ** indicates the nodes we care about for partial tree test" << endl; cout << " \n"; cout << " _____0a10_____ \n"; cout << " / \\ \n"; cout << " _/ \\_ \n"; cout << " 65df b4d6 \n"; cout << " / \\ / \\ \n"; cout << " 6971 22dc 5675 d0b6 \n"; cout << " / \\ / \\ / \\ / \n"; cout << " 0000 1111 2222 3333 4444 5555 6666 \n"; cout << " ** ** \n"; cout << " " << endl; cout << endl; vector merkleTree = BtcUtils::calculateMerkleTree(txList); cout << "Full Merkle Tree (this one has been unit tested before):" << endl; for(uint32_t i=0; i isOurs(7); isOurs[0] = true; isOurs[1] = true; isOurs[2] = true; isOurs[3] = true; isOurs[4] = true; isOurs[5] = true; isOurs[6] = true; cout << "Start serializing a full tree" << endl; PartialMerkleTree pmtFull(7, &isOurs, &txList); BinaryData pmtSerFull = pmtFull.serialize(); cout << "Finished serializing (full)" << endl; cout << "Merkle Root: " << pmtFull.getMerkleRoot().toHexStr() << endl; cout << "Starting unserialize (full):" << endl; cout << "Serialized: " << pmtSerFull.toHexStr() << endl; PartialMerkleTree pmtFull2(7); pmtFull2.unserialize(pmtSerFull); BinaryData pmtSerFull2 = pmtFull2.serialize(); cout << "Reserializ: " << pmtSerFull2.toHexStr() << endl; cout << "Equal? " << (pmtSerFull==pmtSerFull2 ? "True" : "False") << endl; cout << "Print Tree:" << endl; pmtFull2.pprintTree(); ///////////////////////////////////////////////////////////////////////////// cout << "Starting Partial Merkle tree" << endl; isOurs[0] = true; isOurs[1] = false; isOurs[2] = false; isOurs[3] = false; isOurs[4] = false; isOurs[5] = true; isOurs[6] = false; PartialMerkleTree pmt(7, &isOurs, &txList); cout << "Serializing (partial)" << endl; BinaryData pmtSer = pmt.serialize(); PartialMerkleTree pmt2(7); cout << "Unserializing (partial)" << endl; pmt2.unserialize(pmtSer); cout << "Reserializing (partial)" << endl; BinaryData pmtSer2 = pmt2.serialize(); cout << "Serialized (Partial): " << pmtSer.toHexStr() << endl; cout << "Reserializ (Partial): " << pmtSer.toHexStr() << endl; cout << "Equal? " << (pmtSer==pmtSer2 ? "True" : "False") << endl; cout << "Print Tree:" << endl; pmt2.pprintTree(); ///////////////////////////////////////////////////////////////////////////// cout << "Empty tree" << endl; isOurs[0] = false; isOurs[1] = false; isOurs[2] = false; isOurs[3] = false; isOurs[4] = false; isOurs[5] = false; isOurs[6] = false; PartialMerkleTree pmt3(7, &isOurs, &txList); cout << "Serializing (partial)" << endl; BinaryData pmtSer3 = pmt3.serialize(); PartialMerkleTree pmt4(7); cout << "Unserializing (partial)" << endl; pmt4.unserialize(pmtSer3); cout << "Reserializing (partial)" << endl; BinaryData pmtSer4 = pmt4.serialize(); cout << "Equal? " << (pmtSer3==pmtSer4 ? "True" : "False") << endl; cout << "Empty Serialized: " << pmtSer3.toHexStr() << endl; cout << "Print Tree:" << endl; pmt4.pprintTree(); ///////////////////////////////////////////////////////////////////////////// cout << "Single Node on edge" << endl; isOurs[0] = false; isOurs[1] = false; isOurs[2] = false; isOurs[3] = false; isOurs[4] = false; isOurs[5] = false; isOurs[6] = true; PartialMerkleTree pmt5(7, &isOurs, &txList); cout << "Serializing (partial)" << endl; BinaryData pmtSer5 = pmt5.serialize(); PartialMerkleTree pmt6(7); cout << "Unserializing (partial)" << endl; pmt6.unserialize(pmtSer5); cout << "Reserializing (partial)" << endl; BinaryData pmtSer6 = pmt6.serialize(); cout << "Equal? " << (pmtSer5==pmtSer6 ? "True" : "False") << endl; cout << "Single Serialized: " << pmtSer5.toHexStr() << endl; cout << "Print Tree:" << endl; pmt6.pprintTree(); cout << "Four Tests: " << endl; cout << " " << (pmtSerFull==pmtSerFull2 ? "PASS" : "FAIL") << endl; cout << " " << (pmtSer==pmtSer2 ? "PASS" : "FAIL") << endl; cout << " " << (pmtSer3==pmtSer4 ? "PASS" : "FAIL") << endl; cout << " " << (pmtSer5==pmtSer6 ? "PASS" : "FAIL") << endl; cout << "Super large merkle tree!" << endl; uint32_t testSize = 100000; vector longHash(testSize); vector longBits(testSize); for(uint32_t i=0; i> deadstr; infile >> deadstr >> mem; infile >> deadstr >> nIters; infile >> deadstr >> hexstr; salt.copyFrom( SecureBinaryData::CreateFromHex(string(hexstr, 64))); infile >> deadstr; infile >> deadstr >> hexstr; iv.copyFrom( SecureBinaryData::CreateFromHex(string(hexstr, 64))); infile >> deadstr >> hexstr; cipher.copyFrom( SecureBinaryData::CreateFromHex(string(hexstr, 64))); infile.close(); cout << endl << endl; // Will try this twice, once with correct passphrase, once without SecureBinaryData cipherTry1 = cipher; SecureBinaryData cipherTry2 = cipher; SecureBinaryData newKey; KdfRomix newKdf(mem, nIters, salt); newKdf.printKdfParams(); // First test with the wrong passphrase cout << "Attempting to decrypt with wrong passphrase" << endl; SecureBinaryData passphrase = SecureBinaryData("This is the wrong passphrase"); newKey = newKdf.DeriveKey( passphrase ); CryptoAES().DecryptCFB(cipherTry1, newKey, iv); // Now try correct passphrase cout << "Attempting to decrypt with CORRECT passphrase" << endl; passphrase = SecureBinaryData("This passphrase is tough to guess"); newKey = newKdf.DeriveKey( passphrase ); CryptoAES().DecryptCFB(cipherTry2, newKey, iv); } void TestECDSA(void) { SecureBinaryData msgToSign("This message came from me!"); SecureBinaryData privData = SecureBinaryData().GenerateRandom(32); BTC_PRIVKEY privKey = CryptoECDSA().ParsePrivateKey(privData); BTC_PUBKEY pubKey = CryptoECDSA().ComputePublicKey(privKey); // Test key-match check cout << "Do the pub-priv keypair we just created match? "; cout << (CryptoECDSA().CheckPubPrivKeyMatch(privKey, pubKey) ? 1 : 0) << endl; cout << endl; SecureBinaryData signature = CryptoECDSA().SignData(msgToSign, privKey); cout << "Signature = " << signature.toHexStr() << endl; cout << endl; bool isValid = CryptoECDSA().VerifyData(msgToSign, signature, pubKey); cout << "SigValid? = " << (isValid ? 1 : 0) << endl; cout << endl; // Test signature from blockchain: SecureBinaryData msg = SecureBinaryData::CreateFromHex("0100000001bb664ff716b9dfc831bcc666c1767f362ad467fcfbaf4961de92e45547daab870100000062537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953aeffffffff0280969800000000001976a9140817482d2e97e4be877efe59f4bae108564549f188ac7015a7000000000062537a7652a269537a829178a91480677c5392220db736455533477d0bc2fba65502879b69537a829178a91402d7aa2e76d9066fb2b3c41ff8839a5c81bdca19879b69537a829178a91410039ce4fdb5d4ee56148fe3935b9bfbbe4ecc89879b6953ae0000000001000000"); SecureBinaryData px = SecureBinaryData::CreateFromHex("8c006ff0d2cfde86455086af5a25b88c2b81858aab67f6a3132c885a2cb9ec38"); SecureBinaryData py = SecureBinaryData::CreateFromHex("e700576fd46c7d72d7d22555eee3a14e2876c643cd70b1b0a77fbf46e62331ac"); SecureBinaryData pub65 = SecureBinaryData::CreateFromHex("048c006ff0d2cfde86455086af5a25b88c2b81858aab67f6a3132c885a2cb9ec38e700576fd46c7d72d7d22555eee3a14e2876c643cd70b1b0a77fbf46e62331ac"); //SecureBinaryData sig = SecureBinaryData::CreateFromHex("3046022100d73f633f114e0e0b324d87d38d34f22966a03b072803afa99c9408201f6d6dc6022100900e85be52ad2278d24e7edbb7269367f5f2d6f1bd338d017ca4600087766144"); SecureBinaryData sig = SecureBinaryData::CreateFromHex("d73f633f114e0e0b324d87d38d34f22966a03b072803afa99c9408201f6d6dc6900e85be52ad2278d24e7edbb7269367f5f2d6f1bd338d017ca4600087766144"); pubKey = CryptoECDSA().ParsePublicKey(px,py); isValid = CryptoECDSA().VerifyData(msg, sig, pubKey); cout << "SigValid? = " << (isValid ? 1 : 0) << endl; // Test speed on signature: uint32_t nTest = 50; cout << "Test signature and verification speeds" << endl; cout << "\nTiming Signing"; TIMER_START("SigningTime"); for(uint32_t i=0; i testPubKey(3); testPubKey[0].createFromHex("044f355bdcb7cc0af728ef3cceb9615d90684bb5b2ca5f859ab0f0b704075871aa385b6b1b8ead809ca67454d9683fcf2ba03456d6fe2c4abe2b07f0fbdbb2f1c1"); testPubKey[1].createFromHex("04ed83704c95d829046f1ac27806211132102c34e9ac7ffa1b71110658e5b9d1bdedc416f5cefc1db0625cd0c75de8192d2b592d7e3b00bcfb4a0e860d880fd1fc"); testPubKey[2].createFromHex("042596957532fc37e40486b910802ff45eeaa924548c0e1c080ef804e523ec3ed3ed0a9004acf927666eee18b7f5e8ad72ff100a3bb710a577256fd7ec81eb1cb3"); CryptoPP::ECP & ecp = CryptoECDSA::Get_secp256k1_ECP(); for(uint32_t i=0; i<3; i++) { CryptoPP::Integer pubX, pubY; pubX.Decode(testPubKey[i].getPtr()+1, 32, UNSIGNED); pubY.Decode(testPubKey[i].getPtr()+33, 32, UNSIGNED); BTC_ECPOINT ptPub(pubX, pubY); BinaryData ptFlat(65); BinaryData ptComp(33); ecp.EncodePoint((byte*)ptFlat.getPtr(), ptPub, false); ecp.EncodePoint((byte*)ptComp.getPtr(), ptPub, true); cout << "Point (" << i << "): " << ptFlat.toHexStr() << endl; cout << "Point (" << i << "): " << ptComp.toHexStr() << endl; cout << "Point (" << i << "): " << CryptoECDSA().UncompressPoint(SecureBinaryData(ptComp)).toHexStr() << endl; cout << "Point (" << i << "): " << CryptoECDSA().CompressPoint(SecureBinaryData(testPubKey[i])).toHexStr() << endl; } } void TestReadBlkFileUpdate(string testblockdir, string blkdir) { BlockDataManager_LevelDB & bdm = BlockDataManager_LevelDB::GetInstance(); // Setup the files that will be copied -- sources and destinations vector srcs(7); srcs[0] = testblockdir + string("/blk00000.dat"); srcs[1] = testblockdir + string("/blk00000_test1.dat"); srcs[2] = testblockdir + string("/blk00000_test2.dat"); srcs[3] = testblockdir + string("/blk00001_test3.dat"); srcs[4] = testblockdir + string("/blk00002_test4.dat"); srcs[5] = testblockdir + string("/blk00002_test5.dat"); srcs[6] = testblockdir + string("/blk00003_test5.dat"); vector dsts(7); dsts[0] = blkdir + string("/blk00000.dat"); dsts[1] = blkdir + string("/blk00000.dat"); dsts[2] = blkdir + string("/blk00000.dat"); dsts[3] = blkdir + string("/blk00001.dat"); dsts[4] = blkdir + string("/blk00002.dat"); dsts[5] = blkdir + string("/blk00002.dat"); dsts[6] = blkdir + string("/blk00003.dat"); for(uint32_t i=0; i<7; i++) if( BtcUtils::GetFileSize(dsts[i]) != FILE_DOES_NOT_EXIST ) remove(dsts[i].c_str()); copyFile(srcs[0], dsts[0]); bdm.SetBlkFileLocation(blkdir, 5, 0); bdm.parseEntireBlockchain(); cout << "Top Block: " << bdm.getTopBlockHeight() << endl; uint32_t t = 1; // TEST 1 -- Add one block copyFile(srcs[1], dsts[1]); bdm.readBlkFileUpdate(); cout << "Read block update " << t++ << ": " << bdm.getTopBlockHeight() << endl; // TEST 2 -- Add 3 blocks copyFile(srcs[2], dsts[2]); bdm.readBlkFileUpdate(); cout << "Read block update " << t++ << ": " << bdm.getTopBlockHeight() << endl; // TEST 3 -- Blkfile split with 1 block copyFile(srcs[3], dsts[3]); bdm.readBlkFileUpdate(); cout << "Read block update " << t++ << ": " << bdm.getTopBlockHeight() << endl; // TEST 4 -- Blkfile split with 3 blocks copyFile(srcs[4], dsts[4]); bdm.readBlkFileUpdate(); cout << "Read block update " << t++ << ": " << bdm.getTopBlockHeight() << endl; // TEST 5 -- Add blocks and split copyFile(srcs[5], dsts[5]); copyFile(srcs[6], dsts[6]); bdm.readBlkFileUpdate(); cout << "Read block update " << t++ << ": " << bdm.getTopBlockHeight() << endl; } void TestOutOfOrder(string blkdir) { ///////////////////////////////////////////////////////////////////////////// BlockDataManager_LevelDB & bdm = BlockDataManager_LevelDB::GetInstance(); BinaryData myAddress; BtcWallet wlt; // Main-network addresses // I do not remember anymore what any of these addresses were for ... // All I know is they probably have some tx history.. myAddress.createFromHex("604875c897a079f4db88e5d71145be2093cae194"); wlt.addAddress(myAddress); myAddress.createFromHex("8996182392d6f05e732410de4fc3fa273bac7ee6"); wlt.addAddress(myAddress); myAddress.createFromHex("b5e2331304bc6c541ffe81a66ab664159979125b"); wlt.addAddress(myAddress); myAddress.createFromHex("ebbfaaeedd97bc30df0d6887fd62021d768f5cb8"); wlt.addAddress(myAddress); // P2Pool Address //myAddress.createFromHex("4975703dc910107e2cc1321e632d136803e218e8"); wlt.addAddress(myAddress); // Add some relevant testnet addresses //myAddress.createFromHex("0c6b92101c7025643c346d9c3e23034a8a843e21"); wlt.addAddress(myAddress); //myAddress.createFromHex("34c9f8dc91dfe1ae1c59e76cbe1aa39d0b7fc041"); wlt.addAddress(myAddress); //myAddress.createFromHex("d77561813ca968270d5f63794ddb6aab3493605e"); wlt.addAddress(myAddress); //myAddress.createFromHex("0e0aec36fe2545fb31a41164fb6954adcd96b342"); wlt.addAddress(myAddress); // These two addresses were used at one point for testing unconfirmed balances myAddress.createFromHex("8c61f6a7558af399e404d82beddcc4692db7b30f"); wlt.addAddress(myAddress); myAddress.createFromHex("14445409283ef413f5fb004338377bf042064922"); wlt.addAddress(myAddress); bdm.registerWallet(&wlt); ///////////////////////////////////////////////////////////////////////////// cout << "Reading data from blockchain... (with wallet scan)" << endl; TIMER_START("BDM_Load_Scan_Blockchain_With_Wallet"); bdm.SetBlkFileLocation(blkdir, 4, 1); bdm.parseEntireBlockchain(); TIMER_STOP("BDM_Load_Scan_Blockchain_With_Wallet"); cout << endl << endl; myAddress.createFromHex("11b366edfc0a8b66feebae5c2e25a7b6a5d1cf31"); wlt.addAddress(myAddress); myAddress.createFromHex("e826f4a4381453dcdcf9bfeedffe95de7c86ccbd"); wlt.addAddress(myAddress); bdm.scanBlockchainForTx(wlt); } void TestLevelDB(string testLDBDir, string blkfilepath) { leveldb::DB* ldb; leveldb::Options opts; // Setup the optoins for this particular database opts.create_if_missing = true; //opts.filter_policy = NewBloomFilter(10); /* leveldb::Status stat = leveldb::DB::Open(opts, testLDBDir.c_str(), &ldb); assert(leveldb::ldbCheckStatus(stat)); for(uint32_t i=0; i<10; i++) { uint32_t ncharKey = 2*(i%6)+1; uint32_t ncharVal = 3*(i%8)+1; BinaryData insertKey(ncharKey); BinaryData insertVal(ncharVal); insertKey.fill( (uint8_t)i%255 ); insertVal.fill( (uint8_t)i%256 ); cout << "Inserting: (" << insertKey.toHexStr() << "," << insertVal.toHexStr() << ")" << endl; stat = ldb->Put(leveldb::WriteOptions(), insertKey.toBinStr(), insertVal.toBinStr()); assert(leveldb::ldbCheckStatus(stat)); } leveldb::Iterator* it = ldb->NewIterator(leveldb::ReadOptions()); uint32_t idx = 1; for(it->SeekToFirst(); it->Valid(); it->Next()) { BinaryData key(it->key().ToString()); BinaryData val(it->value().ToString()); cout << idx++ << ": " << key.toHexStr() << ": " << val.toHexStr() << endl; } cout << "Keys in DB: " << idx-1 << endl; string val2; stat = ldb->Get(leveldb::ReadOptions(), "MyKey", &val2); leveldb::ldbCheckStatus(stat); cout << "Plowed through the error..." << endl; delete ldb; //delete opts.filter_policy; */ // Start new blockchain read/write test.... opts.create_if_missing = true; opts.compression = leveldb::kNoCompression; leveldb::Status stat = leveldb::DB::Open(opts, testLDBDir.c_str(), &ldb); assert(leveldb::ldbCheckStatus(stat)); ifstream is(blkfilepath.c_str(), ios::in | ios::binary); assert(is.is_open()); uint64_t filesize = BtcUtils::GetFileSize(blkfilepath); BinaryStreamBuffer bsb; bsb.attachAsStreamBuffer(is, filesize); bool alreadyRead8B = false; uint32_t nextBlkSize; uint64_t nBytesRead = 0; uint32_t nBlkRead = 0; TIMER_START("NaiveScan"); while(bsb.streamPull()) { while(bsb.reader().getSizeRemaining() > 8) { if(!alreadyRead8B) { bsb.reader().advance(4); nextBlkSize = bsb.reader().get_uint32_t(); nBytesRead += 8; } if(bsb.reader().getSizeRemaining() < nextBlkSize) { alreadyRead8B = true; break; } alreadyRead8B = false; BinaryRefReader brr(bsb.reader().getCurrPtr(), nextBlkSize); // Do something with the block just read BinaryData headerHash(32); BinaryData headerRaw(HEADER_SIZE); brr.get_BinaryData(headerRaw, HEADER_SIZE); BtcUtils::getHash256_NoSafetyCheck(headerRaw.getPtr(), HEADER_SIZE, headerHash); stat = ldb->Put(leveldb::WriteOptions(), headerHash.toBinStr(), headerRaw.toBinStr()); assert(leveldb::ldbCheckStatus(stat)); uint32_t nTx = brr.get_var_int(); for(uint32_t itx=0; itxPut(leveldb::WriteOptions(), txHash.toBinStr(), txRaw.toBinStr()); assert(leveldb::ldbCheckStatus(stat)); } nBlkRead++; nBytesRead += nextBlkSize; bsb.reader().advance(nextBlkSize); if(nBlkRead % 5000 == 0) cout << nBlkRead << " blocks read..." << endl; } } TIMER_STOP("NaiveScan"); } void TestLDBScanBlockchain(string testdbpath) { leveldb::Options opts; opts.create_if_missing = true; opts.compression = leveldb::kNoCompression; leveldb::DB* ldb; leveldb::Status stat = leveldb::DB::Open(opts, testdbpath.c_str(), &ldb); assert(leveldb::ldbCheckStatus(stat)); map addrMap; BinaryData addr; // Main-network addresses addr.createFromHex("47b8ad0b1d6803260ce428d9e09e2cd99fd3b359"); addrMap[addr] = 1; addr.createFromHex("59b3d39fd92c9ee0d928e40c2603681d0badb847"); addrMap[addr] = 1; addr.createFromHex("fe3959db250f247ad724f2af5439ca32e8be3db1"); addrMap[addr] = 1; addr.createFromHex("b13dbee832ca3954aff224d77a240f25db5939fe"); addrMap[addr] = 1; map unspentOutPoints; leveldb::Iterator* it = ldb->NewIterator(leveldb::ReadOptions()); uint32_t idx = 1; vector offsetsIn; vector offsetsOut; TIMER_START("Rescan_from_LevelDB"); uint32_t nObj=0; uint64_t allbtc=0; cout << "Entry Lengths: "; for(it->SeekToFirst(); it->Valid(); it->Next()) { BinaryData val(it->value().ToString()); if(val.getSize()==80) // need to add another condition continue; uint32_t txLen = BtcUtils::TxCalcLength(val.getPtr(), &offsetsIn, &offsetsOut); OutPoint op; for(uint32_t iout=0; ioutkey().ToString()); op.setTxOutIndex(iout); unspentOutPoints[op] = val; } } else if(scriptLenFirstByte==67) { // Std spend-coinbase TxOut script static HashString addr20(20); BtcUtils::getHash160_NoSafetyCheck(ptr+2, 65, addr20); if( addrMap.find(addr20) != addrMap.end() ) { uint64_t val = *(uint64_t*)(ptr-8); cout << " Received a TxOut!" << val/1e8 << endl; allbtc += val; op.setTxHash(it->key().ToString()); op.setTxOutIndex(iout); unspentOutPoints[op] = val; } } else { // Do nothing } } if(++nObj % 50000 == 0) cout << "Processed " << nObj << " tx " << endl; } for(it->SeekToFirst(); it->Valid(); it->Next()) { BinaryData val(it->value().ToString()); if(val.getSize()==80) // need to add another condition continue; uint32_t txLen = BtcUtils::TxCalcLength(val.getPtr(), &offsetsIn, &offsetsOut); OutPoint op; map::iterator iter; for(uint32_t iin=0; iinsecond; unspentOutPoints.erase(iter); } } } TIMER_STOP("Rescan_from_LevelDB"); cout << "Total TxOuts: " << allbtc/1e8 << endl; } void TestLdbBlockchainUtils(string blkdir) { BlockDataManager_LevelDB & bdm = BlockDataManager_LevelDB::GetInstance(); bdm.SetBlkFileLocation(blkdir, 4, 1); string pathH("testldb/ldbtestHeaders"); string pathT("testldb/ldbtestTx"); string pathR("testldb/ldbtestTransient"); //bdm.setLevelDBPaths(pathH, pathT, pathR); } armory-0.92.3/cppForSwig/BinaryData.h0000644000000000000000000014633012414772654016111 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// #ifndef _BINARYDATA_H_ #define _BINARYDATA_H_ #include #if defined(_MSC_VER) || defined(__MINGW32__) #if _MSC_PLATFORM_TOOLSET!=110 #include #endif #else #include #include #include #include #ifndef PAGESIZE #include #define PAGESIZE sysconf(_SC_PAGESIZE) #endif #ifndef PAGEFLOOR // "Round" a ptr down to the beginning of the memory page containing it // PAGERANGE gives us a size to lock/map as a multiple of the PAGESIZE #define PAGEFLOOR(ptr,sz) ((void*)(((size_t)(ptr)) & (~(PAGESIZE-1)) )) #define PAGERANGE(ptr,sz) ( (((size_t)(ptr)+(sz)-1) | (PAGESIZE-1)) + 1 - PAGEFLOOR(ptr,sz) ) #endif #endif #include #include #include #include // We can remove these includes (Crypto++ ) if we remove the GenerateRandom() #include "cryptlib.h" #include "osrng.h" #include "log.h" #define DEFAULT_BUFFER_SIZE 32*1048576 #include "UniversalTimer.h" #define READHEX BinaryData::CreateFromHex #define READ_UINT8_LE BinaryData::StrToIntLE #define READ_UINT16_LE BinaryData::StrToIntLE #define READ_UINT32_LE BinaryData::StrToIntLE #define READ_UINT64_LE BinaryData::StrToIntLE #define READ_UINT8_BE BinaryData::StrToIntBE #define READ_UINT16_BE BinaryData::StrToIntBE #define READ_UINT32_BE BinaryData::StrToIntBE #define READ_UINT64_BE BinaryData::StrToIntBE #define READ_UINT8_HEX_LE(A) (READ_UINT8_LE(READHEX(A))) #define READ_UINT16_HEX_LE(A) (READ_UINT16_LE(READHEX(A))) #define READ_UINT32_HEX_LE(A) (READ_UINT32_LE(READHEX(A))) #define READ_UINT64_HEX_LE(A) (READ_UINT64_LE(READHEX(A))) #define READ_UINT8_HEX_BE(A) (READ_UINT8_BE(READHEX(A))) #define READ_UINT16_HEX_BE(A) (READ_UINT16_BE(READHEX(A))) #define READ_UINT32_HEX_BE(A) (READ_UINT32_BE(READHEX(A))) #define READ_UINT64_HEX_BE(A) (READ_UINT64_BE(READHEX(A))) #define WRITE_UINT8_LE BinaryData::IntToStrLE #define WRITE_UINT16_LE BinaryData::IntToStrLE #define WRITE_UINT32_LE BinaryData::IntToStrLE #define WRITE_UINT64_LE BinaryData::IntToStrLE #define WRITE_UINT8_BE BinaryData::IntToStrBE #define WRITE_UINT16_BE BinaryData::IntToStrBE #define WRITE_UINT32_BE BinaryData::IntToStrBE #define WRITE_UINT64_BE BinaryData::IntToStrBE enum ENDIAN { LITTLEENDIAN, BIGENDIAN }; #define LE LITTLEENDIAN #define BE BIGENDIAN using namespace std; class BinaryDataRef; //template class BitPacker; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class BinaryData { public: ///////////////////////////////////////////////////////////////////////////// BinaryData(void) : data_(0) { } explicit BinaryData(size_t sz) { alloc(sz); } BinaryData(uint8_t const * inData, size_t sz) { copyFrom(inData, sz); } BinaryData(uint8_t const * dstart, uint8_t const * dend ) { copyFrom(dstart, dend); } BinaryData(string const & str) { copyFrom(str); } BinaryData(BinaryData const & bd) { copyFrom(bd); } BinaryData(BinaryDataRef const & bdRef); size_t getSize(void) const { return data_.size(); } bool isNull(void) { return (data_.size()==0);} ///////////////////////////////////////////////////////////////////////////// uint8_t const * getPtr(void) const { if(getSize()==0) return NULL; else return &(data_[0]); } ///////////////////////////////////////////////////////////////////////////// uint8_t* getPtr(void) { if(getSize()==0) return NULL; else return &(data_[0]); } BinaryDataRef getRef(void) const; //uint8_t const * getConstPtr(void) const { return &(data_[0]); } ///////////////////////////////////////////////////////////////////////////// // We allocate space as necesssary void copyFrom(uint8_t const * start, uint8_t const * end) { copyFrom( start, (end-start)); } // [start, end) void copyFrom(string const & str) { copyFrom( (uint8_t*)str.c_str(), str.size()); } void copyFrom(BinaryData const & bd) { copyFrom( bd.getPtr(), bd.getSize() ); } void copyFrom(BinaryDataRef const & bdr); void copyFrom(uint8_t const * inData, size_t sz) { if(inData==NULL || sz == 0) alloc(0); else { alloc(sz); memcpy( &(data_[0]), inData, sz); } } ///////////////////////////////////////////////////////////////////////////// // UNSAFE -- you don't know if outData holds enough space for this void copyTo(uint8_t* outData) const { memcpy( outData, &(data_[0]), getSize()); } void copyTo(uint8_t* outData, size_t sz) const { memcpy( outData, &(data_[0]), (size_t)sz); } void copyTo(uint8_t* outData, size_t offset, size_t sz) const { memcpy( outData, &(data_[offset]), (size_t)sz); } void copyTo(BinaryData & bd) const { bd.resize(data_.size()); #ifdef _MSC_VER if(data_.size()) #endif memcpy( bd.getPtr(), &data_[0], data_.size()); } void fill(uint8_t ch) { if(getSize()>0) memset(getPtr(), ch, getSize()); } uint8_t & operator[](int32_t i) { return (i<0 ? data_[getSize()+i] : data_[i]); } uint8_t operator[](int32_t i) const { return (i<0 ? data_[getSize()+i] : data_[i]); } ///////////////////////////////////////////////////////////////////////////// friend ostream& operator<<(ostream& os, BinaryData const & bd) { os << bd.toHexStr(); return os; } ///////////////////////////////////////////////////////////////////////////// BinaryData operator+(BinaryData const & bd2) const { BinaryData out(getSize() + bd2.getSize()); memcpy(out.getPtr(), getPtr(), getSize()); memcpy(out.getPtr()+getSize(), bd2.getPtr(), bd2.getSize()); return out; } ///////////////////////////////////////////////////////////////////////////// // This is about as efficient as we're going to get... BinaryData & append(BinaryData const & bd2) { if(bd2.getSize()==0) return (*this); if(getSize()==0) copyFrom(bd2.getPtr(), bd2.getSize()); else data_.insert(data_.end(), bd2.data_.begin(), bd2.data_.end()); return (*this); } ///////////////////////////////////////////////////////////////////////////// BinaryData & append(BinaryDataRef const & bd2); ///////////////////////////////////////////////////////////////////////////// BinaryData & append(uint8_t const * str, uint32_t sz); ///////////////////////////////////////////////////////////////////////////// BinaryData & append(uint8_t byte) { data_.insert(data_.end(), byte); return (*this); } ///////////////////////////////////////////////////////////////////////////// int32_t find(BinaryDataRef const & matchStr, uint32_t startPos=0); ///////////////////////////////////////////////////////////////////////////// int32_t find(BinaryData const & matchStr, uint32_t startPos=0); ///////////////////////////////////////////////////////////////////////////// bool contains(BinaryDataRef const & matchStr, uint32_t startPos=0); ///////////////////////////////////////////////////////////////////////////// bool contains(BinaryData const & matchStr, uint32_t startPos=0); ///////////////////////////////////////////////////////////////////////////// bool startsWith(BinaryDataRef const & matchStr) const; ///////////////////////////////////////////////////////////////////////////// bool startsWith(BinaryData const & matchStr) const; ///////////////////////////////////////////////////////////////////////////// bool endsWith(BinaryDataRef const & matchStr) const; ///////////////////////////////////////////////////////////////////////////// bool endsWith(BinaryData const & matchStr) const; ///////////////////////////////////////////////////////////////////////////// BinaryDataRef getSliceRef(int32_t start_pos, uint32_t nChar) const; ///////////////////////////////////////////////////////////////////////////// BinaryData getSliceCopy(int32_t start_pos, uint32_t nChar) const; ///////////////////////////////////////////////////////////////////////////// bool operator<(BinaryData const & bd2) const { int minLen = min(getSize(), bd2.getSize()); for(int i=0; i(BinaryData const & bd2) const { int minLen = min(getSize(), bd2.getSize()); for(int i=0; i bd2.data_[i]; } return (getSize() > bd2.getSize()); } ///////////////////////////////////////////////////////////////////////////// // These are always memory-safe void copyTo(string & str) { #ifdef _MSC_VER if(getSize()) #endif str.assign( (char const *)(&(data_[0])), getSize()); } ///////////////////////////////////////////////////////////////////////////// string toBinStr(bool bigEndian=false) const { if(getSize()==0) return string(""); if(bigEndian) { BinaryData out = copySwapEndian(); return string((char const *)(out.getPtr()), getSize()); } else return string((char const *)(getPtr()), getSize()); } char* toCharPtr(void) const { return (char*)(&(data_[0])); } unsigned char* toUCharPtr(void) const { return (unsigned char*)(&(data_[0])); } void resize(size_t sz) { data_.resize(sz); } void reserve(size_t sz) { data_.reserve(sz); } ///////////////////////////////////////////////////////////////////////////// // Swap endianness of the bytes in the index range [pos1, pos2) BinaryData& swapEndian(size_t pos1=0, size_t pos2=0) { if(getSize()==0) return (*this); if(pos2 <= pos1) pos2 = getSize(); size_t totalBytes = pos2-pos1; for(size_t i=0; i<(totalBytes/2); i++) { uint8_t d1 = data_[pos1+i]; data_[pos1+i] = data_[pos2-(i+1)]; data_[pos2-(i+1)] = d1; } return (*this); } ///////////////////////////////////////////////////////////////////////////// // Swap endianness of the bytes in the index range [pos1, pos2) BinaryData copySwapEndian(size_t pos1=0, size_t pos2=0) const { BinaryData bdout(*this); bdout.swapEndian(pos1, pos2); return bdout; } ///////////////////////////////////////////////////////////////////////////// string toHexStr(bool bigEndian=false) const { if(getSize()==0) return string(""); static char hexLookupTable[16] = {'0','1','2','3', '4','5','6','7', '8','9','a','b', 'c','d','e','f' }; BinaryData bdToHex(*this); if(bigEndian) bdToHex.swapEndian(); vector outStr(2*getSize()); for( size_t i=0; i> 4) & 0x0F ]; outStr[2*i+1] = hexLookupTable[ (nextByte ) & 0x0F ]; } return string((char const *)(&(outStr[0])), 2*getSize()); } ///////////////////////////////////////////////////////////////////////////// static BinaryData CreateFromHex(string const & str) { BinaryData out; out.createFromHex(str); return out; } ///////////////////////////////////////////////////////////////////////////// // This is an architecture-agnostic way to serialize integers to little- or // big-endian. Bit-shift & mod will always return the lowest significant // bytes, so we can put them into an array of bytes in the desired order. template static BinaryData IntToStrLE(INTTYPE val) { uint8_t const SZ = sizeof(INTTYPE); BinaryData out(SZ); for(uint8_t i=0; i>=8) out[i] = val % 256; return out; } ///////////////////////////////////////////////////////////////////////////// template static BinaryData IntToStrBE(INTTYPE val) { uint8_t const SZ = sizeof(INTTYPE); BinaryData out(SZ); for(uint8_t i=0; i>=8) out[(SZ-1)-i] = val % 256; return out; } ///////////////////////////////////////////////////////////////////////////// template static INTTYPE StrToIntLE(BinaryData binstr) { uint8_t const SZ = sizeof(INTTYPE); if(binstr.getSize() != SZ) { LOGERR << "StrToInt: strsz: " << binstr.getSize() << " intsz: " << SZ; return (INTTYPE)0; } INTTYPE out = 0; for(uint8_t i=0; i static INTTYPE StrToIntBE(BinaryData binstr) { uint8_t const SZ = sizeof(INTTYPE); if(binstr.getSize() != SZ) { LOGERR << "StrToInt: strsz: " << binstr.getSize() << " intsz: " << SZ; return (INTTYPE)0; } INTTYPE out = 0; for(uint8_t i=0; i static INTTYPE StrToIntLE(uint8_t const * ptr) { INTTYPE out = 0; for(uint8_t i=0; i static INTTYPE StrToIntBE(uint8_t const * ptr) { uint8_t const SZ = sizeof(INTTYPE); INTTYPE out = 0; for(uint8_t i=0; i data_; private: void alloc(size_t sz) { if(sz != getSize()) { data_.clear(); data_.resize(sz); } } }; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class BinaryDataRef { public: ///////////////////////////////////////////////////////////////////////////// BinaryDataRef(void) : ptr_(NULL), nBytes_(0) { // Nothing to put here } ///////////////////////////////////////////////////////////////////////////// BinaryDataRef(uint8_t const * inData, size_t sz) { setRef(inData, sz); } ///////////////////////////////////////////////////////////////////////////// BinaryDataRef(uint8_t const * dstart, uint8_t const * dend ) { setRef(dstart,dend); } ///////////////////////////////////////////////////////////////////////////// BinaryDataRef(BinaryDataRef const & bdr) { ptr_ = bdr.ptr_; nBytes_ = bdr.nBytes_; } ///////////////////////////////////////////////////////////////////////////// BinaryDataRef(BinaryData const & bd) { if(bd.getSize()!=0) { ptr_ = bd.getPtr(); nBytes_ = bd.getSize(); } else { ptr_= NULL; nBytes_ = 0; } } ///////////////////////////////////////////////////////////////////////////// uint8_t const * getPtr(void) const { return ptr_; } size_t getSize(void) const { return nBytes_; } bool isNull(void) { return (ptr_==NULL);} ///////////////////////////////////////////////////////////////////////////// void setRef(uint8_t const * inData, size_t sz) { ptr_ = inData; nBytes_ = sz; } void setRef(uint8_t const * start, uint8_t const * end) { setRef( start, (end-start)); } // [start, end) void setRef(string const & str) { setRef( (uint8_t*)str.c_str(), str.size()); } void setRef(BinaryData const & bd) { setRef( bd.getPtr(), bd.getSize() ); } ///////////////////////////////////////////////////////////////////////////// // UNSAFE -- you don't know if outData holds enough space for this void copyTo(uint8_t* outData) const { memcpy( outData, ptr_, (size_t)nBytes_); } void copyTo(uint8_t* outData, size_t sz) const { memcpy( outData, ptr_, (size_t)sz); } void copyTo(uint8_t* outData, size_t offset, size_t sz) const { memcpy( outData, ptr_+offset, (size_t)sz); } void copyTo(BinaryData & bd) const { bd.resize(nBytes_); memcpy( bd.getPtr(), ptr_, (size_t)nBytes_); } ///////////////////////////////////////////////////////////////////////////// BinaryData copy(void) const { BinaryData outData(nBytes_); copyTo(outData); return outData; } ///////////////////////////////////////////////////////////////////////////// // These are always memory-safe void copyTo(string & str) { str.assign( (char const *)(ptr_), nBytes_); } ///////////////////////////////////////////////////////////////////////////// friend ostream& operator<<(ostream& os, BinaryDataRef const & bd) { os << bd.toHexStr(); return os; } ///////////////////////////////////////////////////////////////////////////// string toBinStr(bool bigEndian=false) const { if(getSize()==0) return string(""); if(bigEndian) { BinaryData out = copy(); return string((char const *)(out.swapEndian().getPtr()), nBytes_); } else return string((char const *)(ptr_), nBytes_); } ///////////////////////////////////////////////////////////////////////////// char* toCharPtr(void) const { return (char*)(ptr_); } unsigned char* toUCharPtr(void) const { return (unsigned char*)(ptr_); } ///////////////////////////////////////////////////////////////////////////// uint8_t const & operator[](int32_t i) const { return (i<0 ? ptr_[nBytes_+i] : ptr_[i]); } bool isValid(void) const { return ptr_ != NULL; } ///////////////////////////////////////////////////////////////////////////// int32_t find(BinaryDataRef const & matchStr, uint32_t startPos=0) { int32_t finalAnswer = -1; if(matchStr.getSize()==0) return startPos; for(int32_t i=startPos; i<=(int32_t)nBytes_-(int32_t)matchStr.nBytes_; i++) { if(matchStr.ptr_[0] != ptr_[i]) continue; for(uint32_t j=0; j nBytes_) return false; for(uint32_t i=0; i nBytes_) return false; for(uint32_t i=0; i nBytes_) return false; for(uint32_t i=0; i nBytes_) return false; for(uint32_t i=0; i nBytes_) { cerr << "getSliceRef: Invalid BinaryData access" << endl; return BinaryDataRef(); } return BinaryDataRef( getPtr()+start_pos, nChar); } ///////////////////////////////////////////////////////////////////////////// BinaryData getSliceCopy(int32_t start_pos, uint32_t nChar) const { if(start_pos < 0) start_pos = nBytes_ + start_pos; if(start_pos + nChar > nBytes_) { cerr << "getSliceRef: Invalid BinaryData access" << endl; return BinaryDataRef(); } return BinaryData( getPtr()+start_pos, nChar); } ///////////////////////////////////////////////////////////////////////////// bool isSameRefAs(BinaryDataRef const & bdRef2) { return (ptr_ == bdRef2.ptr_ && nBytes_ == bdRef2.nBytes_); } ///////////////////////////////////////////////////////////////////////////// bool operator<(BinaryDataRef const & bd2) const { int minLen = min(nBytes_, bd2.nBytes_); for(int i=0; i(BinaryDataRef const & bd2) const { int minLen = min(nBytes_, bd2.nBytes_); for(int i=0; i bd2.ptr_[i]; } return (nBytes_ > bd2.nBytes_); } ///////////////////////////////////////////////////////////////////////////// string toHexStr(bool bigEndian=false) const { if(getSize() == 0) return string(""); static char hexLookupTable[16] = {'0','1','2','3', '4','5','6','7', '8','9','a','b', 'c','d','e','f' }; BinaryData bdToHex(*this); if(bigEndian) bdToHex.swapEndian(); vector outStr(2*nBytes_); for(size_t i=0; i> 4) & 0x0F ]; outStr[2*i+1] = hexLookupTable[ (nextByte ) & 0x0F ]; } return string((char const *)(&(outStr[0])), 2*nBytes_); } /* #ifdef USE_CRYPTOPP static void getHash256(uint8_t const * strToHash, uint32_t nBytes, BinaryData & hashOutput) { static CryptoPP::SHA256 sha256_; if(hashOutput.getSize() != 32) hashOutput.resize(32); sha256_.CalculateDigest(hashOutput.getPtr(), strToHash, nBytes); sha256_.CalculateDigest(hashOutput.getPtr(), hashOutput.getPtr(), 32); } static void getHash256(BinaryDataRef const & strToHash, BinaryData & hashOutput) { static CryptoPP::SHA256 sha256_; if(hashOutput.getSize() != 32) hashOutput.resize(32); sha256_.CalculateDigest(hashOutput.getPtr(), strToHash.getPtr(), strToHash.getSize()); sha256_.CalculateDigest(hashOutput.getPtr(), hashOutput.getPtr(), 32); } static BinaryData getHash256(BinaryDataRef const & strToHash) { static CryptoPP::SHA256 sha256_; BinaryData hashOutput(32); sha256_.CalculateDigest(hashOutput.getPtr(), strToHash.getPtr(), strToHash.getSize()); sha256_.CalculateDigest(hashOutput.getPtr(), hashOutput.getPtr(), 32); return hashOutput; } BinaryData getHash256(void) { static CryptoPP::SHA256 sha256_; BinaryData hashOutput(32); sha256_.CalculateDigest(hashOutput.getPtr(), ptr_, nBytes_); sha256_.CalculateDigest(hashOutput.getPtr(), hashOutput.getPtr(), 32); return hashOutput; } #endif */ private: uint8_t const * ptr_; uint32_t nBytes_; private: }; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class BinaryReader { public: ///////////////////////////////////////////////////////////////////////////// BinaryReader(int sz=0) : bdStr_(sz), pos_(0) { // Nothing needed here } ///////////////////////////////////////////////////////////////////////////// BinaryReader(BinaryData const & toRead) { setNewData(toRead); } ///////////////////////////////////////////////////////////////////////////// BinaryReader(uint8_t* ptr, uint32_t nBytes) { setNewData(ptr, nBytes); } ///////////////////////////////////////////////////////////////////////////// void setNewData(BinaryData const & toRead) { bdStr_ = toRead; pos_ = 0; } ///////////////////////////////////////////////////////////////////////////// void setNewData(uint8_t* ptr, uint32_t nBytes) { bdStr_ = BinaryData(ptr, nBytes); pos_ = 0; } ///////////////////////////////////////////////////////////////////////////// void advance(uint32_t nBytes) { pos_ += nBytes; pos_ = min(pos_, getSize()); } ///////////////////////////////////////////////////////////////////////////// void rewind(uint32_t nBytes) { pos_ -= nBytes; pos_ = max(pos_, (uint32_t)0); } ///////////////////////////////////////////////////////////////////////////// void resize(uint32_t nBytes) { bdStr_.resize(nBytes); pos_ = min(nBytes, pos_); } ///////////////////////////////////////////////////////////////////////////// uint64_t get_var_int(uint8_t* nRead=NULL); ///////////////////////////////////////////////////////////////////////////// uint8_t get_uint8_t(ENDIAN e=LE) { uint8_t outVal = bdStr_[pos_]; pos_ += 1; return outVal; } ///////////////////////////////////////////////////////////////////////////// uint16_t get_uint16_t(ENDIAN e=LE) { uint16_t outVal = (e==LE ? READ_UINT16_LE(bdStr_.getPtr() + pos_) : READ_UINT16_BE(bdStr_.getPtr() + pos_)); pos_ += 2; return outVal; } ///////////////////////////////////////////////////////////////////////////// uint32_t get_uint32_t(ENDIAN e=LE) { uint32_t outVal = (e==LE ? READ_UINT32_LE(bdStr_.getPtr() + pos_) : READ_UINT32_BE(bdStr_.getPtr() + pos_)); pos_ += 4; return outVal; } ///////////////////////////////////////////////////////////////////////////// uint64_t get_uint64_t(ENDIAN e=LE) { uint64_t outVal = (e==LE ? READ_UINT64_LE(bdStr_.getPtr() + pos_) : READ_UINT64_BE(bdStr_.getPtr() + pos_)); pos_ += 8; return outVal; } ///////////////////////////////////////////////////////////////////////////// void get_BinaryData(BinaryData & bdTarget, uint32_t nBytes) { bdTarget.copyFrom( bdStr_.getPtr() + pos_, nBytes); pos_ += nBytes; } ///////////////////////////////////////////////////////////////////////////// void get_BinaryData(uint8_t* targPtr, uint32_t nBytes) { bdStr_.copyTo(targPtr, pos_, nBytes); pos_ += nBytes; } ///////////////////////////////////////////////////////////////////////////// // Take the remaining buffer and shift it to the front // then return a pointer to where the old data ends // // // Before: pos // | // V // [ a b c d e f g h i j k l m n o p q r s t] // // After: pos return* // | | // V V // [ m n o p q r s t - - - - - - - - - - - -] // // pair rotateRemaining(void) { uint32_t nRemain = getSizeRemaining(); //if(pos_ > nRemain+1) //memcpy(bdStr_.getPtr(), bdStr_.getPtr() + pos_, nRemain); //else memmove(bdStr_.getPtr(), bdStr_.getPtr() + pos_, nRemain); pos_ = 0; return make_pair(bdStr_.getPtr() + nRemain, getSize() - nRemain); } ///////////////////////////////////////////////////////////////////////////// void resetPosition(void) { pos_ = 0; } uint32_t getPosition(void) const { return pos_; } uint32_t getSize(void) const { return bdStr_.getSize(); } uint32_t getSizeRemaining(void) const { return getSize() - pos_; } bool isEndOfStream(void) const { return pos_ >= getSize(); } uint8_t* exposeDataPtr(void) { return bdStr_.getPtr(); } uint8_t const * getCurrPtr(void) { return bdStr_.getPtr() + pos_; } private: BinaryData bdStr_; uint32_t pos_; }; class BinaryRefReader { public: ///////////////////////////////////////////////////////////////////////////// BinaryRefReader(int sz=0) : bdRef_(), totalSize_(sz), pos_(0) { // Nothing needed here } ///////////////////////////////////////////////////////////////////////////// BinaryRefReader(BinaryData const & toRead) { setNewData(toRead); } BinaryRefReader(BinaryDataRef const & toRead) { setNewData(toRead); } // Default to INF size -- leave it to the user to guarantee that he's // not reading past the end of rawPtr BinaryRefReader(uint8_t const * rawPtr, uint32_t nBytes=UINT32_MAX) { setNewData(rawPtr, nBytes); } void setNewData(BinaryData const & toRead) { setNewData(toRead.getPtr(), toRead.getSize()); } void setNewData(BinaryDataRef const & toRead) { setNewData(toRead.getPtr(), toRead.getSize()); } void setNewData(uint8_t const * ptr, uint32_t nBytes=UINT32_MAX) { bdRef_ = BinaryDataRef(ptr, nBytes); totalSize_ = nBytes; pos_ = 0; } ///////////////////////////////////////////////////////////////////////////// void advance(uint32_t nBytes) { pos_ += nBytes; pos_ = min(pos_, totalSize_); } ///////////////////////////////////////////////////////////////////////////// void rewind(uint32_t nBytes) { uint32_t start = pos_; pos_ -= nBytes; if(pos_ > start) pos_ = (uint32_t)0; } ///////////////////////////////////////////////////////////////////////////// uint64_t get_var_int(uint8_t* nRead=NULL); ///////////////////////////////////////////////////////////////////////////// uint8_t get_uint8_t(ENDIAN e=LE) { uint8_t outVal = bdRef_[pos_]; pos_ += 1; return outVal; } ///////////////////////////////////////////////////////////////////////////// uint16_t get_uint16_t(ENDIAN e=LE) { uint16_t outVal = (e==LE ? READ_UINT16_LE(bdRef_.getPtr() + pos_) : READ_UINT16_BE(bdRef_.getPtr() + pos_) ); pos_ += 2; return outVal; } ///////////////////////////////////////////////////////////////////////////// uint32_t get_uint32_t(ENDIAN e=LE) { uint32_t outVal = (e==LE ? READ_UINT32_LE(bdRef_.getPtr() + pos_) : READ_UINT32_BE(bdRef_.getPtr() + pos_) ); pos_ += 4; return outVal; } ///////////////////////////////////////////////////////////////////////////// uint64_t get_uint64_t(ENDIAN e=LE) { uint64_t outVal = (e==LE ? READ_UINT64_LE(bdRef_.getPtr() + pos_) : READ_UINT64_BE(bdRef_.getPtr() + pos_) ); pos_ += 8; return outVal; } ///////////////////////////////////////////////////////////////////////////// BinaryDataRef get_BinaryDataRef(uint32_t nBytes) { BinaryDataRef bdrefout(bdRef_.getPtr() + pos_, nBytes); pos_ += nBytes; return bdrefout; } ///////////////////////////////////////////////////////////////////////////// void get_BinaryData(BinaryData & bdTarget, uint32_t nBytes) { bdTarget.copyFrom( bdRef_.getPtr() + pos_, nBytes); pos_ += nBytes; } ///////////////////////////////////////////////////////////////////////////// BinaryData get_BinaryData(uint32_t nBytes) { BinaryData out; get_BinaryData(out, nBytes); return out; } ///////////////////////////////////////////////////////////////////////////// void get_BinaryData(uint8_t* targPtr, uint32_t nBytes) { bdRef_.copyTo(targPtr, pos_, nBytes); pos_ += nBytes; } ///////////////////////////////////////////////////////////////////////////// void resetPosition(void) { pos_ = 0; } uint32_t getPosition(void) const { return pos_; } uint32_t getSize(void) const { return totalSize_; } uint32_t getSizeRemaining(void) const { return totalSize_ - pos_; } bool isEndOfStream(void) const { return pos_ >= totalSize_; } uint8_t const * exposeDataPtr(void) { return bdRef_.getPtr(); } uint8_t const * getCurrPtr(void) { return bdRef_.getPtr() + pos_; } ///////////////////////////////////////////////////////////////////////////// BinaryDataRef getRawRef(void) { return bdRef_; } private: BinaryDataRef bdRef_; uint32_t totalSize_; uint32_t pos_; }; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // This is only intended to be used for the four datatypes: // uint8_t, uint16_t, uint32_t, uint64_t // Simplicity is what makes this so useful template class BitPacker { public: BitPacker(void) : intVal_(0), bitsUsed_(0) {} void putBits(DTYPE val, uint32_t bitWidth) { uint8_t const SZ = sizeof(DTYPE); if(bitsUsed_ + bitWidth > SZ*8) LOGERR << "Tried to put bits beyond end of bit field"; if(bitsUsed_==0 && bitWidth==SZ*8) { bitsUsed_ = SZ*8; intVal_ = val; return; } uint32_t shiftAmt = SZ*8 - (bitsUsed_ + bitWidth); DTYPE mask = (DTYPE)((1ULL<(intVal_); } // Disabling this to avoid inadvertantly using it to write out // data in the wrong endianness. (instead, always use getBinaryData // or writeToStream //DTYPE getValue(void) { return intVal_; } void reset(void) { intVal_ = 0; bitsUsed_ = 0; } private: DTYPE intVal_; uint32_t bitsUsed_; }; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // This is only intended to be used for the four datatypes: // uint8_t, uint16_t, uint32_t, uint64_t // Simplicity is what makes this so useful template class BitUnpacker { public: BitUnpacker(void) {bitsRead_=0xffffffff;} BitUnpacker(DTYPE valToRead) {setValue(valToRead);} BitUnpacker(BinaryRefReader & brr) { BinaryData bytes = brr.get_BinaryData(sizeof(DTYPE)); setValue( BinaryData::StrToIntBE(bytes) ); } void setValue(DTYPE val) { intVal_ = val; bitsRead_ = 0; } DTYPE getBits(uint32_t bitWidth) { uint8_t const SZ = sizeof(DTYPE); if(bitsRead_==0 && bitWidth==SZ*8) { bitsRead_ = bitWidth; return intVal_; } uint32_t shiftAmt = SZ*8 - (bitsRead_ + bitWidth); DTYPE mask = (DTYPE)((1ULL<> shiftAmt) & mask); } bool getBit(void) { return (getBits(1) > 0); } void reset(void) { intVal_ = 0; bitsRead_ = 0; } private: DTYPE intVal_; uint32_t bitsRead_; }; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class BinaryWriter { public: ///////////////////////////////////////////////////////////////////////////// // Using the argument to pre-allocate a certain amount of capacity. Not // required, but will improve performance if you can take a reasonable guess // about the final size of the output data BinaryWriter(uint32_t reserveSize=0) : theString_(0) { if(reserveSize != 0) theString_.reserve(reserveSize); } ///////////////////////////////////////////////////////////////////////////// void reserve(size_t sz) { theString_.reserve(sz); } ///////////////////////////////////////////////////////////////////////////// // These write data properly regardless of the architecture void put_uint8_t (uint8_t val, ENDIAN e=LE) { theString_.append( val ); } ///// void put_uint16_t(uint16_t val, ENDIAN e=LE) { BinaryData out = (e==LE ? WRITE_UINT16_LE(val) : WRITE_UINT16_BE(val)); theString_.append( out.getPtr(), 2); } ///// void put_uint32_t(uint32_t val, ENDIAN e=LE) { BinaryData out = (e==LE ? WRITE_UINT32_LE(val) : WRITE_UINT32_BE(val)); theString_.append( out.getPtr(), 4); } ///// void put_uint64_t(uint64_t val, ENDIAN e=LE) { BinaryData out = (e==LE ? WRITE_UINT64_LE(val) : WRITE_UINT64_BE(val)); theString_.append( out.getPtr(), 8); } ///////////////////////////////////////////////////////////////////////////// uint8_t put_var_int(uint64_t val) { if(val < 0xfd) { put_uint8_t((uint8_t)val); return 1; } else if(val <= UINT16_MAX) { put_uint8_t(0xfd); put_uint16_t((uint16_t)val); return 3; } else if(val <= UINT32_MAX) { put_uint8_t(0xfe); put_uint32_t((uint32_t)val); return 5; } else { put_uint8_t(0xff); put_uint64_t(val); return 9; } } ///////////////////////////////////////////////////////////////////////////// void put_BinaryData(BinaryData const & str, uint32_t offset=0, uint32_t sz=0) { if(offset==0) { if(sz==0) theString_.append(str); else theString_.append(str.getPtr(), sz); } else { if(sz==0) theString_.append(str.getPtr() + offset, str.getSize() - offset); else theString_.append(str.getPtr() + offset, sz); } } ///////////////////////////////////////////////////////////////////////////// void put_BinaryData(uint8_t const * targPtr, uint32_t nBytes) { theString_.append(targPtr, nBytes); } ///////////////////////////////////////////////////////////////////////////// template void put_BitPacker(BitPacker & bp) { put_BinaryData(bp.getBinaryData()); } ///////////////////////////////////////////////////////////////////////////// BinaryData const & getData(void) { return theString_; } ///////////////////////////////////////////////////////////////////////////// uint32_t getSize(void) { return theString_.getSize(); } ///////////////////////////////////////////////////////////////////////////// BinaryDataRef getDataRef(void) { return theString_.getRef(); } ///////////////////////////////////////////////////////////////////////////// string toString(void) { return theString_.toBinStr(); } ///////////////////////////////////////////////////////////////////////////// string toHex(void) { return theString_.toHexStr(); } ///////////////////////////////////////////////////////////////////////////// void reset(void) { theString_.resize(0); } private: BinaryData theString_; }; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class BinaryStreamBuffer { public: ///////////////////////////////////////////////////////////////////////////// BinaryStreamBuffer(string filename="", uint32_t bufSize=DEFAULT_BUFFER_SIZE) : binReader_(bufSize), streamPtr_(NULL), weOwnTheStream_(false), bufferSize_(bufSize), fileBytesRemaining_(0) { if( filename.size() > 0 ) { streamPtr_ = new ifstream; weOwnTheStream_ = true; ifstream* ifstreamPtr = static_cast(streamPtr_); ifstreamPtr->open(OS_TranslatePath(filename.c_str()), ios::in | ios::binary); if( !ifstreamPtr->is_open() ) { cerr << "Could not open file for reading! File: " << filename.c_str() << endl; cerr << "Aborting!" << endl; assert(false); } ifstreamPtr->seekg(0, ios::end); totalStreamSize_ = (uint32_t)ifstreamPtr->tellg(); fileBytesRemaining_ = totalStreamSize_; ifstreamPtr->seekg(0, ios::beg); } } ///////////////////////////////////////////////////////////////////////////// void attachAsStreamBuffer(istream & is, uint32_t streamSize, uint32_t bufSz=DEFAULT_BUFFER_SIZE) { if(streamPtr_ != NULL && weOwnTheStream_) { static_cast(streamPtr_)->close(); delete streamPtr_; } streamPtr_ = &is; fileBytesRemaining_ = streamSize; totalStreamSize_ = streamSize; bufferSize_ = bufSz; binReader_.resize(bufferSize_); } ///////////////////////////////////////////////////////////////////////////// // Refills the buffer from the stream, returns true if there is more data // left in the stream bool streamPull(void) { SCOPED_TIMER("StreamPull"); uint32_t prevBufSizeRemain = binReader_.getSizeRemaining(); if(fileBytesRemaining_ == 0) return false; if( binReader_.getPosition() <= 0) { // No data to shuffle, just pull from the stream buffer if(fileBytesRemaining_ > binReader_.getSize()) { // Enough left in the stream to fill the entire buffer streamPtr_->read((char*)(binReader_.exposeDataPtr()), binReader_.getSize()); fileBytesRemaining_ -= binReader_.getSize(); } else { // The buffer is bigger than the remaining stream size streamPtr_->read((char*)(binReader_.exposeDataPtr()), fileBytesRemaining_); binReader_.resize(fileBytesRemaining_); fileBytesRemaining_ = 0; } } else { // The buffer needs to be refilled but has leftover data at the end pair leftover = binReader_.rotateRemaining(); uint8_t* putNewDataPtr = leftover.first; uint32_t numBytes = leftover.second; if(fileBytesRemaining_ > numBytes) { // Enough data left in the stream to fill the entire buffer streamPtr_->read((char*)putNewDataPtr, numBytes); fileBytesRemaining_ -= numBytes; } else { // The buffer is bigger than the remaining stream size streamPtr_->read((char*)putNewDataPtr, fileBytesRemaining_); binReader_.resize(fileBytesRemaining_+ prevBufSizeRemain); fileBytesRemaining_ = 0; } } return true; } ///////////////////////////////////////////////////////////////////////////// BinaryReader& reader(void) { return binReader_; } ///////////////////////////////////////////////////////////////////////////// uint32_t getFileByteLocation(void) { return totalStreamSize_ - (fileBytesRemaining_ + binReader_.getSizeRemaining()); } uint32_t getBufferSizeRemaining(void) { return binReader_.getSizeRemaining(); } uint32_t getFileSizeRemaining(void) { return fileBytesRemaining_; } uint32_t getBufferSize(void) { return binReader_.getSize(); } private: BinaryReader binReader_; istream* streamPtr_; bool weOwnTheStream_; uint32_t bufferSize_; uint32_t totalStreamSize_; uint32_t fileBytesRemaining_; }; #endif armory-0.92.3/cppForSwig/BlockUtils.cpp0000644000000000000000000065421412414772654016506 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// #include #include #include #include "BlockUtils.h" static void updateBlkDataHeader(InterfaceToLDB* iface, StoredHeader const & sbh) { iface->putValue(BLKDATA, sbh.getDBKey(), sbh.serializeDBValue(BLKDATA)); } //////////////////////////////////////////////////////////////////////////////// static StoredTx* makeSureSTXInMap( InterfaceToLDB* iface, BinaryDataRef txHash, map & stxMap, uint64_t* additionalSize) { // TODO: If we are pruning, we may have completely removed this tx from // the DB, which means that it won't be in the map or the DB. // But this method was written before pruning was ever implemented... StoredTx * stxptr; // Get the existing STX or make a new one map::iterator txIter = stxMap.find(txHash); if(ITER_IN_MAP(txIter, stxMap)) stxptr = &(txIter->second); else { StoredTx stxTemp; iface->getStoredTx(stxTemp, txHash); stxMap[txHash] = stxTemp; stxptr = &stxMap[txHash]; if (additionalSize) *additionalSize += stxptr->numBytes_; } return stxptr; } //////////////////////////////////////////////////////////////////////////////// // This avoids having to do the double-lookup when fetching by hash. // We still pass in the hash anyway, because the map is indexed by the hash, // and we'd like to not have to do a lookup for the hash if only provided // {hgt, dup, idx} static StoredTx* makeSureSTXInMap( InterfaceToLDB* iface, uint32_t hgt, uint8_t dup, uint16_t txIdx, BinaryDataRef txHash, map & stxMap, uint64_t* additionalSize) { StoredTx * stxptr; // Get the existing STX or make a new one map::iterator txIter = stxMap.find(txHash); if(ITER_IN_MAP(txIter, stxMap)) stxptr = &(txIter->second); else { StoredTx &stxTemp = stxMap[txHash]; iface->getStoredTx(stxTemp, hgt, dup, txIdx); stxptr = &stxMap[txHash]; if (additionalSize) *additionalSize += stxptr->numBytes_; } return stxptr; } static StoredScriptHistory* makeSureSSHInMap( InterfaceToLDB* iface, BinaryDataRef uniqKey, BinaryDataRef hgtX, map & sshMap, uint64_t* additionalSize, bool createIfDNE=true) { SCOPED_TIMER("makeSureSSHInMap"); StoredScriptHistory * sshptr; // If already in Map map::iterator iter = sshMap.find(uniqKey); if(ITER_IN_MAP(iter, sshMap)) { SCOPED_TIMER("___SSH_AlreadyInMap"); sshptr = &(iter->second); } else { StoredScriptHistory sshTemp; iface->getStoredScriptHistorySummary(sshTemp, uniqKey); // sshTemp.alreadyScannedUpToBlk_ = getAppliedToHeightInDB(); TODO if (additionalSize) *additionalSize += UPDATE_BYTES_SSH; if(sshTemp.isInitialized()) { SCOPED_TIMER("___SSH_AlreadyInDB"); // We already have an SSH in DB -- pull it into the map sshMap[uniqKey] = sshTemp; sshptr = &sshMap[uniqKey]; } else { SCOPED_TIMER("___SSH_NeedCreate"); if(!createIfDNE) return NULL; sshMap[uniqKey] = StoredScriptHistory(); sshptr = &sshMap[uniqKey]; sshptr->uniqueKey_ = uniqKey; } } // If sub-history for this block doesn't exist, add an empty one before // returning the pointer to the SSH. Since we haven't actually inserted // anything into the SubSSH, we don't need to adjust the totalTxioCount_ uint32_t prevSize = sshptr->subHistMap_.size(); iface->fetchStoredSubHistory(*sshptr, hgtX, true, false); uint32_t newSize = sshptr->subHistMap_.size(); if (additionalSize) *additionalSize += (newSize - prevSize) * UPDATE_BYTES_SUBSSH; return sshptr; } BlockDataManager_LevelDB* BlockDataManager_LevelDB::theOnlyBDM_ = NULL; vector BtcWallet::EmptyLedger_(0); InterfaceToLDB* BlockDataManager_LevelDB::iface_=NULL; bool BlockDataManager_LevelDB::bdmCreatedYet_=false; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // // LedgerEntry // //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// bool LedgerEntry::operator<(LedgerEntry const & le2) const { // TODO: I wanted to update this with txTime_, but I didn't want to c // complicate the mess of changes going in, yet. Do this later // once everything is stable again. //if( blockNum_ != le2.blockNum_) //return blockNum_ < le2.blockNum_; //else if( index_ != le2.index_) //return index_ < le2.index_; //else if( txTime_ != le2.txTime_) //return txTime_ < le2.txTime_; //else //return false; if( blockNum_ != le2.blockNum_) return blockNum_ < le2.blockNum_; else if( index_ != le2.index_) return index_ < le2.index_; else return false; } ////////////////////////////////////////////////////////////////////////////// bool LedgerEntry::operator==(LedgerEntry const & le2) const { //TODO //return (blockNum_ == le2.blockNum_ && //index_ == le2.index_ && //txTime_ == le2.txTime_); return (blockNum_ == le2.blockNum_ && index_ == le2.index_); } ////////////////////////////////////////////////////////////////////////////// void LedgerEntry::pprint(void) { cout << "LedgerEntry: " << endl; cout << " ScrAddr : " << getScrAddr().toHexStr() << endl; cout << " Value : " << getValue()/1e8 << endl; cout << " BlkNum : " << getBlockNum() << endl; cout << " TxHash : " << getTxHash().toHexStr() << endl; cout << " TxIndex : " << getIndex() << endl; cout << " isValid : " << (isValid() ? 1 : 0) << endl; cout << " Coinbase: " << (isCoinbase() ? 1 : 0) << endl; cout << " sentSelf: " << (isSentToSelf() ? 1 : 0) << endl; cout << " isChange: " << (isChangeBack() ? 1 : 0) << endl; cout << endl; } ////////////////////////////////////////////////////////////////////////////// void LedgerEntry::pprintOneLine(void) { printf(" Addr:%s Tx:%s:%02d BTC:%0.3f Blk:%06d\n", " ", getTxHash().getSliceCopy(0,8).toHexStr().c_str(), getIndex(), getValue()/1e8, getBlockNum()); } //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // // ScrAddrObj Methods // //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// ScrAddrObj::ScrAddrObj(HashString addr, uint32_t firstBlockNum, uint32_t firstTimestamp, uint32_t lastBlockNum, uint32_t lastTimestamp) : scrAddr_(addr), firstBlockNum_(firstBlockNum), firstTimestamp_(firstTimestamp), lastBlockNum_(lastBlockNum), lastTimestamp_(lastTimestamp) { relevantTxIOPtrs_.clear(); relevantTxIOPtrsZC_.clear(); } //////////////////////////////////////////////////////////////////////////////// uint64_t ScrAddrObj::getSpendableBalance(uint32_t currBlk, bool ignoreAllZC) { uint64_t balance = 0; for(uint32_t i=0; iisSpendable(currBlk, ignoreAllZC)) balance += relevantTxIOPtrs_[i]->getValue(); } for(uint32_t i=0; iisSpendable(currBlk, ignoreAllZC)) balance += relevantTxIOPtrsZC_[i]->getValue(); } return balance; } //////////////////////////////////////////////////////////////////////////////// uint64_t ScrAddrObj::getUnconfirmedBalance(uint32_t currBlk, bool inclAllZC) { uint64_t balance = 0; for(uint32_t i=0; iisMineButUnconfirmed(currBlk, inclAllZC)) balance += relevantTxIOPtrs_[i]->getValue(); } for(uint32_t i=0; iisMineButUnconfirmed(currBlk, inclAllZC)) balance += relevantTxIOPtrsZC_[i]->getValue(); } return balance; } //////////////////////////////////////////////////////////////////////////////// uint64_t ScrAddrObj::getFullBalance(void) { uint64_t balance = 0; for(uint32_t i=0; i ScrAddrObj::getSpendableTxOutList(uint32_t blkNum, bool ignoreAllZC) { vector utxoList(0); for(uint32_t i=0; i ScrAddrObj::getFullTxOutList(uint32_t blkNum) { vector utxoList(0); for(uint32_t i=0; i newLedger(0); uint32_t leRemoved = 0; for(uint32_t i=0; iregisterImportedScrAddr(scrAddr, firstBlockNum); } ///////////////////////////////////////////////////////////////////////////// void BtcWallet::addNewScrAddress(BinaryData scrAddr) { //if(scrAddrMap_.find(scrAddr) != scrAddrMap_.end()) if(KEY_IN_MAP(scrAddr, scrAddrMap_)) return; ScrAddrObj* addrPtr = &(scrAddrMap_[scrAddr]); *addrPtr = ScrAddrObj(scrAddr, 0,0, 0,0); scrAddrPtrs_.push_back(addrPtr); if(bdmPtr_!=NULL) bdmPtr_->registerNewScrAddr(scrAddr); } ///////////////////////////////////////////////////////////////////////////// void BtcWallet::addScrAddress(ScrAddrObj const & newScrAddr) { //if(scrAddrMap_.find(newScrAddr.getScrAddr()) != scrAddrMap_.end()) if(KEY_IN_MAP(newScrAddr.getScrAddr(), scrAddrMap_)) return; if(newScrAddr.getScrAddr().getSize() > 0) { ScrAddrObj * addrPtr = &(scrAddrMap_[newScrAddr.getScrAddr()]); *addrPtr = newScrAddr; scrAddrPtrs_.push_back(addrPtr); } if(bdmPtr_!=NULL) bdmPtr_->registerImportedScrAddr(newScrAddr.getScrAddr(), newScrAddr.getFirstBlockNum()); } ///////////////////////////////////////////////////////////////////////////// // SWIG has some serious problems with typemaps and variable arg lists // Here I just create some extra functions that sidestep all the problems // but it would be nice to figure out "typemap typecheck" in SWIG... void BtcWallet::addScrAddress_ScrAddrObj_(ScrAddrObj const & newScrAddr) { addScrAddress(newScrAddr); } ///////////////////////////////////////////////////////////////////////////// void BtcWallet::addScrAddress_1_(HashString scrAddr) { addScrAddress(scrAddr); } ///////////////////////////////////////////////////////////////////////////// void BtcWallet::addScrAddress_3_(HashString scrAddr, uint32_t firstTimestamp, uint32_t firstBlockNum) { addScrAddress(scrAddr, firstBlockNum, firstTimestamp); } ///////////////////////////////////////////////////////////////////////////// void BtcWallet::addScrAddress_5_(HashString scrAddr, uint32_t firstTimestamp, uint32_t firstBlockNum, uint32_t lastTimestamp, uint32_t lastBlockNum) { addScrAddress(scrAddr, firstBlockNum, firstTimestamp, lastBlockNum, lastTimestamp); } ///////////////////////////////////////////////////////////////////////////// bool BtcWallet::hasScrAddress(HashString const & scrAddr) const { //return scrAddrMap_.find(scrAddr) != scrAddrMap_.end(); return KEY_IN_MAP(scrAddr, scrAddrMap_); } ///////////////////////////////////////////////////////////////////////////// pair BtcWallet::isMineBulkFilter(Tx & tx, bool withSecondOrderMultisig) const { return isMineBulkFilter(tx, txioMap_, withSecondOrderMultisig); } ///////////////////////////////////////////////////////////////////////////// // Determine, as fast as possible, whether this tx is relevant to us // Return pair BtcWallet::isMineBulkFilter( Tx & tx, map const & txiomap, bool withSecondOrderMultisig) const { // Since 99.999%+ of all transactions are not ours, let's do the // fastest bulk filter possible, even though it will add // redundant computation to the tx that are ours. In fact, // we will skip the TxIn/TxOut convenience methods and follow the // pointers directly to the data we want uint8_t const * txStartPtr = tx.getPtr(); for(uint32_t iin=0; iin(true,true); } // Simply convert the TxOut scripts to scrAddrs and check if registered for(uint32_t iout=0; iout(true,false); // It's still possible this is a multisig addr involving one of our // existing scrAddrs, even if we aren't explicitly looking for this multisig if(withSecondOrderMultisig && txout.getScriptType()==TXOUT_SCRIPT_MULTISIG) { BinaryRefReader brrmsig(scrAddr); uint8_t PREFIX = brrmsig.get_uint8_t(); uint8_t M = brrmsig.get_uint8_t(); uint8_t N = brrmsig.get_uint8_t(); for(uint8_t a=0; a(true,false); } } // If we got here, it's either non std or not ours return pair(false,false); } ///////////////////////////////////////////////////////////////////////////// void BtcWallet::pprintAlot(uint32_t topBlk, bool withAddr) { uint32_t numLedg = ledgerAllAddr_.size(); uint32_t numLedgZC = ledgerAllAddrZC_.size(); cout << "Wallet PPRINT:" << endl; cout << "Tot: " << getFullBalance() << endl; cout << "Spd: " << getSpendableBalance(topBlk) << endl; cout << "Ucn: " << getUnconfirmedBalance(topBlk) << endl; cout << "Ledger: " << endl; for(uint32_t i=0; i::iterator iter; for(iter = txioMap_.begin(); iter != txioMap_.end(); iter++) { iter->second.pprintOneLine(); } if(withAddr) { for(uint32_t i=0; i::iterator iter; for(uint32_t t=0; tpprintOneLine(); } cout << " TxioPtrs (Zero-conf):" << endl; for(uint32_t t=0; tpprintOneLine(); } } } } void BtcWallet::reorgChangeBlkNum(uint32_t newBlkHgt) { if(newBlkHgt with bool true if inserted if(registeredTxSet_.insert(txHash).second == true) { TxRef txref = getTxRefByHash(txHash); RegisteredTx regTx(txref, txref.getThisHash(), txref.getBlockHeight(), txref.getBlockTxIndex()); registeredTxList_.push_back(regTx); } } ///////////////////////////////////////////////////////////////////////////// // TODO: I should investigate whether we should remove registered tx on // a reorg. It doesn't look like we do, though it may also not // matter as long as the scanRegisteredTxForWallet checks for main // branch before processing it. void BlockDataManager_LevelDB::insertRegisteredTxIfNew(TxRef const & txref, BinaryDataRef txHash, uint32_t hgt, uint16_t txIndex) { if(registeredTxSet_.insert(txHash).second == true) { if(txref.isNull()) { LOGERR << "Could not get the tx from the DB, either!"; registeredTxSet_.erase(txHash); return; } RegisteredTx regTx(txref, txHash, hgt, txIndex); registeredTxList_.push_back(regTx); } } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::insertRegisteredTxIfNew(RegisteredTx & regTx) { // .insert() function returns pair with bool true if inserted if(registeredTxSet_.insert(regTx.getTxHash()).second == true) registeredTxList_.push_back(regTx); } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::removeRegisteredTx(BinaryData const & txHash) { list::iterator iter; for(iter = registeredTxList_.begin(); iter != registeredTxList_.end(); iter++) { if(iter->txHash_ == txHash) { registeredTxList_.erase(iter); return true; } } return false; } ///////////////////////////////////////////////////////////////////////////// // This basically does the same thing as the bulk filter, but it's for the // BDM to collect data on registered wallets/addresses during bulk // blockchain scaning. It needs to track relevant OutPoints and produce // a list of transactions that are relevant to the registered wallets. // // Also, this takes a raw pointer to memory, because it is assumed that // the data is being buffered and not converted/parsed for Tx objects, yet. // // If the txSize and offsets have been pre-calculated, you can pass them // in, or pass {0, NULL, NULL} to have it calculated for you. // void BlockDataManager_LevelDB::registeredScrAddrScan( uint8_t const * txptr, uint32_t txSize, vector * txInOffsets, vector * txOutOffsets, bool withSecondOrderMultisig) { // Probably doesn't matter, but I'll keep these on the heap between calls static vector localOffsIn; static vector localOffsOut; if(txSize==0 || txInOffsets==NULL || txOutOffsets==NULL) { txInOffsets = &localOffsIn; txOutOffsets = &localOffsOut; BtcUtils::TxCalcLength(txptr, txSize, txInOffsets, txOutOffsets); } uint32_t nTxIn = txInOffsets->size()-1; uint32_t nTxOut = txOutOffsets->size()-1; if(registeredScrAddrMap_.size() == 0) return; uint8_t const * txStartPtr = txptr; for(uint32_t iin=0; iin 0) { insertRegisteredTxIfNew(BtcUtils::getHash256(txptr, txSize)); break; // we only care if ANY txIns are ours, not which ones } } // We have to scan all TxOuts regardless, to make sure our list of // registeredOutPoints_ is up-to-date so that we can identify TxIns that are // ours on future to-be-scanned transactions for(uint32_t iout=0; ioutiters_[BLKDATA] to be untouched inside // this function. Unfortunately, most TxRef() operations move // the pointer. Even if we move it back, it's likely to break // the efficiency of DB-order iteration. We may consider // creating multiple iterators on the iface_ side. Until then, // we can't use registeredScrAddrScan. // void BlockDataManager_LevelDB::registeredScrAddrScan_IterSafe( StoredTx & stx, vector * txInOffsets, vector * txOutOffsets, bool withSecondOrderMultisig) { if(registeredScrAddrMap_.size() == 0) return; if(!stx.isInitialized()) { LOGERR << "Passed uninitialized STX to regAddrScan"; return; } // Probably doesn't matter, but I'll keep these on the heap between calls vector localOffsIn; vector localOffsOut; Tx tx = stx.getTxCopy(); uint8_t const * txStartPtr = tx.getPtr(); if(txInOffsets==NULL || txOutOffsets==NULL) { txInOffsets = &localOffsIn; txOutOffsets = &localOffsOut; BtcUtils::TxCalcLength(txStartPtr, tx.getSize(), txInOffsets, txOutOffsets); } uint32_t nTxIn = txInOffsets->size()-1; uint32_t nTxOut = txOutOffsets->size()-1; for(uint32_t iin=0; iin 0) { insertRegisteredTxIfNew(tx.getTxRef(), stx.thisHash_, stx.blockHeight_, stx.txIndex_); break; // we only care if ANY txIns are ours, not which ones } } // We have to scan all TxOuts regardless, to make sure our list of // registeredOutPoints_ is up-to-date so that we can identify TxIns that are // ours on future to-be-scanned transactions for(uint32_t iout=0; iout thisTxOutIsOurs(tx.getNumTxOut(), false); pair boolPair = isMineBulkFilter(tx); bool txIsRelevant = boolPair.first; bool anyTxInIsOurs = boolPair.second; if( !txIsRelevant ) return; // We distinguish "any" from "anyNew" because we want to avoid re-adding // transactions/TxIOPairs that are already part of the our tx list/ledger // but we do need to determine if this was sent-to-self, regardless of // whether it was new. bool anyNewTxInIsOurs = false; bool anyNewTxOutIsOurs = false; bool isCoinbaseTx = false; map::iterator addrIter; ScrAddrObj* thisAddrPtr; HashString scraddr; bool savedAsTxIn = false; ///// LOOP OVER ALL TXIN IN TX ///// for(uint32_t iin=0; iin no addr inputs if(outpt.getTxHashRef() == BtcUtils::EmptyHash_) { isCoinbaseTx = true; continue; } // We have the txin, now check if it contains one of our TxOuts map::iterator txioIter = txioMap_.find(outpt); //bool txioWasInMapAlready = (txioIter != txioMap_.end()); bool txioWasInMapAlready = ITER_IN_MAP(txioIter, txioMap_); if(txioWasInMapAlready) { // If we are here, we know that this input is spending an // output owned by this wallet. // We will get here for every address in the search, even // though it is only relevant to one of the addresses. TxIOPair & txio = txioIter->second; TxOut txout = txio.getTxOutCopy(); // It's our TxIn, so address should be in this wallet scraddr = txout.getScrAddressStr(); addrIter = scrAddrMap_.find(scraddr); //if( addrIter == scrAddrMap_.end()) if(ITER_NOT_IN_MAP(addrIter, scrAddrMap_)) { // Have TxIO but address is not in the map...? LOGERR << "ERROR: TxIn in TxIO map, but addr not in wallet...?"; continue; } thisAddrPtr = &addrIter->second; // We need to make sure the ledger entry makes sense, and make // sure we update TxIO objects appropriately int64_t thisVal = (int64_t)txout.getValue(); totalLedgerAmt -= thisVal; // Skip, if zero-conf-spend, but it's already got a zero-conf if( isZeroConf && txio.hasTxInZC() ) return; // this tx can't be valid, might as well bail now if( !txio.hasTxInInMain() && !(isZeroConf && txio.hasTxInZC()) ) { // isValidNew only identifies whether this set-call succeeded // If it didn't, it's because this is from a zero-conf tx but this // TxIn already exists in the blockchain spending the same output. // (i.e. we have a ref to the prev output, but it's been spent!) bool isValidNew; if(isZeroConf) isValidNew = txio.setTxInZC(&tx, iin); else isValidNew = txio.setTxIn(tx.getTxRef(), iin); if(!isValidNew) continue; anyNewTxInIsOurs = true; LedgerEntry newEntry(scraddr, -(int64_t)thisVal, blknum, tx.getThisHash(), iin, txtime, isCoinbaseTx, false, // SentToSelf is meaningless for addr ledger false); // "isChangeBack" is meaningless for TxIn thisAddrPtr->addLedgerEntry(newEntry, isZeroConf); txLedgerForComments_.push_back(newEntry); savedAsTxIn = true; // Update last seen on the network thisAddrPtr->setLastTimestamp(txtime); thisAddrPtr->setLastBlockNum(blknum); } } else { // Lots of txins that we won't have, this is a normal conditional // But we should check the non-std txio list since it may actually // be there //if(nonStdTxioMap_.find(outpt) != nonStdTxioMap_.end()) if(KEY_IN_MAP(outpt, nonStdTxioMap_)) { if(isZeroConf) nonStdTxioMap_[outpt].setTxInZC(&tx, iin); else nonStdTxioMap_[outpt].setTxIn(tx.getTxRef(), iin); nonStdUnspentOutPoints_.erase(outpt); } } } // loop over TxIns //ScrAddrObj & thisAddr = *(scrAddrPtrs_[i]); //HashString const & scraddr = thisAddr.getScrAddr(); ///// LOOP OVER ALL TXOUT IN TX ///// for(uint32_t iout=0; iout -1) //scanNonStdTx(blknum, txIndex, tx, iout, *thisAddrPtr); continue; } scraddr = txout.getScrAddressStr(); addrIter = scrAddrMap_.find(scraddr); //if( addrIter != scrAddrMap_.end()) if(ITER_IN_MAP(addrIter, scrAddrMap_)) { //if( txout.getScriptType() == TXOUT_SCRIPT_MULTISIG ) //LOGINFO << "ScanTx on registered multisig script! "; thisAddrPtr = &addrIter->second; // If we got here, at least this TxOut is for this address. // But we still need to find out if it's new and update // ledgers/TXIOs appropriately int64_t thisVal = (int64_t)(txout.getValue()); totalLedgerAmt += thisVal; OutPoint outpt(tx.getThisHash(), iout); map::iterator txioIter = txioMap_.find(outpt); //bool txioWasInMapAlready = (txioIter != txioMap_.end()); bool txioWasInMapAlready = ITER_IN_MAP(txioIter, txioMap_); bool doAddLedgerEntry = false; if(txioWasInMapAlready) { if(isZeroConf) { // This is a real txOut, in the blockchain if(txioIter->second.hasTxOutZC() || txioIter->second.hasTxOutInMain()) continue; // If we got here, somehow the Txio existed already, but // there was no existing TxOut referenced by it. Probably, // there was, but that TxOut was invalidated due to reorg // and now being re-added txioIter->second.setTxOutZC(&tx, iout); txioIter->second.setValue((uint64_t)thisVal); thisAddrPtr->addTxIO( txioIter->second, isZeroConf); doAddLedgerEntry = true; } else { if(txioIter->second.hasTxOutInMain()) // ...but we already have one continue; // If we got here, we have an in-blockchain TxOut that is // replacing a zero-conf txOut. Reset the txio to have // only this real TxOut, blank out the ZC TxOut. And the addr // relevantTxIOPtrs_ does not have this yet so it needs // to be added (it's already part of the relevantTxIOPtrsZC_ // but that will be removed) txioIter->second.setTxOut(tx.getTxRef(), iout); txioIter->second.setValue((uint64_t)thisVal); thisAddrPtr->addTxIO( txioIter->second, isZeroConf); doAddLedgerEntry = true; } } else { // TxIO is not in the map yet -- create and add it TxIOPair newTxio(thisVal); if(isZeroConf) newTxio.setTxOutZC(&tx, iout); else newTxio.setTxOut(tx.getTxRef(), iout); pair toBeInserted(outpt, newTxio); txioIter = txioMap_.insert(toBeInserted).first; thisAddrPtr->addTxIO( txioIter->second, isZeroConf); doAddLedgerEntry = true; } if(anyTxInIsOurs) txioIter->second.setTxOutFromSelf(true); if(isCoinbaseTx) txioIter->second.setFromCoinbase(true); anyNewTxOutIsOurs = true; thisTxOutIsOurs[iout] = true; if(doAddLedgerEntry) { LedgerEntry newLedger(scraddr, thisVal, blknum, tx.getThisHash(), iout, txtime, isCoinbaseTx, // input was coinbase/generation false, // sentToSelf meaningless for addr ledger false); // we don't actually know thisAddrPtr->addLedgerEntry(newLedger, isZeroConf); if(!savedAsTxIn) txLedgerForComments_.push_back(newLedger); } // Check if this is the first time we've seen this if(thisAddrPtr->getFirstTimestamp() == 0) { thisAddrPtr->setFirstBlockNum( blknum ); thisAddrPtr->setFirstTimestamp( txtime ); } // Update last seen on the network thisAddrPtr->setLastTimestamp(txtime); thisAddrPtr->setLastBlockNum(blknum); } } // loop over TxOuts bool allTxOutIsOurs = true; bool anyTxOutIsOurs = false; for(uint32_t i=0; iclearBlkData(); } //////////////////////////////////////////////////////////////////////////////// // Make a separate method here so we can get creative with how to handle these // scripts and not clutter the regular scanning code void BtcWallet::scanNonStdTx(uint32_t blknum, uint32_t txidx, Tx & tx, uint32_t txoutidx, ScrAddrObj& thisAddr) { TxOut txout = tx.getTxOutCopy(txoutidx); int findIdx = txout.getScriptRef().find(thisAddr.getScrAddr()); if(findIdx > -1) { LOGERR << "ALERT: Found non-standard transaction referencing"; LOGERR << " an address in your wallet. There is no way"; LOGERR << " for this program to determine if you can"; LOGERR << " spend these BTC or not. Please email the"; LOGERR << " following information to support@bitcoinarmory.com"; LOGERR << " for help identifying the transaction and how"; LOGERR << " to spend it:"; LOGERR << " Block Number: " << blknum; LOGERR << " Tx Hash: " << tx.getThisHash().copySwapEndian().toHexStr() << " (BE)"; LOGERR << " TxOut Index: " << txoutidx; LOGERR << " PubKey Hash: " << thisAddr.getScrAddr().toHexStr() << " (LE)"; LOGERR << " RawScript: "; BinaryDataRef scr = txout.getScriptRef(); uint32_t sz = scr.getSize(); for(uint32_t i=0; i::iterator, bool> insResult; pair toBeInserted(outpt, TxIOPair(tx.getTxRef(),txoutidx)); insResult = nonStdTxioMap_.insert(toBeInserted); //insResult = txioMap_.insert(toBeInserted); } } //////////////////////////////////////////////////////////////////////////////// //uint64_t BtcWallet::getBalance(bool blockchainOnly) //////////////////////////////////////////////////////////////////////////////// uint64_t BtcWallet::getSpendableBalance(uint32_t currBlk, bool ignoreAllZC) { uint64_t balance = 0; map::iterator iter; for(iter = txioMap_.begin(); iter != txioMap_.end(); iter++) { if(iter->second.isSpendable(currBlk, ignoreAllZC)) balance += iter->second.getValue(); } return balance; } //////////////////////////////////////////////////////////////////////////////// uint64_t BtcWallet::getUnconfirmedBalance(uint32_t currBlk, bool inclAllZC) { uint64_t balance = 0; map::iterator iter; for(iter = txioMap_.begin(); iter != txioMap_.end(); iter++) { if(iter->second.isMineButUnconfirmed(currBlk, inclAllZC)) balance += iter->second.getValue(); } return balance; } //////////////////////////////////////////////////////////////////////////////// uint64_t BtcWallet::getFullBalance(void) { uint64_t balance = 0; map::iterator iter; for(iter = txioMap_.begin(); iter != txioMap_.end(); iter++) { if(iter->second.isUnspent()) balance += iter->second.getValue(); } return balance; } //////////////////////////////////////////////////////////////////////////////// vector BtcWallet::getSpendableTxOutList(uint32_t blkNum, bool ignoreAllZC) { vector utxoList(0); map::iterator iter; for(iter = txioMap_.begin(); iter != txioMap_.end(); iter++) { TxIOPair & txio = iter->second; if(txio.isSpendable(blkNum, ignoreAllZC)) { TxOut txout = txio.getTxOutCopy(); utxoList.push_back(UnspentTxOut(txout, blkNum) ); } } return utxoList; } //////////////////////////////////////////////////////////////////////////////// vector BtcWallet::getFullTxOutList(uint32_t blkNum) { vector utxoList(0); map::iterator iter; for(iter = txioMap_.begin(); iter != txioMap_.end(); iter++) { TxIOPair & txio = iter->second; if(txio.isUnspent()) { TxOut txout = txio.getTxOutCopy(); utxoList.push_back(UnspentTxOut(txout, blkNum) ); } } return utxoList; } //////////////////////////////////////////////////////////////////////////////// uint32_t BtcWallet::removeInvalidEntries(void) { vector newLedger(0); uint32_t leRemoved = 0; for(uint32_t i=0; i BtcWallet::createAddressBook(void) { SCOPED_TIMER("createAddressBook"); // Collect all data into a map -- later converted to vector and sort it map sentToMap; set allTxList; set perTxAddrSet; // Go through all TxIO for this wallet, collect outgoing transactions map::iterator txioIter; for(txioIter = txioMap_.begin(); txioIter != txioMap_.end(); txioIter++) { TxIOPair & txio = txioIter->second; // It's only outgoing if it has a TxIn if( !txio.hasTxIn() ) continue; Tx thisTx = txio.getTxRefOfInput().getTxCopy(); HashString txHash = thisTx.getThisHash(); if(allTxList.count(txHash) > 0) continue; else allTxList.insert(txHash); // Iterate over all TxOut in this Tx for recipients perTxAddrSet.clear(); for(uint32_t iout=0; iout0) continue; // It's someone else's address for sure, add it to the map if necessary if(sentToMap.count(scraddr)==0) sentToMap[scraddr] = AddressBookEntry(scraddr); sentToMap[scraddr].addTx(thisTx); perTxAddrSet.insert(scraddr); } } vector outputVect; map::iterator mapIter; for(mapIter = sentToMap.begin(); mapIter != sentToMap.end(); mapIter++) { outputVect.push_back(mapIter->second); } sort(outputVect.begin(), outputVect.end()); return outputVect; } //////////////////////////////////////////////////////////////////////////////// // AddRawBlockTODB // // Assumptions: // -- We have already determined the correct height and dup for the header // and we assume it's part of the sbh object // -- It has definitely been added to the headers DB (bail if not) // -- We don't know if it's been added to the blkdata DB yet // // Things to do when adding a block: // // -- PREPARATION: // -- Create list of all OutPoints affected, and scripts touched // -- If not supernode, then check above data against registeredSSHs_ // -- Fetch all StoredTxOuts from DB about to be removed // -- Get/create TXHINT entries for all tx in block // -- Compute all script keys and get/create all StoredScriptHistory objs // -- Check if any multisig scripts are affected, if so get those objs // -- If pruning, create StoredUndoData from TxOuts about to be removed // -- Modify any Tx/TxOuts in the SBH tree to accommodate any tx in this // block that affect any other tx in this block // // // -- Check if the block {hgt,dup} has already been written to BLKDATA DB // -- Check if the header has already been added to HEADERS DB // // -- BATCH (HEADERS) // -- Add header to HEADHASH list // -- Add header to HEADHGT list // -- Update validDupByHeight_ // -- Update DBINFO top block data // // -- BATCH (BLKDATA) // -- Modify StoredTxOut with spentness info (or prep a delete operation // if pruning). // -- Modify StoredScriptHistory objs same as above. // -- Modify StoredScriptHistory multisig objects as well. // -- Update SSH objects alreadyScannedUpToBlk_, if necessary // -- Write all new TXDATA entries for {hgt,dup} // -- If pruning, write StoredUndoData objs to DB // -- Update DBINFO top block data // // IMPORTANT: we also need to make sure this method does nothing if the // block has already been added properly (though, it okay for // it to take time to verify nothing needs to be done). We may // end up replaying some blocks to force consistency of the DB, // and this method needs to be robust to replaying already-added // blocks, as well as fixing data if the replayed block appears // to have been added already but is different. // //////////////////////////////////////////////////////////////////////////////// BlockWriteBatcher::BlockWriteBatcher(InterfaceToLDB* iface) : iface_(iface), dbUpdateSize_(0), mostRecentBlockApplied_(0) { } BlockWriteBatcher::~BlockWriteBatcher() { commit(); } void BlockWriteBatcher::applyBlockToDB(StoredHeader &sbh) { if(iface_->getValidDupIDForHeight(sbh.blockHeight_) != sbh.duplicateID_) { LOGERR << "Dup requested is not the main branch for the given height!"; return; } else sbh.isMainBranch_ = true; mostRecentBlockApplied_= sbh.blockHeight_; // We will accumulate undoData as we apply the tx StoredUndoData sud; sud.blockHash_ = sbh.thisHash_; sud.blockHeight_ = sbh.blockHeight_; sud.duplicateID_ = sbh.duplicateID_; // Apply all the tx to the update data for(map::iterator iter = sbh.stxMap_.begin(); iter != sbh.stxMap_.end(); iter++) { // This will fetch all the affected [Stored]Tx and modify the maps in // RAM. It will check the maps first to see if it's already been pulled, // and then it will modify either the pulled StoredTx or pre-existing // one. This means that if a single Tx is affected by multiple TxIns // or TxOuts, earlier changes will not be overwritten by newer changes. applyTxToBatchWriteData(iter->second, &sud); } // At this point we should have a list of STX and SSH with all the correct // modifications (or creations) to represent this block. Let's apply it. sbh.blockAppliedToDB_ = true; updateBlkDataHeader(iface_, sbh); //iface_->putStoredHeader(sbh, false); // we want to commit the undo data at the same time as actual changes iface_->startBatch(BLKDATA); // Now actually write all the changes to the DB all at once // if we've gotten to that threshold if (dbUpdateSize_ > UPDATE_BYTES_THRESH) commit(); // Only if pruning, we need to store // TODO: this is going to get run every block, probably should batch it // like we do with the other data...when we actually implement pruning if(DBUtils.getDbPruneType() == DB_PRUNE_ALL) iface_->putStoredUndoData(sud); iface_->commitBatch(BLKDATA); } //////////////////////////////////////////////////////////////////////////////// void BlockWriteBatcher::undoBlockFromDB(StoredUndoData & sud) { SCOPED_TIMER("undoBlockFromDB"); StoredHeader sbh; iface_->getStoredHeader(sbh, sud.blockHeight_, sud.duplicateID_); if(!sbh.blockAppliedToDB_) { LOGERR << "This block was never applied to the DB...can't undo!"; return /*false*/; } mostRecentBlockApplied_ = sud.blockHeight_; // In the future we will accommodate more user modes if(DBUtils.getArmoryDbType() != ARMORY_DB_SUPER) { LOGERR << "Don't know what to do this in non-supernode mode!"; } ///// Put the STXOs back into the DB which were removed by this block // Process the stxOutsRemovedByBlock_ in reverse order // Use int32_t index so that -1 != UINT32_MAX and we go into inf loop for(int32_t i=sud.stxOutsRemovedByBlock_.size()-1; i>=0; i--) { StoredTxOut & sudStxo = sud.stxOutsRemovedByBlock_[i]; StoredTx * stxptr = makeSureSTXInMap( iface_, sudStxo.blockHeight_, sudStxo.duplicateID_, sudStxo.txIndex_, sudStxo.parentHash_, stxToModify_, &dbUpdateSize_); const uint16_t stxoIdx = sudStxo.txOutIndex_; if(DBUtils.getDbPruneType() == DB_PRUNE_NONE) { // If full/super, we have the TxOut in DB, just need mark it unspent map::iterator iter = stxptr->stxoMap_.find(stxoIdx); //if(iter == stxptr->stxoMap_.end()) if(ITER_NOT_IN_MAP(iter, stxptr->stxoMap_)) { LOGERR << "Expecting to find existing STXO, but DNE"; continue; } StoredTxOut & stxoReAdd = iter->second; if(stxoReAdd.spentness_ == TXOUT_UNSPENT || stxoReAdd.spentByTxInKey_.getSize() == 0 ) { LOGERR << "STXO needs to be re-added/marked-unspent but it"; LOGERR << "was already declared unspent in the DB"; } stxoReAdd.spentness_ = TXOUT_UNSPENT; stxoReAdd.spentByTxInKey_ = BinaryData(0); } else { // If we're pruning, we should have the Tx in the DB, but without the // TxOut because it had been pruned by this block on the forward op map::iterator iter = stxptr->stxoMap_.find(stxoIdx); //if(iter != stxptr->stxoMap_.end()) if(ITER_IN_MAP(iter, stxptr->stxoMap_)) LOGERR << "Somehow this TxOut had not been pruned!"; else iter->second = sudStxo; iter->second.spentness_ = TXOUT_UNSPENT; iter->second.spentByTxInKey_ = BinaryData(0); } { ////// Finished updating STX, now update the SSH in the DB // Updating the SSH objects works the same regardless of pruning map::iterator iter = stxptr->stxoMap_.find(stxoIdx); //if(iter == stxptr->stxoMap_.end()) if(ITER_NOT_IN_MAP(iter, stxptr->stxoMap_)) { LOGERR << "Somehow STXO DNE even though we should've just added it!"; continue; } StoredTxOut & stxoReAdd = iter->second; BinaryData uniqKey = stxoReAdd.getScrAddress(); BinaryData hgtX = stxoReAdd.getHgtX(); StoredScriptHistory* sshptr = makeSureSSHInMap( iface_, uniqKey, hgtX, sshToModify_, &dbUpdateSize_ ); if(sshptr==NULL) { LOGERR << "No SSH found for marking TxOut unspent on undo"; continue; } // Now get the TxIOPair in the StoredScriptHistory and mark unspent sshptr->markTxOutUnspent(stxoReAdd.getDBKey(false), stxoReAdd.getValue(), stxoReAdd.isCoinbase_, false); // If multisig, we need to update the SSHs for individual addresses if(uniqKey[0] == SCRIPT_PREFIX_MULTISIG) { vector addr160List; BtcUtils::getMultisigAddrList(stxoReAdd.getScriptRef(), addr160List); for(uint32_t a=0; amarkTxOutUnspent(stxoReAdd.getDBKey(false), stxoReAdd.getValue(), stxoReAdd.isCoinbase_, true); } } } } // The OutPoint list is every new, unspent TxOut created by this block. // When they were added, we updated all the StoredScriptHistory objects // to include references to them. We need to remove them now. // Use int32_t index so that -1 != UINT32_MAX and we go into inf loop for(int16_t itx=sbh.numTx_-1; itx>=0; itx--) { // Ironically, even though I'm using hgt & dup, I still need the hash // in order to key the stxToModify map BinaryData txHash = iface_->getHashForDBKey(sbh.blockHeight_, sbh.duplicateID_, itx); StoredTx * stxptr = makeSureSTXInMap( iface_, sbh.blockHeight_, sbh.duplicateID_, itx, txHash, stxToModify_, &dbUpdateSize_); for(int16_t txoIdx = stxptr->stxoMap_.size()-1; txoIdx >= 0; txoIdx--) { StoredTxOut & stxo = stxptr->stxoMap_[txoIdx]; BinaryData stxoKey = stxo.getDBKey(false); // Then fetch the StoredScriptHistory of the StoredTxOut scraddress BinaryData uniqKey = stxo.getScrAddress(); BinaryData hgtX = stxo.getHgtX(); StoredScriptHistory * sshptr = makeSureSSHInMap( iface_, uniqKey, hgtX, sshToModify_, &dbUpdateSize_, false); // If we are tracking that SSH, remove the reference to this OutPoint if(sshptr != NULL) sshptr->eraseTxio(stxoKey); // Now remove any multisig entries that were added due to this TxOut if(uniqKey[0] == SCRIPT_PREFIX_MULTISIG) { vector addr160List; BtcUtils::getMultisigAddrList(stxo.getScriptRef(), addr160List); for(uint32_t a=0; aeraseTxio(stxoKey); } } } } // Finally, mark this block as UNapplied. sbh.blockAppliedToDB_ = false; updateBlkDataHeader(iface_, sbh); if (dbUpdateSize_ > UPDATE_BYTES_THRESH) commit(); } //////////////////////////////////////////////////////////////////////////////// // Assume that stx.blockHeight_ and .duplicateID_ are set correctly. // We created the maps and sets outside this function, because we need to keep // a master list of updates induced by all tx in this block. // TODO: Make sure that if Tx5 spends an input from Tx2 in the same // block that it is handled correctly, etc. bool BlockWriteBatcher::applyTxToBatchWriteData( StoredTx & thisSTX, StoredUndoData * sud) { SCOPED_TIMER("applyTxToBatchWriteData"); Tx tx = thisSTX.getTxCopy(); // We never expect thisSTX to already be in the map (other tx in the map // may be affected/retrieved multiple times). if(KEY_IN_MAP(tx.getThisHash(), stxToModify_)) LOGERR << "How did we already add this tx?"; // I just noticed we never set TxOuts to TXOUT_UNSPENT. Might as well do // it here -- by definition if we just added this Tx to the DB, it couldn't // have been spent yet. for(map::iterator iter = thisSTX.stxoMap_.begin(); iter != thisSTX.stxoMap_.end(); iter++) iter->second.spentness_ = TXOUT_UNSPENT; // This tx itself needs to be added to the map, which makes it accessible // to future tx in the same block which spend outputs from this tx, without // doing anything crazy in the code here stxToModify_[tx.getThisHash()] = thisSTX; dbUpdateSize_ += thisSTX.numBytes_; // Go through and find all the previous TxOuts that are affected by this tx for(uint32_t iin=0; iinstxoMap_[opTxoIdx]; BinaryData uniqKey = stxo.getScrAddress(); // Update the stxo by marking it spent by this Block:TxIndex:TxInIndex map::iterator iter = stxptr->stxoMap_.find(opTxoIdx); // Some sanity checks //if(iter == stxptr->stxoMap_.end()) if(ITER_NOT_IN_MAP(iter, stxptr->stxoMap_)) { LOGERR << "Needed to get OutPoint for a TxIn, but DNE"; continue; } // We're aliasing this because "iter->second" is not clear at all StoredTxOut & stxoSpend = iter->second; if(stxoSpend.spentness_ == TXOUT_SPENT) { LOGERR << "Trying to mark TxOut spent, but it's already marked"; continue; } // Just about to {remove-if-pruning, mark-spent-if-not} STXO // Record it in the StoredUndoData object if(sud != NULL) sud->stxOutsRemovedByBlock_.push_back(stxoSpend); // Need to modify existing UTXOs, so that we can delete or mark as spent stxoSpend.spentness_ = TXOUT_SPENT; stxoSpend.spentByTxInKey_ = thisSTX.getDBKeyOfChild(iin, false); if(DBUtils.getArmoryDbType() != ARMORY_DB_SUPER) { LOGERR << "Don't know what to do this in non-supernode mode!"; } ////// Now update the SSH to show this TxIOPair was spent // Same story as stxToModify above, except this will actually create a new // SSH if it doesn't exist in the map or the DB BinaryData hgtX = stxo.getHgtX(); StoredScriptHistory* sshptr = makeSureSSHInMap( iface_, uniqKey, hgtX, sshToModify_, &dbUpdateSize_ ); // Assuming supernode, we don't need to worry about removing references // to multisig scripts that reference this script. Simply find and // update the correct SSH TXIO directly sshptr->markTxOutSpent(stxoSpend.getDBKey(false), thisSTX.getDBKeyOfChild(iin, false)); } // We don't need to update any TXDATA, since it is part of writing thisSTX // to the DB ... but we do need to update the StoredScriptHistory objects // with references to the new [unspent] TxOuts for(uint32_t iout=0; ioutmarkTxOutUnspent(stxoToAdd.getDBKey(false), stxoToAdd.getValue(), stxoToAdd.isCoinbase_, false); // If this was a multisig address, add a ref to each individual scraddr if(uniqKey[0] == SCRIPT_PREFIX_MULTISIG) { vector addr160List; BtcUtils::getMultisigAddrList(stxoToAdd.getScriptRef(), addr160List); for(uint32_t a=0; amarkTxOutUnspent(stxoToAdd.getDBKey(false), stxoToAdd.getValue(), stxoToAdd.isCoinbase_, true); } } } return true; } void BlockWriteBatcher::commit() { // Check for any SSH objects that are now completely empty. If they exist, // they should be removed from the DB, instead of simply written as empty // objects const set keysToDelete = searchForSSHKeysToDelete(); iface_->startBatch(BLKDATA); for(map::iterator iter_stx = stxToModify_.begin(); iter_stx != stxToModify_.end(); iter_stx++) { iface_->putStoredTx(iter_stx->second, true); } for(map::iterator iter_ssh = sshToModify_.begin(); iter_ssh != sshToModify_.end(); iter_ssh++) { iface_->putStoredScriptHistory(iter_ssh->second); } for(set::const_iterator iter_del = keysToDelete.begin(); iter_del != keysToDelete.end(); iter_del++) { iface_->deleteValue(BLKDATA, *iter_del); } if(mostRecentBlockApplied_ != 0) { StoredDBInfo sdbi; iface_->getStoredDBInfo(BLKDATA, sdbi); if(!sdbi.isInitialized()) LOGERR << "How do we have invalid SDBI in applyMods?"; else { sdbi.appliedToHgt_ = mostRecentBlockApplied_; iface_->putStoredDBInfo(BLKDATA, sdbi); } } iface_->commitBatch(BLKDATA); stxToModify_.clear(); sshToModify_.clear(); dbUpdateSize_ = 0; } set BlockWriteBatcher::searchForSSHKeysToDelete() { set keysToDelete; vector fullSSHToDelete; for(map::iterator iterSSH = sshToModify_.begin(); iterSSH != sshToModify_.end(); ) { // get our next one in case we delete the current map::iterator nextSSHi = iterSSH; ++nextSSHi; StoredScriptHistory & ssh = iterSSH->second; for(map::iterator iterSub = ssh.subHistMap_.begin(); iterSub != ssh.subHistMap_.end(); iterSub++) { StoredSubHistory & subssh = iterSub->second; if(subssh.txioSet_.size() == 0) keysToDelete.insert(subssh.getDBKey(true)); } // If the full SSH is empty (not just sub history), mark it to be removed if(iterSSH->second.totalTxioCount_ == 0) { sshToModify_.erase(iterSSH); } iterSSH = nextSSHi; } return keysToDelete; } //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // // Start BlockDataManager_LevelDB methods // //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// BlockDataManager_LevelDB::BlockDataManager_LevelDB(void) { Reset(); } ///////////////////////////////////////////////////////////////////////////// BlockDataManager_LevelDB::~BlockDataManager_LevelDB(void) { set::iterator iter; for(iter = registeredWallets_.begin(); iter != registeredWallets_.end(); iter++) { delete *iter; } Reset(); } ///////////////////////////////////////////////////////////////////////////// // We must set the network-specific data for this blockchain // // bdm.SetBtcNetworkParams( READHEX(MAINNET_GENESIS_HASH_HEX), // READHEX(MAINNET_GENESIS_TX_HASH_HEX), // READHEX(MAINNET_MAGIC_BYTES)); // // The above call will work void BlockDataManager_LevelDB::SetBtcNetworkParams( BinaryData const & GenHash, BinaryData const & GenTxHash, BinaryData const & MagicBytes) { LOGINFO << "SetBtcNetworkParams"; GenesisHash_.copyFrom(GenHash); GenesisTxHash_.copyFrom(GenTxHash); MagicBytes_.copyFrom(MagicBytes); } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::SetHomeDirLocation(string homeDir) { // This will eventually be used to store blocks/DB LOGINFO << "Set home directory: " << armoryHomeDir_.c_str(); armoryHomeDir_ = homeDir; blkProgressFile_ = homeDir + string("/blkfiles.txt"); abortLoadFile_ = homeDir + string("/abortload.txt"); } ///////////////////////////////////////////////////////////////////////////// // Bitcoin-Qt/bitcoind 0.8+ changed the location and naming convention for // the blkXXXX.dat files. The first block file use to be: // // ~/.bitcoin/blocks/blk00000.dat // // UPDATE: Compatibility with pre-0.8 nodes removed after 6+ months and // a hard-fork that makes it tougher to use old versions. // bool BlockDataManager_LevelDB::SetBlkFileLocation(string blkdir) { blkFileDir_ = blkdir; isBlkParamsSet_ = true; detectAllBlkFiles(); LOGINFO << "Set blkfile dir: " << blkFileDir_.c_str(); return (numBlkFiles_!=UINT16_MAX); } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::SetLevelDBLocation(string ldbdir) { leveldbDir_ = ldbdir; isLevelDBSet_ = true; LOGINFO << "Set leveldb dir: " << leveldbDir_.c_str(); } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::SelectNetwork(string netName) { if(netName.compare("Main") == 0) { SetBtcNetworkParams( READHEX(MAINNET_GENESIS_HASH_HEX), READHEX(MAINNET_GENESIS_TX_HASH_HEX), READHEX(MAINNET_MAGIC_BYTES) ); } else if(netName.compare("Test") == 0) { SetBtcNetworkParams( READHEX(TESTNET_GENESIS_HASH_HEX), READHEX(TESTNET_GENESIS_TX_HASH_HEX), READHEX(TESTNET_MAGIC_BYTES) ); } else LOGERR << "ERROR: Unrecognized network name"; isNetParamsSet_ = true; } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::checkLdbStatus(leveldb::Status stat) { if( stat.ok() ) return true; LOGERR << "***LevelDB Error: " << stat.ToString(); return false; } ////////////////////////////////////////////////////////////////////////// // This method opens the databases, and figures out up to what block each // of them is sync'd to. Then it figures out where that corresponds in // the blk*.dat files, so that it can pick up where it left off. You can // use the last argument to specify an approximate amount of blocks // (specified in bytes) that you would like to replay: i.e. if 10 MB, // startScanBlkFile_ and endOfLastBlockByte_ variables will be set to // the first block that is approximately 10 MB behind your latest block. // Then you can pick up from there and let the DB clean up any mess that // was left from an unclean shutdown. bool BlockDataManager_LevelDB::initializeDBInterface(ARMORY_DB_TYPE dbtype, DB_PRUNE_TYPE prtype) { SCOPED_TIMER("initializeDBInterface"); if(!isBlkParamsSet_ || !isLevelDBSet_) { LOGERR << "Cannot sync DB until blkfile and LevelDB paths are set. "; return false; } if(iface_->databasesAreOpen()) { LOGERR << "Attempted to initialize a database that was already open"; return false; } bool openWithErr = iface_->openDatabases(leveldbDir_, GenesisHash_, GenesisTxHash_, MagicBytes_, dbtype, prtype); return openWithErr; } //////////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::detectCurrentSyncState( bool forceRebuild, bool initialLoad) { // Make sure we detected all the available blk files detectAllBlkFiles(); vector firstHashes = getFirstHashOfEachBlkFile(); LOGINFO << "Total blk*.dat files: " << numBlkFiles_; if(!iface_->databasesAreOpen()) { LOGERR << "Could not open databases!"; return false; } // We add 1 to each of these, since we always use exclusive upperbound startHeaderHgt_ = getTopBlockHeightInDB(HEADERS) + 1; startRawBlkHgt_ = getTopBlockHeightInDB(BLKDATA) + 1; startApplyHgt_ = getAppliedToHeightInDB() + 1; // If the values were supposed to be zero, they'll get set to 1. Fix it startHeaderHgt_ -= (startHeaderHgt_==1 ? 1 : 0); startRawBlkHgt_ -= (startRawBlkHgt_==1 ? 1 : 0); startApplyHgt_ -= (startApplyHgt_ ==1 ? 1 : 0); LOGINFO << "Current Top block in HEADERS DB: " << startHeaderHgt_; LOGINFO << "Current Top block in BLKDATA DB: " << startRawBlkHgt_; LOGINFO << "Current Applied blocks up to hgt: " << startApplyHgt_; if(startHeaderHgt_ == 0 || forceRebuild) { if(forceRebuild) LOGINFO << "Ignore existing sync state, rebuilding databases"; startHeaderHgt_ = 0; startHeaderBlkFile_ = 0; startHeaderOffset_ = 0; startRawBlkHgt_ = 0; startRawBlkFile_ = 0; startRawOffset_ = 0; startApplyHgt_ = 0; startApplyBlkFile_ = 0; startApplyOffset_ = 0; headerMap_.clear(); topBlockPtr_ = NULL; genBlockPtr_ = NULL; lastTopBlock_ = UINT32_MAX;; return true; } // This fetches the header data from the DB if(!initialLoad) { // If this isn't the initial load, we assume everything is sync'd startHeaderBlkFile_= numBlkFiles_ - 1; startHeaderOffset_ = endOfLastBlockByte_; startRawBlkHgt_ = startHeaderHgt_; startRawBlkFile_ = numBlkFiles_ - 1; startRawOffset_ = endOfLastBlockByte_; startApplyHgt_ = startHeaderHgt_; startApplyBlkFile_ = numBlkFiles_ - 1; startApplyOffset_ = endOfLastBlockByte_; return true; } map sbhMap; headerMap_.clear(); iface_->readAllHeaders(headerMap_, sbhMap); // Organize them into the longest chain organizeChain(true); // true ~ force rebuild // If the headers DB ended up corrupted (triggered by organizeChain), // then nuke and rebuild the headers if(corruptHeadersDB_) { LOGERR << "Corrupted headers DB!"; startHeaderHgt_ = 0; startHeaderBlkFile_ = 0; startHeaderOffset_ = 0; startRawBlkHgt_ = 0; startRawBlkFile_ = 0; startRawOffset_ = 0; startApplyHgt_ = 0; startApplyBlkFile_ = 0; startApplyOffset_ = 0; headerMap_.clear(); headersByHeight_.clear(); topBlockPtr_ = NULL; prevTopBlockPtr_ = NULL; corruptHeadersDB_ = false; lastTopBlock_ = UINT32_MAX; genBlockPtr_ = NULL; return true; } else { // Now go through the linear list of main-chain headers, mark valid for(uint32_t i=0; igetThisHashRef(); StoredHeader & sbh = sbhMap[headHash]; sbh.isMainBranch_ = true; iface_->setValidDupIDForHeight(sbh.blockHeight_, sbh.duplicateID_); } // startHeaderBlkFile_/Offset_ is where we were before the last shutdown for(startHeaderBlkFile_ = 0; startHeaderBlkFile_ < firstHashes.size(); startHeaderBlkFile_++) { // hasHeaderWithHash is probing the RAM block headers we just organized if(!hasHeaderWithHash(firstHashes[startHeaderBlkFile_])) break; } // If no new blkfiles since last load, the above loop ends w/o "break" // If it's zero, then we don't have anything, start at zero // If new blk file, then startHeaderBlkFile_ is at the first blk file // with an unrecognized hash... we must've left off in the prev blkfile if(startHeaderBlkFile_ > 0) startHeaderBlkFile_--; startHeaderOffset_ = findOffsetFirstUnrecognized(startHeaderBlkFile_); } LOGINFO << "First unrecognized hash file: " << startHeaderBlkFile_; LOGINFO << "Offset of first unrecog block: " << startHeaderOffset_; // Note that startRawBlkHgt_ is topBlk+1, so this return where we should // actually start processing raw blocks, not the last one we processed pair rawBlockLoc; rawBlockLoc = findFileAndOffsetForHgt(startRawBlkHgt_, &firstHashes); startRawBlkFile_ = rawBlockLoc.first; startRawOffset_ = rawBlockLoc.second; LOGINFO << "First blkfile not in DB: " << startRawBlkFile_; LOGINFO << "Location of first block not in DB: " << startRawOffset_; if(DBUtils.getArmoryDbType() != ARMORY_DB_BARE) { // TODO: finish this findFirstUnappliedBlock(); LOGINFO << "Blkfile of first unapplied block: " << startApplyBlkFile_; LOGINFO << "Location of first unapplied block: " << startApplyOffset_; } // If we're content here, just return return true; /* // If we want to replay some blocks, we need to adjust startScanBlkFile_ // and startScanOffset_ to be approx "replayNBytes" behind where // they are currently set. int32_t targOffset = (int32_t)startScanOffset_ - (int32_t)replayNBytes; if(targOffset > 0 || startScanBlkFile_==0) { targOffset = max(0, targOffset); startScanOffset_ = findFirstBlkApproxOffset(startScanBlkFile_, targOffset); } else { startScanBlkFile_--; uint32_t prevFileSize = BtcUtils::GetFileSize(blkFileList_[startScanBlkFile_]); targOffset = (int32_t)prevFileSize - (int32_t)replayNBytes; targOffset = max(0, targOffset); startScanOffset_ = findFirstBlkApproxOffset(startScanBlkFile_, targOffset); } LOGINFO << "Rewinding start block to enforce DB integrity"; LOGINFO << "Start at blockfile: " << startScanBlkFile_; LOGINFO << "Start location in above blkfile: " << startScanOffset_; return true; */ } //////////////////////////////////////////////////////////////////////////////// vector BlockDataManager_LevelDB::getFirstHashOfEachBlkFile(void) const { if(!isBlkParamsSet_) { LOGERR << "Can't get blk files until blkfile params are set"; return vector(0); } uint32_t nFile = (uint32_t)blkFileList_.size(); BinaryData magic(4), szstr(4), rawHead(HEADER_SIZE); vector headHashes(nFile); for(uint32_t f=0; f(0); } is.read((char*)rawHead.getPtr(), HEADER_SIZE); headHashes[f] = BinaryData(32); BtcUtils::getHash256(rawHead, headHashes[f]); is.close(); } return headHashes; } //////////////////////////////////////////////////////////////////////////////// uint32_t BlockDataManager_LevelDB::findOffsetFirstUnrecognized(uint32_t fnum) { uint32_t loc = 0; BinaryData magic(4), szstr(4), rawHead(80), hashResult(32); ifstream is(blkFileList_[fnum].c_str(), ios::in|ios::binary); while(!is.eof()) { is.read((char*)magic.getPtr(), 4); if(is.eof()) break; // This is not an error, it just simply hit the padding if(magic!=MagicBytes_) break; is.read((char*)szstr.getPtr(), 4); uint32_t blksize = READ_UINT32_LE(szstr.getPtr()); if(is.eof()) break; is.read((char*)rawHead.getPtr(), HEADER_SIZE); BtcUtils::getHash256_NoSafetyCheck(rawHead.getPtr(), HEADER_SIZE, hashResult); if(getHeaderByHash(hashResult) == NULL) break; // first hash in the file that isn't in our header map loc += blksize + 8; is.seekg(blksize - HEADER_SIZE, ios::cur); } is.close(); return loc; } //////////////////////////////////////////////////////////////////////////////// uint32_t BlockDataManager_LevelDB::findFirstBlkApproxOffset(uint32_t fnum, uint32_t offset) const { if(fnum >= numBlkFiles_) { LOGERR << "Blkfile number out of range! (" << fnum << ")"; return UINT32_MAX; } uint32_t loc = 0; BinaryData magic(4), szstr(4), rawHead(80), hashResult(32); ifstream is(blkFileList_[fnum].c_str(), ios::in|ios::binary); while(!is.eof() && loc <= offset) { is.read((char*)magic.getPtr(), 4); if(is.eof()) break; if(magic!=MagicBytes_) return UINT32_MAX; is.read((char*)szstr.getPtr(), 4); uint32_t blksize = READ_UINT32_LE(szstr.getPtr()); if(is.eof()) break; loc += blksize + 8; is.seekg(blksize, ios::cur); } is.close(); return loc; } //////////////////////////////////////////////////////////////////////////////// pair BlockDataManager_LevelDB::findFileAndOffsetForHgt( uint32_t hgt, vector * firstHashes) { vector recomputedHashes; if(firstHashes==NULL) { recomputedHashes = getFirstHashOfEachBlkFile(); firstHashes = &recomputedHashes; } pair outPair; int32_t blkfile; for(blkfile = 0; blkfile < (int32_t)firstHashes->size(); blkfile++) { BlockHeader * bhptr = getHeaderByHash((*firstHashes)[blkfile]); if(bhptr == NULL) break; if(bhptr->getBlockHeight() > hgt) break; } blkfile = max(blkfile-1, 0); if(blkfile >= (int32_t)numBlkFiles_) { LOGERR << "Blkfile number out of range! (" << blkfile << ")"; return outPair; } uint32_t loc = 0; BinaryData magic(4), szstr(4), rawHead(HEADER_SIZE), hashResult(32); ifstream is(blkFileList_[blkfile].c_str(), ios::in|ios::binary); while(!is.eof()) { is.read((char*)magic.getPtr(), 4); if(is.eof()) break; if(magic!=MagicBytes_) break; is.read((char*)szstr.getPtr(), 4); uint32_t blksize = READ_UINT32_LE(szstr.getPtr()); if(is.eof()) break; is.read((char*)rawHead.getPtr(), HEADER_SIZE); BtcUtils::getHash256_NoSafetyCheck(rawHead.getPtr(), HEADER_SIZE, hashResult); BlockHeader * bhptr = getHeaderByHash(hashResult); if(bhptr == NULL) break; if(bhptr->getBlockHeight() >= hgt) break; loc += blksize + 8; is.seekg(blksize - HEADER_SIZE, ios::cur); } is.close(); outPair.first = blkfile; outPair.second = loc; return outPair; } //////////////////////////////////////////////////////////////////////////////// // This behaves very much like the algorithm for finding the branch point // in the header tree with a peer. uint32_t BlockDataManager_LevelDB::findFirstUnappliedBlock(void) { SCOPED_TIMER("findFirstUnappliedBlock"); if(!iface_->databasesAreOpen()) { LOGERR << "Database is not open!"; return UINT32_MAX; } int32_t blkCheck = (int32_t)getTopBlockHeightInDB(BLKDATA); StoredHeader sbh; uint32_t toSub = 0; uint32_t nIter = 0; do { blkCheck -= toSub; if(blkCheck < 0) { blkCheck = 0; break; } iface_->getStoredHeader(sbh, (uint32_t)blkCheck); if(nIter++ < 10) toSub += 1; // we get some N^2 action here (for the first 10 iter) else toSub = (uint32_t)(1.5*toSub); // after that, increase exponentially } while(!sbh.blockAppliedToDB_); // We likely overshot in the last loop, so walk forward until we get to it. do { iface_->getStoredHeader(sbh, (uint32_t)blkCheck); blkCheck += 1; } while(sbh.blockAppliedToDB_); return (uint32_t)blkCheck; } //////////////////////////////////////////////////////////////////////////////// uint32_t BlockDataManager_LevelDB::getTopBlockHeightInDB(DB_SELECT db) { StoredDBInfo sdbi; iface_->getStoredDBInfo(db, sdbi, false); return sdbi.topBlkHgt_; } //////////////////////////////////////////////////////////////////////////////// uint32_t BlockDataManager_LevelDB::getAppliedToHeightInDB(void) { StoredDBInfo sdbi; iface_->getStoredDBInfo(BLKDATA, sdbi, false); return sdbi.appliedToHgt_; } //////////////////////////////////////////////////////////////////////////////// // The name of this function reflects that we are going to implement headers- // first "verification." Rather, we are going to organize the chain of headers // before we add any blocks, and then only add blocks that are on the main // chain. Return false if these headers induced a reorg. bool BlockDataManager_LevelDB::addHeadersFirst(BinaryDataRef rawHeader) { vector toAdd(1); toAdd[0].unserialize(rawHeader); return addHeadersFirst(toAdd); } //////////////////////////////////////////////////////////////////////////////// // Add the headers to the DB, which is required before putting raw blocks. // Can only put raw blocks when we know their height and dupID. After we // put the headers, then we put raw blocks. Then we go through the valid // headers and applyToDB the raw blocks. bool BlockDataManager_LevelDB::addHeadersFirst(vector const & headVect) { vector headersToDB; headersToDB.reserve(headVect.size()); for(uint32_t h=0; h bhInputPair; pair::iterator, bool> bhInsResult; // Actually insert it. Take note of whether it was already there. bhInputPair.second.unserialize(headVect[h].dataCopy_); bhInputPair.first = bhInputPair.second.getThisHash(); bhInsResult = headerMap_.insert(bhInputPair); if(!bhInsResult.second) bhInsResult.first->second = bhInputPair.second; //if(bhInsResult.second) // true means didn't exist before headersToDB.push_back(&(bhInsResult.first->second)); } // Organize the chain with the new headers, note whether a reorg occurred bool prevTopBlockStillValid = organizeChain(); // Add the main-branch headers to the DB. We will handle reorg ops later. // The batching is safe since we never write multiple blocks at the same hgt iface_->startBatch(HEADERS); for(uint32_t h=0; hisMainBranch()) continue; StoredHeader sbh; sbh.createFromBlockHeader(*headersToDB[h]); uint8_t dup = iface_->putBareHeader(sbh); headersToDB[h]->setDuplicateID(dup); } iface_->commitBatch(HEADERS); // We need to add the non-main-branch headers, too. for(uint32_t h=0; hisMainBranch()) continue; StoredHeader sbh; sbh.createFromBlockHeader(*headersToDB[h]); uint8_t dup = iface_->putBareHeader(sbh); headersToDB[h]->setDuplicateID(dup); } return prevTopBlockStillValid; } ///////////////////////////////////////////////////////////////////////////// // The only way to "create" a BDM is with this method, which creates it // if one doesn't exist yet, or returns a reference to the only one // that will ever exist BlockDataManager_LevelDB & BlockDataManager_LevelDB::GetInstance(void) { if( !bdmCreatedYet_ ) { theOnlyBDM_ = new BlockDataManager_LevelDB; bdmCreatedYet_ = true; iface_ = LevelDBWrapper::GetInterfacePtr(); } return (*theOnlyBDM_); } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::DestroyInstance(void) { theOnlyBDM_->Reset(); iface_->closeDatabases(); delete theOnlyBDM_; bdmCreatedYet_ = false; iface_ = NULL; } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::Reset(void) { SCOPED_TIMER("BDM::Reset"); // Clear out all the "real" data in the blkfile blkFileDir_ = ""; headerMap_.clear(); zeroConfRawTxList_.clear(); zeroConfMap_.clear(); zcEnabled_ = false; zcLiteMode_ = false; zcFilename_ = ""; isNetParamsSet_ = false; isBlkParamsSet_ = false; isLevelDBSet_ = false; armoryHomeDir_ = string(""); blkFileDir_ = string(""); blkFileList_.clear(); numBlkFiles_ = UINT32_MAX; endOfLastBlockByte_ = 0; startHeaderHgt_ = 0; startRawBlkHgt_ = 0; startApplyHgt_ = 0; startHeaderBlkFile_ = 0; startHeaderOffset_ = 0; startRawBlkFile_ = 0; startRawOffset_ = 0; startApplyBlkFile_ = 0; startApplyOffset_ = 0; // These should be set after the blockchain is organized headersByHeight_.clear(); topBlockPtr_ = NULL; genBlockPtr_ = NULL; lastTopBlock_ = UINT32_MAX;; // Reorganization details lastBlockWasReorg_ = false; reorgBranchPoint_ = NULL; txJustInvalidated_.clear(); txJustAffected_.clear(); // Reset orphan chains previouslyValidBlockHeaderPtrs_.clear(); orphanChainStartBlocks_.clear(); GenesisHash_.resize(0); GenesisTxHash_.resize(0); MagicBytes_.resize(0); totalBlockchainBytes_ = 0; bytesReadSoFar_ = 0; blocksReadSoFar_ = 0; filesReadSoFar_ = 0; isInitialized_ = false; corruptHeadersDB_ = false; // Clear out any of the registered tx data we have collected so far. // Doesn't take any time to recollect if it we have to rescan, anyway. registeredWallets_.clear(); registeredScrAddrMap_.clear(); registeredTxSet_.clear(); registeredTxList_.clear(); registeredOutPoints_.clear(); allScannedUpToBlk_ = 0; } ///////////////////////////////////////////////////////////////////////////// int32_t BlockDataManager_LevelDB::getNumConfirmations(HashString txHash) { TxRef txrefobj = getTxRefByHash(txHash); if(txrefobj.isNull()) return TX_NOT_EXIST; else { BlockHeader* bhptr = getHeaderPtrForTxRef(txrefobj); if(bhptr == NULL) return TX_0_UNCONFIRMED; else { BlockHeader & txbh = *bhptr; if(!txbh.isMainBranch()) return TX_OFF_MAIN_BRANCH; int32_t txBlockHeight = txbh.getBlockHeight(); int32_t topBlockHeight = getTopBlockHeight(); return topBlockHeight - txBlockHeight + 1; } } } ///////////////////////////////////////////////////////////////////////////// BlockHeader & BlockDataManager_LevelDB::getTopBlockHeader(void) { if(topBlockPtr_ == NULL) topBlockPtr_ = &(getGenesisBlock()); return *topBlockPtr_; } ///////////////////////////////////////////////////////////////////////////// BlockHeader & BlockDataManager_LevelDB::getGenesisBlock(void) { if(genBlockPtr_ == NULL) genBlockPtr_ = &(headerMap_[GenesisHash_]); return *genBlockPtr_; } ///////////////////////////////////////////////////////////////////////////// // Get a blockheader based on its height on the main chain BlockHeader * BlockDataManager_LevelDB::getHeaderByHeight(int index) { if( index<0 || index>=(int)headersByHeight_.size()) return NULL; else return headersByHeight_[index]; } ///////////////////////////////////////////////////////////////////////////// // The most common access method is to get a block by its hash BlockHeader * BlockDataManager_LevelDB::getHeaderByHash(HashString const & blkHash) { map::iterator it = headerMap_.find(blkHash); //if(it==headerMap_.end()) if(ITER_NOT_IN_MAP(it, headerMap_)) return NULL; else return &(it->second); } ///////////////////////////////////////////////////////////////////////////// TxRef BlockDataManager_LevelDB::getTxRefByHash(HashString const & txhash) { return iface_->getTxRef(txhash); } ///////////////////////////////////////////////////////////////////////////// Tx BlockDataManager_LevelDB::getTxByHash(HashString const & txhash) { TxRef txrefobj = getTxRefByHash(txhash); if(!txrefobj.isNull()) return txrefobj.getTxCopy(); else { // It's not in the blockchain, but maybe in the zero-conf tx list map::const_iterator iter = zeroConfMap_.find(txhash); //if(iter==zeroConfMap_.end()) if(ITER_NOT_IN_MAP(iter, zeroConfMap_)) return Tx(); else return iter->second.txobj_; } } ///////////////////////////////////////////////////////////////////////////// TX_AVAILABILITY BlockDataManager_LevelDB::getTxHashAvail(BinaryDataRef txHash) { if(getTxRefByHash(txHash).isNull()) { //if(zeroConfMap_.find(txHash)==zeroConfMap_.end()) if(KEY_NOT_IN_MAP(txHash, zeroConfMap_)) return TX_DNE; // No tx at all else return TX_ZEROCONF; // Zero-conf tx } else return TX_IN_BLOCKCHAIN; // In the blockchain already } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::hasTxWithHashInDB(BinaryData const & txHash) { return iface_->getTxRef(txHash).isInitialized(); } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::hasTxWithHash(BinaryData const & txHash) { if(iface_->getTxRef(txHash).isInitialized()) return true; else return KEY_IN_MAP(txHash, zeroConfMap_); } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::hasHeaderWithHash(BinaryData const & txHash) const { //return (headerMap_.find(txHash) != headerMap_.end()); return KEY_IN_MAP(txHash, headerMap_); } ///////////////////////////////////////////////////////////////////////////// /* vector BlockDataManager_LevelDB::prefixSearchHeaders(BinaryData const & searchStr) { vector outList(0); uint32_t lenSearch = searchStr.getSize(); if(lenSearch < 2) return outList; // don't search unless we have at least two bytes BinaryData searchLow(32); BinaryData searchHigh(32); for(uint32_t i=0; i::iterator iter; for(iter = headerMap_.lower_bound(searchLow); iter != headerMap_.upper_bound(searchHigh); iter++) { outList.push_back(&(iter->second)); } return outList; } */ ///////////////////////////////////////////////////////////////////////////// /* vector BlockDataManager_LevelDB::prefixSearchTx(BinaryData const & searchStr) { vector outList(0); uint32_t lenSearch = searchStr.getSize(); if(lenSearch < 2) return outList; // don't search unless we have at least two bytes BinaryData searchLow(32); BinaryData searchHigh(32); for(uint32_t i=0; i::iterator iter; for(iter = txHintMap_.lower_bound(searchLow4); iter != txHintMap_.upper_bound(searchHigh4); iter++) { if(iter->second.getThisHash().startsWith(searchStr)) outList.push_back(&(iter->second)); } return outList; } ///////////////////////////////////////////////////////////////////////////// // Since the cpp code doesn't have full addresses (only 20-byte hashes), // that's all we can search for. vector BlockDataManager_LevelDB::prefixSearchAddress(BinaryData const & searchStr) { // Actually, we can't even search for this, because we don't have a list // of addresses in the blockchain. We could construct one, but it would // take up a lot of RAM (and time)... I will need to create a separate // call to allow the caller to create a set of addresses // before calling this method return vector(0); } */ ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::registerWallet(BtcWallet* wltPtr, bool wltIsNew) { SCOPED_TIMER("registerWallet"); // Check if the wallet is already registered //if(registeredWallets_.find(wltPtr) != registeredWallets_.end()) if(KEY_IN_MAP(wltPtr, registeredWallets_)) return false; // Add it to the list of wallets to watch registeredWallets_.insert(wltPtr); // Now add all the individual addresses from the wallet for(uint32_t i=0; igetNumScrAddr(); i++) { // If this is a new wallet, the value of getFirstBlockNum is irrelevant ScrAddrObj & addr = wltPtr->getScrAddrObjByIndex(i); if(wltIsNew) registerNewScrAddr(addr.getScrAddr()); else registerImportedScrAddr(addr.getScrAddr(), addr.getFirstBlockNum()); } // We need to make sure the wallet can tell the BDM when an address is added wltPtr->setBdmPtr(this); return true; } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::registerScrAddr(HashString scraddr, bool addrIsNew, uint32_t firstBlk) { SCOPED_TIMER("registerScrAddr"); if(KEY_IN_MAP(scraddr, registeredScrAddrMap_)) { // Address is already registered. Don't think there's anything to do return false; } if(addrIsNew) firstBlk = getTopBlockHeight() + 1; registeredScrAddrMap_[scraddr] = RegisteredScrAddr(scraddr, firstBlk); allScannedUpToBlk_ = min(firstBlk, allScannedUpToBlk_); return true; } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::registerNewScrAddr(HashString scraddr) { SCOPED_TIMER("registerNewScrAddr"); if(KEY_IN_MAP(scraddr, registeredScrAddrMap_)) return false; uint32_t currBlk = getTopBlockHeight(); registeredScrAddrMap_[scraddr] = RegisteredScrAddr(scraddr, currBlk); // New address cannot affect allScannedUpToBlk_, so don't bother //allScannedUpToBlk_ = min(currBlk, allScannedUpToBlk_); return true; } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::registerImportedScrAddr(BinaryData scraddr, uint32_t createBlk) { SCOPED_TIMER("registerImportedScrAddr"); if(KEY_IN_MAP(scraddr, registeredScrAddrMap_)) return false; // In some cases we may have used UINT32_MAX to specify "don't know" if(createBlk==UINT32_MAX) createBlk = 0; registeredScrAddrMap_[scraddr] = RegisteredScrAddr(scraddr, createBlk); allScannedUpToBlk_ = min(createBlk, allScannedUpToBlk_); return true; } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::unregisterScrAddr(BinaryData scraddr) { SCOPED_TIMER("unregisterScrAddr"); //if(registeredScrAddrMap_.find(scraddr) == registeredScrAddrMap_.end()) if(KEY_IN_MAP(scraddr, registeredScrAddrMap_)) return false; registeredScrAddrMap_.erase(scraddr); allScannedUpToBlk_ = evalLowestBlockNextScan(); return true; } ///////////////////////////////////////////////////////////////////////////// BtcWallet::~BtcWallet(void) { if(bdmPtr_!=NULL) bdmPtr_->unregisterWallet(this); } ///////////////////////////////////////////////////////////////////////////// uint32_t BlockDataManager_LevelDB::evalLowestBlockNextScan(void) { SCOPED_TIMER("evalLowestBlockNextScan"); uint32_t lowestBlk = UINT32_MAX; uint32_t i=0; map::iterator rsaIter; for(rsaIter = registeredScrAddrMap_.begin(); rsaIter != registeredScrAddrMap_.end(); rsaIter++) { // If we happen to have any imported addresses, this will set the // lowest block to 0, which will require a full rescan lowestBlk = min(lowestBlk, rsaIter->second.alreadyScannedUpToBlk_); } return lowestBlk; } ///////////////////////////////////////////////////////////////////////////// // This method isn't really used yet... uint32_t BlockDataManager_LevelDB::evalLowestScrAddrCreationBlock(void) { SCOPED_TIMER("evalLowestAddressCreationBlock"); uint32_t lowestBlk = UINT32_MAX; map::iterator rsaIter; for(rsaIter = registeredScrAddrMap_.begin(); rsaIter != registeredScrAddrMap_.end(); rsaIter++) { // If we happen to have any imported addresses, this will set the // lowest block to 0, which will require a full rescan lowestBlk = min(lowestBlk, rsaIter->second.blkCreated_); } return lowestBlk; } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::evalRescanIsRequired(void) { // This method tells us whether we have to scan ANY blocks from disk // in order to produce accurate balances and TxOut lists. If this // returns false, we can get away without any disk access at all, and // just use the registeredTxList_ object to get our information. allScannedUpToBlk_ = evalLowestBlockNextScan(); return (allScannedUpToBlk_ < getTopBlockHeight()+1); } ///////////////////////////////////////////////////////////////////////////// // This method needs to be callable from another thread. Therefore, I don't // seek an exact answer, instead just estimate it based on the last block, // and the set of currently-registered addresses. The method called // "evalRescanIsRequired()" answers a different question, and iterates // through the list of registered addresses, which may be changing in // another thread. bool BlockDataManager_LevelDB::isDirty( uint32_t numBlocksToBeConsideredDirty ) const { if(!isInitialized_) return false; uint32_t numBlocksBehind = lastTopBlock_-allScannedUpToBlk_; return (numBlocksBehind > numBlocksToBeConsideredDirty); } ///////////////////////////////////////////////////////////////////////////// uint32_t BlockDataManager_LevelDB::numBlocksToRescan( BtcWallet & wlt, uint32_t endBlk) { SCOPED_TIMER("numBlocksToRescan"); // This method tells us whether we have to scan ANY blocks from disk // in order to produce accurate balances and TxOut lists. If this // returns false, we can get away without any disk access at all, and // just use the registeredTxList_ object to get our information. uint32_t currNextBlk = getTopBlockHeight() + 1; endBlk = min(endBlk, currNextBlk); // If wallet is registered and current, no rescan necessary if(walletIsRegistered(wlt)) return (endBlk - allScannedUpToBlk_); // The wallet isn't registered with the BDM, but there's a chance that // each of its addresses are -- if any one is not, do rescan uint32_t maxAddrBehind = 0; for(uint32_t i=0; i::iterator rsaIter; for(rsaIter = registeredScrAddrMap_.begin(); rsaIter != registeredScrAddrMap_.end(); rsaIter++) { rsaIter->second.alreadyScannedUpToBlk_ = newTopBlk; } } //////////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::resetRegisteredWallets(void) { SCOPED_TIMER("resetRegisteredWallets"); set::iterator wltPtrIter; for(wltPtrIter = registeredWallets_.begin(); wltPtrIter != registeredWallets_.end(); wltPtrIter++) { // I'm not sure if there's anything else to do // I think it's all encapsulated in this call! (*wltPtrIter)->clearBlkData(); } // Reset all addresses to "new" updateRegisteredScrAddrs(0); } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::walletIsRegistered(BtcWallet & wlt) { //return (registeredWallets_.find(&wlt)!=registeredWallets_.end()); return KEY_IN_MAP(&wlt, registeredWallets_); } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::scrAddrIsRegistered(BinaryData scraddr) { //return (registeredScrAddrMap_.find(scraddr)!=registeredScrAddrMap_.end()); return KEY_IN_MAP(scraddr, registeredScrAddrMap_); } ///////////////////////////////////////////////////////////////////////////// // first scans the blockchain and collects the registered tx (all tx relevant // to your wallet), then does a heartier scan of that subset to actually // collect balance information, utxo sets // // This method is now a hybrid of the original, Blockchain-in-RAM code, // and the new mmap()-based blockchain operations. The initial blockchain // scan will look for wallet-relevant transactions, and keep track of what // blocks still need to be scanned given the registered wallets // // Therefore, when we scan, we will first scan the registered tx list, // then any raw blocks that haven't been filtered yet, then all the // zero-conf tx list. // // If the wallet contains any addresses that are not part of the prefiltered // tx-hash-list, then the entire blockchain will have to be rescanned, anyway. // It doesn't take any less time to search for one address than it does // all of them. // // // Some new notes on this method ... // We will ONLY scan transactions from the registeredTxList_ // // Therefore, we need to make sure that registeredTxList_ is // completely up-to-date FIRST. // // Then we can sort it and scanTx all of them with the wallet. // // We need to scan from blocks X-->Y. Assume X is 1000 and Y is 2000 // If allScannedUpToBlk_==1500: // // registeredScrAddrScan from 1500-->2000 // sort registered list // scanTx all tx in registered list between 1000 and 2000 void BlockDataManager_LevelDB::scanBlockchainForTx(BtcWallet & myWallet, uint32_t startBlknum, uint32_t endBlknum, bool fetchFirst) { SCOPED_TIMER("scanBlockchainForTx"); // TODO: We should implement selective fetching! (i.e. only fetch // and register scraddr data that is between those two blocks). // At the moment, it is if(fetchFirst && DBUtils.getArmoryDbType()!=ARMORY_DB_BARE) fetchAllRegisteredScrAddrData(myWallet); // The BDM knows the highest block to which ALL CURRENT REGISTERED ADDRESSES // are up-to-date in the registeredTxList_ list. // If this wallet is not registered, it needs to be, before we start if(!walletIsRegistered(myWallet)) registerWallet( &myWallet ); // Check whether we can get everything we need from the registered tx list endBlknum = min(endBlknum, getTopBlockHeight()+1); uint32_t numRescan = numBlocksToRescan(myWallet, endBlknum); // This is the part that might take a while... //applyBlockRangeToDB(allScannedUpToBlk_, endBlknum); scanDBForRegisteredTx(allScannedUpToBlk_, endBlknum); allScannedUpToBlk_ = endBlknum; updateRegisteredScrAddrs(endBlknum); // *********************************************************************** // // Finally, walk through all the registered tx scanRegisteredTxForWallet(myWallet, startBlknum, endBlknum); // I think these lines of code where causing the serious peformance issues // so they were commented out and don't appear to be needed // if(zcEnabled_) // rescanWalletZeroConf(myWallet); } ///////////////////////////////////////////////////////////////////////////// // This used to be "rescanBlocks", but now "scanning" has been replaced by // "reapplying" the blockdata to the databases. Basically assumes that only // raw blockdata is stored in the DB with no SSH objects. This goes through // and processes every Tx, creating new SSHs if not there, and creating and // marking-spent new TxOuts. void BlockDataManager_LevelDB::applyBlockRangeToDB(uint32_t blk0, uint32_t blk1) { SCOPED_TIMER("applyBlockRangeToDB"); blk1 = min(blk1, getTopBlockHeight()+1); BinaryData startKey = DBUtils.getBlkDataKey(blk0, 0); BinaryData endKey = DBUtils.getBlkDataKey(blk1, 0); LDBIter ldbIter = iface_->getIterator(BLKDATA); ldbIter.seekTo(startKey); // Start scanning and timer //bool doBatches = (blk1-blk0 > NUM_BLKS_BATCH_THRESH); BlockWriteBatcher blockWrites(iface_); do { StoredHeader sbh; iface_->readStoredBlockAtIter(ldbIter, sbh); const uint32_t hgt = sbh.blockHeight_; const uint8_t dup = sbh.duplicateID_; if(blk0 > hgt || hgt >= blk1) break; if(hgt%2500 == 2499) LOGWARN << "Finished applying blocks up to " << (hgt+1); if(dup != iface_->getValidDupIDForHeight(hgt)) continue; // IS THIS COMMENT STILL RELEVANT? ~CS // Ugh! Design inefficiency: this loop and applyToBlockDB both use // the same iterator, which means that applyBlockToDB will usually // leave us with the iterator in a different place than we started. // I'm not clear how inefficient it is to keep re-seeking (given that // there's a lot of caching going on under-the-hood). It may be better // to have each method create its own iterator... TODO: profile/test // this idea. For now we will just save the current DB key, and // re-seek to it afterwards. blockWrites.applyBlockToDB(hgt, dup); bytesReadSoFar_ += sbh.numBytes_; // Will write out about once every 5 sec writeProgressFile(DB_BUILD_APPLY, blkProgressFile_, "applyBlockRangeToDB"); } while(iface_->advanceToNextBlock(ldbIter, false)); } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::writeProgressFile(DB_BUILD_PHASE phase, string bfile, string timerName) { // Nothing to write if we don't even have a home dir if(armoryHomeDir_.size() == 0 || bfile.size() == 0) return; time_t currTime; time(&currTime); int32_t diffTime = (int32_t)currTime - (int32_t)progressTimer_; // Don't write out more than once every 5 sec if(diffTime < 5) return; else progressTimer_ = (uint32_t)currTime; uint64_t offset; uint32_t height, blkfile; if(phase==DB_BUILD_ADD_RAW) { height = startRawBlkHgt_; blkfile = startRawBlkFile_; offset = startRawOffset_; } else if(phase==DB_BUILD_SCAN) { height = startScanHgt_; blkfile = startScanBlkFile_; offset = startScanOffset_; } else if(phase==DB_BUILD_APPLY) { height = startApplyHgt_; blkfile = startApplyBlkFile_; offset = startApplyOffset_; } else { LOGERR << "What the heck build phase are we in: " << (uint32_t)phase; return; } uint64_t startAtByte = 0; if(height!=0) startAtByte = blkFileCumul_[blkfile] + offset; ofstream topblks(OS_TranslatePath(bfile.c_str()), ios::app); double t = TIMER_READ_SEC(timerName); topblks << (uint32_t)phase << " " << startAtByte << " " << bytesReadSoFar_ << " " << totalBlockchainBytes_ << " " << t << endl; } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::pprintRegisteredWallets(void) { set::iterator iter; for(iter = registeredWallets_.begin(); iter != registeredWallets_.end(); iter++) { cout << "Wallet:"; cout << "\tBalance: " << (*iter)->getFullBalance(); cout << "\tNAddr: " << (*iter)->getNumScrAddr(); cout << "\tNTxio: " << (*iter)->getTxIOMap().size(); cout << "\tNLedg: " << (*iter)->getTxLedger().size(); cout << "\tNZC: " << (*iter)->getZeroConfLedger().size() << endl; } } ///////////////////////////////////////////////////////////////////////////// BtcWallet* BlockDataManager_LevelDB::createNewWallet(void) { BtcWallet* newWlt = new BtcWallet(this); registeredWallets_.insert(newWlt); return newWlt; } ///////////////////////////////////////////////////////////////////////////// // This assumes that registeredTxList_ has already been populated from // the initial blockchain scan. The blockchain contains millions of tx, // but this list will at least 3 orders of magnitude smaller void BlockDataManager_LevelDB::scanRegisteredTxForWallet( BtcWallet & wlt, uint32_t blkStart, uint32_t blkEnd) { SCOPED_TIMER("scanRegisteredTxForWallet"); if(!wlt.ignoreLastScanned_) blkStart = wlt.lastScanned_; else wlt.ignoreLastScanned_ = false; bool isMainWallet = true; //if(&wlt != (*registeredWallets_.begin())) isMainWallet = false; // Make sure RegisteredTx objects have correct data, then sort. // TODO: Why did I not need this with the MMAP blockchain? Somehow // I was able to sort correctly without this step, before...? list::iterator txIter; for(txIter = registeredTxList_.begin(); txIter != registeredTxList_.end(); txIter++) { if(txIter->txIndex_ > UINT32_MAX/2) { // The RegisteredTx was created before the chain was organized txIter->blkNum_ = txIter->txRefObj_.getBlockHeight(); txIter->txIndex_ = txIter->txRefObj_.getBlockTxIndex(); } } registeredTxList_.sort(); ///// LOOP OVER ALL RELEVANT TX //// for(txIter = registeredTxList_.begin(); txIter != registeredTxList_.end(); txIter++) { // Pull the tx from disk and check it for the supplied wallet Tx theTx = txIter->getTxCopy(); if( !theTx.isInitialized() ) { LOGWARN << "***WARNING: How did we get a NULL tx?"; continue; } BlockHeader* bhptr = getHeaderPtrForTx(theTx); // This condition happens on invalid Tx (like invalid P2Pool coinbases) if( bhptr==NULL ) continue; if( !bhptr->isMainBranch() ) continue; uint32_t thisBlk = bhptr->getBlockHeight(); if(thisBlk < blkStart || thisBlk >= blkEnd) continue; if( !isTxFinal(theTx) ) continue; // If we made it here, we want to scan this tx! wlt.scanTx(theTx, txIter->txIndex_, bhptr->getTimestamp(), thisBlk, isMainWallet); } wlt.sortLedger(); // We should clean up any dangling TxIOs in the wallet then rescan if(zcEnabled_) rescanWalletZeroConf(wlt); uint32_t topBlk = getTopBlockHeight(); if(blkEnd > topBlk) wlt.lastScanned_ = topBlk; else if(blkEnd!=0) wlt.lastScanned_ = blkEnd; } ///////////////////////////////////////////////////////////////////////////// uint64_t BlockDataManager_LevelDB::getDBBalanceForHash160( BinaryDataRef addr160) { StoredScriptHistory ssh; iface_->getStoredScriptHistory(ssh, HASH160PREFIX + addr160); if(!ssh.isInitialized()) return 0; return ssh.getScriptBalance(); } ///////////////////////////////////////////////////////////////////////////// uint64_t BlockDataManager_LevelDB::getDBReceivedForHash160( BinaryDataRef addr160) { StoredScriptHistory ssh; iface_->getStoredScriptHistory(ssh, HASH160PREFIX + addr160); if(!ssh.isInitialized()) return 0; return ssh.getScriptReceived(); } ///////////////////////////////////////////////////////////////////////////// vector BlockDataManager_LevelDB::getUTXOVectForHash160( BinaryDataRef addr160) { StoredScriptHistory ssh; vector outVect(0); iface_->getStoredScriptHistory(ssh, HASH160PREFIX + addr160); if(!ssh.isInitialized()) return outVect; size_t numTxo = (size_t)ssh.totalTxioCount_; outVect.reserve(numTxo); map::iterator iterSubSSH; map::iterator iterTxio; for(iterSubSSH = ssh.subHistMap_.begin(); iterSubSSH != ssh.subHistMap_.end(); iterSubSSH++) { StoredSubHistory & subSSH = iterSubSSH->second; for(iterTxio = subSSH.txioSet_.begin(); iterTxio != subSSH.txioSet_.end(); iterTxio++) { TxIOPair & txio = iterTxio->second; StoredTx stx; BinaryData txKey = txio.getTxRefOfOutput().getDBKey(); uint16_t txoIdx = txio.getIndexOfOutput(); iface_->getStoredTx(stx, txKey); StoredTxOut & stxo = stx.stxoMap_[txoIdx]; if(stxo.isSpent()) continue; UnspentTxOut utxo(stx.thisHash_, txoIdx, stx.blockHeight_, txio.getValue(), stx.stxoMap_[txoIdx].getScriptRef()); outVect.push_back(utxo); } } return outVect; } ///////////////////////////////////////////////////////////////////////////// vector BlockDataManager_LevelDB::getHistoryForScrAddr( BinaryDataRef uniqKey, bool withMultisig) { StoredScriptHistory ssh; iface_->getStoredScriptHistory(ssh, uniqKey); // "withMultisig" usually refers to whether we want to get the // multisig outputs associated with a non-multisig scrAddr. However, // if this scrAddr is, itself, a multisig scrAddr, we obviously // should include its direct history if(uniqKey[0]==SCRIPT_PREFIX_MULTISIG) withMultisig = true; map::iterator iter; iter = registeredScrAddrMap_.find(uniqKey); if(ITER_IN_MAP(iter, registeredScrAddrMap_)) { iter->second.alreadyScannedUpToBlk_ = ssh.alreadyScannedUpToBlk_; } vector outVect(0); if(!ssh.isInitialized()) return outVect; outVect.reserve((size_t)ssh.totalTxioCount_); map::iterator iterSubSSH; map::iterator iterTxio; for(iterSubSSH = ssh.subHistMap_.begin(); iterSubSSH != ssh.subHistMap_.end(); iterSubSSH++) { StoredSubHistory & subssh = iterSubSSH->second; for(iterTxio = subssh.txioSet_.begin(); iterTxio != subssh.txioSet_.end(); iterTxio++) { TxIOPair & txio = iterTxio->second; if(withMultisig || !txio.isMultisig()) outVect.push_back(txio); } } return outVect; } ///////////////////////////////////////////////////////////////////////////// /* This is not currently being used, and is actually likely to change * a bit before it is needed, so I have just disabled it. vector BlockDataManager_LevelDB::findAllNonStdTx(void) { PDEBUG("Finding all non-std tx"); vector txVectOut(0); uint32_t nHeaders = headersByHeight_.size(); ///// LOOP OVER ALL HEADERS //// for(uint32_t h=0; h const & txlist = bhr.getTxRefPtrList(); ///// LOOP OVER ALL TX ///// for(uint32_t itx=0; itxserialize().toHexStr() << endl; cout << "pprint: " << endl; BtcUtils::pprintScript(txin.getScript()); cout << endl; } } ///// LOOP OVER ALL TXOUT IN BLOCK ///// for(uint32_t iout=0; ioutgetThisHash().toHexStr() << ", " << txout.getIndex() << endl; cout << "Raw Script: " << txout.getScript().toHexStr() << endl; cout << "Raw Tx: " << txout.getParentTxPtr()->serialize().toHexStr() << endl; cout << "pprint: " << endl; BtcUtils::pprintScript(txout.getScript()); cout << endl; } } } } PDEBUG("Done finding all non-std tx"); return txVectOut; } */ static bool scanFor(std::istream &in, const uint8_t * bytes, const unsigned len) { unsigned matched=0; // how many bytes we've matched so far std::vector ahead(len); // the bytes matched in.read((char*)&ahead.front(), len); unsigned count = in.gcount(); if (count < len) return false; unsigned offset=0; // the index mod len which we're in ahead do { bool found=true; for (unsigned i=0; i < len; i++) { if (ahead[(i+offset)%len] != bytes[i]) { found=false; break; } } if (found) return true; ahead[offset++%len] = in.get(); } while (!in.eof()); return false; } ///////////////////////////////////////////////////////////////////////////// // With the LevelDB database integration, we now index all blockchain data // by block height and index (tx index in block, txout index in tx). The // only way to actually do that is to process the headers first, so that // when we do read the block data the first time, we know how to put it // into the DB. // // For now, we have no problem holding all the headers in RAM and organizing // them all in one shot. But RAM-limited devices (say, if this was going // to be ported to Android), may not be able to do even that, and may have // to read and process the headers in batches. bool BlockDataManager_LevelDB::extractHeadersInBlkFile(uint32_t fnum, uint64_t startOffset) { SCOPED_TIMER("extractHeadersInBlkFile"); missingBlockHeaderHashes_.clear(); string filename = blkFileList_[fnum]; uint64_t filesize = BtcUtils::GetFileSize(filename); if(filesize == FILE_DOES_NOT_EXIST) { LOGERR << "File does not exist: " << filename.c_str(); return false; } // This will trigger if this is the last blk file and no new blocks if(filesize < startOffset) return true; ifstream is(filename.c_str(), ios::in | ios::binary); BinaryData fileMagic(4); is.read((char*)(fileMagic.getPtr()), 4); is.seekg(startOffset, ios::beg); if( !(fileMagic == MagicBytes_ ) ) { LOGERR << "Block file is the wrong network! MagicBytes: " << fileMagic.toHexStr().c_str(); return false; } BinaryData rawHeader(HEADER_SIZE); // Some objects to help insert header data efficiently pair bhInputPair; pair::iterator, bool> bhInsResult; endOfLastBlockByte_ = startOffset; uint32_t const HEAD_AND_NTX_SZ = HEADER_SIZE + 10; // enough BinaryData magic(4), szstr(4), rawHead(HEAD_AND_NTX_SZ); while(!is.eof()) { is.read((char*)magic.getPtr(), 4); if (is.eof()) break; if(magic!=MagicBytes_) { // I have to start scanning for MagicBytes BinaryData nulls( (const uint8_t*)"\0\0\0\0", 4); if (magic == nulls) break; LOGERR << "Did not find block header in expected location, " "possible corrupt data, searching for next block header."; if (!scanFor(is, MagicBytes_.getPtr(), MagicBytes_.getSize())) { LOGERR << "No more blocks found in file " << filename; break; } LOGERR << "Next block header found at offset " << uint64_t(is.tellg())-4; } is.read((char*)szstr.getPtr(), 4); uint32_t nextBlkSize = READ_UINT32_LE(szstr.getPtr()); if(is.eof()) break; is.read((char*)rawHead.getPtr(), HEAD_AND_NTX_SZ); // plus #tx var_int if(is.eof()) break; // Create a reader for the entire block, grab header, skip rest BinaryRefReader brr(rawHead); bhInputPair.second.unserialize(brr); uint32_t nTx = (uint32_t)brr.get_var_int(); bhInputPair.first = bhInputPair.second.getThisHash(); bhInsResult = headerMap_.insert(bhInputPair); if(!bhInsResult.second) { // We exclude the genesis block which is always in the DB here if(fnum!=0 || endOfLastBlockByte_!=0) { LOGWARN << "Somehow tried to add header that's already in map"; LOGWARN << "Header Hash: " << bhInputPair.first.toHexStr().c_str(); } // But overwrite the header anyway bhInsResult.first->second = bhInputPair.second; } bhInsResult.first->second.setBlockFile(filename); bhInsResult.first->second.setBlockFileNum(fnum); bhInsResult.first->second.setBlockFileOffset(endOfLastBlockByte_); bhInsResult.first->second.setNumTx(nTx); bhInsResult.first->second.setBlockSize(nextBlkSize); endOfLastBlockByte_ += nextBlkSize+8; is.seekg(nextBlkSize - HEAD_AND_NTX_SZ, ios::cur); // now check if the previous hash is in there // (unless the previous hash is 0 if (headerMap_.find(bhInputPair.second.getPrevHash()) == headerMap_.end() && BtcUtils::EmptyHash_ != bhInputPair.second.getPrevHash()) { LOGWARN << "Block header " << bhInputPair.second.getThisHash().toHexStr() << " refers to missing previous hash " << bhInputPair.second.getPrevHash().toHexStr(); missingBlockHeaderHashes_.push_back(bhInputPair.second.getPrevHash()); } } is.close(); return true; } ///////////////////////////////////////////////////////////////////////////// uint32_t BlockDataManager_LevelDB::detectAllBlkFiles(void) { SCOPED_TIMER("detectAllBlkFiles"); // Next thing we need to do is find all the blk000X.dat files. // BtcUtils::GetFileSize uses only ifstreams, and thus should be // able to determine if a file exists in an OS-independent way. numBlkFiles_=0; totalBlockchainBytes_ = 0; blkFileList_.clear(); blkFileSizes_.clear(); blkFileCumul_.clear(); while(numBlkFiles_ < UINT16_MAX) { string path = BtcUtils::getBlkFilename(blkFileDir_, numBlkFiles_); uint64_t filesize = BtcUtils::GetFileSize(path); if(filesize == FILE_DOES_NOT_EXIST) break; numBlkFiles_++; blkFileList_.push_back(string(path)); blkFileSizes_.push_back(filesize); blkFileCumul_.push_back(totalBlockchainBytes_); totalBlockchainBytes_ += filesize; } if(numBlkFiles_==UINT16_MAX) { LOGERR << "Error finding blockchain files (blkXXXX.dat)"; return 0; } return numBlkFiles_; } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::processNewHeadersInBlkFiles(uint32_t fnumStart, uint64_t startOffset) { SCOPED_TIMER("processNewHeadersInBlkFiles"); detectAllBlkFiles(); // In first file, start at supplied offset; start at beginning for others for(uint32_t fnum=fnumStart; fnum::iterator iter; for(iter = headerMap_.begin(); iter != headerMap_.end(); iter++) { StoredHeader sbh; sbh.createFromBlockHeader(iter->second); uint8_t dup = iface_->putBareHeader(sbh); iter->second.duplicateID_ = dup; // make sure headerMap_ and DB agree } return prevTopBlkStillValid; } //////////////////////////////////////////////////////////////////////////////// // We assume that all the addresses we care about have been registered with // the BDM. Before, the BDM we would rescan the blockchain and use the method // isMineBulkFilter() to extract all "RegisteredTx" which are all tx relevant // to the list of "RegisteredScrAddr" objects. Now, the DB defaults to super- // node mode and tracks all that for us on disk. So when we start up, rather // than having to search the blockchain, we just look the StoredScriptHistory // list for each of our "RegisteredScrAddr" objects, and then pull all the // relevant tx from the database. After that, the BDM operates 99% identically // to before. We just didn't have to do a full scan to fill the RegTx list // // In the future, we will use the StoredScriptHistory objects to directly fill // the TxIOPair map -- all the data is tracked by the DB and we could pull it // directly. But that would require reorganizing a ton of BDM code, and may // be difficult to guarantee that all the previous functionality was there and // working. This way, all of our previously-tested code remains mostly // untouched void BlockDataManager_LevelDB::fetchAllRegisteredScrAddrData(void) { fetchAllRegisteredScrAddrData(registeredScrAddrMap_); } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::fetchAllRegisteredScrAddrData( BtcWallet & myWallet) { SCOPED_TIMER("fetchAllRegisteredScrAddrData"); uint32_t numAddr = myWallet.getNumScrAddr(); for(uint32_t s=0; s & addrMap) { SCOPED_TIMER("fetchAllRegisteredScrAddrData"); set::iterator wltIter; for(wltIter = registeredWallets_.begin(); wltIter != registeredWallets_.end(); wltIter++) { (*wltIter)->ignoreLastScanned_ = true; } map::iterator iter; for(iter = addrMap.begin(); iter != addrMap.end(); iter++) fetchAllRegisteredScrAddrData(iter->second.uniqueKey_); } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::fetchAllRegisteredScrAddrData( BinaryData const & scrAddr) { vector hist = getHistoryForScrAddr(scrAddr); BinaryData txKey; StoredTx stx; TxRef txref; RegisteredTx regTx; for(uint32_t i=0; igetStoredTx(stx, txref.getDBKey()); regTx = RegisteredTx(txref, stx.thisHash_, stx.blockHeight_, stx.txIndex_); insertRegisteredTxIfNew(regTx); registeredOutPoints_.insert(hist[i].getOutPoint()); txref = hist[i].getTxRefOfInput(); if(txref.isNull()) continue; // If the coins were spent, also fetch the tx in which they were spent iface_->getStoredTx(stx, txref.getDBKey()); regTx = RegisteredTx(txref, stx.thisHash_, stx.blockHeight_, stx.txIndex_); insertRegisteredTxIfNew(regTx); } } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::destroyAndResetDatabases(void) { if(iface_ != NULL) { LOGWARN << "Destroying databases; will need to be rebuilt"; iface_->destroyAndResetDatabases(); return; } LOGERR << "Attempted to destroy databases, but no DB interface set"; } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::doRebuildDatabases(void) { LOGINFO << "Executing: doRebuildDatabases"; buildAndScanDatabases(true, true, true, false); // Rescan Rebuild !Fetch Initial } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::doFullRescanRegardlessOfSync(void) { LOGINFO << "Executing: doFullRescanRegardlessOfSync"; buildAndScanDatabases(true, false, true, false); // Rescan Rebuild !Fetch Initial } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::doSyncIfNeeded(void) { LOGINFO << "Executing: doSyncIfNeeded"; buildAndScanDatabases(false, false, true, false); // Rescan Rebuild !Fetch Initial } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::doInitialSyncOnLoad(void) { LOGINFO << "Executing: doInitialSyncOnLoad"; buildAndScanDatabases(false, false, false, true); // Rescan Rebuild !Fetch Initial } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::doInitialSyncOnLoad_Rescan(void) { LOGINFO << "Executing: doInitialSyncOnLoad_Rescan"; buildAndScanDatabases(true, false, false, true); // Rescan Rebuild !Fetch Initial } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::doInitialSyncOnLoad_Rebuild(void) { LOGINFO << "Executing: doInitialSyncOnLoad_Rebuild"; buildAndScanDatabases(false, true, true, true); // Rescan Rebuild !Fetch Initial } ///////////////////////////////////////////////////////////////////////////// // This used to be "parseEntireBlockchain()", but changed because it will // only be used when rebuilding the DB from scratch (hopefully). // // The default behavior of this method is to do the minimal amount of work // neceesary to get sync'd. It does this by assuming all database data is // correct. We can choose to rebuild/recalculate. "forceRescan" and // "skipFetch" are slightly different: forceRescan will guarantee that // we always start scanning from block 0. skipFetch means we won't pull // any data out of the database when this is called, but if all our // wallets are already synchronized, we won't bother rescanning void BlockDataManager_LevelDB::buildAndScanDatabases( bool forceRescan, bool forceRebuild, bool skipFetch, bool initialLoad) { missingBlockHashes_.clear(); SCOPED_TIMER("buildAndScanDatabases"); LOGINFO << "Number of registered addr: " << registeredScrAddrMap_.size(); // Will use this updating the GUI with progress bar time_t t; time(&t); progressTimer_ = (uint32_t)t; if(!iface_->databasesAreOpen()) initializeDBInterface(DBUtils.getArmoryDbType(), DBUtils.getDbPruneType()); LOGDEBUG << "Called build&scan with (" << (forceRescan ? 1 : 0) << "," << (forceRebuild ? 1 : 0) << "," << (skipFetch ? 1 : 0) << "," << (initialLoad ? 1 : 0) << ")"; // This will figure out where we should start reading headers, blocks, // and where we should start applying or scanning detectCurrentSyncState(forceRebuild, initialLoad); // If we're going to rebuild, might as well destroy the DB for good measure if(forceRebuild || (startHeaderHgt_==0 && startRawBlkHgt_==0)) { LOGINFO << "Clearing databases for clean build"; forceRebuild = true; forceRescan = true; skipFetch = true; destroyAndResetDatabases(); } // If we're going to be rescanning, reset the wallets if(forceRescan) { LOGINFO << "Resetting wallets for rescan"; skipFetch = true; deleteHistories(); resetRegisteredWallets(); } // If no rescan is forced, grab the SSH entries from the DB if(!skipFetch && initialLoad) { LOGINFO << "Fetching stored script histories from DB"; fetchAllRegisteredScrAddrData(); } // Remove this file #ifndef _MSC_VER if(BtcUtils::GetFileSize(blkProgressFile_) != FILE_DOES_NOT_EXIST) remove(blkProgressFile_.c_str()); if(BtcUtils::GetFileSize(abortLoadFile_) != FILE_DOES_NOT_EXIST) remove(abortLoadFile_.c_str()); #else if(BtcUtils::GetFileSize(blkProgressFile_) != FILE_DOES_NOT_EXIST) _wunlink(OS_TranslatePath(blkProgressFile_).c_str()); if(BtcUtils::GetFileSize(abortLoadFile_) != FILE_DOES_NOT_EXIST) _wunlink(OS_TranslatePath(abortLoadFile_).c_str()); #endif if(!initialLoad) detectAllBlkFiles(); // only need to spend time on this on the first call if(numBlkFiles_==0) { LOGERR << "No blockfiles could be found! Aborting..."; return; } if(GenesisHash_.getSize() == 0) { LOGERR << "***ERROR: Set net params before loading blockchain!"; return; } ///////////////////////////////////////////////////////////////////////////// // New with LevelDB: must read and organize headers before handling the // full blockchain data. We need to figure out the longest chain and write // the headers to the DB before actually processing any block data. if(initialLoad || forceRebuild) { LOGINFO << "Reading all headers and building chain..."; processNewHeadersInBlkFiles(startHeaderBlkFile_, startHeaderOffset_); } LOGINFO << "Total number of blk*.dat files: " << numBlkFiles_; LOGINFO << "Total number of blocks found: " << getTopBlockHeight() + 1; ///////////////////////////////////////////////////////////////////////////// // Now we start the meat of this process... ///////////////////////////////////////////////////////////////////////////// // Add the raw blocks from the blk*.dat files into the DB blocksReadSoFar_ = 0; bytesReadSoFar_ = 0; if(initialLoad || forceRebuild) { LOGINFO << "Getting latest blocks from blk*.dat files"; LOGINFO << "Total blockchain bytes: " << BtcUtils::numToStrWCommas(totalBlockchainBytes_); TIMER_START("dumpRawBlocksToDB"); for(uint32_t fnum=startRawBlkFile_; fnum576 ? startScanHgt_-576 : 0); pair blkLoc = findFileAndOffsetForHgt(startScanHgt_); startScanBlkFile_ = blkLoc.first; startScanOffset_ = blkLoc.second; } LOGINFO << "Starting scan from block height: " << startScanHgt_; scanDBForRegisteredTx(startScanHgt_); LOGINFO << "Finished blockchain scan in " << TIMER_READ_SEC("ScanBlockchain") << " seconds"; } // If bare mode, we don't do if(DBUtils.getArmoryDbType() != ARMORY_DB_BARE) { // In any DB type other than bare, we will be walking through the blocks // and updating the spentness fields and script histories applyBlockRangeToDB(startApplyHgt_, getTopBlockHeight()+1); } // We need to maintain the physical size of all blkXXXX.dat files together totalBlockchainBytes_ = bytesReadSoFar_; // Update registered address list so we know what's already been scanned lastTopBlock_ = getTopBlockHeight() + 1; allScannedUpToBlk_ = lastTopBlock_; LOGINFO << "Updating registered addresses"; updateRegisteredScrAddrs(lastTopBlock_); // Since loading takes so long, there's a good chance that new block data // came in... let's get it. readBlkFileUpdate(); uint32_t nWallet = 0; LOGINFO << "Scanning Wallets"; set::iterator wltIter; for(wltIter = registeredWallets_.begin(); wltIter != registeredWallets_.end(); wltIter++) { nWallet++; BtcWallet* wlt = *wltIter; if(forceRebuild || forceRescan || skipFetch) wlt->ignoreLastScanned_ = true; LOGINFO << "Scanning Wallet #" << nWallet << " from height " << (wlt->ignoreLastScanned_ ? 0 : wlt->lastScanned_); scanRegisteredTxForWallet(*wlt, 0, lastTopBlock_); } isInitialized_ = true; purgeZeroConfPool(); #ifdef _DEBUG UniversalTimer::instance().printCSV(string("timings.csv")); #ifdef _DEBUG_FULL_VERBOSE UniversalTimer::instance().printCSV(cout,true); #endif #endif /* for(iter = registeredScrAddrMap_.begin(); iter != registeredScrAddrMap_.end(); iter ++) LOGINFO << "ScrAddr: " << iter->second.uniqueKey_.toHexStr().c_str() << " " << iter->second.alreadyScannedUpToBlk_; */ } // search for the next byte in bsb that looks like it could be a block bool BlockDataManager_LevelDB::scanForMagicBytes(BinaryStreamBuffer& bsb, uint32_t *bytesSkipped) const { BinaryData firstFour(4); if (bytesSkipped) *bytesSkipped=0; do { while (bsb.reader().getSizeRemaining() >= 4) { bsb.reader().get_BinaryData(firstFour, 4); if(firstFour==MagicBytes_) { bsb.reader().rewind(4); return true; } // try again at the very next byte if (bytesSkipped) (*bytesSkipped)++; bsb.reader().rewind(3); } } while (bsb.streamPull()); return false; } //////////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::readRawBlocksInFile(uint32_t fnum, uint32_t foffset) { string blkfile = blkFileList_[fnum]; uint64_t filesize = BtcUtils::GetFileSize(blkfile); string fsizestr = BtcUtils::numToStrWCommas(filesize); LOGINFO << blkfile.c_str() << " is " << fsizestr.c_str() << " bytes"; // Open the file, and check the magic bytes on the first block ifstream is(blkfile.c_str(), ios::in | ios::binary); BinaryData fileMagic(4); is.read((char*)(fileMagic.getPtr()), 4); if( !(fileMagic == MagicBytes_ ) ) { LOGERR << "Block file is the wrong network! MagicBytes: " << fileMagic.toHexStr().c_str(); } // Seek to the supplied offset is.seekg(foffset, ios::beg); uint64_t dbUpdateSize=0; BinaryStreamBuffer bsb; bsb.attachAsStreamBuffer(is, (uint32_t)filesize-foffset); bool alreadyRead8B = false; uint32_t nextBlkSize; bool isEOF = false; BinaryData firstFour(4); // We use these two vars to stop parsing if we exceed the last header // that was processed (a new block was added since we processed headers) bool breakbreak = false; uint32_t locInBlkFile = foffset; iface_->startBatch(BLKDATA); unsigned failedAttempts=0; // It turns out that this streambuffering is probably not helping, but // it doesn't hurt either, so I'm leaving it alone while(bsb.streamPull()) { while(bsb.reader().getSizeRemaining() >= 8) { if(!alreadyRead8B) { bsb.reader().get_BinaryData(firstFour, 4); if(firstFour!=MagicBytes_) { isEOF = true; break; } nextBlkSize = bsb.reader().get_uint32_t(); bytesReadSoFar_ += 8; locInBlkFile += 8; } if(bsb.reader().getSizeRemaining() < nextBlkSize) { alreadyRead8B = true; break; } alreadyRead8B = false; BinaryRefReader brr(bsb.reader().getCurrPtr(), nextBlkSize); try { addRawBlockToDB(brr); } catch (BlockDeserializingException &e) { LOGERR << e.what() << " (error encountered processing block at byte " << locInBlkFile << " file " << blkfile << ", blocksize " << nextBlkSize << ")"; failedAttempts++; if (failedAttempts >= 4) { // It looks like this file is irredeemably corrupt LOGERR << "Giving up searching " << blkfile << " after having found 4 block headers with unparseable contents"; breakbreak=true; break; } uint32_t bytesSkipped; const bool next = scanForMagicBytes(bsb, &bytesSkipped); if (!next) { LOGERR << "Could not find another block in the file"; breakbreak=true; break; } else { locInBlkFile += bytesSkipped; LOGERR << "Found another block header at " << locInBlkFile; } continue; } dbUpdateSize += nextBlkSize; if(dbUpdateSize>BlockWriteBatcher::UPDATE_BYTES_THRESH && iface_->isBatchOn(BLKDATA)) { dbUpdateSize = 0; iface_->commitBatch(BLKDATA); iface_->startBatch(BLKDATA); } blocksReadSoFar_++; bytesReadSoFar_ += nextBlkSize; locInBlkFile += nextBlkSize; bsb.reader().advance(nextBlkSize); // This is a hack of hacks, but I can't seem to pass this data // out through getLoadProgress* methods, because they don't // update properly (from the main python thread) when the BDM // is actively loading/scanning in a separate thread. // We'll watch for this file from the python code. writeProgressFile(DB_BUILD_ADD_RAW, blkProgressFile_, "dumpRawBlocksToDB"); // Don't read past the last header we processed (in case new // blocks were added since we processed the headers if(fnum == numBlkFiles_-1 && locInBlkFile >= endOfLastBlockByte_) { breakbreak = true; break; } } if(isEOF || breakbreak) break; } if(iface_->isBatchOn(BLKDATA)) iface_->commitBatch(BLKDATA); } //////////////////////////////////////////////////////////////////////////////// StoredHeader BlockDataManager_LevelDB::getBlockFromDB(uint32_t hgt, uint8_t dup) { StoredHeader nullSBH; StoredHeader returnSBH; LDBIter ldbIter = iface_->getIterator(BLKDATA); BinaryData firstKey = DBUtils.getBlkDataKey(hgt, dup); if(!ldbIter.seekToExact(firstKey)) return nullSBH; // Get the full block from the DB iface_->readStoredBlockAtIter(ldbIter, returnSBH); if(returnSBH.blockHeight_ != hgt || returnSBH.duplicateID_ != dup) return nullSBH; return returnSBH; } //////////////////////////////////////////////////////////////////////////////// uint8_t BlockDataManager_LevelDB::getMainDupFromDB(uint32_t hgt) { return iface_->getValidDupIDForHeight(hgt); } //////////////////////////////////////////////////////////////////////////////// StoredHeader BlockDataManager_LevelDB::getMainBlockFromDB(uint32_t hgt) { uint8_t dupMain = iface_->getValidDupIDForHeight(hgt); return getBlockFromDB(hgt, dupMain); } //////////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::scanDBForRegisteredTx(uint32_t blk0, uint32_t blk1) { SCOPED_TIMER("scanDBForRegisteredTx"); bytesReadSoFar_ = 0; bool doScanProgressThing = (blk1-blk0 > NUM_BLKS_IS_DIRTY); if(doScanProgressThing) { //if(BtcUtils::GetFileSize(bfile) != FILE_DOES_NOT_EXIST) //remove(bfile.c_str()); } LDBIter ldbIter = iface_->getIterator(BLKDATA, BULK_SCAN); BinaryData firstKey = DBUtils.getBlkDataKey(blk0, 0); ldbIter.seekTo(firstKey); TIMER_START("ScanBlockchain"); while(ldbIter.isValid(DB_PREFIX_TXDATA)) { // Get the full block from the DB StoredHeader sbh; iface_->readStoredBlockAtIter(ldbIter, sbh); bytesReadSoFar_ += sbh.numBytes_; uint32_t hgt = sbh.blockHeight_; uint8_t dup = sbh.duplicateID_; uint8_t dupMain = iface_->getValidDupIDForHeight(hgt); if(!sbh.isMainBranch_ || dup != dupMain) continue; if(hgt >= blk1) break; // If we're here, we need to check the tx for relevance to the // global scrAddr list. Add to registered Tx map if so map::iterator iter; for(iter = sbh.stxMap_.begin(); iter != sbh.stxMap_.end(); iter++) { StoredTx & stx = iter->second; registeredScrAddrScan_IterSafe(stx); } // This will write out about once every 5 sec writeProgressFile(DB_BUILD_SCAN, blkProgressFile_, "ScanBlockchain"); } TIMER_STOP("ScanBlockchain"); } //////////////////////////////////////////////////////////////////////////////// // Deletes all SSH entries in the database void BlockDataManager_LevelDB::deleteHistories(void) { SCOPED_TIMER("deleteHistories"); LDBIter ldbIter = iface_->getIterator(BLKDATA); if(!ldbIter.seekToStartsWith(DB_PREFIX_SCRIPT, BinaryData(0))) return; ////////// iface_->startBatch(BLKDATA); do { BinaryData key = ldbIter.getKey(); if(key.getSize() == 0) break; if(key[0] != (uint8_t)DB_PREFIX_SCRIPT) break; iface_->deleteValue(BLKDATA, key); } while(ldbIter.advanceAndRead(DB_PREFIX_SCRIPT)); ////////// iface_->commitBatch(BLKDATA); } //////////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::saveScrAddrHistories(void) { LOGINFO << "Saving wallet history to DB"; if(DBUtils.getArmoryDbType() != ARMORY_DB_BARE) { LOGERR << "Should only use saveScrAddrHistories in ARMORY_DB_BARE mode"; LOGERR << "Aborting save operation."; return; } iface_->startBatch(BLKDATA); uint32_t i=0; set::iterator wltIter; for(wltIter = registeredWallets_.begin(); wltIter != registeredWallets_.end(); wltIter++) { for(uint32_t a=0; a<(*wltIter)->getNumScrAddr(); a++) { ScrAddrObj & scrAddr = (*wltIter)->getScrAddrObjByIndex(a); BinaryData uniqKey = scrAddr.getScrAddr(); if(KEY_NOT_IN_MAP(uniqKey, registeredScrAddrMap_)) { LOGERR << "How does the wallet have a non-registered ScrAddr?"; LOGERR << uniqKey.toHexStr().c_str(); continue; } RegisteredScrAddr & rsa = registeredScrAddrMap_[uniqKey]; vector & txioList = scrAddr.getTxIOList(); StoredScriptHistory ssh; ssh.uniqueKey_ = scrAddr.getScrAddr(); ssh.version_ = ARMORY_DB_VERSION; ssh.alreadyScannedUpToBlk_ = rsa.alreadyScannedUpToBlk_; for(uint32_t t=0; tputStoredScriptHistory(ssh); } } iface_->commitBatch(BLKDATA); } //////////////////////////////////////////////////////////////////////////////// // This method checks whether your blk0001.dat file is bigger than it was when // we first read in the blockchain. If so, we read the new data and add it to // the memory pool. Return value is how many blocks were added. // // NOTE: You might want to check lastBlockWasReorg_ variable to know whether // to expect some previously valid headers/txs to still be valid // uint32_t BlockDataManager_LevelDB::readBlkFileUpdate(void) { SCOPED_TIMER("readBlkFileUpdate"); // Make sure the file exists and is readable string filename = blkFileList_[blkFileList_.size()-1]; uint64_t filesize = FILE_DOES_NOT_EXIST; ifstream is(OS_TranslatePath(filename).c_str(), ios::in|ios::binary); if(is.is_open()) { is.seekg(0, ios::end); filesize = (size_t)is.tellg(); } uint32_t prevTopBlk = getTopBlockHeight()+1; uint64_t currBlkBytesToRead; if( filesize == FILE_DOES_NOT_EXIST ) { LOGERR << "***ERROR: Cannot open " << filename.c_str(); return 0; } else if((int64_t)filesize-(int64_t)endOfLastBlockByte_ < 8) { // This condition triggers if we hit the end of the file -- will // usually only be triggered by Bitcoin-Qt/bitcoind pre-0.8 currBlkBytesToRead = 0; } else { // For post-0.8, the filesize will almost always be larger (padded). // Keep checking where we expect to see magic bytes, we know we're // at the end if we see zero-bytes instead. uint64_t endOfNewLastBlock = endOfLastBlockByte_; BinaryData fourBytes(4); while((int64_t)filesize - (int64_t)endOfNewLastBlock >= 8) { is.seekg(endOfNewLastBlock, ios::beg); is.read((char*)fourBytes.getPtr(), 4); if(fourBytes != MagicBytes_) break; else { is.read((char*)fourBytes.getPtr(), 4); endOfNewLastBlock += READ_UINT32_LE((fourBytes.getPtr())) + 8; } } currBlkBytesToRead = endOfNewLastBlock - endOfLastBlockByte_; } // Check to see if there was a blkfile split, and we have to switch // to tracking the new file.. this condition triggers about once a week string nextFilename = BtcUtils::getBlkFilename(blkFileDir_, numBlkFiles_); uint64_t nextBlkBytesToRead = BtcUtils::GetFileSize(nextFilename); if(nextBlkBytesToRead == FILE_DOES_NOT_EXIST) nextBlkBytesToRead = 0; else LOGINFO << "New block file split! " << nextFilename.c_str(); // If there is no new data, no need to continue if(currBlkBytesToRead==0 && nextBlkBytesToRead==0) return 0; // Observe if everything was up to date when we started, because we're // going to add new blockchain data and don't want to trigger a rescan // if this is just a normal update. const uint32_t nextBlk = getTopBlockHeight() + 1; const bool prevRegisteredUpToDate = (allScannedUpToBlk_==nextBlk); // Pull in the remaining data in old/curr blkfile, and beginning of new BinaryData newBlockDataRaw((size_t)(currBlkBytesToRead+nextBlkBytesToRead)); // Seek to the beginning of the new data and read it if(currBlkBytesToRead>0) { ifstream is(filename.c_str(), ios::in | ios::binary); is.seekg(endOfLastBlockByte_, ios::beg); is.read((char*)newBlockDataRaw.getPtr(), currBlkBytesToRead); is.close(); } // If a new block file exists, read that one too // nextBlkBytesToRead will include up to 16 MB of padding if our gateway // is a bitcoind/qt 0.8+ node. Either way, it will be easy to detect when // we've reached the end of the real data, as long as there is no gap // between the end of currBlk data and the start of newBlk data (there isn't) if(nextBlkBytesToRead>0) { uint8_t* ptrNextData = newBlockDataRaw.getPtr() + currBlkBytesToRead; ifstream is(nextFilename.c_str(), ios::in | ios::binary); is.read((char*)ptrNextData, nextBlkBytesToRead); is.close(); } // Walk through each of the new blocks, adding each one to RAM and DB // Do a full update of everything after each block, for simplicity // (which means we may be adding a couple blocks, the first of which // may appear valid but orphaned by later blocks -- that's okay as // we'll just reverse it when we add the later block -- this is simpler) BinaryRefReader brr(newBlockDataRaw); BinaryData fourBytes(4); uint32_t nBlkRead = 0; vector blockAddResults; bool keepGoing = true; while(keepGoing) { // We concatenated all data together, even if across two files // Check which file data belongs to and set FileDataPtr appropriately uint32_t useFileIndex0Idx = numBlkFiles_-1; uint32_t bhOffset = (uint32_t)(endOfLastBlockByte_ + 8); if(brr.getPosition() >= currBlkBytesToRead) { useFileIndex0Idx = numBlkFiles_; bhOffset = (uint32_t)(brr.getPosition() - currBlkBytesToRead + 8); } //////////// // The reader should be at the start of magic bytes of the new block brr.get_BinaryData(fourBytes, 4); if(fourBytes != MagicBytes_) break; uint32_t nextBlockSize = brr.get_uint32_t(); blockAddResults = addNewBlockData(brr, useFileIndex0Idx, bhOffset, nextBlockSize); bool blockAddSucceeded = blockAddResults[ADD_BLOCK_SUCCEEDED ]; bool blockIsNewTop = blockAddResults[ADD_BLOCK_NEW_TOP_BLOCK]; bool blockchainReorg = blockAddResults[ADD_BLOCK_CAUSED_REORG ]; if(blockAddSucceeded) nBlkRead++; if(blockchainReorg) { LOGWARN << "Blockchain Reorganization detected!"; reassessAfterReorg(prevTopBlockPtr_, topBlockPtr_, reorgBranchPoint_); purgeZeroConfPool(); // Update all the registered wallets... updateWalletsAfterReorg(registeredWallets_); } else if(blockIsNewTop) { BlockHeader & bh = getTopBlockHeader(); uint32_t hgt = bh.getBlockHeight(); uint8_t dup = bh.getDuplicateID(); if(DBUtils.getArmoryDbType() != ARMORY_DB_BARE) { LOGINFO << "Applying block to DB!"; BlockWriteBatcher batcher(iface_); batcher.applyBlockToDB(hgt, dup); } // Replaced this with the scanDBForRegisteredTx call outside the loop //StoredHeader sbh; //iface_->getStoredHeader(sbh, hgt, dup); //map::iterator iter; //for(iter = sbh.stxMap_.begin(); iter != sbh.stxMap_.end(); iter++) //{ //Tx regTx = iter->second.getTxCopy(); //registeredScrAddrScan(regTx.getPtr(), regTx.getSize()); //} } else { LOGWARN << "Block data did not extend the main chain!"; // New block was added -- didn't cause a reorg but it's not the // new top block either (it's a fork block). We don't do anything // at all until the reorg actually happens } if(brr.isEndOfStream() || brr.getSizeRemaining() < 8) keepGoing = false; } lastTopBlock_ = getTopBlockHeight()+1; purgeZeroConfPool(); scanDBForRegisteredTx(prevTopBlk, lastTopBlock_); if(prevRegisteredUpToDate) { allScannedUpToBlk_ = getTopBlockHeight()+1; updateRegisteredScrAddrs(allScannedUpToBlk_); } // If the blk file split, switch to tracking it LOGINFO << "Added new blocks to memory pool: " << nBlkRead; // If we pull non-zero amount of data from next block file...there // was a blkfile split! if(nextBlkBytesToRead>0) { numBlkFiles_ += 1; blkFileList_.push_back(nextFilename); } #ifdef _DEBUG UniversalTimer::instance().printCSV(string("timings.csv")); #ifdef _DEBUG_FULL_VERBOSE UniversalTimer::instance().printCSV(cout,true); #endif #endif return nBlkRead; } //////////////////////////////////////////////////////////////////////////////// // BDM detects the reorg, but is wallet-agnostic so it can't update any wallets // You have to call this yourself after you check whether the last organizeChain // call indicated that a reorg happened void BlockDataManager_LevelDB::updateWalletAfterReorg(BtcWallet & wlt) { SCOPED_TIMER("updateWalletAfterReorg"); uint32_t changeToBlkNum; // Fix the wallet's ledger vector & ledg = wlt.getTxLedger(); for(uint32_t i=0; i 0) ledg[i].setValid(false); if(txJustAffected_.count(txHash) > 0) ledg[i].changeBlkNum(getTxRefByHash(txHash).getBlockHeight()); } // Now fix the individual address ledgers for(uint32_t a=0; a & addrLedg = addr.getTxLedger(); for(uint32_t i=0; i 0) addrLedg[i].setValid(false); if(txJustAffected_.count(txHash) > 0) { changeToBlkNum = getTxRefByHash(txHash).getBlockHeight(); addrLedg[i].changeBlkNum(changeToBlkNum); wlt.reorgChangeBlkNum(changeToBlkNum); } } } } ///////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::updateWalletsAfterReorg(vector wltvect) { for(uint32_t i=0; i wltset) { set::iterator iter; for(iter = wltset.begin(); iter != wltset.end(); iter++) updateWalletAfterReorg(**iter); } ///////////////////////////////////////////////////////////////////////////// /* This was never actually used bool BlockDataManager_LevelDB::verifyBlkFileIntegrity(void) { SCOPED_TIMER("verifyBlkFileIntegrity"); PDEBUG("Verifying blk0001.dat integrity"); bool isGood = true; map::iterator headIter; for(headIter = headerMap_.begin(); headIter != headerMap_.end(); headIter++) { BlockHeader & bhr = headIter->second; bool thisHeaderIsGood = bhr.verifyIntegrity(); if( !thisHeaderIsGood ) { cout << "Blockfile contains incorrect header or tx data:" << endl; cout << " Block number: " << bhr.getBlockHeight() << endl; cout << " Block hash (BE): " << endl; cout << " " << bhr.getThisHash().copySwapEndian().toHexStr() << endl; cout << " Num Tx : " << bhr.getNumTx() << endl; //cout << " Tx Hash List: (compare to raw tx data on blockexplorer)" << endl; //for(uint32_t t=0; tgetThisHash().copySwapEndian().toHexStr() << endl; } isGood = isGood && thisHeaderIsGood; } return isGood; PDEBUG("Done verifying blockfile integrity"); } */ ///////////////////////////////////////////////////////////////////////////// // Pass in a BRR that starts at the beginning of the serialized block, // i.e. the first 80 bytes of this BRR is the blockheader /* bool BlockDataManager_LevelDB::parseNewBlock(BinaryRefReader & brr, uint32_t fileIndex0Idx, uint32_t thisHeaderOffset, uint32_t blockSize) { if(brr.getSizeRemaining() < blockSize || brr.isEndOfStream()) { LOGERR << "***ERROR: parseNewBlock did not get enough data..."; return false; } // Create the objects once that will be used for insertion // (txInsResult always succeeds--because multimap--so only iterator returns) static pair bhInputPair; static pair::iterator, bool> bhInsResult; // Read the header and insert it into the map. bhInputPair.second.unserialize(brr); bhInputPair.first = bhInputPair.second.getThisHash(); bhInsResult = headerMap_.insert(bhInputPair); BlockHeader * bhptr = &(bhInsResult.first->second); if(!bhInsResult.second) *bhptr = bhInsResult.first->second; // overwrite it even if insert fails // Then put the bare header into the DB and get its duplicate ID. StoredHeader sbh; sbh.createFromBlockHeader(*bhptr); uint8_t dup = iface_->putBareHeader(sbh); bhptr->setDuplicateID(dup); // Regardless of whether this was a reorg, we have to add the raw block // to the DB, but we don't apply it yet. brr.rewind(HEADER_SIZE); addRawBlockToDB(brr); // Note where we will start looking for the next block, later endOfLastBlockByte_ = thisHeaderOffset + blockSize; // Read the #tx and fill in some header properties uint8_t viSize; uint32_t nTx = (uint32_t)brr.get_var_int(&viSize); // The file offset of the first tx in this block is after the var_int uint32_t txOffset = thisHeaderOffset + HEADER_SIZE + viSize; // Read each of the Tx //bhptr->txPtrList_.resize(nTx); uint32_t txSize; static vector offsetsIn; static vector offsetsOut; static BinaryData hashResult(32); for(uint32_t i=0; i BlockDataManager_LevelDB::addNewBlockData( BinaryRefReader & brrRawBlock, uint32_t fileIndex0Idx, uint32_t thisHeaderOffset, uint32_t blockSize) { SCOPED_TIMER("addNewBlockData"); uint8_t const * startPtr = brrRawBlock.getCurrPtr(); HashString newHeadHash = BtcUtils::getHash256(startPtr, HEADER_SIZE); vector vb(3); vb[ADD_BLOCK_SUCCEEDED] = false; // Added to memory pool vb[ADD_BLOCK_NEW_TOP_BLOCK] = false; // New block is new top of chain vb[ADD_BLOCK_CAUSED_REORG] = false; // Add caused reorganization ///////////////////////////////////////////////////////////////////////////// // This used to be in parseNewBlock(...) but relocated here because it's // not duplicated anywhere, and during the upgrade to LevelDB I needed // the code flow to be more linear in order to figure out how to put // all the pieces together properly. I may refactor this code out into // its own method again, later if(brrRawBlock.getSizeRemaining() < blockSize || brrRawBlock.isEndOfStream()) { LOGERR << "***ERROR: parseNewBlock did not get enough data..."; return vb; } // Create the objects once that will be used for insertion // (txInsResult always succeeds--because multimap--so only iterator returns) static pair bhInputPair; static pair::iterator, bool> bhInsResult; // Read the header and insert it into the map. bhInputPair.second.unserialize(brrRawBlock); bhInputPair.first = bhInputPair.second.getThisHash(); bhInsResult = headerMap_.insert(bhInputPair); BlockHeader * bhptr = &(bhInsResult.first->second); if(!bhInsResult.second) *bhptr = bhInputPair.second; // overwrite it even if insert fails // Finally, let's re-assess the state of the blockchain with the new data // Check the lastBlockWasReorg_ variable to see if there was a reorg bool prevTopBlockStillValid = organizeChain(); lastBlockWasReorg_ = !prevTopBlockStillValid; // Then put the bare header into the DB and get its duplicate ID. StoredHeader sbh; sbh.createFromBlockHeader(*bhptr); uint8_t dup = iface_->putBareHeader(sbh); bhptr->setDuplicateID(dup); // Regardless of whether this was a reorg, we have to add the raw block // to the DB, but we don't apply it yet. brrRawBlock.rewind(HEADER_SIZE); addRawBlockToDB(brrRawBlock); // Note where we will start looking for the next block, later endOfLastBlockByte_ = thisHeaderOffset + blockSize; /* From parseNewBlock but not needed here in the new code // Read the #tx and fill in some header properties uint8_t viSize; uint32_t nTx = (uint32_t)brrRawBlock.get_var_int(&viSize); // The file offset of the first tx in this block is after the var_int uint32_t txOffset = thisHeaderOffset + HEADER_SIZE + viSize; // Read each of the Tx //bhptr->txPtrList_.resize(nTx); uint32_t txSize; static vector offsetsIn; static vector offsetsOut; static BinaryData hashResult(32); for(uint32_t i=0; iisMainBranch(); // This method passes out 3 booleans vb[ADD_BLOCK_SUCCEEDED] = true; vb[ADD_BLOCK_NEW_TOP_BLOCK] = newBlockIsNewTop; vb[ADD_BLOCK_CAUSED_REORG] = !prevTopBlockStillValid; // We actually accessed the pointer directly in this method, without // advancing the BRR position. But the outer function expects to see // the new location we would've been at if the BRR was used directly. brrRawBlock.advance(blockSize); return vb; } // This piece may be useful for adding new data, but I don't want to enforce it, // yet /* #ifndef _DEBUG // In the real client, we want to execute these checks. But we may want // to pass in hand-made data when debugging, and don't want to require // the hand-made blocks to have leading zeros. if(! (headHash.getSliceCopy(28,4) == BtcUtils::EmptyHash_.getSliceCopy(28,4))) { cout << "***ERROR: header hash does not have leading zeros" << endl; cerr << "***ERROR: header hash does not have leading zeros" << endl; return true; // no data added, so no reorg } // Same story with merkle roots in debug mode HashString merkleRoot = BtcUtils::calculateMerkleRoot(txHashes); if(! (merkleRoot == BinaryDataRef(rawHeader.getPtr() + 36, 32))) { cout << "***ERROR: merkle root does not match header data" << endl; cerr << "***ERROR: merkle root does not match header data" << endl; return true; // no data added, so no reorg } #endif */ //////////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::reassessAfterReorg( BlockHeader* oldTopPtr, BlockHeader* newTopPtr, BlockHeader* branchPtr) { SCOPED_TIMER("reassessAfterReorg"); LOGINFO << "Reassessing Tx validity after reorg"; // Walk down invalidated chain first, until we get to the branch point // Mark transactions as invalid txJustInvalidated_.clear(); txJustAffected_.clear(); BlockWriteBatcher blockWrites(iface_); BlockHeader* thisHeaderPtr = oldTopPtr; LOGINFO << "Invalidating old-chain transactions..."; while(thisHeaderPtr != branchPtr) { uint32_t hgt = thisHeaderPtr->getBlockHeight(); uint8_t dup = thisHeaderPtr->getDuplicateID(); if(DBUtils.getArmoryDbType() != ARMORY_DB_BARE) { // Added with leveldb... in addition to reversing blocks in RAM, // we also need to undo the blocks in the DB StoredUndoData sud; createUndoDataFromBlock(hgt, dup, sud); blockWrites.undoBlockFromDB(sud); } StoredHeader sbh; iface_->getStoredHeader(sbh, hgt, dup, true); // This is the original, tested, reorg code previouslyValidBlockHeaderPtrs_.push_back(thisHeaderPtr); for(uint32_t i=0; igetPrevHash()); } // Walk down the newly-valid chain and mark transactions as valid. If // a tx is in both chains, it will still be valid after this process // UPDATE for LevelDB upgrade: // This used to start from the new top block and walk down, but // I need to apply the blocks in order, so I switched it to start // from the branch point and walk up thisHeaderPtr = branchPtr; // note branch block was not undone, skip it LOGINFO << "Marking new-chain transactions valid..."; while( thisHeaderPtr->getNextHash() != BtcUtils::EmptyHash_ && thisHeaderPtr->getNextHash().getSize() > 0 ) { thisHeaderPtr = getHeaderByHash(thisHeaderPtr->getNextHash()); uint32_t hgt = thisHeaderPtr->getBlockHeight(); uint8_t dup = thisHeaderPtr->getDuplicateID(); iface_->markBlockHeaderValid(hgt, dup); StoredHeader sbh; iface_->getStoredHeader(sbh, hgt, dup, true); if(DBUtils.getArmoryDbType() != ARMORY_DB_BARE) blockWrites.applyBlockToDB(sbh); for(uint32_t i=0; i BlockDataManager_LevelDB::getHeadersNotOnMainChain(void) { SCOPED_TIMER("getHeadersNotOnMainChain"); PDEBUG("Getting headers not on main chain"); vector out(0); map::iterator iter; for(iter = headerMap_.begin(); iter != headerMap_.end(); iter++) { if( ! iter->second.isMainBranch() ) out.push_back(&(iter->second)); } PDEBUG("Getting headers not on main chain"); return out; } //////////////////////////////////////////////////////////////////////////////// // This returns false if our new main branch does not include the previous // topBlock. If this returns false, that probably means that we have // previously considered some blocks to be valid that no longer are valid. // TODO: Figure out if there is an elegant way to deal with a forked // blockchain containing two equal-length chains bool BlockDataManager_LevelDB::organizeChain(bool forceRebuild) { SCOPED_TIMER("organizeChain"); // Why did this line not through an error? I left here to remind // myself to go figure it out. //LOGINFO << ("Organizing chain", (forceRebuild ? "w/ rebuild" : "")); LOGDEBUG << "Organizing chain " << (forceRebuild ? "w/ rebuild" : ""); // If rebuild, we zero out any original organization data and do a // rebuild of the chain from scratch. This will need to be done in // the event that our first call to organizeChain returns false, which // means part of blockchain that was previously valid, has become // invalid. Rather than get fancy, just rebuild all which takes less // than a second, anyway. if(forceRebuild) { map::iterator iter; for( iter = headerMap_.begin(); iter != headerMap_.end(); iter++) { iter->second.difficultySum_ = -1; iter->second.blockHeight_ = 0; iter->second.isFinishedCalc_ = false; iter->second.nextHash_ = BtcUtils::EmptyHash_; iter->second.isMainBranch_ = false; } topBlockPtr_ = NULL; } // Set genesis block BlockHeader & genBlock = getGenesisBlock(); genBlock.blockHeight_ = 0; genBlock.difficultyDbl_ = 1.0; genBlock.difficultySum_ = 1.0; genBlock.isMainBranch_ = true; genBlock.isOrphan_ = false; genBlock.isFinishedCalc_ = true; genBlock.isInitialized_ = true; // If this is the first run, the topBlock is the genesis block if(topBlockPtr_ == NULL) topBlockPtr_ = &genBlock; // Store the old top block so we can later check whether it is included // in the new chain organization prevTopBlockPtr_ = topBlockPtr_; // Iterate over all blocks, track the maximum difficulty-sum block map::iterator iter; double maxDiffSum = prevTopBlockPtr_->getDifficultySum(); for( iter = headerMap_.begin(); iter != headerMap_.end(); iter ++) { // *** Walk down the chain following prevHash fields, until // you find a "solved" block. Then walk back up and // fill in the difficulty-sum values (do not set next- // hash ptrs, as we don't know if this is the main branch) // Method returns instantly if block is already "solved" double thisDiffSum = traceChainDown(iter->second); // If we hit orphans, we flag headers DB corruption if(corruptHeadersDB_) return false; // Determine if this is the top block. If it's the same diffsum // as the prev top block, don't do anything if(thisDiffSum > maxDiffSum) { maxDiffSum = thisDiffSum; topBlockPtr_ = &(iter->second); } } // Walk down the list one more time, set nextHash fields // Also set headersByHeight_; bool prevChainStillValid = (topBlockPtr_ == prevTopBlockPtr_); topBlockPtr_->nextHash_ = BtcUtils::EmptyHash_; BlockHeader* thisHeaderPtr = topBlockPtr_; //headersByHeight_.reserve(topBlockPtr_->getBlockHeight()+32768); headersByHeight_.resize(topBlockPtr_->getBlockHeight()+1); while( !thisHeaderPtr->isFinishedCalc_ ) { thisHeaderPtr->isFinishedCalc_ = true; thisHeaderPtr->isMainBranch_ = true; thisHeaderPtr->isOrphan_ = false; headersByHeight_[thisHeaderPtr->getBlockHeight()] = thisHeaderPtr; // This loop not necessary anymore with the DB implementation // We need to guarantee that the txs are pointing to the right block // header, because they could've been linked to an invalidated block //for(uint32_t i=0; igetTxRefPtrList().size(); i++) //{ //TxRef & tx = *(thisHeaderPtr->getTxRefPtrList()[i]); //tx.setHeaderPtr(thisHeaderPtr); //tx.setMainBranch(true); //} HashString & childHash = thisHeaderPtr->thisHash_; thisHeaderPtr = &(headerMap_[thisHeaderPtr->getPrevHash()]); thisHeaderPtr->nextHash_ = childHash; if(thisHeaderPtr == prevTopBlockPtr_) prevChainStillValid = true; } // Last header in the loop didn't get added (the genesis block on first run) thisHeaderPtr->isMainBranch_ = true; headersByHeight_[thisHeaderPtr->getBlockHeight()] = thisHeaderPtr; // Force a full rebuild to make sure everything is marked properly // On a full rebuild, prevChainStillValid should ALWAYS be true if( !prevChainStillValid ) { LOGWARN << "Reorg detected!"; reorgBranchPoint_ = thisHeaderPtr; // There was a dangerous bug -- prevTopBlockPtr_ is set correctly // RIGHT NOW, but won't be once I make the recursive call to organizeChain // I need to save it now, and re-assign it after the organizeChain call. // (I might consider finding a way to avoid this, but it's fine as-is) BlockHeader* prevtopblk = prevTopBlockPtr_; organizeChain(true); // force-rebuild blockchain (takes less than 1s) prevTopBlockPtr_ = prevtopblk; return false; } // Let the caller know that there was no reorg LOGDEBUG << "Done organizing chain"; return true; } ///////////////////////////////////////////////////////////////////////////// // Start from a node, trace down to the highest solved block, accumulate // difficulties and difficultySum values. Return the difficultySum of // this block. double BlockDataManager_LevelDB::traceChainDown(BlockHeader & bhpStart) { if(bhpStart.difficultySum_ > 0) return bhpStart.difficultySum_; // Prepare some data structures for walking down the chain vector headerPtrStack(headerMap_.size()); vector difficultyStack(headerMap_.size()); uint32_t blkIdx = 0; double thisDiff; // Walk down the chain of prevHash_ values, until we find a block // that has a definitive difficultySum value (i.e. >0). BlockHeader* thisPtr = &bhpStart; map::iterator iter; while( thisPtr->difficultySum_ < 0) { thisDiff = thisPtr->difficultyDbl_; difficultyStack[blkIdx] = thisDiff; headerPtrStack[blkIdx] = thisPtr; blkIdx++; iter = headerMap_.find(thisPtr->getPrevHash()); if(ITER_IN_MAP(iter, headerMap_)) thisPtr = &(iter->second); else { // Under some circumstances, the headers DB is not getting written // properly and triggering this code due to missing headers. For // now, we simply avoid this condition by flagging the headers DB // to be rebuilt. The bug probably has to do with batching of // header data. corruptHeadersDB_ = true; return 0.0; // We didn't hit a known block, but we don't have this block's // ancestor in the memory pool, so this is an orphan chain... // at least temporarily markOrphanChain(bhpStart); return 0.0; } } // Now we have a stack of difficulties and pointers. Walk back up // (by pointer) and accumulate the difficulty values double seedDiffSum = thisPtr->difficultySum_; uint32_t blkHeight = thisPtr->blockHeight_; for(int32_t i=blkIdx-1; i>=0; i--) { seedDiffSum += difficultyStack[i]; blkHeight++; thisPtr = headerPtrStack[i]; thisPtr->difficultyDbl_ = difficultyStack[i]; thisPtr->difficultySum_ = seedDiffSum; thisPtr->blockHeight_ = blkHeight; } // Finally, we have all the difficulty sums calculated, return this one return bhpStart.difficultySum_; } ///////////////////////////////////////////////////////////////////////////// // In practice, orphan chains shouldn't ever happen. It means that there's // a block in our database that doesn't trace down to the genesis block. // Currently, we get our blocks from Bitcoin-Qt/bitcoind which is incapable // of passing such blocks to us (or putting them in the blk*.dat files), so // if this function gets called, it's most likely in error. void BlockDataManager_LevelDB::markOrphanChain(BlockHeader & bhpStart) { // TODO: This method was written 18 months ago, and appeared to have // a bug in it when I revisited it. Not sure the bug was real // but I attempted to fix it. This note is to remind you/me // to check the old version of this method if any problems // crop up. LOGWARN << "Marking orphan chain"; map::iterator iter; iter = headerMap_.find(bhpStart.getThisHash()); HashStringRef lastHeadHash; while( ITER_IN_MAP(iter, headerMap_) ) { // I don't see how it's possible to have a header that used to be // in the main branch, but is now an ORPHAN (meaning it has no // parent). It will be good to detect this case, though if(iter->second.isMainBranch() == true) { // NOTE: this actually gets triggered when we scan the testnet // blk0001.dat file on main net, etc LOGERR << "Block previously main branch, now orphan!?"; previouslyValidBlockHeaderPtrs_.push_back(&(iter->second)); } iter->second.isOrphan_ = true; iter->second.isMainBranch_ = false; lastHeadHash = iter->second.thisHash_.getRef(); iter = headerMap_.find(iter->second.getPrevHash()); } orphanChainStartBlocks_.push_back(&(headerMap_[lastHeadHash.copy()])); LOGWARN << "Done marking orphan chain"; } //////////////////////////////////////////////////////////////////////////////// // We're going to need the BDM's help to get the sender for a TxIn since it // sometimes requires going and finding the TxOut from the distant past //////////////////////////////////////////////////////////////////////////////// TxOut BlockDataManager_LevelDB::getPrevTxOut(TxIn & txin) { if(txin.isCoinbase()) return TxOut(); OutPoint op = txin.getOutPoint(); Tx theTx = getTxByHash(op.getTxHash()); uint32_t idx = op.getTxOutIndex(); return theTx.getTxOutCopy(idx); } //////////////////////////////////////////////////////////////////////////////// // We're going to need the BDM's help to get the sender for a TxIn since it // sometimes requires going and finding the TxOut from the distant past //////////////////////////////////////////////////////////////////////////////// Tx BlockDataManager_LevelDB::getPrevTx(TxIn & txin) { if(txin.isCoinbase()) return Tx(); OutPoint op = txin.getOutPoint(); return getTxByHash(op.getTxHash()); } //////////////////////////////////////////////////////////////////////////////// HashString BlockDataManager_LevelDB::getSenderScrAddr(TxIn & txin) { if(txin.isCoinbase()) return HashString(0); return getPrevTxOut(txin).getScrAddressStr(); } //////////////////////////////////////////////////////////////////////////////// int64_t BlockDataManager_LevelDB::getSentValue(TxIn & txin) { if(txin.isCoinbase()) return -1; return getPrevTxOut(txin).getValue(); } //////////////////////////////////////////////////////////////////////////////// BlockHeader* BlockDataManager_LevelDB::getHeaderPtrForTxRef(TxRef txr) { if(txr.isNull()) return NULL; uint32_t hgt = txr.getBlockHeight(); uint8_t dup = txr.getDuplicateID(); BlockHeader* bhptr = headersByHeight_[hgt]; if(bhptr->getDuplicateID() != dup) { LOGERR << "Requested txref not on main chain (BH dupID is diff)"; return NULL; } return bhptr; } //////////////////////////////////////////////////////////////////////////////// BlockHeader* BlockDataManager_LevelDB::getHeaderPtrForTx(Tx & txObj) { if(txObj.getTxRef().isNull()) { LOGERR << "TxRef in Tx object is not set, cannot get header ptr"; return NULL; } return getHeaderPtrForTxRef(txObj.getTxRef()); } //////////////////////////////////////////////////////////////////////////////// // Methods for handling zero-confirmation transactions //////////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::enableZeroConf(string zcFilename, bool zcLite) { SCOPED_TIMER("enableZeroConf"); LOGINFO << "Enabling zero-conf tracking " << (zcLite ? "(lite)" : ""); zcFilename_ = zcFilename; zcEnabled_ = true; zcLiteMode_ = zcLite; readZeroConfFile(zcFilename_); // does nothing if DNE } //////////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::readZeroConfFile(string zcFilename) { SCOPED_TIMER("readZeroConfFile"); uint64_t filesize = BtcUtils::GetFileSize(zcFilename); if(filesize<8 || filesize==FILE_DOES_NOT_EXIST) return; ifstream zcFile(zcFilename_.c_str(), ios::in | ios::binary); BinaryData zcData((size_t)filesize); zcFile.read((char*)zcData.getPtr(), filesize); zcFile.close(); // We succeeded opening the file... BinaryRefReader brr(zcData); while(brr.getSizeRemaining() > 8) { uint64_t txTime = brr.get_uint64_t(); uint32_t txSize = BtcUtils::TxCalcLength(brr.getCurrPtr(), brr.getSizeRemaining()); BinaryData rawtx(txSize); brr.get_BinaryData(rawtx.getPtr(), txSize); addNewZeroConfTx(rawtx, (uint32_t)txTime, false); } purgeZeroConfPool(); } //////////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::disableZeroConf(void) { SCOPED_TIMER("disableZeroConf"); zcEnabled_ = false; } //////////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::addNewZeroConfTx(BinaryData const & rawTx, uint32_t txtime, bool writeToFile) { SCOPED_TIMER("addNewZeroConfTx"); if(txtime==0) txtime = (uint32_t)time(NULL); HashString txHash = BtcUtils::getHash256(rawTx); // If this is already in the zero-conf map or in the blockchain, ignore it if(hasTxWithHash(txHash)) return false; // In zero-conf-lite-mode, we only actually add the ZC if it's related // to one of our registered wallets. if(zcLiteMode_) { // The bulk filter Tx txObj(rawTx); bool isOurs = false; set::iterator wltIter; for(wltIter = registeredWallets_.begin(); wltIter != registeredWallets_.end(); wltIter++) { // The bulk filter returns pair isOurs = isOurs || (*wltIter)->isMineBulkFilter(txObj).first; } if(!isOurs) return false; } zeroConfMap_[txHash] = ZeroConfData(); ZeroConfData & zc = zeroConfMap_[txHash]; zc.iter_ = zeroConfRawTxList_.insert(zeroConfRawTxList_.end(), rawTx); zc.txobj_.unserialize(*(zc.iter_)); zc.txtime_ = txtime; // Record time. Write to file if(writeToFile) { ofstream zcFile(zcFilename_.c_str(), ios::app | ios::binary); zcFile.write( (char*)(&zc.txtime_), sizeof(uint64_t) ); zcFile.write( (char*)zc.txobj_.getPtr(), zc.txobj_.getSize()); zcFile.close(); } return true; } //////////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::purgeZeroConfPool(void) { SCOPED_TIMER("purgeZeroConfPool"); list< map::iterator > mapRmList; // Find all zero-conf transactions that made it into the blockchain map::iterator iter; for(iter = zeroConfMap_.begin(); iter != zeroConfMap_.end(); iter++) { if(!getTxRefByHash(iter->first).isNull()) mapRmList.push_back(iter); } // We've made a list of the zc tx to remove, now let's remove them // I decided this was safer than erasing the data as we were iterating // over it in the previous loop list< map::iterator >::iterator rmIter; for(rmIter = mapRmList.begin(); rmIter != mapRmList.end(); rmIter++) { zeroConfRawTxList_.erase( (*rmIter)->second.iter_ ); zeroConfMap_.erase( *rmIter ); } // Rewrite the zero-conf pool file if(mapRmList.size() > 0) rewriteZeroConfFile(); } //////////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::rewriteZeroConfFile(void) { SCOPED_TIMER("rewriteZeroConfFile"); ofstream zcFile(zcFilename_.c_str(), ios::out | ios::binary); static HashString txHash(32); list::iterator iter; for(iter = zeroConfRawTxList_.begin(); iter != zeroConfRawTxList_.end(); iter++) { BtcUtils::getHash256(*iter, txHash); ZeroConfData & zcd = zeroConfMap_[txHash]; zcFile.write( (char*)(&zcd.txtime_), sizeof(uint64_t) ); zcFile.write( (char*)(zcd.txobj_.getPtr()), zcd.txobj_.getSize()); } zcFile.close(); } //////////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::rescanWalletZeroConf(BtcWallet & wlt) { SCOPED_TIMER("rescanWalletZeroConf"); // Clear the whole list, rebuild wlt.clearZeroConfPool(); static HashString txHash(32); list::iterator iter; for(iter = zeroConfRawTxList_.begin(); iter != zeroConfRawTxList_.end(); iter++) { if(iter->getSize() == 0) continue; BtcUtils::getHash256(*iter, txHash); ZeroConfData & zcd = zeroConfMap_[txHash]; if( !isTxFinal(zcd.txobj_) ) continue; wlt.scanTx(zcd.txobj_, 0, (uint32_t)zcd.txtime_, UINT32_MAX); } } //////////////////////////////////////////////////////////////////////////////// void BlockDataManager_LevelDB::pprintSSHInfoAboutHash160(BinaryData const & a160) { StoredScriptHistory ssh; iface_->getStoredScriptHistory(ssh, HASH160PREFIX + a160); if(!ssh.isInitialized()) { LOGERR << "Address is not in DB: " << a160.toHexStr().c_str(); return; } vector utxos = getUTXOVectForHash160(a160); vector txios = getHistoryForScrAddr(a160); uint64_t bal = getDBBalanceForHash160(a160); uint64_t rcv = getDBReceivedForHash160(a160); cout << "Information for hash160: " << a160.toHexStr().c_str() << endl; cout << "Received: " << rcv << endl; cout << "Balance: " << bal << endl; cout << "NumUtxos: " << utxos.size() << endl; cout << "NumTxios: " << txios.size() << endl; for(uint32_t i=0; i::iterator iter; for(iter = zeroConfRawTxList_.begin(); iter != zeroConfRawTxList_.end(); iter++) { BtcUtils::getHash256(*iter, txHash); ZeroConfData & zcd = zeroConfMap_[txHash]; Tx & tx = zcd.txobj_; cout << tx.getThisHash().getSliceCopy(0,8).toHexStr().c_str() << " "; for(uint32_t i=0; iclearZeroConfPool(); // Need to "unlock" the TxIOPairs that were locked with zero-conf txs list< map::iterator > rmList; map::iterator iter; for(iter = txioMap_.begin(); iter != txioMap_.end(); iter++) { iter->second.clearZCFields(); if(!iter->second.hasTxOut()) rmList.push_back(iter); } // If a TxIOPair exists only because of the TxOutZC, then we should // remove to ensure that it won't conflict with any logic that only // checks for the *existence* of a TxIOPair, whereas the TxIOPair might // actually be "empty" but would throw off some other logic. list< map::iterator >::iterator rmIter; for(rmIter = rmList.begin(); rmIter != rmList.end(); rmIter++) { txioMap_.erase(*rmIter); } } //////////////////////////////////////////////////////////////////////////////// vector & BtcWallet::getTxLedger(HashString const * scraddr) { SCOPED_TIMER("BtcWallet::getTxLedger"); // Make sure to rebuild the ZC ledgers before calling this method if(scraddr==NULL) return ledgerAllAddr_; else { //if(scrAddrMap_.find(*scraddr) == scrAddrMap_.end()) if(KEY_NOT_IN_MAP(*scraddr, scrAddrMap_)) return getEmptyLedger(); else return scrAddrMap_[*scraddr].getTxLedger(); } } //////////////////////////////////////////////////////////////////////////////// vector & BtcWallet::getZeroConfLedger(HashString const * scraddr) { SCOPED_TIMER("BtcWallet::getZeroConfLedger"); // Make sure to rebuild the ZC ledgers before calling this method if(scraddr==NULL) return ledgerAllAddrZC_; else { //if(scrAddrMap_.find(*scraddr) == scrAddrMap_.end()) if(KEY_NOT_IN_MAP(*scraddr, scrAddrMap_)) return getEmptyLedger(); else return scrAddrMap_[*scraddr].getZeroConfLedger(); } } ///////////////////////////////////////////////////////////////////////////// bool BlockDataManager_LevelDB::isTxFinal(Tx & tx) { // Anything that is replaceable (regular or through blockchain injection) // will be considered isFinal==false. Users shouldn't even see the tx, // because the concept may be confusing, and the CURRENT use of non-final // tx is most likely for malicious purposes (as of this writing) // // This will change as multi-sig becomes integrated, and replacement will // eventually be enabled (properly), in which case I will expand this // to be more rigorous. // // For now I consider anything time-based locktimes (instead of block- // based locktimes) to be final if this is more than one day after the // locktime expires. This accommodates the most extreme case of silliness // due to time-zones (this shouldn't be an issue, but I haven't spent the // time to figure out how UTC and local time interact with time.h and // block timestamps). In cases where locktime is legitimately used, it // is likely to be many days in the future, and one day may not even // matter. I'm erring on the side of safety, not convenience. if(tx.getLockTime() == 0) return true; bool allSeqMax = true; for(uint32_t i=0; itx.getLockTime()); else return (time(NULL)>tx.getLockTime()+86400); } //////////////////////////////////////////////////////////////////////////////// // We must have already added this to the header map and DB and have a dupID void BlockDataManager_LevelDB::addRawBlockToDB(BinaryRefReader & brr) { SCOPED_TIMER("addRawBlockToDB"); //if(sbh.stxMap_.size() == 0) //{ //LOGERR << "Cannot add raw block to DB without any transactions"; //return false; //} BinaryDataRef first4 = brr.get_BinaryDataRef(4); // Skip magic bytes and block sz if exist, put ptr at beginning of header if(first4 == MagicBytes_) brr.advance(4); else brr.rewind(4); // Again, we rely on the assumption that the header has already been // added to the headerMap and the DB, and we have its correct height // and dupID StoredHeader sbh; try { sbh.unserializeFullBlock(brr, true, false); } catch (BlockDeserializingException &) { if (sbh.hasBlockHeader_) { // we still add this block to the chain in this case, // if we miss a few transactions it's better than // missing the entire block BlockHeader & bh = headerMap_[sbh.thisHash_]; sbh.blockHeight_ = bh.getBlockHeight(); sbh.duplicateID_ = bh.getDuplicateID(); sbh.isMainBranch_ = bh.isMainBranch(); sbh.blockAppliedToDB_ = false; // Don't put it into the DB if it's not proper! if(sbh.blockHeight_==UINT32_MAX || sbh.duplicateID_==UINT8_MAX) throw BlockDeserializingException("Error parsing block (corrupt?) - Cannot add raw block to DB without hgt & dup"); iface_->putStoredHeader(sbh, true); missingBlockHashes_.push_back( sbh.thisHash_ ); throw BlockDeserializingException("Error parsing block (corrupt?) - block header valid"); } else { throw BlockDeserializingException("Error parsing block (corrupt?) and block header invalid"); } // throw a new exception with a useful "what" } BlockHeader & bh = headerMap_[sbh.thisHash_]; sbh.blockHeight_ = bh.getBlockHeight(); sbh.duplicateID_ = bh.getDuplicateID(); sbh.isMainBranch_ = bh.isMainBranch(); sbh.blockAppliedToDB_ = false; // Don't put it into the DB if it's not proper! if(sbh.blockHeight_==UINT32_MAX || sbh.duplicateID_==UINT8_MAX) throw BlockDeserializingException("Cannot add raw block to DB without hgt & dup"); iface_->putStoredHeader(sbh, true); } //////////////////////////////////////////////////////////////////////////////// // For now, we will call createUndoDataFromBlock(), and then pass that data to // undoBlockFromDB(), even though it will result in accessing the DB data // twice -- // (1) LevelDB does an excellent job caching results, so the second lookup // should be instantaneous // (2) We prefer to integrate StoredUndoData objects now, which will be // needed for pruning even though we don't strictly need it for no-prune // now (and could save a lookup by skipping it). But I want unified // code flow for both pruning and non-pruning. bool BlockDataManager_LevelDB::createUndoDataFromBlock(uint32_t hgt, uint8_t dup, StoredUndoData & sud) { SCOPED_TIMER("createUndoDataFromBlock"); StoredHeader sbh; // Fetch the full, stored block iface_->getStoredHeader(sbh, hgt, dup, true); if(!sbh.haveFullBlock()) { LOGERR << "Cannot get undo data for block because not full!"; return false; } sud.blockHash_ = sbh.thisHash_; sud.blockHeight_ = sbh.blockHeight_; sud.duplicateID_ = sbh.duplicateID_; // Go through tx list, fetch TxOuts that are spent, record OutPoints added for(uint32_t itx=0; itxgetStoredTx(prevStx, prevHash); //if(prevStx.stxoMap_.find(prevIndex) == prevStx.stxoMap_.end()) if(KEY_NOT_IN_MAP(prevIndex, prevStx.stxoMap_)) { LOGERR << "StoredTx retrieved from DB, but TxOut not with it"; return false; } // sud.stxOutsRemovedByBlock_.push_back(prevStx.stxoMap_[prevIndex]); } // Use the stxoMap_ to iterate through TxOuts for(uint32_t iout=0; iout & stxToModify, //map & sshToModify) //{ //} // kate: indent-width 3; replace-tabs on; armory-0.92.3/cppForSwig/BtcUtils.h0000644000000000000000000014700012414772654015617 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// #ifndef _BTCUTILS_H_ #define _BTCUTILS_H_ #include #include #include #include #include #include #include #include #include #include #include #include "BinaryData.h" #include "cryptlib.h" #include "sha.h" #include "ripemd.h" #include "UniversalTimer.h" #include "log.h" #define HEADER_SIZE 80 #define COIN 100000000ULL #define NBLOCKS_REGARDED_AS_RESCAN 144 #define MIN_CONFIRMATIONS 6 #define COINBASE_MATURITY 120 #define TX_0_UNCONFIRMED 0 #define TX_NOT_EXIST -1 #define TX_OFF_MAIN_BRANCH -2 #define HashString BinaryData #define HashStringRef BinaryDataRef #ifdef _DEBUG #define PDEBUG(s) (cout << s << endl) #define PDEBUG2(s1, s2) (cout << s1 << " " << s2 << endl) #define PDEBUG3(s1, s2, s3) (cout << s1 << " " << s2 << " " << s3 << endl) #else #define PDEBUG(s) #define PDEBUG2(s1, s2) #define PDEBUG3(s1, s2, s3) #endif #define FILE_DOES_NOT_EXIST UINT64_MAX #define TESTNET_MAGIC_BYTES "0b110907" #define TESTNET_GENESIS_HASH_HEX "43497fd7f826957108f4a30fd9cec3aeba79972084e90ead01ea330900000000" #define TESTNET_GENESIS_TX_HASH_HEX "3ba3edfd7a7b12b27ac72c3e67768f617fc81bc3888a51323a9fb8aa4b1e5e4a" #define MAINNET_MAGIC_BYTES "f9beb4d9" #define MAINNET_GENESIS_HASH_HEX "6fe28c0ab6f1b372c1a6a246ae63f74f931e8365e15a089c68d6190000000000" #define MAINNET_GENESIS_TX_HASH_HEX "3ba3edfd7a7b12b27ac72c3e67768f617fc81bc3888a51323a9fb8aa4b1e5e4a" #define BITMASK(X) (2**X - 1) #define HASH160PREFIX WRITE_UINT8_LE((uint8_t)SCRIPT_PREFIX_HASH160) #define P2SHPREFIX WRITE_UINT8_LE((uint8_t)SCRIPT_PREFIX_P2SH) #define MSIGPREFIX WRITE_UINT8_LE((uint8_t)SCRIPT_PREFIX_MULTISIG) #define NONSTDPREFIX WRITE_UINT8_LE((uint8_t)SCRIPT_PREFIX_NONSTD) // Really, these defs are just for making it painfully clear in the // code what you are attempting to compare. I'm constantly messing // up == and != when trying to read through the code. #define KEY_NOT_IN_MAP(KEY,MAP) (MAP.find(KEY) == MAP.end()) #define KEY_IN_MAP(KEY,MAP) (MAP.find(KEY) != MAP.end()) #define ITER_NOT_IN_MAP(ITER,MAP) (ITER == MAP.end()) #define ITER_IN_MAP(ITER,MAP) (ITER != MAP.end()) class BinaryData; class BinaryDataRef; typedef enum { TXOUT_SCRIPT_STDHASH160, TXOUT_SCRIPT_STDPUBKEY65, TXOUT_SCRIPT_STDPUBKEY33, TXOUT_SCRIPT_MULTISIG, TXOUT_SCRIPT_P2SH, TXOUT_SCRIPT_NONSTANDARD, } TXOUT_SCRIPT_TYPE; typedef enum { TXIN_SCRIPT_STDUNCOMPR, TXIN_SCRIPT_STDCOMPR, TXIN_SCRIPT_COINBASE, TXIN_SCRIPT_SPENDPUBKEY, TXIN_SCRIPT_SPENDMULTI, TXIN_SCRIPT_SPENDP2SH, TXIN_SCRIPT_NONSTANDARD } TXIN_SCRIPT_TYPE; typedef enum { SCRIPT_PREFIX_HASH160=0x00, SCRIPT_PREFIX_P2SH=0x05, SCRIPT_PREFIX_MULTISIG=0xfe, SCRIPT_PREFIX_NONSTD=0xff, } SCRIPT_PREFIX; enum OPCODETYPE { // push value OP_0=0, OP_FALSE=OP_0, OP_PUSHDATA1=76, OP_PUSHDATA2, OP_PUSHDATA4, OP_1NEGATE, OP_RESERVED, OP_1, OP_TRUE=OP_1, OP_2, OP_3, OP_4, OP_5, OP_6, OP_7, OP_8, OP_9, OP_10, OP_11, OP_12, OP_13, OP_14, OP_15, OP_16, // control OP_NOP, OP_VER, OP_IF, OP_NOTIF, OP_VERIF, OP_VERNOTIF, OP_ELSE, OP_ENDIF, OP_VERIFY, OP_RETURN, // stack ops OP_TOALTSTACK, OP_FROMALTSTACK, OP_2DROP, OP_2DUP, OP_3DUP, OP_2OVER, OP_2ROT, OP_2SWAP, OP_IFDUP, OP_DEPTH, OP_DROP, OP_DUP, OP_NIP, OP_OVER, OP_PICK, OP_ROLL, OP_ROT, OP_SWAP, OP_TUCK, // splice ops OP_CAT, OP_SUBSTR, OP_LEFT, OP_RIGHT, OP_SIZE, // bit logic OP_INVERT, OP_AND, OP_OR, OP_XOR, OP_EQUAL, OP_EQUALVERIFY, OP_RESERVED1, OP_RESERVED2, // numeric OP_1ADD, OP_1SUB, OP_2MUL, OP_2DIV, OP_NEGATE, OP_ABS, OP_NOT, OP_0NOTEQUAL, OP_ADD, OP_SUB, OP_MUL, OP_DIV, OP_MOD, OP_LSHIFT, OP_RSHIFT, OP_BOOLAND, OP_BOOLOR, OP_NUMEQUAL, OP_NUMEQUALVERIFY, OP_NUMNOTEQUAL, OP_LESSTHAN, OP_GREATERTHAN, OP_LESSTHANOREQUAL, OP_GREATERTHANOREQUAL, OP_MIN, OP_MAX, OP_WITHIN, // crypto OP_RIPEMD160, OP_SHA1, OP_SHA256, OP_HASH160, OP_HASH256, OP_CODESEPARATOR, OP_CHECKSIG, OP_CHECKSIGVERIFY, OP_CHECKMULTISIG, OP_CHECKMULTISIGVERIFY, // expansion OP_NOP1, OP_NOP2, OP_NOP3, OP_NOP4, OP_NOP5, OP_NOP6, OP_NOP7, OP_NOP8, OP_NOP9, OP_NOP10, // template matching params OP_PUBKEYHASH = 0xfd, OP_PUBKEY = 0xfe, OP_INVALIDOPCODE = 0xff, }; class BlockDeserializingException : public runtime_error { public: BlockDeserializingException(const string &what="") : runtime_error(what) { } }; // This class holds only static methods. // NOTE: added default ctor and a few non-static, to support SWIG // (-classic SWIG doesn't support static methods) class BtcUtils { public: // Block of code to be called by SWIG -- i.e. made available to python BtcUtils(void) {} BinaryData hash256(BinaryData const & str) {return getHash256(str);} BinaryData hash160(BinaryData const & str) {return getHash160(str);} static BinaryData BadAddress_; static BinaryData EmptyHash_; ///////////////////////////////////////////////////////////////////////////// static BinaryData BadAddress(void) { return BadAddress_; } static BinaryData EmptyHash(void) { return EmptyHash_; } ///////////////////////////////////////////////////////////////////////////// static pair readVarInt(BinaryRefReader & brr) { uint64_t outVal; uint32_t outLen; outVal = readVarInt(brr.getCurrPtr(), &outLen); brr.advance(outLen); return pair(outVal, (uint8_t)outLen); } ///////////////////////////////////////////////////////////////////////////// static uint64_t readVarInt(uint8_t const * strmPtr, uint32_t* lenOutPtr=NULL) { uint8_t firstByte = strmPtr[0]; if(firstByte < 0xfd) { if(lenOutPtr != NULL) *lenOutPtr = 1; return firstByte; } if(firstByte == 0xfd) { if(lenOutPtr != NULL) *lenOutPtr = 3; return READ_UINT16_LE(strmPtr+1); } else if(firstByte == 0xfe) { if(lenOutPtr != NULL) *lenOutPtr = 5; return READ_UINT32_LE(strmPtr+1); } else //if(firstByte == 0xff) { if(lenOutPtr != NULL) *lenOutPtr = 9; return READ_UINT64_LE(strmPtr+1); } } ///////////////////////////////////////////////////////////////////////////// static uint64_t readVarInt(uint8_t const * strmPtr, size_t remaining, uint32_t* lenOutPtr=NULL) { if (remaining < 1) throw BlockDeserializingException(); uint8_t firstByte = strmPtr[0]; if(firstByte < 0xfd) { if(lenOutPtr != NULL) *lenOutPtr = 1; return firstByte; } if(firstByte == 0xfd) { if (remaining < 3) throw BlockDeserializingException(); if(lenOutPtr != NULL) *lenOutPtr = 3; return READ_UINT16_LE(strmPtr+1); } else if(firstByte == 0xfe) { if (remaining < 5) throw BlockDeserializingException(); if(lenOutPtr != NULL) *lenOutPtr = 5; return READ_UINT32_LE(strmPtr+1); } else //if(firstByte == 0xff) { if (remaining < 9) throw BlockDeserializingException(); if(lenOutPtr != NULL) *lenOutPtr = 9; return READ_UINT64_LE(strmPtr+1); } } ///////////////////////////////////////////////////////////////////////////// static inline uint32_t readVarIntLength(uint8_t const * strmPtr) { uint8_t firstByte = strmPtr[0]; if(firstByte < 0xfd) return 1; switch(firstByte) { case 0xfd: return 3; case 0xfe: return 5; case 0xff: return 9; } return -1; // we should never get here } ///////////////////////////////////////////////////////////////////////////// static inline uint32_t calcVarIntSize(uint64_t regularInteger) { if(regularInteger < 0xfd) return 1; else if(regularInteger <= 0xffff) return 3; else if(regularInteger <= 0xffffffff) return 5; else return 9; } ///////////////////////////////////////////////////////////////////////////// static uint64_t GetFileSize(char const * filename) { return GetFileSize(string(filename)); } ///////////////////////////////////////////////////////////////////////////// static uint64_t GetFileSize(string filename) { ifstream is(OS_TranslatePath(filename.c_str()), ios::in|ios::binary); if(!is.is_open()) return FILE_DOES_NOT_EXIST; is.seekg(0, ios::end); uint64_t filesize = (size_t)is.tellg(); is.close(); return filesize; } ///////////////////////////////////////////////////////////////////////////// static string numToStrWCommas(int64_t fullNum) { uint64_t num = fullNum; num *= (fullNum < 0 ? -1 : 1); vector triplets; do { int bottom3 = (num % 1000); triplets.push_back( bottom3 ); num = (num - bottom3) / 1000; } while(num>=1); stringstream out; out << (fullNum < 0 ? "-" : ""); uint32_t nt = triplets.size()-1; char t[4]; for(uint32_t i=0; i<=nt; i++) { if(i==0) sprintf(t, "%d", triplets[nt-i]); else sprintf(t, "%03d", triplets[nt-i]); out << string(t); if(i != nt) out << ","; } return out.str(); } ///////////////////////////////////////////////////////////////////////////// static BinaryData PackBits(list const & vectBool) { BinaryData out( (vectBool.size()+7) / 8 ); for(uint32_t i=0; i::const_iterator iter; for(iter = vectBool.begin(); iter != vectBool.end(); iter++, i++) { if(*iter) out[i/8] |= (1<<(7-i%8)); } return out; } ///////////////////////////////////////////////////////////////////////////// static list UnpackBits(BinaryData bits, uint32_t nBits) { list out; for(uint32_t i=0; i0); } return out; } ///////////////////////////////////////////////////////////////////////////// static void getHash256(uint8_t const * strToHash, uint32_t nBytes, BinaryData & hashOutput) { CryptoPP::SHA256 sha256_; if(hashOutput.getSize() != 32) hashOutput.resize(32); sha256_.CalculateDigest(hashOutput.getPtr(), strToHash, nBytes); sha256_.CalculateDigest(hashOutput.getPtr(), hashOutput.getPtr(), 32); } ///////////////////////////////////////////////////////////////////////////// static void getHash256_NoSafetyCheck( uint8_t const * strToHash, uint32_t nBytes, BinaryData & hashOutput) { CryptoPP::SHA256 sha256_; sha256_.CalculateDigest(hashOutput.getPtr(), strToHash, nBytes); sha256_.CalculateDigest(hashOutput.getPtr(), hashOutput.getPtr(), 32); } ///////////////////////////////////////////////////////////////////////////// static BinaryData getHash256(uint8_t const * strToHash, uint32_t nBytes) { CryptoPP::SHA256 sha256_; BinaryData hashOutput(32); sha256_.CalculateDigest(hashOutput.getPtr(), strToHash, nBytes); sha256_.CalculateDigest(hashOutput.getPtr(), hashOutput.getPtr(), 32); return hashOutput; } ///////////////////////////////////////////////////////////////////////////// static void getHash256(BinaryData const & strToHash, BinaryData & hashOutput) { getHash256(strToHash.getPtr(), strToHash.getSize(), hashOutput); } ///////////////////////////////////////////////////////////////////////////// static void getHash256(BinaryDataRef strToHash, BinaryData & hashOutput) { getHash256(strToHash.getPtr(), strToHash.getSize(), hashOutput); } ///////////////////////////////////////////////////////////////////////////// static BinaryData getHash256(BinaryData const & strToHash) { BinaryData hashOutput(32); getHash256(strToHash.getPtr(), strToHash.getSize(), hashOutput); return hashOutput; } ///////////////////////////////////////////////////////////////////////////// static BinaryData getHash256(BinaryDataRef strToHash) { BinaryData hashOutput(32); getHash256(strToHash.getPtr(), strToHash.getSize(), hashOutput); return hashOutput; } ///////////////////////////////////////////////////////////////////////////// static void getHash160(uint8_t const * strToHash, uint32_t nBytes, BinaryData & hashOutput) { CryptoPP::SHA256 sha256_; CryptoPP::RIPEMD160 ripemd160_; BinaryData bd32(32); if(hashOutput.getSize() != 20) hashOutput.resize(20); sha256_.CalculateDigest(bd32.getPtr(), strToHash, nBytes); ripemd160_.CalculateDigest(hashOutput.getPtr(), bd32.getPtr(), 32); } ///////////////////////////////////////////////////////////////////////////// static void getHash160_NoSafetyCheck( uint8_t const * strToHash, uint32_t nBytes, BinaryData & hashOutput) { CryptoPP::SHA256 sha256_; CryptoPP::RIPEMD160 ripemd160_; BinaryData bd32(32); sha256_.CalculateDigest(bd32.getPtr(), strToHash, nBytes); ripemd160_.CalculateDigest(hashOutput.getPtr(), bd32.getPtr(), 32); } ///////////////////////////////////////////////////////////////////////////// static BinaryData getHash160(uint8_t const * strToHash, uint32_t nBytes) { BinaryData hashOutput(20); getHash160(strToHash, nBytes, hashOutput); return hashOutput; } ///////////////////////////////////////////////////////////////////////////// static void getHash160(BinaryDataRef strToHash, BinaryData & hashOutput) { getHash160(strToHash.getPtr(), strToHash.getSize(), hashOutput); } ///////////////////////////////////////////////////////////////////////////// static BinaryData getHash160(BinaryDataRef strToHash) { BinaryData hashOutput(20); getHash160(strToHash.getPtr(), strToHash.getSize(), hashOutput); return hashOutput; } ///////////////////////////////////////////////////////////////////////////// static BinaryData getHash160(BinaryData const & strToHash) { BinaryData hashOutput(20); getHash160(strToHash.getPtr(), strToHash.getSize(), hashOutput); return hashOutput; } ///////////////////////////////////////////////////////////////////////////// // I need a non-static, non-overloaded method to be able to use this in SWIG BinaryData getHash160_SWIG(BinaryData const & strToHash) { return getHash160(strToHash); } ///////////////////////////////////////////////////////////////////////////// // I need a non-static, non-overloaded method to be able to use this in SWIG BinaryData ripemd160_SWIG(BinaryData const & strToHash) { CryptoPP::RIPEMD160 ripemd160_; BinaryData bd20(20); ripemd160_.CalculateDigest(bd20.getPtr(), strToHash.getPtr(), strToHash.getSize()); return bd20; } ///////////////////////////////////////////////////////////////////////////// static BinaryData calculateMerkleRoot(vector const & txhashlist) { vector mtree = calculateMerkleTree(txhashlist); return mtree[mtree.size()-1]; } ///////////////////////////////////////////////////////////////////////////// static vector calculateMerkleTree(vector const & txhashlist) { // Don't know in advance how big this list will be, make a list too big // and copy the result to the right size list afterwards uint32_t numTx = txhashlist.size(); vector merkleTree(3*numTx); CryptoPP::SHA256 sha256_; BinaryData hashInput(64); BinaryData hashOutput(32); for(uint32_t i=0; i1) { for(uint32_t j=0; j<(levelSize+1)/2; j++) { uint8_t* half1Ptr = hashInput.getPtr(); uint8_t* half2Ptr = hashInput.getPtr()+32; if(j < levelSize/2) { merkleTree[thisLevelStart+(2*j) ].copyTo(half1Ptr, 32); merkleTree[thisLevelStart+(2*j)+1].copyTo(half2Ptr, 32); } else { merkleTree[nextLevelStart-1].copyTo(half1Ptr, 32); merkleTree[nextLevelStart-1].copyTo(half2Ptr, 32); } sha256_.CalculateDigest(hashOutput.getPtr(), hashInput.getPtr(), 64); sha256_.CalculateDigest(hashOutput.getPtr(), hashOutput.getPtr(), 32); merkleTree[nextLevelStart+j] = hashOutput; } levelSize = (levelSize+1)/2; thisLevelStart = nextLevelStart; nextLevelStart = nextLevelStart+levelSize; } // nextLevelStart is the size of the merkle tree merkleTree.erase(merkleTree.begin()+nextLevelStart, merkleTree.end()); return merkleTree; } ///////////////////////////////////////////////////////////////////////////// // ALL THESE METHODS ASSUME THERE IS A FULL TX/TXIN/TXOUT BEHIND THE PTR // The point of these methods is to calculate the length of the object, // hence we don't know in advance how big the object actually will be, so // we can't provide it as an input for safety checking... static uint32_t TxInCalcLength(uint8_t const * ptr) { uint32_t viLen; uint32_t scrLen = (uint32_t)readVarInt(ptr+36, &viLen); return (36 + viLen + scrLen + 4); } static uint32_t TxInCalcLength(uint8_t const * ptr, uint32_t size) { if (size < 37) throw BlockDeserializingException(); uint32_t viLen; uint32_t scrLen = (uint32_t)readVarInt(ptr+36, size-36, &viLen); return (36 + viLen + scrLen + 4); } ///////////////////////////////////////////////////////////////////////////// static uint32_t TxOutCalcLength(uint8_t const * ptr) { uint32_t viLen; uint32_t scrLen = (uint32_t)readVarInt(ptr+8, &viLen); return (8 + viLen + scrLen); } ///////////////////////////////////////////////////////////////////////////// static uint32_t TxOutCalcLength(uint8_t const * ptr, uint32_t size) { if (size < 9) throw BlockDeserializingException(); uint32_t viLen; uint32_t scrLen = (uint32_t)readVarInt(ptr+8, size-8, &viLen); return (8 + viLen + scrLen); } ///////////////////////////////////////////////////////////////////////////// static uint32_t TxCalcLength(uint8_t const * ptr, uint32_t size, vector * offsetsIn=NULL, vector * offsetsOut=NULL) { BinaryRefReader brr(ptr, size); if (brr.getSizeRemaining() < 4) throw BlockDeserializingException(); // Tx Version; brr.advance(4); // TxIn List uint32_t nIn = (uint32_t)brr.get_var_int(); if(offsetsIn != NULL) { offsetsIn->resize(nIn+1); for(uint32_t i=0; iresize(nOut+1); for(uint32_t i=0; i * offsetsIn=NULL, vector * offsetsOut=NULL) { BinaryRefReader brr(ptr); // Tx Version; brr.advance(4); // TxIn List uint32_t nIn = (uint32_t)brr.get_var_int(); if(offsetsIn != NULL) { offsetsIn->resize(nIn+1); for(uint32_t i=0; iresize(nOut+1); for(uint32_t i=0; iresize(nOut+1); for(uint32_t i=0; i splitScr = splitPushOnlyScriptRefs(script); if(splitScr.size() == 0) return TXIN_SCRIPT_NONSTANDARD; // TODO: Maybe should identify whether the other pushed data // in the script is a potential solution for the // subscript... meh? //BinaryDataRef lastObj = splitScr[splitScr.size() - 1]; if(script[2]==0x30 && script[4]==0x02) return TXIN_SCRIPT_SPENDMULTI; } if( !(script[1]==0x30 && script[3]==0x02) ) return TXIN_SCRIPT_NONSTANDARD; uint32_t sigSize = script[2] + 4; if(script.getSize() == sigSize) return TXIN_SCRIPT_SPENDPUBKEY; uint32_t keySizeFull = 66; // \x41 \x04 [X32] [Y32] uint32_t keySizeCompr= 34; // \x41 \x02 [X32] if(script.getSize() == sigSize + keySizeFull) return TXIN_SCRIPT_STDUNCOMPR; else if(script.getSize() == sigSize + keySizeCompr) return TXIN_SCRIPT_STDCOMPR; return TXIN_SCRIPT_NONSTANDARD; } ///////////////////////////////////////////////////////////////////////////// static BinaryData getTxOutRecipientAddr(BinaryDataRef const & script, TXOUT_SCRIPT_TYPE type=TXOUT_SCRIPT_NONSTANDARD) { if(type==TXOUT_SCRIPT_NONSTANDARD) type = getTxOutScriptType(script); switch(type) { case(TXOUT_SCRIPT_STDHASH160): return script.getSliceCopy(3,20); case(TXOUT_SCRIPT_STDPUBKEY65): return getHash160(script.getSliceRef(1,65)); case(TXOUT_SCRIPT_STDPUBKEY33): return getHash160(script.getSliceRef(1,33)); case(TXOUT_SCRIPT_P2SH): return script.getSliceCopy(2,20); case(TXOUT_SCRIPT_MULTISIG): return BadAddress_; case(TXOUT_SCRIPT_NONSTANDARD): return BadAddress_; default: return BadAddress_; } } ///////////////////////////////////////////////////////////////////////////// // We use this for LevelDB keys, to return same key if the same priv/pub // pair is used, and also saving a few bytes for common script types static BinaryData getTxOutScrAddr(BinaryDataRef script, TXOUT_SCRIPT_TYPE type=TXOUT_SCRIPT_NONSTANDARD) { BinaryWriter bw; if(type==TXOUT_SCRIPT_NONSTANDARD) type = getTxOutScriptType(script); switch(type) { case(TXOUT_SCRIPT_STDHASH160): bw.put_uint8_t(SCRIPT_PREFIX_HASH160); bw.put_BinaryData(script.getSliceCopy(3,20)); return bw.getData(); case(TXOUT_SCRIPT_STDPUBKEY65): bw.put_uint8_t(SCRIPT_PREFIX_HASH160); bw.put_BinaryData( getHash160(script.getSliceRef(1,65))); return bw.getData(); case(TXOUT_SCRIPT_STDPUBKEY33): bw.put_uint8_t(SCRIPT_PREFIX_HASH160); bw.put_BinaryData( getHash160(script.getSliceRef(1,33))); return bw.getData(); case(TXOUT_SCRIPT_P2SH): bw.put_uint8_t(SCRIPT_PREFIX_P2SH); bw.put_BinaryData(script.getSliceCopy(2,20)); return bw.getData(); case(TXOUT_SCRIPT_NONSTANDARD): bw.put_uint8_t(SCRIPT_PREFIX_NONSTD); bw.put_BinaryData(getHash160(script)); return bw.getData(); case(TXOUT_SCRIPT_MULTISIG): bw.put_uint8_t(SCRIPT_PREFIX_MULTISIG); bw.put_BinaryData(getMultisigUniqueKey(script)); return bw.getData(); default: LOGERR << "What kind of TxOutScript did we get?"; return BinaryData(0); } } ///////////////////////////////////////////////////////////////////////////// // This is basically just for SWIG to access via python static BinaryData getScrAddrForScript(BinaryData const & script) { return getTxOutScrAddr(script.getRef()); } ///////////////////////////////////////////////////////////////////////////// // This is basically just for SWIG to access via python static uint32_t getTxOutScriptTypeInt(BinaryData const & script) { return (uint32_t)getTxOutScriptType(script.getRef()); } ///////////////////////////////////////////////////////////////////////////// // This is basically just for SWIG to access via python static uint32_t getTxInScriptTypeInt(BinaryData const & script, BinaryData const & prevHash) { return (uint32_t)getTxInScriptType(script.getRef(), prevHash); } ///////////////////////////////////////////////////////////////////////////// static bool isMultisigScript(BinaryDataRef script) { return (getMultisigUniqueKey(script).getSize() > 0); } ///////////////////////////////////////////////////////////////////////////// // "UniqueKey"=="ScrAddr" minus prefix // TODO: Interesting exercise: is there a non-standard script that could // look like the output of this function operating on a multisig // script (doesn't matter if it's valid or not)? In other words, is // there is a hole where someone could mine a script that would be // forwarded by Bitcoin-Qt to this code, which would then produce // a non-std-unique-key that would be indistinguishable from the // output of this function? My guess is, no. And my guess is that // it's not a very useful even if it did. But it would be good to // rule it out. static BinaryData getMultisigUniqueKey(BinaryData const & script) { vector a160List(0); uint8_t M = getMultisigAddrList(script, a160List); uint8_t N = a160List.size(); if(M==0) return BinaryData(0); BinaryWriter bw(2 + N*20); // reserve enough space for header + N addr bw.put_uint8_t(M); bw.put_uint8_t(N); sort(a160List.begin(), a160List.end()); for(uint32_t i=0; i & addr160List) { vector pkList; uint32_t M = getMultisigPubKeyList(script, pkList); uint32_t N = pkList.size(); if(M==0) return 0; addr160List.resize(N); for(uint32_t i=0; i & pkList) { if( script[-1] != 0xae ) return 0; uint8_t M = script[0]; uint8_t N = script[-2]; if(M<81 || M>96|| N<81 || N>96) return 0; M -= 80; N -= 80; BinaryRefReader brr(script); brr.advance(1); // Skip over M-value pkList.resize(N); for(uint8_t i=0; i outVect; uint32_t M = getMultisigAddrList(script, outVect); uint32_t N = outVect.size(); BinaryWriter bw(2 + N*20); // reserve enough space for header + N addr bw.put_uint8_t(M); bw.put_uint8_t(N); for(uint32_t i=0; i outVect; uint32_t M = getMultisigPubKeyList(script, outVect); uint32_t N = outVect.size(); BinaryWriter bw(2 + N*20); // reserve enough space for header + N addr bw.put_uint8_t(M); bw.put_uint8_t(N); for(uint32_t i=0; i pushVect = splitPushOnlyScriptRefs(script); return getHash160(pushVect[pushVect.size()-1]); } case(TXIN_SCRIPT_COINBASE): case(TXIN_SCRIPT_SPENDPUBKEY): case(TXIN_SCRIPT_SPENDMULTI): case(TXIN_SCRIPT_NONSTANDARD): return BadAddress_; default: LOGERR << "What kind of TxIn script did we get?"; return BadAddress_; } } ///////////////////////////////////////////////////////////////////////////// static BinaryData getTxInAddrFromTypeInt( BinaryData const & script, uint32_t typeInt) { return getTxInAddrFromType(script.getRef(), (TXIN_SCRIPT_TYPE)typeInt); } ///////////////////////////////////////////////////////////////////////////// static vector splitPushOnlyScriptRefs(BinaryDataRef script) { list opList; BinaryRefReader brr(script); uint8_t nextOp; while(brr.getSizeRemaining() > 0) { nextOp = brr.get_uint8_t(); if(nextOp == 0) { // Implicit pushdata brr.rewind(1); opList.push_back(brr.get_BinaryDataRef(1)); } else if(nextOp < 76) { // Implicit pushdata opList.push_back(brr.get_BinaryDataRef(nextOp)); } else if(nextOp == 76) { uint8_t nb = brr.get_uint8_t(); opList.push_back( brr.get_BinaryDataRef(nb)); } else if(nextOp == 77) { uint16_t nb = brr.get_uint16_t(); opList.push_back( brr.get_BinaryDataRef(nb)); } else if(nextOp == 78) { uint16_t nb = brr.get_uint32_t(); opList.push_back( brr.get_BinaryDataRef(nb)); } else if(nextOp > 78 && nextOp < 97 && nextOp !=80) { brr.rewind(1); opList.push_back( brr.get_BinaryDataRef(1)); } else return vector(0); } vector vectOut(opList.size()); list::iterator iter; uint32_t i=0; for(iter = opList.begin(); iter != opList.end(); iter++,i++) vectOut[i] = *iter; return vectOut; } ///////////////////////////////////////////////////////////////////////////// static vector splitPushOnlyScript(BinaryData const & script) { vector refs = splitPushOnlyScriptRefs(script); vector out(refs.size()); for(uint32_t i=0; i refs = splitPushOnlyScriptRefs(script); if(refs.size()==0) return BinaryData(0); return refs[refs.size() - 1]; } ///////////////////////////////////////////////////////////////////////////// static double convertDiffBitsToDouble(BinaryData const & diffBitsBinary) { uint32_t diffBits = READ_UINT32_LE(diffBitsBinary); int nShift = (diffBits >> 24) & 0xff; double dDiff = (double)0x0000ffff / (double)(diffBits & 0x00ffffff); while (nShift < 29) { dDiff *= 256.0; nShift++; } while (nShift > 29) { dDiff /= 256.0; nShift--; } return dDiff; } // This got more complicated when Bitcoin-Qt 0.8 switched from // blk0001.dat to blocks/blk00000.dat static string getBlkFilename(string dir, uint32_t fblkNum) { /// Update: It's been enough time since the hardfork that just about // everyone must've upgraded to 0.8+ by now... remove pre-0.8 // compatibility. char* fname = new char[1024]; sprintf(fname, "%s/blk%05d.dat", dir.c_str(), fblkNum); string strName(fname); delete[] fname; return strName; } static string getOpCodeName(OPCODETYPE opcode) { switch (opcode) { // push value case OP_0 : return "OP_0"; case OP_PUSHDATA1 : return "OP_PUSHDATA1"; case OP_PUSHDATA2 : return "OP_PUSHDATA2"; case OP_PUSHDATA4 : return "OP_PUSHDATA4"; case OP_1NEGATE : return "OP_1NEGATE"; case OP_RESERVED : return "OP_RESERVED"; case OP_1 : return "OP_1"; case OP_2 : return "OP_2"; case OP_3 : return "OP_3"; case OP_4 : return "OP_4"; case OP_5 : return "OP_5"; case OP_6 : return "OP_6"; case OP_7 : return "OP_7"; case OP_8 : return "OP_8"; case OP_9 : return "OP_9"; case OP_10 : return "OP_10"; case OP_11 : return "OP_11"; case OP_12 : return "OP_12"; case OP_13 : return "OP_13"; case OP_14 : return "OP_14"; case OP_15 : return "OP_15"; case OP_16 : return "OP_16"; // control case OP_NOP : return "OP_NOP"; case OP_VER : return "OP_VER"; case OP_IF : return "OP_IF"; case OP_NOTIF : return "OP_NOTIF"; case OP_VERIF : return "OP_VERIF"; case OP_VERNOTIF : return "OP_VERNOTIF"; case OP_ELSE : return "OP_ELSE"; case OP_ENDIF : return "OP_ENDIF"; case OP_VERIFY : return "OP_VERIFY"; case OP_RETURN : return "OP_RETURN"; // stack ops case OP_TOALTSTACK : return "OP_TOALTSTACK"; case OP_FROMALTSTACK : return "OP_FROMALTSTACK"; case OP_2DROP : return "OP_2DROP"; case OP_2DUP : return "OP_2DUP"; case OP_3DUP : return "OP_3DUP"; case OP_2OVER : return "OP_2OVER"; case OP_2ROT : return "OP_2ROT"; case OP_2SWAP : return "OP_2SWAP"; case OP_IFDUP : return "OP_IFDUP"; case OP_DEPTH : return "OP_DEPTH"; case OP_DROP : return "OP_DROP"; case OP_DUP : return "OP_DUP"; case OP_NIP : return "OP_NIP"; case OP_OVER : return "OP_OVER"; case OP_PICK : return "OP_PICK"; case OP_ROLL : return "OP_ROLL"; case OP_ROT : return "OP_ROT"; case OP_SWAP : return "OP_SWAP"; case OP_TUCK : return "OP_TUCK"; // splice ops case OP_CAT : return "OP_CAT"; case OP_SUBSTR : return "OP_SUBSTR"; case OP_LEFT : return "OP_LEFT"; case OP_RIGHT : return "OP_RIGHT"; case OP_SIZE : return "OP_SIZE"; // bit logic case OP_INVERT : return "OP_INVERT"; case OP_AND : return "OP_AND"; case OP_OR : return "OP_OR"; case OP_XOR : return "OP_XOR"; case OP_EQUAL : return "OP_EQUAL"; case OP_EQUALVERIFY : return "OP_EQUALVERIFY"; case OP_RESERVED1 : return "OP_RESERVED1"; case OP_RESERVED2 : return "OP_RESERVED2"; // numeric case OP_1ADD : return "OP_1ADD"; case OP_1SUB : return "OP_1SUB"; case OP_2MUL : return "OP_2MUL"; case OP_2DIV : return "OP_2DIV"; case OP_NEGATE : return "OP_NEGATE"; case OP_ABS : return "OP_ABS"; case OP_NOT : return "OP_NOT"; case OP_0NOTEQUAL : return "OP_0NOTEQUAL"; case OP_ADD : return "OP_ADD"; case OP_SUB : return "OP_SUB"; case OP_MUL : return "OP_MUL"; case OP_DIV : return "OP_DIV"; case OP_MOD : return "OP_MOD"; case OP_LSHIFT : return "OP_LSHIFT"; case OP_RSHIFT : return "OP_RSHIFT"; case OP_BOOLAND : return "OP_BOOLAND"; case OP_BOOLOR : return "OP_BOOLOR"; case OP_NUMEQUAL : return "OP_NUMEQUAL"; case OP_NUMEQUALVERIFY : return "OP_NUMEQUALVERIFY"; case OP_NUMNOTEQUAL : return "OP_NUMNOTEQUAL"; case OP_LESSTHAN : return "OP_LESSTHAN"; case OP_GREATERTHAN : return "OP_GREATERTHAN"; case OP_LESSTHANOREQUAL : return "OP_LESSTHANOREQUAL"; case OP_GREATERTHANOREQUAL : return "OP_GREATERTHANOREQUAL"; case OP_MIN : return "OP_MIN"; case OP_MAX : return "OP_MAX"; case OP_WITHIN : return "OP_WITHIN"; // crypto case OP_RIPEMD160 : return "OP_RIPEMD160"; case OP_SHA1 : return "OP_SHA1"; case OP_SHA256 : return "OP_SHA256"; case OP_HASH160 : return "OP_HASH160"; case OP_HASH256 : return "OP_HASH256"; case OP_CODESEPARATOR : return "OP_CODESEPARATOR"; case OP_CHECKSIG : return "OP_CHECKSIG"; case OP_CHECKSIGVERIFY : return "OP_CHECKSIGVERIFY"; case OP_CHECKMULTISIG : return "OP_CHECKMULTISIG"; case OP_CHECKMULTISIGVERIFY : return "OP_CHECKMULTISIGVERIFY"; // expanson case OP_NOP1 : return "OP_NOP1"; case OP_NOP2 : return "OP_NOP2"; case OP_NOP3 : return "OP_NOP3"; case OP_NOP4 : return "OP_NOP4"; case OP_NOP5 : return "OP_NOP5"; case OP_NOP6 : return "OP_NOP6"; case OP_NOP7 : return "OP_NOP7"; case OP_NOP8 : return "OP_NOP8"; case OP_NOP9 : return "OP_NOP9"; case OP_NOP10 : return "OP_NOP10"; // template matching params case OP_PUBKEYHASH : return "OP_PUBKEYHASH"; case OP_PUBKEY : return "OP_PUBKEY"; case OP_INVALIDOPCODE : return "OP_INVALIDOPCODE"; default: return "OP_UNKNOWN"; } } static vector convertScriptToOpStrings(BinaryData const & script) { list opList; uint32_t i = 0; uint32_t sz=script.getSize(); bool error=false; while(i < sz) { uint8_t nextOp = script[i]; if(nextOp == 0) { opList.push_back("OP_0"); i++; } else if(nextOp < 76) { opList.push_back("[PUSHDATA -- " + num2str(nextOp) + " BYTES:]"); opList.push_back(script.getSliceCopy(i+1, nextOp).toHexStr()); i += nextOp+1; } else if(nextOp == 76) { uint8_t nb = READ_UINT8_LE(script.getPtr() + i+1); if(i+1+1+nb > sz) { error=true; break; } BinaryData binObj = script.getSliceCopy(i+2, nb); opList.push_back("[OP_PUSHDATA1 -- " + num2str(nb) + " BYTES:]"); opList.push_back(binObj.toHexStr()); i += nb+2; } else if(nextOp == 77) { uint16_t nb = READ_UINT16_LE(script.getPtr() + i+1); if(i+1+2+nb > sz) { error=true; break; } BinaryData binObj = script.getSliceCopy(i+3, min((int)nb,256)); opList.push_back("[OP_PUSHDATA2 -- " + num2str(nb) + " BYTES:]"); opList.push_back(binObj.toHexStr() + "..."); i += nb+3; } else if(nextOp == 78) { uint32_t nb = READ_UINT32_LE(script.getPtr() + i+1); if(i+1+4+nb > sz) { error=true; break; } BinaryData binObj = script.getSliceCopy(i+5, min((int)nb,256)); opList.push_back("[OP_PUSHDATA4 -- " + num2str(nb) + " BYTES:]"); opList.push_back(binObj.toHexStr() + "..."); i += nb+5; } else { opList.push_back(getOpCodeName((OPCODETYPE)nextOp)); i++; } } if(error) { opList.clear(); opList.push_back("ERROR PROCESSING SCRIPT"); } uint32_t nops = opList.size(); vector vectOut(nops); list::iterator iter; uint32_t op=0; for(iter = opList.begin(); iter != opList.end(); iter++) { vectOut[op] = *iter; op++; } return vectOut; } static string num2str(uint64_t n) { stringstream out; out << n; return out.str(); } static void pprintScript(BinaryData const & script) { vector oplist = convertScriptToOpStrings(script); for(uint32_t i=0; i is present # -DLEVELDB_PLATFORM_POSIX for Posix-based platforms # -DSNAPPY if the Snappy library is present # OUTPUT=$1 PREFIX=$2 if test -z "$OUTPUT" || test -z "$PREFIX"; then echo "usage: $0 " >&2 exit 1 fi # Delete existing output, if it exists rm -f $OUTPUT touch $OUTPUT if test -z "$CC"; then CC=cc fi if test -z "$CXX"; then CXX=g++ fi if test -z "$TMPDIR"; then TMPDIR=/tmp fi # Detect OS if test -z "$TARGET_OS"; then TARGET_OS=`uname -s` fi COMMON_FLAGS= CROSS_COMPILE= PLATFORM_CCFLAGS= PLATFORM_CXXFLAGS= PLATFORM_LDFLAGS= PLATFORM_LIBS= PLATFORM_SHARED_EXT="so" PLATFORM_SHARED_LDFLAGS="-shared -Wl,-soname -Wl," PLATFORM_SHARED_CFLAGS="-fPIC" PLATFORM_SHARED_VERSIONED=true MEMCMP_FLAG= if [ "$CXX" = "g++" ]; then # Use libc's memcmp instead of GCC's memcmp. This results in ~40% # performance improvement on readrandom under gcc 4.4.3 on Linux/x86. MEMCMP_FLAG="-fno-builtin-memcmp" fi case "$TARGET_OS" in Darwin) PLATFORM=OS_MACOSX COMMON_FLAGS="$MEMCMP_FLAG -DOS_MACOSX" PLATFORM_SHARED_EXT=dylib [ -z "$INSTALL_PATH" ] && INSTALL_PATH=`pwd` PLATFORM_SHARED_LDFLAGS="-dynamiclib -install_name $INSTALL_PATH/" PORT_FILE=port/port_posix.cc ;; Linux) PLATFORM=OS_LINUX COMMON_FLAGS="$MEMCMP_FLAG -pthread -DOS_LINUX" PLATFORM_LDFLAGS="-pthread" PORT_FILE=port/port_posix.cc ;; SunOS) PLATFORM=OS_SOLARIS COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_SOLARIS" PLATFORM_LIBS="-lpthread -lrt" PORT_FILE=port/port_posix.cc ;; FreeBSD) PLATFORM=OS_FREEBSD COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_FREEBSD" PLATFORM_LIBS="-lpthread" PORT_FILE=port/port_posix.cc ;; NetBSD) PLATFORM=OS_NETBSD COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_NETBSD" PLATFORM_LIBS="-lpthread -lgcc_s" PORT_FILE=port/port_posix.cc ;; OpenBSD) PLATFORM=OS_OPENBSD COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_OPENBSD" PLATFORM_LDFLAGS="-pthread" PORT_FILE=port/port_posix.cc ;; DragonFly) PLATFORM=OS_DRAGONFLYBSD COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_DRAGONFLYBSD" PLATFORM_LIBS="-lpthread" PORT_FILE=port/port_posix.cc ;; OS_ANDROID_CROSSCOMPILE) PLATFORM=OS_ANDROID COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_ANDROID -DLEVELDB_PLATFORM_POSIX" PLATFORM_LDFLAGS="" # All pthread features are in the Android C library PORT_FILE=port/port_posix.cc CROSS_COMPILE=true ;; HP-UX) PLATFORM=OS_HPUX COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_HPUX" PLATFORM_LDFLAGS="-pthread" PORT_FILE=port/port_posix.cc # man ld: +h internal_name PLATFORM_SHARED_LDFLAGS="-shared -Wl,+h -Wl," ;; IOS) PLATFORM=IOS COMMON_FLAGS="$MEMCMP_FLAG -DOS_MACOSX" [ -z "$INSTALL_PATH" ] && INSTALL_PATH=`pwd` PORT_FILE=port/port_posix.cc PLATFORM_SHARED_EXT= PLATFORM_SHARED_LDFLAGS= PLATFORM_SHARED_CFLAGS= PLATFORM_SHARED_VERSIONED= ;; *) echo "Unknown platform!" >&2 exit 1 esac # We want to make a list of all cc files within util, db, table, and helpers # except for the test and benchmark files. By default, find will output a list # of all files matching either rule, so we need to append -print to make the # prune take effect. DIRS="$PREFIX/db $PREFIX/util $PREFIX/table" set -f # temporarily disable globbing so that our patterns aren't expanded PRUNE_TEST="-name *test*.cc -prune" PRUNE_BENCH="-name *_bench.cc -prune" PRUNE_TOOL="-name leveldb_main.cc -prune" PORTABLE_FILES=`find $DIRS $PRUNE_TEST -o $PRUNE_BENCH -o $PRUNE_TOOL -o -name '*.cc' -print | sort | sed "s,^$PREFIX/,," | tr "\n" " "` set +f # re-enable globbing # The sources consist of the portable files, plus the platform-specific port # file. echo "SOURCES=$PORTABLE_FILES $PORT_FILE" >> $OUTPUT echo "MEMENV_SOURCES=helpers/memenv/memenv.cc" >> $OUTPUT if [ "$CROSS_COMPILE" = "true" ]; then # Cross-compiling; do not try any compilation tests. true else CXXOUTPUT="${TMPDIR}/leveldb_build_detect_platform-cxx.$$" # If -std=c++0x works, use . Otherwise use port_posix.h. $CXX $CXXFLAGS -std=c++0x -x c++ - -o $CXXOUTPUT 2>/dev/null < int main() {} EOF if [ "$?" = 0 ]; then COMMON_FLAGS="$COMMON_FLAGS -DLEVELDB_PLATFORM_POSIX -DLEVELDB_CSTDATOMIC_PRESENT" PLATFORM_CXXFLAGS="-std=c++0x" else COMMON_FLAGS="$COMMON_FLAGS -DLEVELDB_PLATFORM_POSIX" fi # Test whether Snappy library is installed # http://code.google.com/p/snappy/ $CXX $CXXFLAGS -x c++ - -o $CXXOUTPUT 2>/dev/null < int main() {} EOF if [ "$?" = 0 ]; then COMMON_FLAGS="$COMMON_FLAGS -DSNAPPY" PLATFORM_LIBS="$PLATFORM_LIBS -lsnappy" fi # Test whether tcmalloc is available $CXX $CXXFLAGS -x c++ - -o $CXXOUTPUT -ltcmalloc 2>/dev/null </dev/null fi PLATFORM_CCFLAGS="$PLATFORM_CCFLAGS $COMMON_FLAGS" PLATFORM_CXXFLAGS="$PLATFORM_CXXFLAGS $COMMON_FLAGS" echo "CC=$CC" >> $OUTPUT echo "CXX=$CXX" >> $OUTPUT echo "PLATFORM=$PLATFORM" >> $OUTPUT echo "PLATFORM_LDFLAGS=$PLATFORM_LDFLAGS" >> $OUTPUT echo "PLATFORM_LIBS=$PLATFORM_LIBS" >> $OUTPUT echo "PLATFORM_CCFLAGS=$PLATFORM_CCFLAGS" >> $OUTPUT echo "PLATFORM_CXXFLAGS=$PLATFORM_CXXFLAGS" >> $OUTPUT echo "PLATFORM_SHARED_CFLAGS=$PLATFORM_SHARED_CFLAGS" >> $OUTPUT echo "PLATFORM_SHARED_EXT=$PLATFORM_SHARED_EXT" >> $OUTPUT echo "PLATFORM_SHARED_LDFLAGS=$PLATFORM_SHARED_LDFLAGS" >> $OUTPUT echo "PLATFORM_SHARED_VERSIONED=$PLATFORM_SHARED_VERSIONED" >> $OUTPUT armory-0.92.3/cppForSwig/leveldb/Makefile0000644000000000000000000001742612414772654017002 0ustar rootroot# Copyright (c) 2011 The LevelDB Authors. All rights reserved. # Use of this source code is governed by a BSD-style license that can be # found in the LICENSE file. See the AUTHORS file for names of contributors. #----------------------------------------------- # Uncomment exactly one of the lines labelled (A), (B), and (C) below # to switch between compilation modes. OPT ?= -O2 -fPIC -DNDEBUG # (A) Production use (optimized mode) # OPT ?= -g2 # (B) Debug mode, w/ full line-level debugging symbols # OPT ?= -O2 -g2 -DNDEBUG # (C) Profiling mode: opt, but w/debugging symbols #----------------------------------------------- # detect what platform we're building on $(shell CC="$(CC)" CXX="$(CXX)" TARGET_OS="$(TARGET_OS)" \ ./build_detect_platform build_config.mk ./) # this file is generated by the previous line to set build flags and sources include build_config.mk CFLAGS += -I. -I./include $(PLATFORM_CCFLAGS) $(OPT) CXXFLAGS += -I. -I./include $(PLATFORM_CXXFLAGS) $(OPT) LDFLAGS += $(PLATFORM_LDFLAGS) LIBS += $(PLATFORM_LIBS) LIBOBJECTS = $(SOURCES:.cc=.o) MEMENVOBJECTS = $(MEMENV_SOURCES:.cc=.o) TESTUTIL = ./util/testutil.o TESTHARNESS = ./util/testharness.o $(TESTUTIL) TESTS = \ arena_test \ autocompact_test \ bloom_test \ c_test \ cache_test \ coding_test \ corruption_test \ crc32c_test \ db_test \ dbformat_test \ env_test \ filename_test \ filter_block_test \ issue178_test \ issue200_test \ log_test \ memenv_test \ skiplist_test \ table_test \ version_edit_test \ version_set_test \ write_batch_test PROGRAMS = db_bench leveldbutil $(TESTS) BENCHMARKS = db_bench_sqlite3 db_bench_tree_db LIBRARY = libleveldb.a MEMENVLIBRARY = libmemenv.a default: all # Should we build shared libraries? ifneq ($(PLATFORM_SHARED_EXT),) ifneq ($(PLATFORM_SHARED_VERSIONED),true) SHARED1 = libleveldb.$(PLATFORM_SHARED_EXT) SHARED2 = $(SHARED1) SHARED3 = $(SHARED1) SHARED = $(SHARED1) else # Update db.h if you change these. SHARED_MAJOR = 1 SHARED_MINOR = 15 SHARED1 = libleveldb.$(PLATFORM_SHARED_EXT) SHARED2 = $(SHARED1).$(SHARED_MAJOR) SHARED3 = $(SHARED1).$(SHARED_MAJOR).$(SHARED_MINOR) SHARED = $(SHARED1) $(SHARED2) $(SHARED3) $(SHARED1): $(SHARED3) ln -fs $(SHARED3) $(SHARED1) $(SHARED2): $(SHARED3) ln -fs $(SHARED3) $(SHARED2) endif $(SHARED3): $(CXX) $(LDFLAGS) $(PLATFORM_SHARED_LDFLAGS)$(SHARED2) $(CXXFLAGS) $(PLATFORM_SHARED_CFLAGS) $(SOURCES) -o $(SHARED3) $(LIBS) endif # PLATFORM_SHARED_EXT all: $(SHARED) $(LIBRARY) check: all $(PROGRAMS) $(TESTS) for t in $(TESTS); do echo "***** Running $$t"; ./$$t || exit 1; done clean: -rm -f $(PROGRAMS) $(BENCHMARKS) $(LIBRARY) $(SHARED) $(MEMENVLIBRARY) */*.o */*/*.o ios-x86/*/*.o ios-arm/*/*.o build_config.mk -rm -rf ios-x86/* ios-arm/* $(LIBRARY): $(LIBOBJECTS) rm -f $@ $(AR) -rs $@ $(LIBOBJECTS) db_bench: db/db_bench.o $(LIBOBJECTS) $(TESTUTIL) $(CXX) $(LDFLAGS) db/db_bench.o $(LIBOBJECTS) $(TESTUTIL) -o $@ $(LIBS) db_bench_sqlite3: doc/bench/db_bench_sqlite3.o $(LIBOBJECTS) $(TESTUTIL) $(CXX) $(LDFLAGS) doc/bench/db_bench_sqlite3.o $(LIBOBJECTS) $(TESTUTIL) -o $@ -lsqlite3 $(LIBS) db_bench_tree_db: doc/bench/db_bench_tree_db.o $(LIBOBJECTS) $(TESTUTIL) $(CXX) $(LDFLAGS) doc/bench/db_bench_tree_db.o $(LIBOBJECTS) $(TESTUTIL) -o $@ -lkyotocabinet $(LIBS) leveldbutil: db/leveldb_main.o $(LIBOBJECTS) $(CXX) $(LDFLAGS) db/leveldb_main.o $(LIBOBJECTS) -o $@ $(LIBS) arena_test: util/arena_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) util/arena_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) autocompact_test: db/autocompact_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) db/autocompact_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) bloom_test: util/bloom_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) util/bloom_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) c_test: db/c_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) db/c_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) cache_test: util/cache_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) util/cache_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) coding_test: util/coding_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) util/coding_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) corruption_test: db/corruption_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) db/corruption_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) crc32c_test: util/crc32c_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) util/crc32c_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) db_test: db/db_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) db/db_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) dbformat_test: db/dbformat_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) db/dbformat_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) env_test: util/env_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) util/env_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) filename_test: db/filename_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) db/filename_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) filter_block_test: table/filter_block_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) table/filter_block_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) issue178_test: issues/issue178_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) issues/issue178_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) issue200_test: issues/issue200_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) issues/issue200_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) log_test: db/log_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) db/log_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) table_test: table/table_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) table/table_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) skiplist_test: db/skiplist_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) db/skiplist_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) version_edit_test: db/version_edit_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) db/version_edit_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) version_set_test: db/version_set_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) db/version_set_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) write_batch_test: db/write_batch_test.o $(LIBOBJECTS) $(TESTHARNESS) $(CXX) $(LDFLAGS) db/write_batch_test.o $(LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS) $(MEMENVLIBRARY) : $(MEMENVOBJECTS) rm -f $@ $(AR) -rs $@ $(MEMENVOBJECTS) memenv_test : helpers/memenv/memenv_test.o $(MEMENVLIBRARY) $(LIBRARY) $(TESTHARNESS) $(CXX) $(LDFLAGS) helpers/memenv/memenv_test.o $(MEMENVLIBRARY) $(LIBRARY) $(TESTHARNESS) -o $@ $(LIBS) ifeq ($(PLATFORM), IOS) # For iOS, create universal object files to be used on both the simulator and # a device. PLATFORMSROOT=/Applications/Xcode.app/Contents/Developer/Platforms SIMULATORROOT=$(PLATFORMSROOT)/iPhoneSimulator.platform/Developer DEVICEROOT=$(PLATFORMSROOT)/iPhoneOS.platform/Developer IOSVERSION=$(shell defaults read $(PLATFORMSROOT)/iPhoneOS.platform/version CFBundleShortVersionString) .cc.o: mkdir -p ios-x86/$(dir $@) $(CXX) $(CXXFLAGS) -isysroot $(SIMULATORROOT)/SDKs/iPhoneSimulator$(IOSVERSION).sdk -arch i686 -c $< -o ios-x86/$@ mkdir -p ios-arm/$(dir $@) xcrun -sdk iphoneos $(CXX) $(CXXFLAGS) -isysroot $(DEVICEROOT)/SDKs/iPhoneOS$(IOSVERSION).sdk -arch armv6 -arch armv7 -c $< -o ios-arm/$@ lipo ios-x86/$@ ios-arm/$@ -create -output $@ .c.o: mkdir -p ios-x86/$(dir $@) $(CC) $(CFLAGS) -isysroot $(SIMULATORROOT)/SDKs/iPhoneSimulator$(IOSVERSION).sdk -arch i686 -c $< -o ios-x86/$@ mkdir -p ios-arm/$(dir $@) xcrun -sdk iphoneos $(CC) $(CFLAGS) -isysroot $(DEVICEROOT)/SDKs/iPhoneOS$(IOSVERSION).sdk -arch armv6 -arch armv7 -c $< -o ios-arm/$@ lipo ios-x86/$@ ios-arm/$@ -create -output $@ else .cc.o: $(CXX) $(CXXFLAGS) -c $< -o $@ .c.o: $(CC) $(CFLAGS) -c $< -o $@ endif armory-0.92.3/cppForSwig/leveldb/include/0000755000000000000000000000000012414772654016753 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb/include/leveldb/0000755000000000000000000000000012414772654020370 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb/include/leveldb/db.h0000644000000000000000000001440512414772654021132 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_INCLUDE_DB_H_ #define STORAGE_LEVELDB_INCLUDE_DB_H_ #include #include #include "leveldb/iterator.h" #include "leveldb/options.h" namespace leveldb { // Update Makefile if you change these static const int kMajorVersion = 1; static const int kMinorVersion = 15; struct Options; struct ReadOptions; struct WriteOptions; class WriteBatch; // Abstract handle to particular state of a DB. // A Snapshot is an immutable object and can therefore be safely // accessed from multiple threads without any external synchronization. class Snapshot { protected: virtual ~Snapshot(); }; // A range of keys struct Range { Slice start; // Included in the range Slice limit; // Not included in the range Range() { } Range(const Slice& s, const Slice& l) : start(s), limit(l) { } }; // A DB is a persistent ordered map from keys to values. // A DB is safe for concurrent access from multiple threads without // any external synchronization. class DB { public: // Open the database with the specified "name". // Stores a pointer to a heap-allocated database in *dbptr and returns // OK on success. // Stores NULL in *dbptr and returns a non-OK status on error. // Caller should delete *dbptr when it is no longer needed. static Status Open(const Options& options, const std::string& name, DB** dbptr); DB() { } virtual ~DB(); // Set the database entry for "key" to "value". Returns OK on success, // and a non-OK status on error. // Note: consider setting options.sync = true. virtual Status Put(const WriteOptions& options, const Slice& key, const Slice& value) = 0; // Remove the database entry (if any) for "key". Returns OK on // success, and a non-OK status on error. It is not an error if "key" // did not exist in the database. // Note: consider setting options.sync = true. virtual Status Delete(const WriteOptions& options, const Slice& key) = 0; // Apply the specified updates to the database. // Returns OK on success, non-OK on failure. // Note: consider setting options.sync = true. virtual Status Write(const WriteOptions& options, WriteBatch* updates) = 0; // If the database contains an entry for "key" store the // corresponding value in *value and return OK. // // If there is no entry for "key" leave *value unchanged and return // a status for which Status::IsNotFound() returns true. // // May return some other Status on an error. virtual Status Get(const ReadOptions& options, const Slice& key, std::string* value) = 0; // Return a heap-allocated iterator over the contents of the database. // The result of NewIterator() is initially invalid (caller must // call one of the Seek methods on the iterator before using it). // // Caller should delete the iterator when it is no longer needed. // The returned iterator should be deleted before this db is deleted. virtual Iterator* NewIterator(const ReadOptions& options) = 0; // Return a handle to the current DB state. Iterators created with // this handle will all observe a stable snapshot of the current DB // state. The caller must call ReleaseSnapshot(result) when the // snapshot is no longer needed. virtual const Snapshot* GetSnapshot() = 0; // Release a previously acquired snapshot. The caller must not // use "snapshot" after this call. virtual void ReleaseSnapshot(const Snapshot* snapshot) = 0; // DB implementations can export properties about their state // via this method. If "property" is a valid property understood by this // DB implementation, fills "*value" with its current value and returns // true. Otherwise returns false. // // // Valid property names include: // // "leveldb.num-files-at-level" - return the number of files at level , // where is an ASCII representation of a level number (e.g. "0"). // "leveldb.stats" - returns a multi-line string that describes statistics // about the internal operation of the DB. // "leveldb.sstables" - returns a multi-line string that describes all // of the sstables that make up the db contents. virtual bool GetProperty(const Slice& property, std::string* value) = 0; // For each i in [0,n-1], store in "sizes[i]", the approximate // file system space used by keys in "[range[i].start .. range[i].limit)". // // Note that the returned sizes measure file system space usage, so // if the user data compresses by a factor of ten, the returned // sizes will be one-tenth the size of the corresponding user data size. // // The results may not include the sizes of recently written data. virtual void GetApproximateSizes(const Range* range, int n, uint64_t* sizes) = 0; // Compact the underlying storage for the key range [*begin,*end]. // In particular, deleted and overwritten versions are discarded, // and the data is rearranged to reduce the cost of operations // needed to access the data. This operation should typically only // be invoked by users who understand the underlying implementation. // // begin==NULL is treated as a key before all keys in the database. // end==NULL is treated as a key after all keys in the database. // Therefore the following call will compact the entire database: // db->CompactRange(NULL, NULL); virtual void CompactRange(const Slice* begin, const Slice* end) = 0; private: // No copying allowed DB(const DB&); void operator=(const DB&); }; // Destroy the contents of the specified database. // Be very careful using this method. Status DestroyDB(const std::string& name, const Options& options); // If a DB cannot be opened, you may attempt to call this method to // resurrect as much of the contents of the database as possible. // Some data may be lost, so be careful when calling this function // on a database that contains important information. Status RepairDB(const std::string& dbname, const Options& options); } // namespace leveldb #endif // STORAGE_LEVELDB_INCLUDE_DB_H_ armory-0.92.3/cppForSwig/leveldb/include/leveldb/comparator.h0000644000000000000000000000445512414772654022720 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_INCLUDE_COMPARATOR_H_ #define STORAGE_LEVELDB_INCLUDE_COMPARATOR_H_ #include namespace leveldb { class Slice; // A Comparator object provides a total order across slices that are // used as keys in an sstable or a database. A Comparator implementation // must be thread-safe since leveldb may invoke its methods concurrently // from multiple threads. class Comparator { public: virtual ~Comparator(); // Three-way comparison. Returns value: // < 0 iff "a" < "b", // == 0 iff "a" == "b", // > 0 iff "a" > "b" virtual int Compare(const Slice& a, const Slice& b) const = 0; // The name of the comparator. Used to check for comparator // mismatches (i.e., a DB created with one comparator is // accessed using a different comparator. // // The client of this package should switch to a new name whenever // the comparator implementation changes in a way that will cause // the relative ordering of any two keys to change. // // Names starting with "leveldb." are reserved and should not be used // by any clients of this package. virtual const char* Name() const = 0; // Advanced functions: these are used to reduce the space requirements // for internal data structures like index blocks. // If *start < limit, changes *start to a short string in [start,limit). // Simple comparator implementations may return with *start unchanged, // i.e., an implementation of this method that does nothing is correct. virtual void FindShortestSeparator( std::string* start, const Slice& limit) const = 0; // Changes *key to a short string >= *key. // Simple comparator implementations may return with *key unchanged, // i.e., an implementation of this method that does nothing is correct. virtual void FindShortSuccessor(std::string* key) const = 0; }; // Return a builtin comparator that uses lexicographic byte-wise // ordering. The result remains the property of this module and // must not be deleted. extern const Comparator* BytewiseComparator(); } // namespace leveldb #endif // STORAGE_LEVELDB_INCLUDE_COMPARATOR_H_ armory-0.92.3/cppForSwig/leveldb/include/leveldb/table.h0000644000000000000000000000562312414772654021636 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_INCLUDE_TABLE_H_ #define STORAGE_LEVELDB_INCLUDE_TABLE_H_ #include #include "leveldb/iterator.h" namespace leveldb { class Block; class BlockHandle; class Footer; struct Options; class RandomAccessFile; struct ReadOptions; class TableCache; // A Table is a sorted map from strings to strings. Tables are // immutable and persistent. A Table may be safely accessed from // multiple threads without external synchronization. class Table { public: // Attempt to open the table that is stored in bytes [0..file_size) // of "file", and read the metadata entries necessary to allow // retrieving data from the table. // // If successful, returns ok and sets "*table" to the newly opened // table. The client should delete "*table" when no longer needed. // If there was an error while initializing the table, sets "*table" // to NULL and returns a non-ok status. Does not take ownership of // "*source", but the client must ensure that "source" remains live // for the duration of the returned table's lifetime. // // *file must remain live while this Table is in use. static Status Open(const Options& options, RandomAccessFile* file, uint64_t file_size, Table** table); ~Table(); // Returns a new iterator over the table contents. // The result of NewIterator() is initially invalid (caller must // call one of the Seek methods on the iterator before using it). Iterator* NewIterator(const ReadOptions&) const; // Given a key, return an approximate byte offset in the file where // the data for that key begins (or would begin if the key were // present in the file). The returned value is in terms of file // bytes, and so includes effects like compression of the underlying data. // E.g., the approximate offset of the last key in the table will // be close to the file length. uint64_t ApproximateOffsetOf(const Slice& key) const; private: struct Rep; Rep* rep_; explicit Table(Rep* rep) { rep_ = rep; } static Iterator* BlockReader(void*, const ReadOptions&, const Slice&); // Calls (*handle_result)(arg, ...) with the entry found after a call // to Seek(key). May not make such a call if filter policy says // that key is not present. friend class TableCache; Status InternalGet( const ReadOptions&, const Slice& key, void* arg, void (*handle_result)(void* arg, const Slice& k, const Slice& v)); void ReadMeta(const Footer& footer); void ReadFilter(const Slice& filter_handle_value); // No copying allowed Table(const Table&); void operator=(const Table&); }; } // namespace leveldb #endif // STORAGE_LEVELDB_INCLUDE_TABLE_H_ armory-0.92.3/cppForSwig/leveldb/include/leveldb/write_batch.h0000644000000000000000000000347012414772654023040 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // WriteBatch holds a collection of updates to apply atomically to a DB. // // The updates are applied in the order in which they are added // to the WriteBatch. For example, the value of "key" will be "v3" // after the following batch is written: // // batch.Put("key", "v1"); // batch.Delete("key"); // batch.Put("key", "v2"); // batch.Put("key", "v3"); // // Multiple threads can invoke const methods on a WriteBatch without // external synchronization, but if any of the threads may call a // non-const method, all threads accessing the same WriteBatch must use // external synchronization. #ifndef STORAGE_LEVELDB_INCLUDE_WRITE_BATCH_H_ #define STORAGE_LEVELDB_INCLUDE_WRITE_BATCH_H_ #include #include "leveldb/status.h" namespace leveldb { class Slice; class WriteBatch { public: WriteBatch(); ~WriteBatch(); // Store the mapping "key->value" in the database. void Put(const Slice& key, const Slice& value); // If the database contains a mapping for "key", erase it. Else do nothing. void Delete(const Slice& key); // Clear all updates buffered in this batch. void Clear(); // Support for iterating over the contents of a batch. class Handler { public: virtual ~Handler(); virtual void Put(const Slice& key, const Slice& value) = 0; virtual void Delete(const Slice& key) = 0; }; Status Iterate(Handler* handler) const; private: friend class WriteBatchInternal; std::string rep_; // See comment in write_batch.cc for the format of rep_ // Intentionally copyable }; } // namespace leveldb #endif // STORAGE_LEVELDB_INCLUDE_WRITE_BATCH_H_ armory-0.92.3/cppForSwig/leveldb/include/leveldb/status.h0000644000000000000000000000642612414772654022074 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // A Status encapsulates the result of an operation. It may indicate success, // or it may indicate an error with an associated error message. // // Multiple threads can invoke const methods on a Status without // external synchronization, but if any of the threads may call a // non-const method, all threads accessing the same Status must use // external synchronization. #ifndef STORAGE_LEVELDB_INCLUDE_STATUS_H_ #define STORAGE_LEVELDB_INCLUDE_STATUS_H_ #include #include "leveldb/slice.h" namespace leveldb { class Status { public: // Create a success status. Status() : state_(NULL) { } ~Status() { delete[] state_; } // Copy the specified status. Status(const Status& s); void operator=(const Status& s); // Return a success status. static Status OK() { return Status(); } // Return error status of an appropriate type. static Status NotFound(const Slice& msg, const Slice& msg2 = Slice()) { return Status(kNotFound, msg, msg2); } static Status Corruption(const Slice& msg, const Slice& msg2 = Slice()) { return Status(kCorruption, msg, msg2); } static Status NotSupported(const Slice& msg, const Slice& msg2 = Slice()) { return Status(kNotSupported, msg, msg2); } static Status InvalidArgument(const Slice& msg, const Slice& msg2 = Slice()) { return Status(kInvalidArgument, msg, msg2); } static Status IOError(const Slice& msg, const Slice& msg2 = Slice()) { return Status(kIOError, msg, msg2); } // Returns true iff the status indicates success. bool ok() const { return (state_ == NULL); } // Returns true iff the status indicates a NotFound error. bool IsNotFound() const { return code() == kNotFound; } // Returns true iff the status indicates a Corruption error. bool IsCorruption() const { return code() == kCorruption; } // Returns true iff the status indicates an IOError. bool IsIOError() const { return code() == kIOError; } // Return a string representation of this status suitable for printing. // Returns the string "OK" for success. std::string ToString() const; private: // OK status has a NULL state_. Otherwise, state_ is a new[] array // of the following form: // state_[0..3] == length of message // state_[4] == code // state_[5..] == message const char* state_; enum Code { kOk = 0, kNotFound = 1, kCorruption = 2, kNotSupported = 3, kInvalidArgument = 4, kIOError = 5 }; Code code() const { return (state_ == NULL) ? kOk : static_cast(state_[4]); } Status(Code code, const Slice& msg, const Slice& msg2); static const char* CopyState(const char* s); }; inline Status::Status(const Status& s) { state_ = (s.state_ == NULL) ? NULL : CopyState(s.state_); } inline void Status::operator=(const Status& s) { // The following condition catches both aliasing (when this == &s), // and the common case where both s and *this are ok. if (state_ != s.state_) { delete[] state_; state_ = (s.state_ == NULL) ? NULL : CopyState(s.state_); } } } // namespace leveldb #endif // STORAGE_LEVELDB_INCLUDE_STATUS_H_ armory-0.92.3/cppForSwig/leveldb/include/leveldb/env.h0000644000000000000000000002726512414772654021345 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // An Env is an interface used by the leveldb implementation to access // operating system functionality like the filesystem etc. Callers // may wish to provide a custom Env object when opening a database to // get fine gain control; e.g., to rate limit file system operations. // // All Env implementations are safe for concurrent access from // multiple threads without any external synchronization. #ifndef STORAGE_LEVELDB_INCLUDE_ENV_H_ #define STORAGE_LEVELDB_INCLUDE_ENV_H_ #include #include #include #include #include "leveldb/status.h" namespace leveldb { class FileLock; class Logger; class RandomAccessFile; class SequentialFile; class Slice; class WritableFile; class Env { public: Env() { } virtual ~Env(); // Return a default environment suitable for the current operating // system. Sophisticated users may wish to provide their own Env // implementation instead of relying on this default environment. // // The result of Default() belongs to leveldb and must never be deleted. static Env* Default(); // Create a brand new sequentially-readable file with the specified name. // On success, stores a pointer to the new file in *result and returns OK. // On failure stores NULL in *result and returns non-OK. If the file does // not exist, returns a non-OK status. // // The returned file will only be accessed by one thread at a time. virtual Status NewSequentialFile(const std::string& fname, SequentialFile** result) = 0; // Create a brand new random access read-only file with the // specified name. On success, stores a pointer to the new file in // *result and returns OK. On failure stores NULL in *result and // returns non-OK. If the file does not exist, returns a non-OK // status. // // The returned file may be concurrently accessed by multiple threads. virtual Status NewRandomAccessFile(const std::string& fname, RandomAccessFile** result) = 0; // Create an object that writes to a new file with the specified // name. Deletes any existing file with the same name and creates a // new file. On success, stores a pointer to the new file in // *result and returns OK. On failure stores NULL in *result and // returns non-OK. // // The returned file will only be accessed by one thread at a time. virtual Status NewWritableFile(const std::string& fname, WritableFile** result) = 0; // Returns true iff the named file exists. virtual bool FileExists(const std::string& fname) = 0; // Store in *result the names of the children of the specified directory. // The names are relative to "dir". // Original contents of *results are dropped. virtual Status GetChildren(const std::string& dir, std::vector* result) = 0; // Delete the named file. virtual Status DeleteFile(const std::string& fname) = 0; // Create the specified directory. virtual Status CreateDir(const std::string& dirname) = 0; // Delete the specified directory. virtual Status DeleteDir(const std::string& dirname) = 0; // Store the size of fname in *file_size. virtual Status GetFileSize(const std::string& fname, uint64_t* file_size) = 0; // Rename file src to target. virtual Status RenameFile(const std::string& src, const std::string& target) = 0; // Lock the specified file. Used to prevent concurrent access to // the same db by multiple processes. On failure, stores NULL in // *lock and returns non-OK. // // On success, stores a pointer to the object that represents the // acquired lock in *lock and returns OK. The caller should call // UnlockFile(*lock) to release the lock. If the process exits, // the lock will be automatically released. // // If somebody else already holds the lock, finishes immediately // with a failure. I.e., this call does not wait for existing locks // to go away. // // May create the named file if it does not already exist. virtual Status LockFile(const std::string& fname, FileLock** lock) = 0; // Release the lock acquired by a previous successful call to LockFile. // REQUIRES: lock was returned by a successful LockFile() call // REQUIRES: lock has not already been unlocked. virtual Status UnlockFile(FileLock* lock) = 0; // Arrange to run "(*function)(arg)" once in a background thread. // // "function" may run in an unspecified thread. Multiple functions // added to the same Env may run concurrently in different threads. // I.e., the caller may not assume that background work items are // serialized. virtual void Schedule( void (*function)(void* arg), void* arg) = 0; // Start a new thread, invoking "function(arg)" within the new thread. // When "function(arg)" returns, the thread will be destroyed. virtual void StartThread(void (*function)(void* arg), void* arg) = 0; // *path is set to a temporary directory that can be used for testing. It may // or many not have just been created. The directory may or may not differ // between runs of the same process, but subsequent calls will return the // same directory. virtual Status GetTestDirectory(std::string* path) = 0; // Create and return a log file for storing informational messages. virtual Status NewLogger(const std::string& fname, Logger** result) = 0; // Returns the number of micro-seconds since some fixed point in time. Only // useful for computing deltas of time. virtual uint64_t NowMicros() = 0; // Sleep/delay the thread for the perscribed number of micro-seconds. virtual void SleepForMicroseconds(int micros) = 0; private: // No copying allowed Env(const Env&); void operator=(const Env&); }; // A file abstraction for reading sequentially through a file class SequentialFile { public: SequentialFile() { } virtual ~SequentialFile(); // Read up to "n" bytes from the file. "scratch[0..n-1]" may be // written by this routine. Sets "*result" to the data that was // read (including if fewer than "n" bytes were successfully read). // May set "*result" to point at data in "scratch[0..n-1]", so // "scratch[0..n-1]" must be live when "*result" is used. // If an error was encountered, returns a non-OK status. // // REQUIRES: External synchronization virtual Status Read(size_t n, Slice* result, char* scratch) = 0; // Skip "n" bytes from the file. This is guaranteed to be no // slower that reading the same data, but may be faster. // // If end of file is reached, skipping will stop at the end of the // file, and Skip will return OK. // // REQUIRES: External synchronization virtual Status Skip(uint64_t n) = 0; private: // No copying allowed SequentialFile(const SequentialFile&); void operator=(const SequentialFile&); }; // A file abstraction for randomly reading the contents of a file. class RandomAccessFile { public: RandomAccessFile() { } virtual ~RandomAccessFile(); // Read up to "n" bytes from the file starting at "offset". // "scratch[0..n-1]" may be written by this routine. Sets "*result" // to the data that was read (including if fewer than "n" bytes were // successfully read). May set "*result" to point at data in // "scratch[0..n-1]", so "scratch[0..n-1]" must be live when // "*result" is used. If an error was encountered, returns a non-OK // status. // // Safe for concurrent use by multiple threads. virtual Status Read(uint64_t offset, size_t n, Slice* result, char* scratch) const = 0; private: // No copying allowed RandomAccessFile(const RandomAccessFile&); void operator=(const RandomAccessFile&); }; // A file abstraction for sequential writing. The implementation // must provide buffering since callers may append small fragments // at a time to the file. class WritableFile { public: WritableFile() { } virtual ~WritableFile(); virtual Status Append(const Slice& data) = 0; virtual Status Close() = 0; virtual Status Flush() = 0; virtual Status Sync() = 0; private: // No copying allowed WritableFile(const WritableFile&); void operator=(const WritableFile&); }; // An interface for writing log messages. class Logger { public: Logger() { } virtual ~Logger(); // Write an entry to the log file with the specified format. virtual void Logv(const char* format, va_list ap) = 0; private: // No copying allowed Logger(const Logger&); void operator=(const Logger&); }; // Identifies a locked file. class FileLock { public: FileLock() { } virtual ~FileLock(); private: // No copying allowed FileLock(const FileLock&); void operator=(const FileLock&); }; // Log the specified data to *info_log if info_log is non-NULL. extern void Log(Logger* info_log, const char* format, ...) # if defined(__GNUC__) || defined(__clang__) __attribute__((__format__ (__printf__, 2, 3))) # endif ; // A utility routine: write "data" to the named file. extern Status WriteStringToFile(Env* env, const Slice& data, const std::string& fname); // A utility routine: read contents of named file into *data extern Status ReadFileToString(Env* env, const std::string& fname, std::string* data); // An implementation of Env that forwards all calls to another Env. // May be useful to clients who wish to override just part of the // functionality of another Env. class EnvWrapper : public Env { public: // Initialize an EnvWrapper that delegates all calls to *t explicit EnvWrapper(Env* t) : target_(t) { } virtual ~EnvWrapper(); // Return the target to which this Env forwards all calls Env* target() const { return target_; } // The following text is boilerplate that forwards all methods to target() Status NewSequentialFile(const std::string& f, SequentialFile** r) { return target_->NewSequentialFile(f, r); } Status NewRandomAccessFile(const std::string& f, RandomAccessFile** r) { return target_->NewRandomAccessFile(f, r); } Status NewWritableFile(const std::string& f, WritableFile** r) { return target_->NewWritableFile(f, r); } bool FileExists(const std::string& f) { return target_->FileExists(f); } Status GetChildren(const std::string& dir, std::vector* r) { return target_->GetChildren(dir, r); } Status DeleteFile(const std::string& f) { return target_->DeleteFile(f); } Status CreateDir(const std::string& d) { return target_->CreateDir(d); } Status DeleteDir(const std::string& d) { return target_->DeleteDir(d); } Status GetFileSize(const std::string& f, uint64_t* s) { return target_->GetFileSize(f, s); } Status RenameFile(const std::string& s, const std::string& t) { return target_->RenameFile(s, t); } Status LockFile(const std::string& f, FileLock** l) { return target_->LockFile(f, l); } Status UnlockFile(FileLock* l) { return target_->UnlockFile(l); } void Schedule(void (*f)(void*), void* a) { return target_->Schedule(f, a); } void StartThread(void (*f)(void*), void* a) { return target_->StartThread(f, a); } virtual Status GetTestDirectory(std::string* path) { return target_->GetTestDirectory(path); } virtual Status NewLogger(const std::string& fname, Logger** result) { return target_->NewLogger(fname, result); } uint64_t NowMicros() { return target_->NowMicros(); } void SleepForMicroseconds(int micros) { target_->SleepForMicroseconds(micros); } private: Env* target_; }; } // namespace leveldb #endif // STORAGE_LEVELDB_INCLUDE_ENV_H_ armory-0.92.3/cppForSwig/leveldb/include/leveldb/iterator.h0000644000000000000000000000665612414772654022407 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // An iterator yields a sequence of key/value pairs from a source. // The following class defines the interface. Multiple implementations // are provided by this library. In particular, iterators are provided // to access the contents of a Table or a DB. // // Multiple threads can invoke const methods on an Iterator without // external synchronization, but if any of the threads may call a // non-const method, all threads accessing the same Iterator must use // external synchronization. #ifndef STORAGE_LEVELDB_INCLUDE_ITERATOR_H_ #define STORAGE_LEVELDB_INCLUDE_ITERATOR_H_ #include "leveldb/slice.h" #include "leveldb/status.h" namespace leveldb { class Iterator { public: Iterator(); virtual ~Iterator(); // An iterator is either positioned at a key/value pair, or // not valid. This method returns true iff the iterator is valid. virtual bool Valid() const = 0; // Position at the first key in the source. The iterator is Valid() // after this call iff the source is not empty. virtual void SeekToFirst() = 0; // Position at the last key in the source. The iterator is // Valid() after this call iff the source is not empty. virtual void SeekToLast() = 0; // Position at the first key in the source that at or past target // The iterator is Valid() after this call iff the source contains // an entry that comes at or past target. virtual void Seek(const Slice& target) = 0; // Moves to the next entry in the source. After this call, Valid() is // true iff the iterator was not positioned at the last entry in the source. // REQUIRES: Valid() virtual void Next() = 0; // Moves to the previous entry in the source. After this call, Valid() is // true iff the iterator was not positioned at the first entry in source. // REQUIRES: Valid() virtual void Prev() = 0; // Return the key for the current entry. The underlying storage for // the returned slice is valid only until the next modification of // the iterator. // REQUIRES: Valid() virtual Slice key() const = 0; // Return the value for the current entry. The underlying storage for // the returned slice is valid only until the next modification of // the iterator. // REQUIRES: !AtEnd() && !AtStart() virtual Slice value() const = 0; // If an error has occurred, return it. Else return an ok status. virtual Status status() const = 0; // Clients are allowed to register function/arg1/arg2 triples that // will be invoked when this iterator is destroyed. // // Note that unlike all of the preceding methods, this method is // not abstract and therefore clients should not override it. typedef void (*CleanupFunction)(void* arg1, void* arg2); void RegisterCleanup(CleanupFunction function, void* arg1, void* arg2); private: struct Cleanup { CleanupFunction function; void* arg1; void* arg2; Cleanup* next; }; Cleanup cleanup_; // No copying allowed Iterator(const Iterator&); void operator=(const Iterator&); }; // Return an empty iterator (yields nothing). extern Iterator* NewEmptyIterator(); // Return an empty iterator with the specified status. extern Iterator* NewErrorIterator(const Status& status); } // namespace leveldb #endif // STORAGE_LEVELDB_INCLUDE_ITERATOR_H_ armory-0.92.3/cppForSwig/leveldb/include/leveldb/table_builder.h0000644000000000000000000000650312414772654023342 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // TableBuilder provides the interface used to build a Table // (an immutable and sorted map from keys to values). // // Multiple threads can invoke const methods on a TableBuilder without // external synchronization, but if any of the threads may call a // non-const method, all threads accessing the same TableBuilder must use // external synchronization. #ifndef STORAGE_LEVELDB_INCLUDE_TABLE_BUILDER_H_ #define STORAGE_LEVELDB_INCLUDE_TABLE_BUILDER_H_ #include #include "leveldb/options.h" #include "leveldb/status.h" namespace leveldb { class BlockBuilder; class BlockHandle; class WritableFile; class TableBuilder { public: // Create a builder that will store the contents of the table it is // building in *file. Does not close the file. It is up to the // caller to close the file after calling Finish(). TableBuilder(const Options& options, WritableFile* file); // REQUIRES: Either Finish() or Abandon() has been called. ~TableBuilder(); // Change the options used by this builder. Note: only some of the // option fields can be changed after construction. If a field is // not allowed to change dynamically and its value in the structure // passed to the constructor is different from its value in the // structure passed to this method, this method will return an error // without changing any fields. Status ChangeOptions(const Options& options); // Add key,value to the table being constructed. // REQUIRES: key is after any previously added key according to comparator. // REQUIRES: Finish(), Abandon() have not been called void Add(const Slice& key, const Slice& value); // Advanced operation: flush any buffered key/value pairs to file. // Can be used to ensure that two adjacent entries never live in // the same data block. Most clients should not need to use this method. // REQUIRES: Finish(), Abandon() have not been called void Flush(); // Return non-ok iff some error has been detected. Status status() const; // Finish building the table. Stops using the file passed to the // constructor after this function returns. // REQUIRES: Finish(), Abandon() have not been called Status Finish(); // Indicate that the contents of this builder should be abandoned. Stops // using the file passed to the constructor after this function returns. // If the caller is not going to call Finish(), it must call Abandon() // before destroying this builder. // REQUIRES: Finish(), Abandon() have not been called void Abandon(); // Number of calls to Add() so far. uint64_t NumEntries() const; // Size of the file generated so far. If invoked after a successful // Finish() call, returns the size of the final generated file. uint64_t FileSize() const; private: bool ok() const { return status().ok(); } void WriteBlock(BlockBuilder* block, BlockHandle* handle); void WriteRawBlock(const Slice& data, CompressionType, BlockHandle* handle); struct Rep; Rep* rep_; // No copying allowed TableBuilder(const TableBuilder&); void operator=(const TableBuilder&); }; } // namespace leveldb #endif // STORAGE_LEVELDB_INCLUDE_TABLE_BUILDER_H_ armory-0.92.3/cppForSwig/leveldb/include/leveldb/c.h0000644000000000000000000002326512414772654020773 0ustar rootroot/* Copyright (c) 2011 The LevelDB Authors. All rights reserved. Use of this source code is governed by a BSD-style license that can be found in the LICENSE file. See the AUTHORS file for names of contributors. C bindings for leveldb. May be useful as a stable ABI that can be used by programs that keep leveldb in a shared library, or for a JNI api. Does not support: . getters for the option types . custom comparators that implement key shortening . capturing post-write-snapshot . custom iter, db, env, cache implementations using just the C bindings Some conventions: (1) We expose just opaque struct pointers and functions to clients. This allows us to change internal representations without having to recompile clients. (2) For simplicity, there is no equivalent to the Slice type. Instead, the caller has to pass the pointer and length as separate arguments. (3) Errors are represented by a null-terminated c string. NULL means no error. All operations that can raise an error are passed a "char** errptr" as the last argument. One of the following must be true on entry: *errptr == NULL *errptr points to a malloc()ed null-terminated error message (On Windows, *errptr must have been malloc()-ed by this library.) On success, a leveldb routine leaves *errptr unchanged. On failure, leveldb frees the old value of *errptr and set *errptr to a malloc()ed error message. (4) Bools have the type unsigned char (0 == false; rest == true) (5) All of the pointer arguments must be non-NULL. */ #ifndef STORAGE_LEVELDB_INCLUDE_C_H_ #define STORAGE_LEVELDB_INCLUDE_C_H_ #ifdef __cplusplus extern "C" { #endif #include #include #include /* Exported types */ typedef struct leveldb_t leveldb_t; typedef struct leveldb_cache_t leveldb_cache_t; typedef struct leveldb_comparator_t leveldb_comparator_t; typedef struct leveldb_env_t leveldb_env_t; typedef struct leveldb_filelock_t leveldb_filelock_t; typedef struct leveldb_filterpolicy_t leveldb_filterpolicy_t; typedef struct leveldb_iterator_t leveldb_iterator_t; typedef struct leveldb_logger_t leveldb_logger_t; typedef struct leveldb_options_t leveldb_options_t; typedef struct leveldb_randomfile_t leveldb_randomfile_t; typedef struct leveldb_readoptions_t leveldb_readoptions_t; typedef struct leveldb_seqfile_t leveldb_seqfile_t; typedef struct leveldb_snapshot_t leveldb_snapshot_t; typedef struct leveldb_writablefile_t leveldb_writablefile_t; typedef struct leveldb_writebatch_t leveldb_writebatch_t; typedef struct leveldb_writeoptions_t leveldb_writeoptions_t; /* DB operations */ extern leveldb_t* leveldb_open( const leveldb_options_t* options, const char* name, char** errptr); extern void leveldb_close(leveldb_t* db); extern void leveldb_put( leveldb_t* db, const leveldb_writeoptions_t* options, const char* key, size_t keylen, const char* val, size_t vallen, char** errptr); extern void leveldb_delete( leveldb_t* db, const leveldb_writeoptions_t* options, const char* key, size_t keylen, char** errptr); extern void leveldb_write( leveldb_t* db, const leveldb_writeoptions_t* options, leveldb_writebatch_t* batch, char** errptr); /* Returns NULL if not found. A malloc()ed array otherwise. Stores the length of the array in *vallen. */ extern char* leveldb_get( leveldb_t* db, const leveldb_readoptions_t* options, const char* key, size_t keylen, size_t* vallen, char** errptr); extern leveldb_iterator_t* leveldb_create_iterator( leveldb_t* db, const leveldb_readoptions_t* options); extern const leveldb_snapshot_t* leveldb_create_snapshot( leveldb_t* db); extern void leveldb_release_snapshot( leveldb_t* db, const leveldb_snapshot_t* snapshot); /* Returns NULL if property name is unknown. Else returns a pointer to a malloc()-ed null-terminated value. */ extern char* leveldb_property_value( leveldb_t* db, const char* propname); extern void leveldb_approximate_sizes( leveldb_t* db, int num_ranges, const char* const* range_start_key, const size_t* range_start_key_len, const char* const* range_limit_key, const size_t* range_limit_key_len, uint64_t* sizes); extern void leveldb_compact_range( leveldb_t* db, const char* start_key, size_t start_key_len, const char* limit_key, size_t limit_key_len); /* Management operations */ extern void leveldb_destroy_db( const leveldb_options_t* options, const char* name, char** errptr); extern void leveldb_repair_db( const leveldb_options_t* options, const char* name, char** errptr); /* Iterator */ extern void leveldb_iter_destroy(leveldb_iterator_t*); extern unsigned char leveldb_iter_valid(const leveldb_iterator_t*); extern void leveldb_iter_seek_to_first(leveldb_iterator_t*); extern void leveldb_iter_seek_to_last(leveldb_iterator_t*); extern void leveldb_iter_seek(leveldb_iterator_t*, const char* k, size_t klen); extern void leveldb_iter_next(leveldb_iterator_t*); extern void leveldb_iter_prev(leveldb_iterator_t*); extern const char* leveldb_iter_key(const leveldb_iterator_t*, size_t* klen); extern const char* leveldb_iter_value(const leveldb_iterator_t*, size_t* vlen); extern void leveldb_iter_get_error(const leveldb_iterator_t*, char** errptr); /* Write batch */ extern leveldb_writebatch_t* leveldb_writebatch_create(); extern void leveldb_writebatch_destroy(leveldb_writebatch_t*); extern void leveldb_writebatch_clear(leveldb_writebatch_t*); extern void leveldb_writebatch_put( leveldb_writebatch_t*, const char* key, size_t klen, const char* val, size_t vlen); extern void leveldb_writebatch_delete( leveldb_writebatch_t*, const char* key, size_t klen); extern void leveldb_writebatch_iterate( leveldb_writebatch_t*, void* state, void (*put)(void*, const char* k, size_t klen, const char* v, size_t vlen), void (*deleted)(void*, const char* k, size_t klen)); /* Options */ extern leveldb_options_t* leveldb_options_create(); extern void leveldb_options_destroy(leveldb_options_t*); extern void leveldb_options_set_comparator( leveldb_options_t*, leveldb_comparator_t*); extern void leveldb_options_set_filter_policy( leveldb_options_t*, leveldb_filterpolicy_t*); extern void leveldb_options_set_create_if_missing( leveldb_options_t*, unsigned char); extern void leveldb_options_set_error_if_exists( leveldb_options_t*, unsigned char); extern void leveldb_options_set_paranoid_checks( leveldb_options_t*, unsigned char); extern void leveldb_options_set_env(leveldb_options_t*, leveldb_env_t*); extern void leveldb_options_set_info_log(leveldb_options_t*, leveldb_logger_t*); extern void leveldb_options_set_write_buffer_size(leveldb_options_t*, size_t); extern void leveldb_options_set_max_open_files(leveldb_options_t*, int); extern void leveldb_options_set_cache(leveldb_options_t*, leveldb_cache_t*); extern void leveldb_options_set_block_size(leveldb_options_t*, size_t); extern void leveldb_options_set_block_restart_interval(leveldb_options_t*, int); enum { leveldb_no_compression = 0, leveldb_snappy_compression = 1 }; extern void leveldb_options_set_compression(leveldb_options_t*, int); /* Comparator */ extern leveldb_comparator_t* leveldb_comparator_create( void* state, void (*destructor)(void*), int (*compare)( void*, const char* a, size_t alen, const char* b, size_t blen), const char* (*name)(void*)); extern void leveldb_comparator_destroy(leveldb_comparator_t*); /* Filter policy */ extern leveldb_filterpolicy_t* leveldb_filterpolicy_create( void* state, void (*destructor)(void*), char* (*create_filter)( void*, const char* const* key_array, const size_t* key_length_array, int num_keys, size_t* filter_length), unsigned char (*key_may_match)( void*, const char* key, size_t length, const char* filter, size_t filter_length), const char* (*name)(void*)); extern void leveldb_filterpolicy_destroy(leveldb_filterpolicy_t*); extern leveldb_filterpolicy_t* leveldb_filterpolicy_create_bloom( int bits_per_key); /* Read options */ extern leveldb_readoptions_t* leveldb_readoptions_create(); extern void leveldb_readoptions_destroy(leveldb_readoptions_t*); extern void leveldb_readoptions_set_verify_checksums( leveldb_readoptions_t*, unsigned char); extern void leveldb_readoptions_set_fill_cache( leveldb_readoptions_t*, unsigned char); extern void leveldb_readoptions_set_snapshot( leveldb_readoptions_t*, const leveldb_snapshot_t*); /* Write options */ extern leveldb_writeoptions_t* leveldb_writeoptions_create(); extern void leveldb_writeoptions_destroy(leveldb_writeoptions_t*); extern void leveldb_writeoptions_set_sync( leveldb_writeoptions_t*, unsigned char); /* Cache */ extern leveldb_cache_t* leveldb_cache_create_lru(size_t capacity); extern void leveldb_cache_destroy(leveldb_cache_t* cache); /* Env */ extern leveldb_env_t* leveldb_create_default_env(); extern void leveldb_env_destroy(leveldb_env_t*); /* Utility */ /* Calls free(ptr). REQUIRES: ptr was malloc()-ed and returned by one of the routines in this file. Note that in certain cases (typically on Windows), you may need to call this routine instead of free(ptr) to dispose of malloc()-ed memory returned by this library. */ extern void leveldb_free(void* ptr); /* Return the major version number for this release. */ extern int leveldb_major_version(); /* Return the minor version number for this release. */ extern int leveldb_minor_version(); #ifdef __cplusplus } /* end extern "C" */ #endif #endif /* STORAGE_LEVELDB_INCLUDE_C_H_ */ armory-0.92.3/cppForSwig/leveldb/include/leveldb/slice.h0000644000000000000000000000607012414772654021643 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // Slice is a simple structure containing a pointer into some external // storage and a size. The user of a Slice must ensure that the slice // is not used after the corresponding external storage has been // deallocated. // // Multiple threads can invoke const methods on a Slice without // external synchronization, but if any of the threads may call a // non-const method, all threads accessing the same Slice must use // external synchronization. #ifndef STORAGE_LEVELDB_INCLUDE_SLICE_H_ #define STORAGE_LEVELDB_INCLUDE_SLICE_H_ #include #include #include #include namespace leveldb { class Slice { public: // Create an empty slice. Slice() : data_(""), size_(0) { } // Create a slice that refers to d[0,n-1]. Slice(const char* d, size_t n) : data_(d), size_(n) { } // Create a slice that refers to the contents of "s" Slice(const std::string& s) : data_(s.data()), size_(s.size()) { } // Create a slice that refers to s[0,strlen(s)-1] Slice(const char* s) : data_(s), size_(strlen(s)) { } // Return a pointer to the beginning of the referenced data const char* data() const { return data_; } // Return the length (in bytes) of the referenced data size_t size() const { return size_; } // Return true iff the length of the referenced data is zero bool empty() const { return size_ == 0; } // Return the ith byte in the referenced data. // REQUIRES: n < size() char operator[](size_t n) const { assert(n < size()); return data_[n]; } // Change this slice to refer to an empty array void clear() { data_ = ""; size_ = 0; } // Drop the first "n" bytes from this slice. void remove_prefix(size_t n) { assert(n <= size()); data_ += n; size_ -= n; } // Return a string that contains the copy of the referenced data. std::string ToString() const { return std::string(data_, size_); } // Three-way comparison. Returns value: // < 0 iff "*this" < "b", // == 0 iff "*this" == "b", // > 0 iff "*this" > "b" int compare(const Slice& b) const; // Return true iff "x" is a prefix of "*this" bool starts_with(const Slice& x) const { return ((size_ >= x.size_) && (memcmp(data_, x.data_, x.size_) == 0)); } private: const char* data_; size_t size_; // Intentionally copyable }; inline bool operator==(const Slice& x, const Slice& y) { return ((x.size() == y.size()) && (memcmp(x.data(), y.data(), x.size()) == 0)); } inline bool operator!=(const Slice& x, const Slice& y) { return !(x == y); } inline int Slice::compare(const Slice& b) const { const int min_len = (size_ < b.size_) ? size_ : b.size_; int r = memcmp(data_, b.data_, min_len); if (r == 0) { if (size_ < b.size_) r = -1; else if (size_ > b.size_) r = +1; } return r; } } // namespace leveldb #endif // STORAGE_LEVELDB_INCLUDE_SLICE_H_ armory-0.92.3/cppForSwig/leveldb/include/leveldb/filter_policy.h0000644000000000000000000000555512414772654023417 0ustar rootroot// Copyright (c) 2012 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // A database can be configured with a custom FilterPolicy object. // This object is responsible for creating a small filter from a set // of keys. These filters are stored in leveldb and are consulted // automatically by leveldb to decide whether or not to read some // information from disk. In many cases, a filter can cut down the // number of disk seeks form a handful to a single disk seek per // DB::Get() call. // // Most people will want to use the builtin bloom filter support (see // NewBloomFilterPolicy() below). #ifndef STORAGE_LEVELDB_INCLUDE_FILTER_POLICY_H_ #define STORAGE_LEVELDB_INCLUDE_FILTER_POLICY_H_ #include namespace leveldb { class Slice; class FilterPolicy { public: virtual ~FilterPolicy(); // Return the name of this policy. Note that if the filter encoding // changes in an incompatible way, the name returned by this method // must be changed. Otherwise, old incompatible filters may be // passed to methods of this type. virtual const char* Name() const = 0; // keys[0,n-1] contains a list of keys (potentially with duplicates) // that are ordered according to the user supplied comparator. // Append a filter that summarizes keys[0,n-1] to *dst. // // Warning: do not change the initial contents of *dst. Instead, // append the newly constructed filter to *dst. virtual void CreateFilter(const Slice* keys, int n, std::string* dst) const = 0; // "filter" contains the data appended by a preceding call to // CreateFilter() on this class. This method must return true if // the key was in the list of keys passed to CreateFilter(). // This method may return true or false if the key was not on the // list, but it should aim to return false with a high probability. virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const = 0; }; // Return a new filter policy that uses a bloom filter with approximately // the specified number of bits per key. A good value for bits_per_key // is 10, which yields a filter with ~ 1% false positive rate. // // Callers must delete the result after any database that is using the // result has been closed. // // Note: if you are using a custom comparator that ignores some parts // of the keys being compared, you must not use NewBloomFilterPolicy() // and must provide your own FilterPolicy that also ignores the // corresponding parts of the keys. For example, if the comparator // ignores trailing spaces, it would be incorrect to use a // FilterPolicy (like NewBloomFilterPolicy) that does not ignore // trailing spaces in keys. extern const FilterPolicy* NewBloomFilterPolicy(int bits_per_key); } #endif // STORAGE_LEVELDB_INCLUDE_FILTER_POLICY_H_ armory-0.92.3/cppForSwig/leveldb/include/leveldb/options.h0000644000000000000000000001523712414772654022244 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_INCLUDE_OPTIONS_H_ #define STORAGE_LEVELDB_INCLUDE_OPTIONS_H_ #include namespace leveldb { class Cache; class Comparator; class Env; class FilterPolicy; class Logger; class Snapshot; // DB contents are stored in a set of blocks, each of which holds a // sequence of key,value pairs. Each block may be compressed before // being stored in a file. The following enum describes which // compression method (if any) is used to compress a block. enum CompressionType { // NOTE: do not change the values of existing entries, as these are // part of the persistent format on disk. kNoCompression = 0x0, kSnappyCompression = 0x1 }; // Options to control the behavior of a database (passed to DB::Open) struct Options { // ------------------- // Parameters that affect behavior // Comparator used to define the order of keys in the table. // Default: a comparator that uses lexicographic byte-wise ordering // // REQUIRES: The client must ensure that the comparator supplied // here has the same name and orders keys *exactly* the same as the // comparator provided to previous open calls on the same DB. const Comparator* comparator; // If true, the database will be created if it is missing. // Default: false bool create_if_missing; // If true, an error is raised if the database already exists. // Default: false bool error_if_exists; // If true, the implementation will do aggressive checking of the // data it is processing and will stop early if it detects any // errors. This may have unforeseen ramifications: for example, a // corruption of one DB entry may cause a large number of entries to // become unreadable or for the entire DB to become unopenable. // Default: false bool paranoid_checks; // Use the specified object to interact with the environment, // e.g. to read/write files, schedule background work, etc. // Default: Env::Default() Env* env; // Any internal progress/error information generated by the db will // be written to info_log if it is non-NULL, or to a file stored // in the same directory as the DB contents if info_log is NULL. // Default: NULL Logger* info_log; // ------------------- // Parameters that affect performance // Amount of data to build up in memory (backed by an unsorted log // on disk) before converting to a sorted on-disk file. // // Larger values increase performance, especially during bulk loads. // Up to two write buffers may be held in memory at the same time, // so you may wish to adjust this parameter to control memory usage. // Also, a larger write buffer will result in a longer recovery time // the next time the database is opened. // // Default: 4MB size_t write_buffer_size; // Number of open files that can be used by the DB. You may need to // increase this if your database has a large working set (budget // one open file per 2MB of working set). // // Default: 1000 int max_open_files; // Control over blocks (user data is stored in a set of blocks, and // a block is the unit of reading from disk). // If non-NULL, use the specified cache for blocks. // If NULL, leveldb will automatically create and use an 8MB internal cache. // Default: NULL Cache* block_cache; // Approximate size of user data packed per block. Note that the // block size specified here corresponds to uncompressed data. The // actual size of the unit read from disk may be smaller if // compression is enabled. This parameter can be changed dynamically. // // Default: 4K size_t block_size; // Number of keys between restart points for delta encoding of keys. // This parameter can be changed dynamically. Most clients should // leave this parameter alone. // // Default: 16 int block_restart_interval; // Compress blocks using the specified compression algorithm. This // parameter can be changed dynamically. // // Default: kSnappyCompression, which gives lightweight but fast // compression. // // Typical speeds of kSnappyCompression on an Intel(R) Core(TM)2 2.4GHz: // ~200-500MB/s compression // ~400-800MB/s decompression // Note that these speeds are significantly faster than most // persistent storage speeds, and therefore it is typically never // worth switching to kNoCompression. Even if the input data is // incompressible, the kSnappyCompression implementation will // efficiently detect that and will switch to uncompressed mode. CompressionType compression; // If non-NULL, use the specified filter policy to reduce disk reads. // Many applications will benefit from passing the result of // NewBloomFilterPolicy() here. // // Default: NULL const FilterPolicy* filter_policy; // Create an Options object with default values for all fields. Options(); }; // Options that control read operations struct ReadOptions { // If true, all data read from underlying storage will be // verified against corresponding checksums. // Default: false bool verify_checksums; // Should the data read for this iteration be cached in memory? // Callers may wish to set this field to false for bulk scans. // Default: true bool fill_cache; // If "snapshot" is non-NULL, read as of the supplied snapshot // (which must belong to the DB that is being read and which must // not have been released). If "snapshot" is NULL, use an impliicit // snapshot of the state at the beginning of this read operation. // Default: NULL const Snapshot* snapshot; ReadOptions() : verify_checksums(false), fill_cache(true), snapshot(NULL) { } }; // Options that control write operations struct WriteOptions { // If true, the write will be flushed from the operating system // buffer cache (by calling WritableFile::Sync()) before the write // is considered complete. If this flag is true, writes will be // slower. // // If this flag is false, and the machine crashes, some recent // writes may be lost. Note that if it is just the process that // crashes (i.e., the machine does not reboot), no writes will be // lost even if sync==false. // // In other words, a DB write with sync==false has similar // crash semantics as the "write()" system call. A DB write // with sync==true has similar crash semantics to a "write()" // system call followed by "fsync()". // // Default: false bool sync; WriteOptions() : sync(false) { } }; } // namespace leveldb #endif // STORAGE_LEVELDB_INCLUDE_OPTIONS_H_ armory-0.92.3/cppForSwig/leveldb/include/leveldb/cache.h0000644000000000000000000000671612414772654021616 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // A Cache is an interface that maps keys to values. It has internal // synchronization and may be safely accessed concurrently from // multiple threads. It may automatically evict entries to make room // for new entries. Values have a specified charge against the cache // capacity. For example, a cache where the values are variable // length strings, may use the length of the string as the charge for // the string. // // A builtin cache implementation with a least-recently-used eviction // policy is provided. Clients may use their own implementations if // they want something more sophisticated (like scan-resistance, a // custom eviction policy, variable cache sizing, etc.) #ifndef STORAGE_LEVELDB_INCLUDE_CACHE_H_ #define STORAGE_LEVELDB_INCLUDE_CACHE_H_ #include #include "leveldb/slice.h" namespace leveldb { class Cache; // Create a new cache with a fixed size capacity. This implementation // of Cache uses a least-recently-used eviction policy. extern Cache* NewLRUCache(size_t capacity); class Cache { public: Cache() { } // Destroys all existing entries by calling the "deleter" // function that was passed to the constructor. virtual ~Cache(); // Opaque handle to an entry stored in the cache. struct Handle { }; // Insert a mapping from key->value into the cache and assign it // the specified charge against the total cache capacity. // // Returns a handle that corresponds to the mapping. The caller // must call this->Release(handle) when the returned mapping is no // longer needed. // // When the inserted entry is no longer needed, the key and // value will be passed to "deleter". virtual Handle* Insert(const Slice& key, void* value, size_t charge, void (*deleter)(const Slice& key, void* value)) = 0; // If the cache has no mapping for "key", returns NULL. // // Else return a handle that corresponds to the mapping. The caller // must call this->Release(handle) when the returned mapping is no // longer needed. virtual Handle* Lookup(const Slice& key) = 0; // Release a mapping returned by a previous Lookup(). // REQUIRES: handle must not have been released yet. // REQUIRES: handle must have been returned by a method on *this. virtual void Release(Handle* handle) = 0; // Return the value encapsulated in a handle returned by a // successful Lookup(). // REQUIRES: handle must not have been released yet. // REQUIRES: handle must have been returned by a method on *this. virtual void* Value(Handle* handle) = 0; // If the cache contains entry for key, erase it. Note that the // underlying entry will be kept around until all existing handles // to it have been released. virtual void Erase(const Slice& key) = 0; // Return a new numeric id. May be used by multiple clients who are // sharing the same cache to partition the key space. Typically the // client will allocate a new id at startup and prepend the id to // its cache keys. virtual uint64_t NewId() = 0; private: void LRU_Remove(Handle* e); void LRU_Append(Handle* e); void Unref(Handle* e); struct Rep; Rep* rep_; // No copying allowed Cache(const Cache&); void operator=(const Cache&); }; } // namespace leveldb #endif // STORAGE_LEVELDB_UTIL_CACHE_H_ armory-0.92.3/cppForSwig/leveldb/LICENSE0000644000000000000000000000271412414772654016341 0ustar rootrootCopyright (c) 2011 The LevelDB Authors. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. armory-0.92.3/cppForSwig/leveldb/AUTHORS0000644000000000000000000000044512414772654016403 0ustar rootroot# Names should be added to this file like so: # Name or Organization Google Inc. # Initial version authors: Jeffrey Dean Sanjay Ghemawat # Partial list of contributors: Kevin Regan Johan Bilien armory-0.92.3/cppForSwig/leveldb/TODO0000644000000000000000000000102712414772654016020 0ustar rootrootss - Stats db - Maybe implement DB::BulkDeleteForRange(start_key, end_key) that would blow away files whose ranges are entirely contained within [start_key..end_key]? For Chrome, deletion of obsolete object stores, etc. can be done in the background anyway, so probably not that important. - There have been requests for MultiGet. After a range is completely deleted, what gets rid of the corresponding files if we do no future changes to that range. Make the conditions for triggering compactions fire in more situations? armory-0.92.3/cppForSwig/leveldb/helpers/0000755000000000000000000000000012414772654016772 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb/helpers/memenv/0000755000000000000000000000000012414772654020261 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb/helpers/memenv/memenv.cc0000644000000000000000000002226212414772654022063 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "helpers/memenv/memenv.h" #include "leveldb/env.h" #include "leveldb/status.h" #include "port/port.h" #include "util/mutexlock.h" #include #include #include #include namespace leveldb { namespace { class FileState { public: // FileStates are reference counted. The initial reference count is zero // and the caller must call Ref() at least once. FileState() : refs_(0), size_(0) {} // Increase the reference count. void Ref() { MutexLock lock(&refs_mutex_); ++refs_; } // Decrease the reference count. Delete if this is the last reference. void Unref() { bool do_delete = false; { MutexLock lock(&refs_mutex_); --refs_; assert(refs_ >= 0); if (refs_ <= 0) { do_delete = true; } } if (do_delete) { delete this; } } uint64_t Size() const { return size_; } Status Read(uint64_t offset, size_t n, Slice* result, char* scratch) const { if (offset > size_) { return Status::IOError("Offset greater than file size."); } const uint64_t available = size_ - offset; if (n > available) { n = available; } if (n == 0) { *result = Slice(); return Status::OK(); } size_t block = offset / kBlockSize; size_t block_offset = offset % kBlockSize; if (n <= kBlockSize - block_offset) { // The requested bytes are all in the first block. *result = Slice(blocks_[block] + block_offset, n); return Status::OK(); } size_t bytes_to_copy = n; char* dst = scratch; while (bytes_to_copy > 0) { size_t avail = kBlockSize - block_offset; if (avail > bytes_to_copy) { avail = bytes_to_copy; } memcpy(dst, blocks_[block] + block_offset, avail); bytes_to_copy -= avail; dst += avail; block++; block_offset = 0; } *result = Slice(scratch, n); return Status::OK(); } Status Append(const Slice& data) { const char* src = data.data(); size_t src_len = data.size(); while (src_len > 0) { size_t avail; size_t offset = size_ % kBlockSize; if (offset != 0) { // There is some room in the last block. avail = kBlockSize - offset; } else { // No room in the last block; push new one. blocks_.push_back(new char[kBlockSize]); avail = kBlockSize; } if (avail > src_len) { avail = src_len; } memcpy(blocks_.back() + offset, src, avail); src_len -= avail; src += avail; size_ += avail; } return Status::OK(); } private: // Private since only Unref() should be used to delete it. ~FileState() { for (std::vector::iterator i = blocks_.begin(); i != blocks_.end(); ++i) { delete [] *i; } } // No copying allowed. FileState(const FileState&); void operator=(const FileState&); port::Mutex refs_mutex_; int refs_; // Protected by refs_mutex_; // The following fields are not protected by any mutex. They are only mutable // while the file is being written, and concurrent access is not allowed // to writable files. std::vector blocks_; uint64_t size_; enum { kBlockSize = 8 * 1024 }; }; class SequentialFileImpl : public SequentialFile { public: explicit SequentialFileImpl(FileState* file) : file_(file), pos_(0) { file_->Ref(); } ~SequentialFileImpl() { file_->Unref(); } virtual Status Read(size_t n, Slice* result, char* scratch) { Status s = file_->Read(pos_, n, result, scratch); if (s.ok()) { pos_ += result->size(); } return s; } virtual Status Skip(uint64_t n) { if (pos_ > file_->Size()) { return Status::IOError("pos_ > file_->Size()"); } const size_t available = file_->Size() - pos_; if (n > available) { n = available; } pos_ += n; return Status::OK(); } private: FileState* file_; size_t pos_; }; class RandomAccessFileImpl : public RandomAccessFile { public: explicit RandomAccessFileImpl(FileState* file) : file_(file) { file_->Ref(); } ~RandomAccessFileImpl() { file_->Unref(); } virtual Status Read(uint64_t offset, size_t n, Slice* result, char* scratch) const { return file_->Read(offset, n, result, scratch); } private: FileState* file_; }; class WritableFileImpl : public WritableFile { public: WritableFileImpl(FileState* file) : file_(file) { file_->Ref(); } ~WritableFileImpl() { file_->Unref(); } virtual Status Append(const Slice& data) { return file_->Append(data); } virtual Status Close() { return Status::OK(); } virtual Status Flush() { return Status::OK(); } virtual Status Sync() { return Status::OK(); } private: FileState* file_; }; class NoOpLogger : public Logger { public: virtual void Logv(const char* format, va_list ap) { } }; class InMemoryEnv : public EnvWrapper { public: explicit InMemoryEnv(Env* base_env) : EnvWrapper(base_env) { } virtual ~InMemoryEnv() { for (FileSystem::iterator i = file_map_.begin(); i != file_map_.end(); ++i){ i->second->Unref(); } } // Partial implementation of the Env interface. virtual Status NewSequentialFile(const std::string& fname, SequentialFile** result) { MutexLock lock(&mutex_); if (file_map_.find(fname) == file_map_.end()) { *result = NULL; return Status::IOError(fname, "File not found"); } *result = new SequentialFileImpl(file_map_[fname]); return Status::OK(); } virtual Status NewRandomAccessFile(const std::string& fname, RandomAccessFile** result) { MutexLock lock(&mutex_); if (file_map_.find(fname) == file_map_.end()) { *result = NULL; return Status::IOError(fname, "File not found"); } *result = new RandomAccessFileImpl(file_map_[fname]); return Status::OK(); } virtual Status NewWritableFile(const std::string& fname, WritableFile** result) { MutexLock lock(&mutex_); if (file_map_.find(fname) != file_map_.end()) { DeleteFileInternal(fname); } FileState* file = new FileState(); file->Ref(); file_map_[fname] = file; *result = new WritableFileImpl(file); return Status::OK(); } virtual bool FileExists(const std::string& fname) { MutexLock lock(&mutex_); return file_map_.find(fname) != file_map_.end(); } virtual Status GetChildren(const std::string& dir, std::vector* result) { MutexLock lock(&mutex_); result->clear(); for (FileSystem::iterator i = file_map_.begin(); i != file_map_.end(); ++i){ const std::string& filename = i->first; if (filename.size() >= dir.size() + 1 && filename[dir.size()] == '/' && Slice(filename).starts_with(Slice(dir))) { result->push_back(filename.substr(dir.size() + 1)); } } return Status::OK(); } void DeleteFileInternal(const std::string& fname) { if (file_map_.find(fname) == file_map_.end()) { return; } file_map_[fname]->Unref(); file_map_.erase(fname); } virtual Status DeleteFile(const std::string& fname) { MutexLock lock(&mutex_); if (file_map_.find(fname) == file_map_.end()) { return Status::IOError(fname, "File not found"); } DeleteFileInternal(fname); return Status::OK(); } virtual Status CreateDir(const std::string& dirname) { return Status::OK(); } virtual Status DeleteDir(const std::string& dirname) { return Status::OK(); } virtual Status GetFileSize(const std::string& fname, uint64_t* file_size) { MutexLock lock(&mutex_); if (file_map_.find(fname) == file_map_.end()) { return Status::IOError(fname, "File not found"); } *file_size = file_map_[fname]->Size(); return Status::OK(); } virtual Status RenameFile(const std::string& src, const std::string& target) { MutexLock lock(&mutex_); if (file_map_.find(src) == file_map_.end()) { return Status::IOError(src, "File not found"); } DeleteFileInternal(target); file_map_[target] = file_map_[src]; file_map_.erase(src); return Status::OK(); } virtual Status LockFile(const std::string& fname, FileLock** lock) { *lock = new FileLock; return Status::OK(); } virtual Status UnlockFile(FileLock* lock) { delete lock; return Status::OK(); } virtual Status GetTestDirectory(std::string* path) { *path = "/test"; return Status::OK(); } virtual Status NewLogger(const std::string& fname, Logger** result) { *result = new NoOpLogger; return Status::OK(); } private: // Map from filenames to FileState objects, representing a simple file system. typedef std::map FileSystem; port::Mutex mutex_; FileSystem file_map_; // Protected by mutex_. }; } // namespace Env* NewMemEnv(Env* base_env) { return new InMemoryEnv(base_env); } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/helpers/memenv/memenv.h0000644000000000000000000000127312414772654021724 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_HELPERS_MEMENV_MEMENV_H_ #define STORAGE_LEVELDB_HELPERS_MEMENV_MEMENV_H_ namespace leveldb { class Env; // Returns a new environment that stores its data in memory and delegates // all non-file-storage tasks to base_env. The caller must delete the result // when it is no longer needed. // *base_env must remain live while the result is in use. Env* NewMemEnv(Env* base_env); } // namespace leveldb #endif // STORAGE_LEVELDB_HELPERS_MEMENV_MEMENV_H_ armory-0.92.3/cppForSwig/leveldb/helpers/memenv/memenv_test.cc0000644000000000000000000001532412414772654023123 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "helpers/memenv/memenv.h" #include "db/db_impl.h" #include "leveldb/db.h" #include "leveldb/env.h" #include "util/testharness.h" #include #include namespace leveldb { class MemEnvTest { public: Env* env_; MemEnvTest() : env_(NewMemEnv(Env::Default())) { } ~MemEnvTest() { delete env_; } }; TEST(MemEnvTest, Basics) { uint64_t file_size; WritableFile* writable_file; std::vector children; ASSERT_OK(env_->CreateDir("/dir")); // Check that the directory is empty. ASSERT_TRUE(!env_->FileExists("/dir/non_existent")); ASSERT_TRUE(!env_->GetFileSize("/dir/non_existent", &file_size).ok()); ASSERT_OK(env_->GetChildren("/dir", &children)); ASSERT_EQ(0, children.size()); // Create a file. ASSERT_OK(env_->NewWritableFile("/dir/f", &writable_file)); delete writable_file; // Check that the file exists. ASSERT_TRUE(env_->FileExists("/dir/f")); ASSERT_OK(env_->GetFileSize("/dir/f", &file_size)); ASSERT_EQ(0, file_size); ASSERT_OK(env_->GetChildren("/dir", &children)); ASSERT_EQ(1, children.size()); ASSERT_EQ("f", children[0]); // Write to the file. ASSERT_OK(env_->NewWritableFile("/dir/f", &writable_file)); ASSERT_OK(writable_file->Append("abc")); delete writable_file; // Check for expected size. ASSERT_OK(env_->GetFileSize("/dir/f", &file_size)); ASSERT_EQ(3, file_size); // Check that renaming works. ASSERT_TRUE(!env_->RenameFile("/dir/non_existent", "/dir/g").ok()); ASSERT_OK(env_->RenameFile("/dir/f", "/dir/g")); ASSERT_TRUE(!env_->FileExists("/dir/f")); ASSERT_TRUE(env_->FileExists("/dir/g")); ASSERT_OK(env_->GetFileSize("/dir/g", &file_size)); ASSERT_EQ(3, file_size); // Check that opening non-existent file fails. SequentialFile* seq_file; RandomAccessFile* rand_file; ASSERT_TRUE(!env_->NewSequentialFile("/dir/non_existent", &seq_file).ok()); ASSERT_TRUE(!seq_file); ASSERT_TRUE(!env_->NewRandomAccessFile("/dir/non_existent", &rand_file).ok()); ASSERT_TRUE(!rand_file); // Check that deleting works. ASSERT_TRUE(!env_->DeleteFile("/dir/non_existent").ok()); ASSERT_OK(env_->DeleteFile("/dir/g")); ASSERT_TRUE(!env_->FileExists("/dir/g")); ASSERT_OK(env_->GetChildren("/dir", &children)); ASSERT_EQ(0, children.size()); ASSERT_OK(env_->DeleteDir("/dir")); } TEST(MemEnvTest, ReadWrite) { WritableFile* writable_file; SequentialFile* seq_file; RandomAccessFile* rand_file; Slice result; char scratch[100]; ASSERT_OK(env_->CreateDir("/dir")); ASSERT_OK(env_->NewWritableFile("/dir/f", &writable_file)); ASSERT_OK(writable_file->Append("hello ")); ASSERT_OK(writable_file->Append("world")); delete writable_file; // Read sequentially. ASSERT_OK(env_->NewSequentialFile("/dir/f", &seq_file)); ASSERT_OK(seq_file->Read(5, &result, scratch)); // Read "hello". ASSERT_EQ(0, result.compare("hello")); ASSERT_OK(seq_file->Skip(1)); ASSERT_OK(seq_file->Read(1000, &result, scratch)); // Read "world". ASSERT_EQ(0, result.compare("world")); ASSERT_OK(seq_file->Read(1000, &result, scratch)); // Try reading past EOF. ASSERT_EQ(0, result.size()); ASSERT_OK(seq_file->Skip(100)); // Try to skip past end of file. ASSERT_OK(seq_file->Read(1000, &result, scratch)); ASSERT_EQ(0, result.size()); delete seq_file; // Random reads. ASSERT_OK(env_->NewRandomAccessFile("/dir/f", &rand_file)); ASSERT_OK(rand_file->Read(6, 5, &result, scratch)); // Read "world". ASSERT_EQ(0, result.compare("world")); ASSERT_OK(rand_file->Read(0, 5, &result, scratch)); // Read "hello". ASSERT_EQ(0, result.compare("hello")); ASSERT_OK(rand_file->Read(10, 100, &result, scratch)); // Read "d". ASSERT_EQ(0, result.compare("d")); // Too high offset. ASSERT_TRUE(!rand_file->Read(1000, 5, &result, scratch).ok()); delete rand_file; } TEST(MemEnvTest, Locks) { FileLock* lock; // These are no-ops, but we test they return success. ASSERT_OK(env_->LockFile("some file", &lock)); ASSERT_OK(env_->UnlockFile(lock)); } TEST(MemEnvTest, Misc) { std::string test_dir; ASSERT_OK(env_->GetTestDirectory(&test_dir)); ASSERT_TRUE(!test_dir.empty()); WritableFile* writable_file; ASSERT_OK(env_->NewWritableFile("/a/b", &writable_file)); // These are no-ops, but we test they return success. ASSERT_OK(writable_file->Sync()); ASSERT_OK(writable_file->Flush()); ASSERT_OK(writable_file->Close()); delete writable_file; } TEST(MemEnvTest, LargeWrite) { const size_t kWriteSize = 300 * 1024; char* scratch = new char[kWriteSize * 2]; std::string write_data; for (size_t i = 0; i < kWriteSize; ++i) { write_data.append(1, static_cast(i)); } WritableFile* writable_file; ASSERT_OK(env_->NewWritableFile("/dir/f", &writable_file)); ASSERT_OK(writable_file->Append("foo")); ASSERT_OK(writable_file->Append(write_data)); delete writable_file; SequentialFile* seq_file; Slice result; ASSERT_OK(env_->NewSequentialFile("/dir/f", &seq_file)); ASSERT_OK(seq_file->Read(3, &result, scratch)); // Read "foo". ASSERT_EQ(0, result.compare("foo")); size_t read = 0; std::string read_data; while (read < kWriteSize) { ASSERT_OK(seq_file->Read(kWriteSize - read, &result, scratch)); read_data.append(result.data(), result.size()); read += result.size(); } ASSERT_TRUE(write_data == read_data); delete seq_file; delete [] scratch; } TEST(MemEnvTest, DBTest) { Options options; options.create_if_missing = true; options.env = env_; DB* db; const Slice keys[] = {Slice("aaa"), Slice("bbb"), Slice("ccc")}; const Slice vals[] = {Slice("foo"), Slice("bar"), Slice("baz")}; ASSERT_OK(DB::Open(options, "/dir/db", &db)); for (size_t i = 0; i < 3; ++i) { ASSERT_OK(db->Put(WriteOptions(), keys[i], vals[i])); } for (size_t i = 0; i < 3; ++i) { std::string res; ASSERT_OK(db->Get(ReadOptions(), keys[i], &res)); ASSERT_TRUE(res == vals[i]); } Iterator* iterator = db->NewIterator(ReadOptions()); iterator->SeekToFirst(); for (size_t i = 0; i < 3; ++i) { ASSERT_TRUE(iterator->Valid()); ASSERT_TRUE(keys[i] == iterator->key()); ASSERT_TRUE(vals[i] == iterator->value()); iterator->Next(); } ASSERT_TRUE(!iterator->Valid()); delete iterator; DBImpl* dbi = reinterpret_cast(db); ASSERT_OK(dbi->TEST_CompactMemTable()); for (size_t i = 0; i < 3; ++i) { std::string res; ASSERT_OK(db->Get(ReadOptions(), keys[i], &res)); ASSERT_TRUE(res == vals[i]); } delete db; } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/util/0000755000000000000000000000000012414772654016305 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb/util/hash.cc0000644000000000000000000000241512414772654017541 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include #include "util/coding.h" #include "util/hash.h" // The FALLTHROUGH_INTENDED macro can be used to annotate implicit fall-through // between switch labels. The real definition should be provided externally. // This one is a fallback version for unsupported compilers. #ifndef FALLTHROUGH_INTENDED #define FALLTHROUGH_INTENDED do { } while (0) #endif namespace leveldb { uint32_t Hash(const char* data, size_t n, uint32_t seed) { // Similar to murmur hash const uint32_t m = 0xc6a4a793; const uint32_t r = 24; const char* limit = data + n; uint32_t h = seed ^ (n * m); // Pick up four bytes at a time while (data + 4 <= limit) { uint32_t w = DecodeFixed32(data); data += 4; h += w; h *= m; h ^= (h >> 16); } // Pick up remaining bytes switch (limit - data) { case 3: h += data[2] << 16; FALLTHROUGH_INTENDED; case 2: h += data[1] << 8; FALLTHROUGH_INTENDED; case 1: h += data[0]; h *= m; h ^= (h >> r); break; } return h; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/coding.cc0000644000000000000000000001147712414772654020071 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "util/coding.h" namespace leveldb { void EncodeFixed32(char* buf, uint32_t value) { if (port::kLittleEndian) { memcpy(buf, &value, sizeof(value)); } else { buf[0] = value & 0xff; buf[1] = (value >> 8) & 0xff; buf[2] = (value >> 16) & 0xff; buf[3] = (value >> 24) & 0xff; } } void EncodeFixed64(char* buf, uint64_t value) { if (port::kLittleEndian) { memcpy(buf, &value, sizeof(value)); } else { buf[0] = value & 0xff; buf[1] = (value >> 8) & 0xff; buf[2] = (value >> 16) & 0xff; buf[3] = (value >> 24) & 0xff; buf[4] = (value >> 32) & 0xff; buf[5] = (value >> 40) & 0xff; buf[6] = (value >> 48) & 0xff; buf[7] = (value >> 56) & 0xff; } } void PutFixed32(std::string* dst, uint32_t value) { char buf[sizeof(value)]; EncodeFixed32(buf, value); dst->append(buf, sizeof(buf)); } void PutFixed64(std::string* dst, uint64_t value) { char buf[sizeof(value)]; EncodeFixed64(buf, value); dst->append(buf, sizeof(buf)); } char* EncodeVarint32(char* dst, uint32_t v) { // Operate on characters as unsigneds unsigned char* ptr = reinterpret_cast(dst); static const int B = 128; if (v < (1<<7)) { *(ptr++) = v; } else if (v < (1<<14)) { *(ptr++) = v | B; *(ptr++) = v>>7; } else if (v < (1<<21)) { *(ptr++) = v | B; *(ptr++) = (v>>7) | B; *(ptr++) = v>>14; } else if (v < (1<<28)) { *(ptr++) = v | B; *(ptr++) = (v>>7) | B; *(ptr++) = (v>>14) | B; *(ptr++) = v>>21; } else { *(ptr++) = v | B; *(ptr++) = (v>>7) | B; *(ptr++) = (v>>14) | B; *(ptr++) = (v>>21) | B; *(ptr++) = v>>28; } return reinterpret_cast(ptr); } void PutVarint32(std::string* dst, uint32_t v) { char buf[5]; char* ptr = EncodeVarint32(buf, v); dst->append(buf, ptr - buf); } char* EncodeVarint64(char* dst, uint64_t v) { static const int B = 128; unsigned char* ptr = reinterpret_cast(dst); while (v >= B) { *(ptr++) = (v & (B-1)) | B; v >>= 7; } *(ptr++) = static_cast(v); return reinterpret_cast(ptr); } void PutVarint64(std::string* dst, uint64_t v) { char buf[10]; char* ptr = EncodeVarint64(buf, v); dst->append(buf, ptr - buf); } void PutLengthPrefixedSlice(std::string* dst, const Slice& value) { PutVarint32(dst, value.size()); dst->append(value.data(), value.size()); } int VarintLength(uint64_t v) { int len = 1; while (v >= 128) { v >>= 7; len++; } return len; } const char* GetVarint32PtrFallback(const char* p, const char* limit, uint32_t* value) { uint32_t result = 0; for (uint32_t shift = 0; shift <= 28 && p < limit; shift += 7) { uint32_t byte = *(reinterpret_cast(p)); p++; if (byte & 128) { // More bytes are present result |= ((byte & 127) << shift); } else { result |= (byte << shift); *value = result; return reinterpret_cast(p); } } return NULL; } bool GetVarint32(Slice* input, uint32_t* value) { const char* p = input->data(); const char* limit = p + input->size(); const char* q = GetVarint32Ptr(p, limit, value); if (q == NULL) { return false; } else { *input = Slice(q, limit - q); return true; } } const char* GetVarint64Ptr(const char* p, const char* limit, uint64_t* value) { uint64_t result = 0; for (uint32_t shift = 0; shift <= 63 && p < limit; shift += 7) { uint64_t byte = *(reinterpret_cast(p)); p++; if (byte & 128) { // More bytes are present result |= ((byte & 127) << shift); } else { result |= (byte << shift); *value = result; return reinterpret_cast(p); } } return NULL; } bool GetVarint64(Slice* input, uint64_t* value) { const char* p = input->data(); const char* limit = p + input->size(); const char* q = GetVarint64Ptr(p, limit, value); if (q == NULL) { return false; } else { *input = Slice(q, limit - q); return true; } } const char* GetLengthPrefixedSlice(const char* p, const char* limit, Slice* result) { uint32_t len; p = GetVarint32Ptr(p, limit, &len); if (p == NULL) return NULL; if (p + len > limit) return NULL; *result = Slice(p, len); return p + len; } bool GetLengthPrefixedSlice(Slice* input, Slice* result) { uint32_t len; if (GetVarint32(input, &len) && input->size() >= len) { *result = Slice(input->data(), len); input->remove_prefix(len); return true; } else { return false; } } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/status.cc0000644000000000000000000000361312414772654020142 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include #include "port/port.h" #include "leveldb/status.h" namespace leveldb { const char* Status::CopyState(const char* state) { uint32_t size; memcpy(&size, state, sizeof(size)); char* result = new char[size + 5]; memcpy(result, state, size + 5); return result; } Status::Status(Code code, const Slice& msg, const Slice& msg2) { assert(code != kOk); const uint32_t len1 = msg.size(); const uint32_t len2 = msg2.size(); const uint32_t size = len1 + (len2 ? (2 + len2) : 0); char* result = new char[size + 5]; memcpy(result, &size, sizeof(size)); result[4] = static_cast(code); memcpy(result + 5, msg.data(), len1); if (len2) { result[5 + len1] = ':'; result[6 + len1] = ' '; memcpy(result + 7 + len1, msg2.data(), len2); } state_ = result; } std::string Status::ToString() const { if (state_ == NULL) { return "OK"; } else { char tmp[30]; const char* type; switch (code()) { case kOk: type = "OK"; break; case kNotFound: type = "NotFound: "; break; case kCorruption: type = "Corruption: "; break; case kNotSupported: type = "Not implemented: "; break; case kInvalidArgument: type = "Invalid argument: "; break; case kIOError: type = "IO error: "; break; default: snprintf(tmp, sizeof(tmp), "Unknown code(%d): ", static_cast(code())); type = tmp; break; } std::string result(type); uint32_t length; memcpy(&length, state_, sizeof(length)); result.append(state_ + 5, length); return result; } } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/hash.h0000644000000000000000000000101412414772654017375 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // Simple hash function used for internal data structures #ifndef STORAGE_LEVELDB_UTIL_HASH_H_ #define STORAGE_LEVELDB_UTIL_HASH_H_ #include #include namespace leveldb { extern uint32_t Hash(const char* data, size_t n, uint32_t seed); } #endif // STORAGE_LEVELDB_UTIL_HASH_H_ armory-0.92.3/cppForSwig/leveldb/util/cache.cc0000644000000000000000000002073012414772654017661 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include #include #include #include "leveldb/cache.h" #include "port/port.h" #include "util/hash.h" #include "util/mutexlock.h" namespace leveldb { Cache::~Cache() { } namespace { // LRU cache implementation // An entry is a variable length heap-allocated structure. Entries // are kept in a circular doubly linked list ordered by access time. struct LRUHandle { void* value; void (*deleter)(const Slice&, void* value); LRUHandle* next_hash; LRUHandle* next; LRUHandle* prev; size_t charge; // TODO(opt): Only allow uint32_t? size_t key_length; uint32_t refs; uint32_t hash; // Hash of key(); used for fast sharding and comparisons char key_data[1]; // Beginning of key Slice key() const { // For cheaper lookups, we allow a temporary Handle object // to store a pointer to a key in "value". if (next == this) { return *(reinterpret_cast(value)); } else { return Slice(key_data, key_length); } } }; // We provide our own simple hash table since it removes a whole bunch // of porting hacks and is also faster than some of the built-in hash // table implementations in some of the compiler/runtime combinations // we have tested. E.g., readrandom speeds up by ~5% over the g++ // 4.4.3's builtin hashtable. class HandleTable { public: HandleTable() : length_(0), elems_(0), list_(NULL) { Resize(); } ~HandleTable() { delete[] list_; } LRUHandle* Lookup(const Slice& key, uint32_t hash) { return *FindPointer(key, hash); } LRUHandle* Insert(LRUHandle* h) { LRUHandle** ptr = FindPointer(h->key(), h->hash); LRUHandle* old = *ptr; h->next_hash = (old == NULL ? NULL : old->next_hash); *ptr = h; if (old == NULL) { ++elems_; if (elems_ > length_) { // Since each cache entry is fairly large, we aim for a small // average linked list length (<= 1). Resize(); } } return old; } LRUHandle* Remove(const Slice& key, uint32_t hash) { LRUHandle** ptr = FindPointer(key, hash); LRUHandle* result = *ptr; if (result != NULL) { *ptr = result->next_hash; --elems_; } return result; } private: // The table consists of an array of buckets where each bucket is // a linked list of cache entries that hash into the bucket. uint32_t length_; uint32_t elems_; LRUHandle** list_; // Return a pointer to slot that points to a cache entry that // matches key/hash. If there is no such cache entry, return a // pointer to the trailing slot in the corresponding linked list. LRUHandle** FindPointer(const Slice& key, uint32_t hash) { LRUHandle** ptr = &list_[hash & (length_ - 1)]; while (*ptr != NULL && ((*ptr)->hash != hash || key != (*ptr)->key())) { ptr = &(*ptr)->next_hash; } return ptr; } void Resize() { uint32_t new_length = 4; while (new_length < elems_) { new_length *= 2; } LRUHandle** new_list = new LRUHandle*[new_length]; memset(new_list, 0, sizeof(new_list[0]) * new_length); uint32_t count = 0; for (uint32_t i = 0; i < length_; i++) { LRUHandle* h = list_[i]; while (h != NULL) { LRUHandle* next = h->next_hash; uint32_t hash = h->hash; LRUHandle** ptr = &new_list[hash & (new_length - 1)]; h->next_hash = *ptr; *ptr = h; h = next; count++; } } assert(elems_ == count); delete[] list_; list_ = new_list; length_ = new_length; } }; // A single shard of sharded cache. class LRUCache { public: LRUCache(); ~LRUCache(); // Separate from constructor so caller can easily make an array of LRUCache void SetCapacity(size_t capacity) { capacity_ = capacity; } // Like Cache methods, but with an extra "hash" parameter. Cache::Handle* Insert(const Slice& key, uint32_t hash, void* value, size_t charge, void (*deleter)(const Slice& key, void* value)); Cache::Handle* Lookup(const Slice& key, uint32_t hash); void Release(Cache::Handle* handle); void Erase(const Slice& key, uint32_t hash); private: void LRU_Remove(LRUHandle* e); void LRU_Append(LRUHandle* e); void Unref(LRUHandle* e); // Initialized before use. size_t capacity_; // mutex_ protects the following state. port::Mutex mutex_; size_t usage_; // Dummy head of LRU list. // lru.prev is newest entry, lru.next is oldest entry. LRUHandle lru_; HandleTable table_; }; LRUCache::LRUCache() : usage_(0) { // Make empty circular linked list lru_.next = &lru_; lru_.prev = &lru_; } LRUCache::~LRUCache() { for (LRUHandle* e = lru_.next; e != &lru_; ) { LRUHandle* next = e->next; assert(e->refs == 1); // Error if caller has an unreleased handle Unref(e); e = next; } } void LRUCache::Unref(LRUHandle* e) { assert(e->refs > 0); e->refs--; if (e->refs <= 0) { usage_ -= e->charge; (*e->deleter)(e->key(), e->value); free(e); } } void LRUCache::LRU_Remove(LRUHandle* e) { e->next->prev = e->prev; e->prev->next = e->next; } void LRUCache::LRU_Append(LRUHandle* e) { // Make "e" newest entry by inserting just before lru_ e->next = &lru_; e->prev = lru_.prev; e->prev->next = e; e->next->prev = e; } Cache::Handle* LRUCache::Lookup(const Slice& key, uint32_t hash) { MutexLock l(&mutex_); LRUHandle* e = table_.Lookup(key, hash); if (e != NULL) { e->refs++; LRU_Remove(e); LRU_Append(e); } return reinterpret_cast(e); } void LRUCache::Release(Cache::Handle* handle) { MutexLock l(&mutex_); Unref(reinterpret_cast(handle)); } Cache::Handle* LRUCache::Insert( const Slice& key, uint32_t hash, void* value, size_t charge, void (*deleter)(const Slice& key, void* value)) { MutexLock l(&mutex_); LRUHandle* e = reinterpret_cast( malloc(sizeof(LRUHandle)-1 + key.size())); e->value = value; e->deleter = deleter; e->charge = charge; e->key_length = key.size(); e->hash = hash; e->refs = 2; // One from LRUCache, one for the returned handle memcpy(e->key_data, key.data(), key.size()); LRU_Append(e); usage_ += charge; LRUHandle* old = table_.Insert(e); if (old != NULL) { LRU_Remove(old); Unref(old); } while (usage_ > capacity_ && lru_.next != &lru_) { LRUHandle* old = lru_.next; LRU_Remove(old); table_.Remove(old->key(), old->hash); Unref(old); } return reinterpret_cast(e); } void LRUCache::Erase(const Slice& key, uint32_t hash) { MutexLock l(&mutex_); LRUHandle* e = table_.Remove(key, hash); if (e != NULL) { LRU_Remove(e); Unref(e); } } static const int kNumShardBits = 4; static const int kNumShards = 1 << kNumShardBits; class ShardedLRUCache : public Cache { private: LRUCache shard_[kNumShards]; port::Mutex id_mutex_; uint64_t last_id_; static inline uint32_t HashSlice(const Slice& s) { return Hash(s.data(), s.size(), 0); } static uint32_t Shard(uint32_t hash) { return hash >> (32 - kNumShardBits); } public: explicit ShardedLRUCache(size_t capacity) : last_id_(0) { const size_t per_shard = (capacity + (kNumShards - 1)) / kNumShards; for (int s = 0; s < kNumShards; s++) { shard_[s].SetCapacity(per_shard); } } virtual ~ShardedLRUCache() { } virtual Handle* Insert(const Slice& key, void* value, size_t charge, void (*deleter)(const Slice& key, void* value)) { const uint32_t hash = HashSlice(key); return shard_[Shard(hash)].Insert(key, hash, value, charge, deleter); } virtual Handle* Lookup(const Slice& key) { const uint32_t hash = HashSlice(key); return shard_[Shard(hash)].Lookup(key, hash); } virtual void Release(Handle* handle) { LRUHandle* h = reinterpret_cast(handle); shard_[Shard(h->hash)].Release(handle); } virtual void Erase(const Slice& key) { const uint32_t hash = HashSlice(key); shard_[Shard(hash)].Erase(key, hash); } virtual void* Value(Handle* handle) { return reinterpret_cast(handle)->value; } virtual uint64_t NewId() { MutexLock l(&id_mutex_); return ++(last_id_); } }; } // end anonymous namespace Cache* NewLRUCache(size_t capacity) { return new ShardedLRUCache(capacity); } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/histogram.cc0000644000000000000000000001117112414772654020612 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include #include #include "port/port.h" #include "util/histogram.h" namespace leveldb { const double Histogram::kBucketLimit[kNumBuckets] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 20, 25, 30, 35, 40, 45, 50, 60, 70, 80, 90, 100, 120, 140, 160, 180, 200, 250, 300, 350, 400, 450, 500, 600, 700, 800, 900, 1000, 1200, 1400, 1600, 1800, 2000, 2500, 3000, 3500, 4000, 4500, 5000, 6000, 7000, 8000, 9000, 10000, 12000, 14000, 16000, 18000, 20000, 25000, 30000, 35000, 40000, 45000, 50000, 60000, 70000, 80000, 90000, 100000, 120000, 140000, 160000, 180000, 200000, 250000, 300000, 350000, 400000, 450000, 500000, 600000, 700000, 800000, 900000, 1000000, 1200000, 1400000, 1600000, 1800000, 2000000, 2500000, 3000000, 3500000, 4000000, 4500000, 5000000, 6000000, 7000000, 8000000, 9000000, 10000000, 12000000, 14000000, 16000000, 18000000, 20000000, 25000000, 30000000, 35000000, 40000000, 45000000, 50000000, 60000000, 70000000, 80000000, 90000000, 100000000, 120000000, 140000000, 160000000, 180000000, 200000000, 250000000, 300000000, 350000000, 400000000, 450000000, 500000000, 600000000, 700000000, 800000000, 900000000, 1000000000, 1200000000, 1400000000, 1600000000, 1800000000, 2000000000, 2500000000.0, 3000000000.0, 3500000000.0, 4000000000.0, 4500000000.0, 5000000000.0, 6000000000.0, 7000000000.0, 8000000000.0, 9000000000.0, 1e200, }; void Histogram::Clear() { min_ = kBucketLimit[kNumBuckets-1]; max_ = 0; num_ = 0; sum_ = 0; sum_squares_ = 0; for (int i = 0; i < kNumBuckets; i++) { buckets_[i] = 0; } } void Histogram::Add(double value) { // Linear search is fast enough for our usage in db_bench int b = 0; while (b < kNumBuckets - 1 && kBucketLimit[b] <= value) { b++; } buckets_[b] += 1.0; if (min_ > value) min_ = value; if (max_ < value) max_ = value; num_++; sum_ += value; sum_squares_ += (value * value); } void Histogram::Merge(const Histogram& other) { if (other.min_ < min_) min_ = other.min_; if (other.max_ > max_) max_ = other.max_; num_ += other.num_; sum_ += other.sum_; sum_squares_ += other.sum_squares_; for (int b = 0; b < kNumBuckets; b++) { buckets_[b] += other.buckets_[b]; } } double Histogram::Median() const { return Percentile(50.0); } double Histogram::Percentile(double p) const { double threshold = num_ * (p / 100.0); double sum = 0; for (int b = 0; b < kNumBuckets; b++) { sum += buckets_[b]; if (sum >= threshold) { // Scale linearly within this bucket double left_point = (b == 0) ? 0 : kBucketLimit[b-1]; double right_point = kBucketLimit[b]; double left_sum = sum - buckets_[b]; double right_sum = sum; double pos = (threshold - left_sum) / (right_sum - left_sum); double r = left_point + (right_point - left_point) * pos; if (r < min_) r = min_; if (r > max_) r = max_; return r; } } return max_; } double Histogram::Average() const { if (num_ == 0.0) return 0; return sum_ / num_; } double Histogram::StandardDeviation() const { if (num_ == 0.0) return 0; double variance = (sum_squares_ * num_ - sum_ * sum_) / (num_ * num_); return sqrt(variance); } std::string Histogram::ToString() const { std::string r; char buf[200]; snprintf(buf, sizeof(buf), "Count: %.0f Average: %.4f StdDev: %.2f\n", num_, Average(), StandardDeviation()); r.append(buf); snprintf(buf, sizeof(buf), "Min: %.4f Median: %.4f Max: %.4f\n", (num_ == 0.0 ? 0.0 : min_), Median(), max_); r.append(buf); r.append("------------------------------------------------------\n"); const double mult = 100.0 / num_; double sum = 0; for (int b = 0; b < kNumBuckets; b++) { if (buckets_[b] <= 0.0) continue; sum += buckets_[b]; snprintf(buf, sizeof(buf), "[ %7.0f, %7.0f ) %7.0f %7.3f%% %7.3f%% ", ((b == 0) ? 0.0 : kBucketLimit[b-1]), // left kBucketLimit[b], // right buckets_[b], // count mult * buckets_[b], // percentage mult * sum); // cumulative percentage r.append(buf); // Add hash marks based on percentage; 20 marks for 100%. int marks = static_cast(20*(buckets_[b] / num_) + 0.5); r.append(marks, '#'); r.push_back('\n'); } return r; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/crc32c_test.cc0000644000000000000000000000332412414772654020734 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "util/crc32c.h" #include "util/testharness.h" namespace leveldb { namespace crc32c { class CRC { }; TEST(CRC, StandardResults) { // From rfc3720 section B.4. char buf[32]; memset(buf, 0, sizeof(buf)); ASSERT_EQ(0x8a9136aa, Value(buf, sizeof(buf))); memset(buf, 0xff, sizeof(buf)); ASSERT_EQ(0x62a8ab43, Value(buf, sizeof(buf))); for (int i = 0; i < 32; i++) { buf[i] = i; } ASSERT_EQ(0x46dd794e, Value(buf, sizeof(buf))); for (int i = 0; i < 32; i++) { buf[i] = 31 - i; } ASSERT_EQ(0x113fdb5c, Value(buf, sizeof(buf))); unsigned char data[48] = { 0x01, 0xc0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x18, 0x28, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }; ASSERT_EQ(0xd9963a56, Value(reinterpret_cast(data), sizeof(data))); } TEST(CRC, Values) { ASSERT_NE(Value("a", 1), Value("foo", 3)); } TEST(CRC, Extend) { ASSERT_EQ(Value("hello world", 11), Extend(Value("hello ", 6), "world", 5)); } TEST(CRC, Mask) { uint32_t crc = Value("foo", 3); ASSERT_NE(crc, Mask(crc)); ASSERT_NE(crc, Mask(Mask(crc))); ASSERT_EQ(crc, Unmask(Mask(crc))); ASSERT_EQ(crc, Unmask(Unmask(Mask(Mask(crc))))); } } // namespace crc32c } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/util/options.cc0000644000000000000000000000137412414772654020314 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/options.h" #include "leveldb/comparator.h" #include "leveldb/env.h" namespace leveldb { Options::Options() : comparator(BytewiseComparator()), create_if_missing(false), error_if_exists(false), paranoid_checks(false), env(Env::Default()), info_log(NULL), write_buffer_size(4<<20), max_open_files(1000), block_cache(NULL), block_size(4096), block_restart_interval(16), compression(kSnappyCompression), filter_policy(NULL) { } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/env.cc0000644000000000000000000000410212414772654017401 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/env.h" namespace leveldb { Env::~Env() { } SequentialFile::~SequentialFile() { } RandomAccessFile::~RandomAccessFile() { } WritableFile::~WritableFile() { } Logger::~Logger() { } FileLock::~FileLock() { } void Log(Logger* info_log, const char* format, ...) { if (info_log != NULL) { va_list ap; va_start(ap, format); info_log->Logv(format, ap); va_end(ap); } } static Status DoWriteStringToFile(Env* env, const Slice& data, const std::string& fname, bool should_sync) { WritableFile* file; Status s = env->NewWritableFile(fname, &file); if (!s.ok()) { return s; } s = file->Append(data); if (s.ok() && should_sync) { s = file->Sync(); } if (s.ok()) { s = file->Close(); } delete file; // Will auto-close if we did not close above if (!s.ok()) { env->DeleteFile(fname); } return s; } Status WriteStringToFile(Env* env, const Slice& data, const std::string& fname) { return DoWriteStringToFile(env, data, fname, false); } Status WriteStringToFileSync(Env* env, const Slice& data, const std::string& fname) { return DoWriteStringToFile(env, data, fname, true); } Status ReadFileToString(Env* env, const std::string& fname, std::string* data) { data->clear(); SequentialFile* file; Status s = env->NewSequentialFile(fname, &file); if (!s.ok()) { return s; } static const int kBufferSize = 8192; char* space = new char[kBufferSize]; while (true) { Slice fragment; s = file->Read(kBufferSize, &fragment, space); if (!s.ok()) { break; } data->append(fragment.data(), fragment.size()); if (fragment.empty()) { break; } } delete[] space; delete file; return s; } EnvWrapper::~EnvWrapper() { } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/testharness.h0000644000000000000000000001114312414772654021021 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_UTIL_TESTHARNESS_H_ #define STORAGE_LEVELDB_UTIL_TESTHARNESS_H_ #include #include #include #include "leveldb/env.h" #include "leveldb/slice.h" #include "util/random.h" namespace leveldb { namespace test { // Run some of the tests registered by the TEST() macro. If the // environment variable "LEVELDB_TESTS" is not set, runs all tests. // Otherwise, runs only the tests whose name contains the value of // "LEVELDB_TESTS" as a substring. E.g., suppose the tests are: // TEST(Foo, Hello) { ... } // TEST(Foo, World) { ... } // LEVELDB_TESTS=Hello will run the first test // LEVELDB_TESTS=o will run both tests // LEVELDB_TESTS=Junk will run no tests // // Returns 0 if all tests pass. // Dies or returns a non-zero value if some test fails. extern int RunAllTests(); // Return the directory to use for temporary storage. extern std::string TmpDir(); // Return a randomization seed for this run. Typically returns the // same number on repeated invocations of this binary, but automated // runs may be able to vary the seed. extern int RandomSeed(); // An instance of Tester is allocated to hold temporary state during // the execution of an assertion. class Tester { private: bool ok_; const char* fname_; int line_; std::stringstream ss_; public: Tester(const char* f, int l) : ok_(true), fname_(f), line_(l) { } ~Tester() { if (!ok_) { fprintf(stderr, "%s:%d:%s\n", fname_, line_, ss_.str().c_str()); exit(1); } } Tester& Is(bool b, const char* msg) { if (!b) { ss_ << " Assertion failure " << msg; ok_ = false; } return *this; } Tester& IsOk(const Status& s) { if (!s.ok()) { ss_ << " " << s.ToString(); ok_ = false; } return *this; } #define BINARY_OP(name,op) \ template \ Tester& name(const X& x, const Y& y) { \ if (! (x op y)) { \ ss_ << " failed: " << x << (" " #op " ") << y; \ ok_ = false; \ } \ return *this; \ } BINARY_OP(IsEq, ==) BINARY_OP(IsNe, !=) BINARY_OP(IsGe, >=) BINARY_OP(IsGt, >) BINARY_OP(IsLe, <=) BINARY_OP(IsLt, <) #undef BINARY_OP // Attach the specified value to the error message if an error has occurred template Tester& operator<<(const V& value) { if (!ok_) { ss_ << " " << value; } return *this; } }; #define ASSERT_TRUE(c) ::leveldb::test::Tester(__FILE__, __LINE__).Is((c), #c) #define ASSERT_OK(s) ::leveldb::test::Tester(__FILE__, __LINE__).IsOk((s)) #define ASSERT_EQ(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsEq((a),(b)) #define ASSERT_NE(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsNe((a),(b)) #define ASSERT_GE(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsGe((a),(b)) #define ASSERT_GT(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsGt((a),(b)) #define ASSERT_LE(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsLe((a),(b)) #define ASSERT_LT(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsLt((a),(b)) #define TCONCAT(a,b) TCONCAT1(a,b) #define TCONCAT1(a,b) a##b #define TEST(base,name) \ class TCONCAT(_Test_,name) : public base { \ public: \ void _Run(); \ static void _RunIt() { \ TCONCAT(_Test_,name) t; \ t._Run(); \ } \ }; \ bool TCONCAT(_Test_ignored_,name) = \ ::leveldb::test::RegisterTest(#base, #name, &TCONCAT(_Test_,name)::_RunIt); \ void TCONCAT(_Test_,name)::_Run() // Register the specified test. Typically not used directly, but // invoked via the macro expansion of TEST. extern bool RegisterTest(const char* base, const char* name, void (*func)()); } // namespace test } // namespace leveldb #endif // STORAGE_LEVELDB_UTIL_TESTHARNESS_H_ armory-0.92.3/cppForSwig/leveldb/util/arena.h0000644000000000000000000000343212414772654017546 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_UTIL_ARENA_H_ #define STORAGE_LEVELDB_UTIL_ARENA_H_ #include #include #include #include namespace leveldb { class Arena { public: Arena(); ~Arena(); // Return a pointer to a newly allocated memory block of "bytes" bytes. char* Allocate(size_t bytes); // Allocate memory with the normal alignment guarantees provided by malloc char* AllocateAligned(size_t bytes); // Returns an estimate of the total memory usage of data allocated // by the arena (including space allocated but not yet used for user // allocations). size_t MemoryUsage() const { return blocks_memory_ + blocks_.capacity() * sizeof(char*); } private: char* AllocateFallback(size_t bytes); char* AllocateNewBlock(size_t block_bytes); // Allocation state char* alloc_ptr_; size_t alloc_bytes_remaining_; // Array of new[] allocated memory blocks std::vector blocks_; // Bytes of memory in blocks allocated so far size_t blocks_memory_; // No copying allowed Arena(const Arena&); void operator=(const Arena&); }; inline char* Arena::Allocate(size_t bytes) { // The semantics of what to return are a bit messy if we allow // 0-byte allocations, so we disallow them here (we don't need // them for our internal use). assert(bytes > 0); if (bytes <= alloc_bytes_remaining_) { char* result = alloc_ptr_; alloc_ptr_ += bytes; alloc_bytes_remaining_ -= bytes; return result; } return AllocateFallback(bytes); } } // namespace leveldb #endif // STORAGE_LEVELDB_UTIL_ARENA_H_ armory-0.92.3/cppForSwig/leveldb/util/random.h0000644000000000000000000000417612414772654017746 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_UTIL_RANDOM_H_ #define STORAGE_LEVELDB_UTIL_RANDOM_H_ #include namespace leveldb { // A very simple random number generator. Not especially good at // generating truly random bits, but good enough for our needs in this // package. class Random { private: uint32_t seed_; public: explicit Random(uint32_t s) : seed_(s & 0x7fffffffu) { // Avoid bad seeds. if (seed_ == 0 || seed_ == 2147483647L) { seed_ = 1; } } uint32_t Next() { static const uint32_t M = 2147483647L; // 2^31-1 static const uint64_t A = 16807; // bits 14, 8, 7, 5, 2, 1, 0 // We are computing // seed_ = (seed_ * A) % M, where M = 2^31-1 // // seed_ must not be zero or M, or else all subsequent computed values // will be zero or M respectively. For all other values, seed_ will end // up cycling through every number in [1,M-1] uint64_t product = seed_ * A; // Compute (product % M) using the fact that ((x << 31) % M) == x. seed_ = static_cast((product >> 31) + (product & M)); // The first reduction may overflow by 1 bit, so we may need to // repeat. mod == M is not possible; using > allows the faster // sign-bit-based test. if (seed_ > M) { seed_ -= M; } return seed_; } // Returns a uniformly distributed value in the range [0..n-1] // REQUIRES: n > 0 uint32_t Uniform(int n) { return Next() % n; } // Randomly returns true ~"1/n" of the time, and false otherwise. // REQUIRES: n > 0 bool OneIn(int n) { return (Next() % n) == 0; } // Skewed: pick "base" uniformly from range [0,max_log] and then // return "base" random bits. The effect is to pick a number in the // range [0,2^max_log-1] with exponential bias towards smaller numbers. uint32_t Skewed(int max_log) { return Uniform(1 << Uniform(max_log + 1)); } }; } // namespace leveldb #endif // STORAGE_LEVELDB_UTIL_RANDOM_H_ armory-0.92.3/cppForSwig/leveldb/util/logging.h0000644000000000000000000000307212414772654020106 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // Must not be included from any .h files to avoid polluting the namespace // with macros. #ifndef STORAGE_LEVELDB_UTIL_LOGGING_H_ #define STORAGE_LEVELDB_UTIL_LOGGING_H_ #include #include #include #include "port/port.h" namespace leveldb { class Slice; class WritableFile; // Append a human-readable printout of "num" to *str extern void AppendNumberTo(std::string* str, uint64_t num); // Append a human-readable printout of "value" to *str. // Escapes any non-printable characters found in "value". extern void AppendEscapedStringTo(std::string* str, const Slice& value); // Return a human-readable printout of "num" extern std::string NumberToString(uint64_t num); // Return a human-readable version of "value". // Escapes any non-printable characters found in "value". extern std::string EscapeString(const Slice& value); // If *in starts with "c", advances *in past the first character and // returns true. Otherwise, returns false. extern bool ConsumeChar(Slice* in, char c); // Parse a human-readable number from "*in" into *value. On success, // advances "*in" past the consumed number and sets "*val" to the // numeric value. Otherwise, returns false and leaves *in in an // unspecified state. extern bool ConsumeDecimalNumber(Slice* in, uint64_t* val); } // namespace leveldb #endif // STORAGE_LEVELDB_UTIL_LOGGING_H_ armory-0.92.3/cppForSwig/leveldb/util/coding_test.cc0000644000000000000000000001262712414772654021126 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "util/coding.h" #include "util/testharness.h" namespace leveldb { class Coding { }; TEST(Coding, Fixed32) { std::string s; for (uint32_t v = 0; v < 100000; v++) { PutFixed32(&s, v); } const char* p = s.data(); for (uint32_t v = 0; v < 100000; v++) { uint32_t actual = DecodeFixed32(p); ASSERT_EQ(v, actual); p += sizeof(uint32_t); } } TEST(Coding, Fixed64) { std::string s; for (int power = 0; power <= 63; power++) { uint64_t v = static_cast(1) << power; PutFixed64(&s, v - 1); PutFixed64(&s, v + 0); PutFixed64(&s, v + 1); } const char* p = s.data(); for (int power = 0; power <= 63; power++) { uint64_t v = static_cast(1) << power; uint64_t actual; actual = DecodeFixed64(p); ASSERT_EQ(v-1, actual); p += sizeof(uint64_t); actual = DecodeFixed64(p); ASSERT_EQ(v+0, actual); p += sizeof(uint64_t); actual = DecodeFixed64(p); ASSERT_EQ(v+1, actual); p += sizeof(uint64_t); } } // Test that encoding routines generate little-endian encodings TEST(Coding, EncodingOutput) { std::string dst; PutFixed32(&dst, 0x04030201); ASSERT_EQ(4, dst.size()); ASSERT_EQ(0x01, static_cast(dst[0])); ASSERT_EQ(0x02, static_cast(dst[1])); ASSERT_EQ(0x03, static_cast(dst[2])); ASSERT_EQ(0x04, static_cast(dst[3])); dst.clear(); PutFixed64(&dst, 0x0807060504030201ull); ASSERT_EQ(8, dst.size()); ASSERT_EQ(0x01, static_cast(dst[0])); ASSERT_EQ(0x02, static_cast(dst[1])); ASSERT_EQ(0x03, static_cast(dst[2])); ASSERT_EQ(0x04, static_cast(dst[3])); ASSERT_EQ(0x05, static_cast(dst[4])); ASSERT_EQ(0x06, static_cast(dst[5])); ASSERT_EQ(0x07, static_cast(dst[6])); ASSERT_EQ(0x08, static_cast(dst[7])); } TEST(Coding, Varint32) { std::string s; for (uint32_t i = 0; i < (32 * 32); i++) { uint32_t v = (i / 32) << (i % 32); PutVarint32(&s, v); } const char* p = s.data(); const char* limit = p + s.size(); for (uint32_t i = 0; i < (32 * 32); i++) { uint32_t expected = (i / 32) << (i % 32); uint32_t actual; const char* start = p; p = GetVarint32Ptr(p, limit, &actual); ASSERT_TRUE(p != NULL); ASSERT_EQ(expected, actual); ASSERT_EQ(VarintLength(actual), p - start); } ASSERT_EQ(p, s.data() + s.size()); } TEST(Coding, Varint64) { // Construct the list of values to check std::vector values; // Some special values values.push_back(0); values.push_back(100); values.push_back(~static_cast(0)); values.push_back(~static_cast(0) - 1); for (uint32_t k = 0; k < 64; k++) { // Test values near powers of two const uint64_t power = 1ull << k; values.push_back(power); values.push_back(power-1); values.push_back(power+1); } std::string s; for (size_t i = 0; i < values.size(); i++) { PutVarint64(&s, values[i]); } const char* p = s.data(); const char* limit = p + s.size(); for (size_t i = 0; i < values.size(); i++) { ASSERT_TRUE(p < limit); uint64_t actual; const char* start = p; p = GetVarint64Ptr(p, limit, &actual); ASSERT_TRUE(p != NULL); ASSERT_EQ(values[i], actual); ASSERT_EQ(VarintLength(actual), p - start); } ASSERT_EQ(p, limit); } TEST(Coding, Varint32Overflow) { uint32_t result; std::string input("\x81\x82\x83\x84\x85\x11"); ASSERT_TRUE(GetVarint32Ptr(input.data(), input.data() + input.size(), &result) == NULL); } TEST(Coding, Varint32Truncation) { uint32_t large_value = (1u << 31) + 100; std::string s; PutVarint32(&s, large_value); uint32_t result; for (size_t len = 0; len < s.size() - 1; len++) { ASSERT_TRUE(GetVarint32Ptr(s.data(), s.data() + len, &result) == NULL); } ASSERT_TRUE(GetVarint32Ptr(s.data(), s.data() + s.size(), &result) != NULL); ASSERT_EQ(large_value, result); } TEST(Coding, Varint64Overflow) { uint64_t result; std::string input("\x81\x82\x83\x84\x85\x81\x82\x83\x84\x85\x11"); ASSERT_TRUE(GetVarint64Ptr(input.data(), input.data() + input.size(), &result) == NULL); } TEST(Coding, Varint64Truncation) { uint64_t large_value = (1ull << 63) + 100ull; std::string s; PutVarint64(&s, large_value); uint64_t result; for (size_t len = 0; len < s.size() - 1; len++) { ASSERT_TRUE(GetVarint64Ptr(s.data(), s.data() + len, &result) == NULL); } ASSERT_TRUE(GetVarint64Ptr(s.data(), s.data() + s.size(), &result) != NULL); ASSERT_EQ(large_value, result); } TEST(Coding, Strings) { std::string s; PutLengthPrefixedSlice(&s, Slice("")); PutLengthPrefixedSlice(&s, Slice("foo")); PutLengthPrefixedSlice(&s, Slice("bar")); PutLengthPrefixedSlice(&s, Slice(std::string(200, 'x'))); Slice input(s); Slice v; ASSERT_TRUE(GetLengthPrefixedSlice(&input, &v)); ASSERT_EQ("", v.ToString()); ASSERT_TRUE(GetLengthPrefixedSlice(&input, &v)); ASSERT_EQ("foo", v.ToString()); ASSERT_TRUE(GetLengthPrefixedSlice(&input, &v)); ASSERT_EQ("bar", v.ToString()); ASSERT_TRUE(GetLengthPrefixedSlice(&input, &v)); ASSERT_EQ(std::string(200, 'x'), v.ToString()); ASSERT_EQ("", input.ToString()); } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/util/bloom.cc0000644000000000000000000000554612414772654017736 0ustar rootroot// Copyright (c) 2012 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/filter_policy.h" #include "leveldb/slice.h" #include "util/hash.h" namespace leveldb { namespace { static uint32_t BloomHash(const Slice& key) { return Hash(key.data(), key.size(), 0xbc9f1d34); } class BloomFilterPolicy : public FilterPolicy { private: size_t bits_per_key_; size_t k_; public: explicit BloomFilterPolicy(int bits_per_key) : bits_per_key_(bits_per_key) { // We intentionally round down to reduce probing cost a little bit k_ = static_cast(bits_per_key * 0.69); // 0.69 =~ ln(2) if (k_ < 1) k_ = 1; if (k_ > 30) k_ = 30; } virtual const char* Name() const { return "leveldb.BuiltinBloomFilter"; } virtual void CreateFilter(const Slice* keys, int n, std::string* dst) const { // Compute bloom filter size (in both bits and bytes) size_t bits = n * bits_per_key_; // For small n, we can see a very high false positive rate. Fix it // by enforcing a minimum bloom filter length. if (bits < 64) bits = 64; size_t bytes = (bits + 7) / 8; bits = bytes * 8; const size_t init_size = dst->size(); dst->resize(init_size + bytes, 0); dst->push_back(static_cast(k_)); // Remember # of probes in filter char* array = &(*dst)[init_size]; for (size_t i = 0; i < n; i++) { // Use double-hashing to generate a sequence of hash values. // See analysis in [Kirsch,Mitzenmacher 2006]. uint32_t h = BloomHash(keys[i]); const uint32_t delta = (h >> 17) | (h << 15); // Rotate right 17 bits for (size_t j = 0; j < k_; j++) { const uint32_t bitpos = h % bits; array[bitpos/8] |= (1 << (bitpos % 8)); h += delta; } } } virtual bool KeyMayMatch(const Slice& key, const Slice& bloom_filter) const { const size_t len = bloom_filter.size(); if (len < 2) return false; const char* array = bloom_filter.data(); const size_t bits = (len - 1) * 8; // Use the encoded k so that we can read filters generated by // bloom filters created using different parameters. const size_t k = array[len-1]; if (k > 30) { // Reserved for potentially new encodings for short bloom filters. // Consider it a match. return true; } uint32_t h = BloomHash(key); const uint32_t delta = (h >> 17) | (h << 15); // Rotate right 17 bits for (size_t j = 0; j < k; j++) { const uint32_t bitpos = h % bits; if ((array[bitpos/8] & (1 << (bitpos % 8))) == 0) return false; h += delta; } return true; } }; } const FilterPolicy* NewBloomFilterPolicy(int bits_per_key) { return new BloomFilterPolicy(bits_per_key); } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/env_posix.cc0000644000000000000000000003601312414772654020631 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if defined(LEVELDB_PLATFORM_ANDROID) #include #endif #include "leveldb/env.h" #include "leveldb/slice.h" #include "port/port.h" #include "util/logging.h" #include "util/mutexlock.h" #include "util/posix_logger.h" namespace leveldb { namespace { static Status IOError(const std::string& context, int err_number) { return Status::IOError(context, strerror(err_number)); } class PosixSequentialFile: public SequentialFile { private: std::string filename_; FILE* file_; public: PosixSequentialFile(const std::string& fname, FILE* f) : filename_(fname), file_(f) { } virtual ~PosixSequentialFile() { fclose(file_); } virtual Status Read(size_t n, Slice* result, char* scratch) { Status s; size_t r = fread_unlocked(scratch, 1, n, file_); *result = Slice(scratch, r); if (r < n) { if (feof(file_)) { // We leave status as ok if we hit the end of the file } else { // A partial read with an error: return a non-ok status s = IOError(filename_, errno); } } return s; } virtual Status Skip(uint64_t n) { if (fseek(file_, n, SEEK_CUR)) { return IOError(filename_, errno); } return Status::OK(); } }; // pread() based random-access class PosixRandomAccessFile: public RandomAccessFile { private: std::string filename_; int fd_; public: PosixRandomAccessFile(const std::string& fname, int fd) : filename_(fname), fd_(fd) { } virtual ~PosixRandomAccessFile() { close(fd_); } virtual Status Read(uint64_t offset, size_t n, Slice* result, char* scratch) const { Status s; ssize_t r = pread(fd_, scratch, n, static_cast(offset)); *result = Slice(scratch, (r < 0) ? 0 : r); if (r < 0) { // An error: return a non-ok status s = IOError(filename_, errno); } return s; } }; // Helper class to limit mmap file usage so that we do not end up // running out virtual memory or running into kernel performance // problems for very large databases. class MmapLimiter { public: // Up to 1000 mmaps for 64-bit binaries; none for smaller pointer sizes. MmapLimiter() { SetAllowed(sizeof(void*) >= 8 ? 1000 : 0); } // If another mmap slot is available, acquire it and return true. // Else return false. bool Acquire() { if (GetAllowed() <= 0) { return false; } MutexLock l(&mu_); intptr_t x = GetAllowed(); if (x <= 0) { return false; } else { SetAllowed(x - 1); return true; } } // Release a slot acquired by a previous call to Acquire() that returned true. void Release() { MutexLock l(&mu_); SetAllowed(GetAllowed() + 1); } private: port::Mutex mu_; port::AtomicPointer allowed_; intptr_t GetAllowed() const { return reinterpret_cast(allowed_.Acquire_Load()); } // REQUIRES: mu_ must be held void SetAllowed(intptr_t v) { allowed_.Release_Store(reinterpret_cast(v)); } MmapLimiter(const MmapLimiter&); void operator=(const MmapLimiter&); }; // mmap() based random-access class PosixMmapReadableFile: public RandomAccessFile { private: std::string filename_; void* mmapped_region_; size_t length_; MmapLimiter* limiter_; public: // base[0,length-1] contains the mmapped contents of the file. PosixMmapReadableFile(const std::string& fname, void* base, size_t length, MmapLimiter* limiter) : filename_(fname), mmapped_region_(base), length_(length), limiter_(limiter) { } virtual ~PosixMmapReadableFile() { munmap(mmapped_region_, length_); limiter_->Release(); } virtual Status Read(uint64_t offset, size_t n, Slice* result, char* scratch) const { Status s; if (offset + n > length_) { *result = Slice(); s = IOError(filename_, EINVAL); } else { *result = Slice(reinterpret_cast(mmapped_region_) + offset, n); } return s; } }; class PosixWritableFile : public WritableFile { private: std::string filename_; FILE* file_; public: PosixWritableFile(const std::string& fname, FILE* f) : filename_(fname), file_(f) { } ~PosixWritableFile() { if (file_ != NULL) { // Ignoring any potential errors fclose(file_); } } virtual Status Append(const Slice& data) { size_t r = fwrite_unlocked(data.data(), 1, data.size(), file_); if (r != data.size()) { return IOError(filename_, errno); } return Status::OK(); } virtual Status Close() { Status result; if (fclose(file_) != 0) { result = IOError(filename_, errno); } file_ = NULL; return result; } virtual Status Flush() { if (fflush_unlocked(file_) != 0) { return IOError(filename_, errno); } return Status::OK(); } Status SyncDirIfManifest() { const char* f = filename_.c_str(); const char* sep = strrchr(f, '/'); Slice basename; std::string dir; if (sep == NULL) { dir = "."; basename = f; } else { dir = std::string(f, sep - f); basename = sep + 1; } Status s; if (basename.starts_with("MANIFEST")) { int fd = open(dir.c_str(), O_RDONLY); if (fd < 0) { s = IOError(dir, errno); } else { if (fsync(fd) < 0) { s = IOError(dir, errno); } close(fd); } } return s; } virtual Status Sync() { // Ensure new files referred to by the manifest are in the filesystem. Status s = SyncDirIfManifest(); if (!s.ok()) { return s; } if (fflush_unlocked(file_) != 0 || fdatasync(fileno(file_)) != 0) { s = Status::IOError(filename_, strerror(errno)); } return s; } }; static int LockOrUnlock(int fd, bool lock) { errno = 0; struct flock f; memset(&f, 0, sizeof(f)); f.l_type = (lock ? F_WRLCK : F_UNLCK); f.l_whence = SEEK_SET; f.l_start = 0; f.l_len = 0; // Lock/unlock entire file return fcntl(fd, F_SETLK, &f); } class PosixFileLock : public FileLock { public: int fd_; std::string name_; }; // Set of locked files. We keep a separate set instead of just // relying on fcntrl(F_SETLK) since fcntl(F_SETLK) does not provide // any protection against multiple uses from the same process. class PosixLockTable { private: port::Mutex mu_; std::set locked_files_; public: bool Insert(const std::string& fname) { MutexLock l(&mu_); return locked_files_.insert(fname).second; } void Remove(const std::string& fname) { MutexLock l(&mu_); locked_files_.erase(fname); } }; class PosixEnv : public Env { public: PosixEnv(); virtual ~PosixEnv() { fprintf(stderr, "Destroying Env::Default()\n"); abort(); } virtual Status NewSequentialFile(const std::string& fname, SequentialFile** result) { FILE* f = fopen(fname.c_str(), "r"); if (f == NULL) { *result = NULL; return IOError(fname, errno); } else { *result = new PosixSequentialFile(fname, f); return Status::OK(); } } virtual Status NewRandomAccessFile(const std::string& fname, RandomAccessFile** result) { *result = NULL; Status s; int fd = open(fname.c_str(), O_RDONLY); if (fd < 0) { s = IOError(fname, errno); } else if (mmap_limit_.Acquire()) { uint64_t size; s = GetFileSize(fname, &size); if (s.ok()) { void* base = mmap(NULL, size, PROT_READ, MAP_SHARED, fd, 0); if (base != MAP_FAILED) { *result = new PosixMmapReadableFile(fname, base, size, &mmap_limit_); } else { s = IOError(fname, errno); } } close(fd); if (!s.ok()) { mmap_limit_.Release(); } } else { *result = new PosixRandomAccessFile(fname, fd); } return s; } virtual Status NewWritableFile(const std::string& fname, WritableFile** result) { Status s; FILE* f = fopen(fname.c_str(), "w"); if (f == NULL) { *result = NULL; s = IOError(fname, errno); } else { *result = new PosixWritableFile(fname, f); } return s; } virtual bool FileExists(const std::string& fname) { return access(fname.c_str(), F_OK) == 0; } virtual Status GetChildren(const std::string& dir, std::vector* result) { result->clear(); DIR* d = opendir(dir.c_str()); if (d == NULL) { return IOError(dir, errno); } struct dirent* entry; while ((entry = readdir(d)) != NULL) { result->push_back(entry->d_name); } closedir(d); return Status::OK(); } virtual Status DeleteFile(const std::string& fname) { Status result; if (unlink(fname.c_str()) != 0) { result = IOError(fname, errno); } return result; } virtual Status CreateDir(const std::string& name) { Status result; if (mkdir(name.c_str(), 0755) != 0) { result = IOError(name, errno); } return result; } virtual Status DeleteDir(const std::string& name) { Status result; if (rmdir(name.c_str()) != 0) { result = IOError(name, errno); } return result; } virtual Status GetFileSize(const std::string& fname, uint64_t* size) { Status s; struct stat sbuf; if (stat(fname.c_str(), &sbuf) != 0) { *size = 0; s = IOError(fname, errno); } else { *size = sbuf.st_size; } return s; } virtual Status RenameFile(const std::string& src, const std::string& target) { Status result; if (rename(src.c_str(), target.c_str()) != 0) { result = IOError(src, errno); } return result; } virtual Status LockFile(const std::string& fname, FileLock** lock) { *lock = NULL; Status result; int fd = open(fname.c_str(), O_RDWR | O_CREAT, 0644); if (fd < 0) { result = IOError(fname, errno); } else if (!locks_.Insert(fname)) { close(fd); result = Status::IOError("lock " + fname, "already held by process"); } else if (LockOrUnlock(fd, true) == -1) { result = IOError("lock " + fname, errno); close(fd); locks_.Remove(fname); } else { PosixFileLock* my_lock = new PosixFileLock; my_lock->fd_ = fd; my_lock->name_ = fname; *lock = my_lock; } return result; } virtual Status UnlockFile(FileLock* lock) { PosixFileLock* my_lock = reinterpret_cast(lock); Status result; if (LockOrUnlock(my_lock->fd_, false) == -1) { result = IOError("unlock", errno); } locks_.Remove(my_lock->name_); close(my_lock->fd_); delete my_lock; return result; } virtual void Schedule(void (*function)(void*), void* arg); virtual void StartThread(void (*function)(void* arg), void* arg); virtual Status GetTestDirectory(std::string* result) { const char* env = getenv("TEST_TMPDIR"); if (env && env[0] != '\0') { *result = env; } else { char buf[100]; snprintf(buf, sizeof(buf), "/tmp/leveldbtest-%d", int(geteuid())); *result = buf; } // Directory may already exist CreateDir(*result); return Status::OK(); } static uint64_t gettid() { pthread_t tid = pthread_self(); uint64_t thread_id = 0; memcpy(&thread_id, &tid, std::min(sizeof(thread_id), sizeof(tid))); return thread_id; } virtual Status NewLogger(const std::string& fname, Logger** result) { FILE* f = fopen(fname.c_str(), "w"); if (f == NULL) { *result = NULL; return IOError(fname, errno); } else { *result = new PosixLogger(f, &PosixEnv::gettid); return Status::OK(); } } virtual uint64_t NowMicros() { struct timeval tv; gettimeofday(&tv, NULL); return static_cast(tv.tv_sec) * 1000000 + tv.tv_usec; } virtual void SleepForMicroseconds(int micros) { usleep(micros); } private: void PthreadCall(const char* label, int result) { if (result != 0) { fprintf(stderr, "pthread %s: %s\n", label, strerror(result)); abort(); } } // BGThread() is the body of the background thread void BGThread(); static void* BGThreadWrapper(void* arg) { reinterpret_cast(arg)->BGThread(); return NULL; } pthread_mutex_t mu_; pthread_cond_t bgsignal_; pthread_t bgthread_; bool started_bgthread_; // Entry per Schedule() call struct BGItem { void* arg; void (*function)(void*); }; typedef std::deque BGQueue; BGQueue queue_; PosixLockTable locks_; MmapLimiter mmap_limit_; }; PosixEnv::PosixEnv() : started_bgthread_(false) { PthreadCall("mutex_init", pthread_mutex_init(&mu_, NULL)); PthreadCall("cvar_init", pthread_cond_init(&bgsignal_, NULL)); } void PosixEnv::Schedule(void (*function)(void*), void* arg) { PthreadCall("lock", pthread_mutex_lock(&mu_)); // Start background thread if necessary if (!started_bgthread_) { started_bgthread_ = true; PthreadCall( "create thread", pthread_create(&bgthread_, NULL, &PosixEnv::BGThreadWrapper, this)); } // If the queue is currently empty, the background thread may currently be // waiting. if (queue_.empty()) { PthreadCall("signal", pthread_cond_signal(&bgsignal_)); } // Add to priority queue queue_.push_back(BGItem()); queue_.back().function = function; queue_.back().arg = arg; PthreadCall("unlock", pthread_mutex_unlock(&mu_)); } void PosixEnv::BGThread() { while (true) { // Wait until there is an item that is ready to run PthreadCall("lock", pthread_mutex_lock(&mu_)); while (queue_.empty()) { PthreadCall("wait", pthread_cond_wait(&bgsignal_, &mu_)); } void (*function)(void*) = queue_.front().function; void* arg = queue_.front().arg; queue_.pop_front(); PthreadCall("unlock", pthread_mutex_unlock(&mu_)); (*function)(arg); } } namespace { struct StartThreadState { void (*user_function)(void*); void* arg; }; } static void* StartThreadWrapper(void* arg) { StartThreadState* state = reinterpret_cast(arg); state->user_function(state->arg); delete state; return NULL; } void PosixEnv::StartThread(void (*function)(void* arg), void* arg) { pthread_t t; StartThreadState* state = new StartThreadState; state->user_function = function; state->arg = arg; PthreadCall("start thread", pthread_create(&t, NULL, &StartThreadWrapper, state)); } } // namespace static pthread_once_t once = PTHREAD_ONCE_INIT; static Env* default_env; static void InitDefaultEnv() { default_env = new PosixEnv; } Env* Env::Default() { pthread_once(&once, InitDefaultEnv); return default_env; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/coding.h0000644000000000000000000000772212414772654017731 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // Endian-neutral encoding: // * Fixed-length numbers are encoded with least-significant byte first // * In addition we support variable length "varint" encoding // * Strings are encoded prefixed by their length in varint format #ifndef STORAGE_LEVELDB_UTIL_CODING_H_ #define STORAGE_LEVELDB_UTIL_CODING_H_ #include #include #include #include "leveldb/slice.h" #include "port/port.h" namespace leveldb { // Standard Put... routines append to a string extern void PutFixed32(std::string* dst, uint32_t value); extern void PutFixed64(std::string* dst, uint64_t value); extern void PutVarint32(std::string* dst, uint32_t value); extern void PutVarint64(std::string* dst, uint64_t value); extern void PutLengthPrefixedSlice(std::string* dst, const Slice& value); // Standard Get... routines parse a value from the beginning of a Slice // and advance the slice past the parsed value. extern bool GetVarint32(Slice* input, uint32_t* value); extern bool GetVarint64(Slice* input, uint64_t* value); extern bool GetLengthPrefixedSlice(Slice* input, Slice* result); // Pointer-based variants of GetVarint... These either store a value // in *v and return a pointer just past the parsed value, or return // NULL on error. These routines only look at bytes in the range // [p..limit-1] extern const char* GetVarint32Ptr(const char* p,const char* limit, uint32_t* v); extern const char* GetVarint64Ptr(const char* p,const char* limit, uint64_t* v); // Returns the length of the varint32 or varint64 encoding of "v" extern int VarintLength(uint64_t v); // Lower-level versions of Put... that write directly into a character buffer // REQUIRES: dst has enough space for the value being written extern void EncodeFixed32(char* dst, uint32_t value); extern void EncodeFixed64(char* dst, uint64_t value); // Lower-level versions of Put... that write directly into a character buffer // and return a pointer just past the last byte written. // REQUIRES: dst has enough space for the value being written extern char* EncodeVarint32(char* dst, uint32_t value); extern char* EncodeVarint64(char* dst, uint64_t value); // Lower-level versions of Get... that read directly from a character buffer // without any bounds checking. inline uint32_t DecodeFixed32(const char* ptr) { if (port::kLittleEndian) { // Load the raw bytes uint32_t result; memcpy(&result, ptr, sizeof(result)); // gcc optimizes this to a plain load return result; } else { return ((static_cast(static_cast(ptr[0]))) | (static_cast(static_cast(ptr[1])) << 8) | (static_cast(static_cast(ptr[2])) << 16) | (static_cast(static_cast(ptr[3])) << 24)); } } inline uint64_t DecodeFixed64(const char* ptr) { if (port::kLittleEndian) { // Load the raw bytes uint64_t result; memcpy(&result, ptr, sizeof(result)); // gcc optimizes this to a plain load return result; } else { uint64_t lo = DecodeFixed32(ptr); uint64_t hi = DecodeFixed32(ptr + 4); return (hi << 32) | lo; } } // Internal routine for use by fallback path of GetVarint32Ptr extern const char* GetVarint32PtrFallback(const char* p, const char* limit, uint32_t* value); inline const char* GetVarint32Ptr(const char* p, const char* limit, uint32_t* value) { if (p < limit) { uint32_t result = *(reinterpret_cast(p)); if ((result & 128) == 0) { *value = result; return p + 1; } } return GetVarint32PtrFallback(p, limit, value); } } // namespace leveldb #endif // STORAGE_LEVELDB_UTIL_CODING_H_ armory-0.92.3/cppForSwig/leveldb/util/mutexlock.h0000644000000000000000000000215112414772654020470 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_UTIL_MUTEXLOCK_H_ #define STORAGE_LEVELDB_UTIL_MUTEXLOCK_H_ #include "port/port.h" #include "port/thread_annotations.h" namespace leveldb { // Helper class that locks a mutex on construction and unlocks the mutex when // the destructor of the MutexLock object is invoked. // // Typical usage: // // void MyClass::MyMethod() { // MutexLock l(&mu_); // mu_ is an instance variable // ... some complex code, possibly with multiple return paths ... // } class SCOPED_LOCKABLE MutexLock { public: explicit MutexLock(port::Mutex *mu) EXCLUSIVE_LOCK_FUNCTION(mu) : mu_(mu) { this->mu_->Lock(); } ~MutexLock() UNLOCK_FUNCTION() { this->mu_->Unlock(); } private: port::Mutex *const mu_; // No copying allowed MutexLock(const MutexLock&); void operator=(const MutexLock&); }; } // namespace leveldb #endif // STORAGE_LEVELDB_UTIL_MUTEXLOCK_H_ armory-0.92.3/cppForSwig/leveldb/util/env_test.cc0000644000000000000000000000473412414772654020453 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/env.h" #include "port/port.h" #include "util/testharness.h" namespace leveldb { static const int kDelayMicros = 100000; class EnvPosixTest { private: port::Mutex mu_; std::string events_; public: Env* env_; EnvPosixTest() : env_(Env::Default()) { } }; static void SetBool(void* ptr) { reinterpret_cast(ptr)->NoBarrier_Store(ptr); } TEST(EnvPosixTest, RunImmediately) { port::AtomicPointer called (NULL); env_->Schedule(&SetBool, &called); Env::Default()->SleepForMicroseconds(kDelayMicros); ASSERT_TRUE(called.NoBarrier_Load() != NULL); } TEST(EnvPosixTest, RunMany) { port::AtomicPointer last_id (NULL); struct CB { port::AtomicPointer* last_id_ptr; // Pointer to shared slot uintptr_t id; // Order# for the execution of this callback CB(port::AtomicPointer* p, int i) : last_id_ptr(p), id(i) { } static void Run(void* v) { CB* cb = reinterpret_cast(v); void* cur = cb->last_id_ptr->NoBarrier_Load(); ASSERT_EQ(cb->id-1, reinterpret_cast(cur)); cb->last_id_ptr->Release_Store(reinterpret_cast(cb->id)); } }; // Schedule in different order than start time CB cb1(&last_id, 1); CB cb2(&last_id, 2); CB cb3(&last_id, 3); CB cb4(&last_id, 4); env_->Schedule(&CB::Run, &cb1); env_->Schedule(&CB::Run, &cb2); env_->Schedule(&CB::Run, &cb3); env_->Schedule(&CB::Run, &cb4); Env::Default()->SleepForMicroseconds(kDelayMicros); void* cur = last_id.Acquire_Load(); ASSERT_EQ(4, reinterpret_cast(cur)); } struct State { port::Mutex mu; int val; int num_running; }; static void ThreadBody(void* arg) { State* s = reinterpret_cast(arg); s->mu.Lock(); s->val += 1; s->num_running -= 1; s->mu.Unlock(); } TEST(EnvPosixTest, StartThread) { State state; state.val = 0; state.num_running = 3; for (int i = 0; i < 3; i++) { env_->StartThread(&ThreadBody, &state); } while (true) { state.mu.Lock(); int num = state.num_running; state.mu.Unlock(); if (num == 0) { break; } Env::Default()->SleepForMicroseconds(kDelayMicros); } ASSERT_EQ(state.val, 3); } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/util/crc32c.cc0000644000000000000000000003520112414772654017674 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // A portable implementation of crc32c, optimized to handle // four bytes at a time. #include "util/crc32c.h" #include #include "util/coding.h" namespace leveldb { namespace crc32c { static const uint32_t table0_[256] = { 0x00000000, 0xf26b8303, 0xe13b70f7, 0x1350f3f4, 0xc79a971f, 0x35f1141c, 0x26a1e7e8, 0xd4ca64eb, 0x8ad958cf, 0x78b2dbcc, 0x6be22838, 0x9989ab3b, 0x4d43cfd0, 0xbf284cd3, 0xac78bf27, 0x5e133c24, 0x105ec76f, 0xe235446c, 0xf165b798, 0x030e349b, 0xd7c45070, 0x25afd373, 0x36ff2087, 0xc494a384, 0x9a879fa0, 0x68ec1ca3, 0x7bbcef57, 0x89d76c54, 0x5d1d08bf, 0xaf768bbc, 0xbc267848, 0x4e4dfb4b, 0x20bd8ede, 0xd2d60ddd, 0xc186fe29, 0x33ed7d2a, 0xe72719c1, 0x154c9ac2, 0x061c6936, 0xf477ea35, 0xaa64d611, 0x580f5512, 0x4b5fa6e6, 0xb93425e5, 0x6dfe410e, 0x9f95c20d, 0x8cc531f9, 0x7eaeb2fa, 0x30e349b1, 0xc288cab2, 0xd1d83946, 0x23b3ba45, 0xf779deae, 0x05125dad, 0x1642ae59, 0xe4292d5a, 0xba3a117e, 0x4851927d, 0x5b016189, 0xa96ae28a, 0x7da08661, 0x8fcb0562, 0x9c9bf696, 0x6ef07595, 0x417b1dbc, 0xb3109ebf, 0xa0406d4b, 0x522bee48, 0x86e18aa3, 0x748a09a0, 0x67dafa54, 0x95b17957, 0xcba24573, 0x39c9c670, 0x2a993584, 0xd8f2b687, 0x0c38d26c, 0xfe53516f, 0xed03a29b, 0x1f682198, 0x5125dad3, 0xa34e59d0, 0xb01eaa24, 0x42752927, 0x96bf4dcc, 0x64d4cecf, 0x77843d3b, 0x85efbe38, 0xdbfc821c, 0x2997011f, 0x3ac7f2eb, 0xc8ac71e8, 0x1c661503, 0xee0d9600, 0xfd5d65f4, 0x0f36e6f7, 0x61c69362, 0x93ad1061, 0x80fde395, 0x72966096, 0xa65c047d, 0x5437877e, 0x4767748a, 0xb50cf789, 0xeb1fcbad, 0x197448ae, 0x0a24bb5a, 0xf84f3859, 0x2c855cb2, 0xdeeedfb1, 0xcdbe2c45, 0x3fd5af46, 0x7198540d, 0x83f3d70e, 0x90a324fa, 0x62c8a7f9, 0xb602c312, 0x44694011, 0x5739b3e5, 0xa55230e6, 0xfb410cc2, 0x092a8fc1, 0x1a7a7c35, 0xe811ff36, 0x3cdb9bdd, 0xceb018de, 0xdde0eb2a, 0x2f8b6829, 0x82f63b78, 0x709db87b, 0x63cd4b8f, 0x91a6c88c, 0x456cac67, 0xb7072f64, 0xa457dc90, 0x563c5f93, 0x082f63b7, 0xfa44e0b4, 0xe9141340, 0x1b7f9043, 0xcfb5f4a8, 0x3dde77ab, 0x2e8e845f, 0xdce5075c, 0x92a8fc17, 0x60c37f14, 0x73938ce0, 0x81f80fe3, 0x55326b08, 0xa759e80b, 0xb4091bff, 0x466298fc, 0x1871a4d8, 0xea1a27db, 0xf94ad42f, 0x0b21572c, 0xdfeb33c7, 0x2d80b0c4, 0x3ed04330, 0xccbbc033, 0xa24bb5a6, 0x502036a5, 0x4370c551, 0xb11b4652, 0x65d122b9, 0x97baa1ba, 0x84ea524e, 0x7681d14d, 0x2892ed69, 0xdaf96e6a, 0xc9a99d9e, 0x3bc21e9d, 0xef087a76, 0x1d63f975, 0x0e330a81, 0xfc588982, 0xb21572c9, 0x407ef1ca, 0x532e023e, 0xa145813d, 0x758fe5d6, 0x87e466d5, 0x94b49521, 0x66df1622, 0x38cc2a06, 0xcaa7a905, 0xd9f75af1, 0x2b9cd9f2, 0xff56bd19, 0x0d3d3e1a, 0x1e6dcdee, 0xec064eed, 0xc38d26c4, 0x31e6a5c7, 0x22b65633, 0xd0ddd530, 0x0417b1db, 0xf67c32d8, 0xe52cc12c, 0x1747422f, 0x49547e0b, 0xbb3ffd08, 0xa86f0efc, 0x5a048dff, 0x8ecee914, 0x7ca56a17, 0x6ff599e3, 0x9d9e1ae0, 0xd3d3e1ab, 0x21b862a8, 0x32e8915c, 0xc083125f, 0x144976b4, 0xe622f5b7, 0xf5720643, 0x07198540, 0x590ab964, 0xab613a67, 0xb831c993, 0x4a5a4a90, 0x9e902e7b, 0x6cfbad78, 0x7fab5e8c, 0x8dc0dd8f, 0xe330a81a, 0x115b2b19, 0x020bd8ed, 0xf0605bee, 0x24aa3f05, 0xd6c1bc06, 0xc5914ff2, 0x37faccf1, 0x69e9f0d5, 0x9b8273d6, 0x88d28022, 0x7ab90321, 0xae7367ca, 0x5c18e4c9, 0x4f48173d, 0xbd23943e, 0xf36e6f75, 0x0105ec76, 0x12551f82, 0xe03e9c81, 0x34f4f86a, 0xc69f7b69, 0xd5cf889d, 0x27a40b9e, 0x79b737ba, 0x8bdcb4b9, 0x988c474d, 0x6ae7c44e, 0xbe2da0a5, 0x4c4623a6, 0x5f16d052, 0xad7d5351 }; static const uint32_t table1_[256] = { 0x00000000, 0x13a29877, 0x274530ee, 0x34e7a899, 0x4e8a61dc, 0x5d28f9ab, 0x69cf5132, 0x7a6dc945, 0x9d14c3b8, 0x8eb65bcf, 0xba51f356, 0xa9f36b21, 0xd39ea264, 0xc03c3a13, 0xf4db928a, 0xe7790afd, 0x3fc5f181, 0x2c6769f6, 0x1880c16f, 0x0b225918, 0x714f905d, 0x62ed082a, 0x560aa0b3, 0x45a838c4, 0xa2d13239, 0xb173aa4e, 0x859402d7, 0x96369aa0, 0xec5b53e5, 0xfff9cb92, 0xcb1e630b, 0xd8bcfb7c, 0x7f8be302, 0x6c297b75, 0x58ced3ec, 0x4b6c4b9b, 0x310182de, 0x22a31aa9, 0x1644b230, 0x05e62a47, 0xe29f20ba, 0xf13db8cd, 0xc5da1054, 0xd6788823, 0xac154166, 0xbfb7d911, 0x8b507188, 0x98f2e9ff, 0x404e1283, 0x53ec8af4, 0x670b226d, 0x74a9ba1a, 0x0ec4735f, 0x1d66eb28, 0x298143b1, 0x3a23dbc6, 0xdd5ad13b, 0xcef8494c, 0xfa1fe1d5, 0xe9bd79a2, 0x93d0b0e7, 0x80722890, 0xb4958009, 0xa737187e, 0xff17c604, 0xecb55e73, 0xd852f6ea, 0xcbf06e9d, 0xb19da7d8, 0xa23f3faf, 0x96d89736, 0x857a0f41, 0x620305bc, 0x71a19dcb, 0x45463552, 0x56e4ad25, 0x2c896460, 0x3f2bfc17, 0x0bcc548e, 0x186eccf9, 0xc0d23785, 0xd370aff2, 0xe797076b, 0xf4359f1c, 0x8e585659, 0x9dface2e, 0xa91d66b7, 0xbabffec0, 0x5dc6f43d, 0x4e646c4a, 0x7a83c4d3, 0x69215ca4, 0x134c95e1, 0x00ee0d96, 0x3409a50f, 0x27ab3d78, 0x809c2506, 0x933ebd71, 0xa7d915e8, 0xb47b8d9f, 0xce1644da, 0xddb4dcad, 0xe9537434, 0xfaf1ec43, 0x1d88e6be, 0x0e2a7ec9, 0x3acdd650, 0x296f4e27, 0x53028762, 0x40a01f15, 0x7447b78c, 0x67e52ffb, 0xbf59d487, 0xacfb4cf0, 0x981ce469, 0x8bbe7c1e, 0xf1d3b55b, 0xe2712d2c, 0xd69685b5, 0xc5341dc2, 0x224d173f, 0x31ef8f48, 0x050827d1, 0x16aabfa6, 0x6cc776e3, 0x7f65ee94, 0x4b82460d, 0x5820de7a, 0xfbc3faf9, 0xe861628e, 0xdc86ca17, 0xcf245260, 0xb5499b25, 0xa6eb0352, 0x920cabcb, 0x81ae33bc, 0x66d73941, 0x7575a136, 0x419209af, 0x523091d8, 0x285d589d, 0x3bffc0ea, 0x0f186873, 0x1cbaf004, 0xc4060b78, 0xd7a4930f, 0xe3433b96, 0xf0e1a3e1, 0x8a8c6aa4, 0x992ef2d3, 0xadc95a4a, 0xbe6bc23d, 0x5912c8c0, 0x4ab050b7, 0x7e57f82e, 0x6df56059, 0x1798a91c, 0x043a316b, 0x30dd99f2, 0x237f0185, 0x844819fb, 0x97ea818c, 0xa30d2915, 0xb0afb162, 0xcac27827, 0xd960e050, 0xed8748c9, 0xfe25d0be, 0x195cda43, 0x0afe4234, 0x3e19eaad, 0x2dbb72da, 0x57d6bb9f, 0x447423e8, 0x70938b71, 0x63311306, 0xbb8de87a, 0xa82f700d, 0x9cc8d894, 0x8f6a40e3, 0xf50789a6, 0xe6a511d1, 0xd242b948, 0xc1e0213f, 0x26992bc2, 0x353bb3b5, 0x01dc1b2c, 0x127e835b, 0x68134a1e, 0x7bb1d269, 0x4f567af0, 0x5cf4e287, 0x04d43cfd, 0x1776a48a, 0x23910c13, 0x30339464, 0x4a5e5d21, 0x59fcc556, 0x6d1b6dcf, 0x7eb9f5b8, 0x99c0ff45, 0x8a626732, 0xbe85cfab, 0xad2757dc, 0xd74a9e99, 0xc4e806ee, 0xf00fae77, 0xe3ad3600, 0x3b11cd7c, 0x28b3550b, 0x1c54fd92, 0x0ff665e5, 0x759baca0, 0x663934d7, 0x52de9c4e, 0x417c0439, 0xa6050ec4, 0xb5a796b3, 0x81403e2a, 0x92e2a65d, 0xe88f6f18, 0xfb2df76f, 0xcfca5ff6, 0xdc68c781, 0x7b5fdfff, 0x68fd4788, 0x5c1aef11, 0x4fb87766, 0x35d5be23, 0x26772654, 0x12908ecd, 0x013216ba, 0xe64b1c47, 0xf5e98430, 0xc10e2ca9, 0xd2acb4de, 0xa8c17d9b, 0xbb63e5ec, 0x8f844d75, 0x9c26d502, 0x449a2e7e, 0x5738b609, 0x63df1e90, 0x707d86e7, 0x0a104fa2, 0x19b2d7d5, 0x2d557f4c, 0x3ef7e73b, 0xd98eedc6, 0xca2c75b1, 0xfecbdd28, 0xed69455f, 0x97048c1a, 0x84a6146d, 0xb041bcf4, 0xa3e32483 }; static const uint32_t table2_[256] = { 0x00000000, 0xa541927e, 0x4f6f520d, 0xea2ec073, 0x9edea41a, 0x3b9f3664, 0xd1b1f617, 0x74f06469, 0x38513ec5, 0x9d10acbb, 0x773e6cc8, 0xd27ffeb6, 0xa68f9adf, 0x03ce08a1, 0xe9e0c8d2, 0x4ca15aac, 0x70a27d8a, 0xd5e3eff4, 0x3fcd2f87, 0x9a8cbdf9, 0xee7cd990, 0x4b3d4bee, 0xa1138b9d, 0x045219e3, 0x48f3434f, 0xedb2d131, 0x079c1142, 0xa2dd833c, 0xd62de755, 0x736c752b, 0x9942b558, 0x3c032726, 0xe144fb14, 0x4405696a, 0xae2ba919, 0x0b6a3b67, 0x7f9a5f0e, 0xdadbcd70, 0x30f50d03, 0x95b49f7d, 0xd915c5d1, 0x7c5457af, 0x967a97dc, 0x333b05a2, 0x47cb61cb, 0xe28af3b5, 0x08a433c6, 0xade5a1b8, 0x91e6869e, 0x34a714e0, 0xde89d493, 0x7bc846ed, 0x0f382284, 0xaa79b0fa, 0x40577089, 0xe516e2f7, 0xa9b7b85b, 0x0cf62a25, 0xe6d8ea56, 0x43997828, 0x37691c41, 0x92288e3f, 0x78064e4c, 0xdd47dc32, 0xc76580d9, 0x622412a7, 0x880ad2d4, 0x2d4b40aa, 0x59bb24c3, 0xfcfab6bd, 0x16d476ce, 0xb395e4b0, 0xff34be1c, 0x5a752c62, 0xb05bec11, 0x151a7e6f, 0x61ea1a06, 0xc4ab8878, 0x2e85480b, 0x8bc4da75, 0xb7c7fd53, 0x12866f2d, 0xf8a8af5e, 0x5de93d20, 0x29195949, 0x8c58cb37, 0x66760b44, 0xc337993a, 0x8f96c396, 0x2ad751e8, 0xc0f9919b, 0x65b803e5, 0x1148678c, 0xb409f5f2, 0x5e273581, 0xfb66a7ff, 0x26217bcd, 0x8360e9b3, 0x694e29c0, 0xcc0fbbbe, 0xb8ffdfd7, 0x1dbe4da9, 0xf7908dda, 0x52d11fa4, 0x1e704508, 0xbb31d776, 0x511f1705, 0xf45e857b, 0x80aee112, 0x25ef736c, 0xcfc1b31f, 0x6a802161, 0x56830647, 0xf3c29439, 0x19ec544a, 0xbcadc634, 0xc85da25d, 0x6d1c3023, 0x8732f050, 0x2273622e, 0x6ed23882, 0xcb93aafc, 0x21bd6a8f, 0x84fcf8f1, 0xf00c9c98, 0x554d0ee6, 0xbf63ce95, 0x1a225ceb, 0x8b277743, 0x2e66e53d, 0xc448254e, 0x6109b730, 0x15f9d359, 0xb0b84127, 0x5a968154, 0xffd7132a, 0xb3764986, 0x1637dbf8, 0xfc191b8b, 0x595889f5, 0x2da8ed9c, 0x88e97fe2, 0x62c7bf91, 0xc7862def, 0xfb850ac9, 0x5ec498b7, 0xb4ea58c4, 0x11abcaba, 0x655baed3, 0xc01a3cad, 0x2a34fcde, 0x8f756ea0, 0xc3d4340c, 0x6695a672, 0x8cbb6601, 0x29faf47f, 0x5d0a9016, 0xf84b0268, 0x1265c21b, 0xb7245065, 0x6a638c57, 0xcf221e29, 0x250cde5a, 0x804d4c24, 0xf4bd284d, 0x51fcba33, 0xbbd27a40, 0x1e93e83e, 0x5232b292, 0xf77320ec, 0x1d5de09f, 0xb81c72e1, 0xccec1688, 0x69ad84f6, 0x83834485, 0x26c2d6fb, 0x1ac1f1dd, 0xbf8063a3, 0x55aea3d0, 0xf0ef31ae, 0x841f55c7, 0x215ec7b9, 0xcb7007ca, 0x6e3195b4, 0x2290cf18, 0x87d15d66, 0x6dff9d15, 0xc8be0f6b, 0xbc4e6b02, 0x190ff97c, 0xf321390f, 0x5660ab71, 0x4c42f79a, 0xe90365e4, 0x032da597, 0xa66c37e9, 0xd29c5380, 0x77ddc1fe, 0x9df3018d, 0x38b293f3, 0x7413c95f, 0xd1525b21, 0x3b7c9b52, 0x9e3d092c, 0xeacd6d45, 0x4f8cff3b, 0xa5a23f48, 0x00e3ad36, 0x3ce08a10, 0x99a1186e, 0x738fd81d, 0xd6ce4a63, 0xa23e2e0a, 0x077fbc74, 0xed517c07, 0x4810ee79, 0x04b1b4d5, 0xa1f026ab, 0x4bdee6d8, 0xee9f74a6, 0x9a6f10cf, 0x3f2e82b1, 0xd50042c2, 0x7041d0bc, 0xad060c8e, 0x08479ef0, 0xe2695e83, 0x4728ccfd, 0x33d8a894, 0x96993aea, 0x7cb7fa99, 0xd9f668e7, 0x9557324b, 0x3016a035, 0xda386046, 0x7f79f238, 0x0b899651, 0xaec8042f, 0x44e6c45c, 0xe1a75622, 0xdda47104, 0x78e5e37a, 0x92cb2309, 0x378ab177, 0x437ad51e, 0xe63b4760, 0x0c158713, 0xa954156d, 0xe5f54fc1, 0x40b4ddbf, 0xaa9a1dcc, 0x0fdb8fb2, 0x7b2bebdb, 0xde6a79a5, 0x3444b9d6, 0x91052ba8 }; static const uint32_t table3_[256] = { 0x00000000, 0xdd45aab8, 0xbf672381, 0x62228939, 0x7b2231f3, 0xa6679b4b, 0xc4451272, 0x1900b8ca, 0xf64463e6, 0x2b01c95e, 0x49234067, 0x9466eadf, 0x8d665215, 0x5023f8ad, 0x32017194, 0xef44db2c, 0xe964b13d, 0x34211b85, 0x560392bc, 0x8b463804, 0x924680ce, 0x4f032a76, 0x2d21a34f, 0xf06409f7, 0x1f20d2db, 0xc2657863, 0xa047f15a, 0x7d025be2, 0x6402e328, 0xb9474990, 0xdb65c0a9, 0x06206a11, 0xd725148b, 0x0a60be33, 0x6842370a, 0xb5079db2, 0xac072578, 0x71428fc0, 0x136006f9, 0xce25ac41, 0x2161776d, 0xfc24ddd5, 0x9e0654ec, 0x4343fe54, 0x5a43469e, 0x8706ec26, 0xe524651f, 0x3861cfa7, 0x3e41a5b6, 0xe3040f0e, 0x81268637, 0x5c632c8f, 0x45639445, 0x98263efd, 0xfa04b7c4, 0x27411d7c, 0xc805c650, 0x15406ce8, 0x7762e5d1, 0xaa274f69, 0xb327f7a3, 0x6e625d1b, 0x0c40d422, 0xd1057e9a, 0xaba65fe7, 0x76e3f55f, 0x14c17c66, 0xc984d6de, 0xd0846e14, 0x0dc1c4ac, 0x6fe34d95, 0xb2a6e72d, 0x5de23c01, 0x80a796b9, 0xe2851f80, 0x3fc0b538, 0x26c00df2, 0xfb85a74a, 0x99a72e73, 0x44e284cb, 0x42c2eeda, 0x9f874462, 0xfda5cd5b, 0x20e067e3, 0x39e0df29, 0xe4a57591, 0x8687fca8, 0x5bc25610, 0xb4868d3c, 0x69c32784, 0x0be1aebd, 0xd6a40405, 0xcfa4bccf, 0x12e11677, 0x70c39f4e, 0xad8635f6, 0x7c834b6c, 0xa1c6e1d4, 0xc3e468ed, 0x1ea1c255, 0x07a17a9f, 0xdae4d027, 0xb8c6591e, 0x6583f3a6, 0x8ac7288a, 0x57828232, 0x35a00b0b, 0xe8e5a1b3, 0xf1e51979, 0x2ca0b3c1, 0x4e823af8, 0x93c79040, 0x95e7fa51, 0x48a250e9, 0x2a80d9d0, 0xf7c57368, 0xeec5cba2, 0x3380611a, 0x51a2e823, 0x8ce7429b, 0x63a399b7, 0xbee6330f, 0xdcc4ba36, 0x0181108e, 0x1881a844, 0xc5c402fc, 0xa7e68bc5, 0x7aa3217d, 0x52a0c93f, 0x8fe56387, 0xedc7eabe, 0x30824006, 0x2982f8cc, 0xf4c75274, 0x96e5db4d, 0x4ba071f5, 0xa4e4aad9, 0x79a10061, 0x1b838958, 0xc6c623e0, 0xdfc69b2a, 0x02833192, 0x60a1b8ab, 0xbde41213, 0xbbc47802, 0x6681d2ba, 0x04a35b83, 0xd9e6f13b, 0xc0e649f1, 0x1da3e349, 0x7f816a70, 0xa2c4c0c8, 0x4d801be4, 0x90c5b15c, 0xf2e73865, 0x2fa292dd, 0x36a22a17, 0xebe780af, 0x89c50996, 0x5480a32e, 0x8585ddb4, 0x58c0770c, 0x3ae2fe35, 0xe7a7548d, 0xfea7ec47, 0x23e246ff, 0x41c0cfc6, 0x9c85657e, 0x73c1be52, 0xae8414ea, 0xcca69dd3, 0x11e3376b, 0x08e38fa1, 0xd5a62519, 0xb784ac20, 0x6ac10698, 0x6ce16c89, 0xb1a4c631, 0xd3864f08, 0x0ec3e5b0, 0x17c35d7a, 0xca86f7c2, 0xa8a47efb, 0x75e1d443, 0x9aa50f6f, 0x47e0a5d7, 0x25c22cee, 0xf8878656, 0xe1873e9c, 0x3cc29424, 0x5ee01d1d, 0x83a5b7a5, 0xf90696d8, 0x24433c60, 0x4661b559, 0x9b241fe1, 0x8224a72b, 0x5f610d93, 0x3d4384aa, 0xe0062e12, 0x0f42f53e, 0xd2075f86, 0xb025d6bf, 0x6d607c07, 0x7460c4cd, 0xa9256e75, 0xcb07e74c, 0x16424df4, 0x106227e5, 0xcd278d5d, 0xaf050464, 0x7240aedc, 0x6b401616, 0xb605bcae, 0xd4273597, 0x09629f2f, 0xe6264403, 0x3b63eebb, 0x59416782, 0x8404cd3a, 0x9d0475f0, 0x4041df48, 0x22635671, 0xff26fcc9, 0x2e238253, 0xf36628eb, 0x9144a1d2, 0x4c010b6a, 0x5501b3a0, 0x88441918, 0xea669021, 0x37233a99, 0xd867e1b5, 0x05224b0d, 0x6700c234, 0xba45688c, 0xa345d046, 0x7e007afe, 0x1c22f3c7, 0xc167597f, 0xc747336e, 0x1a0299d6, 0x782010ef, 0xa565ba57, 0xbc65029d, 0x6120a825, 0x0302211c, 0xde478ba4, 0x31035088, 0xec46fa30, 0x8e647309, 0x5321d9b1, 0x4a21617b, 0x9764cbc3, 0xf54642fa, 0x2803e842 }; // Used to fetch a naturally-aligned 32-bit word in little endian byte-order static inline uint32_t LE_LOAD32(const uint8_t *p) { return DecodeFixed32(reinterpret_cast(p)); } uint32_t Extend(uint32_t crc, const char* buf, size_t size) { const uint8_t *p = reinterpret_cast(buf); const uint8_t *e = p + size; uint32_t l = crc ^ 0xffffffffu; #define STEP1 do { \ int c = (l & 0xff) ^ *p++; \ l = table0_[c] ^ (l >> 8); \ } while (0) #define STEP4 do { \ uint32_t c = l ^ LE_LOAD32(p); \ p += 4; \ l = table3_[c & 0xff] ^ \ table2_[(c >> 8) & 0xff] ^ \ table1_[(c >> 16) & 0xff] ^ \ table0_[c >> 24]; \ } while (0) // Point x at first 4-byte aligned byte in string. This might be // just past the end of the string. const uintptr_t pval = reinterpret_cast(p); const uint8_t* x = reinterpret_cast(((pval + 3) >> 2) << 2); if (x <= e) { // Process bytes until finished or p is 4-byte aligned while (p != x) { STEP1; } } // Process bytes 16 at a time while ((e-p) >= 16) { STEP4; STEP4; STEP4; STEP4; } // Process bytes 4 at a time while ((e-p) >= 4) { STEP4; } // Process the last few bytes while (p != e) { STEP1; } #undef STEP4 #undef STEP1 return l ^ 0xffffffffu; } } // namespace crc32c } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/testharness.cc0000644000000000000000000000320412414772654021156 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "util/testharness.h" #include #include #include #include namespace leveldb { namespace test { namespace { struct Test { const char* base; const char* name; void (*func)(); }; std::vector* tests; } bool RegisterTest(const char* base, const char* name, void (*func)()) { if (tests == NULL) { tests = new std::vector; } Test t; t.base = base; t.name = name; t.func = func; tests->push_back(t); return true; } int RunAllTests() { const char* matcher = getenv("LEVELDB_TESTS"); int num = 0; if (tests != NULL) { for (size_t i = 0; i < tests->size(); i++) { const Test& t = (*tests)[i]; if (matcher != NULL) { std::string name = t.base; name.push_back('.'); name.append(t.name); if (strstr(name.c_str(), matcher) == NULL) { continue; } } fprintf(stderr, "==== Test %s.%s\n", t.base, t.name); (*t.func)(); ++num; } } fprintf(stderr, "==== PASSED %d tests\n", num); return 0; } std::string TmpDir() { std::string dir; Status s = Env::Default()->GetTestDirectory(&dir); ASSERT_TRUE(s.ok()) << s.ToString(); return dir; } int RandomSeed() { const char* env = getenv("TEST_RANDOM_SEED"); int result = (env != NULL ? atoi(env) : 301); if (result <= 0) { result = 301; } return result; } } // namespace test } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/crc32c.h0000644000000000000000000000266112414772654017542 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_UTIL_CRC32C_H_ #define STORAGE_LEVELDB_UTIL_CRC32C_H_ #include #include namespace leveldb { namespace crc32c { // Return the crc32c of concat(A, data[0,n-1]) where init_crc is the // crc32c of some string A. Extend() is often used to maintain the // crc32c of a stream of data. extern uint32_t Extend(uint32_t init_crc, const char* data, size_t n); // Return the crc32c of data[0,n-1] inline uint32_t Value(const char* data, size_t n) { return Extend(0, data, n); } static const uint32_t kMaskDelta = 0xa282ead8ul; // Return a masked representation of crc. // // Motivation: it is problematic to compute the CRC of a string that // contains embedded CRCs. Therefore we recommend that CRCs stored // somewhere (e.g., in files) should be masked before being stored. inline uint32_t Mask(uint32_t crc) { // Rotate right by 15 bits and add a constant. return ((crc >> 15) | (crc << 17)) + kMaskDelta; } // Return the crc whose masked representation is masked_crc. inline uint32_t Unmask(uint32_t masked_crc) { uint32_t rot = masked_crc - kMaskDelta; return ((rot >> 17) | (rot << 15)); } } // namespace crc32c } // namespace leveldb #endif // STORAGE_LEVELDB_UTIL_CRC32C_H_ armory-0.92.3/cppForSwig/leveldb/util/testutil.cc0000644000000000000000000000266112414772654020476 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "util/testutil.h" #include "util/random.h" namespace leveldb { namespace test { Slice RandomString(Random* rnd, int len, std::string* dst) { dst->resize(len); for (int i = 0; i < len; i++) { (*dst)[i] = static_cast(' ' + rnd->Uniform(95)); // ' ' .. '~' } return Slice(*dst); } std::string RandomKey(Random* rnd, int len) { // Make sure to generate a wide variety of characters so we // test the boundary conditions for short-key optimizations. static const char kTestChars[] = { '\0', '\1', 'a', 'b', 'c', 'd', 'e', '\xfd', '\xfe', '\xff' }; std::string result; for (int i = 0; i < len; i++) { result += kTestChars[rnd->Uniform(sizeof(kTestChars))]; } return result; } extern Slice CompressibleString(Random* rnd, double compressed_fraction, size_t len, std::string* dst) { int raw = static_cast(len * compressed_fraction); if (raw < 1) raw = 1; std::string raw_data; RandomString(rnd, raw, &raw_data); // Duplicate the random data until we have filled "len" bytes dst->clear(); while (dst->size() < len) { dst->append(raw_data); } dst->resize(len); return Slice(*dst); } } // namespace test } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/posix_logger.h0000644000000000000000000000527112414772654021164 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // Logger implementation that can be shared by all environments // where enough posix functionality is available. #ifndef STORAGE_LEVELDB_UTIL_POSIX_LOGGER_H_ #define STORAGE_LEVELDB_UTIL_POSIX_LOGGER_H_ #include #include #include #include #include "leveldb/env.h" namespace leveldb { class PosixLogger : public Logger { private: FILE* file_; uint64_t (*gettid_)(); // Return the thread id for the current thread public: PosixLogger(FILE* f, uint64_t (*gettid)()) : file_(f), gettid_(gettid) { } virtual ~PosixLogger() { fclose(file_); } virtual void Logv(const char* format, va_list ap) { const uint64_t thread_id = (*gettid_)(); // We try twice: the first time with a fixed-size stack allocated buffer, // and the second time with a much larger dynamically allocated buffer. char buffer[500]; for (int iter = 0; iter < 2; iter++) { char* base; int bufsize; if (iter == 0) { bufsize = sizeof(buffer); base = buffer; } else { bufsize = 30000; base = new char[bufsize]; } char* p = base; char* limit = base + bufsize; struct timeval now_tv; gettimeofday(&now_tv, NULL); const time_t seconds = now_tv.tv_sec; struct tm t; localtime_r(&seconds, &t); p += snprintf(p, limit - p, "%04d/%02d/%02d-%02d:%02d:%02d.%06d %llx ", t.tm_year + 1900, t.tm_mon + 1, t.tm_mday, t.tm_hour, t.tm_min, t.tm_sec, static_cast(now_tv.tv_usec), static_cast(thread_id)); // Print the message if (p < limit) { va_list backup_ap; va_copy(backup_ap, ap); p += vsnprintf(p, limit - p, format, backup_ap); va_end(backup_ap); } // Truncate to available space if necessary if (p >= limit) { if (iter == 0) { continue; // Try again with larger buffer } else { p = limit - 1; } } // Add newline if necessary if (p == base || p[-1] != '\n') { *p++ = '\n'; } assert(p <= limit); fwrite(base, 1, p - base, file_); fflush(file_); if (base != buffer) { delete[] base; } break; } } }; } // namespace leveldb #endif // STORAGE_LEVELDB_UTIL_POSIX_LOGGER_H_ armory-0.92.3/cppForSwig/leveldb/util/filter_policy.cc0000644000000000000000000000051512414772654021461 0ustar rootroot// Copyright (c) 2012 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/filter_policy.h" namespace leveldb { FilterPolicy::~FilterPolicy() { } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/arena_test.cc0000644000000000000000000000321712414772654020744 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "util/arena.h" #include "util/random.h" #include "util/testharness.h" namespace leveldb { class ArenaTest { }; TEST(ArenaTest, Empty) { Arena arena; } TEST(ArenaTest, Simple) { std::vector > allocated; Arena arena; const int N = 100000; size_t bytes = 0; Random rnd(301); for (int i = 0; i < N; i++) { size_t s; if (i % (N / 10) == 0) { s = i; } else { s = rnd.OneIn(4000) ? rnd.Uniform(6000) : (rnd.OneIn(10) ? rnd.Uniform(100) : rnd.Uniform(20)); } if (s == 0) { // Our arena disallows size 0 allocations. s = 1; } char* r; if (rnd.OneIn(10)) { r = arena.AllocateAligned(s); } else { r = arena.Allocate(s); } for (size_t b = 0; b < s; b++) { // Fill the "i"th allocation with a known bit pattern r[b] = i % 256; } bytes += s; allocated.push_back(std::make_pair(s, r)); ASSERT_GE(arena.MemoryUsage(), bytes); if (i > N/10) { ASSERT_LE(arena.MemoryUsage(), bytes * 1.10); } } for (size_t i = 0; i < allocated.size(); i++) { size_t num_bytes = allocated[i].first; const char* p = allocated[i].second; for (size_t b = 0; b < num_bytes; b++) { // Check the "i"th allocation for the known bit pattern ASSERT_EQ(int(p[b]) & 0xff, i % 256); } } } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/util/logging.cc0000644000000000000000000000351512414772654020246 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "util/logging.h" #include #include #include #include #include "leveldb/env.h" #include "leveldb/slice.h" namespace leveldb { void AppendNumberTo(std::string* str, uint64_t num) { char buf[30]; snprintf(buf, sizeof(buf), "%llu", (unsigned long long) num); str->append(buf); } void AppendEscapedStringTo(std::string* str, const Slice& value) { for (size_t i = 0; i < value.size(); i++) { char c = value[i]; if (c >= ' ' && c <= '~') { str->push_back(c); } else { char buf[10]; snprintf(buf, sizeof(buf), "\\x%02x", static_cast(c) & 0xff); str->append(buf); } } } std::string NumberToString(uint64_t num) { std::string r; AppendNumberTo(&r, num); return r; } std::string EscapeString(const Slice& value) { std::string r; AppendEscapedStringTo(&r, value); return r; } bool ConsumeChar(Slice* in, char c) { if (!in->empty() && (*in)[0] == c) { in->remove_prefix(1); return true; } else { return false; } } bool ConsumeDecimalNumber(Slice* in, uint64_t* val) { uint64_t v = 0; int digits = 0; while (!in->empty()) { char c = (*in)[0]; if (c >= '0' && c <= '9') { ++digits; const int delta = (c - '0'); static const uint64_t kMaxUint64 = ~static_cast(0); if (v > kMaxUint64/10 || (v == kMaxUint64/10 && delta > kMaxUint64%10)) { // Overflow return false; } v = (v * 10) + delta; in->remove_prefix(1); } else { break; } } *val = v; return (digits > 0); } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/arena.cc0000644000000000000000000000370112414772654017703 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "util/arena.h" #include namespace leveldb { static const int kBlockSize = 4096; Arena::Arena() { blocks_memory_ = 0; alloc_ptr_ = NULL; // First allocation will allocate a block alloc_bytes_remaining_ = 0; } Arena::~Arena() { for (size_t i = 0; i < blocks_.size(); i++) { delete[] blocks_[i]; } } char* Arena::AllocateFallback(size_t bytes) { if (bytes > kBlockSize / 4) { // Object is more than a quarter of our block size. Allocate it separately // to avoid wasting too much space in leftover bytes. char* result = AllocateNewBlock(bytes); return result; } // We waste the remaining space in the current block. alloc_ptr_ = AllocateNewBlock(kBlockSize); alloc_bytes_remaining_ = kBlockSize; char* result = alloc_ptr_; alloc_ptr_ += bytes; alloc_bytes_remaining_ -= bytes; return result; } char* Arena::AllocateAligned(size_t bytes) { const int align = (sizeof(void*) > 8) ? sizeof(void*) : 8; assert((align & (align-1)) == 0); // Pointer size should be a power of 2 size_t current_mod = reinterpret_cast(alloc_ptr_) & (align-1); size_t slop = (current_mod == 0 ? 0 : align - current_mod); size_t needed = bytes + slop; char* result; if (needed <= alloc_bytes_remaining_) { result = alloc_ptr_ + slop; alloc_ptr_ += needed; alloc_bytes_remaining_ -= needed; } else { // AllocateFallback always returned aligned memory result = AllocateFallback(bytes); } assert((reinterpret_cast(result) & (align-1)) == 0); return result; } char* Arena::AllocateNewBlock(size_t block_bytes) { char* result = new char[block_bytes]; blocks_memory_ += block_bytes; blocks_.push_back(result); return result; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/testutil.h0000644000000000000000000000333612414772654020340 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_UTIL_TESTUTIL_H_ #define STORAGE_LEVELDB_UTIL_TESTUTIL_H_ #include "leveldb/env.h" #include "leveldb/slice.h" #include "util/random.h" namespace leveldb { namespace test { // Store in *dst a random string of length "len" and return a Slice that // references the generated data. extern Slice RandomString(Random* rnd, int len, std::string* dst); // Return a random key with the specified length that may contain interesting // characters (e.g. \x00, \xff, etc.). extern std::string RandomKey(Random* rnd, int len); // Store in *dst a string of length "len" that will compress to // "N*compressed_fraction" bytes and return a Slice that references // the generated data. extern Slice CompressibleString(Random* rnd, double compressed_fraction, size_t len, std::string* dst); // A wrapper that allows injection of errors. class ErrorEnv : public EnvWrapper { public: bool writable_file_error_; int num_writable_file_errors_; ErrorEnv() : EnvWrapper(Env::Default()), writable_file_error_(false), num_writable_file_errors_(0) { } virtual Status NewWritableFile(const std::string& fname, WritableFile** result) { if (writable_file_error_) { ++num_writable_file_errors_; *result = NULL; return Status::IOError(fname, "fake error"); } return target()->NewWritableFile(fname, result); } }; } // namespace test } // namespace leveldb #endif // STORAGE_LEVELDB_UTIL_TESTUTIL_H_ armory-0.92.3/cppForSwig/leveldb/util/cache_test.cc0000644000000000000000000001111712414772654020717 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/cache.h" #include #include "util/coding.h" #include "util/testharness.h" namespace leveldb { // Conversions between numeric keys/values and the types expected by Cache. static std::string EncodeKey(int k) { std::string result; PutFixed32(&result, k); return result; } static int DecodeKey(const Slice& k) { assert(k.size() == 4); return DecodeFixed32(k.data()); } static void* EncodeValue(uintptr_t v) { return reinterpret_cast(v); } static int DecodeValue(void* v) { return reinterpret_cast(v); } class CacheTest { public: static CacheTest* current_; static void Deleter(const Slice& key, void* v) { current_->deleted_keys_.push_back(DecodeKey(key)); current_->deleted_values_.push_back(DecodeValue(v)); } static const int kCacheSize = 1000; std::vector deleted_keys_; std::vector deleted_values_; Cache* cache_; CacheTest() : cache_(NewLRUCache(kCacheSize)) { current_ = this; } ~CacheTest() { delete cache_; } int Lookup(int key) { Cache::Handle* handle = cache_->Lookup(EncodeKey(key)); const int r = (handle == NULL) ? -1 : DecodeValue(cache_->Value(handle)); if (handle != NULL) { cache_->Release(handle); } return r; } void Insert(int key, int value, int charge = 1) { cache_->Release(cache_->Insert(EncodeKey(key), EncodeValue(value), charge, &CacheTest::Deleter)); } void Erase(int key) { cache_->Erase(EncodeKey(key)); } }; CacheTest* CacheTest::current_; TEST(CacheTest, HitAndMiss) { ASSERT_EQ(-1, Lookup(100)); Insert(100, 101); ASSERT_EQ(101, Lookup(100)); ASSERT_EQ(-1, Lookup(200)); ASSERT_EQ(-1, Lookup(300)); Insert(200, 201); ASSERT_EQ(101, Lookup(100)); ASSERT_EQ(201, Lookup(200)); ASSERT_EQ(-1, Lookup(300)); Insert(100, 102); ASSERT_EQ(102, Lookup(100)); ASSERT_EQ(201, Lookup(200)); ASSERT_EQ(-1, Lookup(300)); ASSERT_EQ(1, deleted_keys_.size()); ASSERT_EQ(100, deleted_keys_[0]); ASSERT_EQ(101, deleted_values_[0]); } TEST(CacheTest, Erase) { Erase(200); ASSERT_EQ(0, deleted_keys_.size()); Insert(100, 101); Insert(200, 201); Erase(100); ASSERT_EQ(-1, Lookup(100)); ASSERT_EQ(201, Lookup(200)); ASSERT_EQ(1, deleted_keys_.size()); ASSERT_EQ(100, deleted_keys_[0]); ASSERT_EQ(101, deleted_values_[0]); Erase(100); ASSERT_EQ(-1, Lookup(100)); ASSERT_EQ(201, Lookup(200)); ASSERT_EQ(1, deleted_keys_.size()); } TEST(CacheTest, EntriesArePinned) { Insert(100, 101); Cache::Handle* h1 = cache_->Lookup(EncodeKey(100)); ASSERT_EQ(101, DecodeValue(cache_->Value(h1))); Insert(100, 102); Cache::Handle* h2 = cache_->Lookup(EncodeKey(100)); ASSERT_EQ(102, DecodeValue(cache_->Value(h2))); ASSERT_EQ(0, deleted_keys_.size()); cache_->Release(h1); ASSERT_EQ(1, deleted_keys_.size()); ASSERT_EQ(100, deleted_keys_[0]); ASSERT_EQ(101, deleted_values_[0]); Erase(100); ASSERT_EQ(-1, Lookup(100)); ASSERT_EQ(1, deleted_keys_.size()); cache_->Release(h2); ASSERT_EQ(2, deleted_keys_.size()); ASSERT_EQ(100, deleted_keys_[1]); ASSERT_EQ(102, deleted_values_[1]); } TEST(CacheTest, EvictionPolicy) { Insert(100, 101); Insert(200, 201); // Frequently used entry must be kept around for (int i = 0; i < kCacheSize + 100; i++) { Insert(1000+i, 2000+i); ASSERT_EQ(2000+i, Lookup(1000+i)); ASSERT_EQ(101, Lookup(100)); } ASSERT_EQ(101, Lookup(100)); ASSERT_EQ(-1, Lookup(200)); } TEST(CacheTest, HeavyEntries) { // Add a bunch of light and heavy entries and then count the combined // size of items still in the cache, which must be approximately the // same as the total capacity. const int kLight = 1; const int kHeavy = 10; int added = 0; int index = 0; while (added < 2*kCacheSize) { const int weight = (index & 1) ? kLight : kHeavy; Insert(index, 1000+index, weight); added += weight; index++; } int cached_weight = 0; for (int i = 0; i < index; i++) { const int weight = (i & 1 ? kLight : kHeavy); int r = Lookup(i); if (r >= 0) { cached_weight += weight; ASSERT_EQ(1000+i, r); } } ASSERT_LE(cached_weight, kCacheSize + kCacheSize/10); } TEST(CacheTest, NewId) { uint64_t a = cache_->NewId(); uint64_t b = cache_->NewId(); ASSERT_NE(a, b); } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/util/bloom_test.cc0000644000000000000000000000731412414772654020770 0ustar rootroot// Copyright (c) 2012 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/filter_policy.h" #include "util/coding.h" #include "util/logging.h" #include "util/testharness.h" #include "util/testutil.h" namespace leveldb { static const int kVerbose = 1; static Slice Key(int i, char* buffer) { EncodeFixed32(buffer, i); return Slice(buffer, sizeof(uint32_t)); } class BloomTest { private: const FilterPolicy* policy_; std::string filter_; std::vector keys_; public: BloomTest() : policy_(NewBloomFilterPolicy(10)) { } ~BloomTest() { delete policy_; } void Reset() { keys_.clear(); filter_.clear(); } void Add(const Slice& s) { keys_.push_back(s.ToString()); } void Build() { std::vector key_slices; for (size_t i = 0; i < keys_.size(); i++) { key_slices.push_back(Slice(keys_[i])); } filter_.clear(); policy_->CreateFilter(&key_slices[0], key_slices.size(), &filter_); keys_.clear(); if (kVerbose >= 2) DumpFilter(); } size_t FilterSize() const { return filter_.size(); } void DumpFilter() { fprintf(stderr, "F("); for (size_t i = 0; i+1 < filter_.size(); i++) { const unsigned int c = static_cast(filter_[i]); for (int j = 0; j < 8; j++) { fprintf(stderr, "%c", (c & (1 <KeyMayMatch(s, filter_); } double FalsePositiveRate() { char buffer[sizeof(int)]; int result = 0; for (int i = 0; i < 10000; i++) { if (Matches(Key(i + 1000000000, buffer))) { result++; } } return result / 10000.0; } }; TEST(BloomTest, EmptyFilter) { ASSERT_TRUE(! Matches("hello")); ASSERT_TRUE(! Matches("world")); } TEST(BloomTest, Small) { Add("hello"); Add("world"); ASSERT_TRUE(Matches("hello")); ASSERT_TRUE(Matches("world")); ASSERT_TRUE(! Matches("x")); ASSERT_TRUE(! Matches("foo")); } static int NextLength(int length) { if (length < 10) { length += 1; } else if (length < 100) { length += 10; } else if (length < 1000) { length += 100; } else { length += 1000; } return length; } TEST(BloomTest, VaryingLengths) { char buffer[sizeof(int)]; // Count number of filters that significantly exceed the false positive rate int mediocre_filters = 0; int good_filters = 0; for (int length = 1; length <= 10000; length = NextLength(length)) { Reset(); for (int i = 0; i < length; i++) { Add(Key(i, buffer)); } Build(); ASSERT_LE(FilterSize(), static_cast((length * 10 / 8) + 40)) << length; // All added keys must match for (int i = 0; i < length; i++) { ASSERT_TRUE(Matches(Key(i, buffer))) << "Length " << length << "; key " << i; } // Check false positive rate double rate = FalsePositiveRate(); if (kVerbose >= 1) { fprintf(stderr, "False positives: %5.2f%% @ length = %6d ; bytes = %6d\n", rate*100.0, length, static_cast(FilterSize())); } ASSERT_LE(rate, 0.02); // Must not be over 2% if (rate > 0.0125) mediocre_filters++; // Allowed, but not too often else good_filters++; } if (kVerbose >= 1) { fprintf(stderr, "Filters: %d good, %d mediocre\n", good_filters, mediocre_filters); } ASSERT_LE(mediocre_filters, good_filters/5); } // Different bits-per-byte } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/util/comparator.cc0000644000000000000000000000421012414772654020760 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include #include #include "leveldb/comparator.h" #include "leveldb/slice.h" #include "port/port.h" #include "util/logging.h" namespace leveldb { Comparator::~Comparator() { } namespace { class BytewiseComparatorImpl : public Comparator { public: BytewiseComparatorImpl() { } virtual const char* Name() const { return "leveldb.BytewiseComparator"; } virtual int Compare(const Slice& a, const Slice& b) const { return a.compare(b); } virtual void FindShortestSeparator( std::string* start, const Slice& limit) const { // Find length of common prefix size_t min_length = std::min(start->size(), limit.size()); size_t diff_index = 0; while ((diff_index < min_length) && ((*start)[diff_index] == limit[diff_index])) { diff_index++; } if (diff_index >= min_length) { // Do not shorten if one string is a prefix of the other } else { uint8_t diff_byte = static_cast((*start)[diff_index]); if (diff_byte < static_cast(0xff) && diff_byte + 1 < static_cast(limit[diff_index])) { (*start)[diff_index]++; start->resize(diff_index + 1); assert(Compare(*start, limit) < 0); } } } virtual void FindShortSuccessor(std::string* key) const { // Find first character that can be incremented size_t n = key->size(); for (size_t i = 0; i < n; i++) { const uint8_t byte = (*key)[i]; if (byte != static_cast(0xff)) { (*key)[i] = byte + 1; key->resize(i+1); return; } } // *key is a run of 0xffs. Leave it alone. } }; } // namespace static port::OnceType once = LEVELDB_ONCE_INIT; static const Comparator* bytewise; static void InitModule() { bytewise = new BytewiseComparatorImpl; } const Comparator* BytewiseComparator() { port::InitOnce(&once, InitModule); return bytewise; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/util/histogram.h0000644000000000000000000000163512414772654020460 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_UTIL_HISTOGRAM_H_ #define STORAGE_LEVELDB_UTIL_HISTOGRAM_H_ #include namespace leveldb { class Histogram { public: Histogram() { } ~Histogram() { } void Clear(); void Add(double value); void Merge(const Histogram& other); std::string ToString() const; private: double min_; double max_; double num_; double sum_; double sum_squares_; enum { kNumBuckets = 154 }; static const double kBucketLimit[kNumBuckets]; double buckets_[kNumBuckets]; double Median() const; double Percentile(double p) const; double Average() const; double StandardDeviation() const; }; } // namespace leveldb #endif // STORAGE_LEVELDB_UTIL_HISTOGRAM_H_ armory-0.92.3/cppForSwig/leveldb/db/0000755000000000000000000000000012414772654015715 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb/db/version_set_test.cc0000644000000000000000000001235112414772654021625 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/version_set.h" #include "util/logging.h" #include "util/testharness.h" #include "util/testutil.h" namespace leveldb { class FindFileTest { public: std::vector files_; bool disjoint_sorted_files_; FindFileTest() : disjoint_sorted_files_(true) { } ~FindFileTest() { for (int i = 0; i < files_.size(); i++) { delete files_[i]; } } void Add(const char* smallest, const char* largest, SequenceNumber smallest_seq = 100, SequenceNumber largest_seq = 100) { FileMetaData* f = new FileMetaData; f->number = files_.size() + 1; f->smallest = InternalKey(smallest, smallest_seq, kTypeValue); f->largest = InternalKey(largest, largest_seq, kTypeValue); files_.push_back(f); } int Find(const char* key) { InternalKey target(key, 100, kTypeValue); InternalKeyComparator cmp(BytewiseComparator()); return FindFile(cmp, files_, target.Encode()); } bool Overlaps(const char* smallest, const char* largest) { InternalKeyComparator cmp(BytewiseComparator()); Slice s(smallest != NULL ? smallest : ""); Slice l(largest != NULL ? largest : ""); return SomeFileOverlapsRange(cmp, disjoint_sorted_files_, files_, (smallest != NULL ? &s : NULL), (largest != NULL ? &l : NULL)); } }; TEST(FindFileTest, Empty) { ASSERT_EQ(0, Find("foo")); ASSERT_TRUE(! Overlaps("a", "z")); ASSERT_TRUE(! Overlaps(NULL, "z")); ASSERT_TRUE(! Overlaps("a", NULL)); ASSERT_TRUE(! Overlaps(NULL, NULL)); } TEST(FindFileTest, Single) { Add("p", "q"); ASSERT_EQ(0, Find("a")); ASSERT_EQ(0, Find("p")); ASSERT_EQ(0, Find("p1")); ASSERT_EQ(0, Find("q")); ASSERT_EQ(1, Find("q1")); ASSERT_EQ(1, Find("z")); ASSERT_TRUE(! Overlaps("a", "b")); ASSERT_TRUE(! Overlaps("z1", "z2")); ASSERT_TRUE(Overlaps("a", "p")); ASSERT_TRUE(Overlaps("a", "q")); ASSERT_TRUE(Overlaps("a", "z")); ASSERT_TRUE(Overlaps("p", "p1")); ASSERT_TRUE(Overlaps("p", "q")); ASSERT_TRUE(Overlaps("p", "z")); ASSERT_TRUE(Overlaps("p1", "p2")); ASSERT_TRUE(Overlaps("p1", "z")); ASSERT_TRUE(Overlaps("q", "q")); ASSERT_TRUE(Overlaps("q", "q1")); ASSERT_TRUE(! Overlaps(NULL, "j")); ASSERT_TRUE(! Overlaps("r", NULL)); ASSERT_TRUE(Overlaps(NULL, "p")); ASSERT_TRUE(Overlaps(NULL, "p1")); ASSERT_TRUE(Overlaps("q", NULL)); ASSERT_TRUE(Overlaps(NULL, NULL)); } TEST(FindFileTest, Multiple) { Add("150", "200"); Add("200", "250"); Add("300", "350"); Add("400", "450"); ASSERT_EQ(0, Find("100")); ASSERT_EQ(0, Find("150")); ASSERT_EQ(0, Find("151")); ASSERT_EQ(0, Find("199")); ASSERT_EQ(0, Find("200")); ASSERT_EQ(1, Find("201")); ASSERT_EQ(1, Find("249")); ASSERT_EQ(1, Find("250")); ASSERT_EQ(2, Find("251")); ASSERT_EQ(2, Find("299")); ASSERT_EQ(2, Find("300")); ASSERT_EQ(2, Find("349")); ASSERT_EQ(2, Find("350")); ASSERT_EQ(3, Find("351")); ASSERT_EQ(3, Find("400")); ASSERT_EQ(3, Find("450")); ASSERT_EQ(4, Find("451")); ASSERT_TRUE(! Overlaps("100", "149")); ASSERT_TRUE(! Overlaps("251", "299")); ASSERT_TRUE(! Overlaps("451", "500")); ASSERT_TRUE(! Overlaps("351", "399")); ASSERT_TRUE(Overlaps("100", "150")); ASSERT_TRUE(Overlaps("100", "200")); ASSERT_TRUE(Overlaps("100", "300")); ASSERT_TRUE(Overlaps("100", "400")); ASSERT_TRUE(Overlaps("100", "500")); ASSERT_TRUE(Overlaps("375", "400")); ASSERT_TRUE(Overlaps("450", "450")); ASSERT_TRUE(Overlaps("450", "500")); } TEST(FindFileTest, MultipleNullBoundaries) { Add("150", "200"); Add("200", "250"); Add("300", "350"); Add("400", "450"); ASSERT_TRUE(! Overlaps(NULL, "149")); ASSERT_TRUE(! Overlaps("451", NULL)); ASSERT_TRUE(Overlaps(NULL, NULL)); ASSERT_TRUE(Overlaps(NULL, "150")); ASSERT_TRUE(Overlaps(NULL, "199")); ASSERT_TRUE(Overlaps(NULL, "200")); ASSERT_TRUE(Overlaps(NULL, "201")); ASSERT_TRUE(Overlaps(NULL, "400")); ASSERT_TRUE(Overlaps(NULL, "800")); ASSERT_TRUE(Overlaps("100", NULL)); ASSERT_TRUE(Overlaps("200", NULL)); ASSERT_TRUE(Overlaps("449", NULL)); ASSERT_TRUE(Overlaps("450", NULL)); } TEST(FindFileTest, OverlapSequenceChecks) { Add("200", "200", 5000, 3000); ASSERT_TRUE(! Overlaps("199", "199")); ASSERT_TRUE(! Overlaps("201", "300")); ASSERT_TRUE(Overlaps("200", "200")); ASSERT_TRUE(Overlaps("190", "200")); ASSERT_TRUE(Overlaps("200", "210")); } TEST(FindFileTest, OverlappingFiles) { Add("150", "600"); Add("400", "500"); disjoint_sorted_files_ = false; ASSERT_TRUE(! Overlaps("100", "149")); ASSERT_TRUE(! Overlaps("601", "700")); ASSERT_TRUE(Overlaps("100", "150")); ASSERT_TRUE(Overlaps("100", "200")); ASSERT_TRUE(Overlaps("100", "300")); ASSERT_TRUE(Overlaps("100", "400")); ASSERT_TRUE(Overlaps("100", "500")); ASSERT_TRUE(Overlaps("375", "400")); ASSERT_TRUE(Overlaps("450", "450")); ASSERT_TRUE(Overlaps("450", "500")); ASSERT_TRUE(Overlaps("450", "700")); ASSERT_TRUE(Overlaps("600", "700")); } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/db/log_test.cc0000644000000000000000000003142612414772654020052 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/log_reader.h" #include "db/log_writer.h" #include "leveldb/env.h" #include "util/coding.h" #include "util/crc32c.h" #include "util/random.h" #include "util/testharness.h" namespace leveldb { namespace log { // Construct a string of the specified length made out of the supplied // partial string. static std::string BigString(const std::string& partial_string, size_t n) { std::string result; while (result.size() < n) { result.append(partial_string); } result.resize(n); return result; } // Construct a string from a number static std::string NumberString(int n) { char buf[50]; snprintf(buf, sizeof(buf), "%d.", n); return std::string(buf); } // Return a skewed potentially long string static std::string RandomSkewedString(int i, Random* rnd) { return BigString(NumberString(i), rnd->Skewed(17)); } class LogTest { private: class StringDest : public WritableFile { public: std::string contents_; virtual Status Close() { return Status::OK(); } virtual Status Flush() { return Status::OK(); } virtual Status Sync() { return Status::OK(); } virtual Status Append(const Slice& slice) { contents_.append(slice.data(), slice.size()); return Status::OK(); } }; class StringSource : public SequentialFile { public: Slice contents_; bool force_error_; bool returned_partial_; StringSource() : force_error_(false), returned_partial_(false) { } virtual Status Read(size_t n, Slice* result, char* scratch) { ASSERT_TRUE(!returned_partial_) << "must not Read() after eof/error"; if (force_error_) { force_error_ = false; returned_partial_ = true; return Status::Corruption("read error"); } if (contents_.size() < n) { n = contents_.size(); returned_partial_ = true; } *result = Slice(contents_.data(), n); contents_.remove_prefix(n); return Status::OK(); } virtual Status Skip(uint64_t n) { if (n > contents_.size()) { contents_.clear(); return Status::NotFound("in-memory file skipepd past end"); } contents_.remove_prefix(n); return Status::OK(); } }; class ReportCollector : public Reader::Reporter { public: size_t dropped_bytes_; std::string message_; ReportCollector() : dropped_bytes_(0) { } virtual void Corruption(size_t bytes, const Status& status) { dropped_bytes_ += bytes; message_.append(status.ToString()); } }; StringDest dest_; StringSource source_; ReportCollector report_; bool reading_; Writer writer_; Reader reader_; // Record metadata for testing initial offset functionality static size_t initial_offset_record_sizes_[]; static uint64_t initial_offset_last_record_offsets_[]; public: LogTest() : reading_(false), writer_(&dest_), reader_(&source_, &report_, true/*checksum*/, 0/*initial_offset*/) { } void Write(const std::string& msg) { ASSERT_TRUE(!reading_) << "Write() after starting to read"; writer_.AddRecord(Slice(msg)); } size_t WrittenBytes() const { return dest_.contents_.size(); } std::string Read() { if (!reading_) { reading_ = true; source_.contents_ = Slice(dest_.contents_); } std::string scratch; Slice record; if (reader_.ReadRecord(&record, &scratch)) { return record.ToString(); } else { return "EOF"; } } void IncrementByte(int offset, int delta) { dest_.contents_[offset] += delta; } void SetByte(int offset, char new_byte) { dest_.contents_[offset] = new_byte; } void ShrinkSize(int bytes) { dest_.contents_.resize(dest_.contents_.size() - bytes); } void FixChecksum(int header_offset, int len) { // Compute crc of type/len/data uint32_t crc = crc32c::Value(&dest_.contents_[header_offset+6], 1 + len); crc = crc32c::Mask(crc); EncodeFixed32(&dest_.contents_[header_offset], crc); } void ForceError() { source_.force_error_ = true; } size_t DroppedBytes() const { return report_.dropped_bytes_; } std::string ReportMessage() const { return report_.message_; } // Returns OK iff recorded error message contains "msg" std::string MatchError(const std::string& msg) const { if (report_.message_.find(msg) == std::string::npos) { return report_.message_; } else { return "OK"; } } void WriteInitialOffsetLog() { for (int i = 0; i < 4; i++) { std::string record(initial_offset_record_sizes_[i], static_cast('a' + i)); Write(record); } } void CheckOffsetPastEndReturnsNoRecords(uint64_t offset_past_end) { WriteInitialOffsetLog(); reading_ = true; source_.contents_ = Slice(dest_.contents_); Reader* offset_reader = new Reader(&source_, &report_, true/*checksum*/, WrittenBytes() + offset_past_end); Slice record; std::string scratch; ASSERT_TRUE(!offset_reader->ReadRecord(&record, &scratch)); delete offset_reader; } void CheckInitialOffsetRecord(uint64_t initial_offset, int expected_record_offset) { WriteInitialOffsetLog(); reading_ = true; source_.contents_ = Slice(dest_.contents_); Reader* offset_reader = new Reader(&source_, &report_, true/*checksum*/, initial_offset); Slice record; std::string scratch; ASSERT_TRUE(offset_reader->ReadRecord(&record, &scratch)); ASSERT_EQ(initial_offset_record_sizes_[expected_record_offset], record.size()); ASSERT_EQ(initial_offset_last_record_offsets_[expected_record_offset], offset_reader->LastRecordOffset()); ASSERT_EQ((char)('a' + expected_record_offset), record.data()[0]); delete offset_reader; } }; size_t LogTest::initial_offset_record_sizes_[] = {10000, // Two sizable records in first block 10000, 2 * log::kBlockSize - 1000, // Span three blocks 1}; uint64_t LogTest::initial_offset_last_record_offsets_[] = {0, kHeaderSize + 10000, 2 * (kHeaderSize + 10000), 2 * (kHeaderSize + 10000) + (2 * log::kBlockSize - 1000) + 3 * kHeaderSize}; TEST(LogTest, Empty) { ASSERT_EQ("EOF", Read()); } TEST(LogTest, ReadWrite) { Write("foo"); Write("bar"); Write(""); Write("xxxx"); ASSERT_EQ("foo", Read()); ASSERT_EQ("bar", Read()); ASSERT_EQ("", Read()); ASSERT_EQ("xxxx", Read()); ASSERT_EQ("EOF", Read()); ASSERT_EQ("EOF", Read()); // Make sure reads at eof work } TEST(LogTest, ManyBlocks) { for (int i = 0; i < 100000; i++) { Write(NumberString(i)); } for (int i = 0; i < 100000; i++) { ASSERT_EQ(NumberString(i), Read()); } ASSERT_EQ("EOF", Read()); } TEST(LogTest, Fragmentation) { Write("small"); Write(BigString("medium", 50000)); Write(BigString("large", 100000)); ASSERT_EQ("small", Read()); ASSERT_EQ(BigString("medium", 50000), Read()); ASSERT_EQ(BigString("large", 100000), Read()); ASSERT_EQ("EOF", Read()); } TEST(LogTest, MarginalTrailer) { // Make a trailer that is exactly the same length as an empty record. const int n = kBlockSize - 2*kHeaderSize; Write(BigString("foo", n)); ASSERT_EQ(kBlockSize - kHeaderSize, WrittenBytes()); Write(""); Write("bar"); ASSERT_EQ(BigString("foo", n), Read()); ASSERT_EQ("", Read()); ASSERT_EQ("bar", Read()); ASSERT_EQ("EOF", Read()); } TEST(LogTest, MarginalTrailer2) { // Make a trailer that is exactly the same length as an empty record. const int n = kBlockSize - 2*kHeaderSize; Write(BigString("foo", n)); ASSERT_EQ(kBlockSize - kHeaderSize, WrittenBytes()); Write("bar"); ASSERT_EQ(BigString("foo", n), Read()); ASSERT_EQ("bar", Read()); ASSERT_EQ("EOF", Read()); ASSERT_EQ(0, DroppedBytes()); ASSERT_EQ("", ReportMessage()); } TEST(LogTest, ShortTrailer) { const int n = kBlockSize - 2*kHeaderSize + 4; Write(BigString("foo", n)); ASSERT_EQ(kBlockSize - kHeaderSize + 4, WrittenBytes()); Write(""); Write("bar"); ASSERT_EQ(BigString("foo", n), Read()); ASSERT_EQ("", Read()); ASSERT_EQ("bar", Read()); ASSERT_EQ("EOF", Read()); } TEST(LogTest, AlignedEof) { const int n = kBlockSize - 2*kHeaderSize + 4; Write(BigString("foo", n)); ASSERT_EQ(kBlockSize - kHeaderSize + 4, WrittenBytes()); ASSERT_EQ(BigString("foo", n), Read()); ASSERT_EQ("EOF", Read()); } TEST(LogTest, RandomRead) { const int N = 500; Random write_rnd(301); for (int i = 0; i < N; i++) { Write(RandomSkewedString(i, &write_rnd)); } Random read_rnd(301); for (int i = 0; i < N; i++) { ASSERT_EQ(RandomSkewedString(i, &read_rnd), Read()); } ASSERT_EQ("EOF", Read()); } // Tests of all the error paths in log_reader.cc follow: TEST(LogTest, ReadError) { Write("foo"); ForceError(); ASSERT_EQ("EOF", Read()); ASSERT_EQ(kBlockSize, DroppedBytes()); ASSERT_EQ("OK", MatchError("read error")); } TEST(LogTest, BadRecordType) { Write("foo"); // Type is stored in header[6] IncrementByte(6, 100); FixChecksum(0, 3); ASSERT_EQ("EOF", Read()); ASSERT_EQ(3, DroppedBytes()); ASSERT_EQ("OK", MatchError("unknown record type")); } TEST(LogTest, TruncatedTrailingRecord) { Write("foo"); ShrinkSize(4); // Drop all payload as well as a header byte ASSERT_EQ("EOF", Read()); ASSERT_EQ(kHeaderSize - 1, DroppedBytes()); ASSERT_EQ("OK", MatchError("truncated record at end of file")); } TEST(LogTest, BadLength) { Write("foo"); ShrinkSize(1); ASSERT_EQ("EOF", Read()); ASSERT_EQ(kHeaderSize + 2, DroppedBytes()); ASSERT_EQ("OK", MatchError("bad record length")); } TEST(LogTest, ChecksumMismatch) { Write("foo"); IncrementByte(0, 10); ASSERT_EQ("EOF", Read()); ASSERT_EQ(10, DroppedBytes()); ASSERT_EQ("OK", MatchError("checksum mismatch")); } TEST(LogTest, UnexpectedMiddleType) { Write("foo"); SetByte(6, kMiddleType); FixChecksum(0, 3); ASSERT_EQ("EOF", Read()); ASSERT_EQ(3, DroppedBytes()); ASSERT_EQ("OK", MatchError("missing start")); } TEST(LogTest, UnexpectedLastType) { Write("foo"); SetByte(6, kLastType); FixChecksum(0, 3); ASSERT_EQ("EOF", Read()); ASSERT_EQ(3, DroppedBytes()); ASSERT_EQ("OK", MatchError("missing start")); } TEST(LogTest, UnexpectedFullType) { Write("foo"); Write("bar"); SetByte(6, kFirstType); FixChecksum(0, 3); ASSERT_EQ("bar", Read()); ASSERT_EQ("EOF", Read()); ASSERT_EQ(3, DroppedBytes()); ASSERT_EQ("OK", MatchError("partial record without end")); } TEST(LogTest, UnexpectedFirstType) { Write("foo"); Write(BigString("bar", 100000)); SetByte(6, kFirstType); FixChecksum(0, 3); ASSERT_EQ(BigString("bar", 100000), Read()); ASSERT_EQ("EOF", Read()); ASSERT_EQ(3, DroppedBytes()); ASSERT_EQ("OK", MatchError("partial record without end")); } TEST(LogTest, ErrorJoinsRecords) { // Consider two fragmented records: // first(R1) last(R1) first(R2) last(R2) // where the middle two fragments disappear. We do not want // first(R1),last(R2) to get joined and returned as a valid record. // Write records that span two blocks Write(BigString("foo", kBlockSize)); Write(BigString("bar", kBlockSize)); Write("correct"); // Wipe the middle block for (int offset = kBlockSize; offset < 2*kBlockSize; offset++) { SetByte(offset, 'x'); } ASSERT_EQ("correct", Read()); ASSERT_EQ("EOF", Read()); const int dropped = DroppedBytes(); ASSERT_LE(dropped, 2*kBlockSize + 100); ASSERT_GE(dropped, 2*kBlockSize); } TEST(LogTest, ReadStart) { CheckInitialOffsetRecord(0, 0); } TEST(LogTest, ReadSecondOneOff) { CheckInitialOffsetRecord(1, 1); } TEST(LogTest, ReadSecondTenThousand) { CheckInitialOffsetRecord(10000, 1); } TEST(LogTest, ReadSecondStart) { CheckInitialOffsetRecord(10007, 1); } TEST(LogTest, ReadThirdOneOff) { CheckInitialOffsetRecord(10008, 2); } TEST(LogTest, ReadThirdStart) { CheckInitialOffsetRecord(20014, 2); } TEST(LogTest, ReadFourthOneOff) { CheckInitialOffsetRecord(20015, 3); } TEST(LogTest, ReadFourthFirstBlockTrailer) { CheckInitialOffsetRecord(log::kBlockSize - 4, 3); } TEST(LogTest, ReadFourthMiddleBlock) { CheckInitialOffsetRecord(log::kBlockSize + 1, 3); } TEST(LogTest, ReadFourthLastBlock) { CheckInitialOffsetRecord(2 * log::kBlockSize + 1, 3); } TEST(LogTest, ReadFourthStart) { CheckInitialOffsetRecord( 2 * (kHeaderSize + 1000) + (2 * log::kBlockSize - 1000) + 3 * kHeaderSize, 3); } TEST(LogTest, ReadEnd) { CheckOffsetPastEndReturnsNoRecords(0); } TEST(LogTest, ReadPastEnd) { CheckOffsetPastEndReturnsNoRecords(5); } } // namespace log } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/db/snapshot.h0000644000000000000000000000320212414772654017722 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_DB_SNAPSHOT_H_ #define STORAGE_LEVELDB_DB_SNAPSHOT_H_ #include "leveldb/db.h" namespace leveldb { class SnapshotList; // Snapshots are kept in a doubly-linked list in the DB. // Each SnapshotImpl corresponds to a particular sequence number. class SnapshotImpl : public Snapshot { public: SequenceNumber number_; // const after creation private: friend class SnapshotList; // SnapshotImpl is kept in a doubly-linked circular list SnapshotImpl* prev_; SnapshotImpl* next_; SnapshotList* list_; // just for sanity checks }; class SnapshotList { public: SnapshotList() { list_.prev_ = &list_; list_.next_ = &list_; } bool empty() const { return list_.next_ == &list_; } SnapshotImpl* oldest() const { assert(!empty()); return list_.next_; } SnapshotImpl* newest() const { assert(!empty()); return list_.prev_; } const SnapshotImpl* New(SequenceNumber seq) { SnapshotImpl* s = new SnapshotImpl; s->number_ = seq; s->list_ = this; s->next_ = &list_; s->prev_ = list_.prev_; s->prev_->next_ = s; s->next_->prev_ = s; return s; } void Delete(const SnapshotImpl* s) { assert(s->list_ == this); s->prev_->next_ = s->next_; s->next_->prev_ = s->prev_; delete s; } private: // Dummy head of doubly-linked list of snapshots SnapshotImpl list_; }; } // namespace leveldb #endif // STORAGE_LEVELDB_DB_SNAPSHOT_H_ armory-0.92.3/cppForSwig/leveldb/db/db_iter.cc0000644000000000000000000002053312414772654017637 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/db_iter.h" #include "db/filename.h" #include "db/db_impl.h" #include "db/dbformat.h" #include "leveldb/env.h" #include "leveldb/iterator.h" #include "port/port.h" #include "util/logging.h" #include "util/mutexlock.h" #include "util/random.h" namespace leveldb { #if 0 static void DumpInternalIter(Iterator* iter) { for (iter->SeekToFirst(); iter->Valid(); iter->Next()) { ParsedInternalKey k; if (!ParseInternalKey(iter->key(), &k)) { fprintf(stderr, "Corrupt '%s'\n", EscapeString(iter->key()).c_str()); } else { fprintf(stderr, "@ '%s'\n", k.DebugString().c_str()); } } } #endif namespace { // Memtables and sstables that make the DB representation contain // (userkey,seq,type) => uservalue entries. DBIter // combines multiple entries for the same userkey found in the DB // representation into a single entry while accounting for sequence // numbers, deletion markers, overwrites, etc. class DBIter: public Iterator { public: // Which direction is the iterator currently moving? // (1) When moving forward, the internal iterator is positioned at // the exact entry that yields this->key(), this->value() // (2) When moving backwards, the internal iterator is positioned // just before all entries whose user key == this->key(). enum Direction { kForward, kReverse }; DBIter(DBImpl* db, const Comparator* cmp, Iterator* iter, SequenceNumber s, uint32_t seed) : db_(db), user_comparator_(cmp), iter_(iter), sequence_(s), direction_(kForward), valid_(false), rnd_(seed), bytes_counter_(RandomPeriod()) { } virtual ~DBIter() { delete iter_; } virtual bool Valid() const { return valid_; } virtual Slice key() const { assert(valid_); return (direction_ == kForward) ? ExtractUserKey(iter_->key()) : saved_key_; } virtual Slice value() const { assert(valid_); return (direction_ == kForward) ? iter_->value() : saved_value_; } virtual Status status() const { if (status_.ok()) { return iter_->status(); } else { return status_; } } virtual void Next(); virtual void Prev(); virtual void Seek(const Slice& target); virtual void SeekToFirst(); virtual void SeekToLast(); private: void FindNextUserEntry(bool skipping, std::string* skip); void FindPrevUserEntry(); bool ParseKey(ParsedInternalKey* key); inline void SaveKey(const Slice& k, std::string* dst) { dst->assign(k.data(), k.size()); } inline void ClearSavedValue() { if (saved_value_.capacity() > 1048576) { std::string empty; swap(empty, saved_value_); } else { saved_value_.clear(); } } // Pick next gap with average value of config::kReadBytesPeriod. ssize_t RandomPeriod() { return rnd_.Uniform(2*config::kReadBytesPeriod); } DBImpl* db_; const Comparator* const user_comparator_; Iterator* const iter_; SequenceNumber const sequence_; Status status_; std::string saved_key_; // == current key when direction_==kReverse std::string saved_value_; // == current raw value when direction_==kReverse Direction direction_; bool valid_; Random rnd_; ssize_t bytes_counter_; // No copying allowed DBIter(const DBIter&); void operator=(const DBIter&); }; inline bool DBIter::ParseKey(ParsedInternalKey* ikey) { Slice k = iter_->key(); ssize_t n = k.size() + iter_->value().size(); bytes_counter_ -= n; while (bytes_counter_ < 0) { bytes_counter_ += RandomPeriod(); db_->RecordReadSample(k); } if (!ParseInternalKey(k, ikey)) { status_ = Status::Corruption("corrupted internal key in DBIter"); return false; } else { return true; } } void DBIter::Next() { assert(valid_); if (direction_ == kReverse) { // Switch directions? direction_ = kForward; // iter_ is pointing just before the entries for this->key(), // so advance into the range of entries for this->key() and then // use the normal skipping code below. if (!iter_->Valid()) { iter_->SeekToFirst(); } else { iter_->Next(); } if (!iter_->Valid()) { valid_ = false; saved_key_.clear(); return; } // saved_key_ already contains the key to skip past. } else { // Store in saved_key_ the current key so we skip it below. SaveKey(ExtractUserKey(iter_->key()), &saved_key_); } FindNextUserEntry(true, &saved_key_); } void DBIter::FindNextUserEntry(bool skipping, std::string* skip) { // Loop until we hit an acceptable entry to yield assert(iter_->Valid()); assert(direction_ == kForward); do { ParsedInternalKey ikey; if (ParseKey(&ikey) && ikey.sequence <= sequence_) { switch (ikey.type) { case kTypeDeletion: // Arrange to skip all upcoming entries for this key since // they are hidden by this deletion. SaveKey(ikey.user_key, skip); skipping = true; break; case kTypeValue: if (skipping && user_comparator_->Compare(ikey.user_key, *skip) <= 0) { // Entry hidden } else { valid_ = true; saved_key_.clear(); return; } break; } } iter_->Next(); } while (iter_->Valid()); saved_key_.clear(); valid_ = false; } void DBIter::Prev() { assert(valid_); if (direction_ == kForward) { // Switch directions? // iter_ is pointing at the current entry. Scan backwards until // the key changes so we can use the normal reverse scanning code. assert(iter_->Valid()); // Otherwise valid_ would have been false SaveKey(ExtractUserKey(iter_->key()), &saved_key_); while (true) { iter_->Prev(); if (!iter_->Valid()) { valid_ = false; saved_key_.clear(); ClearSavedValue(); return; } if (user_comparator_->Compare(ExtractUserKey(iter_->key()), saved_key_) < 0) { break; } } direction_ = kReverse; } FindPrevUserEntry(); } void DBIter::FindPrevUserEntry() { assert(direction_ == kReverse); ValueType value_type = kTypeDeletion; if (iter_->Valid()) { do { ParsedInternalKey ikey; if (ParseKey(&ikey) && ikey.sequence <= sequence_) { if ((value_type != kTypeDeletion) && user_comparator_->Compare(ikey.user_key, saved_key_) < 0) { // We encountered a non-deleted value in entries for previous keys, break; } value_type = ikey.type; if (value_type == kTypeDeletion) { saved_key_.clear(); ClearSavedValue(); } else { Slice raw_value = iter_->value(); if (saved_value_.capacity() > raw_value.size() + 1048576) { std::string empty; swap(empty, saved_value_); } SaveKey(ExtractUserKey(iter_->key()), &saved_key_); saved_value_.assign(raw_value.data(), raw_value.size()); } } iter_->Prev(); } while (iter_->Valid()); } if (value_type == kTypeDeletion) { // End valid_ = false; saved_key_.clear(); ClearSavedValue(); direction_ = kForward; } else { valid_ = true; } } void DBIter::Seek(const Slice& target) { direction_ = kForward; ClearSavedValue(); saved_key_.clear(); AppendInternalKey( &saved_key_, ParsedInternalKey(target, sequence_, kValueTypeForSeek)); iter_->Seek(saved_key_); if (iter_->Valid()) { FindNextUserEntry(false, &saved_key_ /* temporary storage */); } else { valid_ = false; } } void DBIter::SeekToFirst() { direction_ = kForward; ClearSavedValue(); iter_->SeekToFirst(); if (iter_->Valid()) { FindNextUserEntry(false, &saved_key_ /* temporary storage */); } else { valid_ = false; } } void DBIter::SeekToLast() { direction_ = kReverse; ClearSavedValue(); iter_->SeekToLast(); FindPrevUserEntry(); } } // anonymous namespace Iterator* NewDBIterator( DBImpl* db, const Comparator* user_key_comparator, Iterator* internal_iter, SequenceNumber sequence, uint32_t seed) { return new DBIter(db, user_key_comparator, internal_iter, sequence, seed); } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/skiplist_test.cc0000644000000000000000000002307412414772654021133 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/skiplist.h" #include #include "leveldb/env.h" #include "util/arena.h" #include "util/hash.h" #include "util/random.h" #include "util/testharness.h" namespace leveldb { typedef uint64_t Key; struct Comparator { int operator()(const Key& a, const Key& b) const { if (a < b) { return -1; } else if (a > b) { return +1; } else { return 0; } } }; class SkipTest { }; TEST(SkipTest, Empty) { Arena arena; Comparator cmp; SkipList list(cmp, &arena); ASSERT_TRUE(!list.Contains(10)); SkipList::Iterator iter(&list); ASSERT_TRUE(!iter.Valid()); iter.SeekToFirst(); ASSERT_TRUE(!iter.Valid()); iter.Seek(100); ASSERT_TRUE(!iter.Valid()); iter.SeekToLast(); ASSERT_TRUE(!iter.Valid()); } TEST(SkipTest, InsertAndLookup) { const int N = 2000; const int R = 5000; Random rnd(1000); std::set keys; Arena arena; Comparator cmp; SkipList list(cmp, &arena); for (int i = 0; i < N; i++) { Key key = rnd.Next() % R; if (keys.insert(key).second) { list.Insert(key); } } for (int i = 0; i < R; i++) { if (list.Contains(i)) { ASSERT_EQ(keys.count(i), 1); } else { ASSERT_EQ(keys.count(i), 0); } } // Simple iterator tests { SkipList::Iterator iter(&list); ASSERT_TRUE(!iter.Valid()); iter.Seek(0); ASSERT_TRUE(iter.Valid()); ASSERT_EQ(*(keys.begin()), iter.key()); iter.SeekToFirst(); ASSERT_TRUE(iter.Valid()); ASSERT_EQ(*(keys.begin()), iter.key()); iter.SeekToLast(); ASSERT_TRUE(iter.Valid()); ASSERT_EQ(*(keys.rbegin()), iter.key()); } // Forward iteration test for (int i = 0; i < R; i++) { SkipList::Iterator iter(&list); iter.Seek(i); // Compare against model iterator std::set::iterator model_iter = keys.lower_bound(i); for (int j = 0; j < 3; j++) { if (model_iter == keys.end()) { ASSERT_TRUE(!iter.Valid()); break; } else { ASSERT_TRUE(iter.Valid()); ASSERT_EQ(*model_iter, iter.key()); ++model_iter; iter.Next(); } } } // Backward iteration test { SkipList::Iterator iter(&list); iter.SeekToLast(); // Compare against model iterator for (std::set::reverse_iterator model_iter = keys.rbegin(); model_iter != keys.rend(); ++model_iter) { ASSERT_TRUE(iter.Valid()); ASSERT_EQ(*model_iter, iter.key()); iter.Prev(); } ASSERT_TRUE(!iter.Valid()); } } // We want to make sure that with a single writer and multiple // concurrent readers (with no synchronization other than when a // reader's iterator is created), the reader always observes all the // data that was present in the skip list when the iterator was // constructor. Because insertions are happening concurrently, we may // also observe new values that were inserted since the iterator was // constructed, but we should never miss any values that were present // at iterator construction time. // // We generate multi-part keys: // // where: // key is in range [0..K-1] // gen is a generation number for key // hash is hash(key,gen) // // The insertion code picks a random key, sets gen to be 1 + the last // generation number inserted for that key, and sets hash to Hash(key,gen). // // At the beginning of a read, we snapshot the last inserted // generation number for each key. We then iterate, including random // calls to Next() and Seek(). For every key we encounter, we // check that it is either expected given the initial snapshot or has // been concurrently added since the iterator started. class ConcurrentTest { private: static const uint32_t K = 4; static uint64_t key(Key key) { return (key >> 40); } static uint64_t gen(Key key) { return (key >> 8) & 0xffffffffu; } static uint64_t hash(Key key) { return key & 0xff; } static uint64_t HashNumbers(uint64_t k, uint64_t g) { uint64_t data[2] = { k, g }; return Hash(reinterpret_cast(data), sizeof(data), 0); } static Key MakeKey(uint64_t k, uint64_t g) { assert(sizeof(Key) == sizeof(uint64_t)); assert(k <= K); // We sometimes pass K to seek to the end of the skiplist assert(g <= 0xffffffffu); return ((k << 40) | (g << 8) | (HashNumbers(k, g) & 0xff)); } static bool IsValidKey(Key k) { return hash(k) == (HashNumbers(key(k), gen(k)) & 0xff); } static Key RandomTarget(Random* rnd) { switch (rnd->Next() % 10) { case 0: // Seek to beginning return MakeKey(0, 0); case 1: // Seek to end return MakeKey(K, 0); default: // Seek to middle return MakeKey(rnd->Next() % K, 0); } } // Per-key generation struct State { port::AtomicPointer generation[K]; void Set(int k, intptr_t v) { generation[k].Release_Store(reinterpret_cast(v)); } intptr_t Get(int k) { return reinterpret_cast(generation[k].Acquire_Load()); } State() { for (int k = 0; k < K; k++) { Set(k, 0); } } }; // Current state of the test State current_; Arena arena_; // SkipList is not protected by mu_. We just use a single writer // thread to modify it. SkipList list_; public: ConcurrentTest() : list_(Comparator(), &arena_) { } // REQUIRES: External synchronization void WriteStep(Random* rnd) { const uint32_t k = rnd->Next() % K; const intptr_t g = current_.Get(k) + 1; const Key key = MakeKey(k, g); list_.Insert(key); current_.Set(k, g); } void ReadStep(Random* rnd) { // Remember the initial committed state of the skiplist. State initial_state; for (int k = 0; k < K; k++) { initial_state.Set(k, current_.Get(k)); } Key pos = RandomTarget(rnd); SkipList::Iterator iter(&list_); iter.Seek(pos); while (true) { Key current; if (!iter.Valid()) { current = MakeKey(K, 0); } else { current = iter.key(); ASSERT_TRUE(IsValidKey(current)) << current; } ASSERT_LE(pos, current) << "should not go backwards"; // Verify that everything in [pos,current) was not present in // initial_state. while (pos < current) { ASSERT_LT(key(pos), K) << pos; // Note that generation 0 is never inserted, so it is ok if // <*,0,*> is missing. ASSERT_TRUE((gen(pos) == 0) || (gen(pos) > initial_state.Get(key(pos))) ) << "key: " << key(pos) << "; gen: " << gen(pos) << "; initgen: " << initial_state.Get(key(pos)); // Advance to next key in the valid key space if (key(pos) < key(current)) { pos = MakeKey(key(pos) + 1, 0); } else { pos = MakeKey(key(pos), gen(pos) + 1); } } if (!iter.Valid()) { break; } if (rnd->Next() % 2) { iter.Next(); pos = MakeKey(key(pos), gen(pos) + 1); } else { Key new_target = RandomTarget(rnd); if (new_target > pos) { pos = new_target; iter.Seek(new_target); } } } } }; const uint32_t ConcurrentTest::K; // Simple test that does single-threaded testing of the ConcurrentTest // scaffolding. TEST(SkipTest, ConcurrentWithoutThreads) { ConcurrentTest test; Random rnd(test::RandomSeed()); for (int i = 0; i < 10000; i++) { test.ReadStep(&rnd); test.WriteStep(&rnd); } } class TestState { public: ConcurrentTest t_; int seed_; port::AtomicPointer quit_flag_; enum ReaderState { STARTING, RUNNING, DONE }; explicit TestState(int s) : seed_(s), quit_flag_(NULL), state_(STARTING), state_cv_(&mu_) {} void Wait(ReaderState s) { mu_.Lock(); while (state_ != s) { state_cv_.Wait(); } mu_.Unlock(); } void Change(ReaderState s) { mu_.Lock(); state_ = s; state_cv_.Signal(); mu_.Unlock(); } private: port::Mutex mu_; ReaderState state_; port::CondVar state_cv_; }; static void ConcurrentReader(void* arg) { TestState* state = reinterpret_cast(arg); Random rnd(state->seed_); int64_t reads = 0; state->Change(TestState::RUNNING); while (!state->quit_flag_.Acquire_Load()) { state->t_.ReadStep(&rnd); ++reads; } state->Change(TestState::DONE); } static void RunConcurrent(int run) { const int seed = test::RandomSeed() + (run * 100); Random rnd(seed); const int N = 1000; const int kSize = 1000; for (int i = 0; i < N; i++) { if ((i % 100) == 0) { fprintf(stderr, "Run %d of %d\n", i, N); } TestState state(seed + 1); Env::Default()->Schedule(ConcurrentReader, &state); state.Wait(TestState::RUNNING); for (int i = 0; i < kSize; i++) { state.t_.WriteStep(&rnd); } state.quit_flag_.Release_Store(&state); // Any non-NULL arg will do state.Wait(TestState::DONE); } } TEST(SkipTest, Concurrent1) { RunConcurrent(1); } TEST(SkipTest, Concurrent2) { RunConcurrent(2); } TEST(SkipTest, Concurrent3) { RunConcurrent(3); } TEST(SkipTest, Concurrent4) { RunConcurrent(4); } TEST(SkipTest, Concurrent5) { RunConcurrent(5); } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/db/table_cache.cc0000644000000000000000000000710512414772654020441 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/table_cache.h" #include "db/filename.h" #include "leveldb/env.h" #include "leveldb/table.h" #include "util/coding.h" namespace leveldb { struct TableAndFile { RandomAccessFile* file; Table* table; }; static void DeleteEntry(const Slice& key, void* value) { TableAndFile* tf = reinterpret_cast(value); delete tf->table; delete tf->file; delete tf; } static void UnrefEntry(void* arg1, void* arg2) { Cache* cache = reinterpret_cast(arg1); Cache::Handle* h = reinterpret_cast(arg2); cache->Release(h); } TableCache::TableCache(const std::string& dbname, const Options* options, int entries) : env_(options->env), dbname_(dbname), options_(options), cache_(NewLRUCache(entries)) { } TableCache::~TableCache() { delete cache_; } Status TableCache::FindTable(uint64_t file_number, uint64_t file_size, Cache::Handle** handle) { Status s; char buf[sizeof(file_number)]; EncodeFixed64(buf, file_number); Slice key(buf, sizeof(buf)); *handle = cache_->Lookup(key); if (*handle == NULL) { std::string fname = TableFileName(dbname_, file_number); RandomAccessFile* file = NULL; Table* table = NULL; s = env_->NewRandomAccessFile(fname, &file); if (!s.ok()) { std::string old_fname = SSTTableFileName(dbname_, file_number); if (env_->NewRandomAccessFile(old_fname, &file).ok()) { s = Status::OK(); } } if (s.ok()) { s = Table::Open(*options_, file, file_size, &table); } if (!s.ok()) { assert(table == NULL); delete file; // We do not cache error results so that if the error is transient, // or somebody repairs the file, we recover automatically. } else { TableAndFile* tf = new TableAndFile; tf->file = file; tf->table = table; *handle = cache_->Insert(key, tf, 1, &DeleteEntry); } } return s; } Iterator* TableCache::NewIterator(const ReadOptions& options, uint64_t file_number, uint64_t file_size, Table** tableptr) { if (tableptr != NULL) { *tableptr = NULL; } Cache::Handle* handle = NULL; Status s = FindTable(file_number, file_size, &handle); if (!s.ok()) { return NewErrorIterator(s); } Table* table = reinterpret_cast(cache_->Value(handle))->table; Iterator* result = table->NewIterator(options); result->RegisterCleanup(&UnrefEntry, cache_, handle); if (tableptr != NULL) { *tableptr = table; } return result; } Status TableCache::Get(const ReadOptions& options, uint64_t file_number, uint64_t file_size, const Slice& k, void* arg, void (*saver)(void*, const Slice&, const Slice&)) { Cache::Handle* handle = NULL; Status s = FindTable(file_number, file_size, &handle); if (s.ok()) { Table* t = reinterpret_cast(cache_->Value(handle))->table; s = t->InternalGet(options, k, arg, saver); cache_->Release(handle); } return s; } void TableCache::Evict(uint64_t file_number) { char buf[sizeof(file_number)]; EncodeFixed64(buf, file_number); cache_->Erase(Slice(buf, sizeof(buf))); } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/db_iter.h0000644000000000000000000000144312414772654017500 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_DB_DB_ITER_H_ #define STORAGE_LEVELDB_DB_DB_ITER_H_ #include #include "leveldb/db.h" #include "db/dbformat.h" namespace leveldb { class DBImpl; // Return a new iterator that converts internal keys (yielded by // "*internal_iter") that were live at the specified "sequence" number // into appropriate user keys. extern Iterator* NewDBIterator( DBImpl* db, const Comparator* user_key_comparator, Iterator* internal_iter, SequenceNumber sequence, uint32_t seed); } // namespace leveldb #endif // STORAGE_LEVELDB_DB_DB_ITER_H_ armory-0.92.3/cppForSwig/leveldb/db/db_impl.h0000644000000000000000000001617212414772654017503 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_DB_DB_IMPL_H_ #define STORAGE_LEVELDB_DB_DB_IMPL_H_ #include #include #include "db/dbformat.h" #include "db/log_writer.h" #include "db/snapshot.h" #include "leveldb/db.h" #include "leveldb/env.h" #include "port/port.h" #include "port/thread_annotations.h" namespace leveldb { class MemTable; class TableCache; class Version; class VersionEdit; class VersionSet; class DBImpl : public DB { public: DBImpl(const Options& options, const std::string& dbname); virtual ~DBImpl(); // Implementations of the DB interface virtual Status Put(const WriteOptions&, const Slice& key, const Slice& value); virtual Status Delete(const WriteOptions&, const Slice& key); virtual Status Write(const WriteOptions& options, WriteBatch* updates); virtual Status Get(const ReadOptions& options, const Slice& key, std::string* value); virtual Iterator* NewIterator(const ReadOptions&); virtual const Snapshot* GetSnapshot(); virtual void ReleaseSnapshot(const Snapshot* snapshot); virtual bool GetProperty(const Slice& property, std::string* value); virtual void GetApproximateSizes(const Range* range, int n, uint64_t* sizes); virtual void CompactRange(const Slice* begin, const Slice* end); // Extra methods (for testing) that are not in the public DB interface // Compact any files in the named level that overlap [*begin,*end] void TEST_CompactRange(int level, const Slice* begin, const Slice* end); // Force current memtable contents to be compacted. Status TEST_CompactMemTable(); // Return an internal iterator over the current state of the database. // The keys of this iterator are internal keys (see format.h). // The returned iterator should be deleted when no longer needed. Iterator* TEST_NewInternalIterator(); // Return the maximum overlapping data (in bytes) at next level for any // file at a level >= 1. int64_t TEST_MaxNextLevelOverlappingBytes(); // Record a sample of bytes read at the specified internal key. // Samples are taken approximately once every config::kReadBytesPeriod // bytes. void RecordReadSample(Slice key); private: friend class DB; struct CompactionState; struct Writer; Iterator* NewInternalIterator(const ReadOptions&, SequenceNumber* latest_snapshot, uint32_t* seed); Status NewDB(); // Recover the descriptor from persistent storage. May do a significant // amount of work to recover recently logged updates. Any changes to // be made to the descriptor are added to *edit. Status Recover(VersionEdit* edit) EXCLUSIVE_LOCKS_REQUIRED(mutex_); void MaybeIgnoreError(Status* s) const; // Delete any unneeded files and stale in-memory entries. void DeleteObsoleteFiles(); // Compact the in-memory write buffer to disk. Switches to a new // log-file/memtable and writes a new descriptor iff successful. // Errors are recorded in bg_error_. void CompactMemTable() EXCLUSIVE_LOCKS_REQUIRED(mutex_); Status RecoverLogFile(uint64_t log_number, VersionEdit* edit, SequenceNumber* max_sequence) EXCLUSIVE_LOCKS_REQUIRED(mutex_); Status WriteLevel0Table(MemTable* mem, VersionEdit* edit, Version* base) EXCLUSIVE_LOCKS_REQUIRED(mutex_); Status MakeRoomForWrite(bool force /* compact even if there is room? */) EXCLUSIVE_LOCKS_REQUIRED(mutex_); WriteBatch* BuildBatchGroup(Writer** last_writer); void RecordBackgroundError(const Status& s); void MaybeScheduleCompaction() EXCLUSIVE_LOCKS_REQUIRED(mutex_); static void BGWork(void* db); void BackgroundCall(); void BackgroundCompaction() EXCLUSIVE_LOCKS_REQUIRED(mutex_); void CleanupCompaction(CompactionState* compact) EXCLUSIVE_LOCKS_REQUIRED(mutex_); Status DoCompactionWork(CompactionState* compact) EXCLUSIVE_LOCKS_REQUIRED(mutex_); Status OpenCompactionOutputFile(CompactionState* compact); Status FinishCompactionOutputFile(CompactionState* compact, Iterator* input); Status InstallCompactionResults(CompactionState* compact) EXCLUSIVE_LOCKS_REQUIRED(mutex_); // Constant after construction Env* const env_; const InternalKeyComparator internal_comparator_; const InternalFilterPolicy internal_filter_policy_; const Options options_; // options_.comparator == &internal_comparator_ bool owns_info_log_; bool owns_cache_; const std::string dbname_; // table_cache_ provides its own synchronization TableCache* table_cache_; // Lock over the persistent DB state. Non-NULL iff successfully acquired. FileLock* db_lock_; // State below is protected by mutex_ port::Mutex mutex_; port::AtomicPointer shutting_down_; port::CondVar bg_cv_; // Signalled when background work finishes MemTable* mem_; MemTable* imm_; // Memtable being compacted port::AtomicPointer has_imm_; // So bg thread can detect non-NULL imm_ WritableFile* logfile_; uint64_t logfile_number_; log::Writer* log_; uint32_t seed_; // For sampling. // Queue of writers. std::deque writers_; WriteBatch* tmp_batch_; SnapshotList snapshots_; // Set of table files to protect from deletion because they are // part of ongoing compactions. std::set pending_outputs_; // Has a background compaction been scheduled or is running? bool bg_compaction_scheduled_; // Information for a manual compaction struct ManualCompaction { int level; bool done; const InternalKey* begin; // NULL means beginning of key range const InternalKey* end; // NULL means end of key range InternalKey tmp_storage; // Used to keep track of compaction progress }; ManualCompaction* manual_compaction_; VersionSet* versions_; // Have we encountered a background error in paranoid mode? Status bg_error_; // Per level compaction stats. stats_[level] stores the stats for // compactions that produced data for the specified "level". struct CompactionStats { int64_t micros; int64_t bytes_read; int64_t bytes_written; CompactionStats() : micros(0), bytes_read(0), bytes_written(0) { } void Add(const CompactionStats& c) { this->micros += c.micros; this->bytes_read += c.bytes_read; this->bytes_written += c.bytes_written; } }; CompactionStats stats_[config::kNumLevels]; // No copying allowed DBImpl(const DBImpl&); void operator=(const DBImpl&); const Comparator* user_comparator() const { return internal_comparator_.user_comparator(); } }; // Sanitize db options. The caller should delete result.info_log if // it is not equal to src.info_log. extern Options SanitizeOptions(const std::string& db, const InternalKeyComparator* icmp, const InternalFilterPolicy* ipolicy, const Options& src); } // namespace leveldb #endif // STORAGE_LEVELDB_DB_DB_IMPL_H_ armory-0.92.3/cppForSwig/leveldb/db/log_reader.h0000644000000000000000000000676412414772654020206 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_DB_LOG_READER_H_ #define STORAGE_LEVELDB_DB_LOG_READER_H_ #include #include "db/log_format.h" #include "leveldb/slice.h" #include "leveldb/status.h" namespace leveldb { class SequentialFile; namespace log { class Reader { public: // Interface for reporting errors. class Reporter { public: virtual ~Reporter(); // Some corruption was detected. "size" is the approximate number // of bytes dropped due to the corruption. virtual void Corruption(size_t bytes, const Status& status) = 0; }; // Create a reader that will return log records from "*file". // "*file" must remain live while this Reader is in use. // // If "reporter" is non-NULL, it is notified whenever some data is // dropped due to a detected corruption. "*reporter" must remain // live while this Reader is in use. // // If "checksum" is true, verify checksums if available. // // The Reader will start reading at the first record located at physical // position >= initial_offset within the file. Reader(SequentialFile* file, Reporter* reporter, bool checksum, uint64_t initial_offset); ~Reader(); // Read the next record into *record. Returns true if read // successfully, false if we hit end of the input. May use // "*scratch" as temporary storage. The contents filled in *record // will only be valid until the next mutating operation on this // reader or the next mutation to *scratch. bool ReadRecord(Slice* record, std::string* scratch); // Returns the physical offset of the last record returned by ReadRecord. // // Undefined before the first call to ReadRecord. uint64_t LastRecordOffset(); private: SequentialFile* const file_; Reporter* const reporter_; bool const checksum_; char* const backing_store_; Slice buffer_; bool eof_; // Last Read() indicated EOF by returning < kBlockSize // Offset of the last record returned by ReadRecord. uint64_t last_record_offset_; // Offset of the first location past the end of buffer_. uint64_t end_of_buffer_offset_; // Offset at which to start looking for the first record to return uint64_t const initial_offset_; // Extend record types with the following special values enum { kEof = kMaxRecordType + 1, // Returned whenever we find an invalid physical record. // Currently there are three situations in which this happens: // * The record has an invalid CRC (ReadPhysicalRecord reports a drop) // * The record is a 0-length record (No drop is reported) // * The record is below constructor's initial_offset (No drop is reported) kBadRecord = kMaxRecordType + 2 }; // Skips all blocks that are completely before "initial_offset_". // // Returns true on success. Handles reporting. bool SkipToInitialBlock(); // Return type, or one of the preceding special values unsigned int ReadPhysicalRecord(Slice* result); // Reports dropped bytes to the reporter. // buffer_ must be updated to remove the dropped bytes prior to invocation. void ReportCorruption(size_t bytes, const char* reason); void ReportDrop(size_t bytes, const Status& reason); // No copying allowed Reader(const Reader&); void operator=(const Reader&); }; } // namespace log } // namespace leveldb #endif // STORAGE_LEVELDB_DB_LOG_READER_H_ armory-0.92.3/cppForSwig/leveldb/db/version_edit_test.cc0000644000000000000000000000247712414772654021767 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/version_edit.h" #include "util/testharness.h" namespace leveldb { static void TestEncodeDecode(const VersionEdit& edit) { std::string encoded, encoded2; edit.EncodeTo(&encoded); VersionEdit parsed; Status s = parsed.DecodeFrom(encoded); ASSERT_TRUE(s.ok()) << s.ToString(); parsed.EncodeTo(&encoded2); ASSERT_EQ(encoded, encoded2); } class VersionEditTest { }; TEST(VersionEditTest, EncodeDecode) { static const uint64_t kBig = 1ull << 50; VersionEdit edit; for (int i = 0; i < 4; i++) { TestEncodeDecode(edit); edit.AddFile(3, kBig + 300 + i, kBig + 400 + i, InternalKey("foo", kBig + 500 + i, kTypeValue), InternalKey("zoo", kBig + 600 + i, kTypeDeletion)); edit.DeleteFile(4, kBig + 700 + i); edit.SetCompactPointer(i, InternalKey("x", kBig + 900 + i, kTypeValue)); } edit.SetComparatorName("foo"); edit.SetLogNumber(kBig + 100); edit.SetNextFile(kBig + 200); edit.SetLastSequence(kBig + 1000); TestEncodeDecode(edit); } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/db/log_format.h0000644000000000000000000000160112414772654020215 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // Log format information shared by reader and writer. // See ../doc/log_format.txt for more detail. #ifndef STORAGE_LEVELDB_DB_LOG_FORMAT_H_ #define STORAGE_LEVELDB_DB_LOG_FORMAT_H_ namespace leveldb { namespace log { enum RecordType { // Zero is reserved for preallocated files kZeroType = 0, kFullType = 1, // For fragments kFirstType = 2, kMiddleType = 3, kLastType = 4 }; static const int kMaxRecordType = kLastType; static const int kBlockSize = 32768; // Header is checksum (4 bytes), type (1 byte), length (2 bytes). static const int kHeaderSize = 4 + 1 + 2; } // namespace log } // namespace leveldb #endif // STORAGE_LEVELDB_DB_LOG_FORMAT_H_ armory-0.92.3/cppForSwig/leveldb/db/skiplist.h0000644000000000000000000002565112414772654017741 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // Thread safety // ------------- // // Writes require external synchronization, most likely a mutex. // Reads require a guarantee that the SkipList will not be destroyed // while the read is in progress. Apart from that, reads progress // without any internal locking or synchronization. // // Invariants: // // (1) Allocated nodes are never deleted until the SkipList is // destroyed. This is trivially guaranteed by the code since we // never delete any skip list nodes. // // (2) The contents of a Node except for the next/prev pointers are // immutable after the Node has been linked into the SkipList. // Only Insert() modifies the list, and it is careful to initialize // a node and use release-stores to publish the nodes in one or // more lists. // // ... prev vs. next pointer ordering ... #include #include #include "port/port.h" #include "util/arena.h" #include "util/random.h" namespace leveldb { class Arena; template class SkipList { private: struct Node; public: // Create a new SkipList object that will use "cmp" for comparing keys, // and will allocate memory using "*arena". Objects allocated in the arena // must remain allocated for the lifetime of the skiplist object. explicit SkipList(Comparator cmp, Arena* arena); // Insert key into the list. // REQUIRES: nothing that compares equal to key is currently in the list. void Insert(const Key& key); // Returns true iff an entry that compares equal to key is in the list. bool Contains(const Key& key) const; // Iteration over the contents of a skip list class Iterator { public: // Initialize an iterator over the specified list. // The returned iterator is not valid. explicit Iterator(const SkipList* list); // Returns true iff the iterator is positioned at a valid node. bool Valid() const; // Returns the key at the current position. // REQUIRES: Valid() const Key& key() const; // Advances to the next position. // REQUIRES: Valid() void Next(); // Advances to the previous position. // REQUIRES: Valid() void Prev(); // Advance to the first entry with a key >= target void Seek(const Key& target); // Position at the first entry in list. // Final state of iterator is Valid() iff list is not empty. void SeekToFirst(); // Position at the last entry in list. // Final state of iterator is Valid() iff list is not empty. void SeekToLast(); private: const SkipList* list_; Node* node_; // Intentionally copyable }; private: enum { kMaxHeight = 12 }; // Immutable after construction Comparator const compare_; Arena* const arena_; // Arena used for allocations of nodes Node* const head_; // Modified only by Insert(). Read racily by readers, but stale // values are ok. port::AtomicPointer max_height_; // Height of the entire list inline int GetMaxHeight() const { return static_cast( reinterpret_cast(max_height_.NoBarrier_Load())); } // Read/written only by Insert(). Random rnd_; Node* NewNode(const Key& key, int height); int RandomHeight(); bool Equal(const Key& a, const Key& b) const { return (compare_(a, b) == 0); } // Return true if key is greater than the data stored in "n" bool KeyIsAfterNode(const Key& key, Node* n) const; // Return the earliest node that comes at or after key. // Return NULL if there is no such node. // // If prev is non-NULL, fills prev[level] with pointer to previous // node at "level" for every level in [0..max_height_-1]. Node* FindGreaterOrEqual(const Key& key, Node** prev) const; // Return the latest node with a key < key. // Return head_ if there is no such node. Node* FindLessThan(const Key& key) const; // Return the last node in the list. // Return head_ if list is empty. Node* FindLast() const; // No copying allowed SkipList(const SkipList&); void operator=(const SkipList&); }; // Implementation details follow template struct SkipList::Node { explicit Node(const Key& k) : key(k) { } Key const key; // Accessors/mutators for links. Wrapped in methods so we can // add the appropriate barriers as necessary. Node* Next(int n) { assert(n >= 0); // Use an 'acquire load' so that we observe a fully initialized // version of the returned Node. return reinterpret_cast(next_[n].Acquire_Load()); } void SetNext(int n, Node* x) { assert(n >= 0); // Use a 'release store' so that anybody who reads through this // pointer observes a fully initialized version of the inserted node. next_[n].Release_Store(x); } // No-barrier variants that can be safely used in a few locations. Node* NoBarrier_Next(int n) { assert(n >= 0); return reinterpret_cast(next_[n].NoBarrier_Load()); } void NoBarrier_SetNext(int n, Node* x) { assert(n >= 0); next_[n].NoBarrier_Store(x); } private: // Array of length equal to the node height. next_[0] is lowest level link. port::AtomicPointer next_[1]; }; template typename SkipList::Node* SkipList::NewNode(const Key& key, int height) { char* mem = arena_->AllocateAligned( sizeof(Node) + sizeof(port::AtomicPointer) * (height - 1)); return new (mem) Node(key); } template inline SkipList::Iterator::Iterator(const SkipList* list) { list_ = list; node_ = NULL; } template inline bool SkipList::Iterator::Valid() const { return node_ != NULL; } template inline const Key& SkipList::Iterator::key() const { assert(Valid()); return node_->key; } template inline void SkipList::Iterator::Next() { assert(Valid()); node_ = node_->Next(0); } template inline void SkipList::Iterator::Prev() { // Instead of using explicit "prev" links, we just search for the // last node that falls before key. assert(Valid()); node_ = list_->FindLessThan(node_->key); if (node_ == list_->head_) { node_ = NULL; } } template inline void SkipList::Iterator::Seek(const Key& target) { node_ = list_->FindGreaterOrEqual(target, NULL); } template inline void SkipList::Iterator::SeekToFirst() { node_ = list_->head_->Next(0); } template inline void SkipList::Iterator::SeekToLast() { node_ = list_->FindLast(); if (node_ == list_->head_) { node_ = NULL; } } template int SkipList::RandomHeight() { // Increase height with probability 1 in kBranching static const unsigned int kBranching = 4; int height = 1; while (height < kMaxHeight && ((rnd_.Next() % kBranching) == 0)) { height++; } assert(height > 0); assert(height <= kMaxHeight); return height; } template bool SkipList::KeyIsAfterNode(const Key& key, Node* n) const { // NULL n is considered infinite return (n != NULL) && (compare_(n->key, key) < 0); } template typename SkipList::Node* SkipList::FindGreaterOrEqual(const Key& key, Node** prev) const { Node* x = head_; int level = GetMaxHeight() - 1; while (true) { Node* next = x->Next(level); if (KeyIsAfterNode(key, next)) { // Keep searching in this list x = next; } else { if (prev != NULL) prev[level] = x; if (level == 0) { return next; } else { // Switch to next list level--; } } } } template typename SkipList::Node* SkipList::FindLessThan(const Key& key) const { Node* x = head_; int level = GetMaxHeight() - 1; while (true) { assert(x == head_ || compare_(x->key, key) < 0); Node* next = x->Next(level); if (next == NULL || compare_(next->key, key) >= 0) { if (level == 0) { return x; } else { // Switch to next list level--; } } else { x = next; } } } template typename SkipList::Node* SkipList::FindLast() const { Node* x = head_; int level = GetMaxHeight() - 1; while (true) { Node* next = x->Next(level); if (next == NULL) { if (level == 0) { return x; } else { // Switch to next list level--; } } else { x = next; } } } template SkipList::SkipList(Comparator cmp, Arena* arena) : compare_(cmp), arena_(arena), head_(NewNode(0 /* any key will do */, kMaxHeight)), max_height_(reinterpret_cast(1)), rnd_(0xdeadbeef) { for (int i = 0; i < kMaxHeight; i++) { head_->SetNext(i, NULL); } } template void SkipList::Insert(const Key& key) { // TODO(opt): We can use a barrier-free variant of FindGreaterOrEqual() // here since Insert() is externally synchronized. Node* prev[kMaxHeight]; Node* x = FindGreaterOrEqual(key, prev); // Our data structure does not allow duplicate insertion assert(x == NULL || !Equal(key, x->key)); int height = RandomHeight(); if (height > GetMaxHeight()) { for (int i = GetMaxHeight(); i < height; i++) { prev[i] = head_; } //fprintf(stderr, "Change height from %d to %d\n", max_height_, height); // It is ok to mutate max_height_ without any synchronization // with concurrent readers. A concurrent reader that observes // the new value of max_height_ will see either the old value of // new level pointers from head_ (NULL), or a new value set in // the loop below. In the former case the reader will // immediately drop to the next level since NULL sorts after all // keys. In the latter case the reader will use the new node. max_height_.NoBarrier_Store(reinterpret_cast(height)); } x = NewNode(key, height); for (int i = 0; i < height; i++) { // NoBarrier_SetNext() suffices since we will add a barrier when // we publish a pointer to "x" in prev[i]. x->NoBarrier_SetNext(i, prev[i]->NoBarrier_Next(i)); prev[i]->SetNext(i, x); } } template bool SkipList::Contains(const Key& key) const { Node* x = FindGreaterOrEqual(key, NULL); if (x != NULL && Equal(key, x->key)) { return true; } else { return false; } } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/c.cc0000644000000000000000000003726712414772654016465 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/c.h" #include #include #include "leveldb/cache.h" #include "leveldb/comparator.h" #include "leveldb/db.h" #include "leveldb/env.h" #include "leveldb/filter_policy.h" #include "leveldb/iterator.h" #include "leveldb/options.h" #include "leveldb/status.h" #include "leveldb/write_batch.h" #ifdef _MSC_VER #define strdup _strdup #endif using leveldb::Cache; using leveldb::Comparator; using leveldb::CompressionType; using leveldb::DB; using leveldb::Env; using leveldb::FileLock; using leveldb::FilterPolicy; using leveldb::Iterator; using leveldb::kMajorVersion; using leveldb::kMinorVersion; using leveldb::Logger; using leveldb::NewBloomFilterPolicy; using leveldb::NewLRUCache; using leveldb::Options; using leveldb::RandomAccessFile; using leveldb::Range; using leveldb::ReadOptions; using leveldb::SequentialFile; using leveldb::Slice; using leveldb::Snapshot; using leveldb::Status; using leveldb::WritableFile; using leveldb::WriteBatch; using leveldb::WriteOptions; extern "C" { struct leveldb_t { DB* rep; }; struct leveldb_iterator_t { Iterator* rep; }; struct leveldb_writebatch_t { WriteBatch rep; }; struct leveldb_snapshot_t { const Snapshot* rep; }; struct leveldb_readoptions_t { ReadOptions rep; }; struct leveldb_writeoptions_t { WriteOptions rep; }; struct leveldb_options_t { Options rep; }; struct leveldb_cache_t { Cache* rep; }; struct leveldb_seqfile_t { SequentialFile* rep; }; struct leveldb_randomfile_t { RandomAccessFile* rep; }; struct leveldb_writablefile_t { WritableFile* rep; }; struct leveldb_logger_t { Logger* rep; }; struct leveldb_filelock_t { FileLock* rep; }; struct leveldb_comparator_t : public Comparator { void* state_; void (*destructor_)(void*); int (*compare_)( void*, const char* a, size_t alen, const char* b, size_t blen); const char* (*name_)(void*); virtual ~leveldb_comparator_t() { (*destructor_)(state_); } virtual int Compare(const Slice& a, const Slice& b) const { return (*compare_)(state_, a.data(), a.size(), b.data(), b.size()); } virtual const char* Name() const { return (*name_)(state_); } // No-ops since the C binding does not support key shortening methods. virtual void FindShortestSeparator(std::string*, const Slice&) const { } virtual void FindShortSuccessor(std::string* key) const { } }; struct leveldb_filterpolicy_t : public FilterPolicy { void* state_; void (*destructor_)(void*); const char* (*name_)(void*); char* (*create_)( void*, const char* const* key_array, const size_t* key_length_array, int num_keys, size_t* filter_length); unsigned char (*key_match_)( void*, const char* key, size_t length, const char* filter, size_t filter_length); virtual ~leveldb_filterpolicy_t() { (*destructor_)(state_); } virtual const char* Name() const { return (*name_)(state_); } virtual void CreateFilter(const Slice* keys, int n, std::string* dst) const { std::vector key_pointers(n); std::vector key_sizes(n); for (int i = 0; i < n; i++) { key_pointers[i] = keys[i].data(); key_sizes[i] = keys[i].size(); } size_t len; char* filter = (*create_)(state_, &key_pointers[0], &key_sizes[0], n, &len); dst->append(filter, len); free(filter); } virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const { return (*key_match_)(state_, key.data(), key.size(), filter.data(), filter.size()); } }; struct leveldb_env_t { Env* rep; bool is_default; }; static bool SaveError(char** errptr, const Status& s) { assert(errptr != NULL); if (s.ok()) { return false; } else if (*errptr == NULL) { *errptr = strdup(s.ToString().c_str()); } else { // TODO(sanjay): Merge with existing error? free(*errptr); *errptr = strdup(s.ToString().c_str()); } return true; } static char* CopyString(const std::string& str) { char* result = reinterpret_cast(malloc(sizeof(char) * str.size())); memcpy(result, str.data(), sizeof(char) * str.size()); return result; } leveldb_t* leveldb_open( const leveldb_options_t* options, const char* name, char** errptr) { DB* db; if (SaveError(errptr, DB::Open(options->rep, std::string(name), &db))) { return NULL; } leveldb_t* result = new leveldb_t; result->rep = db; return result; } void leveldb_close(leveldb_t* db) { delete db->rep; delete db; } void leveldb_put( leveldb_t* db, const leveldb_writeoptions_t* options, const char* key, size_t keylen, const char* val, size_t vallen, char** errptr) { SaveError(errptr, db->rep->Put(options->rep, Slice(key, keylen), Slice(val, vallen))); } void leveldb_delete( leveldb_t* db, const leveldb_writeoptions_t* options, const char* key, size_t keylen, char** errptr) { SaveError(errptr, db->rep->Delete(options->rep, Slice(key, keylen))); } void leveldb_write( leveldb_t* db, const leveldb_writeoptions_t* options, leveldb_writebatch_t* batch, char** errptr) { SaveError(errptr, db->rep->Write(options->rep, &batch->rep)); } char* leveldb_get( leveldb_t* db, const leveldb_readoptions_t* options, const char* key, size_t keylen, size_t* vallen, char** errptr) { char* result = NULL; std::string tmp; Status s = db->rep->Get(options->rep, Slice(key, keylen), &tmp); if (s.ok()) { *vallen = tmp.size(); result = CopyString(tmp); } else { *vallen = 0; if (!s.IsNotFound()) { SaveError(errptr, s); } } return result; } leveldb_iterator_t* leveldb_create_iterator( leveldb_t* db, const leveldb_readoptions_t* options) { leveldb_iterator_t* result = new leveldb_iterator_t; result->rep = db->rep->NewIterator(options->rep); return result; } const leveldb_snapshot_t* leveldb_create_snapshot( leveldb_t* db) { leveldb_snapshot_t* result = new leveldb_snapshot_t; result->rep = db->rep->GetSnapshot(); return result; } void leveldb_release_snapshot( leveldb_t* db, const leveldb_snapshot_t* snapshot) { db->rep->ReleaseSnapshot(snapshot->rep); delete snapshot; } char* leveldb_property_value( leveldb_t* db, const char* propname) { std::string tmp; if (db->rep->GetProperty(Slice(propname), &tmp)) { // We use strdup() since we expect human readable output. return strdup(tmp.c_str()); } else { return NULL; } } void leveldb_approximate_sizes( leveldb_t* db, int num_ranges, const char* const* range_start_key, const size_t* range_start_key_len, const char* const* range_limit_key, const size_t* range_limit_key_len, uint64_t* sizes) { Range* ranges = new Range[num_ranges]; for (int i = 0; i < num_ranges; i++) { ranges[i].start = Slice(range_start_key[i], range_start_key_len[i]); ranges[i].limit = Slice(range_limit_key[i], range_limit_key_len[i]); } db->rep->GetApproximateSizes(ranges, num_ranges, sizes); delete[] ranges; } void leveldb_compact_range( leveldb_t* db, const char* start_key, size_t start_key_len, const char* limit_key, size_t limit_key_len) { Slice a, b; db->rep->CompactRange( // Pass NULL Slice if corresponding "const char*" is NULL (start_key ? (a = Slice(start_key, start_key_len), &a) : NULL), (limit_key ? (b = Slice(limit_key, limit_key_len), &b) : NULL)); } void leveldb_destroy_db( const leveldb_options_t* options, const char* name, char** errptr) { SaveError(errptr, DestroyDB(name, options->rep)); } void leveldb_repair_db( const leveldb_options_t* options, const char* name, char** errptr) { SaveError(errptr, RepairDB(name, options->rep)); } void leveldb_iter_destroy(leveldb_iterator_t* iter) { delete iter->rep; delete iter; } unsigned char leveldb_iter_valid(const leveldb_iterator_t* iter) { return iter->rep->Valid(); } void leveldb_iter_seek_to_first(leveldb_iterator_t* iter) { iter->rep->SeekToFirst(); } void leveldb_iter_seek_to_last(leveldb_iterator_t* iter) { iter->rep->SeekToLast(); } void leveldb_iter_seek(leveldb_iterator_t* iter, const char* k, size_t klen) { iter->rep->Seek(Slice(k, klen)); } void leveldb_iter_next(leveldb_iterator_t* iter) { iter->rep->Next(); } void leveldb_iter_prev(leveldb_iterator_t* iter) { iter->rep->Prev(); } const char* leveldb_iter_key(const leveldb_iterator_t* iter, size_t* klen) { Slice s = iter->rep->key(); *klen = s.size(); return s.data(); } const char* leveldb_iter_value(const leveldb_iterator_t* iter, size_t* vlen) { Slice s = iter->rep->value(); *vlen = s.size(); return s.data(); } void leveldb_iter_get_error(const leveldb_iterator_t* iter, char** errptr) { SaveError(errptr, iter->rep->status()); } leveldb_writebatch_t* leveldb_writebatch_create() { return new leveldb_writebatch_t; } void leveldb_writebatch_destroy(leveldb_writebatch_t* b) { delete b; } void leveldb_writebatch_clear(leveldb_writebatch_t* b) { b->rep.Clear(); } void leveldb_writebatch_put( leveldb_writebatch_t* b, const char* key, size_t klen, const char* val, size_t vlen) { b->rep.Put(Slice(key, klen), Slice(val, vlen)); } void leveldb_writebatch_delete( leveldb_writebatch_t* b, const char* key, size_t klen) { b->rep.Delete(Slice(key, klen)); } void leveldb_writebatch_iterate( leveldb_writebatch_t* b, void* state, void (*put)(void*, const char* k, size_t klen, const char* v, size_t vlen), void (*deleted)(void*, const char* k, size_t klen)) { class H : public WriteBatch::Handler { public: void* state_; void (*put_)(void*, const char* k, size_t klen, const char* v, size_t vlen); void (*deleted_)(void*, const char* k, size_t klen); virtual void Put(const Slice& key, const Slice& value) { (*put_)(state_, key.data(), key.size(), value.data(), value.size()); } virtual void Delete(const Slice& key) { (*deleted_)(state_, key.data(), key.size()); } }; H handler; handler.state_ = state; handler.put_ = put; handler.deleted_ = deleted; b->rep.Iterate(&handler); } leveldb_options_t* leveldb_options_create() { return new leveldb_options_t; } void leveldb_options_destroy(leveldb_options_t* options) { delete options; } void leveldb_options_set_comparator( leveldb_options_t* opt, leveldb_comparator_t* cmp) { opt->rep.comparator = cmp; } void leveldb_options_set_filter_policy( leveldb_options_t* opt, leveldb_filterpolicy_t* policy) { opt->rep.filter_policy = policy; } void leveldb_options_set_create_if_missing( leveldb_options_t* opt, unsigned char v) { opt->rep.create_if_missing = v; } void leveldb_options_set_error_if_exists( leveldb_options_t* opt, unsigned char v) { opt->rep.error_if_exists = v; } void leveldb_options_set_paranoid_checks( leveldb_options_t* opt, unsigned char v) { opt->rep.paranoid_checks = v; } void leveldb_options_set_env(leveldb_options_t* opt, leveldb_env_t* env) { opt->rep.env = (env ? env->rep : NULL); } void leveldb_options_set_info_log(leveldb_options_t* opt, leveldb_logger_t* l) { opt->rep.info_log = (l ? l->rep : NULL); } void leveldb_options_set_write_buffer_size(leveldb_options_t* opt, size_t s) { opt->rep.write_buffer_size = s; } void leveldb_options_set_max_open_files(leveldb_options_t* opt, int n) { opt->rep.max_open_files = n; } void leveldb_options_set_cache(leveldb_options_t* opt, leveldb_cache_t* c) { opt->rep.block_cache = c->rep; } void leveldb_options_set_block_size(leveldb_options_t* opt, size_t s) { opt->rep.block_size = s; } void leveldb_options_set_block_restart_interval(leveldb_options_t* opt, int n) { opt->rep.block_restart_interval = n; } void leveldb_options_set_compression(leveldb_options_t* opt, int t) { opt->rep.compression = static_cast(t); } leveldb_comparator_t* leveldb_comparator_create( void* state, void (*destructor)(void*), int (*compare)( void*, const char* a, size_t alen, const char* b, size_t blen), const char* (*name)(void*)) { leveldb_comparator_t* result = new leveldb_comparator_t; result->state_ = state; result->destructor_ = destructor; result->compare_ = compare; result->name_ = name; return result; } void leveldb_comparator_destroy(leveldb_comparator_t* cmp) { delete cmp; } leveldb_filterpolicy_t* leveldb_filterpolicy_create( void* state, void (*destructor)(void*), char* (*create_filter)( void*, const char* const* key_array, const size_t* key_length_array, int num_keys, size_t* filter_length), unsigned char (*key_may_match)( void*, const char* key, size_t length, const char* filter, size_t filter_length), const char* (*name)(void*)) { leveldb_filterpolicy_t* result = new leveldb_filterpolicy_t; result->state_ = state; result->destructor_ = destructor; result->create_ = create_filter; result->key_match_ = key_may_match; result->name_ = name; return result; } void leveldb_filterpolicy_destroy(leveldb_filterpolicy_t* filter) { delete filter; } leveldb_filterpolicy_t* leveldb_filterpolicy_create_bloom(int bits_per_key) { // Make a leveldb_filterpolicy_t, but override all of its methods so // they delegate to a NewBloomFilterPolicy() instead of user // supplied C functions. struct Wrapper : public leveldb_filterpolicy_t { const FilterPolicy* rep_; ~Wrapper() { delete rep_; } const char* Name() const { return rep_->Name(); } void CreateFilter(const Slice* keys, int n, std::string* dst) const { return rep_->CreateFilter(keys, n, dst); } bool KeyMayMatch(const Slice& key, const Slice& filter) const { return rep_->KeyMayMatch(key, filter); } static void DoNothing(void*) { } }; Wrapper* wrapper = new Wrapper; wrapper->rep_ = NewBloomFilterPolicy(bits_per_key); wrapper->state_ = NULL; wrapper->destructor_ = &Wrapper::DoNothing; return wrapper; } leveldb_readoptions_t* leveldb_readoptions_create() { return new leveldb_readoptions_t; } void leveldb_readoptions_destroy(leveldb_readoptions_t* opt) { delete opt; } void leveldb_readoptions_set_verify_checksums( leveldb_readoptions_t* opt, unsigned char v) { opt->rep.verify_checksums = v; } void leveldb_readoptions_set_fill_cache( leveldb_readoptions_t* opt, unsigned char v) { opt->rep.fill_cache = v; } void leveldb_readoptions_set_snapshot( leveldb_readoptions_t* opt, const leveldb_snapshot_t* snap) { opt->rep.snapshot = (snap ? snap->rep : NULL); } leveldb_writeoptions_t* leveldb_writeoptions_create() { return new leveldb_writeoptions_t; } void leveldb_writeoptions_destroy(leveldb_writeoptions_t* opt) { delete opt; } void leveldb_writeoptions_set_sync( leveldb_writeoptions_t* opt, unsigned char v) { opt->rep.sync = v; } leveldb_cache_t* leveldb_cache_create_lru(size_t capacity) { leveldb_cache_t* c = new leveldb_cache_t; c->rep = NewLRUCache(capacity); return c; } void leveldb_cache_destroy(leveldb_cache_t* cache) { delete cache->rep; delete cache; } leveldb_env_t* leveldb_create_default_env() { leveldb_env_t* result = new leveldb_env_t; result->rep = Env::Default(); result->is_default = true; return result; } void leveldb_env_destroy(leveldb_env_t* env) { if (!env->is_default) delete env->rep; delete env; } void leveldb_free(void* ptr) { free(ptr); } int leveldb_major_version() { return kMajorVersion; } int leveldb_minor_version() { return kMinorVersion; } } // end extern "C" armory-0.92.3/cppForSwig/leveldb/db/builder.h0000644000000000000000000000211612414772654017514 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_DB_BUILDER_H_ #define STORAGE_LEVELDB_DB_BUILDER_H_ #include "leveldb/status.h" namespace leveldb { struct Options; struct FileMetaData; class Env; class Iterator; class TableCache; class VersionEdit; // Build a Table file from the contents of *iter. The generated file // will be named according to meta->number. On success, the rest of // *meta will be filled with metadata about the generated table. // If no data is present in *iter, meta->file_size will be set to // zero, and no Table file will be produced. extern Status BuildTable(const std::string& dbname, Env* env, const Options& options, TableCache* table_cache, Iterator* iter, FileMetaData* meta); } // namespace leveldb #endif // STORAGE_LEVELDB_DB_BUILDER_H_ armory-0.92.3/cppForSwig/leveldb/db/dbformat.h0000644000000000000000000001735012414772654017672 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_DB_FORMAT_H_ #define STORAGE_LEVELDB_DB_FORMAT_H_ #include #include "leveldb/comparator.h" #include "leveldb/db.h" #include "leveldb/filter_policy.h" #include "leveldb/slice.h" #include "leveldb/table_builder.h" #include "util/coding.h" #include "util/logging.h" namespace leveldb { // Grouping of constants. We may want to make some of these // parameters set via options. namespace config { static const int kNumLevels = 7; // Level-0 compaction is started when we hit this many files. static const int kL0_CompactionTrigger = 4; // Soft limit on number of level-0 files. We slow down writes at this point. static const int kL0_SlowdownWritesTrigger = 8; // Maximum number of level-0 files. We stop writes at this point. static const int kL0_StopWritesTrigger = 12; // Maximum level to which a new compacted memtable is pushed if it // does not create overlap. We try to push to level 2 to avoid the // relatively expensive level 0=>1 compactions and to avoid some // expensive manifest file operations. We do not push all the way to // the largest level since that can generate a lot of wasted disk // space if the same key space is being repeatedly overwritten. static const int kMaxMemCompactLevel = 2; // Approximate gap in bytes between samples of data read during iteration. static const int kReadBytesPeriod = 1048576; } // namespace config class InternalKey; // Value types encoded as the last component of internal keys. // DO NOT CHANGE THESE ENUM VALUES: they are embedded in the on-disk // data structures. enum ValueType { kTypeDeletion = 0x0, kTypeValue = 0x1 }; // kValueTypeForSeek defines the ValueType that should be passed when // constructing a ParsedInternalKey object for seeking to a particular // sequence number (since we sort sequence numbers in decreasing order // and the value type is embedded as the low 8 bits in the sequence // number in internal keys, we need to use the highest-numbered // ValueType, not the lowest). static const ValueType kValueTypeForSeek = kTypeValue; typedef uint64_t SequenceNumber; // We leave eight bits empty at the bottom so a type and sequence# // can be packed together into 64-bits. static const SequenceNumber kMaxSequenceNumber = ((0x1ull << 56) - 1); struct ParsedInternalKey { Slice user_key; SequenceNumber sequence; ValueType type; ParsedInternalKey() { } // Intentionally left uninitialized (for speed) ParsedInternalKey(const Slice& u, const SequenceNumber& seq, ValueType t) : user_key(u), sequence(seq), type(t) { } std::string DebugString() const; }; // Return the length of the encoding of "key". inline size_t InternalKeyEncodingLength(const ParsedInternalKey& key) { return key.user_key.size() + 8; } // Append the serialization of "key" to *result. extern void AppendInternalKey(std::string* result, const ParsedInternalKey& key); // Attempt to parse an internal key from "internal_key". On success, // stores the parsed data in "*result", and returns true. // // On error, returns false, leaves "*result" in an undefined state. extern bool ParseInternalKey(const Slice& internal_key, ParsedInternalKey* result); // Returns the user key portion of an internal key. inline Slice ExtractUserKey(const Slice& internal_key) { assert(internal_key.size() >= 8); return Slice(internal_key.data(), internal_key.size() - 8); } inline ValueType ExtractValueType(const Slice& internal_key) { assert(internal_key.size() >= 8); const size_t n = internal_key.size(); uint64_t num = DecodeFixed64(internal_key.data() + n - 8); unsigned char c = num & 0xff; return static_cast(c); } // A comparator for internal keys that uses a specified comparator for // the user key portion and breaks ties by decreasing sequence number. class InternalKeyComparator : public Comparator { private: const Comparator* user_comparator_; public: explicit InternalKeyComparator(const Comparator* c) : user_comparator_(c) { } virtual const char* Name() const; virtual int Compare(const Slice& a, const Slice& b) const; virtual void FindShortestSeparator( std::string* start, const Slice& limit) const; virtual void FindShortSuccessor(std::string* key) const; const Comparator* user_comparator() const { return user_comparator_; } int Compare(const InternalKey& a, const InternalKey& b) const; }; // Filter policy wrapper that converts from internal keys to user keys class InternalFilterPolicy : public FilterPolicy { private: const FilterPolicy* const user_policy_; public: explicit InternalFilterPolicy(const FilterPolicy* p) : user_policy_(p) { } virtual const char* Name() const; virtual void CreateFilter(const Slice* keys, int n, std::string* dst) const; virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const; }; // Modules in this directory should keep internal keys wrapped inside // the following class instead of plain strings so that we do not // incorrectly use string comparisons instead of an InternalKeyComparator. class InternalKey { private: std::string rep_; public: InternalKey() { } // Leave rep_ as empty to indicate it is invalid InternalKey(const Slice& user_key, SequenceNumber s, ValueType t) { AppendInternalKey(&rep_, ParsedInternalKey(user_key, s, t)); } void DecodeFrom(const Slice& s) { rep_.assign(s.data(), s.size()); } Slice Encode() const { assert(!rep_.empty()); return rep_; } Slice user_key() const { return ExtractUserKey(rep_); } void SetFrom(const ParsedInternalKey& p) { rep_.clear(); AppendInternalKey(&rep_, p); } void Clear() { rep_.clear(); } std::string DebugString() const; }; inline int InternalKeyComparator::Compare( const InternalKey& a, const InternalKey& b) const { return Compare(a.Encode(), b.Encode()); } inline bool ParseInternalKey(const Slice& internal_key, ParsedInternalKey* result) { const size_t n = internal_key.size(); if (n < 8) return false; uint64_t num = DecodeFixed64(internal_key.data() + n - 8); unsigned char c = num & 0xff; result->sequence = num >> 8; result->type = static_cast(c); result->user_key = Slice(internal_key.data(), n - 8); return (c <= static_cast(kTypeValue)); } // A helper class useful for DBImpl::Get() class LookupKey { public: // Initialize *this for looking up user_key at a snapshot with // the specified sequence number. LookupKey(const Slice& user_key, SequenceNumber sequence); ~LookupKey(); // Return a key suitable for lookup in a MemTable. Slice memtable_key() const { return Slice(start_, end_ - start_); } // Return an internal key (suitable for passing to an internal iterator) Slice internal_key() const { return Slice(kstart_, end_ - kstart_); } // Return the user key Slice user_key() const { return Slice(kstart_, end_ - kstart_ - 8); } private: // We construct a char array of the form: // klength varint32 <-- start_ // userkey char[klength] <-- kstart_ // tag uint64 // <-- end_ // The array is a suitable MemTable key. // The suffix starting with "userkey" can be used as an InternalKey. const char* start_; const char* kstart_; const char* end_; char space_[200]; // Avoid allocation for short keys // No copying allowed LookupKey(const LookupKey&); void operator=(const LookupKey&); }; inline LookupKey::~LookupKey() { if (start_ != space_) delete[] start_; } } // namespace leveldb #endif // STORAGE_LEVELDB_DB_FORMAT_H_ armory-0.92.3/cppForSwig/leveldb/db/memtable.cc0000644000000000000000000001125712414772654020020 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/memtable.h" #include "db/dbformat.h" #include "leveldb/comparator.h" #include "leveldb/env.h" #include "leveldb/iterator.h" #include "util/coding.h" namespace leveldb { static Slice GetLengthPrefixedSlice(const char* data) { uint32_t len; const char* p = data; p = GetVarint32Ptr(p, p + 5, &len); // +5: we assume "p" is not corrupted return Slice(p, len); } MemTable::MemTable(const InternalKeyComparator& cmp) : comparator_(cmp), refs_(0), table_(comparator_, &arena_) { } MemTable::~MemTable() { assert(refs_ == 0); } size_t MemTable::ApproximateMemoryUsage() { return arena_.MemoryUsage(); } int MemTable::KeyComparator::operator()(const char* aptr, const char* bptr) const { // Internal keys are encoded as length-prefixed strings. Slice a = GetLengthPrefixedSlice(aptr); Slice b = GetLengthPrefixedSlice(bptr); return comparator.Compare(a, b); } // Encode a suitable internal key target for "target" and return it. // Uses *scratch as scratch space, and the returned pointer will point // into this scratch space. static const char* EncodeKey(std::string* scratch, const Slice& target) { scratch->clear(); PutVarint32(scratch, target.size()); scratch->append(target.data(), target.size()); return scratch->data(); } class MemTableIterator: public Iterator { public: explicit MemTableIterator(MemTable::Table* table) : iter_(table) { } virtual bool Valid() const { return iter_.Valid(); } virtual void Seek(const Slice& k) { iter_.Seek(EncodeKey(&tmp_, k)); } virtual void SeekToFirst() { iter_.SeekToFirst(); } virtual void SeekToLast() { iter_.SeekToLast(); } virtual void Next() { iter_.Next(); } virtual void Prev() { iter_.Prev(); } virtual Slice key() const { return GetLengthPrefixedSlice(iter_.key()); } virtual Slice value() const { Slice key_slice = GetLengthPrefixedSlice(iter_.key()); return GetLengthPrefixedSlice(key_slice.data() + key_slice.size()); } virtual Status status() const { return Status::OK(); } private: MemTable::Table::Iterator iter_; std::string tmp_; // For passing to EncodeKey // No copying allowed MemTableIterator(const MemTableIterator&); void operator=(const MemTableIterator&); }; Iterator* MemTable::NewIterator() { return new MemTableIterator(&table_); } void MemTable::Add(SequenceNumber s, ValueType type, const Slice& key, const Slice& value) { // Format of an entry is concatenation of: // key_size : varint32 of internal_key.size() // key bytes : char[internal_key.size()] // value_size : varint32 of value.size() // value bytes : char[value.size()] size_t key_size = key.size(); size_t val_size = value.size(); size_t internal_key_size = key_size + 8; const size_t encoded_len = VarintLength(internal_key_size) + internal_key_size + VarintLength(val_size) + val_size; char* buf = arena_.Allocate(encoded_len); char* p = EncodeVarint32(buf, internal_key_size); memcpy(p, key.data(), key_size); p += key_size; EncodeFixed64(p, (s << 8) | type); p += 8; p = EncodeVarint32(p, val_size); memcpy(p, value.data(), val_size); assert((p + val_size) - buf == encoded_len); table_.Insert(buf); } bool MemTable::Get(const LookupKey& key, std::string* value, Status* s) { Slice memkey = key.memtable_key(); Table::Iterator iter(&table_); iter.Seek(memkey.data()); if (iter.Valid()) { // entry format is: // klength varint32 // userkey char[klength] // tag uint64 // vlength varint32 // value char[vlength] // Check that it belongs to same user key. We do not check the // sequence number since the Seek() call above should have skipped // all entries with overly large sequence numbers. const char* entry = iter.key(); uint32_t key_length; const char* key_ptr = GetVarint32Ptr(entry, entry+5, &key_length); if (comparator_.comparator.user_comparator()->Compare( Slice(key_ptr, key_length - 8), key.user_key()) == 0) { // Correct user key const uint64_t tag = DecodeFixed64(key_ptr + key_length - 8); switch (static_cast(tag & 0xff)) { case kTypeValue: { Slice v = GetLengthPrefixedSlice(key_ptr + key_length); value->assign(v.data(), v.size()); return true; } case kTypeDeletion: *s = Status::NotFound(Slice()); return true; } } } return false; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/corruption_test.cc0000644000000000000000000002357312414772654021501 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/db.h" #include #include #include #include #include "leveldb/cache.h" #include "leveldb/env.h" #include "leveldb/table.h" #include "leveldb/write_batch.h" #include "db/db_impl.h" #include "db/filename.h" #include "db/log_format.h" #include "db/version_set.h" #include "util/logging.h" #include "util/testharness.h" #include "util/testutil.h" namespace leveldb { static const int kValueSize = 1000; class CorruptionTest { public: test::ErrorEnv env_; std::string dbname_; Cache* tiny_cache_; Options options_; DB* db_; CorruptionTest() { tiny_cache_ = NewLRUCache(100); options_.env = &env_; options_.block_cache = tiny_cache_; dbname_ = test::TmpDir() + "/db_test"; DestroyDB(dbname_, options_); db_ = NULL; options_.create_if_missing = true; Reopen(); options_.create_if_missing = false; } ~CorruptionTest() { delete db_; DestroyDB(dbname_, Options()); delete tiny_cache_; } Status TryReopen() { delete db_; db_ = NULL; return DB::Open(options_, dbname_, &db_); } void Reopen() { ASSERT_OK(TryReopen()); } void RepairDB() { delete db_; db_ = NULL; ASSERT_OK(::leveldb::RepairDB(dbname_, options_)); } void Build(int n) { std::string key_space, value_space; WriteBatch batch; for (int i = 0; i < n; i++) { //if ((i % 100) == 0) fprintf(stderr, "@ %d of %d\n", i, n); Slice key = Key(i, &key_space); batch.Clear(); batch.Put(key, Value(i, &value_space)); WriteOptions options; // Corrupt() doesn't work without this sync on windows; stat reports 0 for // the file size. if (i == n - 1) { options.sync = true; } ASSERT_OK(db_->Write(options, &batch)); } } void Check(int min_expected, int max_expected) { int next_expected = 0; int missed = 0; int bad_keys = 0; int bad_values = 0; int correct = 0; std::string value_space; Iterator* iter = db_->NewIterator(ReadOptions()); for (iter->SeekToFirst(); iter->Valid(); iter->Next()) { uint64_t key; Slice in(iter->key()); if (in == "" || in == "~") { // Ignore boundary keys. continue; } if (!ConsumeDecimalNumber(&in, &key) || !in.empty() || key < next_expected) { bad_keys++; continue; } missed += (key - next_expected); next_expected = key + 1; if (iter->value() != Value(key, &value_space)) { bad_values++; } else { correct++; } } delete iter; fprintf(stderr, "expected=%d..%d; got=%d; bad_keys=%d; bad_values=%d; missed=%d\n", min_expected, max_expected, correct, bad_keys, bad_values, missed); ASSERT_LE(min_expected, correct); ASSERT_GE(max_expected, correct); } void Corrupt(FileType filetype, int offset, int bytes_to_corrupt) { // Pick file to corrupt std::vector filenames; ASSERT_OK(env_.GetChildren(dbname_, &filenames)); uint64_t number; FileType type; std::string fname; int picked_number = -1; for (size_t i = 0; i < filenames.size(); i++) { if (ParseFileName(filenames[i], &number, &type) && type == filetype && int(number) > picked_number) { // Pick latest file fname = dbname_ + "/" + filenames[i]; picked_number = number; } } ASSERT_TRUE(!fname.empty()) << filetype; struct stat sbuf; if (stat(fname.c_str(), &sbuf) != 0) { const char* msg = strerror(errno); ASSERT_TRUE(false) << fname << ": " << msg; } if (offset < 0) { // Relative to end of file; make it absolute if (-offset > sbuf.st_size) { offset = 0; } else { offset = sbuf.st_size + offset; } } if (offset > sbuf.st_size) { offset = sbuf.st_size; } if (offset + bytes_to_corrupt > sbuf.st_size) { bytes_to_corrupt = sbuf.st_size - offset; } // Do it std::string contents; Status s = ReadFileToString(Env::Default(), fname, &contents); ASSERT_TRUE(s.ok()) << s.ToString(); for (int i = 0; i < bytes_to_corrupt; i++) { contents[i + offset] ^= 0x80; } s = WriteStringToFile(Env::Default(), contents, fname); ASSERT_TRUE(s.ok()) << s.ToString(); } int Property(const std::string& name) { std::string property; int result; if (db_->GetProperty(name, &property) && sscanf(property.c_str(), "%d", &result) == 1) { return result; } else { return -1; } } // Return the ith key Slice Key(int i, std::string* storage) { char buf[100]; snprintf(buf, sizeof(buf), "%016d", i); storage->assign(buf, strlen(buf)); return Slice(*storage); } // Return the value to associate with the specified key Slice Value(int k, std::string* storage) { Random r(k); return test::RandomString(&r, kValueSize, storage); } }; TEST(CorruptionTest, Recovery) { Build(100); Check(100, 100); Corrupt(kLogFile, 19, 1); // WriteBatch tag for first record Corrupt(kLogFile, log::kBlockSize + 1000, 1); // Somewhere in second block Reopen(); // The 64 records in the first two log blocks are completely lost. Check(36, 36); } TEST(CorruptionTest, RecoverWriteError) { env_.writable_file_error_ = true; Status s = TryReopen(); ASSERT_TRUE(!s.ok()); } TEST(CorruptionTest, NewFileErrorDuringWrite) { // Do enough writing to force minor compaction env_.writable_file_error_ = true; const int num = 3 + (Options().write_buffer_size / kValueSize); std::string value_storage; Status s; for (int i = 0; s.ok() && i < num; i++) { WriteBatch batch; batch.Put("a", Value(100, &value_storage)); s = db_->Write(WriteOptions(), &batch); } ASSERT_TRUE(!s.ok()); ASSERT_GE(env_.num_writable_file_errors_, 1); env_.writable_file_error_ = false; Reopen(); } TEST(CorruptionTest, TableFile) { Build(100); DBImpl* dbi = reinterpret_cast(db_); dbi->TEST_CompactMemTable(); dbi->TEST_CompactRange(0, NULL, NULL); dbi->TEST_CompactRange(1, NULL, NULL); Corrupt(kTableFile, 100, 1); Check(90, 99); } TEST(CorruptionTest, TableFileRepair) { options_.block_size = 2 * kValueSize; // Limit scope of corruption options_.paranoid_checks = true; Reopen(); Build(100); DBImpl* dbi = reinterpret_cast(db_); dbi->TEST_CompactMemTable(); dbi->TEST_CompactRange(0, NULL, NULL); dbi->TEST_CompactRange(1, NULL, NULL); Corrupt(kTableFile, 100, 1); RepairDB(); Reopen(); Check(95, 99); } TEST(CorruptionTest, TableFileIndexData) { Build(10000); // Enough to build multiple Tables DBImpl* dbi = reinterpret_cast(db_); dbi->TEST_CompactMemTable(); Corrupt(kTableFile, -2000, 500); Reopen(); Check(5000, 9999); } TEST(CorruptionTest, MissingDescriptor) { Build(1000); RepairDB(); Reopen(); Check(1000, 1000); } TEST(CorruptionTest, SequenceNumberRecovery) { ASSERT_OK(db_->Put(WriteOptions(), "foo", "v1")); ASSERT_OK(db_->Put(WriteOptions(), "foo", "v2")); ASSERT_OK(db_->Put(WriteOptions(), "foo", "v3")); ASSERT_OK(db_->Put(WriteOptions(), "foo", "v4")); ASSERT_OK(db_->Put(WriteOptions(), "foo", "v5")); RepairDB(); Reopen(); std::string v; ASSERT_OK(db_->Get(ReadOptions(), "foo", &v)); ASSERT_EQ("v5", v); // Write something. If sequence number was not recovered properly, // it will be hidden by an earlier write. ASSERT_OK(db_->Put(WriteOptions(), "foo", "v6")); ASSERT_OK(db_->Get(ReadOptions(), "foo", &v)); ASSERT_EQ("v6", v); Reopen(); ASSERT_OK(db_->Get(ReadOptions(), "foo", &v)); ASSERT_EQ("v6", v); } TEST(CorruptionTest, CorruptedDescriptor) { ASSERT_OK(db_->Put(WriteOptions(), "foo", "hello")); DBImpl* dbi = reinterpret_cast(db_); dbi->TEST_CompactMemTable(); dbi->TEST_CompactRange(0, NULL, NULL); Corrupt(kDescriptorFile, 0, 1000); Status s = TryReopen(); ASSERT_TRUE(!s.ok()); RepairDB(); Reopen(); std::string v; ASSERT_OK(db_->Get(ReadOptions(), "foo", &v)); ASSERT_EQ("hello", v); } TEST(CorruptionTest, CompactionInputError) { Build(10); DBImpl* dbi = reinterpret_cast(db_); dbi->TEST_CompactMemTable(); const int last = config::kMaxMemCompactLevel; ASSERT_EQ(1, Property("leveldb.num-files-at-level" + NumberToString(last))); Corrupt(kTableFile, 100, 1); Check(5, 9); // Force compactions by writing lots of values Build(10000); Check(10000, 10000); } TEST(CorruptionTest, CompactionInputErrorParanoid) { options_.paranoid_checks = true; options_.write_buffer_size = 512 << 10; Reopen(); DBImpl* dbi = reinterpret_cast(db_); // Make multiple inputs so we need to compact. for (int i = 0; i < 2; i++) { Build(10); dbi->TEST_CompactMemTable(); Corrupt(kTableFile, 100, 1); env_.SleepForMicroseconds(100000); } dbi->CompactRange(NULL, NULL); // Write must fail because of corrupted table std::string tmp1, tmp2; Status s = db_->Put(WriteOptions(), Key(5, &tmp1), Value(5, &tmp2)); ASSERT_TRUE(!s.ok()) << "write did not fail in corrupted paranoid db"; } TEST(CorruptionTest, UnrelatedKeys) { Build(10); DBImpl* dbi = reinterpret_cast(db_); dbi->TEST_CompactMemTable(); Corrupt(kTableFile, 100, 1); std::string tmp1, tmp2; ASSERT_OK(db_->Put(WriteOptions(), Key(1000, &tmp1), Value(1000, &tmp2))); std::string v; ASSERT_OK(db_->Get(ReadOptions(), Key(1000, &tmp1), &v)); ASSERT_EQ(Value(1000, &tmp2).ToString(), v); dbi->TEST_CompactMemTable(); ASSERT_OK(db_->Get(ReadOptions(), Key(1000, &tmp1), &v)); ASSERT_EQ(Value(1000, &tmp2).ToString(), v); } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/db/db_impl.cc0000644000000000000000000013134212414772654017636 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/db_impl.h" #include #include #include #include #include #include #include "db/builder.h" #include "db/db_iter.h" #include "db/dbformat.h" #include "db/filename.h" #include "db/log_reader.h" #include "db/log_writer.h" #include "db/memtable.h" #include "db/table_cache.h" #include "db/version_set.h" #include "db/write_batch_internal.h" #include "leveldb/db.h" #include "leveldb/env.h" #include "leveldb/status.h" #include "leveldb/table.h" #include "leveldb/table_builder.h" #include "port/port.h" #include "table/block.h" #include "table/merger.h" #include "table/two_level_iterator.h" #include "util/coding.h" #include "util/logging.h" #include "util/mutexlock.h" namespace leveldb { const int kNumNonTableCacheFiles = 10; // Information kept for every waiting writer struct DBImpl::Writer { Status status; WriteBatch* batch; bool sync; bool done; port::CondVar cv; explicit Writer(port::Mutex* mu) : cv(mu) { } }; struct DBImpl::CompactionState { Compaction* const compaction; // Sequence numbers < smallest_snapshot are not significant since we // will never have to service a snapshot below smallest_snapshot. // Therefore if we have seen a sequence number S <= smallest_snapshot, // we can drop all entries for the same key with sequence numbers < S. SequenceNumber smallest_snapshot; // Files produced by compaction struct Output { uint64_t number; uint64_t file_size; InternalKey smallest, largest; }; std::vector outputs; // State kept for output being generated WritableFile* outfile; TableBuilder* builder; uint64_t total_bytes; Output* current_output() { return &outputs[outputs.size()-1]; } explicit CompactionState(Compaction* c) : compaction(c), outfile(NULL), builder(NULL), total_bytes(0) { } }; // Fix user-supplied options to be reasonable template static void ClipToRange(T* ptr, V minvalue, V maxvalue) { if (static_cast(*ptr) > maxvalue) *ptr = maxvalue; if (static_cast(*ptr) < minvalue) *ptr = minvalue; } Options SanitizeOptions(const std::string& dbname, const InternalKeyComparator* icmp, const InternalFilterPolicy* ipolicy, const Options& src) { Options result = src; result.comparator = icmp; result.filter_policy = (src.filter_policy != NULL) ? ipolicy : NULL; ClipToRange(&result.max_open_files, 64 + kNumNonTableCacheFiles, 50000); ClipToRange(&result.write_buffer_size, 64<<10, 1<<30); ClipToRange(&result.block_size, 1<<10, 4<<20); if (result.info_log == NULL) { // Open a log file in the same directory as the db src.env->CreateDir(dbname); // In case it does not exist src.env->RenameFile(InfoLogFileName(dbname), OldInfoLogFileName(dbname)); Status s = src.env->NewLogger(InfoLogFileName(dbname), &result.info_log); if (!s.ok()) { // No place suitable for logging result.info_log = NULL; } } if (result.block_cache == NULL) { result.block_cache = NewLRUCache(8 << 20); } return result; } DBImpl::DBImpl(const Options& raw_options, const std::string& dbname) : env_(raw_options.env), internal_comparator_(raw_options.comparator), internal_filter_policy_(raw_options.filter_policy), options_(SanitizeOptions(dbname, &internal_comparator_, &internal_filter_policy_, raw_options)), owns_info_log_(options_.info_log != raw_options.info_log), owns_cache_(options_.block_cache != raw_options.block_cache), dbname_(dbname), db_lock_(NULL), shutting_down_(NULL), bg_cv_(&mutex_), mem_(new MemTable(internal_comparator_)), imm_(NULL), logfile_(NULL), logfile_number_(0), log_(NULL), seed_(0), tmp_batch_(new WriteBatch), bg_compaction_scheduled_(false), manual_compaction_(NULL) { mem_->Ref(); has_imm_.Release_Store(NULL); // Reserve ten files or so for other uses and give the rest to TableCache. const int table_cache_size = options_.max_open_files - kNumNonTableCacheFiles; table_cache_ = new TableCache(dbname_, &options_, table_cache_size); versions_ = new VersionSet(dbname_, &options_, table_cache_, &internal_comparator_); } DBImpl::~DBImpl() { // Wait for background work to finish mutex_.Lock(); shutting_down_.Release_Store(this); // Any non-NULL value is ok while (bg_compaction_scheduled_) { bg_cv_.Wait(); } mutex_.Unlock(); if (db_lock_ != NULL) { env_->UnlockFile(db_lock_); } delete versions_; if (mem_ != NULL) mem_->Unref(); if (imm_ != NULL) imm_->Unref(); delete tmp_batch_; delete log_; delete logfile_; delete table_cache_; if (owns_info_log_) { delete options_.info_log; } if (owns_cache_) { delete options_.block_cache; } } Status DBImpl::NewDB() { VersionEdit new_db; new_db.SetComparatorName(user_comparator()->Name()); new_db.SetLogNumber(0); new_db.SetNextFile(2); new_db.SetLastSequence(0); const std::string manifest = DescriptorFileName(dbname_, 1); WritableFile* file; Status s = env_->NewWritableFile(manifest, &file); if (!s.ok()) { return s; } { log::Writer log(file); std::string record; new_db.EncodeTo(&record); s = log.AddRecord(record); if (s.ok()) { s = file->Close(); } } delete file; if (s.ok()) { // Make "CURRENT" file that points to the new manifest file. s = SetCurrentFile(env_, dbname_, 1); } else { env_->DeleteFile(manifest); } return s; } void DBImpl::MaybeIgnoreError(Status* s) const { if (s->ok() || options_.paranoid_checks) { // No change needed } else { Log(options_.info_log, "Ignoring error %s", s->ToString().c_str()); *s = Status::OK(); } } void DBImpl::DeleteObsoleteFiles() { if (!bg_error_.ok()) { // After a background error, we don't know whether a new version may // or may not have been committed, so we cannot safely garbage collect. return; } // Make a set of all of the live files std::set live = pending_outputs_; versions_->AddLiveFiles(&live); std::vector filenames; env_->GetChildren(dbname_, &filenames); // Ignoring errors on purpose uint64_t number; FileType type; for (size_t i = 0; i < filenames.size(); i++) { if (ParseFileName(filenames[i], &number, &type)) { bool keep = true; switch (type) { case kLogFile: keep = ((number >= versions_->LogNumber()) || (number == versions_->PrevLogNumber())); break; case kDescriptorFile: // Keep my manifest file, and any newer incarnations' // (in case there is a race that allows other incarnations) keep = (number >= versions_->ManifestFileNumber()); break; case kTableFile: keep = (live.find(number) != live.end()); break; case kTempFile: // Any temp files that are currently being written to must // be recorded in pending_outputs_, which is inserted into "live" keep = (live.find(number) != live.end()); break; case kCurrentFile: case kDBLockFile: case kInfoLogFile: keep = true; break; } if (!keep) { if (type == kTableFile) { table_cache_->Evict(number); } Log(options_.info_log, "Delete type=%d #%lld\n", int(type), static_cast(number)); env_->DeleteFile(dbname_ + "/" + filenames[i]); } } } } Status DBImpl::Recover(VersionEdit* edit) { mutex_.AssertHeld(); // Ignore error from CreateDir since the creation of the DB is // committed only when the descriptor is created, and this directory // may already exist from a previous failed creation attempt. env_->CreateDir(dbname_); assert(db_lock_ == NULL); Status s = env_->LockFile(LockFileName(dbname_), &db_lock_); if (!s.ok()) { return s; } if (!env_->FileExists(CurrentFileName(dbname_))) { if (options_.create_if_missing) { s = NewDB(); if (!s.ok()) { return s; } } else { return Status::InvalidArgument( dbname_, "does not exist (create_if_missing is false)"); } } else { if (options_.error_if_exists) { return Status::InvalidArgument( dbname_, "exists (error_if_exists is true)"); } } s = versions_->Recover(); if (s.ok()) { SequenceNumber max_sequence(0); // Recover from all newer log files than the ones named in the // descriptor (new log files may have been added by the previous // incarnation without registering them in the descriptor). // // Note that PrevLogNumber() is no longer used, but we pay // attention to it in case we are recovering a database // produced by an older version of leveldb. const uint64_t min_log = versions_->LogNumber(); const uint64_t prev_log = versions_->PrevLogNumber(); std::vector filenames; s = env_->GetChildren(dbname_, &filenames); if (!s.ok()) { return s; } std::set expected; versions_->AddLiveFiles(&expected); uint64_t number; FileType type; std::vector logs; for (size_t i = 0; i < filenames.size(); i++) { if (ParseFileName(filenames[i], &number, &type)) { expected.erase(number); if (type == kLogFile && ((number >= min_log) || (number == prev_log))) logs.push_back(number); } } if (!expected.empty()) { char buf[50]; snprintf(buf, sizeof(buf), "%d missing files; e.g.", static_cast(expected.size())); return Status::Corruption(buf, TableFileName(dbname_, *(expected.begin()))); } // Recover in the order in which the logs were generated std::sort(logs.begin(), logs.end()); for (size_t i = 0; i < logs.size(); i++) { s = RecoverLogFile(logs[i], edit, &max_sequence); // The previous incarnation may not have written any MANIFEST // records after allocating this log number. So we manually // update the file number allocation counter in VersionSet. versions_->MarkFileNumberUsed(logs[i]); } if (s.ok()) { if (versions_->LastSequence() < max_sequence) { versions_->SetLastSequence(max_sequence); } } } return s; } Status DBImpl::RecoverLogFile(uint64_t log_number, VersionEdit* edit, SequenceNumber* max_sequence) { struct LogReporter : public log::Reader::Reporter { Env* env; Logger* info_log; const char* fname; Status* status; // NULL if options_.paranoid_checks==false virtual void Corruption(size_t bytes, const Status& s) { Log(info_log, "%s%s: dropping %d bytes; %s", (this->status == NULL ? "(ignoring error) " : ""), fname, static_cast(bytes), s.ToString().c_str()); if (this->status != NULL && this->status->ok()) *this->status = s; } }; mutex_.AssertHeld(); // Open the log file std::string fname = LogFileName(dbname_, log_number); SequentialFile* file; Status status = env_->NewSequentialFile(fname, &file); if (!status.ok()) { MaybeIgnoreError(&status); return status; } // Create the log reader. LogReporter reporter; reporter.env = env_; reporter.info_log = options_.info_log; reporter.fname = fname.c_str(); reporter.status = (options_.paranoid_checks ? &status : NULL); // We intentially make log::Reader do checksumming even if // paranoid_checks==false so that corruptions cause entire commits // to be skipped instead of propagating bad information (like overly // large sequence numbers). log::Reader reader(file, &reporter, true/*checksum*/, 0/*initial_offset*/); Log(options_.info_log, "Recovering log #%llu", (unsigned long long) log_number); // Read all the records and add to a memtable std::string scratch; Slice record; WriteBatch batch; MemTable* mem = NULL; while (reader.ReadRecord(&record, &scratch) && status.ok()) { if (record.size() < 12) { reporter.Corruption( record.size(), Status::Corruption("log record too small")); continue; } WriteBatchInternal::SetContents(&batch, record); if (mem == NULL) { mem = new MemTable(internal_comparator_); mem->Ref(); } status = WriteBatchInternal::InsertInto(&batch, mem); MaybeIgnoreError(&status); if (!status.ok()) { break; } const SequenceNumber last_seq = WriteBatchInternal::Sequence(&batch) + WriteBatchInternal::Count(&batch) - 1; if (last_seq > *max_sequence) { *max_sequence = last_seq; } if (mem->ApproximateMemoryUsage() > options_.write_buffer_size) { status = WriteLevel0Table(mem, edit, NULL); if (!status.ok()) { // Reflect errors immediately so that conditions like full // file-systems cause the DB::Open() to fail. break; } mem->Unref(); mem = NULL; } } if (status.ok() && mem != NULL) { status = WriteLevel0Table(mem, edit, NULL); // Reflect errors immediately so that conditions like full // file-systems cause the DB::Open() to fail. } if (mem != NULL) mem->Unref(); delete file; return status; } Status DBImpl::WriteLevel0Table(MemTable* mem, VersionEdit* edit, Version* base) { mutex_.AssertHeld(); const uint64_t start_micros = env_->NowMicros(); FileMetaData meta; meta.number = versions_->NewFileNumber(); pending_outputs_.insert(meta.number); Iterator* iter = mem->NewIterator(); Log(options_.info_log, "Level-0 table #%llu: started", (unsigned long long) meta.number); Status s; { mutex_.Unlock(); s = BuildTable(dbname_, env_, options_, table_cache_, iter, &meta); mutex_.Lock(); } Log(options_.info_log, "Level-0 table #%llu: %lld bytes %s", (unsigned long long) meta.number, (unsigned long long) meta.file_size, s.ToString().c_str()); delete iter; pending_outputs_.erase(meta.number); // Note that if file_size is zero, the file has been deleted and // should not be added to the manifest. int level = 0; if (s.ok() && meta.file_size > 0) { const Slice min_user_key = meta.smallest.user_key(); const Slice max_user_key = meta.largest.user_key(); if (base != NULL) { level = base->PickLevelForMemTableOutput(min_user_key, max_user_key); } edit->AddFile(level, meta.number, meta.file_size, meta.smallest, meta.largest); } CompactionStats stats; stats.micros = env_->NowMicros() - start_micros; stats.bytes_written = meta.file_size; stats_[level].Add(stats); return s; } void DBImpl::CompactMemTable() { mutex_.AssertHeld(); assert(imm_ != NULL); // Save the contents of the memtable as a new Table VersionEdit edit; Version* base = versions_->current(); base->Ref(); Status s = WriteLevel0Table(imm_, &edit, base); base->Unref(); if (s.ok() && shutting_down_.Acquire_Load()) { s = Status::IOError("Deleting DB during memtable compaction"); } // Replace immutable memtable with the generated Table if (s.ok()) { edit.SetPrevLogNumber(0); edit.SetLogNumber(logfile_number_); // Earlier logs no longer needed s = versions_->LogAndApply(&edit, &mutex_); } if (s.ok()) { // Commit to the new state imm_->Unref(); imm_ = NULL; has_imm_.Release_Store(NULL); DeleteObsoleteFiles(); } else { RecordBackgroundError(s); } } void DBImpl::CompactRange(const Slice* begin, const Slice* end) { int max_level_with_files = 1; { MutexLock l(&mutex_); Version* base = versions_->current(); for (int level = 1; level < config::kNumLevels; level++) { if (base->OverlapInLevel(level, begin, end)) { max_level_with_files = level; } } } TEST_CompactMemTable(); // TODO(sanjay): Skip if memtable does not overlap for (int level = 0; level < max_level_with_files; level++) { TEST_CompactRange(level, begin, end); } } void DBImpl::TEST_CompactRange(int level, const Slice* begin,const Slice* end) { assert(level >= 0); assert(level + 1 < config::kNumLevels); InternalKey begin_storage, end_storage; ManualCompaction manual; manual.level = level; manual.done = false; if (begin == NULL) { manual.begin = NULL; } else { begin_storage = InternalKey(*begin, kMaxSequenceNumber, kValueTypeForSeek); manual.begin = &begin_storage; } if (end == NULL) { manual.end = NULL; } else { end_storage = InternalKey(*end, 0, static_cast(0)); manual.end = &end_storage; } MutexLock l(&mutex_); while (!manual.done && !shutting_down_.Acquire_Load() && bg_error_.ok()) { if (manual_compaction_ == NULL) { // Idle manual_compaction_ = &manual; MaybeScheduleCompaction(); } else { // Running either my compaction or another compaction. bg_cv_.Wait(); } } if (manual_compaction_ == &manual) { // Cancel my manual compaction since we aborted early for some reason. manual_compaction_ = NULL; } } Status DBImpl::TEST_CompactMemTable() { // NULL batch means just wait for earlier writes to be done Status s = Write(WriteOptions(), NULL); if (s.ok()) { // Wait until the compaction completes MutexLock l(&mutex_); while (imm_ != NULL && bg_error_.ok()) { bg_cv_.Wait(); } if (imm_ != NULL) { s = bg_error_; } } return s; } void DBImpl::RecordBackgroundError(const Status& s) { mutex_.AssertHeld(); if (bg_error_.ok()) { bg_error_ = s; bg_cv_.SignalAll(); } } void DBImpl::MaybeScheduleCompaction() { mutex_.AssertHeld(); if (bg_compaction_scheduled_) { // Already scheduled } else if (shutting_down_.Acquire_Load()) { // DB is being deleted; no more background compactions } else if (!bg_error_.ok()) { // Already got an error; no more changes } else if (imm_ == NULL && manual_compaction_ == NULL && !versions_->NeedsCompaction()) { // No work to be done } else { bg_compaction_scheduled_ = true; env_->Schedule(&DBImpl::BGWork, this); } } void DBImpl::BGWork(void* db) { reinterpret_cast(db)->BackgroundCall(); } void DBImpl::BackgroundCall() { MutexLock l(&mutex_); assert(bg_compaction_scheduled_); if (shutting_down_.Acquire_Load()) { // No more background work when shutting down. } else if (!bg_error_.ok()) { // No more background work after a background error. } else { BackgroundCompaction(); } bg_compaction_scheduled_ = false; // Previous compaction may have produced too many files in a level, // so reschedule another compaction if needed. MaybeScheduleCompaction(); bg_cv_.SignalAll(); } void DBImpl::BackgroundCompaction() { mutex_.AssertHeld(); if (imm_ != NULL) { CompactMemTable(); return; } Compaction* c; bool is_manual = (manual_compaction_ != NULL); InternalKey manual_end; if (is_manual) { ManualCompaction* m = manual_compaction_; c = versions_->CompactRange(m->level, m->begin, m->end); m->done = (c == NULL); if (c != NULL) { manual_end = c->input(0, c->num_input_files(0) - 1)->largest; } Log(options_.info_log, "Manual compaction at level-%d from %s .. %s; will stop at %s\n", m->level, (m->begin ? m->begin->DebugString().c_str() : "(begin)"), (m->end ? m->end->DebugString().c_str() : "(end)"), (m->done ? "(end)" : manual_end.DebugString().c_str())); } else { c = versions_->PickCompaction(); } Status status; if (c == NULL) { // Nothing to do } else if (!is_manual && c->IsTrivialMove()) { // Move file to next level assert(c->num_input_files(0) == 1); FileMetaData* f = c->input(0, 0); c->edit()->DeleteFile(c->level(), f->number); c->edit()->AddFile(c->level() + 1, f->number, f->file_size, f->smallest, f->largest); status = versions_->LogAndApply(c->edit(), &mutex_); if (!status.ok()) { RecordBackgroundError(status); } VersionSet::LevelSummaryStorage tmp; Log(options_.info_log, "Moved #%lld to level-%d %lld bytes %s: %s\n", static_cast(f->number), c->level() + 1, static_cast(f->file_size), status.ToString().c_str(), versions_->LevelSummary(&tmp)); } else { CompactionState* compact = new CompactionState(c); status = DoCompactionWork(compact); if (!status.ok()) { RecordBackgroundError(status); } CleanupCompaction(compact); c->ReleaseInputs(); DeleteObsoleteFiles(); } delete c; if (status.ok()) { // Done } else if (shutting_down_.Acquire_Load()) { // Ignore compaction errors found during shutting down } else { Log(options_.info_log, "Compaction error: %s", status.ToString().c_str()); } if (is_manual) { ManualCompaction* m = manual_compaction_; if (!status.ok()) { m->done = true; } if (!m->done) { // We only compacted part of the requested range. Update *m // to the range that is left to be compacted. m->tmp_storage = manual_end; m->begin = &m->tmp_storage; } manual_compaction_ = NULL; } } void DBImpl::CleanupCompaction(CompactionState* compact) { mutex_.AssertHeld(); if (compact->builder != NULL) { // May happen if we get a shutdown call in the middle of compaction compact->builder->Abandon(); delete compact->builder; } else { assert(compact->outfile == NULL); } delete compact->outfile; for (size_t i = 0; i < compact->outputs.size(); i++) { const CompactionState::Output& out = compact->outputs[i]; pending_outputs_.erase(out.number); } delete compact; } Status DBImpl::OpenCompactionOutputFile(CompactionState* compact) { assert(compact != NULL); assert(compact->builder == NULL); uint64_t file_number; { mutex_.Lock(); file_number = versions_->NewFileNumber(); pending_outputs_.insert(file_number); CompactionState::Output out; out.number = file_number; out.smallest.Clear(); out.largest.Clear(); compact->outputs.push_back(out); mutex_.Unlock(); } // Make the output file std::string fname = TableFileName(dbname_, file_number); Status s = env_->NewWritableFile(fname, &compact->outfile); if (s.ok()) { compact->builder = new TableBuilder(options_, compact->outfile); } return s; } Status DBImpl::FinishCompactionOutputFile(CompactionState* compact, Iterator* input) { assert(compact != NULL); assert(compact->outfile != NULL); assert(compact->builder != NULL); const uint64_t output_number = compact->current_output()->number; assert(output_number != 0); // Check for iterator errors Status s = input->status(); const uint64_t current_entries = compact->builder->NumEntries(); if (s.ok()) { s = compact->builder->Finish(); } else { compact->builder->Abandon(); } const uint64_t current_bytes = compact->builder->FileSize(); compact->current_output()->file_size = current_bytes; compact->total_bytes += current_bytes; delete compact->builder; compact->builder = NULL; // Finish and check for file errors if (s.ok()) { s = compact->outfile->Sync(); } if (s.ok()) { s = compact->outfile->Close(); } delete compact->outfile; compact->outfile = NULL; if (s.ok() && current_entries > 0) { // Verify that the table is usable Iterator* iter = table_cache_->NewIterator(ReadOptions(), output_number, current_bytes); s = iter->status(); delete iter; if (s.ok()) { Log(options_.info_log, "Generated table #%llu: %lld keys, %lld bytes", (unsigned long long) output_number, (unsigned long long) current_entries, (unsigned long long) current_bytes); } } return s; } Status DBImpl::InstallCompactionResults(CompactionState* compact) { mutex_.AssertHeld(); Log(options_.info_log, "Compacted %d@%d + %d@%d files => %lld bytes", compact->compaction->num_input_files(0), compact->compaction->level(), compact->compaction->num_input_files(1), compact->compaction->level() + 1, static_cast(compact->total_bytes)); // Add compaction outputs compact->compaction->AddInputDeletions(compact->compaction->edit()); const int level = compact->compaction->level(); for (size_t i = 0; i < compact->outputs.size(); i++) { const CompactionState::Output& out = compact->outputs[i]; compact->compaction->edit()->AddFile( level + 1, out.number, out.file_size, out.smallest, out.largest); } return versions_->LogAndApply(compact->compaction->edit(), &mutex_); } Status DBImpl::DoCompactionWork(CompactionState* compact) { const uint64_t start_micros = env_->NowMicros(); int64_t imm_micros = 0; // Micros spent doing imm_ compactions Log(options_.info_log, "Compacting %d@%d + %d@%d files", compact->compaction->num_input_files(0), compact->compaction->level(), compact->compaction->num_input_files(1), compact->compaction->level() + 1); assert(versions_->NumLevelFiles(compact->compaction->level()) > 0); assert(compact->builder == NULL); assert(compact->outfile == NULL); if (snapshots_.empty()) { compact->smallest_snapshot = versions_->LastSequence(); } else { compact->smallest_snapshot = snapshots_.oldest()->number_; } // Release mutex while we're actually doing the compaction work mutex_.Unlock(); Iterator* input = versions_->MakeInputIterator(compact->compaction); input->SeekToFirst(); Status status; ParsedInternalKey ikey; std::string current_user_key; bool has_current_user_key = false; SequenceNumber last_sequence_for_key = kMaxSequenceNumber; for (; input->Valid() && !shutting_down_.Acquire_Load(); ) { // Prioritize immutable compaction work if (has_imm_.NoBarrier_Load() != NULL) { const uint64_t imm_start = env_->NowMicros(); mutex_.Lock(); if (imm_ != NULL) { CompactMemTable(); bg_cv_.SignalAll(); // Wakeup MakeRoomForWrite() if necessary } mutex_.Unlock(); imm_micros += (env_->NowMicros() - imm_start); } Slice key = input->key(); if (compact->compaction->ShouldStopBefore(key) && compact->builder != NULL) { status = FinishCompactionOutputFile(compact, input); if (!status.ok()) { break; } } // Handle key/value, add to state, etc. bool drop = false; if (!ParseInternalKey(key, &ikey)) { // Do not hide error keys current_user_key.clear(); has_current_user_key = false; last_sequence_for_key = kMaxSequenceNumber; } else { if (!has_current_user_key || user_comparator()->Compare(ikey.user_key, Slice(current_user_key)) != 0) { // First occurrence of this user key current_user_key.assign(ikey.user_key.data(), ikey.user_key.size()); has_current_user_key = true; last_sequence_for_key = kMaxSequenceNumber; } if (last_sequence_for_key <= compact->smallest_snapshot) { // Hidden by an newer entry for same user key drop = true; // (A) } else if (ikey.type == kTypeDeletion && ikey.sequence <= compact->smallest_snapshot && compact->compaction->IsBaseLevelForKey(ikey.user_key)) { // For this user key: // (1) there is no data in higher levels // (2) data in lower levels will have larger sequence numbers // (3) data in layers that are being compacted here and have // smaller sequence numbers will be dropped in the next // few iterations of this loop (by rule (A) above). // Therefore this deletion marker is obsolete and can be dropped. drop = true; } last_sequence_for_key = ikey.sequence; } #if 0 Log(options_.info_log, " Compact: %s, seq %d, type: %d %d, drop: %d, is_base: %d, " "%d smallest_snapshot: %d", ikey.user_key.ToString().c_str(), (int)ikey.sequence, ikey.type, kTypeValue, drop, compact->compaction->IsBaseLevelForKey(ikey.user_key), (int)last_sequence_for_key, (int)compact->smallest_snapshot); #endif if (!drop) { // Open output file if necessary if (compact->builder == NULL) { status = OpenCompactionOutputFile(compact); if (!status.ok()) { break; } } if (compact->builder->NumEntries() == 0) { compact->current_output()->smallest.DecodeFrom(key); } compact->current_output()->largest.DecodeFrom(key); compact->builder->Add(key, input->value()); // Close output file if it is big enough if (compact->builder->FileSize() >= compact->compaction->MaxOutputFileSize()) { status = FinishCompactionOutputFile(compact, input); if (!status.ok()) { break; } } } input->Next(); } if (status.ok() && shutting_down_.Acquire_Load()) { status = Status::IOError("Deleting DB during compaction"); } if (status.ok() && compact->builder != NULL) { status = FinishCompactionOutputFile(compact, input); } if (status.ok()) { status = input->status(); } delete input; input = NULL; CompactionStats stats; stats.micros = env_->NowMicros() - start_micros - imm_micros; for (int which = 0; which < 2; which++) { for (int i = 0; i < compact->compaction->num_input_files(which); i++) { stats.bytes_read += compact->compaction->input(which, i)->file_size; } } for (size_t i = 0; i < compact->outputs.size(); i++) { stats.bytes_written += compact->outputs[i].file_size; } mutex_.Lock(); stats_[compact->compaction->level() + 1].Add(stats); if (status.ok()) { status = InstallCompactionResults(compact); } if (!status.ok()) { RecordBackgroundError(status); } VersionSet::LevelSummaryStorage tmp; Log(options_.info_log, "compacted to: %s", versions_->LevelSummary(&tmp)); return status; } namespace { struct IterState { port::Mutex* mu; Version* version; MemTable* mem; MemTable* imm; }; static void CleanupIteratorState(void* arg1, void* arg2) { IterState* state = reinterpret_cast(arg1); state->mu->Lock(); state->mem->Unref(); if (state->imm != NULL) state->imm->Unref(); state->version->Unref(); state->mu->Unlock(); delete state; } } // namespace Iterator* DBImpl::NewInternalIterator(const ReadOptions& options, SequenceNumber* latest_snapshot, uint32_t* seed) { IterState* cleanup = new IterState; mutex_.Lock(); *latest_snapshot = versions_->LastSequence(); // Collect together all needed child iterators std::vector list; list.push_back(mem_->NewIterator()); mem_->Ref(); if (imm_ != NULL) { list.push_back(imm_->NewIterator()); imm_->Ref(); } versions_->current()->AddIterators(options, &list); Iterator* internal_iter = NewMergingIterator(&internal_comparator_, &list[0], list.size()); versions_->current()->Ref(); cleanup->mu = &mutex_; cleanup->mem = mem_; cleanup->imm = imm_; cleanup->version = versions_->current(); internal_iter->RegisterCleanup(CleanupIteratorState, cleanup, NULL); *seed = ++seed_; mutex_.Unlock(); return internal_iter; } Iterator* DBImpl::TEST_NewInternalIterator() { SequenceNumber ignored; uint32_t ignored_seed; return NewInternalIterator(ReadOptions(), &ignored, &ignored_seed); } int64_t DBImpl::TEST_MaxNextLevelOverlappingBytes() { MutexLock l(&mutex_); return versions_->MaxNextLevelOverlappingBytes(); } Status DBImpl::Get(const ReadOptions& options, const Slice& key, std::string* value) { Status s; MutexLock l(&mutex_); SequenceNumber snapshot; if (options.snapshot != NULL) { snapshot = reinterpret_cast(options.snapshot)->number_; } else { snapshot = versions_->LastSequence(); } MemTable* mem = mem_; MemTable* imm = imm_; Version* current = versions_->current(); mem->Ref(); if (imm != NULL) imm->Ref(); current->Ref(); bool have_stat_update = false; Version::GetStats stats; // Unlock while reading from files and memtables { mutex_.Unlock(); // First look in the memtable, then in the immutable memtable (if any). LookupKey lkey(key, snapshot); if (mem->Get(lkey, value, &s)) { // Done } else if (imm != NULL && imm->Get(lkey, value, &s)) { // Done } else { s = current->Get(options, lkey, value, &stats); have_stat_update = true; } mutex_.Lock(); } if (have_stat_update && current->UpdateStats(stats)) { MaybeScheduleCompaction(); } mem->Unref(); if (imm != NULL) imm->Unref(); current->Unref(); return s; } Iterator* DBImpl::NewIterator(const ReadOptions& options) { SequenceNumber latest_snapshot; uint32_t seed; Iterator* iter = NewInternalIterator(options, &latest_snapshot, &seed); return NewDBIterator( this, user_comparator(), iter, (options.snapshot != NULL ? reinterpret_cast(options.snapshot)->number_ : latest_snapshot), seed); } void DBImpl::RecordReadSample(Slice key) { MutexLock l(&mutex_); if (versions_->current()->RecordReadSample(key)) { MaybeScheduleCompaction(); } } const Snapshot* DBImpl::GetSnapshot() { MutexLock l(&mutex_); return snapshots_.New(versions_->LastSequence()); } void DBImpl::ReleaseSnapshot(const Snapshot* s) { MutexLock l(&mutex_); snapshots_.Delete(reinterpret_cast(s)); } // Convenience methods Status DBImpl::Put(const WriteOptions& o, const Slice& key, const Slice& val) { return DB::Put(o, key, val); } Status DBImpl::Delete(const WriteOptions& options, const Slice& key) { return DB::Delete(options, key); } Status DBImpl::Write(const WriteOptions& options, WriteBatch* my_batch) { Writer w(&mutex_); w.batch = my_batch; w.sync = options.sync; w.done = false; MutexLock l(&mutex_); writers_.push_back(&w); while (!w.done && &w != writers_.front()) { w.cv.Wait(); } if (w.done) { return w.status; } // May temporarily unlock and wait. Status status = MakeRoomForWrite(my_batch == NULL); uint64_t last_sequence = versions_->LastSequence(); Writer* last_writer = &w; if (status.ok() && my_batch != NULL) { // NULL batch is for compactions WriteBatch* updates = BuildBatchGroup(&last_writer); WriteBatchInternal::SetSequence(updates, last_sequence + 1); last_sequence += WriteBatchInternal::Count(updates); // Add to log and apply to memtable. We can release the lock // during this phase since &w is currently responsible for logging // and protects against concurrent loggers and concurrent writes // into mem_. { mutex_.Unlock(); status = log_->AddRecord(WriteBatchInternal::Contents(updates)); bool sync_error = false; if (status.ok() && options.sync) { status = logfile_->Sync(); if (!status.ok()) { sync_error = true; } } if (status.ok()) { status = WriteBatchInternal::InsertInto(updates, mem_); } mutex_.Lock(); if (sync_error) { // The state of the log file is indeterminate: the log record we // just added may or may not show up when the DB is re-opened. // So we force the DB into a mode where all future writes fail. RecordBackgroundError(status); } } if (updates == tmp_batch_) tmp_batch_->Clear(); versions_->SetLastSequence(last_sequence); } while (true) { Writer* ready = writers_.front(); writers_.pop_front(); if (ready != &w) { ready->status = status; ready->done = true; ready->cv.Signal(); } if (ready == last_writer) break; } // Notify new head of write queue if (!writers_.empty()) { writers_.front()->cv.Signal(); } return status; } // REQUIRES: Writer list must be non-empty // REQUIRES: First writer must have a non-NULL batch WriteBatch* DBImpl::BuildBatchGroup(Writer** last_writer) { assert(!writers_.empty()); Writer* first = writers_.front(); WriteBatch* result = first->batch; assert(result != NULL); size_t size = WriteBatchInternal::ByteSize(first->batch); // Allow the group to grow up to a maximum size, but if the // original write is small, limit the growth so we do not slow // down the small write too much. size_t max_size = 1 << 20; if (size <= (128<<10)) { max_size = size + (128<<10); } *last_writer = first; std::deque::iterator iter = writers_.begin(); ++iter; // Advance past "first" for (; iter != writers_.end(); ++iter) { Writer* w = *iter; if (w->sync && !first->sync) { // Do not include a sync write into a batch handled by a non-sync write. break; } if (w->batch != NULL) { size += WriteBatchInternal::ByteSize(w->batch); if (size > max_size) { // Do not make batch too big break; } // Append to *reuslt if (result == first->batch) { // Switch to temporary batch instead of disturbing caller's batch result = tmp_batch_; assert(WriteBatchInternal::Count(result) == 0); WriteBatchInternal::Append(result, first->batch); } WriteBatchInternal::Append(result, w->batch); } *last_writer = w; } return result; } // REQUIRES: mutex_ is held // REQUIRES: this thread is currently at the front of the writer queue Status DBImpl::MakeRoomForWrite(bool force) { mutex_.AssertHeld(); assert(!writers_.empty()); bool allow_delay = !force; Status s; while (true) { if (!bg_error_.ok()) { // Yield previous error s = bg_error_; break; } else if ( allow_delay && versions_->NumLevelFiles(0) >= config::kL0_SlowdownWritesTrigger) { // We are getting close to hitting a hard limit on the number of // L0 files. Rather than delaying a single write by several // seconds when we hit the hard limit, start delaying each // individual write by 1ms to reduce latency variance. Also, // this delay hands over some CPU to the compaction thread in // case it is sharing the same core as the writer. mutex_.Unlock(); env_->SleepForMicroseconds(1000); allow_delay = false; // Do not delay a single write more than once mutex_.Lock(); } else if (!force && (mem_->ApproximateMemoryUsage() <= options_.write_buffer_size)) { // There is room in current memtable break; } else if (imm_ != NULL) { // We have filled up the current memtable, but the previous // one is still being compacted, so we wait. Log(options_.info_log, "Current memtable full; waiting...\n"); bg_cv_.Wait(); } else if (versions_->NumLevelFiles(0) >= config::kL0_StopWritesTrigger) { // There are too many level-0 files. Log(options_.info_log, "Too many L0 files; waiting...\n"); bg_cv_.Wait(); } else { // Attempt to switch to a new memtable and trigger compaction of old assert(versions_->PrevLogNumber() == 0); uint64_t new_log_number = versions_->NewFileNumber(); WritableFile* lfile = NULL; s = env_->NewWritableFile(LogFileName(dbname_, new_log_number), &lfile); if (!s.ok()) { // Avoid chewing through file number space in a tight loop. versions_->ReuseFileNumber(new_log_number); break; } delete log_; delete logfile_; logfile_ = lfile; logfile_number_ = new_log_number; log_ = new log::Writer(lfile); imm_ = mem_; has_imm_.Release_Store(imm_); mem_ = new MemTable(internal_comparator_); mem_->Ref(); force = false; // Do not force another compaction if have room MaybeScheduleCompaction(); } } return s; } bool DBImpl::GetProperty(const Slice& property, std::string* value) { value->clear(); MutexLock l(&mutex_); Slice in = property; Slice prefix("leveldb."); if (!in.starts_with(prefix)) return false; in.remove_prefix(prefix.size()); if (in.starts_with("num-files-at-level")) { in.remove_prefix(strlen("num-files-at-level")); uint64_t level; bool ok = ConsumeDecimalNumber(&in, &level) && in.empty(); if (!ok || level >= config::kNumLevels) { return false; } else { char buf[100]; snprintf(buf, sizeof(buf), "%d", versions_->NumLevelFiles(static_cast(level))); *value = buf; return true; } } else if (in == "stats") { char buf[200]; snprintf(buf, sizeof(buf), " Compactions\n" "Level Files Size(MB) Time(sec) Read(MB) Write(MB)\n" "--------------------------------------------------\n" ); value->append(buf); for (int level = 0; level < config::kNumLevels; level++) { int files = versions_->NumLevelFiles(level); if (stats_[level].micros > 0 || files > 0) { snprintf( buf, sizeof(buf), "%3d %8d %8.0f %9.0f %8.0f %9.0f\n", level, files, versions_->NumLevelBytes(level) / 1048576.0, stats_[level].micros / 1e6, stats_[level].bytes_read / 1048576.0, stats_[level].bytes_written / 1048576.0); value->append(buf); } } return true; } else if (in == "sstables") { *value = versions_->current()->DebugString(); return true; } return false; } void DBImpl::GetApproximateSizes( const Range* range, int n, uint64_t* sizes) { // TODO(opt): better implementation Version* v; { MutexLock l(&mutex_); versions_->current()->Ref(); v = versions_->current(); } for (int i = 0; i < n; i++) { // Convert user_key into a corresponding internal key. InternalKey k1(range[i].start, kMaxSequenceNumber, kValueTypeForSeek); InternalKey k2(range[i].limit, kMaxSequenceNumber, kValueTypeForSeek); uint64_t start = versions_->ApproximateOffsetOf(v, k1); uint64_t limit = versions_->ApproximateOffsetOf(v, k2); sizes[i] = (limit >= start ? limit - start : 0); } { MutexLock l(&mutex_); v->Unref(); } } // Default implementations of convenience methods that subclasses of DB // can call if they wish Status DB::Put(const WriteOptions& opt, const Slice& key, const Slice& value) { WriteBatch batch; batch.Put(key, value); return Write(opt, &batch); } Status DB::Delete(const WriteOptions& opt, const Slice& key) { WriteBatch batch; batch.Delete(key); return Write(opt, &batch); } DB::~DB() { } Status DB::Open(const Options& options, const std::string& dbname, DB** dbptr) { *dbptr = NULL; DBImpl* impl = new DBImpl(options, dbname); impl->mutex_.Lock(); VersionEdit edit; Status s = impl->Recover(&edit); // Handles create_if_missing, error_if_exists if (s.ok()) { uint64_t new_log_number = impl->versions_->NewFileNumber(); WritableFile* lfile; s = options.env->NewWritableFile(LogFileName(dbname, new_log_number), &lfile); if (s.ok()) { edit.SetLogNumber(new_log_number); impl->logfile_ = lfile; impl->logfile_number_ = new_log_number; impl->log_ = new log::Writer(lfile); s = impl->versions_->LogAndApply(&edit, &impl->mutex_); } if (s.ok()) { impl->DeleteObsoleteFiles(); impl->MaybeScheduleCompaction(); } } impl->mutex_.Unlock(); if (s.ok()) { *dbptr = impl; } else { delete impl; } return s; } Snapshot::~Snapshot() { } Status DestroyDB(const std::string& dbname, const Options& options) { Env* env = options.env; std::vector filenames; // Ignore error in case directory does not exist env->GetChildren(dbname, &filenames); if (filenames.empty()) { return Status::OK(); } FileLock* lock; const std::string lockname = LockFileName(dbname); Status result = env->LockFile(lockname, &lock); if (result.ok()) { uint64_t number; FileType type; for (size_t i = 0; i < filenames.size(); i++) { if (ParseFileName(filenames[i], &number, &type) && type != kDBLockFile) { // Lock file will be deleted at end Status del = env->DeleteFile(dbname + "/" + filenames[i]); if (result.ok() && !del.ok()) { result = del; } } } env->UnlockFile(lock); // Ignore error since state is already gone env->DeleteFile(lockname); env->DeleteDir(dbname); // Ignore error in case dir contains other files } return result; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/memtable.h0000644000000000000000000000526112414772654017660 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_DB_MEMTABLE_H_ #define STORAGE_LEVELDB_DB_MEMTABLE_H_ #include #include "leveldb/db.h" #include "db/dbformat.h" #include "db/skiplist.h" #include "util/arena.h" namespace leveldb { class InternalKeyComparator; class Mutex; class MemTableIterator; class MemTable { public: // MemTables are reference counted. The initial reference count // is zero and the caller must call Ref() at least once. explicit MemTable(const InternalKeyComparator& comparator); // Increase reference count. void Ref() { ++refs_; } // Drop reference count. Delete if no more references exist. void Unref() { --refs_; assert(refs_ >= 0); if (refs_ <= 0) { delete this; } } // Returns an estimate of the number of bytes of data in use by this // data structure. // // REQUIRES: external synchronization to prevent simultaneous // operations on the same MemTable. size_t ApproximateMemoryUsage(); // Return an iterator that yields the contents of the memtable. // // The caller must ensure that the underlying MemTable remains live // while the returned iterator is live. The keys returned by this // iterator are internal keys encoded by AppendInternalKey in the // db/format.{h,cc} module. Iterator* NewIterator(); // Add an entry into memtable that maps key to value at the // specified sequence number and with the specified type. // Typically value will be empty if type==kTypeDeletion. void Add(SequenceNumber seq, ValueType type, const Slice& key, const Slice& value); // If memtable contains a value for key, store it in *value and return true. // If memtable contains a deletion for key, store a NotFound() error // in *status and return true. // Else, return false. bool Get(const LookupKey& key, std::string* value, Status* s); private: ~MemTable(); // Private since only Unref() should be used to delete it struct KeyComparator { const InternalKeyComparator comparator; explicit KeyComparator(const InternalKeyComparator& c) : comparator(c) { } int operator()(const char* a, const char* b) const; }; friend class MemTableIterator; friend class MemTableBackwardIterator; typedef SkipList Table; KeyComparator comparator_; int refs_; Arena arena_; Table table_; // No copying allowed MemTable(const MemTable&); void operator=(const MemTable&); }; } // namespace leveldb #endif // STORAGE_LEVELDB_DB_MEMTABLE_H_ armory-0.92.3/cppForSwig/leveldb/db/c_test.c0000644000000000000000000002656212414772654017355 0ustar rootroot/* Copyright (c) 2011 The LevelDB Authors. All rights reserved. Use of this source code is governed by a BSD-style license that can be found in the LICENSE file. See the AUTHORS file for names of contributors. */ #include "leveldb/c.h" #include #include #include #include #include #include const char* phase = ""; static char dbname[200]; static void StartPhase(const char* name) { fprintf(stderr, "=== Test %s\n", name); phase = name; } static const char* GetTempDir(void) { const char* ret = getenv("TEST_TMPDIR"); if (ret == NULL || ret[0] == '\0') ret = "/tmp"; return ret; } #define CheckNoError(err) \ if ((err) != NULL) { \ fprintf(stderr, "%s:%d: %s: %s\n", __FILE__, __LINE__, phase, (err)); \ abort(); \ } #define CheckCondition(cond) \ if (!(cond)) { \ fprintf(stderr, "%s:%d: %s: %s\n", __FILE__, __LINE__, phase, #cond); \ abort(); \ } static void CheckEqual(const char* expected, const char* v, size_t n) { if (expected == NULL && v == NULL) { // ok } else if (expected != NULL && v != NULL && n == strlen(expected) && memcmp(expected, v, n) == 0) { // ok return; } else { fprintf(stderr, "%s: expected '%s', got '%s'\n", phase, (expected ? expected : "(null)"), (v ? v : "(null")); abort(); } } static void Free(char** ptr) { if (*ptr) { free(*ptr); *ptr = NULL; } } static void CheckGet( leveldb_t* db, const leveldb_readoptions_t* options, const char* key, const char* expected) { char* err = NULL; size_t val_len; char* val; val = leveldb_get(db, options, key, strlen(key), &val_len, &err); CheckNoError(err); CheckEqual(expected, val, val_len); Free(&val); } static void CheckIter(leveldb_iterator_t* iter, const char* key, const char* val) { size_t len; const char* str; str = leveldb_iter_key(iter, &len); CheckEqual(key, str, len); str = leveldb_iter_value(iter, &len); CheckEqual(val, str, len); } // Callback from leveldb_writebatch_iterate() static void CheckPut(void* ptr, const char* k, size_t klen, const char* v, size_t vlen) { int* state = (int*) ptr; CheckCondition(*state < 2); switch (*state) { case 0: CheckEqual("bar", k, klen); CheckEqual("b", v, vlen); break; case 1: CheckEqual("box", k, klen); CheckEqual("c", v, vlen); break; } (*state)++; } // Callback from leveldb_writebatch_iterate() static void CheckDel(void* ptr, const char* k, size_t klen) { int* state = (int*) ptr; CheckCondition(*state == 2); CheckEqual("bar", k, klen); (*state)++; } static void CmpDestroy(void* arg) { } static int CmpCompare(void* arg, const char* a, size_t alen, const char* b, size_t blen) { int n = (alen < blen) ? alen : blen; int r = memcmp(a, b, n); if (r == 0) { if (alen < blen) r = -1; else if (alen > blen) r = +1; } return r; } static const char* CmpName(void* arg) { return "foo"; } // Custom filter policy static unsigned char fake_filter_result = 1; static void FilterDestroy(void* arg) { } static const char* FilterName(void* arg) { return "TestFilter"; } static char* FilterCreate( void* arg, const char* const* key_array, const size_t* key_length_array, int num_keys, size_t* filter_length) { *filter_length = 4; char* result = malloc(4); memcpy(result, "fake", 4); return result; } unsigned char FilterKeyMatch( void* arg, const char* key, size_t length, const char* filter, size_t filter_length) { CheckCondition(filter_length == 4); CheckCondition(memcmp(filter, "fake", 4) == 0); return fake_filter_result; } int main(int argc, char** argv) { leveldb_t* db; leveldb_comparator_t* cmp; leveldb_cache_t* cache; leveldb_env_t* env; leveldb_options_t* options; leveldb_readoptions_t* roptions; leveldb_writeoptions_t* woptions; char* err = NULL; int run = -1; CheckCondition(leveldb_major_version() >= 1); CheckCondition(leveldb_minor_version() >= 1); snprintf(dbname, sizeof(dbname), "%s/leveldb_c_test-%d", GetTempDir(), ((int) geteuid())); StartPhase("create_objects"); cmp = leveldb_comparator_create(NULL, CmpDestroy, CmpCompare, CmpName); env = leveldb_create_default_env(); cache = leveldb_cache_create_lru(100000); options = leveldb_options_create(); leveldb_options_set_comparator(options, cmp); leveldb_options_set_error_if_exists(options, 1); leveldb_options_set_cache(options, cache); leveldb_options_set_env(options, env); leveldb_options_set_info_log(options, NULL); leveldb_options_set_write_buffer_size(options, 100000); leveldb_options_set_paranoid_checks(options, 1); leveldb_options_set_max_open_files(options, 10); leveldb_options_set_block_size(options, 1024); leveldb_options_set_block_restart_interval(options, 8); leveldb_options_set_compression(options, leveldb_no_compression); roptions = leveldb_readoptions_create(); leveldb_readoptions_set_verify_checksums(roptions, 1); leveldb_readoptions_set_fill_cache(roptions, 0); woptions = leveldb_writeoptions_create(); leveldb_writeoptions_set_sync(woptions, 1); StartPhase("destroy"); leveldb_destroy_db(options, dbname, &err); Free(&err); StartPhase("open_error"); db = leveldb_open(options, dbname, &err); CheckCondition(err != NULL); Free(&err); StartPhase("leveldb_free"); db = leveldb_open(options, dbname, &err); CheckCondition(err != NULL); leveldb_free(err); err = NULL; StartPhase("open"); leveldb_options_set_create_if_missing(options, 1); db = leveldb_open(options, dbname, &err); CheckNoError(err); CheckGet(db, roptions, "foo", NULL); StartPhase("put"); leveldb_put(db, woptions, "foo", 3, "hello", 5, &err); CheckNoError(err); CheckGet(db, roptions, "foo", "hello"); StartPhase("compactall"); leveldb_compact_range(db, NULL, 0, NULL, 0); CheckGet(db, roptions, "foo", "hello"); StartPhase("compactrange"); leveldb_compact_range(db, "a", 1, "z", 1); CheckGet(db, roptions, "foo", "hello"); StartPhase("writebatch"); { leveldb_writebatch_t* wb = leveldb_writebatch_create(); leveldb_writebatch_put(wb, "foo", 3, "a", 1); leveldb_writebatch_clear(wb); leveldb_writebatch_put(wb, "bar", 3, "b", 1); leveldb_writebatch_put(wb, "box", 3, "c", 1); leveldb_writebatch_delete(wb, "bar", 3); leveldb_write(db, woptions, wb, &err); CheckNoError(err); CheckGet(db, roptions, "foo", "hello"); CheckGet(db, roptions, "bar", NULL); CheckGet(db, roptions, "box", "c"); int pos = 0; leveldb_writebatch_iterate(wb, &pos, CheckPut, CheckDel); CheckCondition(pos == 3); leveldb_writebatch_destroy(wb); } StartPhase("iter"); { leveldb_iterator_t* iter = leveldb_create_iterator(db, roptions); CheckCondition(!leveldb_iter_valid(iter)); leveldb_iter_seek_to_first(iter); CheckCondition(leveldb_iter_valid(iter)); CheckIter(iter, "box", "c"); leveldb_iter_next(iter); CheckIter(iter, "foo", "hello"); leveldb_iter_prev(iter); CheckIter(iter, "box", "c"); leveldb_iter_prev(iter); CheckCondition(!leveldb_iter_valid(iter)); leveldb_iter_seek_to_last(iter); CheckIter(iter, "foo", "hello"); leveldb_iter_seek(iter, "b", 1); CheckIter(iter, "box", "c"); leveldb_iter_get_error(iter, &err); CheckNoError(err); leveldb_iter_destroy(iter); } StartPhase("approximate_sizes"); { int i; int n = 20000; char keybuf[100]; char valbuf[100]; uint64_t sizes[2]; const char* start[2] = { "a", "k00000000000000010000" }; size_t start_len[2] = { 1, 21 }; const char* limit[2] = { "k00000000000000010000", "z" }; size_t limit_len[2] = { 21, 1 }; leveldb_writeoptions_set_sync(woptions, 0); for (i = 0; i < n; i++) { snprintf(keybuf, sizeof(keybuf), "k%020d", i); snprintf(valbuf, sizeof(valbuf), "v%020d", i); leveldb_put(db, woptions, keybuf, strlen(keybuf), valbuf, strlen(valbuf), &err); CheckNoError(err); } leveldb_approximate_sizes(db, 2, start, start_len, limit, limit_len, sizes); CheckCondition(sizes[0] > 0); CheckCondition(sizes[1] > 0); } StartPhase("property"); { char* prop = leveldb_property_value(db, "nosuchprop"); CheckCondition(prop == NULL); prop = leveldb_property_value(db, "leveldb.stats"); CheckCondition(prop != NULL); Free(&prop); } StartPhase("snapshot"); { const leveldb_snapshot_t* snap; snap = leveldb_create_snapshot(db); leveldb_delete(db, woptions, "foo", 3, &err); CheckNoError(err); leveldb_readoptions_set_snapshot(roptions, snap); CheckGet(db, roptions, "foo", "hello"); leveldb_readoptions_set_snapshot(roptions, NULL); CheckGet(db, roptions, "foo", NULL); leveldb_release_snapshot(db, snap); } StartPhase("repair"); { leveldb_close(db); leveldb_options_set_create_if_missing(options, 0); leveldb_options_set_error_if_exists(options, 0); leveldb_repair_db(options, dbname, &err); CheckNoError(err); db = leveldb_open(options, dbname, &err); CheckNoError(err); CheckGet(db, roptions, "foo", NULL); CheckGet(db, roptions, "bar", NULL); CheckGet(db, roptions, "box", "c"); leveldb_options_set_create_if_missing(options, 1); leveldb_options_set_error_if_exists(options, 1); } StartPhase("filter"); for (run = 0; run < 2; run++) { // First run uses custom filter, second run uses bloom filter CheckNoError(err); leveldb_filterpolicy_t* policy; if (run == 0) { policy = leveldb_filterpolicy_create( NULL, FilterDestroy, FilterCreate, FilterKeyMatch, FilterName); } else { policy = leveldb_filterpolicy_create_bloom(10); } // Create new database leveldb_close(db); leveldb_destroy_db(options, dbname, &err); leveldb_options_set_filter_policy(options, policy); db = leveldb_open(options, dbname, &err); CheckNoError(err); leveldb_put(db, woptions, "foo", 3, "foovalue", 8, &err); CheckNoError(err); leveldb_put(db, woptions, "bar", 3, "barvalue", 8, &err); CheckNoError(err); leveldb_compact_range(db, NULL, 0, NULL, 0); fake_filter_result = 1; CheckGet(db, roptions, "foo", "foovalue"); CheckGet(db, roptions, "bar", "barvalue"); if (phase == 0) { // Must not find value when custom filter returns false fake_filter_result = 0; CheckGet(db, roptions, "foo", NULL); CheckGet(db, roptions, "bar", NULL); fake_filter_result = 1; CheckGet(db, roptions, "foo", "foovalue"); CheckGet(db, roptions, "bar", "barvalue"); } leveldb_options_set_filter_policy(options, NULL); leveldb_filterpolicy_destroy(policy); } StartPhase("cleanup"); leveldb_close(db); leveldb_options_destroy(options); leveldb_readoptions_destroy(roptions); leveldb_writeoptions_destroy(woptions); leveldb_cache_destroy(cache); leveldb_comparator_destroy(cmp); leveldb_env_destroy(env); fprintf(stderr, "PASS\n"); return 0; } armory-0.92.3/cppForSwig/leveldb/db/dbformat_test.cc0000644000000000000000000000733312414772654021067 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/dbformat.h" #include "util/logging.h" #include "util/testharness.h" namespace leveldb { static std::string IKey(const std::string& user_key, uint64_t seq, ValueType vt) { std::string encoded; AppendInternalKey(&encoded, ParsedInternalKey(user_key, seq, vt)); return encoded; } static std::string Shorten(const std::string& s, const std::string& l) { std::string result = s; InternalKeyComparator(BytewiseComparator()).FindShortestSeparator(&result, l); return result; } static std::string ShortSuccessor(const std::string& s) { std::string result = s; InternalKeyComparator(BytewiseComparator()).FindShortSuccessor(&result); return result; } static void TestKey(const std::string& key, uint64_t seq, ValueType vt) { std::string encoded = IKey(key, seq, vt); Slice in(encoded); ParsedInternalKey decoded("", 0, kTypeValue); ASSERT_TRUE(ParseInternalKey(in, &decoded)); ASSERT_EQ(key, decoded.user_key.ToString()); ASSERT_EQ(seq, decoded.sequence); ASSERT_EQ(vt, decoded.type); ASSERT_TRUE(!ParseInternalKey(Slice("bar"), &decoded)); } class FormatTest { }; TEST(FormatTest, InternalKey_EncodeDecode) { const char* keys[] = { "", "k", "hello", "longggggggggggggggggggggg" }; const uint64_t seq[] = { 1, 2, 3, (1ull << 8) - 1, 1ull << 8, (1ull << 8) + 1, (1ull << 16) - 1, 1ull << 16, (1ull << 16) + 1, (1ull << 32) - 1, 1ull << 32, (1ull << 32) + 1 }; for (int k = 0; k < sizeof(keys) / sizeof(keys[0]); k++) { for (int s = 0; s < sizeof(seq) / sizeof(seq[0]); s++) { TestKey(keys[k], seq[s], kTypeValue); TestKey("hello", 1, kTypeDeletion); } } } TEST(FormatTest, InternalKeyShortSeparator) { // When user keys are same ASSERT_EQ(IKey("foo", 100, kTypeValue), Shorten(IKey("foo", 100, kTypeValue), IKey("foo", 99, kTypeValue))); ASSERT_EQ(IKey("foo", 100, kTypeValue), Shorten(IKey("foo", 100, kTypeValue), IKey("foo", 101, kTypeValue))); ASSERT_EQ(IKey("foo", 100, kTypeValue), Shorten(IKey("foo", 100, kTypeValue), IKey("foo", 100, kTypeValue))); ASSERT_EQ(IKey("foo", 100, kTypeValue), Shorten(IKey("foo", 100, kTypeValue), IKey("foo", 100, kTypeDeletion))); // When user keys are misordered ASSERT_EQ(IKey("foo", 100, kTypeValue), Shorten(IKey("foo", 100, kTypeValue), IKey("bar", 99, kTypeValue))); // When user keys are different, but correctly ordered ASSERT_EQ(IKey("g", kMaxSequenceNumber, kValueTypeForSeek), Shorten(IKey("foo", 100, kTypeValue), IKey("hello", 200, kTypeValue))); // When start user key is prefix of limit user key ASSERT_EQ(IKey("foo", 100, kTypeValue), Shorten(IKey("foo", 100, kTypeValue), IKey("foobar", 200, kTypeValue))); // When limit user key is prefix of start user key ASSERT_EQ(IKey("foobar", 100, kTypeValue), Shorten(IKey("foobar", 100, kTypeValue), IKey("foo", 200, kTypeValue))); } TEST(FormatTest, InternalKeyShortestSuccessor) { ASSERT_EQ(IKey("g", kMaxSequenceNumber, kValueTypeForSeek), ShortSuccessor(IKey("foo", 100, kTypeValue))); ASSERT_EQ(IKey("\xff\xff", 100, kTypeValue), ShortSuccessor(IKey("\xff\xff", 100, kTypeValue))); } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/db/version_set.h0000644000000000000000000003322312414772654020431 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // The representation of a DBImpl consists of a set of Versions. The // newest version is called "current". Older versions may be kept // around to provide a consistent view to live iterators. // // Each Version keeps track of a set of Table files per level. The // entire set of versions is maintained in a VersionSet. // // Version,VersionSet are thread-compatible, but require external // synchronization on all accesses. #ifndef STORAGE_LEVELDB_DB_VERSION_SET_H_ #define STORAGE_LEVELDB_DB_VERSION_SET_H_ #include #include #include #include "db/dbformat.h" #include "db/version_edit.h" #include "port/port.h" #include "port/thread_annotations.h" namespace leveldb { namespace log { class Writer; } class Compaction; class Iterator; class MemTable; class TableBuilder; class TableCache; class Version; class VersionSet; class WritableFile; // Return the smallest index i such that files[i]->largest >= key. // Return files.size() if there is no such file. // REQUIRES: "files" contains a sorted list of non-overlapping files. extern int FindFile(const InternalKeyComparator& icmp, const std::vector& files, const Slice& key); // Returns true iff some file in "files" overlaps the user key range // [*smallest,*largest]. // smallest==NULL represents a key smaller than all keys in the DB. // largest==NULL represents a key largest than all keys in the DB. // REQUIRES: If disjoint_sorted_files, files[] contains disjoint ranges // in sorted order. extern bool SomeFileOverlapsRange( const InternalKeyComparator& icmp, bool disjoint_sorted_files, const std::vector& files, const Slice* smallest_user_key, const Slice* largest_user_key); class Version { public: // Append to *iters a sequence of iterators that will // yield the contents of this Version when merged together. // REQUIRES: This version has been saved (see VersionSet::SaveTo) void AddIterators(const ReadOptions&, std::vector* iters); // Lookup the value for key. If found, store it in *val and // return OK. Else return a non-OK status. Fills *stats. // REQUIRES: lock is not held struct GetStats { FileMetaData* seek_file; int seek_file_level; }; Status Get(const ReadOptions&, const LookupKey& key, std::string* val, GetStats* stats); // Adds "stats" into the current state. Returns true if a new // compaction may need to be triggered, false otherwise. // REQUIRES: lock is held bool UpdateStats(const GetStats& stats); // Record a sample of bytes read at the specified internal key. // Samples are taken approximately once every config::kReadBytesPeriod // bytes. Returns true if a new compaction may need to be triggered. // REQUIRES: lock is held bool RecordReadSample(Slice key); // Reference count management (so Versions do not disappear out from // under live iterators) void Ref(); void Unref(); void GetOverlappingInputs( int level, const InternalKey* begin, // NULL means before all keys const InternalKey* end, // NULL means after all keys std::vector* inputs); // Returns true iff some file in the specified level overlaps // some part of [*smallest_user_key,*largest_user_key]. // smallest_user_key==NULL represents a key smaller than all keys in the DB. // largest_user_key==NULL represents a key largest than all keys in the DB. bool OverlapInLevel(int level, const Slice* smallest_user_key, const Slice* largest_user_key); // Return the level at which we should place a new memtable compaction // result that covers the range [smallest_user_key,largest_user_key]. int PickLevelForMemTableOutput(const Slice& smallest_user_key, const Slice& largest_user_key); int NumFiles(int level) const { return files_[level].size(); } // Return a human readable string that describes this version's contents. std::string DebugString() const; private: friend class Compaction; friend class VersionSet; class LevelFileNumIterator; Iterator* NewConcatenatingIterator(const ReadOptions&, int level) const; // Call func(arg, level, f) for every file that overlaps user_key in // order from newest to oldest. If an invocation of func returns // false, makes no more calls. // // REQUIRES: user portion of internal_key == user_key. void ForEachOverlapping(Slice user_key, Slice internal_key, void* arg, bool (*func)(void*, int, FileMetaData*)); VersionSet* vset_; // VersionSet to which this Version belongs Version* next_; // Next version in linked list Version* prev_; // Previous version in linked list int refs_; // Number of live refs to this version // List of files per level std::vector files_[config::kNumLevels]; // Next file to compact based on seek stats. FileMetaData* file_to_compact_; int file_to_compact_level_; // Level that should be compacted next and its compaction score. // Score < 1 means compaction is not strictly needed. These fields // are initialized by Finalize(). double compaction_score_; int compaction_level_; explicit Version(VersionSet* vset) : vset_(vset), next_(this), prev_(this), refs_(0), file_to_compact_(NULL), file_to_compact_level_(-1), compaction_score_(-1), compaction_level_(-1) { } ~Version(); // No copying allowed Version(const Version&); void operator=(const Version&); }; class VersionSet { public: VersionSet(const std::string& dbname, const Options* options, TableCache* table_cache, const InternalKeyComparator*); ~VersionSet(); // Apply *edit to the current version to form a new descriptor that // is both saved to persistent state and installed as the new // current version. Will release *mu while actually writing to the file. // REQUIRES: *mu is held on entry. // REQUIRES: no other thread concurrently calls LogAndApply() Status LogAndApply(VersionEdit* edit, port::Mutex* mu) EXCLUSIVE_LOCKS_REQUIRED(mu); // Recover the last saved descriptor from persistent storage. Status Recover(); // Return the current version. Version* current() const { return current_; } // Return the current manifest file number uint64_t ManifestFileNumber() const { return manifest_file_number_; } // Allocate and return a new file number uint64_t NewFileNumber() { return next_file_number_++; } // Arrange to reuse "file_number" unless a newer file number has // already been allocated. // REQUIRES: "file_number" was returned by a call to NewFileNumber(). void ReuseFileNumber(uint64_t file_number) { if (next_file_number_ == file_number + 1) { next_file_number_ = file_number; } } // Return the number of Table files at the specified level. int NumLevelFiles(int level) const; // Return the combined file size of all files at the specified level. int64_t NumLevelBytes(int level) const; // Return the last sequence number. uint64_t LastSequence() const { return last_sequence_; } // Set the last sequence number to s. void SetLastSequence(uint64_t s) { assert(s >= last_sequence_); last_sequence_ = s; } // Mark the specified file number as used. void MarkFileNumberUsed(uint64_t number); // Return the current log file number. uint64_t LogNumber() const { return log_number_; } // Return the log file number for the log file that is currently // being compacted, or zero if there is no such log file. uint64_t PrevLogNumber() const { return prev_log_number_; } // Pick level and inputs for a new compaction. // Returns NULL if there is no compaction to be done. // Otherwise returns a pointer to a heap-allocated object that // describes the compaction. Caller should delete the result. Compaction* PickCompaction(); // Return a compaction object for compacting the range [begin,end] in // the specified level. Returns NULL if there is nothing in that // level that overlaps the specified range. Caller should delete // the result. Compaction* CompactRange( int level, const InternalKey* begin, const InternalKey* end); // Return the maximum overlapping data (in bytes) at next level for any // file at a level >= 1. int64_t MaxNextLevelOverlappingBytes(); // Create an iterator that reads over the compaction inputs for "*c". // The caller should delete the iterator when no longer needed. Iterator* MakeInputIterator(Compaction* c); // Returns true iff some level needs a compaction. bool NeedsCompaction() const { Version* v = current_; return (v->compaction_score_ >= 1) || (v->file_to_compact_ != NULL); } // Add all files listed in any live version to *live. // May also mutate some internal state. void AddLiveFiles(std::set* live); // Return the approximate offset in the database of the data for // "key" as of version "v". uint64_t ApproximateOffsetOf(Version* v, const InternalKey& key); // Return a human-readable short (single-line) summary of the number // of files per level. Uses *scratch as backing store. struct LevelSummaryStorage { char buffer[100]; }; const char* LevelSummary(LevelSummaryStorage* scratch) const; private: class Builder; friend class Compaction; friend class Version; void Finalize(Version* v); void GetRange(const std::vector& inputs, InternalKey* smallest, InternalKey* largest); void GetRange2(const std::vector& inputs1, const std::vector& inputs2, InternalKey* smallest, InternalKey* largest); void SetupOtherInputs(Compaction* c); // Save current contents to *log Status WriteSnapshot(log::Writer* log); void AppendVersion(Version* v); Env* const env_; const std::string dbname_; const Options* const options_; TableCache* const table_cache_; const InternalKeyComparator icmp_; uint64_t next_file_number_; uint64_t manifest_file_number_; uint64_t last_sequence_; uint64_t log_number_; uint64_t prev_log_number_; // 0 or backing store for memtable being compacted // Opened lazily WritableFile* descriptor_file_; log::Writer* descriptor_log_; Version dummy_versions_; // Head of circular doubly-linked list of versions. Version* current_; // == dummy_versions_.prev_ // Per-level key at which the next compaction at that level should start. // Either an empty string, or a valid InternalKey. std::string compact_pointer_[config::kNumLevels]; // No copying allowed VersionSet(const VersionSet&); void operator=(const VersionSet&); }; // A Compaction encapsulates information about a compaction. class Compaction { public: ~Compaction(); // Return the level that is being compacted. Inputs from "level" // and "level+1" will be merged to produce a set of "level+1" files. int level() const { return level_; } // Return the object that holds the edits to the descriptor done // by this compaction. VersionEdit* edit() { return &edit_; } // "which" must be either 0 or 1 int num_input_files(int which) const { return inputs_[which].size(); } // Return the ith input file at "level()+which" ("which" must be 0 or 1). FileMetaData* input(int which, int i) const { return inputs_[which][i]; } // Maximum size of files to build during this compaction. uint64_t MaxOutputFileSize() const { return max_output_file_size_; } // Is this a trivial compaction that can be implemented by just // moving a single input file to the next level (no merging or splitting) bool IsTrivialMove() const; // Add all inputs to this compaction as delete operations to *edit. void AddInputDeletions(VersionEdit* edit); // Returns true if the information we have available guarantees that // the compaction is producing data in "level+1" for which no data exists // in levels greater than "level+1". bool IsBaseLevelForKey(const Slice& user_key); // Returns true iff we should stop building the current output // before processing "internal_key". bool ShouldStopBefore(const Slice& internal_key); // Release the input version for the compaction, once the compaction // is successful. void ReleaseInputs(); private: friend class Version; friend class VersionSet; explicit Compaction(int level); int level_; uint64_t max_output_file_size_; Version* input_version_; VersionEdit edit_; // Each compaction reads inputs from "level_" and "level_+1" std::vector inputs_[2]; // The two sets of inputs // State used to check for number of of overlapping grandparent files // (parent == level_ + 1, grandparent == level_ + 2) std::vector grandparents_; size_t grandparent_index_; // Index in grandparent_starts_ bool seen_key_; // Some output key has been seen int64_t overlapped_bytes_; // Bytes of overlap between current output // and grandparent files // State for implementing IsBaseLevelForKey // level_ptrs_ holds indices into input_version_->levels_: our state // is that we are positioned at one of the file ranges for each // higher level than the ones involved in this compaction (i.e. for // all L >= level_ + 2). size_t level_ptrs_[config::kNumLevels]; }; } // namespace leveldb #endif // STORAGE_LEVELDB_DB_VERSION_SET_H_ armory-0.92.3/cppForSwig/leveldb/db/write_batch_test.cc0000644000000000000000000000656612414772654021573 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/db.h" #include "db/memtable.h" #include "db/write_batch_internal.h" #include "leveldb/env.h" #include "util/logging.h" #include "util/testharness.h" namespace leveldb { static std::string PrintContents(WriteBatch* b) { InternalKeyComparator cmp(BytewiseComparator()); MemTable* mem = new MemTable(cmp); mem->Ref(); std::string state; Status s = WriteBatchInternal::InsertInto(b, mem); int count = 0; Iterator* iter = mem->NewIterator(); for (iter->SeekToFirst(); iter->Valid(); iter->Next()) { ParsedInternalKey ikey; ASSERT_TRUE(ParseInternalKey(iter->key(), &ikey)); switch (ikey.type) { case kTypeValue: state.append("Put("); state.append(ikey.user_key.ToString()); state.append(", "); state.append(iter->value().ToString()); state.append(")"); count++; break; case kTypeDeletion: state.append("Delete("); state.append(ikey.user_key.ToString()); state.append(")"); count++; break; } state.append("@"); state.append(NumberToString(ikey.sequence)); } delete iter; if (!s.ok()) { state.append("ParseError()"); } else if (count != WriteBatchInternal::Count(b)) { state.append("CountMismatch()"); } mem->Unref(); return state; } class WriteBatchTest { }; TEST(WriteBatchTest, Empty) { WriteBatch batch; ASSERT_EQ("", PrintContents(&batch)); ASSERT_EQ(0, WriteBatchInternal::Count(&batch)); } TEST(WriteBatchTest, Multiple) { WriteBatch batch; batch.Put(Slice("foo"), Slice("bar")); batch.Delete(Slice("box")); batch.Put(Slice("baz"), Slice("boo")); WriteBatchInternal::SetSequence(&batch, 100); ASSERT_EQ(100, WriteBatchInternal::Sequence(&batch)); ASSERT_EQ(3, WriteBatchInternal::Count(&batch)); ASSERT_EQ("Put(baz, boo)@102" "Delete(box)@101" "Put(foo, bar)@100", PrintContents(&batch)); } TEST(WriteBatchTest, Corruption) { WriteBatch batch; batch.Put(Slice("foo"), Slice("bar")); batch.Delete(Slice("box")); WriteBatchInternal::SetSequence(&batch, 200); Slice contents = WriteBatchInternal::Contents(&batch); WriteBatchInternal::SetContents(&batch, Slice(contents.data(),contents.size()-1)); ASSERT_EQ("Put(foo, bar)@200" "ParseError()", PrintContents(&batch)); } TEST(WriteBatchTest, Append) { WriteBatch b1, b2; WriteBatchInternal::SetSequence(&b1, 200); WriteBatchInternal::SetSequence(&b2, 300); WriteBatchInternal::Append(&b1, &b2); ASSERT_EQ("", PrintContents(&b1)); b2.Put("a", "va"); WriteBatchInternal::Append(&b1, &b2); ASSERT_EQ("Put(a, va)@200", PrintContents(&b1)); b2.Clear(); b2.Put("b", "vb"); WriteBatchInternal::Append(&b1, &b2); ASSERT_EQ("Put(a, va)@200" "Put(b, vb)@201", PrintContents(&b1)); b2.Delete("foo"); WriteBatchInternal::Append(&b1, &b2); ASSERT_EQ("Put(a, va)@200" "Put(b, vb)@202" "Put(b, vb)@201" "Delete(foo)@203", PrintContents(&b1)); } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/db/table_cache.h0000644000000000000000000000374112414772654020305 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // Thread-safe (provides internal synchronization) #ifndef STORAGE_LEVELDB_DB_TABLE_CACHE_H_ #define STORAGE_LEVELDB_DB_TABLE_CACHE_H_ #include #include #include "db/dbformat.h" #include "leveldb/cache.h" #include "leveldb/table.h" #include "port/port.h" namespace leveldb { class Env; class TableCache { public: TableCache(const std::string& dbname, const Options* options, int entries); ~TableCache(); // Return an iterator for the specified file number (the corresponding // file length must be exactly "file_size" bytes). If "tableptr" is // non-NULL, also sets "*tableptr" to point to the Table object // underlying the returned iterator, or NULL if no Table object underlies // the returned iterator. The returned "*tableptr" object is owned by // the cache and should not be deleted, and is valid for as long as the // returned iterator is live. Iterator* NewIterator(const ReadOptions& options, uint64_t file_number, uint64_t file_size, Table** tableptr = NULL); // If a seek to internal key "k" in specified file finds an entry, // call (*handle_result)(arg, found_key, found_value). Status Get(const ReadOptions& options, uint64_t file_number, uint64_t file_size, const Slice& k, void* arg, void (*handle_result)(void*, const Slice&, const Slice&)); // Evict any entry for the specified file number void Evict(uint64_t file_number); private: Env* const env_; const std::string dbname_; const Options* options_; Cache* cache_; Status FindTable(uint64_t file_number, uint64_t file_size, Cache::Handle**); }; } // namespace leveldb #endif // STORAGE_LEVELDB_DB_TABLE_CACHE_H_ armory-0.92.3/cppForSwig/leveldb/db/log_writer.h0000644000000000000000000000240712414772654020246 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_DB_LOG_WRITER_H_ #define STORAGE_LEVELDB_DB_LOG_WRITER_H_ #include #include "db/log_format.h" #include "leveldb/slice.h" #include "leveldb/status.h" namespace leveldb { class WritableFile; namespace log { class Writer { public: // Create a writer that will append data to "*dest". // "*dest" must be initially empty. // "*dest" must remain live while this Writer is in use. explicit Writer(WritableFile* dest); ~Writer(); Status AddRecord(const Slice& slice); private: WritableFile* dest_; int block_offset_; // Current offset in block // crc32c values for all supported record types. These are // pre-computed to reduce the overhead of computing the crc of the // record type stored in the header. uint32_t type_crc_[kMaxRecordType + 1]; Status EmitPhysicalRecord(RecordType type, const char* ptr, size_t length); // No copying allowed Writer(const Writer&); void operator=(const Writer&); }; } // namespace log } // namespace leveldb #endif // STORAGE_LEVELDB_DB_LOG_WRITER_H_ armory-0.92.3/cppForSwig/leveldb/db/write_batch_internal.h0000644000000000000000000000274412414772654022264 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_DB_WRITE_BATCH_INTERNAL_H_ #define STORAGE_LEVELDB_DB_WRITE_BATCH_INTERNAL_H_ #include "leveldb/write_batch.h" namespace leveldb { class MemTable; // WriteBatchInternal provides static methods for manipulating a // WriteBatch that we don't want in the public WriteBatch interface. class WriteBatchInternal { public: // Return the number of entries in the batch. static int Count(const WriteBatch* batch); // Set the count for the number of entries in the batch. static void SetCount(WriteBatch* batch, int n); // Return the seqeunce number for the start of this batch. static SequenceNumber Sequence(const WriteBatch* batch); // Store the specified number as the seqeunce number for the start of // this batch. static void SetSequence(WriteBatch* batch, SequenceNumber seq); static Slice Contents(const WriteBatch* batch) { return Slice(batch->rep_); } static size_t ByteSize(const WriteBatch* batch) { return batch->rep_.size(); } static void SetContents(WriteBatch* batch, const Slice& contents); static Status InsertInto(const WriteBatch* batch, MemTable* memtable); static void Append(WriteBatch* dst, const WriteBatch* src); }; } // namespace leveldb #endif // STORAGE_LEVELDB_DB_WRITE_BATCH_INTERNAL_H_ armory-0.92.3/cppForSwig/leveldb/db/dbformat.cc0000644000000000000000000001067112414772654020027 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include #include "db/dbformat.h" #include "port/port.h" #include "util/coding.h" namespace leveldb { static uint64_t PackSequenceAndType(uint64_t seq, ValueType t) { assert(seq <= kMaxSequenceNumber); assert(t <= kValueTypeForSeek); return (seq << 8) | t; } void AppendInternalKey(std::string* result, const ParsedInternalKey& key) { result->append(key.user_key.data(), key.user_key.size()); PutFixed64(result, PackSequenceAndType(key.sequence, key.type)); } std::string ParsedInternalKey::DebugString() const { char buf[50]; snprintf(buf, sizeof(buf), "' @ %llu : %d", (unsigned long long) sequence, int(type)); std::string result = "'"; result += EscapeString(user_key.ToString()); result += buf; return result; } std::string InternalKey::DebugString() const { std::string result; ParsedInternalKey parsed; if (ParseInternalKey(rep_, &parsed)) { result = parsed.DebugString(); } else { result = "(bad)"; result.append(EscapeString(rep_)); } return result; } const char* InternalKeyComparator::Name() const { return "leveldb.InternalKeyComparator"; } int InternalKeyComparator::Compare(const Slice& akey, const Slice& bkey) const { // Order by: // increasing user key (according to user-supplied comparator) // decreasing sequence number // decreasing type (though sequence# should be enough to disambiguate) int r = user_comparator_->Compare(ExtractUserKey(akey), ExtractUserKey(bkey)); if (r == 0) { const uint64_t anum = DecodeFixed64(akey.data() + akey.size() - 8); const uint64_t bnum = DecodeFixed64(bkey.data() + bkey.size() - 8); if (anum > bnum) { r = -1; } else if (anum < bnum) { r = +1; } } return r; } void InternalKeyComparator::FindShortestSeparator( std::string* start, const Slice& limit) const { // Attempt to shorten the user portion of the key Slice user_start = ExtractUserKey(*start); Slice user_limit = ExtractUserKey(limit); std::string tmp(user_start.data(), user_start.size()); user_comparator_->FindShortestSeparator(&tmp, user_limit); if (tmp.size() < user_start.size() && user_comparator_->Compare(user_start, tmp) < 0) { // User key has become shorter physically, but larger logically. // Tack on the earliest possible number to the shortened user key. PutFixed64(&tmp, PackSequenceAndType(kMaxSequenceNumber,kValueTypeForSeek)); assert(this->Compare(*start, tmp) < 0); assert(this->Compare(tmp, limit) < 0); start->swap(tmp); } } void InternalKeyComparator::FindShortSuccessor(std::string* key) const { Slice user_key = ExtractUserKey(*key); std::string tmp(user_key.data(), user_key.size()); user_comparator_->FindShortSuccessor(&tmp); if (tmp.size() < user_key.size() && user_comparator_->Compare(user_key, tmp) < 0) { // User key has become shorter physically, but larger logically. // Tack on the earliest possible number to the shortened user key. PutFixed64(&tmp, PackSequenceAndType(kMaxSequenceNumber,kValueTypeForSeek)); assert(this->Compare(*key, tmp) < 0); key->swap(tmp); } } const char* InternalFilterPolicy::Name() const { return user_policy_->Name(); } void InternalFilterPolicy::CreateFilter(const Slice* keys, int n, std::string* dst) const { // We rely on the fact that the code in table.cc does not mind us // adjusting keys[]. Slice* mkey = const_cast(keys); for (int i = 0; i < n; i++) { mkey[i] = ExtractUserKey(keys[i]); // TODO(sanjay): Suppress dups? } user_policy_->CreateFilter(keys, n, dst); } bool InternalFilterPolicy::KeyMayMatch(const Slice& key, const Slice& f) const { return user_policy_->KeyMayMatch(ExtractUserKey(key), f); } LookupKey::LookupKey(const Slice& user_key, SequenceNumber s) { size_t usize = user_key.size(); size_t needed = usize + 13; // A conservative estimate char* dst; if (needed <= sizeof(space_)) { dst = space_; } else { dst = new char[needed]; } start_ = dst; dst = EncodeVarint32(dst, usize + 8); kstart_ = dst; memcpy(dst, user_key.data(), usize); dst += usize; EncodeFixed64(dst, PackSequenceAndType(s, kValueTypeForSeek)); dst += 8; end_ = dst; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/builder.cc0000644000000000000000000000416312414772654017656 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/builder.h" #include "db/filename.h" #include "db/dbformat.h" #include "db/table_cache.h" #include "db/version_edit.h" #include "leveldb/db.h" #include "leveldb/env.h" #include "leveldb/iterator.h" namespace leveldb { Status BuildTable(const std::string& dbname, Env* env, const Options& options, TableCache* table_cache, Iterator* iter, FileMetaData* meta) { Status s; meta->file_size = 0; iter->SeekToFirst(); std::string fname = TableFileName(dbname, meta->number); if (iter->Valid()) { WritableFile* file; s = env->NewWritableFile(fname, &file); if (!s.ok()) { return s; } TableBuilder* builder = new TableBuilder(options, file); meta->smallest.DecodeFrom(iter->key()); for (; iter->Valid(); iter->Next()) { Slice key = iter->key(); meta->largest.DecodeFrom(key); builder->Add(key, iter->value()); } // Finish and check for builder errors if (s.ok()) { s = builder->Finish(); if (s.ok()) { meta->file_size = builder->FileSize(); assert(meta->file_size > 0); } } else { builder->Abandon(); } delete builder; // Finish and check for file errors if (s.ok()) { s = file->Sync(); } if (s.ok()) { s = file->Close(); } delete file; file = NULL; if (s.ok()) { // Verify that the table is usable Iterator* it = table_cache->NewIterator(ReadOptions(), meta->number, meta->file_size); s = it->status(); delete it; } } // Check for input iterator errors if (!iter->status().ok()) { s = iter->status(); } if (s.ok() && meta->file_size > 0) { // Keep it } else { env->DeleteFile(fname); } return s; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/version_edit.h0000644000000000000000000000565612414772654020574 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_DB_VERSION_EDIT_H_ #define STORAGE_LEVELDB_DB_VERSION_EDIT_H_ #include #include #include #include "db/dbformat.h" namespace leveldb { class VersionSet; struct FileMetaData { int refs; int allowed_seeks; // Seeks allowed until compaction uint64_t number; uint64_t file_size; // File size in bytes InternalKey smallest; // Smallest internal key served by table InternalKey largest; // Largest internal key served by table FileMetaData() : refs(0), allowed_seeks(1 << 30), file_size(0) { } }; class VersionEdit { public: VersionEdit() { Clear(); } ~VersionEdit() { } void Clear(); void SetComparatorName(const Slice& name) { has_comparator_ = true; comparator_ = name.ToString(); } void SetLogNumber(uint64_t num) { has_log_number_ = true; log_number_ = num; } void SetPrevLogNumber(uint64_t num) { has_prev_log_number_ = true; prev_log_number_ = num; } void SetNextFile(uint64_t num) { has_next_file_number_ = true; next_file_number_ = num; } void SetLastSequence(SequenceNumber seq) { has_last_sequence_ = true; last_sequence_ = seq; } void SetCompactPointer(int level, const InternalKey& key) { compact_pointers_.push_back(std::make_pair(level, key)); } // Add the specified file at the specified number. // REQUIRES: This version has not been saved (see VersionSet::SaveTo) // REQUIRES: "smallest" and "largest" are smallest and largest keys in file void AddFile(int level, uint64_t file, uint64_t file_size, const InternalKey& smallest, const InternalKey& largest) { FileMetaData f; f.number = file; f.file_size = file_size; f.smallest = smallest; f.largest = largest; new_files_.push_back(std::make_pair(level, f)); } // Delete the specified "file" from the specified "level". void DeleteFile(int level, uint64_t file) { deleted_files_.insert(std::make_pair(level, file)); } void EncodeTo(std::string* dst) const; Status DecodeFrom(const Slice& src); std::string DebugString() const; private: friend class VersionSet; typedef std::set< std::pair > DeletedFileSet; std::string comparator_; uint64_t log_number_; uint64_t prev_log_number_; uint64_t next_file_number_; SequenceNumber last_sequence_; bool has_comparator_; bool has_log_number_; bool has_prev_log_number_; bool has_next_file_number_; bool has_last_sequence_; std::vector< std::pair > compact_pointers_; DeletedFileSet deleted_files_; std::vector< std::pair > new_files_; }; } // namespace leveldb #endif // STORAGE_LEVELDB_DB_VERSION_EDIT_H_ armory-0.92.3/cppForSwig/leveldb/db/log_writer.cc0000644000000000000000000000543412414772654020407 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/log_writer.h" #include #include "leveldb/env.h" #include "util/coding.h" #include "util/crc32c.h" namespace leveldb { namespace log { Writer::Writer(WritableFile* dest) : dest_(dest), block_offset_(0) { for (int i = 0; i <= kMaxRecordType; i++) { char t = static_cast(i); type_crc_[i] = crc32c::Value(&t, 1); } } Writer::~Writer() { } Status Writer::AddRecord(const Slice& slice) { const char* ptr = slice.data(); size_t left = slice.size(); // Fragment the record if necessary and emit it. Note that if slice // is empty, we still want to iterate once to emit a single // zero-length record Status s; bool begin = true; do { const int leftover = kBlockSize - block_offset_; assert(leftover >= 0); if (leftover < kHeaderSize) { // Switch to a new block if (leftover > 0) { // Fill the trailer (literal below relies on kHeaderSize being 7) assert(kHeaderSize == 7); dest_->Append(Slice("\x00\x00\x00\x00\x00\x00", leftover)); } block_offset_ = 0; } // Invariant: we never leave < kHeaderSize bytes in a block. assert(kBlockSize - block_offset_ - kHeaderSize >= 0); const size_t avail = kBlockSize - block_offset_ - kHeaderSize; const size_t fragment_length = (left < avail) ? left : avail; RecordType type; const bool end = (left == fragment_length); if (begin && end) { type = kFullType; } else if (begin) { type = kFirstType; } else if (end) { type = kLastType; } else { type = kMiddleType; } s = EmitPhysicalRecord(type, ptr, fragment_length); ptr += fragment_length; left -= fragment_length; begin = false; } while (s.ok() && left > 0); return s; } Status Writer::EmitPhysicalRecord(RecordType t, const char* ptr, size_t n) { assert(n <= 0xffff); // Must fit in two bytes assert(block_offset_ + kHeaderSize + n <= kBlockSize); // Format the header char buf[kHeaderSize]; buf[4] = static_cast(n & 0xff); buf[5] = static_cast(n >> 8); buf[6] = static_cast(t); // Compute the crc of the record type and the payload. uint32_t crc = crc32c::Extend(type_crc_[t], ptr, n); crc = crc32c::Mask(crc); // Adjust for storage EncodeFixed32(buf, crc); // Write the header and the payload Status s = dest_->Append(Slice(buf, kHeaderSize)); if (s.ok()) { s = dest_->Append(Slice(ptr, n)); if (s.ok()) { s = dest_->Flush(); } } block_offset_ += kHeaderSize + n; return s; } } // namespace log } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/filename.h0000644000000000000000000000575012414772654017655 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // File names used by DB code #ifndef STORAGE_LEVELDB_DB_FILENAME_H_ #define STORAGE_LEVELDB_DB_FILENAME_H_ #include #include #include "leveldb/slice.h" #include "leveldb/status.h" #include "port/port.h" namespace leveldb { class Env; enum FileType { kLogFile, kDBLockFile, kTableFile, kDescriptorFile, kCurrentFile, kTempFile, kInfoLogFile // Either the current one, or an old one }; // Return the name of the log file with the specified number // in the db named by "dbname". The result will be prefixed with // "dbname". extern std::string LogFileName(const std::string& dbname, uint64_t number); // Return the name of the sstable with the specified number // in the db named by "dbname". The result will be prefixed with // "dbname". extern std::string TableFileName(const std::string& dbname, uint64_t number); // Return the legacy file name for an sstable with the specified number // in the db named by "dbname". The result will be prefixed with // "dbname". extern std::string SSTTableFileName(const std::string& dbname, uint64_t number); // Return the name of the descriptor file for the db named by // "dbname" and the specified incarnation number. The result will be // prefixed with "dbname". extern std::string DescriptorFileName(const std::string& dbname, uint64_t number); // Return the name of the current file. This file contains the name // of the current manifest file. The result will be prefixed with // "dbname". extern std::string CurrentFileName(const std::string& dbname); // Return the name of the lock file for the db named by // "dbname". The result will be prefixed with "dbname". extern std::string LockFileName(const std::string& dbname); // Return the name of a temporary file owned by the db named "dbname". // The result will be prefixed with "dbname". extern std::string TempFileName(const std::string& dbname, uint64_t number); // Return the name of the info log file for "dbname". extern std::string InfoLogFileName(const std::string& dbname); // Return the name of the old info log file for "dbname". extern std::string OldInfoLogFileName(const std::string& dbname); // If filename is a leveldb file, store the type of the file in *type. // The number encoded in the filename is stored in *number. If the // filename was successfully parsed, returns true. Else return false. extern bool ParseFileName(const std::string& filename, uint64_t* number, FileType* type); // Make the CURRENT file point to the descriptor file with the // specified number. extern Status SetCurrentFile(Env* env, const std::string& dbname, uint64_t descriptor_number); } // namespace leveldb #endif // STORAGE_LEVELDB_DB_FILENAME_H_ armory-0.92.3/cppForSwig/leveldb/db/version_set.cc0000644000000000000000000013510412414772654020570 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/version_set.h" #include #include #include "db/filename.h" #include "db/log_reader.h" #include "db/log_writer.h" #include "db/memtable.h" #include "db/table_cache.h" #include "leveldb/env.h" #include "leveldb/table_builder.h" #include "table/merger.h" #include "table/two_level_iterator.h" #include "util/coding.h" #include "util/logging.h" namespace leveldb { static const int kTargetFileSize = 2 * 1048576; // Maximum bytes of overlaps in grandparent (i.e., level+2) before we // stop building a single file in a level->level+1 compaction. static const int64_t kMaxGrandParentOverlapBytes = 10 * kTargetFileSize; // Maximum number of bytes in all compacted files. We avoid expanding // the lower level file set of a compaction if it would make the // total compaction cover more than this many bytes. static const int64_t kExpandedCompactionByteSizeLimit = 25 * kTargetFileSize; static double MaxBytesForLevel(int level) { // Note: the result for level zero is not really used since we set // the level-0 compaction threshold based on number of files. double result = 10 * 1048576.0; // Result for both level-0 and level-1 while (level > 1) { result *= 10; level--; } return result; } static uint64_t MaxFileSizeForLevel(int level) { return kTargetFileSize; // We could vary per level to reduce number of files? } static int64_t TotalFileSize(const std::vector& files) { int64_t sum = 0; for (size_t i = 0; i < files.size(); i++) { sum += files[i]->file_size; } return sum; } namespace { std::string IntSetToString(const std::set& s) { std::string result = "{"; for (std::set::const_iterator it = s.begin(); it != s.end(); ++it) { result += (result.size() > 1) ? "," : ""; result += NumberToString(*it); } result += "}"; return result; } } // namespace Version::~Version() { assert(refs_ == 0); // Remove from linked list prev_->next_ = next_; next_->prev_ = prev_; // Drop references to files for (int level = 0; level < config::kNumLevels; level++) { for (size_t i = 0; i < files_[level].size(); i++) { FileMetaData* f = files_[level][i]; assert(f->refs > 0); f->refs--; if (f->refs <= 0) { delete f; } } } } int FindFile(const InternalKeyComparator& icmp, const std::vector& files, const Slice& key) { uint32_t left = 0; uint32_t right = files.size(); while (left < right) { uint32_t mid = (left + right) / 2; const FileMetaData* f = files[mid]; if (icmp.InternalKeyComparator::Compare(f->largest.Encode(), key) < 0) { // Key at "mid.largest" is < "target". Therefore all // files at or before "mid" are uninteresting. left = mid + 1; } else { // Key at "mid.largest" is >= "target". Therefore all files // after "mid" are uninteresting. right = mid; } } return right; } static bool AfterFile(const Comparator* ucmp, const Slice* user_key, const FileMetaData* f) { // NULL user_key occurs before all keys and is therefore never after *f return (user_key != NULL && ucmp->Compare(*user_key, f->largest.user_key()) > 0); } static bool BeforeFile(const Comparator* ucmp, const Slice* user_key, const FileMetaData* f) { // NULL user_key occurs after all keys and is therefore never before *f return (user_key != NULL && ucmp->Compare(*user_key, f->smallest.user_key()) < 0); } bool SomeFileOverlapsRange( const InternalKeyComparator& icmp, bool disjoint_sorted_files, const std::vector& files, const Slice* smallest_user_key, const Slice* largest_user_key) { const Comparator* ucmp = icmp.user_comparator(); if (!disjoint_sorted_files) { // Need to check against all files for (size_t i = 0; i < files.size(); i++) { const FileMetaData* f = files[i]; if (AfterFile(ucmp, smallest_user_key, f) || BeforeFile(ucmp, largest_user_key, f)) { // No overlap } else { return true; // Overlap } } return false; } // Binary search over file list uint32_t index = 0; if (smallest_user_key != NULL) { // Find the earliest possible internal key for smallest_user_key InternalKey small(*smallest_user_key, kMaxSequenceNumber,kValueTypeForSeek); index = FindFile(icmp, files, small.Encode()); } if (index >= files.size()) { // beginning of range is after all files, so no overlap. return false; } return !BeforeFile(ucmp, largest_user_key, files[index]); } // An internal iterator. For a given version/level pair, yields // information about the files in the level. For a given entry, key() // is the largest key that occurs in the file, and value() is an // 16-byte value containing the file number and file size, both // encoded using EncodeFixed64. class Version::LevelFileNumIterator : public Iterator { public: LevelFileNumIterator(const InternalKeyComparator& icmp, const std::vector* flist) : icmp_(icmp), flist_(flist), index_(flist->size()) { // Marks as invalid } virtual bool Valid() const { return index_ < flist_->size(); } virtual void Seek(const Slice& target) { index_ = FindFile(icmp_, *flist_, target); } virtual void SeekToFirst() { index_ = 0; } virtual void SeekToLast() { index_ = flist_->empty() ? 0 : flist_->size() - 1; } virtual void Next() { assert(Valid()); index_++; } virtual void Prev() { assert(Valid()); if (index_ == 0) { index_ = flist_->size(); // Marks as invalid } else { index_--; } } Slice key() const { assert(Valid()); return (*flist_)[index_]->largest.Encode(); } Slice value() const { assert(Valid()); EncodeFixed64(value_buf_, (*flist_)[index_]->number); EncodeFixed64(value_buf_+8, (*flist_)[index_]->file_size); return Slice(value_buf_, sizeof(value_buf_)); } virtual Status status() const { return Status::OK(); } private: const InternalKeyComparator icmp_; const std::vector* const flist_; uint32_t index_; // Backing store for value(). Holds the file number and size. mutable char value_buf_[16]; }; static Iterator* GetFileIterator(void* arg, const ReadOptions& options, const Slice& file_value) { TableCache* cache = reinterpret_cast(arg); if (file_value.size() != 16) { return NewErrorIterator( Status::Corruption("FileReader invoked with unexpected value")); } else { return cache->NewIterator(options, DecodeFixed64(file_value.data()), DecodeFixed64(file_value.data() + 8)); } } Iterator* Version::NewConcatenatingIterator(const ReadOptions& options, int level) const { return NewTwoLevelIterator( new LevelFileNumIterator(vset_->icmp_, &files_[level]), &GetFileIterator, vset_->table_cache_, options); } void Version::AddIterators(const ReadOptions& options, std::vector* iters) { // Merge all level zero files together since they may overlap for (size_t i = 0; i < files_[0].size(); i++) { iters->push_back( vset_->table_cache_->NewIterator( options, files_[0][i]->number, files_[0][i]->file_size)); } // For levels > 0, we can use a concatenating iterator that sequentially // walks through the non-overlapping files in the level, opening them // lazily. for (int level = 1; level < config::kNumLevels; level++) { if (!files_[level].empty()) { iters->push_back(NewConcatenatingIterator(options, level)); } } } // Callback from TableCache::Get() namespace { enum SaverState { kNotFound, kFound, kDeleted, kCorrupt, }; struct Saver { SaverState state; const Comparator* ucmp; Slice user_key; std::string* value; }; } static void SaveValue(void* arg, const Slice& ikey, const Slice& v) { Saver* s = reinterpret_cast(arg); ParsedInternalKey parsed_key; if (!ParseInternalKey(ikey, &parsed_key)) { s->state = kCorrupt; } else { if (s->ucmp->Compare(parsed_key.user_key, s->user_key) == 0) { s->state = (parsed_key.type == kTypeValue) ? kFound : kDeleted; if (s->state == kFound) { s->value->assign(v.data(), v.size()); } } } } static bool NewestFirst(FileMetaData* a, FileMetaData* b) { return a->number > b->number; } void Version::ForEachOverlapping(Slice user_key, Slice internal_key, void* arg, bool (*func)(void*, int, FileMetaData*)) { // TODO(sanjay): Change Version::Get() to use this function. const Comparator* ucmp = vset_->icmp_.user_comparator(); // Search level-0 in order from newest to oldest. std::vector tmp; tmp.reserve(files_[0].size()); for (uint32_t i = 0; i < files_[0].size(); i++) { FileMetaData* f = files_[0][i]; if (ucmp->Compare(user_key, f->smallest.user_key()) >= 0 && ucmp->Compare(user_key, f->largest.user_key()) <= 0) { tmp.push_back(f); } } if (!tmp.empty()) { std::sort(tmp.begin(), tmp.end(), NewestFirst); for (uint32_t i = 0; i < tmp.size(); i++) { if (!(*func)(arg, 0, tmp[i])) { return; } } } // Search other levels. for (int level = 1; level < config::kNumLevels; level++) { size_t num_files = files_[level].size(); if (num_files == 0) continue; // Binary search to find earliest index whose largest key >= internal_key. uint32_t index = FindFile(vset_->icmp_, files_[level], internal_key); if (index < num_files) { FileMetaData* f = files_[level][index]; if (ucmp->Compare(user_key, f->smallest.user_key()) < 0) { // All of "f" is past any data for user_key } else { if (!(*func)(arg, level, f)) { return; } } } } } Status Version::Get(const ReadOptions& options, const LookupKey& k, std::string* value, GetStats* stats) { Slice ikey = k.internal_key(); Slice user_key = k.user_key(); const Comparator* ucmp = vset_->icmp_.user_comparator(); Status s; stats->seek_file = NULL; stats->seek_file_level = -1; FileMetaData* last_file_read = NULL; int last_file_read_level = -1; // We can search level-by-level since entries never hop across // levels. Therefore we are guaranteed that if we find data // in an smaller level, later levels are irrelevant. std::vector tmp; FileMetaData* tmp2; for (int level = 0; level < config::kNumLevels; level++) { size_t num_files = files_[level].size(); if (num_files == 0) continue; // Get the list of files to search in this level FileMetaData* const* files = &files_[level][0]; if (level == 0) { // Level-0 files may overlap each other. Find all files that // overlap user_key and process them in order from newest to oldest. tmp.reserve(num_files); for (uint32_t i = 0; i < num_files; i++) { FileMetaData* f = files[i]; if (ucmp->Compare(user_key, f->smallest.user_key()) >= 0 && ucmp->Compare(user_key, f->largest.user_key()) <= 0) { tmp.push_back(f); } } if (tmp.empty()) continue; std::sort(tmp.begin(), tmp.end(), NewestFirst); files = &tmp[0]; num_files = tmp.size(); } else { // Binary search to find earliest index whose largest key >= ikey. uint32_t index = FindFile(vset_->icmp_, files_[level], ikey); if (index >= num_files) { files = NULL; num_files = 0; } else { tmp2 = files[index]; if (ucmp->Compare(user_key, tmp2->smallest.user_key()) < 0) { // All of "tmp2" is past any data for user_key files = NULL; num_files = 0; } else { files = &tmp2; num_files = 1; } } } for (uint32_t i = 0; i < num_files; ++i) { if (last_file_read != NULL && stats->seek_file == NULL) { // We have had more than one seek for this read. Charge the 1st file. stats->seek_file = last_file_read; stats->seek_file_level = last_file_read_level; } FileMetaData* f = files[i]; last_file_read = f; last_file_read_level = level; Saver saver; saver.state = kNotFound; saver.ucmp = ucmp; saver.user_key = user_key; saver.value = value; s = vset_->table_cache_->Get(options, f->number, f->file_size, ikey, &saver, SaveValue); if (!s.ok()) { return s; } switch (saver.state) { case kNotFound: break; // Keep searching in other files case kFound: return s; case kDeleted: s = Status::NotFound(Slice()); // Use empty error message for speed return s; case kCorrupt: s = Status::Corruption("corrupted key for ", user_key); return s; } } } return Status::NotFound(Slice()); // Use an empty error message for speed } bool Version::UpdateStats(const GetStats& stats) { FileMetaData* f = stats.seek_file; if (f != NULL) { f->allowed_seeks--; if (f->allowed_seeks <= 0 && file_to_compact_ == NULL) { file_to_compact_ = f; file_to_compact_level_ = stats.seek_file_level; return true; } } return false; } bool Version::RecordReadSample(Slice internal_key) { ParsedInternalKey ikey; if (!ParseInternalKey(internal_key, &ikey)) { return false; } struct State { GetStats stats; // Holds first matching file int matches; static bool Match(void* arg, int level, FileMetaData* f) { State* state = reinterpret_cast(arg); state->matches++; if (state->matches == 1) { // Remember first match. state->stats.seek_file = f; state->stats.seek_file_level = level; } // We can stop iterating once we have a second match. return state->matches < 2; } }; State state; state.matches = 0; ForEachOverlapping(ikey.user_key, internal_key, &state, &State::Match); // Must have at least two matches since we want to merge across // files. But what if we have a single file that contains many // overwrites and deletions? Should we have another mechanism for // finding such files? if (state.matches >= 2) { // 1MB cost is about 1 seek (see comment in Builder::Apply). return UpdateStats(state.stats); } return false; } void Version::Ref() { ++refs_; } void Version::Unref() { assert(this != &vset_->dummy_versions_); assert(refs_ >= 1); --refs_; if (refs_ == 0) { delete this; } } bool Version::OverlapInLevel(int level, const Slice* smallest_user_key, const Slice* largest_user_key) { return SomeFileOverlapsRange(vset_->icmp_, (level > 0), files_[level], smallest_user_key, largest_user_key); } int Version::PickLevelForMemTableOutput( const Slice& smallest_user_key, const Slice& largest_user_key) { int level = 0; if (!OverlapInLevel(0, &smallest_user_key, &largest_user_key)) { // Push to next level if there is no overlap in next level, // and the #bytes overlapping in the level after that are limited. InternalKey start(smallest_user_key, kMaxSequenceNumber, kValueTypeForSeek); InternalKey limit(largest_user_key, 0, static_cast(0)); std::vector overlaps; while (level < config::kMaxMemCompactLevel) { if (OverlapInLevel(level + 1, &smallest_user_key, &largest_user_key)) { break; } if (level + 2 < config::kNumLevels) { // Check that file does not overlap too many grandparent bytes. GetOverlappingInputs(level + 2, &start, &limit, &overlaps); const int64_t sum = TotalFileSize(overlaps); if (sum > kMaxGrandParentOverlapBytes) { break; } } level++; } } return level; } // Store in "*inputs" all files in "level" that overlap [begin,end] void Version::GetOverlappingInputs( int level, const InternalKey* begin, const InternalKey* end, std::vector* inputs) { assert(level >= 0); assert(level < config::kNumLevels); inputs->clear(); Slice user_begin, user_end; if (begin != NULL) { user_begin = begin->user_key(); } if (end != NULL) { user_end = end->user_key(); } const Comparator* user_cmp = vset_->icmp_.user_comparator(); for (size_t i = 0; i < files_[level].size(); ) { FileMetaData* f = files_[level][i++]; const Slice file_start = f->smallest.user_key(); const Slice file_limit = f->largest.user_key(); if (begin != NULL && user_cmp->Compare(file_limit, user_begin) < 0) { // "f" is completely before specified range; skip it } else if (end != NULL && user_cmp->Compare(file_start, user_end) > 0) { // "f" is completely after specified range; skip it } else { inputs->push_back(f); if (level == 0) { // Level-0 files may overlap each other. So check if the newly // added file has expanded the range. If so, restart search. if (begin != NULL && user_cmp->Compare(file_start, user_begin) < 0) { user_begin = file_start; inputs->clear(); i = 0; } else if (end != NULL && user_cmp->Compare(file_limit, user_end) > 0) { user_end = file_limit; inputs->clear(); i = 0; } } } } } std::string Version::DebugString() const { std::string r; for (int level = 0; level < config::kNumLevels; level++) { // E.g., // --- level 1 --- // 17:123['a' .. 'd'] // 20:43['e' .. 'g'] r.append("--- level "); AppendNumberTo(&r, level); r.append(" ---\n"); const std::vector& files = files_[level]; for (size_t i = 0; i < files.size(); i++) { r.push_back(' '); AppendNumberTo(&r, files[i]->number); r.push_back(':'); AppendNumberTo(&r, files[i]->file_size); r.append("["); r.append(files[i]->smallest.DebugString()); r.append(" .. "); r.append(files[i]->largest.DebugString()); r.append("]\n"); } } return r; } // A helper class so we can efficiently apply a whole sequence // of edits to a particular state without creating intermediate // Versions that contain full copies of the intermediate state. class VersionSet::Builder { private: // Helper to sort by v->files_[file_number].smallest struct BySmallestKey { const InternalKeyComparator* internal_comparator; bool operator()(FileMetaData* f1, FileMetaData* f2) const { int r = internal_comparator->Compare(f1->smallest, f2->smallest); if (r != 0) { return (r < 0); } else { // Break ties by file number return (f1->number < f2->number); } } }; typedef std::set FileSet; struct LevelState { std::set deleted_files; FileSet* added_files; }; VersionSet* vset_; Version* base_; LevelState levels_[config::kNumLevels]; public: // Initialize a builder with the files from *base and other info from *vset Builder(VersionSet* vset, Version* base) : vset_(vset), base_(base) { base_->Ref(); BySmallestKey cmp; cmp.internal_comparator = &vset_->icmp_; for (int level = 0; level < config::kNumLevels; level++) { levels_[level].added_files = new FileSet(cmp); } } ~Builder() { for (int level = 0; level < config::kNumLevels; level++) { const FileSet* added = levels_[level].added_files; std::vector to_unref; to_unref.reserve(added->size()); for (FileSet::const_iterator it = added->begin(); it != added->end(); ++it) { to_unref.push_back(*it); } delete added; for (uint32_t i = 0; i < to_unref.size(); i++) { FileMetaData* f = to_unref[i]; f->refs--; if (f->refs <= 0) { delete f; } } } base_->Unref(); } // Apply all of the edits in *edit to the current state. void Apply(VersionEdit* edit) { // Update compaction pointers for (size_t i = 0; i < edit->compact_pointers_.size(); i++) { const int level = edit->compact_pointers_[i].first; vset_->compact_pointer_[level] = edit->compact_pointers_[i].second.Encode().ToString(); } // Delete files const VersionEdit::DeletedFileSet& del = edit->deleted_files_; for (VersionEdit::DeletedFileSet::const_iterator iter = del.begin(); iter != del.end(); ++iter) { const int level = iter->first; const uint64_t number = iter->second; levels_[level].deleted_files.insert(number); } // Add new files for (size_t i = 0; i < edit->new_files_.size(); i++) { const int level = edit->new_files_[i].first; FileMetaData* f = new FileMetaData(edit->new_files_[i].second); f->refs = 1; // We arrange to automatically compact this file after // a certain number of seeks. Let's assume: // (1) One seek costs 10ms // (2) Writing or reading 1MB costs 10ms (100MB/s) // (3) A compaction of 1MB does 25MB of IO: // 1MB read from this level // 10-12MB read from next level (boundaries may be misaligned) // 10-12MB written to next level // This implies that 25 seeks cost the same as the compaction // of 1MB of data. I.e., one seek costs approximately the // same as the compaction of 40KB of data. We are a little // conservative and allow approximately one seek for every 16KB // of data before triggering a compaction. f->allowed_seeks = (f->file_size / 16384); if (f->allowed_seeks < 100) f->allowed_seeks = 100; levels_[level].deleted_files.erase(f->number); levels_[level].added_files->insert(f); } } // Save the current state in *v. void SaveTo(Version* v) { BySmallestKey cmp; cmp.internal_comparator = &vset_->icmp_; for (int level = 0; level < config::kNumLevels; level++) { // Merge the set of added files with the set of pre-existing files. // Drop any deleted files. Store the result in *v. const std::vector& base_files = base_->files_[level]; std::vector::const_iterator base_iter = base_files.begin(); std::vector::const_iterator base_end = base_files.end(); const FileSet* added = levels_[level].added_files; v->files_[level].reserve(base_files.size() + added->size()); for (FileSet::const_iterator added_iter = added->begin(); added_iter != added->end(); ++added_iter) { // Add all smaller files listed in base_ for (std::vector::const_iterator bpos = std::upper_bound(base_iter, base_end, *added_iter, cmp); base_iter != bpos; ++base_iter) { MaybeAddFile(v, level, *base_iter); } MaybeAddFile(v, level, *added_iter); } // Add remaining base files for (; base_iter != base_end; ++base_iter) { MaybeAddFile(v, level, *base_iter); } #ifndef NDEBUG // Make sure there is no overlap in levels > 0 if (level > 0) { for (uint32_t i = 1; i < v->files_[level].size(); i++) { const InternalKey& prev_end = v->files_[level][i-1]->largest; const InternalKey& this_begin = v->files_[level][i]->smallest; if (vset_->icmp_.Compare(prev_end, this_begin) >= 0) { fprintf(stderr, "overlapping ranges in same level %s vs. %s\n", prev_end.DebugString().c_str(), this_begin.DebugString().c_str()); abort(); } } } #endif } } void MaybeAddFile(Version* v, int level, FileMetaData* f) { if (levels_[level].deleted_files.count(f->number) > 0) { // File is deleted: do nothing } else { std::vector* files = &v->files_[level]; if (level > 0 && !files->empty()) { // Must not overlap assert(vset_->icmp_.Compare((*files)[files->size()-1]->largest, f->smallest) < 0); } f->refs++; files->push_back(f); } } }; VersionSet::VersionSet(const std::string& dbname, const Options* options, TableCache* table_cache, const InternalKeyComparator* cmp) : env_(options->env), dbname_(dbname), options_(options), table_cache_(table_cache), icmp_(*cmp), next_file_number_(2), manifest_file_number_(0), // Filled by Recover() last_sequence_(0), log_number_(0), prev_log_number_(0), descriptor_file_(NULL), descriptor_log_(NULL), dummy_versions_(this), current_(NULL) { AppendVersion(new Version(this)); } VersionSet::~VersionSet() { current_->Unref(); assert(dummy_versions_.next_ == &dummy_versions_); // List must be empty delete descriptor_log_; delete descriptor_file_; } void VersionSet::AppendVersion(Version* v) { // Make "v" current assert(v->refs_ == 0); assert(v != current_); if (current_ != NULL) { current_->Unref(); } current_ = v; v->Ref(); // Append to linked list v->prev_ = dummy_versions_.prev_; v->next_ = &dummy_versions_; v->prev_->next_ = v; v->next_->prev_ = v; } Status VersionSet::LogAndApply(VersionEdit* edit, port::Mutex* mu) { if (edit->has_log_number_) { assert(edit->log_number_ >= log_number_); assert(edit->log_number_ < next_file_number_); } else { edit->SetLogNumber(log_number_); } if (!edit->has_prev_log_number_) { edit->SetPrevLogNumber(prev_log_number_); } edit->SetNextFile(next_file_number_); edit->SetLastSequence(last_sequence_); Version* v = new Version(this); { Builder builder(this, current_); builder.Apply(edit); builder.SaveTo(v); } Finalize(v); // Initialize new descriptor log file if necessary by creating // a temporary file that contains a snapshot of the current version. std::string new_manifest_file; Status s; if (descriptor_log_ == NULL) { // No reason to unlock *mu here since we only hit this path in the // first call to LogAndApply (when opening the database). assert(descriptor_file_ == NULL); new_manifest_file = DescriptorFileName(dbname_, manifest_file_number_); edit->SetNextFile(next_file_number_); s = env_->NewWritableFile(new_manifest_file, &descriptor_file_); if (s.ok()) { descriptor_log_ = new log::Writer(descriptor_file_); s = WriteSnapshot(descriptor_log_); } } // Unlock during expensive MANIFEST log write { mu->Unlock(); // Write new record to MANIFEST log if (s.ok()) { std::string record; edit->EncodeTo(&record); s = descriptor_log_->AddRecord(record); if (s.ok()) { s = descriptor_file_->Sync(); } if (!s.ok()) { Log(options_->info_log, "MANIFEST write: %s\n", s.ToString().c_str()); } } // If we just created a new descriptor file, install it by writing a // new CURRENT file that points to it. if (s.ok() && !new_manifest_file.empty()) { s = SetCurrentFile(env_, dbname_, manifest_file_number_); } mu->Lock(); } // Install the new version if (s.ok()) { AppendVersion(v); log_number_ = edit->log_number_; prev_log_number_ = edit->prev_log_number_; } else { delete v; if (!new_manifest_file.empty()) { delete descriptor_log_; delete descriptor_file_; descriptor_log_ = NULL; descriptor_file_ = NULL; env_->DeleteFile(new_manifest_file); } } return s; } Status VersionSet::Recover() { struct LogReporter : public log::Reader::Reporter { Status* status; virtual void Corruption(size_t bytes, const Status& s) { if (this->status->ok()) *this->status = s; } }; // Read "CURRENT" file, which contains a pointer to the current manifest file std::string current; Status s = ReadFileToString(env_, CurrentFileName(dbname_), ¤t); if (!s.ok()) { return s; } if (current.empty() || current[current.size()-1] != '\n') { return Status::Corruption("CURRENT file does not end with newline"); } current.resize(current.size() - 1); std::string dscname = dbname_ + "/" + current; SequentialFile* file; s = env_->NewSequentialFile(dscname, &file); if (!s.ok()) { return s; } bool have_log_number = false; bool have_prev_log_number = false; bool have_next_file = false; bool have_last_sequence = false; uint64_t next_file = 0; uint64_t last_sequence = 0; uint64_t log_number = 0; uint64_t prev_log_number = 0; Builder builder(this, current_); { LogReporter reporter; reporter.status = &s; log::Reader reader(file, &reporter, true/*checksum*/, 0/*initial_offset*/); Slice record; std::string scratch; while (reader.ReadRecord(&record, &scratch) && s.ok()) { VersionEdit edit; s = edit.DecodeFrom(record); if (s.ok()) { if (edit.has_comparator_ && edit.comparator_ != icmp_.user_comparator()->Name()) { s = Status::InvalidArgument( edit.comparator_ + " does not match existing comparator ", icmp_.user_comparator()->Name()); } } if (s.ok()) { builder.Apply(&edit); } if (edit.has_log_number_) { log_number = edit.log_number_; have_log_number = true; } if (edit.has_prev_log_number_) { prev_log_number = edit.prev_log_number_; have_prev_log_number = true; } if (edit.has_next_file_number_) { next_file = edit.next_file_number_; have_next_file = true; } if (edit.has_last_sequence_) { last_sequence = edit.last_sequence_; have_last_sequence = true; } } } delete file; file = NULL; if (s.ok()) { if (!have_next_file) { s = Status::Corruption("no meta-nextfile entry in descriptor"); } else if (!have_log_number) { s = Status::Corruption("no meta-lognumber entry in descriptor"); } else if (!have_last_sequence) { s = Status::Corruption("no last-sequence-number entry in descriptor"); } if (!have_prev_log_number) { prev_log_number = 0; } MarkFileNumberUsed(prev_log_number); MarkFileNumberUsed(log_number); } if (s.ok()) { Version* v = new Version(this); builder.SaveTo(v); // Install recovered version Finalize(v); AppendVersion(v); manifest_file_number_ = next_file; next_file_number_ = next_file + 1; last_sequence_ = last_sequence; log_number_ = log_number; prev_log_number_ = prev_log_number; } return s; } void VersionSet::MarkFileNumberUsed(uint64_t number) { if (next_file_number_ <= number) { next_file_number_ = number + 1; } } void VersionSet::Finalize(Version* v) { // Precomputed best level for next compaction int best_level = -1; double best_score = -1; for (int level = 0; level < config::kNumLevels-1; level++) { double score; if (level == 0) { // We treat level-0 specially by bounding the number of files // instead of number of bytes for two reasons: // // (1) With larger write-buffer sizes, it is nice not to do too // many level-0 compactions. // // (2) The files in level-0 are merged on every read and // therefore we wish to avoid too many files when the individual // file size is small (perhaps because of a small write-buffer // setting, or very high compression ratios, or lots of // overwrites/deletions). score = v->files_[level].size() / static_cast(config::kL0_CompactionTrigger); } else { // Compute the ratio of current size to size limit. const uint64_t level_bytes = TotalFileSize(v->files_[level]); score = static_cast(level_bytes) / MaxBytesForLevel(level); } if (score > best_score) { best_level = level; best_score = score; } } v->compaction_level_ = best_level; v->compaction_score_ = best_score; } Status VersionSet::WriteSnapshot(log::Writer* log) { // TODO: Break up into multiple records to reduce memory usage on recovery? // Save metadata VersionEdit edit; edit.SetComparatorName(icmp_.user_comparator()->Name()); // Save compaction pointers for (int level = 0; level < config::kNumLevels; level++) { if (!compact_pointer_[level].empty()) { InternalKey key; key.DecodeFrom(compact_pointer_[level]); edit.SetCompactPointer(level, key); } } // Save files for (int level = 0; level < config::kNumLevels; level++) { const std::vector& files = current_->files_[level]; for (size_t i = 0; i < files.size(); i++) { const FileMetaData* f = files[i]; edit.AddFile(level, f->number, f->file_size, f->smallest, f->largest); } } std::string record; edit.EncodeTo(&record); return log->AddRecord(record); } int VersionSet::NumLevelFiles(int level) const { assert(level >= 0); assert(level < config::kNumLevels); return current_->files_[level].size(); } const char* VersionSet::LevelSummary(LevelSummaryStorage* scratch) const { // Update code if kNumLevels changes assert(config::kNumLevels == 7); snprintf(scratch->buffer, sizeof(scratch->buffer), "files[ %d %d %d %d %d %d %d ]", int(current_->files_[0].size()), int(current_->files_[1].size()), int(current_->files_[2].size()), int(current_->files_[3].size()), int(current_->files_[4].size()), int(current_->files_[5].size()), int(current_->files_[6].size())); return scratch->buffer; } uint64_t VersionSet::ApproximateOffsetOf(Version* v, const InternalKey& ikey) { uint64_t result = 0; for (int level = 0; level < config::kNumLevels; level++) { const std::vector& files = v->files_[level]; for (size_t i = 0; i < files.size(); i++) { if (icmp_.Compare(files[i]->largest, ikey) <= 0) { // Entire file is before "ikey", so just add the file size result += files[i]->file_size; } else if (icmp_.Compare(files[i]->smallest, ikey) > 0) { // Entire file is after "ikey", so ignore if (level > 0) { // Files other than level 0 are sorted by meta->smallest, so // no further files in this level will contain data for // "ikey". break; } } else { // "ikey" falls in the range for this table. Add the // approximate offset of "ikey" within the table. Table* tableptr; Iterator* iter = table_cache_->NewIterator( ReadOptions(), files[i]->number, files[i]->file_size, &tableptr); if (tableptr != NULL) { result += tableptr->ApproximateOffsetOf(ikey.Encode()); } delete iter; } } } return result; } void VersionSet::AddLiveFiles(std::set* live) { for (Version* v = dummy_versions_.next_; v != &dummy_versions_; v = v->next_) { for (int level = 0; level < config::kNumLevels; level++) { const std::vector& files = v->files_[level]; for (size_t i = 0; i < files.size(); i++) { live->insert(files[i]->number); } } } } int64_t VersionSet::NumLevelBytes(int level) const { assert(level >= 0); assert(level < config::kNumLevels); return TotalFileSize(current_->files_[level]); } int64_t VersionSet::MaxNextLevelOverlappingBytes() { int64_t result = 0; std::vector overlaps; for (int level = 1; level < config::kNumLevels - 1; level++) { for (size_t i = 0; i < current_->files_[level].size(); i++) { const FileMetaData* f = current_->files_[level][i]; current_->GetOverlappingInputs(level+1, &f->smallest, &f->largest, &overlaps); const int64_t sum = TotalFileSize(overlaps); if (sum > result) { result = sum; } } } return result; } // Stores the minimal range that covers all entries in inputs in // *smallest, *largest. // REQUIRES: inputs is not empty void VersionSet::GetRange(const std::vector& inputs, InternalKey* smallest, InternalKey* largest) { assert(!inputs.empty()); smallest->Clear(); largest->Clear(); for (size_t i = 0; i < inputs.size(); i++) { FileMetaData* f = inputs[i]; if (i == 0) { *smallest = f->smallest; *largest = f->largest; } else { if (icmp_.Compare(f->smallest, *smallest) < 0) { *smallest = f->smallest; } if (icmp_.Compare(f->largest, *largest) > 0) { *largest = f->largest; } } } } // Stores the minimal range that covers all entries in inputs1 and inputs2 // in *smallest, *largest. // REQUIRES: inputs is not empty void VersionSet::GetRange2(const std::vector& inputs1, const std::vector& inputs2, InternalKey* smallest, InternalKey* largest) { std::vector all = inputs1; all.insert(all.end(), inputs2.begin(), inputs2.end()); GetRange(all, smallest, largest); } Iterator* VersionSet::MakeInputIterator(Compaction* c) { ReadOptions options; options.verify_checksums = options_->paranoid_checks; options.fill_cache = false; // Level-0 files have to be merged together. For other levels, // we will make a concatenating iterator per level. // TODO(opt): use concatenating iterator for level-0 if there is no overlap const int space = (c->level() == 0 ? c->inputs_[0].size() + 1 : 2); Iterator** list = new Iterator*[space]; int num = 0; for (int which = 0; which < 2; which++) { if (!c->inputs_[which].empty()) { if (c->level() + which == 0) { const std::vector& files = c->inputs_[which]; for (size_t i = 0; i < files.size(); i++) { list[num++] = table_cache_->NewIterator( options, files[i]->number, files[i]->file_size); } } else { // Create concatenating iterator for the files from this level list[num++] = NewTwoLevelIterator( new Version::LevelFileNumIterator(icmp_, &c->inputs_[which]), &GetFileIterator, table_cache_, options); } } } assert(num <= space); Iterator* result = NewMergingIterator(&icmp_, list, num); delete[] list; return result; } Compaction* VersionSet::PickCompaction() { Compaction* c; int level; // We prefer compactions triggered by too much data in a level over // the compactions triggered by seeks. const bool size_compaction = (current_->compaction_score_ >= 1); const bool seek_compaction = (current_->file_to_compact_ != NULL); if (size_compaction) { level = current_->compaction_level_; assert(level >= 0); assert(level+1 < config::kNumLevels); c = new Compaction(level); // Pick the first file that comes after compact_pointer_[level] for (size_t i = 0; i < current_->files_[level].size(); i++) { FileMetaData* f = current_->files_[level][i]; if (compact_pointer_[level].empty() || icmp_.Compare(f->largest.Encode(), compact_pointer_[level]) > 0) { c->inputs_[0].push_back(f); break; } } if (c->inputs_[0].empty()) { // Wrap-around to the beginning of the key space c->inputs_[0].push_back(current_->files_[level][0]); } } else if (seek_compaction) { level = current_->file_to_compact_level_; c = new Compaction(level); c->inputs_[0].push_back(current_->file_to_compact_); } else { return NULL; } c->input_version_ = current_; c->input_version_->Ref(); // Files in level 0 may overlap each other, so pick up all overlapping ones if (level == 0) { InternalKey smallest, largest; GetRange(c->inputs_[0], &smallest, &largest); // Note that the next call will discard the file we placed in // c->inputs_[0] earlier and replace it with an overlapping set // which will include the picked file. current_->GetOverlappingInputs(0, &smallest, &largest, &c->inputs_[0]); assert(!c->inputs_[0].empty()); } SetupOtherInputs(c); return c; } void VersionSet::SetupOtherInputs(Compaction* c) { const int level = c->level(); InternalKey smallest, largest; GetRange(c->inputs_[0], &smallest, &largest); current_->GetOverlappingInputs(level+1, &smallest, &largest, &c->inputs_[1]); // Get entire range covered by compaction InternalKey all_start, all_limit; GetRange2(c->inputs_[0], c->inputs_[1], &all_start, &all_limit); // See if we can grow the number of inputs in "level" without // changing the number of "level+1" files we pick up. if (!c->inputs_[1].empty()) { std::vector expanded0; current_->GetOverlappingInputs(level, &all_start, &all_limit, &expanded0); const int64_t inputs0_size = TotalFileSize(c->inputs_[0]); const int64_t inputs1_size = TotalFileSize(c->inputs_[1]); const int64_t expanded0_size = TotalFileSize(expanded0); if (expanded0.size() > c->inputs_[0].size() && inputs1_size + expanded0_size < kExpandedCompactionByteSizeLimit) { InternalKey new_start, new_limit; GetRange(expanded0, &new_start, &new_limit); std::vector expanded1; current_->GetOverlappingInputs(level+1, &new_start, &new_limit, &expanded1); if (expanded1.size() == c->inputs_[1].size()) { Log(options_->info_log, "Expanding@%d %d+%d (%ld+%ld bytes) to %d+%d (%ld+%ld bytes)\n", level, int(c->inputs_[0].size()), int(c->inputs_[1].size()), long(inputs0_size), long(inputs1_size), int(expanded0.size()), int(expanded1.size()), long(expanded0_size), long(inputs1_size)); smallest = new_start; largest = new_limit; c->inputs_[0] = expanded0; c->inputs_[1] = expanded1; GetRange2(c->inputs_[0], c->inputs_[1], &all_start, &all_limit); } } } // Compute the set of grandparent files that overlap this compaction // (parent == level+1; grandparent == level+2) if (level + 2 < config::kNumLevels) { current_->GetOverlappingInputs(level + 2, &all_start, &all_limit, &c->grandparents_); } if (false) { Log(options_->info_log, "Compacting %d '%s' .. '%s'", level, smallest.DebugString().c_str(), largest.DebugString().c_str()); } // Update the place where we will do the next compaction for this level. // We update this immediately instead of waiting for the VersionEdit // to be applied so that if the compaction fails, we will try a different // key range next time. compact_pointer_[level] = largest.Encode().ToString(); c->edit_.SetCompactPointer(level, largest); } Compaction* VersionSet::CompactRange( int level, const InternalKey* begin, const InternalKey* end) { std::vector inputs; current_->GetOverlappingInputs(level, begin, end, &inputs); if (inputs.empty()) { return NULL; } // Avoid compacting too much in one shot in case the range is large. // But we cannot do this for level-0 since level-0 files can overlap // and we must not pick one file and drop another older file if the // two files overlap. if (level > 0) { const uint64_t limit = MaxFileSizeForLevel(level); uint64_t total = 0; for (size_t i = 0; i < inputs.size(); i++) { uint64_t s = inputs[i]->file_size; total += s; if (total >= limit) { inputs.resize(i + 1); break; } } } Compaction* c = new Compaction(level); c->input_version_ = current_; c->input_version_->Ref(); c->inputs_[0] = inputs; SetupOtherInputs(c); return c; } Compaction::Compaction(int level) : level_(level), max_output_file_size_(MaxFileSizeForLevel(level)), input_version_(NULL), grandparent_index_(0), seen_key_(false), overlapped_bytes_(0) { for (int i = 0; i < config::kNumLevels; i++) { level_ptrs_[i] = 0; } } Compaction::~Compaction() { if (input_version_ != NULL) { input_version_->Unref(); } } bool Compaction::IsTrivialMove() const { // Avoid a move if there is lots of overlapping grandparent data. // Otherwise, the move could create a parent file that will require // a very expensive merge later on. return (num_input_files(0) == 1 && num_input_files(1) == 0 && TotalFileSize(grandparents_) <= kMaxGrandParentOverlapBytes); } void Compaction::AddInputDeletions(VersionEdit* edit) { for (int which = 0; which < 2; which++) { for (size_t i = 0; i < inputs_[which].size(); i++) { edit->DeleteFile(level_ + which, inputs_[which][i]->number); } } } bool Compaction::IsBaseLevelForKey(const Slice& user_key) { // Maybe use binary search to find right entry instead of linear search? const Comparator* user_cmp = input_version_->vset_->icmp_.user_comparator(); for (int lvl = level_ + 2; lvl < config::kNumLevels; lvl++) { const std::vector& files = input_version_->files_[lvl]; for (; level_ptrs_[lvl] < files.size(); ) { FileMetaData* f = files[level_ptrs_[lvl]]; if (user_cmp->Compare(user_key, f->largest.user_key()) <= 0) { // We've advanced far enough if (user_cmp->Compare(user_key, f->smallest.user_key()) >= 0) { // Key falls in this file's range, so definitely not base level return false; } break; } level_ptrs_[lvl]++; } } return true; } bool Compaction::ShouldStopBefore(const Slice& internal_key) { // Scan to find earliest grandparent file that contains key. const InternalKeyComparator* icmp = &input_version_->vset_->icmp_; while (grandparent_index_ < grandparents_.size() && icmp->Compare(internal_key, grandparents_[grandparent_index_]->largest.Encode()) > 0) { if (seen_key_) { overlapped_bytes_ += grandparents_[grandparent_index_]->file_size; } grandparent_index_++; } seen_key_ = true; if (overlapped_bytes_ > kMaxGrandParentOverlapBytes) { // Too much overlap for current output; start new output overlapped_bytes_ = 0; return true; } else { return false; } } void Compaction::ReleaseInputs() { if (input_version_ != NULL) { input_version_->Unref(); input_version_ = NULL; } } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/log_reader.cc0000644000000000000000000001745512414772654020343 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/log_reader.h" #include #include "leveldb/env.h" #include "util/coding.h" #include "util/crc32c.h" namespace leveldb { namespace log { Reader::Reporter::~Reporter() { } Reader::Reader(SequentialFile* file, Reporter* reporter, bool checksum, uint64_t initial_offset) : file_(file), reporter_(reporter), checksum_(checksum), backing_store_(new char[kBlockSize]), buffer_(), eof_(false), last_record_offset_(0), end_of_buffer_offset_(0), initial_offset_(initial_offset) { } Reader::~Reader() { delete[] backing_store_; } bool Reader::SkipToInitialBlock() { size_t offset_in_block = initial_offset_ % kBlockSize; uint64_t block_start_location = initial_offset_ - offset_in_block; // Don't search a block if we'd be in the trailer if (offset_in_block > kBlockSize - 6) { offset_in_block = 0; block_start_location += kBlockSize; } end_of_buffer_offset_ = block_start_location; // Skip to start of first block that can contain the initial record if (block_start_location > 0) { Status skip_status = file_->Skip(block_start_location); if (!skip_status.ok()) { ReportDrop(block_start_location, skip_status); return false; } } return true; } bool Reader::ReadRecord(Slice* record, std::string* scratch) { if (last_record_offset_ < initial_offset_) { if (!SkipToInitialBlock()) { return false; } } scratch->clear(); record->clear(); bool in_fragmented_record = false; // Record offset of the logical record that we're reading // 0 is a dummy value to make compilers happy uint64_t prospective_record_offset = 0; Slice fragment; while (true) { uint64_t physical_record_offset = end_of_buffer_offset_ - buffer_.size(); const unsigned int record_type = ReadPhysicalRecord(&fragment); switch (record_type) { case kFullType: if (in_fragmented_record) { // Handle bug in earlier versions of log::Writer where // it could emit an empty kFirstType record at the tail end // of a block followed by a kFullType or kFirstType record // at the beginning of the next block. if (scratch->empty()) { in_fragmented_record = false; } else { ReportCorruption(scratch->size(), "partial record without end(1)"); } } prospective_record_offset = physical_record_offset; scratch->clear(); *record = fragment; last_record_offset_ = prospective_record_offset; return true; case kFirstType: if (in_fragmented_record) { // Handle bug in earlier versions of log::Writer where // it could emit an empty kFirstType record at the tail end // of a block followed by a kFullType or kFirstType record // at the beginning of the next block. if (scratch->empty()) { in_fragmented_record = false; } else { ReportCorruption(scratch->size(), "partial record without end(2)"); } } prospective_record_offset = physical_record_offset; scratch->assign(fragment.data(), fragment.size()); in_fragmented_record = true; break; case kMiddleType: if (!in_fragmented_record) { ReportCorruption(fragment.size(), "missing start of fragmented record(1)"); } else { scratch->append(fragment.data(), fragment.size()); } break; case kLastType: if (!in_fragmented_record) { ReportCorruption(fragment.size(), "missing start of fragmented record(2)"); } else { scratch->append(fragment.data(), fragment.size()); *record = Slice(*scratch); last_record_offset_ = prospective_record_offset; return true; } break; case kEof: if (in_fragmented_record) { ReportCorruption(scratch->size(), "partial record without end(3)"); scratch->clear(); } return false; case kBadRecord: if (in_fragmented_record) { ReportCorruption(scratch->size(), "error in middle of record"); in_fragmented_record = false; scratch->clear(); } break; default: { char buf[40]; snprintf(buf, sizeof(buf), "unknown record type %u", record_type); ReportCorruption( (fragment.size() + (in_fragmented_record ? scratch->size() : 0)), buf); in_fragmented_record = false; scratch->clear(); break; } } } return false; } uint64_t Reader::LastRecordOffset() { return last_record_offset_; } void Reader::ReportCorruption(size_t bytes, const char* reason) { ReportDrop(bytes, Status::Corruption(reason)); } void Reader::ReportDrop(size_t bytes, const Status& reason) { if (reporter_ != NULL && end_of_buffer_offset_ - buffer_.size() - bytes >= initial_offset_) { reporter_->Corruption(bytes, reason); } } unsigned int Reader::ReadPhysicalRecord(Slice* result) { while (true) { if (buffer_.size() < kHeaderSize) { if (!eof_) { // Last read was a full read, so this is a trailer to skip buffer_.clear(); Status status = file_->Read(kBlockSize, &buffer_, backing_store_); end_of_buffer_offset_ += buffer_.size(); if (!status.ok()) { buffer_.clear(); ReportDrop(kBlockSize, status); eof_ = true; return kEof; } else if (buffer_.size() < kBlockSize) { eof_ = true; } continue; } else if (buffer_.size() == 0) { // End of file return kEof; } else { size_t drop_size = buffer_.size(); buffer_.clear(); ReportCorruption(drop_size, "truncated record at end of file"); return kEof; } } // Parse the header const char* header = buffer_.data(); const uint32_t a = static_cast(header[4]) & 0xff; const uint32_t b = static_cast(header[5]) & 0xff; const unsigned int type = header[6]; const uint32_t length = a | (b << 8); if (kHeaderSize + length > buffer_.size()) { size_t drop_size = buffer_.size(); buffer_.clear(); ReportCorruption(drop_size, "bad record length"); return kBadRecord; } if (type == kZeroType && length == 0) { // Skip zero length record without reporting any drops since // such records are produced by the mmap based writing code in // env_posix.cc that preallocates file regions. buffer_.clear(); return kBadRecord; } // Check crc if (checksum_) { uint32_t expected_crc = crc32c::Unmask(DecodeFixed32(header)); uint32_t actual_crc = crc32c::Value(header + 6, 1 + length); if (actual_crc != expected_crc) { // Drop the rest of the buffer since "length" itself may have // been corrupted and if we trust it, we could find some // fragment of a real log record that just happens to look // like a valid log record. size_t drop_size = buffer_.size(); buffer_.clear(); ReportCorruption(drop_size, "checksum mismatch"); return kBadRecord; } } buffer_.remove_prefix(kHeaderSize + length); // Skip physical record that started before initial_offset_ if (end_of_buffer_offset_ - buffer_.size() - kHeaderSize - length < initial_offset_) { result->clear(); return kBadRecord; } *result = Slice(header + kHeaderSize, length); return type; } } } // namespace log } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/write_batch.cc0000644000000000000000000000766612414772654020536 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // WriteBatch::rep_ := // sequence: fixed64 // count: fixed32 // data: record[count] // record := // kTypeValue varstring varstring | // kTypeDeletion varstring // varstring := // len: varint32 // data: uint8[len] #include "leveldb/write_batch.h" #include "leveldb/db.h" #include "db/dbformat.h" #include "db/memtable.h" #include "db/write_batch_internal.h" #include "util/coding.h" namespace leveldb { // WriteBatch header has an 8-byte sequence number followed by a 4-byte count. static const size_t kHeader = 12; WriteBatch::WriteBatch() { Clear(); } WriteBatch::~WriteBatch() { } WriteBatch::Handler::~Handler() { } void WriteBatch::Clear() { rep_.clear(); rep_.resize(kHeader); } Status WriteBatch::Iterate(Handler* handler) const { Slice input(rep_); if (input.size() < kHeader) { return Status::Corruption("malformed WriteBatch (too small)"); } input.remove_prefix(kHeader); Slice key, value; int found = 0; while (!input.empty()) { found++; char tag = input[0]; input.remove_prefix(1); switch (tag) { case kTypeValue: if (GetLengthPrefixedSlice(&input, &key) && GetLengthPrefixedSlice(&input, &value)) { handler->Put(key, value); } else { return Status::Corruption("bad WriteBatch Put"); } break; case kTypeDeletion: if (GetLengthPrefixedSlice(&input, &key)) { handler->Delete(key); } else { return Status::Corruption("bad WriteBatch Delete"); } break; default: return Status::Corruption("unknown WriteBatch tag"); } } if (found != WriteBatchInternal::Count(this)) { return Status::Corruption("WriteBatch has wrong count"); } else { return Status::OK(); } } int WriteBatchInternal::Count(const WriteBatch* b) { return DecodeFixed32(b->rep_.data() + 8); } void WriteBatchInternal::SetCount(WriteBatch* b, int n) { EncodeFixed32(&b->rep_[8], n); } SequenceNumber WriteBatchInternal::Sequence(const WriteBatch* b) { return SequenceNumber(DecodeFixed64(b->rep_.data())); } void WriteBatchInternal::SetSequence(WriteBatch* b, SequenceNumber seq) { EncodeFixed64(&b->rep_[0], seq); } void WriteBatch::Put(const Slice& key, const Slice& value) { WriteBatchInternal::SetCount(this, WriteBatchInternal::Count(this) + 1); rep_.push_back(static_cast(kTypeValue)); PutLengthPrefixedSlice(&rep_, key); PutLengthPrefixedSlice(&rep_, value); } void WriteBatch::Delete(const Slice& key) { WriteBatchInternal::SetCount(this, WriteBatchInternal::Count(this) + 1); rep_.push_back(static_cast(kTypeDeletion)); PutLengthPrefixedSlice(&rep_, key); } namespace { class MemTableInserter : public WriteBatch::Handler { public: SequenceNumber sequence_; MemTable* mem_; virtual void Put(const Slice& key, const Slice& value) { mem_->Add(sequence_, kTypeValue, key, value); sequence_++; } virtual void Delete(const Slice& key) { mem_->Add(sequence_, kTypeDeletion, key, Slice()); sequence_++; } }; } // namespace Status WriteBatchInternal::InsertInto(const WriteBatch* b, MemTable* memtable) { MemTableInserter inserter; inserter.sequence_ = WriteBatchInternal::Sequence(b); inserter.mem_ = memtable; return b->Iterate(&inserter); } void WriteBatchInternal::SetContents(WriteBatch* b, const Slice& contents) { assert(contents.size() >= kHeader); b->rep_.assign(contents.data(), contents.size()); } void WriteBatchInternal::Append(WriteBatch* dst, const WriteBatch* src) { SetCount(dst, Count(dst) + Count(src)); assert(src->rep_.size() >= kHeader); dst->rep_.append(src->rep_.data() + kHeader, src->rep_.size() - kHeader); } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/repair.cc0000644000000000000000000003270212414772654017512 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // We recover the contents of the descriptor from the other files we find. // (1) Any log files are first converted to tables // (2) We scan every table to compute // (a) smallest/largest for the table // (b) largest sequence number in the table // (3) We generate descriptor contents: // - log number is set to zero // - next-file-number is set to 1 + largest file number we found // - last-sequence-number is set to largest sequence# found across // all tables (see 2c) // - compaction pointers are cleared // - every table file is added at level 0 // // Possible optimization 1: // (a) Compute total size and use to pick appropriate max-level M // (b) Sort tables by largest sequence# in the table // (c) For each table: if it overlaps earlier table, place in level-0, // else place in level-M. // Possible optimization 2: // Store per-table metadata (smallest, largest, largest-seq#, ...) // in the table's meta section to speed up ScanTable. #include "db/builder.h" #include "db/db_impl.h" #include "db/dbformat.h" #include "db/filename.h" #include "db/log_reader.h" #include "db/log_writer.h" #include "db/memtable.h" #include "db/table_cache.h" #include "db/version_edit.h" #include "db/write_batch_internal.h" #include "leveldb/comparator.h" #include "leveldb/db.h" #include "leveldb/env.h" namespace leveldb { namespace { class Repairer { public: Repairer(const std::string& dbname, const Options& options) : dbname_(dbname), env_(options.env), icmp_(options.comparator), ipolicy_(options.filter_policy), options_(SanitizeOptions(dbname, &icmp_, &ipolicy_, options)), owns_info_log_(options_.info_log != options.info_log), owns_cache_(options_.block_cache != options.block_cache), next_file_number_(1) { // TableCache can be small since we expect each table to be opened once. table_cache_ = new TableCache(dbname_, &options_, 10); } ~Repairer() { delete table_cache_; if (owns_info_log_) { delete options_.info_log; } if (owns_cache_) { delete options_.block_cache; } } Status Run() { Status status = FindFiles(); if (status.ok()) { ConvertLogFilesToTables(); ExtractMetaData(); status = WriteDescriptor(); } if (status.ok()) { unsigned long long bytes = 0; for (size_t i = 0; i < tables_.size(); i++) { bytes += tables_[i].meta.file_size; } Log(options_.info_log, "**** Repaired leveldb %s; " "recovered %d files; %llu bytes. " "Some data may have been lost. " "****", dbname_.c_str(), static_cast(tables_.size()), bytes); } return status; } private: struct TableInfo { FileMetaData meta; SequenceNumber max_sequence; }; std::string const dbname_; Env* const env_; InternalKeyComparator const icmp_; InternalFilterPolicy const ipolicy_; Options const options_; bool owns_info_log_; bool owns_cache_; TableCache* table_cache_; VersionEdit edit_; std::vector manifests_; std::vector table_numbers_; std::vector logs_; std::vector tables_; uint64_t next_file_number_; Status FindFiles() { std::vector filenames; Status status = env_->GetChildren(dbname_, &filenames); if (!status.ok()) { return status; } if (filenames.empty()) { return Status::IOError(dbname_, "repair found no files"); } uint64_t number; FileType type; for (size_t i = 0; i < filenames.size(); i++) { if (ParseFileName(filenames[i], &number, &type)) { if (type == kDescriptorFile) { manifests_.push_back(filenames[i]); } else { if (number + 1 > next_file_number_) { next_file_number_ = number + 1; } if (type == kLogFile) { logs_.push_back(number); } else if (type == kTableFile) { table_numbers_.push_back(number); } else { // Ignore other files } } } } return status; } void ConvertLogFilesToTables() { for (size_t i = 0; i < logs_.size(); i++) { std::string logname = LogFileName(dbname_, logs_[i]); Status status = ConvertLogToTable(logs_[i]); if (!status.ok()) { Log(options_.info_log, "Log #%llu: ignoring conversion error: %s", (unsigned long long) logs_[i], status.ToString().c_str()); } ArchiveFile(logname); } } Status ConvertLogToTable(uint64_t log) { struct LogReporter : public log::Reader::Reporter { Env* env; Logger* info_log; uint64_t lognum; virtual void Corruption(size_t bytes, const Status& s) { // We print error messages for corruption, but continue repairing. Log(info_log, "Log #%llu: dropping %d bytes; %s", (unsigned long long) lognum, static_cast(bytes), s.ToString().c_str()); } }; // Open the log file std::string logname = LogFileName(dbname_, log); SequentialFile* lfile; Status status = env_->NewSequentialFile(logname, &lfile); if (!status.ok()) { return status; } // Create the log reader. LogReporter reporter; reporter.env = env_; reporter.info_log = options_.info_log; reporter.lognum = log; // We intentially make log::Reader do checksumming so that // corruptions cause entire commits to be skipped instead of // propagating bad information (like overly large sequence // numbers). log::Reader reader(lfile, &reporter, false/*do not checksum*/, 0/*initial_offset*/); // Read all the records and add to a memtable std::string scratch; Slice record; WriteBatch batch; MemTable* mem = new MemTable(icmp_); mem->Ref(); int counter = 0; while (reader.ReadRecord(&record, &scratch)) { if (record.size() < 12) { reporter.Corruption( record.size(), Status::Corruption("log record too small")); continue; } WriteBatchInternal::SetContents(&batch, record); status = WriteBatchInternal::InsertInto(&batch, mem); if (status.ok()) { counter += WriteBatchInternal::Count(&batch); } else { Log(options_.info_log, "Log #%llu: ignoring %s", (unsigned long long) log, status.ToString().c_str()); status = Status::OK(); // Keep going with rest of file } } delete lfile; // Do not record a version edit for this conversion to a Table // since ExtractMetaData() will also generate edits. FileMetaData meta; meta.number = next_file_number_++; Iterator* iter = mem->NewIterator(); status = BuildTable(dbname_, env_, options_, table_cache_, iter, &meta); delete iter; mem->Unref(); mem = NULL; if (status.ok()) { if (meta.file_size > 0) { table_numbers_.push_back(meta.number); } } Log(options_.info_log, "Log #%llu: %d ops saved to Table #%llu %s", (unsigned long long) log, counter, (unsigned long long) meta.number, status.ToString().c_str()); return status; } void ExtractMetaData() { std::vector kept; for (size_t i = 0; i < table_numbers_.size(); i++) { ScanTable(table_numbers_[i]); } } Iterator* NewTableIterator(const FileMetaData& meta) { // Same as compaction iterators: if paranoid_checks are on, turn // on checksum verification. ReadOptions r; r.verify_checksums = options_.paranoid_checks; return table_cache_->NewIterator(r, meta.number, meta.file_size); } void ScanTable(uint64_t number) { TableInfo t; t.meta.number = number; std::string fname = TableFileName(dbname_, number); Status status = env_->GetFileSize(fname, &t.meta.file_size); if (!status.ok()) { // Try alternate file name. fname = SSTTableFileName(dbname_, number); Status s2 = env_->GetFileSize(fname, &t.meta.file_size); if (s2.ok()) { status = Status::OK(); } } if (!status.ok()) { ArchiveFile(TableFileName(dbname_, number)); ArchiveFile(SSTTableFileName(dbname_, number)); Log(options_.info_log, "Table #%llu: dropped: %s", (unsigned long long) t.meta.number, status.ToString().c_str()); return; } // Extract metadata by scanning through table. int counter = 0; Iterator* iter = NewTableIterator(t.meta); bool empty = true; ParsedInternalKey parsed; t.max_sequence = 0; for (iter->SeekToFirst(); iter->Valid(); iter->Next()) { Slice key = iter->key(); if (!ParseInternalKey(key, &parsed)) { Log(options_.info_log, "Table #%llu: unparsable key %s", (unsigned long long) t.meta.number, EscapeString(key).c_str()); continue; } counter++; if (empty) { empty = false; t.meta.smallest.DecodeFrom(key); } t.meta.largest.DecodeFrom(key); if (parsed.sequence > t.max_sequence) { t.max_sequence = parsed.sequence; } } if (!iter->status().ok()) { status = iter->status(); } delete iter; Log(options_.info_log, "Table #%llu: %d entries %s", (unsigned long long) t.meta.number, counter, status.ToString().c_str()); if (status.ok()) { tables_.push_back(t); } else { RepairTable(fname, t); // RepairTable archives input file. } } void RepairTable(const std::string& src, TableInfo t) { // We will copy src contents to a new table and then rename the // new table over the source. // Create builder. std::string copy = TableFileName(dbname_, next_file_number_++); WritableFile* file; Status s = env_->NewWritableFile(copy, &file); if (!s.ok()) { return; } TableBuilder* builder = new TableBuilder(options_, file); // Copy data. Iterator* iter = NewTableIterator(t.meta); int counter = 0; for (iter->SeekToFirst(); iter->Valid(); iter->Next()) { builder->Add(iter->key(), iter->value()); counter++; } delete iter; ArchiveFile(src); if (counter == 0) { builder->Abandon(); // Nothing to save } else { s = builder->Finish(); if (s.ok()) { t.meta.file_size = builder->FileSize(); } } delete builder; builder = NULL; if (s.ok()) { s = file->Close(); } delete file; file = NULL; if (counter > 0 && s.ok()) { std::string orig = TableFileName(dbname_, t.meta.number); s = env_->RenameFile(copy, orig); if (s.ok()) { Log(options_.info_log, "Table #%llu: %d entries repaired", (unsigned long long) t.meta.number, counter); tables_.push_back(t); } } if (!s.ok()) { env_->DeleteFile(copy); } } Status WriteDescriptor() { std::string tmp = TempFileName(dbname_, 1); WritableFile* file; Status status = env_->NewWritableFile(tmp, &file); if (!status.ok()) { return status; } SequenceNumber max_sequence = 0; for (size_t i = 0; i < tables_.size(); i++) { if (max_sequence < tables_[i].max_sequence) { max_sequence = tables_[i].max_sequence; } } edit_.SetComparatorName(icmp_.user_comparator()->Name()); edit_.SetLogNumber(0); edit_.SetNextFile(next_file_number_); edit_.SetLastSequence(max_sequence); for (size_t i = 0; i < tables_.size(); i++) { // TODO(opt): separate out into multiple levels const TableInfo& t = tables_[i]; edit_.AddFile(0, t.meta.number, t.meta.file_size, t.meta.smallest, t.meta.largest); } //fprintf(stderr, "NewDescriptor:\n%s\n", edit_.DebugString().c_str()); { log::Writer log(file); std::string record; edit_.EncodeTo(&record); status = log.AddRecord(record); } if (status.ok()) { status = file->Close(); } delete file; file = NULL; if (!status.ok()) { env_->DeleteFile(tmp); } else { // Discard older manifests for (size_t i = 0; i < manifests_.size(); i++) { ArchiveFile(dbname_ + "/" + manifests_[i]); } // Install new manifest status = env_->RenameFile(tmp, DescriptorFileName(dbname_, 1)); if (status.ok()) { status = SetCurrentFile(env_, dbname_, 1); } else { env_->DeleteFile(tmp); } } return status; } void ArchiveFile(const std::string& fname) { // Move into another directory. E.g., for // dir/foo // rename to // dir/lost/foo const char* slash = strrchr(fname.c_str(), '/'); std::string new_dir; if (slash != NULL) { new_dir.assign(fname.data(), slash - fname.data()); } new_dir.append("/lost"); env_->CreateDir(new_dir); // Ignore error std::string new_file = new_dir; new_file.append("/"); new_file.append((slash == NULL) ? fname.c_str() : slash + 1); Status s = env_->RenameFile(fname, new_file); Log(options_.info_log, "Archiving %s: %s\n", fname.c_str(), s.ToString().c_str()); } }; } // namespace Status RepairDB(const std::string& dbname, const Options& options) { Repairer repairer(dbname, options); return repairer.Run(); } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/filename.cc0000644000000000000000000000777512414772654020024 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include #include #include "db/filename.h" #include "db/dbformat.h" #include "leveldb/env.h" #include "util/logging.h" namespace leveldb { // A utility routine: write "data" to the named file and Sync() it. extern Status WriteStringToFileSync(Env* env, const Slice& data, const std::string& fname); static std::string MakeFileName(const std::string& name, uint64_t number, const char* suffix) { char buf[100]; snprintf(buf, sizeof(buf), "/%06llu.%s", static_cast(number), suffix); return name + buf; } std::string LogFileName(const std::string& name, uint64_t number) { assert(number > 0); return MakeFileName(name, number, "log"); } std::string TableFileName(const std::string& name, uint64_t number) { assert(number > 0); return MakeFileName(name, number, "ldb"); } std::string SSTTableFileName(const std::string& name, uint64_t number) { assert(number > 0); return MakeFileName(name, number, "sst"); } std::string DescriptorFileName(const std::string& dbname, uint64_t number) { assert(number > 0); char buf[100]; snprintf(buf, sizeof(buf), "/MANIFEST-%06llu", static_cast(number)); return dbname + buf; } std::string CurrentFileName(const std::string& dbname) { return dbname + "/CURRENT"; } std::string LockFileName(const std::string& dbname) { return dbname + "/LOCK"; } std::string TempFileName(const std::string& dbname, uint64_t number) { assert(number > 0); return MakeFileName(dbname, number, "dbtmp"); } std::string InfoLogFileName(const std::string& dbname) { return dbname + "/LOG"; } // Return the name of the old info log file for "dbname". std::string OldInfoLogFileName(const std::string& dbname) { return dbname + "/LOG.old"; } // Owned filenames have the form: // dbname/CURRENT // dbname/LOCK // dbname/LOG // dbname/LOG.old // dbname/MANIFEST-[0-9]+ // dbname/[0-9]+.(log|sst|ldb) bool ParseFileName(const std::string& fname, uint64_t* number, FileType* type) { Slice rest(fname); if (rest == "CURRENT") { *number = 0; *type = kCurrentFile; } else if (rest == "LOCK") { *number = 0; *type = kDBLockFile; } else if (rest == "LOG" || rest == "LOG.old") { *number = 0; *type = kInfoLogFile; } else if (rest.starts_with("MANIFEST-")) { rest.remove_prefix(strlen("MANIFEST-")); uint64_t num; if (!ConsumeDecimalNumber(&rest, &num)) { return false; } if (!rest.empty()) { return false; } *type = kDescriptorFile; *number = num; } else { // Avoid strtoull() to keep filename format independent of the // current locale uint64_t num; if (!ConsumeDecimalNumber(&rest, &num)) { return false; } Slice suffix = rest; if (suffix == Slice(".log")) { *type = kLogFile; } else if (suffix == Slice(".sst") || suffix == Slice(".ldb")) { *type = kTableFile; } else if (suffix == Slice(".dbtmp")) { *type = kTempFile; } else { return false; } *number = num; } return true; } Status SetCurrentFile(Env* env, const std::string& dbname, uint64_t descriptor_number) { // Remove leading "dbname/" and add newline to manifest file name std::string manifest = DescriptorFileName(dbname, descriptor_number); Slice contents = manifest; assert(contents.starts_with(dbname + "/")); contents.remove_prefix(dbname.size() + 1); std::string tmp = TempFileName(dbname, descriptor_number); Status s = WriteStringToFileSync(env, contents.ToString() + "\n", tmp); if (s.ok()) { s = env->RenameFile(tmp, CurrentFileName(dbname)); } if (!s.ok()) { env->DeleteFile(tmp); } return s; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/filename_test.cc0000644000000000000000000000653712414772654021056 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/filename.h" #include "db/dbformat.h" #include "port/port.h" #include "util/logging.h" #include "util/testharness.h" namespace leveldb { class FileNameTest { }; TEST(FileNameTest, Parse) { Slice db; FileType type; uint64_t number; // Successful parses static struct { const char* fname; uint64_t number; FileType type; } cases[] = { { "100.log", 100, kLogFile }, { "0.log", 0, kLogFile }, { "0.sst", 0, kTableFile }, { "0.ldb", 0, kTableFile }, { "CURRENT", 0, kCurrentFile }, { "LOCK", 0, kDBLockFile }, { "MANIFEST-2", 2, kDescriptorFile }, { "MANIFEST-7", 7, kDescriptorFile }, { "LOG", 0, kInfoLogFile }, { "LOG.old", 0, kInfoLogFile }, { "18446744073709551615.log", 18446744073709551615ull, kLogFile }, }; for (int i = 0; i < sizeof(cases) / sizeof(cases[0]); i++) { std::string f = cases[i].fname; ASSERT_TRUE(ParseFileName(f, &number, &type)) << f; ASSERT_EQ(cases[i].type, type) << f; ASSERT_EQ(cases[i].number, number) << f; } // Errors static const char* errors[] = { "", "foo", "foo-dx-100.log", ".log", "", "manifest", "CURREN", "CURRENTX", "MANIFES", "MANIFEST", "MANIFEST-", "XMANIFEST-3", "MANIFEST-3x", "LOC", "LOCKx", "LO", "LOGx", "18446744073709551616.log", "184467440737095516150.log", "100", "100.", "100.lop" }; for (int i = 0; i < sizeof(errors) / sizeof(errors[0]); i++) { std::string f = errors[i]; ASSERT_TRUE(!ParseFileName(f, &number, &type)) << f; } } TEST(FileNameTest, Construction) { uint64_t number; FileType type; std::string fname; fname = CurrentFileName("foo"); ASSERT_EQ("foo/", std::string(fname.data(), 4)); ASSERT_TRUE(ParseFileName(fname.c_str() + 4, &number, &type)); ASSERT_EQ(0, number); ASSERT_EQ(kCurrentFile, type); fname = LockFileName("foo"); ASSERT_EQ("foo/", std::string(fname.data(), 4)); ASSERT_TRUE(ParseFileName(fname.c_str() + 4, &number, &type)); ASSERT_EQ(0, number); ASSERT_EQ(kDBLockFile, type); fname = LogFileName("foo", 192); ASSERT_EQ("foo/", std::string(fname.data(), 4)); ASSERT_TRUE(ParseFileName(fname.c_str() + 4, &number, &type)); ASSERT_EQ(192, number); ASSERT_EQ(kLogFile, type); fname = TableFileName("bar", 200); ASSERT_EQ("bar/", std::string(fname.data(), 4)); ASSERT_TRUE(ParseFileName(fname.c_str() + 4, &number, &type)); ASSERT_EQ(200, number); ASSERT_EQ(kTableFile, type); fname = DescriptorFileName("bar", 100); ASSERT_EQ("bar/", std::string(fname.data(), 4)); ASSERT_TRUE(ParseFileName(fname.c_str() + 4, &number, &type)); ASSERT_EQ(100, number); ASSERT_EQ(kDescriptorFile, type); fname = TempFileName("tmp", 999); ASSERT_EQ("tmp/", std::string(fname.data(), 4)); ASSERT_TRUE(ParseFileName(fname.c_str() + 4, &number, &type)); ASSERT_EQ(999, number); ASSERT_EQ(kTempFile, type); } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/db/db_test.cc0000644000000000000000000017176712414772654017673 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/db.h" #include "leveldb/filter_policy.h" #include "db/db_impl.h" #include "db/filename.h" #include "db/version_set.h" #include "db/write_batch_internal.h" #include "leveldb/cache.h" #include "leveldb/env.h" #include "leveldb/table.h" #include "util/hash.h" #include "util/logging.h" #include "util/mutexlock.h" #include "util/testharness.h" #include "util/testutil.h" namespace leveldb { static std::string RandomString(Random* rnd, int len) { std::string r; test::RandomString(rnd, len, &r); return r; } namespace { class AtomicCounter { private: port::Mutex mu_; int count_; public: AtomicCounter() : count_(0) { } void Increment() { IncrementBy(1); } void IncrementBy(int count) { MutexLock l(&mu_); count_ += count; } int Read() { MutexLock l(&mu_); return count_; } void Reset() { MutexLock l(&mu_); count_ = 0; } }; void DelayMilliseconds(int millis) { Env::Default()->SleepForMicroseconds(millis * 1000); } } // Special Env used to delay background operations class SpecialEnv : public EnvWrapper { public: // sstable/log Sync() calls are blocked while this pointer is non-NULL. port::AtomicPointer delay_data_sync_; // sstable/log Sync() calls return an error. port::AtomicPointer data_sync_error_; // Simulate no-space errors while this pointer is non-NULL. port::AtomicPointer no_space_; // Simulate non-writable file system while this pointer is non-NULL port::AtomicPointer non_writable_; // Force sync of manifest files to fail while this pointer is non-NULL port::AtomicPointer manifest_sync_error_; // Force write to manifest files to fail while this pointer is non-NULL port::AtomicPointer manifest_write_error_; bool count_random_reads_; AtomicCounter random_read_counter_; explicit SpecialEnv(Env* base) : EnvWrapper(base) { delay_data_sync_.Release_Store(NULL); data_sync_error_.Release_Store(NULL); no_space_.Release_Store(NULL); non_writable_.Release_Store(NULL); count_random_reads_ = false; manifest_sync_error_.Release_Store(NULL); manifest_write_error_.Release_Store(NULL); } Status NewWritableFile(const std::string& f, WritableFile** r) { class DataFile : public WritableFile { private: SpecialEnv* env_; WritableFile* base_; public: DataFile(SpecialEnv* env, WritableFile* base) : env_(env), base_(base) { } ~DataFile() { delete base_; } Status Append(const Slice& data) { if (env_->no_space_.Acquire_Load() != NULL) { // Drop writes on the floor return Status::OK(); } else { return base_->Append(data); } } Status Close() { return base_->Close(); } Status Flush() { return base_->Flush(); } Status Sync() { if (env_->data_sync_error_.Acquire_Load() != NULL) { return Status::IOError("simulated data sync error"); } while (env_->delay_data_sync_.Acquire_Load() != NULL) { DelayMilliseconds(100); } return base_->Sync(); } }; class ManifestFile : public WritableFile { private: SpecialEnv* env_; WritableFile* base_; public: ManifestFile(SpecialEnv* env, WritableFile* b) : env_(env), base_(b) { } ~ManifestFile() { delete base_; } Status Append(const Slice& data) { if (env_->manifest_write_error_.Acquire_Load() != NULL) { return Status::IOError("simulated writer error"); } else { return base_->Append(data); } } Status Close() { return base_->Close(); } Status Flush() { return base_->Flush(); } Status Sync() { if (env_->manifest_sync_error_.Acquire_Load() != NULL) { return Status::IOError("simulated sync error"); } else { return base_->Sync(); } } }; if (non_writable_.Acquire_Load() != NULL) { return Status::IOError("simulated write error"); } Status s = target()->NewWritableFile(f, r); if (s.ok()) { if (strstr(f.c_str(), ".ldb") != NULL || strstr(f.c_str(), ".log") != NULL) { *r = new DataFile(this, *r); } else if (strstr(f.c_str(), "MANIFEST") != NULL) { *r = new ManifestFile(this, *r); } } return s; } Status NewRandomAccessFile(const std::string& f, RandomAccessFile** r) { class CountingFile : public RandomAccessFile { private: RandomAccessFile* target_; AtomicCounter* counter_; public: CountingFile(RandomAccessFile* target, AtomicCounter* counter) : target_(target), counter_(counter) { } virtual ~CountingFile() { delete target_; } virtual Status Read(uint64_t offset, size_t n, Slice* result, char* scratch) const { counter_->Increment(); return target_->Read(offset, n, result, scratch); } }; Status s = target()->NewRandomAccessFile(f, r); if (s.ok() && count_random_reads_) { *r = new CountingFile(*r, &random_read_counter_); } return s; } }; class DBTest { private: const FilterPolicy* filter_policy_; // Sequence of option configurations to try enum OptionConfig { kDefault, kFilter, kUncompressed, kEnd }; int option_config_; public: std::string dbname_; SpecialEnv* env_; DB* db_; Options last_options_; DBTest() : option_config_(kDefault), env_(new SpecialEnv(Env::Default())) { filter_policy_ = NewBloomFilterPolicy(10); dbname_ = test::TmpDir() + "/db_test"; DestroyDB(dbname_, Options()); db_ = NULL; Reopen(); } ~DBTest() { delete db_; DestroyDB(dbname_, Options()); delete env_; delete filter_policy_; } // Switch to a fresh database with the next option configuration to // test. Return false if there are no more configurations to test. bool ChangeOptions() { option_config_++; if (option_config_ >= kEnd) { return false; } else { DestroyAndReopen(); return true; } } // Return the current option configuration. Options CurrentOptions() { Options options; switch (option_config_) { case kFilter: options.filter_policy = filter_policy_; break; case kUncompressed: options.compression = kNoCompression; break; default: break; } return options; } DBImpl* dbfull() { return reinterpret_cast(db_); } void Reopen(Options* options = NULL) { ASSERT_OK(TryReopen(options)); } void Close() { delete db_; db_ = NULL; } void DestroyAndReopen(Options* options = NULL) { delete db_; db_ = NULL; DestroyDB(dbname_, Options()); ASSERT_OK(TryReopen(options)); } Status TryReopen(Options* options) { delete db_; db_ = NULL; Options opts; if (options != NULL) { opts = *options; } else { opts = CurrentOptions(); opts.create_if_missing = true; } last_options_ = opts; return DB::Open(opts, dbname_, &db_); } Status Put(const std::string& k, const std::string& v) { return db_->Put(WriteOptions(), k, v); } Status Delete(const std::string& k) { return db_->Delete(WriteOptions(), k); } std::string Get(const std::string& k, const Snapshot* snapshot = NULL) { ReadOptions options; options.snapshot = snapshot; std::string result; Status s = db_->Get(options, k, &result); if (s.IsNotFound()) { result = "NOT_FOUND"; } else if (!s.ok()) { result = s.ToString(); } return result; } // Return a string that contains all key,value pairs in order, // formatted like "(k1->v1)(k2->v2)". std::string Contents() { std::vector forward; std::string result; Iterator* iter = db_->NewIterator(ReadOptions()); for (iter->SeekToFirst(); iter->Valid(); iter->Next()) { std::string s = IterStatus(iter); result.push_back('('); result.append(s); result.push_back(')'); forward.push_back(s); } // Check reverse iteration results are the reverse of forward results size_t matched = 0; for (iter->SeekToLast(); iter->Valid(); iter->Prev()) { ASSERT_LT(matched, forward.size()); ASSERT_EQ(IterStatus(iter), forward[forward.size() - matched - 1]); matched++; } ASSERT_EQ(matched, forward.size()); delete iter; return result; } std::string AllEntriesFor(const Slice& user_key) { Iterator* iter = dbfull()->TEST_NewInternalIterator(); InternalKey target(user_key, kMaxSequenceNumber, kTypeValue); iter->Seek(target.Encode()); std::string result; if (!iter->status().ok()) { result = iter->status().ToString(); } else { result = "[ "; bool first = true; while (iter->Valid()) { ParsedInternalKey ikey; if (!ParseInternalKey(iter->key(), &ikey)) { result += "CORRUPTED"; } else { if (last_options_.comparator->Compare(ikey.user_key, user_key) != 0) { break; } if (!first) { result += ", "; } first = false; switch (ikey.type) { case kTypeValue: result += iter->value().ToString(); break; case kTypeDeletion: result += "DEL"; break; } } iter->Next(); } if (!first) { result += " "; } result += "]"; } delete iter; return result; } int NumTableFilesAtLevel(int level) { std::string property; ASSERT_TRUE( db_->GetProperty("leveldb.num-files-at-level" + NumberToString(level), &property)); return atoi(property.c_str()); } int TotalTableFiles() { int result = 0; for (int level = 0; level < config::kNumLevels; level++) { result += NumTableFilesAtLevel(level); } return result; } // Return spread of files per level std::string FilesPerLevel() { std::string result; int last_non_zero_offset = 0; for (int level = 0; level < config::kNumLevels; level++) { int f = NumTableFilesAtLevel(level); char buf[100]; snprintf(buf, sizeof(buf), "%s%d", (level ? "," : ""), f); result += buf; if (f > 0) { last_non_zero_offset = result.size(); } } result.resize(last_non_zero_offset); return result; } int CountFiles() { std::vector files; env_->GetChildren(dbname_, &files); return static_cast(files.size()); } uint64_t Size(const Slice& start, const Slice& limit) { Range r(start, limit); uint64_t size; db_->GetApproximateSizes(&r, 1, &size); return size; } void Compact(const Slice& start, const Slice& limit) { db_->CompactRange(&start, &limit); } // Do n memtable compactions, each of which produces an sstable // covering the range [small,large]. void MakeTables(int n, const std::string& small, const std::string& large) { for (int i = 0; i < n; i++) { Put(small, "begin"); Put(large, "end"); dbfull()->TEST_CompactMemTable(); } } // Prevent pushing of new sstables into deeper levels by adding // tables that cover a specified range to all levels. void FillLevels(const std::string& smallest, const std::string& largest) { MakeTables(config::kNumLevels, smallest, largest); } void DumpFileCounts(const char* label) { fprintf(stderr, "---\n%s:\n", label); fprintf(stderr, "maxoverlap: %lld\n", static_cast( dbfull()->TEST_MaxNextLevelOverlappingBytes())); for (int level = 0; level < config::kNumLevels; level++) { int num = NumTableFilesAtLevel(level); if (num > 0) { fprintf(stderr, " level %3d : %d files\n", level, num); } } } std::string DumpSSTableList() { std::string property; db_->GetProperty("leveldb.sstables", &property); return property; } std::string IterStatus(Iterator* iter) { std::string result; if (iter->Valid()) { result = iter->key().ToString() + "->" + iter->value().ToString(); } else { result = "(invalid)"; } return result; } bool DeleteAnSSTFile() { std::vector filenames; ASSERT_OK(env_->GetChildren(dbname_, &filenames)); uint64_t number; FileType type; for (size_t i = 0; i < filenames.size(); i++) { if (ParseFileName(filenames[i], &number, &type) && type == kTableFile) { ASSERT_OK(env_->DeleteFile(TableFileName(dbname_, number))); return true; } } return false; } // Returns number of files renamed. int RenameLDBToSST() { std::vector filenames; ASSERT_OK(env_->GetChildren(dbname_, &filenames)); uint64_t number; FileType type; int files_renamed = 0; for (size_t i = 0; i < filenames.size(); i++) { if (ParseFileName(filenames[i], &number, &type) && type == kTableFile) { const std::string from = TableFileName(dbname_, number); const std::string to = SSTTableFileName(dbname_, number); ASSERT_OK(env_->RenameFile(from, to)); files_renamed++; } } return files_renamed; } }; TEST(DBTest, Empty) { do { ASSERT_TRUE(db_ != NULL); ASSERT_EQ("NOT_FOUND", Get("foo")); } while (ChangeOptions()); } TEST(DBTest, ReadWrite) { do { ASSERT_OK(Put("foo", "v1")); ASSERT_EQ("v1", Get("foo")); ASSERT_OK(Put("bar", "v2")); ASSERT_OK(Put("foo", "v3")); ASSERT_EQ("v3", Get("foo")); ASSERT_EQ("v2", Get("bar")); } while (ChangeOptions()); } TEST(DBTest, PutDeleteGet) { do { ASSERT_OK(db_->Put(WriteOptions(), "foo", "v1")); ASSERT_EQ("v1", Get("foo")); ASSERT_OK(db_->Put(WriteOptions(), "foo", "v2")); ASSERT_EQ("v2", Get("foo")); ASSERT_OK(db_->Delete(WriteOptions(), "foo")); ASSERT_EQ("NOT_FOUND", Get("foo")); } while (ChangeOptions()); } TEST(DBTest, GetFromImmutableLayer) { do { Options options = CurrentOptions(); options.env = env_; options.write_buffer_size = 100000; // Small write buffer Reopen(&options); ASSERT_OK(Put("foo", "v1")); ASSERT_EQ("v1", Get("foo")); env_->delay_data_sync_.Release_Store(env_); // Block sync calls Put("k1", std::string(100000, 'x')); // Fill memtable Put("k2", std::string(100000, 'y')); // Trigger compaction ASSERT_EQ("v1", Get("foo")); env_->delay_data_sync_.Release_Store(NULL); // Release sync calls } while (ChangeOptions()); } TEST(DBTest, GetFromVersions) { do { ASSERT_OK(Put("foo", "v1")); dbfull()->TEST_CompactMemTable(); ASSERT_EQ("v1", Get("foo")); } while (ChangeOptions()); } TEST(DBTest, GetSnapshot) { do { // Try with both a short key and a long key for (int i = 0; i < 2; i++) { std::string key = (i == 0) ? std::string("foo") : std::string(200, 'x'); ASSERT_OK(Put(key, "v1")); const Snapshot* s1 = db_->GetSnapshot(); ASSERT_OK(Put(key, "v2")); ASSERT_EQ("v2", Get(key)); ASSERT_EQ("v1", Get(key, s1)); dbfull()->TEST_CompactMemTable(); ASSERT_EQ("v2", Get(key)); ASSERT_EQ("v1", Get(key, s1)); db_->ReleaseSnapshot(s1); } } while (ChangeOptions()); } TEST(DBTest, GetLevel0Ordering) { do { // Check that we process level-0 files in correct order. The code // below generates two level-0 files where the earlier one comes // before the later one in the level-0 file list since the earlier // one has a smaller "smallest" key. ASSERT_OK(Put("bar", "b")); ASSERT_OK(Put("foo", "v1")); dbfull()->TEST_CompactMemTable(); ASSERT_OK(Put("foo", "v2")); dbfull()->TEST_CompactMemTable(); ASSERT_EQ("v2", Get("foo")); } while (ChangeOptions()); } TEST(DBTest, GetOrderedByLevels) { do { ASSERT_OK(Put("foo", "v1")); Compact("a", "z"); ASSERT_EQ("v1", Get("foo")); ASSERT_OK(Put("foo", "v2")); ASSERT_EQ("v2", Get("foo")); dbfull()->TEST_CompactMemTable(); ASSERT_EQ("v2", Get("foo")); } while (ChangeOptions()); } TEST(DBTest, GetPicksCorrectFile) { do { // Arrange to have multiple files in a non-level-0 level. ASSERT_OK(Put("a", "va")); Compact("a", "b"); ASSERT_OK(Put("x", "vx")); Compact("x", "y"); ASSERT_OK(Put("f", "vf")); Compact("f", "g"); ASSERT_EQ("va", Get("a")); ASSERT_EQ("vf", Get("f")); ASSERT_EQ("vx", Get("x")); } while (ChangeOptions()); } TEST(DBTest, GetEncountersEmptyLevel) { do { // Arrange for the following to happen: // * sstable A in level 0 // * nothing in level 1 // * sstable B in level 2 // Then do enough Get() calls to arrange for an automatic compaction // of sstable A. A bug would cause the compaction to be marked as // occuring at level 1 (instead of the correct level 0). // Step 1: First place sstables in levels 0 and 2 int compaction_count = 0; while (NumTableFilesAtLevel(0) == 0 || NumTableFilesAtLevel(2) == 0) { ASSERT_LE(compaction_count, 100) << "could not fill levels 0 and 2"; compaction_count++; Put("a", "begin"); Put("z", "end"); dbfull()->TEST_CompactMemTable(); } // Step 2: clear level 1 if necessary. dbfull()->TEST_CompactRange(1, NULL, NULL); ASSERT_EQ(NumTableFilesAtLevel(0), 1); ASSERT_EQ(NumTableFilesAtLevel(1), 0); ASSERT_EQ(NumTableFilesAtLevel(2), 1); // Step 3: read a bunch of times for (int i = 0; i < 1000; i++) { ASSERT_EQ("NOT_FOUND", Get("missing")); } // Step 4: Wait for compaction to finish DelayMilliseconds(1000); ASSERT_EQ(NumTableFilesAtLevel(0), 0); } while (ChangeOptions()); } TEST(DBTest, IterEmpty) { Iterator* iter = db_->NewIterator(ReadOptions()); iter->SeekToFirst(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->SeekToLast(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->Seek("foo"); ASSERT_EQ(IterStatus(iter), "(invalid)"); delete iter; } TEST(DBTest, IterSingle) { ASSERT_OK(Put("a", "va")); Iterator* iter = db_->NewIterator(ReadOptions()); iter->SeekToFirst(); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Next(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->SeekToFirst(); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Prev(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->SeekToLast(); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Next(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->SeekToLast(); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Prev(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->Seek(""); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Next(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->Seek("a"); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Next(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->Seek("b"); ASSERT_EQ(IterStatus(iter), "(invalid)"); delete iter; } TEST(DBTest, IterMulti) { ASSERT_OK(Put("a", "va")); ASSERT_OK(Put("b", "vb")); ASSERT_OK(Put("c", "vc")); Iterator* iter = db_->NewIterator(ReadOptions()); iter->SeekToFirst(); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Next(); ASSERT_EQ(IterStatus(iter), "b->vb"); iter->Next(); ASSERT_EQ(IterStatus(iter), "c->vc"); iter->Next(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->SeekToFirst(); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Prev(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->SeekToLast(); ASSERT_EQ(IterStatus(iter), "c->vc"); iter->Prev(); ASSERT_EQ(IterStatus(iter), "b->vb"); iter->Prev(); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Prev(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->SeekToLast(); ASSERT_EQ(IterStatus(iter), "c->vc"); iter->Next(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->Seek(""); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Seek("a"); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Seek("ax"); ASSERT_EQ(IterStatus(iter), "b->vb"); iter->Seek("b"); ASSERT_EQ(IterStatus(iter), "b->vb"); iter->Seek("z"); ASSERT_EQ(IterStatus(iter), "(invalid)"); // Switch from reverse to forward iter->SeekToLast(); iter->Prev(); iter->Prev(); iter->Next(); ASSERT_EQ(IterStatus(iter), "b->vb"); // Switch from forward to reverse iter->SeekToFirst(); iter->Next(); iter->Next(); iter->Prev(); ASSERT_EQ(IterStatus(iter), "b->vb"); // Make sure iter stays at snapshot ASSERT_OK(Put("a", "va2")); ASSERT_OK(Put("a2", "va3")); ASSERT_OK(Put("b", "vb2")); ASSERT_OK(Put("c", "vc2")); ASSERT_OK(Delete("b")); iter->SeekToFirst(); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Next(); ASSERT_EQ(IterStatus(iter), "b->vb"); iter->Next(); ASSERT_EQ(IterStatus(iter), "c->vc"); iter->Next(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->SeekToLast(); ASSERT_EQ(IterStatus(iter), "c->vc"); iter->Prev(); ASSERT_EQ(IterStatus(iter), "b->vb"); iter->Prev(); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Prev(); ASSERT_EQ(IterStatus(iter), "(invalid)"); delete iter; } TEST(DBTest, IterSmallAndLargeMix) { ASSERT_OK(Put("a", "va")); ASSERT_OK(Put("b", std::string(100000, 'b'))); ASSERT_OK(Put("c", "vc")); ASSERT_OK(Put("d", std::string(100000, 'd'))); ASSERT_OK(Put("e", std::string(100000, 'e'))); Iterator* iter = db_->NewIterator(ReadOptions()); iter->SeekToFirst(); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Next(); ASSERT_EQ(IterStatus(iter), "b->" + std::string(100000, 'b')); iter->Next(); ASSERT_EQ(IterStatus(iter), "c->vc"); iter->Next(); ASSERT_EQ(IterStatus(iter), "d->" + std::string(100000, 'd')); iter->Next(); ASSERT_EQ(IterStatus(iter), "e->" + std::string(100000, 'e')); iter->Next(); ASSERT_EQ(IterStatus(iter), "(invalid)"); iter->SeekToLast(); ASSERT_EQ(IterStatus(iter), "e->" + std::string(100000, 'e')); iter->Prev(); ASSERT_EQ(IterStatus(iter), "d->" + std::string(100000, 'd')); iter->Prev(); ASSERT_EQ(IterStatus(iter), "c->vc"); iter->Prev(); ASSERT_EQ(IterStatus(iter), "b->" + std::string(100000, 'b')); iter->Prev(); ASSERT_EQ(IterStatus(iter), "a->va"); iter->Prev(); ASSERT_EQ(IterStatus(iter), "(invalid)"); delete iter; } TEST(DBTest, IterMultiWithDelete) { do { ASSERT_OK(Put("a", "va")); ASSERT_OK(Put("b", "vb")); ASSERT_OK(Put("c", "vc")); ASSERT_OK(Delete("b")); ASSERT_EQ("NOT_FOUND", Get("b")); Iterator* iter = db_->NewIterator(ReadOptions()); iter->Seek("c"); ASSERT_EQ(IterStatus(iter), "c->vc"); iter->Prev(); ASSERT_EQ(IterStatus(iter), "a->va"); delete iter; } while (ChangeOptions()); } TEST(DBTest, Recover) { do { ASSERT_OK(Put("foo", "v1")); ASSERT_OK(Put("baz", "v5")); Reopen(); ASSERT_EQ("v1", Get("foo")); ASSERT_EQ("v1", Get("foo")); ASSERT_EQ("v5", Get("baz")); ASSERT_OK(Put("bar", "v2")); ASSERT_OK(Put("foo", "v3")); Reopen(); ASSERT_EQ("v3", Get("foo")); ASSERT_OK(Put("foo", "v4")); ASSERT_EQ("v4", Get("foo")); ASSERT_EQ("v2", Get("bar")); ASSERT_EQ("v5", Get("baz")); } while (ChangeOptions()); } TEST(DBTest, RecoveryWithEmptyLog) { do { ASSERT_OK(Put("foo", "v1")); ASSERT_OK(Put("foo", "v2")); Reopen(); Reopen(); ASSERT_OK(Put("foo", "v3")); Reopen(); ASSERT_EQ("v3", Get("foo")); } while (ChangeOptions()); } // Check that writes done during a memtable compaction are recovered // if the database is shutdown during the memtable compaction. TEST(DBTest, RecoverDuringMemtableCompaction) { do { Options options = CurrentOptions(); options.env = env_; options.write_buffer_size = 1000000; Reopen(&options); // Trigger a long memtable compaction and reopen the database during it ASSERT_OK(Put("foo", "v1")); // Goes to 1st log file ASSERT_OK(Put("big1", std::string(10000000, 'x'))); // Fills memtable ASSERT_OK(Put("big2", std::string(1000, 'y'))); // Triggers compaction ASSERT_OK(Put("bar", "v2")); // Goes to new log file Reopen(&options); ASSERT_EQ("v1", Get("foo")); ASSERT_EQ("v2", Get("bar")); ASSERT_EQ(std::string(10000000, 'x'), Get("big1")); ASSERT_EQ(std::string(1000, 'y'), Get("big2")); } while (ChangeOptions()); } static std::string Key(int i) { char buf[100]; snprintf(buf, sizeof(buf), "key%06d", i); return std::string(buf); } TEST(DBTest, MinorCompactionsHappen) { Options options = CurrentOptions(); options.write_buffer_size = 10000; Reopen(&options); const int N = 500; int starting_num_tables = TotalTableFiles(); for (int i = 0; i < N; i++) { ASSERT_OK(Put(Key(i), Key(i) + std::string(1000, 'v'))); } int ending_num_tables = TotalTableFiles(); ASSERT_GT(ending_num_tables, starting_num_tables); for (int i = 0; i < N; i++) { ASSERT_EQ(Key(i) + std::string(1000, 'v'), Get(Key(i))); } Reopen(); for (int i = 0; i < N; i++) { ASSERT_EQ(Key(i) + std::string(1000, 'v'), Get(Key(i))); } } TEST(DBTest, RecoverWithLargeLog) { { Options options = CurrentOptions(); Reopen(&options); ASSERT_OK(Put("big1", std::string(200000, '1'))); ASSERT_OK(Put("big2", std::string(200000, '2'))); ASSERT_OK(Put("small3", std::string(10, '3'))); ASSERT_OK(Put("small4", std::string(10, '4'))); ASSERT_EQ(NumTableFilesAtLevel(0), 0); } // Make sure that if we re-open with a small write buffer size that // we flush table files in the middle of a large log file. Options options = CurrentOptions(); options.write_buffer_size = 100000; Reopen(&options); ASSERT_EQ(NumTableFilesAtLevel(0), 3); ASSERT_EQ(std::string(200000, '1'), Get("big1")); ASSERT_EQ(std::string(200000, '2'), Get("big2")); ASSERT_EQ(std::string(10, '3'), Get("small3")); ASSERT_EQ(std::string(10, '4'), Get("small4")); ASSERT_GT(NumTableFilesAtLevel(0), 1); } TEST(DBTest, CompactionsGenerateMultipleFiles) { Options options = CurrentOptions(); options.write_buffer_size = 100000000; // Large write buffer Reopen(&options); Random rnd(301); // Write 8MB (80 values, each 100K) ASSERT_EQ(NumTableFilesAtLevel(0), 0); std::vector values; for (int i = 0; i < 80; i++) { values.push_back(RandomString(&rnd, 100000)); ASSERT_OK(Put(Key(i), values[i])); } // Reopening moves updates to level-0 Reopen(&options); dbfull()->TEST_CompactRange(0, NULL, NULL); ASSERT_EQ(NumTableFilesAtLevel(0), 0); ASSERT_GT(NumTableFilesAtLevel(1), 1); for (int i = 0; i < 80; i++) { ASSERT_EQ(Get(Key(i)), values[i]); } } TEST(DBTest, RepeatedWritesToSameKey) { Options options = CurrentOptions(); options.env = env_; options.write_buffer_size = 100000; // Small write buffer Reopen(&options); // We must have at most one file per level except for level-0, // which may have up to kL0_StopWritesTrigger files. const int kMaxFiles = config::kNumLevels + config::kL0_StopWritesTrigger; Random rnd(301); std::string value = RandomString(&rnd, 2 * options.write_buffer_size); for (int i = 0; i < 5 * kMaxFiles; i++) { Put("key", value); ASSERT_LE(TotalTableFiles(), kMaxFiles); fprintf(stderr, "after %d: %d files\n", int(i+1), TotalTableFiles()); } } TEST(DBTest, SparseMerge) { Options options = CurrentOptions(); options.compression = kNoCompression; Reopen(&options); FillLevels("A", "Z"); // Suppose there is: // small amount of data with prefix A // large amount of data with prefix B // small amount of data with prefix C // and that recent updates have made small changes to all three prefixes. // Check that we do not do a compaction that merges all of B in one shot. const std::string value(1000, 'x'); Put("A", "va"); // Write approximately 100MB of "B" values for (int i = 0; i < 100000; i++) { char key[100]; snprintf(key, sizeof(key), "B%010d", i); Put(key, value); } Put("C", "vc"); dbfull()->TEST_CompactMemTable(); dbfull()->TEST_CompactRange(0, NULL, NULL); // Make sparse update Put("A", "va2"); Put("B100", "bvalue2"); Put("C", "vc2"); dbfull()->TEST_CompactMemTable(); // Compactions should not cause us to create a situation where // a file overlaps too much data at the next level. ASSERT_LE(dbfull()->TEST_MaxNextLevelOverlappingBytes(), 20*1048576); dbfull()->TEST_CompactRange(0, NULL, NULL); ASSERT_LE(dbfull()->TEST_MaxNextLevelOverlappingBytes(), 20*1048576); dbfull()->TEST_CompactRange(1, NULL, NULL); ASSERT_LE(dbfull()->TEST_MaxNextLevelOverlappingBytes(), 20*1048576); } static bool Between(uint64_t val, uint64_t low, uint64_t high) { bool result = (val >= low) && (val <= high); if (!result) { fprintf(stderr, "Value %llu is not in range [%llu, %llu]\n", (unsigned long long)(val), (unsigned long long)(low), (unsigned long long)(high)); } return result; } TEST(DBTest, ApproximateSizes) { do { Options options = CurrentOptions(); options.write_buffer_size = 100000000; // Large write buffer options.compression = kNoCompression; DestroyAndReopen(); ASSERT_TRUE(Between(Size("", "xyz"), 0, 0)); Reopen(&options); ASSERT_TRUE(Between(Size("", "xyz"), 0, 0)); // Write 8MB (80 values, each 100K) ASSERT_EQ(NumTableFilesAtLevel(0), 0); const int N = 80; static const int S1 = 100000; static const int S2 = 105000; // Allow some expansion from metadata Random rnd(301); for (int i = 0; i < N; i++) { ASSERT_OK(Put(Key(i), RandomString(&rnd, S1))); } // 0 because GetApproximateSizes() does not account for memtable space ASSERT_TRUE(Between(Size("", Key(50)), 0, 0)); // Check sizes across recovery by reopening a few times for (int run = 0; run < 3; run++) { Reopen(&options); for (int compact_start = 0; compact_start < N; compact_start += 10) { for (int i = 0; i < N; i += 10) { ASSERT_TRUE(Between(Size("", Key(i)), S1*i, S2*i)); ASSERT_TRUE(Between(Size("", Key(i)+".suffix"), S1*(i+1), S2*(i+1))); ASSERT_TRUE(Between(Size(Key(i), Key(i+10)), S1*10, S2*10)); } ASSERT_TRUE(Between(Size("", Key(50)), S1*50, S2*50)); ASSERT_TRUE(Between(Size("", Key(50)+".suffix"), S1*50, S2*50)); std::string cstart_str = Key(compact_start); std::string cend_str = Key(compact_start + 9); Slice cstart = cstart_str; Slice cend = cend_str; dbfull()->TEST_CompactRange(0, &cstart, &cend); } ASSERT_EQ(NumTableFilesAtLevel(0), 0); ASSERT_GT(NumTableFilesAtLevel(1), 0); } } while (ChangeOptions()); } TEST(DBTest, ApproximateSizes_MixOfSmallAndLarge) { do { Options options = CurrentOptions(); options.compression = kNoCompression; Reopen(); Random rnd(301); std::string big1 = RandomString(&rnd, 100000); ASSERT_OK(Put(Key(0), RandomString(&rnd, 10000))); ASSERT_OK(Put(Key(1), RandomString(&rnd, 10000))); ASSERT_OK(Put(Key(2), big1)); ASSERT_OK(Put(Key(3), RandomString(&rnd, 10000))); ASSERT_OK(Put(Key(4), big1)); ASSERT_OK(Put(Key(5), RandomString(&rnd, 10000))); ASSERT_OK(Put(Key(6), RandomString(&rnd, 300000))); ASSERT_OK(Put(Key(7), RandomString(&rnd, 10000))); // Check sizes across recovery by reopening a few times for (int run = 0; run < 3; run++) { Reopen(&options); ASSERT_TRUE(Between(Size("", Key(0)), 0, 0)); ASSERT_TRUE(Between(Size("", Key(1)), 10000, 11000)); ASSERT_TRUE(Between(Size("", Key(2)), 20000, 21000)); ASSERT_TRUE(Between(Size("", Key(3)), 120000, 121000)); ASSERT_TRUE(Between(Size("", Key(4)), 130000, 131000)); ASSERT_TRUE(Between(Size("", Key(5)), 230000, 231000)); ASSERT_TRUE(Between(Size("", Key(6)), 240000, 241000)); ASSERT_TRUE(Between(Size("", Key(7)), 540000, 541000)); ASSERT_TRUE(Between(Size("", Key(8)), 550000, 560000)); ASSERT_TRUE(Between(Size(Key(3), Key(5)), 110000, 111000)); dbfull()->TEST_CompactRange(0, NULL, NULL); } } while (ChangeOptions()); } TEST(DBTest, IteratorPinsRef) { Put("foo", "hello"); // Get iterator that will yield the current contents of the DB. Iterator* iter = db_->NewIterator(ReadOptions()); // Write to force compactions Put("foo", "newvalue1"); for (int i = 0; i < 100; i++) { ASSERT_OK(Put(Key(i), Key(i) + std::string(100000, 'v'))); // 100K values } Put("foo", "newvalue2"); iter->SeekToFirst(); ASSERT_TRUE(iter->Valid()); ASSERT_EQ("foo", iter->key().ToString()); ASSERT_EQ("hello", iter->value().ToString()); iter->Next(); ASSERT_TRUE(!iter->Valid()); delete iter; } TEST(DBTest, Snapshot) { do { Put("foo", "v1"); const Snapshot* s1 = db_->GetSnapshot(); Put("foo", "v2"); const Snapshot* s2 = db_->GetSnapshot(); Put("foo", "v3"); const Snapshot* s3 = db_->GetSnapshot(); Put("foo", "v4"); ASSERT_EQ("v1", Get("foo", s1)); ASSERT_EQ("v2", Get("foo", s2)); ASSERT_EQ("v3", Get("foo", s3)); ASSERT_EQ("v4", Get("foo")); db_->ReleaseSnapshot(s3); ASSERT_EQ("v1", Get("foo", s1)); ASSERT_EQ("v2", Get("foo", s2)); ASSERT_EQ("v4", Get("foo")); db_->ReleaseSnapshot(s1); ASSERT_EQ("v2", Get("foo", s2)); ASSERT_EQ("v4", Get("foo")); db_->ReleaseSnapshot(s2); ASSERT_EQ("v4", Get("foo")); } while (ChangeOptions()); } TEST(DBTest, HiddenValuesAreRemoved) { do { Random rnd(301); FillLevels("a", "z"); std::string big = RandomString(&rnd, 50000); Put("foo", big); Put("pastfoo", "v"); const Snapshot* snapshot = db_->GetSnapshot(); Put("foo", "tiny"); Put("pastfoo2", "v2"); // Advance sequence number one more ASSERT_OK(dbfull()->TEST_CompactMemTable()); ASSERT_GT(NumTableFilesAtLevel(0), 0); ASSERT_EQ(big, Get("foo", snapshot)); ASSERT_TRUE(Between(Size("", "pastfoo"), 50000, 60000)); db_->ReleaseSnapshot(snapshot); ASSERT_EQ(AllEntriesFor("foo"), "[ tiny, " + big + " ]"); Slice x("x"); dbfull()->TEST_CompactRange(0, NULL, &x); ASSERT_EQ(AllEntriesFor("foo"), "[ tiny ]"); ASSERT_EQ(NumTableFilesAtLevel(0), 0); ASSERT_GE(NumTableFilesAtLevel(1), 1); dbfull()->TEST_CompactRange(1, NULL, &x); ASSERT_EQ(AllEntriesFor("foo"), "[ tiny ]"); ASSERT_TRUE(Between(Size("", "pastfoo"), 0, 1000)); } while (ChangeOptions()); } TEST(DBTest, DeletionMarkers1) { Put("foo", "v1"); ASSERT_OK(dbfull()->TEST_CompactMemTable()); const int last = config::kMaxMemCompactLevel; ASSERT_EQ(NumTableFilesAtLevel(last), 1); // foo => v1 is now in last level // Place a table at level last-1 to prevent merging with preceding mutation Put("a", "begin"); Put("z", "end"); dbfull()->TEST_CompactMemTable(); ASSERT_EQ(NumTableFilesAtLevel(last), 1); ASSERT_EQ(NumTableFilesAtLevel(last-1), 1); Delete("foo"); Put("foo", "v2"); ASSERT_EQ(AllEntriesFor("foo"), "[ v2, DEL, v1 ]"); ASSERT_OK(dbfull()->TEST_CompactMemTable()); // Moves to level last-2 ASSERT_EQ(AllEntriesFor("foo"), "[ v2, DEL, v1 ]"); Slice z("z"); dbfull()->TEST_CompactRange(last-2, NULL, &z); // DEL eliminated, but v1 remains because we aren't compacting that level // (DEL can be eliminated because v2 hides v1). ASSERT_EQ(AllEntriesFor("foo"), "[ v2, v1 ]"); dbfull()->TEST_CompactRange(last-1, NULL, NULL); // Merging last-1 w/ last, so we are the base level for "foo", so // DEL is removed. (as is v1). ASSERT_EQ(AllEntriesFor("foo"), "[ v2 ]"); } TEST(DBTest, DeletionMarkers2) { Put("foo", "v1"); ASSERT_OK(dbfull()->TEST_CompactMemTable()); const int last = config::kMaxMemCompactLevel; ASSERT_EQ(NumTableFilesAtLevel(last), 1); // foo => v1 is now in last level // Place a table at level last-1 to prevent merging with preceding mutation Put("a", "begin"); Put("z", "end"); dbfull()->TEST_CompactMemTable(); ASSERT_EQ(NumTableFilesAtLevel(last), 1); ASSERT_EQ(NumTableFilesAtLevel(last-1), 1); Delete("foo"); ASSERT_EQ(AllEntriesFor("foo"), "[ DEL, v1 ]"); ASSERT_OK(dbfull()->TEST_CompactMemTable()); // Moves to level last-2 ASSERT_EQ(AllEntriesFor("foo"), "[ DEL, v1 ]"); dbfull()->TEST_CompactRange(last-2, NULL, NULL); // DEL kept: "last" file overlaps ASSERT_EQ(AllEntriesFor("foo"), "[ DEL, v1 ]"); dbfull()->TEST_CompactRange(last-1, NULL, NULL); // Merging last-1 w/ last, so we are the base level for "foo", so // DEL is removed. (as is v1). ASSERT_EQ(AllEntriesFor("foo"), "[ ]"); } TEST(DBTest, OverlapInLevel0) { do { ASSERT_EQ(config::kMaxMemCompactLevel, 2) << "Fix test to match config"; // Fill levels 1 and 2 to disable the pushing of new memtables to levels > 0. ASSERT_OK(Put("100", "v100")); ASSERT_OK(Put("999", "v999")); dbfull()->TEST_CompactMemTable(); ASSERT_OK(Delete("100")); ASSERT_OK(Delete("999")); dbfull()->TEST_CompactMemTable(); ASSERT_EQ("0,1,1", FilesPerLevel()); // Make files spanning the following ranges in level-0: // files[0] 200 .. 900 // files[1] 300 .. 500 // Note that files are sorted by smallest key. ASSERT_OK(Put("300", "v300")); ASSERT_OK(Put("500", "v500")); dbfull()->TEST_CompactMemTable(); ASSERT_OK(Put("200", "v200")); ASSERT_OK(Put("600", "v600")); ASSERT_OK(Put("900", "v900")); dbfull()->TEST_CompactMemTable(); ASSERT_EQ("2,1,1", FilesPerLevel()); // Compact away the placeholder files we created initially dbfull()->TEST_CompactRange(1, NULL, NULL); dbfull()->TEST_CompactRange(2, NULL, NULL); ASSERT_EQ("2", FilesPerLevel()); // Do a memtable compaction. Before bug-fix, the compaction would // not detect the overlap with level-0 files and would incorrectly place // the deletion in a deeper level. ASSERT_OK(Delete("600")); dbfull()->TEST_CompactMemTable(); ASSERT_EQ("3", FilesPerLevel()); ASSERT_EQ("NOT_FOUND", Get("600")); } while (ChangeOptions()); } TEST(DBTest, L0_CompactionBug_Issue44_a) { Reopen(); ASSERT_OK(Put("b", "v")); Reopen(); ASSERT_OK(Delete("b")); ASSERT_OK(Delete("a")); Reopen(); ASSERT_OK(Delete("a")); Reopen(); ASSERT_OK(Put("a", "v")); Reopen(); Reopen(); ASSERT_EQ("(a->v)", Contents()); DelayMilliseconds(1000); // Wait for compaction to finish ASSERT_EQ("(a->v)", Contents()); } TEST(DBTest, L0_CompactionBug_Issue44_b) { Reopen(); Put("",""); Reopen(); Delete("e"); Put("",""); Reopen(); Put("c", "cv"); Reopen(); Put("",""); Reopen(); Put("",""); DelayMilliseconds(1000); // Wait for compaction to finish Reopen(); Put("d","dv"); Reopen(); Put("",""); Reopen(); Delete("d"); Delete("b"); Reopen(); ASSERT_EQ("(->)(c->cv)", Contents()); DelayMilliseconds(1000); // Wait for compaction to finish ASSERT_EQ("(->)(c->cv)", Contents()); } TEST(DBTest, ComparatorCheck) { class NewComparator : public Comparator { public: virtual const char* Name() const { return "leveldb.NewComparator"; } virtual int Compare(const Slice& a, const Slice& b) const { return BytewiseComparator()->Compare(a, b); } virtual void FindShortestSeparator(std::string* s, const Slice& l) const { BytewiseComparator()->FindShortestSeparator(s, l); } virtual void FindShortSuccessor(std::string* key) const { BytewiseComparator()->FindShortSuccessor(key); } }; NewComparator cmp; Options new_options = CurrentOptions(); new_options.comparator = &cmp; Status s = TryReopen(&new_options); ASSERT_TRUE(!s.ok()); ASSERT_TRUE(s.ToString().find("comparator") != std::string::npos) << s.ToString(); } TEST(DBTest, CustomComparator) { class NumberComparator : public Comparator { public: virtual const char* Name() const { return "test.NumberComparator"; } virtual int Compare(const Slice& a, const Slice& b) const { return ToNumber(a) - ToNumber(b); } virtual void FindShortestSeparator(std::string* s, const Slice& l) const { ToNumber(*s); // Check format ToNumber(l); // Check format } virtual void FindShortSuccessor(std::string* key) const { ToNumber(*key); // Check format } private: static int ToNumber(const Slice& x) { // Check that there are no extra characters. ASSERT_TRUE(x.size() >= 2 && x[0] == '[' && x[x.size()-1] == ']') << EscapeString(x); int val; char ignored; ASSERT_TRUE(sscanf(x.ToString().c_str(), "[%i]%c", &val, &ignored) == 1) << EscapeString(x); return val; } }; NumberComparator cmp; Options new_options = CurrentOptions(); new_options.create_if_missing = true; new_options.comparator = &cmp; new_options.filter_policy = NULL; // Cannot use bloom filters new_options.write_buffer_size = 1000; // Compact more often DestroyAndReopen(&new_options); ASSERT_OK(Put("[10]", "ten")); ASSERT_OK(Put("[0x14]", "twenty")); for (int i = 0; i < 2; i++) { ASSERT_EQ("ten", Get("[10]")); ASSERT_EQ("ten", Get("[0xa]")); ASSERT_EQ("twenty", Get("[20]")); ASSERT_EQ("twenty", Get("[0x14]")); ASSERT_EQ("NOT_FOUND", Get("[15]")); ASSERT_EQ("NOT_FOUND", Get("[0xf]")); Compact("[0]", "[9999]"); } for (int run = 0; run < 2; run++) { for (int i = 0; i < 1000; i++) { char buf[100]; snprintf(buf, sizeof(buf), "[%d]", i*10); ASSERT_OK(Put(buf, buf)); } Compact("[0]", "[1000000]"); } } TEST(DBTest, ManualCompaction) { ASSERT_EQ(config::kMaxMemCompactLevel, 2) << "Need to update this test to match kMaxMemCompactLevel"; MakeTables(3, "p", "q"); ASSERT_EQ("1,1,1", FilesPerLevel()); // Compaction range falls before files Compact("", "c"); ASSERT_EQ("1,1,1", FilesPerLevel()); // Compaction range falls after files Compact("r", "z"); ASSERT_EQ("1,1,1", FilesPerLevel()); // Compaction range overlaps files Compact("p1", "p9"); ASSERT_EQ("0,0,1", FilesPerLevel()); // Populate a different range MakeTables(3, "c", "e"); ASSERT_EQ("1,1,2", FilesPerLevel()); // Compact just the new range Compact("b", "f"); ASSERT_EQ("0,0,2", FilesPerLevel()); // Compact all MakeTables(1, "a", "z"); ASSERT_EQ("0,1,2", FilesPerLevel()); db_->CompactRange(NULL, NULL); ASSERT_EQ("0,0,1", FilesPerLevel()); } TEST(DBTest, DBOpen_Options) { std::string dbname = test::TmpDir() + "/db_options_test"; DestroyDB(dbname, Options()); // Does not exist, and create_if_missing == false: error DB* db = NULL; Options opts; opts.create_if_missing = false; Status s = DB::Open(opts, dbname, &db); ASSERT_TRUE(strstr(s.ToString().c_str(), "does not exist") != NULL); ASSERT_TRUE(db == NULL); // Does not exist, and create_if_missing == true: OK opts.create_if_missing = true; s = DB::Open(opts, dbname, &db); ASSERT_OK(s); ASSERT_TRUE(db != NULL); delete db; db = NULL; // Does exist, and error_if_exists == true: error opts.create_if_missing = false; opts.error_if_exists = true; s = DB::Open(opts, dbname, &db); ASSERT_TRUE(strstr(s.ToString().c_str(), "exists") != NULL); ASSERT_TRUE(db == NULL); // Does exist, and error_if_exists == false: OK opts.create_if_missing = true; opts.error_if_exists = false; s = DB::Open(opts, dbname, &db); ASSERT_OK(s); ASSERT_TRUE(db != NULL); delete db; db = NULL; } TEST(DBTest, Locking) { DB* db2 = NULL; Status s = DB::Open(CurrentOptions(), dbname_, &db2); ASSERT_TRUE(!s.ok()) << "Locking did not prevent re-opening db"; } // Check that number of files does not grow when we are out of space TEST(DBTest, NoSpace) { Options options = CurrentOptions(); options.env = env_; Reopen(&options); ASSERT_OK(Put("foo", "v1")); ASSERT_EQ("v1", Get("foo")); Compact("a", "z"); const int num_files = CountFiles(); env_->no_space_.Release_Store(env_); // Force out-of-space errors for (int i = 0; i < 10; i++) { for (int level = 0; level < config::kNumLevels-1; level++) { dbfull()->TEST_CompactRange(level, NULL, NULL); } } env_->no_space_.Release_Store(NULL); ASSERT_LT(CountFiles(), num_files + 3); } TEST(DBTest, NonWritableFileSystem) { Options options = CurrentOptions(); options.write_buffer_size = 1000; options.env = env_; Reopen(&options); ASSERT_OK(Put("foo", "v1")); env_->non_writable_.Release_Store(env_); // Force errors for new files std::string big(100000, 'x'); int errors = 0; for (int i = 0; i < 20; i++) { fprintf(stderr, "iter %d; errors %d\n", i, errors); if (!Put("foo", big).ok()) { errors++; DelayMilliseconds(100); } } ASSERT_GT(errors, 0); env_->non_writable_.Release_Store(NULL); } TEST(DBTest, WriteSyncError) { // Check that log sync errors cause the DB to disallow future writes. // (a) Cause log sync calls to fail Options options = CurrentOptions(); options.env = env_; Reopen(&options); env_->data_sync_error_.Release_Store(env_); // (b) Normal write should succeed WriteOptions w; ASSERT_OK(db_->Put(w, "k1", "v1")); ASSERT_EQ("v1", Get("k1")); // (c) Do a sync write; should fail w.sync = true; ASSERT_TRUE(!db_->Put(w, "k2", "v2").ok()); ASSERT_EQ("v1", Get("k1")); ASSERT_EQ("NOT_FOUND", Get("k2")); // (d) make sync behave normally env_->data_sync_error_.Release_Store(NULL); // (e) Do a non-sync write; should fail w.sync = false; ASSERT_TRUE(!db_->Put(w, "k3", "v3").ok()); ASSERT_EQ("v1", Get("k1")); ASSERT_EQ("NOT_FOUND", Get("k2")); ASSERT_EQ("NOT_FOUND", Get("k3")); } TEST(DBTest, ManifestWriteError) { // Test for the following problem: // (a) Compaction produces file F // (b) Log record containing F is written to MANIFEST file, but Sync() fails // (c) GC deletes F // (d) After reopening DB, reads fail since deleted F is named in log record // We iterate twice. In the second iteration, everything is the // same except the log record never makes it to the MANIFEST file. for (int iter = 0; iter < 2; iter++) { port::AtomicPointer* error_type = (iter == 0) ? &env_->manifest_sync_error_ : &env_->manifest_write_error_; // Insert foo=>bar mapping Options options = CurrentOptions(); options.env = env_; options.create_if_missing = true; options.error_if_exists = false; DestroyAndReopen(&options); ASSERT_OK(Put("foo", "bar")); ASSERT_EQ("bar", Get("foo")); // Memtable compaction (will succeed) dbfull()->TEST_CompactMemTable(); ASSERT_EQ("bar", Get("foo")); const int last = config::kMaxMemCompactLevel; ASSERT_EQ(NumTableFilesAtLevel(last), 1); // foo=>bar is now in last level // Merging compaction (will fail) error_type->Release_Store(env_); dbfull()->TEST_CompactRange(last, NULL, NULL); // Should fail ASSERT_EQ("bar", Get("foo")); // Recovery: should not lose data error_type->Release_Store(NULL); Reopen(&options); ASSERT_EQ("bar", Get("foo")); } } TEST(DBTest, MissingSSTFile) { ASSERT_OK(Put("foo", "bar")); ASSERT_EQ("bar", Get("foo")); // Dump the memtable to disk. dbfull()->TEST_CompactMemTable(); ASSERT_EQ("bar", Get("foo")); Close(); ASSERT_TRUE(DeleteAnSSTFile()); Options options = CurrentOptions(); options.paranoid_checks = true; Status s = TryReopen(&options); ASSERT_TRUE(!s.ok()); ASSERT_TRUE(s.ToString().find("issing") != std::string::npos) << s.ToString(); } TEST(DBTest, StillReadSST) { ASSERT_OK(Put("foo", "bar")); ASSERT_EQ("bar", Get("foo")); // Dump the memtable to disk. dbfull()->TEST_CompactMemTable(); ASSERT_EQ("bar", Get("foo")); Close(); ASSERT_GT(RenameLDBToSST(), 0); Options options = CurrentOptions(); options.paranoid_checks = true; Status s = TryReopen(&options); ASSERT_TRUE(s.ok()); ASSERT_EQ("bar", Get("foo")); } TEST(DBTest, FilesDeletedAfterCompaction) { ASSERT_OK(Put("foo", "v2")); Compact("a", "z"); const int num_files = CountFiles(); for (int i = 0; i < 10; i++) { ASSERT_OK(Put("foo", "v2")); Compact("a", "z"); } ASSERT_EQ(CountFiles(), num_files); } TEST(DBTest, BloomFilter) { env_->count_random_reads_ = true; Options options = CurrentOptions(); options.env = env_; options.block_cache = NewLRUCache(0); // Prevent cache hits options.filter_policy = NewBloomFilterPolicy(10); Reopen(&options); // Populate multiple layers const int N = 10000; for (int i = 0; i < N; i++) { ASSERT_OK(Put(Key(i), Key(i))); } Compact("a", "z"); for (int i = 0; i < N; i += 100) { ASSERT_OK(Put(Key(i), Key(i))); } dbfull()->TEST_CompactMemTable(); // Prevent auto compactions triggered by seeks env_->delay_data_sync_.Release_Store(env_); // Lookup present keys. Should rarely read from small sstable. env_->random_read_counter_.Reset(); for (int i = 0; i < N; i++) { ASSERT_EQ(Key(i), Get(Key(i))); } int reads = env_->random_read_counter_.Read(); fprintf(stderr, "%d present => %d reads\n", N, reads); ASSERT_GE(reads, N); ASSERT_LE(reads, N + 2*N/100); // Lookup present keys. Should rarely read from either sstable. env_->random_read_counter_.Reset(); for (int i = 0; i < N; i++) { ASSERT_EQ("NOT_FOUND", Get(Key(i) + ".missing")); } reads = env_->random_read_counter_.Read(); fprintf(stderr, "%d missing => %d reads\n", N, reads); ASSERT_LE(reads, 3*N/100); env_->delay_data_sync_.Release_Store(NULL); Close(); delete options.block_cache; delete options.filter_policy; } // Multi-threaded test: namespace { static const int kNumThreads = 4; static const int kTestSeconds = 10; static const int kNumKeys = 1000; struct MTState { DBTest* test; port::AtomicPointer stop; port::AtomicPointer counter[kNumThreads]; port::AtomicPointer thread_done[kNumThreads]; }; struct MTThread { MTState* state; int id; }; static void MTThreadBody(void* arg) { MTThread* t = reinterpret_cast(arg); int id = t->id; DB* db = t->state->test->db_; uintptr_t counter = 0; fprintf(stderr, "... starting thread %d\n", id); Random rnd(1000 + id); std::string value; char valbuf[1500]; while (t->state->stop.Acquire_Load() == NULL) { t->state->counter[id].Release_Store(reinterpret_cast(counter)); int key = rnd.Uniform(kNumKeys); char keybuf[20]; snprintf(keybuf, sizeof(keybuf), "%016d", key); if (rnd.OneIn(2)) { // Write values of the form . // We add some padding for force compactions. snprintf(valbuf, sizeof(valbuf), "%d.%d.%-1000d", key, id, static_cast(counter)); ASSERT_OK(db->Put(WriteOptions(), Slice(keybuf), Slice(valbuf))); } else { // Read a value and verify that it matches the pattern written above. Status s = db->Get(ReadOptions(), Slice(keybuf), &value); if (s.IsNotFound()) { // Key has not yet been written } else { // Check that the writer thread counter is >= the counter in the value ASSERT_OK(s); int k, w, c; ASSERT_EQ(3, sscanf(value.c_str(), "%d.%d.%d", &k, &w, &c)) << value; ASSERT_EQ(k, key); ASSERT_GE(w, 0); ASSERT_LT(w, kNumThreads); ASSERT_LE(static_cast(c), reinterpret_cast( t->state->counter[w].Acquire_Load())); } } counter++; } t->state->thread_done[id].Release_Store(t); fprintf(stderr, "... stopping thread %d after %d ops\n", id, int(counter)); } } // namespace TEST(DBTest, MultiThreaded) { do { // Initialize state MTState mt; mt.test = this; mt.stop.Release_Store(0); for (int id = 0; id < kNumThreads; id++) { mt.counter[id].Release_Store(0); mt.thread_done[id].Release_Store(0); } // Start threads MTThread thread[kNumThreads]; for (int id = 0; id < kNumThreads; id++) { thread[id].state = &mt; thread[id].id = id; env_->StartThread(MTThreadBody, &thread[id]); } // Let them run for a while DelayMilliseconds(kTestSeconds * 1000); // Stop the threads and wait for them to finish mt.stop.Release_Store(&mt); for (int id = 0; id < kNumThreads; id++) { while (mt.thread_done[id].Acquire_Load() == NULL) { DelayMilliseconds(100); } } } while (ChangeOptions()); } namespace { typedef std::map KVMap; } class ModelDB: public DB { public: class ModelSnapshot : public Snapshot { public: KVMap map_; }; explicit ModelDB(const Options& options): options_(options) { } ~ModelDB() { } virtual Status Put(const WriteOptions& o, const Slice& k, const Slice& v) { return DB::Put(o, k, v); } virtual Status Delete(const WriteOptions& o, const Slice& key) { return DB::Delete(o, key); } virtual Status Get(const ReadOptions& options, const Slice& key, std::string* value) { assert(false); // Not implemented return Status::NotFound(key); } virtual Iterator* NewIterator(const ReadOptions& options) { if (options.snapshot == NULL) { KVMap* saved = new KVMap; *saved = map_; return new ModelIter(saved, true); } else { const KVMap* snapshot_state = &(reinterpret_cast(options.snapshot)->map_); return new ModelIter(snapshot_state, false); } } virtual const Snapshot* GetSnapshot() { ModelSnapshot* snapshot = new ModelSnapshot; snapshot->map_ = map_; return snapshot; } virtual void ReleaseSnapshot(const Snapshot* snapshot) { delete reinterpret_cast(snapshot); } virtual Status Write(const WriteOptions& options, WriteBatch* batch) { class Handler : public WriteBatch::Handler { public: KVMap* map_; virtual void Put(const Slice& key, const Slice& value) { (*map_)[key.ToString()] = value.ToString(); } virtual void Delete(const Slice& key) { map_->erase(key.ToString()); } }; Handler handler; handler.map_ = &map_; return batch->Iterate(&handler); } virtual bool GetProperty(const Slice& property, std::string* value) { return false; } virtual void GetApproximateSizes(const Range* r, int n, uint64_t* sizes) { for (int i = 0; i < n; i++) { sizes[i] = 0; } } virtual void CompactRange(const Slice* start, const Slice* end) { } private: class ModelIter: public Iterator { public: ModelIter(const KVMap* map, bool owned) : map_(map), owned_(owned), iter_(map_->end()) { } ~ModelIter() { if (owned_) delete map_; } virtual bool Valid() const { return iter_ != map_->end(); } virtual void SeekToFirst() { iter_ = map_->begin(); } virtual void SeekToLast() { if (map_->empty()) { iter_ = map_->end(); } else { iter_ = map_->find(map_->rbegin()->first); } } virtual void Seek(const Slice& k) { iter_ = map_->lower_bound(k.ToString()); } virtual void Next() { ++iter_; } virtual void Prev() { --iter_; } virtual Slice key() const { return iter_->first; } virtual Slice value() const { return iter_->second; } virtual Status status() const { return Status::OK(); } private: const KVMap* const map_; const bool owned_; // Do we own map_ KVMap::const_iterator iter_; }; const Options options_; KVMap map_; }; static std::string RandomKey(Random* rnd) { int len = (rnd->OneIn(3) ? 1 // Short sometimes to encourage collisions : (rnd->OneIn(100) ? rnd->Skewed(10) : rnd->Uniform(10))); return test::RandomKey(rnd, len); } static bool CompareIterators(int step, DB* model, DB* db, const Snapshot* model_snap, const Snapshot* db_snap) { ReadOptions options; options.snapshot = model_snap; Iterator* miter = model->NewIterator(options); options.snapshot = db_snap; Iterator* dbiter = db->NewIterator(options); bool ok = true; int count = 0; for (miter->SeekToFirst(), dbiter->SeekToFirst(); ok && miter->Valid() && dbiter->Valid(); miter->Next(), dbiter->Next()) { count++; if (miter->key().compare(dbiter->key()) != 0) { fprintf(stderr, "step %d: Key mismatch: '%s' vs. '%s'\n", step, EscapeString(miter->key()).c_str(), EscapeString(dbiter->key()).c_str()); ok = false; break; } if (miter->value().compare(dbiter->value()) != 0) { fprintf(stderr, "step %d: Value mismatch for key '%s': '%s' vs. '%s'\n", step, EscapeString(miter->key()).c_str(), EscapeString(miter->value()).c_str(), EscapeString(miter->value()).c_str()); ok = false; } } if (ok) { if (miter->Valid() != dbiter->Valid()) { fprintf(stderr, "step %d: Mismatch at end of iterators: %d vs. %d\n", step, miter->Valid(), dbiter->Valid()); ok = false; } } fprintf(stderr, "%d entries compared: ok=%d\n", count, ok); delete miter; delete dbiter; return ok; } TEST(DBTest, Randomized) { Random rnd(test::RandomSeed()); do { ModelDB model(CurrentOptions()); const int N = 10000; const Snapshot* model_snap = NULL; const Snapshot* db_snap = NULL; std::string k, v; for (int step = 0; step < N; step++) { if (step % 100 == 0) { fprintf(stderr, "Step %d of %d\n", step, N); } // TODO(sanjay): Test Get() works int p = rnd.Uniform(100); if (p < 45) { // Put k = RandomKey(&rnd); v = RandomString(&rnd, rnd.OneIn(20) ? 100 + rnd.Uniform(100) : rnd.Uniform(8)); ASSERT_OK(model.Put(WriteOptions(), k, v)); ASSERT_OK(db_->Put(WriteOptions(), k, v)); } else if (p < 90) { // Delete k = RandomKey(&rnd); ASSERT_OK(model.Delete(WriteOptions(), k)); ASSERT_OK(db_->Delete(WriteOptions(), k)); } else { // Multi-element batch WriteBatch b; const int num = rnd.Uniform(8); for (int i = 0; i < num; i++) { if (i == 0 || !rnd.OneIn(10)) { k = RandomKey(&rnd); } else { // Periodically re-use the same key from the previous iter, so // we have multiple entries in the write batch for the same key } if (rnd.OneIn(2)) { v = RandomString(&rnd, rnd.Uniform(10)); b.Put(k, v); } else { b.Delete(k); } } ASSERT_OK(model.Write(WriteOptions(), &b)); ASSERT_OK(db_->Write(WriteOptions(), &b)); } if ((step % 100) == 0) { ASSERT_TRUE(CompareIterators(step, &model, db_, NULL, NULL)); ASSERT_TRUE(CompareIterators(step, &model, db_, model_snap, db_snap)); // Save a snapshot from each DB this time that we'll use next // time we compare things, to make sure the current state is // preserved with the snapshot if (model_snap != NULL) model.ReleaseSnapshot(model_snap); if (db_snap != NULL) db_->ReleaseSnapshot(db_snap); Reopen(); ASSERT_TRUE(CompareIterators(step, &model, db_, NULL, NULL)); model_snap = model.GetSnapshot(); db_snap = db_->GetSnapshot(); } } if (model_snap != NULL) model.ReleaseSnapshot(model_snap); if (db_snap != NULL) db_->ReleaseSnapshot(db_snap); } while (ChangeOptions()); } std::string MakeKey(unsigned int num) { char buf[30]; snprintf(buf, sizeof(buf), "%016u", num); return std::string(buf); } void BM_LogAndApply(int iters, int num_base_files) { std::string dbname = test::TmpDir() + "/leveldb_test_benchmark"; DestroyDB(dbname, Options()); DB* db = NULL; Options opts; opts.create_if_missing = true; Status s = DB::Open(opts, dbname, &db); ASSERT_OK(s); ASSERT_TRUE(db != NULL); delete db; db = NULL; Env* env = Env::Default(); port::Mutex mu; MutexLock l(&mu); InternalKeyComparator cmp(BytewiseComparator()); Options options; VersionSet vset(dbname, &options, NULL, &cmp); ASSERT_OK(vset.Recover()); VersionEdit vbase; uint64_t fnum = 1; for (int i = 0; i < num_base_files; i++) { InternalKey start(MakeKey(2*fnum), 1, kTypeValue); InternalKey limit(MakeKey(2*fnum+1), 1, kTypeDeletion); vbase.AddFile(2, fnum++, 1 /* file size */, start, limit); } ASSERT_OK(vset.LogAndApply(&vbase, &mu)); uint64_t start_micros = env->NowMicros(); for (int i = 0; i < iters; i++) { VersionEdit vedit; vedit.DeleteFile(2, fnum); InternalKey start(MakeKey(2*fnum), 1, kTypeValue); InternalKey limit(MakeKey(2*fnum+1), 1, kTypeDeletion); vedit.AddFile(2, fnum++, 1 /* file size */, start, limit); vset.LogAndApply(&vedit, &mu); } uint64_t stop_micros = env->NowMicros(); unsigned int us = stop_micros - start_micros; char buf[16]; snprintf(buf, sizeof(buf), "%d", num_base_files); fprintf(stderr, "BM_LogAndApply/%-6s %8d iters : %9u us (%7.0f us / iter)\n", buf, iters, us, ((float)us) / iters); } } // namespace leveldb int main(int argc, char** argv) { if (argc > 1 && std::string(argv[1]) == "--benchmark") { leveldb::BM_LogAndApply(1000, 1); leveldb::BM_LogAndApply(1000, 100); leveldb::BM_LogAndApply(1000, 10000); leveldb::BM_LogAndApply(100, 100000); return 0; } return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/db/version_edit.cc0000644000000000000000000001544212414772654020724 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "db/version_edit.h" #include "db/version_set.h" #include "util/coding.h" namespace leveldb { // Tag numbers for serialized VersionEdit. These numbers are written to // disk and should not be changed. enum Tag { kComparator = 1, kLogNumber = 2, kNextFileNumber = 3, kLastSequence = 4, kCompactPointer = 5, kDeletedFile = 6, kNewFile = 7, // 8 was used for large value refs kPrevLogNumber = 9 }; void VersionEdit::Clear() { comparator_.clear(); log_number_ = 0; prev_log_number_ = 0; last_sequence_ = 0; next_file_number_ = 0; has_comparator_ = false; has_log_number_ = false; has_prev_log_number_ = false; has_next_file_number_ = false; has_last_sequence_ = false; deleted_files_.clear(); new_files_.clear(); } void VersionEdit::EncodeTo(std::string* dst) const { if (has_comparator_) { PutVarint32(dst, kComparator); PutLengthPrefixedSlice(dst, comparator_); } if (has_log_number_) { PutVarint32(dst, kLogNumber); PutVarint64(dst, log_number_); } if (has_prev_log_number_) { PutVarint32(dst, kPrevLogNumber); PutVarint64(dst, prev_log_number_); } if (has_next_file_number_) { PutVarint32(dst, kNextFileNumber); PutVarint64(dst, next_file_number_); } if (has_last_sequence_) { PutVarint32(dst, kLastSequence); PutVarint64(dst, last_sequence_); } for (size_t i = 0; i < compact_pointers_.size(); i++) { PutVarint32(dst, kCompactPointer); PutVarint32(dst, compact_pointers_[i].first); // level PutLengthPrefixedSlice(dst, compact_pointers_[i].second.Encode()); } for (DeletedFileSet::const_iterator iter = deleted_files_.begin(); iter != deleted_files_.end(); ++iter) { PutVarint32(dst, kDeletedFile); PutVarint32(dst, iter->first); // level PutVarint64(dst, iter->second); // file number } for (size_t i = 0; i < new_files_.size(); i++) { const FileMetaData& f = new_files_[i].second; PutVarint32(dst, kNewFile); PutVarint32(dst, new_files_[i].first); // level PutVarint64(dst, f.number); PutVarint64(dst, f.file_size); PutLengthPrefixedSlice(dst, f.smallest.Encode()); PutLengthPrefixedSlice(dst, f.largest.Encode()); } } static bool GetInternalKey(Slice* input, InternalKey* dst) { Slice str; if (GetLengthPrefixedSlice(input, &str)) { dst->DecodeFrom(str); return true; } else { return false; } } static bool GetLevel(Slice* input, int* level) { uint32_t v; if (GetVarint32(input, &v) && v < config::kNumLevels) { *level = v; return true; } else { return false; } } Status VersionEdit::DecodeFrom(const Slice& src) { Clear(); Slice input = src; const char* msg = NULL; uint32_t tag; // Temporary storage for parsing int level; uint64_t number; FileMetaData f; Slice str; InternalKey key; while (msg == NULL && GetVarint32(&input, &tag)) { switch (tag) { case kComparator: if (GetLengthPrefixedSlice(&input, &str)) { comparator_ = str.ToString(); has_comparator_ = true; } else { msg = "comparator name"; } break; case kLogNumber: if (GetVarint64(&input, &log_number_)) { has_log_number_ = true; } else { msg = "log number"; } break; case kPrevLogNumber: if (GetVarint64(&input, &prev_log_number_)) { has_prev_log_number_ = true; } else { msg = "previous log number"; } break; case kNextFileNumber: if (GetVarint64(&input, &next_file_number_)) { has_next_file_number_ = true; } else { msg = "next file number"; } break; case kLastSequence: if (GetVarint64(&input, &last_sequence_)) { has_last_sequence_ = true; } else { msg = "last sequence number"; } break; case kCompactPointer: if (GetLevel(&input, &level) && GetInternalKey(&input, &key)) { compact_pointers_.push_back(std::make_pair(level, key)); } else { msg = "compaction pointer"; } break; case kDeletedFile: if (GetLevel(&input, &level) && GetVarint64(&input, &number)) { deleted_files_.insert(std::make_pair(level, number)); } else { msg = "deleted file"; } break; case kNewFile: if (GetLevel(&input, &level) && GetVarint64(&input, &f.number) && GetVarint64(&input, &f.file_size) && GetInternalKey(&input, &f.smallest) && GetInternalKey(&input, &f.largest)) { new_files_.push_back(std::make_pair(level, f)); } else { msg = "new-file entry"; } break; default: msg = "unknown tag"; break; } } if (msg == NULL && !input.empty()) { msg = "invalid tag"; } Status result; if (msg != NULL) { result = Status::Corruption("VersionEdit", msg); } return result; } std::string VersionEdit::DebugString() const { std::string r; r.append("VersionEdit {"); if (has_comparator_) { r.append("\n Comparator: "); r.append(comparator_); } if (has_log_number_) { r.append("\n LogNumber: "); AppendNumberTo(&r, log_number_); } if (has_prev_log_number_) { r.append("\n PrevLogNumber: "); AppendNumberTo(&r, prev_log_number_); } if (has_next_file_number_) { r.append("\n NextFile: "); AppendNumberTo(&r, next_file_number_); } if (has_last_sequence_) { r.append("\n LastSeq: "); AppendNumberTo(&r, last_sequence_); } for (size_t i = 0; i < compact_pointers_.size(); i++) { r.append("\n CompactPointer: "); AppendNumberTo(&r, compact_pointers_[i].first); r.append(" "); r.append(compact_pointers_[i].second.DebugString()); } for (DeletedFileSet::const_iterator iter = deleted_files_.begin(); iter != deleted_files_.end(); ++iter) { r.append("\n DeleteFile: "); AppendNumberTo(&r, iter->first); r.append(" "); AppendNumberTo(&r, iter->second); } for (size_t i = 0; i < new_files_.size(); i++) { const FileMetaData& f = new_files_[i].second; r.append("\n AddFile: "); AppendNumberTo(&r, new_files_[i].first); r.append(" "); AppendNumberTo(&r, f.number); r.append(" "); AppendNumberTo(&r, f.file_size); r.append(" "); r.append(f.smallest.DebugString()); r.append(" .. "); r.append(f.largest.DebugString()); } r.append("\n}\n"); return r; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/db/db_bench.cc0000644000000000000000000007057212414772654017763 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include #include #include #include "db/db_impl.h" #include "db/version_set.h" #include "leveldb/cache.h" #include "leveldb/db.h" #include "leveldb/env.h" #include "leveldb/write_batch.h" #include "port/port.h" #include "util/crc32c.h" #include "util/histogram.h" #include "util/mutexlock.h" #include "util/random.h" #include "util/testutil.h" // Comma-separated list of operations to run in the specified order // Actual benchmarks: // fillseq -- write N values in sequential key order in async mode // fillrandom -- write N values in random key order in async mode // overwrite -- overwrite N values in random key order in async mode // fillsync -- write N/100 values in random key order in sync mode // fill100K -- write N/1000 100K values in random order in async mode // deleteseq -- delete N keys in sequential order // deleterandom -- delete N keys in random order // readseq -- read N times sequentially // readreverse -- read N times in reverse order // readrandom -- read N times in random order // readmissing -- read N missing keys in random order // readhot -- read N times in random order from 1% section of DB // seekrandom -- N random seeks // crc32c -- repeated crc32c of 4K of data // acquireload -- load N*1000 times // Meta operations: // compact -- Compact the entire DB // stats -- Print DB stats // sstables -- Print sstable info // heapprofile -- Dump a heap profile (if supported by this port) static const char* FLAGS_benchmarks = "fillseq," "fillsync," "fillrandom," "overwrite," "readrandom," "readrandom," // Extra run to allow previous compactions to quiesce "readseq," "readreverse," "compact," "readrandom," "readseq," "readreverse," "fill100K," "crc32c," "snappycomp," "snappyuncomp," "acquireload," ; // Number of key/values to place in database static int FLAGS_num = 1000000; // Number of read operations to do. If negative, do FLAGS_num reads. static int FLAGS_reads = -1; // Number of concurrent threads to run. static int FLAGS_threads = 1; // Size of each value static int FLAGS_value_size = 100; // Arrange to generate values that shrink to this fraction of // their original size after compression static double FLAGS_compression_ratio = 0.5; // Print histogram of operation timings static bool FLAGS_histogram = false; // Number of bytes to buffer in memtable before compacting // (initialized to default value by "main") static int FLAGS_write_buffer_size = 0; // Number of bytes to use as a cache of uncompressed data. // Negative means use default settings. static int FLAGS_cache_size = -1; // Maximum number of files to keep open at the same time (use default if == 0) static int FLAGS_open_files = 0; // Bloom filter bits per key. // Negative means use default settings. static int FLAGS_bloom_bits = -1; // If true, do not destroy the existing database. If you set this // flag and also specify a benchmark that wants a fresh database, that // benchmark will fail. static bool FLAGS_use_existing_db = false; // Use the db with the following name. static const char* FLAGS_db = NULL; namespace leveldb { namespace { // Helper for quickly generating random data. class RandomGenerator { private: std::string data_; int pos_; public: RandomGenerator() { // We use a limited amount of data over and over again and ensure // that it is larger than the compression window (32KB), and also // large enough to serve all typical value sizes we want to write. Random rnd(301); std::string piece; while (data_.size() < 1048576) { // Add a short fragment that is as compressible as specified // by FLAGS_compression_ratio. test::CompressibleString(&rnd, FLAGS_compression_ratio, 100, &piece); data_.append(piece); } pos_ = 0; } Slice Generate(size_t len) { if (pos_ + len > data_.size()) { pos_ = 0; assert(len < data_.size()); } pos_ += len; return Slice(data_.data() + pos_ - len, len); } }; static Slice TrimSpace(Slice s) { size_t start = 0; while (start < s.size() && isspace(s[start])) { start++; } size_t limit = s.size(); while (limit > start && isspace(s[limit-1])) { limit--; } return Slice(s.data() + start, limit - start); } static void AppendWithSpace(std::string* str, Slice msg) { if (msg.empty()) return; if (!str->empty()) { str->push_back(' '); } str->append(msg.data(), msg.size()); } class Stats { private: double start_; double finish_; double seconds_; int done_; int next_report_; int64_t bytes_; double last_op_finish_; Histogram hist_; std::string message_; public: Stats() { Start(); } void Start() { next_report_ = 100; last_op_finish_ = start_; hist_.Clear(); done_ = 0; bytes_ = 0; seconds_ = 0; start_ = Env::Default()->NowMicros(); finish_ = start_; message_.clear(); } void Merge(const Stats& other) { hist_.Merge(other.hist_); done_ += other.done_; bytes_ += other.bytes_; seconds_ += other.seconds_; if (other.start_ < start_) start_ = other.start_; if (other.finish_ > finish_) finish_ = other.finish_; // Just keep the messages from one thread if (message_.empty()) message_ = other.message_; } void Stop() { finish_ = Env::Default()->NowMicros(); seconds_ = (finish_ - start_) * 1e-6; } void AddMessage(Slice msg) { AppendWithSpace(&message_, msg); } void FinishedSingleOp() { if (FLAGS_histogram) { double now = Env::Default()->NowMicros(); double micros = now - last_op_finish_; hist_.Add(micros); if (micros > 20000) { fprintf(stderr, "long op: %.1f micros%30s\r", micros, ""); fflush(stderr); } last_op_finish_ = now; } done_++; if (done_ >= next_report_) { if (next_report_ < 1000) next_report_ += 100; else if (next_report_ < 5000) next_report_ += 500; else if (next_report_ < 10000) next_report_ += 1000; else if (next_report_ < 50000) next_report_ += 5000; else if (next_report_ < 100000) next_report_ += 10000; else if (next_report_ < 500000) next_report_ += 50000; else next_report_ += 100000; fprintf(stderr, "... finished %d ops%30s\r", done_, ""); fflush(stderr); } } void AddBytes(int64_t n) { bytes_ += n; } void Report(const Slice& name) { // Pretend at least one op was done in case we are running a benchmark // that does not call FinishedSingleOp(). if (done_ < 1) done_ = 1; std::string extra; if (bytes_ > 0) { // Rate is computed on actual elapsed time, not the sum of per-thread // elapsed times. double elapsed = (finish_ - start_) * 1e-6; char rate[100]; snprintf(rate, sizeof(rate), "%6.1f MB/s", (bytes_ / 1048576.0) / elapsed); extra = rate; } AppendWithSpace(&extra, message_); fprintf(stdout, "%-12s : %11.3f micros/op;%s%s\n", name.ToString().c_str(), seconds_ * 1e6 / done_, (extra.empty() ? "" : " "), extra.c_str()); if (FLAGS_histogram) { fprintf(stdout, "Microseconds per op:\n%s\n", hist_.ToString().c_str()); } fflush(stdout); } }; // State shared by all concurrent executions of the same benchmark. struct SharedState { port::Mutex mu; port::CondVar cv; int total; // Each thread goes through the following states: // (1) initializing // (2) waiting for others to be initialized // (3) running // (4) done int num_initialized; int num_done; bool start; SharedState() : cv(&mu) { } }; // Per-thread state for concurrent executions of the same benchmark. struct ThreadState { int tid; // 0..n-1 when running in n threads Random rand; // Has different seeds for different threads Stats stats; SharedState* shared; ThreadState(int index) : tid(index), rand(1000 + index) { } }; } // namespace class Benchmark { private: Cache* cache_; const FilterPolicy* filter_policy_; DB* db_; int num_; int value_size_; int entries_per_batch_; WriteOptions write_options_; int reads_; int heap_counter_; void PrintHeader() { const int kKeySize = 16; PrintEnvironment(); fprintf(stdout, "Keys: %d bytes each\n", kKeySize); fprintf(stdout, "Values: %d bytes each (%d bytes after compression)\n", FLAGS_value_size, static_cast(FLAGS_value_size * FLAGS_compression_ratio + 0.5)); fprintf(stdout, "Entries: %d\n", num_); fprintf(stdout, "RawSize: %.1f MB (estimated)\n", ((static_cast(kKeySize + FLAGS_value_size) * num_) / 1048576.0)); fprintf(stdout, "FileSize: %.1f MB (estimated)\n", (((kKeySize + FLAGS_value_size * FLAGS_compression_ratio) * num_) / 1048576.0)); PrintWarnings(); fprintf(stdout, "------------------------------------------------\n"); } void PrintWarnings() { #if defined(__GNUC__) && !defined(__OPTIMIZE__) fprintf(stdout, "WARNING: Optimization is disabled: benchmarks unnecessarily slow\n" ); #endif #ifndef NDEBUG fprintf(stdout, "WARNING: Assertions are enabled; benchmarks unnecessarily slow\n"); #endif // See if snappy is working by attempting to compress a compressible string const char text[] = "yyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyy"; std::string compressed; if (!port::Snappy_Compress(text, sizeof(text), &compressed)) { fprintf(stdout, "WARNING: Snappy compression is not enabled\n"); } else if (compressed.size() >= sizeof(text)) { fprintf(stdout, "WARNING: Snappy compression is not effective\n"); } } void PrintEnvironment() { fprintf(stderr, "LevelDB: version %d.%d\n", kMajorVersion, kMinorVersion); #if defined(__linux) time_t now = time(NULL); fprintf(stderr, "Date: %s", ctime(&now)); // ctime() adds newline FILE* cpuinfo = fopen("/proc/cpuinfo", "r"); if (cpuinfo != NULL) { char line[1000]; int num_cpus = 0; std::string cpu_type; std::string cache_size; while (fgets(line, sizeof(line), cpuinfo) != NULL) { const char* sep = strchr(line, ':'); if (sep == NULL) { continue; } Slice key = TrimSpace(Slice(line, sep - 1 - line)); Slice val = TrimSpace(Slice(sep + 1)); if (key == "model name") { ++num_cpus; cpu_type = val.ToString(); } else if (key == "cache size") { cache_size = val.ToString(); } } fclose(cpuinfo); fprintf(stderr, "CPU: %d * %s\n", num_cpus, cpu_type.c_str()); fprintf(stderr, "CPUCache: %s\n", cache_size.c_str()); } #endif } public: Benchmark() : cache_(FLAGS_cache_size >= 0 ? NewLRUCache(FLAGS_cache_size) : NULL), filter_policy_(FLAGS_bloom_bits >= 0 ? NewBloomFilterPolicy(FLAGS_bloom_bits) : NULL), db_(NULL), num_(FLAGS_num), value_size_(FLAGS_value_size), entries_per_batch_(1), reads_(FLAGS_reads < 0 ? FLAGS_num : FLAGS_reads), heap_counter_(0) { std::vector files; Env::Default()->GetChildren(FLAGS_db, &files); for (size_t i = 0; i < files.size(); i++) { if (Slice(files[i]).starts_with("heap-")) { Env::Default()->DeleteFile(std::string(FLAGS_db) + "/" + files[i]); } } if (!FLAGS_use_existing_db) { DestroyDB(FLAGS_db, Options()); } } ~Benchmark() { delete db_; delete cache_; delete filter_policy_; } void Run() { PrintHeader(); Open(); const char* benchmarks = FLAGS_benchmarks; while (benchmarks != NULL) { const char* sep = strchr(benchmarks, ','); Slice name; if (sep == NULL) { name = benchmarks; benchmarks = NULL; } else { name = Slice(benchmarks, sep - benchmarks); benchmarks = sep + 1; } // Reset parameters that may be overriddden bwlow num_ = FLAGS_num; reads_ = (FLAGS_reads < 0 ? FLAGS_num : FLAGS_reads); value_size_ = FLAGS_value_size; entries_per_batch_ = 1; write_options_ = WriteOptions(); void (Benchmark::*method)(ThreadState*) = NULL; bool fresh_db = false; int num_threads = FLAGS_threads; if (name == Slice("fillseq")) { fresh_db = true; method = &Benchmark::WriteSeq; } else if (name == Slice("fillbatch")) { fresh_db = true; entries_per_batch_ = 1000; method = &Benchmark::WriteSeq; } else if (name == Slice("fillrandom")) { fresh_db = true; method = &Benchmark::WriteRandom; } else if (name == Slice("overwrite")) { fresh_db = false; method = &Benchmark::WriteRandom; } else if (name == Slice("fillsync")) { fresh_db = true; num_ /= 1000; write_options_.sync = true; method = &Benchmark::WriteRandom; } else if (name == Slice("fill100K")) { fresh_db = true; num_ /= 1000; value_size_ = 100 * 1000; method = &Benchmark::WriteRandom; } else if (name == Slice("readseq")) { method = &Benchmark::ReadSequential; } else if (name == Slice("readreverse")) { method = &Benchmark::ReadReverse; } else if (name == Slice("readrandom")) { method = &Benchmark::ReadRandom; } else if (name == Slice("readmissing")) { method = &Benchmark::ReadMissing; } else if (name == Slice("seekrandom")) { method = &Benchmark::SeekRandom; } else if (name == Slice("readhot")) { method = &Benchmark::ReadHot; } else if (name == Slice("readrandomsmall")) { reads_ /= 1000; method = &Benchmark::ReadRandom; } else if (name == Slice("deleteseq")) { method = &Benchmark::DeleteSeq; } else if (name == Slice("deleterandom")) { method = &Benchmark::DeleteRandom; } else if (name == Slice("readwhilewriting")) { num_threads++; // Add extra thread for writing method = &Benchmark::ReadWhileWriting; } else if (name == Slice("compact")) { method = &Benchmark::Compact; } else if (name == Slice("crc32c")) { method = &Benchmark::Crc32c; } else if (name == Slice("acquireload")) { method = &Benchmark::AcquireLoad; } else if (name == Slice("snappycomp")) { method = &Benchmark::SnappyCompress; } else if (name == Slice("snappyuncomp")) { method = &Benchmark::SnappyUncompress; } else if (name == Slice("heapprofile")) { HeapProfile(); } else if (name == Slice("stats")) { PrintStats("leveldb.stats"); } else if (name == Slice("sstables")) { PrintStats("leveldb.sstables"); } else { if (name != Slice()) { // No error message for empty name fprintf(stderr, "unknown benchmark '%s'\n", name.ToString().c_str()); } } if (fresh_db) { if (FLAGS_use_existing_db) { fprintf(stdout, "%-12s : skipped (--use_existing_db is true)\n", name.ToString().c_str()); method = NULL; } else { delete db_; db_ = NULL; DestroyDB(FLAGS_db, Options()); Open(); } } if (method != NULL) { RunBenchmark(num_threads, name, method); } } } private: struct ThreadArg { Benchmark* bm; SharedState* shared; ThreadState* thread; void (Benchmark::*method)(ThreadState*); }; static void ThreadBody(void* v) { ThreadArg* arg = reinterpret_cast(v); SharedState* shared = arg->shared; ThreadState* thread = arg->thread; { MutexLock l(&shared->mu); shared->num_initialized++; if (shared->num_initialized >= shared->total) { shared->cv.SignalAll(); } while (!shared->start) { shared->cv.Wait(); } } thread->stats.Start(); (arg->bm->*(arg->method))(thread); thread->stats.Stop(); { MutexLock l(&shared->mu); shared->num_done++; if (shared->num_done >= shared->total) { shared->cv.SignalAll(); } } } void RunBenchmark(int n, Slice name, void (Benchmark::*method)(ThreadState*)) { SharedState shared; shared.total = n; shared.num_initialized = 0; shared.num_done = 0; shared.start = false; ThreadArg* arg = new ThreadArg[n]; for (int i = 0; i < n; i++) { arg[i].bm = this; arg[i].method = method; arg[i].shared = &shared; arg[i].thread = new ThreadState(i); arg[i].thread->shared = &shared; Env::Default()->StartThread(ThreadBody, &arg[i]); } shared.mu.Lock(); while (shared.num_initialized < n) { shared.cv.Wait(); } shared.start = true; shared.cv.SignalAll(); while (shared.num_done < n) { shared.cv.Wait(); } shared.mu.Unlock(); for (int i = 1; i < n; i++) { arg[0].thread->stats.Merge(arg[i].thread->stats); } arg[0].thread->stats.Report(name); for (int i = 0; i < n; i++) { delete arg[i].thread; } delete[] arg; } void Crc32c(ThreadState* thread) { // Checksum about 500MB of data total const int size = 4096; const char* label = "(4K per op)"; std::string data(size, 'x'); int64_t bytes = 0; uint32_t crc = 0; while (bytes < 500 * 1048576) { crc = crc32c::Value(data.data(), size); thread->stats.FinishedSingleOp(); bytes += size; } // Print so result is not dead fprintf(stderr, "... crc=0x%x\r", static_cast(crc)); thread->stats.AddBytes(bytes); thread->stats.AddMessage(label); } void AcquireLoad(ThreadState* thread) { int dummy; port::AtomicPointer ap(&dummy); int count = 0; void *ptr = NULL; thread->stats.AddMessage("(each op is 1000 loads)"); while (count < 100000) { for (int i = 0; i < 1000; i++) { ptr = ap.Acquire_Load(); } count++; thread->stats.FinishedSingleOp(); } if (ptr == NULL) exit(1); // Disable unused variable warning. } void SnappyCompress(ThreadState* thread) { RandomGenerator gen; Slice input = gen.Generate(Options().block_size); int64_t bytes = 0; int64_t produced = 0; bool ok = true; std::string compressed; while (ok && bytes < 1024 * 1048576) { // Compress 1G ok = port::Snappy_Compress(input.data(), input.size(), &compressed); produced += compressed.size(); bytes += input.size(); thread->stats.FinishedSingleOp(); } if (!ok) { thread->stats.AddMessage("(snappy failure)"); } else { char buf[100]; snprintf(buf, sizeof(buf), "(output: %.1f%%)", (produced * 100.0) / bytes); thread->stats.AddMessage(buf); thread->stats.AddBytes(bytes); } } void SnappyUncompress(ThreadState* thread) { RandomGenerator gen; Slice input = gen.Generate(Options().block_size); std::string compressed; bool ok = port::Snappy_Compress(input.data(), input.size(), &compressed); int64_t bytes = 0; char* uncompressed = new char[input.size()]; while (ok && bytes < 1024 * 1048576) { // Compress 1G ok = port::Snappy_Uncompress(compressed.data(), compressed.size(), uncompressed); bytes += input.size(); thread->stats.FinishedSingleOp(); } delete[] uncompressed; if (!ok) { thread->stats.AddMessage("(snappy failure)"); } else { thread->stats.AddBytes(bytes); } } void Open() { assert(db_ == NULL); Options options; options.create_if_missing = !FLAGS_use_existing_db; options.block_cache = cache_; options.write_buffer_size = FLAGS_write_buffer_size; options.max_open_files = FLAGS_open_files; options.filter_policy = filter_policy_; Status s = DB::Open(options, FLAGS_db, &db_); if (!s.ok()) { fprintf(stderr, "open error: %s\n", s.ToString().c_str()); exit(1); } } void WriteSeq(ThreadState* thread) { DoWrite(thread, true); } void WriteRandom(ThreadState* thread) { DoWrite(thread, false); } void DoWrite(ThreadState* thread, bool seq) { if (num_ != FLAGS_num) { char msg[100]; snprintf(msg, sizeof(msg), "(%d ops)", num_); thread->stats.AddMessage(msg); } RandomGenerator gen; WriteBatch batch; Status s; int64_t bytes = 0; for (int i = 0; i < num_; i += entries_per_batch_) { batch.Clear(); for (int j = 0; j < entries_per_batch_; j++) { const int k = seq ? i+j : (thread->rand.Next() % FLAGS_num); char key[100]; snprintf(key, sizeof(key), "%016d", k); batch.Put(key, gen.Generate(value_size_)); bytes += value_size_ + strlen(key); thread->stats.FinishedSingleOp(); } s = db_->Write(write_options_, &batch); if (!s.ok()) { fprintf(stderr, "put error: %s\n", s.ToString().c_str()); exit(1); } } thread->stats.AddBytes(bytes); } void ReadSequential(ThreadState* thread) { Iterator* iter = db_->NewIterator(ReadOptions()); int i = 0; int64_t bytes = 0; for (iter->SeekToFirst(); i < reads_ && iter->Valid(); iter->Next()) { bytes += iter->key().size() + iter->value().size(); thread->stats.FinishedSingleOp(); ++i; } delete iter; thread->stats.AddBytes(bytes); } void ReadReverse(ThreadState* thread) { Iterator* iter = db_->NewIterator(ReadOptions()); int i = 0; int64_t bytes = 0; for (iter->SeekToLast(); i < reads_ && iter->Valid(); iter->Prev()) { bytes += iter->key().size() + iter->value().size(); thread->stats.FinishedSingleOp(); ++i; } delete iter; thread->stats.AddBytes(bytes); } void ReadRandom(ThreadState* thread) { ReadOptions options; std::string value; int found = 0; for (int i = 0; i < reads_; i++) { char key[100]; const int k = thread->rand.Next() % FLAGS_num; snprintf(key, sizeof(key), "%016d", k); if (db_->Get(options, key, &value).ok()) { found++; } thread->stats.FinishedSingleOp(); } char msg[100]; snprintf(msg, sizeof(msg), "(%d of %d found)", found, num_); thread->stats.AddMessage(msg); } void ReadMissing(ThreadState* thread) { ReadOptions options; std::string value; for (int i = 0; i < reads_; i++) { char key[100]; const int k = thread->rand.Next() % FLAGS_num; snprintf(key, sizeof(key), "%016d.", k); db_->Get(options, key, &value); thread->stats.FinishedSingleOp(); } } void ReadHot(ThreadState* thread) { ReadOptions options; std::string value; const int range = (FLAGS_num + 99) / 100; for (int i = 0; i < reads_; i++) { char key[100]; const int k = thread->rand.Next() % range; snprintf(key, sizeof(key), "%016d", k); db_->Get(options, key, &value); thread->stats.FinishedSingleOp(); } } void SeekRandom(ThreadState* thread) { ReadOptions options; std::string value; int found = 0; for (int i = 0; i < reads_; i++) { Iterator* iter = db_->NewIterator(options); char key[100]; const int k = thread->rand.Next() % FLAGS_num; snprintf(key, sizeof(key), "%016d", k); iter->Seek(key); if (iter->Valid() && iter->key() == key) found++; delete iter; thread->stats.FinishedSingleOp(); } char msg[100]; snprintf(msg, sizeof(msg), "(%d of %d found)", found, num_); thread->stats.AddMessage(msg); } void DoDelete(ThreadState* thread, bool seq) { RandomGenerator gen; WriteBatch batch; Status s; for (int i = 0; i < num_; i += entries_per_batch_) { batch.Clear(); for (int j = 0; j < entries_per_batch_; j++) { const int k = seq ? i+j : (thread->rand.Next() % FLAGS_num); char key[100]; snprintf(key, sizeof(key), "%016d", k); batch.Delete(key); thread->stats.FinishedSingleOp(); } s = db_->Write(write_options_, &batch); if (!s.ok()) { fprintf(stderr, "del error: %s\n", s.ToString().c_str()); exit(1); } } } void DeleteSeq(ThreadState* thread) { DoDelete(thread, true); } void DeleteRandom(ThreadState* thread) { DoDelete(thread, false); } void ReadWhileWriting(ThreadState* thread) { if (thread->tid > 0) { ReadRandom(thread); } else { // Special thread that keeps writing until other threads are done. RandomGenerator gen; while (true) { { MutexLock l(&thread->shared->mu); if (thread->shared->num_done + 1 >= thread->shared->num_initialized) { // Other threads have finished break; } } const int k = thread->rand.Next() % FLAGS_num; char key[100]; snprintf(key, sizeof(key), "%016d", k); Status s = db_->Put(write_options_, key, gen.Generate(value_size_)); if (!s.ok()) { fprintf(stderr, "put error: %s\n", s.ToString().c_str()); exit(1); } } // Do not count any of the preceding work/delay in stats. thread->stats.Start(); } } void Compact(ThreadState* thread) { db_->CompactRange(NULL, NULL); } void PrintStats(const char* key) { std::string stats; if (!db_->GetProperty(key, &stats)) { stats = "(failed)"; } fprintf(stdout, "\n%s\n", stats.c_str()); } static void WriteToFile(void* arg, const char* buf, int n) { reinterpret_cast(arg)->Append(Slice(buf, n)); } void HeapProfile() { char fname[100]; snprintf(fname, sizeof(fname), "%s/heap-%04d", FLAGS_db, ++heap_counter_); WritableFile* file; Status s = Env::Default()->NewWritableFile(fname, &file); if (!s.ok()) { fprintf(stderr, "%s\n", s.ToString().c_str()); return; } bool ok = port::GetHeapProfile(WriteToFile, file); delete file; if (!ok) { fprintf(stderr, "heap profiling not supported\n"); Env::Default()->DeleteFile(fname); } } }; } // namespace leveldb int main(int argc, char** argv) { FLAGS_write_buffer_size = leveldb::Options().write_buffer_size; FLAGS_open_files = leveldb::Options().max_open_files; std::string default_db_path; for (int i = 1; i < argc; i++) { double d; int n; char junk; if (leveldb::Slice(argv[i]).starts_with("--benchmarks=")) { FLAGS_benchmarks = argv[i] + strlen("--benchmarks="); } else if (sscanf(argv[i], "--compression_ratio=%lf%c", &d, &junk) == 1) { FLAGS_compression_ratio = d; } else if (sscanf(argv[i], "--histogram=%d%c", &n, &junk) == 1 && (n == 0 || n == 1)) { FLAGS_histogram = n; } else if (sscanf(argv[i], "--use_existing_db=%d%c", &n, &junk) == 1 && (n == 0 || n == 1)) { FLAGS_use_existing_db = n; } else if (sscanf(argv[i], "--num=%d%c", &n, &junk) == 1) { FLAGS_num = n; } else if (sscanf(argv[i], "--reads=%d%c", &n, &junk) == 1) { FLAGS_reads = n; } else if (sscanf(argv[i], "--threads=%d%c", &n, &junk) == 1) { FLAGS_threads = n; } else if (sscanf(argv[i], "--value_size=%d%c", &n, &junk) == 1) { FLAGS_value_size = n; } else if (sscanf(argv[i], "--write_buffer_size=%d%c", &n, &junk) == 1) { FLAGS_write_buffer_size = n; } else if (sscanf(argv[i], "--cache_size=%d%c", &n, &junk) == 1) { FLAGS_cache_size = n; } else if (sscanf(argv[i], "--bloom_bits=%d%c", &n, &junk) == 1) { FLAGS_bloom_bits = n; } else if (sscanf(argv[i], "--open_files=%d%c", &n, &junk) == 1) { FLAGS_open_files = n; } else if (strncmp(argv[i], "--db=", 5) == 0) { FLAGS_db = argv[i] + 5; } else { fprintf(stderr, "Invalid flag '%s'\n", argv[i]); exit(1); } } // Choose a location for the test database if none given with --db= if (FLAGS_db == NULL) { leveldb::Env::Default()->GetTestDirectory(&default_db_path); default_db_path += "/dbbench"; FLAGS_db = default_db_path.c_str(); } leveldb::Benchmark benchmark; benchmark.Run(); return 0; } armory-0.92.3/cppForSwig/leveldb/NEWS0000644000000000000000000000077512414772654016040 0ustar rootrootRelease 1.2 2011-05-16 ---------------------- Fixes for larger databases (tested up to one billion 100-byte entries, i.e., ~100GB). (1) Place hard limit on number of level-0 files. This fixes errors of the form "too many open files". (2) Fixed memtable management. Before the fix, a heavy write burst could cause unbounded memory usage. A fix for a logging bug where the reader would incorrectly complain about corruption. Allow public access to WriteBatch contents so that users can easily wrap a DB. armory-0.92.3/cppForSwig/leveldb/.gitignore0000644000000000000000000000011112414772654017311 0ustar rootrootbuild_config.mk *.a *.o *.dylib* *.so *.so.* *_test db_bench leveldbutil armory-0.92.3/cppForSwig/leveldb/port/0000755000000000000000000000000012414772654016314 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb/port/port_posix.cc0000644000000000000000000000264012414772654021033 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "port/port_posix.h" #include #include #include #include "util/logging.h" namespace leveldb { namespace port { static void PthreadCall(const char* label, int result) { if (result != 0) { fprintf(stderr, "pthread %s: %s\n", label, strerror(result)); abort(); } } Mutex::Mutex() { PthreadCall("init mutex", pthread_mutex_init(&mu_, NULL)); } Mutex::~Mutex() { PthreadCall("destroy mutex", pthread_mutex_destroy(&mu_)); } void Mutex::Lock() { PthreadCall("lock", pthread_mutex_lock(&mu_)); } void Mutex::Unlock() { PthreadCall("unlock", pthread_mutex_unlock(&mu_)); } CondVar::CondVar(Mutex* mu) : mu_(mu) { PthreadCall("init cv", pthread_cond_init(&cv_, NULL)); } CondVar::~CondVar() { PthreadCall("destroy cv", pthread_cond_destroy(&cv_)); } void CondVar::Wait() { PthreadCall("wait", pthread_cond_wait(&cv_, &mu_->mu_)); } void CondVar::Signal() { PthreadCall("signal", pthread_cond_signal(&cv_)); } void CondVar::SignalAll() { PthreadCall("broadcast", pthread_cond_broadcast(&cv_)); } void InitOnce(OnceType* once, void (*initializer)()) { PthreadCall("once", pthread_once(once, initializer)); } } // namespace port } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/port/thread_annotations.h0000644000000000000000000000242012414772654022347 0ustar rootroot// Copyright (c) 2012 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_PORT_THREAD_ANNOTATIONS_H // Some environments provide custom macros to aid in static thread-safety // analysis. Provide empty definitions of such macros unless they are already // defined. #ifndef EXCLUSIVE_LOCKS_REQUIRED #define EXCLUSIVE_LOCKS_REQUIRED(...) #endif #ifndef SHARED_LOCKS_REQUIRED #define SHARED_LOCKS_REQUIRED(...) #endif #ifndef LOCKS_EXCLUDED #define LOCKS_EXCLUDED(...) #endif #ifndef LOCK_RETURNED #define LOCK_RETURNED(x) #endif #ifndef LOCKABLE #define LOCKABLE #endif #ifndef SCOPED_LOCKABLE #define SCOPED_LOCKABLE #endif #ifndef EXCLUSIVE_LOCK_FUNCTION #define EXCLUSIVE_LOCK_FUNCTION(...) #endif #ifndef SHARED_LOCK_FUNCTION #define SHARED_LOCK_FUNCTION(...) #endif #ifndef EXCLUSIVE_TRYLOCK_FUNCTION #define EXCLUSIVE_TRYLOCK_FUNCTION(...) #endif #ifndef SHARED_TRYLOCK_FUNCTION #define SHARED_TRYLOCK_FUNCTION(...) #endif #ifndef UNLOCK_FUNCTION #define UNLOCK_FUNCTION(...) #endif #ifndef NO_THREAD_SAFETY_ANALYSIS #define NO_THREAD_SAFETY_ANALYSIS #endif #endif // STORAGE_LEVELDB_PORT_THREAD_ANNOTATIONS_H armory-0.92.3/cppForSwig/leveldb/port/port_posix.h0000644000000000000000000001007712414772654020700 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // See port_example.h for documentation for the following types/functions. #ifndef STORAGE_LEVELDB_PORT_PORT_POSIX_H_ #define STORAGE_LEVELDB_PORT_PORT_POSIX_H_ #undef PLATFORM_IS_LITTLE_ENDIAN #if defined(OS_MACOSX) #include #if defined(__DARWIN_LITTLE_ENDIAN) && defined(__DARWIN_BYTE_ORDER) #define PLATFORM_IS_LITTLE_ENDIAN \ (__DARWIN_BYTE_ORDER == __DARWIN_LITTLE_ENDIAN) #endif #elif defined(OS_SOLARIS) #include #ifdef _LITTLE_ENDIAN #define PLATFORM_IS_LITTLE_ENDIAN true #else #define PLATFORM_IS_LITTLE_ENDIAN false #endif #elif defined(OS_FREEBSD) #include #include #define PLATFORM_IS_LITTLE_ENDIAN (_BYTE_ORDER == _LITTLE_ENDIAN) #elif defined(OS_OPENBSD) || defined(OS_NETBSD) ||\ defined(OS_DRAGONFLYBSD) #include #include #elif defined(OS_HPUX) #define PLATFORM_IS_LITTLE_ENDIAN false #elif defined(OS_ANDROID) // Due to a bug in the NDK x86 definition, // _BYTE_ORDER must be used instead of __BYTE_ORDER on Android. // See http://code.google.com/p/android/issues/detail?id=39824 #include #define PLATFORM_IS_LITTLE_ENDIAN (_BYTE_ORDER == _LITTLE_ENDIAN) #else #include #endif #include #ifdef SNAPPY #include #endif #include #include #include "port/atomic_pointer.h" #ifndef PLATFORM_IS_LITTLE_ENDIAN #define PLATFORM_IS_LITTLE_ENDIAN (__BYTE_ORDER == __LITTLE_ENDIAN) #endif #if defined(OS_MACOSX) || defined(OS_SOLARIS) || defined(OS_FREEBSD) ||\ defined(OS_NETBSD) || defined(OS_OPENBSD) || defined(OS_DRAGONFLYBSD) ||\ defined(OS_ANDROID) || defined(OS_HPUX) // Use fread/fwrite/fflush on platforms without _unlocked variants #define fread_unlocked fread #define fwrite_unlocked fwrite #define fflush_unlocked fflush #endif #if defined(OS_MACOSX) || defined(OS_FREEBSD) ||\ defined(OS_OPENBSD) || defined(OS_DRAGONFLYBSD) // Use fsync() on platforms without fdatasync() #define fdatasync fsync #endif #if defined(OS_ANDROID) && __ANDROID_API__ < 9 // fdatasync() was only introduced in API level 9 on Android. Use fsync() // when targetting older platforms. #define fdatasync fsync #endif namespace leveldb { namespace port { static const bool kLittleEndian = PLATFORM_IS_LITTLE_ENDIAN; #undef PLATFORM_IS_LITTLE_ENDIAN class CondVar; class Mutex { public: Mutex(); ~Mutex(); void Lock(); void Unlock(); void AssertHeld() { } private: friend class CondVar; pthread_mutex_t mu_; // No copying Mutex(const Mutex&); void operator=(const Mutex&); }; class CondVar { public: explicit CondVar(Mutex* mu); ~CondVar(); void Wait(); void Signal(); void SignalAll(); private: pthread_cond_t cv_; Mutex* mu_; }; typedef pthread_once_t OnceType; #define LEVELDB_ONCE_INIT PTHREAD_ONCE_INIT extern void InitOnce(OnceType* once, void (*initializer)()); inline bool Snappy_Compress(const char* input, size_t length, ::std::string* output) { #ifdef SNAPPY output->resize(snappy::MaxCompressedLength(length)); size_t outlen; snappy::RawCompress(input, length, &(*output)[0], &outlen); output->resize(outlen); return true; #endif return false; } inline bool Snappy_GetUncompressedLength(const char* input, size_t length, size_t* result) { #ifdef SNAPPY return snappy::GetUncompressedLength(input, length, result); #else return false; #endif } inline bool Snappy_Uncompress(const char* input, size_t length, char* output) { #ifdef SNAPPY return snappy::RawUncompress(input, length, output); #else return false; #endif } inline bool GetHeapProfile(void (*func)(void*, const char*, int), void* arg) { return false; } } // namespace port } // namespace leveldb #endif // STORAGE_LEVELDB_PORT_PORT_POSIX_H_ armory-0.92.3/cppForSwig/leveldb/port/atomic_pointer.h0000644000000000000000000001517512414772654021512 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // AtomicPointer provides storage for a lock-free pointer. // Platform-dependent implementation of AtomicPointer: // - If the platform provides a cheap barrier, we use it with raw pointers // - If cstdatomic is present (on newer versions of gcc, it is), we use // a cstdatomic-based AtomicPointer. However we prefer the memory // barrier based version, because at least on a gcc 4.4 32-bit build // on linux, we have encountered a buggy // implementation. Also, some implementations are much // slower than a memory-barrier based implementation (~16ns for // based acquire-load vs. ~1ns for a barrier based // acquire-load). // This code is based on atomicops-internals-* in Google's perftools: // http://code.google.com/p/google-perftools/source/browse/#svn%2Ftrunk%2Fsrc%2Fbase #ifndef PORT_ATOMIC_POINTER_H_ #define PORT_ATOMIC_POINTER_H_ #include #ifdef LEVELDB_CSTDATOMIC_PRESENT #include #endif #ifdef OS_WIN #include #endif #ifdef OS_MACOSX #include #endif #if defined(_M_X64) || defined(__x86_64__) #define ARCH_CPU_X86_FAMILY 1 #elif defined(_M_IX86) || defined(__i386__) || defined(__i386) #define ARCH_CPU_X86_FAMILY 1 #elif defined(__ARMEL__) #define ARCH_CPU_ARM_FAMILY 1 #elif defined(__ppc__) || defined(__powerpc__) || defined(__powerpc64__) #define ARCH_CPU_PPC_FAMILY 1 #endif namespace leveldb { namespace port { // Define MemoryBarrier() if available // Windows on x86 #if defined(OS_WIN) && defined(COMPILER_MSVC) && defined(ARCH_CPU_X86_FAMILY) // windows.h already provides a MemoryBarrier(void) macro // http://msdn.microsoft.com/en-us/library/ms684208(v=vs.85).aspx #define LEVELDB_HAVE_MEMORY_BARRIER // Mac OS #elif defined(OS_MACOSX) inline void MemoryBarrier() { OSMemoryBarrier(); } #define LEVELDB_HAVE_MEMORY_BARRIER // Gcc on x86 #elif defined(ARCH_CPU_X86_FAMILY) && defined(__GNUC__) inline void MemoryBarrier() { // See http://gcc.gnu.org/ml/gcc/2003-04/msg01180.html for a discussion on // this idiom. Also see http://en.wikipedia.org/wiki/Memory_ordering. __asm__ __volatile__("" : : : "memory"); } #define LEVELDB_HAVE_MEMORY_BARRIER // Sun Studio #elif defined(ARCH_CPU_X86_FAMILY) && defined(__SUNPRO_CC) inline void MemoryBarrier() { // See http://gcc.gnu.org/ml/gcc/2003-04/msg01180.html for a discussion on // this idiom. Also see http://en.wikipedia.org/wiki/Memory_ordering. asm volatile("" : : : "memory"); } #define LEVELDB_HAVE_MEMORY_BARRIER // ARM Linux #elif defined(ARCH_CPU_ARM_FAMILY) && defined(__linux__) typedef void (*LinuxKernelMemoryBarrierFunc)(void); // The Linux ARM kernel provides a highly optimized device-specific memory // barrier function at a fixed memory address that is mapped in every // user-level process. // // This beats using CPU-specific instructions which are, on single-core // devices, un-necessary and very costly (e.g. ARMv7-A "dmb" takes more // than 180ns on a Cortex-A8 like the one on a Nexus One). Benchmarking // shows that the extra function call cost is completely negligible on // multi-core devices. // inline void MemoryBarrier() { (*(LinuxKernelMemoryBarrierFunc)0xffff0fa0)(); } #define LEVELDB_HAVE_MEMORY_BARRIER // PPC #elif defined(ARCH_CPU_PPC_FAMILY) && defined(__GNUC__) inline void MemoryBarrier() { // TODO for some powerpc expert: is there a cheaper suitable variant? // Perhaps by having separate barriers for acquire and release ops. asm volatile("sync" : : : "memory"); } #define LEVELDB_HAVE_MEMORY_BARRIER #endif // AtomicPointer built using platform-specific MemoryBarrier() #if defined(LEVELDB_HAVE_MEMORY_BARRIER) class AtomicPointer { private: void* rep_; public: AtomicPointer() { } explicit AtomicPointer(void* p) : rep_(p) {} inline void* NoBarrier_Load() const { return rep_; } inline void NoBarrier_Store(void* v) { rep_ = v; } inline void* Acquire_Load() const { void* result = rep_; MemoryBarrier(); return result; } inline void Release_Store(void* v) { MemoryBarrier(); rep_ = v; } }; // AtomicPointer based on #elif defined(LEVELDB_CSTDATOMIC_PRESENT) class AtomicPointer { private: std::atomic rep_; public: AtomicPointer() { } explicit AtomicPointer(void* v) : rep_(v) { } inline void* Acquire_Load() const { return rep_.load(std::memory_order_acquire); } inline void Release_Store(void* v) { rep_.store(v, std::memory_order_release); } inline void* NoBarrier_Load() const { return rep_.load(std::memory_order_relaxed); } inline void NoBarrier_Store(void* v) { rep_.store(v, std::memory_order_relaxed); } }; // Atomic pointer based on sparc memory barriers #elif defined(__sparcv9) && defined(__GNUC__) class AtomicPointer { private: void* rep_; public: AtomicPointer() { } explicit AtomicPointer(void* v) : rep_(v) { } inline void* Acquire_Load() const { void* val; __asm__ __volatile__ ( "ldx [%[rep_]], %[val] \n\t" "membar #LoadLoad|#LoadStore \n\t" : [val] "=r" (val) : [rep_] "r" (&rep_) : "memory"); return val; } inline void Release_Store(void* v) { __asm__ __volatile__ ( "membar #LoadStore|#StoreStore \n\t" "stx %[v], [%[rep_]] \n\t" : : [rep_] "r" (&rep_), [v] "r" (v) : "memory"); } inline void* NoBarrier_Load() const { return rep_; } inline void NoBarrier_Store(void* v) { rep_ = v; } }; // Atomic pointer based on ia64 acq/rel #elif defined(__ia64) && defined(__GNUC__) class AtomicPointer { private: void* rep_; public: AtomicPointer() { } explicit AtomicPointer(void* v) : rep_(v) { } inline void* Acquire_Load() const { void* val ; __asm__ __volatile__ ( "ld8.acq %[val] = [%[rep_]] \n\t" : [val] "=r" (val) : [rep_] "r" (&rep_) : "memory" ); return val; } inline void Release_Store(void* v) { __asm__ __volatile__ ( "st8.rel [%[rep_]] = %[v] \n\t" : : [rep_] "r" (&rep_), [v] "r" (v) : "memory" ); } inline void* NoBarrier_Load() const { return rep_; } inline void NoBarrier_Store(void* v) { rep_ = v; } }; // We have neither MemoryBarrier(), nor #else #error Please implement AtomicPointer for this platform. #endif #undef LEVELDB_HAVE_MEMORY_BARRIER #undef ARCH_CPU_X86_FAMILY #undef ARCH_CPU_ARM_FAMILY #undef ARCH_CPU_PPC_FAMILY } // namespace port } // namespace leveldb #endif // PORT_ATOMIC_POINTER_H_ armory-0.92.3/cppForSwig/leveldb/port/README0000644000000000000000000000062512414772654017177 0ustar rootrootThis directory contains interfaces and implementations that isolate the rest of the package from platform details. Code in the rest of the package includes "port.h" from this directory. "port.h" in turn includes a platform specific "port_.h" file that provides the platform specific implementation. See port_posix.h for an example of what must be provided in a platform specific header file. armory-0.92.3/cppForSwig/leveldb/port/port_example.h0000644000000000000000000001107312414772654021166 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // This file contains the specification, but not the implementations, // of the types/operations/etc. that should be defined by a platform // specific port_.h file. Use this file as a reference for // how to port this package to a new platform. #ifndef STORAGE_LEVELDB_PORT_PORT_EXAMPLE_H_ #define STORAGE_LEVELDB_PORT_PORT_EXAMPLE_H_ namespace leveldb { namespace port { // TODO(jorlow): Many of these belong more in the environment class rather than // here. We should try moving them and see if it affects perf. // The following boolean constant must be true on a little-endian machine // and false otherwise. static const bool kLittleEndian = true /* or some other expression */; // ------------------ Threading ------------------- // A Mutex represents an exclusive lock. class Mutex { public: Mutex(); ~Mutex(); // Lock the mutex. Waits until other lockers have exited. // Will deadlock if the mutex is already locked by this thread. void Lock(); // Unlock the mutex. // REQUIRES: This mutex was locked by this thread. void Unlock(); // Optionally crash if this thread does not hold this mutex. // The implementation must be fast, especially if NDEBUG is // defined. The implementation is allowed to skip all checks. void AssertHeld(); }; class CondVar { public: explicit CondVar(Mutex* mu); ~CondVar(); // Atomically release *mu and block on this condition variable until // either a call to SignalAll(), or a call to Signal() that picks // this thread to wakeup. // REQUIRES: this thread holds *mu void Wait(); // If there are some threads waiting, wake up at least one of them. void Signal(); // Wake up all waiting threads. void SignallAll(); }; // Thread-safe initialization. // Used as follows: // static port::OnceType init_control = LEVELDB_ONCE_INIT; // static void Initializer() { ... do something ...; } // ... // port::InitOnce(&init_control, &Initializer); typedef intptr_t OnceType; #define LEVELDB_ONCE_INIT 0 extern void InitOnce(port::OnceType*, void (*initializer)()); // A type that holds a pointer that can be read or written atomically // (i.e., without word-tearing.) class AtomicPointer { private: intptr_t rep_; public: // Initialize to arbitrary value AtomicPointer(); // Initialize to hold v explicit AtomicPointer(void* v) : rep_(v) { } // Read and return the stored pointer with the guarantee that no // later memory access (read or write) by this thread can be // reordered ahead of this read. void* Acquire_Load() const; // Set v as the stored pointer with the guarantee that no earlier // memory access (read or write) by this thread can be reordered // after this store. void Release_Store(void* v); // Read the stored pointer with no ordering guarantees. void* NoBarrier_Load() const; // Set va as the stored pointer with no ordering guarantees. void NoBarrier_Store(void* v); }; // ------------------ Compression ------------------- // Store the snappy compression of "input[0,input_length-1]" in *output. // Returns false if snappy is not supported by this port. extern bool Snappy_Compress(const char* input, size_t input_length, std::string* output); // If input[0,input_length-1] looks like a valid snappy compressed // buffer, store the size of the uncompressed data in *result and // return true. Else return false. extern bool Snappy_GetUncompressedLength(const char* input, size_t length, size_t* result); // Attempt to snappy uncompress input[0,input_length-1] into *output. // Returns true if successful, false if the input is invalid lightweight // compressed data. // // REQUIRES: at least the first "n" bytes of output[] must be writable // where "n" is the result of a successful call to // Snappy_GetUncompressedLength. extern bool Snappy_Uncompress(const char* input_data, size_t input_length, char* output); // ------------------ Miscellaneous ------------------- // If heap profiling is not supported, returns false. // Else repeatedly calls (*func)(arg, data, n) and then returns true. // The concatenation of all "data[0,n-1]" fragments is the heap profile. extern bool GetHeapProfile(void (*func)(void*, const char*, int), void* arg); } // namespace port } // namespace leveldb #endif // STORAGE_LEVELDB_PORT_PORT_EXAMPLE_H_ armory-0.92.3/cppForSwig/leveldb/port/port.h0000644000000000000000000000140212414772654017446 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_PORT_PORT_H_ #define STORAGE_LEVELDB_PORT_PORT_H_ #include // Include the appropriate platform specific file below. If you are // porting to a new platform, see "port_example.h" for documentation // of what the new port_.h file must provide. #if defined(LEVELDB_PLATFORM_POSIX) # include "port/port_posix.h" #ifdef _MSC_VER #include #define fileno _fileno #endif #elif defined(LEVELDB_PLATFORM_CHROMIUM) # include "port/port_chromium.h" #endif #endif // STORAGE_LEVELDB_PORT_PORT_H_ armory-0.92.3/cppForSwig/leveldb/port/win/0000755000000000000000000000000012414772654017111 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb/port/win/stdint.h0000644000000000000000000000152712414772654020574 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // MSVC didn't ship with this file until the 2010 version. #ifndef STORAGE_LEVELDB_PORT_WIN_STDINT_H_ #define STORAGE_LEVELDB_PORT_WIN_STDINT_H_ #if !defined(_MSC_VER) #error This file should only be included when compiling with MSVC. #endif // Define C99 equivalent types. typedef signed char int8_t; typedef signed short int16_t; typedef signed int int32_t; typedef signed long long int64_t; typedef unsigned char uint8_t; typedef unsigned short uint16_t; typedef unsigned int uint32_t; typedef unsigned long long uint64_t; #endif // STORAGE_LEVELDB_PORT_WIN_STDINT_H_ armory-0.92.3/cppForSwig/leveldb/README0000644000000000000000000000326112414772654016212 0ustar rootrootleveldb: A key-value store Authors: Sanjay Ghemawat (sanjay@google.com) and Jeff Dean (jeff@google.com) The code under this directory implements a system for maintaining a persistent key/value store. See doc/index.html for more explanation. See doc/impl.html for a brief overview of the implementation. The public interface is in include/*.h. Callers should not include or rely on the details of any other header files in this package. Those internal APIs may be changed without warning. Guide to header files: include/db.h Main interface to the DB: Start here include/options.h Control over the behavior of an entire database, and also control over the behavior of individual reads and writes. include/comparator.h Abstraction for user-specified comparison function. If you want just bytewise comparison of keys, you can use the default comparator, but clients can write their own comparator implementations if they want custom ordering (e.g. to handle different character encodings, etc.) include/iterator.h Interface for iterating over data. You can get an iterator from a DB object. include/write_batch.h Interface for atomically applying multiple updates to a database. include/slice.h A simple module for maintaining a pointer and a length into some other byte array. include/status.h Status is returned from many of the public interfaces and is used to report success and various kinds of errors. include/env.h Abstraction of the OS environment. A posix implementation of this interface is in util/env_posix.cc include/table.h include/table_builder.h Lower-level modules that most clients probably won't use directly armory-0.92.3/cppForSwig/leveldb/table/0000755000000000000000000000000012414772654016417 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb/table/table_builder.cc0000644000000000000000000001764412414772654021537 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/table_builder.h" #include #include "leveldb/comparator.h" #include "leveldb/env.h" #include "leveldb/filter_policy.h" #include "leveldb/options.h" #include "table/block_builder.h" #include "table/filter_block.h" #include "table/format.h" #include "util/coding.h" #include "util/crc32c.h" namespace leveldb { struct TableBuilder::Rep { Options options; Options index_block_options; WritableFile* file; uint64_t offset; Status status; BlockBuilder data_block; BlockBuilder index_block; std::string last_key; int64_t num_entries; bool closed; // Either Finish() or Abandon() has been called. FilterBlockBuilder* filter_block; // We do not emit the index entry for a block until we have seen the // first key for the next data block. This allows us to use shorter // keys in the index block. For example, consider a block boundary // between the keys "the quick brown fox" and "the who". We can use // "the r" as the key for the index block entry since it is >= all // entries in the first block and < all entries in subsequent // blocks. // // Invariant: r->pending_index_entry is true only if data_block is empty. bool pending_index_entry; BlockHandle pending_handle; // Handle to add to index block std::string compressed_output; Rep(const Options& opt, WritableFile* f) : options(opt), index_block_options(opt), file(f), offset(0), data_block(&options), index_block(&index_block_options), num_entries(0), closed(false), filter_block(opt.filter_policy == NULL ? NULL : new FilterBlockBuilder(opt.filter_policy)), pending_index_entry(false) { index_block_options.block_restart_interval = 1; } }; TableBuilder::TableBuilder(const Options& options, WritableFile* file) : rep_(new Rep(options, file)) { if (rep_->filter_block != NULL) { rep_->filter_block->StartBlock(0); } } TableBuilder::~TableBuilder() { assert(rep_->closed); // Catch errors where caller forgot to call Finish() delete rep_->filter_block; delete rep_; } Status TableBuilder::ChangeOptions(const Options& options) { // Note: if more fields are added to Options, update // this function to catch changes that should not be allowed to // change in the middle of building a Table. if (options.comparator != rep_->options.comparator) { return Status::InvalidArgument("changing comparator while building table"); } // Note that any live BlockBuilders point to rep_->options and therefore // will automatically pick up the updated options. rep_->options = options; rep_->index_block_options = options; rep_->index_block_options.block_restart_interval = 1; return Status::OK(); } void TableBuilder::Add(const Slice& key, const Slice& value) { Rep* r = rep_; assert(!r->closed); if (!ok()) return; if (r->num_entries > 0) { assert(r->options.comparator->Compare(key, Slice(r->last_key)) > 0); } if (r->pending_index_entry) { assert(r->data_block.empty()); r->options.comparator->FindShortestSeparator(&r->last_key, key); std::string handle_encoding; r->pending_handle.EncodeTo(&handle_encoding); r->index_block.Add(r->last_key, Slice(handle_encoding)); r->pending_index_entry = false; } if (r->filter_block != NULL) { r->filter_block->AddKey(key); } r->last_key.assign(key.data(), key.size()); r->num_entries++; r->data_block.Add(key, value); const size_t estimated_block_size = r->data_block.CurrentSizeEstimate(); if (estimated_block_size >= r->options.block_size) { Flush(); } } void TableBuilder::Flush() { Rep* r = rep_; assert(!r->closed); if (!ok()) return; if (r->data_block.empty()) return; assert(!r->pending_index_entry); WriteBlock(&r->data_block, &r->pending_handle); if (ok()) { r->pending_index_entry = true; r->status = r->file->Flush(); } if (r->filter_block != NULL) { r->filter_block->StartBlock(r->offset); } } void TableBuilder::WriteBlock(BlockBuilder* block, BlockHandle* handle) { // File format contains a sequence of blocks where each block has: // block_data: uint8[n] // type: uint8 // crc: uint32 assert(ok()); Rep* r = rep_; Slice raw = block->Finish(); Slice block_contents; CompressionType type = r->options.compression; // TODO(postrelease): Support more compression options: zlib? switch (type) { case kNoCompression: block_contents = raw; break; case kSnappyCompression: { std::string* compressed = &r->compressed_output; if (port::Snappy_Compress(raw.data(), raw.size(), compressed) && compressed->size() < raw.size() - (raw.size() / 8u)) { block_contents = *compressed; } else { // Snappy not supported, or compressed less than 12.5%, so just // store uncompressed form block_contents = raw; type = kNoCompression; } break; } } WriteRawBlock(block_contents, type, handle); r->compressed_output.clear(); block->Reset(); } void TableBuilder::WriteRawBlock(const Slice& block_contents, CompressionType type, BlockHandle* handle) { Rep* r = rep_; handle->set_offset(r->offset); handle->set_size(block_contents.size()); r->status = r->file->Append(block_contents); if (r->status.ok()) { char trailer[kBlockTrailerSize]; trailer[0] = type; uint32_t crc = crc32c::Value(block_contents.data(), block_contents.size()); crc = crc32c::Extend(crc, trailer, 1); // Extend crc to cover block type EncodeFixed32(trailer+1, crc32c::Mask(crc)); r->status = r->file->Append(Slice(trailer, kBlockTrailerSize)); if (r->status.ok()) { r->offset += block_contents.size() + kBlockTrailerSize; } } } Status TableBuilder::status() const { return rep_->status; } Status TableBuilder::Finish() { Rep* r = rep_; Flush(); assert(!r->closed); r->closed = true; BlockHandle filter_block_handle, metaindex_block_handle, index_block_handle; // Write filter block if (ok() && r->filter_block != NULL) { WriteRawBlock(r->filter_block->Finish(), kNoCompression, &filter_block_handle); } // Write metaindex block if (ok()) { BlockBuilder meta_index_block(&r->options); if (r->filter_block != NULL) { // Add mapping from "filter.Name" to location of filter data std::string key = "filter."; key.append(r->options.filter_policy->Name()); std::string handle_encoding; filter_block_handle.EncodeTo(&handle_encoding); meta_index_block.Add(key, handle_encoding); } // TODO(postrelease): Add stats and other meta blocks WriteBlock(&meta_index_block, &metaindex_block_handle); } // Write index block if (ok()) { if (r->pending_index_entry) { r->options.comparator->FindShortSuccessor(&r->last_key); std::string handle_encoding; r->pending_handle.EncodeTo(&handle_encoding); r->index_block.Add(r->last_key, Slice(handle_encoding)); r->pending_index_entry = false; } WriteBlock(&r->index_block, &index_block_handle); } // Write footer if (ok()) { Footer footer; footer.set_metaindex_handle(metaindex_block_handle); footer.set_index_handle(index_block_handle); std::string footer_encoding; footer.EncodeTo(&footer_encoding); r->status = r->file->Append(footer_encoding); if (r->status.ok()) { r->offset += footer_encoding.size(); } } return r->status; } void TableBuilder::Abandon() { Rep* r = rep_; assert(!r->closed); r->closed = true; } uint64_t TableBuilder::NumEntries() const { return rep_->num_entries; } uint64_t TableBuilder::FileSize() const { return rep_->offset; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/table/block_builder.h0000644000000000000000000000334712414772654021377 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_TABLE_BLOCK_BUILDER_H_ #define STORAGE_LEVELDB_TABLE_BLOCK_BUILDER_H_ #include #include #include "leveldb/slice.h" namespace leveldb { struct Options; class BlockBuilder { public: explicit BlockBuilder(const Options* options); // Reset the contents as if the BlockBuilder was just constructed. void Reset(); // REQUIRES: Finish() has not been callled since the last call to Reset(). // REQUIRES: key is larger than any previously added key void Add(const Slice& key, const Slice& value); // Finish building the block and return a slice that refers to the // block contents. The returned slice will remain valid for the // lifetime of this builder or until Reset() is called. Slice Finish(); // Returns an estimate of the current (uncompressed) size of the block // we are building. size_t CurrentSizeEstimate() const; // Return true iff no entries have been added since the last Reset() bool empty() const { return buffer_.empty(); } private: const Options* options_; std::string buffer_; // Destination buffer std::vector restarts_; // Restart points int counter_; // Number of entries emitted since restart bool finished_; // Has Finish() been called? std::string last_key_; // No copying allowed BlockBuilder(const BlockBuilder&); void operator=(const BlockBuilder&); }; } // namespace leveldb #endif // STORAGE_LEVELDB_TABLE_BLOCK_BUILDER_H_ armory-0.92.3/cppForSwig/leveldb/table/filter_block.cc0000644000000000000000000000646512414772654021400 0ustar rootroot// Copyright (c) 2012 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "table/filter_block.h" #include "leveldb/filter_policy.h" #include "util/coding.h" namespace leveldb { // See doc/table_format.txt for an explanation of the filter block format. // Generate new filter every 2KB of data static const size_t kFilterBaseLg = 11; static const size_t kFilterBase = 1 << kFilterBaseLg; FilterBlockBuilder::FilterBlockBuilder(const FilterPolicy* policy) : policy_(policy) { } void FilterBlockBuilder::StartBlock(uint64_t block_offset) { uint64_t filter_index = (block_offset / kFilterBase); assert(filter_index >= filter_offsets_.size()); while (filter_index > filter_offsets_.size()) { GenerateFilter(); } } void FilterBlockBuilder::AddKey(const Slice& key) { Slice k = key; start_.push_back(keys_.size()); keys_.append(k.data(), k.size()); } Slice FilterBlockBuilder::Finish() { if (!start_.empty()) { GenerateFilter(); } // Append array of per-filter offsets const uint32_t array_offset = result_.size(); for (size_t i = 0; i < filter_offsets_.size(); i++) { PutFixed32(&result_, filter_offsets_[i]); } PutFixed32(&result_, array_offset); result_.push_back(kFilterBaseLg); // Save encoding parameter in result return Slice(result_); } void FilterBlockBuilder::GenerateFilter() { const size_t num_keys = start_.size(); if (num_keys == 0) { // Fast path if there are no keys for this filter filter_offsets_.push_back(result_.size()); return; } // Make list of keys from flattened key structure start_.push_back(keys_.size()); // Simplify length computation tmp_keys_.resize(num_keys); for (size_t i = 0; i < num_keys; i++) { const char* base = keys_.data() + start_[i]; size_t length = start_[i+1] - start_[i]; tmp_keys_[i] = Slice(base, length); } // Generate filter for current set of keys and append to result_. filter_offsets_.push_back(result_.size()); policy_->CreateFilter(&tmp_keys_[0], num_keys, &result_); tmp_keys_.clear(); keys_.clear(); start_.clear(); } FilterBlockReader::FilterBlockReader(const FilterPolicy* policy, const Slice& contents) : policy_(policy), data_(NULL), offset_(NULL), num_(0), base_lg_(0) { size_t n = contents.size(); if (n < 5) return; // 1 byte for base_lg_ and 4 for start of offset array base_lg_ = contents[n-1]; uint32_t last_word = DecodeFixed32(contents.data() + n - 5); if (last_word > n - 5) return; data_ = contents.data(); offset_ = data_ + last_word; num_ = (n - 5 - last_word) / 4; } bool FilterBlockReader::KeyMayMatch(uint64_t block_offset, const Slice& key) { uint64_t index = block_offset >> base_lg_; if (index < num_) { uint32_t start = DecodeFixed32(offset_ + index*4); uint32_t limit = DecodeFixed32(offset_ + index*4 + 4); if (start <= limit && limit <= (offset_ - data_)) { Slice filter = Slice(data_ + start, limit - start); return policy_->KeyMayMatch(key, filter); } else if (start == limit) { // Empty filters do not match any keys return false; } } return true; // Errors are treated as potential matches } } armory-0.92.3/cppForSwig/leveldb/table/table_test.cc0000644000000000000000000005710712414772654021066 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/table.h" #include #include #include "db/dbformat.h" #include "db/memtable.h" #include "db/write_batch_internal.h" #include "leveldb/db.h" #include "leveldb/env.h" #include "leveldb/iterator.h" #include "leveldb/table_builder.h" #include "table/block.h" #include "table/block_builder.h" #include "table/format.h" #include "util/random.h" #include "util/testharness.h" #include "util/testutil.h" namespace leveldb { // Return reverse of "key". // Used to test non-lexicographic comparators. static std::string Reverse(const Slice& key) { std::string str(key.ToString()); std::string rev(""); for (std::string::reverse_iterator rit = str.rbegin(); rit != str.rend(); ++rit) { rev.push_back(*rit); } return rev; } namespace { class ReverseKeyComparator : public Comparator { public: virtual const char* Name() const { return "leveldb.ReverseBytewiseComparator"; } virtual int Compare(const Slice& a, const Slice& b) const { return BytewiseComparator()->Compare(Reverse(a), Reverse(b)); } virtual void FindShortestSeparator( std::string* start, const Slice& limit) const { std::string s = Reverse(*start); std::string l = Reverse(limit); BytewiseComparator()->FindShortestSeparator(&s, l); *start = Reverse(s); } virtual void FindShortSuccessor(std::string* key) const { std::string s = Reverse(*key); BytewiseComparator()->FindShortSuccessor(&s); *key = Reverse(s); } }; } // namespace static ReverseKeyComparator reverse_key_comparator; static void Increment(const Comparator* cmp, std::string* key) { if (cmp == BytewiseComparator()) { key->push_back('\0'); } else { assert(cmp == &reverse_key_comparator); std::string rev = Reverse(*key); rev.push_back('\0'); *key = Reverse(rev); } } // An STL comparator that uses a Comparator namespace { struct STLLessThan { const Comparator* cmp; STLLessThan() : cmp(BytewiseComparator()) { } STLLessThan(const Comparator* c) : cmp(c) { } bool operator()(const std::string& a, const std::string& b) const { return cmp->Compare(Slice(a), Slice(b)) < 0; } }; } // namespace class StringSink: public WritableFile { public: ~StringSink() { } const std::string& contents() const { return contents_; } virtual Status Close() { return Status::OK(); } virtual Status Flush() { return Status::OK(); } virtual Status Sync() { return Status::OK(); } virtual Status Append(const Slice& data) { contents_.append(data.data(), data.size()); return Status::OK(); } private: std::string contents_; }; class StringSource: public RandomAccessFile { public: StringSource(const Slice& contents) : contents_(contents.data(), contents.size()) { } virtual ~StringSource() { } uint64_t Size() const { return contents_.size(); } virtual Status Read(uint64_t offset, size_t n, Slice* result, char* scratch) const { if (offset > contents_.size()) { return Status::InvalidArgument("invalid Read offset"); } if (offset + n > contents_.size()) { n = contents_.size() - offset; } memcpy(scratch, &contents_[offset], n); *result = Slice(scratch, n); return Status::OK(); } private: std::string contents_; }; typedef std::map KVMap; // Helper class for tests to unify the interface between // BlockBuilder/TableBuilder and Block/Table. class Constructor { public: explicit Constructor(const Comparator* cmp) : data_(STLLessThan(cmp)) { } virtual ~Constructor() { } void Add(const std::string& key, const Slice& value) { data_[key] = value.ToString(); } // Finish constructing the data structure with all the keys that have // been added so far. Returns the keys in sorted order in "*keys" // and stores the key/value pairs in "*kvmap" void Finish(const Options& options, std::vector* keys, KVMap* kvmap) { *kvmap = data_; keys->clear(); for (KVMap::const_iterator it = data_.begin(); it != data_.end(); ++it) { keys->push_back(it->first); } data_.clear(); Status s = FinishImpl(options, *kvmap); ASSERT_TRUE(s.ok()) << s.ToString(); } // Construct the data structure from the data in "data" virtual Status FinishImpl(const Options& options, const KVMap& data) = 0; virtual Iterator* NewIterator() const = 0; virtual const KVMap& data() { return data_; } virtual DB* db() const { return NULL; } // Overridden in DBConstructor private: KVMap data_; }; class BlockConstructor: public Constructor { public: explicit BlockConstructor(const Comparator* cmp) : Constructor(cmp), comparator_(cmp), block_(NULL) { } ~BlockConstructor() { delete block_; } virtual Status FinishImpl(const Options& options, const KVMap& data) { delete block_; block_ = NULL; BlockBuilder builder(&options); for (KVMap::const_iterator it = data.begin(); it != data.end(); ++it) { builder.Add(it->first, it->second); } // Open the block data_ = builder.Finish().ToString(); BlockContents contents; contents.data = data_; contents.cachable = false; contents.heap_allocated = false; block_ = new Block(contents); return Status::OK(); } virtual Iterator* NewIterator() const { return block_->NewIterator(comparator_); } private: const Comparator* comparator_; std::string data_; Block* block_; BlockConstructor(); }; class TableConstructor: public Constructor { public: TableConstructor(const Comparator* cmp) : Constructor(cmp), source_(NULL), table_(NULL) { } ~TableConstructor() { Reset(); } virtual Status FinishImpl(const Options& options, const KVMap& data) { Reset(); StringSink sink; TableBuilder builder(options, &sink); for (KVMap::const_iterator it = data.begin(); it != data.end(); ++it) { builder.Add(it->first, it->second); ASSERT_TRUE(builder.status().ok()); } Status s = builder.Finish(); ASSERT_TRUE(s.ok()) << s.ToString(); ASSERT_EQ(sink.contents().size(), builder.FileSize()); // Open the table source_ = new StringSource(sink.contents()); Options table_options; table_options.comparator = options.comparator; return Table::Open(table_options, source_, sink.contents().size(), &table_); } virtual Iterator* NewIterator() const { return table_->NewIterator(ReadOptions()); } uint64_t ApproximateOffsetOf(const Slice& key) const { return table_->ApproximateOffsetOf(key); } private: void Reset() { delete table_; delete source_; table_ = NULL; source_ = NULL; } StringSource* source_; Table* table_; TableConstructor(); }; // A helper class that converts internal format keys into user keys class KeyConvertingIterator: public Iterator { public: explicit KeyConvertingIterator(Iterator* iter) : iter_(iter) { } virtual ~KeyConvertingIterator() { delete iter_; } virtual bool Valid() const { return iter_->Valid(); } virtual void Seek(const Slice& target) { ParsedInternalKey ikey(target, kMaxSequenceNumber, kTypeValue); std::string encoded; AppendInternalKey(&encoded, ikey); iter_->Seek(encoded); } virtual void SeekToFirst() { iter_->SeekToFirst(); } virtual void SeekToLast() { iter_->SeekToLast(); } virtual void Next() { iter_->Next(); } virtual void Prev() { iter_->Prev(); } virtual Slice key() const { assert(Valid()); ParsedInternalKey key; if (!ParseInternalKey(iter_->key(), &key)) { status_ = Status::Corruption("malformed internal key"); return Slice("corrupted key"); } return key.user_key; } virtual Slice value() const { return iter_->value(); } virtual Status status() const { return status_.ok() ? iter_->status() : status_; } private: mutable Status status_; Iterator* iter_; // No copying allowed KeyConvertingIterator(const KeyConvertingIterator&); void operator=(const KeyConvertingIterator&); }; class MemTableConstructor: public Constructor { public: explicit MemTableConstructor(const Comparator* cmp) : Constructor(cmp), internal_comparator_(cmp) { memtable_ = new MemTable(internal_comparator_); memtable_->Ref(); } ~MemTableConstructor() { memtable_->Unref(); } virtual Status FinishImpl(const Options& options, const KVMap& data) { memtable_->Unref(); memtable_ = new MemTable(internal_comparator_); memtable_->Ref(); int seq = 1; for (KVMap::const_iterator it = data.begin(); it != data.end(); ++it) { memtable_->Add(seq, kTypeValue, it->first, it->second); seq++; } return Status::OK(); } virtual Iterator* NewIterator() const { return new KeyConvertingIterator(memtable_->NewIterator()); } private: InternalKeyComparator internal_comparator_; MemTable* memtable_; }; class DBConstructor: public Constructor { public: explicit DBConstructor(const Comparator* cmp) : Constructor(cmp), comparator_(cmp) { db_ = NULL; NewDB(); } ~DBConstructor() { delete db_; } virtual Status FinishImpl(const Options& options, const KVMap& data) { delete db_; db_ = NULL; NewDB(); for (KVMap::const_iterator it = data.begin(); it != data.end(); ++it) { WriteBatch batch; batch.Put(it->first, it->second); ASSERT_TRUE(db_->Write(WriteOptions(), &batch).ok()); } return Status::OK(); } virtual Iterator* NewIterator() const { return db_->NewIterator(ReadOptions()); } virtual DB* db() const { return db_; } private: void NewDB() { std::string name = test::TmpDir() + "/table_testdb"; Options options; options.comparator = comparator_; Status status = DestroyDB(name, options); ASSERT_TRUE(status.ok()) << status.ToString(); options.create_if_missing = true; options.error_if_exists = true; options.write_buffer_size = 10000; // Something small to force merging status = DB::Open(options, name, &db_); ASSERT_TRUE(status.ok()) << status.ToString(); } const Comparator* comparator_; DB* db_; }; enum TestType { TABLE_TEST, BLOCK_TEST, MEMTABLE_TEST, DB_TEST }; struct TestArgs { TestType type; bool reverse_compare; int restart_interval; }; static const TestArgs kTestArgList[] = { { TABLE_TEST, false, 16 }, { TABLE_TEST, false, 1 }, { TABLE_TEST, false, 1024 }, { TABLE_TEST, true, 16 }, { TABLE_TEST, true, 1 }, { TABLE_TEST, true, 1024 }, { BLOCK_TEST, false, 16 }, { BLOCK_TEST, false, 1 }, { BLOCK_TEST, false, 1024 }, { BLOCK_TEST, true, 16 }, { BLOCK_TEST, true, 1 }, { BLOCK_TEST, true, 1024 }, // Restart interval does not matter for memtables { MEMTABLE_TEST, false, 16 }, { MEMTABLE_TEST, true, 16 }, // Do not bother with restart interval variations for DB { DB_TEST, false, 16 }, { DB_TEST, true, 16 }, }; static const int kNumTestArgs = sizeof(kTestArgList) / sizeof(kTestArgList[0]); class Harness { public: Harness() : constructor_(NULL) { } void Init(const TestArgs& args) { delete constructor_; constructor_ = NULL; options_ = Options(); options_.block_restart_interval = args.restart_interval; // Use shorter block size for tests to exercise block boundary // conditions more. options_.block_size = 256; if (args.reverse_compare) { options_.comparator = &reverse_key_comparator; } switch (args.type) { case TABLE_TEST: constructor_ = new TableConstructor(options_.comparator); break; case BLOCK_TEST: constructor_ = new BlockConstructor(options_.comparator); break; case MEMTABLE_TEST: constructor_ = new MemTableConstructor(options_.comparator); break; case DB_TEST: constructor_ = new DBConstructor(options_.comparator); break; } } ~Harness() { delete constructor_; } void Add(const std::string& key, const std::string& value) { constructor_->Add(key, value); } void Test(Random* rnd) { std::vector keys; KVMap data; constructor_->Finish(options_, &keys, &data); TestForwardScan(keys, data); TestBackwardScan(keys, data); TestRandomAccess(rnd, keys, data); } void TestForwardScan(const std::vector& keys, const KVMap& data) { Iterator* iter = constructor_->NewIterator(); ASSERT_TRUE(!iter->Valid()); iter->SeekToFirst(); for (KVMap::const_iterator model_iter = data.begin(); model_iter != data.end(); ++model_iter) { ASSERT_EQ(ToString(data, model_iter), ToString(iter)); iter->Next(); } ASSERT_TRUE(!iter->Valid()); delete iter; } void TestBackwardScan(const std::vector& keys, const KVMap& data) { Iterator* iter = constructor_->NewIterator(); ASSERT_TRUE(!iter->Valid()); iter->SeekToLast(); for (KVMap::const_reverse_iterator model_iter = data.rbegin(); model_iter != data.rend(); ++model_iter) { ASSERT_EQ(ToString(data, model_iter), ToString(iter)); iter->Prev(); } ASSERT_TRUE(!iter->Valid()); delete iter; } void TestRandomAccess(Random* rnd, const std::vector& keys, const KVMap& data) { static const bool kVerbose = false; Iterator* iter = constructor_->NewIterator(); ASSERT_TRUE(!iter->Valid()); KVMap::const_iterator model_iter = data.begin(); if (kVerbose) fprintf(stderr, "---\n"); for (int i = 0; i < 200; i++) { const int toss = rnd->Uniform(5); switch (toss) { case 0: { if (iter->Valid()) { if (kVerbose) fprintf(stderr, "Next\n"); iter->Next(); ++model_iter; ASSERT_EQ(ToString(data, model_iter), ToString(iter)); } break; } case 1: { if (kVerbose) fprintf(stderr, "SeekToFirst\n"); iter->SeekToFirst(); model_iter = data.begin(); ASSERT_EQ(ToString(data, model_iter), ToString(iter)); break; } case 2: { std::string key = PickRandomKey(rnd, keys); model_iter = data.lower_bound(key); if (kVerbose) fprintf(stderr, "Seek '%s'\n", EscapeString(key).c_str()); iter->Seek(Slice(key)); ASSERT_EQ(ToString(data, model_iter), ToString(iter)); break; } case 3: { if (iter->Valid()) { if (kVerbose) fprintf(stderr, "Prev\n"); iter->Prev(); if (model_iter == data.begin()) { model_iter = data.end(); // Wrap around to invalid value } else { --model_iter; } ASSERT_EQ(ToString(data, model_iter), ToString(iter)); } break; } case 4: { if (kVerbose) fprintf(stderr, "SeekToLast\n"); iter->SeekToLast(); if (keys.empty()) { model_iter = data.end(); } else { std::string last = data.rbegin()->first; model_iter = data.lower_bound(last); } ASSERT_EQ(ToString(data, model_iter), ToString(iter)); break; } } } delete iter; } std::string ToString(const KVMap& data, const KVMap::const_iterator& it) { if (it == data.end()) { return "END"; } else { return "'" + it->first + "->" + it->second + "'"; } } std::string ToString(const KVMap& data, const KVMap::const_reverse_iterator& it) { if (it == data.rend()) { return "END"; } else { return "'" + it->first + "->" + it->second + "'"; } } std::string ToString(const Iterator* it) { if (!it->Valid()) { return "END"; } else { return "'" + it->key().ToString() + "->" + it->value().ToString() + "'"; } } std::string PickRandomKey(Random* rnd, const std::vector& keys) { if (keys.empty()) { return "foo"; } else { const int index = rnd->Uniform(keys.size()); std::string result = keys[index]; switch (rnd->Uniform(3)) { case 0: // Return an existing key break; case 1: { // Attempt to return something smaller than an existing key if (result.size() > 0 && result[result.size()-1] > '\0') { result[result.size()-1]--; } break; } case 2: { // Return something larger than an existing key Increment(options_.comparator, &result); break; } } return result; } } // Returns NULL if not running against a DB DB* db() const { return constructor_->db(); } private: Options options_; Constructor* constructor_; }; // Test empty table/block. TEST(Harness, Empty) { for (int i = 0; i < kNumTestArgs; i++) { Init(kTestArgList[i]); Random rnd(test::RandomSeed() + 1); Test(&rnd); } } // Special test for a block with no restart entries. The C++ leveldb // code never generates such blocks, but the Java version of leveldb // seems to. TEST(Harness, ZeroRestartPointsInBlock) { char data[sizeof(uint32_t)]; memset(data, 0, sizeof(data)); BlockContents contents; contents.data = Slice(data, sizeof(data)); contents.cachable = false; contents.heap_allocated = false; Block block(contents); Iterator* iter = block.NewIterator(BytewiseComparator()); iter->SeekToFirst(); ASSERT_TRUE(!iter->Valid()); iter->SeekToLast(); ASSERT_TRUE(!iter->Valid()); iter->Seek("foo"); ASSERT_TRUE(!iter->Valid()); delete iter; } // Test the empty key TEST(Harness, SimpleEmptyKey) { for (int i = 0; i < kNumTestArgs; i++) { Init(kTestArgList[i]); Random rnd(test::RandomSeed() + 1); Add("", "v"); Test(&rnd); } } TEST(Harness, SimpleSingle) { for (int i = 0; i < kNumTestArgs; i++) { Init(kTestArgList[i]); Random rnd(test::RandomSeed() + 2); Add("abc", "v"); Test(&rnd); } } TEST(Harness, SimpleMulti) { for (int i = 0; i < kNumTestArgs; i++) { Init(kTestArgList[i]); Random rnd(test::RandomSeed() + 3); Add("abc", "v"); Add("abcd", "v"); Add("ac", "v2"); Test(&rnd); } } TEST(Harness, SimpleSpecialKey) { for (int i = 0; i < kNumTestArgs; i++) { Init(kTestArgList[i]); Random rnd(test::RandomSeed() + 4); Add("\xff\xff", "v3"); Test(&rnd); } } TEST(Harness, Randomized) { for (int i = 0; i < kNumTestArgs; i++) { Init(kTestArgList[i]); Random rnd(test::RandomSeed() + 5); for (int num_entries = 0; num_entries < 2000; num_entries += (num_entries < 50 ? 1 : 200)) { if ((num_entries % 10) == 0) { fprintf(stderr, "case %d of %d: num_entries = %d\n", (i + 1), int(kNumTestArgs), num_entries); } for (int e = 0; e < num_entries; e++) { std::string v; Add(test::RandomKey(&rnd, rnd.Skewed(4)), test::RandomString(&rnd, rnd.Skewed(5), &v).ToString()); } Test(&rnd); } } } TEST(Harness, RandomizedLongDB) { Random rnd(test::RandomSeed()); TestArgs args = { DB_TEST, false, 16 }; Init(args); int num_entries = 100000; for (int e = 0; e < num_entries; e++) { std::string v; Add(test::RandomKey(&rnd, rnd.Skewed(4)), test::RandomString(&rnd, rnd.Skewed(5), &v).ToString()); } Test(&rnd); // We must have created enough data to force merging int files = 0; for (int level = 0; level < config::kNumLevels; level++) { std::string value; char name[100]; snprintf(name, sizeof(name), "leveldb.num-files-at-level%d", level); ASSERT_TRUE(db()->GetProperty(name, &value)); files += atoi(value.c_str()); } ASSERT_GT(files, 0); } class MemTableTest { }; TEST(MemTableTest, Simple) { InternalKeyComparator cmp(BytewiseComparator()); MemTable* memtable = new MemTable(cmp); memtable->Ref(); WriteBatch batch; WriteBatchInternal::SetSequence(&batch, 100); batch.Put(std::string("k1"), std::string("v1")); batch.Put(std::string("k2"), std::string("v2")); batch.Put(std::string("k3"), std::string("v3")); batch.Put(std::string("largekey"), std::string("vlarge")); ASSERT_TRUE(WriteBatchInternal::InsertInto(&batch, memtable).ok()); Iterator* iter = memtable->NewIterator(); iter->SeekToFirst(); while (iter->Valid()) { fprintf(stderr, "key: '%s' -> '%s'\n", iter->key().ToString().c_str(), iter->value().ToString().c_str()); iter->Next(); } delete iter; memtable->Unref(); } static bool Between(uint64_t val, uint64_t low, uint64_t high) { bool result = (val >= low) && (val <= high); if (!result) { fprintf(stderr, "Value %llu is not in range [%llu, %llu]\n", (unsigned long long)(val), (unsigned long long)(low), (unsigned long long)(high)); } return result; } class TableTest { }; TEST(TableTest, ApproximateOffsetOfPlain) { TableConstructor c(BytewiseComparator()); c.Add("k01", "hello"); c.Add("k02", "hello2"); c.Add("k03", std::string(10000, 'x')); c.Add("k04", std::string(200000, 'x')); c.Add("k05", std::string(300000, 'x')); c.Add("k06", "hello3"); c.Add("k07", std::string(100000, 'x')); std::vector keys; KVMap kvmap; Options options; options.block_size = 1024; options.compression = kNoCompression; c.Finish(options, &keys, &kvmap); ASSERT_TRUE(Between(c.ApproximateOffsetOf("abc"), 0, 0)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("k01"), 0, 0)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("k01a"), 0, 0)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("k02"), 0, 0)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("k03"), 0, 0)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("k04"), 10000, 11000)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("k04a"), 210000, 211000)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("k05"), 210000, 211000)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("k06"), 510000, 511000)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("k07"), 510000, 511000)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("xyz"), 610000, 612000)); } static bool SnappyCompressionSupported() { std::string out; Slice in = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"; return port::Snappy_Compress(in.data(), in.size(), &out); } TEST(TableTest, ApproximateOffsetOfCompressed) { if (!SnappyCompressionSupported()) { fprintf(stderr, "skipping compression tests\n"); return; } Random rnd(301); TableConstructor c(BytewiseComparator()); std::string tmp; c.Add("k01", "hello"); c.Add("k02", test::CompressibleString(&rnd, 0.25, 10000, &tmp)); c.Add("k03", "hello3"); c.Add("k04", test::CompressibleString(&rnd, 0.25, 10000, &tmp)); std::vector keys; KVMap kvmap; Options options; options.block_size = 1024; options.compression = kSnappyCompression; c.Finish(options, &keys, &kvmap); ASSERT_TRUE(Between(c.ApproximateOffsetOf("abc"), 0, 0)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("k01"), 0, 0)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("k02"), 0, 0)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("k03"), 2000, 3000)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("k04"), 2000, 3000)); ASSERT_TRUE(Between(c.ApproximateOffsetOf("xyz"), 4000, 6000)); } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/table/table.cc0000644000000000000000000001777312414772654020034 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/table.h" #include "leveldb/cache.h" #include "leveldb/comparator.h" #include "leveldb/env.h" #include "leveldb/filter_policy.h" #include "leveldb/options.h" #include "table/block.h" #include "table/filter_block.h" #include "table/format.h" #include "table/two_level_iterator.h" #include "util/coding.h" namespace leveldb { struct Table::Rep { ~Rep() { delete filter; delete [] filter_data; delete index_block; } Options options; Status status; RandomAccessFile* file; uint64_t cache_id; FilterBlockReader* filter; const char* filter_data; BlockHandle metaindex_handle; // Handle to metaindex_block: saved from footer Block* index_block; }; Status Table::Open(const Options& options, RandomAccessFile* file, uint64_t size, Table** table) { *table = NULL; if (size < Footer::kEncodedLength) { return Status::InvalidArgument("file is too short to be an sstable"); } char footer_space[Footer::kEncodedLength]; Slice footer_input; Status s = file->Read(size - Footer::kEncodedLength, Footer::kEncodedLength, &footer_input, footer_space); if (!s.ok()) return s; Footer footer; s = footer.DecodeFrom(&footer_input); if (!s.ok()) return s; // Read the index block BlockContents contents; Block* index_block = NULL; if (s.ok()) { s = ReadBlock(file, ReadOptions(), footer.index_handle(), &contents); if (s.ok()) { index_block = new Block(contents); } } if (s.ok()) { // We've successfully read the footer and the index block: we're // ready to serve requests. Rep* rep = new Table::Rep; rep->options = options; rep->file = file; rep->metaindex_handle = footer.metaindex_handle(); rep->index_block = index_block; rep->cache_id = (options.block_cache ? options.block_cache->NewId() : 0); rep->filter_data = NULL; rep->filter = NULL; *table = new Table(rep); (*table)->ReadMeta(footer); } else { if (index_block) delete index_block; } return s; } void Table::ReadMeta(const Footer& footer) { if (rep_->options.filter_policy == NULL) { return; // Do not need any metadata } // TODO(sanjay): Skip this if footer.metaindex_handle() size indicates // it is an empty block. ReadOptions opt; BlockContents contents; if (!ReadBlock(rep_->file, opt, footer.metaindex_handle(), &contents).ok()) { // Do not propagate errors since meta info is not needed for operation return; } Block* meta = new Block(contents); Iterator* iter = meta->NewIterator(BytewiseComparator()); std::string key = "filter."; key.append(rep_->options.filter_policy->Name()); iter->Seek(key); if (iter->Valid() && iter->key() == Slice(key)) { ReadFilter(iter->value()); } delete iter; delete meta; } void Table::ReadFilter(const Slice& filter_handle_value) { Slice v = filter_handle_value; BlockHandle filter_handle; if (!filter_handle.DecodeFrom(&v).ok()) { return; } // We might want to unify with ReadBlock() if we start // requiring checksum verification in Table::Open. ReadOptions opt; BlockContents block; if (!ReadBlock(rep_->file, opt, filter_handle, &block).ok()) { return; } if (block.heap_allocated) { rep_->filter_data = block.data.data(); // Will need to delete later } rep_->filter = new FilterBlockReader(rep_->options.filter_policy, block.data); } Table::~Table() { delete rep_; } static void DeleteBlock(void* arg, void* ignored) { delete reinterpret_cast(arg); } static void DeleteCachedBlock(const Slice& key, void* value) { Block* block = reinterpret_cast(value); delete block; } static void ReleaseBlock(void* arg, void* h) { Cache* cache = reinterpret_cast(arg); Cache::Handle* handle = reinterpret_cast(h); cache->Release(handle); } // Convert an index iterator value (i.e., an encoded BlockHandle) // into an iterator over the contents of the corresponding block. Iterator* Table::BlockReader(void* arg, const ReadOptions& options, const Slice& index_value) { Table* table = reinterpret_cast(arg); Cache* block_cache = table->rep_->options.block_cache; Block* block = NULL; Cache::Handle* cache_handle = NULL; BlockHandle handle; Slice input = index_value; Status s = handle.DecodeFrom(&input); // We intentionally allow extra stuff in index_value so that we // can add more features in the future. if (s.ok()) { BlockContents contents; if (block_cache != NULL) { char cache_key_buffer[16]; EncodeFixed64(cache_key_buffer, table->rep_->cache_id); EncodeFixed64(cache_key_buffer+8, handle.offset()); Slice key(cache_key_buffer, sizeof(cache_key_buffer)); cache_handle = block_cache->Lookup(key); if (cache_handle != NULL) { block = reinterpret_cast(block_cache->Value(cache_handle)); } else { s = ReadBlock(table->rep_->file, options, handle, &contents); if (s.ok()) { block = new Block(contents); if (contents.cachable && options.fill_cache) { cache_handle = block_cache->Insert( key, block, block->size(), &DeleteCachedBlock); } } } } else { s = ReadBlock(table->rep_->file, options, handle, &contents); if (s.ok()) { block = new Block(contents); } } } Iterator* iter; if (block != NULL) { iter = block->NewIterator(table->rep_->options.comparator); if (cache_handle == NULL) { iter->RegisterCleanup(&DeleteBlock, block, NULL); } else { iter->RegisterCleanup(&ReleaseBlock, block_cache, cache_handle); } } else { iter = NewErrorIterator(s); } return iter; } Iterator* Table::NewIterator(const ReadOptions& options) const { return NewTwoLevelIterator( rep_->index_block->NewIterator(rep_->options.comparator), &Table::BlockReader, const_cast(this), options); } Status Table::InternalGet(const ReadOptions& options, const Slice& k, void* arg, void (*saver)(void*, const Slice&, const Slice&)) { Status s; Iterator* iiter = rep_->index_block->NewIterator(rep_->options.comparator); iiter->Seek(k); if (iiter->Valid()) { Slice handle_value = iiter->value(); FilterBlockReader* filter = rep_->filter; BlockHandle handle; if (filter != NULL && handle.DecodeFrom(&handle_value).ok() && !filter->KeyMayMatch(handle.offset(), k)) { // Not found } else { Iterator* block_iter = BlockReader(this, options, iiter->value()); block_iter->Seek(k); if (block_iter->Valid()) { (*saver)(arg, block_iter->key(), block_iter->value()); } s = block_iter->status(); delete block_iter; } } if (s.ok()) { s = iiter->status(); } delete iiter; return s; } uint64_t Table::ApproximateOffsetOf(const Slice& key) const { Iterator* index_iter = rep_->index_block->NewIterator(rep_->options.comparator); index_iter->Seek(key); uint64_t result; if (index_iter->Valid()) { BlockHandle handle; Slice input = index_iter->value(); Status s = handle.DecodeFrom(&input); if (s.ok()) { result = handle.offset(); } else { // Strange: we can't decode the block handle in the index block. // We'll just return the offset of the metaindex block, which is // close to the whole file size for this case. result = rep_->metaindex_handle.offset(); } } else { // key is past the last key in the file. Approximate the offset // by returning the offset of the metaindex block (which is // right near the end of the file). result = rep_->metaindex_handle.offset(); } delete index_iter; return result; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/table/iterator.cc0000644000000000000000000000324612414772654020564 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "leveldb/iterator.h" namespace leveldb { Iterator::Iterator() { cleanup_.function = NULL; cleanup_.next = NULL; } Iterator::~Iterator() { if (cleanup_.function != NULL) { (*cleanup_.function)(cleanup_.arg1, cleanup_.arg2); for (Cleanup* c = cleanup_.next; c != NULL; ) { (*c->function)(c->arg1, c->arg2); Cleanup* next = c->next; delete c; c = next; } } } void Iterator::RegisterCleanup(CleanupFunction func, void* arg1, void* arg2) { assert(func != NULL); Cleanup* c; if (cleanup_.function == NULL) { c = &cleanup_; } else { c = new Cleanup; c->next = cleanup_.next; cleanup_.next = c; } c->function = func; c->arg1 = arg1; c->arg2 = arg2; } namespace { class EmptyIterator : public Iterator { public: EmptyIterator(const Status& s) : status_(s) { } virtual bool Valid() const { return false; } virtual void Seek(const Slice& target) { } virtual void SeekToFirst() { } virtual void SeekToLast() { } virtual void Next() { assert(false); } virtual void Prev() { assert(false); } Slice key() const { assert(false); return Slice(); } Slice value() const { assert(false); return Slice(); } virtual Status status() const { return status_; } private: Status status_; }; } // namespace Iterator* NewEmptyIterator() { return new EmptyIterator(Status::OK()); } Iterator* NewErrorIterator(const Status& status) { return new EmptyIterator(status); } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/table/format.cc0000644000000000000000000001075312414772654020224 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "table/format.h" #include "leveldb/env.h" #include "port/port.h" #include "table/block.h" #include "util/coding.h" #include "util/crc32c.h" namespace leveldb { void BlockHandle::EncodeTo(std::string* dst) const { // Sanity check that all fields have been set assert(offset_ != ~static_cast(0)); assert(size_ != ~static_cast(0)); PutVarint64(dst, offset_); PutVarint64(dst, size_); } Status BlockHandle::DecodeFrom(Slice* input) { if (GetVarint64(input, &offset_) && GetVarint64(input, &size_)) { return Status::OK(); } else { return Status::Corruption("bad block handle"); } } void Footer::EncodeTo(std::string* dst) const { #ifndef NDEBUG const size_t original_size = dst->size(); #endif metaindex_handle_.EncodeTo(dst); index_handle_.EncodeTo(dst); dst->resize(2 * BlockHandle::kMaxEncodedLength); // Padding PutFixed32(dst, static_cast(kTableMagicNumber & 0xffffffffu)); PutFixed32(dst, static_cast(kTableMagicNumber >> 32)); assert(dst->size() == original_size + kEncodedLength); } Status Footer::DecodeFrom(Slice* input) { const char* magic_ptr = input->data() + kEncodedLength - 8; const uint32_t magic_lo = DecodeFixed32(magic_ptr); const uint32_t magic_hi = DecodeFixed32(magic_ptr + 4); const uint64_t magic = ((static_cast(magic_hi) << 32) | (static_cast(magic_lo))); if (magic != kTableMagicNumber) { return Status::InvalidArgument("not an sstable (bad magic number)"); } Status result = metaindex_handle_.DecodeFrom(input); if (result.ok()) { result = index_handle_.DecodeFrom(input); } if (result.ok()) { // We skip over any leftover data (just padding for now) in "input" const char* end = magic_ptr + 8; *input = Slice(end, input->data() + input->size() - end); } return result; } Status ReadBlock(RandomAccessFile* file, const ReadOptions& options, const BlockHandle& handle, BlockContents* result) { result->data = Slice(); result->cachable = false; result->heap_allocated = false; // Read the block contents as well as the type/crc footer. // See table_builder.cc for the code that built this structure. size_t n = static_cast(handle.size()); char* buf = new char[n + kBlockTrailerSize]; Slice contents; Status s = file->Read(handle.offset(), n + kBlockTrailerSize, &contents, buf); if (!s.ok()) { delete[] buf; return s; } if (contents.size() != n + kBlockTrailerSize) { delete[] buf; return Status::Corruption("truncated block read"); } // Check the crc of the type and the block contents const char* data = contents.data(); // Pointer to where Read put the data if (options.verify_checksums) { const uint32_t crc = crc32c::Unmask(DecodeFixed32(data + n + 1)); const uint32_t actual = crc32c::Value(data, n + 1); if (actual != crc) { delete[] buf; s = Status::Corruption("block checksum mismatch"); return s; } } switch (data[n]) { case kNoCompression: if (data != buf) { // File implementation gave us pointer to some other data. // Use it directly under the assumption that it will be live // while the file is open. delete[] buf; result->data = Slice(data, n); result->heap_allocated = false; result->cachable = false; // Do not double-cache } else { result->data = Slice(buf, n); result->heap_allocated = true; result->cachable = true; } // Ok break; case kSnappyCompression: { size_t ulength = 0; if (!port::Snappy_GetUncompressedLength(data, n, &ulength)) { delete[] buf; return Status::Corruption("corrupted compressed block contents"); } char* ubuf = new char[ulength]; if (!port::Snappy_Uncompress(data, n, ubuf)) { delete[] buf; delete[] ubuf; return Status::Corruption("corrupted compressed block contents"); } delete[] buf; result->data = Slice(ubuf, ulength); result->heap_allocated = true; result->cachable = true; break; } default: delete[] buf; return Status::Corruption("bad block type"); } return Status::OK(); } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/table/block.h0000644000000000000000000000201212414772654017655 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_TABLE_BLOCK_H_ #define STORAGE_LEVELDB_TABLE_BLOCK_H_ #include #include #include "leveldb/iterator.h" namespace leveldb { struct BlockContents; class Comparator; class Block { public: // Initialize the block with the specified contents. explicit Block(const BlockContents& contents); ~Block(); size_t size() const { return size_; } Iterator* NewIterator(const Comparator* comparator); private: uint32_t NumRestarts() const; const char* data_; size_t size_; uint32_t restart_offset_; // Offset in data_ of restart array bool owned_; // Block owns data_[] // No copying allowed Block(const Block&); void operator=(const Block&); class Iter; }; } // namespace leveldb #endif // STORAGE_LEVELDB_TABLE_BLOCK_H_ armory-0.92.3/cppForSwig/leveldb/table/iterator_wrapper.h0000644000000000000000000000375712414772654022175 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_TABLE_ITERATOR_WRAPPER_H_ #define STORAGE_LEVELDB_TABLE_ITERATOR_WRAPPER_H_ namespace leveldb { // A internal wrapper class with an interface similar to Iterator that // caches the valid() and key() results for an underlying iterator. // This can help avoid virtual function calls and also gives better // cache locality. class IteratorWrapper { public: IteratorWrapper(): iter_(NULL), valid_(false) { } explicit IteratorWrapper(Iterator* iter): iter_(NULL) { Set(iter); } ~IteratorWrapper() { delete iter_; } Iterator* iter() const { return iter_; } // Takes ownership of "iter" and will delete it when destroyed, or // when Set() is invoked again. void Set(Iterator* iter) { delete iter_; iter_ = iter; if (iter_ == NULL) { valid_ = false; } else { Update(); } } // Iterator interface methods bool Valid() const { return valid_; } Slice key() const { assert(Valid()); return key_; } Slice value() const { assert(Valid()); return iter_->value(); } // Methods below require iter() != NULL Status status() const { assert(iter_); return iter_->status(); } void Next() { assert(iter_); iter_->Next(); Update(); } void Prev() { assert(iter_); iter_->Prev(); Update(); } void Seek(const Slice& k) { assert(iter_); iter_->Seek(k); Update(); } void SeekToFirst() { assert(iter_); iter_->SeekToFirst(); Update(); } void SeekToLast() { assert(iter_); iter_->SeekToLast(); Update(); } private: void Update() { valid_ = iter_->Valid(); if (valid_) { key_ = iter_->key(); } } Iterator* iter_; bool valid_; Slice key_; }; } // namespace leveldb #endif // STORAGE_LEVELDB_TABLE_ITERATOR_WRAPPER_H_ armory-0.92.3/cppForSwig/leveldb/table/two_level_iterator.cc0000644000000000000000000001113612414772654022641 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "table/two_level_iterator.h" #include "leveldb/table.h" #include "table/block.h" #include "table/format.h" #include "table/iterator_wrapper.h" namespace leveldb { namespace { typedef Iterator* (*BlockFunction)(void*, const ReadOptions&, const Slice&); class TwoLevelIterator: public Iterator { public: TwoLevelIterator( Iterator* index_iter, BlockFunction block_function, void* arg, const ReadOptions& options); virtual ~TwoLevelIterator(); virtual void Seek(const Slice& target); virtual void SeekToFirst(); virtual void SeekToLast(); virtual void Next(); virtual void Prev(); virtual bool Valid() const { return data_iter_.Valid(); } virtual Slice key() const { assert(Valid()); return data_iter_.key(); } virtual Slice value() const { assert(Valid()); return data_iter_.value(); } virtual Status status() const { // It'd be nice if status() returned a const Status& instead of a Status if (!index_iter_.status().ok()) { return index_iter_.status(); } else if (data_iter_.iter() != NULL && !data_iter_.status().ok()) { return data_iter_.status(); } else { return status_; } } private: void SaveError(const Status& s) { if (status_.ok() && !s.ok()) status_ = s; } void SkipEmptyDataBlocksForward(); void SkipEmptyDataBlocksBackward(); void SetDataIterator(Iterator* data_iter); void InitDataBlock(); BlockFunction block_function_; void* arg_; const ReadOptions options_; Status status_; IteratorWrapper index_iter_; IteratorWrapper data_iter_; // May be NULL // If data_iter_ is non-NULL, then "data_block_handle_" holds the // "index_value" passed to block_function_ to create the data_iter_. std::string data_block_handle_; }; TwoLevelIterator::TwoLevelIterator( Iterator* index_iter, BlockFunction block_function, void* arg, const ReadOptions& options) : block_function_(block_function), arg_(arg), options_(options), index_iter_(index_iter), data_iter_(NULL) { } TwoLevelIterator::~TwoLevelIterator() { } void TwoLevelIterator::Seek(const Slice& target) { index_iter_.Seek(target); InitDataBlock(); if (data_iter_.iter() != NULL) data_iter_.Seek(target); SkipEmptyDataBlocksForward(); } void TwoLevelIterator::SeekToFirst() { index_iter_.SeekToFirst(); InitDataBlock(); if (data_iter_.iter() != NULL) data_iter_.SeekToFirst(); SkipEmptyDataBlocksForward(); } void TwoLevelIterator::SeekToLast() { index_iter_.SeekToLast(); InitDataBlock(); if (data_iter_.iter() != NULL) data_iter_.SeekToLast(); SkipEmptyDataBlocksBackward(); } void TwoLevelIterator::Next() { assert(Valid()); data_iter_.Next(); SkipEmptyDataBlocksForward(); } void TwoLevelIterator::Prev() { assert(Valid()); data_iter_.Prev(); SkipEmptyDataBlocksBackward(); } void TwoLevelIterator::SkipEmptyDataBlocksForward() { while (data_iter_.iter() == NULL || !data_iter_.Valid()) { // Move to next block if (!index_iter_.Valid()) { SetDataIterator(NULL); return; } index_iter_.Next(); InitDataBlock(); if (data_iter_.iter() != NULL) data_iter_.SeekToFirst(); } } void TwoLevelIterator::SkipEmptyDataBlocksBackward() { while (data_iter_.iter() == NULL || !data_iter_.Valid()) { // Move to next block if (!index_iter_.Valid()) { SetDataIterator(NULL); return; } index_iter_.Prev(); InitDataBlock(); if (data_iter_.iter() != NULL) data_iter_.SeekToLast(); } } void TwoLevelIterator::SetDataIterator(Iterator* data_iter) { if (data_iter_.iter() != NULL) SaveError(data_iter_.status()); data_iter_.Set(data_iter); } void TwoLevelIterator::InitDataBlock() { if (!index_iter_.Valid()) { SetDataIterator(NULL); } else { Slice handle = index_iter_.value(); if (data_iter_.iter() != NULL && handle.compare(data_block_handle_) == 0) { // data_iter_ is already constructed with this iterator, so // no need to change anything } else { Iterator* iter = (*block_function_)(arg_, options_, handle); data_block_handle_.assign(handle.data(), handle.size()); SetDataIterator(iter); } } } } // namespace Iterator* NewTwoLevelIterator( Iterator* index_iter, BlockFunction block_function, void* arg, const ReadOptions& options) { return new TwoLevelIterator(index_iter, block_function, arg, options); } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/table/filter_block_test.cc0000644000000000000000000000715312414772654022432 0ustar rootroot// Copyright (c) 2012 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "table/filter_block.h" #include "leveldb/filter_policy.h" #include "util/coding.h" #include "util/hash.h" #include "util/logging.h" #include "util/testharness.h" #include "util/testutil.h" namespace leveldb { // For testing: emit an array with one hash value per key class TestHashFilter : public FilterPolicy { public: virtual const char* Name() const { return "TestHashFilter"; } virtual void CreateFilter(const Slice* keys, int n, std::string* dst) const { for (int i = 0; i < n; i++) { uint32_t h = Hash(keys[i].data(), keys[i].size(), 1); PutFixed32(dst, h); } } virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const { uint32_t h = Hash(key.data(), key.size(), 1); for (size_t i = 0; i + 4 <= filter.size(); i += 4) { if (h == DecodeFixed32(filter.data() + i)) { return true; } } return false; } }; class FilterBlockTest { public: TestHashFilter policy_; }; TEST(FilterBlockTest, EmptyBuilder) { FilterBlockBuilder builder(&policy_); Slice block = builder.Finish(); ASSERT_EQ("\\x00\\x00\\x00\\x00\\x0b", EscapeString(block)); FilterBlockReader reader(&policy_, block); ASSERT_TRUE(reader.KeyMayMatch(0, "foo")); ASSERT_TRUE(reader.KeyMayMatch(100000, "foo")); } TEST(FilterBlockTest, SingleChunk) { FilterBlockBuilder builder(&policy_); builder.StartBlock(100); builder.AddKey("foo"); builder.AddKey("bar"); builder.AddKey("box"); builder.StartBlock(200); builder.AddKey("box"); builder.StartBlock(300); builder.AddKey("hello"); Slice block = builder.Finish(); FilterBlockReader reader(&policy_, block); ASSERT_TRUE(reader.KeyMayMatch(100, "foo")); ASSERT_TRUE(reader.KeyMayMatch(100, "bar")); ASSERT_TRUE(reader.KeyMayMatch(100, "box")); ASSERT_TRUE(reader.KeyMayMatch(100, "hello")); ASSERT_TRUE(reader.KeyMayMatch(100, "foo")); ASSERT_TRUE(! reader.KeyMayMatch(100, "missing")); ASSERT_TRUE(! reader.KeyMayMatch(100, "other")); } TEST(FilterBlockTest, MultiChunk) { FilterBlockBuilder builder(&policy_); // First filter builder.StartBlock(0); builder.AddKey("foo"); builder.StartBlock(2000); builder.AddKey("bar"); // Second filter builder.StartBlock(3100); builder.AddKey("box"); // Third filter is empty // Last filter builder.StartBlock(9000); builder.AddKey("box"); builder.AddKey("hello"); Slice block = builder.Finish(); FilterBlockReader reader(&policy_, block); // Check first filter ASSERT_TRUE(reader.KeyMayMatch(0, "foo")); ASSERT_TRUE(reader.KeyMayMatch(2000, "bar")); ASSERT_TRUE(! reader.KeyMayMatch(0, "box")); ASSERT_TRUE(! reader.KeyMayMatch(0, "hello")); // Check second filter ASSERT_TRUE(reader.KeyMayMatch(3100, "box")); ASSERT_TRUE(! reader.KeyMayMatch(3100, "foo")); ASSERT_TRUE(! reader.KeyMayMatch(3100, "bar")); ASSERT_TRUE(! reader.KeyMayMatch(3100, "hello")); // Check third filter (empty) ASSERT_TRUE(! reader.KeyMayMatch(4100, "foo")); ASSERT_TRUE(! reader.KeyMayMatch(4100, "bar")); ASSERT_TRUE(! reader.KeyMayMatch(4100, "box")); ASSERT_TRUE(! reader.KeyMayMatch(4100, "hello")); // Check last filter ASSERT_TRUE(reader.KeyMayMatch(9000, "box")); ASSERT_TRUE(reader.KeyMayMatch(9000, "hello")); ASSERT_TRUE(! reader.KeyMayMatch(9000, "foo")); ASSERT_TRUE(! reader.KeyMayMatch(9000, "bar")); } } // namespace leveldb int main(int argc, char** argv) { return leveldb::test::RunAllTests(); } armory-0.92.3/cppForSwig/leveldb/table/format.h0000644000000000000000000000610612414772654020063 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_TABLE_FORMAT_H_ #define STORAGE_LEVELDB_TABLE_FORMAT_H_ #include #include #include "leveldb/slice.h" #include "leveldb/status.h" #include "leveldb/table_builder.h" namespace leveldb { class Block; class RandomAccessFile; struct ReadOptions; // BlockHandle is a pointer to the extent of a file that stores a data // block or a meta block. class BlockHandle { public: BlockHandle(); // The offset of the block in the file. uint64_t offset() const { return offset_; } void set_offset(uint64_t offset) { offset_ = offset; } // The size of the stored block uint64_t size() const { return size_; } void set_size(uint64_t size) { size_ = size; } void EncodeTo(std::string* dst) const; Status DecodeFrom(Slice* input); // Maximum encoding length of a BlockHandle enum { kMaxEncodedLength = 10 + 10 }; private: uint64_t offset_; uint64_t size_; }; // Footer encapsulates the fixed information stored at the tail // end of every table file. class Footer { public: Footer() { } // The block handle for the metaindex block of the table const BlockHandle& metaindex_handle() const { return metaindex_handle_; } void set_metaindex_handle(const BlockHandle& h) { metaindex_handle_ = h; } // The block handle for the index block of the table const BlockHandle& index_handle() const { return index_handle_; } void set_index_handle(const BlockHandle& h) { index_handle_ = h; } void EncodeTo(std::string* dst) const; Status DecodeFrom(Slice* input); // Encoded length of a Footer. Note that the serialization of a // Footer will always occupy exactly this many bytes. It consists // of two block handles and a magic number. enum { kEncodedLength = 2*BlockHandle::kMaxEncodedLength + 8 }; private: BlockHandle metaindex_handle_; BlockHandle index_handle_; }; // kTableMagicNumber was picked by running // echo http://code.google.com/p/leveldb/ | sha1sum // and taking the leading 64 bits. static const uint64_t kTableMagicNumber = 0xdb4775248b80fb57ull; // 1-byte type + 32-bit crc static const size_t kBlockTrailerSize = 5; struct BlockContents { Slice data; // Actual contents of data bool cachable; // True iff data can be cached bool heap_allocated; // True iff caller should delete[] data.data() }; // Read the block identified by "handle" from "file". On failure // return non-OK. On success fill *result and return OK. extern Status ReadBlock(RandomAccessFile* file, const ReadOptions& options, const BlockHandle& handle, BlockContents* result); // Implementation details follow. Clients should ignore, inline BlockHandle::BlockHandle() : offset_(~static_cast(0)), size_(~static_cast(0)) { } } // namespace leveldb #endif // STORAGE_LEVELDB_TABLE_FORMAT_H_ armory-0.92.3/cppForSwig/leveldb/table/block.cc0000644000000000000000000001761712414772654020034 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // Decodes the blocks generated by block_builder.cc. #include "table/block.h" #include #include #include "leveldb/comparator.h" #include "table/format.h" #include "util/coding.h" #include "util/logging.h" namespace leveldb { inline uint32_t Block::NumRestarts() const { assert(size_ >= sizeof(uint32_t)); return DecodeFixed32(data_ + size_ - sizeof(uint32_t)); } Block::Block(const BlockContents& contents) : data_(contents.data.data()), size_(contents.data.size()), owned_(contents.heap_allocated) { if (size_ < sizeof(uint32_t)) { size_ = 0; // Error marker } else { size_t max_restarts_allowed = (size_-sizeof(uint32_t)) / sizeof(uint32_t); if (NumRestarts() > max_restarts_allowed) { // The size is too small for NumRestarts() size_ = 0; } else { restart_offset_ = size_ - (1 + NumRestarts()) * sizeof(uint32_t); } } } Block::~Block() { if (owned_) { delete[] data_; } } // Helper routine: decode the next block entry starting at "p", // storing the number of shared key bytes, non_shared key bytes, // and the length of the value in "*shared", "*non_shared", and // "*value_length", respectively. Will not derefence past "limit". // // If any errors are detected, returns NULL. Otherwise, returns a // pointer to the key delta (just past the three decoded values). static inline const char* DecodeEntry(const char* p, const char* limit, uint32_t* shared, uint32_t* non_shared, uint32_t* value_length) { if (limit - p < 3) return NULL; *shared = reinterpret_cast(p)[0]; *non_shared = reinterpret_cast(p)[1]; *value_length = reinterpret_cast(p)[2]; if ((*shared | *non_shared | *value_length) < 128) { // Fast path: all three values are encoded in one byte each p += 3; } else { if ((p = GetVarint32Ptr(p, limit, shared)) == NULL) return NULL; if ((p = GetVarint32Ptr(p, limit, non_shared)) == NULL) return NULL; if ((p = GetVarint32Ptr(p, limit, value_length)) == NULL) return NULL; } if (static_cast(limit - p) < (*non_shared + *value_length)) { return NULL; } return p; } class Block::Iter : public Iterator { private: const Comparator* const comparator_; const char* const data_; // underlying block contents uint32_t const restarts_; // Offset of restart array (list of fixed32) uint32_t const num_restarts_; // Number of uint32_t entries in restart array // current_ is offset in data_ of current entry. >= restarts_ if !Valid uint32_t current_; uint32_t restart_index_; // Index of restart block in which current_ falls std::string key_; Slice value_; Status status_; inline int Compare(const Slice& a, const Slice& b) const { return comparator_->Compare(a, b); } // Return the offset in data_ just past the end of the current entry. inline uint32_t NextEntryOffset() const { return (value_.data() + value_.size()) - data_; } uint32_t GetRestartPoint(uint32_t index) { assert(index < num_restarts_); return DecodeFixed32(data_ + restarts_ + index * sizeof(uint32_t)); } void SeekToRestartPoint(uint32_t index) { key_.clear(); restart_index_ = index; // current_ will be fixed by ParseNextKey(); // ParseNextKey() starts at the end of value_, so set value_ accordingly uint32_t offset = GetRestartPoint(index); value_ = Slice(data_ + offset, 0); } public: Iter(const Comparator* comparator, const char* data, uint32_t restarts, uint32_t num_restarts) : comparator_(comparator), data_(data), restarts_(restarts), num_restarts_(num_restarts), current_(restarts_), restart_index_(num_restarts_) { assert(num_restarts_ > 0); } virtual bool Valid() const { return current_ < restarts_; } virtual Status status() const { return status_; } virtual Slice key() const { assert(Valid()); return key_; } virtual Slice value() const { assert(Valid()); return value_; } virtual void Next() { assert(Valid()); ParseNextKey(); } virtual void Prev() { assert(Valid()); // Scan backwards to a restart point before current_ const uint32_t original = current_; while (GetRestartPoint(restart_index_) >= original) { if (restart_index_ == 0) { // No more entries current_ = restarts_; restart_index_ = num_restarts_; return; } restart_index_--; } SeekToRestartPoint(restart_index_); do { // Loop until end of current entry hits the start of original entry } while (ParseNextKey() && NextEntryOffset() < original); } virtual void Seek(const Slice& target) { // Binary search in restart array to find the last restart point // with a key < target uint32_t left = 0; uint32_t right = num_restarts_ - 1; while (left < right) { uint32_t mid = (left + right + 1) / 2; uint32_t region_offset = GetRestartPoint(mid); uint32_t shared, non_shared, value_length; const char* key_ptr = DecodeEntry(data_ + region_offset, data_ + restarts_, &shared, &non_shared, &value_length); if (key_ptr == NULL || (shared != 0)) { CorruptionError(); return; } Slice mid_key(key_ptr, non_shared); if (Compare(mid_key, target) < 0) { // Key at "mid" is smaller than "target". Therefore all // blocks before "mid" are uninteresting. left = mid; } else { // Key at "mid" is >= "target". Therefore all blocks at or // after "mid" are uninteresting. right = mid - 1; } } // Linear search (within restart block) for first key >= target SeekToRestartPoint(left); while (true) { if (!ParseNextKey()) { return; } if (Compare(key_, target) >= 0) { return; } } } virtual void SeekToFirst() { SeekToRestartPoint(0); ParseNextKey(); } virtual void SeekToLast() { SeekToRestartPoint(num_restarts_ - 1); while (ParseNextKey() && NextEntryOffset() < restarts_) { // Keep skipping } } private: void CorruptionError() { current_ = restarts_; restart_index_ = num_restarts_; status_ = Status::Corruption("bad entry in block"); key_.clear(); value_.clear(); } bool ParseNextKey() { current_ = NextEntryOffset(); const char* p = data_ + current_; const char* limit = data_ + restarts_; // Restarts come right after data if (p >= limit) { // No more entries to return. Mark as invalid. current_ = restarts_; restart_index_ = num_restarts_; return false; } // Decode next entry uint32_t shared, non_shared, value_length; p = DecodeEntry(p, limit, &shared, &non_shared, &value_length); if (p == NULL || key_.size() < shared) { CorruptionError(); return false; } else { key_.resize(shared); key_.append(p, non_shared); value_ = Slice(p + non_shared, value_length); while (restart_index_ + 1 < num_restarts_ && GetRestartPoint(restart_index_ + 1) < current_) { ++restart_index_; } return true; } } }; Iterator* Block::NewIterator(const Comparator* cmp) { if (size_ < sizeof(uint32_t)) { return NewErrorIterator(Status::Corruption("bad block contents")); } const uint32_t num_restarts = NumRestarts(); if (num_restarts == 0) { return NewEmptyIterator(); } else { return new Iter(cmp, data_, restart_offset_, num_restarts); } } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/table/merger.h0000644000000000000000000000154312414772654020054 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_TABLE_MERGER_H_ #define STORAGE_LEVELDB_TABLE_MERGER_H_ namespace leveldb { class Comparator; class Iterator; // Return an iterator that provided the union of the data in // children[0,n-1]. Takes ownership of the child iterators and // will delete them when the result iterator is deleted. // // The result does no duplicate suppression. I.e., if a particular // key is present in K child iterators, it will be yielded K times. // // REQUIRES: n >= 0 extern Iterator* NewMergingIterator( const Comparator* comparator, Iterator** children, int n); } // namespace leveldb #endif // STORAGE_LEVELDB_TABLE_MERGER_H_ armory-0.92.3/cppForSwig/leveldb/table/block_builder.cc0000644000000000000000000000711012414772654021525 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // BlockBuilder generates blocks where keys are prefix-compressed: // // When we store a key, we drop the prefix shared with the previous // string. This helps reduce the space requirement significantly. // Furthermore, once every K keys, we do not apply the prefix // compression and store the entire key. We call this a "restart // point". The tail end of the block stores the offsets of all of the // restart points, and can be used to do a binary search when looking // for a particular key. Values are stored as-is (without compression) // immediately following the corresponding key. // // An entry for a particular key-value pair has the form: // shared_bytes: varint32 // unshared_bytes: varint32 // value_length: varint32 // key_delta: char[unshared_bytes] // value: char[value_length] // shared_bytes == 0 for restart points. // // The trailer of the block has the form: // restarts: uint32[num_restarts] // num_restarts: uint32 // restarts[i] contains the offset within the block of the ith restart point. #include "table/block_builder.h" #include #include #include "leveldb/comparator.h" #include "leveldb/table_builder.h" #include "util/coding.h" namespace leveldb { BlockBuilder::BlockBuilder(const Options* options) : options_(options), restarts_(), counter_(0), finished_(false) { assert(options->block_restart_interval >= 1); restarts_.push_back(0); // First restart point is at offset 0 } void BlockBuilder::Reset() { buffer_.clear(); restarts_.clear(); restarts_.push_back(0); // First restart point is at offset 0 counter_ = 0; finished_ = false; last_key_.clear(); } size_t BlockBuilder::CurrentSizeEstimate() const { return (buffer_.size() + // Raw data buffer restarts_.size() * sizeof(uint32_t) + // Restart array sizeof(uint32_t)); // Restart array length } Slice BlockBuilder::Finish() { // Append restart array for (size_t i = 0; i < restarts_.size(); i++) { PutFixed32(&buffer_, restarts_[i]); } PutFixed32(&buffer_, restarts_.size()); finished_ = true; return Slice(buffer_); } void BlockBuilder::Add(const Slice& key, const Slice& value) { Slice last_key_piece(last_key_); assert(!finished_); assert(counter_ <= options_->block_restart_interval); assert(buffer_.empty() // No values yet? || options_->comparator->Compare(key, last_key_piece) > 0); size_t shared = 0; if (counter_ < options_->block_restart_interval) { // See how much sharing to do with previous string const size_t min_length = std::min(last_key_piece.size(), key.size()); while ((shared < min_length) && (last_key_piece[shared] == key[shared])) { shared++; } } else { // Restart compression restarts_.push_back(buffer_.size()); counter_ = 0; } const size_t non_shared = key.size() - shared; // Add "" to buffer_ PutVarint32(&buffer_, shared); PutVarint32(&buffer_, non_shared); PutVarint32(&buffer_, value.size()); // Add string delta to buffer_ followed by value buffer_.append(key.data() + shared, non_shared); buffer_.append(value.data(), value.size()); // Update state last_key_.resize(shared); last_key_.append(key.data() + shared, non_shared); assert(Slice(last_key_) == key); counter_++; } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/table/filter_block.h0000644000000000000000000000431012414772654021225 0ustar rootroot// Copyright (c) 2012 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. // // A filter block is stored near the end of a Table file. It contains // filters (e.g., bloom filters) for all data blocks in the table combined // into a single filter block. #ifndef STORAGE_LEVELDB_TABLE_FILTER_BLOCK_H_ #define STORAGE_LEVELDB_TABLE_FILTER_BLOCK_H_ #include #include #include #include #include "leveldb/slice.h" #include "util/hash.h" namespace leveldb { class FilterPolicy; // A FilterBlockBuilder is used to construct all of the filters for a // particular Table. It generates a single string which is stored as // a special block in the Table. // // The sequence of calls to FilterBlockBuilder must match the regexp: // (StartBlock AddKey*)* Finish class FilterBlockBuilder { public: explicit FilterBlockBuilder(const FilterPolicy*); void StartBlock(uint64_t block_offset); void AddKey(const Slice& key); Slice Finish(); private: void GenerateFilter(); const FilterPolicy* policy_; std::string keys_; // Flattened key contents std::vector start_; // Starting index in keys_ of each key std::string result_; // Filter data computed so far std::vector tmp_keys_; // policy_->CreateFilter() argument std::vector filter_offsets_; // No copying allowed FilterBlockBuilder(const FilterBlockBuilder&); void operator=(const FilterBlockBuilder&); }; class FilterBlockReader { public: // REQUIRES: "contents" and *policy must stay live while *this is live. FilterBlockReader(const FilterPolicy* policy, const Slice& contents); bool KeyMayMatch(uint64_t block_offset, const Slice& key); private: const FilterPolicy* policy_; const char* data_; // Pointer to filter data (at block-start) const char* offset_; // Pointer to beginning of offset array (at block-end) size_t num_; // Number of entries in offset array size_t base_lg_; // Encoding parameter (see kFilterBaseLg in .cc file) }; } #endif // STORAGE_LEVELDB_TABLE_FILTER_BLOCK_H_ armory-0.92.3/cppForSwig/leveldb/table/two_level_iterator.h0000644000000000000000000000230712414772654022503 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #ifndef STORAGE_LEVELDB_TABLE_TWO_LEVEL_ITERATOR_H_ #define STORAGE_LEVELDB_TABLE_TWO_LEVEL_ITERATOR_H_ #include "leveldb/iterator.h" namespace leveldb { struct ReadOptions; // Return a new two level iterator. A two-level iterator contains an // index iterator whose values point to a sequence of blocks where // each block is itself a sequence of key,value pairs. The returned // two-level iterator yields the concatenation of all key/value pairs // in the sequence of blocks. Takes ownership of "index_iter" and // will delete it when no longer needed. // // Uses a supplied function to convert an index_iter value into // an iterator over the contents of the corresponding block. extern Iterator* NewTwoLevelIterator( Iterator* index_iter, Iterator* (*block_function)( void* arg, const ReadOptions& options, const Slice& index_value), void* arg, const ReadOptions& options); } // namespace leveldb #endif // STORAGE_LEVELDB_TABLE_TWO_LEVEL_ITERATOR_H_ armory-0.92.3/cppForSwig/leveldb/table/merger.cc0000644000000000000000000001145712414772654020217 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include "table/merger.h" #include "leveldb/comparator.h" #include "leveldb/iterator.h" #include "table/iterator_wrapper.h" namespace leveldb { namespace { class MergingIterator : public Iterator { public: MergingIterator(const Comparator* comparator, Iterator** children, int n) : comparator_(comparator), children_(new IteratorWrapper[n]), n_(n), current_(NULL), direction_(kForward) { for (int i = 0; i < n; i++) { children_[i].Set(children[i]); } } virtual ~MergingIterator() { delete[] children_; } virtual bool Valid() const { return (current_ != NULL); } virtual void SeekToFirst() { for (int i = 0; i < n_; i++) { children_[i].SeekToFirst(); } FindSmallest(); direction_ = kForward; } virtual void SeekToLast() { for (int i = 0; i < n_; i++) { children_[i].SeekToLast(); } FindLargest(); direction_ = kReverse; } virtual void Seek(const Slice& target) { for (int i = 0; i < n_; i++) { children_[i].Seek(target); } FindSmallest(); direction_ = kForward; } virtual void Next() { assert(Valid()); // Ensure that all children are positioned after key(). // If we are moving in the forward direction, it is already // true for all of the non-current_ children since current_ is // the smallest child and key() == current_->key(). Otherwise, // we explicitly position the non-current_ children. if (direction_ != kForward) { for (int i = 0; i < n_; i++) { IteratorWrapper* child = &children_[i]; if (child != current_) { child->Seek(key()); if (child->Valid() && comparator_->Compare(key(), child->key()) == 0) { child->Next(); } } } direction_ = kForward; } current_->Next(); FindSmallest(); } virtual void Prev() { assert(Valid()); // Ensure that all children are positioned before key(). // If we are moving in the reverse direction, it is already // true for all of the non-current_ children since current_ is // the largest child and key() == current_->key(). Otherwise, // we explicitly position the non-current_ children. if (direction_ != kReverse) { for (int i = 0; i < n_; i++) { IteratorWrapper* child = &children_[i]; if (child != current_) { child->Seek(key()); if (child->Valid()) { // Child is at first entry >= key(). Step back one to be < key() child->Prev(); } else { // Child has no entries >= key(). Position at last entry. child->SeekToLast(); } } } direction_ = kReverse; } current_->Prev(); FindLargest(); } virtual Slice key() const { assert(Valid()); return current_->key(); } virtual Slice value() const { assert(Valid()); return current_->value(); } virtual Status status() const { Status status; for (int i = 0; i < n_; i++) { status = children_[i].status(); if (!status.ok()) { break; } } return status; } private: void FindSmallest(); void FindLargest(); // We might want to use a heap in case there are lots of children. // For now we use a simple array since we expect a very small number // of children in leveldb. const Comparator* comparator_; IteratorWrapper* children_; int n_; IteratorWrapper* current_; // Which direction is the iterator moving? enum Direction { kForward, kReverse }; Direction direction_; }; void MergingIterator::FindSmallest() { IteratorWrapper* smallest = NULL; for (int i = 0; i < n_; i++) { IteratorWrapper* child = &children_[i]; if (child->Valid()) { if (smallest == NULL) { smallest = child; } else if (comparator_->Compare(child->key(), smallest->key()) < 0) { smallest = child; } } } current_ = smallest; } void MergingIterator::FindLargest() { IteratorWrapper* largest = NULL; for (int i = n_-1; i >= 0; i--) { IteratorWrapper* child = &children_[i]; if (child->Valid()) { if (largest == NULL) { largest = child; } else if (comparator_->Compare(child->key(), largest->key()) > 0) { largest = child; } } } current_ = largest; } } // namespace Iterator* NewMergingIterator(const Comparator* cmp, Iterator** list, int n) { assert(n >= 0); if (n == 0) { return NewEmptyIterator(); } else if (n == 1) { return list[0]; } else { return new MergingIterator(cmp, list, n); } } } // namespace leveldb armory-0.92.3/cppForSwig/leveldb/doc/0000755000000000000000000000000012414772654016075 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb/doc/benchmark.html0000644000000000000000000005075212414772654020726 0ustar rootroot LevelDB Benchmarks

LevelDB Benchmarks

Google, July 2011

In order to test LevelDB's performance, we benchmark it against other well-established database implementations. We compare LevelDB (revision 39) against SQLite3 (version 3.7.6.3) and Kyoto Cabinet's (version 1.2.67) TreeDB (a B+Tree based key-value store). We would like to acknowledge Scott Hess and Mikio Hirabayashi for their suggestions and contributions to the SQLite3 and Kyoto Cabinet benchmarks, respectively.

Benchmarks were all performed on a six-core Intel(R) Xeon(R) CPU X5650 @ 2.67GHz, with 12288 KB of total L3 cache and 12 GB of DDR3 RAM at 1333 MHz. (Note that LevelDB uses at most two CPUs since the benchmarks are single threaded: one to run the benchmark, and one for background compactions.) We ran the benchmarks on two machines (with identical processors), one with an Ext3 file system and one with an Ext4 file system. The machine with the Ext3 file system has a SATA Hitachi HDS721050CLA362 hard drive. The machine with the Ext4 file system has a SATA Samsung HD502HJ hard drive. Both hard drives spin at 7200 RPM and have hard drive write-caching enabled (using `hdparm -W 1 [device]`). The numbers reported below are the median of three measurements.

Benchmark Source Code

We wrote benchmark tools for SQLite and Kyoto TreeDB based on LevelDB's db_bench. The code for each of the benchmarks resides here:

Custom Build Specifications

  • LevelDB: LevelDB was compiled with the tcmalloc library and the Snappy compression library (revision 33). Assertions were disabled.
  • TreeDB: TreeDB was compiled using the LZO compression library (version 2.03). Furthermore, we enabled the TSMALL and TLINEAR options when opening the database in order to reduce the footprint of each record.
  • SQLite: We tuned SQLite's performance, by setting its locking mode to exclusive. We also enabled SQLite's write-ahead logging.

1. Baseline Performance

This section gives the baseline performance of all the databases. Following sections show how performance changes as various parameters are varied. For the baseline:

  • Each database is allowed 4 MB of cache memory.
  • Databases are opened in asynchronous write mode. (LevelDB's sync option, TreeDB's OAUTOSYNC option, and SQLite3's synchronous options are all turned off). I.e., every write is pushed to the operating system, but the benchmark does not wait for the write to reach the disk.
  • Keys are 16 bytes each.
  • Value are 100 bytes each (with enough redundancy so that a simple compressor shrinks them to 50% of their original size).
  • Sequential reads/writes traverse the key space in increasing order.
  • Random reads/writes traverse the key space in random order.

A. Sequential Reads

LevelDB 4,030,000 ops/sec
 
Kyoto TreeDB 1,010,000 ops/sec
 
SQLite3 383,000 ops/sec
 

B. Random Reads

LevelDB 129,000 ops/sec
 
Kyoto TreeDB 151,000 ops/sec
 
SQLite3 134,000 ops/sec
 

C. Sequential Writes

LevelDB 779,000 ops/sec
 
Kyoto TreeDB 342,000 ops/sec
 
SQLite3 48,600 ops/sec
 

D. Random Writes

LevelDB 164,000 ops/sec
 
Kyoto TreeDB 88,500 ops/sec
 
SQLite3 9,860 ops/sec
 

LevelDB outperforms both SQLite3 and TreeDB in sequential and random write operations and sequential read operations. Kyoto Cabinet has the fastest random read operations.

2. Write Performance under Different Configurations

A. Large Values

For this benchmark, we start with an empty database, and write 100,000 byte values (~50% compressible). To keep the benchmark running time reasonable, we stop after writing 1000 values.

Sequential Writes

LevelDB 1,100 ops/sec
 
Kyoto TreeDB 1,000 ops/sec
 
SQLite3 1,600 ops/sec
 

Random Writes

LevelDB 480 ops/sec
 
Kyoto TreeDB 1,100 ops/sec
 
SQLite3 1,600 ops/sec
 

LevelDB doesn't perform as well with large values of 100,000 bytes each. This is because LevelDB writes keys and values at least twice: first time to the transaction log, and second time (during a compaction) to a sorted file. With larger values, LevelDB's per-operation efficiency is swamped by the cost of extra copies of large values.

B. Batch Writes

A batch write is a set of writes that are applied atomically to the underlying database. A single batch of N writes may be significantly faster than N individual writes. The following benchmark writes one thousand batches where each batch contains one thousand 100-byte values. TreeDB does not support batch writes and is omitted from this benchmark.

Sequential Writes

LevelDB 840,000 entries/sec
 
 (1.08x baseline)
SQLite3 124,000 entries/sec
 
 (2.55x baseline)

Random Writes

LevelDB 221,000 entries/sec
 
 (1.35x baseline)
SQLite3 22,000 entries/sec
 
 (2.23x baseline)

Because of the way LevelDB persistent storage is organized, batches of random writes are not much slower (only a factor of 4x) than batches of sequential writes.

C. Synchronous Writes

In the following benchmark, we enable the synchronous writing modes of all of the databases. Since this change significantly slows down the benchmark, we stop after 10,000 writes. For synchronous write tests, we've disabled hard drive write-caching (using `hdparm -W 0 [device]`).

  • For LevelDB, we set WriteOptions.sync = true.
  • In TreeDB, we enabled TreeDB's OAUTOSYNC option.
  • For SQLite3, we set "PRAGMA synchronous = FULL".

Sequential Writes

LevelDB 100 ops/sec
 
 (0.003x baseline)
Kyoto TreeDB 7 ops/sec
 
 (0.0004x baseline)
SQLite3 88 ops/sec
 
 (0.002x baseline)

Random Writes

LevelDB 100 ops/sec
 
 (0.015x baseline)
Kyoto TreeDB 8 ops/sec
 
 (0.001x baseline)
SQLite3 88 ops/sec
 
 (0.009x baseline)

Also see the ext4 performance numbers below since synchronous writes behave significantly differently on ext3 and ext4.

D. Turning Compression Off

In the baseline measurements, LevelDB and TreeDB were using light-weight compression (Snappy for LevelDB, and LZO for TreeDB). SQLite3, by default does not use compression. The experiments below show what happens when compression is disabled in all of the databases (the SQLite3 numbers are just a copy of its baseline measurements):

Sequential Writes

LevelDB 594,000 ops/sec
 
 (0.76x baseline)
Kyoto TreeDB 485,000 ops/sec
 
 (1.42x baseline)
SQLite3 48,600 ops/sec
 
 (1.00x baseline)

Random Writes

LevelDB 135,000 ops/sec
 
 (0.82x baseline)
Kyoto TreeDB 159,000 ops/sec
 
 (1.80x baseline)
SQLite3 9,860 ops/sec
 
 (1.00x baseline)

LevelDB's write performance is better with compression than without since compression decreases the amount of data that has to be written to disk. Therefore LevelDB users can leave compression enabled in most scenarios without having worry about a tradeoff between space usage and performance. TreeDB's performance on the other hand is better without compression than with compression. Presumably this is because TreeDB's compression library (LZO) is more expensive than LevelDB's compression library (Snappy).

E. Using More Memory

We increased the overall cache size for each database to 128 MB. For LevelDB, we partitioned 128 MB into a 120 MB write buffer and 8 MB of cache (up from 2 MB of write buffer and 2 MB of cache). For SQLite3, we kept the page size at 1024 bytes, but increased the number of pages to 131,072 (up from 4096). For TreeDB, we also kept the page size at 1024 bytes, but increased the cache size to 128 MB (up from 4 MB).

Sequential Writes

LevelDB 812,000 ops/sec
 
 (1.04x baseline)
Kyoto TreeDB 321,000 ops/sec
 
 (0.94x baseline)
SQLite3 48,500 ops/sec
 
 (1.00x baseline)

Random Writes

LevelDB 355,000 ops/sec
 
 (2.16x baseline)
Kyoto TreeDB 284,000 ops/sec
 
 (3.21x baseline)
SQLite3 9,670 ops/sec
 
 (0.98x baseline)

SQLite's performance does not change substantially when compared to the baseline, but the random write performance for both LevelDB and TreeDB increases significantly. LevelDB's performance improves because a larger write buffer reduces the need to merge sorted files (since it creates a smaller number of larger sorted files). TreeDB's performance goes up because the entire database is available in memory for fast in-place updates.

3. Read Performance under Different Configurations

A. Larger Caches

We increased the overall memory usage to 128 MB for each database. For LevelDB, we allocated 8 MB to LevelDB's write buffer and 120 MB to LevelDB's cache. The other databases don't differentiate between a write buffer and a cache, so we simply set their cache size to 128 MB.

Sequential Reads

LevelDB 5,210,000 ops/sec
 
 (1.29x baseline)
Kyoto TreeDB 1,070,000 ops/sec
 
 (1.06x baseline)
SQLite3 609,000 ops/sec
 
 (1.59x baseline)

Random Reads

LevelDB 190,000 ops/sec
 
 (1.47x baseline)
Kyoto TreeDB 463,000 ops/sec
 
 (3.07x baseline)
SQLite3 186,000 ops/sec
 
 (1.39x baseline)

As expected, the read performance of all of the databases increases when the caches are enlarged. In particular, TreeDB seems to make very effective use of a cache that is large enough to hold the entire database.

B. No Compression Reads

For this benchmark, we populated a database with 1 million entries consisting of 16 byte keys and 100 byte values. We compiled LevelDB and Kyoto Cabinet without compression support, so results that are read out from the database are already uncompressed. We've listed the SQLite3 baseline read performance as a point of comparison.

Sequential Reads

LevelDB 4,880,000 ops/sec
 
 (1.21x baseline)
Kyoto TreeDB 1,230,000 ops/sec
 
 (3.60x baseline)
SQLite3 383,000 ops/sec
 
 (1.00x baseline)

Random Reads

LevelDB 149,000 ops/sec
 
 (1.16x baseline)
Kyoto TreeDB 175,000 ops/sec
 
 (1.16x baseline)
SQLite3 134,000 ops/sec
 
 (1.00x baseline)

Performance of both LevelDB and TreeDB improves a small amount when compression is disabled. Note however that under different workloads, performance may very well be better with compression if it allows more of the working set to fit in memory.

Note about Ext4 Filesystems

The preceding numbers are for an ext3 file system. Synchronous writes are much slower under ext4 (LevelDB drops to ~31 writes / second and TreeDB drops to ~5 writes / second; SQLite3's synchronous writes do not noticeably drop) due to ext4's different handling of fsync / msync calls. Even LevelDB's asynchronous write performance drops somewhat since it spreads its storage across multiple files and issues fsync calls when switching to a new file.

Acknowledgements

Jeff Dean and Sanjay Ghemawat wrote LevelDB. Kevin Tseng wrote and compiled these benchmarks. Mikio Hirabayashi, Scott Hess, and Gabor Cselle provided help and advice.

armory-0.92.3/cppForSwig/leveldb/doc/bench/0000755000000000000000000000000012414772654017154 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb/doc/bench/db_bench_tree_db.cc0000644000000000000000000003711112414772654022676 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include #include #include #include "util/histogram.h" #include "util/random.h" #include "util/testutil.h" // Comma-separated list of operations to run in the specified order // Actual benchmarks: // // fillseq -- write N values in sequential key order in async mode // fillrandom -- write N values in random key order in async mode // overwrite -- overwrite N values in random key order in async mode // fillseqsync -- write N/100 values in sequential key order in sync mode // fillrandsync -- write N/100 values in random key order in sync mode // fillrand100K -- write N/1000 100K values in random order in async mode // fillseq100K -- write N/1000 100K values in seq order in async mode // readseq -- read N times sequentially // readseq100K -- read N/1000 100K values in sequential order in async mode // readrand100K -- read N/1000 100K values in sequential order in async mode // readrandom -- read N times in random order static const char* FLAGS_benchmarks = "fillseq," "fillseqsync," "fillrandsync," "fillrandom," "overwrite," "readrandom," "readseq," "fillrand100K," "fillseq100K," "readseq100K," "readrand100K," ; // Number of key/values to place in database static int FLAGS_num = 1000000; // Number of read operations to do. If negative, do FLAGS_num reads. static int FLAGS_reads = -1; // Size of each value static int FLAGS_value_size = 100; // Arrange to generate values that shrink to this fraction of // their original size after compression static double FLAGS_compression_ratio = 0.5; // Print histogram of operation timings static bool FLAGS_histogram = false; // Cache size. Default 4 MB static int FLAGS_cache_size = 4194304; // Page size. Default 1 KB static int FLAGS_page_size = 1024; // If true, do not destroy the existing database. If you set this // flag and also specify a benchmark that wants a fresh database, that // benchmark will fail. static bool FLAGS_use_existing_db = false; // Compression flag. If true, compression is on. If false, compression // is off. static bool FLAGS_compression = true; // Use the db with the following name. static const char* FLAGS_db = NULL; inline static void DBSynchronize(kyotocabinet::TreeDB* db_) { // Synchronize will flush writes to disk if (!db_->synchronize()) { fprintf(stderr, "synchronize error: %s\n", db_->error().name()); } } namespace leveldb { // Helper for quickly generating random data. namespace { class RandomGenerator { private: std::string data_; int pos_; public: RandomGenerator() { // We use a limited amount of data over and over again and ensure // that it is larger than the compression window (32KB), and also // large enough to serve all typical value sizes we want to write. Random rnd(301); std::string piece; while (data_.size() < 1048576) { // Add a short fragment that is as compressible as specified // by FLAGS_compression_ratio. test::CompressibleString(&rnd, FLAGS_compression_ratio, 100, &piece); data_.append(piece); } pos_ = 0; } Slice Generate(int len) { if (pos_ + len > data_.size()) { pos_ = 0; assert(len < data_.size()); } pos_ += len; return Slice(data_.data() + pos_ - len, len); } }; static Slice TrimSpace(Slice s) { int start = 0; while (start < s.size() && isspace(s[start])) { start++; } int limit = s.size(); while (limit > start && isspace(s[limit-1])) { limit--; } return Slice(s.data() + start, limit - start); } } // namespace class Benchmark { private: kyotocabinet::TreeDB* db_; int db_num_; int num_; int reads_; double start_; double last_op_finish_; int64_t bytes_; std::string message_; Histogram hist_; RandomGenerator gen_; Random rand_; kyotocabinet::LZOCompressor comp_; // State kept for progress messages int done_; int next_report_; // When to report next void PrintHeader() { const int kKeySize = 16; PrintEnvironment(); fprintf(stdout, "Keys: %d bytes each\n", kKeySize); fprintf(stdout, "Values: %d bytes each (%d bytes after compression)\n", FLAGS_value_size, static_cast(FLAGS_value_size * FLAGS_compression_ratio + 0.5)); fprintf(stdout, "Entries: %d\n", num_); fprintf(stdout, "RawSize: %.1f MB (estimated)\n", ((static_cast(kKeySize + FLAGS_value_size) * num_) / 1048576.0)); fprintf(stdout, "FileSize: %.1f MB (estimated)\n", (((kKeySize + FLAGS_value_size * FLAGS_compression_ratio) * num_) / 1048576.0)); PrintWarnings(); fprintf(stdout, "------------------------------------------------\n"); } void PrintWarnings() { #if defined(__GNUC__) && !defined(__OPTIMIZE__) fprintf(stdout, "WARNING: Optimization is disabled: benchmarks unnecessarily slow\n" ); #endif #ifndef NDEBUG fprintf(stdout, "WARNING: Assertions are enabled; benchmarks unnecessarily slow\n"); #endif } void PrintEnvironment() { fprintf(stderr, "Kyoto Cabinet: version %s, lib ver %d, lib rev %d\n", kyotocabinet::VERSION, kyotocabinet::LIBVER, kyotocabinet::LIBREV); #if defined(__linux) time_t now = time(NULL); fprintf(stderr, "Date: %s", ctime(&now)); // ctime() adds newline FILE* cpuinfo = fopen("/proc/cpuinfo", "r"); if (cpuinfo != NULL) { char line[1000]; int num_cpus = 0; std::string cpu_type; std::string cache_size; while (fgets(line, sizeof(line), cpuinfo) != NULL) { const char* sep = strchr(line, ':'); if (sep == NULL) { continue; } Slice key = TrimSpace(Slice(line, sep - 1 - line)); Slice val = TrimSpace(Slice(sep + 1)); if (key == "model name") { ++num_cpus; cpu_type = val.ToString(); } else if (key == "cache size") { cache_size = val.ToString(); } } fclose(cpuinfo); fprintf(stderr, "CPU: %d * %s\n", num_cpus, cpu_type.c_str()); fprintf(stderr, "CPUCache: %s\n", cache_size.c_str()); } #endif } void Start() { start_ = Env::Default()->NowMicros() * 1e-6; bytes_ = 0; message_.clear(); last_op_finish_ = start_; hist_.Clear(); done_ = 0; next_report_ = 100; } void FinishedSingleOp() { if (FLAGS_histogram) { double now = Env::Default()->NowMicros() * 1e-6; double micros = (now - last_op_finish_) * 1e6; hist_.Add(micros); if (micros > 20000) { fprintf(stderr, "long op: %.1f micros%30s\r", micros, ""); fflush(stderr); } last_op_finish_ = now; } done_++; if (done_ >= next_report_) { if (next_report_ < 1000) next_report_ += 100; else if (next_report_ < 5000) next_report_ += 500; else if (next_report_ < 10000) next_report_ += 1000; else if (next_report_ < 50000) next_report_ += 5000; else if (next_report_ < 100000) next_report_ += 10000; else if (next_report_ < 500000) next_report_ += 50000; else next_report_ += 100000; fprintf(stderr, "... finished %d ops%30s\r", done_, ""); fflush(stderr); } } void Stop(const Slice& name) { double finish = Env::Default()->NowMicros() * 1e-6; // Pretend at least one op was done in case we are running a benchmark // that does not call FinishedSingleOp(). if (done_ < 1) done_ = 1; if (bytes_ > 0) { char rate[100]; snprintf(rate, sizeof(rate), "%6.1f MB/s", (bytes_ / 1048576.0) / (finish - start_)); if (!message_.empty()) { message_ = std::string(rate) + " " + message_; } else { message_ = rate; } } fprintf(stdout, "%-12s : %11.3f micros/op;%s%s\n", name.ToString().c_str(), (finish - start_) * 1e6 / done_, (message_.empty() ? "" : " "), message_.c_str()); if (FLAGS_histogram) { fprintf(stdout, "Microseconds per op:\n%s\n", hist_.ToString().c_str()); } fflush(stdout); } public: enum Order { SEQUENTIAL, RANDOM }; enum DBState { FRESH, EXISTING }; Benchmark() : db_(NULL), num_(FLAGS_num), reads_(FLAGS_reads < 0 ? FLAGS_num : FLAGS_reads), bytes_(0), rand_(301) { std::vector files; std::string test_dir; Env::Default()->GetTestDirectory(&test_dir); Env::Default()->GetChildren(test_dir.c_str(), &files); if (!FLAGS_use_existing_db) { for (int i = 0; i < files.size(); i++) { if (Slice(files[i]).starts_with("dbbench_polyDB")) { std::string file_name(test_dir); file_name += "/"; file_name += files[i]; Env::Default()->DeleteFile(file_name.c_str()); } } } } ~Benchmark() { if (!db_->close()) { fprintf(stderr, "close error: %s\n", db_->error().name()); } } void Run() { PrintHeader(); Open(false); const char* benchmarks = FLAGS_benchmarks; while (benchmarks != NULL) { const char* sep = strchr(benchmarks, ','); Slice name; if (sep == NULL) { name = benchmarks; benchmarks = NULL; } else { name = Slice(benchmarks, sep - benchmarks); benchmarks = sep + 1; } Start(); bool known = true; bool write_sync = false; if (name == Slice("fillseq")) { Write(write_sync, SEQUENTIAL, FRESH, num_, FLAGS_value_size, 1); } else if (name == Slice("fillrandom")) { Write(write_sync, RANDOM, FRESH, num_, FLAGS_value_size, 1); DBSynchronize(db_); } else if (name == Slice("overwrite")) { Write(write_sync, RANDOM, EXISTING, num_, FLAGS_value_size, 1); DBSynchronize(db_); } else if (name == Slice("fillrandsync")) { write_sync = true; Write(write_sync, RANDOM, FRESH, num_ / 100, FLAGS_value_size, 1); DBSynchronize(db_); } else if (name == Slice("fillseqsync")) { write_sync = true; Write(write_sync, SEQUENTIAL, FRESH, num_ / 100, FLAGS_value_size, 1); DBSynchronize(db_); } else if (name == Slice("fillrand100K")) { Write(write_sync, RANDOM, FRESH, num_ / 1000, 100 * 1000, 1); DBSynchronize(db_); } else if (name == Slice("fillseq100K")) { Write(write_sync, SEQUENTIAL, FRESH, num_ / 1000, 100 * 1000, 1); DBSynchronize(db_); } else if (name == Slice("readseq")) { ReadSequential(); } else if (name == Slice("readrandom")) { ReadRandom(); } else if (name == Slice("readrand100K")) { int n = reads_; reads_ /= 1000; ReadRandom(); reads_ = n; } else if (name == Slice("readseq100K")) { int n = reads_; reads_ /= 1000; ReadSequential(); reads_ = n; } else { known = false; if (name != Slice()) { // No error message for empty name fprintf(stderr, "unknown benchmark '%s'\n", name.ToString().c_str()); } } if (known) { Stop(name); } } } private: void Open(bool sync) { assert(db_ == NULL); // Initialize db_ db_ = new kyotocabinet::TreeDB(); char file_name[100]; db_num_++; std::string test_dir; Env::Default()->GetTestDirectory(&test_dir); snprintf(file_name, sizeof(file_name), "%s/dbbench_polyDB-%d.kct", test_dir.c_str(), db_num_); // Create tuning options and open the database int open_options = kyotocabinet::PolyDB::OWRITER | kyotocabinet::PolyDB::OCREATE; int tune_options = kyotocabinet::TreeDB::TSMALL | kyotocabinet::TreeDB::TLINEAR; if (FLAGS_compression) { tune_options |= kyotocabinet::TreeDB::TCOMPRESS; db_->tune_compressor(&comp_); } db_->tune_options(tune_options); db_->tune_page_cache(FLAGS_cache_size); db_->tune_page(FLAGS_page_size); db_->tune_map(256LL<<20); if (sync) { open_options |= kyotocabinet::PolyDB::OAUTOSYNC; } if (!db_->open(file_name, open_options)) { fprintf(stderr, "open error: %s\n", db_->error().name()); } } void Write(bool sync, Order order, DBState state, int num_entries, int value_size, int entries_per_batch) { // Create new database if state == FRESH if (state == FRESH) { if (FLAGS_use_existing_db) { message_ = "skipping (--use_existing_db is true)"; return; } delete db_; db_ = NULL; Open(sync); Start(); // Do not count time taken to destroy/open } if (num_entries != num_) { char msg[100]; snprintf(msg, sizeof(msg), "(%d ops)", num_entries); message_ = msg; } // Write to database for (int i = 0; i < num_entries; i++) { const int k = (order == SEQUENTIAL) ? i : (rand_.Next() % num_entries); char key[100]; snprintf(key, sizeof(key), "%016d", k); bytes_ += value_size + strlen(key); std::string cpp_key = key; if (!db_->set(cpp_key, gen_.Generate(value_size).ToString())) { fprintf(stderr, "set error: %s\n", db_->error().name()); } FinishedSingleOp(); } } void ReadSequential() { kyotocabinet::DB::Cursor* cur = db_->cursor(); cur->jump(); std::string ckey, cvalue; while (cur->get(&ckey, &cvalue, true)) { bytes_ += ckey.size() + cvalue.size(); FinishedSingleOp(); } delete cur; } void ReadRandom() { std::string value; for (int i = 0; i < reads_; i++) { char key[100]; const int k = rand_.Next() % reads_; snprintf(key, sizeof(key), "%016d", k); db_->get(key, &value); FinishedSingleOp(); } } }; } // namespace leveldb int main(int argc, char** argv) { std::string default_db_path; for (int i = 1; i < argc; i++) { double d; int n; char junk; if (leveldb::Slice(argv[i]).starts_with("--benchmarks=")) { FLAGS_benchmarks = argv[i] + strlen("--benchmarks="); } else if (sscanf(argv[i], "--compression_ratio=%lf%c", &d, &junk) == 1) { FLAGS_compression_ratio = d; } else if (sscanf(argv[i], "--histogram=%d%c", &n, &junk) == 1 && (n == 0 || n == 1)) { FLAGS_histogram = n; } else if (sscanf(argv[i], "--num=%d%c", &n, &junk) == 1) { FLAGS_num = n; } else if (sscanf(argv[i], "--reads=%d%c", &n, &junk) == 1) { FLAGS_reads = n; } else if (sscanf(argv[i], "--value_size=%d%c", &n, &junk) == 1) { FLAGS_value_size = n; } else if (sscanf(argv[i], "--cache_size=%d%c", &n, &junk) == 1) { FLAGS_cache_size = n; } else if (sscanf(argv[i], "--page_size=%d%c", &n, &junk) == 1) { FLAGS_page_size = n; } else if (sscanf(argv[i], "--compression=%d%c", &n, &junk) == 1 && (n == 0 || n == 1)) { FLAGS_compression = (n == 1) ? true : false; } else if (strncmp(argv[i], "--db=", 5) == 0) { FLAGS_db = argv[i] + 5; } else { fprintf(stderr, "Invalid flag '%s'\n", argv[i]); exit(1); } } // Choose a location for the test database if none given with --db= if (FLAGS_db == NULL) { leveldb::Env::Default()->GetTestDirectory(&default_db_path); default_db_path += "/dbbench"; FLAGS_db = default_db_path.c_str(); } leveldb::Benchmark benchmark; benchmark.Run(); return 0; } armory-0.92.3/cppForSwig/leveldb/doc/bench/db_bench_sqlite3.cc0000644000000000000000000005407212414772654022663 0ustar rootroot// Copyright (c) 2011 The LevelDB Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. See the AUTHORS file for names of contributors. #include #include #include #include "util/histogram.h" #include "util/random.h" #include "util/testutil.h" // Comma-separated list of operations to run in the specified order // Actual benchmarks: // // fillseq -- write N values in sequential key order in async mode // fillseqsync -- write N/100 values in sequential key order in sync mode // fillseqbatch -- batch write N values in sequential key order in async mode // fillrandom -- write N values in random key order in async mode // fillrandsync -- write N/100 values in random key order in sync mode // fillrandbatch -- batch write N values in sequential key order in async mode // overwrite -- overwrite N values in random key order in async mode // fillrand100K -- write N/1000 100K values in random order in async mode // fillseq100K -- write N/1000 100K values in sequential order in async mode // readseq -- read N times sequentially // readrandom -- read N times in random order // readrand100K -- read N/1000 100K values in sequential order in async mode static const char* FLAGS_benchmarks = "fillseq," "fillseqsync," "fillseqbatch," "fillrandom," "fillrandsync," "fillrandbatch," "overwrite," "overwritebatch," "readrandom," "readseq," "fillrand100K," "fillseq100K," "readseq," "readrand100K," ; // Number of key/values to place in database static int FLAGS_num = 1000000; // Number of read operations to do. If negative, do FLAGS_num reads. static int FLAGS_reads = -1; // Size of each value static int FLAGS_value_size = 100; // Print histogram of operation timings static bool FLAGS_histogram = false; // Arrange to generate values that shrink to this fraction of // their original size after compression static double FLAGS_compression_ratio = 0.5; // Page size. Default 1 KB. static int FLAGS_page_size = 1024; // Number of pages. // Default cache size = FLAGS_page_size * FLAGS_num_pages = 4 MB. static int FLAGS_num_pages = 4096; // If true, do not destroy the existing database. If you set this // flag and also specify a benchmark that wants a fresh database, that // benchmark will fail. static bool FLAGS_use_existing_db = false; // If true, we allow batch writes to occur static bool FLAGS_transaction = true; // If true, we enable Write-Ahead Logging static bool FLAGS_WAL_enabled = true; // Use the db with the following name. static const char* FLAGS_db = NULL; inline static void ExecErrorCheck(int status, char *err_msg) { if (status != SQLITE_OK) { fprintf(stderr, "SQL error: %s\n", err_msg); sqlite3_free(err_msg); exit(1); } } inline static void StepErrorCheck(int status) { if (status != SQLITE_DONE) { fprintf(stderr, "SQL step error: status = %d\n", status); exit(1); } } inline static void ErrorCheck(int status) { if (status != SQLITE_OK) { fprintf(stderr, "sqlite3 error: status = %d\n", status); exit(1); } } inline static void WalCheckpoint(sqlite3* db_) { // Flush all writes to disk if (FLAGS_WAL_enabled) { sqlite3_wal_checkpoint_v2(db_, NULL, SQLITE_CHECKPOINT_FULL, NULL, NULL); } } namespace leveldb { // Helper for quickly generating random data. namespace { class RandomGenerator { private: std::string data_; int pos_; public: RandomGenerator() { // We use a limited amount of data over and over again and ensure // that it is larger than the compression window (32KB), and also // large enough to serve all typical value sizes we want to write. Random rnd(301); std::string piece; while (data_.size() < 1048576) { // Add a short fragment that is as compressible as specified // by FLAGS_compression_ratio. test::CompressibleString(&rnd, FLAGS_compression_ratio, 100, &piece); data_.append(piece); } pos_ = 0; } Slice Generate(int len) { if (pos_ + len > data_.size()) { pos_ = 0; assert(len < data_.size()); } pos_ += len; return Slice(data_.data() + pos_ - len, len); } }; static Slice TrimSpace(Slice s) { int start = 0; while (start < s.size() && isspace(s[start])) { start++; } int limit = s.size(); while (limit > start && isspace(s[limit-1])) { limit--; } return Slice(s.data() + start, limit - start); } } // namespace class Benchmark { private: sqlite3* db_; int db_num_; int num_; int reads_; double start_; double last_op_finish_; int64_t bytes_; std::string message_; Histogram hist_; RandomGenerator gen_; Random rand_; // State kept for progress messages int done_; int next_report_; // When to report next void PrintHeader() { const int kKeySize = 16; PrintEnvironment(); fprintf(stdout, "Keys: %d bytes each\n", kKeySize); fprintf(stdout, "Values: %d bytes each\n", FLAGS_value_size); fprintf(stdout, "Entries: %d\n", num_); fprintf(stdout, "RawSize: %.1f MB (estimated)\n", ((static_cast(kKeySize + FLAGS_value_size) * num_) / 1048576.0)); PrintWarnings(); fprintf(stdout, "------------------------------------------------\n"); } void PrintWarnings() { #if defined(__GNUC__) && !defined(__OPTIMIZE__) fprintf(stdout, "WARNING: Optimization is disabled: benchmarks unnecessarily slow\n" ); #endif #ifndef NDEBUG fprintf(stdout, "WARNING: Assertions are enabled; benchmarks unnecessarily slow\n"); #endif } void PrintEnvironment() { fprintf(stderr, "SQLite: version %s\n", SQLITE_VERSION); #if defined(__linux) time_t now = time(NULL); fprintf(stderr, "Date: %s", ctime(&now)); // ctime() adds newline FILE* cpuinfo = fopen("/proc/cpuinfo", "r"); if (cpuinfo != NULL) { char line[1000]; int num_cpus = 0; std::string cpu_type; std::string cache_size; while (fgets(line, sizeof(line), cpuinfo) != NULL) { const char* sep = strchr(line, ':'); if (sep == NULL) { continue; } Slice key = TrimSpace(Slice(line, sep - 1 - line)); Slice val = TrimSpace(Slice(sep + 1)); if (key == "model name") { ++num_cpus; cpu_type = val.ToString(); } else if (key == "cache size") { cache_size = val.ToString(); } } fclose(cpuinfo); fprintf(stderr, "CPU: %d * %s\n", num_cpus, cpu_type.c_str()); fprintf(stderr, "CPUCache: %s\n", cache_size.c_str()); } #endif } void Start() { start_ = Env::Default()->NowMicros() * 1e-6; bytes_ = 0; message_.clear(); last_op_finish_ = start_; hist_.Clear(); done_ = 0; next_report_ = 100; } void FinishedSingleOp() { if (FLAGS_histogram) { double now = Env::Default()->NowMicros() * 1e-6; double micros = (now - last_op_finish_) * 1e6; hist_.Add(micros); if (micros > 20000) { fprintf(stderr, "long op: %.1f micros%30s\r", micros, ""); fflush(stderr); } last_op_finish_ = now; } done_++; if (done_ >= next_report_) { if (next_report_ < 1000) next_report_ += 100; else if (next_report_ < 5000) next_report_ += 500; else if (next_report_ < 10000) next_report_ += 1000; else if (next_report_ < 50000) next_report_ += 5000; else if (next_report_ < 100000) next_report_ += 10000; else if (next_report_ < 500000) next_report_ += 50000; else next_report_ += 100000; fprintf(stderr, "... finished %d ops%30s\r", done_, ""); fflush(stderr); } } void Stop(const Slice& name) { double finish = Env::Default()->NowMicros() * 1e-6; // Pretend at least one op was done in case we are running a benchmark // that does not call FinishedSingleOp(). if (done_ < 1) done_ = 1; if (bytes_ > 0) { char rate[100]; snprintf(rate, sizeof(rate), "%6.1f MB/s", (bytes_ / 1048576.0) / (finish - start_)); if (!message_.empty()) { message_ = std::string(rate) + " " + message_; } else { message_ = rate; } } fprintf(stdout, "%-12s : %11.3f micros/op;%s%s\n", name.ToString().c_str(), (finish - start_) * 1e6 / done_, (message_.empty() ? "" : " "), message_.c_str()); if (FLAGS_histogram) { fprintf(stdout, "Microseconds per op:\n%s\n", hist_.ToString().c_str()); } fflush(stdout); } public: enum Order { SEQUENTIAL, RANDOM }; enum DBState { FRESH, EXISTING }; Benchmark() : db_(NULL), db_num_(0), num_(FLAGS_num), reads_(FLAGS_reads < 0 ? FLAGS_num : FLAGS_reads), bytes_(0), rand_(301) { std::vector files; std::string test_dir; Env::Default()->GetTestDirectory(&test_dir); Env::Default()->GetChildren(test_dir, &files); if (!FLAGS_use_existing_db) { for (int i = 0; i < files.size(); i++) { if (Slice(files[i]).starts_with("dbbench_sqlite3")) { std::string file_name(test_dir); file_name += "/"; file_name += files[i]; Env::Default()->DeleteFile(file_name.c_str()); } } } } ~Benchmark() { int status = sqlite3_close(db_); ErrorCheck(status); } void Run() { PrintHeader(); Open(); const char* benchmarks = FLAGS_benchmarks; while (benchmarks != NULL) { const char* sep = strchr(benchmarks, ','); Slice name; if (sep == NULL) { name = benchmarks; benchmarks = NULL; } else { name = Slice(benchmarks, sep - benchmarks); benchmarks = sep + 1; } bytes_ = 0; Start(); bool known = true; bool write_sync = false; if (name == Slice("fillseq")) { Write(write_sync, SEQUENTIAL, FRESH, num_, FLAGS_value_size, 1); WalCheckpoint(db_); } else if (name == Slice("fillseqbatch")) { Write(write_sync, SEQUENTIAL, FRESH, num_, FLAGS_value_size, 1000); WalCheckpoint(db_); } else if (name == Slice("fillrandom")) { Write(write_sync, RANDOM, FRESH, num_, FLAGS_value_size, 1); WalCheckpoint(db_); } else if (name == Slice("fillrandbatch")) { Write(write_sync, RANDOM, FRESH, num_, FLAGS_value_size, 1000); WalCheckpoint(db_); } else if (name == Slice("overwrite")) { Write(write_sync, RANDOM, EXISTING, num_, FLAGS_value_size, 1); WalCheckpoint(db_); } else if (name == Slice("overwritebatch")) { Write(write_sync, RANDOM, EXISTING, num_, FLAGS_value_size, 1000); WalCheckpoint(db_); } else if (name == Slice("fillrandsync")) { write_sync = true; Write(write_sync, RANDOM, FRESH, num_ / 100, FLAGS_value_size, 1); WalCheckpoint(db_); } else if (name == Slice("fillseqsync")) { write_sync = true; Write(write_sync, SEQUENTIAL, FRESH, num_ / 100, FLAGS_value_size, 1); WalCheckpoint(db_); } else if (name == Slice("fillrand100K")) { Write(write_sync, RANDOM, FRESH, num_ / 1000, 100 * 1000, 1); WalCheckpoint(db_); } else if (name == Slice("fillseq100K")) { Write(write_sync, SEQUENTIAL, FRESH, num_ / 1000, 100 * 1000, 1); WalCheckpoint(db_); } else if (name == Slice("readseq")) { ReadSequential(); } else if (name == Slice("readrandom")) { Read(RANDOM, 1); } else if (name == Slice("readrand100K")) { int n = reads_; reads_ /= 1000; Read(RANDOM, 1); reads_ = n; } else { known = false; if (name != Slice()) { // No error message for empty name fprintf(stderr, "unknown benchmark '%s'\n", name.ToString().c_str()); } } if (known) { Stop(name); } } } void Open() { assert(db_ == NULL); int status; char file_name[100]; char* err_msg = NULL; db_num_++; // Open database std::string tmp_dir; Env::Default()->GetTestDirectory(&tmp_dir); snprintf(file_name, sizeof(file_name), "%s/dbbench_sqlite3-%d.db", tmp_dir.c_str(), db_num_); status = sqlite3_open(file_name, &db_); if (status) { fprintf(stderr, "open error: %s\n", sqlite3_errmsg(db_)); exit(1); } // Change SQLite cache size char cache_size[100]; snprintf(cache_size, sizeof(cache_size), "PRAGMA cache_size = %d", FLAGS_num_pages); status = sqlite3_exec(db_, cache_size, NULL, NULL, &err_msg); ExecErrorCheck(status, err_msg); // FLAGS_page_size is defaulted to 1024 if (FLAGS_page_size != 1024) { char page_size[100]; snprintf(page_size, sizeof(page_size), "PRAGMA page_size = %d", FLAGS_page_size); status = sqlite3_exec(db_, page_size, NULL, NULL, &err_msg); ExecErrorCheck(status, err_msg); } // Change journal mode to WAL if WAL enabled flag is on if (FLAGS_WAL_enabled) { std::string WAL_stmt = "PRAGMA journal_mode = WAL"; // LevelDB's default cache size is a combined 4 MB std::string WAL_checkpoint = "PRAGMA wal_autocheckpoint = 4096"; status = sqlite3_exec(db_, WAL_stmt.c_str(), NULL, NULL, &err_msg); ExecErrorCheck(status, err_msg); status = sqlite3_exec(db_, WAL_checkpoint.c_str(), NULL, NULL, &err_msg); ExecErrorCheck(status, err_msg); } // Change locking mode to exclusive and create tables/index for database std::string locking_stmt = "PRAGMA locking_mode = EXCLUSIVE"; std::string create_stmt = "CREATE TABLE test (key blob, value blob, PRIMARY KEY(key))"; std::string stmt_array[] = { locking_stmt, create_stmt }; int stmt_array_length = sizeof(stmt_array) / sizeof(std::string); for (int i = 0; i < stmt_array_length; i++) { status = sqlite3_exec(db_, stmt_array[i].c_str(), NULL, NULL, &err_msg); ExecErrorCheck(status, err_msg); } } void Write(bool write_sync, Order order, DBState state, int num_entries, int value_size, int entries_per_batch) { // Create new database if state == FRESH if (state == FRESH) { if (FLAGS_use_existing_db) { message_ = "skipping (--use_existing_db is true)"; return; } sqlite3_close(db_); db_ = NULL; Open(); Start(); } if (num_entries != num_) { char msg[100]; snprintf(msg, sizeof(msg), "(%d ops)", num_entries); message_ = msg; } char* err_msg = NULL; int status; sqlite3_stmt *replace_stmt, *begin_trans_stmt, *end_trans_stmt; std::string replace_str = "REPLACE INTO test (key, value) VALUES (?, ?)"; std::string begin_trans_str = "BEGIN TRANSACTION;"; std::string end_trans_str = "END TRANSACTION;"; // Check for synchronous flag in options std::string sync_stmt = (write_sync) ? "PRAGMA synchronous = FULL" : "PRAGMA synchronous = OFF"; status = sqlite3_exec(db_, sync_stmt.c_str(), NULL, NULL, &err_msg); ExecErrorCheck(status, err_msg); // Preparing sqlite3 statements status = sqlite3_prepare_v2(db_, replace_str.c_str(), -1, &replace_stmt, NULL); ErrorCheck(status); status = sqlite3_prepare_v2(db_, begin_trans_str.c_str(), -1, &begin_trans_stmt, NULL); ErrorCheck(status); status = sqlite3_prepare_v2(db_, end_trans_str.c_str(), -1, &end_trans_stmt, NULL); ErrorCheck(status); bool transaction = (entries_per_batch > 1); for (int i = 0; i < num_entries; i += entries_per_batch) { // Begin write transaction if (FLAGS_transaction && transaction) { status = sqlite3_step(begin_trans_stmt); StepErrorCheck(status); status = sqlite3_reset(begin_trans_stmt); ErrorCheck(status); } // Create and execute SQL statements for (int j = 0; j < entries_per_batch; j++) { const char* value = gen_.Generate(value_size).data(); // Create values for key-value pair const int k = (order == SEQUENTIAL) ? i + j : (rand_.Next() % num_entries); char key[100]; snprintf(key, sizeof(key), "%016d", k); // Bind KV values into replace_stmt status = sqlite3_bind_blob(replace_stmt, 1, key, 16, SQLITE_STATIC); ErrorCheck(status); status = sqlite3_bind_blob(replace_stmt, 2, value, value_size, SQLITE_STATIC); ErrorCheck(status); // Execute replace_stmt bytes_ += value_size + strlen(key); status = sqlite3_step(replace_stmt); StepErrorCheck(status); // Reset SQLite statement for another use status = sqlite3_clear_bindings(replace_stmt); ErrorCheck(status); status = sqlite3_reset(replace_stmt); ErrorCheck(status); FinishedSingleOp(); } // End write transaction if (FLAGS_transaction && transaction) { status = sqlite3_step(end_trans_stmt); StepErrorCheck(status); status = sqlite3_reset(end_trans_stmt); ErrorCheck(status); } } status = sqlite3_finalize(replace_stmt); ErrorCheck(status); status = sqlite3_finalize(begin_trans_stmt); ErrorCheck(status); status = sqlite3_finalize(end_trans_stmt); ErrorCheck(status); } void Read(Order order, int entries_per_batch) { int status; sqlite3_stmt *read_stmt, *begin_trans_stmt, *end_trans_stmt; std::string read_str = "SELECT * FROM test WHERE key = ?"; std::string begin_trans_str = "BEGIN TRANSACTION;"; std::string end_trans_str = "END TRANSACTION;"; // Preparing sqlite3 statements status = sqlite3_prepare_v2(db_, begin_trans_str.c_str(), -1, &begin_trans_stmt, NULL); ErrorCheck(status); status = sqlite3_prepare_v2(db_, end_trans_str.c_str(), -1, &end_trans_stmt, NULL); ErrorCheck(status); status = sqlite3_prepare_v2(db_, read_str.c_str(), -1, &read_stmt, NULL); ErrorCheck(status); bool transaction = (entries_per_batch > 1); for (int i = 0; i < reads_; i += entries_per_batch) { // Begin read transaction if (FLAGS_transaction && transaction) { status = sqlite3_step(begin_trans_stmt); StepErrorCheck(status); status = sqlite3_reset(begin_trans_stmt); ErrorCheck(status); } // Create and execute SQL statements for (int j = 0; j < entries_per_batch; j++) { // Create key value char key[100]; int k = (order == SEQUENTIAL) ? i + j : (rand_.Next() % reads_); snprintf(key, sizeof(key), "%016d", k); // Bind key value into read_stmt status = sqlite3_bind_blob(read_stmt, 1, key, 16, SQLITE_STATIC); ErrorCheck(status); // Execute read statement while ((status = sqlite3_step(read_stmt)) == SQLITE_ROW) {} StepErrorCheck(status); // Reset SQLite statement for another use status = sqlite3_clear_bindings(read_stmt); ErrorCheck(status); status = sqlite3_reset(read_stmt); ErrorCheck(status); FinishedSingleOp(); } // End read transaction if (FLAGS_transaction && transaction) { status = sqlite3_step(end_trans_stmt); StepErrorCheck(status); status = sqlite3_reset(end_trans_stmt); ErrorCheck(status); } } status = sqlite3_finalize(read_stmt); ErrorCheck(status); status = sqlite3_finalize(begin_trans_stmt); ErrorCheck(status); status = sqlite3_finalize(end_trans_stmt); ErrorCheck(status); } void ReadSequential() { int status; sqlite3_stmt *pStmt; std::string read_str = "SELECT * FROM test ORDER BY key"; status = sqlite3_prepare_v2(db_, read_str.c_str(), -1, &pStmt, NULL); ErrorCheck(status); for (int i = 0; i < reads_ && SQLITE_ROW == sqlite3_step(pStmt); i++) { bytes_ += sqlite3_column_bytes(pStmt, 1) + sqlite3_column_bytes(pStmt, 2); FinishedSingleOp(); } status = sqlite3_finalize(pStmt); ErrorCheck(status); } }; } // namespace leveldb int main(int argc, char** argv) { std::string default_db_path; for (int i = 1; i < argc; i++) { double d; int n; char junk; if (leveldb::Slice(argv[i]).starts_with("--benchmarks=")) { FLAGS_benchmarks = argv[i] + strlen("--benchmarks="); } else if (sscanf(argv[i], "--histogram=%d%c", &n, &junk) == 1 && (n == 0 || n == 1)) { FLAGS_histogram = n; } else if (sscanf(argv[i], "--compression_ratio=%lf%c", &d, &junk) == 1) { FLAGS_compression_ratio = d; } else if (sscanf(argv[i], "--use_existing_db=%d%c", &n, &junk) == 1 && (n == 0 || n == 1)) { FLAGS_use_existing_db = n; } else if (sscanf(argv[i], "--num=%d%c", &n, &junk) == 1) { FLAGS_num = n; } else if (sscanf(argv[i], "--reads=%d%c", &n, &junk) == 1) { FLAGS_reads = n; } else if (sscanf(argv[i], "--value_size=%d%c", &n, &junk) == 1) { FLAGS_value_size = n; } else if (leveldb::Slice(argv[i]) == leveldb::Slice("--no_transaction")) { FLAGS_transaction = false; } else if (sscanf(argv[i], "--page_size=%d%c", &n, &junk) == 1) { FLAGS_page_size = n; } else if (sscanf(argv[i], "--num_pages=%d%c", &n, &junk) == 1) { FLAGS_num_pages = n; } else if (sscanf(argv[i], "--WAL_enabled=%d%c", &n, &junk) == 1 && (n == 0 || n == 1)) { FLAGS_WAL_enabled = n; } else if (strncmp(argv[i], "--db=", 5) == 0) { FLAGS_db = argv[i] + 5; } else { fprintf(stderr, "Invalid flag '%s'\n", argv[i]); exit(1); } } // Choose a location for the test database if none given with --db= if (FLAGS_db == NULL) { leveldb::Env::Default()->GetTestDirectory(&default_db_path); default_db_path += "/dbbench"; FLAGS_db = default_db_path.c_str(); } leveldb::Benchmark benchmark; benchmark.Run(); return 0; } armory-0.92.3/cppForSwig/leveldb/doc/doc.css0000644000000000000000000000214712414772654017360 0ustar rootrootbody { margin-left: 0.5in; margin-right: 0.5in; background: white; color: black; } h1 { margin-left: -0.2in; font-size: 14pt; } h2 { margin-left: -0in; font-size: 12pt; } h3 { margin-left: -0in; } h4 { margin-left: -0in; } hr { margin-left: -0in; } /* Definition lists: definition term bold */ dt { font-weight: bold; } address { text-align: center; } code,samp,var { color: blue; } kbd { color: #600000; } div.note p { float: right; width: 3in; margin-right: 0%; padding: 1px; border: 2px solid #6060a0; background-color: #fffff0; } ul { margin-top: -0em; margin-bottom: -0em; } ol { margin-top: -0em; margin-bottom: -0em; } UL.nobullets { list-style-type: none; list-style-image: none; margin-left: -1em; } p { margin: 1em 0 1em 0; padding: 0 0 0 0; } pre { line-height: 1.3em; padding: 0.4em 0 0.8em 0; margin: 0 0 0 0; border: 0 0 0 0; color: blue; } .datatable { margin-left: auto; margin-right: auto; margin-top: 2em; margin-bottom: 2em; border: 1px solid; } .datatable td,th { padding: 0 0.5em 0 0.5em; text-align: right; } armory-0.92.3/cppForSwig/leveldb/doc/log_format.txt0000644000000000000000000000536512414772654021000 0ustar rootrootThe log file contents are a sequence of 32KB blocks. The only exception is that the tail of the file may contain a partial block. Each block consists of a sequence of records: block := record* trailer? record := checksum: uint32 // crc32c of type and data[] ; little-endian length: uint16 // little-endian type: uint8 // One of FULL, FIRST, MIDDLE, LAST data: uint8[length] A record never starts within the last six bytes of a block (since it won't fit). Any leftover bytes here form the trailer, which must consist entirely of zero bytes and must be skipped by readers. Aside: if exactly seven bytes are left in the current block, and a new non-zero length record is added, the writer must emit a FIRST record (which contains zero bytes of user data) to fill up the trailing seven bytes of the block and then emit all of the user data in subsequent blocks. More types may be added in the future. Some Readers may skip record types they do not understand, others may report that some data was skipped. FULL == 1 FIRST == 2 MIDDLE == 3 LAST == 4 The FULL record contains the contents of an entire user record. FIRST, MIDDLE, LAST are types used for user records that have been split into multiple fragments (typically because of block boundaries). FIRST is the type of the first fragment of a user record, LAST is the type of the last fragment of a user record, and MID is the type of all interior fragments of a user record. Example: consider a sequence of user records: A: length 1000 B: length 97270 C: length 8000 A will be stored as a FULL record in the first block. B will be split into three fragments: first fragment occupies the rest of the first block, second fragment occupies the entirety of the second block, and the third fragment occupies a prefix of the third block. This will leave six bytes free in the third block, which will be left empty as the trailer. C will be stored as a FULL record in the fourth block. =================== Some benefits over the recordio format: (1) We do not need any heuristics for resyncing - just go to next block boundary and scan. If there is a corruption, skip to the next block. As a side-benefit, we do not get confused when part of the contents of one log file are embedded as a record inside another log file. (2) Splitting at approximate boundaries (e.g., for mapreduce) is simple: find the next block boundary and skip records until we hit a FULL or FIRST record. (3) We do not need extra buffering for large records. Some downsides compared to recordio format: (1) No packing of tiny records. This could be fixed by adding a new record type, so it is a shortcoming of the current implementation, not necessarily the format. (2) No compression. Again, this could be fixed by adding new record types. armory-0.92.3/cppForSwig/leveldb/doc/index.html0000644000000000000000000005156612414772654020107 0ustar rootroot Leveldb

Leveldb

Jeff Dean, Sanjay Ghemawat

The leveldb library provides a persistent key value store. Keys and values are arbitrary byte arrays. The keys are ordered within the key value store according to a user-specified comparator function.

Opening A Database

A leveldb database has a name which corresponds to a file system directory. All of the contents of database are stored in this directory. The following example shows how to open a database, creating it if necessary: 

  #include <assert>
  #include "leveldb/db.h"

  leveldb::DB* db;
  leveldb::Options options;
  options.create_if_missing = true;
  leveldb::Status status = leveldb::DB::Open(options, "/tmp/testdb", &db);
  assert(status.ok());
  ...
If you want to raise an error if the database already exists, add the following line before the leveldb::DB::Open call: 
  options.error_if_exists = true;

Status

You may have noticed the leveldb::Status type above. Values of this type are returned by most functions in leveldb that may encounter an error. You can check if such a result is ok, and also print an associated error message: 

   leveldb::Status s = ...;
   if (!s.ok()) cerr << s.ToString() << endl;

Closing A Database

When you are done with a database, just delete the database object. Example: 

  ... open the db as described above ...
  ... do something with db ...
  delete db;

Reads And Writes

The database provides Put, Delete, and Get methods to modify/query the database. For example, the following code moves the value stored under key1 to key2. 

  std::string value;
  leveldb::Status s = db->Get(leveldb::ReadOptions(), key1, &value);
  if (s.ok()) s = db->Put(leveldb::WriteOptions(), key2, value);
  if (s.ok()) s = db->Delete(leveldb::WriteOptions(), key1);

Atomic Updates

Note that if the process dies after the Put of key2 but before the delete of key1, the same value may be left stored under multiple keys. Such problems can be avoided by using the WriteBatch class to atomically apply a set of updates: 

  #include "leveldb/write_batch.h"
  ...
  std::string value;
  leveldb::Status s = db->Get(leveldb::ReadOptions(), key1, &value);
  if (s.ok()) {
    leveldb::WriteBatch batch;
    batch.Delete(key1);
    batch.Put(key2, value);
    s = db->Write(leveldb::WriteOptions(), &batch);
  }
The WriteBatch holds a sequence of edits to be made to the database, and these edits within the batch are applied in order. Note that we called Delete before Put so that if key1 is identical to key2, we do not end up erroneously dropping the value entirely.

Apart from its atomicity benefits, WriteBatch may also be used to speed up bulk updates by placing lots of individual mutations into the same batch.

Synchronous Writes

By default, each write to leveldb is asynchronous: it returns after pushing the write from the process into the operating system. The transfer from operating system memory to the underlying persistent storage happens asynchronously. The sync flag can be turned on for a particular write to make the write operation not return until the data being written has been pushed all the way to persistent storage. (On Posix systems, this is implemented by calling either fsync(...) or fdatasync(...) or msync(..., MS_SYNC) before the write operation returns.) 
  leveldb::WriteOptions write_options;
  write_options.sync = true;
  db->Put(write_options, ...);
Asynchronous writes are often more than a thousand times as fast as synchronous writes. The downside of asynchronous writes is that a crash of the machine may cause the last few updates to be lost. Note that a crash of just the writing process (i.e., not a reboot) will not cause any loss since even when sync is false, an update is pushed from the process memory into the operating system before it is considered done.

Asynchronous writes can often be used safely. For example, when loading a large amount of data into the database you can handle lost updates by restarting the bulk load after a crash. A hybrid scheme is also possible where every Nth write is synchronous, and in the event of a crash, the bulk load is restarted just after the last synchronous write finished by the previous run. (The synchronous write can update a marker that describes where to restart on a crash.)

WriteBatch provides an alternative to asynchronous writes. Multiple updates may be placed in the same WriteBatch and applied together using a synchronous write (i.e., write_options.sync is set to true). The extra cost of the synchronous write will be amortized across all of the writes in the batch.

Concurrency

A database may only be opened by one process at a time. The leveldb implementation acquires a lock from the operating system to prevent misuse. Within a single process, the same leveldb::DB object may be safely shared by multiple concurrent threads. I.e., different threads may write into or fetch iterators or call Get on the same database without any external synchronization (the leveldb implementation will automatically do the required synchronization). However other objects (like Iterator and WriteBatch) may require external synchronization. If two threads share such an object, they must protect access to it using their own locking protocol. More details are available in the public header files.

Iteration

The following example demonstrates how to print all key,value pairs in a database. 

  leveldb::Iterator* it = db->NewIterator(leveldb::ReadOptions());
  for (it->SeekToFirst(); it->Valid(); it->Next()) {
    cout << it->key().ToString() << ": "  << it->value().ToString() << endl;
  }
  assert(it->status().ok());  // Check for any errors found during the scan
  delete it;
The following variation shows how to process just the keys in the range [start,limit): 

  for (it->Seek(start);
       it->Valid() && it->key().ToString() < limit;
       it->Next()) {
    ...
  }
You can also process entries in reverse order. (Caveat: reverse iteration may be somewhat slower than forward iteration.) 

  for (it->SeekToLast(); it->Valid(); it->Prev()) {
    ...
  }

Snapshots

Snapshots provide consistent read-only views over the entire state of the key-value store. ReadOptions::snapshot may be non-NULL to indicate that a read should operate on a particular version of the DB state. If ReadOptions::snapshot is NULL, the read will operate on an implicit snapshot of the current state.

Snapshots are created by the DB::GetSnapshot() method: 

  leveldb::ReadOptions options;
  options.snapshot = db->GetSnapshot();
  ... apply some updates to db ...
  leveldb::Iterator* iter = db->NewIterator(options);
  ... read using iter to view the state when the snapshot was created ...
  delete iter;
  db->ReleaseSnapshot(options.snapshot);
Note that when a snapshot is no longer needed, it should be released using the DB::ReleaseSnapshot interface. This allows the implementation to get rid of state that was being maintained just to support reading as of that snapshot.

Slice

The return value of the it->key() and it->value() calls above are instances of the leveldb::Slice type. Slice is a simple structure that contains a length and a pointer to an external byte array. Returning a Slice is a cheaper alternative to returning a std::string since we do not need to copy potentially large keys and values. In addition, leveldb methods do not return null-terminated C-style strings since leveldb keys and values are allowed to contain '\0' bytes.

C++ strings and null-terminated C-style strings can be easily converted to a Slice: 

   leveldb::Slice s1 = "hello";

   std::string str("world");
   leveldb::Slice s2 = str;
A Slice can be easily converted back to a C++ string: 
   std::string str = s1.ToString();
   assert(str == std::string("hello"));
Be careful when using Slices since it is up to the caller to ensure that the external byte array into which the Slice points remains live while the Slice is in use. For example, the following is buggy: 

   leveldb::Slice slice;
   if (...) {
     std::string str = ...;
     slice = str;
   }
   Use(slice);
When the if statement goes out of scope, str will be destroyed and the backing storage for slice will disappear.

Comparators

The preceding examples used the default ordering function for key, which orders bytes lexicographically. You can however supply a custom comparator when opening a database. For example, suppose each database key consists of two numbers and we should sort by the first number, breaking ties by the second number. First, define a proper subclass of leveldb::Comparator that expresses these rules: 

  class TwoPartComparator : public leveldb::Comparator {
   public:
    // Three-way comparison function:
    //   if a < b: negative result
    //   if a > b: positive result
    //   else: zero result
    int Compare(const leveldb::Slice& a, const leveldb::Slice& b) const {
      int a1, a2, b1, b2;
      ParseKey(a, &a1, &a2);
      ParseKey(b, &b1, &b2);
      if (a1 < b1) return -1;
      if (a1 > b1) return +1;
      if (a2 < b2) return -1;
      if (a2 > b2) return +1;
      return 0;
    }

    // Ignore the following methods for now:
    const char* Name() const { return "TwoPartComparator"; }
    void FindShortestSeparator(std::string*, const leveldb::Slice&) const { }
    void FindShortSuccessor(std::string*) const { }
  };
Now create a database using this custom comparator: 

  TwoPartComparator cmp;
  leveldb::DB* db;
  leveldb::Options options;
  options.create_if_missing = true;
  options.comparator = &cmp;
  leveldb::Status status = leveldb::DB::Open(options, "/tmp/testdb", &db);
  ...

Backwards compatibility

The result of the comparator's Name method is attached to the database when it is created, and is checked on every subsequent database open. If the name changes, the leveldb::DB::Open call will fail. Therefore, change the name if and only if the new key format and comparison function are incompatible with existing databases, and it is ok to discard the contents of all existing databases.

You can however still gradually evolve your key format over time with a little bit of pre-planning. For example, you could store a version number at the end of each key (one byte should suffice for most uses). When you wish to switch to a new key format (e.g., adding an optional third part to the keys processed by TwoPartComparator), (a) keep the same comparator name (b) increment the version number for new keys (c) change the comparator function so it uses the version numbers found in the keys to decide how to interpret them.

Performance

Performance can be tuned by changing the default values of the types defined in include/leveldb/options.h.

Block size

leveldb groups adjacent keys together into the same block and such a block is the unit of transfer to and from persistent storage. The default block size is approximately 4096 uncompressed bytes. Applications that mostly do bulk scans over the contents of the database may wish to increase this size. Applications that do a lot of point reads of small values may wish to switch to a smaller block size if performance measurements indicate an improvement. There isn't much benefit in using blocks smaller than one kilobyte, or larger than a few megabytes. Also note that compression will be more effective with larger block sizes.

Compression

Each block is individually compressed before being written to persistent storage. Compression is on by default since the default compression method is very fast, and is automatically disabled for uncompressible data. In rare cases, applications may want to disable compression entirely, but should only do so if benchmarks show a performance improvement: 

  leveldb::Options options;
  options.compression = leveldb::kNoCompression;
  ... leveldb::DB::Open(options, name, ...) ....

Cache

The contents of the database are stored in a set of files in the filesystem and each file stores a sequence of compressed blocks. If options.cache is non-NULL, it is used to cache frequently used uncompressed block contents. 

  #include "leveldb/cache.h"

  leveldb::Options options;
  options.cache = leveldb::NewLRUCache(100 * 1048576);  // 100MB cache
  leveldb::DB* db;
  leveldb::DB::Open(options, name, &db);
  ... use the db ...
  delete db
  delete options.cache;
Note that the cache holds uncompressed data, and therefore it should be sized according to application level data sizes, without any reduction from compression. (Caching of compressed blocks is left to the operating system buffer cache, or any custom Env implementation provided by the client.)

When performing a bulk read, the application may wish to disable caching so that the data processed by the bulk read does not end up displacing most of the cached contents. A per-iterator option can be used to achieve this: 

  leveldb::ReadOptions options;
  options.fill_cache = false;
  leveldb::Iterator* it = db->NewIterator(options);
  for (it->SeekToFirst(); it->Valid(); it->Next()) {
    ...
  }

Key Layout

Note that the unit of disk transfer and caching is a block. Adjacent keys (according to the database sort order) will usually be placed in the same block. Therefore the application can improve its performance by placing keys that are accessed together near each other and placing infrequently used keys in a separate region of the key space.

For example, suppose we are implementing a simple file system on top of leveldb. The types of entries we might wish to store are: 

   filename -> permission-bits, length, list of file_block_ids
   file_block_id -> data
We might want to prefix filename keys with one letter (say '/') and the file_block_id keys with a different letter (say '0') so that scans over just the metadata do not force us to fetch and cache bulky file contents.

Filters

Because of the way leveldb data is organized on disk, a single Get() call may involve multiple reads from disk. The optional FilterPolicy mechanism can be used to reduce the number of disk reads substantially. 

   leveldb::Options options;
   options.filter_policy = NewBloomFilterPolicy(10);
   leveldb::DB* db;
   leveldb::DB::Open(options, "/tmp/testdb", &db);
   ... use the database ...
   delete db;
   delete options.filter_policy;
The preceding code associates a Bloom filter based filtering policy with the database. Bloom filter based filtering relies on keeping some number of bits of data in memory per key (in this case 10 bits per key since that is the argument we passed to NewBloomFilterPolicy). This filter will reduce the number of unnecessary disk reads needed for Get() calls by a factor of approximately a 100. Increasing the bits per key will lead to a larger reduction at the cost of more memory usage. We recommend that applications whose working set does not fit in memory and that do a lot of random reads set a filter policy.

If you are using a custom comparator, you should ensure that the filter policy you are using is compatible with your comparator. For example, consider a comparator that ignores trailing spaces when comparing keys. NewBloomFilterPolicy must not be used with such a comparator. Instead, the application should provide a custom filter policy that also ignores trailing spaces. For example: 

  class CustomFilterPolicy : public leveldb::FilterPolicy {
   private:
    FilterPolicy* builtin_policy_;
   public:
    CustomFilterPolicy() : builtin_policy_(NewBloomFilterPolicy(10)) { }
    ~CustomFilterPolicy() { delete builtin_policy_; }

    const char* Name() const { return "IgnoreTrailingSpacesFilter"; }

    void CreateFilter(const Slice* keys, int n, std::string* dst) const {
      // Use builtin bloom filter code after removing trailing spaces
      std::vector<Slice> trimmed(n);
      for (int i = 0; i < n; i++) {
        trimmed[i] = RemoveTrailingSpaces(keys[i]);
      }
      return builtin_policy_->CreateFilter(&trimmed[i], n, dst);
    }

    bool KeyMayMatch(const Slice& key, const Slice& filter) const {
      // Use builtin bloom filter code after removing trailing spaces
      return builtin_policy_->KeyMayMatch(RemoveTrailingSpaces(key), filter);
    }
  };

Advanced applications may provide a filter policy that does not use a bloom filter but uses some other mechanism for summarizing a set of keys. See leveldb/filter_policy.h for detail.

Checksums

leveldb associates checksums with all data it stores in the file system. There are two separate controls provided over how aggressively these checksums are verified:

  • ReadOptions::verify_checksums may be set to true to force checksum verification of all data that is read from the file system on behalf of a particular read. By default, no such verification is done.

  • Options::paranoid_checks may be set to true before opening a database to make the database implementation raise an error as soon as it detects an internal corruption. Depending on which portion of the database has been corrupted, the error may be raised when the database is opened, or later by another database operation. By default, paranoid checking is off so that the database can be used even if parts of its persistent storage have been corrupted.

    If a database is corrupted (perhaps it cannot be opened when paranoid checking is turned on), the leveldb::RepairDB function may be used to recover as much of the data as possible

Approximate Sizes

The GetApproximateSizes method can used to get the approximate number of bytes of file system space used by one or more key ranges. 

   leveldb::Range ranges[2];
   ranges[0] = leveldb::Range("a", "c");
   ranges[1] = leveldb::Range("x", "z");
   uint64_t sizes[2];
   leveldb::Status s = db->GetApproximateSizes(ranges, 2, sizes);
The preceding call will set sizes[0] to the approximate number of bytes of file system space used by the key range [a..c) and sizes[1] to the approximate number of bytes used by the key range [x..z).

Environment

All file operations (and other operating system calls) issued by the leveldb implementation are routed through a leveldb::Env object. Sophisticated clients may wish to provide their own Env implementation to get better control. For example, an application may introduce artificial delays in the file IO paths to limit the impact of leveldb on other activities in the system. 

  class SlowEnv : public leveldb::Env {
    .. implementation of the Env interface ...
  };

  SlowEnv env;
  leveldb::Options options;
  options.env = &env;
  Status s = leveldb::DB::Open(options, ...);

Porting

leveldb may be ported to a new platform by providing platform specific implementations of the types/methods/functions exported by leveldb/port/port.h. See leveldb/port/port_example.h for more details.

In addition, the new platform may need a new default leveldb::Env implementation. See leveldb/util/env_posix.h for an example.

Other Information

Details about the leveldb implementation may be found in the following documents:

armory-0.92.3/cppForSwig/leveldb/doc/impl.html0000644000000000000000000002013412414772654017724 0ustar rootroot Leveldb file layout and compactions

Files

The implementation of leveldb is similar in spirit to the representation of a single Bigtable tablet (section 5.3). However the organization of the files that make up the representation is somewhat different and is explained below.

Each database is represented by a set of files stored in a directory. There are several different types of files as documented below:

Log files

A log file (*.log) stores a sequence of recent updates. Each update is appended to the current log file. When the log file reaches a pre-determined size (approximately 4MB by default), it is converted to a sorted table (see below) and a new log file is created for future updates.

A copy of the current log file is kept in an in-memory structure (the memtable). This copy is consulted on every read so that read operations reflect all logged updates.

Sorted tables

A sorted table (*.sst) stores a sequence of entries sorted by key. Each entry is either a value for the key, or a deletion marker for the key. (Deletion markers are kept around to hide obsolete values present in older sorted tables).

The set of sorted tables are organized into a sequence of levels. The sorted table generated from a log file is placed in a special young level (also called level-0). When the number of young files exceeds a certain threshold (currently four), all of the young files are merged together with all of the overlapping level-1 files to produce a sequence of new level-1 files (we create a new level-1 file for every 2MB of data.)

Files in the young level may contain overlapping keys. However files in other levels have distinct non-overlapping key ranges. Consider level number L where L >= 1. When the combined size of files in level-L exceeds (10^L) MB (i.e., 10MB for level-1, 100MB for level-2, ...), one file in level-L, and all of the overlapping files in level-(L+1) are merged to form a set of new files for level-(L+1). These merges have the effect of gradually migrating new updates from the young level to the largest level using only bulk reads and writes (i.e., minimizing expensive seeks).

Manifest

A MANIFEST file lists the set of sorted tables that make up each level, the corresponding key ranges, and other important metadata. A new MANIFEST file (with a new number embedded in the file name) is created whenever the database is reopened. The MANIFEST file is formatted as a log, and changes made to the serving state (as files are added or removed) are appended to this log.

Current

CURRENT is a simple text file that contains the name of the latest MANIFEST file.

Info logs

Informational messages are printed to files named LOG and LOG.old.

Others

Other files used for miscellaneous purposes may also be present (LOCK, *.dbtmp).

Level 0

When the log file grows above a certain size (1MB by default):
  • Create a brand new memtable and log file and direct future updates here
  • In the background:
    • Write the contents of the previous memtable to an sstable
    • Discard the memtable
    • Delete the old log file and the old memtable
    • Add the new sstable to the young (level-0) level.

Compactions

When the size of level L exceeds its limit, we compact it in a background thread. The compaction picks a file from level L and all overlapping files from the next level L+1. Note that if a level-L file overlaps only part of a level-(L+1) file, the entire file at level-(L+1) is used as an input to the compaction and will be discarded after the compaction. Aside: because level-0 is special (files in it may overlap each other), we treat compactions from level-0 to level-1 specially: a level-0 compaction may pick more than one level-0 file in case some of these files overlap each other.

A compaction merges the contents of the picked files to produce a sequence of level-(L+1) files. We switch to producing a new level-(L+1) file after the current output file has reached the target file size (2MB). We also switch to a new output file when the key range of the current output file has grown enough to overlap more then ten level-(L+2) files. This last rule ensures that a later compaction of a level-(L+1) file will not pick up too much data from level-(L+2).

The old files are discarded and the new files are added to the serving state.

Compactions for a particular level rotate through the key space. In more detail, for each level L, we remember the ending key of the last compaction at level L. The next compaction for level L will pick the first file that starts after this key (wrapping around to the beginning of the key space if there is no such file).

Compactions drop overwritten values. They also drop deletion markers if there are no higher numbered levels that contain a file whose range overlaps the current key.

Timing

Level-0 compactions will read up to four 1MB files from level-0, and at worst all the level-1 files (10MB). I.e., we will read 14MB and write 14MB.

Other than the special level-0 compactions, we will pick one 2MB file from level L. In the worst case, this will overlap ~ 12 files from level L+1 (10 because level-(L+1) is ten times the size of level-L, and another two at the boundaries since the file ranges at level-L will usually not be aligned with the file ranges at level-L+1). The compaction will therefore read 26MB and write 26MB. Assuming a disk IO rate of 100MB/s (ballpark range for modern drives), the worst compaction cost will be approximately 0.5 second.

If we throttle the background writing to something small, say 10% of the full 100MB/s speed, a compaction may take up to 5 seconds. If the user is writing at 10MB/s, we might build up lots of level-0 files (~50 to hold the 5*10MB). This may signficantly increase the cost of reads due to the overhead of merging more files together on every read.

Solution 1: To reduce this problem, we might want to increase the log switching threshold when the number of level-0 files is large. Though the downside is that the larger this threshold, the more memory we will need to hold the corresponding memtable.

Solution 2: We might want to decrease write rate artificially when the number of level-0 files goes up.

Solution 3: We work on reducing the cost of very wide merges. Perhaps most of the level-0 files will have their blocks sitting uncompressed in the cache and we will only need to worry about the O(N) complexity in the merging iterator.

Number of files

Instead of always making 2MB files, we could make larger files for larger levels to reduce the total file count, though at the expense of more bursty compactions. Alternatively, we could shard the set of files into multiple directories.

An experiment on an ext3 filesystem on Feb 04, 2011 shows the following timings to do 100K file opens in directories with varying number of files:
Files in directoryMicroseconds to open a file
10009
1000010
10000016
So maybe even the sharding is not necessary on modern filesystems?

Recovery

  • Read CURRENT to find name of the latest committed MANIFEST
  • Read the named MANIFEST file
  • Clean up stale files
  • We could open all sstables here, but it is probably better to be lazy...
  • Convert log chunk to a new level-0 sstable
  • Start directing new writes to a new log file with recovered sequence#

Garbage collection of files

DeleteObsoleteFiles() is called at the end of every compaction and at the end of recovery. It finds the names of all files in the database. It deletes all log files that are not the current log file. It deletes all table files that are not referenced from some level and are not the output of an active compaction. armory-0.92.3/cppForSwig/leveldb/doc/table_format.txt0000644000000000000000000000725212414772654021303 0ustar rootrootFile format =========== [data block 1] [data block 2] ... [data block N] [meta block 1] ... [meta block K] [metaindex block] [index block] [Footer] (fixed size; starts at file_size - sizeof(Footer)) The file contains internal pointers. Each such pointer is called a BlockHandle and contains the following information: offset: varint64 size: varint64 See https://developers.google.com/protocol-buffers/docs/encoding#varints for an explanation of varint64 format. (1) The sequence of key/value pairs in the file are stored in sorted order and partitioned into a sequence of data blocks. These blocks come one after another at the beginning of the file. Each data block is formatted according to the code in block_builder.cc, and then optionally compressed. (2) After the data blocks we store a bunch of meta blocks. The supported meta block types are described below. More meta block types may be added in the future. Each meta block is again formatted using block_builder.cc and then optionally compressed. (3) A "metaindex" block. It contains one entry for every other meta block where the key is the name of the meta block and the value is a BlockHandle pointing to that meta block. (4) An "index" block. This block contains one entry per data block, where the key is a string >= last key in that data block and before the first key in the successive data block. The value is the BlockHandle for the data block. (6) At the very end of the file is a fixed length footer that contains the BlockHandle of the metaindex and index blocks as well as a magic number. metaindex_handle: char[p]; // Block handle for metaindex index_handle: char[q]; // Block handle for index padding: char[40-p-q]; // zeroed bytes to make fixed length // (40==2*BlockHandle::kMaxEncodedLength) magic: fixed64; // == 0xdb4775248b80fb57 (little-endian) "filter" Meta Block ------------------- If a "FilterPolicy" was specified when the database was opened, a filter block is stored in each table. The "metaindex" block contains an entry that maps from "filter." to the BlockHandle for the filter block where "" is the string returned by the filter policy's "Name()" method. The filter block stores a sequence of filters, where filter i contains the output of FilterPolicy::CreateFilter() on all keys that are stored in a block whose file offset falls within the range [ i*base ... (i+1)*base-1 ] Currently, "base" is 2KB. So for example, if blocks X and Y start in the range [ 0KB .. 2KB-1 ], all of the keys in X and Y will be converted to a filter by calling FilterPolicy::CreateFilter(), and the resulting filter will be stored as the first filter in the filter block. The filter block is formatted as follows: [filter 0] [filter 1] [filter 2] ... [filter N-1] [offset of filter 0] : 4 bytes [offset of filter 1] : 4 bytes [offset of filter 2] : 4 bytes ... [offset of filter N-1] : 4 bytes [offset of beginning of offset array] : 4 bytes lg(base) : 1 byte The offset array at the end of the filter block allows efficient mapping from a data block offset to the corresponding filter. "stats" Meta Block ------------------ This meta block contains a bunch of stats. The key is the name of the statistic. The value contains the statistic. TODO(postrelease): record following stats. data size index size key size (uncompressed) value size (uncompressed) number of entries number of data blocks armory-0.92.3/cppForSwig/leveldb_windows_port/0000755000000000000000000000000012414772654020146 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb_windows_port/leveldb_msvc11_port.vcxproj.filters0000644000000000000000000002316212414772654027111 0ustar rootroot {4FC737F1-C7A5-4376-A066-2A32D752A2FF} cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx {93995380-89BD-4b04-88EB-625FBE52EBFB} h;hpp;hxx;hm;inl;inc;xsd {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/0000755000000000000000000000000012414772654022332 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/dirent_win32.cpp0000644000000000000000000001161712414772654025353 0ustar rootroot/* Implementation of POSIX directory browsing functions and types for Win32. Author: Kevlin Henney (kevlin@acm.org, kevlin@curbralan.com) History: Created March 1997. Updated June 2003 and July 2012. Rights: See end of file. */ #include #include #include /* _findfirst and _findnext set errno iff they return -1 */ #include #include #include typedef ptrdiff_t handle_type; /* C99's intptr_t not sufficiently portable */ struct DIR { handle_type handle; /* -1 for failed rewind */ //struct _finddata_t info; struct _wfinddata_t winfo; struct dirent result; /* d_name null iff first time */ //char *name; /* null-terminated char string */ wchar_t *wname; /* null-terminated wchar string */ }; /*DIR *opendir(const char *name) { DIR *dir = 0; if(name && name[0]) { size_t base_length = strlen(name); const char *all = strchr("/\\", name[base_length - 1]) ? "*" : "/*"; if((dir = (DIR *) malloc(sizeof *dir)) != 0 && (dir->name = (char *) malloc(base_length + strlen(all) + 2)) != 0) { //make sure '.' is prepended to paths starting with '/' if(name[0]=='/') { dir->name[0] = '.'; dir->name[1] = 0; } else dir->name[0] = 0; strcat(strcat(dir->name, name), all); if((dir->handle = (handle_type) _findfirst(dir->name, &dir->info)) != -1) { dir->result.d_name = 0; } else { free(dir->name); free(dir); dir = 0; } } else { free(dir); dir = 0; errno = ENOMEM; } } else { errno = EINVAL; } return dir; }*/ DIR *opendir(const char *name) { wchar_t *namew = (wchar_t*)malloc(sizeof(wchar_t)*(strlen(name)+1)); MultiByteToWideChar(CP_UTF8, 0, name, -1, namew, strlen(name)+1); DIR *rtdir = opendir(namew); free(namew); return rtdir; } DIR *opendir(const wchar_t *name) { DIR *dir = 0; if(name && name[0]) { size_t base_length = wcslen(name); const wchar_t *all = /* search pattern must end with suitable wildcard */ wcschr(L"/\\", name[base_length - 1]) ? L"*" : L"/*"; if((dir = (DIR *) malloc(sizeof *dir)) != 0 && (dir->wname = (wchar_t *) malloc(sizeof(wchar_t)*(base_length + wcslen(all) + 2))) != 0) { dir->result.d_name = 0; //make sure '.' is prepended to paths starting with '/' if(name[0]==L'/') { dir->wname[0] = L'.'; dir->wname[1] = 0; } else dir->wname[0] = 0; wcscat(wcscat(dir->wname, name), all); if((dir->handle = (handle_type) _wfindfirst(dir->wname, &dir->winfo)) != -1) { dir->result.wd_name = 0; dir->result.d_name = (char*)malloc(MAX_PATH); } else /* rollback */ { free(dir->wname); free(dir); dir = 0; } } else /* rollback */ { free(dir); dir = 0; errno = ENOMEM; } } else { errno = EINVAL; } return dir; } int closedir(DIR *dir) { int result = -1; if(dir) { if(dir->handle != -1) { result = _findclose(dir->handle); } if(dir->result.d_name) free(dir->result.d_name); free(dir->wname); free(dir); } if(result == -1) /* map all errors to EBADF */ { errno = EBADF; } return result; } struct dirent *readdir(DIR *dir) { struct dirent *result = 0; if(dir && dir->handle != -1) { if(!dir->result.wd_name || _wfindnext(dir->handle, &dir->winfo) != -1) { result = &dir->result; result->wd_name = dir->winfo.name; WideCharToMultiByte(CP_UTF8, 0, dir->winfo.name, -1, result->d_name, MAX_PATH, 0, 0); } } else { errno = EBADF; } return result; } void rewinddir(DIR *dir) { if(dir && dir->handle != -1) { _findclose(dir->handle); dir->handle = (handle_type) _wfindfirst(dir->wname, &dir->winfo); dir->result.wd_name = 0; dir->result.d_name[0] = 0; } else { errno = EBADF; } } /* Copyright Kevlin Henney, 1997, 2003, 2012. All rights reserved. Permission to use, copy, modify, and distribute this software and its documentation for any purpose is hereby granted without fee, provided that this copyright and permissions notice appear in all copies and derivatives. This software is supplied "as is" without express or implied warranty. But that said, if there are any problems please get in touch. */armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/dirent_win32.h0000644000000000000000000000174512414772654025021 0ustar rootroot#ifndef DIRENT_INCLUDED #define DIRENT_INCLUDED /* Declaration of POSIX directory browsing functions and types for Win32. Author: Kevlin Henney (kevlin@acm.org, kevlin@curbralan.com) History: Created March 1997. Updated June 2003. Rights: See end of file. */ typedef struct DIR DIR; struct dirent { char *d_name; wchar_t *wd_name; }; DIR *opendir(const char *); DIR *opendir(const wchar_t *); int closedir(DIR *); struct dirent *readdir(DIR *); void rewinddir(DIR *); /* Copyright Kevlin Henney, 1997, 2003. All rights reserved. Permission to use, copy, modify, and distribute this software and its documentation for any purpose is hereby granted without fee, provided that this copyright and permissions notice appear in all copies and derivatives. This software is supplied "as is" without express or implied warranty. But that said, if there are any problems please get in touch. */ #endifarmory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/mman.h0000644000000000000000000000244612414772654023441 0ustar rootroot/* * sys/mman.h * mman-win32 */ #ifndef _SYS_MMAN_H_ #define _SYS_MMAN_H_ #ifndef _WIN32_WINNT // Allow use of features specific to Windows XP or later. #define _WIN32_WINNT 0x0501 // Change this to the appropriate value to target other versions of Windows. #endif /* All the headers include this file. */ #ifndef _MSC_VER #include <_mingw.h> #endif #include #ifdef __cplusplus extern "C" { #endif #define PROT_NONE 0 #define PROT_READ 1 #define PROT_WRITE 2 #define PROT_EXEC 4 #define MAP_FILE 0 #define MAP_SHARED 1 #define MAP_PRIVATE 2 #define MAP_TYPE 0xf #define MAP_FIXED 0x10 #define MAP_ANONYMOUS 0x20 #define MAP_ANON MAP_ANONYMOUS #define MAP_FAILED ((void *)-1) /* Flags for msync. */ #define MS_ASYNC 1 #define MS_SYNC 2 #define MS_INVALIDATE 4 void* mmap(void *addr, size_t len, int prot, int flags, int fildes, off_t off); int munmap(void *addr, size_t len); int mprotect(void *addr, size_t len, int prot); int msync(void *addr, size_t len, int flags); int mlock(const void *addr, size_t len); int munlock(const void *addr, size_t len); #ifdef __cplusplus }; #endif #endif /* _SYS_MMAN_H_ */armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/Win_TranslatePath.h0000644000000000000000000000013112414772654026065 0ustar rootroot#include #include std::wstring Win_TranslatePath(std::string path);armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/dirent.h0000644000000000000000000000030612414772654023767 0ustar rootroot/***Empty file to stop the compiler from throwing errors about absent header files. I picked this option over commenting out these particular includes in order to speed up the upgrading process ***/armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/file.h0000644000000000000000000000225412414772654023425 0ustar rootroot/** * @file file.h * Copyright 2012, 2013 MinGW.org project * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the "Software"), * to deal in the Software without restriction, including without limitation * the rights to use, copy, modify, merge, publish, distribute, sublicense, * and/or sell copies of the Software, and to permit persons to whom the * Software is furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice (including the next * paragraph) shall be included in all copies or substantial portions of the * Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER * DEALINGS IN THE SOFTWARE. */ #include armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/endian.h0000644000000000000000000000006012414772654023735 0ustar rootroot#define __BYTE_ORDER 1 #define __LITTLE_ENDIAN 1armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/unistd.h0000644000000000000000000000030612414772654024010 0ustar rootroot/***Empty file to stop the compiler from throwing errors about absent header files. I picked this option over commenting out these particular includes in order to speed up the upgrading process ***/armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/pthread_win32port.cpp0000644000000000000000000000455512414772654026425 0ustar rootroot#include "pthread.h" int pthread_mutex_init(pthread_mutex_t *mu, const int mutex_attr) { InitializeCriticalSection(mu); return 0; } DWORD pthread_self() { return GetCurrentThreadId(); } int pthread_mutex_lock(pthread_mutex_t *mu) { EnterCriticalSection(mu); return 0; } int pthread_mutex_unlock(pthread_mutex_t *mu) { LeaveCriticalSection(mu); return 0; } int pthread_mutex_destroy(pthread_mutex_t *mu) { DeleteCriticalSection(mu); return 0; } int pthread_create(pthread_t *tid, pthread_attr_t *attr, void*(*start)(void*), void *arg) { if(CreateThread(NULL, NULL, (LPTHREAD_START_ROUTINE)start, arg, 0, tid)) return 0; return -1; } #ifdef USE_CONDVAR int pthread_cond_init(pthread_cond_t *cond, const pthread_condattr_t *attr) { InitializeConditionVariable(cond); return 0; } int pthread_cond_signal(pthread_cond_t *cond) { WakeConditionVariable(cond); return 0; } int pthread_cond_broadcast(pthread_cond_t *cond) { WakeAllConditionVariable(cond); return 0; } int pthread_cond_wait(pthread_cond_t *cond, pthread_mutex_t *mu) { SleepConditionVariableCS(cond, mu, INFINITE); return 0; } int pthread_cond_destroy(pthread_cond_t *cond) { return 0; } #else //in case it has to run on WinXP, condition variables aren't supported, have to implement them with oldschool WinAPI calls. int pthread_cond_init(pthread_cond_t *cond, const pthread_condattr_t *attr) { (*cond) = (pthread_cond_t_*)malloc(sizeof(pthread_cond_t_)); (*cond)->Broadcast = 0; (*cond)->resetEvent = 0; (*cond)->mu = 0; (*cond)->EV = CreateEvent(NULL, 0, 0, NULL); return 0; } int pthread_cond_signal(pthread_cond_t *cond) { SetEvent((*cond)->EV); return 0; } int pthread_cond_broadcast(pthread_cond_t *cond) { _InterlockedExchange(&(*cond)->Broadcast, 1); SetEvent((*cond)->EV); return 0; } int pthread_cond_wait(pthread_cond_t *cond, pthread_mutex_t *mu) { LeaveCriticalSection(mu); WaitForSingleObject((*cond)->EV, INFINITE); EnterCriticalSection(mu); if((*cond)->Broadcast) SetEvent((*cond)->EV); return 0; } int pthread_cond_destroy(pthread_cond_t *cond) { CloseHandle((*cond)->EV); free(*cond); *cond = 0; return 0; } #endif int pthread_once(pthread_once_t *once, void (*func)(void)) { while(*once!=1) { if(!InterlockedCompareExchange(once, 2, 0)) { if(*once==2) func(); //consume once to prevent reordering *once=1; return 0; } } return 0; }armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/sched.h0000644000000000000000000001160312414772654023572 0ustar rootroot/* * Module: sched.h * * Purpose: * Provides an implementation of POSIX realtime extensions * as defined in * * POSIX 1003.1b-1993 (POSIX.1b) * * -------------------------------------------------------------------------- * * Pthreads-win32 - POSIX Threads Library for Win32 * Copyright(C) 1998 John E. Bossom * Copyright(C) 1999,2005 Pthreads-win32 contributors * * Contact Email: rpj@callisto.canberra.edu.au * * The current list of contributors is contained * in the file CONTRIBUTORS included with the source * code distribution. The list can also be seen at the * following World Wide Web location: * http://sources.redhat.com/pthreads-win32/contributors.html * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library in the file COPYING.LIB; * if not, write to the Free Software Foundation, Inc., * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA */ #if !defined(_SCHED_H) #define _SCHED_H #undef PTW32_SCHED_LEVEL #if defined(_POSIX_SOURCE) #define PTW32_SCHED_LEVEL 0 /* Early POSIX */ #endif #if defined(_POSIX_C_SOURCE) && _POSIX_C_SOURCE >= 199309 #undef PTW32_SCHED_LEVEL #define PTW32_SCHED_LEVEL 1 /* Include 1b, 1c and 1d */ #endif #if defined(INCLUDE_NP) #undef PTW32_SCHED_LEVEL #define PTW32_SCHED_LEVEL 2 /* Include Non-Portable extensions */ #endif #define PTW32_SCHED_LEVEL_MAX 3 #if ( defined(_POSIX_C_SOURCE) && _POSIX_C_SOURCE >= 200112 ) || !defined(PTW32_SCHED_LEVEL) #define PTW32_SCHED_LEVEL PTW32_SCHED_LEVEL_MAX /* Include everything */ #endif #if defined(__GNUC__) && !defined(__declspec) # error Please upgrade your GNU compiler to one that supports __declspec. #endif /* * When building the library, you should define PTW32_BUILD so that * the variables/functions are exported correctly. When using the library, * do NOT define PTW32_BUILD, and then the variables/functions will * be imported correctly. */ #if !defined(PTW32_STATIC_LIB) # if defined(PTW32_BUILD) # define PTW32_DLLPORT __declspec (dllexport) # else # define PTW32_DLLPORT __declspec (dllimport) # endif #else # define PTW32_DLLPORT #endif /* * This is a duplicate of what is in the autoconf config.h, * which is only used when building the pthread-win32 libraries. */ #if !defined(PTW32_CONFIG_H) # if defined(WINCE) # define NEED_ERRNO # define NEED_SEM # endif # if defined(__MINGW64__) # define HAVE_STRUCT_TIMESPEC # define HAVE_MODE_T # elif defined(_UWIN) || defined(__MINGW32__) # define HAVE_MODE_T # endif #endif /* * */ #if PTW32_SCHED_LEVEL >= PTW32_SCHED_LEVEL_MAX #if defined(NEED_ERRNO) #include "need_errno.h" #else #include #endif #endif /* PTW32_SCHED_LEVEL >= PTW32_SCHED_LEVEL_MAX */ #if (defined(__MINGW64__) || defined(__MINGW32__)) || defined(_UWIN) # if PTW32_SCHED_LEVEL >= PTW32_SCHED_LEVEL_MAX /* For pid_t */ # include /* Required by Unix 98 */ # include # else typedef int pid_t; # endif #else typedef int pid_t; #endif /* Thread scheduling policies */ enum { SCHED_OTHER = 0, SCHED_FIFO, SCHED_RR, SCHED_MIN = SCHED_OTHER, SCHED_MAX = SCHED_RR }; struct sched_param { int sched_priority; }; #if defined(__cplusplus) extern "C" { #endif /* __cplusplus */ PTW32_DLLPORT int __cdecl sched_yield (void); PTW32_DLLPORT int __cdecl sched_get_priority_min (int policy); PTW32_DLLPORT int __cdecl sched_get_priority_max (int policy); PTW32_DLLPORT int __cdecl sched_setscheduler (pid_t pid, int policy); PTW32_DLLPORT int __cdecl sched_getscheduler (pid_t pid); /* * Note that this macro returns ENOTSUP rather than * ENOSYS as might be expected. However, returning ENOSYS * should mean that sched_get_priority_{min,max} are * not implemented as well as sched_rr_get_interval. * This is not the case, since we just don't support * round-robin scheduling. Therefore I have chosen to * return the same value as sched_setscheduler when * SCHED_RR is passed to it. */ #define sched_rr_get_interval(_pid, _interval) \ ( errno = ENOTSUP, (int) -1 ) #if defined(__cplusplus) } /* End of extern "C" */ #endif /* __cplusplus */ #undef PTW32_SCHED_LEVEL #undef PTW32_SCHED_LEVEL_MAX #endif /* !_SCHED_H */ armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/win32_posix.h0000644000000000000000000001000012414772654024656 0ustar rootroot#include #include #include #include #include #include #include #include #include #include #include #include #include #include "stdint.h" #if defined LEVELDB_DLL #define LEVELDB_EXPORT __declspec(dllimport) #elif defined DLL_BUILD #define LEVELDB_EXPORT __declspec(dllexport) #else #define LEVELDB_EXPORT #endif #define F_OK 0 typedef int __ssize_t; typedef __ssize_t ssize_t; #ifdef small #undef small #endif #ifdef large #undef large #endif #ifdef DeleteFile #undef DeleteFile #endif //straight forward ports #define fread_unlocked _fread_nolock #define fwrite_unlocked _fwrite_nolock #define fflush_unlocked _fflush_nolock #define fsync fsync_win32 #define fdatasync fsync_win32 #define close _close #define open open_win32 #define access access_win32 #define unlink unlink_win32 #define rmdir rmdir_win32 #define mkdir mkdir_win32 #define rename rename_win32 #define fopen fopen_win32 #define stat stat_win32 /*** Regarding stat: for stat to point at the function and not the struct in win32, sys/types.h has to be declared BEFORE sys/stat.h, which isn't the case with env_posix.cc This one is a bit painful. In order for the function to be accessible, it has to be defined after the struct. Since the attempt of this port is to limit modification of source file to a maximum, the idea is to #define stat to stat_win32 and perform all the required handling over here. However life isn't so simple: this #define makes the struct unaccessible since #define doesn't discriminate between the function and the struct. However, now that stat (the function) has been defined to another name (stat_win32) we can redefine the structure. However we can't simply use this #define before the sys/stat.h include since stat would then be redefined as a function, cancelling the whole process ***/ struct stat { _dev_t st_dev; _ino_t st_ino; unsigned short st_mode; short st_nlink; short st_uid; short st_gid; _dev_t st_rdev; _off_t st_size; __time64_t st_atime; __time64_t st_mtime; __time64_t st_ctime; }; int open_win32(const char *path, int flag, int pmode); int open_win32(const char *path, int flag); int access_win32(const char *path, int mode); int unlink_win32(const char *path); int rmdir_win32(const char *path); int rmdir_win32(std::string st_in); int mkdir_win32(const char *path, int mode); int mkdir_win32(std::string st_in); int rename_win32(const char *oldname, const char *newname); int stat_win32(const char *path, struct stat *Sin); FILE* fopen_win32(const char *path, const char *mode); int fsync_win32(int fd); int fread_unlockd(void *_DstBuf, size_t _EleSize, size_t _Count, FILE *_file); wchar_t *posix_path_to_win32(const char *posix_path); wchar_t *posix_path_to_win32_full(const char *posix_path); #define va_copy(d,s) ((d) = (s)) #define pread pread_win32 int pread_win32(int fd, void *buff, unsigned int size, off_t offset); #define ftruncate ftruncate_win32 int ftruncate_win32(int fd, off_t length); #define gettimeofday gettimeofday_win32 int gettimeofday_win32(timeval *tv, timeval *tz); #define localtime_r localtime_r_win32 tm* localtime_r_win32(const time_t *tin, tm *tout); #define geteuid geteuid_win32 int geteuid_win32(); #define usleep usleep_win32 void usleep_win32(unsigned long long in); #define getpagesize getpagesize_win32 long getpagesize_win32(); #define F_WRLCK _LK_NBLCK #define F_UNLCK _LK_UNLCK #define F_SETLK 1 struct flock { unsigned _int32 l_type, l_whence, l_start, l_len; }; #define fcntl fcntl_win32 int fcntl_win32(int fd, unsigned _int32 command, flock *f); #define strdup _strdup /*** consider redoing snprintf ***/ #define snprintf c99_snprintf //stick to this for now unless it fucks up horribly int c99_vsnprintf(char* str, size_t size, const char* format, va_list ap); int c99_snprintf(char* str, size_t size, const char* format, ...); armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/mman.cpp0000644000000000000000000001001412414772654023762 0ustar rootroot#include #include #include #include "mman.h" #ifndef FILE_MAP_EXECUTE #define FILE_MAP_EXECUTE 0x0020 #endif /* FILE_MAP_EXECUTE */ static int __map_mman_error(const DWORD err, const int deferr) { if (err == 0) return 0; //TODO: implement return err; } static DWORD __map_mmap_prot_page(const int prot) { DWORD protect = 0; if (prot == PROT_NONE) return protect; if ((prot & PROT_EXEC) != 0) { protect = ((prot & PROT_WRITE) != 0) ? PAGE_EXECUTE_READWRITE : PAGE_EXECUTE_READ; } else { protect = ((prot & PROT_WRITE) != 0) ? PAGE_READWRITE : PAGE_READONLY; } return protect; } static DWORD __map_mmap_prot_file(const int prot) { DWORD desiredAccess = 0; if (prot == PROT_NONE) return desiredAccess; if ((prot & PROT_READ) != 0) desiredAccess |= FILE_MAP_READ; if ((prot & PROT_WRITE) != 0) desiredAccess |= FILE_MAP_WRITE; if ((prot & PROT_EXEC) != 0) desiredAccess |= FILE_MAP_EXECUTE; return desiredAccess; } void* mmap(void *addr, size_t len, int prot, int flags, int fildes, off_t off) { HANDLE fm, h; void * map = MAP_FAILED; #ifdef _MSC_VER #pragma warning(push) #pragma warning(disable: 4293) #endif const DWORD dwFileOffsetLow = (sizeof(off_t) <= sizeof(DWORD)) ? (DWORD)off : (DWORD)(off & 0xFFFFFFFFL); const DWORD dwFileOffsetHigh = (sizeof(off_t) <= sizeof(DWORD)) ? (DWORD)0 : (DWORD)((off >> 32) & 0xFFFFFFFFL); const DWORD protect = __map_mmap_prot_page(prot); const DWORD desiredAccess = __map_mmap_prot_file(prot); const off_t maxSize = off + (off_t)len; const DWORD dwMaxSizeLow = (sizeof(off_t) <= sizeof(DWORD)) ? (DWORD)maxSize : (DWORD)(maxSize & 0xFFFFFFFFL); const DWORD dwMaxSizeHigh = (sizeof(off_t) <= sizeof(DWORD)) ? (DWORD)0 : (DWORD)((maxSize >> 32) & 0xFFFFFFFFL); #ifdef _MSC_VER #pragma warning(pop) #endif errno = 0; if (len == 0 /* Unsupported flag combinations */ || (flags & MAP_FIXED) != 0 /* Usupported protection combinations */ || prot == PROT_EXEC) { errno = EINVAL; return MAP_FAILED; } h = ((flags & MAP_ANONYMOUS) == 0) ? (HANDLE)_get_osfhandle(fildes) : INVALID_HANDLE_VALUE; if ((flags & MAP_ANONYMOUS) == 0 && h == INVALID_HANDLE_VALUE) { errno = EBADF; return MAP_FAILED; } fm = CreateFileMapping(h, NULL, protect, dwMaxSizeHigh, dwMaxSizeLow, NULL); if (fm == NULL) { errno = __map_mman_error(GetLastError(), EPERM); return MAP_FAILED; } map = MapViewOfFile(fm, desiredAccess, dwFileOffsetHigh, dwFileOffsetLow, len); CloseHandle(fm); if (map == NULL) { errno = __map_mman_error(GetLastError(), EPERM); return MAP_FAILED; } return map; } int munmap(void *addr, size_t len) { if (UnmapViewOfFile(addr)) return 0; errno = __map_mman_error(GetLastError(), EPERM); return -1; } int mprotect(void *addr, size_t len, int prot) { DWORD newProtect = __map_mmap_prot_page(prot); DWORD oldProtect = 0; if (VirtualProtect(addr, len, newProtect, &oldProtect)) return 0; errno = __map_mman_error(GetLastError(), EPERM); return -1; } int msync(void *addr, size_t len, int flags) { if (FlushViewOfFile(addr, len)) return 0; errno = __map_mman_error(GetLastError(), EPERM); return -1; } int mlock(const void *addr, size_t len) { if (VirtualLock((LPVOID)addr, len)) return 0; errno = __map_mman_error(GetLastError(), EPERM); return -1; } int munlock(const void *addr, size_t len) { if (VirtualUnlock((LPVOID)addr, len)) return 0; errno = __map_mman_error(GetLastError(), EPERM); return -1; } armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/Instructions.txt0000644000000000000000000001724012414772654025603 0ustar rootrootPorting leveldb to msvc11: LevelDB is mostly a POSIX project, that alone is quite the task to port on msvc11. On Windows, compiling POSIX projects can be achieved at little cost using MinGW and its GCC compiler. It becomes a different story with Microsoft's dedicated compiler. There's 2 ways to port LevelDB to unsupported POSIX OS's (read Windows): 1: Provide a full rewrite of the port and env classes with the OS's native system API 2: Leave the source untouched redefine the POSIX calls to your own calls simulating the POSIX behavior with WinAPI calls. The goal of this port is to allow for a full build of the db with as little modification to the source as possible, allowing to quickly deploy LevelDB updates. For this purpose I picked the second solution. The port comes with 2 packages: a msvc11_port folder holding all the ported code: the mman port comes from: https://code.google.com/p/mman-win32/ the dirent port is the courtesy of Kevlin Henney rest is from me besides snprint_C99, found on stackexchange, although it feels overkill (http://stackoverflow.com/questions/2915672/snprintf-and-visual-studio-2010). I try to explain the why and hows of my code in comments. Ports I've taken from others are more or less commented. All questions regarding these should be directed to their respective authors. pthread_win32: a port of POSIX threads lib to win32, to be picked up here: ftp://sourceware.org/pub/pthreads-win32 LevelDB is based on pthread for its threading API, which naturally, isn't natively available on Windows. There are 3 solutions to this issue. First, rewrite the port class entirely. Second, redefine the calls to pthreads and redo them in WinAPI, what has been done with the other POSIX calls so far. However that's a much tought task. Third, be lazy and grab the prebuilt pthreads binaries for win32 =P. Note that pthreads-win32 is a MinGW/GCC project, it won't build in msvc, but with the use extern "C", it yields msvc compatible DLLs and libs. If you wish to compile it yourself, go ahead and get MinGW. Keep in mind that the solution picked implies you have to link all your projects with the pthread lib file and have the pthread dll sit in the folder with the .exe How to build this project, from an empty project and leveldb's source: #1 Add all the files found in the following folders to your project: leveldb/port leveldb/util leveldb/table leveldb/db (from the leveldb source) #2 After adding these files, remove from your project all .cc files with _test and _bench suffixes (any file with a main() declared, we're trying to build a library here). Get rid of anything that doesn't end with .cc or .h as well (README's and friends) #3 add the following folders to your include paths: /msvc11_port /leveldb (the leveldb source root folder) /leveldb/include #4 define following global compiler directives (in project>properties>pconfiguration properties>C/C++>preprocessor): _CRT_SECURE_NO_wARNINGS LEVELDB_PLATFORM_POSIX LEVELDB_CSTDATOMIC_PRESENT NOMINMAX #5 in atomic_pointer.h, look for these lines: #ifdef LEVELDB_CSTDATOMIC_PRESENT #include #endif Replace them with #ifdef LEVELDB_CSTDATOMIC_PRESENT #ifdef _WIN32 #include #elif #include #endif #endif #6 in port_posix.h, add these lines after #include #endif: #ifdef _MSC_VER #include #endif #7 add this line after the includes in c.cc #define strdup _strdup #8 add win32_posix.cpp, mman.cpp and dirent_win32.cpp to the project, found in the msvc11_port folder #9 link the pthreads lib of your choice to the project: either pthreadVC2.lib or pthreadVCE2.lib. VC is pure C, VCE uses CXX standards. I'd presume VCE is faster. Note that only VC is available in x64. I used VC personally for my tests. #10 at this point you can build your project. You are now in front of a few choices, found in Properties > C/C++ > General -> Configuration Type: exe: you can add one of _test or _bench files back in to build an exe and test the db. I personally ran the benchmark and tests in db_test.cc in 32bit and 64bit to make sure the port was functional. static lib: This is your best choice. At this point you can simply build the lib and link it to your project. Keep in mind that with static libraries, the runtime library option you pick in your project has to match the one picked to build the lib. This option is found in Properties > C/C++ > Code Generation -> Runtime Library. 2 choices are available: multi threaded (/MT) or multithreaded dll (/MD) (debug versions are meaningless at this point). If your lib was built with /MD, whatever project you're linking it to has to be built with /MD as well, same with /MT. dynamic lib (dll): This is a decent option however it's one that requires some editing the leveldb source: you'll have to prepend LEVELDB_EXPORT to all the classes and members you want in your dll, or they simply won't be exported. How to figure out what you need? When you build your .exe, if the linker complains about unresolved external, there you have it. Now go back to the leveldb source, look for the symbol with the search function. Once you've found one, right click it and pick "Go To Definition". Now you can add LEVELDB_EXPORT in front of it. Note: for classes and structs, you have to add LEVELDB_EXPORTS between class/struct and the declaration, like this: 'class myClass' becomes 'class LEVELDB_EXPORT myClass' Once you're done with that, add LEVELDB_DLL to global definitions in the leveldb project and DLL_BUILD into whatever project you're going to use this dll in. There's a workaround to this mess, with a .def file, but it's even more miserable: you have to write decorated names of the symbols you want in a .def file and feed it to the linker. Long story short, I have to setup an automated prebuild process to do it programatically, and that's too much work right now xD. /*** where's snappy at? ***/ If you want to use snappy with leveldb, simply build it from source. Snappy doesn't use any system call so there's nothing else to do but to build it in msvc. You have a couple ways to do this: Either add snappy's code to your leveldb project and build everything on the go (you get some type redefinition bitching though) or, the way I recommend, is to build it as a static lib and link it to your leveldb project. Building it is straight forward: pick all files .cc and .h files in the snappy source folder, minues the ones ending in _test, pick static lib in the output, make sure it's the right CRT option (/MT or /MD) and proper architecture (x86 or x64), then just build it. You can grab snappy here: https://code.google.com/p/snappy/downloads/list /*** my shit won't work on WinXP! ***/ Binaries compiled with msvc11 won't work on anything older than Vista. If you want a msvc build of LevelDB that compiles and runs on WinXP you have 2 options: 1) Use the WinXP build tool for msvc11, which should be bundled with msvc11 express. You'll find it in Properties > C/C++ > General -> Platform Toolset If you don't have it, install msvc10 express, it comes with msvc9/10 binaries as well. Keep in mind that I have never tested this toolset, so I can't garantee the result. 2) Grab and build leveldbwin https://code.google.com/p/leveldbwin/ Note that it uses an old version of LevelDB, but you can always attempt to upgrade it on your own. It also needs ATL to build. You'll need a pay version of msvc 9 and above. Or, if you're using msvc10+ express, download and install ATL binaries from the Windows Driver Devellopement Kit 7.1 (WinDDK). Don't go for ver 8.0 and above as they don't come with ATL anymore. Have questions? Need help? Or just want to comment? Pm goatpig on the bitcoin forums (bitcointalk.org) armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/pthread.h0000644000000000000000000000251512414772654024135 0ustar rootroot/*** Minimal pthread port for leveldb purpose Cancelation isn't supported ***/ #ifndef PTHREADS #define PTHREADS #include #include #ifdef DeleteFile #undef DeleteFile #endif #pragma intrinsic(_ReadWriteBarrier) typedef CRITICAL_SECTION pthread_mutex_t; typedef DWORD pthread_t; typedef int pthread_attr_t; #ifdef USE_CONDVAR typedef CONDITION_VARIABLE pthread_cond_t; #else struct pthread_cond_t_ { volatile long Broadcast; volatile long resetEvent; HANDLE mu; HANDLE EV; }; typedef struct pthread_cond_t_ * pthread_cond_t; #endif typedef int * pthread_condattr_t; #define PTHREAD_ONCE_INIT 0 typedef volatile long pthread_once_t; int pthread_mutex_init(pthread_mutex_t *mu, const int mutex_attr); int pthread_mutex_lock(pthread_mutex_t *mu); int pthread_mutex_unlock(pthread_mutex_t *mu); int pthread_mutex_destroy(pthread_mutex_t *mu); int pthread_create(pthread_t *tid, pthread_attr_t *attr, void*(*start)(void*), void *arg); int pthread_cond_init(pthread_cond_t *cond, const pthread_condattr_t *attr); int pthread_cond_signal(pthread_cond_t *cond); int pthread_cond_broadcast(pthread_cond_t *cond); int pthread_cond_wait(pthread_cond_t *cond, pthread_mutex_t *mu); int pthread_cond_destroy(pthread_cond_t *cond); DWORD pthread_self(); int pthread_once(pthread_once_t *once, void (*func)(void)); #endif armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/semaphore.h0000644000000000000000000001072312414772654024471 0ustar rootroot/* * Module: semaphore.h * * Purpose: * Semaphores aren't actually part of the PThreads standard. * They are defined by the POSIX Standard: * * POSIX 1003.1b-1993 (POSIX.1b) * * -------------------------------------------------------------------------- * * Pthreads-win32 - POSIX Threads Library for Win32 * Copyright(C) 1998 John E. Bossom * Copyright(C) 1999,2005 Pthreads-win32 contributors * * Contact Email: rpj@callisto.canberra.edu.au * * The current list of contributors is contained * in the file CONTRIBUTORS included with the source * code distribution. The list can also be seen at the * following World Wide Web location: * http://sources.redhat.com/pthreads-win32/contributors.html * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library in the file COPYING.LIB; * if not, write to the Free Software Foundation, Inc., * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA */ #if !defined( SEMAPHORE_H ) #define SEMAPHORE_H #undef PTW32_SEMAPHORE_LEVEL #if defined(_POSIX_SOURCE) #define PTW32_SEMAPHORE_LEVEL 0 /* Early POSIX */ #endif #if defined(_POSIX_C_SOURCE) && _POSIX_C_SOURCE >= 199309 #undef PTW32_SEMAPHORE_LEVEL #define PTW32_SEMAPHORE_LEVEL 1 /* Include 1b, 1c and 1d */ #endif #if defined(INCLUDE_NP) #undef PTW32_SEMAPHORE_LEVEL #define PTW32_SEMAPHORE_LEVEL 2 /* Include Non-Portable extensions */ #endif #define PTW32_SEMAPHORE_LEVEL_MAX 3 #if !defined(PTW32_SEMAPHORE_LEVEL) #define PTW32_SEMAPHORE_LEVEL PTW32_SEMAPHORE_LEVEL_MAX /* Include everything */ #endif #if defined(__GNUC__) && ! defined (__declspec) # error Please upgrade your GNU compiler to one that supports __declspec. #endif /* * When building the library, you should define PTW32_BUILD so that * the variables/functions are exported correctly. When using the library, * do NOT define PTW32_BUILD, and then the variables/functions will * be imported correctly. */ #if !defined(PTW32_STATIC_LIB) # if defined(PTW32_BUILD) # define PTW32_DLLPORT __declspec (dllexport) # else # define PTW32_DLLPORT __declspec (dllimport) # endif #else # define PTW32_DLLPORT #endif /* * This is a duplicate of what is in the autoconf config.h, * which is only used when building the pthread-win32 libraries. */ #if !defined(PTW32_CONFIG_H) # if defined(WINCE) # define NEED_ERRNO # define NEED_SEM # endif # if defined(__MINGW64__) # define HAVE_STRUCT_TIMESPEC # define HAVE_MODE_T # elif defined(_UWIN) || defined(__MINGW32__) # define HAVE_MODE_T # endif #endif /* * */ #if PTW32_SEMAPHORE_LEVEL >= PTW32_SEMAPHORE_LEVEL_MAX #if defined(NEED_ERRNO) #include "need_errno.h" #else #include #endif #endif /* PTW32_SEMAPHORE_LEVEL >= PTW32_SEMAPHORE_LEVEL_MAX */ #define _POSIX_SEMAPHORES #if defined(__cplusplus) extern "C" { #endif /* __cplusplus */ #if !defined(HAVE_MODE_T) typedef unsigned int mode_t; #endif typedef struct sem_t_ * sem_t; PTW32_DLLPORT int __cdecl sem_init (sem_t * sem, int pshared, unsigned int value); PTW32_DLLPORT int __cdecl sem_destroy (sem_t * sem); PTW32_DLLPORT int __cdecl sem_trywait (sem_t * sem); PTW32_DLLPORT int __cdecl sem_wait (sem_t * sem); PTW32_DLLPORT int __cdecl sem_timedwait (sem_t * sem, const struct timespec * abstime); PTW32_DLLPORT int __cdecl sem_post (sem_t * sem); PTW32_DLLPORT int __cdecl sem_post_multiple (sem_t * sem, int count); PTW32_DLLPORT int __cdecl sem_open (const char * name, int oflag, mode_t mode, unsigned int value); PTW32_DLLPORT int __cdecl sem_close (sem_t * sem); PTW32_DLLPORT int __cdecl sem_unlink (const char * name); PTW32_DLLPORT int __cdecl sem_getvalue (sem_t * sem, int * sval); #if defined(__cplusplus) } /* End of extern "C" */ #endif /* __cplusplus */ #undef PTW32_SEMAPHORE_LEVEL #undef PTW32_SEMAPHORE_LEVEL_MAX #endif /* !SEMAPHORE_H */ armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/sys/0000755000000000000000000000000012414772654023150 5ustar rootrootarmory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/sys/mman.h0000644000000000000000000000030612414772654024250 0ustar rootroot/***Empty file to stop the compiler from throwing errors about absent header files. I picked this option over commenting out these particular includes in order to speed up the upgrading process ***/armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/sys/time.h0000644000000000000000000000030612414772654024256 0ustar rootroot/***Empty file to stop the compiler from throwing errors about absent header files. I picked this option over commenting out these particular includes in order to speed up the upgrading process ***/armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/Win_TranslatePath.cpp0000644000000000000000000000036512414772654026431 0ustar rootroot#include std::wstring Win_TranslatePath(std::string path) { wchar_t rtw[MAX_PATH]; MultiByteToWideChar(CP_UTF8, 0, path.c_str(), -1, rtw, MAX_PATH); std::wstring rtstring; rtstring.assign(rtw); return rtstring; } armory-0.92.3/cppForSwig/leveldb_windows_port/win32_posix/win32_posix.cc0000644000000000000000000003476112414772654025040 0ustar rootroot/**************************************************************************************/ /*** goatpig's (moothecowlord@gmail.com) msvc port, free to use, reuse and modify ***/ /**************************************************************************************/ #include /***Path name resolution: have to preppend a '.' to paths starting with '/' or they'll be resolved as "system disk"/pathname All files should be opened in binary mode, as it is the posix standard, which Windows doesn't respect. Files opened without the binary flag will only return data up to the next null bytes. Not only will this yield messed up reads, CRCs will fail and the DB won't setup, returning with an error. ***/ int fread_unlockd(void *_DstBuf, size_t _EleSize, size_t _Count, FILE *_File) { int fd = _fileno(_File); unsigned int rt = _read(fd, _DstBuf, _EleSize*_Count); if(_eof(fd)) { int abc; _fread_nolock(&abc, 1, 1, _File); } return rt; } int pread_win32(int fd, void *buff, unsigned int size, off_t offset) { /*** pread: reads file stream 'fd' from 'offset', for 'size' bytes, into 'buff', and returns the amount of bytes read, without changing the file pointer There is no cstd routine doing this on msvc. Have to use the ReadFile WinAPI, which requires get a WinAPI file handle from fd, which is done by _get_osfhandle. There is no need to destroy to handle. The main issue of this port is to respect atomicity of pread: it's fair to assume pread doesn't modify the file pointer at all, so a port that would read the file, setting the pointer from the read, then rewind it, wouldn't be atomic regarding the file pointer. ***/ unsigned int rt=-1; HANDLE hF = (HANDLE)_get_osfhandle(fd); if(hF) { OVERLAPPED ol; memset(&ol, 0, sizeof(OVERLAPPED)); ol.Offset = offset; ReadFile(hF, buff, size, (DWORD*)&rt, &ol); } return (int)rt; } int ftruncate_win32(int fd, off_t length) { /*** Set size of file stream 'fd' to 'length'. File pointer isn't modified (undefined behavior on shrinked files beyond the current pointer?) Shrinked bytes are lost Extended bytes are set to 0 If file is mapped and shrinked beyond whole mapped pages, the pages are discarded In our impementation we ignore all mapping related code as ftruncate is called before a file is mapped or after it's unmapped within leveldb. The WinAPI call used, SetEndOfFile, requires that the file is unmapped, however there won't be an issue on this front (at this point). No extended bytes will be set to 0, as there doesn't seem to be a need for that. In order to perform this task, find the end of the file and add the extra 0s from there on, as necessary. ***/ HANDLE hF = (HANDLE)_get_osfhandle(fd); if(hF) { unsigned int cpos = _tell(fd); //save current file pointer pos for restoring later if(cpos!= 0xFFFFFFFF) { if(SetFilePointer((HANDLE)hF, length, 0, FILE_BEGIN)!=0xFFFFFFFF) //set file pointer to length { if(SetEndOfFile((HANDLE)hF)) { //file size has been changed, set pointer to back to cpos SetFilePointer((HANDLE)hF, cpos, 0, FILE_BEGIN); return 0; //returns 0 on success } } } } return -1; } int access_win32(const char *path, int mode) { wchar_t *win32_path = posix_path_to_win32(path); int i = _waccess(win32_path, mode); free(win32_path); return i; } int unlink_win32(const char *path) { wchar_t *win32_path = posix_path_to_win32(path); int i = _wunlink(win32_path); free(win32_path); return i; } int open_win32(const char *path, int flag, int pmode) { wchar_t *win32_path = posix_path_to_win32(path); int i = _wopen(win32_path, flag | _O_BINARY, pmode); free(win32_path); return i; } int open_win32(const char *path, int flag) { /***In leveldb, Open(2) may be called to get a file descriptor for a directory. Win32's _open won't accept directories as entry so you're kebab. This port is particularly annoying as you need to simulate calls to a single posix function that split into 2 different types of routine based on the input. This how this shit will go: 1) Open the path with WinAPI call 2) Convert handle to file descriptor ***/ HANDLE fHandle; DWORD desired_access = GENERIC_READ; DWORD disposition = OPEN_EXISTING; DWORD attributes = FILE_FLAG_POSIX_SEMANTICS; if(flag) { if(flag && _O_RDWR) desired_access |= GENERIC_WRITE; if(flag && _O_CREAT) disposition = CREATE_ALWAYS; //if(flag && _O_TRUNC) opening |= TRUNCATE_EXISTING; } wchar_t *win32_path = posix_path_to_win32(path); DWORD f = GetFileAttributesW(win32_path); if(f & FILE_ATTRIBUTE_DIRECTORY) { attributes |= FILE_FLAG_BACKUP_SEMANTICS; desired_access |= GENERIC_WRITE; //grant additional write access to folders, can't flush the folder without it } fHandle = CreateFileW(win32_path, desired_access, FILE_SHARE_READ | FILE_SHARE_WRITE, NULL, disposition, attributes, NULL); free(win32_path); if(fHandle!=INVALID_HANDLE_VALUE) { return _open_osfhandle((intptr_t)fHandle, 0); } else { //signal errors; _set_errno(EBADF); return -1; } } int mkdir_win32(const char *path, int mode) { /*** POSIX mkdir also sets directory access rights through 'mode'. While this makes sense in UNIX OSs, it's more or less pointless on a Windows platform. Access rights can be mimiced on Windows, but the software would require certain token rights that I suspect would require running it as admin. Enforcing rights is however irrelevant for proper function of mkdir on Windows. Will come back to this later for full implementation if it reveals itself needed. Some behavior to pay attention to: mkdir can only create a single directory per call. If there are several of them to create in the indicated path, you have to cut down the path name to every single unmade path. ***/ wchar_t *rm_path = posix_path_to_win32(path); int l = wcslen(rm_path), s=0, i=0; while(swd_name, L".") && wcscmp(killfile->wd_name, L"..")) //skip all . and .. returned by dirent { wcscpy(filepath +fpl, killfile->wd_name); if(GetFileAttributesW(filepath) & FILE_ATTRIBUTE_DIRECTORY) //check path is a folder rmdir_resovled(filepath); //if it's a folder, call rmdir on it else _wunlink(filepath); //else delete the file } } free(filepath); } closedir(dempty); i = RemoveDirectoryW(win32_path); if(!i) { _set_errno(EBADF); i=-1; } else i=0; } else { _set_errno(EBADF); i=-1; } } else i=0; return i; } int rmdir_win32(const char *path) { /*** handles wild cards then calls rmdir_resolved with resolved path if a wildcard is encountered, only the subfolders matching the wildcard will be deleted, not the files within the origin folder ***/ int i=0; wchar_t *win32_path = posix_path_to_win32(path); if(win32_path[wcslen(win32_path)-1]=='*') //wildcard handling { //get wild card wchar_t *wildcard = (wchar_t*)malloc(sizeof(wchar_t)*MAX_PATH); memset(wildcard, 0, sizeof(wchar_t)*MAX_PATH); int l = wcslen(win32_path), s=l-1; //-1 for the * int wildcard_length=0; while(s) { if(win32_path[s]==L'/') { wildcard_length = l-1 -s-1; memcpy(wildcard, win32_path +s+1, sizeof(wchar_t)*wildcard_length); wildcard[wildcard_length] = 0; win32_path[s+1]=0; //take wildcard away from origin path break; } s--; } wchar_t *delpath = (wchar_t*)malloc((sizeof(wchar_t)*MAX_PATH)); wchar_t *checkwc = (wchar_t*)malloc((sizeof(wchar_t)*MAX_PATH)); wcscpy(delpath, win32_path); int dpl = wcslen(win32_path); //find all directories in path DIR* dirrm = opendir(win32_path); if(dirrm) { dirent *dirp = 0; while((dirp=readdir(dirrm))) { if(wcscmp(dirp->wd_name, L".") && wcscmp(dirp->wd_name, L"..")) //skip all . and .. returned by dirent { wcscpy(delpath +dpl, dirp->wd_name); if(GetFileAttributesW(delpath) & FILE_ATTRIBUTE_DIRECTORY) //check path is a folder { //check path against wildcard wcscpy(checkwc, dirp->wd_name); checkwc[wildcard_length] = 0; if(!wcscmp(checkwc, wildcard)) //wild card matches { i |= rmdir_resovled(delpath); } } } } } closedir(dirrm); free(delpath); free(wildcard); free(checkwc); } else i = rmdir_resovled(win32_path); free(win32_path); return i; } int rmdir_win32(std::string st_in) { const char *ch_in = st_in.c_str(); return rmdir_win32(ch_in); } int rename_win32(const char *oldname, const char *newname) { wchar_t *oldname_win32, *newname_win32; oldname_win32 = posix_path_to_win32(oldname); newname_win32 = posix_path_to_win32(newname); int o=0; if(!MoveFileExW(oldname_win32, newname_win32, MOVEFILE_REPLACE_EXISTING)) //posix rename replaces existing files { DWORD last_error = GetLastError(); if(last_error==ERROR_FILE_NOT_FOUND) _set_errno(ENOENT); else _set_errno(EINVAL); //global error thrown o=-1; } free(oldname_win32); free(newname_win32); return o; } int stat_win32(const char *path, struct stat *Sin) { wchar_t *path_win32 = posix_path_to_win32(path); int i = _wstat(path_win32, (struct _stat64i32*)Sin); free(path_win32); return i; } FILE* fopen_win32(const char *path, const char *mode) { wchar_t *mode_win32 = (wchar_t*)malloc(10); MultiByteToWideChar(CP_UTF8, 0, mode, -1, mode_win32, 10); wcscat(mode_win32, L"b"); wchar_t *path_win32 = posix_path_to_win32(path); FILE *f; f = _wfsopen(path_win32, mode_win32, _SH_DENYNO); free(mode_win32); free(path_win32); return f; } int fsync_win32(int fd) { HANDLE fHandle = (HANDLE)_get_osfhandle(fd); if(FlushFileBuffers(fHandle)) return 0; //success else { _set_errno(EBADF); return -1; } } int gettimeofday_win32(timeval *tv, timeval *tz) { /*** tv: if it is set, fill it with time in seconds and useconds from unix epoch (wtf long?) tz: if it is set, fill it with timezone tz is usually obsolete and leveldb doesn't use it, not gonna port it for now. Only used for loggging purposes in leveldb ***/ if(tv) { time_t tt; time(&tt); tv->tv_sec = (long)tt; DWORD usc = GetTickCount() % 1000; //trollish approach to s, will do for now tv->tv_usec = (long)tt*1000 +usc; } return -1; } tm* localtime_r_win32(const time_t *tin, tm *tout) { //straight forward porting if(!localtime_s(tout, tin)) //success return tout; return 0; } int geteuid_win32() { /*** Returns user's ID as an integer. User name can be retrieved for Windows, but that's a string. Closest to it is the SID. Note that leveldb uses this function only for logging purposes, same as time functions, so the result is not system critical ***/ return 0; } void usleep_win32(unsigned long long in) { /*** sec sleep isn't really meant to be achieved on windows environments. Sleep itself is but a hint to thread scheduler. Possible solutions are to use Sleep() with millisecond granularity or poll an OS high resolution timer, like QueryPerformanceCounter, until the wait it hit. Either solution aren't any good, the high resolution timer function seems less expensive ***/ if(in<10000) { unsigned long long tick; QueryPerformanceCounter((LARGE_INTEGER*)&tick); unsigned long long fq; QueryPerformanceFrequency((LARGE_INTEGER*)&fq); unsigned long long wait = (fq*in)/1000000 +tick; while(wait>tick) QueryPerformanceCounter((LARGE_INTEGER*)&tick); } else { unsigned int wait = (unsigned int)in/1000; Sleep(wait); } } long getpagesize_win32() { SYSTEM_INFO system_info; GetSystemInfo(&system_info); return system_info.dwPageSize; } int fcntl_win32(int fd, unsigned int command, flock *f) { if(command==F_SETLK) { int lm = (f->l_type ? _LK_NBLCK : _LK_UNLCK); return _locking(fd, lm, 0); } return -1; } wchar_t *posix_path_to_win32(const char *posix_path) { /*** appends . to the begining of the filename if it starts by a \\ or / make sure only one type of slash is used on the file name***/ int l = strlen(posix_path), i=0; char *win32_path = (char*)malloc(l+2); if(posix_path[0]=='\\' || posix_path[0]=='/') { win32_path[0] = L'.'; strcpy(win32_path +1, posix_path); l++; } else strcpy(win32_path, posix_path); for(i=0; i Debug Win32 Debug x64 Release Win32 Release x64 WinXP_32 Win32 WinXP_32 x64 {01CD1176-66F7-44AB-9E7B-8AEECC9915E8} Win32Proj leveldb_msvc11_port StaticLibrary true v110 MultiByte StaticLibrary true v100 MultiByte true StaticLibrary true v110 MultiByte StaticLibrary true v110 MultiByte StaticLibrary false v110 true MultiByte StaticLibrary false v100 true MultiByte StaticLibrary false v110 true MultiByte StaticLibrary false v110 true MultiByte v100 v110 v100 StaticLibrary true v110 true $(SolutionDir)libs\$(Platform)\ $(ProjectName)_d $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ true $(SolutionDir)libs\$(Platform)\Win_XP $(ProjectName)_d $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ $(ProjectName)_d true $(SolutionDir)libs\x64 $(ProjectName)_d true $(SolutionDir)libs\x64 false $(SolutionDir)libs\$(Platform)\ $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ false $(SolutionDir)libs\$(Platform)\Win_XP $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ false $(SolutionDir)libs\$(Platform)\ false $(SolutionDir)libs\$(Platform)\ $(SolutionDir)libs\$(Platform)\Win_XP Level3 Disabled _CRT_SECURE_NO_WARNINGS;LEVELDB_PLATFORM_POSIX;LEVELDB_HAVE_MEMORY_BARRIER;NOMINMAX;WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) .\win32_posix;..\leveldb;..\leveldb\include;%(AdditionalIncludeDirectories) MultiThreadedDebug Console true %(AdditionalLibraryDirectories) Level3 Full _CRT_SECURE_NO_WARNINGS;LEVELDB_PLATFORM_POSIX;LEVELDB_HAVE_MEMORY_BARRIER;NOMINMAX;WIN32;_CONSOLE;%(PreprocessorDefinitions) ..\pthreads-w32-2-9-1-release\Pre-built.2\include;.\win32_posix;..\leveldb;..\leveldb\include;%(AdditionalIncludeDirectories) MultiThreaded None Default false Console true pthreadVC2.lib ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x86;%(AdditionalLibraryDirectories) Level3 Disabled _CRT_SECURE_NO_WARNINGS;LEVELDB_PLATFORM_POSIX;LEVELDB_HAVE_MEMORY_BARRIER;NOMINMAX;WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) ..\pthreads-w32-2-9-1-release\Pre-built.2\include;.\win32_posix;..\leveldb;..\leveldb\include;%(AdditionalIncludeDirectories) MultiThreadedDebug Console true pthreadVC2.lib ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x64;%(AdditionalLibraryDirectories) Level3 Disabled _CRT_SECURE_NO_WARNINGS;LEVELDB_PLATFORM_POSIX;LEVELDB_CSTDATOMIC_PRESENT;NOMINMAX;WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) ..\pthreads-w32-2-9-1-release\Pre-built.2\include;.\win32_posix;..\leveldb;..\leveldb\include;%(AdditionalIncludeDirectories) MultiThreadedDebug Console true pthreadVC2.lib ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x64;%(AdditionalLibraryDirectories) Level3 Full true false _CRT_SECURE_NO_WARNINGS;LEVELDB_PLATFORM_POSIX;LEVELDB_HAVE_MEMORY_BARRIER;NOMINMAX;USE_CONDVAR;NDEBUG;%(PreprocessorDefinitions) MultiThreaded .\win32_posix;..\leveldb;..\leveldb\include;%(AdditionalIncludeDirectories) None Speed Console true true true pthreadVC2.lib;%(AdditionalDependencies) ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x86;..\pthreads-w32-2-9-1-release\Pre-built.2\dll\x86;$(SolutionDir)$(Platform)\libs;C:\WinDDK\7600.16385.1\lib\ATL\i386 %(AdditionalLibraryDirectories) Level3 MaxSpeed true true _CRT_SECURE_NO_WARNINGS;LEVELDB_PLATFORM_POSIX;LEVELDB_HAVE_MEMORY_BARRIER;NDEBUG;LEVELDB_HAVE_MEMORY_BARRIER;NOMINMAX;%(PreprocessorDefinitions) MultiThreaded .\win32_posix;..\leveldb;..\leveldb\include;%(AdditionalIncludeDirectories) Console true true true pthreadVC2.lib;%(AdditionalDependencies) ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x86;..\pthreads-w32-2-9-1-release\Pre-built.2\dll\x86;$(SolutionDir)$(Platform)\libs;C:\WinDDK\7600.16385.1\lib\ATL\i386 %(AdditionalLibraryDirectories) Level3 MaxSpeed true true _CRT_SECURE_NO_WARNINGS;LEVELDB_PLATFORM_POSIX;LEVELDB_HAVE_MEMORY_BARRIER;NOMINMAX;USE_CONDVAR;NDEBUG;%(PreprocessorDefinitions) MultiThreaded .\win32_posix;..\leveldb;..\leveldb\include;%(AdditionalIncludeDirectories) Console true true true pthreadVC2.lib;%(AdditionalDependencies) ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x86;..\pthreads-w32-2-9-1-release\Pre-built.2\dll\x86;$(SolutionDir)$(Platform)\libs;C:\WinDDK\7600.16385.1\lib\ATL\i386 %(AdditionalLibraryDirectories) Level3 MaxSpeed true true _CRT_SECURE_NO_WARNINGS;LEVELDB_PLATFORM_POSIX;LEVELDB_HAVE_MEMORY_BARRIER;NDEBUG;LEVELDB_CSTDATOMIC_PRESENT;NOMINMAX;WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) MultiThreaded ..\pthreads-w32-2-9-1-release\Pre-built.2\include;.\win32_posix;..\leveldb;..\leveldb\include;%(AdditionalIncludeDirectories) Console true true true pthreadVC2.lib;%(AdditionalDependencies) ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x86;..\pthreads-w32-2-9-1-release\Pre-built.2\dll\x86;$(SolutionDir)$(Platform)\libs;C:\WinDDK\7600.16385.1\lib\ATL\i386 pthreadVC2.lib ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x64;%(AdditionalLibraryDirectories) _CRT_SECURE_NO_WARNINGS;LEVELDB_PLATFORM_POSIX;LEVELDB_HAVE_MEMORY_BARRIER;NOMINMAX;WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) ..\pthreads-w32-2-9-1-release\Pre-built.2\include;.\win32_posix;..\leveldb;..\leveldb\include _CRT_SECURE_NO_WARNINGS;LEVELDB_PLATFORM_POSIX;LEVELDB_HAVE_MEMORY_BARRIER;NOMINMAX;WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) MultiThreaded ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x86;%(AdditionalLibraryDirectories) pthreadVC2.lib armory-0.92.3/cppForSwig/gtest/0000755000000000000000000000000012414772654015041 5ustar rootrootarmory-0.92.3/cppForSwig/gtest/Makefile0000644000000000000000000001227512414772654016510 0ustar rootroot# A sample Makefile for building Google Test and using it in user # tests. Please tweak it to suit your environment and project. You # may want to move it to your project's root directory. # # SYNOPSIS: # # make [all] - makes everything. # make TARGET - makes the given target. # make clean - removes all files generated by make. # Please tweak the following variable definitions as needed by your # project, except GTEST_HEADERS, which you can use in your own targets # but shouldn't modify. # Points to the root of Google Test, relative to where this file is. # Remember to tweak this if you move this file. GTEST_DIR = . # Where to find user code. USER_DIR = .. # Flags passed to the preprocessor. CPPFLAGS += -I$(GTEST_DIR) \ -I$(USER_DIR) \ -I$(USER_DIR)/cryptopp \ -I$(USER_DIR)/leveldb/include \ -L$(USER_DIR) \ -L$(USER_DIR)/cryptopp \ -L$(USER_DIR)/leveldb \ -D__STDC_LIMIT_MACROS \ -D_DEBUG \ -g \ -fprofile-arcs \ -ftest-coverage \ --coverage #-O2 \ HEADERS += $(USER_DIR)/BinaryData.h \ $(USER_DIR)/BtcUtils.h \ $(USER_DIR)/BlockObj.h \ $(USER_DIR)/StoredBlockObj.h \ $(USER_DIR)/leveldb_wrapper.h \ $(USER_DIR)/EncryptionUtils.h \ $(USER_DIR)/PartialMerkle.h OBJECTS += BinaryData.o \ BtcUtils.o \ BlockObj.o \ StoredBlockObj.o \ leveldb_wrapper.o \ EncryptionUtils.o \ UniversalTimer.o \ leveldb_wrapper.o \ BlockUtils.o \ libcryptopp.a \ libleveldb.a # Flags passed to the C++ compiler. CXXFLAGS += -g #CXXFLAGS += -O2 -DNDEBUG -pipe -fPIC # All tests produced by this Makefile. Remember to add new tests you # created to the list. TESTS = CppBlockUtilsTests # All Google Test headers. Usually you shouldn't change this # definition. GTEST_HEADERS = $(GTEST_DIR)/gtest.h # House-keeping build targets. all : $(TESTS) rm -rf blkfiletest fakehomedir ldbtestdir/leveldb_* clean : rm -f $(TESTS) gtest.a gtest_main.a *.o *.gcda *.gcno rm -f libcryptopp.a libleveldb.a # Builds gtest.a and gtest_main.a. # Usually you shouldn't tweak such internal variables, indicated by a # trailing _. GTEST_SRCS_ = $(GTEST_DIR)/gtest-all.cc $(GTEST_DIR)/gtest.h # For simplicity and to avoid depending on Google Test's # implementation details, the dependencies specified below are # conservative and not optimized. This is fine as Google Test # compiles fast and for ordinary users its source rarely changes. gtest-all.o : $(GTEST_SRCS_) $(CXX) $(CPPFLAGS) -I$(GTEST_DIR) $(CXXFLAGS) -c \ $(GTEST_DIR)/gtest-all.cc gtest.a : gtest-all.o $(AR) $(ARFLAGS) $@ $^ # Builds a sample test. A test should link with either gtest.a or # gtest_main.a, depending on whether it defines its own main() # function. #sample1.o : $(USER_DIR)/sample1.cc $(USER_DIR)/sample1.h $(GTEST_HEADERS) #$(CXX) $(CPPFLAGS) $(CXXFLAGS) -c $(USER_DIR)/sample1.cc # #sample1_unittest.o : $(USER_DIR)/sample1_unittest.cc \ #$(USER_DIR)/sample1.h $(GTEST_HEADERS) #$(CXX) $(CPPFLAGS) $(CXXFLAGS) -c $(USER_DIR)/sample1_unittest.cc # #sample1_unittest : sample1.o sample1_unittest.o gtest_main.a #$(CXX) $(CPPFLAGS) $(CXXFLAGS) $^ -lpthread -o $@ libcryptopp.a: Makefile cd ../cryptopp; make libcryptopp.a; mv libcryptopp.a ../gtest libleveldb.a: Makefile cd ../leveldb; make libleveldb.a; mv libleveldb.a ../gtest UniversalTimer.o: $(USER_DIR)/UniversalTimer.h $(USER_DIR)/UniversalTimer.cpp $(CXX) $(CPPFLAGS) -c $(USER_DIR)/UniversalTimer.cpp BinaryData.o: $(USER_DIR)/BinaryData.h $(USER_DIR)/BinaryData.cpp $(USER_DIR)/BtcUtils.h $(USER_DIR)/log.h $(CXX) $(CPPFLAGS) -c $(USER_DIR)/BinaryData.cpp BtcUtils.o: $(USER_DIR)/BtcUtils.h $(USER_DIR)/BtcUtils.cpp $(USER_DIR)/log.h $(CXX) $(CPPFLAGS) -c $(USER_DIR)/BtcUtils.cpp BlockObj.o: $(USER_DIR)/log.h $(USER_DIR)/BinaryData.h $(USER_DIR)/BtcUtils.h $(USER_DIR)/BlockObj.h $(USER_DIR)/BlockObj.cpp $(CXX) $(CPPFLAGS) -c $(USER_DIR)/BlockObj.cpp StoredBlockObj.o: $(USER_DIR)/log.h $(USER_DIR)/BtcUtils.h $(USER_DIR)/BinaryData.h $(USER_DIR)/StoredBlockObj.h $(USER_DIR)/StoredBlockObj.cpp $(CXX) $(CPPFLAGS) -c $(USER_DIR)/StoredBlockObj.cpp leveldb_wrapper.o: $(USER_DIR)/log.h $(USER_DIR)/BtcUtils.h $(USER_DIR)/BinaryData.h $(USER_DIR)/leveldb_wrapper.h $(USER_DIR)/leveldb_wrapper.cpp $(CXX) $(CPPFLAGS) -c $(USER_DIR)/leveldb_wrapper.cpp BlockUtils.o: $(USER_DIR)/log.h $(USER_DIR)/BlockUtils.h $(USER_DIR)/BinaryData.h $(USER_DIR)/UniversalTimer.h $(USER_DIR)/PartialMerkle.h $(USER_DIR)/BlockUtils.cpp $(CXX) $(CPPFLAGS) -c $(USER_DIR)/BlockUtils.cpp EncryptionUtils.o: $(USER_DIR)/log.h $(USER_DIR)/BtcUtils.h $(USER_DIR)/BinaryData.h $(USER_DIR)/EncryptionUtils.h $(USER_DIR)/EncryptionUtils.cpp $(CXX) $(CPPFLAGS) -c $(USER_DIR)/EncryptionUtils.cpp #### CppBlockUtilsTests.o : CppBlockUtilsTests.cpp $(HEADERS) $(GTEST_HEADERS) $(CXX) $(CPPFLAGS) $(CXXFLAGS) -c CppBlockUtilsTests.cpp getScrAddrData.o : getScrAddrData.cpp $(HEADERS) $(GTEST_HEADERS) $(CXX) $(CPPFLAGS) $(CXXFLAGS) -c getScrAddrData.cpp CppBlockUtilsTests : $(OBJECTS) CppBlockUtilsTests.o gtest.a $(CXX) $(CPPFLAGS) $(CXXFLAGS) $^ -lpthread -lcryptopp -o $@ getScrAddrData : $(OBJECTS) getScrAddrData.o $(CXX) $(CPPFLAGS) $(CXXFLAGS) $^ -lpthread -lcryptopp -o $@ armory-0.92.3/cppForSwig/gtest/gtest-all.cc0000644000000000000000000122216612414772654017256 0ustar rootroot// Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: mheule@google.com (Markus Heule) // // Google C++ Testing Framework (Google Test) // // Sometimes it's desirable to build Google Test by compiling a single file. // This file serves this purpose. // This line ensures that gtest.h can be compiled on its own, even // when it's fused. #include "gtest.h" // The following lines pull in the real gtest *.cc files. // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan) // // Utilities for testing Google Test itself and code that uses Google Test // (e.g. frameworks built on top of Google Test). #ifndef GTEST_INCLUDE_GTEST_GTEST_SPI_H_ #define GTEST_INCLUDE_GTEST_GTEST_SPI_H_ namespace testing { // This helper class can be used to mock out Google Test failure reporting // so that we can test Google Test or code that builds on Google Test. // // An object of this class appends a TestPartResult object to the // TestPartResultArray object given in the constructor whenever a Google Test // failure is reported. It can either intercept only failures that are // generated in the same thread that created this object or it can intercept // all generated failures. The scope of this mock object can be controlled with // the second argument to the two arguments constructor. class GTEST_API_ ScopedFakeTestPartResultReporter : public TestPartResultReporterInterface { public: // The two possible mocking modes of this object. enum InterceptMode { INTERCEPT_ONLY_CURRENT_THREAD, // Intercepts only thread local failures. INTERCEPT_ALL_THREADS // Intercepts all failures. }; // The c'tor sets this object as the test part result reporter used // by Google Test. The 'result' parameter specifies where to report the // results. This reporter will only catch failures generated in the current // thread. DEPRECATED explicit ScopedFakeTestPartResultReporter(TestPartResultArray* result); // Same as above, but you can choose the interception scope of this object. ScopedFakeTestPartResultReporter(InterceptMode intercept_mode, TestPartResultArray* result); // The d'tor restores the previous test part result reporter. virtual ~ScopedFakeTestPartResultReporter(); // Appends the TestPartResult object to the TestPartResultArray // received in the constructor. // // This method is from the TestPartResultReporterInterface // interface. virtual void ReportTestPartResult(const TestPartResult& result); private: void Init(); const InterceptMode intercept_mode_; TestPartResultReporterInterface* old_reporter_; TestPartResultArray* const result_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ScopedFakeTestPartResultReporter); }; namespace internal { // A helper class for implementing EXPECT_FATAL_FAILURE() and // EXPECT_NONFATAL_FAILURE(). Its destructor verifies that the given // TestPartResultArray contains exactly one failure that has the given // type and contains the given substring. If that's not the case, a // non-fatal failure will be generated. class GTEST_API_ SingleFailureChecker { public: // The constructor remembers the arguments. SingleFailureChecker(const TestPartResultArray* results, TestPartResult::Type type, const string& substr); ~SingleFailureChecker(); private: const TestPartResultArray* const results_; const TestPartResult::Type type_; const string substr_; GTEST_DISALLOW_COPY_AND_ASSIGN_(SingleFailureChecker); }; } // namespace internal } // namespace testing // A set of macros for testing Google Test assertions or code that's expected // to generate Google Test fatal failures. It verifies that the given // statement will cause exactly one fatal Google Test failure with 'substr' // being part of the failure message. // // There are two different versions of this macro. EXPECT_FATAL_FAILURE only // affects and considers failures generated in the current thread and // EXPECT_FATAL_FAILURE_ON_ALL_THREADS does the same but for all threads. // // The verification of the assertion is done correctly even when the statement // throws an exception or aborts the current function. // // Known restrictions: // - 'statement' cannot reference local non-static variables or // non-static members of the current object. // - 'statement' cannot return a value. // - You cannot stream a failure message to this macro. // // Note that even though the implementations of the following two // macros are much alike, we cannot refactor them to use a common // helper macro, due to some peculiarity in how the preprocessor // works. The AcceptsMacroThatExpandsToUnprotectedComma test in // gtest_unittest.cc will fail to compile if we do that. #define EXPECT_FATAL_FAILURE(statement, substr) \ do { \ class GTestExpectFatalFailureHelper {\ public:\ static void Execute() { statement; }\ };\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kFatalFailure, (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter:: \ INTERCEPT_ONLY_CURRENT_THREAD, >est_failures);\ GTestExpectFatalFailureHelper::Execute();\ }\ } while (::testing::internal::AlwaysFalse()) #define EXPECT_FATAL_FAILURE_ON_ALL_THREADS(statement, substr) \ do { \ class GTestExpectFatalFailureHelper {\ public:\ static void Execute() { statement; }\ };\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kFatalFailure, (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter:: \ INTERCEPT_ALL_THREADS, >est_failures);\ GTestExpectFatalFailureHelper::Execute();\ }\ } while (::testing::internal::AlwaysFalse()) // A macro for testing Google Test assertions or code that's expected to // generate Google Test non-fatal failures. It asserts that the given // statement will cause exactly one non-fatal Google Test failure with 'substr' // being part of the failure message. // // There are two different versions of this macro. EXPECT_NONFATAL_FAILURE only // affects and considers failures generated in the current thread and // EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS does the same but for all threads. // // 'statement' is allowed to reference local variables and members of // the current object. // // The verification of the assertion is done correctly even when the statement // throws an exception or aborts the current function. // // Known restrictions: // - You cannot stream a failure message to this macro. // // Note that even though the implementations of the following two // macros are much alike, we cannot refactor them to use a common // helper macro, due to some peculiarity in how the preprocessor // works. If we do that, the code won't compile when the user gives // EXPECT_NONFATAL_FAILURE() a statement that contains a macro that // expands to code containing an unprotected comma. The // AcceptsMacroThatExpandsToUnprotectedComma test in gtest_unittest.cc // catches that. // // For the same reason, we have to write // if (::testing::internal::AlwaysTrue()) { statement; } // instead of // GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) // to avoid an MSVC warning on unreachable code. #define EXPECT_NONFATAL_FAILURE(statement, substr) \ do {\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kNonFatalFailure, \ (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter:: \ INTERCEPT_ONLY_CURRENT_THREAD, >est_failures);\ if (::testing::internal::AlwaysTrue()) { statement; }\ }\ } while (::testing::internal::AlwaysFalse()) #define EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS(statement, substr) \ do {\ ::testing::TestPartResultArray gtest_failures;\ ::testing::internal::SingleFailureChecker gtest_checker(\ >est_failures, ::testing::TestPartResult::kNonFatalFailure, \ (substr));\ {\ ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ ::testing::ScopedFakeTestPartResultReporter::INTERCEPT_ALL_THREADS,\ >est_failures);\ if (::testing::internal::AlwaysTrue()) { statement; }\ }\ } while (::testing::internal::AlwaysFalse()) #endif // GTEST_INCLUDE_GTEST_GTEST_SPI_H_ #include #include #include #include #include #include #include #include #include // NOLINT #include #include #if GTEST_OS_LINUX // TODO(kenton@google.com): Use autoconf to detect availability of // gettimeofday(). # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT # include // NOLINT # include // NOLINT // Declares vsnprintf(). This header is not available on Windows. # include // NOLINT # include // NOLINT # include // NOLINT # include // NOLINT # include #elif GTEST_OS_SYMBIAN # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT #elif GTEST_OS_ZOS # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT // On z/OS we additionally need strings.h for strcasecmp. # include // NOLINT #elif GTEST_OS_WINDOWS_MOBILE // We are on Windows CE. # include // NOLINT #elif GTEST_OS_WINDOWS // We are on Windows proper. # include // NOLINT # include // NOLINT # include // NOLINT # include // NOLINT # if GTEST_OS_WINDOWS_MINGW // MinGW has gettimeofday() but not _ftime64(). // TODO(kenton@google.com): Use autoconf to detect availability of // gettimeofday(). // TODO(kenton@google.com): There are other ways to get the time on // Windows, like GetTickCount() or GetSystemTimeAsFileTime(). MinGW // supports these. consider using them instead. # define GTEST_HAS_GETTIMEOFDAY_ 1 # include // NOLINT # endif // GTEST_OS_WINDOWS_MINGW // cpplint thinks that the header is already included, so we want to // silence it. # include // NOLINT #else // Assume other platforms have gettimeofday(). // TODO(kenton@google.com): Use autoconf to detect availability of // gettimeofday(). # define GTEST_HAS_GETTIMEOFDAY_ 1 // cpplint thinks that the header is already included, so we want to // silence it. # include // NOLINT # include // NOLINT #endif // GTEST_OS_LINUX #if GTEST_HAS_EXCEPTIONS # include #endif #if GTEST_CAN_STREAM_RESULTS_ # include // NOLINT # include // NOLINT #endif // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // Utility functions and classes used by the Google C++ testing framework. // // Author: wan@google.com (Zhanyong Wan) // // This file contains purely Google Test's internal implementation. Please // DO NOT #INCLUDE IT IN A USER PROGRAM. #ifndef GTEST_SRC_GTEST_INTERNAL_INL_H_ #define GTEST_SRC_GTEST_INTERNAL_INL_H_ // GTEST_IMPLEMENTATION_ is defined to 1 iff the current translation unit is // part of Google Test's implementation; otherwise it's undefined. #if !GTEST_IMPLEMENTATION_ // A user is trying to include this from his code - just say no. # error "gtest-internal-inl.h is part of Google Test's internal implementation." # error "It must not be included except by Google Test itself." #endif // GTEST_IMPLEMENTATION_ #ifndef _WIN32_WCE # include #endif // !_WIN32_WCE #include #include // For strtoll/_strtoul64/malloc/free. #include // For memmove. #include #include #include #if GTEST_OS_WINDOWS # include // NOLINT #endif // GTEST_OS_WINDOWS namespace testing { // Declares the flags. // // We don't want the users to modify this flag in the code, but want // Google Test's own unit tests to be able to access it. Therefore we // declare it here as opposed to in gtest.h. GTEST_DECLARE_bool_(death_test_use_fork); namespace internal { // The value of GetTestTypeId() as seen from within the Google Test // library. This is solely for testing GetTestTypeId(). GTEST_API_ extern const TypeId kTestTypeIdInGoogleTest; // Names of the flags (needed for parsing Google Test flags). const char kAlsoRunDisabledTestsFlag[] = "also_run_disabled_tests"; const char kBreakOnFailureFlag[] = "break_on_failure"; const char kCatchExceptionsFlag[] = "catch_exceptions"; const char kColorFlag[] = "color"; const char kFilterFlag[] = "filter"; const char kListTestsFlag[] = "list_tests"; const char kOutputFlag[] = "output"; const char kPrintTimeFlag[] = "print_time"; const char kRandomSeedFlag[] = "random_seed"; const char kRepeatFlag[] = "repeat"; const char kShuffleFlag[] = "shuffle"; const char kStackTraceDepthFlag[] = "stack_trace_depth"; const char kStreamResultToFlag[] = "stream_result_to"; const char kThrowOnFailureFlag[] = "throw_on_failure"; // A valid random seed must be in [1, kMaxRandomSeed]. const int kMaxRandomSeed = 99999; // g_help_flag is true iff the --help flag or an equivalent form is // specified on the command line. GTEST_API_ extern bool g_help_flag; // Returns the current time in milliseconds. GTEST_API_ TimeInMillis GetTimeInMillis(); // Returns true iff Google Test should use colors in the output. GTEST_API_ bool ShouldUseColor(bool stdout_is_tty); // Formats the given time in milliseconds as seconds. GTEST_API_ std::string FormatTimeInMillisAsSeconds(TimeInMillis ms); // Parses a string for an Int32 flag, in the form of "--flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. GTEST_API_ bool ParseInt32Flag( const char* str, const char* flag, Int32* value); // Returns a random seed in range [1, kMaxRandomSeed] based on the // given --gtest_random_seed flag value. inline int GetRandomSeedFromFlag(Int32 random_seed_flag) { const unsigned int raw_seed = (random_seed_flag == 0) ? static_cast(GetTimeInMillis()) : static_cast(random_seed_flag); // Normalizes the actual seed to range [1, kMaxRandomSeed] such that // it's easy to type. const int normalized_seed = static_cast((raw_seed - 1U) % static_cast(kMaxRandomSeed)) + 1; return normalized_seed; } // Returns the first valid random seed after 'seed'. The behavior is // undefined if 'seed' is invalid. The seed after kMaxRandomSeed is // considered to be 1. inline int GetNextRandomSeed(int seed) { GTEST_CHECK_(1 <= seed && seed <= kMaxRandomSeed) << "Invalid random seed " << seed << " - must be in [1, " << kMaxRandomSeed << "]."; const int next_seed = seed + 1; return (next_seed > kMaxRandomSeed) ? 1 : next_seed; } // This class saves the values of all Google Test flags in its c'tor, and // restores them in its d'tor. class GTestFlagSaver { public: // The c'tor. GTestFlagSaver() { also_run_disabled_tests_ = GTEST_FLAG(also_run_disabled_tests); break_on_failure_ = GTEST_FLAG(break_on_failure); catch_exceptions_ = GTEST_FLAG(catch_exceptions); color_ = GTEST_FLAG(color); death_test_style_ = GTEST_FLAG(death_test_style); death_test_use_fork_ = GTEST_FLAG(death_test_use_fork); filter_ = GTEST_FLAG(filter); internal_run_death_test_ = GTEST_FLAG(internal_run_death_test); list_tests_ = GTEST_FLAG(list_tests); output_ = GTEST_FLAG(output); print_time_ = GTEST_FLAG(print_time); random_seed_ = GTEST_FLAG(random_seed); repeat_ = GTEST_FLAG(repeat); shuffle_ = GTEST_FLAG(shuffle); stack_trace_depth_ = GTEST_FLAG(stack_trace_depth); stream_result_to_ = GTEST_FLAG(stream_result_to); throw_on_failure_ = GTEST_FLAG(throw_on_failure); } // The d'tor is not virtual. DO NOT INHERIT FROM THIS CLASS. ~GTestFlagSaver() { GTEST_FLAG(also_run_disabled_tests) = also_run_disabled_tests_; GTEST_FLAG(break_on_failure) = break_on_failure_; GTEST_FLAG(catch_exceptions) = catch_exceptions_; GTEST_FLAG(color) = color_; GTEST_FLAG(death_test_style) = death_test_style_; GTEST_FLAG(death_test_use_fork) = death_test_use_fork_; GTEST_FLAG(filter) = filter_; GTEST_FLAG(internal_run_death_test) = internal_run_death_test_; GTEST_FLAG(list_tests) = list_tests_; GTEST_FLAG(output) = output_; GTEST_FLAG(print_time) = print_time_; GTEST_FLAG(random_seed) = random_seed_; GTEST_FLAG(repeat) = repeat_; GTEST_FLAG(shuffle) = shuffle_; GTEST_FLAG(stack_trace_depth) = stack_trace_depth_; GTEST_FLAG(stream_result_to) = stream_result_to_; GTEST_FLAG(throw_on_failure) = throw_on_failure_; } private: // Fields for saving the original values of flags. bool also_run_disabled_tests_; bool break_on_failure_; bool catch_exceptions_; String color_; String death_test_style_; bool death_test_use_fork_; String filter_; String internal_run_death_test_; bool list_tests_; String output_; bool print_time_; bool pretty_; internal::Int32 random_seed_; internal::Int32 repeat_; bool shuffle_; internal::Int32 stack_trace_depth_; String stream_result_to_; bool throw_on_failure_; } GTEST_ATTRIBUTE_UNUSED_; // Converts a Unicode code point to a narrow string in UTF-8 encoding. // code_point parameter is of type UInt32 because wchar_t may not be // wide enough to contain a code point. // The output buffer str must containt at least 32 characters. // The function returns the address of the output buffer. // If the code_point is not a valid Unicode code point // (i.e. outside of Unicode range U+0 to U+10FFFF) it will be output // as '(Invalid Unicode 0xXXXXXXXX)'. GTEST_API_ char* CodePointToUtf8(UInt32 code_point, char* str); // Converts a wide string to a narrow string in UTF-8 encoding. // The wide string is assumed to have the following encoding: // UTF-16 if sizeof(wchar_t) == 2 (on Windows, Cygwin, Symbian OS) // UTF-32 if sizeof(wchar_t) == 4 (on Linux) // Parameter str points to a null-terminated wide string. // Parameter num_chars may additionally limit the number // of wchar_t characters processed. -1 is used when the entire string // should be processed. // If the string contains code points that are not valid Unicode code points // (i.e. outside of Unicode range U+0 to U+10FFFF) they will be output // as '(Invalid Unicode 0xXXXXXXXX)'. If the string is in UTF16 encoding // and contains invalid UTF-16 surrogate pairs, values in those pairs // will be encoded as individual Unicode characters from Basic Normal Plane. GTEST_API_ String WideStringToUtf8(const wchar_t* str, int num_chars); // Reads the GTEST_SHARD_STATUS_FILE environment variable, and creates the file // if the variable is present. If a file already exists at this location, this // function will write over it. If the variable is present, but the file cannot // be created, prints an error and exits. void WriteToShardStatusFileIfNeeded(); // Checks whether sharding is enabled by examining the relevant // environment variable values. If the variables are present, // but inconsistent (e.g., shard_index >= total_shards), prints // an error and exits. If in_subprocess_for_death_test, sharding is // disabled because it must only be applied to the original test // process. Otherwise, we could filter out death tests we intended to execute. GTEST_API_ bool ShouldShard(const char* total_shards_str, const char* shard_index_str, bool in_subprocess_for_death_test); // Parses the environment variable var as an Int32. If it is unset, // returns default_val. If it is not an Int32, prints an error and // and aborts. GTEST_API_ Int32 Int32FromEnvOrDie(const char* env_var, Int32 default_val); // Given the total number of shards, the shard index, and the test id, // returns true iff the test should be run on this shard. The test id is // some arbitrary but unique non-negative integer assigned to each test // method. Assumes that 0 <= shard_index < total_shards. GTEST_API_ bool ShouldRunTestOnShard( int total_shards, int shard_index, int test_id); // STL container utilities. // Returns the number of elements in the given container that satisfy // the given predicate. template inline int CountIf(const Container& c, Predicate predicate) { // Implemented as an explicit loop since std::count_if() in libCstd on // Solaris has a non-standard signature. int count = 0; for (typename Container::const_iterator it = c.begin(); it != c.end(); ++it) { if (predicate(*it)) ++count; } return count; } // Applies a function/functor to each element in the container. template void ForEach(const Container& c, Functor functor) { std::for_each(c.begin(), c.end(), functor); } // Returns the i-th element of the vector, or default_value if i is not // in range [0, v.size()). template inline E GetElementOr(const std::vector& v, int i, E default_value) { return (i < 0 || i >= static_cast(v.size())) ? default_value : v[i]; } // Performs an in-place shuffle of a range of the vector's elements. // 'begin' and 'end' are element indices as an STL-style range; // i.e. [begin, end) are shuffled, where 'end' == size() means to // shuffle to the end of the vector. template void ShuffleRange(internal::Random* random, int begin, int end, std::vector* v) { const int size = static_cast(v->size()); GTEST_CHECK_(0 <= begin && begin <= size) << "Invalid shuffle range start " << begin << ": must be in range [0, " << size << "]."; GTEST_CHECK_(begin <= end && end <= size) << "Invalid shuffle range finish " << end << ": must be in range [" << begin << ", " << size << "]."; // Fisher-Yates shuffle, from // http://en.wikipedia.org/wiki/Fisher-Yates_shuffle for (int range_width = end - begin; range_width >= 2; range_width--) { const int last_in_range = begin + range_width - 1; const int selected = begin + random->Generate(range_width); std::swap((*v)[selected], (*v)[last_in_range]); } } // Performs an in-place shuffle of the vector's elements. template inline void Shuffle(internal::Random* random, std::vector* v) { ShuffleRange(random, 0, static_cast(v->size()), v); } // A function for deleting an object. Handy for being used as a // functor. template static void Delete(T* x) { delete x; } // A predicate that checks the key of a TestProperty against a known key. // // TestPropertyKeyIs is copyable. class TestPropertyKeyIs { public: // Constructor. // // TestPropertyKeyIs has NO default constructor. explicit TestPropertyKeyIs(const char* key) : key_(key) {} // Returns true iff the test name of test property matches on key_. bool operator()(const TestProperty& test_property) const { return String(test_property.key()).Compare(key_) == 0; } private: String key_; }; // Class UnitTestOptions. // // This class contains functions for processing options the user // specifies when running the tests. It has only static members. // // In most cases, the user can specify an option using either an // environment variable or a command line flag. E.g. you can set the // test filter using either GTEST_FILTER or --gtest_filter. If both // the variable and the flag are present, the latter overrides the // former. class GTEST_API_ UnitTestOptions { public: // Functions for processing the gtest_output flag. // Returns the output format, or "" for normal printed output. static String GetOutputFormat(); // Returns the absolute path of the requested output file, or the // default (test_detail.xml in the original working directory) if // none was explicitly specified. static String GetAbsolutePathToOutputFile(); // Functions for processing the gtest_filter flag. // Returns true iff the wildcard pattern matches the string. The // first ':' or '\0' character in pattern marks the end of it. // // This recursive algorithm isn't very efficient, but is clear and // works well enough for matching test names, which are short. static bool PatternMatchesString(const char *pattern, const char *str); // Returns true iff the user-specified filter matches the test case // name and the test name. static bool FilterMatchesTest(const String &test_case_name, const String &test_name); #if GTEST_OS_WINDOWS // Function for supporting the gtest_catch_exception flag. // Returns EXCEPTION_EXECUTE_HANDLER if Google Test should handle the // given SEH exception, or EXCEPTION_CONTINUE_SEARCH otherwise. // This function is useful as an __except condition. static int GTestShouldProcessSEH(DWORD exception_code); #endif // GTEST_OS_WINDOWS // Returns true if "name" matches the ':' separated list of glob-style // filters in "filter". static bool MatchesFilter(const String& name, const char* filter); }; // Returns the current application's name, removing directory path if that // is present. Used by UnitTestOptions::GetOutputFile. GTEST_API_ FilePath GetCurrentExecutableName(); // The role interface for getting the OS stack trace as a string. class OsStackTraceGetterInterface { public: OsStackTraceGetterInterface() {} virtual ~OsStackTraceGetterInterface() {} // Returns the current OS stack trace as a String. Parameters: // // max_depth - the maximum number of stack frames to be included // in the trace. // skip_count - the number of top frames to be skipped; doesn't count // against max_depth. virtual String CurrentStackTrace(int max_depth, int skip_count) = 0; // UponLeavingGTest() should be called immediately before Google Test calls // user code. It saves some information about the current stack that // CurrentStackTrace() will use to find and hide Google Test stack frames. virtual void UponLeavingGTest() = 0; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(OsStackTraceGetterInterface); }; // A working implementation of the OsStackTraceGetterInterface interface. class OsStackTraceGetter : public OsStackTraceGetterInterface { public: OsStackTraceGetter() : caller_frame_(NULL) {} virtual String CurrentStackTrace(int max_depth, int skip_count); virtual void UponLeavingGTest(); // This string is inserted in place of stack frames that are part of // Google Test's implementation. static const char* const kElidedFramesMarker; private: Mutex mutex_; // protects all internal state // We save the stack frame below the frame that calls user code. // We do this because the address of the frame immediately below // the user code changes between the call to UponLeavingGTest() // and any calls to CurrentStackTrace() from within the user code. void* caller_frame_; GTEST_DISALLOW_COPY_AND_ASSIGN_(OsStackTraceGetter); }; // Information about a Google Test trace point. struct TraceInfo { const char* file; int line; String message; }; // This is the default global test part result reporter used in UnitTestImpl. // This class should only be used by UnitTestImpl. class DefaultGlobalTestPartResultReporter : public TestPartResultReporterInterface { public: explicit DefaultGlobalTestPartResultReporter(UnitTestImpl* unit_test); // Implements the TestPartResultReporterInterface. Reports the test part // result in the current test. virtual void ReportTestPartResult(const TestPartResult& result); private: UnitTestImpl* const unit_test_; GTEST_DISALLOW_COPY_AND_ASSIGN_(DefaultGlobalTestPartResultReporter); }; // This is the default per thread test part result reporter used in // UnitTestImpl. This class should only be used by UnitTestImpl. class DefaultPerThreadTestPartResultReporter : public TestPartResultReporterInterface { public: explicit DefaultPerThreadTestPartResultReporter(UnitTestImpl* unit_test); // Implements the TestPartResultReporterInterface. The implementation just // delegates to the current global test part result reporter of *unit_test_. virtual void ReportTestPartResult(const TestPartResult& result); private: UnitTestImpl* const unit_test_; GTEST_DISALLOW_COPY_AND_ASSIGN_(DefaultPerThreadTestPartResultReporter); }; // The private implementation of the UnitTest class. We don't protect // the methods under a mutex, as this class is not accessible by a // user and the UnitTest class that delegates work to this class does // proper locking. class GTEST_API_ UnitTestImpl { public: explicit UnitTestImpl(UnitTest* parent); virtual ~UnitTestImpl(); // There are two different ways to register your own TestPartResultReporter. // You can register your own repoter to listen either only for test results // from the current thread or for results from all threads. // By default, each per-thread test result repoter just passes a new // TestPartResult to the global test result reporter, which registers the // test part result for the currently running test. // Returns the global test part result reporter. TestPartResultReporterInterface* GetGlobalTestPartResultReporter(); // Sets the global test part result reporter. void SetGlobalTestPartResultReporter( TestPartResultReporterInterface* reporter); // Returns the test part result reporter for the current thread. TestPartResultReporterInterface* GetTestPartResultReporterForCurrentThread(); // Sets the test part result reporter for the current thread. void SetTestPartResultReporterForCurrentThread( TestPartResultReporterInterface* reporter); // Gets the number of successful test cases. int successful_test_case_count() const; // Gets the number of failed test cases. int failed_test_case_count() const; // Gets the number of all test cases. int total_test_case_count() const; // Gets the number of all test cases that contain at least one test // that should run. int test_case_to_run_count() const; // Gets the number of successful tests. int successful_test_count() const; // Gets the number of failed tests. int failed_test_count() const; // Gets the number of disabled tests. int disabled_test_count() const; // Gets the number of all tests. int total_test_count() const; // Gets the number of tests that should run. int test_to_run_count() const; // Gets the elapsed time, in milliseconds. TimeInMillis elapsed_time() const { return elapsed_time_; } // Returns true iff the unit test passed (i.e. all test cases passed). bool Passed() const { return !Failed(); } // Returns true iff the unit test failed (i.e. some test case failed // or something outside of all tests failed). bool Failed() const { return failed_test_case_count() > 0 || ad_hoc_test_result()->Failed(); } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. const TestCase* GetTestCase(int i) const { const int index = GetElementOr(test_case_indices_, i, -1); return index < 0 ? NULL : test_cases_[i]; } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. TestCase* GetMutableTestCase(int i) { const int index = GetElementOr(test_case_indices_, i, -1); return index < 0 ? NULL : test_cases_[index]; } // Provides access to the event listener list. TestEventListeners* listeners() { return &listeners_; } // Returns the TestResult for the test that's currently running, or // the TestResult for the ad hoc test if no test is running. TestResult* current_test_result(); // Returns the TestResult for the ad hoc test. const TestResult* ad_hoc_test_result() const { return &ad_hoc_test_result_; } // Sets the OS stack trace getter. // // Does nothing if the input and the current OS stack trace getter // are the same; otherwise, deletes the old getter and makes the // input the current getter. void set_os_stack_trace_getter(OsStackTraceGetterInterface* getter); // Returns the current OS stack trace getter if it is not NULL; // otherwise, creates an OsStackTraceGetter, makes it the current // getter, and returns it. OsStackTraceGetterInterface* os_stack_trace_getter(); // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // CurrentOsStackTraceExceptTop(1), Foo() will be included in the // trace but Bar() and CurrentOsStackTraceExceptTop() won't. String CurrentOsStackTraceExceptTop(int skip_count); // Finds and returns a TestCase with the given name. If one doesn't // exist, creates one and returns it. // // Arguments: // // test_case_name: name of the test case // type_param: the name of the test's type parameter, or NULL if // this is not a typed or a type-parameterized test. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase* GetTestCase(const char* test_case_name, const char* type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc); // Adds a TestInfo to the unit test. // // Arguments: // // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case // test_info: the TestInfo object void AddTestInfo(Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc, TestInfo* test_info) { // In order to support thread-safe death tests, we need to // remember the original working directory when the test program // was first invoked. We cannot do this in RUN_ALL_TESTS(), as // the user may have changed the current directory before calling // RUN_ALL_TESTS(). Therefore we capture the current directory in // AddTestInfo(), which is called to register a TEST or TEST_F // before main() is reached. if (original_working_dir_.IsEmpty()) { original_working_dir_.Set(FilePath::GetCurrentDir()); GTEST_CHECK_(!original_working_dir_.IsEmpty()) << "Failed to get the current working directory."; } GetTestCase(test_info->test_case_name(), test_info->type_param(), set_up_tc, tear_down_tc)->AddTestInfo(test_info); } #if GTEST_HAS_PARAM_TEST // Returns ParameterizedTestCaseRegistry object used to keep track of // value-parameterized tests and instantiate and register them. internal::ParameterizedTestCaseRegistry& parameterized_test_registry() { return parameterized_test_registry_; } #endif // GTEST_HAS_PARAM_TEST // Sets the TestCase object for the test that's currently running. void set_current_test_case(TestCase* a_current_test_case) { current_test_case_ = a_current_test_case; } // Sets the TestInfo object for the test that's currently running. If // current_test_info is NULL, the assertion results will be stored in // ad_hoc_test_result_. void set_current_test_info(TestInfo* a_current_test_info) { current_test_info_ = a_current_test_info; } // Registers all parameterized tests defined using TEST_P and // INSTANTIATE_TEST_CASE_P, creating regular tests for each test/parameter // combination. This method can be called more then once; it has guards // protecting from registering the tests more then once. If // value-parameterized tests are disabled, RegisterParameterizedTests is // present but does nothing. void RegisterParameterizedTests(); // Runs all tests in this UnitTest object, prints the result, and // returns true if all tests are successful. If any exception is // thrown during a test, this test is considered to be failed, but // the rest of the tests will still be run. bool RunAllTests(); // Clears the results of all tests, except the ad hoc tests. void ClearNonAdHocTestResult() { ForEach(test_cases_, TestCase::ClearTestCaseResult); } // Clears the results of ad-hoc test assertions. void ClearAdHocTestResult() { ad_hoc_test_result_.Clear(); } enum ReactionToSharding { HONOR_SHARDING_PROTOCOL, IGNORE_SHARDING_PROTOCOL }; // Matches the full name of each test against the user-specified // filter to decide whether the test should run, then records the // result in each TestCase and TestInfo object. // If shard_tests == HONOR_SHARDING_PROTOCOL, further filters tests // based on sharding variables in the environment. // Returns the number of tests that should run. int FilterTests(ReactionToSharding shard_tests); // Prints the names of the tests matching the user-specified filter flag. void ListTestsMatchingFilter(); const TestCase* current_test_case() const { return current_test_case_; } TestInfo* current_test_info() { return current_test_info_; } const TestInfo* current_test_info() const { return current_test_info_; } // Returns the vector of environments that need to be set-up/torn-down // before/after the tests are run. std::vector& environments() { return environments_; } // Getters for the per-thread Google Test trace stack. std::vector& gtest_trace_stack() { return *(gtest_trace_stack_.pointer()); } const std::vector& gtest_trace_stack() const { return gtest_trace_stack_.get(); } #if GTEST_HAS_DEATH_TEST void InitDeathTestSubprocessControlInfo() { internal_run_death_test_flag_.reset(ParseInternalRunDeathTestFlag()); } // Returns a pointer to the parsed --gtest_internal_run_death_test // flag, or NULL if that flag was not specified. // This information is useful only in a death test child process. // Must not be called before a call to InitGoogleTest. const InternalRunDeathTestFlag* internal_run_death_test_flag() const { return internal_run_death_test_flag_.get(); } // Returns a pointer to the current death test factory. internal::DeathTestFactory* death_test_factory() { return death_test_factory_.get(); } void SuppressTestEventsIfInSubprocess(); friend class ReplaceDeathTestFactory; #endif // GTEST_HAS_DEATH_TEST // Initializes the event listener performing XML output as specified by // UnitTestOptions. Must not be called before InitGoogleTest. void ConfigureXmlOutput(); #if GTEST_CAN_STREAM_RESULTS_ // Initializes the event listener for streaming test results to a socket. // Must not be called before InitGoogleTest. void ConfigureStreamingOutput(); #endif // Performs initialization dependent upon flag values obtained in // ParseGoogleTestFlagsOnly. Is called from InitGoogleTest after the call to // ParseGoogleTestFlagsOnly. In case a user neglects to call InitGoogleTest // this function is also called from RunAllTests. Since this function can be // called more than once, it has to be idempotent. void PostFlagParsingInit(); // Gets the random seed used at the start of the current test iteration. int random_seed() const { return random_seed_; } // Gets the random number generator. internal::Random* random() { return &random_; } // Shuffles all test cases, and the tests within each test case, // making sure that death tests are still run first. void ShuffleTests(); // Restores the test cases and tests to their order before the first shuffle. void UnshuffleTests(); // Returns the value of GTEST_FLAG(catch_exceptions) at the moment // UnitTest::Run() starts. bool catch_exceptions() const { return catch_exceptions_; } private: friend class ::testing::UnitTest; // Used by UnitTest::Run() to capture the state of // GTEST_FLAG(catch_exceptions) at the moment it starts. void set_catch_exceptions(bool value) { catch_exceptions_ = value; } // The UnitTest object that owns this implementation object. UnitTest* const parent_; // The working directory when the first TEST() or TEST_F() was // executed. internal::FilePath original_working_dir_; // The default test part result reporters. DefaultGlobalTestPartResultReporter default_global_test_part_result_reporter_; DefaultPerThreadTestPartResultReporter default_per_thread_test_part_result_reporter_; // Points to (but doesn't own) the global test part result reporter. TestPartResultReporterInterface* global_test_part_result_repoter_; // Protects read and write access to global_test_part_result_reporter_. internal::Mutex global_test_part_result_reporter_mutex_; // Points to (but doesn't own) the per-thread test part result reporter. internal::ThreadLocal per_thread_test_part_result_reporter_; // The vector of environments that need to be set-up/torn-down // before/after the tests are run. std::vector environments_; // The vector of TestCases in their original order. It owns the // elements in the vector. std::vector test_cases_; // Provides a level of indirection for the test case list to allow // easy shuffling and restoring the test case order. The i-th // element of this vector is the index of the i-th test case in the // shuffled order. std::vector test_case_indices_; #if GTEST_HAS_PARAM_TEST // ParameterizedTestRegistry object used to register value-parameterized // tests. internal::ParameterizedTestCaseRegistry parameterized_test_registry_; // Indicates whether RegisterParameterizedTests() has been called already. bool parameterized_tests_registered_; #endif // GTEST_HAS_PARAM_TEST // Index of the last death test case registered. Initially -1. int last_death_test_case_; // This points to the TestCase for the currently running test. It // changes as Google Test goes through one test case after another. // When no test is running, this is set to NULL and Google Test // stores assertion results in ad_hoc_test_result_. Initially NULL. TestCase* current_test_case_; // This points to the TestInfo for the currently running test. It // changes as Google Test goes through one test after another. When // no test is running, this is set to NULL and Google Test stores // assertion results in ad_hoc_test_result_. Initially NULL. TestInfo* current_test_info_; // Normally, a user only writes assertions inside a TEST or TEST_F, // or inside a function called by a TEST or TEST_F. Since Google // Test keeps track of which test is current running, it can // associate such an assertion with the test it belongs to. // // If an assertion is encountered when no TEST or TEST_F is running, // Google Test attributes the assertion result to an imaginary "ad hoc" // test, and records the result in ad_hoc_test_result_. TestResult ad_hoc_test_result_; // The list of event listeners that can be used to track events inside // Google Test. TestEventListeners listeners_; // The OS stack trace getter. Will be deleted when the UnitTest // object is destructed. By default, an OsStackTraceGetter is used, // but the user can set this field to use a custom getter if that is // desired. OsStackTraceGetterInterface* os_stack_trace_getter_; // True iff PostFlagParsingInit() has been called. bool post_flag_parse_init_performed_; // The random number seed used at the beginning of the test run. int random_seed_; // Our random number generator. internal::Random random_; // How long the test took to run, in milliseconds. TimeInMillis elapsed_time_; #if GTEST_HAS_DEATH_TEST // The decomposed components of the gtest_internal_run_death_test flag, // parsed when RUN_ALL_TESTS is called. internal::scoped_ptr internal_run_death_test_flag_; internal::scoped_ptr death_test_factory_; #endif // GTEST_HAS_DEATH_TEST // A per-thread stack of traces created by the SCOPED_TRACE() macro. internal::ThreadLocal > gtest_trace_stack_; // The value of GTEST_FLAG(catch_exceptions) at the moment RunAllTests() // starts. bool catch_exceptions_; GTEST_DISALLOW_COPY_AND_ASSIGN_(UnitTestImpl); }; // class UnitTestImpl // Convenience function for accessing the global UnitTest // implementation object. inline UnitTestImpl* GetUnitTestImpl() { return UnitTest::GetInstance()->impl(); } #if GTEST_USES_SIMPLE_RE // Internal helper functions for implementing the simple regular // expression matcher. GTEST_API_ bool IsInSet(char ch, const char* str); GTEST_API_ bool IsAsciiDigit(char ch); GTEST_API_ bool IsAsciiPunct(char ch); GTEST_API_ bool IsRepeat(char ch); GTEST_API_ bool IsAsciiWhiteSpace(char ch); GTEST_API_ bool IsAsciiWordChar(char ch); GTEST_API_ bool IsValidEscape(char ch); GTEST_API_ bool AtomMatchesChar(bool escaped, char pattern, char ch); GTEST_API_ bool ValidateRegex(const char* regex); GTEST_API_ bool MatchRegexAtHead(const char* regex, const char* str); GTEST_API_ bool MatchRepetitionAndRegexAtHead( bool escaped, char ch, char repeat, const char* regex, const char* str); GTEST_API_ bool MatchRegexAnywhere(const char* regex, const char* str); #endif // GTEST_USES_SIMPLE_RE // Parses the command line for Google Test flags, without initializing // other parts of Google Test. GTEST_API_ void ParseGoogleTestFlagsOnly(int* argc, char** argv); GTEST_API_ void ParseGoogleTestFlagsOnly(int* argc, wchar_t** argv); #if GTEST_HAS_DEATH_TEST // Returns the message describing the last system error, regardless of the // platform. GTEST_API_ String GetLastErrnoDescription(); # if GTEST_OS_WINDOWS // Provides leak-safe Windows kernel handle ownership. class AutoHandle { public: AutoHandle() : handle_(INVALID_HANDLE_VALUE) {} explicit AutoHandle(HANDLE handle) : handle_(handle) {} ~AutoHandle() { Reset(); } HANDLE Get() const { return handle_; } void Reset() { Reset(INVALID_HANDLE_VALUE); } void Reset(HANDLE handle) { if (handle != handle_) { if (handle_ != INVALID_HANDLE_VALUE) ::CloseHandle(handle_); handle_ = handle; } } private: HANDLE handle_; GTEST_DISALLOW_COPY_AND_ASSIGN_(AutoHandle); }; # endif // GTEST_OS_WINDOWS // Attempts to parse a string into a positive integer pointed to by the // number parameter. Returns true if that is possible. // GTEST_HAS_DEATH_TEST implies that we have ::std::string, so we can use // it here. template bool ParseNaturalNumber(const ::std::string& str, Integer* number) { // Fail fast if the given string does not begin with a digit; // this bypasses strtoXXX's "optional leading whitespace and plus // or minus sign" semantics, which are undesirable here. if (str.empty() || !IsDigit(str[0])) { return false; } errno = 0; char* end; // BiggestConvertible is the largest integer type that system-provided // string-to-number conversion routines can return. # if GTEST_OS_WINDOWS && !defined(__GNUC__) // MSVC and C++ Builder define __int64 instead of the standard long long. typedef unsigned __int64 BiggestConvertible; const BiggestConvertible parsed = _strtoui64(str.c_str(), &end, 10); # else typedef unsigned long long BiggestConvertible; // NOLINT const BiggestConvertible parsed = strtoull(str.c_str(), &end, 10); # endif // GTEST_OS_WINDOWS && !defined(__GNUC__) const bool parse_success = *end == '\0' && errno == 0; // TODO(vladl@google.com): Convert this to compile time assertion when it is // available. GTEST_CHECK_(sizeof(Integer) <= sizeof(parsed)); const Integer result = static_cast(parsed); if (parse_success && static_cast(result) == parsed) { *number = result; return true; } return false; } #endif // GTEST_HAS_DEATH_TEST // TestResult contains some private methods that should be hidden from // Google Test user but are required for testing. This class allow our tests // to access them. // // This class is supplied only for the purpose of testing Google Test's own // constructs. Do not use it in user tests, either directly or indirectly. class TestResultAccessor { public: static void RecordProperty(TestResult* test_result, const TestProperty& property) { test_result->RecordProperty(property); } static void ClearTestPartResults(TestResult* test_result) { test_result->ClearTestPartResults(); } static const std::vector& test_part_results( const TestResult& test_result) { return test_result.test_part_results(); } }; } // namespace internal } // namespace testing #endif // GTEST_SRC_GTEST_INTERNAL_INL_H_ #undef GTEST_IMPLEMENTATION_ #if GTEST_OS_WINDOWS # define vsnprintf _vsnprintf #endif // GTEST_OS_WINDOWS namespace testing { using internal::CountIf; using internal::ForEach; using internal::GetElementOr; using internal::Shuffle; // Constants. // A test whose test case name or test name matches this filter is // disabled and not run. static const char kDisableTestFilter[] = "DISABLED_*:*/DISABLED_*"; // A test case whose name matches this filter is considered a death // test case and will be run before test cases whose name doesn't // match this filter. static const char kDeathTestCaseFilter[] = "*DeathTest:*DeathTest/*"; // A test filter that matches everything. static const char kUniversalFilter[] = "*"; // The default output file for XML output. static const char kDefaultOutputFile[] = "test_detail.xml"; // The environment variable name for the test shard index. static const char kTestShardIndex[] = "GTEST_SHARD_INDEX"; // The environment variable name for the total number of test shards. static const char kTestTotalShards[] = "GTEST_TOTAL_SHARDS"; // The environment variable name for the test shard status file. static const char kTestShardStatusFile[] = "GTEST_SHARD_STATUS_FILE"; namespace internal { // The text used in failure messages to indicate the start of the // stack trace. const char kStackTraceMarker[] = "\nStack trace:\n"; // g_help_flag is true iff the --help flag or an equivalent form is // specified on the command line. bool g_help_flag = false; } // namespace internal GTEST_DEFINE_bool_( also_run_disabled_tests, internal::BoolFromGTestEnv("also_run_disabled_tests", false), "Run disabled tests too, in addition to the tests normally being run."); GTEST_DEFINE_bool_( break_on_failure, internal::BoolFromGTestEnv("break_on_failure", false), "True iff a failed assertion should be a debugger break-point."); GTEST_DEFINE_bool_( catch_exceptions, internal::BoolFromGTestEnv("catch_exceptions", true), "True iff " GTEST_NAME_ " should catch exceptions and treat them as test failures."); GTEST_DEFINE_string_( color, internal::StringFromGTestEnv("color", "auto"), "Whether to use colors in the output. Valid values: yes, no, " "and auto. 'auto' means to use colors if the output is " "being sent to a terminal and the TERM environment variable " "is set to xterm, xterm-color, xterm-256color, linux or cygwin."); GTEST_DEFINE_string_( filter, internal::StringFromGTestEnv("filter", kUniversalFilter), "A colon-separated list of glob (not regex) patterns " "for filtering the tests to run, optionally followed by a " "'-' and a : separated list of negative patterns (tests to " "exclude). A test is run if it matches one of the positive " "patterns and does not match any of the negative patterns."); GTEST_DEFINE_bool_(list_tests, false, "List all tests without running them."); GTEST_DEFINE_string_( output, internal::StringFromGTestEnv("output", ""), "A format (currently must be \"xml\"), optionally followed " "by a colon and an output file name or directory. A directory " "is indicated by a trailing pathname separator. " "Examples: \"xml:filename.xml\", \"xml::directoryname/\". " "If a directory is specified, output files will be created " "within that directory, with file-names based on the test " "executable's name and, if necessary, made unique by adding " "digits."); GTEST_DEFINE_bool_( print_time, internal::BoolFromGTestEnv("print_time", true), "True iff " GTEST_NAME_ " should display elapsed time in text output."); GTEST_DEFINE_int32_( random_seed, internal::Int32FromGTestEnv("random_seed", 0), "Random number seed to use when shuffling test orders. Must be in range " "[1, 99999], or 0 to use a seed based on the current time."); GTEST_DEFINE_int32_( repeat, internal::Int32FromGTestEnv("repeat", 1), "How many times to repeat each test. Specify a negative number " "for repeating forever. Useful for shaking out flaky tests."); GTEST_DEFINE_bool_( show_internal_stack_frames, false, "True iff " GTEST_NAME_ " should include internal stack frames when " "printing test failure stack traces."); GTEST_DEFINE_bool_( shuffle, internal::BoolFromGTestEnv("shuffle", false), "True iff " GTEST_NAME_ " should randomize tests' order on every run."); GTEST_DEFINE_int32_( stack_trace_depth, internal::Int32FromGTestEnv("stack_trace_depth", kMaxStackTraceDepth), "The maximum number of stack frames to print when an " "assertion fails. The valid range is 0 through 100, inclusive."); GTEST_DEFINE_string_( stream_result_to, internal::StringFromGTestEnv("stream_result_to", ""), "This flag specifies the host name and the port number on which to stream " "test results. Example: \"localhost:555\". The flag is effective only on " "Linux."); GTEST_DEFINE_bool_( throw_on_failure, internal::BoolFromGTestEnv("throw_on_failure", false), "When this flag is specified, a failed assertion will throw an exception " "if exceptions are enabled or exit the program with a non-zero code " "otherwise."); namespace internal { // Generates a random number from [0, range), using a Linear // Congruential Generator (LCG). Crashes if 'range' is 0 or greater // than kMaxRange. UInt32 Random::Generate(UInt32 range) { // These constants are the same as are used in glibc's rand(3). state_ = (1103515245U*state_ + 12345U) % kMaxRange; GTEST_CHECK_(range > 0) << "Cannot generate a number in the range [0, 0)."; GTEST_CHECK_(range <= kMaxRange) << "Generation of a number in [0, " << range << ") was requested, " << "but this can only generate numbers in [0, " << kMaxRange << ")."; // Converting via modulus introduces a bit of downward bias, but // it's simple, and a linear congruential generator isn't too good // to begin with. return state_ % range; } // GTestIsInitialized() returns true iff the user has initialized // Google Test. Useful for catching the user mistake of not initializing // Google Test before calling RUN_ALL_TESTS(). // // A user must call testing::InitGoogleTest() to initialize Google // Test. g_init_gtest_count is set to the number of times // InitGoogleTest() has been called. We don't protect this variable // under a mutex as it is only accessed in the main thread. int g_init_gtest_count = 0; static bool GTestIsInitialized() { return g_init_gtest_count != 0; } // Iterates over a vector of TestCases, keeping a running sum of the // results of calling a given int-returning method on each. // Returns the sum. static int SumOverTestCaseList(const std::vector& case_list, int (TestCase::*method)() const) { int sum = 0; for (size_t i = 0; i < case_list.size(); i++) { sum += (case_list[i]->*method)(); } return sum; } // Returns true iff the test case passed. static bool TestCasePassed(const TestCase* test_case) { return test_case->should_run() && test_case->Passed(); } // Returns true iff the test case failed. static bool TestCaseFailed(const TestCase* test_case) { return test_case->should_run() && test_case->Failed(); } // Returns true iff test_case contains at least one test that should // run. static bool ShouldRunTestCase(const TestCase* test_case) { return test_case->should_run(); } // AssertHelper constructor. AssertHelper::AssertHelper(TestPartResult::Type type, const char* file, int line, const char* message) : data_(new AssertHelperData(type, file, line, message)) { } AssertHelper::~AssertHelper() { delete data_; } // Message assignment, for assertion streaming support. void AssertHelper::operator=(const Message& message) const { UnitTest::GetInstance()-> AddTestPartResult(data_->type, data_->file, data_->line, AppendUserMessage(data_->message, message), UnitTest::GetInstance()->impl() ->CurrentOsStackTraceExceptTop(1) // Skips the stack frame for this function itself. ); // NOLINT } // Mutex for linked pointers. GTEST_DEFINE_STATIC_MUTEX_(g_linked_ptr_mutex); // Application pathname gotten in InitGoogleTest. String g_executable_path; // Returns the current application's name, removing directory path if that // is present. FilePath GetCurrentExecutableName() { FilePath result; #if GTEST_OS_WINDOWS result.Set(FilePath(g_executable_path).RemoveExtension("exe")); #else result.Set(FilePath(g_executable_path)); #endif // GTEST_OS_WINDOWS return result.RemoveDirectoryName(); } // Functions for processing the gtest_output flag. // Returns the output format, or "" for normal printed output. String UnitTestOptions::GetOutputFormat() { const char* const gtest_output_flag = GTEST_FLAG(output).c_str(); if (gtest_output_flag == NULL) return String(""); const char* const colon = strchr(gtest_output_flag, ':'); return (colon == NULL) ? String(gtest_output_flag) : String(gtest_output_flag, colon - gtest_output_flag); } // Returns the name of the requested output file, or the default if none // was explicitly specified. String UnitTestOptions::GetAbsolutePathToOutputFile() { const char* const gtest_output_flag = GTEST_FLAG(output).c_str(); if (gtest_output_flag == NULL) return String(""); const char* const colon = strchr(gtest_output_flag, ':'); if (colon == NULL) return String(internal::FilePath::ConcatPaths( internal::FilePath( UnitTest::GetInstance()->original_working_dir()), internal::FilePath(kDefaultOutputFile)).ToString() ); internal::FilePath output_name(colon + 1); if (!output_name.IsAbsolutePath()) // TODO(wan@google.com): on Windows \some\path is not an absolute // path (as its meaning depends on the current drive), yet the // following logic for turning it into an absolute path is wrong. // Fix it. output_name = internal::FilePath::ConcatPaths( internal::FilePath(UnitTest::GetInstance()->original_working_dir()), internal::FilePath(colon + 1)); if (!output_name.IsDirectory()) return output_name.ToString(); internal::FilePath result(internal::FilePath::GenerateUniqueFileName( output_name, internal::GetCurrentExecutableName(), GetOutputFormat().c_str())); return result.ToString(); } // Returns true iff the wildcard pattern matches the string. The // first ':' or '\0' character in pattern marks the end of it. // // This recursive algorithm isn't very efficient, but is clear and // works well enough for matching test names, which are short. bool UnitTestOptions::PatternMatchesString(const char *pattern, const char *str) { switch (*pattern) { case '\0': case ':': // Either ':' or '\0' marks the end of the pattern. return *str == '\0'; case '?': // Matches any single character. return *str != '\0' && PatternMatchesString(pattern + 1, str + 1); case '*': // Matches any string (possibly empty) of characters. return (*str != '\0' && PatternMatchesString(pattern, str + 1)) || PatternMatchesString(pattern + 1, str); default: // Non-special character. Matches itself. return *pattern == *str && PatternMatchesString(pattern + 1, str + 1); } } bool UnitTestOptions::MatchesFilter(const String& name, const char* filter) { const char *cur_pattern = filter; for (;;) { if (PatternMatchesString(cur_pattern, name.c_str())) { return true; } // Finds the next pattern in the filter. cur_pattern = strchr(cur_pattern, ':'); // Returns if no more pattern can be found. if (cur_pattern == NULL) { return false; } // Skips the pattern separater (the ':' character). cur_pattern++; } } // TODO(keithray): move String function implementations to gtest-string.cc. // Returns true iff the user-specified filter matches the test case // name and the test name. bool UnitTestOptions::FilterMatchesTest(const String &test_case_name, const String &test_name) { const String& full_name = String::Format("%s.%s", test_case_name.c_str(), test_name.c_str()); // Split --gtest_filter at '-', if there is one, to separate into // positive filter and negative filter portions const char* const p = GTEST_FLAG(filter).c_str(); const char* const dash = strchr(p, '-'); String positive; String negative; if (dash == NULL) { positive = GTEST_FLAG(filter).c_str(); // Whole string is a positive filter negative = String(""); } else { positive = String(p, dash - p); // Everything up to the dash negative = String(dash+1); // Everything after the dash if (positive.empty()) { // Treat '-test1' as the same as '*-test1' positive = kUniversalFilter; } } // A filter is a colon-separated list of patterns. It matches a // test if any pattern in it matches the test. return (MatchesFilter(full_name, positive.c_str()) && !MatchesFilter(full_name, negative.c_str())); } #if GTEST_HAS_SEH // Returns EXCEPTION_EXECUTE_HANDLER if Google Test should handle the // given SEH exception, or EXCEPTION_CONTINUE_SEARCH otherwise. // This function is useful as an __except condition. int UnitTestOptions::GTestShouldProcessSEH(DWORD exception_code) { // Google Test should handle a SEH exception if: // 1. the user wants it to, AND // 2. this is not a breakpoint exception, AND // 3. this is not a C++ exception (VC++ implements them via SEH, // apparently). // // SEH exception code for C++ exceptions. // (see http://support.microsoft.com/kb/185294 for more information). const DWORD kCxxExceptionCode = 0xe06d7363; bool should_handle = true; if (!GTEST_FLAG(catch_exceptions)) should_handle = false; else if (exception_code == EXCEPTION_BREAKPOINT) should_handle = false; else if (exception_code == kCxxExceptionCode) should_handle = false; return should_handle ? EXCEPTION_EXECUTE_HANDLER : EXCEPTION_CONTINUE_SEARCH; } #endif // GTEST_HAS_SEH } // namespace internal // The c'tor sets this object as the test part result reporter used by // Google Test. The 'result' parameter specifies where to report the // results. Intercepts only failures from the current thread. ScopedFakeTestPartResultReporter::ScopedFakeTestPartResultReporter( TestPartResultArray* result) : intercept_mode_(INTERCEPT_ONLY_CURRENT_THREAD), result_(result) { Init(); } // The c'tor sets this object as the test part result reporter used by // Google Test. The 'result' parameter specifies where to report the // results. ScopedFakeTestPartResultReporter::ScopedFakeTestPartResultReporter( InterceptMode intercept_mode, TestPartResultArray* result) : intercept_mode_(intercept_mode), result_(result) { Init(); } void ScopedFakeTestPartResultReporter::Init() { internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); if (intercept_mode_ == INTERCEPT_ALL_THREADS) { old_reporter_ = impl->GetGlobalTestPartResultReporter(); impl->SetGlobalTestPartResultReporter(this); } else { old_reporter_ = impl->GetTestPartResultReporterForCurrentThread(); impl->SetTestPartResultReporterForCurrentThread(this); } } // The d'tor restores the test part result reporter used by Google Test // before. ScopedFakeTestPartResultReporter::~ScopedFakeTestPartResultReporter() { internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); if (intercept_mode_ == INTERCEPT_ALL_THREADS) { impl->SetGlobalTestPartResultReporter(old_reporter_); } else { impl->SetTestPartResultReporterForCurrentThread(old_reporter_); } } // Increments the test part result count and remembers the result. // This method is from the TestPartResultReporterInterface interface. void ScopedFakeTestPartResultReporter::ReportTestPartResult( const TestPartResult& result) { result_->Append(result); } namespace internal { // Returns the type ID of ::testing::Test. We should always call this // instead of GetTypeId< ::testing::Test>() to get the type ID of // testing::Test. This is to work around a suspected linker bug when // using Google Test as a framework on Mac OS X. The bug causes // GetTypeId< ::testing::Test>() to return different values depending // on whether the call is from the Google Test framework itself or // from user test code. GetTestTypeId() is guaranteed to always // return the same value, as it always calls GetTypeId<>() from the // gtest.cc, which is within the Google Test framework. TypeId GetTestTypeId() { return GetTypeId(); } // The value of GetTestTypeId() as seen from within the Google Test // library. This is solely for testing GetTestTypeId(). extern const TypeId kTestTypeIdInGoogleTest = GetTestTypeId(); // This predicate-formatter checks that 'results' contains a test part // failure of the given type and that the failure message contains the // given substring. AssertionResult HasOneFailure(const char* /* results_expr */, const char* /* type_expr */, const char* /* substr_expr */, const TestPartResultArray& results, TestPartResult::Type type, const string& substr) { const String expected(type == TestPartResult::kFatalFailure ? "1 fatal failure" : "1 non-fatal failure"); Message msg; if (results.size() != 1) { msg << "Expected: " << expected << "\n" << " Actual: " << results.size() << " failures"; for (int i = 0; i < results.size(); i++) { msg << "\n" << results.GetTestPartResult(i); } return AssertionFailure() << msg; } const TestPartResult& r = results.GetTestPartResult(0); if (r.type() != type) { return AssertionFailure() << "Expected: " << expected << "\n" << " Actual:\n" << r; } if (strstr(r.message(), substr.c_str()) == NULL) { return AssertionFailure() << "Expected: " << expected << " containing \"" << substr << "\"\n" << " Actual:\n" << r; } return AssertionSuccess(); } // The constructor of SingleFailureChecker remembers where to look up // test part results, what type of failure we expect, and what // substring the failure message should contain. SingleFailureChecker:: SingleFailureChecker( const TestPartResultArray* results, TestPartResult::Type type, const string& substr) : results_(results), type_(type), substr_(substr) {} // The destructor of SingleFailureChecker verifies that the given // TestPartResultArray contains exactly one failure that has the given // type and contains the given substring. If that's not the case, a // non-fatal failure will be generated. SingleFailureChecker::~SingleFailureChecker() { EXPECT_PRED_FORMAT3(HasOneFailure, *results_, type_, substr_); } DefaultGlobalTestPartResultReporter::DefaultGlobalTestPartResultReporter( UnitTestImpl* unit_test) : unit_test_(unit_test) {} void DefaultGlobalTestPartResultReporter::ReportTestPartResult( const TestPartResult& result) { unit_test_->current_test_result()->AddTestPartResult(result); unit_test_->listeners()->repeater()->OnTestPartResult(result); } DefaultPerThreadTestPartResultReporter::DefaultPerThreadTestPartResultReporter( UnitTestImpl* unit_test) : unit_test_(unit_test) {} void DefaultPerThreadTestPartResultReporter::ReportTestPartResult( const TestPartResult& result) { unit_test_->GetGlobalTestPartResultReporter()->ReportTestPartResult(result); } // Returns the global test part result reporter. TestPartResultReporterInterface* UnitTestImpl::GetGlobalTestPartResultReporter() { internal::MutexLock lock(&global_test_part_result_reporter_mutex_); return global_test_part_result_repoter_; } // Sets the global test part result reporter. void UnitTestImpl::SetGlobalTestPartResultReporter( TestPartResultReporterInterface* reporter) { internal::MutexLock lock(&global_test_part_result_reporter_mutex_); global_test_part_result_repoter_ = reporter; } // Returns the test part result reporter for the current thread. TestPartResultReporterInterface* UnitTestImpl::GetTestPartResultReporterForCurrentThread() { return per_thread_test_part_result_reporter_.get(); } // Sets the test part result reporter for the current thread. void UnitTestImpl::SetTestPartResultReporterForCurrentThread( TestPartResultReporterInterface* reporter) { per_thread_test_part_result_reporter_.set(reporter); } // Gets the number of successful test cases. int UnitTestImpl::successful_test_case_count() const { return CountIf(test_cases_, TestCasePassed); } // Gets the number of failed test cases. int UnitTestImpl::failed_test_case_count() const { return CountIf(test_cases_, TestCaseFailed); } // Gets the number of all test cases. int UnitTestImpl::total_test_case_count() const { return static_cast(test_cases_.size()); } // Gets the number of all test cases that contain at least one test // that should run. int UnitTestImpl::test_case_to_run_count() const { return CountIf(test_cases_, ShouldRunTestCase); } // Gets the number of successful tests. int UnitTestImpl::successful_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::successful_test_count); } // Gets the number of failed tests. int UnitTestImpl::failed_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::failed_test_count); } // Gets the number of disabled tests. int UnitTestImpl::disabled_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::disabled_test_count); } // Gets the number of all tests. int UnitTestImpl::total_test_count() const { return SumOverTestCaseList(test_cases_, &TestCase::total_test_count); } // Gets the number of tests that should run. int UnitTestImpl::test_to_run_count() const { return SumOverTestCaseList(test_cases_, &TestCase::test_to_run_count); } // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // CurrentOsStackTraceExceptTop(1), Foo() will be included in the // trace but Bar() and CurrentOsStackTraceExceptTop() won't. String UnitTestImpl::CurrentOsStackTraceExceptTop(int skip_count) { (void)skip_count; return String(""); } // Returns the current time in milliseconds. TimeInMillis GetTimeInMillis() { #if GTEST_OS_WINDOWS_MOBILE || defined(__BORLANDC__) // Difference between 1970-01-01 and 1601-01-01 in milliseconds. // http://analogous.blogspot.com/2005/04/epoch.html const TimeInMillis kJavaEpochToWinFileTimeDelta = static_cast(116444736UL) * 100000UL; const DWORD kTenthMicrosInMilliSecond = 10000; SYSTEMTIME now_systime; FILETIME now_filetime; ULARGE_INTEGER now_int64; // TODO(kenton@google.com): Shouldn't this just use // GetSystemTimeAsFileTime()? GetSystemTime(&now_systime); if (SystemTimeToFileTime(&now_systime, &now_filetime)) { now_int64.LowPart = now_filetime.dwLowDateTime; now_int64.HighPart = now_filetime.dwHighDateTime; now_int64.QuadPart = (now_int64.QuadPart / kTenthMicrosInMilliSecond) - kJavaEpochToWinFileTimeDelta; return now_int64.QuadPart; } return 0; #elif GTEST_OS_WINDOWS && !GTEST_HAS_GETTIMEOFDAY_ __timeb64 now; # ifdef _MSC_VER // MSVC 8 deprecates _ftime64(), so we want to suppress warning 4996 // (deprecated function) there. // TODO(kenton@google.com): Use GetTickCount()? Or use // SystemTimeToFileTime() # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4996) // Temporarily disables warning 4996. _ftime64(&now); # pragma warning(pop) // Restores the warning state. # else _ftime64(&now); # endif // _MSC_VER return static_cast(now.time) * 1000 + now.millitm; #elif GTEST_HAS_GETTIMEOFDAY_ struct timeval now; gettimeofday(&now, NULL); return static_cast(now.tv_sec) * 1000 + now.tv_usec / 1000; #else # error "Don't know how to get the current time on your system." #endif } // Utilities // class String // Returns the input enclosed in double quotes if it's not NULL; // otherwise returns "(null)". For example, "\"Hello\"" is returned // for input "Hello". // // This is useful for printing a C string in the syntax of a literal. // // Known issue: escape sequences are not handled yet. String String::ShowCStringQuoted(const char* c_str) { return c_str ? String::Format("\"%s\"", c_str) : String("(null)"); } // Copies at most length characters from str into a newly-allocated // piece of memory of size length+1. The memory is allocated with new[]. // A terminating null byte is written to the memory, and a pointer to it // is returned. If str is NULL, NULL is returned. static char* CloneString(const char* str, size_t length) { if (str == NULL) { return NULL; } else { char* const clone = new char[length + 1]; posix::StrNCpy(clone, str, length); clone[length] = '\0'; return clone; } } // Clones a 0-terminated C string, allocating memory using new. The // caller is responsible for deleting[] the return value. Returns the // cloned string, or NULL if the input is NULL. const char * String::CloneCString(const char* c_str) { return (c_str == NULL) ? NULL : CloneString(c_str, strlen(c_str)); } #if GTEST_OS_WINDOWS_MOBILE // Creates a UTF-16 wide string from the given ANSI string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the wide string, or NULL if the // input is NULL. LPCWSTR String::AnsiToUtf16(const char* ansi) { if (!ansi) return NULL; const int length = strlen(ansi); const int unicode_length = MultiByteToWideChar(CP_ACP, 0, ansi, length, NULL, 0); WCHAR* unicode = new WCHAR[unicode_length + 1]; MultiByteToWideChar(CP_ACP, 0, ansi, length, unicode, unicode_length); unicode[unicode_length] = 0; return unicode; } // Creates an ANSI string from the given wide string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the ANSI string, or NULL if the // input is NULL. const char* String::Utf16ToAnsi(LPCWSTR utf16_str) { if (!utf16_str) return NULL; const int ansi_length = WideCharToMultiByte(CP_ACP, 0, utf16_str, -1, NULL, 0, NULL, NULL); char* ansi = new char[ansi_length + 1]; WideCharToMultiByte(CP_ACP, 0, utf16_str, -1, ansi, ansi_length, NULL, NULL); ansi[ansi_length] = 0; return ansi; } #endif // GTEST_OS_WINDOWS_MOBILE // Compares two C strings. Returns true iff they have the same content. // // Unlike strcmp(), this function can handle NULL argument(s). A NULL // C string is considered different to any non-NULL C string, // including the empty string. bool String::CStringEquals(const char * lhs, const char * rhs) { if ( lhs == NULL ) return rhs == NULL; if ( rhs == NULL ) return false; return strcmp(lhs, rhs) == 0; } #if GTEST_HAS_STD_WSTRING || GTEST_HAS_GLOBAL_WSTRING // Converts an array of wide chars to a narrow string using the UTF-8 // encoding, and streams the result to the given Message object. static void StreamWideCharsToMessage(const wchar_t* wstr, size_t length, Message* msg) { // TODO(wan): consider allowing a testing::String object to // contain '\0'. This will make it behave more like std::string, // and will allow ToUtf8String() to return the correct encoding // for '\0' s.t. we can get rid of the conditional here (and in // several other places). for (size_t i = 0; i != length; ) { // NOLINT if (wstr[i] != L'\0') { *msg << WideStringToUtf8(wstr + i, static_cast(length - i)); while (i != length && wstr[i] != L'\0') i++; } else { *msg << '\0'; i++; } } } #endif // GTEST_HAS_STD_WSTRING || GTEST_HAS_GLOBAL_WSTRING } // namespace internal #if GTEST_HAS_STD_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& Message::operator <<(const ::std::wstring& wstr) { internal::StreamWideCharsToMessage(wstr.c_str(), wstr.length(), this); return *this; } #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& Message::operator <<(const ::wstring& wstr) { internal::StreamWideCharsToMessage(wstr.c_str(), wstr.length(), this); return *this; } #endif // GTEST_HAS_GLOBAL_WSTRING // AssertionResult constructors. // Used in EXPECT_TRUE/FALSE(assertion_result). AssertionResult::AssertionResult(const AssertionResult& other) : success_(other.success_), message_(other.message_.get() != NULL ? new ::std::string(*other.message_) : static_cast< ::std::string*>(NULL)) { } // Returns the assertion's negation. Used with EXPECT/ASSERT_FALSE. AssertionResult AssertionResult::operator!() const { AssertionResult negation(!success_); if (message_.get() != NULL) negation << *message_; return negation; } // Makes a successful assertion result. AssertionResult AssertionSuccess() { return AssertionResult(true); } // Makes a failed assertion result. AssertionResult AssertionFailure() { return AssertionResult(false); } // Makes a failed assertion result with the given failure message. // Deprecated; use AssertionFailure() << message. AssertionResult AssertionFailure(const Message& message) { return AssertionFailure() << message; } namespace internal { // Constructs and returns the message for an equality assertion // (e.g. ASSERT_EQ, EXPECT_STREQ, etc) failure. // // The first four parameters are the expressions used in the assertion // and their values, as strings. For example, for ASSERT_EQ(foo, bar) // where foo is 5 and bar is 6, we have: // // expected_expression: "foo" // actual_expression: "bar" // expected_value: "5" // actual_value: "6" // // The ignoring_case parameter is true iff the assertion is a // *_STRCASEEQ*. When it's true, the string " (ignoring case)" will // be inserted into the message. AssertionResult EqFailure(const char* expected_expression, const char* actual_expression, const String& expected_value, const String& actual_value, bool ignoring_case) { Message msg; msg << "Value of: " << actual_expression; if (actual_value != actual_expression) { msg << "\n Actual: " << actual_value; } msg << "\nExpected: " << expected_expression; if (ignoring_case) { msg << " (ignoring case)"; } if (expected_value != expected_expression) { msg << "\nWhich is: " << expected_value; } return AssertionFailure() << msg; } // Constructs a failure message for Boolean assertions such as EXPECT_TRUE. String GetBoolAssertionFailureMessage(const AssertionResult& assertion_result, const char* expression_text, const char* actual_predicate_value, const char* expected_predicate_value) { const char* actual_message = assertion_result.message(); Message msg; msg << "Value of: " << expression_text << "\n Actual: " << actual_predicate_value; if (actual_message[0] != '\0') msg << " (" << actual_message << ")"; msg << "\nExpected: " << expected_predicate_value; return msg.GetString(); } // Helper function for implementing ASSERT_NEAR. AssertionResult DoubleNearPredFormat(const char* expr1, const char* expr2, const char* abs_error_expr, double val1, double val2, double abs_error) { const double diff = fabs(val1 - val2); if (diff <= abs_error) return AssertionSuccess(); // TODO(wan): do not print the value of an expression if it's // already a literal. return AssertionFailure() << "The difference between " << expr1 << " and " << expr2 << " is " << diff << ", which exceeds " << abs_error_expr << ", where\n" << expr1 << " evaluates to " << val1 << ",\n" << expr2 << " evaluates to " << val2 << ", and\n" << abs_error_expr << " evaluates to " << abs_error << "."; } // Helper template for implementing FloatLE() and DoubleLE(). template AssertionResult FloatingPointLE(const char* expr1, const char* expr2, RawType val1, RawType val2) { // Returns success if val1 is less than val2, if (val1 < val2) { return AssertionSuccess(); } // or if val1 is almost equal to val2. const FloatingPoint lhs(val1), rhs(val2); if (lhs.AlmostEquals(rhs)) { return AssertionSuccess(); } // Note that the above two checks will both fail if either val1 or // val2 is NaN, as the IEEE floating-point standard requires that // any predicate involving a NaN must return false. ::std::stringstream val1_ss; val1_ss << std::setprecision(std::numeric_limits::digits10 + 2) << val1; ::std::stringstream val2_ss; val2_ss << std::setprecision(std::numeric_limits::digits10 + 2) << val2; return AssertionFailure() << "Expected: (" << expr1 << ") <= (" << expr2 << ")\n" << " Actual: " << StringStreamToString(&val1_ss) << " vs " << StringStreamToString(&val2_ss); } } // namespace internal // Asserts that val1 is less than, or almost equal to, val2. Fails // otherwise. In particular, it fails if either val1 or val2 is NaN. AssertionResult FloatLE(const char* expr1, const char* expr2, float val1, float val2) { return internal::FloatingPointLE(expr1, expr2, val1, val2); } // Asserts that val1 is less than, or almost equal to, val2. Fails // otherwise. In particular, it fails if either val1 or val2 is NaN. AssertionResult DoubleLE(const char* expr1, const char* expr2, double val1, double val2) { return internal::FloatingPointLE(expr1, expr2, val1, val2); } namespace internal { // The helper function for {ASSERT|EXPECT}_EQ with int or enum // arguments. AssertionResult CmpHelperEQ(const char* expected_expression, const char* actual_expression, BiggestInt expected, BiggestInt actual) { if (expected == actual) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, FormatForComparisonFailureMessage(expected, actual), FormatForComparisonFailureMessage(actual, expected), false); } // A macro for implementing the helper functions needed to implement // ASSERT_?? and EXPECT_?? with integer or enum arguments. It is here // just to avoid copy-and-paste of similar code. #define GTEST_IMPL_CMP_HELPER_(op_name, op)\ AssertionResult CmpHelper##op_name(const char* expr1, const char* expr2, \ BiggestInt val1, BiggestInt val2) {\ if (val1 op val2) {\ return AssertionSuccess();\ } else {\ return AssertionFailure() \ << "Expected: (" << expr1 << ") " #op " (" << expr2\ << "), actual: " << FormatForComparisonFailureMessage(val1, val2)\ << " vs " << FormatForComparisonFailureMessage(val2, val1);\ }\ } // Implements the helper function for {ASSERT|EXPECT}_NE with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(NE, !=) // Implements the helper function for {ASSERT|EXPECT}_LE with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(LE, <=) // Implements the helper function for {ASSERT|EXPECT}_LT with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(LT, < ) // Implements the helper function for {ASSERT|EXPECT}_GE with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(GE, >=) // Implements the helper function for {ASSERT|EXPECT}_GT with int or // enum arguments. GTEST_IMPL_CMP_HELPER_(GT, > ) #undef GTEST_IMPL_CMP_HELPER_ // The helper function for {ASSERT|EXPECT}_STREQ. AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual) { if (String::CStringEquals(expected, actual)) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, String::ShowCStringQuoted(expected), String::ShowCStringQuoted(actual), false); } // The helper function for {ASSERT|EXPECT}_STRCASEEQ. AssertionResult CmpHelperSTRCASEEQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual) { if (String::CaseInsensitiveCStringEquals(expected, actual)) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, String::ShowCStringQuoted(expected), String::ShowCStringQuoted(actual), true); } // The helper function for {ASSERT|EXPECT}_STRNE. AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2) { if (!String::CStringEquals(s1, s2)) { return AssertionSuccess(); } else { return AssertionFailure() << "Expected: (" << s1_expression << ") != (" << s2_expression << "), actual: \"" << s1 << "\" vs \"" << s2 << "\""; } } // The helper function for {ASSERT|EXPECT}_STRCASENE. AssertionResult CmpHelperSTRCASENE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2) { if (!String::CaseInsensitiveCStringEquals(s1, s2)) { return AssertionSuccess(); } else { return AssertionFailure() << "Expected: (" << s1_expression << ") != (" << s2_expression << ") (ignoring case), actual: \"" << s1 << "\" vs \"" << s2 << "\""; } } } // namespace internal namespace { // Helper functions for implementing IsSubString() and IsNotSubstring(). // This group of overloaded functions return true iff needle is a // substring of haystack. NULL is considered a substring of itself // only. bool IsSubstringPred(const char* needle, const char* haystack) { if (needle == NULL || haystack == NULL) return needle == haystack; return strstr(haystack, needle) != NULL; } bool IsSubstringPred(const wchar_t* needle, const wchar_t* haystack) { if (needle == NULL || haystack == NULL) return needle == haystack; return wcsstr(haystack, needle) != NULL; } // StringType here can be either ::std::string or ::std::wstring. template bool IsSubstringPred(const StringType& needle, const StringType& haystack) { return haystack.find(needle) != StringType::npos; } // This function implements either IsSubstring() or IsNotSubstring(), // depending on the value of the expected_to_be_substring parameter. // StringType here can be const char*, const wchar_t*, ::std::string, // or ::std::wstring. template AssertionResult IsSubstringImpl( bool expected_to_be_substring, const char* needle_expr, const char* haystack_expr, const StringType& needle, const StringType& haystack) { if (IsSubstringPred(needle, haystack) == expected_to_be_substring) return AssertionSuccess(); const bool is_wide_string = sizeof(needle[0]) > 1; const char* const begin_string_quote = is_wide_string ? "L\"" : "\""; return AssertionFailure() << "Value of: " << needle_expr << "\n" << " Actual: " << begin_string_quote << needle << "\"\n" << "Expected: " << (expected_to_be_substring ? "" : "not ") << "a substring of " << haystack_expr << "\n" << "Which is: " << begin_string_quote << haystack << "\""; } } // namespace // IsSubstring() and IsNotSubstring() check whether needle is a // substring of haystack (NULL is considered a substring of itself // only), and return an appropriate error message when they fail. AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } #if GTEST_HAS_STD_WSTRING AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack) { return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); } AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack) { return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); } #endif // GTEST_HAS_STD_WSTRING namespace internal { #if GTEST_OS_WINDOWS namespace { // Helper function for IsHRESULT{SuccessFailure} predicates AssertionResult HRESULTFailureHelper(const char* expr, const char* expected, long hr) { // NOLINT # if GTEST_OS_WINDOWS_MOBILE // Windows CE doesn't support FormatMessage. const char error_text[] = ""; # else // Looks up the human-readable system message for the HRESULT code // and since we're not passing any params to FormatMessage, we don't // want inserts expanded. const DWORD kFlags = FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS; const DWORD kBufSize = 4096; // String::Format can't exceed this length. // Gets the system's human readable message string for this HRESULT. char error_text[kBufSize] = { '\0' }; DWORD message_length = ::FormatMessageA(kFlags, 0, // no source, we're asking system hr, // the error 0, // no line width restrictions error_text, // output buffer kBufSize, // buf size NULL); // no arguments for inserts // Trims tailing white space (FormatMessage leaves a trailing cr-lf) for (; message_length && IsSpace(error_text[message_length - 1]); --message_length) { error_text[message_length - 1] = '\0'; } # endif // GTEST_OS_WINDOWS_MOBILE const String error_hex(String::Format("0x%08X ", hr)); return ::testing::AssertionFailure() << "Expected: " << expr << " " << expected << ".\n" << " Actual: " << error_hex << error_text << "\n"; } } // namespace AssertionResult IsHRESULTSuccess(const char* expr, long hr) { // NOLINT if (SUCCEEDED(hr)) { return AssertionSuccess(); } return HRESULTFailureHelper(expr, "succeeds", hr); } AssertionResult IsHRESULTFailure(const char* expr, long hr) { // NOLINT if (FAILED(hr)) { return AssertionSuccess(); } return HRESULTFailureHelper(expr, "fails", hr); } #endif // GTEST_OS_WINDOWS // Utility functions for encoding Unicode text (wide strings) in // UTF-8. // A Unicode code-point can have upto 21 bits, and is encoded in UTF-8 // like this: // // Code-point length Encoding // 0 - 7 bits 0xxxxxxx // 8 - 11 bits 110xxxxx 10xxxxxx // 12 - 16 bits 1110xxxx 10xxxxxx 10xxxxxx // 17 - 21 bits 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx // The maximum code-point a one-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint1 = (static_cast(1) << 7) - 1; // The maximum code-point a two-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint2 = (static_cast(1) << (5 + 6)) - 1; // The maximum code-point a three-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint3 = (static_cast(1) << (4 + 2*6)) - 1; // The maximum code-point a four-byte UTF-8 sequence can represent. const UInt32 kMaxCodePoint4 = (static_cast(1) << (3 + 3*6)) - 1; // Chops off the n lowest bits from a bit pattern. Returns the n // lowest bits. As a side effect, the original bit pattern will be // shifted to the right by n bits. inline UInt32 ChopLowBits(UInt32* bits, int n) { const UInt32 low_bits = *bits & ((static_cast(1) << n) - 1); *bits >>= n; return low_bits; } // Converts a Unicode code point to a narrow string in UTF-8 encoding. // code_point parameter is of type UInt32 because wchar_t may not be // wide enough to contain a code point. // The output buffer str must containt at least 32 characters. // The function returns the address of the output buffer. // If the code_point is not a valid Unicode code point // (i.e. outside of Unicode range U+0 to U+10FFFF) it will be output // as '(Invalid Unicode 0xXXXXXXXX)'. char* CodePointToUtf8(UInt32 code_point, char* str) { if (code_point <= kMaxCodePoint1) { str[1] = '\0'; str[0] = static_cast(code_point); // 0xxxxxxx } else if (code_point <= kMaxCodePoint2) { str[2] = '\0'; str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[0] = static_cast(0xC0 | code_point); // 110xxxxx } else if (code_point <= kMaxCodePoint3) { str[3] = '\0'; str[2] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[0] = static_cast(0xE0 | code_point); // 1110xxxx } else if (code_point <= kMaxCodePoint4) { str[4] = '\0'; str[3] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[2] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx str[0] = static_cast(0xF0 | code_point); // 11110xxx } else { // The longest string String::Format can produce when invoked // with these parameters is 28 character long (not including // the terminating nul character). We are asking for 32 character // buffer just in case. This is also enough for strncpy to // null-terminate the destination string. posix::StrNCpy( str, String::Format("(Invalid Unicode 0x%X)", code_point).c_str(), 32); str[31] = '\0'; // Makes sure no change in the format to strncpy leaves // the result unterminated. } return str; } // The following two functions only make sense if the the system // uses UTF-16 for wide string encoding. All supported systems // with 16 bit wchar_t (Windows, Cygwin, Symbian OS) do use UTF-16. // Determines if the arguments constitute UTF-16 surrogate pair // and thus should be combined into a single Unicode code point // using CreateCodePointFromUtf16SurrogatePair. inline bool IsUtf16SurrogatePair(wchar_t first, wchar_t second) { return sizeof(wchar_t) == 2 && (first & 0xFC00) == 0xD800 && (second & 0xFC00) == 0xDC00; } // Creates a Unicode code point from UTF16 surrogate pair. inline UInt32 CreateCodePointFromUtf16SurrogatePair(wchar_t first, wchar_t second) { const UInt32 mask = (1 << 10) - 1; return (sizeof(wchar_t) == 2) ? (((first & mask) << 10) | (second & mask)) + 0x10000 : // This function should not be called when the condition is // false, but we provide a sensible default in case it is. static_cast(first); } // Converts a wide string to a narrow string in UTF-8 encoding. // The wide string is assumed to have the following encoding: // UTF-16 if sizeof(wchar_t) == 2 (on Windows, Cygwin, Symbian OS) // UTF-32 if sizeof(wchar_t) == 4 (on Linux) // Parameter str points to a null-terminated wide string. // Parameter num_chars may additionally limit the number // of wchar_t characters processed. -1 is used when the entire string // should be processed. // If the string contains code points that are not valid Unicode code points // (i.e. outside of Unicode range U+0 to U+10FFFF) they will be output // as '(Invalid Unicode 0xXXXXXXXX)'. If the string is in UTF16 encoding // and contains invalid UTF-16 surrogate pairs, values in those pairs // will be encoded as individual Unicode characters from Basic Normal Plane. String WideStringToUtf8(const wchar_t* str, int num_chars) { if (num_chars == -1) num_chars = static_cast(wcslen(str)); ::std::stringstream stream; for (int i = 0; i < num_chars; ++i) { UInt32 unicode_code_point; if (str[i] == L'\0') { break; } else if (i + 1 < num_chars && IsUtf16SurrogatePair(str[i], str[i + 1])) { unicode_code_point = CreateCodePointFromUtf16SurrogatePair(str[i], str[i + 1]); i++; } else { unicode_code_point = static_cast(str[i]); } char buffer[32]; // CodePointToUtf8 requires a buffer this big. stream << CodePointToUtf8(unicode_code_point, buffer); } return StringStreamToString(&stream); } // Converts a wide C string to a String using the UTF-8 encoding. // NULL will be converted to "(null)". String String::ShowWideCString(const wchar_t * wide_c_str) { if (wide_c_str == NULL) return String("(null)"); return String(internal::WideStringToUtf8(wide_c_str, -1).c_str()); } // Similar to ShowWideCString(), except that this function encloses // the converted string in double quotes. String String::ShowWideCStringQuoted(const wchar_t* wide_c_str) { if (wide_c_str == NULL) return String("(null)"); return String::Format("L\"%s\"", String::ShowWideCString(wide_c_str).c_str()); } // Compares two wide C strings. Returns true iff they have the same // content. // // Unlike wcscmp(), this function can handle NULL argument(s). A NULL // C string is considered different to any non-NULL C string, // including the empty string. bool String::WideCStringEquals(const wchar_t * lhs, const wchar_t * rhs) { if (lhs == NULL) return rhs == NULL; if (rhs == NULL) return false; return wcscmp(lhs, rhs) == 0; } // Helper function for *_STREQ on wide strings. AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const wchar_t* expected, const wchar_t* actual) { if (String::WideCStringEquals(expected, actual)) { return AssertionSuccess(); } return EqFailure(expected_expression, actual_expression, String::ShowWideCStringQuoted(expected), String::ShowWideCStringQuoted(actual), false); } // Helper function for *_STRNE on wide strings. AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const wchar_t* s1, const wchar_t* s2) { if (!String::WideCStringEquals(s1, s2)) { return AssertionSuccess(); } return AssertionFailure() << "Expected: (" << s1_expression << ") != (" << s2_expression << "), actual: " << String::ShowWideCStringQuoted(s1) << " vs " << String::ShowWideCStringQuoted(s2); } // Compares two C strings, ignoring case. Returns true iff they have // the same content. // // Unlike strcasecmp(), this function can handle NULL argument(s). A // NULL C string is considered different to any non-NULL C string, // including the empty string. bool String::CaseInsensitiveCStringEquals(const char * lhs, const char * rhs) { if (lhs == NULL) return rhs == NULL; if (rhs == NULL) return false; return posix::StrCaseCmp(lhs, rhs) == 0; } // Compares two wide C strings, ignoring case. Returns true iff they // have the same content. // // Unlike wcscasecmp(), this function can handle NULL argument(s). // A NULL C string is considered different to any non-NULL wide C string, // including the empty string. // NB: The implementations on different platforms slightly differ. // On windows, this method uses _wcsicmp which compares according to LC_CTYPE // environment variable. On GNU platform this method uses wcscasecmp // which compares according to LC_CTYPE category of the current locale. // On MacOS X, it uses towlower, which also uses LC_CTYPE category of the // current locale. bool String::CaseInsensitiveWideCStringEquals(const wchar_t* lhs, const wchar_t* rhs) { if (lhs == NULL) return rhs == NULL; if (rhs == NULL) return false; #if GTEST_OS_WINDOWS return _wcsicmp(lhs, rhs) == 0; #elif GTEST_OS_LINUX && !GTEST_OS_LINUX_ANDROID return wcscasecmp(lhs, rhs) == 0; #else // Android, Mac OS X and Cygwin don't define wcscasecmp. // Other unknown OSes may not define it either. wint_t left, right; do { left = towlower(*lhs++); right = towlower(*rhs++); } while (left && left == right); return left == right; #endif // OS selector } // Compares this with another String. // Returns < 0 if this is less than rhs, 0 if this is equal to rhs, or > 0 // if this is greater than rhs. int String::Compare(const String & rhs) const { const char* const lhs_c_str = c_str(); const char* const rhs_c_str = rhs.c_str(); if (lhs_c_str == NULL) { return rhs_c_str == NULL ? 0 : -1; // NULL < anything except NULL } else if (rhs_c_str == NULL) { return 1; } const size_t shorter_str_len = length() <= rhs.length() ? length() : rhs.length(); for (size_t i = 0; i != shorter_str_len; i++) { if (lhs_c_str[i] < rhs_c_str[i]) { return -1; } else if (lhs_c_str[i] > rhs_c_str[i]) { return 1; } } return (length() < rhs.length()) ? -1 : (length() > rhs.length()) ? 1 : 0; } // Returns true iff this String ends with the given suffix. *Any* // String is considered to end with a NULL or empty suffix. bool String::EndsWith(const char* suffix) const { if (suffix == NULL || CStringEquals(suffix, "")) return true; if (c_str() == NULL) return false; const size_t this_len = strlen(c_str()); const size_t suffix_len = strlen(suffix); return (this_len >= suffix_len) && CStringEquals(c_str() + this_len - suffix_len, suffix); } // Returns true iff this String ends with the given suffix, ignoring case. // Any String is considered to end with a NULL or empty suffix. bool String::EndsWithCaseInsensitive(const char* suffix) const { if (suffix == NULL || CStringEquals(suffix, "")) return true; if (c_str() == NULL) return false; const size_t this_len = strlen(c_str()); const size_t suffix_len = strlen(suffix); return (this_len >= suffix_len) && CaseInsensitiveCStringEquals(c_str() + this_len - suffix_len, suffix); } // Formats a list of arguments to a String, using the same format // spec string as for printf. // // We do not use the StringPrintf class as it is not universally // available. // // The result is limited to 4096 characters (including the tailing 0). // If 4096 characters are not enough to format the input, or if // there's an error, "" is // returned. String String::Format(const char * format, ...) { va_list args; va_start(args, format); char buffer[4096]; const int kBufferSize = sizeof(buffer)/sizeof(buffer[0]); // MSVC 8 deprecates vsnprintf(), so we want to suppress warning // 4996 (deprecated function) there. #ifdef _MSC_VER // We are using MSVC. # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4996) // Temporarily disables warning 4996. const int size = vsnprintf(buffer, kBufferSize, format, args); # pragma warning(pop) // Restores the warning state. #else // We are not using MSVC. const int size = vsnprintf(buffer, kBufferSize, format, args); #endif // _MSC_VER va_end(args); // vsnprintf()'s behavior is not portable. When the buffer is not // big enough, it returns a negative value in MSVC, and returns the // needed buffer size on Linux. When there is an output error, it // always returns a negative value. For simplicity, we lump the two // error cases together. if (size < 0 || size >= kBufferSize) { return String(""); } else { return String(buffer, size); } } // Converts the buffer in a stringstream to a String, converting NUL // bytes to "\\0" along the way. String StringStreamToString(::std::stringstream* ss) { const ::std::string& str = ss->str(); const char* const start = str.c_str(); const char* const end = start + str.length(); // We need to use a helper stringstream to do this transformation // because String doesn't support push_back(). ::std::stringstream helper; for (const char* ch = start; ch != end; ++ch) { if (*ch == '\0') { helper << "\\0"; // Replaces NUL with "\\0"; } else { helper.put(*ch); } } return String(helper.str().c_str()); } // Appends the user-supplied message to the Google-Test-generated message. String AppendUserMessage(const String& gtest_msg, const Message& user_msg) { // Appends the user message if it's non-empty. const String user_msg_string = user_msg.GetString(); if (user_msg_string.empty()) { return gtest_msg; } Message msg; msg << gtest_msg << "\n" << user_msg_string; return msg.GetString(); } } // namespace internal // class TestResult // Creates an empty TestResult. TestResult::TestResult() : death_test_count_(0), elapsed_time_(0) { } // D'tor. TestResult::~TestResult() { } // Returns the i-th test part result among all the results. i can // range from 0 to total_part_count() - 1. If i is not in that range, // aborts the program. const TestPartResult& TestResult::GetTestPartResult(int i) const { if (i < 0 || i >= total_part_count()) internal::posix::Abort(); return test_part_results_.at(i); } // Returns the i-th test property. i can range from 0 to // test_property_count() - 1. If i is not in that range, aborts the // program. const TestProperty& TestResult::GetTestProperty(int i) const { if (i < 0 || i >= test_property_count()) internal::posix::Abort(); return test_properties_.at(i); } // Clears the test part results. void TestResult::ClearTestPartResults() { test_part_results_.clear(); } // Adds a test part result to the list. void TestResult::AddTestPartResult(const TestPartResult& test_part_result) { test_part_results_.push_back(test_part_result); } // Adds a test property to the list. If a property with the same key as the // supplied property is already represented, the value of this test_property // replaces the old value for that key. void TestResult::RecordProperty(const TestProperty& test_property) { if (!ValidateTestProperty(test_property)) { return; } internal::MutexLock lock(&test_properites_mutex_); const std::vector::iterator property_with_matching_key = std::find_if(test_properties_.begin(), test_properties_.end(), internal::TestPropertyKeyIs(test_property.key())); if (property_with_matching_key == test_properties_.end()) { test_properties_.push_back(test_property); return; } property_with_matching_key->SetValue(test_property.value()); } // Adds a failure if the key is a reserved attribute of Google Test // testcase tags. Returns true if the property is valid. bool TestResult::ValidateTestProperty(const TestProperty& test_property) { internal::String key(test_property.key()); if (key == "name" || key == "status" || key == "time" || key == "classname") { ADD_FAILURE() << "Reserved key used in RecordProperty(): " << key << " ('name', 'status', 'time', and 'classname' are reserved by " << GTEST_NAME_ << ")"; return false; } return true; } // Clears the object. void TestResult::Clear() { test_part_results_.clear(); test_properties_.clear(); death_test_count_ = 0; elapsed_time_ = 0; } // Returns true iff the test failed. bool TestResult::Failed() const { for (int i = 0; i < total_part_count(); ++i) { if (GetTestPartResult(i).failed()) return true; } return false; } // Returns true iff the test part fatally failed. static bool TestPartFatallyFailed(const TestPartResult& result) { return result.fatally_failed(); } // Returns true iff the test fatally failed. bool TestResult::HasFatalFailure() const { return CountIf(test_part_results_, TestPartFatallyFailed) > 0; } // Returns true iff the test part non-fatally failed. static bool TestPartNonfatallyFailed(const TestPartResult& result) { return result.nonfatally_failed(); } // Returns true iff the test has a non-fatal failure. bool TestResult::HasNonfatalFailure() const { return CountIf(test_part_results_, TestPartNonfatallyFailed) > 0; } // Gets the number of all test parts. This is the sum of the number // of successful test parts and the number of failed test parts. int TestResult::total_part_count() const { return static_cast(test_part_results_.size()); } // Returns the number of the test properties. int TestResult::test_property_count() const { return static_cast(test_properties_.size()); } // class Test // Creates a Test object. // The c'tor saves the values of all Google Test flags. Test::Test() : gtest_flag_saver_(new internal::GTestFlagSaver) { } // The d'tor restores the values of all Google Test flags. Test::~Test() { delete gtest_flag_saver_; } // Sets up the test fixture. // // A sub-class may override this. void Test::SetUp() { } // Tears down the test fixture. // // A sub-class may override this. void Test::TearDown() { } // Allows user supplied key value pairs to be recorded for later output. void Test::RecordProperty(const char* key, const char* value) { UnitTest::GetInstance()->RecordPropertyForCurrentTest(key, value); } // Allows user supplied key value pairs to be recorded for later output. void Test::RecordProperty(const char* key, int value) { Message value_message; value_message << value; RecordProperty(key, value_message.GetString().c_str()); } namespace internal { void ReportFailureInUnknownLocation(TestPartResult::Type result_type, const String& message) { // This function is a friend of UnitTest and as such has access to // AddTestPartResult. UnitTest::GetInstance()->AddTestPartResult( result_type, NULL, // No info about the source file where the exception occurred. -1, // We have no info on which line caused the exception. message, String()); // No stack trace, either. } } // namespace internal // Google Test requires all tests in the same test case to use the same test // fixture class. This function checks if the current test has the // same fixture class as the first test in the current test case. If // yes, it returns true; otherwise it generates a Google Test failure and // returns false. bool Test::HasSameFixtureClass() { internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); const TestCase* const test_case = impl->current_test_case(); // Info about the first test in the current test case. const TestInfo* const first_test_info = test_case->test_info_list()[0]; const internal::TypeId first_fixture_id = first_test_info->fixture_class_id_; const char* const first_test_name = first_test_info->name(); // Info about the current test. const TestInfo* const this_test_info = impl->current_test_info(); const internal::TypeId this_fixture_id = this_test_info->fixture_class_id_; const char* const this_test_name = this_test_info->name(); if (this_fixture_id != first_fixture_id) { // Is the first test defined using TEST? const bool first_is_TEST = first_fixture_id == internal::GetTestTypeId(); // Is this test defined using TEST? const bool this_is_TEST = this_fixture_id == internal::GetTestTypeId(); if (first_is_TEST || this_is_TEST) { // The user mixed TEST and TEST_F in this test case - we'll tell // him/her how to fix it. // Gets the name of the TEST and the name of the TEST_F. Note // that first_is_TEST and this_is_TEST cannot both be true, as // the fixture IDs are different for the two tests. const char* const TEST_name = first_is_TEST ? first_test_name : this_test_name; const char* const TEST_F_name = first_is_TEST ? this_test_name : first_test_name; ADD_FAILURE() << "All tests in the same test case must use the same test fixture\n" << "class, so mixing TEST_F and TEST in the same test case is\n" << "illegal. In test case " << this_test_info->test_case_name() << ",\n" << "test " << TEST_F_name << " is defined using TEST_F but\n" << "test " << TEST_name << " is defined using TEST. You probably\n" << "want to change the TEST to TEST_F or move it to another test\n" << "case."; } else { // The user defined two fixture classes with the same name in // two namespaces - we'll tell him/her how to fix it. ADD_FAILURE() << "All tests in the same test case must use the same test fixture\n" << "class. However, in test case " << this_test_info->test_case_name() << ",\n" << "you defined test " << first_test_name << " and test " << this_test_name << "\n" << "using two different test fixture classes. This can happen if\n" << "the two classes are from different namespaces or translation\n" << "units and have the same name. You should probably rename one\n" << "of the classes to put the tests into different test cases."; } return false; } return true; } #if GTEST_HAS_SEH // Adds an "exception thrown" fatal failure to the current test. This // function returns its result via an output parameter pointer because VC++ // prohibits creation of objects with destructors on stack in functions // using __try (see error C2712). static internal::String* FormatSehExceptionMessage(DWORD exception_code, const char* location) { Message message; message << "SEH exception with code 0x" << std::setbase(16) << exception_code << std::setbase(10) << " thrown in " << location << "."; return new internal::String(message.GetString()); } #endif // GTEST_HAS_SEH #if GTEST_HAS_EXCEPTIONS // Adds an "exception thrown" fatal failure to the current test. static internal::String FormatCxxExceptionMessage(const char* description, const char* location) { Message message; if (description != NULL) { message << "C++ exception with description \"" << description << "\""; } else { message << "Unknown C++ exception"; } message << " thrown in " << location << "."; return message.GetString(); } static internal::String PrintTestPartResultToString( const TestPartResult& test_part_result); // A failed Google Test assertion will throw an exception of this type when // GTEST_FLAG(throw_on_failure) is true (if exceptions are enabled). We // derive it from std::runtime_error, which is for errors presumably // detectable only at run time. Since std::runtime_error inherits from // std::exception, many testing frameworks know how to extract and print the // message inside it. class GoogleTestFailureException : public ::std::runtime_error { public: explicit GoogleTestFailureException(const TestPartResult& failure) : ::std::runtime_error(PrintTestPartResultToString(failure).c_str()) {} }; #endif // GTEST_HAS_EXCEPTIONS namespace internal { // We put these helper functions in the internal namespace as IBM's xlC // compiler rejects the code if they were declared static. // Runs the given method and handles SEH exceptions it throws, when // SEH is supported; returns the 0-value for type Result in case of an // SEH exception. (Microsoft compilers cannot handle SEH and C++ // exceptions in the same function. Therefore, we provide a separate // wrapper function for handling SEH exceptions.) template Result HandleSehExceptionsInMethodIfSupported( T* object, Result (T::*method)(), const char* location) { #if GTEST_HAS_SEH __try { return (object->*method)(); } __except (internal::UnitTestOptions::GTestShouldProcessSEH( // NOLINT GetExceptionCode())) { // We create the exception message on the heap because VC++ prohibits // creation of objects with destructors on stack in functions using __try // (see error C2712). internal::String* exception_message = FormatSehExceptionMessage( GetExceptionCode(), location); internal::ReportFailureInUnknownLocation(TestPartResult::kFatalFailure, *exception_message); delete exception_message; return static_cast(0); } #else (void)location; return (object->*method)(); #endif // GTEST_HAS_SEH } // Runs the given method and catches and reports C++ and/or SEH-style // exceptions, if they are supported; returns the 0-value for type // Result in case of an SEH exception. template Result HandleExceptionsInMethodIfSupported( T* object, Result (T::*method)(), const char* location) { // NOTE: The user code can affect the way in which Google Test handles // exceptions by setting GTEST_FLAG(catch_exceptions), but only before // RUN_ALL_TESTS() starts. It is technically possible to check the flag // after the exception is caught and either report or re-throw the // exception based on the flag's value: // // try { // // Perform the test method. // } catch (...) { // if (GTEST_FLAG(catch_exceptions)) // // Report the exception as failure. // else // throw; // Re-throws the original exception. // } // // However, the purpose of this flag is to allow the program to drop into // the debugger when the exception is thrown. On most platforms, once the // control enters the catch block, the exception origin information is // lost and the debugger will stop the program at the point of the // re-throw in this function -- instead of at the point of the original // throw statement in the code under test. For this reason, we perform // the check early, sacrificing the ability to affect Google Test's // exception handling in the method where the exception is thrown. if (internal::GetUnitTestImpl()->catch_exceptions()) { #if GTEST_HAS_EXCEPTIONS try { return HandleSehExceptionsInMethodIfSupported(object, method, location); } catch (const GoogleTestFailureException&) { // NOLINT // This exception doesn't originate in code under test. It makes no // sense to report it as a test failure. throw; } catch (const std::exception& e) { // NOLINT internal::ReportFailureInUnknownLocation( TestPartResult::kFatalFailure, FormatCxxExceptionMessage(e.what(), location)); } catch (...) { // NOLINT internal::ReportFailureInUnknownLocation( TestPartResult::kFatalFailure, FormatCxxExceptionMessage(NULL, location)); } return static_cast(0); #else return HandleSehExceptionsInMethodIfSupported(object, method, location); #endif // GTEST_HAS_EXCEPTIONS } else { return (object->*method)(); } } } // namespace internal // Runs the test and updates the test result. void Test::Run() { if (!HasSameFixtureClass()) return; internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported(this, &Test::SetUp, "SetUp()"); // We will run the test only if SetUp() was successful. if (!HasFatalFailure()) { impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &Test::TestBody, "the test body"); } // However, we want to clean up as much as possible. Hence we will // always call TearDown(), even if SetUp() or the test body has // failed. impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &Test::TearDown, "TearDown()"); } // Returns true iff the current test has a fatal failure. bool Test::HasFatalFailure() { return internal::GetUnitTestImpl()->current_test_result()->HasFatalFailure(); } // Returns true iff the current test has a non-fatal failure. bool Test::HasNonfatalFailure() { return internal::GetUnitTestImpl()->current_test_result()-> HasNonfatalFailure(); } // class TestInfo // Constructs a TestInfo object. It assumes ownership of the test factory // object. // TODO(vladl@google.com): Make a_test_case_name and a_name const string&'s // to signify they cannot be NULLs. TestInfo::TestInfo(const char* a_test_case_name, const char* a_name, const char* a_type_param, const char* a_value_param, internal::TypeId fixture_class_id, internal::TestFactoryBase* factory) : test_case_name_(a_test_case_name), name_(a_name), type_param_(a_type_param ? new std::string(a_type_param) : NULL), value_param_(a_value_param ? new std::string(a_value_param) : NULL), fixture_class_id_(fixture_class_id), should_run_(false), is_disabled_(false), matches_filter_(false), factory_(factory), result_() {} // Destructs a TestInfo object. TestInfo::~TestInfo() { delete factory_; } namespace internal { // Creates a new TestInfo object and registers it with Google Test; // returns the created object. // // Arguments: // // test_case_name: name of the test case // name: name of the test // type_param: the name of the test's type parameter, or NULL if // this is not a typed or a type-parameterized test. // value_param: text representation of the test's value parameter, // or NULL if this is not a value-parameterized test. // fixture_class_id: ID of the test fixture class // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case // factory: pointer to the factory that creates a test object. // The newly created TestInfo instance will assume // ownership of the factory object. TestInfo* MakeAndRegisterTestInfo( const char* test_case_name, const char* name, const char* type_param, const char* value_param, TypeId fixture_class_id, SetUpTestCaseFunc set_up_tc, TearDownTestCaseFunc tear_down_tc, TestFactoryBase* factory) { TestInfo* const test_info = new TestInfo(test_case_name, name, type_param, value_param, fixture_class_id, factory); GetUnitTestImpl()->AddTestInfo(set_up_tc, tear_down_tc, test_info); return test_info; } #if GTEST_HAS_PARAM_TEST void ReportInvalidTestCaseType(const char* test_case_name, const char* file, int line) { Message errors; errors << "Attempted redefinition of test case " << test_case_name << ".\n" << "All tests in the same test case must use the same test fixture\n" << "class. However, in test case " << test_case_name << ", you tried\n" << "to define a test using a fixture class different from the one\n" << "used earlier. This can happen if the two fixture classes are\n" << "from different namespaces and have the same name. You should\n" << "probably rename one of the classes to put the tests into different\n" << "test cases."; fprintf(stderr, "%s %s", FormatFileLocation(file, line).c_str(), errors.GetString().c_str()); } #endif // GTEST_HAS_PARAM_TEST } // namespace internal namespace { // A predicate that checks the test name of a TestInfo against a known // value. // // This is used for implementation of the TestCase class only. We put // it in the anonymous namespace to prevent polluting the outer // namespace. // // TestNameIs is copyable. class TestNameIs { public: // Constructor. // // TestNameIs has NO default constructor. explicit TestNameIs(const char* name) : name_(name) {} // Returns true iff the test name of test_info matches name_. bool operator()(const TestInfo * test_info) const { return test_info && internal::String(test_info->name()).Compare(name_) == 0; } private: internal::String name_; }; } // namespace namespace internal { // This method expands all parameterized tests registered with macros TEST_P // and INSTANTIATE_TEST_CASE_P into regular tests and registers those. // This will be done just once during the program runtime. void UnitTestImpl::RegisterParameterizedTests() { #if GTEST_HAS_PARAM_TEST if (!parameterized_tests_registered_) { parameterized_test_registry_.RegisterTests(); parameterized_tests_registered_ = true; } #endif } } // namespace internal // Creates the test object, runs it, records its result, and then // deletes it. void TestInfo::Run() { if (!should_run_) return; // Tells UnitTest where to store test result. internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); impl->set_current_test_info(this); TestEventListener* repeater = UnitTest::GetInstance()->listeners().repeater(); // Notifies the unit test event listeners that a test is about to start. repeater->OnTestStart(*this); const TimeInMillis start = internal::GetTimeInMillis(); impl->os_stack_trace_getter()->UponLeavingGTest(); // Creates the test object. Test* const test = internal::HandleExceptionsInMethodIfSupported( factory_, &internal::TestFactoryBase::CreateTest, "the test fixture's constructor"); // Runs the test only if the test object was created and its // constructor didn't generate a fatal failure. if ((test != NULL) && !Test::HasFatalFailure()) { // This doesn't throw as all user code that can throw are wrapped into // exception handling code. test->Run(); } // Deletes the test object. impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( test, &Test::DeleteSelf_, "the test fixture's destructor"); result_.set_elapsed_time(internal::GetTimeInMillis() - start); // Notifies the unit test event listener that a test has just finished. repeater->OnTestEnd(*this); // Tells UnitTest to stop associating assertion results to this // test. impl->set_current_test_info(NULL); } // class TestCase // Gets the number of successful tests in this test case. int TestCase::successful_test_count() const { return CountIf(test_info_list_, TestPassed); } // Gets the number of failed tests in this test case. int TestCase::failed_test_count() const { return CountIf(test_info_list_, TestFailed); } int TestCase::disabled_test_count() const { return CountIf(test_info_list_, TestDisabled); } // Get the number of tests in this test case that should run. int TestCase::test_to_run_count() const { return CountIf(test_info_list_, ShouldRunTest); } // Gets the number of all tests. int TestCase::total_test_count() const { return static_cast(test_info_list_.size()); } // Creates a TestCase with the given name. // // Arguments: // // name: name of the test case // a_type_param: the name of the test case's type parameter, or NULL if // this is not a typed or a type-parameterized test case. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase::TestCase(const char* a_name, const char* a_type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc) : name_(a_name), type_param_(a_type_param ? new std::string(a_type_param) : NULL), set_up_tc_(set_up_tc), tear_down_tc_(tear_down_tc), should_run_(false), elapsed_time_(0) { } // Destructor of TestCase. TestCase::~TestCase() { // Deletes every Test in the collection. ForEach(test_info_list_, internal::Delete); } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. const TestInfo* TestCase::GetTestInfo(int i) const { const int index = GetElementOr(test_indices_, i, -1); return index < 0 ? NULL : test_info_list_[index]; } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. TestInfo* TestCase::GetMutableTestInfo(int i) { const int index = GetElementOr(test_indices_, i, -1); return index < 0 ? NULL : test_info_list_[index]; } // Adds a test to this test case. Will delete the test upon // destruction of the TestCase object. void TestCase::AddTestInfo(TestInfo * test_info) { test_info_list_.push_back(test_info); test_indices_.push_back(static_cast(test_indices_.size())); } // Runs every test in this TestCase. void TestCase::Run() { if (!should_run_) return; internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); impl->set_current_test_case(this); TestEventListener* repeater = UnitTest::GetInstance()->listeners().repeater(); repeater->OnTestCaseStart(*this); impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &TestCase::RunSetUpTestCase, "SetUpTestCase()"); const internal::TimeInMillis start = internal::GetTimeInMillis(); for (int i = 0; i < total_test_count(); i++) { GetMutableTestInfo(i)->Run(); } elapsed_time_ = internal::GetTimeInMillis() - start; impl->os_stack_trace_getter()->UponLeavingGTest(); internal::HandleExceptionsInMethodIfSupported( this, &TestCase::RunTearDownTestCase, "TearDownTestCase()"); repeater->OnTestCaseEnd(*this); impl->set_current_test_case(NULL); } // Clears the results of all tests in this test case. void TestCase::ClearResult() { ForEach(test_info_list_, TestInfo::ClearTestResult); } // Shuffles the tests in this test case. void TestCase::ShuffleTests(internal::Random* random) { Shuffle(random, &test_indices_); } // Restores the test order to before the first shuffle. void TestCase::UnshuffleTests() { for (size_t i = 0; i < test_indices_.size(); i++) { test_indices_[i] = static_cast(i); } } // Formats a countable noun. Depending on its quantity, either the // singular form or the plural form is used. e.g. // // FormatCountableNoun(1, "formula", "formuli") returns "1 formula". // FormatCountableNoun(5, "book", "books") returns "5 books". static internal::String FormatCountableNoun(int count, const char * singular_form, const char * plural_form) { return internal::String::Format("%d %s", count, count == 1 ? singular_form : plural_form); } // Formats the count of tests. static internal::String FormatTestCount(int test_count) { return FormatCountableNoun(test_count, "test", "tests"); } // Formats the count of test cases. static internal::String FormatTestCaseCount(int test_case_count) { return FormatCountableNoun(test_case_count, "test case", "test cases"); } // Converts a TestPartResult::Type enum to human-friendly string // representation. Both kNonFatalFailure and kFatalFailure are translated // to "Failure", as the user usually doesn't care about the difference // between the two when viewing the test result. static const char * TestPartResultTypeToString(TestPartResult::Type type) { switch (type) { case TestPartResult::kSuccess: return "Success"; case TestPartResult::kNonFatalFailure: case TestPartResult::kFatalFailure: #ifdef _MSC_VER return "error: "; #else return "Failure\n"; #endif default: return "Unknown result type"; } } // Prints a TestPartResult to a String. static internal::String PrintTestPartResultToString( const TestPartResult& test_part_result) { return (Message() << internal::FormatFileLocation(test_part_result.file_name(), test_part_result.line_number()) << " " << TestPartResultTypeToString(test_part_result.type()) << test_part_result.message()).GetString(); } // Prints a TestPartResult. static void PrintTestPartResult(const TestPartResult& test_part_result) { const internal::String& result = PrintTestPartResultToString(test_part_result); printf("%s\n", result.c_str()); fflush(stdout); // If the test program runs in Visual Studio or a debugger, the // following statements add the test part result message to the Output // window such that the user can double-click on it to jump to the // corresponding source code location; otherwise they do nothing. #if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE // We don't call OutputDebugString*() on Windows Mobile, as printing // to stdout is done by OutputDebugString() there already - we don't // want the same message printed twice. ::OutputDebugStringA(result.c_str()); ::OutputDebugStringA("\n"); #endif } // class PrettyUnitTestResultPrinter namespace internal { enum GTestColor { COLOR_DEFAULT, COLOR_RED, COLOR_GREEN, COLOR_YELLOW }; #if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE // Returns the character attribute for the given color. WORD GetColorAttribute(GTestColor color) { switch (color) { case COLOR_RED: return FOREGROUND_RED; case COLOR_GREEN: return FOREGROUND_GREEN; case COLOR_YELLOW: return FOREGROUND_RED | FOREGROUND_GREEN; default: return 0; } } #else // Returns the ANSI color code for the given color. COLOR_DEFAULT is // an invalid input. const char* GetAnsiColorCode(GTestColor color) { switch (color) { case COLOR_RED: return "1"; case COLOR_GREEN: return "2"; case COLOR_YELLOW: return "3"; default: return NULL; }; } #endif // GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE // Returns true iff Google Test should use colors in the output. bool ShouldUseColor(bool stdout_is_tty) { const char* const gtest_color = GTEST_FLAG(color).c_str(); if (String::CaseInsensitiveCStringEquals(gtest_color, "auto")) { #if GTEST_OS_WINDOWS // On Windows the TERM variable is usually not set, but the // console there does support colors. return stdout_is_tty; #else // On non-Windows platforms, we rely on the TERM variable. const char* const term = posix::GetEnv("TERM"); const bool term_supports_color = String::CStringEquals(term, "xterm") || String::CStringEquals(term, "xterm-color") || String::CStringEquals(term, "xterm-256color") || String::CStringEquals(term, "screen") || String::CStringEquals(term, "linux") || String::CStringEquals(term, "cygwin"); return stdout_is_tty && term_supports_color; #endif // GTEST_OS_WINDOWS } return String::CaseInsensitiveCStringEquals(gtest_color, "yes") || String::CaseInsensitiveCStringEquals(gtest_color, "true") || String::CaseInsensitiveCStringEquals(gtest_color, "t") || String::CStringEquals(gtest_color, "1"); // We take "yes", "true", "t", and "1" as meaning "yes". If the // value is neither one of these nor "auto", we treat it as "no" to // be conservative. } // Helpers for printing colored strings to stdout. Note that on Windows, we // cannot simply emit special characters and have the terminal change colors. // This routine must actually emit the characters rather than return a string // that would be colored when printed, as can be done on Linux. void ColoredPrintf(GTestColor color, const char* fmt, ...) { va_list args; va_start(args, fmt); #if GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN || GTEST_OS_ZOS const bool use_color = false; #else static const bool in_color_mode = ShouldUseColor(posix::IsATTY(posix::FileNo(stdout)) != 0); const bool use_color = in_color_mode && (color != COLOR_DEFAULT); #endif // GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN || GTEST_OS_ZOS // The '!= 0' comparison is necessary to satisfy MSVC 7.1. if (!use_color) { vprintf(fmt, args); va_end(args); return; } #if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE const HANDLE stdout_handle = GetStdHandle(STD_OUTPUT_HANDLE); // Gets the current text color. CONSOLE_SCREEN_BUFFER_INFO buffer_info; GetConsoleScreenBufferInfo(stdout_handle, &buffer_info); const WORD old_color_attrs = buffer_info.wAttributes; // We need to flush the stream buffers into the console before each // SetConsoleTextAttribute call lest it affect the text that is already // printed but has not yet reached the console. fflush(stdout); SetConsoleTextAttribute(stdout_handle, GetColorAttribute(color) | FOREGROUND_INTENSITY); vprintf(fmt, args); fflush(stdout); // Restores the text color. SetConsoleTextAttribute(stdout_handle, old_color_attrs); #else printf("\033[0;3%sm", GetAnsiColorCode(color)); vprintf(fmt, args); printf("\033[m"); // Resets the terminal to default. #endif // GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE va_end(args); } void PrintFullTestCommentIfPresent(const TestInfo& test_info) { const char* const type_param = test_info.type_param(); const char* const value_param = test_info.value_param(); if (type_param != NULL || value_param != NULL) { printf(", where "); if (type_param != NULL) { printf("TypeParam = %s", type_param); if (value_param != NULL) printf(" and "); } if (value_param != NULL) { printf("GetParam() = %s", value_param); } } } // This class implements the TestEventListener interface. // // Class PrettyUnitTestResultPrinter is copyable. class PrettyUnitTestResultPrinter : public TestEventListener { public: PrettyUnitTestResultPrinter() {} static void PrintTestName(const char * test_case, const char * test) { printf("%s.%s", test_case, test); } // The following methods override what's in the TestEventListener class. virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration); virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test); virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestCaseStart(const TestCase& test_case); virtual void OnTestStart(const TestInfo& test_info); virtual void OnTestPartResult(const TestPartResult& result); virtual void OnTestEnd(const TestInfo& test_info); virtual void OnTestCaseEnd(const TestCase& test_case); virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test); virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {} private: static void PrintFailedTests(const UnitTest& unit_test); internal::String test_case_name_; }; // Fired before each iteration of tests starts. void PrettyUnitTestResultPrinter::OnTestIterationStart( const UnitTest& unit_test, int iteration) { if (GTEST_FLAG(repeat) != 1) printf("\nRepeating all tests (iteration %d) . . .\n\n", iteration + 1); const char* const filter = GTEST_FLAG(filter).c_str(); // Prints the filter if it's not *. This reminds the user that some // tests may be skipped. if (!internal::String::CStringEquals(filter, kUniversalFilter)) { ColoredPrintf(COLOR_YELLOW, "Note: %s filter = %s\n", GTEST_NAME_, filter); } if (internal::ShouldShard(kTestTotalShards, kTestShardIndex, false)) { const Int32 shard_index = Int32FromEnvOrDie(kTestShardIndex, -1); ColoredPrintf(COLOR_YELLOW, "Note: This is test shard %d of %s.\n", static_cast(shard_index) + 1, internal::posix::GetEnv(kTestTotalShards)); } if (GTEST_FLAG(shuffle)) { ColoredPrintf(COLOR_YELLOW, "Note: Randomizing tests' orders with a seed of %d .\n", unit_test.random_seed()); } ColoredPrintf(COLOR_GREEN, "[==========] "); printf("Running %s from %s.\n", FormatTestCount(unit_test.test_to_run_count()).c_str(), FormatTestCaseCount(unit_test.test_case_to_run_count()).c_str()); fflush(stdout); } void PrettyUnitTestResultPrinter::OnEnvironmentsSetUpStart( const UnitTest& /*unit_test*/) { ColoredPrintf(COLOR_GREEN, "[----------] "); printf("Global test environment set-up.\n"); fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestCaseStart(const TestCase& test_case) { test_case_name_ = test_case.name(); const internal::String counts = FormatCountableNoun(test_case.test_to_run_count(), "test", "tests"); ColoredPrintf(COLOR_GREEN, "[----------] "); printf("%s from %s", counts.c_str(), test_case_name_.c_str()); if (test_case.type_param() == NULL) { printf("\n"); } else { printf(", where TypeParam = %s\n", test_case.type_param()); } fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestStart(const TestInfo& test_info) { ColoredPrintf(COLOR_GREEN, "[ RUN ] "); PrintTestName(test_case_name_.c_str(), test_info.name()); printf("\n"); fflush(stdout); } // Called after an assertion failure. void PrettyUnitTestResultPrinter::OnTestPartResult( const TestPartResult& result) { // If the test part succeeded, we don't need to do anything. if (result.type() == TestPartResult::kSuccess) return; // Print failure message from the assertion (e.g. expected this and got that). PrintTestPartResult(result); fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestEnd(const TestInfo& test_info) { if (test_info.result()->Passed()) { ColoredPrintf(COLOR_GREEN, "[ OK ] "); } else { ColoredPrintf(COLOR_RED, "[ FAILED ] "); } PrintTestName(test_case_name_.c_str(), test_info.name()); if (test_info.result()->Failed()) PrintFullTestCommentIfPresent(test_info); if (GTEST_FLAG(print_time)) { printf(" (%s ms)\n", internal::StreamableToString( test_info.result()->elapsed_time()).c_str()); } else { printf("\n"); } fflush(stdout); } void PrettyUnitTestResultPrinter::OnTestCaseEnd(const TestCase& test_case) { if (!GTEST_FLAG(print_time)) return; test_case_name_ = test_case.name(); const internal::String counts = FormatCountableNoun(test_case.test_to_run_count(), "test", "tests"); ColoredPrintf(COLOR_GREEN, "[----------] "); printf("%s from %s (%s ms total)\n\n", counts.c_str(), test_case_name_.c_str(), internal::StreamableToString(test_case.elapsed_time()).c_str()); fflush(stdout); } void PrettyUnitTestResultPrinter::OnEnvironmentsTearDownStart( const UnitTest& /*unit_test*/) { ColoredPrintf(COLOR_GREEN, "[----------] "); printf("Global test environment tear-down\n"); fflush(stdout); } // Internal helper for printing the list of failed tests. void PrettyUnitTestResultPrinter::PrintFailedTests(const UnitTest& unit_test) { const int failed_test_count = unit_test.failed_test_count(); if (failed_test_count == 0) { return; } for (int i = 0; i < unit_test.total_test_case_count(); ++i) { const TestCase& test_case = *unit_test.GetTestCase(i); if (!test_case.should_run() || (test_case.failed_test_count() == 0)) { continue; } for (int j = 0; j < test_case.total_test_count(); ++j) { const TestInfo& test_info = *test_case.GetTestInfo(j); if (!test_info.should_run() || test_info.result()->Passed()) { continue; } ColoredPrintf(COLOR_RED, "[ FAILED ] "); printf("%s.%s", test_case.name(), test_info.name()); PrintFullTestCommentIfPresent(test_info); printf("\n"); } } } void PrettyUnitTestResultPrinter::OnTestIterationEnd(const UnitTest& unit_test, int /*iteration*/) { ColoredPrintf(COLOR_GREEN, "[==========] "); printf("%s from %s ran.", FormatTestCount(unit_test.test_to_run_count()).c_str(), FormatTestCaseCount(unit_test.test_case_to_run_count()).c_str()); if (GTEST_FLAG(print_time)) { printf(" (%s ms total)", internal::StreamableToString(unit_test.elapsed_time()).c_str()); } printf("\n"); ColoredPrintf(COLOR_GREEN, "[ PASSED ] "); printf("%s.\n", FormatTestCount(unit_test.successful_test_count()).c_str()); int num_failures = unit_test.failed_test_count(); if (!unit_test.Passed()) { const int failed_test_count = unit_test.failed_test_count(); ColoredPrintf(COLOR_RED, "[ FAILED ] "); printf("%s, listed below:\n", FormatTestCount(failed_test_count).c_str()); PrintFailedTests(unit_test); printf("\n%2d FAILED %s\n", num_failures, num_failures == 1 ? "TEST" : "TESTS"); } int num_disabled = unit_test.disabled_test_count(); if (num_disabled && !GTEST_FLAG(also_run_disabled_tests)) { if (!num_failures) { printf("\n"); // Add a spacer if no FAILURE banner is displayed. } ColoredPrintf(COLOR_YELLOW, " YOU HAVE %d DISABLED %s\n\n", num_disabled, num_disabled == 1 ? "TEST" : "TESTS"); } // Ensure that Google Test output is printed before, e.g., heapchecker output. fflush(stdout); } // End PrettyUnitTestResultPrinter // class TestEventRepeater // // This class forwards events to other event listeners. class TestEventRepeater : public TestEventListener { public: TestEventRepeater() : forwarding_enabled_(true) {} virtual ~TestEventRepeater(); void Append(TestEventListener *listener); TestEventListener* Release(TestEventListener* listener); // Controls whether events will be forwarded to listeners_. Set to false // in death test child processes. bool forwarding_enabled() const { return forwarding_enabled_; } void set_forwarding_enabled(bool enable) { forwarding_enabled_ = enable; } virtual void OnTestProgramStart(const UnitTest& unit_test); virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration); virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test); virtual void OnEnvironmentsSetUpEnd(const UnitTest& unit_test); virtual void OnTestCaseStart(const TestCase& test_case); virtual void OnTestStart(const TestInfo& test_info); virtual void OnTestPartResult(const TestPartResult& result); virtual void OnTestEnd(const TestInfo& test_info); virtual void OnTestCaseEnd(const TestCase& test_case); virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test); virtual void OnEnvironmentsTearDownEnd(const UnitTest& unit_test); virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); virtual void OnTestProgramEnd(const UnitTest& unit_test); private: // Controls whether events will be forwarded to listeners_. Set to false // in death test child processes. bool forwarding_enabled_; // The list of listeners that receive events. std::vector listeners_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TestEventRepeater); }; TestEventRepeater::~TestEventRepeater() { ForEach(listeners_, Delete); } void TestEventRepeater::Append(TestEventListener *listener) { listeners_.push_back(listener); } // TODO(vladl@google.com): Factor the search functionality into Vector::Find. TestEventListener* TestEventRepeater::Release(TestEventListener *listener) { for (size_t i = 0; i < listeners_.size(); ++i) { if (listeners_[i] == listener) { listeners_.erase(listeners_.begin() + i); return listener; } } return NULL; } // Since most methods are very similar, use macros to reduce boilerplate. // This defines a member that forwards the call to all listeners. #define GTEST_REPEATER_METHOD_(Name, Type) \ void TestEventRepeater::Name(const Type& parameter) { \ if (forwarding_enabled_) { \ for (size_t i = 0; i < listeners_.size(); i++) { \ listeners_[i]->Name(parameter); \ } \ } \ } // This defines a member that forwards the call to all listeners in reverse // order. #define GTEST_REVERSE_REPEATER_METHOD_(Name, Type) \ void TestEventRepeater::Name(const Type& parameter) { \ if (forwarding_enabled_) { \ for (int i = static_cast(listeners_.size()) - 1; i >= 0; i--) { \ listeners_[i]->Name(parameter); \ } \ } \ } GTEST_REPEATER_METHOD_(OnTestProgramStart, UnitTest) GTEST_REPEATER_METHOD_(OnEnvironmentsSetUpStart, UnitTest) GTEST_REPEATER_METHOD_(OnTestCaseStart, TestCase) GTEST_REPEATER_METHOD_(OnTestStart, TestInfo) GTEST_REPEATER_METHOD_(OnTestPartResult, TestPartResult) GTEST_REPEATER_METHOD_(OnEnvironmentsTearDownStart, UnitTest) GTEST_REVERSE_REPEATER_METHOD_(OnEnvironmentsSetUpEnd, UnitTest) GTEST_REVERSE_REPEATER_METHOD_(OnEnvironmentsTearDownEnd, UnitTest) GTEST_REVERSE_REPEATER_METHOD_(OnTestEnd, TestInfo) GTEST_REVERSE_REPEATER_METHOD_(OnTestCaseEnd, TestCase) GTEST_REVERSE_REPEATER_METHOD_(OnTestProgramEnd, UnitTest) #undef GTEST_REPEATER_METHOD_ #undef GTEST_REVERSE_REPEATER_METHOD_ void TestEventRepeater::OnTestIterationStart(const UnitTest& unit_test, int iteration) { if (forwarding_enabled_) { for (size_t i = 0; i < listeners_.size(); i++) { listeners_[i]->OnTestIterationStart(unit_test, iteration); } } } void TestEventRepeater::OnTestIterationEnd(const UnitTest& unit_test, int iteration) { if (forwarding_enabled_) { for (int i = static_cast(listeners_.size()) - 1; i >= 0; i--) { listeners_[i]->OnTestIterationEnd(unit_test, iteration); } } } // End TestEventRepeater // This class generates an XML output file. class XmlUnitTestResultPrinter : public EmptyTestEventListener { public: explicit XmlUnitTestResultPrinter(const char* output_file); virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); private: // Is c a whitespace character that is normalized to a space character // when it appears in an XML attribute value? static bool IsNormalizableWhitespace(char c) { return c == 0x9 || c == 0xA || c == 0xD; } // May c appear in a well-formed XML document? static bool IsValidXmlCharacter(char c) { return IsNormalizableWhitespace(c) || c >= 0x20; } // Returns an XML-escaped copy of the input string str. If // is_attribute is true, the text is meant to appear as an attribute // value, and normalizable whitespace is preserved by replacing it // with character references. static String EscapeXml(const char* str, bool is_attribute); // Returns the given string with all characters invalid in XML removed. static string RemoveInvalidXmlCharacters(const string& str); // Convenience wrapper around EscapeXml when str is an attribute value. static String EscapeXmlAttribute(const char* str) { return EscapeXml(str, true); } // Convenience wrapper around EscapeXml when str is not an attribute value. static String EscapeXmlText(const char* str) { return EscapeXml(str, false); } // Streams an XML CDATA section, escaping invalid CDATA sequences as needed. static void OutputXmlCDataSection(::std::ostream* stream, const char* data); // Streams an XML representation of a TestInfo object. static void OutputXmlTestInfo(::std::ostream* stream, const char* test_case_name, const TestInfo& test_info); // Prints an XML representation of a TestCase object static void PrintXmlTestCase(FILE* out, const TestCase& test_case); // Prints an XML summary of unit_test to output stream out. static void PrintXmlUnitTest(FILE* out, const UnitTest& unit_test); // Produces a string representing the test properties in a result as space // delimited XML attributes based on the property key="value" pairs. // When the String is not empty, it includes a space at the beginning, // to delimit this attribute from prior attributes. static String TestPropertiesAsXmlAttributes(const TestResult& result); // The output file. const String output_file_; GTEST_DISALLOW_COPY_AND_ASSIGN_(XmlUnitTestResultPrinter); }; // Creates a new XmlUnitTestResultPrinter. XmlUnitTestResultPrinter::XmlUnitTestResultPrinter(const char* output_file) : output_file_(output_file) { if (output_file_.c_str() == NULL || output_file_.empty()) { fprintf(stderr, "XML output file may not be null\n"); fflush(stderr); exit(EXIT_FAILURE); } } // Called after the unit test ends. void XmlUnitTestResultPrinter::OnTestIterationEnd(const UnitTest& unit_test, int /*iteration*/) { FILE* xmlout = NULL; FilePath output_file(output_file_); FilePath output_dir(output_file.RemoveFileName()); if (output_dir.CreateDirectoriesRecursively()) { xmlout = posix::FOpen(output_file_.c_str(), "w"); } if (xmlout == NULL) { // TODO(wan): report the reason of the failure. // // We don't do it for now as: // // 1. There is no urgent need for it. // 2. It's a bit involved to make the errno variable thread-safe on // all three operating systems (Linux, Windows, and Mac OS). // 3. To interpret the meaning of errno in a thread-safe way, // we need the strerror_r() function, which is not available on // Windows. fprintf(stderr, "Unable to open file \"%s\"\n", output_file_.c_str()); fflush(stderr); exit(EXIT_FAILURE); } PrintXmlUnitTest(xmlout, unit_test); fclose(xmlout); } // Returns an XML-escaped copy of the input string str. If is_attribute // is true, the text is meant to appear as an attribute value, and // normalizable whitespace is preserved by replacing it with character // references. // // Invalid XML characters in str, if any, are stripped from the output. // It is expected that most, if not all, of the text processed by this // module will consist of ordinary English text. // If this module is ever modified to produce version 1.1 XML output, // most invalid characters can be retained using character references. // TODO(wan): It might be nice to have a minimally invasive, human-readable // escaping scheme for invalid characters, rather than dropping them. String XmlUnitTestResultPrinter::EscapeXml(const char* str, bool is_attribute) { Message m; if (str != NULL) { for (const char* src = str; *src; ++src) { switch (*src) { case '<': m << "<"; break; case '>': m << ">"; break; case '&': m << "&"; break; case '\'': if (is_attribute) m << "'"; else m << '\''; break; case '"': if (is_attribute) m << """; else m << '"'; break; default: if (IsValidXmlCharacter(*src)) { if (is_attribute && IsNormalizableWhitespace(*src)) m << String::Format("&#x%02X;", unsigned(*src)); else m << *src; } break; } } } return m.GetString(); } // Returns the given string with all characters invalid in XML removed. // Currently invalid characters are dropped from the string. An // alternative is to replace them with certain characters such as . or ?. string XmlUnitTestResultPrinter::RemoveInvalidXmlCharacters(const string& str) { string output; output.reserve(str.size()); for (string::const_iterator it = str.begin(); it != str.end(); ++it) if (IsValidXmlCharacter(*it)) output.push_back(*it); return output; } // The following routines generate an XML representation of a UnitTest // object. // // This is how Google Test concepts map to the DTD: // // <-- corresponds to a UnitTest object // <-- corresponds to a TestCase object // <-- corresponds to a TestInfo object // ... // ... // ... // <-- individual assertion failures // // // // Formats the given time in milliseconds as seconds. std::string FormatTimeInMillisAsSeconds(TimeInMillis ms) { ::std::stringstream ss; ss << ms/1000.0; return ss.str(); } // Streams an XML CDATA section, escaping invalid CDATA sequences as needed. void XmlUnitTestResultPrinter::OutputXmlCDataSection(::std::ostream* stream, const char* data) { const char* segment = data; *stream << ""); if (next_segment != NULL) { stream->write( segment, static_cast(next_segment - segment)); *stream << "]]>]]>"); } else { *stream << segment; break; } } *stream << "]]>"; } // Prints an XML representation of a TestInfo object. // TODO(wan): There is also value in printing properties with the plain printer. void XmlUnitTestResultPrinter::OutputXmlTestInfo(::std::ostream* stream, const char* test_case_name, const TestInfo& test_info) { const TestResult& result = *test_info.result(); *stream << " \n"; *stream << " "; const string location = internal::FormatCompilerIndependentFileLocation( part.file_name(), part.line_number()); const string message = location + "\n" + part.message(); OutputXmlCDataSection(stream, RemoveInvalidXmlCharacters(message).c_str()); *stream << "\n"; } } if (failures == 0) *stream << " />\n"; else *stream << " \n"; } // Prints an XML representation of a TestCase object void XmlUnitTestResultPrinter::PrintXmlTestCase(FILE* out, const TestCase& test_case) { fprintf(out, " \n", FormatTimeInMillisAsSeconds(test_case.elapsed_time()).c_str()); for (int i = 0; i < test_case.total_test_count(); ++i) { ::std::stringstream stream; OutputXmlTestInfo(&stream, test_case.name(), *test_case.GetTestInfo(i)); fprintf(out, "%s", StringStreamToString(&stream).c_str()); } fprintf(out, " \n"); } // Prints an XML summary of unit_test to output stream out. void XmlUnitTestResultPrinter::PrintXmlUnitTest(FILE* out, const UnitTest& unit_test) { fprintf(out, "\n"); fprintf(out, "\n"); for (int i = 0; i < unit_test.total_test_case_count(); ++i) PrintXmlTestCase(out, *unit_test.GetTestCase(i)); fprintf(out, "\n"); } // Produces a string representing the test properties in a result as space // delimited XML attributes based on the property key="value" pairs. String XmlUnitTestResultPrinter::TestPropertiesAsXmlAttributes( const TestResult& result) { Message attributes; for (int i = 0; i < result.test_property_count(); ++i) { const TestProperty& property = result.GetTestProperty(i); attributes << " " << property.key() << "=" << "\"" << EscapeXmlAttribute(property.value()) << "\""; } return attributes.GetString(); } // End XmlUnitTestResultPrinter #if GTEST_CAN_STREAM_RESULTS_ // Streams test results to the given port on the given host machine. class StreamingListener : public EmptyTestEventListener { public: // Escapes '=', '&', '%', and '\n' characters in str as "%xx". static string UrlEncode(const char* str); StreamingListener(const string& host, const string& port) : sockfd_(-1), host_name_(host), port_num_(port) { MakeConnection(); Send("gtest_streaming_protocol_version=1.0\n"); } virtual ~StreamingListener() { if (sockfd_ != -1) CloseConnection(); } void OnTestProgramStart(const UnitTest& /* unit_test */) { Send("event=TestProgramStart\n"); } void OnTestProgramEnd(const UnitTest& unit_test) { // Note that Google Test current only report elapsed time for each // test iteration, not for the entire test program. Send(String::Format("event=TestProgramEnd&passed=%d\n", unit_test.Passed())); // Notify the streaming server to stop. CloseConnection(); } void OnTestIterationStart(const UnitTest& /* unit_test */, int iteration) { Send(String::Format("event=TestIterationStart&iteration=%d\n", iteration)); } void OnTestIterationEnd(const UnitTest& unit_test, int /* iteration */) { Send(String::Format("event=TestIterationEnd&passed=%d&elapsed_time=%sms\n", unit_test.Passed(), StreamableToString(unit_test.elapsed_time()).c_str())); } void OnTestCaseStart(const TestCase& test_case) { Send(String::Format("event=TestCaseStart&name=%s\n", test_case.name())); } void OnTestCaseEnd(const TestCase& test_case) { Send(String::Format("event=TestCaseEnd&passed=%d&elapsed_time=%sms\n", test_case.Passed(), StreamableToString(test_case.elapsed_time()).c_str())); } void OnTestStart(const TestInfo& test_info) { Send(String::Format("event=TestStart&name=%s\n", test_info.name())); } void OnTestEnd(const TestInfo& test_info) { Send(String::Format( "event=TestEnd&passed=%d&elapsed_time=%sms\n", (test_info.result())->Passed(), StreamableToString((test_info.result())->elapsed_time()).c_str())); } void OnTestPartResult(const TestPartResult& test_part_result) { const char* file_name = test_part_result.file_name(); if (file_name == NULL) file_name = ""; Send(String::Format("event=TestPartResult&file=%s&line=%d&message=", UrlEncode(file_name).c_str(), test_part_result.line_number())); Send(UrlEncode(test_part_result.message()) + "\n"); } private: // Creates a client socket and connects to the server. void MakeConnection(); // Closes the socket. void CloseConnection() { GTEST_CHECK_(sockfd_ != -1) << "CloseConnection() can be called only when there is a connection."; close(sockfd_); sockfd_ = -1; } // Sends a string to the socket. void Send(const string& message) { GTEST_CHECK_(sockfd_ != -1) << "Send() can be called only when there is a connection."; const int len = static_cast(message.length()); if (write(sockfd_, message.c_str(), len) != len) { GTEST_LOG_(WARNING) << "stream_result_to: failed to stream to " << host_name_ << ":" << port_num_; } } int sockfd_; // socket file descriptor const string host_name_; const string port_num_; GTEST_DISALLOW_COPY_AND_ASSIGN_(StreamingListener); }; // class StreamingListener // Checks if str contains '=', '&', '%' or '\n' characters. If yes, // replaces them by "%xx" where xx is their hexadecimal value. For // example, replaces "=" with "%3D". This algorithm is O(strlen(str)) // in both time and space -- important as the input str may contain an // arbitrarily long test failure message and stack trace. string StreamingListener::UrlEncode(const char* str) { string result; result.reserve(strlen(str) + 1); for (char ch = *str; ch != '\0'; ch = *++str) { switch (ch) { case '%': case '=': case '&': case '\n': result.append(String::Format("%%%02x", static_cast(ch))); break; default: result.push_back(ch); break; } } return result; } void StreamingListener::MakeConnection() { GTEST_CHECK_(sockfd_ == -1) << "MakeConnection() can't be called when there is already a connection."; addrinfo hints; memset(&hints, 0, sizeof(hints)); hints.ai_family = AF_UNSPEC; // To allow both IPv4 and IPv6 addresses. hints.ai_socktype = SOCK_STREAM; addrinfo* servinfo = NULL; // Use the getaddrinfo() to get a linked list of IP addresses for // the given host name. const int error_num = getaddrinfo( host_name_.c_str(), port_num_.c_str(), &hints, &servinfo); if (error_num != 0) { GTEST_LOG_(WARNING) << "stream_result_to: getaddrinfo() failed: " << gai_strerror(error_num); } // Loop through all the results and connect to the first we can. for (addrinfo* cur_addr = servinfo; sockfd_ == -1 && cur_addr != NULL; cur_addr = cur_addr->ai_next) { sockfd_ = socket( cur_addr->ai_family, cur_addr->ai_socktype, cur_addr->ai_protocol); if (sockfd_ != -1) { // Connect the client socket to the server socket. if (connect(sockfd_, cur_addr->ai_addr, cur_addr->ai_addrlen) == -1) { close(sockfd_); sockfd_ = -1; } } } freeaddrinfo(servinfo); // all done with this structure if (sockfd_ == -1) { GTEST_LOG_(WARNING) << "stream_result_to: failed to connect to " << host_name_ << ":" << port_num_; } } // End of class Streaming Listener #endif // GTEST_CAN_STREAM_RESULTS__ // Class ScopedTrace // Pushes the given source file location and message onto a per-thread // trace stack maintained by Google Test. // L < UnitTest::mutex_ ScopedTrace::ScopedTrace(const char* file, int line, const Message& message) { TraceInfo trace; trace.file = file; trace.line = line; trace.message = message.GetString(); UnitTest::GetInstance()->PushGTestTrace(trace); } // Pops the info pushed by the c'tor. // L < UnitTest::mutex_ ScopedTrace::~ScopedTrace() { UnitTest::GetInstance()->PopGTestTrace(); } // class OsStackTraceGetter // Returns the current OS stack trace as a String. Parameters: // // max_depth - the maximum number of stack frames to be included // in the trace. // skip_count - the number of top frames to be skipped; doesn't count // against max_depth. // // L < mutex_ // We use "L < mutex_" to denote that the function may acquire mutex_. String OsStackTraceGetter::CurrentStackTrace(int, int) { return String(""); } // L < mutex_ void OsStackTraceGetter::UponLeavingGTest() { } const char* const OsStackTraceGetter::kElidedFramesMarker = "... " GTEST_NAME_ " internal frames ..."; } // namespace internal // class TestEventListeners TestEventListeners::TestEventListeners() : repeater_(new internal::TestEventRepeater()), default_result_printer_(NULL), default_xml_generator_(NULL) { } TestEventListeners::~TestEventListeners() { delete repeater_; } // Returns the standard listener responsible for the default console // output. Can be removed from the listeners list to shut down default // console output. Note that removing this object from the listener list // with Release transfers its ownership to the user. void TestEventListeners::Append(TestEventListener* listener) { repeater_->Append(listener); } // Removes the given event listener from the list and returns it. It then // becomes the caller's responsibility to delete the listener. Returns // NULL if the listener is not found in the list. TestEventListener* TestEventListeners::Release(TestEventListener* listener) { if (listener == default_result_printer_) default_result_printer_ = NULL; else if (listener == default_xml_generator_) default_xml_generator_ = NULL; return repeater_->Release(listener); } // Returns repeater that broadcasts the TestEventListener events to all // subscribers. TestEventListener* TestEventListeners::repeater() { return repeater_; } // Sets the default_result_printer attribute to the provided listener. // The listener is also added to the listener list and previous // default_result_printer is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void TestEventListeners::SetDefaultResultPrinter(TestEventListener* listener) { if (default_result_printer_ != listener) { // It is an error to pass this method a listener that is already in the // list. delete Release(default_result_printer_); default_result_printer_ = listener; if (listener != NULL) Append(listener); } } // Sets the default_xml_generator attribute to the provided listener. The // listener is also added to the listener list and previous // default_xml_generator is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void TestEventListeners::SetDefaultXmlGenerator(TestEventListener* listener) { if (default_xml_generator_ != listener) { // It is an error to pass this method a listener that is already in the // list. delete Release(default_xml_generator_); default_xml_generator_ = listener; if (listener != NULL) Append(listener); } } // Controls whether events will be forwarded by the repeater to the // listeners in the list. bool TestEventListeners::EventForwardingEnabled() const { return repeater_->forwarding_enabled(); } void TestEventListeners::SuppressEventForwarding() { repeater_->set_forwarding_enabled(false); } // class UnitTest // Gets the singleton UnitTest object. The first time this method is // called, a UnitTest object is constructed and returned. Consecutive // calls will return the same object. // // We don't protect this under mutex_ as a user is not supposed to // call this before main() starts, from which point on the return // value will never change. UnitTest * UnitTest::GetInstance() { // When compiled with MSVC 7.1 in optimized mode, destroying the // UnitTest object upon exiting the program messes up the exit code, // causing successful tests to appear failed. We have to use a // different implementation in this case to bypass the compiler bug. // This implementation makes the compiler happy, at the cost of // leaking the UnitTest object. // CodeGear C++Builder insists on a public destructor for the // default implementation. Use this implementation to keep good OO // design with private destructor. #if (_MSC_VER == 1310 && !defined(_DEBUG)) || defined(__BORLANDC__) static UnitTest* const instance = new UnitTest; return instance; #else static UnitTest instance; return &instance; #endif // (_MSC_VER == 1310 && !defined(_DEBUG)) || defined(__BORLANDC__) } // Gets the number of successful test cases. int UnitTest::successful_test_case_count() const { return impl()->successful_test_case_count(); } // Gets the number of failed test cases. int UnitTest::failed_test_case_count() const { return impl()->failed_test_case_count(); } // Gets the number of all test cases. int UnitTest::total_test_case_count() const { return impl()->total_test_case_count(); } // Gets the number of all test cases that contain at least one test // that should run. int UnitTest::test_case_to_run_count() const { return impl()->test_case_to_run_count(); } // Gets the number of successful tests. int UnitTest::successful_test_count() const { return impl()->successful_test_count(); } // Gets the number of failed tests. int UnitTest::failed_test_count() const { return impl()->failed_test_count(); } // Gets the number of disabled tests. int UnitTest::disabled_test_count() const { return impl()->disabled_test_count(); } // Gets the number of all tests. int UnitTest::total_test_count() const { return impl()->total_test_count(); } // Gets the number of tests that should run. int UnitTest::test_to_run_count() const { return impl()->test_to_run_count(); } // Gets the elapsed time, in milliseconds. internal::TimeInMillis UnitTest::elapsed_time() const { return impl()->elapsed_time(); } // Returns true iff the unit test passed (i.e. all test cases passed). bool UnitTest::Passed() const { return impl()->Passed(); } // Returns true iff the unit test failed (i.e. some test case failed // or something outside of all tests failed). bool UnitTest::Failed() const { return impl()->Failed(); } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. const TestCase* UnitTest::GetTestCase(int i) const { return impl()->GetTestCase(i); } // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. TestCase* UnitTest::GetMutableTestCase(int i) { return impl()->GetMutableTestCase(i); } // Returns the list of event listeners that can be used to track events // inside Google Test. TestEventListeners& UnitTest::listeners() { return *impl()->listeners(); } // Registers and returns a global test environment. When a test // program is run, all global test environments will be set-up in the // order they were registered. After all tests in the program have // finished, all global test environments will be torn-down in the // *reverse* order they were registered. // // The UnitTest object takes ownership of the given environment. // // We don't protect this under mutex_, as we only support calling it // from the main thread. Environment* UnitTest::AddEnvironment(Environment* env) { if (env == NULL) { return NULL; } impl_->environments().push_back(env); return env; } // Adds a TestPartResult to the current TestResult object. All Google Test // assertion macros (e.g. ASSERT_TRUE, EXPECT_EQ, etc) eventually call // this to report their results. The user code should use the // assertion macros instead of calling this directly. // L < mutex_ void UnitTest::AddTestPartResult(TestPartResult::Type result_type, const char* file_name, int line_number, const internal::String& message, const internal::String& os_stack_trace) { Message msg; msg << message; internal::MutexLock lock(&mutex_); if (impl_->gtest_trace_stack().size() > 0) { msg << "\n" << GTEST_NAME_ << " trace:"; for (int i = static_cast(impl_->gtest_trace_stack().size()); i > 0; --i) { const internal::TraceInfo& trace = impl_->gtest_trace_stack()[i - 1]; msg << "\n" << internal::FormatFileLocation(trace.file, trace.line) << " " << trace.message; } } if (os_stack_trace.c_str() != NULL && !os_stack_trace.empty()) { msg << internal::kStackTraceMarker << os_stack_trace; } const TestPartResult result = TestPartResult(result_type, file_name, line_number, msg.GetString().c_str()); impl_->GetTestPartResultReporterForCurrentThread()-> ReportTestPartResult(result); if (result_type != TestPartResult::kSuccess) { // gtest_break_on_failure takes precedence over // gtest_throw_on_failure. This allows a user to set the latter // in the code (perhaps in order to use Google Test assertions // with another testing framework) and specify the former on the // command line for debugging. if (GTEST_FLAG(break_on_failure)) { #if GTEST_OS_WINDOWS // Using DebugBreak on Windows allows gtest to still break into a debugger // when a failure happens and both the --gtest_break_on_failure and // the --gtest_catch_exceptions flags are specified. DebugBreak(); #else // Dereference NULL through a volatile pointer to prevent the compiler // from removing. We use this rather than abort() or __builtin_trap() for // portability: Symbian doesn't implement abort() well, and some debuggers // don't correctly trap abort(). *static_cast(NULL) = 1; #endif // GTEST_OS_WINDOWS } else if (GTEST_FLAG(throw_on_failure)) { #if GTEST_HAS_EXCEPTIONS throw GoogleTestFailureException(result); #else // We cannot call abort() as it generates a pop-up in debug mode // that cannot be suppressed in VC 7.1 or below. exit(1); #endif } } } // Creates and adds a property to the current TestResult. If a property matching // the supplied value already exists, updates its value instead. void UnitTest::RecordPropertyForCurrentTest(const char* key, const char* value) { const TestProperty test_property(key, value); impl_->current_test_result()->RecordProperty(test_property); } // Runs all tests in this UnitTest object and prints the result. // Returns 0 if successful, or 1 otherwise. // // We don't protect this under mutex_, as we only support calling it // from the main thread. int UnitTest::Run() { // Captures the value of GTEST_FLAG(catch_exceptions). This value will be // used for the duration of the program. impl()->set_catch_exceptions(GTEST_FLAG(catch_exceptions)); #if GTEST_HAS_SEH const bool in_death_test_child_process = internal::GTEST_FLAG(internal_run_death_test).length() > 0; // Either the user wants Google Test to catch exceptions thrown by the // tests or this is executing in the context of death test child // process. In either case the user does not want to see pop-up dialogs // about crashes - they are expected. if (impl()->catch_exceptions() || in_death_test_child_process) { # if !GTEST_OS_WINDOWS_MOBILE // SetErrorMode doesn't exist on CE. SetErrorMode(SEM_FAILCRITICALERRORS | SEM_NOALIGNMENTFAULTEXCEPT | SEM_NOGPFAULTERRORBOX | SEM_NOOPENFILEERRORBOX); # endif // !GTEST_OS_WINDOWS_MOBILE # if (defined(_MSC_VER) || GTEST_OS_WINDOWS_MINGW) && !GTEST_OS_WINDOWS_MOBILE // Death test children can be terminated with _abort(). On Windows, // _abort() can show a dialog with a warning message. This forces the // abort message to go to stderr instead. _set_error_mode(_OUT_TO_STDERR); # endif # if _MSC_VER >= 1400 && !GTEST_OS_WINDOWS_MOBILE // In the debug version, Visual Studio pops up a separate dialog // offering a choice to debug the aborted program. We need to suppress // this dialog or it will pop up for every EXPECT/ASSERT_DEATH statement // executed. Google Test will notify the user of any unexpected // failure via stderr. // // VC++ doesn't define _set_abort_behavior() prior to the version 8.0. // Users of prior VC versions shall suffer the agony and pain of // clicking through the countless debug dialogs. // TODO(vladl@google.com): find a way to suppress the abort dialog() in the // debug mode when compiled with VC 7.1 or lower. if (!GTEST_FLAG(break_on_failure)) _set_abort_behavior( 0x0, // Clear the following flags: _WRITE_ABORT_MSG | _CALL_REPORTFAULT); // pop-up window, core dump. # endif } #endif // GTEST_HAS_SEH return internal::HandleExceptionsInMethodIfSupported( impl(), &internal::UnitTestImpl::RunAllTests, "auxiliary test code (environments or event listeners)") ? 0 : 1; } // Returns the working directory when the first TEST() or TEST_F() was // executed. const char* UnitTest::original_working_dir() const { return impl_->original_working_dir_.c_str(); } // Returns the TestCase object for the test that's currently running, // or NULL if no test is running. // L < mutex_ const TestCase* UnitTest::current_test_case() const { internal::MutexLock lock(&mutex_); return impl_->current_test_case(); } // Returns the TestInfo object for the test that's currently running, // or NULL if no test is running. // L < mutex_ const TestInfo* UnitTest::current_test_info() const { internal::MutexLock lock(&mutex_); return impl_->current_test_info(); } // Returns the random seed used at the start of the current test run. int UnitTest::random_seed() const { return impl_->random_seed(); } #if GTEST_HAS_PARAM_TEST // Returns ParameterizedTestCaseRegistry object used to keep track of // value-parameterized tests and instantiate and register them. // L < mutex_ internal::ParameterizedTestCaseRegistry& UnitTest::parameterized_test_registry() { return impl_->parameterized_test_registry(); } #endif // GTEST_HAS_PARAM_TEST // Creates an empty UnitTest. UnitTest::UnitTest() { impl_ = new internal::UnitTestImpl(this); } // Destructor of UnitTest. UnitTest::~UnitTest() { delete impl_; } // Pushes a trace defined by SCOPED_TRACE() on to the per-thread // Google Test trace stack. // L < mutex_ void UnitTest::PushGTestTrace(const internal::TraceInfo& trace) { internal::MutexLock lock(&mutex_); impl_->gtest_trace_stack().push_back(trace); } // Pops a trace from the per-thread Google Test trace stack. // L < mutex_ void UnitTest::PopGTestTrace() { internal::MutexLock lock(&mutex_); impl_->gtest_trace_stack().pop_back(); } namespace internal { UnitTestImpl::UnitTestImpl(UnitTest* parent) : parent_(parent), #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4355) // Temporarily disables warning 4355 // (using this in initializer). default_global_test_part_result_reporter_(this), default_per_thread_test_part_result_reporter_(this), # pragma warning(pop) // Restores the warning state again. #else default_global_test_part_result_reporter_(this), default_per_thread_test_part_result_reporter_(this), #endif // _MSC_VER global_test_part_result_repoter_( &default_global_test_part_result_reporter_), per_thread_test_part_result_reporter_( &default_per_thread_test_part_result_reporter_), #if GTEST_HAS_PARAM_TEST parameterized_test_registry_(), parameterized_tests_registered_(false), #endif // GTEST_HAS_PARAM_TEST last_death_test_case_(-1), current_test_case_(NULL), current_test_info_(NULL), ad_hoc_test_result_(), os_stack_trace_getter_(NULL), post_flag_parse_init_performed_(false), random_seed_(0), // Will be overridden by the flag before first use. random_(0), // Will be reseeded before first use. elapsed_time_(0), #if GTEST_HAS_DEATH_TEST internal_run_death_test_flag_(NULL), death_test_factory_(new DefaultDeathTestFactory), #endif // Will be overridden by the flag before first use. catch_exceptions_(false) { listeners()->SetDefaultResultPrinter(new PrettyUnitTestResultPrinter); } UnitTestImpl::~UnitTestImpl() { // Deletes every TestCase. ForEach(test_cases_, internal::Delete); // Deletes every Environment. ForEach(environments_, internal::Delete); delete os_stack_trace_getter_; } #if GTEST_HAS_DEATH_TEST // Disables event forwarding if the control is currently in a death test // subprocess. Must not be called before InitGoogleTest. void UnitTestImpl::SuppressTestEventsIfInSubprocess() { if (internal_run_death_test_flag_.get() != NULL) listeners()->SuppressEventForwarding(); } #endif // GTEST_HAS_DEATH_TEST // Initializes event listeners performing XML output as specified by // UnitTestOptions. Must not be called before InitGoogleTest. void UnitTestImpl::ConfigureXmlOutput() { const String& output_format = UnitTestOptions::GetOutputFormat(); if (output_format == "xml") { listeners()->SetDefaultXmlGenerator(new XmlUnitTestResultPrinter( UnitTestOptions::GetAbsolutePathToOutputFile().c_str())); } else if (output_format != "") { printf("WARNING: unrecognized output format \"%s\" ignored.\n", output_format.c_str()); fflush(stdout); } } #if GTEST_CAN_STREAM_RESULTS_ // Initializes event listeners for streaming test results in String form. // Must not be called before InitGoogleTest. void UnitTestImpl::ConfigureStreamingOutput() { const string& target = GTEST_FLAG(stream_result_to); if (!target.empty()) { const size_t pos = target.find(':'); if (pos != string::npos) { listeners()->Append(new StreamingListener(target.substr(0, pos), target.substr(pos+1))); } else { printf("WARNING: unrecognized streaming target \"%s\" ignored.\n", target.c_str()); fflush(stdout); } } } #endif // GTEST_CAN_STREAM_RESULTS_ // Performs initialization dependent upon flag values obtained in // ParseGoogleTestFlagsOnly. Is called from InitGoogleTest after the call to // ParseGoogleTestFlagsOnly. In case a user neglects to call InitGoogleTest // this function is also called from RunAllTests. Since this function can be // called more than once, it has to be idempotent. void UnitTestImpl::PostFlagParsingInit() { // Ensures that this function does not execute more than once. if (!post_flag_parse_init_performed_) { post_flag_parse_init_performed_ = true; #if GTEST_HAS_DEATH_TEST InitDeathTestSubprocessControlInfo(); SuppressTestEventsIfInSubprocess(); #endif // GTEST_HAS_DEATH_TEST // Registers parameterized tests. This makes parameterized tests // available to the UnitTest reflection API without running // RUN_ALL_TESTS. RegisterParameterizedTests(); // Configures listeners for XML output. This makes it possible for users // to shut down the default XML output before invoking RUN_ALL_TESTS. ConfigureXmlOutput(); #if GTEST_CAN_STREAM_RESULTS_ // Configures listeners for streaming test results to the specified server. ConfigureStreamingOutput(); #endif // GTEST_CAN_STREAM_RESULTS_ } } // A predicate that checks the name of a TestCase against a known // value. // // This is used for implementation of the UnitTest class only. We put // it in the anonymous namespace to prevent polluting the outer // namespace. // // TestCaseNameIs is copyable. class TestCaseNameIs { public: // Constructor. explicit TestCaseNameIs(const String& name) : name_(name) {} // Returns true iff the name of test_case matches name_. bool operator()(const TestCase* test_case) const { return test_case != NULL && strcmp(test_case->name(), name_.c_str()) == 0; } private: String name_; }; // Finds and returns a TestCase with the given name. If one doesn't // exist, creates one and returns it. It's the CALLER'S // RESPONSIBILITY to ensure that this function is only called WHEN THE // TESTS ARE NOT SHUFFLED. // // Arguments: // // test_case_name: name of the test case // type_param: the name of the test case's type parameter, or NULL if // this is not a typed or a type-parameterized test case. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase* UnitTestImpl::GetTestCase(const char* test_case_name, const char* type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc) { // Can we find a TestCase with the given name? const std::vector::const_iterator test_case = std::find_if(test_cases_.begin(), test_cases_.end(), TestCaseNameIs(test_case_name)); if (test_case != test_cases_.end()) return *test_case; // No. Let's create one. TestCase* const new_test_case = new TestCase(test_case_name, type_param, set_up_tc, tear_down_tc); // Is this a death test case? if (internal::UnitTestOptions::MatchesFilter(String(test_case_name), kDeathTestCaseFilter)) { // Yes. Inserts the test case after the last death test case // defined so far. This only works when the test cases haven't // been shuffled. Otherwise we may end up running a death test // after a non-death test. ++last_death_test_case_; test_cases_.insert(test_cases_.begin() + last_death_test_case_, new_test_case); } else { // No. Appends to the end of the list. test_cases_.push_back(new_test_case); } test_case_indices_.push_back(static_cast(test_case_indices_.size())); return new_test_case; } // Helpers for setting up / tearing down the given environment. They // are for use in the ForEach() function. static void SetUpEnvironment(Environment* env) { env->SetUp(); } static void TearDownEnvironment(Environment* env) { env->TearDown(); } // Runs all tests in this UnitTest object, prints the result, and // returns true if all tests are successful. If any exception is // thrown during a test, the test is considered to be failed, but the // rest of the tests will still be run. // // When parameterized tests are enabled, it expands and registers // parameterized tests first in RegisterParameterizedTests(). // All other functions called from RunAllTests() may safely assume that // parameterized tests are ready to be counted and run. bool UnitTestImpl::RunAllTests() { // Makes sure InitGoogleTest() was called. if (!GTestIsInitialized()) { printf("%s", "\nThis test program did NOT call ::testing::InitGoogleTest " "before calling RUN_ALL_TESTS(). Please fix it.\n"); return false; } // Do not run any test if the --help flag was specified. if (g_help_flag) return true; // Repeats the call to the post-flag parsing initialization in case the // user didn't call InitGoogleTest. PostFlagParsingInit(); // Even if sharding is not on, test runners may want to use the // GTEST_SHARD_STATUS_FILE to query whether the test supports the sharding // protocol. internal::WriteToShardStatusFileIfNeeded(); // True iff we are in a subprocess for running a thread-safe-style // death test. bool in_subprocess_for_death_test = false; #if GTEST_HAS_DEATH_TEST in_subprocess_for_death_test = (internal_run_death_test_flag_.get() != NULL); #endif // GTEST_HAS_DEATH_TEST const bool should_shard = ShouldShard(kTestTotalShards, kTestShardIndex, in_subprocess_for_death_test); // Compares the full test names with the filter to decide which // tests to run. const bool has_tests_to_run = FilterTests(should_shard ? HONOR_SHARDING_PROTOCOL : IGNORE_SHARDING_PROTOCOL) > 0; // Lists the tests and exits if the --gtest_list_tests flag was specified. if (GTEST_FLAG(list_tests)) { // This must be called *after* FilterTests() has been called. ListTestsMatchingFilter(); return true; } random_seed_ = GTEST_FLAG(shuffle) ? GetRandomSeedFromFlag(GTEST_FLAG(random_seed)) : 0; // True iff at least one test has failed. bool failed = false; TestEventListener* repeater = listeners()->repeater(); repeater->OnTestProgramStart(*parent_); // How many times to repeat the tests? We don't want to repeat them // when we are inside the subprocess of a death test. const int repeat = in_subprocess_for_death_test ? 1 : GTEST_FLAG(repeat); // Repeats forever if the repeat count is negative. const bool forever = repeat < 0; for (int i = 0; forever || i != repeat; i++) { // We want to preserve failures generated by ad-hoc test // assertions executed before RUN_ALL_TESTS(). ClearNonAdHocTestResult(); const TimeInMillis start = GetTimeInMillis(); // Shuffles test cases and tests if requested. if (has_tests_to_run && GTEST_FLAG(shuffle)) { random()->Reseed(random_seed_); // This should be done before calling OnTestIterationStart(), // such that a test event listener can see the actual test order // in the event. ShuffleTests(); } // Tells the unit test event listeners that the tests are about to start. repeater->OnTestIterationStart(*parent_, i); // Runs each test case if there is at least one test to run. if (has_tests_to_run) { // Sets up all environments beforehand. repeater->OnEnvironmentsSetUpStart(*parent_); ForEach(environments_, SetUpEnvironment); repeater->OnEnvironmentsSetUpEnd(*parent_); // Runs the tests only if there was no fatal failure during global // set-up. if (!Test::HasFatalFailure()) { for (int test_index = 0; test_index < total_test_case_count(); test_index++) { GetMutableTestCase(test_index)->Run(); } } // Tears down all environments in reverse order afterwards. repeater->OnEnvironmentsTearDownStart(*parent_); std::for_each(environments_.rbegin(), environments_.rend(), TearDownEnvironment); repeater->OnEnvironmentsTearDownEnd(*parent_); } elapsed_time_ = GetTimeInMillis() - start; // Tells the unit test event listener that the tests have just finished. repeater->OnTestIterationEnd(*parent_, i); // Gets the result and clears it. if (!Passed()) { failed = true; } // Restores the original test order after the iteration. This // allows the user to quickly repro a failure that happens in the // N-th iteration without repeating the first (N - 1) iterations. // This is not enclosed in "if (GTEST_FLAG(shuffle)) { ... }", in // case the user somehow changes the value of the flag somewhere // (it's always safe to unshuffle the tests). UnshuffleTests(); if (GTEST_FLAG(shuffle)) { // Picks a new random seed for each iteration. random_seed_ = GetNextRandomSeed(random_seed_); } } repeater->OnTestProgramEnd(*parent_); return !failed; } // Reads the GTEST_SHARD_STATUS_FILE environment variable, and creates the file // if the variable is present. If a file already exists at this location, this // function will write over it. If the variable is present, but the file cannot // be created, prints an error and exits. void WriteToShardStatusFileIfNeeded() { const char* const test_shard_file = posix::GetEnv(kTestShardStatusFile); if (test_shard_file != NULL) { FILE* const file = posix::FOpen(test_shard_file, "w"); if (file == NULL) { ColoredPrintf(COLOR_RED, "Could not write to the test shard status file \"%s\" " "specified by the %s environment variable.\n", test_shard_file, kTestShardStatusFile); fflush(stdout); exit(EXIT_FAILURE); } fclose(file); } } // Checks whether sharding is enabled by examining the relevant // environment variable values. If the variables are present, // but inconsistent (i.e., shard_index >= total_shards), prints // an error and exits. If in_subprocess_for_death_test, sharding is // disabled because it must only be applied to the original test // process. Otherwise, we could filter out death tests we intended to execute. bool ShouldShard(const char* total_shards_env, const char* shard_index_env, bool in_subprocess_for_death_test) { if (in_subprocess_for_death_test) { return false; } const Int32 total_shards = Int32FromEnvOrDie(total_shards_env, -1); const Int32 shard_index = Int32FromEnvOrDie(shard_index_env, -1); if (total_shards == -1 && shard_index == -1) { return false; } else if (total_shards == -1 && shard_index != -1) { const Message msg = Message() << "Invalid environment variables: you have " << kTestShardIndex << " = " << shard_index << ", but have left " << kTestTotalShards << " unset.\n"; ColoredPrintf(COLOR_RED, msg.GetString().c_str()); fflush(stdout); exit(EXIT_FAILURE); } else if (total_shards != -1 && shard_index == -1) { const Message msg = Message() << "Invalid environment variables: you have " << kTestTotalShards << " = " << total_shards << ", but have left " << kTestShardIndex << " unset.\n"; ColoredPrintf(COLOR_RED, msg.GetString().c_str()); fflush(stdout); exit(EXIT_FAILURE); } else if (shard_index < 0 || shard_index >= total_shards) { const Message msg = Message() << "Invalid environment variables: we require 0 <= " << kTestShardIndex << " < " << kTestTotalShards << ", but you have " << kTestShardIndex << "=" << shard_index << ", " << kTestTotalShards << "=" << total_shards << ".\n"; ColoredPrintf(COLOR_RED, msg.GetString().c_str()); fflush(stdout); exit(EXIT_FAILURE); } return total_shards > 1; } // Parses the environment variable var as an Int32. If it is unset, // returns default_val. If it is not an Int32, prints an error // and aborts. Int32 Int32FromEnvOrDie(const char* var, Int32 default_val) { const char* str_val = posix::GetEnv(var); if (str_val == NULL) { return default_val; } Int32 result; if (!ParseInt32(Message() << "The value of environment variable " << var, str_val, &result)) { exit(EXIT_FAILURE); } return result; } // Given the total number of shards, the shard index, and the test id, // returns true iff the test should be run on this shard. The test id is // some arbitrary but unique non-negative integer assigned to each test // method. Assumes that 0 <= shard_index < total_shards. bool ShouldRunTestOnShard(int total_shards, int shard_index, int test_id) { return (test_id % total_shards) == shard_index; } // Compares the name of each test with the user-specified filter to // decide whether the test should be run, then records the result in // each TestCase and TestInfo object. // If shard_tests == true, further filters tests based on sharding // variables in the environment - see // http://code.google.com/p/googletest/wiki/GoogleTestAdvancedGuide. // Returns the number of tests that should run. int UnitTestImpl::FilterTests(ReactionToSharding shard_tests) { const Int32 total_shards = shard_tests == HONOR_SHARDING_PROTOCOL ? Int32FromEnvOrDie(kTestTotalShards, -1) : -1; const Int32 shard_index = shard_tests == HONOR_SHARDING_PROTOCOL ? Int32FromEnvOrDie(kTestShardIndex, -1) : -1; // num_runnable_tests are the number of tests that will // run across all shards (i.e., match filter and are not disabled). // num_selected_tests are the number of tests to be run on // this shard. int num_runnable_tests = 0; int num_selected_tests = 0; for (size_t i = 0; i < test_cases_.size(); i++) { TestCase* const test_case = test_cases_[i]; const String &test_case_name = test_case->name(); test_case->set_should_run(false); for (size_t j = 0; j < test_case->test_info_list().size(); j++) { TestInfo* const test_info = test_case->test_info_list()[j]; const String test_name(test_info->name()); // A test is disabled if test case name or test name matches // kDisableTestFilter. const bool is_disabled = internal::UnitTestOptions::MatchesFilter(test_case_name, kDisableTestFilter) || internal::UnitTestOptions::MatchesFilter(test_name, kDisableTestFilter); test_info->is_disabled_ = is_disabled; const bool matches_filter = internal::UnitTestOptions::FilterMatchesTest(test_case_name, test_name); test_info->matches_filter_ = matches_filter; const bool is_runnable = (GTEST_FLAG(also_run_disabled_tests) || !is_disabled) && matches_filter; const bool is_selected = is_runnable && (shard_tests == IGNORE_SHARDING_PROTOCOL || ShouldRunTestOnShard(total_shards, shard_index, num_runnable_tests)); num_runnable_tests += is_runnable; num_selected_tests += is_selected; test_info->should_run_ = is_selected; test_case->set_should_run(test_case->should_run() || is_selected); } } return num_selected_tests; } // Prints the names of the tests matching the user-specified filter flag. void UnitTestImpl::ListTestsMatchingFilter() { for (size_t i = 0; i < test_cases_.size(); i++) { const TestCase* const test_case = test_cases_[i]; bool printed_test_case_name = false; for (size_t j = 0; j < test_case->test_info_list().size(); j++) { const TestInfo* const test_info = test_case->test_info_list()[j]; if (test_info->matches_filter_) { if (!printed_test_case_name) { printed_test_case_name = true; printf("%s.\n", test_case->name()); } printf(" %s\n", test_info->name()); } } } fflush(stdout); } // Sets the OS stack trace getter. // // Does nothing if the input and the current OS stack trace getter are // the same; otherwise, deletes the old getter and makes the input the // current getter. void UnitTestImpl::set_os_stack_trace_getter( OsStackTraceGetterInterface* getter) { if (os_stack_trace_getter_ != getter) { delete os_stack_trace_getter_; os_stack_trace_getter_ = getter; } } // Returns the current OS stack trace getter if it is not NULL; // otherwise, creates an OsStackTraceGetter, makes it the current // getter, and returns it. OsStackTraceGetterInterface* UnitTestImpl::os_stack_trace_getter() { if (os_stack_trace_getter_ == NULL) { os_stack_trace_getter_ = new OsStackTraceGetter; } return os_stack_trace_getter_; } // Returns the TestResult for the test that's currently running, or // the TestResult for the ad hoc test if no test is running. TestResult* UnitTestImpl::current_test_result() { return current_test_info_ ? &(current_test_info_->result_) : &ad_hoc_test_result_; } // Shuffles all test cases, and the tests within each test case, // making sure that death tests are still run first. void UnitTestImpl::ShuffleTests() { // Shuffles the death test cases. ShuffleRange(random(), 0, last_death_test_case_ + 1, &test_case_indices_); // Shuffles the non-death test cases. ShuffleRange(random(), last_death_test_case_ + 1, static_cast(test_cases_.size()), &test_case_indices_); // Shuffles the tests inside each test case. for (size_t i = 0; i < test_cases_.size(); i++) { test_cases_[i]->ShuffleTests(random()); } } // Restores the test cases and tests to their order before the first shuffle. void UnitTestImpl::UnshuffleTests() { for (size_t i = 0; i < test_cases_.size(); i++) { // Unshuffles the tests in each test case. test_cases_[i]->UnshuffleTests(); // Resets the index of each test case. test_case_indices_[i] = static_cast(i); } } // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // GetCurrentOsStackTraceExceptTop(..., 1), Foo() will be included in // the trace but Bar() and GetCurrentOsStackTraceExceptTop() won't. String GetCurrentOsStackTraceExceptTop(UnitTest* /*unit_test*/, int skip_count) { // We pass skip_count + 1 to skip this wrapper function in addition // to what the user really wants to skip. return GetUnitTestImpl()->CurrentOsStackTraceExceptTop(skip_count + 1); } // Used by the GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_ macro to // suppress unreachable code warnings. namespace { class ClassUniqueToAlwaysTrue {}; } bool IsTrue(bool condition) { return condition; } bool AlwaysTrue() { #if GTEST_HAS_EXCEPTIONS // This condition is always false so AlwaysTrue() never actually throws, // but it makes the compiler think that it may throw. if (IsTrue(false)) throw ClassUniqueToAlwaysTrue(); #endif // GTEST_HAS_EXCEPTIONS return true; } // If *pstr starts with the given prefix, modifies *pstr to be right // past the prefix and returns true; otherwise leaves *pstr unchanged // and returns false. None of pstr, *pstr, and prefix can be NULL. bool SkipPrefix(const char* prefix, const char** pstr) { const size_t prefix_len = strlen(prefix); if (strncmp(*pstr, prefix, prefix_len) == 0) { *pstr += prefix_len; return true; } return false; } // Parses a string as a command line flag. The string should have // the format "--flag=value". When def_optional is true, the "=value" // part can be omitted. // // Returns the value of the flag, or NULL if the parsing failed. const char* ParseFlagValue(const char* str, const char* flag, bool def_optional) { // str and flag must not be NULL. if (str == NULL || flag == NULL) return NULL; // The flag must start with "--" followed by GTEST_FLAG_PREFIX_. const String flag_str = String::Format("--%s%s", GTEST_FLAG_PREFIX_, flag); const size_t flag_len = flag_str.length(); if (strncmp(str, flag_str.c_str(), flag_len) != 0) return NULL; // Skips the flag name. const char* flag_end = str + flag_len; // When def_optional is true, it's OK to not have a "=value" part. if (def_optional && (flag_end[0] == '\0')) { return flag_end; } // If def_optional is true and there are more characters after the // flag name, or if def_optional is false, there must be a '=' after // the flag name. if (flag_end[0] != '=') return NULL; // Returns the string after "=". return flag_end + 1; } // Parses a string for a bool flag, in the form of either // "--flag=value" or "--flag". // // In the former case, the value is taken as true as long as it does // not start with '0', 'f', or 'F'. // // In the latter case, the value is taken as true. // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. bool ParseBoolFlag(const char* str, const char* flag, bool* value) { // Gets the value of the flag as a string. const char* const value_str = ParseFlagValue(str, flag, true); // Aborts if the parsing failed. if (value_str == NULL) return false; // Converts the string value to a bool. *value = !(*value_str == '0' || *value_str == 'f' || *value_str == 'F'); return true; } // Parses a string for an Int32 flag, in the form of // "--flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. bool ParseInt32Flag(const char* str, const char* flag, Int32* value) { // Gets the value of the flag as a string. const char* const value_str = ParseFlagValue(str, flag, false); // Aborts if the parsing failed. if (value_str == NULL) return false; // Sets *value to the value of the flag. return ParseInt32(Message() << "The value of flag --" << flag, value_str, value); } // Parses a string for a string flag, in the form of // "--flag=value". // // On success, stores the value of the flag in *value, and returns // true. On failure, returns false without changing *value. bool ParseStringFlag(const char* str, const char* flag, String* value) { // Gets the value of the flag as a string. const char* const value_str = ParseFlagValue(str, flag, false); // Aborts if the parsing failed. if (value_str == NULL) return false; // Sets *value to the value of the flag. *value = value_str; return true; } // Determines whether a string has a prefix that Google Test uses for its // flags, i.e., starts with GTEST_FLAG_PREFIX_ or GTEST_FLAG_PREFIX_DASH_. // If Google Test detects that a command line flag has its prefix but is not // recognized, it will print its help message. Flags starting with // GTEST_INTERNAL_PREFIX_ followed by "internal_" are considered Google Test // internal flags and do not trigger the help message. static bool HasGoogleTestFlagPrefix(const char* str) { return (SkipPrefix("--", &str) || SkipPrefix("-", &str) || SkipPrefix("/", &str)) && !SkipPrefix(GTEST_FLAG_PREFIX_ "internal_", &str) && (SkipPrefix(GTEST_FLAG_PREFIX_, &str) || SkipPrefix(GTEST_FLAG_PREFIX_DASH_, &str)); } // Prints a string containing code-encoded text. The following escape // sequences can be used in the string to control the text color: // // @@ prints a single '@' character. // @R changes the color to red. // @G changes the color to green. // @Y changes the color to yellow. // @D changes to the default terminal text color. // // TODO(wan@google.com): Write tests for this once we add stdout // capturing to Google Test. static void PrintColorEncoded(const char* str) { GTestColor color = COLOR_DEFAULT; // The current color. // Conceptually, we split the string into segments divided by escape // sequences. Then we print one segment at a time. At the end of // each iteration, the str pointer advances to the beginning of the // next segment. for (;;) { const char* p = strchr(str, '@'); if (p == NULL) { ColoredPrintf(color, "%s", str); return; } ColoredPrintf(color, "%s", String(str, p - str).c_str()); const char ch = p[1]; str = p + 2; if (ch == '@') { ColoredPrintf(color, "@"); } else if (ch == 'D') { color = COLOR_DEFAULT; } else if (ch == 'R') { color = COLOR_RED; } else if (ch == 'G') { color = COLOR_GREEN; } else if (ch == 'Y') { color = COLOR_YELLOW; } else { --str; } } } static const char kColorEncodedHelpMessage[] = "This program contains tests written using " GTEST_NAME_ ". You can use the\n" "following command line flags to control its behavior:\n" "\n" "Test Selection:\n" " @G--" GTEST_FLAG_PREFIX_ "list_tests@D\n" " List the names of all tests instead of running them. The name of\n" " TEST(Foo, Bar) is \"Foo.Bar\".\n" " @G--" GTEST_FLAG_PREFIX_ "filter=@YPOSTIVE_PATTERNS" "[@G-@YNEGATIVE_PATTERNS]@D\n" " Run only the tests whose name matches one of the positive patterns but\n" " none of the negative patterns. '?' matches any single character; '*'\n" " matches any substring; ':' separates two patterns.\n" " @G--" GTEST_FLAG_PREFIX_ "also_run_disabled_tests@D\n" " Run all disabled tests too.\n" "\n" "Test Execution:\n" " @G--" GTEST_FLAG_PREFIX_ "repeat=@Y[COUNT]@D\n" " Run the tests repeatedly; use a negative count to repeat forever.\n" " @G--" GTEST_FLAG_PREFIX_ "shuffle@D\n" " Randomize tests' orders on every iteration.\n" " @G--" GTEST_FLAG_PREFIX_ "random_seed=@Y[NUMBER]@D\n" " Random number seed to use for shuffling test orders (between 1 and\n" " 99999, or 0 to use a seed based on the current time).\n" "\n" "Test Output:\n" " @G--" GTEST_FLAG_PREFIX_ "color=@Y(@Gyes@Y|@Gno@Y|@Gauto@Y)@D\n" " Enable/disable colored output. The default is @Gauto@D.\n" " -@G-" GTEST_FLAG_PREFIX_ "print_time=0@D\n" " Don't print the elapsed time of each test.\n" " @G--" GTEST_FLAG_PREFIX_ "output=xml@Y[@G:@YDIRECTORY_PATH@G" GTEST_PATH_SEP_ "@Y|@G:@YFILE_PATH]@D\n" " Generate an XML report in the given directory or with the given file\n" " name. @YFILE_PATH@D defaults to @Gtest_details.xml@D.\n" #if GTEST_CAN_STREAM_RESULTS_ " @G--" GTEST_FLAG_PREFIX_ "stream_result_to=@YHOST@G:@YPORT@D\n" " Stream test results to the given server.\n" #endif // GTEST_CAN_STREAM_RESULTS_ "\n" "Assertion Behavior:\n" #if GTEST_HAS_DEATH_TEST && !GTEST_OS_WINDOWS " @G--" GTEST_FLAG_PREFIX_ "death_test_style=@Y(@Gfast@Y|@Gthreadsafe@Y)@D\n" " Set the default death test style.\n" #endif // GTEST_HAS_DEATH_TEST && !GTEST_OS_WINDOWS " @G--" GTEST_FLAG_PREFIX_ "break_on_failure@D\n" " Turn assertion failures into debugger break-points.\n" " @G--" GTEST_FLAG_PREFIX_ "throw_on_failure@D\n" " Turn assertion failures into C++ exceptions.\n" " @G--" GTEST_FLAG_PREFIX_ "catch_exceptions=0@D\n" " Do not report exceptions as test failures. Instead, allow them\n" " to crash the program or throw a pop-up (on Windows).\n" "\n" "Except for @G--" GTEST_FLAG_PREFIX_ "list_tests@D, you can alternatively set " "the corresponding\n" "environment variable of a flag (all letters in upper-case). For example, to\n" "disable colored text output, you can either specify @G--" GTEST_FLAG_PREFIX_ "color=no@D or set\n" "the @G" GTEST_FLAG_PREFIX_UPPER_ "COLOR@D environment variable to @Gno@D.\n" "\n" "For more information, please read the " GTEST_NAME_ " documentation at\n" "@G" GTEST_PROJECT_URL_ "@D. If you find a bug in " GTEST_NAME_ "\n" "(not one in your own code or tests), please report it to\n" "@G<" GTEST_DEV_EMAIL_ ">@D.\n"; // Parses the command line for Google Test flags, without initializing // other parts of Google Test. The type parameter CharType can be // instantiated to either char or wchar_t. template void ParseGoogleTestFlagsOnlyImpl(int* argc, CharType** argv) { for (int i = 1; i < *argc; i++) { const String arg_string = StreamableToString(argv[i]); const char* const arg = arg_string.c_str(); using internal::ParseBoolFlag; using internal::ParseInt32Flag; using internal::ParseStringFlag; // Do we see a Google Test flag? if (ParseBoolFlag(arg, kAlsoRunDisabledTestsFlag, >EST_FLAG(also_run_disabled_tests)) || ParseBoolFlag(arg, kBreakOnFailureFlag, >EST_FLAG(break_on_failure)) || ParseBoolFlag(arg, kCatchExceptionsFlag, >EST_FLAG(catch_exceptions)) || ParseStringFlag(arg, kColorFlag, >EST_FLAG(color)) || ParseStringFlag(arg, kDeathTestStyleFlag, >EST_FLAG(death_test_style)) || ParseBoolFlag(arg, kDeathTestUseFork, >EST_FLAG(death_test_use_fork)) || ParseStringFlag(arg, kFilterFlag, >EST_FLAG(filter)) || ParseStringFlag(arg, kInternalRunDeathTestFlag, >EST_FLAG(internal_run_death_test)) || ParseBoolFlag(arg, kListTestsFlag, >EST_FLAG(list_tests)) || ParseStringFlag(arg, kOutputFlag, >EST_FLAG(output)) || ParseBoolFlag(arg, kPrintTimeFlag, >EST_FLAG(print_time)) || ParseInt32Flag(arg, kRandomSeedFlag, >EST_FLAG(random_seed)) || ParseInt32Flag(arg, kRepeatFlag, >EST_FLAG(repeat)) || ParseBoolFlag(arg, kShuffleFlag, >EST_FLAG(shuffle)) || ParseInt32Flag(arg, kStackTraceDepthFlag, >EST_FLAG(stack_trace_depth)) || ParseStringFlag(arg, kStreamResultToFlag, >EST_FLAG(stream_result_to)) || ParseBoolFlag(arg, kThrowOnFailureFlag, >EST_FLAG(throw_on_failure)) ) { // Yes. Shift the remainder of the argv list left by one. Note // that argv has (*argc + 1) elements, the last one always being // NULL. The following loop moves the trailing NULL element as // well. for (int j = i; j != *argc; j++) { argv[j] = argv[j + 1]; } // Decrements the argument count. (*argc)--; // We also need to decrement the iterator as we just removed // an element. i--; } else if (arg_string == "--help" || arg_string == "-h" || arg_string == "-?" || arg_string == "/?" || HasGoogleTestFlagPrefix(arg)) { // Both help flag and unrecognized Google Test flags (excluding // internal ones) trigger help display. g_help_flag = true; } } if (g_help_flag) { // We print the help here instead of in RUN_ALL_TESTS(), as the // latter may not be called at all if the user is using Google // Test with another testing framework. PrintColorEncoded(kColorEncodedHelpMessage); } } // Parses the command line for Google Test flags, without initializing // other parts of Google Test. void ParseGoogleTestFlagsOnly(int* argc, char** argv) { ParseGoogleTestFlagsOnlyImpl(argc, argv); } void ParseGoogleTestFlagsOnly(int* argc, wchar_t** argv) { ParseGoogleTestFlagsOnlyImpl(argc, argv); } // The internal implementation of InitGoogleTest(). // // The type parameter CharType can be instantiated to either char or // wchar_t. template void InitGoogleTestImpl(int* argc, CharType** argv) { g_init_gtest_count++; // We don't want to run the initialization code twice. if (g_init_gtest_count != 1) return; if (*argc <= 0) return; internal::g_executable_path = internal::StreamableToString(argv[0]); #if GTEST_HAS_DEATH_TEST g_argvs.clear(); for (int i = 0; i != *argc; i++) { g_argvs.push_back(StreamableToString(argv[i])); } #endif // GTEST_HAS_DEATH_TEST ParseGoogleTestFlagsOnly(argc, argv); GetUnitTestImpl()->PostFlagParsingInit(); } } // namespace internal // Initializes Google Test. This must be called before calling // RUN_ALL_TESTS(). In particular, it parses a command line for the // flags that Google Test recognizes. Whenever a Google Test flag is // seen, it is removed from argv, and *argc is decremented. // // No value is returned. Instead, the Google Test flag variables are // updated. // // Calling the function for the second time has no user-visible effect. void InitGoogleTest(int* argc, char** argv) { internal::InitGoogleTestImpl(argc, argv); } // This overloaded version can be used in Windows programs compiled in // UNICODE mode. void InitGoogleTest(int* argc, wchar_t** argv) { internal::InitGoogleTestImpl(argc, argv); } } // namespace testing // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan), vladl@google.com (Vlad Losev) // // This file implements death tests. #if GTEST_HAS_DEATH_TEST # if GTEST_OS_MAC # include # endif // GTEST_OS_MAC # include # include # include # include # if GTEST_OS_WINDOWS # include # else # include # include # endif // GTEST_OS_WINDOWS #endif // GTEST_HAS_DEATH_TEST // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #undef GTEST_IMPLEMENTATION_ namespace testing { // Constants. // The default death test style. static const char kDefaultDeathTestStyle[] = "fast"; GTEST_DEFINE_string_( death_test_style, internal::StringFromGTestEnv("death_test_style", kDefaultDeathTestStyle), "Indicates how to run a death test in a forked child process: " "\"threadsafe\" (child process re-executes the test binary " "from the beginning, running only the specific death test) or " "\"fast\" (child process runs the death test immediately " "after forking)."); GTEST_DEFINE_bool_( death_test_use_fork, internal::BoolFromGTestEnv("death_test_use_fork", false), "Instructs to use fork()/_exit() instead of clone() in death tests. " "Ignored and always uses fork() on POSIX systems where clone() is not " "implemented. Useful when running under valgrind or similar tools if " "those do not support clone(). Valgrind 3.3.1 will just fail if " "it sees an unsupported combination of clone() flags. " "It is not recommended to use this flag w/o valgrind though it will " "work in 99% of the cases. Once valgrind is fixed, this flag will " "most likely be removed."); namespace internal { GTEST_DEFINE_string_( internal_run_death_test, "", "Indicates the file, line number, temporal index of " "the single death test to run, and a file descriptor to " "which a success code may be sent, all separated by " "colons. This flag is specified if and only if the current " "process is a sub-process launched for running a thread-safe " "death test. FOR INTERNAL USE ONLY."); } // namespace internal #if GTEST_HAS_DEATH_TEST // ExitedWithCode constructor. ExitedWithCode::ExitedWithCode(int exit_code) : exit_code_(exit_code) { } // ExitedWithCode function-call operator. bool ExitedWithCode::operator()(int exit_status) const { # if GTEST_OS_WINDOWS return exit_status == exit_code_; # else return WIFEXITED(exit_status) && WEXITSTATUS(exit_status) == exit_code_; # endif // GTEST_OS_WINDOWS } # if !GTEST_OS_WINDOWS // KilledBySignal constructor. KilledBySignal::KilledBySignal(int signum) : signum_(signum) { } // KilledBySignal function-call operator. bool KilledBySignal::operator()(int exit_status) const { return WIFSIGNALED(exit_status) && WTERMSIG(exit_status) == signum_; } # endif // !GTEST_OS_WINDOWS namespace internal { // Utilities needed for death tests. // Generates a textual description of a given exit code, in the format // specified by wait(2). static String ExitSummary(int exit_code) { Message m; # if GTEST_OS_WINDOWS m << "Exited with exit status " << exit_code; # else if (WIFEXITED(exit_code)) { m << "Exited with exit status " << WEXITSTATUS(exit_code); } else if (WIFSIGNALED(exit_code)) { m << "Terminated by signal " << WTERMSIG(exit_code); } # ifdef WCOREDUMP if (WCOREDUMP(exit_code)) { m << " (core dumped)"; } # endif # endif // GTEST_OS_WINDOWS return m.GetString(); } // Returns true if exit_status describes a process that was terminated // by a signal, or exited normally with a nonzero exit code. bool ExitedUnsuccessfully(int exit_status) { return !ExitedWithCode(0)(exit_status); } # if !GTEST_OS_WINDOWS // Generates a textual failure message when a death test finds more than // one thread running, or cannot determine the number of threads, prior // to executing the given statement. It is the responsibility of the // caller not to pass a thread_count of 1. static String DeathTestThreadWarning(size_t thread_count) { Message msg; msg << "Death tests use fork(), which is unsafe particularly" << " in a threaded context. For this test, " << GTEST_NAME_ << " "; if (thread_count == 0) msg << "couldn't detect the number of threads."; else msg << "detected " << thread_count << " threads."; return msg.GetString(); } # endif // !GTEST_OS_WINDOWS // Flag characters for reporting a death test that did not die. static const char kDeathTestLived = 'L'; static const char kDeathTestReturned = 'R'; static const char kDeathTestThrew = 'T'; static const char kDeathTestInternalError = 'I'; // An enumeration describing all of the possible ways that a death test can // conclude. DIED means that the process died while executing the test // code; LIVED means that process lived beyond the end of the test code; // RETURNED means that the test statement attempted to execute a return // statement, which is not allowed; THREW means that the test statement // returned control by throwing an exception. IN_PROGRESS means the test // has not yet concluded. // TODO(vladl@google.com): Unify names and possibly values for // AbortReason, DeathTestOutcome, and flag characters above. enum DeathTestOutcome { IN_PROGRESS, DIED, LIVED, RETURNED, THREW }; // Routine for aborting the program which is safe to call from an // exec-style death test child process, in which case the error // message is propagated back to the parent process. Otherwise, the // message is simply printed to stderr. In either case, the program // then exits with status 1. void DeathTestAbort(const String& message) { // On a POSIX system, this function may be called from a threadsafe-style // death test child process, which operates on a very small stack. Use // the heap for any additional non-minuscule memory requirements. const InternalRunDeathTestFlag* const flag = GetUnitTestImpl()->internal_run_death_test_flag(); if (flag != NULL) { FILE* parent = posix::FDOpen(flag->write_fd(), "w"); fputc(kDeathTestInternalError, parent); fprintf(parent, "%s", message.c_str()); fflush(parent); _exit(1); } else { fprintf(stderr, "%s", message.c_str()); fflush(stderr); posix::Abort(); } } // A replacement for CHECK that calls DeathTestAbort if the assertion // fails. # define GTEST_DEATH_TEST_CHECK_(expression) \ do { \ if (!::testing::internal::IsTrue(expression)) { \ DeathTestAbort(::testing::internal::String::Format( \ "CHECK failed: File %s, line %d: %s", \ __FILE__, __LINE__, #expression)); \ } \ } while (::testing::internal::AlwaysFalse()) // This macro is similar to GTEST_DEATH_TEST_CHECK_, but it is meant for // evaluating any system call that fulfills two conditions: it must return // -1 on failure, and set errno to EINTR when it is interrupted and // should be tried again. The macro expands to a loop that repeatedly // evaluates the expression as long as it evaluates to -1 and sets // errno to EINTR. If the expression evaluates to -1 but errno is // something other than EINTR, DeathTestAbort is called. # define GTEST_DEATH_TEST_CHECK_SYSCALL_(expression) \ do { \ int gtest_retval; \ do { \ gtest_retval = (expression); \ } while (gtest_retval == -1 && errno == EINTR); \ if (gtest_retval == -1) { \ DeathTestAbort(::testing::internal::String::Format( \ "CHECK failed: File %s, line %d: %s != -1", \ __FILE__, __LINE__, #expression)); \ } \ } while (::testing::internal::AlwaysFalse()) // Returns the message describing the last system error in errno. String GetLastErrnoDescription() { return String(errno == 0 ? "" : posix::StrError(errno)); } // This is called from a death test parent process to read a failure // message from the death test child process and log it with the FATAL // severity. On Windows, the message is read from a pipe handle. On other // platforms, it is read from a file descriptor. static void FailFromInternalError(int fd) { Message error; char buffer[256]; int num_read; do { while ((num_read = posix::Read(fd, buffer, 255)) > 0) { buffer[num_read] = '\0'; error << buffer; } } while (num_read == -1 && errno == EINTR); if (num_read == 0) { GTEST_LOG_(FATAL) << error.GetString(); } else { const int last_error = errno; GTEST_LOG_(FATAL) << "Error while reading death test internal: " << GetLastErrnoDescription() << " [" << last_error << "]"; } } // Death test constructor. Increments the running death test count // for the current test. DeathTest::DeathTest() { TestInfo* const info = GetUnitTestImpl()->current_test_info(); if (info == NULL) { DeathTestAbort("Cannot run a death test outside of a TEST or " "TEST_F construct"); } } // Creates and returns a death test by dispatching to the current // death test factory. bool DeathTest::Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test) { return GetUnitTestImpl()->death_test_factory()->Create( statement, regex, file, line, test); } const char* DeathTest::LastMessage() { return last_death_test_message_.c_str(); } void DeathTest::set_last_death_test_message(const String& message) { last_death_test_message_ = message; } String DeathTest::last_death_test_message_; // Provides cross platform implementation for some death functionality. class DeathTestImpl : public DeathTest { protected: DeathTestImpl(const char* a_statement, const RE* a_regex) : statement_(a_statement), regex_(a_regex), spawned_(false), status_(-1), outcome_(IN_PROGRESS), read_fd_(-1), write_fd_(-1) {} // read_fd_ is expected to be closed and cleared by a derived class. ~DeathTestImpl() { GTEST_DEATH_TEST_CHECK_(read_fd_ == -1); } void Abort(AbortReason reason); virtual bool Passed(bool status_ok); const char* statement() const { return statement_; } const RE* regex() const { return regex_; } bool spawned() const { return spawned_; } void set_spawned(bool is_spawned) { spawned_ = is_spawned; } int status() const { return status_; } void set_status(int a_status) { status_ = a_status; } DeathTestOutcome outcome() const { return outcome_; } void set_outcome(DeathTestOutcome an_outcome) { outcome_ = an_outcome; } int read_fd() const { return read_fd_; } void set_read_fd(int fd) { read_fd_ = fd; } int write_fd() const { return write_fd_; } void set_write_fd(int fd) { write_fd_ = fd; } // Called in the parent process only. Reads the result code of the death // test child process via a pipe, interprets it to set the outcome_ // member, and closes read_fd_. Outputs diagnostics and terminates in // case of unexpected codes. void ReadAndInterpretStatusByte(); private: // The textual content of the code this object is testing. This class // doesn't own this string and should not attempt to delete it. const char* const statement_; // The regular expression which test output must match. DeathTestImpl // doesn't own this object and should not attempt to delete it. const RE* const regex_; // True if the death test child process has been successfully spawned. bool spawned_; // The exit status of the child process. int status_; // How the death test concluded. DeathTestOutcome outcome_; // Descriptor to the read end of the pipe to the child process. It is // always -1 in the child process. The child keeps its write end of the // pipe in write_fd_. int read_fd_; // Descriptor to the child's write end of the pipe to the parent process. // It is always -1 in the parent process. The parent keeps its end of the // pipe in read_fd_. int write_fd_; }; // Called in the parent process only. Reads the result code of the death // test child process via a pipe, interprets it to set the outcome_ // member, and closes read_fd_. Outputs diagnostics and terminates in // case of unexpected codes. void DeathTestImpl::ReadAndInterpretStatusByte() { char flag; int bytes_read; // The read() here blocks until data is available (signifying the // failure of the death test) or until the pipe is closed (signifying // its success), so it's okay to call this in the parent before // the child process has exited. do { bytes_read = posix::Read(read_fd(), &flag, 1); } while (bytes_read == -1 && errno == EINTR); if (bytes_read == 0) { set_outcome(DIED); } else if (bytes_read == 1) { switch (flag) { case kDeathTestReturned: set_outcome(RETURNED); break; case kDeathTestThrew: set_outcome(THREW); break; case kDeathTestLived: set_outcome(LIVED); break; case kDeathTestInternalError: FailFromInternalError(read_fd()); // Does not return. break; default: GTEST_LOG_(FATAL) << "Death test child process reported " << "unexpected status byte (" << static_cast(flag) << ")"; } } else { GTEST_LOG_(FATAL) << "Read from death test child process failed: " << GetLastErrnoDescription(); } GTEST_DEATH_TEST_CHECK_SYSCALL_(posix::Close(read_fd())); set_read_fd(-1); } // Signals that the death test code which should have exited, didn't. // Should be called only in a death test child process. // Writes a status byte to the child's status file descriptor, then // calls _exit(1). void DeathTestImpl::Abort(AbortReason reason) { // The parent process considers the death test to be a failure if // it finds any data in our pipe. So, here we write a single flag byte // to the pipe, then exit. const char status_ch = reason == TEST_DID_NOT_DIE ? kDeathTestLived : reason == TEST_THREW_EXCEPTION ? kDeathTestThrew : kDeathTestReturned; GTEST_DEATH_TEST_CHECK_SYSCALL_(posix::Write(write_fd(), &status_ch, 1)); // We are leaking the descriptor here because on some platforms (i.e., // when built as Windows DLL), destructors of global objects will still // run after calling _exit(). On such systems, write_fd_ will be // indirectly closed from the destructor of UnitTestImpl, causing double // close if it is also closed here. On debug configurations, double close // may assert. As there are no in-process buffers to flush here, we are // relying on the OS to close the descriptor after the process terminates // when the destructors are not run. _exit(1); // Exits w/o any normal exit hooks (we were supposed to crash) } // Returns an indented copy of stderr output for a death test. // This makes distinguishing death test output lines from regular log lines // much easier. static ::std::string FormatDeathTestOutput(const ::std::string& output) { ::std::string ret; for (size_t at = 0; ; ) { const size_t line_end = output.find('\n', at); ret += "[ DEATH ] "; if (line_end == ::std::string::npos) { ret += output.substr(at); break; } ret += output.substr(at, line_end + 1 - at); at = line_end + 1; } return ret; } // Assesses the success or failure of a death test, using both private // members which have previously been set, and one argument: // // Private data members: // outcome: An enumeration describing how the death test // concluded: DIED, LIVED, THREW, or RETURNED. The death test // fails in the latter three cases. // status: The exit status of the child process. On *nix, it is in the // in the format specified by wait(2). On Windows, this is the // value supplied to the ExitProcess() API or a numeric code // of the exception that terminated the program. // regex: A regular expression object to be applied to // the test's captured standard error output; the death test // fails if it does not match. // // Argument: // status_ok: true if exit_status is acceptable in the context of // this particular death test, which fails if it is false // // Returns true iff all of the above conditions are met. Otherwise, the // first failing condition, in the order given above, is the one that is // reported. Also sets the last death test message string. bool DeathTestImpl::Passed(bool status_ok) { if (!spawned()) return false; const String error_message = GetCapturedStderr(); bool success = false; Message buffer; buffer << "Death test: " << statement() << "\n"; switch (outcome()) { case LIVED: buffer << " Result: failed to die.\n" << " Error msg:\n" << FormatDeathTestOutput(error_message); break; case THREW: buffer << " Result: threw an exception.\n" << " Error msg:\n" << FormatDeathTestOutput(error_message); break; case RETURNED: buffer << " Result: illegal return in test statement.\n" << " Error msg:\n" << FormatDeathTestOutput(error_message); break; case DIED: if (status_ok) { const bool matched = RE::PartialMatch(error_message.c_str(), *regex()); if (matched) { success = true; } else { buffer << " Result: died but not with expected error.\n" << " Expected: " << regex()->pattern() << "\n" << "Actual msg:\n" << FormatDeathTestOutput(error_message); } } else { buffer << " Result: died but not with expected exit code:\n" << " " << ExitSummary(status()) << "\n" << "Actual msg:\n" << FormatDeathTestOutput(error_message); } break; case IN_PROGRESS: default: GTEST_LOG_(FATAL) << "DeathTest::Passed somehow called before conclusion of test"; } DeathTest::set_last_death_test_message(buffer.GetString()); return success; } # if GTEST_OS_WINDOWS // WindowsDeathTest implements death tests on Windows. Due to the // specifics of starting new processes on Windows, death tests there are // always threadsafe, and Google Test considers the // --gtest_death_test_style=fast setting to be equivalent to // --gtest_death_test_style=threadsafe there. // // A few implementation notes: Like the Linux version, the Windows // implementation uses pipes for child-to-parent communication. But due to // the specifics of pipes on Windows, some extra steps are required: // // 1. The parent creates a communication pipe and stores handles to both // ends of it. // 2. The parent starts the child and provides it with the information // necessary to acquire the handle to the write end of the pipe. // 3. The child acquires the write end of the pipe and signals the parent // using a Windows event. // 4. Now the parent can release the write end of the pipe on its side. If // this is done before step 3, the object's reference count goes down to // 0 and it is destroyed, preventing the child from acquiring it. The // parent now has to release it, or read operations on the read end of // the pipe will not return when the child terminates. // 5. The parent reads child's output through the pipe (outcome code and // any possible error messages) from the pipe, and its stderr and then // determines whether to fail the test. // // Note: to distinguish Win32 API calls from the local method and function // calls, the former are explicitly resolved in the global namespace. // class WindowsDeathTest : public DeathTestImpl { public: WindowsDeathTest(const char* a_statement, const RE* a_regex, const char* file, int line) : DeathTestImpl(a_statement, a_regex), file_(file), line_(line) {} // All of these virtual functions are inherited from DeathTest. virtual int Wait(); virtual TestRole AssumeRole(); private: // The name of the file in which the death test is located. const char* const file_; // The line number on which the death test is located. const int line_; // Handle to the write end of the pipe to the child process. AutoHandle write_handle_; // Child process handle. AutoHandle child_handle_; // Event the child process uses to signal the parent that it has // acquired the handle to the write end of the pipe. After seeing this // event the parent can release its own handles to make sure its // ReadFile() calls return when the child terminates. AutoHandle event_handle_; }; // Waits for the child in a death test to exit, returning its exit // status, or 0 if no child process exists. As a side effect, sets the // outcome data member. int WindowsDeathTest::Wait() { if (!spawned()) return 0; // Wait until the child either signals that it has acquired the write end // of the pipe or it dies. const HANDLE wait_handles[2] = { child_handle_.Get(), event_handle_.Get() }; switch (::WaitForMultipleObjects(2, wait_handles, FALSE, // Waits for any of the handles. INFINITE)) { case WAIT_OBJECT_0: case WAIT_OBJECT_0 + 1: break; default: GTEST_DEATH_TEST_CHECK_(false); // Should not get here. } // The child has acquired the write end of the pipe or exited. // We release the handle on our side and continue. write_handle_.Reset(); event_handle_.Reset(); ReadAndInterpretStatusByte(); // Waits for the child process to exit if it haven't already. This // returns immediately if the child has already exited, regardless of // whether previous calls to WaitForMultipleObjects synchronized on this // handle or not. GTEST_DEATH_TEST_CHECK_( WAIT_OBJECT_0 == ::WaitForSingleObject(child_handle_.Get(), INFINITE)); DWORD status_code; GTEST_DEATH_TEST_CHECK_( ::GetExitCodeProcess(child_handle_.Get(), &status_code) != FALSE); child_handle_.Reset(); set_status(static_cast(status_code)); return status(); } // The AssumeRole process for a Windows death test. It creates a child // process with the same executable as the current process to run the // death test. The child process is given the --gtest_filter and // --gtest_internal_run_death_test flags such that it knows to run the // current death test only. DeathTest::TestRole WindowsDeathTest::AssumeRole() { const UnitTestImpl* const impl = GetUnitTestImpl(); const InternalRunDeathTestFlag* const flag = impl->internal_run_death_test_flag(); const TestInfo* const info = impl->current_test_info(); const int death_test_index = info->result()->death_test_count(); if (flag != NULL) { // ParseInternalRunDeathTestFlag() has performed all the necessary // processing. set_write_fd(flag->write_fd()); return EXECUTE_TEST; } // WindowsDeathTest uses an anonymous pipe to communicate results of // a death test. SECURITY_ATTRIBUTES handles_are_inheritable = { sizeof(SECURITY_ATTRIBUTES), NULL, TRUE }; HANDLE read_handle, write_handle; GTEST_DEATH_TEST_CHECK_( ::CreatePipe(&read_handle, &write_handle, &handles_are_inheritable, 0) // Default buffer size. != FALSE); set_read_fd(::_open_osfhandle(reinterpret_cast(read_handle), O_RDONLY)); write_handle_.Reset(write_handle); event_handle_.Reset(::CreateEvent( &handles_are_inheritable, TRUE, // The event will automatically reset to non-signaled state. FALSE, // The initial state is non-signalled. NULL)); // The even is unnamed. GTEST_DEATH_TEST_CHECK_(event_handle_.Get() != NULL); const String filter_flag = String::Format("--%s%s=%s.%s", GTEST_FLAG_PREFIX_, kFilterFlag, info->test_case_name(), info->name()); const String internal_flag = String::Format( "--%s%s=%s|%d|%d|%u|%Iu|%Iu", GTEST_FLAG_PREFIX_, kInternalRunDeathTestFlag, file_, line_, death_test_index, static_cast(::GetCurrentProcessId()), // size_t has the same with as pointers on both 32-bit and 64-bit // Windows platforms. // See http://msdn.microsoft.com/en-us/library/tcxf1dw6.aspx. reinterpret_cast(write_handle), reinterpret_cast(event_handle_.Get())); char executable_path[_MAX_PATH + 1]; // NOLINT GTEST_DEATH_TEST_CHECK_( _MAX_PATH + 1 != ::GetModuleFileNameA(NULL, executable_path, _MAX_PATH)); String command_line = String::Format("%s %s \"%s\"", ::GetCommandLineA(), filter_flag.c_str(), internal_flag.c_str()); DeathTest::set_last_death_test_message(""); CaptureStderr(); // Flush the log buffers since the log streams are shared with the child. FlushInfoLog(); // The child process will share the standard handles with the parent. STARTUPINFOA startup_info; memset(&startup_info, 0, sizeof(STARTUPINFO)); startup_info.dwFlags = STARTF_USESTDHANDLES; startup_info.hStdInput = ::GetStdHandle(STD_INPUT_HANDLE); startup_info.hStdOutput = ::GetStdHandle(STD_OUTPUT_HANDLE); startup_info.hStdError = ::GetStdHandle(STD_ERROR_HANDLE); PROCESS_INFORMATION process_info; GTEST_DEATH_TEST_CHECK_(::CreateProcessA( executable_path, const_cast(command_line.c_str()), NULL, // Retuned process handle is not inheritable. NULL, // Retuned thread handle is not inheritable. TRUE, // Child inherits all inheritable handles (for write_handle_). 0x0, // Default creation flags. NULL, // Inherit the parent's environment. UnitTest::GetInstance()->original_working_dir(), &startup_info, &process_info) != FALSE); child_handle_.Reset(process_info.hProcess); ::CloseHandle(process_info.hThread); set_spawned(true); return OVERSEE_TEST; } # else // We are not on Windows. // ForkingDeathTest provides implementations for most of the abstract // methods of the DeathTest interface. Only the AssumeRole method is // left undefined. class ForkingDeathTest : public DeathTestImpl { public: ForkingDeathTest(const char* statement, const RE* regex); // All of these virtual functions are inherited from DeathTest. virtual int Wait(); protected: void set_child_pid(pid_t child_pid) { child_pid_ = child_pid; } private: // PID of child process during death test; 0 in the child process itself. pid_t child_pid_; }; // Constructs a ForkingDeathTest. ForkingDeathTest::ForkingDeathTest(const char* a_statement, const RE* a_regex) : DeathTestImpl(a_statement, a_regex), child_pid_(-1) {} // Waits for the child in a death test to exit, returning its exit // status, or 0 if no child process exists. As a side effect, sets the // outcome data member. int ForkingDeathTest::Wait() { if (!spawned()) return 0; ReadAndInterpretStatusByte(); int status_value; GTEST_DEATH_TEST_CHECK_SYSCALL_(waitpid(child_pid_, &status_value, 0)); set_status(status_value); return status_value; } // A concrete death test class that forks, then immediately runs the test // in the child process. class NoExecDeathTest : public ForkingDeathTest { public: NoExecDeathTest(const char* a_statement, const RE* a_regex) : ForkingDeathTest(a_statement, a_regex) { } virtual TestRole AssumeRole(); }; // The AssumeRole process for a fork-and-run death test. It implements a // straightforward fork, with a simple pipe to transmit the status byte. DeathTest::TestRole NoExecDeathTest::AssumeRole() { const size_t thread_count = GetThreadCount(); if (thread_count != 1) { GTEST_LOG_(WARNING) << DeathTestThreadWarning(thread_count); } int pipe_fd[2]; GTEST_DEATH_TEST_CHECK_(pipe(pipe_fd) != -1); DeathTest::set_last_death_test_message(""); CaptureStderr(); // When we fork the process below, the log file buffers are copied, but the // file descriptors are shared. We flush all log files here so that closing // the file descriptors in the child process doesn't throw off the // synchronization between descriptors and buffers in the parent process. // This is as close to the fork as possible to avoid a race condition in case // there are multiple threads running before the death test, and another // thread writes to the log file. FlushInfoLog(); const pid_t child_pid = fork(); GTEST_DEATH_TEST_CHECK_(child_pid != -1); set_child_pid(child_pid); if (child_pid == 0) { GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[0])); set_write_fd(pipe_fd[1]); // Redirects all logging to stderr in the child process to prevent // concurrent writes to the log files. We capture stderr in the parent // process and append the child process' output to a log. LogToStderr(); // Event forwarding to the listeners of event listener API mush be shut // down in death test subprocesses. GetUnitTestImpl()->listeners()->SuppressEventForwarding(); return EXECUTE_TEST; } else { GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[1])); set_read_fd(pipe_fd[0]); set_spawned(true); return OVERSEE_TEST; } } // A concrete death test class that forks and re-executes the main // program from the beginning, with command-line flags set that cause // only this specific death test to be run. class ExecDeathTest : public ForkingDeathTest { public: ExecDeathTest(const char* a_statement, const RE* a_regex, const char* file, int line) : ForkingDeathTest(a_statement, a_regex), file_(file), line_(line) { } virtual TestRole AssumeRole(); private: // The name of the file in which the death test is located. const char* const file_; // The line number on which the death test is located. const int line_; }; // Utility class for accumulating command-line arguments. class Arguments { public: Arguments() { args_.push_back(NULL); } ~Arguments() { for (std::vector::iterator i = args_.begin(); i != args_.end(); ++i) { free(*i); } } void AddArgument(const char* argument) { args_.insert(args_.end() - 1, posix::StrDup(argument)); } template void AddArguments(const ::std::vector& arguments) { for (typename ::std::vector::const_iterator i = arguments.begin(); i != arguments.end(); ++i) { args_.insert(args_.end() - 1, posix::StrDup(i->c_str())); } } char* const* Argv() { return &args_[0]; } private: std::vector args_; }; // A struct that encompasses the arguments to the child process of a // threadsafe-style death test process. struct ExecDeathTestArgs { char* const* argv; // Command-line arguments for the child's call to exec int close_fd; // File descriptor to close; the read end of a pipe }; # if GTEST_OS_MAC inline char** GetEnviron() { // When Google Test is built as a framework on MacOS X, the environ variable // is unavailable. Apple's documentation (man environ) recommends using // _NSGetEnviron() instead. return *_NSGetEnviron(); } # else // Some POSIX platforms expect you to declare environ. extern "C" makes // it reside in the global namespace. extern "C" char** environ; inline char** GetEnviron() { return environ; } # endif // GTEST_OS_MAC // The main function for a threadsafe-style death test child process. // This function is called in a clone()-ed process and thus must avoid // any potentially unsafe operations like malloc or libc functions. static int ExecDeathTestChildMain(void* child_arg) { ExecDeathTestArgs* const args = static_cast(child_arg); GTEST_DEATH_TEST_CHECK_SYSCALL_(close(args->close_fd)); // We need to execute the test program in the same environment where // it was originally invoked. Therefore we change to the original // working directory first. const char* const original_dir = UnitTest::GetInstance()->original_working_dir(); // We can safely call chdir() as it's a direct system call. if (chdir(original_dir) != 0) { DeathTestAbort(String::Format("chdir(\"%s\") failed: %s", original_dir, GetLastErrnoDescription().c_str())); return EXIT_FAILURE; } // We can safely call execve() as it's a direct system call. We // cannot use execvp() as it's a libc function and thus potentially // unsafe. Since execve() doesn't search the PATH, the user must // invoke the test program via a valid path that contains at least // one path separator. execve(args->argv[0], args->argv, GetEnviron()); DeathTestAbort(String::Format("execve(%s, ...) in %s failed: %s", args->argv[0], original_dir, GetLastErrnoDescription().c_str())); return EXIT_FAILURE; } // Two utility routines that together determine the direction the stack // grows. // This could be accomplished more elegantly by a single recursive // function, but we want to guard against the unlikely possibility of // a smart compiler optimizing the recursion away. // // GTEST_NO_INLINE_ is required to prevent GCC 4.6 from inlining // StackLowerThanAddress into StackGrowsDown, which then doesn't give // correct answer. bool StackLowerThanAddress(const void* ptr) GTEST_NO_INLINE_; bool StackLowerThanAddress(const void* ptr) { int dummy; return &dummy < ptr; } bool StackGrowsDown() { int dummy; return StackLowerThanAddress(&dummy); } // A threadsafe implementation of fork(2) for threadsafe-style death tests // that uses clone(2). It dies with an error message if anything goes // wrong. static pid_t ExecDeathTestFork(char* const* argv, int close_fd) { ExecDeathTestArgs args = { argv, close_fd }; pid_t child_pid = -1; # if GTEST_HAS_CLONE const bool use_fork = GTEST_FLAG(death_test_use_fork); if (!use_fork) { static const bool stack_grows_down = StackGrowsDown(); const size_t stack_size = getpagesize(); // MMAP_ANONYMOUS is not defined on Mac, so we use MAP_ANON instead. void* const stack = mmap(NULL, stack_size, PROT_READ | PROT_WRITE, MAP_ANON | MAP_PRIVATE, -1, 0); GTEST_DEATH_TEST_CHECK_(stack != MAP_FAILED); void* const stack_top = static_cast(stack) + (stack_grows_down ? stack_size : 0); child_pid = clone(&ExecDeathTestChildMain, stack_top, SIGCHLD, &args); GTEST_DEATH_TEST_CHECK_(munmap(stack, stack_size) != -1); } # else const bool use_fork = true; # endif // GTEST_HAS_CLONE if (use_fork && (child_pid = fork()) == 0) { ExecDeathTestChildMain(&args); _exit(0); } GTEST_DEATH_TEST_CHECK_(child_pid != -1); return child_pid; } // The AssumeRole process for a fork-and-exec death test. It re-executes the // main program from the beginning, setting the --gtest_filter // and --gtest_internal_run_death_test flags to cause only the current // death test to be re-run. DeathTest::TestRole ExecDeathTest::AssumeRole() { const UnitTestImpl* const impl = GetUnitTestImpl(); const InternalRunDeathTestFlag* const flag = impl->internal_run_death_test_flag(); const TestInfo* const info = impl->current_test_info(); const int death_test_index = info->result()->death_test_count(); if (flag != NULL) { set_write_fd(flag->write_fd()); return EXECUTE_TEST; } int pipe_fd[2]; GTEST_DEATH_TEST_CHECK_(pipe(pipe_fd) != -1); // Clear the close-on-exec flag on the write end of the pipe, lest // it be closed when the child process does an exec: GTEST_DEATH_TEST_CHECK_(fcntl(pipe_fd[1], F_SETFD, 0) != -1); const String filter_flag = String::Format("--%s%s=%s.%s", GTEST_FLAG_PREFIX_, kFilterFlag, info->test_case_name(), info->name()); const String internal_flag = String::Format("--%s%s=%s|%d|%d|%d", GTEST_FLAG_PREFIX_, kInternalRunDeathTestFlag, file_, line_, death_test_index, pipe_fd[1]); Arguments args; args.AddArguments(GetArgvs()); args.AddArgument(filter_flag.c_str()); args.AddArgument(internal_flag.c_str()); DeathTest::set_last_death_test_message(""); CaptureStderr(); // See the comment in NoExecDeathTest::AssumeRole for why the next line // is necessary. FlushInfoLog(); const pid_t child_pid = ExecDeathTestFork(args.Argv(), pipe_fd[0]); GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[1])); set_child_pid(child_pid); set_read_fd(pipe_fd[0]); set_spawned(true); return OVERSEE_TEST; } # endif // !GTEST_OS_WINDOWS // Creates a concrete DeathTest-derived class that depends on the // --gtest_death_test_style flag, and sets the pointer pointed to // by the "test" argument to its address. If the test should be // skipped, sets that pointer to NULL. Returns true, unless the // flag is set to an invalid value. bool DefaultDeathTestFactory::Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test) { UnitTestImpl* const impl = GetUnitTestImpl(); const InternalRunDeathTestFlag* const flag = impl->internal_run_death_test_flag(); const int death_test_index = impl->current_test_info() ->increment_death_test_count(); if (flag != NULL) { if (death_test_index > flag->index()) { DeathTest::set_last_death_test_message(String::Format( "Death test count (%d) somehow exceeded expected maximum (%d)", death_test_index, flag->index())); return false; } if (!(flag->file() == file && flag->line() == line && flag->index() == death_test_index)) { *test = NULL; return true; } } # if GTEST_OS_WINDOWS if (GTEST_FLAG(death_test_style) == "threadsafe" || GTEST_FLAG(death_test_style) == "fast") { *test = new WindowsDeathTest(statement, regex, file, line); } # else if (GTEST_FLAG(death_test_style) == "threadsafe") { *test = new ExecDeathTest(statement, regex, file, line); } else if (GTEST_FLAG(death_test_style) == "fast") { *test = new NoExecDeathTest(statement, regex); } # endif // GTEST_OS_WINDOWS else { // NOLINT - this is more readable than unbalanced brackets inside #if. DeathTest::set_last_death_test_message(String::Format( "Unknown death test style \"%s\" encountered", GTEST_FLAG(death_test_style).c_str())); return false; } return true; } // Splits a given string on a given delimiter, populating a given // vector with the fields. GTEST_HAS_DEATH_TEST implies that we have // ::std::string, so we can use it here. static void SplitString(const ::std::string& str, char delimiter, ::std::vector< ::std::string>* dest) { ::std::vector< ::std::string> parsed; ::std::string::size_type pos = 0; while (::testing::internal::AlwaysTrue()) { const ::std::string::size_type colon = str.find(delimiter, pos); if (colon == ::std::string::npos) { parsed.push_back(str.substr(pos)); break; } else { parsed.push_back(str.substr(pos, colon - pos)); pos = colon + 1; } } dest->swap(parsed); } # if GTEST_OS_WINDOWS // Recreates the pipe and event handles from the provided parameters, // signals the event, and returns a file descriptor wrapped around the pipe // handle. This function is called in the child process only. int GetStatusFileDescriptor(unsigned int parent_process_id, size_t write_handle_as_size_t, size_t event_handle_as_size_t) { AutoHandle parent_process_handle(::OpenProcess(PROCESS_DUP_HANDLE, FALSE, // Non-inheritable. parent_process_id)); if (parent_process_handle.Get() == INVALID_HANDLE_VALUE) { DeathTestAbort(String::Format("Unable to open parent process %u", parent_process_id)); } // TODO(vladl@google.com): Replace the following check with a // compile-time assertion when available. GTEST_CHECK_(sizeof(HANDLE) <= sizeof(size_t)); const HANDLE write_handle = reinterpret_cast(write_handle_as_size_t); HANDLE dup_write_handle; // The newly initialized handle is accessible only in in the parent // process. To obtain one accessible within the child, we need to use // DuplicateHandle. if (!::DuplicateHandle(parent_process_handle.Get(), write_handle, ::GetCurrentProcess(), &dup_write_handle, 0x0, // Requested privileges ignored since // DUPLICATE_SAME_ACCESS is used. FALSE, // Request non-inheritable handler. DUPLICATE_SAME_ACCESS)) { DeathTestAbort(String::Format( "Unable to duplicate the pipe handle %Iu from the parent process %u", write_handle_as_size_t, parent_process_id)); } const HANDLE event_handle = reinterpret_cast(event_handle_as_size_t); HANDLE dup_event_handle; if (!::DuplicateHandle(parent_process_handle.Get(), event_handle, ::GetCurrentProcess(), &dup_event_handle, 0x0, FALSE, DUPLICATE_SAME_ACCESS)) { DeathTestAbort(String::Format( "Unable to duplicate the event handle %Iu from the parent process %u", event_handle_as_size_t, parent_process_id)); } const int write_fd = ::_open_osfhandle(reinterpret_cast(dup_write_handle), O_APPEND); if (write_fd == -1) { DeathTestAbort(String::Format( "Unable to convert pipe handle %Iu to a file descriptor", write_handle_as_size_t)); } // Signals the parent that the write end of the pipe has been acquired // so the parent can release its own write end. ::SetEvent(dup_event_handle); return write_fd; } # endif // GTEST_OS_WINDOWS // Returns a newly created InternalRunDeathTestFlag object with fields // initialized from the GTEST_FLAG(internal_run_death_test) flag if // the flag is specified; otherwise returns NULL. InternalRunDeathTestFlag* ParseInternalRunDeathTestFlag() { if (GTEST_FLAG(internal_run_death_test) == "") return NULL; // GTEST_HAS_DEATH_TEST implies that we have ::std::string, so we // can use it here. int line = -1; int index = -1; ::std::vector< ::std::string> fields; SplitString(GTEST_FLAG(internal_run_death_test).c_str(), '|', &fields); int write_fd = -1; # if GTEST_OS_WINDOWS unsigned int parent_process_id = 0; size_t write_handle_as_size_t = 0; size_t event_handle_as_size_t = 0; if (fields.size() != 6 || !ParseNaturalNumber(fields[1], &line) || !ParseNaturalNumber(fields[2], &index) || !ParseNaturalNumber(fields[3], &parent_process_id) || !ParseNaturalNumber(fields[4], &write_handle_as_size_t) || !ParseNaturalNumber(fields[5], &event_handle_as_size_t)) { DeathTestAbort(String::Format( "Bad --gtest_internal_run_death_test flag: %s", GTEST_FLAG(internal_run_death_test).c_str())); } write_fd = GetStatusFileDescriptor(parent_process_id, write_handle_as_size_t, event_handle_as_size_t); # else if (fields.size() != 4 || !ParseNaturalNumber(fields[1], &line) || !ParseNaturalNumber(fields[2], &index) || !ParseNaturalNumber(fields[3], &write_fd)) { DeathTestAbort(String::Format( "Bad --gtest_internal_run_death_test flag: %s", GTEST_FLAG(internal_run_death_test).c_str())); } # endif // GTEST_OS_WINDOWS return new InternalRunDeathTestFlag(fields[0], line, index, write_fd); } } // namespace internal #endif // GTEST_HAS_DEATH_TEST } // namespace testing // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Authors: keith.ray@gmail.com (Keith Ray) #include #if GTEST_OS_WINDOWS_MOBILE # include #elif GTEST_OS_WINDOWS # include # include #elif GTEST_OS_SYMBIAN || GTEST_OS_NACL // Symbian OpenC and NaCl have PATH_MAX in sys/syslimits.h # include #else # include # include // Some Linux distributions define PATH_MAX here. #endif // GTEST_OS_WINDOWS_MOBILE #if GTEST_OS_WINDOWS # define GTEST_PATH_MAX_ _MAX_PATH #elif defined(PATH_MAX) # define GTEST_PATH_MAX_ PATH_MAX #elif defined(_XOPEN_PATH_MAX) # define GTEST_PATH_MAX_ _XOPEN_PATH_MAX #else # define GTEST_PATH_MAX_ _POSIX_PATH_MAX #endif // GTEST_OS_WINDOWS namespace testing { namespace internal { #if GTEST_OS_WINDOWS // On Windows, '\\' is the standard path separator, but many tools and the // Windows API also accept '/' as an alternate path separator. Unless otherwise // noted, a file path can contain either kind of path separators, or a mixture // of them. const char kPathSeparator = '\\'; const char kAlternatePathSeparator = '/'; const char kPathSeparatorString[] = "\\"; const char kAlternatePathSeparatorString[] = "/"; # if GTEST_OS_WINDOWS_MOBILE // Windows CE doesn't have a current directory. You should not use // the current directory in tests on Windows CE, but this at least // provides a reasonable fallback. const char kCurrentDirectoryString[] = "\\"; // Windows CE doesn't define INVALID_FILE_ATTRIBUTES const DWORD kInvalidFileAttributes = 0xffffffff; # else const char kCurrentDirectoryString[] = ".\\"; # endif // GTEST_OS_WINDOWS_MOBILE #else const char kPathSeparator = '/'; const char kPathSeparatorString[] = "/"; const char kCurrentDirectoryString[] = "./"; #endif // GTEST_OS_WINDOWS // Returns whether the given character is a valid path separator. static bool IsPathSeparator(char c) { #if GTEST_HAS_ALT_PATH_SEP_ return (c == kPathSeparator) || (c == kAlternatePathSeparator); #else return c == kPathSeparator; #endif } // Returns the current working directory, or "" if unsuccessful. FilePath FilePath::GetCurrentDir() { #if GTEST_OS_WINDOWS_MOBILE // Windows CE doesn't have a current directory, so we just return // something reasonable. return FilePath(kCurrentDirectoryString); #elif GTEST_OS_WINDOWS char cwd[GTEST_PATH_MAX_ + 1] = { '\0' }; return FilePath(_getcwd(cwd, sizeof(cwd)) == NULL ? "" : cwd); #else char cwd[GTEST_PATH_MAX_ + 1] = { '\0' }; return FilePath(getcwd(cwd, sizeof(cwd)) == NULL ? "" : cwd); #endif // GTEST_OS_WINDOWS_MOBILE } // Returns a copy of the FilePath with the case-insensitive extension removed. // Example: FilePath("dir/file.exe").RemoveExtension("EXE") returns // FilePath("dir/file"). If a case-insensitive extension is not // found, returns a copy of the original FilePath. FilePath FilePath::RemoveExtension(const char* extension) const { String dot_extension(String::Format(".%s", extension)); if (pathname_.EndsWithCaseInsensitive(dot_extension.c_str())) { return FilePath(String(pathname_.c_str(), pathname_.length() - 4)); } return *this; } // Returns a pointer to the last occurence of a valid path separator in // the FilePath. On Windows, for example, both '/' and '\' are valid path // separators. Returns NULL if no path separator was found. const char* FilePath::FindLastPathSeparator() const { const char* const last_sep = strrchr(c_str(), kPathSeparator); #if GTEST_HAS_ALT_PATH_SEP_ const char* const last_alt_sep = strrchr(c_str(), kAlternatePathSeparator); // Comparing two pointers of which only one is NULL is undefined. if (last_alt_sep != NULL && (last_sep == NULL || last_alt_sep > last_sep)) { return last_alt_sep; } #endif return last_sep; } // Returns a copy of the FilePath with the directory part removed. // Example: FilePath("path/to/file").RemoveDirectoryName() returns // FilePath("file"). If there is no directory part ("just_a_file"), it returns // the FilePath unmodified. If there is no file part ("just_a_dir/") it // returns an empty FilePath (""). // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath FilePath::RemoveDirectoryName() const { const char* const last_sep = FindLastPathSeparator(); return last_sep ? FilePath(String(last_sep + 1)) : *this; } // RemoveFileName returns the directory path with the filename removed. // Example: FilePath("path/to/file").RemoveFileName() returns "path/to/". // If the FilePath is "a_file" or "/a_file", RemoveFileName returns // FilePath("./") or, on Windows, FilePath(".\\"). If the filepath does // not have a file, like "just/a/dir/", it returns the FilePath unmodified. // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath FilePath::RemoveFileName() const { const char* const last_sep = FindLastPathSeparator(); String dir; if (last_sep) { dir = String(c_str(), last_sep + 1 - c_str()); } else { dir = kCurrentDirectoryString; } return FilePath(dir); } // Helper functions for naming files in a directory for xml output. // Given directory = "dir", base_name = "test", number = 0, // extension = "xml", returns "dir/test.xml". If number is greater // than zero (e.g., 12), returns "dir/test_12.xml". // On Windows platform, uses \ as the separator rather than /. FilePath FilePath::MakeFileName(const FilePath& directory, const FilePath& base_name, int number, const char* extension) { String file; if (number == 0) { file = String::Format("%s.%s", base_name.c_str(), extension); } else { file = String::Format("%s_%d.%s", base_name.c_str(), number, extension); } return ConcatPaths(directory, FilePath(file)); } // Given directory = "dir", relative_path = "test.xml", returns "dir/test.xml". // On Windows, uses \ as the separator rather than /. FilePath FilePath::ConcatPaths(const FilePath& directory, const FilePath& relative_path) { if (directory.IsEmpty()) return relative_path; const FilePath dir(directory.RemoveTrailingPathSeparator()); return FilePath(String::Format("%s%c%s", dir.c_str(), kPathSeparator, relative_path.c_str())); } // Returns true if pathname describes something findable in the file-system, // either a file, directory, or whatever. bool FilePath::FileOrDirectoryExists() const { #if GTEST_OS_WINDOWS_MOBILE LPCWSTR unicode = String::AnsiToUtf16(pathname_.c_str()); const DWORD attributes = GetFileAttributes(unicode); delete [] unicode; return attributes != kInvalidFileAttributes; #else posix::StatStruct file_stat; return posix::Stat(pathname_.c_str(), &file_stat) == 0; #endif // GTEST_OS_WINDOWS_MOBILE } // Returns true if pathname describes a directory in the file-system // that exists. bool FilePath::DirectoryExists() const { bool result = false; #if GTEST_OS_WINDOWS // Don't strip off trailing separator if path is a root directory on // Windows (like "C:\\"). const FilePath& path(IsRootDirectory() ? *this : RemoveTrailingPathSeparator()); #else const FilePath& path(*this); #endif #if GTEST_OS_WINDOWS_MOBILE LPCWSTR unicode = String::AnsiToUtf16(path.c_str()); const DWORD attributes = GetFileAttributes(unicode); delete [] unicode; if ((attributes != kInvalidFileAttributes) && (attributes & FILE_ATTRIBUTE_DIRECTORY)) { result = true; } #else posix::StatStruct file_stat; result = posix::Stat(path.c_str(), &file_stat) == 0 && posix::IsDir(file_stat); #endif // GTEST_OS_WINDOWS_MOBILE return result; } // Returns true if pathname describes a root directory. (Windows has one // root directory per disk drive.) bool FilePath::IsRootDirectory() const { #if GTEST_OS_WINDOWS // TODO(wan@google.com): on Windows a network share like // \\server\share can be a root directory, although it cannot be the // current directory. Handle this properly. return pathname_.length() == 3 && IsAbsolutePath(); #else return pathname_.length() == 1 && IsPathSeparator(pathname_.c_str()[0]); #endif } // Returns true if pathname describes an absolute path. bool FilePath::IsAbsolutePath() const { const char* const name = pathname_.c_str(); #if GTEST_OS_WINDOWS return pathname_.length() >= 3 && ((name[0] >= 'a' && name[0] <= 'z') || (name[0] >= 'A' && name[0] <= 'Z')) && name[1] == ':' && IsPathSeparator(name[2]); #else return IsPathSeparator(name[0]); #endif } // Returns a pathname for a file that does not currently exist. The pathname // will be directory/base_name.extension or // directory/base_name_.extension if directory/base_name.extension // already exists. The number will be incremented until a pathname is found // that does not already exist. // Examples: 'dir/foo_test.xml' or 'dir/foo_test_1.xml'. // There could be a race condition if two or more processes are calling this // function at the same time -- they could both pick the same filename. FilePath FilePath::GenerateUniqueFileName(const FilePath& directory, const FilePath& base_name, const char* extension) { FilePath full_pathname; int number = 0; do { full_pathname.Set(MakeFileName(directory, base_name, number++, extension)); } while (full_pathname.FileOrDirectoryExists()); return full_pathname; } // Returns true if FilePath ends with a path separator, which indicates that // it is intended to represent a directory. Returns false otherwise. // This does NOT check that a directory (or file) actually exists. bool FilePath::IsDirectory() const { return !pathname_.empty() && IsPathSeparator(pathname_.c_str()[pathname_.length() - 1]); } // Create directories so that path exists. Returns true if successful or if // the directories already exist; returns false if unable to create directories // for any reason. bool FilePath::CreateDirectoriesRecursively() const { if (!this->IsDirectory()) { return false; } if (pathname_.length() == 0 || this->DirectoryExists()) { return true; } const FilePath parent(this->RemoveTrailingPathSeparator().RemoveFileName()); return parent.CreateDirectoriesRecursively() && this->CreateFolder(); } // Create the directory so that path exists. Returns true if successful or // if the directory already exists; returns false if unable to create the // directory for any reason, including if the parent directory does not // exist. Not named "CreateDirectory" because that's a macro on Windows. bool FilePath::CreateFolder() const { #if GTEST_OS_WINDOWS_MOBILE FilePath removed_sep(this->RemoveTrailingPathSeparator()); LPCWSTR unicode = String::AnsiToUtf16(removed_sep.c_str()); int result = CreateDirectory(unicode, NULL) ? 0 : -1; delete [] unicode; #elif GTEST_OS_WINDOWS int result = _mkdir(pathname_.c_str()); #else int result = mkdir(pathname_.c_str(), 0777); #endif // GTEST_OS_WINDOWS_MOBILE if (result == -1) { return this->DirectoryExists(); // An error is OK if the directory exists. } return true; // No error. } // If input name has a trailing separator character, remove it and return the // name, otherwise return the name string unmodified. // On Windows platform, uses \ as the separator, other platforms use /. FilePath FilePath::RemoveTrailingPathSeparator() const { return IsDirectory() ? FilePath(String(pathname_.c_str(), pathname_.length() - 1)) : *this; } // Removes any redundant separators that might be in the pathname. // For example, "bar///foo" becomes "bar/foo". Does not eliminate other // redundancies that might be in a pathname involving "." or "..". // TODO(wan@google.com): handle Windows network shares (e.g. \\server\share). void FilePath::Normalize() { if (pathname_.c_str() == NULL) { pathname_ = ""; return; } const char* src = pathname_.c_str(); char* const dest = new char[pathname_.length() + 1]; char* dest_ptr = dest; memset(dest_ptr, 0, pathname_.length() + 1); while (*src != '\0') { *dest_ptr = *src; if (!IsPathSeparator(*src)) { src++; } else { #if GTEST_HAS_ALT_PATH_SEP_ if (*dest_ptr == kAlternatePathSeparator) { *dest_ptr = kPathSeparator; } #endif while (IsPathSeparator(*src)) src++; } dest_ptr++; } *dest_ptr = '\0'; pathname_ = dest; delete[] dest; } } // namespace internal } // namespace testing // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan) #include #include #include #include #if GTEST_OS_WINDOWS_MOBILE # include // For TerminateProcess() #elif GTEST_OS_WINDOWS # include # include #else # include #endif // GTEST_OS_WINDOWS_MOBILE #if GTEST_OS_MAC # include # include # include #endif // GTEST_OS_MAC // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #undef GTEST_IMPLEMENTATION_ namespace testing { namespace internal { #if defined(_MSC_VER) || defined(__BORLANDC__) // MSVC and C++Builder do not provide a definition of STDERR_FILENO. const int kStdOutFileno = 1; const int kStdErrFileno = 2; #else const int kStdOutFileno = STDOUT_FILENO; const int kStdErrFileno = STDERR_FILENO; #endif // _MSC_VER #if GTEST_OS_MAC // Returns the number of threads running in the process, or 0 to indicate that // we cannot detect it. size_t GetThreadCount() { const task_t task = mach_task_self(); mach_msg_type_number_t thread_count; thread_act_array_t thread_list; const kern_return_t status = task_threads(task, &thread_list, &thread_count); if (status == KERN_SUCCESS) { // task_threads allocates resources in thread_list and we need to free them // to avoid leaks. vm_deallocate(task, reinterpret_cast(thread_list), sizeof(thread_t) * thread_count); return static_cast(thread_count); } else { return 0; } } #else size_t GetThreadCount() { // There's no portable way to detect the number of threads, so we just // return 0 to indicate that we cannot detect it. return 0; } #endif // GTEST_OS_MAC #if GTEST_USES_POSIX_RE // Implements RE. Currently only needed for death tests. RE::~RE() { if (is_valid_) { // regfree'ing an invalid regex might crash because the content // of the regex is undefined. Since the regex's are essentially // the same, one cannot be valid (or invalid) without the other // being so too. regfree(&partial_regex_); regfree(&full_regex_); } free(const_cast(pattern_)); } // Returns true iff regular expression re matches the entire str. bool RE::FullMatch(const char* str, const RE& re) { if (!re.is_valid_) return false; regmatch_t match; return regexec(&re.full_regex_, str, 1, &match, 0) == 0; } // Returns true iff regular expression re matches a substring of str // (including str itself). bool RE::PartialMatch(const char* str, const RE& re) { if (!re.is_valid_) return false; regmatch_t match; return regexec(&re.partial_regex_, str, 1, &match, 0) == 0; } // Initializes an RE from its string representation. void RE::Init(const char* regex) { pattern_ = posix::StrDup(regex); // Reserves enough bytes to hold the regular expression used for a // full match. const size_t full_regex_len = strlen(regex) + 10; char* const full_pattern = new char[full_regex_len]; snprintf(full_pattern, full_regex_len, "^(%s)$", regex); is_valid_ = regcomp(&full_regex_, full_pattern, REG_EXTENDED) == 0; // We want to call regcomp(&partial_regex_, ...) even if the // previous expression returns false. Otherwise partial_regex_ may // not be properly initialized can may cause trouble when it's // freed. // // Some implementation of POSIX regex (e.g. on at least some // versions of Cygwin) doesn't accept the empty string as a valid // regex. We change it to an equivalent form "()" to be safe. if (is_valid_) { const char* const partial_regex = (*regex == '\0') ? "()" : regex; is_valid_ = regcomp(&partial_regex_, partial_regex, REG_EXTENDED) == 0; } EXPECT_TRUE(is_valid_) << "Regular expression \"" << regex << "\" is not a valid POSIX Extended regular expression."; delete[] full_pattern; } #elif GTEST_USES_SIMPLE_RE // Returns true iff ch appears anywhere in str (excluding the // terminating '\0' character). bool IsInSet(char ch, const char* str) { return ch != '\0' && strchr(str, ch) != NULL; } // Returns true iff ch belongs to the given classification. Unlike // similar functions in , these aren't affected by the // current locale. bool IsAsciiDigit(char ch) { return '0' <= ch && ch <= '9'; } bool IsAsciiPunct(char ch) { return IsInSet(ch, "^-!\"#$%&'()*+,./:;<=>?@[\\]_`{|}~"); } bool IsRepeat(char ch) { return IsInSet(ch, "?*+"); } bool IsAsciiWhiteSpace(char ch) { return IsInSet(ch, " \f\n\r\t\v"); } bool IsAsciiWordChar(char ch) { return ('a' <= ch && ch <= 'z') || ('A' <= ch && ch <= 'Z') || ('0' <= ch && ch <= '9') || ch == '_'; } // Returns true iff "\\c" is a supported escape sequence. bool IsValidEscape(char c) { return (IsAsciiPunct(c) || IsInSet(c, "dDfnrsStvwW")); } // Returns true iff the given atom (specified by escaped and pattern) // matches ch. The result is undefined if the atom is invalid. bool AtomMatchesChar(bool escaped, char pattern_char, char ch) { if (escaped) { // "\\p" where p is pattern_char. switch (pattern_char) { case 'd': return IsAsciiDigit(ch); case 'D': return !IsAsciiDigit(ch); case 'f': return ch == '\f'; case 'n': return ch == '\n'; case 'r': return ch == '\r'; case 's': return IsAsciiWhiteSpace(ch); case 'S': return !IsAsciiWhiteSpace(ch); case 't': return ch == '\t'; case 'v': return ch == '\v'; case 'w': return IsAsciiWordChar(ch); case 'W': return !IsAsciiWordChar(ch); } return IsAsciiPunct(pattern_char) && pattern_char == ch; } return (pattern_char == '.' && ch != '\n') || pattern_char == ch; } // Helper function used by ValidateRegex() to format error messages. String FormatRegexSyntaxError(const char* regex, int index) { return (Message() << "Syntax error at index " << index << " in simple regular expression \"" << regex << "\": ").GetString(); } // Generates non-fatal failures and returns false if regex is invalid; // otherwise returns true. bool ValidateRegex(const char* regex) { if (regex == NULL) { // TODO(wan@google.com): fix the source file location in the // assertion failures to match where the regex is used in user // code. ADD_FAILURE() << "NULL is not a valid simple regular expression."; return false; } bool is_valid = true; // True iff ?, *, or + can follow the previous atom. bool prev_repeatable = false; for (int i = 0; regex[i]; i++) { if (regex[i] == '\\') { // An escape sequence i++; if (regex[i] == '\0') { ADD_FAILURE() << FormatRegexSyntaxError(regex, i - 1) << "'\\' cannot appear at the end."; return false; } if (!IsValidEscape(regex[i])) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i - 1) << "invalid escape sequence \"\\" << regex[i] << "\"."; is_valid = false; } prev_repeatable = true; } else { // Not an escape sequence. const char ch = regex[i]; if (ch == '^' && i > 0) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'^' can only appear at the beginning."; is_valid = false; } else if (ch == '$' && regex[i + 1] != '\0') { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'$' can only appear at the end."; is_valid = false; } else if (IsInSet(ch, "()[]{}|")) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'" << ch << "' is unsupported."; is_valid = false; } else if (IsRepeat(ch) && !prev_repeatable) { ADD_FAILURE() << FormatRegexSyntaxError(regex, i) << "'" << ch << "' can only follow a repeatable token."; is_valid = false; } prev_repeatable = !IsInSet(ch, "^$?*+"); } } return is_valid; } // Matches a repeated regex atom followed by a valid simple regular // expression. The regex atom is defined as c if escaped is false, // or \c otherwise. repeat is the repetition meta character (?, *, // or +). The behavior is undefined if str contains too many // characters to be indexable by size_t, in which case the test will // probably time out anyway. We are fine with this limitation as // std::string has it too. bool MatchRepetitionAndRegexAtHead( bool escaped, char c, char repeat, const char* regex, const char* str) { const size_t min_count = (repeat == '+') ? 1 : 0; const size_t max_count = (repeat == '?') ? 1 : static_cast(-1) - 1; // We cannot call numeric_limits::max() as it conflicts with the // max() macro on Windows. for (size_t i = 0; i <= max_count; ++i) { // We know that the atom matches each of the first i characters in str. if (i >= min_count && MatchRegexAtHead(regex, str + i)) { // We have enough matches at the head, and the tail matches too. // Since we only care about *whether* the pattern matches str // (as opposed to *how* it matches), there is no need to find a // greedy match. return true; } if (str[i] == '\0' || !AtomMatchesChar(escaped, c, str[i])) return false; } return false; } // Returns true iff regex matches a prefix of str. regex must be a // valid simple regular expression and not start with "^", or the // result is undefined. bool MatchRegexAtHead(const char* regex, const char* str) { if (*regex == '\0') // An empty regex matches a prefix of anything. return true; // "$" only matches the end of a string. Note that regex being // valid guarantees that there's nothing after "$" in it. if (*regex == '$') return *str == '\0'; // Is the first thing in regex an escape sequence? const bool escaped = *regex == '\\'; if (escaped) ++regex; if (IsRepeat(regex[1])) { // MatchRepetitionAndRegexAtHead() calls MatchRegexAtHead(), so // here's an indirect recursion. It terminates as the regex gets // shorter in each recursion. return MatchRepetitionAndRegexAtHead( escaped, regex[0], regex[1], regex + 2, str); } else { // regex isn't empty, isn't "$", and doesn't start with a // repetition. We match the first atom of regex with the first // character of str and recurse. return (*str != '\0') && AtomMatchesChar(escaped, *regex, *str) && MatchRegexAtHead(regex + 1, str + 1); } } // Returns true iff regex matches any substring of str. regex must be // a valid simple regular expression, or the result is undefined. // // The algorithm is recursive, but the recursion depth doesn't exceed // the regex length, so we won't need to worry about running out of // stack space normally. In rare cases the time complexity can be // exponential with respect to the regex length + the string length, // but usually it's must faster (often close to linear). bool MatchRegexAnywhere(const char* regex, const char* str) { if (regex == NULL || str == NULL) return false; if (*regex == '^') return MatchRegexAtHead(regex + 1, str); // A successful match can be anywhere in str. do { if (MatchRegexAtHead(regex, str)) return true; } while (*str++ != '\0'); return false; } // Implements the RE class. RE::~RE() { free(const_cast(pattern_)); free(const_cast(full_pattern_)); } // Returns true iff regular expression re matches the entire str. bool RE::FullMatch(const char* str, const RE& re) { return re.is_valid_ && MatchRegexAnywhere(re.full_pattern_, str); } // Returns true iff regular expression re matches a substring of str // (including str itself). bool RE::PartialMatch(const char* str, const RE& re) { return re.is_valid_ && MatchRegexAnywhere(re.pattern_, str); } // Initializes an RE from its string representation. void RE::Init(const char* regex) { pattern_ = full_pattern_ = NULL; if (regex != NULL) { pattern_ = posix::StrDup(regex); } is_valid_ = ValidateRegex(regex); if (!is_valid_) { // No need to calculate the full pattern when the regex is invalid. return; } const size_t len = strlen(regex); // Reserves enough bytes to hold the regular expression used for a // full match: we need space to prepend a '^', append a '$', and // terminate the string with '\0'. char* buffer = static_cast(malloc(len + 3)); full_pattern_ = buffer; if (*regex != '^') *buffer++ = '^'; // Makes sure full_pattern_ starts with '^'. // We don't use snprintf or strncpy, as they trigger a warning when // compiled with VC++ 8.0. memcpy(buffer, regex, len); buffer += len; if (len == 0 || regex[len - 1] != '$') *buffer++ = '$'; // Makes sure full_pattern_ ends with '$'. *buffer = '\0'; } #endif // GTEST_USES_POSIX_RE const char kUnknownFile[] = "unknown file"; // Formats a source file path and a line number as they would appear // in an error message from the compiler used to compile this code. GTEST_API_ ::std::string FormatFileLocation(const char* file, int line) { const char* const file_name = file == NULL ? kUnknownFile : file; if (line < 0) { return String::Format("%s:", file_name).c_str(); } #ifdef _MSC_VER return String::Format("%s(%d):", file_name, line).c_str(); #else return String::Format("%s:%d:", file_name, line).c_str(); #endif // _MSC_VER } // Formats a file location for compiler-independent XML output. // Although this function is not platform dependent, we put it next to // FormatFileLocation in order to contrast the two functions. // Note that FormatCompilerIndependentFileLocation() does NOT append colon // to the file location it produces, unlike FormatFileLocation(). GTEST_API_ ::std::string FormatCompilerIndependentFileLocation( const char* file, int line) { const char* const file_name = file == NULL ? kUnknownFile : file; if (line < 0) return file_name; else return String::Format("%s:%d", file_name, line).c_str(); } GTestLog::GTestLog(GTestLogSeverity severity, const char* file, int line) : severity_(severity) { const char* const marker = severity == GTEST_INFO ? "[ INFO ]" : severity == GTEST_WARNING ? "[WARNING]" : severity == GTEST_ERROR ? "[ ERROR ]" : "[ FATAL ]"; GetStream() << ::std::endl << marker << " " << FormatFileLocation(file, line).c_str() << ": "; } // Flushes the buffers and, if severity is GTEST_FATAL, aborts the program. GTestLog::~GTestLog() { GetStream() << ::std::endl; if (severity_ == GTEST_FATAL) { fflush(stderr); posix::Abort(); } } // Disable Microsoft deprecation warnings for POSIX functions called from // this class (creat, dup, dup2, and close) #ifdef _MSC_VER # pragma warning(push) # pragma warning(disable: 4996) #endif // _MSC_VER #if GTEST_HAS_STREAM_REDIRECTION // Object that captures an output stream (stdout/stderr). class CapturedStream { public: // The ctor redirects the stream to a temporary file. CapturedStream(int fd) : fd_(fd), uncaptured_fd_(dup(fd)) { # if GTEST_OS_WINDOWS char temp_dir_path[MAX_PATH + 1] = { '\0' }; // NOLINT char temp_file_path[MAX_PATH + 1] = { '\0' }; // NOLINT ::GetTempPathA(sizeof(temp_dir_path), temp_dir_path); const UINT success = ::GetTempFileNameA(temp_dir_path, "gtest_redir", 0, // Generate unique file name. temp_file_path); GTEST_CHECK_(success != 0) << "Unable to create a temporary file in " << temp_dir_path; const int captured_fd = creat(temp_file_path, _S_IREAD | _S_IWRITE); GTEST_CHECK_(captured_fd != -1) << "Unable to open temporary file " << temp_file_path; filename_ = temp_file_path; # else // There's no guarantee that a test has write access to the // current directory, so we create the temporary file in the /tmp // directory instead. char name_template[] = "/tmp/captured_stream.XXXXXX"; const int captured_fd = mkstemp(name_template); filename_ = name_template; # endif // GTEST_OS_WINDOWS fflush(NULL); dup2(captured_fd, fd_); close(captured_fd); } ~CapturedStream() { remove(filename_.c_str()); } String GetCapturedString() { if (uncaptured_fd_ != -1) { // Restores the original stream. fflush(NULL); dup2(uncaptured_fd_, fd_); close(uncaptured_fd_); uncaptured_fd_ = -1; } FILE* const file = posix::FOpen(filename_.c_str(), "r"); const String content = ReadEntireFile(file); posix::FClose(file); return content; } private: // Reads the entire content of a file as a String. static String ReadEntireFile(FILE* file); // Returns the size (in bytes) of a file. static size_t GetFileSize(FILE* file); const int fd_; // A stream to capture. int uncaptured_fd_; // Name of the temporary file holding the stderr output. ::std::string filename_; GTEST_DISALLOW_COPY_AND_ASSIGN_(CapturedStream); }; // Returns the size (in bytes) of a file. size_t CapturedStream::GetFileSize(FILE* file) { fseek(file, 0, SEEK_END); return static_cast(ftell(file)); } // Reads the entire content of a file as a string. String CapturedStream::ReadEntireFile(FILE* file) { const size_t file_size = GetFileSize(file); char* const buffer = new char[file_size]; size_t bytes_last_read = 0; // # of bytes read in the last fread() size_t bytes_read = 0; // # of bytes read so far fseek(file, 0, SEEK_SET); // Keeps reading the file until we cannot read further or the // pre-determined file size is reached. do { bytes_last_read = fread(buffer+bytes_read, 1, file_size-bytes_read, file); bytes_read += bytes_last_read; } while (bytes_last_read > 0 && bytes_read < file_size); const String content(buffer, bytes_read); delete[] buffer; return content; } # ifdef _MSC_VER # pragma warning(pop) # endif // _MSC_VER static CapturedStream* g_captured_stderr = NULL; static CapturedStream* g_captured_stdout = NULL; // Starts capturing an output stream (stdout/stderr). void CaptureStream(int fd, const char* stream_name, CapturedStream** stream) { if (*stream != NULL) { GTEST_LOG_(FATAL) << "Only one " << stream_name << " capturer can exist at a time."; } *stream = new CapturedStream(fd); } // Stops capturing the output stream and returns the captured string. String GetCapturedStream(CapturedStream** captured_stream) { const String content = (*captured_stream)->GetCapturedString(); delete *captured_stream; *captured_stream = NULL; return content; } // Starts capturing stdout. void CaptureStdout() { CaptureStream(kStdOutFileno, "stdout", &g_captured_stdout); } // Starts capturing stderr. void CaptureStderr() { CaptureStream(kStdErrFileno, "stderr", &g_captured_stderr); } // Stops capturing stdout and returns the captured string. String GetCapturedStdout() { return GetCapturedStream(&g_captured_stdout); } // Stops capturing stderr and returns the captured string. String GetCapturedStderr() { return GetCapturedStream(&g_captured_stderr); } #endif // GTEST_HAS_STREAM_REDIRECTION #if GTEST_HAS_DEATH_TEST // A copy of all command line arguments. Set by InitGoogleTest(). ::std::vector g_argvs; // Returns the command line as a vector of strings. const ::std::vector& GetArgvs() { return g_argvs; } #endif // GTEST_HAS_DEATH_TEST #if GTEST_OS_WINDOWS_MOBILE namespace posix { void Abort() { DebugBreak(); TerminateProcess(GetCurrentProcess(), 1); } } // namespace posix #endif // GTEST_OS_WINDOWS_MOBILE // Returns the name of the environment variable corresponding to the // given flag. For example, FlagToEnvVar("foo") will return // "GTEST_FOO" in the open-source version. static String FlagToEnvVar(const char* flag) { const String full_flag = (Message() << GTEST_FLAG_PREFIX_ << flag).GetString(); Message env_var; for (size_t i = 0; i != full_flag.length(); i++) { env_var << ToUpper(full_flag.c_str()[i]); } return env_var.GetString(); } // Parses 'str' for a 32-bit signed integer. If successful, writes // the result to *value and returns true; otherwise leaves *value // unchanged and returns false. bool ParseInt32(const Message& src_text, const char* str, Int32* value) { // Parses the environment variable as a decimal integer. char* end = NULL; const long long_value = strtol(str, &end, 10); // NOLINT // Has strtol() consumed all characters in the string? if (*end != '\0') { // No - an invalid character was encountered. Message msg; msg << "WARNING: " << src_text << " is expected to be a 32-bit integer, but actually" << " has value \"" << str << "\".\n"; printf("%s", msg.GetString().c_str()); fflush(stdout); return false; } // Is the parsed value in the range of an Int32? const Int32 result = static_cast(long_value); if (long_value == LONG_MAX || long_value == LONG_MIN || // The parsed value overflows as a long. (strtol() returns // LONG_MAX or LONG_MIN when the input overflows.) result != long_value // The parsed value overflows as an Int32. ) { Message msg; msg << "WARNING: " << src_text << " is expected to be a 32-bit integer, but actually" << " has value " << str << ", which overflows.\n"; printf("%s", msg.GetString().c_str()); fflush(stdout); return false; } *value = result; return true; } // Reads and returns the Boolean environment variable corresponding to // the given flag; if it's not set, returns default_value. // // The value is considered true iff it's not "0". bool BoolFromGTestEnv(const char* flag, bool default_value) { const String env_var = FlagToEnvVar(flag); const char* const string_value = posix::GetEnv(env_var.c_str()); return string_value == NULL ? default_value : strcmp(string_value, "0") != 0; } // Reads and returns a 32-bit integer stored in the environment // variable corresponding to the given flag; if it isn't set or // doesn't represent a valid 32-bit integer, returns default_value. Int32 Int32FromGTestEnv(const char* flag, Int32 default_value) { const String env_var = FlagToEnvVar(flag); const char* const string_value = posix::GetEnv(env_var.c_str()); if (string_value == NULL) { // The environment variable is not set. return default_value; } Int32 result = default_value; if (!ParseInt32(Message() << "Environment variable " << env_var, string_value, &result)) { printf("The default value %s is used.\n", (Message() << default_value).GetString().c_str()); fflush(stdout); return default_value; } return result; } // Reads and returns the string environment variable corresponding to // the given flag; if it's not set, returns default_value. const char* StringFromGTestEnv(const char* flag, const char* default_value) { const String env_var = FlagToEnvVar(flag); const char* const value = posix::GetEnv(env_var.c_str()); return value == NULL ? default_value : value; } } // namespace internal } // namespace testing // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan) // Google Test - The Google C++ Testing Framework // // This file implements a universal value printer that can print a // value of any type T: // // void ::testing::internal::UniversalPrinter::Print(value, ostream_ptr); // // It uses the << operator when possible, and prints the bytes in the // object otherwise. A user can override its behavior for a class // type Foo by defining either operator<<(::std::ostream&, const Foo&) // or void PrintTo(const Foo&, ::std::ostream*) in the namespace that // defines Foo. #include #include #include // NOLINT #include namespace testing { namespace { using ::std::ostream; #if GTEST_OS_WINDOWS_MOBILE // Windows CE does not define _snprintf_s. # define snprintf _snprintf #elif _MSC_VER >= 1400 // VC 8.0 and later deprecate snprintf and _snprintf. # define snprintf _snprintf_s #elif _MSC_VER # define snprintf _snprintf #endif // GTEST_OS_WINDOWS_MOBILE // Prints a segment of bytes in the given object. void PrintByteSegmentInObjectTo(const unsigned char* obj_bytes, size_t start, size_t count, ostream* os) { char text[5] = ""; for (size_t i = 0; i != count; i++) { const size_t j = start + i; if (i != 0) { // Organizes the bytes into groups of 2 for easy parsing by // human. if ((j % 2) == 0) *os << ' '; else *os << '-'; } snprintf(text, sizeof(text), "%02X", obj_bytes[j]); *os << text; } } // Prints the bytes in the given value to the given ostream. void PrintBytesInObjectToImpl(const unsigned char* obj_bytes, size_t count, ostream* os) { // Tells the user how big the object is. *os << count << "-byte object <"; const size_t kThreshold = 132; const size_t kChunkSize = 64; // If the object size is bigger than kThreshold, we'll have to omit // some details by printing only the first and the last kChunkSize // bytes. // TODO(wan): let the user control the threshold using a flag. if (count < kThreshold) { PrintByteSegmentInObjectTo(obj_bytes, 0, count, os); } else { PrintByteSegmentInObjectTo(obj_bytes, 0, kChunkSize, os); *os << " ... "; // Rounds up to 2-byte boundary. const size_t resume_pos = (count - kChunkSize + 1)/2*2; PrintByteSegmentInObjectTo(obj_bytes, resume_pos, count - resume_pos, os); } *os << ">"; } } // namespace namespace internal2 { // Delegates to PrintBytesInObjectToImpl() to print the bytes in the // given object. The delegation simplifies the implementation, which // uses the << operator and thus is easier done outside of the // ::testing::internal namespace, which contains a << operator that // sometimes conflicts with the one in STL. void PrintBytesInObjectTo(const unsigned char* obj_bytes, size_t count, ostream* os) { PrintBytesInObjectToImpl(obj_bytes, count, os); } } // namespace internal2 namespace internal { // Depending on the value of a char (or wchar_t), we print it in one // of three formats: // - as is if it's a printable ASCII (e.g. 'a', '2', ' '), // - as a hexidecimal escape sequence (e.g. '\x7F'), or // - as a special escape sequence (e.g. '\r', '\n'). enum CharFormat { kAsIs, kHexEscape, kSpecialEscape }; // Returns true if c is a printable ASCII character. We test the // value of c directly instead of calling isprint(), which is buggy on // Windows Mobile. inline bool IsPrintableAscii(wchar_t c) { return 0x20 <= c && c <= 0x7E; } // Prints a wide or narrow char c as a character literal without the // quotes, escaping it when necessary; returns how c was formatted. // The template argument UnsignedChar is the unsigned version of Char, // which is the type of c. template static CharFormat PrintAsCharLiteralTo(Char c, ostream* os) { switch (static_cast(c)) { case L'\0': *os << "\\0"; break; case L'\'': *os << "\\'"; break; case L'\\': *os << "\\\\"; break; case L'\a': *os << "\\a"; break; case L'\b': *os << "\\b"; break; case L'\f': *os << "\\f"; break; case L'\n': *os << "\\n"; break; case L'\r': *os << "\\r"; break; case L'\t': *os << "\\t"; break; case L'\v': *os << "\\v"; break; default: if (IsPrintableAscii(c)) { *os << static_cast(c); return kAsIs; } else { *os << String::Format("\\x%X", static_cast(c)); return kHexEscape; } } return kSpecialEscape; } // Prints a char c as if it's part of a string literal, escaping it when // necessary; returns how c was formatted. static CharFormat PrintAsWideStringLiteralTo(wchar_t c, ostream* os) { switch (c) { case L'\'': *os << "'"; return kAsIs; case L'"': *os << "\\\""; return kSpecialEscape; default: return PrintAsCharLiteralTo(c, os); } } // Prints a char c as if it's part of a string literal, escaping it when // necessary; returns how c was formatted. static CharFormat PrintAsNarrowStringLiteralTo(char c, ostream* os) { return PrintAsWideStringLiteralTo(static_cast(c), os); } // Prints a wide or narrow character c and its code. '\0' is printed // as "'\\0'", other unprintable characters are also properly escaped // using the standard C++ escape sequence. The template argument // UnsignedChar is the unsigned version of Char, which is the type of c. template void PrintCharAndCodeTo(Char c, ostream* os) { // First, print c as a literal in the most readable form we can find. *os << ((sizeof(c) > 1) ? "L'" : "'"); const CharFormat format = PrintAsCharLiteralTo(c, os); *os << "'"; // To aid user debugging, we also print c's code in decimal, unless // it's 0 (in which case c was printed as '\\0', making the code // obvious). if (c == 0) return; *os << " (" << String::Format("%d", c).c_str(); // For more convenience, we print c's code again in hexidecimal, // unless c was already printed in the form '\x##' or the code is in // [1, 9]. if (format == kHexEscape || (1 <= c && c <= 9)) { // Do nothing. } else { *os << String::Format(", 0x%X", static_cast(c)).c_str(); } *os << ")"; } void PrintTo(unsigned char c, ::std::ostream* os) { PrintCharAndCodeTo(c, os); } void PrintTo(signed char c, ::std::ostream* os) { PrintCharAndCodeTo(c, os); } // Prints a wchar_t as a symbol if it is printable or as its internal // code otherwise and also as its code. L'\0' is printed as "L'\\0'". void PrintTo(wchar_t wc, ostream* os) { PrintCharAndCodeTo(wc, os); } // Prints the given array of characters to the ostream. // The array starts at *begin, the length is len, it may include '\0' characters // and may not be null-terminated. static void PrintCharsAsStringTo(const char* begin, size_t len, ostream* os) { *os << "\""; bool is_previous_hex = false; for (size_t index = 0; index < len; ++index) { const char cur = begin[index]; if (is_previous_hex && IsXDigit(cur)) { // Previous character is of '\x..' form and this character can be // interpreted as another hexadecimal digit in its number. Break string to // disambiguate. *os << "\" \""; } is_previous_hex = PrintAsNarrowStringLiteralTo(cur, os) == kHexEscape; } *os << "\""; } // Prints a (const) char array of 'len' elements, starting at address 'begin'. void UniversalPrintArray(const char* begin, size_t len, ostream* os) { PrintCharsAsStringTo(begin, len, os); } // Prints the given array of wide characters to the ostream. // The array starts at *begin, the length is len, it may include L'\0' // characters and may not be null-terminated. static void PrintWideCharsAsStringTo(const wchar_t* begin, size_t len, ostream* os) { *os << "L\""; bool is_previous_hex = false; for (size_t index = 0; index < len; ++index) { const wchar_t cur = begin[index]; if (is_previous_hex && isascii(cur) && IsXDigit(static_cast(cur))) { // Previous character is of '\x..' form and this character can be // interpreted as another hexadecimal digit in its number. Break string to // disambiguate. *os << "\" L\""; } is_previous_hex = PrintAsWideStringLiteralTo(cur, os) == kHexEscape; } *os << "\""; } // Prints the given C string to the ostream. void PrintTo(const char* s, ostream* os) { if (s == NULL) { *os << "NULL"; } else { *os << ImplicitCast_(s) << " pointing to "; PrintCharsAsStringTo(s, strlen(s), os); } } // MSVC compiler can be configured to define whar_t as a typedef // of unsigned short. Defining an overload for const wchar_t* in that case // would cause pointers to unsigned shorts be printed as wide strings, // possibly accessing more memory than intended and causing invalid // memory accesses. MSVC defines _NATIVE_WCHAR_T_DEFINED symbol when // wchar_t is implemented as a native type. #if !defined(_MSC_VER) || defined(_NATIVE_WCHAR_T_DEFINED) // Prints the given wide C string to the ostream. void PrintTo(const wchar_t* s, ostream* os) { if (s == NULL) { *os << "NULL"; } else { *os << ImplicitCast_(s) << " pointing to "; PrintWideCharsAsStringTo(s, wcslen(s), os); } } #endif // wchar_t is native // Prints a ::string object. #if GTEST_HAS_GLOBAL_STRING void PrintStringTo(const ::string& s, ostream* os) { PrintCharsAsStringTo(s.data(), s.size(), os); } #endif // GTEST_HAS_GLOBAL_STRING void PrintStringTo(const ::std::string& s, ostream* os) { PrintCharsAsStringTo(s.data(), s.size(), os); } // Prints a ::wstring object. #if GTEST_HAS_GLOBAL_WSTRING void PrintWideStringTo(const ::wstring& s, ostream* os) { PrintWideCharsAsStringTo(s.data(), s.size(), os); } #endif // GTEST_HAS_GLOBAL_WSTRING #if GTEST_HAS_STD_WSTRING void PrintWideStringTo(const ::std::wstring& s, ostream* os) { PrintWideCharsAsStringTo(s.data(), s.size(), os); } #endif // GTEST_HAS_STD_WSTRING } // namespace internal } // namespace testing // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: mheule@google.com (Markus Heule) // // The Google C++ Testing Framework (Google Test) // Indicates that this translation unit is part of Google Test's // implementation. It must come before gtest-internal-inl.h is // included, or there will be a compiler error. This trick is to // prevent a user from accidentally including gtest-internal-inl.h in // his code. #define GTEST_IMPLEMENTATION_ 1 #undef GTEST_IMPLEMENTATION_ namespace testing { using internal::GetUnitTestImpl; // Gets the summary of the failure message by omitting the stack trace // in it. internal::String TestPartResult::ExtractSummary(const char* message) { const char* const stack_trace = strstr(message, internal::kStackTraceMarker); return stack_trace == NULL ? internal::String(message) : internal::String(message, stack_trace - message); } // Prints a TestPartResult object. std::ostream& operator<<(std::ostream& os, const TestPartResult& result) { return os << result.file_name() << ":" << result.line_number() << ": " << (result.type() == TestPartResult::kSuccess ? "Success" : result.type() == TestPartResult::kFatalFailure ? "Fatal failure" : "Non-fatal failure") << ":\n" << result.message() << std::endl; } // Appends a TestPartResult to the array. void TestPartResultArray::Append(const TestPartResult& result) { array_.push_back(result); } // Returns the TestPartResult at the given index (0-based). const TestPartResult& TestPartResultArray::GetTestPartResult(int index) const { if (index < 0 || index >= size()) { printf("\nInvalid index (%d) into TestPartResultArray.\n", index); internal::posix::Abort(); } return array_[index]; } // Returns the number of TestPartResult objects in the array. int TestPartResultArray::size() const { return static_cast(array_.size()); } namespace internal { HasNewFatalFailureHelper::HasNewFatalFailureHelper() : has_new_fatal_failure_(false), original_reporter_(GetUnitTestImpl()-> GetTestPartResultReporterForCurrentThread()) { GetUnitTestImpl()->SetTestPartResultReporterForCurrentThread(this); } HasNewFatalFailureHelper::~HasNewFatalFailureHelper() { GetUnitTestImpl()->SetTestPartResultReporterForCurrentThread( original_reporter_); } void HasNewFatalFailureHelper::ReportTestPartResult( const TestPartResult& result) { if (result.fatally_failed()) has_new_fatal_failure_ = true; original_reporter_->ReportTestPartResult(result); } } // namespace internal } // namespace testing // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan) namespace testing { namespace internal { #if GTEST_HAS_TYPED_TEST_P // Skips to the first non-space char in str. Returns an empty string if str // contains only whitespace characters. static const char* SkipSpaces(const char* str) { while (IsSpace(*str)) str++; return str; } // Verifies that registered_tests match the test names in // defined_test_names_; returns registered_tests if successful, or // aborts the program otherwise. const char* TypedTestCasePState::VerifyRegisteredTestNames( const char* file, int line, const char* registered_tests) { typedef ::std::set::const_iterator DefinedTestIter; registered_ = true; // Skip initial whitespace in registered_tests since some // preprocessors prefix stringizied literals with whitespace. registered_tests = SkipSpaces(registered_tests); Message errors; ::std::set tests; for (const char* names = registered_tests; names != NULL; names = SkipComma(names)) { const String name = GetPrefixUntilComma(names); if (tests.count(name) != 0) { errors << "Test " << name << " is listed more than once.\n"; continue; } bool found = false; for (DefinedTestIter it = defined_test_names_.begin(); it != defined_test_names_.end(); ++it) { if (name == *it) { found = true; break; } } if (found) { tests.insert(name); } else { errors << "No test named " << name << " can be found in this test case.\n"; } } for (DefinedTestIter it = defined_test_names_.begin(); it != defined_test_names_.end(); ++it) { if (tests.count(*it) == 0) { errors << "You forgot to list test " << *it << ".\n"; } } const String& errors_str = errors.GetString(); if (errors_str != "") { fprintf(stderr, "%s %s", FormatFileLocation(file, line).c_str(), errors_str.c_str()); fflush(stderr); posix::Abort(); } return registered_tests; } #endif // GTEST_HAS_TYPED_TEST_P } // namespace internal } // namespace testing armory-0.92.3/cppForSwig/gtest/CppBlockUtilsTests.cpp0000644000000000000000000103206612414772654021316 0ustar rootroot#include #include #include #include "gtest.h" #include "../log.h" #include "../BinaryData.h" #include "../BtcUtils.h" #include "../BlockObj.h" #include "../StoredBlockObj.h" #include "../PartialMerkle.h" #include "../leveldb_wrapper.h" #include "../BlockUtils.h" #include "../EncryptionUtils.h" #ifdef _MSC_VER #ifdef mlock #undef mlock #undef munlock #endif #include "win32_posix.h" #undef close #endif #define READHEX BinaryData::CreateFromHex #define TheBDM BlockDataManager_LevelDB::GetInstance() /* This didn't work at all class BitcoinEnvironment : public ::testing::Environment { public: // Override this to define how to set up the environment. virtual void SetUp() { rawHead_ = READHEX( "01000000" "1d8f4ec0443e1f19f305e488c1085c95de7cc3fd25e0d2c5bb5d000000000000" "9762547903d36881a86751f3f5049e23050113f779735ef82734ebf0b4450081" "d8c8c84d" "b3936a1a" "334b035b"); headHashLE_ = READHEX( "1195e67a7a6d0674bbd28ae096d602e1f038c8254b49dfe79d47000000000000"); headHashBE_ = READHEX( "000000000000479de7df494b25c838f0e102d696e08ad2bb74066d7a7ae69511"); rawTx0_ = READHEX( "01000000016290dce984203b6a5032e543e9e272d8bce934c7de4d15fa0fe44d" "d49ae4ece9010000008b48304502204f2fa458d439f957308bca264689aa175e" "3b7c5f78a901cb450ebd20936b2c500221008ea3883a5b80128e55c9c6070aa6" "264e1e0ce3d18b7cd7e85108ce3d18b7419a0141044202550a5a6d3bb81549c4" "a7803b1ad59cdbba4770439a4923624a8acfc7d34900beb54a24188f7f0a4068" "9d905d4847cc7d6c8d808a457d833c2d44ef83f76bffffffff0242582c0a0000" "00001976a914c1b4695d53b6ee57a28647ce63e45665df6762c288ac80d1f008" "000000001976a9140e0aec36fe2545fb31a41164fb6954adcd96b34288ac0000" "0000"); rawTx1_ = READHEX( "0100000001f658dbc28e703d86ee17c9a2d3b167a8508b082fa0745f55be5144" "a4369873aa010000008c49304602210041e1186ca9a41fdfe1569d5d807ca7ff" "6c5ffd19d2ad1be42f7f2a20cdc8f1cc0221003366b5d64fe81e53910e156914" "091d12646bc0d1d662b7a65ead3ebe4ab8f6c40141048d103d81ac9691cf13f3" "fc94e44968ef67b27f58b27372c13108552d24a6ee04785838f34624b294afee" "83749b64478bb8480c20b242c376e77eea2b3dc48b4bffffffff0200e1f50500" "0000001976a9141b00a2f6899335366f04b277e19d777559c35bc888ac40aeeb" "02000000001976a9140e0aec36fe2545fb31a41164fb6954adcd96b34288ac00" "000000"); rawBlock_ = READHEX( "01000000eb10c9a996a2340a4d74eaab41421ed8664aa49d18538bab59010000" "000000005a2f06efa9f2bd804f17877537f2080030cadbfa1eb50e02338117cc" "604d91b9b7541a4ecfbb0a1a64f1ade703010000000100000000000000000000" "00000000000000000000000000000000000000000000ffffffff0804cfbb0a1a" "02360affffffff0100f2052a01000000434104c2239c4eedb3beb26785753463" "be3ec62b82f6acd62efb65f452f8806f2ede0b338e31d1f69b1ce449558d7061" "aa1648ddc2bf680834d3986624006a272dc21cac000000000100000003e8caa1" "2bcb2e7e86499c9de49c45c5a1c6167ea4b894c8c83aebba1b6100f343010000" "008c493046022100e2f5af5329d1244807f8347a2c8d9acc55a21a5db769e927" "4e7e7ba0bb605b26022100c34ca3350df5089f3415d8af82364d7f567a6a297f" "cc2c1d2034865633238b8c014104129e422ac490ddfcb7b1c405ab9fb4244124" "6c4bca578de4f27b230de08408c64cad03af71ee8a3140b40408a7058a1984a9" "f246492386113764c1ac132990d1ffffffff5b55c18864e16c08ef9989d31c7a" "343e34c27c30cd7caa759651b0e08cae0106000000008c4930460221009ec9aa" "3e0caf7caa321723dea561e232603e00686d4bfadf46c5c7352b07eb00022100" "a4f18d937d1e2354b2e69e02b18d11620a6a9332d563e9e2bbcb01cee559680a" "014104411b35dd963028300e36e82ee8cf1b0c8d5bf1fc4273e970469f5cb931" "ee07759a2de5fef638961726d04bd5eb4e5072330b9b371e479733c942964bb8" "6e2b22ffffffff3de0c1e913e6271769d8c0172cea2f00d6d3240afc3a20f9fa" "247ce58af30d2a010000008c493046022100b610e169fd15ac9f60fe2b507529" "281cf2267673f4690ba428cbb2ba3c3811fd022100ffbe9e3d71b21977a8e97f" "de4c3ba47b896d08bc09ecb9d086bb59175b5b9f03014104ff07a1833fd8098b" "25f48c66dcf8fde34cbdbcc0f5f21a8c2005b160406cbf34cc432842c6b37b25" "90d16b165b36a3efc9908d65fb0e605314c9b278f40f3e1affffffff0240420f" "00000000001976a914adfa66f57ded1b655eb4ccd96ee07ca62bc1ddfd88ac00" "7d6a7d040000001976a914981a0c9ae61fa8f8c96ae6f8e383d6e07e77133e88" "ac00000000010000000138e7586e0784280df58bd3dc5e3d350c9036b1ec4107" "951378f45881799c92a4000000008a47304402207c945ae0bbdaf9dadba07bdf" "23faa676485a53817af975ddf85a104f764fb93b02201ac6af32ddf597e610b4" "002e41f2de46664587a379a0161323a85389b4f82dda014104ec8883d3e4f7a3" "9d75c9f5bb9fd581dc9fb1b7cdf7d6b5a665e4db1fdb09281a74ab138a2dba25" "248b5be38bf80249601ae688c90c6e0ac8811cdb740fcec31dffffffff022f66" "ac61050000001976a914964642290c194e3bfab661c1085e47d67786d2d388ac" "2f77e200000000001976a9141486a7046affd935919a3cb4b50a8a0c233c286c" "88ac00000000"); rawTxUnfrag_ = READHEX( // Version "01000000" // NumTxIn "02" // Start TxIn0 "0044fbc929d78e4203eed6f1d3d39c0157d8e5c100bbe0886779c0" "ebf6a69324010000008a47304402206568144ed5e7064d6176c74738b04c08ca" "19ca54ddeb480084b77f45eebfe57802207927d6975a5ac0e1bb36f5c05356dc" "da1f521770511ee5e03239c8e1eecf3aed0141045d74feae58c4c36d7c35beac" "05eddddc78b3ce4b02491a2eea72043978056a8bc439b99ddaad327207b09ef1" "6a8910828e805b0cc8c11fba5caea2ee939346d7ffffffff" // Start TxIn1 "45c866b219b17695" "2508f8e5aea728f950186554fc4a5807e2186a8e1c4009e5000000008c493046" "022100bd5d41662f98cfddc46e86ea7e4a3bc8fe9f1dfc5c4836eaf7df582596" "cfe0e9022100fc459ae4f59b8279d679003b88935896acd10021b6e2e4619377" "e336b5296c5e014104c00bab76a708ba7064b2315420a1c533ca9945eeff9754" "cdc574224589e9113469b4e71752146a10028079e04948ecdf70609bf1b9801f" "6b73ab75947ac339e5ffffffff" // NumTxOut "02" // Start TxOut0 "ac4c8bd5000000001976a9148dce8946f1c7763bb60ea5cf16ef514cbed0633b88ac" // Start TxOut1 "002f6859000000001976a9146a59ac0e8f553f292dfe5e9f3aaa1da93499c15e88ac" // Locktime "00000000"); rawTxFragged_ = READHEX( //"01000000020044fbc929d78e4203eed6f1d3d39c0157d8e5c100bbe0886779c0" //"ebf6a69324010000008a47304402206568144ed5e7064d6176c74738b04c08ca" //"19ca54ddeb480084b77f45eebfe57802207927d6975a5ac0e1bb36f5c05356dc" //"da1f521770511ee5e03239c8e1eecf3aed0141045d74feae58c4c36d7c35beac" //"05eddddc78b3ce4b02491a2eea72043978056a8bc439b99ddaad327207b09ef1" //"6a8910828e805b0cc8c11fba5caea2ee939346d7ffffffff45c866b219b17695" //"2508f8e5aea728f950186554fc4a5807e2186a8e1c4009e5000000008c493046" //"022100bd5d41662f98cfddc46e86ea7e4a3bc8fe9f1dfc5c4836eaf7df582596" //"cfe0e9022100fc459ae4f59b8279d679003b88935896acd10021b6e2e4619377" //"e336b5296c5e014104c00bab76a708ba7064b2315420a1c533ca9945eeff9754" //"cdc574224589e9113469b4e71752146a10028079e04948ecdf70609bf1b9801f" //"6b73ab75947ac339e5ffffffff0200000000"); // Version "01000000" // NumTxIn "02" // Start TxIn0 "0044fbc929d78e4203eed6f1d3d39c0157d8e5c100bbe0886779c0" "ebf6a69324010000008a47304402206568144ed5e7064d6176c74738b04c08ca" "19ca54ddeb480084b77f45eebfe57802207927d6975a5ac0e1bb36f5c05356dc" "da1f521770511ee5e03239c8e1eecf3aed0141045d74feae58c4c36d7c35beac" "05eddddc78b3ce4b02491a2eea72043978056a8bc439b99ddaad327207b09ef1" "6a8910828e805b0cc8c11fba5caea2ee939346d7ffffffff" // Start TxIn1 "45c866b219b17695" "2508f8e5aea728f950186554fc4a5807e2186a8e1c4009e5000000008c493046" "022100bd5d41662f98cfddc46e86ea7e4a3bc8fe9f1dfc5c4836eaf7df582596" "cfe0e9022100fc459ae4f59b8279d679003b88935896acd10021b6e2e4619377" "e336b5296c5e014104c00bab76a708ba7064b2315420a1c533ca9945eeff9754" "cdc574224589e9113469b4e71752146a10028079e04948ecdf70609bf1b9801f" "6b73ab75947ac339e5ffffffff" // NumTxOut "02" // ... TxOuts fragged out // Locktime "00000000"); rawTxOut0_ = READHEX( // Value "ac4c8bd500000000" // Script size (var_int) "19" // Script "76""a9""14""8dce8946f1c7763bb60ea5cf16ef514cbed0633b""88""ac"); rawTxOut1_ = READHEX( // Value "002f685900000000" // Script size (var_int) "19" // Script "76""a9""14""6a59ac0e8f553f292dfe5e9f3aaa1da93499c15e""88""ac"); bh_.unserialize(rawHead_); tx1_.unserialize(rawTx0_); tx2_.unserialize(rawTx1_); sbh_.unserialize(rawHead_); // Make sure the global DB type and prune type are reset for each test DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); } BinaryData rawHead_; BinaryData headHashLE_; BinaryData headHashBE_; BinaryData rawBlock_; BinaryData rawTx0_; BinaryData rawTx1_; BlockHeader bh_; Tx tx1_; Tx tx2_; BinaryData rawTxUnfrag_; BinaryData rawTxFragged_; BinaryData rawTxOut0_; BinaryData rawTxOut1_; StoredHeader sbh_; }; ::testing::Environment* const btcenv = ::testing::AddGlobalTestEnvironment(new BitcoinEnvironment); */ //////////////////////////////////////////////////////////////////////////////// class BinaryDataTest : public ::testing::Test { protected: virtual void SetUp(void) { str0_ = ""; str4_ = "1234abcd"; str5_ = "1234abcdef"; bd0_ = READHEX(str0_); bd4_ = READHEX(str4_); bd5_ = READHEX(str5_); } string str0_; string str4_; string str5_; BinaryData bd0_; BinaryData bd4_; BinaryData bd5_; }; //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataTest, Constructor) { uint8_t* ptr = new uint8_t[4]; BinaryData a; BinaryData b(4); BinaryData c(ptr, 2); BinaryData d(ptr, 4); BinaryData e(b); BinaryData f(string("xyza")); EXPECT_EQ(a.getSize(), 0); EXPECT_EQ(b.getSize(), 4); EXPECT_EQ(c.getSize(), 2); EXPECT_EQ(d.getSize(), 4); EXPECT_EQ(e.getSize(), 4); EXPECT_EQ(f.getSize(), 4); EXPECT_TRUE( a.isNull()); EXPECT_FALSE(b.isNull()); EXPECT_FALSE(c.isNull()); EXPECT_FALSE(d.isNull()); EXPECT_FALSE(e.isNull()); BinaryDataRef g(f); BinaryDataRef h(d); BinaryData i(g); EXPECT_EQ( g.getSize(), 4); EXPECT_EQ( i.getSize(), 4); EXPECT_TRUE( g==f); EXPECT_FALSE(g==h); EXPECT_TRUE( i==g); delete[] ptr; } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataTest, CopyFrom) { BinaryData a,b,c,d,e,f; a.copyFrom((uint8_t*)bd0_.getPtr(), bd0_.getSize()); b.copyFrom((uint8_t*)bd4_.getPtr(), (uint8_t*)bd4_.getPtr()+4); c.copyFrom((uint8_t*)bd4_.getPtr(), bd4_.getSize()); d.copyFrom(str5_); e.copyFrom(a); BinaryDataRef i(b); f.copyFrom(i); EXPECT_EQ(a.getSize(), 0); EXPECT_EQ(b.getSize(), 4); EXPECT_EQ(c.getSize(), 4); EXPECT_EQ(a,e); EXPECT_EQ(b,c); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataTest, CopyTo) { BinaryData a,b,c,d,e,f,g,h; bd0_.copyTo(a); bd4_.copyTo(b); c.resize(bd5_.getSize()); bd5_.copyTo(c.getPtr()); size_t sz = 2; d.resize(sz); e.resize(sz); bd5_.copyTo(d.getPtr(), sz); bd5_.copyTo(e.getPtr(), bd5_.getSize()-sz, sz); f.copyFrom(bd5_.getPtr(), bd5_.getPtr()+sz); EXPECT_TRUE(a==bd0_); EXPECT_TRUE(b==bd4_); EXPECT_TRUE(c==bd5_); EXPECT_TRUE(bd5_.startsWith(d)); EXPECT_TRUE(bd5_.endsWith(e)); EXPECT_TRUE(d==f); EXPECT_EQ(a.getSize(), 0); EXPECT_EQ(b.getSize(), 4); EXPECT_EQ(c.getSize(), 5); EXPECT_EQ(d.getSize(), 2); EXPECT_NE(b,c); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataTest, Fill) { BinaryData a(0), b(1), c(4); BinaryData aAns = READHEX(""); BinaryData bAns = READHEX("aa"); BinaryData cAns = READHEX("aaaaaaaa"); a.fill(0xaa); b.fill(0xaa); c.fill(0xaa); EXPECT_EQ(a, aAns); EXPECT_EQ(b, bAns); EXPECT_EQ(c, cAns); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataTest, IndexOp) { EXPECT_EQ(bd4_[0], 0x12); EXPECT_EQ(bd4_[1], 0x34); EXPECT_EQ(bd4_[2], 0xab); EXPECT_EQ(bd4_[3], 0xcd); EXPECT_EQ(bd4_[-4], 0x12); EXPECT_EQ(bd4_[-3], 0x34); EXPECT_EQ(bd4_[-2], 0xab); EXPECT_EQ(bd4_[-1], 0xcd); bd4_[1] = 0xff; EXPECT_EQ(bd4_[0], 0x12); EXPECT_EQ(bd4_[1], 0xff); EXPECT_EQ(bd4_[2], 0xab); EXPECT_EQ(bd4_[3], 0xcd); EXPECT_EQ(bd4_[-4], 0x12); EXPECT_EQ(bd4_[-3], 0xff); EXPECT_EQ(bd4_[-2], 0xab); EXPECT_EQ(bd4_[-1], 0xcd); EXPECT_EQ(bd4_.toHexStr(), string("12ffabcd")); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataTest, StartsEndsWith) { BinaryData a = READHEX("abcd"); EXPECT_TRUE( bd0_.startsWith(bd0_)); EXPECT_TRUE( bd4_.startsWith(bd0_)); EXPECT_TRUE( bd5_.startsWith(bd4_)); EXPECT_TRUE( bd5_.startsWith(bd5_)); EXPECT_FALSE(bd4_.startsWith(bd5_)); EXPECT_TRUE( bd0_.startsWith(bd0_)); EXPECT_FALSE(bd0_.startsWith(bd4_)); EXPECT_FALSE(bd5_.endsWith(a)); EXPECT_TRUE( bd4_.endsWith(a)); EXPECT_FALSE(bd0_.endsWith(a)); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataTest, Append) { BinaryData a = READHEX("ef"); BinaryData static4 = bd4_; BinaryData b = bd4_ + a; BinaryData c = bd4_.append(a); BinaryDataRef d(a); bd4_.copyFrom(static4); BinaryData e = bd4_.append(d); bd4_.copyFrom(static4); BinaryData f = bd4_.append(a.getPtr(), 1); bd4_.copyFrom(static4); BinaryData g = bd4_.append(0xef); BinaryData h = bd0_ + a; BinaryData i = bd0_.append(a); bd0_.resize(0); BinaryData j = bd0_.append(a.getPtr(), 1); bd0_.resize(0); BinaryData k = bd0_.append(0xef); EXPECT_EQ(bd5_, b); EXPECT_EQ(bd5_, c); EXPECT_EQ(bd5_, e); EXPECT_EQ(bd5_, f); EXPECT_EQ(bd5_, g); EXPECT_NE(bd5_, h); EXPECT_EQ(a, h); EXPECT_EQ(a, i); EXPECT_EQ(a, j); EXPECT_EQ(a, k); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataTest, Inequality) { EXPECT_FALSE(bd0_ < bd0_); EXPECT_TRUE( bd0_ < bd4_); EXPECT_TRUE( bd0_ < bd5_); EXPECT_FALSE(bd4_ < bd0_); EXPECT_FALSE(bd4_ < bd4_); EXPECT_TRUE( bd4_ < bd5_); EXPECT_FALSE(bd5_ < bd0_); EXPECT_FALSE(bd5_ < bd4_); EXPECT_FALSE(bd5_ < bd5_); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataTest, Equality) { EXPECT_TRUE( bd0_==bd0_); EXPECT_TRUE( bd4_==bd4_); EXPECT_FALSE(bd4_==bd5_); EXPECT_TRUE( bd0_!=bd4_); EXPECT_TRUE( bd0_!=bd5_); EXPECT_TRUE( bd4_!=bd5_); EXPECT_FALSE(bd4_!=bd4_); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataTest, ToString) { EXPECT_EQ(bd0_.toHexStr(), str0_); EXPECT_EQ(bd4_.toHexStr(), str4_); EXPECT_EQ(bd4_.toHexStr(), str4_); string a,b; bd0_.copyTo(a); bd4_.copyTo(b); EXPECT_EQ(bd0_.toBinStr(), a); EXPECT_EQ(bd4_.toBinStr(), b); string stra("cdab3412"); BinaryData bda = READHEX(stra); EXPECT_EQ(bd4_.toHexStr(true), stra); EXPECT_EQ(bd4_.toBinStr(true), bda.toBinStr()); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataTest, Endianness) { BinaryData a = READHEX("cdab3412"); BinaryData b = READHEX("1234cdab"); BinaryData static4 = bd4_; EXPECT_EQ( a.copySwapEndian(), bd4_); EXPECT_EQ(bd4_.copySwapEndian(), a); EXPECT_EQ(bd0_.copySwapEndian(), bd0_); bd4_ = static4; bd4_.swapEndian(); EXPECT_EQ(bd4_, a); bd4_ = static4; bd4_.swapEndian(2); EXPECT_EQ(bd4_, b); bd4_ = static4; bd4_.swapEndian(2,2); EXPECT_EQ(bd4_, b); bd4_ = static4; bd4_.swapEndian(2,4); EXPECT_EQ(bd4_, b); } TEST_F(BinaryDataTest, IntToBinData) { // 0x1234 in src code is always interpreted by the compiler as // big-endian, regardless of the underlying architecture. So // writing 0x1234 will be interpretted as an integer with value // 4660 on all architectures. BinaryData a,b; a = BinaryData::IntToStrLE(0xab); b = BinaryData::IntToStrBE(0xab); EXPECT_EQ(a, READHEX("ab")); EXPECT_EQ(b, READHEX("ab")); a = BinaryData::IntToStrLE(0xabcd); b = BinaryData::IntToStrBE(0xabcd); EXPECT_EQ(a, READHEX("cdab")); EXPECT_EQ(b, READHEX("abcd")); a = BinaryData::IntToStrLE((uint16_t)0xabcd); b = BinaryData::IntToStrBE((uint16_t)0xabcd); EXPECT_EQ(a, READHEX("cdab")); EXPECT_EQ(b, READHEX("abcd")); // This fails b/c it auto "promotes" non-suffix literals to 4-byte ints a = BinaryData::IntToStrLE(0xabcd); b = BinaryData::IntToStrBE(0xabcd); EXPECT_NE(a, READHEX("cdab")); EXPECT_NE(b, READHEX("abcd")); a = BinaryData::IntToStrLE(0xfec38a11); b = BinaryData::IntToStrBE(0xfec38a11); EXPECT_EQ(a, READHEX("118ac3fe")); EXPECT_EQ(b, READHEX("fec38a11")); a = BinaryData::IntToStrLE(0x00000000fec38a11ULL); b = BinaryData::IntToStrBE(0x00000000fec38a11ULL); EXPECT_EQ(a, READHEX("118ac3fe00000000")); EXPECT_EQ(b, READHEX("00000000fec38a11")); } TEST_F(BinaryDataTest, BinDataToInt) { uint8_t a8, b8; uint16_t a16, b16; uint32_t a32, b32; uint64_t a64, b64; a8 = BinaryData::StrToIntBE(READHEX("ab")); b8 = BinaryData::StrToIntLE(READHEX("ab")); EXPECT_EQ(a8, 0xab); EXPECT_EQ(b8, 0xab); a16 = BinaryData::StrToIntBE(READHEX("abcd")); b16 = BinaryData::StrToIntLE(READHEX("abcd")); EXPECT_EQ(a16, 0xabcd); EXPECT_EQ(b16, 0xcdab); a32 = BinaryData::StrToIntBE(READHEX("fec38a11")); b32 = BinaryData::StrToIntLE(READHEX("fec38a11")); EXPECT_EQ(a32, 0xfec38a11); EXPECT_EQ(b32, 0x118ac3fe); a64 = BinaryData::StrToIntBE(READHEX("00000000fec38a11")); b64 = BinaryData::StrToIntLE(READHEX("00000000fec38a11")); EXPECT_EQ(a64, 0x00000000fec38a11); EXPECT_EQ(b64, 0x118ac3fe00000000); // These are really just identical tests, I have no idea whether it // was worth spending the time to write these, and even this comment // here explaining how it was probably a waste of time... a8 = READ_UINT8_BE(READHEX("ab")); b8 = READ_UINT8_LE(READHEX("ab")); EXPECT_EQ(a8, 0xab); EXPECT_EQ(b8, 0xab); a16 = READ_UINT16_BE(READHEX("abcd")); b16 = READ_UINT16_LE(READHEX("abcd")); EXPECT_EQ(a16, 0xabcd); EXPECT_EQ(b16, 0xcdab); a32 = READ_UINT32_BE(READHEX("fec38a11")); b32 = READ_UINT32_LE(READHEX("fec38a11")); EXPECT_EQ(a32, 0xfec38a11); EXPECT_EQ(b32, 0x118ac3fe); a64 = READ_UINT64_BE(READHEX("00000000fec38a11")); b64 = READ_UINT64_LE(READHEX("00000000fec38a11")); EXPECT_EQ(a64, 0x00000000fec38a11); EXPECT_EQ(b64, 0x118ac3fe00000000); // Test the all-on-one read-int macros a8 = READ_UINT8_HEX_BE("ab"); b8 = READ_UINT8_HEX_LE("ab"); EXPECT_EQ(a8, 0xab); EXPECT_EQ(b8, 0xab); a16 = READ_UINT16_HEX_BE("abcd"); b16 = READ_UINT16_HEX_LE("abcd"); EXPECT_EQ(a16, 0xabcd); EXPECT_EQ(b16, 0xcdab); a32 = READ_UINT32_HEX_BE("fec38a11"); b32 = READ_UINT32_HEX_LE("fec38a11"); EXPECT_EQ(a32, 0xfec38a11); EXPECT_EQ(b32, 0x118ac3fe); a64 = READ_UINT64_HEX_BE("00000000fec38a11"); b64 = READ_UINT64_HEX_LE("00000000fec38a11"); EXPECT_EQ(a64, 0x00000000fec38a11); EXPECT_EQ(b64, 0x118ac3fe00000000); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataTest, Find) { BinaryData a = READHEX("12"); BinaryData b = READHEX("34"); BinaryData c = READHEX("abcd"); BinaryData d = READHEX("ff"); EXPECT_EQ(bd0_.find(bd0_), 0); EXPECT_EQ(bd0_.find(bd4_), -1); EXPECT_EQ(bd0_.find(bd4_, 2), -1); EXPECT_EQ(bd4_.find(bd0_), 0); EXPECT_EQ(bd4_.find(bd0_, 2), 2); EXPECT_EQ(bd4_.find(a), 0); EXPECT_EQ(bd4_.find(b), 1); EXPECT_EQ(bd4_.find(c), 2); EXPECT_EQ(bd4_.find(d), -1); EXPECT_EQ(bd4_.find(a, 0), 0); EXPECT_EQ(bd4_.find(b, 0), 1); EXPECT_EQ(bd4_.find(c, 0), 2); EXPECT_EQ(bd4_.find(d, 0), -1); EXPECT_EQ(bd4_.find(a, 1), -1); EXPECT_EQ(bd4_.find(b, 1), 1); EXPECT_EQ(bd4_.find(c, 1), 2); EXPECT_EQ(bd4_.find(d, 1), -1); EXPECT_EQ(bd4_.find(a, 4), -1); EXPECT_EQ(bd4_.find(b, 4), -1); EXPECT_EQ(bd4_.find(c, 4), -1); EXPECT_EQ(bd4_.find(d, 4), -1); EXPECT_EQ(bd4_.find(a, 8), -1); EXPECT_EQ(bd4_.find(b, 8), -1); EXPECT_EQ(bd4_.find(c, 8), -1); EXPECT_EQ(bd4_.find(d, 8), -1); } TEST_F(BinaryDataTest, Contains) { BinaryData a = READHEX("12"); BinaryData b = READHEX("34"); BinaryData c = READHEX("abcd"); BinaryData d = READHEX("ff"); EXPECT_TRUE( bd0_.contains(bd0_)); EXPECT_FALSE(bd0_.contains(bd4_)); EXPECT_FALSE(bd0_.contains(bd4_, 2)); EXPECT_TRUE( bd4_.contains(a)); EXPECT_TRUE( bd4_.contains(b)); EXPECT_TRUE( bd4_.contains(c)); EXPECT_FALSE(bd4_.contains(d)); EXPECT_TRUE( bd4_.contains(a, 0)); EXPECT_TRUE( bd4_.contains(b, 0)); EXPECT_TRUE( bd4_.contains(c, 0)); EXPECT_FALSE(bd4_.contains(d, 0)); EXPECT_FALSE(bd4_.contains(a, 1)); EXPECT_TRUE( bd4_.contains(b, 1)); EXPECT_TRUE( bd4_.contains(c, 1)); EXPECT_FALSE(bd4_.contains(d, 1)); EXPECT_FALSE(bd4_.contains(a, 4)); EXPECT_FALSE(bd4_.contains(b, 4)); EXPECT_FALSE(bd4_.contains(c, 4)); EXPECT_FALSE(bd4_.contains(d, 4)); EXPECT_FALSE(bd4_.contains(a, 8)); EXPECT_FALSE(bd4_.contains(b, 8)); EXPECT_FALSE(bd4_.contains(c, 8)); EXPECT_FALSE(bd4_.contains(d, 8)); } //////////////////////////////////////////////////////////////////////////////// //TEST_F(BinaryDataTest, GenerateRandom) //{ // Yeah, this would be a fun one to try to test... //} //////////////////////////////////////////////////////////////////////////////// //TEST_F(BinaryDataTest, ReadFile) //{ //ofstream os("test //} //////////////////////////////////////////////////////////////////////////////// class BinaryDataRefTest : public ::testing::Test { protected: virtual void SetUp(void) { str0_ = ""; str4_ = "1234abcd"; str5_ = "1234abcdef"; bd0_ = READHEX(str0_); bd4_ = READHEX(str4_); bd5_ = READHEX(str5_); bdr__ = BinaryDataRef(); bdr0_ = BinaryDataRef(bd0_); bdr4_ = BinaryDataRef(bd4_); bdr5_ = BinaryDataRef(bd5_); } string str0_; string str4_; string str5_; BinaryData bd0_; BinaryData bd4_; BinaryData bd5_; BinaryDataRef bdr__; BinaryDataRef bdr0_; BinaryDataRef bdr4_; BinaryDataRef bdr5_; }; //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataRefTest, Constructor) { BinaryDataRef a; BinaryDataRef b((uint8_t*)bd0_.getPtr(), bd0_.getSize()); BinaryDataRef c((uint8_t*)bd0_.getPtr(), (uint8_t*)bd0_.getPtr()); BinaryDataRef d((uint8_t*)bd4_.getPtr(), bd4_.getSize()); BinaryDataRef e((uint8_t*)bd4_.getPtr(), (uint8_t*)bd4_.getPtr()+4); BinaryDataRef f(bd0_); BinaryDataRef g(bd4_); BinaryDataRef h(str0_); BinaryDataRef i(str4_); EXPECT_TRUE(a.getPtr()==NULL); EXPECT_EQ(a.getSize(), 0); EXPECT_TRUE(b.getPtr()==NULL); EXPECT_EQ(b.getSize(), 0); EXPECT_TRUE(c.getPtr()==NULL); EXPECT_EQ(c.getSize(), 0); EXPECT_FALSE(d.getPtr()==NULL); EXPECT_EQ(d.getSize(), 4); EXPECT_FALSE(e.getPtr()==NULL); EXPECT_EQ(e.getSize(), 4); EXPECT_TRUE(f.getPtr()==NULL); EXPECT_EQ(f.getSize(), 0); EXPECT_FALSE(g.getPtr()==NULL); EXPECT_EQ(g.getSize(), 4); EXPECT_TRUE(h.getPtr()==NULL); EXPECT_EQ(h.getSize(), 0); EXPECT_FALSE(i.getPtr()==NULL); EXPECT_EQ(i.getSize(), 8); EXPECT_TRUE( a.isNull()); EXPECT_TRUE( b.isNull()); EXPECT_TRUE( c.isNull()); EXPECT_FALSE(d.isNull()); EXPECT_FALSE(e.isNull()); EXPECT_TRUE( f.isNull()); EXPECT_FALSE(g.isNull()); EXPECT_TRUE( h.isNull()); EXPECT_FALSE(i.isNull()); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataRefTest, PostConstruct) { BinaryDataRef a,b,c,d,e,f,g,h,i; b.setRef((uint8_t*)bd0_.getPtr(), bd0_.getSize()); c.setRef((uint8_t*)bd0_.getPtr(), (uint8_t*)bd0_.getPtr()); d.setRef((uint8_t*)bd4_.getPtr(), bd4_.getSize()); e.setRef((uint8_t*)bd4_.getPtr(), (uint8_t*)bd4_.getPtr()+4); f.setRef(bd0_); g.setRef(bd4_); h.setRef(str0_); i.setRef(str4_); EXPECT_TRUE(a.getPtr()==NULL); EXPECT_EQ(a.getSize(), 0); EXPECT_TRUE(b.getPtr()==NULL); EXPECT_EQ(b.getSize(), 0); EXPECT_TRUE(c.getPtr()==NULL); EXPECT_EQ(c.getSize(), 0); EXPECT_FALSE(d.getPtr()==NULL); EXPECT_EQ(d.getSize(), 4); EXPECT_FALSE(e.getPtr()==NULL); EXPECT_EQ(e.getSize(), 4); EXPECT_TRUE(f.getPtr()==NULL); EXPECT_EQ(f.getSize(), 0); EXPECT_FALSE(g.getPtr()==NULL); EXPECT_EQ(g.getSize(), 4); EXPECT_FALSE(h.getPtr()==NULL); EXPECT_EQ(h.getSize(), 0); EXPECT_FALSE(i.getPtr()==NULL); EXPECT_EQ(i.getSize(), 8); EXPECT_TRUE( a.isNull()); EXPECT_TRUE( b.isNull()); EXPECT_TRUE( c.isNull()); EXPECT_FALSE(d.isNull()); EXPECT_FALSE(e.isNull()); EXPECT_TRUE( f.isNull()); EXPECT_FALSE(g.isNull()); EXPECT_FALSE(h.isNull()); EXPECT_FALSE(i.isNull()); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataRefTest, CopyTo) { BinaryData a,b,c,d,e,f,g,h; bdr0_.copyTo(a); bdr4_.copyTo(b); c.resize(bdr5_.getSize()); bdr5_.copyTo(c.getPtr()); size_t sz = 2; d.resize(sz); e.resize(sz); bdr5_.copyTo(d.getPtr(), sz); bdr5_.copyTo(e.getPtr(), bdr5_.getSize()-sz, sz); f.copyFrom(bdr5_.getPtr(), bdr5_.getPtr()+sz); EXPECT_TRUE(a==bdr0_); EXPECT_TRUE(b==bdr4_); EXPECT_TRUE(c==bdr5_); EXPECT_TRUE(bdr5_.startsWith(d)); EXPECT_TRUE(bdr5_.endsWith(e)); EXPECT_TRUE(d==f); EXPECT_EQ(a.getSize(), 0); EXPECT_EQ(b.getSize(), 4); EXPECT_EQ(c.getSize(), 5); EXPECT_EQ(d.getSize(), 2); EXPECT_NE(b,c); g = bdr0_.copy(); h = bdr4_.copy(); EXPECT_EQ(g, bdr0_); EXPECT_EQ(h, bdr4_); EXPECT_EQ(g, bdr0_.copy()); EXPECT_EQ(h, bdr4_.copy()); EXPECT_EQ(bdr0_, g); EXPECT_EQ(bdr4_, h); EXPECT_EQ(bdr0_.copy(), g); EXPECT_EQ(bdr4_.copy(), h); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataRefTest, ToString) { EXPECT_EQ(bdr0_.toHexStr(), str0_); EXPECT_EQ(bdr4_.toHexStr(), str4_); EXPECT_EQ(bdr4_.toHexStr(), str4_); string a,b; bdr0_.copyTo(a); bdr4_.copyTo(b); EXPECT_EQ(bd0_.toBinStr(), a); EXPECT_EQ(bd4_.toBinStr(), b); string stra("cdab3412"); BinaryData bda = READHEX(stra); EXPECT_EQ(bdr4_.toHexStr(true), stra); EXPECT_EQ(bdr4_.toBinStr(true), bda.toBinStr()); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataRefTest, Find) { BinaryData a = READHEX("12"); BinaryData b = READHEX("34"); BinaryData c = READHEX("abcd"); BinaryData d = READHEX("ff"); EXPECT_EQ(bdr0_.find(bdr0_), 0); EXPECT_EQ(bdr0_.find(bdr4_), -1); EXPECT_EQ(bdr0_.find(bdr4_, 2), -1); EXPECT_EQ(bdr4_.find(bdr0_), 0); EXPECT_EQ(bdr4_.find(bdr0_, 2), 2); EXPECT_EQ(bdr4_.find(a), 0); EXPECT_EQ(bdr4_.find(b), 1); EXPECT_EQ(bdr4_.find(c), 2); EXPECT_EQ(bdr4_.find(d), -1); EXPECT_EQ(bdr4_.find(a, 0), 0); EXPECT_EQ(bdr4_.find(b, 0), 1); EXPECT_EQ(bdr4_.find(c, 0), 2); EXPECT_EQ(bdr4_.find(d, 0), -1); EXPECT_EQ(bdr4_.find(a, 1), -1); EXPECT_EQ(bdr4_.find(b, 1), 1); EXPECT_EQ(bdr4_.find(c, 1), 2); EXPECT_EQ(bdr4_.find(d, 1), -1); EXPECT_EQ(bdr4_.find(a, 4), -1); EXPECT_EQ(bdr4_.find(b, 4), -1); EXPECT_EQ(bdr4_.find(c, 4), -1); EXPECT_EQ(bdr4_.find(d, 4), -1); EXPECT_EQ(bdr4_.find(a, 8), -1); EXPECT_EQ(bdr4_.find(b, 8), -1); EXPECT_EQ(bdr4_.find(c, 8), -1); EXPECT_EQ(bdr4_.find(d, 8), -1); EXPECT_EQ(bdr4_.find(a.getRef(), 0), 0); EXPECT_EQ(bdr4_.find(b.getRef(), 0), 1); EXPECT_EQ(bdr4_.find(c.getRef(), 0), 2); EXPECT_EQ(bdr4_.find(d.getRef(), 0), -1); } TEST_F(BinaryDataRefTest, Contains) { BinaryData a = READHEX("12"); BinaryData b = READHEX("34"); BinaryData c = READHEX("abcd"); BinaryData d = READHEX("ff"); EXPECT_TRUE( bdr0_.contains(bdr0_)); EXPECT_FALSE(bdr0_.contains(bdr4_)); EXPECT_FALSE(bdr0_.contains(bdr4_, 2)); EXPECT_TRUE( bdr4_.contains(a)); EXPECT_TRUE( bdr4_.contains(b)); EXPECT_TRUE( bdr4_.contains(c)); EXPECT_FALSE(bdr4_.contains(d)); EXPECT_TRUE( bdr4_.contains(a, 0)); EXPECT_TRUE( bdr4_.contains(b, 0)); EXPECT_TRUE( bdr4_.contains(c, 0)); EXPECT_FALSE(bdr4_.contains(d, 0)); EXPECT_FALSE(bdr4_.contains(a, 1)); EXPECT_TRUE( bdr4_.contains(b, 1)); EXPECT_TRUE( bdr4_.contains(c, 1)); EXPECT_FALSE(bdr4_.contains(d, 1)); EXPECT_FALSE(bdr4_.contains(a, 4)); EXPECT_FALSE(bdr4_.contains(b, 4)); EXPECT_FALSE(bdr4_.contains(c, 4)); EXPECT_FALSE(bdr4_.contains(d, 4)); EXPECT_FALSE(bdr4_.contains(a, 8)); EXPECT_FALSE(bdr4_.contains(b, 8)); EXPECT_FALSE(bdr4_.contains(c, 8)); EXPECT_FALSE(bdr4_.contains(d, 8)); EXPECT_TRUE( bdr4_.contains(a.getRef(), 0)); EXPECT_TRUE( bdr4_.contains(b.getRef(), 0)); EXPECT_TRUE( bdr4_.contains(c.getRef(), 0)); EXPECT_FALSE(bdr4_.contains(d.getRef(), 0)); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataRefTest, StartsEndsWith) { BinaryData a = READHEX("abcd"); EXPECT_TRUE( bdr0_.startsWith(bdr0_)); EXPECT_TRUE( bdr4_.startsWith(bdr0_)); EXPECT_TRUE( bdr5_.startsWith(bdr4_)); EXPECT_TRUE( bdr5_.startsWith(bdr5_)); EXPECT_FALSE(bdr4_.startsWith(bdr5_)); EXPECT_TRUE( bdr0_.startsWith(bdr0_)); EXPECT_FALSE(bdr0_.startsWith(bdr4_)); EXPECT_TRUE( bdr0_.startsWith(bd0_)); EXPECT_TRUE( bdr4_.startsWith(bd0_)); EXPECT_TRUE( bdr5_.startsWith(bd4_)); EXPECT_TRUE( bdr5_.startsWith(bd5_)); EXPECT_FALSE(bdr4_.startsWith(bd5_)); EXPECT_TRUE( bdr0_.startsWith(bd0_)); EXPECT_FALSE(bdr0_.startsWith(bd4_)); EXPECT_FALSE(bdr5_.endsWith(a)); EXPECT_TRUE( bdr4_.endsWith(a)); EXPECT_FALSE(bdr0_.endsWith(a)); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataRefTest, Inequality) { EXPECT_FALSE(bdr0_ < bdr0_); EXPECT_TRUE( bdr0_ < bdr4_); EXPECT_TRUE( bdr0_ < bdr5_); EXPECT_FALSE(bdr4_ < bdr0_); EXPECT_FALSE(bdr4_ < bdr4_); EXPECT_TRUE( bdr4_ < bdr5_); EXPECT_FALSE(bdr5_ < bdr0_); EXPECT_FALSE(bdr5_ < bdr4_); EXPECT_FALSE(bdr5_ < bdr5_); EXPECT_FALSE(bdr0_ < bd0_); EXPECT_TRUE( bdr0_ < bd4_); EXPECT_TRUE( bdr0_ < bd5_); EXPECT_FALSE(bdr4_ < bd0_); EXPECT_FALSE(bdr4_ < bd4_); EXPECT_TRUE( bdr4_ < bd5_); EXPECT_FALSE(bdr5_ < bd0_); EXPECT_FALSE(bdr5_ < bd4_); EXPECT_FALSE(bdr5_ < bd5_); EXPECT_FALSE(bdr0_ > bdr0_); EXPECT_TRUE( bdr4_ > bdr0_); EXPECT_TRUE( bdr5_ > bdr0_); EXPECT_FALSE(bdr0_ > bdr4_); EXPECT_FALSE(bdr4_ > bdr4_); EXPECT_TRUE( bdr5_ > bdr4_); EXPECT_FALSE(bdr0_ > bdr5_); EXPECT_FALSE(bdr4_ > bdr5_); EXPECT_FALSE(bdr5_ > bdr5_); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BinaryDataRefTest, Equality) { EXPECT_TRUE( bdr0_==bdr0_); EXPECT_TRUE( bdr4_==bdr4_); EXPECT_FALSE(bdr4_==bdr5_); EXPECT_TRUE( bdr0_!=bdr4_); EXPECT_TRUE( bdr0_!=bdr5_); EXPECT_TRUE( bdr4_!=bdr5_); EXPECT_FALSE(bdr4_!=bdr4_); EXPECT_TRUE( bdr0_==bd0_); EXPECT_TRUE( bdr4_==bd4_); EXPECT_FALSE(bdr4_==bd5_); EXPECT_TRUE( bdr0_!=bd4_); EXPECT_TRUE( bdr0_!=bd5_); EXPECT_TRUE( bdr4_!=bd5_); EXPECT_FALSE(bdr4_!=bd4_); } //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// TEST(BitReadWriteTest, Writer8) { BitPacker bitp; //EXPECT_EQ( bitp.getValue(), 0); EXPECT_EQ( bitp.getBitsUsed(), 0); EXPECT_EQ( bitp.getBinaryData(), READHEX("00")); bitp.putBit(true); //EXPECT_EQ( bitp.getValue(), 128); EXPECT_EQ( bitp.getBitsUsed(), 1); EXPECT_EQ( bitp.getBinaryData(), READHEX("80")); bitp.putBit(false); //EXPECT_EQ( bitp.getValue(), 128); EXPECT_EQ( bitp.getBitsUsed(), 2); EXPECT_EQ( bitp.getBinaryData(), READHEX("80")); bitp.putBit(true); //EXPECT_EQ( bitp.getValue(), 160); EXPECT_EQ( bitp.getBitsUsed(), 3); EXPECT_EQ( bitp.getBinaryData(), READHEX("a0")); bitp.putBits(0, 2); //EXPECT_EQ( bitp.getValue(), 160); EXPECT_EQ( bitp.getBitsUsed(), 5); EXPECT_EQ( bitp.getBinaryData(), READHEX("a0")); bitp.putBits(3, 3); //EXPECT_EQ( bitp.getValue(), 163); EXPECT_EQ( bitp.getBitsUsed(), 8); EXPECT_EQ( bitp.getBinaryData(), READHEX("a3")); } //////////////////////////////////////////////////////////////////////////////// TEST(BitReadWriteTest, Writer16) { BitPacker bitp; //EXPECT_EQ( bitp.getValue(), 0); EXPECT_EQ( bitp.getBitsUsed(), 0); EXPECT_EQ( bitp.getBinaryData(), READHEX("0000")); bitp.putBit(true); //EXPECT_EQ( bitp.getValue(), 0x8000); EXPECT_EQ( bitp.getBitsUsed(), 1); EXPECT_EQ( bitp.getBinaryData(), READHEX("8000")); bitp.putBit(false); //EXPECT_EQ( bitp.getValue(), 0x8000); EXPECT_EQ( bitp.getBitsUsed(), 2); EXPECT_EQ( bitp.getBinaryData(), READHEX("8000")); bitp.putBit(true); //EXPECT_EQ( bitp.getValue(), 0xa000); EXPECT_EQ( bitp.getBitsUsed(), 3); EXPECT_EQ( bitp.getBinaryData(), READHEX("a000")); bitp.putBits(0, 2); //EXPECT_EQ( bitp.getValue(), 0xa000); EXPECT_EQ( bitp.getBitsUsed(), 5); EXPECT_EQ( bitp.getBinaryData(), READHEX("a000")); bitp.putBits(3, 3); //EXPECT_EQ( bitp.getValue(), 0xa300); EXPECT_EQ( bitp.getBitsUsed(), 8); EXPECT_EQ( bitp.getBinaryData(), READHEX("a300")); bitp.putBits(3, 8); //EXPECT_EQ( bitp.getValue(), 0xa303); EXPECT_EQ( bitp.getBitsUsed(), 16); EXPECT_EQ( bitp.getBinaryData(), READHEX("a303")); } //////////////////////////////////////////////////////////////////////////////// TEST(BitReadWriteTest, Writer32) { BitPacker bitp; bitp.putBits(0xffffff00, 32); //EXPECT_EQ( bitp.getValue(), 0xffffff00); EXPECT_EQ( bitp.getBitsUsed(), 32); EXPECT_EQ( bitp.getBinaryData(), READHEX("ffffff00")); } //////////////////////////////////////////////////////////////////////////////// TEST(BitReadWriteTest, Writer64) { BitPacker bitp; bitp.putBits(0xffffff00ffffffaaULL, 64); //EXPECT_EQ( bitp.getValue(), 0xffffff00ffffffaaULL); EXPECT_EQ( bitp.getBitsUsed(), 64); EXPECT_EQ( bitp.getBinaryData(), READHEX("ffffff00ffffffaa")); BitPacker bitp2; bitp2.putBits(0xff, 32); bitp2.putBits(0xff, 32); //EXPECT_EQ( bitp2.getValue(), 0x000000ff000000ffULL); EXPECT_EQ( bitp2.getBitsUsed(), 64); EXPECT_EQ( bitp2.getBinaryData(), READHEX("000000ff000000ff")); } //////////////////////////////////////////////////////////////////////////////// TEST(BitReadWriteTest, Reader8) { BitUnpacker bitu; bitu.setValue(0xa3); EXPECT_TRUE( bitu.getBit()); EXPECT_FALSE(bitu.getBit()); EXPECT_TRUE( bitu.getBit()); EXPECT_EQ( bitu.getBits(2), 0); EXPECT_EQ( bitu.getBits(3), 3); } //////////////////////////////////////////////////////////////////////////////// TEST(BitReadWriteTest, Reader16) { BitUnpacker bitu; bitu.setValue(0xa303); EXPECT_TRUE( bitu.getBit()); EXPECT_FALSE(bitu.getBit()); EXPECT_TRUE( bitu.getBit()); EXPECT_EQ( bitu.getBits(2), 0); EXPECT_EQ( bitu.getBits(3), 3); EXPECT_EQ( bitu.getBits(8), 3); } //////////////////////////////////////////////////////////////////////////////// TEST(BitReadWriteTest, Reader32) { BitUnpacker bitu(0xffffff00); EXPECT_EQ(bitu.getBits(32), 0xffffff00); } //////////////////////////////////////////////////////////////////////////////// TEST(BitReadWriteTest, Reader64) { BitUnpacker bitu(0xffffff00ffffffaaULL); EXPECT_EQ( bitu.getBits(64), 0xffffff00ffffffaaULL); } //////////////////////////////////////////////////////////////////////////////// TEST(BinaryReadWriteTest, Writer) { BinaryData out = READHEX("01""0100""013200aa""ff00ff00ff00ff00" "ab""fdffff""fe013200aa""ffff00ff00ff00ff00"); BinaryWriter bw; bw.put_uint8_t(1); EXPECT_EQ(bw.getSize(), 1); bw.put_uint16_t(1); EXPECT_EQ(bw.getSize(), 3); bw.put_uint32_t(0xaa003201); EXPECT_EQ(bw.getSize(), 7); bw.put_uint64_t(0x00ff00ff00ff00ffULL); EXPECT_EQ(bw.getSize(), 15); bw.put_var_int(0xab); EXPECT_EQ(bw.getSize(), 16); bw.put_var_int(0xffff); EXPECT_EQ(bw.getSize(), 19); bw.put_var_int(0xaa003201); EXPECT_EQ(bw.getSize(), 24); bw.put_var_int(0x00ff00ff00ff00ffULL); EXPECT_EQ(bw.getSize(), 33); EXPECT_EQ(bw.getData(), out); EXPECT_EQ(bw.getDataRef(), out.getRef()); } //////////////////////////////////////////////////////////////////////////////// TEST(BinaryReadWriteTest, WriterEndian) { BinaryData out = READHEX("01""0100""013200aa""ff00ff00ff00ff00" "ab""fdffff""fe013200aa""ffff00ff00ff00ff00"); BinaryWriter bw; bw.put_uint8_t(1); EXPECT_EQ(bw.getSize(), 1); bw.put_uint16_t(0x0100, BE); EXPECT_EQ(bw.getSize(), 3); bw.put_uint32_t(0x013200aa, BE); EXPECT_EQ(bw.getSize(), 7); bw.put_uint64_t(0xff00ff00ff00ff00ULL, BE); EXPECT_EQ(bw.getSize(), 15); bw.put_var_int(0xab); EXPECT_EQ(bw.getSize(), 16); bw.put_var_int(0xffff); EXPECT_EQ(bw.getSize(), 19); bw.put_var_int(0xaa003201); EXPECT_EQ(bw.getSize(), 24); bw.put_var_int(0x00ff00ff00ff00ffULL); EXPECT_EQ(bw.getSize(), 33); EXPECT_EQ(bw.getData(), out); EXPECT_EQ(bw.getDataRef(), out.getRef()); BinaryWriter bw2; bw2.put_uint8_t(1); EXPECT_EQ(bw2.getSize(), 1); bw2.put_uint16_t(0x0001, LE); EXPECT_EQ(bw2.getSize(), 3); bw2.put_uint32_t(0xaa003201, LE); EXPECT_EQ(bw2.getSize(), 7); bw2.put_uint64_t(0x00ff00ff00ff00ffULL, LE); EXPECT_EQ(bw2.getSize(), 15); bw2.put_var_int(0xab); EXPECT_EQ(bw2.getSize(), 16); bw2.put_var_int(0xffff); EXPECT_EQ(bw2.getSize(), 19); bw2.put_var_int(0xaa003201); EXPECT_EQ(bw2.getSize(), 24); bw2.put_var_int(0x00ff00ff00ff00ffULL); EXPECT_EQ(bw2.getSize(), 33); EXPECT_EQ(bw2.getData(), out); EXPECT_EQ(bw2.getDataRef(), out.getRef()); } //////////////////////////////////////////////////////////////////////////////// TEST(BinaryReadWriteTest, Reader) { BinaryData in = READHEX("01""0100""013200aa""ff00ff00ff00ff00" "ab""fdffff""fe013200aa""ffff00ff00ff00ff00"); BinaryReader br(in); EXPECT_EQ(br.get_uint8_t(), 1); EXPECT_EQ(br.get_uint16_t(), 1); EXPECT_EQ(br.get_uint32_t(), 0xaa003201); EXPECT_EQ(br.get_uint64_t(), 0x00ff00ff00ff00ffULL); EXPECT_EQ(br.get_var_int(), 0xab); EXPECT_EQ(br.get_var_int(), 0xffff); EXPECT_EQ(br.get_var_int(), 0xaa003201); EXPECT_EQ(br.get_var_int(), 0x00ff00ff00ff00ffULL); BinaryRefReader brr(in); EXPECT_EQ(brr.get_uint8_t(), 1); EXPECT_EQ(brr.get_uint16_t(), 1); EXPECT_EQ(brr.get_uint32_t(), 0xaa003201); EXPECT_EQ(brr.get_uint64_t(), 0x00ff00ff00ff00ffULL); EXPECT_EQ(brr.get_var_int(), 0xab); EXPECT_EQ(brr.get_var_int(), 0xffff); EXPECT_EQ(brr.get_var_int(), 0xaa003201); EXPECT_EQ(brr.get_var_int(), 0x00ff00ff00ff00ffULL); } //////////////////////////////////////////////////////////////////////////////// TEST(BinaryReadWriteTest, ReaderEndian) { BinaryData in = READHEX("01""0100""013200aa""ff00ff00ff00ff00" "ab""fdffff""fe013200aa""ffff00ff00ff00ff00"); BinaryReader br(in); EXPECT_EQ(br.get_uint8_t(LE), 1); EXPECT_EQ(br.get_uint16_t(LE), 1); EXPECT_EQ(br.get_uint32_t(LE), 0xaa003201); EXPECT_EQ(br.get_uint64_t(LE), 0x00ff00ff00ff00ffULL); EXPECT_EQ(br.get_var_int(), 0xab); EXPECT_EQ(br.get_var_int(), 0xffff); EXPECT_EQ(br.get_var_int(), 0xaa003201); EXPECT_EQ(br.get_var_int(), 0x00ff00ff00ff00ffULL); BinaryRefReader brr(in); EXPECT_EQ(brr.get_uint8_t(LE), 1); EXPECT_EQ(brr.get_uint16_t(LE), 1); EXPECT_EQ(brr.get_uint32_t(LE), 0xaa003201); EXPECT_EQ(brr.get_uint64_t(LE), 0x00ff00ff00ff00ffULL); EXPECT_EQ(brr.get_var_int(), 0xab); EXPECT_EQ(brr.get_var_int(), 0xffff); EXPECT_EQ(brr.get_var_int(), 0xaa003201); EXPECT_EQ(brr.get_var_int(), 0x00ff00ff00ff00ffULL); BinaryReader br2(in); EXPECT_EQ(br2.get_uint8_t(LITTLEENDIAN), 1); EXPECT_EQ(br2.get_uint16_t(LITTLEENDIAN), 1); EXPECT_EQ(br2.get_uint32_t(LITTLEENDIAN), 0xaa003201); EXPECT_EQ(br2.get_uint64_t(LITTLEENDIAN), 0x00ff00ff00ff00ffULL); EXPECT_EQ(br2.get_var_int(), 0xab); EXPECT_EQ(br2.get_var_int(), 0xffff); EXPECT_EQ(br2.get_var_int(), 0xaa003201); EXPECT_EQ(br2.get_var_int(), 0x00ff00ff00ff00ffULL); BinaryRefReader brr2(in); EXPECT_EQ(brr2.get_uint8_t(LITTLEENDIAN), 1); EXPECT_EQ(brr2.get_uint16_t(LITTLEENDIAN), 1); EXPECT_EQ(brr2.get_uint32_t(LITTLEENDIAN), 0xaa003201); EXPECT_EQ(brr2.get_uint64_t(LITTLEENDIAN), 0x00ff00ff00ff00ffULL); EXPECT_EQ(brr2.get_var_int(), 0xab); EXPECT_EQ(brr2.get_var_int(), 0xffff); EXPECT_EQ(brr2.get_var_int(), 0xaa003201); EXPECT_EQ(brr2.get_var_int(), 0x00ff00ff00ff00ffULL); BinaryReader brBE(in); EXPECT_EQ(brBE.get_uint8_t(BE), 1); EXPECT_EQ(brBE.get_uint16_t(BE), 0x0100); EXPECT_EQ(brBE.get_uint32_t(BE), 0x013200aa); EXPECT_EQ(brBE.get_uint64_t(BE), 0xff00ff00ff00ff00ULL); EXPECT_EQ(brBE.get_var_int(), 0xab); EXPECT_EQ(brBE.get_var_int(), 0xffff); EXPECT_EQ(brBE.get_var_int(), 0xaa003201); EXPECT_EQ(brBE.get_var_int(), 0x00ff00ff00ff00ffULL); BinaryRefReader brrBE(in); EXPECT_EQ(brrBE.get_uint8_t(BE), 1); EXPECT_EQ(brrBE.get_uint16_t(BE), 0x0100); EXPECT_EQ(brrBE.get_uint32_t(BE), 0x013200aa); EXPECT_EQ(brrBE.get_uint64_t(BE), 0xff00ff00ff00ff00ULL); EXPECT_EQ(brrBE.get_var_int(), 0xab); EXPECT_EQ(brrBE.get_var_int(), 0xffff); EXPECT_EQ(brrBE.get_var_int(), 0xaa003201); EXPECT_EQ(brrBE.get_var_int(), 0x00ff00ff00ff00ffULL); BinaryReader brBE2(in); EXPECT_EQ(brBE2.get_uint8_t(BIGENDIAN), 1); EXPECT_EQ(brBE2.get_uint16_t(BIGENDIAN), 0x0100); EXPECT_EQ(brBE2.get_uint32_t(BIGENDIAN), 0x013200aa); EXPECT_EQ(brBE2.get_uint64_t(BIGENDIAN), 0xff00ff00ff00ff00ULL); EXPECT_EQ(brBE2.get_var_int(), 0xab); EXPECT_EQ(brBE2.get_var_int(), 0xffff); EXPECT_EQ(brBE2.get_var_int(), 0xaa003201); EXPECT_EQ(brBE2.get_var_int(), 0x00ff00ff00ff00ffULL); BinaryRefReader brrBE2(in); EXPECT_EQ(brrBE2.get_uint8_t(BIGENDIAN), 1); EXPECT_EQ(brrBE2.get_uint16_t(BIGENDIAN), 0x0100); EXPECT_EQ(brrBE2.get_uint32_t(BIGENDIAN), 0x013200aa); EXPECT_EQ(brrBE2.get_uint64_t(BIGENDIAN), 0xff00ff00ff00ff00ULL); EXPECT_EQ(brrBE2.get_var_int(), 0xab); EXPECT_EQ(brrBE2.get_var_int(), 0xffff); EXPECT_EQ(brrBE2.get_var_int(), 0xaa003201); EXPECT_EQ(brrBE2.get_var_int(), 0x00ff00ff00ff00ffULL); } //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class BtcUtilsTest : public ::testing::Test { protected: virtual void SetUp(void) { rawHead_ = READHEX( "010000001d8f4ec0443e1f19f305e488c1085c95de7cc3fd25e0d2c5bb5d0000" "000000009762547903d36881a86751f3f5049e23050113f779735ef82734ebf0" "b4450081d8c8c84db3936a1a334b035b"); headHashLE_ = READHEX( "1195e67a7a6d0674bbd28ae096d602e1f038c8254b49dfe79d47000000000000"); headHashBE_ = READHEX( "000000000000479de7df494b25c838f0e102d696e08ad2bb74066d7a7ae69511"); satoshiPubKey_ = READHEX( "04" "fc9702847840aaf195de8442ebecedf5b095cdbb9bc716bda9110971b28a49e0" "ead8564ff0db22209e0374782c093bb899692d524e9d6a6956e7c5ecbcd68284"); satoshiHash160_ = READHEX("65a4358f4691660849d9f235eb05f11fabbd69fa"); prevHashCB_ = READHEX( "0000000000000000000000000000000000000000000000000000000000000000"); prevHashReg_ = READHEX( "894862e362905c6075074d9ec4b4e2dc34720089b1e9ef4738ee1b13f3bdcdb7"); } BinaryData rawHead_; BinaryData headHashLE_; BinaryData headHashBE_; BinaryData satoshiPubKey_; BinaryData satoshiHash160_; BinaryData prevHashCB_; BinaryData prevHashReg_; }; TEST_F(BtcUtilsTest, ReadVarInt) { BinaryData vi0 = READHEX("00"); BinaryData vi1 = READHEX("21"); BinaryData vi3 = READHEX("fdff00"); BinaryData vi5 = READHEX("fe00000100"); BinaryData vi9 = READHEX("ff0010a5d4e8000000"); uint64_t v = 0; uint64_t w = 33; uint64_t x = 255; uint64_t y = 65536; uint64_t z = 1000000000000ULL; BinaryRefReader brr; pair a; brr.setNewData(vi0); a = BtcUtils::readVarInt(brr); EXPECT_EQ(a.first, v); EXPECT_EQ(a.second, 1); brr.setNewData(vi1); a = BtcUtils::readVarInt(brr); EXPECT_EQ(a.first, w); EXPECT_EQ(a.second, 1); brr.setNewData(vi3); a = BtcUtils::readVarInt(brr); EXPECT_EQ(a.first, x); EXPECT_EQ(a.second, 3); brr.setNewData(vi5); a = BtcUtils::readVarInt(brr); EXPECT_EQ(a.first, y); EXPECT_EQ(a.second, 5); brr.setNewData(vi9); a = BtcUtils::readVarInt(brr); EXPECT_EQ(a.first, z); EXPECT_EQ(a.second, 9); // Just the length EXPECT_EQ(BtcUtils::readVarIntLength(vi0.getPtr()), 1); EXPECT_EQ(BtcUtils::readVarIntLength(vi1.getPtr()), 1); EXPECT_EQ(BtcUtils::readVarIntLength(vi3.getPtr()), 3); EXPECT_EQ(BtcUtils::readVarIntLength(vi5.getPtr()), 5); EXPECT_EQ(BtcUtils::readVarIntLength(vi9.getPtr()), 9); EXPECT_EQ(BtcUtils::calcVarIntSize(v), 1); EXPECT_EQ(BtcUtils::calcVarIntSize(w), 1); EXPECT_EQ(BtcUtils::calcVarIntSize(x), 3); EXPECT_EQ(BtcUtils::calcVarIntSize(y), 5); EXPECT_EQ(BtcUtils::calcVarIntSize(z), 9); } TEST_F(BtcUtilsTest, Num2Str) { EXPECT_EQ(BtcUtils::numToStrWCommas(0), string("0")); EXPECT_EQ(BtcUtils::numToStrWCommas(100), string("100")); EXPECT_EQ(BtcUtils::numToStrWCommas(-100), string("-100")); EXPECT_EQ(BtcUtils::numToStrWCommas(999), string("999")); EXPECT_EQ(BtcUtils::numToStrWCommas(1234), string("1,234")); EXPECT_EQ(BtcUtils::numToStrWCommas(-1234), string("-1,234")); EXPECT_EQ(BtcUtils::numToStrWCommas(12345678), string("12,345,678")); EXPECT_EQ(BtcUtils::numToStrWCommas(-12345678), string("-12,345,678")); } TEST_F(BtcUtilsTest, PackBits) { list::iterator iter, iter2; list bitList; bitList = BtcUtils::UnpackBits( READHEX("00"), 0); EXPECT_EQ(bitList.size(), 0); bitList = BtcUtils::UnpackBits( READHEX("00"), 3); EXPECT_EQ(bitList.size(), 3); iter = bitList.begin(); EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; bitList = BtcUtils::UnpackBits( READHEX("00"), 8); EXPECT_EQ(bitList.size(), 8); iter = bitList.begin(); EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; bitList = BtcUtils::UnpackBits( READHEX("017f"), 8); EXPECT_EQ(bitList.size(), 8); iter = bitList.begin(); EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_TRUE( *iter); iter++; bitList = BtcUtils::UnpackBits( READHEX("017f"), 12); EXPECT_EQ(bitList.size(), 12); iter = bitList.begin(); EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_TRUE( *iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_TRUE( *iter); iter++; EXPECT_TRUE( *iter); iter++; EXPECT_TRUE( *iter); iter++; bitList = BtcUtils::UnpackBits( READHEX("017f"), 16); EXPECT_EQ(bitList.size(), 16); iter = bitList.begin(); EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_TRUE( *iter); iter++; EXPECT_FALSE(*iter); iter++; EXPECT_TRUE( *iter); iter++; EXPECT_TRUE( *iter); iter++; EXPECT_TRUE( *iter); iter++; EXPECT_TRUE( *iter); iter++; EXPECT_TRUE( *iter); iter++; EXPECT_TRUE( *iter); iter++; EXPECT_TRUE( *iter); iter++; BinaryData packed; packed = BtcUtils::PackBits(bitList); EXPECT_EQ(packed, READHEX("017f")); bitList = BtcUtils::UnpackBits( READHEX("017f"), 12); packed = BtcUtils::PackBits(bitList); EXPECT_EQ(packed, READHEX("0170")); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, SimpleHash) { BinaryData hashOut; // sha256(sha256(X)); BtcUtils::getHash256(rawHead_.getPtr(), rawHead_.getSize(), hashOut); EXPECT_EQ(hashOut, headHashLE_); EXPECT_EQ(hashOut, headHashBE_.copySwapEndian()); BtcUtils::getHash256_NoSafetyCheck(rawHead_.getPtr(), rawHead_.getSize(), hashOut); EXPECT_EQ(hashOut, headHashLE_); EXPECT_EQ(hashOut, headHashBE_.copySwapEndian()); hashOut = BtcUtils::getHash256(rawHead_.getPtr(), rawHead_.getSize()); EXPECT_EQ(hashOut, headHashLE_); BtcUtils::getHash256(rawHead_, hashOut); EXPECT_EQ(hashOut, headHashLE_); BtcUtils::getHash256(rawHead_.getRef(), hashOut); EXPECT_EQ(hashOut, headHashLE_); hashOut = BtcUtils::getHash256(rawHead_); EXPECT_EQ(hashOut, headHashLE_); // ripemd160(sha256(X)); BtcUtils::getHash160(satoshiPubKey_.getPtr(), satoshiPubKey_.getSize(), hashOut); EXPECT_EQ(hashOut, satoshiHash160_); BtcUtils::getHash160(satoshiPubKey_.getPtr(), satoshiPubKey_.getSize(), hashOut); EXPECT_EQ(hashOut, satoshiHash160_); hashOut = BtcUtils::getHash160(satoshiPubKey_.getPtr(), satoshiPubKey_.getSize()); EXPECT_EQ(hashOut, satoshiHash160_); BtcUtils::getHash160(satoshiPubKey_, hashOut); EXPECT_EQ(hashOut, satoshiHash160_); BtcUtils::getHash160(satoshiPubKey_.getRef(), hashOut); EXPECT_EQ(hashOut, satoshiHash160_); hashOut = BtcUtils::getHash160(satoshiPubKey_); EXPECT_EQ(hashOut, satoshiHash160_); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, TxOutScriptID_Hash160) { //TXOUT_SCRIPT_STDHASH160, //TXOUT_SCRIPT_STDPUBKEY65, //TXOUT_SCRIPT_STDPUBKEY33, //TXOUT_SCRIPT_MULTISIG, //TXOUT_SCRIPT_P2SH, //TXOUT_SCRIPT_NONSTANDARD, BinaryData script = READHEX("76a914a134408afa258a50ed7a1d9817f26b63cc9002cc88ac"); BinaryData a160 = READHEX( "a134408afa258a50ed7a1d9817f26b63cc9002cc"); BinaryData unique = READHEX("00a134408afa258a50ed7a1d9817f26b63cc9002cc"); TXOUT_SCRIPT_TYPE scrType = BtcUtils::getTxOutScriptType(script); EXPECT_EQ(scrType, TXOUT_SCRIPT_STDHASH160 ); EXPECT_EQ(BtcUtils::getTxOutRecipientAddr(script), a160 ); EXPECT_EQ(BtcUtils::getTxOutRecipientAddr(script, scrType), a160 ); EXPECT_EQ(BtcUtils::getTxOutScrAddr(script), unique ); EXPECT_EQ(BtcUtils::getTxOutScrAddr(script, scrType), unique ); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, TxOutScriptID_PubKey65) { BinaryData script = READHEX( "4104b0bd634234abbb1ba1e986e884185c61cf43e001f9137f23c2c409273eb1" "6e6537a576782eba668a7ef8bd3b3cfb1edb7117ab65129b8a2e681f3c1e0908ef7bac"); BinaryData a160 = READHEX( "e24b86bff5112623ba67c63b6380636cbdf1a66d"); BinaryData unique = READHEX("00e24b86bff5112623ba67c63b6380636cbdf1a66d"); TXOUT_SCRIPT_TYPE scrType = BtcUtils::getTxOutScriptType(script); EXPECT_EQ(scrType, TXOUT_SCRIPT_STDPUBKEY65 ); EXPECT_EQ(BtcUtils::getTxOutRecipientAddr(script), a160 ); EXPECT_EQ(BtcUtils::getTxOutRecipientAddr(script, scrType), a160 ); EXPECT_EQ(BtcUtils::getTxOutScrAddr(script), unique ); EXPECT_EQ(BtcUtils::getTxOutScrAddr(script, scrType), unique ); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, TxOutScriptID_PubKey33) { BinaryData script = READHEX( "21024005c945d86ac6b01fb04258345abea7a845bd25689edb723d5ad4068ddd3036ac"); BinaryData a160 = READHEX( "0c1b83d01d0ffb2bccae606963376cca3863a7ce"); BinaryData unique = READHEX("000c1b83d01d0ffb2bccae606963376cca3863a7ce"); TXOUT_SCRIPT_TYPE scrType = BtcUtils::getTxOutScriptType(script); EXPECT_EQ(scrType, TXOUT_SCRIPT_STDPUBKEY33 ); EXPECT_EQ(BtcUtils::getTxOutRecipientAddr(script), a160 ); EXPECT_EQ(BtcUtils::getTxOutRecipientAddr(script, scrType), a160 ); EXPECT_EQ(BtcUtils::getTxOutScrAddr(script), unique ); EXPECT_EQ(BtcUtils::getTxOutScrAddr(script, scrType), unique ); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, TxOutScriptID_NonStd) { // This was from block 150951 which was erroneously produced by MagicalTux // This is not only non-standard, it's non-spendable BinaryData script = READHEX("76a90088ac"); BinaryData a160 = BtcUtils::BadAddress_; BinaryData unique = READHEX("ff") + BtcUtils::getHash160(READHEX("76a90088ac")); TXOUT_SCRIPT_TYPE scrType = BtcUtils::getTxOutScriptType(script); EXPECT_EQ(scrType, TXOUT_SCRIPT_NONSTANDARD ); EXPECT_EQ(BtcUtils::getTxOutRecipientAddr(script), a160 ); EXPECT_EQ(BtcUtils::getTxOutRecipientAddr(script, scrType), a160 ); EXPECT_EQ(BtcUtils::getTxOutScrAddr(script), unique ); EXPECT_EQ(BtcUtils::getTxOutScrAddr(script, scrType), unique ); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, TxOutScriptID_P2SH) { // P2SH script from tx: 4ac04b4830d115eb9a08f320ef30159cc107dfb72b29bbc2f370093f962397b4 (TxOut: 1) // Spent in tx: fd16d6bbf1a3498ca9777b9d31ceae883eb8cb6ede1fafbdd218bae107de66fe (TxIn: 1) // P2SH address: 3Lip6sxQymNr9LD2cAVp6wLrw8xdKBdYFG // Hash160: d0c15a7d41500976056b3345f542d8c944077c8a BinaryData script = READHEX("a914d0c15a7d41500976056b3345f542d8c944077c8a87"); // send to P2SH BinaryData a160 = READHEX( "d0c15a7d41500976056b3345f542d8c944077c8a"); BinaryData unique = READHEX("05d0c15a7d41500976056b3345f542d8c944077c8a"); TXOUT_SCRIPT_TYPE scrType = BtcUtils::getTxOutScriptType(script); EXPECT_EQ(scrType, TXOUT_SCRIPT_P2SH); EXPECT_EQ(BtcUtils::getTxOutRecipientAddr(script), a160 ); EXPECT_EQ(BtcUtils::getTxOutRecipientAddr(script, scrType), a160 ); EXPECT_EQ(BtcUtils::getTxOutScrAddr(script), unique ); EXPECT_EQ(BtcUtils::getTxOutScrAddr(script, scrType), unique ); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, TxOutScriptID_Multisig) { BinaryData script = READHEX( "5221034758cefcb75e16e4dfafb32383b709fa632086ea5ca982712de6add93" "060b17a2103fe96237629128a0ae8c3825af8a4be8fe3109b16f62af19cec0b1" "eb93b8717e252ae"); BinaryData pub1 = READHEX( "034758cefcb75e16e4dfafb32383b709fa632086ea5ca982712de6add93060b17a"); BinaryData pub2 = READHEX( "03fe96237629128a0ae8c3825af8a4be8fe3109b16f62af19cec0b1eb93b8717e2"); BinaryData addr1 = READHEX("b3348abf9dd2d1491359f937e2af64b1bb6d525a"); BinaryData addr2 = READHEX("785652a6b8e721e80ffa353e5dfd84f0658284a9"); BinaryData a160 = BtcUtils::BadAddress_; BinaryData unique = READHEX( "fe0202785652a6b8e721e80ffa353e5dfd84f0658284a9b3348abf9dd2d14913" "59f937e2af64b1bb6d525a"); TXOUT_SCRIPT_TYPE scrType = BtcUtils::getTxOutScriptType(script); EXPECT_EQ(scrType, TXOUT_SCRIPT_MULTISIG); EXPECT_EQ(BtcUtils::getTxOutRecipientAddr(script), a160 ); EXPECT_EQ(BtcUtils::getTxOutRecipientAddr(script, scrType), a160 ); EXPECT_EQ(BtcUtils::getTxOutScrAddr(script), unique ); EXPECT_EQ(BtcUtils::getTxOutScrAddr(script, scrType), unique ); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, TxOutScriptID_MultiList) { BinaryData script = READHEX( "5221034758cefcb75e16e4dfafb32383b709fa632086ea5ca982712de6add930" "60b17a2103fe96237629128a0ae8c3825af8a4be8fe3109b16f62af19cec0b1e" "b93b8717e252ae"); BinaryData addr0 = READHEX("785652a6b8e721e80ffa353e5dfd84f0658284a9"); BinaryData addr1 = READHEX("b3348abf9dd2d1491359f937e2af64b1bb6d525a"); BinaryData a160 = BtcUtils::BadAddress_; BinaryData unique = READHEX( "fe0202785652a6b8e721e80ffa353e5dfd84f0658284a9b3348abf9dd2d14913" "59f937e2af64b1bb6d525a"); BinaryData pub0 = READHEX( "034758cefcb75e16e4dfafb32383b709fa632086ea5ca982712de6add93060b17a"); BinaryData pub1 = READHEX( "03fe96237629128a0ae8c3825af8a4be8fe3109b16f62af19cec0b1eb93b8717e2"); vector a160List; uint32_t M; M = BtcUtils::getMultisigAddrList(script, a160List); EXPECT_EQ(M, 2); EXPECT_EQ(a160List.size(), 2); // N EXPECT_EQ(a160List[0], addr0); EXPECT_EQ(a160List[1], addr1); vector pkList; M = BtcUtils::getMultisigPubKeyList(script, pkList); EXPECT_EQ(M, 2); EXPECT_EQ(pkList.size(), 2); // N EXPECT_EQ(pkList[0], pub0); EXPECT_EQ(pkList[1], pub1); } //TEST_F(BtcUtilsTest, TxInScriptID) //{ //TXIN_SCRIPT_STDUNCOMPR, //TXIN_SCRIPT_STDCOMPR, //TXIN_SCRIPT_COINBASE, //TXIN_SCRIPT_SPENDPUBKEY, //TXIN_SCRIPT_SPENDMULTI, //TXIN_SCRIPT_SPENDP2SH, //TXIN_SCRIPT_NONSTANDARD //} //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, TxInScriptID_StdUncompr) { BinaryData script = READHEX( "493046022100b9daf2733055be73ae00ee0c5d78ca639d554fe779f163396c1a" "39b7913e7eac02210091f0deeb2e510c74354afb30cc7d8fbac81b1ca8b39406" "13379adc41a6ffd226014104b1537fa5bc2242d25ebf54f31e76ebabe0b3de4a" "4dccd9004f058d6c2caa5d31164252e1e04e5df627fae7adec27fa9d40c271fc" "4d30ff375ef6b26eba192bac"); BinaryData a160 = READHEX("c42a8290196b2c5bcb35471b45aa0dc096baed5e"); BinaryData prevHash = prevHashReg_; TXIN_SCRIPT_TYPE scrType = BtcUtils::getTxInScriptType( script, prevHash); EXPECT_EQ(scrType, TXIN_SCRIPT_STDUNCOMPR); EXPECT_EQ(BtcUtils::getTxInAddr(script, prevHash), a160); EXPECT_EQ(BtcUtils::getTxInAddr(script, prevHash, scrType), a160); EXPECT_EQ(BtcUtils::getTxInAddrFromType(script, scrType), a160); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, TxInScriptID_StdCompr) { BinaryData script = READHEX( "47304402205299224886e5e3402b0e9fa3527bcfe1d73c4e2040f18de8dd17f1" "16e3365a1102202590dcc16c4b711daae6c37977ba579ca65bcaa8fba2bd7168" "a984be727ccf7a01210315122ff4d41d9fe3538a0a8c6c7f813cf12a901069a4" "3d6478917246dc92a782"); BinaryData a160 = READHEX("03214fc1433a287e964d6c4242093c34e4ed0001"); BinaryData prevHash = prevHashReg_; TXIN_SCRIPT_TYPE scrType = BtcUtils::getTxInScriptType(script, prevHash); EXPECT_EQ(scrType, TXIN_SCRIPT_STDCOMPR); EXPECT_EQ(BtcUtils::getTxInAddr(script, prevHash), a160); EXPECT_EQ(BtcUtils::getTxInAddr(script, prevHash, scrType), a160); EXPECT_EQ(BtcUtils::getTxInAddrFromType(script, scrType), a160); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, TxInScriptID_Coinbase) { BinaryData script = READHEX( "0310920304000071c3124d696e656420627920425443204775696c640800b75f950e000000"); BinaryData a160 = BtcUtils::BadAddress_; BinaryData prevHash = prevHashCB_; TXIN_SCRIPT_TYPE scrType = BtcUtils::getTxInScriptType(script, prevHash); EXPECT_EQ(scrType, TXIN_SCRIPT_COINBASE); EXPECT_EQ(BtcUtils::getTxInAddr(script, prevHash), a160); EXPECT_EQ(BtcUtils::getTxInAddr(script, prevHash, scrType), a160); EXPECT_EQ(BtcUtils::getTxInAddrFromType(script, scrType), a160); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, TxInScriptID_SpendPubKey) { BinaryData script = READHEX( "47304402201ffc44394e5a3dd9c8b55bdc12147e18574ac945d15dac026793bf" "3b8ff732af022035fd832549b5176126f735d87089c8c1c1319447a458a09818" "e173eaf0c2eef101"); BinaryData a160 = BtcUtils::BadAddress_; BinaryData prevHash = prevHashReg_; TXIN_SCRIPT_TYPE scrType = BtcUtils::getTxInScriptType(script, prevHash); EXPECT_EQ(scrType, TXIN_SCRIPT_SPENDPUBKEY); EXPECT_EQ(BtcUtils::getTxInAddr(script, prevHash), a160); EXPECT_EQ(BtcUtils::getTxInAddr(script, prevHash, scrType), a160); EXPECT_EQ(BtcUtils::getTxInAddrFromType(script, scrType), a160); //txInHash160s.push_back( READHEX("957efec6af757ccbbcf9a436f0083c5ddaa3bf1d")); // this one can't be determined } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, TxInScriptID_SpendMultisig) { BinaryData script = READHEX( "004830450221009254113fa46918f299b1d18ec918613e56cffbeba0960db05f" "66b51496e5bf3802201e229de334bd753a2b08b36cc3f38f5263a23e9714a737" "520db45494ec095ce80148304502206ee62f539d5cd94f990b7abfda77750f58" "ff91043c3f002501e5448ef6dba2520221009d29229cdfedda1dd02a1a90bb71" "b30b77e9c3fc28d1353f054c86371f6c2a8101"); BinaryData a160 = BtcUtils::BadAddress_; BinaryData prevHash = prevHashReg_; TXIN_SCRIPT_TYPE scrType = BtcUtils::getTxInScriptType(script, prevHash); EXPECT_EQ(scrType, TXIN_SCRIPT_SPENDMULTI); EXPECT_EQ(BtcUtils::getTxInAddr(script, prevHash), a160); EXPECT_EQ(BtcUtils::getTxInAddr(script, prevHash, scrType), a160); EXPECT_EQ(BtcUtils::getTxInAddrFromType(script, scrType), a160); vector scrParts = BtcUtils::splitPushOnlyScriptRefs(script); BinaryData zero = READHEX("00"); BinaryData sig1 = READHEX( "30450221009254113fa46918f299b1d18ec918613e56cffbeba0960db05f66b5" "1496e5bf3802201e229de334bd753a2b08b36cc3f38f5263a23e9714a737520d" "b45494ec095ce801"); BinaryData sig2 = READHEX( "304502206ee62f539d5cd94f990b7abfda77750f58ff91043c3f002501e5448e" "f6dba2520221009d29229cdfedda1dd02a1a90bb71b30b77e9c3fc28d1353f05" "4c86371f6c2a8101"); EXPECT_EQ(scrParts.size(), 3); EXPECT_EQ(scrParts[0], zero); EXPECT_EQ(scrParts[1], sig1); EXPECT_EQ(scrParts[2], sig2); //BinaryData p2sh = READHEX("5221034758cefcb75e16e4dfafb32383b709fa632086ea5ca982712de6add93060b17a2103fe96237629128a0ae8c3825af8a4be8fe3109b16f62af19cec0b1eb93b8717e252ae"); //BinaryData pub1 = READHEX("034758cefcb75e16e4dfafb32383b709fa632086ea5ca982712de6add93060b17a"); //BinaryData pub1 = READHEX("03fe96237629128a0ae8c3825af8a4be8fe3109b16f62af19cec0b1eb93b8717e2"); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, TxInScriptID_SpendP2SH) { // Spending P2SH output as above: fd16d6bbf1a3498ca9777b9d31ceae883eb8cb6ede1fafbdd218bae107de66fe (TxIn: 1, 219 B) // Leading 0x00 byte is required due to a bug in OP_CHECKMULTISIG BinaryData script = READHEX( "004830450221009254113fa46918f299b1d18ec918613e56cffbeba0960db05f" "66b51496e5bf3802201e229de334bd753a2b08b36cc3f38f5263a23e9714a737" "520db45494ec095ce80148304502206ee62f539d5cd94f990b7abfda77750f58" "ff91043c3f002501e5448ef6dba2520221009d29229cdfedda1dd02a1a90bb71" "b30b77e9c3fc28d1353f054c86371f6c2a8101475221034758cefcb75e16e4df" "afb32383b709fa632086ea5ca982712de6add93060b17a2103fe96237629128a" "0ae8c3825af8a4be8fe3109b16f62af19cec0b1eb93b8717e252ae"); BinaryData a160 = READHEX("d0c15a7d41500976056b3345f542d8c944077c8a"); BinaryData prevHash = prevHashReg_; TXIN_SCRIPT_TYPE scrType = BtcUtils::getTxInScriptType(script, prevHash); EXPECT_EQ(scrType, TXIN_SCRIPT_SPENDP2SH); EXPECT_EQ(BtcUtils::getTxInAddr(script, prevHash), a160); EXPECT_EQ(BtcUtils::getTxInAddr(script, prevHash, scrType), a160); EXPECT_EQ(BtcUtils::getTxInAddrFromType(script, scrType), a160); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, BitsToDifficulty) { double a = BtcUtils::convertDiffBitsToDouble(READHEX("ffff001d")); double b = BtcUtils::convertDiffBitsToDouble(READHEX("be2f021a")); double c = BtcUtils::convertDiffBitsToDouble(READHEX("3daa011a")); EXPECT_DOUBLE_EQ(a, 1.0); EXPECT_DOUBLE_EQ(b, 7672999.920164138); EXPECT_DOUBLE_EQ(c, 10076292.883418716); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BtcUtilsTest, ScriptToOpCodes) { BinaryData complexScript = READHEX( "526b006b7dac7ca9143cd1def404e12a85ead2b4d3f5f9f817fb0d46ef879a6c" "936b7dac7ca9146a4e7d5f798e90e84db9244d4805459f87275943879a6c936b" "7dac7ca914486efdd300987a054510b4ce1148d4ad290d911e879a6c936b6c6ca2"); vector opstr; opstr.reserve(40); opstr.push_back(string("OP_2")); opstr.push_back(string("OP_TOALTSTACK")); opstr.push_back(string("OP_0")); opstr.push_back(string("OP_TOALTSTACK")); opstr.push_back(string("OP_TUCK")); opstr.push_back(string("OP_CHECKSIG")); opstr.push_back(string("OP_SWAP")); opstr.push_back(string("OP_HASH160")); opstr.push_back(string("[PUSHDATA -- 20 BYTES:]")); opstr.push_back(string("3cd1def404e12a85ead2b4d3f5f9f817fb0d46ef")); opstr.push_back(string("OP_EQUAL")); opstr.push_back(string("OP_BOOLAND")); opstr.push_back(string("OP_FROMALTSTACK")); opstr.push_back(string("OP_ADD")); opstr.push_back(string("OP_TOALTSTACK")); opstr.push_back(string("OP_TUCK")); opstr.push_back(string("OP_CHECKSIG")); opstr.push_back(string("OP_SWAP")); opstr.push_back(string("OP_HASH160")); opstr.push_back(string("[PUSHDATA -- 20 BYTES:]")); opstr.push_back(string("6a4e7d5f798e90e84db9244d4805459f87275943")); opstr.push_back(string("OP_EQUAL")); opstr.push_back(string("OP_BOOLAND")); opstr.push_back(string("OP_FROMALTSTACK")); opstr.push_back(string("OP_ADD")); opstr.push_back(string("OP_TOALTSTACK")); opstr.push_back(string("OP_TUCK")); opstr.push_back(string("OP_CHECKSIG")); opstr.push_back(string("OP_SWAP")); opstr.push_back(string("OP_HASH160")); opstr.push_back(string("[PUSHDATA -- 20 BYTES:]")); opstr.push_back(string("486efdd300987a054510b4ce1148d4ad290d911e")); opstr.push_back(string("OP_EQUAL")); opstr.push_back(string("OP_BOOLAND")); opstr.push_back(string("OP_FROMALTSTACK")); opstr.push_back(string("OP_ADD")); opstr.push_back(string("OP_TOALTSTACK")); opstr.push_back(string("OP_FROMALTSTACK")); opstr.push_back(string("OP_FROMALTSTACK")); opstr.push_back(string("OP_GREATERTHANOREQUAL")); vector output = BtcUtils::convertScriptToOpStrings(complexScript); ASSERT_EQ(output.size(), opstr.size()); for(uint32_t i=0; i txins(6); txins[0].unserialize_checked(rawTxIn_.getPtr(), len); txins[1].unserialize_checked(rawTxIn_.getPtr(), len, len); txins[2].unserialize_checked(rawTxIn_.getPtr(), len, len, TxRef(), 12); txins[3].unserialize(rawTxIn_.getRef()); txins[4].unserialize(brr); txins[5].unserialize_swigsafe_(rawTxIn_); for(uint32_t i=0; i<6; i++) { EXPECT_TRUE( txins[i].isInitialized()); EXPECT_EQ( txins[i].serialize().getSize(), len); EXPECT_EQ( txins[i].getScriptType(), TXIN_SCRIPT_STDUNCOMPR); EXPECT_EQ( txins[i].getScriptSize(), len-(36+1+4)); EXPECT_TRUE( txins[i].isStandard()); EXPECT_FALSE(txins[i].isCoinbase()); EXPECT_EQ( txins[i].getSequence(), UINT32_MAX); EXPECT_EQ( txins[i].getSenderScrAddrIfAvail(), srcAddr); EXPECT_EQ( txins[i].getOutPoint().serialize(), rawOP); EXPECT_FALSE(txins[i].getParentTxRef().isInitialized()); EXPECT_EQ( txins[i].getParentHeight(), UINT32_MAX); EXPECT_EQ( txins[i].getParentHash(), BinaryData(0)); EXPECT_EQ( txins[i].serialize(), rawTxIn_); if(i==2) EXPECT_EQ(txins[i].getIndex(), 12); else EXPECT_EQ(txins[i].getIndex(), UINT32_MAX); } } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockObjTest, TxOutUnserialize) { BinaryRefReader brr(rawTxOut_); uint32_t len = rawTxOut_.getSize(); BinaryData dstAddr = READHEX("8dce8946f1c7763bb60ea5cf16ef514cbed0633b"); vector txouts(6); txouts[0].unserialize_checked(rawTxOut_.getPtr(), len); txouts[1].unserialize_checked(rawTxOut_.getPtr(), len, len); txouts[2].unserialize_checked(rawTxOut_.getPtr(), len, len, TxRef(), 12); txouts[3].unserialize(rawTxOut_.getRef()); txouts[4].unserialize(brr); txouts[5].unserialize_swigsafe_(rawTxOut_); for(uint32_t i=0; i<6; i++) { EXPECT_TRUE( txouts[i].isInitialized()); EXPECT_EQ( txouts[i].getSize(), len); EXPECT_EQ( txouts[i].getScriptType(), TXOUT_SCRIPT_STDHASH160); EXPECT_EQ( txouts[i].getScriptSize(), 25); EXPECT_TRUE( txouts[i].isStandard()); EXPECT_EQ( txouts[i].getValue(), 0x00000000d58b4cac); EXPECT_EQ( txouts[i].getScrAddressStr(), HASH160PREFIX+dstAddr); EXPECT_TRUE( txouts[i].isScriptStandard()); EXPECT_TRUE( txouts[i].isScriptStdHash160()); EXPECT_FALSE(txouts[i].isScriptStdPubKey65()); EXPECT_FALSE(txouts[i].isScriptStdPubKey33()); EXPECT_FALSE(txouts[i].isScriptP2SH()); EXPECT_FALSE(txouts[i].isScriptNonStd()); EXPECT_FALSE(txouts[i].getParentTxRef().isInitialized()); EXPECT_EQ( txouts[i].getParentHeight(), UINT32_MAX); EXPECT_EQ( txouts[i].getParentHash(), BinaryData(0)); EXPECT_EQ( txouts[i].serialize(), rawTxOut_); if(i==2) EXPECT_EQ(txouts[i].getIndex(), 12); else EXPECT_EQ(txouts[i].getIndex(), UINT32_MAX); } } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockObjTest, TxNoInit) { Tx tx; EXPECT_FALSE(tx.isInitialized()); // Actually, why even bother with all these no-init tests? We should always // check whether the tx is initialized before using it. If you don't, you // deserve to seg fault :) //EXPECT_EQ( tx.getSize(), UINT32_MAX); //EXPECT_TRUE( tx.isStandard()); //EXPECT_EQ( tx.getValue(), 0x00000000d58b4cac); //EXPECT_EQ( tx.getRecipientAddr(), dstAddr); //EXPECT_TRUE( tx.isScriptStandard()); //EXPECT_TRUE( tx.isScriptStdHash160()); //EXPECT_FALSE(tx.isScriptStdPubKey65()); //EXPECT_FALSE(tx.isScriptStdPubKey33()); //EXPECT_FALSE(tx.isScriptP2SH()); //EXPECT_FALSE(tx.isScriptNonStd()); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockObjTest, TxUnserialize) { uint32_t len = rawTx0_.getSize(); BinaryData tx0hash = READHEX( "aa739836a44451be555f74a02f088b50a867b1d3a2c917ee863d708ec2db58f6"); BinaryData tx0_In0 = READHEX("aff189b24a36a1b93de2ea4d157c13d18251270a"); BinaryData tx0_Out0 = READHEX("c1b4695d53b6ee57a28647ce63e45665df6762c2"); BinaryData tx0_Out1 = READHEX("0e0aec36fe2545fb31a41164fb6954adcd96b342"); BinaryData tx0_Val0 = READHEX("42582c0a00000000"); BinaryData tx0_Val1 = READHEX("80d1f00800000000"); BinaryRefReader brr(rawTx0_); uint64_t v0 = *(uint64_t*)tx0_Val0.getPtr(); uint64_t v1 = *(uint64_t*)tx0_Val1.getPtr(); Tx tx; vector txs(10); txs[0] = Tx(rawTx0_.getPtr(), len); txs[1] = Tx(brr); brr.resetPosition(); txs[2] = Tx(rawTx0_); txs[3] = Tx(rawTx0_.getRef()); txs[4].unserialize(rawTx0_.getPtr(), len); txs[5].unserialize(rawTx0_); txs[6].unserialize(rawTx0_.getRef()); txs[7].unserialize(brr); brr.resetPosition(); txs[8].unserialize_swigsafe_(rawTx0_); txs[9] = Tx::createFromStr(rawTx0_); for(uint32_t i=0; i<10; i++) { EXPECT_TRUE( txs[i].isInitialized()); EXPECT_EQ( txs[i].getSize(), len); EXPECT_EQ( txs[i].getVersion(), 1); EXPECT_EQ( txs[i].getNumTxIn(), 1); EXPECT_EQ( txs[i].getNumTxOut(), 2); EXPECT_EQ( txs[i].getThisHash(), tx0hash.copySwapEndian()); //EXPECT_FALSE(txs[i].isMainBranch()); EXPECT_EQ( txs[i].getTxInOffset(0), 5); EXPECT_EQ( txs[i].getTxInOffset(1), 185); EXPECT_EQ( txs[i].getTxOutOffset(0), 186); EXPECT_EQ( txs[i].getTxOutOffset(1), 220); EXPECT_EQ( txs[i].getTxOutOffset(2), 254); EXPECT_EQ( txs[i].getLockTime(), 0); EXPECT_EQ( txs[i].serialize(), rawTx0_); EXPECT_EQ( txs[0].getTxInCopy(0).getSenderScrAddrIfAvail(), tx0_In0); EXPECT_EQ( txs[i].getTxOutCopy(0).getScrAddressStr(), HASH160PREFIX+tx0_Out0); EXPECT_EQ( txs[i].getTxOutCopy(1).getScrAddressStr(), HASH160PREFIX+tx0_Out1); EXPECT_EQ( txs[i].getScrAddrForTxOut(0), HASH160PREFIX+tx0_Out0); EXPECT_EQ( txs[i].getScrAddrForTxOut(1), HASH160PREFIX+tx0_Out1); EXPECT_EQ( txs[i].getTxOutCopy(0).getValue(), v0); EXPECT_EQ( txs[i].getTxOutCopy(1).getValue(), v1); EXPECT_EQ( txs[i].getSumOfOutputs(), v0+v1); EXPECT_EQ( txs[i].getBlockTxIndex(), UINT16_MAX); } } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockObjTest, DISABLED_FullBlock) { EXPECT_TRUE(false); BinaryRefReader brr(rawBlock_); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockObjTest, DISABLED_TxIOPairStuff) { EXPECT_TRUE(false); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockObjTest, DISABLED_RegisteredTxStuff) { EXPECT_TRUE(false); } //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class StoredBlockObjTest : public ::testing::Test { protected: virtual void SetUp(void) { rawHead_ = READHEX( "01000000" "1d8f4ec0443e1f19f305e488c1085c95de7cc3fd25e0d2c5bb5d000000000000" "9762547903d36881a86751f3f5049e23050113f779735ef82734ebf0b4450081" "d8c8c84d" "b3936a1a" "334b035b"); headHashLE_ = READHEX( "1195e67a7a6d0674bbd28ae096d602e1f038c8254b49dfe79d47000000000000"); headHashBE_ = READHEX( "000000000000479de7df494b25c838f0e102d696e08ad2bb74066d7a7ae69511"); rawTx0_ = READHEX( "01000000016290dce984203b6a5032e543e9e272d8bce934c7de4d15fa0fe44d" "d49ae4ece9010000008b48304502204f2fa458d439f957308bca264689aa175e" "3b7c5f78a901cb450ebd20936b2c500221008ea3883a5b80128e55c9c6070aa6" "264e1e0ce3d18b7cd7e85108ce3d18b7419a0141044202550a5a6d3bb81549c4" "a7803b1ad59cdbba4770439a4923624a8acfc7d34900beb54a24188f7f0a4068" "9d905d4847cc7d6c8d808a457d833c2d44ef83f76bffffffff0242582c0a0000" "00001976a914c1b4695d53b6ee57a28647ce63e45665df6762c288ac80d1f008" "000000001976a9140e0aec36fe2545fb31a41164fb6954adcd96b34288ac0000" "0000"); rawTx1_ = READHEX( "0100000001f658dbc28e703d86ee17c9a2d3b167a8508b082fa0745f55be5144" "a4369873aa010000008c49304602210041e1186ca9a41fdfe1569d5d807ca7ff" "6c5ffd19d2ad1be42f7f2a20cdc8f1cc0221003366b5d64fe81e53910e156914" "091d12646bc0d1d662b7a65ead3ebe4ab8f6c40141048d103d81ac9691cf13f3" "fc94e44968ef67b27f58b27372c13108552d24a6ee04785838f34624b294afee" "83749b64478bb8480c20b242c376e77eea2b3dc48b4bffffffff0200e1f50500" "0000001976a9141b00a2f6899335366f04b277e19d777559c35bc888ac40aeeb" "02000000001976a9140e0aec36fe2545fb31a41164fb6954adcd96b34288ac00" "000000"); rawBlock_ = READHEX( "01000000eb10c9a996a2340a4d74eaab41421ed8664aa49d18538bab59010000" "000000005a2f06efa9f2bd804f17877537f2080030cadbfa1eb50e02338117cc" "604d91b9b7541a4ecfbb0a1a64f1ade703010000000100000000000000000000" "00000000000000000000000000000000000000000000ffffffff0804cfbb0a1a" "02360affffffff0100f2052a01000000434104c2239c4eedb3beb26785753463" "be3ec62b82f6acd62efb65f452f8806f2ede0b338e31d1f69b1ce449558d7061" "aa1648ddc2bf680834d3986624006a272dc21cac000000000100000003e8caa1" "2bcb2e7e86499c9de49c45c5a1c6167ea4b894c8c83aebba1b6100f343010000" "008c493046022100e2f5af5329d1244807f8347a2c8d9acc55a21a5db769e927" "4e7e7ba0bb605b26022100c34ca3350df5089f3415d8af82364d7f567a6a297f" "cc2c1d2034865633238b8c014104129e422ac490ddfcb7b1c405ab9fb4244124" "6c4bca578de4f27b230de08408c64cad03af71ee8a3140b40408a7058a1984a9" "f246492386113764c1ac132990d1ffffffff5b55c18864e16c08ef9989d31c7a" "343e34c27c30cd7caa759651b0e08cae0106000000008c4930460221009ec9aa" "3e0caf7caa321723dea561e232603e00686d4bfadf46c5c7352b07eb00022100" "a4f18d937d1e2354b2e69e02b18d11620a6a9332d563e9e2bbcb01cee559680a" "014104411b35dd963028300e36e82ee8cf1b0c8d5bf1fc4273e970469f5cb931" "ee07759a2de5fef638961726d04bd5eb4e5072330b9b371e479733c942964bb8" "6e2b22ffffffff3de0c1e913e6271769d8c0172cea2f00d6d3240afc3a20f9fa" "247ce58af30d2a010000008c493046022100b610e169fd15ac9f60fe2b507529" "281cf2267673f4690ba428cbb2ba3c3811fd022100ffbe9e3d71b21977a8e97f" "de4c3ba47b896d08bc09ecb9d086bb59175b5b9f03014104ff07a1833fd8098b" "25f48c66dcf8fde34cbdbcc0f5f21a8c2005b160406cbf34cc432842c6b37b25" "90d16b165b36a3efc9908d65fb0e605314c9b278f40f3e1affffffff0240420f" "00000000001976a914adfa66f57ded1b655eb4ccd96ee07ca62bc1ddfd88ac00" "7d6a7d040000001976a914981a0c9ae61fa8f8c96ae6f8e383d6e07e77133e88" "ac00000000010000000138e7586e0784280df58bd3dc5e3d350c9036b1ec4107" "951378f45881799c92a4000000008a47304402207c945ae0bbdaf9dadba07bdf" "23faa676485a53817af975ddf85a104f764fb93b02201ac6af32ddf597e610b4" "002e41f2de46664587a379a0161323a85389b4f82dda014104ec8883d3e4f7a3" "9d75c9f5bb9fd581dc9fb1b7cdf7d6b5a665e4db1fdb09281a74ab138a2dba25" "248b5be38bf80249601ae688c90c6e0ac8811cdb740fcec31dffffffff022f66" "ac61050000001976a914964642290c194e3bfab661c1085e47d67786d2d388ac" "2f77e200000000001976a9141486a7046affd935919a3cb4b50a8a0c233c286c" "88ac00000000"); rawTxUnfrag_ = READHEX( // Version "01000000" // NumTxIn "02" // Start TxIn0 "0044fbc929d78e4203eed6f1d3d39c0157d8e5c100bbe0886779c0" "ebf6a69324010000008a47304402206568144ed5e7064d6176c74738b04c08ca" "19ca54ddeb480084b77f45eebfe57802207927d6975a5ac0e1bb36f5c05356dc" "da1f521770511ee5e03239c8e1eecf3aed0141045d74feae58c4c36d7c35beac" "05eddddc78b3ce4b02491a2eea72043978056a8bc439b99ddaad327207b09ef1" "6a8910828e805b0cc8c11fba5caea2ee939346d7ffffffff" // Start TxIn1 "45c866b219b17695" "2508f8e5aea728f950186554fc4a5807e2186a8e1c4009e5000000008c493046" "022100bd5d41662f98cfddc46e86ea7e4a3bc8fe9f1dfc5c4836eaf7df582596" "cfe0e9022100fc459ae4f59b8279d679003b88935896acd10021b6e2e4619377" "e336b5296c5e014104c00bab76a708ba7064b2315420a1c533ca9945eeff9754" "cdc574224589e9113469b4e71752146a10028079e04948ecdf70609bf1b9801f" "6b73ab75947ac339e5ffffffff" // NumTxOut "02" // Start TxOut0 "ac4c8bd5000000001976a9148dce8946f1c7763bb60ea5cf16ef514cbed0633b88ac" // Start TxOut1 "002f6859000000001976a9146a59ac0e8f553f292dfe5e9f3aaa1da93499c15e88ac" // Locktime "00000000"); rawTxFragged_ = READHEX( //"01000000020044fbc929d78e4203eed6f1d3d39c0157d8e5c100bbe0886779c0" //"ebf6a69324010000008a47304402206568144ed5e7064d6176c74738b04c08ca" //"19ca54ddeb480084b77f45eebfe57802207927d6975a5ac0e1bb36f5c05356dc" //"da1f521770511ee5e03239c8e1eecf3aed0141045d74feae58c4c36d7c35beac" //"05eddddc78b3ce4b02491a2eea72043978056a8bc439b99ddaad327207b09ef1" //"6a8910828e805b0cc8c11fba5caea2ee939346d7ffffffff45c866b219b17695" //"2508f8e5aea728f950186554fc4a5807e2186a8e1c4009e5000000008c493046" //"022100bd5d41662f98cfddc46e86ea7e4a3bc8fe9f1dfc5c4836eaf7df582596" //"cfe0e9022100fc459ae4f59b8279d679003b88935896acd10021b6e2e4619377" //"e336b5296c5e014104c00bab76a708ba7064b2315420a1c533ca9945eeff9754" //"cdc574224589e9113469b4e71752146a10028079e04948ecdf70609bf1b9801f" //"6b73ab75947ac339e5ffffffff0200000000"); // Version "01000000" // NumTxIn "02" // Start TxIn0 "0044fbc929d78e4203eed6f1d3d39c0157d8e5c100bbe0886779c0" "ebf6a69324010000008a47304402206568144ed5e7064d6176c74738b04c08ca" "19ca54ddeb480084b77f45eebfe57802207927d6975a5ac0e1bb36f5c05356dc" "da1f521770511ee5e03239c8e1eecf3aed0141045d74feae58c4c36d7c35beac" "05eddddc78b3ce4b02491a2eea72043978056a8bc439b99ddaad327207b09ef1" "6a8910828e805b0cc8c11fba5caea2ee939346d7ffffffff" // Start TxIn1 "45c866b219b17695" "2508f8e5aea728f950186554fc4a5807e2186a8e1c4009e5000000008c493046" "022100bd5d41662f98cfddc46e86ea7e4a3bc8fe9f1dfc5c4836eaf7df582596" "cfe0e9022100fc459ae4f59b8279d679003b88935896acd10021b6e2e4619377" "e336b5296c5e014104c00bab76a708ba7064b2315420a1c533ca9945eeff9754" "cdc574224589e9113469b4e71752146a10028079e04948ecdf70609bf1b9801f" "6b73ab75947ac339e5ffffffff" // NumTxOut "02" // ... TxOuts fragged out // Locktime "00000000"); rawTxOut0_ = READHEX( // Value "ac4c8bd500000000" // Script size (var_int) "19" // Script "76""a9""14""8dce8946f1c7763bb60ea5cf16ef514cbed0633b""88""ac"); rawTxOut1_ = READHEX( // Value "002f685900000000" // Script size (var_int) "19" // Script "76""a9""14""6a59ac0e8f553f292dfe5e9f3aaa1da93499c15e""88""ac"); bh_.unserialize(rawHead_); tx1_.unserialize(rawTx0_); tx2_.unserialize(rawTx1_); sbh_.unserialize(rawHead_); // Make sure the global DB type and prune type are reset for each test DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); } BinaryData PREFBYTE(DB_PREFIX pref) { BinaryWriter bw; bw.put_uint8_t((uint8_t)pref); return bw.getData(); } BinaryData rawHead_; BinaryData headHashLE_; BinaryData headHashBE_; BinaryData rawBlock_; BinaryData rawTx0_; BinaryData rawTx1_; BlockHeader bh_; Tx tx1_; Tx tx2_; BinaryData rawTxUnfrag_; BinaryData rawTxFragged_; BinaryData rawTxOut0_; BinaryData rawTxOut1_; StoredHeader sbh_; }; //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, StoredObjNoInit) { StoredHeader sbh; StoredTx stx; StoredTxOut stxo; StoredScriptHistory ssh; StoredUndoData sud; StoredHeadHgtList hhl; StoredTxHints sths; EXPECT_FALSE( sbh.isInitialized() ); EXPECT_FALSE( stx.isInitialized() ); EXPECT_FALSE( stxo.isInitialized() ); EXPECT_FALSE( ssh.isInitialized() ); EXPECT_FALSE( sud.isInitialized() ); EXPECT_FALSE( hhl.isInitialized() ); EXPECT_FALSE( sths.isInitialized() ); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, GetDBKeys) { StoredHeader sbh; StoredTx stx; StoredTxOut stxo; StoredScriptHistory ssh1; StoredScriptHistory ssh2; StoredUndoData sud; StoredHeadHgtList hhl; StoredTxHints sths; BinaryData key = READHEX("aaaaffff"); uint32_t hgt = 123000; uint8_t dup = 15; uint8_t txi = 7; uint8_t txo = 1; BinaryData hgtx = READHEX("01e0780f"); BinaryData txidx = WRITE_UINT16_BE(txi); BinaryData txoidx = WRITE_UINT16_BE(txo); sbh.blockHeight_ = hgt; sbh.duplicateID_ = dup; stx.blockHeight_ = hgt; stx.duplicateID_ = dup; stx.txIndex_ = txi; stxo.blockHeight_ = hgt; stxo.duplicateID_ = dup; stxo.txIndex_ = txi; stxo.txOutIndex_ = txo; ssh1.uniqueKey_ = key; ssh2.uniqueKey_ = key; sud.blockHeight_ = hgt; sud.duplicateID_ = dup; hhl.height_ = hgt; sths.txHashPrefix_= key; BinaryData TXB = PREFBYTE(DB_PREFIX_TXDATA); BinaryData SSB = PREFBYTE(DB_PREFIX_SCRIPT); BinaryData UDB = PREFBYTE(DB_PREFIX_UNDODATA); BinaryData HHB = PREFBYTE(DB_PREFIX_HEADHGT); BinaryData THB = PREFBYTE(DB_PREFIX_TXHINTS); EXPECT_EQ(sbh.getDBKey( true ), TXB + hgtx); EXPECT_EQ(stx.getDBKey( true ), TXB + hgtx + txidx); EXPECT_EQ(stxo.getDBKey( true ), TXB + hgtx + txidx + txoidx); EXPECT_EQ(ssh1.getDBKey( true ), SSB + key); EXPECT_EQ(ssh2.getDBKey( true ), SSB + key); EXPECT_EQ(sud.getDBKey( true ), UDB + hgtx); EXPECT_EQ(hhl.getDBKey( true ), HHB + WRITE_UINT32_BE(hgt)); EXPECT_EQ(sths.getDBKey( true ), THB + key); EXPECT_EQ(sbh.getDBKey( false ), hgtx); EXPECT_EQ(stx.getDBKey( false ), hgtx + txidx); EXPECT_EQ(stxo.getDBKey( false ), hgtx + txidx + txoidx); EXPECT_EQ(ssh1.getDBKey( false ), key); EXPECT_EQ(ssh2.getDBKey( false ), key); EXPECT_EQ(sud.getDBKey( false ), hgtx); EXPECT_EQ(hhl.getDBKey( false ), WRITE_UINT32_BE(hgt)); EXPECT_EQ(sths.getDBKey( false ), key); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, LengthUnfrag) { StoredTx tx; vector offin, offout; uint32_t lenUnfrag = BtcUtils::StoredTxCalcLength( rawTxUnfrag_.getPtr(), false, &offin, &offout); ASSERT_EQ(lenUnfrag, 438); ASSERT_EQ(offin.size(), 3); EXPECT_EQ(offin[0], 5); EXPECT_EQ(offin[1], 184); EXPECT_EQ(offin[2], 365); ASSERT_EQ(offout.size(), 3); EXPECT_EQ(offout[0], 366); EXPECT_EQ(offout[1], 400); EXPECT_EQ(offout[2], 434); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, LengthFragged) { vector offin, offout; uint32_t lenFragged = BtcUtils::StoredTxCalcLength( rawTxFragged_.getPtr(), true, &offin, &offout); ASSERT_EQ(lenFragged, 370); ASSERT_EQ(offin.size(), 3); EXPECT_EQ(offin[0], 5); EXPECT_EQ(offin[1], 184); EXPECT_EQ(offin[2], 365); ASSERT_EQ(offout.size(), 3); EXPECT_EQ(offout[0], 366); EXPECT_EQ(offout[1], 366); EXPECT_EQ(offout[2], 366); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, BlkDataKeys) { uint32_t hgt = 0x001a332b; uint8_t dup = 0x01; uint16_t tix = 0x0102; uint16_t tox = 0x0021; EXPECT_EQ(DBUtils.getBlkDataKey(hgt, dup), READHEX("031a332b01")); EXPECT_EQ(DBUtils.getBlkDataKey(hgt, dup, tix), READHEX("031a332b010102")); EXPECT_EQ(DBUtils.getBlkDataKey(hgt, dup, tix, tox), READHEX("031a332b0101020021")); EXPECT_EQ(DBUtils.getBlkDataKeyNoPrefix(hgt, dup), READHEX("1a332b01")); EXPECT_EQ(DBUtils.getBlkDataKeyNoPrefix(hgt, dup, tix), READHEX("1a332b010102")); EXPECT_EQ(DBUtils.getBlkDataKeyNoPrefix(hgt, dup, tix, tox), READHEX("1a332b0101020021")); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, ReadBlkKeyData) { BinaryData TXP = WRITE_UINT8_BE((uint8_t)DB_PREFIX_TXDATA); BinaryData key5p = TXP + READHEX("01e078""0f"); BinaryData key7p = TXP + READHEX("01e078""0f""0007"); BinaryData key9p = TXP + READHEX("01e078""0f""0007""0001"); BinaryData key5 = READHEX("01e078""0f"); BinaryData key7 = READHEX("01e078""0f""0007"); BinaryData key9 = READHEX("01e078""0f""0007""0001"); BinaryRefReader brr; uint32_t hgt; uint8_t dup; uint16_t txi; uint16_t txo; BLKDATA_TYPE bdtype; ///////////////////////////////////////////////////////////////////////////// // 5 bytes, with prefix brr.setNewData(key5p); bdtype = DBUtils.readBlkDataKey(brr, hgt, dup); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_HEADER); brr.setNewData(key5p); bdtype = DBUtils.readBlkDataKey(brr, hgt, dup, txi); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( txi, UINT16_MAX); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_HEADER); brr.setNewData(key5p); bdtype = DBUtils.readBlkDataKey(brr, hgt, dup, txi, txo); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( txi, UINT16_MAX); EXPECT_EQ( txo, UINT16_MAX); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_HEADER); ///////////////////////////////////////////////////////////////////////////// // 7 bytes, with prefix brr.setNewData(key7p); bdtype = DBUtils.readBlkDataKey(brr, hgt, dup); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_TX); brr.setNewData(key7p); bdtype = DBUtils.readBlkDataKey(brr, hgt, dup, txi); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( txi, 7); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_TX); brr.setNewData(key7p); bdtype = DBUtils.readBlkDataKey(brr, hgt, dup, txi, txo); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( txi, 7); EXPECT_EQ( txo, UINT16_MAX); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_TX); ///////////////////////////////////////////////////////////////////////////// // 9 bytes, with prefix brr.setNewData(key9p); bdtype = DBUtils.readBlkDataKey(brr, hgt, dup); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_TXOUT); brr.setNewData(key9p); bdtype = DBUtils.readBlkDataKey(brr, hgt, dup, txi); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( txi, 7); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_TXOUT); brr.setNewData(key9p); bdtype = DBUtils.readBlkDataKey(brr, hgt, dup, txi, txo); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( txi, 7); EXPECT_EQ( txo, 1); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_TXOUT); ///////////////////////////////////////////////////////////////////////////// // 5 bytes, no prefix brr.setNewData(key5); bdtype = DBUtils.readBlkDataKeyNoPrefix(brr, hgt, dup); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_HEADER); brr.setNewData(key5); bdtype = DBUtils.readBlkDataKeyNoPrefix(brr, hgt, dup, txi); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( txi, UINT16_MAX); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_HEADER); brr.setNewData(key5); bdtype = DBUtils.readBlkDataKeyNoPrefix(brr, hgt, dup, txi, txo); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( txi, UINT16_MAX); EXPECT_EQ( txo, UINT16_MAX); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_HEADER); ///////////////////////////////////////////////////////////////////////////// // 7 bytes, no prefix brr.setNewData(key7); bdtype = DBUtils.readBlkDataKeyNoPrefix(brr, hgt, dup); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_TX); brr.setNewData(key7); bdtype = DBUtils.readBlkDataKeyNoPrefix(brr, hgt, dup, txi); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( txi, 7); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_TX); brr.setNewData(key7); bdtype = DBUtils.readBlkDataKeyNoPrefix(brr, hgt, dup, txi, txo); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( txi, 7); EXPECT_EQ( txo, UINT16_MAX); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_TX); ///////////////////////////////////////////////////////////////////////////// // 9 bytes, no prefix brr.setNewData(key9); bdtype = DBUtils.readBlkDataKeyNoPrefix(brr, hgt, dup); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_TXOUT); brr.setNewData(key9); bdtype = DBUtils.readBlkDataKeyNoPrefix(brr, hgt, dup, txi); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( txi, 7); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_TXOUT); brr.setNewData(key9); bdtype = DBUtils.readBlkDataKeyNoPrefix(brr, hgt, dup, txi, txo); EXPECT_EQ( hgt, 123000); EXPECT_EQ( dup, 15); EXPECT_EQ( txi, 7); EXPECT_EQ( txo, 1); EXPECT_EQ( brr.getSizeRemaining(), 0); EXPECT_EQ( bdtype, BLKDATA_TXOUT); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SHeaderUnserialize) { // SetUp already contains sbh_.unserialize(rawHead_); EXPECT_TRUE( sbh_.isInitialized()); EXPECT_FALSE(sbh_.isMainBranch_); EXPECT_FALSE(sbh_.haveFullBlock()); EXPECT_FALSE(sbh_.isMerkleCreated()); EXPECT_EQ( sbh_.numTx_, UINT32_MAX); EXPECT_EQ( sbh_.numBytes_, UINT32_MAX); EXPECT_EQ( sbh_.blockHeight_, UINT32_MAX); EXPECT_EQ( sbh_.duplicateID_, UINT8_MAX); EXPECT_EQ( sbh_.merkle_.getSize(), 0); EXPECT_EQ( sbh_.stxMap_.size(), 0); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SHeaderDBSerFull_H) { DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); sbh_.blockHeight_ = 65535; sbh_.duplicateID_ = 1; sbh_.merkle_ = READHEX("deadbeef"); sbh_.merkleIsPartial_ = false; sbh_.isMainBranch_ = true; sbh_.numTx_ = 15; sbh_.numBytes_ = 65535; // SetUp already contains sbh_.unserialize(rawHead_); BinaryData last4 = READHEX("00ffff01"); EXPECT_EQ(sbh_.serializeDBValue(HEADERS), rawHead_ + last4); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SHeaderDBSerFull_B1) { // ARMORY_DB_FULL means no merkle string (cause all Tx are in the DB // so the merkle tree would be redundant. DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); sbh_.blockHeight_ = 65535; sbh_.duplicateID_ = 1; sbh_.merkle_ = READHEX("deadbeef"); sbh_.merkleIsPartial_ = false; sbh_.isMainBranch_ = true; sbh_.numTx_ = 15; sbh_.numBytes_ = 65535; // SetUp already contains sbh_.unserialize(rawHead_); BinaryData flags = READHEX("01340000"); BinaryData ntx = READHEX("0f000000"); BinaryData nbyte = READHEX("ffff0000"); BinaryData headBlkData = flags + rawHead_ + ntx + nbyte; EXPECT_EQ(sbh_.serializeDBValue(BLKDATA), headBlkData); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SHeaderDBSerFull_B2) { // With merkle string DBUtils.setArmoryDbType(ARMORY_DB_PARTIAL); DBUtils.setDbPruneType(DB_PRUNE_NONE); BinaryWriter bw; sbh_.blockHeight_ = 65535; sbh_.duplicateID_ = 1; sbh_.merkle_ = READHEX("deadbeef"); sbh_.merkleIsPartial_ = false; sbh_.isMainBranch_ = true; sbh_.numTx_ = 15; sbh_.numBytes_ = 65535; // SetUp already contains sbh_.unserialize(rawHead_); BinaryData flags = READHEX("01260000"); BinaryData ntx = READHEX("0f000000"); BinaryData nbyte = READHEX("ffff0000"); BinaryData headBlkData = flags + rawHead_ + ntx + nbyte + sbh_.merkle_; EXPECT_EQ(sbh_.serializeDBValue(BLKDATA), headBlkData); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SHeaderDBSerFull_B3) { DBUtils.setArmoryDbType(ARMORY_DB_LITE); DBUtils.setDbPruneType(DB_PRUNE_ALL); BinaryWriter bw; sbh_.blockHeight_ = 65535; sbh_.duplicateID_ = 1; sbh_.merkle_ = BinaryData(0); sbh_.merkleIsPartial_ = false; sbh_.isMainBranch_ = true; sbh_.numTx_ = 15; sbh_.numBytes_ = 65535; // SetUp already contains sbh_.unserialize(rawHead_); BinaryData flags = READHEX("01100000"); BinaryData ntx = READHEX("0f000000"); BinaryData nbyte = READHEX("ffff0000"); BinaryData headBlkData = flags + rawHead_ + ntx + nbyte; EXPECT_EQ(sbh_.serializeDBValue(BLKDATA), headBlkData); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SHeaderDBUnserFull_H) { BinaryData dbval = READHEX( "010000001d8f4ec0443e1f19f305e488c1085c95de7cc3fd25e0d2c5bb5d0000" "000000009762547903d36881a86751f3f5049e23050113f779735ef82734ebf0" "b4450081d8c8c84db3936a1a334b035b00ffff01"); BinaryRefReader brr(dbval); sbh_.unserializeDBValue(HEADERS, brr); EXPECT_EQ(sbh_.blockHeight_, 65535); EXPECT_EQ(sbh_.duplicateID_, 1); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SHeaderDBUnserFull_B1) { BinaryData dbval = READHEX( "01340000010000001d8f4ec0443e1f19f305e488c1085c95de7cc3fd25e0d2c5" "bb5d0000000000009762547903d36881a86751f3f5049e23050113f779735ef8" "2734ebf0b4450081d8c8c84db3936a1a334b035b0f000000ffff0000"); BinaryRefReader brr(dbval); sbh_.unserializeDBValue(BLKDATA, brr); sbh_.setHeightAndDup(65535, 1); EXPECT_EQ(sbh_.blockHeight_, 65535); EXPECT_EQ(sbh_.duplicateID_, 1); EXPECT_EQ(sbh_.merkle_ , READHEX("")); EXPECT_EQ(sbh_.numTx_ , 15); EXPECT_EQ(sbh_.numBytes_ , 65535); EXPECT_EQ(sbh_.unserArmVer_, 0x00); EXPECT_EQ(sbh_.unserBlkVer_, 1); EXPECT_EQ(sbh_.unserDbType_, ARMORY_DB_FULL); EXPECT_EQ(sbh_.unserPrType_, DB_PRUNE_NONE); EXPECT_EQ(sbh_.unserMkType_, MERKLE_SER_NONE); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SHeaderDBUnserFull_B2) { BinaryData dbval = READHEX( "01260000010000001d8f4ec0443e1f19f305e488c1085c95de7cc3fd25e0d2c5" "bb5d0000000000009762547903d36881a86751f3f5049e23050113f779735ef8" "2734ebf0b4450081d8c8c84db3936a1a334b035b0f000000ffff0000deadbeef"); BinaryRefReader brr(dbval); sbh_.unserializeDBValue(BLKDATA, brr); sbh_.setHeightAndDup(65535, 1); EXPECT_EQ(sbh_.blockHeight_ , 65535); EXPECT_EQ(sbh_.duplicateID_ , 1); EXPECT_EQ(sbh_.merkle_ , READHEX("deadbeef")); EXPECT_EQ(sbh_.numTx_ , 15); EXPECT_EQ(sbh_.numBytes_ , 65535); EXPECT_EQ(sbh_.unserArmVer_, 0x00); EXPECT_EQ(sbh_.unserBlkVer_, 1); EXPECT_EQ(sbh_.unserDbType_, ARMORY_DB_PARTIAL); EXPECT_EQ(sbh_.unserPrType_, DB_PRUNE_NONE); EXPECT_EQ(sbh_.unserMkType_, MERKLE_SER_FULL); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SHeaderDBUnserFull_B3) { BinaryData dbval = READHEX( "01100000010000001d8f4ec0443e1f19f305e488c1085c95de7cc3fd25e0d2c5" "bb5d0000000000009762547903d36881a86751f3f5049e23050113f779735ef8" "2734ebf0b4450081d8c8c84db3936a1a334b035b0f000000ffff0000"); BinaryRefReader brr(dbval); sbh_.unserializeDBValue(BLKDATA, brr); sbh_.setHeightAndDup(65535, 1); EXPECT_EQ(sbh_.blockHeight_, 65535); EXPECT_EQ(sbh_.duplicateID_, 1); EXPECT_EQ(sbh_.merkle_ , READHEX("")); EXPECT_EQ(sbh_.numTx_ , 15); EXPECT_EQ(sbh_.numBytes_ , 65535); EXPECT_EQ(sbh_.unserArmVer_, 0x00); EXPECT_EQ(sbh_.unserBlkVer_, 1); EXPECT_EQ(sbh_.unserDbType_, ARMORY_DB_LITE); EXPECT_EQ(sbh_.unserPrType_, DB_PRUNE_ALL); EXPECT_EQ(sbh_.unserMkType_, MERKLE_SER_NONE); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxUnserUnfrag) { Tx regTx(rawTx0_); StoredTx stx; stx.createFromTx(regTx, false); EXPECT_TRUE( stx.isInitialized()); EXPECT_TRUE( stx.haveAllTxOut()); EXPECT_FALSE(stx.isFragged_); EXPECT_EQ( stx.version_, 1); EXPECT_EQ( stx.blockHeight_, UINT32_MAX); EXPECT_EQ( stx.duplicateID_, UINT8_MAX); EXPECT_EQ( stx.txIndex_, UINT16_MAX); EXPECT_EQ( stx.dataCopy_.getSize(), 258); EXPECT_EQ( stx.numBytes_, 258); EXPECT_EQ( stx.fragBytes_, 190); ASSERT_EQ( stx.stxoMap_.size(), 2); EXPECT_TRUE( stx.stxoMap_[0].isInitialized()); EXPECT_TRUE( stx.stxoMap_[1].isInitialized()); EXPECT_EQ( stx.stxoMap_[0].txIndex_, UINT16_MAX); EXPECT_EQ( stx.stxoMap_[1].txIndex_, UINT16_MAX); EXPECT_EQ( stx.stxoMap_[0].txOutIndex_, 0); EXPECT_EQ( stx.stxoMap_[1].txOutIndex_, 1); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxUnserFragged) { Tx regTx(rawTx0_); StoredTx stx; stx.createFromTx(regTx, true); EXPECT_TRUE( stx.isInitialized()); EXPECT_TRUE( stx.haveAllTxOut()); EXPECT_TRUE( stx.isFragged_); EXPECT_EQ( stx.version_, 1); EXPECT_EQ( stx.blockHeight_, UINT32_MAX); EXPECT_EQ( stx.duplicateID_, UINT8_MAX); EXPECT_EQ( stx.txIndex_, UINT16_MAX); EXPECT_EQ( stx.dataCopy_.getSize(), 190); ASSERT_EQ( stx.stxoMap_.size(), 2); EXPECT_TRUE( stx.stxoMap_[0].isInitialized()); EXPECT_TRUE( stx.stxoMap_[1].isInitialized()); EXPECT_EQ( stx.stxoMap_[0].txIndex_, UINT16_MAX); EXPECT_EQ( stx.stxoMap_[1].txIndex_, UINT16_MAX); EXPECT_EQ( stx.stxoMap_[0].txOutIndex_, 0); EXPECT_EQ( stx.stxoMap_[1].txOutIndex_, 1); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxReconstruct) { Tx regTx, reconTx; StoredTx stx; // Reconstruct an unfragged tx regTx.unserialize(rawTx0_); stx.createFromTx(regTx, false); reconTx = stx.getTxCopy(); EXPECT_EQ(reconTx.serialize(), rawTx0_); EXPECT_EQ(stx.getSerializedTx(), rawTx0_); // Reconstruct an fragged tx regTx.unserialize(rawTx0_); stx.createFromTx(regTx, true); reconTx = stx.getTxCopy(); EXPECT_EQ(reconTx.serialize(), rawTx0_); EXPECT_EQ(stx.getSerializedTx(), rawTx0_); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxSerUnfragToFrag) { StoredTx stx; stx.unserialize(rawTxUnfrag_); EXPECT_EQ(stx.getSerializedTx(), rawTxUnfrag_); EXPECT_EQ(stx.getSerializedTxFragged(), rawTxFragged_); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxSerDBValue_1) { DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); Tx origTx(rawTxUnfrag_); StoredTx stx; stx.unserialize(rawTxUnfrag_); // 0123 45 67 01 23 4567 // |----| |--| |-- --| // DBVer TxVer TxSer // // For this example: DBVer=0, TxVer=1, TxSer=FRAGGED[1] // 0000 01 00 01 -- ---- BinaryData first2 = READHEX("0440"); // little-endian, of course BinaryData txHash = origTx.getThisHash(); BinaryData fragged = stx.getSerializedTxFragged(); BinaryData output = first2 + txHash + fragged; EXPECT_EQ(stx.serializeDBValue(), output); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, DISABLED_STxSerDBValue_2) { // I modified the ARMORY_DB_SUPER code to frag, as well. There's no // mode that doesn't frag, now. DBUtils.setArmoryDbType(ARMORY_DB_SUPER); DBUtils.setDbPruneType(DB_PRUNE_NONE); Tx origTx(rawTxUnfrag_); StoredTx stx; stx.unserialize(rawTxUnfrag_); // 0123 45 67 01 23 4567 // |----| |--| |-- --| // DBVer TxVer TxSer // // For this example: DBVer=0, TxVer=1, TxSer=FRAGGED[1] // 0000 01 00 00 -- ---- BinaryData first2 = READHEX("0400"); // little-endian, of course BinaryData txHash = origTx.getThisHash(); BinaryData fragged = stx.getSerializedTx(); // Full Tx this time BinaryData output = first2 + txHash + fragged; EXPECT_EQ(stx.serializeDBValue(), output); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxUnserDBValue_1) { Tx origTx(rawTxUnfrag_); BinaryData toUnser = READHEX( "0440e471262336aa67391e57c8c6fe03bae29734079e06ff75c7fa4d0a873c83" "f03c01000000020044fbc929d78e4203eed6f1d3d39c0157d8e5c100bbe08867" "79c0ebf6a69324010000008a47304402206568144ed5e7064d6176c74738b04c" "08ca19ca54ddeb480084b77f45eebfe57802207927d6975a5ac0e1bb36f5c053" "56dcda1f521770511ee5e03239c8e1eecf3aed0141045d74feae58c4c36d7c35" "beac05eddddc78b3ce4b02491a2eea72043978056a8bc439b99ddaad327207b0" "9ef16a8910828e805b0cc8c11fba5caea2ee939346d7ffffffff45c866b219b1" "76952508f8e5aea728f950186554fc4a5807e2186a8e1c4009e5000000008c49" "3046022100bd5d41662f98cfddc46e86ea7e4a3bc8fe9f1dfc5c4836eaf7df58" "2596cfe0e9022100fc459ae4f59b8279d679003b88935896acd10021b6e2e461" "9377e336b5296c5e014104c00bab76a708ba7064b2315420a1c533ca9945eeff" "9754cdc574224589e9113469b4e71752146a10028079e04948ecdf70609bf1b9" "801f6b73ab75947ac339e5ffffffff0200000000"); BinaryRefReader brr(toUnser); StoredTx stx; stx.unserializeDBValue(brr); EXPECT_TRUE( stx.isInitialized()); EXPECT_EQ( stx.thisHash_, origTx.getThisHash()); EXPECT_EQ( stx.lockTime_, origTx.getLockTime()); EXPECT_EQ( stx.dataCopy_, rawTxFragged_); EXPECT_TRUE( stx.isFragged_); EXPECT_EQ( stx.version_, 1); EXPECT_EQ( stx.blockHeight_, UINT32_MAX); EXPECT_EQ( stx.duplicateID_, UINT8_MAX); EXPECT_EQ( stx.txIndex_, UINT16_MAX); EXPECT_EQ( stx.numTxOut_, origTx.getNumTxOut()); EXPECT_EQ( stx.numBytes_, UINT32_MAX); EXPECT_EQ( stx.fragBytes_, 370); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxUnserDBValue_2) { Tx origTx(rawTxUnfrag_); BinaryData toUnser = READHEX( "0004e471262336aa67391e57c8c6fe03bae29734079e06ff75c7fa4d0a873c83" "f03c01000000020044fbc929d78e4203eed6f1d3d39c0157d8e5c100bbe08867" "79c0ebf6a69324010000008a47304402206568144ed5e7064d6176c74738b04c" "08ca19ca54ddeb480084b77f45eebfe57802207927d6975a5ac0e1bb36f5c053" "56dcda1f521770511ee5e03239c8e1eecf3aed0141045d74feae58c4c36d7c35" "beac05eddddc78b3ce4b02491a2eea72043978056a8bc439b99ddaad327207b0" "9ef16a8910828e805b0cc8c11fba5caea2ee939346d7ffffffff45c866b219b1" "76952508f8e5aea728f950186554fc4a5807e2186a8e1c4009e5000000008c49" "3046022100bd5d41662f98cfddc46e86ea7e4a3bc8fe9f1dfc5c4836eaf7df58" "2596cfe0e9022100fc459ae4f59b8279d679003b88935896acd10021b6e2e461" "9377e336b5296c5e014104c00bab76a708ba7064b2315420a1c533ca9945eeff" "9754cdc574224589e9113469b4e71752146a10028079e04948ecdf70609bf1b9" "801f6b73ab75947ac339e5ffffffff02ac4c8bd5000000001976a9148dce8946" "f1c7763bb60ea5cf16ef514cbed0633b88ac002f6859000000001976a9146a59" "ac0e8f553f292dfe5e9f3aaa1da93499c15e88ac00000000"); BinaryRefReader brr(toUnser); StoredTx stx; stx.unserializeDBValue(brr); EXPECT_TRUE( stx.isInitialized()); EXPECT_EQ( stx.thisHash_, origTx.getThisHash()); EXPECT_EQ( stx.lockTime_, origTx.getLockTime()); EXPECT_EQ( stx.dataCopy_, rawTxUnfrag_); EXPECT_FALSE(stx.isFragged_); EXPECT_EQ( stx.version_, 1); EXPECT_EQ( stx.blockHeight_, UINT32_MAX); EXPECT_EQ( stx.duplicateID_, UINT8_MAX); EXPECT_EQ( stx.txIndex_, UINT16_MAX); EXPECT_EQ( stx.numTxOut_, origTx.getNumTxOut()); EXPECT_EQ( stx.numBytes_, origTx.getSize()); EXPECT_EQ( stx.fragBytes_, 370); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxOutUnserialize) { TxOut txo0, txo1; StoredTxOut stxo0, stxo1; stxo0.unserialize(rawTxOut0_); stxo1.unserialize(rawTxOut1_); txo0.unserialize(rawTxOut0_); txo1.unserialize(rawTxOut1_); uint64_t val0 = READ_UINT64_HEX_LE("ac4c8bd500000000"); uint64_t val1 = READ_UINT64_HEX_LE("002f685900000000"); EXPECT_EQ(stxo0.getSerializedTxOut(), rawTxOut0_); EXPECT_EQ(stxo0.getSerializedTxOut(), txo0.serialize()); EXPECT_EQ(stxo1.getSerializedTxOut(), rawTxOut1_); EXPECT_EQ(stxo1.getSerializedTxOut(), txo1.serialize()); EXPECT_EQ(stxo0.getValue(), val0); EXPECT_EQ(stxo1.getValue(), val1); TxOut txoRecon = stxo0.getTxOutCopy(); EXPECT_EQ(txoRecon.serialize(), rawTxOut0_); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxOutSerDBValue_1) { DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); StoredTxOut stxo0; stxo0.unserialize(rawTxOut0_); stxo0.txVersion_ = 1; stxo0.spentness_ = TXOUT_UNSPENT; // 0123 45 67 0 123 4567 // |----| |--| |--| |-| // DBVer TxVer Spnt CB // // For this example: DBVer=0, TxVer=1, TxSer=FRAGGED[1] // 0000 01 00 0 --- ---- EXPECT_EQ(stxo0.serializeDBValue(), READHEX("0400") + rawTxOut0_); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxOutSerDBValue_2) { DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); StoredTxOut stxo0; stxo0.unserialize(rawTxOut0_); stxo0.txVersion_ = 1; stxo0.spentness_ = TXOUT_UNSPENT; // Test a spent TxOut // 0000 01 01 0 --- ---- BinaryData spentStr = DBUtils.getBlkDataKeyNoPrefix( 100000, 1, 127, 15); stxo0.spentness_ = TXOUT_SPENT; stxo0.spentByTxInKey_ = spentStr; EXPECT_EQ(stxo0.serializeDBValue(), READHEX("0500")+rawTxOut0_+spentStr); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxOutSerDBValue_3) { DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); StoredTxOut stxo0; stxo0.unserialize(rawTxOut0_); stxo0.txVersion_ = 1; stxo0.isCoinbase_ = true; // Test a spent TxOut but in lite mode where we don't record spentness // 0000 01 01 1 --- ---- DBUtils.setArmoryDbType(ARMORY_DB_LITE); DBUtils.setDbPruneType(DB_PRUNE_NONE); BinaryData spentStr = DBUtils.getBlkDataKeyNoPrefix( 100000, 1, 127, 15); stxo0.spentness_ = TXOUT_SPENT; stxo0.spentByTxInKey_ = spentStr; EXPECT_EQ(stxo0.serializeDBValue(), READHEX("0680")+rawTxOut0_); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxOutUnserDBValue_1) { BinaryData input = READHEX( "0400ac4c8bd5000000001976a9148dce8946f1c7763b" "b60ea5cf16ef514cbed0633b88ac"); StoredTxOut stxo; stxo.unserializeDBValue(input); EXPECT_TRUE( stxo.isInitialized()); EXPECT_EQ( stxo.txVersion_, 1); EXPECT_EQ( stxo.dataCopy_, rawTxOut0_); EXPECT_EQ( stxo.blockHeight_, UINT32_MAX); EXPECT_EQ( stxo.duplicateID_, UINT8_MAX); EXPECT_EQ( stxo.txIndex_, UINT16_MAX); EXPECT_EQ( stxo.txOutIndex_, UINT16_MAX); EXPECT_EQ( stxo.spentness_, TXOUT_UNSPENT); EXPECT_EQ( stxo.spentByTxInKey_.getSize(), 0); EXPECT_FALSE(stxo.isCoinbase_); EXPECT_EQ( stxo.unserArmVer_, 0); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxOutUnserDBValue_2) { BinaryData input = READHEX( "0500ac4c8bd5000000001976a9148dce8946f1c7763b" "b60ea5cf16ef514cbed0633b88ac01a086017f000f00"); StoredTxOut stxo; stxo.unserializeDBValue(input); EXPECT_TRUE( stxo.isInitialized()); EXPECT_EQ( stxo.txVersion_, 1); EXPECT_EQ( stxo.dataCopy_, rawTxOut0_); EXPECT_EQ( stxo.blockHeight_, UINT32_MAX); EXPECT_EQ( stxo.duplicateID_, UINT8_MAX); EXPECT_EQ( stxo.txIndex_, UINT16_MAX); EXPECT_EQ( stxo.txOutIndex_, UINT16_MAX); EXPECT_EQ( stxo.spentness_, TXOUT_SPENT); EXPECT_FALSE(stxo.isCoinbase_); EXPECT_EQ( stxo.spentByTxInKey_, READHEX("01a086017f000f00")); EXPECT_EQ( stxo.unserArmVer_, 0); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxOutUnserDBValue_3) { BinaryData input = READHEX( "0680ac4c8bd5000000001976a9148dce8946f1c7763b" "b60ea5cf16ef514cbed0633b88ac"); StoredTxOut stxo; stxo.unserializeDBValue(input); EXPECT_TRUE( stxo.isInitialized()); EXPECT_EQ( stxo.txVersion_, 1); EXPECT_EQ( stxo.dataCopy_, rawTxOut0_); EXPECT_EQ( stxo.blockHeight_, UINT32_MAX); EXPECT_EQ( stxo.duplicateID_, UINT8_MAX); EXPECT_EQ( stxo.txIndex_, UINT16_MAX); EXPECT_EQ( stxo.txOutIndex_, UINT16_MAX); EXPECT_EQ( stxo.spentness_, TXOUT_SPENTUNK); EXPECT_TRUE( stxo.isCoinbase_); EXPECT_EQ( stxo.spentByTxInKey_.getSize(), 0); EXPECT_EQ( stxo.unserArmVer_, 0); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SHeaderFullBlock) { // I'll make this more robust later... kind of tired of writing tests... StoredHeader sbh; sbh.unserializeFullBlock(rawBlock_.getRef()); BinaryWriter bw; sbh.serializeFullBlock(bw); EXPECT_EQ(bw.getDataRef(), rawBlock_.getRef()); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SUndoDataSer) { DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); BinaryData arbHash = READHEX("11112221111222111122222211112222" "11112221111222111122211112221111"); BinaryData op0_str = READHEX("aaaabbbbaaaabbbbaaaabbbbaaaabbbb" "aaaabbbbaaaabbbbaaaabbbbaaaabbbb"); BinaryData op1_str = READHEX("ffffbbbbffffbbbbffffbbbbffffbbbb" "ffffbbbbffffbbbbffffbbbbffffbbbb"); StoredUndoData sud; OutPoint op0(op0_str, 1); OutPoint op1(op1_str, 2); StoredTxOut stxo0, stxo1; stxo0.unserialize(rawTxOut0_); stxo1.unserialize(rawTxOut1_); stxo0.txVersion_ = 1; stxo1.txVersion_ = 1; stxo0.blockHeight_ = 100000; stxo1.blockHeight_ = 100000; stxo0.duplicateID_ = 2; stxo1.duplicateID_ = 2; stxo0.txIndex_ = 17; stxo1.txIndex_ = 17; stxo0.parentHash_ = arbHash; stxo1.parentHash_ = arbHash; stxo0.txOutIndex_ = 5; stxo1.txOutIndex_ = 5; sud.stxOutsRemovedByBlock_.clear(); sud.stxOutsRemovedByBlock_.push_back(stxo0); sud.stxOutsRemovedByBlock_.push_back(stxo1); sud.outPointsAddedByBlock_.clear(); sud.outPointsAddedByBlock_.push_back(op0); sud.outPointsAddedByBlock_.push_back(op1); sud.blockHash_ = arbHash; sud.blockHeight_ = 123000; // unused for this test sud.duplicateID_ = 15; // unused for this test BinaryData flags = READHEX("34"); BinaryData str2 = WRITE_UINT32_LE(2); BinaryData str5 = WRITE_UINT32_LE(5); BinaryData answer = arbHash + str2 + flags + stxo0.getDBKey(false) + arbHash + str5 + rawTxOut0_ + flags + stxo1.getDBKey(false) + arbHash + str5 + rawTxOut1_ + str2 + op0.serialize() + op1.serialize(); EXPECT_EQ(sud.serializeDBValue(), answer); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SUndoDataUnser) { DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); BinaryData arbHash = READHEX("11112221111222111122222211112222" "11112221111222111122211112221111"); BinaryData op0_str = READHEX("aaaabbbbaaaabbbbaaaabbbbaaaabbbb" "aaaabbbbaaaabbbbaaaabbbbaaaabbbb"); BinaryData op1_str = READHEX("ffffbbbbffffbbbbffffbbbbffffbbbb" "ffffbbbbffffbbbbffffbbbbffffbbbb"); OutPoint op0(op0_str, 1); OutPoint op1(op1_str, 2); //BinaryData sudToUnser = READHEX( //"1111222111122211112222221111222211112221111222111122211112221111" //"0200000024111122211112221111222222111122221111222111122211112221" //"111222111105000000ac4c8bd5000000001976a9148dce8946f1c7763bb60ea5" //"cf16ef514cbed0633b88ac241111222111122211112222221111222211112221" //"11122211112221111222111105000000002f6859000000001976a9146a59ac0e" //"8f553f292dfe5e9f3aaa1da93499c15e88ac02000000aaaabbbbaaaabbbbaaaa" //"bbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbb01000000ffffbbbbffff" //"bbbbffffbbbbffffbbbbffffbbbbffffbbbbffffbbbbffffbbbb02000000"); BinaryData sudToUnser = READHEX( "1111222111122211112222221111222211112221111222111122211112221111" "02000000240186a0020011000511112221111222111122222211112222111122" "2111122211112221111222111105000000ac4c8bd5000000001976a9148dce89" "46f1c7763bb60ea5cf16ef514cbed0633b88ac240186a0020011000511112221" "1112221111222222111122221111222111122211112221111222111105000000" "002f6859000000001976a9146a59ac0e8f553f292dfe5e9f3aaa1da93499c15e" "88ac02000000aaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaa" "bbbbaaaabbbb01000000ffffbbbbffffbbbbffffbbbbffffbbbbffffbbbbffff" "bbbbffffbbbbffffbbbb02000000"); StoredUndoData sud; sud.unserializeDBValue(sudToUnser); ASSERT_EQ(sud.outPointsAddedByBlock_.size(), 2); ASSERT_EQ(sud.stxOutsRemovedByBlock_.size(), 2); EXPECT_EQ(sud.outPointsAddedByBlock_[0].serialize(), op0.serialize()); EXPECT_EQ(sud.outPointsAddedByBlock_[1].serialize(), op1.serialize()); EXPECT_EQ(sud.stxOutsRemovedByBlock_[0].getSerializedTxOut(), rawTxOut0_); EXPECT_EQ(sud.stxOutsRemovedByBlock_[1].getSerializedTxOut(), rawTxOut1_); EXPECT_EQ(sud.stxOutsRemovedByBlock_[0].parentHash_, arbHash); EXPECT_EQ(sud.stxOutsRemovedByBlock_[1].parentHash_, arbHash); EXPECT_EQ(sud.stxOutsRemovedByBlock_[0].blockHeight_, 100000); EXPECT_EQ(sud.stxOutsRemovedByBlock_[1].blockHeight_, 100000); EXPECT_EQ(sud.stxOutsRemovedByBlock_[0].duplicateID_, 2); EXPECT_EQ(sud.stxOutsRemovedByBlock_[1].duplicateID_, 2); EXPECT_EQ(sud.stxOutsRemovedByBlock_[0].txIndex_, 17); EXPECT_EQ(sud.stxOutsRemovedByBlock_[1].txIndex_, 17); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxHintsSer) { BinaryData hint0 = DBUtils.getBlkDataKeyNoPrefix(123000, 7, 255); BinaryData hint1 = DBUtils.getBlkDataKeyNoPrefix(123000, 15, 127); BinaryData hint2 = DBUtils.getBlkDataKeyNoPrefix(183922, 15, 3); StoredTxHints sths; sths.txHashPrefix_ = READHEX("aaaaffff"); sths.dbKeyList_.clear(); ///// BinaryWriter ans0; ans0.put_var_int(0); EXPECT_EQ(sths.serializeDBValue(), ans0.getData()); ///// sths.dbKeyList_.push_back(hint0); sths.preferredDBKey_ = hint0; BinaryWriter ans1; ans1.put_var_int(1); ans1.put_BinaryData(hint0); EXPECT_EQ(sths.dbKeyList_.size(), 1); EXPECT_EQ(sths.preferredDBKey_, hint0); EXPECT_EQ(sths.serializeDBValue(), ans1.getData()); ///// sths.dbKeyList_.push_back(hint1); sths.dbKeyList_.push_back(hint2); BinaryWriter ans3; ans3.put_var_int(3); ans3.put_BinaryData(hint0); ans3.put_BinaryData(hint1); ans3.put_BinaryData(hint2); EXPECT_EQ(sths.dbKeyList_.size(), 3); EXPECT_EQ(sths.preferredDBKey_, hint0); EXPECT_EQ(sths.serializeDBValue(), ans3.getData()); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxHintsReorder) { BinaryData hint0 = DBUtils.getBlkDataKeyNoPrefix(123000, 7, 255); BinaryData hint1 = DBUtils.getBlkDataKeyNoPrefix(123000, 15, 127); BinaryData hint2 = DBUtils.getBlkDataKeyNoPrefix(183922, 15, 3); StoredTxHints sths; sths.txHashPrefix_ = READHEX("aaaaffff"); sths.dbKeyList_.clear(); sths.dbKeyList_.push_back(hint0); sths.dbKeyList_.push_back(hint1); sths.dbKeyList_.push_back(hint2); sths.preferredDBKey_ = hint1; BinaryWriter expectedOut; expectedOut.put_var_int(3); expectedOut.put_BinaryData(hint1); expectedOut.put_BinaryData(hint0); expectedOut.put_BinaryData(hint2); EXPECT_EQ(sths.serializeDBValue(), expectedOut.getData()); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, STxHintsUnser) { BinaryData hint0 = DBUtils.getBlkDataKeyNoPrefix(123000, 7, 255); BinaryData hint1 = DBUtils.getBlkDataKeyNoPrefix(123000, 15, 127); BinaryData hint2 = DBUtils.getBlkDataKeyNoPrefix(183922, 15, 3); BinaryData in0 = READHEX("00"); BinaryData in1 = READHEX("01""01e0780700ff"); BinaryData in3 = READHEX("03""01e0780700ff""01e0780f007f""02ce720f0003"); StoredTxHints sths0, sths1, sths3; sths0.unserializeDBValue(in0); EXPECT_EQ(sths0.dbKeyList_.size(), 0); EXPECT_EQ(sths0.preferredDBKey_.getSize(), 0); sths1.unserializeDBValue(in1); EXPECT_EQ(sths1.dbKeyList_.size(), 1); EXPECT_EQ(sths1.dbKeyList_[0], hint0); EXPECT_EQ(sths1.preferredDBKey_, hint0); sths3.unserializeDBValue(in3); EXPECT_EQ(sths3.dbKeyList_.size(), 3); EXPECT_EQ(sths3.dbKeyList_[0], hint0); EXPECT_EQ(sths3.dbKeyList_[1], hint1); EXPECT_EQ(sths3.dbKeyList_[2], hint2); EXPECT_EQ(sths3.preferredDBKey_, hint0); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SHeadHgtListSer) { StoredHeadHgtList baseHHL, testHHL; baseHHL.height_ = 123000; baseHHL.dupAndHashList_.resize(0); BinaryData hash0 = READHEX("aaaabbbbaaaabbbbaaaabbbbaaaabbbb" "aaaabbbbaaaabbbbaaaabbbbaaaabbbb"); BinaryData hash1 = READHEX("2222bbbb2222bbbb2222bbbb2222bbbb" "2222bbbb2222bbbb2222bbbb2222bbbb"); BinaryData hash2 = READHEX("2222ffff2222ffff2222ffff2222ffff" "2222ffff2222ffff2222ffff2222ffff"); uint8_t dup0 = 0; uint8_t dup1 = 1; uint8_t dup2 = 7; BinaryWriter expectOut; // Test writing empty list expectOut.reset(); expectOut.put_uint8_t(0); EXPECT_EQ(testHHL.serializeDBValue(), expectOut.getData()); // Test writing list with one entry but no preferred dupID expectOut.reset(); testHHL = baseHHL; testHHL.dupAndHashList_.push_back(pair(dup0, hash0)); expectOut.put_uint8_t(1); expectOut.put_uint8_t(dup0); expectOut.put_BinaryData(hash0); EXPECT_EQ(testHHL.serializeDBValue(), expectOut.getData()); // Test writing list with one entry which is a preferred dupID expectOut.reset(); testHHL = baseHHL; testHHL.preferredDup_ = 0; testHHL.dupAndHashList_.push_back(pair(dup0, hash0)); expectOut.put_uint8_t(1); expectOut.put_uint8_t(dup0 | 0x80); expectOut.put_BinaryData(hash0); EXPECT_EQ(testHHL.serializeDBValue(), expectOut.getData()); // Test writing list with one entry preferred dupID but that dup isn't avail expectOut.reset(); testHHL = baseHHL; testHHL.preferredDup_ = 1; testHHL.dupAndHashList_.push_back(pair(dup0, hash0)); expectOut.put_uint8_t(1); expectOut.put_uint8_t(dup0); expectOut.put_BinaryData(hash0); EXPECT_EQ(testHHL.serializeDBValue(), expectOut.getData()); // Test writing with three entries, no preferred expectOut.reset(); testHHL = baseHHL; testHHL.dupAndHashList_.push_back(pair(dup0, hash0)); testHHL.dupAndHashList_.push_back(pair(dup1, hash1)); testHHL.dupAndHashList_.push_back(pair(dup2, hash2)); expectOut.put_uint8_t(3); expectOut.put_uint8_t(dup0); expectOut.put_BinaryData(hash0); expectOut.put_uint8_t(dup1); expectOut.put_BinaryData(hash1); expectOut.put_uint8_t(dup2); expectOut.put_BinaryData(hash2); EXPECT_EQ(testHHL.serializeDBValue(), expectOut.getData()); // Test writing with three entries, with preferred expectOut.reset(); testHHL = baseHHL; testHHL.dupAndHashList_.push_back(pair(dup0, hash0)); testHHL.dupAndHashList_.push_back(pair(dup1, hash1)); testHHL.dupAndHashList_.push_back(pair(dup2, hash2)); testHHL.preferredDup_ = 1; expectOut.put_uint8_t(3); expectOut.put_uint8_t(dup1 | 0x80); expectOut.put_BinaryData(hash1); expectOut.put_uint8_t(dup0); expectOut.put_BinaryData(hash0); expectOut.put_uint8_t(dup2); expectOut.put_BinaryData(hash2); EXPECT_EQ(testHHL.serializeDBValue(), expectOut.getData()); } //////////////////////////////////////////////////////////////////////////////// TEST_F(StoredBlockObjTest, SHeadHgtListUnser) { BinaryData hash0 = READHEX("aaaabbbbaaaabbbbaaaabbbbaaaabbbb" "aaaabbbbaaaabbbbaaaabbbbaaaabbbb"); BinaryData hash1 = READHEX("2222bbbb2222bbbb2222bbbb2222bbbb" "2222bbbb2222bbbb2222bbbb2222bbbb"); BinaryData hash2 = READHEX("2222ffff2222ffff2222ffff2222ffff" "2222ffff2222ffff2222ffff2222ffff"); vector tests; tests.push_back( READHEX( "0100aaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbb")); tests.push_back( READHEX( "0180aaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbb")); tests.push_back( READHEX( "0300aaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaa" "bbbb012222bbbb2222bbbb2222bbbb2222bbbb2222bbbb2222bbbb2222bbbb22" "22bbbb072222ffff2222ffff2222ffff2222ffff2222ffff2222ffff2222ffff" "2222ffff")); tests.push_back( READHEX( "03812222bbbb2222bbbb2222bbbb2222bbbb2222bbbb2222bbbb2222bbbb2222" "bbbb00aaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaa" "aabbbb072222ffff2222ffff2222ffff2222ffff2222ffff2222ffff2222ffff" "2222ffff")); uint8_t dup0 = 0; uint8_t dup1 = 1; uint8_t dup2 = 7; for(uint32_t i=0; isetValidDupIDForHeight(hgt,dup); ssh.uniqueKey_ = HASH160PREFIX + a160; ssh.version_ = 1; ssh.alreadyScannedUpToBlk_ = UINT32_MAX; ssh.markTxOutUnspent(txio0); // Check the initial state matches expectations EXPECT_EQ(ssh.serializeDBValue(), expectSSH_orig); ssh.insertTxio(txio1); // Mark the first output spent (second one was already marked spent) ssh.markTxOutSpent( dbKey0, dbKey5); EXPECT_EQ(ssh.serializeDBValue(), expectSSH_bothspent); // Undo the last operation ssh.markTxOutUnspent(dbKey0); EXPECT_EQ(ssh.serializeDBValue(), expectSSH_orig); ssh.markTxOutUnspent(dbKey1); EXPECT_EQ(ssh.serializeDBValue(), expectSSH_bothunspent); ssh.markTxOutSpent( dbKey1, dbKey2); EXPECT_EQ(ssh.serializeDBValue(), expectSSH_orig); ssh.eraseTxio(dbKey1); EXPECT_EQ(ssh.serializeDBValue(), expectSSH_afterrm); } */ //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class LevelDBTest : public ::testing::Test { protected: virtual void SetUp(void) { iface_ = LevelDBWrapper::GetInterfacePtr(); magic_ = READHEX(MAINNET_MAGIC_BYTES); ghash_ = READHEX(MAINNET_GENESIS_HASH_HEX); gentx_ = READHEX(MAINNET_GENESIS_TX_HASH_HEX); zeros_ = READHEX("00000000"); DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); rawHead_ = READHEX( "01000000" "1d8f4ec0443e1f19f305e488c1085c95de7cc3fd25e0d2c5bb5d000000000000" "9762547903d36881a86751f3f5049e23050113f779735ef82734ebf0b4450081" "d8c8c84d" "b3936a1a" "334b035b"); headHashLE_ = READHEX( "1195e67a7a6d0674bbd28ae096d602e1f038c8254b49dfe79d47000000000000"); headHashBE_ = READHEX( "000000000000479de7df494b25c838f0e102d696e08ad2bb74066d7a7ae69511"); rawTx0_ = READHEX( "01000000016290dce984203b6a5032e543e9e272d8bce934c7de4d15fa0fe44d" "d49ae4ece9010000008b48304502204f2fa458d439f957308bca264689aa175e" "3b7c5f78a901cb450ebd20936b2c500221008ea3883a5b80128e55c9c6070aa6" "264e1e0ce3d18b7cd7e85108ce3d18b7419a0141044202550a5a6d3bb81549c4" "a7803b1ad59cdbba4770439a4923624a8acfc7d34900beb54a24188f7f0a4068" "9d905d4847cc7d6c8d808a457d833c2d44ef83f76bffffffff0242582c0a0000" "00001976a914c1b4695d53b6ee57a28647ce63e45665df6762c288ac80d1f008" "000000001976a9140e0aec36fe2545fb31a41164fb6954adcd96b34288ac0000" "0000"); rawTx1_ = READHEX( "0100000001f658dbc28e703d86ee17c9a2d3b167a8508b082fa0745f55be5144" "a4369873aa010000008c49304602210041e1186ca9a41fdfe1569d5d807ca7ff" "6c5ffd19d2ad1be42f7f2a20cdc8f1cc0221003366b5d64fe81e53910e156914" "091d12646bc0d1d662b7a65ead3ebe4ab8f6c40141048d103d81ac9691cf13f3" "fc94e44968ef67b27f58b27372c13108552d24a6ee04785838f34624b294afee" "83749b64478bb8480c20b242c376e77eea2b3dc48b4bffffffff0200e1f50500" "0000001976a9141b00a2f6899335366f04b277e19d777559c35bc888ac40aeeb" "02000000001976a9140e0aec36fe2545fb31a41164fb6954adcd96b34288ac00" "000000"); rawBlock_ = READHEX( // Header "01000000eb10c9a996a2340a4d74eaab41421ed8664aa49d18538bab59010000" "000000005a2f06efa9f2bd804f17877537f2080030cadbfa1eb50e02338117cc" "604d91b9b7541a4ecfbb0a1a64f1ade7" // 3 transactions "03" ///// Tx0, version "01000000" "01" // Tx0, Txin0 "0000000000000000000000000000000000000000000000000000000000000000" "ffffffff" "08""04cfbb0a1a02360a""ffffffff" // Tx0, 1 TxOut "01" // Tx0, TxOut0 "00f2052a01000000" "434104c2239c4eedb3beb26785753463be3ec62b82f6acd62efb65f452f8806f" "2ede0b338e31d1f69b1ce449558d7061aa1648ddc2bf680834d3986624006a27" "2dc21cac" // Tx0, Locktime "00000000" ///// Tx1, Version "01000000" // Tx1, 3 txins "03" // Tx1, TxIn0 "e8caa12bcb2e7e86499c9de49c45c5a1c6167ea4b894c8c83aebba1b6100f343" "01000000" "8c493046022100e2f5af5329d1244807f8347a2c8d9acc55a21a5db769e9274e" "7e7ba0bb605b26022100c34ca3350df5089f3415d8af82364d7f567a6a297fcc" "2c1d2034865633238b8c014104129e422ac490ddfcb7b1c405ab9fb42441246c" "4bca578de4f27b230de08408c64cad03af71ee8a3140b40408a7058a1984a9f2" "46492386113764c1ac132990d1""ffffffff" // Tx1, TxIn1 "5b55c18864e16c08ef9989d31c7a343e34c27c30cd7caa759651b0e08cae0106" "00000000" "8c4930460221009ec9aa3e0caf7caa321723dea561e232603e00686d4bfadf46" "c5c7352b07eb00022100a4f18d937d1e2354b2e69e02b18d11620a6a9332d563" "e9e2bbcb01cee559680a014104411b35dd963028300e36e82ee8cf1b0c8d5bf1" "fc4273e970469f5cb931ee07759a2de5fef638961726d04bd5eb4e5072330b9b" "371e479733c942964bb86e2b22""ffffffff" // Tx1, TxIn2 "3de0c1e913e6271769d8c0172cea2f00d6d3240afc3a20f9fa247ce58af30d2a" "01000000" "8c493046022100b610e169fd15ac9f60fe2b507529281cf2267673f4690ba428" "cbb2ba3c3811fd022100ffbe9e3d71b21977a8e97fde4c3ba47b896d08bc09ec" "b9d086bb59175b5b9f03014104ff07a1833fd8098b25f48c66dcf8fde34cbdbc" "c0f5f21a8c2005b160406cbf34cc432842c6b37b2590d16b165b36a3efc9908d" "65fb0e605314c9b278f40f3e1a""ffffffff" // Tx1, 2 TxOuts "02" // Tx1, TxOut0 "40420f0000000000""19""76a914adfa66f57ded1b655eb4ccd96ee07ca62bc1ddfd88ac" // Tx1, TxOut1 "007d6a7d04000000""19""76a914981a0c9ae61fa8f8c96ae6f8e383d6e07e77133e88ac" // Tx1 Locktime "00000000" ///// Tx2 Version "01000000" // Tx2 1 TxIn "01" "38e7586e0784280df58bd3dc5e3d350c9036b1ec4107951378f45881799c92a4" "00000000" "8a47304402207c945ae0bbdaf9dadba07bdf23faa676485a53817af975ddf85a" "104f764fb93b02201ac6af32ddf597e610b4002e41f2de46664587a379a01613" "23a85389b4f82dda014104ec8883d3e4f7a39d75c9f5bb9fd581dc9fb1b7cdf7" "d6b5a665e4db1fdb09281a74ab138a2dba25248b5be38bf80249601ae688c90c" "6e0ac8811cdb740fcec31d""ffffffff" // Tx2, 2 TxOuts "02" // Tx2, TxOut0 "2f66ac6105000000""19""76a914964642290c194e3bfab661c1085e47d67786d2d388ac" // Tx2, TxOut1 "2f77e20000000000""19""76a9141486a7046affd935919a3cb4b50a8a0c233c286c88ac" // Tx2 Locktime "00000000"); rawTxUnfrag_ = READHEX( // Version "01000000" // NumTxIn "02" // Start TxIn0 "0044fbc929d78e4203eed6f1d3d39c0157d8e5c100bbe0886779c0" "ebf6a69324010000008a47304402206568144ed5e7064d6176c74738b04c08ca" "19ca54ddeb480084b77f45eebfe57802207927d6975a5ac0e1bb36f5c05356dc" "da1f521770511ee5e03239c8e1eecf3aed0141045d74feae58c4c36d7c35beac" "05eddddc78b3ce4b02491a2eea72043978056a8bc439b99ddaad327207b09ef1" "6a8910828e805b0cc8c11fba5caea2ee939346d7ffffffff" // Start TxIn1 "45c866b219b17695" "2508f8e5aea728f950186554fc4a5807e2186a8e1c4009e5000000008c493046" "022100bd5d41662f98cfddc46e86ea7e4a3bc8fe9f1dfc5c4836eaf7df582596" "cfe0e9022100fc459ae4f59b8279d679003b88935896acd10021b6e2e4619377" "e336b5296c5e014104c00bab76a708ba7064b2315420a1c533ca9945eeff9754" "cdc574224589e9113469b4e71752146a10028079e04948ecdf70609bf1b9801f" "6b73ab75947ac339e5ffffffff" // NumTxOut "02" // Start TxOut0 "ac4c8bd5000000001976a9148dce8946f1c7763bb60ea5cf16ef514cbed0633b88ac" // Start TxOut1 "002f6859000000001976a9146a59ac0e8f553f292dfe5e9f3aaa1da93499c15e88ac" // Locktime "00000000"); rawTxFragged_ = READHEX( // Version "01000000" // NumTxIn "02" // Start TxIn0 "0044fbc929d78e4203eed6f1d3d39c0157d8e5c100bbe0886779c0" "ebf6a69324010000008a47304402206568144ed5e7064d6176c74738b04c08ca" "19ca54ddeb480084b77f45eebfe57802207927d6975a5ac0e1bb36f5c05356dc" "da1f521770511ee5e03239c8e1eecf3aed0141045d74feae58c4c36d7c35beac" "05eddddc78b3ce4b02491a2eea72043978056a8bc439b99ddaad327207b09ef1" "6a8910828e805b0cc8c11fba5caea2ee939346d7ffffffff" // Start TxIn1 "45c866b219b17695" "2508f8e5aea728f950186554fc4a5807e2186a8e1c4009e5000000008c493046" "022100bd5d41662f98cfddc46e86ea7e4a3bc8fe9f1dfc5c4836eaf7df582596" "cfe0e9022100fc459ae4f59b8279d679003b88935896acd10021b6e2e4619377" "e336b5296c5e014104c00bab76a708ba7064b2315420a1c533ca9945eeff9754" "cdc574224589e9113469b4e71752146a10028079e04948ecdf70609bf1b9801f" "6b73ab75947ac339e5ffffffff" // NumTxOut "02" // ... TxOuts fragged out // Locktime "00000000"); rawTxOut0_ = READHEX( // Value "ac4c8bd500000000" // Script size (var_int) "19" // Script "76""a9""14""8dce8946f1c7763bb60ea5cf16ef514cbed0633b""88""ac"); rawTxOut1_ = READHEX( // Value "002f685900000000" // Script size (var_int) "19" // Script "76""a9""14""6a59ac0e8f553f292dfe5e9f3aaa1da93499c15e""88""ac"); bh_.unserialize(rawHead_); tx1_.unserialize(rawTx0_); tx2_.unserialize(rawTx1_); sbh_.unserialize(rawHead_); // Make sure the global DB type and prune type are reset for each test DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); LOGDISABLESTDOUT(); } ///// virtual void TearDown(void) { // This seem to be the best way to remove a dir tree in C++ (in Linux) iface_->closeDatabases(); iface_ = NULL; #ifdef _MSC_VER rmdir("./ldbtestdir/level*"); #else system("rm -rf ./ldbtestdir/level*"); #endif } ///// void addOutPairH(BinaryData key, BinaryData val) { expectOutH_.push_back( pair(key,val)); } ///// void addOutPairB(BinaryData key, BinaryData val) { expectOutB_.push_back( pair(key,val)); } ///// void replaceTopOutPairB(BinaryData key, BinaryData val) { uint32_t last = expectOutB_.size() -1; expectOutB_[last] = pair(key,val); } ///// void printOutPairs(void) { cout << "Num Houts: " << expectOutH_.size() << endl; for(uint32_t i=0; igetAllDatabaseEntries(HEADERS); if(fromDB.size() < endplus1H || expectOutH_.size() < endplus1H) { LOGERR << "Headers DB not the correct size"; LOGERR << "DB size: " << (int)fromDB.size(); LOGERR << "Expected: " << (int)expectOutH_.size(); return false; } for(uint32_t i=startH; igetAllDatabaseEntries(BLKDATA); if(fromDB.size() < endplus1B || expectOutB_.size() < endplus1B) { LOGERR << "BLKDATA DB not the correct size"; LOGERR << "DB size: " << (int)fromDB.size(); LOGERR << "Expected: " << (int)expectOutB_.size(); return false; } for(uint32_t i=startB; iopenDatabases( string("ldbtestdir"), ghash_, gentx_, magic_, ARMORY_DB_FULL, DB_PRUNE_NONE); BinaryData DBINFO = StoredDBInfo().getDBKey(); BinaryData flags = READHEX("03100000"); BinaryData val0 = magic_+flags+zeros_+zeros_+ghash_; addOutPairH(DBINFO, val0); addOutPairB(DBINFO, val0); return iface_->databasesAreOpen(); } InterfaceToLDB* iface_; vector > expectOutH_; vector > expectOutB_; BinaryData magic_; BinaryData ghash_; BinaryData gentx_; BinaryData zeros_; BinaryData rawHead_; BinaryData headHashLE_; BinaryData headHashBE_; BinaryData rawBlock_; BinaryData rawTx0_; BinaryData rawTx1_; BlockHeader bh_; Tx tx1_; Tx tx2_; StoredHeader sbh_; BinaryData rawTxUnfrag_; BinaryData rawTxFragged_; BinaryData rawTxOut0_; BinaryData rawTxOut1_; }; //////////////////////////////////////////////////////////////////////////////// TEST_F(LevelDBTest, OpenClose) { iface_->openDatabases( string("ldbtestdir"), ghash_, gentx_, magic_, ARMORY_DB_FULL, DB_PRUNE_NONE); ASSERT_TRUE(iface_->databasesAreOpen()); EXPECT_EQ(iface_->getTopBlockHeight(HEADERS), 0); EXPECT_EQ(iface_->getTopBlockHash(HEADERS), READHEX(MAINNET_GENESIS_HASH_HEX)); KVLIST HList = iface_->getAllDatabaseEntries(HEADERS); KVLIST BList = iface_->getAllDatabaseEntries(BLKDATA); // 0123 4567 0123 4567 // 0000 0010 0001 ---- ---- ---- ---- ---- BinaryData flags = READHEX("03100000"); for(uint32_t i=0; icloseDatabases(); } //////////////////////////////////////////////////////////////////////////////// TEST_F(LevelDBTest, OpenCloseOpenNominal) { // 0123 4567 0123 4567 // 0000 0010 0001 ---- ---- ---- ---- ---- BinaryData flags = READHEX("03100000"); iface_->openDatabases( string("ldbtestdir"), ghash_, gentx_, magic_, ARMORY_DB_FULL, DB_PRUNE_NONE); iface_->closeDatabases(); iface_->openDatabases( string("ldbtestdir"), ghash_, gentx_, magic_, ARMORY_DB_FULL, DB_PRUNE_NONE); ASSERT_TRUE(iface_->databasesAreOpen()); KVLIST HList = iface_->getAllDatabaseEntries(HEADERS); KVLIST BList = iface_->getAllDatabaseEntries(BLKDATA); for(uint32_t i=0; icloseDatabases(); } //////////////////////////////////////////////////////////////////////////////// TEST_F(LevelDBTest, DISABLED_OpenCloseOpenMismatch) { LOGERR << "Expecting four error messages here: this is normal"; iface_->openDatabases( string("ldbtestdir"), ghash_, gentx_, magic_, ARMORY_DB_FULL, DB_PRUNE_NONE); EXPECT_TRUE(iface_->databasesAreOpen()); iface_->closeDatabases(); iface_->openDatabases( string("ldbtestdir"), ghash_.getSliceCopy(0, 31) + READHEX("00"), gentx_, magic_, ARMORY_DB_FULL, DB_PRUNE_NONE); EXPECT_TRUE(iface_->databasesAreOpen()); iface_->closeDatabases(); iface_->openDatabases( string("ldbtestdir"), ghash_, gentx_, magic_.getSliceCopy(0,3) + READHEX("00"), ARMORY_DB_FULL, DB_PRUNE_NONE); EXPECT_FALSE(iface_->databasesAreOpen()); iface_->openDatabases( string("ldbtestdir"), ghash_, gentx_, magic_, ARMORY_DB_SUPER, DB_PRUNE_WHATEVER); EXPECT_FALSE(iface_->databasesAreOpen()); iface_->openDatabases( string("ldbtestdir"), ghash_, gentx_, magic_); ASSERT_TRUE( iface_->databasesAreOpen()); EXPECT_EQ( DBUtils.getArmoryDbType(), ARMORY_DB_FULL); EXPECT_EQ( DBUtils.getDbPruneType(), DB_PRUNE_NONE); KVLIST HList = iface_->getAllDatabaseEntries(HEADERS); KVLIST BList = iface_->getAllDatabaseEntries(BLKDATA); EXPECT_EQ(HList.begin()->first, READHEX("00")); EXPECT_EQ(BList.begin()->first, READHEX("00")); iface_->closeDatabases(); } //////////////////////////////////////////////////////////////////////////////// TEST_F(LevelDBTest, PutGetDelete) { BinaryData flags = READHEX("03100000"); iface_->openDatabases( string("ldbtestdir"), ghash_, gentx_, magic_, ARMORY_DB_FULL, DB_PRUNE_NONE); ASSERT_TRUE(iface_->databasesAreOpen()); DB_PREFIX TXDATA = DB_PREFIX_TXDATA; BinaryData DBINFO = StoredDBInfo().getDBKey(); BinaryData PREFIX = WRITE_UINT8_BE((uint8_t)TXDATA); BinaryData val0 = magic_+flags+zeros_+zeros_+ghash_; BinaryData commonValue = READHEX("abcd1234"); BinaryData keyAB = READHEX("0000"); BinaryData nothing = BinaryData(0); addOutPairH(DBINFO, val0); addOutPairB(DBINFO, val0); addOutPairB( keyAB, commonValue); addOutPairB(PREFIX + keyAB, commonValue); ASSERT_TRUE( compareKVListRange(0,1, 0,1)); iface_->putValue(BLKDATA, keyAB, commonValue); ASSERT_TRUE( compareKVListRange(0,1, 0,2)); iface_->putValue(BLKDATA, DB_PREFIX_TXDATA, keyAB, commonValue); ASSERT_TRUE( compareKVListRange(0,1, 0,3)); // Now test a bunch of get* methods ASSERT_EQ( iface_->getValue( BLKDATA, PREFIX+keyAB), commonValue); ASSERT_EQ( iface_->getValue( BLKDATA, DB_PREFIX_DBINFO, nothing),val0); ASSERT_EQ( iface_->getValue( BLKDATA, DBINFO), val0); ASSERT_EQ( iface_->getValueRef( BLKDATA, PREFIX+keyAB), commonValue); ASSERT_EQ( iface_->getValueRef( BLKDATA, TXDATA, keyAB), commonValue); ASSERT_EQ( iface_->getValueReader(BLKDATA, PREFIX+keyAB).getRawRef(), commonValue); ASSERT_EQ( iface_->getValueReader(BLKDATA, TXDATA, keyAB).getRawRef(),commonValue); iface_->deleteValue(BLKDATA, DB_PREFIX_TXDATA, keyAB); ASSERT_TRUE( compareKVListRange(0,1, 0,2)); iface_->deleteValue(BLKDATA, PREFIX+ keyAB); ASSERT_TRUE( compareKVListRange(0,1, 0,1)); iface_->deleteValue(BLKDATA, PREFIX+ keyAB); } //////////////////////////////////////////////////////////////////////////////// TEST_F(LevelDBTest, STxOutPutGet) { BinaryData TXP = WRITE_UINT8_BE((uint8_t)DB_PREFIX_TXDATA); BinaryData stxoVal = READHEX("0400") + rawTxOut0_; BinaryData stxoKey = TXP + READHEX("01e078""0f""0007""0001"); ASSERT_TRUE(standardOpenDBs()); StoredTxOut stxo0; stxo0.txVersion_ = 1; stxo0.spentness_ = TXOUT_UNSPENT; stxo0.blockHeight_ = 123000; stxo0.duplicateID_ = 15; stxo0.txIndex_ = 7; stxo0.txOutIndex_ = 1; stxo0.unserialize(rawTxOut0_); iface_->putStoredTxOut(stxo0); // Construct expected output addOutPairB(stxoKey, stxoVal); ASSERT_TRUE(compareKVListRange(0,1, 0,2)); StoredTxOut stxoGet; iface_->getStoredTxOut(stxoGet, 123000, 15, 7, 1); EXPECT_EQ(stxoGet.serializeDBValue(), stxo0.serializeDBValue()); //iface_->validDupByHeight_[123000] = 15; //iface_->getStoredTxOut(stxoGet, 123000, 7, 1); //EXPECT_EQ(stxoGet.serializeDBValue(), stxo0.serializeDBValue()); StoredTxOut stxo1; stxo1.txVersion_ = 1; stxo1.spentness_ = TXOUT_UNSPENT; stxo1.blockHeight_ = 200333; stxo1.duplicateID_ = 3; stxo1.txIndex_ = 7; stxo1.txOutIndex_ = 1; stxo1.unserialize(rawTxOut1_); stxoVal = READHEX("0400") + rawTxOut1_; stxoKey = TXP + READHEX("030e8d""03""00070001"); iface_->putStoredTxOut(stxo1); iface_->getStoredTxOut(stxoGet, 123000, 15, 7, 1); EXPECT_EQ(stxoGet.serializeDBValue(), stxo0.serializeDBValue()); iface_->getStoredTxOut(stxoGet, 200333, 3, 7, 1); EXPECT_EQ(stxoGet.serializeDBValue(), stxo1.serializeDBValue()); addOutPairB(stxoKey, stxoVal); ASSERT_TRUE(compareKVListRange(0,1, 0,3)); } //////////////////////////////////////////////////////////////////////////////// TEST_F(LevelDBTest, PutFullTxNoOuts) { DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); ASSERT_TRUE(standardOpenDBs()); StoredTx stx; stx.createFromTx(rawTxUnfrag_); stx.setKeyData(123000, 15, 7); BinaryData TXP = WRITE_UINT8_BE((uint8_t)DB_PREFIX_TXDATA); BinaryData stxKey = TXP + READHEX("01e078""0f""0007"); BinaryData stxVal = READHEX("0440") + stx.thisHash_ + rawTxFragged_; iface_->putStoredTx(stx, false); addOutPairB(stxKey, stxVal); EXPECT_TRUE(compareKVListRange(0,1, 0,2)); } //////////////////////////////////////////////////////////////////////////////// TEST_F(LevelDBTest, PutFullTx) { DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); BinaryData TXP = WRITE_UINT8_BE((uint8_t)DB_PREFIX_TXDATA); BinaryData stxoVal = READHEX("0400") + rawTxOut0_; BinaryData stxKey = TXP + READHEX("01e078""0f""0007"); BinaryData stxo0Key = TXP + READHEX("01e078""0f""0007""0000"); BinaryData stxo1Key = TXP + READHEX("01e078""0f""0007""0001"); BinaryData stxo0raw = READHEX( "ac4c8bd5000000001976a9148dce8946f1c7763bb60ea5cf16ef514cbed0633b88ac"); BinaryData stxo1raw = READHEX( "002f6859000000001976a9146a59ac0e8f553f292dfe5e9f3aaa1da93499c15e88ac"); ASSERT_TRUE(standardOpenDBs()); StoredTx stx; stx.createFromTx(rawTxUnfrag_); stx.setKeyData(123000, 15, 7); ASSERT_EQ(stx.stxoMap_.size(), 2); for(uint32_t i=0; i<2; i++) { stx.stxoMap_[i].spentness_ = TXOUT_UNSPENT; stx.stxoMap_[i].isCoinbase_ = false; ASSERT_EQ(stx.stxoMap_[i].blockHeight_, 123000); ASSERT_EQ(stx.stxoMap_[i].duplicateID_, 15); ASSERT_EQ(stx.stxoMap_[i].txIndex_, 7); ASSERT_EQ(stx.stxoMap_[i].txOutIndex_, i); ASSERT_EQ(stx.stxoMap_[i].isCoinbase_, false); } BinaryData stxVal = READHEX("0440") + stx.thisHash_ + rawTxFragged_; BinaryData stxo0Val = READHEX("0400") + stxo0raw; BinaryData stxo1Val = READHEX("0400") + stxo1raw; iface_->putStoredTx(stx); addOutPairB(stxKey, stxVal); addOutPairB(stxo0Key, stxo0Val); addOutPairB(stxo1Key, stxo1Val); EXPECT_TRUE(compareKVListRange(0,1, 0,4)); } //////////////////////////////////////////////////////////////////////////////// TEST_F(LevelDBTest, PutFullBlockNoTx) { DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); StoredHeader sbh; BinaryRefReader brr(rawBlock_); sbh.unserializeFullBlock(brr); sbh.setKeyData(123000, UINT8_MAX); StoredHeadHgtList hhl; hhl.height_ = 123000; hhl.dupAndHashList_.push_back( pair(0, sbh.thisHash_)); hhl.preferredDup_ = UINT8_MAX; BinaryData TXP = WRITE_UINT8_BE((uint8_t)DB_PREFIX_TXDATA); BinaryData HHP = WRITE_UINT8_BE((uint8_t)DB_PREFIX_HEADHASH); BinaryData HGP = WRITE_UINT8_BE((uint8_t)DB_PREFIX_HEADHGT); BinaryData hgtx = READHEX("01e078""00"); BinaryData sbh_HH_key = HHP + sbh.thisHash_; BinaryData sbh_HH_val = sbh.dataCopy_ + hgtx; BinaryData sbh_HG_key = hhl.getDBKey(); BinaryData sbh_HG_val = hhl.serializeDBValue(); ASSERT_TRUE(standardOpenDBs()); addOutPairH( sbh_HH_key, sbh_HH_val); addOutPairH( sbh_HG_key, sbh_HG_val); uint8_t sdup = iface_->putStoredHeader(sbh, false); EXPECT_TRUE(compareKVListRange(0,3, 0,1)); EXPECT_EQ(sdup, 0); // Try adding it again and see if get the correct dup again, and no touch DB sdup = iface_->putStoredHeader(sbh, false); EXPECT_TRUE(compareKVListRange(0,3, 0,1)); EXPECT_EQ(sdup, 0); } //////////////////////////////////////////////////////////////////////////////// TEST_F(LevelDBTest, PutGetBareHeader) { DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); StoredHeader sbh; BinaryRefReader brr(rawBlock_); sbh.unserializeFullBlock(brr); sbh.setKeyData(123000, UINT8_MAX); BinaryData header0 = sbh.thisHash_; ASSERT_TRUE(standardOpenDBs()); uint8_t sdup = iface_->putBareHeader(sbh); EXPECT_EQ(sdup, 0); EXPECT_EQ(sbh.duplicateID_, 0); // Try adding it again and see if get the correct dup again, and no touch DB sdup = iface_->putStoredHeader(sbh, false); EXPECT_EQ(sdup, 0); EXPECT_EQ(sbh.duplicateID_, 0); // Add a new header and make sure duplicate ID is done correctly BinaryData newHeader = READHEX( "0000000105d3571220ef5f87c6ac0bc8bf5b33c02a9e6edf83c84d840109592c" "0000000027523728e15f5fe1ac507bff92499eada4af8a0c485d5178e3f96568" "c18f84994e0e4efc1c0175d646a91ad4"); BinaryData header1 = BtcUtils::getHash256(newHeader); StoredHeader sbh2; sbh2.unserialize(newHeader); sbh2.setKeyData(123000, UINT8_MAX); uint8_t newDup = iface_->putBareHeader(sbh2); EXPECT_EQ(newDup, 1); EXPECT_EQ(sbh2.duplicateID_, 1); // Now add a new, isMainBranch_ header StoredHeader sbh3; BinaryData anotherHead = READHEX( "010000001d8f4ec0443e1f19f305e488c1085c95de7cc3fd25e0d2c5bb5d0000" "000000009762547903d36881a86751f3f5049e23050113f779735ef82734ebf0" "b4450081d8c8c84db3936a1a334b035b"); BinaryData header2 = BtcUtils::getHash256(anotherHead); sbh3.unserialize(anotherHead); sbh3.setKeyData(123000, UINT8_MAX); sbh3.isMainBranch_ = true; uint8_t anotherDup = iface_->putBareHeader(sbh3); EXPECT_EQ(anotherDup, 2); EXPECT_EQ(sbh3.duplicateID_, 2); EXPECT_EQ(iface_->getValidDupIDForHeight(123000), 2); // Now test getting bare headers StoredHeader sbh4; iface_->getBareHeader(sbh4, 123000); EXPECT_EQ(sbh4.thisHash_, header2); EXPECT_EQ(sbh4.duplicateID_, 2); iface_->getBareHeader(sbh4, 123000, 1); EXPECT_EQ(sbh4.thisHash_, header1); EXPECT_EQ(sbh4.duplicateID_, 1); // Re-add the same SBH3, make sure nothing changes iface_->putBareHeader(sbh3); EXPECT_EQ(sbh3.duplicateID_, 2); EXPECT_EQ(iface_->getValidDupIDForHeight(123000), 2); } //////////////////////////////////////////////////////////////////////////////// TEST_F(LevelDBTest, PutFullBlock) { DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); ASSERT_TRUE(standardOpenDBs()); StoredHeader sbh; BinaryRefReader brr(rawBlock_); sbh.unserializeFullBlock(brr); sbh.setKeyData(123000); BinaryData rawHeader = READHEX( "01000000eb10c9a996a2340a4d74eaab41421ed8664aa49d18538bab59010000" "000000005a2f06efa9f2bd804f17877537f2080030cadbfa1eb50e02338117cc" "604d91b9b7541a4ecfbb0a1a64f1ade7"); // Compute and write the headers to the expected-output StoredHeadHgtList hhl; hhl.height_ = 123000; hhl.dupAndHashList_.push_back( pair(0, sbh.thisHash_)); hhl.preferredDup_ = UINT8_MAX; BinaryData HHP = WRITE_UINT8_BE((uint8_t)DB_PREFIX_HEADHASH); BinaryData HGP = WRITE_UINT8_BE((uint8_t)DB_PREFIX_HEADHGT); BinaryData sbh_HH_key = HHP + sbh.thisHash_; BinaryData sbh_HH_val = rawHeader + READHEX("01e078""00"); BinaryData sbh_HG_key = hhl.getDBKey(); BinaryData sbh_HG_val = hhl.serializeDBValue(); // Only HEADHASH and HEADHGT entries get written addOutPairH( sbh_HH_key, sbh_HH_val); addOutPairH( sbh_HG_key, sbh_HG_val); // Now compute and write the BLKDATA BinaryData TXP = WRITE_UINT8_BE((uint8_t)DB_PREFIX_TXDATA); BinaryData sbhKey = TXP + READHEX("01e078""00"); BinaryData stx0Key = sbhKey + READHEX("0000"); BinaryData stx1Key = sbhKey + READHEX("0001"); BinaryData stx2Key = sbhKey + READHEX("0002"); BinaryData stxo00Key = stx0Key + READHEX("0000"); BinaryData stxo10Key = stx1Key + READHEX("0000"); BinaryData stxo11Key = stx1Key + READHEX("0001"); BinaryData stxo20Key = stx2Key + READHEX("0000"); BinaryData stxo21Key = stx2Key + READHEX("0001"); BinaryData stxo00Raw = READHEX( "00f2052a01000000""434104" "c2239c4eedb3beb26785753463be3ec62b82f6acd62efb65f452f8806f2ede0b" "338e31d1f69b1ce449558d7061aa1648ddc2bf680834d3986624006a272dc21cac"); BinaryData stxo10Raw = READHEX( "40420f0000000000" "19""76a914adfa66f57ded1b655eb4ccd96ee07ca62bc1ddfd88ac"); BinaryData stxo11Raw = READHEX( "007d6a7d04000000" "19""76a914981a0c9ae61fa8f8c96ae6f8e383d6e07e77133e88ac"); BinaryData stxo20Raw = READHEX( "2f66ac6105000000" "19""76a914964642290c194e3bfab661c1085e47d67786d2d388ac"); BinaryData stxo21Raw = READHEX( "2f77e20000000000" "19""76a9141486a7046affd935919a3cb4b50a8a0c233c286c88ac"); StoredTx & stx0 = sbh.stxMap_[0]; StoredTx & stx1 = sbh.stxMap_[1]; StoredTx & stx2 = sbh.stxMap_[2]; BinaryData hflags = READHEX("01340000"); BinaryData ntx = READHEX("03000000"); BinaryData nbyte = READHEX("46040000"); // Add header to BLKDATA addOutPairB(sbhKey, hflags + rawHeader + ntx + nbyte); // Add Tx0 to BLKDATA addOutPairB(stx0Key, READHEX("0440") + stx0.thisHash_ + stx0.getSerializedTxFragged()); addOutPairB(stxo00Key, READHEX("0480") + stxo00Raw); // is coinbase // Add Tx1 to BLKDATA addOutPairB(stx1Key, READHEX("0440") + stx1.thisHash_ + stx1.getSerializedTxFragged()); addOutPairB(stxo10Key, READHEX("0400") + stxo10Raw); addOutPairB(stxo11Key, READHEX("0400") + stxo11Raw); // Add Tx2 to BLKDATA addOutPairB(stx2Key, READHEX("0440") + stx2.thisHash_ + stx2.getSerializedTxFragged()); addOutPairB(stxo20Key, READHEX("0400") + stxo20Raw); addOutPairB(stxo21Key, READHEX("0400") + stxo21Raw); // DuplicateID values get set when we putStoredHeader since we don't know // what dupIDs have been taken until we try to put it in the database. ASSERT_EQ(sbh.stxMap_.size(), 3); for(uint32_t i=0; i<3; i++) { ASSERT_EQ(sbh.stxMap_[i].blockHeight_, 123000); ASSERT_EQ(sbh.stxMap_[i].duplicateID_, UINT8_MAX); ASSERT_EQ(sbh.stxMap_[i].txIndex_, i); for(uint32_t j=0; jputStoredHeader(sbh); ASSERT_TRUE(compareKVListRange(0,3, 0,9)); } //////////////////////////////////////////////////////////////////////////////// // Of course, this test only works if the previous test passes (but doesn't // require a saved state, it just re-puts the full block into the DB). I // did it this way, because I wasn't comfortable committing the pre-filled // DB to the repo. TEST_F(LevelDBTest, GetFullBlock) { DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); ASSERT_TRUE(standardOpenDBs()); StoredHeader sbh; BinaryRefReader brr(rawBlock_); sbh.unserializeFullBlock(brr); sbh.setKeyData(123000); sbh.isMainBranch_ = true; // Check the DBInfo before and after putting the valid header StoredDBInfo sdbi; iface_->getStoredDBInfo(HEADERS, sdbi); EXPECT_EQ(sdbi.topBlkHgt_, 0); EXPECT_EQ(sdbi.topBlkHash_, iface_->getGenesisBlockHash()); iface_->putStoredHeader(sbh); // Since we marked this block main-branch, it should have non-MAX validDup EXPECT_EQ(iface_->getValidDupIDForHeight(123000), 0); BinaryData headerHash = READHEX( "7d97d862654e03d6c43b77820a40df894e3d6890784528e9cd05000000000000"); iface_->getStoredDBInfo(HEADERS, sdbi); EXPECT_EQ(sdbi.topBlkHgt_, 123000); EXPECT_EQ(sdbi.topBlkHash_, headerHash); BinaryData rawHeader = READHEX( "01000000eb10c9a996a2340a4d74eaab41421ed8664aa49d18538bab59010000" "000000005a2f06efa9f2bd804f17877537f2080030cadbfa1eb50e02338117cc" "604d91b9b7541a4ecfbb0a1a64f1ade7"); //////////////////// // Now test the get methods for(uint32_t i=0; i<4; i++) { StoredHeader sbhGet; if(i==0) EXPECT_TRUE(iface_->getStoredHeader(sbhGet, 123000, 0, false)); else if(i==1) EXPECT_TRUE(iface_->getStoredHeader(sbhGet, headerHash, false)); else if(i==2) EXPECT_TRUE(iface_->getStoredHeader(sbhGet, 123000, 0, true)); else if(i==3) EXPECT_TRUE(iface_->getStoredHeader(sbhGet, headerHash, true)); EXPECT_TRUE( sbhGet.isInitialized()); EXPECT_EQ( sbhGet.dataCopy_, rawHeader); EXPECT_EQ( sbhGet.thisHash_, headerHash); EXPECT_EQ( sbhGet.numTx_, 3); EXPECT_EQ( sbhGet.numBytes_, 1094); EXPECT_EQ( sbhGet.blockHeight_, 123000); EXPECT_EQ( sbhGet.duplicateID_, 0); EXPECT_EQ( sbhGet.merkle_.getSize(), 0); EXPECT_FALSE(sbhGet.merkleIsPartial_); EXPECT_EQ( sbhGet.unserArmVer_, 0); EXPECT_EQ( sbhGet.unserBlkVer_, 1); EXPECT_EQ( sbhGet.unserDbType_, ARMORY_DB_FULL); EXPECT_EQ( sbhGet.unserPrType_, DB_PRUNE_NONE); if(i<2) EXPECT_EQ( sbhGet.stxMap_.size(), 0); else { EXPECT_EQ( sbhGet.stxMap_.size(), 3); EXPECT_EQ( sbhGet.stxMap_[1].blockHeight_, 123000); EXPECT_EQ( sbhGet.stxMap_[1].duplicateID_, 0); EXPECT_EQ( sbhGet.stxMap_[1].txIndex_, 1); EXPECT_EQ( sbhGet.stxMap_[1].numTxOut_, 2); EXPECT_EQ( sbhGet.stxMap_[1].numBytes_, 621); EXPECT_EQ( sbhGet.stxMap_[0].stxoMap_[0].isCoinbase_, true); EXPECT_EQ( sbhGet.stxMap_[0].stxoMap_[0].spentness_, TXOUT_SPENTUNK); EXPECT_EQ( sbhGet.stxMap_[1].stxoMap_[0].isCoinbase_, false); EXPECT_EQ( sbhGet.stxMap_[1].stxoMap_[0].blockHeight_, 123000); EXPECT_EQ( sbhGet.stxMap_[1].stxoMap_[0].duplicateID_, 0); EXPECT_EQ( sbhGet.stxMap_[1].stxoMap_[0].txIndex_, 1); EXPECT_EQ( sbhGet.stxMap_[1].stxoMap_[0].txOutIndex_, 0); } } } //////////////////////////////////////////////////////////////////////////////// TEST_F(LevelDBTest, PutGetStoredTxHints) { ASSERT_TRUE(standardOpenDBs()); BinaryData prefix = READHEX("aabbccdd"); StoredTxHints sths; EXPECT_FALSE(iface_->getStoredTxHints(sths, prefix)); sths.txHashPrefix_ = prefix; ASSERT_TRUE(iface_->putStoredTxHints(sths)); BinaryData THP = WRITE_UINT8_BE((uint8_t)DB_PREFIX_TXHINTS); addOutPairB(THP + prefix, READHEX("00")); compareKVListRange(0,1, 0,2); ///// sths.dbKeyList_.push_back(READHEX("abcd1234ffff")); replaceTopOutPairB(THP + prefix, READHEX("01""abcd1234ffff")); EXPECT_TRUE(iface_->putStoredTxHints(sths)); compareKVListRange(0,1, 0,2); ///// sths.dbKeyList_.push_back(READHEX("00002222aaaa")); replaceTopOutPairB(THP + prefix, READHEX("02""abcd1234ffff""00002222aaaa")); EXPECT_TRUE(iface_->putStoredTxHints(sths)); compareKVListRange(0,1, 0,2); ///// sths.preferredDBKey_ = READHEX("00002222aaaa"); replaceTopOutPairB(THP + prefix, READHEX("02""00002222aaaa""abcd1234ffff")); EXPECT_TRUE(iface_->putStoredTxHints(sths)); compareKVListRange(0,1, 0,2); // Now test the get methods EXPECT_TRUE( iface_->getStoredTxHints(sths, prefix)); EXPECT_EQ( sths.txHashPrefix_, prefix); EXPECT_EQ( sths.dbKeyList_.size(), 2); EXPECT_EQ( sths.preferredDBKey_, READHEX("00002222aaaa")); // sths.dbKeyList_.resize(0); sths.preferredDBKey_.resize(0); EXPECT_TRUE( iface_->putStoredTxHints(sths)); EXPECT_TRUE( iface_->getStoredTxHints(sths, prefix)); EXPECT_EQ( sths.txHashPrefix_, prefix); EXPECT_EQ( sths.dbKeyList_.size(), 0); EXPECT_EQ( sths.preferredDBKey_.getSize(), 0); } //////////////////////////////////////////////////////////////////////////////// TEST_F(LevelDBTest, PutGetStoredScriptHistory) { ASSERT_TRUE(standardOpenDBs()); /////////////////////////////////////////////////////////////////////////// // A whole bunch of setup stuff we need for SSH operations to work right InterfaceToLDB * iface = LevelDBWrapper::GetInterfacePtr(); iface->setValidDupIDForHeight(255,0); iface->setValidDupIDForHeight(256,0); BinaryData dbkey0 = READHEX("0000ff00""0001""0001"); BinaryData dbkey1 = READHEX("0000ff00""0002""0002"); BinaryData dbkey2 = READHEX("00010000""0004""0004"); BinaryData dbkey3 = READHEX("00010000""0006""0006"); uint64_t val0 = READ_UINT64_HEX_LE("0100000000000000"); uint64_t val1 = READ_UINT64_HEX_LE("0002000000000000"); uint64_t val2 = READ_UINT64_HEX_LE("0000030000000000"); uint64_t val3 = READ_UINT64_HEX_LE("0000000400000000"); BinaryData PREFIX = READHEX("03"); BinaryData RAWTX = READHEX( "01000000016290dce984203b6a5032e543e9e272d8bce934c7de4d15fa0fe44d" "d49ae4ece9010000008b48304502204f2fa458d439f957308bca264689aa175e" "3b7c5f78a901cb450ebd20936b2c500221008ea3883a5b80128e55c9c6070aa6" "264e1e0ce3d18b7cd7e85108ce3d18b7419a0141044202550a5a6d3bb81549c4" "a7803b1ad59cdbba4770439a4923624a8acfc7d34900beb54a24188f7f0a4068" "9d905d4847cc7d6c8d808a457d833c2d44ef83f76bffffffff0242582c0a0000" "00001976a914c1b4695d53b6ee57a28647ce63e45665df6762c288ac80d1f008" "000000001976a9140e0aec36fe2545fb31a41164fb6954adcd96b34288ac0000" "0000"); iface->putValue(BLKDATA, DB_PREFIX_TXDATA, dbkey0, RAWTX); iface->putValue(BLKDATA, DB_PREFIX_TXDATA, dbkey1, RAWTX); iface->putValue(BLKDATA, DB_PREFIX_TXDATA, dbkey2, RAWTX); iface->putValue(BLKDATA, DB_PREFIX_TXDATA, dbkey3, RAWTX); TxIOPair txio0(dbkey0, val0); TxIOPair txio1(dbkey1, val1); TxIOPair txio2(dbkey2, val2); TxIOPair txio3(dbkey3, val3); txio3.setMultisig(true); /////////////////////////////////////////////////////////////////////////// StoredSubHistory * subptr; TxIOPair * txioptr; StoredScriptHistory ssh, sshorig, sshtemp; BinaryData hgtX0 = READHEX("0000ff00"); BinaryData hgtX1 = READHEX("00010000"); BinaryData uniq = READHEX("00""0000ffff0000ffff0000ffff0000ffff0000ffff"); sshorig.uniqueKey_ = uniq; uint32_t blk = READ_UINT32_HEX_LE("ffff0000"); sshorig.alreadyScannedUpToBlk_ = blk; sshorig.version_ = 1; ///////////////////////////////////////////////////////////////////////////// // Haven't actually done anything yet... ssh = sshorig; EXPECT_EQ(ssh.uniqueKey_, uniq); EXPECT_EQ(ssh.alreadyScannedUpToBlk_, blk); EXPECT_EQ(ssh.subHistMap_.size(), 0); ///////////////////////////////////////////////////////////////////////////// // An empty SSH -- this shouldn't happen in production, but test it anyway iface_->putStoredScriptHistory(ssh); iface_->getStoredScriptHistory(sshtemp, uniq); EXPECT_EQ(sshtemp.uniqueKey_, uniq); EXPECT_EQ(sshtemp.alreadyScannedUpToBlk_, blk); EXPECT_EQ(sshtemp.subHistMap_.size(), 0); ///////////////////////////////////////////////////////////////////////////// // A single txio ssh = sshorig; ssh.insertTxio(txio0); iface_->putStoredScriptHistory(ssh); iface_->getStoredScriptHistory(sshtemp, uniq); EXPECT_EQ(sshtemp.uniqueKey_, uniq); EXPECT_EQ(sshtemp.alreadyScannedUpToBlk_, blk); EXPECT_EQ(sshtemp.totalTxioCount_, 1); EXPECT_EQ(sshtemp.totalUnspent_, val0); EXPECT_EQ(sshtemp.subHistMap_.size(), 1); ASSERT_NE(sshtemp.subHistMap_.find(hgtX0), sshtemp.subHistMap_.end()); subptr = &sshtemp.subHistMap_[hgtX0]; EXPECT_EQ(subptr->uniqueKey_, uniq); EXPECT_EQ(subptr->hgtX_, hgtX0); ASSERT_EQ(subptr->txioSet_.size(), 1); ASSERT_NE(subptr->txioSet_.find(dbkey0), subptr->txioSet_.end()); txioptr = &subptr->txioSet_[dbkey0]; EXPECT_EQ(txioptr->getDBKeyOfOutput(), dbkey0); EXPECT_EQ(txioptr->getValue(), val0); EXPECT_FALSE(txioptr->isMultisig()); ///////////////////////////////////////////////////////////////////////////// // Two TxIOPairs in one sub history ssh = sshorig; sshtemp = StoredScriptHistory(); ssh.insertTxio(txio0); ssh.insertTxio(txio1); iface_->putStoredScriptHistory(ssh); iface_->getStoredScriptHistory(sshtemp, uniq); EXPECT_EQ(sshtemp.uniqueKey_, uniq); EXPECT_EQ(sshtemp.alreadyScannedUpToBlk_, blk); EXPECT_EQ(sshtemp.totalTxioCount_, 2); EXPECT_EQ(sshtemp.totalUnspent_, val0+val1); EXPECT_EQ(sshtemp.subHistMap_.size(), 1); ASSERT_NE(sshtemp.subHistMap_.find(hgtX0), sshtemp.subHistMap_.end()); subptr = &sshtemp.subHistMap_[hgtX0]; EXPECT_EQ(subptr->uniqueKey_, uniq); EXPECT_EQ(subptr->hgtX_, hgtX0); ASSERT_EQ(subptr->txioSet_.size(), 2); ASSERT_NE(subptr->txioSet_.find(dbkey0), subptr->txioSet_.end()); txioptr = &subptr->txioSet_[dbkey0]; EXPECT_EQ(txioptr->getDBKeyOfOutput(), dbkey0); EXPECT_EQ(txioptr->getValue(), val0); EXPECT_FALSE(txioptr->isMultisig()); txioptr = &subptr->txioSet_[dbkey1]; EXPECT_EQ(txioptr->getDBKeyOfOutput(), dbkey1); EXPECT_EQ(txioptr->getValue(), val1); EXPECT_FALSE(txioptr->isMultisig()); ///////////////////////////////////////////////////////////////////////////// // Add new sub-history with multisig ssh = sshorig; ssh.insertTxio(txio0); ssh.insertTxio(txio1); ssh.insertTxio(txio3); iface_->putStoredScriptHistory(ssh); iface_->getStoredScriptHistory(sshtemp, uniq); EXPECT_EQ(sshtemp.uniqueKey_, uniq); EXPECT_EQ(sshtemp.alreadyScannedUpToBlk_, blk); EXPECT_EQ(sshtemp.totalTxioCount_, 3); EXPECT_EQ(sshtemp.totalUnspent_, val0+val1); EXPECT_EQ(sshtemp.subHistMap_.size(), 2); ASSERT_NE(sshtemp.subHistMap_.find(hgtX0), sshtemp.subHistMap_.end()); subptr = &sshtemp.subHistMap_[hgtX0]; EXPECT_EQ(subptr->uniqueKey_, uniq); EXPECT_EQ(subptr->hgtX_, hgtX0); ASSERT_EQ(subptr->txioSet_.size(), 2); ASSERT_NE(subptr->txioSet_.find(dbkey0), subptr->txioSet_.end()); txioptr = &subptr->txioSet_[dbkey0]; EXPECT_EQ(txioptr->getDBKeyOfOutput(), dbkey0); EXPECT_EQ(txioptr->getValue(), val0); txioptr = &subptr->txioSet_[dbkey1]; EXPECT_EQ(txioptr->getDBKeyOfOutput(), dbkey1); EXPECT_EQ(txioptr->getValue(), val1); EXPECT_FALSE(txioptr->isMultisig()); ASSERT_NE(sshtemp.subHistMap_.find(hgtX1), sshtemp.subHistMap_.end()); subptr = &sshtemp.subHistMap_[hgtX1]; EXPECT_EQ(subptr->uniqueKey_, uniq); EXPECT_EQ(subptr->hgtX_, hgtX1); ASSERT_EQ(subptr->txioSet_.size(), 1); ASSERT_NE(subptr->txioSet_.find(dbkey3), subptr->txioSet_.end()); txioptr = &subptr->txioSet_[dbkey3]; EXPECT_EQ(txioptr->getDBKeyOfOutput(), dbkey3); EXPECT_EQ(txioptr->getValue(), val3); EXPECT_TRUE(txioptr->isMultisig()); } //////////////////////////////////////////////////////////////////////////////// TEST_F(LevelDBTest, DISABLED_PutGetStoredUndoData) { // We don't actually use undo data at all yet, so I'll skip the tests for now } TEST_F(LevelDBTest, HeaderDump) { // We don't actually use undo data at all yet, so I'll skip the tests for now } //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class TxRefTest : public ::testing::Test { protected: }; //////////////////////////////////////////////////////////////////////////////// TEST_F(TxRefTest, TxRefNoInit) { TxRef txr; EXPECT_FALSE(txr.isInitialized()); //EXPECT_FALSE(txr.isBound()); EXPECT_EQ(txr.getDBKey(), BinaryData(0)); EXPECT_EQ(txr.getDBKeyRef(), BinaryDataRef()); //EXPECT_EQ(txr.getBlockTimestamp(), UINT32_MAX); EXPECT_EQ(txr.getBlockHeight(), UINT32_MAX); EXPECT_EQ(txr.getDuplicateID(), UINT8_MAX ); EXPECT_EQ(txr.getBlockTxIndex(), UINT16_MAX); } //////////////////////////////////////////////////////////////////////////////// TEST_F(TxRefTest, TxRefKeyParts) { TxRef txr; BinaryData newKey = READHEX("e3c4027f000f"); BinaryDataRef newRef(newKey); txr.setDBKey(newKey); EXPECT_EQ(txr.getDBKey(), newKey); EXPECT_EQ(txr.getDBKeyRef(), newRef); EXPECT_EQ(txr.getBlockHeight(), 0xe3c402); EXPECT_EQ(txr.getDuplicateID(), 127); EXPECT_EQ(txr.getBlockTxIndex(), 15); } //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // TODO: These tests were taken directly from the BlockUtilsSuper.cpp where // they previously ran without issue. After bringing them over to here, // they now seg-fault. Disabled for now, since the PartialMerkleTrees // are not actually in use anywhere yet. class DISABLED_PartialMerkleTest : public ::testing::Test { protected: virtual void SetUp(void) { vector txList_(7); // The "abcd" quartets are to trigger endianness errors -- without them, // these hashes are palindromes that work regardless of your endian-handling txList_[0] = READHEX("00000000000000000000000000000000" "000000000000000000000000abcd0000"); txList_[1] = READHEX("11111111111111111111111111111111" "111111111111111111111111abcd1111"); txList_[2] = READHEX("22222222222222222222222222222222" "222222222222222222222222abcd2222"); txList_[3] = READHEX("33333333333333333333333333333333" "333333333333333333333333abcd3333"); txList_[4] = READHEX("44444444444444444444444444444444" "444444444444444444444444abcd4444"); txList_[5] = READHEX("55555555555555555555555555555555" "555555555555555555555555abcd5555"); txList_[6] = READHEX("66666666666666666666666666666666" "666666666666666666666666abcd6666"); vector merkleTree_ = BtcUtils::calculateMerkleTree(txList_); /* cout << "Merkle Tree looks like the following (7 tx): " << endl; cout << "The ** indicates the nodes we care about for partial tree test" << endl; cout << " \n"; cout << " _____0a10_____ \n"; cout << " / \\ \n"; cout << " _/ \\_ \n"; cout << " 65df b4d6 \n"; cout << " / \\ / \\ \n"; cout << " 6971 22dc 5675 d0b6 \n"; cout << " / \\ / \\ / \\ / \n"; cout << " 0000 1111 2222 3333 4444 5555 6666 \n"; cout << " ** ** \n"; cout << " " << endl; cout << endl; cout << "Full Merkle Tree (this one has been unit tested before):" << endl; for(uint32_t i=0; i txList_; vector merkleTree_; }; //////////////////////////////////////////////////////////////////////////////// TEST_F(DISABLED_PartialMerkleTest, FullTree) { vector isOurs(7); isOurs[0] = true; isOurs[1] = true; isOurs[2] = true; isOurs[3] = true; isOurs[4] = true; isOurs[5] = true; isOurs[6] = true; //cout << "Start serializing a full tree" << endl; PartialMerkleTree pmtFull(7, &isOurs, &txList_); BinaryData pmtSerFull = pmtFull.serialize(); //cout << "Finished serializing (full)" << endl; //cout << "Merkle Root: " << pmtFull.getMerkleRoot().toHexStr() << endl; //cout << "Starting unserialize (full):" << endl; //cout << "Serialized: " << pmtSerFull.toHexStr() << endl; PartialMerkleTree pmtFull2(7); pmtFull2.unserialize(pmtSerFull); BinaryData pmtSerFull2 = pmtFull2.serialize(); //cout << "Reserializ: " << pmtSerFull2.toHexStr() << endl; //cout << "Equal? " << (pmtSerFull==pmtSerFull2 ? "True" : "False") << endl; //cout << "Print Tree:" << endl; //pmtFull2.pprintTree(); EXPECT_EQ(pmtSerFull, pmtSerFull2); } //////////////////////////////////////////////////////////////////////////////// TEST_F(DISABLED_PartialMerkleTest, SingleLeaf) { vector isOurs(7); ///////////////////////////////////////////////////////////////////////////// // Test all 7 single-flagged trees for(uint32_t i=0; i<7; i++) { for(uint32_t j=0; j<7; j++) isOurs[j] = i==j; PartialMerkleTree pmt(7, &isOurs, &txList_); //cout << "Serializing (partial)" << endl; BinaryData pmtSer = pmt.serialize(); PartialMerkleTree pmt2(7); //cout << "Unserializing (partial)" << endl; pmt2.unserialize(pmtSer); //cout << "Reserializing (partial)" << endl; BinaryData pmtSer2 = pmt2.serialize(); //cout << "Serialized (Partial): " << pmtSer.toHexStr() << endl; //cout << "Reserializ (Partial): " << pmtSer.toHexStr() << endl; //cout << "Equal? " << (pmtSer==pmtSer2 ? "True" : "False") << endl; //cout << "Print Tree:" << endl; //pmt2.pprintTree(); EXPECT_EQ(pmtSer, pmtSer2); } } //////////////////////////////////////////////////////////////////////////////// TEST_F(DISABLED_PartialMerkleTest, MultiLeaf) { // Use deterministic seed srand(0); vector isOurs(7); ///////////////////////////////////////////////////////////////////////////// // Test a variety of 3-flagged trees for(uint32_t i=0; i<512; i++) { if(i<256) { // 2/3 of leaves will be selected for(uint32_t j=0; j<7; j++) isOurs[j] = (rand() % 3 < 2); } else { // 1/3 of leaves will be selected for(uint32_t j=0; j<7; j++) isOurs[j] = (rand() % 3 < 1); } PartialMerkleTree pmt(7, &isOurs, &txList_); //cout << "Serializing (partial)" << endl; BinaryData pmtSer = pmt.serialize(); PartialMerkleTree pmt2(7); //cout << "Unserializing (partial)" << endl; pmt2.unserialize(pmtSer); //cout << "Reserializing (partial)" << endl; BinaryData pmtSer2 = pmt2.serialize(); //cout << "Serialized (Partial): " << pmtSer.toHexStr() << endl; //cout << "Reserializ (Partial): " << pmtSer.toHexStr() << endl; cout << "Equal? " << (pmtSer==pmtSer2 ? "True" : "False") << endl; //cout << "Print Tree:" << endl; //pmt2.pprintTree(); EXPECT_EQ(pmtSer, pmtSer2); } } //////////////////////////////////////////////////////////////////////////////// TEST_F(DISABLED_PartialMerkleTest, EmptyTree) { vector isOurs(7); isOurs[0] = false; isOurs[1] = false; isOurs[2] = false; isOurs[3] = false; isOurs[4] = false; isOurs[5] = false; isOurs[6] = false; //cout << "Start serializing a full tree" << endl; PartialMerkleTree pmtFull(7, &isOurs, &txList_); BinaryData pmtSerFull = pmtFull.serialize(); //cout << "Finished serializing (full)" << endl; //cout << "Merkle Root: " << pmtFull.getMerkleRoot().toHexStr() << endl; //cout << "Starting unserialize (full):" << endl; //cout << "Serialized: " << pmtSerFull.toHexStr() << endl; PartialMerkleTree pmtFull2(7); pmtFull2.unserialize(pmtSerFull); BinaryData pmtSerFull2 = pmtFull2.serialize(); //cout << "Reserializ: " << pmtSerFull2.toHexStr() << endl; //cout << "Equal? " << (pmtSerFull==pmtSerFull2 ? "True" : "False") << endl; //cout << "Print Tree:" << endl; //pmtFull2.pprintTree(); EXPECT_EQ(pmtSerFull, pmtSerFull2); } //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // THESE ARE ARMORY_DB_BARE tests. Identical to above except for the mode. //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class BlockUtilsBare : public ::testing::Test { protected: ///////////////////////////////////////////////////////////////////////////// virtual void SetUp(void) { LOGDISABLESTDOUT(); iface_ = LevelDBWrapper::GetInterfacePtr(); magic_ = READHEX(MAINNET_MAGIC_BYTES); ghash_ = READHEX(MAINNET_GENESIS_HASH_HEX); gentx_ = READHEX(MAINNET_GENESIS_TX_HASH_HEX); zeros_ = READHEX("00000000"); DBUtils.setArmoryDbType(ARMORY_DB_BARE); DBUtils.setDbPruneType(DB_PRUNE_NONE); blkdir_ = string("./blkfiletest"); homedir_ = string("./fakehomedir"); ldbdir_ = string("./ldbtestdir"); iface_->openDatabases( ldbdir_, ghash_, gentx_, magic_, ARMORY_DB_BARE, DB_PRUNE_NONE); if(!iface_->databasesAreOpen()) LOGERR << "ERROR OPENING DATABASES FOR TESTING!"; mkdir(blkdir_); mkdir(homedir_); // Put the first 5 blocks into the blkdir blk0dat_ = BtcUtils::getBlkFilename(blkdir_, 0); BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_); TheBDM.SelectNetwork("Main"); TheBDM.SetBlkFileLocation(blkdir_); TheBDM.SetHomeDirLocation(homedir_); TheBDM.SetLevelDBLocation(ldbdir_); blkHash0 = READHEX("6fe28c0ab6f1b372c1a6a246ae63f74f931e8365e15a089c68d6190000000000"); blkHash1 = READHEX("1b5514b83257d924be7f10c65b95b1f3c0e50081e1dfd8943eece5eb00000000"); blkHash2 = READHEX("979fc39616bf1dc6b1f88167f76383d44d65ccd0fc99b7f91bcb2c9500000000"); blkHash3 = READHEX("50f8231e5fd476f470e1ba4937bc97cb304136c96c765339308935bc00000000"); blkHash4 = READHEX("8e121ba0d275f49a21bbc171d7d49890de13c9b9733e0104654d262f00000000"); blkHash3A= READHEX("dd63f62ef59d5b6a6da2a36407f76e4e28026a3fd3a46700d284424700000000"); blkHash4A= READHEX("bfa204022816102169b4e1d4f78cdf77258048f6d14282144cc01d5500000000"); blkHash5A= READHEX("4e049fd71ef7381a73e4f550d97812d1eb0fbd1489c1774e18855f1900000000"); addrA_ = READHEX("62e907b15cbf27d5425399ebf6f0fb50ebb88f18"); addrB_ = READHEX("ee26c56fc1d942be8d7a24b2a1001dd894693980"); addrC_ = READHEX("cb2abde8bccacc32e893df3a054b9ef7f227a4ce"); addrD_ = READHEX("c522664fb0e55cdc5c0cea73b4aad97ec8343232"); scrAddrA_ = HASH160PREFIX + addrA_; scrAddrB_ = HASH160PREFIX + addrB_; scrAddrC_ = HASH160PREFIX + addrC_; scrAddrD_ = HASH160PREFIX + addrD_; } ///////////////////////////////////////////////////////////////////////////// virtual void TearDown(void) { BlockDataManager_LevelDB::DestroyInstance(); rmdir(blkdir_); rmdir(homedir_); char* delstr = new char[4096]; sprintf(delstr, "%s/level*", ldbdir_.c_str()); rmdir(delstr); delete[] delstr; LOGENABLESTDOUT(); } #if ! defined(_MSC_VER) && ! defined(__MINGW32__) ///////////////////////////////////////////////////////////////////////////// void rmdir(string src) { char* syscmd = new char[4096]; sprintf(syscmd, "rm -rf %s", src.c_str()); system(syscmd); delete[] syscmd; } ///////////////////////////////////////////////////////////////////////////// void mkdir(string newdir) { char* syscmd = new char[4096]; sprintf(syscmd, "mkdir -p %s", newdir.c_str()); system(syscmd); delete[] syscmd; } #endif InterfaceToLDB* iface_; BinaryData magic_; BinaryData ghash_; BinaryData gentx_; BinaryData zeros_; string blkdir_; string homedir_; string ldbdir_; string blk0dat_;; BinaryData blkHash0; BinaryData blkHash1; BinaryData blkHash2; BinaryData blkHash3; BinaryData blkHash4; BinaryData blkHash3A; BinaryData blkHash4A; BinaryData blkHash5A; BinaryData addrA_; BinaryData addrB_; BinaryData addrC_; BinaryData addrD_; BinaryData scrAddrA_; BinaryData scrAddrB_; BinaryData scrAddrC_; BinaryData scrAddrD_; }; //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsBare, BuildNoRegisterWlt) { TheBDM.doInitialSyncOnLoad(); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsBare, Load5Blocks) { BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); wlt.addScrAddress(scrAddrC_); TheBDM.registerWallet(&wlt); TheBDM.registerNewScrAddr(scrAddrD_); TheBDM.doInitialSyncOnLoad(); TheBDM.scanBlockchainForTx(wlt); ScrAddrObj * scrobj; scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrD_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); // hasn't been scanned yet EXPECT_EQ(wlt.getFullBalance(), 150*COIN); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsBare, Load4Blocks_Plus1) { BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); wlt.addScrAddress(scrAddrC_); TheBDM.registerWallet(&wlt); TheBDM.registerNewScrAddr(scrAddrD_); // Copy only the first four blocks. Will copy the full file next to test // readBlkFileUpdate method on non-reorg blocks. BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_, 1596); TheBDM.doInitialSyncOnLoad(); TheBDM.scanBlockchainForTx(wlt); EXPECT_EQ(iface_->getTopBlockHeight(HEADERS), 3); EXPECT_EQ(iface_->getTopBlockHash(HEADERS), blkHash3); EXPECT_TRUE(TheBDM.getHeaderByHash(blkHash3)->isMainBranch()); BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_); TheBDM.readBlkFileUpdate(); TheBDM.scanBlockchainForTx(wlt); EXPECT_EQ(iface_->getTopBlockHeight(HEADERS), 4); EXPECT_EQ(iface_->getTopBlockHash(HEADERS), blkHash4); EXPECT_TRUE(TheBDM.getHeaderByHash(blkHash4)->isMainBranch()); ScrAddrObj * scrobj; scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrD_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); // hasn't been scanned yet } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsBare, Load5Blocks_FullReorg) { BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); wlt.addScrAddress(scrAddrC_); TheBDM.registerWallet(&wlt); TheBDM.registerNewScrAddr(scrAddrD_); BtcWallet wlt2; wlt2.addScrAddress(scrAddrD_); TheBDM.doInitialSyncOnLoad(); TheBDM.scanBlockchainForTx(wlt); TheBDM.scanBlockchainForTx(wlt2); BtcUtils::copyFile("../reorgTest/blk_3A.dat", blk0dat_); TheBDM.readBlkFileUpdate(); BtcUtils::copyFile("../reorgTest/blk_4A.dat", blk0dat_); TheBDM.readBlkFileUpdate(); BtcUtils::copyFile("../reorgTest/blk_5A.dat", blk0dat_); TheBDM.readBlkFileUpdate(); TheBDM.scanBlockchainForTx(wlt); TheBDM.scanBlockchainForTx(wlt2); ScrAddrObj * scrobj; scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),150*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 10*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); //scrobj = &wlt.getScrAddrObjByKey(scrAddrD_); //EXPECT_EQ(scrobj->getFullBalance(),140*COIN); EXPECT_EQ(wlt.getFullBalance(), 160*COIN); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsBare, CorruptedBlock) { BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); wlt.addScrAddress(scrAddrC_); TheBDM.registerWallet(&wlt); TheBDM.registerNewScrAddr(scrAddrD_); BtcWallet wlt2; wlt2.addScrAddress(scrAddrD_); TheBDM.doInitialSyncOnLoad(); TheBDM.scanBlockchainForTx(wlt); TheBDM.scanBlockchainForTx(wlt2); // corrupt blk_5A { const std::string src = "../reorgTest/blk_5A.dat"; const std::string dst = blk0dat_; const uint64_t srcsz = BtcUtils::GetFileSize(src); BinaryData temp((size_t)srcsz); ifstream is(src.c_str(), ios::in | ios::binary); is.read((char*)temp.getPtr(), srcsz); is.close(); ofstream os(dst.c_str(), ios::out | ios::binary); os.write((char*)temp.getPtr(), 100); os.write((char*)temp.getPtr()+120, srcsz-100-20); // erase 20 bytes os.close(); } TheBDM.readBlkFileUpdate(); TheBDM.scanBlockchainForTx(wlt); TheBDM.scanBlockchainForTx(wlt2); ScrAddrObj * scrobj; scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); //scrobj = &wlt.getScrAddrObjByKey(scrAddrD_); //EXPECT_EQ(scrobj->getFullBalance(),140*COIN); EXPECT_EQ(wlt.getFullBalance(), 150*COIN); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsBare, Load5Blocks_RescanOps) { ScrAddrObj * scrobj; BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); wlt.addScrAddress(scrAddrC_); TheBDM.registerWallet(&wlt); // Regular sync TheBDM.doInitialSyncOnLoad(); TheBDM.scanBlockchainForTx(wlt); scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); // Rebuild on-the-fly TheBDM.doRebuildDatabases(); TheBDM.scanBlockchainForTx(wlt); scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); // Rebuild on-the-fly TheBDM.doFullRescanRegardlessOfSync(); TheBDM.scanBlockchainForTx(wlt); scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); TheBDM.doSyncIfNeeded(); TheBDM.scanBlockchainForTx(wlt); scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); // Now add a new addr (with balance) and rescan //scrobj = &wlt.getScrAddrObjByKey(scrAddrD_); //EXPECT_EQ(scrobj->getFullBalance(),100*COIN); // hasn't been scanned yet } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsBare, Load5Blocks_RescanEmptyDB) { ScrAddrObj * scrobj; BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); wlt.addScrAddress(scrAddrC_); TheBDM.registerWallet(&wlt); TheBDM.doInitialSyncOnLoad_Rescan(); TheBDM.scanBlockchainForTx(wlt); scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsBare, Load5Blocks_RebuildEmptyDB) { ScrAddrObj * scrobj; BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); wlt.addScrAddress(scrAddrC_); TheBDM.registerWallet(&wlt); /////////////////////////////////////////// TheBDM.doInitialSyncOnLoad_Rebuild(); /////////////////////////////////////////// TheBDM.scanBlockchainForTx(wlt); scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsBare, Load5Blocks_ForceFullRewhatever) { ScrAddrObj * scrobj; BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); wlt.addScrAddress(scrAddrC_); TheBDM.registerWallet(&wlt); // This is just a regular load TheBDM.doInitialSyncOnLoad(); TheBDM.scanBlockchainForTx(wlt); wlt.addScrAddress(scrAddrD_); scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrD_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); /////////////////////////////////////////// TheBDM.doFullRescanRegardlessOfSync(); /////////////////////////////////////////// TheBDM.scanBlockchainForTx(wlt); scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrD_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); /////////////////////////////////////////// TheBDM.doRebuildDatabases(); /////////////////////////////////////////// TheBDM.scanBlockchainForTx(wlt); scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrD_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsBare, Load5Blocks_ScanWhatIsNeeded) { ScrAddrObj * scrobj; BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); wlt.addScrAddress(scrAddrC_); TheBDM.registerWallet(&wlt); // This is just a regular load TheBDM.doInitialSyncOnLoad(); TheBDM.scanBlockchainForTx(wlt); wlt.addScrAddress(scrAddrD_); scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrD_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); /////////////////////////////////////////// TheBDM.doSyncIfNeeded(); /////////////////////////////////////////// TheBDM.scanBlockchainForTx(wlt); scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrD_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); /////////////////////////////////////////// TheBDM.doSyncIfNeeded(); /////////////////////////////////////////// TheBDM.scanBlockchainForTx(wlt); scrobj = &wlt.getScrAddrObjByKey(scrAddrA_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrB_); EXPECT_EQ(scrobj->getFullBalance(), 0*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrC_); EXPECT_EQ(scrobj->getFullBalance(), 50*COIN); scrobj = &wlt.getScrAddrObjByKey(scrAddrD_); EXPECT_EQ(scrobj->getFullBalance(),100*COIN); } //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// /* class FullScanTest : public ::testing::Test { protected: ///////////////////////////////////////////////////////////////////////////// virtual void SetUp(void) { LOGDISABLESTDOUT(); //iface_ = LevelDBWrapper::GetInterfacePtr(); magic_ = READHEX(MAINNET_MAGIC_BYTES); ghash_ = READHEX(MAINNET_GENESIS_HASH_HEX); gentx_ = READHEX(MAINNET_GENESIS_TX_HASH_HEX); zeros_ = READHEX("00000000"); //DBUtils.setArmoryDbType(ARMORY_DB_BARE); //DBUtils.setDbPruneType(DB_PRUNE_NONE); blkdatadir_ = string("./databases/leveldb_blkdata"); } ///// virtual void TearDown(void) { // This seem to be the best way to remove a dir tree in C++ (in Linux) //iface_->closeDatabases(); iface_ = NULL; } leveldb::Slice binaryDataToSlice(BinaryData const & bd) {return leveldb::Slice((char*)bd.getPtr(), bd.getSize());} leveldb::Slice binaryDataRefToSlice(BinaryDataRef const & bdr) {return leveldb::Slice((char*)bdr.getPtr(), bdr.getSize());} BinaryRefReader sliceToRefReader(leveldb::Slice slice) { return BinaryRefReader( (uint8_t*)(slice.data()), slice.size()); } InterfaceToLDB* iface_; BinaryData magic_; BinaryData ghash_; BinaryData gentx_; BinaryData zeros_; string blkdatadir_; BinaryRefReader currKey_; BinaryRefReader currVal_; }; //////////////////////////////////////////////////////////////////////////////// TEST_F(FullScanTest, DISABLED_TestSuperRaw) { leveldb::Options opts; opts.compression = leveldb::kNoCompression; //opts.block_cache = leveldb::NewLRUCache(2048 * 1024 * 1024); leveldb::DB* dbptr; leveldb::Status stat = leveldb::DB::Open(opts, blkdatadir_, &dbptr); if(!stat.ok()) cout << "Error opening DB: " << stat.ToString() << endl; leveldb::ReadOptions readopts; readopts.fill_cache = false; //cout << "fill_cache = true (bad)" << endl; cout << "fill_cache = false (good)" << endl; leveldb::Iterator* iter = dbptr->NewIterator(readopts); BinaryData firstKeyBD = DBUtils.getBlkDataKey(0,0); leveldb::Slice firstKey = binaryDataToSlice(firstKeyBD); iter->Seek(firstKey); uint32_t hgt; uint8_t dup; uint16_t txi; uint16_t txo; BLKDATA_TYPE bdtype; BinaryData pref = WRITE_UINT8_LE((uint8_t)DB_PREFIX_TXDATA); // This scraddr should have 8 tx BinaryData scraddr = WRITE_UINT8_LE((uint8_t)TXOUT_SCRIPT_STDHASH160); scraddr = scraddr + READHEX("33da2736b16558c9569cc226d4b349ce1aacf649"); vector opList; BinaryData currTxHash(32); while(iter->Valid()) { currKey_.setNewData((uint8_t*)iter->key().data(), iter->key().size()); currVal_.setNewData((uint8_t*)iter->value().data(), iter->value().size()); if(!currKey_.getRawRef().startsWith(pref)) break; bdtype = DBUtils.readBlkDataKey(currKey_, hgt, dup, txi, txo); if(bdtype==BLKDATA_HEADER) { // Need to do a little reading&processing to make sure it is actually pulling dat afrom disk currVal_.advance(4); BinaryData hhash = currVal_.get_BinaryData(80); if(hhash.startsWith(zeros_)) cout << "Starts with four zeros!" << endl; } else if(bdtype==BLKDATA_TX) { currVal_.advance(2); currTxHash = currVal_.get_BinaryData(32); } else if(bdtype==BLKDATA_TXOUT) { currVal_.advance(2); TxOut txout; txout.unserialize(currVal_); if(txout.getScrAddressStr() == scraddr) { cout << "Found a txout!" << endl; opList.push_back(OutPoint(currTxHash, txo)); } } else if(bdtype==NOT_BLKDATA) break; iter->Next(); } for(uint32_t o=0; oNewIterator(leveldb::ReadOptions()); uint32_t i=0; uint32_t nblk=0; uint64_t lastWrite=0; uint64_t writeBytes=0; string fname = BtcUtils::getBlkFilename("/home/alan/.bitcoin/blocks", i); BinaryData magic(4), nbytes(4); BinaryData expectedMagicBytes = READHEX(MAINNET_MAGIC_BYTES); leveldb::WriteBatch* writebatch = new leveldb::WriteBatch; while(BtcUtils::GetFileSize(fname) != FILE_DOES_NOT_EXIST) { cout << "Opening: " << fname.c_str() << "(" << BtcUtils::GetFileSize(fname) << ")" << endl; ifstream is(fname.c_str(), ios::in | ios::binary); while(!is.eof()) { // Magic bytes is.read((char*)magic.getPtr(), 4); if(magic != expectedMagicBytes) break; // Number of bytes in block is.read((char*)nbytes.getPtr(), 4); uint32_t blkBytes = READ_UINT32_LE(nbytes.getPtr()); // Reading cout << nblk << " Reading " << blkBytes << " bytes in block; "; BinaryReader br(blkBytes); is.read((char*)br.exposeDataPtr(), blkBytes); br.advance(80); uint32_t numTx = (uint32_t)br.get_var_int(); cout << "Number of tx in block: " << numTx << endl; for(uint32_t tx=0; txPut(ldbKey, ldbVal); } if(writeBytes - lastWrite > 1024*1024*1024) { lastWrite = writeBytes; dbptr->Write(leveldb::WriteOptions(), writebatch); writebatch->Clear(); } nblk++; } i++; fname = BtcUtils::getBlkFilename("/home/alan/.bitcoin/blocks", i); } dbptr->Write(leveldb::WriteOptions(), writebatch); writebatch->Clear(); delete writebatch; delete dbptr; } //////////////////////////////////////////////////////////////////////////////// TEST_F(FullScanTest, ReadSuperRawDB) { string dbdir("./rawdbdir"); BinaryData scraddr = WRITE_UINT8_LE((uint8_t)TXOUT_SCRIPT_STDHASH160); scraddr = scraddr + READHEX("33da2736b16558c9569cc226d4b349ce1aacf649"); leveldb::Options opts; opts.compression = leveldb::kNoCompression; opts.block_cache = leveldb::NewLRUCache(2048 * 1024 * 1024); opts.block_size = 8*1024*1024; leveldb::DB* dbptr; leveldb::Status stat = leveldb::DB::Open(opts, dbdir, &dbptr); if(!stat.ok()) cout << "Error opening DB: " << stat.ToString() << endl; leveldb::ReadOptions readopts; readopts.fill_cache = false; leveldb::Iterator* iter = dbptr->NewIterator(readopts); iter->SeekToFirst(); vector txinOffsets, txoutOffsets; while(iter->Valid()) { currKey_.setNewData((uint8_t*)iter->key().data(), iter->key().size()); currVal_.setNewData((uint8_t*)iter->value().data(), iter->value().size()); uint8_t const * txPtr = currVal_.exposeDataPtr(); BtcUtils::TxCalcLength(txPtr, &txinOffsets, &txoutOffsets); for(uint32_t txo=0; txoNext(); } cout << "Done!" << endl; } */ class LoadTestnetBareTest : public ::testing::Test { protected: ///////////////////////////////////////////////////////////////////////////// virtual void TearDown(void) {} virtual void SetUp(void) { DBUtils.setArmoryDbType(ARMORY_DB_BARE); DBUtils.setDbPruneType(DB_PRUNE_NONE); blkdir_ = string("/home/alan/.bitcoin/testnet3/blocks"); homedir_ = string("/home/alan/.armory/testnet3"); ldbdir_ = string("/home/alan/.armory/testnet3/databases"); mkdir(ldbdir_); mkdir(homedir_); TheBDM.SelectNetwork("Test"); TheBDM.SetBlkFileLocation(blkdir_); TheBDM.SetHomeDirLocation(homedir_); TheBDM.SetLevelDBLocation(ldbdir_); } void mkdir(string newdir) { char* syscmd = new char[4096]; sprintf(syscmd, "mkdir -p %s", newdir.c_str()); system(syscmd); delete[] syscmd; } InterfaceToLDB* iface_; BinaryData magic_; BinaryData ghash_; BinaryData gentx_; BinaryData zeros_; string blkdir_; string homedir_; string ldbdir_; string blk0dat_;; BinaryData addrA_; BinaryData addrB_; BinaryData addrC_; BinaryData addrD_; BinaryData scrAddrA_; BinaryData scrAddrB_; BinaryData scrAddrC_; BinaryData scrAddrD_; }; //////////////////////////////////////////////////////////////////////////////// TEST_F(LoadTestnetBareTest, DISABLED_StepThroughDebug_usually_disabled) { // These aren't actually testnet addr, balances will be zero BinaryData scrAddrA_ = READHEX("0062e907b15cbf27d5425399ebf6f0fb50ebb88f18"); BinaryData scrAddrB_ = READHEX("00ee26c56fc1d942be8d7a24b2a1001dd894693980"); BinaryData scrAddrC_ = READHEX("00cb2abde8bccacc32e893df3a054b9ef7f227a4ce"); BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); wlt.addScrAddress(scrAddrC_); TheBDM.registerWallet(&wlt); TheBDM.doInitialSyncOnLoad(); TheBDM.scanBlockchainForTx(wlt); TheBDM.DestroyInstance(); } //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // THESE ARE ARMORY_DB_SUPER tests. Identical to above except for the mode. //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class BlockUtilsSuper : public ::testing::Test { protected: ///////////////////////////////////////////////////////////////////////////// virtual void SetUp(void) { LOGDISABLESTDOUT(); iface_ = LevelDBWrapper::GetInterfacePtr(); magic_ = READHEX(MAINNET_MAGIC_BYTES); ghash_ = READHEX(MAINNET_GENESIS_HASH_HEX); gentx_ = READHEX(MAINNET_GENESIS_TX_HASH_HEX); zeros_ = READHEX("00000000"); blkdir_ = string("./blkfiletest"); homedir_ = string("./fakehomedir"); ldbdir_ = string("./ldbtestdir"); mkdir(blkdir_); mkdir(homedir_); // Put the first 5 blocks into the blkdir blk0dat_ = BtcUtils::getBlkFilename(blkdir_, 0); BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_); TheBDM.SetDatabaseModes(ARMORY_DB_SUPER, DB_PRUNE_NONE); TheBDM.SelectNetwork("Main"); TheBDM.SetBlkFileLocation(blkdir_); TheBDM.SetHomeDirLocation(homedir_); TheBDM.SetLevelDBLocation(ldbdir_); iface_->openDatabases( ldbdir_, ghash_, gentx_, magic_, ARMORY_DB_SUPER, DB_PRUNE_NONE); if(!iface_->databasesAreOpen()) LOGERR << "ERROR OPENING DATABASES FOR TESTING!"; blkHash0 = READHEX("6fe28c0ab6f1b372c1a6a246ae63f74f931e8365e15a089c68d6190000000000"); blkHash1 = READHEX("1b5514b83257d924be7f10c65b95b1f3c0e50081e1dfd8943eece5eb00000000"); blkHash2 = READHEX("979fc39616bf1dc6b1f88167f76383d44d65ccd0fc99b7f91bcb2c9500000000"); blkHash3 = READHEX("50f8231e5fd476f470e1ba4937bc97cb304136c96c765339308935bc00000000"); blkHash4 = READHEX("8e121ba0d275f49a21bbc171d7d49890de13c9b9733e0104654d262f00000000"); blkHash3A= READHEX("dd63f62ef59d5b6a6da2a36407f76e4e28026a3fd3a46700d284424700000000"); blkHash4A= READHEX("bfa204022816102169b4e1d4f78cdf77258048f6d14282144cc01d5500000000"); blkHash5A= READHEX("4e049fd71ef7381a73e4f550d97812d1eb0fbd1489c1774e18855f1900000000"); addrA_ = READHEX("62e907b15cbf27d5425399ebf6f0fb50ebb88f18"); addrB_ = READHEX("ee26c56fc1d942be8d7a24b2a1001dd894693980"); addrC_ = READHEX("cb2abde8bccacc32e893df3a054b9ef7f227a4ce"); addrD_ = READHEX("c522664fb0e55cdc5c0cea73b4aad97ec8343232"); scrAddrA_ = HASH160PREFIX + addrA_; scrAddrB_ = HASH160PREFIX + addrB_; scrAddrC_ = HASH160PREFIX + addrC_; scrAddrD_ = HASH160PREFIX + addrD_; } ///////////////////////////////////////////////////////////////////////////// virtual void TearDown(void) { BlockDataManager_LevelDB::DestroyInstance(); rmdir(blkdir_); rmdir(homedir_); char* delstr = new char[4096]; sprintf(delstr, "%s/level*", ldbdir_.c_str()); rmdir(delstr); delete[] delstr; LOGENABLESTDOUT(); } #if ! defined(_MSC_VER) && ! defined(__MINGW32__) ///////////////////////////////////////////////////////////////////////////// void rmdir(string src) { char* syscmd = new char[4096]; sprintf(syscmd, "rm -rf %s", src.c_str()); system(syscmd); delete[] syscmd; } ///////////////////////////////////////////////////////////////////////////// void mkdir(string newdir) { char* syscmd = new char[4096]; sprintf(syscmd, "mkdir -p %s", newdir.c_str()); system(syscmd); delete[] syscmd; } #endif InterfaceToLDB* iface_; BinaryData magic_; BinaryData ghash_; BinaryData gentx_; BinaryData zeros_; string blkdir_; string homedir_; string ldbdir_; string blk0dat_;; BinaryData blkHash0; BinaryData blkHash1; BinaryData blkHash2; BinaryData blkHash3; BinaryData blkHash4; BinaryData blkHash3A; BinaryData blkHash4A; BinaryData blkHash5A; BinaryData addrA_; BinaryData addrB_; BinaryData addrC_; BinaryData addrD_; BinaryData scrAddrA_; BinaryData scrAddrB_; BinaryData scrAddrC_; BinaryData scrAddrD_; }; //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsSuper, HeadersOnly) { EXPECT_EQ(TheBDM.getNumBlocks(), 0); TheBDM.processNewHeadersInBlkFiles(0); EXPECT_EQ(TheBDM.getNumBlocks(), 5); EXPECT_EQ(TheBDM.getTopBlockHeight(), 4); EXPECT_EQ(TheBDM.getTopBlockHash(), blkHash4); EXPECT_EQ(iface_->getTopBlockHeight(HEADERS), 4); //iface_->printAllDatabaseEntries(HEADERS); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsSuper, HeadersOnly_Reorg) { SETLOGLEVEL(LogLvlError); EXPECT_EQ(TheBDM.getNumBlocks(), 0); TheBDM.processNewHeadersInBlkFiles(0); EXPECT_EQ(TheBDM.getNumBlocks(), 5); EXPECT_EQ(TheBDM.getTopBlockHeight(), 4); EXPECT_EQ(iface_->getTopBlockHeight(HEADERS), 4); EXPECT_EQ(iface_->getTopBlockHash(HEADERS), blkHash4); BtcUtils::copyFile("../reorgTest/blk_3A.dat", BtcUtils::getBlkFilename(blkdir_, 1)); TheBDM.processNewHeadersInBlkFiles(1); EXPECT_EQ(iface_->getTopBlockHeight(HEADERS), 4); EXPECT_EQ(iface_->getTopBlockHash(HEADERS), blkHash4); EXPECT_FALSE(TheBDM.getHeaderByHash(blkHash3A)->isMainBranch()); EXPECT_TRUE( TheBDM.getHeaderByHash(blkHash3 )->isMainBranch()); BtcUtils::copyFile("../reorgTest/blk_4A.dat", BtcUtils::getBlkFilename(blkdir_, 2)); TheBDM.processNewHeadersInBlkFiles(2); EXPECT_EQ(iface_->getTopBlockHeight(HEADERS), 4); EXPECT_EQ(iface_->getTopBlockHash(HEADERS), blkHash4); EXPECT_FALSE(TheBDM.getHeaderByHash(blkHash3A)->isMainBranch()); EXPECT_TRUE( TheBDM.getHeaderByHash(blkHash3 )->isMainBranch()); EXPECT_FALSE(TheBDM.getHeaderByHash(blkHash4A)->isMainBranch()); EXPECT_TRUE( TheBDM.getHeaderByHash(blkHash4 )->isMainBranch()); BtcUtils::copyFile("../reorgTest/blk_5A.dat", BtcUtils::getBlkFilename(blkdir_, 3)); TheBDM.processNewHeadersInBlkFiles(3); EXPECT_EQ(iface_->getTopBlockHeight(HEADERS), 5); EXPECT_EQ(iface_->getTopBlockHeight(HEADERS), 5); EXPECT_EQ(iface_->getTopBlockHash(HEADERS), blkHash5A); EXPECT_FALSE(TheBDM.getHeaderByHash(blkHash3 )->isMainBranch()); EXPECT_TRUE( TheBDM.getHeaderByHash(blkHash3A)->isMainBranch()); EXPECT_FALSE(TheBDM.getHeaderByHash(blkHash4 )->isMainBranch()); EXPECT_TRUE( TheBDM.getHeaderByHash(blkHash4A)->isMainBranch()); SETLOGLEVEL(LogLvlDebug2); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsSuper, Load5Blocks) { DBUtils.setArmoryDbType(ARMORY_DB_SUPER); DBUtils.setDbPruneType(DB_PRUNE_NONE); TheBDM.doInitialSyncOnLoad(); StoredScriptHistory ssh; iface_->getStoredScriptHistory(ssh, scrAddrA_); EXPECT_EQ(ssh.getScriptBalance(), 100*COIN); EXPECT_EQ(ssh.getScriptReceived(), 100*COIN); EXPECT_EQ(ssh.totalTxioCount_, 2); iface_->getStoredScriptHistory(ssh, scrAddrB_); EXPECT_EQ(ssh.getScriptBalance(), 0*COIN); EXPECT_EQ(ssh.getScriptReceived(), 140*COIN); EXPECT_EQ(ssh.totalTxioCount_, 3); iface_->getStoredScriptHistory(ssh, scrAddrC_); EXPECT_EQ(ssh.getScriptBalance(), 50*COIN); EXPECT_EQ(ssh.getScriptReceived(), 60*COIN); EXPECT_EQ(ssh.totalTxioCount_, 2); iface_->getStoredScriptHistory(ssh, scrAddrD_); EXPECT_EQ(ssh.getScriptBalance(), 100*COIN); EXPECT_EQ(ssh.getScriptReceived(), 100*COIN); EXPECT_EQ(ssh.totalTxioCount_, 3); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsSuper, Load4BlocksPlus1) { // Copy only the first four blocks. Will copy the full file next to test // readBlkFileUpdate method on non-reorg blocks. BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_, 1596); TheBDM.doInitialSyncOnLoad(); EXPECT_EQ(iface_->getTopBlockHeight(HEADERS), 3); EXPECT_EQ(iface_->getTopBlockHash(HEADERS), blkHash3); EXPECT_TRUE(TheBDM.getHeaderByHash(blkHash3)->isMainBranch()); BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_); TheBDM.readBlkFileUpdate(); EXPECT_EQ(iface_->getTopBlockHeight(HEADERS), 4); EXPECT_EQ(iface_->getTopBlockHash(HEADERS), blkHash4); EXPECT_TRUE(TheBDM.getHeaderByHash(blkHash4)->isMainBranch()); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsSuper, Load5Blocks_Plus2NoReorg) { DBUtils.setArmoryDbType(ARMORY_DB_SUPER); DBUtils.setDbPruneType(DB_PRUNE_NONE); TheBDM.doInitialSyncOnLoad(); BtcUtils::copyFile("../reorgTest/blk_3A.dat", blk0dat_); TheBDM.readBlkFileUpdate(); EXPECT_EQ(TheBDM.getTopBlockHash(), blkHash4); EXPECT_EQ(TheBDM.getTopBlockHeight(), 4); BtcUtils::copyFile("../reorgTest/blk_4A.dat", blk0dat_); TheBDM.readBlkFileUpdate(); EXPECT_EQ(TheBDM.getTopBlockHash(), blkHash4); EXPECT_EQ(TheBDM.getTopBlockHeight(), 4); //BtcUtils::copyFile("../reorgTest/blk_5A.dat", blk0dat_); //iface_->pprintBlkDataDB(BLKDATA); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsSuper, Load5Blocks_FullReorg) { DBUtils.setArmoryDbType(ARMORY_DB_SUPER); DBUtils.setDbPruneType(DB_PRUNE_NONE); TheBDM.doInitialSyncOnLoad(); BtcUtils::copyFile("../reorgTest/blk_3A.dat", blk0dat_); TheBDM.readBlkFileUpdate(); BtcUtils::copyFile("../reorgTest/blk_4A.dat", blk0dat_); TheBDM.readBlkFileUpdate(); BtcUtils::copyFile("../reorgTest/blk_5A.dat", blk0dat_); TheBDM.readBlkFileUpdate(); //iface_->pprintBlkDataDB(BLKDATA); StoredScriptHistory ssh; iface_->getStoredScriptHistory(ssh, scrAddrA_); EXPECT_EQ(ssh.getScriptBalance(), 150*COIN); EXPECT_EQ(ssh.getScriptReceived(), 150*COIN); EXPECT_EQ(ssh.totalTxioCount_, 3); iface_->getStoredScriptHistory(ssh, scrAddrB_); EXPECT_EQ(ssh.getScriptBalance(), 10*COIN); EXPECT_EQ(ssh.getScriptReceived(), 150*COIN); EXPECT_EQ(ssh.totalTxioCount_, 4); iface_->getStoredScriptHistory(ssh, scrAddrC_); EXPECT_EQ(ssh.getScriptBalance(), 0*COIN); EXPECT_EQ(ssh.getScriptReceived(), 10*COIN); EXPECT_EQ(ssh.totalTxioCount_, 1); iface_->getStoredScriptHistory(ssh, scrAddrD_); EXPECT_EQ(ssh.getScriptBalance(), 140*COIN); EXPECT_EQ(ssh.getScriptReceived(), 140*COIN); EXPECT_EQ(ssh.totalTxioCount_, 3); } //////////////////////////////////////////////////////////////////////////////// // These next two tests disabled because they broke after ARMORY_DB_BARE impl TEST_F(BlockUtilsSuper, DISABLED_RestartDBAfterBuild) { // Copy only the first four blocks. Will copy the full file next to test // readBlkFileUpdate method on non-reorg blocks. BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_, 926); TheBDM.doInitialSyncOnLoad(); EXPECT_EQ(iface_->getTopBlockHeight(HEADERS), 2); EXPECT_EQ(iface_->getTopBlockHash(HEADERS), blkHash2); EXPECT_TRUE(TheBDM.getHeaderByHash(blkHash2)->isMainBranch()); TheBDM.DestroyInstance(); // Add two more blocks BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_); // Now reinitialize the DB and hopefully detect the new blocks and update TheBDM.SelectNetwork("Main"); TheBDM.SetBlkFileLocation(blkdir_); TheBDM.SetHomeDirLocation(homedir_); TheBDM.SetLevelDBLocation(ldbdir_); DBUtils.setArmoryDbType(ARMORY_DB_SUPER); DBUtils.setDbPruneType(DB_PRUNE_NONE); TheBDM.SetDatabaseModes(ARMORY_DB_SUPER, DB_PRUNE_NONE); TheBDM.doInitialSyncOnLoad(); EXPECT_EQ(TheBDM.getTopBlockHeightInDB(HEADERS), 4); EXPECT_EQ(TheBDM.getTopBlockHeightInDB(BLKDATA), 4); EXPECT_TRUE(TheBDM.getHeaderByHash(blkHash4)->isMainBranch()); StoredScriptHistory ssh; iface_->getStoredScriptHistory(ssh, scrAddrA_); EXPECT_EQ(ssh.getScriptBalance(), 100*COIN); EXPECT_EQ(ssh.getScriptReceived(), 100*COIN); EXPECT_EQ(ssh.totalTxioCount_, 2); iface_->getStoredScriptHistory(ssh, scrAddrB_); EXPECT_EQ(ssh.getScriptBalance(), 0*COIN); EXPECT_EQ(ssh.getScriptReceived(), 140*COIN); EXPECT_EQ(ssh.totalTxioCount_, 3); iface_->getStoredScriptHistory(ssh, scrAddrC_); EXPECT_EQ(ssh.getScriptBalance(), 50*COIN); EXPECT_EQ(ssh.getScriptReceived(), 60*COIN); EXPECT_EQ(ssh.totalTxioCount_, 2); iface_->getStoredScriptHistory(ssh, scrAddrD_); EXPECT_EQ(ssh.getScriptBalance(), 100*COIN); EXPECT_EQ(ssh.getScriptReceived(), 100*COIN); EXPECT_EQ(ssh.totalTxioCount_, 3); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsSuper, DISABLED_RestartDBAfterBuild_withReplay) { // Copy only the first four blocks. Will copy the full file next to test // readBlkFileUpdate method on non-reorg blocks. BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_, 926); TheBDM.doInitialSyncOnLoad(); EXPECT_EQ(iface_->getTopBlockHeight(HEADERS), 2); EXPECT_EQ(iface_->getTopBlockHash(HEADERS), blkHash2); EXPECT_TRUE(TheBDM.getHeaderByHash(blkHash2)->isMainBranch()); TheBDM.DestroyInstance(); // Add two more blocks BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_); // Now reinitialize the DB and hopefully detect the new blocks and update TheBDM.SelectNetwork("Main"); TheBDM.SetBlkFileLocation(blkdir_); TheBDM.SetHomeDirLocation(homedir_); TheBDM.SetLevelDBLocation(ldbdir_); DBUtils.setArmoryDbType(ARMORY_DB_SUPER); DBUtils.setDbPruneType(DB_PRUNE_NONE); uint32_t replayRewind = 700; TheBDM.SetDatabaseModes(ARMORY_DB_SUPER, DB_PRUNE_NONE); TheBDM.doInitialSyncOnLoad(); TheBDM.doInitialSyncOnLoad(); EXPECT_EQ(TheBDM.getTopBlockHeightInDB(HEADERS), 4); EXPECT_EQ(TheBDM.getTopBlockHeightInDB(BLKDATA), 4); EXPECT_TRUE(TheBDM.getHeaderByHash(blkHash4)->isMainBranch()); StoredScriptHistory ssh; iface_->getStoredScriptHistory(ssh, scrAddrA_); EXPECT_EQ(ssh.getScriptBalance(), 100*COIN); EXPECT_EQ(ssh.getScriptReceived(), 100*COIN); EXPECT_EQ(ssh.totalTxioCount_, 2); iface_->getStoredScriptHistory(ssh, scrAddrB_); EXPECT_EQ(ssh.getScriptBalance(), 0*COIN); EXPECT_EQ(ssh.getScriptReceived(), 140*COIN); EXPECT_EQ(ssh.totalTxioCount_, 3); iface_->getStoredScriptHistory(ssh, scrAddrC_); EXPECT_EQ(ssh.getScriptBalance(), 50*COIN); EXPECT_EQ(ssh.getScriptReceived(), 60*COIN); EXPECT_EQ(ssh.totalTxioCount_, 2); iface_->getStoredScriptHistory(ssh, scrAddrD_); EXPECT_EQ(ssh.getScriptBalance(), 100*COIN); EXPECT_EQ(ssh.getScriptReceived(), 100*COIN); EXPECT_EQ(ssh.totalTxioCount_, 3); // Random note (since I just spent 2 hours trying to figure out why // I wasn't getting warnings about re-marking TxOuts spent that were // already marked spent): We get three warnings about TxOuts that // already marked unspent in the SSH objects when we replay blocks // 1 and 2 (but not 0). This is expected. But, I also expected a // warning about a TxOut already marked spent. Turns out that // we are replaying the previous block first which calls "markUnspent" // before we hit this mark-spent logic. So when we started the // method, we actually did have a already-marked-spent TxOut, but // it was marked unspent before we got the point of trying to mark // it spent again. In other words, all expected behavior. } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsSuper, DISABLED_TimeAndSpaceTest_usuallydisabled) { DBUtils.setArmoryDbType(ARMORY_DB_SUPER); DBUtils.setDbPruneType(DB_PRUNE_NONE); string oldblkdir = blkdir_; //blkdir_ = string("/home/alan/.bitcoin/blks3"); //blkdir_ = string("/home/alan/.bitcoin/blocks"); //TheBDM.SelectNetwork("Main"); blkdir_ = string("/home/alan/.bitcoin/testnet3/blocks"); TheBDM.SelectNetwork("Test"); TheBDM.SetBlkFileLocation(blkdir_); TheBDM.SetHomeDirLocation(homedir_); StoredScriptHistory ssh; TheBDM.doInitialSyncOnLoad(); BinaryData scrAddr = READHEX("11b366edfc0a8b66feebae5c2e25a7b6a5d1cf31"); BinaryData scrAddr2 = READHEX("39aa3d569e06a1d7926dc4be1193c99bf2eb9ee0"); BinaryData scrAddr3 = READHEX("758e51b5e398a32c6abd091b3fde383291267cfa"); BinaryData scrAddr4 = READHEX("6c22eb00e3f93acac5ae5d81a9db78a645dfc9c7"); EXPECT_EQ(TheBDM.getDBBalanceForHash160(scrAddr), 18*COIN); TheBDM.pprintSSHInfoAboutHash160(scrAddr); TheBDM.pprintSSHInfoAboutHash160(scrAddr2); TheBDM.pprintSSHInfoAboutHash160(scrAddr3); TheBDM.pprintSSHInfoAboutHash160(scrAddr4); blkdir_ = oldblkdir; LOGINFO << "waiting... (please copy the DB dir...)"; int pause; cin >> pause; } //////////////////////////////////////////////////////////////////////////////// // I thought I was going to do something different with this set of tests, // but I ended up with an exact copy of the BlockUtilsSuper fixture. Oh well. class BlockUtilsWithWalletTest: public ::testing::Test { protected: ///////////////////////////////////////////////////////////////////////////// virtual void SetUp(void) { LOGDISABLESTDOUT(); iface_ = LevelDBWrapper::GetInterfacePtr(); magic_ = READHEX(MAINNET_MAGIC_BYTES); ghash_ = READHEX(MAINNET_GENESIS_HASH_HEX); gentx_ = READHEX(MAINNET_GENESIS_TX_HASH_HEX); zeros_ = READHEX("00000000"); blkdir_ = string("./blkfiletest"); homedir_ = string("./fakehomedir"); ldbdir_ = string("./ldbtestdir"); mkdir(blkdir_); mkdir(homedir_); // Put the first 5 blocks into the blkdir blk0dat_ = BtcUtils::getBlkFilename(blkdir_, 0); BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_); TheBDM.SetDatabaseModes(ARMORY_DB_SUPER, DB_PRUNE_NONE); TheBDM.SelectNetwork("Main"); TheBDM.SetBlkFileLocation(blkdir_); TheBDM.SetHomeDirLocation(homedir_); TheBDM.SetLevelDBLocation(ldbdir_); blkHash0 = READHEX("6fe28c0ab6f1b372c1a6a246ae63f74f931e8365e15a089c68d6190000000000"); blkHash1 = READHEX("1b5514b83257d924be7f10c65b95b1f3c0e50081e1dfd8943eece5eb00000000"); blkHash2 = READHEX("979fc39616bf1dc6b1f88167f76383d44d65ccd0fc99b7f91bcb2c9500000000"); blkHash3 = READHEX("50f8231e5fd476f470e1ba4937bc97cb304136c96c765339308935bc00000000"); blkHash4 = READHEX("8e121ba0d275f49a21bbc171d7d49890de13c9b9733e0104654d262f00000000"); blkHash3A= READHEX("dd63f62ef59d5b6a6da2a36407f76e4e28026a3fd3a46700d284424700000000"); blkHash4A= READHEX("bfa204022816102169b4e1d4f78cdf77258048f6d14282144cc01d5500000000"); blkHash5A= READHEX("4e049fd71ef7381a73e4f550d97812d1eb0fbd1489c1774e18855f1900000000"); addrA_ = READHEX("62e907b15cbf27d5425399ebf6f0fb50ebb88f18"); addrB_ = READHEX("ee26c56fc1d942be8d7a24b2a1001dd894693980"); addrC_ = READHEX("cb2abde8bccacc32e893df3a054b9ef7f227a4ce"); addrD_ = READHEX("c522664fb0e55cdc5c0cea73b4aad97ec8343232"); scrAddrA_ = HASH160PREFIX + addrA_; scrAddrB_ = HASH160PREFIX + addrB_; scrAddrC_ = HASH160PREFIX + addrC_; scrAddrD_ = HASH160PREFIX + addrD_; } ///////////////////////////////////////////////////////////////////////////// virtual void TearDown(void) { BlockDataManager_LevelDB::DestroyInstance(); rmdir(blkdir_); rmdir(homedir_); char* delstr = new char[4096]; sprintf(delstr, "%s/level*", ldbdir_.c_str()); rmdir(delstr); delete[] delstr; LOGENABLESTDOUT(); } #if ! defined(_MSC_VER) && ! defined(__MINGW32__) ///////////////////////////////////////////////////////////////////////////// void rmdir(string src) { char* syscmd = new char[4096]; sprintf(syscmd, "rm -rf %s", src.c_str()); system(syscmd); delete[] syscmd; } ///////////////////////////////////////////////////////////////////////////// void mkdir(string newdir) { char* syscmd = new char[4096]; sprintf(syscmd, "mkdir -p %s", newdir.c_str()); system(syscmd); delete[] syscmd; } #endif InterfaceToLDB* iface_; BinaryData magic_; BinaryData ghash_; BinaryData gentx_; BinaryData zeros_; string blkdir_; string homedir_; string ldbdir_; string blk0dat_;; BinaryData blkHash0; BinaryData blkHash1; BinaryData blkHash2; BinaryData blkHash3; BinaryData blkHash4; BinaryData blkHash3A; BinaryData blkHash4A; BinaryData blkHash5A; BinaryData addrA_; BinaryData addrB_; BinaryData addrC_; BinaryData addrD_; BinaryData scrAddrA_; BinaryData scrAddrB_; BinaryData scrAddrC_; BinaryData scrAddrD_; }; //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsWithWalletTest, PreRegisterScrAddrs) { BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); wlt.addScrAddress(scrAddrC_); TheBDM.registerWallet(&wlt); TheBDM.registerNewScrAddr(scrAddrD_); BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_); TheBDM.doInitialSyncOnLoad(); TheBDM.fetchAllRegisteredScrAddrData(); TheBDM.scanBlockchainForTx(wlt); uint64_t balanceWlt; uint64_t balanceDB; balanceWlt = wlt.getScrAddrObjByKey(scrAddrA_).getFullBalance(); balanceDB = iface_->getBalanceForScrAddr(scrAddrA_); EXPECT_EQ(balanceWlt, 100*COIN); EXPECT_EQ(balanceDB, 100*COIN); balanceWlt = wlt.getScrAddrObjByKey(scrAddrB_).getFullBalance(); balanceDB = iface_->getBalanceForScrAddr(scrAddrB_); EXPECT_EQ(balanceWlt, 0*COIN); EXPECT_EQ(balanceDB, 0*COIN); balanceWlt = wlt.getScrAddrObjByKey(scrAddrC_).getFullBalance(); balanceDB = iface_->getBalanceForScrAddr(scrAddrC_); EXPECT_EQ(balanceWlt, 50*COIN); EXPECT_EQ(balanceDB, 50*COIN); balanceWlt = wlt.getScrAddrObjByKey(scrAddrD_).getFullBalance(); balanceDB = iface_->getBalanceForScrAddr(scrAddrD_); EXPECT_EQ(balanceWlt, 0*COIN); // D is not part of the wallet EXPECT_EQ(balanceDB, 100*COIN); } //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsWithWalletTest, PostRegisterScrAddr) { BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_); TheBDM.doInitialSyncOnLoad(); // We do all the database stuff first, THEN load the addresses BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); wlt.addScrAddress(scrAddrC_); TheBDM.registerWallet(&wlt); TheBDM.registerNewScrAddr(scrAddrD_); TheBDM.fetchAllRegisteredScrAddrData(); TheBDM.scanRegisteredTxForWallet(wlt); uint64_t balanceWlt; uint64_t balanceDB; balanceWlt = wlt.getScrAddrObjByKey(scrAddrA_).getFullBalance(); balanceDB = iface_->getBalanceForScrAddr(scrAddrA_); EXPECT_EQ(balanceWlt, 100*COIN); EXPECT_EQ(balanceDB, 100*COIN); balanceWlt = wlt.getScrAddrObjByKey(scrAddrB_).getFullBalance(); balanceDB = iface_->getBalanceForScrAddr(scrAddrB_); EXPECT_EQ(balanceWlt, 0*COIN); EXPECT_EQ(balanceDB, 0*COIN); balanceWlt = wlt.getScrAddrObjByKey(scrAddrC_).getFullBalance(); balanceDB = iface_->getBalanceForScrAddr(scrAddrC_); EXPECT_EQ(balanceWlt, 50*COIN); EXPECT_EQ(balanceDB, 50*COIN); balanceWlt = wlt.getScrAddrObjByKey(scrAddrD_).getFullBalance(); balanceDB = iface_->getBalanceForScrAddr(scrAddrD_); EXPECT_EQ(balanceWlt, 0*COIN); // D is not part of the wallet EXPECT_EQ(balanceDB, 100*COIN); } // Comments need to be added.... // Most of this data is from the BIP32 test vectors. class TestCryptoECDSA : public ::testing::Test { protected: ///////////////////////////////////////////////////////////////////////////// virtual void SetUp(void) { verifyX = READHEX("39a36013301597daef41fbe593a02cc513d0b55527ec2df1050e2e8ff49c85c2"); verifyY = READHEX("3cbe7ded0e7ce6a594896b8f62888fdbc5c8821305e2ea42bf01e37300116281"); multScalarA = READHEX("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"); multScalarB = READHEX("483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8"); multRes = READHEX("805714a252d0c0b58910907e85b5b801fff610a36bdf46847a4bf5d9ae2d10ed"); multScalar = READHEX("04bfb2dd60fa8921c2a4085ec15507a921f49cdc839f27f0f280e9c1495d44b5"); multPointX = READHEX("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"); multPointY = READHEX("483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8"); multPointRes = READHEX("7f8bd85f90169a606b0b4323c70e5a12e8a89cbc76647b6ed6a39b4b53825214c590a32f111f857573cf8f2c85d969815e4dd35ae0dc9c7e868195c309b8bada"); addAX = READHEX("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"); addAY = READHEX("483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8"); addBX = READHEX("5a784662a4a20a65bf6aab9ae98a6c068a81c52e4b032c0fb5400c706cfccc56"); addBY = READHEX("7f717885be239daadce76b568958305183ad616ff74ed4dc219a74c26d35f839"); addRes = READHEX("fe2f7c8109d9ae628856d51a02ab25300a8757e088fc336d75cb8dc4cc2ce3339013be71e57c3abeee6ad158646df81d92f8c0778f88100eeb61535f9ff9776d"); invAX = READHEX("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"); invAY = READHEX("483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8"); invRes = READHEX("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798b7c52588d95c3b9aa25b0403f1eef75702e84bb7597aabe663b82f6f04ef2777"); compPointPrv1 = READHEX("000f479245fb19a38a1954c5c7c0ebab2f9bdfd96a17563ef28a6a4b1a2a764ef4"); compPointPub1 = READHEX("02e8445082a72f29b75ca48748a914df60622a609cacfce8ed0e35804560741d29"); uncompPointPub1 = READHEX("04e8445082a72f29b75ca48748a914df60622a609cacfce8ed0e35804560741d292728ad8d58a140050c1016e21f285636a580f4d2711b7fac3957a594ddf416a0"); compPointPrv2 = READHEX("00e8f32e723decf4051aefac8e2c93c9c5b214313817cdb01a1494b917c8436b35"); compPointPub2 = READHEX("0339a36013301597daef41fbe593a02cc513d0b55527ec2df1050e2e8ff49c85c2"); uncompPointPub2 = READHEX("0439a36013301597daef41fbe593a02cc513d0b55527ec2df1050e2e8ff49c85c23cbe7ded0e7ce6a594896b8f62888fdbc5c8821305e2ea42bf01e37300116281"); invModRes = READHEX("000000000000000000000000000000000000000000000000000000000000006b"); LOGDISABLESTDOUT(); } ///////////////////////////////////////////////////////////////////////////// virtual void TearDown(void) { } SecureBinaryData verifyX; SecureBinaryData verifyY; SecureBinaryData multScalarA; SecureBinaryData multScalarB; SecureBinaryData multRes; SecureBinaryData multScalar; SecureBinaryData multPointX; SecureBinaryData multPointY; SecureBinaryData multPointRes; SecureBinaryData addAX; SecureBinaryData addAY; SecureBinaryData addBX; SecureBinaryData addBY; SecureBinaryData addRes; SecureBinaryData invAX; SecureBinaryData invAY; SecureBinaryData invRes; SecureBinaryData compPointPrv1; SecureBinaryData uncompPointPub1; SecureBinaryData compPointPub1; SecureBinaryData compPointPrv2; SecureBinaryData uncompPointPub2; SecureBinaryData compPointPub2; SecureBinaryData invModRes; }; // Verify that a point known to be on the secp256k1 curve is recognized as such. //////////////////////////////////////////////////////////////////////////////// TEST_F(TestCryptoECDSA, VerifySECP256K1Point) { EXPECT_TRUE(CryptoECDSA().ECVerifyPoint(verifyX, verifyY)); } // Multiply two scalars and check the result. //////////////////////////////////////////////////////////////////////////////// TEST_F(TestCryptoECDSA, SECP256K1MultScalars) { SecureBinaryData testRes = CryptoECDSA().ECMultiplyScalars(multScalarA, multScalarB); EXPECT_EQ(multRes, testRes); } // Verify that some public keys (compressed and uncompressed) are valid. //////////////////////////////////////////////////////////////////////////////// TEST_F(TestCryptoECDSA, VerifyPubKeyValidity) { EXPECT_TRUE(CryptoECDSA().VerifyPublicKeyValid(compPointPub1)); EXPECT_TRUE(CryptoECDSA().VerifyPublicKeyValid(compPointPub2)); EXPECT_TRUE(CryptoECDSA().VerifyPublicKeyValid(uncompPointPub1)); EXPECT_TRUE(CryptoECDSA().VerifyPublicKeyValid(uncompPointPub2)); } //////////////////////////////////////////////////////////////////////////////// /* Never got around to finishing this... class TestMainnetBlkchain: public ::testing::Test { protected: ///////////////////////////////////////////////////////////////////////////// virtual void SetUp(void) { iface_ = LevelDBWrapper::GetInterfacePtr(); magic_ = READHEX(MAINNET_MAGIC_BYTES); ghash_ = READHEX(MAINNET_GENESIS_HASH_HEX); gentx_ = READHEX(MAINNET_GENESIS_TX_HASH_HEX); zeros_ = READHEX("00000000"); DBUtils.setArmoryDbType(ARMORY_DB_FULL); DBUtils.setDbPruneType(DB_PRUNE_NONE); blkdir_ = string("/home/alan/.bitcoin"); homedir_ = string("./fakehomedir"); ldbdir_ = string("/home/alan/ARMORY_DB_257k_BLKS"); iface_->openDatabases( ldbdir_, ghash_, gentx_, magic_, ARMORY_DB_SUPER, DB_PRUNE_NONE); if(!iface_->databasesAreOpen()) LOGERR << "ERROR OPENING DATABASES FOR TESTING!"; mkdir(homedir_); TheBDM.SelectNetwork("Main"); TheBDM.SetBlkFileLocation(blkdir_); TheBDM.SetHomeDirLocation(homedir_); TheBDM.SetLevelDBLocation(ldbdir_); addrA_ = READHEX("b077a2b5e8a53f1d3ef4100117125de6a5b15f6b"); addrB_ = READHEX("4c765bca17f9881ad6d4336a1d4ec34a091e5a6f"); scrAddrA_ = HASH160PREFIX + addrA_; scrAddrB_ = HASH160PREFIX + addrB_; LOGDISABLESTDOUT(); } ///////////////////////////////////////////////////////////////////////////// virtual void TearDown(void) { rmdir(homedir_); BlockDataManager_LevelDB::DestroyInstance(); LOGENABLESTDOUT(); } ///////////////////////////////////////////////////////////////////////////// void rmdir(string src) { char* syscmd = new char[4096]; sprintf(syscmd, "rm -rf %s", src.c_str()); system(syscmd); delete[] syscmd; } ///////////////////////////////////////////////////////////////////////////// void mkdir(string newdir) { char* syscmd = new char[4096]; sprintf(syscmd, "mkdir -p %s", newdir.c_str()); system(syscmd); delete[] syscmd; } #endif InterfaceToLDB* iface_; BinaryData magic_; BinaryData ghash_; BinaryData gentx_; BinaryData zeros_; string blkdir_; string homedir_; string ldbdir_; string blk0dat_;; BinaryData blkHash0; BinaryData blkHash1; BinaryData blkHash2; BinaryData blkHash3; BinaryData blkHash4; BinaryData blkHash3A; BinaryData blkHash4A; BinaryData blkHash5A; BinaryData addrA_; BinaryData addrB_; BinaryData addrC_; BinaryData addrD_; BinaryData scrAddrA_; BinaryData scrAddrB_; BinaryData scrAddrC_; BinaryData scrAddrD_; }; //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsWithWalletTest, TestBalanceMainnet_usuallydisabled) { TheBDM.doInitialSyncOnLoad(); // We do all the database stuff first, THEN load the addresses BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); TheBDM.registerWallet(&wlt); TheBDM.registerNewScrAddr(scrAddrD_); TheBDM.fetchAllRegisteredScrAddrData(); TheBDM.scanRegisteredTxForWallet(wlt); uint64_t balanceWlt; uint64_t balanceDB; balanceWlt = wlt.getScrAddrObjByKey(scrAddrA_).getFullBalance(); balanceDB = iface_->getBalanceForScrAddr(scrAddrA_); EXPECT_EQ(balanceWlt, 100*COIN); EXPECT_EQ(balanceDB, 100*COIN); balanceWlt = wlt.getScrAddrObjByKey(scrAddrB_).getFullBalance(); balanceDB = iface_->getBalanceForScrAddr(scrAddrB_); EXPECT_EQ(balanceWlt, 0*COIN); EXPECT_EQ(balanceDB, 0*COIN); balanceWlt = wlt.getScrAddrObjByKey(scrAddrC_).getFullBalance(); balanceDB = iface_->getBalanceForScrAddr(scrAddrC_); EXPECT_EQ(balanceWlt, 50*COIN); EXPECT_EQ(balanceDB, 50*COIN); balanceWlt = wlt.getScrAddrObjByKey(scrAddrD_).getFullBalance(); balanceDB = iface_->getBalanceForScrAddr(scrAddrD_); EXPECT_EQ(balanceWlt, 0*COIN); // D is not part of the wallet EXPECT_EQ(balanceDB, 100*COIN); } */ //////////////////////////////////////////////////////////////////////////////// TEST_F(BlockUtilsWithWalletTest, ZeroConfUpdate) { // Copy only the first four blocks BtcUtils::copyFile("../reorgTest/blk_0_to_4.dat", blk0dat_, 513); BtcWallet wlt; wlt.addScrAddress(scrAddrA_); wlt.addScrAddress(scrAddrB_); wlt.addScrAddress(scrAddrC_); wlt.addScrAddress(scrAddrD_); TheBDM.registerWallet(&wlt); TheBDM.doInitialSyncOnLoad(); TheBDM.fetchAllRegisteredScrAddrData(); TheBDM.scanRegisteredTxForWallet(wlt); uint64_t balanceWlt; uint64_t balanceDB; EXPECT_EQ(wlt.getScrAddrObjByKey(scrAddrA_).getFullBalance(), 50*COIN); EXPECT_EQ(wlt.getScrAddrObjByKey(scrAddrB_).getFullBalance(), 50*COIN); EXPECT_EQ(wlt.getScrAddrObjByKey(scrAddrC_).getFullBalance(), 0*COIN); EXPECT_EQ(wlt.getScrAddrObjByKey(scrAddrD_).getFullBalance(), 0*COIN); BinaryData txWithChangeHash = READHEX( "7f47caaade4bd25b1dc8639411600fd5c279e402bd01c0a0b3c703caf05cc229"); BinaryData txWithChange = READHEX( "0100000001aee7e7fc832d028f454d4fa1ca60ba2f1760d35a80570cb63fe0d6" "dd4755087a000000004a49304602210038fcc428e8f28ebea2e8682a611ac301" "2aedf5289535f3776c3b3acf5fbcff74022100c51c373fab30abd0e9a594be13" "8bdd99a21cdcdb2258cf9795c3d569ac25c3aa01ffffffff0200ca9a3b000000" "001976a914cb2abde8bccacc32e893df3a054b9ef7f227a4ce88ac00286bee00" "0000001976a914ee26c56fc1d942be8d7a24b2a1001dd89469398088ac000000" "00"); ///// TheBDM.addNewZeroConfTx(txWithChange, 1300000000, false); TheBDM.rescanWalletZeroConf(wlt); EXPECT_EQ(wlt.getScrAddrObjByKey(scrAddrA_).getFullBalance(), 50*COIN); EXPECT_EQ(wlt.getScrAddrObjByKey(scrAddrB_).getFullBalance(), 40*COIN); EXPECT_EQ(wlt.getScrAddrObjByKey(scrAddrC_).getFullBalance(), 10*COIN); EXPECT_EQ(wlt.getScrAddrObjByKey(scrAddrD_).getFullBalance(), 0*COIN); } // This was really just to time the logging to determine how much impact it // has. It looks like writing to file is about 1,000,000 logs/sec, while // writing to the null stream (below the threshold log level) is about // 2,200,000/sec. As long as we use log messages sparingly (and timer // calls which call the logger), there will be no problem leaving them // on even in production code. /* TEST(TimeDebugging, WriteToLogNoStdOut) { LOGDISABLESTDOUT(); for(uint32_t i=0; i<1000000; i++) LOGERR << "Testing writing out " << 3 << " diff things"; LOGENABLESTDOUT(); } TEST(TimeDebugging, WriteNull) { for(uint32_t i=0; i<1000000; i++) LOGDEBUG4 << "Testing writing out " << 3 << " diff things"; } */ //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // Now actually execute all the tests //////////////////////////////////////////////////////////////////////////////// GTEST_API_ int main(int argc, char **argv) { std::cout << "Running main() from gtest_main.cc\n"; // Setup the log file STARTLOGGING("cppTestsLog.txt", LogLvlDebug2); //LOGDISABLESTDOUT(); testing::InitGoogleTest(&argc, argv); int exitCode = RUN_ALL_TESTS(); FLUSHLOG(); return exitCode; } armory-0.92.3/cppForSwig/gtest/ldbtestdir/0000755000000000000000000000000012414772654017201 5ustar rootrootarmory-0.92.3/cppForSwig/gtest/ldbtestdir/.gitignore0000644000000000000000000000027412414772654021174 0ustar rootroot# This file is mainly just to give git an excuse commit this otherwise-empty dir # It also guarantees that no other files from this dir are ever committed * # Except this file !.gitignore armory-0.92.3/cppForSwig/gtest/README0000644000000000000000000000075612414772654015731 0ustar rootroot(NOTE: This is for Linux only, I have not tried it on Windows) This directory is for GoogleTest testing files. At the time of this writing, there is only one source: CppBlockUtilsTest.cpp. The Makefile expects to see GoogleTest version 1.6 unloaded three levels down and renamed as relative to this directory: ../../../googletest In other words, this Makefile expects to find the gtest Makefile in: ../../../googletest/Makefile This was implemented and used on Ubuntu 12.10. armory-0.92.3/cppForSwig/gtest/computecov.sh0000644000000000000000000000024412414772654017561 0ustar rootrootrm -rf covhtml mkdir covhtml lcov --capture --directory . --output-file cov.info genhtml cov.info --output-directory covhtml rm cov.info firefox covhtml/index.html armory-0.92.3/cppForSwig/gtest/gtest.h0000644000000000000000000303564412414772654016357 0ustar rootroot// Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // // This header file defines the public API for Google Test. It should be // included by any test program that uses Google Test. // // IMPORTANT NOTE: Due to limitation of the C++ language, we have to // leave some internal implementation details in this header file. // They are clearly marked by comments like this: // // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. // // Such code is NOT meant to be used by a user directly, and is subject // to CHANGE WITHOUT NOTICE. Therefore DO NOT DEPEND ON IT in a user // program! // // Acknowledgment: Google Test borrowed the idea of automatic test // registration from Barthelemy Dagenais' (barthelemy@prologique.com) // easyUnit framework. #ifndef GTEST_INCLUDE_GTEST_GTEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_H_ #include #include // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Authors: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) // // The Google C++ Testing Framework (Google Test) // // This header file declares functions and macros used internally by // Google Test. They are subject to change without notice. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Authors: wan@google.com (Zhanyong Wan) // // Low-level types and utilities for porting Google Test to various // platforms. They are subject to change without notice. DO NOT USE // THEM IN USER CODE. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ // The user can define the following macros in the build script to // control Google Test's behavior. If the user doesn't define a macro // in this list, Google Test will define it. // // GTEST_HAS_CLONE - Define it to 1/0 to indicate that clone(2) // is/isn't available. // GTEST_HAS_EXCEPTIONS - Define it to 1/0 to indicate that exceptions // are enabled. // GTEST_HAS_GLOBAL_STRING - Define it to 1/0 to indicate that ::string // is/isn't available (some systems define // ::string, which is different to std::string). // GTEST_HAS_GLOBAL_WSTRING - Define it to 1/0 to indicate that ::string // is/isn't available (some systems define // ::wstring, which is different to std::wstring). // GTEST_HAS_POSIX_RE - Define it to 1/0 to indicate that POSIX regular // expressions are/aren't available. // GTEST_HAS_PTHREAD - Define it to 1/0 to indicate that // is/isn't available. // GTEST_HAS_RTTI - Define it to 1/0 to indicate that RTTI is/isn't // enabled. // GTEST_HAS_STD_WSTRING - Define it to 1/0 to indicate that // std::wstring does/doesn't work (Google Test can // be used where std::wstring is unavailable). // GTEST_HAS_TR1_TUPLE - Define it to 1/0 to indicate tr1::tuple // is/isn't available. // GTEST_HAS_SEH - Define it to 1/0 to indicate whether the // compiler supports Microsoft's "Structured // Exception Handling". // GTEST_HAS_STREAM_REDIRECTION // - Define it to 1/0 to indicate whether the // platform supports I/O stream redirection using // dup() and dup2(). // GTEST_USE_OWN_TR1_TUPLE - Define it to 1/0 to indicate whether Google // Test's own tr1 tuple implementation should be // used. Unused when the user sets // GTEST_HAS_TR1_TUPLE to 0. // GTEST_LINKED_AS_SHARED_LIBRARY // - Define to 1 when compiling tests that use // Google Test as a shared library (known as // DLL on Windows). // GTEST_CREATE_SHARED_LIBRARY // - Define to 1 when compiling Google Test itself // as a shared library. // This header defines the following utilities: // // Macros indicating the current platform (defined to 1 if compiled on // the given platform; otherwise undefined): // GTEST_OS_AIX - IBM AIX // GTEST_OS_CYGWIN - Cygwin // GTEST_OS_HPUX - HP-UX // GTEST_OS_LINUX - Linux // GTEST_OS_LINUX_ANDROID - Google Android // GTEST_OS_MAC - Mac OS X // GTEST_OS_NACL - Google Native Client (NaCl) // GTEST_OS_SOLARIS - Sun Solaris // GTEST_OS_SYMBIAN - Symbian // GTEST_OS_WINDOWS - Windows (Desktop, MinGW, or Mobile) // GTEST_OS_WINDOWS_DESKTOP - Windows Desktop // GTEST_OS_WINDOWS_MINGW - MinGW // GTEST_OS_WINDOWS_MOBILE - Windows Mobile // GTEST_OS_ZOS - z/OS // // Among the platforms, Cygwin, Linux, Max OS X, and Windows have the // most stable support. Since core members of the Google Test project // don't have access to other platforms, support for them may be less // stable. If you notice any problems on your platform, please notify // googletestframework@googlegroups.com (patches for fixing them are // even more welcome!). // // Note that it is possible that none of the GTEST_OS_* macros are defined. // // Macros indicating available Google Test features (defined to 1 if // the corresponding feature is supported; otherwise undefined): // GTEST_HAS_COMBINE - the Combine() function (for value-parameterized // tests) // GTEST_HAS_DEATH_TEST - death tests // GTEST_HAS_PARAM_TEST - value-parameterized tests // GTEST_HAS_TYPED_TEST - typed tests // GTEST_HAS_TYPED_TEST_P - type-parameterized tests // GTEST_USES_POSIX_RE - enhanced POSIX regex is used. Do not confuse with // GTEST_HAS_POSIX_RE (see above) which users can // define themselves. // GTEST_USES_SIMPLE_RE - our own simple regex is used; // the above two are mutually exclusive. // GTEST_CAN_COMPARE_NULL - accepts untyped NULL in EXPECT_EQ(). // // Macros for basic C++ coding: // GTEST_AMBIGUOUS_ELSE_BLOCKER_ - for disabling a gcc warning. // GTEST_ATTRIBUTE_UNUSED_ - declares that a class' instances or a // variable don't have to be used. // GTEST_DISALLOW_ASSIGN_ - disables operator=. // GTEST_DISALLOW_COPY_AND_ASSIGN_ - disables copy ctor and operator=. // GTEST_MUST_USE_RESULT_ - declares that a function's result must be used. // // Synchronization: // Mutex, MutexLock, ThreadLocal, GetThreadCount() // - synchronization primitives. // GTEST_IS_THREADSAFE - defined to 1 to indicate that the above // synchronization primitives have real implementations // and Google Test is thread-safe; or 0 otherwise. // // Template meta programming: // is_pointer - as in TR1; needed on Symbian and IBM XL C/C++ only. // IteratorTraits - partial implementation of std::iterator_traits, which // is not available in libCstd when compiled with Sun C++. // // Smart pointers: // scoped_ptr - as in TR2. // // Regular expressions: // RE - a simple regular expression class using the POSIX // Extended Regular Expression syntax on UNIX-like // platforms, or a reduced regular exception syntax on // other platforms, including Windows. // // Logging: // GTEST_LOG_() - logs messages at the specified severity level. // LogToStderr() - directs all log messages to stderr. // FlushInfoLog() - flushes informational log messages. // // Stdout and stderr capturing: // CaptureStdout() - starts capturing stdout. // GetCapturedStdout() - stops capturing stdout and returns the captured // string. // CaptureStderr() - starts capturing stderr. // GetCapturedStderr() - stops capturing stderr and returns the captured // string. // // Integer types: // TypeWithSize - maps an integer to a int type. // Int32, UInt32, Int64, UInt64, TimeInMillis // - integers of known sizes. // BiggestInt - the biggest signed integer type. // // Command-line utilities: // GTEST_FLAG() - references a flag. // GTEST_DECLARE_*() - declares a flag. // GTEST_DEFINE_*() - defines a flag. // GetArgvs() - returns the command line as a vector of strings. // // Environment variable utilities: // GetEnv() - gets the value of an environment variable. // BoolFromGTestEnv() - parses a bool environment variable. // Int32FromGTestEnv() - parses an Int32 environment variable. // StringFromGTestEnv() - parses a string environment variable. #include // for isspace, etc #include // for ptrdiff_t #include #include #include #ifndef _WIN32_WCE # include # include #endif // !_WIN32_WCE #include // NOLINT #include // NOLINT #include // NOLINT #define GTEST_DEV_EMAIL_ "googletestframework@@googlegroups.com" #define GTEST_FLAG_PREFIX_ "gtest_" #define GTEST_FLAG_PREFIX_DASH_ "gtest-" #define GTEST_FLAG_PREFIX_UPPER_ "GTEST_" #define GTEST_NAME_ "Google Test" #define GTEST_PROJECT_URL_ "http://code.google.com/p/googletest/" // Determines the version of gcc that is used to compile this. #ifdef __GNUC__ // 40302 means version 4.3.2. # define GTEST_GCC_VER_ \ (__GNUC__*10000 + __GNUC_MINOR__*100 + __GNUC_PATCHLEVEL__) #endif // __GNUC__ // Determines the platform on which Google Test is compiled. #ifdef __CYGWIN__ # define GTEST_OS_CYGWIN 1 #elif defined __SYMBIAN32__ # define GTEST_OS_SYMBIAN 1 #elif defined _WIN32 # define GTEST_OS_WINDOWS 1 # ifdef _WIN32_WCE # define GTEST_OS_WINDOWS_MOBILE 1 # elif defined(__MINGW__) || defined(__MINGW32__) # define GTEST_OS_WINDOWS_MINGW 1 # else # define GTEST_OS_WINDOWS_DESKTOP 1 # endif // _WIN32_WCE #elif defined __APPLE__ # define GTEST_OS_MAC 1 #elif defined __linux__ # define GTEST_OS_LINUX 1 # ifdef ANDROID # define GTEST_OS_LINUX_ANDROID 1 # endif // ANDROID #elif defined __MVS__ # define GTEST_OS_ZOS 1 #elif defined(__sun) && defined(__SVR4) # define GTEST_OS_SOLARIS 1 #elif defined(_AIX) # define GTEST_OS_AIX 1 #elif defined(__hpux) # define GTEST_OS_HPUX 1 #elif defined __native_client__ # define GTEST_OS_NACL 1 #endif // __CYGWIN__ // Brings in definitions for functions used in the testing::internal::posix // namespace (read, write, close, chdir, isatty, stat). We do not currently // use them on Windows Mobile. #if !GTEST_OS_WINDOWS // This assumes that non-Windows OSes provide unistd.h. For OSes where this // is not the case, we need to include headers that provide the functions // mentioned above. # include # if !GTEST_OS_NACL // TODO(vladl@google.com): Remove this condition when Native Client SDK adds // strings.h (tracked in // http://code.google.com/p/nativeclient/issues/detail?id=1175). # include // Native Client doesn't provide strings.h. # endif #elif !GTEST_OS_WINDOWS_MOBILE # include # include #endif // Defines this to true iff Google Test can use POSIX regular expressions. #ifndef GTEST_HAS_POSIX_RE # define GTEST_HAS_POSIX_RE (!GTEST_OS_WINDOWS) #endif #if GTEST_HAS_POSIX_RE // On some platforms, needs someone to define size_t, and // won't compile otherwise. We can #include it here as we already // included , which is guaranteed to define size_t through // . # include // NOLINT # define GTEST_USES_POSIX_RE 1 #elif GTEST_OS_WINDOWS // is not available on Windows. Use our own simple regex // implementation instead. # define GTEST_USES_SIMPLE_RE 1 #else // may not be available on this platform. Use our own // simple regex implementation instead. # define GTEST_USES_SIMPLE_RE 1 #endif // GTEST_HAS_POSIX_RE #ifndef GTEST_HAS_EXCEPTIONS // The user didn't tell us whether exceptions are enabled, so we need // to figure it out. # if defined(_MSC_VER) || defined(__BORLANDC__) // MSVC's and C++Builder's implementations of the STL use the _HAS_EXCEPTIONS // macro to enable exceptions, so we'll do the same. // Assumes that exceptions are enabled by default. # ifndef _HAS_EXCEPTIONS # define _HAS_EXCEPTIONS 1 # endif // _HAS_EXCEPTIONS # define GTEST_HAS_EXCEPTIONS _HAS_EXCEPTIONS # elif defined(__GNUC__) && __EXCEPTIONS // gcc defines __EXCEPTIONS to 1 iff exceptions are enabled. # define GTEST_HAS_EXCEPTIONS 1 # elif defined(__SUNPRO_CC) // Sun Pro CC supports exceptions. However, there is no compile-time way of // detecting whether they are enabled or not. Therefore, we assume that // they are enabled unless the user tells us otherwise. # define GTEST_HAS_EXCEPTIONS 1 # elif defined(__IBMCPP__) && __EXCEPTIONS // xlC defines __EXCEPTIONS to 1 iff exceptions are enabled. # define GTEST_HAS_EXCEPTIONS 1 # elif defined(__HP_aCC) // Exception handling is in effect by default in HP aCC compiler. It has to // be turned of by +noeh compiler option if desired. # define GTEST_HAS_EXCEPTIONS 1 # else // For other compilers, we assume exceptions are disabled to be // conservative. # define GTEST_HAS_EXCEPTIONS 0 # endif // defined(_MSC_VER) || defined(__BORLANDC__) #endif // GTEST_HAS_EXCEPTIONS #if !defined(GTEST_HAS_STD_STRING) // Even though we don't use this macro any longer, we keep it in case // some clients still depend on it. # define GTEST_HAS_STD_STRING 1 #elif !GTEST_HAS_STD_STRING // The user told us that ::std::string isn't available. # error "Google Test cannot be used where ::std::string isn't available." #endif // !defined(GTEST_HAS_STD_STRING) #ifndef GTEST_HAS_GLOBAL_STRING // The user didn't tell us whether ::string is available, so we need // to figure it out. # define GTEST_HAS_GLOBAL_STRING 0 #endif // GTEST_HAS_GLOBAL_STRING #ifndef GTEST_HAS_STD_WSTRING // The user didn't tell us whether ::std::wstring is available, so we need // to figure it out. // TODO(wan@google.com): uses autoconf to detect whether ::std::wstring // is available. // Cygwin 1.7 and below doesn't support ::std::wstring. // Solaris' libc++ doesn't support it either. Android has // no support for it at least as recent as Froyo (2.2). # define GTEST_HAS_STD_WSTRING \ (!(GTEST_OS_LINUX_ANDROID || GTEST_OS_CYGWIN || GTEST_OS_SOLARIS)) #endif // GTEST_HAS_STD_WSTRING #ifndef GTEST_HAS_GLOBAL_WSTRING // The user didn't tell us whether ::wstring is available, so we need // to figure it out. # define GTEST_HAS_GLOBAL_WSTRING \ (GTEST_HAS_STD_WSTRING && GTEST_HAS_GLOBAL_STRING) #endif // GTEST_HAS_GLOBAL_WSTRING // Determines whether RTTI is available. #ifndef GTEST_HAS_RTTI // The user didn't tell us whether RTTI is enabled, so we need to // figure it out. # ifdef _MSC_VER # ifdef _CPPRTTI // MSVC defines this macro iff RTTI is enabled. # define GTEST_HAS_RTTI 1 # else # define GTEST_HAS_RTTI 0 # endif // Starting with version 4.3.2, gcc defines __GXX_RTTI iff RTTI is enabled. # elif defined(__GNUC__) && (GTEST_GCC_VER_ >= 40302) # ifdef __GXX_RTTI # define GTEST_HAS_RTTI 1 # else # define GTEST_HAS_RTTI 0 # endif // __GXX_RTTI // Starting with version 9.0 IBM Visual Age defines __RTTI_ALL__ to 1 if // both the typeid and dynamic_cast features are present. # elif defined(__IBMCPP__) && (__IBMCPP__ >= 900) # ifdef __RTTI_ALL__ # define GTEST_HAS_RTTI 1 # else # define GTEST_HAS_RTTI 0 # endif # else // For all other compilers, we assume RTTI is enabled. # define GTEST_HAS_RTTI 1 # endif // _MSC_VER #endif // GTEST_HAS_RTTI // It's this header's responsibility to #include when RTTI // is enabled. #if GTEST_HAS_RTTI # include #endif // Determines whether Google Test can use the pthreads library. #ifndef GTEST_HAS_PTHREAD // The user didn't tell us explicitly, so we assume pthreads support is // available on Linux and Mac. // // To disable threading support in Google Test, add -DGTEST_HAS_PTHREAD=0 // to your compiler flags. # define GTEST_HAS_PTHREAD (GTEST_OS_LINUX || GTEST_OS_MAC || GTEST_OS_HPUX) #endif // GTEST_HAS_PTHREAD #if GTEST_HAS_PTHREAD // gtest-port.h guarantees to #include when GTEST_HAS_PTHREAD is // true. # include // NOLINT // For timespec and nanosleep, used below. # include // NOLINT #endif // Determines whether Google Test can use tr1/tuple. You can define // this macro to 0 to prevent Google Test from using tuple (any // feature depending on tuple with be disabled in this mode). #ifndef GTEST_HAS_TR1_TUPLE // The user didn't tell us not to do it, so we assume it's OK. # define GTEST_HAS_TR1_TUPLE 1 #endif // GTEST_HAS_TR1_TUPLE // Determines whether Google Test's own tr1 tuple implementation // should be used. #ifndef GTEST_USE_OWN_TR1_TUPLE // The user didn't tell us, so we need to figure it out. // We use our own TR1 tuple if we aren't sure the user has an // implementation of it already. At this time, GCC 4.0.0+ and MSVC // 2010 are the only mainstream compilers that come with a TR1 tuple // implementation. NVIDIA's CUDA NVCC compiler pretends to be GCC by // defining __GNUC__ and friends, but cannot compile GCC's tuple // implementation. MSVC 2008 (9.0) provides TR1 tuple in a 323 MB // Feature Pack download, which we cannot assume the user has. # if (defined(__GNUC__) && !defined(__CUDACC__) && (GTEST_GCC_VER_ >= 40000)) \ || _MSC_VER >= 1600 # define GTEST_USE_OWN_TR1_TUPLE 0 # else # define GTEST_USE_OWN_TR1_TUPLE 1 # endif #endif // GTEST_USE_OWN_TR1_TUPLE // To avoid conditional compilation everywhere, we make it // gtest-port.h's responsibility to #include the header implementing // tr1/tuple. #if GTEST_HAS_TR1_TUPLE # if GTEST_USE_OWN_TR1_TUPLE // This file was GENERATED by a script. DO NOT EDIT BY HAND!!! // Copyright 2009 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan) // Implements a subset of TR1 tuple needed by Google Test and Google Mock. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ #include // For ::std::pair. // The compiler used in Symbian has a bug that prevents us from declaring the // tuple template as a friend (it complains that tuple is redefined). This // hack bypasses the bug by declaring the members that should otherwise be // private as public. // Sun Studio versions < 12 also have the above bug. #if defined(__SYMBIAN32__) || (defined(__SUNPRO_CC) && __SUNPRO_CC < 0x590) # define GTEST_DECLARE_TUPLE_AS_FRIEND_ public: #else # define GTEST_DECLARE_TUPLE_AS_FRIEND_ \ template friend class tuple; \ private: #endif // GTEST_n_TUPLE_(T) is the type of an n-tuple. #define GTEST_0_TUPLE_(T) tuple<> #define GTEST_1_TUPLE_(T) tuple #define GTEST_2_TUPLE_(T) tuple #define GTEST_3_TUPLE_(T) tuple #define GTEST_4_TUPLE_(T) tuple #define GTEST_5_TUPLE_(T) tuple #define GTEST_6_TUPLE_(T) tuple #define GTEST_7_TUPLE_(T) tuple #define GTEST_8_TUPLE_(T) tuple #define GTEST_9_TUPLE_(T) tuple #define GTEST_10_TUPLE_(T) tuple // GTEST_n_TYPENAMES_(T) declares a list of n typenames. #define GTEST_0_TYPENAMES_(T) #define GTEST_1_TYPENAMES_(T) typename T##0 #define GTEST_2_TYPENAMES_(T) typename T##0, typename T##1 #define GTEST_3_TYPENAMES_(T) typename T##0, typename T##1, typename T##2 #define GTEST_4_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3 #define GTEST_5_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4 #define GTEST_6_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5 #define GTEST_7_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6 #define GTEST_8_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6, typename T##7 #define GTEST_9_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6, \ typename T##7, typename T##8 #define GTEST_10_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ typename T##3, typename T##4, typename T##5, typename T##6, \ typename T##7, typename T##8, typename T##9 // In theory, defining stuff in the ::std namespace is undefined // behavior. We can do this as we are playing the role of a standard // library vendor. namespace std { namespace tr1 { template class tuple; // Anything in namespace gtest_internal is Google Test's INTERNAL // IMPLEMENTATION DETAIL and MUST NOT BE USED DIRECTLY in user code. namespace gtest_internal { // ByRef::type is T if T is a reference; otherwise it's const T&. template struct ByRef { typedef const T& type; }; // NOLINT template struct ByRef { typedef T& type; }; // NOLINT // A handy wrapper for ByRef. #define GTEST_BY_REF_(T) typename ::std::tr1::gtest_internal::ByRef::type // AddRef::type is T if T is a reference; otherwise it's T&. This // is the same as tr1::add_reference::type. template struct AddRef { typedef T& type; }; // NOLINT template struct AddRef { typedef T& type; }; // NOLINT // A handy wrapper for AddRef. #define GTEST_ADD_REF_(T) typename ::std::tr1::gtest_internal::AddRef::type // A helper for implementing get(). template class Get; // A helper for implementing tuple_element. kIndexValid is true // iff k < the number of fields in tuple type T. template struct TupleElement; template struct TupleElement { typedef T0 type; }; template struct TupleElement { typedef T1 type; }; template struct TupleElement { typedef T2 type; }; template struct TupleElement { typedef T3 type; }; template struct TupleElement { typedef T4 type; }; template struct TupleElement { typedef T5 type; }; template struct TupleElement { typedef T6 type; }; template struct TupleElement { typedef T7 type; }; template struct TupleElement { typedef T8 type; }; template struct TupleElement { typedef T9 type; }; } // namespace gtest_internal template <> class tuple<> { public: tuple() {} tuple(const tuple& /* t */) {} tuple& operator=(const tuple& /* t */) { return *this; } }; template class GTEST_1_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_() {} explicit tuple(GTEST_BY_REF_(T0) f0) : f0_(f0) {} tuple(const tuple& t) : f0_(t.f0_) {} template tuple(const GTEST_1_TUPLE_(U)& t) : f0_(t.f0_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_1_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_1_TUPLE_(U)& t) { f0_ = t.f0_; return *this; } T0 f0_; }; template class GTEST_2_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1) : f0_(f0), f1_(f1) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_) {} template tuple(const GTEST_2_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_) {} template tuple(const ::std::pair& p) : f0_(p.first), f1_(p.second) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_2_TUPLE_(U)& t) { return CopyFrom(t); } template tuple& operator=(const ::std::pair& p) { f0_ = p.first; f1_ = p.second; return *this; } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_2_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; return *this; } T0 f0_; T1 f1_; }; template class GTEST_3_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2) : f0_(f0), f1_(f1), f2_(f2) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} template tuple(const GTEST_3_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_3_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_3_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; return *this; } T0 f0_; T1 f1_; T2 f2_; }; template class GTEST_4_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3) : f0_(f0), f1_(f1), f2_(f2), f3_(f3) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} template tuple(const GTEST_4_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_4_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_4_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; }; template class GTEST_5_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_) {} template tuple(const GTEST_5_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_5_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_5_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; }; template class GTEST_6_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_) {} template tuple(const GTEST_6_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_6_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_6_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; }; template class GTEST_7_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_) {} template tuple(const GTEST_7_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_7_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_7_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; }; template class GTEST_8_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6), f7_(f7) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_) {} template tuple(const GTEST_8_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_8_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_8_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; f7_ = t.f7_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; T7 f7_; }; template class GTEST_9_TUPLE_(T) { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7, GTEST_BY_REF_(T8) f8) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6), f7_(f7), f8_(f8) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_) {} template tuple(const GTEST_9_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_9_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_9_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; f7_ = t.f7_; f8_ = t.f8_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; T7 f7_; T8 f8_; }; template class tuple { public: template friend class gtest_internal::Get; tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_(), f9_() {} explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7, GTEST_BY_REF_(T8) f8, GTEST_BY_REF_(T9) f9) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), f5_(f5), f6_(f6), f7_(f7), f8_(f8), f9_(f9) {} tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_), f9_(t.f9_) {} template tuple(const GTEST_10_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_), f9_(t.f9_) {} tuple& operator=(const tuple& t) { return CopyFrom(t); } template tuple& operator=(const GTEST_10_TUPLE_(U)& t) { return CopyFrom(t); } GTEST_DECLARE_TUPLE_AS_FRIEND_ template tuple& CopyFrom(const GTEST_10_TUPLE_(U)& t) { f0_ = t.f0_; f1_ = t.f1_; f2_ = t.f2_; f3_ = t.f3_; f4_ = t.f4_; f5_ = t.f5_; f6_ = t.f6_; f7_ = t.f7_; f8_ = t.f8_; f9_ = t.f9_; return *this; } T0 f0_; T1 f1_; T2 f2_; T3 f3_; T4 f4_; T5 f5_; T6 f6_; T7 f7_; T8 f8_; T9 f9_; }; // 6.1.3.2 Tuple creation functions. // Known limitations: we don't support passing an // std::tr1::reference_wrapper to make_tuple(). And we don't // implement tie(). inline tuple<> make_tuple() { return tuple<>(); } template inline GTEST_1_TUPLE_(T) make_tuple(const T0& f0) { return GTEST_1_TUPLE_(T)(f0); } template inline GTEST_2_TUPLE_(T) make_tuple(const T0& f0, const T1& f1) { return GTEST_2_TUPLE_(T)(f0, f1); } template inline GTEST_3_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2) { return GTEST_3_TUPLE_(T)(f0, f1, f2); } template inline GTEST_4_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3) { return GTEST_4_TUPLE_(T)(f0, f1, f2, f3); } template inline GTEST_5_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4) { return GTEST_5_TUPLE_(T)(f0, f1, f2, f3, f4); } template inline GTEST_6_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5) { return GTEST_6_TUPLE_(T)(f0, f1, f2, f3, f4, f5); } template inline GTEST_7_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6) { return GTEST_7_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6); } template inline GTEST_8_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7) { return GTEST_8_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7); } template inline GTEST_9_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7, const T8& f8) { return GTEST_9_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7, f8); } template inline GTEST_10_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7, const T8& f8, const T9& f9) { return GTEST_10_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7, f8, f9); } // 6.1.3.3 Tuple helper classes. template struct tuple_size; template struct tuple_size { static const int value = 0; }; template struct tuple_size { static const int value = 1; }; template struct tuple_size { static const int value = 2; }; template struct tuple_size { static const int value = 3; }; template struct tuple_size { static const int value = 4; }; template struct tuple_size { static const int value = 5; }; template struct tuple_size { static const int value = 6; }; template struct tuple_size { static const int value = 7; }; template struct tuple_size { static const int value = 8; }; template struct tuple_size { static const int value = 9; }; template struct tuple_size { static const int value = 10; }; template struct tuple_element { typedef typename gtest_internal::TupleElement< k < (tuple_size::value), k, Tuple>::type type; }; #define GTEST_TUPLE_ELEMENT_(k, Tuple) typename tuple_element::type // 6.1.3.4 Element access. namespace gtest_internal { template <> class Get<0> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(0, Tuple)) Field(Tuple& t) { return t.f0_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(0, Tuple)) ConstField(const Tuple& t) { return t.f0_; } }; template <> class Get<1> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(1, Tuple)) Field(Tuple& t) { return t.f1_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(1, Tuple)) ConstField(const Tuple& t) { return t.f1_; } }; template <> class Get<2> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(2, Tuple)) Field(Tuple& t) { return t.f2_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(2, Tuple)) ConstField(const Tuple& t) { return t.f2_; } }; template <> class Get<3> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(3, Tuple)) Field(Tuple& t) { return t.f3_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(3, Tuple)) ConstField(const Tuple& t) { return t.f3_; } }; template <> class Get<4> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(4, Tuple)) Field(Tuple& t) { return t.f4_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(4, Tuple)) ConstField(const Tuple& t) { return t.f4_; } }; template <> class Get<5> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(5, Tuple)) Field(Tuple& t) { return t.f5_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(5, Tuple)) ConstField(const Tuple& t) { return t.f5_; } }; template <> class Get<6> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(6, Tuple)) Field(Tuple& t) { return t.f6_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(6, Tuple)) ConstField(const Tuple& t) { return t.f6_; } }; template <> class Get<7> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(7, Tuple)) Field(Tuple& t) { return t.f7_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(7, Tuple)) ConstField(const Tuple& t) { return t.f7_; } }; template <> class Get<8> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(8, Tuple)) Field(Tuple& t) { return t.f8_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(8, Tuple)) ConstField(const Tuple& t) { return t.f8_; } }; template <> class Get<9> { public: template static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(9, Tuple)) Field(Tuple& t) { return t.f9_; } // NOLINT template static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(9, Tuple)) ConstField(const Tuple& t) { return t.f9_; } }; } // namespace gtest_internal template GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_10_TUPLE_(T))) get(GTEST_10_TUPLE_(T)& t) { return gtest_internal::Get::Field(t); } template GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_10_TUPLE_(T))) get(const GTEST_10_TUPLE_(T)& t) { return gtest_internal::Get::ConstField(t); } // 6.1.3.5 Relational operators // We only implement == and !=, as we don't have a need for the rest yet. namespace gtest_internal { // SameSizeTuplePrefixComparator::Eq(t1, t2) returns true if the // first k fields of t1 equals the first k fields of t2. // SameSizeTuplePrefixComparator(k1, k2) would be a compiler error if // k1 != k2. template struct SameSizeTuplePrefixComparator; template <> struct SameSizeTuplePrefixComparator<0, 0> { template static bool Eq(const Tuple1& /* t1 */, const Tuple2& /* t2 */) { return true; } }; template struct SameSizeTuplePrefixComparator { template static bool Eq(const Tuple1& t1, const Tuple2& t2) { return SameSizeTuplePrefixComparator::Eq(t1, t2) && ::std::tr1::get(t1) == ::std::tr1::get(t2); } }; } // namespace gtest_internal template inline bool operator==(const GTEST_10_TUPLE_(T)& t, const GTEST_10_TUPLE_(U)& u) { return gtest_internal::SameSizeTuplePrefixComparator< tuple_size::value, tuple_size::value>::Eq(t, u); } template inline bool operator!=(const GTEST_10_TUPLE_(T)& t, const GTEST_10_TUPLE_(U)& u) { return !(t == u); } // 6.1.4 Pairs. // Unimplemented. } // namespace tr1 } // namespace std #undef GTEST_0_TUPLE_ #undef GTEST_1_TUPLE_ #undef GTEST_2_TUPLE_ #undef GTEST_3_TUPLE_ #undef GTEST_4_TUPLE_ #undef GTEST_5_TUPLE_ #undef GTEST_6_TUPLE_ #undef GTEST_7_TUPLE_ #undef GTEST_8_TUPLE_ #undef GTEST_9_TUPLE_ #undef GTEST_10_TUPLE_ #undef GTEST_0_TYPENAMES_ #undef GTEST_1_TYPENAMES_ #undef GTEST_2_TYPENAMES_ #undef GTEST_3_TYPENAMES_ #undef GTEST_4_TYPENAMES_ #undef GTEST_5_TYPENAMES_ #undef GTEST_6_TYPENAMES_ #undef GTEST_7_TYPENAMES_ #undef GTEST_8_TYPENAMES_ #undef GTEST_9_TYPENAMES_ #undef GTEST_10_TYPENAMES_ #undef GTEST_DECLARE_TUPLE_AS_FRIEND_ #undef GTEST_BY_REF_ #undef GTEST_ADD_REF_ #undef GTEST_TUPLE_ELEMENT_ #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ # elif GTEST_OS_SYMBIAN // On Symbian, BOOST_HAS_TR1_TUPLE causes Boost's TR1 tuple library to // use STLport's tuple implementation, which unfortunately doesn't // work as the copy of STLport distributed with Symbian is incomplete. // By making sure BOOST_HAS_TR1_TUPLE is undefined, we force Boost to // use its own tuple implementation. # ifdef BOOST_HAS_TR1_TUPLE # undef BOOST_HAS_TR1_TUPLE # endif // BOOST_HAS_TR1_TUPLE // This prevents , which defines // BOOST_HAS_TR1_TUPLE, from being #included by Boost's . # define BOOST_TR1_DETAIL_CONFIG_HPP_INCLUDED # include # elif defined(__GNUC__) && (GTEST_GCC_VER_ >= 40000) // GCC 4.0+ implements tr1/tuple in the header. This does // not conform to the TR1 spec, which requires the header to be . # if !GTEST_HAS_RTTI && GTEST_GCC_VER_ < 40302 // Until version 4.3.2, gcc has a bug that causes , // which is #included by , to not compile when RTTI is // disabled. _TR1_FUNCTIONAL is the header guard for // . Hence the following #define is a hack to prevent // from being included. # define _TR1_FUNCTIONAL 1 # include # undef _TR1_FUNCTIONAL // Allows the user to #include // if he chooses to. # else # include // NOLINT # endif // !GTEST_HAS_RTTI && GTEST_GCC_VER_ < 40302 # else // If the compiler is not GCC 4.0+, we assume the user is using a // spec-conforming TR1 implementation. # include // NOLINT # endif // GTEST_USE_OWN_TR1_TUPLE #endif // GTEST_HAS_TR1_TUPLE // Determines whether clone(2) is supported. // Usually it will only be available on Linux, excluding // Linux on the Itanium architecture. // Also see http://linux.die.net/man/2/clone. #ifndef GTEST_HAS_CLONE // The user didn't tell us, so we need to figure it out. # if GTEST_OS_LINUX && !defined(__ia64__) # define GTEST_HAS_CLONE 1 # else # define GTEST_HAS_CLONE 0 # endif // GTEST_OS_LINUX && !defined(__ia64__) #endif // GTEST_HAS_CLONE // Determines whether to support stream redirection. This is used to test // output correctness and to implement death tests. #ifndef GTEST_HAS_STREAM_REDIRECTION // By default, we assume that stream redirection is supported on all // platforms except known mobile ones. # if GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN # define GTEST_HAS_STREAM_REDIRECTION 0 # else # define GTEST_HAS_STREAM_REDIRECTION 1 # endif // !GTEST_OS_WINDOWS_MOBILE && !GTEST_OS_SYMBIAN #endif // GTEST_HAS_STREAM_REDIRECTION // Determines whether to support death tests. // Google Test does not support death tests for VC 7.1 and earlier as // abort() in a VC 7.1 application compiled as GUI in debug config // pops up a dialog window that cannot be suppressed programmatically. #if (GTEST_OS_LINUX || GTEST_OS_MAC || GTEST_OS_CYGWIN || GTEST_OS_SOLARIS || \ (GTEST_OS_WINDOWS_DESKTOP && _MSC_VER >= 1400) || \ GTEST_OS_WINDOWS_MINGW || GTEST_OS_AIX || GTEST_OS_HPUX) # define GTEST_HAS_DEATH_TEST 1 # include // NOLINT #endif // We don't support MSVC 7.1 with exceptions disabled now. Therefore // all the compilers we care about are adequate for supporting // value-parameterized tests. #define GTEST_HAS_PARAM_TEST 1 // Determines whether to support type-driven tests. // Typed tests need and variadic macros, which GCC, VC++ 8.0, // Sun Pro CC, IBM Visual Age, and HP aCC support. #if defined(__GNUC__) || (_MSC_VER >= 1400) || defined(__SUNPRO_CC) || \ defined(__IBMCPP__) || defined(__HP_aCC) # define GTEST_HAS_TYPED_TEST 1 # define GTEST_HAS_TYPED_TEST_P 1 #endif // Determines whether to support Combine(). This only makes sense when // value-parameterized tests are enabled. The implementation doesn't // work on Sun Studio since it doesn't understand templated conversion // operators. #if GTEST_HAS_PARAM_TEST && GTEST_HAS_TR1_TUPLE && !defined(__SUNPRO_CC) # define GTEST_HAS_COMBINE 1 #endif // Determines whether the system compiler uses UTF-16 for encoding wide strings. #define GTEST_WIDE_STRING_USES_UTF16_ \ (GTEST_OS_WINDOWS || GTEST_OS_CYGWIN || GTEST_OS_SYMBIAN || GTEST_OS_AIX) // Determines whether test results can be streamed to a socket. #if GTEST_OS_LINUX # define GTEST_CAN_STREAM_RESULTS_ 1 #endif // Defines some utility macros. // The GNU compiler emits a warning if nested "if" statements are followed by // an "else" statement and braces are not used to explicitly disambiguate the // "else" binding. This leads to problems with code like: // // if (gate) // ASSERT_*(condition) << "Some message"; // // The "switch (0) case 0:" idiom is used to suppress this. #ifdef __INTEL_COMPILER # define GTEST_AMBIGUOUS_ELSE_BLOCKER_ #else # define GTEST_AMBIGUOUS_ELSE_BLOCKER_ switch (0) case 0: default: // NOLINT #endif // Use this annotation at the end of a struct/class definition to // prevent the compiler from optimizing away instances that are never // used. This is useful when all interesting logic happens inside the // c'tor and / or d'tor. Example: // // struct Foo { // Foo() { ... } // } GTEST_ATTRIBUTE_UNUSED_; // // Also use it after a variable or parameter declaration to tell the // compiler the variable/parameter does not have to be used. #if defined(__GNUC__) && !defined(COMPILER_ICC) # define GTEST_ATTRIBUTE_UNUSED_ __attribute__ ((unused)) #else # define GTEST_ATTRIBUTE_UNUSED_ #endif // A macro to disallow operator= // This should be used in the private: declarations for a class. #define GTEST_DISALLOW_ASSIGN_(type)\ void operator=(type const &) // A macro to disallow copy constructor and operator= // This should be used in the private: declarations for a class. #define GTEST_DISALLOW_COPY_AND_ASSIGN_(type)\ type(type const &);\ GTEST_DISALLOW_ASSIGN_(type) // Tell the compiler to warn about unused return values for functions declared // with this macro. The macro should be used on function declarations // following the argument list: // // Sprocket* AllocateSprocket() GTEST_MUST_USE_RESULT_; #if defined(__GNUC__) && (GTEST_GCC_VER_ >= 30400) && !defined(COMPILER_ICC) # define GTEST_MUST_USE_RESULT_ __attribute__ ((warn_unused_result)) #else # define GTEST_MUST_USE_RESULT_ #endif // __GNUC__ && (GTEST_GCC_VER_ >= 30400) && !COMPILER_ICC // Determine whether the compiler supports Microsoft's Structured Exception // Handling. This is supported by several Windows compilers but generally // does not exist on any other system. #ifndef GTEST_HAS_SEH // The user didn't tell us, so we need to figure it out. # if defined(_MSC_VER) || defined(__BORLANDC__) // These two compilers are known to support SEH. # define GTEST_HAS_SEH 1 # else // Assume no SEH. # define GTEST_HAS_SEH 0 # endif #endif // GTEST_HAS_SEH #ifdef _MSC_VER # if GTEST_LINKED_AS_SHARED_LIBRARY # define GTEST_API_ __declspec(dllimport) # elif GTEST_CREATE_SHARED_LIBRARY # define GTEST_API_ __declspec(dllexport) # endif #endif // _MSC_VER #ifndef GTEST_API_ # define GTEST_API_ #endif #ifdef __GNUC__ // Ask the compiler to never inline a given function. # define GTEST_NO_INLINE_ __attribute__((noinline)) #else # define GTEST_NO_INLINE_ #endif namespace testing { class Message; namespace internal { class String; // The GTEST_COMPILE_ASSERT_ macro can be used to verify that a compile time // expression is true. For example, you could use it to verify the // size of a static array: // // GTEST_COMPILE_ASSERT_(ARRAYSIZE(content_type_names) == CONTENT_NUM_TYPES, // content_type_names_incorrect_size); // // or to make sure a struct is smaller than a certain size: // // GTEST_COMPILE_ASSERT_(sizeof(foo) < 128, foo_too_large); // // The second argument to the macro is the name of the variable. If // the expression is false, most compilers will issue a warning/error // containing the name of the variable. template struct CompileAssert { }; #define GTEST_COMPILE_ASSERT_(expr, msg) \ typedef ::testing::internal::CompileAssert<(bool(expr))> \ msg[bool(expr) ? 1 : -1] // Implementation details of GTEST_COMPILE_ASSERT_: // // - GTEST_COMPILE_ASSERT_ works by defining an array type that has -1 // elements (and thus is invalid) when the expression is false. // // - The simpler definition // // #define GTEST_COMPILE_ASSERT_(expr, msg) typedef char msg[(expr) ? 1 : -1] // // does not work, as gcc supports variable-length arrays whose sizes // are determined at run-time (this is gcc's extension and not part // of the C++ standard). As a result, gcc fails to reject the // following code with the simple definition: // // int foo; // GTEST_COMPILE_ASSERT_(foo, msg); // not supposed to compile as foo is // // not a compile-time constant. // // - By using the type CompileAssert<(bool(expr))>, we ensures that // expr is a compile-time constant. (Template arguments must be // determined at compile-time.) // // - The outter parentheses in CompileAssert<(bool(expr))> are necessary // to work around a bug in gcc 3.4.4 and 4.0.1. If we had written // // CompileAssert // // instead, these compilers will refuse to compile // // GTEST_COMPILE_ASSERT_(5 > 0, some_message); // // (They seem to think the ">" in "5 > 0" marks the end of the // template argument list.) // // - The array size is (bool(expr) ? 1 : -1), instead of simply // // ((expr) ? 1 : -1). // // This is to avoid running into a bug in MS VC 7.1, which // causes ((0.0) ? 1 : -1) to incorrectly evaluate to 1. // StaticAssertTypeEqHelper is used by StaticAssertTypeEq defined in gtest.h. // // This template is declared, but intentionally undefined. template struct StaticAssertTypeEqHelper; template struct StaticAssertTypeEqHelper {}; #if GTEST_HAS_GLOBAL_STRING typedef ::string string; #else typedef ::std::string string; #endif // GTEST_HAS_GLOBAL_STRING #if GTEST_HAS_GLOBAL_WSTRING typedef ::wstring wstring; #elif GTEST_HAS_STD_WSTRING typedef ::std::wstring wstring; #endif // GTEST_HAS_GLOBAL_WSTRING // A helper for suppressing warnings on constant condition. It just // returns 'condition'. GTEST_API_ bool IsTrue(bool condition); // Defines scoped_ptr. // This implementation of scoped_ptr is PARTIAL - it only contains // enough stuff to satisfy Google Test's need. template class scoped_ptr { public: typedef T element_type; explicit scoped_ptr(T* p = NULL) : ptr_(p) {} ~scoped_ptr() { reset(); } T& operator*() const { return *ptr_; } T* operator->() const { return ptr_; } T* get() const { return ptr_; } T* release() { T* const ptr = ptr_; ptr_ = NULL; return ptr; } void reset(T* p = NULL) { if (p != ptr_) { if (IsTrue(sizeof(T) > 0)) { // Makes sure T is a complete type. delete ptr_; } ptr_ = p; } } private: T* ptr_; GTEST_DISALLOW_COPY_AND_ASSIGN_(scoped_ptr); }; // Defines RE. // A simple C++ wrapper for . It uses the POSIX Extended // Regular Expression syntax. class GTEST_API_ RE { public: // A copy constructor is required by the Standard to initialize object // references from r-values. RE(const RE& other) { Init(other.pattern()); } // Constructs an RE from a string. RE(const ::std::string& regex) { Init(regex.c_str()); } // NOLINT #if GTEST_HAS_GLOBAL_STRING RE(const ::string& regex) { Init(regex.c_str()); } // NOLINT #endif // GTEST_HAS_GLOBAL_STRING RE(const char* regex) { Init(regex); } // NOLINT ~RE(); // Returns the string representation of the regex. const char* pattern() const { return pattern_; } // FullMatch(str, re) returns true iff regular expression re matches // the entire str. // PartialMatch(str, re) returns true iff regular expression re // matches a substring of str (including str itself). // // TODO(wan@google.com): make FullMatch() and PartialMatch() work // when str contains NUL characters. static bool FullMatch(const ::std::string& str, const RE& re) { return FullMatch(str.c_str(), re); } static bool PartialMatch(const ::std::string& str, const RE& re) { return PartialMatch(str.c_str(), re); } #if GTEST_HAS_GLOBAL_STRING static bool FullMatch(const ::string& str, const RE& re) { return FullMatch(str.c_str(), re); } static bool PartialMatch(const ::string& str, const RE& re) { return PartialMatch(str.c_str(), re); } #endif // GTEST_HAS_GLOBAL_STRING static bool FullMatch(const char* str, const RE& re); static bool PartialMatch(const char* str, const RE& re); private: void Init(const char* regex); // We use a const char* instead of a string, as Google Test may be used // where string is not available. We also do not use Google Test's own // String type here, in order to simplify dependencies between the // files. const char* pattern_; bool is_valid_; #if GTEST_USES_POSIX_RE regex_t full_regex_; // For FullMatch(). regex_t partial_regex_; // For PartialMatch(). #else // GTEST_USES_SIMPLE_RE const char* full_pattern_; // For FullMatch(); #endif GTEST_DISALLOW_ASSIGN_(RE); }; // Formats a source file path and a line number as they would appear // in an error message from the compiler used to compile this code. GTEST_API_ ::std::string FormatFileLocation(const char* file, int line); // Formats a file location for compiler-independent XML output. // Although this function is not platform dependent, we put it next to // FormatFileLocation in order to contrast the two functions. GTEST_API_ ::std::string FormatCompilerIndependentFileLocation(const char* file, int line); // Defines logging utilities: // GTEST_LOG_(severity) - logs messages at the specified severity level. The // message itself is streamed into the macro. // LogToStderr() - directs all log messages to stderr. // FlushInfoLog() - flushes informational log messages. enum GTestLogSeverity { GTEST_INFO, GTEST_WARNING, GTEST_ERROR, GTEST_FATAL }; // Formats log entry severity, provides a stream object for streaming the // log message, and terminates the message with a newline when going out of // scope. class GTEST_API_ GTestLog { public: GTestLog(GTestLogSeverity severity, const char* file, int line); // Flushes the buffers and, if severity is GTEST_FATAL, aborts the program. ~GTestLog(); ::std::ostream& GetStream() { return ::std::cerr; } private: const GTestLogSeverity severity_; GTEST_DISALLOW_COPY_AND_ASSIGN_(GTestLog); }; #define GTEST_LOG_(severity) \ ::testing::internal::GTestLog(::testing::internal::GTEST_##severity, \ __FILE__, __LINE__).GetStream() inline void LogToStderr() {} inline void FlushInfoLog() { fflush(NULL); } // INTERNAL IMPLEMENTATION - DO NOT USE. // // GTEST_CHECK_ is an all-mode assert. It aborts the program if the condition // is not satisfied. // Synopsys: // GTEST_CHECK_(boolean_condition); // or // GTEST_CHECK_(boolean_condition) << "Additional message"; // // This checks the condition and if the condition is not satisfied // it prints message about the condition violation, including the // condition itself, plus additional message streamed into it, if any, // and then it aborts the program. It aborts the program irrespective of // whether it is built in the debug mode or not. #define GTEST_CHECK_(condition) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::IsTrue(condition)) \ ; \ else \ GTEST_LOG_(FATAL) << "Condition " #condition " failed. " // An all-mode assert to verify that the given POSIX-style function // call returns 0 (indicating success). Known limitation: this // doesn't expand to a balanced 'if' statement, so enclose the macro // in {} if you need to use it as the only statement in an 'if' // branch. #define GTEST_CHECK_POSIX_SUCCESS_(posix_call) \ if (const int gtest_error = (posix_call)) \ GTEST_LOG_(FATAL) << #posix_call << "failed with error " \ << gtest_error // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Use ImplicitCast_ as a safe version of static_cast for upcasting in // the type hierarchy (e.g. casting a Foo* to a SuperclassOfFoo* or a // const Foo*). When you use ImplicitCast_, the compiler checks that // the cast is safe. Such explicit ImplicitCast_s are necessary in // surprisingly many situations where C++ demands an exact type match // instead of an argument type convertable to a target type. // // The syntax for using ImplicitCast_ is the same as for static_cast: // // ImplicitCast_(expr) // // ImplicitCast_ would have been part of the C++ standard library, // but the proposal was submitted too late. It will probably make // its way into the language in the future. // // This relatively ugly name is intentional. It prevents clashes with // similar functions users may have (e.g., implicit_cast). The internal // namespace alone is not enough because the function can be found by ADL. template inline To ImplicitCast_(To x) { return x; } // When you upcast (that is, cast a pointer from type Foo to type // SuperclassOfFoo), it's fine to use ImplicitCast_<>, since upcasts // always succeed. When you downcast (that is, cast a pointer from // type Foo to type SubclassOfFoo), static_cast<> isn't safe, because // how do you know the pointer is really of type SubclassOfFoo? It // could be a bare Foo, or of type DifferentSubclassOfFoo. Thus, // when you downcast, you should use this macro. In debug mode, we // use dynamic_cast<> to double-check the downcast is legal (we die // if it's not). In normal mode, we do the efficient static_cast<> // instead. Thus, it's important to test in debug mode to make sure // the cast is legal! // This is the only place in the code we should use dynamic_cast<>. // In particular, you SHOULDN'T be using dynamic_cast<> in order to // do RTTI (eg code like this: // if (dynamic_cast(foo)) HandleASubclass1Object(foo); // if (dynamic_cast(foo)) HandleASubclass2Object(foo); // You should design the code some other way not to need this. // // This relatively ugly name is intentional. It prevents clashes with // similar functions users may have (e.g., down_cast). The internal // namespace alone is not enough because the function can be found by ADL. template // use like this: DownCast_(foo); inline To DownCast_(From* f) { // so we only accept pointers // Ensures that To is a sub-type of From *. This test is here only // for compile-time type checking, and has no overhead in an // optimized build at run-time, as it will be optimized away // completely. if (false) { const To to = NULL; ::testing::internal::ImplicitCast_(to); } #if GTEST_HAS_RTTI // RTTI: debug mode only! GTEST_CHECK_(f == NULL || dynamic_cast(f) != NULL); #endif return static_cast(f); } // Downcasts the pointer of type Base to Derived. // Derived must be a subclass of Base. The parameter MUST // point to a class of type Derived, not any subclass of it. // When RTTI is available, the function performs a runtime // check to enforce this. template Derived* CheckedDowncastToActualType(Base* base) { #if GTEST_HAS_RTTI GTEST_CHECK_(typeid(*base) == typeid(Derived)); return dynamic_cast(base); // NOLINT #else return static_cast(base); // Poor man's downcast. #endif } #if GTEST_HAS_STREAM_REDIRECTION // Defines the stderr capturer: // CaptureStdout - starts capturing stdout. // GetCapturedStdout - stops capturing stdout and returns the captured string. // CaptureStderr - starts capturing stderr. // GetCapturedStderr - stops capturing stderr and returns the captured string. // GTEST_API_ void CaptureStdout(); GTEST_API_ String GetCapturedStdout(); GTEST_API_ void CaptureStderr(); GTEST_API_ String GetCapturedStderr(); #endif // GTEST_HAS_STREAM_REDIRECTION #if GTEST_HAS_DEATH_TEST // A copy of all command line arguments. Set by InitGoogleTest(). extern ::std::vector g_argvs; // GTEST_HAS_DEATH_TEST implies we have ::std::string. const ::std::vector& GetArgvs(); #endif // GTEST_HAS_DEATH_TEST // Defines synchronization primitives. #if GTEST_HAS_PTHREAD // Sleeps for (roughly) n milli-seconds. This function is only for // testing Google Test's own constructs. Don't use it in user tests, // either directly or indirectly. inline void SleepMilliseconds(int n) { const timespec time = { 0, // 0 seconds. n * 1000L * 1000L, // And n ms. }; nanosleep(&time, NULL); } // Allows a controller thread to pause execution of newly created // threads until notified. Instances of this class must be created // and destroyed in the controller thread. // // This class is only for testing Google Test's own constructs. Do not // use it in user tests, either directly or indirectly. class Notification { public: Notification() : notified_(false) {} // Notifies all threads created with this notification to start. Must // be called from the controller thread. void Notify() { notified_ = true; } // Blocks until the controller thread notifies. Must be called from a test // thread. void WaitForNotification() { while(!notified_) { SleepMilliseconds(10); } } private: volatile bool notified_; GTEST_DISALLOW_COPY_AND_ASSIGN_(Notification); }; // As a C-function, ThreadFuncWithCLinkage cannot be templated itself. // Consequently, it cannot select a correct instantiation of ThreadWithParam // in order to call its Run(). Introducing ThreadWithParamBase as a // non-templated base class for ThreadWithParam allows us to bypass this // problem. class ThreadWithParamBase { public: virtual ~ThreadWithParamBase() {} virtual void Run() = 0; }; // pthread_create() accepts a pointer to a function type with the C linkage. // According to the Standard (7.5/1), function types with different linkages // are different even if they are otherwise identical. Some compilers (for // example, SunStudio) treat them as different types. Since class methods // cannot be defined with C-linkage we need to define a free C-function to // pass into pthread_create(). extern "C" inline void* ThreadFuncWithCLinkage(void* thread) { static_cast(thread)->Run(); return NULL; } // Helper class for testing Google Test's multi-threading constructs. // To use it, write: // // void ThreadFunc(int param) { /* Do things with param */ } // Notification thread_can_start; // ... // // The thread_can_start parameter is optional; you can supply NULL. // ThreadWithParam thread(&ThreadFunc, 5, &thread_can_start); // thread_can_start.Notify(); // // These classes are only for testing Google Test's own constructs. Do // not use them in user tests, either directly or indirectly. template class ThreadWithParam : public ThreadWithParamBase { public: typedef void (*UserThreadFunc)(T); ThreadWithParam( UserThreadFunc func, T param, Notification* thread_can_start) : func_(func), param_(param), thread_can_start_(thread_can_start), finished_(false) { ThreadWithParamBase* const base = this; // The thread can be created only after all fields except thread_ // have been initialized. GTEST_CHECK_POSIX_SUCCESS_( pthread_create(&thread_, 0, &ThreadFuncWithCLinkage, base)); } ~ThreadWithParam() { Join(); } void Join() { if (!finished_) { GTEST_CHECK_POSIX_SUCCESS_(pthread_join(thread_, 0)); finished_ = true; } } virtual void Run() { if (thread_can_start_ != NULL) thread_can_start_->WaitForNotification(); func_(param_); } private: const UserThreadFunc func_; // User-supplied thread function. const T param_; // User-supplied parameter to the thread function. // When non-NULL, used to block execution until the controller thread // notifies. Notification* const thread_can_start_; bool finished_; // true iff we know that the thread function has finished. pthread_t thread_; // The native thread object. GTEST_DISALLOW_COPY_AND_ASSIGN_(ThreadWithParam); }; // MutexBase and Mutex implement mutex on pthreads-based platforms. They // are used in conjunction with class MutexLock: // // Mutex mutex; // ... // MutexLock lock(&mutex); // Acquires the mutex and releases it at the end // // of the current scope. // // MutexBase implements behavior for both statically and dynamically // allocated mutexes. Do not use MutexBase directly. Instead, write // the following to define a static mutex: // // GTEST_DEFINE_STATIC_MUTEX_(g_some_mutex); // // You can forward declare a static mutex like this: // // GTEST_DECLARE_STATIC_MUTEX_(g_some_mutex); // // To create a dynamic mutex, just define an object of type Mutex. class MutexBase { public: // Acquires this mutex. void Lock() { GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_lock(&mutex_)); owner_ = pthread_self(); } // Releases this mutex. void Unlock() { // We don't protect writing to owner_ here, as it's the caller's // responsibility to ensure that the current thread holds the // mutex when this is called. owner_ = 0; GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_unlock(&mutex_)); } // Does nothing if the current thread holds the mutex. Otherwise, crashes // with high probability. void AssertHeld() const { GTEST_CHECK_(owner_ == pthread_self()) << "The current thread is not holding the mutex @" << this; } // A static mutex may be used before main() is entered. It may even // be used before the dynamic initialization stage. Therefore we // must be able to initialize a static mutex object at link time. // This means MutexBase has to be a POD and its member variables // have to be public. public: pthread_mutex_t mutex_; // The underlying pthread mutex. pthread_t owner_; // The thread holding the mutex; 0 means no one holds it. }; // Forward-declares a static mutex. # define GTEST_DECLARE_STATIC_MUTEX_(mutex) \ extern ::testing::internal::MutexBase mutex // Defines and statically (i.e. at link time) initializes a static mutex. # define GTEST_DEFINE_STATIC_MUTEX_(mutex) \ ::testing::internal::MutexBase mutex = { PTHREAD_MUTEX_INITIALIZER, 0 } // The Mutex class can only be used for mutexes created at runtime. It // shares its API with MutexBase otherwise. class Mutex : public MutexBase { public: Mutex() { GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_init(&mutex_, NULL)); owner_ = 0; } ~Mutex() { GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_destroy(&mutex_)); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(Mutex); }; // We cannot name this class MutexLock as the ctor declaration would // conflict with a macro named MutexLock, which is defined on some // platforms. Hence the typedef trick below. class GTestMutexLock { public: explicit GTestMutexLock(MutexBase* mutex) : mutex_(mutex) { mutex_->Lock(); } ~GTestMutexLock() { mutex_->Unlock(); } private: MutexBase* const mutex_; GTEST_DISALLOW_COPY_AND_ASSIGN_(GTestMutexLock); }; typedef GTestMutexLock MutexLock; // Helpers for ThreadLocal. // pthread_key_create() requires DeleteThreadLocalValue() to have // C-linkage. Therefore it cannot be templatized to access // ThreadLocal. Hence the need for class // ThreadLocalValueHolderBase. class ThreadLocalValueHolderBase { public: virtual ~ThreadLocalValueHolderBase() {} }; // Called by pthread to delete thread-local data stored by // pthread_setspecific(). extern "C" inline void DeleteThreadLocalValue(void* value_holder) { delete static_cast(value_holder); } // Implements thread-local storage on pthreads-based systems. // // // Thread 1 // ThreadLocal tl(100); // 100 is the default value for each thread. // // // Thread 2 // tl.set(150); // Changes the value for thread 2 only. // EXPECT_EQ(150, tl.get()); // // // Thread 1 // EXPECT_EQ(100, tl.get()); // In thread 1, tl has the original value. // tl.set(200); // EXPECT_EQ(200, tl.get()); // // The template type argument T must have a public copy constructor. // In addition, the default ThreadLocal constructor requires T to have // a public default constructor. // // An object managed for a thread by a ThreadLocal instance is deleted // when the thread exits. Or, if the ThreadLocal instance dies in // that thread, when the ThreadLocal dies. It's the user's // responsibility to ensure that all other threads using a ThreadLocal // have exited when it dies, or the per-thread objects for those // threads will not be deleted. // // Google Test only uses global ThreadLocal objects. That means they // will die after main() has returned. Therefore, no per-thread // object managed by Google Test will be leaked as long as all threads // using Google Test have exited when main() returns. template class ThreadLocal { public: ThreadLocal() : key_(CreateKey()), default_() {} explicit ThreadLocal(const T& value) : key_(CreateKey()), default_(value) {} ~ThreadLocal() { // Destroys the managed object for the current thread, if any. DeleteThreadLocalValue(pthread_getspecific(key_)); // Releases resources associated with the key. This will *not* // delete managed objects for other threads. GTEST_CHECK_POSIX_SUCCESS_(pthread_key_delete(key_)); } T* pointer() { return GetOrCreateValue(); } const T* pointer() const { return GetOrCreateValue(); } const T& get() const { return *pointer(); } void set(const T& value) { *pointer() = value; } private: // Holds a value of type T. class ValueHolder : public ThreadLocalValueHolderBase { public: explicit ValueHolder(const T& value) : value_(value) {} T* pointer() { return &value_; } private: T value_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ValueHolder); }; static pthread_key_t CreateKey() { pthread_key_t key; // When a thread exits, DeleteThreadLocalValue() will be called on // the object managed for that thread. GTEST_CHECK_POSIX_SUCCESS_( pthread_key_create(&key, &DeleteThreadLocalValue)); return key; } T* GetOrCreateValue() const { ThreadLocalValueHolderBase* const holder = static_cast(pthread_getspecific(key_)); if (holder != NULL) { return CheckedDowncastToActualType(holder)->pointer(); } ValueHolder* const new_holder = new ValueHolder(default_); ThreadLocalValueHolderBase* const holder_base = new_holder; GTEST_CHECK_POSIX_SUCCESS_(pthread_setspecific(key_, holder_base)); return new_holder->pointer(); } // A key pthreads uses for looking up per-thread values. const pthread_key_t key_; const T default_; // The default value for each thread. GTEST_DISALLOW_COPY_AND_ASSIGN_(ThreadLocal); }; # define GTEST_IS_THREADSAFE 1 #else // GTEST_HAS_PTHREAD // A dummy implementation of synchronization primitives (mutex, lock, // and thread-local variable). Necessary for compiling Google Test where // mutex is not supported - using Google Test in multiple threads is not // supported on such platforms. class Mutex { public: Mutex() {} void AssertHeld() const {} }; # define GTEST_DECLARE_STATIC_MUTEX_(mutex) \ extern ::testing::internal::Mutex mutex # define GTEST_DEFINE_STATIC_MUTEX_(mutex) ::testing::internal::Mutex mutex class GTestMutexLock { public: explicit GTestMutexLock(Mutex*) {} // NOLINT }; typedef GTestMutexLock MutexLock; template class ThreadLocal { public: ThreadLocal() : value_() {} explicit ThreadLocal(const T& value) : value_(value) {} T* pointer() { return &value_; } const T* pointer() const { return &value_; } const T& get() const { return value_; } void set(const T& value) { value_ = value; } private: T value_; }; // The above synchronization primitives have dummy implementations. // Therefore Google Test is not thread-safe. # define GTEST_IS_THREADSAFE 0 #endif // GTEST_HAS_PTHREAD // Returns the number of threads running in the process, or 0 to indicate that // we cannot detect it. GTEST_API_ size_t GetThreadCount(); // Passing non-POD classes through ellipsis (...) crashes the ARM // compiler and generates a warning in Sun Studio. The Nokia Symbian // and the IBM XL C/C++ compiler try to instantiate a copy constructor // for objects passed through ellipsis (...), failing for uncopyable // objects. We define this to ensure that only POD is passed through // ellipsis on these systems. #if defined(__SYMBIAN32__) || defined(__IBMCPP__) || defined(__SUNPRO_CC) // We lose support for NULL detection where the compiler doesn't like // passing non-POD classes through ellipsis (...). # define GTEST_ELLIPSIS_NEEDS_POD_ 1 #else # define GTEST_CAN_COMPARE_NULL 1 #endif // The Nokia Symbian and IBM XL C/C++ compilers cannot decide between // const T& and const T* in a function template. These compilers // _can_ decide between class template specializations for T and T*, // so a tr1::type_traits-like is_pointer works. #if defined(__SYMBIAN32__) || defined(__IBMCPP__) # define GTEST_NEEDS_IS_POINTER_ 1 #endif template struct bool_constant { typedef bool_constant type; static const bool value = bool_value; }; template const bool bool_constant::value; typedef bool_constant false_type; typedef bool_constant true_type; template struct is_pointer : public false_type {}; template struct is_pointer : public true_type {}; template struct IteratorTraits { typedef typename Iterator::value_type value_type; }; template struct IteratorTraits { typedef T value_type; }; template struct IteratorTraits { typedef T value_type; }; #if GTEST_OS_WINDOWS # define GTEST_PATH_SEP_ "\\" # define GTEST_HAS_ALT_PATH_SEP_ 1 // The biggest signed integer type the compiler supports. typedef __int64 BiggestInt; #else # define GTEST_PATH_SEP_ "/" # define GTEST_HAS_ALT_PATH_SEP_ 0 typedef long long BiggestInt; // NOLINT #endif // GTEST_OS_WINDOWS // Utilities for char. // isspace(int ch) and friends accept an unsigned char or EOF. char // may be signed, depending on the compiler (or compiler flags). // Therefore we need to cast a char to unsigned char before calling // isspace(), etc. inline bool IsAlpha(char ch) { return isalpha(static_cast(ch)) != 0; } inline bool IsAlNum(char ch) { return isalnum(static_cast(ch)) != 0; } inline bool IsDigit(char ch) { return isdigit(static_cast(ch)) != 0; } inline bool IsLower(char ch) { return islower(static_cast(ch)) != 0; } inline bool IsSpace(char ch) { return isspace(static_cast(ch)) != 0; } inline bool IsUpper(char ch) { return isupper(static_cast(ch)) != 0; } inline bool IsXDigit(char ch) { return isxdigit(static_cast(ch)) != 0; } inline char ToLower(char ch) { return static_cast(tolower(static_cast(ch))); } inline char ToUpper(char ch) { return static_cast(toupper(static_cast(ch))); } // The testing::internal::posix namespace holds wrappers for common // POSIX functions. These wrappers hide the differences between // Windows/MSVC and POSIX systems. Since some compilers define these // standard functions as macros, the wrapper cannot have the same name // as the wrapped function. namespace posix { // Functions with a different name on Windows. #if GTEST_OS_WINDOWS typedef struct _stat StatStruct; # ifdef __BORLANDC__ inline int IsATTY(int fd) { return isatty(fd); } inline int StrCaseCmp(const char* s1, const char* s2) { return stricmp(s1, s2); } inline char* StrDup(const char* src) { return strdup(src); } # else // !__BORLANDC__ # if GTEST_OS_WINDOWS_MOBILE inline int IsATTY(int /* fd */) { return 0; } # else inline int IsATTY(int fd) { return _isatty(fd); } # endif // GTEST_OS_WINDOWS_MOBILE inline int StrCaseCmp(const char* s1, const char* s2) { return _stricmp(s1, s2); } inline char* StrDup(const char* src) { return _strdup(src); } # endif // __BORLANDC__ # if GTEST_OS_WINDOWS_MOBILE inline int FileNo(FILE* file) { return reinterpret_cast(_fileno(file)); } // Stat(), RmDir(), and IsDir() are not needed on Windows CE at this // time and thus not defined there. # else inline int FileNo(FILE* file) { return _fileno(file); } inline int Stat(const char* path, StatStruct* buf) { return _stat(path, buf); } inline int RmDir(const char* dir) { return _rmdir(dir); } inline bool IsDir(const StatStruct& st) { return (_S_IFDIR & st.st_mode) != 0; } # endif // GTEST_OS_WINDOWS_MOBILE #else typedef struct stat StatStruct; inline int FileNo(FILE* file) { return fileno(file); } inline int IsATTY(int fd) { return isatty(fd); } inline int Stat(const char* path, StatStruct* buf) { return stat(path, buf); } inline int StrCaseCmp(const char* s1, const char* s2) { return strcasecmp(s1, s2); } inline char* StrDup(const char* src) { return strdup(src); } inline int RmDir(const char* dir) { return rmdir(dir); } inline bool IsDir(const StatStruct& st) { return S_ISDIR(st.st_mode); } #endif // GTEST_OS_WINDOWS // Functions deprecated by MSVC 8.0. #ifdef _MSC_VER // Temporarily disable warning 4996 (deprecated function). # pragma warning(push) # pragma warning(disable:4996) #endif inline const char* StrNCpy(char* dest, const char* src, size_t n) { return strncpy(dest, src, n); } // ChDir(), FReopen(), FDOpen(), Read(), Write(), Close(), and // StrError() aren't needed on Windows CE at this time and thus not // defined there. #if !GTEST_OS_WINDOWS_MOBILE inline int ChDir(const char* dir) { return chdir(dir); } #endif inline FILE* FOpen(const char* path, const char* mode) { return fopen(path, mode); } #if !GTEST_OS_WINDOWS_MOBILE inline FILE *FReopen(const char* path, const char* mode, FILE* stream) { return freopen(path, mode, stream); } inline FILE* FDOpen(int fd, const char* mode) { return fdopen(fd, mode); } #endif inline int FClose(FILE* fp) { return fclose(fp); } #if !GTEST_OS_WINDOWS_MOBILE inline int Read(int fd, void* buf, unsigned int count) { return static_cast(read(fd, buf, count)); } inline int Write(int fd, const void* buf, unsigned int count) { return static_cast(write(fd, buf, count)); } inline int Close(int fd) { return close(fd); } inline const char* StrError(int errnum) { return strerror(errnum); } #endif inline const char* GetEnv(const char* name) { #if GTEST_OS_WINDOWS_MOBILE // We are on Windows CE, which has no environment variables. return NULL; #elif defined(__BORLANDC__) || defined(__SunOS_5_8) || defined(__SunOS_5_9) // Environment variables which we programmatically clear will be set to the // empty string rather than unset (NULL). Handle that case. const char* const env = getenv(name); return (env != NULL && env[0] != '\0') ? env : NULL; #else return getenv(name); #endif } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif #if GTEST_OS_WINDOWS_MOBILE // Windows CE has no C library. The abort() function is used in // several places in Google Test. This implementation provides a reasonable // imitation of standard behaviour. void Abort(); #else inline void Abort() { abort(); } #endif // GTEST_OS_WINDOWS_MOBILE } // namespace posix // The maximum number a BiggestInt can represent. This definition // works no matter BiggestInt is represented in one's complement or // two's complement. // // We cannot rely on numeric_limits in STL, as __int64 and long long // are not part of standard C++ and numeric_limits doesn't need to be // defined for them. const BiggestInt kMaxBiggestInt = ~(static_cast(1) << (8*sizeof(BiggestInt) - 1)); // This template class serves as a compile-time function from size to // type. It maps a size in bytes to a primitive type with that // size. e.g. // // TypeWithSize<4>::UInt // // is typedef-ed to be unsigned int (unsigned integer made up of 4 // bytes). // // Such functionality should belong to STL, but I cannot find it // there. // // Google Test uses this class in the implementation of floating-point // comparison. // // For now it only handles UInt (unsigned int) as that's all Google Test // needs. Other types can be easily added in the future if need // arises. template class TypeWithSize { public: // This prevents the user from using TypeWithSize with incorrect // values of N. typedef void UInt; }; // The specialization for size 4. template <> class TypeWithSize<4> { public: // unsigned int has size 4 in both gcc and MSVC. // // As base/basictypes.h doesn't compile on Windows, we cannot use // uint32, uint64, and etc here. typedef int Int; typedef unsigned int UInt; }; // The specialization for size 8. template <> class TypeWithSize<8> { public: #if GTEST_OS_WINDOWS typedef __int64 Int; typedef unsigned __int64 UInt; #else typedef long long Int; // NOLINT typedef unsigned long long UInt; // NOLINT #endif // GTEST_OS_WINDOWS }; // Integer types of known sizes. typedef TypeWithSize<4>::Int Int32; typedef TypeWithSize<4>::UInt UInt32; typedef TypeWithSize<8>::Int Int64; typedef TypeWithSize<8>::UInt UInt64; typedef TypeWithSize<8>::Int TimeInMillis; // Represents time in milliseconds. // Utilities for command line flags and environment variables. // Macro for referencing flags. #define GTEST_FLAG(name) FLAGS_gtest_##name // Macros for declaring flags. #define GTEST_DECLARE_bool_(name) GTEST_API_ extern bool GTEST_FLAG(name) #define GTEST_DECLARE_int32_(name) \ GTEST_API_ extern ::testing::internal::Int32 GTEST_FLAG(name) #define GTEST_DECLARE_string_(name) \ GTEST_API_ extern ::testing::internal::String GTEST_FLAG(name) // Macros for defining flags. #define GTEST_DEFINE_bool_(name, default_val, doc) \ GTEST_API_ bool GTEST_FLAG(name) = (default_val) #define GTEST_DEFINE_int32_(name, default_val, doc) \ GTEST_API_ ::testing::internal::Int32 GTEST_FLAG(name) = (default_val) #define GTEST_DEFINE_string_(name, default_val, doc) \ GTEST_API_ ::testing::internal::String GTEST_FLAG(name) = (default_val) // Parses 'str' for a 32-bit signed integer. If successful, writes the result // to *value and returns true; otherwise leaves *value unchanged and returns // false. // TODO(chandlerc): Find a better way to refactor flag and environment parsing // out of both gtest-port.cc and gtest.cc to avoid exporting this utility // function. bool ParseInt32(const Message& src_text, const char* str, Int32* value); // Parses a bool/Int32/string from the environment variable // corresponding to the given Google Test flag. bool BoolFromGTestEnv(const char* flag, bool default_val); GTEST_API_ Int32 Int32FromGTestEnv(const char* flag, Int32 default_val); const char* StringFromGTestEnv(const char* flag, const char* default_val); } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ #if GTEST_OS_LINUX # include # include # include # include #endif // GTEST_OS_LINUX #include #include #include #include #include // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Authors: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) // // The Google C++ Testing Framework (Google Test) // // This header file declares the String class and functions used internally by // Google Test. They are subject to change without notice. They should not used // by code external to Google Test. // // This header file is #included by . // It should not be #included by other files. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ #ifdef __BORLANDC__ // string.h is not guaranteed to provide strcpy on C++ Builder. # include #endif #include #include namespace testing { namespace internal { // String - a UTF-8 string class. // // For historic reasons, we don't use std::string. // // TODO(wan@google.com): replace this class with std::string or // implement it in terms of the latter. // // Note that String can represent both NULL and the empty string, // while std::string cannot represent NULL. // // NULL and the empty string are considered different. NULL is less // than anything (including the empty string) except itself. // // This class only provides minimum functionality necessary for // implementing Google Test. We do not intend to implement a full-fledged // string class here. // // Since the purpose of this class is to provide a substitute for // std::string on platforms where it cannot be used, we define a copy // constructor and assignment operators such that we don't need // conditional compilation in a lot of places. // // In order to make the representation efficient, the d'tor of String // is not virtual. Therefore DO NOT INHERIT FROM String. class GTEST_API_ String { public: // Static utility methods // Returns the input enclosed in double quotes if it's not NULL; // otherwise returns "(null)". For example, "\"Hello\"" is returned // for input "Hello". // // This is useful for printing a C string in the syntax of a literal. // // Known issue: escape sequences are not handled yet. static String ShowCStringQuoted(const char* c_str); // Clones a 0-terminated C string, allocating memory using new. The // caller is responsible for deleting the return value using // delete[]. Returns the cloned string, or NULL if the input is // NULL. // // This is different from strdup() in string.h, which allocates // memory using malloc(). static const char* CloneCString(const char* c_str); #if GTEST_OS_WINDOWS_MOBILE // Windows CE does not have the 'ANSI' versions of Win32 APIs. To be // able to pass strings to Win32 APIs on CE we need to convert them // to 'Unicode', UTF-16. // Creates a UTF-16 wide string from the given ANSI string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the wide string, or NULL if the // input is NULL. // // The wide string is created using the ANSI codepage (CP_ACP) to // match the behaviour of the ANSI versions of Win32 calls and the // C runtime. static LPCWSTR AnsiToUtf16(const char* c_str); // Creates an ANSI string from the given wide string, allocating // memory using new. The caller is responsible for deleting the return // value using delete[]. Returns the ANSI string, or NULL if the // input is NULL. // // The returned string is created using the ANSI codepage (CP_ACP) to // match the behaviour of the ANSI versions of Win32 calls and the // C runtime. static const char* Utf16ToAnsi(LPCWSTR utf16_str); #endif // Compares two C strings. Returns true iff they have the same content. // // Unlike strcmp(), this function can handle NULL argument(s). A // NULL C string is considered different to any non-NULL C string, // including the empty string. static bool CStringEquals(const char* lhs, const char* rhs); // Converts a wide C string to a String using the UTF-8 encoding. // NULL will be converted to "(null)". If an error occurred during // the conversion, "(failed to convert from wide string)" is // returned. static String ShowWideCString(const wchar_t* wide_c_str); // Similar to ShowWideCString(), except that this function encloses // the converted string in double quotes. static String ShowWideCStringQuoted(const wchar_t* wide_c_str); // Compares two wide C strings. Returns true iff they have the same // content. // // Unlike wcscmp(), this function can handle NULL argument(s). A // NULL C string is considered different to any non-NULL C string, // including the empty string. static bool WideCStringEquals(const wchar_t* lhs, const wchar_t* rhs); // Compares two C strings, ignoring case. Returns true iff they // have the same content. // // Unlike strcasecmp(), this function can handle NULL argument(s). // A NULL C string is considered different to any non-NULL C string, // including the empty string. static bool CaseInsensitiveCStringEquals(const char* lhs, const char* rhs); // Compares two wide C strings, ignoring case. Returns true iff they // have the same content. // // Unlike wcscasecmp(), this function can handle NULL argument(s). // A NULL C string is considered different to any non-NULL wide C string, // including the empty string. // NB: The implementations on different platforms slightly differ. // On windows, this method uses _wcsicmp which compares according to LC_CTYPE // environment variable. On GNU platform this method uses wcscasecmp // which compares according to LC_CTYPE category of the current locale. // On MacOS X, it uses towlower, which also uses LC_CTYPE category of the // current locale. static bool CaseInsensitiveWideCStringEquals(const wchar_t* lhs, const wchar_t* rhs); // Formats a list of arguments to a String, using the same format // spec string as for printf. // // We do not use the StringPrintf class as it is not universally // available. // // The result is limited to 4096 characters (including the tailing // 0). If 4096 characters are not enough to format the input, // "" is returned. static String Format(const char* format, ...); // C'tors // The default c'tor constructs a NULL string. String() : c_str_(NULL), length_(0) {} // Constructs a String by cloning a 0-terminated C string. String(const char* a_c_str) { // NOLINT if (a_c_str == NULL) { c_str_ = NULL; length_ = 0; } else { ConstructNonNull(a_c_str, strlen(a_c_str)); } } // Constructs a String by copying a given number of chars from a // buffer. E.g. String("hello", 3) creates the string "hel", // String("a\0bcd", 4) creates "a\0bc", String(NULL, 0) creates "", // and String(NULL, 1) results in access violation. String(const char* buffer, size_t a_length) { ConstructNonNull(buffer, a_length); } // The copy c'tor creates a new copy of the string. The two // String objects do not share content. String(const String& str) : c_str_(NULL), length_(0) { *this = str; } // D'tor. String is intended to be a final class, so the d'tor // doesn't need to be virtual. ~String() { delete[] c_str_; } // Allows a String to be implicitly converted to an ::std::string or // ::string, and vice versa. Converting a String containing a NULL // pointer to ::std::string or ::string is undefined behavior. // Converting a ::std::string or ::string containing an embedded NUL // character to a String will result in the prefix up to the first // NUL character. String(const ::std::string& str) { ConstructNonNull(str.c_str(), str.length()); } operator ::std::string() const { return ::std::string(c_str(), length()); } #if GTEST_HAS_GLOBAL_STRING String(const ::string& str) { ConstructNonNull(str.c_str(), str.length()); } operator ::string() const { return ::string(c_str(), length()); } #endif // GTEST_HAS_GLOBAL_STRING // Returns true iff this is an empty string (i.e. ""). bool empty() const { return (c_str() != NULL) && (length() == 0); } // Compares this with another String. // Returns < 0 if this is less than rhs, 0 if this is equal to rhs, or > 0 // if this is greater than rhs. int Compare(const String& rhs) const; // Returns true iff this String equals the given C string. A NULL // string and a non-NULL string are considered not equal. bool operator==(const char* a_c_str) const { return Compare(a_c_str) == 0; } // Returns true iff this String is less than the given String. A // NULL string is considered less than "". bool operator<(const String& rhs) const { return Compare(rhs) < 0; } // Returns true iff this String doesn't equal the given C string. A NULL // string and a non-NULL string are considered not equal. bool operator!=(const char* a_c_str) const { return !(*this == a_c_str); } // Returns true iff this String ends with the given suffix. *Any* // String is considered to end with a NULL or empty suffix. bool EndsWith(const char* suffix) const; // Returns true iff this String ends with the given suffix, not considering // case. Any String is considered to end with a NULL or empty suffix. bool EndsWithCaseInsensitive(const char* suffix) const; // Returns the length of the encapsulated string, or 0 if the // string is NULL. size_t length() const { return length_; } // Gets the 0-terminated C string this String object represents. // The String object still owns the string. Therefore the caller // should NOT delete the return value. const char* c_str() const { return c_str_; } // Assigns a C string to this object. Self-assignment works. const String& operator=(const char* a_c_str) { return *this = String(a_c_str); } // Assigns a String object to this object. Self-assignment works. const String& operator=(const String& rhs) { if (this != &rhs) { delete[] c_str_; if (rhs.c_str() == NULL) { c_str_ = NULL; length_ = 0; } else { ConstructNonNull(rhs.c_str(), rhs.length()); } } return *this; } private: // Constructs a non-NULL String from the given content. This // function can only be called when c_str_ has not been allocated. // ConstructNonNull(NULL, 0) results in an empty string (""). // ConstructNonNull(NULL, non_zero) is undefined behavior. void ConstructNonNull(const char* buffer, size_t a_length) { char* const str = new char[a_length + 1]; memcpy(str, buffer, a_length); str[a_length] = '\0'; c_str_ = str; length_ = a_length; } const char* c_str_; size_t length_; }; // class String // Streams a String to an ostream. Each '\0' character in the String // is replaced with "\\0". inline ::std::ostream& operator<<(::std::ostream& os, const String& str) { if (str.c_str() == NULL) { os << "(null)"; } else { const char* const c_str = str.c_str(); for (size_t i = 0; i != str.length(); i++) { if (c_str[i] == '\0') { os << "\\0"; } else { os << c_str[i]; } } } return os; } // Gets the content of the stringstream's buffer as a String. Each '\0' // character in the buffer is replaced with "\\0". GTEST_API_ String StringStreamToString(::std::stringstream* stream); // Converts a streamable value to a String. A NULL pointer is // converted to "(null)". When the input value is a ::string, // ::std::string, ::wstring, or ::std::wstring object, each NUL // character in it is replaced with "\\0". // Declared here but defined in gtest.h, so that it has access // to the definition of the Message class, required by the ARM // compiler. template String StreamableToString(const T& streamable); } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: keith.ray@gmail.com (Keith Ray) // // Google Test filepath utilities // // This header file declares classes and functions used internally by // Google Test. They are subject to change without notice. // // This file is #included in . // Do not include this header file separately! #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ namespace testing { namespace internal { // FilePath - a class for file and directory pathname manipulation which // handles platform-specific conventions (like the pathname separator). // Used for helper functions for naming files in a directory for xml output. // Except for Set methods, all methods are const or static, which provides an // "immutable value object" -- useful for peace of mind. // A FilePath with a value ending in a path separator ("like/this/") represents // a directory, otherwise it is assumed to represent a file. In either case, // it may or may not represent an actual file or directory in the file system. // Names are NOT checked for syntax correctness -- no checking for illegal // characters, malformed paths, etc. class GTEST_API_ FilePath { public: FilePath() : pathname_("") { } FilePath(const FilePath& rhs) : pathname_(rhs.pathname_) { } explicit FilePath(const char* pathname) : pathname_(pathname) { Normalize(); } explicit FilePath(const String& pathname) : pathname_(pathname) { Normalize(); } FilePath& operator=(const FilePath& rhs) { Set(rhs); return *this; } void Set(const FilePath& rhs) { pathname_ = rhs.pathname_; } String ToString() const { return pathname_; } const char* c_str() const { return pathname_.c_str(); } // Returns the current working directory, or "" if unsuccessful. static FilePath GetCurrentDir(); // Given directory = "dir", base_name = "test", number = 0, // extension = "xml", returns "dir/test.xml". If number is greater // than zero (e.g., 12), returns "dir/test_12.xml". // On Windows platform, uses \ as the separator rather than /. static FilePath MakeFileName(const FilePath& directory, const FilePath& base_name, int number, const char* extension); // Given directory = "dir", relative_path = "test.xml", // returns "dir/test.xml". // On Windows, uses \ as the separator rather than /. static FilePath ConcatPaths(const FilePath& directory, const FilePath& relative_path); // Returns a pathname for a file that does not currently exist. The pathname // will be directory/base_name.extension or // directory/base_name_.extension if directory/base_name.extension // already exists. The number will be incremented until a pathname is found // that does not already exist. // Examples: 'dir/foo_test.xml' or 'dir/foo_test_1.xml'. // There could be a race condition if two or more processes are calling this // function at the same time -- they could both pick the same filename. static FilePath GenerateUniqueFileName(const FilePath& directory, const FilePath& base_name, const char* extension); // Returns true iff the path is NULL or "". bool IsEmpty() const { return c_str() == NULL || *c_str() == '\0'; } // If input name has a trailing separator character, removes it and returns // the name, otherwise return the name string unmodified. // On Windows platform, uses \ as the separator, other platforms use /. FilePath RemoveTrailingPathSeparator() const; // Returns a copy of the FilePath with the directory part removed. // Example: FilePath("path/to/file").RemoveDirectoryName() returns // FilePath("file"). If there is no directory part ("just_a_file"), it returns // the FilePath unmodified. If there is no file part ("just_a_dir/") it // returns an empty FilePath (""). // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath RemoveDirectoryName() const; // RemoveFileName returns the directory path with the filename removed. // Example: FilePath("path/to/file").RemoveFileName() returns "path/to/". // If the FilePath is "a_file" or "/a_file", RemoveFileName returns // FilePath("./") or, on Windows, FilePath(".\\"). If the filepath does // not have a file, like "just/a/dir/", it returns the FilePath unmodified. // On Windows platform, '\' is the path separator, otherwise it is '/'. FilePath RemoveFileName() const; // Returns a copy of the FilePath with the case-insensitive extension removed. // Example: FilePath("dir/file.exe").RemoveExtension("EXE") returns // FilePath("dir/file"). If a case-insensitive extension is not // found, returns a copy of the original FilePath. FilePath RemoveExtension(const char* extension) const; // Creates directories so that path exists. Returns true if successful or if // the directories already exist; returns false if unable to create // directories for any reason. Will also return false if the FilePath does // not represent a directory (that is, it doesn't end with a path separator). bool CreateDirectoriesRecursively() const; // Create the directory so that path exists. Returns true if successful or // if the directory already exists; returns false if unable to create the // directory for any reason, including if the parent directory does not // exist. Not named "CreateDirectory" because that's a macro on Windows. bool CreateFolder() const; // Returns true if FilePath describes something in the file-system, // either a file, directory, or whatever, and that something exists. bool FileOrDirectoryExists() const; // Returns true if pathname describes a directory in the file-system // that exists. bool DirectoryExists() const; // Returns true if FilePath ends with a path separator, which indicates that // it is intended to represent a directory. Returns false otherwise. // This does NOT check that a directory (or file) actually exists. bool IsDirectory() const; // Returns true if pathname describes a root directory. (Windows has one // root directory per disk drive.) bool IsRootDirectory() const; // Returns true if pathname describes an absolute path. bool IsAbsolutePath() const; private: // Replaces multiple consecutive separators with a single separator. // For example, "bar///foo" becomes "bar/foo". Does not eliminate other // redundancies that might be in a pathname involving "." or "..". // // A pathname with multiple consecutive separators may occur either through // user error or as a result of some scripts or APIs that generate a pathname // with a trailing separator. On other platforms the same API or script // may NOT generate a pathname with a trailing "/". Then elsewhere that // pathname may have another "/" and pathname components added to it, // without checking for the separator already being there. // The script language and operating system may allow paths like "foo//bar" // but some of the functions in FilePath will not handle that correctly. In // particular, RemoveTrailingPathSeparator() only removes one separator, and // it is called in CreateDirectoriesRecursively() assuming that it will change // a pathname from directory syntax (trailing separator) to filename syntax. // // On Windows this method also replaces the alternate path separator '/' with // the primary path separator '\\', so that for example "bar\\/\\foo" becomes // "bar\\foo". void Normalize(); // Returns a pointer to the last occurence of a valid path separator in // the FilePath. On Windows, for example, both '/' and '\' are valid path // separators. Returns NULL if no path separator was found. const char* FindLastPathSeparator() const; String pathname_; }; // class FilePath } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ // This file was GENERATED by command: // pump.py gtest-type-util.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan) // Type utilities needed for implementing typed and type-parameterized // tests. This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // // Currently we support at most 50 types in a list, and at most 50 // type-parameterized tests in one type-parameterized test case. // Please contact googletestframework@googlegroups.com if you need // more. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ // #ifdef __GNUC__ is too general here. It is possible to use gcc without using // libstdc++ (which is where cxxabi.h comes from). # ifdef __GLIBCXX__ # include # elif defined(__HP_aCC) # include # endif // __GLIBCXX__ namespace testing { namespace internal { // GetTypeName() returns a human-readable name of type T. // NB: This function is also used in Google Mock, so don't move it inside of // the typed-test-only section below. template String GetTypeName() { # if GTEST_HAS_RTTI const char* const name = typeid(T).name(); # if defined(__GLIBCXX__) || defined(__HP_aCC) int status = 0; // gcc's implementation of typeid(T).name() mangles the type name, // so we have to demangle it. # ifdef __GLIBCXX__ using abi::__cxa_demangle; # endif // __GLIBCXX__ char* const readable_name = __cxa_demangle(name, 0, 0, &status); const String name_str(status == 0 ? readable_name : name); free(readable_name); return name_str; # else return name; # endif // __GLIBCXX__ || __HP_aCC # else return ""; # endif // GTEST_HAS_RTTI } #if GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P // AssertyTypeEq::type is defined iff T1 and T2 are the same // type. This can be used as a compile-time assertion to ensure that // two types are equal. template struct AssertTypeEq; template struct AssertTypeEq { typedef bool type; }; // A unique type used as the default value for the arguments of class // template Types. This allows us to simulate variadic templates // (e.g. Types, Type, and etc), which C++ doesn't // support directly. struct None {}; // The following family of struct and struct templates are used to // represent type lists. In particular, TypesN // represents a type list with N types (T1, T2, ..., and TN) in it. // Except for Types0, every struct in the family has two member types: // Head for the first type in the list, and Tail for the rest of the // list. // The empty type list. struct Types0 {}; // Type lists of length 1, 2, 3, and so on. template struct Types1 { typedef T1 Head; typedef Types0 Tail; }; template struct Types2 { typedef T1 Head; typedef Types1 Tail; }; template struct Types3 { typedef T1 Head; typedef Types2 Tail; }; template struct Types4 { typedef T1 Head; typedef Types3 Tail; }; template struct Types5 { typedef T1 Head; typedef Types4 Tail; }; template struct Types6 { typedef T1 Head; typedef Types5 Tail; }; template struct Types7 { typedef T1 Head; typedef Types6 Tail; }; template struct Types8 { typedef T1 Head; typedef Types7 Tail; }; template struct Types9 { typedef T1 Head; typedef Types8 Tail; }; template struct Types10 { typedef T1 Head; typedef Types9 Tail; }; template struct Types11 { typedef T1 Head; typedef Types10 Tail; }; template struct Types12 { typedef T1 Head; typedef Types11 Tail; }; template struct Types13 { typedef T1 Head; typedef Types12 Tail; }; template struct Types14 { typedef T1 Head; typedef Types13 Tail; }; template struct Types15 { typedef T1 Head; typedef Types14 Tail; }; template struct Types16 { typedef T1 Head; typedef Types15 Tail; }; template struct Types17 { typedef T1 Head; typedef Types16 Tail; }; template struct Types18 { typedef T1 Head; typedef Types17 Tail; }; template struct Types19 { typedef T1 Head; typedef Types18 Tail; }; template struct Types20 { typedef T1 Head; typedef Types19 Tail; }; template struct Types21 { typedef T1 Head; typedef Types20 Tail; }; template struct Types22 { typedef T1 Head; typedef Types21 Tail; }; template struct Types23 { typedef T1 Head; typedef Types22 Tail; }; template struct Types24 { typedef T1 Head; typedef Types23 Tail; }; template struct Types25 { typedef T1 Head; typedef Types24 Tail; }; template struct Types26 { typedef T1 Head; typedef Types25 Tail; }; template struct Types27 { typedef T1 Head; typedef Types26 Tail; }; template struct Types28 { typedef T1 Head; typedef Types27 Tail; }; template struct Types29 { typedef T1 Head; typedef Types28 Tail; }; template struct Types30 { typedef T1 Head; typedef Types29 Tail; }; template struct Types31 { typedef T1 Head; typedef Types30 Tail; }; template struct Types32 { typedef T1 Head; typedef Types31 Tail; }; template struct Types33 { typedef T1 Head; typedef Types32 Tail; }; template struct Types34 { typedef T1 Head; typedef Types33 Tail; }; template struct Types35 { typedef T1 Head; typedef Types34 Tail; }; template struct Types36 { typedef T1 Head; typedef Types35 Tail; }; template struct Types37 { typedef T1 Head; typedef Types36 Tail; }; template struct Types38 { typedef T1 Head; typedef Types37 Tail; }; template struct Types39 { typedef T1 Head; typedef Types38 Tail; }; template struct Types40 { typedef T1 Head; typedef Types39 Tail; }; template struct Types41 { typedef T1 Head; typedef Types40 Tail; }; template struct Types42 { typedef T1 Head; typedef Types41 Tail; }; template struct Types43 { typedef T1 Head; typedef Types42 Tail; }; template struct Types44 { typedef T1 Head; typedef Types43 Tail; }; template struct Types45 { typedef T1 Head; typedef Types44 Tail; }; template struct Types46 { typedef T1 Head; typedef Types45 Tail; }; template struct Types47 { typedef T1 Head; typedef Types46 Tail; }; template struct Types48 { typedef T1 Head; typedef Types47 Tail; }; template struct Types49 { typedef T1 Head; typedef Types48 Tail; }; template struct Types50 { typedef T1 Head; typedef Types49 Tail; }; } // namespace internal // We don't want to require the users to write TypesN<...> directly, // as that would require them to count the length. Types<...> is much // easier to write, but generates horrible messages when there is a // compiler error, as gcc insists on printing out each template // argument, even if it has the default value (this means Types // will appear as Types in the compiler // errors). // // Our solution is to combine the best part of the two approaches: a // user would write Types, and Google Test will translate // that to TypesN internally to make error messages // readable. The translation is done by the 'type' member of the // Types template. template struct Types { typedef internal::Types50 type; }; template <> struct Types { typedef internal::Types0 type; }; template struct Types { typedef internal::Types1 type; }; template struct Types { typedef internal::Types2 type; }; template struct Types { typedef internal::Types3 type; }; template struct Types { typedef internal::Types4 type; }; template struct Types { typedef internal::Types5 type; }; template struct Types { typedef internal::Types6 type; }; template struct Types { typedef internal::Types7 type; }; template struct Types { typedef internal::Types8 type; }; template struct Types { typedef internal::Types9 type; }; template struct Types { typedef internal::Types10 type; }; template struct Types { typedef internal::Types11 type; }; template struct Types { typedef internal::Types12 type; }; template struct Types { typedef internal::Types13 type; }; template struct Types { typedef internal::Types14 type; }; template struct Types { typedef internal::Types15 type; }; template struct Types { typedef internal::Types16 type; }; template struct Types { typedef internal::Types17 type; }; template struct Types { typedef internal::Types18 type; }; template struct Types { typedef internal::Types19 type; }; template struct Types { typedef internal::Types20 type; }; template struct Types { typedef internal::Types21 type; }; template struct Types { typedef internal::Types22 type; }; template struct Types { typedef internal::Types23 type; }; template struct Types { typedef internal::Types24 type; }; template struct Types { typedef internal::Types25 type; }; template struct Types { typedef internal::Types26 type; }; template struct Types { typedef internal::Types27 type; }; template struct Types { typedef internal::Types28 type; }; template struct Types { typedef internal::Types29 type; }; template struct Types { typedef internal::Types30 type; }; template struct Types { typedef internal::Types31 type; }; template struct Types { typedef internal::Types32 type; }; template struct Types { typedef internal::Types33 type; }; template struct Types { typedef internal::Types34 type; }; template struct Types { typedef internal::Types35 type; }; template struct Types { typedef internal::Types36 type; }; template struct Types { typedef internal::Types37 type; }; template struct Types { typedef internal::Types38 type; }; template struct Types { typedef internal::Types39 type; }; template struct Types { typedef internal::Types40 type; }; template struct Types { typedef internal::Types41 type; }; template struct Types { typedef internal::Types42 type; }; template struct Types { typedef internal::Types43 type; }; template struct Types { typedef internal::Types44 type; }; template struct Types { typedef internal::Types45 type; }; template struct Types { typedef internal::Types46 type; }; template struct Types { typedef internal::Types47 type; }; template struct Types { typedef internal::Types48 type; }; template struct Types { typedef internal::Types49 type; }; namespace internal { # define GTEST_TEMPLATE_ template class // The template "selector" struct TemplateSel is used to // represent Tmpl, which must be a class template with one type // parameter, as a type. TemplateSel::Bind::type is defined // as the type Tmpl. This allows us to actually instantiate the // template "selected" by TemplateSel. // // This trick is necessary for simulating typedef for class templates, // which C++ doesn't support directly. template struct TemplateSel { template struct Bind { typedef Tmpl type; }; }; # define GTEST_BIND_(TmplSel, T) \ TmplSel::template Bind::type // A unique struct template used as the default value for the // arguments of class template Templates. This allows us to simulate // variadic templates (e.g. Templates, Templates, // and etc), which C++ doesn't support directly. template struct NoneT {}; // The following family of struct and struct templates are used to // represent template lists. In particular, TemplatesN represents a list of N templates (T1, T2, ..., and TN). Except // for Templates0, every struct in the family has two member types: // Head for the selector of the first template in the list, and Tail // for the rest of the list. // The empty template list. struct Templates0 {}; // Template lists of length 1, 2, 3, and so on. template struct Templates1 { typedef TemplateSel Head; typedef Templates0 Tail; }; template struct Templates2 { typedef TemplateSel Head; typedef Templates1 Tail; }; template struct Templates3 { typedef TemplateSel Head; typedef Templates2 Tail; }; template struct Templates4 { typedef TemplateSel Head; typedef Templates3 Tail; }; template struct Templates5 { typedef TemplateSel Head; typedef Templates4 Tail; }; template struct Templates6 { typedef TemplateSel Head; typedef Templates5 Tail; }; template struct Templates7 { typedef TemplateSel Head; typedef Templates6 Tail; }; template struct Templates8 { typedef TemplateSel Head; typedef Templates7 Tail; }; template struct Templates9 { typedef TemplateSel Head; typedef Templates8 Tail; }; template struct Templates10 { typedef TemplateSel Head; typedef Templates9 Tail; }; template struct Templates11 { typedef TemplateSel Head; typedef Templates10 Tail; }; template struct Templates12 { typedef TemplateSel Head; typedef Templates11 Tail; }; template struct Templates13 { typedef TemplateSel Head; typedef Templates12 Tail; }; template struct Templates14 { typedef TemplateSel Head; typedef Templates13 Tail; }; template struct Templates15 { typedef TemplateSel Head; typedef Templates14 Tail; }; template struct Templates16 { typedef TemplateSel Head; typedef Templates15 Tail; }; template struct Templates17 { typedef TemplateSel Head; typedef Templates16 Tail; }; template struct Templates18 { typedef TemplateSel Head; typedef Templates17 Tail; }; template struct Templates19 { typedef TemplateSel Head; typedef Templates18 Tail; }; template struct Templates20 { typedef TemplateSel Head; typedef Templates19 Tail; }; template struct Templates21 { typedef TemplateSel Head; typedef Templates20 Tail; }; template struct Templates22 { typedef TemplateSel Head; typedef Templates21 Tail; }; template struct Templates23 { typedef TemplateSel Head; typedef Templates22 Tail; }; template struct Templates24 { typedef TemplateSel Head; typedef Templates23 Tail; }; template struct Templates25 { typedef TemplateSel Head; typedef Templates24 Tail; }; template struct Templates26 { typedef TemplateSel Head; typedef Templates25 Tail; }; template struct Templates27 { typedef TemplateSel Head; typedef Templates26 Tail; }; template struct Templates28 { typedef TemplateSel Head; typedef Templates27 Tail; }; template struct Templates29 { typedef TemplateSel Head; typedef Templates28 Tail; }; template struct Templates30 { typedef TemplateSel Head; typedef Templates29 Tail; }; template struct Templates31 { typedef TemplateSel Head; typedef Templates30 Tail; }; template struct Templates32 { typedef TemplateSel Head; typedef Templates31 Tail; }; template struct Templates33 { typedef TemplateSel Head; typedef Templates32 Tail; }; template struct Templates34 { typedef TemplateSel Head; typedef Templates33 Tail; }; template struct Templates35 { typedef TemplateSel Head; typedef Templates34 Tail; }; template struct Templates36 { typedef TemplateSel Head; typedef Templates35 Tail; }; template struct Templates37 { typedef TemplateSel Head; typedef Templates36 Tail; }; template struct Templates38 { typedef TemplateSel Head; typedef Templates37 Tail; }; template struct Templates39 { typedef TemplateSel Head; typedef Templates38 Tail; }; template struct Templates40 { typedef TemplateSel Head; typedef Templates39 Tail; }; template struct Templates41 { typedef TemplateSel Head; typedef Templates40 Tail; }; template struct Templates42 { typedef TemplateSel Head; typedef Templates41 Tail; }; template struct Templates43 { typedef TemplateSel Head; typedef Templates42 Tail; }; template struct Templates44 { typedef TemplateSel Head; typedef Templates43 Tail; }; template struct Templates45 { typedef TemplateSel Head; typedef Templates44 Tail; }; template struct Templates46 { typedef TemplateSel Head; typedef Templates45 Tail; }; template struct Templates47 { typedef TemplateSel Head; typedef Templates46 Tail; }; template struct Templates48 { typedef TemplateSel Head; typedef Templates47 Tail; }; template struct Templates49 { typedef TemplateSel Head; typedef Templates48 Tail; }; template struct Templates50 { typedef TemplateSel Head; typedef Templates49 Tail; }; // We don't want to require the users to write TemplatesN<...> directly, // as that would require them to count the length. Templates<...> is much // easier to write, but generates horrible messages when there is a // compiler error, as gcc insists on printing out each template // argument, even if it has the default value (this means Templates // will appear as Templates in the compiler // errors). // // Our solution is to combine the best part of the two approaches: a // user would write Templates, and Google Test will translate // that to TemplatesN internally to make error messages // readable. The translation is done by the 'type' member of the // Templates template. template struct Templates { typedef Templates50 type; }; template <> struct Templates { typedef Templates0 type; }; template struct Templates { typedef Templates1 type; }; template struct Templates { typedef Templates2 type; }; template struct Templates { typedef Templates3 type; }; template struct Templates { typedef Templates4 type; }; template struct Templates { typedef Templates5 type; }; template struct Templates { typedef Templates6 type; }; template struct Templates { typedef Templates7 type; }; template struct Templates { typedef Templates8 type; }; template struct Templates { typedef Templates9 type; }; template struct Templates { typedef Templates10 type; }; template struct Templates { typedef Templates11 type; }; template struct Templates { typedef Templates12 type; }; template struct Templates { typedef Templates13 type; }; template struct Templates { typedef Templates14 type; }; template struct Templates { typedef Templates15 type; }; template struct Templates { typedef Templates16 type; }; template struct Templates { typedef Templates17 type; }; template struct Templates { typedef Templates18 type; }; template struct Templates { typedef Templates19 type; }; template struct Templates { typedef Templates20 type; }; template struct Templates { typedef Templates21 type; }; template struct Templates { typedef Templates22 type; }; template struct Templates { typedef Templates23 type; }; template struct Templates { typedef Templates24 type; }; template struct Templates { typedef Templates25 type; }; template struct Templates { typedef Templates26 type; }; template struct Templates { typedef Templates27 type; }; template struct Templates { typedef Templates28 type; }; template struct Templates { typedef Templates29 type; }; template struct Templates { typedef Templates30 type; }; template struct Templates { typedef Templates31 type; }; template struct Templates { typedef Templates32 type; }; template struct Templates { typedef Templates33 type; }; template struct Templates { typedef Templates34 type; }; template struct Templates { typedef Templates35 type; }; template struct Templates { typedef Templates36 type; }; template struct Templates { typedef Templates37 type; }; template struct Templates { typedef Templates38 type; }; template struct Templates { typedef Templates39 type; }; template struct Templates { typedef Templates40 type; }; template struct Templates { typedef Templates41 type; }; template struct Templates { typedef Templates42 type; }; template struct Templates { typedef Templates43 type; }; template struct Templates { typedef Templates44 type; }; template struct Templates { typedef Templates45 type; }; template struct Templates { typedef Templates46 type; }; template struct Templates { typedef Templates47 type; }; template struct Templates { typedef Templates48 type; }; template struct Templates { typedef Templates49 type; }; // The TypeList template makes it possible to use either a single type // or a Types<...> list in TYPED_TEST_CASE() and // INSTANTIATE_TYPED_TEST_CASE_P(). template struct TypeList { typedef Types1 type; }; template struct TypeList > { typedef typename Types::type type; }; #endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ // Due to C++ preprocessor weirdness, we need double indirection to // concatenate two tokens when one of them is __LINE__. Writing // // foo ## __LINE__ // // will result in the token foo__LINE__, instead of foo followed by // the current line number. For more details, see // http://www.parashift.com/c++-faq-lite/misc-technical-issues.html#faq-39.6 #define GTEST_CONCAT_TOKEN_(foo, bar) GTEST_CONCAT_TOKEN_IMPL_(foo, bar) #define GTEST_CONCAT_TOKEN_IMPL_(foo, bar) foo ## bar // Google Test defines the testing::Message class to allow construction of // test messages via the << operator. The idea is that anything // streamable to std::ostream can be streamed to a testing::Message. // This allows a user to use his own types in Google Test assertions by // overloading the << operator. // // util/gtl/stl_logging-inl.h overloads << for STL containers. These // overloads cannot be defined in the std namespace, as that will be // undefined behavior. Therefore, they are defined in the global // namespace instead. // // C++'s symbol lookup rule (i.e. Koenig lookup) says that these // overloads are visible in either the std namespace or the global // namespace, but not other namespaces, including the testing // namespace which Google Test's Message class is in. // // To allow STL containers (and other types that has a << operator // defined in the global namespace) to be used in Google Test assertions, // testing::Message must access the custom << operator from the global // namespace. Hence this helper function. // // Note: Jeffrey Yasskin suggested an alternative fix by "using // ::operator<<;" in the definition of Message's operator<<. That fix // doesn't require a helper function, but unfortunately doesn't // compile with MSVC. template inline void GTestStreamToHelper(std::ostream* os, const T& val) { *os << val; } class ProtocolMessage; namespace proto2 { class Message; } namespace testing { // Forward declarations. class AssertionResult; // Result of an assertion. class Message; // Represents a failure message. class Test; // Represents a test. class TestInfo; // Information about a test. class TestPartResult; // Result of a test part. class UnitTest; // A collection of test cases. template ::std::string PrintToString(const T& value); namespace internal { struct TraceInfo; // Information about a trace point. class ScopedTrace; // Implements scoped trace. class TestInfoImpl; // Opaque implementation of TestInfo class UnitTestImpl; // Opaque implementation of UnitTest // How many times InitGoogleTest() has been called. extern int g_init_gtest_count; // The text used in failure messages to indicate the start of the // stack trace. GTEST_API_ extern const char kStackTraceMarker[]; // A secret type that Google Test users don't know about. It has no // definition on purpose. Therefore it's impossible to create a // Secret object, which is what we want. class Secret; // Two overloaded helpers for checking at compile time whether an // expression is a null pointer literal (i.e. NULL or any 0-valued // compile-time integral constant). Their return values have // different sizes, so we can use sizeof() to test which version is // picked by the compiler. These helpers have no implementations, as // we only need their signatures. // // Given IsNullLiteralHelper(x), the compiler will pick the first // version if x can be implicitly converted to Secret*, and pick the // second version otherwise. Since Secret is a secret and incomplete // type, the only expression a user can write that has type Secret* is // a null pointer literal. Therefore, we know that x is a null // pointer literal if and only if the first version is picked by the // compiler. char IsNullLiteralHelper(Secret* p); char (&IsNullLiteralHelper(...))[2]; // NOLINT // A compile-time bool constant that is true if and only if x is a // null pointer literal (i.e. NULL or any 0-valued compile-time // integral constant). #ifdef GTEST_ELLIPSIS_NEEDS_POD_ // We lose support for NULL detection where the compiler doesn't like // passing non-POD classes through ellipsis (...). # define GTEST_IS_NULL_LITERAL_(x) false #else # define GTEST_IS_NULL_LITERAL_(x) \ (sizeof(::testing::internal::IsNullLiteralHelper(x)) == 1) #endif // GTEST_ELLIPSIS_NEEDS_POD_ // Appends the user-supplied message to the Google-Test-generated message. GTEST_API_ String AppendUserMessage(const String& gtest_msg, const Message& user_msg); // A helper class for creating scoped traces in user programs. class GTEST_API_ ScopedTrace { public: // The c'tor pushes the given source file location and message onto // a trace stack maintained by Google Test. ScopedTrace(const char* file, int line, const Message& message); // The d'tor pops the info pushed by the c'tor. // // Note that the d'tor is not virtual in order to be efficient. // Don't inherit from ScopedTrace! ~ScopedTrace(); private: GTEST_DISALLOW_COPY_AND_ASSIGN_(ScopedTrace); } GTEST_ATTRIBUTE_UNUSED_; // A ScopedTrace object does its job in its // c'tor and d'tor. Therefore it doesn't // need to be used otherwise. // Converts a streamable value to a String. A NULL pointer is // converted to "(null)". When the input value is a ::string, // ::std::string, ::wstring, or ::std::wstring object, each NUL // character in it is replaced with "\\0". // Declared here but defined in gtest.h, so that it has access // to the definition of the Message class, required by the ARM // compiler. template String StreamableToString(const T& streamable); // The Symbian compiler has a bug that prevents it from selecting the // correct overload of FormatForComparisonFailureMessage (see below) // unless we pass the first argument by reference. If we do that, // however, Visual Age C++ 10.1 generates a compiler error. Therefore // we only apply the work-around for Symbian. #if defined(__SYMBIAN32__) # define GTEST_CREF_WORKAROUND_ const& #else # define GTEST_CREF_WORKAROUND_ #endif // When this operand is a const char* or char*, if the other operand // is a ::std::string or ::string, we print this operand as a C string // rather than a pointer (we do the same for wide strings); otherwise // we print it as a pointer to be safe. // This internal macro is used to avoid duplicated code. #define GTEST_FORMAT_IMPL_(operand2_type, operand1_printer)\ inline String FormatForComparisonFailureMessage(\ operand2_type::value_type* GTEST_CREF_WORKAROUND_ str, \ const operand2_type& /*operand2*/) {\ return operand1_printer(str);\ }\ inline String FormatForComparisonFailureMessage(\ const operand2_type::value_type* GTEST_CREF_WORKAROUND_ str, \ const operand2_type& /*operand2*/) {\ return operand1_printer(str);\ } GTEST_FORMAT_IMPL_(::std::string, String::ShowCStringQuoted) #if GTEST_HAS_STD_WSTRING GTEST_FORMAT_IMPL_(::std::wstring, String::ShowWideCStringQuoted) #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_STRING GTEST_FORMAT_IMPL_(::string, String::ShowCStringQuoted) #endif // GTEST_HAS_GLOBAL_STRING #if GTEST_HAS_GLOBAL_WSTRING GTEST_FORMAT_IMPL_(::wstring, String::ShowWideCStringQuoted) #endif // GTEST_HAS_GLOBAL_WSTRING #undef GTEST_FORMAT_IMPL_ // The next four overloads handle the case where the operand being // printed is a char/wchar_t pointer and the other operand is not a // string/wstring object. In such cases, we just print the operand as // a pointer to be safe. #define GTEST_FORMAT_CHAR_PTR_IMPL_(CharType) \ template \ String FormatForComparisonFailureMessage(CharType* GTEST_CREF_WORKAROUND_ p, \ const T&) { \ return PrintToString(static_cast(p)); \ } GTEST_FORMAT_CHAR_PTR_IMPL_(char) GTEST_FORMAT_CHAR_PTR_IMPL_(const char) GTEST_FORMAT_CHAR_PTR_IMPL_(wchar_t) GTEST_FORMAT_CHAR_PTR_IMPL_(const wchar_t) #undef GTEST_FORMAT_CHAR_PTR_IMPL_ // Constructs and returns the message for an equality assertion // (e.g. ASSERT_EQ, EXPECT_STREQ, etc) failure. // // The first four parameters are the expressions used in the assertion // and their values, as strings. For example, for ASSERT_EQ(foo, bar) // where foo is 5 and bar is 6, we have: // // expected_expression: "foo" // actual_expression: "bar" // expected_value: "5" // actual_value: "6" // // The ignoring_case parameter is true iff the assertion is a // *_STRCASEEQ*. When it's true, the string " (ignoring case)" will // be inserted into the message. GTEST_API_ AssertionResult EqFailure(const char* expected_expression, const char* actual_expression, const String& expected_value, const String& actual_value, bool ignoring_case); // Constructs a failure message for Boolean assertions such as EXPECT_TRUE. GTEST_API_ String GetBoolAssertionFailureMessage( const AssertionResult& assertion_result, const char* expression_text, const char* actual_predicate_value, const char* expected_predicate_value); // This template class represents an IEEE floating-point number // (either single-precision or double-precision, depending on the // template parameters). // // The purpose of this class is to do more sophisticated number // comparison. (Due to round-off error, etc, it's very unlikely that // two floating-points will be equal exactly. Hence a naive // comparison by the == operation often doesn't work.) // // Format of IEEE floating-point: // // The most-significant bit being the leftmost, an IEEE // floating-point looks like // // sign_bit exponent_bits fraction_bits // // Here, sign_bit is a single bit that designates the sign of the // number. // // For float, there are 8 exponent bits and 23 fraction bits. // // For double, there are 11 exponent bits and 52 fraction bits. // // More details can be found at // http://en.wikipedia.org/wiki/IEEE_floating-point_standard. // // Template parameter: // // RawType: the raw floating-point type (either float or double) template class FloatingPoint { public: // Defines the unsigned integer type that has the same size as the // floating point number. typedef typename TypeWithSize::UInt Bits; // Constants. // # of bits in a number. static const size_t kBitCount = 8*sizeof(RawType); // # of fraction bits in a number. static const size_t kFractionBitCount = std::numeric_limits::digits - 1; // # of exponent bits in a number. static const size_t kExponentBitCount = kBitCount - 1 - kFractionBitCount; // The mask for the sign bit. static const Bits kSignBitMask = static_cast(1) << (kBitCount - 1); // The mask for the fraction bits. static const Bits kFractionBitMask = ~static_cast(0) >> (kExponentBitCount + 1); // The mask for the exponent bits. static const Bits kExponentBitMask = ~(kSignBitMask | kFractionBitMask); // How many ULP's (Units in the Last Place) we want to tolerate when // comparing two numbers. The larger the value, the more error we // allow. A 0 value means that two numbers must be exactly the same // to be considered equal. // // The maximum error of a single floating-point operation is 0.5 // units in the last place. On Intel CPU's, all floating-point // calculations are done with 80-bit precision, while double has 64 // bits. Therefore, 4 should be enough for ordinary use. // // See the following article for more details on ULP: // http://www.cygnus-software.com/papers/comparingfloats/comparingfloats.htm. static const size_t kMaxUlps = 4; // Constructs a FloatingPoint from a raw floating-point number. // // On an Intel CPU, passing a non-normalized NAN (Not a Number) // around may change its bits, although the new value is guaranteed // to be also a NAN. Therefore, don't expect this constructor to // preserve the bits in x when x is a NAN. explicit FloatingPoint(const RawType& x) { u_.value_ = x; } // Static methods // Reinterprets a bit pattern as a floating-point number. // // This function is needed to test the AlmostEquals() method. static RawType ReinterpretBits(const Bits bits) { FloatingPoint fp(0); fp.u_.bits_ = bits; return fp.u_.value_; } // Returns the floating-point number that represent positive infinity. static RawType Infinity() { return ReinterpretBits(kExponentBitMask); } // Non-static methods // Returns the bits that represents this number. const Bits &bits() const { return u_.bits_; } // Returns the exponent bits of this number. Bits exponent_bits() const { return kExponentBitMask & u_.bits_; } // Returns the fraction bits of this number. Bits fraction_bits() const { return kFractionBitMask & u_.bits_; } // Returns the sign bit of this number. Bits sign_bit() const { return kSignBitMask & u_.bits_; } // Returns true iff this is NAN (not a number). bool is_nan() const { // It's a NAN if the exponent bits are all ones and the fraction // bits are not entirely zeros. return (exponent_bits() == kExponentBitMask) && (fraction_bits() != 0); } // Returns true iff this number is at most kMaxUlps ULP's away from // rhs. In particular, this function: // // - returns false if either number is (or both are) NAN. // - treats really large numbers as almost equal to infinity. // - thinks +0.0 and -0.0 are 0 DLP's apart. bool AlmostEquals(const FloatingPoint& rhs) const { // The IEEE standard says that any comparison operation involving // a NAN must return false. if (is_nan() || rhs.is_nan()) return false; return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_) <= kMaxUlps; } private: // The data type used to store the actual floating-point number. union FloatingPointUnion { RawType value_; // The raw floating-point number. Bits bits_; // The bits that represent the number. }; // Converts an integer from the sign-and-magnitude representation to // the biased representation. More precisely, let N be 2 to the // power of (kBitCount - 1), an integer x is represented by the // unsigned number x + N. // // For instance, // // -N + 1 (the most negative number representable using // sign-and-magnitude) is represented by 1; // 0 is represented by N; and // N - 1 (the biggest number representable using // sign-and-magnitude) is represented by 2N - 1. // // Read http://en.wikipedia.org/wiki/Signed_number_representations // for more details on signed number representations. static Bits SignAndMagnitudeToBiased(const Bits &sam) { if (kSignBitMask & sam) { // sam represents a negative number. return ~sam + 1; } else { // sam represents a positive number. return kSignBitMask | sam; } } // Given two numbers in the sign-and-magnitude representation, // returns the distance between them as an unsigned number. static Bits DistanceBetweenSignAndMagnitudeNumbers(const Bits &sam1, const Bits &sam2) { const Bits biased1 = SignAndMagnitudeToBiased(sam1); const Bits biased2 = SignAndMagnitudeToBiased(sam2); return (biased1 >= biased2) ? (biased1 - biased2) : (biased2 - biased1); } FloatingPointUnion u_; }; // Typedefs the instances of the FloatingPoint template class that we // care to use. typedef FloatingPoint Float; typedef FloatingPoint Double; // In order to catch the mistake of putting tests that use different // test fixture classes in the same test case, we need to assign // unique IDs to fixture classes and compare them. The TypeId type is // used to hold such IDs. The user should treat TypeId as an opaque // type: the only operation allowed on TypeId values is to compare // them for equality using the == operator. typedef const void* TypeId; template class TypeIdHelper { public: // dummy_ must not have a const type. Otherwise an overly eager // compiler (e.g. MSVC 7.1 & 8.0) may try to merge // TypeIdHelper::dummy_ for different Ts as an "optimization". static bool dummy_; }; template bool TypeIdHelper::dummy_ = false; // GetTypeId() returns the ID of type T. Different values will be // returned for different types. Calling the function twice with the // same type argument is guaranteed to return the same ID. template TypeId GetTypeId() { // The compiler is required to allocate a different // TypeIdHelper::dummy_ variable for each T used to instantiate // the template. Therefore, the address of dummy_ is guaranteed to // be unique. return &(TypeIdHelper::dummy_); } // Returns the type ID of ::testing::Test. Always call this instead // of GetTypeId< ::testing::Test>() to get the type ID of // ::testing::Test, as the latter may give the wrong result due to a // suspected linker bug when compiling Google Test as a Mac OS X // framework. GTEST_API_ TypeId GetTestTypeId(); // Defines the abstract factory interface that creates instances // of a Test object. class TestFactoryBase { public: virtual ~TestFactoryBase() {} // Creates a test instance to run. The instance is both created and destroyed // within TestInfoImpl::Run() virtual Test* CreateTest() = 0; protected: TestFactoryBase() {} private: GTEST_DISALLOW_COPY_AND_ASSIGN_(TestFactoryBase); }; // This class provides implementation of TeastFactoryBase interface. // It is used in TEST and TEST_F macros. template class TestFactoryImpl : public TestFactoryBase { public: virtual Test* CreateTest() { return new TestClass; } }; #if GTEST_OS_WINDOWS // Predicate-formatters for implementing the HRESULT checking macros // {ASSERT|EXPECT}_HRESULT_{SUCCEEDED|FAILED} // We pass a long instead of HRESULT to avoid causing an // include dependency for the HRESULT type. GTEST_API_ AssertionResult IsHRESULTSuccess(const char* expr, long hr); // NOLINT GTEST_API_ AssertionResult IsHRESULTFailure(const char* expr, long hr); // NOLINT #endif // GTEST_OS_WINDOWS // Types of SetUpTestCase() and TearDownTestCase() functions. typedef void (*SetUpTestCaseFunc)(); typedef void (*TearDownTestCaseFunc)(); // Creates a new TestInfo object and registers it with Google Test; // returns the created object. // // Arguments: // // test_case_name: name of the test case // name: name of the test // type_param the name of the test's type parameter, or NULL if // this is not a typed or a type-parameterized test. // value_param text representation of the test's value parameter, // or NULL if this is not a type-parameterized test. // fixture_class_id: ID of the test fixture class // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case // factory: pointer to the factory that creates a test object. // The newly created TestInfo instance will assume // ownership of the factory object. GTEST_API_ TestInfo* MakeAndRegisterTestInfo( const char* test_case_name, const char* name, const char* type_param, const char* value_param, TypeId fixture_class_id, SetUpTestCaseFunc set_up_tc, TearDownTestCaseFunc tear_down_tc, TestFactoryBase* factory); // If *pstr starts with the given prefix, modifies *pstr to be right // past the prefix and returns true; otherwise leaves *pstr unchanged // and returns false. None of pstr, *pstr, and prefix can be NULL. GTEST_API_ bool SkipPrefix(const char* prefix, const char** pstr); #if GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P // State of the definition of a type-parameterized test case. class GTEST_API_ TypedTestCasePState { public: TypedTestCasePState() : registered_(false) {} // Adds the given test name to defined_test_names_ and return true // if the test case hasn't been registered; otherwise aborts the // program. bool AddTestName(const char* file, int line, const char* case_name, const char* test_name) { if (registered_) { fprintf(stderr, "%s Test %s must be defined before " "REGISTER_TYPED_TEST_CASE_P(%s, ...).\n", FormatFileLocation(file, line).c_str(), test_name, case_name); fflush(stderr); posix::Abort(); } defined_test_names_.insert(test_name); return true; } // Verifies that registered_tests match the test names in // defined_test_names_; returns registered_tests if successful, or // aborts the program otherwise. const char* VerifyRegisteredTestNames( const char* file, int line, const char* registered_tests); private: bool registered_; ::std::set defined_test_names_; }; // Skips to the first non-space char after the first comma in 'str'; // returns NULL if no comma is found in 'str'. inline const char* SkipComma(const char* str) { const char* comma = strchr(str, ','); if (comma == NULL) { return NULL; } while (IsSpace(*(++comma))) {} return comma; } // Returns the prefix of 'str' before the first comma in it; returns // the entire string if it contains no comma. inline String GetPrefixUntilComma(const char* str) { const char* comma = strchr(str, ','); return comma == NULL ? String(str) : String(str, comma - str); } // TypeParameterizedTest::Register() // registers a list of type-parameterized tests with Google Test. The // return value is insignificant - we just need to return something // such that we can call this function in a namespace scope. // // Implementation note: The GTEST_TEMPLATE_ macro declares a template // template parameter. It's defined in gtest-type-util.h. template class TypeParameterizedTest { public: // 'index' is the index of the test in the type list 'Types' // specified in INSTANTIATE_TYPED_TEST_CASE_P(Prefix, TestCase, // Types). Valid values for 'index' are [0, N - 1] where N is the // length of Types. static bool Register(const char* prefix, const char* case_name, const char* test_names, int index) { typedef typename Types::Head Type; typedef Fixture FixtureClass; typedef typename GTEST_BIND_(TestSel, Type) TestClass; // First, registers the first type-parameterized test in the type // list. MakeAndRegisterTestInfo( String::Format("%s%s%s/%d", prefix, prefix[0] == '\0' ? "" : "/", case_name, index).c_str(), GetPrefixUntilComma(test_names).c_str(), GetTypeName().c_str(), NULL, // No value parameter. GetTypeId(), TestClass::SetUpTestCase, TestClass::TearDownTestCase, new TestFactoryImpl); // Next, recurses (at compile time) with the tail of the type list. return TypeParameterizedTest ::Register(prefix, case_name, test_names, index + 1); } }; // The base case for the compile time recursion. template class TypeParameterizedTest { public: static bool Register(const char* /*prefix*/, const char* /*case_name*/, const char* /*test_names*/, int /*index*/) { return true; } }; // TypeParameterizedTestCase::Register() // registers *all combinations* of 'Tests' and 'Types' with Google // Test. The return value is insignificant - we just need to return // something such that we can call this function in a namespace scope. template class TypeParameterizedTestCase { public: static bool Register(const char* prefix, const char* case_name, const char* test_names) { typedef typename Tests::Head Head; // First, register the first test in 'Test' for each type in 'Types'. TypeParameterizedTest::Register( prefix, case_name, test_names, 0); // Next, recurses (at compile time) with the tail of the test list. return TypeParameterizedTestCase ::Register(prefix, case_name, SkipComma(test_names)); } }; // The base case for the compile time recursion. template class TypeParameterizedTestCase { public: static bool Register(const char* /*prefix*/, const char* /*case_name*/, const char* /*test_names*/) { return true; } }; #endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P // Returns the current OS stack trace as a String. // // The maximum number of stack frames to be included is specified by // the gtest_stack_trace_depth flag. The skip_count parameter // specifies the number of top frames to be skipped, which doesn't // count against the number of frames to be included. // // For example, if Foo() calls Bar(), which in turn calls // GetCurrentOsStackTraceExceptTop(..., 1), Foo() will be included in // the trace but Bar() and GetCurrentOsStackTraceExceptTop() won't. GTEST_API_ String GetCurrentOsStackTraceExceptTop(UnitTest* unit_test, int skip_count); // Helpers for suppressing warnings on unreachable code or constant // condition. // Always returns true. GTEST_API_ bool AlwaysTrue(); // Always returns false. inline bool AlwaysFalse() { return !AlwaysTrue(); } // Helper for suppressing false warning from Clang on a const char* // variable declared in a conditional expression always being NULL in // the else branch. struct GTEST_API_ ConstCharPtr { ConstCharPtr(const char* str) : value(str) {} operator bool() const { return true; } const char* value; }; // A simple Linear Congruential Generator for generating random // numbers with a uniform distribution. Unlike rand() and srand(), it // doesn't use global state (and therefore can't interfere with user // code). Unlike rand_r(), it's portable. An LCG isn't very random, // but it's good enough for our purposes. class GTEST_API_ Random { public: static const UInt32 kMaxRange = 1u << 31; explicit Random(UInt32 seed) : state_(seed) {} void Reseed(UInt32 seed) { state_ = seed; } // Generates a random number from [0, range). Crashes if 'range' is // 0 or greater than kMaxRange. UInt32 Generate(UInt32 range); private: UInt32 state_; GTEST_DISALLOW_COPY_AND_ASSIGN_(Random); }; // Defining a variable of type CompileAssertTypesEqual will cause a // compiler error iff T1 and T2 are different types. template struct CompileAssertTypesEqual; template struct CompileAssertTypesEqual { }; // Removes the reference from a type if it is a reference type, // otherwise leaves it unchanged. This is the same as // tr1::remove_reference, which is not widely available yet. template struct RemoveReference { typedef T type; }; // NOLINT template struct RemoveReference { typedef T type; }; // NOLINT // A handy wrapper around RemoveReference that works when the argument // T depends on template parameters. #define GTEST_REMOVE_REFERENCE_(T) \ typename ::testing::internal::RemoveReference::type // Removes const from a type if it is a const type, otherwise leaves // it unchanged. This is the same as tr1::remove_const, which is not // widely available yet. template struct RemoveConst { typedef T type; }; // NOLINT template struct RemoveConst { typedef T type; }; // NOLINT // MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above // definition to fail to remove the const in 'const int[3]' and 'const // char[3][4]'. The following specialization works around the bug. // However, it causes trouble with GCC and thus needs to be // conditionally compiled. #if defined(_MSC_VER) || defined(__SUNPRO_CC) || defined(__IBMCPP__) template struct RemoveConst { typedef typename RemoveConst::type type[N]; }; #endif // A handy wrapper around RemoveConst that works when the argument // T depends on template parameters. #define GTEST_REMOVE_CONST_(T) \ typename ::testing::internal::RemoveConst::type // Turns const U&, U&, const U, and U all into U. #define GTEST_REMOVE_REFERENCE_AND_CONST_(T) \ GTEST_REMOVE_CONST_(GTEST_REMOVE_REFERENCE_(T)) // Adds reference to a type if it is not a reference type, // otherwise leaves it unchanged. This is the same as // tr1::add_reference, which is not widely available yet. template struct AddReference { typedef T& type; }; // NOLINT template struct AddReference { typedef T& type; }; // NOLINT // A handy wrapper around AddReference that works when the argument T // depends on template parameters. #define GTEST_ADD_REFERENCE_(T) \ typename ::testing::internal::AddReference::type // Adds a reference to const on top of T as necessary. For example, // it transforms // // char ==> const char& // const char ==> const char& // char& ==> const char& // const char& ==> const char& // // The argument T must depend on some template parameters. #define GTEST_REFERENCE_TO_CONST_(T) \ GTEST_ADD_REFERENCE_(const GTEST_REMOVE_REFERENCE_(T)) // ImplicitlyConvertible::value is a compile-time bool // constant that's true iff type From can be implicitly converted to // type To. template class ImplicitlyConvertible { private: // We need the following helper functions only for their types. // They have no implementations. // MakeFrom() is an expression whose type is From. We cannot simply // use From(), as the type From may not have a public default // constructor. static From MakeFrom(); // These two functions are overloaded. Given an expression // Helper(x), the compiler will pick the first version if x can be // implicitly converted to type To; otherwise it will pick the // second version. // // The first version returns a value of size 1, and the second // version returns a value of size 2. Therefore, by checking the // size of Helper(x), which can be done at compile time, we can tell // which version of Helper() is used, and hence whether x can be // implicitly converted to type To. static char Helper(To); static char (&Helper(...))[2]; // NOLINT // We have to put the 'public' section after the 'private' section, // or MSVC refuses to compile the code. public: // MSVC warns about implicitly converting from double to int for // possible loss of data, so we need to temporarily disable the // warning. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4244) // Temporarily disables warning 4244. static const bool value = sizeof(Helper(ImplicitlyConvertible::MakeFrom())) == 1; # pragma warning(pop) // Restores the warning state. #elif defined(__BORLANDC__) // C++Builder cannot use member overload resolution during template // instantiation. The simplest workaround is to use its C++0x type traits // functions (C++Builder 2009 and above only). static const bool value = __is_convertible(From, To); #else static const bool value = sizeof(Helper(ImplicitlyConvertible::MakeFrom())) == 1; #endif // _MSV_VER }; template const bool ImplicitlyConvertible::value; // IsAProtocolMessage::value is a compile-time bool constant that's // true iff T is type ProtocolMessage, proto2::Message, or a subclass // of those. template struct IsAProtocolMessage : public bool_constant< ImplicitlyConvertible::value || ImplicitlyConvertible::value> { }; // When the compiler sees expression IsContainerTest(0), if C is an // STL-style container class, the first overload of IsContainerTest // will be viable (since both C::iterator* and C::const_iterator* are // valid types and NULL can be implicitly converted to them). It will // be picked over the second overload as 'int' is a perfect match for // the type of argument 0. If C::iterator or C::const_iterator is not // a valid type, the first overload is not viable, and the second // overload will be picked. Therefore, we can determine whether C is // a container class by checking the type of IsContainerTest(0). // The value of the expression is insignificant. // // Note that we look for both C::iterator and C::const_iterator. The // reason is that C++ injects the name of a class as a member of the // class itself (e.g. you can refer to class iterator as either // 'iterator' or 'iterator::iterator'). If we look for C::iterator // only, for example, we would mistakenly think that a class named // iterator is an STL container. // // Also note that the simpler approach of overloading // IsContainerTest(typename C::const_iterator*) and // IsContainerTest(...) doesn't work with Visual Age C++ and Sun C++. typedef int IsContainer; template IsContainer IsContainerTest(int /* dummy */, typename C::iterator* /* it */ = NULL, typename C::const_iterator* /* const_it */ = NULL) { return 0; } typedef char IsNotContainer; template IsNotContainer IsContainerTest(long /* dummy */) { return '\0'; } // EnableIf::type is void when 'Cond' is true, and // undefined when 'Cond' is false. To use SFINAE to make a function // overload only apply when a particular expression is true, add // "typename EnableIf::type* = 0" as the last parameter. template struct EnableIf; template<> struct EnableIf { typedef void type; }; // NOLINT // Utilities for native arrays. // ArrayEq() compares two k-dimensional native arrays using the // elements' operator==, where k can be any integer >= 0. When k is // 0, ArrayEq() degenerates into comparing a single pair of values. template bool ArrayEq(const T* lhs, size_t size, const U* rhs); // This generic version is used when k is 0. template inline bool ArrayEq(const T& lhs, const U& rhs) { return lhs == rhs; } // This overload is used when k >= 1. template inline bool ArrayEq(const T(&lhs)[N], const U(&rhs)[N]) { return internal::ArrayEq(lhs, N, rhs); } // This helper reduces code bloat. If we instead put its logic inside // the previous ArrayEq() function, arrays with different sizes would // lead to different copies of the template code. template bool ArrayEq(const T* lhs, size_t size, const U* rhs) { for (size_t i = 0; i != size; i++) { if (!internal::ArrayEq(lhs[i], rhs[i])) return false; } return true; } // Finds the first element in the iterator range [begin, end) that // equals elem. Element may be a native array type itself. template Iter ArrayAwareFind(Iter begin, Iter end, const Element& elem) { for (Iter it = begin; it != end; ++it) { if (internal::ArrayEq(*it, elem)) return it; } return end; } // CopyArray() copies a k-dimensional native array using the elements' // operator=, where k can be any integer >= 0. When k is 0, // CopyArray() degenerates into copying a single value. template void CopyArray(const T* from, size_t size, U* to); // This generic version is used when k is 0. template inline void CopyArray(const T& from, U* to) { *to = from; } // This overload is used when k >= 1. template inline void CopyArray(const T(&from)[N], U(*to)[N]) { internal::CopyArray(from, N, *to); } // This helper reduces code bloat. If we instead put its logic inside // the previous CopyArray() function, arrays with different sizes // would lead to different copies of the template code. template void CopyArray(const T* from, size_t size, U* to) { for (size_t i = 0; i != size; i++) { internal::CopyArray(from[i], to + i); } } // The relation between an NativeArray object (see below) and the // native array it represents. enum RelationToSource { kReference, // The NativeArray references the native array. kCopy // The NativeArray makes a copy of the native array and // owns the copy. }; // Adapts a native array to a read-only STL-style container. Instead // of the complete STL container concept, this adaptor only implements // members useful for Google Mock's container matchers. New members // should be added as needed. To simplify the implementation, we only // support Element being a raw type (i.e. having no top-level const or // reference modifier). It's the client's responsibility to satisfy // this requirement. Element can be an array type itself (hence // multi-dimensional arrays are supported). template class NativeArray { public: // STL-style container typedefs. typedef Element value_type; typedef Element* iterator; typedef const Element* const_iterator; // Constructs from a native array. NativeArray(const Element* array, size_t count, RelationToSource relation) { Init(array, count, relation); } // Copy constructor. NativeArray(const NativeArray& rhs) { Init(rhs.array_, rhs.size_, rhs.relation_to_source_); } ~NativeArray() { // Ensures that the user doesn't instantiate NativeArray with a // const or reference type. static_cast(StaticAssertTypeEqHelper()); if (relation_to_source_ == kCopy) delete[] array_; } // STL-style container methods. size_t size() const { return size_; } const_iterator begin() const { return array_; } const_iterator end() const { return array_ + size_; } bool operator==(const NativeArray& rhs) const { return size() == rhs.size() && ArrayEq(begin(), size(), rhs.begin()); } private: // Initializes this object; makes a copy of the input array if // 'relation' is kCopy. void Init(const Element* array, size_t a_size, RelationToSource relation) { if (relation == kReference) { array_ = array; } else { Element* const copy = new Element[a_size]; CopyArray(array, a_size, copy); array_ = copy; } size_ = a_size; relation_to_source_ = relation; } const Element* array_; size_t size_; RelationToSource relation_to_source_; GTEST_DISALLOW_ASSIGN_(NativeArray); }; } // namespace internal } // namespace testing #define GTEST_MESSAGE_AT_(file, line, message, result_type) \ ::testing::internal::AssertHelper(result_type, file, line, message) \ = ::testing::Message() #define GTEST_MESSAGE_(message, result_type) \ GTEST_MESSAGE_AT_(__FILE__, __LINE__, message, result_type) #define GTEST_FATAL_FAILURE_(message) \ return GTEST_MESSAGE_(message, ::testing::TestPartResult::kFatalFailure) #define GTEST_NONFATAL_FAILURE_(message) \ GTEST_MESSAGE_(message, ::testing::TestPartResult::kNonFatalFailure) #define GTEST_SUCCESS_(message) \ GTEST_MESSAGE_(message, ::testing::TestPartResult::kSuccess) // Suppresses MSVC warnings 4072 (unreachable code) for the code following // statement if it returns or throws (or doesn't return or throw in some // situations). #define GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) \ if (::testing::internal::AlwaysTrue()) { statement; } #define GTEST_TEST_THROW_(statement, expected_exception, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::ConstCharPtr gtest_msg = "") { \ bool gtest_caught_expected = false; \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } \ catch (expected_exception const&) { \ gtest_caught_expected = true; \ } \ catch (...) { \ gtest_msg.value = \ "Expected: " #statement " throws an exception of type " \ #expected_exception ".\n Actual: it throws a different type."; \ goto GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__); \ } \ if (!gtest_caught_expected) { \ gtest_msg.value = \ "Expected: " #statement " throws an exception of type " \ #expected_exception ".\n Actual: it throws nothing."; \ goto GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__): \ fail(gtest_msg.value) #define GTEST_TEST_NO_THROW_(statement, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } \ catch (...) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_testnothrow_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testnothrow_, __LINE__): \ fail("Expected: " #statement " doesn't throw an exception.\n" \ " Actual: it throws.") #define GTEST_TEST_ANY_THROW_(statement, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ bool gtest_caught_any = false; \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } \ catch (...) { \ gtest_caught_any = true; \ } \ if (!gtest_caught_any) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_testanythrow_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testanythrow_, __LINE__): \ fail("Expected: " #statement " throws an exception.\n" \ " Actual: it doesn't.") // Implements Boolean test assertions such as EXPECT_TRUE. expression can be // either a boolean expression or an AssertionResult. text is a textual // represenation of expression as it was passed into the EXPECT_TRUE. #define GTEST_TEST_BOOLEAN_(expression, text, actual, expected, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (const ::testing::AssertionResult gtest_ar_ = \ ::testing::AssertionResult(expression)) \ ; \ else \ fail(::testing::internal::GetBoolAssertionFailureMessage(\ gtest_ar_, text, #actual, #expected).c_str()) #define GTEST_TEST_NO_FATAL_FAILURE_(statement, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ ::testing::internal::HasNewFatalFailureHelper gtest_fatal_failure_checker; \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ if (gtest_fatal_failure_checker.has_new_fatal_failure()) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_testnofatal_, __LINE__); \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_testnofatal_, __LINE__): \ fail("Expected: " #statement " doesn't generate new fatal " \ "failures in the current thread.\n" \ " Actual: it does.") // Expands to the name of the class that implements the given test. #define GTEST_TEST_CLASS_NAME_(test_case_name, test_name) \ test_case_name##_##test_name##_Test // Helper macro for defining tests. #define GTEST_TEST_(test_case_name, test_name, parent_class, parent_id)\ class GTEST_TEST_CLASS_NAME_(test_case_name, test_name) : public parent_class {\ public:\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {}\ private:\ virtual void TestBody();\ static ::testing::TestInfo* const test_info_ GTEST_ATTRIBUTE_UNUSED_;\ GTEST_DISALLOW_COPY_AND_ASSIGN_(\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name));\ };\ \ ::testing::TestInfo* const GTEST_TEST_CLASS_NAME_(test_case_name, test_name)\ ::test_info_ =\ ::testing::internal::MakeAndRegisterTestInfo(\ #test_case_name, #test_name, NULL, NULL, \ (parent_id), \ parent_class::SetUpTestCase, \ parent_class::TearDownTestCase, \ new ::testing::internal::TestFactoryImpl<\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)>);\ void GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody() #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // // This header file defines the public API for death tests. It is // #included by gtest.h so a user doesn't need to include this // directly. #ifndef GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Authors: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) // // The Google C++ Testing Framework (Google Test) // // This header file defines internal utilities needed for implementing // death tests. They are subject to change without notice. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ #include namespace testing { namespace internal { GTEST_DECLARE_string_(internal_run_death_test); // Names of the flags (needed for parsing Google Test flags). const char kDeathTestStyleFlag[] = "death_test_style"; const char kDeathTestUseFork[] = "death_test_use_fork"; const char kInternalRunDeathTestFlag[] = "internal_run_death_test"; #if GTEST_HAS_DEATH_TEST // DeathTest is a class that hides much of the complexity of the // GTEST_DEATH_TEST_ macro. It is abstract; its static Create method // returns a concrete class that depends on the prevailing death test // style, as defined by the --gtest_death_test_style and/or // --gtest_internal_run_death_test flags. // In describing the results of death tests, these terms are used with // the corresponding definitions: // // exit status: The integer exit information in the format specified // by wait(2) // exit code: The integer code passed to exit(3), _exit(2), or // returned from main() class GTEST_API_ DeathTest { public: // Create returns false if there was an error determining the // appropriate action to take for the current death test; for example, // if the gtest_death_test_style flag is set to an invalid value. // The LastMessage method will return a more detailed message in that // case. Otherwise, the DeathTest pointer pointed to by the "test" // argument is set. If the death test should be skipped, the pointer // is set to NULL; otherwise, it is set to the address of a new concrete // DeathTest object that controls the execution of the current test. static bool Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test); DeathTest(); virtual ~DeathTest() { } // A helper class that aborts a death test when it's deleted. class ReturnSentinel { public: explicit ReturnSentinel(DeathTest* test) : test_(test) { } ~ReturnSentinel() { test_->Abort(TEST_ENCOUNTERED_RETURN_STATEMENT); } private: DeathTest* const test_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ReturnSentinel); } GTEST_ATTRIBUTE_UNUSED_; // An enumeration of possible roles that may be taken when a death // test is encountered. EXECUTE means that the death test logic should // be executed immediately. OVERSEE means that the program should prepare // the appropriate environment for a child process to execute the death // test, then wait for it to complete. enum TestRole { OVERSEE_TEST, EXECUTE_TEST }; // An enumeration of the three reasons that a test might be aborted. enum AbortReason { TEST_ENCOUNTERED_RETURN_STATEMENT, TEST_THREW_EXCEPTION, TEST_DID_NOT_DIE }; // Assumes one of the above roles. virtual TestRole AssumeRole() = 0; // Waits for the death test to finish and returns its status. virtual int Wait() = 0; // Returns true if the death test passed; that is, the test process // exited during the test, its exit status matches a user-supplied // predicate, and its stderr output matches a user-supplied regular // expression. // The user-supplied predicate may be a macro expression rather // than a function pointer or functor, or else Wait and Passed could // be combined. virtual bool Passed(bool exit_status_ok) = 0; // Signals that the death test did not die as expected. virtual void Abort(AbortReason reason) = 0; // Returns a human-readable outcome message regarding the outcome of // the last death test. static const char* LastMessage(); static void set_last_death_test_message(const String& message); private: // A string containing a description of the outcome of the last death test. static String last_death_test_message_; GTEST_DISALLOW_COPY_AND_ASSIGN_(DeathTest); }; // Factory interface for death tests. May be mocked out for testing. class DeathTestFactory { public: virtual ~DeathTestFactory() { } virtual bool Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test) = 0; }; // A concrete DeathTestFactory implementation for normal use. class DefaultDeathTestFactory : public DeathTestFactory { public: virtual bool Create(const char* statement, const RE* regex, const char* file, int line, DeathTest** test); }; // Returns true if exit_status describes a process that was terminated // by a signal, or exited normally with a nonzero exit code. GTEST_API_ bool ExitedUnsuccessfully(int exit_status); // Traps C++ exceptions escaping statement and reports them as test // failures. Note that trapping SEH exceptions is not implemented here. # if GTEST_HAS_EXCEPTIONS # define GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, death_test) \ try { \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ } catch (const ::std::exception& gtest_exception) { \ fprintf(\ stderr, \ "\n%s: Caught std::exception-derived exception escaping the " \ "death test statement. Exception message: %s\n", \ ::testing::internal::FormatFileLocation(__FILE__, __LINE__).c_str(), \ gtest_exception.what()); \ fflush(stderr); \ death_test->Abort(::testing::internal::DeathTest::TEST_THREW_EXCEPTION); \ } catch (...) { \ death_test->Abort(::testing::internal::DeathTest::TEST_THREW_EXCEPTION); \ } # else # define GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, death_test) \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) # endif // This macro is for implementing ASSERT_DEATH*, EXPECT_DEATH*, // ASSERT_EXIT*, and EXPECT_EXIT*. # define GTEST_DEATH_TEST_(statement, predicate, regex, fail) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ const ::testing::internal::RE& gtest_regex = (regex); \ ::testing::internal::DeathTest* gtest_dt; \ if (!::testing::internal::DeathTest::Create(#statement, >est_regex, \ __FILE__, __LINE__, >est_dt)) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__); \ } \ if (gtest_dt != NULL) { \ ::testing::internal::scoped_ptr< ::testing::internal::DeathTest> \ gtest_dt_ptr(gtest_dt); \ switch (gtest_dt->AssumeRole()) { \ case ::testing::internal::DeathTest::OVERSEE_TEST: \ if (!gtest_dt->Passed(predicate(gtest_dt->Wait()))) { \ goto GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__); \ } \ break; \ case ::testing::internal::DeathTest::EXECUTE_TEST: { \ ::testing::internal::DeathTest::ReturnSentinel \ gtest_sentinel(gtest_dt); \ GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, gtest_dt); \ gtest_dt->Abort(::testing::internal::DeathTest::TEST_DID_NOT_DIE); \ break; \ } \ default: \ break; \ } \ } \ } else \ GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__): \ fail(::testing::internal::DeathTest::LastMessage()) // The symbol "fail" here expands to something into which a message // can be streamed. // A class representing the parsed contents of the // --gtest_internal_run_death_test flag, as it existed when // RUN_ALL_TESTS was called. class InternalRunDeathTestFlag { public: InternalRunDeathTestFlag(const String& a_file, int a_line, int an_index, int a_write_fd) : file_(a_file), line_(a_line), index_(an_index), write_fd_(a_write_fd) {} ~InternalRunDeathTestFlag() { if (write_fd_ >= 0) posix::Close(write_fd_); } String file() const { return file_; } int line() const { return line_; } int index() const { return index_; } int write_fd() const { return write_fd_; } private: String file_; int line_; int index_; int write_fd_; GTEST_DISALLOW_COPY_AND_ASSIGN_(InternalRunDeathTestFlag); }; // Returns a newly created InternalRunDeathTestFlag object with fields // initialized from the GTEST_FLAG(internal_run_death_test) flag if // the flag is specified; otherwise returns NULL. InternalRunDeathTestFlag* ParseInternalRunDeathTestFlag(); #else // GTEST_HAS_DEATH_TEST // This macro is used for implementing macros such as // EXPECT_DEATH_IF_SUPPORTED and ASSERT_DEATH_IF_SUPPORTED on systems where // death tests are not supported. Those macros must compile on such systems // iff EXPECT_DEATH and ASSERT_DEATH compile with the same parameters on // systems that support death tests. This allows one to write such a macro // on a system that does not support death tests and be sure that it will // compile on a death-test supporting system. // // Parameters: // statement - A statement that a macro such as EXPECT_DEATH would test // for program termination. This macro has to make sure this // statement is compiled but not executed, to ensure that // EXPECT_DEATH_IF_SUPPORTED compiles with a certain // parameter iff EXPECT_DEATH compiles with it. // regex - A regex that a macro such as EXPECT_DEATH would use to test // the output of statement. This parameter has to be // compiled but not evaluated by this macro, to ensure that // this macro only accepts expressions that a macro such as // EXPECT_DEATH would accept. // terminator - Must be an empty statement for EXPECT_DEATH_IF_SUPPORTED // and a return statement for ASSERT_DEATH_IF_SUPPORTED. // This ensures that ASSERT_DEATH_IF_SUPPORTED will not // compile inside functions where ASSERT_DEATH doesn't // compile. // // The branch that has an always false condition is used to ensure that // statement and regex are compiled (and thus syntactically correct) but // never executed. The unreachable code macro protects the terminator // statement from generating an 'unreachable code' warning in case // statement unconditionally returns or throws. The Message constructor at // the end allows the syntax of streaming additional messages into the // macro, for compilational compatibility with EXPECT_DEATH/ASSERT_DEATH. # define GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, terminator) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (::testing::internal::AlwaysTrue()) { \ GTEST_LOG_(WARNING) \ << "Death tests are not supported on this platform.\n" \ << "Statement '" #statement "' cannot be verified."; \ } else if (::testing::internal::AlwaysFalse()) { \ ::testing::internal::RE::PartialMatch(".*", (regex)); \ GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ terminator; \ } else \ ::testing::Message() #endif // GTEST_HAS_DEATH_TEST } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ namespace testing { // This flag controls the style of death tests. Valid values are "threadsafe", // meaning that the death test child process will re-execute the test binary // from the start, running only a single death test, or "fast", // meaning that the child process will execute the test logic immediately // after forking. GTEST_DECLARE_string_(death_test_style); #if GTEST_HAS_DEATH_TEST // The following macros are useful for writing death tests. // Here's what happens when an ASSERT_DEATH* or EXPECT_DEATH* is // executed: // // 1. It generates a warning if there is more than one active // thread. This is because it's safe to fork() or clone() only // when there is a single thread. // // 2. The parent process clone()s a sub-process and runs the death // test in it; the sub-process exits with code 0 at the end of the // death test, if it hasn't exited already. // // 3. The parent process waits for the sub-process to terminate. // // 4. The parent process checks the exit code and error message of // the sub-process. // // Examples: // // ASSERT_DEATH(server.SendMessage(56, "Hello"), "Invalid port number"); // for (int i = 0; i < 5; i++) { // EXPECT_DEATH(server.ProcessRequest(i), // "Invalid request .* in ProcessRequest()") // << "Failed to die on request " << i); // } // // ASSERT_EXIT(server.ExitNow(), ::testing::ExitedWithCode(0), "Exiting"); // // bool KilledBySIGHUP(int exit_code) { // return WIFSIGNALED(exit_code) && WTERMSIG(exit_code) == SIGHUP; // } // // ASSERT_EXIT(client.HangUpServer(), KilledBySIGHUP, "Hanging up!"); // // On the regular expressions used in death tests: // // On POSIX-compliant systems (*nix), we use the library, // which uses the POSIX extended regex syntax. // // On other platforms (e.g. Windows), we only support a simple regex // syntax implemented as part of Google Test. This limited // implementation should be enough most of the time when writing // death tests; though it lacks many features you can find in PCRE // or POSIX extended regex syntax. For example, we don't support // union ("x|y"), grouping ("(xy)"), brackets ("[xy]"), and // repetition count ("x{5,7}"), among others. // // Below is the syntax that we do support. We chose it to be a // subset of both PCRE and POSIX extended regex, so it's easy to // learn wherever you come from. In the following: 'A' denotes a // literal character, period (.), or a single \\ escape sequence; // 'x' and 'y' denote regular expressions; 'm' and 'n' are for // natural numbers. // // c matches any literal character c // \\d matches any decimal digit // \\D matches any character that's not a decimal digit // \\f matches \f // \\n matches \n // \\r matches \r // \\s matches any ASCII whitespace, including \n // \\S matches any character that's not a whitespace // \\t matches \t // \\v matches \v // \\w matches any letter, _, or decimal digit // \\W matches any character that \\w doesn't match // \\c matches any literal character c, which must be a punctuation // . matches any single character except \n // A? matches 0 or 1 occurrences of A // A* matches 0 or many occurrences of A // A+ matches 1 or many occurrences of A // ^ matches the beginning of a string (not that of each line) // $ matches the end of a string (not that of each line) // xy matches x followed by y // // If you accidentally use PCRE or POSIX extended regex features // not implemented by us, you will get a run-time failure. In that // case, please try to rewrite your regular expression within the // above syntax. // // This implementation is *not* meant to be as highly tuned or robust // as a compiled regex library, but should perform well enough for a // death test, which already incurs significant overhead by launching // a child process. // // Known caveats: // // A "threadsafe" style death test obtains the path to the test // program from argv[0] and re-executes it in the sub-process. For // simplicity, the current implementation doesn't search the PATH // when launching the sub-process. This means that the user must // invoke the test program via a path that contains at least one // path separator (e.g. path/to/foo_test and // /absolute/path/to/bar_test are fine, but foo_test is not). This // is rarely a problem as people usually don't put the test binary // directory in PATH. // // TODO(wan@google.com): make thread-safe death tests search the PATH. // Asserts that a given statement causes the program to exit, with an // integer exit status that satisfies predicate, and emitting error output // that matches regex. # define ASSERT_EXIT(statement, predicate, regex) \ GTEST_DEATH_TEST_(statement, predicate, regex, GTEST_FATAL_FAILURE_) // Like ASSERT_EXIT, but continues on to successive tests in the // test case, if any: # define EXPECT_EXIT(statement, predicate, regex) \ GTEST_DEATH_TEST_(statement, predicate, regex, GTEST_NONFATAL_FAILURE_) // Asserts that a given statement causes the program to exit, either by // explicitly exiting with a nonzero exit code or being killed by a // signal, and emitting error output that matches regex. # define ASSERT_DEATH(statement, regex) \ ASSERT_EXIT(statement, ::testing::internal::ExitedUnsuccessfully, regex) // Like ASSERT_DEATH, but continues on to successive tests in the // test case, if any: # define EXPECT_DEATH(statement, regex) \ EXPECT_EXIT(statement, ::testing::internal::ExitedUnsuccessfully, regex) // Two predicate classes that can be used in {ASSERT,EXPECT}_EXIT*: // Tests that an exit code describes a normal exit with a given exit code. class GTEST_API_ ExitedWithCode { public: explicit ExitedWithCode(int exit_code); bool operator()(int exit_status) const; private: // No implementation - assignment is unsupported. void operator=(const ExitedWithCode& other); const int exit_code_; }; # if !GTEST_OS_WINDOWS // Tests that an exit code describes an exit due to termination by a // given signal. class GTEST_API_ KilledBySignal { public: explicit KilledBySignal(int signum); bool operator()(int exit_status) const; private: const int signum_; }; # endif // !GTEST_OS_WINDOWS // EXPECT_DEBUG_DEATH asserts that the given statements die in debug mode. // The death testing framework causes this to have interesting semantics, // since the sideeffects of the call are only visible in opt mode, and not // in debug mode. // // In practice, this can be used to test functions that utilize the // LOG(DFATAL) macro using the following style: // // int DieInDebugOr12(int* sideeffect) { // if (sideeffect) { // *sideeffect = 12; // } // LOG(DFATAL) << "death"; // return 12; // } // // TEST(TestCase, TestDieOr12WorksInDgbAndOpt) { // int sideeffect = 0; // // Only asserts in dbg. // EXPECT_DEBUG_DEATH(DieInDebugOr12(&sideeffect), "death"); // // #ifdef NDEBUG // // opt-mode has sideeffect visible. // EXPECT_EQ(12, sideeffect); // #else // // dbg-mode no visible sideeffect. // EXPECT_EQ(0, sideeffect); // #endif // } // // This will assert that DieInDebugReturn12InOpt() crashes in debug // mode, usually due to a DCHECK or LOG(DFATAL), but returns the // appropriate fallback value (12 in this case) in opt mode. If you // need to test that a function has appropriate side-effects in opt // mode, include assertions against the side-effects. A general // pattern for this is: // // EXPECT_DEBUG_DEATH({ // // Side-effects here will have an effect after this statement in // // opt mode, but none in debug mode. // EXPECT_EQ(12, DieInDebugOr12(&sideeffect)); // }, "death"); // # ifdef NDEBUG # define EXPECT_DEBUG_DEATH(statement, regex) \ do { statement; } while (::testing::internal::AlwaysFalse()) # define ASSERT_DEBUG_DEATH(statement, regex) \ do { statement; } while (::testing::internal::AlwaysFalse()) # else # define EXPECT_DEBUG_DEATH(statement, regex) \ EXPECT_DEATH(statement, regex) # define ASSERT_DEBUG_DEATH(statement, regex) \ ASSERT_DEATH(statement, regex) # endif // NDEBUG for EXPECT_DEBUG_DEATH #endif // GTEST_HAS_DEATH_TEST // EXPECT_DEATH_IF_SUPPORTED(statement, regex) and // ASSERT_DEATH_IF_SUPPORTED(statement, regex) expand to real death tests if // death tests are supported; otherwise they just issue a warning. This is // useful when you are combining death test assertions with normal test // assertions in one test. #if GTEST_HAS_DEATH_TEST # define EXPECT_DEATH_IF_SUPPORTED(statement, regex) \ EXPECT_DEATH(statement, regex) # define ASSERT_DEATH_IF_SUPPORTED(statement, regex) \ ASSERT_DEATH(statement, regex) #else # define EXPECT_DEATH_IF_SUPPORTED(statement, regex) \ GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, ) # define ASSERT_DEATH_IF_SUPPORTED(statement, regex) \ GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, return) #endif } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ // Copyright 2005, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan) // // The Google C++ Testing Framework (Google Test) // // This header file defines the Message class. // // IMPORTANT NOTE: Due to limitation of the C++ language, we have to // leave some internal implementation details in this header file. // They are clearly marked by comments like this: // // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. // // Such code is NOT meant to be used by a user directly, and is subject // to CHANGE WITHOUT NOTICE. Therefore DO NOT DEPEND ON IT in a user // program! #ifndef GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ #define GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ #include namespace testing { // The Message class works like an ostream repeater. // // Typical usage: // // 1. You stream a bunch of values to a Message object. // It will remember the text in a stringstream. // 2. Then you stream the Message object to an ostream. // This causes the text in the Message to be streamed // to the ostream. // // For example; // // testing::Message foo; // foo << 1 << " != " << 2; // std::cout << foo; // // will print "1 != 2". // // Message is not intended to be inherited from. In particular, its // destructor is not virtual. // // Note that stringstream behaves differently in gcc and in MSVC. You // can stream a NULL char pointer to it in the former, but not in the // latter (it causes an access violation if you do). The Message // class hides this difference by treating a NULL char pointer as // "(null)". class GTEST_API_ Message { private: // The type of basic IO manipulators (endl, ends, and flush) for // narrow streams. typedef std::ostream& (*BasicNarrowIoManip)(std::ostream&); public: // Constructs an empty Message. // We allocate the stringstream separately because otherwise each use of // ASSERT/EXPECT in a procedure adds over 200 bytes to the procedure's // stack frame leading to huge stack frames in some cases; gcc does not reuse // the stack space. Message() : ss_(new ::std::stringstream) { // By default, we want there to be enough precision when printing // a double to a Message. *ss_ << std::setprecision(std::numeric_limits::digits10 + 2); } // Copy constructor. Message(const Message& msg) : ss_(new ::std::stringstream) { // NOLINT *ss_ << msg.GetString(); } // Constructs a Message from a C-string. explicit Message(const char* str) : ss_(new ::std::stringstream) { *ss_ << str; } #if GTEST_OS_SYMBIAN // Streams a value (either a pointer or not) to this object. template inline Message& operator <<(const T& value) { StreamHelper(typename internal::is_pointer::type(), value); return *this; } #else // Streams a non-pointer value to this object. template inline Message& operator <<(const T& val) { ::GTestStreamToHelper(ss_.get(), val); return *this; } // Streams a pointer value to this object. // // This function is an overload of the previous one. When you // stream a pointer to a Message, this definition will be used as it // is more specialized. (The C++ Standard, section // [temp.func.order].) If you stream a non-pointer, then the // previous definition will be used. // // The reason for this overload is that streaming a NULL pointer to // ostream is undefined behavior. Depending on the compiler, you // may get "0", "(nil)", "(null)", or an access violation. To // ensure consistent result across compilers, we always treat NULL // as "(null)". template inline Message& operator <<(T* const& pointer) { // NOLINT if (pointer == NULL) { *ss_ << "(null)"; } else { ::GTestStreamToHelper(ss_.get(), pointer); } return *this; } #endif // GTEST_OS_SYMBIAN // Since the basic IO manipulators are overloaded for both narrow // and wide streams, we have to provide this specialized definition // of operator <<, even though its body is the same as the // templatized version above. Without this definition, streaming // endl or other basic IO manipulators to Message will confuse the // compiler. Message& operator <<(BasicNarrowIoManip val) { *ss_ << val; return *this; } // Instead of 1/0, we want to see true/false for bool values. Message& operator <<(bool b) { return *this << (b ? "true" : "false"); } // These two overloads allow streaming a wide C string to a Message // using the UTF-8 encoding. Message& operator <<(const wchar_t* wide_c_str) { return *this << internal::String::ShowWideCString(wide_c_str); } Message& operator <<(wchar_t* wide_c_str) { return *this << internal::String::ShowWideCString(wide_c_str); } #if GTEST_HAS_STD_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& operator <<(const ::std::wstring& wstr); #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_GLOBAL_WSTRING // Converts the given wide string to a narrow string using the UTF-8 // encoding, and streams the result to this Message object. Message& operator <<(const ::wstring& wstr); #endif // GTEST_HAS_GLOBAL_WSTRING // Gets the text streamed to this object so far as a String. // Each '\0' character in the buffer is replaced with "\\0". // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. internal::String GetString() const { return internal::StringStreamToString(ss_.get()); } private: #if GTEST_OS_SYMBIAN // These are needed as the Nokia Symbian Compiler cannot decide between // const T& and const T* in a function template. The Nokia compiler _can_ // decide between class template specializations for T and T*, so a // tr1::type_traits-like is_pointer works, and we can overload on that. template inline void StreamHelper(internal::true_type /*dummy*/, T* pointer) { if (pointer == NULL) { *ss_ << "(null)"; } else { ::GTestStreamToHelper(ss_.get(), pointer); } } template inline void StreamHelper(internal::false_type /*dummy*/, const T& value) { ::GTestStreamToHelper(ss_.get(), value); } #endif // GTEST_OS_SYMBIAN // We'll hold the text streamed to this object here. const internal::scoped_ptr< ::std::stringstream> ss_; // We declare (but don't implement) this to prevent the compiler // from implementing the assignment operator. void operator=(const Message&); }; // Streams a Message to an ostream. inline std::ostream& operator <<(std::ostream& os, const Message& sb) { return os << sb.GetString(); } } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ // This file was GENERATED by command: // pump.py gtest-param-test.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Authors: vladl@google.com (Vlad Losev) // // Macros and functions for implementing parameterized tests // in Google C++ Testing Framework (Google Test) // // This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // #ifndef GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ // Value-parameterized tests allow you to test your code with different // parameters without writing multiple copies of the same test. // // Here is how you use value-parameterized tests: #if 0 // To write value-parameterized tests, first you should define a fixture // class. It is usually derived from testing::TestWithParam (see below for // another inheritance scheme that's sometimes useful in more complicated // class hierarchies), where the type of your parameter values. // TestWithParam is itself derived from testing::Test. T can be any // copyable type. If it's a raw pointer, you are responsible for managing the // lifespan of the pointed values. class FooTest : public ::testing::TestWithParam { // You can implement all the usual class fixture members here. }; // Then, use the TEST_P macro to define as many parameterized tests // for this fixture as you want. The _P suffix is for "parameterized" // or "pattern", whichever you prefer to think. TEST_P(FooTest, DoesBlah) { // Inside a test, access the test parameter with the GetParam() method // of the TestWithParam class: EXPECT_TRUE(foo.Blah(GetParam())); ... } TEST_P(FooTest, HasBlahBlah) { ... } // Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test // case with any set of parameters you want. Google Test defines a number // of functions for generating test parameters. They return what we call // (surprise!) parameter generators. Here is a summary of them, which // are all in the testing namespace: // // // Range(begin, end [, step]) - Yields values {begin, begin+step, // begin+step+step, ...}. The values do not // include end. step defaults to 1. // Values(v1, v2, ..., vN) - Yields values {v1, v2, ..., vN}. // ValuesIn(container) - Yields values from a C-style array, an STL // ValuesIn(begin,end) container, or an iterator range [begin, end). // Bool() - Yields sequence {false, true}. // Combine(g1, g2, ..., gN) - Yields all combinations (the Cartesian product // for the math savvy) of the values generated // by the N generators. // // For more details, see comments at the definitions of these functions below // in this file. // // The following statement will instantiate tests from the FooTest test case // each with parameter values "meeny", "miny", and "moe". INSTANTIATE_TEST_CASE_P(InstantiationName, FooTest, Values("meeny", "miny", "moe")); // To distinguish different instances of the pattern, (yes, you // can instantiate it more then once) the first argument to the // INSTANTIATE_TEST_CASE_P macro is a prefix that will be added to the // actual test case name. Remember to pick unique prefixes for different // instantiations. The tests from the instantiation above will have // these names: // // * InstantiationName/FooTest.DoesBlah/0 for "meeny" // * InstantiationName/FooTest.DoesBlah/1 for "miny" // * InstantiationName/FooTest.DoesBlah/2 for "moe" // * InstantiationName/FooTest.HasBlahBlah/0 for "meeny" // * InstantiationName/FooTest.HasBlahBlah/1 for "miny" // * InstantiationName/FooTest.HasBlahBlah/2 for "moe" // // You can use these names in --gtest_filter. // // This statement will instantiate all tests from FooTest again, each // with parameter values "cat" and "dog": const char* pets[] = {"cat", "dog"}; INSTANTIATE_TEST_CASE_P(AnotherInstantiationName, FooTest, ValuesIn(pets)); // The tests from the instantiation above will have these names: // // * AnotherInstantiationName/FooTest.DoesBlah/0 for "cat" // * AnotherInstantiationName/FooTest.DoesBlah/1 for "dog" // * AnotherInstantiationName/FooTest.HasBlahBlah/0 for "cat" // * AnotherInstantiationName/FooTest.HasBlahBlah/1 for "dog" // // Please note that INSTANTIATE_TEST_CASE_P will instantiate all tests // in the given test case, whether their definitions come before or // AFTER the INSTANTIATE_TEST_CASE_P statement. // // Please also note that generator expressions (including parameters to the // generators) are evaluated in InitGoogleTest(), after main() has started. // This allows the user on one hand, to adjust generator parameters in order // to dynamically determine a set of tests to run and on the other hand, // give the user a chance to inspect the generated tests with Google Test // reflection API before RUN_ALL_TESTS() is executed. // // You can see samples/sample7_unittest.cc and samples/sample8_unittest.cc // for more examples. // // In the future, we plan to publish the API for defining new parameter // generators. But for now this interface remains part of the internal // implementation and is subject to change. // // // A parameterized test fixture must be derived from testing::Test and from // testing::WithParamInterface, where T is the type of the parameter // values. Inheriting from TestWithParam satisfies that requirement because // TestWithParam inherits from both Test and WithParamInterface. In more // complicated hierarchies, however, it is occasionally useful to inherit // separately from Test and WithParamInterface. For example: class BaseTest : public ::testing::Test { // You can inherit all the usual members for a non-parameterized test // fixture here. }; class DerivedTest : public BaseTest, public ::testing::WithParamInterface { // The usual test fixture members go here too. }; TEST_F(BaseTest, HasFoo) { // This is an ordinary non-parameterized test. } TEST_P(DerivedTest, DoesBlah) { // GetParam works just the same here as if you inherit from TestWithParam. EXPECT_TRUE(foo.Blah(GetParam())); } #endif // 0 #if !GTEST_OS_SYMBIAN # include #endif // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: vladl@google.com (Vlad Losev) // Type and function utilities for implementing parameterized tests. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ #include #include #include // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. // Copyright 2003 Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Authors: Dan Egnor (egnor@google.com) // // A "smart" pointer type with reference tracking. Every pointer to a // particular object is kept on a circular linked list. When the last pointer // to an object is destroyed or reassigned, the object is deleted. // // Used properly, this deletes the object when the last reference goes away. // There are several caveats: // - Like all reference counting schemes, cycles lead to leaks. // - Each smart pointer is actually two pointers (8 bytes instead of 4). // - Every time a pointer is assigned, the entire list of pointers to that // object is traversed. This class is therefore NOT SUITABLE when there // will often be more than two or three pointers to a particular object. // - References are only tracked as long as linked_ptr<> objects are copied. // If a linked_ptr<> is converted to a raw pointer and back, BAD THINGS // will happen (double deletion). // // A good use of this class is storing object references in STL containers. // You can safely put linked_ptr<> in a vector<>. // Other uses may not be as good. // // Note: If you use an incomplete type with linked_ptr<>, the class // *containing* linked_ptr<> must have a constructor and destructor (even // if they do nothing!). // // Bill Gibbons suggested we use something like this. // // Thread Safety: // Unlike other linked_ptr implementations, in this implementation // a linked_ptr object is thread-safe in the sense that: // - it's safe to copy linked_ptr objects concurrently, // - it's safe to copy *from* a linked_ptr and read its underlying // raw pointer (e.g. via get()) concurrently, and // - it's safe to write to two linked_ptrs that point to the same // shared object concurrently. // TODO(wan@google.com): rename this to safe_linked_ptr to avoid // confusion with normal linked_ptr. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ #include #include namespace testing { namespace internal { // Protects copying of all linked_ptr objects. GTEST_API_ GTEST_DECLARE_STATIC_MUTEX_(g_linked_ptr_mutex); // This is used internally by all instances of linked_ptr<>. It needs to be // a non-template class because different types of linked_ptr<> can refer to // the same object (linked_ptr(obj) vs linked_ptr(obj)). // So, it needs to be possible for different types of linked_ptr to participate // in the same circular linked list, so we need a single class type here. // // DO NOT USE THIS CLASS DIRECTLY YOURSELF. Use linked_ptr. class linked_ptr_internal { public: // Create a new circle that includes only this instance. void join_new() { next_ = this; } // Many linked_ptr operations may change p.link_ for some linked_ptr // variable p in the same circle as this object. Therefore we need // to prevent two such operations from occurring concurrently. // // Note that different types of linked_ptr objects can coexist in a // circle (e.g. linked_ptr, linked_ptr, and // linked_ptr). Therefore we must use a single mutex to // protect all linked_ptr objects. This can create serious // contention in production code, but is acceptable in a testing // framework. // Join an existing circle. // L < g_linked_ptr_mutex void join(linked_ptr_internal const* ptr) { MutexLock lock(&g_linked_ptr_mutex); linked_ptr_internal const* p = ptr; while (p->next_ != ptr) p = p->next_; p->next_ = this; next_ = ptr; } // Leave whatever circle we're part of. Returns true if we were the // last member of the circle. Once this is done, you can join() another. // L < g_linked_ptr_mutex bool depart() { MutexLock lock(&g_linked_ptr_mutex); if (next_ == this) return true; linked_ptr_internal const* p = next_; while (p->next_ != this) p = p->next_; p->next_ = next_; return false; } private: mutable linked_ptr_internal const* next_; }; template class linked_ptr { public: typedef T element_type; // Take over ownership of a raw pointer. This should happen as soon as // possible after the object is created. explicit linked_ptr(T* ptr = NULL) { capture(ptr); } ~linked_ptr() { depart(); } // Copy an existing linked_ptr<>, adding ourselves to the list of references. template linked_ptr(linked_ptr const& ptr) { copy(&ptr); } linked_ptr(linked_ptr const& ptr) { // NOLINT assert(&ptr != this); copy(&ptr); } // Assignment releases the old value and acquires the new. template linked_ptr& operator=(linked_ptr const& ptr) { depart(); copy(&ptr); return *this; } linked_ptr& operator=(linked_ptr const& ptr) { if (&ptr != this) { depart(); copy(&ptr); } return *this; } // Smart pointer members. void reset(T* ptr = NULL) { depart(); capture(ptr); } T* get() const { return value_; } T* operator->() const { return value_; } T& operator*() const { return *value_; } bool operator==(T* p) const { return value_ == p; } bool operator!=(T* p) const { return value_ != p; } template bool operator==(linked_ptr const& ptr) const { return value_ == ptr.get(); } template bool operator!=(linked_ptr const& ptr) const { return value_ != ptr.get(); } private: template friend class linked_ptr; T* value_; linked_ptr_internal link_; void depart() { if (link_.depart()) delete value_; } void capture(T* ptr) { value_ = ptr; link_.join_new(); } template void copy(linked_ptr const* ptr) { value_ = ptr->get(); if (value_) link_.join(&ptr->link_); else link_.join_new(); } }; template inline bool operator==(T* ptr, const linked_ptr& x) { return ptr == x.get(); } template inline bool operator!=(T* ptr, const linked_ptr& x) { return ptr != x.get(); } // A function to convert T* into linked_ptr // Doing e.g. make_linked_ptr(new FooBarBaz(arg)) is a shorter notation // for linked_ptr >(new FooBarBaz(arg)) template linked_ptr make_linked_ptr(T* ptr) { return linked_ptr(ptr); } } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ // Copyright 2007, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan) // Google Test - The Google C++ Testing Framework // // This file implements a universal value printer that can print a // value of any type T: // // void ::testing::internal::UniversalPrinter::Print(value, ostream_ptr); // // A user can teach this function how to print a class type T by // defining either operator<<() or PrintTo() in the namespace that // defines T. More specifically, the FIRST defined function in the // following list will be used (assuming T is defined in namespace // foo): // // 1. foo::PrintTo(const T&, ostream*) // 2. operator<<(ostream&, const T&) defined in either foo or the // global namespace. // // If none of the above is defined, it will print the debug string of // the value if it is a protocol buffer, or print the raw bytes in the // value otherwise. // // To aid debugging: when T is a reference type, the address of the // value is also printed; when T is a (const) char pointer, both the // pointer value and the NUL-terminated string it points to are // printed. // // We also provide some convenient wrappers: // // // Prints a value to a string. For a (const or not) char // // pointer, the NUL-terminated string (but not the pointer) is // // printed. // std::string ::testing::PrintToString(const T& value); // // // Prints a value tersely: for a reference type, the referenced // // value (but not the address) is printed; for a (const or not) char // // pointer, the NUL-terminated string (but not the pointer) is // // printed. // void ::testing::internal::UniversalTersePrint(const T& value, ostream*); // // // Prints value using the type inferred by the compiler. The difference // // from UniversalTersePrint() is that this function prints both the // // pointer and the NUL-terminated string for a (const or not) char pointer. // void ::testing::internal::UniversalPrint(const T& value, ostream*); // // // Prints the fields of a tuple tersely to a string vector, one // // element for each field. Tuple support must be enabled in // // gtest-port.h. // std::vector UniversalTersePrintTupleFieldsToStrings( // const Tuple& value); // // Known limitation: // // The print primitives print the elements of an STL-style container // using the compiler-inferred type of *iter where iter is a // const_iterator of the container. When const_iterator is an input // iterator but not a forward iterator, this inferred type may not // match value_type, and the print output may be incorrect. In // practice, this is rarely a problem as for most containers // const_iterator is a forward iterator. We'll fix this if there's an // actual need for it. Note that this fix cannot rely on value_type // being defined as many user-defined container types don't have // value_type. #ifndef GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ #define GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ #include // NOLINT #include #include #include #include namespace testing { // Definitions in the 'internal' and 'internal2' name spaces are // subject to change without notice. DO NOT USE THEM IN USER CODE! namespace internal2 { // Prints the given number of bytes in the given object to the given // ostream. GTEST_API_ void PrintBytesInObjectTo(const unsigned char* obj_bytes, size_t count, ::std::ostream* os); // For selecting which printer to use when a given type has neither << // nor PrintTo(). enum TypeKind { kProtobuf, // a protobuf type kConvertibleToInteger, // a type implicitly convertible to BiggestInt // (e.g. a named or unnamed enum type) kOtherType // anything else }; // TypeWithoutFormatter::PrintValue(value, os) is called // by the universal printer to print a value of type T when neither // operator<< nor PrintTo() is defined for T, where kTypeKind is the // "kind" of T as defined by enum TypeKind. template class TypeWithoutFormatter { public: // This default version is called when kTypeKind is kOtherType. static void PrintValue(const T& value, ::std::ostream* os) { PrintBytesInObjectTo(reinterpret_cast(&value), sizeof(value), os); } }; // We print a protobuf using its ShortDebugString() when the string // doesn't exceed this many characters; otherwise we print it using // DebugString() for better readability. const size_t kProtobufOneLinerMaxLength = 50; template class TypeWithoutFormatter { public: static void PrintValue(const T& value, ::std::ostream* os) { const ::testing::internal::string short_str = value.ShortDebugString(); const ::testing::internal::string pretty_str = short_str.length() <= kProtobufOneLinerMaxLength ? short_str : ("\n" + value.DebugString()); *os << ("<" + pretty_str + ">"); } }; template class TypeWithoutFormatter { public: // Since T has no << operator or PrintTo() but can be implicitly // converted to BiggestInt, we print it as a BiggestInt. // // Most likely T is an enum type (either named or unnamed), in which // case printing it as an integer is the desired behavior. In case // T is not an enum, printing it as an integer is the best we can do // given that it has no user-defined printer. static void PrintValue(const T& value, ::std::ostream* os) { const internal::BiggestInt kBigInt = value; *os << kBigInt; } }; // Prints the given value to the given ostream. If the value is a // protocol message, its debug string is printed; if it's an enum or // of a type implicitly convertible to BiggestInt, it's printed as an // integer; otherwise the bytes in the value are printed. This is // what UniversalPrinter::Print() does when it knows nothing about // type T and T has neither << operator nor PrintTo(). // // A user can override this behavior for a class type Foo by defining // a << operator in the namespace where Foo is defined. // // We put this operator in namespace 'internal2' instead of 'internal' // to simplify the implementation, as much code in 'internal' needs to // use << in STL, which would conflict with our own << were it defined // in 'internal'. // // Note that this operator<< takes a generic std::basic_ostream type instead of the more restricted std::ostream. If // we define it to take an std::ostream instead, we'll get an // "ambiguous overloads" compiler error when trying to print a type // Foo that supports streaming to std::basic_ostream, as the compiler cannot tell whether // operator<<(std::ostream&, const T&) or // operator<<(std::basic_stream, const Foo&) is more // specific. template ::std::basic_ostream& operator<<( ::std::basic_ostream& os, const T& x) { TypeWithoutFormatter::value ? kProtobuf : internal::ImplicitlyConvertible::value ? kConvertibleToInteger : kOtherType)>::PrintValue(x, &os); return os; } } // namespace internal2 } // namespace testing // This namespace MUST NOT BE NESTED IN ::testing, or the name look-up // magic needed for implementing UniversalPrinter won't work. namespace testing_internal { // Used to print a value that is not an STL-style container when the // user doesn't define PrintTo() for it. template void DefaultPrintNonContainerTo(const T& value, ::std::ostream* os) { // With the following statement, during unqualified name lookup, // testing::internal2::operator<< appears as if it was declared in // the nearest enclosing namespace that contains both // ::testing_internal and ::testing::internal2, i.e. the global // namespace. For more details, refer to the C++ Standard section // 7.3.4-1 [namespace.udir]. This allows us to fall back onto // testing::internal2::operator<< in case T doesn't come with a << // operator. // // We cannot write 'using ::testing::internal2::operator<<;', which // gcc 3.3 fails to compile due to a compiler bug. using namespace ::testing::internal2; // NOLINT // Assuming T is defined in namespace foo, in the next statement, // the compiler will consider all of: // // 1. foo::operator<< (thanks to Koenig look-up), // 2. ::operator<< (as the current namespace is enclosed in ::), // 3. testing::internal2::operator<< (thanks to the using statement above). // // The operator<< whose type matches T best will be picked. // // We deliberately allow #2 to be a candidate, as sometimes it's // impossible to define #1 (e.g. when foo is ::std, defining // anything in it is undefined behavior unless you are a compiler // vendor.). *os << value; } } // namespace testing_internal namespace testing { namespace internal { // UniversalPrinter::Print(value, ostream_ptr) prints the given // value to the given ostream. The caller must ensure that // 'ostream_ptr' is not NULL, or the behavior is undefined. // // We define UniversalPrinter as a class template (as opposed to a // function template), as we need to partially specialize it for // reference types, which cannot be done with function templates. template class UniversalPrinter; template void UniversalPrint(const T& value, ::std::ostream* os); // Used to print an STL-style container when the user doesn't define // a PrintTo() for it. template void DefaultPrintTo(IsContainer /* dummy */, false_type /* is not a pointer */, const C& container, ::std::ostream* os) { const size_t kMaxCount = 32; // The maximum number of elements to print. *os << '{'; size_t count = 0; for (typename C::const_iterator it = container.begin(); it != container.end(); ++it, ++count) { if (count > 0) { *os << ','; if (count == kMaxCount) { // Enough has been printed. *os << " ..."; break; } } *os << ' '; // We cannot call PrintTo(*it, os) here as PrintTo() doesn't // handle *it being a native array. internal::UniversalPrint(*it, os); } if (count > 0) { *os << ' '; } *os << '}'; } // Used to print a pointer that is neither a char pointer nor a member // pointer, when the user doesn't define PrintTo() for it. (A member // variable pointer or member function pointer doesn't really point to // a location in the address space. Their representation is // implementation-defined. Therefore they will be printed as raw // bytes.) template void DefaultPrintTo(IsNotContainer /* dummy */, true_type /* is a pointer */, T* p, ::std::ostream* os) { if (p == NULL) { *os << "NULL"; } else { // C++ doesn't allow casting from a function pointer to any object // pointer. // // IsTrue() silences warnings: "Condition is always true", // "unreachable code". if (IsTrue(ImplicitlyConvertible::value)) { // T is not a function type. We just call << to print p, // relying on ADL to pick up user-defined << for their pointer // types, if any. *os << p; } else { // T is a function type, so '*os << p' doesn't do what we want // (it just prints p as bool). We want to print p as a const // void*. However, we cannot cast it to const void* directly, // even using reinterpret_cast, as earlier versions of gcc // (e.g. 3.4.5) cannot compile the cast when p is a function // pointer. Casting to UInt64 first solves the problem. *os << reinterpret_cast( reinterpret_cast(p)); } } } // Used to print a non-container, non-pointer value when the user // doesn't define PrintTo() for it. template void DefaultPrintTo(IsNotContainer /* dummy */, false_type /* is not a pointer */, const T& value, ::std::ostream* os) { ::testing_internal::DefaultPrintNonContainerTo(value, os); } // Prints the given value using the << operator if it has one; // otherwise prints the bytes in it. This is what // UniversalPrinter::Print() does when PrintTo() is not specialized // or overloaded for type T. // // A user can override this behavior for a class type Foo by defining // an overload of PrintTo() in the namespace where Foo is defined. We // give the user this option as sometimes defining a << operator for // Foo is not desirable (e.g. the coding style may prevent doing it, // or there is already a << operator but it doesn't do what the user // wants). template void PrintTo(const T& value, ::std::ostream* os) { // DefaultPrintTo() is overloaded. The type of its first two // arguments determine which version will be picked. If T is an // STL-style container, the version for container will be called; if // T is a pointer, the pointer version will be called; otherwise the // generic version will be called. // // Note that we check for container types here, prior to we check // for protocol message types in our operator<<. The rationale is: // // For protocol messages, we want to give people a chance to // override Google Mock's format by defining a PrintTo() or // operator<<. For STL containers, other formats can be // incompatible with Google Mock's format for the container // elements; therefore we check for container types here to ensure // that our format is used. // // The second argument of DefaultPrintTo() is needed to bypass a bug // in Symbian's C++ compiler that prevents it from picking the right // overload between: // // PrintTo(const T& x, ...); // PrintTo(T* x, ...); DefaultPrintTo(IsContainerTest(0), is_pointer(), value, os); } // The following list of PrintTo() overloads tells // UniversalPrinter::Print() how to print standard types (built-in // types, strings, plain arrays, and pointers). // Overloads for various char types. GTEST_API_ void PrintTo(unsigned char c, ::std::ostream* os); GTEST_API_ void PrintTo(signed char c, ::std::ostream* os); inline void PrintTo(char c, ::std::ostream* os) { // When printing a plain char, we always treat it as unsigned. This // way, the output won't be affected by whether the compiler thinks // char is signed or not. PrintTo(static_cast(c), os); } // Overloads for other simple built-in types. inline void PrintTo(bool x, ::std::ostream* os) { *os << (x ? "true" : "false"); } // Overload for wchar_t type. // Prints a wchar_t as a symbol if it is printable or as its internal // code otherwise and also as its decimal code (except for L'\0'). // The L'\0' char is printed as "L'\\0'". The decimal code is printed // as signed integer when wchar_t is implemented by the compiler // as a signed type and is printed as an unsigned integer when wchar_t // is implemented as an unsigned type. GTEST_API_ void PrintTo(wchar_t wc, ::std::ostream* os); // Overloads for C strings. GTEST_API_ void PrintTo(const char* s, ::std::ostream* os); inline void PrintTo(char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } // signed/unsigned char is often used for representing binary data, so // we print pointers to it as void* to be safe. inline void PrintTo(const signed char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } inline void PrintTo(signed char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } inline void PrintTo(const unsigned char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } inline void PrintTo(unsigned char* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } // MSVC can be configured to define wchar_t as a typedef of unsigned // short. It defines _NATIVE_WCHAR_T_DEFINED when wchar_t is a native // type. When wchar_t is a typedef, defining an overload for const // wchar_t* would cause unsigned short* be printed as a wide string, // possibly causing invalid memory accesses. #if !defined(_MSC_VER) || defined(_NATIVE_WCHAR_T_DEFINED) // Overloads for wide C strings GTEST_API_ void PrintTo(const wchar_t* s, ::std::ostream* os); inline void PrintTo(wchar_t* s, ::std::ostream* os) { PrintTo(ImplicitCast_(s), os); } #endif // Overload for C arrays. Multi-dimensional arrays are printed // properly. // Prints the given number of elements in an array, without printing // the curly braces. template void PrintRawArrayTo(const T a[], size_t count, ::std::ostream* os) { UniversalPrint(a[0], os); for (size_t i = 1; i != count; i++) { *os << ", "; UniversalPrint(a[i], os); } } // Overloads for ::string and ::std::string. #if GTEST_HAS_GLOBAL_STRING GTEST_API_ void PrintStringTo(const ::string&s, ::std::ostream* os); inline void PrintTo(const ::string& s, ::std::ostream* os) { PrintStringTo(s, os); } #endif // GTEST_HAS_GLOBAL_STRING GTEST_API_ void PrintStringTo(const ::std::string&s, ::std::ostream* os); inline void PrintTo(const ::std::string& s, ::std::ostream* os) { PrintStringTo(s, os); } // Overloads for ::wstring and ::std::wstring. #if GTEST_HAS_GLOBAL_WSTRING GTEST_API_ void PrintWideStringTo(const ::wstring&s, ::std::ostream* os); inline void PrintTo(const ::wstring& s, ::std::ostream* os) { PrintWideStringTo(s, os); } #endif // GTEST_HAS_GLOBAL_WSTRING #if GTEST_HAS_STD_WSTRING GTEST_API_ void PrintWideStringTo(const ::std::wstring&s, ::std::ostream* os); inline void PrintTo(const ::std::wstring& s, ::std::ostream* os) { PrintWideStringTo(s, os); } #endif // GTEST_HAS_STD_WSTRING #if GTEST_HAS_TR1_TUPLE // Overload for ::std::tr1::tuple. Needed for printing function arguments, // which are packed as tuples. // Helper function for printing a tuple. T must be instantiated with // a tuple type. template void PrintTupleTo(const T& t, ::std::ostream* os); // Overloaded PrintTo() for tuples of various arities. We support // tuples of up-to 10 fields. The following implementation works // regardless of whether tr1::tuple is implemented using the // non-standard variadic template feature or not. inline void PrintTo(const ::std::tr1::tuple<>& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } template void PrintTo( const ::std::tr1::tuple& t, ::std::ostream* os) { PrintTupleTo(t, os); } #endif // GTEST_HAS_TR1_TUPLE // Overload for std::pair. template void PrintTo(const ::std::pair& value, ::std::ostream* os) { *os << '('; // We cannot use UniversalPrint(value.first, os) here, as T1 may be // a reference type. The same for printing value.second. UniversalPrinter::Print(value.first, os); *os << ", "; UniversalPrinter::Print(value.second, os); *os << ')'; } // Implements printing a non-reference type T by letting the compiler // pick the right overload of PrintTo() for T. template class UniversalPrinter { public: // MSVC warns about adding const to a function type, so we want to // disable the warning. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4180) // Temporarily disables warning 4180. #endif // _MSC_VER // Note: we deliberately don't call this PrintTo(), as that name // conflicts with ::testing::internal::PrintTo in the body of the // function. static void Print(const T& value, ::std::ostream* os) { // By default, ::testing::internal::PrintTo() is used for printing // the value. // // Thanks to Koenig look-up, if T is a class and has its own // PrintTo() function defined in its namespace, that function will // be visible here. Since it is more specific than the generic ones // in ::testing::internal, it will be picked by the compiler in the // following statement - exactly what we want. PrintTo(value, os); } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif // _MSC_VER }; // UniversalPrintArray(begin, len, os) prints an array of 'len' // elements, starting at address 'begin'. template void UniversalPrintArray(const T* begin, size_t len, ::std::ostream* os) { if (len == 0) { *os << "{}"; } else { *os << "{ "; const size_t kThreshold = 18; const size_t kChunkSize = 8; // If the array has more than kThreshold elements, we'll have to // omit some details by printing only the first and the last // kChunkSize elements. // TODO(wan@google.com): let the user control the threshold using a flag. if (len <= kThreshold) { PrintRawArrayTo(begin, len, os); } else { PrintRawArrayTo(begin, kChunkSize, os); *os << ", ..., "; PrintRawArrayTo(begin + len - kChunkSize, kChunkSize, os); } *os << " }"; } } // This overload prints a (const) char array compactly. GTEST_API_ void UniversalPrintArray(const char* begin, size_t len, ::std::ostream* os); // Implements printing an array type T[N]. template class UniversalPrinter { public: // Prints the given array, omitting some elements when there are too // many. static void Print(const T (&a)[N], ::std::ostream* os) { UniversalPrintArray(a, N, os); } }; // Implements printing a reference type T&. template class UniversalPrinter { public: // MSVC warns about adding const to a function type, so we want to // disable the warning. #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4180) // Temporarily disables warning 4180. #endif // _MSC_VER static void Print(const T& value, ::std::ostream* os) { // Prints the address of the value. We use reinterpret_cast here // as static_cast doesn't compile when T is a function type. *os << "@" << reinterpret_cast(&value) << " "; // Then prints the value itself. UniversalPrint(value, os); } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif // _MSC_VER }; // Prints a value tersely: for a reference type, the referenced value // (but not the address) is printed; for a (const) char pointer, the // NUL-terminated string (but not the pointer) is printed. template void UniversalTersePrint(const T& value, ::std::ostream* os) { UniversalPrint(value, os); } inline void UniversalTersePrint(const char* str, ::std::ostream* os) { if (str == NULL) { *os << "NULL"; } else { UniversalPrint(string(str), os); } } inline void UniversalTersePrint(char* str, ::std::ostream* os) { UniversalTersePrint(static_cast(str), os); } // Prints a value using the type inferred by the compiler. The // difference between this and UniversalTersePrint() is that for a // (const) char pointer, this prints both the pointer and the // NUL-terminated string. template void UniversalPrint(const T& value, ::std::ostream* os) { UniversalPrinter::Print(value, os); } #if GTEST_HAS_TR1_TUPLE typedef ::std::vector Strings; // This helper template allows PrintTo() for tuples and // UniversalTersePrintTupleFieldsToStrings() to be defined by // induction on the number of tuple fields. The idea is that // TuplePrefixPrinter::PrintPrefixTo(t, os) prints the first N // fields in tuple t, and can be defined in terms of // TuplePrefixPrinter. // The inductive case. template struct TuplePrefixPrinter { // Prints the first N fields of a tuple. template static void PrintPrefixTo(const Tuple& t, ::std::ostream* os) { TuplePrefixPrinter::PrintPrefixTo(t, os); *os << ", "; UniversalPrinter::type> ::Print(::std::tr1::get(t), os); } // Tersely prints the first N fields of a tuple to a string vector, // one element for each field. template static void TersePrintPrefixToStrings(const Tuple& t, Strings* strings) { TuplePrefixPrinter::TersePrintPrefixToStrings(t, strings); ::std::stringstream ss; UniversalTersePrint(::std::tr1::get(t), &ss); strings->push_back(ss.str()); } }; // Base cases. template <> struct TuplePrefixPrinter<0> { template static void PrintPrefixTo(const Tuple&, ::std::ostream*) {} template static void TersePrintPrefixToStrings(const Tuple&, Strings*) {} }; // We have to specialize the entire TuplePrefixPrinter<> class // template here, even though the definition of // TersePrintPrefixToStrings() is the same as the generic version, as // Embarcadero (formerly CodeGear, formerly Borland) C++ doesn't // support specializing a method template of a class template. template <> struct TuplePrefixPrinter<1> { template static void PrintPrefixTo(const Tuple& t, ::std::ostream* os) { UniversalPrinter::type>:: Print(::std::tr1::get<0>(t), os); } template static void TersePrintPrefixToStrings(const Tuple& t, Strings* strings) { ::std::stringstream ss; UniversalTersePrint(::std::tr1::get<0>(t), &ss); strings->push_back(ss.str()); } }; // Helper function for printing a tuple. T must be instantiated with // a tuple type. template void PrintTupleTo(const T& t, ::std::ostream* os) { *os << "("; TuplePrefixPrinter< ::std::tr1::tuple_size::value>:: PrintPrefixTo(t, os); *os << ")"; } // Prints the fields of a tuple tersely to a string vector, one // element for each field. See the comment before // UniversalTersePrint() for how we define "tersely". template Strings UniversalTersePrintTupleFieldsToStrings(const Tuple& value) { Strings result; TuplePrefixPrinter< ::std::tr1::tuple_size::value>:: TersePrintPrefixToStrings(value, &result); return result; } #endif // GTEST_HAS_TR1_TUPLE } // namespace internal template ::std::string PrintToString(const T& value) { ::std::stringstream ss; internal::UniversalTersePrint(value, &ss); return ss.str(); } } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ #if GTEST_HAS_PARAM_TEST namespace testing { namespace internal { // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Outputs a message explaining invalid registration of different // fixture class for the same test case. This may happen when // TEST_P macro is used to define two tests with the same name // but in different namespaces. GTEST_API_ void ReportInvalidTestCaseType(const char* test_case_name, const char* file, int line); template class ParamGeneratorInterface; template class ParamGenerator; // Interface for iterating over elements provided by an implementation // of ParamGeneratorInterface. template class ParamIteratorInterface { public: virtual ~ParamIteratorInterface() {} // A pointer to the base generator instance. // Used only for the purposes of iterator comparison // to make sure that two iterators belong to the same generator. virtual const ParamGeneratorInterface* BaseGenerator() const = 0; // Advances iterator to point to the next element // provided by the generator. The caller is responsible // for not calling Advance() on an iterator equal to // BaseGenerator()->End(). virtual void Advance() = 0; // Clones the iterator object. Used for implementing copy semantics // of ParamIterator. virtual ParamIteratorInterface* Clone() const = 0; // Dereferences the current iterator and provides (read-only) access // to the pointed value. It is the caller's responsibility not to call // Current() on an iterator equal to BaseGenerator()->End(). // Used for implementing ParamGenerator::operator*(). virtual const T* Current() const = 0; // Determines whether the given iterator and other point to the same // element in the sequence generated by the generator. // Used for implementing ParamGenerator::operator==(). virtual bool Equals(const ParamIteratorInterface& other) const = 0; }; // Class iterating over elements provided by an implementation of // ParamGeneratorInterface. It wraps ParamIteratorInterface // and implements the const forward iterator concept. template class ParamIterator { public: typedef T value_type; typedef const T& reference; typedef ptrdiff_t difference_type; // ParamIterator assumes ownership of the impl_ pointer. ParamIterator(const ParamIterator& other) : impl_(other.impl_->Clone()) {} ParamIterator& operator=(const ParamIterator& other) { if (this != &other) impl_.reset(other.impl_->Clone()); return *this; } const T& operator*() const { return *impl_->Current(); } const T* operator->() const { return impl_->Current(); } // Prefix version of operator++. ParamIterator& operator++() { impl_->Advance(); return *this; } // Postfix version of operator++. ParamIterator operator++(int /*unused*/) { ParamIteratorInterface* clone = impl_->Clone(); impl_->Advance(); return ParamIterator(clone); } bool operator==(const ParamIterator& other) const { return impl_.get() == other.impl_.get() || impl_->Equals(*other.impl_); } bool operator!=(const ParamIterator& other) const { return !(*this == other); } private: friend class ParamGenerator; explicit ParamIterator(ParamIteratorInterface* impl) : impl_(impl) {} scoped_ptr > impl_; }; // ParamGeneratorInterface is the binary interface to access generators // defined in other translation units. template class ParamGeneratorInterface { public: typedef T ParamType; virtual ~ParamGeneratorInterface() {} // Generator interface definition virtual ParamIteratorInterface* Begin() const = 0; virtual ParamIteratorInterface* End() const = 0; }; // Wraps ParamGeneratorInterface and provides general generator syntax // compatible with the STL Container concept. // This class implements copy initialization semantics and the contained // ParamGeneratorInterface instance is shared among all copies // of the original object. This is possible because that instance is immutable. template class ParamGenerator { public: typedef ParamIterator iterator; explicit ParamGenerator(ParamGeneratorInterface* impl) : impl_(impl) {} ParamGenerator(const ParamGenerator& other) : impl_(other.impl_) {} ParamGenerator& operator=(const ParamGenerator& other) { impl_ = other.impl_; return *this; } iterator begin() const { return iterator(impl_->Begin()); } iterator end() const { return iterator(impl_->End()); } private: linked_ptr > impl_; }; // Generates values from a range of two comparable values. Can be used to // generate sequences of user-defined types that implement operator+() and // operator<(). // This class is used in the Range() function. template class RangeGenerator : public ParamGeneratorInterface { public: RangeGenerator(T begin, T end, IncrementT step) : begin_(begin), end_(end), step_(step), end_index_(CalculateEndIndex(begin, end, step)) {} virtual ~RangeGenerator() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, begin_, 0, step_); } virtual ParamIteratorInterface* End() const { return new Iterator(this, end_, end_index_, step_); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, T value, int index, IncrementT step) : base_(base), value_(value), index_(index), step_(step) {} virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } virtual void Advance() { value_ = value_ + step_; index_++; } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const T* Current() const { return &value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const int other_index = CheckedDowncastToActualType(&other)->index_; return index_ == other_index; } private: Iterator(const Iterator& other) : ParamIteratorInterface(), base_(other.base_), value_(other.value_), index_(other.index_), step_(other.step_) {} // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; T value_; int index_; const IncrementT step_; }; // class RangeGenerator::Iterator static int CalculateEndIndex(const T& begin, const T& end, const IncrementT& step) { int end_index = 0; for (T i = begin; i < end; i = i + step) end_index++; return end_index; } // No implementation - assignment is unsupported. void operator=(const RangeGenerator& other); const T begin_; const T end_; const IncrementT step_; // The index for the end() iterator. All the elements in the generated // sequence are indexed (0-based) to aid iterator comparison. const int end_index_; }; // class RangeGenerator // Generates values from a pair of STL-style iterators. Used in the // ValuesIn() function. The elements are copied from the source range // since the source can be located on the stack, and the generator // is likely to persist beyond that stack frame. template class ValuesInIteratorRangeGenerator : public ParamGeneratorInterface { public: template ValuesInIteratorRangeGenerator(ForwardIterator begin, ForwardIterator end) : container_(begin, end) {} virtual ~ValuesInIteratorRangeGenerator() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, container_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, container_.end()); } private: typedef typename ::std::vector ContainerType; class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, typename ContainerType::const_iterator iterator) : base_(base), iterator_(iterator) {} virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } virtual void Advance() { ++iterator_; value_.reset(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } // We need to use cached value referenced by iterator_ because *iterator_ // can return a temporary object (and of type other then T), so just // having "return &*iterator_;" doesn't work. // value_ is updated here and not in Advance() because Advance() // can advance iterator_ beyond the end of the range, and we cannot // detect that fact. The client code, on the other hand, is // responsible for not calling Current() on an out-of-range iterator. virtual const T* Current() const { if (value_.get() == NULL) value_.reset(new T(*iterator_)); return value_.get(); } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; return iterator_ == CheckedDowncastToActualType(&other)->iterator_; } private: Iterator(const Iterator& other) // The explicit constructor call suppresses a false warning // emitted by gcc when supplied with the -Wextra option. : ParamIteratorInterface(), base_(other.base_), iterator_(other.iterator_) {} const ParamGeneratorInterface* const base_; typename ContainerType::const_iterator iterator_; // A cached value of *iterator_. We keep it here to allow access by // pointer in the wrapping iterator's operator->(). // value_ needs to be mutable to be accessed in Current(). // Use of scoped_ptr helps manage cached value's lifetime, // which is bound by the lifespan of the iterator itself. mutable scoped_ptr value_; }; // class ValuesInIteratorRangeGenerator::Iterator // No implementation - assignment is unsupported. void operator=(const ValuesInIteratorRangeGenerator& other); const ContainerType container_; }; // class ValuesInIteratorRangeGenerator // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Stores a parameter value and later creates tests parameterized with that // value. template class ParameterizedTestFactory : public TestFactoryBase { public: typedef typename TestClass::ParamType ParamType; explicit ParameterizedTestFactory(ParamType parameter) : parameter_(parameter) {} virtual Test* CreateTest() { TestClass::SetParam(¶meter_); return new TestClass(); } private: const ParamType parameter_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestFactory); }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // TestMetaFactoryBase is a base class for meta-factories that create // test factories for passing into MakeAndRegisterTestInfo function. template class TestMetaFactoryBase { public: virtual ~TestMetaFactoryBase() {} virtual TestFactoryBase* CreateTestFactory(ParamType parameter) = 0; }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // TestMetaFactory creates test factories for passing into // MakeAndRegisterTestInfo function. Since MakeAndRegisterTestInfo receives // ownership of test factory pointer, same factory object cannot be passed // into that method twice. But ParameterizedTestCaseInfo is going to call // it for each Test/Parameter value combination. Thus it needs meta factory // creator class. template class TestMetaFactory : public TestMetaFactoryBase { public: typedef typename TestCase::ParamType ParamType; TestMetaFactory() {} virtual TestFactoryBase* CreateTestFactory(ParamType parameter) { return new ParameterizedTestFactory(parameter); } private: GTEST_DISALLOW_COPY_AND_ASSIGN_(TestMetaFactory); }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // ParameterizedTestCaseInfoBase is a generic interface // to ParameterizedTestCaseInfo classes. ParameterizedTestCaseInfoBase // accumulates test information provided by TEST_P macro invocations // and generators provided by INSTANTIATE_TEST_CASE_P macro invocations // and uses that information to register all resulting test instances // in RegisterTests method. The ParameterizeTestCaseRegistry class holds // a collection of pointers to the ParameterizedTestCaseInfo objects // and calls RegisterTests() on each of them when asked. class ParameterizedTestCaseInfoBase { public: virtual ~ParameterizedTestCaseInfoBase() {} // Base part of test case name for display purposes. virtual const string& GetTestCaseName() const = 0; // Test case id to verify identity. virtual TypeId GetTestCaseTypeId() const = 0; // UnitTest class invokes this method to register tests in this // test case right before running them in RUN_ALL_TESTS macro. // This method should not be called more then once on any single // instance of a ParameterizedTestCaseInfoBase derived class. virtual void RegisterTests() = 0; protected: ParameterizedTestCaseInfoBase() {} private: GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseInfoBase); }; // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // ParameterizedTestCaseInfo accumulates tests obtained from TEST_P // macro invocations for a particular test case and generators // obtained from INSTANTIATE_TEST_CASE_P macro invocations for that // test case. It registers tests with all values generated by all // generators when asked. template class ParameterizedTestCaseInfo : public ParameterizedTestCaseInfoBase { public: // ParamType and GeneratorCreationFunc are private types but are required // for declarations of public methods AddTestPattern() and // AddTestCaseInstantiation(). typedef typename TestCase::ParamType ParamType; // A function that returns an instance of appropriate generator type. typedef ParamGenerator(GeneratorCreationFunc)(); explicit ParameterizedTestCaseInfo(const char* name) : test_case_name_(name) {} // Test case base name for display purposes. virtual const string& GetTestCaseName() const { return test_case_name_; } // Test case id to verify identity. virtual TypeId GetTestCaseTypeId() const { return GetTypeId(); } // TEST_P macro uses AddTestPattern() to record information // about a single test in a LocalTestInfo structure. // test_case_name is the base name of the test case (without invocation // prefix). test_base_name is the name of an individual test without // parameter index. For the test SequenceA/FooTest.DoBar/1 FooTest is // test case base name and DoBar is test base name. void AddTestPattern(const char* test_case_name, const char* test_base_name, TestMetaFactoryBase* meta_factory) { tests_.push_back(linked_ptr(new TestInfo(test_case_name, test_base_name, meta_factory))); } // INSTANTIATE_TEST_CASE_P macro uses AddGenerator() to record information // about a generator. int AddTestCaseInstantiation(const string& instantiation_name, GeneratorCreationFunc* func, const char* /* file */, int /* line */) { instantiations_.push_back(::std::make_pair(instantiation_name, func)); return 0; // Return value used only to run this method in namespace scope. } // UnitTest class invokes this method to register tests in this test case // test cases right before running tests in RUN_ALL_TESTS macro. // This method should not be called more then once on any single // instance of a ParameterizedTestCaseInfoBase derived class. // UnitTest has a guard to prevent from calling this method more then once. virtual void RegisterTests() { for (typename TestInfoContainer::iterator test_it = tests_.begin(); test_it != tests_.end(); ++test_it) { linked_ptr test_info = *test_it; for (typename InstantiationContainer::iterator gen_it = instantiations_.begin(); gen_it != instantiations_.end(); ++gen_it) { const string& instantiation_name = gen_it->first; ParamGenerator generator((*gen_it->second)()); Message test_case_name_stream; if ( !instantiation_name.empty() ) test_case_name_stream << instantiation_name << "/"; test_case_name_stream << test_info->test_case_base_name; int i = 0; for (typename ParamGenerator::iterator param_it = generator.begin(); param_it != generator.end(); ++param_it, ++i) { Message test_name_stream; test_name_stream << test_info->test_base_name << "/" << i; MakeAndRegisterTestInfo( test_case_name_stream.GetString().c_str(), test_name_stream.GetString().c_str(), NULL, // No type parameter. PrintToString(*param_it).c_str(), GetTestCaseTypeId(), TestCase::SetUpTestCase, TestCase::TearDownTestCase, test_info->test_meta_factory->CreateTestFactory(*param_it)); } // for param_it } // for gen_it } // for test_it } // RegisterTests private: // LocalTestInfo structure keeps information about a single test registered // with TEST_P macro. struct TestInfo { TestInfo(const char* a_test_case_base_name, const char* a_test_base_name, TestMetaFactoryBase* a_test_meta_factory) : test_case_base_name(a_test_case_base_name), test_base_name(a_test_base_name), test_meta_factory(a_test_meta_factory) {} const string test_case_base_name; const string test_base_name; const scoped_ptr > test_meta_factory; }; typedef ::std::vector > TestInfoContainer; // Keeps pairs of // received from INSTANTIATE_TEST_CASE_P macros. typedef ::std::vector > InstantiationContainer; const string test_case_name_; TestInfoContainer tests_; InstantiationContainer instantiations_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseInfo); }; // class ParameterizedTestCaseInfo // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // ParameterizedTestCaseRegistry contains a map of ParameterizedTestCaseInfoBase // classes accessed by test case names. TEST_P and INSTANTIATE_TEST_CASE_P // macros use it to locate their corresponding ParameterizedTestCaseInfo // descriptors. class ParameterizedTestCaseRegistry { public: ParameterizedTestCaseRegistry() {} ~ParameterizedTestCaseRegistry() { for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); it != test_case_infos_.end(); ++it) { delete *it; } } // Looks up or creates and returns a structure containing information about // tests and instantiations of a particular test case. template ParameterizedTestCaseInfo* GetTestCasePatternHolder( const char* test_case_name, const char* file, int line) { ParameterizedTestCaseInfo* typed_test_info = NULL; for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); it != test_case_infos_.end(); ++it) { if ((*it)->GetTestCaseName() == test_case_name) { if ((*it)->GetTestCaseTypeId() != GetTypeId()) { // Complain about incorrect usage of Google Test facilities // and terminate the program since we cannot guaranty correct // test case setup and tear-down in this case. ReportInvalidTestCaseType(test_case_name, file, line); posix::Abort(); } else { // At this point we are sure that the object we found is of the same // type we are looking for, so we downcast it to that type // without further checks. typed_test_info = CheckedDowncastToActualType< ParameterizedTestCaseInfo >(*it); } break; } } if (typed_test_info == NULL) { typed_test_info = new ParameterizedTestCaseInfo(test_case_name); test_case_infos_.push_back(typed_test_info); } return typed_test_info; } void RegisterTests() { for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); it != test_case_infos_.end(); ++it) { (*it)->RegisterTests(); } } private: typedef ::std::vector TestCaseInfoContainer; TestCaseInfoContainer test_case_infos_; GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseRegistry); }; } // namespace internal } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ // This file was GENERATED by command: // pump.py gtest-param-util-generated.h.pump // DO NOT EDIT BY HAND!!! // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: vladl@google.com (Vlad Losev) // Type and function utilities for implementing parameterized tests. // This file is generated by a SCRIPT. DO NOT EDIT BY HAND! // // Currently Google Test supports at most 50 arguments in Values, // and at most 10 arguments in Combine. Please contact // googletestframework@googlegroups.com if you need more. // Please note that the number of arguments to Combine is limited // by the maximum arity of the implementation of tr1::tuple which is // currently set at 10. #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ // scripts/fuse_gtest.py depends on gtest's own header being #included // *unconditionally*. Therefore these #includes cannot be moved // inside #if GTEST_HAS_PARAM_TEST. #if GTEST_HAS_PARAM_TEST namespace testing { // Forward declarations of ValuesIn(), which is implemented in // include/gtest/gtest-param-test.h. template internal::ParamGenerator< typename ::testing::internal::IteratorTraits::value_type> ValuesIn(ForwardIterator begin, ForwardIterator end); template internal::ParamGenerator ValuesIn(const T (&array)[N]); template internal::ParamGenerator ValuesIn( const Container& container); namespace internal { // Used in the Values() function to provide polymorphic capabilities. template class ValueArray1 { public: explicit ValueArray1(T1 v1) : v1_(v1) {} template operator ParamGenerator() const { return ValuesIn(&v1_, &v1_ + 1); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray1& other); const T1 v1_; }; template class ValueArray2 { public: ValueArray2(T1 v1, T2 v2) : v1_(v1), v2_(v2) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray2& other); const T1 v1_; const T2 v2_; }; template class ValueArray3 { public: ValueArray3(T1 v1, T2 v2, T3 v3) : v1_(v1), v2_(v2), v3_(v3) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray3& other); const T1 v1_; const T2 v2_; const T3 v3_; }; template class ValueArray4 { public: ValueArray4(T1 v1, T2 v2, T3 v3, T4 v4) : v1_(v1), v2_(v2), v3_(v3), v4_(v4) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray4& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; }; template class ValueArray5 { public: ValueArray5(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray5& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; }; template class ValueArray6 { public: ValueArray6(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray6& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; }; template class ValueArray7 { public: ValueArray7(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray7& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; }; template class ValueArray8 { public: ValueArray8(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray8& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; }; template class ValueArray9 { public: ValueArray9(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray9& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; }; template class ValueArray10 { public: ValueArray10(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray10& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; }; template class ValueArray11 { public: ValueArray11(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray11& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; }; template class ValueArray12 { public: ValueArray12(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray12& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; }; template class ValueArray13 { public: ValueArray13(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray13& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; }; template class ValueArray14 { public: ValueArray14(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray14& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; }; template class ValueArray15 { public: ValueArray15(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray15& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; }; template class ValueArray16 { public: ValueArray16(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray16& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; }; template class ValueArray17 { public: ValueArray17(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray17& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; }; template class ValueArray18 { public: ValueArray18(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray18& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; }; template class ValueArray19 { public: ValueArray19(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray19& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; }; template class ValueArray20 { public: ValueArray20(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray20& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; }; template class ValueArray21 { public: ValueArray21(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray21& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; }; template class ValueArray22 { public: ValueArray22(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray22& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; }; template class ValueArray23 { public: ValueArray23(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray23& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; }; template class ValueArray24 { public: ValueArray24(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray24& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; }; template class ValueArray25 { public: ValueArray25(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray25& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; }; template class ValueArray26 { public: ValueArray26(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray26& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; }; template class ValueArray27 { public: ValueArray27(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray27& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; }; template class ValueArray28 { public: ValueArray28(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray28& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; }; template class ValueArray29 { public: ValueArray29(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray29& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; }; template class ValueArray30 { public: ValueArray30(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray30& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; }; template class ValueArray31 { public: ValueArray31(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray31& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; }; template class ValueArray32 { public: ValueArray32(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray32& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; }; template class ValueArray33 { public: ValueArray33(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray33& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; }; template class ValueArray34 { public: ValueArray34(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray34& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; }; template class ValueArray35 { public: ValueArray35(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray35& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; }; template class ValueArray36 { public: ValueArray36(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray36& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; }; template class ValueArray37 { public: ValueArray37(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray37& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; }; template class ValueArray38 { public: ValueArray38(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray38& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; }; template class ValueArray39 { public: ValueArray39(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray39& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; }; template class ValueArray40 { public: ValueArray40(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray40& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; }; template class ValueArray41 { public: ValueArray41(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray41& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; }; template class ValueArray42 { public: ValueArray42(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray42& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; }; template class ValueArray43 { public: ValueArray43(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray43& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; }; template class ValueArray44 { public: ValueArray44(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray44& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; }; template class ValueArray45 { public: ValueArray45(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray45& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; }; template class ValueArray46 { public: ValueArray46(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray46& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; }; template class ValueArray47 { public: ValueArray47(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray47& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; }; template class ValueArray48 { public: ValueArray48(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47), v48_(v48) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, v48_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray48& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; const T48 v48_; }; template class ValueArray49 { public: ValueArray49(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47), v48_(v48), v49_(v49) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, v48_, v49_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray49& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; const T48 v48_; const T49 v49_; }; template class ValueArray50 { public: ValueArray50(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49, T50 v50) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), v47_(v47), v48_(v48), v49_(v49), v50_(v50) {} template operator ParamGenerator() const { const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, v48_, v49_, v50_}; return ValuesIn(array); } private: // No implementation - assignment is unsupported. void operator=(const ValueArray50& other); const T1 v1_; const T2 v2_; const T3 v3_; const T4 v4_; const T5 v5_; const T6 v6_; const T7 v7_; const T8 v8_; const T9 v9_; const T10 v10_; const T11 v11_; const T12 v12_; const T13 v13_; const T14 v14_; const T15 v15_; const T16 v16_; const T17 v17_; const T18 v18_; const T19 v19_; const T20 v20_; const T21 v21_; const T22 v22_; const T23 v23_; const T24 v24_; const T25 v25_; const T26 v26_; const T27 v27_; const T28 v28_; const T29 v29_; const T30 v30_; const T31 v31_; const T32 v32_; const T33 v33_; const T34 v34_; const T35 v35_; const T36 v36_; const T37 v37_; const T38 v38_; const T39 v39_; const T40 v40_; const T41 v41_; const T42 v42_; const T43 v43_; const T44 v44_; const T45 v45_; const T46 v46_; const T47 v47_; const T48 v48_; const T49 v49_; const T50 v50_; }; # if GTEST_HAS_COMBINE // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Generates values from the Cartesian product of values produced // by the argument generators. // template class CartesianProductGenerator2 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator2(const ParamGenerator& g1, const ParamGenerator& g2) : g1_(g1), g2_(g2) {} virtual ~CartesianProductGenerator2() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current2_; if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; ParamType current_value_; }; // class CartesianProductGenerator2::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator2& other); const ParamGenerator g1_; const ParamGenerator g2_; }; // class CartesianProductGenerator2 template class CartesianProductGenerator3 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator3(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3) : g1_(g1), g2_(g2), g3_(g3) {} virtual ~CartesianProductGenerator3() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current3_; if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; ParamType current_value_; }; // class CartesianProductGenerator3::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator3& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; }; // class CartesianProductGenerator3 template class CartesianProductGenerator4 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator4(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4) : g1_(g1), g2_(g2), g3_(g3), g4_(g4) {} virtual ~CartesianProductGenerator4() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current4_; if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; ParamType current_value_; }; // class CartesianProductGenerator4::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator4& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; }; // class CartesianProductGenerator4 template class CartesianProductGenerator5 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator5(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5) {} virtual ~CartesianProductGenerator5() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current5_; if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; ParamType current_value_; }; // class CartesianProductGenerator5::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator5& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; }; // class CartesianProductGenerator5 template class CartesianProductGenerator6 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator6(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6) {} virtual ~CartesianProductGenerator6() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current6_; if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; ParamType current_value_; }; // class CartesianProductGenerator6::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator6& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; }; // class CartesianProductGenerator6 template class CartesianProductGenerator7 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator7(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7) {} virtual ~CartesianProductGenerator7() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current7_; if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; ParamType current_value_; }; // class CartesianProductGenerator7::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator7& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; }; // class CartesianProductGenerator7 template class CartesianProductGenerator8 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator8(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7, const ParamGenerator& g8) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8) {} virtual ~CartesianProductGenerator8() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin(), g8_, g8_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, g8_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7, const ParamGenerator& g8, const typename ParamGenerator::iterator& current8) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7), begin8_(g8.begin()), end8_(g8.end()), current8_(current8) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current8_; if (current8_ == end8_) { current8_ = begin8_; ++current7_; } if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_ && current8_ == typed_other->current8_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_), begin8_(other.begin8_), end8_(other.end8_), current8_(other.current8_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_, *current8_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_ || current8_ == end8_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; const typename ParamGenerator::iterator begin8_; const typename ParamGenerator::iterator end8_; typename ParamGenerator::iterator current8_; ParamType current_value_; }; // class CartesianProductGenerator8::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator8& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; const ParamGenerator g8_; }; // class CartesianProductGenerator8 template class CartesianProductGenerator9 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator9(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7, const ParamGenerator& g8, const ParamGenerator& g9) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9) {} virtual ~CartesianProductGenerator9() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin(), g8_, g8_.begin(), g9_, g9_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, g8_.end(), g9_, g9_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7, const ParamGenerator& g8, const typename ParamGenerator::iterator& current8, const ParamGenerator& g9, const typename ParamGenerator::iterator& current9) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7), begin8_(g8.begin()), end8_(g8.end()), current8_(current8), begin9_(g9.begin()), end9_(g9.end()), current9_(current9) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current9_; if (current9_ == end9_) { current9_ = begin9_; ++current8_; } if (current8_ == end8_) { current8_ = begin8_; ++current7_; } if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_ && current8_ == typed_other->current8_ && current9_ == typed_other->current9_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_), begin8_(other.begin8_), end8_(other.end8_), current8_(other.current8_), begin9_(other.begin9_), end9_(other.end9_), current9_(other.current9_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_, *current8_, *current9_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_ || current8_ == end8_ || current9_ == end9_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; const typename ParamGenerator::iterator begin8_; const typename ParamGenerator::iterator end8_; typename ParamGenerator::iterator current8_; const typename ParamGenerator::iterator begin9_; const typename ParamGenerator::iterator end9_; typename ParamGenerator::iterator current9_; ParamType current_value_; }; // class CartesianProductGenerator9::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator9& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; const ParamGenerator g8_; const ParamGenerator g9_; }; // class CartesianProductGenerator9 template class CartesianProductGenerator10 : public ParamGeneratorInterface< ::std::tr1::tuple > { public: typedef ::std::tr1::tuple ParamType; CartesianProductGenerator10(const ParamGenerator& g1, const ParamGenerator& g2, const ParamGenerator& g3, const ParamGenerator& g4, const ParamGenerator& g5, const ParamGenerator& g6, const ParamGenerator& g7, const ParamGenerator& g8, const ParamGenerator& g9, const ParamGenerator& g10) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9), g10_(g10) {} virtual ~CartesianProductGenerator10() {} virtual ParamIteratorInterface* Begin() const { return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, g7_.begin(), g8_, g8_.begin(), g9_, g9_.begin(), g10_, g10_.begin()); } virtual ParamIteratorInterface* End() const { return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, g8_.end(), g9_, g9_.end(), g10_, g10_.end()); } private: class Iterator : public ParamIteratorInterface { public: Iterator(const ParamGeneratorInterface* base, const ParamGenerator& g1, const typename ParamGenerator::iterator& current1, const ParamGenerator& g2, const typename ParamGenerator::iterator& current2, const ParamGenerator& g3, const typename ParamGenerator::iterator& current3, const ParamGenerator& g4, const typename ParamGenerator::iterator& current4, const ParamGenerator& g5, const typename ParamGenerator::iterator& current5, const ParamGenerator& g6, const typename ParamGenerator::iterator& current6, const ParamGenerator& g7, const typename ParamGenerator::iterator& current7, const ParamGenerator& g8, const typename ParamGenerator::iterator& current8, const ParamGenerator& g9, const typename ParamGenerator::iterator& current9, const ParamGenerator& g10, const typename ParamGenerator::iterator& current10) : base_(base), begin1_(g1.begin()), end1_(g1.end()), current1_(current1), begin2_(g2.begin()), end2_(g2.end()), current2_(current2), begin3_(g3.begin()), end3_(g3.end()), current3_(current3), begin4_(g4.begin()), end4_(g4.end()), current4_(current4), begin5_(g5.begin()), end5_(g5.end()), current5_(current5), begin6_(g6.begin()), end6_(g6.end()), current6_(current6), begin7_(g7.begin()), end7_(g7.end()), current7_(current7), begin8_(g8.begin()), end8_(g8.end()), current8_(current8), begin9_(g9.begin()), end9_(g9.end()), current9_(current9), begin10_(g10.begin()), end10_(g10.end()), current10_(current10) { ComputeCurrentValue(); } virtual ~Iterator() {} virtual const ParamGeneratorInterface* BaseGenerator() const { return base_; } // Advance should not be called on beyond-of-range iterators // so no component iterators must be beyond end of range, either. virtual void Advance() { assert(!AtEnd()); ++current10_; if (current10_ == end10_) { current10_ = begin10_; ++current9_; } if (current9_ == end9_) { current9_ = begin9_; ++current8_; } if (current8_ == end8_) { current8_ = begin8_; ++current7_; } if (current7_ == end7_) { current7_ = begin7_; ++current6_; } if (current6_ == end6_) { current6_ = begin6_; ++current5_; } if (current5_ == end5_) { current5_ = begin5_; ++current4_; } if (current4_ == end4_) { current4_ = begin4_; ++current3_; } if (current3_ == end3_) { current3_ = begin3_; ++current2_; } if (current2_ == end2_) { current2_ = begin2_; ++current1_; } ComputeCurrentValue(); } virtual ParamIteratorInterface* Clone() const { return new Iterator(*this); } virtual const ParamType* Current() const { return ¤t_value_; } virtual bool Equals(const ParamIteratorInterface& other) const { // Having the same base generator guarantees that the other // iterator is of the same type and we can downcast. GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) << "The program attempted to compare iterators " << "from different generators." << std::endl; const Iterator* typed_other = CheckedDowncastToActualType(&other); // We must report iterators equal if they both point beyond their // respective ranges. That can happen in a variety of fashions, // so we have to consult AtEnd(). return (AtEnd() && typed_other->AtEnd()) || ( current1_ == typed_other->current1_ && current2_ == typed_other->current2_ && current3_ == typed_other->current3_ && current4_ == typed_other->current4_ && current5_ == typed_other->current5_ && current6_ == typed_other->current6_ && current7_ == typed_other->current7_ && current8_ == typed_other->current8_ && current9_ == typed_other->current9_ && current10_ == typed_other->current10_); } private: Iterator(const Iterator& other) : base_(other.base_), begin1_(other.begin1_), end1_(other.end1_), current1_(other.current1_), begin2_(other.begin2_), end2_(other.end2_), current2_(other.current2_), begin3_(other.begin3_), end3_(other.end3_), current3_(other.current3_), begin4_(other.begin4_), end4_(other.end4_), current4_(other.current4_), begin5_(other.begin5_), end5_(other.end5_), current5_(other.current5_), begin6_(other.begin6_), end6_(other.end6_), current6_(other.current6_), begin7_(other.begin7_), end7_(other.end7_), current7_(other.current7_), begin8_(other.begin8_), end8_(other.end8_), current8_(other.current8_), begin9_(other.begin9_), end9_(other.end9_), current9_(other.current9_), begin10_(other.begin10_), end10_(other.end10_), current10_(other.current10_) { ComputeCurrentValue(); } void ComputeCurrentValue() { if (!AtEnd()) current_value_ = ParamType(*current1_, *current2_, *current3_, *current4_, *current5_, *current6_, *current7_, *current8_, *current9_, *current10_); } bool AtEnd() const { // We must report iterator past the end of the range when either of the // component iterators has reached the end of its range. return current1_ == end1_ || current2_ == end2_ || current3_ == end3_ || current4_ == end4_ || current5_ == end5_ || current6_ == end6_ || current7_ == end7_ || current8_ == end8_ || current9_ == end9_ || current10_ == end10_; } // No implementation - assignment is unsupported. void operator=(const Iterator& other); const ParamGeneratorInterface* const base_; // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. // current[i]_ is the actual traversing iterator. const typename ParamGenerator::iterator begin1_; const typename ParamGenerator::iterator end1_; typename ParamGenerator::iterator current1_; const typename ParamGenerator::iterator begin2_; const typename ParamGenerator::iterator end2_; typename ParamGenerator::iterator current2_; const typename ParamGenerator::iterator begin3_; const typename ParamGenerator::iterator end3_; typename ParamGenerator::iterator current3_; const typename ParamGenerator::iterator begin4_; const typename ParamGenerator::iterator end4_; typename ParamGenerator::iterator current4_; const typename ParamGenerator::iterator begin5_; const typename ParamGenerator::iterator end5_; typename ParamGenerator::iterator current5_; const typename ParamGenerator::iterator begin6_; const typename ParamGenerator::iterator end6_; typename ParamGenerator::iterator current6_; const typename ParamGenerator::iterator begin7_; const typename ParamGenerator::iterator end7_; typename ParamGenerator::iterator current7_; const typename ParamGenerator::iterator begin8_; const typename ParamGenerator::iterator end8_; typename ParamGenerator::iterator current8_; const typename ParamGenerator::iterator begin9_; const typename ParamGenerator::iterator end9_; typename ParamGenerator::iterator current9_; const typename ParamGenerator::iterator begin10_; const typename ParamGenerator::iterator end10_; typename ParamGenerator::iterator current10_; ParamType current_value_; }; // class CartesianProductGenerator10::Iterator // No implementation - assignment is unsupported. void operator=(const CartesianProductGenerator10& other); const ParamGenerator g1_; const ParamGenerator g2_; const ParamGenerator g3_; const ParamGenerator g4_; const ParamGenerator g5_; const ParamGenerator g6_; const ParamGenerator g7_; const ParamGenerator g8_; const ParamGenerator g9_; const ParamGenerator g10_; }; // class CartesianProductGenerator10 // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Helper classes providing Combine() with polymorphic features. They allow // casting CartesianProductGeneratorN to ParamGenerator if T is // convertible to U. // template class CartesianProductHolder2 { public: CartesianProductHolder2(const Generator1& g1, const Generator2& g2) : g1_(g1), g2_(g2) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator2( static_cast >(g1_), static_cast >(g2_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder2& other); const Generator1 g1_; const Generator2 g2_; }; // class CartesianProductHolder2 template class CartesianProductHolder3 { public: CartesianProductHolder3(const Generator1& g1, const Generator2& g2, const Generator3& g3) : g1_(g1), g2_(g2), g3_(g3) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator3( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder3& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; }; // class CartesianProductHolder3 template class CartesianProductHolder4 { public: CartesianProductHolder4(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4) : g1_(g1), g2_(g2), g3_(g3), g4_(g4) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator4( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder4& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; }; // class CartesianProductHolder4 template class CartesianProductHolder5 { public: CartesianProductHolder5(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator5( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder5& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; }; // class CartesianProductHolder5 template class CartesianProductHolder6 { public: CartesianProductHolder6(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator6( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder6& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; }; // class CartesianProductHolder6 template class CartesianProductHolder7 { public: CartesianProductHolder7(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator7( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder7& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; }; // class CartesianProductHolder7 template class CartesianProductHolder8 { public: CartesianProductHolder8(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator8( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_), static_cast >(g8_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder8& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; const Generator8 g8_; }; // class CartesianProductHolder8 template class CartesianProductHolder9 { public: CartesianProductHolder9(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator9( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_), static_cast >(g8_), static_cast >(g9_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder9& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; const Generator8 g8_; const Generator9 g9_; }; // class CartesianProductHolder9 template class CartesianProductHolder10 { public: CartesianProductHolder10(const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9, const Generator10& g10) : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), g9_(g9), g10_(g10) {} template operator ParamGenerator< ::std::tr1::tuple >() const { return ParamGenerator< ::std::tr1::tuple >( new CartesianProductGenerator10( static_cast >(g1_), static_cast >(g2_), static_cast >(g3_), static_cast >(g4_), static_cast >(g5_), static_cast >(g6_), static_cast >(g7_), static_cast >(g8_), static_cast >(g9_), static_cast >(g10_))); } private: // No implementation - assignment is unsupported. void operator=(const CartesianProductHolder10& other); const Generator1 g1_; const Generator2 g2_; const Generator3 g3_; const Generator4 g4_; const Generator5 g5_; const Generator6 g6_; const Generator7 g7_; const Generator8 g8_; const Generator9 g9_; const Generator10 g10_; }; // class CartesianProductHolder10 # endif // GTEST_HAS_COMBINE } // namespace internal } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ #if GTEST_HAS_PARAM_TEST namespace testing { // Functions producing parameter generators. // // Google Test uses these generators to produce parameters for value- // parameterized tests. When a parameterized test case is instantiated // with a particular generator, Google Test creates and runs tests // for each element in the sequence produced by the generator. // // In the following sample, tests from test case FooTest are instantiated // each three times with parameter values 3, 5, and 8: // // class FooTest : public TestWithParam { ... }; // // TEST_P(FooTest, TestThis) { // } // TEST_P(FooTest, TestThat) { // } // INSTANTIATE_TEST_CASE_P(TestSequence, FooTest, Values(3, 5, 8)); // // Range() returns generators providing sequences of values in a range. // // Synopsis: // Range(start, end) // - returns a generator producing a sequence of values {start, start+1, // start+2, ..., }. // Range(start, end, step) // - returns a generator producing a sequence of values {start, start+step, // start+step+step, ..., }. // Notes: // * The generated sequences never include end. For example, Range(1, 5) // returns a generator producing a sequence {1, 2, 3, 4}. Range(1, 9, 2) // returns a generator producing {1, 3, 5, 7}. // * start and end must have the same type. That type may be any integral or // floating-point type or a user defined type satisfying these conditions: // * It must be assignable (have operator=() defined). // * It must have operator+() (operator+(int-compatible type) for // two-operand version). // * It must have operator<() defined. // Elements in the resulting sequences will also have that type. // * Condition start < end must be satisfied in order for resulting sequences // to contain any elements. // template internal::ParamGenerator Range(T start, T end, IncrementT step) { return internal::ParamGenerator( new internal::RangeGenerator(start, end, step)); } template internal::ParamGenerator Range(T start, T end) { return Range(start, end, 1); } // ValuesIn() function allows generation of tests with parameters coming from // a container. // // Synopsis: // ValuesIn(const T (&array)[N]) // - returns a generator producing sequences with elements from // a C-style array. // ValuesIn(const Container& container) // - returns a generator producing sequences with elements from // an STL-style container. // ValuesIn(Iterator begin, Iterator end) // - returns a generator producing sequences with elements from // a range [begin, end) defined by a pair of STL-style iterators. These // iterators can also be plain C pointers. // // Please note that ValuesIn copies the values from the containers // passed in and keeps them to generate tests in RUN_ALL_TESTS(). // // Examples: // // This instantiates tests from test case StringTest // each with C-string values of "foo", "bar", and "baz": // // const char* strings[] = {"foo", "bar", "baz"}; // INSTANTIATE_TEST_CASE_P(StringSequence, SrtingTest, ValuesIn(strings)); // // This instantiates tests from test case StlStringTest // each with STL strings with values "a" and "b": // // ::std::vector< ::std::string> GetParameterStrings() { // ::std::vector< ::std::string> v; // v.push_back("a"); // v.push_back("b"); // return v; // } // // INSTANTIATE_TEST_CASE_P(CharSequence, // StlStringTest, // ValuesIn(GetParameterStrings())); // // // This will also instantiate tests from CharTest // each with parameter values 'a' and 'b': // // ::std::list GetParameterChars() { // ::std::list list; // list.push_back('a'); // list.push_back('b'); // return list; // } // ::std::list l = GetParameterChars(); // INSTANTIATE_TEST_CASE_P(CharSequence2, // CharTest, // ValuesIn(l.begin(), l.end())); // template internal::ParamGenerator< typename ::testing::internal::IteratorTraits::value_type> ValuesIn(ForwardIterator begin, ForwardIterator end) { typedef typename ::testing::internal::IteratorTraits ::value_type ParamType; return internal::ParamGenerator( new internal::ValuesInIteratorRangeGenerator(begin, end)); } template internal::ParamGenerator ValuesIn(const T (&array)[N]) { return ValuesIn(array, array + N); } template internal::ParamGenerator ValuesIn( const Container& container) { return ValuesIn(container.begin(), container.end()); } // Values() allows generating tests from explicitly specified list of // parameters. // // Synopsis: // Values(T v1, T v2, ..., T vN) // - returns a generator producing sequences with elements v1, v2, ..., vN. // // For example, this instantiates tests from test case BarTest each // with values "one", "two", and "three": // // INSTANTIATE_TEST_CASE_P(NumSequence, BarTest, Values("one", "two", "three")); // // This instantiates tests from test case BazTest each with values 1, 2, 3.5. // The exact type of values will depend on the type of parameter in BazTest. // // INSTANTIATE_TEST_CASE_P(FloatingNumbers, BazTest, Values(1, 2, 3.5)); // // Currently, Values() supports from 1 to 50 parameters. // template internal::ValueArray1 Values(T1 v1) { return internal::ValueArray1(v1); } template internal::ValueArray2 Values(T1 v1, T2 v2) { return internal::ValueArray2(v1, v2); } template internal::ValueArray3 Values(T1 v1, T2 v2, T3 v3) { return internal::ValueArray3(v1, v2, v3); } template internal::ValueArray4 Values(T1 v1, T2 v2, T3 v3, T4 v4) { return internal::ValueArray4(v1, v2, v3, v4); } template internal::ValueArray5 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5) { return internal::ValueArray5(v1, v2, v3, v4, v5); } template internal::ValueArray6 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6) { return internal::ValueArray6(v1, v2, v3, v4, v5, v6); } template internal::ValueArray7 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7) { return internal::ValueArray7(v1, v2, v3, v4, v5, v6, v7); } template internal::ValueArray8 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8) { return internal::ValueArray8(v1, v2, v3, v4, v5, v6, v7, v8); } template internal::ValueArray9 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9) { return internal::ValueArray9(v1, v2, v3, v4, v5, v6, v7, v8, v9); } template internal::ValueArray10 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10) { return internal::ValueArray10(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10); } template internal::ValueArray11 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11) { return internal::ValueArray11(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11); } template internal::ValueArray12 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12) { return internal::ValueArray12(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12); } template internal::ValueArray13 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13) { return internal::ValueArray13(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13); } template internal::ValueArray14 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14) { return internal::ValueArray14(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14); } template internal::ValueArray15 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15) { return internal::ValueArray15(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15); } template internal::ValueArray16 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16) { return internal::ValueArray16(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16); } template internal::ValueArray17 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17) { return internal::ValueArray17(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17); } template internal::ValueArray18 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18) { return internal::ValueArray18(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18); } template internal::ValueArray19 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19) { return internal::ValueArray19(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19); } template internal::ValueArray20 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20) { return internal::ValueArray20(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20); } template internal::ValueArray21 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21) { return internal::ValueArray21(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21); } template internal::ValueArray22 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22) { return internal::ValueArray22(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22); } template internal::ValueArray23 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23) { return internal::ValueArray23(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23); } template internal::ValueArray24 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24) { return internal::ValueArray24(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24); } template internal::ValueArray25 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25) { return internal::ValueArray25(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25); } template internal::ValueArray26 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26) { return internal::ValueArray26(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26); } template internal::ValueArray27 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27) { return internal::ValueArray27(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27); } template internal::ValueArray28 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28) { return internal::ValueArray28(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28); } template internal::ValueArray29 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29) { return internal::ValueArray29(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29); } template internal::ValueArray30 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30) { return internal::ValueArray30(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30); } template internal::ValueArray31 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31) { return internal::ValueArray31(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31); } template internal::ValueArray32 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32) { return internal::ValueArray32(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32); } template internal::ValueArray33 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33) { return internal::ValueArray33(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33); } template internal::ValueArray34 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34) { return internal::ValueArray34(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34); } template internal::ValueArray35 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35) { return internal::ValueArray35(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35); } template internal::ValueArray36 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36) { return internal::ValueArray36(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36); } template internal::ValueArray37 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37) { return internal::ValueArray37(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37); } template internal::ValueArray38 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38) { return internal::ValueArray38(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38); } template internal::ValueArray39 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39) { return internal::ValueArray39(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39); } template internal::ValueArray40 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40) { return internal::ValueArray40(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40); } template internal::ValueArray41 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41) { return internal::ValueArray41(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41); } template internal::ValueArray42 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42) { return internal::ValueArray42(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42); } template internal::ValueArray43 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43) { return internal::ValueArray43(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43); } template internal::ValueArray44 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44) { return internal::ValueArray44(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44); } template internal::ValueArray45 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45) { return internal::ValueArray45(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45); } template internal::ValueArray46 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46) { return internal::ValueArray46(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46); } template internal::ValueArray47 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47) { return internal::ValueArray47(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47); } template internal::ValueArray48 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48) { return internal::ValueArray48(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48); } template internal::ValueArray49 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49) { return internal::ValueArray49(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49); } template internal::ValueArray50 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49, T50 v50) { return internal::ValueArray50(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50); } // Bool() allows generating tests with parameters in a set of (false, true). // // Synopsis: // Bool() // - returns a generator producing sequences with elements {false, true}. // // It is useful when testing code that depends on Boolean flags. Combinations // of multiple flags can be tested when several Bool()'s are combined using // Combine() function. // // In the following example all tests in the test case FlagDependentTest // will be instantiated twice with parameters false and true. // // class FlagDependentTest : public testing::TestWithParam { // virtual void SetUp() { // external_flag = GetParam(); // } // } // INSTANTIATE_TEST_CASE_P(BoolSequence, FlagDependentTest, Bool()); // inline internal::ParamGenerator Bool() { return Values(false, true); } # if GTEST_HAS_COMBINE // Combine() allows the user to combine two or more sequences to produce // values of a Cartesian product of those sequences' elements. // // Synopsis: // Combine(gen1, gen2, ..., genN) // - returns a generator producing sequences with elements coming from // the Cartesian product of elements from the sequences generated by // gen1, gen2, ..., genN. The sequence elements will have a type of // tuple where T1, T2, ..., TN are the types // of elements from sequences produces by gen1, gen2, ..., genN. // // Combine can have up to 10 arguments. This number is currently limited // by the maximum number of elements in the tuple implementation used by Google // Test. // // Example: // // This will instantiate tests in test case AnimalTest each one with // the parameter values tuple("cat", BLACK), tuple("cat", WHITE), // tuple("dog", BLACK), and tuple("dog", WHITE): // // enum Color { BLACK, GRAY, WHITE }; // class AnimalTest // : public testing::TestWithParam > {...}; // // TEST_P(AnimalTest, AnimalLooksNice) {...} // // INSTANTIATE_TEST_CASE_P(AnimalVariations, AnimalTest, // Combine(Values("cat", "dog"), // Values(BLACK, WHITE))); // // This will instantiate tests in FlagDependentTest with all variations of two // Boolean flags: // // class FlagDependentTest // : public testing::TestWithParam > { // virtual void SetUp() { // // Assigns external_flag_1 and external_flag_2 values from the tuple. // tie(external_flag_1, external_flag_2) = GetParam(); // } // }; // // TEST_P(FlagDependentTest, TestFeature1) { // // Test your code using external_flag_1 and external_flag_2 here. // } // INSTANTIATE_TEST_CASE_P(TwoBoolSequence, FlagDependentTest, // Combine(Bool(), Bool())); // template internal::CartesianProductHolder2 Combine( const Generator1& g1, const Generator2& g2) { return internal::CartesianProductHolder2( g1, g2); } template internal::CartesianProductHolder3 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3) { return internal::CartesianProductHolder3( g1, g2, g3); } template internal::CartesianProductHolder4 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4) { return internal::CartesianProductHolder4( g1, g2, g3, g4); } template internal::CartesianProductHolder5 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5) { return internal::CartesianProductHolder5( g1, g2, g3, g4, g5); } template internal::CartesianProductHolder6 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6) { return internal::CartesianProductHolder6( g1, g2, g3, g4, g5, g6); } template internal::CartesianProductHolder7 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7) { return internal::CartesianProductHolder7( g1, g2, g3, g4, g5, g6, g7); } template internal::CartesianProductHolder8 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8) { return internal::CartesianProductHolder8( g1, g2, g3, g4, g5, g6, g7, g8); } template internal::CartesianProductHolder9 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9) { return internal::CartesianProductHolder9( g1, g2, g3, g4, g5, g6, g7, g8, g9); } template internal::CartesianProductHolder10 Combine( const Generator1& g1, const Generator2& g2, const Generator3& g3, const Generator4& g4, const Generator5& g5, const Generator6& g6, const Generator7& g7, const Generator8& g8, const Generator9& g9, const Generator10& g10) { return internal::CartesianProductHolder10( g1, g2, g3, g4, g5, g6, g7, g8, g9, g10); } # endif // GTEST_HAS_COMBINE # define TEST_P(test_case_name, test_name) \ class GTEST_TEST_CLASS_NAME_(test_case_name, test_name) \ : public test_case_name { \ public: \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {} \ virtual void TestBody(); \ private: \ static int AddToRegistry() { \ ::testing::UnitTest::GetInstance()->parameterized_test_registry(). \ GetTestCasePatternHolder(\ #test_case_name, __FILE__, __LINE__)->AddTestPattern(\ #test_case_name, \ #test_name, \ new ::testing::internal::TestMetaFactory< \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)>()); \ return 0; \ } \ static int gtest_registering_dummy_; \ GTEST_DISALLOW_COPY_AND_ASSIGN_(\ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)); \ }; \ int GTEST_TEST_CLASS_NAME_(test_case_name, \ test_name)::gtest_registering_dummy_ = \ GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::AddToRegistry(); \ void GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody() # define INSTANTIATE_TEST_CASE_P(prefix, test_case_name, generator) \ ::testing::internal::ParamGenerator \ gtest_##prefix##test_case_name##_EvalGenerator_() { return generator; } \ int gtest_##prefix##test_case_name##_dummy_ = \ ::testing::UnitTest::GetInstance()->parameterized_test_registry(). \ GetTestCasePatternHolder(\ #test_case_name, __FILE__, __LINE__)->AddTestCaseInstantiation(\ #prefix, \ >est_##prefix##test_case_name##_EvalGenerator_, \ __FILE__, __LINE__) } // namespace testing #endif // GTEST_HAS_PARAM_TEST #endif // GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ // Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan) // // Google C++ Testing Framework definitions useful in production code. #ifndef GTEST_INCLUDE_GTEST_GTEST_PROD_H_ #define GTEST_INCLUDE_GTEST_GTEST_PROD_H_ // When you need to test the private or protected members of a class, // use the FRIEND_TEST macro to declare your tests as friends of the // class. For example: // // class MyClass { // private: // void MyMethod(); // FRIEND_TEST(MyClassTest, MyMethod); // }; // // class MyClassTest : public testing::Test { // // ... // }; // // TEST_F(MyClassTest, MyMethod) { // // Can call MyClass::MyMethod() here. // } #define FRIEND_TEST(test_case_name, test_name)\ friend class test_case_name##_##test_name##_Test #endif // GTEST_INCLUDE_GTEST_GTEST_PROD_H_ // Copyright 2008, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: mheule@google.com (Markus Heule) // #ifndef GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ #define GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ #include #include namespace testing { // A copyable object representing the result of a test part (i.e. an // assertion or an explicit FAIL(), ADD_FAILURE(), or SUCCESS()). // // Don't inherit from TestPartResult as its destructor is not virtual. class GTEST_API_ TestPartResult { public: // The possible outcomes of a test part (i.e. an assertion or an // explicit SUCCEED(), FAIL(), or ADD_FAILURE()). enum Type { kSuccess, // Succeeded. kNonFatalFailure, // Failed but the test can continue. kFatalFailure // Failed and the test should be terminated. }; // C'tor. TestPartResult does NOT have a default constructor. // Always use this constructor (with parameters) to create a // TestPartResult object. TestPartResult(Type a_type, const char* a_file_name, int a_line_number, const char* a_message) : type_(a_type), file_name_(a_file_name), line_number_(a_line_number), summary_(ExtractSummary(a_message)), message_(a_message) { } // Gets the outcome of the test part. Type type() const { return type_; } // Gets the name of the source file where the test part took place, or // NULL if it's unknown. const char* file_name() const { return file_name_.c_str(); } // Gets the line in the source file where the test part took place, // or -1 if it's unknown. int line_number() const { return line_number_; } // Gets the summary of the failure message. const char* summary() const { return summary_.c_str(); } // Gets the message associated with the test part. const char* message() const { return message_.c_str(); } // Returns true iff the test part passed. bool passed() const { return type_ == kSuccess; } // Returns true iff the test part failed. bool failed() const { return type_ != kSuccess; } // Returns true iff the test part non-fatally failed. bool nonfatally_failed() const { return type_ == kNonFatalFailure; } // Returns true iff the test part fatally failed. bool fatally_failed() const { return type_ == kFatalFailure; } private: Type type_; // Gets the summary of the failure message by omitting the stack // trace in it. static internal::String ExtractSummary(const char* message); // The name of the source file where the test part took place, or // NULL if the source file is unknown. internal::String file_name_; // The line in the source file where the test part took place, or -1 // if the line number is unknown. int line_number_; internal::String summary_; // The test failure summary. internal::String message_; // The test failure message. }; // Prints a TestPartResult object. std::ostream& operator<<(std::ostream& os, const TestPartResult& result); // An array of TestPartResult objects. // // Don't inherit from TestPartResultArray as its destructor is not // virtual. class GTEST_API_ TestPartResultArray { public: TestPartResultArray() {} // Appends the given TestPartResult to the array. void Append(const TestPartResult& result); // Returns the TestPartResult at the given index (0-based). const TestPartResult& GetTestPartResult(int index) const; // Returns the number of TestPartResult objects in the array. int size() const; private: std::vector array_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TestPartResultArray); }; // This interface knows how to report a test part result. class TestPartResultReporterInterface { public: virtual ~TestPartResultReporterInterface() {} virtual void ReportTestPartResult(const TestPartResult& result) = 0; }; namespace internal { // This helper class is used by {ASSERT|EXPECT}_NO_FATAL_FAILURE to check if a // statement generates new fatal failures. To do so it registers itself as the // current test part result reporter. Besides checking if fatal failures were // reported, it only delegates the reporting to the former result reporter. // The original result reporter is restored in the destructor. // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. class GTEST_API_ HasNewFatalFailureHelper : public TestPartResultReporterInterface { public: HasNewFatalFailureHelper(); virtual ~HasNewFatalFailureHelper(); virtual void ReportTestPartResult(const TestPartResult& result); bool has_new_fatal_failure() const { return has_new_fatal_failure_; } private: bool has_new_fatal_failure_; TestPartResultReporterInterface* original_reporter_; GTEST_DISALLOW_COPY_AND_ASSIGN_(HasNewFatalFailureHelper); }; } // namespace internal } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ // Copyright 2008 Google Inc. // All Rights Reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Author: wan@google.com (Zhanyong Wan) #ifndef GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ #define GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ // This header implements typed tests and type-parameterized tests. // Typed (aka type-driven) tests repeat the same test for types in a // list. You must know which types you want to test with when writing // typed tests. Here's how you do it: #if 0 // First, define a fixture class template. It should be parameterized // by a type. Remember to derive it from testing::Test. template class FooTest : public testing::Test { public: ... typedef std::list List; static T shared_; T value_; }; // Next, associate a list of types with the test case, which will be // repeated for each type in the list. The typedef is necessary for // the macro to parse correctly. typedef testing::Types MyTypes; TYPED_TEST_CASE(FooTest, MyTypes); // If the type list contains only one type, you can write that type // directly without Types<...>: // TYPED_TEST_CASE(FooTest, int); // Then, use TYPED_TEST() instead of TEST_F() to define as many typed // tests for this test case as you want. TYPED_TEST(FooTest, DoesBlah) { // Inside a test, refer to TypeParam to get the type parameter. // Since we are inside a derived class template, C++ requires use to // visit the members of FooTest via 'this'. TypeParam n = this->value_; // To visit static members of the fixture, add the TestFixture:: // prefix. n += TestFixture::shared_; // To refer to typedefs in the fixture, add the "typename // TestFixture::" prefix. typename TestFixture::List values; values.push_back(n); ... } TYPED_TEST(FooTest, HasPropertyA) { ... } #endif // 0 // Type-parameterized tests are abstract test patterns parameterized // by a type. Compared with typed tests, type-parameterized tests // allow you to define the test pattern without knowing what the type // parameters are. The defined pattern can be instantiated with // different types any number of times, in any number of translation // units. // // If you are designing an interface or concept, you can define a // suite of type-parameterized tests to verify properties that any // valid implementation of the interface/concept should have. Then, // each implementation can easily instantiate the test suite to verify // that it conforms to the requirements, without having to write // similar tests repeatedly. Here's an example: #if 0 // First, define a fixture class template. It should be parameterized // by a type. Remember to derive it from testing::Test. template class FooTest : public testing::Test { ... }; // Next, declare that you will define a type-parameterized test case // (the _P suffix is for "parameterized" or "pattern", whichever you // prefer): TYPED_TEST_CASE_P(FooTest); // Then, use TYPED_TEST_P() to define as many type-parameterized tests // for this type-parameterized test case as you want. TYPED_TEST_P(FooTest, DoesBlah) { // Inside a test, refer to TypeParam to get the type parameter. TypeParam n = 0; ... } TYPED_TEST_P(FooTest, HasPropertyA) { ... } // Now the tricky part: you need to register all test patterns before // you can instantiate them. The first argument of the macro is the // test case name; the rest are the names of the tests in this test // case. REGISTER_TYPED_TEST_CASE_P(FooTest, DoesBlah, HasPropertyA); // Finally, you are free to instantiate the pattern with the types you // want. If you put the above code in a header file, you can #include // it in multiple C++ source files and instantiate it multiple times. // // To distinguish different instances of the pattern, the first // argument to the INSTANTIATE_* macro is a prefix that will be added // to the actual test case name. Remember to pick unique prefixes for // different instances. typedef testing::Types MyTypes; INSTANTIATE_TYPED_TEST_CASE_P(My, FooTest, MyTypes); // If the type list contains only one type, you can write that type // directly without Types<...>: // INSTANTIATE_TYPED_TEST_CASE_P(My, FooTest, int); #endif // 0 // Implements typed tests. #if GTEST_HAS_TYPED_TEST // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Expands to the name of the typedef for the type parameters of the // given test case. # define GTEST_TYPE_PARAMS_(TestCaseName) gtest_type_params_##TestCaseName##_ // The 'Types' template argument below must have spaces around it // since some compilers may choke on '>>' when passing a template // instance (e.g. Types) # define TYPED_TEST_CASE(CaseName, Types) \ typedef ::testing::internal::TypeList< Types >::type \ GTEST_TYPE_PARAMS_(CaseName) # define TYPED_TEST(CaseName, TestName) \ template \ class GTEST_TEST_CLASS_NAME_(CaseName, TestName) \ : public CaseName { \ private: \ typedef CaseName TestFixture; \ typedef gtest_TypeParam_ TypeParam; \ virtual void TestBody(); \ }; \ bool gtest_##CaseName##_##TestName##_registered_ GTEST_ATTRIBUTE_UNUSED_ = \ ::testing::internal::TypeParameterizedTest< \ CaseName, \ ::testing::internal::TemplateSel< \ GTEST_TEST_CLASS_NAME_(CaseName, TestName)>, \ GTEST_TYPE_PARAMS_(CaseName)>::Register(\ "", #CaseName, #TestName, 0); \ template \ void GTEST_TEST_CLASS_NAME_(CaseName, TestName)::TestBody() #endif // GTEST_HAS_TYPED_TEST // Implements type-parameterized tests. #if GTEST_HAS_TYPED_TEST_P // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Expands to the namespace name that the type-parameterized tests for // the given type-parameterized test case are defined in. The exact // name of the namespace is subject to change without notice. # define GTEST_CASE_NAMESPACE_(TestCaseName) \ gtest_case_##TestCaseName##_ // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // // Expands to the name of the variable used to remember the names of // the defined tests in the given test case. # define GTEST_TYPED_TEST_CASE_P_STATE_(TestCaseName) \ gtest_typed_test_case_p_state_##TestCaseName##_ // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE DIRECTLY. // // Expands to the name of the variable used to remember the names of // the registered tests in the given test case. # define GTEST_REGISTERED_TEST_NAMES_(TestCaseName) \ gtest_registered_test_names_##TestCaseName##_ // The variables defined in the type-parameterized test macros are // static as typically these macros are used in a .h file that can be // #included in multiple translation units linked together. # define TYPED_TEST_CASE_P(CaseName) \ static ::testing::internal::TypedTestCasePState \ GTEST_TYPED_TEST_CASE_P_STATE_(CaseName) # define TYPED_TEST_P(CaseName, TestName) \ namespace GTEST_CASE_NAMESPACE_(CaseName) { \ template \ class TestName : public CaseName { \ private: \ typedef CaseName TestFixture; \ typedef gtest_TypeParam_ TypeParam; \ virtual void TestBody(); \ }; \ static bool gtest_##TestName##_defined_ GTEST_ATTRIBUTE_UNUSED_ = \ GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).AddTestName(\ __FILE__, __LINE__, #CaseName, #TestName); \ } \ template \ void GTEST_CASE_NAMESPACE_(CaseName)::TestName::TestBody() # define REGISTER_TYPED_TEST_CASE_P(CaseName, ...) \ namespace GTEST_CASE_NAMESPACE_(CaseName) { \ typedef ::testing::internal::Templates<__VA_ARGS__>::type gtest_AllTests_; \ } \ static const char* const GTEST_REGISTERED_TEST_NAMES_(CaseName) = \ GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).VerifyRegisteredTestNames(\ __FILE__, __LINE__, #__VA_ARGS__) // The 'Types' template argument below must have spaces around it // since some compilers may choke on '>>' when passing a template // instance (e.g. Types) # define INSTANTIATE_TYPED_TEST_CASE_P(Prefix, CaseName, Types) \ bool gtest_##Prefix##_##CaseName GTEST_ATTRIBUTE_UNUSED_ = \ ::testing::internal::TypeParameterizedTestCase::type>::Register(\ #Prefix, #CaseName, GTEST_REGISTERED_TEST_NAMES_(CaseName)) #endif // GTEST_HAS_TYPED_TEST_P #endif // GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ // Depending on the platform, different string classes are available. // On Linux, in addition to ::std::string, Google also makes use of // class ::string, which has the same interface as ::std::string, but // has a different implementation. // // The user can define GTEST_HAS_GLOBAL_STRING to 1 to indicate that // ::string is available AND is a distinct type to ::std::string, or // define it to 0 to indicate otherwise. // // If the user's ::std::string and ::string are the same class due to // aliasing, he should define GTEST_HAS_GLOBAL_STRING to 0. // // If the user doesn't define GTEST_HAS_GLOBAL_STRING, it is defined // heuristically. namespace testing { // Declares the flags. // This flag temporary enables the disabled tests. GTEST_DECLARE_bool_(also_run_disabled_tests); // This flag brings the debugger on an assertion failure. GTEST_DECLARE_bool_(break_on_failure); // This flag controls whether Google Test catches all test-thrown exceptions // and logs them as failures. GTEST_DECLARE_bool_(catch_exceptions); // This flag enables using colors in terminal output. Available values are // "yes" to enable colors, "no" (disable colors), or "auto" (the default) // to let Google Test decide. GTEST_DECLARE_string_(color); // This flag sets up the filter to select by name using a glob pattern // the tests to run. If the filter is not given all tests are executed. GTEST_DECLARE_string_(filter); // This flag causes the Google Test to list tests. None of the tests listed // are actually run if the flag is provided. GTEST_DECLARE_bool_(list_tests); // This flag controls whether Google Test emits a detailed XML report to a file // in addition to its normal textual output. GTEST_DECLARE_string_(output); // This flags control whether Google Test prints the elapsed time for each // test. GTEST_DECLARE_bool_(print_time); // This flag specifies the random number seed. GTEST_DECLARE_int32_(random_seed); // This flag sets how many times the tests are repeated. The default value // is 1. If the value is -1 the tests are repeating forever. GTEST_DECLARE_int32_(repeat); // This flag controls whether Google Test includes Google Test internal // stack frames in failure stack traces. GTEST_DECLARE_bool_(show_internal_stack_frames); // When this flag is specified, tests' order is randomized on every iteration. GTEST_DECLARE_bool_(shuffle); // This flag specifies the maximum number of stack frames to be // printed in a failure message. GTEST_DECLARE_int32_(stack_trace_depth); // When this flag is specified, a failed assertion will throw an // exception if exceptions are enabled, or exit the program with a // non-zero code otherwise. GTEST_DECLARE_bool_(throw_on_failure); // When this flag is set with a "host:port" string, on supported // platforms test results are streamed to the specified port on // the specified host machine. GTEST_DECLARE_string_(stream_result_to); // The upper limit for valid stack trace depths. const int kMaxStackTraceDepth = 100; namespace internal { class AssertHelper; class DefaultGlobalTestPartResultReporter; class ExecDeathTest; class NoExecDeathTest; class FinalSuccessChecker; class GTestFlagSaver; class TestResultAccessor; class TestEventListenersAccessor; class TestEventRepeater; class WindowsDeathTest; class UnitTestImpl* GetUnitTestImpl(); void ReportFailureInUnknownLocation(TestPartResult::Type result_type, const String& message); // Converts a streamable value to a String. A NULL pointer is // converted to "(null)". When the input value is a ::string, // ::std::string, ::wstring, or ::std::wstring object, each NUL // character in it is replaced with "\\0". // Declared in gtest-internal.h but defined here, so that it has access // to the definition of the Message class, required by the ARM // compiler. template String StreamableToString(const T& streamable) { return (Message() << streamable).GetString(); } } // namespace internal // The friend relationship of some of these classes is cyclic. // If we don't forward declare them the compiler might confuse the classes // in friendship clauses with same named classes on the scope. class Test; class TestCase; class TestInfo; class UnitTest; // A class for indicating whether an assertion was successful. When // the assertion wasn't successful, the AssertionResult object // remembers a non-empty message that describes how it failed. // // To create an instance of this class, use one of the factory functions // (AssertionSuccess() and AssertionFailure()). // // This class is useful for two purposes: // 1. Defining predicate functions to be used with Boolean test assertions // EXPECT_TRUE/EXPECT_FALSE and their ASSERT_ counterparts // 2. Defining predicate-format functions to be // used with predicate assertions (ASSERT_PRED_FORMAT*, etc). // // For example, if you define IsEven predicate: // // testing::AssertionResult IsEven(int n) { // if ((n % 2) == 0) // return testing::AssertionSuccess(); // else // return testing::AssertionFailure() << n << " is odd"; // } // // Then the failed expectation EXPECT_TRUE(IsEven(Fib(5))) // will print the message // // Value of: IsEven(Fib(5)) // Actual: false (5 is odd) // Expected: true // // instead of a more opaque // // Value of: IsEven(Fib(5)) // Actual: false // Expected: true // // in case IsEven is a simple Boolean predicate. // // If you expect your predicate to be reused and want to support informative // messages in EXPECT_FALSE and ASSERT_FALSE (negative assertions show up // about half as often as positive ones in our tests), supply messages for // both success and failure cases: // // testing::AssertionResult IsEven(int n) { // if ((n % 2) == 0) // return testing::AssertionSuccess() << n << " is even"; // else // return testing::AssertionFailure() << n << " is odd"; // } // // Then a statement EXPECT_FALSE(IsEven(Fib(6))) will print // // Value of: IsEven(Fib(6)) // Actual: true (8 is even) // Expected: false // // NB: Predicates that support negative Boolean assertions have reduced // performance in positive ones so be careful not to use them in tests // that have lots (tens of thousands) of positive Boolean assertions. // // To use this class with EXPECT_PRED_FORMAT assertions such as: // // // Verifies that Foo() returns an even number. // EXPECT_PRED_FORMAT1(IsEven, Foo()); // // you need to define: // // testing::AssertionResult IsEven(const char* expr, int n) { // if ((n % 2) == 0) // return testing::AssertionSuccess(); // else // return testing::AssertionFailure() // << "Expected: " << expr << " is even\n Actual: it's " << n; // } // // If Foo() returns 5, you will see the following message: // // Expected: Foo() is even // Actual: it's 5 // class GTEST_API_ AssertionResult { public: // Copy constructor. // Used in EXPECT_TRUE/FALSE(assertion_result). AssertionResult(const AssertionResult& other); // Used in the EXPECT_TRUE/FALSE(bool_expression). explicit AssertionResult(bool success) : success_(success) {} // Returns true iff the assertion succeeded. operator bool() const { return success_; } // NOLINT // Returns the assertion's negation. Used with EXPECT/ASSERT_FALSE. AssertionResult operator!() const; // Returns the text streamed into this AssertionResult. Test assertions // use it when they fail (i.e., the predicate's outcome doesn't match the // assertion's expectation). When nothing has been streamed into the // object, returns an empty string. const char* message() const { return message_.get() != NULL ? message_->c_str() : ""; } // TODO(vladl@google.com): Remove this after making sure no clients use it. // Deprecated; please use message() instead. const char* failure_message() const { return message(); } // Streams a custom failure message into this object. template AssertionResult& operator<<(const T& value) { AppendMessage(Message() << value); return *this; } // Allows streaming basic output manipulators such as endl or flush into // this object. AssertionResult& operator<<( ::std::ostream& (*basic_manipulator)(::std::ostream& stream)) { AppendMessage(Message() << basic_manipulator); return *this; } private: // Appends the contents of message to message_. void AppendMessage(const Message& a_message) { if (message_.get() == NULL) message_.reset(new ::std::string); message_->append(a_message.GetString().c_str()); } // Stores result of the assertion predicate. bool success_; // Stores the message describing the condition in case the expectation // construct is not satisfied with the predicate's outcome. // Referenced via a pointer to avoid taking too much stack frame space // with test assertions. internal::scoped_ptr< ::std::string> message_; GTEST_DISALLOW_ASSIGN_(AssertionResult); }; // Makes a successful assertion result. GTEST_API_ AssertionResult AssertionSuccess(); // Makes a failed assertion result. GTEST_API_ AssertionResult AssertionFailure(); // Makes a failed assertion result with the given failure message. // Deprecated; use AssertionFailure() << msg. GTEST_API_ AssertionResult AssertionFailure(const Message& msg); // The abstract class that all tests inherit from. // // In Google Test, a unit test program contains one or many TestCases, and // each TestCase contains one or many Tests. // // When you define a test using the TEST macro, you don't need to // explicitly derive from Test - the TEST macro automatically does // this for you. // // The only time you derive from Test is when defining a test fixture // to be used a TEST_F. For example: // // class FooTest : public testing::Test { // protected: // virtual void SetUp() { ... } // virtual void TearDown() { ... } // ... // }; // // TEST_F(FooTest, Bar) { ... } // TEST_F(FooTest, Baz) { ... } // // Test is not copyable. class GTEST_API_ Test { public: friend class TestInfo; // Defines types for pointers to functions that set up and tear down // a test case. typedef internal::SetUpTestCaseFunc SetUpTestCaseFunc; typedef internal::TearDownTestCaseFunc TearDownTestCaseFunc; // The d'tor is virtual as we intend to inherit from Test. virtual ~Test(); // Sets up the stuff shared by all tests in this test case. // // Google Test will call Foo::SetUpTestCase() before running the first // test in test case Foo. Hence a sub-class can define its own // SetUpTestCase() method to shadow the one defined in the super // class. static void SetUpTestCase() {} // Tears down the stuff shared by all tests in this test case. // // Google Test will call Foo::TearDownTestCase() after running the last // test in test case Foo. Hence a sub-class can define its own // TearDownTestCase() method to shadow the one defined in the super // class. static void TearDownTestCase() {} // Returns true iff the current test has a fatal failure. static bool HasFatalFailure(); // Returns true iff the current test has a non-fatal failure. static bool HasNonfatalFailure(); // Returns true iff the current test has a (either fatal or // non-fatal) failure. static bool HasFailure() { return HasFatalFailure() || HasNonfatalFailure(); } // Logs a property for the current test. Only the last value for a given // key is remembered. // These are public static so they can be called from utility functions // that are not members of the test fixture. // The arguments are const char* instead strings, as Google Test is used // on platforms where string doesn't compile. // // Note that a driving consideration for these RecordProperty methods // was to produce xml output suited to the Greenspan charting utility, // which at present will only chart values that fit in a 32-bit int. It // is the user's responsibility to restrict their values to 32-bit ints // if they intend them to be used with Greenspan. static void RecordProperty(const char* key, const char* value); static void RecordProperty(const char* key, int value); protected: // Creates a Test object. Test(); // Sets up the test fixture. virtual void SetUp(); // Tears down the test fixture. virtual void TearDown(); private: // Returns true iff the current test has the same fixture class as // the first test in the current test case. static bool HasSameFixtureClass(); // Runs the test after the test fixture has been set up. // // A sub-class must implement this to define the test logic. // // DO NOT OVERRIDE THIS FUNCTION DIRECTLY IN A USER PROGRAM. // Instead, use the TEST or TEST_F macro. virtual void TestBody() = 0; // Sets up, executes, and tears down the test. void Run(); // Deletes self. We deliberately pick an unusual name for this // internal method to avoid clashing with names used in user TESTs. void DeleteSelf_() { delete this; } // Uses a GTestFlagSaver to save and restore all Google Test flags. const internal::GTestFlagSaver* const gtest_flag_saver_; // Often a user mis-spells SetUp() as Setup() and spends a long time // wondering why it is never called by Google Test. The declaration of // the following method is solely for catching such an error at // compile time: // // - The return type is deliberately chosen to be not void, so it // will be a conflict if a user declares void Setup() in his test // fixture. // // - This method is private, so it will be another compiler error // if a user calls it from his test fixture. // // DO NOT OVERRIDE THIS FUNCTION. // // If you see an error about overriding the following function or // about it being private, you have mis-spelled SetUp() as Setup(). struct Setup_should_be_spelled_SetUp {}; virtual Setup_should_be_spelled_SetUp* Setup() { return NULL; } // We disallow copying Tests. GTEST_DISALLOW_COPY_AND_ASSIGN_(Test); }; typedef internal::TimeInMillis TimeInMillis; // A copyable object representing a user specified test property which can be // output as a key/value string pair. // // Don't inherit from TestProperty as its destructor is not virtual. class TestProperty { public: // C'tor. TestProperty does NOT have a default constructor. // Always use this constructor (with parameters) to create a // TestProperty object. TestProperty(const char* a_key, const char* a_value) : key_(a_key), value_(a_value) { } // Gets the user supplied key. const char* key() const { return key_.c_str(); } // Gets the user supplied value. const char* value() const { return value_.c_str(); } // Sets a new value, overriding the one supplied in the constructor. void SetValue(const char* new_value) { value_ = new_value; } private: // The key supplied by the user. internal::String key_; // The value supplied by the user. internal::String value_; }; // The result of a single Test. This includes a list of // TestPartResults, a list of TestProperties, a count of how many // death tests there are in the Test, and how much time it took to run // the Test. // // TestResult is not copyable. class GTEST_API_ TestResult { public: // Creates an empty TestResult. TestResult(); // D'tor. Do not inherit from TestResult. ~TestResult(); // Gets the number of all test parts. This is the sum of the number // of successful test parts and the number of failed test parts. int total_part_count() const; // Returns the number of the test properties. int test_property_count() const; // Returns true iff the test passed (i.e. no test part failed). bool Passed() const { return !Failed(); } // Returns true iff the test failed. bool Failed() const; // Returns true iff the test fatally failed. bool HasFatalFailure() const; // Returns true iff the test has a non-fatal failure. bool HasNonfatalFailure() const; // Returns the elapsed time, in milliseconds. TimeInMillis elapsed_time() const { return elapsed_time_; } // Returns the i-th test part result among all the results. i can range // from 0 to test_property_count() - 1. If i is not in that range, aborts // the program. const TestPartResult& GetTestPartResult(int i) const; // Returns the i-th test property. i can range from 0 to // test_property_count() - 1. If i is not in that range, aborts the // program. const TestProperty& GetTestProperty(int i) const; private: friend class TestInfo; friend class UnitTest; friend class internal::DefaultGlobalTestPartResultReporter; friend class internal::ExecDeathTest; friend class internal::TestResultAccessor; friend class internal::UnitTestImpl; friend class internal::WindowsDeathTest; // Gets the vector of TestPartResults. const std::vector& test_part_results() const { return test_part_results_; } // Gets the vector of TestProperties. const std::vector& test_properties() const { return test_properties_; } // Sets the elapsed time. void set_elapsed_time(TimeInMillis elapsed) { elapsed_time_ = elapsed; } // Adds a test property to the list. The property is validated and may add // a non-fatal failure if invalid (e.g., if it conflicts with reserved // key names). If a property is already recorded for the same key, the // value will be updated, rather than storing multiple values for the same // key. void RecordProperty(const TestProperty& test_property); // Adds a failure if the key is a reserved attribute of Google Test // testcase tags. Returns true if the property is valid. // TODO(russr): Validate attribute names are legal and human readable. static bool ValidateTestProperty(const TestProperty& test_property); // Adds a test part result to the list. void AddTestPartResult(const TestPartResult& test_part_result); // Returns the death test count. int death_test_count() const { return death_test_count_; } // Increments the death test count, returning the new count. int increment_death_test_count() { return ++death_test_count_; } // Clears the test part results. void ClearTestPartResults(); // Clears the object. void Clear(); // Protects mutable state of the property vector and of owned // properties, whose values may be updated. internal::Mutex test_properites_mutex_; // The vector of TestPartResults std::vector test_part_results_; // The vector of TestProperties std::vector test_properties_; // Running count of death tests. int death_test_count_; // The elapsed time, in milliseconds. TimeInMillis elapsed_time_; // We disallow copying TestResult. GTEST_DISALLOW_COPY_AND_ASSIGN_(TestResult); }; // class TestResult // A TestInfo object stores the following information about a test: // // Test case name // Test name // Whether the test should be run // A function pointer that creates the test object when invoked // Test result // // The constructor of TestInfo registers itself with the UnitTest // singleton such that the RUN_ALL_TESTS() macro knows which tests to // run. class GTEST_API_ TestInfo { public: // Destructs a TestInfo object. This function is not virtual, so // don't inherit from TestInfo. ~TestInfo(); // Returns the test case name. const char* test_case_name() const { return test_case_name_.c_str(); } // Returns the test name. const char* name() const { return name_.c_str(); } // Returns the name of the parameter type, or NULL if this is not a typed // or a type-parameterized test. const char* type_param() const { if (type_param_.get() != NULL) return type_param_->c_str(); return NULL; } // Returns the text representation of the value parameter, or NULL if this // is not a value-parameterized test. const char* value_param() const { if (value_param_.get() != NULL) return value_param_->c_str(); return NULL; } // Returns true if this test should run, that is if the test is not disabled // (or it is disabled but the also_run_disabled_tests flag has been specified) // and its full name matches the user-specified filter. // // Google Test allows the user to filter the tests by their full names. // The full name of a test Bar in test case Foo is defined as // "Foo.Bar". Only the tests that match the filter will run. // // A filter is a colon-separated list of glob (not regex) patterns, // optionally followed by a '-' and a colon-separated list of // negative patterns (tests to exclude). A test is run if it // matches one of the positive patterns and does not match any of // the negative patterns. // // For example, *A*:Foo.* is a filter that matches any string that // contains the character 'A' or starts with "Foo.". bool should_run() const { return should_run_; } // Returns the result of the test. const TestResult* result() const { return &result_; } private: #if GTEST_HAS_DEATH_TEST friend class internal::DefaultDeathTestFactory; #endif // GTEST_HAS_DEATH_TEST friend class Test; friend class TestCase; friend class internal::UnitTestImpl; friend TestInfo* internal::MakeAndRegisterTestInfo( const char* test_case_name, const char* name, const char* type_param, const char* value_param, internal::TypeId fixture_class_id, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc, internal::TestFactoryBase* factory); // Constructs a TestInfo object. The newly constructed instance assumes // ownership of the factory object. TestInfo(const char* test_case_name, const char* name, const char* a_type_param, const char* a_value_param, internal::TypeId fixture_class_id, internal::TestFactoryBase* factory); // Increments the number of death tests encountered in this test so // far. int increment_death_test_count() { return result_.increment_death_test_count(); } // Creates the test object, runs it, records its result, and then // deletes it. void Run(); static void ClearTestResult(TestInfo* test_info) { test_info->result_.Clear(); } // These fields are immutable properties of the test. const std::string test_case_name_; // Test case name const std::string name_; // Test name // Name of the parameter type, or NULL if this is not a typed or a // type-parameterized test. const internal::scoped_ptr type_param_; // Text representation of the value parameter, or NULL if this is not a // value-parameterized test. const internal::scoped_ptr value_param_; const internal::TypeId fixture_class_id_; // ID of the test fixture class bool should_run_; // True iff this test should run bool is_disabled_; // True iff this test is disabled bool matches_filter_; // True if this test matches the // user-specified filter. internal::TestFactoryBase* const factory_; // The factory that creates // the test object // This field is mutable and needs to be reset before running the // test for the second time. TestResult result_; GTEST_DISALLOW_COPY_AND_ASSIGN_(TestInfo); }; // A test case, which consists of a vector of TestInfos. // // TestCase is not copyable. class GTEST_API_ TestCase { public: // Creates a TestCase with the given name. // // TestCase does NOT have a default constructor. Always use this // constructor to create a TestCase object. // // Arguments: // // name: name of the test case // a_type_param: the name of the test's type parameter, or NULL if // this is not a type-parameterized test. // set_up_tc: pointer to the function that sets up the test case // tear_down_tc: pointer to the function that tears down the test case TestCase(const char* name, const char* a_type_param, Test::SetUpTestCaseFunc set_up_tc, Test::TearDownTestCaseFunc tear_down_tc); // Destructor of TestCase. virtual ~TestCase(); // Gets the name of the TestCase. const char* name() const { return name_.c_str(); } // Returns the name of the parameter type, or NULL if this is not a // type-parameterized test case. const char* type_param() const { if (type_param_.get() != NULL) return type_param_->c_str(); return NULL; } // Returns true if any test in this test case should run. bool should_run() const { return should_run_; } // Gets the number of successful tests in this test case. int successful_test_count() const; // Gets the number of failed tests in this test case. int failed_test_count() const; // Gets the number of disabled tests in this test case. int disabled_test_count() const; // Get the number of tests in this test case that should run. int test_to_run_count() const; // Gets the number of all tests in this test case. int total_test_count() const; // Returns true iff the test case passed. bool Passed() const { return !Failed(); } // Returns true iff the test case failed. bool Failed() const { return failed_test_count() > 0; } // Returns the elapsed time, in milliseconds. TimeInMillis elapsed_time() const { return elapsed_time_; } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. const TestInfo* GetTestInfo(int i) const; private: friend class Test; friend class internal::UnitTestImpl; // Gets the (mutable) vector of TestInfos in this TestCase. std::vector& test_info_list() { return test_info_list_; } // Gets the (immutable) vector of TestInfos in this TestCase. const std::vector& test_info_list() const { return test_info_list_; } // Returns the i-th test among all the tests. i can range from 0 to // total_test_count() - 1. If i is not in that range, returns NULL. TestInfo* GetMutableTestInfo(int i); // Sets the should_run member. void set_should_run(bool should) { should_run_ = should; } // Adds a TestInfo to this test case. Will delete the TestInfo upon // destruction of the TestCase object. void AddTestInfo(TestInfo * test_info); // Clears the results of all tests in this test case. void ClearResult(); // Clears the results of all tests in the given test case. static void ClearTestCaseResult(TestCase* test_case) { test_case->ClearResult(); } // Runs every test in this TestCase. void Run(); // Runs SetUpTestCase() for this TestCase. This wrapper is needed // for catching exceptions thrown from SetUpTestCase(). void RunSetUpTestCase() { (*set_up_tc_)(); } // Runs TearDownTestCase() for this TestCase. This wrapper is // needed for catching exceptions thrown from TearDownTestCase(). void RunTearDownTestCase() { (*tear_down_tc_)(); } // Returns true iff test passed. static bool TestPassed(const TestInfo* test_info) { return test_info->should_run() && test_info->result()->Passed(); } // Returns true iff test failed. static bool TestFailed(const TestInfo* test_info) { return test_info->should_run() && test_info->result()->Failed(); } // Returns true iff test is disabled. static bool TestDisabled(const TestInfo* test_info) { return test_info->is_disabled_; } // Returns true if the given test should run. static bool ShouldRunTest(const TestInfo* test_info) { return test_info->should_run(); } // Shuffles the tests in this test case. void ShuffleTests(internal::Random* random); // Restores the test order to before the first shuffle. void UnshuffleTests(); // Name of the test case. internal::String name_; // Name of the parameter type, or NULL if this is not a typed or a // type-parameterized test. const internal::scoped_ptr type_param_; // The vector of TestInfos in their original order. It owns the // elements in the vector. std::vector test_info_list_; // Provides a level of indirection for the test list to allow easy // shuffling and restoring the test order. The i-th element in this // vector is the index of the i-th test in the shuffled test list. std::vector test_indices_; // Pointer to the function that sets up the test case. Test::SetUpTestCaseFunc set_up_tc_; // Pointer to the function that tears down the test case. Test::TearDownTestCaseFunc tear_down_tc_; // True iff any test in this test case should run. bool should_run_; // Elapsed time, in milliseconds. TimeInMillis elapsed_time_; // We disallow copying TestCases. GTEST_DISALLOW_COPY_AND_ASSIGN_(TestCase); }; // An Environment object is capable of setting up and tearing down an // environment. The user should subclass this to define his own // environment(s). // // An Environment object does the set-up and tear-down in virtual // methods SetUp() and TearDown() instead of the constructor and the // destructor, as: // // 1. You cannot safely throw from a destructor. This is a problem // as in some cases Google Test is used where exceptions are enabled, and // we may want to implement ASSERT_* using exceptions where they are // available. // 2. You cannot use ASSERT_* directly in a constructor or // destructor. class Environment { public: // The d'tor is virtual as we need to subclass Environment. virtual ~Environment() {} // Override this to define how to set up the environment. virtual void SetUp() {} // Override this to define how to tear down the environment. virtual void TearDown() {} private: // If you see an error about overriding the following function or // about it being private, you have mis-spelled SetUp() as Setup(). struct Setup_should_be_spelled_SetUp {}; virtual Setup_should_be_spelled_SetUp* Setup() { return NULL; } }; // The interface for tracing execution of tests. The methods are organized in // the order the corresponding events are fired. class TestEventListener { public: virtual ~TestEventListener() {} // Fired before any test activity starts. virtual void OnTestProgramStart(const UnitTest& unit_test) = 0; // Fired before each iteration of tests starts. There may be more than // one iteration if GTEST_FLAG(repeat) is set. iteration is the iteration // index, starting from 0. virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration) = 0; // Fired before environment set-up for each iteration of tests starts. virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test) = 0; // Fired after environment set-up for each iteration of tests ends. virtual void OnEnvironmentsSetUpEnd(const UnitTest& unit_test) = 0; // Fired before the test case starts. virtual void OnTestCaseStart(const TestCase& test_case) = 0; // Fired before the test starts. virtual void OnTestStart(const TestInfo& test_info) = 0; // Fired after a failed assertion or a SUCCEED() invocation. virtual void OnTestPartResult(const TestPartResult& test_part_result) = 0; // Fired after the test ends. virtual void OnTestEnd(const TestInfo& test_info) = 0; // Fired after the test case ends. virtual void OnTestCaseEnd(const TestCase& test_case) = 0; // Fired before environment tear-down for each iteration of tests starts. virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test) = 0; // Fired after environment tear-down for each iteration of tests ends. virtual void OnEnvironmentsTearDownEnd(const UnitTest& unit_test) = 0; // Fired after each iteration of tests finishes. virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration) = 0; // Fired after all test activities have ended. virtual void OnTestProgramEnd(const UnitTest& unit_test) = 0; }; // The convenience class for users who need to override just one or two // methods and are not concerned that a possible change to a signature of // the methods they override will not be caught during the build. For // comments about each method please see the definition of TestEventListener // above. class EmptyTestEventListener : public TestEventListener { public: virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationStart(const UnitTest& /*unit_test*/, int /*iteration*/) {} virtual void OnEnvironmentsSetUpStart(const UnitTest& /*unit_test*/) {} virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestCaseStart(const TestCase& /*test_case*/) {} virtual void OnTestStart(const TestInfo& /*test_info*/) {} virtual void OnTestPartResult(const TestPartResult& /*test_part_result*/) {} virtual void OnTestEnd(const TestInfo& /*test_info*/) {} virtual void OnTestCaseEnd(const TestCase& /*test_case*/) {} virtual void OnEnvironmentsTearDownStart(const UnitTest& /*unit_test*/) {} virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {} virtual void OnTestIterationEnd(const UnitTest& /*unit_test*/, int /*iteration*/) {} virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {} }; // TestEventListeners lets users add listeners to track events in Google Test. class GTEST_API_ TestEventListeners { public: TestEventListeners(); ~TestEventListeners(); // Appends an event listener to the end of the list. Google Test assumes // the ownership of the listener (i.e. it will delete the listener when // the test program finishes). void Append(TestEventListener* listener); // Removes the given event listener from the list and returns it. It then // becomes the caller's responsibility to delete the listener. Returns // NULL if the listener is not found in the list. TestEventListener* Release(TestEventListener* listener); // Returns the standard listener responsible for the default console // output. Can be removed from the listeners list to shut down default // console output. Note that removing this object from the listener list // with Release transfers its ownership to the caller and makes this // function return NULL the next time. TestEventListener* default_result_printer() const { return default_result_printer_; } // Returns the standard listener responsible for the default XML output // controlled by the --gtest_output=xml flag. Can be removed from the // listeners list by users who want to shut down the default XML output // controlled by this flag and substitute it with custom one. Note that // removing this object from the listener list with Release transfers its // ownership to the caller and makes this function return NULL the next // time. TestEventListener* default_xml_generator() const { return default_xml_generator_; } private: friend class TestCase; friend class TestInfo; friend class internal::DefaultGlobalTestPartResultReporter; friend class internal::NoExecDeathTest; friend class internal::TestEventListenersAccessor; friend class internal::UnitTestImpl; // Returns repeater that broadcasts the TestEventListener events to all // subscribers. TestEventListener* repeater(); // Sets the default_result_printer attribute to the provided listener. // The listener is also added to the listener list and previous // default_result_printer is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void SetDefaultResultPrinter(TestEventListener* listener); // Sets the default_xml_generator attribute to the provided listener. The // listener is also added to the listener list and previous // default_xml_generator is removed from it and deleted. The listener can // also be NULL in which case it will not be added to the list. Does // nothing if the previous and the current listener objects are the same. void SetDefaultXmlGenerator(TestEventListener* listener); // Controls whether events will be forwarded by the repeater to the // listeners in the list. bool EventForwardingEnabled() const; void SuppressEventForwarding(); // The actual list of listeners. internal::TestEventRepeater* repeater_; // Listener responsible for the standard result output. TestEventListener* default_result_printer_; // Listener responsible for the creation of the XML output file. TestEventListener* default_xml_generator_; // We disallow copying TestEventListeners. GTEST_DISALLOW_COPY_AND_ASSIGN_(TestEventListeners); }; // A UnitTest consists of a vector of TestCases. // // This is a singleton class. The only instance of UnitTest is // created when UnitTest::GetInstance() is first called. This // instance is never deleted. // // UnitTest is not copyable. // // This class is thread-safe as long as the methods are called // according to their specification. class GTEST_API_ UnitTest { public: // Gets the singleton UnitTest object. The first time this method // is called, a UnitTest object is constructed and returned. // Consecutive calls will return the same object. static UnitTest* GetInstance(); // Runs all tests in this UnitTest object and prints the result. // Returns 0 if successful, or 1 otherwise. // // This method can only be called from the main thread. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. int Run() GTEST_MUST_USE_RESULT_; // Returns the working directory when the first TEST() or TEST_F() // was executed. The UnitTest object owns the string. const char* original_working_dir() const; // Returns the TestCase object for the test that's currently running, // or NULL if no test is running. const TestCase* current_test_case() const; // Returns the TestInfo object for the test that's currently running, // or NULL if no test is running. const TestInfo* current_test_info() const; // Returns the random seed used at the start of the current test run. int random_seed() const; #if GTEST_HAS_PARAM_TEST // Returns the ParameterizedTestCaseRegistry object used to keep track of // value-parameterized tests and instantiate and register them. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. internal::ParameterizedTestCaseRegistry& parameterized_test_registry(); #endif // GTEST_HAS_PARAM_TEST // Gets the number of successful test cases. int successful_test_case_count() const; // Gets the number of failed test cases. int failed_test_case_count() const; // Gets the number of all test cases. int total_test_case_count() const; // Gets the number of all test cases that contain at least one test // that should run. int test_case_to_run_count() const; // Gets the number of successful tests. int successful_test_count() const; // Gets the number of failed tests. int failed_test_count() const; // Gets the number of disabled tests. int disabled_test_count() const; // Gets the number of all tests. int total_test_count() const; // Gets the number of tests that should run. int test_to_run_count() const; // Gets the elapsed time, in milliseconds. TimeInMillis elapsed_time() const; // Returns true iff the unit test passed (i.e. all test cases passed). bool Passed() const; // Returns true iff the unit test failed (i.e. some test case failed // or something outside of all tests failed). bool Failed() const; // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. const TestCase* GetTestCase(int i) const; // Returns the list of event listeners that can be used to track events // inside Google Test. TestEventListeners& listeners(); private: // Registers and returns a global test environment. When a test // program is run, all global test environments will be set-up in // the order they were registered. After all tests in the program // have finished, all global test environments will be torn-down in // the *reverse* order they were registered. // // The UnitTest object takes ownership of the given environment. // // This method can only be called from the main thread. Environment* AddEnvironment(Environment* env); // Adds a TestPartResult to the current TestResult object. All // Google Test assertion macros (e.g. ASSERT_TRUE, EXPECT_EQ, etc) // eventually call this to report their results. The user code // should use the assertion macros instead of calling this directly. void AddTestPartResult(TestPartResult::Type result_type, const char* file_name, int line_number, const internal::String& message, const internal::String& os_stack_trace); // Adds a TestProperty to the current TestResult object. If the result already // contains a property with the same key, the value will be updated. void RecordPropertyForCurrentTest(const char* key, const char* value); // Gets the i-th test case among all the test cases. i can range from 0 to // total_test_case_count() - 1. If i is not in that range, returns NULL. TestCase* GetMutableTestCase(int i); // Accessors for the implementation object. internal::UnitTestImpl* impl() { return impl_; } const internal::UnitTestImpl* impl() const { return impl_; } // These classes and funcions are friends as they need to access private // members of UnitTest. friend class Test; friend class internal::AssertHelper; friend class internal::ScopedTrace; friend Environment* AddGlobalTestEnvironment(Environment* env); friend internal::UnitTestImpl* internal::GetUnitTestImpl(); friend void internal::ReportFailureInUnknownLocation( TestPartResult::Type result_type, const internal::String& message); // Creates an empty UnitTest. UnitTest(); // D'tor virtual ~UnitTest(); // Pushes a trace defined by SCOPED_TRACE() on to the per-thread // Google Test trace stack. void PushGTestTrace(const internal::TraceInfo& trace); // Pops a trace from the per-thread Google Test trace stack. void PopGTestTrace(); // Protects mutable state in *impl_. This is mutable as some const // methods need to lock it too. mutable internal::Mutex mutex_; // Opaque implementation object. This field is never changed once // the object is constructed. We don't mark it as const here, as // doing so will cause a warning in the constructor of UnitTest. // Mutable state in *impl_ is protected by mutex_. internal::UnitTestImpl* impl_; // We disallow copying UnitTest. GTEST_DISALLOW_COPY_AND_ASSIGN_(UnitTest); }; // A convenient wrapper for adding an environment for the test // program. // // You should call this before RUN_ALL_TESTS() is called, probably in // main(). If you use gtest_main, you need to call this before main() // starts for it to take effect. For example, you can define a global // variable like this: // // testing::Environment* const foo_env = // testing::AddGlobalTestEnvironment(new FooEnvironment); // // However, we strongly recommend you to write your own main() and // call AddGlobalTestEnvironment() there, as relying on initialization // of global variables makes the code harder to read and may cause // problems when you register multiple environments from different // translation units and the environments have dependencies among them // (remember that the compiler doesn't guarantee the order in which // global variables from different translation units are initialized). inline Environment* AddGlobalTestEnvironment(Environment* env) { return UnitTest::GetInstance()->AddEnvironment(env); } // Initializes Google Test. This must be called before calling // RUN_ALL_TESTS(). In particular, it parses a command line for the // flags that Google Test recognizes. Whenever a Google Test flag is // seen, it is removed from argv, and *argc is decremented. // // No value is returned. Instead, the Google Test flag variables are // updated. // // Calling the function for the second time has no user-visible effect. GTEST_API_ void InitGoogleTest(int* argc, char** argv); // This overloaded version can be used in Windows programs compiled in // UNICODE mode. GTEST_API_ void InitGoogleTest(int* argc, wchar_t** argv); namespace internal { // Formats a comparison assertion (e.g. ASSERT_EQ, EXPECT_LT, and etc) // operand to be used in a failure message. The type (but not value) // of the other operand may affect the format. This allows us to // print a char* as a raw pointer when it is compared against another // char*, and print it as a C string when it is compared against an // std::string object, for example. // // The default implementation ignores the type of the other operand. // Some specialized versions are used to handle formatting wide or // narrow C strings. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. template String FormatForComparisonFailureMessage(const T1& value, const T2& /* other_operand */) { // C++Builder compiles this incorrectly if the namespace isn't explicitly // given. return ::testing::PrintToString(value); } // The helper function for {ASSERT|EXPECT}_EQ. template AssertionResult CmpHelperEQ(const char* expected_expression, const char* actual_expression, const T1& expected, const T2& actual) { #ifdef _MSC_VER # pragma warning(push) // Saves the current warning state. # pragma warning(disable:4389) // Temporarily disables warning on // signed/unsigned mismatch. #endif if (expected == actual) { return AssertionSuccess(); } #ifdef _MSC_VER # pragma warning(pop) // Restores the warning state. #endif return EqFailure(expected_expression, actual_expression, FormatForComparisonFailureMessage(expected, actual), FormatForComparisonFailureMessage(actual, expected), false); } // With this overloaded version, we allow anonymous enums to be used // in {ASSERT|EXPECT}_EQ when compiled with gcc 4, as anonymous enums // can be implicitly cast to BiggestInt. GTEST_API_ AssertionResult CmpHelperEQ(const char* expected_expression, const char* actual_expression, BiggestInt expected, BiggestInt actual); // The helper class for {ASSERT|EXPECT}_EQ. The template argument // lhs_is_null_literal is true iff the first argument to ASSERT_EQ() // is a null pointer literal. The following default implementation is // for lhs_is_null_literal being false. template class EqHelper { public: // This templatized version is for the general case. template static AssertionResult Compare(const char* expected_expression, const char* actual_expression, const T1& expected, const T2& actual) { return CmpHelperEQ(expected_expression, actual_expression, expected, actual); } // With this overloaded version, we allow anonymous enums to be used // in {ASSERT|EXPECT}_EQ when compiled with gcc 4, as anonymous // enums can be implicitly cast to BiggestInt. // // Even though its body looks the same as the above version, we // cannot merge the two, as it will make anonymous enums unhappy. static AssertionResult Compare(const char* expected_expression, const char* actual_expression, BiggestInt expected, BiggestInt actual) { return CmpHelperEQ(expected_expression, actual_expression, expected, actual); } }; // This specialization is used when the first argument to ASSERT_EQ() // is a null pointer literal, like NULL, false, or 0. template <> class EqHelper { public: // We define two overloaded versions of Compare(). The first // version will be picked when the second argument to ASSERT_EQ() is // NOT a pointer, e.g. ASSERT_EQ(0, AnIntFunction()) or // EXPECT_EQ(false, a_bool). template static AssertionResult Compare( const char* expected_expression, const char* actual_expression, const T1& expected, const T2& actual, // The following line prevents this overload from being considered if T2 // is not a pointer type. We need this because ASSERT_EQ(NULL, my_ptr) // expands to Compare("", "", NULL, my_ptr), which requires a conversion // to match the Secret* in the other overload, which would otherwise make // this template match better. typename EnableIf::value>::type* = 0) { return CmpHelperEQ(expected_expression, actual_expression, expected, actual); } // This version will be picked when the second argument to ASSERT_EQ() is a // pointer, e.g. ASSERT_EQ(NULL, a_pointer). template static AssertionResult Compare( const char* expected_expression, const char* actual_expression, // We used to have a second template parameter instead of Secret*. That // template parameter would deduce to 'long', making this a better match // than the first overload even without the first overload's EnableIf. // Unfortunately, gcc with -Wconversion-null warns when "passing NULL to // non-pointer argument" (even a deduced integral argument), so the old // implementation caused warnings in user code. Secret* /* expected (NULL) */, T* actual) { // We already know that 'expected' is a null pointer. return CmpHelperEQ(expected_expression, actual_expression, static_cast(NULL), actual); } }; // A macro for implementing the helper functions needed to implement // ASSERT_?? and EXPECT_??. It is here just to avoid copy-and-paste // of similar code. // // For each templatized helper function, we also define an overloaded // version for BiggestInt in order to reduce code bloat and allow // anonymous enums to be used with {ASSERT|EXPECT}_?? when compiled // with gcc 4. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. #define GTEST_IMPL_CMP_HELPER_(op_name, op)\ template \ AssertionResult CmpHelper##op_name(const char* expr1, const char* expr2, \ const T1& val1, const T2& val2) {\ if (val1 op val2) {\ return AssertionSuccess();\ } else {\ return AssertionFailure() \ << "Expected: (" << expr1 << ") " #op " (" << expr2\ << "), actual: " << FormatForComparisonFailureMessage(val1, val2)\ << " vs " << FormatForComparisonFailureMessage(val2, val1);\ }\ }\ GTEST_API_ AssertionResult CmpHelper##op_name(\ const char* expr1, const char* expr2, BiggestInt val1, BiggestInt val2) // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. // Implements the helper function for {ASSERT|EXPECT}_NE GTEST_IMPL_CMP_HELPER_(NE, !=); // Implements the helper function for {ASSERT|EXPECT}_LE GTEST_IMPL_CMP_HELPER_(LE, <=); // Implements the helper function for {ASSERT|EXPECT}_LT GTEST_IMPL_CMP_HELPER_(LT, < ); // Implements the helper function for {ASSERT|EXPECT}_GE GTEST_IMPL_CMP_HELPER_(GE, >=); // Implements the helper function for {ASSERT|EXPECT}_GT GTEST_IMPL_CMP_HELPER_(GT, > ); #undef GTEST_IMPL_CMP_HELPER_ // The helper function for {ASSERT|EXPECT}_STREQ. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual); // The helper function for {ASSERT|EXPECT}_STRCASEEQ. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRCASEEQ(const char* expected_expression, const char* actual_expression, const char* expected, const char* actual); // The helper function for {ASSERT|EXPECT}_STRNE. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2); // The helper function for {ASSERT|EXPECT}_STRCASENE. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRCASENE(const char* s1_expression, const char* s2_expression, const char* s1, const char* s2); // Helper function for *_STREQ on wide strings. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTREQ(const char* expected_expression, const char* actual_expression, const wchar_t* expected, const wchar_t* actual); // Helper function for *_STRNE on wide strings. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult CmpHelperSTRNE(const char* s1_expression, const char* s2_expression, const wchar_t* s1, const wchar_t* s2); } // namespace internal // IsSubstring() and IsNotSubstring() are intended to be used as the // first argument to {EXPECT,ASSERT}_PRED_FORMAT2(), not by // themselves. They check whether needle is a substring of haystack // (NULL is considered a substring of itself only), and return an // appropriate error message when they fail. // // The {needle,haystack}_expr arguments are the stringified // expressions that generated the two real arguments. GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack); GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const char* needle, const char* haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const wchar_t* needle, const wchar_t* haystack); GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::string& needle, const ::std::string& haystack); #if GTEST_HAS_STD_WSTRING GTEST_API_ AssertionResult IsSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack); GTEST_API_ AssertionResult IsNotSubstring( const char* needle_expr, const char* haystack_expr, const ::std::wstring& needle, const ::std::wstring& haystack); #endif // GTEST_HAS_STD_WSTRING namespace internal { // Helper template function for comparing floating-points. // // Template parameter: // // RawType: the raw floating-point type (either float or double) // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. template AssertionResult CmpHelperFloatingPointEQ(const char* expected_expression, const char* actual_expression, RawType expected, RawType actual) { const FloatingPoint lhs(expected), rhs(actual); if (lhs.AlmostEquals(rhs)) { return AssertionSuccess(); } ::std::stringstream expected_ss; expected_ss << std::setprecision(std::numeric_limits::digits10 + 2) << expected; ::std::stringstream actual_ss; actual_ss << std::setprecision(std::numeric_limits::digits10 + 2) << actual; return EqFailure(expected_expression, actual_expression, StringStreamToString(&expected_ss), StringStreamToString(&actual_ss), false); } // Helper function for implementing ASSERT_NEAR. // // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. GTEST_API_ AssertionResult DoubleNearPredFormat(const char* expr1, const char* expr2, const char* abs_error_expr, double val1, double val2, double abs_error); // INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. // A class that enables one to stream messages to assertion macros class GTEST_API_ AssertHelper { public: // Constructor. AssertHelper(TestPartResult::Type type, const char* file, int line, const char* message); ~AssertHelper(); // Message assignment is a semantic trick to enable assertion // streaming; see the GTEST_MESSAGE_ macro below. void operator=(const Message& message) const; private: // We put our data in a struct so that the size of the AssertHelper class can // be as small as possible. This is important because gcc is incapable of // re-using stack space even for temporary variables, so every EXPECT_EQ // reserves stack space for another AssertHelper. struct AssertHelperData { AssertHelperData(TestPartResult::Type t, const char* srcfile, int line_num, const char* msg) : type(t), file(srcfile), line(line_num), message(msg) { } TestPartResult::Type const type; const char* const file; int const line; String const message; private: GTEST_DISALLOW_COPY_AND_ASSIGN_(AssertHelperData); }; AssertHelperData* const data_; GTEST_DISALLOW_COPY_AND_ASSIGN_(AssertHelper); }; } // namespace internal #if GTEST_HAS_PARAM_TEST // The pure interface class that all value-parameterized tests inherit from. // A value-parameterized class must inherit from both ::testing::Test and // ::testing::WithParamInterface. In most cases that just means inheriting // from ::testing::TestWithParam, but more complicated test hierarchies // may need to inherit from Test and WithParamInterface at different levels. // // This interface has support for accessing the test parameter value via // the GetParam() method. // // Use it with one of the parameter generator defining functions, like Range(), // Values(), ValuesIn(), Bool(), and Combine(). // // class FooTest : public ::testing::TestWithParam { // protected: // FooTest() { // // Can use GetParam() here. // } // virtual ~FooTest() { // // Can use GetParam() here. // } // virtual void SetUp() { // // Can use GetParam() here. // } // virtual void TearDown { // // Can use GetParam() here. // } // }; // TEST_P(FooTest, DoesBar) { // // Can use GetParam() method here. // Foo foo; // ASSERT_TRUE(foo.DoesBar(GetParam())); // } // INSTANTIATE_TEST_CASE_P(OneToTenRange, FooTest, ::testing::Range(1, 10)); template class WithParamInterface { public: typedef T ParamType; virtual ~WithParamInterface() {} // The current parameter value. Is also available in the test fixture's // constructor. This member function is non-static, even though it only // references static data, to reduce the opportunity for incorrect uses // like writing 'WithParamInterface::GetParam()' for a test that // uses a fixture whose parameter type is int. const ParamType& GetParam() const { return *parameter_; } private: // Sets parameter value. The caller is responsible for making sure the value // remains alive and unchanged throughout the current test. static void SetParam(const ParamType* parameter) { parameter_ = parameter; } // Static value used for accessing parameter during a test lifetime. static const ParamType* parameter_; // TestClass must be a subclass of WithParamInterface and Test. template friend class internal::ParameterizedTestFactory; }; template const T* WithParamInterface::parameter_ = NULL; // Most value-parameterized classes can ignore the existence of // WithParamInterface, and can just inherit from ::testing::TestWithParam. template class TestWithParam : public Test, public WithParamInterface { }; #endif // GTEST_HAS_PARAM_TEST // Macros for indicating success/failure in test code. // ADD_FAILURE unconditionally adds a failure to the current test. // SUCCEED generates a success - it doesn't automatically make the // current test successful, as a test is only successful when it has // no failure. // // EXPECT_* verifies that a certain condition is satisfied. If not, // it behaves like ADD_FAILURE. In particular: // // EXPECT_TRUE verifies that a Boolean condition is true. // EXPECT_FALSE verifies that a Boolean condition is false. // // FAIL and ASSERT_* are similar to ADD_FAILURE and EXPECT_*, except // that they will also abort the current function on failure. People // usually want the fail-fast behavior of FAIL and ASSERT_*, but those // writing data-driven tests often find themselves using ADD_FAILURE // and EXPECT_* more. // // Examples: // // EXPECT_TRUE(server.StatusIsOK()); // ASSERT_FALSE(server.HasPendingRequest(port)) // << "There are still pending requests " << "on port " << port; // Generates a nonfatal failure with a generic message. #define ADD_FAILURE() GTEST_NONFATAL_FAILURE_("Failed") // Generates a nonfatal failure at the given source file location with // a generic message. #define ADD_FAILURE_AT(file, line) \ GTEST_MESSAGE_AT_(file, line, "Failed", \ ::testing::TestPartResult::kNonFatalFailure) // Generates a fatal failure with a generic message. #define GTEST_FAIL() GTEST_FATAL_FAILURE_("Failed") // Define this macro to 1 to omit the definition of FAIL(), which is a // generic name and clashes with some other libraries. #if !GTEST_DONT_DEFINE_FAIL # define FAIL() GTEST_FAIL() #endif // Generates a success with a generic message. #define GTEST_SUCCEED() GTEST_SUCCESS_("Succeeded") // Define this macro to 1 to omit the definition of SUCCEED(), which // is a generic name and clashes with some other libraries. #if !GTEST_DONT_DEFINE_SUCCEED # define SUCCEED() GTEST_SUCCEED() #endif // Macros for testing exceptions. // // * {ASSERT|EXPECT}_THROW(statement, expected_exception): // Tests that the statement throws the expected exception. // * {ASSERT|EXPECT}_NO_THROW(statement): // Tests that the statement doesn't throw any exception. // * {ASSERT|EXPECT}_ANY_THROW(statement): // Tests that the statement throws an exception. #define EXPECT_THROW(statement, expected_exception) \ GTEST_TEST_THROW_(statement, expected_exception, GTEST_NONFATAL_FAILURE_) #define EXPECT_NO_THROW(statement) \ GTEST_TEST_NO_THROW_(statement, GTEST_NONFATAL_FAILURE_) #define EXPECT_ANY_THROW(statement) \ GTEST_TEST_ANY_THROW_(statement, GTEST_NONFATAL_FAILURE_) #define ASSERT_THROW(statement, expected_exception) \ GTEST_TEST_THROW_(statement, expected_exception, GTEST_FATAL_FAILURE_) #define ASSERT_NO_THROW(statement) \ GTEST_TEST_NO_THROW_(statement, GTEST_FATAL_FAILURE_) #define ASSERT_ANY_THROW(statement) \ GTEST_TEST_ANY_THROW_(statement, GTEST_FATAL_FAILURE_) // Boolean assertions. Condition can be either a Boolean expression or an // AssertionResult. For more information on how to use AssertionResult with // these macros see comments on that class. #define EXPECT_TRUE(condition) \ GTEST_TEST_BOOLEAN_(condition, #condition, false, true, \ GTEST_NONFATAL_FAILURE_) #define EXPECT_FALSE(condition) \ GTEST_TEST_BOOLEAN_(!(condition), #condition, true, false, \ GTEST_NONFATAL_FAILURE_) #define ASSERT_TRUE(condition) \ GTEST_TEST_BOOLEAN_(condition, #condition, false, true, \ GTEST_FATAL_FAILURE_) #define ASSERT_FALSE(condition) \ GTEST_TEST_BOOLEAN_(!(condition), #condition, true, false, \ GTEST_FATAL_FAILURE_) // Includes the auto-generated header that implements a family of // generic predicate assertion macros. // Copyright 2006, Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // This file is AUTOMATICALLY GENERATED on 09/24/2010 by command // 'gen_gtest_pred_impl.py 5'. DO NOT EDIT BY HAND! // // Implements a family of generic predicate assertion macros. #ifndef GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ #define GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ // Makes sure this header is not included before gtest.h. #ifndef GTEST_INCLUDE_GTEST_GTEST_H_ # error Do not include gtest_pred_impl.h directly. Include gtest.h instead. #endif // GTEST_INCLUDE_GTEST_GTEST_H_ // This header implements a family of generic predicate assertion // macros: // // ASSERT_PRED_FORMAT1(pred_format, v1) // ASSERT_PRED_FORMAT2(pred_format, v1, v2) // ... // // where pred_format is a function or functor that takes n (in the // case of ASSERT_PRED_FORMATn) values and their source expression // text, and returns a testing::AssertionResult. See the definition // of ASSERT_EQ in gtest.h for an example. // // If you don't care about formatting, you can use the more // restrictive version: // // ASSERT_PRED1(pred, v1) // ASSERT_PRED2(pred, v1, v2) // ... // // where pred is an n-ary function or functor that returns bool, // and the values v1, v2, ..., must support the << operator for // streaming to std::ostream. // // We also define the EXPECT_* variations. // // For now we only support predicates whose arity is at most 5. // Please email googletestframework@googlegroups.com if you need // support for higher arities. // GTEST_ASSERT_ is the basic statement to which all of the assertions // in this file reduce. Don't use this in your code. #define GTEST_ASSERT_(expression, on_failure) \ GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ if (const ::testing::AssertionResult gtest_ar = (expression)) \ ; \ else \ on_failure(gtest_ar.failure_message()) // Helper function for implementing {EXPECT|ASSERT}_PRED1. Don't use // this in your code. template AssertionResult AssertPred1Helper(const char* pred_text, const char* e1, Pred pred, const T1& v1) { if (pred(v1)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT1. // Don't use this in your code. #define GTEST_PRED_FORMAT1_(pred_format, v1, on_failure)\ GTEST_ASSERT_(pred_format(#v1, v1),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED1. Don't use // this in your code. #define GTEST_PRED1_(pred, v1, on_failure)\ GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ #v1, \ pred, \ v1), on_failure) // Unary predicate assertion macros. #define EXPECT_PRED_FORMAT1(pred_format, v1) \ GTEST_PRED_FORMAT1_(pred_format, v1, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED1(pred, v1) \ GTEST_PRED1_(pred, v1, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT1(pred_format, v1) \ GTEST_PRED_FORMAT1_(pred_format, v1, GTEST_FATAL_FAILURE_) #define ASSERT_PRED1(pred, v1) \ GTEST_PRED1_(pred, v1, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED2. Don't use // this in your code. template AssertionResult AssertPred2Helper(const char* pred_text, const char* e1, const char* e2, Pred pred, const T1& v1, const T2& v2) { if (pred(v1, v2)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT2. // Don't use this in your code. #define GTEST_PRED_FORMAT2_(pred_format, v1, v2, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, v1, v2),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED2. Don't use // this in your code. #define GTEST_PRED2_(pred, v1, v2, on_failure)\ GTEST_ASSERT_(::testing::AssertPred2Helper(#pred, \ #v1, \ #v2, \ pred, \ v1, \ v2), on_failure) // Binary predicate assertion macros. #define EXPECT_PRED_FORMAT2(pred_format, v1, v2) \ GTEST_PRED_FORMAT2_(pred_format, v1, v2, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED2(pred, v1, v2) \ GTEST_PRED2_(pred, v1, v2, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT2(pred_format, v1, v2) \ GTEST_PRED_FORMAT2_(pred_format, v1, v2, GTEST_FATAL_FAILURE_) #define ASSERT_PRED2(pred, v1, v2) \ GTEST_PRED2_(pred, v1, v2, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED3. Don't use // this in your code. template AssertionResult AssertPred3Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, Pred pred, const T1& v1, const T2& v2, const T3& v3) { if (pred(v1, v2, v3)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ", " << e3 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2 << "\n" << e3 << " evaluates to " << v3; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT3. // Don't use this in your code. #define GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, #v3, v1, v2, v3),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED3. Don't use // this in your code. #define GTEST_PRED3_(pred, v1, v2, v3, on_failure)\ GTEST_ASSERT_(::testing::AssertPred3Helper(#pred, \ #v1, \ #v2, \ #v3, \ pred, \ v1, \ v2, \ v3), on_failure) // Ternary predicate assertion macros. #define EXPECT_PRED_FORMAT3(pred_format, v1, v2, v3) \ GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED3(pred, v1, v2, v3) \ GTEST_PRED3_(pred, v1, v2, v3, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT3(pred_format, v1, v2, v3) \ GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, GTEST_FATAL_FAILURE_) #define ASSERT_PRED3(pred, v1, v2, v3) \ GTEST_PRED3_(pred, v1, v2, v3, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED4. Don't use // this in your code. template AssertionResult AssertPred4Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4) { if (pred(v1, v2, v3, v4)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ", " << e3 << ", " << e4 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2 << "\n" << e3 << " evaluates to " << v3 << "\n" << e4 << " evaluates to " << v4; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT4. // Don't use this in your code. #define GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, #v3, #v4, v1, v2, v3, v4),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED4. Don't use // this in your code. #define GTEST_PRED4_(pred, v1, v2, v3, v4, on_failure)\ GTEST_ASSERT_(::testing::AssertPred4Helper(#pred, \ #v1, \ #v2, \ #v3, \ #v4, \ pred, \ v1, \ v2, \ v3, \ v4), on_failure) // 4-ary predicate assertion macros. #define EXPECT_PRED_FORMAT4(pred_format, v1, v2, v3, v4) \ GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED4(pred, v1, v2, v3, v4) \ GTEST_PRED4_(pred, v1, v2, v3, v4, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT4(pred_format, v1, v2, v3, v4) \ GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, GTEST_FATAL_FAILURE_) #define ASSERT_PRED4(pred, v1, v2, v3, v4) \ GTEST_PRED4_(pred, v1, v2, v3, v4, GTEST_FATAL_FAILURE_) // Helper function for implementing {EXPECT|ASSERT}_PRED5. Don't use // this in your code. template AssertionResult AssertPred5Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5) { if (pred(v1, v2, v3, v4, v5)) return AssertionSuccess(); return AssertionFailure() << pred_text << "(" << e1 << ", " << e2 << ", " << e3 << ", " << e4 << ", " << e5 << ") evaluates to false, where" << "\n" << e1 << " evaluates to " << v1 << "\n" << e2 << " evaluates to " << v2 << "\n" << e3 << " evaluates to " << v3 << "\n" << e4 << " evaluates to " << v4 << "\n" << e5 << " evaluates to " << v5; } // Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT5. // Don't use this in your code. #define GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, on_failure)\ GTEST_ASSERT_(pred_format(#v1, #v2, #v3, #v4, #v5, v1, v2, v3, v4, v5),\ on_failure) // Internal macro for implementing {EXPECT|ASSERT}_PRED5. Don't use // this in your code. #define GTEST_PRED5_(pred, v1, v2, v3, v4, v5, on_failure)\ GTEST_ASSERT_(::testing::AssertPred5Helper(#pred, \ #v1, \ #v2, \ #v3, \ #v4, \ #v5, \ pred, \ v1, \ v2, \ v3, \ v4, \ v5), on_failure) // 5-ary predicate assertion macros. #define EXPECT_PRED_FORMAT5(pred_format, v1, v2, v3, v4, v5) \ GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, GTEST_NONFATAL_FAILURE_) #define EXPECT_PRED5(pred, v1, v2, v3, v4, v5) \ GTEST_PRED5_(pred, v1, v2, v3, v4, v5, GTEST_NONFATAL_FAILURE_) #define ASSERT_PRED_FORMAT5(pred_format, v1, v2, v3, v4, v5) \ GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, GTEST_FATAL_FAILURE_) #define ASSERT_PRED5(pred, v1, v2, v3, v4, v5) \ GTEST_PRED5_(pred, v1, v2, v3, v4, v5, GTEST_FATAL_FAILURE_) #endif // GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ // Macros for testing equalities and inequalities. // // * {ASSERT|EXPECT}_EQ(expected, actual): Tests that expected == actual // * {ASSERT|EXPECT}_NE(v1, v2): Tests that v1 != v2 // * {ASSERT|EXPECT}_LT(v1, v2): Tests that v1 < v2 // * {ASSERT|EXPECT}_LE(v1, v2): Tests that v1 <= v2 // * {ASSERT|EXPECT}_GT(v1, v2): Tests that v1 > v2 // * {ASSERT|EXPECT}_GE(v1, v2): Tests that v1 >= v2 // // When they are not, Google Test prints both the tested expressions and // their actual values. The values must be compatible built-in types, // or you will get a compiler error. By "compatible" we mean that the // values can be compared by the respective operator. // // Note: // // 1. It is possible to make a user-defined type work with // {ASSERT|EXPECT}_??(), but that requires overloading the // comparison operators and is thus discouraged by the Google C++ // Usage Guide. Therefore, you are advised to use the // {ASSERT|EXPECT}_TRUE() macro to assert that two objects are // equal. // // 2. The {ASSERT|EXPECT}_??() macros do pointer comparisons on // pointers (in particular, C strings). Therefore, if you use it // with two C strings, you are testing how their locations in memory // are related, not how their content is related. To compare two C // strings by content, use {ASSERT|EXPECT}_STR*(). // // 3. {ASSERT|EXPECT}_EQ(expected, actual) is preferred to // {ASSERT|EXPECT}_TRUE(expected == actual), as the former tells you // what the actual value is when it fails, and similarly for the // other comparisons. // // 4. Do not depend on the order in which {ASSERT|EXPECT}_??() // evaluate their arguments, which is undefined. // // 5. These macros evaluate their arguments exactly once. // // Examples: // // EXPECT_NE(5, Foo()); // EXPECT_EQ(NULL, a_pointer); // ASSERT_LT(i, array_size); // ASSERT_GT(records.size(), 0) << "There is no record left."; #define EXPECT_EQ(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal:: \ EqHelper::Compare, \ expected, actual) #define EXPECT_NE(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperNE, expected, actual) #define EXPECT_LE(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperLE, val1, val2) #define EXPECT_LT(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperLT, val1, val2) #define EXPECT_GE(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperGE, val1, val2) #define EXPECT_GT(val1, val2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperGT, val1, val2) #define GTEST_ASSERT_EQ(expected, actual) \ ASSERT_PRED_FORMAT2(::testing::internal:: \ EqHelper::Compare, \ expected, actual) #define GTEST_ASSERT_NE(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperNE, val1, val2) #define GTEST_ASSERT_LE(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperLE, val1, val2) #define GTEST_ASSERT_LT(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperLT, val1, val2) #define GTEST_ASSERT_GE(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperGE, val1, val2) #define GTEST_ASSERT_GT(val1, val2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperGT, val1, val2) // Define macro GTEST_DONT_DEFINE_ASSERT_XY to 1 to omit the definition of // ASSERT_XY(), which clashes with some users' own code. #if !GTEST_DONT_DEFINE_ASSERT_EQ # define ASSERT_EQ(val1, val2) GTEST_ASSERT_EQ(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_NE # define ASSERT_NE(val1, val2) GTEST_ASSERT_NE(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_LE # define ASSERT_LE(val1, val2) GTEST_ASSERT_LE(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_LT # define ASSERT_LT(val1, val2) GTEST_ASSERT_LT(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_GE # define ASSERT_GE(val1, val2) GTEST_ASSERT_GE(val1, val2) #endif #if !GTEST_DONT_DEFINE_ASSERT_GT # define ASSERT_GT(val1, val2) GTEST_ASSERT_GT(val1, val2) #endif // C String Comparisons. All tests treat NULL and any non-NULL string // as different. Two NULLs are equal. // // * {ASSERT|EXPECT}_STREQ(s1, s2): Tests that s1 == s2 // * {ASSERT|EXPECT}_STRNE(s1, s2): Tests that s1 != s2 // * {ASSERT|EXPECT}_STRCASEEQ(s1, s2): Tests that s1 == s2, ignoring case // * {ASSERT|EXPECT}_STRCASENE(s1, s2): Tests that s1 != s2, ignoring case // // For wide or narrow string objects, you can use the // {ASSERT|EXPECT}_??() macros. // // Don't depend on the order in which the arguments are evaluated, // which is undefined. // // These macros evaluate their arguments exactly once. #define EXPECT_STREQ(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTREQ, expected, actual) #define EXPECT_STRNE(s1, s2) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRNE, s1, s2) #define EXPECT_STRCASEEQ(expected, actual) \ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASEEQ, expected, actual) #define EXPECT_STRCASENE(s1, s2)\ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASENE, s1, s2) #define ASSERT_STREQ(expected, actual) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTREQ, expected, actual) #define ASSERT_STRNE(s1, s2) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRNE, s1, s2) #define ASSERT_STRCASEEQ(expected, actual) \ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASEEQ, expected, actual) #define ASSERT_STRCASENE(s1, s2)\ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASENE, s1, s2) // Macros for comparing floating-point numbers. // // * {ASSERT|EXPECT}_FLOAT_EQ(expected, actual): // Tests that two float values are almost equal. // * {ASSERT|EXPECT}_DOUBLE_EQ(expected, actual): // Tests that two double values are almost equal. // * {ASSERT|EXPECT}_NEAR(v1, v2, abs_error): // Tests that v1 and v2 are within the given distance to each other. // // Google Test uses ULP-based comparison to automatically pick a default // error bound that is appropriate for the operands. See the // FloatingPoint template class in gtest-internal.h if you are // interested in the implementation details. #define EXPECT_FLOAT_EQ(expected, actual)\ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define EXPECT_DOUBLE_EQ(expected, actual)\ EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define ASSERT_FLOAT_EQ(expected, actual)\ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define ASSERT_DOUBLE_EQ(expected, actual)\ ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ expected, actual) #define EXPECT_NEAR(val1, val2, abs_error)\ EXPECT_PRED_FORMAT3(::testing::internal::DoubleNearPredFormat, \ val1, val2, abs_error) #define ASSERT_NEAR(val1, val2, abs_error)\ ASSERT_PRED_FORMAT3(::testing::internal::DoubleNearPredFormat, \ val1, val2, abs_error) // These predicate format functions work on floating-point values, and // can be used in {ASSERT|EXPECT}_PRED_FORMAT2*(), e.g. // // EXPECT_PRED_FORMAT2(testing::DoubleLE, Foo(), 5.0); // Asserts that val1 is less than, or almost equal to, val2. Fails // otherwise. In particular, it fails if either val1 or val2 is NaN. GTEST_API_ AssertionResult FloatLE(const char* expr1, const char* expr2, float val1, float val2); GTEST_API_ AssertionResult DoubleLE(const char* expr1, const char* expr2, double val1, double val2); #if GTEST_OS_WINDOWS // Macros that test for HRESULT failure and success, these are only useful // on Windows, and rely on Windows SDK macros and APIs to compile. // // * {ASSERT|EXPECT}_HRESULT_{SUCCEEDED|FAILED}(expr) // // When expr unexpectedly fails or succeeds, Google Test prints the // expected result and the actual result with both a human-readable // string representation of the error, if available, as well as the // hex result code. # define EXPECT_HRESULT_SUCCEEDED(expr) \ EXPECT_PRED_FORMAT1(::testing::internal::IsHRESULTSuccess, (expr)) # define ASSERT_HRESULT_SUCCEEDED(expr) \ ASSERT_PRED_FORMAT1(::testing::internal::IsHRESULTSuccess, (expr)) # define EXPECT_HRESULT_FAILED(expr) \ EXPECT_PRED_FORMAT1(::testing::internal::IsHRESULTFailure, (expr)) # define ASSERT_HRESULT_FAILED(expr) \ ASSERT_PRED_FORMAT1(::testing::internal::IsHRESULTFailure, (expr)) #endif // GTEST_OS_WINDOWS // Macros that execute statement and check that it doesn't generate new fatal // failures in the current thread. // // * {ASSERT|EXPECT}_NO_FATAL_FAILURE(statement); // // Examples: // // EXPECT_NO_FATAL_FAILURE(Process()); // ASSERT_NO_FATAL_FAILURE(Process()) << "Process() failed"; // #define ASSERT_NO_FATAL_FAILURE(statement) \ GTEST_TEST_NO_FATAL_FAILURE_(statement, GTEST_FATAL_FAILURE_) #define EXPECT_NO_FATAL_FAILURE(statement) \ GTEST_TEST_NO_FATAL_FAILURE_(statement, GTEST_NONFATAL_FAILURE_) // Causes a trace (including the source file path, the current line // number, and the given message) to be included in every test failure // message generated by code in the current scope. The effect is // undone when the control leaves the current scope. // // The message argument can be anything streamable to std::ostream. // // In the implementation, we include the current line number as part // of the dummy variable name, thus allowing multiple SCOPED_TRACE()s // to appear in the same block - as long as they are on different // lines. #define SCOPED_TRACE(message) \ ::testing::internal::ScopedTrace GTEST_CONCAT_TOKEN_(gtest_trace_, __LINE__)(\ __FILE__, __LINE__, ::testing::Message() << (message)) // Compile-time assertion for type equality. // StaticAssertTypeEq() compiles iff type1 and type2 are // the same type. The value it returns is not interesting. // // Instead of making StaticAssertTypeEq a class template, we make it a // function template that invokes a helper class template. This // prevents a user from misusing StaticAssertTypeEq by // defining objects of that type. // // CAVEAT: // // When used inside a method of a class template, // StaticAssertTypeEq() is effective ONLY IF the method is // instantiated. For example, given: // // template class Foo { // public: // void Bar() { testing::StaticAssertTypeEq(); } // }; // // the code: // // void Test1() { Foo foo; } // // will NOT generate a compiler error, as Foo::Bar() is never // actually instantiated. Instead, you need: // // void Test2() { Foo foo; foo.Bar(); } // // to cause a compiler error. template bool StaticAssertTypeEq() { (void)internal::StaticAssertTypeEqHelper(); return true; } // Defines a test. // // The first parameter is the name of the test case, and the second // parameter is the name of the test within the test case. // // The convention is to end the test case name with "Test". For // example, a test case for the Foo class can be named FooTest. // // The user should put his test code between braces after using this // macro. Example: // // TEST(FooTest, InitializesCorrectly) { // Foo foo; // EXPECT_TRUE(foo.StatusIsOK()); // } // Note that we call GetTestTypeId() instead of GetTypeId< // ::testing::Test>() here to get the type ID of testing::Test. This // is to work around a suspected linker bug when using Google Test as // a framework on Mac OS X. The bug causes GetTypeId< // ::testing::Test>() to return different values depending on whether // the call is from the Google Test framework itself or from user test // code. GetTestTypeId() is guaranteed to always return the same // value, as it always calls GetTypeId<>() from the Google Test // framework. #define GTEST_TEST(test_case_name, test_name)\ GTEST_TEST_(test_case_name, test_name, \ ::testing::Test, ::testing::internal::GetTestTypeId()) // Define this macro to 1 to omit the definition of TEST(), which // is a generic name and clashes with some other libraries. #if !GTEST_DONT_DEFINE_TEST # define TEST(test_case_name, test_name) GTEST_TEST(test_case_name, test_name) #endif // Defines a test that uses a test fixture. // // The first parameter is the name of the test fixture class, which // also doubles as the test case name. The second parameter is the // name of the test within the test case. // // A test fixture class must be declared earlier. The user should put // his test code between braces after using this macro. Example: // // class FooTest : public testing::Test { // protected: // virtual void SetUp() { b_.AddElement(3); } // // Foo a_; // Foo b_; // }; // // TEST_F(FooTest, InitializesCorrectly) { // EXPECT_TRUE(a_.StatusIsOK()); // } // // TEST_F(FooTest, ReturnsElementCountCorrectly) { // EXPECT_EQ(0, a_.size()); // EXPECT_EQ(1, b_.size()); // } #define TEST_F(test_fixture, test_name)\ GTEST_TEST_(test_fixture, test_name, test_fixture, \ ::testing::internal::GetTypeId()) // Use this macro in main() to run all tests. It returns 0 if all // tests are successful, or 1 otherwise. // // RUN_ALL_TESTS() should be invoked after the command line has been // parsed by InitGoogleTest(). #define RUN_ALL_TESTS()\ (::testing::UnitTest::GetInstance()->Run()) } // namespace testing #endif // GTEST_INCLUDE_GTEST_GTEST_H_ armory-0.92.3/cppForSwig/BitcoinArmory.sln0000644000000000000000000001267712414772654017227 0ustar rootroot Microsoft Visual Studio Solution File, Format Version 12.00 # Visual Studio Express 2012 for Windows Desktop Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "guardian", "guardian\guardian.vcxproj", "{D35F732D-55D7-4037-9C6D-E141F740F802}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "cryptopp", "cryptopp\cryptopp.vcxproj", "{B1055DA3-83CE-47BF-98E6-2850E3411D39}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "BitcoinArmory_SwigDLL", "BitcoinArmory_SwigDLL\BitcoinArmory_SwigDLL.vcxproj", "{19329A6B-FE96-4917-B69A-2B0375C12017}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "BitcoinArmory_CppTests", "BitcoinArmory_CppTests\BitcoinArmory_CppTests.vcxproj", "{D9733F9E-BE30-466F-B100-B686DF663C4D}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "leveldb_msvc11_port", "leveldb_windows_port\leveldb_msvc11_port.vcxproj", "{01CD1176-66F7-44AB-9E7B-8AEECC9915E8}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Debug|x64 = Debug|x64 Release|Win32 = Release|Win32 Release|x64 = Release|x64 WinXP_32|Win32 = WinXP_32|Win32 WinXP_32|x64 = WinXP_32|x64 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {D35F732D-55D7-4037-9C6D-E141F740F802}.Debug|Win32.ActiveCfg = Release|Win32 {D35F732D-55D7-4037-9C6D-E141F740F802}.Debug|Win32.Build.0 = Release|Win32 {D35F732D-55D7-4037-9C6D-E141F740F802}.Debug|x64.ActiveCfg = Release|x64 {D35F732D-55D7-4037-9C6D-E141F740F802}.Debug|x64.Build.0 = Release|x64 {D35F732D-55D7-4037-9C6D-E141F740F802}.Release|Win32.ActiveCfg = Release|Win32 {D35F732D-55D7-4037-9C6D-E141F740F802}.Release|x64.ActiveCfg = Release|x64 {D35F732D-55D7-4037-9C6D-E141F740F802}.Release|x64.Build.0 = Release|x64 {D35F732D-55D7-4037-9C6D-E141F740F802}.WinXP_32|Win32.ActiveCfg = WinXP_32|Win32 {D35F732D-55D7-4037-9C6D-E141F740F802}.WinXP_32|Win32.Build.0 = WinXP_32|Win32 {D35F732D-55D7-4037-9C6D-E141F740F802}.WinXP_32|x64.ActiveCfg = Release|x64 {D35F732D-55D7-4037-9C6D-E141F740F802}.WinXP_32|x64.Build.0 = Release|x64 {B1055DA3-83CE-47BF-98E6-2850E3411D39}.Debug|Win32.ActiveCfg = Debug|Win32 {B1055DA3-83CE-47BF-98E6-2850E3411D39}.Debug|Win32.Build.0 = Debug|Win32 {B1055DA3-83CE-47BF-98E6-2850E3411D39}.Debug|x64.ActiveCfg = Debug|x64 {B1055DA3-83CE-47BF-98E6-2850E3411D39}.Debug|x64.Build.0 = Debug|x64 {B1055DA3-83CE-47BF-98E6-2850E3411D39}.Release|Win32.ActiveCfg = Release|Win32 {B1055DA3-83CE-47BF-98E6-2850E3411D39}.Release|x64.ActiveCfg = Release|x64 {B1055DA3-83CE-47BF-98E6-2850E3411D39}.Release|x64.Build.0 = Release|x64 {B1055DA3-83CE-47BF-98E6-2850E3411D39}.WinXP_32|Win32.ActiveCfg = WinXP_32|Win32 {B1055DA3-83CE-47BF-98E6-2850E3411D39}.WinXP_32|Win32.Build.0 = WinXP_32|Win32 {B1055DA3-83CE-47BF-98E6-2850E3411D39}.WinXP_32|x64.ActiveCfg = Release|x64 {B1055DA3-83CE-47BF-98E6-2850E3411D39}.WinXP_32|x64.Build.0 = Release|x64 {19329A6B-FE96-4917-B69A-2B0375C12017}.Debug|Win32.ActiveCfg = Debug|Win32 {19329A6B-FE96-4917-B69A-2B0375C12017}.Debug|Win32.Build.0 = Debug|Win32 {19329A6B-FE96-4917-B69A-2B0375C12017}.Debug|x64.ActiveCfg = Debug|x64 {19329A6B-FE96-4917-B69A-2B0375C12017}.Debug|x64.Build.0 = Debug|x64 {19329A6B-FE96-4917-B69A-2B0375C12017}.Release|Win32.ActiveCfg = Release|Win32 {19329A6B-FE96-4917-B69A-2B0375C12017}.Release|Win32.Build.0 = Release|Win32 {19329A6B-FE96-4917-B69A-2B0375C12017}.Release|x64.ActiveCfg = Release|x64 {19329A6B-FE96-4917-B69A-2B0375C12017}.Release|x64.Build.0 = Release|x64 {19329A6B-FE96-4917-B69A-2B0375C12017}.WinXP_32|Win32.ActiveCfg = WinXP_32|Win32 {19329A6B-FE96-4917-B69A-2B0375C12017}.WinXP_32|Win32.Build.0 = WinXP_32|Win32 {19329A6B-FE96-4917-B69A-2B0375C12017}.WinXP_32|x64.ActiveCfg = Release|x64 {19329A6B-FE96-4917-B69A-2B0375C12017}.WinXP_32|x64.Build.0 = Release|x64 {D9733F9E-BE30-466F-B100-B686DF663C4D}.Debug|Win32.ActiveCfg = Debug|Win32 {D9733F9E-BE30-466F-B100-B686DF663C4D}.Debug|Win32.Build.0 = Debug|Win32 {D9733F9E-BE30-466F-B100-B686DF663C4D}.Debug|x64.ActiveCfg = Debug|x64 {D9733F9E-BE30-466F-B100-B686DF663C4D}.Debug|x64.Build.0 = Debug|x64 {D9733F9E-BE30-466F-B100-B686DF663C4D}.Release|Win32.ActiveCfg = Release|Win32 {D9733F9E-BE30-466F-B100-B686DF663C4D}.Release|x64.ActiveCfg = Release|x64 {D9733F9E-BE30-466F-B100-B686DF663C4D}.WinXP_32|Win32.ActiveCfg = Release|Win32 {D9733F9E-BE30-466F-B100-B686DF663C4D}.WinXP_32|Win32.Build.0 = Release|Win32 {D9733F9E-BE30-466F-B100-B686DF663C4D}.WinXP_32|x64.ActiveCfg = Release|x64 {01CD1176-66F7-44AB-9E7B-8AEECC9915E8}.Debug|Win32.ActiveCfg = Debug|Win32 {01CD1176-66F7-44AB-9E7B-8AEECC9915E8}.Debug|Win32.Build.0 = Debug|Win32 {01CD1176-66F7-44AB-9E7B-8AEECC9915E8}.Debug|x64.ActiveCfg = Debug|x64 {01CD1176-66F7-44AB-9E7B-8AEECC9915E8}.Debug|x64.Build.0 = Debug|x64 {01CD1176-66F7-44AB-9E7B-8AEECC9915E8}.Release|Win32.ActiveCfg = Release|Win32 {01CD1176-66F7-44AB-9E7B-8AEECC9915E8}.Release|x64.ActiveCfg = Release|x64 {01CD1176-66F7-44AB-9E7B-8AEECC9915E8}.Release|x64.Build.0 = Release|x64 {01CD1176-66F7-44AB-9E7B-8AEECC9915E8}.WinXP_32|Win32.ActiveCfg = WinXP_32|Win32 {01CD1176-66F7-44AB-9E7B-8AEECC9915E8}.WinXP_32|Win32.Build.0 = WinXP_32|Win32 {01CD1176-66F7-44AB-9E7B-8AEECC9915E8}.WinXP_32|x64.ActiveCfg = Release|x64 {01CD1176-66F7-44AB-9E7B-8AEECC9915E8}.WinXP_32|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal armory-0.92.3/cppForSwig/sighandler.cpp0000644000000000000000000000417712414772654016550 0ustar rootroot#ifdef __linux__ #include "log.h" #include #include #include #include #include #include #include static void sigsegv(int, siginfo_t *info, void*) { const int stderr=2; { const char e1[] = "\nArmory has crashed. Please provide the following " "in your bug report:\n" "Failed to dereference address "; ::write(stderr, e1, sizeof(e1)-1); } { char addr[64]; int num = snprintf(addr, sizeof(addr), "%p", info->si_addr); ::write(stderr, addr, num); ::write(stderr, "\n", 1); } void* bt_buffer[64]; int n = backtrace(bt_buffer, sizeof(bt_buffer)/sizeof(bt_buffer[0])); backtrace_symbols_fd(bt_buffer, n, stderr); // allow crash again, so that the user sees the pretty "Segmentation fault" signal(SIGSEGV, 0); // now try to write that same error to the log file // since Log::filename accesses what might be corrupt memory, // we have to repeat some of the stuff above. So it can crash // here and we still get a log on stderr int log = open(Log::filename().c_str(), O_APPEND, O_WRONLY); if (log != -1) { { const char e1[] = "\n\nSIGSEGV\n" "Failed to dereference address "; ::write(log, e1, sizeof(e1)-1); } { char addr[64]; int num = snprintf(addr, sizeof(addr), "%p", info->si_addr); ::write(log, addr, num); ::write(log, "\n", 1); } backtrace_symbols_fd(bt_buffer, n, log); ::close(log); } // now actually crash again so the user sees the error int *crash = (int*)0; *crash = 0; } static void installSignalHandler() { static bool installed=false; if (installed) return; installed = true; struct sigaction action; action.sa_sigaction = sigsegv; action.sa_flags = SA_SIGINFO | SA_NODEFER; sigaction(SIGSEGV, &action, 0); } namespace { class Init { public: Init() { installSignalHandler(); } }; } static Init install; // kate: indent-width 3; replace-tabs on; #endif armory-0.92.3/cppForSwig/log.h0000644000000000000000000003270612414772654014655 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// // // This is a convenient little C++ logging class that was based on a Dr. Dobbs // article on the subject. The logger was rewritten to include a DualStream // that pushes the log data to both std output AND file. This could easily // be extended to use an arbitrary number of streams, with a different log lvl // set on each one. At the moment, it only supports stdout and one file // simultaneously at the same loglvl, though you can use LOGDISABLESTDOUT() // to turn off the cout portion but still write to the log file. // // Usage: // // If you do not initialize the logger, the default behavior is to log nothing. // All LOGERR, LOGWARN, etc, calls wll execute without error, but they will be // diverted to a NullStream object (which throws them away). // // To use the logger, all you need to do is make one call to STARTLOGGING with // the file name and log level, and then all subsequent calls to LOGERR, etc, // will work as expected. // // STARTLOGGING("logfile.txt", LogLvlWarn); // ignore anything below LOGWARN // // LOGERR << "This is an error message, pretty much always logged"; // LOGWARN << "This is a warning"; // LOGINFO << "Given the LogLvlWarn above, this message will be ignored"; // LOGDEBUG << "This one will also be ignored" // // FLUSHLOG(); // force-flush all write buffers // LOGDISABLESTDOUT(); // Stop writing log msgs to cout, only write to file // LOGENABLESTDOUT(); // Okay nevermind, use cout again // // All logged lines begin with the msg type (ERROR, WARNING, etc), the current // time down to one second, and the file:line. Then the message is printed. // Newlines are added automatically to the end of each line, so there is no // need to use "<< endl" at the end of any log messages (in fact, it will // croak if you try to). Here's what the messages look like: // // -ERROR - 22:16:26: (code.cpp:129) I am recording an error! // -WARN - 22:16:26: (code.cpp:130) This is just a warning, don't be alarmed! // -DEBUG4- 22:16:26: (code.cpp:131) A seriously low-level debug message. // // If you'd like to change the format of the messages, you can modify the // #define'd FILEANDLINE just below the #include's, and/or modify the // getLogStream() method in the LoggerObj class (just note, you cannot // move the __FILE__ and/or __LINE__ commands into the getLogStream() method // because then it will always print "log.h:282" for the file and line). // //////////////////////////////////////////////////////////////////////////////// #ifndef __LOG_H__ #define __LOG_H__ #include #include #include #include #include #include #include "OS_TranslatePath.h" #define FILEANDLINE "(" << __FILE__ << ":" << __LINE__ << ") " #define LOGERR (LoggerObj(LogLvlError ).getLogStream() << FILEANDLINE ) #define LOGWARN (LoggerObj(LogLvlWarn ).getLogStream() << FILEANDLINE ) #define LOGINFO (LoggerObj(LogLvlInfo ).getLogStream() << FILEANDLINE ) #define LOGDEBUG (LoggerObj(LogLvlDebug ).getLogStream() << FILEANDLINE ) #define LOGDEBUG1 (LoggerObj(LogLvlDebug1).getLogStream() << FILEANDLINE ) #define LOGDEBUG2 (LoggerObj(LogLvlDebug2).getLogStream() << FILEANDLINE ) #define LOGDEBUG3 (LoggerObj(LogLvlDebug3).getLogStream() << FILEANDLINE ) #define LOGDEBUG4 (LoggerObj(LogLvlDebug4).getLogStream() << FILEANDLINE ) #define STARTLOGGING(LOGFILE, LOGLEVEL) \ Log::SetLogFile(LOGFILE); \ Log::SetLogLevel(LOGLEVEL); #define LOGDISABLESTDOUT() Log::SuppressStdout(true) #define LOGENABLESTDOUT() Log::SuppressStdout(false) #define SETLOGLEVEL(LOGLVL) Log::SetLogLevel(LOGLVL) #define FLUSHLOG() Log::FlushStreams() #define MAX_LOG_FILE_SIZE (500*1024) using namespace std; inline string NowTime(); inline unsigned long long int NowTimeInt(); typedef enum { LogLvlDisabled, LogLvlError, LogLvlWarn, LogLvlInfo, LogLvlDebug, LogLvlDebug1, LogLvlDebug2, LogLvlDebug3, LogLvlDebug4 } LogLevel; //////////////////////////////////////////////////////////////////////////////// class LogStream { public: virtual LogStream& operator<<(const char * str) = 0; virtual LogStream& operator<<(string const & str) = 0; virtual LogStream& operator<<(int i) = 0; virtual LogStream& operator<<(unsigned int i) = 0; virtual LogStream& operator<<(unsigned long long int i) = 0; virtual LogStream& operator<<(float f) = 0; virtual LogStream& operator<<(double d) = 0; #if !defined(_MSC_VER) && !defined(__MINGW32__) && defined(__LP64__) virtual LogStream& operator<<(size_t i) = 0; #endif }; //////////////////////////////////////////////////////////////////////////////// class DualStream : public LogStream { public: DualStream(void) : noStdout_(false) {} void enableStdOut(bool newbool) { noStdout_ = !newbool; } void setLogFile(string logfile, unsigned long long maxSz=MAX_LOG_FILE_SIZE) { fname_ = logfile; truncateFile(fname_, maxSz); fout_.open(OS_TranslatePath(fname_.c_str()), ios::app); fout_ << "\n\nLog file opened at " << NowTimeInt() << ": " << fname_.c_str() << endl; } void truncateFile(string logfile, unsigned long long int maxSizeInBytes) { ifstream is(OS_TranslatePath(logfile.c_str()), ios::in|ios::binary); // If file does not exist, nothing to do if(!is.is_open()) return; // Check the filesize is.seekg(0, ios::end); unsigned long long int fsize = (size_t)is.tellg(); is.close(); if(fsize < maxSizeInBytes) { // If it's already smaller than max, we're done return; } else { // Otherwise, seek to before end of log file ifstream is(OS_TranslatePath(logfile.c_str()), ios::in|ios::binary); is.seekg(fsize - maxSizeInBytes); // Allocate buffer to hold the rest of the file (about maxSizeInBytes) unsigned long long int bytesToCopy = fsize - is.tellg(); char* lastBytes = new char[(unsigned int)bytesToCopy]; is.read(lastBytes, bytesToCopy); is.close(); // Create temporary file and dump the bytes there string tempfile = logfile + string("temp"); ofstream os(OS_TranslatePath(tempfile.c_str()), ios::out|ios::binary); os.write(lastBytes, bytesToCopy); os.close(); delete[] lastBytes; // Remove the original and rename the temp file to original #ifndef _MSC_VER remove(logfile.c_str()); rename(tempfile.c_str(), logfile.c_str()); #else _wunlink(OS_TranslatePath(logfile).c_str()); _wrename(OS_TranslatePath(tempfile).c_str(), OS_TranslatePath(logfile).c_str()); #endif } } LogStream& operator<<(const char * str) { if(!noStdout_) cout << str; if(fout_.is_open()) fout_ << str; return *this; } LogStream& operator<<(string const & str) { if(!noStdout_) cout << str.c_str(); if(fout_.is_open()) fout_ << str.c_str(); return *this; } LogStream& operator<<(int i) { if(!noStdout_) cout << i; if(fout_.is_open()) fout_ << i; return *this; } LogStream& operator<<(unsigned int i) { if(!noStdout_) cout << i; if(fout_.is_open()) fout_ << i; return *this; } LogStream& operator<<(unsigned long long int i) { if(!noStdout_) cout << i; if(fout_.is_open()) fout_ << i; return *this; } LogStream& operator<<(float f) { if(!noStdout_) cout << f; if(fout_.is_open()) fout_ << f; return *this; } LogStream& operator<<(double d) { if(!noStdout_) cout << d; if(fout_.is_open()) fout_ << d; return *this; } #if !defined(_MSC_VER) && !defined(__MINGW32__) && defined(__LP64__) LogStream& operator<<(size_t i) { if(!noStdout_) cout << i; if(fout_.is_open()) fout_ << i; return *this; } #endif void FlushStreams(void) {cout.flush(); fout_.flush();} void newline(void) { *this << "\n"; } void close(void) { fout_.close(); } ofstream fout_; string fname_; bool noStdout_; }; //////////////////////////////////////////////////////////////////////////////// class NullStream : public LogStream { public: LogStream& operator<<(const char * str) { return *this; } LogStream& operator<<(string const & str) { return *this; } LogStream& operator<<(int i) { return *this; } LogStream& operator<<(unsigned int i) { return *this; } LogStream& operator<<(unsigned long long int i) { return *this; } LogStream& operator<<(float f) { return *this; } LogStream& operator<<(double d) { return *this; } #if !defined(_MSC_VER) && !defined(__MINGW32__) && defined(__LP64__) LogStream& operator<<(size_t i) { return *this; } #endif void FlushStreams(void) {} }; class Log { public: Log(void) : isInitialized_(false), disableStdout_(false) {} static Log & GetInstance(const char * filename=NULL) { static Log* theOneLog=NULL; if(theOneLog==NULL || filename!=NULL) { // Close and delete any existing Log object if(theOneLog != NULL) { theOneLog->ds_.close(); delete theOneLog; } // Create a Log object theOneLog = new Log; // Open the filestream if it's open if(filename != NULL) { theOneLog->ds_.setLogFile(string(filename)); theOneLog->isInitialized_ = true; } } return *theOneLog; } ~Log(void) { CloseLogFile(); } LogStream& Get(LogLevel level = LogLvlInfo) { if((int)level > logLevel_ || !isInitialized_) return ns_; else return ds_; } static void SetLogFile(string logfile) { GetInstance(logfile.c_str()); } static void CloseLogFile(void) { GetInstance().ds_.FlushStreams(); GetInstance().ds_ << "Closing logfile.\n"; GetInstance().ds_.close(); // This doesn't actually seem to stop the StdOut logging... not sure why yet GetInstance().isInitialized_ = false; GetInstance().logLevel_ = LogLvlDisabled; } static void SetLogLevel(LogLevel level) { GetInstance().logLevel_ = (int)level; } static void SuppressStdout(bool b=true) { GetInstance().ds_.enableStdOut(!b);} static string ToString(LogLevel level) { static const char* const buffer[] = {"DISABLED", "ERROR ", "WARN ", "INFO ", "DEBUG ", "DEBUG1", "DEBUG2", "DEBUG3", "DEBUG4"}; return buffer[level]; } static bool isOpen(void) {return GetInstance().ds_.fout_.is_open();} static string filename(void) {return GetInstance().ds_.fname_;} static void FlushStreams(void) {GetInstance().ds_.FlushStreams();} protected: DualStream ds_; NullStream ns_; int logLevel_; bool isInitialized_; bool disableStdout_; private: Log(const Log&); Log& operator =(const Log&); }; // I missed the opportunity with the above class, to design it as a constantly // constructing/destructing object that adds a newline on every destruct. So // instead I create this little wrapper that does it for me. class LoggerObj { public: LoggerObj(LogLevel lvl) : logLevel_(lvl) {} LogStream & getLogStream(void) { LogStream & lg = Log::GetInstance().Get(logLevel_); lg << "-" << Log::ToString(logLevel_); lg << "- " << NowTimeInt() << ": "; return lg; } ~LoggerObj(void) { Log::GetInstance().Get(logLevel_) << "\n"; Log::GetInstance().FlushStreams(); } private: LogLevel logLevel_; }; //#if defined(WIN32) || defined(_WIN32) || defined(__WIN32__) //# if defined (BUILDING_FILELOG_DLL) //# define FILELOG_DECLSPEC __declspec (dllexport) //# elif defined (USING_FILELOG_DLL) //# define FILELOG_DECLSPEC __declspec (dllimport) //# else //# define FILELOG_DECLSPEC //# endif // BUILDING_DBSIMPLE_DLL //#else //# define FILELOG_DECLSPEC //#endif // _WIN32 //#ifndef FILELOG_MAX_LEVEL //#define FILELOG_MAX_LEVEL LogLvlDEBUG4 //#endif #if defined(WIN32) || defined(_WIN32) || defined(__WIN32__) #include inline string NowTime() { const int MAX_LEN = 200; char buffer[MAX_LEN]; if (GetTimeFormatA(LOCALE_USER_DEFAULT, 0, 0, "HH':'mm':'ss", buffer, MAX_LEN) == 0) return "Error in NowTime()"; char result[100] = {0}; static DWORD first = GetTickCount(); sprintf(result, "%s.%03ld", buffer, (long)(GetTickCount() - first) % 1000); return result; } inline unsigned long long int NowTimeInt(void) { time_t t; time(&t); return (unsigned long long int)t; } #else #include inline string NowTime() { char buffer[11]; time_t t; time(&t); tm r = {0}; strftime(buffer, sizeof(buffer), "%X", localtime_r(&t, &r)); struct timeval tv; gettimeofday(&tv, 0); char result[100] = {0}; sprintf(result, "%s", buffer); return result; } inline unsigned long long int NowTimeInt(void) { time_t t; time(&t); return (unsigned long long int)t; } #endif //WIN32 #endif //__LOG_H__ armory-0.92.3/cppForSwig/UniversalTimer.h0000644000000000000000000001307412414772654017042 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// // // UniversalTimer // // This is a singleton class, meaning there can only ever be one of these in // existence. It keeps a master list of time accumulations for whatever is // being tracked. // // I used this class to profile itself. With 60 keys in the timer map, I timed // 5,000,000 pairs of TIMER*START_GROUP/TIMER_STOP_GROUP tags, which ran in // about 22s... // // Therefore, each timing adds about 4.5 microseconds of overhead to the code // //////////////////////////////////////////////////////////////////////////////// #ifndef _UNIVERSALTIMER_H_ #define _UNIVERSALTIMER_H_ #include #include #include #include #include #include #include "log.h" // Use these #define's to wrap code blocks, not just a single function #define TIMER_START(NAME) UniversalTimer::instance().start(NAME) #define TIMER_RESTART(NAME) UniversalTimer::instance().restart(NAME) #define TIMER_STOP(NAME) UniversalTimer::instance().stop(NAME) // Same as above, but include a group name, so to group like objects #define TIMER_START_GROUP(GRPSTR,NAME) UniversalTimer::instance().start(NAME,GRPSTR) #define TIMER_RESTART_GROUP(GRPSTR,NAME) UniversalTimer::instance().restart(NAME,GRPSTR) #define TIMER_STOP_GROUP(GRPSTR,NAME) UniversalTimer::instance().stop(NAME,GRPSTR) // WRAP ANY FUNCTION OR LINE WITH THIS METHOD — IT IS STORED BY ITS OWN NAME #define TIMER_WRAP(LINE) \ UniversalTimer::instance().start(std::string(#LINE)); \ LINE; \ UniversalTimer::instance().stop(std::string(#LINE)); // WRAP A FUNCTION OR LINE OF CODE, BUT YOU PROVIDE YOUR OWN NAME, NO GROUP #define TIMER_WRAP_CUSTOM(NAME, LINE) \ UniversalTimer::instance().start(NAME); \ LINE; \ UniversalTimer::instance().stop(NAME); // USE THE FUNCTION NAME OR LINE AS THE BASE, BUT PROVIDE A GROUP STRING #define TIMER_WRAP_GROUP(GRPSTR, LINE) \ UniversalTimer::instance().start(std::string(#LINE),GRPSTR); \ LINE; \ UniversalTimer::instance().stop(std::string(#LINE),GRPSTR); // PROVIDE YOUR OWN NAME AND GROUP STRING #define TIMER_WRAP_CUSTOM_GROUP(GRPSTR, NAME, LINE) \ UniversalTimer::instance().start(NAME,GRPSTR); \ LINE; \ UniversalTimer::instance().stop(NAME,GRPSTR); #define TIMER_READ_SEC(NAME) UniversalTimer::instance().read(NAME) // STARTS A TIMER THAT STOPS WHEN IT GOES OUT OF SCOPE //#ifdef _DEBUG //#define SCOPED_TIMER(NAME) TimerToken TimerWillStopOnDestruct(NAME) //#else #define SCOPED_TIMER(NAME) //#endif using namespace std; class UniversalTimer { public: static UniversalTimer & instance(void); void init (string key, string grpstr=""); void start (string key, string grpstr=""); void restart (string key, string grpstr=""); void stop (string key, string grpstr=""); void reset (string key, string grpstr=""); double read (string key, string grpstr=""); string getLastKey(void) {return most_recent_key_;} double getLastTiming(void) {return call_timers_[most_recent_key_].getPrev();} void printCSV(ostream & os=cout, bool excludeZeros=false); void printCSV(string filename, bool excludeZeros=false); void print(ostream & os=cout, bool excludeZeros=false); void print(string filename, bool excludeZeros=false); protected: UniversalTimer(void) : most_recent_key_("") { } private: class timer { public: timer(void) : isRunning_(false), start_clock_(0), stop_clock_(0), start_time_(0), stop_time_(0), accum_time_(0) { } void start(void); void restart(void); void stop(void); double read(void); void reset(void); double getPrev(void) { return prev_elapsed_; } private: bool isRunning_; clock_t start_clock_; clock_t stop_clock_; time_t start_time_; time_t stop_time_; double prev_elapsed_; double accum_time_; }; static UniversalTimer* theUT_; map call_timers_; map call_count_; map call_group_; string most_recent_key_; }; // Create a token at the beginning of a function, and it will stop the timer // when that token goes out of scope. // // The UniversalTimer is very fast, but not as fast as something things you // want to time. It is recommended not to add a TimerToken to every method, // unless you anticipate it will take more than 1 ms. I think it operates // on the order of microsecs, so anything shorter than 1 ms may actually be // inflated by the timer call itself. class TimerToken { public: TimerToken(string name) { timerName_ = name; UniversalTimer::instance().start(timerName_); #ifdef _DEBUG_FULL_VERBOSE LOGDEBUG3 << "Executing " << timerName_.c_str(); #endif } ~TimerToken(void) { UniversalTimer::instance().stop(timerName_); lastTiming_ = UniversalTimer::instance().read(timerName_); #ifdef _DEBUG_FULL_VERBOSE LOGDEBUG3 << "Finishing " << timerName_.c_str() << "(" << lastTiming_*1000.0 << " ms)"; #endif } private: string timerName_; double lastTiming_; }; #endif armory-0.92.3/cppForSwig/testReadBlkUpdTestnet/0000755000000000000000000000000012414772654020137 5ustar rootrootarmory-0.92.3/cppForSwig/testReadBlkUpdTestnet/blk00000_test2.dat0000644000000000000000000005276012414772654023114 0ustar rootroot  ;z{z,>gvaÈQ2:K^JIMMEThe Times 03/Jan/2009 Chancellor on brink of second bailout for banks*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_  CI&qîy 3 Ȱ| #B<_tӍ5H GVpp8_1 IMr IM/P2SH/*#!c1VcR&I_:,=~:KQ  MG$}U(p,lzdsA5.; !~ëJߠZ&iUX." 2IM542IM/P2SH/*#!n X?`wh0Nv:Vq   x*RUWinWչ4QOnlAZS*{eYOPJv ג$qIM¶IMQ/P2SH/*#!LEUIh;Ȏc{"-1T\#  m(@eɗm܏ټRX''nLmWvݢ0n͗;RAILLr~e-IMv@IM/P2SH/*#!rwXO1Xü9bAMCmq  H@v-;{8t ];j|ZNyMd"suAhIMڄIMj/P2SH/*#!ss~tCmwA,^n1 c9  !;uJfDKnx2w?4_Ei${[˫@Ы\A_E1IMA81IM/P2SH/*#!VnnZȐO  { o2}IhxM^h3fYDǓ낓HpcIMMIMP/P2SH/*#!G¸vO>MGO  +ƧJFLD=_:3\ޞ޶k>$Q?ivIM9'IM/P2SH/*#!0Di. a>/*NE@r  *Tضsm 0:m3aDra]4mMe* {{RIMHIM[/P2SH/*#!EJkfzuF  I}t )jNS0P.&l2I.Y-h?`QñdT5IM5IM6/P2SH/*#!aܳkWX._9dug{  .X잰Mkp)IZ:&쓮@7as}IM}IMG/P2SH/*#!ޔSN?4@ʱj8  '), #ODFQVRޭ~SDUuub. 8d;NIEFbBIM<BIM/P2SH/*#! 4.>. |0J1U{ZXi׶%  :ڛVx$揬2/w;2G5趫޵Pr#)er8?7kIMxIMR/P2SH/*#!*3^`~T{%A|  xDŽ~ù6x㏢jbƒL4C؋+% o T PMchhRߡIMIM/P2SH/*#!U1I9搸w΍;h  98o41<3r*B dX9ze$,,C} ^c AIMIM /P2SH/*#! s Vpمp$2]D'wUl  (LU.KU=?Q%T,qTK(Zo IаOƅuqӂIMk1IM/P2SH/*#!@tFrsZvZu Q}QAQehN]  HYZ@C1 o+pcxUWo,,<9ϘtA@e+FߊsIMIM//P2SH/*#!Z݀A O9  p]#UiJΜ at I;=5QkպLu<{y6_ԳIMIM/P2SH/*#!8$%tȎuxiLҡq,tCgs[  ]_`pȽش)AY1P} Ws<,AhV5JqIMIMc/P2SH/*#!;*ܼߒzmt24I40.zI4  s7?n*q I #M)QŲq[M<JK|-IMFIM/P2SH/*#!G ⲕ"D`u L T  E4:ߥ4ٶ|6؝RlB6#,DeWhq&ɝ?MIMO MIM6/P2SH/*#!*'(ZMT=X,lq! "wu;ì  ]d%et xDBbTL螼0Zpzj 8iIMiIM/P2SH/*#!T-DžI$e*OCGM  je ߭ùT>Hl& 4"D*%t;8eX@!lOIMCIM/P2SH/*#!]XnZ ?x!KITtTb  Q(+ihjpDR'$9SɀoHV:- (L. i%:IMpD:IM3/P2SH/*#!}yI#ΊmK `ˍDް  mj.yU J z .M#0XYl5 1s YIM"YIM/P2SH/*#!pU7MFh#zLL;2]  Y-aXAL`U犴E`/lmžf2;CN7c P}?^IMg^IM/P2SH/*#!lPX {~Ueh[aԌ}#  ݾΰGe6COH.; nq3A?9iY9-`,IM6/7IMw/P2SH/*#!YrDmUȱCăܶ𳂧KD<%̨  ev]]C[_a׷+Lmzq5,-.RfY_s|*IMIM/P2SH/*#!'E,9䱍EG3,X1wS  t1S/2pRPm^NUd!_"8sTکӂFYf 7.p`t)&IM:IM/P2SH/*#!k D?J RΉYUIvI0{  L`GKFE_dq1ݘKèĦ!Gw{㖰4OБiIMz`IM /P2SH/*#!T 5Xî ol`.Z`  qU>Z+tZ!37;y @K[%m7( 8"!" ?{\IM"&IM>/P2SH/*#!z6ĎJe˟1‹u{^[  aP%$}OѨN K )iʽUtYefH#=3iZ{%nmIMfmIMV/P2SH/*#! |NV5l}&6jՇGs6XW]  ڀ.bD>)yr2l8[oܢ/@Hyq KͣNy7˽su}IM}IM/P2SH/*#!xXZ=z)Z\?+'xIʬ  o',}+'PwT=74'#cc'QZy)\nhőIMIM_/P2SH/*#!֠1hq_>Lo Mҹ/g(  kERÇ>6yN!>f3^C,!C/cIosTs5*0b6anIMnIM*/P2SH/*#!@L W&m}I8qn m`"{;  ]vBaU$u!WKٺxBqk;ݓ#jjc<-IM-IM/P2SH/*#! '&56FQcnG\HfgFt&{  ˎ}hc%UȇJ-LPYyIRgsSSsmPIMPIM/P2SH/*#!t}$wzCzaRT&OY}ز;P  V,ĝ_j3'zh/zflJSRSv؛d@܎fIM6fIM/P2SH/*#!f#|AAu`>VljP m~i1`.  q%SE,g~O['KL-G:aFQz7\G --e؁{IMEJ{IM/P2SH/*#!NR5K+ym? }ǐAa   55{&vbmT&]oh1oK.Ix=Ԛ‡IMIM"/P2SH/*#! @||I_wG4GDg]cMbMM  }P_eZ;P3\Ӽ>qfc!Sڽcrŝ'$,$IMT,IM6/P2SH/*#!θ(XМ|s4M Wa  ջw#PPaǝu->hYz 2l (wSzd]kݔ~Cg\IM-\IM}/P2SH/*#!@~f >ϟ)fd#QR'D  a.Ů@*X1$pfJO˓)hԼ1H1D )ߔITEI GJ7eIMeIM/P2SH/*#!GC0n)ݞKsg\  Ei% +оU0,o=  )˂up]H"0ܷg}u,%޵uΊ]^ `~0h3VW_IMk_IM/P2SH/*#!pA;rEs7H\gQT  0sףht3^M+̮V/݋x\kowIMGkIMB/P2SH/*#!-󗵙DCڐ'K4n A?罐y  N.C2%i;ij a⠖pC8Sp歀d(cMH IMS7IM/P2SH/*#!JX b'2j?5G_B_D6{i  P{g6Lj8Tf` 1Ĭ  ۪Rm0}S+[^$JM5JM7/P2SH/*#!T"t?b'Yv!b0 IGTMF  ^l2|҅{ %?>HTB'AE9a$x&Sf#JMLeuJM./P2SH/*#!/y{Ja8UlJ`p  cW{4re1mS0;G3~JoyY_#1T[>}Pbp~ у.JMI.JM/P2SH/*#!Z%rks\ wy<8P'Ѭ  twɩ7p+5v?[g&2+u͂7q2Ei{1v{ńo_'s-k;O/=  KMWaLӹOXx,UåB  &e:EҶJM*JM/P2SH/*#!$\hME8<MUaN9C  qjtIȵ ^-  M1J@^!֒BF~!!JM@!JMO/P2SH/*#!!{ĦWҋ,m&熢[  \'KTE91*ѧ7p4wy];ͨJMͩJM/P2SH/*#!8fs/OQۤvm[r`  m7C|TTPKZ ;6[r/kHu73BxIHDu8>3AJMAJMe/P2SH/*#!e Es$GiK K䔽D  ,-uh^[ -a= ߽{x5j U \ %`KVtєU/JM =q0Ӗy"3w%NU%ZJMmJM/P2SH/*#!o $#μK!u1ֿRc~U WES٨  hY`e+ r]j+/5X5?N.(3K&hK|ȖX1e|TJMRGJM!/P2SH/*#!< Ýr\Xкho4͍6YFB  . ނH"7{̑ JqBz|xLUAJMJM/P2SH/*#!> \\ 2;5?fnPcD  m$%UuPN03]KeJ W4 ïbR%V?os9|"JM hmJMs/P2SH/*#!,͜pe6Id$."mҤ  ˜24[dlC\䔇7is^֔E}!5T{H!2$hJMՄZJM/P2SH/*#!N[Upvj;{u $糳e  4Y ;UǸ~ξߛ dj{lŰ'w  d)bJ; JML; JM/P2SH/*#!L2S#wX]4pRG1   LƮNd_@hL$񅇳J+QچӸR>cm~\P\H JMU'!H JM /P2SH/*#!IƧn7f[/oa H  N͖ 󖛄l6^K_K1Oi[9(koB۶%$ۓ JM;2 JM?/P2SH/*#! WDɂͧOKw/J5*  a"5᬴͘*_Mٚصv%:iݵE#hhz,| JM JM&/P2SH/*#!_Ry_b@'GKͮ.'  ZoLv]~M tP`{G/M~&mZ* JM JMM/P2SH/*#!?izEPlm7*IU:Q5  nw!6n>E 4BVݦ4.Rհ?F^5`1N 1,T>"^1d8JMO8JM)/P2SH/*#!rc,43S2 D8I5O  aB7Gi]ԬLꪐ?oͫO^u≛ h"f'1d]2j1M=JMU=JM/P2SH/*#!"d2`4NA3H(B̅Y'K  u {9OmR* R${ykz=Em^^g1K4IAJMAJM/P2SH/*#!hn=PHۨvK/%k+"݊$D  #]S;#ǗD*{3S2)Hj좳"H H7w0v5AL[JM̀[JM/P2SH/*#!m̟ȍzTKpH0Jex@+  M7 B7{R9P&cnT#@? \'|C0aOBF bJMbJM/P2SH/*#!TV4 16{ \l7  tB:dzEgӡ^pqFjwn Cjpxu‚"F˓HNuU7gW [tJM ʴtJM /P2SH/*#!`)M(!obΞRJ%P>iO4  /;՛w`05Bu)I3Y|g 9It)XrJMkJMi/P2SH/*#!Ad ĭ(+*J,Q:M>G=zesj"g-*G#hBJMrmJM/P2SH/*#!׺{#pqQțb s  C -k#-?cN=1C38UԖ$q xAz5D56eOݣJMB@JM/P2SH/*#!j1JF @tZ͋!0I  c^MBNP{.0H}ֽyxIN@ c3:2a{JܙgU *vIgJMJM/P2SH/*#!uVHL$B!0-7>  Hr뉟QBqٚ0JeFPGDUo9YMMY/SJMeSJM>/P2SH/*#!+8TM#MQB萞ySgvaÈQ2:K^JIMMEThe Times 03/Jan/2009 Chancellor on brink of second bailout for banks*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_  CI&qîy 3 Ȱ| #B<_tӍ5H GVpp8_1 IMr IM/P2SH/*#!c1VcR&I_:,=~:KQ  MG$}U(p,lzdsA5.; !~ëJߠZ&iUX." 2IM542IM/P2SH/*#!n X?`wh0Nv:Vq   x*RUWinWչ4QOnlAZS*{eYOPJv ג$qIM¶IMQ/P2SH/*#!LEUIh;Ȏc{"-1T\#  m(@eɗm܏ټRX''nLmWvݢ0n͗;RAILLr~e-IMv@IM/P2SH/*#!rwXO1Xü9bAMCmq  H@v-;{8t ];j|ZNyMd"suAhIMڄIMj/P2SH/*#!ss~tCmwA,^n1 c9  !;uJfDKnx2w?4_Ei${[˫@Ы\A_E1IMA81IM/P2SH/*#!VnnZȐO  { o2}IhxM^h3fYDǓ낓HpcIMMIMP/P2SH/*#!G¸vO>MGO  +ƧJFLD=_:3\ޞ޶k>$Q?ivIM9'IM/P2SH/*#!0Di. a>/*NE@r  *Tضsm 0:m3aDra]4mMe* {{RIMHIM[/P2SH/*#!EJkfzuF  I}t )jNS0P.&l2I.Y-h?`QñdT5IM5IM6/P2SH/*#!aܳkWX._9dug{  .X잰Mkp)IZ:&쓮@7as}IM}IMG/P2SH/*#!ޔSN?4@ʱj8  '), #ODFQVRޭ~SDUuub. 8d;NIEFbBIM<BIM/P2SH/*#! 4.>. |0J1U{ZXi׶%  :ڛVx$揬2/w;2G5趫޵Pr#)er8?7kIMxIMR/P2SH/*#!*3^`~T{%A|  xDŽ~ù6x㏢jbƒL4C؋+% o T PMchhRߡIMIM/P2SH/*#!U1I9搸w΍;h  98o41<3r*B dX9ze$,,C} ^c AIMIM /P2SH/*#! s Vpمp$2]D'wUl  (LU.KU=?Q%T,qTK(Zo IаOƅuqӂIMk1IM/P2SH/*#!@tFrsZvZu Q}QAQehN]  HYZ@C1 o+pcxUWo,,<9ϘtA@e+FߊsIMIM//P2SH/*#!Z݀A O9  p]#UiJΜ at I;=5QkպLu<{y6_ԳIMIM/P2SH/*#!8$%tȎuxiLҡq,tCgs[  ]_`pȽش)AY1P} Ws<,AhV5JqIMIMc/P2SH/*#!;*ܼߒzmt24I40.zI4  s7?n*q I #M)QŲq[M<JK|-IMFIM/P2SH/*#!G ⲕ"D`u L T  E4:ߥ4ٶ|6؝RlB6#,DeWhq&ɝ?MIMO MIM6/P2SH/*#!*'(ZMT=X,lq! "wu;ì  ]d%et xDBbTL螼0Zpzj 8iIMiIM/P2SH/*#!T-DžI$e*OCGM  je ߭ùT>Hl& 4"D*%t;8eX@!lOIMCIM/P2SH/*#!]XnZ ?x!KITtTb  Q(+ihjpDR'$9SɀoHV:- (L. i%:IMpD:IM3/P2SH/*#!}yI#ΊmK `ˍDް  mj.yU J z .M#0XYl5 1s YIM"YIM/P2SH/*#!pU7MFh#zLL;2]  Y-aXAL`U犴E`/lmžf2;CN7c P}?^IMg^IM/P2SH/*#!lPX {~Ueh[aԌ}#  ݾΰGe6COH.; nq3A?9iY9-`,IM6/7IMw/P2SH/*#!YrDmUȱCăܶ𳂧KD<%̨  ev]]C[_a׷+Lmzq5,-.RfY_s|*IMIM/P2SH/*#!'E,9䱍EG3,X1wS  t1S/2pRPm^NUd!_"8sTکӂFYf 7.p`t)&IM:IM/P2SH/*#!k D?J RΉYUIvI0{  L`GKFE_dq1ݘKèĦ!Gw{㖰4OБiIMz`IM /P2SH/*#!T 5Xî ol`.Z`  qU>Z+tZ!37;y @K[%m7( 8"!" ?{\IM"&IM>/P2SH/*#!z6ĎJe˟1‹u{^[  aP%$}OѨN K )iʽUtYefH#=3iZ{%nmIMfmIMV/P2SH/*#! |NV5l}&6jՇGs6XW]  ڀ.bD>)yr2l8[oܢ/@Hyq KͣNy7˽su}IM}IM/P2SH/*#!xXZ=z)Z\?+'xIʬ  o',}+'PwT=74'#cc'QZy)\nhőIMIM_/P2SH/*#!֠1hq_>Lo Mҹ/g(  kERÇ>6yN!>f3^C,!C/cIosTs5*0b6anIMnIM*/P2SH/*#!@L W&m}I8qn m`"{;  ]vBaU$u!WKٺxBqk;ݓ#jjc<-IM-IM/P2SH/*#! '&56FQcnG\HfgFt&{  ˎ}hc%UȇJ-LPYyIRgsSSsmPIMPIM/P2SH/*#!t}$wzCzaRT&OY}ز;P  V,ĝ_j3'zh/zflJSRSv؛d@܎fIM6fIM/P2SH/*#!f#|AAu`>VljP m~i1`.  q%SE,g~O['KL-G:aFQz7\G --e؁{IMEJ{IM/P2SH/*#!NR5K+ym? }ǐAa   55{&vbmT&]oh1oK.Ix=Ԛ‡IMIM"/P2SH/*#! @||I_wG4GDg]cMbMM  }P_eZ;P3\Ӽ>qfc!Sڽcrŝ'$,$IMT,IM6/P2SH/*#!θ(XМ|s4M Wa  ջw#PPaǝu->hYz 2l (wSzd]kݔ~Cg\IM-\IM}/P2SH/*#!@~f >ϟ)fd#QR'D  a.Ů@*X1$pfJO˓)hԼ1H1D )ߔITEI GJ7eIMeIM/P2SH/*#!GC0n)ݞKsg\  Ei% +оU0,o=  )˂up]H"0ܷg}u,%޵uΊ]^ `~0h3VW_IMk_IM/P2SH/*#!pA;rEs7H\gQT  0sףht3^M+̮V/݋x\kowIMGkIMB/P2SH/*#!-󗵙DCڐ'K4n A?罐y  N.C2%i;ij a⠖pC8Sp歀d(cMH IMS7IM/P2SH/*#!JX b'2j?5G_B_D6{i  P{g6Lj8Tf` 1Ĭ  ۪Rm0}S+[^$JM5JM7/P2SH/*#!T"t?b'Yv!b0 IGTMF  ^l2|҅{ %?>HTB'AE9a$x&Sf#JMLeuJM./P2SH/*#!/y{Ja8UlJ`p  cW{4re1mS0;G3~JoyY_#1T[>}Pbp~ у.JMI.JM/P2SH/*#!Z%rks\ wy<8P'Ѭ  twɩ7p+5v?[g&2+u͂7q2Ei{1v{ńo_'s-k;O/=  KMWaLӹOXx,UåB  &e:EҶJM*JM/P2SH/*#!$\hME8<MUaN9C  qjtIȵ ^-  M1J@^!֒BF~!!JM@!JMO/P2SH/*#!!{ĦWҋ,m&熢[  \'KTE91*ѧ7p4wy];ͨJMͩJM/P2SH/*#!8fs/OQۤvm[r`  m7C|TTPKZ ;6[r/kHu73BxIHDu8>3AJMAJMe/P2SH/*#!e Es$GiK K䔽D  ,-uh^[ -a= ߽{x5j U \ %`KVtєU/JM =q0Ӗy"3w%NU%ZJMmJM/P2SH/*#!o $#μK!u1ֿRc~U WES٨  hY`e+ r]j+/5X5?N.(3K&hK|ȖX1e|TJMRGJM!/P2SH/*#!< Ýr\Xкho4͍6YFB  . ނH"7{̑ JqBz|xLUAJMJM/P2SH/*#!> \\ 2;5?fnPcD  m$%UuPN03]KeJ W4 ïbR%V?os9|"JM hmJMs/P2SH/*#!,͜pe6Id$."mҤ  ˜24[dlC\䔇7is^֔E}!5T{H!2$hJMՄZJM/P2SH/*#!N[Upvj;{u $糳e  4Y ;UǸ~ξߛ dj{lŰ'w  d)bJ; JML; JM/P2SH/*#!L2S#wX]4pRG1   LƮNd_@hL$񅇳J+QچӸR>cm~\P\H JMU'!H JM /P2SH/*#!IƧn7f[/oa H  N͖ 󖛄l6^K_K1Oi[9(koB۶%$ۓ JM;2 JM?/P2SH/*#! WDɂͧOKw/J5*  a"5᬴͘*_Mٚصv%:iݵE#hhz,| JM JM&/P2SH/*#!_Ry_b@'GKͮ.'  ZoLv]~M tP`{G/M~&mZ* JM JMM/P2SH/*#!?izEPlm7*IU:Q5  nw!6n>E 4BVݦ4.Rհ?F^5`1N 1,T>"^1d8JMO8JM)/P2SH/*#!rc,43S2 D8I5O  aB7Gi]ԬLꪐ?oͫO^u≛ h"f'1d]2j1M=JMU=JM/P2SH/*#!"d2`4NA3H(B̅Y'K  u {9OmR* R${ykz=Em^^g1K4IAJMAJM/P2SH/*#!hn=PHۨvK/%k+"݊$D  #]S;#ǗD*{3S2)Hj좳"H H7w0v5AL[JM̀[JM/P2SH/*#!m̟ȍzTKpH0Jex@+  M7 B7{R9P&cnT#@? \'|C0aOBF bJMbJM/P2SH/*#!TV4 16{ \l7  tB:dzEgӡ^pqFjwn Cjpxu‚"F˓HNuU7gW [tJM ʴtJM /P2SH/*#!`)M(!obΞRJ%P>iO4  /;՛w`05Bu)I3Y|g 9It)XrJMkJMi/P2SH/*#!Ad ĭ(+*J,Q:M>G=zesj"g-*G#hBJMrmJM/P2SH/*#!׺{#pqQțb sarmory-0.92.3/cppForSwig/testReadBlkUpdTestnet/blk00000_test1.dat0000644000000000000000000005276012414772654023113 0ustar rootroot  ;z{z,>gvaÈQ2:K^JIMMEThe Times 03/Jan/2009 Chancellor on brink of second bailout for banks*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_  CI&qîy 3 Ȱ| #B<_tӍ5H GVpp8_1 IMr IM/P2SH/*#!c1VcR&I_:,=~:KQ  MG$}U(p,lzdsA5.; !~ëJߠZ&iUX." 2IM542IM/P2SH/*#!n X?`wh0Nv:Vq   x*RUWinWչ4QOnlAZS*{eYOPJv ג$qIM¶IMQ/P2SH/*#!LEUIh;Ȏc{"-1T\#  m(@eɗm܏ټRX''nLmWvݢ0n͗;RAILLr~e-IMv@IM/P2SH/*#!rwXO1Xü9bAMCmq  H@v-;{8t ];j|ZNyMd"suAhIMڄIMj/P2SH/*#!ss~tCmwA,^n1 c9  !;uJfDKnx2w?4_Ei${[˫@Ы\A_E1IMA81IM/P2SH/*#!VnnZȐO  { o2}IhxM^h3fYDǓ낓HpcIMMIMP/P2SH/*#!G¸vO>MGO  +ƧJFLD=_:3\ޞ޶k>$Q?ivIM9'IM/P2SH/*#!0Di. a>/*NE@r  *Tضsm 0:m3aDra]4mMe* {{RIMHIM[/P2SH/*#!EJkfzuF  I}t )jNS0P.&l2I.Y-h?`QñdT5IM5IM6/P2SH/*#!aܳkWX._9dug{  .X잰Mkp)IZ:&쓮@7as}IM}IMG/P2SH/*#!ޔSN?4@ʱj8  '), #ODFQVRޭ~SDUuub. 8d;NIEFbBIM<BIM/P2SH/*#! 4.>. |0J1U{ZXi׶%  :ڛVx$揬2/w;2G5趫޵Pr#)er8?7kIMxIMR/P2SH/*#!*3^`~T{%A|  xDŽ~ù6x㏢jbƒL4C؋+% o T PMchhRߡIMIM/P2SH/*#!U1I9搸w΍;h  98o41<3r*B dX9ze$,,C} ^c AIMIM /P2SH/*#! s Vpمp$2]D'wUl  (LU.KU=?Q%T,qTK(Zo IаOƅuqӂIMk1IM/P2SH/*#!@tFrsZvZu Q}QAQehN]  HYZ@C1 o+pcxUWo,,<9ϘtA@e+FߊsIMIM//P2SH/*#!Z݀A O9  p]#UiJΜ at I;=5QkպLu<{y6_ԳIMIM/P2SH/*#!8$%tȎuxiLҡq,tCgs[  ]_`pȽش)AY1P} Ws<,AhV5JqIMIMc/P2SH/*#!;*ܼߒzmt24I40.zI4  s7?n*q I #M)QŲq[M<JK|-IMFIM/P2SH/*#!G ⲕ"D`u L T  E4:ߥ4ٶ|6؝RlB6#,DeWhq&ɝ?MIMO MIM6/P2SH/*#!*'(ZMT=X,lq! "wu;ì  ]d%et xDBbTL螼0Zpzj 8iIMiIM/P2SH/*#!T-DžI$e*OCGM  je ߭ùT>Hl& 4"D*%t;8eX@!lOIMCIM/P2SH/*#!]XnZ ?x!KITtTb  Q(+ihjpDR'$9SɀoHV:- (L. i%:IMpD:IM3/P2SH/*#!}yI#ΊmK `ˍDް  mj.yU J z .M#0XYl5 1s YIM"YIM/P2SH/*#!pU7MFh#zLL;2]  Y-aXAL`U犴E`/lmžf2;CN7c P}?^IMg^IM/P2SH/*#!lPX {~Ueh[aԌ}#  ݾΰGe6COH.; nq3A?9iY9-`,IM6/7IMw/P2SH/*#!YrDmUȱCăܶ𳂧KD<%̨  ev]]C[_a׷+Lmzq5,-.RfY_s|*IMIM/P2SH/*#!'E,9䱍EG3,X1wS  t1S/2pRPm^NUd!_"8sTکӂFYf 7.p`t)&IM:IM/P2SH/*#!k D?J RΉYUIvI0{  L`GKFE_dq1ݘKèĦ!Gw{㖰4OБiIMz`IM /P2SH/*#!T 5Xî ol`.Z`  qU>Z+tZ!37;y @K[%m7( 8"!" ?{\IM"&IM>/P2SH/*#!z6ĎJe˟1‹u{^[  aP%$}OѨN K )iʽUtYefH#=3iZ{%nmIMfmIMV/P2SH/*#! |NV5l}&6jՇGs6XW]  ڀ.bD>)yr2l8[oܢ/@Hyq KͣNy7˽su}IM}IM/P2SH/*#!xXZ=z)Z\?+'xIʬ  o',}+'PwT=74'#cc'QZy)\nhőIMIM_/P2SH/*#!֠1hq_>Lo Mҹ/g(  kERÇ>6yN!>f3^C,!C/cIosTs5*0b6anIMnIM*/P2SH/*#!@L W&m}I8qn m`"{;  ]vBaU$u!WKٺxBqk;ݓ#jjc<-IM-IM/P2SH/*#! '&56FQcnG\HfgFt&{  ˎ}hc%UȇJ-LPYyIRgsSSsmPIMPIM/P2SH/*#!t}$wzCzaRT&OY}ز;P  V,ĝ_j3'zh/zflJSRSv؛d@܎fIM6fIM/P2SH/*#!f#|AAu`>VljP m~i1`.  q%SE,g~O['KL-G:aFQz7\G --e؁{IMEJ{IM/P2SH/*#!NR5K+ym? }ǐAa   55{&vbmT&]oh1oK.Ix=Ԛ‡IMIM"/P2SH/*#! @||I_wG4GDg]cMbMM  }P_eZ;P3\Ӽ>qfc!Sڽcrŝ'$,$IMT,IM6/P2SH/*#!θ(XМ|s4M Wa  ջw#PPaǝu->hYz 2l (wSzd]kݔ~Cg\IM-\IM}/P2SH/*#!@~f >ϟ)fd#QR'D  a.Ů@*X1$pfJO˓)hԼ1H1D )ߔITEI GJ7eIMeIM/P2SH/*#!GC0n)ݞKsg\  Ei% +оU0,o=  )˂up]H"0ܷg}u,%޵uΊ]^ `~0h3VW_IMk_IM/P2SH/*#!pA;rEs7H\gQT  0sףht3^M+̮V/݋x\kowIMGkIMB/P2SH/*#!-󗵙DCڐ'K4n A?罐y  N.C2%i;ij a⠖pC8Sp歀d(cMH IMS7IM/P2SH/*#!JX b'2j?5G_B_D6{i  P{g6Lj8Tf` 1Ĭ  ۪Rm0}S+[^$JM5JM7/P2SH/*#!T"t?b'Yv!b0 IGTMF  ^l2|҅{ %?>HTB'AE9a$x&Sf#JMLeuJM./P2SH/*#!/y{Ja8UlJ`p  cW{4re1mS0;G3~JoyY_#1T[>}Pbp~ у.JMI.JM/P2SH/*#!Z%rks\ wy<8P'Ѭ  twɩ7p+5v?[g&2+u͂7q2Ei{1v{ńo_'s-k;O/=  KMWaLӹOXx,UåB  &e:EҶJM*JM/P2SH/*#!$\hME8<MUaN9C  qjtIȵ ^-  M1J@^!֒BF~!!JM@!JMO/P2SH/*#!!{ĦWҋ,m&熢[  \'KTE91*ѧ7p4wy];ͨJMͩJM/P2SH/*#!8fs/OQۤvm[r`  m7C|TTPKZ ;6[r/kHu73BxIHDu8>3AJMAJMe/P2SH/*#!e Es$GiK K䔽D  ,-uh^[ -a= ߽{x5j U \ %`KVtєU/JM =q0Ӗy"3w%NU%ZJMmJM/P2SH/*#!o $#μK!u1ֿRc~U WES٨  hY`e+ r]j+/5X5?N.(3K&hK|ȖX1e|TJMRGJM!/P2SH/*#!< Ýr\Xкho4͍6YFB  . ނH"7{̑ JqBz|xLUAJMJM/P2SH/*#!> \\ 2;5?fnPcD  m$%UuPN03]KeJ W4 ïbR%V?os9|"JM hmJMs/P2SH/*#!,͜pe6Id$."mҤ  ˜24[dlC\䔇7is^֔E}!5T{H!2$hJMՄZJM/P2SH/*#!N[Upvj;{u $糳e  4Y ;UǸ~ξߛ dj{lŰ'w  d)bJ; JML; JM/P2SH/*#!L2S#wX]4pRG1   LƮNd_@hL$񅇳J+QچӸR>cm~\P\H JMU'!H JM /P2SH/*#!IƧn7f[/oa H  N͖ 󖛄l6^K_K1Oi[9(koB۶%$ۓ JM;2 JM?/P2SH/*#! WDɂͧOKw/J5*  a"5᬴͘*_Mٚصv%:iݵE#hhz,| JM JM&/P2SH/*#!_Ry_b@'GKͮ.'  ZoLv]~M tP`{G/M~&mZ* JM JMM/P2SH/*#!?izEPlm7*IU:Q5  nw!6n>E 4BVݦ4.Rհ?F^5`1N 1,T>"^1d8JMO8JM)/P2SH/*#!rc,43S2 D8I5O  aB7Gi]ԬLꪐ?oͫO^u≛ h"f'1d]2j1M=JMU=JM/P2SH/*#!"d2`4NA3H(B̅Y'K  u {9OmR* R${ykz=Em^^g1K4IAJMAJM/P2SH/*#!hn=PHۨvK/%k+"݊$D  #]S;#ǗD*{3S2)Hj좳"H H7w0v5AL[JM̀[JM/P2SH/*#!m̟ȍzTKpH0Jex@+  M7 B7{R9P&cnT#@? \'|C0aOBF bJMbJM/P2SH/*#!TV4 16{ \l7  tB:dzEgӡ^pqFjwn Cjpxu‚"F˓HNuU7gW [tJM ʴtJM /P2SH/*#!`)M(!obΞRJ%P>iO4  /;՛w`05Bu)I3Y|g 9It)XrJMkJMi/P2SH/*#!Ad ĭ(+*J,Q:M>G=zesj"g-*G#hBJMrmJM/P2SH/*#!׺{#pqQțb s  C -k#-?cN=1C38UԖ$q xAz5D56eOݣJMB@JM/P2SH/*#!j1JF @tZ͋!0Iarmory-0.92.3/cppForSwig/testReadBlkUpdTestnet/blk00001_test3.dat0000644000000000000000000000175012414772654023107 0ustar rootroot  uLI^$?C.%<2O:EzI!{Y3zB7 HC#-pJM>nJM?/P2SH/*#!zd7ckbC/]YM"armory-0.92.3/cppForSwig/testReadBlkUpdTestnet/blk00002_test5.dat0000644000000000000000000000175012414772654023112 0ustar rootroot  5?|ް}XN!A{1%zX:$utrxiaVHJM*iJMa/P2SH/*#!AY-jO&Zk9jVJkҲߟa%&ܬ  Ď4k72M͜ ڟ[GS.>_T=m΍$,X6hy_So(JMJM/P2SH/*#!P?6#d,.gюIx  ` J@܆[<]-Il2A Dd8?8cPoJ.{JM1{JM/P2SH/*#!E^ T¤M-N;f\xM  ^ pU{(r_H1݂=l ew.\oL:-c${r:,]JM"JM!/P2SH/*#!(XOjG'ckiZSwͣ/9armory-0.92.3/cppForSwig/testReadBlkUpdTestnet/blk00003_test5.dat0000644000000000000000000000175012414772654023113 0ustar rootroot  ^ pU{(r_H1݂=l ew.\oL:-c${r:,]JM"JM!/P2SH/*#!(XOjG'ckiZSwͣ/9  V2 OCe#L@ό浂/A^5JB*liץۦq6=t>JM6JM^/P2SH/*#!P#!vKh1]E1s0,[  ̰c}tUa_oxUuhk3rуIfcZW>dJMZJM/P2SH/*#!%%C Ra_gwF5iq$`  mzaF'@K;,( TbYuow|z}XyA?LUJMRlMJMA/P2SH/*#!(GVt2V6Jg%⣎s8΢KB armory-0.92.3/cppForSwig/testReadBlkUpdTestnet/blk00002_test4.dat0000644000000000000000000000175012414772654023111 0ustar rootroot  5?|ް}XN!A{1%zX:$utrxiaVHJM*iJMa/P2SH/*#!AY-jO&Zk9jVJkҲߟa%&ܬ  Ď4k72M͜ ڟ[GS.>_T=m΍$,X6hy_So(JMJM/P2SH/*#!P?6#d,.gюIx  ` J@܆[<]-Il2A Dd8?8cPoJ.{JM1{JM/P2SH/*#!E^ T¤M-N;f\xMarmory-0.92.3/cppForSwig/Makefile0000644000000000000000000000525312414772654015360 0ustar rootrootCXX = g++ ifdef DEBUG CFLAGS=-g3 -Wall -pipe -fPIC CXXFLAGS=-g3 -Wall -pipe -fPIC else CFLAGS=-O2 -pipe -fPIC CXXFLAGS=-O2 -pipe -fPIC endif platform=$(shell uname) ifeq ($(shell uname), Darwin) MACOSX_DEPLOYMENT_TARGET=10.7 export MACOSX_DEPLOYMENT_TARGET LDFLAGS += -undefined dynamic_lookup -headerpad_max_install_names endif #************************************************************************** LINK = $(CXX) OBJS = UniversalTimer.o BinaryData.o leveldb_wrapper.o StoredBlockObj.o BtcUtils.o BlockObj.o BlockUtils.o EncryptionUtils.o libcryptopp.a libleveldb.a sighandler.o #if python is specified, use it ifndef PYVER PYTHON_INCLUDES=$(shell python-config --includes ) else PYTHON_INCLUDES=$(shell $(PYVER)-config --includes ) endif CPPFLAGS += $(ARMORY_CPPFLAGS) -Icryptopp -Ileveldb/include -DUSE_CRYPTOPP -D__STDC_LIMIT_MACROS LDLIBS += -lpthread -Lleveldb SWIG_OPTS += -c++ -python -classic -threads SWIG_INC += $(PYTHON_INCLUDES) CXXCPP += $(CPPFLAGS) #************************************************************************** all: ../_CppBlockUtils.so ../qrc_img_resources.py ../_CppBlockUtils.so: $(OBJS) CppBlockUtils_wrap.o $(LINK) -shared -fPIC $(LDLIBS) $(LDFLAGS) $(CXXFLAGS) $(OBJS) $(STATICPYTHON) CppBlockUtils_wrap.o -o ../_CppBlockUtils.so ../qrc_img_resources.py: ../imgList.xml pyrcc4 -o ../qrc_img_resources.py ../imgList.xml #************************************************************************** libcryptopp.a: Makefile $(MAKE) -C cryptopp libcryptopp.a mv cryptopp/libcryptopp.a . libleveldb.a: Makefile $(MAKE) -C leveldb libleveldb.a mv leveldb/libleveldb.a . %.o: %.cpp %.h $(CXX) $(CXXCPP) $(CXXFLAGS) -c $< BinaryData.o: BtcUtils.h log.h BtcUtils.o: log.h BlockObj.o: BinaryData.h BtcUtils.h StoredBlockObj.o: log.h BtcUtils.h BinaryData.h leveldb_wrapper.o: log.h BtcUtils.h BinaryData.h BlockUtils.o: log.h BinaryData.h UniversalTimer.h PartialMerkle.h EncryptionUtils.o: log.h BtcUtils.h BinaryData.h CppBlockUtils_wrap.cxx: log.h BlockUtils.h BinaryData.h BlockObj.h UniversalTimer.h BlockUtils.h BlockUtils.cpp CppBlockUtils.i swig $(SWIG_OPTS) -outdir ../ -v CppBlockUtils.i CppBlockUtils_wrap.o: log.h BlockUtils.h BinaryData.h UniversalTimer.h CppBlockUtils_wrap.cxx $(CXX) $(SWIG_INC) $(CXXFLAGS) $(CXXCPP) -c CppBlockUtils_wrap.cxx ########################################################################## # And now we have created all the individual object files specified with # the macro "OBJS". #************************************************************************ clean: touch CppBlockUtils.i rm -f *.o *.out *.a rm -f CppBlockUtils_wrap.cxx $(MAKE) -C cryptopp clean $(MAKE) -C leveldb clean $(MAKE) -C gtest clean armory-0.92.3/cppForSwig/BlockUtils.h0000644000000000000000000012411012414772654016136 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// #ifndef _BLOCKUTILS_H_ #define _BLOCKUTILS_H_ #include #include //#ifdef WIN32 //#include //#else //#include //#include //#include //#endif #include #include #include #include #include #include #include #include #include #include "BinaryData.h" #include "BtcUtils.h" #include "BlockObj.h" #include "StoredBlockObj.h" #include "leveldb_wrapper.h" #include "cryptlib.h" #include "sha.h" #include "UniversalTimer.h" #include "leveldb/db.h" #define NUM_BLKS_BATCH_THRESH 30 #define UPDATE_BYTES_SSH 25 #define UPDATE_BYTES_SUBSSH 75 #define NUM_BLKS_IS_DIRTY 2016 using namespace std; class BlockDataManager_LevelDB; typedef enum { ADD_BLOCK_SUCCEEDED, ADD_BLOCK_NEW_TOP_BLOCK, ADD_BLOCK_CAUSED_REORG, } ADD_BLOCK_RESULT_INDEX; typedef enum { TX_DNE, TX_ZEROCONF, TX_IN_BLOCKCHAIN } TX_AVAILABILITY; typedef enum { DB_BUILD_HEADERS, DB_BUILD_ADD_RAW, DB_BUILD_APPLY, DB_BUILD_SCAN } DB_BUILD_PHASE; //////////////////////////////////////////////////////////////////////////////// // // LedgerEntry // // LedgerEntry class is used for both ScrAddresses and BtcWallets. Members // have slightly different meanings (or irrelevant) depending which one it's // used with. // // Address -- Each entry corresponds to ONE TxIn OR ONE TxOut // // scrAddr_ - useless - just repeating this address // value_ - net debit/credit on addr balance, in Satoshis (1e-8 BTC) // blockNum_ - block height of the tx in which this txin/out was included // txHash_ - hash of the tx in which this txin/txout was included // index_ - index of the txin/txout in this tx // isValid_ - default to true -- invalidated due to reorg/double-spend // isCoinbase - is the input side a coinbase/generation input // isSentToSelf_ - if this is a txOut, did it come from ourself? // isChangeBack_ - meaningless: can't quite figure out how to determine // this unless I do a prescan to determine if all txOuts // are ours, or just some of them // // BtcWallet -- Each entry corresponds to ONE WHOLE TRANSACTION // // scrAddr_ - useless - originally had a purpose, but lost it // value_ - total debit/credit on WALLET balance, in Satoshis (1e-8 BTC) // blockNum_ - block height of the block in which this tx was included // txHash_ - hash of this tx // index_ - index of the tx in the block // isValid_ - default to true -- invalidated due to reorg/double-spend // isCoinbase - is the input side a coinbase/generation input // isSentToSelf_ - if we supplied inputs and rx ALL outputs // isChangeBack_ - if we supplied inputs and rx ANY outputs // //////////////////////////////////////////////////////////////////////////////// class LedgerEntry { public: LedgerEntry(void) : scrAddr_(0), value_(0), blockNum_(UINT32_MAX), txHash_(BtcUtils::EmptyHash_), index_(UINT32_MAX), txTime_(0), isValid_(false), isCoinbase_(false), isSentToSelf_(false), isChangeBack_(false) {} LedgerEntry(BinaryData const & scraddr, int64_t val, uint32_t blkNum, BinaryData const & txhash, uint32_t idx, uint32_t txtime=0, bool isCoinbase=false, bool isToSelf=false, bool isChange=false) : scrAddr_(scraddr), value_(val), blockNum_(blkNum), txHash_(txhash), index_(idx), txTime_(txtime), isValid_(true), isCoinbase_(isCoinbase), isSentToSelf_(isToSelf), isChangeBack_(isChange) {} BinaryData const & getScrAddr(void) const { return scrAddr_; } int64_t getValue(void) const { return value_; } uint32_t getBlockNum(void) const { return blockNum_; } BinaryData const & getTxHash(void) const { return txHash_; } uint32_t getIndex(void) const { return index_; } uint32_t getTxTime(void) const { return txTime_; } bool isValid(void) const { return isValid_; } bool isCoinbase(void) const { return isCoinbase_; } bool isSentToSelf(void) const { return isSentToSelf_; } bool isChangeBack(void) const { return isChangeBack_; } SCRIPT_PREFIX getScriptType(void) const {return (SCRIPT_PREFIX)scrAddr_[0];} void setScrAddr(BinaryData const & bd) { scrAddr_.copyFrom(bd); } void setValid(bool b=true) { isValid_ = b; } void changeBlkNum(uint32_t newHgt) {blockNum_ = newHgt; } bool operator<(LedgerEntry const & le2) const; bool operator==(LedgerEntry const & le2) const; void pprint(void); void pprintOneLine(void); private: BinaryData scrAddr_; int64_t value_; uint32_t blockNum_; BinaryData txHash_; uint32_t index_; // either a tx index, txout index or txin index uint32_t txTime_; bool isValid_; bool isCoinbase_; bool isSentToSelf_; bool isChangeBack_; }; //////////////////////////////////////////////////////////////////////////////// class AddressBookEntry { public: ///// AddressBookEntry(void) : scrAddr_(BtcUtils::EmptyHash_) { txList_.clear(); } explicit AddressBookEntry(BinaryData scraddr) : scrAddr_(scraddr) { txList_.clear(); } void addTx(Tx & tx) { txList_.push_back( RegisteredTx(tx) ); } BinaryData getScrAddr(void) { return scrAddr_; } ///// vector getTxList(void) { sort(txList_.begin(), txList_.end()); return txList_; } ///// bool operator<(AddressBookEntry const & abe2) const { // If one of the entries has no tx (this shouldn't happen), sort by hash if( txList_.size()==0 || abe2.txList_.size()==0) return scrAddr_ < abe2.scrAddr_; return (txList_[0] < abe2.txList_[0]); } private: BinaryData scrAddr_; vector txList_; }; class BtcWallet; //////////////////////////////////////////////////////////////////////////////// // // ScrAddrObj // // This class is only for scanning the blockchain (information only). It has // no need to keep track of the public and private keys of various addresses, // which is done by the python code leveraging this class. // // I call these as "scraddresses". In most contexts, it represents an // "address" that people use to send coins per-to-person, but it could actually // represent any kind of TxOut script. Multisig, P2SH, or any non-standard, // unusual, escrow, whatever "address." While it might be more technically // correct to just call this class "Script" or "TxOutScript", I felt like // "address" is a term that will always exist in the Bitcoin ecosystem, and // frequently used even when not preferred. // // Similarly, we refer to the member variable scraddr_ as a "scradder". It // is actually a reduction of the TxOut script to a form that is identical // regardless of whether pay-to-pubkey or pay-to-pubkey-hash is used. // // //////////////////////////////////////////////////////////////////////////////// class ScrAddrObj { friend class BtcWallet; public: ScrAddrObj(void) : scrAddr_(0), firstBlockNum_(0), firstTimestamp_(0), lastBlockNum_(0), lastTimestamp_(0), relevantTxIOPtrs_(0), ledger_(0) {} ScrAddrObj(BinaryData addr, uint32_t firstBlockNum = UINT32_MAX, uint32_t firstTimestamp = UINT32_MAX, uint32_t lastBlockNum = 0, uint32_t lastTimestamp = 0); BinaryData const & getScrAddr(void) const {return scrAddr_; } uint32_t getFirstBlockNum(void) const {return firstBlockNum_; } uint32_t getFirstTimestamp(void) const {return firstTimestamp_;} uint32_t getLastBlockNum(void) {return lastBlockNum_; } uint32_t getLastTimestamp(void) {return lastTimestamp_; } void setFirstBlockNum(uint32_t b) { firstBlockNum_ = b; } void setFirstTimestamp(uint32_t t) { firstTimestamp_ = t; } void setLastBlockNum(uint32_t b) { lastBlockNum_ = b; } void setLastTimestamp(uint32_t t) { lastTimestamp_ = t; } void setScrAddr(BinaryData bd) { scrAddr_.copyFrom(bd);} void sortLedger(void); uint32_t removeInvalidEntries(void); // BlkNum is necessary for "unconfirmed" list, since it is dependent // on number of confirmations. But for "spendable" TxOut list, it is // only a convenience, if you want to be able to calculate numConf from // the Utxos in the list. If you don't care (i.e. you only want to // know what TxOuts are available to spend, you can pass in 0 for currBlk uint64_t getFullBalance(void); uint64_t getSpendableBalance(uint32_t currBlk=0, bool ignoreAllZeroConf=false); uint64_t getUnconfirmedBalance(uint32_t currBlk, bool includeAllZeroConf=false); vector getFullTxOutList(uint32_t currBlk=0); vector getSpendableTxOutList(uint32_t currBlk=0, bool ignoreAllZeroConf=false); void clearZeroConfPool(void); vector & getTxLedger(void) { return ledger_; } vector & getZeroConfLedger(void) { return ledgerZC_; } vector & getTxIOList(void) { return relevantTxIOPtrs_; } void addTxIO(TxIOPair * txio, bool isZeroConf=false); void addTxIO(TxIOPair & txio, bool isZeroConf=false); void addLedgerEntry(LedgerEntry const & le, bool isZeroConf=false); void pprintLedger(void); void clearBlkData(void); private: BinaryData scrAddr_; // this includes the prefix byte! uint32_t firstBlockNum_; uint32_t firstTimestamp_; uint32_t lastBlockNum_; uint32_t lastTimestamp_; // If any multisig scripts that include this address, we'll track them bool hasMultisigEntries_; // Each address will store a list of pointers to its transactions vector relevantTxIOPtrs_; vector relevantTxIOPtrsZC_; vector ledger_; vector ledgerZC_; // Used to be part of the RegisteredScrAddr class uint32_t alreadyScannedUpToBlk_; }; //////////////////////////////////////////////////////////////////////////////// // // BtcWallet // //////////////////////////////////////////////////////////////////////////////// class BtcWallet { public: BtcWallet(void) : bdmPtr_(NULL), lastScanned_(0), ignoreLastScanned_(true) {} explicit BtcWallet(BlockDataManager_LevelDB* bdm) : bdmPtr_(bdm) {} ~BtcWallet(void); ///////////////////////////////////////////////////////////////////////////// // addScrAddr when blockchain rescan req'd, addNewScrAddr for just-created void addNewScrAddress(BinaryData addr); void addScrAddress(ScrAddrObj const & newAddr); void addScrAddress(BinaryData addr, uint32_t firstTimestamp = 0, uint32_t firstBlockNum = 0, uint32_t lastTimestamp = 0, uint32_t lastBlockNum = 0); // SWIG has some serious problems with typemaps and variable arg lists // Here I just create some extra functions that sidestep all the problems // but it would be nice to figure out "typemap typecheck" in SWIG... void addScrAddress_ScrAddrObj_(ScrAddrObj const & newAddr); // Adds a new address that is assumed to be imported, and thus will // require a blockchain scan void addScrAddress_1_(BinaryData addr); // Adds a new address that we claim has never been seen until thos moment, // and thus there's no point in doing a blockchain rescan. void addNewScrAddress_1_(BinaryData addr) {addNewScrAddress(addr);} // Blockchain rescan will depend on the firstBlockNum input void addScrAddress_3_(BinaryData addr, uint32_t firstTimestamp, uint32_t firstBlockNum); // Blockchain rescan will depend on the firstBlockNum input void addScrAddress_5_(BinaryData addr, uint32_t firstTimestamp, uint32_t firstBlockNum, uint32_t lastTimestamp, uint32_t lastBlockNum); // Why did we not just name this "hasScrAddr" like everything else? bool hasScrAddress(BinaryData const & scrAddr) const; // Scan a Tx for our TxIns/TxOuts. Override default blk vals if you think // you will save time by not checking addresses that are much newer than // the block pair isMineBulkFilter( Tx & tx, bool withMultiSig=false) const; pair isMineBulkFilter( Tx & tx, map const & txiomap, bool withMultiSig=false) const; void scanTx(Tx & tx, uint32_t txIndex = UINT32_MAX, uint32_t blktime = UINT32_MAX, uint32_t blknum = UINT32_MAX, bool mainwallet = true); void scanNonStdTx(uint32_t blknum, uint32_t txidx, Tx & txref, uint32_t txoutidx, ScrAddrObj& addr); LedgerEntry calcLedgerEntryForTx(Tx & tx); LedgerEntry calcLedgerEntryForTx(TxRef & txref); LedgerEntry calcLedgerEntryForTxStr(BinaryData txStr); // BlkNum is necessary for "unconfirmed" list, since it is dependent // on number of confirmations. But for "spendable" TxOut list, it is // only a convenience, if you want to be able to calculate numConf from // the Utxos in the list. If you don't care (i.e. you only want to // know what TxOuts are available to spend, you can pass in 0 for currBlk uint64_t getFullBalance(void); uint64_t getSpendableBalance(uint32_t currBlk=0, bool ignoreAllZeroConf=false); uint64_t getUnconfirmedBalance(uint32_t currBlk, bool includeAllZeroConf=false); vector getFullTxOutList(uint32_t currBlk=0); vector getSpendableTxOutList(uint32_t currBlk=0, bool ignoreAllZeroConf=false); void clearZeroConfPool(void); uint32_t getNumScrAddr(void) const {return scrAddrMap_.size();} ScrAddrObj & getScrAddrObjByIndex(uint32_t i) { return *(scrAddrPtrs_[i]); } ScrAddrObj & getScrAddrObjByKey(BinaryData const & a) { return scrAddrMap_[a];} void sortLedger(void); uint32_t removeInvalidEntries(void); vector & getZeroConfLedger(BinaryData const * scrAddr=NULL); vector & getTxLedger(BinaryData const * scrAddr=NULL); map & getTxIOMap(void) {return txioMap_;} map & getNonStdTxIO(void) {return nonStdTxioMap_;} vector & getTxLedgerForComments(void) { return txLedgerForComments_; } bool isOutPointMine(BinaryData const & hsh, uint32_t idx); void pprintLedger(void); void pprintAlot(uint32_t topBlk=0, bool withAddr=false); void setBdmPtr(BlockDataManager_LevelDB * bdmptr) {bdmPtr_=bdmptr;} void clearBlkData(void); vector createAddressBook(void); vector & getEmptyLedger(void) { EmptyLedger_.clear(); return EmptyLedger_;} void reorgChangeBlkNum(uint32_t newBlkHgt); uint32_t lastScanned_; bool ignoreLastScanned_; private: vector scrAddrPtrs_; map scrAddrMap_; map txioMap_; vector ledgerAllAddr_; vector ledgerAllAddrZC_; // Work around for address comments populating until 1:1 wallets are adopted vector txLedgerForComments_; // For non-std transactions map nonStdTxioMap_; set nonStdUnspentOutPoints_; BlockDataManager_LevelDB* bdmPtr_; static vector EmptyLedger_; // just a null-reference object }; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// struct ZeroConfData { Tx txobj_; uint32_t txtime_; list::iterator iter_; }; /* This class accumulates changes to write to the database, and will do so when it gets to a certain threshold */ class BlockWriteBatcher { public: static const uint64_t UPDATE_BYTES_THRESH = 96*1024*1024; BlockWriteBatcher(InterfaceToLDB* iface); ~BlockWriteBatcher(); void applyBlockToDB(StoredHeader &sbh); void applyBlockToDB(uint32_t hgt, uint8_t dup) { StoredHeader sbh; iface_->getStoredHeader(sbh, hgt, dup); applyBlockToDB(sbh); } void undoBlockFromDB(StoredUndoData &sud); private: // We have accumulated enough data, actually write it to the db void commit(); // search for entries in sshToModify_ that are empty and should // be deleted, removing those empty ones from sshToModify set searchForSSHKeysToDelete(); bool applyTxToBatchWriteData( StoredTx & thisSTX, StoredUndoData * sud); private: InterfaceToLDB* const iface_; // turn off batches by setting this to 0 uint64_t dbUpdateSize_; map stxToModify_; map sshToModify_; // (theoretically) incremented for each // applyBlockToDB and decremented for each // undoBlockFromDB uint32_t mostRecentBlockApplied_; }; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // // This class is a singleton -- there can only ever be one, accessed through // the static method GetInstance(). This method gets the single instantiation // of the BDM class, and then its public members can be used to access the // block data that is sitting in memory. // //////////////////////////////////////////////////////////////////////////////// // // BlockDataManager is a SINGLETON: only one is ever created. // // Access it via BlockDataManager_LevelDB::GetInstance(); // //////////////////////////////////////////////////////////////////////////////// class BlockDataManager_LevelDB { private: bool checkLdbStatus(leveldb::Status stat); map headerMap_; // This is our permanent link to the two databases used static InterfaceToLDB* iface_; // Need a separate memory pool just for zero-confirmation transactions // We need the second map to make sure we can find the data to remove // it, when necessary list zeroConfRawTxList_; map zeroConfMap_; bool zcEnabled_; bool zcLiteMode_; string zcFilename_; // This is for detecting external changes made to the blk0001.dat file bool isNetParamsSet_; bool isBlkParamsSet_; bool isLevelDBSet_; string armoryHomeDir_; string leveldbDir_; string blkFileDir_; vector blkFileList_; vector blkFileSizes_; // bytes before this blk vector blkFileCumul_; uint32_t numBlkFiles_; uint64_t endOfLastBlockByte_; // These files are for signaling to python code, which had to be hacked // in order to work while TheBDM is scanning string blkProgressFile_; string abortLoadFile_; uint32_t progressTimer_; // On DB initialization, we start processing here uint32_t startHeaderHgt_; uint32_t startRawBlkHgt_; uint32_t startScanHgt_; uint32_t startApplyHgt_; // The following blkfile and offsets correspond to the above heights uint32_t startHeaderBlkFile_; uint64_t startHeaderOffset_; uint32_t startRawBlkFile_; uint64_t startRawOffset_; uint32_t startScanBlkFile_; uint64_t startScanOffset_; uint32_t startApplyBlkFile_; uint64_t startApplyOffset_; // Used to estimate how much data is queued to be written to DB bool requestRescan_; // These should be set after the blockchain is organized deque headersByHeight_; BlockHeader* topBlockPtr_; BlockHeader* genBlockPtr_; uint32_t lastTopBlock_; // Reorganization details bool lastBlockWasReorg_; BlockHeader* reorgBranchPoint_; BlockHeader* prevTopBlockPtr_; set txJustInvalidated_; set txJustAffected_; bool corruptHeadersDB_; // Store info on orphan chains vector previouslyValidBlockHeaderPtrs_; vector orphanChainStartBlocks_; static BlockDataManager_LevelDB* theOnlyBDM_; static bool bdmCreatedYet_; bool isInitialized_; uint32_t lastScannedBlock_; // These will be set for the specific network we are testing BinaryData GenesisHash_; BinaryData GenesisTxHash_; BinaryData MagicBytes_; // Variables that will be updated as the blockchain loads: // can be used to report load progress uint64_t totalBlockchainBytes_; uint64_t bytesReadSoFar_; uint32_t blocksReadSoFar_; uint16_t filesReadSoFar_; // If the BDM is not in super-node mode, then it will be specifically tracking // a set of addresses & wallets. We register those addresses and wallets so // that we know what TxOuts to track as we process blockchain data. And when // it may be necessary to do rescans. // // If instead we ARE in ARMORY_DB_SUPER (not implemented yet, as of this // comment being written), then we don't have anything to track -- the DB // will automatically update for all addresses, period. And we'd best not // track those in RAM (maybe on a huge server...?) set registeredWallets_; map registeredScrAddrMap_; list registeredTxList_; set registeredTxSet_; set registeredOutPoints_; uint32_t allScannedUpToBlk_; // one past top // list of block headers that appear to be missing // when scanned by buildAndScanDatabases vector missingBlockHeaderHashes_; // list of blocks whose contents are invalid but we have // their headers vector missingBlockHashes_; // TODO: We eventually want to maintain some kind of master TxIO map, instead // of storing them in the individual wallets. With the new DB, it makes more // sense to do this, and it will become easier to compute total balance when // multiple wallets share the same addresses //map txioMap_; private: // Set the constructor to private so that only one can ever be created BlockDataManager_LevelDB(void); ~BlockDataManager_LevelDB(void); public: static BlockDataManager_LevelDB & GetInstance(void); static void DestroyInstance(void); bool isInitialized(void) const { return isInitialized_;} void SetDatabaseModes(ARMORY_DB_TYPE atype, DB_PRUNE_TYPE dtype) { DBUtils.setArmoryDbType(atype); DBUtils.setDbPruneType(dtype);} void SetDatabaseModes(int atype, int dtype) { DBUtils.setArmoryDbType((ARMORY_DB_TYPE)atype); DBUtils.setDbPruneType((DB_PRUNE_TYPE)dtype);} void SelectNetwork(string netName); void SetHomeDirLocation(string homeDir); bool SetBlkFileLocation(string blkdir); void SetLevelDBLocation(string ldbdir); void SetBtcNetworkParams( BinaryData const & GenHash, BinaryData const & GenTxHash, BinaryData const & MagicBytes); void SetRescanNextLoad(bool b=true) { requestRescan_=b; } ////////////////////////////////////////////////////////////////////////// // This method opens the databases, and figures out up to what block each // of them is sync'd to. Then it figures out where that corresponds in // the blk*.dat files, so that it can pick up where it left off. You can // use the last argument to specify an approximate amount of blocks // (specified in bytes) that you would like to replay: i.e. if 10 MB, // lastBlkFileNum_ and endOfLastBlockByte_ variables will be set to // the first block that is approximately 10 MB behind your latest block. // Then you can pick up from there and let the DB clean up any mess that // was left from an unclean shutdown. bool initializeDBInterface(ARMORY_DB_TYPE dbt = ARMORY_DB_WHATEVER, DB_PRUNE_TYPE prt = DB_PRUNE_WHATEVER); // This figures out where we should start loading headers/rawblocks/scanning // The replay argument has been temporarily disable since it's not currently // being used, and was causing problems instead. bool detectCurrentSyncState(bool rebuild, bool initialLoad); ///////////////////////////////////////////////////////////////////////////// // Get the parameters of the network as they've been set BinaryData getGenesisHash(void) { return GenesisHash_; } BinaryData getGenesisTxHash(void) { return GenesisTxHash_; } BinaryData getMagicBytes(void) { return MagicBytes_; } ///////////////////////////////////////////////////////////////////////////// // These don't actually work while scanning in another thread!? // The getLoadProgress* methods don't seem to update until after scan done uint64_t getTotalBlockchainBytes(void) const {return totalBlockchainBytes_;} uint32_t getTotalBlkFiles(void) const {return numBlkFiles_;} uint64_t getLoadProgressBytes(void) const {return bytesReadSoFar_;} uint32_t getLoadProgressBlocks(void) const {return blocksReadSoFar_;} uint16_t getLoadProgressFiles(void) const {return filesReadSoFar_;} uint32_t getTopBlockHeightInDB(DB_SELECT db); uint32_t getAppliedToHeightInDB(void); vector getFirstHashOfEachBlkFile(void) const; uint32_t findOffsetFirstUnrecognized(uint32_t fnum); uint32_t findFirstBlkApproxOffset(uint32_t fnum, uint32_t offset) const; uint32_t findFirstUnappliedBlock(void); pair findFileAndOffsetForHgt( uint32_t hgt, vector* firstHashOfEachBlkFile=NULL); ///////////////////////////////////////////////////////////////////////////// void Reset(void); int32_t getNumConfirmations(BinaryData txHash); BlockHeader & getTopBlockHeader(void); BlockHeader & getGenesisBlock(void) ; BlockHeader * getHeaderByHeight(int index); BlockHeader * getHeaderByHash(BinaryData const & blkHash); string getBlockfilePath(void) {return blkFileDir_;} TxRef getTxRefByHash(BinaryData const & txHash); Tx getTxByHash(BinaryData const & txHash); uint32_t getTopBlockHeight(void) {return getTopBlockHeader().getBlockHeight();} BinaryData getTopBlockHash(void) {return getTopBlockHeader().getThisHash();} bool isDirty(uint32_t numBlockToBeConsideredDirty=NUM_BLKS_IS_DIRTY) const; //uint32_t getNumTx(void) { return txHintMap_.size(); } uint32_t getNumHeaders(void) { return headerMap_.size(); } ///////////////////////////////////////////////////////////////////////////// // If you register you wallet with the BDM, it will automatically maintain // tx lists relevant to that wallet. You can get away without registering // your wallet objects (using scanBlockchainForTx), but without the full // blockchain in RAM, each scan will take 30-120 seconds. Registering makes // sure that the intial blockchain scan picks up wallet-relevant stuff as // it goes, and does a full [re-]scan of the blockchain only if necessary. bool registerWallet(BtcWallet* wallet, bool wltIsNew=false); void unregisterWallet(BtcWallet* wlt) {registeredWallets_.erase(wlt);} bool registerScrAddr(BinaryData scraddr, bool isNew, uint32_t blk0); bool registerNewScrAddr(BinaryData scraddr); bool registerImportedScrAddr(BinaryData scrAddr, uint32_t createBlk=0); bool unregisterScrAddr(BinaryData scrAddr); uint32_t evalLowestBlockNextScan(void); uint32_t evalLowestScrAddrCreationBlock(void); bool evalRescanIsRequired(void); uint32_t numBlocksToRescan(BtcWallet & wlt, uint32_t topBlk=UINT32_MAX); void updateRegisteredScrAddrs(uint32_t newTopBlk); bool walletIsRegistered(BtcWallet & wlt); bool scrAddrIsRegistered(BinaryData scrAddr); void insertRegisteredTxIfNew(HashString txHash); void insertRegisteredTxIfNew(RegisteredTx & regTx); void insertRegisteredTxIfNew(TxRef const & txref, BinaryDataRef txHash, uint32_t hgt, uint16_t txIndex); bool removeRegisteredTx(BinaryData const & txHash); void registeredScrAddrScan( Tx & theTx ); void registeredScrAddrScan( uint8_t const * txptr, uint32_t txSize=0, vector * txInOffsets=NULL, vector * txOutOffsets=NULL, bool withSecondOrderMultisig=true); void registeredScrAddrScan_IterSafe( StoredTx & stx, vector * txInOffsets=NULL, vector * txOutOffsets=NULL, bool withSecondOrderMultisig=true); void resetRegisteredWallets(void); void pprintRegisteredWallets(void); BtcWallet* createNewWallet(void); // Parsing requires the data TO ALREADY BE IN ITS PERMANENT MEMORY LOCATION // Pass in a wallet if you want to update the initialScanTxHashes_/OutPoints_ //bool parseNewBlock(BinaryRefReader & rawBlockDataReader, //uint32_t fileIndex, //uint32_t thisHeaderOffset, //uint32_t blockSize); // // These are the high-level methods for reading block files, and indexing // the blockfile data. bool extractHeadersInBlkFile(uint32_t fnum, uint64_t offset=0); uint32_t detectAllBlkFiles(void); bool processNewHeadersInBlkFiles(uint32_t fnumStart=0, uint64_t offset=0); //bool processHeadersInFile(string filename); void destroyAndResetDatabases(void); void buildAndScanDatabases(bool forceRescan=false, bool forceRebuild=false, bool skipFetch=false, bool initialLoad=false); bool scanForMagicBytes(BinaryStreamBuffer& bsb, uint32_t *bytesSkipped=0) const; void readRawBlocksInFile(uint32_t blkFileNum, uint32_t offset); // These are wrappers around "buildAndScanDatabases" void doRebuildDatabases(void); void doFullRescanRegardlessOfSync(void); void doSyncIfNeeded(void); void doInitialSyncOnLoad(void); void doInitialSyncOnLoad_Rescan(void); void doInitialSyncOnLoad_Rebuild(void); void addRawBlockToDB(BinaryRefReader & brr); void applyBlockRangeToDB(uint32_t blk0=0, uint32_t blk1=UINT32_MAX); // When we reorg, we have to undo blocks that have been applied. bool createUndoDataFromBlock(uint32_t hgt, uint8_t dup, StoredUndoData & sud); // When we add new block data, we will need to store/copy it to its // permanent memory location before parsing it. // These methods return (blockAddSucceeded, newBlockIsTop, didCauseReorg) uint32_t readBlkFileUpdate(void); vector addNewBlockData(BinaryRefReader & brrRawBlock, uint32_t fileIndex0Idx, uint32_t thisHeaderOffset, uint32_t blockSize); void reassessAfterReorg(BlockHeader* oldTopPtr, BlockHeader* newTopPtr, BlockHeader* branchPtr ); void deleteHistories(void); void saveScrAddrHistories(void); void fetchAllRegisteredScrAddrData(void); void fetchAllRegisteredScrAddrData(BtcWallet & myWlt); void fetchAllRegisteredScrAddrData( map & addrMap); void fetchAllRegisteredScrAddrData(BinaryData const & scrAddr); // Check for availability of data with a given hash TX_AVAILABILITY getTxHashAvail(BinaryDataRef txhash); bool hasTxWithHash(BinaryData const & txhash); bool hasTxWithHashInDB(BinaryData const & txhash); bool hasHeaderWithHash(BinaryData const & headHash) const; uint32_t getNumBlocks(void) const { return headerMap_.size(); } //uint32_t getNumTx(void) const { return txHintMap_.size(); } StoredHeader getMainBlockFromDB(uint32_t hgt); uint8_t getMainDupFromDB(uint32_t hgt); StoredHeader getBlockFromDB(uint32_t hgt, uint8_t dup); vector getHeadersNotOnMainChain(void); bool addHeadersFirst(BinaryDataRef rawHeader); bool addHeadersFirst(vector const & headVect); // Traverse the blockchain and update the wallet[s] with the relevant Tx data // See comments above the scanBlockchainForTx in the .cpp, for more info // NOTE: THIS ASSUMES THAT registeredTxSet_/List_ is already populated! void scanBlockchainForTx(BtcWallet & myWallet, uint32_t startBlknum=0, uint32_t endBlknum=UINT32_MAX, bool fetchFirst=true); void writeProgressFile(DB_BUILD_PHASE phase, string bfile, string timerName); // This will only be used by the above method, probably wouldn't be called // directly from any other code void scanRegisteredTxForWallet( BtcWallet & wlt, uint32_t blkStart=0, uint32_t blkEnd=UINT32_MAX); void scanDBForRegisteredTx(uint32_t blk0=0, uint32_t blk1=UINT32_MAX); ///////////////////////////////////////////////////////////////////////////// // With the blockchain in supernode mode, we can just query address balances // and UTXO sets directly. These will fail if not supernode mode uint64_t getDBBalanceForHash160(BinaryDataRef addr160); uint64_t getDBReceivedForHash160(BinaryDataRef addr160); vector getUTXOVectForHash160(BinaryDataRef addr160); vector getHistoryForScrAddr(BinaryDataRef uniqKey, bool withMultiSig=false); // For zero-confirmation tx-handling void enableZeroConf(string filename, bool zcLite=true); void disableZeroConf(void); void readZeroConfFile(string filename); bool addNewZeroConfTx(BinaryData const & rawTx, uint32_t txtime, bool writeToFile); void purgeZeroConfPool(void); void pprintZeroConfPool(void); void rewriteZeroConfFile(void); void rescanWalletZeroConf(BtcWallet & wlt); bool isTxFinal(Tx & tx); // After reading in all headers, find the longest chain and set nextHash vals // TODO: Figure out if there is an elegant way to deal with a forked // blockchain containing two equal-length chains bool organizeChain(bool forceRebuild=false); ///////////////////////////////////////////////////////////////////////////// bool isLastBlockReorg(void) {return lastBlockWasReorg_;} set getTxJustInvalidated(void) {return txJustInvalidated_;} set getTxJustAffected(void) {return txJustAffected_;} void updateWalletAfterReorg(BtcWallet & wlt); void updateWalletsAfterReorg(vector wltvect); void updateWalletsAfterReorg(set wltset); // Use these two methods to get ALL information about your unused TxOuts //vector getUnspentTxOutsForWallet(BtcWallet & wlt, int sortType=-1); //vector getNonStdUnspentTxOutsForWallet(BtcWallet & wlt); //////////////////////////////////////////////////////////////////////////////// // We're going to need the BDM's help to get the sender for a TxIn since it // sometimes requires going and finding the TxOut from the distant past TxOut getPrevTxOut(TxIn & txin); Tx getPrevTx(TxIn & txin); BinaryData getSenderScrAddr(TxIn & txin); int64_t getSentValue(TxIn & txin); ///////////////////////////////////////////////////////////////////////////// // We used to have a method in TxRef class to do this, because all TxRefs // had pointers to their parent header object. Now, TxRefs are much more // isolated, so we have to ask the BDM to help us find the correct header // (which is considerably easier with the DB design that indexes everything // by block height... BlockHeader* getHeaderPtrForTxRef(TxRef txr); BlockHeader* getHeaderPtrForTx(Tx & txObj); ///////////////////////////////////////////////////////////////////////////// // A couple random methods to expose internal data structures for testing. // These methods should not be used for nominal operation. //multimap & getTxHintMapRef(void) { return txHintMap_; } map & getHeaderMapRef(void) { return headerMap_; } deque & getHeadersByHeightRef(void) { return headersByHeight_;} // These things should probably be private, but they also need to be test-able, // and googletest apparently cannot access private methods without polluting // this class with gtest code //private: void pprintSSHInfoAboutHash160(BinaryData const & a160); ///////////////////////////////////////////////////////////////////////////// // Update/organize the headers map (figure out longest chain, mark orphans) // Start from a node, trace down to the highest solved block, accumulate // difficulties and difficultySum values. Return the difficultySum of // this block. double traceChainDown(BlockHeader & bhpStart); void markOrphanChain(BlockHeader & bhpStart); ///////////////////////////////////////////////////////////////////////////// void setMaxOpenFiles(uint32_t n) {iface_->setMaxOpenFiles(n);} uint32_t getMaxOpenFiles(void) {return iface_->getMaxOpenFiles();} void setLdbBlockSize(uint32_t sz){iface_->setLdbBlockSize(sz);} uint32_t getLdbBlockSize(void) {return iface_->getLdbBlockSize();} // Simple wrapper around the logger so that they are easy to access from SWIG void StartCppLogging(string fname, int lvl) { STARTLOGGING(fname, (LogLevel)lvl); } void ChangeCppLogLevel(int lvl) { SETLOGLEVEL((LogLevel)lvl); } void DisableCppLogging(void) { SETLOGLEVEL(LogLvlDisabled); } void EnableCppLogStdOut(void) { LOGENABLESTDOUT(); } void DisableCppLogStdOut(void) { LOGDISABLESTDOUT(); } //////////////////////////////////////////////////////////////////////////////// void debugPrintDatabases(void) { iface_->pprintBlkDataDB(BLKDATA); } ///////////////////////////////////////////////////////////////////////////// // We may use this to trigger flushing the queued DB updates //bool estimateDBUpdateSize( //map & stxToModify, //map & sshToModify); vector missingBlockHeaderHashes() const { return missingBlockHeaderHashes_; } vector missingBlockHashes() const { return missingBlockHashes_; } }; //////////////////////////////////////////////////////////////////////////////// // // We have a problem with "classic" swig refusing to compile static functions, // which gives me no way to access BDM which is a singleton class accessed by // a static class method. This class simply wraps the call to be invoked in // python/swig // //////////////////////////////////////////////////////////////////////////////// class BlockDataManager { public: BlockDataManager(void) { bdm_ = &(BlockDataManager_LevelDB::GetInstance());} BlockDataManager_LevelDB & getBDM(void) { return *bdm_; } void DestroyBDM(void) { BlockDataManager_LevelDB::DestroyInstance(); bdm_ = &(BlockDataManager_LevelDB::GetInstance()); } private: BlockDataManager_LevelDB* bdm_; }; // kate: indent-width 3; replace-tabs on; #endif armory-0.92.3/cppForSwig/get_distro.sh0000755000000000000000000000036112414772654016415 0ustar rootroot#! /bin/bash distro=`uname -v | grep -oi 'debian'` if [ ${distro,,} = "debian" ]; then echo ${distro,,} exit 1 else distro=`uname -v | grep -oi 'ubuntu'` if [ ${distro,,} = "debian" ]; then echo "debian" exit 1 fi fi echo "other" exit 0 armory-0.92.3/cppForSwig/UniversalTimer.cpp0000644000000000000000000001740012414772654017372 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// #include #include #include "UniversalTimer.h" using namespace std; //////////////////////////////////////////////////////////////////////////////// // START UhiversalTimer::timer methods //////////////////////////////////////////////////////////////////////////////// // START TIMER void UniversalTimer::timer::start(void) { if (isRunning_) return; isRunning_ = true; start_clock_ = clock(); start_time_ = time(0); } // RESTART TIMER void UniversalTimer::timer::restart(void) { isRunning_ = true; accum_time_ = 0; start_clock_ = clock(); start_time_ = time(0); } // STOP TIMER void UniversalTimer::timer::stop(void) { if (isRunning_) { time_t acc_sec = time(0) - start_time_; if (acc_sec < 3600) prev_elapsed_ = (clock() - start_clock_) / (1.0 * CLOCKS_PER_SEC); else prev_elapsed_ = (1.0 * acc_sec); accum_time_ += prev_elapsed_; } isRunning_ = false; } // STOP AND RESET TTMER void UniversalTimer::timer::reset(void) { isRunning_ = false; accum_time_ = 0; } // CALCULATE THE ELAPSED TIME BUT DON'T STOP TIMER double UniversalTimer::timer::read(void) { double accum = accum_time_; // if not running, this is correct if(isRunning_) { stop(); accum = accum_time_; start(); } return accum; } //////////////////////////////////////////////////////////////////////////////// // END UniversalTimer::timer methods //////////////////////////////////////////////////////////////////////////////// // A pointer to the sole instance of UniversalTimer UniversalTimer* UniversalTimer::theUT_ = NULL; // Get THE UniversalTimer —- only one ever exists UniversalTimer & UniversalTimer::instance(void) { if(theUT_ == NULL) theUT_ = new UniversalTimer; return *theUT_; } // Initialize a timer for the given string void UniversalTimer::init(string key, string grpstr) { string wholeKey = grpstr + key; if( call_timers_.find(wholeKey) == call_timers_.end() ) { call_timers_[wholeKey] = timer(); call_count_[wholeKey] = 0; call_group_[wholeKey] = grpstr; } } // Start a new or existing timer —— will accumulate time void UniversalTimer::start(string key, string grpstr) { most_recent_key_ = grpstr + key; init(key,grpstr); call_timers_[most_recent_key_].start(); call_count_[most_recent_key_]++; } // Start a new or existing timer —— will reset accumulated time to 0 void UniversalTimer::restart(string key, string grpstr) { most_recent_key_ = grpstr + key; init(key,grpstr); call_timers_[most_recent_key_].restart(); call_count_[most_recent_key_]++; } // Stops an existing timer, which can then be read out void UniversalTimer::stop(string key, string grpstr) { most_recent_key_ = grpstr + key; if( call_timers_.find(most_recent_key_) == call_timers_.end() ) { cout << "***WARNING: attempting to stop a timer not prev started" << endl; cout << " KEY: " << most_recent_key_ << endl; } init(key,grpstr); call_timers_[most_recent_key_].stop(); } // Stops an existing timer, which can then be read out ~ void UniversalTimer::reset(string key, string grpstr) { most_recent_key_ = grpstr + key; if( call_timers_.find(most_recent_key_) == call_timers_.end() ) { cout << "***WARNING: attempting to reset a timer not prev used" << endl; cout << " KEY: " << most_recent_key_ << endl; } init(key,grpstr); call_timers_[most_recent_key_].reset(); } // Get the value of the accumulated time on the given timer, IN SECONDS double UniversalTimer::read(string key, string grpstr) { most_recent_key_ = grpstr + key; init(key,grpstr); return call_timers_[most_recent_key_].read(); } // Print complete timing results to a file of this name void UniversalTimer::printCSV(string filename, bool excludeZeros) { ofstream os(OS_TranslatePath(filename.c_str()), ios::out); printCSV(os, excludeZeros); os.close(); } // Print complete timing results to a given output stream void UniversalTimer::printCSV(ostream & os, bool excludeZeros) { os << "Individual timings:" << endl << endl; os << ",NCall,Tot,Avg,Name" << endl << endl; map::iterator itert; map::iterator iteri; for(itert = call_timers_.begin(), iteri = call_count_.begin(); itert != call_timers_.end(); itert++, iteri++) { if(excludeZeros && itert->second.read() == 0) continue; os << "," << iteri->second; os << "," << itert->second.read(); os << "," << itert->second.read()/(double)(iteri->second); os << "," << itert->first; os << endl; } os << endl; os << "Group Timings" << endl << endl; // Accumulate the timings for everything with the same group map group_accum; map::iterator iters; for(itert = call_timers_.begin(), iters = call_group_.begin(); itert != call_timers_.end(); itert++, iters++) { group_accum[iters->second] += itert->second.read(); } // Now all timings have been accumulated for the individual groups map::iterator iterd; for(iterd = group_accum.begin(); iterd != group_accum.end(); iterd++) { if(iterd->first.length() == 0) continue; os << ","; // no counting here os << "," << iterd->second; os << ","; // no count, so no avg os << "," << iterd->first; os << endl; } } // Print complete timing results to a file of this name void UniversalTimer::print(string filename, bool excludeZeros) { ofstream os(OS_TranslatePath(filename.c_str()), ios::out); print(os, excludeZeros); os.close(); } // Print complete timing results to a given output stream void UniversalTimer::print(ostream & os, bool excludeZeros) { os << "Individual timings:" << endl << endl; os << "\tNCall\tTot\tAvg\t\tName" << endl << endl; map::iterator itert; map::iterator iteri; for(itert = call_timers_.begin(), iteri = call_count_.begin(); itert != call_timers_.end(); itert++, iteri++) { if(excludeZeros && itert->second.read() == 0) continue; printf("\t%d\t%0.3f\t%g\t\t%s\n", iteri->second, itert->second.read(), itert->second.read()/(double)(iteri->second), itert->first.c_str()); } os << endl; os << "Group Timings" << endl << endl; // Accumulate the timings for everything with the same group map group_accum; map::iterator iters; for(itert = call_timers_.begin(), iters = call_group_.begin(); itert != call_timers_.end(); itert++, iters++) { group_accum[iters->second] += itert->second.read(); } // Now all timings have been accumulated for the individual groups map::iterator iterd; for(iterd = group_accum.begin(); iterd != group_accum.end(); iterd++) { if(iterd->first.length() == 0) continue; printf("\t%s\t%0.3f\t%s\t\t%s\n", string(" ").c_str(), iterd->second, string(" ").c_str(), iterd->first.c_str()); } } armory-0.92.3/cppForSwig/StoredBlockObj.h0000644000000000000000000006432012414772654016737 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// #ifndef _STORED_BLOCK_OBJ_ #define _STORED_BLOCK_OBJ_ #include #include #include #include "BinaryData.h" #include "BtcUtils.h" #include "BlockObj.h" #define ARMORY_DB_VERSION 0x00 #define ARMORY_DB_DEFAULT ARMORY_DB_FULL #define UTXO_STORAGE SCRIPT_UTXO_VECTOR enum BLKDATA_TYPE { NOT_BLKDATA, BLKDATA_HEADER, BLKDATA_TX, BLKDATA_TXOUT }; enum DB_PREFIX { DB_PREFIX_DBINFO, DB_PREFIX_HEADHASH, DB_PREFIX_HEADHGT, DB_PREFIX_TXDATA, DB_PREFIX_TXHINTS, DB_PREFIX_SCRIPT, DB_PREFIX_UNDODATA, DB_PREFIX_TRIENODES, DB_PREFIX_COUNT }; enum ARMORY_DB_TYPE { ARMORY_DB_BARE, // only raw block data ARMORY_DB_LITE, ARMORY_DB_PARTIAL, ARMORY_DB_FULL, ARMORY_DB_SUPER, ARMORY_DB_WHATEVER }; enum DB_PRUNE_TYPE { DB_PRUNE_ALL, DB_PRUNE_NONE, DB_PRUNE_WHATEVER }; // In ARMORY_DB_PARTIAL and LITE, we may not store full tx, but we will know // its block and index, so we can just request the full block from our peer. enum DB_TX_AVAIL { DB_TX_EXISTS, DB_TX_GETBLOCK, DB_TX_UNKNOWN }; enum DB_SELECT { HEADERS, BLKDATA, DB_COUNT }; enum TX_SERIALIZE_TYPE { TX_SER_FULL, TX_SER_FRAGGED, TX_SER_COUNTOUT }; enum TXOUT_SPENTNESS { TXOUT_UNSPENT, TXOUT_SPENT, TXOUT_SPENTUNK, }; enum MERKLE_SER_TYPE { MERKLE_SER_NONE, MERKLE_SER_PARTIAL, MERKLE_SER_FULL }; enum SCRIPT_UTXO_TYPE { SCRIPT_UTXO_VECTOR, SCRIPT_UTXO_TREE }; class BlockHeader; class Tx; class TxIn; class TxOut; class TxRef; class TxIOPair; class StoredTx; class StoredTxOut; class StoredScriptHistory; class StoredSubHistory; #define DBUtils GlobalDBUtilities::GetInstance() //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // Basically making stuff globally accessible through DBUtils singleton //////////////////////////////////////////////////////////////////////////////// class GlobalDBUtilities { public: static uint32_t hgtxToHeight(const BinaryData& hgtx); static uint8_t hgtxToDupID(const BinaryData& hgtx); static BinaryData heightAndDupToHgtx(uint32_t hgt, uint8_t dup); ///////////////////////////////////////////////////////////////////////////// static BinaryData getBlkDataKey(uint32_t height, uint8_t dup); ///////////////////////////////////////////////////////////////////////////// static BinaryData getBlkDataKey(uint32_t height, uint8_t dup, uint16_t txIdx); ///////////////////////////////////////////////////////////////////////////// static BinaryData getBlkDataKey(uint32_t height, uint8_t dup, uint16_t txIdx, uint16_t txOutIdx); ///////////////////////////////////////////////////////////////////////////// static BinaryData getBlkDataKeyNoPrefix(uint32_t height, uint8_t dup); ///////////////////////////////////////////////////////////////////////////// static BinaryData getBlkDataKeyNoPrefix(uint32_t height, uint8_t dup, uint16_t txIdx); ///////////////////////////////////////////////////////////////////////////// static BinaryData getBlkDataKeyNoPrefix(uint32_t height, uint8_t dup, uint16_t txIdx, uint16_t txOutIdx); ///////////////////////////////////////////////////////////////////////////// static BLKDATA_TYPE readBlkDataKey( BinaryRefReader & brr, uint32_t & height, uint8_t & dupID); ///////////////////////////////////////////////////////////////////////////// static BLKDATA_TYPE readBlkDataKey( BinaryRefReader & brr, uint32_t & height, uint8_t & dupID, uint16_t & txIdx); ///////////////////////////////////////////////////////////////////////////// static BLKDATA_TYPE readBlkDataKey( BinaryRefReader & brr, uint32_t & height, uint8_t & dupID, uint16_t & txIdx, uint16_t & txOutIdx); ///////////////////////////////////////////////////////////////////////////// static BLKDATA_TYPE readBlkDataKeyNoPrefix( BinaryRefReader & brr, uint32_t & height, uint8_t & dupID); ///////////////////////////////////////////////////////////////////////////// static BLKDATA_TYPE readBlkDataKeyNoPrefix( BinaryRefReader & brr, uint32_t & height, uint8_t & dupID, uint16_t & txIdx); ///////////////////////////////////////////////////////////////////////////// static BLKDATA_TYPE readBlkDataKeyNoPrefix( BinaryRefReader & brr, uint32_t & height, uint8_t & dupID, uint16_t & txIdx, uint16_t & txOutIdx); static string getPrefixName(uint8_t prefixInt); static string getPrefixName(DB_PREFIX pref); static bool checkPrefixByte( BinaryRefReader & brr, DB_PREFIX prefix, bool rewindWhenDone=false); static bool checkPrefixByteWError( BinaryRefReader & brr, DB_PREFIX prefix, bool rewindWhenDone=false); static void setArmoryDbType(ARMORY_DB_TYPE adt) { armoryDbType_ = adt; } static void setDbPruneType( DB_PRUNE_TYPE dpt) { dbPruneType_ = dpt; } static ARMORY_DB_TYPE getArmoryDbType(void) { return armoryDbType_; } static DB_PRUNE_TYPE getDbPruneType(void) { return dbPruneType_; } static GlobalDBUtilities& GetInstance(void) { if(theOneUtilsObj_==NULL) { theOneUtilsObj_ = new GlobalDBUtilities; // Default database structure theOneUtilsObj_->setArmoryDbType(ARMORY_DB_FULL); theOneUtilsObj_->setDbPruneType(DB_PRUNE_NONE); } return (*theOneUtilsObj_); } private: GlobalDBUtilities(void) {} static GlobalDBUtilities* theOneUtilsObj_; static DB_PRUNE_TYPE dbPruneType_; static ARMORY_DB_TYPE armoryDbType_; }; //////////////////////////////////////////////////////////////////////////////// class StoredDBInfo { public: StoredDBInfo(void) : magic_(0), topBlkHgt_(0), topBlkHash_(0), appliedToHgt_(0), armoryVer_(ARMORY_DB_VERSION), armoryType_(DBUtils.getArmoryDbType()), pruneType_(DBUtils.getDbPruneType()) {} bool isInitialized(void) const { return magic_.getSize() > 0; } bool isNull(void) { return !isInitialized(); } static BinaryData getDBKey(void); void unserializeDBValue(BinaryRefReader & brr); void serializeDBValue(BinaryWriter & bw ) const; void unserializeDBValue(BinaryData const & bd); void unserializeDBValue(BinaryDataRef bd); BinaryData serializeDBValue(void) const; void unserializeDBKey(BinaryDataRef key) {} void pprintOneLine(uint32_t indent=3); BinaryData magic_; uint32_t topBlkHgt_; BinaryData topBlkHash_; uint32_t appliedToHgt_; // only used in BLKDATA DB uint32_t armoryVer_; ARMORY_DB_TYPE armoryType_; DB_PRUNE_TYPE pruneType_; }; //////////////////////////////////////////////////////////////////////////////// class StoredHeader { public: StoredHeader(void) : dataCopy_(0), thisHash_(0), numTx_(UINT32_MAX), numBytes_(UINT32_MAX), blockHeight_(UINT32_MAX), duplicateID_(UINT8_MAX), merkle_(0), isMainBranch_(false), blockAppliedToDB_(false), merkleIsPartial_(false), hasBlockHeader_(false) {} bool isInitialized(void) const {return dataCopy_.getSize() > 0;} bool isNull(void) const {return !isInitialized(); } bool haveFullBlock(void) const; BlockHeader getBlockHeaderCopy(void) const; BinaryData getSerializedBlock(void) const; BinaryData getSerializedBlockHeader(void) const; void createFromBlockHeader(BlockHeader & bh); uint32_t getNumTx() { return (isNull() ? 0 : numTx_); } Tx getTxCopy(uint16_t i); BinaryData getSerializedTx(uint16_t i); void addTxToMap(uint16_t txIdx, Tx & tx); void addStoredTxToMap(uint16_t txIdx, StoredTx & tx); void setKeyData(uint32_t hgt, uint8_t dupID=UINT8_MAX); void setHeightAndDup(uint32_t hgt, uint8_t dupID); void setHeightAndDup(BinaryData hgtx); void unserialize(BinaryData const & header80B); void unserialize(BinaryDataRef header80B); void unserialize(BinaryRefReader brr); void unserializeFullBlock(BinaryDataRef block, bool doFrag=true, bool withPrefix8=false); void unserializeFullBlock(BinaryRefReader brr, bool doFrag=true, bool withPrefix8=false); bool serializeFullBlock( BinaryWriter & bw) const; void unserializeDBValue( DB_SELECT db, BinaryRefReader & brr, bool ignoreMerkle = false); void serializeDBValue( DB_SELECT db, BinaryWriter & bw) const; void unserializeDBValue(DB_SELECT db, BinaryData const & bd, bool ignMrkl=false); void unserializeDBValue(DB_SELECT db, BinaryDataRef bdr, bool ignMrkl=false); BinaryData serializeDBValue(DB_SELECT db) const; void unserializeDBKey(DB_SELECT db, BinaryDataRef key); BinaryData getDBKey(bool withPrefix=true) const; bool isMerkleCreated(void) { return (merkle_.getSize() != 0);} void pprintOneLine(uint32_t indent=3); void pprintFullBlock(uint32_t indent=3); BinaryData dataCopy_; BinaryData thisHash_; uint32_t numTx_; uint32_t numBytes_; uint32_t blockHeight_; uint8_t duplicateID_; BinaryData merkle_; bool merkleIsPartial_; bool isMainBranch_; bool blockAppliedToDB_; bool isPartial_; map stxMap_; // We don't actually enforce these members. They're solely for recording // the values that were unserialized with everything else, so that we can // leter check that DB data matches what we were expecting uint32_t unserArmVer_; uint32_t unserBlkVer_; ARMORY_DB_TYPE unserDbType_; DB_PRUNE_TYPE unserPrType_; MERKLE_SER_TYPE unserMkType_; bool hasBlockHeader_; }; //////////////////////////////////////////////////////////////////////////////// class StoredTx { public: StoredTx(void) : thisHash_(0), dataCopy_(0), blockHeight_(UINT32_MAX), duplicateID_(UINT8_MAX), txIndex_(UINT16_MAX), numTxOut_(UINT16_MAX), numBytes_(UINT32_MAX), fragBytes_(UINT32_MAX) {} bool isInitialized(void) const {return dataCopy_.getSize() > 0;} bool isNull(void) { return !isInitialized(); } bool haveAllTxOut(void) const; StoredTx& createFromTx(Tx & tx, bool doFrag=true, bool withTxOuts=true); StoredTx & createFromTx(BinaryDataRef rawTx, bool doFrag=true, bool withTxOuts=true); BinaryData getSerializedTx(void) const; BinaryData getSerializedTxFragged(void) const; Tx getTxCopy(void) const; void setKeyData(uint32_t height, uint8_t dup, uint16_t txIdx); void addTxOutToMap(uint16_t idx, TxOut & txout); void addStoredTxOutToMap(uint16_t idx, StoredTxOut & txout); void unserialize(BinaryData const & data, bool isFragged=false); void unserialize(BinaryDataRef data, bool isFragged=false); void unserialize(BinaryRefReader & brr, bool isFragged=false); void unserializeDBValue(BinaryRefReader & brr); void serializeDBValue(BinaryWriter & bw ) const; void unserializeDBValue(BinaryData const & bd); void unserializeDBValue(BinaryDataRef bd); BinaryData serializeDBValue(void) const; void unserializeDBKey(BinaryDataRef key); BinaryData getDBKey(bool withPrefix=true) const; BinaryData getDBKeyOfChild(uint16_t i, bool withPrefix=true) const; BinaryData getHgtX(void) const {return getDBKey(false).getSliceCopy(0,4);} void pprintOneLine(uint32_t indent=3); void pprintFullTx(uint32_t indent=3); BinaryData thisHash_; uint32_t lockTime_; BinaryData dataCopy_; bool isFragged_; uint32_t version_; uint32_t blockHeight_; uint8_t duplicateID_; uint16_t txIndex_; uint16_t numTxOut_; uint32_t numBytes_; uint32_t fragBytes_; map stxoMap_; // We don't actually enforce these members. They're solely for recording // the values that were unserialized with everything else, so that we can // leter check that it uint32_t unserArmVer_; uint32_t unserTxVer_; TX_SERIALIZE_TYPE unserTxType_; }; //////////////////////////////////////////////////////////////////////////////// class StoredTxOut { public: StoredTxOut(void) : txVersion_(UINT32_MAX), dataCopy_(0), blockHeight_(UINT32_MAX), duplicateID_(UINT8_MAX), parentHash_(0), txIndex_(UINT16_MAX), txOutIndex_(UINT16_MAX), spentness_(TXOUT_SPENTUNK), isCoinbase_(false), spentByTxInKey_(0) {} bool isInitialized(void) const {return dataCopy_.getSize() > 0;} bool isNull(void) { return !isInitialized(); } void unserialize(BinaryData const & data); void unserialize(BinaryDataRef data); void unserialize(BinaryRefReader & brr); void unserializeDBValue(BinaryRefReader & brr); void serializeDBValue(BinaryWriter & bw, bool forceSaveSpent=false) const; void unserializeDBValue(BinaryData const & bd); void unserializeDBValue(BinaryDataRef bd); BinaryData serializeDBValue(bool forceSaveSpent=false) const; void unserializeDBKey(BinaryDataRef key); BinaryData getDBKey(bool withPrefix=true) const; BinaryData getDBKeyOfParentTx(bool withPrefix=true) const; BinaryData getHgtX(void) const {return getDBKey(false).getSliceCopy(0,4);} StoredTxOut & createFromTxOut(TxOut & txout); BinaryData getSerializedTxOut(void) const; TxOut getTxOutCopy(void) const; BinaryData getScrAddress(void) const; BinaryDataRef getScriptRef(void) const; uint64_t getValue(void) const; bool matchesDBKey(BinaryDataRef dbkey) const; uint64_t getValue(void) { if(dataCopy_.getSize()>=8) return READ_UINT64_LE(dataCopy_.getPtr()); else return UINT64_MAX; } bool isSpent(void) { return spentness_==TXOUT_SPENT; } void pprintOneLine(uint32_t indent=3); uint32_t txVersion_; BinaryData dataCopy_; uint32_t blockHeight_; uint8_t duplicateID_; uint16_t txIndex_; uint16_t txOutIndex_; BinaryData parentHash_; TXOUT_SPENTNESS spentness_; bool isCoinbase_; BinaryData spentByTxInKey_; // We don't actually enforce these members. They're solely for recording // the values that were unserialized with everything else, so that we can // leter check that it uint32_t unserArmVer_; uint32_t unserDbType_; }; //////////////////////////////////////////////////////////////////////////////// // TODO: I just realized that this should probably hold a "first-born-block" // field for each address in the summary entry. Though, maybe it's // sufficient to just look at the first subSSH entry to get that info... class StoredScriptHistory { public: StoredScriptHistory(void) : uniqueKey_(0), version_(UINT32_MAX), alreadyScannedUpToBlk_(0), useMultipleEntries_(false), totalTxioCount_(0), totalUnspent_(0) {} bool isInitialized(void) const { return uniqueKey_.getSize() > 0; } bool isNull(void) { return !isInitialized(); } void unserializeDBValue(BinaryRefReader & brr); void serializeDBValue(BinaryWriter & bw ) const; void unserializeDBValue(BinaryData const & bd); void unserializeDBValue(BinaryDataRef bd); BinaryData serializeDBValue(void) const; void unserializeDBKey(BinaryDataRef key, bool withPrefix=true); BinaryData getDBKey(bool withPrefix=true) const; SCRIPT_PREFIX getScriptType(void) const; void pprintOneLine(uint32_t indent=3); void pprintFullSSH(uint32_t indent=3); uint64_t getScriptReceived(bool withMultisig=false); uint64_t getScriptBalance(bool withMultisig=false); bool haveFullHistoryLoaded(void) const; TxIOPair* findTxio(BinaryData const & dbKey8B, bool inclMultisig=false); bool eraseTxio(TxIOPair const & txio); bool eraseTxio(BinaryData const & dbKey8B); bool mergeSubHistory(StoredSubHistory & subssh); TxIOPair& insertTxio(TxIOPair const & txio, bool withOverwrite=true, bool skipTally=false); bool getFullTxioMap(map & mapToFill, bool withMultisig=false); // This adds the TxOut if it doesn't exist yet uint64_t markTxOutUnspent(BinaryData txOutKey8B, uint64_t value=UINT64_MAX, bool isCoinbase=false, bool isMultisigRef=false); uint64_t markTxOutSpent(BinaryData txOutKey8B, BinaryData txInKey8B); BinaryData uniqueKey_; // includes the prefix byte! uint32_t version_; uint32_t alreadyScannedUpToBlk_; bool useMultipleEntries_; uint64_t totalTxioCount_; uint64_t totalUnspent_; // If this SSH has only one TxIO (most of them), then we don't bother // with supplemental entries just to hold that one TxIO in the DB. // We always stored them in RAM using the StoredSubHistory // objects which will have the per-block lists of TxIOs. But when // it gets serialized to disk, we will store single-Txio SSHs in // the base entry and forego extra DB entries. map subHistMap_; }; //////////////////////////////////////////////////////////////////////////////// // We must break out script histories into isolated sub-histories, to // accommodate thoroughly re-used addresses like 1VayNert* and 1dice*. If // we didn't do it, those DB entries would be many megabytes, and those many // MB would be updated multiple times per block. So we break them into // subhistories by block. This is exceptionally well-suited for SatoshiDice // addresses since transactions in one block tend to be related to // transactions in the previous few blocks before it. class StoredSubHistory { public: StoredSubHistory(void) : uniqueKey_(0), hgtX_(0) {} bool isInitialized(void) { return uniqueKey_.getSize() > 0; } bool isNull(void) { return !isInitialized(); } void unserializeDBValue(BinaryRefReader & brr); void serializeDBValue(BinaryWriter & bw ) const; void unserializeDBValue(BinaryData const & bd); void unserializeDBValue(BinaryDataRef bd); BinaryData serializeDBValue(void) const; void unserializeDBKey(BinaryDataRef key, bool withPrefix=true); BinaryData getDBKey(bool withPrefix=true) const; SCRIPT_PREFIX getScriptType(void) const; uint64_t getTxioCount(void) const {return (uint64_t)txioSet_.size();} //void pprintOneLine(uint32_t indent=3); //void pprintFullSSH(uint32_t indent=3); TxIOPair* findTxio(BinaryData const & dbKey8B, bool includeMultisig=false); TxIOPair& insertTxio(TxIOPair const & txio, bool withOverwrite=true); uint64_t eraseTxio(TxIOPair const & txio); uint64_t eraseTxio(BinaryData const & dbKey8B); // This adds the TxOut if it doesn't exist yet uint64_t markTxOutUnspent(BinaryData txOutKey8B, uint64_t value=UINT64_MAX, bool isCoinbase=false, bool isMultisigRef=false); uint64_t markTxOutSpent(BinaryData txOutKey8B, BinaryData txInKey8B); uint64_t getSubHistoryBalance(bool withMultisig=false); uint64_t getSubHistoryReceived(bool withMultisig=false); //vector getSubHistoryValues(void); void pprintFullSubSSH(uint32_t indent=3); // Store all TxIOs for this ScrAddr and block BinaryData uniqueKey_; // includes the prefix byte! BinaryData hgtX_; map txioSet_; }; //////////////////////////////////////////////////////////////////////////////// // TODO: it turns out that outPointsAddedByBlock_ is not "right." If a Tx has // 20 txOuts, there's no reason to write 36 * 20 = 720 bytes when you // can just as easily write the header once, and the numTxOut and create // the OutPoints yourself. Will fix this later. class StoredUndoData { public: StoredUndoData(void) {} bool isInitialized(void) { return (outPointsAddedByBlock_.size() > 0);} bool isNull(void) { return !isInitialized(); } void unserializeDBValue(BinaryRefReader & brr); void serializeDBValue(BinaryWriter & bw ) const; void unserializeDBValue(BinaryData const & bd); void unserializeDBValue(BinaryDataRef bd); BinaryData serializeDBValue(void) const; BinaryData getDBKey(bool withPrefix=true) const; BinaryData blockHash_; uint32_t blockHeight_; uint8_t duplicateID_; vector stxOutsRemovedByBlock_; vector outPointsAddedByBlock_; }; //////////////////////////////////////////////////////////////////////////////// class StoredTxHints { public: StoredTxHints(void) : txHashPrefix_(0), dbKeyList_(0), preferredDBKey_(0) {} bool isInitialized(void) { return txHashPrefix_.getSize() > 0; } bool isNull(void) { return !isInitialized(); } uint32_t getNumHints(void) const { return dbKeyList_.size(); } BinaryDataRef getHint(uint32_t i) const { return dbKeyList_[i].getRef(); } void setPreferredTx(uint32_t height, uint8_t dupID, uint16_t txIndex) { preferredDBKey_ = DBUtils.getBlkDataKeyNoPrefix(height,dupID,txIndex); } void setPreferredTx(BinaryData dbKey6B_) { preferredDBKey_ = dbKey6B_; } void unserializeDBValue(BinaryRefReader & brr); void serializeDBValue(BinaryWriter & bw ) const; void unserializeDBValue(BinaryData const & bd); void unserializeDBValue(BinaryDataRef bd); BinaryData serializeDBValue(void) const; void unserializeDBKey(BinaryDataRef key, bool withPrefix=true); BinaryData getDBKey(bool withPrefix=true) const; BinaryData txHashPrefix_; vector dbKeyList_; BinaryData preferredDBKey_; }; //////////////////////////////////////////////////////////////////////////////// class StoredHeadHgtList { public: StoredHeadHgtList(void) : height_(UINT32_MAX), preferredDup_(UINT8_MAX) {} void unserializeDBValue(BinaryRefReader & brr); void serializeDBValue(BinaryWriter & bw ) const; void unserializeDBValue(BinaryData const & bd); void unserializeDBValue(BinaryDataRef bd); BinaryData serializeDBValue(void) const; void unserializeDBKey(BinaryDataRef key); void addDupAndHash(uint8_t dup, BinaryDataRef hash) { for(uint32_t i=0; i(dup,hash); return; } } dupAndHashList_.push_back(pair(dup,hash)); } BinaryData getDBKey(bool withPrefix=true) const; bool isInitialized(void) { return (height_ != UINT32_MAX);} bool isNull(void) { return !isInitialized(); } void setPreferredDupID(uint8_t newDup) {preferredDup_ = newDup;} uint32_t height_; vector > dupAndHashList_; uint8_t preferredDup_; }; #endif armory-0.92.3/cppForSwig/reorgTest/0000755000000000000000000000000012414772654015671 5ustar rootrootarmory-0.92.3/cppForSwig/reorgTest/blk_0_to_4.dat0000644000000000000000000000366712414772654020313 0ustar rootroot;z{z,>gvaÈQ2:K^J)_I+|METhe Times 03/Jan/2009 Chancellor on brink of second bailout for banks*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_o rFcOeZh-EMO`/`ZW ?GUz_I>*CAhh7m"}NEygB'Y,LIRQkjmL7~kU5ٕU2W$[ؔ>{@]+%0H7*G+ Z@گ_Ira*CAhh7m"}NEygB'Y,LIRQkjmL7~kU5-EMO`/`ZW ?GUzJI0F!8(򎾢h*a*(5wl;:_t!7?0饔ݙ"Xϗi%êʚ;v*2:K'Έ(kv&oBz$ؔi9ٖÖƱgcMe,v*wɢr)'#3_In2Zt*CA\$㕡'BT(@gX낌"?řl@93k/L<201ѨGʪK[c`y\)I0F!۞ Gi߇ +ޛLb j![FK10[Nt-u 9ƲxxAhh7m"}NEygB'Y,LIRQkjmL7~kU5(kv"fO\\ s~422GʪK[c`y\)I0F!]PnE\E _0;|WDv* ,!3ı9TֳPURi+\ơA\$㕡'BT(@gX낌"?řl@93k/L<201Ѩʚ;v"fO\\ s~422sP#_vpI70A6lvS905iEڨy9Oe{>((ܖ>_Ih%@*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_$h(_3+=Ýb/Q2V_tJI0F!z(OdI8#(7&vvn9PЩ!ZT8m5j(im_\˨UN*v"fO\\ s~422armory-0.92.3/cppForSwig/reorgTest/blk_5A.dat0000644000000000000000000000625412414772654017467 0ustar rootroot;z{z,>gvaÈQ2:K^J)_I+|METhe Times 03/Jan/2009 Chancellor on brink of second bailout for banks*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_o rFcOeZh-EMO`/`ZW ?GUz_I>*CAhh7m"}NEygB'Y,LIRQkjmL7~kU5ٕU2W$[ؔ>{@]+%0H7*G+ Z@گ_Ira*CAhh7m"}NEygB'Y,LIRQkjmL7~kU5-EMO`/`ZW ?GUzJI0F!8(򎾢h*a*(5wl;:_t!7?0饔ݙ"Xϗi%êʚ;v*2:K'Έ(kv&oBz$ؔi9ٖÖƱgcMe,v*wɢr)'#3_In2Zt*CA\$㕡'BT(@gX낌"?řl@93k/L<201ѨGʪK[c`y\)I0F!۞ Gi߇ +ޛLb j![FK10[Nt-u 9ƲxxAhh7m"}NEygB'Y,LIRQkjmL7~kU5(kv"fO\\ s~422GʪK[c`y\)I0F!]PnE\E _0;|WDv* ,!3ı9TֳPURi+\ơA\$㕡'BT(@gX낌"?řl@93k/L<201Ѩʚ;v"fO\\ s~422sP#_vpI70A6lvS905iEڨy9Oe{>((ܖ>_Ih%@*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_$h(_3+=Ýb/Q2V_tJI0F!z(OdI8#(7&vvn9PЩ!ZT8m5j(im_\˨UN*v"fO\\ s~422ٖÖƱgcMe,- 2<*Z-D/sk2_IaPi*CApL)ox!2,4qXѽb\]-+Y-~;J GʪK[c`y\)I0F!۞ Gi߇ +ޛLb j![FK10[Nt-u 9ƲxxAhh7m"}NEygB'Y,LIRQkjmL7~kU5(kv"fO\\ s~422GʪK[c`y\)I0F!ƶhQ43zT=ᓋD>ԙ!m*x> 8{ Y#_6ܦ?A\$㕡'BT(@gX낌"?řl@93k/L<201Ѩʚ;v&oBz$ؔi9c.[jmdnN(j?Ӥg҄BGPaKңU/%jD,5]_I3Ep)*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_s(!iw%HBLUJrPԭ. ^T^9}<=ð_I&QB.inz*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_$h(_3+=Ýb/Q2V_tJI0F!z(OdI8#(7&vvn9PЩ!ZT8m5j(im_\˨UN*v"fO\\ s~422armory-0.92.3/cppForSwig/reorgTest/blk_4A.dat0000644000000000000000000000546112414772654017465 0ustar rootroot;z{z,>gvaÈQ2:K^J)_I+|METhe Times 03/Jan/2009 Chancellor on brink of second bailout for banks*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_o rFcOeZh-EMO`/`ZW ?GUz_I>*CAhh7m"}NEygB'Y,LIRQkjmL7~kU5ٕU2W$[ؔ>{@]+%0H7*G+ Z@گ_Ira*CAhh7m"}NEygB'Y,LIRQkjmL7~kU5-EMO`/`ZW ?GUzJI0F!8(򎾢h*a*(5wl;:_t!7?0饔ݙ"Xϗi%êʚ;v*2:K'Έ(kv&oBz$ؔi9ٖÖƱgcMe,v*wɢr)'#3_In2Zt*CA\$㕡'BT(@gX낌"?řl@93k/L<201ѨGʪK[c`y\)I0F!۞ Gi߇ +ޛLb j![FK10[Nt-u 9ƲxxAhh7m"}NEygB'Y,LIRQkjmL7~kU5(kv"fO\\ s~422GʪK[c`y\)I0F!]PnE\E _0;|WDv* ,!3ı9TֳPURi+\ơA\$㕡'BT(@gX낌"?řl@93k/L<201Ѩʚ;v"fO\\ s~422sP#_vpI70A6lvS905iEڨy9Oe{>((ܖ>_Ih%@*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_$h(_3+=Ýb/Q2V_tJI0F!z(OdI8#(7&vvn9PЩ!ZT8m5j(im_\˨UN*v"fO\\ s~422ٖÖƱgcMe,- 2<*Z-D/sk2_IaPi*CApL)ox!2,4qXѽb\]-+Y-~;J GʪK[c`y\)I0F!۞ Gi߇ +ޛLb j![FK10[Nt-u 9ƲxxAhh7m"}NEygB'Y,LIRQkjmL7~kU5(kv"fO\\ s~422GʪK[c`y\)I0F!ƶhQ43zT=ᓋD>ԙ!m*x> 8{ Y#_6ܦ?A\$㕡'BT(@gX낌"?řl@93k/L<201Ѩʚ;v&oBz$ؔi9c.[jmdnN(j?Ӥg҄BGPaKңU/%jD,5]_I3Ep)*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_armory-0.92.3/cppForSwig/reorgTest/blk_3A.dat0000644000000000000000000000512512414772654017461 0ustar rootroot;z{z,>gvaÈQ2:K^J)_I+|METhe Times 03/Jan/2009 Chancellor on brink of second bailout for banks*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_o rFcOeZh-EMO`/`ZW ?GUz_I>*CAhh7m"}NEygB'Y,LIRQkjmL7~kU5ٕU2W$[ؔ>{@]+%0H7*G+ Z@گ_Ira*CAhh7m"}NEygB'Y,LIRQkjmL7~kU5-EMO`/`ZW ?GUzJI0F!8(򎾢h*a*(5wl;:_t!7?0饔ݙ"Xϗi%êʚ;v*2:K'Έ(kv&oBz$ؔi9ٖÖƱgcMe,v*wɢr)'#3_In2Zt*CA\$㕡'BT(@gX낌"?řl@93k/L<201ѨGʪK[c`y\)I0F!۞ Gi߇ +ޛLb j![FK10[Nt-u 9ƲxxAhh7m"}NEygB'Y,LIRQkjmL7~kU5(kv"fO\\ s~422GʪK[c`y\)I0F!]PnE\E _0;|WDv* ,!3ı9TֳPURi+\ơA\$㕡'BT(@gX낌"?řl@93k/L<201Ѩʚ;v"fO\\ s~422sP#_vpI70A6lvS905iEڨy9Oe{>((ܖ>_Ih%@*CAgUH'gq0\֨(9 yba޶I?L8U\8M WLp+k_$h(_3+=Ýb/Q2V_tJI0F!z(OdI8#(7&vvn9PЩ!ZT8m5j(im_\˨UN*v"fO\\ s~422ٖÖƱgcMe,- 2<*Z-D/sk2_IaPi*CApL)ox!2,4qXѽb\]-+Y-~;J GʪK[c`y\)I0F!۞ Gi߇ +ޛLb j![FK10[Nt-u 9ƲxxAhh7m"}NEygB'Y,LIRQkjmL7~kU5(kv"fO\\ s~422GʪK[c`y\)I0F!ƶhQ43zT=ᓋD>ԙ!m*x> 8{ Y#_6ܦ?A\$㕡'BT(@gX낌"?řl@93k/L<201Ѩʚ;v&oBz$ؔi9armory-0.92.3/cppForSwig/BinaryData.cpp0000644000000000000000000001413312414772654016437 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// #include "BinaryData.h" #include "BtcUtils.h" //////////////////////////////////////////////////////////////////////////////// BinaryData::BinaryData(BinaryDataRef const & bdRef) { copyFrom(bdRef.getPtr(), bdRef.getSize()); } //////////////////////////////////////////////////////////////////////////////// void BinaryData::copyFrom(BinaryDataRef const & bdr) { copyFrom( bdr.getPtr(), bdr.getSize() ); } //////////////////////////////////////////////////////////////////////////////// BinaryDataRef BinaryData::getRef(void) const { return BinaryDataRef(getPtr(), getSize()); } //////////////////////////////////////////////////////////////////////////////// BinaryData & BinaryData::append(BinaryDataRef const & bd2) { if(bd2.getSize()==0) return (*this); if(getSize()==0) copyFrom(bd2.getPtr(), bd2.getSize()); else data_.insert(data_.end(), bd2.getPtr(), bd2.getPtr()+bd2.getSize()); return (*this); } ///////////////////////////////////////////////////////////////////////////// BinaryData & BinaryData::append(uint8_t const * str, uint32_t sz) { BinaryDataRef appStr(str, sz); return append(appStr); } //////////////////////////////////////////////////////////////////////////////// int32_t BinaryData::find(BinaryDataRef const & matchStr, uint32_t startPos) { int32_t finalAnswer = -1; if(matchStr.getSize()==0) return startPos; for(int32_t i=startPos; i<=(int32_t)getSize()-(int32_t)matchStr.getSize(); i++) { if(matchStr[0] != data_[i]) continue; for(uint32_t j=0; j getSize()) return false; for(uint32_t i=0; i getSize()) return false; for(uint32_t i=0; i getSize()) return false; for(uint32_t i=0; i getSize()) return false; for(uint32_t i=0; i getSize()) { cerr << "getSliceRef: Invalid BinaryData access" << endl; return BinaryDataRef(); } return BinaryDataRef( getPtr()+start_pos, nChar); } ///////////////////////////////////////////////////////////////////////////// BinaryData BinaryData::getSliceCopy(int32_t start_pos, uint32_t nChar) const { if(start_pos < 0) start_pos = getSize() + start_pos; if(start_pos + nChar > getSize()) { cerr << "getSliceCopy: Invalid BinaryData access" << endl; return BinaryData(); } return BinaryData(getPtr()+start_pos, nChar); } ///////////////////////////////////////////////////////////////////////////// uint64_t BinaryReader::get_var_int(uint8_t* nRead) { uint32_t nBytes; uint64_t varInt = BtcUtils::readVarInt( bdStr_.getPtr() + pos_, &nBytes); if(nRead != NULL) *nRead = nBytes; pos_ += nBytes; return varInt; } ///////////////////////////////////////////////////////////////////////////// uint64_t BinaryRefReader::get_var_int(uint8_t* nRead) { uint32_t nBytes; uint64_t varInt = BtcUtils::readVarInt( bdRef_.getPtr() + pos_, getSizeRemaining(), &nBytes); if(nRead != NULL) *nRead = nBytes; pos_ += nBytes; return varInt; } ///////////////////////////////////////////////////////////////////////////// bool BinaryData::operator==(BinaryDataRef const & bd2) const { if(getSize() != bd2.getSize()) return false; return (memcmp(getPtr(), bd2.getPtr(), getSize()) == 0); } armory-0.92.3/cppForSwig/BitcoinArmory_CppTests/0000755000000000000000000000000012414772654020321 5ustar rootrootarmory-0.92.3/cppForSwig/BitcoinArmory_CppTests/BitcoinArmory_CppTests.vcxproj.filters0000644000000000000000000000604112414772654030014 0ustar rootroot {4FC737F1-C7A5-4376-A066-2A32D752A2FF} cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx {93995380-89BD-4b04-88EB-625FBE52EBFB} h;hpp;hxx;hm;inl;inc;xsd {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files armory-0.92.3/cppForSwig/BitcoinArmory_CppTests/BitcoinArmory_CppTests.vcxproj0000644000000000000000000002465612414772654026361 0ustar rootroot Debug Win32 Debug x64 Release Win32 Release x64 {D9733F9E-BE30-466F-B100-B686DF663C4D} Win32Proj BitcoinArmory_CppTests Application true v110 MultiByte Application true v110 MultiByte Application false v110 true MultiByte Application false v110 true MultiByte true $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ true false $(SolutionDir)$(Platform)\$(Configuration)\ $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ false $(SolutionDir)libs\$(Platform)\ Level3 Disabled WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;_VARIADIC_MAX=10 ;%(PreprocessorDefinitions) ..\leveldb;..\leveldb\include;..\leveldb_windows_port\win32_posix;..\gtest\gtest;..\cryptopp;%(AdditionalIncludeDirectories) MultiThreadedDebug Console true cryptopp_d.lib;leveldb_msvc11_port_d.lib;%(AdditionalDependencies) $(SolutionDir)libs\$(Platform)\;%(AdditionalLibraryDirectories) Level3 Disabled WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;_VARIADIC_MAX=10 ;%(PreprocessorDefinitions) ..\leveldb;..\leveldb\include;..\leveldb_windows_port\win32_posix;..\cryptopp;%(AdditionalIncludeDirectories) MultiThreadedDebug Console true cryptopp_d.lib;leveldb_msvc11_port_d.lib;gtestd.lib;%(AdditionalDependencies) $(SolutionDir)libs\$(Platform)\;%(AdditionalLibraryDirectories) Level3 MaxSpeed true true WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;_VARIADIC_MAX=10;%(PreprocessorDefinitions) ..\leveldb;..\leveldb\include;..\leveldb_windows_port\win32_posix;..\cryptopp;C:\Python27\include;C:\Python26\include;%(AdditionalIncludeDirectories) MultiThreaded Console false true true $(SolutionDir)libs\$(Platform)\;C:\WinDDK\7600.16385.1\lib\ATL\i386;%(AdditionalLibraryDirectories) cryptopp.lib;leveldb_msvc11_port.lib;%(AdditionalDependencies) Level3 MaxSpeed true true WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;_VARIADIC_MAX=10;%(PreprocessorDefinitions) ..\leveldb;..\leveldb\include;..\leveldb_windows_port\win32_posix;..\cryptopp;C:\Python27\include;C:\Python26\include;%(AdditionalIncludeDirectories) MultiThreaded Console false true true $(SolutionDir)libs\x64;%(AdditionalLibraryDirectories) leveldb_msvc11_port.lib;cryptopp.lib;gtest.lib;%(AdditionalDependencies) armory-0.92.3/cppForSwig/BtcUtils.cpp0000644000000000000000000000147412414772654016156 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// #include "BtcUtils.h" BinaryData BtcUtils::BadAddress_ = BinaryData::CreateFromHex("0000000000000000000000000000000000000000"); BinaryData BtcUtils::EmptyHash_ = BinaryData::CreateFromHex("0000000000000000000000000000000000000000000000000000000000000000"); armory-0.92.3/cppForSwig/PartialMerkle.h0000644000000000000000000002361612414772654016630 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// #include #include #include "BinaryData.h" #include "BtcUtils.h" class PartialMerkleTree { public: class MerkleNode { public: BinaryData nodeHash_; bool isOnPath_; bool isLeaf_; MerkleNode* ptrLeft_; MerkleNode* ptrRight_; MerkleNode(void) : nodeHash_(0), isOnPath_(false), isLeaf_(false), ptrLeft_(NULL), ptrRight_(NULL) {} void pprint(void) { cout << (nodeHash_.getSize()>0 ? nodeHash_.getSliceCopy(0,4).toHexStr() : " ") << " " << (isOnPath_ ? 1 : 0) << " " << (isLeaf_ ? 1 : 0) << " " << (ptrLeft_==NULL ? "L-empty" : "L-exist") << " " << (ptrRight_==NULL ? "R-empty" : "R-exist") << endl; } }; ///////////////////////////////////////////////////////////////////////////// ~PartialMerkleTree(void) { if(root_) { recurseDestroyTree(root_); delete root_; } } ///////////////////////////////////////////////////////////////////////////// static void recurseDestroyTree(MerkleNode* node) { if(node->isLeaf_) return; if(node->ptrLeft_) recurseDestroyTree(node->ptrLeft_); if(node->ptrRight_) recurseDestroyTree(node->ptrRight_); if(node->ptrLeft_) delete node->ptrLeft_; if(node->ptrRight_) delete node->ptrRight_; } PartialMerkleTree(uint32_t nTx, vector const * bits=NULL, vector const * hashes=NULL) { createTreeNodes(nTx, bits, hashes); } PartialMerkleTree(BinaryData const & partialMerkle) { unserialize(partialMerkle); } HashString getMerkleRoot(void) { if(!root_) return BinaryData(0); if(root_->nodeHash_.getSize() == 0) root_->nodeHash_ = recurseCalcHash(root_); return root_->nodeHash_; } ///////////////////////////////////////////////////////////////////////////// // "bits" and "hashes" are vectors of size=numTx void createTreeNodes(uint32_t nTx, vector const * bits=NULL, vector const * hashes=NULL) { // We're going to create a binary search tree that looks exactly like // the target merkle tree. It's structure is entirely dependent on // numTx. The bits and hashes vectors are only if we already know // the transaction in this block and which ones to keep. Otherwise, // this will be a blank tree to be repopulated during unserialize. //cout << "Starting createTreeNodes" << endl; numTx_ = nTx; static CryptoPP::SHA256 sha256_; BinaryData hashOut(32); uint32_t nLevel = nTx; vector levelLower(nLevel); // Setup leaf nodes for(uint32_t i=0; iisLeaf_ = true; if(bits && (*bits)[i]) levelLower[i]->isOnPath_ = true; if(hashes) levelLower[i]->nodeHash_ = (*hashes)[i]; //levelLower[i]->pprint(); } while( nLevel > 1 ) { vector levelUpper( (nLevel+1)/2 ); for(uint32_t i=0; iisOnPath_ || (i+1isOnPath_ )) newNode->isOnPath_ = true; // Set left pointer newNode->ptrLeft_ = levelLower[i]; // Set right pointer, if there is one if(i != nLevel-1) newNode->ptrRight_ = levelLower[i+1]; // If we were given hashes, then we can compute them if(hashes) newNode->nodeHash_ = recurseCalcHash(newNode); levelUpper[i/2] = newNode; //newNode->pprint(); } levelLower = levelUpper; nLevel = (nLevel+1)/2; } root_ = levelLower[0]; } ///////////////////////////////////////////////////////////////////////////// BinaryData serialize(void) { if( root_==NULL ) return BinaryData(0); BinaryWriter bw; list vBits; list vHash; // This will populate the vBits and vHash vectors recurseSerializeTree(root_, vBits, vHash); // uint32_t - Num Tx bw.put_uint32_t(numTx_); // var_int + vector - Num Hash + HashList bw.put_var_int(vHash.size()); list::iterator iter; for(iter = vHash.begin(); iter != vHash.end(); iter++) bw.put_BinaryData(*iter); // var_int + vector - Num Bits + BitList bw.put_var_int(vBits.size()); bw.put_BinaryData( BtcUtils::PackBits(vBits) ); return bw.getData(); } ///////////////////////////////////////////////////////////////////////////// void unserialize(BinaryRefReader brr) { if( root_ == NULL) return; // Destroy the tree if it already exists recurseDestroyTree(root_); list vHash; // Read numTx uint32_t numTx = brr.get_uint32_t(); // Create all the nodes in the tree createTreeNodes(numTx); // Read and prepare vHash for depth-first search uint32_t numHash = (uint32_t)brr.get_var_int(); BinaryData hash(32); for(uint32_t i=0; i vBits = BtcUtils::UnpackBits(vBytes, numBits); recurseUnserializeTree(root_, vBits, vHash); recurseCalcHash(root_); } ///////////////////////////////////////////////////////////////////////////// void unserialize(BinaryData const & serialized) { BinaryRefReader brr(serialized); unserialize(brr); } ///////////////////////////////////////////////////////////////////////////// static BinaryData recurseCalcHash(MerkleNode* node) { static CryptoPP::SHA256 sha256_; if(node->nodeHash_.getSize() > 0) return node->nodeHash_; if(node->isLeaf_) cout << "ERROR: leaf node without hash?" << endl; BinaryData combined(64); BinaryData left(32); left = recurseCalcHash(node->ptrLeft_); left.copyTo(combined.getPtr(), 32); if(node->ptrRight_) recurseCalcHash(node->ptrRight_).copyTo(combined.getPtr()+32, 32); else left.copyTo(combined.getPtr()+32, 32); BinaryData finalHash(32); sha256_.CalculateDigest(finalHash.getPtr(), combined.getPtr(), 64); sha256_.CalculateDigest(finalHash.getPtr(), finalHash.getPtr(), 32); return finalHash; } ///////////////////////////////////////////////////////////////////////////// static void recurseSerializeTree(MerkleNode* node, list & vBits, list & vHash) { //cout << "Pushing bit: " << (node->isOnPath_) << endl; vBits.push_back(node->isOnPath_); if(!node->isOnPath_ || node->isLeaf_) { //cout << "Pushing hash: " << node->nodeHash_.toHexStr() << endl; vHash.push_back(node->nodeHash_); return; } if(node->ptrLeft_) recurseSerializeTree(node->ptrLeft_, vBits, vHash); if(node->ptrRight_) recurseSerializeTree(node->ptrRight_, vBits, vHash); //cout << "Finish Serialize" << endl; } ///////////////////////////////////////////////////////////////////////////// static void recurseUnserializeTree( MerkleNode* node, list & vBits, list & vHash) { list::iterator bIter = vBits.begin(); list::iterator hIter = vHash.begin(); //cout << "Popping bits: " << (*bIter ? 1 : 0) << endl; node->isOnPath_ = *bIter; vBits.erase(bIter); if(!node->isOnPath_ || node->isLeaf_) { node->nodeHash_ = *hIter; //cout << "Popping hash: " << hIter->toHexStr() << endl; vHash.erase(hIter); return; } if(node->ptrLeft_) recurseUnserializeTree(node->ptrLeft_, vBits, vHash); if(node->ptrRight_) recurseUnserializeTree(node->ptrRight_, vBits, vHash); node->nodeHash_ = recurseCalcHash(node); //cout << "Finish unserialize" << endl; } void pprintTree(void) { recursePprintTree(root_); cout << "Merkle root: " << root_->nodeHash_.toHexStr() << endl; } void recursePprintTree(MerkleNode* node) { if(!node->isOnPath_ || node->isLeaf_) { node->pprint(); return; } if(node->ptrLeft_) recursePprintTree(node->ptrLeft_); if(node->ptrRight_) recursePprintTree(node->ptrRight_); } private: MerkleNode* root_; uint32_t numTx_; // Don't allow copying or assignment -- becuase I never implemented them // I don't want anyone using them by accident! //PartialMerkleTree(PartialMerkleTree const & pmt2) {} PartialMerkleTree& operator=(PartialMerkleTree const & pmt2) {} }; armory-0.92.3/cppForSwig/cryptopp/0000755000000000000000000000000012414772654015573 5ustar rootrootarmory-0.92.3/cppForSwig/cryptopp/cbcmac.h0000755000000000000000000000260412414772654017161 0ustar rootroot#ifndef CRYPTOPP_CBCMAC_H #define CRYPTOPP_CBCMAC_H #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CBC_MAC_Base : public MessageAuthenticationCode { public: CBC_MAC_Base() {} void UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms); void Update(const byte *input, size_t length); void TruncatedFinal(byte *mac, size_t size); unsigned int DigestSize() const {return const_cast(this)->AccessCipher().BlockSize();} protected: virtual BlockCipher & AccessCipher() =0; private: void ProcessBuf(); SecByteBlock m_reg; unsigned int m_counter; }; //! CBC-MAC /*! Compatible with FIPS 113. T should be a class derived from BlockCipherDocumentation. Secure only for fixed length messages. For variable length messages use CMAC or DMAC. */ template class CBC_MAC : public MessageAuthenticationCodeImpl >, public SameKeyLengthAs { public: CBC_MAC() {} CBC_MAC(const byte *key, size_t length=SameKeyLengthAs::DEFAULT_KEYLENGTH) {this->SetKey(key, length);} static std::string StaticAlgorithmName() {return std::string("CBC-MAC(") + T::StaticAlgorithmName() + ")";} private: BlockCipher & AccessCipher() {return m_cipher;} typename T::Encryption m_cipher; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/dh2.h0000755000000000000000000000413312414772654016425 0ustar rootroot#ifndef CRYPTOPP_DH2_H #define CRYPTOPP_DH2_H /** \file */ #include "cryptlib.h" NAMESPACE_BEGIN(CryptoPP) /// Unified Diffie-Hellman class DH2 : public AuthenticatedKeyAgreementDomain { public: DH2(SimpleKeyAgreementDomain &domain) : d1(domain), d2(domain) {} DH2(SimpleKeyAgreementDomain &staticDomain, SimpleKeyAgreementDomain &ephemeralDomain) : d1(staticDomain), d2(ephemeralDomain) {} CryptoParameters & AccessCryptoParameters() {return d1.AccessCryptoParameters();} unsigned int AgreedValueLength() const {return d1.AgreedValueLength() + d2.AgreedValueLength();} unsigned int StaticPrivateKeyLength() const {return d1.PrivateKeyLength();} unsigned int StaticPublicKeyLength() const {return d1.PublicKeyLength();} void GenerateStaticPrivateKey(RandomNumberGenerator &rng, byte *privateKey) const {d1.GeneratePrivateKey(rng, privateKey);} void GenerateStaticPublicKey(RandomNumberGenerator &rng, const byte *privateKey, byte *publicKey) const {d1.GeneratePublicKey(rng, privateKey, publicKey);} void GenerateStaticKeyPair(RandomNumberGenerator &rng, byte *privateKey, byte *publicKey) const {d1.GenerateKeyPair(rng, privateKey, publicKey);} unsigned int EphemeralPrivateKeyLength() const {return d2.PrivateKeyLength();} unsigned int EphemeralPublicKeyLength() const {return d2.PublicKeyLength();} void GenerateEphemeralPrivateKey(RandomNumberGenerator &rng, byte *privateKey) const {d2.GeneratePrivateKey(rng, privateKey);} void GenerateEphemeralPublicKey(RandomNumberGenerator &rng, const byte *privateKey, byte *publicKey) const {d2.GeneratePublicKey(rng, privateKey, publicKey);} void GenerateEphemeralKeyPair(RandomNumberGenerator &rng, byte *privateKey, byte *publicKey) const {d2.GenerateKeyPair(rng, privateKey, publicKey);} bool Agree(byte *agreedValue, const byte *staticPrivateKey, const byte *ephemeralPrivateKey, const byte *staticOtherPublicKey, const byte *ephemeralOtherPublicKey, bool validateStaticOtherPublicKey=true) const; protected: SimpleKeyAgreementDomain &d1, &d2; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/cryptest_bds.bpf0000755000000000000000000000024412414772654020774 0ustar rootrootThis file is used by the project manager only and should be treated like the project file To add a file to this project use the Project menu 'Add to Project' mainarmory-0.92.3/cppForSwig/cryptopp/serpentp.h0000755000000000000000000002043012414772654017606 0ustar rootroot// private header for Serpent and Sosemanuk NAMESPACE_BEGIN(CryptoPP) // linear transformation #define LT(i,a,b,c,d,e) {\ a = rotlFixed(a, 13); \ c = rotlFixed(c, 3); \ d = rotlFixed(d ^ c ^ (a << 3), 7); \ b = rotlFixed(b ^ a ^ c, 1); \ a = rotlFixed(a ^ b ^ d, 5); \ c = rotlFixed(c ^ d ^ (b << 7), 22);} // inverse linear transformation #define ILT(i,a,b,c,d,e) {\ c = rotrFixed(c, 22); \ a = rotrFixed(a, 5); \ c ^= d ^ (b << 7); \ a ^= b ^ d; \ b = rotrFixed(b, 1); \ d = rotrFixed(d, 7) ^ c ^ (a << 3); \ b ^= a ^ c; \ c = rotrFixed(c, 3); \ a = rotrFixed(a, 13);} // order of output from S-box functions #define beforeS0(f) f(0,a,b,c,d,e) #define afterS0(f) f(1,b,e,c,a,d) #define afterS1(f) f(2,c,b,a,e,d) #define afterS2(f) f(3,a,e,b,d,c) #define afterS3(f) f(4,e,b,d,c,a) #define afterS4(f) f(5,b,a,e,c,d) #define afterS5(f) f(6,a,c,b,e,d) #define afterS6(f) f(7,a,c,d,b,e) #define afterS7(f) f(8,d,e,b,a,c) // order of output from inverse S-box functions #define beforeI7(f) f(8,a,b,c,d,e) #define afterI7(f) f(7,d,a,b,e,c) #define afterI6(f) f(6,a,b,c,e,d) #define afterI5(f) f(5,b,d,e,c,a) #define afterI4(f) f(4,b,c,e,a,d) #define afterI3(f) f(3,a,b,e,c,d) #define afterI2(f) f(2,b,d,e,c,a) #define afterI1(f) f(1,a,b,c,e,d) #define afterI0(f) f(0,a,d,b,e,c) // The instruction sequences for the S-box functions // come from Dag Arne Osvik's paper "Speeding up Serpent". #define S0(i, r0, r1, r2, r3, r4) \ { \ r3 ^= r0; \ r4 = r1; \ r1 &= r3; \ r4 ^= r2; \ r1 ^= r0; \ r0 |= r3; \ r0 ^= r4; \ r4 ^= r3; \ r3 ^= r2; \ r2 |= r1; \ r2 ^= r4; \ r4 = ~r4; \ r4 |= r1; \ r1 ^= r3; \ r1 ^= r4; \ r3 |= r0; \ r1 ^= r3; \ r4 ^= r3; \ } #define I0(i, r0, r1, r2, r3, r4) \ { \ r2 = ~r2; \ r4 = r1; \ r1 |= r0; \ r4 = ~r4; \ r1 ^= r2; \ r2 |= r4; \ r1 ^= r3; \ r0 ^= r4; \ r2 ^= r0; \ r0 &= r3; \ r4 ^= r0; \ r0 |= r1; \ r0 ^= r2; \ r3 ^= r4; \ r2 ^= r1; \ r3 ^= r0; \ r3 ^= r1; \ r2 &= r3; \ r4 ^= r2; \ } #define S1(i, r0, r1, r2, r3, r4) \ { \ r0 = ~r0; \ r2 = ~r2; \ r4 = r0; \ r0 &= r1; \ r2 ^= r0; \ r0 |= r3; \ r3 ^= r2; \ r1 ^= r0; \ r0 ^= r4; \ r4 |= r1; \ r1 ^= r3; \ r2 |= r0; \ r2 &= r4; \ r0 ^= r1; \ r1 &= r2; \ r1 ^= r0; \ r0 &= r2; \ r0 ^= r4; \ } #define I1(i, r0, r1, r2, r3, r4) \ { \ r4 = r1; \ r1 ^= r3; \ r3 &= r1; \ r4 ^= r2; \ r3 ^= r0; \ r0 |= r1; \ r2 ^= r3; \ r0 ^= r4; \ r0 |= r2; \ r1 ^= r3; \ r0 ^= r1; \ r1 |= r3; \ r1 ^= r0; \ r4 = ~r4; \ r4 ^= r1; \ r1 |= r0; \ r1 ^= r0; \ r1 |= r4; \ r3 ^= r1; \ } #define S2(i, r0, r1, r2, r3, r4) \ { \ r4 = r0; \ r0 &= r2; \ r0 ^= r3; \ r2 ^= r1; \ r2 ^= r0; \ r3 |= r4; \ r3 ^= r1; \ r4 ^= r2; \ r1 = r3; \ r3 |= r4; \ r3 ^= r0; \ r0 &= r1; \ r4 ^= r0; \ r1 ^= r3; \ r1 ^= r4; \ r4 = ~r4; \ } #define I2(i, r0, r1, r2, r3, r4) \ { \ r2 ^= r3; \ r3 ^= r0; \ r4 = r3; \ r3 &= r2; \ r3 ^= r1; \ r1 |= r2; \ r1 ^= r4; \ r4 &= r3; \ r2 ^= r3; \ r4 &= r0; \ r4 ^= r2; \ r2 &= r1; \ r2 |= r0; \ r3 = ~r3; \ r2 ^= r3; \ r0 ^= r3; \ r0 &= r1; \ r3 ^= r4; \ r3 ^= r0; \ } #define S3(i, r0, r1, r2, r3, r4) \ { \ r4 = r0; \ r0 |= r3; \ r3 ^= r1; \ r1 &= r4; \ r4 ^= r2; \ r2 ^= r3; \ r3 &= r0; \ r4 |= r1; \ r3 ^= r4; \ r0 ^= r1; \ r4 &= r0; \ r1 ^= r3; \ r4 ^= r2; \ r1 |= r0; \ r1 ^= r2; \ r0 ^= r3; \ r2 = r1; \ r1 |= r3; \ r1 ^= r0; \ } #define I3(i, r0, r1, r2, r3, r4) \ { \ r4 = r2; \ r2 ^= r1; \ r1 &= r2; \ r1 ^= r0; \ r0 &= r4; \ r4 ^= r3; \ r3 |= r1; \ r3 ^= r2; \ r0 ^= r4; \ r2 ^= r0; \ r0 |= r3; \ r0 ^= r1; \ r4 ^= r2; \ r2 &= r3; \ r1 |= r3; \ r1 ^= r2; \ r4 ^= r0; \ r2 ^= r4; \ } #define S4(i, r0, r1, r2, r3, r4) \ { \ r1 ^= r3; \ r3 = ~r3; \ r2 ^= r3; \ r3 ^= r0; \ r4 = r1; \ r1 &= r3; \ r1 ^= r2; \ r4 ^= r3; \ r0 ^= r4; \ r2 &= r4; \ r2 ^= r0; \ r0 &= r1; \ r3 ^= r0; \ r4 |= r1; \ r4 ^= r0; \ r0 |= r3; \ r0 ^= r2; \ r2 &= r3; \ r0 = ~r0; \ r4 ^= r2; \ } #define I4(i, r0, r1, r2, r3, r4) \ { \ r4 = r2; \ r2 &= r3; \ r2 ^= r1; \ r1 |= r3; \ r1 &= r0; \ r4 ^= r2; \ r4 ^= r1; \ r1 &= r2; \ r0 = ~r0; \ r3 ^= r4; \ r1 ^= r3; \ r3 &= r0; \ r3 ^= r2; \ r0 ^= r1; \ r2 &= r0; \ r3 ^= r0; \ r2 ^= r4; \ r2 |= r3; \ r3 ^= r0; \ r2 ^= r1; \ } #define S5(i, r0, r1, r2, r3, r4) \ { \ r0 ^= r1; \ r1 ^= r3; \ r3 = ~r3; \ r4 = r1; \ r1 &= r0; \ r2 ^= r3; \ r1 ^= r2; \ r2 |= r4; \ r4 ^= r3; \ r3 &= r1; \ r3 ^= r0; \ r4 ^= r1; \ r4 ^= r2; \ r2 ^= r0; \ r0 &= r3; \ r2 = ~r2; \ r0 ^= r4; \ r4 |= r3; \ r2 ^= r4; \ } #define I5(i, r0, r1, r2, r3, r4) \ { \ r1 = ~r1; \ r4 = r3; \ r2 ^= r1; \ r3 |= r0; \ r3 ^= r2; \ r2 |= r1; \ r2 &= r0; \ r4 ^= r3; \ r2 ^= r4; \ r4 |= r0; \ r4 ^= r1; \ r1 &= r2; \ r1 ^= r3; \ r4 ^= r2; \ r3 &= r4; \ r4 ^= r1; \ r3 ^= r0; \ r3 ^= r4; \ r4 = ~r4; \ } #define S6(i, r0, r1, r2, r3, r4) \ { \ r2 = ~r2; \ r4 = r3; \ r3 &= r0; \ r0 ^= r4; \ r3 ^= r2; \ r2 |= r4; \ r1 ^= r3; \ r2 ^= r0; \ r0 |= r1; \ r2 ^= r1; \ r4 ^= r0; \ r0 |= r3; \ r0 ^= r2; \ r4 ^= r3; \ r4 ^= r0; \ r3 = ~r3; \ r2 &= r4; \ r2 ^= r3; \ } #define I6(i, r0, r1, r2, r3, r4) \ { \ r0 ^= r2; \ r4 = r2; \ r2 &= r0; \ r4 ^= r3; \ r2 = ~r2; \ r3 ^= r1; \ r2 ^= r3; \ r4 |= r0; \ r0 ^= r2; \ r3 ^= r4; \ r4 ^= r1; \ r1 &= r3; \ r1 ^= r0; \ r0 ^= r3; \ r0 |= r2; \ r3 ^= r1; \ r4 ^= r0; \ } #define S7(i, r0, r1, r2, r3, r4) \ { \ r4 = r2; \ r2 &= r1; \ r2 ^= r3; \ r3 &= r1; \ r4 ^= r2; \ r2 ^= r1; \ r1 ^= r0; \ r0 |= r4; \ r0 ^= r2; \ r3 ^= r1; \ r2 ^= r3; \ r3 &= r0; \ r3 ^= r4; \ r4 ^= r2; \ r2 &= r0; \ r4 = ~r4; \ r2 ^= r4; \ r4 &= r0; \ r1 ^= r3; \ r4 ^= r1; \ } #define I7(i, r0, r1, r2, r3, r4) \ { \ r4 = r2; \ r2 ^= r0; \ r0 &= r3; \ r2 = ~r2; \ r4 |= r3; \ r3 ^= r1; \ r1 |= r0; \ r0 ^= r2; \ r2 &= r4; \ r1 ^= r2; \ r2 ^= r0; \ r0 |= r2; \ r3 &= r4; \ r0 ^= r3; \ r4 ^= r1; \ r3 ^= r4; \ r4 |= r0; \ r3 ^= r2; \ r4 ^= r2; \ } // key xor #define KX(r, a, b, c, d, e) {\ a ^= k[4 * r + 0]; \ b ^= k[4 * r + 1]; \ c ^= k[4 * r + 2]; \ d ^= k[4 * r + 3];} #define LK(r, a, b, c, d, e) {\ a = k[(8-r)*4 + 0]; \ b = k[(8-r)*4 + 1]; \ c = k[(8-r)*4 + 2]; \ d = k[(8-r)*4 + 3];} #define SK(r, a, b, c, d, e) {\ k[(8-r)*4 + 4] = a; \ k[(8-r)*4 + 5] = b; \ k[(8-r)*4 + 6] = c; \ k[(8-r)*4 + 7] = d;} void Serpent_KeySchedule(word32 *k, unsigned int rounds, const byte *userKey, size_t keylen); NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/adhoc.cpp.proto0000755000000000000000000000045412414772654020525 0ustar rootroot#include "filters.h" #include "files.h" #include "base64.h" #include "hex.h" #include USING_NAMESPACE(CryptoPP) USING_NAMESPACE(std) extern int (*AdhocTest)(int argc, char *argv[]); int MyAdhocTest(int argc, char *argv[]) { return 0; } static int s_i = (AdhocTest = &MyAdhocTest, 0); armory-0.92.3/cppForSwig/cryptopp/integer.h0000755000000000000000000003222012414772654017403 0ustar rootroot#ifndef CRYPTOPP_INTEGER_H #define CRYPTOPP_INTEGER_H /** \file */ #include "cryptlib.h" #include "secblock.h" #include #include NAMESPACE_BEGIN(CryptoPP) struct InitializeInteger // used to initialize static variables { InitializeInteger(); }; typedef SecBlock > IntegerSecBlock; //! multiple precision integer and basic arithmetics /*! This class can represent positive and negative integers with absolute value less than (256**sizeof(word)) ** (256**sizeof(int)). \nosubgrouping */ class CRYPTOPP_DLL Integer : private InitializeInteger, public ASN1Object { public: //! \name ENUMS, EXCEPTIONS, and TYPEDEFS //@{ //! division by zero exception class DivideByZero : public Exception { public: DivideByZero() : Exception(OTHER_ERROR, "Integer: division by zero") {} }; //! class RandomNumberNotFound : public Exception { public: RandomNumberNotFound() : Exception(OTHER_ERROR, "Integer: no integer satisfies the given parameters") {} }; //! enum Sign {POSITIVE=0, NEGATIVE=1}; //! enum Signedness { //! UNSIGNED, //! SIGNED}; //! enum RandomNumberType { //! ANY, //! PRIME}; //@} //! \name CREATORS //@{ //! creates the zero integer Integer(); //! copy constructor Integer(const Integer& t); //! convert from signed long Integer(signed long value); //! convert from lword Integer(Sign s, lword value); //! convert from two words Integer(Sign s, word highWord, word lowWord); //! convert from string /*! str can be in base 2, 8, 10, or 16. Base is determined by a case insensitive suffix of 'h', 'o', or 'b'. No suffix means base 10. */ explicit Integer(const char *str); explicit Integer(const wchar_t *str); //! convert from big-endian byte array Integer(const byte *encodedInteger, size_t byteCount, Signedness s=UNSIGNED); //! convert from big-endian form stored in a BufferedTransformation Integer(BufferedTransformation &bt, size_t byteCount, Signedness s=UNSIGNED); //! convert from BER encoded byte array stored in a BufferedTransformation object explicit Integer(BufferedTransformation &bt); //! create a random integer /*! The random integer created is uniformly distributed over [0, 2**bitcount). */ Integer(RandomNumberGenerator &rng, size_t bitcount); //! avoid calling constructors for these frequently used integers static const Integer & CRYPTOPP_API Zero(); //! avoid calling constructors for these frequently used integers static const Integer & CRYPTOPP_API One(); //! avoid calling constructors for these frequently used integers static const Integer & CRYPTOPP_API Two(); //! create a random integer of special type /*! Ideally, the random integer created should be uniformly distributed over {x | min <= x <= max and x is of rnType and x % mod == equiv}. However the actual distribution may not be uniform because sequential search is used to find an appropriate number from a random starting point. May return (with very small probability) a pseudoprime when a prime is requested and max > lastSmallPrime*lastSmallPrime (lastSmallPrime is declared in nbtheory.h). \throw RandomNumberNotFound if the set is empty. */ Integer(RandomNumberGenerator &rng, const Integer &min, const Integer &max, RandomNumberType rnType=ANY, const Integer &equiv=Zero(), const Integer &mod=One()); //! return the integer 2**e static Integer CRYPTOPP_API Power2(size_t e); //@} //! \name ENCODE/DECODE //@{ //! minimum number of bytes to encode this integer /*! MinEncodedSize of 0 is 1 */ size_t MinEncodedSize(Signedness=UNSIGNED) const; //! encode in big-endian format /*! unsigned means encode absolute value, signed means encode two's complement if negative. if outputLen < MinEncodedSize, the most significant bytes will be dropped if outputLen > MinEncodedSize, the most significant bytes will be padded */ void Encode(byte *output, size_t outputLen, Signedness=UNSIGNED) const; //! void Encode(BufferedTransformation &bt, size_t outputLen, Signedness=UNSIGNED) const; //! encode using Distinguished Encoding Rules, put result into a BufferedTransformation object void DEREncode(BufferedTransformation &bt) const; //! encode absolute value as big-endian octet string void DEREncodeAsOctetString(BufferedTransformation &bt, size_t length) const; //! encode absolute value in OpenPGP format, return length of output size_t OpenPGPEncode(byte *output, size_t bufferSize) const; //! encode absolute value in OpenPGP format, put result into a BufferedTransformation object size_t OpenPGPEncode(BufferedTransformation &bt) const; //! void Decode(const byte *input, size_t inputLen, Signedness=UNSIGNED); //! //* Precondition: bt.MaxRetrievable() >= inputLen void Decode(BufferedTransformation &bt, size_t inputLen, Signedness=UNSIGNED); //! void BERDecode(const byte *input, size_t inputLen); //! void BERDecode(BufferedTransformation &bt); //! decode nonnegative value as big-endian octet string void BERDecodeAsOctetString(BufferedTransformation &bt, size_t length); class OpenPGPDecodeErr : public Exception { public: OpenPGPDecodeErr() : Exception(INVALID_DATA_FORMAT, "OpenPGP decode error") {} }; //! void OpenPGPDecode(const byte *input, size_t inputLen); //! void OpenPGPDecode(BufferedTransformation &bt); //@} //! \name ACCESSORS //@{ //! return true if *this can be represented as a signed long bool IsConvertableToLong() const; //! return equivalent signed long if possible, otherwise undefined signed long ConvertToLong() const; //! number of significant bits = floor(log2(abs(*this))) + 1 unsigned int BitCount() const; //! number of significant bytes = ceiling(BitCount()/8) unsigned int ByteCount() const; //! number of significant words = ceiling(ByteCount()/sizeof(word)) unsigned int WordCount() const; //! return the i-th bit, i=0 being the least significant bit bool GetBit(size_t i) const; //! return the i-th byte byte GetByte(size_t i) const; //! return n lowest bits of *this >> i lword GetBits(size_t i, size_t n) const; //! bool IsZero() const {return !*this;} //! bool NotZero() const {return !IsZero();} //! bool IsNegative() const {return sign == NEGATIVE;} //! bool NotNegative() const {return !IsNegative();} //! bool IsPositive() const {return NotNegative() && NotZero();} //! bool NotPositive() const {return !IsPositive();} //! bool IsEven() const {return GetBit(0) == 0;} //! bool IsOdd() const {return GetBit(0) == 1;} //@} //! \name MANIPULATORS //@{ //! Integer& operator=(const Integer& t); //! Integer& operator+=(const Integer& t); //! Integer& operator-=(const Integer& t); //! Integer& operator*=(const Integer& t) {return *this = Times(t);} //! Integer& operator/=(const Integer& t) {return *this = DividedBy(t);} //! Integer& operator%=(const Integer& t) {return *this = Modulo(t);} //! Integer& operator/=(word t) {return *this = DividedBy(t);} //! Integer& operator%=(word t) {return *this = Integer(POSITIVE, 0, Modulo(t));} //! Integer& operator<<=(size_t); //! Integer& operator>>=(size_t); //! void Randomize(RandomNumberGenerator &rng, size_t bitcount); //! void Randomize(RandomNumberGenerator &rng, const Integer &min, const Integer &max); //! set this Integer to a random element of {x | min <= x <= max and x is of rnType and x % mod == equiv} /*! returns false if the set is empty */ bool Randomize(RandomNumberGenerator &rng, const Integer &min, const Integer &max, RandomNumberType rnType, const Integer &equiv=Zero(), const Integer &mod=One()); bool GenerateRandomNoThrow(RandomNumberGenerator &rng, const NameValuePairs ¶ms = g_nullNameValuePairs); void GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs ¶ms = g_nullNameValuePairs) { if (!GenerateRandomNoThrow(rng, params)) throw RandomNumberNotFound(); } //! set the n-th bit to value void SetBit(size_t n, bool value=1); //! set the n-th byte to value void SetByte(size_t n, byte value); //! void Negate(); //! void SetPositive() {sign = POSITIVE;} //! void SetNegative() {if (!!(*this)) sign = NEGATIVE;} //! void swap(Integer &a); //@} //! \name UNARY OPERATORS //@{ //! bool operator!() const; //! Integer operator+() const {return *this;} //! Integer operator-() const; //! Integer& operator++(); //! Integer& operator--(); //! Integer operator++(int) {Integer temp = *this; ++*this; return temp;} //! Integer operator--(int) {Integer temp = *this; --*this; return temp;} //@} //! \name BINARY OPERATORS //@{ //! signed comparison /*! \retval -1 if *this < a \retval 0 if *this = a \retval 1 if *this > a */ int Compare(const Integer& a) const; //! Integer Plus(const Integer &b) const; //! Integer Minus(const Integer &b) const; //! Integer Times(const Integer &b) const; //! Integer DividedBy(const Integer &b) const; //! Integer Modulo(const Integer &b) const; //! Integer DividedBy(word b) const; //! word Modulo(word b) const; //! Integer operator>>(size_t n) const {return Integer(*this)>>=n;} //! Integer operator<<(size_t n) const {return Integer(*this)<<=n;} //@} //! \name OTHER ARITHMETIC FUNCTIONS //@{ //! Integer AbsoluteValue() const; //! Integer Doubled() const {return Plus(*this);} //! Integer Squared() const {return Times(*this);} //! extract square root, if negative return 0, else return floor of square root Integer SquareRoot() const; //! return whether this integer is a perfect square bool IsSquare() const; //! is 1 or -1 bool IsUnit() const; //! return inverse if 1 or -1, otherwise return 0 Integer MultiplicativeInverse() const; //! modular multiplication CRYPTOPP_DLL friend Integer CRYPTOPP_API a_times_b_mod_c(const Integer &x, const Integer& y, const Integer& m); //! modular exponentiation CRYPTOPP_DLL friend Integer CRYPTOPP_API a_exp_b_mod_c(const Integer &x, const Integer& e, const Integer& m); //! calculate r and q such that (a == d*q + r) && (0 <= r < abs(d)) static void CRYPTOPP_API Divide(Integer &r, Integer &q, const Integer &a, const Integer &d); //! use a faster division algorithm when divisor is short static void CRYPTOPP_API Divide(word &r, Integer &q, const Integer &a, word d); //! returns same result as Divide(r, q, a, Power2(n)), but faster static void CRYPTOPP_API DivideByPowerOf2(Integer &r, Integer &q, const Integer &a, unsigned int n); //! greatest common divisor static Integer CRYPTOPP_API Gcd(const Integer &a, const Integer &n); //! calculate multiplicative inverse of *this mod n Integer InverseMod(const Integer &n) const; //! word InverseMod(word n) const; //@} //! \name INPUT/OUTPUT //@{ //! friend CRYPTOPP_DLL std::istream& CRYPTOPP_API operator>>(std::istream& in, Integer &a); //! friend CRYPTOPP_DLL std::ostream& CRYPTOPP_API operator<<(std::ostream& out, const Integer &a); //@} private: friend class ModularArithmetic; friend class MontgomeryRepresentation; friend class HalfMontgomeryRepresentation; Integer(word value, size_t length); int PositiveCompare(const Integer &t) const; friend void PositiveAdd(Integer &sum, const Integer &a, const Integer &b); friend void PositiveSubtract(Integer &diff, const Integer &a, const Integer &b); friend void PositiveMultiply(Integer &product, const Integer &a, const Integer &b); friend void PositiveDivide(Integer &remainder, Integer "ient, const Integer ÷nd, const Integer &divisor); IntegerSecBlock reg; Sign sign; }; //! inline bool operator==(const CryptoPP::Integer& a, const CryptoPP::Integer& b) {return a.Compare(b)==0;} //! inline bool operator!=(const CryptoPP::Integer& a, const CryptoPP::Integer& b) {return a.Compare(b)!=0;} //! inline bool operator> (const CryptoPP::Integer& a, const CryptoPP::Integer& b) {return a.Compare(b)> 0;} //! inline bool operator>=(const CryptoPP::Integer& a, const CryptoPP::Integer& b) {return a.Compare(b)>=0;} //! inline bool operator< (const CryptoPP::Integer& a, const CryptoPP::Integer& b) {return a.Compare(b)< 0;} //! inline bool operator<=(const CryptoPP::Integer& a, const CryptoPP::Integer& b) {return a.Compare(b)<=0;} //! inline CryptoPP::Integer operator+(const CryptoPP::Integer &a, const CryptoPP::Integer &b) {return a.Plus(b);} //! inline CryptoPP::Integer operator-(const CryptoPP::Integer &a, const CryptoPP::Integer &b) {return a.Minus(b);} //! inline CryptoPP::Integer operator*(const CryptoPP::Integer &a, const CryptoPP::Integer &b) {return a.Times(b);} //! inline CryptoPP::Integer operator/(const CryptoPP::Integer &a, const CryptoPP::Integer &b) {return a.DividedBy(b);} //! inline CryptoPP::Integer operator%(const CryptoPP::Integer &a, const CryptoPP::Integer &b) {return a.Modulo(b);} //! inline CryptoPP::Integer operator/(const CryptoPP::Integer &a, CryptoPP::word b) {return a.DividedBy(b);} //! inline CryptoPP::word operator%(const CryptoPP::Integer &a, CryptoPP::word b) {return a.Modulo(b);} NAMESPACE_END #ifndef __BORLANDC__ NAMESPACE_BEGIN(std) inline void swap(CryptoPP::Integer &a, CryptoPP::Integer &b) { a.swap(b); } NAMESPACE_END #endif #endif armory-0.92.3/cppForSwig/cryptopp/test.cpp0000755000000000000000000006253712414772654017276 0ustar rootroot// test.cpp - written and placed in the public domain by Wei Dai #define _CRT_SECURE_NO_DEPRECATE #define CRYPTOPP_DEFAULT_NO_DLL #define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1 #include "dll.h" #include "md5.h" #include "ripemd.h" #include "rng.h" #include "gzip.h" #include "default.h" #include "randpool.h" #include "ida.h" #include "base64.h" #include "socketft.h" #include "wait.h" #include "factory.h" #include "whrlpool.h" #include "tiger.h" #include "validate.h" #include "bench.h" #include #include #ifdef CRYPTOPP_WIN32_AVAILABLE #include #endif #if defined(USE_BERKELEY_STYLE_SOCKETS) && !defined(macintosh) #include #include #endif #if (_MSC_VER >= 1000) #include // for the debug heap #endif #if defined(__MWERKS__) && defined(macintosh) #include #endif #ifdef __BORLANDC__ #pragma comment(lib, "cryptlib_bds.lib") #pragma comment(lib, "ws2_32.lib") #endif USING_NAMESPACE(CryptoPP) USING_NAMESPACE(std) const int MAX_PHRASE_LENGTH=250; void RegisterFactories(); void GenerateRSAKey(unsigned int keyLength, const char *privFilename, const char *pubFilename, const char *seed); string RSAEncryptString(const char *pubFilename, const char *seed, const char *message); string RSADecryptString(const char *privFilename, const char *ciphertext); void RSASignFile(const char *privFilename, const char *messageFilename, const char *signatureFilename); bool RSAVerifyFile(const char *pubFilename, const char *messageFilename, const char *signatureFilename); void DigestFile(const char *file); void HmacFile(const char *hexKey, const char *file); void AES_CTR_Encrypt(const char *hexKey, const char *hexIV, const char *infile, const char *outfile); string EncryptString(const char *plaintext, const char *passPhrase); string DecryptString(const char *ciphertext, const char *passPhrase); void EncryptFile(const char *in, const char *out, const char *passPhrase); void DecryptFile(const char *in, const char *out, const char *passPhrase); void SecretShareFile(int threshold, int nShares, const char *filename, const char *seed); void SecretRecoverFile(int threshold, const char *outFilename, char *const *inFilenames); void InformationDisperseFile(int threshold, int nShares, const char *filename); void InformationRecoverFile(int threshold, const char *outFilename, char *const *inFilenames); void GzipFile(const char *in, const char *out, int deflate_level); void GunzipFile(const char *in, const char *out); void Base64Encode(const char *infile, const char *outfile); void Base64Decode(const char *infile, const char *outfile); void HexEncode(const char *infile, const char *outfile); void HexDecode(const char *infile, const char *outfile); void ForwardTcpPort(const char *sourcePort, const char *destinationHost, const char *destinationPort); void FIPS140_SampleApplication(); void FIPS140_GenerateRandomFiles(); bool Validate(int, bool, const char *); int (*AdhocTest)(int argc, char *argv[]) = NULL; static OFB_Mode::Encryption s_globalRNG; RandomNumberGenerator & GlobalRNG() { return s_globalRNG; } int CRYPTOPP_API main(int argc, char *argv[]) { #ifdef _CRTDBG_LEAK_CHECK_DF // Turn on leak-checking int tempflag = _CrtSetDbgFlag( _CRTDBG_REPORT_FLAG ); tempflag |= _CRTDBG_LEAK_CHECK_DF; _CrtSetDbgFlag( tempflag ); #endif #if defined(__MWERKS__) && defined(macintosh) argc = ccommand(&argv); #endif try { RegisterFactories(); std::string seed = IntToString(time(NULL)); seed.resize(16); s_globalRNG.SetKeyWithIV((byte *)seed.data(), 16, (byte *)seed.data()); std::string command, executableName, macFilename; if (argc < 2) command = 'h'; else command = argv[1]; if (command == "g") { char seed[1024], privFilename[128], pubFilename[128]; unsigned int keyLength; cout << "Key length in bits: "; cin >> keyLength; cout << "\nSave private key to file: "; cin >> privFilename; cout << "\nSave public key to file: "; cin >> pubFilename; cout << "\nRandom Seed: "; ws(cin); cin.getline(seed, 1024); GenerateRSAKey(keyLength, privFilename, pubFilename, seed); } else if (command == "rs") RSASignFile(argv[2], argv[3], argv[4]); else if (command == "rv") { bool verified = RSAVerifyFile(argv[2], argv[3], argv[4]); cout << (verified ? "valid signature" : "invalid signature") << endl; } else if (command == "r") { char privFilename[128], pubFilename[128]; char seed[1024], message[1024]; cout << "Private key file: "; cin >> privFilename; cout << "\nPublic key file: "; cin >> pubFilename; cout << "\nRandom Seed: "; ws(cin); cin.getline(seed, 1024); cout << "\nMessage: "; cin.getline(message, 1024); string ciphertext = RSAEncryptString(pubFilename, seed, message); cout << "\nCiphertext: " << ciphertext << endl; string decrypted = RSADecryptString(privFilename, ciphertext.c_str()); cout << "\nDecrypted: " << decrypted << endl; } else if (command == "mt") { MaurerRandomnessTest mt; FileStore fs(argv[2]); fs.TransferAllTo(mt); cout << "Maurer Test Value: " << mt.GetTestValue() << endl; } else if (command == "mac_dll") { // sanity check on file size std::fstream dllFile(argv[2], ios::in | ios::out | ios::binary); std::ifstream::pos_type fileEnd = dllFile.seekg(0, std::ios_base::end).tellg(); if (fileEnd > 20*1000*1000) { cerr << "Input file too large (more than 20 MB).\n"; return 1; } // read file into memory unsigned int fileSize = (unsigned int)fileEnd; SecByteBlock buf(fileSize); dllFile.seekg(0, std::ios_base::beg); dllFile.read((char *)buf.begin(), fileSize); // find positions of relevant sections in the file, based on version 8 of documentation from http://www.microsoft.com/whdc/system/platform/firmware/PECOFF.mspx word32 coffPos = *(word16 *)(buf+0x3c); word32 optionalHeaderPos = coffPos + 24; word16 optionalHeaderMagic = *(word16 *)(buf+optionalHeaderPos); if (optionalHeaderMagic != 0x10b && optionalHeaderMagic != 0x20b) { cerr << "Target file is not a PE32 or PE32+ image.\n"; return 3; } word32 checksumPos = optionalHeaderPos + 64; word32 certificateTableDirectoryPos = optionalHeaderPos + (optionalHeaderMagic == 0x10b ? 128 : 144); word32 certificateTablePos = *(word32 *)(buf+certificateTableDirectoryPos); word32 certificateTableSize = *(word32 *)(buf+certificateTableDirectoryPos+4); if (certificateTableSize != 0) cerr << "Warning: certificate table (IMAGE_DIRECTORY_ENTRY_SECURITY) of target image is not empty.\n"; // find where to place computed MAC byte mac[] = CRYPTOPP_DUMMY_DLL_MAC; byte *found = std::search(buf.begin(), buf.end(), mac+0, mac+sizeof(mac)); if (found == buf.end()) { cerr << "MAC placeholder not found. Possibly the actual MAC was already placed.\n"; return 2; } word32 macPos = (unsigned int)(found-buf.begin()); // compute MAC member_ptr pMac(NewIntegrityCheckingMAC()); assert(pMac->DigestSize() == sizeof(mac)); MeterFilter f(new HashFilter(*pMac, new ArraySink(mac, sizeof(mac)))); f.AddRangeToSkip(0, checksumPos, 4); f.AddRangeToSkip(0, certificateTableDirectoryPos, 8); f.AddRangeToSkip(0, macPos, sizeof(mac)); f.AddRangeToSkip(0, certificateTablePos, certificateTableSize); f.PutMessageEnd(buf.begin(), buf.size()); // place MAC cout << "Placing MAC in file " << argv[2] << ", location " << macPos << ".\n"; dllFile.seekg(macPos, std::ios_base::beg); dllFile.write((char *)mac, sizeof(mac)); } else if (command == "m") DigestFile(argv[2]); else if (command == "tv") { std::string fname = argv[2]; if (fname.find(".txt") == std::string::npos) fname = "TestVectors/" + fname + ".txt"; return !RunTestDataFile(fname.c_str()); } else if (command == "t") { // VC60 workaround: use char array instead of std::string to workaround MSVC's getline bug char passPhrase[MAX_PHRASE_LENGTH], plaintext[1024]; cout << "Passphrase: "; cin.getline(passPhrase, MAX_PHRASE_LENGTH); cout << "\nPlaintext: "; cin.getline(plaintext, 1024); string ciphertext = EncryptString(plaintext, passPhrase); cout << "\nCiphertext: " << ciphertext << endl; string decrypted = DecryptString(ciphertext.c_str(), passPhrase); cout << "\nDecrypted: " << decrypted << endl; return 0; } else if (command == "e64") Base64Encode(argv[2], argv[3]); else if (command == "d64") Base64Decode(argv[2], argv[3]); else if (command == "e16") HexEncode(argv[2], argv[3]); else if (command == "d16") HexDecode(argv[2], argv[3]); else if (command == "e" || command == "d") { char passPhrase[MAX_PHRASE_LENGTH]; cout << "Passphrase: "; cin.getline(passPhrase, MAX_PHRASE_LENGTH); if (command == "e") EncryptFile(argv[2], argv[3], passPhrase); else DecryptFile(argv[2], argv[3], passPhrase); } else if (command == "ss") { char seed[1024]; cout << "\nRandom Seed: "; ws(cin); cin.getline(seed, 1024); SecretShareFile(atoi(argv[2]), atoi(argv[3]), argv[4], seed); } else if (command == "sr") SecretRecoverFile(argc-3, argv[2], argv+3); else if (command == "id") InformationDisperseFile(atoi(argv[2]), atoi(argv[3]), argv[4]); else if (command == "ir") InformationRecoverFile(argc-3, argv[2], argv+3); else if (command == "v" || command == "vv") return !Validate(argc>2 ? atoi(argv[2]) : 0, argv[1][1] == 'v', argc>3 ? argv[3] : NULL); else if (command == "b") BenchmarkAll(argc<3 ? 1 : atof(argv[2]), argc<4 ? 0 : atof(argv[3])*1e9); else if (command == "b2") BenchmarkAll2(argc<3 ? 1 : atof(argv[2]), argc<4 ? 0 : atof(argv[3])*1e9); else if (command == "z") GzipFile(argv[3], argv[4], argv[2][0]-'0'); else if (command == "u") GunzipFile(argv[2], argv[3]); else if (command == "fips") FIPS140_SampleApplication(); else if (command == "fips-rand") FIPS140_GenerateRandomFiles(); else if (command == "ft") ForwardTcpPort(argv[2], argv[3], argv[4]); else if (command == "a") { if (AdhocTest) return (*AdhocTest)(argc, argv); else { cerr << "AdhocTest not defined.\n"; return 1; } } else if (command == "hmac") HmacFile(argv[2], argv[3]); else if (command == "ae") AES_CTR_Encrypt(argv[2], argv[3], argv[4], argv[5]); else if (command == "h") { FileSource usage("TestData/usage.dat", true, new FileSink(cout)); return 1; } else if (command == "V") { cout << CRYPTOPP_VERSION / 100 << '.' << (CRYPTOPP_VERSION % 100) / 10 << '.' << CRYPTOPP_VERSION % 10 << endl; } else { cerr << "Unrecognized command. Run \"cryptest h\" to obtain usage information.\n"; return 1; } return 0; } catch(CryptoPP::Exception &e) { cout << "\nCryptoPP::Exception caught: " << e.what() << endl; return -1; } catch(std::exception &e) { cout << "\nstd::exception caught: " << e.what() << endl; return -2; } } void FIPS140_GenerateRandomFiles() { #ifdef OS_RNG_AVAILABLE DefaultAutoSeededRNG rng; RandomNumberStore store(rng, ULONG_MAX); for (unsigned int i=0; i<100000; i++) store.TransferTo(FileSink((IntToString(i) + ".rnd").c_str()).Ref(), 20000); #else cout << "OS provided RNG not available.\n"; exit(-1); #endif } SecByteBlock HexDecodeString(const char *hex) { StringSource ss(hex, true, new HexDecoder); SecByteBlock result((size_t)ss.MaxRetrievable()); ss.Get(result, result.size()); return result; } void GenerateRSAKey(unsigned int keyLength, const char *privFilename, const char *pubFilename, const char *seed) { RandomPool randPool; randPool.IncorporateEntropy((byte *)seed, strlen(seed)); RSAES_OAEP_SHA_Decryptor priv(randPool, keyLength); HexEncoder privFile(new FileSink(privFilename)); priv.DEREncode(privFile); privFile.MessageEnd(); RSAES_OAEP_SHA_Encryptor pub(priv); HexEncoder pubFile(new FileSink(pubFilename)); pub.DEREncode(pubFile); pubFile.MessageEnd(); } string RSAEncryptString(const char *pubFilename, const char *seed, const char *message) { FileSource pubFile(pubFilename, true, new HexDecoder); RSAES_OAEP_SHA_Encryptor pub(pubFile); RandomPool randPool; randPool.IncorporateEntropy((byte *)seed, strlen(seed)); string result; StringSource(message, true, new PK_EncryptorFilter(randPool, pub, new HexEncoder(new StringSink(result)))); return result; } string RSADecryptString(const char *privFilename, const char *ciphertext) { FileSource privFile(privFilename, true, new HexDecoder); RSAES_OAEP_SHA_Decryptor priv(privFile); string result; StringSource(ciphertext, true, new HexDecoder(new PK_DecryptorFilter(GlobalRNG(), priv, new StringSink(result)))); return result; } void RSASignFile(const char *privFilename, const char *messageFilename, const char *signatureFilename) { FileSource privFile(privFilename, true, new HexDecoder); RSASS::Signer priv(privFile); FileSource f(messageFilename, true, new SignerFilter(GlobalRNG(), priv, new HexEncoder(new FileSink(signatureFilename)))); } bool RSAVerifyFile(const char *pubFilename, const char *messageFilename, const char *signatureFilename) { FileSource pubFile(pubFilename, true, new HexDecoder); RSASS::Verifier pub(pubFile); FileSource signatureFile(signatureFilename, true, new HexDecoder); if (signatureFile.MaxRetrievable() != pub.SignatureLength()) return false; SecByteBlock signature(pub.SignatureLength()); signatureFile.Get(signature, signature.size()); VerifierFilter *verifierFilter = new VerifierFilter(pub); verifierFilter->Put(signature, pub.SignatureLength()); FileSource f(messageFilename, true, verifierFilter); return verifierFilter->GetLastResult(); } void DigestFile(const char *filename) { SHA1 sha; RIPEMD160 ripemd; SHA256 sha256; Tiger tiger; SHA512 sha512; Whirlpool whirlpool; vector_member_ptrs filters(6); filters[0].reset(new HashFilter(sha)); filters[1].reset(new HashFilter(ripemd)); filters[2].reset(new HashFilter(tiger)); filters[3].reset(new HashFilter(sha256)); filters[4].reset(new HashFilter(sha512)); filters[5].reset(new HashFilter(whirlpool)); auto_ptr channelSwitch(new ChannelSwitch); size_t i; for (i=0; iAddDefaultRoute(*filters[i]); FileSource(filename, true, channelSwitch.release()); HexEncoder encoder(new FileSink(cout), false); for (i=0; iAlgorithmName() << ": "; filters[i]->TransferTo(encoder); cout << "\n"; } } void HmacFile(const char *hexKey, const char *file) { member_ptr mac; if (strcmp(hexKey, "selftest") == 0) { cerr << "Computing HMAC/SHA1 value for self test.\n"; mac.reset(NewIntegrityCheckingMAC()); } else { std::string decodedKey; StringSource(hexKey, true, new HexDecoder(new StringSink(decodedKey))); mac.reset(new HMAC((const byte *)decodedKey.data(), decodedKey.size())); } FileSource(file, true, new HashFilter(*mac, new HexEncoder(new FileSink(cout)))); } void AES_CTR_Encrypt(const char *hexKey, const char *hexIV, const char *infile, const char *outfile) { SecByteBlock key = HexDecodeString(hexKey); SecByteBlock iv = HexDecodeString(hexIV); CTR_Mode::Encryption aes(key, key.size(), iv); FileSource(infile, true, new StreamTransformationFilter(aes, new FileSink(outfile))); } string EncryptString(const char *instr, const char *passPhrase) { string outstr; DefaultEncryptorWithMAC encryptor(passPhrase, new HexEncoder(new StringSink(outstr))); encryptor.Put((byte *)instr, strlen(instr)); encryptor.MessageEnd(); return outstr; } string DecryptString(const char *instr, const char *passPhrase) { string outstr; HexDecoder decryptor(new DefaultDecryptorWithMAC(passPhrase, new StringSink(outstr))); decryptor.Put((byte *)instr, strlen(instr)); decryptor.MessageEnd(); return outstr; } void EncryptFile(const char *in, const char *out, const char *passPhrase) { FileSource f(in, true, new DefaultEncryptorWithMAC(passPhrase, new FileSink(out))); } void DecryptFile(const char *in, const char *out, const char *passPhrase) { FileSource f(in, true, new DefaultDecryptorWithMAC(passPhrase, new FileSink(out))); } void SecretShareFile(int threshold, int nShares, const char *filename, const char *seed) { assert(nShares<=1000); RandomPool rng; rng.IncorporateEntropy((byte *)seed, strlen(seed)); ChannelSwitch *channelSwitch; FileSource source(filename, false, new SecretSharing(rng, threshold, nShares, channelSwitch = new ChannelSwitch)); vector_member_ptrs fileSinks(nShares); string channel; for (int i=0; i(i); fileSinks[i]->Put((byte *)channel.data(), 4); channelSwitch->AddRoute(channel, *fileSinks[i], DEFAULT_CHANNEL); } source.PumpAll(); } void SecretRecoverFile(int threshold, const char *outFilename, char *const *inFilenames) { assert(threshold<=1000); SecretRecovery recovery(threshold, new FileSink(outFilename)); vector_member_ptrs fileSources(threshold); SecByteBlock channel(4); int i; for (i=0; iPump(4); fileSources[i]->Get(channel, 4); fileSources[i]->Attach(new ChannelSwitch(recovery, string((char *)channel.begin(), 4))); } while (fileSources[0]->Pump(256)) for (i=1; iPump(256); for (i=0; iPumpAll(); } void InformationDisperseFile(int threshold, int nShares, const char *filename) { assert(nShares<=1000); ChannelSwitch *channelSwitch; FileSource source(filename, false, new InformationDispersal(threshold, nShares, channelSwitch = new ChannelSwitch)); vector_member_ptrs fileSinks(nShares); string channel; for (int i=0; i(i); fileSinks[i]->Put((byte *)channel.data(), 4); channelSwitch->AddRoute(channel, *fileSinks[i], DEFAULT_CHANNEL); } source.PumpAll(); } void InformationRecoverFile(int threshold, const char *outFilename, char *const *inFilenames) { assert(threshold<=1000); InformationRecovery recovery(threshold, new FileSink(outFilename)); vector_member_ptrs fileSources(threshold); SecByteBlock channel(4); int i; for (i=0; iPump(4); fileSources[i]->Get(channel, 4); fileSources[i]->Attach(new ChannelSwitch(recovery, string((char *)channel.begin(), 4))); } while (fileSources[0]->Pump(256)) for (i=1; iPump(256); for (i=0; iPumpAll(); } void GzipFile(const char *in, const char *out, int deflate_level) { // FileSource(in, true, new Gzip(new FileSink(out), deflate_level)); // use a filter graph to compare decompressed data with original // // Source ----> Gzip ------> Sink // \ | // \ Gunzip // \ | // \ v // > ComparisonFilter EqualityComparisonFilter comparison; Gunzip gunzip(new ChannelSwitch(comparison, "0")); gunzip.SetAutoSignalPropagation(0); FileSink sink(out); ChannelSwitch *cs; Gzip gzip(cs = new ChannelSwitch(sink), deflate_level); cs->AddDefaultRoute(gunzip); cs = new ChannelSwitch(gzip); cs->AddDefaultRoute(comparison, "1"); FileSource source(in, true, cs); comparison.ChannelMessageSeriesEnd("0"); comparison.ChannelMessageSeriesEnd("1"); } void GunzipFile(const char *in, const char *out) { FileSource(in, true, new Gunzip(new FileSink(out))); } void Base64Encode(const char *in, const char *out) { FileSource(in, true, new Base64Encoder(new FileSink(out))); } void Base64Decode(const char *in, const char *out) { FileSource(in, true, new Base64Decoder(new FileSink(out))); } void HexEncode(const char *in, const char *out) { FileSource(in, true, new HexEncoder(new FileSink(out))); } void HexDecode(const char *in, const char *out) { FileSource(in, true, new HexDecoder(new FileSink(out))); } void ForwardTcpPort(const char *sourcePortName, const char *destinationHost, const char *destinationPortName) { #ifdef SOCKETS_AVAILABLE SocketsInitializer sockInit; Socket sockListen, sockSource, sockDestination; int sourcePort = Socket::PortNameToNumber(sourcePortName); int destinationPort = Socket::PortNameToNumber(destinationPortName); sockListen.Create(); sockListen.Bind(sourcePort); setsockopt(sockListen, IPPROTO_TCP, TCP_NODELAY, "\x01", 1); cout << "Listing on port " << sourcePort << ".\n"; sockListen.Listen(); sockListen.Accept(sockSource); cout << "Connection accepted on port " << sourcePort << ".\n"; sockListen.CloseSocket(); cout << "Making connection to " << destinationHost << ", port " << destinationPort << ".\n"; sockDestination.Create(); sockDestination.Connect(destinationHost, destinationPort); cout << "Connection made to " << destinationHost << ", starting to forward.\n"; SocketSource out(sockSource, false, new SocketSink(sockDestination)); SocketSource in(sockDestination, false, new SocketSink(sockSource)); WaitObjectContainer waitObjects; while (!(in.SourceExhausted() && out.SourceExhausted())) { waitObjects.Clear(); out.GetWaitObjects(waitObjects, CallStack("ForwardTcpPort - out", NULL)); in.GetWaitObjects(waitObjects, CallStack("ForwardTcpPort - in", NULL)); waitObjects.Wait(INFINITE_TIME); if (!out.SourceExhausted()) { cout << "o" << flush; out.PumpAll2(false); if (out.SourceExhausted()) cout << "EOF received on source socket.\n"; } if (!in.SourceExhausted()) { cout << "i" << flush; in.PumpAll2(false); if (in.SourceExhausted()) cout << "EOF received on destination socket.\n"; } } #else cout << "Socket support was not enabled at compile time.\n"; exit(-1); #endif } bool Validate(int alg, bool thorough, const char *seedInput) { bool result; std::string seed = seedInput ? std::string(seedInput) : IntToString(time(NULL)); seed.resize(16); cout << "Using seed: " << seed << endl << endl; s_globalRNG.SetKeyWithIV((byte *)seed.data(), 16, (byte *)seed.data()); switch (alg) { case 0: result = ValidateAll(thorough); break; case 1: result = TestSettings(); break; case 2: result = TestOS_RNG(); break; case 3: result = ValidateMD5(); break; case 4: result = ValidateSHA(); break; case 5: result = ValidateDES(); break; case 6: result = ValidateIDEA(); break; case 7: result = ValidateARC4(); break; case 8: result = ValidateRC5(); break; case 9: result = ValidateBlowfish(); break; // case 10: result = ValidateDiamond2(); break; case 11: result = ValidateThreeWay(); break; case 12: result = ValidateBBS(); break; case 13: result = ValidateDH(); break; case 14: result = ValidateRSA(); break; case 15: result = ValidateElGamal(); break; case 16: result = ValidateDSA(thorough); break; // case 17: result = ValidateHAVAL(); break; case 18: result = ValidateSAFER(); break; case 19: result = ValidateLUC(); break; case 20: result = ValidateRabin(); break; // case 21: result = ValidateBlumGoldwasser(); break; case 22: result = ValidateECP(); break; case 23: result = ValidateEC2N(); break; // case 24: result = ValidateMD5MAC(); break; case 25: result = ValidateGOST(); break; case 26: result = ValidateTiger(); break; case 27: result = ValidateRIPEMD(); break; case 28: result = ValidateHMAC(); break; // case 29: result = ValidateXMACC(); break; case 30: result = ValidateSHARK(); break; case 32: result = ValidateLUC_DH(); break; case 33: result = ValidateLUC_DL(); break; case 34: result = ValidateSEAL(); break; case 35: result = ValidateCAST(); break; case 36: result = ValidateSquare(); break; case 37: result = ValidateRC2(); break; case 38: result = ValidateRC6(); break; case 39: result = ValidateMARS(); break; case 40: result = ValidateRW(); break; case 41: result = ValidateMD2(); break; case 42: result = ValidateNR(); break; case 43: result = ValidateMQV(); break; case 44: result = ValidateRijndael(); break; case 45: result = ValidateTwofish(); break; case 46: result = ValidateSerpent(); break; case 47: result = ValidateCipherModes(); break; case 48: result = ValidateCRC32(); break; case 49: result = ValidateECDSA(); break; case 50: result = ValidateXTR_DH(); break; case 51: result = ValidateSKIPJACK(); break; case 52: result = ValidateSHA2(); break; case 53: result = ValidatePanama(); break; case 54: result = ValidateAdler32(); break; case 55: result = ValidateMD4(); break; case 56: result = ValidatePBKDF(); break; case 57: result = ValidateESIGN(); break; case 58: result = ValidateDLIES(); break; case 59: result = ValidateBaseCode(); break; case 60: result = ValidateSHACAL2(); break; case 61: result = ValidateCamellia(); break; case 62: result = ValidateWhirlpool(); break; case 63: result = ValidateTTMAC(); break; case 64: result = ValidateSalsa(); break; case 65: result = ValidateSosemanuk(); break; case 66: result = ValidateVMAC(); break; case 67: result = ValidateCCM(); break; case 68: result = ValidateGCM(); break; case 69: result = ValidateCMAC(); break; default: return false; } time_t endTime = time(NULL); cout << "\nTest ended at " << asctime(localtime(&endTime)); cout << "Seed used was: " << seed << endl; return result; } armory-0.92.3/cppForSwig/cryptopp/serpent.h0000755000000000000000000000234312414772654017431 0ustar rootroot#ifndef CRYPTOPP_SERPENT_H #define CRYPTOPP_SERPENT_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct Serpent_Info : public FixedBlockSize<16>, public VariableKeyLength<16, 0, 32>, public FixedRounds<32> { static const char *StaticAlgorithmName() {return "Serpent";} }; /// Serpent class Serpent : public Serpent_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); protected: FixedSizeSecBlock m_key; }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef Serpent::Encryption SerpentEncryption; typedef Serpent::Decryption SerpentDecryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/rabin.h0000755000000000000000000000611212414772654017042 0ustar rootroot#ifndef CRYPTOPP_RABIN_H #define CRYPTOPP_RABIN_H /** \file */ #include "oaep.h" #include "pssr.h" #include "integer.h" NAMESPACE_BEGIN(CryptoPP) //! _ class RabinFunction : public TrapdoorFunction, public PublicKey { typedef RabinFunction ThisClass; public: void Initialize(const Integer &n, const Integer &r, const Integer &s) {m_n = n; m_r = r; m_s = s;} void BERDecode(BufferedTransformation &bt); void DEREncode(BufferedTransformation &bt) const; Integer ApplyFunction(const Integer &x) const; Integer PreimageBound() const {return m_n;} Integer ImageBound() const {return m_n;} bool Validate(RandomNumberGenerator &rng, unsigned int level) const; bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; void AssignFrom(const NameValuePairs &source); const Integer& GetModulus() const {return m_n;} const Integer& GetQuadraticResidueModPrime1() const {return m_r;} const Integer& GetQuadraticResidueModPrime2() const {return m_s;} void SetModulus(const Integer &n) {m_n = n;} void SetQuadraticResidueModPrime1(const Integer &r) {m_r = r;} void SetQuadraticResidueModPrime2(const Integer &s) {m_s = s;} protected: Integer m_n, m_r, m_s; }; //! _ class InvertibleRabinFunction : public RabinFunction, public TrapdoorFunctionInverse, public PrivateKey { typedef InvertibleRabinFunction ThisClass; public: void Initialize(const Integer &n, const Integer &r, const Integer &s, const Integer &p, const Integer &q, const Integer &u) {m_n = n; m_r = r; m_s = s; m_p = p; m_q = q; m_u = u;} void Initialize(RandomNumberGenerator &rng, unsigned int keybits) {GenerateRandomWithKeySize(rng, keybits);} void BERDecode(BufferedTransformation &bt); void DEREncode(BufferedTransformation &bt) const; Integer CalculateInverse(RandomNumberGenerator &rng, const Integer &x) const; bool Validate(RandomNumberGenerator &rng, unsigned int level) const; bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; void AssignFrom(const NameValuePairs &source); /*! parameters: (ModulusSize) */ void GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg); const Integer& GetPrime1() const {return m_p;} const Integer& GetPrime2() const {return m_q;} const Integer& GetMultiplicativeInverseOfPrime2ModPrime1() const {return m_u;} void SetPrime1(const Integer &p) {m_p = p;} void SetPrime2(const Integer &q) {m_q = q;} void SetMultiplicativeInverseOfPrime2ModPrime1(const Integer &u) {m_u = u;} protected: Integer m_p, m_q, m_u; }; //! Rabin struct Rabin { static std::string StaticAlgorithmName() {return "Rabin-Crypto++Variant";} typedef RabinFunction PublicKey; typedef InvertibleRabinFunction PrivateKey; }; //! Rabin encryption template struct RabinES : public TF_ES { }; //! Rabin signature template struct RabinSS : public TF_SS { }; // More typedefs for backwards compatibility class SHA1; typedef RabinES >::Decryptor RabinDecryptor; typedef RabinES >::Encryptor RabinEncryptor; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/seal.h0000755000000000000000000000263612414772654016702 0ustar rootroot#ifndef CRYPTOPP_SEAL_H #define CRYPTOPP_SEAL_H #include "strciphr.h" NAMESPACE_BEGIN(CryptoPP) //! _ template struct SEAL_Info : public FixedKeyLength<20, SimpleKeyingInterface::INTERNALLY_GENERATED_IV, 4> { static const char *StaticAlgorithmName() {return B::ToEnum() == LITTLE_ENDIAN_ORDER ? "SEAL-3.0-LE" : "SEAL-3.0-BE";} }; template class CRYPTOPP_NO_VTABLE SEAL_Policy : public AdditiveCipherConcretePolicy, public SEAL_Info { protected: void CipherSetKey(const NameValuePairs ¶ms, const byte *key, size_t length); void OperateKeystream(KeystreamOperation operation, byte *output, const byte *input, size_t iterationCount); void CipherResynchronize(byte *keystreamBuffer, const byte *IV, size_t length); bool CipherIsRandomAccess() const {return true;} void SeekToIteration(lword iterationCount); private: FixedSizeSecBlock m_T; FixedSizeSecBlock m_S; SecBlock m_R; word32 m_startCount, m_iterationsPerCount; word32 m_outsideCounter, m_insideCounter; }; //! SEAL template struct SEAL : public SEAL_Info, public SymmetricCipherDocumentation { typedef SymmetricCipherFinal, AdditiveCipherTemplate<> >, SEAL_Info > Encryption; typedef Encryption Decryption; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/idea.cpp0000755000000000000000000000742312414772654017212 0ustar rootroot// idea.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "idea.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) static const int IDEA_KEYLEN=(6*IDEA::ROUNDS+4); // key schedule length in # of word16s #define low16(x) ((x)&0xffff) // compiler should be able to optimize this away if word is 16 bits #define high16(x) ((x)>>16) CRYPTOPP_COMPILE_ASSERT(sizeof(IDEA::Word) >= 2); // should use an inline function but macros are still faster in MSVC 4.0 #define DirectMUL(a,b) \ { \ assert(b <= 0xffff); \ \ word32 p=(word32)low16(a)*b; \ \ if (p) \ { \ p = low16(p) - high16(p); \ a = (IDEA::Word)p - (IDEA::Word)high16(p); \ } \ else \ a = 1-a-b; \ } #ifdef IDEA_LARGECACHE volatile bool IDEA::Base::tablesBuilt = false; word16 IDEA::Base::log[0x10000]; word16 IDEA::Base::antilog[0x10000]; void IDEA::Base::BuildLogTables() { if (tablesBuilt) return; else { tablesBuilt = true; IDEA::Word x=1; word32 i; for (i=0; i<0x10000; i++) { antilog[i] = (word16)x; DirectMUL(x, 3); } for (i=0; i<0x10000; i++) log[antilog[i]] = (word16)i; } } void IDEA::Base::LookupKeyLogs() { IDEA::Word* Z=key; int r=ROUNDS; do { Z[0] = log[Z[0]]; Z[3] = log[Z[3]]; Z[4] = log[Z[4]]; Z[5] = log[Z[5]]; Z+=6; } while (--r); Z[0] = log[Z[0]]; Z[3] = log[Z[3]]; } inline void IDEA::Base::LookupMUL(IDEA::Word &a, IDEA::Word b) { a = antilog[low16(log[low16(a)]+b)]; } #endif // IDEA_LARGECACHE void IDEA::Base::UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs &) { AssertValidKeyLength(length); #ifdef IDEA_LARGECACHE BuildLogTables(); #endif EnKey(userKey); if (!IsForwardTransformation()) DeKey(); #ifdef IDEA_LARGECACHE LookupKeyLogs(); #endif } void IDEA::Base::EnKey (const byte *userKey) { unsigned int i; for (i=0; i<8; i++) m_key[i] = ((IDEA::Word)userKey[2*i]<<8) | userKey[2*i+1]; for (; i> 7)); } } static IDEA::Word MulInv(IDEA::Word x) { IDEA::Word y=x; for (unsigned i=0; i<15; i++) { DirectMUL(y,low16(y)); DirectMUL(y,x); } return low16(y); } static inline IDEA::Word AddInv(IDEA::Word x) { return low16(0-x); } void IDEA::Base::DeKey() { FixedSizeSecBlock tempkey; size_t i; for (i=0; i0)]); tempkey[i*6+2] = AddInv(m_key[(ROUNDS-i)*6+2-(i>0)]); tempkey[i*6+3] = MulInv(m_key[(ROUNDS-i)*6+3]); tempkey[i*6+4] = m_key[(ROUNDS-1-i)*6+4]; tempkey[i*6+5] = m_key[(ROUNDS-1-i)*6+5]; } tempkey[i*6+0] = MulInv(m_key[(ROUNDS-i)*6+0]); tempkey[i*6+1] = AddInv(m_key[(ROUNDS-i)*6+1]); tempkey[i*6+2] = AddInv(m_key[(ROUNDS-i)*6+2]); tempkey[i*6+3] = MulInv(m_key[(ROUNDS-i)*6+3]); m_key = tempkey; } #ifdef IDEA_LARGECACHE #define MUL(a,b) LookupMUL(a,b) #else #define MUL(a,b) DirectMUL(a,b) #endif void IDEA::Base::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { typedef BlockGetAndPut Block; const IDEA::Word *key = m_key; IDEA::Word x0,x1,x2,x3,t0,t1; Block::Get(inBlock)(x0)(x1)(x2)(x3); for (unsigned int i=0; i NAMESPACE_BEGIN(CryptoPP) //! _ class LowFirstBitReader { public: LowFirstBitReader(BufferedTransformation &store) : m_store(store), m_buffer(0), m_bitsBuffered(0) {} // unsigned long BitsLeft() const {return m_store.MaxRetrievable() * 8 + m_bitsBuffered;} unsigned int BitsBuffered() const {return m_bitsBuffered;} unsigned long PeekBuffer() const {return m_buffer;} bool FillBuffer(unsigned int length); unsigned long PeekBits(unsigned int length); void SkipBits(unsigned int length); unsigned long GetBits(unsigned int length); private: BufferedTransformation &m_store; unsigned long m_buffer; unsigned int m_bitsBuffered; }; struct CodeLessThan; //! Huffman Decoder class HuffmanDecoder { public: typedef unsigned int code_t; typedef unsigned int value_t; enum {MAX_CODE_BITS = sizeof(code_t)*8}; class Err : public Exception {public: Err(const std::string &what) : Exception(INVALID_DATA_FORMAT, "HuffmanDecoder: " + what) {}}; HuffmanDecoder() {} HuffmanDecoder(const unsigned int *codeBitLengths, unsigned int nCodes) {Initialize(codeBitLengths, nCodes);} void Initialize(const unsigned int *codeBitLengths, unsigned int nCodes); unsigned int Decode(code_t code, /* out */ value_t &value) const; bool Decode(LowFirstBitReader &reader, value_t &value) const; private: friend struct CodeLessThan; struct CodeInfo { CodeInfo(code_t code=0, unsigned int len=0, value_t value=0) : code(code), len(len), value(value) {} inline bool operator<(const CodeInfo &rhs) const {return code < rhs.code;} code_t code; unsigned int len; value_t value; }; struct LookupEntry { unsigned int type; union { value_t value; const CodeInfo *begin; }; union { unsigned int len; const CodeInfo *end; }; }; static code_t NormalizeCode(code_t code, unsigned int codeBits); void FillCacheEntry(LookupEntry &entry, code_t normalizedCode) const; unsigned int m_maxCodeBits, m_cacheBits, m_cacheMask, m_normalizedCacheMask; std::vector > m_codeToValue; mutable std::vector > m_cache; }; //! DEFLATE (RFC 1951) decompressor class Inflator : public AutoSignaling { public: class Err : public Exception { public: Err(ErrorType e, const std::string &s) : Exception(e, s) {} }; class UnexpectedEndErr : public Err {public: UnexpectedEndErr() : Err(INVALID_DATA_FORMAT, "Inflator: unexpected end of compressed block") {}}; class BadBlockErr : public Err {public: BadBlockErr() : Err(INVALID_DATA_FORMAT, "Inflator: error in compressed block") {}}; /*! \param repeat decompress multiple compressed streams in series \param autoSignalPropagation 0 to turn off MessageEnd signal */ Inflator(BufferedTransformation *attachment = NULL, bool repeat = false, int autoSignalPropagation = -1); void IsolatedInitialize(const NameValuePairs ¶meters); size_t Put2(const byte *inString, size_t length, int messageEnd, bool blocking); bool IsolatedFlush(bool hardFlush, bool blocking); virtual unsigned int GetLog2WindowSize() const {return 15;} protected: ByteQueue m_inQueue; private: virtual unsigned int MaxPrestreamHeaderSize() const {return 0;} virtual void ProcessPrestreamHeader() {} virtual void ProcessDecompressedData(const byte *string, size_t length) {AttachedTransformation()->Put(string, length);} virtual unsigned int MaxPoststreamTailSize() const {return 0;} virtual void ProcessPoststreamTail() {} void ProcessInput(bool flush); void DecodeHeader(); bool DecodeBody(); void FlushOutput(); void OutputByte(byte b); void OutputString(const byte *string, size_t length); void OutputPast(unsigned int length, unsigned int distance); static const HuffmanDecoder *FixedLiteralDecoder(); static const HuffmanDecoder *FixedDistanceDecoder(); const HuffmanDecoder& GetLiteralDecoder() const; const HuffmanDecoder& GetDistanceDecoder() const; enum State {PRE_STREAM, WAIT_HEADER, DECODING_BODY, POST_STREAM, AFTER_END}; State m_state; bool m_repeat, m_eof, m_wrappedAround; byte m_blockType; word16 m_storedLen; enum NextDecode {LITERAL, LENGTH_BITS, DISTANCE, DISTANCE_BITS}; NextDecode m_nextDecode; unsigned int m_literal, m_distance; // for LENGTH_BITS or DISTANCE_BITS HuffmanDecoder m_dynamicLiteralDecoder, m_dynamicDistanceDecoder; LowFirstBitReader m_reader; SecByteBlock m_window; size_t m_current, m_lastFlush; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/simple.cpp0000755000000000000000000000031412414772654017571 0ustar rootroot// simple.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "simple.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/base64.h0000755000000000000000000000162012414772654017032 0ustar rootroot#ifndef CRYPTOPP_BASE64_H #define CRYPTOPP_BASE64_H #include "basecode.h" NAMESPACE_BEGIN(CryptoPP) //! Base64 Encoder Class class Base64Encoder : public SimpleProxyFilter { public: Base64Encoder(BufferedTransformation *attachment = NULL, bool insertLineBreaks = true, int maxLineLength = 72) : SimpleProxyFilter(new BaseN_Encoder(new Grouper), attachment) { IsolatedInitialize(MakeParameters(Name::InsertLineBreaks(), insertLineBreaks)(Name::MaxLineLength(), maxLineLength)); } void IsolatedInitialize(const NameValuePairs ¶meters); }; //! Base64 Decoder Class class Base64Decoder : public BaseN_Decoder { public: Base64Decoder(BufferedTransformation *attachment = NULL) : BaseN_Decoder(GetDecodingLookupArray(), 6, attachment) {} void IsolatedInitialize(const NameValuePairs ¶meters) {} private: static const int * CRYPTOPP_API GetDecodingLookupArray(); }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/authenc.cpp0000755000000000000000000001122312414772654017730 0ustar rootroot// authenc.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "authenc.h" NAMESPACE_BEGIN(CryptoPP) void AuthenticatedSymmetricCipherBase::AuthenticateData(const byte *input, size_t len) { unsigned int blockSize = AuthenticationBlockSize(); unsigned int &num = m_bufferedDataLength; byte* data = m_buffer.begin(); if (num != 0) // process left over data { if (num+len >= blockSize) { memcpy(data+num, input, blockSize-num); AuthenticateBlocks(data, blockSize); input += (blockSize-num); len -= (blockSize-num); num = 0; // drop through and do the rest } else { memcpy(data+num, input, len); num += (unsigned int)len; return; } } // now process the input data in blocks of blockSize bytes and save the leftovers to m_data if (len >= blockSize) { size_t leftOver = AuthenticateBlocks(input, len); input += (len - leftOver); len = leftOver; } memcpy(data, input, len); num = (unsigned int)len; } void AuthenticatedSymmetricCipherBase::SetKey(const byte *userKey, size_t keylength, const NameValuePairs ¶ms) { m_bufferedDataLength = 0; m_state = State_Start; SetKeyWithoutResync(userKey, keylength, params); m_state = State_KeySet; size_t length; const byte *iv = GetIVAndThrowIfInvalid(params, length); if (iv) Resynchronize(iv, (int)length); } void AuthenticatedSymmetricCipherBase::Resynchronize(const byte *iv, int length) { if (m_state < State_KeySet) throw BadState(AlgorithmName(), "Resynchronize", "key is set"); m_bufferedDataLength = 0; m_totalHeaderLength = m_totalMessageLength = m_totalFooterLength = 0; m_state = State_KeySet; Resync(iv, this->ThrowIfInvalidIVLength(length)); m_state = State_IVSet; } void AuthenticatedSymmetricCipherBase::Update(const byte *input, size_t length) { if (length == 0) return; switch (m_state) { case State_Start: case State_KeySet: throw BadState(AlgorithmName(), "Update", "setting key and IV"); case State_IVSet: AuthenticateData(input, length); m_totalHeaderLength += length; break; case State_AuthUntransformed: case State_AuthTransformed: AuthenticateLastConfidentialBlock(); m_bufferedDataLength = 0; m_state = State_AuthFooter; // fall through case State_AuthFooter: AuthenticateData(input, length); m_totalFooterLength += length; break; default: assert(false); } } void AuthenticatedSymmetricCipherBase::ProcessData(byte *outString, const byte *inString, size_t length) { m_totalMessageLength += length; if (m_state >= State_IVSet && m_totalMessageLength > MaxMessageLength()) throw InvalidArgument(AlgorithmName() + ": message length exceeds maximum"); reswitch: switch (m_state) { case State_Start: case State_KeySet: throw BadState(AlgorithmName(), "ProcessData", "setting key and IV"); case State_AuthFooter: throw BadState(AlgorithmName(), "ProcessData was called after footer input has started"); case State_IVSet: AuthenticateLastHeaderBlock(); m_bufferedDataLength = 0; m_state = AuthenticationIsOnPlaintext()==IsForwardTransformation() ? State_AuthUntransformed : State_AuthTransformed; goto reswitch; case State_AuthUntransformed: AuthenticateData(inString, length); AccessSymmetricCipher().ProcessData(outString, inString, length); break; case State_AuthTransformed: AccessSymmetricCipher().ProcessData(outString, inString, length); AuthenticateData(outString, length); break; default: assert(false); } } void AuthenticatedSymmetricCipherBase::TruncatedFinal(byte *mac, size_t macSize) { if (m_totalHeaderLength > MaxHeaderLength()) throw InvalidArgument(AlgorithmName() + ": header length of " + IntToString(m_totalHeaderLength) + " exceeds the maximum of " + IntToString(MaxHeaderLength())); if (m_totalFooterLength > MaxFooterLength()) { if (MaxFooterLength() == 0) throw InvalidArgument(AlgorithmName() + ": additional authenticated data (AAD) cannot be input after data to be encrypted or decrypted"); else throw InvalidArgument(AlgorithmName() + ": footer length of " + IntToString(m_totalFooterLength) + " exceeds the maximum of " + IntToString(MaxFooterLength())); } switch (m_state) { case State_Start: case State_KeySet: throw BadState(AlgorithmName(), "TruncatedFinal", "setting key and IV"); case State_IVSet: AuthenticateLastHeaderBlock(); m_bufferedDataLength = 0; // fall through case State_AuthUntransformed: case State_AuthTransformed: AuthenticateLastConfidentialBlock(); m_bufferedDataLength = 0; // fall through case State_AuthFooter: AuthenticateLastFooterBlock(mac, macSize); m_bufferedDataLength = 0; break; default: assert(false); } m_state = State_KeySet; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/validat3.cpp0000755000000000000000000006611412414772654020021 0ustar rootroot// validat3.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "validate.h" #define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1 #include "smartptr.h" #include "crc.h" #include "adler32.h" #include "md2.h" #include "md4.h" #include "md5.h" #include "sha.h" #include "tiger.h" #include "ripemd.h" #include "hmac.h" #include "ttmac.h" #include "integer.h" #include "pwdbased.h" #include "filters.h" #include "hex.h" #include "files.h" #include #include USING_NAMESPACE(CryptoPP) USING_NAMESPACE(std) struct HashTestTuple { HashTestTuple(const char *input, const char *output, unsigned int repeatTimes=1) : input((byte *)input), output((byte *)output), inputLen(strlen(input)), repeatTimes(repeatTimes) {} HashTestTuple(const char *input, unsigned int inputLen, const char *output, unsigned int repeatTimes) : input((byte *)input), output((byte *)output), inputLen(inputLen), repeatTimes(repeatTimes) {} const byte *input, *output; size_t inputLen; unsigned int repeatTimes; }; bool HashModuleTest(HashTransformation &md, const HashTestTuple *testSet, unsigned int testSetSize) { bool pass=true, fail; SecByteBlock digest(md.DigestSize()); for (unsigned int i=0; i XMACC_MD5; const byte keys[2][XMACC_MD5::KEYLENGTH]={ {0x00,0x11,0x22,0x33,0x44,0x55,0x66,0x77,0x88,0x99,0xaa,0xbb}, {0x01,0x23,0x45,0x67,0x89,0xab,0xcd,0xef,0xfe,0xdc,0xba,0x98}}; const word32 counters[2]={0xccddeeff, 0x76543210}; const char *TestVals[7]={ "", "a", "abc", "message digest", "abcdefghijklmnopqrstuvwxyz", "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", "12345678901234567890123456789012345678901234567890123456789012345678901234567890"}; const byte output[2][7][XMACC_MD5::DIGESTSIZE]={ {{0xcc,0xdd,0xef,0x00,0xfa,0x89,0x54,0x92,0x86,0x32,0xda,0x2a,0x3f,0x29,0xc5,0x52,0xa0,0x0d,0x05,0x13}, {0xcc,0xdd,0xef,0x01,0xae,0xdb,0x8b,0x7b,0x69,0x71,0xc7,0x91,0x71,0x48,0x9d,0x18,0xe7,0xdf,0x9d,0x5a}, {0xcc,0xdd,0xef,0x02,0x5e,0x01,0x2e,0x2e,0x4b,0xc3,0x83,0x62,0xc2,0xf4,0xe6,0x18,0x1c,0x44,0xaf,0xca}, {0xcc,0xdd,0xef,0x03,0x3e,0xa9,0xf1,0xe0,0x97,0x91,0xf8,0xe2,0xbe,0xe0,0xdf,0xf3,0x41,0x03,0xb3,0x5a}, {0xcc,0xdd,0xef,0x04,0x2e,0x6a,0x8d,0xb9,0x72,0xe3,0xce,0x9f,0xf4,0x28,0x45,0xe7,0xbc,0x80,0xa9,0xc7}, {0xcc,0xdd,0xef,0x05,0x1a,0xd5,0x40,0x78,0xfb,0x16,0x37,0xfc,0x7a,0x1d,0xce,0xb4,0x77,0x10,0xb2,0xa0}, {0xcc,0xdd,0xef,0x06,0x13,0x2f,0x11,0x47,0xd7,0x1b,0xb5,0x52,0x36,0x51,0x26,0xb0,0x96,0xd7,0x60,0x81}}, {{0x76,0x54,0x32,0x11,0xe9,0xcb,0x74,0x32,0x07,0x93,0xfe,0x01,0xdd,0x27,0xdb,0xde,0x6b,0x77,0xa4,0x56}, {0x76,0x54,0x32,0x12,0xcd,0x55,0x87,0x5c,0xc0,0x35,0x85,0x99,0x44,0x02,0xa5,0x0b,0x8c,0xe7,0x2c,0x68}, {0x76,0x54,0x32,0x13,0xac,0xfd,0x87,0x50,0xc3,0x8f,0xcd,0x58,0xaa,0xa5,0x7e,0x7a,0x25,0x63,0x26,0xd1}, {0x76,0x54,0x32,0x14,0xe3,0x30,0xf5,0xdd,0x27,0x2b,0x76,0x22,0x7f,0xaa,0x90,0x73,0x6a,0x48,0xdb,0x00}, {0x76,0x54,0x32,0x15,0xfc,0x57,0x00,0x20,0x7c,0x9d,0xf6,0x30,0x6f,0xbd,0x46,0x3e,0xfb,0x8a,0x2c,0x60}, {0x76,0x54,0x32,0x16,0xfb,0x0f,0xd3,0xdf,0x4c,0x4b,0xc3,0x05,0x9d,0x63,0x1e,0xba,0x25,0x2b,0xbe,0x35}, {0x76,0x54,0x32,0x17,0xc6,0xfe,0xe6,0x5f,0xb1,0x35,0x8a,0xf5,0x32,0x7a,0x80,0xbd,0xb8,0x72,0xee,0xae}}}; byte digest[XMACC_MD5::DIGESTSIZE]; bool pass=true, fail; cout << "\nXMACC/MD5 validation suite running...\n"; for (int k=0; k<2; k++) { XMACC_MD5 mac(keys[k], counters[k]); cout << "\nKEY: "; for (int j=0;j pbkdf; cout << "\nPKCS #12 PBKDF validation suite running...\n\n"; pass = TestPBKDF(pbkdf, testSet, sizeof(testSet)/sizeof(testSet[0])) && pass; } { // from draft-ietf-smime-password-03.txt, at http://www.imc.org/draft-ietf-smime-password PBKDF_TestTuple testSet[] = { {0, 5, "70617373776f7264", "1234567878563412", "D1DAA78615F287E6"}, {0, 500, "416C6C206E2D656E746974696573206D75737420636F6D6D756E69636174652077697468206F74686572206E2d656E74697469657320766961206E2D3120656E746974656568656568656573", "1234567878563412","6A8970BF68C92CAEA84A8DF28510858607126380CC47AB2D"} }; PKCS5_PBKDF2_HMAC pbkdf; cout << "\nPKCS #5 PBKDF2 validation suite running...\n\n"; pass = TestPBKDF(pbkdf, testSet, sizeof(testSet)/sizeof(testSet[0])) && pass; } return pass; } armory-0.92.3/cppForSwig/cryptopp/misc.h0000755000000000000000000010234012414772654016702 0ustar rootroot#ifndef CRYPTOPP_MISC_H #define CRYPTOPP_MISC_H #include "cryptlib.h" #include "smartptr.h" #include // for memcpy and memmove #ifdef _MSC_VER #if _MSC_VER >= 1400 // VC2005 workaround: disable declarations that conflict with winnt.h #define _interlockedbittestandset CRYPTOPP_DISABLED_INTRINSIC_1 #define _interlockedbittestandreset CRYPTOPP_DISABLED_INTRINSIC_2 #define _interlockedbittestandset64 CRYPTOPP_DISABLED_INTRINSIC_3 #define _interlockedbittestandreset64 CRYPTOPP_DISABLED_INTRINSIC_4 #include #undef _interlockedbittestandset #undef _interlockedbittestandreset #undef _interlockedbittestandset64 #undef _interlockedbittestandreset64 #define CRYPTOPP_FAST_ROTATE(x) 1 #elif _MSC_VER >= 1300 #define CRYPTOPP_FAST_ROTATE(x) ((x) == 32 | (x) == 64) #else #define CRYPTOPP_FAST_ROTATE(x) ((x) == 32) #endif #elif (defined(__MWERKS__) && TARGET_CPU_PPC) || \ (defined(__GNUC__) && (defined(_ARCH_PWR2) || defined(_ARCH_PWR) || defined(_ARCH_PPC) || defined(_ARCH_PPC64) || defined(_ARCH_COM))) #define CRYPTOPP_FAST_ROTATE(x) ((x) == 32) #elif defined(__GNUC__) && (CRYPTOPP_BOOL_X64 || CRYPTOPP_BOOL_X86) // depend on GCC's peephole optimization to generate rotate instructions #define CRYPTOPP_FAST_ROTATE(x) 1 #else #define CRYPTOPP_FAST_ROTATE(x) 0 #endif #ifdef __BORLANDC__ #include #endif #if defined(__GNUC__) && defined(__linux__) #define CRYPTOPP_BYTESWAP_AVAILABLE #include #endif NAMESPACE_BEGIN(CryptoPP) // ************** compile-time assertion *************** template struct CompileAssert { static char dummy[2*b-1]; }; #define CRYPTOPP_COMPILE_ASSERT(assertion) CRYPTOPP_COMPILE_ASSERT_INSTANCE(assertion, __LINE__) #if defined(CRYPTOPP_EXPORTS) || defined(CRYPTOPP_IMPORTS) #define CRYPTOPP_COMPILE_ASSERT_INSTANCE(assertion, instance) #else #define CRYPTOPP_COMPILE_ASSERT_INSTANCE(assertion, instance) static CompileAssert<(assertion)> CRYPTOPP_ASSERT_JOIN(cryptopp_assert_, instance) #endif #define CRYPTOPP_ASSERT_JOIN(X, Y) CRYPTOPP_DO_ASSERT_JOIN(X, Y) #define CRYPTOPP_DO_ASSERT_JOIN(X, Y) X##Y // ************** misc classes *************** class CRYPTOPP_DLL Empty { }; //! _ template class CRYPTOPP_NO_VTABLE TwoBases : public BASE1, public BASE2 { }; //! _ template class CRYPTOPP_NO_VTABLE ThreeBases : public BASE1, public BASE2, public BASE3 { }; template class ObjectHolder { protected: T m_object; }; class NotCopyable { public: NotCopyable() {} private: NotCopyable(const NotCopyable &); void operator=(const NotCopyable &); }; template struct NewObject { T* operator()() const {return new T;} }; /*! This function safely initializes a static object in a multithreaded environment without using locks (for portability). Note that if two threads call Ref() at the same time, they may get back different references, and one object may end up being memory leaked. This is by design. */ template , int instance=0> class Singleton { public: Singleton(F objectFactory = F()) : m_objectFactory(objectFactory) {} // prevent this function from being inlined CRYPTOPP_NOINLINE const T & Ref(CRYPTOPP_NOINLINE_DOTDOTDOT) const; private: F m_objectFactory; }; template const T & Singleton::Ref(CRYPTOPP_NOINLINE_DOTDOTDOT) const { static volatile simple_ptr s_pObject; T *p = s_pObject.m_p; if (p) return *p; T *newObject = m_objectFactory(); p = s_pObject.m_p; if (p) { delete newObject; return *p; } s_pObject.m_p = newObject; return *newObject; } // ************** misc functions *************** #if (!__STDC_WANT_SECURE_LIB__) inline void memcpy_s(void *dest, size_t sizeInBytes, const void *src, size_t count) { if (count > sizeInBytes) throw InvalidArgument("memcpy_s: buffer overflow"); memcpy(dest, src, count); } inline void memmove_s(void *dest, size_t sizeInBytes, const void *src, size_t count) { if (count > sizeInBytes) throw InvalidArgument("memmove_s: buffer overflow"); memmove(dest, src, count); } #if __BORLANDC__ >= 0x620 // C++Builder 2010 workaround: can't use std::memcpy_s because it doesn't allow 0 lengths #define memcpy_s CryptoPP::memcpy_s #define memmove_s CryptoPP::memmove_s #endif #endif inline void * memset_z(void *ptr, int value, size_t num) { // avoid extranous warning on GCC 4.3.2 Ubuntu 8.10 #if CRYPTOPP_GCC_VERSION >= 30001 if (__builtin_constant_p(num) && num==0) return ptr; #endif return memset(ptr, value, num); } // can't use std::min or std::max in MSVC60 or Cygwin 1.1.0 template inline const T& STDMIN(const T& a, const T& b) { return b < a ? b : a; } template inline const T1 UnsignedMin(const T1& a, const T2& b) { CRYPTOPP_COMPILE_ASSERT((sizeof(T1)<=sizeof(T2) && T2(-1)>0) || (sizeof(T1)>sizeof(T2) && T1(-1)>0)); assert(a==0 || a>0); // GCC workaround: get rid of the warning "comparison is always true due to limited range of data type" assert(b>=0); if (sizeof(T1)<=sizeof(T2)) return b < (T2)a ? (T1)b : a; else return (T1)b < a ? (T1)b : a; } template inline const T& STDMAX(const T& a, const T& b) { return a < b ? b : a; } #define RETURN_IF_NONZERO(x) size_t returnedValue = x; if (returnedValue) return returnedValue // this version of the macro is fastest on Pentium 3 and Pentium 4 with MSVC 6 SP5 w/ Processor Pack #define GETBYTE(x, y) (unsigned int)byte((x)>>(8*(y))) // these may be faster on other CPUs/compilers // #define GETBYTE(x, y) (unsigned int)(((x)>>(8*(y)))&255) // #define GETBYTE(x, y) (((byte *)&(x))[y]) #define CRYPTOPP_GET_BYTE_AS_BYTE(x, y) byte((x)>>(8*(y))) template unsigned int Parity(T value) { for (unsigned int i=8*sizeof(value)/2; i>0; i/=2) value ^= value >> i; return (unsigned int)value&1; } template unsigned int BytePrecision(const T &value) { if (!value) return 0; unsigned int l=0, h=8*sizeof(value); while (h-l > 8) { unsigned int t = (l+h)/2; if (value >> t) l = t; else h = t; } return h/8; } template unsigned int BitPrecision(const T &value) { if (!value) return 0; unsigned int l=0, h=8*sizeof(value); while (h-l > 1) { unsigned int t = (l+h)/2; if (value >> t) l = t; else h = t; } return h; } inline unsigned int TrailingZeros(word32 v) { #if defined(__GNUC__) && CRYPTOPP_GCC_VERSION >= 30400 return __builtin_ctz(v); #elif defined(_MSC_VER) && _MSC_VER >= 1400 unsigned long result; _BitScanForward(&result, v); return result; #else // from http://graphics.stanford.edu/~seander/bithacks.html#ZerosOnRightMultLookup static const int MultiplyDeBruijnBitPosition[32] = { 0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8, 31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9 }; return MultiplyDeBruijnBitPosition[((word32)((v & -v) * 0x077CB531U)) >> 27]; #endif } inline unsigned int TrailingZeros(word64 v) { #if defined(__GNUC__) && CRYPTOPP_GCC_VERSION >= 30400 return __builtin_ctzll(v); #elif defined(_MSC_VER) && _MSC_VER >= 1400 && (defined(_M_X64) || defined(_M_IA64)) unsigned long result; _BitScanForward64(&result, v); return result; #else return word32(v) ? TrailingZeros(word32(v)) : 32 + TrailingZeros(word32(v>>32)); #endif } template inline T Crop(T value, size_t size) { if (size < 8*sizeof(value)) return T(value & ((T(1) << size) - 1)); else return value; } template inline bool SafeConvert(T1 from, T2 &to) { to = (T2)from; if (from != to || (from > 0) != (to > 0)) return false; return true; } inline size_t BitsToBytes(size_t bitCount) { return ((bitCount+7)/(8)); } inline size_t BytesToWords(size_t byteCount) { return ((byteCount+WORD_SIZE-1)/WORD_SIZE); } inline size_t BitsToWords(size_t bitCount) { return ((bitCount+WORD_BITS-1)/(WORD_BITS)); } inline size_t BitsToDwords(size_t bitCount) { return ((bitCount+2*WORD_BITS-1)/(2*WORD_BITS)); } CRYPTOPP_DLL void CRYPTOPP_API xorbuf(byte *buf, const byte *mask, size_t count); CRYPTOPP_DLL void CRYPTOPP_API xorbuf(byte *output, const byte *input, const byte *mask, size_t count); CRYPTOPP_DLL bool CRYPTOPP_API VerifyBufsEqual(const byte *buf1, const byte *buf2, size_t count); template inline bool IsPowerOf2(const T &n) { return n > 0 && (n & (n-1)) == 0; } template inline T2 ModPowerOf2(const T1 &a, const T2 &b) { assert(IsPowerOf2(b)); return T2(a) & (b-1); } template inline T1 RoundDownToMultipleOf(const T1 &n, const T2 &m) { if (IsPowerOf2(m)) return n - ModPowerOf2(n, m); else return n - n%m; } template inline T1 RoundUpToMultipleOf(const T1 &n, const T2 &m) { if (n+m-1 < n) throw InvalidArgument("RoundUpToMultipleOf: integer overflow"); return RoundDownToMultipleOf(n+m-1, m); } template inline unsigned int GetAlignmentOf(T *dummy=NULL) // VC60 workaround { #ifdef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS if (sizeof(T) < 16) return 1; #endif #if (_MSC_VER >= 1300) return __alignof(T); #elif defined(__GNUC__) return __alignof__(T); #elif CRYPTOPP_BOOL_SLOW_WORD64 return UnsignedMin(4U, sizeof(T)); #else return sizeof(T); #endif } inline bool IsAlignedOn(const void *p, unsigned int alignment) { return alignment==1 || (IsPowerOf2(alignment) ? ModPowerOf2((size_t)p, alignment) == 0 : (size_t)p % alignment == 0); } template inline bool IsAligned(const void *p, T *dummy=NULL) // VC60 workaround { return IsAlignedOn(p, GetAlignmentOf()); } #ifdef IS_LITTLE_ENDIAN typedef LittleEndian NativeByteOrder; #else typedef BigEndian NativeByteOrder; #endif inline ByteOrder GetNativeByteOrder() { return NativeByteOrder::ToEnum(); } inline bool NativeByteOrderIs(ByteOrder order) { return order == GetNativeByteOrder(); } template std::string IntToString(T a, unsigned int base = 10) { if (a == 0) return "0"; bool negate = false; if (a < 0) { negate = true; a = 0-a; // VC .NET does not like -a } std::string result; while (a > 0) { T digit = a % base; result = char((digit < 10 ? '0' : ('a' - 10)) + digit) + result; a /= base; } if (negate) result = "-" + result; return result; } template inline T1 SaturatingSubtract(const T1 &a, const T2 &b) { return T1((a > b) ? (a - b) : 0); } template inline CipherDir GetCipherDir(const T &obj) { return obj.IsForwardTransformation() ? ENCRYPTION : DECRYPTION; } CRYPTOPP_DLL void CRYPTOPP_API CallNewHandler(); inline void IncrementCounterByOne(byte *inout, unsigned int s) { for (int i=s-1, carry=1; i>=0 && carry; i--) carry = !++inout[i]; } inline void IncrementCounterByOne(byte *output, const byte *input, unsigned int s) { int i, carry; for (i=s-1, carry=1; i>=0 && carry; i--) carry = ((output[i] = input[i]+1) == 0); memcpy_s(output, s, input, i+1); } template inline void ConditionalSwap(bool c, T &a, T &b) { T t = c * (a ^ b); a ^= t; b ^= t; } template inline void ConditionalSwapPointers(bool c, T &a, T &b) { ptrdiff_t t = c * (a - b); a -= t; b += t; } // see http://www.dwheeler.com/secure-programs/Secure-Programs-HOWTO/protect-secrets.html // and https://www.securecoding.cert.org/confluence/display/cplusplus/MSC06-CPP.+Be+aware+of+compiler+optimization+when+dealing+with+sensitive+data template void SecureWipeBuffer(T *buf, size_t n) { // GCC 4.3.2 on Cygwin optimizes away the first store if this loop is done in the forward direction volatile T *p = buf+n; while (n--) *(--p) = 0; } #if (_MSC_VER >= 1400 || defined(__GNUC__)) && (CRYPTOPP_BOOL_X64 || CRYPTOPP_BOOL_X86) template<> inline void SecureWipeBuffer(byte *buf, size_t n) { volatile byte *p = buf; #ifdef __GNUC__ asm volatile("rep stosb" : "+c"(n), "+D"(p) : "a"(0) : "memory"); #else __stosb((byte *)(size_t)p, 0, n); #endif } template<> inline void SecureWipeBuffer(word16 *buf, size_t n) { volatile word16 *p = buf; #ifdef __GNUC__ asm volatile("rep stosw" : "+c"(n), "+D"(p) : "a"(0) : "memory"); #else __stosw((word16 *)(size_t)p, 0, n); #endif } template<> inline void SecureWipeBuffer(word32 *buf, size_t n) { volatile word32 *p = buf; #ifdef __GNUC__ asm volatile("rep stosl" : "+c"(n), "+D"(p) : "a"(0) : "memory"); #else __stosd((unsigned long *)(size_t)p, 0, n); #endif } template<> inline void SecureWipeBuffer(word64 *buf, size_t n) { #if CRYPTOPP_BOOL_X64 volatile word64 *p = buf; #ifdef __GNUC__ asm volatile("rep stosq" : "+c"(n), "+D"(p) : "a"(0) : "memory"); #else __stosq((word64 *)(size_t)p, 0, n); #endif #else SecureWipeBuffer((word32 *)buf, 2*n); #endif } #endif // #if (_MSC_VER >= 1400 || defined(__GNUC__)) && (CRYPTOPP_BOOL_X64 || CRYPTOPP_BOOL_X86) template inline void SecureWipeArray(T *buf, size_t n) { if (sizeof(T) % 8 == 0 && GetAlignmentOf() % GetAlignmentOf() == 0) SecureWipeBuffer((word64 *)buf, n * (sizeof(T)/8)); else if (sizeof(T) % 4 == 0 && GetAlignmentOf() % GetAlignmentOf() == 0) SecureWipeBuffer((word32 *)buf, n * (sizeof(T)/4)); else if (sizeof(T) % 2 == 0 && GetAlignmentOf() % GetAlignmentOf() == 0) SecureWipeBuffer((word16 *)buf, n * (sizeof(T)/2)); else SecureWipeBuffer((byte *)buf, n * sizeof(T)); } // this function uses wcstombs(), which assumes that setlocale() has been called static std::string StringNarrow(const wchar_t *str, bool throwOnError = true) { #ifdef _MSC_VER #pragma warning(push) #pragma warning(disable: 4996) // 'wcstombs': This function or variable may be unsafe. #endif size_t size = wcstombs(NULL, str, 0); if (size == size_t(0)-1) { if (throwOnError) throw InvalidArgument("StringNarrow: wcstombs() call failed"); else return std::string(); } std::string result(size, 0); wcstombs(&result[0], str, size); return result; #ifdef _MSC_VER #pragma warning(pop) #endif } #if CRYPTOPP_BOOL_ALIGN16_ENABLED CRYPTOPP_DLL void * CRYPTOPP_API AlignedAllocate(size_t size); CRYPTOPP_DLL void CRYPTOPP_API AlignedDeallocate(void *p); #endif CRYPTOPP_DLL void * CRYPTOPP_API UnalignedAllocate(size_t size); CRYPTOPP_DLL void CRYPTOPP_API UnalignedDeallocate(void *p); // ************** rotate functions *************** template inline T rotlFixed(T x, unsigned int y) { assert(y < sizeof(T)*8); return T((x<>(sizeof(T)*8-y))); } template inline T rotrFixed(T x, unsigned int y) { assert(y < sizeof(T)*8); return T((x>>y) | (x<<(sizeof(T)*8-y))); } template inline T rotlVariable(T x, unsigned int y) { assert(y < sizeof(T)*8); return T((x<>(sizeof(T)*8-y))); } template inline T rotrVariable(T x, unsigned int y) { assert(y < sizeof(T)*8); return T((x>>y) | (x<<(sizeof(T)*8-y))); } template inline T rotlMod(T x, unsigned int y) { y %= sizeof(T)*8; return T((x<>(sizeof(T)*8-y))); } template inline T rotrMod(T x, unsigned int y) { y %= sizeof(T)*8; return T((x>>y) | (x<<(sizeof(T)*8-y))); } #ifdef _MSC_VER template<> inline word32 rotlFixed(word32 x, unsigned int y) { assert(y < 8*sizeof(x)); return y ? _lrotl(x, y) : x; } template<> inline word32 rotrFixed(word32 x, unsigned int y) { assert(y < 8*sizeof(x)); return y ? _lrotr(x, y) : x; } template<> inline word32 rotlVariable(word32 x, unsigned int y) { assert(y < 8*sizeof(x)); return _lrotl(x, y); } template<> inline word32 rotrVariable(word32 x, unsigned int y) { assert(y < 8*sizeof(x)); return _lrotr(x, y); } template<> inline word32 rotlMod(word32 x, unsigned int y) { return _lrotl(x, y); } template<> inline word32 rotrMod(word32 x, unsigned int y) { return _lrotr(x, y); } #endif // #ifdef _MSC_VER #if _MSC_VER >= 1300 && !defined(__INTEL_COMPILER) // Intel C++ Compiler 10.0 calls a function instead of using the rotate instruction when using these instructions template<> inline word64 rotlFixed(word64 x, unsigned int y) { assert(y < 8*sizeof(x)); return y ? _rotl64(x, y) : x; } template<> inline word64 rotrFixed(word64 x, unsigned int y) { assert(y < 8*sizeof(x)); return y ? _rotr64(x, y) : x; } template<> inline word64 rotlVariable(word64 x, unsigned int y) { assert(y < 8*sizeof(x)); return _rotl64(x, y); } template<> inline word64 rotrVariable(word64 x, unsigned int y) { assert(y < 8*sizeof(x)); return _rotr64(x, y); } template<> inline word64 rotlMod(word64 x, unsigned int y) { return _rotl64(x, y); } template<> inline word64 rotrMod(word64 x, unsigned int y) { return _rotr64(x, y); } #endif // #if _MSC_VER >= 1310 #if _MSC_VER >= 1400 && !defined(__INTEL_COMPILER) // Intel C++ Compiler 10.0 gives undefined externals with these template<> inline word16 rotlFixed(word16 x, unsigned int y) { assert(y < 8*sizeof(x)); return y ? _rotl16(x, y) : x; } template<> inline word16 rotrFixed(word16 x, unsigned int y) { assert(y < 8*sizeof(x)); return y ? _rotr16(x, y) : x; } template<> inline word16 rotlVariable(word16 x, unsigned int y) { assert(y < 8*sizeof(x)); return _rotl16(x, y); } template<> inline word16 rotrVariable(word16 x, unsigned int y) { assert(y < 8*sizeof(x)); return _rotr16(x, y); } template<> inline word16 rotlMod(word16 x, unsigned int y) { return _rotl16(x, y); } template<> inline word16 rotrMod(word16 x, unsigned int y) { return _rotr16(x, y); } template<> inline byte rotlFixed(byte x, unsigned int y) { assert(y < 8*sizeof(x)); return y ? _rotl8(x, y) : x; } template<> inline byte rotrFixed(byte x, unsigned int y) { assert(y < 8*sizeof(x)); return y ? _rotr8(x, y) : x; } template<> inline byte rotlVariable(byte x, unsigned int y) { assert(y < 8*sizeof(x)); return _rotl8(x, y); } template<> inline byte rotrVariable(byte x, unsigned int y) { assert(y < 8*sizeof(x)); return _rotr8(x, y); } template<> inline byte rotlMod(byte x, unsigned int y) { return _rotl8(x, y); } template<> inline byte rotrMod(byte x, unsigned int y) { return _rotr8(x, y); } #endif // #if _MSC_VER >= 1400 #if (defined(__MWERKS__) && TARGET_CPU_PPC) template<> inline word32 rotlFixed(word32 x, unsigned int y) { assert(y < 32); return y ? __rlwinm(x,y,0,31) : x; } template<> inline word32 rotrFixed(word32 x, unsigned int y) { assert(y < 32); return y ? __rlwinm(x,32-y,0,31) : x; } template<> inline word32 rotlVariable(word32 x, unsigned int y) { assert(y < 32); return (__rlwnm(x,y,0,31)); } template<> inline word32 rotrVariable(word32 x, unsigned int y) { assert(y < 32); return (__rlwnm(x,32-y,0,31)); } template<> inline word32 rotlMod(word32 x, unsigned int y) { return (__rlwnm(x,y,0,31)); } template<> inline word32 rotrMod(word32 x, unsigned int y) { return (__rlwnm(x,32-y,0,31)); } #endif // #if (defined(__MWERKS__) && TARGET_CPU_PPC) // ************** endian reversal *************** template inline unsigned int GetByte(ByteOrder order, T value, unsigned int index) { if (order == LITTLE_ENDIAN_ORDER) return GETBYTE(value, index); else return GETBYTE(value, sizeof(T)-index-1); } inline byte ByteReverse(byte value) { return value; } inline word16 ByteReverse(word16 value) { #ifdef CRYPTOPP_BYTESWAP_AVAILABLE return bswap_16(value); #elif defined(_MSC_VER) && _MSC_VER >= 1300 return _byteswap_ushort(value); #else return rotlFixed(value, 8U); #endif } inline word32 ByteReverse(word32 value) { #if defined(__GNUC__) && defined(CRYPTOPP_X86_ASM_AVAILABLE) __asm__ ("bswap %0" : "=r" (value) : "0" (value)); return value; #elif defined(CRYPTOPP_BYTESWAP_AVAILABLE) return bswap_32(value); #elif defined(__MWERKS__) && TARGET_CPU_PPC return (word32)__lwbrx(&value,0); #elif _MSC_VER >= 1400 || (_MSC_VER >= 1300 && !defined(_DLL)) return _byteswap_ulong(value); #elif CRYPTOPP_FAST_ROTATE(32) // 5 instructions with rotate instruction, 9 without return (rotrFixed(value, 8U) & 0xff00ff00) | (rotlFixed(value, 8U) & 0x00ff00ff); #else // 6 instructions with rotate instruction, 8 without value = ((value & 0xFF00FF00) >> 8) | ((value & 0x00FF00FF) << 8); return rotlFixed(value, 16U); #endif } inline word64 ByteReverse(word64 value) { #if defined(__GNUC__) && defined(CRYPTOPP_X86_ASM_AVAILABLE) && defined(__x86_64__) __asm__ ("bswap %0" : "=r" (value) : "0" (value)); return value; #elif defined(CRYPTOPP_BYTESWAP_AVAILABLE) return bswap_64(value); #elif defined(_MSC_VER) && _MSC_VER >= 1300 return _byteswap_uint64(value); #elif CRYPTOPP_BOOL_SLOW_WORD64 return (word64(ByteReverse(word32(value))) << 32) | ByteReverse(word32(value>>32)); #else value = ((value & W64LIT(0xFF00FF00FF00FF00)) >> 8) | ((value & W64LIT(0x00FF00FF00FF00FF)) << 8); value = ((value & W64LIT(0xFFFF0000FFFF0000)) >> 16) | ((value & W64LIT(0x0000FFFF0000FFFF)) << 16); return rotlFixed(value, 32U); #endif } inline byte BitReverse(byte value) { value = ((value & 0xAA) >> 1) | ((value & 0x55) << 1); value = ((value & 0xCC) >> 2) | ((value & 0x33) << 2); return rotlFixed(value, 4U); } inline word16 BitReverse(word16 value) { value = ((value & 0xAAAA) >> 1) | ((value & 0x5555) << 1); value = ((value & 0xCCCC) >> 2) | ((value & 0x3333) << 2); value = ((value & 0xF0F0) >> 4) | ((value & 0x0F0F) << 4); return ByteReverse(value); } inline word32 BitReverse(word32 value) { value = ((value & 0xAAAAAAAA) >> 1) | ((value & 0x55555555) << 1); value = ((value & 0xCCCCCCCC) >> 2) | ((value & 0x33333333) << 2); value = ((value & 0xF0F0F0F0) >> 4) | ((value & 0x0F0F0F0F) << 4); return ByteReverse(value); } inline word64 BitReverse(word64 value) { #if CRYPTOPP_BOOL_SLOW_WORD64 return (word64(BitReverse(word32(value))) << 32) | BitReverse(word32(value>>32)); #else value = ((value & W64LIT(0xAAAAAAAAAAAAAAAA)) >> 1) | ((value & W64LIT(0x5555555555555555)) << 1); value = ((value & W64LIT(0xCCCCCCCCCCCCCCCC)) >> 2) | ((value & W64LIT(0x3333333333333333)) << 2); value = ((value & W64LIT(0xF0F0F0F0F0F0F0F0)) >> 4) | ((value & W64LIT(0x0F0F0F0F0F0F0F0F)) << 4); return ByteReverse(value); #endif } template inline T BitReverse(T value) { if (sizeof(T) == 1) return (T)BitReverse((byte)value); else if (sizeof(T) == 2) return (T)BitReverse((word16)value); else if (sizeof(T) == 4) return (T)BitReverse((word32)value); else { assert(sizeof(T) == 8); return (T)BitReverse((word64)value); } } template inline T ConditionalByteReverse(ByteOrder order, T value) { return NativeByteOrderIs(order) ? value : ByteReverse(value); } template void ByteReverse(T *out, const T *in, size_t byteCount) { assert(byteCount % sizeof(T) == 0); size_t count = byteCount/sizeof(T); for (size_t i=0; i inline void ConditionalByteReverse(ByteOrder order, T *out, const T *in, size_t byteCount) { if (!NativeByteOrderIs(order)) ByteReverse(out, in, byteCount); else if (in != out) memcpy_s(out, byteCount, in, byteCount); } template inline void GetUserKey(ByteOrder order, T *out, size_t outlen, const byte *in, size_t inlen) { const size_t U = sizeof(T); assert(inlen <= outlen*U); memcpy_s(out, outlen*U, in, inlen); memset_z((byte *)out+inlen, 0, outlen*U-inlen); ConditionalByteReverse(order, out, out, RoundUpToMultipleOf(inlen, U)); } #ifndef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS inline byte UnalignedGetWordNonTemplate(ByteOrder order, const byte *block, const byte *) { return block[0]; } inline word16 UnalignedGetWordNonTemplate(ByteOrder order, const byte *block, const word16 *) { return (order == BIG_ENDIAN_ORDER) ? block[1] | (block[0] << 8) : block[0] | (block[1] << 8); } inline word32 UnalignedGetWordNonTemplate(ByteOrder order, const byte *block, const word32 *) { return (order == BIG_ENDIAN_ORDER) ? word32(block[3]) | (word32(block[2]) << 8) | (word32(block[1]) << 16) | (word32(block[0]) << 24) : word32(block[0]) | (word32(block[1]) << 8) | (word32(block[2]) << 16) | (word32(block[3]) << 24); } inline word64 UnalignedGetWordNonTemplate(ByteOrder order, const byte *block, const word64 *) { return (order == BIG_ENDIAN_ORDER) ? (word64(block[7]) | (word64(block[6]) << 8) | (word64(block[5]) << 16) | (word64(block[4]) << 24) | (word64(block[3]) << 32) | (word64(block[2]) << 40) | (word64(block[1]) << 48) | (word64(block[0]) << 56)) : (word64(block[0]) | (word64(block[1]) << 8) | (word64(block[2]) << 16) | (word64(block[3]) << 24) | (word64(block[4]) << 32) | (word64(block[5]) << 40) | (word64(block[6]) << 48) | (word64(block[7]) << 56)); } inline void UnalignedPutWordNonTemplate(ByteOrder order, byte *block, byte value, const byte *xorBlock) { block[0] = xorBlock ? (value ^ xorBlock[0]) : value; } inline void UnalignedPutWordNonTemplate(ByteOrder order, byte *block, word16 value, const byte *xorBlock) { if (order == BIG_ENDIAN_ORDER) { if (xorBlock) { block[0] = xorBlock[0] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 1); block[1] = xorBlock[1] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 0); } else { block[0] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 1); block[1] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 0); } } else { if (xorBlock) { block[0] = xorBlock[0] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 0); block[1] = xorBlock[1] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 1); } else { block[0] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 0); block[1] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 1); } } } inline void UnalignedPutWordNonTemplate(ByteOrder order, byte *block, word32 value, const byte *xorBlock) { if (order == BIG_ENDIAN_ORDER) { if (xorBlock) { block[0] = xorBlock[0] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 3); block[1] = xorBlock[1] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 2); block[2] = xorBlock[2] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 1); block[3] = xorBlock[3] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 0); } else { block[0] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 3); block[1] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 2); block[2] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 1); block[3] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 0); } } else { if (xorBlock) { block[0] = xorBlock[0] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 0); block[1] = xorBlock[1] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 1); block[2] = xorBlock[2] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 2); block[3] = xorBlock[3] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 3); } else { block[0] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 0); block[1] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 1); block[2] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 2); block[3] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 3); } } } inline void UnalignedPutWordNonTemplate(ByteOrder order, byte *block, word64 value, const byte *xorBlock) { if (order == BIG_ENDIAN_ORDER) { if (xorBlock) { block[0] = xorBlock[0] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 7); block[1] = xorBlock[1] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 6); block[2] = xorBlock[2] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 5); block[3] = xorBlock[3] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 4); block[4] = xorBlock[4] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 3); block[5] = xorBlock[5] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 2); block[6] = xorBlock[6] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 1); block[7] = xorBlock[7] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 0); } else { block[0] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 7); block[1] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 6); block[2] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 5); block[3] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 4); block[4] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 3); block[5] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 2); block[6] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 1); block[7] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 0); } } else { if (xorBlock) { block[0] = xorBlock[0] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 0); block[1] = xorBlock[1] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 1); block[2] = xorBlock[2] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 2); block[3] = xorBlock[3] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 3); block[4] = xorBlock[4] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 4); block[5] = xorBlock[5] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 5); block[6] = xorBlock[6] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 6); block[7] = xorBlock[7] ^ CRYPTOPP_GET_BYTE_AS_BYTE(value, 7); } else { block[0] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 0); block[1] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 1); block[2] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 2); block[3] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 3); block[4] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 4); block[5] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 5); block[6] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 6); block[7] = CRYPTOPP_GET_BYTE_AS_BYTE(value, 7); } } } #endif // #ifndef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS template inline T GetWord(bool assumeAligned, ByteOrder order, const byte *block) { #ifndef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS if (!assumeAligned) return UnalignedGetWordNonTemplate(order, block, (T*)NULL); assert(IsAligned(block)); #endif return ConditionalByteReverse(order, *reinterpret_cast(block)); } template inline void GetWord(bool assumeAligned, ByteOrder order, T &result, const byte *block) { result = GetWord(assumeAligned, order, block); } template inline void PutWord(bool assumeAligned, ByteOrder order, byte *block, T value, const byte *xorBlock = NULL) { #ifndef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS if (!assumeAligned) return UnalignedPutWordNonTemplate(order, block, value, xorBlock); assert(IsAligned(block)); assert(IsAligned(xorBlock)); #endif *reinterpret_cast(block) = ConditionalByteReverse(order, value) ^ (xorBlock ? *reinterpret_cast(xorBlock) : 0); } template class GetBlock { public: GetBlock(const void *block) : m_block((const byte *)block) {} template inline GetBlock & operator()(U &x) { CRYPTOPP_COMPILE_ASSERT(sizeof(U) >= sizeof(T)); x = GetWord(A, B::ToEnum(), m_block); m_block += sizeof(T); return *this; } private: const byte *m_block; }; template class PutBlock { public: PutBlock(const void *xorBlock, void *block) : m_xorBlock((const byte *)xorBlock), m_block((byte *)block) {} template inline PutBlock & operator()(U x) { PutWord(A, B::ToEnum(), m_block, (T)x, m_xorBlock); m_block += sizeof(T); if (m_xorBlock) m_xorBlock += sizeof(T); return *this; } private: const byte *m_xorBlock; byte *m_block; }; template struct BlockGetAndPut { // function needed because of C++ grammatical ambiguity between expression-statements and declarations static inline GetBlock Get(const void *block) {return GetBlock(block);} typedef PutBlock Put; }; template std::string WordToString(T value, ByteOrder order = BIG_ENDIAN_ORDER) { if (!NativeByteOrderIs(order)) value = ByteReverse(value); return std::string((char *)&value, sizeof(value)); } template T StringToWord(const std::string &str, ByteOrder order = BIG_ENDIAN_ORDER) { T value = 0; memcpy_s(&value, sizeof(value), str.data(), UnsignedMin(str.size(), sizeof(value))); return NativeByteOrderIs(order) ? value : ByteReverse(value); } // ************** help remove warning on g++ *************** template struct SafeShifter; template<> struct SafeShifter { template static inline T RightShift(T value, unsigned int bits) { return 0; } template static inline T LeftShift(T value, unsigned int bits) { return 0; } }; template<> struct SafeShifter { template static inline T RightShift(T value, unsigned int bits) { return value >> bits; } template static inline T LeftShift(T value, unsigned int bits) { return value << bits; } }; template inline T SafeRightShift(T value) { return SafeShifter<(bits>=(8*sizeof(T)))>::RightShift(value, bits); } template inline T SafeLeftShift(T value) { return SafeShifter<(bits>=(8*sizeof(T)))>::LeftShift(value, bits); } // ************** use one buffer for multiple data members *************** #define CRYPTOPP_BLOCK_1(n, t, s) t* m_##n() {return (t *)(m_aggregate+0);} size_t SS1() {return sizeof(t)*(s);} size_t m_##n##Size() {return (s);} #define CRYPTOPP_BLOCK_2(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS1());} size_t SS2() {return SS1()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);} #define CRYPTOPP_BLOCK_3(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS2());} size_t SS3() {return SS2()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);} #define CRYPTOPP_BLOCK_4(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS3());} size_t SS4() {return SS3()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);} #define CRYPTOPP_BLOCK_5(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS4());} size_t SS5() {return SS4()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);} #define CRYPTOPP_BLOCK_6(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS5());} size_t SS6() {return SS5()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);} #define CRYPTOPP_BLOCK_7(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS6());} size_t SS7() {return SS6()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);} #define CRYPTOPP_BLOCK_8(n, t, s) t* m_##n() {return (t *)(m_aggregate+SS7());} size_t SS8() {return SS7()+sizeof(t)*(s);} size_t m_##n##Size() {return (s);} #define CRYPTOPP_BLOCKS_END(i) size_t SST() {return SS##i();} void AllocateBlocks() {m_aggregate.New(SST());} AlignedSecByteBlock m_aggregate; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/squaretb.cpp0000755000000000000000000007650312414772654020143 0ustar rootroot#include "pch.h" #include "square.h" NAMESPACE_BEGIN(CryptoPP) const byte Square::Enc::Se[256] = { 177, 206, 195, 149, 90, 173, 231, 2, 77, 68, 251, 145, 12, 135, 161, 80, 203, 103, 84, 221, 70, 143, 225, 78, 240, 253, 252, 235, 249, 196, 26, 110, 94, 245, 204, 141, 28, 86, 67, 254, 7, 97, 248, 117, 89, 255, 3, 34, 138, 209, 19, 238, 136, 0, 14, 52, 21, 128, 148, 227, 237, 181, 83, 35, 75, 71, 23, 167, 144, 53, 171, 216, 184, 223, 79, 87, 154, 146, 219, 27, 60, 200, 153, 4, 142, 224, 215, 125, 133, 187, 64, 44, 58, 69, 241, 66, 101, 32, 65, 24, 114, 37, 147, 112, 54, 5, 242, 11, 163, 121, 236, 8, 39, 49, 50, 182, 124, 176, 10, 115, 91, 123, 183, 129, 210, 13, 106, 38, 158, 88, 156, 131, 116, 179, 172, 48, 122, 105, 119, 15, 174, 33, 222, 208, 46, 151, 16, 164, 152, 168, 212, 104, 45, 98, 41, 109, 22, 73, 118, 199, 232, 193, 150, 55, 229, 202, 244, 233, 99, 18, 194, 166, 20, 188, 211, 40, 175, 47, 230, 36, 82, 198, 160, 9, 189, 140, 207, 93, 17, 95, 1, 197, 159, 61, 162, 155, 201, 59, 190, 81, 25, 31, 63, 92, 178, 239, 74, 205, 191, 186, 111, 100, 217, 243, 62, 180, 170, 220, 213, 6, 192, 126, 246, 102, 108, 132, 113, 56, 185, 29, 127, 157, 72, 139, 42, 218, 165, 51, 130, 57, 214, 120, 134, 250, 228, 43, 169, 30, 137, 96, 107, 234, 85, 76, 247, 226, }; const byte Square::Dec::Sd[256] = { 53, 190, 7, 46, 83, 105, 219, 40, 111, 183, 118, 107, 12, 125, 54, 139, 146, 188, 169, 50, 172, 56, 156, 66, 99, 200, 30, 79, 36, 229, 247, 201, 97, 141, 47, 63, 179, 101, 127, 112, 175, 154, 234, 245, 91, 152, 144, 177, 135, 113, 114, 237, 55, 69, 104, 163, 227, 239, 92, 197, 80, 193, 214, 202, 90, 98, 95, 38, 9, 93, 20, 65, 232, 157, 206, 64, 253, 8, 23, 74, 15, 199, 180, 62, 18, 252, 37, 75, 129, 44, 4, 120, 203, 187, 32, 189, 249, 41, 153, 168, 211, 96, 223, 17, 151, 137, 126, 250, 224, 155, 31, 210, 103, 226, 100, 119, 132, 43, 158, 138, 241, 109, 136, 121, 116, 87, 221, 230, 57, 123, 238, 131, 225, 88, 242, 13, 52, 248, 48, 233, 185, 35, 84, 21, 68, 11, 77, 102, 58, 3, 162, 145, 148, 82, 76, 195, 130, 231, 128, 192, 182, 14, 194, 108, 147, 236, 171, 67, 149, 246, 216, 70, 134, 5, 140, 176, 117, 0, 204, 133, 215, 61, 115, 122, 72, 228, 209, 89, 173, 184, 198, 208, 220, 161, 170, 2, 29, 191, 181, 159, 81, 196, 165, 16, 34, 207, 1, 186, 143, 49, 124, 174, 150, 218, 240, 86, 71, 212, 235, 78, 217, 19, 142, 73, 85, 22, 255, 59, 244, 164, 178, 6, 160, 167, 251, 27, 110, 60, 51, 205, 24, 94, 106, 213, 166, 33, 222, 254, 42, 28, 243, 10, 26, 25, 39, 45, }; const word32 Square::Enc::Te[4][256] = { { 0x97b1b126UL, 0x69cecea7UL, 0x73c3c3b0UL, 0xdf95954aUL, 0xb45a5aeeUL, 0xafadad02UL, 0x3be7e7dcUL, 0x04020206UL, 0x9a4d4dd7UL, 0x884444ccUL, 0x03fbfbf8UL, 0xd7919146UL, 0x180c0c14UL, 0xfb87877cUL, 0xb7a1a116UL, 0xa05050f0UL, 0x63cbcba8UL, 0xce6767a9UL, 0xa85454fcUL, 0x4fdddd92UL, 0x8c4646caUL, 0xeb8f8f64UL, 0x37e1e1d6UL, 0x9c4e4ed2UL, 0x15f0f0e5UL, 0x0ffdfdf2UL, 0x0dfcfcf1UL, 0x23ebebc8UL, 0x07f9f9feUL, 0x7dc4c4b9UL, 0x341a1a2eUL, 0xdc6e6eb2UL, 0xbc5e5ee2UL, 0x1ff5f5eaUL, 0x6dcccca1UL, 0xef8d8d62UL, 0x381c1c24UL, 0xac5656faUL, 0x864343c5UL, 0x09fefef7UL, 0x0e070709UL, 0xc26161a3UL, 0x05f8f8fdUL, 0xea75759fUL, 0xb25959ebUL, 0x0bfffff4UL, 0x06030305UL, 0x44222266UL, 0xe18a8a6bUL, 0x57d1d186UL, 0x26131335UL, 0x29eeeec7UL, 0xe588886dUL, 0x00000000UL, 0x1c0e0e12UL, 0x6834345cUL, 0x2a15153fUL, 0xf5808075UL, 0xdd949449UL, 0x33e3e3d0UL, 0x2fededc2UL, 0x9fb5b52aUL, 0xa65353f5UL, 0x46232365UL, 0x964b4bddUL, 0x8e4747c9UL, 0x2e171739UL, 0xbba7a71cUL, 0xd5909045UL, 0x6a35355fUL, 0xa3abab08UL, 0x45d8d89dUL, 0x85b8b83dUL, 0x4bdfdf94UL, 0x9e4f4fd1UL, 0xae5757f9UL, 0xc19a9a5bUL, 0xd1929243UL, 0x43dbdb98UL, 0x361b1b2dUL, 0x783c3c44UL, 0x65c8c8adUL, 0xc799995eUL, 0x0804040cUL, 0xe98e8e67UL, 0x35e0e0d5UL, 0x5bd7d78cUL, 0xfa7d7d87UL, 0xff85857aUL, 0x83bbbb38UL, 0x804040c0UL, 0x582c2c74UL, 0x743a3a4eUL, 0x8a4545cfUL, 0x17f1f1e6UL, 0x844242c6UL, 0xca6565afUL, 0x40202060UL, 0x824141c3UL, 0x30181828UL, 0xe4727296UL, 0x4a25256fUL, 0xd3939340UL, 0xe0707090UL, 0x6c36365aUL, 0x0a05050fUL, 0x11f2f2e3UL, 0x160b0b1dUL, 0xb3a3a310UL, 0xf279798bUL, 0x2dececc1UL, 0x10080818UL, 0x4e272769UL, 0x62313153UL, 0x64323256UL, 0x99b6b62fUL, 0xf87c7c84UL, 0x95b0b025UL, 0x140a0a1eUL, 0xe6737395UL, 0xb65b5bedUL, 0xf67b7b8dUL, 0x9bb7b72cUL, 0xf7818176UL, 0x51d2d283UL, 0x1a0d0d17UL, 0xd46a6abeUL, 0x4c26266aUL, 0xc99e9e57UL, 0xb05858e8UL, 0xcd9c9c51UL, 0xf3838370UL, 0xe874749cUL, 0x93b3b320UL, 0xadacac01UL, 0x60303050UL, 0xf47a7a8eUL, 0xd26969bbUL, 0xee777799UL, 0x1e0f0f11UL, 0xa9aeae07UL, 0x42212163UL, 0x49dede97UL, 0x55d0d085UL, 0x5c2e2e72UL, 0xdb97974cUL, 0x20101030UL, 0xbda4a419UL, 0xc598985dUL, 0xa5a8a80dUL, 0x5dd4d489UL, 0xd06868b8UL, 0x5a2d2d77UL, 0xc46262a6UL, 0x5229297bUL, 0xda6d6db7UL, 0x2c16163aUL, 0x924949dbUL, 0xec76769aUL, 0x7bc7c7bcUL, 0x25e8e8cdUL, 0x77c1c1b6UL, 0xd996964fUL, 0x6e373759UL, 0x3fe5e5daUL, 0x61cacaabUL, 0x1df4f4e9UL, 0x27e9e9ceUL, 0xc66363a5UL, 0x24121236UL, 0x71c2c2b3UL, 0xb9a6a61fUL, 0x2814143cUL, 0x8dbcbc31UL, 0x53d3d380UL, 0x50282878UL, 0xabafaf04UL, 0x5e2f2f71UL, 0x39e6e6dfUL, 0x4824246cUL, 0xa45252f6UL, 0x79c6c6bfUL, 0xb5a0a015UL, 0x1209091bUL, 0x8fbdbd32UL, 0xed8c8c61UL, 0x6bcfcfa4UL, 0xba5d5de7UL, 0x22111133UL, 0xbe5f5fe1UL, 0x02010103UL, 0x7fc5c5baUL, 0xcb9f9f54UL, 0x7a3d3d47UL, 0xb1a2a213UL, 0xc39b9b58UL, 0x67c9c9aeUL, 0x763b3b4dUL, 0x89bebe37UL, 0xa25151f3UL, 0x3219192bUL, 0x3e1f1f21UL, 0x7e3f3f41UL, 0xb85c5ce4UL, 0x91b2b223UL, 0x2befefc4UL, 0x944a4adeUL, 0x6fcdcda2UL, 0x8bbfbf34UL, 0x81baba3bUL, 0xde6f6fb1UL, 0xc86464acUL, 0x47d9d99eUL, 0x13f3f3e0UL, 0x7c3e3e42UL, 0x9db4b429UL, 0xa1aaaa0bUL, 0x4ddcdc91UL, 0x5fd5d58aUL, 0x0c06060aUL, 0x75c0c0b5UL, 0xfc7e7e82UL, 0x19f6f6efUL, 0xcc6666aaUL, 0xd86c6cb4UL, 0xfd848479UL, 0xe2717193UL, 0x70383848UL, 0x87b9b93eUL, 0x3a1d1d27UL, 0xfe7f7f81UL, 0xcf9d9d52UL, 0x904848d8UL, 0xe38b8b68UL, 0x542a2a7eUL, 0x41dada9bUL, 0xbfa5a51aUL, 0x66333355UL, 0xf1828273UL, 0x7239394bUL, 0x59d6d68fUL, 0xf0787888UL, 0xf986867fUL, 0x01fafafbUL, 0x3de4e4d9UL, 0x562b2b7dUL, 0xa7a9a90eUL, 0x3c1e1e22UL, 0xe789896eUL, 0xc06060a0UL, 0xd66b6bbdUL, 0x21eaeacbUL, 0xaa5555ffUL, 0x984c4cd4UL, 0x1bf7f7ecUL, 0x31e2e2d3UL, }, { 0x2697b1b1UL, 0xa769ceceUL, 0xb073c3c3UL, 0x4adf9595UL, 0xeeb45a5aUL, 0x02afadadUL, 0xdc3be7e7UL, 0x06040202UL, 0xd79a4d4dUL, 0xcc884444UL, 0xf803fbfbUL, 0x46d79191UL, 0x14180c0cUL, 0x7cfb8787UL, 0x16b7a1a1UL, 0xf0a05050UL, 0xa863cbcbUL, 0xa9ce6767UL, 0xfca85454UL, 0x924fddddUL, 0xca8c4646UL, 0x64eb8f8fUL, 0xd637e1e1UL, 0xd29c4e4eUL, 0xe515f0f0UL, 0xf20ffdfdUL, 0xf10dfcfcUL, 0xc823ebebUL, 0xfe07f9f9UL, 0xb97dc4c4UL, 0x2e341a1aUL, 0xb2dc6e6eUL, 0xe2bc5e5eUL, 0xea1ff5f5UL, 0xa16dccccUL, 0x62ef8d8dUL, 0x24381c1cUL, 0xfaac5656UL, 0xc5864343UL, 0xf709fefeUL, 0x090e0707UL, 0xa3c26161UL, 0xfd05f8f8UL, 0x9fea7575UL, 0xebb25959UL, 0xf40bffffUL, 0x05060303UL, 0x66442222UL, 0x6be18a8aUL, 0x8657d1d1UL, 0x35261313UL, 0xc729eeeeUL, 0x6de58888UL, 0x00000000UL, 0x121c0e0eUL, 0x5c683434UL, 0x3f2a1515UL, 0x75f58080UL, 0x49dd9494UL, 0xd033e3e3UL, 0xc22fededUL, 0x2a9fb5b5UL, 0xf5a65353UL, 0x65462323UL, 0xdd964b4bUL, 0xc98e4747UL, 0x392e1717UL, 0x1cbba7a7UL, 0x45d59090UL, 0x5f6a3535UL, 0x08a3ababUL, 0x9d45d8d8UL, 0x3d85b8b8UL, 0x944bdfdfUL, 0xd19e4f4fUL, 0xf9ae5757UL, 0x5bc19a9aUL, 0x43d19292UL, 0x9843dbdbUL, 0x2d361b1bUL, 0x44783c3cUL, 0xad65c8c8UL, 0x5ec79999UL, 0x0c080404UL, 0x67e98e8eUL, 0xd535e0e0UL, 0x8c5bd7d7UL, 0x87fa7d7dUL, 0x7aff8585UL, 0x3883bbbbUL, 0xc0804040UL, 0x74582c2cUL, 0x4e743a3aUL, 0xcf8a4545UL, 0xe617f1f1UL, 0xc6844242UL, 0xafca6565UL, 0x60402020UL, 0xc3824141UL, 0x28301818UL, 0x96e47272UL, 0x6f4a2525UL, 0x40d39393UL, 0x90e07070UL, 0x5a6c3636UL, 0x0f0a0505UL, 0xe311f2f2UL, 0x1d160b0bUL, 0x10b3a3a3UL, 0x8bf27979UL, 0xc12dececUL, 0x18100808UL, 0x694e2727UL, 0x53623131UL, 0x56643232UL, 0x2f99b6b6UL, 0x84f87c7cUL, 0x2595b0b0UL, 0x1e140a0aUL, 0x95e67373UL, 0xedb65b5bUL, 0x8df67b7bUL, 0x2c9bb7b7UL, 0x76f78181UL, 0x8351d2d2UL, 0x171a0d0dUL, 0xbed46a6aUL, 0x6a4c2626UL, 0x57c99e9eUL, 0xe8b05858UL, 0x51cd9c9cUL, 0x70f38383UL, 0x9ce87474UL, 0x2093b3b3UL, 0x01adacacUL, 0x50603030UL, 0x8ef47a7aUL, 0xbbd26969UL, 0x99ee7777UL, 0x111e0f0fUL, 0x07a9aeaeUL, 0x63422121UL, 0x9749dedeUL, 0x8555d0d0UL, 0x725c2e2eUL, 0x4cdb9797UL, 0x30201010UL, 0x19bda4a4UL, 0x5dc59898UL, 0x0da5a8a8UL, 0x895dd4d4UL, 0xb8d06868UL, 0x775a2d2dUL, 0xa6c46262UL, 0x7b522929UL, 0xb7da6d6dUL, 0x3a2c1616UL, 0xdb924949UL, 0x9aec7676UL, 0xbc7bc7c7UL, 0xcd25e8e8UL, 0xb677c1c1UL, 0x4fd99696UL, 0x596e3737UL, 0xda3fe5e5UL, 0xab61cacaUL, 0xe91df4f4UL, 0xce27e9e9UL, 0xa5c66363UL, 0x36241212UL, 0xb371c2c2UL, 0x1fb9a6a6UL, 0x3c281414UL, 0x318dbcbcUL, 0x8053d3d3UL, 0x78502828UL, 0x04abafafUL, 0x715e2f2fUL, 0xdf39e6e6UL, 0x6c482424UL, 0xf6a45252UL, 0xbf79c6c6UL, 0x15b5a0a0UL, 0x1b120909UL, 0x328fbdbdUL, 0x61ed8c8cUL, 0xa46bcfcfUL, 0xe7ba5d5dUL, 0x33221111UL, 0xe1be5f5fUL, 0x03020101UL, 0xba7fc5c5UL, 0x54cb9f9fUL, 0x477a3d3dUL, 0x13b1a2a2UL, 0x58c39b9bUL, 0xae67c9c9UL, 0x4d763b3bUL, 0x3789bebeUL, 0xf3a25151UL, 0x2b321919UL, 0x213e1f1fUL, 0x417e3f3fUL, 0xe4b85c5cUL, 0x2391b2b2UL, 0xc42befefUL, 0xde944a4aUL, 0xa26fcdcdUL, 0x348bbfbfUL, 0x3b81babaUL, 0xb1de6f6fUL, 0xacc86464UL, 0x9e47d9d9UL, 0xe013f3f3UL, 0x427c3e3eUL, 0x299db4b4UL, 0x0ba1aaaaUL, 0x914ddcdcUL, 0x8a5fd5d5UL, 0x0a0c0606UL, 0xb575c0c0UL, 0x82fc7e7eUL, 0xef19f6f6UL, 0xaacc6666UL, 0xb4d86c6cUL, 0x79fd8484UL, 0x93e27171UL, 0x48703838UL, 0x3e87b9b9UL, 0x273a1d1dUL, 0x81fe7f7fUL, 0x52cf9d9dUL, 0xd8904848UL, 0x68e38b8bUL, 0x7e542a2aUL, 0x9b41dadaUL, 0x1abfa5a5UL, 0x55663333UL, 0x73f18282UL, 0x4b723939UL, 0x8f59d6d6UL, 0x88f07878UL, 0x7ff98686UL, 0xfb01fafaUL, 0xd93de4e4UL, 0x7d562b2bUL, 0x0ea7a9a9UL, 0x223c1e1eUL, 0x6ee78989UL, 0xa0c06060UL, 0xbdd66b6bUL, 0xcb21eaeaUL, 0xffaa5555UL, 0xd4984c4cUL, 0xec1bf7f7UL, 0xd331e2e2UL, }, { 0xb12697b1UL, 0xcea769ceUL, 0xc3b073c3UL, 0x954adf95UL, 0x5aeeb45aUL, 0xad02afadUL, 0xe7dc3be7UL, 0x02060402UL, 0x4dd79a4dUL, 0x44cc8844UL, 0xfbf803fbUL, 0x9146d791UL, 0x0c14180cUL, 0x877cfb87UL, 0xa116b7a1UL, 0x50f0a050UL, 0xcba863cbUL, 0x67a9ce67UL, 0x54fca854UL, 0xdd924fddUL, 0x46ca8c46UL, 0x8f64eb8fUL, 0xe1d637e1UL, 0x4ed29c4eUL, 0xf0e515f0UL, 0xfdf20ffdUL, 0xfcf10dfcUL, 0xebc823ebUL, 0xf9fe07f9UL, 0xc4b97dc4UL, 0x1a2e341aUL, 0x6eb2dc6eUL, 0x5ee2bc5eUL, 0xf5ea1ff5UL, 0xcca16dccUL, 0x8d62ef8dUL, 0x1c24381cUL, 0x56faac56UL, 0x43c58643UL, 0xfef709feUL, 0x07090e07UL, 0x61a3c261UL, 0xf8fd05f8UL, 0x759fea75UL, 0x59ebb259UL, 0xfff40bffUL, 0x03050603UL, 0x22664422UL, 0x8a6be18aUL, 0xd18657d1UL, 0x13352613UL, 0xeec729eeUL, 0x886de588UL, 0x00000000UL, 0x0e121c0eUL, 0x345c6834UL, 0x153f2a15UL, 0x8075f580UL, 0x9449dd94UL, 0xe3d033e3UL, 0xedc22fedUL, 0xb52a9fb5UL, 0x53f5a653UL, 0x23654623UL, 0x4bdd964bUL, 0x47c98e47UL, 0x17392e17UL, 0xa71cbba7UL, 0x9045d590UL, 0x355f6a35UL, 0xab08a3abUL, 0xd89d45d8UL, 0xb83d85b8UL, 0xdf944bdfUL, 0x4fd19e4fUL, 0x57f9ae57UL, 0x9a5bc19aUL, 0x9243d192UL, 0xdb9843dbUL, 0x1b2d361bUL, 0x3c44783cUL, 0xc8ad65c8UL, 0x995ec799UL, 0x040c0804UL, 0x8e67e98eUL, 0xe0d535e0UL, 0xd78c5bd7UL, 0x7d87fa7dUL, 0x857aff85UL, 0xbb3883bbUL, 0x40c08040UL, 0x2c74582cUL, 0x3a4e743aUL, 0x45cf8a45UL, 0xf1e617f1UL, 0x42c68442UL, 0x65afca65UL, 0x20604020UL, 0x41c38241UL, 0x18283018UL, 0x7296e472UL, 0x256f4a25UL, 0x9340d393UL, 0x7090e070UL, 0x365a6c36UL, 0x050f0a05UL, 0xf2e311f2UL, 0x0b1d160bUL, 0xa310b3a3UL, 0x798bf279UL, 0xecc12decUL, 0x08181008UL, 0x27694e27UL, 0x31536231UL, 0x32566432UL, 0xb62f99b6UL, 0x7c84f87cUL, 0xb02595b0UL, 0x0a1e140aUL, 0x7395e673UL, 0x5bedb65bUL, 0x7b8df67bUL, 0xb72c9bb7UL, 0x8176f781UL, 0xd28351d2UL, 0x0d171a0dUL, 0x6abed46aUL, 0x266a4c26UL, 0x9e57c99eUL, 0x58e8b058UL, 0x9c51cd9cUL, 0x8370f383UL, 0x749ce874UL, 0xb32093b3UL, 0xac01adacUL, 0x30506030UL, 0x7a8ef47aUL, 0x69bbd269UL, 0x7799ee77UL, 0x0f111e0fUL, 0xae07a9aeUL, 0x21634221UL, 0xde9749deUL, 0xd08555d0UL, 0x2e725c2eUL, 0x974cdb97UL, 0x10302010UL, 0xa419bda4UL, 0x985dc598UL, 0xa80da5a8UL, 0xd4895dd4UL, 0x68b8d068UL, 0x2d775a2dUL, 0x62a6c462UL, 0x297b5229UL, 0x6db7da6dUL, 0x163a2c16UL, 0x49db9249UL, 0x769aec76UL, 0xc7bc7bc7UL, 0xe8cd25e8UL, 0xc1b677c1UL, 0x964fd996UL, 0x37596e37UL, 0xe5da3fe5UL, 0xcaab61caUL, 0xf4e91df4UL, 0xe9ce27e9UL, 0x63a5c663UL, 0x12362412UL, 0xc2b371c2UL, 0xa61fb9a6UL, 0x143c2814UL, 0xbc318dbcUL, 0xd38053d3UL, 0x28785028UL, 0xaf04abafUL, 0x2f715e2fUL, 0xe6df39e6UL, 0x246c4824UL, 0x52f6a452UL, 0xc6bf79c6UL, 0xa015b5a0UL, 0x091b1209UL, 0xbd328fbdUL, 0x8c61ed8cUL, 0xcfa46bcfUL, 0x5de7ba5dUL, 0x11332211UL, 0x5fe1be5fUL, 0x01030201UL, 0xc5ba7fc5UL, 0x9f54cb9fUL, 0x3d477a3dUL, 0xa213b1a2UL, 0x9b58c39bUL, 0xc9ae67c9UL, 0x3b4d763bUL, 0xbe3789beUL, 0x51f3a251UL, 0x192b3219UL, 0x1f213e1fUL, 0x3f417e3fUL, 0x5ce4b85cUL, 0xb22391b2UL, 0xefc42befUL, 0x4ade944aUL, 0xcda26fcdUL, 0xbf348bbfUL, 0xba3b81baUL, 0x6fb1de6fUL, 0x64acc864UL, 0xd99e47d9UL, 0xf3e013f3UL, 0x3e427c3eUL, 0xb4299db4UL, 0xaa0ba1aaUL, 0xdc914ddcUL, 0xd58a5fd5UL, 0x060a0c06UL, 0xc0b575c0UL, 0x7e82fc7eUL, 0xf6ef19f6UL, 0x66aacc66UL, 0x6cb4d86cUL, 0x8479fd84UL, 0x7193e271UL, 0x38487038UL, 0xb93e87b9UL, 0x1d273a1dUL, 0x7f81fe7fUL, 0x9d52cf9dUL, 0x48d89048UL, 0x8b68e38bUL, 0x2a7e542aUL, 0xda9b41daUL, 0xa51abfa5UL, 0x33556633UL, 0x8273f182UL, 0x394b7239UL, 0xd68f59d6UL, 0x7888f078UL, 0x867ff986UL, 0xfafb01faUL, 0xe4d93de4UL, 0x2b7d562bUL, 0xa90ea7a9UL, 0x1e223c1eUL, 0x896ee789UL, 0x60a0c060UL, 0x6bbdd66bUL, 0xeacb21eaUL, 0x55ffaa55UL, 0x4cd4984cUL, 0xf7ec1bf7UL, 0xe2d331e2UL, }, { 0xb1b12697UL, 0xcecea769UL, 0xc3c3b073UL, 0x95954adfUL, 0x5a5aeeb4UL, 0xadad02afUL, 0xe7e7dc3bUL, 0x02020604UL, 0x4d4dd79aUL, 0x4444cc88UL, 0xfbfbf803UL, 0x919146d7UL, 0x0c0c1418UL, 0x87877cfbUL, 0xa1a116b7UL, 0x5050f0a0UL, 0xcbcba863UL, 0x6767a9ceUL, 0x5454fca8UL, 0xdddd924fUL, 0x4646ca8cUL, 0x8f8f64ebUL, 0xe1e1d637UL, 0x4e4ed29cUL, 0xf0f0e515UL, 0xfdfdf20fUL, 0xfcfcf10dUL, 0xebebc823UL, 0xf9f9fe07UL, 0xc4c4b97dUL, 0x1a1a2e34UL, 0x6e6eb2dcUL, 0x5e5ee2bcUL, 0xf5f5ea1fUL, 0xcccca16dUL, 0x8d8d62efUL, 0x1c1c2438UL, 0x5656faacUL, 0x4343c586UL, 0xfefef709UL, 0x0707090eUL, 0x6161a3c2UL, 0xf8f8fd05UL, 0x75759feaUL, 0x5959ebb2UL, 0xfffff40bUL, 0x03030506UL, 0x22226644UL, 0x8a8a6be1UL, 0xd1d18657UL, 0x13133526UL, 0xeeeec729UL, 0x88886de5UL, 0x00000000UL, 0x0e0e121cUL, 0x34345c68UL, 0x15153f2aUL, 0x808075f5UL, 0x949449ddUL, 0xe3e3d033UL, 0xededc22fUL, 0xb5b52a9fUL, 0x5353f5a6UL, 0x23236546UL, 0x4b4bdd96UL, 0x4747c98eUL, 0x1717392eUL, 0xa7a71cbbUL, 0x909045d5UL, 0x35355f6aUL, 0xabab08a3UL, 0xd8d89d45UL, 0xb8b83d85UL, 0xdfdf944bUL, 0x4f4fd19eUL, 0x5757f9aeUL, 0x9a9a5bc1UL, 0x929243d1UL, 0xdbdb9843UL, 0x1b1b2d36UL, 0x3c3c4478UL, 0xc8c8ad65UL, 0x99995ec7UL, 0x04040c08UL, 0x8e8e67e9UL, 0xe0e0d535UL, 0xd7d78c5bUL, 0x7d7d87faUL, 0x85857affUL, 0xbbbb3883UL, 0x4040c080UL, 0x2c2c7458UL, 0x3a3a4e74UL, 0x4545cf8aUL, 0xf1f1e617UL, 0x4242c684UL, 0x6565afcaUL, 0x20206040UL, 0x4141c382UL, 0x18182830UL, 0x727296e4UL, 0x25256f4aUL, 0x939340d3UL, 0x707090e0UL, 0x36365a6cUL, 0x05050f0aUL, 0xf2f2e311UL, 0x0b0b1d16UL, 0xa3a310b3UL, 0x79798bf2UL, 0xececc12dUL, 0x08081810UL, 0x2727694eUL, 0x31315362UL, 0x32325664UL, 0xb6b62f99UL, 0x7c7c84f8UL, 0xb0b02595UL, 0x0a0a1e14UL, 0x737395e6UL, 0x5b5bedb6UL, 0x7b7b8df6UL, 0xb7b72c9bUL, 0x818176f7UL, 0xd2d28351UL, 0x0d0d171aUL, 0x6a6abed4UL, 0x26266a4cUL, 0x9e9e57c9UL, 0x5858e8b0UL, 0x9c9c51cdUL, 0x838370f3UL, 0x74749ce8UL, 0xb3b32093UL, 0xacac01adUL, 0x30305060UL, 0x7a7a8ef4UL, 0x6969bbd2UL, 0x777799eeUL, 0x0f0f111eUL, 0xaeae07a9UL, 0x21216342UL, 0xdede9749UL, 0xd0d08555UL, 0x2e2e725cUL, 0x97974cdbUL, 0x10103020UL, 0xa4a419bdUL, 0x98985dc5UL, 0xa8a80da5UL, 0xd4d4895dUL, 0x6868b8d0UL, 0x2d2d775aUL, 0x6262a6c4UL, 0x29297b52UL, 0x6d6db7daUL, 0x16163a2cUL, 0x4949db92UL, 0x76769aecUL, 0xc7c7bc7bUL, 0xe8e8cd25UL, 0xc1c1b677UL, 0x96964fd9UL, 0x3737596eUL, 0xe5e5da3fUL, 0xcacaab61UL, 0xf4f4e91dUL, 0xe9e9ce27UL, 0x6363a5c6UL, 0x12123624UL, 0xc2c2b371UL, 0xa6a61fb9UL, 0x14143c28UL, 0xbcbc318dUL, 0xd3d38053UL, 0x28287850UL, 0xafaf04abUL, 0x2f2f715eUL, 0xe6e6df39UL, 0x24246c48UL, 0x5252f6a4UL, 0xc6c6bf79UL, 0xa0a015b5UL, 0x09091b12UL, 0xbdbd328fUL, 0x8c8c61edUL, 0xcfcfa46bUL, 0x5d5de7baUL, 0x11113322UL, 0x5f5fe1beUL, 0x01010302UL, 0xc5c5ba7fUL, 0x9f9f54cbUL, 0x3d3d477aUL, 0xa2a213b1UL, 0x9b9b58c3UL, 0xc9c9ae67UL, 0x3b3b4d76UL, 0xbebe3789UL, 0x5151f3a2UL, 0x19192b32UL, 0x1f1f213eUL, 0x3f3f417eUL, 0x5c5ce4b8UL, 0xb2b22391UL, 0xefefc42bUL, 0x4a4ade94UL, 0xcdcda26fUL, 0xbfbf348bUL, 0xbaba3b81UL, 0x6f6fb1deUL, 0x6464acc8UL, 0xd9d99e47UL, 0xf3f3e013UL, 0x3e3e427cUL, 0xb4b4299dUL, 0xaaaa0ba1UL, 0xdcdc914dUL, 0xd5d58a5fUL, 0x06060a0cUL, 0xc0c0b575UL, 0x7e7e82fcUL, 0xf6f6ef19UL, 0x6666aaccUL, 0x6c6cb4d8UL, 0x848479fdUL, 0x717193e2UL, 0x38384870UL, 0xb9b93e87UL, 0x1d1d273aUL, 0x7f7f81feUL, 0x9d9d52cfUL, 0x4848d890UL, 0x8b8b68e3UL, 0x2a2a7e54UL, 0xdada9b41UL, 0xa5a51abfUL, 0x33335566UL, 0x828273f1UL, 0x39394b72UL, 0xd6d68f59UL, 0x787888f0UL, 0x86867ff9UL, 0xfafafb01UL, 0xe4e4d93dUL, 0x2b2b7d56UL, 0xa9a90ea7UL, 0x1e1e223cUL, 0x89896ee7UL, 0x6060a0c0UL, 0x6b6bbdd6UL, 0xeaeacb21UL, 0x5555ffaaUL, 0x4c4cd498UL, 0xf7f7ec1bUL, 0xe2e2d331UL, }}; const word32 Square::Dec::Td[4][256] = { { 0xe368bc02UL, 0x5585620cUL, 0x2a3f2331UL, 0x61ab13f7UL, 0x98d46d72UL, 0x21cb9a19UL, 0x3c22a461UL, 0x459d3dcdUL, 0x05fdb423UL, 0x2bc4075fUL, 0x9b2c01c0UL, 0x3dd9800fUL, 0x486c5c74UL, 0xf97f7e85UL, 0xf173ab1fUL, 0xb6edde0eUL, 0x283c6bedUL, 0x4997781aUL, 0x9f2a918dUL, 0xc9579f33UL, 0xa907a8aaUL, 0xa50ded7dUL, 0x7c422d8fUL, 0x764db0c9UL, 0x4d91e857UL, 0xcea963ccUL, 0xb4ee96d2UL, 0x3028e1b6UL, 0x0df161b9UL, 0xbd196726UL, 0x419bad80UL, 0xc0a06ec7UL, 0x5183f241UL, 0x92dbf034UL, 0x6fa21efcUL, 0x8f32ce4cUL, 0x13e03373UL, 0x69a7c66dUL, 0xe56d6493UL, 0xbf1a2ffaUL, 0xbb1cbfb7UL, 0x587403b5UL, 0xe76e2c4fUL, 0x5d89b796UL, 0xe89c052aUL, 0x446619a3UL, 0x342e71fbUL, 0x0ff22965UL, 0xfe81827aUL, 0xb11322f1UL, 0xa30835ecUL, 0xcd510f7eUL, 0xff7aa614UL, 0x5c7293f8UL, 0x2fc29712UL, 0xf370e3c3UL, 0x992f491cUL, 0xd1431568UL, 0xc2a3261bUL, 0x88cc32b3UL, 0x8acf7a6fUL, 0xb0e8069fUL, 0x7a47f51eUL, 0xd2bb79daUL, 0xe6950821UL, 0x4398e55cUL, 0xd0b83106UL, 0x11e37bafUL, 0x7e416553UL, 0xccaa2b10UL, 0xd8b4e49cUL, 0x6456a7d4UL, 0xfb7c3659UL, 0x724b2084UL, 0xea9f4df6UL, 0x6a5faadfUL, 0x2dc1dfceUL, 0x70486858UL, 0xcaaff381UL, 0x0605d891UL, 0x5a774b69UL, 0x94de28a5UL, 0x39df1042UL, 0x813bc347UL, 0xfc82caa6UL, 0x23c8d2c5UL, 0x03f86cb2UL, 0x080cd59aUL, 0xdab7ac40UL, 0x7db909e1UL, 0x3824342cUL, 0xcf5247a2UL, 0xdcb274d1UL, 0x63a85b2bUL, 0x35d55595UL, 0x479e7511UL, 0x15e5ebe2UL, 0x4b9430c6UL, 0x4a6f14a8UL, 0x91239c86UL, 0x4c6acc39UL, 0x5f8aff4aUL, 0x0406904dUL, 0xee99ddbbUL, 0x1e1152caUL, 0xaaffc418UL, 0xeb646998UL, 0x07fefcffUL, 0x8b345e01UL, 0x567d0ebeUL, 0xbae79bd9UL, 0x4263c132UL, 0x75b5dc7bUL, 0x97264417UL, 0x67aecb66UL, 0x95250ccbUL, 0xec9a9567UL, 0x57862ad0UL, 0x60503799UL, 0xb8e4d305UL, 0x65ad83baUL, 0x19efae35UL, 0xa4f6c913UL, 0xc15b4aa9UL, 0x873e1bd6UL, 0xa0f0595eUL, 0x18148a5bUL, 0xaf02703bUL, 0xab04e076UL, 0xdd4950bfUL, 0xdf4a1863UL, 0xc6a5b656UL, 0x853d530aUL, 0xfa871237UL, 0x77b694a7UL, 0x4665517fUL, 0xed61b109UL, 0x1bece6e9UL, 0xd5458525UL, 0xf5753b52UL, 0x7fba413dUL, 0x27ce4288UL, 0xb2eb4e43UL, 0xd6bde997UL, 0x527b9ef3UL, 0x62537f45UL, 0x2c3afba0UL, 0x7bbcd170UL, 0xb91ff76bUL, 0x121b171dUL, 0xfd79eec8UL, 0x3a277cf0UL, 0x0c0a45d7UL, 0x96dd6079UL, 0x2233f6abUL, 0xacfa1c89UL, 0xc8acbb5dUL, 0xa10b7d30UL, 0xd4bea14bUL, 0xbee10b94UL, 0x25cd0a54UL, 0x547e4662UL, 0xa2f31182UL, 0x17e6a33eUL, 0x263566e6UL, 0xc3580275UL, 0x83388b9bUL, 0x7844bdc2UL, 0x020348dcUL, 0x4f92a08bUL, 0x2e39b37cUL, 0x4e6984e5UL, 0xf0888f71UL, 0x362d3927UL, 0x9cd2fd3fUL, 0x01fb246eUL, 0x893716ddUL, 0x00000000UL, 0xf68d57e0UL, 0xe293986cUL, 0x744ef815UL, 0x9320d45aUL, 0xad0138e7UL, 0xd3405db4UL, 0x1a17c287UL, 0xb3106a2dUL, 0x5078d62fUL, 0xf48e1f3cUL, 0xa70ea5a1UL, 0x71b34c36UL, 0x9ad725aeUL, 0x5e71db24UL, 0x161d8750UL, 0xef62f9d5UL, 0x8d318690UL, 0x1c121a16UL, 0xa6f581cfUL, 0x5b8c6f07UL, 0x37d61d49UL, 0x6e593a92UL, 0x84c67764UL, 0x86c53fb8UL, 0xd746cdf9UL, 0xe090d0b0UL, 0x29c74f83UL, 0xe49640fdUL, 0x0e090d0bUL, 0x6da15620UL, 0x8ec9ea22UL, 0xdb4c882eUL, 0xf776738eUL, 0xb515b2bcUL, 0x10185fc1UL, 0x322ba96aUL, 0x6ba48eb1UL, 0xaef95455UL, 0x406089eeUL, 0x6655ef08UL, 0xe9672144UL, 0x3e21ecbdUL, 0x2030be77UL, 0xf28bc7adUL, 0x80c0e729UL, 0x141ecf8cUL, 0xbce24348UL, 0xc4a6fe8aUL, 0x31d3c5d8UL, 0xb716fa60UL, 0x5380ba9dUL, 0xd94fc0f2UL, 0x1de93e78UL, 0x24362e3aUL, 0xe16bf4deUL, 0xcb54d7efUL, 0x09f7f1f4UL, 0x82c3aff5UL, 0x0bf4b928UL, 0x9d29d951UL, 0xc75e9238UL, 0xf8845aebUL, 0x90d8b8e8UL, 0xdeb13c0dUL, 0x33d08d04UL, 0x685ce203UL, 0xc55ddae4UL, 0x3bdc589eUL, 0x0a0f9d46UL, 0x3fdac8d3UL, 0x598f27dbUL, 0xa8fc8cc4UL, 0x79bf99acUL, 0x6c5a724eUL, 0x8ccaa2feUL, 0x9ed1b5e3UL, 0x1fea76a4UL, 0x73b004eaUL, }, { 0x02e368bcUL, 0x0c558562UL, 0x312a3f23UL, 0xf761ab13UL, 0x7298d46dUL, 0x1921cb9aUL, 0x613c22a4UL, 0xcd459d3dUL, 0x2305fdb4UL, 0x5f2bc407UL, 0xc09b2c01UL, 0x0f3dd980UL, 0x74486c5cUL, 0x85f97f7eUL, 0x1ff173abUL, 0x0eb6eddeUL, 0xed283c6bUL, 0x1a499778UL, 0x8d9f2a91UL, 0x33c9579fUL, 0xaaa907a8UL, 0x7da50dedUL, 0x8f7c422dUL, 0xc9764db0UL, 0x574d91e8UL, 0xcccea963UL, 0xd2b4ee96UL, 0xb63028e1UL, 0xb90df161UL, 0x26bd1967UL, 0x80419badUL, 0xc7c0a06eUL, 0x415183f2UL, 0x3492dbf0UL, 0xfc6fa21eUL, 0x4c8f32ceUL, 0x7313e033UL, 0x6d69a7c6UL, 0x93e56d64UL, 0xfabf1a2fUL, 0xb7bb1cbfUL, 0xb5587403UL, 0x4fe76e2cUL, 0x965d89b7UL, 0x2ae89c05UL, 0xa3446619UL, 0xfb342e71UL, 0x650ff229UL, 0x7afe8182UL, 0xf1b11322UL, 0xeca30835UL, 0x7ecd510fUL, 0x14ff7aa6UL, 0xf85c7293UL, 0x122fc297UL, 0xc3f370e3UL, 0x1c992f49UL, 0x68d14315UL, 0x1bc2a326UL, 0xb388cc32UL, 0x6f8acf7aUL, 0x9fb0e806UL, 0x1e7a47f5UL, 0xdad2bb79UL, 0x21e69508UL, 0x5c4398e5UL, 0x06d0b831UL, 0xaf11e37bUL, 0x537e4165UL, 0x10ccaa2bUL, 0x9cd8b4e4UL, 0xd46456a7UL, 0x59fb7c36UL, 0x84724b20UL, 0xf6ea9f4dUL, 0xdf6a5faaUL, 0xce2dc1dfUL, 0x58704868UL, 0x81caaff3UL, 0x910605d8UL, 0x695a774bUL, 0xa594de28UL, 0x4239df10UL, 0x47813bc3UL, 0xa6fc82caUL, 0xc523c8d2UL, 0xb203f86cUL, 0x9a080cd5UL, 0x40dab7acUL, 0xe17db909UL, 0x2c382434UL, 0xa2cf5247UL, 0xd1dcb274UL, 0x2b63a85bUL, 0x9535d555UL, 0x11479e75UL, 0xe215e5ebUL, 0xc64b9430UL, 0xa84a6f14UL, 0x8691239cUL, 0x394c6accUL, 0x4a5f8affUL, 0x4d040690UL, 0xbbee99ddUL, 0xca1e1152UL, 0x18aaffc4UL, 0x98eb6469UL, 0xff07fefcUL, 0x018b345eUL, 0xbe567d0eUL, 0xd9bae79bUL, 0x324263c1UL, 0x7b75b5dcUL, 0x17972644UL, 0x6667aecbUL, 0xcb95250cUL, 0x67ec9a95UL, 0xd057862aUL, 0x99605037UL, 0x05b8e4d3UL, 0xba65ad83UL, 0x3519efaeUL, 0x13a4f6c9UL, 0xa9c15b4aUL, 0xd6873e1bUL, 0x5ea0f059UL, 0x5b18148aUL, 0x3baf0270UL, 0x76ab04e0UL, 0xbfdd4950UL, 0x63df4a18UL, 0x56c6a5b6UL, 0x0a853d53UL, 0x37fa8712UL, 0xa777b694UL, 0x7f466551UL, 0x09ed61b1UL, 0xe91bece6UL, 0x25d54585UL, 0x52f5753bUL, 0x3d7fba41UL, 0x8827ce42UL, 0x43b2eb4eUL, 0x97d6bde9UL, 0xf3527b9eUL, 0x4562537fUL, 0xa02c3afbUL, 0x707bbcd1UL, 0x6bb91ff7UL, 0x1d121b17UL, 0xc8fd79eeUL, 0xf03a277cUL, 0xd70c0a45UL, 0x7996dd60UL, 0xab2233f6UL, 0x89acfa1cUL, 0x5dc8acbbUL, 0x30a10b7dUL, 0x4bd4bea1UL, 0x94bee10bUL, 0x5425cd0aUL, 0x62547e46UL, 0x82a2f311UL, 0x3e17e6a3UL, 0xe6263566UL, 0x75c35802UL, 0x9b83388bUL, 0xc27844bdUL, 0xdc020348UL, 0x8b4f92a0UL, 0x7c2e39b3UL, 0xe54e6984UL, 0x71f0888fUL, 0x27362d39UL, 0x3f9cd2fdUL, 0x6e01fb24UL, 0xdd893716UL, 0x00000000UL, 0xe0f68d57UL, 0x6ce29398UL, 0x15744ef8UL, 0x5a9320d4UL, 0xe7ad0138UL, 0xb4d3405dUL, 0x871a17c2UL, 0x2db3106aUL, 0x2f5078d6UL, 0x3cf48e1fUL, 0xa1a70ea5UL, 0x3671b34cUL, 0xae9ad725UL, 0x245e71dbUL, 0x50161d87UL, 0xd5ef62f9UL, 0x908d3186UL, 0x161c121aUL, 0xcfa6f581UL, 0x075b8c6fUL, 0x4937d61dUL, 0x926e593aUL, 0x6484c677UL, 0xb886c53fUL, 0xf9d746cdUL, 0xb0e090d0UL, 0x8329c74fUL, 0xfde49640UL, 0x0b0e090dUL, 0x206da156UL, 0x228ec9eaUL, 0x2edb4c88UL, 0x8ef77673UL, 0xbcb515b2UL, 0xc110185fUL, 0x6a322ba9UL, 0xb16ba48eUL, 0x55aef954UL, 0xee406089UL, 0x086655efUL, 0x44e96721UL, 0xbd3e21ecUL, 0x772030beUL, 0xadf28bc7UL, 0x2980c0e7UL, 0x8c141ecfUL, 0x48bce243UL, 0x8ac4a6feUL, 0xd831d3c5UL, 0x60b716faUL, 0x9d5380baUL, 0xf2d94fc0UL, 0x781de93eUL, 0x3a24362eUL, 0xdee16bf4UL, 0xefcb54d7UL, 0xf409f7f1UL, 0xf582c3afUL, 0x280bf4b9UL, 0x519d29d9UL, 0x38c75e92UL, 0xebf8845aUL, 0xe890d8b8UL, 0x0ddeb13cUL, 0x0433d08dUL, 0x03685ce2UL, 0xe4c55ddaUL, 0x9e3bdc58UL, 0x460a0f9dUL, 0xd33fdac8UL, 0xdb598f27UL, 0xc4a8fc8cUL, 0xac79bf99UL, 0x4e6c5a72UL, 0xfe8ccaa2UL, 0xe39ed1b5UL, 0xa41fea76UL, 0xea73b004UL, }, { 0xbc02e368UL, 0x620c5585UL, 0x23312a3fUL, 0x13f761abUL, 0x6d7298d4UL, 0x9a1921cbUL, 0xa4613c22UL, 0x3dcd459dUL, 0xb42305fdUL, 0x075f2bc4UL, 0x01c09b2cUL, 0x800f3dd9UL, 0x5c74486cUL, 0x7e85f97fUL, 0xab1ff173UL, 0xde0eb6edUL, 0x6bed283cUL, 0x781a4997UL, 0x918d9f2aUL, 0x9f33c957UL, 0xa8aaa907UL, 0xed7da50dUL, 0x2d8f7c42UL, 0xb0c9764dUL, 0xe8574d91UL, 0x63cccea9UL, 0x96d2b4eeUL, 0xe1b63028UL, 0x61b90df1UL, 0x6726bd19UL, 0xad80419bUL, 0x6ec7c0a0UL, 0xf2415183UL, 0xf03492dbUL, 0x1efc6fa2UL, 0xce4c8f32UL, 0x337313e0UL, 0xc66d69a7UL, 0x6493e56dUL, 0x2ffabf1aUL, 0xbfb7bb1cUL, 0x03b55874UL, 0x2c4fe76eUL, 0xb7965d89UL, 0x052ae89cUL, 0x19a34466UL, 0x71fb342eUL, 0x29650ff2UL, 0x827afe81UL, 0x22f1b113UL, 0x35eca308UL, 0x0f7ecd51UL, 0xa614ff7aUL, 0x93f85c72UL, 0x97122fc2UL, 0xe3c3f370UL, 0x491c992fUL, 0x1568d143UL, 0x261bc2a3UL, 0x32b388ccUL, 0x7a6f8acfUL, 0x069fb0e8UL, 0xf51e7a47UL, 0x79dad2bbUL, 0x0821e695UL, 0xe55c4398UL, 0x3106d0b8UL, 0x7baf11e3UL, 0x65537e41UL, 0x2b10ccaaUL, 0xe49cd8b4UL, 0xa7d46456UL, 0x3659fb7cUL, 0x2084724bUL, 0x4df6ea9fUL, 0xaadf6a5fUL, 0xdfce2dc1UL, 0x68587048UL, 0xf381caafUL, 0xd8910605UL, 0x4b695a77UL, 0x28a594deUL, 0x104239dfUL, 0xc347813bUL, 0xcaa6fc82UL, 0xd2c523c8UL, 0x6cb203f8UL, 0xd59a080cUL, 0xac40dab7UL, 0x09e17db9UL, 0x342c3824UL, 0x47a2cf52UL, 0x74d1dcb2UL, 0x5b2b63a8UL, 0x559535d5UL, 0x7511479eUL, 0xebe215e5UL, 0x30c64b94UL, 0x14a84a6fUL, 0x9c869123UL, 0xcc394c6aUL, 0xff4a5f8aUL, 0x904d0406UL, 0xddbbee99UL, 0x52ca1e11UL, 0xc418aaffUL, 0x6998eb64UL, 0xfcff07feUL, 0x5e018b34UL, 0x0ebe567dUL, 0x9bd9bae7UL, 0xc1324263UL, 0xdc7b75b5UL, 0x44179726UL, 0xcb6667aeUL, 0x0ccb9525UL, 0x9567ec9aUL, 0x2ad05786UL, 0x37996050UL, 0xd305b8e4UL, 0x83ba65adUL, 0xae3519efUL, 0xc913a4f6UL, 0x4aa9c15bUL, 0x1bd6873eUL, 0x595ea0f0UL, 0x8a5b1814UL, 0x703baf02UL, 0xe076ab04UL, 0x50bfdd49UL, 0x1863df4aUL, 0xb656c6a5UL, 0x530a853dUL, 0x1237fa87UL, 0x94a777b6UL, 0x517f4665UL, 0xb109ed61UL, 0xe6e91becUL, 0x8525d545UL, 0x3b52f575UL, 0x413d7fbaUL, 0x428827ceUL, 0x4e43b2ebUL, 0xe997d6bdUL, 0x9ef3527bUL, 0x7f456253UL, 0xfba02c3aUL, 0xd1707bbcUL, 0xf76bb91fUL, 0x171d121bUL, 0xeec8fd79UL, 0x7cf03a27UL, 0x45d70c0aUL, 0x607996ddUL, 0xf6ab2233UL, 0x1c89acfaUL, 0xbb5dc8acUL, 0x7d30a10bUL, 0xa14bd4beUL, 0x0b94bee1UL, 0x0a5425cdUL, 0x4662547eUL, 0x1182a2f3UL, 0xa33e17e6UL, 0x66e62635UL, 0x0275c358UL, 0x8b9b8338UL, 0xbdc27844UL, 0x48dc0203UL, 0xa08b4f92UL, 0xb37c2e39UL, 0x84e54e69UL, 0x8f71f088UL, 0x3927362dUL, 0xfd3f9cd2UL, 0x246e01fbUL, 0x16dd8937UL, 0x00000000UL, 0x57e0f68dUL, 0x986ce293UL, 0xf815744eUL, 0xd45a9320UL, 0x38e7ad01UL, 0x5db4d340UL, 0xc2871a17UL, 0x6a2db310UL, 0xd62f5078UL, 0x1f3cf48eUL, 0xa5a1a70eUL, 0x4c3671b3UL, 0x25ae9ad7UL, 0xdb245e71UL, 0x8750161dUL, 0xf9d5ef62UL, 0x86908d31UL, 0x1a161c12UL, 0x81cfa6f5UL, 0x6f075b8cUL, 0x1d4937d6UL, 0x3a926e59UL, 0x776484c6UL, 0x3fb886c5UL, 0xcdf9d746UL, 0xd0b0e090UL, 0x4f8329c7UL, 0x40fde496UL, 0x0d0b0e09UL, 0x56206da1UL, 0xea228ec9UL, 0x882edb4cUL, 0x738ef776UL, 0xb2bcb515UL, 0x5fc11018UL, 0xa96a322bUL, 0x8eb16ba4UL, 0x5455aef9UL, 0x89ee4060UL, 0xef086655UL, 0x2144e967UL, 0xecbd3e21UL, 0xbe772030UL, 0xc7adf28bUL, 0xe72980c0UL, 0xcf8c141eUL, 0x4348bce2UL, 0xfe8ac4a6UL, 0xc5d831d3UL, 0xfa60b716UL, 0xba9d5380UL, 0xc0f2d94fUL, 0x3e781de9UL, 0x2e3a2436UL, 0xf4dee16bUL, 0xd7efcb54UL, 0xf1f409f7UL, 0xaff582c3UL, 0xb9280bf4UL, 0xd9519d29UL, 0x9238c75eUL, 0x5aebf884UL, 0xb8e890d8UL, 0x3c0ddeb1UL, 0x8d0433d0UL, 0xe203685cUL, 0xdae4c55dUL, 0x589e3bdcUL, 0x9d460a0fUL, 0xc8d33fdaUL, 0x27db598fUL, 0x8cc4a8fcUL, 0x99ac79bfUL, 0x724e6c5aUL, 0xa2fe8ccaUL, 0xb5e39ed1UL, 0x76a41feaUL, 0x04ea73b0UL, }, { 0x68bc02e3UL, 0x85620c55UL, 0x3f23312aUL, 0xab13f761UL, 0xd46d7298UL, 0xcb9a1921UL, 0x22a4613cUL, 0x9d3dcd45UL, 0xfdb42305UL, 0xc4075f2bUL, 0x2c01c09bUL, 0xd9800f3dUL, 0x6c5c7448UL, 0x7f7e85f9UL, 0x73ab1ff1UL, 0xedde0eb6UL, 0x3c6bed28UL, 0x97781a49UL, 0x2a918d9fUL, 0x579f33c9UL, 0x07a8aaa9UL, 0x0ded7da5UL, 0x422d8f7cUL, 0x4db0c976UL, 0x91e8574dUL, 0xa963ccceUL, 0xee96d2b4UL, 0x28e1b630UL, 0xf161b90dUL, 0x196726bdUL, 0x9bad8041UL, 0xa06ec7c0UL, 0x83f24151UL, 0xdbf03492UL, 0xa21efc6fUL, 0x32ce4c8fUL, 0xe0337313UL, 0xa7c66d69UL, 0x6d6493e5UL, 0x1a2ffabfUL, 0x1cbfb7bbUL, 0x7403b558UL, 0x6e2c4fe7UL, 0x89b7965dUL, 0x9c052ae8UL, 0x6619a344UL, 0x2e71fb34UL, 0xf229650fUL, 0x81827afeUL, 0x1322f1b1UL, 0x0835eca3UL, 0x510f7ecdUL, 0x7aa614ffUL, 0x7293f85cUL, 0xc297122fUL, 0x70e3c3f3UL, 0x2f491c99UL, 0x431568d1UL, 0xa3261bc2UL, 0xcc32b388UL, 0xcf7a6f8aUL, 0xe8069fb0UL, 0x47f51e7aUL, 0xbb79dad2UL, 0x950821e6UL, 0x98e55c43UL, 0xb83106d0UL, 0xe37baf11UL, 0x4165537eUL, 0xaa2b10ccUL, 0xb4e49cd8UL, 0x56a7d464UL, 0x7c3659fbUL, 0x4b208472UL, 0x9f4df6eaUL, 0x5faadf6aUL, 0xc1dfce2dUL, 0x48685870UL, 0xaff381caUL, 0x05d89106UL, 0x774b695aUL, 0xde28a594UL, 0xdf104239UL, 0x3bc34781UL, 0x82caa6fcUL, 0xc8d2c523UL, 0xf86cb203UL, 0x0cd59a08UL, 0xb7ac40daUL, 0xb909e17dUL, 0x24342c38UL, 0x5247a2cfUL, 0xb274d1dcUL, 0xa85b2b63UL, 0xd5559535UL, 0x9e751147UL, 0xe5ebe215UL, 0x9430c64bUL, 0x6f14a84aUL, 0x239c8691UL, 0x6acc394cUL, 0x8aff4a5fUL, 0x06904d04UL, 0x99ddbbeeUL, 0x1152ca1eUL, 0xffc418aaUL, 0x646998ebUL, 0xfefcff07UL, 0x345e018bUL, 0x7d0ebe56UL, 0xe79bd9baUL, 0x63c13242UL, 0xb5dc7b75UL, 0x26441797UL, 0xaecb6667UL, 0x250ccb95UL, 0x9a9567ecUL, 0x862ad057UL, 0x50379960UL, 0xe4d305b8UL, 0xad83ba65UL, 0xefae3519UL, 0xf6c913a4UL, 0x5b4aa9c1UL, 0x3e1bd687UL, 0xf0595ea0UL, 0x148a5b18UL, 0x02703bafUL, 0x04e076abUL, 0x4950bfddUL, 0x4a1863dfUL, 0xa5b656c6UL, 0x3d530a85UL, 0x871237faUL, 0xb694a777UL, 0x65517f46UL, 0x61b109edUL, 0xece6e91bUL, 0x458525d5UL, 0x753b52f5UL, 0xba413d7fUL, 0xce428827UL, 0xeb4e43b2UL, 0xbde997d6UL, 0x7b9ef352UL, 0x537f4562UL, 0x3afba02cUL, 0xbcd1707bUL, 0x1ff76bb9UL, 0x1b171d12UL, 0x79eec8fdUL, 0x277cf03aUL, 0x0a45d70cUL, 0xdd607996UL, 0x33f6ab22UL, 0xfa1c89acUL, 0xacbb5dc8UL, 0x0b7d30a1UL, 0xbea14bd4UL, 0xe10b94beUL, 0xcd0a5425UL, 0x7e466254UL, 0xf31182a2UL, 0xe6a33e17UL, 0x3566e626UL, 0x580275c3UL, 0x388b9b83UL, 0x44bdc278UL, 0x0348dc02UL, 0x92a08b4fUL, 0x39b37c2eUL, 0x6984e54eUL, 0x888f71f0UL, 0x2d392736UL, 0xd2fd3f9cUL, 0xfb246e01UL, 0x3716dd89UL, 0x00000000UL, 0x8d57e0f6UL, 0x93986ce2UL, 0x4ef81574UL, 0x20d45a93UL, 0x0138e7adUL, 0x405db4d3UL, 0x17c2871aUL, 0x106a2db3UL, 0x78d62f50UL, 0x8e1f3cf4UL, 0x0ea5a1a7UL, 0xb34c3671UL, 0xd725ae9aUL, 0x71db245eUL, 0x1d875016UL, 0x62f9d5efUL, 0x3186908dUL, 0x121a161cUL, 0xf581cfa6UL, 0x8c6f075bUL, 0xd61d4937UL, 0x593a926eUL, 0xc6776484UL, 0xc53fb886UL, 0x46cdf9d7UL, 0x90d0b0e0UL, 0xc74f8329UL, 0x9640fde4UL, 0x090d0b0eUL, 0xa156206dUL, 0xc9ea228eUL, 0x4c882edbUL, 0x76738ef7UL, 0x15b2bcb5UL, 0x185fc110UL, 0x2ba96a32UL, 0xa48eb16bUL, 0xf95455aeUL, 0x6089ee40UL, 0x55ef0866UL, 0x672144e9UL, 0x21ecbd3eUL, 0x30be7720UL, 0x8bc7adf2UL, 0xc0e72980UL, 0x1ecf8c14UL, 0xe24348bcUL, 0xa6fe8ac4UL, 0xd3c5d831UL, 0x16fa60b7UL, 0x80ba9d53UL, 0x4fc0f2d9UL, 0xe93e781dUL, 0x362e3a24UL, 0x6bf4dee1UL, 0x54d7efcbUL, 0xf7f1f409UL, 0xc3aff582UL, 0xf4b9280bUL, 0x29d9519dUL, 0x5e9238c7UL, 0x845aebf8UL, 0xd8b8e890UL, 0xb13c0ddeUL, 0xd08d0433UL, 0x5ce20368UL, 0x5ddae4c5UL, 0xdc589e3bUL, 0x0f9d460aUL, 0xdac8d33fUL, 0x8f27db59UL, 0xfc8cc4a8UL, 0xbf99ac79UL, 0x5a724e6cUL, 0xcaa2fe8cUL, 0xd1b5e39eUL, 0xea76a41fUL, 0xb004ea73UL, }}; NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/nbtheory.cpp0000755000000000000000000005631112414772654020142 0ustar rootroot// nbtheory.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "nbtheory.h" #include "modarith.h" #include "algparam.h" #include #include #ifdef _OPENMP // needed in MSVC 2005 to generate correct manifest #include #endif NAMESPACE_BEGIN(CryptoPP) const word s_lastSmallPrime = 32719; struct NewPrimeTable { std::vector * operator()() const { const unsigned int maxPrimeTableSize = 3511; std::auto_ptr > pPrimeTable(new std::vector); std::vector &primeTable = *pPrimeTable; primeTable.reserve(maxPrimeTableSize); primeTable.push_back(2); unsigned int testEntriesEnd = 1; for (unsigned int p=3; p<=s_lastSmallPrime; p+=2) { unsigned int j; for (j=1; j &primeTable = Singleton, NewPrimeTable>().Ref(); size = (unsigned int)primeTable.size(); return &primeTable[0]; } bool IsSmallPrime(const Integer &p) { unsigned int primeTableSize; const word16 * primeTable = GetPrimeTable(primeTableSize); if (p.IsPositive() && p <= primeTable[primeTableSize-1]) return std::binary_search(primeTable, primeTable+primeTableSize, (word16)p.ConvertToLong()); else return false; } bool TrialDivision(const Integer &p, unsigned bound) { unsigned int primeTableSize; const word16 * primeTable = GetPrimeTable(primeTableSize); assert(primeTable[primeTableSize-1] >= bound); unsigned int i; for (i = 0; primeTable[i]3 && b>1 && b3 && b>1 && b>a; Integer z = a_exp_b_mod_c(b, m, n); if (z==1 || z==nminus1) return true; for (unsigned j=1; j3); Integer b; for (unsigned int i=0; i2); Integer b=3; unsigned int i=0; int j; while ((j=Jacobi(b.Squared()-4, n)) == 1) { if (++i==64 && n.IsSquare()) // avoid infinite loop if n is a square return false; ++b; ++b; } if (j==0) return false; else return Lucas(n+1, b, n)==2; } bool IsStrongLucasProbablePrime(const Integer &n) { if (n <= 1) return false; if (n.IsEven()) return n==2; assert(n>2); Integer b=3; unsigned int i=0; int j; while ((j=Jacobi(b.Squared()-4, n)) == 1) { if (++i==64 && n.IsSquare()) // avoid infinite loop if n is a square return false; ++b; ++b; } if (j==0) return false; Integer n1 = n+1; unsigned int a; // calculate a = largest power of 2 that divides n1 for (a=0; ; a++) if (n1.GetBit(a)) break; Integer m = n1>>a; Integer z = Lucas(m, b, n); if (z==2 || z==n-2) return true; for (i=1; i().Ref()) return SmallDivisorsTest(p); else return SmallDivisorsTest(p) && IsStrongProbablePrime(p, 3) && IsStrongLucasProbablePrime(p); } bool VerifyPrime(RandomNumberGenerator &rng, const Integer &p, unsigned int level) { bool pass = IsPrime(p) && RabinMillerTest(rng, p, 1); if (level >= 1) pass = pass && RabinMillerTest(rng, p, 10); return pass; } unsigned int PrimeSearchInterval(const Integer &max) { return max.BitCount(); } static inline bool FastProbablePrimeTest(const Integer &n) { return IsStrongProbablePrime(n,2); } AlgorithmParameters MakeParametersForTwoPrimesOfEqualSize(unsigned int productBitLength) { if (productBitLength < 16) throw InvalidArgument("invalid bit length"); Integer minP, maxP; if (productBitLength%2==0) { minP = Integer(182) << (productBitLength/2-8); maxP = Integer::Power2(productBitLength/2)-1; } else { minP = Integer::Power2((productBitLength-1)/2); maxP = Integer(181) << ((productBitLength+1)/2-8); } return MakeParameters("RandomNumberType", Integer::PRIME)("Min", minP)("Max", maxP); } class PrimeSieve { public: // delta == 1 or -1 means double sieve with p = 2*q + delta PrimeSieve(const Integer &first, const Integer &last, const Integer &step, signed int delta=0); bool NextCandidate(Integer &c); void DoSieve(); static void SieveSingle(std::vector &sieve, word16 p, const Integer &first, const Integer &step, word16 stepInv); Integer m_first, m_last, m_step; signed int m_delta; word m_next; std::vector m_sieve; }; PrimeSieve::PrimeSieve(const Integer &first, const Integer &last, const Integer &step, signed int delta) : m_first(first), m_last(last), m_step(step), m_delta(delta), m_next(0) { DoSieve(); } bool PrimeSieve::NextCandidate(Integer &c) { bool safe = SafeConvert(std::find(m_sieve.begin()+m_next, m_sieve.end(), false) - m_sieve.begin(), m_next); assert(safe); if (m_next == m_sieve.size()) { m_first += long(m_sieve.size())*m_step; if (m_first > m_last) return false; else { m_next = 0; DoSieve(); return NextCandidate(c); } } else { c = m_first + long(m_next)*m_step; ++m_next; return true; } } void PrimeSieve::SieveSingle(std::vector &sieve, word16 p, const Integer &first, const Integer &step, word16 stepInv) { if (stepInv) { size_t sieveSize = sieve.size(); size_t j = (word32(p-(first%p))*stepInv) % p; // if the first multiple of p is p, skip it if (first.WordCount() <= 1 && first + step*long(j) == p) j += p; for (; j < sieveSize; j += p) sieve[j] = true; } } void PrimeSieve::DoSieve() { unsigned int primeTableSize; const word16 * primeTable = GetPrimeTable(primeTableSize); const unsigned int maxSieveSize = 32768; unsigned int sieveSize = STDMIN(Integer(maxSieveSize), (m_last-m_first)/m_step+1).ConvertToLong(); m_sieve.clear(); m_sieve.resize(sieveSize, false); if (m_delta == 0) { for (unsigned int i = 0; i < primeTableSize; ++i) SieveSingle(m_sieve, primeTable[i], m_first, m_step, (word16)m_step.InverseMod(primeTable[i])); } else { assert(m_step%2==0); Integer qFirst = (m_first-m_delta) >> 1; Integer halfStep = m_step >> 1; for (unsigned int i = 0; i < primeTableSize; ++i) { word16 p = primeTable[i]; word16 stepInv = (word16)m_step.InverseMod(p); SieveSingle(m_sieve, p, m_first, m_step, stepInv); word16 halfStepInv = 2*stepInv < p ? 2*stepInv : 2*stepInv-p; SieveSingle(m_sieve, p, qFirst, halfStep, halfStepInv); } } } bool FirstPrime(Integer &p, const Integer &max, const Integer &equiv, const Integer &mod, const PrimeSelector *pSelector) { assert(!equiv.IsNegative() && equiv < mod); Integer gcd = GCD(equiv, mod); if (gcd != Integer::One()) { // the only possible prime p such that p%mod==equiv where GCD(mod,equiv)!=1 is GCD(mod,equiv) if (p <= gcd && gcd <= max && IsPrime(gcd) && (!pSelector || pSelector->IsAcceptable(gcd))) { p = gcd; return true; } else return false; } unsigned int primeTableSize; const word16 * primeTable = GetPrimeTable(primeTableSize); if (p <= primeTable[primeTableSize-1]) { const word16 *pItr; --p; if (p.IsPositive()) pItr = std::upper_bound(primeTable, primeTable+primeTableSize, (word)p.ConvertToLong()); else pItr = primeTable; while (pItr < primeTable+primeTableSize && !(*pItr%mod == equiv && (!pSelector || pSelector->IsAcceptable(*pItr)))) ++pItr; if (pItr < primeTable+primeTableSize) { p = *pItr; return p <= max; } p = primeTable[primeTableSize-1]+1; } assert(p > primeTable[primeTableSize-1]); if (mod.IsOdd()) return FirstPrime(p, max, CRT(equiv, mod, 1, 2, 1), mod<<1, pSelector); p += (equiv-p)%mod; if (p>max) return false; PrimeSieve sieve(p, max, mod); while (sieve.NextCandidate(p)) { if ((!pSelector || pSelector->IsAcceptable(p)) && FastProbablePrimeTest(p) && IsPrime(p)) return true; } return false; } // the following two functions are based on code and comments provided by Preda Mihailescu static bool ProvePrime(const Integer &p, const Integer &q) { assert(p < q*q*q); assert(p % q == 1); // this is the Quisquater test. Numbers p having passed the Lucas - Lehmer test // for q and verifying p < q^3 can only be built up of two factors, both = 1 mod q, // or be prime. The next two lines build the discriminant of a quadratic equation // which holds iff p is built up of two factors (excercise ... ) Integer r = (p-1)/q; if (((r%q).Squared()-4*(r/q)).IsSquare()) return false; unsigned int primeTableSize; const word16 * primeTable = GetPrimeTable(primeTableSize); assert(primeTableSize >= 50); for (int i=0; i<50; i++) { Integer b = a_exp_b_mod_c(primeTable[i], r, p); if (b != 1) return a_exp_b_mod_c(b, q, p) == 1; } return false; } Integer MihailescuProvablePrime(RandomNumberGenerator &rng, unsigned int pbits) { Integer p; Integer minP = Integer::Power2(pbits-1); Integer maxP = Integer::Power2(pbits) - 1; if (maxP <= Integer(s_lastSmallPrime).Squared()) { // Randomize() will generate a prime provable by trial division p.Randomize(rng, minP, maxP, Integer::PRIME); return p; } unsigned int qbits = (pbits+2)/3 + 1 + rng.GenerateWord32(0, pbits/36); Integer q = MihailescuProvablePrime(rng, qbits); Integer q2 = q<<1; while (true) { // this initializes the sieve to search in the arithmetic // progression p = p_0 + \lambda * q2 = p_0 + 2 * \lambda * q, // with q the recursively generated prime above. We will be able // to use Lucas tets for proving primality. A trick of Quisquater // allows taking q > cubic_root(p) rather then square_root: this // decreases the recursion. p.Randomize(rng, minP, maxP, Integer::ANY, 1, q2); PrimeSieve sieve(p, STDMIN(p+PrimeSearchInterval(maxP)*q2, maxP), q2); while (sieve.NextCandidate(p)) { if (FastProbablePrimeTest(p) && ProvePrime(p, q)) return p; } } // not reached return p; } Integer MaurerProvablePrime(RandomNumberGenerator &rng, unsigned int bits) { const unsigned smallPrimeBound = 29, c_opt=10; Integer p; unsigned int primeTableSize; const word16 * primeTable = GetPrimeTable(primeTableSize); if (bits < smallPrimeBound) { do p.Randomize(rng, Integer::Power2(bits-1), Integer::Power2(bits)-1, Integer::ANY, 1, 2); while (TrialDivision(p, 1 << ((bits+1)/2))); } else { const unsigned margin = bits > 50 ? 20 : (bits-10)/2; double relativeSize; do relativeSize = pow(2.0, double(rng.GenerateWord32())/0xffffffff - 1); while (bits * relativeSize >= bits - margin); Integer a,b; Integer q = MaurerProvablePrime(rng, unsigned(bits*relativeSize)); Integer I = Integer::Power2(bits-2)/q; Integer I2 = I << 1; unsigned int trialDivisorBound = (unsigned int)STDMIN((unsigned long)primeTable[primeTableSize-1], (unsigned long)bits*bits/c_opt); bool success = false; while (!success) { p.Randomize(rng, I, I2, Integer::ANY); p *= q; p <<= 1; ++p; if (!TrialDivision(p, trialDivisorBound)) { a.Randomize(rng, 2, p-1, Integer::ANY); b = a_exp_b_mod_c(a, (p-1)/q, p); success = (GCD(b-1, p) == 1) && (a_exp_b_mod_c(b, q, p) == 1); } } } return p; } Integer CRT(const Integer &xp, const Integer &p, const Integer &xq, const Integer &q, const Integer &u) { // isn't operator overloading great? return p * (u * (xq-xp) % q) + xp; /* Integer t1 = xq-xp; cout << hex << t1 << endl; Integer t2 = u * t1; cout << hex << t2 << endl; Integer t3 = t2 % q; cout << hex << t3 << endl; Integer t4 = p * t3; cout << hex << t4 << endl; Integer t5 = t4 + xp; cout << hex << t5 << endl; return t5; */ } Integer ModularSquareRoot(const Integer &a, const Integer &p) { if (p%4 == 3) return a_exp_b_mod_c(a, (p+1)/4, p); Integer q=p-1; unsigned int r=0; while (q.IsEven()) { r++; q >>= 1; } Integer n=2; while (Jacobi(n, p) != -1) ++n; Integer y = a_exp_b_mod_c(n, q, p); Integer x = a_exp_b_mod_c(a, (q-1)/2, p); Integer b = (x.Squared()%p)*a%p; x = a*x%p; Integer tempb, t; while (b != 1) { unsigned m=0; tempb = b; do { m++; b = b.Squared()%p; if (m==r) return Integer::Zero(); } while (b != 1); t = y; for (unsigned i=0; i>= 1; b >>= 1; k++; } while (a[0]==0) a >>= 1; while (b[0]==0) b >>= 1; while (1) { switch (a.Compare(b)) { case -1: b -= a; while (b[0]==0) b >>= 1; break; case 0: return (a <<= k); case 1: a -= b; while (a[0]==0) a >>= 1; break; default: assert(false); } } } Integer EuclideanMultiplicativeInverse(const Integer &a, const Integer &b) { assert(b.Positive()); if (a.Negative()) return EuclideanMultiplicativeInverse(a%b, b); if (b[0]==0) { if (!b || a[0]==0) return Integer::Zero(); // no inverse if (a==1) return 1; Integer u = EuclideanMultiplicativeInverse(b, a); if (!u) return Integer::Zero(); // no inverse else return (b*(a-u)+1)/a; } Integer u=1, d=a, v1=b, v3=b, t1, t3, b2=(b+1)>>1; if (a[0]) { t1 = Integer::Zero(); t3 = -b; } else { t1 = b2; t3 = a>>1; } while (!!t3) { while (t3[0]==0) { t3 >>= 1; if (t1[0]==0) t1 >>= 1; else { t1 >>= 1; t1 += b2; } } if (t3.Positive()) { u = t1; d = t3; } else { v1 = b-t1; v3 = -t3; } t1 = u-v1; t3 = d-v3; if (t1.Negative()) t1 += b; } if (d==1) return u; else return Integer::Zero(); // no inverse } */ int Jacobi(const Integer &aIn, const Integer &bIn) { assert(bIn.IsOdd()); Integer b = bIn, a = aIn%bIn; int result = 1; while (!!a) { unsigned i=0; while (a.GetBit(i)==0) i++; a>>=i; if (i%2==1 && (b%8==3 || b%8==5)) result = -result; if (a%4==3 && b%4==3) result = -result; std::swap(a, b); a %= b; } return (b==1) ? result : 0; } Integer Lucas(const Integer &e, const Integer &pIn, const Integer &n) { unsigned i = e.BitCount(); if (i==0) return Integer::Two(); MontgomeryRepresentation m(n); Integer p=m.ConvertIn(pIn%n), two=m.ConvertIn(Integer::Two()); Integer v=p, v1=m.Subtract(m.Square(p), two); i--; while (i--) { if (e.GetBit(i)) { // v = (v*v1 - p) % m; v = m.Subtract(m.Multiply(v,v1), p); // v1 = (v1*v1 - 2) % m; v1 = m.Subtract(m.Square(v1), two); } else { // v1 = (v*v1 - p) % m; v1 = m.Subtract(m.Multiply(v,v1), p); // v = (v*v - 2) % m; v = m.Subtract(m.Square(v), two); } } return m.ConvertOut(v); } // This is Peter Montgomery's unpublished Lucas sequence evalutation algorithm. // The total number of multiplies and squares used is less than the binary // algorithm (see above). Unfortunately I can't get it to run as fast as // the binary algorithm because of the extra overhead. /* Integer Lucas(const Integer &n, const Integer &P, const Integer &modulus) { if (!n) return 2; #define f(A, B, C) m.Subtract(m.Multiply(A, B), C) #define X2(A) m.Subtract(m.Square(A), two) #define X3(A) m.Multiply(A, m.Subtract(m.Square(A), three)) MontgomeryRepresentation m(modulus); Integer two=m.ConvertIn(2), three=m.ConvertIn(3); Integer A=m.ConvertIn(P), B, C, p, d=n, e, r, t, T, U; while (d!=1) { p = d; unsigned int b = WORD_BITS * p.WordCount(); Integer alpha = (Integer(5)<<(2*b-2)).SquareRoot() - Integer::Power2(b-1); r = (p*alpha)>>b; e = d-r; B = A; C = two; d = r; while (d!=e) { if (d>2)) if ((dm3+em3==0 || dm3+em3==3) && (t = e, t >>= 2, t += e, d <= t)) { // #1 // t = (d+d-e)/3; // t = d; t += d; t -= e; t /= 3; // e = (e+e-d)/3; // e += e; e -= d; e /= 3; // d = t; // t = (d+e)/3 t = d; t += e; t /= 3; e -= t; d -= t; T = f(A, B, C); U = f(T, A, B); B = f(T, B, A); A = U; continue; } // if (dm6 == em6 && d <= e + (e>>2)) if (dm3 == em3 && dm2 == em2 && (t = e, t >>= 2, t += e, d <= t)) { // #2 // d = (d-e)>>1; d -= e; d >>= 1; B = f(A, B, C); A = X2(A); continue; } // if (d <= (e<<2)) if (d <= (t = e, t <<= 2)) { // #3 d -= e; C = f(A, B, C); swap(B, C); continue; } if (dm2 == em2) { // #4 // d = (d-e)>>1; d -= e; d >>= 1; B = f(A, B, C); A = X2(A); continue; } if (dm2 == 0) { // #5 d >>= 1; C = f(A, C, B); A = X2(A); continue; } if (dm3 == 0) { // #6 // d = d/3 - e; d /= 3; d -= e; T = X2(A); C = f(T, f(A, B, C), C); swap(B, C); A = f(T, A, A); continue; } if (dm3+em3==0 || dm3+em3==3) { // #7 // d = (d-e-e)/3; d -= e; d -= e; d /= 3; T = f(A, B, C); B = f(T, A, B); A = X3(A); continue; } if (dm3 == em3) { // #8 // d = (d-e)/3; d -= e; d /= 3; T = f(A, B, C); C = f(A, C, B); B = T; A = X3(A); continue; } assert(em2 == 0); // #9 e >>= 1; C = f(C, B, A); B = X2(B); } A = f(A, B, C); } #undef f #undef X2 #undef X3 return m.ConvertOut(A); } */ Integer InverseLucas(const Integer &e, const Integer &m, const Integer &p, const Integer &q, const Integer &u) { Integer d = (m*m-4); Integer p2, q2; #pragma omp parallel #pragma omp sections { #pragma omp section { p2 = p-Jacobi(d,p); p2 = Lucas(EuclideanMultiplicativeInverse(e,p2), m, p); } #pragma omp section { q2 = q-Jacobi(d,q); q2 = Lucas(EuclideanMultiplicativeInverse(e,q2), m, q); } } return CRT(p2, p, q2, q, u); } unsigned int FactoringWorkFactor(unsigned int n) { // extrapolated from the table in Odlyzko's "The Future of Integer Factorization" // updated to reflect the factoring of RSA-130 if (n<5) return 0; else return (unsigned int)(2.4 * pow((double)n, 1.0/3.0) * pow(log(double(n)), 2.0/3.0) - 5); } unsigned int DiscreteLogWorkFactor(unsigned int n) { // assuming discrete log takes about the same time as factoring if (n<5) return 0; else return (unsigned int)(2.4 * pow((double)n, 1.0/3.0) * pow(log(double(n)), 2.0/3.0) - 5); } // ******************************************************** void PrimeAndGenerator::Generate(signed int delta, RandomNumberGenerator &rng, unsigned int pbits, unsigned int qbits) { // no prime exists for delta = -1, qbits = 4, and pbits = 5 assert(qbits > 4); assert(pbits > qbits); if (qbits+1 == pbits) { Integer minP = Integer::Power2(pbits-1); Integer maxP = Integer::Power2(pbits) - 1; bool success = false; while (!success) { p.Randomize(rng, minP, maxP, Integer::ANY, 6+5*delta, 12); PrimeSieve sieve(p, STDMIN(p+PrimeSearchInterval(maxP)*12, maxP), 12, delta); while (sieve.NextCandidate(p)) { assert(IsSmallPrime(p) || SmallDivisorsTest(p)); q = (p-delta) >> 1; assert(IsSmallPrime(q) || SmallDivisorsTest(q)); if (FastProbablePrimeTest(q) && FastProbablePrimeTest(p) && IsPrime(q) && IsPrime(p)) { success = true; break; } } } if (delta == 1) { // find g such that g is a quadratic residue mod p, then g has order q // g=4 always works, but this way we get the smallest quadratic residue (other than 1) for (g=2; Jacobi(g, p) != 1; ++g) {} // contributed by Walt Tuvell: g should be the following according to the Law of Quadratic Reciprocity assert((p%8==1 || p%8==7) ? g==2 : (p%12==1 || p%12==11) ? g==3 : g==4); } else { assert(delta == -1); // find g such that g*g-4 is a quadratic non-residue, // and such that g has order q for (g=3; ; ++g) if (Jacobi(g*g-4, p)==-1 && Lucas(q, g, p)==2) break; } } else { Integer minQ = Integer::Power2(qbits-1); Integer maxQ = Integer::Power2(qbits) - 1; Integer minP = Integer::Power2(pbits-1); Integer maxP = Integer::Power2(pbits) - 1; do { q.Randomize(rng, minQ, maxQ, Integer::PRIME); } while (!p.Randomize(rng, minP, maxP, Integer::PRIME, delta%q, q)); // find a random g of order q if (delta==1) { do { Integer h(rng, 2, p-2, Integer::ANY); g = a_exp_b_mod_c(h, (p-1)/q, p); } while (g <= 1); assert(a_exp_b_mod_c(g, q, p)==1); } else { assert(delta==-1); do { Integer h(rng, 3, p-1, Integer::ANY); if (Jacobi(h*h-4, p)==1) continue; g = Lucas((p+1)/q, h, p); } while (g <= 2); assert(Lucas(q, g, p) == 2); } } } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/cryptlib.h0000755000000000000000000022167312414772654017612 0ustar rootroot// cryptlib.h - written and placed in the public domain by Wei Dai /*! \file This file contains the declarations for the abstract base classes that provide a uniform interface to this library. */ /*! \mainpage Crypto++ Library 5.6.1 API Reference
Abstract Base Classes
cryptlib.h
Authenticated Encryption
AuthenticatedSymmetricCipherDocumentation
Symmetric Ciphers
SymmetricCipherDocumentation
Hash Functions
SHA1, SHA224, SHA256, SHA384, SHA512, Tiger, Whirlpool, RIPEMD160, RIPEMD320, RIPEMD128, RIPEMD256, Weak1::MD2, Weak1::MD4, Weak1::MD5
Non-Cryptographic Checksums
CRC32, Adler32
Message Authentication Codes
VMAC, HMAC, CBC_MAC, CMAC, DMAC, TTMAC, GCM (GMAC)
Random Number Generators
NullRNG(), LC_RNG, RandomPool, BlockingRng, NonblockingRng, AutoSeededRandomPool, AutoSeededX917RNG, #DefaultAutoSeededRNG
Password-based Cryptography
PasswordBasedKeyDerivationFunction
Public Key Cryptosystems
DLIES, ECIES, LUCES, RSAES, RabinES, LUC_IES
Public Key Signature Schemes
DSA, GDSA, ECDSA, NR, ECNR, LUCSS, RSASS, RSASS_ISO, RabinSS, RWSS, ESIGN
Key Agreement
#DH, DH2, #MQV, ECDH, ECMQV, XTR_DH
Algebraic Structures
Integer, PolynomialMod2, PolynomialOver, RingOfPolynomialsOver, ModularArithmetic, MontgomeryRepresentation, GFP2_ONB, GF2NP, GF256, GF2_32, EC2N, ECP
Secret Sharing and Information Dispersal
SecretSharing, SecretRecovery, InformationDispersal, InformationRecovery
Compression
Deflator, Inflator, Gzip, Gunzip, ZlibCompressor, ZlibDecompressor
Input Source Classes
StringSource, #ArraySource, FileSource, SocketSource, WindowsPipeSource, RandomNumberSource
Output Sink Classes
StringSinkTemplate, ArraySink, FileSink, SocketSink, WindowsPipeSink, RandomNumberSink
Filter Wrappers
StreamTransformationFilter, HashFilter, HashVerificationFilter, SignerFilter, SignatureVerificationFilter
Binary to Text Encoders and Decoders
HexEncoder, HexDecoder, Base64Encoder, Base64Decoder, Base32Encoder, Base32Decoder
Wrappers for OS features
Timer, Socket, WindowsHandle, ThreadLocalStorage, ThreadUserTimer
FIPS 140 related
fips140.h
In the DLL version of Crypto++, only the following implementation class are available.
Block Ciphers
AES, DES_EDE2, DES_EDE3, SKIPJACK
Cipher Modes (replace template parameter BC with one of the block ciphers above)
ECB_Mode\, CTR_Mode\, CBC_Mode\, CFB_FIPS_Mode\, OFB_Mode\, GCM\
Hash Functions
SHA1, SHA224, SHA256, SHA384, SHA512
Public Key Signature Schemes (replace template parameter H with one of the hash functions above)
RSASS\, RSASS\, RSASS_ISO\, RWSS\, DSA, ECDSA\, ECDSA\
Message Authentication Codes (replace template parameter H with one of the hash functions above)
HMAC\, CBC_MAC\, CBC_MAC\, GCM\
Random Number Generators
#DefaultAutoSeededRNG (AutoSeededX917RNG\)
Key Agreement
#DH
Public Key Cryptosystems
RSAES\ \>

This reference manual is a work in progress. Some classes are still lacking detailed descriptions.

Click here to download a zip archive containing this manual.

Thanks to Ryan Phillips for providing the Doxygen configuration file and getting me started with this manual. */ #ifndef CRYPTOPP_CRYPTLIB_H #define CRYPTOPP_CRYPTLIB_H #include "config.h" #include "stdcpp.h" NAMESPACE_BEGIN(CryptoPP) // forward declarations class Integer; class RandomNumberGenerator; class BufferedTransformation; //! used to specify a direction for a cipher to operate in (encrypt or decrypt) enum CipherDir {ENCRYPTION, DECRYPTION}; //! used to represent infinite time const unsigned long INFINITE_TIME = ULONG_MAX; // VC60 workaround: using enums as template parameters causes problems template struct EnumToType { static ENUM_TYPE ToEnum() {return (ENUM_TYPE)VALUE;} }; enum ByteOrder {LITTLE_ENDIAN_ORDER = 0, BIG_ENDIAN_ORDER = 1}; typedef EnumToType LittleEndian; typedef EnumToType BigEndian; //! base class for all exceptions thrown by Crypto++ class CRYPTOPP_DLL Exception : public std::exception { public: //! error types enum ErrorType { //! a method is not implemented NOT_IMPLEMENTED, //! invalid function argument INVALID_ARGUMENT, //! BufferedTransformation received a Flush(true) signal but can't flush buffers CANNOT_FLUSH, //! data integerity check (such as CRC or MAC) failed DATA_INTEGRITY_CHECK_FAILED, //! received input data that doesn't conform to expected format INVALID_DATA_FORMAT, //! error reading from input device or writing to output device IO_ERROR, //! some error not belong to any of the above categories OTHER_ERROR }; explicit Exception(ErrorType errorType, const std::string &s) : m_errorType(errorType), m_what(s) {} virtual ~Exception() throw() {} const char *what() const throw() {return (m_what.c_str());} const std::string &GetWhat() const {return m_what;} void SetWhat(const std::string &s) {m_what = s;} ErrorType GetErrorType() const {return m_errorType;} void SetErrorType(ErrorType errorType) {m_errorType = errorType;} private: ErrorType m_errorType; std::string m_what; }; //! exception thrown when an invalid argument is detected class CRYPTOPP_DLL InvalidArgument : public Exception { public: explicit InvalidArgument(const std::string &s) : Exception(INVALID_ARGUMENT, s) {} }; //! exception thrown when input data is received that doesn't conform to expected format class CRYPTOPP_DLL InvalidDataFormat : public Exception { public: explicit InvalidDataFormat(const std::string &s) : Exception(INVALID_DATA_FORMAT, s) {} }; //! exception thrown by decryption filters when trying to decrypt an invalid ciphertext class CRYPTOPP_DLL InvalidCiphertext : public InvalidDataFormat { public: explicit InvalidCiphertext(const std::string &s) : InvalidDataFormat(s) {} }; //! exception thrown by a class if a non-implemented method is called class CRYPTOPP_DLL NotImplemented : public Exception { public: explicit NotImplemented(const std::string &s) : Exception(NOT_IMPLEMENTED, s) {} }; //! exception thrown by a class when Flush(true) is called but it can't completely flush its buffers class CRYPTOPP_DLL CannotFlush : public Exception { public: explicit CannotFlush(const std::string &s) : Exception(CANNOT_FLUSH, s) {} }; //! error reported by the operating system class CRYPTOPP_DLL OS_Error : public Exception { public: OS_Error(ErrorType errorType, const std::string &s, const std::string& operation, int errorCode) : Exception(errorType, s), m_operation(operation), m_errorCode(errorCode) {} ~OS_Error() throw() {} // the operating system API that reported the error const std::string & GetOperation() const {return m_operation;} // the error code return by the operating system int GetErrorCode() const {return m_errorCode;} protected: std::string m_operation; int m_errorCode; }; //! used to return decoding results struct CRYPTOPP_DLL DecodingResult { explicit DecodingResult() : isValidCoding(false), messageLength(0) {} explicit DecodingResult(size_t len) : isValidCoding(true), messageLength(len) {} bool operator==(const DecodingResult &rhs) const {return isValidCoding == rhs.isValidCoding && messageLength == rhs.messageLength;} bool operator!=(const DecodingResult &rhs) const {return !operator==(rhs);} bool isValidCoding; size_t messageLength; #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY operator size_t() const {return isValidCoding ? messageLength : 0;} #endif }; //! interface for retrieving values given their names /*! \note This class is used to safely pass a variable number of arbitrarily typed arguments to functions and to read values from keys and crypto parameters. \note To obtain an object that implements NameValuePairs for the purpose of parameter passing, use the MakeParameters() function. \note To get a value from NameValuePairs, you need to know the name and the type of the value. Call GetValueNames() on a NameValuePairs object to obtain a list of value names that it supports. Then look at the Name namespace documentation to see what the type of each value is, or alternatively, call GetIntValue() with the value name, and if the type is not int, a ValueTypeMismatch exception will be thrown and you can get the actual type from the exception object. */ class CRYPTOPP_NO_VTABLE NameValuePairs { public: virtual ~NameValuePairs() {} //! exception thrown when trying to retrieve a value using a different type than expected class CRYPTOPP_DLL ValueTypeMismatch : public InvalidArgument { public: ValueTypeMismatch(const std::string &name, const std::type_info &stored, const std::type_info &retrieving) : InvalidArgument("NameValuePairs: type mismatch for '" + name + "', stored '" + stored.name() + "', trying to retrieve '" + retrieving.name() + "'") , m_stored(stored), m_retrieving(retrieving) {} const std::type_info & GetStoredTypeInfo() const {return m_stored;} const std::type_info & GetRetrievingTypeInfo() const {return m_retrieving;} private: const std::type_info &m_stored; const std::type_info &m_retrieving; }; //! get a copy of this object or a subobject of it template bool GetThisObject(T &object) const { return GetValue((std::string("ThisObject:")+typeid(T).name()).c_str(), object); } //! get a pointer to this object, as a pointer to T template bool GetThisPointer(T *&p) const { return GetValue((std::string("ThisPointer:")+typeid(T).name()).c_str(), p); } //! get a named value, returns true if the name exists template bool GetValue(const char *name, T &value) const { return GetVoidValue(name, typeid(T), &value); } //! get a named value, returns the default if the name doesn't exist template T GetValueWithDefault(const char *name, T defaultValue) const { GetValue(name, defaultValue); return defaultValue; } //! get a list of value names that can be retrieved CRYPTOPP_DLL std::string GetValueNames() const {std::string result; GetValue("ValueNames", result); return result;} //! get a named value with type int /*! used to ensure we don't accidentally try to get an unsigned int or some other type when we mean int (which is the most common case) */ CRYPTOPP_DLL bool GetIntValue(const char *name, int &value) const {return GetValue(name, value);} //! get a named value with type int, with default CRYPTOPP_DLL int GetIntValueWithDefault(const char *name, int defaultValue) const {return GetValueWithDefault(name, defaultValue);} //! used by derived classes to check for type mismatch CRYPTOPP_DLL static void CRYPTOPP_API ThrowIfTypeMismatch(const char *name, const std::type_info &stored, const std::type_info &retrieving) {if (stored != retrieving) throw ValueTypeMismatch(name, stored, retrieving);} template void GetRequiredParameter(const char *className, const char *name, T &value) const { if (!GetValue(name, value)) throw InvalidArgument(std::string(className) + ": missing required parameter '" + name + "'"); } CRYPTOPP_DLL void GetRequiredIntParameter(const char *className, const char *name, int &value) const { if (!GetIntValue(name, value)) throw InvalidArgument(std::string(className) + ": missing required parameter '" + name + "'"); } //! to be implemented by derived classes, users should use one of the above functions instead CRYPTOPP_DLL virtual bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const =0; }; //! namespace containing value name definitions /*! value names, types and semantics: ThisObject:ClassName (ClassName, copy of this object or a subobject) ThisPointer:ClassName (const ClassName *, pointer to this object or a subobject) */ DOCUMENTED_NAMESPACE_BEGIN(Name) // more names defined in argnames.h DOCUMENTED_NAMESPACE_END //! empty set of name-value pairs extern CRYPTOPP_DLL const NameValuePairs &g_nullNameValuePairs; // ******************************************************** //! interface for cloning objects, this is not implemented by most classes yet class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Clonable { public: virtual ~Clonable() {} //! this is not implemented by most classes yet virtual Clonable* Clone() const {throw NotImplemented("Clone() is not implemented yet.");} // TODO: make this =0 }; //! interface for all crypto algorithms class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Algorithm : public Clonable { public: /*! When FIPS 140-2 compliance is enabled and checkSelfTestStatus == true, this constructor throws SelfTestFailure if the self test hasn't been run or fails. */ Algorithm(bool checkSelfTestStatus = true); //! returns name of this algorithm, not universally implemented yet virtual std::string AlgorithmName() const {return "unknown";} }; //! keying interface for crypto algorithms that take byte strings as keys class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE SimpleKeyingInterface { public: virtual ~SimpleKeyingInterface() {} //! returns smallest valid key length in bytes */ virtual size_t MinKeyLength() const =0; //! returns largest valid key length in bytes */ virtual size_t MaxKeyLength() const =0; //! returns default (recommended) key length in bytes */ virtual size_t DefaultKeyLength() const =0; //! returns the smallest valid key length in bytes that is >= min(n, GetMaxKeyLength()) virtual size_t GetValidKeyLength(size_t n) const =0; //! returns whether n is a valid key length virtual bool IsValidKeyLength(size_t n) const {return n == GetValidKeyLength(n);} //! set or reset the key of this object /*! \param params is used to specify Rounds, BlockSize, etc. */ virtual void SetKey(const byte *key, size_t length, const NameValuePairs ¶ms = g_nullNameValuePairs); //! calls SetKey() with an NameValuePairs object that just specifies "Rounds" void SetKeyWithRounds(const byte *key, size_t length, int rounds); //! calls SetKey() with an NameValuePairs object that just specifies "IV" void SetKeyWithIV(const byte *key, size_t length, const byte *iv, size_t ivLength); //! calls SetKey() with an NameValuePairs object that just specifies "IV" void SetKeyWithIV(const byte *key, size_t length, const byte *iv) {SetKeyWithIV(key, length, iv, IVSize());} enum IV_Requirement {UNIQUE_IV = 0, RANDOM_IV, UNPREDICTABLE_RANDOM_IV, INTERNALLY_GENERATED_IV, NOT_RESYNCHRONIZABLE}; //! returns the minimal requirement for secure IVs virtual IV_Requirement IVRequirement() const =0; //! returns whether this object can be resynchronized (i.e. supports initialization vectors) /*! If this function returns true, and no IV is passed to SetKey() and CanUseStructuredIVs()==true, an IV of all 0's will be assumed. */ bool IsResynchronizable() const {return IVRequirement() < NOT_RESYNCHRONIZABLE;} //! returns whether this object can use random IVs (in addition to ones returned by GetNextIV) bool CanUseRandomIVs() const {return IVRequirement() <= UNPREDICTABLE_RANDOM_IV;} //! returns whether this object can use random but possibly predictable IVs (in addition to ones returned by GetNextIV) bool CanUsePredictableIVs() const {return IVRequirement() <= RANDOM_IV;} //! returns whether this object can use structured IVs, for example a counter (in addition to ones returned by GetNextIV) bool CanUseStructuredIVs() const {return IVRequirement() <= UNIQUE_IV;} virtual unsigned int IVSize() const {throw NotImplemented(GetAlgorithm().AlgorithmName() + ": this object doesn't support resynchronization");} //! returns default length of IVs accepted by this object unsigned int DefaultIVLength() const {return IVSize();} //! returns minimal length of IVs accepted by this object virtual unsigned int MinIVLength() const {return IVSize();} //! returns maximal length of IVs accepted by this object virtual unsigned int MaxIVLength() const {return IVSize();} //! resynchronize with an IV. ivLength=-1 means use IVSize() virtual void Resynchronize(const byte *iv, int ivLength=-1) {throw NotImplemented(GetAlgorithm().AlgorithmName() + ": this object doesn't support resynchronization");} //! get a secure IV for the next message /*! This method should be called after you finish encrypting one message and are ready to start the next one. After calling it, you must call SetKey() or Resynchronize() before using this object again. This method is not implemented on decryption objects. */ virtual void GetNextIV(RandomNumberGenerator &rng, byte *IV); protected: virtual const Algorithm & GetAlgorithm() const =0; virtual void UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms) =0; void ThrowIfInvalidKeyLength(size_t length); void ThrowIfResynchronizable(); // to be called when no IV is passed void ThrowIfInvalidIV(const byte *iv); // check for NULL IV if it can't be used size_t ThrowIfInvalidIVLength(int size); const byte * GetIVAndThrowIfInvalid(const NameValuePairs ¶ms, size_t &size); inline void AssertValidKeyLength(size_t length) const {assert(IsValidKeyLength(length));} }; //! interface for the data processing part of block ciphers /*! Classes derived from BlockTransformation are block ciphers in ECB mode (for example the DES::Encryption class), which are stateless. These classes should not be used directly, but only in combination with a mode class (see CipherModeDocumentation in modes.h). */ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE BlockTransformation : public Algorithm { public: //! encrypt or decrypt inBlock, xor with xorBlock, and write to outBlock virtual void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const =0; //! encrypt or decrypt one block /*! \pre size of inBlock and outBlock == BlockSize() */ void ProcessBlock(const byte *inBlock, byte *outBlock) const {ProcessAndXorBlock(inBlock, NULL, outBlock);} //! encrypt or decrypt one block in place void ProcessBlock(byte *inoutBlock) const {ProcessAndXorBlock(inoutBlock, NULL, inoutBlock);} //! block size of the cipher in bytes virtual unsigned int BlockSize() const =0; //! returns how inputs and outputs should be aligned for optimal performance virtual unsigned int OptimalDataAlignment() const; //! returns true if this is a permutation (i.e. there is an inverse transformation) virtual bool IsPermutation() const {return true;} //! returns true if this is an encryption object virtual bool IsForwardTransformation() const =0; //! return number of blocks that can be processed in parallel, for bit-slicing implementations virtual unsigned int OptimalNumberOfParallelBlocks() const {return 1;} enum {BT_InBlockIsCounter=1, BT_DontIncrementInOutPointers=2, BT_XorInput=4, BT_ReverseDirection=8, BT_AllowParallel=16} FlagsForAdvancedProcessBlocks; //! encrypt and xor blocks according to flags (see FlagsForAdvancedProcessBlocks) /*! /note If BT_InBlockIsCounter is set, last byte of inBlocks may be modified. */ virtual size_t AdvancedProcessBlocks(const byte *inBlocks, const byte *xorBlocks, byte *outBlocks, size_t length, word32 flags) const; inline CipherDir GetCipherDirection() const {return IsForwardTransformation() ? ENCRYPTION : DECRYPTION;} }; //! interface for the data processing part of stream ciphers class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE StreamTransformation : public Algorithm { public: //! return a reference to this object, useful for passing a temporary object to a function that takes a non-const reference StreamTransformation& Ref() {return *this;} //! returns block size, if input must be processed in blocks, otherwise 1 virtual unsigned int MandatoryBlockSize() const {return 1;} //! returns the input block size that is most efficient for this cipher /*! \note optimal input length is n * OptimalBlockSize() - GetOptimalBlockSizeUsed() for any n > 0 */ virtual unsigned int OptimalBlockSize() const {return MandatoryBlockSize();} //! returns how much of the current block is used up virtual unsigned int GetOptimalBlockSizeUsed() const {return 0;} //! returns how input should be aligned for optimal performance virtual unsigned int OptimalDataAlignment() const; //! encrypt or decrypt an array of bytes of specified length /*! \note either inString == outString, or they don't overlap */ virtual void ProcessData(byte *outString, const byte *inString, size_t length) =0; //! for ciphers where the last block of data is special, encrypt or decrypt the last block of data /*! For now the only use of this function is for CBC-CTS mode. */ virtual void ProcessLastBlock(byte *outString, const byte *inString, size_t length); //! returns the minimum size of the last block, 0 indicating the last block is not special virtual unsigned int MinLastBlockSize() const {return 0;} //! same as ProcessData(inoutString, inoutString, length) inline void ProcessString(byte *inoutString, size_t length) {ProcessData(inoutString, inoutString, length);} //! same as ProcessData(outString, inString, length) inline void ProcessString(byte *outString, const byte *inString, size_t length) {ProcessData(outString, inString, length);} //! implemented as {ProcessData(&input, &input, 1); return input;} inline byte ProcessByte(byte input) {ProcessData(&input, &input, 1); return input;} //! returns whether this cipher supports random access virtual bool IsRandomAccess() const =0; //! for random access ciphers, seek to an absolute position virtual void Seek(lword n) { assert(!IsRandomAccess()); throw NotImplemented("StreamTransformation: this object doesn't support random access"); } //! returns whether this transformation is self-inverting (e.g. xor with a keystream) virtual bool IsSelfInverting() const =0; //! returns whether this is an encryption object virtual bool IsForwardTransformation() const =0; }; //! interface for hash functions and data processing part of MACs /*! HashTransformation objects are stateful. They are created in an initial state, change state as Update() is called, and return to the initial state when Final() is called. This interface allows a large message to be hashed in pieces by calling Update() on each piece followed by calling Final(). */ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE HashTransformation : public Algorithm { public: //! return a reference to this object, useful for passing a temporary object to a function that takes a non-const reference HashTransformation& Ref() {return *this;} //! process more input virtual void Update(const byte *input, size_t length) =0; //! request space to write input into virtual byte * CreateUpdateSpace(size_t &size) {size=0; return NULL;} //! compute hash for current message, then restart for a new message /*! \pre size of digest == DigestSize(). */ virtual void Final(byte *digest) {TruncatedFinal(digest, DigestSize());} //! discard the current state, and restart with a new message virtual void Restart() {TruncatedFinal(NULL, 0);} //! size of the hash/digest/MAC returned by Final() virtual unsigned int DigestSize() const =0; //! same as DigestSize() unsigned int TagSize() const {return DigestSize();} //! block size of underlying compression function, or 0 if not block based virtual unsigned int BlockSize() const {return 0;} //! input to Update() should have length a multiple of this for optimal speed virtual unsigned int OptimalBlockSize() const {return 1;} //! returns how input should be aligned for optimal performance virtual unsigned int OptimalDataAlignment() const; //! use this if your input is in one piece and you don't want to call Update() and Final() separately virtual void CalculateDigest(byte *digest, const byte *input, size_t length) {Update(input, length); Final(digest);} //! verify that digest is a valid digest for the current message, then reinitialize the object /*! Default implementation is to call Final() and do a bitwise comparison between its output and digest. */ virtual bool Verify(const byte *digest) {return TruncatedVerify(digest, DigestSize());} //! use this if your input is in one piece and you don't want to call Update() and Verify() separately virtual bool VerifyDigest(const byte *digest, const byte *input, size_t length) {Update(input, length); return Verify(digest);} //! truncated version of Final() virtual void TruncatedFinal(byte *digest, size_t digestSize) =0; //! truncated version of CalculateDigest() virtual void CalculateTruncatedDigest(byte *digest, size_t digestSize, const byte *input, size_t length) {Update(input, length); TruncatedFinal(digest, digestSize);} //! truncated version of Verify() virtual bool TruncatedVerify(const byte *digest, size_t digestLength); //! truncated version of VerifyDigest() virtual bool VerifyTruncatedDigest(const byte *digest, size_t digestLength, const byte *input, size_t length) {Update(input, length); return TruncatedVerify(digest, digestLength);} protected: void ThrowIfInvalidTruncatedSize(size_t size) const; }; typedef HashTransformation HashFunction; //! interface for one direction (encryption or decryption) of a block cipher /*! \note These objects usually should not be used directly. See BlockTransformation for more details. */ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE BlockCipher : public SimpleKeyingInterface, public BlockTransformation { protected: const Algorithm & GetAlgorithm() const {return *this;} }; //! interface for one direction (encryption or decryption) of a stream cipher or cipher mode class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE SymmetricCipher : public SimpleKeyingInterface, public StreamTransformation { protected: const Algorithm & GetAlgorithm() const {return *this;} }; //! interface for message authentication codes class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE MessageAuthenticationCode : public SimpleKeyingInterface, public HashTransformation { protected: const Algorithm & GetAlgorithm() const {return *this;} }; //! interface for for one direction (encryption or decryption) of a stream cipher or block cipher mode with authentication /*! The StreamTransformation part of this interface is used to encrypt/decrypt the data, and the MessageAuthenticationCode part of this interface is used to input additional authenticated data (AAD, which is MAC'ed but not encrypted), and to generate/verify the MAC. */ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE AuthenticatedSymmetricCipher : public MessageAuthenticationCode, public StreamTransformation { public: //! this indicates that a member function was called in the wrong state, for example trying to encrypt a message before having set the key or IV class BadState : public Exception { public: explicit BadState(const std::string &name, const char *message) : Exception(OTHER_ERROR, name + ": " + message) {} explicit BadState(const std::string &name, const char *function, const char *state) : Exception(OTHER_ERROR, name + ": " + function + " was called before " + state) {} }; //! the maximum length of AAD that can be input before the encrypted data virtual lword MaxHeaderLength() const =0; //! the maximum length of encrypted data virtual lword MaxMessageLength() const =0; //! the maximum length of AAD that can be input after the encrypted data virtual lword MaxFooterLength() const {return 0;} //! if this function returns true, SpecifyDataLengths() must be called before attempting to input data /*! This is the case for some schemes, such as CCM. */ virtual bool NeedsPrespecifiedDataLengths() const {return false;} //! this function only needs to be called if NeedsPrespecifiedDataLengths() returns true void SpecifyDataLengths(lword headerLength, lword messageLength, lword footerLength=0); //! encrypt and generate MAC in one call. will truncate MAC if macSize < TagSize() virtual void EncryptAndAuthenticate(byte *ciphertext, byte *mac, size_t macSize, const byte *iv, int ivLength, const byte *header, size_t headerLength, const byte *message, size_t messageLength); //! decrypt and verify MAC in one call, returning true iff MAC is valid. will assume MAC is truncated if macLength < TagSize() virtual bool DecryptAndVerify(byte *message, const byte *mac, size_t macLength, const byte *iv, int ivLength, const byte *header, size_t headerLength, const byte *ciphertext, size_t ciphertextLength); // redeclare this to avoid compiler ambiguity errors virtual std::string AlgorithmName() const =0; protected: const Algorithm & GetAlgorithm() const {return *static_cast(this);} virtual void UncheckedSpecifyDataLengths(lword headerLength, lword messageLength, lword footerLength) {} }; #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY typedef SymmetricCipher StreamCipher; #endif //! interface for random number generators /*! All return values are uniformly distributed over the range specified. */ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE RandomNumberGenerator : public Algorithm { public: //! update RNG state with additional unpredictable values virtual void IncorporateEntropy(const byte *input, size_t length) {throw NotImplemented("RandomNumberGenerator: IncorporateEntropy not implemented");} //! returns true if IncorporateEntropy is implemented virtual bool CanIncorporateEntropy() const {return false;} //! generate new random byte and return it virtual byte GenerateByte(); //! generate new random bit and return it /*! Default implementation is to call GenerateByte() and return its lowest bit. */ virtual unsigned int GenerateBit(); //! generate a random 32 bit word in the range min to max, inclusive virtual word32 GenerateWord32(word32 a=0, word32 b=0xffffffffL); //! generate random array of bytes virtual void GenerateBlock(byte *output, size_t size); //! generate and discard n bytes virtual void DiscardBytes(size_t n); //! generate random bytes as input to a BufferedTransformation virtual void GenerateIntoBufferedTransformation(BufferedTransformation &target, const std::string &channel, lword length); //! randomly shuffle the specified array, resulting permutation is uniformly distributed template void Shuffle(IT begin, IT end) { for (; begin != end; ++begin) std::iter_swap(begin, begin + GenerateWord32(0, end-begin-1)); } #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY byte GetByte() {return GenerateByte();} unsigned int GetBit() {return GenerateBit();} word32 GetLong(word32 a=0, word32 b=0xffffffffL) {return GenerateWord32(a, b);} word16 GetShort(word16 a=0, word16 b=0xffff) {return (word16)GenerateWord32(a, b);} void GetBlock(byte *output, size_t size) {GenerateBlock(output, size);} #endif }; //! returns a reference that can be passed to functions that ask for a RNG but doesn't actually use it CRYPTOPP_DLL RandomNumberGenerator & CRYPTOPP_API NullRNG(); class WaitObjectContainer; class CallStack; //! interface for objects that you can wait for class CRYPTOPP_NO_VTABLE Waitable { public: virtual ~Waitable() {} //! maximum number of wait objects that this object can return virtual unsigned int GetMaxWaitObjectCount() const =0; //! put wait objects into container /*! \param callStack is used for tracing no wait loops, example: something.GetWaitObjects(c, CallStack("my func after X", 0)); - or in an outer GetWaitObjects() method that itself takes a callStack parameter: innerThing.GetWaitObjects(c, CallStack("MyClass::GetWaitObjects at X", &callStack)); */ virtual void GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack) =0; //! wait on this object /*! same as creating an empty container, calling GetWaitObjects(), and calling Wait() on the container */ bool Wait(unsigned long milliseconds, CallStack const& callStack); }; //! the default channel for BufferedTransformation, equal to the empty string extern CRYPTOPP_DLL const std::string DEFAULT_CHANNEL; //! channel for additional authenticated data, equal to "AAD" extern CRYPTOPP_DLL const std::string AAD_CHANNEL; //! interface for buffered transformations /*! BufferedTransformation is a generalization of BlockTransformation, StreamTransformation, and HashTransformation. A buffered transformation is an object that takes a stream of bytes as input (this may be done in stages), does some computation on them, and then places the result into an internal buffer for later retrieval. Any partial result already in the output buffer is not modified by further input. If a method takes a "blocking" parameter, and you pass "false" for it, the method will return before all input has been processed if the input cannot be processed without waiting (for network buffers to become available, for example). In this case the method will return true or a non-zero integer value. When this happens you must continue to call the method with the same parameters until it returns false or zero, before calling any other method on it or attached BufferedTransformation. The integer return value in this case is approximately the number of bytes left to be processed, and can be used to implement a progress bar. For functions that take a "propagation" parameter, propagation != 0 means pass on the signal to attached BufferedTransformation objects, with propagation decremented at each step until it reaches 0. -1 means unlimited propagation. \nosubgrouping */ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE BufferedTransformation : public Algorithm, public Waitable { public: // placed up here for CW8 static const std::string &NULL_CHANNEL; // same as DEFAULT_CHANNEL, for backwards compatibility BufferedTransformation() : Algorithm(false) {} //! return a reference to this object, useful for passing a temporary object to a function that takes a non-const reference BufferedTransformation& Ref() {return *this;} //! \name INPUT //@{ //! input a byte for processing size_t Put(byte inByte, bool blocking=true) {return Put(&inByte, 1, blocking);} //! input multiple bytes size_t Put(const byte *inString, size_t length, bool blocking=true) {return Put2(inString, length, 0, blocking);} //! input a 16-bit word size_t PutWord16(word16 value, ByteOrder order=BIG_ENDIAN_ORDER, bool blocking=true); //! input a 32-bit word size_t PutWord32(word32 value, ByteOrder order=BIG_ENDIAN_ORDER, bool blocking=true); //! request space which can be written into by the caller, and then used as input to Put() /*! \param size is requested size (as a hint) for input, and size of the returned space for output */ /*! \note The purpose of this method is to help avoid doing extra memory allocations. */ virtual byte * CreatePutSpace(size_t &size) {size=0; return NULL;} virtual bool CanModifyInput() const {return false;} //! input multiple bytes that may be modified by callee size_t PutModifiable(byte *inString, size_t length, bool blocking=true) {return PutModifiable2(inString, length, 0, blocking);} bool MessageEnd(int propagation=-1, bool blocking=true) {return !!Put2(NULL, 0, propagation < 0 ? -1 : propagation+1, blocking);} size_t PutMessageEnd(const byte *inString, size_t length, int propagation=-1, bool blocking=true) {return Put2(inString, length, propagation < 0 ? -1 : propagation+1, blocking);} //! input multiple bytes for blocking or non-blocking processing /*! \param messageEnd means how many filters to signal MessageEnd to, including this one */ virtual size_t Put2(const byte *inString, size_t length, int messageEnd, bool blocking) =0; //! input multiple bytes that may be modified by callee for blocking or non-blocking processing /*! \param messageEnd means how many filters to signal MessageEnd to, including this one */ virtual size_t PutModifiable2(byte *inString, size_t length, int messageEnd, bool blocking) {return Put2(inString, length, messageEnd, blocking);} //! thrown by objects that have not implemented nonblocking input processing struct BlockingInputOnly : public NotImplemented {BlockingInputOnly(const std::string &s) : NotImplemented(s + ": Nonblocking input is not implemented by this object.") {}}; //@} //! \name WAITING //@{ unsigned int GetMaxWaitObjectCount() const; void GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack); //@} //! \name SIGNALS //@{ virtual void IsolatedInitialize(const NameValuePairs ¶meters) {throw NotImplemented("BufferedTransformation: this object can't be reinitialized");} virtual bool IsolatedFlush(bool hardFlush, bool blocking) =0; virtual bool IsolatedMessageSeriesEnd(bool blocking) {return false;} //! initialize or reinitialize this object virtual void Initialize(const NameValuePairs ¶meters=g_nullNameValuePairs, int propagation=-1); //! flush buffered input and/or output /*! \param hardFlush is used to indicate whether all data should be flushed \note Hard flushes must be used with care. It means try to process and output everything, even if there may not be enough data to complete the action. For example, hard flushing a HexDecoder would cause an error if you do it after inputing an odd number of hex encoded characters. For some types of filters, for example ZlibDecompressor, hard flushes can only be done at "synchronization points". These synchronization points are positions in the data stream that are created by hard flushes on the corresponding reverse filters, in this example ZlibCompressor. This is useful when zlib compressed data is moved across a network in packets and compression state is preserved across packets, as in the ssh2 protocol. */ virtual bool Flush(bool hardFlush, int propagation=-1, bool blocking=true); //! mark end of a series of messages /*! There should be a MessageEnd immediately before MessageSeriesEnd. */ virtual bool MessageSeriesEnd(int propagation=-1, bool blocking=true); //! set propagation of automatically generated and transferred signals /*! propagation == 0 means do not automaticly generate signals */ virtual void SetAutoSignalPropagation(int propagation) {} //! virtual int GetAutoSignalPropagation() const {return 0;} public: #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY void Close() {MessageEnd();} #endif //@} //! \name RETRIEVAL OF ONE MESSAGE //@{ //! returns number of bytes that is currently ready for retrieval /*! All retrieval functions return the actual number of bytes retrieved, which is the lesser of the request number and MaxRetrievable(). */ virtual lword MaxRetrievable() const; //! returns whether any bytes are currently ready for retrieval virtual bool AnyRetrievable() const; //! try to retrieve a single byte virtual size_t Get(byte &outByte); //! try to retrieve multiple bytes virtual size_t Get(byte *outString, size_t getMax); //! peek at the next byte without removing it from the output buffer virtual size_t Peek(byte &outByte) const; //! peek at multiple bytes without removing them from the output buffer virtual size_t Peek(byte *outString, size_t peekMax) const; //! try to retrieve a 16-bit word size_t GetWord16(word16 &value, ByteOrder order=BIG_ENDIAN_ORDER); //! try to retrieve a 32-bit word size_t GetWord32(word32 &value, ByteOrder order=BIG_ENDIAN_ORDER); //! try to peek at a 16-bit word size_t PeekWord16(word16 &value, ByteOrder order=BIG_ENDIAN_ORDER) const; //! try to peek at a 32-bit word size_t PeekWord32(word32 &value, ByteOrder order=BIG_ENDIAN_ORDER) const; //! move transferMax bytes of the buffered output to target as input lword TransferTo(BufferedTransformation &target, lword transferMax=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL) {TransferTo2(target, transferMax, channel); return transferMax;} //! discard skipMax bytes from the output buffer virtual lword Skip(lword skipMax=LWORD_MAX); //! copy copyMax bytes of the buffered output to target as input lword CopyTo(BufferedTransformation &target, lword copyMax=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL) const {return CopyRangeTo(target, 0, copyMax, channel);} //! copy copyMax bytes of the buffered output, starting at position (relative to current position), to target as input lword CopyRangeTo(BufferedTransformation &target, lword position, lword copyMax=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL) const {lword i = position; CopyRangeTo2(target, i, i+copyMax, channel); return i-position;} #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY unsigned long MaxRetrieveable() const {return MaxRetrievable();} #endif //@} //! \name RETRIEVAL OF MULTIPLE MESSAGES //@{ //! virtual lword TotalBytesRetrievable() const; //! number of times MessageEnd() has been received minus messages retrieved or skipped virtual unsigned int NumberOfMessages() const; //! returns true if NumberOfMessages() > 0 virtual bool AnyMessages() const; //! start retrieving the next message /*! Returns false if no more messages exist or this message is not completely retrieved. */ virtual bool GetNextMessage(); //! skip count number of messages virtual unsigned int SkipMessages(unsigned int count=UINT_MAX); //! unsigned int TransferMessagesTo(BufferedTransformation &target, unsigned int count=UINT_MAX, const std::string &channel=DEFAULT_CHANNEL) {TransferMessagesTo2(target, count, channel); return count;} //! unsigned int CopyMessagesTo(BufferedTransformation &target, unsigned int count=UINT_MAX, const std::string &channel=DEFAULT_CHANNEL) const; //! virtual void SkipAll(); //! void TransferAllTo(BufferedTransformation &target, const std::string &channel=DEFAULT_CHANNEL) {TransferAllTo2(target, channel);} //! void CopyAllTo(BufferedTransformation &target, const std::string &channel=DEFAULT_CHANNEL) const; virtual bool GetNextMessageSeries() {return false;} virtual unsigned int NumberOfMessagesInThisSeries() const {return NumberOfMessages();} virtual unsigned int NumberOfMessageSeries() const {return 0;} //@} //! \name NON-BLOCKING TRANSFER OF OUTPUT //@{ //! upon return, byteCount contains number of bytes that have finished being transfered, and returns the number of bytes left in the current transfer block virtual size_t TransferTo2(BufferedTransformation &target, lword &byteCount, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) =0; //! upon return, begin contains the start position of data yet to be finished copying, and returns the number of bytes left in the current transfer block virtual size_t CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) const =0; //! upon return, messageCount contains number of messages that have finished being transfered, and returns the number of bytes left in the current transfer block size_t TransferMessagesTo2(BufferedTransformation &target, unsigned int &messageCount, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true); //! returns the number of bytes left in the current transfer block size_t TransferAllTo2(BufferedTransformation &target, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true); //@} //! \name CHANNELS //@{ struct NoChannelSupport : public NotImplemented {NoChannelSupport(const std::string &name) : NotImplemented(name + ": this object doesn't support multiple channels") {}}; struct InvalidChannelName : public InvalidArgument {InvalidChannelName(const std::string &name, const std::string &channel) : InvalidArgument(name + ": unexpected channel name \"" + channel + "\"") {}}; size_t ChannelPut(const std::string &channel, byte inByte, bool blocking=true) {return ChannelPut(channel, &inByte, 1, blocking);} size_t ChannelPut(const std::string &channel, const byte *inString, size_t length, bool blocking=true) {return ChannelPut2(channel, inString, length, 0, blocking);} size_t ChannelPutModifiable(const std::string &channel, byte *inString, size_t length, bool blocking=true) {return ChannelPutModifiable2(channel, inString, length, 0, blocking);} size_t ChannelPutWord16(const std::string &channel, word16 value, ByteOrder order=BIG_ENDIAN_ORDER, bool blocking=true); size_t ChannelPutWord32(const std::string &channel, word32 value, ByteOrder order=BIG_ENDIAN_ORDER, bool blocking=true); bool ChannelMessageEnd(const std::string &channel, int propagation=-1, bool blocking=true) {return !!ChannelPut2(channel, NULL, 0, propagation < 0 ? -1 : propagation+1, blocking);} size_t ChannelPutMessageEnd(const std::string &channel, const byte *inString, size_t length, int propagation=-1, bool blocking=true) {return ChannelPut2(channel, inString, length, propagation < 0 ? -1 : propagation+1, blocking);} virtual byte * ChannelCreatePutSpace(const std::string &channel, size_t &size); virtual size_t ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking); virtual size_t ChannelPutModifiable2(const std::string &channel, byte *begin, size_t length, int messageEnd, bool blocking); virtual bool ChannelFlush(const std::string &channel, bool hardFlush, int propagation=-1, bool blocking=true); virtual bool ChannelMessageSeriesEnd(const std::string &channel, int propagation=-1, bool blocking=true); virtual void SetRetrievalChannel(const std::string &channel); //@} //! \name ATTACHMENT /*! Some BufferedTransformation objects (e.g. Filter objects) allow other BufferedTransformation objects to be attached. When this is done, the first object instead of buffering its output, sents that output to the attached object as input. The entire attachment chain is deleted when the anchor object is destructed. */ //@{ //! returns whether this object allows attachment virtual bool Attachable() {return false;} //! returns the object immediately attached to this object or NULL for no attachment virtual BufferedTransformation *AttachedTransformation() {assert(!Attachable()); return 0;} //! virtual const BufferedTransformation *AttachedTransformation() const {return const_cast(this)->AttachedTransformation();} //! delete the current attachment chain and replace it with newAttachment virtual void Detach(BufferedTransformation *newAttachment = 0) {assert(!Attachable()); throw NotImplemented("BufferedTransformation: this object is not attachable");} //! add newAttachment to the end of attachment chain virtual void Attach(BufferedTransformation *newAttachment); //@} protected: static int DecrementPropagation(int propagation) {return propagation != 0 ? propagation - 1 : 0;} private: byte m_buf[4]; // for ChannelPutWord16 and ChannelPutWord32, to ensure buffer isn't deallocated before non-blocking operation completes }; //! returns a reference to a BufferedTransformation object that discards all input BufferedTransformation & TheBitBucket(); //! interface for crypto material, such as public and private keys, and crypto parameters class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CryptoMaterial : public NameValuePairs { public: //! exception thrown when invalid crypto material is detected class CRYPTOPP_DLL InvalidMaterial : public InvalidDataFormat { public: explicit InvalidMaterial(const std::string &s) : InvalidDataFormat(s) {} }; //! assign values from source to this object /*! \note This function can be used to create a public key from a private key. */ virtual void AssignFrom(const NameValuePairs &source) =0; //! check this object for errors /*! \param level denotes the level of thoroughness: 0 - using this object won't cause a crash or exception (rng is ignored) 1 - this object will probably function (encrypt, sign, etc.) correctly (but may not check for weak keys and such) 2 - make sure this object will function correctly, and do reasonable security checks 3 - do checks that may take a long time \return true if the tests pass */ virtual bool Validate(RandomNumberGenerator &rng, unsigned int level) const =0; //! throws InvalidMaterial if this object fails Validate() test virtual void ThrowIfInvalid(RandomNumberGenerator &rng, unsigned int level) const {if (!Validate(rng, level)) throw InvalidMaterial("CryptoMaterial: this object contains invalid values");} // virtual std::vector GetSupportedFormats(bool includeSaveOnly=false, bool includeLoadOnly=false); //! save key into a BufferedTransformation virtual void Save(BufferedTransformation &bt) const {throw NotImplemented("CryptoMaterial: this object does not support saving");} //! load key from a BufferedTransformation /*! \throws KeyingErr if decode fails \note Generally does not check that the key is valid. Call ValidateKey() or ThrowIfInvalidKey() to check that. */ virtual void Load(BufferedTransformation &bt) {throw NotImplemented("CryptoMaterial: this object does not support loading");} //! \return whether this object supports precomputation virtual bool SupportsPrecomputation() const {return false;} //! do precomputation /*! The exact semantics of Precompute() is varies, but typically it means calculate a table of n objects that can be used later to speed up computation. */ virtual void Precompute(unsigned int n) {assert(!SupportsPrecomputation()); throw NotImplemented("CryptoMaterial: this object does not support precomputation");} //! retrieve previously saved precomputation virtual void LoadPrecomputation(BufferedTransformation &storedPrecomputation) {assert(!SupportsPrecomputation()); throw NotImplemented("CryptoMaterial: this object does not support precomputation");} //! save precomputation for later use virtual void SavePrecomputation(BufferedTransformation &storedPrecomputation) const {assert(!SupportsPrecomputation()); throw NotImplemented("CryptoMaterial: this object does not support precomputation");} // for internal library use void DoQuickSanityCheck() const {ThrowIfInvalid(NullRNG(), 0);} #if (defined(__SUNPRO_CC) && __SUNPRO_CC < 0x590) // Sun Studio 11/CC 5.8 workaround: it generates incorrect code when casting to an empty virtual base class char m_sunCCworkaround; #endif }; //! interface for generatable crypto material, such as private keys and crypto parameters class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE GeneratableCryptoMaterial : virtual public CryptoMaterial { public: //! generate a random key or crypto parameters /*! \throws KeyingErr if algorithm parameters are invalid, or if a key can't be generated (e.g., if this is a public key object) */ virtual void GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs ¶ms = g_nullNameValuePairs) {throw NotImplemented("GeneratableCryptoMaterial: this object does not support key/parameter generation");} //! calls the above function with a NameValuePairs object that just specifies "KeySize" void GenerateRandomWithKeySize(RandomNumberGenerator &rng, unsigned int keySize); }; //! interface for public keys class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PublicKey : virtual public CryptoMaterial { }; //! interface for private keys class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PrivateKey : public GeneratableCryptoMaterial { }; //! interface for crypto prameters class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CryptoParameters : public GeneratableCryptoMaterial { }; //! interface for asymmetric algorithms class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE AsymmetricAlgorithm : public Algorithm { public: //! returns a reference to the crypto material used by this object virtual CryptoMaterial & AccessMaterial() =0; //! returns a const reference to the crypto material used by this object virtual const CryptoMaterial & GetMaterial() const =0; //! for backwards compatibility, calls AccessMaterial().Load(bt) void BERDecode(BufferedTransformation &bt) {AccessMaterial().Load(bt);} //! for backwards compatibility, calls GetMaterial().Save(bt) void DEREncode(BufferedTransformation &bt) const {GetMaterial().Save(bt);} }; //! interface for asymmetric algorithms using public keys class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PublicKeyAlgorithm : public AsymmetricAlgorithm { public: // VC60 workaround: no co-variant return type CryptoMaterial & AccessMaterial() {return AccessPublicKey();} const CryptoMaterial & GetMaterial() const {return GetPublicKey();} virtual PublicKey & AccessPublicKey() =0; virtual const PublicKey & GetPublicKey() const {return const_cast(this)->AccessPublicKey();} }; //! interface for asymmetric algorithms using private keys class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PrivateKeyAlgorithm : public AsymmetricAlgorithm { public: CryptoMaterial & AccessMaterial() {return AccessPrivateKey();} const CryptoMaterial & GetMaterial() const {return GetPrivateKey();} virtual PrivateKey & AccessPrivateKey() =0; virtual const PrivateKey & GetPrivateKey() const {return const_cast(this)->AccessPrivateKey();} }; //! interface for key agreement algorithms class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE KeyAgreementAlgorithm : public AsymmetricAlgorithm { public: CryptoMaterial & AccessMaterial() {return AccessCryptoParameters();} const CryptoMaterial & GetMaterial() const {return GetCryptoParameters();} virtual CryptoParameters & AccessCryptoParameters() =0; virtual const CryptoParameters & GetCryptoParameters() const {return const_cast(this)->AccessCryptoParameters();} }; //! interface for public-key encryptors and decryptors /*! This class provides an interface common to encryptors and decryptors for querying their plaintext and ciphertext lengths. */ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_CryptoSystem { public: virtual ~PK_CryptoSystem() {} //! maximum length of plaintext for a given ciphertext length /*! \note This function returns 0 if ciphertextLength is not valid (too long or too short). */ virtual size_t MaxPlaintextLength(size_t ciphertextLength) const =0; //! calculate length of ciphertext given length of plaintext /*! \note This function returns 0 if plaintextLength is not valid (too long). */ virtual size_t CiphertextLength(size_t plaintextLength) const =0; //! this object supports the use of the parameter with the given name /*! some possible parameter names: EncodingParameters, KeyDerivationParameters */ virtual bool ParameterSupported(const char *name) const =0; //! return fixed ciphertext length, if one exists, otherwise return 0 /*! \note "Fixed" here means length of ciphertext does not depend on length of plaintext. It usually does depend on the key length. */ virtual size_t FixedCiphertextLength() const {return 0;} //! return maximum plaintext length given the fixed ciphertext length, if one exists, otherwise return 0 virtual size_t FixedMaxPlaintextLength() const {return 0;} #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY size_t MaxPlainTextLength(size_t cipherTextLength) const {return MaxPlaintextLength(cipherTextLength);} size_t CipherTextLength(size_t plainTextLength) const {return CiphertextLength(plainTextLength);} #endif }; //! interface for public-key encryptors class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_Encryptor : public PK_CryptoSystem, public PublicKeyAlgorithm { public: //! exception thrown when trying to encrypt plaintext of invalid length class CRYPTOPP_DLL InvalidPlaintextLength : public Exception { public: InvalidPlaintextLength() : Exception(OTHER_ERROR, "PK_Encryptor: invalid plaintext length") {} }; //! encrypt a byte string /*! \pre CiphertextLength(plaintextLength) != 0 (i.e., plaintext isn't too long) \pre size of ciphertext == CiphertextLength(plaintextLength) */ virtual void Encrypt(RandomNumberGenerator &rng, const byte *plaintext, size_t plaintextLength, byte *ciphertext, const NameValuePairs ¶meters = g_nullNameValuePairs) const =0; //! create a new encryption filter /*! \note The caller is responsible for deleting the returned pointer. \note Encoding parameters should be passed in the "EP" channel. */ virtual BufferedTransformation * CreateEncryptionFilter(RandomNumberGenerator &rng, BufferedTransformation *attachment=NULL, const NameValuePairs ¶meters = g_nullNameValuePairs) const; }; //! interface for public-key decryptors class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_Decryptor : public PK_CryptoSystem, public PrivateKeyAlgorithm { public: //! decrypt a byte string, and return the length of plaintext /*! \pre size of plaintext == MaxPlaintextLength(ciphertextLength) bytes. \return the actual length of the plaintext, indication that decryption failed. */ virtual DecodingResult Decrypt(RandomNumberGenerator &rng, const byte *ciphertext, size_t ciphertextLength, byte *plaintext, const NameValuePairs ¶meters = g_nullNameValuePairs) const =0; //! create a new decryption filter /*! \note caller is responsible for deleting the returned pointer */ virtual BufferedTransformation * CreateDecryptionFilter(RandomNumberGenerator &rng, BufferedTransformation *attachment=NULL, const NameValuePairs ¶meters = g_nullNameValuePairs) const; //! decrypt a fixed size ciphertext DecodingResult FixedLengthDecrypt(RandomNumberGenerator &rng, const byte *ciphertext, byte *plaintext, const NameValuePairs ¶meters = g_nullNameValuePairs) const {return Decrypt(rng, ciphertext, FixedCiphertextLength(), plaintext, parameters);} }; #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY typedef PK_CryptoSystem PK_FixedLengthCryptoSystem; typedef PK_Encryptor PK_FixedLengthEncryptor; typedef PK_Decryptor PK_FixedLengthDecryptor; #endif //! interface for public-key signers and verifiers /*! This class provides an interface common to signers and verifiers for querying scheme properties. */ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_SignatureScheme { public: //! invalid key exception, may be thrown by any function in this class if the private or public key has a length that can't be used class CRYPTOPP_DLL InvalidKeyLength : public Exception { public: InvalidKeyLength(const std::string &message) : Exception(OTHER_ERROR, message) {} }; //! key too short exception, may be thrown by any function in this class if the private or public key is too short to sign or verify anything class CRYPTOPP_DLL KeyTooShort : public InvalidKeyLength { public: KeyTooShort() : InvalidKeyLength("PK_Signer: key too short for this signature scheme") {} }; virtual ~PK_SignatureScheme() {} //! signature length if it only depends on the key, otherwise 0 virtual size_t SignatureLength() const =0; //! maximum signature length produced for a given length of recoverable message part virtual size_t MaxSignatureLength(size_t recoverablePartLength = 0) const {return SignatureLength();} //! length of longest message that can be recovered, or 0 if this signature scheme does not support message recovery virtual size_t MaxRecoverableLength() const =0; //! length of longest message that can be recovered from a signature of given length, or 0 if this signature scheme does not support message recovery virtual size_t MaxRecoverableLengthFromSignatureLength(size_t signatureLength) const =0; //! requires a random number generator to sign /*! if this returns false, NullRNG() can be passed to functions that take RandomNumberGenerator & */ virtual bool IsProbabilistic() const =0; //! whether or not a non-recoverable message part can be signed virtual bool AllowNonrecoverablePart() const =0; //! if this function returns true, during verification you must input the signature before the message, otherwise you can input it at anytime */ virtual bool SignatureUpfront() const {return false;} //! whether you must input the recoverable part before the non-recoverable part during signing virtual bool RecoverablePartFirst() const =0; }; //! interface for accumulating messages to be signed or verified /*! Only Update() should be called on this class. No other functions inherited from HashTransformation should be called. */ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_MessageAccumulator : public HashTransformation { public: //! should not be called on PK_MessageAccumulator unsigned int DigestSize() const {throw NotImplemented("PK_MessageAccumulator: DigestSize() should not be called");} //! should not be called on PK_MessageAccumulator void TruncatedFinal(byte *digest, size_t digestSize) {throw NotImplemented("PK_MessageAccumulator: TruncatedFinal() should not be called");} }; //! interface for public-key signers class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_Signer : public PK_SignatureScheme, public PrivateKeyAlgorithm { public: //! create a new HashTransformation to accumulate the message to be signed virtual PK_MessageAccumulator * NewSignatureAccumulator(RandomNumberGenerator &rng) const =0; virtual void InputRecoverableMessage(PK_MessageAccumulator &messageAccumulator, const byte *recoverableMessage, size_t recoverableMessageLength) const =0; //! sign and delete messageAccumulator (even in case of exception thrown) /*! \pre size of signature == MaxSignatureLength() \return actual signature length */ virtual size_t Sign(RandomNumberGenerator &rng, PK_MessageAccumulator *messageAccumulator, byte *signature) const; //! sign and restart messageAccumulator /*! \pre size of signature == MaxSignatureLength() \return actual signature length */ virtual size_t SignAndRestart(RandomNumberGenerator &rng, PK_MessageAccumulator &messageAccumulator, byte *signature, bool restart=true) const =0; //! sign a message /*! \pre size of signature == MaxSignatureLength() \return actual signature length */ virtual size_t SignMessage(RandomNumberGenerator &rng, const byte *message, size_t messageLen, byte *signature) const; //! sign a recoverable message /*! \pre size of signature == MaxSignatureLength(recoverableMessageLength) \return actual signature length */ virtual size_t SignMessageWithRecovery(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, const byte *nonrecoverableMessage, size_t nonrecoverableMessageLength, byte *signature) const; }; //! interface for public-key signature verifiers /*! The Recover* functions throw NotImplemented if the signature scheme does not support message recovery. The Verify* functions throw InvalidDataFormat if the scheme does support message recovery and the signature contains a non-empty recoverable message part. The Recovery* functions should be used in that case. */ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_Verifier : public PK_SignatureScheme, public PublicKeyAlgorithm { public: //! create a new HashTransformation to accumulate the message to be verified virtual PK_MessageAccumulator * NewVerificationAccumulator() const =0; //! input signature into a message accumulator virtual void InputSignature(PK_MessageAccumulator &messageAccumulator, const byte *signature, size_t signatureLength) const =0; //! check whether messageAccumulator contains a valid signature and message, and delete messageAccumulator (even in case of exception thrown) virtual bool Verify(PK_MessageAccumulator *messageAccumulator) const; //! check whether messageAccumulator contains a valid signature and message, and restart messageAccumulator virtual bool VerifyAndRestart(PK_MessageAccumulator &messageAccumulator) const =0; //! check whether input signature is a valid signature for input message virtual bool VerifyMessage(const byte *message, size_t messageLen, const byte *signature, size_t signatureLength) const; //! recover a message from its signature /*! \pre size of recoveredMessage == MaxRecoverableLengthFromSignatureLength(signatureLength) */ virtual DecodingResult Recover(byte *recoveredMessage, PK_MessageAccumulator *messageAccumulator) const; //! recover a message from its signature /*! \pre size of recoveredMessage == MaxRecoverableLengthFromSignatureLength(signatureLength) */ virtual DecodingResult RecoverAndRestart(byte *recoveredMessage, PK_MessageAccumulator &messageAccumulator) const =0; //! recover a message from its signature /*! \pre size of recoveredMessage == MaxRecoverableLengthFromSignatureLength(signatureLength) */ virtual DecodingResult RecoverMessage(byte *recoveredMessage, const byte *nonrecoverableMessage, size_t nonrecoverableMessageLength, const byte *signature, size_t signatureLength) const; }; //! interface for domains of simple key agreement protocols /*! A key agreement domain is a set of parameters that must be shared by two parties in a key agreement protocol, along with the algorithms for generating key pairs and deriving agreed values. */ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE SimpleKeyAgreementDomain : public KeyAgreementAlgorithm { public: //! return length of agreed value produced virtual unsigned int AgreedValueLength() const =0; //! return length of private keys in this domain virtual unsigned int PrivateKeyLength() const =0; //! return length of public keys in this domain virtual unsigned int PublicKeyLength() const =0; //! generate private key /*! \pre size of privateKey == PrivateKeyLength() */ virtual void GeneratePrivateKey(RandomNumberGenerator &rng, byte *privateKey) const =0; //! generate public key /*! \pre size of publicKey == PublicKeyLength() */ virtual void GeneratePublicKey(RandomNumberGenerator &rng, const byte *privateKey, byte *publicKey) const =0; //! generate private/public key pair /*! \note equivalent to calling GeneratePrivateKey() and then GeneratePublicKey() */ virtual void GenerateKeyPair(RandomNumberGenerator &rng, byte *privateKey, byte *publicKey) const; //! derive agreed value from your private key and couterparty's public key, return false in case of failure /*! \note If you have previously validated the public key, use validateOtherPublicKey=false to save time. \pre size of agreedValue == AgreedValueLength() \pre length of privateKey == PrivateKeyLength() \pre length of otherPublicKey == PublicKeyLength() */ virtual bool Agree(byte *agreedValue, const byte *privateKey, const byte *otherPublicKey, bool validateOtherPublicKey=true) const =0; #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY bool ValidateDomainParameters(RandomNumberGenerator &rng) const {return GetCryptoParameters().Validate(rng, 2);} #endif }; //! interface for domains of authenticated key agreement protocols /*! In an authenticated key agreement protocol, each party has two key pairs. The long-lived key pair is called the static key pair, and the short-lived key pair is called the ephemeral key pair. */ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE AuthenticatedKeyAgreementDomain : public KeyAgreementAlgorithm { public: //! return length of agreed value produced virtual unsigned int AgreedValueLength() const =0; //! return length of static private keys in this domain virtual unsigned int StaticPrivateKeyLength() const =0; //! return length of static public keys in this domain virtual unsigned int StaticPublicKeyLength() const =0; //! generate static private key /*! \pre size of privateKey == PrivateStaticKeyLength() */ virtual void GenerateStaticPrivateKey(RandomNumberGenerator &rng, byte *privateKey) const =0; //! generate static public key /*! \pre size of publicKey == PublicStaticKeyLength() */ virtual void GenerateStaticPublicKey(RandomNumberGenerator &rng, const byte *privateKey, byte *publicKey) const =0; //! generate private/public key pair /*! \note equivalent to calling GenerateStaticPrivateKey() and then GenerateStaticPublicKey() */ virtual void GenerateStaticKeyPair(RandomNumberGenerator &rng, byte *privateKey, byte *publicKey) const; //! return length of ephemeral private keys in this domain virtual unsigned int EphemeralPrivateKeyLength() const =0; //! return length of ephemeral public keys in this domain virtual unsigned int EphemeralPublicKeyLength() const =0; //! generate ephemeral private key /*! \pre size of privateKey == PrivateEphemeralKeyLength() */ virtual void GenerateEphemeralPrivateKey(RandomNumberGenerator &rng, byte *privateKey) const =0; //! generate ephemeral public key /*! \pre size of publicKey == PublicEphemeralKeyLength() */ virtual void GenerateEphemeralPublicKey(RandomNumberGenerator &rng, const byte *privateKey, byte *publicKey) const =0; //! generate private/public key pair /*! \note equivalent to calling GenerateEphemeralPrivateKey() and then GenerateEphemeralPublicKey() */ virtual void GenerateEphemeralKeyPair(RandomNumberGenerator &rng, byte *privateKey, byte *publicKey) const; //! derive agreed value from your private keys and couterparty's public keys, return false in case of failure /*! \note The ephemeral public key will always be validated. If you have previously validated the static public key, use validateStaticOtherPublicKey=false to save time. \pre size of agreedValue == AgreedValueLength() \pre length of staticPrivateKey == StaticPrivateKeyLength() \pre length of ephemeralPrivateKey == EphemeralPrivateKeyLength() \pre length of staticOtherPublicKey == StaticPublicKeyLength() \pre length of ephemeralOtherPublicKey == EphemeralPublicKeyLength() */ virtual bool Agree(byte *agreedValue, const byte *staticPrivateKey, const byte *ephemeralPrivateKey, const byte *staticOtherPublicKey, const byte *ephemeralOtherPublicKey, bool validateStaticOtherPublicKey=true) const =0; #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY bool ValidateDomainParameters(RandomNumberGenerator &rng) const {return GetCryptoParameters().Validate(rng, 2);} #endif }; // interface for password authenticated key agreement protocols, not implemented yet #if 0 //! interface for protocol sessions /*! The methods should be called in the following order: InitializeSession(rng, parameters); // or call initialize method in derived class while (true) { if (OutgoingMessageAvailable()) { length = GetOutgoingMessageLength(); GetOutgoingMessage(message); ; // send outgoing message } if (LastMessageProcessed()) break; ; // receive incoming message ProcessIncomingMessage(message); } ; // call methods in derived class to obtain result of protocol session */ class ProtocolSession { public: //! exception thrown when an invalid protocol message is processed class ProtocolError : public Exception { public: ProtocolError(ErrorType errorType, const std::string &s) : Exception(errorType, s) {} }; //! exception thrown when a function is called unexpectedly /*! for example calling ProcessIncomingMessage() when ProcessedLastMessage() == true */ class UnexpectedMethodCall : public Exception { public: UnexpectedMethodCall(const std::string &s) : Exception(OTHER_ERROR, s) {} }; ProtocolSession() : m_rng(NULL), m_throwOnProtocolError(true), m_validState(false) {} virtual ~ProtocolSession() {} virtual void InitializeSession(RandomNumberGenerator &rng, const NameValuePairs ¶meters) =0; bool GetThrowOnProtocolError() const {return m_throwOnProtocolError;} void SetThrowOnProtocolError(bool throwOnProtocolError) {m_throwOnProtocolError = throwOnProtocolError;} bool HasValidState() const {return m_validState;} virtual bool OutgoingMessageAvailable() const =0; virtual unsigned int GetOutgoingMessageLength() const =0; virtual void GetOutgoingMessage(byte *message) =0; virtual bool LastMessageProcessed() const =0; virtual void ProcessIncomingMessage(const byte *message, unsigned int messageLength) =0; protected: void HandleProtocolError(Exception::ErrorType errorType, const std::string &s) const; void CheckAndHandleInvalidState() const; void SetValidState(bool valid) {m_validState = valid;} RandomNumberGenerator *m_rng; private: bool m_throwOnProtocolError, m_validState; }; class KeyAgreementSession : public ProtocolSession { public: virtual unsigned int GetAgreedValueLength() const =0; virtual void GetAgreedValue(byte *agreedValue) const =0; }; class PasswordAuthenticatedKeyAgreementSession : public KeyAgreementSession { public: void InitializePasswordAuthenticatedKeyAgreementSession(RandomNumberGenerator &rng, const byte *myId, unsigned int myIdLength, const byte *counterPartyId, unsigned int counterPartyIdLength, const byte *passwordOrVerifier, unsigned int passwordOrVerifierLength); }; class PasswordAuthenticatedKeyAgreementDomain : public KeyAgreementAlgorithm { public: //! return whether the domain parameters stored in this object are valid virtual bool ValidateDomainParameters(RandomNumberGenerator &rng) const {return GetCryptoParameters().Validate(rng, 2);} virtual unsigned int GetPasswordVerifierLength(const byte *password, unsigned int passwordLength) const =0; virtual void GeneratePasswordVerifier(RandomNumberGenerator &rng, const byte *userId, unsigned int userIdLength, const byte *password, unsigned int passwordLength, byte *verifier) const =0; enum RoleFlags {CLIENT=1, SERVER=2, INITIATOR=4, RESPONDER=8}; virtual bool IsValidRole(unsigned int role) =0; virtual PasswordAuthenticatedKeyAgreementSession * CreateProtocolSession(unsigned int role) const =0; }; #endif //! BER Decode Exception Class, may be thrown during an ASN1 BER decode operation class CRYPTOPP_DLL BERDecodeErr : public InvalidArgument { public: BERDecodeErr() : InvalidArgument("BER decode error") {} BERDecodeErr(const std::string &s) : InvalidArgument(s) {} }; //! interface for encoding and decoding ASN1 objects class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE ASN1Object { public: virtual ~ASN1Object() {} //! decode this object from a BufferedTransformation, using BER (Basic Encoding Rules) virtual void BERDecode(BufferedTransformation &bt) =0; //! encode this object into a BufferedTransformation, using DER (Distinguished Encoding Rules) virtual void DEREncode(BufferedTransformation &bt) const =0; //! encode this object into a BufferedTransformation, using BER /*! this may be useful if DEREncode() would be too inefficient */ virtual void BEREncode(BufferedTransformation &bt) const {DEREncode(bt);} }; #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY typedef PK_SignatureScheme PK_SignatureSystem; typedef SimpleKeyAgreementDomain PK_SimpleKeyAgreementDomain; typedef AuthenticatedKeyAgreementDomain PK_AuthenticatedKeyAgreementDomain; #endif NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/misc.cpp0000755000000000000000000000721312414772654017240 0ustar rootroot// misc.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "misc.h" #include "words.h" #include #if defined(CRYPTOPP_MEMALIGN_AVAILABLE) || defined(CRYPTOPP_MM_MALLOC_AVAILABLE) || defined(QNX) #include #endif NAMESPACE_BEGIN(CryptoPP) void xorbuf(byte *buf, const byte *mask, size_t count) { size_t i; if (IsAligned(buf) && IsAligned(mask)) { if (!CRYPTOPP_BOOL_SLOW_WORD64 && IsAligned(buf) && IsAligned(mask)) { for (i=0; i(output) && IsAligned(input) && IsAligned(mask)) { if (!CRYPTOPP_BOOL_SLOW_WORD64 && IsAligned(output) && IsAligned(input) && IsAligned(mask)) { for (i=0; i(buf) && IsAligned(mask)) { word32 acc32 = 0; if (!CRYPTOPP_BOOL_SLOW_WORD64 && IsAligned(buf) && IsAligned(mask)) { word64 acc64 = 0; for (i=0; i>32); } for (i=0; i>8) | byte(acc32>>16) | byte(acc32>>24); } for (i=0; i, public FixedKeyLength<10> { CRYPTOPP_DLL static const char * CRYPTOPP_API StaticAlgorithmName() {return "SKIPJACK";} }; /// SKIPJACK class SKIPJACK : public SKIPJACK_Info, public BlockCipherDocumentation { class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); unsigned int OptimalDataAlignment() const {return GetAlignmentOf();} protected: static const byte fTable[256]; FixedSizeSecBlock tab; }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; private: static const byte Se[256]; static const word32 Te[4][256]; }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; private: static const byte Sd[256]; static const word32 Td[4][256]; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef SKIPJACK::Encryption SKIPJACKEncryption; typedef SKIPJACK::Decryption SKIPJACKDecryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/zlib.h0000755000000000000000000000417212414772654016713 0ustar rootroot#ifndef CRYPTOPP_ZLIB_H #define CRYPTOPP_ZLIB_H #include "adler32.h" #include "zdeflate.h" #include "zinflate.h" NAMESPACE_BEGIN(CryptoPP) /// ZLIB Compressor (RFC 1950) class ZlibCompressor : public Deflator { public: ZlibCompressor(BufferedTransformation *attachment=NULL, unsigned int deflateLevel=DEFAULT_DEFLATE_LEVEL, unsigned int log2WindowSize=DEFAULT_LOG2_WINDOW_SIZE, bool detectUncompressible=true) : Deflator(attachment, deflateLevel, log2WindowSize, detectUncompressible) {} ZlibCompressor(const NameValuePairs ¶meters, BufferedTransformation *attachment=NULL) : Deflator(parameters, attachment) {} unsigned int GetCompressionLevel() const; protected: void WritePrestreamHeader(); void ProcessUncompressedData(const byte *string, size_t length); void WritePoststreamTail(); Adler32 m_adler32; }; /// ZLIB Decompressor (RFC 1950) class ZlibDecompressor : public Inflator { public: typedef Inflator::Err Err; class HeaderErr : public Err {public: HeaderErr() : Err(INVALID_DATA_FORMAT, "ZlibDecompressor: header decoding error") {}}; class Adler32Err : public Err {public: Adler32Err() : Err(DATA_INTEGRITY_CHECK_FAILED, "ZlibDecompressor: ADLER32 check error") {}}; class UnsupportedAlgorithm : public Err {public: UnsupportedAlgorithm() : Err(INVALID_DATA_FORMAT, "ZlibDecompressor: unsupported algorithm") {}}; class UnsupportedPresetDictionary : public Err {public: UnsupportedPresetDictionary() : Err(INVALID_DATA_FORMAT, "ZlibDecompressor: unsupported preset dictionary") {}}; /*! \param repeat decompress multiple compressed streams in series \param autoSignalPropagation 0 to turn off MessageEnd signal */ ZlibDecompressor(BufferedTransformation *attachment = NULL, bool repeat = false, int autoSignalPropagation = -1); unsigned int GetLog2WindowSize() const {return m_log2WindowSize;} private: unsigned int MaxPrestreamHeaderSize() const {return 2;} void ProcessPrestreamHeader(); void ProcessDecompressedData(const byte *string, size_t length); unsigned int MaxPoststreamTailSize() const {return 4;} void ProcessPoststreamTail(); unsigned int m_log2WindowSize; Adler32 m_adler32; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/tea.cpp0000755000000000000000000000723312414772654017060 0ustar rootroot// tea.cpp - modified by Wei Dai from code in the original paper #include "pch.h" #include "tea.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) static const word32 DELTA = 0x9e3779b9; typedef BlockGetAndPut Block; void TEA::Base::UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms) { AssertValidKeyLength(length); GetUserKey(BIG_ENDIAN_ORDER, m_k.begin(), 4, userKey, KEYLENGTH); m_limit = GetRoundsAndThrowIfInvalid(params, this) * DELTA; } void TEA::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 y, z; Block::Get(inBlock)(y)(z); word32 sum = 0; while (sum != m_limit) { sum += DELTA; y += (z << 4) + m_k[0] ^ z + sum ^ (z >> 5) + m_k[1]; z += (y << 4) + m_k[2] ^ y + sum ^ (y >> 5) + m_k[3]; } Block::Put(xorBlock, outBlock)(y)(z); } void TEA::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 y, z; Block::Get(inBlock)(y)(z); word32 sum = m_limit; while (sum != 0) { z -= (y << 4) + m_k[2] ^ y + sum ^ (y >> 5) + m_k[3]; y -= (z << 4) + m_k[0] ^ z + sum ^ (z >> 5) + m_k[1]; sum -= DELTA; } Block::Put(xorBlock, outBlock)(y)(z); } void XTEA::Base::UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms) { AssertValidKeyLength(length); GetUserKey(BIG_ENDIAN_ORDER, m_k.begin(), 4, userKey, KEYLENGTH); m_limit = GetRoundsAndThrowIfInvalid(params, this) * DELTA; } void XTEA::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 y, z; Block::Get(inBlock)(y)(z); #ifdef __SUNPRO_CC // workaround needed on Sun Studio 12u1 Sun C++ 5.10 SunOS_i386 128229-02 2009/09/21 size_t sum = 0; while ((sum&0xffffffff) != m_limit) #else word32 sum = 0; while (sum != m_limit) #endif { y += (z<<4 ^ z>>5) + z ^ sum + m_k[sum&3]; sum += DELTA; z += (y<<4 ^ y>>5) + y ^ sum + m_k[sum>>11 & 3]; } Block::Put(xorBlock, outBlock)(y)(z); } void XTEA::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 y, z; Block::Get(inBlock)(y)(z); #ifdef __SUNPRO_CC // workaround needed on Sun Studio 12u1 Sun C++ 5.10 SunOS_i386 128229-02 2009/09/21 size_t sum = m_limit; while ((sum&0xffffffff) != 0) #else word32 sum = m_limit; while (sum != 0) #endif { z -= (y<<4 ^ y>>5) + y ^ sum + m_k[sum>>11 & 3]; sum -= DELTA; y -= (z<<4 ^ z>>5) + z ^ sum + m_k[sum&3]; } Block::Put(xorBlock, outBlock)(y)(z); } #define MX (z>>5^y<<2)+(y>>3^z<<4)^(sum^y)+(m_k[p&3^e]^z) void BTEA::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { unsigned int n = m_blockSize / 4; word32 *v = (word32*)outBlock; ConditionalByteReverse(BIG_ENDIAN_ORDER, v, (const word32*)inBlock, m_blockSize); word32 y = v[0], z = v[n-1], e; word32 p, q = 6+52/n; word32 sum = 0; while (q-- > 0) { sum += DELTA; e = sum>>2 & 3; for (p = 0; p < n-1; p++) { y = v[p+1]; z = v[p] += MX; } y = v[0]; z = v[n-1] += MX; } ConditionalByteReverse(BIG_ENDIAN_ORDER, v, v, m_blockSize); } void BTEA::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { unsigned int n = m_blockSize / 4; word32 *v = (word32*)outBlock; ConditionalByteReverse(BIG_ENDIAN_ORDER, v, (const word32*)inBlock, m_blockSize); word32 y = v[0], z = v[n-1], e; word32 p, q = 6+52/n; word32 sum = q * DELTA; while (sum != 0) { e = sum>>2 & 3; for (p = n-1; p > 0; p--) { z = v[p-1]; y = v[p] -= MX; } z = v[n-1]; y = v[0] -= MX; sum -= DELTA; } ConditionalByteReverse(BIG_ENDIAN_ORDER, v, v, m_blockSize); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/gfpcrypt.cpp0000755000000000000000000002032112414772654020136 0ustar rootroot// dsa.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "gfpcrypt.h" #include "asn.h" #include "oids.h" #include "nbtheory.h" NAMESPACE_BEGIN(CryptoPP) void TestInstantiations_gfpcrypt() { GDSA::Signer test; GDSA::Verifier test1; DSA::Signer test5(NullRNG(), 100); DSA::Signer test2(test5); NR::Signer test3; NR::Verifier test4; DLIES<>::Encryptor test6; DLIES<>::Decryptor test7; } void DL_GroupParameters_DSA::GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg) { Integer p, q, g; if (alg.GetValue("Modulus", p) && alg.GetValue("SubgroupGenerator", g)) { q = alg.GetValueWithDefault("SubgroupOrder", ComputeGroupOrder(p)/2); } else { int modulusSize = 1024; alg.GetIntValue("ModulusSize", modulusSize) || alg.GetIntValue("KeySize", modulusSize); if (!DSA::IsValidPrimeLength(modulusSize)) throw InvalidArgument("DSA: not a valid prime length"); SecByteBlock seed(SHA::DIGESTSIZE); Integer h; int c; do { rng.GenerateBlock(seed, SHA::DIGESTSIZE); } while (!DSA::GeneratePrimes(seed, SHA::DIGESTSIZE*8, c, p, modulusSize, q)); do { h.Randomize(rng, 2, p-2); g = a_exp_b_mod_c(h, (p-1)/q, p); } while (g <= 1); } Initialize(p, q, g); } bool DL_GroupParameters_DSA::ValidateGroup(RandomNumberGenerator &rng, unsigned int level) const { bool pass = DL_GroupParameters_GFP::ValidateGroup(rng, level); pass = pass && DSA::IsValidPrimeLength(GetModulus().BitCount()); pass = pass && GetSubgroupOrder().BitCount() == 160; return pass; } void DL_SignatureMessageEncodingMethod_DSA::ComputeMessageRepresentative(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const { assert(recoverableMessageLength == 0); assert(hashIdentifier.second == 0); const size_t representativeByteLength = BitsToBytes(representativeBitLength); const size_t digestSize = hash.DigestSize(); const size_t paddingLength = SaturatingSubtract(representativeByteLength, digestSize); memset(representative, 0, paddingLength); hash.TruncatedFinal(representative+paddingLength, STDMIN(representativeByteLength, digestSize)); if (digestSize*8 > representativeBitLength) { Integer h(representative, representativeByteLength); h >>= representativeByteLength*8 - representativeBitLength; h.Encode(representative, representativeByteLength); } } void DL_SignatureMessageEncodingMethod_NR::ComputeMessageRepresentative(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const { assert(recoverableMessageLength == 0); assert(hashIdentifier.second == 0); const size_t representativeByteLength = BitsToBytes(representativeBitLength); const size_t digestSize = hash.DigestSize(); const size_t paddingLength = SaturatingSubtract(representativeByteLength, digestSize); memset(representative, 0, paddingLength); hash.TruncatedFinal(representative+paddingLength, STDMIN(representativeByteLength, digestSize)); if (digestSize*8 >= representativeBitLength) { Integer h(representative, representativeByteLength); h >>= representativeByteLength*8 - representativeBitLength + 1; h.Encode(representative, representativeByteLength); } } bool DL_GroupParameters_IntegerBased::ValidateGroup(RandomNumberGenerator &rng, unsigned int level) const { const Integer &p = GetModulus(), &q = GetSubgroupOrder(); bool pass = true; pass = pass && p > Integer::One() && p.IsOdd(); pass = pass && q > Integer::One() && q.IsOdd(); if (level >= 1) pass = pass && GetCofactor() > Integer::One() && GetGroupOrder() % q == Integer::Zero(); if (level >= 2) pass = pass && VerifyPrime(rng, q, level-2) && VerifyPrime(rng, p, level-2); return pass; } bool DL_GroupParameters_IntegerBased::ValidateElement(unsigned int level, const Integer &g, const DL_FixedBasePrecomputation *gpc) const { const Integer &p = GetModulus(), &q = GetSubgroupOrder(); bool pass = true; pass = pass && GetFieldType() == 1 ? g.IsPositive() : g.NotNegative(); pass = pass && g < p && !IsIdentity(g); if (level >= 1) { if (gpc) pass = pass && gpc->Exponentiate(GetGroupPrecomputation(), Integer::One()) == g; } if (level >= 2) { if (GetFieldType() == 2) pass = pass && Jacobi(g*g-4, p)==-1; // verifying that Lucas((p+1)/2, w, p)==2 is omitted because it's too costly // and at most 1 bit is leaked if it's false bool fullValidate = (GetFieldType() == 2 && level >= 3) || !FastSubgroupCheckAvailable(); if (fullValidate && pass) { Integer gp = gpc ? gpc->Exponentiate(GetGroupPrecomputation(), q) : ExponentiateElement(g, q); pass = pass && IsIdentity(gp); } else if (GetFieldType() == 1) pass = pass && Jacobi(g, p) == 1; } return pass; } void DL_GroupParameters_IntegerBased::GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg) { Integer p, q, g; if (alg.GetValue("Modulus", p) && alg.GetValue("SubgroupGenerator", g)) { q = alg.GetValueWithDefault("SubgroupOrder", ComputeGroupOrder(p)/2); } else { int modulusSize, subgroupOrderSize; if (!alg.GetIntValue("ModulusSize", modulusSize)) modulusSize = alg.GetIntValueWithDefault("KeySize", 2048); if (!alg.GetIntValue("SubgroupOrderSize", subgroupOrderSize)) subgroupOrderSize = GetDefaultSubgroupOrderSize(modulusSize); PrimeAndGenerator pg; pg.Generate(GetFieldType() == 1 ? 1 : -1, rng, modulusSize, subgroupOrderSize); p = pg.Prime(); q = pg.SubPrime(); g = pg.Generator(); } Initialize(p, q, g); } Integer DL_GroupParameters_IntegerBased::DecodeElement(const byte *encoded, bool checkForGroupMembership) const { Integer g(encoded, GetModulus().ByteCount()); if (!ValidateElement(1, g, NULL)) throw DL_BadElement(); return g; } void DL_GroupParameters_IntegerBased::BERDecode(BufferedTransformation &bt) { BERSequenceDecoder parameters(bt); Integer p(parameters); Integer q(parameters); Integer g; if (parameters.EndReached()) { g = q; q = ComputeGroupOrder(p) / 2; } else g.BERDecode(parameters); parameters.MessageEnd(); SetModulusAndSubgroupGenerator(p, g); SetSubgroupOrder(q); } void DL_GroupParameters_IntegerBased::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder parameters(bt); GetModulus().DEREncode(parameters); m_q.DEREncode(parameters); GetSubgroupGenerator().DEREncode(parameters); parameters.MessageEnd(); } bool DL_GroupParameters_IntegerBased::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper >(this, name, valueType, pValue) CRYPTOPP_GET_FUNCTION_ENTRY(Modulus); } void DL_GroupParameters_IntegerBased::AssignFrom(const NameValuePairs &source) { AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY2(Modulus, SubgroupGenerator) CRYPTOPP_SET_FUNCTION_ENTRY(SubgroupOrder) ; } OID DL_GroupParameters_IntegerBased::GetAlgorithmID() const { return ASN1::id_dsa(); } void DL_GroupParameters_GFP::SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const { ModularArithmetic ma(GetModulus()); ma.SimultaneousExponentiate(results, base, exponents, exponentsCount); } DL_GroupParameters_GFP::Element DL_GroupParameters_GFP::MultiplyElements(const Element &a, const Element &b) const { return a_times_b_mod_c(a, b, GetModulus()); } DL_GroupParameters_GFP::Element DL_GroupParameters_GFP::CascadeExponentiate(const Element &element1, const Integer &exponent1, const Element &element2, const Integer &exponent2) const { ModularArithmetic ma(GetModulus()); return ma.CascadeExponentiate(element1, exponent1, element2, exponent2); } Integer DL_GroupParameters_IntegerBased::GetMaxExponent() const { return STDMIN(GetSubgroupOrder()-1, Integer::Power2(2*DiscreteLogWorkFactor(GetFieldType()*GetModulus().BitCount()))); } unsigned int DL_GroupParameters_IntegerBased::GetDefaultSubgroupOrderSize(unsigned int modulusSize) const { return 2*DiscreteLogWorkFactor(GetFieldType()*modulusSize); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/sosemanuk.h0000755000000000000000000000241012414772654017751 0ustar rootroot#ifndef CRYPTOPP_SOSEMANUK_H #define CRYPTOPP_SOSEMANUK_H #include "strciphr.h" NAMESPACE_BEGIN(CryptoPP) //! algorithm info struct SosemanukInfo : public VariableKeyLength<16, 1, 32, 1, SimpleKeyingInterface::UNIQUE_IV, 16> { static const char * StaticAlgorithmName() {return "Sosemanuk";} }; //! _ class SosemanukPolicy : public AdditiveCipherConcretePolicy, public SosemanukInfo { protected: void CipherSetKey(const NameValuePairs ¶ms, const byte *key, size_t length); void OperateKeystream(KeystreamOperation operation, byte *output, const byte *input, size_t iterationCount); void CipherResynchronize(byte *keystreamBuffer, const byte *iv, size_t length); bool CipherIsRandomAccess() const {return false;} #if CRYPTOPP_BOOL_X86 || CRYPTOPP_BOOL_X64 unsigned int GetAlignment() const; unsigned int GetOptimalBlockSize() const; #endif FixedSizeSecBlock m_key; FixedSizeAlignedSecBlock m_state; }; //! Sosemanuk struct Sosemanuk : public SosemanukInfo, public SymmetricCipherDocumentation { typedef SymmetricCipherFinal >, SosemanukInfo> Encryption; typedef Encryption Decryption; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/cast.h0000755000000000000000000000442012414772654016701 0ustar rootroot#ifndef CRYPTOPP_CAST_H #define CRYPTOPP_CAST_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) class CAST { protected: static const word32 S[8][256]; }; //! algorithm info struct CAST128_Info : public FixedBlockSize<8>, public VariableKeyLength<16, 5, 16> { static const char *StaticAlgorithmName() {return "CAST-128";} }; /// CAST-128 class CAST128 : public CAST128_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public CAST, public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); protected: bool reduced; FixedSizeSecBlock K; }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; //! algorithm info struct CAST256_Info : public FixedBlockSize<16>, public VariableKeyLength<16, 16, 32> { static const char *StaticAlgorithmName() {return "CAST-256";} }; //! CAST-256 class CAST256 : public CAST256_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public CAST, public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; protected: static const word32 t_m[8][24]; static const unsigned int t_r[8][24]; static void Omega(int i, word32 kappa[8]); FixedSizeSecBlock K; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef CAST128::Encryption CAST128Encryption; typedef CAST128::Decryption CAST128Decryption; typedef CAST256::Encryption CAST256Encryption; typedef CAST256::Decryption CAST256Decryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/rijndael.h0000755000000000000000000000367412414772654017551 0ustar rootroot#ifndef CRYPTOPP_RIJNDAEL_H #define CRYPTOPP_RIJNDAEL_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct Rijndael_Info : public FixedBlockSize<16>, public VariableKeyLength<16, 16, 32, 8> { CRYPTOPP_DLL static const char * CRYPTOPP_API StaticAlgorithmName() {return CRYPTOPP_RIJNDAEL_NAME;} }; /// Rijndael class CRYPTOPP_DLL Rijndael : public Rijndael_Info, public BlockCipherDocumentation { class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); protected: static void FillEncTable(); static void FillDecTable(); // VS2005 workaround: have to put these on seperate lines, or error C2487 is triggered in DLL build static const byte Se[256]; static const byte Sd[256]; static const word32 rcon[]; unsigned int m_rounds; FixedSizeAlignedSecBlock m_key; }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; #if CRYPTOPP_BOOL_X64 || CRYPTOPP_BOOL_X86 size_t AdvancedProcessBlocks(const byte *inBlocks, const byte *xorBlocks, byte *outBlocks, size_t length, word32 flags) const; #endif }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE size_t AdvancedProcessBlocks(const byte *inBlocks, const byte *xorBlocks, byte *outBlocks, size_t length, word32 flags) const; #endif }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef Rijndael::Encryption RijndaelEncryption; typedef Rijndael::Decryption RijndaelDecryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/oaep.cpp0000755000000000000000000000574212414772654017236 0ustar rootroot// oaep.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "oaep.h" #include NAMESPACE_BEGIN(CryptoPP) // ******************************************************** size_t OAEP_Base::MaxUnpaddedLength(size_t paddedLength) const { return SaturatingSubtract(paddedLength/8, 1+2*DigestSize()); } void OAEP_Base::Pad(RandomNumberGenerator &rng, const byte *input, size_t inputLength, byte *oaepBlock, size_t oaepBlockLen, const NameValuePairs ¶meters) const { assert (inputLength <= MaxUnpaddedLength(oaepBlockLen)); // convert from bit length to byte length if (oaepBlockLen % 8 != 0) { oaepBlock[0] = 0; oaepBlock++; } oaepBlockLen /= 8; std::auto_ptr pHash(NewHash()); const size_t hLen = pHash->DigestSize(); const size_t seedLen = hLen, dbLen = oaepBlockLen-seedLen; byte *const maskedSeed = oaepBlock; byte *const maskedDB = oaepBlock+seedLen; ConstByteArrayParameter encodingParameters; parameters.GetValue(Name::EncodingParameters(), encodingParameters); // DB = pHash || 00 ... || 01 || M pHash->CalculateDigest(maskedDB, encodingParameters.begin(), encodingParameters.size()); memset(maskedDB+hLen, 0, dbLen-hLen-inputLength-1); maskedDB[dbLen-inputLength-1] = 0x01; memcpy(maskedDB+dbLen-inputLength, input, inputLength); rng.GenerateBlock(maskedSeed, seedLen); std::auto_ptr pMGF(NewMGF()); pMGF->GenerateAndMask(*pHash, maskedDB, dbLen, maskedSeed, seedLen); pMGF->GenerateAndMask(*pHash, maskedSeed, seedLen, maskedDB, dbLen); } DecodingResult OAEP_Base::Unpad(const byte *oaepBlock, size_t oaepBlockLen, byte *output, const NameValuePairs ¶meters) const { bool invalid = false; // convert from bit length to byte length if (oaepBlockLen % 8 != 0) { invalid = (oaepBlock[0] != 0) || invalid; oaepBlock++; } oaepBlockLen /= 8; std::auto_ptr pHash(NewHash()); const size_t hLen = pHash->DigestSize(); const size_t seedLen = hLen, dbLen = oaepBlockLen-seedLen; invalid = (oaepBlockLen < 2*hLen+1) || invalid; SecByteBlock t(oaepBlock, oaepBlockLen); byte *const maskedSeed = t; byte *const maskedDB = t+seedLen; std::auto_ptr pMGF(NewMGF()); pMGF->GenerateAndMask(*pHash, maskedSeed, seedLen, maskedDB, dbLen); pMGF->GenerateAndMask(*pHash, maskedDB, dbLen, maskedSeed, seedLen); ConstByteArrayParameter encodingParameters; parameters.GetValue(Name::EncodingParameters(), encodingParameters); // DB = pHash' || 00 ... || 01 || M byte *M = std::find(maskedDB+hLen, maskedDB+dbLen, 0x01); invalid = (M == maskedDB+dbLen) || invalid; invalid = (std::find_if(maskedDB+hLen, M, std::bind2nd(std::not_equal_to(), 0)) != M) || invalid; invalid = !pHash->VerifyDigest(maskedDB, encodingParameters.begin(), encodingParameters.size()) || invalid; if (invalid) return DecodingResult(); M++; memcpy(output, M, maskedDB+dbLen-M); return DecodingResult(maskedDB+dbLen-M); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/randpool.h0000755000000000000000000000174612414772654017575 0ustar rootroot#ifndef CRYPTOPP_RANDPOOL_H #define CRYPTOPP_RANDPOOL_H #include "cryptlib.h" #include "filters.h" NAMESPACE_BEGIN(CryptoPP) //! Randomness Pool /*! This class can be used to generate cryptographic quality pseudorandom bytes after seeding the pool with IncorporateEntropy() */ class CRYPTOPP_DLL RandomPool : public RandomNumberGenerator, public NotCopyable { public: RandomPool(); bool CanIncorporateEntropy() const {return true;} void IncorporateEntropy(const byte *input, size_t length); void GenerateIntoBufferedTransformation(BufferedTransformation &target, const std::string &channel, lword size); // for backwards compatibility. use RandomNumberSource, RandomNumberStore, and RandomNumberSink for other BufferTransformation functionality void Put(const byte *input, size_t length) {IncorporateEntropy(input, length);} private: FixedSizeSecBlock m_key; FixedSizeSecBlock m_seed; member_ptr m_pCipher; bool m_keySet; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/blowfish.cpp0000755000000000000000000000427612414772654020130 0ustar rootroot// blowfish.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "blowfish.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) void Blowfish::Base::UncheckedSetKey(const byte *key_string, unsigned int keylength, const NameValuePairs &) { AssertValidKeyLength(keylength); unsigned i, j=0, k; word32 data, dspace[2] = {0, 0}; memcpy(pbox, p_init, sizeof(p_init)); memcpy(sbox, s_init, sizeof(s_init)); // Xor key string into encryption key vector for (i=0 ; i Block; word32 left, right; Block::Get(inBlock)(left)(right); const word32 *const s=sbox; const word32 *p=pbox; left ^= p[0]; for (unsigned i=0; i #endif NAMESPACE_BEGIN(CryptoPP) #ifdef HIGHRES_TIMER_AVAILABLE typedef word64 TimerWord; #else typedef clock_t TimerWord; #endif //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE TimerBase { public: enum Unit {SECONDS = 0, MILLISECONDS, MICROSECONDS, NANOSECONDS}; TimerBase(Unit unit, bool stuckAtZero) : m_timerUnit(unit), m_stuckAtZero(stuckAtZero), m_started(false) {} virtual TimerWord GetCurrentTimerValue() =0; // GetCurrentTime is a macro in MSVC 6.0 virtual TimerWord TicksPerSecond() =0; // this is not the resolution, just a conversion factor into seconds void StartTimer(); double ElapsedTimeAsDouble(); unsigned long ElapsedTime(); private: double ConvertTo(TimerWord t, Unit unit); Unit m_timerUnit; // HPUX workaround: m_unit is a system macro on HPUX bool m_stuckAtZero, m_started; TimerWord m_start, m_last; }; //! measure CPU time spent executing instructions of this thread (if supported by OS) /*! /note This only works correctly on Windows NT or later. On Unix it reports process time, and others wall clock time. */ class ThreadUserTimer : public TimerBase { public: ThreadUserTimer(Unit unit = TimerBase::SECONDS, bool stuckAtZero = false) : TimerBase(unit, stuckAtZero) {} TimerWord GetCurrentTimerValue(); TimerWord TicksPerSecond(); }; //! high resolution timer class CRYPTOPP_DLL Timer : public TimerBase { public: Timer(Unit unit = TimerBase::SECONDS, bool stuckAtZero = false) : TimerBase(unit, stuckAtZero) {} TimerWord GetCurrentTimerValue(); TimerWord TicksPerSecond(); }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/basecode.cpp0000755000000000000000000001277312414772654020061 0ustar rootroot// basecode.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "basecode.h" #include "fltrimpl.h" #include NAMESPACE_BEGIN(CryptoPP) void BaseN_Encoder::IsolatedInitialize(const NameValuePairs ¶meters) { parameters.GetRequiredParameter("BaseN_Encoder", Name::EncodingLookupArray(), m_alphabet); parameters.GetRequiredIntParameter("BaseN_Encoder", Name::Log2Base(), m_bitsPerChar); if (m_bitsPerChar <= 0 || m_bitsPerChar >= 8) throw InvalidArgument("BaseN_Encoder: Log2Base must be between 1 and 7 inclusive"); byte padding; bool pad; if (parameters.GetValue(Name::PaddingByte(), padding)) pad = parameters.GetValueWithDefault(Name::Pad(), true); else pad = false; m_padding = pad ? padding : -1; m_bytePos = m_bitPos = 0; int i = 8; while (i%m_bitsPerChar != 0) i += 8; m_outputBlockSize = i/m_bitsPerChar; m_outBuf.New(m_outputBlockSize); } size_t BaseN_Encoder::Put2(const byte *begin, size_t length, int messageEnd, bool blocking) { FILTER_BEGIN; while (m_inputPosition < length) { if (m_bytePos == 0) memset(m_outBuf, 0, m_outputBlockSize); { unsigned int b = begin[m_inputPosition++], bitsLeftInSource = 8; while (true) { assert(m_bitPos < m_bitsPerChar); unsigned int bitsLeftInTarget = m_bitsPerChar-m_bitPos; m_outBuf[m_bytePos] |= b >> (8-bitsLeftInTarget); if (bitsLeftInSource >= bitsLeftInTarget) { m_bitPos = 0; ++m_bytePos; bitsLeftInSource -= bitsLeftInTarget; if (bitsLeftInSource == 0) break; b <<= bitsLeftInTarget; b &= 0xff; } else { m_bitPos += bitsLeftInSource; break; } } } assert(m_bytePos <= m_outputBlockSize); if (m_bytePos == m_outputBlockSize) { int i; for (i=0; i 0) ++m_bytePos; int i; for (i=0; i 0) { memset(m_outBuf+m_bytePos, m_padding, m_outputBlockSize-m_bytePos); m_bytePos = m_outputBlockSize; } FILTER_OUTPUT(2, m_outBuf, m_bytePos, messageEnd); m_bytePos = m_bitPos = 0; } FILTER_END_NO_MESSAGE_END; } void BaseN_Decoder::IsolatedInitialize(const NameValuePairs ¶meters) { parameters.GetRequiredParameter("BaseN_Decoder", Name::DecodingLookupArray(), m_lookup); parameters.GetRequiredIntParameter("BaseN_Decoder", Name::Log2Base(), m_bitsPerChar); if (m_bitsPerChar <= 0 || m_bitsPerChar >= 8) throw InvalidArgument("BaseN_Decoder: Log2Base must be between 1 and 7 inclusive"); m_bytePos = m_bitPos = 0; int i = m_bitsPerChar; while (i%8 != 0) i += m_bitsPerChar; m_outputBlockSize = i/8; m_outBuf.New(m_outputBlockSize); } size_t BaseN_Decoder::Put2(const byte *begin, size_t length, int messageEnd, bool blocking) { FILTER_BEGIN; while (m_inputPosition < length) { unsigned int value; value = m_lookup[begin[m_inputPosition++]]; if (value >= 256) continue; if (m_bytePos == 0 && m_bitPos == 0) memset(m_outBuf, 0, m_outputBlockSize); { int newBitPos = m_bitPos + m_bitsPerChar; if (newBitPos <= 8) m_outBuf[m_bytePos] |= value << (8-newBitPos); else { m_outBuf[m_bytePos] |= value >> (newBitPos-8); m_outBuf[m_bytePos+1] |= value << (16-newBitPos); } m_bitPos = newBitPos; while (m_bitPos >= 8) { m_bitPos -= 8; ++m_bytePos; } } if (m_bytePos == m_outputBlockSize) { FILTER_OUTPUT(1, m_outBuf, m_outputBlockSize, 0); m_bytePos = m_bitPos = 0; } } if (messageEnd) { FILTER_OUTPUT(2, m_outBuf, m_bytePos, messageEnd); m_bytePos = m_bitPos = 0; } FILTER_END_NO_MESSAGE_END; } void BaseN_Decoder::InitializeDecodingLookupArray(int *lookup, const byte *alphabet, unsigned int base, bool caseInsensitive) { std::fill(lookup, lookup+256, -1); for (unsigned int i=0; i, public RandomNumberGenerator, public SymmetricCipher, public SymmetricCipherDocumentation { public: ~ARC4_Base(); static const char *StaticAlgorithmName() {return "ARC4";} void GenerateBlock(byte *output, size_t size); void DiscardBytes(size_t n); void ProcessData(byte *outString, const byte *inString, size_t length); bool IsRandomAccess() const {return false;} bool IsSelfInverting() const {return true;} bool IsForwardTransformation() const {return true;} typedef SymmetricCipherFinal Encryption; typedef SymmetricCipherFinal Decryption; protected: void UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms); virtual unsigned int GetDefaultDiscardBytes() const {return 0;} FixedSizeSecBlock m_state; byte m_x, m_y; }; //! Alleged RC4 DOCUMENTED_TYPEDEF(SymmetricCipherFinal, ARC4) //! _ class CRYPTOPP_NO_VTABLE MARC4_Base : public ARC4_Base { public: static const char *StaticAlgorithmName() {return "MARC4";} typedef SymmetricCipherFinal Encryption; typedef SymmetricCipherFinal Decryption; protected: unsigned int GetDefaultDiscardBytes() const {return 256;} }; //! Modified ARC4: it discards the first 256 bytes of keystream which may be weaker than the rest DOCUMENTED_TYPEDEF(SymmetricCipherFinal, MARC4) } #if CRYPTOPP_ENABLE_NAMESPACE_WEAK >= 1 namespace Weak {using namespace Weak1;} // import Weak1 into CryptoPP::Weak #else using namespace Weak1; // import Weak1 into CryptoPP with warning #ifdef __GNUC__ #warning "You may be using a weak algorithm that has been retained for backwards compatibility. Please '#define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1' before including this .h file and prepend the class name with 'Weak::' to remove this warning." #else #pragma message("You may be using a weak algorithm that has been retained for backwards compatibility. Please '#define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1' before including this .h file and prepend the class name with 'Weak::' to remove this warning.") #endif #endif NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/des.h0000755000000000000000000001055712414772654016532 0ustar rootroot#ifndef CRYPTOPP_DES_H #define CRYPTOPP_DES_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) class CRYPTOPP_DLL RawDES { public: void RawSetKey(CipherDir direction, const byte *userKey); void RawProcessBlock(word32 &l, word32 &r) const; protected: static const word32 Spbox[8][64]; FixedSizeSecBlock k; }; //! _ struct DES_Info : public FixedBlockSize<8>, public FixedKeyLength<8> { // disable DES in DLL version by not exporting this function static const char * StaticAlgorithmName() {return "DES";} }; /// DES /*! The DES implementation in Crypto++ ignores the parity bits (the least significant bits of each byte) in the key. However you can use CheckKeyParityBits() and CorrectKeyParityBits() to check or correct the parity bits if you wish. */ class DES : public DES_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl, public RawDES { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; public: //! check DES key parity bits static bool CheckKeyParityBits(const byte *key); //! correct DES key parity bits static void CorrectKeyParityBits(byte *key); typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; //! _ struct DES_EDE2_Info : public FixedBlockSize<8>, public FixedKeyLength<16> { CRYPTOPP_DLL static const char * CRYPTOPP_API StaticAlgorithmName() {return "DES-EDE2";} }; /// DES-EDE2 class DES_EDE2 : public DES_EDE2_Info, public BlockCipherDocumentation { class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; protected: RawDES m_des1, m_des2; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; //! _ struct DES_EDE3_Info : public FixedBlockSize<8>, public FixedKeyLength<24> { CRYPTOPP_DLL static const char * CRYPTOPP_API StaticAlgorithmName() {return "DES-EDE3";} }; /// DES-EDE3 class DES_EDE3 : public DES_EDE3_Info, public BlockCipherDocumentation { class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; protected: RawDES m_des1, m_des2, m_des3; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; //! _ struct DES_XEX3_Info : public FixedBlockSize<8>, public FixedKeyLength<24> { static const char *StaticAlgorithmName() {return "DES-XEX3";} }; /// DES-XEX3, AKA DESX class DES_XEX3 : public DES_XEX3_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; protected: FixedSizeSecBlock m_x1, m_x3; // VS2005 workaround: calling modules compiled with /clr gets unresolved external symbol DES::Base::ProcessAndXorBlock // if we use DES::Encryption here directly without value_ptr. value_ptr m_des; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef DES::Encryption DESEncryption; typedef DES::Decryption DESDecryption; typedef DES_EDE2::Encryption DES_EDE2_Encryption; typedef DES_EDE2::Decryption DES_EDE2_Decryption; typedef DES_EDE3::Encryption DES_EDE3_Encryption; typedef DES_EDE3::Decryption DES_EDE3_Decryption; typedef DES_XEX3::Encryption DES_XEX3_Encryption; typedef DES_XEX3::Decryption DES_XEX3_Decryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/network.cpp0000755000000000000000000003565212414772654020006 0ustar rootroot// network.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "network.h" #include "wait.h" #define CRYPTOPP_TRACE_NETWORK 0 NAMESPACE_BEGIN(CryptoPP) #ifdef HIGHRES_TIMER_AVAILABLE lword LimitedBandwidth::ComputeCurrentTransceiveLimit() { if (!m_maxBytesPerSecond) return ULONG_MAX; double curTime = GetCurTimeAndCleanUp(); lword total = 0; for (OpQueue::size_type i=0; i!=m_ops.size(); ++i) total += m_ops[i].second; return SaturatingSubtract(m_maxBytesPerSecond, total); } double LimitedBandwidth::TimeToNextTransceive() { if (!m_maxBytesPerSecond) return 0; if (!m_nextTransceiveTime) ComputeNextTransceiveTime(); return SaturatingSubtract(m_nextTransceiveTime, m_timer.ElapsedTimeAsDouble()); } void LimitedBandwidth::NoteTransceive(lword size) { if (m_maxBytesPerSecond) { double curTime = GetCurTimeAndCleanUp(); m_ops.push_back(std::make_pair(curTime, size)); m_nextTransceiveTime = 0; } } void LimitedBandwidth::ComputeNextTransceiveTime() { double curTime = GetCurTimeAndCleanUp(); lword total = 0; for (unsigned int i=0; i!=m_ops.size(); ++i) total += m_ops[i].second; m_nextTransceiveTime = (total < m_maxBytesPerSecond) ? curTime : m_ops.front().first + 1000; } double LimitedBandwidth::GetCurTimeAndCleanUp() { if (!m_maxBytesPerSecond) return 0; double curTime = m_timer.ElapsedTimeAsDouble(); while (m_ops.size() && (m_ops.front().first + 1000 < curTime)) m_ops.pop_front(); return curTime; } void LimitedBandwidth::GetWaitObjects(WaitObjectContainer &container, const CallStack &callStack) { double nextTransceiveTime = TimeToNextTransceive(); if (nextTransceiveTime) container.ScheduleEvent(nextTransceiveTime, CallStack("LimitedBandwidth::GetWaitObjects()", &callStack)); } // ************************************************************* size_t NonblockingSource::GeneralPump2( lword& byteCount, bool blockingOutput, unsigned long maxTime, bool checkDelimiter, byte delimiter) { m_blockedBySpeedLimit = false; if (!GetMaxBytesPerSecond()) { size_t ret = DoPump(byteCount, blockingOutput, maxTime, checkDelimiter, delimiter); m_doPumpBlocked = (ret != 0); return ret; } bool forever = (maxTime == INFINITE_TIME); unsigned long timeToGo = maxTime; Timer timer(Timer::MILLISECONDS, forever); lword maxSize = byteCount; byteCount = 0; timer.StartTimer(); while (true) { lword curMaxSize = UnsignedMin(ComputeCurrentTransceiveLimit(), maxSize - byteCount); if (curMaxSize || m_doPumpBlocked) { if (!forever) timeToGo = SaturatingSubtract(maxTime, timer.ElapsedTime()); size_t ret = DoPump(curMaxSize, blockingOutput, timeToGo, checkDelimiter, delimiter); m_doPumpBlocked = (ret != 0); if (curMaxSize) { NoteTransceive(curMaxSize); byteCount += curMaxSize; } if (ret) return ret; } if (maxSize != ULONG_MAX && byteCount >= maxSize) break; if (!forever) { timeToGo = SaturatingSubtract(maxTime, timer.ElapsedTime()); if (!timeToGo) break; } double waitTime = TimeToNextTransceive(); if (!forever && waitTime > timeToGo) { m_blockedBySpeedLimit = true; break; } WaitObjectContainer container; LimitedBandwidth::GetWaitObjects(container, CallStack("NonblockingSource::GeneralPump2() - speed limit", 0)); container.Wait((unsigned long)waitTime); } return 0; } size_t NonblockingSource::PumpMessages2(unsigned int &messageCount, bool blocking) { if (messageCount == 0) return 0; messageCount = 0; lword byteCount; do { byteCount = LWORD_MAX; RETURN_IF_NONZERO(Pump2(byteCount, blocking)); } while(byteCount == LWORD_MAX); if (!m_messageEndSent && SourceExhausted()) { RETURN_IF_NONZERO(AttachedTransformation()->Put2(NULL, 0, GetAutoSignalPropagation(), true)); m_messageEndSent = true; messageCount = 1; } return 0; } lword NonblockingSink::TimedFlush(unsigned long maxTime, size_t targetSize) { m_blockedBySpeedLimit = false; size_t curBufSize = GetCurrentBufferSize(); if (curBufSize <= targetSize && (targetSize || !EofPending())) return 0; if (!GetMaxBytesPerSecond()) return DoFlush(maxTime, targetSize); bool forever = (maxTime == INFINITE_TIME); unsigned long timeToGo = maxTime; Timer timer(Timer::MILLISECONDS, forever); lword totalFlushed = 0; timer.StartTimer(); while (true) { size_t flushSize = UnsignedMin(curBufSize - targetSize, ComputeCurrentTransceiveLimit()); if (flushSize || EofPending()) { if (!forever) timeToGo = SaturatingSubtract(maxTime, timer.ElapsedTime()); size_t ret = (size_t)DoFlush(timeToGo, curBufSize - flushSize); if (ret) { NoteTransceive(ret); curBufSize -= ret; totalFlushed += ret; } } if (curBufSize <= targetSize && (targetSize || !EofPending())) break; if (!forever) { timeToGo = SaturatingSubtract(maxTime, timer.ElapsedTime()); if (!timeToGo) break; } double waitTime = TimeToNextTransceive(); if (!forever && waitTime > timeToGo) { m_blockedBySpeedLimit = true; break; } WaitObjectContainer container; LimitedBandwidth::GetWaitObjects(container, CallStack("NonblockingSink::TimedFlush() - speed limit", 0)); container.Wait((unsigned long)waitTime); } return totalFlushed; } bool NonblockingSink::IsolatedFlush(bool hardFlush, bool blocking) { TimedFlush(blocking ? INFINITE_TIME : 0); return hardFlush && (!!GetCurrentBufferSize() || EofPending()); } // ************************************************************* NetworkSource::NetworkSource(BufferedTransformation *attachment) : NonblockingSource(attachment), m_buf(1024*16) , m_waitingForResult(false), m_outputBlocked(false) , m_dataBegin(0), m_dataEnd(0) { } unsigned int NetworkSource::GetMaxWaitObjectCount() const { return LimitedBandwidth::GetMaxWaitObjectCount() + GetReceiver().GetMaxWaitObjectCount() + AttachedTransformation()->GetMaxWaitObjectCount(); } void NetworkSource::GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack) { if (BlockedBySpeedLimit()) LimitedBandwidth::GetWaitObjects(container, CallStack("NetworkSource::GetWaitObjects() - speed limit", &callStack)); else if (!m_outputBlocked) { if (m_dataBegin == m_dataEnd) AccessReceiver().GetWaitObjects(container, CallStack("NetworkSource::GetWaitObjects() - no data", &callStack)); else container.SetNoWait(CallStack("NetworkSource::GetWaitObjects() - have data", &callStack)); } AttachedTransformation()->GetWaitObjects(container, CallStack("NetworkSource::GetWaitObjects() - attachment", &callStack)); } size_t NetworkSource::DoPump(lword &byteCount, bool blockingOutput, unsigned long maxTime, bool checkDelimiter, byte delimiter) { NetworkReceiver &receiver = AccessReceiver(); lword maxSize = byteCount; byteCount = 0; bool forever = maxTime == INFINITE_TIME; Timer timer(Timer::MILLISECONDS, forever); BufferedTransformation *t = AttachedTransformation(); if (m_outputBlocked) goto DoOutput; while (true) { if (m_dataBegin == m_dataEnd) { if (receiver.EofReceived()) break; if (m_waitingForResult) { if (receiver.MustWaitForResult() && !receiver.Wait(SaturatingSubtract(maxTime, timer.ElapsedTime()), CallStack("NetworkSource::DoPump() - wait receive result", 0))) break; unsigned int recvResult = receiver.GetReceiveResult(); #if CRYPTOPP_TRACE_NETWORK OutputDebugString((IntToString((unsigned int)this) + ": Received " + IntToString(recvResult) + " bytes\n").c_str()); #endif m_dataEnd += recvResult; m_waitingForResult = false; if (!receiver.MustWaitToReceive() && !receiver.EofReceived() && m_dataEnd != m_buf.size()) goto ReceiveNoWait; } else { m_dataEnd = m_dataBegin = 0; if (receiver.MustWaitToReceive()) { if (!receiver.Wait(SaturatingSubtract(maxTime, timer.ElapsedTime()), CallStack("NetworkSource::DoPump() - wait receive", 0))) break; receiver.Receive(m_buf+m_dataEnd, m_buf.size()-m_dataEnd); m_waitingForResult = true; } else { ReceiveNoWait: m_waitingForResult = true; // call Receive repeatedly as long as data is immediately available, // because some receivers tend to return data in small pieces #if CRYPTOPP_TRACE_NETWORK OutputDebugString((IntToString((unsigned int)this) + ": Receiving " + IntToString(m_buf.size()-m_dataEnd) + " bytes\n").c_str()); #endif while (receiver.Receive(m_buf+m_dataEnd, m_buf.size()-m_dataEnd)) { unsigned int recvResult = receiver.GetReceiveResult(); #if CRYPTOPP_TRACE_NETWORK OutputDebugString((IntToString((unsigned int)this) + ": Received " + IntToString(recvResult) + " bytes\n").c_str()); #endif m_dataEnd += recvResult; if (receiver.EofReceived() || m_dataEnd > m_buf.size() /2) { m_waitingForResult = false; break; } } } } } else { m_putSize = UnsignedMin(m_dataEnd - m_dataBegin, maxSize - byteCount); if (checkDelimiter) m_putSize = std::find(m_buf+m_dataBegin, m_buf+m_dataBegin+m_putSize, delimiter) - (m_buf+m_dataBegin); DoOutput: size_t result = t->PutModifiable2(m_buf+m_dataBegin, m_putSize, 0, forever || blockingOutput); if (result) { if (t->Wait(SaturatingSubtract(maxTime, timer.ElapsedTime()), CallStack("NetworkSource::DoPump() - wait attachment", 0))) goto DoOutput; else { m_outputBlocked = true; return result; } } m_outputBlocked = false; byteCount += m_putSize; m_dataBegin += m_putSize; if (checkDelimiter && m_dataBegin < m_dataEnd && m_buf[m_dataBegin] == delimiter) break; if (maxSize != ULONG_MAX && byteCount == maxSize) break; // once time limit is reached, return even if there is more data waiting // but make 0 a special case so caller can request a large amount of data to be // pumped as long as it is immediately available if (maxTime > 0 && timer.ElapsedTime() > maxTime) break; } } return 0; } // ************************************************************* NetworkSink::NetworkSink(unsigned int maxBufferSize, unsigned int autoFlushBound) : m_maxBufferSize(maxBufferSize), m_autoFlushBound(autoFlushBound) , m_needSendResult(false), m_wasBlocked(false), m_eofState(EOF_NONE) , m_buffer(STDMIN(16U*1024U+256, maxBufferSize)), m_skipBytes(0) , m_speedTimer(Timer::MILLISECONDS), m_byteCountSinceLastTimerReset(0) , m_currentSpeed(0), m_maxObservedSpeed(0) { } float NetworkSink::ComputeCurrentSpeed() { if (m_speedTimer.ElapsedTime() > 1000) { m_currentSpeed = m_byteCountSinceLastTimerReset * 1000 / m_speedTimer.ElapsedTime(); m_maxObservedSpeed = STDMAX(m_currentSpeed, m_maxObservedSpeed * 0.98f); m_byteCountSinceLastTimerReset = 0; m_speedTimer.StartTimer(); // OutputDebugString(("max speed: " + IntToString((int)m_maxObservedSpeed) + " current speed: " + IntToString((int)m_currentSpeed) + "\n").c_str()); } return m_currentSpeed; } float NetworkSink::GetMaxObservedSpeed() const { lword m = GetMaxBytesPerSecond(); return m ? STDMIN(m_maxObservedSpeed, float(CRYPTOPP_VC6_INT64 m)) : m_maxObservedSpeed; } unsigned int NetworkSink::GetMaxWaitObjectCount() const { return LimitedBandwidth::GetMaxWaitObjectCount() + GetSender().GetMaxWaitObjectCount(); } void NetworkSink::GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack) { if (BlockedBySpeedLimit()) LimitedBandwidth::GetWaitObjects(container, CallStack("NetworkSink::GetWaitObjects() - speed limit", &callStack)); else if (m_wasBlocked) AccessSender().GetWaitObjects(container, CallStack("NetworkSink::GetWaitObjects() - was blocked", &callStack)); else if (!m_buffer.IsEmpty()) AccessSender().GetWaitObjects(container, CallStack("NetworkSink::GetWaitObjects() - buffer not empty", &callStack)); else if (EofPending()) AccessSender().GetWaitObjects(container, CallStack("NetworkSink::GetWaitObjects() - EOF pending", &callStack)); } size_t NetworkSink::Put2(const byte *inString, size_t length, int messageEnd, bool blocking) { if (m_eofState == EOF_DONE) { if (length || messageEnd) throw Exception(Exception::OTHER_ERROR, "NetworkSink::Put2() being called after EOF had been sent"); return 0; } if (m_eofState > EOF_NONE) goto EofSite; { if (m_skipBytes) { assert(length >= m_skipBytes); inString += m_skipBytes; length -= m_skipBytes; } m_buffer.Put(inString, length); if (!blocking || m_buffer.CurrentSize() > m_autoFlushBound) TimedFlush(0, 0); size_t targetSize = messageEnd ? 0 : m_maxBufferSize; if (blocking) TimedFlush(INFINITE_TIME, targetSize); if (m_buffer.CurrentSize() > targetSize) { assert(!blocking); m_wasBlocked = true; m_skipBytes += length; size_t blockedBytes = UnsignedMin(length, m_buffer.CurrentSize() - targetSize); return STDMAX(blockedBytes, 1); } m_wasBlocked = false; m_skipBytes = 0; } if (messageEnd) { m_eofState = EOF_PENDING_SEND; EofSite: TimedFlush(blocking ? INFINITE_TIME : 0, 0); if (m_eofState != EOF_DONE) return 1; } return 0; } lword NetworkSink::DoFlush(unsigned long maxTime, size_t targetSize) { NetworkSender &sender = AccessSender(); bool forever = maxTime == INFINITE_TIME; Timer timer(Timer::MILLISECONDS, forever); unsigned int totalFlushSize = 0; while (true) { if (m_buffer.CurrentSize() <= targetSize) break; if (m_needSendResult) { if (sender.MustWaitForResult() && !sender.Wait(SaturatingSubtract(maxTime, timer.ElapsedTime()), CallStack("NetworkSink::DoFlush() - wait send result", 0))) break; unsigned int sendResult = sender.GetSendResult(); #if CRYPTOPP_TRACE_NETWORK OutputDebugString((IntToString((unsigned int)this) + ": Sent " + IntToString(sendResult) + " bytes\n").c_str()); #endif m_buffer.Skip(sendResult); totalFlushSize += sendResult; m_needSendResult = false; if (!m_buffer.AnyRetrievable()) break; } unsigned long timeOut = maxTime ? SaturatingSubtract(maxTime, timer.ElapsedTime()) : 0; if (sender.MustWaitToSend() && !sender.Wait(timeOut, CallStack("NetworkSink::DoFlush() - wait send", 0))) break; size_t contiguousSize = 0; const byte *block = m_buffer.Spy(contiguousSize); #if CRYPTOPP_TRACE_NETWORK OutputDebugString((IntToString((unsigned int)this) + ": Sending " + IntToString(contiguousSize) + " bytes\n").c_str()); #endif sender.Send(block, contiguousSize); m_needSendResult = true; if (maxTime > 0 && timeOut == 0) break; // once time limit is reached, return even if there is more data waiting } m_byteCountSinceLastTimerReset += totalFlushSize; ComputeCurrentSpeed(); if (m_buffer.IsEmpty() && !m_needSendResult) { if (m_eofState == EOF_PENDING_SEND) { sender.SendEof(); m_eofState = sender.MustWaitForEof() ? EOF_PENDING_DELIVERY : EOF_DONE; } while (m_eofState == EOF_PENDING_DELIVERY) { unsigned long timeOut = maxTime ? SaturatingSubtract(maxTime, timer.ElapsedTime()) : 0; if (!sender.Wait(timeOut, CallStack("NetworkSink::DoFlush() - wait EOF", 0))) break; if (sender.EofSent()) m_eofState = EOF_DONE; } } return totalFlushSize; } #endif // #ifdef HIGHRES_TIMER_AVAILABLE NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/vmac.h0000755000000000000000000000516612414772654016705 0ustar rootroot#ifndef CRYPTOPP_VMAC_H #define CRYPTOPP_VMAC_H #include "iterhash.h" #include "seckey.h" NAMESPACE_BEGIN(CryptoPP) /// . class VMAC_Base : public IteratedHashBase { public: std::string AlgorithmName() const {return std::string("VMAC(") + GetCipher().AlgorithmName() + ")-" + IntToString(DigestSize()*8);} unsigned int IVSize() const {return GetCipher().BlockSize();} unsigned int MinIVLength() const {return 1;} void Resynchronize(const byte *nonce, int length=-1); void GetNextIV(RandomNumberGenerator &rng, byte *IV); unsigned int DigestSize() const {return m_is128 ? 16 : 8;}; void UncheckedSetKey(const byte *userKey, unsigned int keylength, const NameValuePairs ¶ms); void TruncatedFinal(byte *mac, size_t size); unsigned int BlockSize() const {return m_L1KeyLength;} ByteOrder GetByteOrder() const {return LITTLE_ENDIAN_ORDER;} protected: virtual BlockCipher & AccessCipher() =0; virtual int DefaultDigestSize() const =0; const BlockCipher & GetCipher() const {return const_cast(this)->AccessCipher();} void HashEndianCorrectedBlock(const word64 *data); size_t HashMultipleBlocks(const word64 *input, size_t length); void Init() {} word64* StateBuf() {return NULL;} word64* DataBuf() {return (word64 *)m_data();} void VHASH_Update_SSE2(const word64 *data, size_t blocksRemainingInWord64, int tagPart); #if !(defined(_MSC_VER) && _MSC_VER < 1300) // can't use function template here with VC6 template #endif void VHASH_Update_Template(const word64 *data, size_t blockRemainingInWord128); void VHASH_Update(const word64 *data, size_t blocksRemainingInWord128); CRYPTOPP_BLOCK_1(polyState, word64, 4*(m_is128+1)) CRYPTOPP_BLOCK_2(nhKey, word64, m_L1KeyLength/sizeof(word64) + 2*m_is128) CRYPTOPP_BLOCK_3(data, byte, m_L1KeyLength) CRYPTOPP_BLOCK_4(l3Key, word64, 2*(m_is128+1)) CRYPTOPP_BLOCK_5(nonce, byte, IVSize()) CRYPTOPP_BLOCK_6(pad, byte, IVSize()) CRYPTOPP_BLOCKS_END(6) bool m_is128, m_padCached, m_isFirstBlock; int m_L1KeyLength; }; /// VMAC template class VMAC : public SimpleKeyingInterfaceImpl > { public: static std::string StaticAlgorithmName() {return std::string("VMAC(") + T_BlockCipher::StaticAlgorithmName() + ")-" + IntToString(T_DigestBitSize);} private: BlockCipher & AccessCipher() {return m_cipher;} int DefaultDigestSize() const {return T_DigestBitSize/8;} typename T_BlockCipher::Encryption m_cipher; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/algebra.cpp0000755000000000000000000002156712414772654017712 0ustar rootroot// algebra.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_ALGEBRA_CPP // SunCC workaround: compiler could cause this file to be included twice #define CRYPTOPP_ALGEBRA_CPP #include "algebra.h" #include "integer.h" #include NAMESPACE_BEGIN(CryptoPP) template const T& AbstractGroup::Double(const Element &a) const { return Add(a, a); } template const T& AbstractGroup::Subtract(const Element &a, const Element &b) const { // make copy of a in case Inverse() overwrites it Element a1(a); return Add(a1, Inverse(b)); } template T& AbstractGroup::Accumulate(Element &a, const Element &b) const { return a = Add(a, b); } template T& AbstractGroup::Reduce(Element &a, const Element &b) const { return a = Subtract(a, b); } template const T& AbstractRing::Square(const Element &a) const { return Multiply(a, a); } template const T& AbstractRing::Divide(const Element &a, const Element &b) const { // make copy of a in case MultiplicativeInverse() overwrites it Element a1(a); return Multiply(a1, MultiplicativeInverse(b)); } template const T& AbstractEuclideanDomain::Mod(const Element &a, const Element &b) const { Element q; DivisionAlgorithm(result, q, a, b); return result; } template const T& AbstractEuclideanDomain::Gcd(const Element &a, const Element &b) const { Element g[3]={b, a}; unsigned int i0=0, i1=1, i2=2; while (!this->Equal(g[i1], this->Identity())) { g[i2] = Mod(g[i0], g[i1]); unsigned int t = i0; i0 = i1; i1 = i2; i2 = t; } return result = g[i0]; } template const typename QuotientRing::Element& QuotientRing::MultiplicativeInverse(const Element &a) const { Element g[3]={m_modulus, a}; Element v[3]={m_domain.Identity(), m_domain.MultiplicativeIdentity()}; Element y; unsigned int i0=0, i1=1, i2=2; while (!Equal(g[i1], Identity())) { // y = g[i0] / g[i1]; // g[i2] = g[i0] % g[i1]; m_domain.DivisionAlgorithm(g[i2], y, g[i0], g[i1]); // v[i2] = v[i0] - (v[i1] * y); v[i2] = m_domain.Subtract(v[i0], m_domain.Multiply(v[i1], y)); unsigned int t = i0; i0 = i1; i1 = i2; i2 = t; } return m_domain.IsUnit(g[i0]) ? m_domain.Divide(v[i0], g[i0]) : m_domain.Identity(); } template T AbstractGroup::ScalarMultiply(const Element &base, const Integer &exponent) const { Element result; SimultaneousMultiply(&result, base, &exponent, 1); return result; } template T AbstractGroup::CascadeScalarMultiply(const Element &x, const Integer &e1, const Element &y, const Integer &e2) const { const unsigned expLen = STDMAX(e1.BitCount(), e2.BitCount()); if (expLen==0) return Identity(); const unsigned w = (expLen <= 46 ? 1 : (expLen <= 260 ? 2 : 3)); const unsigned tableSize = 1< powerTable(tableSize << w); powerTable[1] = x; powerTable[tableSize] = y; if (w==1) powerTable[3] = Add(x,y); else { powerTable[2] = Double(x); powerTable[2*tableSize] = Double(y); unsigned i, j; for (i=3; i=0; i--) { power1 = 2*power1 + e1.GetBit(i); power2 = 2*power2 + e2.GetBit(i); if (i==0 || 2*power1 >= tableSize || 2*power2 >= tableSize) { unsigned squaresBefore = prevPosition-i; unsigned squaresAfter = 0; prevPosition = i; while ((power1 || power2) && power1%2 == 0 && power2%2==0) { power1 /= 2; power2 /= 2; squaresBefore--; squaresAfter++; } if (firstTime) { result = powerTable[(power2< Element GeneralCascadeMultiplication(const AbstractGroup &group, Iterator begin, Iterator end) { if (end-begin == 1) return group.ScalarMultiply(begin->base, begin->exponent); else if (end-begin == 2) return group.CascadeScalarMultiply(begin->base, begin->exponent, (begin+1)->base, (begin+1)->exponent); else { Integer q, t; Iterator last = end; --last; std::make_heap(begin, end); std::pop_heap(begin, end); while (!!begin->exponent) { // last->exponent is largest exponent, begin->exponent is next largest t = last->exponent; Integer::Divide(last->exponent, q, t, begin->exponent); if (q == Integer::One()) group.Accumulate(begin->base, last->base); // avoid overhead of ScalarMultiply() else group.Accumulate(begin->base, group.ScalarMultiply(last->base, q)); std::push_heap(begin, end); std::pop_heap(begin, end); } return group.ScalarMultiply(last->base, last->exponent); } } struct WindowSlider { WindowSlider(const Integer &expIn, bool fastNegate, unsigned int windowSizeIn=0) : exp(expIn), windowModulus(Integer::One()), windowSize(windowSizeIn), windowBegin(0), fastNegate(fastNegate), firstTime(true), finished(false) { if (windowSize == 0) { unsigned int expLen = exp.BitCount(); windowSize = expLen <= 17 ? 1 : (expLen <= 24 ? 2 : (expLen <= 70 ? 3 : (expLen <= 197 ? 4 : (expLen <= 539 ? 5 : (expLen <= 1434 ? 6 : 7))))); } windowModulus <<= windowSize; } void FindNextWindow() { unsigned int expLen = exp.WordCount() * WORD_BITS; unsigned int skipCount = firstTime ? 0 : windowSize; firstTime = false; while (!exp.GetBit(skipCount)) { if (skipCount >= expLen) { finished = true; return; } skipCount++; } exp >>= skipCount; windowBegin += skipCount; expWindow = word32(exp % (word(1) << windowSize)); if (fastNegate && exp.GetBit(windowSize)) { negateNext = true; expWindow = (word32(1) << windowSize) - expWindow; exp += windowModulus; } else negateNext = false; } Integer exp, windowModulus; unsigned int windowSize, windowBegin; word32 expWindow; bool fastNegate, negateNext, firstTime, finished; }; template void AbstractGroup::SimultaneousMultiply(T *results, const T &base, const Integer *expBegin, unsigned int expCount) const { std::vector > buckets(expCount); std::vector exponents; exponents.reserve(expCount); unsigned int i; for (i=0; iNotNegative()); exponents.push_back(WindowSlider(*expBegin++, InversionIsFast(), 0)); exponents[i].FindNextWindow(); buckets[i].resize(1<<(exponents[i].windowSize-1), Identity()); } unsigned int expBitPosition = 0; Element g = base; bool notDone = true; while (notDone) { notDone = false; for (i=0; i 1) { for (int j = (int)buckets[i].size()-2; j >= 1; j--) { Accumulate(buckets[i][j], buckets[i][j+1]); Accumulate(r, buckets[i][j]); } Accumulate(buckets[i][0], buckets[i][1]); r = Add(Double(r), buckets[i][0]); } } } template T AbstractRing::Exponentiate(const Element &base, const Integer &exponent) const { Element result; SimultaneousExponentiate(&result, base, &exponent, 1); return result; } template T AbstractRing::CascadeExponentiate(const Element &x, const Integer &e1, const Element &y, const Integer &e2) const { return MultiplicativeGroup().AbstractGroup::CascadeScalarMultiply(x, e1, y, e2); } template Element GeneralCascadeExponentiation(const AbstractRing &ring, Iterator begin, Iterator end) { return GeneralCascadeMultiplication(ring.MultiplicativeGroup(), begin, end); } template void AbstractRing::SimultaneousExponentiate(T *results, const T &base, const Integer *exponents, unsigned int expCount) const { MultiplicativeGroup().AbstractGroup::SimultaneousMultiply(results, base, exponents, expCount); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/pkcspad.cpp0000755000000000000000000001033412414772654017730 0ustar rootroot// pkcspad.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_PKCSPAD_CPP // SunCC workaround: compiler could cause this file to be included twice #define CRYPTOPP_PKCSPAD_CPP #include "pkcspad.h" #include NAMESPACE_BEGIN(CryptoPP) // more in dll.cpp template<> const byte PKCS_DigestDecoration::decoration[] = {0x30,0x20,0x30,0x0c,0x06,0x08,0x2a,0x86,0x48,0x86,0xf7,0x0d,0x02,0x02,0x05,0x00,0x04,0x10}; template<> const unsigned int PKCS_DigestDecoration::length = sizeof(PKCS_DigestDecoration::decoration); template<> const byte PKCS_DigestDecoration::decoration[] = {0x30,0x20,0x30,0x0c,0x06,0x08,0x2a,0x86,0x48,0x86,0xf7,0x0d,0x02,0x05,0x05,0x00,0x04,0x10}; template<> const unsigned int PKCS_DigestDecoration::length = sizeof(PKCS_DigestDecoration::decoration); template<> const byte PKCS_DigestDecoration::decoration[] = {0x30,0x21,0x30,0x09,0x06,0x05,0x2b,0x24,0x03,0x02,0x01,0x05,0x00,0x04,0x14}; template<> const unsigned int PKCS_DigestDecoration::length = sizeof(PKCS_DigestDecoration::decoration); template<> const byte PKCS_DigestDecoration::decoration[] = {0x30,0x29,0x30,0x0D,0x06,0x09,0x2B,0x06,0x01,0x04,0x01,0xDA,0x47,0x0C,0x02,0x05,0x00,0x04,0x18}; template<> const unsigned int PKCS_DigestDecoration::length = sizeof(PKCS_DigestDecoration::decoration); size_t PKCS_EncryptionPaddingScheme::MaxUnpaddedLength(size_t paddedLength) const { return SaturatingSubtract(paddedLength/8, 10U); } void PKCS_EncryptionPaddingScheme::Pad(RandomNumberGenerator &rng, const byte *input, size_t inputLen, byte *pkcsBlock, size_t pkcsBlockLen, const NameValuePairs ¶meters) const { assert (inputLen <= MaxUnpaddedLength(pkcsBlockLen)); // this should be checked by caller // convert from bit length to byte length if (pkcsBlockLen % 8 != 0) { pkcsBlock[0] = 0; pkcsBlock++; } pkcsBlockLen /= 8; pkcsBlock[0] = 2; // block type 2 // pad with non-zero random bytes for (unsigned i = 1; i < pkcsBlockLen-inputLen-1; i++) pkcsBlock[i] = (byte)rng.GenerateWord32(1, 0xff); pkcsBlock[pkcsBlockLen-inputLen-1] = 0; // separator memcpy(pkcsBlock+pkcsBlockLen-inputLen, input, inputLen); } DecodingResult PKCS_EncryptionPaddingScheme::Unpad(const byte *pkcsBlock, size_t pkcsBlockLen, byte *output, const NameValuePairs ¶meters) const { bool invalid = false; size_t maxOutputLen = MaxUnpaddedLength(pkcsBlockLen); // convert from bit length to byte length if (pkcsBlockLen % 8 != 0) { invalid = (pkcsBlock[0] != 0) || invalid; pkcsBlock++; } pkcsBlockLen /= 8; // Require block type 2. invalid = (pkcsBlock[0] != 2) || invalid; // skip past the padding until we find the separator size_t i=1; while (i maxOutputLen) || invalid; if (invalid) return DecodingResult(); memcpy (output, pkcsBlock+i, outputLen); return DecodingResult(outputLen); } // ******************************************************** #ifndef CRYPTOPP_IMPORTS void PKCS1v15_SignatureMessageEncodingMethod::ComputeMessageRepresentative(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const { assert(representativeBitLength >= MinRepresentativeBitLength(hashIdentifier.second, hash.DigestSize())); size_t pkcsBlockLen = representativeBitLength; // convert from bit length to byte length if (pkcsBlockLen % 8 != 0) { representative[0] = 0; representative++; } pkcsBlockLen /= 8; representative[0] = 1; // block type 1 unsigned int digestSize = hash.DigestSize(); byte *pPadding = representative + 1; byte *pDigest = representative + pkcsBlockLen - digestSize; byte *pHashId = pDigest - hashIdentifier.second; byte *pSeparator = pHashId - 1; // pad with 0xff memset(pPadding, 0xff, pSeparator-pPadding); *pSeparator = 0; memcpy(pHashId, hashIdentifier.first, hashIdentifier.second); hash.Final(pDigest); } #endif NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/x64dll.asm0000755000000000000000000013042512414772654017422 0ustar rootrootinclude ksamd64.inc EXTERNDEF ?Te@rdtable@CryptoPP@@3PA_KA:FAR EXTERNDEF ?g_cacheLineSize@CryptoPP@@3IA:FAR EXTERNDEF ?SHA256_K@CryptoPP@@3QBIB:FAR .CODE ALIGN 8 Baseline_Add PROC lea rdx, [rdx+8*rcx] lea r8, [r8+8*rcx] lea r9, [r9+8*rcx] neg rcx ; rcx is negative index jz $1@Baseline_Add mov rax,[r8+8*rcx] add rax,[r9+8*rcx] mov [rdx+8*rcx],rax $0@Baseline_Add: mov rax,[r8+8*rcx+8] adc rax,[r9+8*rcx+8] mov [rdx+8*rcx+8],rax lea rcx,[rcx+2] ; advance index, avoid inc which causes slowdown on Intel Core 2 jrcxz $1@Baseline_Add ; loop until rcx overflows and becomes zero mov rax,[r8+8*rcx] adc rax,[r9+8*rcx] mov [rdx+8*rcx],rax jmp $0@Baseline_Add $1@Baseline_Add: mov rax, 0 adc rax, rax ; store carry into rax (return result register) ret Baseline_Add ENDP ALIGN 8 Baseline_Sub PROC lea rdx, [rdx+8*rcx] lea r8, [r8+8*rcx] lea r9, [r9+8*rcx] neg rcx ; rcx is negative index jz $1@Baseline_Sub mov rax,[r8+8*rcx] sub rax,[r9+8*rcx] mov [rdx+8*rcx],rax $0@Baseline_Sub: mov rax,[r8+8*rcx+8] sbb rax,[r9+8*rcx+8] mov [rdx+8*rcx+8],rax lea rcx,[rcx+2] ; advance index, avoid inc which causes slowdown on Intel Core 2 jrcxz $1@Baseline_Sub ; loop until rcx overflows and becomes zero mov rax,[r8+8*rcx] sbb rax,[r9+8*rcx] mov [rdx+8*rcx],rax jmp $0@Baseline_Sub $1@Baseline_Sub: mov rax, 0 adc rax, rax ; store carry into rax (return result register) ret Baseline_Sub ENDP ALIGN 8 Rijndael_Enc_AdvancedProcessBlocks PROC FRAME rex_push_reg rsi push_reg rdi push_reg rbx push_reg r12 .endprolog mov r8, rcx mov r11, ?Te@rdtable@CryptoPP@@3PA_KA mov edi, DWORD PTR [?g_cacheLineSize@CryptoPP@@3IA] mov rsi, [(r8+16*19)] mov rax, 16 and rax, rsi movdqa xmm3, XMMWORD PTR [rdx+16+rax] movdqa [(r8+16*12)], xmm3 lea rax, [rdx+rax+2*16] sub rax, rsi label0: movdqa xmm0, [rax+rsi] movdqa XMMWORD PTR [(r8+0)+rsi], xmm0 add rsi, 16 cmp rsi, 16*12 jl label0 movdqa xmm4, [rax+rsi] movdqa xmm1, [rdx] mov r12d, [rdx+4*4] mov ebx, [rdx+5*4] mov ecx, [rdx+6*4] mov edx, [rdx+7*4] xor rax, rax label9: mov esi, [r11+rax] add rax, rdi mov esi, [r11+rax] add rax, rdi mov esi, [r11+rax] add rax, rdi mov esi, [r11+rax] add rax, rdi cmp rax, 2048 jl label9 lfence test DWORD PTR [(r8+16*18+8)], 1 jz label8 mov rsi, [(r8+16*14)] movdqu xmm2, [rsi] pxor xmm2, xmm1 psrldq xmm1, 14 movd eax, xmm1 mov al, BYTE PTR [rsi+15] mov r10d, eax movd eax, xmm2 psrldq xmm2, 4 movd edi, xmm2 psrldq xmm2, 4 movzx esi, al xor r12d, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, ah xor edx, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] shr eax, 16 movzx esi, al xor ecx, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] movzx esi, ah xor ebx, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] mov eax, edi movd edi, xmm2 psrldq xmm2, 4 movzx esi, al xor ebx, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, ah xor r12d, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] shr eax, 16 movzx esi, al xor edx, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] movzx esi, ah xor ecx, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] mov eax, edi movd edi, xmm2 movzx esi, al xor ecx, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, ah xor ebx, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] shr eax, 16 movzx esi, al xor r12d, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] movzx esi, ah xor edx, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] mov eax, edi movzx esi, al xor edx, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, ah xor ecx, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] shr eax, 16 movzx esi, al xor ebx, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] psrldq xmm2, 3 mov eax, [(r8+16*12)+0*4] mov edi, [(r8+16*12)+2*4] mov r9d, [(r8+16*12)+3*4] movzx esi, cl xor r9d, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] movzx esi, bl xor edi, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] movzx esi, bh xor r9d, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] shr ebx, 16 movzx esi, bl xor eax, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] movzx esi, bh mov ebx, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] xor ebx, [(r8+16*12)+1*4] movzx esi, ch xor eax, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] shr ecx, 16 movzx esi, dl xor eax, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] movzx esi, dh xor ebx, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] shr edx, 16 movzx esi, ch xor edi, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, cl xor ebx, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] movzx esi, dl xor edi, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] movzx esi, dh xor r9d, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movd ecx, xmm2 mov edx, r12d mov [(r8+0)+3*4], r9d mov [(r8+0)+0*4], eax mov [(r8+0)+1*4], ebx mov [(r8+0)+2*4], edi jmp label5 label3: mov r12d, [(r8+16*12)+0*4] mov ebx, [(r8+16*12)+1*4] mov ecx, [(r8+16*12)+2*4] mov edx, [(r8+16*12)+3*4] label8: mov rax, [(r8+16*14)] movdqu xmm2, [rax] mov rsi, [(r8+16*14)+8] movdqu xmm5, [rsi] pxor xmm2, xmm1 pxor xmm2, xmm5 movd eax, xmm2 psrldq xmm2, 4 movd edi, xmm2 psrldq xmm2, 4 movzx esi, al xor r12d, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, ah xor edx, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] shr eax, 16 movzx esi, al xor ecx, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] movzx esi, ah xor ebx, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] mov eax, edi movd edi, xmm2 psrldq xmm2, 4 movzx esi, al xor ebx, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, ah xor r12d, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] shr eax, 16 movzx esi, al xor edx, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] movzx esi, ah xor ecx, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] mov eax, edi movd edi, xmm2 movzx esi, al xor ecx, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, ah xor ebx, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] shr eax, 16 movzx esi, al xor r12d, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] movzx esi, ah xor edx, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] mov eax, edi movzx esi, al xor edx, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, ah xor ecx, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] shr eax, 16 movzx esi, al xor ebx, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] movzx esi, ah xor r12d, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] mov eax, r12d add r8, [(r8+16*19)] add r8, 4*16 jmp label2 label1: mov ecx, r10d mov edx, r12d mov eax, [(r8+0)+0*4] mov ebx, [(r8+0)+1*4] xor cl, ch and rcx, 255 label5: add r10d, 1 xor edx, DWORD PTR [r11+rcx*8+3] movzx esi, dl xor ebx, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] movzx esi, dh mov ecx, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] shr edx, 16 xor ecx, [(r8+0)+2*4] movzx esi, dh xor eax, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, dl mov edx, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] xor edx, [(r8+0)+3*4] add r8, [(r8+16*19)] add r8, 3*16 jmp label4 label2: mov r9d, [(r8+0)-4*16+3*4] mov edi, [(r8+0)-4*16+2*4] movzx esi, cl xor r9d, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] mov cl, al movzx esi, ah xor edi, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] shr eax, 16 movzx esi, bl xor edi, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] movzx esi, bh xor r9d, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] shr ebx, 16 movzx esi, al xor r9d, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] movzx esi, ah mov eax, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, bl xor eax, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] movzx esi, bh mov ebx, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, ch xor eax, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] movzx esi, cl xor ebx, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] shr ecx, 16 movzx esi, dl xor eax, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] movzx esi, dh xor ebx, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] shr edx, 16 movzx esi, ch xor edi, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, cl xor ebx, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] movzx esi, dl xor edi, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] movzx esi, dh xor r9d, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] mov ecx, edi xor eax, [(r8+0)-4*16+0*4] xor ebx, [(r8+0)-4*16+1*4] mov edx, r9d label4: mov r9d, [(r8+0)-4*16+7*4] mov edi, [(r8+0)-4*16+6*4] movzx esi, cl xor r9d, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] mov cl, al movzx esi, ah xor edi, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] shr eax, 16 movzx esi, bl xor edi, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] movzx esi, bh xor r9d, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] shr ebx, 16 movzx esi, al xor r9d, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] movzx esi, ah mov eax, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, bl xor eax, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] movzx esi, bh mov ebx, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, ch xor eax, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] movzx esi, cl xor ebx, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] shr ecx, 16 movzx esi, dl xor eax, DWORD PTR [r11+8*rsi+(((3+3) MOD (4))+1)] movzx esi, dh xor ebx, DWORD PTR [r11+8*rsi+(((2+3) MOD (4))+1)] shr edx, 16 movzx esi, ch xor edi, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] movzx esi, cl xor ebx, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] movzx esi, dl xor edi, DWORD PTR [r11+8*rsi+(((1+3) MOD (4))+1)] movzx esi, dh xor r9d, DWORD PTR [r11+8*rsi+(((0+3) MOD (4))+1)] mov ecx, edi xor eax, [(r8+0)-4*16+4*4] xor ebx, [(r8+0)-4*16+5*4] mov edx, r9d add r8, 32 test r8, 255 jnz label2 sub r8, 16*16 movzx esi, ch movzx edi, BYTE PTR [r11+rsi*8+1] movzx esi, dl xor edi, DWORD PTR [r11+rsi*8+0] mov WORD PTR [(r8+16*13)+2], di movzx esi, dh movzx edi, BYTE PTR [r11+rsi*8+1] movzx esi, al xor edi, DWORD PTR [r11+rsi*8+0] mov WORD PTR [(r8+16*13)+6], di shr edx, 16 movzx esi, ah movzx edi, BYTE PTR [r11+rsi*8+1] movzx esi, bl xor edi, DWORD PTR [r11+rsi*8+0] mov WORD PTR [(r8+16*13)+10], di shr eax, 16 movzx esi, bh movzx edi, BYTE PTR [r11+rsi*8+1] movzx esi, cl xor edi, DWORD PTR [r11+rsi*8+0] mov WORD PTR [(r8+16*13)+14], di shr ebx, 16 movzx esi, dh movzx edi, BYTE PTR [r11+rsi*8+1] movzx esi, al xor edi, DWORD PTR [r11+rsi*8+0] mov WORD PTR [(r8+16*13)+12], di shr ecx, 16 movzx esi, ah movzx edi, BYTE PTR [r11+rsi*8+1] movzx esi, bl xor edi, DWORD PTR [r11+rsi*8+0] mov WORD PTR [(r8+16*13)+0], di movzx esi, bh movzx edi, BYTE PTR [r11+rsi*8+1] movzx esi, cl xor edi, DWORD PTR [r11+rsi*8+0] mov WORD PTR [(r8+16*13)+4], di movzx esi, ch movzx edi, BYTE PTR [r11+rsi*8+1] movzx esi, dl xor edi, DWORD PTR [r11+rsi*8+0] mov WORD PTR [(r8+16*13)+8], di mov rax, [(r8+16*14)+16] mov rbx, [(r8+16*14)+24] mov rcx, [(r8+16*18+8)] sub rcx, 16 movdqu xmm2, [rax] pxor xmm2, xmm4 movdqa xmm0, [(r8+16*16)+16] paddq xmm0, [(r8+16*14)+16] movdqa [(r8+16*14)+16], xmm0 pxor xmm2, [(r8+16*13)] movdqu [rbx], xmm2 jle label7 mov [(r8+16*18+8)], rcx test rcx, 1 jnz label1 movdqa xmm0, [(r8+16*16)] paddq xmm0, [(r8+16*14)] movdqa [(r8+16*14)], xmm0 jmp label3 label7: xorps xmm0, xmm0 lea rax, [(r8+0)+7*16] movaps [rax-7*16], xmm0 movaps [rax-6*16], xmm0 movaps [rax-5*16], xmm0 movaps [rax-4*16], xmm0 movaps [rax-3*16], xmm0 movaps [rax-2*16], xmm0 movaps [rax-1*16], xmm0 movaps [rax+0*16], xmm0 movaps [rax+1*16], xmm0 movaps [rax+2*16], xmm0 movaps [rax+3*16], xmm0 movaps [rax+4*16], xmm0 movaps [rax+5*16], xmm0 movaps [rax+6*16], xmm0 pop r12 pop rbx pop rdi pop rsi ret Rijndael_Enc_AdvancedProcessBlocks ENDP ALIGN 8 GCM_AuthenticateBlocks_2K PROC FRAME rex_push_reg rsi push_reg rdi push_reg rbx .endprolog mov rsi, r8 mov r11, r9 movdqa xmm0, [rsi] label0: movdqu xmm4, [rcx] pxor xmm0, xmm4 movd ebx, xmm0 mov eax, 0f0f0f0f0h and eax, ebx shl ebx, 4 and ebx, 0f0f0f0f0h movzx edi, ah movdqa xmm5, XMMWORD PTR [rsi + 32 + 1024 + rdi] movzx edi, al movdqa xmm4, XMMWORD PTR [rsi + 32 + 1024 + rdi] shr eax, 16 movzx edi, ah movdqa xmm3, XMMWORD PTR [rsi + 32 + 1024 + rdi] movzx edi, al movdqa xmm2, XMMWORD PTR [rsi + 32 + 1024 + rdi] psrldq xmm0, 4 movd eax, xmm0 and eax, 0f0f0f0f0h movzx edi, bh pxor xmm5, XMMWORD PTR [rsi + 32 + (1-1)*256 + rdi] movzx edi, bl pxor xmm4, XMMWORD PTR [rsi + 32 + (1-1)*256 + rdi] shr ebx, 16 movzx edi, bh pxor xmm3, XMMWORD PTR [rsi + 32 + (1-1)*256 + rdi] movzx edi, bl pxor xmm2, XMMWORD PTR [rsi + 32 + (1-1)*256 + rdi] movd ebx, xmm0 shl ebx, 4 and ebx, 0f0f0f0f0h movzx edi, ah pxor xmm5, XMMWORD PTR [rsi + 32 + 1024 + 1*256 + rdi] movzx edi, al pxor xmm4, XMMWORD PTR [rsi + 32 + 1024 + 1*256 + rdi] shr eax, 16 movzx edi, ah pxor xmm3, XMMWORD PTR [rsi + 32 + 1024 + 1*256 + rdi] movzx edi, al pxor xmm2, XMMWORD PTR [rsi + 32 + 1024 + 1*256 + rdi] psrldq xmm0, 4 movd eax, xmm0 and eax, 0f0f0f0f0h movzx edi, bh pxor xmm5, XMMWORD PTR [rsi + 32 + (2-1)*256 + rdi] movzx edi, bl pxor xmm4, XMMWORD PTR [rsi + 32 + (2-1)*256 + rdi] shr ebx, 16 movzx edi, bh pxor xmm3, XMMWORD PTR [rsi + 32 + (2-1)*256 + rdi] movzx edi, bl pxor xmm2, XMMWORD PTR [rsi + 32 + (2-1)*256 + rdi] movd ebx, xmm0 shl ebx, 4 and ebx, 0f0f0f0f0h movzx edi, ah pxor xmm5, XMMWORD PTR [rsi + 32 + 1024 + 2*256 + rdi] movzx edi, al pxor xmm4, XMMWORD PTR [rsi + 32 + 1024 + 2*256 + rdi] shr eax, 16 movzx edi, ah pxor xmm3, XMMWORD PTR [rsi + 32 + 1024 + 2*256 + rdi] movzx edi, al pxor xmm2, XMMWORD PTR [rsi + 32 + 1024 + 2*256 + rdi] psrldq xmm0, 4 movd eax, xmm0 and eax, 0f0f0f0f0h movzx edi, bh pxor xmm5, XMMWORD PTR [rsi + 32 + (3-1)*256 + rdi] movzx edi, bl pxor xmm4, XMMWORD PTR [rsi + 32 + (3-1)*256 + rdi] shr ebx, 16 movzx edi, bh pxor xmm3, XMMWORD PTR [rsi + 32 + (3-1)*256 + rdi] movzx edi, bl pxor xmm2, XMMWORD PTR [rsi + 32 + (3-1)*256 + rdi] movd ebx, xmm0 shl ebx, 4 and ebx, 0f0f0f0f0h movzx edi, ah pxor xmm5, XMMWORD PTR [rsi + 32 + 1024 + 3*256 + rdi] movzx edi, al pxor xmm4, XMMWORD PTR [rsi + 32 + 1024 + 3*256 + rdi] shr eax, 16 movzx edi, ah pxor xmm3, XMMWORD PTR [rsi + 32 + 1024 + 3*256 + rdi] movzx edi, al pxor xmm2, XMMWORD PTR [rsi + 32 + 1024 + 3*256 + rdi] movzx edi, bh pxor xmm5, XMMWORD PTR [rsi + 32 + 3*256 + rdi] movzx edi, bl pxor xmm4, XMMWORD PTR [rsi + 32 + 3*256 + rdi] shr ebx, 16 movzx edi, bh pxor xmm3, XMMWORD PTR [rsi + 32 + 3*256 + rdi] movzx edi, bl pxor xmm2, XMMWORD PTR [rsi + 32 + 3*256 + rdi] movdqa xmm0, xmm3 pslldq xmm3, 1 pxor xmm2, xmm3 movdqa xmm1, xmm2 pslldq xmm2, 1 pxor xmm5, xmm2 psrldq xmm0, 15 movd rdi, xmm0 movzx eax, WORD PTR [r11 + rdi*2] shl eax, 8 movdqa xmm0, xmm5 pslldq xmm5, 1 pxor xmm4, xmm5 psrldq xmm1, 15 movd rdi, xmm1 xor ax, WORD PTR [r11 + rdi*2] shl eax, 8 psrldq xmm0, 15 movd rdi, xmm0 xor ax, WORD PTR [r11 + rdi*2] movd xmm0, eax pxor xmm0, xmm4 add rcx, 16 sub rdx, 1 jnz label0 movdqa [rsi], xmm0 pop rbx pop rdi pop rsi ret GCM_AuthenticateBlocks_2K ENDP ALIGN 8 GCM_AuthenticateBlocks_64K PROC FRAME rex_push_reg rsi push_reg rdi .endprolog mov rsi, r8 movdqa xmm0, [rsi] label1: movdqu xmm1, [rcx] pxor xmm1, xmm0 pxor xmm0, xmm0 movd eax, xmm1 psrldq xmm1, 4 movzx edi, al add rdi, rdi pxor xmm0, [rsi + 32 + (0*4+0)*256*16 + rdi*8] movzx edi, ah add rdi, rdi pxor xmm0, [rsi + 32 + (0*4+1)*256*16 + rdi*8] shr eax, 16 movzx edi, al add rdi, rdi pxor xmm0, [rsi + 32 + (0*4+2)*256*16 + rdi*8] movzx edi, ah add rdi, rdi pxor xmm0, [rsi + 32 + (0*4+3)*256*16 + rdi*8] movd eax, xmm1 psrldq xmm1, 4 movzx edi, al add rdi, rdi pxor xmm0, [rsi + 32 + (1*4+0)*256*16 + rdi*8] movzx edi, ah add rdi, rdi pxor xmm0, [rsi + 32 + (1*4+1)*256*16 + rdi*8] shr eax, 16 movzx edi, al add rdi, rdi pxor xmm0, [rsi + 32 + (1*4+2)*256*16 + rdi*8] movzx edi, ah add rdi, rdi pxor xmm0, [rsi + 32 + (1*4+3)*256*16 + rdi*8] movd eax, xmm1 psrldq xmm1, 4 movzx edi, al add rdi, rdi pxor xmm0, [rsi + 32 + (2*4+0)*256*16 + rdi*8] movzx edi, ah add rdi, rdi pxor xmm0, [rsi + 32 + (2*4+1)*256*16 + rdi*8] shr eax, 16 movzx edi, al add rdi, rdi pxor xmm0, [rsi + 32 + (2*4+2)*256*16 + rdi*8] movzx edi, ah add rdi, rdi pxor xmm0, [rsi + 32 + (2*4+3)*256*16 + rdi*8] movd eax, xmm1 psrldq xmm1, 4 movzx edi, al add rdi, rdi pxor xmm0, [rsi + 32 + (3*4+0)*256*16 + rdi*8] movzx edi, ah add rdi, rdi pxor xmm0, [rsi + 32 + (3*4+1)*256*16 + rdi*8] shr eax, 16 movzx edi, al add rdi, rdi pxor xmm0, [rsi + 32 + (3*4+2)*256*16 + rdi*8] movzx edi, ah add rdi, rdi pxor xmm0, [rsi + 32 + (3*4+3)*256*16 + rdi*8] add rcx, 16 sub rdx, 1 jnz label1 movdqa [rsi], xmm0 pop rdi pop rsi ret GCM_AuthenticateBlocks_64K ENDP ALIGN 8 X86_SHA256_HashBlocks PROC FRAME rex_push_reg rsi push_reg rdi push_reg rbx push_reg rbp alloc_stack(8*4 + 16*4 + 4*8 + 8) .endprolog mov rdi, r8 lea rsi, [?SHA256_K@CryptoPP@@3QBIB + 48*4] mov [rsp+8*4+16*4+1*8], rcx mov [rsp+8*4+16*4+2*8], rdx add rdi, rdx mov [rsp+8*4+16*4+3*8], rdi movdqa xmm0, XMMWORD PTR [rcx+0*16] movdqa xmm1, XMMWORD PTR [rcx+1*16] mov [rsp+8*4+16*4+0*8], rsi label0: sub rsi, 48*4 movdqa [rsp+((1024+7-(0+3)) MOD (8))*4], xmm1 movdqa [rsp+((1024+7-(0+7)) MOD (8))*4], xmm0 mov rbx, [rdx+0*8] bswap rbx mov [rsp+8*4+((1024+15-(0*(1+1)+1)) MOD (16))*4], rbx mov rbx, [rdx+1*8] bswap rbx mov [rsp+8*4+((1024+15-(1*(1+1)+1)) MOD (16))*4], rbx mov rbx, [rdx+2*8] bswap rbx mov [rsp+8*4+((1024+15-(2*(1+1)+1)) MOD (16))*4], rbx mov rbx, [rdx+3*8] bswap rbx mov [rsp+8*4+((1024+15-(3*(1+1)+1)) MOD (16))*4], rbx mov rbx, [rdx+4*8] bswap rbx mov [rsp+8*4+((1024+15-(4*(1+1)+1)) MOD (16))*4], rbx mov rbx, [rdx+5*8] bswap rbx mov [rsp+8*4+((1024+15-(5*(1+1)+1)) MOD (16))*4], rbx mov rbx, [rdx+6*8] bswap rbx mov [rsp+8*4+((1024+15-(6*(1+1)+1)) MOD (16))*4], rbx mov rbx, [rdx+7*8] bswap rbx mov [rsp+8*4+((1024+15-(7*(1+1)+1)) MOD (16))*4], rbx mov edi, [rsp+((1024+7-(0+3)) MOD (8))*4] mov eax, [rsp+((1024+7-(0+6)) MOD (8))*4] xor eax, [rsp+((1024+7-(0+5)) MOD (8))*4] mov ecx, [rsp+((1024+7-(0+7)) MOD (8))*4] mov edx, [rsp+((1024+7-(0+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(0+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(0+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 add edx, [rsi+(0)*4] add edx, [rsp+8*4+((1024+15-(0)) MOD (16))*4] add edx, [rsp+((1024+7-(0)) MOD (8))*4] xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(0+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(0+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(0+4)) MOD (8))*4] mov [rsp+((1024+7-(0+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(0)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(1+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(1+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(1+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 add edi, [rsi+(1)*4] add edi, [rsp+8*4+((1024+15-(1)) MOD (16))*4] add edi, [rsp+((1024+7-(1)) MOD (8))*4] xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(1+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(1+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(1+4)) MOD (8))*4] mov [rsp+((1024+7-(1+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(1)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(2+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(2+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(2+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 add edx, [rsi+(2)*4] add edx, [rsp+8*4+((1024+15-(2)) MOD (16))*4] add edx, [rsp+((1024+7-(2)) MOD (8))*4] xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(2+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(2+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(2+4)) MOD (8))*4] mov [rsp+((1024+7-(2+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(2)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(3+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(3+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(3+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 add edi, [rsi+(3)*4] add edi, [rsp+8*4+((1024+15-(3)) MOD (16))*4] add edi, [rsp+((1024+7-(3)) MOD (8))*4] xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(3+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(3+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(3+4)) MOD (8))*4] mov [rsp+((1024+7-(3+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(3)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(4+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(4+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(4+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 add edx, [rsi+(4)*4] add edx, [rsp+8*4+((1024+15-(4)) MOD (16))*4] add edx, [rsp+((1024+7-(4)) MOD (8))*4] xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(4+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(4+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(4+4)) MOD (8))*4] mov [rsp+((1024+7-(4+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(4)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(5+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(5+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(5+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 add edi, [rsi+(5)*4] add edi, [rsp+8*4+((1024+15-(5)) MOD (16))*4] add edi, [rsp+((1024+7-(5)) MOD (8))*4] xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(5+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(5+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(5+4)) MOD (8))*4] mov [rsp+((1024+7-(5+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(5)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(6+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(6+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(6+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 add edx, [rsi+(6)*4] add edx, [rsp+8*4+((1024+15-(6)) MOD (16))*4] add edx, [rsp+((1024+7-(6)) MOD (8))*4] xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(6+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(6+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(6+4)) MOD (8))*4] mov [rsp+((1024+7-(6+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(6)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(7+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(7+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(7+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 add edi, [rsi+(7)*4] add edi, [rsp+8*4+((1024+15-(7)) MOD (16))*4] add edi, [rsp+((1024+7-(7)) MOD (8))*4] xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(7+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(7+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(7+4)) MOD (8))*4] mov [rsp+((1024+7-(7+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(7)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(8+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(8+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(8+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 add edx, [rsi+(8)*4] add edx, [rsp+8*4+((1024+15-(8)) MOD (16))*4] add edx, [rsp+((1024+7-(8)) MOD (8))*4] xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(8+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(8+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(8+4)) MOD (8))*4] mov [rsp+((1024+7-(8+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(8)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(9+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(9+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(9+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 add edi, [rsi+(9)*4] add edi, [rsp+8*4+((1024+15-(9)) MOD (16))*4] add edi, [rsp+((1024+7-(9)) MOD (8))*4] xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(9+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(9+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(9+4)) MOD (8))*4] mov [rsp+((1024+7-(9+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(9)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(10+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(10+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(10+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 add edx, [rsi+(10)*4] add edx, [rsp+8*4+((1024+15-(10)) MOD (16))*4] add edx, [rsp+((1024+7-(10)) MOD (8))*4] xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(10+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(10+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(10+4)) MOD (8))*4] mov [rsp+((1024+7-(10+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(10)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(11+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(11+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(11+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 add edi, [rsi+(11)*4] add edi, [rsp+8*4+((1024+15-(11)) MOD (16))*4] add edi, [rsp+((1024+7-(11)) MOD (8))*4] xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(11+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(11+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(11+4)) MOD (8))*4] mov [rsp+((1024+7-(11+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(11)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(12+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(12+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(12+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 add edx, [rsi+(12)*4] add edx, [rsp+8*4+((1024+15-(12)) MOD (16))*4] add edx, [rsp+((1024+7-(12)) MOD (8))*4] xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(12+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(12+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(12+4)) MOD (8))*4] mov [rsp+((1024+7-(12+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(12)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(13+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(13+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(13+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 add edi, [rsi+(13)*4] add edi, [rsp+8*4+((1024+15-(13)) MOD (16))*4] add edi, [rsp+((1024+7-(13)) MOD (8))*4] xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(13+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(13+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(13+4)) MOD (8))*4] mov [rsp+((1024+7-(13+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(13)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(14+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(14+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(14+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 add edx, [rsi+(14)*4] add edx, [rsp+8*4+((1024+15-(14)) MOD (16))*4] add edx, [rsp+((1024+7-(14)) MOD (8))*4] xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(14+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(14+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(14+4)) MOD (8))*4] mov [rsp+((1024+7-(14+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(14)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(15+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(15+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(15+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 add edi, [rsi+(15)*4] add edi, [rsp+8*4+((1024+15-(15)) MOD (16))*4] add edi, [rsp+((1024+7-(15)) MOD (8))*4] xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(15+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(15+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(15+4)) MOD (8))*4] mov [rsp+((1024+7-(15+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(15)) MOD (8))*4], ecx label1: add rsi, 4*16 mov edx, [rsp+((1024+7-(0+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(0+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(0+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebp, [rsp+8*4+((1024+15-((0)-2)) MOD (16))*4] mov edi, [rsp+8*4+((1024+15-((0)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((0)-7)) MOD (16))*4] mov ebp, edi shr ebp, 3 ror edi, 7 add ebx, [rsp+8*4+((1024+15-(0)) MOD (16))*4] xor ebp, edi add edx, [rsi+(0)*4] ror edi, 11 add edx, [rsp+((1024+7-(0)) MOD (8))*4] xor ebp, edi add ebp, ebx mov [rsp+8*4+((1024+15-(0)) MOD (16))*4], ebp add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(0+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(0+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(0+4)) MOD (8))*4] mov [rsp+((1024+7-(0+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(0)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(1+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(1+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(1+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebp, [rsp+8*4+((1024+15-((1)-2)) MOD (16))*4] mov edx, [rsp+8*4+((1024+15-((1)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((1)-7)) MOD (16))*4] mov ebp, edx shr ebp, 3 ror edx, 7 add ebx, [rsp+8*4+((1024+15-(1)) MOD (16))*4] xor ebp, edx add edi, [rsi+(1)*4] ror edx, 11 add edi, [rsp+((1024+7-(1)) MOD (8))*4] xor ebp, edx add ebp, ebx mov [rsp+8*4+((1024+15-(1)) MOD (16))*4], ebp add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(1+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(1+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(1+4)) MOD (8))*4] mov [rsp+((1024+7-(1+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(1)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(2+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(2+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(2+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebp, [rsp+8*4+((1024+15-((2)-2)) MOD (16))*4] mov edi, [rsp+8*4+((1024+15-((2)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((2)-7)) MOD (16))*4] mov ebp, edi shr ebp, 3 ror edi, 7 add ebx, [rsp+8*4+((1024+15-(2)) MOD (16))*4] xor ebp, edi add edx, [rsi+(2)*4] ror edi, 11 add edx, [rsp+((1024+7-(2)) MOD (8))*4] xor ebp, edi add ebp, ebx mov [rsp+8*4+((1024+15-(2)) MOD (16))*4], ebp add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(2+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(2+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(2+4)) MOD (8))*4] mov [rsp+((1024+7-(2+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(2)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(3+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(3+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(3+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebp, [rsp+8*4+((1024+15-((3)-2)) MOD (16))*4] mov edx, [rsp+8*4+((1024+15-((3)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((3)-7)) MOD (16))*4] mov ebp, edx shr ebp, 3 ror edx, 7 add ebx, [rsp+8*4+((1024+15-(3)) MOD (16))*4] xor ebp, edx add edi, [rsi+(3)*4] ror edx, 11 add edi, [rsp+((1024+7-(3)) MOD (8))*4] xor ebp, edx add ebp, ebx mov [rsp+8*4+((1024+15-(3)) MOD (16))*4], ebp add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(3+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(3+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(3+4)) MOD (8))*4] mov [rsp+((1024+7-(3+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(3)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(4+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(4+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(4+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebp, [rsp+8*4+((1024+15-((4)-2)) MOD (16))*4] mov edi, [rsp+8*4+((1024+15-((4)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((4)-7)) MOD (16))*4] mov ebp, edi shr ebp, 3 ror edi, 7 add ebx, [rsp+8*4+((1024+15-(4)) MOD (16))*4] xor ebp, edi add edx, [rsi+(4)*4] ror edi, 11 add edx, [rsp+((1024+7-(4)) MOD (8))*4] xor ebp, edi add ebp, ebx mov [rsp+8*4+((1024+15-(4)) MOD (16))*4], ebp add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(4+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(4+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(4+4)) MOD (8))*4] mov [rsp+((1024+7-(4+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(4)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(5+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(5+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(5+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebp, [rsp+8*4+((1024+15-((5)-2)) MOD (16))*4] mov edx, [rsp+8*4+((1024+15-((5)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((5)-7)) MOD (16))*4] mov ebp, edx shr ebp, 3 ror edx, 7 add ebx, [rsp+8*4+((1024+15-(5)) MOD (16))*4] xor ebp, edx add edi, [rsi+(5)*4] ror edx, 11 add edi, [rsp+((1024+7-(5)) MOD (8))*4] xor ebp, edx add ebp, ebx mov [rsp+8*4+((1024+15-(5)) MOD (16))*4], ebp add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(5+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(5+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(5+4)) MOD (8))*4] mov [rsp+((1024+7-(5+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(5)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(6+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(6+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(6+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebp, [rsp+8*4+((1024+15-((6)-2)) MOD (16))*4] mov edi, [rsp+8*4+((1024+15-((6)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((6)-7)) MOD (16))*4] mov ebp, edi shr ebp, 3 ror edi, 7 add ebx, [rsp+8*4+((1024+15-(6)) MOD (16))*4] xor ebp, edi add edx, [rsi+(6)*4] ror edi, 11 add edx, [rsp+((1024+7-(6)) MOD (8))*4] xor ebp, edi add ebp, ebx mov [rsp+8*4+((1024+15-(6)) MOD (16))*4], ebp add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(6+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(6+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(6+4)) MOD (8))*4] mov [rsp+((1024+7-(6+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(6)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(7+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(7+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(7+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebp, [rsp+8*4+((1024+15-((7)-2)) MOD (16))*4] mov edx, [rsp+8*4+((1024+15-((7)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((7)-7)) MOD (16))*4] mov ebp, edx shr ebp, 3 ror edx, 7 add ebx, [rsp+8*4+((1024+15-(7)) MOD (16))*4] xor ebp, edx add edi, [rsi+(7)*4] ror edx, 11 add edi, [rsp+((1024+7-(7)) MOD (8))*4] xor ebp, edx add ebp, ebx mov [rsp+8*4+((1024+15-(7)) MOD (16))*4], ebp add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(7+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(7+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(7+4)) MOD (8))*4] mov [rsp+((1024+7-(7+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(7)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(8+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(8+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(8+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebp, [rsp+8*4+((1024+15-((8)-2)) MOD (16))*4] mov edi, [rsp+8*4+((1024+15-((8)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((8)-7)) MOD (16))*4] mov ebp, edi shr ebp, 3 ror edi, 7 add ebx, [rsp+8*4+((1024+15-(8)) MOD (16))*4] xor ebp, edi add edx, [rsi+(8)*4] ror edi, 11 add edx, [rsp+((1024+7-(8)) MOD (8))*4] xor ebp, edi add ebp, ebx mov [rsp+8*4+((1024+15-(8)) MOD (16))*4], ebp add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(8+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(8+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(8+4)) MOD (8))*4] mov [rsp+((1024+7-(8+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(8)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(9+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(9+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(9+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebp, [rsp+8*4+((1024+15-((9)-2)) MOD (16))*4] mov edx, [rsp+8*4+((1024+15-((9)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((9)-7)) MOD (16))*4] mov ebp, edx shr ebp, 3 ror edx, 7 add ebx, [rsp+8*4+((1024+15-(9)) MOD (16))*4] xor ebp, edx add edi, [rsi+(9)*4] ror edx, 11 add edi, [rsp+((1024+7-(9)) MOD (8))*4] xor ebp, edx add ebp, ebx mov [rsp+8*4+((1024+15-(9)) MOD (16))*4], ebp add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(9+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(9+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(9+4)) MOD (8))*4] mov [rsp+((1024+7-(9+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(9)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(10+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(10+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(10+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebp, [rsp+8*4+((1024+15-((10)-2)) MOD (16))*4] mov edi, [rsp+8*4+((1024+15-((10)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((10)-7)) MOD (16))*4] mov ebp, edi shr ebp, 3 ror edi, 7 add ebx, [rsp+8*4+((1024+15-(10)) MOD (16))*4] xor ebp, edi add edx, [rsi+(10)*4] ror edi, 11 add edx, [rsp+((1024+7-(10)) MOD (8))*4] xor ebp, edi add ebp, ebx mov [rsp+8*4+((1024+15-(10)) MOD (16))*4], ebp add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(10+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(10+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(10+4)) MOD (8))*4] mov [rsp+((1024+7-(10+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(10)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(11+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(11+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(11+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebp, [rsp+8*4+((1024+15-((11)-2)) MOD (16))*4] mov edx, [rsp+8*4+((1024+15-((11)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((11)-7)) MOD (16))*4] mov ebp, edx shr ebp, 3 ror edx, 7 add ebx, [rsp+8*4+((1024+15-(11)) MOD (16))*4] xor ebp, edx add edi, [rsi+(11)*4] ror edx, 11 add edi, [rsp+((1024+7-(11)) MOD (8))*4] xor ebp, edx add ebp, ebx mov [rsp+8*4+((1024+15-(11)) MOD (16))*4], ebp add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(11+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(11+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(11+4)) MOD (8))*4] mov [rsp+((1024+7-(11+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(11)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(12+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(12+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(12+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebp, [rsp+8*4+((1024+15-((12)-2)) MOD (16))*4] mov edi, [rsp+8*4+((1024+15-((12)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((12)-7)) MOD (16))*4] mov ebp, edi shr ebp, 3 ror edi, 7 add ebx, [rsp+8*4+((1024+15-(12)) MOD (16))*4] xor ebp, edi add edx, [rsi+(12)*4] ror edi, 11 add edx, [rsp+((1024+7-(12)) MOD (8))*4] xor ebp, edi add ebp, ebx mov [rsp+8*4+((1024+15-(12)) MOD (16))*4], ebp add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(12+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(12+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(12+4)) MOD (8))*4] mov [rsp+((1024+7-(12+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(12)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(13+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(13+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(13+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebp, [rsp+8*4+((1024+15-((13)-2)) MOD (16))*4] mov edx, [rsp+8*4+((1024+15-((13)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((13)-7)) MOD (16))*4] mov ebp, edx shr ebp, 3 ror edx, 7 add ebx, [rsp+8*4+((1024+15-(13)) MOD (16))*4] xor ebp, edx add edi, [rsi+(13)*4] ror edx, 11 add edi, [rsp+((1024+7-(13)) MOD (8))*4] xor ebp, edx add ebp, ebx mov [rsp+8*4+((1024+15-(13)) MOD (16))*4], ebp add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(13+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(13+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(13+4)) MOD (8))*4] mov [rsp+((1024+7-(13+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(13)) MOD (8))*4], ecx mov edx, [rsp+((1024+7-(14+2)) MOD (8))*4] xor edx, [rsp+((1024+7-(14+1)) MOD (8))*4] and edx, edi xor edx, [rsp+((1024+7-(14+1)) MOD (8))*4] mov ebp, edi ror edi, 6 ror ebp, 25 xor ebp, edi ror edi, 5 xor ebp, edi add edx, ebp mov ebp, [rsp+8*4+((1024+15-((14)-2)) MOD (16))*4] mov edi, [rsp+8*4+((1024+15-((14)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((14)-7)) MOD (16))*4] mov ebp, edi shr ebp, 3 ror edi, 7 add ebx, [rsp+8*4+((1024+15-(14)) MOD (16))*4] xor ebp, edi add edx, [rsi+(14)*4] ror edi, 11 add edx, [rsp+((1024+7-(14)) MOD (8))*4] xor ebp, edi add ebp, ebx mov [rsp+8*4+((1024+15-(14)) MOD (16))*4], ebp add edx, ebp mov ebx, ecx xor ecx, [rsp+((1024+7-(14+6)) MOD (8))*4] and eax, ecx xor eax, [rsp+((1024+7-(14+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add eax, edx add edx, [rsp+((1024+7-(14+4)) MOD (8))*4] mov [rsp+((1024+7-(14+4)) MOD (8))*4], edx ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add eax, ebp mov [rsp+((1024+7-(14)) MOD (8))*4], eax mov edi, [rsp+((1024+7-(15+2)) MOD (8))*4] xor edi, [rsp+((1024+7-(15+1)) MOD (8))*4] and edi, edx xor edi, [rsp+((1024+7-(15+1)) MOD (8))*4] mov ebp, edx ror edx, 6 ror ebp, 25 xor ebp, edx ror edx, 5 xor ebp, edx add edi, ebp mov ebp, [rsp+8*4+((1024+15-((15)-2)) MOD (16))*4] mov edx, [rsp+8*4+((1024+15-((15)-15)) MOD (16))*4] mov ebx, ebp shr ebp, 10 ror ebx, 17 xor ebp, ebx ror ebx, 2 xor ebx, ebp add ebx, [rsp+8*4+((1024+15-((15)-7)) MOD (16))*4] mov ebp, edx shr ebp, 3 ror edx, 7 add ebx, [rsp+8*4+((1024+15-(15)) MOD (16))*4] xor ebp, edx add edi, [rsi+(15)*4] ror edx, 11 add edi, [rsp+((1024+7-(15)) MOD (8))*4] xor ebp, edx add ebp, ebx mov [rsp+8*4+((1024+15-(15)) MOD (16))*4], ebp add edi, ebp mov ebx, eax xor eax, [rsp+((1024+7-(15+6)) MOD (8))*4] and ecx, eax xor ecx, [rsp+((1024+7-(15+6)) MOD (8))*4] mov ebp, ebx ror ebx, 2 add ecx, edi add edi, [rsp+((1024+7-(15+4)) MOD (8))*4] mov [rsp+((1024+7-(15+4)) MOD (8))*4], edi ror ebp, 22 xor ebp, ebx ror ebx, 11 xor ebp, ebx add ecx, ebp mov [rsp+((1024+7-(15)) MOD (8))*4], ecx cmp rsi, [rsp+8*4+16*4+0*8] jne label1 mov rcx, [rsp+8*4+16*4+1*8] movdqa xmm1, XMMWORD PTR [rcx+1*16] movdqa xmm0, XMMWORD PTR [rcx+0*16] paddd xmm1, [rsp+((1024+7-(0+3)) MOD (8))*4] paddd xmm0, [rsp+((1024+7-(0+7)) MOD (8))*4] movdqa [rcx+1*16], xmm1 movdqa [rcx+0*16], xmm0 mov rdx, [rsp+8*4+16*4+2*8] add rdx, 64 mov [rsp+8*4+16*4+2*8], rdx cmp rdx, [rsp+8*4+16*4+3*8] jne label0 add rsp, 8*4 + 16*4 + 4*8 + 8 pop rbp pop rbx pop rdi pop rsi ret X86_SHA256_HashBlocks ENDP _TEXT ENDS END armory-0.92.3/cppForSwig/cryptopp/shark.cpp0000755000000000000000000001025412414772654017414 0ustar rootroot// shark.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "shark.h" #include "misc.h" #include "modes.h" #include "gf256.h" NAMESPACE_BEGIN(CryptoPP) static word64 SHARKTransform(word64 a) { static const byte iG[8][8] = { 0xe7, 0x30, 0x90, 0x85, 0xd0, 0x4b, 0x91, 0x41, 0x53, 0x95, 0x9b, 0xa5, 0x96, 0xbc, 0xa1, 0x68, 0x02, 0x45, 0xf7, 0x65, 0x5c, 0x1f, 0xb6, 0x52, 0xa2, 0xca, 0x22, 0x94, 0x44, 0x63, 0x2a, 0xa2, 0xfc, 0x67, 0x8e, 0x10, 0x29, 0x75, 0x85, 0x71, 0x24, 0x45, 0xa2, 0xcf, 0x2f, 0x22, 0xc1, 0x0e, 0xa1, 0xf1, 0x71, 0x40, 0x91, 0x27, 0x18, 0xa5, 0x56, 0xf4, 0xaf, 0x32, 0xd2, 0xa4, 0xdc, 0x71, }; word64 result=0; GF256 gf256(0xf5); for (unsigned int i=0; i<8; i++) for(unsigned int j=0; j<8; j++) result ^= word64(gf256.Multiply(iG[i][j], GF256::Element(a>>(56-8*j)))) << (56-8*i); return result; } void SHARK::Base::UncheckedSetKey(const byte *key, unsigned int keyLen, const NameValuePairs ¶ms) { AssertValidKeyLength(keyLen); m_rounds = GetRoundsAndThrowIfInvalid(params, this); m_roundKeys.New(m_rounds+1); // concatenate key enought times to fill a for (unsigned int i=0; i<(m_rounds+1)*8; i++) ((byte *)m_roundKeys.begin())[i] = key[i%keyLen]; SHARK::Encryption e; e.InitForKeySetup(); byte IV[8] = {0,0,0,0,0,0,0,0}; CFB_Mode_ExternalCipher::Encryption cfb(e, IV); cfb.ProcessString((byte *)m_roundKeys.begin(), (m_rounds+1)*8); ConditionalByteReverse(BIG_ENDIAN_ORDER, m_roundKeys.begin(), m_roundKeys.begin(), (m_rounds+1)*8); m_roundKeys[m_rounds] = SHARKTransform(m_roundKeys[m_rounds]); if (!IsForwardTransformation()) { unsigned int i; // transform encryption round keys into decryption round keys for (i=0; i struct SharkProcessAndXorBlock{ // VC60 workaround: problem with template functions inline SharkProcessAndXorBlock(const word64 *roundKeys, unsigned int rounds, const byte *inBlock, const byte *xorBlock, byte *outBlock) { word64 tmp = *(word64 *)inBlock ^ roundKeys[0]; ByteOrder order = GetNativeByteOrder(); tmp = cbox[0][GetByte(order, tmp, 0)] ^ cbox[1][GetByte(order, tmp, 1)] ^ cbox[2][GetByte(order, tmp, 2)] ^ cbox[3][GetByte(order, tmp, 3)] ^ cbox[4][GetByte(order, tmp, 4)] ^ cbox[5][GetByte(order, tmp, 5)] ^ cbox[6][GetByte(order, tmp, 6)] ^ cbox[7][GetByte(order, tmp, 7)] ^ roundKeys[1]; for(unsigned int i=2; i(xorBlock, outBlock) (sbox[GETBYTE(tmp, 7)]) (sbox[GETBYTE(tmp, 6)]) (sbox[GETBYTE(tmp, 5)]) (sbox[GETBYTE(tmp, 4)]) (sbox[GETBYTE(tmp, 3)]) (sbox[GETBYTE(tmp, 2)]) (sbox[GETBYTE(tmp, 1)]) (sbox[GETBYTE(tmp, 0)]); *(word64 *)outBlock ^= roundKeys[rounds]; }}; void SHARK::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { SharkProcessAndXorBlock(m_roundKeys, m_rounds, inBlock, xorBlock, outBlock); } void SHARK::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { SharkProcessAndXorBlock(m_roundKeys, m_rounds, inBlock, xorBlock, outBlock); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/dh.cpp0000755000000000000000000000036112414772654016675 0ustar rootroot// dh.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "dh.h" NAMESPACE_BEGIN(CryptoPP) void DH_TestInstantiations() { DH dh1; DH dh2(NullRNG(), 10); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/gf2_32.cpp0000755000000000000000000000321312414772654017263 0ustar rootroot// gf2_32.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "misc.h" #include "gf2_32.h" NAMESPACE_BEGIN(CryptoPP) GF2_32::Element GF2_32::Multiply(Element a, Element b) const { word32 table[4]; table[0] = 0; table[1] = m_modulus; if (a & 0x80000000) { table[2] = m_modulus ^ (a<<1); table[3] = a<<1; } else { table[2] = a<<1; table[3] = m_modulus ^ (a<<1); } #if CRYPTOPP_FAST_ROTATE(32) b = rotrFixed(b, 30U); word32 result = table[b&2]; for (int i=29; i>=0; --i) { b = rotlFixed(b, 1U); result = (result<<1) ^ table[(b&2) + (result>>31)]; } return (b&1) ? result ^ a : result; #else word32 result = table[(b>>30) & 2]; for (int i=29; i>=0; --i) result = (result<<1) ^ table[((b>>i)&2) + (result>>31)]; return (b&1) ? result ^ a : result; #endif } GF2_32::Element GF2_32::MultiplicativeInverse(Element a) const { if (a <= 1) // 1 is a special case return a; // warning - don't try to adapt this algorithm for another situation word32 g0=m_modulus, g1=a, g2=a; word32 v0=0, v1=1, v2=1; assert(g1); while (!(g2 & 0x80000000)) { g2 <<= 1; v2 <<= 1; } g2 <<= 1; v2 <<= 1; g0 ^= g2; v0 ^= v2; while (g0 != 1) { if (g1 < g0 || ((g0^g1) < g0 && (g0^g1) < g1)) { assert(BitPrecision(g1) <= BitPrecision(g0)); g2 = g1; v2 = v1; } else { assert(BitPrecision(g1) > BitPrecision(g0)); g2 = g0; g0 = g1; g1 = g2; v2 = v0; v0 = v1; v1 = v2; } while ((g0^g2) >= g2) { assert(BitPrecision(g0) > BitPrecision(g2)); g2 <<= 1; v2 <<= 1; } assert(BitPrecision(g0) == BitPrecision(g2)); g0 ^= g2; v0 ^= v2; } return v0; } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/arc4.cpp0000755000000000000000000000420412414772654017133 0ustar rootroot// arc4.cpp - written and placed in the public domain by Wei Dai // The ARC4 algorithm was first revealed in an anonymous email to the // cypherpunks mailing list. This file originally contained some // code copied from this email. The code has since been rewritten in order // to clarify the copyright status of this file. It should now be // completely in the public domain. #include "pch.h" #define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1 #include "arc4.h" NAMESPACE_BEGIN(CryptoPP) namespace Weak1 { void ARC4_TestInstantiations() { ARC4 x; } ARC4_Base::~ARC4_Base() { m_x = m_y = 0; } void ARC4_Base::UncheckedSetKey(const byte *key, unsigned int keyLen, const NameValuePairs ¶ms) { AssertValidKeyLength(keyLen); m_x = 1; m_y = 0; unsigned int i; for (i=0; i<256; i++) m_state[i] = i; unsigned int keyIndex = 0, stateIndex = 0; for (i=0; i<256; i++) { unsigned int a = m_state[i]; stateIndex += key[keyIndex] + a; stateIndex &= 0xff; m_state[i] = m_state[stateIndex]; m_state[stateIndex] = a; if (++keyIndex >= keyLen) keyIndex = 0; } int discardBytes = params.GetIntValueWithDefault("DiscardBytes", GetDefaultDiscardBytes()); DiscardBytes(discardBytes); } template static inline unsigned int MakeByte(T &x, T &y, byte *s) { unsigned int a = s[x]; y = (y+a) & 0xff; unsigned int b = s[y]; s[x] = b; s[y] = a; x = (x+1) & 0xff; return s[(a+b) & 0xff]; } void ARC4_Base::GenerateBlock(byte *output, size_t size) { while (size--) *output++ = MakeByte(m_x, m_y, m_state); } void ARC4_Base::ProcessData(byte *outString, const byte *inString, size_t length) { if (length == 0) return; byte *const s = m_state; unsigned int x = m_x; unsigned int y = m_y; if (inString == outString) { do { *outString++ ^= MakeByte(x, y, s); } while (--length); } else { do { *outString++ = *inString++ ^ MakeByte(x, y, s); } while(--length); } m_x = x; m_y = y; } void ARC4_Base::DiscardBytes(size_t length) { if (length == 0) return; byte *const s = m_state; unsigned int x = m_x; unsigned int y = m_y; do { MakeByte(x, y, s); } while(--length); m_x = x; m_y = y; } } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/mqueue.cpp0000755000000000000000000001006512414772654017605 0ustar rootroot// mqueue.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "mqueue.h" NAMESPACE_BEGIN(CryptoPP) MessageQueue::MessageQueue(unsigned int nodeSize) : m_queue(nodeSize), m_lengths(1, 0U), m_messageCounts(1, 0U) { } size_t MessageQueue::CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end, const std::string &channel, bool blocking) const { if (begin >= MaxRetrievable()) return 0; return m_queue.CopyRangeTo2(target, begin, STDMIN(MaxRetrievable(), end), channel, blocking); } size_t MessageQueue::TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel, bool blocking) { transferBytes = STDMIN(MaxRetrievable(), transferBytes); size_t blockedBytes = m_queue.TransferTo2(target, transferBytes, channel, blocking); m_lengths.front() -= transferBytes; return blockedBytes; } bool MessageQueue::GetNextMessage() { if (NumberOfMessages() > 0 && !AnyRetrievable()) { m_lengths.pop_front(); if (m_messageCounts[0] == 0 && m_messageCounts.size() > 1) m_messageCounts.pop_front(); return true; } else return false; } unsigned int MessageQueue::CopyMessagesTo(BufferedTransformation &target, unsigned int count, const std::string &channel) const { ByteQueue::Walker walker(m_queue); std::deque::const_iterator it = m_lengths.begin(); unsigned int i; for (i=0; i 0 && q2.AnyRetrievable()) { size_t len = length; const byte *data = q2.Spy(len); len = STDMIN(len, length); if (memcmp(inString, data, len) != 0) goto mismatch; inString += len; length -= len; q2.Skip(len); } q1.Put(inString, length); if (messageEnd) { if (q2.AnyRetrievable()) goto mismatch; else if (q2.AnyMessages()) q2.GetNextMessage(); else if (q2.NumberOfMessageSeries() > 0) goto mismatch; else q1.MessageEnd(); } return 0; mismatch: return HandleMismatchDetected(blocking); } } bool EqualityComparisonFilter::ChannelMessageSeriesEnd(const std::string &channel, int propagation, bool blocking) { unsigned int i = MapChannel(channel); if (i == 2) { OutputMessageSeriesEnd(4, propagation, blocking, channel); return false; } else if (m_mismatchDetected) return false; else { MessageQueue &q1 = m_q[i], &q2 = m_q[1-i]; if (q2.AnyRetrievable() || q2.AnyMessages()) goto mismatch; else if (q2.NumberOfMessageSeries() > 0) return Output(2, (const byte *)"\1", 1, 0, blocking) != 0; else q1.MessageSeriesEnd(); return false; mismatch: return HandleMismatchDetected(blocking); } } bool EqualityComparisonFilter::HandleMismatchDetected(bool blocking) { m_mismatchDetected = true; if (m_throwIfNotEqual) throw MismatchDetected(); return Output(1, (const byte *)"\0", 1, 0, blocking) != 0; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/rw.cpp0000755000000000000000000001177012414772654016740 0ustar rootroot// rw.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "rw.h" #include "nbtheory.h" #include "asn.h" #ifndef CRYPTOPP_IMPORTS NAMESPACE_BEGIN(CryptoPP) void RWFunction::BERDecode(BufferedTransformation &bt) { BERSequenceDecoder seq(bt); m_n.BERDecode(seq); seq.MessageEnd(); } void RWFunction::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); m_n.DEREncode(seq); seq.MessageEnd(); } Integer RWFunction::ApplyFunction(const Integer &in) const { DoQuickSanityCheck(); Integer out = in.Squared()%m_n; const word r = 12; // this code was written to handle both r = 6 and r = 12, // but now only r = 12 is used in P1363 const word r2 = r/2; const word r3a = (16 + 5 - r) % 16; // n%16 could be 5 or 13 const word r3b = (16 + 13 - r) % 16; const word r4 = (8 + 5 - r/2) % 8; // n%8 == 5 switch (out % 16) { case r: break; case r2: case r2+8: out <<= 1; break; case r3a: case r3b: out.Negate(); out += m_n; break; case r4: case r4+8: out.Negate(); out += m_n; out <<= 1; break; default: out = Integer::Zero(); } return out; } bool RWFunction::Validate(RandomNumberGenerator &rng, unsigned int level) const { bool pass = true; pass = pass && m_n > Integer::One() && m_n%8 == 5; return pass; } bool RWFunction::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue).Assignable() CRYPTOPP_GET_FUNCTION_ENTRY(Modulus) ; } void RWFunction::AssignFrom(const NameValuePairs &source) { AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY(Modulus) ; } // ***************************************************************************** // private key operations: // generate a random private key void InvertibleRWFunction::GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg) { int modulusSize = 2048; alg.GetIntValue("ModulusSize", modulusSize) || alg.GetIntValue("KeySize", modulusSize); if (modulusSize < 16) throw InvalidArgument("InvertibleRWFunction: specified modulus length is too small"); AlgorithmParameters primeParam = MakeParametersForTwoPrimesOfEqualSize(modulusSize); m_p.GenerateRandom(rng, CombinedNameValuePairs(primeParam, MakeParameters("EquivalentTo", 3)("Mod", 8))); m_q.GenerateRandom(rng, CombinedNameValuePairs(primeParam, MakeParameters("EquivalentTo", 7)("Mod", 8))); m_n = m_p * m_q; m_u = m_q.InverseMod(m_p); } void InvertibleRWFunction::BERDecode(BufferedTransformation &bt) { BERSequenceDecoder seq(bt); m_n.BERDecode(seq); m_p.BERDecode(seq); m_q.BERDecode(seq); m_u.BERDecode(seq); seq.MessageEnd(); } void InvertibleRWFunction::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); m_n.DEREncode(seq); m_p.DEREncode(seq); m_q.DEREncode(seq); m_u.DEREncode(seq); seq.MessageEnd(); } Integer InvertibleRWFunction::CalculateInverse(RandomNumberGenerator &rng, const Integer &x) const { DoQuickSanityCheck(); ModularArithmetic modn(m_n); Integer r, rInv; do { // do this in a loop for people using small numbers for testing r.Randomize(rng, Integer::One(), m_n - Integer::One()); rInv = modn.MultiplicativeInverse(r); } while (rInv.IsZero()); Integer re = modn.Square(r); re = modn.Multiply(re, x); // blind Integer cp=re%m_p, cq=re%m_q; if (Jacobi(cp, m_p) * Jacobi(cq, m_q) != 1) { cp = cp.IsOdd() ? (cp+m_p) >> 1 : cp >> 1; cq = cq.IsOdd() ? (cq+m_q) >> 1 : cq >> 1; } #pragma omp parallel #pragma omp sections { #pragma omp section cp = ModularSquareRoot(cp, m_p); #pragma omp section cq = ModularSquareRoot(cq, m_q); } Integer y = CRT(cq, m_q, cp, m_p, m_u); y = modn.Multiply(y, rInv); // unblind y = STDMIN(y, m_n-y); if (ApplyFunction(y) != x) // check throw Exception(Exception::OTHER_ERROR, "InvertibleRWFunction: computational error during private key operation"); return y; } bool InvertibleRWFunction::Validate(RandomNumberGenerator &rng, unsigned int level) const { bool pass = RWFunction::Validate(rng, level); pass = pass && m_p > Integer::One() && m_p%8 == 3 && m_p < m_n; pass = pass && m_q > Integer::One() && m_q%8 == 7 && m_q < m_n; pass = pass && m_u.IsPositive() && m_u < m_p; if (level >= 1) { pass = pass && m_p * m_q == m_n; pass = pass && m_u * m_q % m_p == 1; } if (level >= 2) pass = pass && VerifyPrime(rng, m_p, level-2) && VerifyPrime(rng, m_q, level-2); return pass; } bool InvertibleRWFunction::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue).Assignable() CRYPTOPP_GET_FUNCTION_ENTRY(Prime1) CRYPTOPP_GET_FUNCTION_ENTRY(Prime2) CRYPTOPP_GET_FUNCTION_ENTRY(MultiplicativeInverseOfPrime2ModPrime1) ; } void InvertibleRWFunction::AssignFrom(const NameValuePairs &source) { AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY(Prime1) CRYPTOPP_SET_FUNCTION_ENTRY(Prime2) CRYPTOPP_SET_FUNCTION_ENTRY(MultiplicativeInverseOfPrime2ModPrime1) ; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/serpent.cpp0000755000000000000000000000545012414772654017766 0ustar rootroot// serpent.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "serpent.h" #include "misc.h" #include "serpentp.h" NAMESPACE_BEGIN(CryptoPP) void Serpent_KeySchedule(word32 *k, unsigned int rounds, const byte *userKey, size_t keylen) { FixedSizeSecBlock k0; GetUserKey(LITTLE_ENDIAN_ORDER, k0.begin(), 8, userKey, keylen); if (keylen < 32) k0[keylen/4] |= word32(1) << ((keylen%4)*8); word32 t = k0[7]; unsigned int i; for (i = 0; i < 8; ++i) k[i] = k0[i] = t = rotlFixed(k0[i] ^ k0[(i+3)%8] ^ k0[(i+5)%8] ^ t ^ 0x9e3779b9 ^ i, 11); for (i = 8; i < 4*(rounds+1); ++i) k[i] = t = rotlFixed(k[i-8] ^ k[i-5] ^ k[i-3] ^ t ^ 0x9e3779b9 ^ i, 11); k -= 20; word32 a,b,c,d,e; for (i=0; i Block; void Serpent::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 a, b, c, d, e; Block::Get(inBlock)(a)(b)(c)(d); const word32 *k = m_key; unsigned int i=1; do { beforeS0(KX); beforeS0(S0); afterS0(LT); afterS0(KX); afterS0(S1); afterS1(LT); afterS1(KX); afterS1(S2); afterS2(LT); afterS2(KX); afterS2(S3); afterS3(LT); afterS3(KX); afterS3(S4); afterS4(LT); afterS4(KX); afterS4(S5); afterS5(LT); afterS5(KX); afterS5(S6); afterS6(LT); afterS6(KX); afterS6(S7); if (i == 4) break; ++i; c = b; b = e; e = d; d = a; a = e; k += 32; beforeS0(LT); } while (true); afterS7(KX); Block::Put(xorBlock, outBlock)(d)(e)(b)(a); } void Serpent::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 a, b, c, d, e; Block::Get(inBlock)(a)(b)(c)(d); const word32 *k = m_key + 96; unsigned int i=4; beforeI7(KX); goto start; do { c = b; b = d; d = e; k -= 32; beforeI7(ILT); start: beforeI7(I7); afterI7(KX); afterI7(ILT); afterI7(I6); afterI6(KX); afterI6(ILT); afterI6(I5); afterI5(KX); afterI5(ILT); afterI5(I4); afterI4(KX); afterI4(ILT); afterI4(I3); afterI3(KX); afterI3(ILT); afterI3(I2); afterI2(KX); afterI2(ILT); afterI2(I1); afterI1(KX); afterI1(ILT); afterI1(I0); afterI0(KX); } while (--i != 0); Block::Put(xorBlock, outBlock)(a)(d)(b)(e); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/modarith.h0000755000000000000000000001232112414772654017555 0ustar rootroot#ifndef CRYPTOPP_MODARITH_H #define CRYPTOPP_MODARITH_H // implementations are in integer.cpp #include "cryptlib.h" #include "misc.h" #include "integer.h" #include "algebra.h" NAMESPACE_BEGIN(CryptoPP) CRYPTOPP_DLL_TEMPLATE_CLASS AbstractGroup; CRYPTOPP_DLL_TEMPLATE_CLASS AbstractRing; CRYPTOPP_DLL_TEMPLATE_CLASS AbstractEuclideanDomain; //! ring of congruence classes modulo n /*! \note this implementation represents each congruence class as the smallest non-negative integer in that class */ class CRYPTOPP_DLL ModularArithmetic : public AbstractRing { public: typedef int RandomizationParameter; typedef Integer Element; ModularArithmetic(const Integer &modulus = Integer::One()) : m_modulus(modulus), m_result((word)0, modulus.reg.size()) {} ModularArithmetic(const ModularArithmetic &ma) : m_modulus(ma.m_modulus), m_result((word)0, m_modulus.reg.size()) {} ModularArithmetic(BufferedTransformation &bt); // construct from BER encoded parameters virtual ModularArithmetic * Clone() const {return new ModularArithmetic(*this);} void DEREncode(BufferedTransformation &bt) const; void DEREncodeElement(BufferedTransformation &out, const Element &a) const; void BERDecodeElement(BufferedTransformation &in, Element &a) const; const Integer& GetModulus() const {return m_modulus;} void SetModulus(const Integer &newModulus) {m_modulus = newModulus; m_result.reg.resize(m_modulus.reg.size());} virtual bool IsMontgomeryRepresentation() const {return false;} virtual Integer ConvertIn(const Integer &a) const {return a%m_modulus;} virtual Integer ConvertOut(const Integer &a) const {return a;} const Integer& Half(const Integer &a) const; bool Equal(const Integer &a, const Integer &b) const {return a==b;} const Integer& Identity() const {return Integer::Zero();} const Integer& Add(const Integer &a, const Integer &b) const; Integer& Accumulate(Integer &a, const Integer &b) const; const Integer& Inverse(const Integer &a) const; const Integer& Subtract(const Integer &a, const Integer &b) const; Integer& Reduce(Integer &a, const Integer &b) const; const Integer& Double(const Integer &a) const {return Add(a, a);} const Integer& MultiplicativeIdentity() const {return Integer::One();} const Integer& Multiply(const Integer &a, const Integer &b) const {return m_result1 = a*b%m_modulus;} const Integer& Square(const Integer &a) const {return m_result1 = a.Squared()%m_modulus;} bool IsUnit(const Integer &a) const {return Integer::Gcd(a, m_modulus).IsUnit();} const Integer& MultiplicativeInverse(const Integer &a) const {return m_result1 = a.InverseMod(m_modulus);} const Integer& Divide(const Integer &a, const Integer &b) const {return Multiply(a, MultiplicativeInverse(b));} Integer CascadeExponentiate(const Integer &x, const Integer &e1, const Integer &y, const Integer &e2) const; void SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const; unsigned int MaxElementBitLength() const {return (m_modulus-1).BitCount();} unsigned int MaxElementByteLength() const {return (m_modulus-1).ByteCount();} Element RandomElement( RandomNumberGenerator &rng , const RandomizationParameter &ignore_for_now = 0 ) const // left RandomizationParameter arg as ref in case RandomizationParameter becomes a more complicated struct { return Element( rng , Integer( (long) 0) , m_modulus - Integer( (long) 1 ) ) ; } bool operator==(const ModularArithmetic &rhs) const {return m_modulus == rhs.m_modulus;} static const RandomizationParameter DefaultRandomizationParameter ; protected: Integer m_modulus; mutable Integer m_result, m_result1; }; // const ModularArithmetic::RandomizationParameter ModularArithmetic::DefaultRandomizationParameter = 0 ; //! do modular arithmetics in Montgomery representation for increased speed /*! \note the Montgomery representation represents each congruence class [a] as a*r%n, where r is a convenient power of 2 */ class CRYPTOPP_DLL MontgomeryRepresentation : public ModularArithmetic { public: MontgomeryRepresentation(const Integer &modulus); // modulus must be odd virtual ModularArithmetic * Clone() const {return new MontgomeryRepresentation(*this);} bool IsMontgomeryRepresentation() const {return true;} Integer ConvertIn(const Integer &a) const {return (a<<(WORD_BITS*m_modulus.reg.size()))%m_modulus;} Integer ConvertOut(const Integer &a) const; const Integer& MultiplicativeIdentity() const {return m_result1 = Integer::Power2(WORD_BITS*m_modulus.reg.size())%m_modulus;} const Integer& Multiply(const Integer &a, const Integer &b) const; const Integer& Square(const Integer &a) const; const Integer& MultiplicativeInverse(const Integer &a) const; Integer CascadeExponentiate(const Integer &x, const Integer &e1, const Integer &y, const Integer &e2) const {return AbstractRing::CascadeExponentiate(x, e1, y, e2);} void SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const {AbstractRing::SimultaneousExponentiate(results, base, exponents, exponentsCount);} private: Integer m_u; mutable IntegerSecBlock m_workspace; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/3way.h0000755000000000000000000000236012414772654016633 0ustar rootroot#ifndef CRYPTOPP_THREEWAY_H #define CRYPTOPP_THREEWAY_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct ThreeWay_Info : public FixedBlockSize<12>, public FixedKeyLength<12>, public VariableRounds<11> { static const char *StaticAlgorithmName() {return "3-Way";} }; /// 3-Way class ThreeWay : public ThreeWay_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms); protected: unsigned int m_rounds; FixedSizeSecBlock m_k; }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef ThreeWay::Encryption ThreeWayEncryption; typedef ThreeWay::Decryption ThreeWayDecryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/sharkbox.cpp0000755000000000000000000034573412414772654020143 0ustar rootroot#include "pch.h" #include "shark.h" NAMESPACE_BEGIN(CryptoPP) const byte SHARK::Enc::sbox[256] = { 177, 206, 195, 149, 90, 173, 231, 2, 77, 68, 251, 145, 12, 135, 161, 80, 203, 103, 84, 221, 70, 143, 225, 78, 240, 253, 252, 235, 249, 196, 26, 110, 94, 245, 204, 141, 28, 86, 67, 254, 7, 97, 248, 117, 89, 255, 3, 34, 138, 209, 19, 238, 136, 0, 14, 52, 21, 128, 148, 227, 237, 181, 83, 35, 75, 71, 23, 167, 144, 53, 171, 216, 184, 223, 79, 87, 154, 146, 219, 27, 60, 200, 153, 4, 142, 224, 215, 125, 133, 187, 64, 44, 58, 69, 241, 66, 101, 32, 65, 24, 114, 37, 147, 112, 54, 5, 242, 11, 163, 121, 236, 8, 39, 49, 50, 182, 124, 176, 10, 115, 91, 123, 183, 129, 210, 13, 106, 38, 158, 88, 156, 131, 116, 179, 172, 48, 122, 105, 119, 15, 174, 33, 222, 208, 46, 151, 16, 164, 152, 168, 212, 104, 45, 98, 41, 109, 22, 73, 118, 199, 232, 193, 150, 55, 229, 202, 244, 233, 99, 18, 194, 166, 20, 188, 211, 40, 175, 47, 230, 36, 82, 198, 160, 9, 189, 140, 207, 93, 17, 95, 1, 197, 159, 61, 162, 155, 201, 59, 190, 81, 25, 31, 63, 92, 178, 239, 74, 205, 191, 186, 111, 100, 217, 243, 62, 180, 170, 220, 213, 6, 192, 126, 246, 102, 108, 132, 113, 56, 185, 29, 127, 157, 72, 139, 42, 218, 165, 51, 130, 57, 214, 120, 134, 250, 228, 43, 169, 30, 137, 96, 107, 234, 85, 76, 247, 226, }; const byte SHARK::Dec::sbox[256] = { 53, 190, 7, 46, 83, 105, 219, 40, 111, 183, 118, 107, 12, 125, 54, 139, 146, 188, 169, 50, 172, 56, 156, 66, 99, 200, 30, 79, 36, 229, 247, 201, 97, 141, 47, 63, 179, 101, 127, 112, 175, 154, 234, 245, 91, 152, 144, 177, 135, 113, 114, 237, 55, 69, 104, 163, 227, 239, 92, 197, 80, 193, 214, 202, 90, 98, 95, 38, 9, 93, 20, 65, 232, 157, 206, 64, 253, 8, 23, 74, 15, 199, 180, 62, 18, 252, 37, 75, 129, 44, 4, 120, 203, 187, 32, 189, 249, 41, 153, 168, 211, 96, 223, 17, 151, 137, 126, 250, 224, 155, 31, 210, 103, 226, 100, 119, 132, 43, 158, 138, 241, 109, 136, 121, 116, 87, 221, 230, 57, 123, 238, 131, 225, 88, 242, 13, 52, 248, 48, 233, 185, 35, 84, 21, 68, 11, 77, 102, 58, 3, 162, 145, 148, 82, 76, 195, 130, 231, 128, 192, 182, 14, 194, 108, 147, 236, 171, 67, 149, 246, 216, 70, 134, 5, 140, 176, 117, 0, 204, 133, 215, 61, 115, 122, 72, 228, 209, 89, 173, 184, 198, 208, 220, 161, 170, 2, 29, 191, 181, 159, 81, 196, 165, 16, 34, 207, 1, 186, 143, 49, 124, 174, 150, 218, 240, 86, 71, 212, 235, 78, 217, 19, 142, 73, 85, 22, 255, 59, 244, 164, 178, 6, 160, 167, 251, 27, 110, 60, 51, 205, 24, 94, 106, 213, 166, 33, 222, 254, 42, 28, 243, 10, 26, 25, 39, 45, }; const word64 SHARK::Enc::cbox[8][256] = { /* box 0 */ W64LIT(0x060d838f16f3a365), W64LIT(0xa68857ee5cae56f6), W64LIT(0xebf516353c2c4d89), W64LIT(0x652174be88e85bdc), W64LIT(0x0d4e9a8086c17921), W64LIT(0x27ba7d33cffa58a1), W64LIT(0x88d9e104a237b530), W64LIT(0x693b8755a4fbe816), W64LIT(0xdac9591826b254a0), W64LIT(0x45c2e369fb336af3), W64LIT(0xa96e1fb87b3e4ef4), W64LIT(0xb7578f1435eb7ef0), W64LIT(0x839af80b32056f74), W64LIT(0xae37f55cc71f277a), W64LIT(0xa4208538fdff37d5), W64LIT(0x35991e74ad3cdb6f), W64LIT(0xba191594b32a07d1), W64LIT(0x5344d1772e572b7b), W64LIT(0xe7efe5de103ffe43), W64LIT(0xa3796fdc41de5e5b), W64LIT(0x2cf9643c5fc882e5), W64LIT(0xffdbf6fd48196d22), W64LIT(0x33949dfbbbcf780a), W64LIT(0x7d15679dd0cec8bd), W64LIT(0x5f5e229c024498b1), W64LIT(0x1223634762c683ce), W64LIT(0xdcc4da973041f7c5), W64LIT(0x0b43190f9032da44), W64LIT(0xc05598eddfc5a6e2), W64LIT(0x9e5fd31a7753f4b8), W64LIT(0x9afa8243c0f136fe), W64LIT(0xcc4f6b06f3d61528), W64LIT(0xdf38612a3bc25c0d), W64LIT(0x43cf60e6edc0c996), W64LIT(0xcfb3d0bbf855bee0), W64LIT(0x96e071a8ece28534), W64LIT(0x21b7febcd909fbc4), W64LIT(0x8ed4628bb4c41655), W64LIT(0x30682646b04cd3c2), W64LIT(0xb5ff5dc294ba1fd3), W64LIT(0x75aac52f4b7fb931), W64LIT(0xe809ad8837afe641), W64LIT(0x0eb2213d8d42d2e9), W64LIT(0x9852509561a057dd), W64LIT(0xaa92a40570bde53c), W64LIT(0x7b18e412c63d6bd8), W64LIT(0xa7dc3e85f67c9c1d), W64LIT(0xd8618bce87e33583), W64LIT(0xe34ab487a79d3c05), W64LIT(0x20e397d773db312f), W64LIT(0x05f138321d7008ad), W64LIT(0x17d25b757fb68b63), W64LIT(0x8a7133d20366d413), W64LIT(0x0000000000000000), W64LIT(0xeaa17f5e96fe8762), W64LIT(0xc101f18675176c09), W64LIT(0xbebc44cd0488c597), W64LIT(0xdb9d30738c609e4b), W64LIT(0xabc6cd6eda6f2fd7), W64LIT(0x5aaf1aae1f34901c), W64LIT(0xb00e65f089ca177e), W64LIT(0xd47b7825abf08649), W64LIT(0x924520f15b404772), W64LIT(0x1686321ed5644188), W64LIT(0x618425e73f4a999a), W64LIT(0xe21eddec0d4ff6ee), W64LIT(0xd787c398a0732d81), W64LIT(0x1f6df9c7e407faef), W64LIT(0x79b036c4676c0afb), W64LIT(0x0fe6485627901802), W64LIT(0x9cf701ccd602959b), W64LIT(0xbfe82da6ae5a0f7c), W64LIT(0x990639fecb729d36), W64LIT(0xca42e889e525b64d), W64LIT(0xb3f2de4d8249bcb6), W64LIT(0x4033db5be643625e), W64LIT(0x4167b2304c91a8b5), W64LIT(0x108bb191c397e2ed), W64LIT(0x1834132358269361), W64LIT(0x541d3b93927642f5), W64LIT(0x90edf227fa112651), W64LIT(0x1dc52b1145569bcc), W64LIT(0xe6bb8cb5baed34a8), W64LIT(0xd276fbaabd03252c), W64LIT(0x313c4f2d1a9e1929), W64LIT(0xfd73242be9480c01), W64LIT(0x9baeeb286a23fc15), W64LIT(0xc9be5334eea61d85), W64LIT(0xc70c720963e4cf6c), W64LIT(0x3eda077b3d0e012b), W64LIT(0x97b418c346304fdf), W64LIT(0x32c0f490111db2e1), W64LIT(0x2ba08ed8e3e9eb6b), W64LIT(0x8b255ab9a9b41ef8), W64LIT(0x91b99b4c50c3ecba), W64LIT(0xfe8f9f96e2cba7c9), W64LIT(0x3a7f56228aacc36d), W64LIT(0xb15a0c9b2318dd95), W64LIT(0x5953a11314b73bd4), W64LIT(0xf3c10516640adee8), W64LIT(0xedf895ba2adfeeec), W64LIT(0xadcb4ee1cc9c8cb2), W64LIT(0xde6c0841911096e6), W64LIT(0x84c312ef8e2406fa), W64LIT(0xa83a76d3d1ec841f), W64LIT(0x1c91427aef845127), W64LIT(0x3665a5c9a6bf70a7), W64LIT(0xf6303d24797ad645), W64LIT(0xcd1b026d5904dfc3), W64LIT(0x1bc8a89e53a538a9), W64LIT(0x7ee9dc20db4d6375), W64LIT(0x51ec03a18f064a58), W64LIT(0xc4f0c9b4686764a4), W64LIT(0xdd90b3fc9a933d2e), W64LIT(0x7a4c8d796cefa133), W64LIT(0x73a746a05d8c1a54), W64LIT(0x0759eae4bc21698e), W64LIT(0xc8ea3a5f4474d76e), W64LIT(0x38d784f42bfda24e), W64LIT(0x231f2c6a78589ae7), W64LIT(0xc3a92350d4460d2a), W64LIT(0x72f32fcbf75ed0bf), W64LIT(0xbd40ff700f0b6e5f), W64LIT(0x157a89a3dee7ea40), W64LIT(0x873fa95285a7ad32), W64LIT(0x4d7d41db60821b7f), W64LIT(0x1e3990ac4ed53004), W64LIT(0x0a1770643ae010af), W64LIT(0x9311499af1928d99), W64LIT(0x64751dd5223a9137), W64LIT(0xfa2acecf5569658f), W64LIT(0x7c410ef67a1c0256), W64LIT(0x56b5e945332723d6), W64LIT(0x6f3604dab2084b73), W64LIT(0xe95dc4e39d7d2caa), W64LIT(0x13770a2cc8144925), W64LIT(0xbc14961ba5d9a4b4), W64LIT(0xb9e5ae29b8a9ac19), W64LIT(0xf169d7c0c55bbfcb), W64LIT(0x2446c68ec479f369), W64LIT(0x806643b63986c4bc), W64LIT(0x7fbdb54b719fa99e), W64LIT(0x04a55159b7a2c246), W64LIT(0xee042e07215c4524), W64LIT(0x5bfb73c5b5e65af7), W64LIT(0x0c1af3eb2c13b3ca), W64LIT(0xa22d06b7eb0c94b0), W64LIT(0xb8b1c742127b66f2), W64LIT(0x285c3565e86a40a3), W64LIT(0x3b2b3f49207e0986), W64LIT(0x3c72d5ad9c5f6008), W64LIT(0x770217f9ea2ed812), W64LIT(0xfc274d40439ac6ea), W64LIT(0x4fd5930dc1d37a5c), W64LIT(0x2e51b6eafe99e3c6), W64LIT(0x6b93558305aa8935), W64LIT(0x19607a48f2f4598a), W64LIT(0x08bfa2b29bb1718c), W64LIT(0x3f8e6e1097dccbc0), W64LIT(0x3983ed9f812f68a5), W64LIT(0xac9f278a664e4659), W64LIT(0x82ce916098d7a59f), W64LIT(0xc2fd4a3b7e94c7c1), W64LIT(0x66ddcf03836bf014), W64LIT(0xe1e2665106cc5d26), W64LIT(0x74feac44e1ad73da), W64LIT(0x8d28d936bf47bd9d), W64LIT(0x62789e5a34c93252), W64LIT(0x81322add93540e57), W64LIT(0xcb1681e24ff77ca6), W64LIT(0x2512afe56eab3982), W64LIT(0xd18a4017b6808ee4), W64LIT(0x705bfd1d560fb19c), W64LIT(0x4b70c2547671b81a), W64LIT(0x49d81082d720d939), W64LIT(0xe0b60f3aac1e97cd), W64LIT(0x4e81fa666b01b0b7), W64LIT(0x951cca15e7612efc), W64LIT(0x463e58d4f0b0c13b), W64LIT(0x632cf7319e1bf8b9), W64LIT(0x5ca2992109c73379), W64LIT(0xf764544fd3a81cae), W64LIT(0x6ac73ce8af7843de), W64LIT(0x9f0bba71dd813e53), W64LIT(0x85977b8424f6cc11), W64LIT(0x5807c878be65f13f), W64LIT(0x686fee3e0e2922fd), W64LIT(0x78e45fafcdbec010), W64LIT(0x6ccabf67b98be0bb), W64LIT(0x11dfd8fa69452806), W64LIT(0xcee7b9d05287740b), W64LIT(0x50b86aca25d480b3), W64LIT(0x5df6f04aa315f992), W64LIT(0x5e0a4bf7a896525a), W64LIT(0x03fcbbbd0b83abc8), W64LIT(0x8f800be01e16dcbe), W64LIT(0xd32292c117d1efc7), W64LIT(0xe5473708b16e9f60), W64LIT(0x224b4501d28a500c), W64LIT(0xfb7ea7a4ffbbaf64), W64LIT(0x3d26bcc6368daae3), W64LIT(0x866bc0392f7567d9), W64LIT(0x3731cca20c6dba4c), W64LIT(0xb603e67f9f39b41b), W64LIT(0xa1d1bd0ae08f3f78), W64LIT(0xd935e2a52d31ff68), W64LIT(0xaf639c376dcded91), W64LIT(0x0154696baad2caeb), W64LIT(0xecacfcd1800d2407), W64LIT(0xf03dbeab6f897520), W64LIT(0x02a8d2d6a1516123), W64LIT(0xf498eff2d82bb766), W64LIT(0x710f9476fcdd7b77), W64LIT(0xf8821c19f43804ac), W64LIT(0xf9d675725eeace47), W64LIT(0x1a9cc1f5f977f242), W64LIT(0x5210b81c8485e190), W64LIT(0x6d9ed60c13592a50), W64LIT(0xf2956c7dced81403), W64LIT(0xbb4d7cff19f8cd3a), W64LIT(0x4c2928b0ca50d194), W64LIT(0x6e626db118da8198), W64LIT(0xe4135e631bbc558b), W64LIT(0x9da368a77cd05f70), W64LIT(0xa574ec53572dfd3e), W64LIT(0x09ebcbd93163bb67), W64LIT(0x4a24ab3fdca372f1), W64LIT(0x429b098d4712037d), W64LIT(0x57e1802e99f5e93d), W64LIT(0xef50476c8b8e8fcf), W64LIT(0xa085d4614a5df593), W64LIT(0x34cd771f07ee1184), W64LIT(0xc6581b62c9360587), W64LIT(0x2dad0d57f51a480e), W64LIT(0x898d886f08e57fdb), W64LIT(0xd6d3aaf30aa1e76a), W64LIT(0x76567e9240fc12f9), W64LIT(0xb4ab34a93e68d538), W64LIT(0xb2a6b726289b765d), W64LIT(0x8c7cb05d15957776), W64LIT(0x554952f838a4881e), W64LIT(0xd52f114e01224ca2), W64LIT(0x60d04c8c95985371), W64LIT(0x6789a66829b93aff), W64LIT(0x2f05df81544b292d), W64LIT(0x476a31bf5a620bd0), W64LIT(0xf5cc869972f97d8d), W64LIT(0x488c79e97df213d2), W64LIT(0x44968a0251e1a018), W64LIT(0x26ee14586528924a), W64LIT(0xd0de297c1c52440f), W64LIT(0xc5a4a0dfc2b5ae4f), W64LIT(0x29085c0e42b88a48), W64LIT(0x142ee0c8743520ab), W64LIT(0x2af4e7b3493b2180), W64LIT(0x9448a37e4db3e417), /* box 1 */ W64LIT(0xe2795ba105ba30ce), W64LIT(0x65b5d634f5e0fbdd), W64LIT(0x2d7d7f1464dd8c55), W64LIT(0xeefbf778add1c20b), W64LIT(0x1eb0fbd1f11968e7), W64LIT(0xe6073f45ce30cd8d), W64LIT(0x21ffd3cdccb67e90), W64LIT(0xdf0941cfa750a262), W64LIT(0xc61df5b1b75ef18a), W64LIT(0xc5c7defa9dc337c6), W64LIT(0x2581b729073c83d3), W64LIT(0xa5e97513167173cf), W64LIT(0xdd3673bd381526b9), W64LIT(0xe8baa1eef91ebb93), W64LIT(0x3b314cf8f625eb34), W64LIT(0x579d4bc8d5fc5df8), W64LIT(0xbb598ec2e7681b28), W64LIT(0xc8a06b1a80708794), W64LIT(0x1c8fc9a36e5cec3c), W64LIT(0xf60a5a3f0807d374), W64LIT(0x1ace9f353a9395a4), W64LIT(0x7e9e50387aab2cee), W64LIT(0xb5e41069d0466d36), W64LIT(0x8cea6ee3b92602d9), W64LIT(0xf952ddad8af1e7fd), W64LIT(0xb19a748d1bcc9075), W64LIT(0x2464ae10b2e4c144), W64LIT(0xfcc9a070f4a35829), W64LIT(0xfa88f6e6a06c21b1), W64LIT(0x2c98662dd105cec2), W64LIT(0x9065a740d77aeee5), W64LIT(0xcb7a4051aaed41d8), W64LIT(0x55a279ba4ab9d923), W64LIT(0x27be855b98790708), W64LIT(0xbabc97fb52b059bf), W64LIT(0xa19711f7ddfb8e8c), W64LIT(0x047e64e4cb8afd43), W64LIT(0xc386886cc90c4e5e), W64LIT(0xc422c7c3281b7551), W64LIT(0xfb6defdf15b46326), W64LIT(0x01e51939b5d84297), W64LIT(0x5cbba8be9c809432), W64LIT(0x6f762c7b09447080), W64LIT(0xcee13d8cd4bffe0c), W64LIT(0x54476083ff619bb4), W64LIT(0x6e933542bc9c3217), W64LIT(0x4af79b520e78f353), W64LIT(0x98996f7db49be163), W64LIT(0xa07208ce6823cc1b), W64LIT(0x2b3c29823012f5cd), W64LIT(0x93bf8c0bfde728a9), W64LIT(0x2225f886e62bb8dc), W64LIT(0x7f7b4901cf736e79), W64LIT(0x0000000000000000), W64LIT(0x023f32729f4584db), W64LIT(0xd5cabb805bf4293f), W64LIT(0x07a44fafe1173b0f), W64LIT(0xe95fb8d74cc6f904), W64LIT(0x7b052de504f9933a), W64LIT(0x6aed51a67716cf54), W64LIT(0x68d263d4e8534b8f), W64LIT(0xa96bd9cabe1a810a), W64LIT(0x1d6ad09adb84aeab), W64LIT(0x0d67b5e01db3b052), W64LIT(0x52063615abaee22c), W64LIT(0x8f3045a893bbc495), W64LIT(0xd8ad0e604647996d), W64LIT(0xaf2a8f5cead5f892), W64LIT(0x3017af8ebf5922fe), W64LIT(0x4034611df2dc780e), W64LIT(0x721cfce1d2c0de2b), W64LIT(0x28e602c91a8f3381), W64LIT(0xe1a370ea2f27f682), W64LIT(0x29031bf0af577116), W64LIT(0x1914b47e100e53e8), W64LIT(0x567852f160241f6f), W64LIT(0x793a1f979bbc17e1), W64LIT(0xef1eee411809809c), W64LIT(0x6211999b14f7c0d2), W64LIT(0x059b7ddd7e52bfd4), W64LIT(0x43ee4a56d841be42), W64LIT(0xf1ae1590e910e87b), W64LIT(0x33cd84c595c4e4b2), W64LIT(0x4b12826bbba0b1c4), W64LIT(0xeb608aa5d3837ddf), W64LIT(0x201acaf4796e3c07), W64LIT(0xbf27ea262ce2e66b), W64LIT(0x58c5cc5a570a6971), W64LIT(0x37b3e0215e4e19f1), W64LIT(0xab54ebb8215f05d1), W64LIT(0x8ed55c9126638602), W64LIT(0x9aa65d0f2bde65b8), W64LIT(0xd7f589f2c4b1ade4), W64LIT(0x5039046734eb66f7), W64LIT(0x6cac073023d9b6cc), W64LIT(0x51dc1d5e81332460), W64LIT(0x17a92ad5272025f6), W64LIT(0x47902eb213cb4301), W64LIT(0x1b2b860c8f4bd733), W64LIT(0x4f6ce68f702a4c87), W64LIT(0xcf0424b56167bc9b), W64LIT(0x997c76440143a3f4), W64LIT(0x7ae034dcb121d1ad), W64LIT(0x100d657ac6371ef9), W64LIT(0x0ac3fa4ffca48b5d), W64LIT(0xdeec58f61288e0f5), W64LIT(0x265b9c622da1459f), W64LIT(0xdcd36a848dcd642e), W64LIT(0xe4380d3751754956), W64LIT(0x13d74e31ecaad8b5), W64LIT(0xfd2cb949417b1abe), W64LIT(0x9624f1d683b5977d), W64LIT(0x4675378ba6130196), W64LIT(0x0b26e376497cc9ca), W64LIT(0x41d1782447043a99), W64LIT(0xe39c4298b0627259), W64LIT(0xcd3b16c7fe223840), W64LIT(0x7787813cac9261ff), W64LIT(0x492db01924e5351f), W64LIT(0x5afafe28c84fedaa), W64LIT(0x8b4e214c583139d6), W64LIT(0xccde0ffe4bfa7ad7), W64LIT(0x76629805194a2368), W64LIT(0x7ca1624ae5eea835), W64LIT(0x61cbb2d03e6a069e), W64LIT(0x48c8a920913d7788), W64LIT(0x8068c23a114df01c), W64LIT(0xd38bed160f3b50a7), W64LIT(0x32289dfc201ca625), W64LIT(0xc1b9ba1e5649ca85), W64LIT(0xed21dc33874c0447), W64LIT(0xa3a8238542be0a57), W64LIT(0x5b1fe7117d97af3d), W64LIT(0x3d701a6ea2ea92ac), W64LIT(0x73f9e5d867189cbc), W64LIT(0x9ed839ebe05498fb), W64LIT(0x5920d563e2d22be6), W64LIT(0xca9f59681f35034f), W64LIT(0x11e87c4373ef5c6e), W64LIT(0x97c1e8ef366dd5ea), W64LIT(0xacf0a417c0483ede), W64LIT(0xd26ef42fbae31230), W64LIT(0xbcfdc16d067f2027), W64LIT(0xbec2f31f993aa4fc), W64LIT(0x45af1cc08c8ec7da), W64LIT(0x31f2b6b70a816069), W64LIT(0xd9481759f39fdbfa), W64LIT(0xe5dd140ee4ad0bc1), W64LIT(0xa6335e583cecb583), W64LIT(0x38eb67b3dcb82d78), W64LIT(0xf5d07174229a1538), W64LIT(0x5f6183f5b61d527e), W64LIT(0x0f58879282f63489), W64LIT(0x164c33ec92f86761), W64LIT(0x444a05f93956854d), W64LIT(0x818ddb03a495b28b), W64LIT(0x4d53d4fdef6fc85c), W64LIT(0x8d0f77da0cfe404e), W64LIT(0x8416a6dedac70d5f), W64LIT(0x666ffd7fdf7d3d91), W64LIT(0xb63e3b22fadbab7a), W64LIT(0xf2743edbc38d2e37), W64LIT(0xa40c6c2aa3a93158), W64LIT(0x9f3d20d2558cda6c), W64LIT(0xfef692026be6dcf2), W64LIT(0x2ea7545f4e404a19), W64LIT(0xb2405fc631515639), W64LIT(0x23c0e1bf53f3fa4b), W64LIT(0x83b2e9713bd03650), W64LIT(0x0641569654cf7998), W64LIT(0xb883a589cdf5dd64), W64LIT(0x3ad455c143fda9a3), W64LIT(0x925a9532483f6a3e), W64LIT(0xaab1f28194874746), W64LIT(0xf435684d974257af), W64LIT(0xd1b4df64907ed47c), W64LIT(0x390e7e8a69606fef), W64LIT(0xd051c65d25a696eb), W64LIT(0xb4010950659e2fa1), W64LIT(0x0c82acd9a86bf2c5), W64LIT(0x88940a0772acff9a), W64LIT(0xf39127e276556ca0), W64LIT(0xaecf96655f0dba05), W64LIT(0x03da2b4b2a9dc64c), W64LIT(0x3f4f281c3daf1677), W64LIT(0x3469cb6a74d3dfbd), W64LIT(0xf04b0ca95cc8aaec), W64LIT(0x1f55e2e844c12a70), W64LIT(0x4cb6cdc45ab78acb), W64LIT(0xc05ca327e3918812), W64LIT(0x95feda9da9285131), W64LIT(0xb966bcb0782d9ff3), W64LIT(0xa7d647618934f714), W64LIT(0xd61090cb7169ef73), W64LIT(0x71c6d7aaf85d1867), W64LIT(0xecc4c50a329446d0), W64LIT(0x6450cf0d4038b94a), W64LIT(0x420b536f6d99fcd5), W64LIT(0x75b8b34e33d7e524), W64LIT(0xc26391557cd40cc9), W64LIT(0xda923c12d9021db6), W64LIT(0x4e89ffb6c5f20e10), W64LIT(0x0919d104d6394d11), W64LIT(0x8aab3875ede97b41), W64LIT(0xa88ec0f30bc2c39d), W64LIT(0xb7db221b4f03e9ed), W64LIT(0xc7f8ec880286b31d), W64LIT(0x2f424d66fb98088e), W64LIT(0xe04669d39affb415), W64LIT(0x3eaa3125887754e0), W64LIT(0x5e849acc03c510e9), W64LIT(0x8257f0488e0874c7), W64LIT(0xbd18d854b3a762b0), W64LIT(0xb3a546ff848914ae), W64LIT(0x9ce70b997f111c20), W64LIT(0x3c9503571732d03b), W64LIT(0xe7e2267c7be88f1a), W64LIT(0x63f480a2a12f8245), W64LIT(0x602eabe98bb24409), W64LIT(0x941bc3a41cf013a6), W64LIT(0x678ae4466aa57f06), W64LIT(0x1232570859729a22), W64LIT(0x6d491e099601f45b), W64LIT(0x5d5eb1872958d6a5), W64LIT(0x1473019e0dbde3ba), W64LIT(0xa24d3abcf76648c0), W64LIT(0x85f3bfe76f1f4fc8), W64LIT(0x08fcc83d63e10f86), W64LIT(0x745daa77860fa7b3), W64LIT(0x9180be7962a2ac72), W64LIT(0x87cc8d95f05acb13), W64LIT(0x78df06ae2e645576), W64LIT(0x18f1ad47a5d6117f), W64LIT(0x358cd253c10b9d2a), W64LIT(0x0ebd9eab372e761e), W64LIT(0xf7ef4306bddf91e3), W64LIT(0x7023ce934d855af0), W64LIT(0xd42fa2b9ee2c6ba8), W64LIT(0x3656f918eb965b66), W64LIT(0x9d0212a0cac95eb7), W64LIT(0x2ad930bb85cab75a), W64LIT(0x862994ac45828984), W64LIT(0x7d447b735036eaa2), W64LIT(0xb07f6db4ae14d2e2), W64LIT(0x6b08489fc2ce8dc3), W64LIT(0x9b4344369e06272f), W64LIT(0xad15bd2e75907c49), W64LIT(0xdb77252b6cda5f21), W64LIT(0xea85939c665b3f48), W64LIT(0xc945722335a8c503), W64LIT(0x159618a7b865a12d), W64LIT(0x69377aed5d8b0918), W64LIT(0x8971133ec774bd0d), W64LIT(0x53e32f2c1e76a0bb), W64LIT(0xf8b7c4943f29a56a), W64LIT(0xff138b3bde3e9e65), /* box 2 */ W64LIT(0x7c6a2eb5fdabecc6), W64LIT(0x401cda0a752bbea0), W64LIT(0x1925217156dc57c4), W64LIT(0x56dec6d301d70787), W64LIT(0x41c751ff73c6ac58), W64LIT(0xc9067697a92cb5f9), W64LIT(0x3391c917aaa0bc85), W64LIT(0xae0a9a4c0e742afe), W64LIT(0xaa8ca972162a62f4), W64LIT(0x5aa193912935df99), W64LIT(0x86fd9135fe27e5ba), W64LIT(0xffca074b1d3f538e), W64LIT(0x0e3cb65d24cdfc1b), W64LIT(0x4384b2e07fe9885d), W64LIT(0xc73ac0ca8de149e2), W64LIT(0x48e5bc7645972eb4), W64LIT(0xbe0d56b46ef9ffd6), W64LIT(0x200e6d05c0ef5f50), W64LIT(0xe1f17dee597f7abd), W64LIT(0x0243e31f0c2f2405), W64LIT(0xf4ab09dd2741f567), W64LIT(0xe4acc52547cc204f), W64LIT(0x348f92c3b83cc272), W64LIT(0x53837e181f645d75), W64LIT(0xd8da319acf4c7229), W64LIT(0x81e3cae1ecbb9b4d), W64LIT(0xd6e687c7eb818e32), W64LIT(0x3dad7f4a8e6d409e), W64LIT(0x28f70b79f053cf44), W64LIT(0x493e3783437a3c4c), W64LIT(0xb27203f6461b27c8), W64LIT(0xd02357e6fff0e23d), W64LIT(0xe8d390676f2ef851), W64LIT(0x26cbbd24d49e335f), W64LIT(0xee1640467b5f945e), W64LIT(0x4aa65f6949b80ab1), W64LIT(0xb56c58225487593f), W64LIT(0x4ffbe7a2570b5043), W64LIT(0x0aba85633c93b411), W64LIT(0x78ec1d8be5f5a4cc), W64LIT(0x501b16f215a66b88), W64LIT(0x271036d1d27321a7), W64LIT(0x7ff2465ff769da3b), W64LIT(0x35541936bed1d08a), W64LIT(0xb8c886957a8893d9), W64LIT(0x2fe950ade2cfb1b3), W64LIT(0xf90fd76a094e3f81), W64LIT(0x2daab3b2eee095b6), W64LIT(0x1abd499b5c1e6139), W64LIT(0x0c7f554228e2d81e), W64LIT(0x425f391579049aa5), W64LIT(0xc3bcf3f495bf01e8), W64LIT(0xb4b7d3d7526a4bc7), W64LIT(0x0000000000000000), W64LIT(0xa0362c112ab9d6e5), W64LIT(0x91e406198c364e65), W64LIT(0x454162c16b98e452), W64LIT(0x139fa4126a4fe3d5), W64LIT(0x01db8bf506ed12f8), W64LIT(0x9a85088fb648e88c), W64LIT(0x3ab3249e9cf13e69), W64LIT(0xd57eef2de143b8cf), W64LIT(0xb1ea6b1c4cd91135), W64LIT(0x7aaffe94e9da80c9), W64LIT(0xad92f2a604b61c03), W64LIT(0xa3ae44fb207be018), W64LIT(0xeb4bf88d65ecceac), W64LIT(0xc0249b1e9f7d3715), W64LIT(0xa8cf4a6d1a0546f1), W64LIT(0xc6e14b3f8b0c5b1a), W64LIT(0xce182d43bbb0cb0e), W64LIT(0xfc526fa117fd6573), W64LIT(0x8c471456c2b451ab), W64LIT(0xac497953025b0efb), W64LIT(0x0486333e185e480a), W64LIT(0x18feaa845031453c), W64LIT(0xa1eda7e42c54c41d), W64LIT(0x06c5d02114716c0f), W64LIT(0x055db8cb1eb35af2), W64LIT(0xe5774ed0412132b7), W64LIT(0x36cc71dcb413e677), W64LIT(0x470281de67b7c057), W64LIT(0x58e2708e251afb9c), W64LIT(0xa914c1981ce85409), W64LIT(0xb3a9880340f63530), W64LIT(0x638adfe5bf06d70d), W64LIT(0x0b610e963a7ea6e9), W64LIT(0x927c6ef386f47898), W64LIT(0xed8e28ac719da2a3), W64LIT(0x7548c33ccbfa6e2a), W64LIT(0xf3b5520935dd8b90), W64LIT(0x8d9c9fa3c4594353), W64LIT(0x31d22a08a68f9880), W64LIT(0x0da4deb72e0fcae6), W64LIT(0x8fdf7cbcc8766756), W64LIT(0x5dbfc8453ba9a16e), W64LIT(0x8e04f749ce9b75ae), W64LIT(0x83a029fee094bf48), W64LIT(0xa4b01f2f32e79eef), W64LIT(0x1c7899ba486f0d36), W64LIT(0x654f0fc4ab77bb02), W64LIT(0x7db1a540fb46fe3e), W64LIT(0x51c09d07134b7970), W64LIT(0xcb459588a50391fc), W64LIT(0x3fee9c558242649b), W64LIT(0xfe118cbe1bd24176), W64LIT(0x76d0abd6c13858d7), W64LIT(0x5e27a0af316b9793), W64LIT(0x69305a868395631c), W64LIT(0x3b68af6b9a1c2c91), W64LIT(0x6db669b89bcb2b16), W64LIT(0xa72877c53825a812), W64LIT(0xd3bb3f0cf532d4c0), W64LIT(0x6ff58aa797e40f13), W64LIT(0x96fa5dcd9eaa3092), W64LIT(0x2c713847e80d874e), W64LIT(0xc57923d581ce6de7), W64LIT(0x2b6f6393fa91f9b9), W64LIT(0x0922ed89365182ec), W64LIT(0x324a42e2ac4dae7d), W64LIT(0x16c21cd974fcb927), W64LIT(0x956235279468066f), W64LIT(0x7b747561ef379231), W64LIT(0x449ae9346d75f6aa), W64LIT(0xf570822821ace79f), W64LIT(0x5939fb7b23f7e964), W64LIT(0x7937967ee318b634), W64LIT(0x84be722af208c1bf), W64LIT(0x08f9667c30bc9014), W64LIT(0xefcdcbb37db286a6), W64LIT(0xa6f3fc303ec8baea), W64LIT(0xea9073786301dc54), W64LIT(0x62515410b9ebc5f5), W64LIT(0xd260b4f9f3dfc638), W64LIT(0x9e033bb1ae16a086), W64LIT(0x38f0c78190de1a6c), W64LIT(0xc267780193521310), W64LIT(0x80384114ea5689b5), W64LIT(0x9b5e837ab0a5fa74), W64LIT(0xf73361372d83c39a), W64LIT(0x3009a1fda0628a78), W64LIT(0xd4a564d8e7aeaa37), W64LIT(0xfb4c347505611b84), W64LIT(0x5b7a18642fd8cd61), W64LIT(0x239605efca2d69ad), W64LIT(0xf8d45c9f0fa32d79), W64LIT(0xbb50ee7f704aa524), W64LIT(0x392b4c7496330894), W64LIT(0x0fe73da82220eee3), W64LIT(0x3717fa29b2fef48f), W64LIT(0xf26ed9fc33309968), W64LIT(0xd73d0c32ed6c9cca), W64LIT(0xda99d285c363562c), W64LIT(0xde1fe1bbdb3d1e26), W64LIT(0x738d131ddf8b0225), W64LIT(0x292c808cf6beddbc), W64LIT(0xbc4eb5ab62d6dbd3), W64LIT(0x039868ea0ac236fd), W64LIT(0xcc5bce5cb79fef0b), W64LIT(0xb031e0e94a3403cd), W64LIT(0xc4a2a82087237f1f), W64LIT(0xb72fbb3d58a87d3a), W64LIT(0xafd111b908993806), W64LIT(0x68ebd173857871e4), W64LIT(0x9d9b535ba4d4967b), W64LIT(0xe9081b9269c3eaa9), W64LIT(0x71cef002d3a42620), W64LIT(0x93a7e50680196a60), W64LIT(0x891aac9ddc070b59), W64LIT(0x155a74337e3e8fda), W64LIT(0x4e206c5751e642bb), W64LIT(0x9721d6389847226a), W64LIT(0x12442fe76ca2f12d), W64LIT(0x2553d5cede5c05a2), W64LIT(0xa275cf0e2696f2e0), W64LIT(0x24885e3bd8b1175a), W64LIT(0x670cecdba7589f07), W64LIT(0x749348c9cd177cd2), W64LIT(0x64948431ad9aa9fa), W64LIT(0x2ab4e866fc7ceb41), W64LIT(0xe6ef263a4be3044a), W64LIT(0xe734adcf4d0e16b2), W64LIT(0x903f8dec8adb5c9d), W64LIT(0xf02d3ae33f1fbd6d), W64LIT(0x725698e8d96610dd), W64LIT(0x1da3124f4e821fce), W64LIT(0x1719972c7211abdf), W64LIT(0x11dc470d6660c7d0), W64LIT(0xec55a3597770b05b), W64LIT(0xbfd6dd416814ed2e), W64LIT(0x57054d26073a157f), W64LIT(0x1e3b7aa544402933), W64LIT(0x5ffc2b5a3786856b), W64LIT(0x61c93cfab329f308), W64LIT(0x3e3517a084af7663), W64LIT(0xf6e8eac22b6ed162), W64LIT(0x1007ccf8608dd528), W64LIT(0x66d7672ea1b58dff), W64LIT(0x8b594f82d0282f5c), W64LIT(0x1fe0f15042ad3bcb), W64LIT(0x4b7dd49c4f551849), W64LIT(0x4c638f485dc966be), W64LIT(0xcfc3a6b6bd5dd9f6), W64LIT(0x46d90a2b615ad2af), W64LIT(0x8565f9dff4e5d347), W64LIT(0x94b9bed292851497), W64LIT(0xfa97bf80038c097c), W64LIT(0xb9130d607c658121), W64LIT(0xdc5c02a4d7123a23), W64LIT(0x224d8e1accc07b55), W64LIT(0x87261ac0f8caf742), W64LIT(0xd901ba6fc9a160d1), W64LIT(0xab57228710c7700c), W64LIT(0x21d5e6f0c6024da8), W64LIT(0x98c6eb90ba67cc89), W64LIT(0x827ba20be679adb0), W64LIT(0x991d6065bc8ade71), W64LIT(0x5546ae390b15317a), W64LIT(0xa56b94da340a8c17), W64LIT(0x071e5bd4129c7ef7), W64LIT(0xe02af61b5f926845), W64LIT(0x6b73b9998fba4719), W64LIT(0xdfc46a4eddd00cde), W64LIT(0x770b2023c7d54a2f), W64LIT(0x7e29cdaaf184c8c3), W64LIT(0xba8b658a76a7b7dc), W64LIT(0x9c40d8aea2398483), W64LIT(0x9fd8b044a8fbb27e), W64LIT(0xdb425970c58e44d4), W64LIT(0xe269150453bd4c40), W64LIT(0x3c76f4bf88805266), W64LIT(0xf1f6b11639f2af95), W64LIT(0x549d25cc0df82382), W64LIT(0x4db804bd5b247446), W64LIT(0x8a82c477d6c53da4), W64LIT(0x5258f5ed19894f8d), W64LIT(0x6e2e015291091deb), W64LIT(0xc1ff10eb999025ed), W64LIT(0xbd953e5e643bc92b), W64LIT(0xc8ddfd62afc1a701), W64LIT(0x5c6443b03d44b396), W64LIT(0x6c6de24d9d2639ee), W64LIT(0x1481ffc678d39d22), W64LIT(0xd1f8dc13f91df0c5), W64LIT(0xca9e1e7da3ee8304), W64LIT(0xdd878951d1ff28db), W64LIT(0x6012b70fb5c4e1f0), W64LIT(0x1b66c26e5af373c1), W64LIT(0xe3b29ef155505eb8), W64LIT(0x70157bf7d54934d8), W64LIT(0x2e32db58e422a34b), W64LIT(0x6aa8326c895755e1), W64LIT(0xb6f430c85e456fc2), W64LIT(0xfd89e4541110778b), W64LIT(0x88c12768daea19a1), W64LIT(0xcd8045a9b172fdf3), /* box 3 */ W64LIT(0x99183e616655b742), W64LIT(0xb2872032a50d6860), W64LIT(0x0946f63b060528ef), W64LIT(0x36612b9a141ef07d), W64LIT(0x0634da84dd49579b), W64LIT(0xfc9c9e9b486c8a57), W64LIT(0xa63fe3c0744e6fd0), W64LIT(0xf1515758d8b46bf9), W64LIT(0x3e82559fcd5197ff), W64LIT(0x92e12d262bc40177), W64LIT(0xc3bb433a5a7752c5), W64LIT(0x21c3852a5183267a), W64LIT(0x39130725cf528f09), W64LIT(0x9ba7db1d2dc12998), W64LIT(0xc58f99be873e055e), W64LIT(0xd9d424498f32656c), W64LIT(0x27f75fae8cca71e1), W64LIT(0x59b91019a8fc3430), W64LIT(0xce768af9caafb36b), W64LIT(0x9d930199f0887e03), W64LIT(0x63b07a7ef3706a8e), W64LIT(0xb5167288a70e7096), W64LIT(0x40cc1a28e967d22e), W64LIT(0x4d01d3eb79bf3380), W64LIT(0x9e896cdb6456afb4), W64LIT(0x2548bad2c75eef3b), W64LIT(0xa79a6bfeab0420bd), W64LIT(0x9f2ce4e5bb1ce0d9), W64LIT(0x32ea146282c3393c), W64LIT(0x6d67defff7765a97), W64LIT(0x83775912b31080eb), W64LIT(0xf5da68a04e69a2b8), W64LIT(0x1196743498d4819c), W64LIT(0x0bf913474d91b635), W64LIT(0x43d6776a7db90399), W64LIT(0x444725d07fba1b6f), W64LIT(0x6584a0fa2e393d15), W64LIT(0x3f27dda1121bd892), W64LIT(0xf6c005e2dab7730f), W64LIT(0x56cb3ca673b04b44), W64LIT(0x642128c4f1737278), W64LIT(0xbf4ae9f135d589ce), W64LIT(0xb038c54eee99f6ba), W64LIT(0xf47fe09e9123edd5), W64LIT(0x75b75cf069a7f3e4), W64LIT(0xd419ed8a1fea84c2), W64LIT(0x73838674b4eea47f), W64LIT(0x498aec13ef62fac1), W64LIT(0x20660d148ec96917), W64LIT(0xa48006bc3fdaf10a), W64LIT(0x2f1421ab55851663), W64LIT(0x0a5c9b7992dbf958), W64LIT(0xd1375a4c567d02ee), W64LIT(0x0000000000000000), W64LIT(0xc842507d17e6e4f0), W64LIT(0xf3eeb2249320f523), W64LIT(0xc9e7d843c8acab9d), W64LIT(0xff86f3d9dcb25be0), W64LIT(0xb4b3fab678443ffb), W64LIT(0xb19d4d7031d3b9d7), W64LIT(0x79df1d0d26355d27), W64LIT(0x8eba90d123c86145), W64LIT(0xaa57a23d3bdcc113), W64LIT(0xcb583d3f83383547), W64LIT(0xd871ac7750782a01), W64LIT(0xe162ab529f2aa508), W64LIT(0x38b68f1b1018c064), W64LIT(0x237c60561a17b8a0), W64LIT(0xa31154063dd9e9fc), W64LIT(0x713c6308ff7a3aa5), W64LIT(0x1a6f6773d54537a9), W64LIT(0x08e37e05d94f6782), W64LIT(0x357b46d880c021ca), W64LIT(0x6cc256c1283c15fa), W64LIT(0xcfd302c715e5fc06), W64LIT(0xbdf50c8d7e411714), W64LIT(0x7cf1aacb6fa2db0b), W64LIT(0x5240035ee56d8205), W64LIT(0x7b60f8716da1c3fd), W64LIT(0x01a5883edf4a4f6d), W64LIT(0xdd5f1bb119efac2d), W64LIT(0x5474d9da3824d59e), W64LIT(0x0f722cbfdb4c7f74), W64LIT(0x17a2aeb0459dd607), W64LIT(0x37c4a3a4cb54bf10), W64LIT(0xc21ecb04853d1da8), W64LIT(0x4273ff54a2f34cf4), W64LIT(0xdace490b1becb4db), W64LIT(0x6af68c45f5754261), W64LIT(0x46f8c0ac342e85b5), W64LIT(0x854383966e59d770), W64LIT(0x81c8bc6ef8841e31), W64LIT(0x3bace25984c611d3), W64LIT(0x1033fc0a479ecef1), W64LIT(0x1c5bbdf7080c6032), W64LIT(0x7412d4ceb6edbc89), W64LIT(0xa8e8474170485fc9), W64LIT(0xb8dbbb4b37d69138), W64LIT(0x079152ba020318f6), W64LIT(0x72260e4a6ba4eb12), W64LIT(0x905ec85a60509fad), W64LIT(0x2dabc4d71e1188b9), W64LIT(0xd092d27289374d83), W64LIT(0x610f9f02b8e4f454), W64LIT(0x02bfe57c4b949eda), W64LIT(0x95707f9c29c71981), W64LIT(0x6fd83b83bce2c44d), W64LIT(0x5d322fe13e21fd71), W64LIT(0x34decee65f8a6ea7), W64LIT(0xcd6ce7bb5e7162dc), W64LIT(0xfb0dcc214a6f92a1), W64LIT(0x2eb1a9958acf590e), W64LIT(0xdcfa938fc6a5e340), W64LIT(0x669ecdb8bae7eca2), W64LIT(0x151d4bcc0e0948dd), W64LIT(0xfd3916a59726c53a), W64LIT(0x581c982777b67b5d), W64LIT(0x1bcaef4d0a0f78c4), W64LIT(0xdfe0fecd527b32f7), W64LIT(0x128c19760c0a502b), W64LIT(0x84e60ba8b113981d), W64LIT(0x3c3db0e386c50925), W64LIT(0x7febc789fb7c0abc), W64LIT(0x7d5422f5b0e89466), W64LIT(0xd70380c88b345575), W64LIT(0xbbc1d609a308408f), W64LIT(0xe278c6100bf474bf), W64LIT(0x5e2842a3aaff2cc6), W64LIT(0x6b53047b2a3f0d0c), W64LIT(0xf7658ddc05fd3c62), W64LIT(0x9a025323f28b66f5), W64LIT(0x8c0575ad685cff9f), W64LIT(0x76ad31b2fd792253), W64LIT(0x68496939bee1dcbb), W64LIT(0x7e4e4fb7243645d1), W64LIT(0xe44c1c94d6bd2324), W64LIT(0xbeef61cfea9fc6a3), W64LIT(0x91fb4064bf1ad0c0), W64LIT(0x052eb7c64997862c), W64LIT(0x4a9081517bbc2b76), W64LIT(0x8f1f18effc822e28), W64LIT(0x3a096a675b8c5ebe), W64LIT(0xee1087ed4466da7c), W64LIT(0x2652d79053803e8c), W64LIT(0x7099eb36203075c8), W64LIT(0xc7307cc2ccaa9b84), W64LIT(0x5c97a7dfe16bb21c), W64LIT(0x50ffe622aef91cdf), W64LIT(0x8da0fd93b716b0f2), W64LIT(0x69ece10761ab93d6), W64LIT(0x31f07920161de88b), W64LIT(0x13299148d3401f46), W64LIT(0x031a6d4294ded1b7), W64LIT(0xccc96f85813b2db1), W64LIT(0x14b8c3f2d14307b0), W64LIT(0x8659eed4fa8706c7), W64LIT(0xba645e377c420fe2), W64LIT(0x2920fb2f88cc41f8), W64LIT(0x87fc66ea25cd49aa), W64LIT(0x1ee4588b4398fee8), W64LIT(0xecaf62910ff244a6), W64LIT(0xf817a163deb14316), W64LIT(0x45e2adeea0f05402), W64LIT(0x806d345027ce515c), W64LIT(0x576eb498acfa0429), W64LIT(0xa5258e82e090be67), W64LIT(0x892bc26b21cb79b3), W64LIT(0x6e7db3bd63a88b20), W64LIT(0x4e1bbea9ed61e237), W64LIT(0xadc6f08739dfd9e5), W64LIT(0x8b9427176a5fe769), W64LIT(0xa1aeb17a764d7726), W64LIT(0x4b35096fa4f6641b), W64LIT(0x22d9e868c55df7cd), W64LIT(0x55d151e4e76e9af3), W64LIT(0x966a12debd19c836), W64LIT(0x0dcdc9c390d8e1ae), W64LIT(0xf24b3a1a4c6aba4e), W64LIT(0x24ed32ec1814a056), W64LIT(0xaf7915fb724b473f), W64LIT(0x2885731157860e95), W64LIT(0x9c3689a72fc2316e), W64LIT(0x475d4892eb64cad8), W64LIT(0xac6378b9e6959688), W64LIT(0xa00b3944a907384b), W64LIT(0xc695f4fc13e0d4e9), W64LIT(0x3055f11ec957a7e6), W64LIT(0x6215f2402c3a25e3), W64LIT(0xde4576f38d317d9a), W64LIT(0x9344a518f48e4e1a), W64LIT(0x82d2d12c6c5acf86), W64LIT(0xefb50fd39b2c9511), W64LIT(0xe981d5574665c28a), W64LIT(0x5f8dca9d75b563ab), W64LIT(0xb60c1fca33d0a121), W64LIT(0xfe237be703f8148d), W64LIT(0xd6a608f6547e1a18), W64LIT(0xb97e3375e89cde55), W64LIT(0xd388bf301de99c34), W64LIT(0x5b06f565e368aaea), W64LIT(0xf0f4df6607fe2494), W64LIT(0x1607268e9ad7996a), W64LIT(0xaedc9dc5ad010852), W64LIT(0xe0c7236c4060ea65), W64LIT(0xea9bb815d2bb133d), W64LIT(0x888e4a55fe8136de), W64LIT(0x5aa37d5b3c22e587), W64LIT(0xc104a64611e3cc1f), W64LIT(0x515a6e1c71b353b2), W64LIT(0xc42a118058744a33), W64LIT(0x7708b98c22336d3e), W64LIT(0x2a3a966d1c12904f), W64LIT(0x8a31af29b515a804), W64LIT(0xed0aeaafd0b80bcb), W64LIT(0x2c0e4ce9c15bc7d4), W64LIT(0x0c6841fd4f92aec3), W64LIT(0x98bdb65fb91ff82f), W64LIT(0x1f41d0b59cd2b185), W64LIT(0xb322a80c7a47270d), W64LIT(0xe6f3f9e89d29bdfe), W64LIT(0x7ac5704fb2eb8c90), W64LIT(0xa94dcf7faf0210a4), W64LIT(0x787a9533f97f124a), W64LIT(0xdb6bc135c4a6fbb6), W64LIT(0x048b3ff896ddc941), W64LIT(0xe8245d69992f8de7), W64LIT(0xe3dd4e2ed4be3bd2), W64LIT(0xcafdb5015c727a2a), W64LIT(0xb7a997f4ec9aee4c), W64LIT(0xe75671d64263f293), W64LIT(0x2b9f1e53c358df22), W64LIT(0x18d0820f9ed1a973), W64LIT(0xabf22a03e4968e7e), W64LIT(0xa2b4dc38e293a691), W64LIT(0x673b458665ada3cf), W64LIT(0xf9b2295d01fb0c7b), W64LIT(0xd22d370ec2a3d359), W64LIT(0x97cf9ae06253875b), W64LIT(0x0ed7a48104063019), W64LIT(0x482f642d3028b5ac), W64LIT(0xc0a12e78cea98372), W64LIT(0x4fbe3697322bad5a), W64LIT(0x19750a31419be61e), W64LIT(0x41699216362d9d43), W64LIT(0xd5bc65b4c0a0cbaf), W64LIT(0xe5e994aa09f76c49), W64LIT(0xeb3e302b0df15c50), W64LIT(0x94d5f7a2f68d56ec), W64LIT(0x53e58b603a27cd68), W64LIT(0x3d9838dd598f4648), W64LIT(0x60aa173c67aebb39), W64LIT(0x1dfe35c9d7462f5f), W64LIT(0x4ca45bd5a6f57ced), W64LIT(0xbc5084b3a10b5879), W64LIT(0xfaa8441f9525ddcc), W64LIT(0x334f9c5c5d897651), /* box 4 */ W64LIT(0xda1687a883adf27e), W64LIT(0xe35c9378578d9f22), W64LIT(0x303ca4531637fa40), W64LIT(0xa088321f74b20375), W64LIT(0xc9863f3a9acb95e9), W64LIT(0x5fcf47c57d0b0ed4), W64LIT(0x4aa211e4e1280b4b), W64LIT(0xe1a4c9ba871d1289), W64LIT(0x4926664759f03a4f), W64LIT(0xadfb36ede3707bca), W64LIT(0xcf7bd1891f8ef7e1), W64LIT(0x9735559e8f882792), W64LIT(0x5932a976f84e6cdc), W64LIT(0x9dc792bef547818a), W64LIT(0x06fdeeb385456208), W64LIT(0x46ad38771ea2cf5b), W64LIT(0x5eb36aa41543b27b), W64LIT(0x8b2eb33cd1bcb511), W64LIT(0x71105ff6e598ebbc), W64LIT(0x5441ad846f8c1463), W64LIT(0x4c5fff57646d6943), W64LIT(0xf3485c49f633c9b1), W64LIT(0x9cbbbfdf9d0f3d25), W64LIT(0x22d031a067192178), W64LIT(0xca0248992213a4ed), W64LIT(0x19627fb263a9c18f), W64LIT(0x9330e1efda5dc831), W64LIT(0x1390b89219666797), W64LIT(0x2edf18339893e568), W64LIT(0x6c779435d3e4c590), W64LIT(0x53c06e568281cac4), W64LIT(0x6ff3e3966b3cf494), W64LIT(0xfe3b58bb61f1b10e), W64LIT(0x77edb14560dd89b4), W64LIT(0x02f85ac2d0908dab), W64LIT(0x12ec95f3712edb38), W64LIT(0x85d9c06dfea6fcaa), W64LIT(0x90b4964c6285f935), W64LIT(0xf1b0068b26a3441a), W64LIT(0x729428555d40dab8), W64LIT(0x5c4b3066c5d33fd0), W64LIT(0x5d371d07ad9b837f), W64LIT(0xa48d866e2167ecd6), W64LIT(0xb661139d504937ee), W64LIT(0xa27068dda4228ede), W64LIT(0xf8c6b608e4b4d306), W64LIT(0x6bf657e73ee91b37), W64LIT(0xac871b8c8b38c765), W64LIT(0x4ea7a595b4fde4e8), W64LIT(0x0d7304f297c278bf), W64LIT(0xb71d3efc38018b41), W64LIT(0xae7f414e5ba84ace), W64LIT(0xaf036c2f33e0f661), W64LIT(0x0000000000000000), W64LIT(0xb89660cc7f537e55), W64LIT(0xa675dcacf1f7617d), W64LIT(0x610490c74426bd2f), W64LIT(0xc18ca2d83094be5a), W64LIT(0x2adaac42cd460acb), W64LIT(0x7d1f76651a122fac), W64LIT(0xc58916a9654151f9), W64LIT(0xedabe0297897d699), W64LIT(0x2d5b6f90204bd46c), W64LIT(0x26d585d132cccedb), W64LIT(0x9f3fc87c25d70c21), W64LIT(0xc60d610add9960fd), W64LIT(0x80a0597dc33bafa6), W64LIT(0xd0e44088f9625466), W64LIT(0x1d67cbc3367c2e2c), W64LIT(0x2c2742f1480368c3), W64LIT(0x89d6e9fe012c38ba), W64LIT(0xe9ae54582d42393a), W64LIT(0x3ecbd702392db3fb), W64LIT(0xb5e5643ee89106ea), W64LIT(0xa882affddeed28c6), W64LIT(0x1ae60811db71f08b), W64LIT(0x924ccc8eb215749e), W64LIT(0xfcc30279b1613ca5), W64LIT(0x825803bf13ab220d), W64LIT(0xd992f00b3b75c37a), W64LIT(0xc8fa125bf2832946), W64LIT(0x35453d432baaa94c), W64LIT(0xf9ba9b698cfc6fa9), W64LIT(0x37bd6781fb3a24e7), W64LIT(0x791ac2144fc7c00f), W64LIT(0x16e9218224fb349b), W64LIT(0xdb6aaac9ebe54ed1), W64LIT(0xd8eedd6a533d7fd5), W64LIT(0x7c635b04725a9303), W64LIT(0x553d80e507c4a8cc), W64LIT(0x9a46516c184a5f2d), W64LIT(0x14117b40f46bb930), W64LIT(0x1ee3bc608ea41f28), W64LIT(0x27a9a8b05a847274), W64LIT(0x4050d6c49be7ad53), W64LIT(0x7be298d69f574da4), W64LIT(0x6a8a7a8656a1a798), W64LIT(0x4d23d2360c25d5ec), W64LIT(0x1014cf31a1be5693), W64LIT(0xb264a7ec059cd84d), W64LIT(0xea2a23fb959a083e), W64LIT(0xf0cc2bea4eebf8b5), W64LIT(0x76919c240895351b), W64LIT(0x0b8eea4112871ab7), W64LIT(0x47d1151676ea73f4), W64LIT(0xbdeff9dc42ce2d59), W64LIT(0x2ba68123a50eb664), W64LIT(0x057999103d9d530c), W64LIT(0xe759270902587081), W64LIT(0xef53baeba8075b32), W64LIT(0x4fdb88f4dcb55847), W64LIT(0x6e8fcef70374483b), W64LIT(0x1168e250c9f6ea3c), W64LIT(0x1b9a2570b3394c24), W64LIT(0x706c72978dd05713), W64LIT(0x865db7ce467ecdae), W64LIT(0x52bc4337eac9766b), W64LIT(0x504419f53a59fbc0), W64LIT(0x8f2b074d84695ab2), W64LIT(0x6078bda62c6e0180), W64LIT(0x43d4a167233f9c57), W64LIT(0x0ef773512f1a49bb), W64LIT(0x0c0f2993ff8ac410), W64LIT(0x4bde3c858960b7e4), W64LIT(0x66855315a92b6388), W64LIT(0xd360372b41ba6562), W64LIT(0x584e84179006d073), W64LIT(0x9b3a7c0d7002e382), W64LIT(0xa5f1ab0f492f5079), W64LIT(0x2822f6801dd68760), W64LIT(0x445562b5ce3242f0), W64LIT(0xaa7af53f0e7da56d), W64LIT(0x3c338dc0e9bd3e50), W64LIT(0x3bb24e1204b0e0f7), W64LIT(0xd59dd998c4ff076a), W64LIT(0x91c8bb2d0acd459a), W64LIT(0x84a5ed0c96ee4005), W64LIT(0x33b8d3f0aeefcb44), W64LIT(0x57c5da27d7542567), W64LIT(0x32c4fe91c6a777eb), W64LIT(0x3439102243e215e3), W64LIT(0xc7714c6bb5d1dc52), W64LIT(0x3fb7fa6351650f54), W64LIT(0x87219aaf2e367101), W64LIT(0xf5b5b2fa7376abb9), W64LIT(0x412cfba5f3af11fc), W64LIT(0xdceb691b06e89076), W64LIT(0xbb12176fc78b4f51), W64LIT(0x73e8053435086617), W64LIT(0xe220be193fc5238d), W64LIT(0xb09cfd2ed50c55e6), W64LIT(0xb9ea4dad171bc2fa), W64LIT(0x9e43e51d4d9fb08e), W64LIT(0x36c14ae093729848), W64LIT(0xa9fe829cb6a59469), W64LIT(0x0405b47155d5efa3), W64LIT(0x0af2c7207acfa618), W64LIT(0x7e9b01c6a2ca1ea8), W64LIT(0xdd97447a6ea02cd9), W64LIT(0x0781c3d2ed0ddea7), W64LIT(0x7866ef75278f7ca0), W64LIT(0xd1986de9912ae8c9), W64LIT(0xcb7e65f84a5b1842), W64LIT(0xcd838b4bcf1e7a4a), W64LIT(0xab06d85e663519c2), W64LIT(0xd4e1f4f9acb7bbc5), W64LIT(0xfdbf2f18d929800a), W64LIT(0xf23471289e7b751e), W64LIT(0xbc93d4bd2a8691f6), W64LIT(0x3d4fa0a181f582ff), W64LIT(0xba6e3a0eafc3f3fe), W64LIT(0x5ab6ded540965dd8), W64LIT(0xeb560e9afdd2b491), W64LIT(0x0976b083c217971c), W64LIT(0xecd7cd4810df6a36), W64LIT(0x23ac1cc10f519dd7), W64LIT(0xbe6b8e7ffa161c5d), W64LIT(0x7fe72ca7ca82a207), W64LIT(0xc0f08fb958dc02f5), W64LIT(0x7a9eb5b7f71ff10b), W64LIT(0xa709f1cd99bfddd2), W64LIT(0x8dd35d8f54f9d719), W64LIT(0x8caf70ee3cb16bb6), W64LIT(0xe4dd50aaba804185), W64LIT(0x83242ede7be39ea2), W64LIT(0x98be0baec8dad286), W64LIT(0x690e0d25ee79969c), W64LIT(0x95cd0f5c5f18aa39), W64LIT(0x56b9f746bf1c99c8), W64LIT(0x7469c6e6d805b8b0), W64LIT(0x8a529e5db9f409be), W64LIT(0xe6250a686a10cc2e), W64LIT(0x2fa33552f0db59c7), W64LIT(0x42a88c064b7720f8), W64LIT(0x6d0bb954bbac793f), W64LIT(0x181e52d30be17d20), W64LIT(0xbf17a31e925ea0f2), W64LIT(0x94b1223d37501696), W64LIT(0xe8d27939450a8595), W64LIT(0xccffa62aa756c6e5), W64LIT(0x383639b1bc68d1f3), W64LIT(0xee2f978ac04fe79d), W64LIT(0xa30c45bccc6a3271), W64LIT(0x1f9f9101e6eca387), W64LIT(0xb1e0d04fbd44e949), W64LIT(0x242ddf13e25c4370), W64LIT(0x156d56219c23059f), W64LIT(0x88aac49f69648415), W64LIT(0x6280e764fcfe8c2b), W64LIT(0xdf6f1eb8be30a172), W64LIT(0xe5a17dcbd2c8fd2a), W64LIT(0xe0d8e4dbef55ae26), W64LIT(0x63fcca0594b63084), W64LIT(0xa1f41f7e1cfabfda), W64LIT(0x295edbe1759e3bcf), W64LIT(0x67f97e74c163df27), W64LIT(0x038477a3b8d83104), W64LIT(0xde1333d9d6781ddd), W64LIT(0x3ace63736cf85c58), W64LIT(0xd619ae3b7c27366e), W64LIT(0x5bcaf3b428dee177), W64LIT(0xb3188a8d6dd464e2), W64LIT(0x1c1be6a25e349283), W64LIT(0x017c2d616848bcaf), W64LIT(0x8e572a2cec21e61d), W64LIT(0xf631c559cbae9abd), W64LIT(0x81dc741cab731309), W64LIT(0xff4775da09b90da1), W64LIT(0xb499495f80d9ba45), W64LIT(0x0f8b5e304752f514), W64LIT(0x394a14d0d4206d5c), W64LIT(0xce07fce877c64b4e), W64LIT(0xf4c99f9b1b3e1716), W64LIT(0xc4f53bc80d09ed56), W64LIT(0xc208d57b884c8f5e), W64LIT(0x080a9de2aa5f2bb3), W64LIT(0x314089327e7f46ef), W64LIT(0xfa3eecca34245ead), W64LIT(0x20286b62b789acd3), W64LIT(0x7515eb87b04d041f), W64LIT(0x513834945211476f), W64LIT(0x650124b611f3528c), W64LIT(0x17950ce34cb38834), W64LIT(0x45294fd4a67afe5f), W64LIT(0x21544603dfc1107c), W64LIT(0x485a4b2631b886e0), W64LIT(0x6872204486312a33), W64LIT(0x647d09d779bbee23), W64LIT(0x2551f2728a14ffdf), W64LIT(0xd765835a146f8ac1), W64LIT(0xd21c1a4a29f2d9cd), W64LIT(0x99c226cfa0926e29), W64LIT(0xfb42c1ab5c6ce202), W64LIT(0xc374f81ae00433f1), W64LIT(0x964978ffe7c09b3d), W64LIT(0xf74de838a3e62612), /* box 5 */ W64LIT(0x74b87b36b0592c6a), W64LIT(0x3d82d75dffb4b81c), W64LIT(0x8884246715267825), W64LIT(0xdaf2d8a77ed4e5de), W64LIT(0xfeb118650e53f9c7), W64LIT(0xbd2d1aea59226b06), W64LIT(0x26ce87f6dbabb191), W64LIT(0x32772ecbeb66bd0a), W64LIT(0xd4bbf82bc5104c8c), W64LIT(0x055357720c4e03a1), W64LIT(0xef5be62a32d0f6fd), W64LIT(0xbe1c84c45d186aca), W64LIT(0xacc7e4a565a1643c), W64LIT(0x8dd7731519687b84), W64LIT(0x11eafe4f3c830f3a), W64LIT(0x04ef8e68a358afe5), W64LIT(0x40ad9ca1534b930d), W64LIT(0xe44191d4855a5c0e), W64LIT(0x6001d20b809420f1), W64LIT(0x73666b70173b8243), W64LIT(0x372479b9e728beab), W64LIT(0x45fecbd35f0590ac), W64LIT(0x7057f55e1301838f), W64LIT(0xff0dc17fa1455583), W64LIT(0x0cc467b810e804da), W64LIT(0xb9c29482fa7ac4e3), W64LIT(0xa003831d754960e6), W64LIT(0x8a096353be0ad5ad), W64LIT(0xdd2cc8e1d9b64bf7), W64LIT(0xc7dc415052bfee3e), W64LIT(0x9f0c137421d17572), W64LIT(0x35a93e8d4c041323), W64LIT(0x9a5f44062d9f76d3), W64LIT(0x71eb2c44bc172fcb), W64LIT(0x0ff5f99614d20516), W64LIT(0x7789e518b4632da6), W64LIT(0xc99561dce97b476c), W64LIT(0x5276fcc06bf29dfb), W64LIT(0x4a0b32454bd795ba), W64LIT(0x9274add69e2fddec), W64LIT(0x4f5865374799961b), W64LIT(0xb2d8e37c4df06e10), W64LIT(0xc4eddf7e5685eff2), W64LIT(0xb3643a66e2e6c254), W64LIT(0xd50721316a06e0c8), W64LIT(0x8bb5ba49111c79e9), W64LIT(0x2bb639546455190f), W64LIT(0xf8d3d1390627fbaa), W64LIT(0x38d1802ff3fabbbd), W64LIT(0xdfa18fd5729ae67f), W64LIT(0x4ee4bc2de88f3a5f), W64LIT(0xf72628af12f5febc), W64LIT(0x0aa6aee4189c06b7), W64LIT(0x0000000000000000), W64LIT(0x9eb0ca6e8ec7d936), W64LIT(0xcb1826e84257eae4), W64LIT(0x187dce8520250841), W64LIT(0xc28f16225ef1ed9f), W64LIT(0xc333cf38f1e741db), W64LIT(0x4220db95f8673e85), W64LIT(0xdc9011fb76a0e7b3), W64LIT(0x105627559395a37e), W64LIT(0x2f59b73cc70db6ea), W64LIT(0xe112c6a689145faf), W64LIT(0x82228a830dba7e92), W64LIT(0x2ee56e26681b1aae), W64LIT(0x2a0ae04ecb43b54b), W64LIT(0x47738ce7f4293d24), W64LIT(0xa7dd935bd22bcecf), W64LIT(0xd2d93177cd644ee1), W64LIT(0xebb4684291885918), W64LIT(0x0e49208cbbc4a952), W64LIT(0xa550d46f79076347), W64LIT(0x411145bbfc5d3f49), W64LIT(0xe6ccd6e02e76f186), W64LIT(0x4bb7eb5fe4c139fe), W64LIT(0x5d8305567f2098ed), W64LIT(0x95aabd90394d73c5), W64LIT(0x25ff19d8df91b05d), W64LIT(0x86cd04ebaee2d177), W64LIT(0x03319e2e043a01cc), W64LIT(0x6b1ba5f5371e8a02), W64LIT(0x76353c021b7581e2), W64LIT(0x64ee5c6323cc8f14), W64LIT(0x5c3fdc4cd03634a9), W64LIT(0x6996e2c19c32278a), W64LIT(0x8938fd7dba30d461), W64LIT(0x7b4d82a0a48b297c), W64LIT(0xbfa05ddef20ec68e), W64LIT(0x8ee6ed3b1d527a48), W64LIT(0x61bd0b112f828cb5), W64LIT(0x66631b5788e0229c), W64LIT(0x55a8ec86cc9033d2), W64LIT(0x1c9240ed837da7a4), W64LIT(0x150570279fdba0df), W64LIT(0x53ca25dac4e431bf), W64LIT(0xd636bf1f6e3ce104), W64LIT(0xcaa4fff2ed4146a0), W64LIT(0x787c1c8ea0b128b0), W64LIT(0xad7b3dbfcab7c878), W64LIT(0xfc3c5f51a57f544f), W64LIT(0xb78bb40e41be6db1), W64LIT(0x8c6baa0fb67ed7c0), W64LIT(0xce4b719a4e19e945), W64LIT(0xf96f0823a93157ee), W64LIT(0x7d2f4bfcacff2b11), W64LIT(0x3eb34973fb8eb9d0), W64LIT(0xe39f81922238f227), W64LIT(0x239dd084d7e5b230), W64LIT(0x1fa3dec38747a668), W64LIT(0xc5510664f99343b6), W64LIT(0xc829b8c6466deb28), W64LIT(0x85fc9ac5aad8d0bb), W64LIT(0xb6376d14eea8c1f5), W64LIT(0x9d8154408afdd8fa), W64LIT(0x3be01e01f7c0ba71), W64LIT(0x628c953f2bb88d79), W64LIT(0x6d796ca93f6a886f), W64LIT(0xfa5e960dad0b5622), W64LIT(0xe5fd48ce2a4cf04a), W64LIT(0xe7700ffa81605dc2), W64LIT(0x2dd4f0086c211b62), W64LIT(0x2221099e78f31e74), W64LIT(0xdb4e01bdd1c2499a), W64LIT(0xf417b68116cfff70), W64LIT(0xb506f33aea92c039), W64LIT(0x514762ee6fc89c37), W64LIT(0x9c3d8d5a25eb74be), W64LIT(0x396d59355cec17f9), W64LIT(0xccc636aee53544cd), W64LIT(0x0b1a77feb78aaaf3), W64LIT(0xe9392f763aa4f490), W64LIT(0xaaa52df96dd56651), W64LIT(0x46cf55fd5b3f9160), W64LIT(0xa4ec0d75d611cf03), W64LIT(0xaff67a8b619b65f0), W64LIT(0x3415e797e312bf67), W64LIT(0x7af15bba0b9d8538), W64LIT(0x811314ad09807f5e), W64LIT(0x8771ddf101f47d33), W64LIT(0x969b23be3d777209), W64LIT(0xd365e86d6272e2a5), W64LIT(0x58d05224736e9b4c), W64LIT(0xc660984afda9427a), W64LIT(0x5414359c63869f96), W64LIT(0xe885f66c95b258d4), W64LIT(0x655285798cda2350), W64LIT(0x6cc5b5b3907c242b), W64LIT(0x6ff42b9d944625e7), W64LIT(0xc0025116f5dd4017), W64LIT(0xa28ec429de65cd6e), W64LIT(0x63304c2584ae213d), W64LIT(0x7fa20cc807d38699), W64LIT(0x996eda2829a5771f), W64LIT(0x1b4c50ab241f098d), W64LIT(0x1e1f07d928510a2c), W64LIT(0x33cbf7d14470114e), W64LIT(0xb055a448e6dcc398), W64LIT(0x98d2033286b3db5b), W64LIT(0xec6a780436eaf731), W64LIT(0xa1bf5a07da5fcca2), W64LIT(0xbaf30aacfe40c52f), W64LIT(0xf144e1f31a81fcd1), W64LIT(0xe0ae1fbc2602f3eb), W64LIT(0x14b9a93d30cd0c9b), W64LIT(0x596c8b3edc783708), W64LIT(0x682a3bdb33248bce), W64LIT(0xb87e4d98556c68a7), W64LIT(0x80afcdb7a696d31a), W64LIT(0x5725abb267bc9e5a), W64LIT(0x914533f89a15dc20), W64LIT(0x5eb29b787b1a9921), W64LIT(0x01bcd91aaf16ac44), W64LIT(0xc1be880c5acbec53), W64LIT(0xedd6a11e99fc5b75), W64LIT(0x028d4734ab2cad88), W64LIT(0x8f5a3421b244d60c), W64LIT(0x4dd52203ecb53b93), W64LIT(0x3f0f906954981594), W64LIT(0xae4aa391ce8dc9b4), W64LIT(0x3698a0a3483e12ef), W64LIT(0xf5ab6f9bb9d95334), W64LIT(0x082be9d0b3b0ab3f), W64LIT(0xd1e8af59c95e4f2d), W64LIT(0xd87f9f93d5f84856), W64LIT(0x6e48f2873b5089a3), W64LIT(0x2443c0c270871c19), W64LIT(0xb1e97d5249ca6fdc), W64LIT(0x7c9392e603e98755), W64LIT(0x839e5399a2acd2d6), W64LIT(0x19c1179f8f33a405), W64LIT(0xde1d56cfdd8c4a3b), W64LIT(0x20ac4eaad3dfb3fc), W64LIT(0x1af089b18b09a5c9), W64LIT(0x3a5cc71b58d61635), W64LIT(0x444212c9f0133ce8), W64LIT(0x72dab26ab82d2e07), W64LIT(0x4c69fb1943a397d7), W64LIT(0xf3c9a6c7b1ad5159), W64LIT(0x1d2e99f72c6b0be0), W64LIT(0xb4ba2a2045846c7d), W64LIT(0xe22358888d2e5e63), W64LIT(0x2887a77a606f18c3), W64LIT(0xa8286acdc6f9cbd9), W64LIT(0x5f0e4262d40c3565), W64LIT(0xeee73f309dc65ab9), W64LIT(0x9be39d1c8289da97), W64LIT(0x1634ee099be1a113), W64LIT(0xea08b1583e9ef55c), W64LIT(0x9727faa49261de4d), W64LIT(0x2c682912c337b726), W64LIT(0xcff7a880e10f4501), W64LIT(0x1788371334f70d57), W64LIT(0x27725eec74bd1dd5), W64LIT(0x3146b0e5ef5cbcc6), W64LIT(0x099730ca1ca6077b), W64LIT(0xf2757fdd1ebbfd1d), W64LIT(0x6aa77cef98082646), W64LIT(0xbb4fd3b65156696b), W64LIT(0x569972a8c8aa321e), W64LIT(0xa3321d337173612a), W64LIT(0x50fbbbf4c0de3073), W64LIT(0x5a5d1510d84236c4), W64LIT(0xfd80864b0a69f80b), W64LIT(0x07de1046a762ae29), W64LIT(0xa6614a417d3d628b), W64LIT(0xd78a6605c12a4d40), W64LIT(0x67dfc24d27f68ed8), W64LIT(0xbc91c3f0f634c742), W64LIT(0xd05476436648e369), W64LIT(0x493aac6b4fed9476), W64LIT(0x12db606138b90ef6), W64LIT(0xa994b3d769ef679d), W64LIT(0x211097b07cc91fb8), W64LIT(0x30fa69ff404a1082), W64LIT(0x3c3e0e4750a21458), W64LIT(0x7504a22c1f4f802e), W64LIT(0x844043df05ce7cff), W64LIT(0xf0f838e9b5975095), W64LIT(0x7e1ed5d2a8c52add), W64LIT(0x90f9eae235037064), W64LIT(0x0662c95c0874026d), W64LIT(0x9416648a965bdf81), W64LIT(0xf69af1b5bde352f8), W64LIT(0x0d78bea2bffea89e), W64LIT(0x293b7e60cf79b487), W64LIT(0xd9c346897aeee412), W64LIT(0xfbe24f17021dfa66), W64LIT(0x1367b97b97afa2b2), W64LIT(0xab19f4e3c2c3ca15), W64LIT(0x48867571e0fb3832), W64LIT(0x93c874cc313971a8), W64LIT(0x79c0c5940fa784f4), W64LIT(0xcd7aefb44a23e889), W64LIT(0x439c028f577192c1), W64LIT(0x5be1cc0a77549a80), /* box 6 */ W64LIT(0x714d28d778656928), W64LIT(0xc88a7c6b84f64f7c), W64LIT(0xec43cac5ab89aaca), W64LIT(0x777fa38110dc16a3), W64LIT(0x0f7d5c87e4213b5c), W64LIT(0x73f051e5f3a1ef51), W64LIT(0xea714193c330d541), W64LIT(0x95e5f3dae016c4f3), W64LIT(0x63d3738095a0e173), W64LIT(0x9825d66f8ff379d6), W64LIT(0xe8cc38a148f45338), W64LIT(0xa840b0c025f06bb0), W64LIT(0x944135c35f748735), W64LIT(0x74661caa247ad31c), W64LIT(0xe7b16426acd56864), W64LIT(0xd1e689df6e6f0589), W64LIT(0xa73dec47c1d150ec), W64LIT(0x64453ecf427bdd3e), W64LIT(0x0ed99a9e5b43789a), W64LIT(0x7b1b402dc05be840), W64LIT(0x0dc025b56fe5bd25), W64LIT(0x3f183a284e22293a), W64LIT(0xa0aba108160a6ca1), W64LIT(0x46be033705bd4703), W64LIT(0x86df6e94b2b10f6e), W64LIT(0xa216d83a9dceead8), W64LIT(0x129e5b57edc5885b), W64LIT(0x7e3074509c445274), W64LIT(0x7d29cb7ba8e297cb), W64LIT(0x1611a9330eb871a9), W64LIT(0x486799a95efe3f99), W64LIT(0x9fb39b205828459b), W64LIT(0xd0424fc6d10d464f), W64LIT(0xe968feb8f79610fe), W64LIT(0x5d6f8fb164e08b8f), W64LIT(0xaafdc9f2ae34edc9), W64LIT(0x02bd79328bc48679), W64LIT(0x9b3c6944bb55bc69), W64LIT(0x6277b5992ac2a2b5), W64LIT(0x877ba88d0dd34ca8), W64LIT(0xfa5263f6a531db63), W64LIT(0x2e9fde54974164de), W64LIT(0xcda14816d8e9f548), W64LIT(0x675c81e476dd1881), W64LIT(0x2a102c30743c9d2c), W64LIT(0x37f32be07dd82e2b), W64LIT(0x256d70b7901da670), W64LIT(0x4ce86bcdbd83c66b), W64LIT(0x50afaa040b0536aa), W64LIT(0xef5a75ee9f2f6f75), W64LIT(0xb3913c4644ada73c), W64LIT(0x1187e47cd9634de4), W64LIT(0xc54a59deeb13f259), W64LIT(0x0000000000000000), W64LIT(0x01a4c619bf6243c6), W64LIT(0x90cec7a7bc097ec7), W64LIT(0xf94bdcdd91971edc), W64LIT(0x8e347f5c814b087f), W64LIT(0xc7f720ec60d77420), W64LIT(0x354e52d2f61ca852), W64LIT(0x34ea94cb497eeb94), W64LIT(0xae723b964d49143b), W64LIT(0xf48bf968fe72a3f9), W64LIT(0xfc60e8a0cd88a4e8), W64LIT(0x2909931b409a5893), W64LIT(0xbd48a6d81feedfa6), W64LIT(0x6cae2f077181da2f), W64LIT(0xad6b84bd79efd184), W64LIT(0x18c833ad55fb0933), W64LIT(0x204644cacc021c44), W64LIT(0x392ab17e269b56b1), W64LIT(0x14acd001857cf7d0), W64LIT(0x8abb8d386236f18d), W64LIT(0xeefeb3f7204d2cb3), W64LIT(0xf636805a75b62580), W64LIT(0x2bb4ea29cb5edeea), W64LIT(0xc653e6f5dfb537e6), W64LIT(0x8d2dc077b5edcdc0), W64LIT(0x31c1a0b6156151a0), W64LIT(0xf8ef1ac42ef55d1a), W64LIT(0xdbb0e125d65184e1), W64LIT(0x82509cf051ccf69c), W64LIT(0xe33e96424fa89196), W64LIT(0xdf3f1341352c7d13), W64LIT(0x8f90b9453e294bb9), W64LIT(0x1023226566010e22), W64LIT(0xa58095754a15d695), W64LIT(0x2c22a7661c85e2a7), W64LIT(0xe183ef70c46c17ef), W64LIT(0xafd6fd8ff22b57fd), W64LIT(0x471ac52ebadf04c5), W64LIT(0x4d4cadd402e185ad), W64LIT(0x916a01be036b3d01), W64LIT(0x28ad5502fff81b55), W64LIT(0x3657edf9c2ba6ded), W64LIT(0xd2ff36f45ac9c036), W64LIT(0xf1a0cd15a26d19cd), W64LIT(0xd90d98175d950298), W64LIT(0xf7924643cad46646), W64LIT(0xdd826a73bee8fb6a), W64LIT(0x9d0ee212d3ecc3e2), W64LIT(0xb6ba083b18b21d08), W64LIT(0x3da5431ac5e6af43), W64LIT(0x08eb11c833fa0711), W64LIT(0x052b347d5c1fba34), W64LIT(0x6fb7902c45271f90), W64LIT(0x133a9d4e52a7cb9d), W64LIT(0x6e135635fa455c56), W64LIT(0x725497fc4cc3ac97), W64LIT(0xf31db42729a99fb4), W64LIT(0x846217a639758917), W64LIT(0x4b7e26826a58fa26), W64LIT(0x235ffbe1f8a4d9fb), W64LIT(0xff79578bf92e6157), W64LIT(0xda14273c6933c727), W64LIT(0x8b1f4b21dd54b24b), W64LIT(0x9caa240b6c8e8024), W64LIT(0xc1c5abba086e0bab), W64LIT(0xde9bd5588a4e3ed5), W64LIT(0x2d86617fa3e7a161), W64LIT(0xbff5dfea942a59df), W64LIT(0x66f847fdc9bf5b47), W64LIT(0x3b97c84cad5fd0c8), W64LIT(0x3ebcfc31f1406afc), W64LIT(0xca3705590f32c905), W64LIT(0x24c9b6ae2f7fe5b6), W64LIT(0x408c88616d043888), W64LIT(0x93d7788c88afbb78), W64LIT(0x196cf5b4ea994af5), W64LIT(0x9a98af5d0437ffaf), W64LIT(0x8c89066e0a8f8e06), W64LIT(0xab590feb1156ae0f), W64LIT(0xd7d4028906d67a02), W64LIT(0xe4a8db0d9873addb), W64LIT(0xc378d28883aa8dd2), W64LIT(0x4ff1d4e6892503d4), W64LIT(0xd670c490b9b439c4), W64LIT(0x65e1f8d6fd199ef8), W64LIT(0xf2b9723e96cbdc72), W64LIT(0xb12c4574cf692145), W64LIT(0x569d215263bc4921), W64LIT(0x69851b7a2d9e601b), W64LIT(0x5e76309a50464e30), W64LIT(0x5fd2f683ef240df6), W64LIT(0xd8a95e0ee2f7415e), W64LIT(0xe29a505bf0cad250), W64LIT(0x96fc4cf1d4b0014c), W64LIT(0x8806f40ae9f277f4), W64LIT(0x53b6152f3fa3f315), W64LIT(0x1c47c1c9b686f0c1), W64LIT(0x80ede5c2da0870e5), W64LIT(0xd5697bbb8d12fc7b), W64LIT(0xfdc42eb972eae72e), W64LIT(0x0bf2aee3075cc2ae), W64LIT(0x22fb3df847c69a3d), W64LIT(0xbadeeb97c835e3eb), W64LIT(0xdc26ac6a018ab8ac), W64LIT(0xbcec60c1a08c9c60), W64LIT(0x4231f153e6c0bef1), W64LIT(0x337cd9849ea5d7d9), W64LIT(0x5b5d04e70c59f404), W64LIT(0x79a6391f4b9f6e39), W64LIT(0x5212d33680c1b0d3), W64LIT(0xb5a3b7102c14d8b7), W64LIT(0x7f94b249232611b2), W64LIT(0x17b56f2ab1da326f), W64LIT(0x59e07dd5879d727d), W64LIT(0xebd5878a7c529687), W64LIT(0xbb7a2d8e7757a02d), W64LIT(0x0319bf2b34a6c5bf), W64LIT(0x5ccb49a8db82c849), W64LIT(0x1de307d009e4b307), W64LIT(0x49c35fb0e19c7c5f), W64LIT(0x55849e79571a8c9e), W64LIT(0x7abf86347f39ab86), W64LIT(0x9273be9537cdf8be), W64LIT(0xe615a23f13b72ba2), W64LIT(0x6821dd6392fc23dd), W64LIT(0x5af9c2feb33bb7c2), W64LIT(0x06328b5668b97f8b), W64LIT(0x44037a058e79c17a), W64LIT(0x83f45ae9eeaeb55a), W64LIT(0x5739e74bdcde0ae7), W64LIT(0xfbf6a5ef1a5398a5), W64LIT(0xe50c1d142711ee1d), W64LIT(0x1a754a9fde3f8f4a), W64LIT(0x7802ff06f4fd2dff), W64LIT(0xf52f3f714110e03f), W64LIT(0x2674cf9ca4bb63cf), W64LIT(0x60caccaba10624cc), W64LIT(0xb088836d700b6283), W64LIT(0xa6992a5e7eb3132a), W64LIT(0xa9e476d99a922876), W64LIT(0x6b386248a65ae662), W64LIT(0xc2dc14913cc8ce14), W64LIT(0x76db6598afbe5565), W64LIT(0x32d81f9d21c7941f), W64LIT(0x21e282d373605f82), W64LIT(0xc0616da3b70c486d), W64LIT(0x616e0ab21e64670a), W64LIT(0x6d0ae91ecee399e9), W64LIT(0x27d009851bd92009), W64LIT(0xfedd9192464c2291), W64LIT(0x45a7bc1c311b82bc), W64LIT(0x54205860e878cf58), W64LIT(0xa10f6711a9682f67), W64LIT(0x9981107630913a10), W64LIT(0xede70cdc14ebe90c), W64LIT(0x70e9eecec7072aee), W64LIT(0x1f5e7ee28220357e), W64LIT(0x2f3b184d28232718), W64LIT(0x41284e78d2667b4e), W64LIT(0xa424536cf5779553), W64LIT(0xa3b21e2322aca91e), W64LIT(0x4e5512ff36474012), W64LIT(0x1efab8fb3d4276b8), W64LIT(0x89a2321356903432), W64LIT(0xcb93c340b0508ac3), W64LIT(0x306566afaa031266), W64LIT(0x4adae09bd53ab9e0), W64LIT(0xc92eba723b940cba), W64LIT(0x094fd7d18c9844d7), W64LIT(0xcc058e0f678bb68e), W64LIT(0xd4cdbda23270bfbd), W64LIT(0x0a5668fab83e8168), W64LIT(0x510b6c1db467756c), W64LIT(0xb86392a543f16592), W64LIT(0x048ff264e37df9f2), W64LIT(0x3a330e55123d930e), W64LIT(0xb235fa5ffbcfe4fa), W64LIT(0xb9c754bcfc932654), W64LIT(0x3c0185037a84ec85), W64LIT(0x0c64e3acd087fee3), W64LIT(0xe02729697b0e5429), W64LIT(0x07964d4fd7db3c4d), W64LIT(0x814923db656a3323), W64LIT(0x388e776799f91577), W64LIT(0x6a9ca4511938a5a4), W64LIT(0x1bd18c86615dcc8c), W64LIT(0xb407710993769b71), W64LIT(0x150816183a1eb416), W64LIT(0x4395374a59a2fd37), W64LIT(0xc4ee9fc75471b19f), W64LIT(0x5844bbcc38ff31bb), W64LIT(0xcf1c3124532d7331), W64LIT(0xb71ece22a7d05ece), W64LIT(0xaccf42a4c68d9242), W64LIT(0x97588ae86bd2428a), W64LIT(0x75c2dab39b1890da), W64LIT(0x9e175d39e74a065d), W64LIT(0xf0040b0c1d0f5a0b), W64LIT(0xceb8f73dec4f30f7), W64LIT(0xbe5119f32b481a19), W64LIT(0xd35bf0ede5ab83f0), W64LIT(0x7c8d0d621780d40d), W64LIT(0x85c6d1bf8617cad1), /* box 7 */ W64LIT(0xb1c742127b66f2a4), W64LIT(0xce916098d7a59fc1), W64LIT(0xc312ef8e2406fa70), W64LIT(0x956c7dced81403d5), W64LIT(0x5a0c9b2318dd9520), W64LIT(0xad0d57f51a480e8b), W64LIT(0xe7b9d05287740b01), W64LIT(0x0217f9ea2ed81268), W64LIT(0x4d7cff19f8cd3a06), W64LIT(0x44d1772e572b7b67), W64LIT(0xfb73c5b5e65af72e), W64LIT(0x91427aef84512705), W64LIT(0x0c720963e4cf6c85), W64LIT(0x87c398a0732d8117), W64LIT(0xa17f5e96fe87620e), W64LIT(0x50476c8b8e8fcf1d), W64LIT(0xcb4ee1cc9c8cb225), W64LIT(0x67b2304c91a8b59a), W64LIT(0x54696baad2caebcd), W64LIT(0xddcf03836bf01437), W64LIT(0x46c68ec479f3690f), W64LIT(0x8f9f96e2cba7c942), W64LIT(0xe1802e99f5e93db9), W64LIT(0x4e9a8086c179215a), W64LIT(0xf0c9b4686764a427), W64LIT(0xfd4a3b7e94c7c196), W64LIT(0xfcbbbd0b83abc8a2), W64LIT(0xebcbd93163bb6784), W64LIT(0xf9643c5fc882e546), W64LIT(0xc4da973041f7c5fc), W64LIT(0x1af3eb2c13b3ca97), W64LIT(0x6e1fb87b3e4ef4fb), W64LIT(0x5e229c024498b1f0), W64LIT(0xf516353c2c4d89c3), W64LIT(0xcc869972f97d8da9), W64LIT(0x8d886f08e57fdb2a), W64LIT(0x1cca15e7612efc2f), W64LIT(0x567e9240fc12f9a5), W64LIT(0x43190f9032da44eb), W64LIT(0xfeac44e1ad73daca), W64LIT(0x07c878be65f13f8c), W64LIT(0x618bce87e3358322), W64LIT(0xf895ba2adfeeec72), W64LIT(0x751dd5223a913758), W64LIT(0x59eae4bc21698e7c), W64LIT(0xff5dc294ba1fd3fe), W64LIT(0x03e67f9f39b41b5c), W64LIT(0x2292c117d1efc7c9), W64LIT(0x8a4017b6808ee4a6), W64LIT(0xd1bd0ae08f3f78b2), W64LIT(0x135e631bbc558bf6), W64LIT(0xee14586528924a60), W64LIT(0x8857ee5cae56f6ce), W64LIT(0x0000000000000000), W64LIT(0x0e65f089ca177eed), W64LIT(0x34132358269361db), W64LIT(0x15679dd0cec8bd4e), W64LIT(0x800be01e16dcbe9b), W64LIT(0x949dfbbbcf780ae1), W64LIT(0xe397d773db312fd1), W64LIT(0xedf227fa1126513c), W64LIT(0xb5e945332723d674), W64LIT(0x53a11314b73bd441), W64LIT(0x23634762c683cefd), W64LIT(0x4b4501d28a500cbe), W64LIT(0x473708b16e9f603b), W64LIT(0x1770643ae010af26), W64LIT(0xa746a05d8c1a54b6), W64LIT(0x90b3fc9a933d2e31), W64LIT(0x35e2a52d31ff68ef), W64LIT(0xab34a93e68d53833), W64LIT(0xd81082d720d939d3), W64LIT(0xb86aca25d480b3c5), W64LIT(0xdfd8fa694528065f), W64LIT(0x4f6b06f3d615286e), W64LIT(0x578f1435eb7ef091), W64LIT(0x9af80b32056f740c), W64LIT(0x92a40570bde53c59), W64LIT(0xdbf6fd48196d228f), W64LIT(0x1b026d5904dfc3a3), W64LIT(0x3c4f2d1a9e19298e), W64LIT(0xc8a89e53a538a979), W64LIT(0x991e74ad3cdb6f50), W64LIT(0x042e07215c4524d0), W64LIT(0x8e6e1097dccbc076), W64LIT(0xe071a8ece285348d), W64LIT(0xd784f42bfda24e0a), W64LIT(0x7d41db60821b7f0d), W64LIT(0x85d4614a5df5937f), W64LIT(0xbb8cb5baed34a899), W64LIT(0x40ff700f0b6e5fb7), W64LIT(0x2cf7319e1bf8b924), W64LIT(0x3a76d3d1ec841f36), W64LIT(0x4520f15b40477253), W64LIT(0xf138321d7008ad13), W64LIT(0x42e889e525b64ddf), W64LIT(0x65a5c9a6bf70a7f2), W64LIT(0x208538fdff37d5a1), W64LIT(0x410ef67a1c025683), W64LIT(0x18e412c63d6bd8ff), W64LIT(0x72d5ad9c5f6008d4), W64LIT(0x255ab9a9b41ef845), W64LIT(0x93558305aa89356d), W64LIT(0x70c2547671b81abc), W64LIT(0x3604dab2084b73b3), W64LIT(0x05df81544b292de4), W64LIT(0xf2de4d8249bcb64f), W64LIT(0x0bba71dd813e5309), W64LIT(0xa368a77cd05f7066), W64LIT(0x796fdc41de5e5bdd), W64LIT(0xec03a18f064a5808), W64LIT(0x085c0e42b88a4855), W64LIT(0x274d40439ac6ea2d), W64LIT(0x31cca20c6dba4c3f), W64LIT(0x322add93540e5763), W64LIT(0xb60f3aac1e97cd28), W64LIT(0x7cb05d1595777639), W64LIT(0xb036c4676c0afb90), W64LIT(0x0a4bf7a896525a3d), W64LIT(0x73242be9480c01e0), W64LIT(0x5bfd1d560fb19c14), W64LIT(0x7b7825abf08649b5), W64LIT(0xb7febcd909fbc41c), W64LIT(0x81fa666b01b0b7af), W64LIT(0xd25b757fb68b63ee), W64LIT(0x0d838f16f3a365b1), W64LIT(0x6a31bf5a620bd02b), W64LIT(0x26bcc6368daae319), W64LIT(0x9ed60c13592a50dc), W64LIT(0x581b62c936058748), W64LIT(0x9cc1f5f977f242b4), W64LIT(0x83ed9f812f68a5c7), W64LIT(0x74ec53572dfd3e6c), W64LIT(0xb3d0bbf855bee0cc), W64LIT(0xacfcd1800d2407bf), W64LIT(0x303d24797ad6450b), W64LIT(0x7a89a3dee7ea4081), W64LIT(0x69d7c0c55bbfcb77), W64LIT(0x770a2cc814492530), W64LIT(0x0f9476fcdd7b77d9), W64LIT(0xaeeb286a23fc15d7), W64LIT(0x2174be88e85bdc95), W64LIT(0xde297c1c52440f6b), W64LIT(0xd04c8c9598537186), W64LIT(0x2ee0c8743520ab4c), W64LIT(0x977b8424f6cc11bd), W64LIT(0x10b81c8485e190aa), W64LIT(0xa4a0dfc2b5ae4fea), W64LIT(0x98eff2d82bb76664), W64LIT(0xa8d2d6a15161236f), W64LIT(0xd4628bb4c4165556), W64LIT(0x682646b04cd3c243), W64LIT(0x2d06b7eb0c94b010), W64LIT(0x626db118da81987e), W64LIT(0x2928b0ca50d194c0), W64LIT(0x6df9c7e407faefa7), W64LIT(0x1681e24ff77ca612), W64LIT(0x4952f838a4881ed6), W64LIT(0x76fbaabd03252c04), W64LIT(0xc73ce8af7843dea0), W64LIT(0xe82da6ae5a0f7cd8), W64LIT(0xc10516640adee818), W64LIT(0x968a0251e1a01889), W64LIT(0x37f55cc71f277a87), W64LIT(0xe5ae29b8a9ac1969), W64LIT(0xcabf67b98be0bb11), W64LIT(0xf4e7b3493b2180f7), W64LIT(0xe9dc20db4d6375ec), W64LIT(0x639c376dcded914a), W64LIT(0x12afe56eab3982c2), W64LIT(0xc2e369fb336af344), W64LIT(0xa6b726289b765d82), W64LIT(0x14961ba5d9a4b47a), W64LIT(0xbc44cd0488c59715), W64LIT(0xd3aaf30aa1e76ada), W64LIT(0x28d936bf47bd9df4), W64LIT(0xaf1aae1f34901ce3), W64LIT(0x2f114e01224ca278), W64LIT(0xe648562790180235), W64LIT(0x24ab3fdca372f171), W64LIT(0x52509561a057dd75), W64LIT(0xc6cd6eda6f2fd794), W64LIT(0xa08ed8e3e9eb6b3a), W64LIT(0x09ad8837afe64161), W64LIT(0xbdb54b719fa99e21), W64LIT(0x8c79e97df213d21e), W64LIT(0xcf60e6edc0c996f5), W64LIT(0x5dc4e39d7d2caaac), W64LIT(0x11499af1928d999e), W64LIT(0x5fd31a7753f4b8c4), W64LIT(0x01f18675176c0934), W64LIT(0xc52b1145569bccc8), W64LIT(0x9f278a664e4659e8), W64LIT(0x3dbeab6f897520ba), W64LIT(0xa2992109c7337952), W64LIT(0x9b098d4712037d38), W64LIT(0xc9591826b254a04d), W64LIT(0x3b8755a4fbe81602), W64LIT(0xbe5334eea61d857d), W64LIT(0x51b6eafe99e3c629), W64LIT(0x191594b32a07d1cb), W64LIT(0x1f2c6a78589ae773), W64LIT(0x3fa95285a7ad32d2), W64LIT(0x5c3565e86a40a398), W64LIT(0xb2213d8d42d2e9f8), W64LIT(0xefe5de103ffe4354), W64LIT(0x4ab487a79d3c058a), W64LIT(0xcd771f07ee11849d), W64LIT(0xbfa2b29bb1718c49), W64LIT(0xba7d33cffa58a1ad), W64LIT(0x6fee3e0e2922fdcf), W64LIT(0x64544fd3a81caec6), W64LIT(0xd9e104a237b530e7), W64LIT(0xf32fcbf75ed0bf7b), W64LIT(0x3e58d4f0b0c13be6), W64LIT(0xb418c346304fdf40), W64LIT(0xaac52f4b7fb93107), W64LIT(0xdc3e85f67c9c1d03), W64LIT(0xd5930dc1d37a5c62), W64LIT(0x0639fecb729d36b8), W64LIT(0xc0f490111db2e12c), W64LIT(0x7ea7a4ffbbaf6451), W64LIT(0xf6f04aa315f9929f), W64LIT(0x6643b63986c4bcae), W64LIT(0x6c0841911096e693), W64LIT(0x8425e73f4a999a4b), W64LIT(0x7133d20366d41388), W64LIT(0x38612a3bc25c0d5e), W64LIT(0xb99b4c50c3ecbaf1), W64LIT(0x1d3b93927642f51b), W64LIT(0x7f56228aacc36d65), W64LIT(0x9d30738c609e4b80), W64LIT(0x48a37e4db3e417e2), W64LIT(0x8bb191c397e2ed92), W64LIT(0x2acecf5569658f9c), W64LIT(0xda077b3d0e012bbb), W64LIT(0xa55159b7a2c246de), W64LIT(0x33db5be643625e57), W64LIT(0x821c19f43804acf3), W64LIT(0x3990ac4ed530046a), W64LIT(0xd675725eeace473e), W64LIT(0x789e5a34c93252e9), W64LIT(0x86321ed564418823), W64LIT(0xfa8243c0f136fe1a), W64LIT(0xe45fafcdbec0105d), W64LIT(0x2b3f49207e0986a8), W64LIT(0xa92350d4460d2a5b), W64LIT(0x1eddec0d4ff6ee47), W64LIT(0x89a66829b93afffa), W64LIT(0x607a48f2f4598a16), W64LIT(0x6bc0392f7567d91f), W64LIT(0xea3a5f4474d76eb0), W64LIT(0x5598eddfc5a6e2f9), W64LIT(0x4c8d796cefa13332), W64LIT(0xf701ccd602959bab), W64LIT(0xe2665106cc5d26e5), }; const word64 SHARK::Dec::cbox[8][256] = { /* box 0 */ W64LIT(0xe6126af05e55aff3), W64LIT(0x4b6c893f310b0835), W64LIT(0xaa4c0e84ebfc8d57), W64LIT(0xfb9b5c7bf3b3090d), W64LIT(0x4508a6a9ccba5ce2), W64LIT(0xe5d1d2064dc6bde9), W64LIT(0x348343755288edde), W64LIT(0xb684505de46b250c), W64LIT(0xa8cede205a1e91e8), W64LIT(0x40b89b46f9fa6acc), W64LIT(0x8ee1ec1afab080ba), W64LIT(0xde77d6b7408e0a45), W64LIT(0x9a3e184c2e455802), W64LIT(0xbe93fad23f0955ef), W64LIT(0x3ae76ce3af39b909), W64LIT(0xad7ee3cf6f5ea7c6), W64LIT(0x8b51d1f5cff0b694), W64LIT(0x70ca8d8e3c43bf99), W64LIT(0xccdba7f8b2a8f6c9), W64LIT(0x4c5e6474b5a922a4), W64LIT(0x5d31adcd541ccc32), W64LIT(0x9b7f701e8c3456a7), W64LIT(0x2ac9cd08ecfd593a), W64LIT(0x8fa0844858c18e1f), W64LIT(0x32f0c66c745bc9ea), W64LIT(0xc58d6525cbbb888f), W64LIT(0x8c633cbe4b529c05), W64LIT(0xf2cd9ea68aa0774b), W64LIT(0x2cba4811ca2e7d0e), W64LIT(0xe2e33f4dc9649778), W64LIT(0xf4be1bbfac73537f), W64LIT(0x22de6787379f29d9), W64LIT(0x0956c2dd79137e46), W64LIT(0xe061efe978868bc7), W64LIT(0x1cc85ed90f97a85b), W64LIT(0x31337e9a67c8dbf0), W64LIT(0x360193d1e36af161), W64LIT(0x7fefca4a6383e5eb), W64LIT(0x8535fe633241e243), W64LIT(0xc3fee03ced68acbb), W64LIT(0x81c4abdea570dac8), W64LIT(0x67d6c12efb25753b), W64LIT(0xa4282112164dd980), W64LIT(0xcf181f0ea13be4d3), W64LIT(0xa98fb672f86f9f4d), W64LIT(0x5c70c59ff66dc297), W64LIT(0xb0f7d544c2b80138), W64LIT(0x0da79760ee2246cd), W64LIT(0x3740fb83411bffc4), W64LIT(0x24ade29e114c0ded), W64LIT(0xf858e48de0201b17), W64LIT(0x0e642f96fdb154d7), W64LIT(0xddb46e41531d185f), W64LIT(0x25ec8accb33d0348), W64LIT(0x0282d0a4b1e21cbf), W64LIT(0x1bfab3928b3582ca), W64LIT(0xaffc336bdebcbb79), W64LIT(0x35c22b27f0f9e37b), W64LIT(0x03c3b8f61393121a), W64LIT(0xb8e07fcb19da71db), W64LIT(0x99fda0ba3dd64a18), W64LIT(0xce59775c034aea76), W64LIT(0x49ee599b80e9148a), W64LIT(0xfe2b6194c6f33f23), W64LIT(0x4edcb4d0044b3e1b), W64LIT(0xd5a3c4ce887f68bc), W64LIT(0xdf36bee5e2ff04e0), W64LIT(0x171c4ca0c766caa2), W64LIT(0x0bd41279c8f162f9), W64LIT(0xe490ba54efb7b34c), W64LIT(0x5b4228d472cfe806), W64LIT(0x5355825ba9ad98e5), W64LIT(0x9f8e25a31b056e2c), W64LIT(0xcd9acfaa10d9f86c), W64LIT(0x88926903dc63a48e), W64LIT(0xb40680f9558939b3), W64LIT(0x239f0fd595ee277c), W64LIT(0xec8710db34d5c3af), W64LIT(0x87b72ec783a3fefc), W64LIT(0x632794936c144db0), W64LIT(0x46cb1e5fdf294ef8), W64LIT(0x83467b7a1492c677), W64LIT(0x9c4d9d5508967c36), W64LIT(0xd6607c389bec7aa6), W64LIT(0x165d24f26517c407), W64LIT(0xc4cc0d7769ca862a), W64LIT(0xcbe94ab3360adc58), W64LIT(0x847496319030ece6), W64LIT(0x7a5ff7a556c3d3c5), W64LIT(0xc03d58cafefbbea1), W64LIT(0x76b908971a909bad), W64LIT(0x2f79f0e7d9bd6f14), W64LIT(0x197863363ad79e75), W64LIT(0xda86830ad7bf32ce), W64LIT(0x5a034086d0bee6a3), W64LIT(0x97998f2cc0671ecf), W64LIT(0x552607428f7ebcd1), W64LIT(0x51d752ff184f845a), W64LIT(0xbb23c73d0a4963c1), W64LIT(0x2b88a55a4e8c579f), W64LIT(0xd80453ae665d2e71), W64LIT(0xee05c07f8537df10), W64LIT(0x423a4be248187673), W64LIT(0xcaa822e1947bd2fd), W64LIT(0x1abbdbc029448c6f), W64LIT(0x96d8e77e6216106a), W64LIT(0x6266fcc1ce654315), W64LIT(0x89d301517e12aa2b), W64LIT(0x730935782fd0ad83), W64LIT(0x8085c38c0701d46d), W64LIT(0x6b303e1cb7763d53), W64LIT(0x3f57510c9a798f27), W64LIT(0x4449cefb6ecb5247), W64LIT(0x48af31c922981a2f), W64LIT(0x98bcc8e89fa744bd), W64LIT(0x69b2eeb8069421ec), W64LIT(0xebb5fd90b077e93e), W64LIT(0x6a71564e150733f6), W64LIT(0x116fc9b9e1b5ee96), W64LIT(0x4a2de16d937a0690), W64LIT(0xb9a11799bbab7f7e), W64LIT(0x9368da9157562644), W64LIT(0x718be5dc9e32b13c), W64LIT(0xc82af2452599ce42), W64LIT(0xb547e8abf7f83716), W64LIT(0x33b1ae3ed62ac74f), W64LIT(0x799c4f534550c1df), W64LIT(0x3e16395e38088182), W64LIT(0x7c2c72bc7010f7f1), W64LIT(0xf38cf6f428d179ee), W64LIT(0xd29129850cdd422d), W64LIT(0x41f9f3145b8b6469), W64LIT(0x945a37dad3f40cd5), W64LIT(0x757ab061090389b7), W64LIT(0x6554118a4ac76984), W64LIT(0x7d6d1aeed261f954), W64LIT(0x01416852a2710ea5), W64LIT(0xb27505e0735a1d87), W64LIT(0x77f860c5b8e19508), W64LIT(0x78dd2701e721cf7a), W64LIT(0xe12087bbdaf78562), W64LIT(0x86f6469521d2f059), W64LIT(0xef44a82d2746d1b5), W64LIT(0xbc112a768eeb4950), W64LIT(0xc2bf886e4f19a21e), W64LIT(0x307216c8c5b9d555), W64LIT(0xc96b9a1787e8c0e7), W64LIT(0xa31acc5992eff311), W64LIT(0xa0d974af817ce10b), W64LIT(0xdcf50613f16c16fa), W64LIT(0xfca9b1307711239c), W64LIT(0x57a4d7e63e9ca06e), W64LIT(0xc64eddd3d8289a95), W64LIT(0xa25ba40b309efdb4), W64LIT(0x2e3898b57bcc61b1), W64LIT(0xf5ff73ed0e025dda), W64LIT(0xa6aaf1b6a7afc53f), W64LIT(0xd9453bfcc42c20d4), W64LIT(0x9d0cf507aae77293), W64LIT(0x290a75feff6e4b20), W64LIT(0xa7eb99e405decb9a), W64LIT(0xa1981cfd230defae), W64LIT(0x12ac714ff226fc8c), W64LIT(0x743bd833ab728712), W64LIT(0x6c02d35733d417c2), W64LIT(0xe9372d340195f581), W64LIT(0xf77da349bfe04165), W64LIT(0x68f386eaa4e52f49), W64LIT(0x211ddf71240c3bc3), W64LIT(0x13ed191d5057f229), W64LIT(0xe8764566a3e4fb24), W64LIT(0xf9198cdf425115b2), W64LIT(0xd013f921bd3f5e92), W64LIT(0x91ea0a35e6b43afb), W64LIT(0x0732ed4b84a22a91), W64LIT(0xeaf495c21206e79b), W64LIT(0x5214ea090bdc9640), W64LIT(0x0000000000000000), W64LIT(0xb3346db2d12b1322), W64LIT(0x0ce6ff324c534868), W64LIT(0xaebd5b397ccdb5dc), W64LIT(0x0a957a2b6a806c5c), W64LIT(0x1f0be62f1c04ba41), W64LIT(0x14dff456d4f5d8b8), W64LIT(0x58819022615cfa1c), W64LIT(0x05b03def3540362e), W64LIT(0xe3a2571f6b1599dd), W64LIT(0x9229b2c3f52728e1), W64LIT(0xba62af6fa8386d64), W64LIT(0x0673851926d32434), W64LIT(0x641579d8e8b66721), W64LIT(0x04f155bd9731388b), W64LIT(0x9ecf4df1b9746089), W64LIT(0x205cb723867d3566), W64LIT(0x102ea1eb43c4e033), W64LIT(0x3ba604b10d48b7ac), W64LIT(0x50963aadba3e8aff), W64LIT(0xac3f8b9dcd2fa963), W64LIT(0x7b1e9ff7f4b2dd60), W64LIT(0xf63ccb1b1d914fc0), W64LIT(0x7eaea218c1f2eb4e), W64LIT(0x5fb37d69e5fed08d), W64LIT(0x56e5bfb49cedaecb), W64LIT(0x2dfb2043685f73ab), W64LIT(0x61a54437ddf6510f), W64LIT(0x6fc16ba1204705d8), W64LIT(0xe75302a2fc24a156), W64LIT(0x3dd581a82b9b9398), W64LIT(0xdbc7eb5875ce3c6b), W64LIT(0x90ab626744c5345e), W64LIT(0x59c0f870c32df4b9), W64LIT(0x6697a97c59547b9e), W64LIT(0xfde8d962d5602d39), W64LIT(0xd3d041d7aeac4c88), W64LIT(0x5ef2153b478fde28), W64LIT(0xd4e2ac9c2a0e6619), W64LIT(0x1e4a8e7dbe75b4e4), W64LIT(0x72485d2a8da1a326), W64LIT(0x437b23b0ea6978d6), W64LIT(0x159e9c047684d61d), W64LIT(0x0f2547c45fc05a72), W64LIT(0xf10e265099336551), W64LIT(0x3c94e9fa89ea9d3d), W64LIT(0xbfd292809d785b4a), W64LIT(0x0817aa8fdb6270e3), W64LIT(0x60e42c657f875faa), W64LIT(0x18390b6498a690d0), W64LIT(0x478a760d7d58405d), W64LIT(0x284b1dac5d1f4585), W64LIT(0xb1b6bd1660c90f9d), W64LIT(0xd15291731f4e5037), W64LIT(0x4d1f0c2617d82c01), W64LIT(0xc70fb5817a599430), W64LIT(0x6d43bb0591a51967), W64LIT(0x6e8003f382360b7d), W64LIT(0x1d89368bade6a6fe), W64LIT(0x4f9ddc82a63a30be), W64LIT(0xedc6788996a4cd0a), W64LIT(0xab0d66d6498d83f2), W64LIT(0x54676f102d0fb274), W64LIT(0xc17c30985c8ab004), W64LIT(0x3865bc471edba5b6), W64LIT(0x3924d415bcaaab13), W64LIT(0x951b5f8871850270), W64LIT(0x8a10b9a76d81b831), W64LIT(0xbd5042242c9a47f5), W64LIT(0xa5694940b43cd725), W64LIT(0xff6a09c664823186), W64LIT(0x8d2254ece92392a0), W64LIT(0xb7c5380f461a2ba9), W64LIT(0x82071328b6e3c8d2), W64LIT(0xd721146a399d7403), W64LIT(0xfada342951c207a8), W64LIT(0x262f323aa0ae1152), W64LIT(0xf04f4e023b426bf4), W64LIT(0x276e5a6802df1ff7), /* box 1 */ W64LIT(0x3b4016dbfd16e203), W64LIT(0x9a7574c51174530a), W64LIT(0x90012e69c02ec8d3), W64LIT(0xf44580e3d780e076), W64LIT(0xf81dec2b49eca14b), W64LIT(0x26cae3e8a6e3d7ef), W64LIT(0x0962419e0c41f6ab), W64LIT(0x54d1eb4070ebd951), W64LIT(0x865e884b0188eec8), W64LIT(0xdf76067ea406fe8a), W64LIT(0x29849412e594fba0), W64LIT(0x461569896869c0f2), W64LIT(0xb5ddd6b3bbd6724e), W64LIT(0x0c586cc89e6c413d), W64LIT(0x6b0ad97054d904ea), W64LIT(0xa135621eec62b109), W64LIT(0x0eef7e47087ea461), W64LIT(0xfaaafea4dffe4417), W64LIT(0xe0ad344e80342331), W64LIT(0xab4138b23d382ad0), W64LIT(0x107390468e90fcff), W64LIT(0xbe0885a2218561b9), W64LIT(0xdbed22957d22c132), W64LIT(0x2251c7037fc7e857), W64LIT(0x33835ef8ba5e9c86), W64LIT(0xb3f1e0d7f4e0a8aa), W64LIT(0x3fdb32302432ddbb), W64LIT(0xa719547aa3546bed), W64LIT(0xe10c3df3cb3dab1f), W64LIT(0x17feaf9f8aafae35), W64LIT(0x9df84b1c154b01c0), W64LIT(0x8364a51d93a5595e), W64LIT(0x535cd49974d48b9b), W64LIT(0x01a109bd4b09882e), W64LIT(0xc4d0c529b0c51182), W64LIT(0x2e09abcbe1aba96a), W64LIT(0x1f3de7bccde7d0b0), W64LIT(0x9317355b1d35a5a1), W64LIT(0x6c87e6a950e65620), W64LIT(0x8910ffb142ffc287), W64LIT(0x40395fed275f1a16), W64LIT(0x7b794936da49f815), W64LIT(0xf269b68798b63a92), W64LIT(0xfd27c17ddbc116dd), W64LIT(0x8d8bdb5a9bdbfd3f), W64LIT(0x1ba6c35714c3ef08), W64LIT(0x6e30f426c6f4b37c), W64LIT(0x7fe26ddd036dc7ad), W64LIT(0x14e8b4ad57b4c347), W64LIT(0xb985ba7b25ba3373), W64LIT(0xe9cf75d08c75d59a), W64LIT(0x626898ee5898f241), W64LIT(0x5b9f9cba339cf51e), W64LIT(0xb250e96abfe92084), W64LIT(0x165fa622c1a6261b), W64LIT(0xf5e4895e9c896858), W64LIT(0xb76ac43c2dc49712), W64LIT(0x02b7128f9612e55c), W64LIT(0x1d8af5335bf535ec), W64LIT(0x36b973ae28732b10), W64LIT(0xa8572380e02347a2), W64LIT(0xf6f2926c4192052a), W64LIT(0x8c2ad2e7d0d27511), W64LIT(0xd32e6ab63a6abfb7), W64LIT(0xbd1e9e90fc9e0ccb), W64LIT(0x03161b32dd1b6d72), W64LIT(0x4dc03a98f23ad305), W64LIT(0x81d3b79205b7bc02), W64LIT(0x450372bbb572ad80), W64LIT(0x2d1fb0f93cb0c418), W64LIT(0x2a928f20388f96d2), W64LIT(0x721b08a8d6080ebe), W64LIT(0x92b63ce6563c2d8f), W64LIT(0xeb78675f1a6730c6), W64LIT(0x13658b74538b918d), W64LIT(0x428e4d62b14dff4a), W64LIT(0x88b1f60c09f64aa9), W64LIT(0x75963771d2375c74), W64LIT(0x7ad8408b9140703b), W64LIT(0x57c7f072adf0b423), W64LIT(0xe5971918121994a7), W64LIT(0x5666f9cfe6f93c0d), W64LIT(0x8f3cc9d50dc91863), W64LIT(0x1e9cee0186ee589e), W64LIT(0x8a06e4839fe4aff5), W64LIT(0xb824b3c66eb3bb5d), W64LIT(0xd1997839ac785aeb), W64LIT(0x6752b5b8cab545d7), W64LIT(0xb47cdf0ef0dffa60), W64LIT(0x949a0a82190af76b), W64LIT(0xc04be1c269e12e3a), W64LIT(0xfc86c8c090c89ef3), W64LIT(0xe3bb2f7c5d2f4e43), W64LIT(0x6aabd0cd1fd08cc4), W64LIT(0x2147dc31a2dc8525), W64LIT(0xca3fbb6eb8bbb5e3), W64LIT(0x48fa17ce60176493), W64LIT(0x6444ae8a17ae28a5), W64LIT(0x2b33869d73861efc), W64LIT(0xd0387184e771d2c5), W64LIT(0x7cf476efde76aadf), W64LIT(0x63c9915313917a6f), W64LIT(0xc929a05c65a0d891), W64LIT(0xda4c2b28362b491c), W64LIT(0xfe31da4f06da7baf), W64LIT(0xc1eae87f22e8a614), W64LIT(0x5c12a36337a3a7d4), W64LIT(0x18b0d865c9d8827a), W64LIT(0xe7200b97840b71fb), W64LIT(0x4bec0cfcbd0c09e1), W64LIT(0x0f4e77fa43772c4f), W64LIT(0x4c613325b9335b2b), W64LIT(0xf3c8bf3ad3bfb2bc), W64LIT(0x87ff81f64a8166e6), W64LIT(0xa38270917a705455), W64LIT(0x1911d1d882d10a54), W64LIT(0x44a27b06fe7b25ae), W64LIT(0x049b24ebd9243fb8), W64LIT(0xbb32a8f4b3a8d62f), W64LIT(0x91a027d48b2740fd), W64LIT(0x3d6c20bfb22038e7), W64LIT(0xe681022acf02f9d5), W64LIT(0xf17fadb545ad57e0), W64LIT(0xcc138d0af78d6f07), W64LIT(0x495b1e732b1eecbd), W64LIT(0x38560de9200d8f71), W64LIT(0xa9f62a3dab2acf8c), W64LIT(0x47b46034236048dc), W64LIT(0x8e9dc06846c0904d), W64LIT(0xaccc076b3907781a), W64LIT(0x32225745f15714a8), W64LIT(0xd4a3556f3e55ed7d), W64LIT(0xd7b54e5de34e800f), W64LIT(0xddc114f132141bd6), W64LIT(0x6d26ef141befde0e), W64LIT(0x85489379dc9383ba), W64LIT(0x0bd553119a5313f7), W64LIT(0x786f520407529567), W64LIT(0xcb9eb2d3f3b23dcd), W64LIT(0xa223792c3179dc7b), W64LIT(0x0a745aacd15a9bd9), W64LIT(0x710d139a0b1363cc), W64LIT(0x681cc24289c26998), W64LIT(0x1a07caea5fca6726), W64LIT(0x82c5aca0d8acd170), W64LIT(0x25dcf8da7bf8ba9d), W64LIT(0xc7c6de1b6dde7cf0), W64LIT(0xc35dfaf0b4fa4348), W64LIT(0xded70fc3ef0f76a4), W64LIT(0x504acfaba9cfe6e9), W64LIT(0xc571cc94fbcc99ac), W64LIT(0x5ea5b1eca1b14288), W64LIT(0xae7b15e4af159d46), W64LIT(0xc888a9e12ea950bf), W64LIT(0xf7539bd10a9b8d04), W64LIT(0x962d180d8f181237), W64LIT(0xe43610a559101c89), W64LIT(0x772125fe4425b928), W64LIT(0x84e99ac4979a0b94), W64LIT(0xc667d7a626d7f4de), W64LIT(0xefe343b4c3430f7e), W64LIT(0xd5025cd2755c6553), W64LIT(0xa6b85dc7e85de3c3), W64LIT(0xd61447e0a8470821), W64LIT(0x3e7a3b8d6f3b5595), W64LIT(0x52fddd243fdd03b5), W64LIT(0x8072be2f4ebe342c), W64LIT(0x12c482c9188219a3), W64LIT(0x9eee502ec8506cb2), W64LIT(0xad6d0ed6720ef034), W64LIT(0x59288e35a58e1042), W64LIT(0xe21a26c11626c66d), W64LIT(0x247df16730f132b3), W64LIT(0xf0dea4080ea4dfce), W64LIT(0x31344c772c4c79da), W64LIT(0x4f77281764283659), W64LIT(0x79ce5bb94c5b1d49), W64LIT(0x0000000000000000), W64LIT(0x73ba01159d018690), W64LIT(0x74373ecc993ed45a), W64LIT(0xbcbf972db79784e5), W64LIT(0x4ed621aa2f21be77), W64LIT(0xd95a301aeb30246e), W64LIT(0x9c5942a15e4289ee), W64LIT(0x37187a13637aa33e), W64LIT(0x276bea55edea5fc1), W64LIT(0x1c2bfc8e10fcbdc2), W64LIT(0xed54513b5551ea22), W64LIT(0x20e6d58ce9d50d0b), W64LIT(0x3ae11f66b61f6a2d), W64LIT(0x66f3bc0581bccdf9), W64LIT(0x2cbeb94477b94c36), W64LIT(0x99636ff7cc6f3e78), W64LIT(0x953b033f52037f45), W64LIT(0xb0e7fbe529fbc5d8), W64LIT(0x60df8a61ce8a171d), W64LIT(0x6f91fd9b8dfd3b52), W64LIT(0xaae0310f7631a2fe), W64LIT(0xbfa98c1f6a8ce997), W64LIT(0x8ba7ed3ed4ed27db), W64LIT(0x98c2664a8766b656), W64LIT(0x062c36644f36dae4), W64LIT(0x5570e2fd3be2517f), W64LIT(0xead96ee2516eb8e8), W64LIT(0x419856506c569238), W64LIT(0x23f0cebe34ce6079), W64LIT(0x309545ca6745f1f4), W64LIT(0x5a3e950778957d30), W64LIT(0x617e83dc85839f33), W64LIT(0xfb0bf71994f7cc39), W64LIT(0x3ccd2902f929b0c9), W64LIT(0x70ac1a27401aebe2), W64LIT(0xcea49f85619f8a5b), W64LIT(0x39f704546b04075f), W64LIT(0x0df96575d565c913), W64LIT(0x08c3482347487e85), W64LIT(0xd28f630b71633799), W64LIT(0xecf558861e58620c), W64LIT(0xc2fcf34dfff3cb66), W64LIT(0x978c11b0c4119a19), W64LIT(0x69bdcbffc2cbe1b6), W64LIT(0xba93a149f8a15e01), W64LIT(0x51ebc616e2c66ec7), W64LIT(0x078d3fd9043f52ca), W64LIT(0x58898788ee87986c), W64LIT(0x4a4d0541f60581cf), W64LIT(0xe86e7c6dc77c5db4), W64LIT(0xee424a09884a8750), W64LIT(0xcdb284b7bc84e729), W64LIT(0x65e5a7375ca7a08b), W64LIT(0x2fa8a276aaa22144), W64LIT(0xa0946ba3a76b3927), W64LIT(0xa5ae46f535468eb1), W64LIT(0x35af689cf5684662), W64LIT(0x28259dafae9d738e), W64LIT(0xcf0596382a960275), W64LIT(0xb6cbcd8166cd1f3c), W64LIT(0x7e43646048644f83), W64LIT(0x9bd47d785a7ddb24), W64LIT(0x432f44dffa447764), W64LIT(0x9f4f59938359e49c), W64LIT(0x7d557f52957f22f1), W64LIT(0x76802c430f2c3106), W64LIT(0xdc601d4c791d93f8), W64LIT(0x053a2d56922db796), W64LIT(0x11d299fbc59974d1), W64LIT(0xf9bce59602e52965), W64LIT(0xd8fb39a7a039ac40), W64LIT(0x340e6121be61ce4c), W64LIT(0x5f04b851eab8caa6), W64LIT(0x5db3aade7caa2ffa), W64LIT(0x1549bd101cbd4b69), W64LIT(0xff90d3f24dd3f381), W64LIT(0xafda1c59e41c1568), W64LIT(0xb146f25862f24df6), W64LIT(0xa40f4f487e4f069f), /* box 2 */ W64LIT(0xa1a35cebf8f0f94c), W64LIT(0x2c203d650f3f095d), W64LIT(0x1a2bdaee4084a2a7), W64LIT(0xd32404574d7bcc68), W64LIT(0xf785bea594a9adc4), W64LIT(0xf2eb54456206949c), W64LIT(0x3f5e334d0475ced1), W64LIT(0x5994299b835d1f60), W64LIT(0x785b7989ac204794), W64LIT(0x025da6a2cf461a41), W64LIT(0xdf1f3a71f01a901b), W64LIT(0x27284f018bb77637), W64LIT(0xe1955a6d694c5310), W64LIT(0x24a1baf2d9d261ac), W64LIT(0xe4fbb08d9fe36a48), W64LIT(0x8d83618ef7cff011), W64LIT(0x2ac72276abf5279e), W64LIT(0xf9e32621e68eebf6), W64LIT(0xbf323fb4d3f86f69), W64LIT(0xbb888605b8745beb), W64LIT(0x70dafe1e7acd2f65), W64LIT(0xd0adf1a41f1edbf3), W64LIT(0x1e91635f2b089625), W64LIT(0xee2791b8864818f8), W64LIT(0x99ce23e4c56c1484), W64LIT(0xf33f0714ff259946), W64LIT(0xbd6f99161cbe7528), W64LIT(0x9f293cf761a63a47), W64LIT(0xb80173f6ea114c70), W64LIT(0x6543ef25d54dc62a), W64LIT(0x39b92c5ea0bfe012), W64LIT(0x63a4f0367187e8e9), W64LIT(0x4c0d38a02cddf62f), W64LIT(0x07334c4239e92319), W64LIT(0x43bff375c3d9bdc7), W64LIT(0xca862b4a5f9a7954), W64LIT(0x5d2e902ae8d12be2), W64LIT(0x137e0e280b4ac78c), W64LIT(0xf162a1b630638307), W64LIT(0x55af17bd3e3c4313), W64LIT(0x358212781ddebc61), W64LIT(0x94214e93e52e452d), W64LIT(0xc18e592edb12063e), W64LIT(0xec7a371a490e02b9), W64LIT(0x4963d240da72cf77), W64LIT(0x41e255d70c9fa786), W64LIT(0xff0439324244c535), W64LIT(0x88ed8b6e0160c949), W64LIT(0x6c163be39e83a301), W64LIT(0xc534e09fb09e32bc), W64LIT(0x806c0cf9d78da1b8), W64LIT(0xdba583c09b96a499), W64LIT(0x746047af11411be7), W64LIT(0xf40c4b56c6ccba5f), W64LIT(0x6270a367eca4e533), W64LIT(0xd41748157492ef71), W64LIT(0xeff3c2e91b6b1522), W64LIT(0x0e66988472274632), W64LIT(0x534808ae9af66dd0), W64LIT(0x8231aa5b18cbbbf9), W64LIT(0xb2dd52c3f3ba3ec0), W64LIT(0xdd429cd33f5c8a5a), W64LIT(0x4e509e02e39bec6e), W64LIT(0x26fc1c5016947bed), W64LIT(0xd9f8256254d0bed8), W64LIT(0x0955d4c64bce652b), W64LIT(0x1610e4c8fde5fed4), W64LIT(0x6dc268b203a0aedb), W64LIT(0x2e7d9bc7c079131c), W64LIT(0xc3d3ff8c14541c7f), W64LIT(0xd64aeeb7bbd4f530), W64LIT(0xab7f7ddee15b8bfc), W64LIT(0x144d426a32a3e495), W64LIT(0x8e0a947da5aae78a), W64LIT(0x798f2ad831034a4e), W64LIT(0x3be48afc6ff9fa53), W64LIT(0x529c5bff07d5600a), W64LIT(0xbee66ce54edb62b3), W64LIT(0x931202d1dcc76634), W64LIT(0x50c1fd5dc8937a4b), W64LIT(0xa4cdb60b0e5fc014), W64LIT(0x57f2b11ff17a5952), W64LIT(0x47054ac4a8558945), W64LIT(0x5a1ddc68d13808fb), W64LIT(0x5cfac37b75f22638), W64LIT(0xc207acdd897711a5), W64LIT(0x289a84d464b33ddf), W64LIT(0xc05a0a7f46310be4), W64LIT(0xe6a6162f50a57009), W64LIT(0x06e71f13a4ca2ec3), W64LIT(0x5f733688279731a3), W64LIT(0xeb497b5870e721a0), W64LIT(0xb667eb7298360a42), W64LIT(0xe3c8fccfa60a4951), W64LIT(0xe772457ecd867dd3), W64LIT(0x6978d103682c9a59), W64LIT(0x0def6d77204251a9), W64LIT(0xc90fdeb90dff6ecf), W64LIT(0xd179a2f5823dd629), W64LIT(0x2fa9c8965d5a1ec6), W64LIT(0x81b85fa84aaeac62), W64LIT(0xdc96cf82a27f8780), W64LIT(0x602d05c523e2ff72), W64LIT(0x19a22f1d12e1b53c), W64LIT(0xe52fe3dc02c06792), W64LIT(0x58407aca1e7e12ba), W64LIT(0x61f95694bec1f2a8), W64LIT(0x48b781114751c2ad), W64LIT(0xaaab2e8f7c788626), W64LIT(0x04bab9b16b8c3482), W64LIT(0x2df46e34921c0487), W64LIT(0x1123a88ac40cddcd), W64LIT(0xc6bd156ce2fb2527), W64LIT(0x7f6835cb95c9648d), W64LIT(0x83e5f90a85e8b623), W64LIT(0x4f84cd537eb8e1b4), W64LIT(0x294ed785f9903005), W64LIT(0x1cccc5fde44e8c64), W64LIT(0xcb52781bc2b9748e), W64LIT(0x1d1896ac796d81be), W64LIT(0xb30901926e99331a), W64LIT(0xad9862cd4591a53f), W64LIT(0xc8db8de890dc6315), W64LIT(0x7bd28c7afe45500f), W64LIT(0x0adc213519ab72b0), W64LIT(0xa8f6882db33e9c67), W64LIT(0xb5ee1e81ca531dd9), W64LIT(0x201b0343b25e552e), W64LIT(0x4036068691bcaa5c), W64LIT(0xae11973e17f4b2a4), W64LIT(0x9efd6fa6fc85379d), W64LIT(0x33650d6bb91492a2), W64LIT(0x3a30d9adf2daf789), W64LIT(0x0c3b3e26bd615c73), W64LIT(0xf651edf4098aa01e), W64LIT(0x710ead4fe7ee22bf), W64LIT(0x3138abc9765288e3), W64LIT(0x9d749a55aee02006), W64LIT(0x6e4b9d4151c5b940), W64LIT(0x84d6b548bc01953a), W64LIT(0x360be78b4fbbabfa), W64LIT(0xa22aa918aa95eed7), W64LIT(0xedae644bd42d0f63), W64LIT(0x46d119953576849f), W64LIT(0x6497bc74486ecbf0), W64LIT(0xfbbe808329c8f1b7), W64LIT(0x4aea27b38817d8ec), W64LIT(0x5626e24e6c595488), W64LIT(0x056eeae0f6af3958), W64LIT(0x4558ec6667139304), W64LIT(0x448cbf37fa309ede), W64LIT(0x6f9fce10cce6b49a), W64LIT(0xa0770fba65d3f496), W64LIT(0x671e49871a0bdc6b), W64LIT(0xda71d09106b5a943), W64LIT(0x08818797d6ed68f1), W64LIT(0xa3fefa4937b6e30d), W64LIT(0xb080f4613cfc2481), W64LIT(0x763de10dde0701a6), W64LIT(0x4dd96bf1b1fefbf5), W64LIT(0x92c6518041e46bee), W64LIT(0x3456412980fdb1bb), W64LIT(0x981a70b5584f195e), W64LIT(0x3d0395efcb33d490), W64LIT(0xba5cd55425575631), W64LIT(0x4b3e74e21534d536), W64LIT(0x6af124f03a498dc2), W64LIT(0x7ebc669a08ea6957), W64LIT(0x30ecf898eb718539), W64LIT(0xa922db7c2e1d91bd), W64LIT(0x7a06df2b63665dd5), W64LIT(0xb154a730a1df295b), W64LIT(0xfc8dccc11021d2ae), W64LIT(0xcfe8c1aaa935400c), W64LIT(0x97a8bb60b74b52b6), W64LIT(0x18767c4c8fc2b8e6), W64LIT(0x9a47d6179709031f), W64LIT(0x0000000000000000), W64LIT(0xac4c319cd8b2a8e5), W64LIT(0xb9d520a7773241aa), W64LIT(0xdecb69206d399dc1), W64LIT(0x1f45300eb62b9bff), W64LIT(0x10f7fbdb592fd017), W64LIT(0x3e8a601c9956c30b), W64LIT(0x8502e619212298e0), W64LIT(0xf5d818075befb785), W64LIT(0x547b44eca31f4ec9), W64LIT(0x9ca0c90433c32ddc), W64LIT(0xe041093cf46f5eca), W64LIT(0xa69010a9c119da55), W64LIT(0xc769463d7fd828fd), W64LIT(0xc4e0b3ce2dbd3f66), W64LIT(0x2575e9a344f16c76), W64LIT(0x01d453519d230dda), W64LIT(0xfa6ad3d2b4ebfc6d), W64LIT(0xd5c31b44e9b1e2ab), W64LIT(0xf83775707bade62c), W64LIT(0xbcbbca47819d78f2), W64LIT(0xd79ebde626f7f8ea), W64LIT(0x5bc98f394c1b0521), W64LIT(0x2246a5e17d184f6f), W64LIT(0x12aa5d799669ca56), W64LIT(0x5ea765d9bab43c79), W64LIT(0x8939d83f9c43c493), W64LIT(0x32b15e3a24379f78), W64LIT(0xe914ddfabfa13be1), W64LIT(0x909bf7228ea271af), W64LIT(0x73530bed28a838fe), W64LIT(0xd2f05706d058c1b2), W64LIT(0xfed06a63df67c8ef), W64LIT(0xb43a4dd057701003), W64LIT(0xa519e55a937ccdce), W64LIT(0x75b414fe8c62163d), W64LIT(0xafc5c46f8ad7bf7e), W64LIT(0x2392f6b0e03b42b5), W64LIT(0x386d7f0f3d9cedc8), W64LIT(0x21cf50122f7d58f4), W64LIT(0x9b9385460a2a0ec5), W64LIT(0x5115ae0c55b07791), W64LIT(0x0fb2cbd5ef044be8), W64LIT(0xea9d2809edc42c7a), W64LIT(0xcc613459fb505797), W64LIT(0x426ba0245efab01d), W64LIT(0x1599113baf80e94f), W64LIT(0x7d3593695a8f7ecc), W64LIT(0x0389f5f35265179b), W64LIT(0x875f40bbee6482a1), W64LIT(0x95f51dc2780d48f7), W64LIT(0x7ce1c038c7ac7316), W64LIT(0xce3c92fb34164dd6), W64LIT(0xcdb5670866735a4d), W64LIT(0x8ab02dccce26d308), W64LIT(0x914fa47313817c75), W64LIT(0x8b647e9d5305ded2), W64LIT(0xd82c7633c9f3b302), W64LIT(0x728758bcb58b3524), W64LIT(0xe8c08eab2282363b), W64LIT(0x8fdec72c3889ea50), W64LIT(0x2b13712736d62a44), W64LIT(0x3cd7c6be5610d94a), W64LIT(0x37dfb4dad298a620), W64LIT(0x868b13ea73478f7b), W64LIT(0xb7b3b82305150798), W64LIT(0x0b08726484887f6a), W64LIT(0x1bff89bfdda7af7d), W64LIT(0x77e9b25c43240c7c), W64LIT(0xf0b6f2e7ad408edd), W64LIT(0x17c4b79960c6f30e), W64LIT(0x8c5732df6aecfdcb), W64LIT(0x68ac8252f50f9783), W64LIT(0x66ca1ad68728d1b1), W64LIT(0x6b2577a1a76a8018), W64LIT(0xe21caf9e3b29448b), W64LIT(0xa74443f85c3ad78f), W64LIT(0xfd599f908d02df74), W64LIT(0x967ce8312a685f6c), /* box 3 */ W64LIT(0xfa7b9775ba3af751), W64LIT(0x03ef98cb769c2d13), W64LIT(0x7191ce067072359e), W64LIT(0xbab18b6bff7516a8), W64LIT(0xe6e5ef4efbc1065e), W64LIT(0x7bec74a3b1d0dbf4), W64LIT(0x656b4fb907c31c4a), W64LIT(0x4e8520f99fc86304), W64LIT(0x8fd8df31d16dae58), W64LIT(0x90a93fc1e60a7244), W64LIT(0x30ad09f2b449cfc5), W64LIT(0x8453be7e91bb5b90), W64LIT(0x1d68a3d1c08feaad), W64LIT(0x5c54642504b410f6), W64LIT(0x8061383c8a9e3707), W64LIT(0xf9940fbecca6da42), W64LIT(0x46e1d97da982bbdf), W64LIT(0xfc50521656f7ad77), W64LIT(0x5e4d2704f35c2647), W64LIT(0x8bea5973ca48c2cf), W64LIT(0xd06323dfa34593bd), W64LIT(0x62b651306a7a5dce), W64LIT(0xa436b0714966d116), W64LIT(0x4f73fb131ebc78a6), W64LIT(0x92b07ce011e244f5), W64LIT(0x33429139c2d5e2d6), W64LIT(0xcee418c515565403), W64LIT(0xd7be3d56cefcd239), W64LIT(0x53ed83285f4789a9), W64LIT(0xf3e9b51b0d043428), W64LIT(0x20650e0fd8dd8a86), W64LIT(0xb6e7f4add21aa2e4), W64LIT(0x6d0fb63d3189c491), W64LIT(0x0da0a42cac1bafee), W64LIT(0x3f14eeffefba569a), W64LIT(0x13279f361a086850), W64LIT(0x9b225e8ea6dc878c), W64LIT(0x6684d772715f3159), W64LIT(0xa3ebaef824df9092), W64LIT(0xc499a260d4f4ba69), W64LIT(0xaa798c9693e153eb), W64LIT(0x50021be329dba4ba), W64LIT(0x949bb983fd2f1ed3), W64LIT(0xdfdac4d2f8b60ae2), W64LIT(0xf0062dd07b98193b), W64LIT(0xafbdd13e09b024de), W64LIT(0xb95e13a089e93bbb), W64LIT(0x649d945386b707e8), W64LIT(0xe4fcac6f0c2930ef), W64LIT(0x413cc7f4c43bfa5b), W64LIT(0x3b2668bdf49f3a0d), W64LIT(0xe50a77858d5d2b4d), W64LIT(0x05c45da89a517735), W64LIT(0x3ee235156ece4d38), W64LIT(0xfe491137a11f9bc6), W64LIT(0xb7112f47536eb946), W64LIT(0x07dd1e896db94184), W64LIT(0x1ab5bd58ad36ab29), W64LIT(0x8197e3d60bea2ca5), W64LIT(0xab8f577c12954849), W64LIT(0x9cff4007cb65c608), W64LIT(0xa00436335243bd81), W64LIT(0xfda689fcd783b6d5), W64LIT(0xccfd5be4e2be62b2), W64LIT(0x75a348446b575909), W64LIT(0x17151974012d04c7), W64LIT(0xfb8d4c9f3b4eecf3), W64LIT(0xac5249f57f2c09cd), W64LIT(0x9346a70a90965f57), W64LIT(0x043286421b256c97), W64LIT(0x27b81086b564cb02), W64LIT(0x3569545a2e18b8f0), W64LIT(0x6b24735edd449eb7), W64LIT(0x2193d5e559a99124), W64LIT(0xc7763aaba268977a), W64LIT(0xb0cc31ce3ed7f8c2), W64LIT(0xc939064c78ef1587), W64LIT(0x16e3c29e80591f65), W64LIT(0x5da2bfcf85c00b54), W64LIT(0x5990398d9ee567c3), W64LIT(0x67720c98f02b2afb), W64LIT(0x54309da132fec82d), W64LIT(0xeab39088d6aeb212), W64LIT(0x9682faa20ac72862), W64LIT(0xd38cbb14d5d9beae), W64LIT(0x4c9c63d8682055b5), W64LIT(0xd648e6bc4f88c99b), W64LIT(0xdc355c198e2a27f1), W64LIT(0x10c807fd6c944543), W64LIT(0x450e41b6df1e96cc), W64LIT(0x0b8b614f40d6f5c8), W64LIT(0xd27a60fe54ada50c), W64LIT(0x49583e70f2712280), W64LIT(0x8dc19c10268598e9), W64LIT(0x5866e2671f917c61), W64LIT(0x79f537824638ed45), W64LIT(0xc2b267033839e04f), W64LIT(0xcb20456d8f072336), W64LIT(0x2a18b4aa197f64ec), W64LIT(0xdbe84290e3936675), W64LIT(0x73888d27879a032f), W64LIT(0xe8aad3a9214684a3), W64LIT(0x6ee02ef64715e982), W64LIT(0xa996145de57d7ef8), W64LIT(0xc8cfdda6f99b0e25), W64LIT(0x062bc563eccd5a26), W64LIT(0x264ecb6c3410d0a0), W64LIT(0xb8a8c84a089d2019), W64LIT(0x7dc7b1c05d1d81d2), W64LIT(0xd5a77e773914e488), W64LIT(0x4b417d5105991431), W64LIT(0xf62de8b39755431d), W64LIT(0x993b1daf5134b13d), W64LIT(0x82787b1d7d7601b6), W64LIT(0xe321b2e66190716b), W64LIT(0xb5086c66a4868ff7), W64LIT(0x9ee603263c8df0b9), W64LIT(0x349f8fb0af6ca352), W64LIT(0x5b897aac690d5172), W64LIT(0x7c316a2adc699a70), W64LIT(0xd451a59db860ff2a), W64LIT(0x706715ecf1062e3c), W64LIT(0x838ea0f7fc021a14), W64LIT(0x57df056a4462e53e), W64LIT(0xcf12c32f94224fa1), W64LIT(0xed6e8e01bb17f396), W64LIT(0x915fe42b677e69e6), W64LIT(0x89f31a523da0f47e), W64LIT(0xe71334a47ab51dfc), W64LIT(0xa860cfb76409655a), W64LIT(0x9f10d8ccbdf9eb1b), W64LIT(0xef77cd204cffc527), W64LIT(0xf862d4544dd2c1e0), W64LIT(0x8a1c82994b3cd96d), W64LIT(0xae4b0ad488c43f7c), W64LIT(0x98cdc645d040aa9f), W64LIT(0x7fdef2e1aaf5b763), W64LIT(0x4717029728f6a07d), W64LIT(0x745593aeea2342ab), W64LIT(0xee8116cacd8bde85), W64LIT(0x727e56cd06ee188d), W64LIT(0x227c4d2e2f35bc37), W64LIT(0x977421488bb333c0), W64LIT(0xa21d7512a5ab8b30), W64LIT(0xbb4750817e010d0a), W64LIT(0x6cf96dd7b0fddf33), W64LIT(0x2801f78bee97525d), W64LIT(0x1c9e783b41fbf10f), W64LIT(0x9d099bed4a11ddaa), W64LIT(0x7a1aaf4930a4c056), W64LIT(0x32b44ad343a1f974), W64LIT(0x3cfb763499267b89), W64LIT(0xb2d572efc93fce73), W64LIT(0x63408adaeb0e466c), W64LIT(0xada4921ffe58126f), W64LIT(0x5fbbfcee72283de5), W64LIT(0x6ad2a8b45c308515), W64LIT(0x0c567fc62d6fb44c), W64LIT(0x956d62697c5b0571), W64LIT(0x25a153a7428cfdb3), W64LIT(0x150c5a55f6c53276), W64LIT(0xe2d7690ce0e46ac9), W64LIT(0xda1e997a62e77dd7), W64LIT(0xf5c27078e1c96e0e), W64LIT(0xc344bce9b94dfbed), W64LIT(0x60af12119d926b7f), W64LIT(0xa1f2edd9d337a623), W64LIT(0xcad69e870e733894), W64LIT(0x3770177bd9f08e41), W64LIT(0xa5c06b9bc812cab4), W64LIT(0x1f71e0f03767dc1c), W64LIT(0x44f89a5c5e6a8d6e), W64LIT(0x6159c9fb1ce670dd), W64LIT(0x8e2e04db5019b5fa), W64LIT(0x8805c1b8bcd4efdc), W64LIT(0xe138f1c7967847da), W64LIT(0x4ab7a6bb84ed0f93), W64LIT(0x0000000000000000), W64LIT(0x38c9f0768203171e), W64LIT(0x1b4366b22c42b08b), W64LIT(0x7803ec68c74cf6e7), W64LIT(0xec9855eb3a63e834), W64LIT(0xbe830d29e4507a3f), W64LIT(0x2dc5aa2374c62568), W64LIT(0xa62ff350be8ee7a7), W64LIT(0x764cd08f1dcb741a), W64LIT(0x8c3747faa7f1834b), W64LIT(0x0fb9e70d5bf3995f), W64LIT(0x55c6464bb38ad38f), W64LIT(0xf7db3359162158bf), W64LIT(0xd195f8352231881f), W64LIT(0x0992226eb73ec379), W64LIT(0x14fa81bf77b129d4), W64LIT(0x48aee59a73053922), W64LIT(0x2457884dc3f8e611), W64LIT(0xffbfcadd206b8064), W64LIT(0xb4feb78c25f29455), W64LIT(0x864afd5f66536d21), W64LIT(0x6f16f51cc661f220), W64LIT(0xde2c1f3879c21140), W64LIT(0x195a2593dbaa863a), W64LIT(0x2e2a32e8025a087b), W64LIT(0x432584d533d3ccea), W64LIT(0x2c3371c9f5b23eca), W64LIT(0xa7d928ba3ffafc05), W64LIT(0x42d35f3fb2a7d748), W64LIT(0x85a5659410cf4032), W64LIT(0x0864f984364ad8db), W64LIT(0xf21f6ef18c702f8a), W64LIT(0xf1f0f63afaec0299), W64LIT(0xd9f101b1147b50c4), W64LIT(0x2fdce902832e13d9), W64LIT(0x4d6ab832e9544e17), W64LIT(0xe0ce2a2d170c5c78), W64LIT(0x51f4c009a8afbf18), W64LIT(0x68cbeb95abd8b3a4), W64LIT(0xc15dffc84ea5cd5c), W64LIT(0x02194321f7e836b1), W64LIT(0x113edc17ede05ee1), W64LIT(0x521b58c2de33920b), W64LIT(0x9ad4856427a89c2e), W64LIT(0x5629de80c516fe9c), W64LIT(0x77ba0b659cbf6fb8), W64LIT(0x238a96c4ae41a795), W64LIT(0x12d144dc9b7c73f2), W64LIT(0xd807da5b950f4b66), W64LIT(0x3686cc91588495e3), W64LIT(0x18acfe795ade9d98), W64LIT(0x5a7fa146e8794ad0), W64LIT(0xc680e141231c8cd8), W64LIT(0x1e873b1ab613c7be), W64LIT(0xf434ab9260bd75ac), W64LIT(0xcd0b800e63ca7910), W64LIT(0xbc9a4e0813b84c8e), W64LIT(0x3d0dadde1852602b), W64LIT(0x40ca1c1e454fe1f9), W64LIT(0x0a7dbaa5c1a2ee6a), W64LIT(0x693d307f2aaca806), W64LIT(0x0e4f3ce7da8782fd), W64LIT(0xbd6c95e292cc572c), W64LIT(0x3ad0b35775eb21af), W64LIT(0x7e28290b2b81acc1), W64LIT(0x01f6dbea81741ba2), W64LIT(0x87bc26b5e7277683), W64LIT(0x393f2b9c03770cbc), W64LIT(0xddc387f30f5e3c53), W64LIT(0xeb454b6257daa9b0), W64LIT(0xb323a905484bd5d1), W64LIT(0xb13aea24bfa3e360), W64LIT(0x315bd218353dd467), W64LIT(0x2bee6f40980b7f4e), W64LIT(0xe95c0843a0329f01), W64LIT(0xc56f798a5580a1cb), W64LIT(0xbf75d6c36524619d), W64LIT(0x29f72c616fe349ff), W64LIT(0xc0ab2422cfd1d6fe), /* box 4 */ W64LIT(0x561fc423e957943c), W64LIT(0x014287ca69079288), W64LIT(0x2f086129dfcd1d21), W64LIT(0xc537d4aea044fd99), W64LIT(0xf1e8c3bfd7c8a457), W64LIT(0x2971998a5cdf9bfb), W64LIT(0x23fa649a2ce9e460), W64LIT(0x3aa9e9c356a6716a), W64LIT(0xd6efa4e7aa3d1708), W64LIT(0x705a24b1fda5b5eb), W64LIT(0x101e0ce2b170a9fc), W64LIT(0x7ca821020e814caa), W64LIT(0x0bc97ada1931ed13), W64LIT(0x34df1711778c59ce), W64LIT(0xd35020ef9226d2bf), W64LIT(0x575d43e9805006b4), W64LIT(0x91acebec9b1db840), W64LIT(0x549b3f423b5945d9), W64LIT(0x99a3ed9d3925163e), W64LIT(0x7917a50a369a891d), W64LIT(0xe372343cb4b6dc4e), W64LIT(0x8d40e2bdd949e8fd), W64LIT(0xcfbc29bed0728202), W64LIT(0x969794857108ac12), W64LIT(0xdd26de3db30cfa1b), W64LIT(0x115c8b28d8773b74), W64LIT(0xe9f9c92cc480a3d5), W64LIT(0x4dc8b21b4116d0d3), W64LIT(0x316093194f979c79), W64LIT(0x5124bb4a0342806e), W64LIT(0xb31408bcdef3cea8), W64LIT(0xc1cad76cf158aaa6), W64LIT(0x88ff66b5e1522d4a), W64LIT(0xa8c37e8476b28a47), W64LIT(0x15a188ea896b6c4b), W64LIT(0xa24883940684f5dc), W64LIT(0xda1da1545919ee49), W64LIT(0x22b8e35045ee76e8), W64LIT(0x6106af9925d28e9f), W64LIT(0xef80318f4792250f), W64LIT(0x663dd0f0cfc79acd), W64LIT(0x302214d326900ef1), W64LIT(0xdfa2255c61022bfe), W64LIT(0xe6cdb0348cad19f9), W64LIT(0x50663c806a4512e6), W64LIT(0x65fbac5b74ced9a0), W64LIT(0xc4755364c9436f11), W64LIT(0x8fc419dc0b473918), W64LIT(0x5c9439339961eba7), W64LIT(0x3f166dcb6ebdb4dd), W64LIT(0xba59890715ccf25e), W64LIT(0xf0aa4475becf36df), W64LIT(0x03c67cabbb09436d), W64LIT(0xb99ff5acaec5b133), W64LIT(0xf9e7c5ce75f00a29), W64LIT(0x6df4aa2ad6f677de), W64LIT(0xaeba8627f5a00c9d), W64LIT(0xa573fcfdec91e18e), W64LIT(0x7f6e5da9b5880fc7), W64LIT(0xca03adb6e86947b5), W64LIT(0x74a72773acb9e2d4), W64LIT(0x604428534cd51c17), W64LIT(0xf8a542041cf798a1), W64LIT(0x448533a08a29ec25), W64LIT(0x80f060c4436a8334), W64LIT(0x0db082799a236bc9), W64LIT(0xfa21b965cef94944), W64LIT(0x64b92b911dc94b28), W64LIT(0x7118a37b94a22763), W64LIT(0xaff801ed9ca79e15), W64LIT(0x1dae8e9b2b53c235), W64LIT(0x13d870490a79ea91), W64LIT(0x8a7b9dd4335cfcaf), W64LIT(0x1f2a75faf95d13d0), W64LIT(0xeec2b6452e95b787), W64LIT(0xc34e2c0d23567b43), W64LIT(0x47434f0b3120af48), W64LIT(0xa18eff3fbd8db6b1), W64LIT(0x98e16a57502284b6), W64LIT(0x37196bbacc851aa3), W64LIT(0x8e869e166240ab90), W64LIT(0x9fda153eba3790e4), W64LIT(0xf515c07d86d4f368), W64LIT(0x72dedfd02fab640e), W64LIT(0xe230b3f6ddb14ec6), W64LIT(0x97d5134f180f3e9a), W64LIT(0xe1f6cf5d66b80dab), W64LIT(0xe78f37fee5aa8b71), W64LIT(0xa30a045e6f836754), W64LIT(0x90ee6c26f21a2ac8), W64LIT(0xaa4785e5a4bc5ba2), W64LIT(0x4e0eceb0fa1f93be), W64LIT(0x94136fe4a3067df7), W64LIT(0x7b935e6be49458f8), W64LIT(0x9b2716fceb2bc7db), W64LIT(0x840d63061276d40b), W64LIT(0xed04caee959cf4ea), W64LIT(0xea3fb5877f89e0b8), W64LIT(0xb56df01f5de14872), W64LIT(0x4935b1d9100a87ec), W64LIT(0x82749ba5916452d1), W64LIT(0x58693af1c87dbc98), W64LIT(0x89bde17f8855bfc2), W64LIT(0x677f573aa6c00845), W64LIT(0xeb7d324d168e7230), W64LIT(0x0284fb61d20ed1e5), W64LIT(0xb190f3dd0cfd1f4d), W64LIT(0x684b2e22eeedb269), W64LIT(0x2bf562eb8ed14a1e), W64LIT(0xe0b448970fbf9f23), W64LIT(0x396f9568edaf3207), W64LIT(0x52e2c7e1b84bc303), W64LIT(0x77615bd817b0a1b9), W64LIT(0x7e2cda63dc8f9d4f), W64LIT(0xf22ebf146cc1e73a), W64LIT(0xc08850a6985f382e), W64LIT(0xd9dbddffe210ad24), W64LIT(0xbfe60d0f2dd737e9), W64LIT(0x9a659136822c5553), W64LIT(0x87cb1fada97f9766), W64LIT(0x4c8a35d12811425b), W64LIT(0x83361c6ff863c059), W64LIT(0xd212a725fb214037), W64LIT(0x9e9892f4d330026c), W64LIT(0x45c7b46ae32e7ead), W64LIT(0x5baf465a7374fff5), W64LIT(0xdc6459f7da0b6893), W64LIT(0xd46b5f867833c6ed), W64LIT(0x5dd6bef9f066792f), W64LIT(0xcb412a7c816ed53d), W64LIT(0x75e5a0b9c5be705c), W64LIT(0xf6d3bcd63dddb005), W64LIT(0xfb633eafa7fedbcc), W64LIT(0xd529d84c11345465), W64LIT(0xc9c5d11d536004d8), W64LIT(0xdb5f269e301e7cc1), W64LIT(0x86899867c07805ee), W64LIT(0x3d9296aabcb36538), W64LIT(0x2cce1d8264c45e4c), W64LIT(0x5aedc1901a736d7d), W64LIT(0x2e4ae6e3b6ca8fa9), W64LIT(0x1e68f230905a8158), W64LIT(0xdee0a2960805b976), W64LIT(0xcd38d2df027c53e7), W64LIT(0x6909a9e887ea20e1), W64LIT(0x24c11bf3c6fcf032), W64LIT(0x18110a9313480782), W64LIT(0xa7f7079c3e9f306b), W64LIT(0xd8995a358b173fac), W64LIT(0x854fe4cc7b714683), W64LIT(0xbd62f66effd9e60c), W64LIT(0x14e30f20e06cfec3), W64LIT(0x6e32d6816dff34b3), W64LIT(0x217e9ffbfee73585), W64LIT(0xc88756d73a679650), W64LIT(0x359d90db1e8bcb46), W64LIT(0x2645e09214f221d7), W64LIT(0x04fd03c2511c573f), W64LIT(0x739c581a46acf686), W64LIT(0xb0d2741765fa8dc5), W64LIT(0xa0cc78f5d48a2439), W64LIT(0x5e10c2524b6f3a42), W64LIT(0xe50bcc9f37a45a94), W64LIT(0x53a0402bd14c518b), W64LIT(0x413ab7a8b2322992), W64LIT(0x203c183197e0a70d), W64LIT(0xcc7a55156b7bc16f), W64LIT(0x4601c8c158273dc0), W64LIT(0xbea48ac544d0a561), W64LIT(0x638254f8f7dc5f7a), W64LIT(0xa6b580565798a2e3), W64LIT(0x3cd01160d5b4f7b0), W64LIT(0x8c026577b04e7a75), W64LIT(0x7ad1d9a18d93ca70), W64LIT(0x785522c05f9d1b95), W64LIT(0x5f5245982268a8ca), W64LIT(0x9551e82eca01ef7f), W64LIT(0x0000000000000000), W64LIT(0xbb1b0ecd7ccb60d6), W64LIT(0x094d81bbcb3f3cf6), W64LIT(0x28331e4035d80973), W64LIT(0xf7913b1c54da228d), W64LIT(0x6acfd5433ce3638c), W64LIT(0x1bd77638a84144ef), W64LIT(0x62c0d3329edbcdf2), W64LIT(0x81b2e70e2a6d11bc), W64LIT(0xd7ad232dc33a8580), W64LIT(0x05bf8408381bc5b7), W64LIT(0x33e468789d994d9c), W64LIT(0xfedcbaa79fe51e7b), W64LIT(0x4f4c497a93180136), W64LIT(0x073b7f69ea151452), W64LIT(0x0cf205b3f324f941), W64LIT(0x382d12a284a8a08f), W64LIT(0x1cec0951425450bd), W64LIT(0x55d9b888525ed751), W64LIT(0x6cb62de0bff1e556), W64LIT(0xd1d4db8e4028035a), W64LIT(0x25839c39affb62ba), W64LIT(0x4af3cd72ab03c481), W64LIT(0xa4317b3785967306), W64LIT(0x1a95f1f2c146d667), W64LIT(0x926a97472014fb2d), W64LIT(0xb7e90b7e8fef9997), W64LIT(0xcefeae74b975108a), W64LIT(0x3e54ea0107ba2655), W64LIT(0xd0965c44292f91d2), W64LIT(0xab05022fcdbbc92a), W64LIT(0xfd1ac60c24ec5d16), W64LIT(0xfc5841c64debcf9e), W64LIT(0xe4494b555ea3c81c), W64LIT(0xb6ab8cb4e6e80b1f), W64LIT(0x3beb6e093fa1e3e2), W64LIT(0xf36c38de05c675b2), W64LIT(0x9c1c6995013ed389), W64LIT(0x8b391a1e5a5b6e27), W64LIT(0xec464d24fc9b6662), W64LIT(0xad7cfa8c4ea94ff0), W64LIT(0x0f347918482dba2c), W64LIT(0x9d5eee5f68394101), W64LIT(0x7623dc127eb73331), W64LIT(0x32a6efb2f49edf14), W64LIT(0x2d8c9a480dc3ccc4), W64LIT(0xb2568f76b7f45c20), W64LIT(0x0e76fed2212a28a4), W64LIT(0x48773613790d1564), W64LIT(0x129af783637e7819), W64LIT(0x080f0671a238ae7e), W64LIT(0x365bec70a582882b), W64LIT(0x42fccb03093b6aff), W64LIT(0x0a8bfd1070367f9b), W64LIT(0xff9e3d6df6e28cf3), W64LIT(0xe8bb4ee6ad87315d), W64LIT(0xc7b32fcf724a2c7c), W64LIT(0xb8dd7266c7c223bb), W64LIT(0x9328108d491369a5), W64LIT(0x0679f8a3831286da), W64LIT(0x270767587df5b35f), W64LIT(0xa981f94e1fb518cf), W64LIT(0x6b8d528955e4f104), W64LIT(0x1667f44132622f26), W64LIT(0x2ab7e521e7d6d896), W64LIT(0xac3e7d4627aedd78), W64LIT(0x7deaa6c86786de22), W64LIT(0x1725738b5b65bdae), W64LIT(0x4bb14ab8c2045609), W64LIT(0x592bbd3ba17a2e10), W64LIT(0xc20cabc74a51e9cb), W64LIT(0x6f70514b04f8a63b), W64LIT(0xbc2071a496de7484), W64LIT(0x19538d597a4f950a), W64LIT(0xf45747b7efd361e0), W64LIT(0x43be4cc9603cf877), W64LIT(0xc6f1a8051b4dbef4), W64LIT(0xb42f77d534e6dafa), W64LIT(0x40783062db35bb1a), /* box 5 */ W64LIT(0xf5a96c292deb0a4e), W64LIT(0x211c9df6ee653c51), W64LIT(0x04de5ddcbeeef596), W64LIT(0xe1e5b06f7457c19f), W64LIT(0x74ca30f014a54fb6), W64LIT(0xc296f9f7c5457d85), W64LIT(0x7d4ee08a484d10b0), W64LIT(0xae87f2d0bf9b13ad), W64LIT(0x8df4bb480e89afb7), W64LIT(0x2d8b7a67d9a2d61e), W64LIT(0x0f3559c8bd712adb), W64LIT(0x541bc7312f013338), W64LIT(0x9ec4848b636d5164), W64LIT(0x952f809f60f28e29), W64LIT(0x28984d8cb28d6357), W64LIT(0xd4b5f1dfc38e361f), W64LIT(0x5674135f7076b373), W64LIT(0xb791a330042172ec), W64LIT(0xab94c53bd4b4a6e4), W64LIT(0xf17731f59305ffd8), W64LIT(0x39c7a621801e1dcf), W64LIT(0x20d1f7c13ba47c8e), W64LIT(0x5e3da912f95facaa), W64LIT(0xb1202a82e5b80731), W64LIT(0x13303fc36de4fed3), W64LIT(0x2e29c43e5314168a), W64LIT(0x861fbf5c0d1670fa), W64LIT(0x6458b16af3f771f1), W64LIT(0x3043765bdcf642c9), W64LIT(0x12fd55f4b825be0c), W64LIT(0x0a266e23d65e9f92), W64LIT(0x6595db5d2636312e), W64LIT(0x85bd010587a0b06e), W64LIT(0x9bd7b3600842e42d), W64LIT(0xaa59af0c0175e63b), W64LIT(0x240faa1d854a8918), W64LIT(0xf464061ef82a4a91), W64LIT(0x5c527d7ca6282ce1), W64LIT(0x03a2be598ab6c094), W64LIT(0x40571b7776bdf8e9), W64LIT(0xe4f687841f7874d6), W64LIT(0x115febad32937e98), W64LIT(0x5108f0da442e8671), W64LIT(0x9cab50e53c1ad12f), W64LIT(0x33e1c8025640825d), W64LIT(0x87d2d56bd8d73025), W64LIT(0xc0f92d999a32fdce), W64LIT(0x62e938d8126e042c), W64LIT(0x4a717554a0e3677b), W64LIT(0x0beb0414039fdf4d), W64LIT(0xd6da25b19cf9b654), W64LIT(0x55d6ad06fac073e7), W64LIT(0x632452efc7af44f3), W64LIT(0xb5fe775e5b56f2a7), W64LIT(0x892ae694b0675a21), W64LIT(0x7a32030f7c1525b2), W64LIT(0x5d9f174b73e96c3e), W64LIT(0xc35b93c010843d5a), W64LIT(0x373f95dee8ae77cb), W64LIT(0xfb515fd6455b604a), W64LIT(0xa9fb11558bc326af), W64LIT(0x22be23af64d3fcc5), W64LIT(0xa8367b625e026670), W64LIT(0xb8a4faf8b9505837), W64LIT(0x785dd7612362a5f9), W64LIT(0x588c20a018c6d977), W64LIT(0xea0eb47b77c81ed2), W64LIT(0xa6ce489d36b20c74), W64LIT(0x0c97e79137c7ea4f), W64LIT(0x7c838abd9d8c506f), W64LIT(0x57b97968a5b7f3ac), W64LIT(0x6c110b277ade6e28), W64LIT(0xc785ce1cae6ac8cc), W64LIT(0x1581b6718c7d8b0e), W64LIT(0x614b868198d8c4b8), W64LIT(0x27ad14440ffc498c), W64LIT(0xdb80a8177eff1cc4), W64LIT(0x472bf8f242e5cdeb), W64LIT(0x8a8858cd3ad19ab5), W64LIT(0xf60bd270a75dcada), W64LIT(0x43f5a52efc0b387d), W64LIT(0x6ddc6110af1f2ef7), W64LIT(0xf0ba5bc246c4bf07), W64LIT(0x6fb3b57ef068aebc), W64LIT(0x18db3bd76e7b219e), W64LIT(0x903cb7740bdd3b60), W64LIT(0x7bff6938a9d4656d), W64LIT(0xbdb7cd13d27fed7e), W64LIT(0x051337eb6b2fb549), W64LIT(0x77688ea99e138f22), W64LIT(0xd9ef7c7921889c8f), W64LIT(0x077ce38534583502), W64LIT(0xf318e59bcc727f93), W64LIT(0xb34ffeecbacf877a), W64LIT(0xe9ac0a22fd7ede46), W64LIT(0xfc2dbc5371035548), W64LIT(0x026fd46e5f77804b), W64LIT(0xe53bedb3cab93409), W64LIT(0xcc6eca08adf51781), W64LIT(0xe028da58a1968140), W64LIT(0x3a6518780aa8dd5b), W64LIT(0xce011e66f28297ca), W64LIT(0xa4a19cf369c58c3f), W64LIT(0xc5ea1a72f11d4887), W64LIT(0xc427704524dc0858), W64LIT(0x4238cf1929ca78a2), W64LIT(0x481ea13aff94e730), W64LIT(0xdf5ef5cbc011e952), W64LIT(0x80ae36eeec8f0527), W64LIT(0x5ae3f4ce47b1593c), W64LIT(0xcda3a03f7834575e), W64LIT(0x71d9071b7f8afaff), W64LIT(0xcadf43ba4c6c625c), W64LIT(0x1623082806cb4b9a), W64LIT(0x17ee621fd30a0b45), W64LIT(0x448946abc8530d7f), W64LIT(0x974054f13f850e62), W64LIT(0x73b6d37520fd7ab4), W64LIT(0xc8b097d4131be217), W64LIT(0x9f09eebcb6ac11bb), W64LIT(0x45442c9c1d924da0), W64LIT(0x1b79858ee4cde10a), W64LIT(0x0984d07a5ce85f06), W64LIT(0x4cc0fce6417a12a6), W64LIT(0x99b8670e57356466), W64LIT(0xad254c89352dd339), W64LIT(0x322ca2358381c282), W64LIT(0xcfcc74512743d715), W64LIT(0x6b6de8a24e865b2a), W64LIT(0xda4dc220ab3e5c1b), W64LIT(0x88e78ca365a61afe), W64LIT(0x939e092d816bfbf4), W64LIT(0xcb12298d99ad2283), W64LIT(0xeed0e9a7c926eb44), W64LIT(0x98750d3982f424b9), W64LIT(0xd5789be8164f76c0), W64LIT(0xbe15734a58c92dea), W64LIT(0x49d3cb0d2a55a7ef), W64LIT(0x67fa0f337941b165), W64LIT(0x8c39d17fdb48ef68), W64LIT(0x25c2c02a508bc9c7), W64LIT(0x349d2b876218b75f), W64LIT(0x70146d2caa4bba20), W64LIT(0x1c05660bd095d408), W64LIT(0xfe42683d2e74d503), W64LIT(0x9a1ad957dd83a4f2), W64LIT(0xf2d58fac19b33f4c), W64LIT(0x81635cd9394e45f8), W64LIT(0xb65cc907d1e03233), W64LIT(0xdd3121a59f666919), W64LIT(0x318e1c6c09370216), W64LIT(0x8b4532faef10da6a), W64LIT(0x191651e0bbba6141), W64LIT(0x3f762f9361876812), W64LIT(0xb96990cf6c9118e8), W64LIT(0xb4331d698e97b278), W64LIT(0xd822164ef449dc50), W64LIT(0x84706b325261f0b1), W64LIT(0x4eaf28881e0d92ed), W64LIT(0x69023ccc11f1db61), W64LIT(0x66376504ac80f1ba), W64LIT(0x0849ba4d89291fd9), W64LIT(0xff8f020afbb595dc), W64LIT(0x50c59aed91efc6ae), W64LIT(0x1dc80c3c055494d7), W64LIT(0x1e6ab2658fe25443), W64LIT(0x3d19fbfd3ef0e859), W64LIT(0xfa9c35e1909a2095), W64LIT(0x52aa4e83ce9846e5), W64LIT(0x419a7140a37cb836), W64LIT(0xa07fc12fd72b79a9), W64LIT(0x68cf56fbc4309bbe), W64LIT(0x01cd6a37d5c140df), W64LIT(0x9253631a54aabb2b), W64LIT(0xd06bac037d60c389), W64LIT(0x295527bb674c2388), W64LIT(0xd204786d221743c2), W64LIT(0x0000000000000000), W64LIT(0xf7c6b847729c8a05), W64LIT(0xdcfc4b924aa729c6), W64LIT(0xe38a64012b2041d4), W64LIT(0xb28294db6f0ec7a5), W64LIT(0x9d663ad2e9db91f0), W64LIT(0x91f1dd43de1c7bbf), W64LIT(0x6086ecb64d198467), W64LIT(0x59414a97cd0799a8), W64LIT(0xace826bee0ec93e6), W64LIT(0xa56cf6c4bc04cce0), W64LIT(0x727bb942f53c3a6b), W64LIT(0x6e7edf4925a9ee63), W64LIT(0x26607e73da3d0953), W64LIT(0xe75439dd95ceb442), W64LIT(0x7990bd56f6a3e526), W64LIT(0xecbf3dc996516b0f), W64LIT(0x76a5e49e4bd2cffd), W64LIT(0x968d3ec6ea444ebd), W64LIT(0x5b2e9ef9927019e3), W64LIT(0x6aa082959b471bf5), W64LIT(0xbb0644a133e698a3), W64LIT(0x830c88b76639c5b3), W64LIT(0xe2470e36fee1010b), W64LIT(0xb0ed40b5307947ee), W64LIT(0x355041b0b7d9f780), W64LIT(0x8e560511843f6f23), W64LIT(0x7f2134e4173a90fb), W64LIT(0x2af799e2edfae31c), W64LIT(0x4bbc1f63752227a4), W64LIT(0xf8f3e18fcfeda0de), W64LIT(0x0d5a8da6e206aa90), W64LIT(0x2c4610500c6396c1), W64LIT(0xde939ffc15d0a98d), W64LIT(0xaf4a98e76a5a5372), W64LIT(0x8f9b6f2651fe2ffc), W64LIT(0x36f2ffe93d6f3714), W64LIT(0x0ef833ff68b06a04), W64LIT(0xe69953ea400ff49d), W64LIT(0x23734998b112bc1a), W64LIT(0x3ebb45a4b44628cd), W64LIT(0x1ab4efb9310ca1d5), W64LIT(0x2fe4ae0986d55655), W64LIT(0xebc3de4ca2095e0d), W64LIT(0x536724b41b59063a), W64LIT(0x46e692c597248d34), W64LIT(0x2b3af3d5383ba3c3), W64LIT(0x3ba8724fdf699d84), W64LIT(0xc13447ae4ff3bd11), W64LIT(0x4d0d96d194bb5279), W64LIT(0xfde0d664a4c21597), W64LIT(0xd7174f864938f68b), W64LIT(0x7eec5ed3c2fbd024), W64LIT(0xbfd8197d8d086d35), W64LIT(0x4f6242bfcbccd232), W64LIT(0xa70322aae3734cab), W64LIT(0xa3dd7f765d9db93d), W64LIT(0x94e2eaa8b533cef6), W64LIT(0x144cdc4659bccbd1), W64LIT(0xc648a42b7bab8813), W64LIT(0xf93e8bb81a2ce001), W64LIT(0xbacb2e96e627d87c), W64LIT(0xbc7aa72407beada1), W64LIT(0xc97dfde3c6daa2c8), W64LIT(0xa1b2ab1802ea3976), W64LIT(0x1fa7d8525a23149c), W64LIT(0x75075ac7c1640f69), W64LIT(0xe861601528bf9e99), W64LIT(0xa2101541885cf9e2), W64LIT(0xef1d83901ce7ab9b), W64LIT(0x06b189b2e19975dd), W64LIT(0x380acc1655df5d10), W64LIT(0x1092819ae7523e47), W64LIT(0xd3c9125af7d6031d), W64LIT(0xd1a6c634a8a18356), W64LIT(0x5ff0c3252c9eec75), W64LIT(0x82c1e280b3f8856c), W64LIT(0xed7257fe43902bd0), W64LIT(0x3cd491caeb31a886), /* box 6 */ W64LIT(0x94af9eb6fad9e7df), W64LIT(0x9208ae5e03c94ddd), W64LIT(0x1d8de8d67158480b), W64LIT(0xfd093cd2ba147af8), W64LIT(0xa45ceb22e6597ccf), W64LIT(0x9bbde6e77bf113da), W64LIT(0xe4edf4b465fffe5c), W64LIT(0x7125622e4e8d2a2f), W64LIT(0x1791b81b8f68430d), W64LIT(0xb56a63d1902195c0), W64LIT(0xa980832b30d2ee67), W64LIT(0x4c0a7fb384862397), W64LIT(0xed58bc0d1dc7a05b), W64LIT(0x5955d7f05c4d0637), W64LIT(0xd2b9b1c8806fcf4e), W64LIT(0x06a730e8f910aa02), W64LIT(0xb8b60bd846aa0768), W64LIT(0x45bf370afcbe7d90), W64LIT(0x16f6b0375ec370a1), W64LIT(0x892276608b81afd4), W64LIT(0xdcccc1b5d0ec08e7), W64LIT(0xe856949162df5f58), W64LIT(0x82592e81a41a977e), W64LIT(0xac8eabb74fca1164), W64LIT(0xfac9041692afe356), W64LIT(0x3b882d75331ba3ba), W64LIT(0xa39cd3e6cee2e561), W64LIT(0xd077a190d7cca9e3), W64LIT(0x9c7dde23534a8a74), W64LIT(0x80973ed9f3b9f1d3), W64LIT(0xce535132209cb4e9), W64LIT(0xaa299b5fb6dabb66), W64LIT(0x2d7e9d426dd8d31b), W64LIT(0x8a8b6e140d89fad5), W64LIT(0x6ca88af83fd56224), W64LIT(0xf5db7c4713871753), W64LIT(0xeef1a4799bcff55a), W64LIT(0x76e55aea6636b381), W64LIT(0x8ee24ea4a33a367a), W64LIT(0x25acddd7c44bbeb0), W64LIT(0x9adaeecbaa5a2076), W64LIT(0x0e75707d5083c7a9), W64LIT(0x2bd9adaa94c87919), W64LIT(0x19e4c866dfeb84a4), W64LIT(0x129f9087f070bc0e), W64LIT(0xd9c2e929aff4f7e4), W64LIT(0x6f01928cb9dd3725), W64LIT(0x39463d2d64b8c517), W64LIT(0xebff8ce5e4d70a59), W64LIT(0xb40d6bfd418aa66c), W64LIT(0xf21b44833b3c8efd), W64LIT(0x3654457ce5903112), W64LIT(0x431807e205aed792), W64LIT(0xb10343613e92596f), W64LIT(0x0a1c50cdfe300b06), W64LIT(0x778252c6b79d802d), W64LIT(0x0cbb60250720a104), W64LIT(0xe1e3dc281ae7015f), W64LIT(0x0f1278518128f405), W64LIT(0x47712752ab1d1b3d), W64LIT(0xe24ac45c9cef545e), W64LIT(0x1ceae0faa0f37ba7), W64LIT(0x9814fe93fdf946db), W64LIT(0xec3fb421cc6c93f7), W64LIT(0x833e26ad75b1a4d2), W64LIT(0x6b68b23c176efb8a), W64LIT(0x4904572ffb9edc94), W64LIT(0x4bca4777ac3dba39), W64LIT(0x2762cd8f93e8d81d), W64LIT(0x9eb3ce7b04e9ecd9), W64LIT(0xc2e8311727bc15ed), W64LIT(0xea9884c9357c39f5), W64LIT(0xfc6e34fe6bbf4954), W64LIT(0x13f898ab21db8fa2), W64LIT(0xb7a47389c782f36d), W64LIT(0x7b3932e3b0bd2129), W64LIT(0xaf27b3c3c9c24465), W64LIT(0xb6c37ba51629c0c1), W64LIT(0x84fe1e695d0a3d7c), W64LIT(0x1a4dd01259e3d1a5), W64LIT(0xab4e9373677188ca), W64LIT(0x90c6be06546a2b70), W64LIT(0xf37c4cafea97bd51), W64LIT(0x647aca6d96460f8f), W64LIT(0x4ec46febd325453a), W64LIT(0x3e8605e94c035cb9), W64LIT(0x0ddc6809d68b92a8), W64LIT(0x8bec6638dc22c979), W64LIT(0x67d3d219104e5a8e), W64LIT(0x2abea58645634ab5), W64LIT(0x5b9bc7a80bee609a), W64LIT(0x936fa672d2627e71), W64LIT(0x7d9e020b49ad8b2b), W64LIT(0x5832dfdc8de6359b), W64LIT(0xc7e6198b58a4eaee), W64LIT(0xd41e8120797f654c), W64LIT(0xf4bc746bc22c24ff), W64LIT(0xe084d404cb4c32f3), W64LIT(0x48635f032a35ef38), W64LIT(0x8757061ddb02687d), W64LIT(0x522e8f1173d63e9d), W64LIT(0xbcdf2b68e819cbc7), W64LIT(0xbf76331c6e119ec6), W64LIT(0x08d24095a9936dab), W64LIT(0x728c7a5ac8857f2e), W64LIT(0xd110a9bc06679a4f), W64LIT(0x1f43f88e26fb2ea6), W64LIT(0xb2aa5b15b89a0c6e), W64LIT(0x4aad4f5b7d968995), W64LIT(0x9fd4c657d542df75), W64LIT(0x323d65cc4b23fdbd), W64LIT(0xc38f393bf6172641), W64LIT(0xa152c3be994183cc), W64LIT(0x9d1ad60f82e1b9d8), W64LIT(0xe744ecc0e3f7ab5d), W64LIT(0x38213501b513f6bb), W64LIT(0xade9a39b9e6122c8), W64LIT(0x37334d50343b02be), W64LIT(0x55eeb7d55b6da733), W64LIT(0x970686c27cd1b2de), W64LIT(0x427f0fced405e43e), W64LIT(0xc026214f701f7340), W64LIT(0x40b11f9683a68293), W64LIT(0x02ce105857a366ad), W64LIT(0x7e371a7fcfa5de2a), W64LIT(0xffc72c8aedb71c55), W64LIT(0x68c1aa489166ae8b), W64LIT(0xc68111a7890fd942), W64LIT(0x79f722bbe71e4784), W64LIT(0xd579890ca8d456e0), W64LIT(0x70426a029f261983), W64LIT(0xb0644b4def396ac3), W64LIT(0xdb0cf971f8579149), W64LIT(0x5489bff98ac6949f), W64LIT(0x046920b0aeb3ccaf), W64LIT(0x7cf90a279806b887), W64LIT(0x050e289c7f18ff03), W64LIT(0x651dc24147ed3c23), W64LIT(0x5e95ef3474f69f99), W64LIT(0x6dcf82d4ee7e5188), W64LIT(0x8f854688729105d6), W64LIT(0x81f036f52212c27f), W64LIT(0xb9d103f4970134c4), W64LIT(0x5349873da27d0d31), W64LIT(0x20a2f54bbb5341b3), W64LIT(0xf0d554db6c9fe850), W64LIT(0x07c038c428bb99ae), W64LIT(0x30f375941c809b10), W64LIT(0x3fe10dc59da86f15), W64LIT(0x46162f7e7ab62891), W64LIT(0xe623e4ec325c98f1), W64LIT(0xfea024a63c1c2ff9), W64LIT(0x349a5524b23357bf), W64LIT(0x35fd5d0863986413), W64LIT(0x96618eeead7a8172), W64LIT(0xcb5d79ae5f844bea), W64LIT(0x21c5fd676af8721f), W64LIT(0x5720a78d0ccec19e), W64LIT(0xf6726433958f4252), W64LIT(0x8d4b56d02532637b), W64LIT(0x24cbd5fb15e08d1c), W64LIT(0x3aef2559e2b09016), W64LIT(0x5afccf84da455336), W64LIT(0x51879765f5de6b9c), W64LIT(0x2917bdf2c36b1fb4), W64LIT(0xa7f5f356605129ce), W64LIT(0xc1412963a1b440ec), W64LIT(0x3d2f1d9dca0b09b8), W64LIT(0xa53be30e37f24f63), W64LIT(0x5ff2e718a55dac35), W64LIT(0xa2fbdbca1f49d6cd), W64LIT(0xf7156c1f442471fe), W64LIT(0x7a5e3acf61161285), W64LIT(0xca3a71828e2f7846), W64LIT(0x1b2ad83e8848e209), W64LIT(0xa8e78b07e179ddcb), W64LIT(0xef96ac554a64c6f6), W64LIT(0x0000000000000000), W64LIT(0x6013eadd38f5c320), W64LIT(0x3c4815b11ba03a14), W64LIT(0x09b548b978385e07), W64LIT(0x226ce513ecf0271e), W64LIT(0x63baf2a9befd9621), W64LIT(0x44d83f262d154e3c), W64LIT(0xcdfa4946a694e1e8), W64LIT(0x113688f37678e90f), W64LIT(0x859916458ca10ed0), W64LIT(0xc52809d30f078c43), W64LIT(0x4d6d779f552d103b), W64LIT(0x1e24f0a2f7501d0a), W64LIT(0x0167082cd1ab33ac), W64LIT(0x1438a06f0960160c), W64LIT(0xf9601c6214a7b657), W64LIT(0xa035cb9248eab060), W64LIT(0x50e09f4924755830), W64LIT(0xd7b79954ff77304d), W64LIT(0xe58afc98b454cdf0), W64LIT(0x03a9187486085501), W64LIT(0x62ddfa856f56a58d), W64LIT(0xc44f01ffdeacbfef), W64LIT(0x73eb7276192e4c82), W64LIT(0xd6d091782edc03e1), W64LIT(0xfbae0c3a4304d0fa), W64LIT(0x9973f6bf2c527577), W64LIT(0x105180dfa7d3daa3), W64LIT(0x2605c5a34243ebb1), W64LIT(0x91a1b62a85c118dc), W64LIT(0xc99369f608272d47), W64LIT(0x5d3cf740f2feca98), W64LIT(0xcf34591ef1378745), W64LIT(0xc8f461dad98c1eeb), W64LIT(0x0b7b58e12f9b38aa), W64LIT(0xe32dcc704d4467f2), W64LIT(0x754c429ee03ee680), W64LIT(0xd3deb9e451c4fce2), W64LIT(0x6e669aa068760489), W64LIT(0x66b4da35c1e56922), W64LIT(0x4fa367c7028e7696), W64LIT(0xba781b80110961c5), W64LIT(0x41d617ba520db13f), W64LIT(0x335a6de09a88ce11), W64LIT(0xdf65d9c156e45de6), W64LIT(0xcc9d416a773fd244), W64LIT(0x5c5bff6c2355f934), W64LIT(0x2870b5de12c02c18), W64LIT(0x155fa843d8cb25a0), W64LIT(0x78902a9736b57428), W64LIT(0xae40bbef186977c9), W64LIT(0x88457e4c5a2a9c78), W64LIT(0x6a0fba10c6c5c826), W64LIT(0x7f5012531e0eed86), W64LIT(0x8c2c5efcf49950d7), W64LIT(0x31947db8cd2ba8bc), W64LIT(0x2c19956ebc73e0b7), W64LIT(0x230bed3f3d5b14b2), W64LIT(0x69a6a26440cd9d27), W64LIT(0x86300e310aa95bd1), W64LIT(0xb3cd533969313fc2), W64LIT(0x1883c04a0e40b708), W64LIT(0xf1b25cf7bd34dbfc), W64LIT(0x2fb08d1a3a7bb5b6), W64LIT(0xd8a5e1057e5fc448), W64LIT(0xddabc99901473b4b), W64LIT(0xde02d1ed874f6e4a), W64LIT(0xbdb8234439b2f86b), W64LIT(0x5647afa1dd65f232), W64LIT(0x2ed78536ebd0861a), W64LIT(0xe9319cbdb3746cf4), W64LIT(0xa692fb7ab1fa1a62), W64LIT(0x742b4ab23195d52c), W64LIT(0x95c8969a2b72d473), W64LIT(0x6174e2f1e95ef08c), W64LIT(0xf807144ec50c85fb), W64LIT(0xbe113b30bfbaad6a), W64LIT(0xda6bf15d29fca2e5), W64LIT(0xbb1f13acc0a25269), /* box 7 */ W64LIT(0xc22b27f0f9e37bf9), W64LIT(0x93fad23f0955ef09), W64LIT(0x32ed4b84a22a91a2), W64LIT(0x3898b57bcc61b1cc), W64LIT(0x55825ba9ad98e5ad), W64LIT(0xb2eeb8069421ec94), W64LIT(0xc7eb5875ce3c6bce), W64LIT(0x4b1dac5d1f45851f), W64LIT(0xc16ba1204705d847), W64LIT(0xc5380f461a2ba91a), W64LIT(0xb908971a909bad90), W64LIT(0x303e1cb7763d5376), W64LIT(0xe6ff324c53486853), W64LIT(0x6d1aeed261f95461), W64LIT(0x0193d1e36af1616a), W64LIT(0x51d1f5cff0b694f0), W64LIT(0x29b2c3f52728e127), W64LIT(0x112a768eeb4950eb), W64LIT(0x8fb672f86f9f4d6f), W64LIT(0xf0c66c745bc9ea5b), W64LIT(0x3f8b9dcd2fa9632f), W64LIT(0x65bc471edba5b6db), W64LIT(0x4d9d5508967c3696), W64LIT(0x3a4be24818767318), W64LIT(0x2794936c144db014), W64LIT(0x2af2452599ce4299), W64LIT(0x4a8e7dbe75b4e475), W64LIT(0x9ddc82a63a30be3a), W64LIT(0xade29e114c0ded4c), W64LIT(0xd1d2064dc6bde9c6), W64LIT(0x7da349bfe04165e0), W64LIT(0x6b9a1787e8c0e7e8), W64LIT(0xa54437ddf6510ff6), W64LIT(0x2254ece92392a023), W64LIT(0x79f0e7d9bd6f14bd), W64LIT(0x57510c9a798f2779), W64LIT(0x346db2d12b13222b), W64LIT(0x54118a4ac76984c7), W64LIT(0xefca4a6383e5eb83), W64LIT(0xca8d8e3c43bf9943), W64LIT(0xfc336bdebcbb79bc), W64LIT(0x3e184c2e45580245), W64LIT(0xf495c21206e79b06), W64LIT(0xff73ed0e025dda02), W64LIT(0x4228d472cfe806cf), W64LIT(0xbcc8e89fa744bda7), W64LIT(0xab626744c5345ec5), W64LIT(0xb6bd1660c90f9dc9), W64LIT(0xb72ec783a3fefca3), W64LIT(0x8be5dc9e32b13c32), W64LIT(0x485d2a8da1a326a1), W64LIT(0xc6788996a4cd0aa4), W64LIT(0x40fb83411bffc41b), W64LIT(0x08a6a9ccba5ce2ba), W64LIT(0xf386eaa4e52f49e5), W64LIT(0x1acc5992eff311ef), W64LIT(0xa2571f6b1599dd15), W64LIT(0x44a82d2746d1b546), W64LIT(0x70c59ff66dc2976d), W64LIT(0x8d6525cbbb888fbb), W64LIT(0x963aadba3e8aff3e), W64LIT(0x7c30985c8ab0048a), W64LIT(0x607c389bec7aa6ec), W64LIT(0xa822e1947bd2fd7b), W64LIT(0x034086d0bee6a3be), W64LIT(0x66fcc1ce65431565), W64LIT(0xb37d69e5fed08dfe), W64LIT(0x2f323aa0ae1152ae), W64LIT(0x56c2dd79137e4613), W64LIT(0x31adcd541ccc321c), W64LIT(0xdff456d4f5d8b8f5), W64LIT(0xf9f3145b8b64698b), W64LIT(0x764566a3e4fb24e4), W64LIT(0x0cf507aae77293e7), W64LIT(0x59775c034aea764a), W64LIT(0xb89b46f9fa6accfa), W64LIT(0xe8d962d5602d3960), W64LIT(0x17aa8fdb6270e362), W64LIT(0x1c4ca0c766caa266), W64LIT(0x2de16d937a06907a), W64LIT(0x2547c45fc05a72c0), W64LIT(0x0fb5817a59943059), W64LIT(0x0680f9558939b389), W64LIT(0x16395e3808818208), W64LIT(0xac714ff226fc8c26), W64LIT(0xa9b1307711239c11), W64LIT(0xec8accb33d03483d), W64LIT(0x6c893f310b08350b), W64LIT(0xc4abdea570dac870), W64LIT(0xba4811ca2e7d0e2e), W64LIT(0xf155bd9731388b31), W64LIT(0xdd2701e721cf7a21), W64LIT(0xe94ab3360adc580a), W64LIT(0x23c73d0a4963c149), W64LIT(0x5cb723867d35667d), W64LIT(0x5042242c9a47f59a), W64LIT(0x198cdf425115b251), W64LIT(0x0a75feff6e4b206e), W64LIT(0xfda0ba3dd64a18d6), W64LIT(0xcede205a1e91e81e), W64LIT(0xd041d7aeac4c88ac), W64LIT(0xe42c657f875faa87), W64LIT(0x36bee5e2ff04e0ff), W64LIT(0x6fc9b9e1b5ee96b5), W64LIT(0x998f2cc0671ecf67), W64LIT(0xd301517e12aa2b12), W64LIT(0xaea218c1f2eb4ef2), W64LIT(0xda342951c207a8c2), W64LIT(0x61efe978868bc786), W64LIT(0x7f701e8c3456a734), W64LIT(0x0be62f1c04ba4104), W64LIT(0x9129850cdd422ddd), W64LIT(0xd6c12efb25753b25), W64LIT(0xe33f4dc964977864), W64LIT(0x1579d8e8b66721b6), W64LIT(0xf860c5b8e19508e1), W64LIT(0x7496319030ece630), W64LIT(0x88a55a4e8c579f8c), W64LIT(0xcf4df1b974608974), W64LIT(0x10b9a76d81b83181), W64LIT(0x0e26509933655133), W64LIT(0x43bb0591a51967a5), W64LIT(0x926903dc63a48e63), W64LIT(0x9c4f534550c1df50), W64LIT(0x3bd833ab72871272), W64LIT(0xa4d7e63e9ca06e9c), W64LIT(0xb46e41531d185f1d), W64LIT(0x126af05e55aff355), W64LIT(0x24d415bcaaab13aa), W64LIT(0x1e9ff7f4b2dd60b2), W64LIT(0x05c07f8537df1037), W64LIT(0x467b7a1492c67792), W64LIT(0x2087bbdaf78562f7), W64LIT(0x819022615cfa1c5c), W64LIT(0xcd9ea68aa0774ba0), W64LIT(0xa79760ee2246cd22), W64LIT(0x8343755288edde88), W64LIT(0x58e48de0201b1720), W64LIT(0x7216c8c5b9d555b9), W64LIT(0x372d340195f58195), W64LIT(0xa11799bbab7f7eab), W64LIT(0x9f0fd595ee277cee), W64LIT(0x676f102d0fb2740f), W64LIT(0x9e9c047684d61d84), W64LIT(0x49cefb6ecb5247cb), W64LIT(0xd41279c8f162f9f1), W64LIT(0x1f0c2617d82c01d8), W64LIT(0x97a97c59547b9e54), W64LIT(0xe76ce3af39b90939), W64LIT(0xc3b8f61393121a93), W64LIT(0x5ba40b309efdb49e), W64LIT(0xea0a35e6b43afbb4), W64LIT(0x5a37dad3f40cd5f4), W64LIT(0x14ea090bdc9640dc), W64LIT(0x5e6474b5a922a4a9), W64LIT(0xfee03ced68acbb68), W64LIT(0x071328b6e3c8d2e3), W64LIT(0x5302a2fc24a15624), W64LIT(0x85c38c0701d46d01), W64LIT(0x3d58cafefbbea1fb), W64LIT(0x84505de46b250c6b), W64LIT(0x642f96fdb154d7b1), W64LIT(0xbf886e4f19a21e19), W64LIT(0x02d35733d417c2d4), W64LIT(0x68da915756264456), W64LIT(0x8710db34d5c3afd5), W64LIT(0x0d66d6498d83f28d), W64LIT(0x7b23b0ea6978d669), W64LIT(0x1b5f887185027085), W64LIT(0x3ccb1b1d914fc091), W64LIT(0x0453ae665d2e715d), W64LIT(0xcb1e5fdf294ef829), W64LIT(0xf6469521d2f059d2), W64LIT(0xb03def3540362e40), W64LIT(0x633cbe4b529c0552), W64LIT(0xf7d544c2b80138b8), W64LIT(0x7ab061090389b703), W64LIT(0x0000000000000000), W64LIT(0xdba7f8b2a8f6c9a8), W64LIT(0x35fe633241e24341), W64LIT(0x21146a399d74039d), W64LIT(0xd581a82b9b93989b), W64LIT(0x0935782fd0ad83d0), W64LIT(0x5ff7a556c3d3c5c3), W64LIT(0xaf31c922981a2f98), W64LIT(0x90ba54efb7b34cb7), W64LIT(0x5291731f4e50374e), W64LIT(0xc0f870c32df4b92d), W64LIT(0x7ee3cf6f5ea7c65e), W64LIT(0xe07fcb19da71dbda), W64LIT(0x4eddd3d8289a9528), W64LIT(0x13f921bd3f5e923f), W64LIT(0xf50613f16c16fa6c), W64LIT(0x981cfd230defae0d), W64LIT(0x4c0e84ebfc8d57fc), W64LIT(0x82d0a4b1e21cbfe2), W64LIT(0x89368bade6a6fee6), W64LIT(0xd292809d785b4a78), W64LIT(0x47e8abf7f83716f8), W64LIT(0x8e25a31b056e2c05), W64LIT(0xd752ff184f845a4f), W64LIT(0xcc0d7769ca862aca), W64LIT(0x694940b43cd7253c), W64LIT(0x2ea1eb43c4e033c4), W64LIT(0xde6787379f29d99f), W64LIT(0x181f0ea13be4d33b), W64LIT(0x416852a2710ea571), W64LIT(0x62af6fa8386d6438), W64LIT(0xa0844858c18e1fc1), W64LIT(0x337e9a67c8dbf0c8), W64LIT(0x2c72bc7010f7f110), W64LIT(0xbd5b397ccdb5dccd), W64LIT(0xd8e77e6216106a16), W64LIT(0x86830ad7bf32cebf), W64LIT(0x4f4e023b426bf442), W64LIT(0xe5bfb49cedaecbed), W64LIT(0x8a760d7d58405d58), W64LIT(0xe2ac9c2a0e66190e), W64LIT(0xb5fd90b077e93e77), W64LIT(0xdcb4d0044b3e1b4b), W64LIT(0x453bfcc42c20d42c), W64LIT(0xed191d5057f22957), W64LIT(0xe1ec1afab080bab0), W64LIT(0xee599b80e9148ae9), W64LIT(0x2607428f7ebcd17e), W64LIT(0x5d24f26517c40717), W64LIT(0x6a09c66482318682), W64LIT(0xa604b10d48b7ac48), W64LIT(0xbe1bbfac73537f73), W64LIT(0x282112164dd9804d), W64LIT(0x7505e0735a1d875a), W64LIT(0x73851926d32434d3), W64LIT(0xd974af817ce10b7c), W64LIT(0xeb99e405decb9ade), W64LIT(0x9b5c7bf3b3090db3), W64LIT(0xfab3928b3582ca35), W64LIT(0x8003f382360b7d36), W64LIT(0x94e9fa89ea9d3dea), W64LIT(0xb1ae3ed62ac74f2a), W64LIT(0x9acfaa10d9f86cd9), W64LIT(0x390b6498a690d0a6), W64LIT(0xf2153b478fde288f), W64LIT(0x71564e150733f607), W64LIT(0xa3c4ce887f68bc7f), W64LIT(0xaaf1b6a7afc53faf), W64LIT(0x1ddf71240c3bc30c), W64LIT(0x77d6b7408e0a458e), W64LIT(0x2b6194c6f33f23f3), W64LIT(0xc9cd08ecfd593afd), W64LIT(0xc85ed90f97a85b97), W64LIT(0x8cf6f428d179eed1), W64LIT(0x957a2b6a806c5c80), W64LIT(0xbbdbc029448c6f44), W64LIT(0x7863363ad79e75d7), W64LIT(0x6e5a6802df1ff7df), W64LIT(0xfb2043685f73ab5f), }; NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/eprecomp.h0000755000000000000000000000605712414772654017571 0ustar rootroot#ifndef CRYPTOPP_EPRECOMP_H #define CRYPTOPP_EPRECOMP_H #include "integer.h" #include "algebra.h" #include NAMESPACE_BEGIN(CryptoPP) template class DL_GroupPrecomputation { public: typedef T Element; virtual bool NeedConversions() const {return false;} virtual Element ConvertIn(const Element &v) const {return v;} virtual Element ConvertOut(const Element &v) const {return v;} virtual const AbstractGroup & GetGroup() const =0; virtual Element BERDecodeElement(BufferedTransformation &bt) const =0; virtual void DEREncodeElement(BufferedTransformation &bt, const Element &P) const =0; }; template class DL_FixedBasePrecomputation { public: typedef T Element; virtual bool IsInitialized() const =0; virtual void SetBase(const DL_GroupPrecomputation &group, const Element &base) =0; virtual const Element & GetBase(const DL_GroupPrecomputation &group) const =0; virtual void Precompute(const DL_GroupPrecomputation &group, unsigned int maxExpBits, unsigned int storage) =0; virtual void Load(const DL_GroupPrecomputation &group, BufferedTransformation &storedPrecomputation) =0; virtual void Save(const DL_GroupPrecomputation &group, BufferedTransformation &storedPrecomputation) const =0; virtual Element Exponentiate(const DL_GroupPrecomputation &group, const Integer &exponent) const =0; virtual Element CascadeExponentiate(const DL_GroupPrecomputation &group, const Integer &exponent, const DL_FixedBasePrecomputation &pc2, const Integer &exponent2) const =0; }; template class DL_FixedBasePrecomputationImpl : public DL_FixedBasePrecomputation { public: typedef T Element; DL_FixedBasePrecomputationImpl() : m_windowSize(0) {} // DL_FixedBasePrecomputation bool IsInitialized() const {return !m_bases.empty();} void SetBase(const DL_GroupPrecomputation &group, const Element &base); const Element & GetBase(const DL_GroupPrecomputation &group) const {return group.NeedConversions() ? m_base : m_bases[0];} void Precompute(const DL_GroupPrecomputation &group, unsigned int maxExpBits, unsigned int storage); void Load(const DL_GroupPrecomputation &group, BufferedTransformation &storedPrecomputation); void Save(const DL_GroupPrecomputation &group, BufferedTransformation &storedPrecomputation) const; Element Exponentiate(const DL_GroupPrecomputation &group, const Integer &exponent) const; Element CascadeExponentiate(const DL_GroupPrecomputation &group, const Integer &exponent, const DL_FixedBasePrecomputation &pc2, const Integer &exponent2) const; private: void PrepareCascade(const DL_GroupPrecomputation &group, std::vector > &eb, const Integer &exponent) const; Element m_base; unsigned int m_windowSize; Integer m_exponentBase; // what base to represent the exponent in std::vector m_bases; // precalculated bases }; NAMESPACE_END #ifdef CRYPTOPP_MANUALLY_INSTANTIATE_TEMPLATES #include "eprecomp.cpp" #endif #endif armory-0.92.3/cppForSwig/cryptopp/pkcspad.h0000755000000000000000000000550612414772654017402 0ustar rootroot#ifndef CRYPTOPP_PKCSPAD_H #define CRYPTOPP_PKCSPAD_H #include "cryptlib.h" #include "pubkey.h" #ifdef CRYPTOPP_IS_DLL #include "sha.h" #endif NAMESPACE_BEGIN(CryptoPP) //! EME-PKCS1-v1_5 class PKCS_EncryptionPaddingScheme : public PK_EncryptionMessageEncodingMethod { public: static const char * StaticAlgorithmName() {return "EME-PKCS1-v1_5";} size_t MaxUnpaddedLength(size_t paddedLength) const; void Pad(RandomNumberGenerator &rng, const byte *raw, size_t inputLength, byte *padded, size_t paddedLength, const NameValuePairs ¶meters) const; DecodingResult Unpad(const byte *padded, size_t paddedLength, byte *raw, const NameValuePairs ¶meters) const; }; template class PKCS_DigestDecoration { public: static const byte decoration[]; static const unsigned int length; }; // PKCS_DigestDecoration can be instantiated with the following // classes as specified in PKCS#1 v2.0 and P1363a class SHA1; class RIPEMD160; class Tiger; class SHA224; class SHA256; class SHA384; class SHA512; namespace Weak1 { class MD2; class MD5; } // end of list #ifdef CRYPTOPP_IS_DLL CRYPTOPP_DLL_TEMPLATE_CLASS PKCS_DigestDecoration; CRYPTOPP_DLL_TEMPLATE_CLASS PKCS_DigestDecoration; CRYPTOPP_DLL_TEMPLATE_CLASS PKCS_DigestDecoration; CRYPTOPP_DLL_TEMPLATE_CLASS PKCS_DigestDecoration; CRYPTOPP_DLL_TEMPLATE_CLASS PKCS_DigestDecoration; #endif //! EMSA-PKCS1-v1_5 class CRYPTOPP_DLL PKCS1v15_SignatureMessageEncodingMethod : public PK_DeterministicSignatureMessageEncodingMethod { public: static const char * CRYPTOPP_API StaticAlgorithmName() {return "EMSA-PKCS1-v1_5";} size_t MinRepresentativeBitLength(size_t hashIdentifierSize, size_t digestSize) const {return 8 * (digestSize + hashIdentifierSize + 10);} void ComputeMessageRepresentative(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const; struct HashIdentifierLookup { template struct HashIdentifierLookup2 { static HashIdentifier Lookup() { return HashIdentifier(PKCS_DigestDecoration::decoration, PKCS_DigestDecoration::length); } }; }; }; //! PKCS #1 version 1.5, for use with RSAES and RSASS /*! Only the following hash functions are supported by this signature standard: \dontinclude pkcspad.h \skip can be instantiated \until end of list */ struct PKCS1v15 : public SignatureStandard, public EncryptionStandard { typedef PKCS_EncryptionPaddingScheme EncryptionMessageEncodingMethod; typedef PKCS1v15_SignatureMessageEncodingMethod SignatureMessageEncodingMethod; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/socketft.cpp0000755000000000000000000002766612414772654020145 0ustar rootroot// socketft.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "socketft.h" #ifdef SOCKETS_AVAILABLE #include "wait.h" #ifdef USE_BERKELEY_STYLE_SOCKETS #include #include #include #include #include #include #endif NAMESPACE_BEGIN(CryptoPP) #ifdef USE_WINDOWS_STYLE_SOCKETS const int SOCKET_EINVAL = WSAEINVAL; const int SOCKET_EWOULDBLOCK = WSAEWOULDBLOCK; typedef int socklen_t; #else const int SOCKET_EINVAL = EINVAL; const int SOCKET_EWOULDBLOCK = EWOULDBLOCK; #endif Socket::Err::Err(socket_t s, const std::string& operation, int error) : OS_Error(IO_ERROR, "Socket: " + operation + " operation failed with error " + IntToString(error), operation, error) , m_s(s) { } Socket::~Socket() { if (m_own) { try { CloseSocket(); } catch (...) { } } } void Socket::AttachSocket(socket_t s, bool own) { if (m_own) CloseSocket(); m_s = s; m_own = own; SocketChanged(); } socket_t Socket::DetachSocket() { socket_t s = m_s; m_s = INVALID_SOCKET; SocketChanged(); return s; } void Socket::Create(int nType) { assert(m_s == INVALID_SOCKET); m_s = socket(AF_INET, nType, 0); CheckAndHandleError("socket", m_s); m_own = true; SocketChanged(); } void Socket::CloseSocket() { if (m_s != INVALID_SOCKET) { #ifdef USE_WINDOWS_STYLE_SOCKETS CancelIo((HANDLE) m_s); CheckAndHandleError_int("closesocket", closesocket(m_s)); #else CheckAndHandleError_int("close", close(m_s)); #endif m_s = INVALID_SOCKET; SocketChanged(); } } void Socket::Bind(unsigned int port, const char *addr) { sockaddr_in sa; memset(&sa, 0, sizeof(sa)); sa.sin_family = AF_INET; if (addr == NULL) sa.sin_addr.s_addr = htonl(INADDR_ANY); else { unsigned long result = inet_addr(addr); if (result == -1) // Solaris doesn't have INADDR_NONE { SetLastError(SOCKET_EINVAL); CheckAndHandleError_int("inet_addr", SOCKET_ERROR); } sa.sin_addr.s_addr = result; } sa.sin_port = htons((u_short)port); Bind((sockaddr *)&sa, sizeof(sa)); } void Socket::Bind(const sockaddr *psa, socklen_t saLen) { assert(m_s != INVALID_SOCKET); // cygwin workaround: needs const_cast CheckAndHandleError_int("bind", bind(m_s, const_cast(psa), saLen)); } void Socket::Listen(int backlog) { assert(m_s != INVALID_SOCKET); CheckAndHandleError_int("listen", listen(m_s, backlog)); } bool Socket::Connect(const char *addr, unsigned int port) { assert(addr != NULL); sockaddr_in sa; memset(&sa, 0, sizeof(sa)); sa.sin_family = AF_INET; sa.sin_addr.s_addr = inet_addr(addr); if (sa.sin_addr.s_addr == -1) // Solaris doesn't have INADDR_NONE { hostent *lphost = gethostbyname(addr); if (lphost == NULL) { SetLastError(SOCKET_EINVAL); CheckAndHandleError_int("gethostbyname", SOCKET_ERROR); } sa.sin_addr.s_addr = ((in_addr *)lphost->h_addr)->s_addr; } sa.sin_port = htons((u_short)port); return Connect((const sockaddr *)&sa, sizeof(sa)); } bool Socket::Connect(const sockaddr* psa, socklen_t saLen) { assert(m_s != INVALID_SOCKET); int result = connect(m_s, const_cast(psa), saLen); if (result == SOCKET_ERROR && GetLastError() == SOCKET_EWOULDBLOCK) return false; CheckAndHandleError_int("connect", result); return true; } bool Socket::Accept(Socket& target, sockaddr *psa, socklen_t *psaLen) { assert(m_s != INVALID_SOCKET); socket_t s = accept(m_s, psa, psaLen); if (s == INVALID_SOCKET && GetLastError() == SOCKET_EWOULDBLOCK) return false; CheckAndHandleError("accept", s); target.AttachSocket(s, true); return true; } void Socket::GetSockName(sockaddr *psa, socklen_t *psaLen) { assert(m_s != INVALID_SOCKET); CheckAndHandleError_int("getsockname", getsockname(m_s, psa, psaLen)); } void Socket::GetPeerName(sockaddr *psa, socklen_t *psaLen) { assert(m_s != INVALID_SOCKET); CheckAndHandleError_int("getpeername", getpeername(m_s, psa, psaLen)); } unsigned int Socket::Send(const byte* buf, size_t bufLen, int flags) { assert(m_s != INVALID_SOCKET); int result = send(m_s, (const char *)buf, UnsignedMin(INT_MAX, bufLen), flags); CheckAndHandleError_int("send", result); return result; } unsigned int Socket::Receive(byte* buf, size_t bufLen, int flags) { assert(m_s != INVALID_SOCKET); int result = recv(m_s, (char *)buf, UnsignedMin(INT_MAX, bufLen), flags); CheckAndHandleError_int("recv", result); return result; } void Socket::ShutDown(int how) { assert(m_s != INVALID_SOCKET); int result = shutdown(m_s, how); CheckAndHandleError_int("shutdown", result); } void Socket::IOCtl(long cmd, unsigned long *argp) { assert(m_s != INVALID_SOCKET); #ifdef USE_WINDOWS_STYLE_SOCKETS CheckAndHandleError_int("ioctlsocket", ioctlsocket(m_s, cmd, argp)); #else CheckAndHandleError_int("ioctl", ioctl(m_s, cmd, argp)); #endif } bool Socket::SendReady(const timeval *timeout) { fd_set fds; FD_ZERO(&fds); FD_SET(m_s, &fds); int ready; if (timeout == NULL) ready = select((int)m_s+1, NULL, &fds, NULL, NULL); else { timeval timeoutCopy = *timeout; // select() modified timeout on Linux ready = select((int)m_s+1, NULL, &fds, NULL, &timeoutCopy); } CheckAndHandleError_int("select", ready); return ready > 0; } bool Socket::ReceiveReady(const timeval *timeout) { fd_set fds; FD_ZERO(&fds); FD_SET(m_s, &fds); int ready; if (timeout == NULL) ready = select((int)m_s+1, &fds, NULL, NULL, NULL); else { timeval timeoutCopy = *timeout; // select() modified timeout on Linux ready = select((int)m_s+1, &fds, NULL, NULL, &timeoutCopy); } CheckAndHandleError_int("select", ready); return ready > 0; } unsigned int Socket::PortNameToNumber(const char *name, const char *protocol) { int port = atoi(name); if (IntToString(port) == name) return port; servent *se = getservbyname(name, protocol); if (!se) throw Err(INVALID_SOCKET, "getservbyname", SOCKET_EINVAL); return ntohs(se->s_port); } void Socket::StartSockets() { #ifdef USE_WINDOWS_STYLE_SOCKETS WSADATA wsd; int result = WSAStartup(0x0202, &wsd); if (result != 0) throw Err(INVALID_SOCKET, "WSAStartup", result); #endif } void Socket::ShutdownSockets() { #ifdef USE_WINDOWS_STYLE_SOCKETS int result = WSACleanup(); if (result != 0) throw Err(INVALID_SOCKET, "WSACleanup", result); #endif } int Socket::GetLastError() { #ifdef USE_WINDOWS_STYLE_SOCKETS return WSAGetLastError(); #else return errno; #endif } void Socket::SetLastError(int errorCode) { #ifdef USE_WINDOWS_STYLE_SOCKETS WSASetLastError(errorCode); #else errno = errorCode; #endif } void Socket::HandleError(const char *operation) const { int err = GetLastError(); throw Err(m_s, operation, err); } #ifdef USE_WINDOWS_STYLE_SOCKETS SocketReceiver::SocketReceiver(Socket &s) : m_s(s), m_resultPending(false), m_eofReceived(false) { m_event.AttachHandle(CreateEvent(NULL, true, false, NULL), true); m_s.CheckAndHandleError("CreateEvent", m_event.HandleValid()); memset(&m_overlapped, 0, sizeof(m_overlapped)); m_overlapped.hEvent = m_event; } SocketReceiver::~SocketReceiver() { #ifdef USE_WINDOWS_STYLE_SOCKETS CancelIo((HANDLE) m_s.GetSocket()); #endif } bool SocketReceiver::Receive(byte* buf, size_t bufLen) { assert(!m_resultPending && !m_eofReceived); DWORD flags = 0; // don't queue too much at once, or we might use up non-paged memory WSABUF wsabuf = {UnsignedMin((u_long)128*1024, bufLen), (char *)buf}; if (WSARecv(m_s, &wsabuf, 1, &m_lastResult, &flags, &m_overlapped, NULL) == 0) { if (m_lastResult == 0) m_eofReceived = true; } else { switch (WSAGetLastError()) { default: m_s.CheckAndHandleError_int("WSARecv", SOCKET_ERROR); case WSAEDISCON: m_lastResult = 0; m_eofReceived = true; break; case WSA_IO_PENDING: m_resultPending = true; } } return !m_resultPending; } void SocketReceiver::GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack) { if (m_resultPending) container.AddHandle(m_event, CallStack("SocketReceiver::GetWaitObjects() - result pending", &callStack)); else if (!m_eofReceived) container.SetNoWait(CallStack("SocketReceiver::GetWaitObjects() - result ready", &callStack)); } unsigned int SocketReceiver::GetReceiveResult() { if (m_resultPending) { DWORD flags = 0; if (WSAGetOverlappedResult(m_s, &m_overlapped, &m_lastResult, false, &flags)) { if (m_lastResult == 0) m_eofReceived = true; } else { switch (WSAGetLastError()) { default: m_s.CheckAndHandleError("WSAGetOverlappedResult", FALSE); case WSAEDISCON: m_lastResult = 0; m_eofReceived = true; } } m_resultPending = false; } return m_lastResult; } // ************************************************************* SocketSender::SocketSender(Socket &s) : m_s(s), m_resultPending(false), m_lastResult(0) { m_event.AttachHandle(CreateEvent(NULL, true, false, NULL), true); m_s.CheckAndHandleError("CreateEvent", m_event.HandleValid()); memset(&m_overlapped, 0, sizeof(m_overlapped)); m_overlapped.hEvent = m_event; } SocketSender::~SocketSender() { #ifdef USE_WINDOWS_STYLE_SOCKETS CancelIo((HANDLE) m_s.GetSocket()); #endif } void SocketSender::Send(const byte* buf, size_t bufLen) { assert(!m_resultPending); DWORD written = 0; // don't queue too much at once, or we might use up non-paged memory WSABUF wsabuf = {UnsignedMin((u_long)128*1024, bufLen), (char *)buf}; if (WSASend(m_s, &wsabuf, 1, &written, 0, &m_overlapped, NULL) == 0) { m_resultPending = false; m_lastResult = written; } else { if (WSAGetLastError() != WSA_IO_PENDING) m_s.CheckAndHandleError_int("WSASend", SOCKET_ERROR); m_resultPending = true; } } void SocketSender::SendEof() { assert(!m_resultPending); m_s.ShutDown(SD_SEND); m_s.CheckAndHandleError("ResetEvent", ResetEvent(m_event)); m_s.CheckAndHandleError_int("WSAEventSelect", WSAEventSelect(m_s, m_event, FD_CLOSE)); m_resultPending = true; } bool SocketSender::EofSent() { if (m_resultPending) { WSANETWORKEVENTS events; m_s.CheckAndHandleError_int("WSAEnumNetworkEvents", WSAEnumNetworkEvents(m_s, m_event, &events)); if ((events.lNetworkEvents & FD_CLOSE) != FD_CLOSE) throw Socket::Err(m_s, "WSAEnumNetworkEvents (FD_CLOSE not present)", E_FAIL); if (events.iErrorCode[FD_CLOSE_BIT] != 0) throw Socket::Err(m_s, "FD_CLOSE (via WSAEnumNetworkEvents)", events.iErrorCode[FD_CLOSE_BIT]); m_resultPending = false; } return m_lastResult != 0; } void SocketSender::GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack) { if (m_resultPending) container.AddHandle(m_event, CallStack("SocketSender::GetWaitObjects() - result pending", &callStack)); else container.SetNoWait(CallStack("SocketSender::GetWaitObjects() - result ready", &callStack)); } unsigned int SocketSender::GetSendResult() { if (m_resultPending) { DWORD flags = 0; BOOL result = WSAGetOverlappedResult(m_s, &m_overlapped, &m_lastResult, false, &flags); m_s.CheckAndHandleError("WSAGetOverlappedResult", result); m_resultPending = false; } return m_lastResult; } #endif #ifdef USE_BERKELEY_STYLE_SOCKETS SocketReceiver::SocketReceiver(Socket &s) : m_s(s), m_lastResult(0), m_eofReceived(false) { } void SocketReceiver::GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack) { if (!m_eofReceived) container.AddReadFd(m_s, CallStack("SocketReceiver::GetWaitObjects()", &callStack)); } bool SocketReceiver::Receive(byte* buf, size_t bufLen) { m_lastResult = m_s.Receive(buf, bufLen); if (bufLen > 0 && m_lastResult == 0) m_eofReceived = true; return true; } unsigned int SocketReceiver::GetReceiveResult() { return m_lastResult; } SocketSender::SocketSender(Socket &s) : m_s(s), m_lastResult(0) { } void SocketSender::Send(const byte* buf, size_t bufLen) { m_lastResult = m_s.Send(buf, bufLen); } void SocketSender::SendEof() { m_s.ShutDown(SD_SEND); } unsigned int SocketSender::GetSendResult() { return m_lastResult; } void SocketSender::GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack) { container.AddWriteFd(m_s, CallStack("SocketSender::GetWaitObjects()", &callStack)); } #endif NAMESPACE_END #endif // #ifdef SOCKETS_AVAILABLE armory-0.92.3/cppForSwig/cryptopp/cmac.h0000755000000000000000000000303012414772654016646 0ustar rootroot#ifndef CRYPTOPP_CMAC_H #define CRYPTOPP_CMAC_H #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CMAC_Base : public MessageAuthenticationCode { public: CMAC_Base() {} void UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms); void Update(const byte *input, size_t length); void TruncatedFinal(byte *mac, size_t size); unsigned int DigestSize() const {return GetCipher().BlockSize();} unsigned int OptimalBlockSize() const {return GetCipher().BlockSize();} unsigned int OptimalDataAlignment() const {return GetCipher().OptimalDataAlignment();} protected: friend class EAX_Base; const BlockCipher & GetCipher() const {return const_cast(this)->AccessCipher();} virtual BlockCipher & AccessCipher() =0; void ProcessBuf(); SecByteBlock m_reg; unsigned int m_counter; }; /// CMAC /*! Template parameter T should be a class derived from BlockCipherDocumentation, for example AES, with a block size of 8, 16, or 32 */ template class CMAC : public MessageAuthenticationCodeImpl >, public SameKeyLengthAs { public: CMAC() {} CMAC(const byte *key, size_t length=SameKeyLengthAs::DEFAULT_KEYLENGTH) {this->SetKey(key, length);} static std::string StaticAlgorithmName() {return std::string("CMAC(") + T::StaticAlgorithmName() + ")";} private: BlockCipher & AccessCipher() {return m_cipher;} typename T::Encryption m_cipher; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/pubkey.h0000755000000000000000000017625312414772654017264 0ustar rootroot// pubkey.h - written and placed in the public domain by Wei Dai #ifndef CRYPTOPP_PUBKEY_H #define CRYPTOPP_PUBKEY_H /** \file This file contains helper classes/functions for implementing public key algorithms. The class hierachies in this .h file tend to look like this: 

                  x1
                 / \
                y1  z1
                 |  |
            x2  x2
                 |  |
                y2  z2
                 |  |
            x3  x3
                 |  |
                y3  z3
- x1, y1, z1 are abstract interface classes defined in cryptlib.h - x2, y2, z2 are implementations of the interfaces using "abstract policies", which are pure virtual functions that should return interfaces to interchangeable algorithms. These classes have "Base" suffixes. - x3, y3, z3 hold actual algorithms and implement those virtual functions. These classes have "Impl" suffixes. The "TF_" prefix means an implementation using trapdoor functions on integers. The "DL_" prefix means an implementation using group operations (in groups where discrete log is hard). */ #include "modarith.h" #include "filters.h" #include "eprecomp.h" #include "fips140.h" #include "argnames.h" #include // VC60 workaround: this macro is defined in shlobj.h and conflicts with a template parameter used in this file #undef INTERFACE NAMESPACE_BEGIN(CryptoPP) //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE TrapdoorFunctionBounds { public: virtual ~TrapdoorFunctionBounds() {} virtual Integer PreimageBound() const =0; virtual Integer ImageBound() const =0; virtual Integer MaxPreimage() const {return --PreimageBound();} virtual Integer MaxImage() const {return --ImageBound();} }; //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE RandomizedTrapdoorFunction : public TrapdoorFunctionBounds { public: virtual Integer ApplyRandomizedFunction(RandomNumberGenerator &rng, const Integer &x) const =0; virtual bool IsRandomized() const {return true;} }; //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE TrapdoorFunction : public RandomizedTrapdoorFunction { public: Integer ApplyRandomizedFunction(RandomNumberGenerator &rng, const Integer &x) const {return ApplyFunction(x);} bool IsRandomized() const {return false;} virtual Integer ApplyFunction(const Integer &x) const =0; }; //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE RandomizedTrapdoorFunctionInverse { public: virtual ~RandomizedTrapdoorFunctionInverse() {} virtual Integer CalculateRandomizedInverse(RandomNumberGenerator &rng, const Integer &x) const =0; virtual bool IsRandomized() const {return true;} }; //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE TrapdoorFunctionInverse : public RandomizedTrapdoorFunctionInverse { public: virtual ~TrapdoorFunctionInverse() {} Integer CalculateRandomizedInverse(RandomNumberGenerator &rng, const Integer &x) const {return CalculateInverse(rng, x);} bool IsRandomized() const {return false;} virtual Integer CalculateInverse(RandomNumberGenerator &rng, const Integer &x) const =0; }; // ******************************************************** //! message encoding method for public key encryption class CRYPTOPP_NO_VTABLE PK_EncryptionMessageEncodingMethod { public: virtual ~PK_EncryptionMessageEncodingMethod() {} virtual bool ParameterSupported(const char *name) const {return false;} //! max size of unpadded message in bytes, given max size of padded message in bits (1 less than size of modulus) virtual size_t MaxUnpaddedLength(size_t paddedLength) const =0; virtual void Pad(RandomNumberGenerator &rng, const byte *raw, size_t inputLength, byte *padded, size_t paddedBitLength, const NameValuePairs ¶meters) const =0; virtual DecodingResult Unpad(const byte *padded, size_t paddedBitLength, byte *raw, const NameValuePairs ¶meters) const =0; }; // ******************************************************** //! _ template class CRYPTOPP_NO_VTABLE TF_Base { protected: virtual const TrapdoorFunctionBounds & GetTrapdoorFunctionBounds() const =0; typedef TFI TrapdoorFunctionInterface; virtual const TrapdoorFunctionInterface & GetTrapdoorFunctionInterface() const =0; typedef MEI MessageEncodingInterface; virtual const MessageEncodingInterface & GetMessageEncodingInterface() const =0; }; // ******************************************************** //! _ template class CRYPTOPP_NO_VTABLE PK_FixedLengthCryptoSystemImpl : public BASE { public: size_t MaxPlaintextLength(size_t ciphertextLength) const {return ciphertextLength == FixedCiphertextLength() ? FixedMaxPlaintextLength() : 0;} size_t CiphertextLength(size_t plaintextLength) const {return plaintextLength <= FixedMaxPlaintextLength() ? FixedCiphertextLength() : 0;} virtual size_t FixedMaxPlaintextLength() const =0; virtual size_t FixedCiphertextLength() const =0; }; //! _ template class CRYPTOPP_NO_VTABLE TF_CryptoSystemBase : public PK_FixedLengthCryptoSystemImpl, protected BASE { public: bool ParameterSupported(const char *name) const {return this->GetMessageEncodingInterface().ParameterSupported(name);} size_t FixedMaxPlaintextLength() const {return this->GetMessageEncodingInterface().MaxUnpaddedLength(PaddedBlockBitLength());} size_t FixedCiphertextLength() const {return this->GetTrapdoorFunctionBounds().MaxImage().ByteCount();} protected: size_t PaddedBlockByteLength() const {return BitsToBytes(PaddedBlockBitLength());} size_t PaddedBlockBitLength() const {return this->GetTrapdoorFunctionBounds().PreimageBound().BitCount()-1;} }; //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE TF_DecryptorBase : public TF_CryptoSystemBase > { public: DecodingResult Decrypt(RandomNumberGenerator &rng, const byte *ciphertext, size_t ciphertextLength, byte *plaintext, const NameValuePairs ¶meters = g_nullNameValuePairs) const; }; //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE TF_EncryptorBase : public TF_CryptoSystemBase > { public: void Encrypt(RandomNumberGenerator &rng, const byte *plaintext, size_t plaintextLength, byte *ciphertext, const NameValuePairs ¶meters = g_nullNameValuePairs) const; }; // ******************************************************** typedef std::pair HashIdentifier; //! interface for message encoding method for public key signature schemes class CRYPTOPP_NO_VTABLE PK_SignatureMessageEncodingMethod { public: virtual ~PK_SignatureMessageEncodingMethod() {} virtual size_t MinRepresentativeBitLength(size_t hashIdentifierLength, size_t digestLength) const {return 0;} virtual size_t MaxRecoverableLength(size_t representativeBitLength, size_t hashIdentifierLength, size_t digestLength) const {return 0;} bool IsProbabilistic() const {return true;} bool AllowNonrecoverablePart() const {throw NotImplemented("PK_MessageEncodingMethod: this signature scheme does not support message recovery");} virtual bool RecoverablePartFirst() const {throw NotImplemented("PK_MessageEncodingMethod: this signature scheme does not support message recovery");} // for verification, DL virtual void ProcessSemisignature(HashTransformation &hash, const byte *semisignature, size_t semisignatureLength) const {} // for signature virtual void ProcessRecoverableMessage(HashTransformation &hash, const byte *recoverableMessage, size_t recoverableMessageLength, const byte *presignature, size_t presignatureLength, SecByteBlock &semisignature) const { if (RecoverablePartFirst()) assert(!"ProcessRecoverableMessage() not implemented"); } virtual void ComputeMessageRepresentative(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const =0; virtual bool VerifyMessageRepresentative( HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const =0; virtual DecodingResult RecoverMessageFromRepresentative( // for TF HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength, byte *recoveredMessage) const {throw NotImplemented("PK_MessageEncodingMethod: this signature scheme does not support message recovery");} virtual DecodingResult RecoverMessageFromSemisignature( // for DL HashTransformation &hash, HashIdentifier hashIdentifier, const byte *presignature, size_t presignatureLength, const byte *semisignature, size_t semisignatureLength, byte *recoveredMessage) const {throw NotImplemented("PK_MessageEncodingMethod: this signature scheme does not support message recovery");} // VC60 workaround struct HashIdentifierLookup { template struct HashIdentifierLookup2 { static HashIdentifier CRYPTOPP_API Lookup() { return HashIdentifier((const byte *)NULL, 0); } }; }; }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_DeterministicSignatureMessageEncodingMethod : public PK_SignatureMessageEncodingMethod { public: bool VerifyMessageRepresentative( HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const; }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_RecoverableSignatureMessageEncodingMethod : public PK_SignatureMessageEncodingMethod { public: bool VerifyMessageRepresentative( HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const; }; class CRYPTOPP_DLL DL_SignatureMessageEncodingMethod_DSA : public PK_DeterministicSignatureMessageEncodingMethod { public: void ComputeMessageRepresentative(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const; }; class CRYPTOPP_DLL DL_SignatureMessageEncodingMethod_NR : public PK_DeterministicSignatureMessageEncodingMethod { public: void ComputeMessageRepresentative(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const; }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_MessageAccumulatorBase : public PK_MessageAccumulator { public: PK_MessageAccumulatorBase() : m_empty(true) {} virtual HashTransformation & AccessHash() =0; void Update(const byte *input, size_t length) { AccessHash().Update(input, length); m_empty = m_empty && length == 0; } SecByteBlock m_recoverableMessage, m_representative, m_presignature, m_semisignature; Integer m_k, m_s; bool m_empty; }; template class PK_MessageAccumulatorImpl : public PK_MessageAccumulatorBase, protected ObjectHolder { public: HashTransformation & AccessHash() {return this->m_object;} }; //! _ template class CRYPTOPP_NO_VTABLE TF_SignatureSchemeBase : public INTERFACE, protected BASE { public: size_t SignatureLength() const {return this->GetTrapdoorFunctionBounds().MaxPreimage().ByteCount();} size_t MaxRecoverableLength() const {return this->GetMessageEncodingInterface().MaxRecoverableLength(MessageRepresentativeBitLength(), GetHashIdentifier().second, GetDigestSize());} size_t MaxRecoverableLengthFromSignatureLength(size_t signatureLength) const {return this->MaxRecoverableLength();} bool IsProbabilistic() const {return this->GetTrapdoorFunctionInterface().IsRandomized() || this->GetMessageEncodingInterface().IsProbabilistic();} bool AllowNonrecoverablePart() const {return this->GetMessageEncodingInterface().AllowNonrecoverablePart();} bool RecoverablePartFirst() const {return this->GetMessageEncodingInterface().RecoverablePartFirst();} protected: size_t MessageRepresentativeLength() const {return BitsToBytes(MessageRepresentativeBitLength());} size_t MessageRepresentativeBitLength() const {return this->GetTrapdoorFunctionBounds().ImageBound().BitCount()-1;} virtual HashIdentifier GetHashIdentifier() const =0; virtual size_t GetDigestSize() const =0; }; //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE TF_SignerBase : public TF_SignatureSchemeBase > { public: void InputRecoverableMessage(PK_MessageAccumulator &messageAccumulator, const byte *recoverableMessage, size_t recoverableMessageLength) const; size_t SignAndRestart(RandomNumberGenerator &rng, PK_MessageAccumulator &messageAccumulator, byte *signature, bool restart=true) const; }; //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE TF_VerifierBase : public TF_SignatureSchemeBase > { public: void InputSignature(PK_MessageAccumulator &messageAccumulator, const byte *signature, size_t signatureLength) const; bool VerifyAndRestart(PK_MessageAccumulator &messageAccumulator) const; DecodingResult RecoverAndRestart(byte *recoveredMessage, PK_MessageAccumulator &recoveryAccumulator) const; }; // ******************************************************** //! _ template struct TF_CryptoSchemeOptions { typedef T1 AlgorithmInfo; typedef T2 Keys; typedef typename Keys::PrivateKey PrivateKey; typedef typename Keys::PublicKey PublicKey; typedef T3 MessageEncodingMethod; }; //! _ template struct TF_SignatureSchemeOptions : public TF_CryptoSchemeOptions { typedef T4 HashFunction; }; //! _ template class CRYPTOPP_NO_VTABLE TF_ObjectImplBase : public AlgorithmImpl { public: typedef SCHEME_OPTIONS SchemeOptions; typedef KEY_CLASS KeyClass; PublicKey & AccessPublicKey() {return AccessKey();} const PublicKey & GetPublicKey() const {return GetKey();} PrivateKey & AccessPrivateKey() {return AccessKey();} const PrivateKey & GetPrivateKey() const {return GetKey();} virtual const KeyClass & GetKey() const =0; virtual KeyClass & AccessKey() =0; const KeyClass & GetTrapdoorFunction() const {return GetKey();} PK_MessageAccumulator * NewSignatureAccumulator(RandomNumberGenerator &rng) const { return new PK_MessageAccumulatorImpl; } PK_MessageAccumulator * NewVerificationAccumulator() const { return new PK_MessageAccumulatorImpl; } protected: const typename BASE::MessageEncodingInterface & GetMessageEncodingInterface() const {return Singleton().Ref();} const TrapdoorFunctionBounds & GetTrapdoorFunctionBounds() const {return GetKey();} const typename BASE::TrapdoorFunctionInterface & GetTrapdoorFunctionInterface() const {return GetKey();} // for signature scheme HashIdentifier GetHashIdentifier() const { typedef CPP_TYPENAME SchemeOptions::MessageEncodingMethod::HashIdentifierLookup::template HashIdentifierLookup2 L; return L::Lookup(); } size_t GetDigestSize() const { typedef CPP_TYPENAME SchemeOptions::HashFunction H; return H::DIGESTSIZE; } }; //! _ template class TF_ObjectImplExtRef : public TF_ObjectImplBase { public: TF_ObjectImplExtRef(const KEY *pKey = NULL) : m_pKey(pKey) {} void SetKeyPtr(const KEY *pKey) {m_pKey = pKey;} const KEY & GetKey() const {return *m_pKey;} KEY & AccessKey() {throw NotImplemented("TF_ObjectImplExtRef: cannot modify refererenced key");} private: const KEY * m_pKey; }; //! _ template class CRYPTOPP_NO_VTABLE TF_ObjectImpl : public TF_ObjectImplBase { public: typedef KEY_CLASS KeyClass; const KeyClass & GetKey() const {return m_trapdoorFunction;} KeyClass & AccessKey() {return m_trapdoorFunction;} private: KeyClass m_trapdoorFunction; }; //! _ template class TF_DecryptorImpl : public TF_ObjectImpl { }; //! _ template class TF_EncryptorImpl : public TF_ObjectImpl { }; //! _ template class TF_SignerImpl : public TF_ObjectImpl { }; //! _ template class TF_VerifierImpl : public TF_ObjectImpl { }; // ******************************************************** //! _ class CRYPTOPP_NO_VTABLE MaskGeneratingFunction { public: virtual ~MaskGeneratingFunction() {} virtual void GenerateAndMask(HashTransformation &hash, byte *output, size_t outputLength, const byte *input, size_t inputLength, bool mask = true) const =0; }; CRYPTOPP_DLL void CRYPTOPP_API P1363_MGF1KDF2_Common(HashTransformation &hash, byte *output, size_t outputLength, const byte *input, size_t inputLength, const byte *derivationParams, size_t derivationParamsLength, bool mask, unsigned int counterStart); //! _ class P1363_MGF1 : public MaskGeneratingFunction { public: static const char * CRYPTOPP_API StaticAlgorithmName() {return "MGF1";} void GenerateAndMask(HashTransformation &hash, byte *output, size_t outputLength, const byte *input, size_t inputLength, bool mask = true) const { P1363_MGF1KDF2_Common(hash, output, outputLength, input, inputLength, NULL, 0, mask, 0); } }; // ******************************************************** //! _ template class P1363_KDF2 { public: static void CRYPTOPP_API DeriveKey(byte *output, size_t outputLength, const byte *input, size_t inputLength, const byte *derivationParams, size_t derivationParamsLength) { H h; P1363_MGF1KDF2_Common(h, output, outputLength, input, inputLength, derivationParams, derivationParamsLength, false, 1); } }; // ******************************************************** //! to be thrown by DecodeElement and AgreeWithStaticPrivateKey class DL_BadElement : public InvalidDataFormat { public: DL_BadElement() : InvalidDataFormat("CryptoPP: invalid group element") {} }; //! interface for DL group parameters template class CRYPTOPP_NO_VTABLE DL_GroupParameters : public CryptoParameters { typedef DL_GroupParameters ThisClass; public: typedef T Element; DL_GroupParameters() : m_validationLevel(0) {} // CryptoMaterial bool Validate(RandomNumberGenerator &rng, unsigned int level) const { if (!GetBasePrecomputation().IsInitialized()) return false; if (m_validationLevel > level) return true; bool pass = ValidateGroup(rng, level); pass = pass && ValidateElement(level, GetSubgroupGenerator(), &GetBasePrecomputation()); m_validationLevel = pass ? level+1 : 0; return pass; } bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue) CRYPTOPP_GET_FUNCTION_ENTRY(SubgroupOrder) CRYPTOPP_GET_FUNCTION_ENTRY(SubgroupGenerator) ; } bool SupportsPrecomputation() const {return true;} void Precompute(unsigned int precomputationStorage=16) { AccessBasePrecomputation().Precompute(GetGroupPrecomputation(), GetSubgroupOrder().BitCount(), precomputationStorage); } void LoadPrecomputation(BufferedTransformation &storedPrecomputation) { AccessBasePrecomputation().Load(GetGroupPrecomputation(), storedPrecomputation); m_validationLevel = 0; } void SavePrecomputation(BufferedTransformation &storedPrecomputation) const { GetBasePrecomputation().Save(GetGroupPrecomputation(), storedPrecomputation); } // non-inherited virtual const Element & GetSubgroupGenerator() const {return GetBasePrecomputation().GetBase(GetGroupPrecomputation());} virtual void SetSubgroupGenerator(const Element &base) {AccessBasePrecomputation().SetBase(GetGroupPrecomputation(), base);} virtual Element ExponentiateBase(const Integer &exponent) const { return GetBasePrecomputation().Exponentiate(GetGroupPrecomputation(), exponent); } virtual Element ExponentiateElement(const Element &base, const Integer &exponent) const { Element result; SimultaneousExponentiate(&result, base, &exponent, 1); return result; } virtual const DL_GroupPrecomputation & GetGroupPrecomputation() const =0; virtual const DL_FixedBasePrecomputation & GetBasePrecomputation() const =0; virtual DL_FixedBasePrecomputation & AccessBasePrecomputation() =0; virtual const Integer & GetSubgroupOrder() const =0; // order of subgroup generated by base element virtual Integer GetMaxExponent() const =0; virtual Integer GetGroupOrder() const {return GetSubgroupOrder()*GetCofactor();} // one of these two needs to be overriden virtual Integer GetCofactor() const {return GetGroupOrder()/GetSubgroupOrder();} virtual unsigned int GetEncodedElementSize(bool reversible) const =0; virtual void EncodeElement(bool reversible, const Element &element, byte *encoded) const =0; virtual Element DecodeElement(const byte *encoded, bool checkForGroupMembership) const =0; virtual Integer ConvertElementToInteger(const Element &element) const =0; virtual bool ValidateGroup(RandomNumberGenerator &rng, unsigned int level) const =0; virtual bool ValidateElement(unsigned int level, const Element &element, const DL_FixedBasePrecomputation *precomp) const =0; virtual bool FastSubgroupCheckAvailable() const =0; virtual bool IsIdentity(const Element &element) const =0; virtual void SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const =0; protected: void ParametersChanged() {m_validationLevel = 0;} private: mutable unsigned int m_validationLevel; }; //! _ template , class BASE = DL_GroupParameters > class DL_GroupParametersImpl : public BASE { public: typedef GROUP_PRECOMP GroupPrecomputation; typedef typename GROUP_PRECOMP::Element Element; typedef BASE_PRECOMP BasePrecomputation; const DL_GroupPrecomputation & GetGroupPrecomputation() const {return m_groupPrecomputation;} const DL_FixedBasePrecomputation & GetBasePrecomputation() const {return m_gpc;} DL_FixedBasePrecomputation & AccessBasePrecomputation() {return m_gpc;} protected: GROUP_PRECOMP m_groupPrecomputation; BASE_PRECOMP m_gpc; }; //! _ template class CRYPTOPP_NO_VTABLE DL_Key { public: virtual const DL_GroupParameters & GetAbstractGroupParameters() const =0; virtual DL_GroupParameters & AccessAbstractGroupParameters() =0; }; //! interface for DL public keys template class CRYPTOPP_NO_VTABLE DL_PublicKey : public DL_Key { typedef DL_PublicKey ThisClass; public: typedef T Element; bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue, &this->GetAbstractGroupParameters()) CRYPTOPP_GET_FUNCTION_ENTRY(PublicElement); } void AssignFrom(const NameValuePairs &source); // non-inherited virtual const Element & GetPublicElement() const {return GetPublicPrecomputation().GetBase(this->GetAbstractGroupParameters().GetGroupPrecomputation());} virtual void SetPublicElement(const Element &y) {AccessPublicPrecomputation().SetBase(this->GetAbstractGroupParameters().GetGroupPrecomputation(), y);} virtual Element ExponentiatePublicElement(const Integer &exponent) const { const DL_GroupParameters ¶ms = this->GetAbstractGroupParameters(); return GetPublicPrecomputation().Exponentiate(params.GetGroupPrecomputation(), exponent); } virtual Element CascadeExponentiateBaseAndPublicElement(const Integer &baseExp, const Integer &publicExp) const { const DL_GroupParameters ¶ms = this->GetAbstractGroupParameters(); return params.GetBasePrecomputation().CascadeExponentiate(params.GetGroupPrecomputation(), baseExp, GetPublicPrecomputation(), publicExp); } virtual const DL_FixedBasePrecomputation & GetPublicPrecomputation() const =0; virtual DL_FixedBasePrecomputation & AccessPublicPrecomputation() =0; }; //! interface for DL private keys template class CRYPTOPP_NO_VTABLE DL_PrivateKey : public DL_Key { typedef DL_PrivateKey ThisClass; public: typedef T Element; void MakePublicKey(DL_PublicKey &pub) const { pub.AccessAbstractGroupParameters().AssignFrom(this->GetAbstractGroupParameters()); pub.SetPublicElement(this->GetAbstractGroupParameters().ExponentiateBase(GetPrivateExponent())); } bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue, &this->GetAbstractGroupParameters()) CRYPTOPP_GET_FUNCTION_ENTRY(PrivateExponent); } void AssignFrom(const NameValuePairs &source) { this->AccessAbstractGroupParameters().AssignFrom(source); AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY(PrivateExponent); } virtual const Integer & GetPrivateExponent() const =0; virtual void SetPrivateExponent(const Integer &x) =0; }; template void DL_PublicKey::AssignFrom(const NameValuePairs &source) { DL_PrivateKey *pPrivateKey = NULL; if (source.GetThisPointer(pPrivateKey)) pPrivateKey->MakePublicKey(*this); else { this->AccessAbstractGroupParameters().AssignFrom(source); AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY(PublicElement); } } class OID; //! _ template class DL_KeyImpl : public PK { public: typedef GP GroupParameters; O GetAlgorithmID() const {return GetGroupParameters().GetAlgorithmID();} // void BERDecode(BufferedTransformation &bt) // {PK::BERDecode(bt);} // void DEREncode(BufferedTransformation &bt) const // {PK::DEREncode(bt);} bool BERDecodeAlgorithmParameters(BufferedTransformation &bt) {AccessGroupParameters().BERDecode(bt); return true;} bool DEREncodeAlgorithmParameters(BufferedTransformation &bt) const {GetGroupParameters().DEREncode(bt); return true;} const GP & GetGroupParameters() const {return m_groupParameters;} GP & AccessGroupParameters() {return m_groupParameters;} private: GP m_groupParameters; }; class X509PublicKey; class PKCS8PrivateKey; //! _ template class DL_PrivateKeyImpl : public DL_PrivateKey, public DL_KeyImpl { public: typedef typename GP::Element Element; // GeneratableCryptoMaterial bool Validate(RandomNumberGenerator &rng, unsigned int level) const { bool pass = GetAbstractGroupParameters().Validate(rng, level); const Integer &q = GetAbstractGroupParameters().GetSubgroupOrder(); const Integer &x = GetPrivateExponent(); pass = pass && x.IsPositive() && x < q; if (level >= 1) pass = pass && Integer::Gcd(x, q) == Integer::One(); return pass; } bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper >(this, name, valueType, pValue).Assignable(); } void AssignFrom(const NameValuePairs &source) { AssignFromHelper >(this, source); } void GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs ¶ms) { if (!params.GetThisObject(this->AccessGroupParameters())) this->AccessGroupParameters().GenerateRandom(rng, params); // std::pair seed; Integer x(rng, Integer::One(), GetAbstractGroupParameters().GetMaxExponent()); // Integer::ANY, Integer::Zero(), Integer::One(), // params.GetValue("DeterministicKeyGenerationSeed", seed) ? &seed : NULL); SetPrivateExponent(x); } bool SupportsPrecomputation() const {return true;} void Precompute(unsigned int precomputationStorage=16) {AccessAbstractGroupParameters().Precompute(precomputationStorage);} void LoadPrecomputation(BufferedTransformation &storedPrecomputation) {AccessAbstractGroupParameters().LoadPrecomputation(storedPrecomputation);} void SavePrecomputation(BufferedTransformation &storedPrecomputation) const {GetAbstractGroupParameters().SavePrecomputation(storedPrecomputation);} // DL_Key const DL_GroupParameters & GetAbstractGroupParameters() const {return this->GetGroupParameters();} DL_GroupParameters & AccessAbstractGroupParameters() {return this->AccessGroupParameters();} // DL_PrivateKey const Integer & GetPrivateExponent() const {return m_x;} void SetPrivateExponent(const Integer &x) {m_x = x;} // PKCS8PrivateKey void BERDecodePrivateKey(BufferedTransformation &bt, bool, size_t) {m_x.BERDecode(bt);} void DEREncodePrivateKey(BufferedTransformation &bt) const {m_x.DEREncode(bt);} private: Integer m_x; }; //! _ template class DL_PrivateKey_WithSignaturePairwiseConsistencyTest : public BASE { public: void GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs ¶ms) { BASE::GenerateRandom(rng, params); if (FIPS_140_2_ComplianceEnabled()) { typename SIGNATURE_SCHEME::Signer signer(*this); typename SIGNATURE_SCHEME::Verifier verifier(signer); SignaturePairwiseConsistencyTest_FIPS_140_Only(signer, verifier); } } }; //! _ template class DL_PublicKeyImpl : public DL_PublicKey, public DL_KeyImpl { public: typedef typename GP::Element Element; // CryptoMaterial bool Validate(RandomNumberGenerator &rng, unsigned int level) const { bool pass = GetAbstractGroupParameters().Validate(rng, level); pass = pass && GetAbstractGroupParameters().ValidateElement(level, this->GetPublicElement(), &GetPublicPrecomputation()); return pass; } bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper >(this, name, valueType, pValue).Assignable(); } void AssignFrom(const NameValuePairs &source) { AssignFromHelper >(this, source); } bool SupportsPrecomputation() const {return true;} void Precompute(unsigned int precomputationStorage=16) { AccessAbstractGroupParameters().Precompute(precomputationStorage); AccessPublicPrecomputation().Precompute(GetAbstractGroupParameters().GetGroupPrecomputation(), GetAbstractGroupParameters().GetSubgroupOrder().BitCount(), precomputationStorage); } void LoadPrecomputation(BufferedTransformation &storedPrecomputation) { AccessAbstractGroupParameters().LoadPrecomputation(storedPrecomputation); AccessPublicPrecomputation().Load(GetAbstractGroupParameters().GetGroupPrecomputation(), storedPrecomputation); } void SavePrecomputation(BufferedTransformation &storedPrecomputation) const { GetAbstractGroupParameters().SavePrecomputation(storedPrecomputation); GetPublicPrecomputation().Save(GetAbstractGroupParameters().GetGroupPrecomputation(), storedPrecomputation); } // DL_Key const DL_GroupParameters & GetAbstractGroupParameters() const {return this->GetGroupParameters();} DL_GroupParameters & AccessAbstractGroupParameters() {return this->AccessGroupParameters();} // DL_PublicKey const DL_FixedBasePrecomputation & GetPublicPrecomputation() const {return m_ypc;} DL_FixedBasePrecomputation & AccessPublicPrecomputation() {return m_ypc;} // non-inherited bool operator==(const DL_PublicKeyImpl &rhs) const {return this->GetGroupParameters() == rhs.GetGroupParameters() && this->GetPublicElement() == rhs.GetPublicElement();} private: typename GP::BasePrecomputation m_ypc; }; //! interface for Elgamal-like signature algorithms template class CRYPTOPP_NO_VTABLE DL_ElgamalLikeSignatureAlgorithm { public: virtual void Sign(const DL_GroupParameters ¶ms, const Integer &privateKey, const Integer &k, const Integer &e, Integer &r, Integer &s) const =0; virtual bool Verify(const DL_GroupParameters ¶ms, const DL_PublicKey &publicKey, const Integer &e, const Integer &r, const Integer &s) const =0; virtual Integer RecoverPresignature(const DL_GroupParameters ¶ms, const DL_PublicKey &publicKey, const Integer &r, const Integer &s) const {throw NotImplemented("DL_ElgamalLikeSignatureAlgorithm: this signature scheme does not support message recovery");} virtual size_t RLen(const DL_GroupParameters ¶ms) const {return params.GetSubgroupOrder().ByteCount();} virtual size_t SLen(const DL_GroupParameters ¶ms) const {return params.GetSubgroupOrder().ByteCount();} }; //! interface for DL key agreement algorithms template class CRYPTOPP_NO_VTABLE DL_KeyAgreementAlgorithm { public: typedef T Element; virtual Element AgreeWithEphemeralPrivateKey(const DL_GroupParameters ¶ms, const DL_FixedBasePrecomputation &publicPrecomputation, const Integer &privateExponent) const =0; virtual Element AgreeWithStaticPrivateKey(const DL_GroupParameters ¶ms, const Element &publicElement, bool validateOtherPublicKey, const Integer &privateExponent) const =0; }; //! interface for key derivation algorithms used in DL cryptosystems template class CRYPTOPP_NO_VTABLE DL_KeyDerivationAlgorithm { public: virtual bool ParameterSupported(const char *name) const {return false;} virtual void Derive(const DL_GroupParameters &groupParams, byte *derivedKey, size_t derivedLength, const T &agreedElement, const T &ephemeralPublicKey, const NameValuePairs &derivationParams) const =0; }; //! interface for symmetric encryption algorithms used in DL cryptosystems class CRYPTOPP_NO_VTABLE DL_SymmetricEncryptionAlgorithm { public: virtual bool ParameterSupported(const char *name) const {return false;} virtual size_t GetSymmetricKeyLength(size_t plaintextLength) const =0; virtual size_t GetSymmetricCiphertextLength(size_t plaintextLength) const =0; virtual size_t GetMaxSymmetricPlaintextLength(size_t ciphertextLength) const =0; virtual void SymmetricEncrypt(RandomNumberGenerator &rng, const byte *key, const byte *plaintext, size_t plaintextLength, byte *ciphertext, const NameValuePairs ¶meters) const =0; virtual DecodingResult SymmetricDecrypt(const byte *key, const byte *ciphertext, size_t ciphertextLength, byte *plaintext, const NameValuePairs ¶meters) const =0; }; //! _ template class CRYPTOPP_NO_VTABLE DL_Base { protected: typedef KI KeyInterface; typedef typename KI::Element Element; const DL_GroupParameters & GetAbstractGroupParameters() const {return GetKeyInterface().GetAbstractGroupParameters();} DL_GroupParameters & AccessAbstractGroupParameters() {return AccessKeyInterface().AccessAbstractGroupParameters();} virtual KeyInterface & AccessKeyInterface() =0; virtual const KeyInterface & GetKeyInterface() const =0; }; //! _ template class CRYPTOPP_NO_VTABLE DL_SignatureSchemeBase : public INTERFACE, public DL_Base { public: size_t SignatureLength() const { return GetSignatureAlgorithm().RLen(this->GetAbstractGroupParameters()) + GetSignatureAlgorithm().SLen(this->GetAbstractGroupParameters()); } size_t MaxRecoverableLength() const {return GetMessageEncodingInterface().MaxRecoverableLength(0, GetHashIdentifier().second, GetDigestSize());} size_t MaxRecoverableLengthFromSignatureLength(size_t signatureLength) const {assert(false); return 0;} // TODO bool IsProbabilistic() const {return true;} bool AllowNonrecoverablePart() const {return GetMessageEncodingInterface().AllowNonrecoverablePart();} bool RecoverablePartFirst() const {return GetMessageEncodingInterface().RecoverablePartFirst();} protected: size_t MessageRepresentativeLength() const {return BitsToBytes(MessageRepresentativeBitLength());} size_t MessageRepresentativeBitLength() const {return this->GetAbstractGroupParameters().GetSubgroupOrder().BitCount();} virtual const DL_ElgamalLikeSignatureAlgorithm & GetSignatureAlgorithm() const =0; virtual const PK_SignatureMessageEncodingMethod & GetMessageEncodingInterface() const =0; virtual HashIdentifier GetHashIdentifier() const =0; virtual size_t GetDigestSize() const =0; }; //! _ template class CRYPTOPP_NO_VTABLE DL_SignerBase : public DL_SignatureSchemeBase > { public: // for validation testing void RawSign(const Integer &k, const Integer &e, Integer &r, Integer &s) const { const DL_ElgamalLikeSignatureAlgorithm &alg = this->GetSignatureAlgorithm(); const DL_GroupParameters ¶ms = this->GetAbstractGroupParameters(); const DL_PrivateKey &key = this->GetKeyInterface(); r = params.ConvertElementToInteger(params.ExponentiateBase(k)); alg.Sign(params, key.GetPrivateExponent(), k, e, r, s); } void InputRecoverableMessage(PK_MessageAccumulator &messageAccumulator, const byte *recoverableMessage, size_t recoverableMessageLength) const { PK_MessageAccumulatorBase &ma = static_cast(messageAccumulator); ma.m_recoverableMessage.Assign(recoverableMessage, recoverableMessageLength); this->GetMessageEncodingInterface().ProcessRecoverableMessage(ma.AccessHash(), recoverableMessage, recoverableMessageLength, ma.m_presignature, ma.m_presignature.size(), ma.m_semisignature); } size_t SignAndRestart(RandomNumberGenerator &rng, PK_MessageAccumulator &messageAccumulator, byte *signature, bool restart) const { this->GetMaterial().DoQuickSanityCheck(); PK_MessageAccumulatorBase &ma = static_cast(messageAccumulator); const DL_ElgamalLikeSignatureAlgorithm &alg = this->GetSignatureAlgorithm(); const DL_GroupParameters ¶ms = this->GetAbstractGroupParameters(); const DL_PrivateKey &key = this->GetKeyInterface(); SecByteBlock representative(this->MessageRepresentativeLength()); this->GetMessageEncodingInterface().ComputeMessageRepresentative( rng, ma.m_recoverableMessage, ma.m_recoverableMessage.size(), ma.AccessHash(), this->GetHashIdentifier(), ma.m_empty, representative, this->MessageRepresentativeBitLength()); ma.m_empty = true; Integer e(representative, representative.size()); // hash message digest into random number k to prevent reusing the same k on a different messages // after virtual machine rollback if (rng.CanIncorporateEntropy()) rng.IncorporateEntropy(representative, representative.size()); Integer k(rng, 1, params.GetSubgroupOrder()-1); Integer r, s; r = params.ConvertElementToInteger(params.ExponentiateBase(k)); alg.Sign(params, key.GetPrivateExponent(), k, e, r, s); /* Integer r, s; if (this->MaxRecoverableLength() > 0) r.Decode(ma.m_semisignature, ma.m_semisignature.size()); else r.Decode(ma.m_presignature, ma.m_presignature.size()); alg.Sign(params, key.GetPrivateExponent(), ma.m_k, e, r, s); */ size_t rLen = alg.RLen(params); r.Encode(signature, rLen); s.Encode(signature+rLen, alg.SLen(params)); if (restart) RestartMessageAccumulator(rng, ma); return this->SignatureLength(); } protected: void RestartMessageAccumulator(RandomNumberGenerator &rng, PK_MessageAccumulatorBase &ma) const { // k needs to be generated before hashing for signature schemes with recovery // but to defend against VM rollbacks we need to generate k after hashing. // so this code is commented out, since no DL-based signature scheme with recovery // has been implemented in Crypto++ anyway /* const DL_ElgamalLikeSignatureAlgorithm &alg = this->GetSignatureAlgorithm(); const DL_GroupParameters ¶ms = this->GetAbstractGroupParameters(); ma.m_k.Randomize(rng, 1, params.GetSubgroupOrder()-1); ma.m_presignature.New(params.GetEncodedElementSize(false)); params.ConvertElementToInteger(params.ExponentiateBase(ma.m_k)).Encode(ma.m_presignature, ma.m_presignature.size()); */ } }; //! _ template class CRYPTOPP_NO_VTABLE DL_VerifierBase : public DL_SignatureSchemeBase > { public: void InputSignature(PK_MessageAccumulator &messageAccumulator, const byte *signature, size_t signatureLength) const { PK_MessageAccumulatorBase &ma = static_cast(messageAccumulator); const DL_ElgamalLikeSignatureAlgorithm &alg = this->GetSignatureAlgorithm(); const DL_GroupParameters ¶ms = this->GetAbstractGroupParameters(); size_t rLen = alg.RLen(params); ma.m_semisignature.Assign(signature, rLen); ma.m_s.Decode(signature+rLen, alg.SLen(params)); this->GetMessageEncodingInterface().ProcessSemisignature(ma.AccessHash(), ma.m_semisignature, ma.m_semisignature.size()); } bool VerifyAndRestart(PK_MessageAccumulator &messageAccumulator) const { this->GetMaterial().DoQuickSanityCheck(); PK_MessageAccumulatorBase &ma = static_cast(messageAccumulator); const DL_ElgamalLikeSignatureAlgorithm &alg = this->GetSignatureAlgorithm(); const DL_GroupParameters ¶ms = this->GetAbstractGroupParameters(); const DL_PublicKey &key = this->GetKeyInterface(); SecByteBlock representative(this->MessageRepresentativeLength()); this->GetMessageEncodingInterface().ComputeMessageRepresentative(NullRNG(), ma.m_recoverableMessage, ma.m_recoverableMessage.size(), ma.AccessHash(), this->GetHashIdentifier(), ma.m_empty, representative, this->MessageRepresentativeBitLength()); ma.m_empty = true; Integer e(representative, representative.size()); Integer r(ma.m_semisignature, ma.m_semisignature.size()); return alg.Verify(params, key, e, r, ma.m_s); } DecodingResult RecoverAndRestart(byte *recoveredMessage, PK_MessageAccumulator &messageAccumulator) const { this->GetMaterial().DoQuickSanityCheck(); PK_MessageAccumulatorBase &ma = static_cast(messageAccumulator); const DL_ElgamalLikeSignatureAlgorithm &alg = this->GetSignatureAlgorithm(); const DL_GroupParameters ¶ms = this->GetAbstractGroupParameters(); const DL_PublicKey &key = this->GetKeyInterface(); SecByteBlock representative(this->MessageRepresentativeLength()); this->GetMessageEncodingInterface().ComputeMessageRepresentative( NullRNG(), ma.m_recoverableMessage, ma.m_recoverableMessage.size(), ma.AccessHash(), this->GetHashIdentifier(), ma.m_empty, representative, this->MessageRepresentativeBitLength()); ma.m_empty = true; Integer e(representative, representative.size()); ma.m_presignature.New(params.GetEncodedElementSize(false)); Integer r(ma.m_semisignature, ma.m_semisignature.size()); alg.RecoverPresignature(params, key, r, ma.m_s).Encode(ma.m_presignature, ma.m_presignature.size()); return this->GetMessageEncodingInterface().RecoverMessageFromSemisignature( ma.AccessHash(), this->GetHashIdentifier(), ma.m_presignature, ma.m_presignature.size(), ma.m_semisignature, ma.m_semisignature.size(), recoveredMessage); } }; //! _ template class CRYPTOPP_NO_VTABLE DL_CryptoSystemBase : public PK, public DL_Base { public: typedef typename DL_Base::Element Element; size_t MaxPlaintextLength(size_t ciphertextLength) const { unsigned int minLen = this->GetAbstractGroupParameters().GetEncodedElementSize(true); return ciphertextLength < minLen ? 0 : GetSymmetricEncryptionAlgorithm().GetMaxSymmetricPlaintextLength(ciphertextLength - minLen); } size_t CiphertextLength(size_t plaintextLength) const { size_t len = GetSymmetricEncryptionAlgorithm().GetSymmetricCiphertextLength(plaintextLength); return len == 0 ? 0 : this->GetAbstractGroupParameters().GetEncodedElementSize(true) + len; } bool ParameterSupported(const char *name) const {return GetKeyDerivationAlgorithm().ParameterSupported(name) || GetSymmetricEncryptionAlgorithm().ParameterSupported(name);} protected: virtual const DL_KeyAgreementAlgorithm & GetKeyAgreementAlgorithm() const =0; virtual const DL_KeyDerivationAlgorithm & GetKeyDerivationAlgorithm() const =0; virtual const DL_SymmetricEncryptionAlgorithm & GetSymmetricEncryptionAlgorithm() const =0; }; //! _ template class CRYPTOPP_NO_VTABLE DL_DecryptorBase : public DL_CryptoSystemBase > { public: typedef T Element; DecodingResult Decrypt(RandomNumberGenerator &rng, const byte *ciphertext, size_t ciphertextLength, byte *plaintext, const NameValuePairs ¶meters = g_nullNameValuePairs) const { try { const DL_KeyAgreementAlgorithm &agreeAlg = this->GetKeyAgreementAlgorithm(); const DL_KeyDerivationAlgorithm &derivAlg = this->GetKeyDerivationAlgorithm(); const DL_SymmetricEncryptionAlgorithm &encAlg = this->GetSymmetricEncryptionAlgorithm(); const DL_GroupParameters ¶ms = this->GetAbstractGroupParameters(); const DL_PrivateKey &key = this->GetKeyInterface(); Element q = params.DecodeElement(ciphertext, true); size_t elementSize = params.GetEncodedElementSize(true); ciphertext += elementSize; ciphertextLength -= elementSize; Element z = agreeAlg.AgreeWithStaticPrivateKey(params, q, true, key.GetPrivateExponent()); SecByteBlock derivedKey(encAlg.GetSymmetricKeyLength(encAlg.GetMaxSymmetricPlaintextLength(ciphertextLength))); derivAlg.Derive(params, derivedKey, derivedKey.size(), z, q, parameters); return encAlg.SymmetricDecrypt(derivedKey, ciphertext, ciphertextLength, plaintext, parameters); } catch (DL_BadElement &) { return DecodingResult(); } } }; //! _ template class CRYPTOPP_NO_VTABLE DL_EncryptorBase : public DL_CryptoSystemBase > { public: typedef T Element; void Encrypt(RandomNumberGenerator &rng, const byte *plaintext, size_t plaintextLength, byte *ciphertext, const NameValuePairs ¶meters = g_nullNameValuePairs) const { const DL_KeyAgreementAlgorithm &agreeAlg = this->GetKeyAgreementAlgorithm(); const DL_KeyDerivationAlgorithm &derivAlg = this->GetKeyDerivationAlgorithm(); const DL_SymmetricEncryptionAlgorithm &encAlg = this->GetSymmetricEncryptionAlgorithm(); const DL_GroupParameters ¶ms = this->GetAbstractGroupParameters(); const DL_PublicKey &key = this->GetKeyInterface(); Integer x(rng, Integer::One(), params.GetMaxExponent()); Element q = params.ExponentiateBase(x); params.EncodeElement(true, q, ciphertext); unsigned int elementSize = params.GetEncodedElementSize(true); ciphertext += elementSize; Element z = agreeAlg.AgreeWithEphemeralPrivateKey(params, key.GetPublicPrecomputation(), x); SecByteBlock derivedKey(encAlg.GetSymmetricKeyLength(plaintextLength)); derivAlg.Derive(params, derivedKey, derivedKey.size(), z, q, parameters); encAlg.SymmetricEncrypt(rng, derivedKey, plaintext, plaintextLength, ciphertext, parameters); } }; //! _ template struct DL_SchemeOptionsBase { typedef T1 AlgorithmInfo; typedef T2 GroupParameters; typedef typename GroupParameters::Element Element; }; //! _ template struct DL_KeyedSchemeOptions : public DL_SchemeOptionsBase { typedef T2 Keys; typedef typename Keys::PrivateKey PrivateKey; typedef typename Keys::PublicKey PublicKey; }; //! _ template struct DL_SignatureSchemeOptions : public DL_KeyedSchemeOptions { typedef T3 SignatureAlgorithm; typedef T4 MessageEncodingMethod; typedef T5 HashFunction; }; //! _ template struct DL_CryptoSchemeOptions : public DL_KeyedSchemeOptions { typedef T3 KeyAgreementAlgorithm; typedef T4 KeyDerivationAlgorithm; typedef T5 SymmetricEncryptionAlgorithm; }; //! _ template class CRYPTOPP_NO_VTABLE DL_ObjectImplBase : public AlgorithmImpl { public: typedef SCHEME_OPTIONS SchemeOptions; typedef typename KEY::Element Element; PrivateKey & AccessPrivateKey() {return m_key;} PublicKey & AccessPublicKey() {return m_key;} // KeyAccessor const KEY & GetKey() const {return m_key;} KEY & AccessKey() {return m_key;} protected: typename BASE::KeyInterface & AccessKeyInterface() {return m_key;} const typename BASE::KeyInterface & GetKeyInterface() const {return m_key;} // for signature scheme HashIdentifier GetHashIdentifier() const { typedef typename SchemeOptions::MessageEncodingMethod::HashIdentifierLookup HashLookup; return HashLookup::template HashIdentifierLookup2::Lookup(); } size_t GetDigestSize() const { typedef CPP_TYPENAME SchemeOptions::HashFunction H; return H::DIGESTSIZE; } private: KEY m_key; }; //! _ template class CRYPTOPP_NO_VTABLE DL_ObjectImpl : public DL_ObjectImplBase { public: typedef typename KEY::Element Element; protected: const DL_ElgamalLikeSignatureAlgorithm & GetSignatureAlgorithm() const {return Singleton().Ref();} const DL_KeyAgreementAlgorithm & GetKeyAgreementAlgorithm() const {return Singleton().Ref();} const DL_KeyDerivationAlgorithm & GetKeyDerivationAlgorithm() const {return Singleton().Ref();} const DL_SymmetricEncryptionAlgorithm & GetSymmetricEncryptionAlgorithm() const {return Singleton().Ref();} HashIdentifier GetHashIdentifier() const {return HashIdentifier();} const PK_SignatureMessageEncodingMethod & GetMessageEncodingInterface() const {return Singleton().Ref();} }; //! _ template class DL_SignerImpl : public DL_ObjectImpl, SCHEME_OPTIONS, typename SCHEME_OPTIONS::PrivateKey> { public: PK_MessageAccumulator * NewSignatureAccumulator(RandomNumberGenerator &rng) const { std::auto_ptr p(new PK_MessageAccumulatorImpl); this->RestartMessageAccumulator(rng, *p); return p.release(); } }; //! _ template class DL_VerifierImpl : public DL_ObjectImpl, SCHEME_OPTIONS, typename SCHEME_OPTIONS::PublicKey> { public: PK_MessageAccumulator * NewVerificationAccumulator() const { return new PK_MessageAccumulatorImpl; } }; //! _ template class DL_EncryptorImpl : public DL_ObjectImpl, SCHEME_OPTIONS, typename SCHEME_OPTIONS::PublicKey> { }; //! _ template class DL_DecryptorImpl : public DL_ObjectImpl, SCHEME_OPTIONS, typename SCHEME_OPTIONS::PrivateKey> { }; // ******************************************************** //! _ template class CRYPTOPP_NO_VTABLE DL_SimpleKeyAgreementDomainBase : public SimpleKeyAgreementDomain { public: typedef T Element; CryptoParameters & AccessCryptoParameters() {return AccessAbstractGroupParameters();} unsigned int AgreedValueLength() const {return GetAbstractGroupParameters().GetEncodedElementSize(false);} unsigned int PrivateKeyLength() const {return GetAbstractGroupParameters().GetSubgroupOrder().ByteCount();} unsigned int PublicKeyLength() const {return GetAbstractGroupParameters().GetEncodedElementSize(true);} void GeneratePrivateKey(RandomNumberGenerator &rng, byte *privateKey) const { Integer x(rng, Integer::One(), GetAbstractGroupParameters().GetMaxExponent()); x.Encode(privateKey, PrivateKeyLength()); } void GeneratePublicKey(RandomNumberGenerator &rng, const byte *privateKey, byte *publicKey) const { const DL_GroupParameters ¶ms = GetAbstractGroupParameters(); Integer x(privateKey, PrivateKeyLength()); Element y = params.ExponentiateBase(x); params.EncodeElement(true, y, publicKey); } bool Agree(byte *agreedValue, const byte *privateKey, const byte *otherPublicKey, bool validateOtherPublicKey=true) const { try { const DL_GroupParameters ¶ms = GetAbstractGroupParameters(); Integer x(privateKey, PrivateKeyLength()); Element w = params.DecodeElement(otherPublicKey, validateOtherPublicKey); Element z = GetKeyAgreementAlgorithm().AgreeWithStaticPrivateKey( GetAbstractGroupParameters(), w, validateOtherPublicKey, x); params.EncodeElement(false, z, agreedValue); } catch (DL_BadElement &) { return false; } return true; } const Element &GetGenerator() const {return GetAbstractGroupParameters().GetSubgroupGenerator();} protected: virtual const DL_KeyAgreementAlgorithm & GetKeyAgreementAlgorithm() const =0; virtual DL_GroupParameters & AccessAbstractGroupParameters() =0; const DL_GroupParameters & GetAbstractGroupParameters() const {return const_cast *>(this)->AccessAbstractGroupParameters();} }; enum CofactorMultiplicationOption {NO_COFACTOR_MULTIPLICTION, COMPATIBLE_COFACTOR_MULTIPLICTION, INCOMPATIBLE_COFACTOR_MULTIPLICTION}; typedef EnumToType NoCofactorMultiplication; typedef EnumToType CompatibleCofactorMultiplication; typedef EnumToType IncompatibleCofactorMultiplication; //! DH key agreement algorithm template class DL_KeyAgreementAlgorithm_DH : public DL_KeyAgreementAlgorithm { public: typedef ELEMENT Element; static const char * CRYPTOPP_API StaticAlgorithmName() {return COFACTOR_OPTION::ToEnum() == INCOMPATIBLE_COFACTOR_MULTIPLICTION ? "DHC" : "DH";} Element AgreeWithEphemeralPrivateKey(const DL_GroupParameters ¶ms, const DL_FixedBasePrecomputation &publicPrecomputation, const Integer &privateExponent) const { return publicPrecomputation.Exponentiate(params.GetGroupPrecomputation(), COFACTOR_OPTION::ToEnum() == INCOMPATIBLE_COFACTOR_MULTIPLICTION ? privateExponent*params.GetCofactor() : privateExponent); } Element AgreeWithStaticPrivateKey(const DL_GroupParameters ¶ms, const Element &publicElement, bool validateOtherPublicKey, const Integer &privateExponent) const { if (COFACTOR_OPTION::ToEnum() == COMPATIBLE_COFACTOR_MULTIPLICTION) { const Integer &k = params.GetCofactor(); return params.ExponentiateElement(publicElement, ModularArithmetic(params.GetSubgroupOrder()).Divide(privateExponent, k)*k); } else if (COFACTOR_OPTION::ToEnum() == INCOMPATIBLE_COFACTOR_MULTIPLICTION) return params.ExponentiateElement(publicElement, privateExponent*params.GetCofactor()); else { assert(COFACTOR_OPTION::ToEnum() == NO_COFACTOR_MULTIPLICTION); if (!validateOtherPublicKey) return params.ExponentiateElement(publicElement, privateExponent); if (params.FastSubgroupCheckAvailable()) { if (!params.ValidateElement(2, publicElement, NULL)) throw DL_BadElement(); return params.ExponentiateElement(publicElement, privateExponent); } else { const Integer e[2] = {params.GetSubgroupOrder(), privateExponent}; Element r[2]; params.SimultaneousExponentiate(r, publicElement, e, 2); if (!params.IsIdentity(r[0])) throw DL_BadElement(); return r[1]; } } } }; // ******************************************************** //! A template implementing constructors for public key algorithm classes template class CRYPTOPP_NO_VTABLE PK_FinalTemplate : public BASE { public: PK_FinalTemplate() {} PK_FinalTemplate(const CryptoMaterial &key) {this->AccessKey().AssignFrom(key);} PK_FinalTemplate(BufferedTransformation &bt) {this->AccessKey().BERDecode(bt);} PK_FinalTemplate(const AsymmetricAlgorithm &algorithm) {this->AccessKey().AssignFrom(algorithm.GetMaterial());} PK_FinalTemplate(const Integer &v1) {this->AccessKey().Initialize(v1);} #if (defined(_MSC_VER) && _MSC_VER < 1300) template PK_FinalTemplate(T1 &v1, T2 &v2) {this->AccessKey().Initialize(v1, v2);} template PK_FinalTemplate(T1 &v1, T2 &v2, T3 &v3) {this->AccessKey().Initialize(v1, v2, v3);} template PK_FinalTemplate(T1 &v1, T2 &v2, T3 &v3, T4 &v4) {this->AccessKey().Initialize(v1, v2, v3, v4);} template PK_FinalTemplate(T1 &v1, T2 &v2, T3 &v3, T4 &v4, T5 &v5) {this->AccessKey().Initialize(v1, v2, v3, v4, v5);} template PK_FinalTemplate(T1 &v1, T2 &v2, T3 &v3, T4 &v4, T5 &v5, T6 &v6) {this->AccessKey().Initialize(v1, v2, v3, v4, v5, v6);} template PK_FinalTemplate(T1 &v1, T2 &v2, T3 &v3, T4 &v4, T5 &v5, T6 &v6, T7 &v7) {this->AccessKey().Initialize(v1, v2, v3, v4, v5, v6, v7);} template PK_FinalTemplate(T1 &v1, T2 &v2, T3 &v3, T4 &v4, T5 &v5, T6 &v6, T7 &v7, T8 &v8) {this->AccessKey().Initialize(v1, v2, v3, v4, v5, v6, v7, v8);} #else template PK_FinalTemplate(const T1 &v1, const T2 &v2) {this->AccessKey().Initialize(v1, v2);} template PK_FinalTemplate(const T1 &v1, const T2 &v2, const T3 &v3) {this->AccessKey().Initialize(v1, v2, v3);} template PK_FinalTemplate(const T1 &v1, const T2 &v2, const T3 &v3, const T4 &v4) {this->AccessKey().Initialize(v1, v2, v3, v4);} template PK_FinalTemplate(const T1 &v1, const T2 &v2, const T3 &v3, const T4 &v4, const T5 &v5) {this->AccessKey().Initialize(v1, v2, v3, v4, v5);} template PK_FinalTemplate(const T1 &v1, const T2 &v2, const T3 &v3, const T4 &v4, const T5 &v5, const T6 &v6) {this->AccessKey().Initialize(v1, v2, v3, v4, v5, v6);} template PK_FinalTemplate(const T1 &v1, const T2 &v2, const T3 &v3, const T4 &v4, const T5 &v5, const T6 &v6, const T7 &v7) {this->AccessKey().Initialize(v1, v2, v3, v4, v5, v6, v7);} template PK_FinalTemplate(const T1 &v1, const T2 &v2, const T3 &v3, const T4 &v4, const T5 &v5, const T6 &v6, const T7 &v7, const T8 &v8) {this->AccessKey().Initialize(v1, v2, v3, v4, v5, v6, v7, v8);} template PK_FinalTemplate(T1 &v1, const T2 &v2) {this->AccessKey().Initialize(v1, v2);} template PK_FinalTemplate(T1 &v1, const T2 &v2, const T3 &v3) {this->AccessKey().Initialize(v1, v2, v3);} template PK_FinalTemplate(T1 &v1, const T2 &v2, const T3 &v3, const T4 &v4) {this->AccessKey().Initialize(v1, v2, v3, v4);} template PK_FinalTemplate(T1 &v1, const T2 &v2, const T3 &v3, const T4 &v4, const T5 &v5) {this->AccessKey().Initialize(v1, v2, v3, v4, v5);} template PK_FinalTemplate(T1 &v1, const T2 &v2, const T3 &v3, const T4 &v4, const T5 &v5, const T6 &v6) {this->AccessKey().Initialize(v1, v2, v3, v4, v5, v6);} template PK_FinalTemplate(T1 &v1, const T2 &v2, const T3 &v3, const T4 &v4, const T5 &v5, const T6 &v6, const T7 &v7) {this->AccessKey().Initialize(v1, v2, v3, v4, v5, v6, v7);} template PK_FinalTemplate(T1 &v1, const T2 &v2, const T3 &v3, const T4 &v4, const T5 &v5, const T6 &v6, const T7 &v7, const T8 &v8) {this->AccessKey().Initialize(v1, v2, v3, v4, v5, v6, v7, v8);} #endif }; //! Base class for public key encryption standard classes. These classes are used to select from variants of algorithms. Note that not all standards apply to all algorithms. struct EncryptionStandard {}; //! Base class for public key signature standard classes. These classes are used to select from variants of algorithms. Note that not all standards apply to all algorithms. struct SignatureStandard {}; template class TF_ES; //! Trapdoor Function Based Encryption Scheme template > class TF_ES : public KEYS { typedef typename STANDARD::EncryptionMessageEncodingMethod MessageEncodingMethod; public: //! see EncryptionStandard for a list of standards typedef STANDARD Standard; typedef TF_CryptoSchemeOptions SchemeOptions; static std::string CRYPTOPP_API StaticAlgorithmName() {return std::string(KEYS::StaticAlgorithmName()) + "/" + MessageEncodingMethod::StaticAlgorithmName();} //! implements PK_Decryptor interface typedef PK_FinalTemplate > Decryptor; //! implements PK_Encryptor interface typedef PK_FinalTemplate > Encryptor; }; template // VC60 workaround: doesn't work if KEYS is first parameter class TF_SS; //! Trapdoor Function Based Signature Scheme template > // VC60 workaround: doesn't work if KEYS is first parameter class TF_SS : public KEYS { public: //! see SignatureStandard for a list of standards typedef STANDARD Standard; typedef typename Standard::SignatureMessageEncodingMethod MessageEncodingMethod; typedef TF_SignatureSchemeOptions SchemeOptions; static std::string CRYPTOPP_API StaticAlgorithmName() {return std::string(KEYS::StaticAlgorithmName()) + "/" + MessageEncodingMethod::StaticAlgorithmName() + "(" + H::StaticAlgorithmName() + ")";} //! implements PK_Signer interface typedef PK_FinalTemplate > Signer; //! implements PK_Verifier interface typedef PK_FinalTemplate > Verifier; }; template class DL_SS; //! Discrete Log Based Signature Scheme template > class DL_SS : public KEYS { typedef DL_SignatureSchemeOptions SchemeOptions; public: static std::string StaticAlgorithmName() {return SA::StaticAlgorithmName() + std::string("/EMSA1(") + H::StaticAlgorithmName() + ")";} //! implements PK_Signer interface typedef PK_FinalTemplate > Signer; //! implements PK_Verifier interface typedef PK_FinalTemplate > Verifier; }; //! Discrete Log Based Encryption Scheme template class DL_ES : public KEYS { typedef DL_CryptoSchemeOptions SchemeOptions; public: //! implements PK_Decryptor interface typedef PK_FinalTemplate > Decryptor; //! implements PK_Encryptor interface typedef PK_FinalTemplate > Encryptor; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/emsa2.h0000755000000000000000000000370412414772654016762 0ustar rootroot#ifndef CRYPTOPP_EMSA2_H #define CRYPTOPP_EMSA2_H /** \file This file contains various padding schemes for public key algorithms. */ #include "cryptlib.h" #include "pubkey.h" #ifdef CRYPTOPP_IS_DLL #include "sha.h" #endif NAMESPACE_BEGIN(CryptoPP) template class EMSA2HashId { public: static const byte id; }; template class EMSA2HashIdLookup : public BASE { public: struct HashIdentifierLookup { template struct HashIdentifierLookup2 { static HashIdentifier Lookup() { return HashIdentifier(&EMSA2HashId::id, 1); } }; }; }; // EMSA2HashId can be instantiated with the following classes. class SHA1; class RIPEMD160; class RIPEMD128; class SHA256; class SHA384; class SHA512; class Whirlpool; class SHA224; // end of list #ifdef CRYPTOPP_IS_DLL CRYPTOPP_DLL_TEMPLATE_CLASS EMSA2HashId; CRYPTOPP_DLL_TEMPLATE_CLASS EMSA2HashId; CRYPTOPP_DLL_TEMPLATE_CLASS EMSA2HashId; CRYPTOPP_DLL_TEMPLATE_CLASS EMSA2HashId; CRYPTOPP_DLL_TEMPLATE_CLASS EMSA2HashId; #endif //! _ class CRYPTOPP_DLL EMSA2Pad : public EMSA2HashIdLookup { public: static const char * CRYPTOPP_API StaticAlgorithmName() {return "EMSA2";} size_t MinRepresentativeBitLength(size_t hashIdentifierLength, size_t digestLength) const {return 8*digestLength + 31;} void ComputeMessageRepresentative(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const; }; //! EMSA2, for use with RWSS and RSA_ISO /*! Only the following hash functions are supported by this signature standard: \dontinclude emsa2.h \skip EMSA2HashId can be instantiated \until end of list */ struct P1363_EMSA2 : public SignatureStandard { typedef EMSA2Pad SignatureMessageEncodingMethod; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/adler32.cpp0000755000000000000000000000223512414772654017540 0ustar rootroot// adler32.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "adler32.h" NAMESPACE_BEGIN(CryptoPP) void Adler32::Update(const byte *input, size_t length) { const unsigned long BASE = 65521; unsigned long s1 = m_s1; unsigned long s2 = m_s2; if (length % 8 != 0) { do { s1 += *input++; s2 += s1; length--; } while (length % 8 != 0); if (s1 >= BASE) s1 -= BASE; s2 %= BASE; } while (length > 0) { s1 += input[0]; s2 += s1; s1 += input[1]; s2 += s1; s1 += input[2]; s2 += s1; s1 += input[3]; s2 += s1; s1 += input[4]; s2 += s1; s1 += input[5]; s2 += s1; s1 += input[6]; s2 += s1; s1 += input[7]; s2 += s1; length -= 8; input += 8; if (s1 >= BASE) s1 -= BASE; if (length % 0x8000 == 0) s2 %= BASE; } assert(s1 < BASE); assert(s2 < BASE); m_s1 = (word16)s1; m_s2 = (word16)s2; } void Adler32::TruncatedFinal(byte *hash, size_t size) { ThrowIfInvalidTruncatedSize(size); switch (size) { default: hash[3] = byte(m_s1); case 3: hash[2] = byte(m_s1 >> 8); case 2: hash[1] = byte(m_s2); case 1: hash[0] = byte(m_s2 >> 8); case 0: ; } Reset(); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/nr.h0000755000000000000000000000011312414772654016361 0ustar rootroot#ifndef CRYPTOPP_NR_H #define CRYPTOPP_NR_H #include "gfpcrypt.h" #endif armory-0.92.3/cppForSwig/cryptopp/cryptlib.dsp0000755000000000000000000004764712414772654020160 0ustar rootroot# Microsoft Developer Studio Project File - Name="cryptlib" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Static Library" 0x0104 CFG=cryptlib - Win32 Debug !MESSAGE This is not a valid makefile. To build this project using NMAKE, !MESSAGE use the Export Makefile command and run !MESSAGE !MESSAGE NMAKE /f "cryptlib.mak". !MESSAGE !MESSAGE You can specify a configuration when running NMAKE !MESSAGE by defining the macro CFG on the command line. For example: !MESSAGE !MESSAGE NMAKE /f "cryptlib.mak" CFG="cryptlib - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "cryptlib - Win32 DLL-Import Release" (based on "Win32 (x86) Static Library") !MESSAGE "cryptlib - Win32 DLL-Import Debug" (based on "Win32 (x86) Static Library") !MESSAGE "cryptlib - Win32 Release" (based on "Win32 (x86) Static Library") !MESSAGE "cryptlib - Win32 Debug" (based on "Win32 (x86) Static Library") !MESSAGE # Begin Project # PROP AllowPerConfigDependencies 0 # PROP Scc_ProjName "" # PROP Scc_LocalPath "" CPP=cl.exe RSC=rc.exe !IF "$(CFG)" == "cryptlib - Win32 DLL-Import Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "cryptlib___Win32_FIPS_140_Release" # PROP BASE Intermediate_Dir "cryptlib___Win32_FIPS_140_Release" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 0 # PROP Output_Dir "DLL_Import_Release" # PROP Intermediate_Dir "DLL_Import_Release" # PROP Target_Dir "" # ADD BASE CPP /nologo /G5 /Gz /MT /W3 /GX /Zi /O2 /D "NDEBUG" /D "WIN32" /D "_WINDOWS" /D "USE_PRECOMPILED_HEADERS" /Yu"pch.h" /FD /c # ADD CPP /nologo /G5 /Gz /MT /W3 /GR /GX /Zi /O2 /Ob2 /D "NDEBUG" /D "_WINDOWS" /D "USE_PRECOMPILED_HEADERS" /D "WIN32" /D "CRYPTOPP_IMPORTS" /Yu"pch.h" /FD /Zm400 /c # ADD BASE RSC /l 0x409 # ADD RSC /l 0x409 BSC32=bscmake.exe # ADD BASE BSC32 /nologo # ADD BSC32 /nologo LIB32=link.exe -lib # ADD BASE LIB32 /nologo # ADD LIB32 /nologo !ELSEIF "$(CFG)" == "cryptlib - Win32 DLL-Import Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "cryptlib___Win32_FIPS_140_Debug" # PROP BASE Intermediate_Dir "cryptlib___Win32_FIPS_140_Debug" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "DLL_Import_Debug" # PROP Intermediate_Dir "DLL_Import_Debug" # PROP Target_Dir "" # ADD BASE CPP /nologo /MTd /W3 /GX /ZI /Od /D "_DEBUG" /D "WIN32" /D "_WINDOWS" /D "USE_PRECOMPILED_HEADERS" /Yu"pch.h" /FD /c # ADD CPP /nologo /G5 /Gz /MTd /W3 /GR /GX /Zi /Oi /D "_DEBUG" /D "_WINDOWS" /D "USE_PRECOMPILED_HEADERS" /D "WIN32" /D "CRYPTOPP_IMPORTS" /Yu"pch.h" /FD /Zm400 /c # ADD BASE RSC /l 0x409 # ADD RSC /l 0x409 BSC32=bscmake.exe # ADD BASE BSC32 /nologo # ADD BSC32 /nologo LIB32=link.exe -lib # ADD BASE LIB32 /nologo # ADD LIB32 /nologo !ELSEIF "$(CFG)" == "cryptlib - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "cryptlib" # PROP BASE Intermediate_Dir "cryptlib" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 0 # PROP Output_Dir "Release" # PROP Intermediate_Dir "Release" # PROP Target_Dir "" # ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /YX /FD /c # ADD CPP /nologo /MT /W3 /GR /GX /Zi /O2 /Ob2 /D "NDEBUG" /D "_WINDOWS" /D "USE_PRECOMPILED_HEADERS" /D "WIN32" /Yu"pch.h" /FD /Zm400 /c # ADD BASE RSC /l 0x409 # ADD RSC /l 0x409 BSC32=bscmake.exe # ADD BASE BSC32 /nologo # ADD BSC32 /nologo LIB32=link.exe -lib # ADD BASE LIB32 /nologo # ADD LIB32 /nologo !ELSEIF "$(CFG)" == "cryptlib - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "cryptli0" # PROP BASE Intermediate_Dir "cryptli0" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "Debug" # PROP Intermediate_Dir "Debug" # PROP Target_Dir "" # ADD BASE CPP /nologo /W3 /GX /Z7 /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /YX /FD /c # ADD CPP /nologo /MTd /W3 /GR /GX /Zi /Oi /D "_DEBUG" /D "_WINDOWS" /D "USE_PRECOMPILED_HEADERS" /D "WIN32" /Yu"pch.h" /FD /Zm400 /c # ADD BASE RSC /l 0x409 # ADD RSC /l 0x409 BSC32=bscmake.exe # ADD BASE BSC32 /nologo # ADD BSC32 /nologo LIB32=link.exe -lib # ADD BASE LIB32 /nologo # ADD LIB32 /nologo !ENDIF # Begin Target # Name "cryptlib - Win32 DLL-Import Release" # Name "cryptlib - Win32 DLL-Import Debug" # Name "cryptlib - Win32 Release" # Name "cryptlib - Win32 Debug" # Begin Group "Source Files" # PROP Default_Filter ".cpp" # Begin Source File SOURCE=.\3way.cpp # End Source File # Begin Source File SOURCE=.\adhoc.cpp.proto !IF "$(CFG)" == "cryptlib - Win32 DLL-Import Release" # Begin Custom Build InputPath=.\adhoc.cpp.proto "adhoc.cpp.copied" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)" if not exist adhoc.cpp copy "$(InputPath)" adhoc.cpp echo: >> adhoc.cpp.copied # End Custom Build !ELSEIF "$(CFG)" == "cryptlib - Win32 DLL-Import Debug" # Begin Custom Build InputPath=.\adhoc.cpp.proto "adhoc.cpp.copied" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)" if not exist adhoc.cpp copy "$(InputPath)" adhoc.cpp echo: >> adhoc.cpp.copied # End Custom Build !ELSEIF "$(CFG)" == "cryptlib - Win32 Release" # Begin Custom Build InputPath=.\adhoc.cpp.proto "adhoc.cpp.copied" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)" if not exist adhoc.cpp copy "$(InputPath)" adhoc.cpp echo: >> adhoc.cpp.copied # End Custom Build !ELSEIF "$(CFG)" == "cryptlib - Win32 Debug" # Begin Custom Build InputPath=.\adhoc.cpp.proto "adhoc.cpp.copied" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)" if not exist adhoc.cpp copy "$(InputPath)" adhoc.cpp echo: >> adhoc.cpp.copied # End Custom Build !ENDIF # End Source File # Begin Source File SOURCE=.\adler32.cpp # End Source File # Begin Source File SOURCE=.\algebra.cpp # End Source File # Begin Source File SOURCE=.\algparam.cpp # End Source File # Begin Source File SOURCE=.\arc4.cpp # End Source File # Begin Source File SOURCE=.\asn.cpp # End Source File # Begin Source File SOURCE=.\authenc.cpp # End Source File # Begin Source File SOURCE=.\base32.cpp # End Source File # Begin Source File SOURCE=.\base64.cpp # End Source File # Begin Source File SOURCE=.\basecode.cpp # End Source File # Begin Source File SOURCE=.\bfinit.cpp # End Source File # Begin Source File SOURCE=.\blowfish.cpp # End Source File # Begin Source File SOURCE=.\blumshub.cpp # End Source File # Begin Source File SOURCE=.\camellia.cpp # End Source File # Begin Source File SOURCE=.\cast.cpp # End Source File # Begin Source File SOURCE=.\casts.cpp # End Source File # Begin Source File SOURCE=.\cbcmac.cpp # End Source File # Begin Source File SOURCE=.\ccm.cpp # End Source File # Begin Source File SOURCE=.\channels.cpp # End Source File # Begin Source File SOURCE=.\cmac.cpp # End Source File # Begin Source File SOURCE=.\cpu.cpp # End Source File # Begin Source File SOURCE=.\crc.cpp # End Source File # Begin Source File SOURCE=.\cryptlib.cpp # End Source File # Begin Source File SOURCE=.\default.cpp # End Source File # Begin Source File SOURCE=.\des.cpp # End Source File # Begin Source File SOURCE=.\dessp.cpp # End Source File # Begin Source File SOURCE=.\dh.cpp # End Source File # Begin Source File SOURCE=.\dh2.cpp # End Source File # Begin Source File SOURCE=.\dll.cpp # SUBTRACT CPP /YX /Yc /Yu # End Source File # Begin Source File SOURCE=.\dsa.cpp # End Source File # Begin Source File SOURCE=.\eax.cpp # End Source File # Begin Source File SOURCE=.\ec2n.cpp # End Source File # Begin Source File SOURCE=.\eccrypto.cpp # End Source File # Begin Source File SOURCE=.\ecp.cpp # End Source File # Begin Source File SOURCE=.\elgamal.cpp # End Source File # Begin Source File SOURCE=.\emsa2.cpp # End Source File # Begin Source File SOURCE=.\eprecomp.cpp # End Source File # Begin Source File SOURCE=.\esign.cpp # End Source File # Begin Source File SOURCE=.\files.cpp # End Source File # Begin Source File SOURCE=.\filters.cpp # End Source File # Begin Source File SOURCE=.\fips140.cpp # End Source File # Begin Source File SOURCE=.\fipstest.cpp # End Source File # Begin Source File SOURCE=.\gcm.cpp # End Source File # Begin Source File SOURCE=.\gf256.cpp # End Source File # Begin Source File SOURCE=.\gf2_32.cpp # End Source File # Begin Source File SOURCE=.\gf2n.cpp # End Source File # Begin Source File SOURCE=.\gfpcrypt.cpp # End Source File # Begin Source File SOURCE=.\gost.cpp # End Source File # Begin Source File SOURCE=.\gzip.cpp # End Source File # Begin Source File SOURCE=.\hex.cpp # End Source File # Begin Source File SOURCE=.\hmac.cpp # End Source File # Begin Source File SOURCE=.\hrtimer.cpp # End Source File # Begin Source File SOURCE=.\ida.cpp # End Source File # Begin Source File SOURCE=.\idea.cpp # End Source File # Begin Source File SOURCE=.\integer.cpp # End Source File # Begin Source File SOURCE=.\iterhash.cpp # SUBTRACT CPP /YX /Yc /Yu # End Source File # Begin Source File SOURCE=.\luc.cpp # End Source File # Begin Source File SOURCE=.\mars.cpp # End Source File # Begin Source File SOURCE=.\marss.cpp # End Source File # Begin Source File SOURCE=.\md2.cpp # End Source File # Begin Source File SOURCE=.\md4.cpp # End Source File # Begin Source File SOURCE=.\md5.cpp # End Source File # Begin Source File SOURCE=.\misc.cpp # End Source File # Begin Source File SOURCE=.\modes.cpp # End Source File # Begin Source File SOURCE=.\mqueue.cpp # End Source File # Begin Source File SOURCE=.\mqv.cpp # End Source File # Begin Source File SOURCE=.\nbtheory.cpp # End Source File # Begin Source File SOURCE=.\network.cpp # End Source File # Begin Source File SOURCE=.\oaep.cpp # End Source File # Begin Source File SOURCE=.\osrng.cpp # End Source File # Begin Source File SOURCE=.\panama.cpp # End Source File # Begin Source File SOURCE=.\pch.cpp # ADD CPP /Yc"pch.h" # End Source File # Begin Source File SOURCE=.\pkcspad.cpp # End Source File # Begin Source File SOURCE=.\polynomi.cpp # End Source File # Begin Source File SOURCE=.\pssr.cpp # End Source File # Begin Source File SOURCE=.\pubkey.cpp # End Source File # Begin Source File SOURCE=.\queue.cpp # End Source File # Begin Source File SOURCE=.\rabin.cpp # End Source File # Begin Source File SOURCE=.\randpool.cpp # End Source File # Begin Source File SOURCE=.\rc2.cpp # End Source File # Begin Source File SOURCE=.\rc5.cpp # End Source File # Begin Source File SOURCE=.\rc6.cpp # End Source File # Begin Source File SOURCE=.\rdtables.cpp # End Source File # Begin Source File SOURCE=.\rijndael.cpp # End Source File # Begin Source File SOURCE=.\ripemd.cpp # End Source File # Begin Source File SOURCE=.\rng.cpp # End Source File # Begin Source File SOURCE=.\rsa.cpp # End Source File # Begin Source File SOURCE=.\rw.cpp # End Source File # Begin Source File SOURCE=.\safer.cpp # End Source File # Begin Source File SOURCE=.\salsa.cpp # End Source File # Begin Source File SOURCE=.\seal.cpp # End Source File # Begin Source File SOURCE=.\seed.cpp # End Source File # Begin Source File SOURCE=.\serpent.cpp # End Source File # Begin Source File SOURCE=.\sha.cpp # End Source File # Begin Source File SOURCE=.\shacal2.cpp # End Source File # Begin Source File SOURCE=.\shark.cpp # End Source File # Begin Source File SOURCE=.\sharkbox.cpp # End Source File # Begin Source File SOURCE=.\simple.cpp # End Source File # Begin Source File SOURCE=.\skipjack.cpp # End Source File # Begin Source File SOURCE=.\socketft.cpp # End Source File # Begin Source File SOURCE=.\sosemanuk.cpp # End Source File # Begin Source File SOURCE=.\square.cpp # End Source File # Begin Source File SOURCE=.\squaretb.cpp # End Source File # Begin Source File SOURCE=.\strciphr.cpp # End Source File # Begin Source File SOURCE=.\tea.cpp # End Source File # Begin Source File SOURCE=.\tftables.cpp # End Source File # Begin Source File SOURCE=.\tiger.cpp # End Source File # Begin Source File SOURCE=.\tigertab.cpp # End Source File # Begin Source File SOURCE=.\trdlocal.cpp # End Source File # Begin Source File SOURCE=.\ttmac.cpp # End Source File # Begin Source File SOURCE=.\twofish.cpp # End Source File # Begin Source File SOURCE=.\vmac.cpp # End Source File # Begin Source File SOURCE=.\wait.cpp # End Source File # Begin Source File SOURCE=.\wake.cpp # End Source File # Begin Source File SOURCE=.\whrlpool.cpp # End Source File # Begin Source File SOURCE=.\winpipes.cpp # End Source File # Begin Source File SOURCE=.\xtr.cpp # End Source File # Begin Source File SOURCE=.\xtrcrypt.cpp # End Source File # Begin Source File SOURCE=.\zdeflate.cpp # End Source File # Begin Source File SOURCE=.\zinflate.cpp # End Source File # Begin Source File SOURCE=.\zlib.cpp # End Source File # End Group # Begin Group "Header Files" # PROP Default_Filter ".;.h" # Begin Source File SOURCE=.\3way.h # End Source File # Begin Source File SOURCE=.\adler32.h # End Source File # Begin Source File SOURCE=.\aes.h # End Source File # Begin Source File SOURCE=.\algebra.h # End Source File # Begin Source File SOURCE=.\algparam.h # End Source File # Begin Source File SOURCE=.\arc4.h # End Source File # Begin Source File SOURCE=.\argnames.h # End Source File # Begin Source File SOURCE=.\asn.h # End Source File # Begin Source File SOURCE=.\authenc.h # End Source File # Begin Source File SOURCE=.\base32.h # End Source File # Begin Source File SOURCE=.\base64.h # End Source File # Begin Source File SOURCE=.\basecode.h # End Source File # Begin Source File SOURCE=.\blowfish.h # End Source File # Begin Source File SOURCE=.\blumshub.h # End Source File # Begin Source File SOURCE=.\camellia.h # End Source File # Begin Source File SOURCE=.\cast.h # End Source File # Begin Source File SOURCE=.\cbcmac.h # End Source File # Begin Source File SOURCE=.\ccm.h # End Source File # Begin Source File SOURCE=.\channels.h # End Source File # Begin Source File SOURCE=.\cmac.h # End Source File # Begin Source File SOURCE=.\config.h # End Source File # Begin Source File SOURCE=.\crc.h # End Source File # Begin Source File SOURCE=.\cryptlib.h # End Source File # Begin Source File SOURCE=.\default.h # End Source File # Begin Source File SOURCE=.\des.h # End Source File # Begin Source File SOURCE=.\dh.h # End Source File # Begin Source File SOURCE=.\dh2.h # End Source File # Begin Source File SOURCE=.\dmac.h # End Source File # Begin Source File SOURCE=.\dsa.h # End Source File # Begin Source File SOURCE=.\dword.h # End Source File # Begin Source File SOURCE=.\eax.h # End Source File # Begin Source File SOURCE=.\ec2n.h # End Source File # Begin Source File SOURCE=.\eccrypto.h # End Source File # Begin Source File SOURCE=.\ecp.h # End Source File # Begin Source File SOURCE=.\elgamal.h # End Source File # Begin Source File SOURCE=.\emsa2.h # End Source File # Begin Source File SOURCE=.\eprecomp.h # End Source File # Begin Source File SOURCE=.\esign.h # End Source File # Begin Source File SOURCE=.\factory.h # End Source File # Begin Source File SOURCE=.\files.h # End Source File # Begin Source File SOURCE=.\filters.h # End Source File # Begin Source File SOURCE=.\fips140.h # End Source File # Begin Source File SOURCE=.\fltrimpl.h # End Source File # Begin Source File SOURCE=.\gcm.h # End Source File # Begin Source File SOURCE=.\gf256.h # End Source File # Begin Source File SOURCE=.\gf2_32.h # End Source File # Begin Source File SOURCE=.\gf2n.h # End Source File # Begin Source File SOURCE=.\gfpcrypt.h # End Source File # Begin Source File SOURCE=.\gost.h # End Source File # Begin Source File SOURCE=.\gzip.h # End Source File # Begin Source File SOURCE=.\hex.h # End Source File # Begin Source File SOURCE=.\hmac.h # End Source File # Begin Source File SOURCE=.\hrtimer.h # End Source File # Begin Source File SOURCE=.\ida.h # End Source File # Begin Source File SOURCE=.\idea.h # End Source File # Begin Source File SOURCE=.\integer.h # End Source File # Begin Source File SOURCE=.\iterhash.h # End Source File # Begin Source File SOURCE=.\lubyrack.h # End Source File # Begin Source File SOURCE=.\luc.h # End Source File # Begin Source File SOURCE=.\mars.h # End Source File # Begin Source File SOURCE=.\md2.h # End Source File # Begin Source File SOURCE=.\md4.h # End Source File # Begin Source File SOURCE=.\md5.h # End Source File # Begin Source File SOURCE=.\mdc.h # End Source File # Begin Source File SOURCE=.\misc.h # End Source File # Begin Source File SOURCE=.\modarith.h # End Source File # Begin Source File SOURCE=.\modes.h # End Source File # Begin Source File SOURCE=.\modexppc.h # End Source File # Begin Source File SOURCE=.\mqueue.h # End Source File # Begin Source File SOURCE=.\mqv.h # End Source File # Begin Source File SOURCE=.\nbtheory.h # End Source File # Begin Source File SOURCE=.\network.h # End Source File # Begin Source File SOURCE=.\nr.h # End Source File # Begin Source File SOURCE=.\oaep.h # End Source File # Begin Source File SOURCE=.\oids.h # End Source File # Begin Source File SOURCE=.\osrng.h # End Source File # Begin Source File SOURCE=.\panama.h # End Source File # Begin Source File SOURCE=.\pch.h # End Source File # Begin Source File SOURCE=.\pkcspad.h # End Source File # Begin Source File SOURCE=.\polynomi.h # End Source File # Begin Source File SOURCE=.\pssr.h # End Source File # Begin Source File SOURCE=.\pubkey.h # End Source File # Begin Source File SOURCE=.\pwdbased.h # End Source File # Begin Source File SOURCE=.\queue.h # End Source File # Begin Source File SOURCE=.\rabin.h # End Source File # Begin Source File SOURCE=.\randpool.h # End Source File # Begin Source File SOURCE=.\rc2.h # End Source File # Begin Source File SOURCE=.\rc5.h # End Source File # Begin Source File SOURCE=.\rc6.h # End Source File # Begin Source File SOURCE=.\rijndael.h # End Source File # Begin Source File SOURCE=.\ripemd.h # End Source File # Begin Source File SOURCE=.\rng.h # End Source File # Begin Source File SOURCE=.\rsa.h # End Source File # Begin Source File SOURCE=.\rw.h # End Source File # Begin Source File SOURCE=.\safer.h # End Source File # Begin Source File SOURCE=.\salsa.h # End Source File # Begin Source File SOURCE=.\seal.h # End Source File # Begin Source File SOURCE=.\secblock.h # End Source File # Begin Source File SOURCE=.\seckey.h # End Source File # Begin Source File SOURCE=.\seed.h # End Source File # Begin Source File SOURCE=.\serpent.h # End Source File # Begin Source File SOURCE=.\sha.h # End Source File # Begin Source File SOURCE=.\shacal2.h # End Source File # Begin Source File SOURCE=.\shark.h # End Source File # Begin Source File SOURCE=.\simple.h # End Source File # Begin Source File SOURCE=.\skipjack.h # End Source File # Begin Source File SOURCE=.\smartptr.h # End Source File # Begin Source File SOURCE=.\socketft.h # End Source File # Begin Source File SOURCE=.\square.h # End Source File # Begin Source File SOURCE=.\strciphr.h # End Source File # Begin Source File SOURCE=.\tea.h # End Source File # Begin Source File SOURCE=.\tiger.h # End Source File # Begin Source File SOURCE=.\trdlocal.h # End Source File # Begin Source File SOURCE=.\trunhash.h # End Source File # Begin Source File SOURCE=.\ttmac.h # End Source File # Begin Source File SOURCE=.\twofish.h # End Source File # Begin Source File SOURCE=.\wait.h # End Source File # Begin Source File SOURCE=.\wake.h # End Source File # Begin Source File SOURCE=.\whrlpool.h # End Source File # Begin Source File SOURCE=.\winpipes.h # End Source File # Begin Source File SOURCE=.\words.h # End Source File # Begin Source File SOURCE=.\xtr.h # End Source File # Begin Source File SOURCE=.\xtrcrypt.h # End Source File # Begin Source File SOURCE=.\zdeflate.h # End Source File # Begin Source File SOURCE=.\zinflate.h # End Source File # Begin Source File SOURCE=.\zlib.h # End Source File # End Group # Begin Group "Miscellaneous" # PROP Default_Filter "" # Begin Source File SOURCE=.\Doxyfile # End Source File # Begin Source File SOURCE=.\GNUmakefile # End Source File # Begin Source File SOURCE=.\license.txt # End Source File # Begin Source File SOURCE=.\readme.txt # End Source File # End Group # End Target # End Project armory-0.92.3/cppForSwig/cryptopp/md5.cpp0000755000000000000000000001036312414772654016772 0ustar rootroot// md5.cpp - modified by Wei Dai from Colin Plumb's public domain md5.c // any modifications are placed in the public domain #include "pch.h" #define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1 #include "md5.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) namespace Weak1 { void MD5_TestInstantiations() { MD5 x; } void MD5::InitState(HashWordType *state) { state[0] = 0x67452301L; state[1] = 0xefcdab89L; state[2] = 0x98badcfeL; state[3] = 0x10325476L; } void MD5::Transform (word32 *digest, const word32 *in) { // #define F1(x, y, z) (x & y | ~x & z) #define F1(x, y, z) (z ^ (x & (y ^ z))) #define F2(x, y, z) F1(z, x, y) #define F3(x, y, z) (x ^ y ^ z) #define F4(x, y, z) (y ^ (x | ~z)) #define MD5STEP(f, w, x, y, z, data, s) \ w = rotlFixed(w + f(x, y, z) + data, s) + x word32 a, b, c, d; a=digest[0]; b=digest[1]; c=digest[2]; d=digest[3]; MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22); MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7); MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12); MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17); MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22); MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7); MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12); MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17); MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22); MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5); MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9); MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14); MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20); MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5); MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9); MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14); MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20); MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5); MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9); MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14); MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20); MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5); MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9); MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14); MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20); MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4); MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11); MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16); MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23); MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4); MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11); MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16); MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23); MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4); MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11); MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16); MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23); MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4); MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11); MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16); MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23); MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6); MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10); MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15); MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21); MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6); MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10); MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15); MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21); MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6); MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10); MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15); MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21); MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6); MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10); MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15); MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21); digest[0]+=a; digest[1]+=b; digest[2]+=c; digest[3]+=d; } } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/Makefile0000755000000000000000000001425712414772654017247 0ustar rootrootCXXFLAGS = -DNDEBUG -g -O2 #CXXFLAGS = -g # -fPIC is supported. Please report any breakage of -fPIC as a bug. CXXFLAGS += -fPIC # the following options reduce code size, but breaks link or makes link very slow on some systems # CXXFLAGS += -ffunction-sections -fdata-sections # LDFLAGS += -Wl,--gc-sections ARFLAGS = -cr # ar needs the dash on OpenBSD RANLIB = ranlib CP = cp MKDIR = mkdir EGREP = egrep UNAME = $(shell uname) ISX86 = $(shell uname -m | $(EGREP) -c "i.86|x86|i86|amd64") # Default prefix for make install ifeq ($(PREFIX),) PREFIX = /usr endif ifeq ($(CXX),gcc) # for some reason CXX is gcc on cygwin 1.1.4 CXX = g++ endif ifeq ($(ISX86),1) GCC42_OR_LATER = $(shell $(CXX) -v 2>&1 | $(EGREP) -c "^gcc version (4.[2-9]|[5-9])") INTEL_COMPILER = $(shell $(CXX) --version 2>&1 | $(EGREP) -c "\(ICC\)") ICC111_OR_LATER = $(shell $(CXX) --version 2>&1 | $(EGREP) -c "\(ICC\) ([2-9][0-9]|1[2-9]|11\.[1-9])") IS_SUN_CC = $(shell $(CXX) -V 2>&1 | $(EGREP) -c "CC: Sun") GAS210_OR_LATER = $(shell echo "" | $(AS) -v 2>&1 | $(EGREP) -c "GNU assembler version (2\.[1-9][0-9]|[3-9])") GAS217_OR_LATER = $(shell echo "" | $(AS) -v 2>&1 | $(EGREP) -c "GNU assembler version (2\.1[7-9]|2\.[2-9]|[3-9])") GAS219_OR_LATER = $(shell echo "" | $(AS) -v 2>&1 | $(EGREP) -c "GNU assembler version (2\.19|2\.[2-9]|[3-9])") ISMINGW = $(shell $(CXX) --version 2>&1 | $(EGREP) -c "mingw") ifneq ($(GCC42_OR_LATER),0) ifeq ($(UNAME),Darwin) CXXFLAGS += -arch x86_64 -arch i386 else #CXXFLAGS += -march=native ifeq ($(CXX),g++) CXXFLAGS += -mtune=generic endif endif endif ifneq ($(INTEL_COMPILER),0) CXXFLAGS += -wd68 -wd186 -wd279 -wd327 ifeq ($(ICC111_OR_LATER),0) # "internal error: backend signals" occurs on some x86 inline assembly with ICC 9 and some x64 inline assembly with ICC 11.0 # if you want to use Crypto++'s assembly code with ICC, try enabling it on individual files CXXFLAGS += -DCRYPTOPP_DISABLE_ASM endif endif ifeq ($(GAS210_OR_LATER),0) # .intel_syntax wasn't supported until GNU assembler 2.10 CXXFLAGS += -DCRYPTOPP_DISABLE_ASM else ifeq ($(GAS217_OR_LATER),0) CXXFLAGS += -DCRYPTOPP_DISABLE_SSSE3 else ifeq ($(GAS219_OR_LATER),0) CXXFLAGS += -DCRYPTOPP_DISABLE_AESNI endif endif ifeq ($(UNAME),SunOS) CXXFLAGS += -Wa,--divide # allow use of "/" operator endif endif ifeq ($(ISMINGW),1) LDLIBS += -lws2_32 endif endif # ISX86 ifeq ($(UNAME),) # for DJGPP, where uname doesn't exist CXXFLAGS += -mbnu210 else CXXFLAGS += -pipe endif ifeq ($(UNAME),Linux) LDFLAGS += -pthread ifneq ($(shell uname -i | $(EGREP) -c "(_64|d64)"),0) M32OR64 = -m64 endif endif ifeq ($(UNAME),Darwin) AR = libtool ARFLAGS = -static -o CXX = c++ IS_GCC2 = $(shell $(CXX) -v 2>&1 | $(EGREP) -c gcc-932) ifeq ($(IS_GCC2),1) CXXFLAGS += -fno-coalesce-templates -fno-coalesce-static-vtables LDLIBS += -lstdc++ LDFLAGS += -flat_namespace -undefined suppress -m endif endif ifeq ($(UNAME),SunOS) LDLIBS += -lnsl -lsocket M32OR64 = -m$(shell isainfo -b) endif ifneq ($(IS_SUN_CC),0) # override flags for CC Sun C++ compiler CXXFLAGS = -DNDEBUG -O -g0 -native -template=no%extdef $(M32OR64) LDFLAGS = AR = $(CXX) ARFLAGS = -xar -o RANLIB = true SUN_CC10_BUGGY = $(shell $(CXX) -V 2>&1 | $(EGREP) -c "CC: Sun .* 5\.10 .* (2009|2010/0[1-4])") ifneq ($(SUN_CC10_BUGGY),0) # -DCRYPTOPP_INCLUDE_VECTOR_CC is needed for Sun Studio 12u1 Sun C++ 5.10 SunOS_i386 128229-02 2009/09/21 and was fixed in May 2010 # remove it if you get "already had a body defined" errors in vector.cc CXXFLAGS += -DCRYPTOPP_INCLUDE_VECTOR_CC endif endif SRCS = $(wildcard *.cpp) ifeq ($(SRCS),) # workaround wildcard function bug in GNU Make 3.77 SRCS = $(shell echo *.cpp) endif OBJS = $(SRCS:.cpp=.o) # test.o needs to be after bench.o for cygwin 1.1.4 (possible ld bug?) TESTOBJS = bench.o bench2.o test.o validat1.o validat2.o validat3.o adhoc.o datatest.o regtest.o fipsalgt.o dlltest.o LIBOBJS = $(filter-out $(TESTOBJS),$(OBJS)) DLLSRCS = algebra.cpp algparam.cpp asn.cpp basecode.cpp cbcmac.cpp channels.cpp cryptlib.cpp des.cpp dessp.cpp dh.cpp dll.cpp dsa.cpp ec2n.cpp eccrypto.cpp ecp.cpp eprecomp.cpp files.cpp filters.cpp fips140.cpp fipstest.cpp gf2n.cpp gfpcrypt.cpp hex.cpp hmac.cpp integer.cpp iterhash.cpp misc.cpp modes.cpp modexppc.cpp mqueue.cpp nbtheory.cpp oaep.cpp osrng.cpp pch.cpp pkcspad.cpp pubkey.cpp queue.cpp randpool.cpp rdtables.cpp rijndael.cpp rng.cpp rsa.cpp sha.cpp simple.cpp skipjack.cpp strciphr.cpp trdlocal.cpp DLLOBJS = $(DLLSRCS:.cpp=.export.o) LIBIMPORTOBJS = $(LIBOBJS:.o=.import.o) TESTIMPORTOBJS = $(TESTOBJS:.o=.import.o) DLLTESTOBJS = dlltest.dllonly.o all: cryptest.exe test: cryptest.exe ./cryptest.exe v clean: $(RM) cryptest.exe libcryptopp.a $(LIBOBJS) $(TESTOBJS) cryptopp.dll libcryptopp.dll.a libcryptopp.import.a cryptest.import.exe dlltest.exe $(DLLOBJS) $(LIBIMPORTOBJS) $(TESTIMPORTOBJS) $(DLLTESTOBJS) install: $(MKDIR) -p $(PREFIX)/include/cryptopp $(PREFIX)/lib $(PREFIX)/bin $(CP) *.h $(PREFIX)/include/cryptopp $(CP) *.a $(PREFIX)/lib $(CP) *.so $(PREFIX)/lib $(CP) *.exe $(PREFIX)/bin libcryptopp.a: $(LIBOBJS) $(AR) $(ARFLAGS) $@ $(LIBOBJS) $(RANLIB) $@ libcryptopp.so: $(LIBOBJS) $(CXX) -shared -o $@ $(LIBOBJS) cryptest.exe: libcryptopp.a $(TESTOBJS) $(CXX) -o $@ $(CXXFLAGS) $(TESTOBJS) -L. -lcryptopp $(LDFLAGS) $(LDLIBS) nolib: $(OBJS) # makes it faster to test changes $(CXX) -o ct $(CXXFLAGS) $(OBJS) $(LDFLAGS) $(LDLIBS) dll: cryptest.import.exe dlltest.exe cryptopp.dll: $(DLLOBJS) $(CXX) -shared -o $@ $(CXXFLAGS) $(DLLOBJS) $(LDFLAGS) $(LDLIBS) -Wl,--out-implib=libcryptopp.dll.a libcryptopp.import.a: $(LIBIMPORTOBJS) $(AR) $(ARFLAGS) $@ $(LIBIMPORTOBJS) $(RANLIB) $@ cryptest.import.exe: cryptopp.dll libcryptopp.import.a $(TESTIMPORTOBJS) $(CXX) -o $@ $(CXXFLAGS) $(TESTIMPORTOBJS) -L. -lcryptopp.dll -lcryptopp.import $(LDFLAGS) $(LDLIBS) dlltest.exe: cryptopp.dll $(DLLTESTOBJS) $(CXX) -o $@ $(CXXFLAGS) $(DLLTESTOBJS) -L. -lcryptopp.dll $(LDFLAGS) $(LDLIBS) adhoc.cpp: adhoc.cpp.proto ifeq ($(wildcard adhoc.cpp),) cp adhoc.cpp.proto adhoc.cpp else touch adhoc.cpp endif %.dllonly.o : %.cpp $(CXX) $(CXXFLAGS) -DCRYPTOPP_DLL_ONLY -c $< -o $@ %.import.o : %.cpp $(CXX) $(CXXFLAGS) -DCRYPTOPP_IMPORTS -c $< -o $@ %.export.o : %.cpp $(CXX) $(CXXFLAGS) -DCRYPTOPP_EXPORTS -c $< -o $@ %.o : %.cpp $(CXX) $(CXXFLAGS) -c $< armory-0.92.3/cppForSwig/cryptopp/tea.h0000755000000000000000000000660312414772654016525 0ustar rootroot#ifndef CRYPTOPP_TEA_H #define CRYPTOPP_TEA_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct TEA_Info : public FixedBlockSize<8>, public FixedKeyLength<16>, public VariableRounds<32> { static const char *StaticAlgorithmName() {return "TEA";} }; /// TEA class TEA : public TEA_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); protected: FixedSizeSecBlock m_k; word32 m_limit; }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef TEA::Encryption TEAEncryption; typedef TEA::Decryption TEADecryption; //! _ struct XTEA_Info : public FixedBlockSize<8>, public FixedKeyLength<16>, public VariableRounds<32> { static const char *StaticAlgorithmName() {return "XTEA";} }; /// XTEA class XTEA : public XTEA_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); protected: FixedSizeSecBlock m_k; word32 m_limit; }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; //! _ struct BTEA_Info : public FixedKeyLength<16> { static const char *StaticAlgorithmName() {return "BTEA";} }; //! corrected Block TEA (as described in "xxtea"). /*! This class hasn't been tested yet. */ class BTEA : public BTEA_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public AlgorithmImpl, BTEA_Info>, public BTEA_Info { public: void UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms) { m_blockSize = params.GetIntValueWithDefault("BlockSize", 60*4); GetUserKey(BIG_ENDIAN_ORDER, m_k.begin(), 4, key, KEYLENGTH); } unsigned int BlockSize() const {return m_blockSize;} protected: FixedSizeSecBlock m_k; unsigned int m_blockSize; }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/ttmac.cpp0000755000000000000000000002572712414772654017427 0ustar rootroot// ttmac.cpp - written and placed in the public domain by Kevin Springle #include "pch.h" #include "ttmac.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) void TTMAC_Base::UncheckedSetKey(const byte *userKey, unsigned int keylength, const NameValuePairs &) { AssertValidKeyLength(keylength); memcpy(m_key, userKey, KEYLENGTH); CorrectEndianess(m_key, m_key, KEYLENGTH); Init(); } void TTMAC_Base::Init() { m_digest[0] = m_digest[5] = m_key[0]; m_digest[1] = m_digest[6] = m_key[1]; m_digest[2] = m_digest[7] = m_key[2]; m_digest[3] = m_digest[8] = m_key[3]; m_digest[4] = m_digest[9] = m_key[4]; } void TTMAC_Base::TruncatedFinal(byte *hash, size_t size) { PadLastBlock(BlockSize() - 2*sizeof(HashWordType)); CorrectEndianess(m_data, m_data, BlockSize() - 2*sizeof(HashWordType)); m_data[m_data.size()-2] = GetBitCountLo(); m_data[m_data.size()-1] = GetBitCountHi(); Transform(m_digest, m_data, true); word32 t2 = m_digest[2]; word32 t3 = m_digest[3]; if (size != DIGESTSIZE) { switch (size) { case 16: m_digest[3] += m_digest[1] + m_digest[4]; case 12: m_digest[2] += m_digest[0] + t3; case 8: m_digest[0] += m_digest[1] + t3; m_digest[1] += m_digest[4] + t2; break; case 4: m_digest[0] += m_digest[1] + m_digest[2] + m_digest[3] + m_digest[4]; break; case 0: // Used by HashTransformation::Restart() break; default: throw InvalidArgument("TTMAC_Base: can't truncate a Two-Track-MAC 20 byte digest to " + IntToString(size) + " bytes"); break; } } CorrectEndianess(m_digest, m_digest, size); memcpy(hash, m_digest, size); Restart(); // reinit for next use } // RIPEMD-160 definitions used by Two-Track-MAC #define F(x, y, z) (x ^ y ^ z) #define G(x, y, z) (z ^ (x & (y^z))) #define H(x, y, z) (z ^ (x | ~y)) #define I(x, y, z) (y ^ (z & (x^y))) #define J(x, y, z) (x ^ (y | ~z)) #define k0 0 #define k1 0x5a827999UL #define k2 0x6ed9eba1UL #define k3 0x8f1bbcdcUL #define k4 0xa953fd4eUL #define k5 0x50a28be6UL #define k6 0x5c4dd124UL #define k7 0x6d703ef3UL #define k8 0x7a6d76e9UL #define k9 0 void TTMAC_Base::Transform(word32 *digest, const word32 *X, bool last) { #define Subround(f, a, b, c, d, e, x, s, k) \ a += f(b, c, d) + x + k;\ a = rotlFixed((word32)a, s) + e;\ c = rotlFixed((word32)c, 10U) word32 a1, b1, c1, d1, e1, a2, b2, c2, d2, e2; word32 *trackA, *trackB; if (!last) { trackA = digest; trackB = digest+5; } else { trackB = digest; trackA = digest+5; } a1 = trackA[0]; b1 = trackA[1]; c1 = trackA[2]; d1 = trackA[3]; e1 = trackA[4]; a2 = trackB[0]; b2 = trackB[1]; c2 = trackB[2]; d2 = trackB[3]; e2 = trackB[4]; Subround(F, a1, b1, c1, d1, e1, X[ 0], 11, k0); Subround(F, e1, a1, b1, c1, d1, X[ 1], 14, k0); Subround(F, d1, e1, a1, b1, c1, X[ 2], 15, k0); Subround(F, c1, d1, e1, a1, b1, X[ 3], 12, k0); Subround(F, b1, c1, d1, e1, a1, X[ 4], 5, k0); Subround(F, a1, b1, c1, d1, e1, X[ 5], 8, k0); Subround(F, e1, a1, b1, c1, d1, X[ 6], 7, k0); Subround(F, d1, e1, a1, b1, c1, X[ 7], 9, k0); Subround(F, c1, d1, e1, a1, b1, X[ 8], 11, k0); Subround(F, b1, c1, d1, e1, a1, X[ 9], 13, k0); Subround(F, a1, b1, c1, d1, e1, X[10], 14, k0); Subround(F, e1, a1, b1, c1, d1, X[11], 15, k0); Subround(F, d1, e1, a1, b1, c1, X[12], 6, k0); Subround(F, c1, d1, e1, a1, b1, X[13], 7, k0); Subround(F, b1, c1, d1, e1, a1, X[14], 9, k0); Subround(F, a1, b1, c1, d1, e1, X[15], 8, k0); Subround(G, e1, a1, b1, c1, d1, X[ 7], 7, k1); Subround(G, d1, e1, a1, b1, c1, X[ 4], 6, k1); Subround(G, c1, d1, e1, a1, b1, X[13], 8, k1); Subround(G, b1, c1, d1, e1, a1, X[ 1], 13, k1); Subround(G, a1, b1, c1, d1, e1, X[10], 11, k1); Subround(G, e1, a1, b1, c1, d1, X[ 6], 9, k1); Subround(G, d1, e1, a1, b1, c1, X[15], 7, k1); Subround(G, c1, d1, e1, a1, b1, X[ 3], 15, k1); Subround(G, b1, c1, d1, e1, a1, X[12], 7, k1); Subround(G, a1, b1, c1, d1, e1, X[ 0], 12, k1); Subround(G, e1, a1, b1, c1, d1, X[ 9], 15, k1); Subround(G, d1, e1, a1, b1, c1, X[ 5], 9, k1); Subround(G, c1, d1, e1, a1, b1, X[ 2], 11, k1); Subround(G, b1, c1, d1, e1, a1, X[14], 7, k1); Subround(G, a1, b1, c1, d1, e1, X[11], 13, k1); Subround(G, e1, a1, b1, c1, d1, X[ 8], 12, k1); Subround(H, d1, e1, a1, b1, c1, X[ 3], 11, k2); Subround(H, c1, d1, e1, a1, b1, X[10], 13, k2); Subround(H, b1, c1, d1, e1, a1, X[14], 6, k2); Subround(H, a1, b1, c1, d1, e1, X[ 4], 7, k2); Subround(H, e1, a1, b1, c1, d1, X[ 9], 14, k2); Subround(H, d1, e1, a1, b1, c1, X[15], 9, k2); Subround(H, c1, d1, e1, a1, b1, X[ 8], 13, k2); Subround(H, b1, c1, d1, e1, a1, X[ 1], 15, k2); Subround(H, a1, b1, c1, d1, e1, X[ 2], 14, k2); Subround(H, e1, a1, b1, c1, d1, X[ 7], 8, k2); Subround(H, d1, e1, a1, b1, c1, X[ 0], 13, k2); Subround(H, c1, d1, e1, a1, b1, X[ 6], 6, k2); Subround(H, b1, c1, d1, e1, a1, X[13], 5, k2); Subround(H, a1, b1, c1, d1, e1, X[11], 12, k2); Subround(H, e1, a1, b1, c1, d1, X[ 5], 7, k2); Subround(H, d1, e1, a1, b1, c1, X[12], 5, k2); Subround(I, c1, d1, e1, a1, b1, X[ 1], 11, k3); Subround(I, b1, c1, d1, e1, a1, X[ 9], 12, k3); Subround(I, a1, b1, c1, d1, e1, X[11], 14, k3); Subround(I, e1, a1, b1, c1, d1, X[10], 15, k3); Subround(I, d1, e1, a1, b1, c1, X[ 0], 14, k3); Subround(I, c1, d1, e1, a1, b1, X[ 8], 15, k3); Subround(I, b1, c1, d1, e1, a1, X[12], 9, k3); Subround(I, a1, b1, c1, d1, e1, X[ 4], 8, k3); Subround(I, e1, a1, b1, c1, d1, X[13], 9, k3); Subround(I, d1, e1, a1, b1, c1, X[ 3], 14, k3); Subround(I, c1, d1, e1, a1, b1, X[ 7], 5, k3); Subround(I, b1, c1, d1, e1, a1, X[15], 6, k3); Subround(I, a1, b1, c1, d1, e1, X[14], 8, k3); Subround(I, e1, a1, b1, c1, d1, X[ 5], 6, k3); Subround(I, d1, e1, a1, b1, c1, X[ 6], 5, k3); Subround(I, c1, d1, e1, a1, b1, X[ 2], 12, k3); Subround(J, b1, c1, d1, e1, a1, X[ 4], 9, k4); Subround(J, a1, b1, c1, d1, e1, X[ 0], 15, k4); Subround(J, e1, a1, b1, c1, d1, X[ 5], 5, k4); Subround(J, d1, e1, a1, b1, c1, X[ 9], 11, k4); Subround(J, c1, d1, e1, a1, b1, X[ 7], 6, k4); Subround(J, b1, c1, d1, e1, a1, X[12], 8, k4); Subround(J, a1, b1, c1, d1, e1, X[ 2], 13, k4); Subround(J, e1, a1, b1, c1, d1, X[10], 12, k4); Subround(J, d1, e1, a1, b1, c1, X[14], 5, k4); Subround(J, c1, d1, e1, a1, b1, X[ 1], 12, k4); Subround(J, b1, c1, d1, e1, a1, X[ 3], 13, k4); Subround(J, a1, b1, c1, d1, e1, X[ 8], 14, k4); Subround(J, e1, a1, b1, c1, d1, X[11], 11, k4); Subround(J, d1, e1, a1, b1, c1, X[ 6], 8, k4); Subround(J, c1, d1, e1, a1, b1, X[15], 5, k4); Subround(J, b1, c1, d1, e1, a1, X[13], 6, k4); Subround(J, a2, b2, c2, d2, e2, X[ 5], 8, k5); Subround(J, e2, a2, b2, c2, d2, X[14], 9, k5); Subround(J, d2, e2, a2, b2, c2, X[ 7], 9, k5); Subround(J, c2, d2, e2, a2, b2, X[ 0], 11, k5); Subround(J, b2, c2, d2, e2, a2, X[ 9], 13, k5); Subround(J, a2, b2, c2, d2, e2, X[ 2], 15, k5); Subround(J, e2, a2, b2, c2, d2, X[11], 15, k5); Subround(J, d2, e2, a2, b2, c2, X[ 4], 5, k5); Subround(J, c2, d2, e2, a2, b2, X[13], 7, k5); Subround(J, b2, c2, d2, e2, a2, X[ 6], 7, k5); Subround(J, a2, b2, c2, d2, e2, X[15], 8, k5); Subround(J, e2, a2, b2, c2, d2, X[ 8], 11, k5); Subround(J, d2, e2, a2, b2, c2, X[ 1], 14, k5); Subround(J, c2, d2, e2, a2, b2, X[10], 14, k5); Subround(J, b2, c2, d2, e2, a2, X[ 3], 12, k5); Subround(J, a2, b2, c2, d2, e2, X[12], 6, k5); Subround(I, e2, a2, b2, c2, d2, X[ 6], 9, k6); Subround(I, d2, e2, a2, b2, c2, X[11], 13, k6); Subround(I, c2, d2, e2, a2, b2, X[ 3], 15, k6); Subround(I, b2, c2, d2, e2, a2, X[ 7], 7, k6); Subround(I, a2, b2, c2, d2, e2, X[ 0], 12, k6); Subround(I, e2, a2, b2, c2, d2, X[13], 8, k6); Subround(I, d2, e2, a2, b2, c2, X[ 5], 9, k6); Subround(I, c2, d2, e2, a2, b2, X[10], 11, k6); Subround(I, b2, c2, d2, e2, a2, X[14], 7, k6); Subround(I, a2, b2, c2, d2, e2, X[15], 7, k6); Subround(I, e2, a2, b2, c2, d2, X[ 8], 12, k6); Subround(I, d2, e2, a2, b2, c2, X[12], 7, k6); Subround(I, c2, d2, e2, a2, b2, X[ 4], 6, k6); Subround(I, b2, c2, d2, e2, a2, X[ 9], 15, k6); Subround(I, a2, b2, c2, d2, e2, X[ 1], 13, k6); Subround(I, e2, a2, b2, c2, d2, X[ 2], 11, k6); Subround(H, d2, e2, a2, b2, c2, X[15], 9, k7); Subround(H, c2, d2, e2, a2, b2, X[ 5], 7, k7); Subround(H, b2, c2, d2, e2, a2, X[ 1], 15, k7); Subround(H, a2, b2, c2, d2, e2, X[ 3], 11, k7); Subround(H, e2, a2, b2, c2, d2, X[ 7], 8, k7); Subround(H, d2, e2, a2, b2, c2, X[14], 6, k7); Subround(H, c2, d2, e2, a2, b2, X[ 6], 6, k7); Subround(H, b2, c2, d2, e2, a2, X[ 9], 14, k7); Subround(H, a2, b2, c2, d2, e2, X[11], 12, k7); Subround(H, e2, a2, b2, c2, d2, X[ 8], 13, k7); Subround(H, d2, e2, a2, b2, c2, X[12], 5, k7); Subround(H, c2, d2, e2, a2, b2, X[ 2], 14, k7); Subround(H, b2, c2, d2, e2, a2, X[10], 13, k7); Subround(H, a2, b2, c2, d2, e2, X[ 0], 13, k7); Subround(H, e2, a2, b2, c2, d2, X[ 4], 7, k7); Subround(H, d2, e2, a2, b2, c2, X[13], 5, k7); Subround(G, c2, d2, e2, a2, b2, X[ 8], 15, k8); Subround(G, b2, c2, d2, e2, a2, X[ 6], 5, k8); Subround(G, a2, b2, c2, d2, e2, X[ 4], 8, k8); Subround(G, e2, a2, b2, c2, d2, X[ 1], 11, k8); Subround(G, d2, e2, a2, b2, c2, X[ 3], 14, k8); Subround(G, c2, d2, e2, a2, b2, X[11], 14, k8); Subround(G, b2, c2, d2, e2, a2, X[15], 6, k8); Subround(G, a2, b2, c2, d2, e2, X[ 0], 14, k8); Subround(G, e2, a2, b2, c2, d2, X[ 5], 6, k8); Subround(G, d2, e2, a2, b2, c2, X[12], 9, k8); Subround(G, c2, d2, e2, a2, b2, X[ 2], 12, k8); Subround(G, b2, c2, d2, e2, a2, X[13], 9, k8); Subround(G, a2, b2, c2, d2, e2, X[ 9], 12, k8); Subround(G, e2, a2, b2, c2, d2, X[ 7], 5, k8); Subround(G, d2, e2, a2, b2, c2, X[10], 15, k8); Subround(G, c2, d2, e2, a2, b2, X[14], 8, k8); Subround(F, b2, c2, d2, e2, a2, X[12], 8, k9); Subround(F, a2, b2, c2, d2, e2, X[15], 5, k9); Subround(F, e2, a2, b2, c2, d2, X[10], 12, k9); Subround(F, d2, e2, a2, b2, c2, X[ 4], 9, k9); Subround(F, c2, d2, e2, a2, b2, X[ 1], 12, k9); Subround(F, b2, c2, d2, e2, a2, X[ 5], 5, k9); Subround(F, a2, b2, c2, d2, e2, X[ 8], 14, k9); Subround(F, e2, a2, b2, c2, d2, X[ 7], 6, k9); Subround(F, d2, e2, a2, b2, c2, X[ 6], 8, k9); Subround(F, c2, d2, e2, a2, b2, X[ 2], 13, k9); Subround(F, b2, c2, d2, e2, a2, X[13], 6, k9); Subround(F, a2, b2, c2, d2, e2, X[14], 5, k9); Subround(F, e2, a2, b2, c2, d2, X[ 0], 15, k9); Subround(F, d2, e2, a2, b2, c2, X[ 3], 13, k9); Subround(F, c2, d2, e2, a2, b2, X[ 9], 11, k9); Subround(F, b2, c2, d2, e2, a2, X[11], 11, k9); a1 -= trackA[0]; b1 -= trackA[1]; c1 -= trackA[2]; d1 -= trackA[3]; e1 -= trackA[4]; a2 -= trackB[0]; b2 -= trackB[1]; c2 -= trackB[2]; d2 -= trackB[3]; e2 -= trackB[4]; if (!last) { trackA[0] = (b1 + e1) - d2; trackA[1] = c1 - e2; trackA[2] = d1 - a2; trackA[3] = e1 - b2; trackA[4] = a1 - c2; trackB[0] = d1 - e2; trackB[1] = (e1 + c1) - a2; trackB[2] = a1 - b2; trackB[3] = b1 - c2; trackB[4] = c1 - d2; } else { trackB[0] = a2 - a1; trackB[1] = b2 - b1; trackB[2] = c2 - c1; trackB[3] = d2 - d1; trackB[4] = e2 - e1; trackA[0] = 0; trackA[1] = 0; trackA[2] = 0; trackA[3] = 0; trackA[4] = 0; } } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/mdc.h0000755000000000000000000000420112414772654016507 0ustar rootroot // mdc.h - written and placed in the public domain by Wei Dai #ifndef CRYPTOPP_MDC_H #define CRYPTOPP_MDC_H /** \file */ #include "seckey.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) //! _ template struct MDC_Info : public FixedBlockSize, public FixedKeyLength { static std::string StaticAlgorithmName() {return std::string("MDC/")+T::StaticAlgorithmName();} }; //! MDC /*! a construction by Peter Gutmann to turn an iterated hash function into a PRF */ template class MDC : public MDC_Info { class CRYPTOPP_NO_VTABLE Enc : public BlockCipherImpl > { typedef typename T::HashWordType HashWordType; public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms) { this->AssertValidKeyLength(length); memcpy_s(m_key, m_key.size(), userKey, this->KEYLENGTH); T::CorrectEndianess(Key(), Key(), this->KEYLENGTH); } void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { T::CorrectEndianess(Buffer(), (HashWordType *)inBlock, this->BLOCKSIZE); T::Transform(Buffer(), Key()); if (xorBlock) { T::CorrectEndianess(Buffer(), Buffer(), this->BLOCKSIZE); xorbuf(outBlock, xorBlock, m_buffer, this->BLOCKSIZE); } else T::CorrectEndianess((HashWordType *)outBlock, Buffer(), this->BLOCKSIZE); } bool IsPermutation() const {return false;} unsigned int OptimalDataAlignment() const {return sizeof(HashWordType);} private: HashWordType *Key() {return (HashWordType *)m_key.data();} const HashWordType *Key() const {return (const HashWordType *)m_key.data();} HashWordType *Buffer() const {return (HashWordType *)m_buffer.data();} // VC60 workaround: bug triggered if using FixedSizeAllocatorWithCleanup FixedSizeSecBlock::KEYLENGTH, AllocatorWithCleanup > m_key; mutable FixedSizeSecBlock::BLOCKSIZE, AllocatorWithCleanup > m_buffer; }; public: //! use BlockCipher interface typedef BlockCipherFinal Encryption; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/twofish.h0000755000000000000000000000271312414772654017435 0ustar rootroot#ifndef CRYPTOPP_TWOFISH_H #define CRYPTOPP_TWOFISH_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct Twofish_Info : public FixedBlockSize<16>, public VariableKeyLength<16, 0, 32>, FixedRounds<16> { static const char *StaticAlgorithmName() {return "Twofish";} }; /// Twofish class Twofish : public Twofish_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); protected: static word32 h0(word32 x, const word32 *key, unsigned int kLen); static word32 h(word32 x, const word32 *key, unsigned int kLen); static const byte q[2][256]; static const word32 mds[4][256]; FixedSizeSecBlock m_k; FixedSizeSecBlock m_s; }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef Twofish::Encryption TwofishEncryption; typedef Twofish::Decryption TwofishDecryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/ecp.h0000755000000000000000000001106412414772654016520 0ustar rootroot#ifndef CRYPTOPP_ECP_H #define CRYPTOPP_ECP_H #include "modarith.h" #include "eprecomp.h" #include "smartptr.h" #include "pubkey.h" NAMESPACE_BEGIN(CryptoPP) //! Elliptical Curve Point struct CRYPTOPP_DLL ECPPoint { ECPPoint() : identity(true) {} ECPPoint(const Integer &x, const Integer &y) : identity(false), x(x), y(y) {} bool operator==(const ECPPoint &t) const {return (identity && t.identity) || (!identity && !t.identity && x==t.x && y==t.y);} bool operator< (const ECPPoint &t) const {return identity ? !t.identity : (!t.identity && (x; //! Elliptic Curve over GF(p), where p is prime class CRYPTOPP_DLL ECP : public AbstractGroup { public: typedef ModularArithmetic Field; typedef Integer FieldElement; typedef ECPPoint Point; ECP() {} ECP(const ECP &ecp, bool convertToMontgomeryRepresentation = false); ECP(const Integer &modulus, const FieldElement &a, const FieldElement &b) : m_fieldPtr(new Field(modulus)), m_a(a.IsNegative() ? modulus+a : a), m_b(b) {} // construct from BER encoded parameters // this constructor will decode and extract the the fields fieldID and curve of the sequence ECParameters ECP(BufferedTransformation &bt); // encode the fields fieldID and curve of the sequence ECParameters void DEREncode(BufferedTransformation &bt) const; bool Equal(const Point &P, const Point &Q) const; const Point& Identity() const; const Point& Inverse(const Point &P) const; bool InversionIsFast() const {return true;} const Point& Add(const Point &P, const Point &Q) const; const Point& Double(const Point &P) const; Point ScalarMultiply(const Point &P, const Integer &k) const; Point CascadeScalarMultiply(const Point &P, const Integer &k1, const Point &Q, const Integer &k2) const; void SimultaneousMultiply(Point *results, const Point &base, const Integer *exponents, unsigned int exponentsCount) const; Point Multiply(const Integer &k, const Point &P) const {return ScalarMultiply(P, k);} Point CascadeMultiply(const Integer &k1, const Point &P, const Integer &k2, const Point &Q) const {return CascadeScalarMultiply(P, k1, Q, k2);} bool ValidateParameters(RandomNumberGenerator &rng, unsigned int level=3) const; bool VerifyPoint(const Point &P) const; unsigned int EncodedPointSize(bool compressed = false) const {return 1 + (compressed?1:2)*GetField().MaxElementByteLength();} // returns false if point is compressed and not valid (doesn't check if uncompressed) bool DecodePoint(Point &P, BufferedTransformation &bt, size_t len) const; bool DecodePoint(Point &P, const byte *encodedPoint, size_t len) const; void EncodePoint(byte *encodedPoint, const Point &P, bool compressed) const; void EncodePoint(BufferedTransformation &bt, const Point &P, bool compressed) const; Point BERDecodePoint(BufferedTransformation &bt) const; void DEREncodePoint(BufferedTransformation &bt, const Point &P, bool compressed) const; Integer FieldSize() const {return GetField().GetModulus();} const Field & GetField() const {return *m_fieldPtr;} const FieldElement & GetA() const {return m_a;} const FieldElement & GetB() const {return m_b;} bool operator==(const ECP &rhs) const {return GetField() == rhs.GetField() && m_a == rhs.m_a && m_b == rhs.m_b;} private: clonable_ptr m_fieldPtr; FieldElement m_a, m_b; mutable Point m_R; }; CRYPTOPP_DLL_TEMPLATE_CLASS DL_FixedBasePrecomputationImpl; CRYPTOPP_DLL_TEMPLATE_CLASS DL_GroupPrecomputation; template class EcPrecomputation; //! ECP precomputation template<> class EcPrecomputation : public DL_GroupPrecomputation { public: typedef ECP EllipticCurve; // DL_GroupPrecomputation bool NeedConversions() const {return true;} Element ConvertIn(const Element &P) const {return P.identity ? P : ECP::Point(m_ec->GetField().ConvertIn(P.x), m_ec->GetField().ConvertIn(P.y));}; Element ConvertOut(const Element &P) const {return P.identity ? P : ECP::Point(m_ec->GetField().ConvertOut(P.x), m_ec->GetField().ConvertOut(P.y));} const AbstractGroup & GetGroup() const {return *m_ec;} Element BERDecodeElement(BufferedTransformation &bt) const {return m_ec->BERDecodePoint(bt);} void DEREncodeElement(BufferedTransformation &bt, const Element &v) const {m_ec->DEREncodePoint(bt, v, false);} // non-inherited void SetCurve(const ECP &ec) { m_ec.reset(new ECP(ec, true)); m_ecOriginal = ec; } const ECP & GetCurve() const {return *m_ecOriginal;} private: value_ptr m_ec, m_ecOriginal; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/rc5.h0000755000000000000000000000240312414772654016437 0ustar rootroot#ifndef CRYPTOPP_RC5_H #define CRYPTOPP_RC5_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct RC5_Info : public FixedBlockSize<8>, public VariableKeyLength<16, 0, 255>, public VariableRounds<16> { static const char *StaticAlgorithmName() {return "RC5";} typedef word32 RC5_WORD; }; /// RC5 class RC5 : public RC5_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); protected: unsigned int r; // number of rounds SecBlock sTable; // expanded key table }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef RC5::Encryption RC5Encryption; typedef RC5::Decryption RC5Decryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/base32.cpp0000755000000000000000000000224612414772654017365 0ustar rootroot// base32.cpp - written and placed in the public domain by Frank Palazzolo, based on hex.cpp by Wei Dai #include "pch.h" #include "base32.h" NAMESPACE_BEGIN(CryptoPP) static const byte s_vecUpper[] = "ABCDEFGHIJKMNPQRSTUVWXYZ23456789"; static const byte s_vecLower[] = "abcdefghijkmnpqrstuvwxyz23456789"; void Base32Encoder::IsolatedInitialize(const NameValuePairs ¶meters) { bool uppercase = parameters.GetValueWithDefault(Name::Uppercase(), true); m_filter->Initialize(CombinedNameValuePairs( parameters, MakeParameters(Name::EncodingLookupArray(), uppercase ? &s_vecUpper[0] : &s_vecLower[0], false)(Name::Log2Base(), 5, true))); } void Base32Decoder::IsolatedInitialize(const NameValuePairs ¶meters) { BaseN_Decoder::Initialize(CombinedNameValuePairs( parameters, MakeParameters(Name::DecodingLookupArray(), GetDefaultDecodingLookupArray(), false)(Name::Log2Base(), 5, true))); } const int *Base32Decoder::GetDefaultDecodingLookupArray() { static volatile bool s_initialized = false; static int s_array[256]; if (!s_initialized) { InitializeDecodingLookupArray(s_array, s_vecUpper, 32, true); s_initialized = true; } return s_array; } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/xtrcrypt.cpp0000755000000000000000000000610412414772654020202 0ustar rootroot// xtrcrypt.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "xtrcrypt.h" #include "nbtheory.h" #include "asn.h" #include "argnames.h" NAMESPACE_BEGIN(CryptoPP) XTR_DH::XTR_DH(const Integer &p, const Integer &q, const GFP2Element &g) : m_p(p), m_q(q), m_g(g) { } XTR_DH::XTR_DH(RandomNumberGenerator &rng, unsigned int pbits, unsigned int qbits) { XTR_FindPrimesAndGenerator(rng, m_p, m_q, m_g, pbits, qbits); } XTR_DH::XTR_DH(BufferedTransformation &bt) { BERSequenceDecoder seq(bt); m_p.BERDecode(seq); m_q.BERDecode(seq); m_g.c1.BERDecode(seq); m_g.c2.BERDecode(seq); seq.MessageEnd(); } void XTR_DH::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); m_p.DEREncode(seq); m_q.DEREncode(seq); m_g.c1.DEREncode(seq); m_g.c2.DEREncode(seq); seq.MessageEnd(); } bool XTR_DH::Validate(RandomNumberGenerator &rng, unsigned int level) const { bool pass = true; pass = pass && m_p > Integer::One() && m_p.IsOdd(); pass = pass && m_q > Integer::One() && m_q.IsOdd(); GFP2Element three = GFP2_ONB(m_p).ConvertIn(3); pass = pass && !(m_g.c1.IsNegative() || m_g.c2.IsNegative() || m_g.c1 >= m_p || m_g.c2 >= m_p || m_g == three); if (level >= 1) pass = pass && ((m_p.Squared()-m_p+1)%m_q).IsZero(); if (level >= 2) { pass = pass && VerifyPrime(rng, m_p, level-2) && VerifyPrime(rng, m_q, level-2); pass = pass && XTR_Exponentiate(m_g, (m_p.Squared()-m_p+1)/m_q, m_p) != three; pass = pass && XTR_Exponentiate(m_g, m_q, m_p) == three; } return pass; } bool XTR_DH::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue).Assignable() CRYPTOPP_GET_FUNCTION_ENTRY(Modulus) CRYPTOPP_GET_FUNCTION_ENTRY(SubgroupOrder) CRYPTOPP_GET_FUNCTION_ENTRY(SubgroupGenerator) ; } void XTR_DH::AssignFrom(const NameValuePairs &source) { AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY(Modulus) CRYPTOPP_SET_FUNCTION_ENTRY(SubgroupOrder) CRYPTOPP_SET_FUNCTION_ENTRY(SubgroupGenerator) ; } void XTR_DH::GeneratePrivateKey(RandomNumberGenerator &rng, byte *privateKey) const { Integer x(rng, Integer::Zero(), m_q-1); x.Encode(privateKey, PrivateKeyLength()); } void XTR_DH::GeneratePublicKey(RandomNumberGenerator &rng, const byte *privateKey, byte *publicKey) const { Integer x(privateKey, PrivateKeyLength()); GFP2Element y = XTR_Exponentiate(m_g, x, m_p); y.Encode(publicKey, PublicKeyLength()); } bool XTR_DH::Agree(byte *agreedValue, const byte *privateKey, const byte *otherPublicKey, bool validateOtherPublicKey) const { GFP2Element w(otherPublicKey, PublicKeyLength()); if (validateOtherPublicKey) { GFP2_ONB gfp2(m_p); GFP2Element three = gfp2.ConvertIn(3); if (w.c1.IsNegative() || w.c2.IsNegative() || w.c1 >= m_p || w.c2 >= m_p || w == three) return false; if (XTR_Exponentiate(w, m_q, m_p) != three) return false; } Integer s(privateKey, PrivateKeyLength()); GFP2Element z = XTR_Exponentiate(w, s, m_p); z.Encode(agreedValue, AgreedValueLength()); return true; } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/whrlpool.cpp0000755000000000000000000012047412414772654020160 0ustar rootroot// whrlpool.cpp - originally modified by Kevin Springle from // Paulo Barreto and Vincent Rijmen's public domain code, whirlpool.c. // Updated to Whirlpool version 3.0, optimized and SSE version added by Wei Dai // All modifications are placed in the public domain // This is the original introductory comment: /** * The Whirlpool hashing function. * *

* References * *

* The Whirlpool algorithm was developed by * Paulo S. L. M. Barreto and * Vincent Rijmen. * * See * P.S.L.M. Barreto, V. Rijmen, * ``The Whirlpool hashing function,'' * NESSIE submission, 2000 (tweaked version, 2001), * * * @author Paulo S.L.M. Barreto * @author Vincent Rijmen. * * @version 3.0 (2003.03.12) * * ============================================================================= * * Differences from version 2.1: * * - Suboptimal diffusion matrix replaced by cir(1, 1, 4, 1, 8, 5, 2, 9). * * ============================================================================= * * Differences from version 2.0: * * - Generation of ISO/IEC 10118-3 test vectors. * - Bug fix: nonzero carry was ignored when tallying the data length * (this bug apparently only manifested itself when feeding data * in pieces rather than in a single chunk at once). * - Support for MS Visual C++ 64-bit integer arithmetic. * * Differences from version 1.0: * * - Original S-box replaced by the tweaked, hardware-efficient version. * * ============================================================================= * * THIS SOFTWARE IS PROVIDED BY THE AUTHORS ''AS IS'' AND ANY EXPRESS * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * */ #include "pch.h" #include "whrlpool.h" #include "misc.h" #include "cpu.h" NAMESPACE_BEGIN(CryptoPP) void Whirlpool_TestInstantiations() { Whirlpool x; } void Whirlpool::InitState(HashWordType *state) { memset(state, 0, 8*sizeof(state[0])); } void Whirlpool::TruncatedFinal(byte *hash, size_t size) { ThrowIfInvalidTruncatedSize(size); PadLastBlock(32); CorrectEndianess(m_data, m_data, 32); m_data[m_data.size()-4] = 0; m_data[m_data.size()-3] = 0; m_data[m_data.size()-2] = GetBitCountHi(); m_data[m_data.size()-1] = GetBitCountLo(); Transform(m_state, m_data); CorrectEndianess(m_state, m_state, DigestSize()); memcpy(hash, m_state, size); Restart(); // reinit for next use } /* * The number of rounds of the internal dedicated block cipher. */ #define R 10 /* * Though Whirlpool is endianness-neutral, the encryption tables are listed * in BIG-ENDIAN format, which is adopted throughout this implementation * (but little-endian notation would be equally suitable if consistently * employed). */ #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE CRYPTOPP_ALIGN_DATA(16) static const word64 Whirlpool_C[4*256+R] CRYPTOPP_SECTION_ALIGN16 = { #else static const word64 Whirlpool_C[4*256+R] = { #endif W64LIT(0x18186018c07830d8), W64LIT(0x23238c2305af4626), W64LIT(0xc6c63fc67ef991b8), W64LIT(0xe8e887e8136fcdfb), W64LIT(0x878726874ca113cb), W64LIT(0xb8b8dab8a9626d11), W64LIT(0x0101040108050209), W64LIT(0x4f4f214f426e9e0d), W64LIT(0x3636d836adee6c9b), W64LIT(0xa6a6a2a6590451ff), W64LIT(0xd2d26fd2debdb90c), W64LIT(0xf5f5f3f5fb06f70e), W64LIT(0x7979f979ef80f296), W64LIT(0x6f6fa16f5fcede30), W64LIT(0x91917e91fcef3f6d), W64LIT(0x52525552aa07a4f8), W64LIT(0x60609d6027fdc047), W64LIT(0xbcbccabc89766535), W64LIT(0x9b9b569baccd2b37), W64LIT(0x8e8e028e048c018a), W64LIT(0xa3a3b6a371155bd2), W64LIT(0x0c0c300c603c186c), W64LIT(0x7b7bf17bff8af684), W64LIT(0x3535d435b5e16a80), W64LIT(0x1d1d741de8693af5), W64LIT(0xe0e0a7e05347ddb3), W64LIT(0xd7d77bd7f6acb321), W64LIT(0xc2c22fc25eed999c), W64LIT(0x2e2eb82e6d965c43), W64LIT(0x4b4b314b627a9629), W64LIT(0xfefedffea321e15d), W64LIT(0x575741578216aed5), W64LIT(0x15155415a8412abd), W64LIT(0x7777c1779fb6eee8), W64LIT(0x3737dc37a5eb6e92), W64LIT(0xe5e5b3e57b56d79e), W64LIT(0x9f9f469f8cd92313), W64LIT(0xf0f0e7f0d317fd23), W64LIT(0x4a4a354a6a7f9420), W64LIT(0xdada4fda9e95a944), W64LIT(0x58587d58fa25b0a2), W64LIT(0xc9c903c906ca8fcf), W64LIT(0x2929a429558d527c), W64LIT(0x0a0a280a5022145a), W64LIT(0xb1b1feb1e14f7f50), W64LIT(0xa0a0baa0691a5dc9), W64LIT(0x6b6bb16b7fdad614), W64LIT(0x85852e855cab17d9), W64LIT(0xbdbdcebd8173673c), W64LIT(0x5d5d695dd234ba8f), W64LIT(0x1010401080502090), W64LIT(0xf4f4f7f4f303f507), W64LIT(0xcbcb0bcb16c08bdd), W64LIT(0x3e3ef83eedc67cd3), W64LIT(0x0505140528110a2d), W64LIT(0x676781671fe6ce78), W64LIT(0xe4e4b7e47353d597), W64LIT(0x27279c2725bb4e02), W64LIT(0x4141194132588273), W64LIT(0x8b8b168b2c9d0ba7), W64LIT(0xa7a7a6a7510153f6), W64LIT(0x7d7de97dcf94fab2), W64LIT(0x95956e95dcfb3749), W64LIT(0xd8d847d88e9fad56), W64LIT(0xfbfbcbfb8b30eb70), W64LIT(0xeeee9fee2371c1cd), W64LIT(0x7c7ced7cc791f8bb), W64LIT(0x6666856617e3cc71), W64LIT(0xdddd53dda68ea77b), W64LIT(0x17175c17b84b2eaf), W64LIT(0x4747014702468e45), W64LIT(0x9e9e429e84dc211a), W64LIT(0xcaca0fca1ec589d4), W64LIT(0x2d2db42d75995a58), W64LIT(0xbfbfc6bf9179632e), W64LIT(0x07071c07381b0e3f), W64LIT(0xadad8ead012347ac), W64LIT(0x5a5a755aea2fb4b0), W64LIT(0x838336836cb51bef), W64LIT(0x3333cc3385ff66b6), W64LIT(0x636391633ff2c65c), W64LIT(0x02020802100a0412), W64LIT(0xaaaa92aa39384993), W64LIT(0x7171d971afa8e2de), W64LIT(0xc8c807c80ecf8dc6), W64LIT(0x19196419c87d32d1), W64LIT(0x494939497270923b), W64LIT(0xd9d943d9869aaf5f), W64LIT(0xf2f2eff2c31df931), W64LIT(0xe3e3abe34b48dba8), W64LIT(0x5b5b715be22ab6b9), W64LIT(0x88881a8834920dbc), W64LIT(0x9a9a529aa4c8293e), W64LIT(0x262698262dbe4c0b), W64LIT(0x3232c8328dfa64bf), W64LIT(0xb0b0fab0e94a7d59), W64LIT(0xe9e983e91b6acff2), W64LIT(0x0f0f3c0f78331e77), W64LIT(0xd5d573d5e6a6b733), W64LIT(0x80803a8074ba1df4), W64LIT(0xbebec2be997c6127), W64LIT(0xcdcd13cd26de87eb), W64LIT(0x3434d034bde46889), W64LIT(0x48483d487a759032), W64LIT(0xffffdbffab24e354), W64LIT(0x7a7af57af78ff48d), W64LIT(0x90907a90f4ea3d64), W64LIT(0x5f5f615fc23ebe9d), W64LIT(0x202080201da0403d), W64LIT(0x6868bd6867d5d00f), W64LIT(0x1a1a681ad07234ca), W64LIT(0xaeae82ae192c41b7), W64LIT(0xb4b4eab4c95e757d), W64LIT(0x54544d549a19a8ce), W64LIT(0x93937693ece53b7f), W64LIT(0x222288220daa442f), W64LIT(0x64648d6407e9c863), W64LIT(0xf1f1e3f1db12ff2a), W64LIT(0x7373d173bfa2e6cc), W64LIT(0x12124812905a2482), W64LIT(0x40401d403a5d807a), W64LIT(0x0808200840281048), W64LIT(0xc3c32bc356e89b95), W64LIT(0xecec97ec337bc5df), W64LIT(0xdbdb4bdb9690ab4d), W64LIT(0xa1a1bea1611f5fc0), W64LIT(0x8d8d0e8d1c830791), W64LIT(0x3d3df43df5c97ac8), W64LIT(0x97976697ccf1335b), W64LIT(0x0000000000000000), W64LIT(0xcfcf1bcf36d483f9), W64LIT(0x2b2bac2b4587566e), W64LIT(0x7676c57697b3ece1), W64LIT(0x8282328264b019e6), W64LIT(0xd6d67fd6fea9b128), W64LIT(0x1b1b6c1bd87736c3), W64LIT(0xb5b5eeb5c15b7774), W64LIT(0xafaf86af112943be), W64LIT(0x6a6ab56a77dfd41d), W64LIT(0x50505d50ba0da0ea), W64LIT(0x45450945124c8a57), W64LIT(0xf3f3ebf3cb18fb38), W64LIT(0x3030c0309df060ad), W64LIT(0xefef9bef2b74c3c4), W64LIT(0x3f3ffc3fe5c37eda), W64LIT(0x55554955921caac7), W64LIT(0xa2a2b2a2791059db), W64LIT(0xeaea8fea0365c9e9), W64LIT(0x656589650fecca6a), W64LIT(0xbabad2bab9686903), W64LIT(0x2f2fbc2f65935e4a), W64LIT(0xc0c027c04ee79d8e), W64LIT(0xdede5fdebe81a160), W64LIT(0x1c1c701ce06c38fc), W64LIT(0xfdfdd3fdbb2ee746), W64LIT(0x4d4d294d52649a1f), W64LIT(0x92927292e4e03976), W64LIT(0x7575c9758fbceafa), W64LIT(0x06061806301e0c36), W64LIT(0x8a8a128a249809ae), W64LIT(0xb2b2f2b2f940794b), W64LIT(0xe6e6bfe66359d185), W64LIT(0x0e0e380e70361c7e), W64LIT(0x1f1f7c1ff8633ee7), W64LIT(0x6262956237f7c455), W64LIT(0xd4d477d4eea3b53a), W64LIT(0xa8a89aa829324d81), W64LIT(0x96966296c4f43152), W64LIT(0xf9f9c3f99b3aef62), W64LIT(0xc5c533c566f697a3), W64LIT(0x2525942535b14a10), W64LIT(0x59597959f220b2ab), W64LIT(0x84842a8454ae15d0), W64LIT(0x7272d572b7a7e4c5), W64LIT(0x3939e439d5dd72ec), W64LIT(0x4c4c2d4c5a619816), W64LIT(0x5e5e655eca3bbc94), W64LIT(0x7878fd78e785f09f), W64LIT(0x3838e038ddd870e5), W64LIT(0x8c8c0a8c14860598), W64LIT(0xd1d163d1c6b2bf17), W64LIT(0xa5a5aea5410b57e4), W64LIT(0xe2e2afe2434dd9a1), W64LIT(0x616199612ff8c24e), W64LIT(0xb3b3f6b3f1457b42), W64LIT(0x2121842115a54234), W64LIT(0x9c9c4a9c94d62508), W64LIT(0x1e1e781ef0663cee), W64LIT(0x4343114322528661), W64LIT(0xc7c73bc776fc93b1), W64LIT(0xfcfcd7fcb32be54f), W64LIT(0x0404100420140824), W64LIT(0x51515951b208a2e3), W64LIT(0x99995e99bcc72f25), W64LIT(0x6d6da96d4fc4da22), W64LIT(0x0d0d340d68391a65), W64LIT(0xfafacffa8335e979), W64LIT(0xdfdf5bdfb684a369), W64LIT(0x7e7ee57ed79bfca9), W64LIT(0x242490243db44819), W64LIT(0x3b3bec3bc5d776fe), W64LIT(0xabab96ab313d4b9a), W64LIT(0xcece1fce3ed181f0), W64LIT(0x1111441188552299), W64LIT(0x8f8f068f0c890383), W64LIT(0x4e4e254e4a6b9c04), W64LIT(0xb7b7e6b7d1517366), W64LIT(0xebeb8beb0b60cbe0), W64LIT(0x3c3cf03cfdcc78c1), W64LIT(0x81813e817cbf1ffd), W64LIT(0x94946a94d4fe3540), W64LIT(0xf7f7fbf7eb0cf31c), W64LIT(0xb9b9deb9a1676f18), W64LIT(0x13134c13985f268b), W64LIT(0x2c2cb02c7d9c5851), W64LIT(0xd3d36bd3d6b8bb05), W64LIT(0xe7e7bbe76b5cd38c), W64LIT(0x6e6ea56e57cbdc39), W64LIT(0xc4c437c46ef395aa), W64LIT(0x03030c03180f061b), W64LIT(0x565645568a13acdc), W64LIT(0x44440d441a49885e), W64LIT(0x7f7fe17fdf9efea0), W64LIT(0xa9a99ea921374f88), W64LIT(0x2a2aa82a4d825467), W64LIT(0xbbbbd6bbb16d6b0a), W64LIT(0xc1c123c146e29f87), W64LIT(0x53535153a202a6f1), W64LIT(0xdcdc57dcae8ba572), W64LIT(0x0b0b2c0b58271653), W64LIT(0x9d9d4e9d9cd32701), W64LIT(0x6c6cad6c47c1d82b), W64LIT(0x3131c43195f562a4), W64LIT(0x7474cd7487b9e8f3), W64LIT(0xf6f6fff6e309f115), W64LIT(0x464605460a438c4c), W64LIT(0xacac8aac092645a5), W64LIT(0x89891e893c970fb5), W64LIT(0x14145014a04428b4), W64LIT(0xe1e1a3e15b42dfba), W64LIT(0x16165816b04e2ca6), W64LIT(0x3a3ae83acdd274f7), W64LIT(0x6969b9696fd0d206), W64LIT(0x09092409482d1241), W64LIT(0x7070dd70a7ade0d7), W64LIT(0xb6b6e2b6d954716f), W64LIT(0xd0d067d0ceb7bd1e), W64LIT(0xeded93ed3b7ec7d6), W64LIT(0xcccc17cc2edb85e2), W64LIT(0x424215422a578468), W64LIT(0x98985a98b4c22d2c), W64LIT(0xa4a4aaa4490e55ed), W64LIT(0x2828a0285d885075), W64LIT(0x5c5c6d5cda31b886), W64LIT(0xf8f8c7f8933fed6b), W64LIT(0x8686228644a411c2), W64LIT(0xd818186018c07830), W64LIT(0x2623238c2305af46), W64LIT(0xb8c6c63fc67ef991), W64LIT(0xfbe8e887e8136fcd), W64LIT(0xcb878726874ca113), W64LIT(0x11b8b8dab8a9626d), W64LIT(0x0901010401080502), W64LIT(0x0d4f4f214f426e9e), W64LIT(0x9b3636d836adee6c), W64LIT(0xffa6a6a2a6590451), W64LIT(0x0cd2d26fd2debdb9), W64LIT(0x0ef5f5f3f5fb06f7), W64LIT(0x967979f979ef80f2), W64LIT(0x306f6fa16f5fcede), W64LIT(0x6d91917e91fcef3f), W64LIT(0xf852525552aa07a4), W64LIT(0x4760609d6027fdc0), W64LIT(0x35bcbccabc897665), W64LIT(0x379b9b569baccd2b), W64LIT(0x8a8e8e028e048c01), W64LIT(0xd2a3a3b6a371155b), W64LIT(0x6c0c0c300c603c18), W64LIT(0x847b7bf17bff8af6), W64LIT(0x803535d435b5e16a), W64LIT(0xf51d1d741de8693a), W64LIT(0xb3e0e0a7e05347dd), W64LIT(0x21d7d77bd7f6acb3), W64LIT(0x9cc2c22fc25eed99), W64LIT(0x432e2eb82e6d965c), W64LIT(0x294b4b314b627a96), W64LIT(0x5dfefedffea321e1), W64LIT(0xd5575741578216ae), W64LIT(0xbd15155415a8412a), W64LIT(0xe87777c1779fb6ee), W64LIT(0x923737dc37a5eb6e), W64LIT(0x9ee5e5b3e57b56d7), W64LIT(0x139f9f469f8cd923), W64LIT(0x23f0f0e7f0d317fd), W64LIT(0x204a4a354a6a7f94), W64LIT(0x44dada4fda9e95a9), W64LIT(0xa258587d58fa25b0), W64LIT(0xcfc9c903c906ca8f), W64LIT(0x7c2929a429558d52), W64LIT(0x5a0a0a280a502214), W64LIT(0x50b1b1feb1e14f7f), W64LIT(0xc9a0a0baa0691a5d), W64LIT(0x146b6bb16b7fdad6), W64LIT(0xd985852e855cab17), W64LIT(0x3cbdbdcebd817367), W64LIT(0x8f5d5d695dd234ba), W64LIT(0x9010104010805020), W64LIT(0x07f4f4f7f4f303f5), W64LIT(0xddcbcb0bcb16c08b), W64LIT(0xd33e3ef83eedc67c), W64LIT(0x2d0505140528110a), W64LIT(0x78676781671fe6ce), W64LIT(0x97e4e4b7e47353d5), W64LIT(0x0227279c2725bb4e), W64LIT(0x7341411941325882), W64LIT(0xa78b8b168b2c9d0b), W64LIT(0xf6a7a7a6a7510153), W64LIT(0xb27d7de97dcf94fa), W64LIT(0x4995956e95dcfb37), W64LIT(0x56d8d847d88e9fad), W64LIT(0x70fbfbcbfb8b30eb), W64LIT(0xcdeeee9fee2371c1), W64LIT(0xbb7c7ced7cc791f8), W64LIT(0x716666856617e3cc), W64LIT(0x7bdddd53dda68ea7), W64LIT(0xaf17175c17b84b2e), W64LIT(0x454747014702468e), W64LIT(0x1a9e9e429e84dc21), W64LIT(0xd4caca0fca1ec589), W64LIT(0x582d2db42d75995a), W64LIT(0x2ebfbfc6bf917963), W64LIT(0x3f07071c07381b0e), W64LIT(0xacadad8ead012347), W64LIT(0xb05a5a755aea2fb4), W64LIT(0xef838336836cb51b), W64LIT(0xb63333cc3385ff66), W64LIT(0x5c636391633ff2c6), W64LIT(0x1202020802100a04), W64LIT(0x93aaaa92aa393849), W64LIT(0xde7171d971afa8e2), W64LIT(0xc6c8c807c80ecf8d), W64LIT(0xd119196419c87d32), W64LIT(0x3b49493949727092), W64LIT(0x5fd9d943d9869aaf), W64LIT(0x31f2f2eff2c31df9), W64LIT(0xa8e3e3abe34b48db), W64LIT(0xb95b5b715be22ab6), W64LIT(0xbc88881a8834920d), W64LIT(0x3e9a9a529aa4c829), W64LIT(0x0b262698262dbe4c), W64LIT(0xbf3232c8328dfa64), W64LIT(0x59b0b0fab0e94a7d), W64LIT(0xf2e9e983e91b6acf), W64LIT(0x770f0f3c0f78331e), W64LIT(0x33d5d573d5e6a6b7), W64LIT(0xf480803a8074ba1d), W64LIT(0x27bebec2be997c61), W64LIT(0xebcdcd13cd26de87), W64LIT(0x893434d034bde468), W64LIT(0x3248483d487a7590), W64LIT(0x54ffffdbffab24e3), W64LIT(0x8d7a7af57af78ff4), W64LIT(0x6490907a90f4ea3d), W64LIT(0x9d5f5f615fc23ebe), W64LIT(0x3d202080201da040), W64LIT(0x0f6868bd6867d5d0), W64LIT(0xca1a1a681ad07234), W64LIT(0xb7aeae82ae192c41), W64LIT(0x7db4b4eab4c95e75), W64LIT(0xce54544d549a19a8), W64LIT(0x7f93937693ece53b), W64LIT(0x2f222288220daa44), W64LIT(0x6364648d6407e9c8), W64LIT(0x2af1f1e3f1db12ff), W64LIT(0xcc7373d173bfa2e6), W64LIT(0x8212124812905a24), W64LIT(0x7a40401d403a5d80), W64LIT(0x4808082008402810), W64LIT(0x95c3c32bc356e89b), W64LIT(0xdfecec97ec337bc5), W64LIT(0x4ddbdb4bdb9690ab), W64LIT(0xc0a1a1bea1611f5f), W64LIT(0x918d8d0e8d1c8307), W64LIT(0xc83d3df43df5c97a), W64LIT(0x5b97976697ccf133), W64LIT(0x0000000000000000), W64LIT(0xf9cfcf1bcf36d483), W64LIT(0x6e2b2bac2b458756), W64LIT(0xe17676c57697b3ec), W64LIT(0xe68282328264b019), W64LIT(0x28d6d67fd6fea9b1), W64LIT(0xc31b1b6c1bd87736), W64LIT(0x74b5b5eeb5c15b77), W64LIT(0xbeafaf86af112943), W64LIT(0x1d6a6ab56a77dfd4), W64LIT(0xea50505d50ba0da0), W64LIT(0x5745450945124c8a), W64LIT(0x38f3f3ebf3cb18fb), W64LIT(0xad3030c0309df060), W64LIT(0xc4efef9bef2b74c3), W64LIT(0xda3f3ffc3fe5c37e), W64LIT(0xc755554955921caa), W64LIT(0xdba2a2b2a2791059), W64LIT(0xe9eaea8fea0365c9), W64LIT(0x6a656589650fecca), W64LIT(0x03babad2bab96869), W64LIT(0x4a2f2fbc2f65935e), W64LIT(0x8ec0c027c04ee79d), W64LIT(0x60dede5fdebe81a1), W64LIT(0xfc1c1c701ce06c38), W64LIT(0x46fdfdd3fdbb2ee7), W64LIT(0x1f4d4d294d52649a), W64LIT(0x7692927292e4e039), W64LIT(0xfa7575c9758fbcea), W64LIT(0x3606061806301e0c), W64LIT(0xae8a8a128a249809), W64LIT(0x4bb2b2f2b2f94079), W64LIT(0x85e6e6bfe66359d1), W64LIT(0x7e0e0e380e70361c), W64LIT(0xe71f1f7c1ff8633e), W64LIT(0x556262956237f7c4), W64LIT(0x3ad4d477d4eea3b5), W64LIT(0x81a8a89aa829324d), W64LIT(0x5296966296c4f431), W64LIT(0x62f9f9c3f99b3aef), W64LIT(0xa3c5c533c566f697), W64LIT(0x102525942535b14a), W64LIT(0xab59597959f220b2), W64LIT(0xd084842a8454ae15), W64LIT(0xc57272d572b7a7e4), W64LIT(0xec3939e439d5dd72), W64LIT(0x164c4c2d4c5a6198), W64LIT(0x945e5e655eca3bbc), W64LIT(0x9f7878fd78e785f0), W64LIT(0xe53838e038ddd870), W64LIT(0x988c8c0a8c148605), W64LIT(0x17d1d163d1c6b2bf), W64LIT(0xe4a5a5aea5410b57), W64LIT(0xa1e2e2afe2434dd9), W64LIT(0x4e616199612ff8c2), W64LIT(0x42b3b3f6b3f1457b), W64LIT(0x342121842115a542), W64LIT(0x089c9c4a9c94d625), W64LIT(0xee1e1e781ef0663c), W64LIT(0x6143431143225286), W64LIT(0xb1c7c73bc776fc93), W64LIT(0x4ffcfcd7fcb32be5), W64LIT(0x2404041004201408), W64LIT(0xe351515951b208a2), W64LIT(0x2599995e99bcc72f), W64LIT(0x226d6da96d4fc4da), W64LIT(0x650d0d340d68391a), W64LIT(0x79fafacffa8335e9), W64LIT(0x69dfdf5bdfb684a3), W64LIT(0xa97e7ee57ed79bfc), W64LIT(0x19242490243db448), W64LIT(0xfe3b3bec3bc5d776), W64LIT(0x9aabab96ab313d4b), W64LIT(0xf0cece1fce3ed181), W64LIT(0x9911114411885522), W64LIT(0x838f8f068f0c8903), W64LIT(0x044e4e254e4a6b9c), W64LIT(0x66b7b7e6b7d15173), W64LIT(0xe0ebeb8beb0b60cb), W64LIT(0xc13c3cf03cfdcc78), W64LIT(0xfd81813e817cbf1f), W64LIT(0x4094946a94d4fe35), W64LIT(0x1cf7f7fbf7eb0cf3), W64LIT(0x18b9b9deb9a1676f), W64LIT(0x8b13134c13985f26), W64LIT(0x512c2cb02c7d9c58), W64LIT(0x05d3d36bd3d6b8bb), W64LIT(0x8ce7e7bbe76b5cd3), W64LIT(0x396e6ea56e57cbdc), W64LIT(0xaac4c437c46ef395), W64LIT(0x1b03030c03180f06), W64LIT(0xdc565645568a13ac), W64LIT(0x5e44440d441a4988), W64LIT(0xa07f7fe17fdf9efe), W64LIT(0x88a9a99ea921374f), W64LIT(0x672a2aa82a4d8254), W64LIT(0x0abbbbd6bbb16d6b), W64LIT(0x87c1c123c146e29f), W64LIT(0xf153535153a202a6), W64LIT(0x72dcdc57dcae8ba5), W64LIT(0x530b0b2c0b582716), W64LIT(0x019d9d4e9d9cd327), W64LIT(0x2b6c6cad6c47c1d8), W64LIT(0xa43131c43195f562), W64LIT(0xf37474cd7487b9e8), W64LIT(0x15f6f6fff6e309f1), W64LIT(0x4c464605460a438c), W64LIT(0xa5acac8aac092645), W64LIT(0xb589891e893c970f), W64LIT(0xb414145014a04428), W64LIT(0xbae1e1a3e15b42df), W64LIT(0xa616165816b04e2c), W64LIT(0xf73a3ae83acdd274), W64LIT(0x066969b9696fd0d2), W64LIT(0x4109092409482d12), W64LIT(0xd77070dd70a7ade0), W64LIT(0x6fb6b6e2b6d95471), W64LIT(0x1ed0d067d0ceb7bd), W64LIT(0xd6eded93ed3b7ec7), W64LIT(0xe2cccc17cc2edb85), W64LIT(0x68424215422a5784), W64LIT(0x2c98985a98b4c22d), W64LIT(0xeda4a4aaa4490e55), W64LIT(0x752828a0285d8850), W64LIT(0x865c5c6d5cda31b8), W64LIT(0x6bf8f8c7f8933fed), W64LIT(0xc28686228644a411), W64LIT(0x30d818186018c078), W64LIT(0x462623238c2305af), W64LIT(0x91b8c6c63fc67ef9), W64LIT(0xcdfbe8e887e8136f), W64LIT(0x13cb878726874ca1), W64LIT(0x6d11b8b8dab8a962), W64LIT(0x0209010104010805), W64LIT(0x9e0d4f4f214f426e), W64LIT(0x6c9b3636d836adee), W64LIT(0x51ffa6a6a2a65904), W64LIT(0xb90cd2d26fd2debd), W64LIT(0xf70ef5f5f3f5fb06), W64LIT(0xf2967979f979ef80), W64LIT(0xde306f6fa16f5fce), W64LIT(0x3f6d91917e91fcef), W64LIT(0xa4f852525552aa07), W64LIT(0xc04760609d6027fd), W64LIT(0x6535bcbccabc8976), W64LIT(0x2b379b9b569baccd), W64LIT(0x018a8e8e028e048c), W64LIT(0x5bd2a3a3b6a37115), W64LIT(0x186c0c0c300c603c), W64LIT(0xf6847b7bf17bff8a), W64LIT(0x6a803535d435b5e1), W64LIT(0x3af51d1d741de869), W64LIT(0xddb3e0e0a7e05347), W64LIT(0xb321d7d77bd7f6ac), W64LIT(0x999cc2c22fc25eed), W64LIT(0x5c432e2eb82e6d96), W64LIT(0x96294b4b314b627a), W64LIT(0xe15dfefedffea321), W64LIT(0xaed5575741578216), W64LIT(0x2abd15155415a841), W64LIT(0xeee87777c1779fb6), W64LIT(0x6e923737dc37a5eb), W64LIT(0xd79ee5e5b3e57b56), W64LIT(0x23139f9f469f8cd9), W64LIT(0xfd23f0f0e7f0d317), W64LIT(0x94204a4a354a6a7f), W64LIT(0xa944dada4fda9e95), W64LIT(0xb0a258587d58fa25), W64LIT(0x8fcfc9c903c906ca), W64LIT(0x527c2929a429558d), W64LIT(0x145a0a0a280a5022), W64LIT(0x7f50b1b1feb1e14f), W64LIT(0x5dc9a0a0baa0691a), W64LIT(0xd6146b6bb16b7fda), W64LIT(0x17d985852e855cab), W64LIT(0x673cbdbdcebd8173), W64LIT(0xba8f5d5d695dd234), W64LIT(0x2090101040108050), W64LIT(0xf507f4f4f7f4f303), W64LIT(0x8bddcbcb0bcb16c0), W64LIT(0x7cd33e3ef83eedc6), W64LIT(0x0a2d050514052811), W64LIT(0xce78676781671fe6), W64LIT(0xd597e4e4b7e47353), W64LIT(0x4e0227279c2725bb), W64LIT(0x8273414119413258), W64LIT(0x0ba78b8b168b2c9d), W64LIT(0x53f6a7a7a6a75101), W64LIT(0xfab27d7de97dcf94), W64LIT(0x374995956e95dcfb), W64LIT(0xad56d8d847d88e9f), W64LIT(0xeb70fbfbcbfb8b30), W64LIT(0xc1cdeeee9fee2371), W64LIT(0xf8bb7c7ced7cc791), W64LIT(0xcc716666856617e3), W64LIT(0xa77bdddd53dda68e), W64LIT(0x2eaf17175c17b84b), W64LIT(0x8e45474701470246), W64LIT(0x211a9e9e429e84dc), W64LIT(0x89d4caca0fca1ec5), W64LIT(0x5a582d2db42d7599), W64LIT(0x632ebfbfc6bf9179), W64LIT(0x0e3f07071c07381b), W64LIT(0x47acadad8ead0123), W64LIT(0xb4b05a5a755aea2f), W64LIT(0x1bef838336836cb5), W64LIT(0x66b63333cc3385ff), W64LIT(0xc65c636391633ff2), W64LIT(0x041202020802100a), W64LIT(0x4993aaaa92aa3938), W64LIT(0xe2de7171d971afa8), W64LIT(0x8dc6c8c807c80ecf), W64LIT(0x32d119196419c87d), W64LIT(0x923b494939497270), W64LIT(0xaf5fd9d943d9869a), W64LIT(0xf931f2f2eff2c31d), W64LIT(0xdba8e3e3abe34b48), W64LIT(0xb6b95b5b715be22a), W64LIT(0x0dbc88881a883492), W64LIT(0x293e9a9a529aa4c8), W64LIT(0x4c0b262698262dbe), W64LIT(0x64bf3232c8328dfa), W64LIT(0x7d59b0b0fab0e94a), W64LIT(0xcff2e9e983e91b6a), W64LIT(0x1e770f0f3c0f7833), W64LIT(0xb733d5d573d5e6a6), W64LIT(0x1df480803a8074ba), W64LIT(0x6127bebec2be997c), W64LIT(0x87ebcdcd13cd26de), W64LIT(0x68893434d034bde4), W64LIT(0x903248483d487a75), W64LIT(0xe354ffffdbffab24), W64LIT(0xf48d7a7af57af78f), W64LIT(0x3d6490907a90f4ea), W64LIT(0xbe9d5f5f615fc23e), W64LIT(0x403d202080201da0), W64LIT(0xd00f6868bd6867d5), W64LIT(0x34ca1a1a681ad072), W64LIT(0x41b7aeae82ae192c), W64LIT(0x757db4b4eab4c95e), W64LIT(0xa8ce54544d549a19), W64LIT(0x3b7f93937693ece5), W64LIT(0x442f222288220daa), W64LIT(0xc86364648d6407e9), W64LIT(0xff2af1f1e3f1db12), W64LIT(0xe6cc7373d173bfa2), W64LIT(0x248212124812905a), W64LIT(0x807a40401d403a5d), W64LIT(0x1048080820084028), W64LIT(0x9b95c3c32bc356e8), W64LIT(0xc5dfecec97ec337b), W64LIT(0xab4ddbdb4bdb9690), W64LIT(0x5fc0a1a1bea1611f), W64LIT(0x07918d8d0e8d1c83), W64LIT(0x7ac83d3df43df5c9), W64LIT(0x335b97976697ccf1), W64LIT(0x0000000000000000), W64LIT(0x83f9cfcf1bcf36d4), W64LIT(0x566e2b2bac2b4587), W64LIT(0xece17676c57697b3), W64LIT(0x19e68282328264b0), W64LIT(0xb128d6d67fd6fea9), W64LIT(0x36c31b1b6c1bd877), W64LIT(0x7774b5b5eeb5c15b), W64LIT(0x43beafaf86af1129), W64LIT(0xd41d6a6ab56a77df), W64LIT(0xa0ea50505d50ba0d), W64LIT(0x8a5745450945124c), W64LIT(0xfb38f3f3ebf3cb18), W64LIT(0x60ad3030c0309df0), W64LIT(0xc3c4efef9bef2b74), W64LIT(0x7eda3f3ffc3fe5c3), W64LIT(0xaac755554955921c), W64LIT(0x59dba2a2b2a27910), W64LIT(0xc9e9eaea8fea0365), W64LIT(0xca6a656589650fec), W64LIT(0x6903babad2bab968), W64LIT(0x5e4a2f2fbc2f6593), W64LIT(0x9d8ec0c027c04ee7), W64LIT(0xa160dede5fdebe81), W64LIT(0x38fc1c1c701ce06c), W64LIT(0xe746fdfdd3fdbb2e), W64LIT(0x9a1f4d4d294d5264), W64LIT(0x397692927292e4e0), W64LIT(0xeafa7575c9758fbc), W64LIT(0x0c3606061806301e), W64LIT(0x09ae8a8a128a2498), W64LIT(0x794bb2b2f2b2f940), W64LIT(0xd185e6e6bfe66359), W64LIT(0x1c7e0e0e380e7036), W64LIT(0x3ee71f1f7c1ff863), W64LIT(0xc4556262956237f7), W64LIT(0xb53ad4d477d4eea3), W64LIT(0x4d81a8a89aa82932), W64LIT(0x315296966296c4f4), W64LIT(0xef62f9f9c3f99b3a), W64LIT(0x97a3c5c533c566f6), W64LIT(0x4a102525942535b1), W64LIT(0xb2ab59597959f220), W64LIT(0x15d084842a8454ae), W64LIT(0xe4c57272d572b7a7), W64LIT(0x72ec3939e439d5dd), W64LIT(0x98164c4c2d4c5a61), W64LIT(0xbc945e5e655eca3b), W64LIT(0xf09f7878fd78e785), W64LIT(0x70e53838e038ddd8), W64LIT(0x05988c8c0a8c1486), W64LIT(0xbf17d1d163d1c6b2), W64LIT(0x57e4a5a5aea5410b), W64LIT(0xd9a1e2e2afe2434d), W64LIT(0xc24e616199612ff8), W64LIT(0x7b42b3b3f6b3f145), W64LIT(0x42342121842115a5), W64LIT(0x25089c9c4a9c94d6), W64LIT(0x3cee1e1e781ef066), W64LIT(0x8661434311432252), W64LIT(0x93b1c7c73bc776fc), W64LIT(0xe54ffcfcd7fcb32b), W64LIT(0x0824040410042014), W64LIT(0xa2e351515951b208), W64LIT(0x2f2599995e99bcc7), W64LIT(0xda226d6da96d4fc4), W64LIT(0x1a650d0d340d6839), W64LIT(0xe979fafacffa8335), W64LIT(0xa369dfdf5bdfb684), W64LIT(0xfca97e7ee57ed79b), W64LIT(0x4819242490243db4), W64LIT(0x76fe3b3bec3bc5d7), W64LIT(0x4b9aabab96ab313d), W64LIT(0x81f0cece1fce3ed1), W64LIT(0x2299111144118855), W64LIT(0x03838f8f068f0c89), W64LIT(0x9c044e4e254e4a6b), W64LIT(0x7366b7b7e6b7d151), W64LIT(0xcbe0ebeb8beb0b60), W64LIT(0x78c13c3cf03cfdcc), W64LIT(0x1ffd81813e817cbf), W64LIT(0x354094946a94d4fe), W64LIT(0xf31cf7f7fbf7eb0c), W64LIT(0x6f18b9b9deb9a167), W64LIT(0x268b13134c13985f), W64LIT(0x58512c2cb02c7d9c), W64LIT(0xbb05d3d36bd3d6b8), W64LIT(0xd38ce7e7bbe76b5c), W64LIT(0xdc396e6ea56e57cb), W64LIT(0x95aac4c437c46ef3), W64LIT(0x061b03030c03180f), W64LIT(0xacdc565645568a13), W64LIT(0x885e44440d441a49), W64LIT(0xfea07f7fe17fdf9e), W64LIT(0x4f88a9a99ea92137), W64LIT(0x54672a2aa82a4d82), W64LIT(0x6b0abbbbd6bbb16d), W64LIT(0x9f87c1c123c146e2), W64LIT(0xa6f153535153a202), W64LIT(0xa572dcdc57dcae8b), W64LIT(0x16530b0b2c0b5827), W64LIT(0x27019d9d4e9d9cd3), W64LIT(0xd82b6c6cad6c47c1), W64LIT(0x62a43131c43195f5), W64LIT(0xe8f37474cd7487b9), W64LIT(0xf115f6f6fff6e309), W64LIT(0x8c4c464605460a43), W64LIT(0x45a5acac8aac0926), W64LIT(0x0fb589891e893c97), W64LIT(0x28b414145014a044), W64LIT(0xdfbae1e1a3e15b42), W64LIT(0x2ca616165816b04e), W64LIT(0x74f73a3ae83acdd2), W64LIT(0xd2066969b9696fd0), W64LIT(0x124109092409482d), W64LIT(0xe0d77070dd70a7ad), W64LIT(0x716fb6b6e2b6d954), W64LIT(0xbd1ed0d067d0ceb7), W64LIT(0xc7d6eded93ed3b7e), W64LIT(0x85e2cccc17cc2edb), W64LIT(0x8468424215422a57), W64LIT(0x2d2c98985a98b4c2), W64LIT(0x55eda4a4aaa4490e), W64LIT(0x50752828a0285d88), W64LIT(0xb8865c5c6d5cda31), W64LIT(0xed6bf8f8c7f8933f), W64LIT(0x11c28686228644a4), W64LIT(0x7830d818186018c0), W64LIT(0xaf462623238c2305), W64LIT(0xf991b8c6c63fc67e), W64LIT(0x6fcdfbe8e887e813), W64LIT(0xa113cb878726874c), W64LIT(0x626d11b8b8dab8a9), W64LIT(0x0502090101040108), W64LIT(0x6e9e0d4f4f214f42), W64LIT(0xee6c9b3636d836ad), W64LIT(0x0451ffa6a6a2a659), W64LIT(0xbdb90cd2d26fd2de), W64LIT(0x06f70ef5f5f3f5fb), W64LIT(0x80f2967979f979ef), W64LIT(0xcede306f6fa16f5f), W64LIT(0xef3f6d91917e91fc), W64LIT(0x07a4f852525552aa), W64LIT(0xfdc04760609d6027), W64LIT(0x766535bcbccabc89), W64LIT(0xcd2b379b9b569bac), W64LIT(0x8c018a8e8e028e04), W64LIT(0x155bd2a3a3b6a371), W64LIT(0x3c186c0c0c300c60), W64LIT(0x8af6847b7bf17bff), W64LIT(0xe16a803535d435b5), W64LIT(0x693af51d1d741de8), W64LIT(0x47ddb3e0e0a7e053), W64LIT(0xacb321d7d77bd7f6), W64LIT(0xed999cc2c22fc25e), W64LIT(0x965c432e2eb82e6d), W64LIT(0x7a96294b4b314b62), W64LIT(0x21e15dfefedffea3), W64LIT(0x16aed55757415782), W64LIT(0x412abd15155415a8), W64LIT(0xb6eee87777c1779f), W64LIT(0xeb6e923737dc37a5), W64LIT(0x56d79ee5e5b3e57b), W64LIT(0xd923139f9f469f8c), W64LIT(0x17fd23f0f0e7f0d3), W64LIT(0x7f94204a4a354a6a), W64LIT(0x95a944dada4fda9e), W64LIT(0x25b0a258587d58fa), W64LIT(0xca8fcfc9c903c906), W64LIT(0x8d527c2929a42955), W64LIT(0x22145a0a0a280a50), W64LIT(0x4f7f50b1b1feb1e1), W64LIT(0x1a5dc9a0a0baa069), W64LIT(0xdad6146b6bb16b7f), W64LIT(0xab17d985852e855c), W64LIT(0x73673cbdbdcebd81), W64LIT(0x34ba8f5d5d695dd2), W64LIT(0x5020901010401080), W64LIT(0x03f507f4f4f7f4f3), W64LIT(0xc08bddcbcb0bcb16), W64LIT(0xc67cd33e3ef83eed), W64LIT(0x110a2d0505140528), W64LIT(0xe6ce78676781671f), W64LIT(0x53d597e4e4b7e473), W64LIT(0xbb4e0227279c2725), W64LIT(0x5882734141194132), W64LIT(0x9d0ba78b8b168b2c), W64LIT(0x0153f6a7a7a6a751), W64LIT(0x94fab27d7de97dcf), W64LIT(0xfb374995956e95dc), W64LIT(0x9fad56d8d847d88e), W64LIT(0x30eb70fbfbcbfb8b), W64LIT(0x71c1cdeeee9fee23), W64LIT(0x91f8bb7c7ced7cc7), W64LIT(0xe3cc716666856617), W64LIT(0x8ea77bdddd53dda6), W64LIT(0x4b2eaf17175c17b8), W64LIT(0x468e454747014702), W64LIT(0xdc211a9e9e429e84), W64LIT(0xc589d4caca0fca1e), W64LIT(0x995a582d2db42d75), W64LIT(0x79632ebfbfc6bf91), W64LIT(0x1b0e3f07071c0738), W64LIT(0x2347acadad8ead01), W64LIT(0x2fb4b05a5a755aea), W64LIT(0xb51bef838336836c), W64LIT(0xff66b63333cc3385), W64LIT(0xf2c65c636391633f), W64LIT(0x0a04120202080210), W64LIT(0x384993aaaa92aa39), W64LIT(0xa8e2de7171d971af), W64LIT(0xcf8dc6c8c807c80e), W64LIT(0x7d32d119196419c8), W64LIT(0x70923b4949394972), W64LIT(0x9aaf5fd9d943d986), W64LIT(0x1df931f2f2eff2c3), W64LIT(0x48dba8e3e3abe34b), W64LIT(0x2ab6b95b5b715be2), W64LIT(0x920dbc88881a8834), W64LIT(0xc8293e9a9a529aa4), W64LIT(0xbe4c0b262698262d), W64LIT(0xfa64bf3232c8328d), W64LIT(0x4a7d59b0b0fab0e9), W64LIT(0x6acff2e9e983e91b), W64LIT(0x331e770f0f3c0f78), W64LIT(0xa6b733d5d573d5e6), W64LIT(0xba1df480803a8074), W64LIT(0x7c6127bebec2be99), W64LIT(0xde87ebcdcd13cd26), W64LIT(0xe468893434d034bd), W64LIT(0x75903248483d487a), W64LIT(0x24e354ffffdbffab), W64LIT(0x8ff48d7a7af57af7), W64LIT(0xea3d6490907a90f4), W64LIT(0x3ebe9d5f5f615fc2), W64LIT(0xa0403d202080201d), W64LIT(0xd5d00f6868bd6867), W64LIT(0x7234ca1a1a681ad0), W64LIT(0x2c41b7aeae82ae19), W64LIT(0x5e757db4b4eab4c9), W64LIT(0x19a8ce54544d549a), W64LIT(0xe53b7f93937693ec), W64LIT(0xaa442f222288220d), W64LIT(0xe9c86364648d6407), W64LIT(0x12ff2af1f1e3f1db), W64LIT(0xa2e6cc7373d173bf), W64LIT(0x5a24821212481290), W64LIT(0x5d807a40401d403a), W64LIT(0x2810480808200840), W64LIT(0xe89b95c3c32bc356), W64LIT(0x7bc5dfecec97ec33), W64LIT(0x90ab4ddbdb4bdb96), W64LIT(0x1f5fc0a1a1bea161), W64LIT(0x8307918d8d0e8d1c), W64LIT(0xc97ac83d3df43df5), W64LIT(0xf1335b97976697cc), W64LIT(0x0000000000000000), W64LIT(0xd483f9cfcf1bcf36), W64LIT(0x87566e2b2bac2b45), W64LIT(0xb3ece17676c57697), W64LIT(0xb019e68282328264), W64LIT(0xa9b128d6d67fd6fe), W64LIT(0x7736c31b1b6c1bd8), W64LIT(0x5b7774b5b5eeb5c1), W64LIT(0x2943beafaf86af11), W64LIT(0xdfd41d6a6ab56a77), W64LIT(0x0da0ea50505d50ba), W64LIT(0x4c8a574545094512), W64LIT(0x18fb38f3f3ebf3cb), W64LIT(0xf060ad3030c0309d), W64LIT(0x74c3c4efef9bef2b), W64LIT(0xc37eda3f3ffc3fe5), W64LIT(0x1caac75555495592), W64LIT(0x1059dba2a2b2a279), W64LIT(0x65c9e9eaea8fea03), W64LIT(0xecca6a656589650f), W64LIT(0x686903babad2bab9), W64LIT(0x935e4a2f2fbc2f65), W64LIT(0xe79d8ec0c027c04e), W64LIT(0x81a160dede5fdebe), W64LIT(0x6c38fc1c1c701ce0), W64LIT(0x2ee746fdfdd3fdbb), W64LIT(0x649a1f4d4d294d52), W64LIT(0xe0397692927292e4), W64LIT(0xbceafa7575c9758f), W64LIT(0x1e0c360606180630), W64LIT(0x9809ae8a8a128a24), W64LIT(0x40794bb2b2f2b2f9), W64LIT(0x59d185e6e6bfe663), W64LIT(0x361c7e0e0e380e70), W64LIT(0x633ee71f1f7c1ff8), W64LIT(0xf7c4556262956237), W64LIT(0xa3b53ad4d477d4ee), W64LIT(0x324d81a8a89aa829), W64LIT(0xf4315296966296c4), W64LIT(0x3aef62f9f9c3f99b), W64LIT(0xf697a3c5c533c566), W64LIT(0xb14a102525942535), W64LIT(0x20b2ab59597959f2), W64LIT(0xae15d084842a8454), W64LIT(0xa7e4c57272d572b7), W64LIT(0xdd72ec3939e439d5), W64LIT(0x6198164c4c2d4c5a), W64LIT(0x3bbc945e5e655eca), W64LIT(0x85f09f7878fd78e7), W64LIT(0xd870e53838e038dd), W64LIT(0x8605988c8c0a8c14), W64LIT(0xb2bf17d1d163d1c6), W64LIT(0x0b57e4a5a5aea541), W64LIT(0x4dd9a1e2e2afe243), W64LIT(0xf8c24e616199612f), W64LIT(0x457b42b3b3f6b3f1), W64LIT(0xa542342121842115), W64LIT(0xd625089c9c4a9c94), W64LIT(0x663cee1e1e781ef0), W64LIT(0x5286614343114322), W64LIT(0xfc93b1c7c73bc776), W64LIT(0x2be54ffcfcd7fcb3), W64LIT(0x1408240404100420), W64LIT(0x08a2e351515951b2), W64LIT(0xc72f2599995e99bc), W64LIT(0xc4da226d6da96d4f), W64LIT(0x391a650d0d340d68), W64LIT(0x35e979fafacffa83), W64LIT(0x84a369dfdf5bdfb6), W64LIT(0x9bfca97e7ee57ed7), W64LIT(0xb44819242490243d), W64LIT(0xd776fe3b3bec3bc5), W64LIT(0x3d4b9aabab96ab31), W64LIT(0xd181f0cece1fce3e), W64LIT(0x5522991111441188), W64LIT(0x8903838f8f068f0c), W64LIT(0x6b9c044e4e254e4a), W64LIT(0x517366b7b7e6b7d1), W64LIT(0x60cbe0ebeb8beb0b), W64LIT(0xcc78c13c3cf03cfd), W64LIT(0xbf1ffd81813e817c), W64LIT(0xfe354094946a94d4), W64LIT(0x0cf31cf7f7fbf7eb), W64LIT(0x676f18b9b9deb9a1), W64LIT(0x5f268b13134c1398), W64LIT(0x9c58512c2cb02c7d), W64LIT(0xb8bb05d3d36bd3d6), W64LIT(0x5cd38ce7e7bbe76b), W64LIT(0xcbdc396e6ea56e57), W64LIT(0xf395aac4c437c46e), W64LIT(0x0f061b03030c0318), W64LIT(0x13acdc565645568a), W64LIT(0x49885e44440d441a), W64LIT(0x9efea07f7fe17fdf), W64LIT(0x374f88a9a99ea921), W64LIT(0x8254672a2aa82a4d), W64LIT(0x6d6b0abbbbd6bbb1), W64LIT(0xe29f87c1c123c146), W64LIT(0x02a6f153535153a2), W64LIT(0x8ba572dcdc57dcae), W64LIT(0x2716530b0b2c0b58), W64LIT(0xd327019d9d4e9d9c), W64LIT(0xc1d82b6c6cad6c47), W64LIT(0xf562a43131c43195), W64LIT(0xb9e8f37474cd7487), W64LIT(0x09f115f6f6fff6e3), W64LIT(0x438c4c464605460a), W64LIT(0x2645a5acac8aac09), W64LIT(0x970fb589891e893c), W64LIT(0x4428b414145014a0), W64LIT(0x42dfbae1e1a3e15b), W64LIT(0x4e2ca616165816b0), W64LIT(0xd274f73a3ae83acd), W64LIT(0xd0d2066969b9696f), W64LIT(0x2d12410909240948), W64LIT(0xade0d77070dd70a7), W64LIT(0x54716fb6b6e2b6d9), W64LIT(0xb7bd1ed0d067d0ce), W64LIT(0x7ec7d6eded93ed3b), W64LIT(0xdb85e2cccc17cc2e), W64LIT(0x578468424215422a), W64LIT(0xc22d2c98985a98b4), W64LIT(0x0e55eda4a4aaa449), W64LIT(0x8850752828a0285d), W64LIT(0x31b8865c5c6d5cda), W64LIT(0x3fed6bf8f8c7f893), W64LIT(0xa411c28686228644), W64LIT(0x1823c6e887b8014f), W64LIT(0x36a6d2f5796f9152), W64LIT(0x60bc9b8ea30c7b35), W64LIT(0x1de0d7c22e4bfe57), W64LIT(0x157737e59ff04ada), W64LIT(0x58c9290ab1a06b85), W64LIT(0xbd5d10f4cb3e0567), W64LIT(0xe427418ba77d95d8), W64LIT(0xfbee7c66dd17479e), W64LIT(0xca2dbf07ad5a8333) }; // Whirlpool basic transformation. Transforms state based on block. void Whirlpool::Transform(word64 *digest, const word64 *block) { #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE if (HasISSE()) { // MMX version has the same structure as C version below #ifdef __GNUC__ #if CRYPTOPP_BOOL_X64 word64 workspace[16]; #endif __asm__ __volatile__ ( ".intel_syntax noprefix;" AS_PUSH_IF86( bx) AS2( mov AS_REG_6, WORD_REG(ax)) #else #if _MSC_VER < 1300 AS_PUSH_IF86( bx) #endif AS2( lea AS_REG_6, [Whirlpool_C]) AS2( mov WORD_REG(cx), digest) AS2( mov WORD_REG(dx), block) #endif #if CRYPTOPP_BOOL_X86 AS2( mov eax, esp) AS2( and esp, -16) AS2( sub esp, 16*8) AS1( push eax) #define SSE2_workspace esp+WORD_SZ #else #define SSE2_workspace %3 #endif AS2( xor esi, esi) ASL(0) AS2( movq mm0, [WORD_REG(cx)+8*WORD_REG(si)]) AS2( movq [SSE2_workspace+8*WORD_REG(si)], mm0) // k AS2( pxor mm0, [WORD_REG(dx)+8*WORD_REG(si)]) AS2( movq [SSE2_workspace+64+8*WORD_REG(si)], mm0) // s AS2( movq [WORD_REG(cx)+8*WORD_REG(si)], mm0) AS1( inc WORD_REG(si)) AS2( cmp WORD_REG(si), 8) ASJ( jne, 0, b) AS2( xor esi, esi) ASL(1) #define KSL0(a, b) AS2(movq mm##a, b) #define KSL1(a, b) AS2(pxor mm##a, b) #define KSL(op, i, a, b, c, d) \ AS2(mov eax, [SSE2_workspace+8*i])\ AS2(movzx edi, al)\ KSL##op(a, [AS_REG_6+3*2048+8*WORD_REG(di)])\ AS2(movzx edi, ah)\ KSL##op(b, [AS_REG_6+2*2048+8*WORD_REG(di)])\ AS2(shr eax, 16)\ AS2(movzx edi, al)\ AS2(shr eax, 8)\ KSL##op(c, [AS_REG_6+1*2048+8*WORD_REG(di)])\ KSL##op(d, [AS_REG_6+0*2048+8*WORD_REG(ax)]) #define KSH0(a, b) \ ASS(pshufw mm##a, mm##a, 1, 0, 3, 2)\ AS2(pxor mm##a, b) #define KSH1(a, b) \ AS2(pxor mm##a, b) #define KSH2(a, b) \ AS2(pxor mm##a, b)\ AS2(movq [SSE2_workspace+8*a], mm##a) #define KSH(op, i, a, b, c, d) \ AS2(mov eax, [SSE2_workspace+8*((i+4)-8*((i+4)/8))+4])\ AS2(movzx edi, al)\ KSH##op(a, [AS_REG_6+3*2048+8*WORD_REG(di)])\ AS2(movzx edi, ah)\ KSH##op(b, [AS_REG_6+2*2048+8*WORD_REG(di)])\ AS2(shr eax, 16)\ AS2(movzx edi, al)\ AS2(shr eax, 8)\ KSH##op(c, [AS_REG_6+1*2048+8*WORD_REG(di)])\ KSH##op(d, [AS_REG_6+0*2048+8*WORD_REG(ax)]) #define TSL(op, i, a, b, c, d) \ AS2(mov eax, [SSE2_workspace+64+8*i])\ AS2(movzx edi, al)\ KSL##op(a, [AS_REG_6+3*2048+8*WORD_REG(di)])\ AS2(movzx edi, ah)\ KSL##op(b, [AS_REG_6+2*2048+8*WORD_REG(di)])\ AS2(shr eax, 16)\ AS2(movzx edi, al)\ AS2(shr eax, 8)\ KSL##op(c, [AS_REG_6+1*2048+8*WORD_REG(di)])\ KSL##op(d, [AS_REG_6+0*2048+8*WORD_REG(ax)]) #define TSH0(a, b) \ ASS(pshufw mm##a, mm##a, 1, 0, 3, 2)\ AS2(pxor mm##a, [SSE2_workspace+8*a])\ AS2(pxor mm##a, b) #define TSH1(a, b) \ AS2(pxor mm##a, b) #define TSH2(a, b) \ AS2(pxor mm##a, b)\ AS2(movq [SSE2_workspace+64+8*a], mm##a) #define TSH3(a, b) \ AS2(pxor mm##a, b)\ AS2(pxor mm##a, [WORD_REG(cx)+8*a])\ AS2(movq [WORD_REG(cx)+8*a], mm##a) #define TSH(op, i, a, b, c, d) \ AS2(mov eax, [SSE2_workspace+64+8*((i+4)-8*((i+4)/8))+4])\ AS2(movzx edi, al)\ TSH##op(a, [AS_REG_6+3*2048+8*WORD_REG(di)])\ AS2(movzx edi, ah)\ TSH##op(b, [AS_REG_6+2*2048+8*WORD_REG(di)])\ AS2(shr eax, 16)\ AS2(movzx edi, al)\ AS2(shr eax, 8)\ TSH##op(c, [AS_REG_6+1*2048+8*WORD_REG(di)])\ TSH##op(d, [AS_REG_6+0*2048+8*WORD_REG(ax)]) KSL(0, 4, 3, 2, 1, 0) KSL(0, 0, 7, 6, 5, 4) KSL(1, 1, 0, 7, 6, 5) KSL(1, 2, 1, 0, 7, 6) KSL(1, 3, 2, 1, 0, 7) KSL(1, 5, 4, 3, 2, 1) KSL(1, 6, 5, 4, 3, 2) KSL(1, 7, 6, 5, 4, 3) KSH(0, 0, 7, 6, 5, 4) KSH(0, 4, 3, 2, 1, 0) KSH(1, 1, 0, 7, 6, 5) KSH(1, 2, 1, 0, 7, 6) KSH(1, 5, 4, 3, 2, 1) KSH(1, 6, 5, 4, 3, 2) KSH(2, 3, 2, 1, 0, 7) KSH(2, 7, 6, 5, 4, 3) AS2( pxor mm0, [AS_REG_6 + 8*1024 + WORD_REG(si)*8]) AS2( movq [SSE2_workspace], mm0) TSL(0, 4, 3, 2, 1, 0) TSL(0, 0, 7, 6, 5, 4) TSL(1, 1, 0, 7, 6, 5) TSL(1, 2, 1, 0, 7, 6) TSL(1, 3, 2, 1, 0, 7) TSL(1, 5, 4, 3, 2, 1) TSL(1, 6, 5, 4, 3, 2) TSL(1, 7, 6, 5, 4, 3) TSH(0, 0, 7, 6, 5, 4) TSH(0, 4, 3, 2, 1, 0) TSH(1, 1, 0, 7, 6, 5) TSH(1, 2, 1, 0, 7, 6) TSH(1, 5, 4, 3, 2, 1) TSH(1, 6, 5, 4, 3, 2) AS1( inc WORD_REG(si)) AS2( cmp WORD_REG(si), 10) ASJ( je, 2, f) TSH(2, 3, 2, 1, 0, 7) TSH(2, 7, 6, 5, 4, 3) ASJ( jmp, 1, b) ASL(2) TSH(3, 3, 2, 1, 0, 7) TSH(3, 7, 6, 5, 4, 3) #undef KSL #undef KSH #undef TSL #undef TSH AS_POP_IF86( sp) AS1( emms) #if defined(__GNUC__) || (defined(_MSC_VER) && _MSC_VER < 1300) AS_POP_IF86( bx) #endif #ifdef __GNUC__ ".att_syntax prefix;" : : "a" (Whirlpool_C), "c" (digest), "d" (block) #if CRYPTOPP_BOOL_X64 , "r" (workspace) #endif : "%esi", "%edi", "memory", "cc" #if CRYPTOPP_BOOL_X64 , "%r9" #endif ); #endif } else #endif // #ifdef CRYPTOPP_X86_ASM_AVAILABLE { word64 s[8]; // the cipher state word64 k[8]; // the round key // Compute and apply K^0 to the cipher state // Also apply part of the Miyaguchi-Preneel compression function for (int i=0; i<8; i++) digest[i] = s[i] = block[i] ^ (k[i] = digest[i]); #define KSL(op, i, a, b, c, d) \ t = (word32)k[i];\ w##a = Whirlpool_C[3*256 + (byte)t] ^ (op ? w##a : 0);\ t >>= 8;\ w##b = Whirlpool_C[2*256 + (byte)t] ^ (op ? w##b : 0);\ t >>= 8;\ w##c = Whirlpool_C[1*256 + (byte)t] ^ (op ? w##c : 0);\ t >>= 8;\ w##d = Whirlpool_C[0*256 + t] ^ (op ? w##d : 0); #define KSH(op, i, a, b, c, d) \ t = (word32)(k[(i+4)%8]>>32);\ w##a = Whirlpool_C[3*256 + (byte)t] ^ (op ? w##a : rotrFixed(w##a, 32));\ if (op==2) k[a] = w##a;\ t >>= 8;\ w##b = Whirlpool_C[2*256 + (byte)t] ^ (op ? w##b : rotrFixed(w##b, 32));\ if (op==2) k[b] = w##b;\ t >>= 8;\ w##c = Whirlpool_C[1*256 + (byte)t] ^ (op ? w##c : rotrFixed(w##c, 32));\ if (op==2) k[c] = w##c;\ t >>= 8;\ w##d = Whirlpool_C[0*256 + t] ^ (op ? w##d : rotrFixed(w##d, 32));\ if (op==2) k[d] = w##d;\ #define TSL(op, i, a, b, c, d) \ t = (word32)s[i];\ w##a = Whirlpool_C[3*256 + (byte)t] ^ (op ? w##a : 0);\ t >>= 8;\ w##b = Whirlpool_C[2*256 + (byte)t] ^ (op ? w##b : 0);\ t >>= 8;\ w##c = Whirlpool_C[1*256 + (byte)t] ^ (op ? w##c : 0);\ t >>= 8;\ w##d = Whirlpool_C[0*256 + t] ^ (op ? w##d : 0); #define TSH_OP(op, a, b) \ w##a = Whirlpool_C[b*256 + (byte)t] ^ (op ? w##a : rotrFixed(w##a, 32) ^ k[a]);\ if (op==2) s[a] = w##a;\ if (op==3) digest[a] ^= w##a;\ #define TSH(op, i, a, b, c, d) \ t = (word32)(s[(i+4)%8]>>32);\ TSH_OP(op, a, 3);\ t >>= 8;\ TSH_OP(op, b, 2);\ t >>= 8;\ TSH_OP(op, c, 1);\ t >>= 8;\ TSH_OP(op, d, 0);\ // Iterate over all rounds: int r=0; while (true) { word64 w0, w1, w2, w3, w4, w5, w6, w7; // temporary storage word32 t; KSL(0, 4, 3, 2, 1, 0) KSL(0, 0, 7, 6, 5, 4) KSL(1, 1, 0, 7, 6, 5) KSL(1, 2, 1, 0, 7, 6) KSL(1, 3, 2, 1, 0, 7) KSL(1, 5, 4, 3, 2, 1) KSL(1, 6, 5, 4, 3, 2) KSL(1, 7, 6, 5, 4, 3) KSH(0, 0, 7, 6, 5, 4) KSH(0, 4, 3, 2, 1, 0) KSH(1, 1, 0, 7, 6, 5) KSH(1, 2, 1, 0, 7, 6) KSH(1, 5, 4, 3, 2, 1) KSH(1, 6, 5, 4, 3, 2) KSH(2, 3, 2, 1, 0, 7) KSH(2, 7, 6, 5, 4, 3) k[0] ^= Whirlpool_C[1024+r]; TSL(0, 4, 3, 2, 1, 0) TSL(0, 0, 7, 6, 5, 4) TSL(1, 1, 0, 7, 6, 5) TSL(1, 2, 1, 0, 7, 6) TSL(1, 3, 2, 1, 0, 7) TSL(1, 5, 4, 3, 2, 1) TSL(1, 6, 5, 4, 3, 2) TSL(1, 7, 6, 5, 4, 3) TSH(0, 0, 7, 6, 5, 4) TSH(0, 4, 3, 2, 1, 0) TSH(1, 1, 0, 7, 6, 5) TSH(1, 2, 1, 0, 7, 6) TSH(1, 5, 4, 3, 2, 1) TSH(1, 6, 5, 4, 3, 2) if (++r < R) { TSH(2, 3, 2, 1, 0, 7) TSH(2, 7, 6, 5, 4, 3) } else { TSH(3, 3, 2, 1, 0, 7) TSH(3, 7, 6, 5, 4, 3) break; } } } } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/cryptest.vcproj0000755000000000000000000011275512414772654020713 0ustar rootroot armory-0.92.3/cppForSwig/cryptopp/wake.h0000755000000000000000000000322612414772654016701 0ustar rootroot#ifndef CRYPTOPP_WAKE_H #define CRYPTOPP_WAKE_H #include "seckey.h" #include "secblock.h" #include "strciphr.h" NAMESPACE_BEGIN(CryptoPP) //! _ template struct WAKE_OFB_Info : public FixedKeyLength<32> { static const char *StaticAlgorithmName() {return B::ToEnum() == LITTLE_ENDIAN_ORDER ? "WAKE-OFB-LE" : "WAKE-OFB-BE";} }; class CRYPTOPP_NO_VTABLE WAKE_Base { protected: word32 M(word32 x, word32 y); void GenKey(word32 k0, word32 k1, word32 k2, word32 k3); word32 t[257]; word32 r3, r4, r5, r6; }; template class CRYPTOPP_NO_VTABLE WAKE_Policy : public AdditiveCipherConcretePolicy, protected WAKE_Base { protected: void CipherSetKey(const NameValuePairs ¶ms, const byte *key, size_t length); // OFB void OperateKeystream(KeystreamOperation operation, byte *output, const byte *input, size_t iterationCount); bool CipherIsRandomAccess() const {return false;} }; //! WAKE-OFB template struct WAKE_OFB : public WAKE_OFB_Info, public SymmetricCipherDocumentation { typedef SymmetricCipherFinal, AdditiveCipherTemplate<> >, WAKE_OFB_Info > Encryption; typedef Encryption Decryption; }; /* template class WAKE_ROFB_Policy : public WAKE_Policy { protected: void Iterate(KeystreamOperation operation, byte *output, const byte *input, unsigned int iterationCount); }; template struct WAKE_ROFB : public WAKE_Info { typedef SymmetricCipherTemplate, WAKE_ROFB_Policy > > Encryption; typedef Encryption Decryption; }; */ NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/crc.cpp0000755000000000000000000001722512414772654017060 0ustar rootroot// crc.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "crc.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) /* Table of CRC-32's of all single byte values (made by makecrc.c) */ const word32 CRC32::m_tab[] = { #ifdef IS_LITTLE_ENDIAN 0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L, 0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L, 0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L, 0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL, 0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L, 0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L, 0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L, 0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL, 0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L, 0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL, 0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L, 0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L, 0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L, 0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL, 0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL, 0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L, 0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL, 0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L, 0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L, 0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L, 0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL, 0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L, 0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L, 0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL, 0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L, 0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L, 0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L, 0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L, 0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L, 0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL, 0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL, 0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L, 0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L, 0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL, 0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL, 0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L, 0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL, 0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L, 0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL, 0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L, 0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL, 0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L, 0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L, 0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL, 0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L, 0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L, 0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L, 0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L, 0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L, 0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L, 0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL, 0x2d02ef8dL #else 0x00000000L, 0x96300777L, 0x2c610eeeL, 0xba510999L, 0x19c46d07L, 0x8ff46a70L, 0x35a563e9L, 0xa395649eL, 0x3288db0eL, 0xa4b8dc79L, 0x1ee9d5e0L, 0x88d9d297L, 0x2b4cb609L, 0xbd7cb17eL, 0x072db8e7L, 0x911dbf90L, 0x6410b71dL, 0xf220b06aL, 0x4871b9f3L, 0xde41be84L, 0x7dd4da1aL, 0xebe4dd6dL, 0x51b5d4f4L, 0xc785d383L, 0x56986c13L, 0xc0a86b64L, 0x7af962fdL, 0xecc9658aL, 0x4f5c0114L, 0xd96c0663L, 0x633d0ffaL, 0xf50d088dL, 0xc8206e3bL, 0x5e10694cL, 0xe44160d5L, 0x727167a2L, 0xd1e4033cL, 0x47d4044bL, 0xfd850dd2L, 0x6bb50aa5L, 0xfaa8b535L, 0x6c98b242L, 0xd6c9bbdbL, 0x40f9bcacL, 0xe36cd832L, 0x755cdf45L, 0xcf0dd6dcL, 0x593dd1abL, 0xac30d926L, 0x3a00de51L, 0x8051d7c8L, 0x1661d0bfL, 0xb5f4b421L, 0x23c4b356L, 0x9995bacfL, 0x0fa5bdb8L, 0x9eb80228L, 0x0888055fL, 0xb2d90cc6L, 0x24e90bb1L, 0x877c6f2fL, 0x114c6858L, 0xab1d61c1L, 0x3d2d66b6L, 0x9041dc76L, 0x0671db01L, 0xbc20d298L, 0x2a10d5efL, 0x8985b171L, 0x1fb5b606L, 0xa5e4bf9fL, 0x33d4b8e8L, 0xa2c90778L, 0x34f9000fL, 0x8ea80996L, 0x18980ee1L, 0xbb0d6a7fL, 0x2d3d6d08L, 0x976c6491L, 0x015c63e6L, 0xf4516b6bL, 0x62616c1cL, 0xd8306585L, 0x4e0062f2L, 0xed95066cL, 0x7ba5011bL, 0xc1f40882L, 0x57c40ff5L, 0xc6d9b065L, 0x50e9b712L, 0xeab8be8bL, 0x7c88b9fcL, 0xdf1ddd62L, 0x492dda15L, 0xf37cd38cL, 0x654cd4fbL, 0x5861b24dL, 0xce51b53aL, 0x7400bca3L, 0xe230bbd4L, 0x41a5df4aL, 0xd795d83dL, 0x6dc4d1a4L, 0xfbf4d6d3L, 0x6ae96943L, 0xfcd96e34L, 0x468867adL, 0xd0b860daL, 0x732d0444L, 0xe51d0333L, 0x5f4c0aaaL, 0xc97c0dddL, 0x3c710550L, 0xaa410227L, 0x10100bbeL, 0x86200cc9L, 0x25b56857L, 0xb3856f20L, 0x09d466b9L, 0x9fe461ceL, 0x0ef9de5eL, 0x98c9d929L, 0x2298d0b0L, 0xb4a8d7c7L, 0x173db359L, 0x810db42eL, 0x3b5cbdb7L, 0xad6cbac0L, 0x2083b8edL, 0xb6b3bf9aL, 0x0ce2b603L, 0x9ad2b174L, 0x3947d5eaL, 0xaf77d29dL, 0x1526db04L, 0x8316dc73L, 0x120b63e3L, 0x843b6494L, 0x3e6a6d0dL, 0xa85a6a7aL, 0x0bcf0ee4L, 0x9dff0993L, 0x27ae000aL, 0xb19e077dL, 0x44930ff0L, 0xd2a30887L, 0x68f2011eL, 0xfec20669L, 0x5d5762f7L, 0xcb676580L, 0x71366c19L, 0xe7066b6eL, 0x761bd4feL, 0xe02bd389L, 0x5a7ada10L, 0xcc4add67L, 0x6fdfb9f9L, 0xf9efbe8eL, 0x43beb717L, 0xd58eb060L, 0xe8a3d6d6L, 0x7e93d1a1L, 0xc4c2d838L, 0x52f2df4fL, 0xf167bbd1L, 0x6757bca6L, 0xdd06b53fL, 0x4b36b248L, 0xda2b0dd8L, 0x4c1b0aafL, 0xf64a0336L, 0x607a0441L, 0xc3ef60dfL, 0x55df67a8L, 0xef8e6e31L, 0x79be6946L, 0x8cb361cbL, 0x1a8366bcL, 0xa0d26f25L, 0x36e26852L, 0x95770cccL, 0x03470bbbL, 0xb9160222L, 0x2f260555L, 0xbe3bbac5L, 0x280bbdb2L, 0x925ab42bL, 0x046ab35cL, 0xa7ffd7c2L, 0x31cfd0b5L, 0x8b9ed92cL, 0x1daede5bL, 0xb0c2649bL, 0x26f263ecL, 0x9ca36a75L, 0x0a936d02L, 0xa906099cL, 0x3f360eebL, 0x85670772L, 0x13570005L, 0x824abf95L, 0x147ab8e2L, 0xae2bb17bL, 0x381bb60cL, 0x9b8ed292L, 0x0dbed5e5L, 0xb7efdc7cL, 0x21dfdb0bL, 0xd4d2d386L, 0x42e2d4f1L, 0xf8b3dd68L, 0x6e83da1fL, 0xcd16be81L, 0x5b26b9f6L, 0xe177b06fL, 0x7747b718L, 0xe65a0888L, 0x706a0fffL, 0xca3b0666L, 0x5c0b0111L, 0xff9e658fL, 0x69ae62f8L, 0xd3ff6b61L, 0x45cf6c16L, 0x78e20aa0L, 0xeed20dd7L, 0x5483044eL, 0xc2b30339L, 0x612667a7L, 0xf71660d0L, 0x4d476949L, 0xdb776e3eL, 0x4a6ad1aeL, 0xdc5ad6d9L, 0x660bdf40L, 0xf03bd837L, 0x53aebca9L, 0xc59ebbdeL, 0x7fcfb247L, 0xe9ffb530L, 0x1cf2bdbdL, 0x8ac2bacaL, 0x3093b353L, 0xa6a3b424L, 0x0536d0baL, 0x9306d7cdL, 0x2957de54L, 0xbf67d923L, 0x2e7a66b3L, 0xb84a61c4L, 0x021b685dL, 0x942b6f2aL, 0x37be0bb4L, 0xa18e0cc3L, 0x1bdf055aL, 0x8def022dL #endif }; CRC32::CRC32() { Reset(); } void CRC32::Update(const byte *s, size_t n) { word32 crc = m_crc; for(; !IsAligned(s) && n > 0; n--) crc = m_tab[CRC32_INDEX(crc) ^ *s++] ^ CRC32_SHIFTED(crc); while (n >= 4) { crc ^= *(const word32 *)s; crc = m_tab[CRC32_INDEX(crc)] ^ CRC32_SHIFTED(crc); crc = m_tab[CRC32_INDEX(crc)] ^ CRC32_SHIFTED(crc); crc = m_tab[CRC32_INDEX(crc)] ^ CRC32_SHIFTED(crc); crc = m_tab[CRC32_INDEX(crc)] ^ CRC32_SHIFTED(crc); n -= 4; s += 4; } while (n--) crc = m_tab[CRC32_INDEX(crc) ^ *s++] ^ CRC32_SHIFTED(crc); m_crc = crc; } void CRC32::TruncatedFinal(byte *hash, size_t size) { ThrowIfInvalidTruncatedSize(size); m_crc ^= CRC32_NEGL; for (size_t i=0; i to AutoSeededX917RNG - fixed PANAMA cipher interface to accept 256-bit key and 256-bit IV - moved MD2, MD4, MD5, PanamaHash, ARC4, WAKE_CFB into the namespace "Weak" - removed HAVAL, MD5-MAC, XMAC 5.5.1 - fixed VMAC validation failure on 32-bit big-endian machines 5.5.2 - ported x64 assembly language code for AES, Salsa20, Sosemanuk, and Panama to MSVC 2005 (using MASM since MSVC doesn't support inline assembly on x64) - fixed Salsa20 initialization crash on non-SSE2 machines - fixed Whirlpool crash on Pentium 2 machines - fixed possible branch prediction analysis (BPA) vulnerability in MontgomeryReduce(), which may affect security of RSA, RW, LUC - fixed link error with MSVC 2003 when using "debug DLL" form of runtime library - fixed crash in SSE2_Add on P4 machines when compiled with MSVC 6.0 SP5 with Processor Pack - ported to MSVC 2008, GCC 4.2, Sun CC 5.9, Intel C++ Compiler 10.0, and Borland C++Builder 2007 5.6.0 - added AuthenticatedSymmetricCipher interface class and Filter wrappers - added CCM, GCM (with SSE2 assembly), EAX, CMAC, XSalsa20, and SEED - added support for variable length IVs - added OIDs for Brainpool elliptic curve parameters - improved AES and SHA-256 speed on x86 and x64 - changed BlockTransformation interface to no longer assume data alignment - fixed incorrect VMAC computation on message lengths that are >64 mod 128 (x86 assembly version is not affected) - fixed compiler error in vmac.cpp on x86 with GCC -fPIC - fixed run-time validation error on x86-64 with GCC 4.3.2 -O2 - fixed HashFilter bug when putMessage=true - fixed AES-CTR data alignment bug that causes incorrect encryption on ARM - removed WORD64_AVAILABLE; compiler support for 64-bit int is now required - ported to GCC 4.3, C++Builder 2009, Sun CC 5.10, Intel C++ Compiler 11 5.6.1 - added support for AES-NI and CLMUL instruction sets in AES and GMAC/GCM - removed WAKE-CFB - fixed several bugs in the SHA-256 x86/x64 assembly code: * incorrect hash on non-SSE2 x86 machines on non-aligned input * incorrect hash on x86 machines when input crosses 0x80000000 * incorrect hash on x64 when compiled with GCC with optimizations enabled - fixed bugs in AES x86 and x64 assembly causing crashes in some MSVC build configurations - switched to a public domain implementation of MARS - ported to MSVC 2010, GCC 4.5.1, Sun Studio 12u1, C++Builder 2010, Intel C++ Compiler 11.1 - renamed the MSVC DLL project to "cryptopp" for compatibility with MSVC 2010 Written by Wei Dai armory-0.92.3/cppForSwig/cryptopp/dh2.cpp0000755000000000000000000000120012414772654016750 0ustar rootroot// dh2.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "dh2.h" NAMESPACE_BEGIN(CryptoPP) void DH2_TestInstantiations() { DH2 dh(*(SimpleKeyAgreementDomain*)NULL); } bool DH2::Agree(byte *agreedValue, const byte *staticSecretKey, const byte *ephemeralSecretKey, const byte *staticOtherPublicKey, const byte *ephemeralOtherPublicKey, bool validateStaticOtherPublicKey) const { return d1.Agree(agreedValue, staticSecretKey, staticOtherPublicKey, validateStaticOtherPublicKey) && d2.Agree(agreedValue+d1.AgreedValueLength(), ephemeralSecretKey, ephemeralOtherPublicKey, true); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/License.txt0000755000000000000000000000535012414772654017724 0ustar rootrootCompilation Copyright (c) 1995-2010 by Wei Dai. All rights reserved. This copyright applies only to this software distribution package as a compilation, and does not imply a copyright on any particular file in the package. All individual files in this compilation are placed in the public domain by Wei Dai and other contributors. I would like to thank the following authors for placing their works into the public domain: Joan Daemen - 3way.cpp Leonard Janke - cast.cpp, seal.cpp Steve Reid - cast.cpp Phil Karn - des.cpp Andrew M. Kuchling - md2.cpp, md4.cpp Colin Plumb - md5.cpp Seal Woods - rc6.cpp Chris Morgan - rijndael.cpp Paulo Baretto - rijndael.cpp, skipjack.cpp, square.cpp Richard De Moliner - safer.cpp Matthew Skala - twofish.cpp Kevin Springle - camellia.cpp, shacal2.cpp, ttmac.cpp, whrlpool.cpp, ripemd.cpp Permission to use, copy, modify, and distribute this compilation for any purpose, including commercial applications, is hereby granted without fee, subject to the following restrictions: 1. Any copy or modification of this compilation in any form, except in object code form as part of an application software, must include the above copyright notice and this license. 2. Users of this software agree that any modification or extension they provide to Wei Dai will be considered public domain and not copyrighted unless it includes an explicit copyright notice. 3. Wei Dai makes no warranty or representation that the operation of the software in this compilation will be error-free, and Wei Dai is under no obligation to provide any services, by way of maintenance, update, or otherwise. THE SOFTWARE AND ANY DOCUMENTATION ARE PROVIDED "AS IS" WITHOUT EXPRESS OR IMPLIED WARRANTY INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT WILL WEI DAI OR ANY OTHER CONTRIBUTOR BE LIABLE FOR DIRECT, INCIDENTAL OR CONSEQUENTIAL DAMAGES, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 4. Users will not use Wei Dai or any other contributor's name in any publicity or advertising, without prior written consent in each case. 5. Export of this software from the United States may require a specific license from the United States Government. It is the responsibility of any person or organization contemplating export to obtain such a license before exporting. 6. Certain parts of this software may be protected by patents. It is the users' responsibility to obtain the appropriate licenses before using those parts. If this compilation is used in object code form in an application software, acknowledgement of the author is not required but would be appreciated. The contribution of any useful modifications or extensions to Wei Dai is not required but would also be appreciated. armory-0.92.3/cppForSwig/cryptopp/socketft.h0000755000000000000000000001363712414772654017603 0ustar rootroot#ifndef CRYPTOPP_SOCKETFT_H #define CRYPTOPP_SOCKETFT_H #include "config.h" #ifdef SOCKETS_AVAILABLE #include "network.h" #include "queue.h" #ifdef USE_WINDOWS_STYLE_SOCKETS # if defined(_WINSOCKAPI_) && !defined(_WINSOCK2API_) # error Winsock 1 is not supported by this library. Please include this file or winsock2.h before windows.h. # endif #include #include "winpipes.h" #else #include #include #include #include #endif NAMESPACE_BEGIN(CryptoPP) #ifdef USE_WINDOWS_STYLE_SOCKETS typedef ::SOCKET socket_t; #else typedef int socket_t; const socket_t INVALID_SOCKET = -1; // cygwin 1.1.4 doesn't have SHUT_RD const int SD_RECEIVE = 0; const int SD_SEND = 1; const int SD_BOTH = 2; const int SOCKET_ERROR = -1; #endif #ifndef socklen_t typedef TYPE_OF_SOCKLEN_T socklen_t; // see config.h #endif //! wrapper for Windows or Berkeley Sockets class Socket { public: //! exception thrown by Socket class class Err : public OS_Error { public: Err(socket_t s, const std::string& operation, int error); socket_t GetSocket() const {return m_s;} private: socket_t m_s; }; Socket(socket_t s = INVALID_SOCKET, bool own=false) : m_s(s), m_own(own) {} Socket(const Socket &s) : m_s(s.m_s), m_own(false) {} virtual ~Socket(); bool GetOwnership() const {return m_own;} void SetOwnership(bool own) {m_own = own;} operator socket_t() {return m_s;} socket_t GetSocket() const {return m_s;} void AttachSocket(socket_t s, bool own=false); socket_t DetachSocket(); void CloseSocket(); void Create(int nType = SOCK_STREAM); void Bind(unsigned int port, const char *addr=NULL); void Bind(const sockaddr* psa, socklen_t saLen); void Listen(int backlog=5); // the next three functions return false if the socket is in nonblocking mode // and the operation cannot be completed immediately bool Connect(const char *addr, unsigned int port); bool Connect(const sockaddr* psa, socklen_t saLen); bool Accept(Socket& s, sockaddr *psa=NULL, socklen_t *psaLen=NULL); void GetSockName(sockaddr *psa, socklen_t *psaLen); void GetPeerName(sockaddr *psa, socklen_t *psaLen); unsigned int Send(const byte* buf, size_t bufLen, int flags=0); unsigned int Receive(byte* buf, size_t bufLen, int flags=0); void ShutDown(int how = SD_SEND); void IOCtl(long cmd, unsigned long *argp); bool SendReady(const timeval *timeout); bool ReceiveReady(const timeval *timeout); virtual void HandleError(const char *operation) const; void CheckAndHandleError_int(const char *operation, int result) const {if (result == SOCKET_ERROR) HandleError(operation);} void CheckAndHandleError(const char *operation, socket_t result) const {if (result == SOCKET_ERROR) HandleError(operation);} #ifdef USE_WINDOWS_STYLE_SOCKETS void CheckAndHandleError(const char *operation, BOOL result) const {assert(result==TRUE || result==FALSE); if (!result) HandleError(operation);} void CheckAndHandleError(const char *operation, bool result) const {if (!result) HandleError(operation);} #endif //! look up the port number given its name, returns 0 if not found static unsigned int PortNameToNumber(const char *name, const char *protocol="tcp"); //! start Windows Sockets 2 static void StartSockets(); //! calls WSACleanup for Windows Sockets static void ShutdownSockets(); //! returns errno or WSAGetLastError static int GetLastError(); //! sets errno or calls WSASetLastError static void SetLastError(int errorCode); protected: virtual void SocketChanged() {} socket_t m_s; bool m_own; }; class SocketsInitializer { public: SocketsInitializer() {Socket::StartSockets();} ~SocketsInitializer() {try {Socket::ShutdownSockets();} catch (...) {}} }; class SocketReceiver : public NetworkReceiver { public: SocketReceiver(Socket &s); #ifdef USE_BERKELEY_STYLE_SOCKETS bool MustWaitToReceive() {return true;} #else ~SocketReceiver(); bool MustWaitForResult() {return true;} #endif bool Receive(byte* buf, size_t bufLen); unsigned int GetReceiveResult(); bool EofReceived() const {return m_eofReceived;} unsigned int GetMaxWaitObjectCount() const {return 1;} void GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack); private: Socket &m_s; bool m_eofReceived; #ifdef USE_WINDOWS_STYLE_SOCKETS WindowsHandle m_event; OVERLAPPED m_overlapped; bool m_resultPending; DWORD m_lastResult; #else unsigned int m_lastResult; #endif }; class SocketSender : public NetworkSender { public: SocketSender(Socket &s); #ifdef USE_BERKELEY_STYLE_SOCKETS bool MustWaitToSend() {return true;} #else ~SocketSender(); bool MustWaitForResult() {return true;} bool MustWaitForEof() { return true; } bool EofSent(); #endif void Send(const byte* buf, size_t bufLen); unsigned int GetSendResult(); void SendEof(); unsigned int GetMaxWaitObjectCount() const {return 1;} void GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack); private: Socket &m_s; #ifdef USE_WINDOWS_STYLE_SOCKETS WindowsHandle m_event; OVERLAPPED m_overlapped; bool m_resultPending; DWORD m_lastResult; #else unsigned int m_lastResult; #endif }; //! socket-based implementation of NetworkSource class SocketSource : public NetworkSource, public Socket { public: SocketSource(socket_t s = INVALID_SOCKET, bool pumpAll = false, BufferedTransformation *attachment = NULL) : NetworkSource(attachment), Socket(s), m_receiver(*this) { if (pumpAll) PumpAll(); } private: NetworkReceiver & AccessReceiver() {return m_receiver;} SocketReceiver m_receiver; }; //! socket-based implementation of NetworkSink class SocketSink : public NetworkSink, public Socket { public: SocketSink(socket_t s=INVALID_SOCKET, unsigned int maxBufferSize=0, unsigned int autoFlushBound=16*1024) : NetworkSink(maxBufferSize, autoFlushBound), Socket(s), m_sender(*this) {} void SendEof() {ShutDown(SD_SEND);} private: NetworkSender & AccessSender() {return m_sender;} SocketSender m_sender; }; NAMESPACE_END #endif // #ifdef SOCKETS_AVAILABLE #endif armory-0.92.3/cppForSwig/cryptopp/twofish.cpp0000755000000000000000000001006412414772654017766 0ustar rootroot// twofish.cpp - modified by Wei Dai from Matthew Skala's twofish.c // The original code and all modifications are in the public domain. #include "pch.h" #include "twofish.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) // compute (c * x^4) mod (x^4 + (a + 1/a) * x^3 + a * x^2 + (a + 1/a) * x + 1) // over GF(256) static inline unsigned int Mod(unsigned int c) { static const unsigned int modulus = 0x14d; unsigned int c2 = (c<<1) ^ ((c & 0x80) ? modulus : 0); unsigned int c1 = c2 ^ (c>>1) ^ ((c & 1) ? (modulus>>1) : 0); return c | (c1 << 8) | (c2 << 16) | (c1 << 24); } // compute RS(12,8) code with the above polynomial as generator // this is equivalent to multiplying by the RS matrix static word32 ReedSolomon(word32 high, word32 low) { for (unsigned int i=0; i<8; i++) { high = Mod(high>>24) ^ (high<<8) ^ (low>>24); low <<= 8; } return high; } inline word32 Twofish::Base::h0(word32 x, const word32 *key, unsigned int kLen) { x = x | (x<<8) | (x<<16) | (x<<24); switch(kLen) { #define Q(a, b, c, d, t) q[a][GETBYTE(t,0)] ^ (q[b][GETBYTE(t,1)] << 8) ^ (q[c][GETBYTE(t,2)] << 16) ^ (q[d][GETBYTE(t,3)] << 24) case 4: x = Q(1, 0, 0, 1, x) ^ key[6]; case 3: x = Q(1, 1, 0, 0, x) ^ key[4]; case 2: x = Q(0, 1, 0, 1, x) ^ key[2]; x = Q(0, 0, 1, 1, x) ^ key[0]; } return x; } inline word32 Twofish::Base::h(word32 x, const word32 *key, unsigned int kLen) { x = h0(x, key, kLen); return mds[0][GETBYTE(x,0)] ^ mds[1][GETBYTE(x,1)] ^ mds[2][GETBYTE(x,2)] ^ mds[3][GETBYTE(x,3)]; } void Twofish::Base::UncheckedSetKey(const byte *userKey, unsigned int keylength, const NameValuePairs &) { AssertValidKeyLength(keylength); unsigned int len = (keylength <= 16 ? 2 : (keylength <= 24 ? 3 : 4)); SecBlock key(len*2); GetUserKey(LITTLE_ENDIAN_ORDER, key.begin(), len*2, userKey, keylength); unsigned int i; for (i=0; i<40; i+=2) { word32 a = h(i, key, len); word32 b = rotlFixed(h(i+1, key+1, len), 8); m_k[i] = a+b; m_k[i+1] = rotlFixed(a+2*b, 9); } SecBlock svec(2*len); for (i=0; i Block; void Twofish::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 x, y, a, b, c, d; Block::Get(inBlock)(a)(b)(c)(d); a ^= m_k[0]; b ^= m_k[1]; c ^= m_k[2]; d ^= m_k[3]; const word32 *k = m_k+8; ENCCYCLE (0); ENCCYCLE (1); ENCCYCLE (2); ENCCYCLE (3); ENCCYCLE (4); ENCCYCLE (5); ENCCYCLE (6); ENCCYCLE (7); c ^= m_k[4]; d ^= m_k[5]; a ^= m_k[6]; b ^= m_k[7]; Block::Put(xorBlock, outBlock)(c)(d)(a)(b); } void Twofish::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 x, y, a, b, c, d; Block::Get(inBlock)(c)(d)(a)(b); c ^= m_k[4]; d ^= m_k[5]; a ^= m_k[6]; b ^= m_k[7]; const word32 *k = m_k+8; DECCYCLE (7); DECCYCLE (6); DECCYCLE (5); DECCYCLE (4); DECCYCLE (3); DECCYCLE (2); DECCYCLE (1); DECCYCLE (0); a ^= m_k[0]; b ^= m_k[1]; c ^= m_k[2]; d ^= m_k[3]; Block::Put(xorBlock, outBlock)(a)(b)(c)(d); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/luc.h0000755000000000000000000002011712414772654016533 0ustar rootroot#ifndef CRYPTOPP_LUC_H #define CRYPTOPP_LUC_H /** \file */ #include "pkcspad.h" #include "oaep.h" #include "integer.h" #include "dh.h" #include NAMESPACE_BEGIN(CryptoPP) //! The LUC function. /*! This class is here for historical and pedagogical interest. It has no practical advantages over other trapdoor functions and probably shouldn't be used in production software. The discrete log based LUC schemes defined later in this .h file may be of more practical interest. */ class LUCFunction : public TrapdoorFunction, public PublicKey { typedef LUCFunction ThisClass; public: void Initialize(const Integer &n, const Integer &e) {m_n = n; m_e = e;} void BERDecode(BufferedTransformation &bt); void DEREncode(BufferedTransformation &bt) const; Integer ApplyFunction(const Integer &x) const; Integer PreimageBound() const {return m_n;} Integer ImageBound() const {return m_n;} bool Validate(RandomNumberGenerator &rng, unsigned int level) const; bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; void AssignFrom(const NameValuePairs &source); // non-derived interface const Integer & GetModulus() const {return m_n;} const Integer & GetPublicExponent() const {return m_e;} void SetModulus(const Integer &n) {m_n = n;} void SetPublicExponent(const Integer &e) {m_e = e;} protected: Integer m_n, m_e; }; //! _ class InvertibleLUCFunction : public LUCFunction, public TrapdoorFunctionInverse, public PrivateKey { typedef InvertibleLUCFunction ThisClass; public: void Initialize(RandomNumberGenerator &rng, unsigned int modulusBits, const Integer &eStart=17); void Initialize(const Integer &n, const Integer &e, const Integer &p, const Integer &q, const Integer &u) {m_n = n; m_e = e; m_p = p; m_q = q; m_u = u;} void BERDecode(BufferedTransformation &bt); void DEREncode(BufferedTransformation &bt) const; Integer CalculateInverse(RandomNumberGenerator &rng, const Integer &x) const; bool Validate(RandomNumberGenerator &rng, unsigned int level) const; bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; void AssignFrom(const NameValuePairs &source); /*! parameters: (ModulusSize, PublicExponent (default 17)) */ void GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg); // non-derived interface const Integer& GetPrime1() const {return m_p;} const Integer& GetPrime2() const {return m_q;} const Integer& GetMultiplicativeInverseOfPrime2ModPrime1() const {return m_u;} void SetPrime1(const Integer &p) {m_p = p;} void SetPrime2(const Integer &q) {m_q = q;} void SetMultiplicativeInverseOfPrime2ModPrime1(const Integer &u) {m_u = u;} protected: Integer m_p, m_q, m_u; }; struct LUC { static std::string StaticAlgorithmName() {return "LUC";} typedef LUCFunction PublicKey; typedef InvertibleLUCFunction PrivateKey; }; //! LUC cryptosystem template struct LUCES : public TF_ES { }; //! LUC signature scheme with appendix template struct LUCSS : public TF_SS { }; // analagous to the RSA schemes defined in PKCS #1 v2.0 typedef LUCES >::Decryptor LUCES_OAEP_SHA_Decryptor; typedef LUCES >::Encryptor LUCES_OAEP_SHA_Encryptor; typedef LUCSS::Signer LUCSSA_PKCS1v15_SHA_Signer; typedef LUCSS::Verifier LUCSSA_PKCS1v15_SHA_Verifier; // ******************************************************** // no actual precomputation class DL_GroupPrecomputation_LUC : public DL_GroupPrecomputation { public: const AbstractGroup & GetGroup() const {assert(false); throw 0;} Element BERDecodeElement(BufferedTransformation &bt) const {return Integer(bt);} void DEREncodeElement(BufferedTransformation &bt, const Element &v) const {v.DEREncode(bt);} // non-inherited void SetModulus(const Integer &v) {m_p = v;} const Integer & GetModulus() const {return m_p;} private: Integer m_p; }; //! _ class DL_BasePrecomputation_LUC : public DL_FixedBasePrecomputation { public: // DL_FixedBasePrecomputation bool IsInitialized() const {return m_g.NotZero();} void SetBase(const DL_GroupPrecomputation &group, const Integer &base) {m_g = base;} const Integer & GetBase(const DL_GroupPrecomputation &group) const {return m_g;} void Precompute(const DL_GroupPrecomputation &group, unsigned int maxExpBits, unsigned int storage) {} void Load(const DL_GroupPrecomputation &group, BufferedTransformation &storedPrecomputation) {} void Save(const DL_GroupPrecomputation &group, BufferedTransformation &storedPrecomputation) const {} Integer Exponentiate(const DL_GroupPrecomputation &group, const Integer &exponent) const; Integer CascadeExponentiate(const DL_GroupPrecomputation &group, const Integer &exponent, const DL_FixedBasePrecomputation &pc2, const Integer &exponent2) const {throw NotImplemented("DL_BasePrecomputation_LUC: CascadeExponentiate not implemented");} // shouldn't be called private: Integer m_g; }; //! _ class DL_GroupParameters_LUC : public DL_GroupParameters_IntegerBasedImpl { public: // DL_GroupParameters bool IsIdentity(const Integer &element) const {return element == Integer::Two();} void SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const; Element MultiplyElements(const Element &a, const Element &b) const {throw NotImplemented("LUC_GroupParameters: MultiplyElements can not be implemented");} Element CascadeExponentiate(const Element &element1, const Integer &exponent1, const Element &element2, const Integer &exponent2) const {throw NotImplemented("LUC_GroupParameters: MultiplyElements can not be implemented");} // NameValuePairs interface bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue).Assignable(); } private: int GetFieldType() const {return 2;} }; //! _ class DL_GroupParameters_LUC_DefaultSafePrime : public DL_GroupParameters_LUC { public: typedef NoCofactorMultiplication DefaultCofactorOption; protected: unsigned int GetDefaultSubgroupOrderSize(unsigned int modulusSize) const {return modulusSize-1;} }; //! _ class DL_Algorithm_LUC_HMP : public DL_ElgamalLikeSignatureAlgorithm { public: static const char * StaticAlgorithmName() {return "LUC-HMP";} void Sign(const DL_GroupParameters ¶ms, const Integer &x, const Integer &k, const Integer &e, Integer &r, Integer &s) const; bool Verify(const DL_GroupParameters ¶ms, const DL_PublicKey &publicKey, const Integer &e, const Integer &r, const Integer &s) const; size_t RLen(const DL_GroupParameters ¶ms) const {return params.GetGroupOrder().ByteCount();} }; //! _ struct DL_SignatureKeys_LUC { typedef DL_GroupParameters_LUC GroupParameters; typedef DL_PublicKey_GFP PublicKey; typedef DL_PrivateKey_GFP PrivateKey; }; //! LUC-HMP, based on "Digital signature schemes based on Lucas functions" by Patrick Horster, Markus Michels, Holger Petersen template struct LUC_HMP : public DL_SS { }; //! _ struct DL_CryptoKeys_LUC { typedef DL_GroupParameters_LUC_DefaultSafePrime GroupParameters; typedef DL_PublicKey_GFP PublicKey; typedef DL_PrivateKey_GFP PrivateKey; }; //! LUC-IES template struct LUC_IES : public DL_ES< DL_CryptoKeys_LUC, DL_KeyAgreementAlgorithm_DH, DL_KeyDerivationAlgorithm_P1363 >, DL_EncryptionAlgorithm_Xor, DHAES_MODE>, LUC_IES<> > { static std::string StaticAlgorithmName() {return "LUC-IES";} // non-standard name }; // ******************************************************** //! LUC-DH typedef DH_Domain LUC_DH; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/cryptopp.vcxproj.user0000755000000000000000000000021512414772654022046 0ustar rootroot armory-0.92.3/cppForSwig/cryptopp/dll.h0000755000000000000000000000313112414772654016520 0ustar rootroot#ifndef CRYPTOPP_DLL_H #define CRYPTOPP_DLL_H #if !defined(CRYPTOPP_IMPORTS) && !defined(CRYPTOPP_EXPORTS) && !defined(CRYPTOPP_DEFAULT_NO_DLL) #ifdef CRYPTOPP_CONFIG_H #error To use the DLL version of Crypto++, this file must be included before any other Crypto++ header files. #endif #define CRYPTOPP_IMPORTS #endif #include "aes.h" #include "cbcmac.h" #include "ccm.h" #include "cmac.h" #include "channels.h" #include "des.h" #include "dh.h" #include "dsa.h" #include "ec2n.h" #include "eccrypto.h" #include "ecp.h" #include "files.h" #include "fips140.h" #include "gcm.h" #include "hex.h" #include "hmac.h" #include "modes.h" #include "mqueue.h" #include "nbtheory.h" #include "osrng.h" #include "pkcspad.h" #include "pssr.h" #include "randpool.h" #include "rsa.h" #include "rw.h" #include "sha.h" #include "skipjack.h" #include "trdlocal.h" #ifdef CRYPTOPP_IMPORTS #ifdef _DLL // cause CRT DLL to be initialized before Crypto++ so that we can use malloc and free during DllMain() #ifdef NDEBUG #pragma comment(lib, "msvcrt") #else #pragma comment(lib, "msvcrtd") #endif #endif #pragma comment(lib, "cryptopp") #endif // #ifdef CRYPTOPP_IMPORTS #include // for new_handler NAMESPACE_BEGIN(CryptoPP) #if !(defined(_MSC_VER) && (_MSC_VER < 1300)) using std::new_handler; #endif typedef void * (CRYPTOPP_API * PNew)(size_t); typedef void (CRYPTOPP_API * PDelete)(void *); typedef void (CRYPTOPP_API * PGetNewAndDelete)(PNew &, PDelete &); typedef new_handler (CRYPTOPP_API * PSetNewHandler)(new_handler); typedef void (CRYPTOPP_API * PSetNewAndDelete)(PNew, PDelete, PSetNewHandler); NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/tiger.h0000755000000000000000000000107412414772654017063 0ustar rootroot#ifndef CRYPTOPP_TIGER_H #define CRYPTOPP_TIGER_H #include "config.h" #include "iterhash.h" NAMESPACE_BEGIN(CryptoPP) /// Tiger class Tiger : public IteratedHashWithStaticTransform { public: static void InitState(HashWordType *state); static void Transform(word64 *digest, const word64 *data); void TruncatedFinal(byte *hash, size_t size); static const char * StaticAlgorithmName() {return "Tiger";} protected: static const word64 table[4*256+3]; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/fipstest.cpp0000755000000000000000000005514612414772654020156 0ustar rootroot// fipstest.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #define CRYPTOPP_DEFAULT_NO_DLL #include "dll.h" #ifdef CRYPTOPP_WIN32_AVAILABLE #define _WIN32_WINNT 0x0400 #include #if defined(_MSC_VER) && _MSC_VER >= 1400 #ifdef _M_IX86 #define _CRT_DEBUGGER_HOOK _crt_debugger_hook #else #define _CRT_DEBUGGER_HOOK __crt_debugger_hook #endif extern "C" {_CRTIMP void __cdecl _CRT_DEBUGGER_HOOK(int);} #endif #endif #include NAMESPACE_BEGIN(CryptoPP) extern PowerUpSelfTestStatus g_powerUpSelfTestStatus; SecByteBlock g_actualMac; unsigned long g_macFileLocation = 0; // use a random dummy string here, to be searched/replaced later with the real MAC static const byte s_moduleMac[CryptoPP::HMAC::DIGESTSIZE] = CRYPTOPP_DUMMY_DLL_MAC; CRYPTOPP_COMPILE_ASSERT(sizeof(s_moduleMac) == CryptoPP::SHA1::DIGESTSIZE); #ifdef CRYPTOPP_WIN32_AVAILABLE static HMODULE s_hModule = NULL; #endif const byte * CRYPTOPP_API GetActualMacAndLocation(unsigned int &macSize, unsigned int &fileLocation) { macSize = (unsigned int)g_actualMac.size(); fileLocation = g_macFileLocation; return g_actualMac; } void KnownAnswerTest(RandomNumberGenerator &rng, const char *output) { EqualityComparisonFilter comparison; RandomNumberStore(rng, strlen(output)/2).TransferAllTo(comparison, "0"); StringSource(output, true, new HexDecoder(new ChannelSwitch(comparison, "1"))); comparison.ChannelMessageSeriesEnd("0"); comparison.ChannelMessageSeriesEnd("1"); } template void X917RNG_KnownAnswerTest( const char *key, const char *seed, const char *deterministicTimeVector, const char *output, CIPHER *dummy = NULL) { #ifdef OS_RNG_AVAILABLE std::string decodedKey, decodedSeed, decodedDeterministicTimeVector; StringSource(key, true, new HexDecoder(new StringSink(decodedKey))); StringSource(seed, true, new HexDecoder(new StringSink(decodedSeed))); StringSource(deterministicTimeVector, true, new HexDecoder(new StringSink(decodedDeterministicTimeVector))); AutoSeededX917RNG rng(false, false); rng.Reseed((const byte *)decodedKey.data(), decodedKey.size(), (const byte *)decodedSeed.data(), (const byte *)decodedDeterministicTimeVector.data()); KnownAnswerTest(rng, output); #else throw 0; #endif } void KnownAnswerTest(StreamTransformation &encryption, StreamTransformation &decryption, const char *plaintext, const char *ciphertext) { EqualityComparisonFilter comparison; StringSource(plaintext, true, new HexDecoder(new StreamTransformationFilter(encryption, new ChannelSwitch(comparison, "0"), StreamTransformationFilter::NO_PADDING))); StringSource(ciphertext, true, new HexDecoder(new ChannelSwitch(comparison, "1"))); StringSource(ciphertext, true, new HexDecoder(new StreamTransformationFilter(decryption, new ChannelSwitch(comparison, "0"), StreamTransformationFilter::NO_PADDING))); StringSource(plaintext, true, new HexDecoder(new ChannelSwitch(comparison, "1"))); comparison.ChannelMessageSeriesEnd("0"); comparison.ChannelMessageSeriesEnd("1"); } template void SymmetricEncryptionKnownAnswerTest( const char *key, const char *hexIV, const char *plaintext, const char *ecb, const char *cbc, const char *cfb, const char *ofb, const char *ctr, CIPHER *dummy = NULL) { std::string decodedKey; StringSource(key, true, new HexDecoder(new StringSink(decodedKey))); typename CIPHER::Encryption encryption((const byte *)decodedKey.data(), decodedKey.size()); typename CIPHER::Decryption decryption((const byte *)decodedKey.data(), decodedKey.size()); SecByteBlock iv(encryption.BlockSize()); StringSource(hexIV, true, new HexDecoder(new ArraySink(iv, iv.size()))); if (ecb) KnownAnswerTest(ECB_Mode_ExternalCipher::Encryption(encryption).Ref(), ECB_Mode_ExternalCipher::Decryption(decryption).Ref(), plaintext, ecb); if (cbc) KnownAnswerTest(CBC_Mode_ExternalCipher::Encryption(encryption, iv).Ref(), CBC_Mode_ExternalCipher::Decryption(decryption, iv).Ref(), plaintext, cbc); if (cfb) KnownAnswerTest(CFB_Mode_ExternalCipher::Encryption(encryption, iv).Ref(), CFB_Mode_ExternalCipher::Decryption(encryption, iv).Ref(), plaintext, cfb); if (ofb) KnownAnswerTest(OFB_Mode_ExternalCipher::Encryption(encryption, iv).Ref(), OFB_Mode_ExternalCipher::Decryption(encryption, iv).Ref(), plaintext, ofb); if (ctr) KnownAnswerTest(CTR_Mode_ExternalCipher::Encryption(encryption, iv).Ref(), CTR_Mode_ExternalCipher::Decryption(encryption, iv).Ref(), plaintext, ctr); } void KnownAnswerTest(HashTransformation &hash, const char *message, const char *digest) { EqualityComparisonFilter comparison; StringSource(digest, true, new HexDecoder(new ChannelSwitch(comparison, "1"))); StringSource(message, true, new HashFilter(hash, new ChannelSwitch(comparison, "0"))); comparison.ChannelMessageSeriesEnd("0"); comparison.ChannelMessageSeriesEnd("1"); } template void SecureHashKnownAnswerTest(const char *message, const char *digest, HASH *dummy = NULL) { HASH hash; KnownAnswerTest(hash, message, digest); } template void MAC_KnownAnswerTest(const char *key, const char *message, const char *digest, MAC *dummy = NULL) { std::string decodedKey; StringSource(key, true, new HexDecoder(new StringSink(decodedKey))); MAC mac((const byte *)decodedKey.data(), decodedKey.size()); KnownAnswerTest(mac, message, digest); } template void SignatureKnownAnswerTest(const char *key, const char *message, const char *signature, SCHEME *dummy = NULL) { typename SCHEME::Signer signer(StringSource(key, true, new HexDecoder).Ref()); typename SCHEME::Verifier verifier(signer); RandomPool rng; EqualityComparisonFilter comparison; StringSource(message, true, new SignerFilter(rng, signer, new ChannelSwitch(comparison, "0"))); StringSource(signature, true, new HexDecoder(new ChannelSwitch(comparison, "1"))); comparison.ChannelMessageSeriesEnd("0"); comparison.ChannelMessageSeriesEnd("1"); VerifierFilter verifierFilter(verifier, NULL, VerifierFilter::SIGNATURE_AT_BEGIN | VerifierFilter::THROW_EXCEPTION); StringSource(signature, true, new HexDecoder(new Redirector(verifierFilter, Redirector::DATA_ONLY))); StringSource(message, true, new Redirector(verifierFilter)); } void EncryptionPairwiseConsistencyTest(const PK_Encryptor &encryptor, const PK_Decryptor &decryptor) { try { RandomPool rng; const char *testMessage ="test message"; std::string ciphertext, decrypted; StringSource( testMessage, true, new PK_EncryptorFilter( rng, encryptor, new StringSink(ciphertext))); if (ciphertext == testMessage) throw 0; StringSource( ciphertext, true, new PK_DecryptorFilter( rng, decryptor, new StringSink(decrypted))); if (decrypted != testMessage) throw 0; } catch (...) { throw SelfTestFailure(encryptor.AlgorithmName() + ": pairwise consistency test failed"); } } void SignaturePairwiseConsistencyTest(const PK_Signer &signer, const PK_Verifier &verifier) { try { RandomPool rng; StringSource( "test message", true, new SignerFilter( rng, signer, new VerifierFilter(verifier, NULL, VerifierFilter::THROW_EXCEPTION), true)); } catch (...) { throw SelfTestFailure(signer.AlgorithmName() + ": pairwise consistency test failed"); } } template void SignaturePairwiseConsistencyTest(const char *key, SCHEME *dummy = NULL) { typename SCHEME::Signer signer(StringSource(key, true, new HexDecoder).Ref()); typename SCHEME::Verifier verifier(signer); SignaturePairwiseConsistencyTest(signer, verifier); } MessageAuthenticationCode * NewIntegrityCheckingMAC() { byte key[] = {0x47, 0x1E, 0x33, 0x96, 0x65, 0xB1, 0x6A, 0xED, 0x0B, 0xF8, 0x6B, 0xFD, 0x01, 0x65, 0x05, 0xCC}; return new HMAC(key, sizeof(key)); } bool IntegrityCheckModule(const char *moduleFilename, const byte *expectedModuleMac, SecByteBlock *pActualMac, unsigned long *pMacFileLocation) { std::auto_ptr mac(NewIntegrityCheckingMAC()); unsigned int macSize = mac->DigestSize(); SecByteBlock tempMac; SecByteBlock &actualMac = pActualMac ? *pActualMac : tempMac; actualMac.resize(macSize); unsigned long tempLocation; unsigned long &macFileLocation = pMacFileLocation ? *pMacFileLocation : tempLocation; macFileLocation = 0; MeterFilter verifier(new HashFilter(*mac, new ArraySink(actualMac, actualMac.size()))); // MeterFilter verifier(new FileSink("c:\\dt.tmp")); std::ifstream moduleStream; #ifdef CRYPTOPP_WIN32_AVAILABLE HMODULE h; { char moduleFilenameBuf[MAX_PATH] = ""; if (moduleFilename == NULL) { #if (_MSC_VER >= 1400 && !defined(_STLPORT_VERSION)) // ifstream doesn't support wide filename on other compilers wchar_t wideModuleFilename[MAX_PATH]; if (GetModuleFileNameW(s_hModule, wideModuleFilename, MAX_PATH) > 0) { moduleStream.open(wideModuleFilename, std::ios::in | std::ios::binary); h = GetModuleHandleW(wideModuleFilename); } else #endif { GetModuleFileNameA(s_hModule, moduleFilenameBuf, MAX_PATH); moduleFilename = moduleFilenameBuf; } } #endif if (moduleFilename != NULL) { moduleStream.open(moduleFilename, std::ios::in | std::ios::binary); #ifdef CRYPTOPP_WIN32_AVAILABLE h = GetModuleHandleA(moduleFilename); moduleFilename = NULL; } #endif } if (!moduleStream) { #ifdef CRYPTOPP_WIN32_AVAILABLE //OutputDebugString("Crypto++ DLL integrity check failed. Cannot open file for reading."); #endif return false; } FileStore file(moduleStream); #ifdef CRYPTOPP_WIN32_AVAILABLE // try to hash from memory first const byte *memBase = (const byte *)h; const IMAGE_DOS_HEADER *ph = (IMAGE_DOS_HEADER *)memBase; const IMAGE_NT_HEADERS *phnt = (IMAGE_NT_HEADERS *)(memBase + ph->e_lfanew); const IMAGE_SECTION_HEADER *phs = IMAGE_FIRST_SECTION(phnt); DWORD nSections = phnt->FileHeader.NumberOfSections; size_t currentFilePos = 0; size_t checksumPos = (byte *)&phnt->OptionalHeader.CheckSum - memBase; size_t checksumSize = sizeof(phnt->OptionalHeader.CheckSum); size_t certificateTableDirectoryPos = (byte *)&phnt->OptionalHeader.DataDirectory[IMAGE_DIRECTORY_ENTRY_SECURITY] - memBase; size_t certificateTableDirectorySize = sizeof(phnt->OptionalHeader.DataDirectory[IMAGE_DIRECTORY_ENTRY_SECURITY]); size_t certificateTablePos = phnt->OptionalHeader.DataDirectory[IMAGE_DIRECTORY_ENTRY_SECURITY].VirtualAddress; size_t certificateTableSize = phnt->OptionalHeader.DataDirectory[IMAGE_DIRECTORY_ENTRY_SECURITY].Size; verifier.AddRangeToSkip(0, checksumPos, checksumSize); verifier.AddRangeToSkip(0, certificateTableDirectoryPos, certificateTableDirectorySize); verifier.AddRangeToSkip(0, certificateTablePos, certificateTableSize); while (nSections--) { switch (phs->Characteristics) { default: break; case IMAGE_SCN_CNT_CODE | IMAGE_SCN_MEM_EXECUTE | IMAGE_SCN_MEM_READ: case IMAGE_SCN_CNT_INITIALIZED_DATA | IMAGE_SCN_MEM_READ: unsigned int sectionSize = STDMIN(phs->SizeOfRawData, phs->Misc.VirtualSize); const byte *sectionMemStart = memBase + phs->VirtualAddress; unsigned int sectionFileStart = phs->PointerToRawData; size_t subSectionStart = 0, nextSubSectionStart; do { const byte *subSectionMemStart = sectionMemStart + subSectionStart; size_t subSectionFileStart = sectionFileStart + subSectionStart; size_t subSectionSize = sectionSize - subSectionStart; nextSubSectionStart = 0; unsigned int entriesToReadFromDisk[] = {IMAGE_DIRECTORY_ENTRY_IMPORT, IMAGE_DIRECTORY_ENTRY_IAT}; for (unsigned int i=0; iOptionalHeader.DataDirectory[entriesToReadFromDisk[i]]; const byte *entryMemStart = memBase + entry.VirtualAddress; if (subSectionMemStart <= entryMemStart && entryMemStart < subSectionMemStart + subSectionSize) { subSectionSize = entryMemStart - subSectionMemStart; nextSubSectionStart = entryMemStart - sectionMemStart + entry.Size; } } #if defined(_MSC_VER) && _MSC_VER >= 1400 // first byte of _CRT_DEBUGGER_HOOK gets modified in memory by the debugger invisibly, so read it from file if (IsDebuggerPresent()) { if (subSectionMemStart <= (byte *)&_CRT_DEBUGGER_HOOK && (byte *)&_CRT_DEBUGGER_HOOK < subSectionMemStart + subSectionSize) { subSectionSize = (byte *)&_CRT_DEBUGGER_HOOK - subSectionMemStart; nextSubSectionStart = (byte *)&_CRT_DEBUGGER_HOOK - sectionMemStart + 1; } } #endif if (subSectionMemStart <= expectedModuleMac && expectedModuleMac < subSectionMemStart + subSectionSize) { // found stored MAC macFileLocation = (unsigned long)(subSectionFileStart + (expectedModuleMac - subSectionMemStart)); verifier.AddRangeToSkip(0, macFileLocation, macSize); } file.TransferTo(verifier, subSectionFileStart - currentFilePos); verifier.Put(subSectionMemStart, subSectionSize); file.Skip(subSectionSize); currentFilePos = subSectionFileStart + subSectionSize; subSectionStart = nextSubSectionStart; } while (nextSubSectionStart != 0); } phs++; } #endif file.TransferAllTo(verifier); #ifdef CRYPTOPP_WIN32_AVAILABLE // if that fails (could be caused by debug breakpoints or DLL base relocation modifying image in memory), // hash from disk instead if (!VerifyBufsEqual(expectedModuleMac, actualMac, macSize)) { //OutputDebugString("In memory integrity check failed. This may be caused by debug breakpoints or DLL relocation.\n"); moduleStream.clear(); moduleStream.seekg(0); verifier.Initialize(MakeParameters(Name::OutputBuffer(), ByteArrayParameter(actualMac, (unsigned int)actualMac.size()))); // verifier.Initialize(MakeParameters(Name::OutputFileName(), (const char *)"c:\\dt2.tmp")); verifier.AddRangeToSkip(0, checksumPos, checksumSize); verifier.AddRangeToSkip(0, certificateTableDirectoryPos, certificateTableDirectorySize); verifier.AddRangeToSkip(0, certificateTablePos, certificateTableSize); verifier.AddRangeToSkip(0, macFileLocation, macSize); FileStore(moduleStream).TransferAllTo(verifier); } #endif if (VerifyBufsEqual(expectedModuleMac, actualMac, macSize)) return true; #ifdef CRYPTOPP_WIN32_AVAILABLE std::string hexMac; HexEncoder(new StringSink(hexMac)).PutMessageEnd(actualMac, actualMac.size()); //OutputDebugString((("Crypto++ DLL integrity check failed. Actual MAC is: " + hexMac) + "\n").c_str()); #endif return false; } void DoPowerUpSelfTest(const char *moduleFilename, const byte *expectedModuleMac) { g_powerUpSelfTestStatus = POWER_UP_SELF_TEST_NOT_DONE; SetPowerUpSelfTestInProgressOnThisThread(true); try { if (FIPS_140_2_ComplianceEnabled() || expectedModuleMac != NULL) { if (!IntegrityCheckModule(moduleFilename, expectedModuleMac, &g_actualMac, &g_macFileLocation)) throw 0; // throw here so we break in the debugger, this will be caught right away } // algorithm tests X917RNG_KnownAnswerTest( "2b7e151628aed2a6abf7158809cf4f3c", // key "000102030405060708090a0b0c0d0e0f", // seed "00000000000000000000000000000001", // time vector "D176EDD27493B0395F4D10546232B0693DC7061C03C3A554F09CECF6F6B46D945A"); // output SymmetricEncryptionKnownAnswerTest( "385D7189A5C3D485E1370AA5D408082B5CCCCB5E19F2D90E", "C141B5FCCD28DC8A", "6E1BD7C6120947A464A6AAB293A0F89A563D8D40D3461B68", "64EAAD4ACBB9CEAD6C7615E7C7E4792FE587D91F20C7D2F4", "6235A461AFD312973E3B4F7AA7D23E34E03371F8E8C376C9", "E26BA806A59B0330DE40CA38E77A3E494BE2B212F6DD624B", "E26BA806A59B03307DE2BCC25A08BA40A8BA335F5D604C62", "E26BA806A59B03303C62C2EFF32D3ACDD5D5F35EBCC53371"); SymmetricEncryptionKnownAnswerTest( "1555E5531C3A169B2D65", "6EC9795701F49864", "00AFA48E9621E52E8CBDA312660184EDDB1F33D9DACDA8DA", "DBEC73562EFCAEB56204EB8AE9557EBF77473FBB52D17CD1", "0C7B0B74E21F99B8F2C8DF37879F6C044967F42A796DCA8B", "79FDDA9724E36CC2E023E9A5C717A8A8A7FDA465CADCBF63", "79FDDA9724E36CC26CACBD83C1ABC06EAF5B249BE5B1E040", "79FDDA9724E36CC211B0AEC607B95A96BCDA318440B82F49"); SymmetricEncryptionKnownAnswerTest( "2b7e151628aed2a6abf7158809cf4f3c", "000102030405060708090a0b0c0d0e0f", "6bc1bee22e409f96e93d7e117393172aae2d8a571e03ac9c9eb76fac45af8e5130c81c46a35ce411e5fbc1191a0a52eff69f2445df4f9b17ad2b417be66c3710", // plaintext "3ad77bb40d7a3660a89ecaf32466ef97f5d3d58503b9699de785895a96fdbaaf43b1cd7f598ece23881b00e3ed0306887b0c785e27e8ad3f8223207104725dd4", // ecb "7649abac8119b246cee98e9b12e9197d5086cb9b507219ee95db113a917678b273bed6b8e3c1743b7116e69e222295163ff1caa1681fac09120eca307586e1a7", // cbc "3b3fd92eb72dad20333449f8e83cfb4ac8a64537a0b3a93fcde3cdad9f1ce58b26751f67a3cbb140b1808cf187a4f4dfc04b05357c5d1c0eeac4c66f9ff7f2e6", // cfb "3b3fd92eb72dad20333449f8e83cfb4a7789508d16918f03f53c52dac54ed8259740051e9c5fecf64344f7a82260edcc304c6528f659c77866a510d9c1d6ae5e", // ofb NULL); SymmetricEncryptionKnownAnswerTest( "2b7e151628aed2a6abf7158809cf4f3c", "f0f1f2f3f4f5f6f7f8f9fafbfcfdfeff", "6bc1bee22e409f96e93d7e117393172aae2d8a571e03ac9c9eb76fac45af8e5130c81c46a35ce411e5fbc1191a0a52eff69f2445df4f9b17ad2b417be66c3710", NULL, NULL, NULL, NULL, "874d6191b620e3261bef6864990db6ce9806f66b7970fdff8617187bb9fffdff5ae4df3edbd5d35e5b4f09020db03eab1e031dda2fbe03d1792170a0f3009cee"); // ctr SecureHashKnownAnswerTest( "abc", "A9993E364706816ABA3E25717850C26C9CD0D89D"); SecureHashKnownAnswerTest( "abc", "23097d223405d8228642a477bda255b32aadbce4bda0b3f7e36c9da7"); SecureHashKnownAnswerTest( "abc", "ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad"); SecureHashKnownAnswerTest( "abc", "cb00753f45a35e8bb5a03d699ac65007272c32ab0eded1631a8b605a43ff5bed8086072ba1e7cc2358baeca134c825a7"); SecureHashKnownAnswerTest( "abc", "ddaf35a193617abacc417349ae20413112e6fa4e89a97ea20a9eeee64b55d39a2192992a274fc1a836ba3c23a3feebbd454d4423643ce80e2a9ac94fa54ca49f"); MAC_KnownAnswerTest >( "303132333435363738393a3b3c3d3e3f40414243", "Sample #2", "0922d3405faa3d194f82a45830737d5cc6c75d24"); const char *keyRSA1 = "30820150020100300d06092a864886f70d01010105000482013a3082013602010002400a66791dc6988168de7ab77419bb7fb0" "c001c62710270075142942e19a8d8c51d053b3e3782a1de5dc5af4ebe99468170114a1dfe67cdc9a9af55d655620bbab0203010001" "02400123c5b61ba36edb1d3679904199a89ea80c09b9122e1400c09adcf7784676d01d23356a7d44d6bd8bd50e94bfc723fa" "87d8862b75177691c11d757692df8881022033d48445c859e52340de704bcdda065fbb4058d740bd1d67d29e9c146c11cf61" "0220335e8408866b0fd38dc7002d3f972c67389a65d5d8306566d5c4f2a5aa52628b0220045ec90071525325d3d46db79695e9af" "acc4523964360e02b119baa366316241022015eb327360c7b60d12e5e2d16bdcd97981d17fba6b70db13b20b436e24eada590220" "2ca6366d72781dfa24d34a9a24cbc2ae927a9958af426563ff63fb11658a461d"; const char *keyRSA2 = "30820273020100300D06092A864886F70D01010105000482025D3082025902010002818100D40AF9" "A2B713034249E5780056D70FC7DE75D76E44565AA6A6B8ED9646F3C19F9E254D72D7DE6E49DB2264" "0C1D05AB9E2A5F901D8F3FE1F7AE02CEE2ECCE54A40ABAE55A004692752E70725AEEE7CDEA67628A" "82A9239B4AB660C2BC56D9F01E90CBAAB9BF0FC8E17173CEFC5709A29391A7DDF3E0B758691AAF30" "725B292F4F020111027F18C0BA087D082C45D75D3594E0767E4820818EB35612B80CEAB8C880ACA5" "44B6876DFFEF85A576C0D45B551AFAA1FD63209CD745DF75C5A0F0B580296EA466CD0338207E4752" "FF4E7DB724D8AE18CE5CF4153BB94C27869FBB50E64F02546E4B02997A0B8623E64017CC770759C6" "695DB649EEFD829D688D441BCC4E7348F1024100EF86DD7AF3F32CDE8A9F6564E43A559A0C9F8BAD" "36CC25330548B347AC158A345631FA90F7B873C36EFFAE2F7823227A3F580B5DD18304D5932751E7" "43E9234F024100E2A039854B55688740E32A51DF4AF88613D91A371CF8DDD95D780A89D7CF2119A9" "54F1AC0F3DCDB2F6959926E6D9D37D8BC07A4C634DE6F16315BD5F0DAC340102407ECEEDB9903572" "1B76909F174BA6698DCA72953D957B22C0A871C8531EDE3A1BB52984A719BC010D1CA57A555DB83F" "6DE54CBAB932AEC652F38D497A6F3F30CF024100854F30E4FF232E6DADB2CD99926855F484255AB7" "01FBCDCB27EC426F33A7046972AA700ADBCA008763DF87440F52F4E070531AC385B55AAC1C2AE7DD" "8F9278F1024100C313F4AF9E4A9DE1253C21080CE524251560C111550772FD08690F13FBE658342E" "BD2D41C9DCB12374E871B1839E26CAE252E1AE3DAAD5F1EE1F42B4D0EE7581"; SignatureKnownAnswerTest >( keyRSA1, "Everyone gets Friday off.", "0610761F95FFD1B8F29DA34212947EC2AA0E358866A722F03CC3C41487ADC604A48FF54F5C6BEDB9FB7BD59F82D6E55D8F3174BA361B2214B2D74E8825E04E81"); SignatureKnownAnswerTest >( keyRSA2, "test", "32F6BA41C8930DE71EE67F2627172CC539EDE04267FDE03AC295E3C50311F26C3B275D3AF513AC96" "8EE493BAB7DA3A754661D1A7C4A0D1A2B7EE8B313AACD8CB8BFBC5C15EFB0EF15C86A9334A1E87AD" "291EB961B5CA0E84930429B28780816AA94F96FC2367B71E2D2E4866FA966795B147F00600E5207E" "2F189C883B37477C"); SignaturePairwiseConsistencyTest( "3082014A0201003082012B06072A8648CE3804013082011E02818100F468699A6F6EBCC0120D3B34C8E007F125EC7D81F763B8D0F33869AE3BD6B9F2ECCC7DF34DF84C0307449E9B85D30D57194BCCEB310F48141914DD13A077AAF9B624A6CBE666BBA1D7EBEA95B5BA6F54417FD5D4E4220C601E071D316A24EA814E8B0122DBF47EE8AEEFD319EBB01DD95683F10DBB4FEB023F8262A07EAEB7FD02150082AD4E034DA6EEACDFDAE68C36F2BAD614F9E53B02818071AAF73361A26081529F7D84078ADAFCA48E031DB54AD57FB1A833ADBD8672328AABAA0C756247998D7A5B10DACA359D231332CE8120B483A784FE07D46EEBFF0D7D374A10691F78653E6DC29E27CCB1B174923960DFE5B959B919B2C3816C19251832AFD8E35D810E598F82877ABF7D40A041565168BD7F0E21E3FE2A8D8C1C0416021426EBA66E846E755169F84A1DA981D86502405DDF"); SignaturePairwiseConsistencyTest >( "302D020100301006072A8648CE3D020106052B8104000404163014020101040F0070337065E1E196980A9D00E37211"); SignaturePairwiseConsistencyTest >( "3039020100301306072A8648CE3D020106082A8648CE3D030101041F301D02010104182BB8A13C8B867010BD9471D9E81FDB01ABD0538C64D6249A"); SignaturePairwiseConsistencyTest >(keyRSA1); } catch (...) { g_powerUpSelfTestStatus = POWER_UP_SELF_TEST_FAILED; goto done; } g_powerUpSelfTestStatus = POWER_UP_SELF_TEST_PASSED; done: SetPowerUpSelfTestInProgressOnThisThread(false); return; } #ifdef CRYPTOPP_WIN32_AVAILABLE void DoDllPowerUpSelfTest() { CryptoPP::DoPowerUpSelfTest(NULL, s_moduleMac); } #else void DoDllPowerUpSelfTest() { throw NotImplemented("DoDllPowerUpSelfTest() only available on Windows"); } #endif // #ifdef CRYPTOPP_WIN32_AVAILABLE NAMESPACE_END #ifdef CRYPTOPP_WIN32_AVAILABLE // DllMain needs to be in the global namespace BOOL APIENTRY DllMain(HANDLE hModule, DWORD ul_reason_for_call, LPVOID lpReserved) { if (ul_reason_for_call == DLL_PROCESS_ATTACH) { CryptoPP::s_hModule = (HMODULE)hModule; CryptoPP::DoDllPowerUpSelfTest(); } return TRUE; } #endif // #ifdef CRYPTOPP_WIN32_AVAILABLE #endif // #ifndef CRYPTOPP_IMPORTS armory-0.92.3/cppForSwig/cryptopp/esign.h0000755000000000000000000000733612414772654017065 0ustar rootroot#ifndef CRYPTOPP_ESIGN_H #define CRYPTOPP_ESIGN_H /** \file This file contains classes that implement the ESIGN signature schemes as defined in IEEE P1363a. */ #include "pubkey.h" #include "integer.h" #include "asn.h" NAMESPACE_BEGIN(CryptoPP) //! _ class ESIGNFunction : public TrapdoorFunction, public ASN1CryptoMaterial { typedef ESIGNFunction ThisClass; public: void Initialize(const Integer &n, const Integer &e) {m_n = n; m_e = e;} // PublicKey void BERDecode(BufferedTransformation &bt); void DEREncode(BufferedTransformation &bt) const; // CryptoMaterial bool Validate(RandomNumberGenerator &rng, unsigned int level) const; bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; void AssignFrom(const NameValuePairs &source); // TrapdoorFunction Integer ApplyFunction(const Integer &x) const; Integer PreimageBound() const {return m_n;} Integer ImageBound() const {return Integer::Power2(GetK());} // non-derived const Integer & GetModulus() const {return m_n;} const Integer & GetPublicExponent() const {return m_e;} void SetModulus(const Integer &n) {m_n = n;} void SetPublicExponent(const Integer &e) {m_e = e;} protected: unsigned int GetK() const {return m_n.BitCount()/3-1;} Integer m_n, m_e; }; //! _ class InvertibleESIGNFunction : public ESIGNFunction, public RandomizedTrapdoorFunctionInverse, public PrivateKey { typedef InvertibleESIGNFunction ThisClass; public: void Initialize(const Integer &n, const Integer &e, const Integer &p, const Integer &q) {m_n = n; m_e = e; m_p = p; m_q = q;} // generate a random private key void Initialize(RandomNumberGenerator &rng, unsigned int modulusBits) {GenerateRandomWithKeySize(rng, modulusBits);} void BERDecode(BufferedTransformation &bt); void DEREncode(BufferedTransformation &bt) const; Integer CalculateRandomizedInverse(RandomNumberGenerator &rng, const Integer &x) const; // GeneratibleCryptoMaterial bool Validate(RandomNumberGenerator &rng, unsigned int level) const; bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; void AssignFrom(const NameValuePairs &source); /*! parameters: (ModulusSize) */ void GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg); const Integer& GetPrime1() const {return m_p;} const Integer& GetPrime2() const {return m_q;} void SetPrime1(const Integer &p) {m_p = p;} void SetPrime2(const Integer &q) {m_q = q;} protected: Integer m_p, m_q; }; //! _ template class EMSA5Pad : public PK_DeterministicSignatureMessageEncodingMethod { public: static const char *StaticAlgorithmName() {return "EMSA5";} void ComputeMessageRepresentative(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const { SecByteBlock digest(hash.DigestSize()); hash.Final(digest); size_t representativeByteLength = BitsToBytes(representativeBitLength); T mgf; mgf.GenerateAndMask(hash, representative, representativeByteLength, digest, digest.size(), false); if (representativeBitLength % 8 != 0) representative[0] = (byte)Crop(representative[0], representativeBitLength % 8); } }; //! EMSA5, for use with ESIGN struct P1363_EMSA5 : public SignatureStandard { typedef EMSA5Pad SignatureMessageEncodingMethod; }; struct ESIGN_Keys { static std::string StaticAlgorithmName() {return "ESIGN";} typedef ESIGNFunction PublicKey; typedef InvertibleESIGNFunction PrivateKey; }; //! ESIGN, as defined in IEEE P1363a template struct ESIGN : public TF_SS { }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/default.h0000755000000000000000000000607112414772654017377 0ustar rootroot#ifndef CRYPTOPP_DEFAULT_H #define CRYPTOPP_DEFAULT_H #include "sha.h" #include "hmac.h" #include "des.h" #include "filters.h" #include "modes.h" NAMESPACE_BEGIN(CryptoPP) typedef DES_EDE2 Default_BlockCipher; typedef SHA DefaultHashModule; typedef HMAC DefaultMAC; //! Password-Based Encryptor using DES-EDE2 class DefaultEncryptor : public ProxyFilter { public: DefaultEncryptor(const char *passphrase, BufferedTransformation *attachment = NULL); DefaultEncryptor(const byte *passphrase, size_t passphraseLength, BufferedTransformation *attachment = NULL); protected: void FirstPut(const byte *); void LastPut(const byte *inString, size_t length); private: SecByteBlock m_passphrase; CBC_Mode::Encryption m_cipher; }; //! Password-Based Decryptor using DES-EDE2 class DefaultDecryptor : public ProxyFilter { public: DefaultDecryptor(const char *passphrase, BufferedTransformation *attachment = NULL, bool throwException=true); DefaultDecryptor(const byte *passphrase, size_t passphraseLength, BufferedTransformation *attachment = NULL, bool throwException=true); class Err : public Exception { public: Err(const std::string &s) : Exception(DATA_INTEGRITY_CHECK_FAILED, s) {} }; class KeyBadErr : public Err {public: KeyBadErr() : Err("DefaultDecryptor: cannot decrypt message with this passphrase") {}}; enum State {WAITING_FOR_KEYCHECK, KEY_GOOD, KEY_BAD}; State CurrentState() const {return m_state;} protected: void FirstPut(const byte *inString); void LastPut(const byte *inString, size_t length); State m_state; private: void CheckKey(const byte *salt, const byte *keyCheck); SecByteBlock m_passphrase; CBC_Mode::Decryption m_cipher; member_ptr m_decryptor; bool m_throwException; }; //! Password-Based Encryptor using DES-EDE2 and HMAC/SHA-1 class DefaultEncryptorWithMAC : public ProxyFilter { public: DefaultEncryptorWithMAC(const char *passphrase, BufferedTransformation *attachment = NULL); DefaultEncryptorWithMAC(const byte *passphrase, size_t passphraseLength, BufferedTransformation *attachment = NULL); protected: void FirstPut(const byte *inString) {} void LastPut(const byte *inString, size_t length); private: member_ptr m_mac; }; //! Password-Based Decryptor using DES-EDE2 and HMAC/SHA-1 class DefaultDecryptorWithMAC : public ProxyFilter { public: class MACBadErr : public DefaultDecryptor::Err {public: MACBadErr() : DefaultDecryptor::Err("DefaultDecryptorWithMAC: MAC check failed") {}}; DefaultDecryptorWithMAC(const char *passphrase, BufferedTransformation *attachment = NULL, bool throwException=true); DefaultDecryptorWithMAC(const byte *passphrase, size_t passphraseLength, BufferedTransformation *attachment = NULL, bool throwException=true); DefaultDecryptor::State CurrentState() const; bool CheckLastMAC() const; protected: void FirstPut(const byte *inString) {} void LastPut(const byte *inString, size_t length); private: member_ptr m_mac; HashVerifier *m_hashVerifier; bool m_throwException; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/xtr.h0000755000000000000000000001221512414772654016565 0ustar rootroot#ifndef CRYPTOPP_XTR_H #define CRYPTOPP_XTR_H /** \file "The XTR public key system" by Arjen K. Lenstra and Eric R. Verheul */ #include "modarith.h" NAMESPACE_BEGIN(CryptoPP) //! an element of GF(p^2) class GFP2Element { public: GFP2Element() {} GFP2Element(const Integer &c1, const Integer &c2) : c1(c1), c2(c2) {} GFP2Element(const byte *encodedElement, unsigned int size) : c1(encodedElement, size/2), c2(encodedElement+size/2, size/2) {} void Encode(byte *encodedElement, unsigned int size) { c1.Encode(encodedElement, size/2); c2.Encode(encodedElement+size/2, size/2); } bool operator==(const GFP2Element &rhs) const {return c1 == rhs.c1 && c2 == rhs.c2;} bool operator!=(const GFP2Element &rhs) const {return !operator==(rhs);} void swap(GFP2Element &a) { c1.swap(a.c1); c2.swap(a.c2); } static const GFP2Element & Zero(); Integer c1, c2; }; //! GF(p^2), optimal normal basis template class GFP2_ONB : public AbstractRing { public: typedef F BaseField; GFP2_ONB(const Integer &p) : modp(p) { if (p%3 != 2) throw InvalidArgument("GFP2_ONB: modulus must be equivalent to 2 mod 3"); } const Integer& GetModulus() const {return modp.GetModulus();} GFP2Element ConvertIn(const Integer &a) const { t = modp.Inverse(modp.ConvertIn(a)); return GFP2Element(t, t); } GFP2Element ConvertIn(const GFP2Element &a) const {return GFP2Element(modp.ConvertIn(a.c1), modp.ConvertIn(a.c2));} GFP2Element ConvertOut(const GFP2Element &a) const {return GFP2Element(modp.ConvertOut(a.c1), modp.ConvertOut(a.c2));} bool Equal(const GFP2Element &a, const GFP2Element &b) const { return modp.Equal(a.c1, b.c1) && modp.Equal(a.c2, b.c2); } const Element& Identity() const { return GFP2Element::Zero(); } const Element& Add(const Element &a, const Element &b) const { result.c1 = modp.Add(a.c1, b.c1); result.c2 = modp.Add(a.c2, b.c2); return result; } const Element& Inverse(const Element &a) const { result.c1 = modp.Inverse(a.c1); result.c2 = modp.Inverse(a.c2); return result; } const Element& Double(const Element &a) const { result.c1 = modp.Double(a.c1); result.c2 = modp.Double(a.c2); return result; } const Element& Subtract(const Element &a, const Element &b) const { result.c1 = modp.Subtract(a.c1, b.c1); result.c2 = modp.Subtract(a.c2, b.c2); return result; } Element& Accumulate(Element &a, const Element &b) const { modp.Accumulate(a.c1, b.c1); modp.Accumulate(a.c2, b.c2); return a; } Element& Reduce(Element &a, const Element &b) const { modp.Reduce(a.c1, b.c1); modp.Reduce(a.c2, b.c2); return a; } bool IsUnit(const Element &a) const { return a.c1.NotZero() || a.c2.NotZero(); } const Element& MultiplicativeIdentity() const { result.c1 = result.c2 = modp.Inverse(modp.MultiplicativeIdentity()); return result; } const Element& Multiply(const Element &a, const Element &b) const { t = modp.Add(a.c1, a.c2); t = modp.Multiply(t, modp.Add(b.c1, b.c2)); result.c1 = modp.Multiply(a.c1, b.c1); result.c2 = modp.Multiply(a.c2, b.c2); result.c1.swap(result.c2); modp.Reduce(t, result.c1); modp.Reduce(t, result.c2); modp.Reduce(result.c1, t); modp.Reduce(result.c2, t); return result; } const Element& MultiplicativeInverse(const Element &a) const { return result = Exponentiate(a, modp.GetModulus()-2); } const Element& Square(const Element &a) const { const Integer &ac1 = (&a == &result) ? (t = a.c1) : a.c1; result.c1 = modp.Multiply(modp.Subtract(modp.Subtract(a.c2, a.c1), a.c1), a.c2); result.c2 = modp.Multiply(modp.Subtract(modp.Subtract(ac1, a.c2), a.c2), ac1); return result; } Element Exponentiate(const Element &a, const Integer &e) const { Integer edivp, emodp; Integer::Divide(emodp, edivp, e, modp.GetModulus()); Element b = PthPower(a); return AbstractRing::CascadeExponentiate(a, emodp, b, edivp); } const Element & PthPower(const Element &a) const { result = a; result.c1.swap(result.c2); return result; } void RaiseToPthPower(Element &a) const { a.c1.swap(a.c2); } // a^2 - 2a^p const Element & SpecialOperation1(const Element &a) const { assert(&a != &result); result = Square(a); modp.Reduce(result.c1, a.c2); modp.Reduce(result.c1, a.c2); modp.Reduce(result.c2, a.c1); modp.Reduce(result.c2, a.c1); return result; } // x * z - y * z^p const Element & SpecialOperation2(const Element &x, const Element &y, const Element &z) const { assert(&x != &result && &y != &result && &z != &result); t = modp.Add(x.c2, y.c2); result.c1 = modp.Multiply(z.c1, modp.Subtract(y.c1, t)); modp.Accumulate(result.c1, modp.Multiply(z.c2, modp.Subtract(t, x.c1))); t = modp.Add(x.c1, y.c1); result.c2 = modp.Multiply(z.c2, modp.Subtract(y.c2, t)); modp.Accumulate(result.c2, modp.Multiply(z.c1, modp.Subtract(t, x.c2))); return result; } protected: BaseField modp; mutable GFP2Element result; mutable Integer t; }; void XTR_FindPrimesAndGenerator(RandomNumberGenerator &rng, Integer &p, Integer &q, GFP2Element &g, unsigned int pbits, unsigned int qbits); GFP2Element XTR_Exponentiate(const GFP2Element &b, const Integer &e, const Integer &p); NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/square.cpp0000755000000000000000000001221412414772654017602 0ustar rootroot// square.cpp - written and placed in the public domain by Wei Dai // Based on Paulo S.L.M. Barreto's public domain implementation #include "pch.h" #include "square.h" #include "misc.h" #include "gf256.h" NAMESPACE_BEGIN(CryptoPP) // apply theta to a roundkey static void SquareTransform (word32 in[4], word32 out[4]) { static const byte G[4][4] = { 0x02U, 0x01U, 0x01U, 0x03U, 0x03U, 0x02U, 0x01U, 0x01U, 0x01U, 0x03U, 0x02U, 0x01U, 0x01U, 0x01U, 0x03U, 0x02U }; GF256 gf256(0xf5); for (int i = 0; i < 4; i++) { word32 temp = 0; for (int j = 0; j < 4; j++) for (int k = 0; k < 4; k++) temp ^= (word32)gf256.Multiply(GETBYTE(in[i], 3-k), G[k][j]) << ((3-j)*8); out[i] = temp; } } #define roundkeys(i, j) m_roundkeys[(i)*4+(j)] #define roundkeys4(i) (m_roundkeys+(i)*4) void Square::Base::UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs &) { AssertValidKeyLength(length); static const word32 offset[ROUNDS] = { 0x01000000UL, 0x02000000UL, 0x04000000UL, 0x08000000UL, 0x10000000UL, 0x20000000UL, 0x40000000UL, 0x80000000UL, }; GetUserKey(BIG_ENDIAN_ORDER, m_roundkeys.data(), KEYLENGTH/4, userKey, KEYLENGTH); /* apply the key evolution function */ for (int i = 1; i < ROUNDS+1; i++) { roundkeys(i, 0) = roundkeys(i-1, 0) ^ rotlFixed(roundkeys(i-1, 3), 8U) ^ offset[i-1]; roundkeys(i, 1) = roundkeys(i-1, 1) ^ roundkeys(i, 0); roundkeys(i, 2) = roundkeys(i-1, 2) ^ roundkeys(i, 1); roundkeys(i, 3) = roundkeys(i-1, 3) ^ roundkeys(i, 2); } /* produce the round keys */ if (IsForwardTransformation()) { for (int i = 0; i < ROUNDS; i++) SquareTransform (roundkeys4(i), roundkeys4(i)); } else { for (int i = 0; i < ROUNDS/2; i++) for (int j = 0; j < 4; j++) std::swap(roundkeys(i, j), roundkeys(ROUNDS-i, j)); SquareTransform (roundkeys4(ROUNDS), roundkeys4(ROUNDS)); } } #define MSB(x) (((x) >> 24) & 0xffU) /* most significant byte */ #define SSB(x) (((x) >> 16) & 0xffU) /* second in significance */ #define TSB(x) (((x) >> 8) & 0xffU) /* third in significance */ #define LSB(x) (((x) ) & 0xffU) /* least significant byte */ #define squareRound(text, temp, T0, T1, T2, T3, roundkey) \ { \ temp[0] = T0[MSB (text[0])] \ ^ T1[MSB (text[1])] \ ^ T2[MSB (text[2])] \ ^ T3[MSB (text[3])] \ ^ roundkey[0]; \ temp[1] = T0[SSB (text[0])] \ ^ T1[SSB (text[1])] \ ^ T2[SSB (text[2])] \ ^ T3[SSB (text[3])] \ ^ roundkey[1]; \ temp[2] = T0[TSB (text[0])] \ ^ T1[TSB (text[1])] \ ^ T2[TSB (text[2])] \ ^ T3[TSB (text[3])] \ ^ roundkey[2]; \ temp[3] = T0[LSB (text[0])] \ ^ T1[LSB (text[1])] \ ^ T2[LSB (text[2])] \ ^ T3[LSB (text[3])] \ ^ roundkey[3]; \ } /* squareRound */ #define squareFinal(text, temp, S, roundkey) \ { \ text[0] = ((word32) (S[MSB (temp[0])]) << 24) \ ^ ((word32) (S[MSB (temp[1])]) << 16) \ ^ ((word32) (S[MSB (temp[2])]) << 8) \ ^ (word32) (S[MSB (temp[3])]) \ ^ roundkey[0]; \ text[1] = ((word32) (S[SSB (temp[0])]) << 24) \ ^ ((word32) (S[SSB (temp[1])]) << 16) \ ^ ((word32) (S[SSB (temp[2])]) << 8) \ ^ (word32) (S[SSB (temp[3])]) \ ^ roundkey[1]; \ text[2] = ((word32) (S[TSB (temp[0])]) << 24) \ ^ ((word32) (S[TSB (temp[1])]) << 16) \ ^ ((word32) (S[TSB (temp[2])]) << 8) \ ^ (word32) (S[TSB (temp[3])]) \ ^ roundkey[2]; \ text[3] = ((word32) (S[LSB (temp[0])]) << 24) \ ^ ((word32) (S[LSB (temp[1])]) << 16) \ ^ ((word32) (S[LSB (temp[2])]) << 8) \ ^ (word32) (S[LSB (temp[3])]) \ ^ roundkey[3]; \ } /* squareFinal */ typedef BlockGetAndPut Block; void Square::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 text[4], temp[4]; Block::Get(inBlock)(text[0])(text[1])(text[2])(text[3]); /* initial key addition */ text[0] ^= roundkeys(0, 0); text[1] ^= roundkeys(0, 1); text[2] ^= roundkeys(0, 2); text[3] ^= roundkeys(0, 3); /* ROUNDS - 1 full rounds */ for (int i=1; i+1>1);} Integer ImageBound() const {return m_n;} bool Validate(RandomNumberGenerator &rng, unsigned int level) const; bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; void AssignFrom(const NameValuePairs &source); const Integer& GetModulus() const {return m_n;} void SetModulus(const Integer &n) {m_n = n;} protected: Integer m_n; }; //! _ class CRYPTOPP_DLL InvertibleRWFunction : public RWFunction, public TrapdoorFunctionInverse, public PrivateKey { typedef InvertibleRWFunction ThisClass; public: void Initialize(const Integer &n, const Integer &p, const Integer &q, const Integer &u) {m_n = n; m_p = p; m_q = q; m_u = u;} // generate a random private key void Initialize(RandomNumberGenerator &rng, unsigned int modulusBits) {GenerateRandomWithKeySize(rng, modulusBits);} void BERDecode(BufferedTransformation &bt); void DEREncode(BufferedTransformation &bt) const; Integer CalculateInverse(RandomNumberGenerator &rng, const Integer &x) const; // GeneratibleCryptoMaterial bool Validate(RandomNumberGenerator &rng, unsigned int level) const; bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; void AssignFrom(const NameValuePairs &source); /*! parameters: (ModulusSize) */ void GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg); const Integer& GetPrime1() const {return m_p;} const Integer& GetPrime2() const {return m_q;} const Integer& GetMultiplicativeInverseOfPrime2ModPrime1() const {return m_u;} void SetPrime1(const Integer &p) {m_p = p;} void SetPrime2(const Integer &q) {m_q = q;} void SetMultiplicativeInverseOfPrime2ModPrime1(const Integer &u) {m_u = u;} protected: Integer m_p, m_q, m_u; }; //! RW struct RW { static std::string StaticAlgorithmName() {return "RW";} typedef RWFunction PublicKey; typedef InvertibleRWFunction PrivateKey; }; //! RWSS template struct RWSS : public TF_SS { }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/validat1.cpp0000755000000000000000000013730712414772654020022 0ustar rootroot// validat1.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1 #include "files.h" #include "hex.h" #include "base32.h" #include "base64.h" #include "modes.h" #include "cbcmac.h" #include "dmac.h" #include "idea.h" #include "des.h" #include "rc2.h" #include "arc4.h" #include "rc5.h" #include "blowfish.h" #include "3way.h" #include "safer.h" #include "gost.h" #include "shark.h" #include "cast.h" #include "square.h" #include "seal.h" #include "rc6.h" #include "mars.h" #include "rijndael.h" #include "twofish.h" #include "serpent.h" #include "skipjack.h" #include "shacal2.h" #include "camellia.h" #include "osrng.h" #include "zdeflate.h" #include "cpu.h" #include #include #include #include #include "validate.h" USING_NAMESPACE(CryptoPP) USING_NAMESPACE(std) bool ValidateAll(bool thorough) { bool pass=TestSettings(); pass=TestOS_RNG() && pass; pass=ValidateCRC32() && pass; pass=ValidateAdler32() && pass; pass=ValidateMD2() && pass; pass=ValidateMD5() && pass; pass=ValidateSHA() && pass; pass=ValidateTiger() && pass; pass=ValidateRIPEMD() && pass; pass=ValidatePanama() && pass; pass=ValidateWhirlpool() && pass; pass=ValidateHMAC() && pass; pass=ValidateTTMAC() && pass; pass=ValidatePBKDF() && pass; pass=ValidateDES() && pass; pass=ValidateCipherModes() && pass; pass=ValidateIDEA() && pass; pass=ValidateSAFER() && pass; pass=ValidateRC2() && pass; pass=ValidateARC4() && pass; pass=ValidateRC5() && pass; pass=ValidateBlowfish() && pass; pass=ValidateThreeWay() && pass; pass=ValidateGOST() && pass; pass=ValidateSHARK() && pass; pass=ValidateCAST() && pass; pass=ValidateSquare() && pass; pass=ValidateSKIPJACK() && pass; pass=ValidateSEAL() && pass; pass=ValidateRC6() && pass; pass=ValidateMARS() && pass; pass=ValidateRijndael() && pass; pass=ValidateTwofish() && pass; pass=ValidateSerpent() && pass; pass=ValidateSHACAL2() && pass; pass=ValidateCamellia() && pass; pass=ValidateSalsa() && pass; pass=ValidateSosemanuk() && pass; pass=ValidateVMAC() && pass; pass=ValidateCCM() && pass; pass=ValidateGCM() && pass; pass=ValidateCMAC() && pass; pass=RunTestDataFile("TestVectors/eax.txt") && pass; pass=RunTestDataFile("TestVectors/seed.txt") && pass; pass=ValidateBBS() && pass; pass=ValidateDH() && pass; pass=ValidateMQV() && pass; pass=ValidateRSA() && pass; pass=ValidateElGamal() && pass; pass=ValidateDLIES() && pass; pass=ValidateNR() && pass; pass=ValidateDSA(thorough) && pass; pass=ValidateLUC() && pass; pass=ValidateLUC_DH() && pass; pass=ValidateLUC_DL() && pass; pass=ValidateXTR_DH() && pass; pass=ValidateRabin() && pass; pass=ValidateRW() && pass; // pass=ValidateBlumGoldwasser() && pass; pass=ValidateECP() && pass; pass=ValidateEC2N() && pass; pass=ValidateECDSA() && pass; pass=ValidateESIGN() && pass; if (pass) cout << "\nAll tests passed!\n"; else cout << "\nOops! Not all tests passed.\n"; return pass; } bool TestSettings() { bool pass = true; cout << "\nTesting Settings...\n\n"; word32 w; memcpy_s(&w, sizeof(w), "\x01\x02\x03\x04", 4); if (w == 0x04030201L) { #ifdef IS_LITTLE_ENDIAN cout << "passed: "; #else cout << "FAILED: "; pass = false; #endif cout << "Your machine is little endian.\n"; } else if (w == 0x01020304L) { #ifndef IS_LITTLE_ENDIAN cout << "passed: "; #else cout << "FAILED: "; pass = false; #endif cout << "Your machine is big endian.\n"; } else { cout << "FAILED: Your machine is neither big endian nor little endian.\n"; pass = false; } #ifdef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS byte testvals[10] = {1,2,2,3,3,3,3,2,2,1}; if (*(word32 *)(testvals+3) == 0x03030303 && *(word64 *)(testvals+1) == W64LIT(0x0202030303030202)) cout << "passed: Your machine allows unaligned data access.\n"; else { cout << "FAILED: Unaligned data access gave incorrect results.\n"; pass = false; } #else cout << "passed: CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS is not defined. Will restrict to aligned data access.\n"; #endif if (sizeof(byte) == 1) cout << "passed: "; else { cout << "FAILED: "; pass = false; } cout << "sizeof(byte) == " << sizeof(byte) << endl; if (sizeof(word16) == 2) cout << "passed: "; else { cout << "FAILED: "; pass = false; } cout << "sizeof(word16) == " << sizeof(word16) << endl; if (sizeof(word32) == 4) cout << "passed: "; else { cout << "FAILED: "; pass = false; } cout << "sizeof(word32) == " << sizeof(word32) << endl; if (sizeof(word64) == 8) cout << "passed: "; else { cout << "FAILED: "; pass = false; } cout << "sizeof(word64) == " << sizeof(word64) << endl; #ifdef CRYPTOPP_WORD128_AVAILABLE if (sizeof(word128) == 16) cout << "passed: "; else { cout << "FAILED: "; pass = false; } cout << "sizeof(word128) == " << sizeof(word128) << endl; #endif if (sizeof(word) == 2*sizeof(hword) #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE && sizeof(dword) == 2*sizeof(word) #endif ) cout << "passed: "; else { cout << "FAILED: "; pass = false; } cout << "sizeof(hword) == " << sizeof(hword) << ", sizeof(word) == " << sizeof(word); #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE cout << ", sizeof(dword) == " << sizeof(dword); #endif cout << endl; #ifdef CRYPTOPP_CPUID_AVAILABLE bool hasMMX = HasMMX(); bool hasISSE = HasISSE(); bool hasSSE2 = HasSSE2(); bool hasSSSE3 = HasSSSE3(); bool isP4 = IsP4(); int cacheLineSize = GetCacheLineSize(); if ((isP4 && (!hasMMX || !hasSSE2)) || (hasSSE2 && !hasMMX) || (cacheLineSize < 16 || cacheLineSize > 256 || !IsPowerOf2(cacheLineSize))) { cout << "FAILED: "; pass = false; } else cout << "passed: "; cout << "hasMMX == " << hasMMX << ", hasISSE == " << hasISSE << ", hasSSE2 == " << hasSSE2 << ", hasSSSE3 == " << hasSSSE3 << ", hasAESNI == " << HasAESNI() << ", hasCLMUL == " << HasCLMUL() << ", isP4 == " << isP4 << ", cacheLineSize == " << cacheLineSize; cout << ", AESNI_INTRINSICS == " << CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE << endl; #endif if (!pass) { cout << "Some critical setting in config.h is in error. Please fix it and recompile." << endl; abort(); } return pass; } bool TestOS_RNG() { bool pass = true; member_ptr rng; #ifdef BLOCKING_RNG_AVAILABLE try {rng.reset(new BlockingRng);} catch (OS_RNG_Err &) {} #endif if (rng.get()) { cout << "\nTesting operating system provided blocking random number generator...\n\n"; ArraySink *sink; RandomNumberSource test(*rng, UINT_MAX, false, new Deflator(sink=new ArraySink(NULL,0))); unsigned long total=0, length=0; time_t t = time(NULL), t1 = 0; // check that it doesn't take too long to generate a reasonable amount of randomness while (total < 16 && (t1 < 10 || total*8 > (unsigned long)t1)) { test.Pump(1); total += 1; t1 = time(NULL) - t; } if (total < 16) { cout << "FAILED:"; pass = false; } else cout << "passed:"; cout << " it took " << long(t1) << " seconds to generate " << total << " bytes" << endl; #if 0 // disable this part. it's causing an unpredictable pause during the validation testing if (t1 < 2) { // that was fast, are we really blocking? // first exhaust the extropy reserve t = time(NULL); while (time(NULL) - t < 2) { test.Pump(1); total += 1; } // if it generates too many bytes in a certain amount of time, // something's probably wrong t = time(NULL); while (time(NULL) - t < 2) { test.Pump(1); total += 1; length += 1; } if (length > 1024) { cout << "FAILED:"; pass = false; } else cout << "passed:"; cout << " it generated " << length << " bytes in " << long(time(NULL) - t) << " seconds" << endl; } #endif test.AttachedTransformation()->MessageEnd(); if (sink->TotalPutLength() < total) { cout << "FAILED:"; pass = false; } else cout << "passed:"; cout << " " << total << " generated bytes compressed to " << (size_t)sink->TotalPutLength() << " bytes by DEFLATE" << endl; } else cout << "\nNo operating system provided blocking random number generator, skipping test." << endl; rng.reset(NULL); #ifdef NONBLOCKING_RNG_AVAILABLE try {rng.reset(new NonblockingRng);} catch (OS_RNG_Err &) {} #endif if (rng.get()) { cout << "\nTesting operating system provided nonblocking random number generator...\n\n"; ArraySink *sink; RandomNumberSource test(*rng, 100000, true, new Deflator(sink=new ArraySink(NULL, 0))); if (sink->TotalPutLength() < 100000) { cout << "FAILED:"; pass = false; } else cout << "passed:"; cout << " 100000 generated bytes compressed to " << (size_t)sink->TotalPutLength() << " bytes by DEFLATE" << endl; } else cout << "\nNo operating system provided nonblocking random number generator, skipping test." << endl; return pass; } // VC50 workaround typedef auto_ptr apbt; class CipherFactory { public: virtual unsigned int BlockSize() const =0; virtual unsigned int KeyLength() const =0; virtual apbt NewEncryption(const byte *key) const =0; virtual apbt NewDecryption(const byte *key) const =0; }; template class FixedRoundsCipherFactory : public CipherFactory { public: FixedRoundsCipherFactory(unsigned int keylen=0) : m_keylen(keylen?keylen:E::DEFAULT_KEYLENGTH) {} unsigned int BlockSize() const {return E::BLOCKSIZE;} unsigned int KeyLength() const {return m_keylen;} apbt NewEncryption(const byte *key) const {return apbt(new E(key, m_keylen));} apbt NewDecryption(const byte *key) const {return apbt(new D(key, m_keylen));} unsigned int m_keylen; }; template class VariableRoundsCipherFactory : public CipherFactory { public: VariableRoundsCipherFactory(unsigned int keylen=0, unsigned int rounds=0) : m_keylen(keylen ? keylen : E::DEFAULT_KEYLENGTH), m_rounds(rounds ? rounds : E::DEFAULT_ROUNDS) {} unsigned int BlockSize() const {return E::BLOCKSIZE;} unsigned int KeyLength() const {return m_keylen;} apbt NewEncryption(const byte *key) const {return apbt(new E(key, m_keylen, m_rounds));} apbt NewDecryption(const byte *key) const {return apbt(new D(key, m_keylen, m_rounds));} unsigned int m_keylen, m_rounds; }; bool BlockTransformationTest(const CipherFactory &cg, BufferedTransformation &valdata, unsigned int tuples = 0xffff) { HexEncoder output(new FileSink(cout)); SecByteBlock plain(cg.BlockSize()), cipher(cg.BlockSize()), out(cg.BlockSize()), outplain(cg.BlockSize()); SecByteBlock key(cg.KeyLength()); bool pass=true, fail; while (valdata.MaxRetrievable() && tuples--) { valdata.Get(key, cg.KeyLength()); valdata.Get(plain, cg.BlockSize()); valdata.Get(cipher, cg.BlockSize()); apbt transE = cg.NewEncryption(key); transE->ProcessBlock(plain, out); fail = memcmp(out, cipher, cg.BlockSize()) != 0; apbt transD = cg.NewDecryption(key); transD->ProcessBlock(out, outplain); fail=fail || memcmp(outplain, plain, cg.BlockSize()); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); output.Put(key, cg.KeyLength()); cout << " "; output.Put(outplain, cg.BlockSize()); cout << " "; output.Put(out, cg.BlockSize()); cout << endl; } return pass; } class FilterTester : public Unflushable { public: FilterTester(const byte *validOutput, size_t outputLen) : validOutput(validOutput), outputLen(outputLen), counter(0), fail(false) {} void PutByte(byte inByte) { if (counter >= outputLen || validOutput[counter] != inByte) { std::cerr << "incorrect output " << counter << ", " << (word16)validOutput[counter] << ", " << (word16)inByte << "\n"; fail = true; assert(false); } counter++; } size_t Put2(const byte *inString, size_t length, int messageEnd, bool blocking) { while (length--) FilterTester::PutByte(*inString++); if (messageEnd) if (counter != outputLen) { fail = true; assert(false); } return 0; } bool GetResult() { return !fail; } const byte *validOutput; size_t outputLen, counter; bool fail; }; bool TestFilter(BufferedTransformation &bt, const byte *in, size_t inLen, const byte *out, size_t outLen) { FilterTester *ft; bt.Attach(ft = new FilterTester(out, outLen)); while (inLen) { size_t randomLen = GlobalRNG().GenerateWord32(0, (word32)inLen); bt.Put(in, randomLen); in += randomLen; inLen -= randomLen; } bt.MessageEnd(); return ft->GetResult(); } bool ValidateDES() { cout << "\nDES validation suite running...\n\n"; FileSource valdata("TestData/descert.dat", true, new HexDecoder); bool pass = BlockTransformationTest(FixedRoundsCipherFactory(), valdata); cout << "\nTesting EDE2, EDE3, and XEX3 variants...\n\n"; FileSource valdata1("TestData/3desval.dat", true, new HexDecoder); pass = BlockTransformationTest(FixedRoundsCipherFactory(), valdata1, 1) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(), valdata1, 1) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(), valdata1, 1) && pass; return pass; } bool TestModeIV(SymmetricCipher &e, SymmetricCipher &d) { SecByteBlock lastIV, iv(e.IVSize()); StreamTransformationFilter filter(e, new StreamTransformationFilter(d)); byte plaintext[20480]; for (unsigned int i=1; i cbcmac(key); HashFilter cbcmacFilter(cbcmac); fail = !TestFilter(cbcmacFilter, plain, sizeof(plain), mac1, sizeof(mac1)); pass = pass && !fail; cout << (fail ? "FAILED " : "passed ") << "CBC MAC" << endl; DMAC dmac(key); HashFilter dmacFilter(dmac); fail = !TestFilter(dmacFilter, plain, sizeof(plain), mac2, sizeof(mac2)); pass = pass && !fail; cout << (fail ? "FAILED " : "passed ") << "DMAC" << endl; } { CTR_Mode::Encryption modeE(plain, 16, plain); CTR_Mode::Decryption modeD(plain, 16, plain); fail = !TestModeIV(modeE, modeD); pass = pass && !fail; cout << (fail ? "FAILED " : "passed ") << "AES CTR Mode" << endl; } { OFB_Mode::Encryption modeE(plain, 16, plain); OFB_Mode::Decryption modeD(plain, 16, plain); fail = !TestModeIV(modeE, modeD); pass = pass && !fail; cout << (fail ? "FAILED " : "passed ") << "AES OFB Mode" << endl; } { CFB_Mode::Encryption modeE(plain, 16, plain); CFB_Mode::Decryption modeD(plain, 16, plain); fail = !TestModeIV(modeE, modeD); pass = pass && !fail; cout << (fail ? "FAILED " : "passed ") << "AES CFB Mode" << endl; } { CBC_Mode::Encryption modeE(plain, 16, plain); CBC_Mode::Decryption modeD(plain, 16, plain); fail = !TestModeIV(modeE, modeD); pass = pass && !fail; cout << (fail ? "FAILED " : "passed ") << "AES CBC Mode" << endl; } return pass; } bool ValidateIDEA() { cout << "\nIDEA validation suite running...\n\n"; FileSource valdata("TestData/ideaval.dat", true, new HexDecoder); return BlockTransformationTest(FixedRoundsCipherFactory(), valdata); } bool ValidateSAFER() { cout << "\nSAFER validation suite running...\n\n"; FileSource valdata("TestData/saferval.dat", true, new HexDecoder); bool pass = true; pass = BlockTransformationTest(VariableRoundsCipherFactory(8,6), valdata, 4) && pass; pass = BlockTransformationTest(VariableRoundsCipherFactory(16,12), valdata, 4) && pass; pass = BlockTransformationTest(VariableRoundsCipherFactory(8,6), valdata, 4) && pass; pass = BlockTransformationTest(VariableRoundsCipherFactory(16,10), valdata, 4) && pass; return pass; } bool ValidateRC2() { cout << "\nRC2 validation suite running...\n\n"; FileSource valdata("TestData/rc2val.dat", true, new HexDecoder); HexEncoder output(new FileSink(cout)); SecByteBlock plain(RC2Encryption::BLOCKSIZE), cipher(RC2Encryption::BLOCKSIZE), out(RC2Encryption::BLOCKSIZE), outplain(RC2Encryption::BLOCKSIZE); SecByteBlock key(128); bool pass=true, fail; while (valdata.MaxRetrievable()) { byte keyLen, effectiveLen; valdata.Get(keyLen); valdata.Get(effectiveLen); valdata.Get(key, keyLen); valdata.Get(plain, RC2Encryption::BLOCKSIZE); valdata.Get(cipher, RC2Encryption::BLOCKSIZE); apbt transE(new RC2Encryption(key, keyLen, effectiveLen)); transE->ProcessBlock(plain, out); fail = memcmp(out, cipher, RC2Encryption::BLOCKSIZE) != 0; apbt transD(new RC2Decryption(key, keyLen, effectiveLen)); transD->ProcessBlock(out, outplain); fail=fail || memcmp(outplain, plain, RC2Encryption::BLOCKSIZE); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); output.Put(key, keyLen); cout << " "; output.Put(outplain, RC2Encryption::BLOCKSIZE); cout << " "; output.Put(out, RC2Encryption::BLOCKSIZE); cout << endl; } return pass; } bool ValidateARC4() { unsigned char Key0[] = {0x01,0x23,0x45,0x67,0x89,0xab,0xcd,0xef }; unsigned char Input0[]={0x01,0x23,0x45,0x67,0x89,0xab,0xcd,0xef}; unsigned char Output0[] = {0x75,0xb7,0x87,0x80,0x99,0xe0,0xc5,0x96}; unsigned char Key1[]={0x01,0x23,0x45,0x67,0x89,0xab,0xcd,0xef}; unsigned char Input1[]={0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00}; unsigned char Output1[]={0x74,0x94,0xc2,0xe7,0x10,0x4b,0x08,0x79}; unsigned char Key2[]={0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00}; unsigned char Input2[]={0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00}; unsigned char Output2[]={0xde,0x18,0x89,0x41,0xa3,0x37,0x5d,0x3a}; unsigned char Key3[]={0xef,0x01,0x23,0x45}; unsigned char Input3[]={0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00}; unsigned char Output3[]={0xd6,0xa1,0x41,0xa7,0xec,0x3c,0x38,0xdf,0xbd,0x61}; unsigned char Key4[]={ 0x01,0x23,0x45,0x67,0x89,0xab, 0xcd,0xef }; unsigned char Input4[] = {0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01, 0x01}; unsigned char Output4[]= { 0x75,0x95,0xc3,0xe6,0x11,0x4a,0x09,0x78,0x0c,0x4a,0xd4, 0x52,0x33,0x8e,0x1f,0xfd,0x9a,0x1b,0xe9,0x49,0x8f, 0x81,0x3d,0x76,0x53,0x34,0x49,0xb6,0x77,0x8d,0xca, 0xd8,0xc7,0x8a,0x8d,0x2b,0xa9,0xac,0x66,0x08,0x5d, 0x0e,0x53,0xd5,0x9c,0x26,0xc2,0xd1,0xc4,0x90,0xc1, 0xeb,0xbe,0x0c,0xe6,0x6d,0x1b,0x6b,0x1b,0x13,0xb6, 0xb9,0x19,0xb8,0x47,0xc2,0x5a,0x91,0x44,0x7a,0x95, 0xe7,0x5e,0x4e,0xf1,0x67,0x79,0xcd,0xe8,0xbf,0x0a, 0x95,0x85,0x0e,0x32,0xaf,0x96,0x89,0x44,0x4f,0xd3, 0x77,0x10,0x8f,0x98,0xfd,0xcb,0xd4,0xe7,0x26,0x56, 0x75,0x00,0x99,0x0b,0xcc,0x7e,0x0c,0xa3,0xc4,0xaa, 0xa3,0x04,0xa3,0x87,0xd2,0x0f,0x3b,0x8f,0xbb,0xcd, 0x42,0xa1,0xbd,0x31,0x1d,0x7a,0x43,0x03,0xdd,0xa5, 0xab,0x07,0x88,0x96,0xae,0x80,0xc1,0x8b,0x0a,0xf6, 0x6d,0xff,0x31,0x96,0x16,0xeb,0x78,0x4e,0x49,0x5a, 0xd2,0xce,0x90,0xd7,0xf7,0x72,0xa8,0x17,0x47,0xb6, 0x5f,0x62,0x09,0x3b,0x1e,0x0d,0xb9,0xe5,0xba,0x53, 0x2f,0xaf,0xec,0x47,0x50,0x83,0x23,0xe6,0x71,0x32, 0x7d,0xf9,0x44,0x44,0x32,0xcb,0x73,0x67,0xce,0xc8, 0x2f,0x5d,0x44,0xc0,0xd0,0x0b,0x67,0xd6,0x50,0xa0, 0x75,0xcd,0x4b,0x70,0xde,0xdd,0x77,0xeb,0x9b,0x10, 0x23,0x1b,0x6b,0x5b,0x74,0x13,0x47,0x39,0x6d,0x62, 0x89,0x74,0x21,0xd4,0x3d,0xf9,0xb4,0x2e,0x44,0x6e, 0x35,0x8e,0x9c,0x11,0xa9,0xb2,0x18,0x4e,0xcb,0xef, 0x0c,0xd8,0xe7,0xa8,0x77,0xef,0x96,0x8f,0x13,0x90, 0xec,0x9b,0x3d,0x35,0xa5,0x58,0x5c,0xb0,0x09,0x29, 0x0e,0x2f,0xcd,0xe7,0xb5,0xec,0x66,0xd9,0x08,0x4b, 0xe4,0x40,0x55,0xa6,0x19,0xd9,0xdd,0x7f,0xc3,0x16, 0x6f,0x94,0x87,0xf7,0xcb,0x27,0x29,0x12,0x42,0x64, 0x45,0x99,0x85,0x14,0xc1,0x5d,0x53,0xa1,0x8c,0x86, 0x4c,0xe3,0xa2,0xb7,0x55,0x57,0x93,0x98,0x81,0x26, 0x52,0x0e,0xac,0xf2,0xe3,0x06,0x6e,0x23,0x0c,0x91, 0xbe,0xe4,0xdd,0x53,0x04,0xf5,0xfd,0x04,0x05,0xb3, 0x5b,0xd9,0x9c,0x73,0x13,0x5d,0x3d,0x9b,0xc3,0x35, 0xee,0x04,0x9e,0xf6,0x9b,0x38,0x67,0xbf,0x2d,0x7b, 0xd1,0xea,0xa5,0x95,0xd8,0xbf,0xc0,0x06,0x6f,0xf8, 0xd3,0x15,0x09,0xeb,0x0c,0x6c,0xaa,0x00,0x6c,0x80, 0x7a,0x62,0x3e,0xf8,0x4c,0x3d,0x33,0xc1,0x95,0xd2, 0x3e,0xe3,0x20,0xc4,0x0d,0xe0,0x55,0x81,0x57,0xc8, 0x22,0xd4,0xb8,0xc5,0x69,0xd8,0x49,0xae,0xd5,0x9d, 0x4e,0x0f,0xd7,0xf3,0x79,0x58,0x6b,0x4b,0x7f,0xf6, 0x84,0xed,0x6a,0x18,0x9f,0x74,0x86,0xd4,0x9b,0x9c, 0x4b,0xad,0x9b,0xa2,0x4b,0x96,0xab,0xf9,0x24,0x37, 0x2c,0x8a,0x8f,0xff,0xb1,0x0d,0x55,0x35,0x49,0x00, 0xa7,0x7a,0x3d,0xb5,0xf2,0x05,0xe1,0xb9,0x9f,0xcd, 0x86,0x60,0x86,0x3a,0x15,0x9a,0xd4,0xab,0xe4,0x0f, 0xa4,0x89,0x34,0x16,0x3d,0xdd,0xe5,0x42,0xa6,0x58, 0x55,0x40,0xfd,0x68,0x3c,0xbf,0xd8,0xc0,0x0f,0x12, 0x12,0x9a,0x28,0x4d,0xea,0xcc,0x4c,0xde,0xfe,0x58, 0xbe,0x71,0x37,0x54,0x1c,0x04,0x71,0x26,0xc8,0xd4, 0x9e,0x27,0x55,0xab,0x18,0x1a,0xb7,0xe9,0x40,0xb0, 0xc0}; // VC60 workaround: auto_ptr lacks reset() member_ptr arc4; bool pass=true, fail; int i; cout << "\nARC4 validation suite running...\n\n"; arc4.reset(new Weak::ARC4(Key0, sizeof(Key0))); arc4->ProcessString(Input0, sizeof(Input0)); fail = memcmp(Input0, Output0, sizeof(Input0)) != 0; cout << (fail ? "FAILED" : "passed") << " Test 0" << endl; pass = pass && !fail; arc4.reset(new Weak::ARC4(Key1, sizeof(Key1))); arc4->ProcessString(Key1, Input1, sizeof(Key1)); fail = memcmp(Output1, Key1, sizeof(Key1)) != 0; cout << (fail ? "FAILED" : "passed") << " Test 1" << endl; pass = pass && !fail; arc4.reset(new Weak::ARC4(Key2, sizeof(Key2))); for (i=0, fail=false; iProcessByte(Input2[i]) != Output2[i]) fail = true; cout << (fail ? "FAILED" : "passed") << " Test 2" << endl; pass = pass && !fail; arc4.reset(new Weak::ARC4(Key3, sizeof(Key3))); for (i=0, fail=false; iProcessByte(Input3[i]) != Output3[i]) fail = true; cout << (fail ? "FAILED" : "passed") << " Test 3" << endl; pass = pass && !fail; arc4.reset(new Weak::ARC4(Key4, sizeof(Key4))); for (i=0, fail=false; iProcessByte(Input4[i]) != Output4[i]) fail = true; cout << (fail ? "FAILED" : "passed") << " Test 4" << endl; pass = pass && !fail; return pass; } bool ValidateRC5() { cout << "\nRC5 validation suite running...\n\n"; FileSource valdata("TestData/rc5val.dat", true, new HexDecoder); return BlockTransformationTest(VariableRoundsCipherFactory(16, 12), valdata); } bool ValidateRC6() { cout << "\nRC6 validation suite running...\n\n"; FileSource valdata("TestData/rc6val.dat", true, new HexDecoder); bool pass = true; pass = BlockTransformationTest(FixedRoundsCipherFactory(16), valdata, 2) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(24), valdata, 2) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(32), valdata, 2) && pass; return pass; } bool ValidateMARS() { cout << "\nMARS validation suite running...\n\n"; FileSource valdata("TestData/marsval.dat", true, new HexDecoder); bool pass = true; pass = BlockTransformationTest(FixedRoundsCipherFactory(16), valdata, 4) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(24), valdata, 3) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(32), valdata, 2) && pass; return pass; } bool ValidateRijndael() { cout << "\nRijndael (AES) validation suite running...\n\n"; FileSource valdata("TestData/rijndael.dat", true, new HexDecoder); bool pass = true; pass = BlockTransformationTest(FixedRoundsCipherFactory(16), valdata, 4) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(24), valdata, 3) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(32), valdata, 2) && pass; pass = RunTestDataFile("TestVectors/aes.txt") && pass; return pass; } bool ValidateTwofish() { cout << "\nTwofish validation suite running...\n\n"; FileSource valdata("TestData/twofishv.dat", true, new HexDecoder); bool pass = true; pass = BlockTransformationTest(FixedRoundsCipherFactory(16), valdata, 4) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(24), valdata, 3) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(32), valdata, 2) && pass; return pass; } bool ValidateSerpent() { cout << "\nSerpent validation suite running...\n\n"; FileSource valdata("TestData/serpentv.dat", true, new HexDecoder); bool pass = true; pass = BlockTransformationTest(FixedRoundsCipherFactory(16), valdata, 4) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(24), valdata, 3) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(32), valdata, 2) && pass; return pass; } bool ValidateBlowfish() { cout << "\nBlowfish validation suite running...\n\n"; HexEncoder output(new FileSink(cout)); const char *key[]={"abcdefghijklmnopqrstuvwxyz", "Who is John Galt?"}; byte *plain[]={(byte *)"BLOWFISH", (byte *)"\xfe\xdc\xba\x98\x76\x54\x32\x10"}; byte *cipher[]={(byte *)"\x32\x4e\xd0\xfe\xf4\x13\xa2\x03", (byte *)"\xcc\x91\x73\x2b\x80\x22\xf6\x84"}; byte out[8], outplain[8]; bool pass=true, fail; for (int i=0; i<2; i++) { ECB_Mode::Encryption enc((byte *)key[i], strlen(key[i])); enc.ProcessData(out, plain[i], 8); fail = memcmp(out, cipher[i], 8) != 0; ECB_Mode::Decryption dec((byte *)key[i], strlen(key[i])); dec.ProcessData(outplain, cipher[i], 8); fail = fail || memcmp(outplain, plain[i], 8); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << '\"' << key[i] << '\"'; for (int j=0; j<(signed int)(30-strlen(key[i])); j++) cout << ' '; output.Put(outplain, 8); cout << " "; output.Put(out, 8); cout << endl; } return pass; } bool ValidateThreeWay() { cout << "\n3-WAY validation suite running...\n\n"; FileSource valdata("TestData/3wayval.dat", true, new HexDecoder); return BlockTransformationTest(FixedRoundsCipherFactory(), valdata); } bool ValidateGOST() { cout << "\nGOST validation suite running...\n\n"; FileSource valdata("TestData/gostval.dat", true, new HexDecoder); return BlockTransformationTest(FixedRoundsCipherFactory(), valdata); } bool ValidateSHARK() { cout << "\nSHARK validation suite running...\n\n"; FileSource valdata("TestData/sharkval.dat", true, new HexDecoder); return BlockTransformationTest(FixedRoundsCipherFactory(), valdata); } bool ValidateCAST() { bool pass = true; cout << "\nCAST-128 validation suite running...\n\n"; FileSource val128("TestData/cast128v.dat", true, new HexDecoder); pass = BlockTransformationTest(FixedRoundsCipherFactory(16), val128, 1) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(10), val128, 1) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(5), val128, 1) && pass; cout << "\nCAST-256 validation suite running...\n\n"; FileSource val256("TestData/cast256v.dat", true, new HexDecoder); pass = BlockTransformationTest(FixedRoundsCipherFactory(16), val256, 1) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(24), val256, 1) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(32), val256, 1) && pass; return pass; } bool ValidateSquare() { cout << "\nSquare validation suite running...\n\n"; FileSource valdata("TestData/squareva.dat", true, new HexDecoder); return BlockTransformationTest(FixedRoundsCipherFactory(), valdata); } bool ValidateSKIPJACK() { cout << "\nSKIPJACK validation suite running...\n\n"; FileSource valdata("TestData/skipjack.dat", true, new HexDecoder); return BlockTransformationTest(FixedRoundsCipherFactory(), valdata); } bool ValidateSEAL() { byte input[] = {0x37,0xa0,0x05,0x95,0x9b,0x84,0xc4,0x9c,0xa4,0xbe,0x1e,0x05,0x06,0x73,0x53,0x0f,0x5f,0xb0,0x97,0xfd,0xf6,0xa1,0x3f,0xbd,0x6c,0x2c,0xde,0xcd,0x81,0xfd,0xee,0x7c}; byte output[32]; byte key[] = {0x67, 0x45, 0x23, 0x01, 0xef, 0xcd, 0xab, 0x89, 0x98, 0xba, 0xdc, 0xfe, 0x10, 0x32, 0x54, 0x76, 0xc3, 0xd2, 0xe1, 0xf0}; byte iv[] = {0x01, 0x35, 0x77, 0xaf}; cout << "\nSEAL validation suite running...\n\n"; SEAL<>::Encryption seal(key, sizeof(key), iv); unsigned int size = sizeof(input); bool pass = true; memset(output, 1, size); seal.ProcessString(output, input, size); for (unsigned int i=0; i(16), valdata, 4) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(64), valdata, 10) && pass; return pass; } bool ValidateCamellia() { cout << "\nCamellia validation suite running...\n\n"; bool pass = true; FileSource valdata("TestData/camellia.dat", true, new HexDecoder); pass = BlockTransformationTest(FixedRoundsCipherFactory(16), valdata, 15) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(24), valdata, 15) && pass; pass = BlockTransformationTest(FixedRoundsCipherFactory(32), valdata, 15) && pass; return pass; } bool ValidateSalsa() { cout << "\nSalsa validation suite running...\n"; return RunTestDataFile("TestVectors/salsa.txt"); } bool ValidateSosemanuk() { cout << "\nSosemanuk validation suite running...\n"; return RunTestDataFile("TestVectors/sosemanuk.txt"); } bool ValidateVMAC() { cout << "\nVMAC validation suite running...\n"; return RunTestDataFile("TestVectors/vmac.txt"); } bool ValidateCCM() { cout << "\nAES/CCM validation suite running...\n"; return RunTestDataFile("TestVectors/ccm.txt"); } bool ValidateGCM() { cout << "\nAES/GCM validation suite running...\n"; cout << "\n2K tables:"; bool pass = RunTestDataFile("TestVectors/gcm.txt", MakeParameters(Name::TableSize(), (int)2048)); cout << "\n64K tables:"; return RunTestDataFile("TestVectors/gcm.txt", MakeParameters(Name::TableSize(), (int)64*1024)) && pass; } bool ValidateCMAC() { cout << "\nCMAC validation suite running...\n"; return RunTestDataFile("TestVectors/cmac.txt"); } armory-0.92.3/cppForSwig/cryptopp/gzip.cpp0000755000000000000000000000476612414772654017270 0ustar rootroot// gzip.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "gzip.h" NAMESPACE_BEGIN(CryptoPP) void Gzip::WritePrestreamHeader() { m_totalLen = 0; m_crc.Restart(); AttachedTransformation()->Put(MAGIC1); AttachedTransformation()->Put(MAGIC2); AttachedTransformation()->Put(DEFLATED); AttachedTransformation()->Put(0); // general flag AttachedTransformation()->PutWord32(0); // time stamp byte extra = (GetDeflateLevel() == 1) ? FAST : ((GetDeflateLevel() == 9) ? SLOW : 0); AttachedTransformation()->Put(extra); AttachedTransformation()->Put(GZIP_OS_CODE); } void Gzip::ProcessUncompressedData(const byte *inString, size_t length) { m_crc.Update(inString, length); m_totalLen += (word32)length; } void Gzip::WritePoststreamTail() { SecByteBlock crc(4); m_crc.Final(crc); AttachedTransformation()->Put(crc, 4); AttachedTransformation()->PutWord32(m_totalLen, LITTLE_ENDIAN_ORDER); } // ************************************************************* Gunzip::Gunzip(BufferedTransformation *attachment, bool repeat, int propagation) : Inflator(attachment, repeat, propagation) { } void Gunzip::ProcessPrestreamHeader() { m_length = 0; m_crc.Restart(); byte buf[6]; byte b, flags; if (m_inQueue.Get(buf, 2)!=2) throw HeaderErr(); if (buf[0] != MAGIC1 || buf[1] != MAGIC2) throw HeaderErr(); if (!m_inQueue.Skip(1)) throw HeaderErr(); // skip extra flags if (!m_inQueue.Get(flags)) throw HeaderErr(); if (flags & (ENCRYPTED | CONTINUED)) throw HeaderErr(); if (m_inQueue.Skip(6)!=6) throw HeaderErr(); // Skip file time, extra flags and OS type if (flags & EXTRA_FIELDS) // skip extra fields { word16 length; if (m_inQueue.GetWord16(length, LITTLE_ENDIAN_ORDER) != 2) throw HeaderErr(); if (m_inQueue.Skip(length)!=length) throw HeaderErr(); } if (flags & FILENAME) // skip filename do if(!m_inQueue.Get(b)) throw HeaderErr(); while (b); if (flags & COMMENTS) // skip comments do if(!m_inQueue.Get(b)) throw HeaderErr(); while (b); } void Gunzip::ProcessDecompressedData(const byte *inString, size_t length) { AttachedTransformation()->Put(inString, length); m_crc.Update(inString, length); m_length += (word32)length; } void Gunzip::ProcessPoststreamTail() { SecByteBlock crc(4); if (m_inQueue.Get(crc, 4) != 4) throw TailErr(); if (!m_crc.Verify(crc)) throw CrcErr(); word32 lengthCheck; if (m_inQueue.GetWord32(lengthCheck, LITTLE_ENDIAN_ORDER) != 4) throw TailErr(); if (lengthCheck != m_length) throw LengthErr(); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/ec2n.h0000755000000000000000000000741612414772654016606 0ustar rootroot#ifndef CRYPTOPP_EC2N_H #define CRYPTOPP_EC2N_H #include "gf2n.h" #include "eprecomp.h" #include "smartptr.h" #include "pubkey.h" NAMESPACE_BEGIN(CryptoPP) //! Elliptic Curve Point struct CRYPTOPP_DLL EC2NPoint { EC2NPoint() : identity(true) {} EC2NPoint(const PolynomialMod2 &x, const PolynomialMod2 &y) : identity(false), x(x), y(y) {} bool operator==(const EC2NPoint &t) const {return (identity && t.identity) || (!identity && !t.identity && x==t.x && y==t.y);} bool operator< (const EC2NPoint &t) const {return identity ? !t.identity : (!t.identity && (x; //! Elliptic Curve over GF(2^n) class CRYPTOPP_DLL EC2N : public AbstractGroup { public: typedef GF2NP Field; typedef Field::Element FieldElement; typedef EC2NPoint Point; EC2N() {} EC2N(const Field &field, const Field::Element &a, const Field::Element &b) : m_field(field), m_a(a), m_b(b) {} // construct from BER encoded parameters // this constructor will decode and extract the the fields fieldID and curve of the sequence ECParameters EC2N(BufferedTransformation &bt); // encode the fields fieldID and curve of the sequence ECParameters void DEREncode(BufferedTransformation &bt) const; bool Equal(const Point &P, const Point &Q) const; const Point& Identity() const; const Point& Inverse(const Point &P) const; bool InversionIsFast() const {return true;} const Point& Add(const Point &P, const Point &Q) const; const Point& Double(const Point &P) const; Point Multiply(const Integer &k, const Point &P) const {return ScalarMultiply(P, k);} Point CascadeMultiply(const Integer &k1, const Point &P, const Integer &k2, const Point &Q) const {return CascadeScalarMultiply(P, k1, Q, k2);} bool ValidateParameters(RandomNumberGenerator &rng, unsigned int level=3) const; bool VerifyPoint(const Point &P) const; unsigned int EncodedPointSize(bool compressed = false) const {return 1 + (compressed?1:2)*m_field->MaxElementByteLength();} // returns false if point is compressed and not valid (doesn't check if uncompressed) bool DecodePoint(Point &P, BufferedTransformation &bt, size_t len) const; bool DecodePoint(Point &P, const byte *encodedPoint, size_t len) const; void EncodePoint(byte *encodedPoint, const Point &P, bool compressed) const; void EncodePoint(BufferedTransformation &bt, const Point &P, bool compressed) const; Point BERDecodePoint(BufferedTransformation &bt) const; void DEREncodePoint(BufferedTransformation &bt, const Point &P, bool compressed) const; Integer FieldSize() const {return Integer::Power2(m_field->MaxElementBitLength());} const Field & GetField() const {return *m_field;} const FieldElement & GetA() const {return m_a;} const FieldElement & GetB() const {return m_b;} bool operator==(const EC2N &rhs) const {return GetField() == rhs.GetField() && m_a == rhs.m_a && m_b == rhs.m_b;} private: clonable_ptr m_field; FieldElement m_a, m_b; mutable Point m_R; }; CRYPTOPP_DLL_TEMPLATE_CLASS DL_FixedBasePrecomputationImpl; CRYPTOPP_DLL_TEMPLATE_CLASS DL_GroupPrecomputation; template class EcPrecomputation; //! EC2N precomputation template<> class EcPrecomputation : public DL_GroupPrecomputation { public: typedef EC2N EllipticCurve; // DL_GroupPrecomputation const AbstractGroup & GetGroup() const {return m_ec;} Element BERDecodeElement(BufferedTransformation &bt) const {return m_ec.BERDecodePoint(bt);} void DEREncodeElement(BufferedTransformation &bt, const Element &v) const {m_ec.DEREncodePoint(bt, v, false);} // non-inherited void SetCurve(const EC2N &ec) {m_ec = ec;} const EC2N & GetCurve() const {return m_ec;} private: EC2N m_ec; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/cryptlib_bds.bdsproj0000755000000000000000000010356712414772654021657 0ustar rootroot cryptlib_bds.cpp False False 1 0 0 0 False False False False False 1033 1252 1.0.0.0 1.0.0.0 False False False True False armory-0.92.3/cppForSwig/cryptopp/elgamal.h0000755000000000000000000001061012414772654017347 0ustar rootroot#ifndef CRYPTOPP_ELGAMAL_H #define CRYPTOPP_ELGAMAL_H #include "modexppc.h" #include "dsa.h" NAMESPACE_BEGIN(CryptoPP) class CRYPTOPP_NO_VTABLE ElGamalBase : public DL_KeyAgreementAlgorithm_DH, public DL_KeyDerivationAlgorithm, public DL_SymmetricEncryptionAlgorithm { public: void Derive(const DL_GroupParameters &groupParams, byte *derivedKey, size_t derivedLength, const Integer &agreedElement, const Integer &ephemeralPublicKey, const NameValuePairs &derivationParams) const { agreedElement.Encode(derivedKey, derivedLength); } size_t GetSymmetricKeyLength(size_t plainTextLength) const { return GetGroupParameters().GetModulus().ByteCount(); } size_t GetSymmetricCiphertextLength(size_t plainTextLength) const { unsigned int len = GetGroupParameters().GetModulus().ByteCount(); if (plainTextLength <= GetMaxSymmetricPlaintextLength(len)) return len; else return 0; } size_t GetMaxSymmetricPlaintextLength(size_t cipherTextLength) const { unsigned int len = GetGroupParameters().GetModulus().ByteCount(); if (cipherTextLength == len) return STDMIN(255U, len-3); else return 0; } void SymmetricEncrypt(RandomNumberGenerator &rng, const byte *key, const byte *plainText, size_t plainTextLength, byte *cipherText, const NameValuePairs ¶meters) const { const Integer &p = GetGroupParameters().GetModulus(); unsigned int modulusLen = p.ByteCount(); SecByteBlock block(modulusLen-1); rng.GenerateBlock(block, modulusLen-2-plainTextLength); memcpy(block+modulusLen-2-plainTextLength, plainText, plainTextLength); block[modulusLen-2] = (byte)plainTextLength; a_times_b_mod_c(Integer(key, modulusLen), Integer(block, modulusLen-1), p).Encode(cipherText, modulusLen); } DecodingResult SymmetricDecrypt(const byte *key, const byte *cipherText, size_t cipherTextLength, byte *plainText, const NameValuePairs ¶meters) const { const Integer &p = GetGroupParameters().GetModulus(); unsigned int modulusLen = p.ByteCount(); if (cipherTextLength != modulusLen) return DecodingResult(); Integer m = a_times_b_mod_c(Integer(cipherText, modulusLen), Integer(key, modulusLen).InverseMod(p), p); m.Encode(plainText, 1); unsigned int plainTextLength = plainText[0]; if (plainTextLength > GetMaxSymmetricPlaintextLength(modulusLen)) return DecodingResult(); m >>= 8; m.Encode(plainText, plainTextLength); return DecodingResult(plainTextLength); } virtual const DL_GroupParameters_GFP & GetGroupParameters() const =0; }; template class ElGamalObjectImpl : public DL_ObjectImplBase, public ElGamalBase { public: size_t FixedMaxPlaintextLength() const {return this->MaxPlaintextLength(FixedCiphertextLength());} size_t FixedCiphertextLength() const {return this->CiphertextLength(0);} const DL_GroupParameters_GFP & GetGroupParameters() const {return this->GetKey().GetGroupParameters();} DecodingResult FixedLengthDecrypt(RandomNumberGenerator &rng, const byte *cipherText, byte *plainText) const {return Decrypt(rng, cipherText, FixedCiphertextLength(), plainText);} protected: const DL_KeyAgreementAlgorithm & GetKeyAgreementAlgorithm() const {return *this;} const DL_KeyDerivationAlgorithm & GetKeyDerivationAlgorithm() const {return *this;} const DL_SymmetricEncryptionAlgorithm & GetSymmetricEncryptionAlgorithm() const {return *this;} }; struct ElGamalKeys { typedef DL_CryptoKeys_GFP::GroupParameters GroupParameters; typedef DL_PrivateKey_GFP_OldFormat PrivateKey; typedef DL_PublicKey_GFP_OldFormat PublicKey; }; //! ElGamal encryption scheme with non-standard padding struct ElGamal { typedef DL_CryptoSchemeOptions SchemeOptions; static const char * StaticAlgorithmName() {return "ElgamalEnc/Crypto++Padding";} typedef SchemeOptions::GroupParameters GroupParameters; //! implements PK_Encryptor interface typedef PK_FinalTemplate, SchemeOptions, SchemeOptions::PublicKey> > Encryptor; //! implements PK_Decryptor interface typedef PK_FinalTemplate, SchemeOptions, SchemeOptions::PrivateKey> > Decryptor; }; typedef ElGamal::Encryptor ElGamalEncryptor; typedef ElGamal::Decryptor ElGamalDecryptor; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/iterhash.cpp0000755000000000000000000001045312414772654020114 0ustar rootroot// iterhash.cpp - written and placed in the public domain by Wei Dai #ifndef __GNUC__ #define CRYPTOPP_MANUALLY_INSTANTIATE_TEMPLATES #endif #include "iterhash.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) template void IteratedHashBase::Update(const byte *input, size_t len) { HashWordType oldCountLo = m_countLo, oldCountHi = m_countHi; if ((m_countLo = oldCountLo + HashWordType(len)) < oldCountLo) m_countHi++; // carry from low to high m_countHi += (HashWordType)SafeRightShift<8*sizeof(HashWordType)>(len); if (m_countHi < oldCountHi || SafeRightShift<2*8*sizeof(HashWordType)>(len) != 0) throw HashInputTooLong(this->AlgorithmName()); unsigned int blockSize = this->BlockSize(); unsigned int num = ModPowerOf2(oldCountLo, blockSize); T* dataBuf = this->DataBuf(); byte* data = (byte *)dataBuf; if (num != 0) // process left over data { if (num+len >= blockSize) { memcpy(data+num, input, blockSize-num); HashBlock(dataBuf); input += (blockSize-num); len -= (blockSize-num); num = 0; // drop through and do the rest } else { memcpy(data+num, input, len); return; } } // now process the input data in blocks of blockSize bytes and save the leftovers to m_data if (len >= blockSize) { if (input == data) { assert(len == blockSize); HashBlock(dataBuf); return; } else if (IsAligned(input)) { size_t leftOver = HashMultipleBlocks((T *)input, len); input += (len - leftOver); len = leftOver; } else do { // copy input first if it's not aligned correctly memcpy(data, input, blockSize); HashBlock(dataBuf); input+=blockSize; len-=blockSize; } while (len >= blockSize); } if (len && data != input) memcpy(data, input, len); } template byte * IteratedHashBase::CreateUpdateSpace(size_t &size) { unsigned int blockSize = this->BlockSize(); unsigned int num = ModPowerOf2(m_countLo, blockSize); size = blockSize - num; return (byte *)DataBuf() + num; } template size_t IteratedHashBase::HashMultipleBlocks(const T *input, size_t length) { unsigned int blockSize = this->BlockSize(); bool noReverse = NativeByteOrderIs(this->GetByteOrder()); T* dataBuf = this->DataBuf(); do { if (noReverse) this->HashEndianCorrectedBlock(input); else { ByteReverse(dataBuf, input, this->BlockSize()); this->HashEndianCorrectedBlock(dataBuf); } input += blockSize/sizeof(T); length -= blockSize; } while (length >= blockSize); return length; } template void IteratedHashBase::PadLastBlock(unsigned int lastBlockSize, byte padFirst) { unsigned int blockSize = this->BlockSize(); unsigned int num = ModPowerOf2(m_countLo, blockSize); T* dataBuf = this->DataBuf(); byte* data = (byte *)dataBuf; data[num++] = padFirst; if (num <= lastBlockSize) memset(data+num, 0, lastBlockSize-num); else { memset(data+num, 0, blockSize-num); HashBlock(dataBuf); memset(data, 0, lastBlockSize); } } template void IteratedHashBase::Restart() { m_countLo = m_countHi = 0; Init(); } template void IteratedHashBase::TruncatedFinal(byte *digest, size_t size) { this->ThrowIfInvalidTruncatedSize(size); T* dataBuf = this->DataBuf(); T* stateBuf = this->StateBuf(); unsigned int blockSize = this->BlockSize(); ByteOrder order = this->GetByteOrder(); PadLastBlock(blockSize - 2*sizeof(HashWordType)); dataBuf[blockSize/sizeof(T)-2+order] = ConditionalByteReverse(order, this->GetBitCountLo()); dataBuf[blockSize/sizeof(T)-1-order] = ConditionalByteReverse(order, this->GetBitCountHi()); HashBlock(dataBuf); if (IsAligned(digest) && size%sizeof(HashWordType)==0) ConditionalByteReverse(order, (HashWordType *)digest, stateBuf, size); else { ConditionalByteReverse(order, stateBuf, stateBuf, this->DigestSize()); memcpy(digest, stateBuf, size); } this->Restart(); // reinit for next use } #ifdef __GNUC__ template class IteratedHashBase; template class IteratedHashBase; template class IteratedHashBase; template class IteratedHashBase; #endif NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/md2.h0000755000000000000000000000262412414772654016435 0ustar rootroot#ifndef CRYPTOPP_MD2_H #define CRYPTOPP_MD2_H #include "cryptlib.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) namespace Weak1 { /// MD2 class MD2 : public HashTransformation { public: MD2(); void Update(const byte *input, size_t length); void TruncatedFinal(byte *hash, size_t size); unsigned int DigestSize() const {return DIGESTSIZE;} unsigned int BlockSize() const {return BLOCKSIZE;} static const char * StaticAlgorithmName() {return "MD2";} CRYPTOPP_CONSTANT(DIGESTSIZE = 16) CRYPTOPP_CONSTANT(BLOCKSIZE = 16) private: void Transform(); void Init(); SecByteBlock m_X, m_C, m_buf; unsigned int m_count; }; } #if CRYPTOPP_ENABLE_NAMESPACE_WEAK >= 1 namespace Weak {using namespace Weak1;} // import Weak1 into CryptoPP::Weak #else using namespace Weak1; // import Weak1 into CryptoPP with warning #ifdef __GNUC__ #warning "You may be using a weak algorithm that has been retained for backwards compatibility. Please '#define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1' before including this .h file and prepend the class name with 'Weak::' to remove this warning." #else #pragma message("You may be using a weak algorithm that has been retained for backwards compatibility. Please '#define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1' before including this .h file and prepend the class name with 'Weak::' to remove this warning.") #endif #endif NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/pssr.cpp0000755000000000000000000001263212414772654017275 0ustar rootroot// pssr.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "pssr.h" #include NAMESPACE_BEGIN(CryptoPP) // more in dll.cpp template<> const byte EMSA2HashId::id = 0x31; template<> const byte EMSA2HashId::id = 0x32; template<> const byte EMSA2HashId::id = 0x37; #ifndef CRYPTOPP_IMPORTS size_t PSSR_MEM_Base::MinRepresentativeBitLength(size_t hashIdentifierLength, size_t digestLength) const { size_t saltLen = SaltLen(digestLength); size_t minPadLen = MinPadLen(digestLength); return 9 + 8*(minPadLen + saltLen + digestLength + hashIdentifierLength); } size_t PSSR_MEM_Base::MaxRecoverableLength(size_t representativeBitLength, size_t hashIdentifierLength, size_t digestLength) const { if (AllowRecovery()) return SaturatingSubtract(representativeBitLength, MinRepresentativeBitLength(hashIdentifierLength, digestLength)) / 8; return 0; } bool PSSR_MEM_Base::IsProbabilistic() const { return SaltLen(1) > 0; } bool PSSR_MEM_Base::AllowNonrecoverablePart() const { return true; } bool PSSR_MEM_Base::RecoverablePartFirst() const { return false; } void PSSR_MEM_Base::ComputeMessageRepresentative(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const { assert(representativeBitLength >= MinRepresentativeBitLength(hashIdentifier.second, hash.DigestSize())); const size_t u = hashIdentifier.second + 1; const size_t representativeByteLength = BitsToBytes(representativeBitLength); const size_t digestSize = hash.DigestSize(); const size_t saltSize = SaltLen(digestSize); byte *const h = representative + representativeByteLength - u - digestSize; SecByteBlock digest(digestSize), salt(saltSize); hash.Final(digest); rng.GenerateBlock(salt, saltSize); // compute H = hash of M' byte c[8]; PutWord(false, BIG_ENDIAN_ORDER, c, (word32)SafeRightShift<29>(recoverableMessageLength)); PutWord(false, BIG_ENDIAN_ORDER, c+4, word32(recoverableMessageLength << 3)); hash.Update(c, 8); hash.Update(recoverableMessage, recoverableMessageLength); hash.Update(digest, digestSize); hash.Update(salt, saltSize); hash.Final(h); // compute representative GetMGF().GenerateAndMask(hash, representative, representativeByteLength - u - digestSize, h, digestSize, false); byte *xorStart = representative + representativeByteLength - u - digestSize - salt.size() - recoverableMessageLength - 1; xorStart[0] ^= 1; xorbuf(xorStart + 1, recoverableMessage, recoverableMessageLength); xorbuf(xorStart + 1 + recoverableMessageLength, salt, salt.size()); memcpy(representative + representativeByteLength - u, hashIdentifier.first, hashIdentifier.second); representative[representativeByteLength - 1] = hashIdentifier.second ? 0xcc : 0xbc; if (representativeBitLength % 8 != 0) representative[0] = (byte)Crop(representative[0], representativeBitLength % 8); } DecodingResult PSSR_MEM_Base::RecoverMessageFromRepresentative( HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength, byte *recoverableMessage) const { assert(representativeBitLength >= MinRepresentativeBitLength(hashIdentifier.second, hash.DigestSize())); const size_t u = hashIdentifier.second + 1; const size_t representativeByteLength = BitsToBytes(representativeBitLength); const size_t digestSize = hash.DigestSize(); const size_t saltSize = SaltLen(digestSize); const byte *const h = representative + representativeByteLength - u - digestSize; SecByteBlock digest(digestSize); hash.Final(digest); DecodingResult result(0); bool &valid = result.isValidCoding; size_t &recoverableMessageLength = result.messageLength; valid = (representative[representativeByteLength - 1] == (hashIdentifier.second ? 0xcc : 0xbc)) && valid; valid = VerifyBufsEqual(representative + representativeByteLength - u, hashIdentifier.first, hashIdentifier.second) && valid; GetMGF().GenerateAndMask(hash, representative, representativeByteLength - u - digestSize, h, digestSize); if (representativeBitLength % 8 != 0) representative[0] = (byte)Crop(representative[0], representativeBitLength % 8); // extract salt and recoverableMessage from DB = 00 ... || 01 || M || salt byte *salt = representative + representativeByteLength - u - digestSize - saltSize; byte *M = std::find_if(representative, salt-1, std::bind2nd(std::not_equal_to(), 0)); recoverableMessageLength = salt-M-1; if (*M == 0x01 && (size_t)(M - representative - (representativeBitLength % 8 != 0)) >= MinPadLen(digestSize) && recoverableMessageLength <= MaxRecoverableLength(representativeBitLength, hashIdentifier.second, digestSize)) { memcpy(recoverableMessage, M+1, recoverableMessageLength); } else { recoverableMessageLength = 0; valid = false; } // verify H = hash of M' byte c[8]; PutWord(false, BIG_ENDIAN_ORDER, c, (word32)SafeRightShift<29>(recoverableMessageLength)); PutWord(false, BIG_ENDIAN_ORDER, c+4, word32(recoverableMessageLength << 3)); hash.Update(c, 8); hash.Update(recoverableMessage, recoverableMessageLength); hash.Update(digest, digestSize); hash.Update(salt, saltSize); valid = hash.Verify(h) && valid; if (!AllowRecovery() && valid && recoverableMessageLength != 0) {throw NotImplemented("PSSR_MEM: message recovery disabled");} return result; } #endif NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/square.h0000755000000000000000000000254412414772654017254 0ustar rootroot#ifndef CRYPTOPP_SQUARE_H #define CRYPTOPP_SQUARE_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct Square_Info : public FixedBlockSize<16>, public FixedKeyLength<16>, FixedRounds<8> { static const char *StaticAlgorithmName() {return "Square";} }; /// Square class Square : public Square_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); protected: FixedSizeSecBlock m_roundkeys; }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; private: static const byte Se[256]; static const word32 Te[4][256]; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; private: static const byte Sd[256]; static const word32 Td[4][256]; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef Square::Encryption SquareEncryption; typedef Square::Decryption SquareDecryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/eccrypto.cpp0000755000000000000000000007310412414772654020137 0ustar rootroot// eccrypto.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "eccrypto.h" #include "nbtheory.h" #include "oids.h" #include "hex.h" #include "argnames.h" #include "ec2n.h" NAMESPACE_BEGIN(CryptoPP) #if 0 static void ECDSA_TestInstantiations() { ECDSA::Signer t1; ECDSA::Verifier t2(t1); ECNR::Signer t3; ECNR::Verifier t4(t3); ECIES::Encryptor t5; ECIES::Decryptor t6; ECDH::Domain t7; ECMQV::Domain t8; } #endif // VC60 workaround: complains when these functions are put into an anonymous namespace static Integer ConvertToInteger(const PolynomialMod2 &x) { unsigned int l = x.ByteCount(); SecByteBlock temp(l); x.Encode(temp, l); return Integer(temp, l); } static inline Integer ConvertToInteger(const Integer &x) { return x; } static bool CheckMOVCondition(const Integer &q, const Integer &r) { // see "Updated standards for validating elliptic curves", http://eprint.iacr.org/2007/343 Integer t = 1; unsigned int n = q.IsEven() ? 1 : q.BitCount(), m = r.BitCount(); for (unsigned int i=n; DiscreteLogWorkFactor(i) struct EcRecommendedParameters; template<> struct EcRecommendedParameters { EcRecommendedParameters(const OID &oid, unsigned int t2, unsigned int t3, unsigned int t4, const char *a, const char *b, const char *g, const char *n, unsigned int h) : oid(oid), t0(0), t1(0), t2(t2), t3(t3), t4(t4), a(a), b(b), g(g), n(n), h(h) {} EcRecommendedParameters(const OID &oid, unsigned int t0, unsigned int t1, unsigned int t2, unsigned int t3, unsigned int t4, const char *a, const char *b, const char *g, const char *n, unsigned int h) : oid(oid), t0(t0), t1(t1), t2(t2), t3(t3), t4(t4), a(a), b(b), g(g), n(n), h(h) {} EC2N *NewEC() const { StringSource ssA(a, true, new HexDecoder); StringSource ssB(b, true, new HexDecoder); if (t0 == 0) return new EC2N(GF2NT(t2, t3, t4), EC2N::FieldElement(ssA, (size_t)ssA.MaxRetrievable()), EC2N::FieldElement(ssB, (size_t)ssB.MaxRetrievable())); else return new EC2N(GF2NPP(t0, t1, t2, t3, t4), EC2N::FieldElement(ssA, (size_t)ssA.MaxRetrievable()), EC2N::FieldElement(ssB, (size_t)ssB.MaxRetrievable())); }; OID oid; unsigned int t0, t1, t2, t3, t4; const char *a, *b, *g, *n; unsigned int h; }; template<> struct EcRecommendedParameters { EcRecommendedParameters(const OID &oid, const char *p, const char *a, const char *b, const char *g, const char *n, unsigned int h) : oid(oid), p(p), a(a), b(b), g(g), n(n), h(h) {} ECP *NewEC() const { StringSource ssP(p, true, new HexDecoder); StringSource ssA(a, true, new HexDecoder); StringSource ssB(b, true, new HexDecoder); return new ECP(Integer(ssP, (size_t)ssP.MaxRetrievable()), ECP::FieldElement(ssA, (size_t)ssA.MaxRetrievable()), ECP::FieldElement(ssB, (size_t)ssB.MaxRetrievable())); }; OID oid; const char *p; const char *a, *b, *g, *n; unsigned int h; }; struct OIDLessThan { template inline bool operator()(const EcRecommendedParameters& a, const OID& b) {return a.oid < b;} template inline bool operator()(const OID& a, const EcRecommendedParameters& b) {return a < b.oid;} template inline bool operator()(const EcRecommendedParameters& a, const EcRecommendedParameters& b) {return a.oid < b.oid;} }; static void GetRecommendedParameters(const EcRecommendedParameters *&begin, const EcRecommendedParameters *&end) { // this array must be sorted by OID static const EcRecommendedParameters rec[] = { EcRecommendedParameters(ASN1::sect163k1(), 163, 7, 6, 3, 0, "000000000000000000000000000000000000000001", "000000000000000000000000000000000000000001", "0402FE13C0537BBC11ACAA07D793DE4E6D5E5C94EEE80289070FB05D38FF58321F2E800536D538CCDAA3D9", "04000000000000000000020108A2E0CC0D99F8A5EF", 2), EcRecommendedParameters(ASN1::sect163r1(), 163, 7, 6, 3, 0, "07B6882CAAEFA84F9554FF8428BD88E246D2782AE2", "0713612DCDDCB40AAB946BDA29CA91F73AF958AFD9", "040369979697AB43897789566789567F787A7876A65400435EDB42EFAFB2989D51FEFCE3C80988F41FF883", "03FFFFFFFFFFFFFFFFFFFF48AAB689C29CA710279B", 2), EcRecommendedParameters(ASN1::sect239k1(), 239, 158, 0, "000000000000000000000000000000000000000000000000000000000000", "000000000000000000000000000000000000000000000000000000000001", "0429A0B6A887A983E9730988A68727A8B2D126C44CC2CC7B2A6555193035DC76310804F12E549BDB011C103089E73510ACB275FC312A5DC6B76553F0CA", "2000000000000000000000000000005A79FEC67CB6E91F1C1DA800E478A5", 4), EcRecommendedParameters(ASN1::sect113r1(), 113, 9, 0, "003088250CA6E7C7FE649CE85820F7", "00E8BEE4D3E2260744188BE0E9C723", "04009D73616F35F4AB1407D73562C10F00A52830277958EE84D1315ED31886", "0100000000000000D9CCEC8A39E56F", 2), EcRecommendedParameters(ASN1::sect113r2(), 113, 9, 0, "00689918DBEC7E5A0DD6DFC0AA55C7", "0095E9A9EC9B297BD4BF36E059184F", "0401A57A6A7B26CA5EF52FCDB816479700B3ADC94ED1FE674C06E695BABA1D", "010000000000000108789B2496AF93", 2), EcRecommendedParameters(ASN1::sect163r2(), 163, 7, 6, 3, 0, "000000000000000000000000000000000000000001", "020A601907B8C953CA1481EB10512F78744A3205FD", "0403F0EBA16286A2D57EA0991168D4994637E8343E3600D51FBC6C71A0094FA2CDD545B11C5C0C797324F1", "040000000000000000000292FE77E70C12A4234C33", 2), EcRecommendedParameters(ASN1::sect283k1(), 283, 12, 7, 5, 0, "000000000000000000000000000000000000000000000000000000000000000000000000", "000000000000000000000000000000000000000000000000000000000000000000000001", "040503213F78CA44883F1A3B8162F188E553CD265F23C1567A16876913B0C2AC245849283601CCDA380F1C9E318D90F95D07E5426FE87E45C0E8184698E45962364E34116177DD2259", "01FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFE9AE2ED07577265DFF7F94451E061E163C61", 4), EcRecommendedParameters(ASN1::sect283r1(), 283, 12, 7, 5, 0, "000000000000000000000000000000000000000000000000000000000000000000000001", "027B680AC8B8596DA5A4AF8A19A0303FCA97FD7645309FA2A581485AF6263E313B79A2F5", "0405F939258DB7DD90E1934F8C70B0DFEC2EED25B8557EAC9C80E2E198F8CDBECD86B1205303676854FE24141CB98FE6D4B20D02B4516FF702350EDDB0826779C813F0DF45BE8112F4", "03FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEF90399660FC938A90165B042A7CEFADB307", 2), EcRecommendedParameters(ASN1::sect131r1(), 131, 8, 3, 2, 0, "07A11B09A76B562144418FF3FF8C2570B8", "0217C05610884B63B9C6C7291678F9D341", "040081BAF91FDF9833C40F9C181343638399078C6E7EA38C001F73C8134B1B4EF9E150", "0400000000000000023123953A9464B54D", 2), EcRecommendedParameters(ASN1::sect131r2(), 131, 8, 3, 2, 0, "03E5A88919D7CAFCBF415F07C2176573B2", "04B8266A46C55657AC734CE38F018F2192", "040356DCD8F2F95031AD652D23951BB366A80648F06D867940A5366D9E265DE9EB240F", "0400000000000000016954A233049BA98F", 2), EcRecommendedParameters(ASN1::sect193r1(), 193, 15, 0, "0017858FEB7A98975169E171F77B4087DE098AC8A911DF7B01", "00FDFB49BFE6C3A89FACADAA7A1E5BBC7CC1C2E5D831478814", "0401F481BC5F0FF84A74AD6CDF6FDEF4BF6179625372D8C0C5E10025E399F2903712CCF3EA9E3A1AD17FB0B3201B6AF7CE1B05", "01000000000000000000000000C7F34A778F443ACC920EBA49", 2), EcRecommendedParameters(ASN1::sect193r2(), 193, 15, 0, "0163F35A5137C2CE3EA6ED8667190B0BC43ECD69977702709B", "00C9BB9E8927D4D64C377E2AB2856A5B16E3EFB7F61D4316AE", "0400D9B67D192E0367C803F39E1A7E82CA14A651350AAE617E8F01CE94335607C304AC29E7DEFBD9CA01F596F927224CDECF6C", "010000000000000000000000015AAB561B005413CCD4EE99D5", 2), EcRecommendedParameters(ASN1::sect233k1(), 233, 74, 0, "000000000000000000000000000000000000000000000000000000000000", "000000000000000000000000000000000000000000000000000000000001", "04017232BA853A7E731AF129F22FF4149563A419C26BF50A4C9D6EEFAD612601DB537DECE819B7F70F555A67C427A8CD9BF18AEB9B56E0C11056FAE6A3", "8000000000000000000000000000069D5BB915BCD46EFB1AD5F173ABDF", 4), EcRecommendedParameters(ASN1::sect233r1(), 233, 74, 0, "000000000000000000000000000000000000000000000000000000000001", "0066647EDE6C332C7F8C0923BB58213B333B20E9CE4281FE115F7D8F90AD", "0400FAC9DFCBAC8313BB2139F1BB755FEF65BC391F8B36F8F8EB7371FD558B01006A08A41903350678E58528BEBF8A0BEFF867A7CA36716F7E01F81052", "01000000000000000000000000000013E974E72F8A6922031D2603CFE0D7", 2), EcRecommendedParameters(ASN1::sect409k1(), 409, 87, 0, "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001", "040060F05F658F49C1AD3AB1890F7184210EFD0987E307C84C27ACCFB8F9F67CC2C460189EB5AAAA62EE222EB1B35540CFE902374601E369050B7C4E42ACBA1DACBF04299C3460782F918EA427E6325165E9EA10E3DA5F6C42E9C55215AA9CA27A5863EC48D8E0286B", "7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFE5F83B2D4EA20400EC4557D5ED3E3E7CA5B4B5C83B8E01E5FCF", 4), EcRecommendedParameters(ASN1::sect409r1(), 409, 87, 0, "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001", "0021A5C2C8EE9FEB5C4B9A753B7B476B7FD6422EF1F3DD674761FA99D6AC27C8A9A197B272822F6CD57A55AA4F50AE317B13545F", "04015D4860D088DDB3496B0C6064756260441CDE4AF1771D4DB01FFE5B34E59703DC255A868A1180515603AEAB60794E54BB7996A70061B1CFAB6BE5F32BBFA78324ED106A7636B9C5A7BD198D0158AA4F5488D08F38514F1FDF4B4F40D2181B3681C364BA0273C706", "010000000000000000000000000000000000000000000000000001E2AAD6A612F33307BE5FA47C3C9E052F838164CD37D9A21173", 2), EcRecommendedParameters(ASN1::sect571k1(), 571, 10, 5, 2, 0, "000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001", "04026EB7A859923FBC82189631F8103FE4AC9CA2970012D5D46024804801841CA44370958493B205E647DA304DB4CEB08CBBD1BA39494776FB988B47174DCA88C7E2945283A01C89720349DC807F4FBF374F4AEADE3BCA95314DD58CEC9F307A54FFC61EFC006D8A2C9D4979C0AC44AEA74FBEBBB9F772AEDCB620B01A7BA7AF1B320430C8591984F601CD4C143EF1C7A3", "020000000000000000000000000000000000000000000000000000000000000000000000131850E1F19A63E4B391A8DB917F4138B630D84BE5D639381E91DEB45CFE778F637C1001", 4), EcRecommendedParameters(ASN1::sect571r1(), 571, 10, 5, 2, 0, "000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001", "02F40E7E2221F295DE297117B7F3D62F5C6A97FFCB8CEFF1CD6BA8CE4A9A18AD84FFABBD8EFA59332BE7AD6756A66E294AFD185A78FF12AA520E4DE739BACA0C7FFEFF7F2955727A", "040303001D34B856296C16C0D40D3CD7750A93D1D2955FA80AA5F40FC8DB7B2ABDBDE53950F4C0D293CDD711A35B67FB1499AE60038614F1394ABFA3B4C850D927E1E7769C8EEC2D19037BF27342DA639B6DCCFFFEB73D69D78C6C27A6009CBBCA1980F8533921E8A684423E43BAB08A576291AF8F461BB2A8B3531D2F0485C19B16E2F1516E23DD3C1A4827AF1B8AC15B", "03FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFE661CE18FF55987308059B186823851EC7DD9CA1161DE93D5174D66E8382E9BB2FE84E47", 2), }; begin = rec; end = rec + sizeof(rec)/sizeof(rec[0]); } static void GetRecommendedParameters(const EcRecommendedParameters *&begin, const EcRecommendedParameters *&end) { // this array must be sorted by OID static const EcRecommendedParameters rec[] = { EcRecommendedParameters(ASN1::secp192r1(), "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFF", "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFC", "64210519E59C80E70FA7E9AB72243049FEB8DEECC146B9B1", "04188DA80EB03090F67CBF20EB43A18800F4FF0AFD82FF101207192B95FFC8DA78631011ED6B24CDD573F977A11E794811", "FFFFFFFFFFFFFFFFFFFFFFFF99DEF836146BC9B1B4D22831", 1), EcRecommendedParameters(ASN1::secp256r1(), "FFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFF", "FFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFC", "5AC635D8AA3A93E7B3EBBD55769886BC651D06B0CC53B0F63BCE3C3E27D2604B", "046B17D1F2E12C4247F8BCE6E563A440F277037D812DEB33A0F4A13945D898C2964FE342E2FE1A7F9B8EE7EB4A7C0F9E162BCE33576B315ECECBB6406837BF51F5", "FFFFFFFF00000000FFFFFFFFFFFFFFFFBCE6FAADA7179E84F3B9CAC2FC632551", 1), EcRecommendedParameters(ASN1::brainpoolP160r1(), "E95E4A5F737059DC60DFC7AD95B3D8139515620F", "340E7BE2A280EB74E2BE61BADA745D97E8F7C300", "1E589A8595423412134FAA2DBDEC95C8D8675E58", "04BED5AF16EA3F6A4F62938C4631EB5AF7BDBCDBC31667CB477A1A8EC338F94741669C976316DA6321", "E95E4A5F737059DC60DF5991D45029409E60FC09", 1), EcRecommendedParameters(ASN1::brainpoolP192r1(), "C302F41D932A36CDA7A3463093D18DB78FCE476DE1A86297", "6A91174076B1E0E19C39C031FE8685C1CAE040E5C69A28EF", "469A28EF7C28CCA3DC721D044F4496BCCA7EF4146FBF25C9", "04C0A0647EAAB6A48753B033C56CB0F0900A2F5C4853375FD614B690866ABD5BB88B5F4828C1490002E6773FA2FA299B8F", "C302F41D932A36CDA7A3462F9E9E916B5BE8F1029AC4ACC1", 1), EcRecommendedParameters(ASN1::brainpoolP224r1(), "D7C134AA264366862A18302575D1D787B09F075797DA89F57EC8C0FF", "68A5E62CA9CE6C1C299803A6C1530B514E182AD8B0042A59CAD29F43", "2580F63CCFE44138870713B1A92369E33E2135D266DBB372386C400B", "040D9029AD2C7E5CF4340823B2A87DC68C9E4CE3174C1E6EFDEE12C07D58AA56F772C0726F24C6B89E4ECDAC24354B9E99CAA3F6D3761402CD", "D7C134AA264366862A18302575D0FB98D116BC4B6DDEBCA3A5A7939F", 1), EcRecommendedParameters(ASN1::brainpoolP256r1(), "A9FB57DBA1EEA9BC3E660A909D838D726E3BF623D52620282013481D1F6E5377", "7D5A0975FC2C3057EEF67530417AFFE7FB8055C126DC5C6CE94A4B44F330B5D9", "26DC5C6CE94A4B44F330B5D9BBD77CBF958416295CF7E1CE6BCCDC18FF8C07B6", "048BD2AEB9CB7E57CB2C4B482FFC81B7AFB9DE27E1E3BD23C23A4453BD9ACE3262547EF835C3DAC4FD97F8461A14611DC9C27745132DED8E545C1D54C72F046997", "A9FB57DBA1EEA9BC3E660A909D838D718C397AA3B561A6F7901E0E82974856A7", 1), EcRecommendedParameters(ASN1::brainpoolP320r1(), "D35E472036BC4FB7E13C785ED201E065F98FCFA6F6F40DEF4F92B9EC7893EC28FCD412B1F1B32E27", "3EE30B568FBAB0F883CCEBD46D3F3BB8A2A73513F5EB79DA66190EB085FFA9F492F375A97D860EB4", "520883949DFDBC42D3AD198640688A6FE13F41349554B49ACC31DCCD884539816F5EB4AC8FB1F1A6", "0443BD7E9AFB53D8B85289BCC48EE5BFE6F20137D10A087EB6E7871E2A10A599C710AF8D0D39E2061114FDD05545EC1CC8AB4093247F77275E0743FFED117182EAA9C77877AAAC6AC7D35245D1692E8EE1", "D35E472036BC4FB7E13C785ED201E065F98FCFA5B68F12A32D482EC7EE8658E98691555B44C59311", 1), EcRecommendedParameters(ASN1::brainpoolP384r1(), "8CB91E82A3386D280F5D6F7E50E641DF152F7109ED5456B412B1DA197FB71123ACD3A729901D1A71874700133107EC53", "7BC382C63D8C150C3C72080ACE05AFA0C2BEA28E4FB22787139165EFBA91F90F8AA5814A503AD4EB04A8C7DD22CE2826", "04A8C7DD22CE28268B39B55416F0447C2FB77DE107DCD2A62E880EA53EEB62D57CB4390295DBC9943AB78696FA504C11", "041D1C64F068CF45FFA2A63A81B7C13F6B8847A3E77EF14FE3DB7FCAFE0CBD10E8E826E03436D646AAEF87B2E247D4AF1E8ABE1D7520F9C2A45CB1EB8E95CFD55262B70B29FEEC5864E19C054FF99129280E4646217791811142820341263C5315", "8CB91E82A3386D280F5D6F7E50E641DF152F7109ED5456B31F166E6CAC0425A7CF3AB6AF6B7FC3103B883202E9046565", 1), EcRecommendedParameters(ASN1::brainpoolP512r1(), "AADD9DB8DBE9C48B3FD4E6AE33C9FC07CB308DB3B3C9D20ED6639CCA703308717D4D9B009BC66842AECDA12AE6A380E62881FF2F2D82C68528AA6056583A48F3", "7830A3318B603B89E2327145AC234CC594CBDD8D3DF91610A83441CAEA9863BC2DED5D5AA8253AA10A2EF1C98B9AC8B57F1117A72BF2C7B9E7C1AC4D77FC94CA", "3DF91610A83441CAEA9863BC2DED5D5AA8253AA10A2EF1C98B9AC8B57F1117A72BF2C7B9E7C1AC4D77FC94CADC083E67984050B75EBAE5DD2809BD638016F723", "0481AEE4BDD82ED9645A21322E9C4C6A9385ED9F70B5D916C1B43B62EEF4D0098EFF3B1F78E2D0D48D50D1687B93B97D5F7C6D5047406A5E688B352209BCB9F8227DDE385D566332ECC0EABFA9CF7822FDF209F70024A57B1AA000C55B881F8111B2DCDE494A5F485E5BCA4BD88A2763AED1CA2B2FA8F0540678CD1E0F3AD80892", "AADD9DB8DBE9C48B3FD4E6AE33C9FC07CB308DB3B3C9D20ED6639CCA70330870553E5C414CA92619418661197FAC10471DB1D381085DDADDB58796829CA90069", 1), EcRecommendedParameters(ASN1::secp112r1(), "DB7C2ABF62E35E668076BEAD208B", "DB7C2ABF62E35E668076BEAD2088", "659EF8BA043916EEDE8911702B22", "0409487239995A5EE76B55F9C2F098A89CE5AF8724C0A23E0E0FF77500", "DB7C2ABF62E35E7628DFAC6561C5", 1), EcRecommendedParameters(ASN1::secp112r2(), "DB7C2ABF62E35E668076BEAD208B", "6127C24C05F38A0AAAF65C0EF02C", "51DEF1815DB5ED74FCC34C85D709", "044BA30AB5E892B4E1649DD0928643ADCD46F5882E3747DEF36E956E97", "36DF0AAFD8B8D7597CA10520D04B", 4), EcRecommendedParameters(ASN1::secp160r1(), "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF7FFFFFFF", "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF7FFFFFFC", "1C97BEFC54BD7A8B65ACF89F81D4D4ADC565FA45", "044A96B5688EF573284664698968C38BB913CBFC8223A628553168947D59DCC912042351377AC5FB32", "0100000000000000000001F4C8F927AED3CA752257", 1), EcRecommendedParameters(ASN1::secp160k1(), "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC73", "0000000000000000000000000000000000000000", "0000000000000000000000000000000000000007", "043B4C382CE37AA192A4019E763036F4F5DD4D7EBB938CF935318FDCED6BC28286531733C3F03C4FEE", "0100000000000000000001B8FA16DFAB9ACA16B6B3", 1), EcRecommendedParameters(ASN1::secp256k1(), "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F", "0000000000000000000000000000000000000000000000000000000000000000", "0000000000000000000000000000000000000000000000000000000000000007", "0479BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8", "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141", 1), EcRecommendedParameters(ASN1::secp128r1(), "FFFFFFFDFFFFFFFFFFFFFFFFFFFFFFFF", "FFFFFFFDFFFFFFFFFFFFFFFFFFFFFFFC", "E87579C11079F43DD824993C2CEE5ED3", "04161FF7528B899B2D0C28607CA52C5B86CF5AC8395BAFEB13C02DA292DDED7A83", "FFFFFFFE0000000075A30D1B9038A115", 1), EcRecommendedParameters(ASN1::secp128r2(), "FFFFFFFDFFFFFFFFFFFFFFFFFFFFFFFF", "D6031998D1B3BBFEBF59CC9BBFF9AEE1", "5EEEFCA380D02919DC2C6558BB6D8A5D", "047B6AA5D85E572983E6FB32A7CDEBC14027B6916A894D3AEE7106FE805FC34B44", "3FFFFFFF7FFFFFFFBE0024720613B5A3", 4), EcRecommendedParameters(ASN1::secp160r2(), "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC73", "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFAC70", "B4E134D3FB59EB8BAB57274904664D5AF50388BA", "0452DCB034293A117E1F4FF11B30F7199D3144CE6DFEAFFEF2E331F296E071FA0DF9982CFEA7D43F2E", "0100000000000000000000351EE786A818F3A1A16B", 1), EcRecommendedParameters(ASN1::secp192k1(), "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFEE37", "000000000000000000000000000000000000000000000000", "000000000000000000000000000000000000000000000003", "04DB4FF10EC057E9AE26B07D0280B7F4341DA5D1B1EAE06C7D9B2F2F6D9C5628A7844163D015BE86344082AA88D95E2F9D", "FFFFFFFFFFFFFFFFFFFFFFFE26F2FC170F69466A74DEFD8D", 1), EcRecommendedParameters(ASN1::secp224k1(), "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFE56D", "00000000000000000000000000000000000000000000000000000000", "00000000000000000000000000000000000000000000000000000005", "04A1455B334DF099DF30FC28A169A467E9E47075A90F7E650EB6B7A45C7E089FED7FBA344282CAFBD6F7E319F7C0B0BD59E2CA4BDB556D61A5", "010000000000000000000000000001DCE8D2EC6184CAF0A971769FB1F7", 1), EcRecommendedParameters(ASN1::secp224r1(), "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF000000000000000000000001", "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFE", "B4050A850C04B3ABF54132565044B0B7D7BFD8BA270B39432355FFB4", "04B70E0CBD6BB4BF7F321390B94A03C1D356C21122343280D6115C1D21BD376388B5F723FB4C22DFE6CD4375A05A07476444D5819985007E34", "FFFFFFFFFFFFFFFFFFFFFFFFFFFF16A2E0B8F03E13DD29455C5C2A3D", 1), EcRecommendedParameters(ASN1::secp384r1(), "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFF", "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFC", "B3312FA7E23EE7E4988E056BE3F82D19181D9C6EFE8141120314088F5013875AC656398D8A2ED19D2A85C8EDD3EC2AEF", "04AA87CA22BE8B05378EB1C71EF320AD746E1D3B628BA79B9859F741E082542A385502F25DBF55296C3A545E3872760AB73617DE4A96262C6F5D9E98BF9292DC29F8F41DBD289A147CE9DA3113B5F0B8C00A60B1CE1D7E819D7A431D7C90EA0E5F", "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFC7634D81F4372DDF581A0DB248B0A77AECEC196ACCC52973", 1), EcRecommendedParameters(ASN1::secp521r1(), "01FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", "01FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFC", "0051953EB9618E1C9A1F929A21A0B68540EEA2DA725B99B315F3B8B489918EF109E156193951EC7E937B1652C0BD3BB1BF073573DF883D2C34F1EF451FD46B503F00", "0400C6858E06B70404E9CD9E3ECB662395B4429C648139053FB521F828AF606B4D3DBAA14B5E77EFE75928FE1DC127A2FFA8DE3348B3C1856A429BF97E7E31C2E5BD66011839296A789A3BC0045C8A5FB42C7D1BD998F54449579B446817AFBD17273E662C97EE72995EF42640C550B9013FAD0761353C7086A272C24088BE94769FD16650", "01FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFA51868783BF2F966B7FCC0148F709A5D03BB5C9B8899C47AEBB6FB71E91386409", 1), }; begin = rec; end = rec + sizeof(rec)/sizeof(rec[0]); } template OID DL_GroupParameters_EC::GetNextRecommendedParametersOID(const OID &oid) { const EcRecommendedParameters *begin, *end; GetRecommendedParameters(begin, end); const EcRecommendedParameters *it = std::upper_bound(begin, end, oid, OIDLessThan()); return (it == end ? OID() : it->oid); } template void DL_GroupParameters_EC::Initialize(const OID &oid) { const EcRecommendedParameters *begin, *end; GetRecommendedParameters(begin, end); const EcRecommendedParameters *it = std::lower_bound(begin, end, oid, OIDLessThan()); if (it == end || it->oid != oid) throw UnknownOID(); const EcRecommendedParameters ¶m = *it; m_oid = oid; std::auto_ptr ec(param.NewEC()); this->m_groupPrecomputation.SetCurve(*ec); StringSource ssG(param.g, true, new HexDecoder); Element G; bool result = GetCurve().DecodePoint(G, ssG, (size_t)ssG.MaxRetrievable()); this->SetSubgroupGenerator(G); assert(result); StringSource ssN(param.n, true, new HexDecoder); m_n.Decode(ssN, (size_t)ssN.MaxRetrievable()); m_k = param.h; } template bool DL_GroupParameters_EC::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { if (strcmp(name, Name::GroupOID()) == 0) { if (m_oid.m_values.empty()) return false; this->ThrowIfTypeMismatch(name, typeid(OID), valueType); *reinterpret_cast(pValue) = m_oid; return true; } else return GetValueHelper >(this, name, valueType, pValue).Assignable() CRYPTOPP_GET_FUNCTION_ENTRY(Curve); } template void DL_GroupParameters_EC::AssignFrom(const NameValuePairs &source) { OID oid; if (source.GetValue(Name::GroupOID(), oid)) Initialize(oid); else { EllipticCurve ec; Point G; Integer n; source.GetRequiredParameter("DL_GroupParameters_EC", Name::Curve(), ec); source.GetRequiredParameter("DL_GroupParameters_EC", Name::SubgroupGenerator(), G); source.GetRequiredParameter("DL_GroupParameters_EC", Name::SubgroupOrder(), n); Integer k = source.GetValueWithDefault(Name::Cofactor(), Integer::Zero()); Initialize(ec, G, n, k); } } template void DL_GroupParameters_EC::GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg) { try { AssignFrom(alg); } catch (InvalidArgument &) { throw NotImplemented("DL_GroupParameters_EC: curve generation is not implemented yet"); } } template void DL_GroupParameters_EC::BERDecode(BufferedTransformation &bt) { byte b; if (!bt.Peek(b)) BERDecodeError(); if (b == OBJECT_IDENTIFIER) Initialize(OID(bt)); else { BERSequenceDecoder seq(bt); word32 version; BERDecodeUnsigned(seq, version, INTEGER, 1, 1); // check version EllipticCurve ec(seq); Point G = ec.BERDecodePoint(seq); Integer n(seq); Integer k; bool cofactorPresent = !seq.EndReached(); if (cofactorPresent) k.BERDecode(seq); else k = Integer::Zero(); seq.MessageEnd(); Initialize(ec, G, n, k); } } template void DL_GroupParameters_EC::DEREncode(BufferedTransformation &bt) const { if (m_encodeAsOID && !m_oid.m_values.empty()) m_oid.DEREncode(bt); else { DERSequenceEncoder seq(bt); DEREncodeUnsigned(seq, 1); // version GetCurve().DEREncode(seq); GetCurve().DEREncodePoint(seq, this->GetSubgroupGenerator(), m_compress); m_n.DEREncode(seq); if (m_k.NotZero()) m_k.DEREncode(seq); seq.MessageEnd(); } } template Integer DL_GroupParameters_EC::GetCofactor() const { if (!m_k) { Integer q = GetCurve().FieldSize(); Integer qSqrt = q.SquareRoot(); m_k = (q+2*qSqrt+1)/m_n; } return m_k; } template Integer DL_GroupParameters_EC::ConvertElementToInteger(const Element &element) const { return ConvertToInteger(element.x); }; template bool DL_GroupParameters_EC::ValidateGroup(RandomNumberGenerator &rng, unsigned int level) const { bool pass = GetCurve().ValidateParameters(rng, level); Integer q = GetCurve().FieldSize(); pass = pass && m_n!=q; if (level >= 2) { Integer qSqrt = q.SquareRoot(); pass = pass && m_n>4*qSqrt; pass = pass && VerifyPrime(rng, m_n, level-2); pass = pass && (m_k.IsZero() || m_k == (q+2*qSqrt+1)/m_n); pass = pass && CheckMOVCondition(q, m_n); } return pass; } template bool DL_GroupParameters_EC::ValidateElement(unsigned int level, const Element &g, const DL_FixedBasePrecomputation *gpc) const { bool pass = !IsIdentity(g) && GetCurve().VerifyPoint(g); if (level >= 1) { if (gpc) pass = pass && gpc->Exponentiate(this->GetGroupPrecomputation(), Integer::One()) == g; } if (level >= 2 && pass) { const Integer &q = GetSubgroupOrder(); Element gq = gpc ? gpc->Exponentiate(this->GetGroupPrecomputation(), q) : this->ExponentiateElement(g, q); pass = pass && IsIdentity(gq); } return pass; } template void DL_GroupParameters_EC::SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const { GetCurve().SimultaneousMultiply(results, base, exponents, exponentsCount); } template CPP_TYPENAME DL_GroupParameters_EC::Element DL_GroupParameters_EC::MultiplyElements(const Element &a, const Element &b) const { return GetCurve().Add(a, b); } template CPP_TYPENAME DL_GroupParameters_EC::Element DL_GroupParameters_EC::CascadeExponentiate(const Element &element1, const Integer &exponent1, const Element &element2, const Integer &exponent2) const { return GetCurve().CascadeMultiply(exponent1, element1, exponent2, element2); } template OID DL_GroupParameters_EC::GetAlgorithmID() const { return ASN1::id_ecPublicKey(); } // ****************************************************************** template void DL_PublicKey_EC::BERDecodePublicKey(BufferedTransformation &bt, bool parametersPresent, size_t size) { typename EC::Point P; if (!this->GetGroupParameters().GetCurve().DecodePoint(P, bt, size)) BERDecodeError(); this->SetPublicElement(P); } template void DL_PublicKey_EC::DEREncodePublicKey(BufferedTransformation &bt) const { this->GetGroupParameters().GetCurve().EncodePoint(bt, this->GetPublicElement(), this->GetGroupParameters().GetPointCompression()); } // ****************************************************************** template void DL_PrivateKey_EC::BERDecodePrivateKey(BufferedTransformation &bt, bool parametersPresent, size_t size) { BERSequenceDecoder seq(bt); word32 version; BERDecodeUnsigned(seq, version, INTEGER, 1, 1); // check version BERGeneralDecoder dec(seq, OCTET_STRING); if (!dec.IsDefiniteLength()) BERDecodeError(); Integer x; x.Decode(dec, (size_t)dec.RemainingLength()); dec.MessageEnd(); if (!parametersPresent && seq.PeekByte() != (CONTEXT_SPECIFIC | CONSTRUCTED | 0)) BERDecodeError(); if (!seq.EndReached() && seq.PeekByte() == (CONTEXT_SPECIFIC | CONSTRUCTED | 0)) { BERGeneralDecoder parameters(seq, CONTEXT_SPECIFIC | CONSTRUCTED | 0); this->AccessGroupParameters().BERDecode(parameters); parameters.MessageEnd(); } if (!seq.EndReached()) { // skip over the public element SecByteBlock subjectPublicKey; unsigned int unusedBits; BERGeneralDecoder publicKey(seq, CONTEXT_SPECIFIC | CONSTRUCTED | 1); BERDecodeBitString(publicKey, subjectPublicKey, unusedBits); publicKey.MessageEnd(); Element Q; if (!(unusedBits == 0 && this->GetGroupParameters().GetCurve().DecodePoint(Q, subjectPublicKey, subjectPublicKey.size()))) BERDecodeError(); } seq.MessageEnd(); this->SetPrivateExponent(x); } template void DL_PrivateKey_EC::DEREncodePrivateKey(BufferedTransformation &bt) const { DERSequenceEncoder privateKey(bt); DEREncodeUnsigned(privateKey, 1); // version // SEC 1 ver 1.0 says privateKey (m_d) has the same length as order of the curve // this will be changed to order of base point in a future version this->GetPrivateExponent().DEREncodeAsOctetString(privateKey, this->GetGroupParameters().GetSubgroupOrder().ByteCount()); privateKey.MessageEnd(); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/rabin.cpp0000755000000000000000000001273612414772654017406 0ustar rootroot// rabin.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "rabin.h" #include "nbtheory.h" #include "asn.h" #include "sha.h" #include "modarith.h" NAMESPACE_BEGIN(CryptoPP) void RabinFunction::BERDecode(BufferedTransformation &bt) { BERSequenceDecoder seq(bt); m_n.BERDecode(seq); m_r.BERDecode(seq); m_s.BERDecode(seq); seq.MessageEnd(); } void RabinFunction::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); m_n.DEREncode(seq); m_r.DEREncode(seq); m_s.DEREncode(seq); seq.MessageEnd(); } Integer RabinFunction::ApplyFunction(const Integer &in) const { DoQuickSanityCheck(); Integer out = in.Squared()%m_n; if (in.IsOdd()) out = out*m_r%m_n; if (Jacobi(in, m_n)==-1) out = out*m_s%m_n; return out; } bool RabinFunction::Validate(RandomNumberGenerator &rng, unsigned int level) const { bool pass = true; pass = pass && m_n > Integer::One() && m_n%4 == 1; pass = pass && m_r > Integer::One() && m_r < m_n; pass = pass && m_s > Integer::One() && m_s < m_n; if (level >= 1) pass = pass && Jacobi(m_r, m_n) == -1 && Jacobi(m_s, m_n) == -1; return pass; } bool RabinFunction::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue).Assignable() CRYPTOPP_GET_FUNCTION_ENTRY(Modulus) CRYPTOPP_GET_FUNCTION_ENTRY(QuadraticResidueModPrime1) CRYPTOPP_GET_FUNCTION_ENTRY(QuadraticResidueModPrime2) ; } void RabinFunction::AssignFrom(const NameValuePairs &source) { AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY(Modulus) CRYPTOPP_SET_FUNCTION_ENTRY(QuadraticResidueModPrime1) CRYPTOPP_SET_FUNCTION_ENTRY(QuadraticResidueModPrime2) ; } // ***************************************************************************** // private key operations: // generate a random private key void InvertibleRabinFunction::GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg) { int modulusSize = 2048; alg.GetIntValue("ModulusSize", modulusSize) || alg.GetIntValue("KeySize", modulusSize); if (modulusSize < 16) throw InvalidArgument("InvertibleRabinFunction: specified modulus size is too small"); // VC70 workaround: putting these after primeParam causes overlapped stack allocation bool rFound=false, sFound=false; Integer t=2; AlgorithmParameters primeParam = MakeParametersForTwoPrimesOfEqualSize(modulusSize) ("EquivalentTo", 3)("Mod", 4); m_p.GenerateRandom(rng, primeParam); m_q.GenerateRandom(rng, primeParam); while (!(rFound && sFound)) { int jp = Jacobi(t, m_p); int jq = Jacobi(t, m_q); if (!rFound && jp==1 && jq==-1) { m_r = t; rFound = true; } if (!sFound && jp==-1 && jq==1) { m_s = t; sFound = true; } ++t; } m_n = m_p * m_q; m_u = m_q.InverseMod(m_p); } void InvertibleRabinFunction::BERDecode(BufferedTransformation &bt) { BERSequenceDecoder seq(bt); m_n.BERDecode(seq); m_r.BERDecode(seq); m_s.BERDecode(seq); m_p.BERDecode(seq); m_q.BERDecode(seq); m_u.BERDecode(seq); seq.MessageEnd(); } void InvertibleRabinFunction::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); m_n.DEREncode(seq); m_r.DEREncode(seq); m_s.DEREncode(seq); m_p.DEREncode(seq); m_q.DEREncode(seq); m_u.DEREncode(seq); seq.MessageEnd(); } Integer InvertibleRabinFunction::CalculateInverse(RandomNumberGenerator &rng, const Integer &in) const { DoQuickSanityCheck(); ModularArithmetic modn(m_n); Integer r(rng, Integer::One(), m_n - Integer::One()); r = modn.Square(r); Integer r2 = modn.Square(r); Integer c = modn.Multiply(in, r2); // blind Integer cp=c%m_p, cq=c%m_q; int jp = Jacobi(cp, m_p); int jq = Jacobi(cq, m_q); if (jq==-1) { cp = cp*EuclideanMultiplicativeInverse(m_r, m_p)%m_p; cq = cq*EuclideanMultiplicativeInverse(m_r, m_q)%m_q; } if (jp==-1) { cp = cp*EuclideanMultiplicativeInverse(m_s, m_p)%m_p; cq = cq*EuclideanMultiplicativeInverse(m_s, m_q)%m_q; } cp = ModularSquareRoot(cp, m_p); cq = ModularSquareRoot(cq, m_q); if (jp==-1) cp = m_p-cp; Integer out = CRT(cq, m_q, cp, m_p, m_u); out = modn.Divide(out, r); // unblind if ((jq==-1 && out.IsEven()) || (jq==1 && out.IsOdd())) out = m_n-out; return out; } bool InvertibleRabinFunction::Validate(RandomNumberGenerator &rng, unsigned int level) const { bool pass = RabinFunction::Validate(rng, level); pass = pass && m_p > Integer::One() && m_p%4 == 3 && m_p < m_n; pass = pass && m_q > Integer::One() && m_q%4 == 3 && m_q < m_n; pass = pass && m_u.IsPositive() && m_u < m_p; if (level >= 1) { pass = pass && m_p * m_q == m_n; pass = pass && m_u * m_q % m_p == 1; pass = pass && Jacobi(m_r, m_p) == 1; pass = pass && Jacobi(m_r, m_q) == -1; pass = pass && Jacobi(m_s, m_p) == -1; pass = pass && Jacobi(m_s, m_q) == 1; } if (level >= 2) pass = pass && VerifyPrime(rng, m_p, level-2) && VerifyPrime(rng, m_q, level-2); return pass; } bool InvertibleRabinFunction::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue).Assignable() CRYPTOPP_GET_FUNCTION_ENTRY(Prime1) CRYPTOPP_GET_FUNCTION_ENTRY(Prime2) CRYPTOPP_GET_FUNCTION_ENTRY(MultiplicativeInverseOfPrime2ModPrime1) ; } void InvertibleRabinFunction::AssignFrom(const NameValuePairs &source) { AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY(Prime1) CRYPTOPP_SET_FUNCTION_ENTRY(Prime2) CRYPTOPP_SET_FUNCTION_ENTRY(MultiplicativeInverseOfPrime2ModPrime1) ; } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/seal.cpp0000755000000000000000000001032312414772654017225 0ustar rootroot// seal.cpp - written and placed in the public domain by Wei Dai // updated to SEAL 3.0 by Leonard Janke #include "pch.h" #include "seal.h" #include "sha.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) void SEAL_TestInstantiations() { SEAL<>::Encryption x; } struct SEAL_Gamma { SEAL_Gamma(const byte *key) : H(5), Z(5), D(16), lastIndex(0xffffffff) { GetUserKey(BIG_ENDIAN_ORDER, H.begin(), 5, key, 20); memset(D, 0, 64); } word32 Apply(word32 i); SecBlock H, Z, D; word32 lastIndex; }; word32 SEAL_Gamma::Apply(word32 i) { word32 shaIndex = i/5; if (shaIndex != lastIndex) { memcpy(Z, H, 20); D[0] = shaIndex; SHA::Transform(Z, D); lastIndex = shaIndex; } return Z[i%5]; } template void SEAL_Policy::CipherSetKey(const NameValuePairs ¶ms, const byte *key, size_t length) { m_insideCounter = m_outsideCounter = m_startCount = 0; unsigned int L = params.GetIntValueWithDefault("NumberOfOutputBitsPerPositionIndex", 32*1024); m_iterationsPerCount = L / 8192; SEAL_Gamma gamma(key); unsigned int i; for (i=0; i<512; i++) m_T[i] = gamma.Apply(i); for (i=0; i<256; i++) m_S[i] = gamma.Apply(0x1000+i); m_R.New(4*(L/8192)); for (i=0; i void SEAL_Policy::CipherResynchronize(byte *keystreamBuffer, const byte *IV, size_t length) { assert(length==4); m_outsideCounter = IV ? GetWord(false, BIG_ENDIAN_ORDER, IV) : 0; m_startCount = m_outsideCounter; m_insideCounter = 0; } template void SEAL_Policy::SeekToIteration(lword iterationCount) { m_outsideCounter = m_startCount + (unsigned int)(iterationCount / m_iterationsPerCount); m_insideCounter = (unsigned int)(iterationCount % m_iterationsPerCount); } template void SEAL_Policy::OperateKeystream(KeystreamOperation operation, byte *output, const byte *input, size_t iterationCount) { word32 a, b, c, d, n1, n2, n3, n4; unsigned int p, q; for (size_t iteration = 0; iteration < iterationCount; ++iteration) { #define Ttab(x) *(word32 *)((byte *)m_T.begin()+x) a = m_outsideCounter ^ m_R[4*m_insideCounter]; b = rotrFixed(m_outsideCounter, 8U) ^ m_R[4*m_insideCounter+1]; c = rotrFixed(m_outsideCounter, 16U) ^ m_R[4*m_insideCounter+2]; d = rotrFixed(m_outsideCounter, 24U) ^ m_R[4*m_insideCounter+3]; for (unsigned int j=0; j<2; j++) { p = a & 0x7fc; b += Ttab(p); a = rotrFixed(a, 9U); p = b & 0x7fc; c += Ttab(p); b = rotrFixed(b, 9U); p = c & 0x7fc; d += Ttab(p); c = rotrFixed(c, 9U); p = d & 0x7fc; a += Ttab(p); d = rotrFixed(d, 9U); } n1 = d, n2 = b, n3 = a, n4 = c; p = a & 0x7fc; b += Ttab(p); a = rotrFixed(a, 9U); p = b & 0x7fc; c += Ttab(p); b = rotrFixed(b, 9U); p = c & 0x7fc; d += Ttab(p); c = rotrFixed(c, 9U); p = d & 0x7fc; a += Ttab(p); d = rotrFixed(d, 9U); // generate 8192 bits for (unsigned int i=0; i<64; i++) { p = a & 0x7fc; a = rotrFixed(a, 9U); b += Ttab(p); b ^= a; q = b & 0x7fc; b = rotrFixed(b, 9U); c ^= Ttab(q); c += b; p = (p+c) & 0x7fc; c = rotrFixed(c, 9U); d += Ttab(p); d ^= c; q = (q+d) & 0x7fc; d = rotrFixed(d, 9U); a ^= Ttab(q); a += d; p = (p+a) & 0x7fc; b ^= Ttab(p); a = rotrFixed(a, 9U); q = (q+b) & 0x7fc; c += Ttab(q); b = rotrFixed(b, 9U); p = (p+c) & 0x7fc; d ^= Ttab(p); c = rotrFixed(c, 9U); q = (q+d) & 0x7fc; d = rotrFixed(d, 9U); a += Ttab(q); #define SEAL_OUTPUT(x) \ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, B::ToEnum(), 0, b + m_S[4*i+0]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, B::ToEnum(), 1, c ^ m_S[4*i+1]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, B::ToEnum(), 2, d + m_S[4*i+2]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, B::ToEnum(), 3, a ^ m_S[4*i+3]); CRYPTOPP_KEYSTREAM_OUTPUT_SWITCH(SEAL_OUTPUT, 4*4); if (i & 1) { a += n3; b += n4; c ^= n3; d ^= n4; } else { a += n1; b += n2; c ^= n1; d ^= n2; } } if (++m_insideCounter == m_iterationsPerCount) { ++m_outsideCounter; m_insideCounter = 0; } } a = b = c = d = n1 = n2 = n3 = n4 = 0; p = q = 0; } template class SEAL_Policy; template class SEAL_Policy; NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/words.h0000755000000000000000000000361212414772654017107 0ustar rootroot#ifndef CRYPTOPP_WORDS_H #define CRYPTOPP_WORDS_H #include "misc.h" NAMESPACE_BEGIN(CryptoPP) inline size_t CountWords(const word *X, size_t N) { while (N && X[N-1]==0) N--; return N; } inline void SetWords(word *r, word a, size_t n) { for (size_t i=0; i> (WORD_BITS-shiftBits); } return carry; } inline word ShiftWordsRightByBits(word *r, size_t n, unsigned int shiftBits) { assert (shiftBits0; i--) { u = r[i-1]; r[i-1] = (u >> shiftBits) | carry; carry = u << (WORD_BITS-shiftBits); } return carry; } inline void ShiftWordsLeftByWords(word *r, size_t n, size_t shiftWords) { shiftWords = STDMIN(shiftWords, n); if (shiftWords) { for (size_t i=n-1; i>=shiftWords; i--) r[i] = r[i-shiftWords]; SetWords(r, 0, shiftWords); } } inline void ShiftWordsRightByWords(word *r, size_t n, size_t shiftWords) { shiftWords = STDMIN(shiftWords, n); if (shiftWords) { for (size_t i=0; i+shiftWords(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterDefaultFactoryFor >(); RegisterAsymmetricCipherDefaultFactories > >("RSA/OAEP-MGF1(SHA-1)"); RegisterAsymmetricCipherDefaultFactories >("DLIES(NoCofactorMultiplication, KDF2(SHA-1), XOR, HMAC(SHA-1), DHAES)"); RegisterSignatureSchemeDefaultFactories("DSA(1363)"); RegisterSignatureSchemeDefaultFactories >("NR(1363)/EMSA1(SHA-1)"); RegisterSignatureSchemeDefaultFactories >("DSA-1363/EMSA1(SHA-1)"); RegisterSignatureSchemeDefaultFactories >("RSA/PKCS1-1.5(MD2)"); RegisterSignatureSchemeDefaultFactories >("RSA/PKCS1-1.5(SHA-1)"); RegisterSignatureSchemeDefaultFactories >("ESIGN/EMSA5-MGF1(SHA-1)"); RegisterSignatureSchemeDefaultFactories >("RW/EMSA2(SHA-1)"); RegisterSignatureSchemeDefaultFactories >("RSA/PSS-MGF1(SHA-1)"); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories(); RegisterSymmetricCipherDefaultFactories(); RegisterSymmetricCipherDefaultFactories(); RegisterSymmetricCipherDefaultFactories(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterAuthenticatedSymmetricCipherDefaultFactories >(); RegisterAuthenticatedSymmetricCipherDefaultFactories >(); RegisterAuthenticatedSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); RegisterSymmetricCipherDefaultFactories >(); s_registered = true; } armory-0.92.3/cppForSwig/cryptopp/camellia.h0000755000000000000000000000214312414772654017516 0ustar rootroot#ifndef CRYPTOPP_CAMELLIA_H #define CRYPTOPP_CAMELLIA_H #include "config.h" /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct Camellia_Info : public FixedBlockSize<16>, public VariableKeyLength<16, 16, 32, 8> { static const char *StaticAlgorithmName() {return "Camellia";} }; /// Camellia class Camellia : public Camellia_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *key, unsigned int keylen, const NameValuePairs ¶ms); void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; protected: static const byte s1[256]; static const word32 SP[4][256]; unsigned int m_rounds; SecBlock m_key; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef Camellia::Encryption CamelliaEncryption; typedef Camellia::Decryption CamelliaDecryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/base64.cpp0000755000000000000000000000230312414772654017364 0ustar rootroot// base64.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "base64.h" NAMESPACE_BEGIN(CryptoPP) static const byte s_vec[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; static const byte s_padding = '='; void Base64Encoder::IsolatedInitialize(const NameValuePairs ¶meters) { bool insertLineBreaks = parameters.GetValueWithDefault(Name::InsertLineBreaks(), true); int maxLineLength = parameters.GetIntValueWithDefault(Name::MaxLineLength(), 72); const char *lineBreak = insertLineBreaks ? "\n" : ""; m_filter->Initialize(CombinedNameValuePairs( parameters, MakeParameters(Name::EncodingLookupArray(), &s_vec[0], false) (Name::PaddingByte(), s_padding) (Name::GroupSize(), insertLineBreaks ? maxLineLength : 0) (Name::Separator(), ConstByteArrayParameter(lineBreak)) (Name::Terminator(), ConstByteArrayParameter(lineBreak)) (Name::Log2Base(), 6, true))); } const int *Base64Decoder::GetDecodingLookupArray() { static volatile bool s_initialized = false; static int s_array[256]; if (!s_initialized) { InitializeDecodingLookupArray(s_array, s_vec, 64, false); s_initialized = true; } return s_array; } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/ida.cpp0000755000000000000000000002604112414772654017042 0ustar rootroot// ida.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "ida.h" #include "algebra.h" #include "gf2_32.h" #include "polynomi.h" #include #include "polynomi.cpp" ANONYMOUS_NAMESPACE_BEGIN static const CryptoPP::GF2_32 field; NAMESPACE_END using namespace std; NAMESPACE_BEGIN(CryptoPP) void RawIDA::IsolatedInitialize(const NameValuePairs ¶meters) { if (!parameters.GetIntValue("RecoveryThreshold", m_threshold)) throw InvalidArgument("RawIDA: missing RecoveryThreshold argument"); if (m_threshold <= 0) throw InvalidArgument("RawIDA: RecoveryThreshold must be greater than 0"); m_lastMapPosition = m_inputChannelMap.end(); m_channelsReady = 0; m_channelsFinished = 0; m_w.New(m_threshold); m_y.New(m_threshold); m_inputQueues.reserve(m_threshold); m_outputChannelIds.clear(); m_outputChannelIdStrings.clear(); m_outputQueues.clear(); word32 outputChannelID; if (parameters.GetValue("OutputChannelID", outputChannelID)) AddOutputChannel(outputChannelID); else { int nShares = parameters.GetIntValueWithDefault("NumberOfShares", m_threshold); for (int i=0; ifirst == channelId) goto skipFind; ++m_lastMapPosition; if (m_lastMapPosition != m_inputChannelMap.end() && m_lastMapPosition->first == channelId) goto skipFind; } m_lastMapPosition = m_inputChannelMap.find(channelId); skipFind: if (m_lastMapPosition == m_inputChannelMap.end()) { if (m_inputChannelIds.size() == m_threshold) return m_threshold; m_lastMapPosition = m_inputChannelMap.insert(InputChannelMap::value_type(channelId, (unsigned int)m_inputChannelIds.size())).first; m_inputQueues.push_back(MessageQueue()); m_inputChannelIds.push_back(channelId); if (m_inputChannelIds.size() == m_threshold) PrepareInterpolation(); } return m_lastMapPosition->second; } unsigned int RawIDA::LookupInputChannel(word32 channelId) const { map::const_iterator it = m_inputChannelMap.find(channelId); if (it == m_inputChannelMap.end()) return m_threshold; else return it->second; } void RawIDA::ChannelData(word32 channelId, const byte *inString, size_t length, bool messageEnd) { int i = InsertInputChannel(channelId); if (i < m_threshold) { lword size = m_inputQueues[i].MaxRetrievable(); m_inputQueues[i].Put(inString, length); if (size < 4 && size + length >= 4) { m_channelsReady++; if (m_channelsReady == m_threshold) ProcessInputQueues(); } if (messageEnd) { m_inputQueues[i].MessageEnd(); if (m_inputQueues[i].NumberOfMessages() == 1) { m_channelsFinished++; if (m_channelsFinished == m_threshold) { m_channelsReady = 0; for (i=0; i= m_v.size()) { m_v.resize(i+1); m_outputToInput.resize(i+1); } m_outputToInput[i] = LookupInputChannel(m_outputChannelIds[i]); if (m_outputToInput[i] == m_threshold && i * m_threshold <= 1000*1000) { m_v[i].resize(m_threshold); PrepareBulkPolynomialInterpolationAt(field, m_v[i].begin(), m_outputChannelIds[i], &(m_inputChannelIds[0]), m_w.begin(), m_threshold); } } void RawIDA::AddOutputChannel(word32 channelId) { m_outputChannelIds.push_back(channelId); m_outputChannelIdStrings.push_back(WordToString(channelId)); m_outputQueues.push_back(ByteQueue()); if (m_inputChannelIds.size() == m_threshold) ComputeV((unsigned int)m_outputChannelIds.size() - 1); } void RawIDA::PrepareInterpolation() { assert(m_inputChannelIds.size() == m_threshold); PrepareBulkPolynomialInterpolation(field, m_w.begin(), &(m_inputChannelIds[0]), m_threshold); for (unsigned int i=0; i 0 : m_channelsReady == m_threshold) { m_channelsReady = 0; for (i=0; i 0 || queue.MaxRetrievable() >= 4; } for (i=0; (unsigned int)i 0 && m_outputQueues[0].AnyRetrievable()) FlushOutputQueues(); if (finished) { OutputMessageEnds(); m_channelsReady = 0; m_channelsFinished = 0; m_v.clear(); vector inputQueues; vector inputChannelIds; inputQueues.swap(m_inputQueues); inputChannelIds.swap(m_inputChannelIds); m_inputChannelMap.clear(); m_lastMapPosition = m_inputChannelMap.end(); for (i=0; iChannelMessageEnd(m_outputChannelIdStrings[i], GetAutoSignalPropagation()-1); } } // **************************************************************** void SecretSharing::IsolatedInitialize(const NameValuePairs ¶meters) { m_pad = parameters.GetValueWithDefault("AddPadding", true); m_ida.IsolatedInitialize(parameters); } size_t SecretSharing::Put2(const byte *begin, size_t length, int messageEnd, bool blocking) { if (!blocking) throw BlockingInputOnly("SecretSharing"); SecByteBlock buf(UnsignedMin(256, length)); unsigned int threshold = m_ida.GetThreshold(); while (length > 0) { size_t len = STDMIN(length, buf.size()); m_ida.ChannelData(0xffffffff, begin, len, false); for (unsigned int i=0; i 0) SecretSharing::Put(0); } m_ida.ChannelData(0xffffffff, NULL, 0, true); for (unsigned int i=0; iMessageEnd(GetAutoSignalPropagation()-1); } // **************************************************************** void InformationDispersal::IsolatedInitialize(const NameValuePairs ¶meters) { m_nextChannel = 0; m_pad = parameters.GetValueWithDefault("AddPadding", true); m_ida.IsolatedInitialize(parameters); } size_t InformationDispersal::Put2(const byte *begin, size_t length, int messageEnd, bool blocking) { if (!blocking) throw BlockingInputOnly("InformationDispersal"); while (length--) { m_ida.ChannelData(m_nextChannel, begin, 1, false); begin++; m_nextChannel++; if (m_nextChannel == m_ida.GetThreshold()) m_nextChannel = 0; } if (messageEnd) { m_ida.SetAutoSignalPropagation(messageEnd-1); if (m_pad) InformationDispersal::Put(1); for (word32 i=0; iMessageEnd(GetAutoSignalPropagation()-1); } size_t PaddingRemover::Put2(const byte *begin, size_t length, int messageEnd, bool blocking) { if (!blocking) throw BlockingInputOnly("PaddingRemover"); const byte *const end = begin + length; if (m_possiblePadding) { size_t len = find_if(begin, end, bind2nd(not_equal_to(), 0)) - begin; m_zeroCount += len; begin += len; if (begin == end) return 0; AttachedTransformation()->Put(1); while (m_zeroCount--) AttachedTransformation()->Put(0); AttachedTransformation()->Put(*begin++); m_possiblePadding = false; } #if defined(_MSC_VER) && !defined(__MWERKS__) && (_MSC_VER <= 1300) // VC60 and VC7 workaround: built-in reverse_iterator has two template parameters, Dinkumware only has one typedef reverse_bidirectional_iterator RevIt; #elif defined(_RWSTD_NO_CLASS_PARTIAL_SPEC) typedef reverse_iterator RevIt; #else typedef reverse_iterator RevIt; #endif const byte *x = find_if(RevIt(end), RevIt(begin), bind2nd(not_equal_to(), 0)).base(); if (x != begin && *(x-1) == 1) { AttachedTransformation()->Put(begin, x-begin-1); m_possiblePadding = true; m_zeroCount = end - x; } else AttachedTransformation()->Put(begin, end-begin); if (messageEnd) { m_possiblePadding = false; Output(0, begin, length, messageEnd, blocking); } return 0; } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/oids.h0000755000000000000000000001255112414772654016711 0ustar rootroot#ifndef CRYPTOPP_OIDS_H #define CRYPTOPP_OIDS_H // crypto-related ASN.1 object identifiers #include "asn.h" NAMESPACE_BEGIN(CryptoPP) NAMESPACE_BEGIN(ASN1) #define DEFINE_OID(value, name) inline OID name() {return value;} DEFINE_OID(1, iso) DEFINE_OID(iso()+2, member_body) DEFINE_OID(member_body()+840, iso_us) DEFINE_OID(iso_us()+10040, ansi_x9_57) DEFINE_OID(ansi_x9_57()+4+1, id_dsa) DEFINE_OID(iso_us()+10045, ansi_x9_62) DEFINE_OID(ansi_x9_62()+1, id_fieldType) DEFINE_OID(id_fieldType()+1, prime_field) DEFINE_OID(id_fieldType()+2, characteristic_two_field) DEFINE_OID(characteristic_two_field()+3, id_characteristic_two_basis) DEFINE_OID(id_characteristic_two_basis()+1, gnBasis) DEFINE_OID(id_characteristic_two_basis()+2, tpBasis) DEFINE_OID(id_characteristic_two_basis()+3, ppBasis) DEFINE_OID(ansi_x9_62()+2, id_publicKeyType) DEFINE_OID(id_publicKeyType()+1, id_ecPublicKey) DEFINE_OID(ansi_x9_62()+3, ansi_x9_62_curves) DEFINE_OID(ansi_x9_62_curves()+1, ansi_x9_62_curves_prime) DEFINE_OID(ansi_x9_62_curves_prime()+1, secp192r1) DEFINE_OID(ansi_x9_62_curves_prime()+7, secp256r1) DEFINE_OID(iso_us()+113549, rsadsi) DEFINE_OID(rsadsi()+1, pkcs) DEFINE_OID(pkcs()+1, pkcs_1) DEFINE_OID(pkcs_1()+1, rsaEncryption); DEFINE_OID(rsadsi()+2, rsadsi_digestAlgorithm) DEFINE_OID(rsadsi_digestAlgorithm()+2, id_md2) DEFINE_OID(rsadsi_digestAlgorithm()+5, id_md5) DEFINE_OID(iso()+3, identified_organization); DEFINE_OID(identified_organization()+14, oiw); DEFINE_OID(oiw()+3, oiw_secsig); DEFINE_OID(oiw_secsig()+2, oiw_secsig_algorithms); DEFINE_OID(oiw_secsig_algorithms()+26, id_sha1); DEFINE_OID(identified_organization()+36, teletrust); DEFINE_OID(teletrust()+3, teletrust_algorithm) DEFINE_OID(teletrust_algorithm()+2+1, id_ripemd160) DEFINE_OID(teletrust_algorithm()+3+2+8+1, teletrust_ellipticCurve) DEFINE_OID(teletrust_ellipticCurve()+1+1, brainpoolP160r1) DEFINE_OID(teletrust_ellipticCurve()+1+3, brainpoolP192r1) DEFINE_OID(teletrust_ellipticCurve()+1+5, brainpoolP224r1) DEFINE_OID(teletrust_ellipticCurve()+1+7, brainpoolP256r1) DEFINE_OID(teletrust_ellipticCurve()+1+9, brainpoolP320r1) DEFINE_OID(teletrust_ellipticCurve()+1+11, brainpoolP384r1) DEFINE_OID(teletrust_ellipticCurve()+1+13, brainpoolP512r1) DEFINE_OID(identified_organization()+132, certicom); DEFINE_OID(certicom()+0, certicom_ellipticCurve); // these are sorted by curve type and then by OID // first curves based on GF(p) DEFINE_OID(certicom_ellipticCurve()+6, secp112r1); DEFINE_OID(certicom_ellipticCurve()+7, secp112r2); DEFINE_OID(certicom_ellipticCurve()+8, secp160r1); DEFINE_OID(certicom_ellipticCurve()+9, secp160k1); DEFINE_OID(certicom_ellipticCurve()+10, secp256k1); DEFINE_OID(certicom_ellipticCurve()+28, secp128r1); DEFINE_OID(certicom_ellipticCurve()+29, secp128r2); DEFINE_OID(certicom_ellipticCurve()+30, secp160r2); DEFINE_OID(certicom_ellipticCurve()+31, secp192k1); DEFINE_OID(certicom_ellipticCurve()+32, secp224k1); DEFINE_OID(certicom_ellipticCurve()+33, secp224r1); DEFINE_OID(certicom_ellipticCurve()+34, secp384r1); DEFINE_OID(certicom_ellipticCurve()+35, secp521r1); // then curves based on GF(2^n) DEFINE_OID(certicom_ellipticCurve()+1, sect163k1); DEFINE_OID(certicom_ellipticCurve()+2, sect163r1); DEFINE_OID(certicom_ellipticCurve()+3, sect239k1); DEFINE_OID(certicom_ellipticCurve()+4, sect113r1); DEFINE_OID(certicom_ellipticCurve()+5, sect113r2); DEFINE_OID(certicom_ellipticCurve()+15, sect163r2); DEFINE_OID(certicom_ellipticCurve()+16, sect283k1); DEFINE_OID(certicom_ellipticCurve()+17, sect283r1); DEFINE_OID(certicom_ellipticCurve()+22, sect131r1); DEFINE_OID(certicom_ellipticCurve()+23, sect131r2); DEFINE_OID(certicom_ellipticCurve()+24, sect193r1); DEFINE_OID(certicom_ellipticCurve()+25, sect193r2); DEFINE_OID(certicom_ellipticCurve()+26, sect233k1); DEFINE_OID(certicom_ellipticCurve()+27, sect233r1); DEFINE_OID(certicom_ellipticCurve()+36, sect409k1); DEFINE_OID(certicom_ellipticCurve()+37, sect409r1); DEFINE_OID(certicom_ellipticCurve()+38, sect571k1); DEFINE_OID(certicom_ellipticCurve()+39, sect571r1); DEFINE_OID(2, joint_iso_ccitt) DEFINE_OID(joint_iso_ccitt()+16, country) DEFINE_OID(country()+840, joint_iso_ccitt_us) DEFINE_OID(joint_iso_ccitt_us()+1, us_organization) DEFINE_OID(us_organization()+101, us_gov) DEFINE_OID(us_gov()+3, csor) DEFINE_OID(csor()+4, nistalgorithms) DEFINE_OID(nistalgorithms()+1, aes) DEFINE_OID(aes()+1, id_aes128_ECB) DEFINE_OID(aes()+2, id_aes128_cbc) DEFINE_OID(aes()+3, id_aes128_ofb) DEFINE_OID(aes()+4, id_aes128_cfb) DEFINE_OID(aes()+21, id_aes192_ECB) DEFINE_OID(aes()+22, id_aes192_cbc) DEFINE_OID(aes()+23, id_aes192_ofb) DEFINE_OID(aes()+24, id_aes192_cfb) DEFINE_OID(aes()+41, id_aes256_ECB) DEFINE_OID(aes()+42, id_aes256_cbc) DEFINE_OID(aes()+43, id_aes256_ofb) DEFINE_OID(aes()+44, id_aes256_cfb) DEFINE_OID(nistalgorithms()+2, nist_hashalgs) DEFINE_OID(nist_hashalgs()+1, id_sha256) DEFINE_OID(nist_hashalgs()+2, id_sha384) DEFINE_OID(nist_hashalgs()+3, id_sha512) NAMESPACE_END NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/gf256.h0000755000000000000000000000226712414772654016607 0ustar rootroot#ifndef CRYPTOPP_GF256_H #define CRYPTOPP_GF256_H #include "cryptlib.h" NAMESPACE_BEGIN(CryptoPP) //! GF(256) with polynomial basis class GF256 { public: typedef byte Element; typedef int RandomizationParameter; GF256(byte modulus) : m_modulus(modulus) {} Element RandomElement(RandomNumberGenerator &rng, int ignored = 0) const {return rng.GenerateByte();} bool Equal(Element a, Element b) const {return a==b;} Element Zero() const {return 0;} Element Add(Element a, Element b) const {return a^b;} Element& Accumulate(Element &a, Element b) const {return a^=b;} Element Inverse(Element a) const {return a;} Element Subtract(Element a, Element b) const {return a^b;} Element& Reduce(Element &a, Element b) const {return a^=b;} Element Double(Element a) const {return 0;} Element One() const {return 1;} Element Multiply(Element a, Element b) const; Element Square(Element a) const {return Multiply(a, a);} bool IsUnit(Element a) const {return a != 0;} Element MultiplicativeInverse(Element a) const; Element Divide(Element a, Element b) const {return Multiply(a, MultiplicativeInverse(b));} private: word m_modulus; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/rc6.h0000755000000000000000000000240412414772654016441 0ustar rootroot#ifndef CRYPTOPP_RC6_H #define CRYPTOPP_RC6_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct RC6_Info : public FixedBlockSize<16>, public VariableKeyLength<16, 0, 255>, public VariableRounds<20> { static const char *StaticAlgorithmName() {return "RC6";} typedef word32 RC6_WORD; }; /// RC6 class RC6 : public RC6_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); protected: unsigned int r; // number of rounds SecBlock sTable; // expanded key table }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef RC6::Encryption RC6Encryption; typedef RC6::Decryption RC6Decryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/rijndael.cpp0000755000000000000000000011074612414772654020103 0ustar rootroot// rijndael.cpp - modified by Chris Morgan // and Wei Dai from Paulo Baretto's Rijndael implementation // The original code and all modifications are in the public domain. // use "cl /EP /P /DCRYPTOPP_GENERATE_X64_MASM rijndael.cpp" to generate MASM code /* July 2010: Added support for AES-NI instructions via compiler intrinsics. */ /* Feb 2009: The x86/x64 assembly code was rewritten in by Wei Dai to do counter mode caching, which was invented by Hongjun Wu and popularized by Daniel J. Bernstein and Peter Schwabe in their paper "New AES software speed records". The round function was also modified to include a trick similar to one in Brian Gladman's x86 assembly code, doing an 8-bit register move to minimize the number of register spills. Also switched to compressed tables and copying round keys to the stack. The C++ implementation now uses compressed tables if CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS is defined. */ /* July 2006: Defense against timing attacks was added in by Wei Dai. The code now uses smaller tables in the first and last rounds, and preloads them into L1 cache before usage (by loading at least one element in each cache line). We try to delay subsequent accesses to each table (used in the first and last rounds) until all of the table has been preloaded. Hopefully the compiler isn't smart enough to optimize that code away. After preloading the table, we also try not to access any memory location other than the table and the stack, in order to prevent table entries from being unloaded from L1 cache, until that round is finished. (Some popular CPUs have 2-way associative caches.) */ // This is the original introductory comment: /** * version 3.0 (December 2000) * * Optimised ANSI C code for the Rijndael cipher (now AES) * * author Vincent Rijmen * author Antoon Bosselaers * author Paulo Barreto * * This code is hereby placed in the public domain. * * THIS SOFTWARE IS PROVIDED BY THE AUTHORS ''AS IS'' AND ANY EXPRESS * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "pch.h" #ifndef CRYPTOPP_IMPORTS #ifndef CRYPTOPP_GENERATE_X64_MASM #include "rijndael.h" #include "misc.h" #include "cpu.h" NAMESPACE_BEGIN(CryptoPP) #ifdef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE || defined(CRYPTOPP_X64_MASM_AVAILABLE) namespace rdtable {CRYPTOPP_ALIGN_DATA(16) word64 Te[256+2];} using namespace rdtable; #else static word64 Te[256]; #endif static word64 Td[256]; #else static word32 Te[256*4], Td[256*4]; #endif static volatile bool s_TeFilled = false, s_TdFilled = false; // ************************* Portable Code ************************************ #define QUARTER_ROUND(L, T, t, a, b, c, d) \ a ^= L(T, 3, byte(t)); t >>= 8;\ b ^= L(T, 2, byte(t)); t >>= 8;\ c ^= L(T, 1, byte(t)); t >>= 8;\ d ^= L(T, 0, t); #define QUARTER_ROUND_LE(t, a, b, c, d) \ tempBlock[a] = ((byte *)(Te+byte(t)))[1]; t >>= 8;\ tempBlock[b] = ((byte *)(Te+byte(t)))[1]; t >>= 8;\ tempBlock[c] = ((byte *)(Te+byte(t)))[1]; t >>= 8;\ tempBlock[d] = ((byte *)(Te+t))[1]; #ifdef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS #define QUARTER_ROUND_LD(t, a, b, c, d) \ tempBlock[a] = ((byte *)(Td+byte(t)))[GetNativeByteOrder()*7]; t >>= 8;\ tempBlock[b] = ((byte *)(Td+byte(t)))[GetNativeByteOrder()*7]; t >>= 8;\ tempBlock[c] = ((byte *)(Td+byte(t)))[GetNativeByteOrder()*7]; t >>= 8;\ tempBlock[d] = ((byte *)(Td+t))[GetNativeByteOrder()*7]; #else #define QUARTER_ROUND_LD(t, a, b, c, d) \ tempBlock[a] = Sd[byte(t)]; t >>= 8;\ tempBlock[b] = Sd[byte(t)]; t >>= 8;\ tempBlock[c] = Sd[byte(t)]; t >>= 8;\ tempBlock[d] = Sd[t]; #endif #define QUARTER_ROUND_E(t, a, b, c, d) QUARTER_ROUND(TL_M, Te, t, a, b, c, d) #define QUARTER_ROUND_D(t, a, b, c, d) QUARTER_ROUND(TL_M, Td, t, a, b, c, d) #ifdef IS_LITTLE_ENDIAN #define QUARTER_ROUND_FE(t, a, b, c, d) QUARTER_ROUND(TL_F, Te, t, d, c, b, a) #define QUARTER_ROUND_FD(t, a, b, c, d) QUARTER_ROUND(TL_F, Td, t, d, c, b, a) #ifdef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS #define TL_F(T, i, x) (*(word32 *)((byte *)T + x*8 + (6-i)%4+1)) #define TL_M(T, i, x) (*(word32 *)((byte *)T + x*8 + (i+3)%4+1)) #else #define TL_F(T, i, x) rotrFixed(T[x], (3-i)*8) #define TL_M(T, i, x) T[i*256 + x] #endif #else #define QUARTER_ROUND_FE(t, a, b, c, d) QUARTER_ROUND(TL_F, Te, t, a, b, c, d) #define QUARTER_ROUND_FD(t, a, b, c, d) QUARTER_ROUND(TL_F, Td, t, a, b, c, d) #ifdef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS #define TL_F(T, i, x) (*(word32 *)((byte *)T + x*8 + (4-i)%4)) #define TL_M TL_F #else #define TL_F(T, i, x) rotrFixed(T[x], i*8) #define TL_M(T, i, x) T[i*256 + x] #endif #endif #define f2(x) ((x<<1)^(((x>>7)&1)*0x11b)) #define f4(x) ((x<<2)^(((x>>6)&1)*0x11b)^(((x>>6)&2)*0x11b)) #define f8(x) ((x<<3)^(((x>>5)&1)*0x11b)^(((x>>5)&2)*0x11b)^(((x>>5)&4)*0x11b)) #define f3(x) (f2(x) ^ x) #define f9(x) (f8(x) ^ x) #define fb(x) (f8(x) ^ f2(x) ^ x) #define fd(x) (f8(x) ^ f4(x) ^ x) #define fe(x) (f8(x) ^ f4(x) ^ f2(x)) void Rijndael::Base::FillEncTable() { for (int i=0; i<256; i++) { byte x = Se[i]; #ifdef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS word32 y = word32(x)<<8 | word32(x)<<16 | word32(f2(x))<<24; Te[i] = word64(y | f3(x))<<32 | y; #else word32 y = f3(x) | word32(x)<<8 | word32(x)<<16 | word32(f2(x))<<24; for (int j=0; j<4; j++) { Te[i+j*256] = y; y = rotrFixed(y, 8); } #endif } #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE || defined(CRYPTOPP_X64_MASM_AVAILABLE) Te[256] = Te[257] = 0; #endif s_TeFilled = true; } void Rijndael::Base::FillDecTable() { for (int i=0; i<256; i++) { byte x = Sd[i]; #ifdef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS word32 y = word32(fd(x))<<8 | word32(f9(x))<<16 | word32(fe(x))<<24; Td[i] = word64(y | fb(x))<<32 | y | x; #else word32 y = fb(x) | word32(fd(x))<<8 | word32(f9(x))<<16 | word32(fe(x))<<24;; for (int j=0; j<4; j++) { Td[i+j*256] = y; y = rotrFixed(y, 8); } #endif } s_TdFilled = true; } void Rijndael::Base::UncheckedSetKey(const byte *userKey, unsigned int keylen, const NameValuePairs &) { AssertValidKeyLength(keylen); m_rounds = keylen/4 + 6; m_key.New(4*(m_rounds+1)); word32 *rk = m_key; #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE && (!defined(_MSC_VER) || _MSC_VER >= 1600 || CRYPTOPP_BOOL_X86) // MSVC 2008 SP1 generates bad code for _mm_extract_epi32() when compiling for X64 if (HasAESNI()) { static const word32 rcLE[] = { 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1B, 0x36, /* for 128-bit blocks, Rijndael never uses more than 10 rcon values */ }; const word32 *rc = rcLE; __m128i temp = _mm_loadu_si128((__m128i *)(userKey+keylen-16)); memcpy(rk, userKey, keylen); while (true) { rk[keylen/4] = rk[0] ^ _mm_extract_epi32(_mm_aeskeygenassist_si128(temp, 0), 3) ^ *(rc++); rk[keylen/4+1] = rk[1] ^ rk[keylen/4]; rk[keylen/4+2] = rk[2] ^ rk[keylen/4+1]; rk[keylen/4+3] = rk[3] ^ rk[keylen/4+2]; if (rk + keylen/4 + 4 == m_key.end()) break; if (keylen == 24) { rk[10] = rk[ 4] ^ rk[ 9]; rk[11] = rk[ 5] ^ rk[10]; temp = _mm_insert_epi32(temp, rk[11], 3); } else if (keylen == 32) { temp = _mm_insert_epi32(temp, rk[11], 3); rk[12] = rk[ 4] ^ _mm_extract_epi32(_mm_aeskeygenassist_si128(temp, 0), 2); rk[13] = rk[ 5] ^ rk[12]; rk[14] = rk[ 6] ^ rk[13]; rk[15] = rk[ 7] ^ rk[14]; temp = _mm_insert_epi32(temp, rk[15], 3); } else temp = _mm_insert_epi32(temp, rk[7], 3); rk += keylen/4; } if (!IsForwardTransformation()) { rk = m_key; unsigned int i, j; std::swap(*(__m128i *)(rk), *(__m128i *)(rk+4*m_rounds)); for (i = 4, j = 4*m_rounds-4; i < j; i += 4, j -= 4) { temp = _mm_aesimc_si128(*(__m128i *)(rk+i)); *(__m128i *)(rk+i) = _mm_aesimc_si128(*(__m128i *)(rk+j)); *(__m128i *)(rk+j) = temp; } *(__m128i *)(rk+i) = _mm_aesimc_si128(*(__m128i *)(rk+i)); } return; } #endif GetUserKey(BIG_ENDIAN_ORDER, rk, keylen/4, userKey, keylen); const word32 *rc = rcon; word32 temp; while (true) { temp = rk[keylen/4-1]; word32 x = (word32(Se[GETBYTE(temp, 2)]) << 24) ^ (word32(Se[GETBYTE(temp, 1)]) << 16) ^ (word32(Se[GETBYTE(temp, 0)]) << 8) ^ Se[GETBYTE(temp, 3)]; rk[keylen/4] = rk[0] ^ x ^ *(rc++); rk[keylen/4+1] = rk[1] ^ rk[keylen/4]; rk[keylen/4+2] = rk[2] ^ rk[keylen/4+1]; rk[keylen/4+3] = rk[3] ^ rk[keylen/4+2]; if (rk + keylen/4 + 4 == m_key.end()) break; if (keylen == 24) { rk[10] = rk[ 4] ^ rk[ 9]; rk[11] = rk[ 5] ^ rk[10]; } else if (keylen == 32) { temp = rk[11]; rk[12] = rk[ 4] ^ (word32(Se[GETBYTE(temp, 3)]) << 24) ^ (word32(Se[GETBYTE(temp, 2)]) << 16) ^ (word32(Se[GETBYTE(temp, 1)]) << 8) ^ Se[GETBYTE(temp, 0)]; rk[13] = rk[ 5] ^ rk[12]; rk[14] = rk[ 6] ^ rk[13]; rk[15] = rk[ 7] ^ rk[14]; } rk += keylen/4; } rk = m_key; if (IsForwardTransformation()) { if (!s_TeFilled) FillEncTable(); ConditionalByteReverse(BIG_ENDIAN_ORDER, rk, rk, 16); ConditionalByteReverse(BIG_ENDIAN_ORDER, rk + m_rounds*4, rk + m_rounds*4, 16); } else { if (!s_TdFilled) FillDecTable(); unsigned int i, j; #define InverseMixColumn(x) TL_M(Td, 0, Se[GETBYTE(x, 3)]) ^ TL_M(Td, 1, Se[GETBYTE(x, 2)]) ^ TL_M(Td, 2, Se[GETBYTE(x, 1)]) ^ TL_M(Td, 3, Se[GETBYTE(x, 0)]) for (i = 4, j = 4*m_rounds-4; i < j; i += 4, j -= 4) { temp = InverseMixColumn(rk[i ]); rk[i ] = InverseMixColumn(rk[j ]); rk[j ] = temp; temp = InverseMixColumn(rk[i + 1]); rk[i + 1] = InverseMixColumn(rk[j + 1]); rk[j + 1] = temp; temp = InverseMixColumn(rk[i + 2]); rk[i + 2] = InverseMixColumn(rk[j + 2]); rk[j + 2] = temp; temp = InverseMixColumn(rk[i + 3]); rk[i + 3] = InverseMixColumn(rk[j + 3]); rk[j + 3] = temp; } rk[i+0] = InverseMixColumn(rk[i+0]); rk[i+1] = InverseMixColumn(rk[i+1]); rk[i+2] = InverseMixColumn(rk[i+2]); rk[i+3] = InverseMixColumn(rk[i+3]); temp = ConditionalByteReverse(BIG_ENDIAN_ORDER, rk[0]); rk[0] = ConditionalByteReverse(BIG_ENDIAN_ORDER, rk[4*m_rounds+0]); rk[4*m_rounds+0] = temp; temp = ConditionalByteReverse(BIG_ENDIAN_ORDER, rk[1]); rk[1] = ConditionalByteReverse(BIG_ENDIAN_ORDER, rk[4*m_rounds+1]); rk[4*m_rounds+1] = temp; temp = ConditionalByteReverse(BIG_ENDIAN_ORDER, rk[2]); rk[2] = ConditionalByteReverse(BIG_ENDIAN_ORDER, rk[4*m_rounds+2]); rk[4*m_rounds+2] = temp; temp = ConditionalByteReverse(BIG_ENDIAN_ORDER, rk[3]); rk[3] = ConditionalByteReverse(BIG_ENDIAN_ORDER, rk[4*m_rounds+3]); rk[4*m_rounds+3] = temp; } #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE if (HasAESNI()) ConditionalByteReverse(BIG_ENDIAN_ORDER, rk+4, rk+4, (m_rounds-1)*16); #endif } void Rijndael::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE || defined(CRYPTOPP_X64_MASM_AVAILABLE) || CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE || defined(CRYPTOPP_X64_MASM_AVAILABLE) if (HasSSE2()) #else if (HasAESNI()) #endif { Rijndael::Enc::AdvancedProcessBlocks(inBlock, xorBlock, outBlock, 16, 0); return; } #endif typedef BlockGetAndPut Block; word32 s0, s1, s2, s3, t0, t1, t2, t3; Block::Get(inBlock)(s0)(s1)(s2)(s3); const word32 *rk = m_key; s0 ^= rk[0]; s1 ^= rk[1]; s2 ^= rk[2]; s3 ^= rk[3]; t0 = rk[4]; t1 = rk[5]; t2 = rk[6]; t3 = rk[7]; rk += 8; // timing attack countermeasure. see comments at top for more details const int cacheLineSize = GetCacheLineSize(); unsigned int i; word32 u = 0; #ifdef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS for (i=0; i<2048; i+=cacheLineSize) #else for (i=0; i<1024; i+=cacheLineSize) #endif u &= *(const word32 *)(((const byte *)Te)+i); u &= Te[255]; s0 |= u; s1 |= u; s2 |= u; s3 |= u; QUARTER_ROUND_FE(s3, t0, t1, t2, t3) QUARTER_ROUND_FE(s2, t3, t0, t1, t2) QUARTER_ROUND_FE(s1, t2, t3, t0, t1) QUARTER_ROUND_FE(s0, t1, t2, t3, t0) // Nr - 2 full rounds: unsigned int r = m_rounds/2 - 1; do { s0 = rk[0]; s1 = rk[1]; s2 = rk[2]; s3 = rk[3]; QUARTER_ROUND_E(t3, s0, s1, s2, s3) QUARTER_ROUND_E(t2, s3, s0, s1, s2) QUARTER_ROUND_E(t1, s2, s3, s0, s1) QUARTER_ROUND_E(t0, s1, s2, s3, s0) t0 = rk[4]; t1 = rk[5]; t2 = rk[6]; t3 = rk[7]; QUARTER_ROUND_E(s3, t0, t1, t2, t3) QUARTER_ROUND_E(s2, t3, t0, t1, t2) QUARTER_ROUND_E(s1, t2, t3, t0, t1) QUARTER_ROUND_E(s0, t1, t2, t3, t0) rk += 8; } while (--r); word32 tbw[4]; byte *const tempBlock = (byte *)tbw; QUARTER_ROUND_LE(t2, 15, 2, 5, 8) QUARTER_ROUND_LE(t1, 11, 14, 1, 4) QUARTER_ROUND_LE(t0, 7, 10, 13, 0) QUARTER_ROUND_LE(t3, 3, 6, 9, 12) Block::Put(xorBlock, outBlock)(tbw[0]^rk[0])(tbw[1]^rk[1])(tbw[2]^rk[2])(tbw[3]^rk[3]); } void Rijndael::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE if (HasAESNI()) { Rijndael::Dec::AdvancedProcessBlocks(inBlock, xorBlock, outBlock, 16, 0); return; } #endif typedef BlockGetAndPut Block; word32 s0, s1, s2, s3, t0, t1, t2, t3; Block::Get(inBlock)(s0)(s1)(s2)(s3); const word32 *rk = m_key; s0 ^= rk[0]; s1 ^= rk[1]; s2 ^= rk[2]; s3 ^= rk[3]; t0 = rk[4]; t1 = rk[5]; t2 = rk[6]; t3 = rk[7]; rk += 8; // timing attack countermeasure. see comments at top for more details const int cacheLineSize = GetCacheLineSize(); unsigned int i; word32 u = 0; #ifdef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS for (i=0; i<2048; i+=cacheLineSize) #else for (i=0; i<1024; i+=cacheLineSize) #endif u &= *(const word32 *)(((const byte *)Td)+i); u &= Td[255]; s0 |= u; s1 |= u; s2 |= u; s3 |= u; QUARTER_ROUND_FD(s3, t2, t1, t0, t3) QUARTER_ROUND_FD(s2, t1, t0, t3, t2) QUARTER_ROUND_FD(s1, t0, t3, t2, t1) QUARTER_ROUND_FD(s0, t3, t2, t1, t0) // Nr - 2 full rounds: unsigned int r = m_rounds/2 - 1; do { s0 = rk[0]; s1 = rk[1]; s2 = rk[2]; s3 = rk[3]; QUARTER_ROUND_D(t3, s2, s1, s0, s3) QUARTER_ROUND_D(t2, s1, s0, s3, s2) QUARTER_ROUND_D(t1, s0, s3, s2, s1) QUARTER_ROUND_D(t0, s3, s2, s1, s0) t0 = rk[4]; t1 = rk[5]; t2 = rk[6]; t3 = rk[7]; QUARTER_ROUND_D(s3, t2, t1, t0, t3) QUARTER_ROUND_D(s2, t1, t0, t3, t2) QUARTER_ROUND_D(s1, t0, t3, t2, t1) QUARTER_ROUND_D(s0, t3, t2, t1, t0) rk += 8; } while (--r); #ifndef CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS // timing attack countermeasure. see comments at top for more details // If CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS is defined, // QUARTER_ROUND_LD will use Td, which is already preloaded. u = 0; for (i=0; i<256; i+=cacheLineSize) u &= *(const word32 *)(Sd+i); u &= *(const word32 *)(Sd+252); t0 |= u; t1 |= u; t2 |= u; t3 |= u; #endif word32 tbw[4]; byte *const tempBlock = (byte *)tbw; QUARTER_ROUND_LD(t2, 7, 2, 13, 8) QUARTER_ROUND_LD(t1, 3, 14, 9, 4) QUARTER_ROUND_LD(t0, 15, 10, 5, 0) QUARTER_ROUND_LD(t3, 11, 6, 1, 12) Block::Put(xorBlock, outBlock)(tbw[0]^rk[0])(tbw[1]^rk[1])(tbw[2]^rk[2])(tbw[3]^rk[3]); } // ************************* Assembly Code ************************************ #pragma warning(disable: 4731) // frame pointer register 'ebp' modified by inline assembly code #endif // #ifndef CRYPTOPP_GENERATE_X64_MASM #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE CRYPTOPP_NAKED void CRYPTOPP_FASTCALL Rijndael_Enc_AdvancedProcessBlocks(void *locals, const word32 *k) { #if CRYPTOPP_BOOL_X86 #define L_REG esp #define L_INDEX(i) (L_REG+512+i) #define L_INXORBLOCKS L_INBLOCKS+4 #define L_OUTXORBLOCKS L_INBLOCKS+8 #define L_OUTBLOCKS L_INBLOCKS+12 #define L_INCREMENTS L_INDEX(16*15) #define L_SP L_INDEX(16*16) #define L_LENGTH L_INDEX(16*16+4) #define L_KEYS_BEGIN L_INDEX(16*16+8) #define MOVD movd #define MM(i) mm##i #define MXOR(a,b,c) \ AS2( movzx esi, b)\ AS2( movd mm7, DWORD PTR [AS_REG_7+8*WORD_REG(si)+MAP0TO4(c)])\ AS2( pxor MM(a), mm7)\ #define MMOV(a,b,c) \ AS2( movzx esi, b)\ AS2( movd MM(a), DWORD PTR [AS_REG_7+8*WORD_REG(si)+MAP0TO4(c)])\ #else #define L_REG r8 #define L_INDEX(i) (L_REG+i) #define L_INXORBLOCKS L_INBLOCKS+8 #define L_OUTXORBLOCKS L_INBLOCKS+16 #define L_OUTBLOCKS L_INBLOCKS+24 #define L_INCREMENTS L_INDEX(16*16) #define L_LENGTH L_INDEX(16*18+8) #define L_KEYS_BEGIN L_INDEX(16*19) #define MOVD mov #define MM_0 r9d #define MM_1 r12d #ifdef __GNUC__ #define MM_2 r11d #else #define MM_2 r10d #endif #define MM(i) MM_##i #define MXOR(a,b,c) \ AS2( movzx esi, b)\ AS2( xor MM(a), DWORD PTR [AS_REG_7+8*WORD_REG(si)+MAP0TO4(c)])\ #define MMOV(a,b,c) \ AS2( movzx esi, b)\ AS2( mov MM(a), DWORD PTR [AS_REG_7+8*WORD_REG(si)+MAP0TO4(c)])\ #endif #define L_SUBKEYS L_INDEX(0) #define L_SAVED_X L_SUBKEYS #define L_KEY12 L_INDEX(16*12) #define L_LASTROUND L_INDEX(16*13) #define L_INBLOCKS L_INDEX(16*14) #define MAP0TO4(i) (ASM_MOD(i+3,4)+1) #define XOR(a,b,c) \ AS2( movzx esi, b)\ AS2( xor a, DWORD PTR [AS_REG_7+8*WORD_REG(si)+MAP0TO4(c)])\ #define MOV(a,b,c) \ AS2( movzx esi, b)\ AS2( mov a, DWORD PTR [AS_REG_7+8*WORD_REG(si)+MAP0TO4(c)])\ #ifdef CRYPTOPP_GENERATE_X64_MASM ALIGN 8 Rijndael_Enc_AdvancedProcessBlocks PROC FRAME rex_push_reg rsi push_reg rdi push_reg rbx push_reg r12 .endprolog mov L_REG, rcx mov AS_REG_7, ?Te@rdtable@CryptoPP@@3PA_KA mov edi, DWORD PTR [?g_cacheLineSize@CryptoPP@@3IA] #elif defined(__GNUC__) __asm__ __volatile__ ( ".intel_syntax noprefix;" #if CRYPTOPP_BOOL_X64 AS2( mov L_REG, rcx) #endif AS_PUSH_IF86(bx) AS_PUSH_IF86(bp) AS2( mov AS_REG_7, WORD_REG(si)) #else AS_PUSH_IF86(si) AS_PUSH_IF86(di) AS_PUSH_IF86(bx) AS_PUSH_IF86(bp) AS2( lea AS_REG_7, [Te]) AS2( mov edi, [g_cacheLineSize]) #endif #if CRYPTOPP_BOOL_X86 AS2( mov [ecx+16*12+16*4], esp) // save esp to L_SP AS2( lea esp, [ecx-512]) #endif // copy subkeys to stack AS2( mov WORD_REG(si), [L_KEYS_BEGIN]) AS2( mov WORD_REG(ax), 16) AS2( and WORD_REG(ax), WORD_REG(si)) AS2( movdqa xmm3, XMMWORD_PTR [WORD_REG(dx)+16+WORD_REG(ax)]) // subkey 1 (non-counter) or 2 (counter) AS2( movdqa [L_KEY12], xmm3) AS2( lea WORD_REG(ax), [WORD_REG(dx)+WORD_REG(ax)+2*16]) AS2( sub WORD_REG(ax), WORD_REG(si)) ASL(0) AS2( movdqa xmm0, [WORD_REG(ax)+WORD_REG(si)]) AS2( movdqa XMMWORD_PTR [L_SUBKEYS+WORD_REG(si)], xmm0) AS2( add WORD_REG(si), 16) AS2( cmp WORD_REG(si), 16*12) ASJ( jl, 0, b) // read subkeys 0, 1 and last AS2( movdqa xmm4, [WORD_REG(ax)+WORD_REG(si)]) // last subkey AS2( movdqa xmm1, [WORD_REG(dx)]) // subkey 0 AS2( MOVD MM(1), [WORD_REG(dx)+4*4]) // 0,1,2,3 AS2( mov ebx, [WORD_REG(dx)+5*4]) // 4,5,6,7 AS2( mov ecx, [WORD_REG(dx)+6*4]) // 8,9,10,11 AS2( mov edx, [WORD_REG(dx)+7*4]) // 12,13,14,15 // load table into cache AS2( xor WORD_REG(ax), WORD_REG(ax)) ASL(9) AS2( mov esi, [AS_REG_7+WORD_REG(ax)]) AS2( add WORD_REG(ax), WORD_REG(di)) AS2( mov esi, [AS_REG_7+WORD_REG(ax)]) AS2( add WORD_REG(ax), WORD_REG(di)) AS2( mov esi, [AS_REG_7+WORD_REG(ax)]) AS2( add WORD_REG(ax), WORD_REG(di)) AS2( mov esi, [AS_REG_7+WORD_REG(ax)]) AS2( add WORD_REG(ax), WORD_REG(di)) AS2( cmp WORD_REG(ax), 2048) ASJ( jl, 9, b) AS1( lfence) AS2( test DWORD PTR [L_LENGTH], 1) ASJ( jz, 8, f) // counter mode one-time setup AS2( mov WORD_REG(si), [L_INBLOCKS]) AS2( movdqu xmm2, [WORD_REG(si)]) // counter AS2( pxor xmm2, xmm1) AS2( psrldq xmm1, 14) AS2( movd eax, xmm1) AS2( mov al, BYTE PTR [WORD_REG(si)+15]) AS2( MOVD MM(2), eax) #if CRYPTOPP_BOOL_X86 AS2( mov eax, 1) AS2( movd mm3, eax) #endif // partial first round, in: xmm2(15,14,13,12;11,10,9,8;7,6,5,4;3,2,1,0), out: mm1, ebx, ecx, edx AS2( movd eax, xmm2) AS2( psrldq xmm2, 4) AS2( movd edi, xmm2) AS2( psrldq xmm2, 4) MXOR( 1, al, 0) // 0 XOR( edx, ah, 1) // 1 AS2( shr eax, 16) XOR( ecx, al, 2) // 2 XOR( ebx, ah, 3) // 3 AS2( mov eax, edi) AS2( movd edi, xmm2) AS2( psrldq xmm2, 4) XOR( ebx, al, 0) // 4 MXOR( 1, ah, 1) // 5 AS2( shr eax, 16) XOR( edx, al, 2) // 6 XOR( ecx, ah, 3) // 7 AS2( mov eax, edi) AS2( movd edi, xmm2) XOR( ecx, al, 0) // 8 XOR( ebx, ah, 1) // 9 AS2( shr eax, 16) MXOR( 1, al, 2) // 10 XOR( edx, ah, 3) // 11 AS2( mov eax, edi) XOR( edx, al, 0) // 12 XOR( ecx, ah, 1) // 13 AS2( shr eax, 16) XOR( ebx, al, 2) // 14 AS2( psrldq xmm2, 3) // partial second round, in: ebx(4,5,6,7), ecx(8,9,10,11), edx(12,13,14,15), out: eax, ebx, edi, mm0 AS2( mov eax, [L_KEY12+0*4]) AS2( mov edi, [L_KEY12+2*4]) AS2( MOVD MM(0), [L_KEY12+3*4]) MXOR( 0, cl, 3) /* 11 */ XOR( edi, bl, 3) /* 7 */ MXOR( 0, bh, 2) /* 6 */ AS2( shr ebx, 16) /* 4,5 */ XOR( eax, bl, 1) /* 5 */ MOV( ebx, bh, 0) /* 4 */ AS2( xor ebx, [L_KEY12+1*4]) XOR( eax, ch, 2) /* 10 */ AS2( shr ecx, 16) /* 8,9 */ XOR( eax, dl, 3) /* 15 */ XOR( ebx, dh, 2) /* 14 */ AS2( shr edx, 16) /* 12,13 */ XOR( edi, ch, 0) /* 8 */ XOR( ebx, cl, 1) /* 9 */ XOR( edi, dl, 1) /* 13 */ MXOR( 0, dh, 0) /* 12 */ AS2( movd ecx, xmm2) AS2( MOVD edx, MM(1)) AS2( MOVD [L_SAVED_X+3*4], MM(0)) AS2( mov [L_SAVED_X+0*4], eax) AS2( mov [L_SAVED_X+1*4], ebx) AS2( mov [L_SAVED_X+2*4], edi) ASJ( jmp, 5, f) ASL(3) // non-counter mode per-block setup AS2( MOVD MM(1), [L_KEY12+0*4]) // 0,1,2,3 AS2( mov ebx, [L_KEY12+1*4]) // 4,5,6,7 AS2( mov ecx, [L_KEY12+2*4]) // 8,9,10,11 AS2( mov edx, [L_KEY12+3*4]) // 12,13,14,15 ASL(8) AS2( mov WORD_REG(ax), [L_INBLOCKS]) AS2( movdqu xmm2, [WORD_REG(ax)]) AS2( mov WORD_REG(si), [L_INXORBLOCKS]) AS2( movdqu xmm5, [WORD_REG(si)]) AS2( pxor xmm2, xmm1) AS2( pxor xmm2, xmm5) // first round, in: xmm2(15,14,13,12;11,10,9,8;7,6,5,4;3,2,1,0), out: eax, ebx, ecx, edx AS2( movd eax, xmm2) AS2( psrldq xmm2, 4) AS2( movd edi, xmm2) AS2( psrldq xmm2, 4) MXOR( 1, al, 0) // 0 XOR( edx, ah, 1) // 1 AS2( shr eax, 16) XOR( ecx, al, 2) // 2 XOR( ebx, ah, 3) // 3 AS2( mov eax, edi) AS2( movd edi, xmm2) AS2( psrldq xmm2, 4) XOR( ebx, al, 0) // 4 MXOR( 1, ah, 1) // 5 AS2( shr eax, 16) XOR( edx, al, 2) // 6 XOR( ecx, ah, 3) // 7 AS2( mov eax, edi) AS2( movd edi, xmm2) XOR( ecx, al, 0) // 8 XOR( ebx, ah, 1) // 9 AS2( shr eax, 16) MXOR( 1, al, 2) // 10 XOR( edx, ah, 3) // 11 AS2( mov eax, edi) XOR( edx, al, 0) // 12 XOR( ecx, ah, 1) // 13 AS2( shr eax, 16) XOR( ebx, al, 2) // 14 MXOR( 1, ah, 3) // 15 AS2( MOVD eax, MM(1)) AS2( add L_REG, [L_KEYS_BEGIN]) AS2( add L_REG, 4*16) ASJ( jmp, 2, f) ASL(1) // counter-mode per-block setup AS2( MOVD ecx, MM(2)) AS2( MOVD edx, MM(1)) AS2( mov eax, [L_SAVED_X+0*4]) AS2( mov ebx, [L_SAVED_X+1*4]) AS2( xor cl, ch) AS2( and WORD_REG(cx), 255) ASL(5) #if CRYPTOPP_BOOL_X86 AS2( paddb MM(2), mm3) #else AS2( add MM(2), 1) #endif // remaining part of second round, in: edx(previous round),esi(keyed counter byte) eax,ebx,[L_SAVED_X+2*4],[L_SAVED_X+3*4], out: eax,ebx,ecx,edx AS2( xor edx, DWORD PTR [AS_REG_7+WORD_REG(cx)*8+3]) XOR( ebx, dl, 3) MOV( ecx, dh, 2) AS2( shr edx, 16) AS2( xor ecx, [L_SAVED_X+2*4]) XOR( eax, dh, 0) MOV( edx, dl, 1) AS2( xor edx, [L_SAVED_X+3*4]) AS2( add L_REG, [L_KEYS_BEGIN]) AS2( add L_REG, 3*16) ASJ( jmp, 4, f) // in: eax(0,1,2,3), ebx(4,5,6,7), ecx(8,9,10,11), edx(12,13,14,15) // out: eax, ebx, edi, mm0 #define ROUND() \ MXOR( 0, cl, 3) /* 11 */\ AS2( mov cl, al) /* 8,9,10,3 */\ XOR( edi, ah, 2) /* 2 */\ AS2( shr eax, 16) /* 0,1 */\ XOR( edi, bl, 3) /* 7 */\ MXOR( 0, bh, 2) /* 6 */\ AS2( shr ebx, 16) /* 4,5 */\ MXOR( 0, al, 1) /* 1 */\ MOV( eax, ah, 0) /* 0 */\ XOR( eax, bl, 1) /* 5 */\ MOV( ebx, bh, 0) /* 4 */\ XOR( eax, ch, 2) /* 10 */\ XOR( ebx, cl, 3) /* 3 */\ AS2( shr ecx, 16) /* 8,9 */\ XOR( eax, dl, 3) /* 15 */\ XOR( ebx, dh, 2) /* 14 */\ AS2( shr edx, 16) /* 12,13 */\ XOR( edi, ch, 0) /* 8 */\ XOR( ebx, cl, 1) /* 9 */\ XOR( edi, dl, 1) /* 13 */\ MXOR( 0, dh, 0) /* 12 */\ ASL(2) // 2-round loop AS2( MOVD MM(0), [L_SUBKEYS-4*16+3*4]) AS2( mov edi, [L_SUBKEYS-4*16+2*4]) ROUND() AS2( mov ecx, edi) AS2( xor eax, [L_SUBKEYS-4*16+0*4]) AS2( xor ebx, [L_SUBKEYS-4*16+1*4]) AS2( MOVD edx, MM(0)) ASL(4) AS2( MOVD MM(0), [L_SUBKEYS-4*16+7*4]) AS2( mov edi, [L_SUBKEYS-4*16+6*4]) ROUND() AS2( mov ecx, edi) AS2( xor eax, [L_SUBKEYS-4*16+4*4]) AS2( xor ebx, [L_SUBKEYS-4*16+5*4]) AS2( MOVD edx, MM(0)) AS2( add L_REG, 32) AS2( test L_REG, 255) ASJ( jnz, 2, b) AS2( sub L_REG, 16*16) #define LAST(a, b, c) \ AS2( movzx esi, a )\ AS2( movzx edi, BYTE PTR [AS_REG_7+WORD_REG(si)*8+1] )\ AS2( movzx esi, b )\ AS2( xor edi, DWORD PTR [AS_REG_7+WORD_REG(si)*8+0] )\ AS2( mov WORD PTR [L_LASTROUND+c], di )\ // last round LAST(ch, dl, 2) LAST(dh, al, 6) AS2( shr edx, 16) LAST(ah, bl, 10) AS2( shr eax, 16) LAST(bh, cl, 14) AS2( shr ebx, 16) LAST(dh, al, 12) AS2( shr ecx, 16) LAST(ah, bl, 0) LAST(bh, cl, 4) LAST(ch, dl, 8) AS2( mov WORD_REG(ax), [L_OUTXORBLOCKS]) AS2( mov WORD_REG(bx), [L_OUTBLOCKS]) AS2( mov WORD_REG(cx), [L_LENGTH]) AS2( sub WORD_REG(cx), 16) AS2( movdqu xmm2, [WORD_REG(ax)]) AS2( pxor xmm2, xmm4) #if CRYPTOPP_BOOL_X86 AS2( movdqa xmm0, [L_INCREMENTS]) AS2( paddd xmm0, [L_INBLOCKS]) AS2( movdqa [L_INBLOCKS], xmm0) #else AS2( movdqa xmm0, [L_INCREMENTS+16]) AS2( paddq xmm0, [L_INBLOCKS+16]) AS2( movdqa [L_INBLOCKS+16], xmm0) #endif AS2( pxor xmm2, [L_LASTROUND]) AS2( movdqu [WORD_REG(bx)], xmm2) ASJ( jle, 7, f) AS2( mov [L_LENGTH], WORD_REG(cx)) AS2( test WORD_REG(cx), 1) ASJ( jnz, 1, b) #if CRYPTOPP_BOOL_X64 AS2( movdqa xmm0, [L_INCREMENTS]) AS2( paddq xmm0, [L_INBLOCKS]) AS2( movdqa [L_INBLOCKS], xmm0) #endif ASJ( jmp, 3, b) ASL(7) // erase keys on stack AS2( xorps xmm0, xmm0) AS2( lea WORD_REG(ax), [L_SUBKEYS+7*16]) AS2( movaps [WORD_REG(ax)-7*16], xmm0) AS2( movaps [WORD_REG(ax)-6*16], xmm0) AS2( movaps [WORD_REG(ax)-5*16], xmm0) AS2( movaps [WORD_REG(ax)-4*16], xmm0) AS2( movaps [WORD_REG(ax)-3*16], xmm0) AS2( movaps [WORD_REG(ax)-2*16], xmm0) AS2( movaps [WORD_REG(ax)-1*16], xmm0) AS2( movaps [WORD_REG(ax)+0*16], xmm0) AS2( movaps [WORD_REG(ax)+1*16], xmm0) AS2( movaps [WORD_REG(ax)+2*16], xmm0) AS2( movaps [WORD_REG(ax)+3*16], xmm0) AS2( movaps [WORD_REG(ax)+4*16], xmm0) AS2( movaps [WORD_REG(ax)+5*16], xmm0) AS2( movaps [WORD_REG(ax)+6*16], xmm0) #if CRYPTOPP_BOOL_X86 AS2( mov esp, [L_SP]) AS1( emms) #endif AS_POP_IF86(bp) AS_POP_IF86(bx) #if defined(_MSC_VER) && CRYPTOPP_BOOL_X86 AS_POP_IF86(di) AS_POP_IF86(si) AS1(ret) #endif #ifdef CRYPTOPP_GENERATE_X64_MASM pop r12 pop rbx pop rdi pop rsi ret Rijndael_Enc_AdvancedProcessBlocks ENDP #endif #ifdef __GNUC__ ".att_syntax prefix;" : : "c" (locals), "d" (k), "S" (Te), "D" (g_cacheLineSize) : "memory", "cc", "%eax" #if CRYPTOPP_BOOL_X64 , "%rbx", "%r8", "%r9", "%r10", "%r11", "%r12" #endif ); #endif } #endif #ifndef CRYPTOPP_GENERATE_X64_MASM #ifdef CRYPTOPP_X64_MASM_AVAILABLE extern "C" { void Rijndael_Enc_AdvancedProcessBlocks(void *locals, const word32 *k); } #endif #if CRYPTOPP_BOOL_X64 || CRYPTOPP_BOOL_X86 static inline bool AliasedWithTable(const byte *begin, const byte *end) { size_t s0 = size_t(begin)%4096, s1 = size_t(end)%4096; size_t t0 = size_t(Te)%4096, t1 = (size_t(Te)+sizeof(Te))%4096; if (t1 > t0) return (s0 >= t0 && s0 < t1) || (s1 > t0 && s1 <= t1); else return (s0 < t1 || s1 <= t1) || (s0 >= t0 || s1 > t0); } #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE inline void AESNI_Enc_Block(__m128i &block, const __m128i *subkeys, unsigned int rounds) { block = _mm_xor_si128(block, subkeys[0]); for (unsigned int i=1; i inline size_t AESNI_AdvancedProcessBlocks(F1 func1, F4 func4, const __m128i *subkeys, unsigned int rounds, const byte *inBlocks, const byte *xorBlocks, byte *outBlocks, size_t length, word32 flags) { size_t blockSize = 16; size_t inIncrement = (flags & (BlockTransformation::BT_InBlockIsCounter|BlockTransformation::BT_DontIncrementInOutPointers)) ? 0 : blockSize; size_t xorIncrement = xorBlocks ? blockSize : 0; size_t outIncrement = (flags & BlockTransformation::BT_DontIncrementInOutPointers) ? 0 : blockSize; if (flags & BlockTransformation::BT_ReverseDirection) { assert(length % blockSize == 0); inBlocks += length - blockSize; xorBlocks += length - blockSize; outBlocks += length - blockSize; inIncrement = 0-inIncrement; xorIncrement = 0-xorIncrement; outIncrement = 0-outIncrement; } if (flags & BlockTransformation::BT_AllowParallel) { while (length >= 4*blockSize) { __m128i block0 = _mm_loadu_si128((const __m128i *)inBlocks), block1, block2, block3; if (flags & BlockTransformation::BT_InBlockIsCounter) { const __m128i be1 = *(const __m128i *)s_one; block1 = _mm_add_epi32(block0, be1); block2 = _mm_add_epi32(block1, be1); block3 = _mm_add_epi32(block2, be1); _mm_storeu_si128((__m128i *)inBlocks, _mm_add_epi32(block3, be1)); } else { inBlocks += inIncrement; block1 = _mm_loadu_si128((const __m128i *)inBlocks); inBlocks += inIncrement; block2 = _mm_loadu_si128((const __m128i *)inBlocks); inBlocks += inIncrement; block3 = _mm_loadu_si128((const __m128i *)inBlocks); inBlocks += inIncrement; } if (flags & BlockTransformation::BT_XorInput) { block0 = _mm_xor_si128(block0, _mm_loadu_si128((const __m128i *)xorBlocks)); xorBlocks += xorIncrement; block1 = _mm_xor_si128(block1, _mm_loadu_si128((const __m128i *)xorBlocks)); xorBlocks += xorIncrement; block2 = _mm_xor_si128(block2, _mm_loadu_si128((const __m128i *)xorBlocks)); xorBlocks += xorIncrement; block3 = _mm_xor_si128(block3, _mm_loadu_si128((const __m128i *)xorBlocks)); xorBlocks += xorIncrement; } func4(block0, block1, block2, block3, subkeys, rounds); if (xorBlocks && !(flags & BlockTransformation::BT_XorInput)) { block0 = _mm_xor_si128(block0, _mm_loadu_si128((const __m128i *)xorBlocks)); xorBlocks += xorIncrement; block1 = _mm_xor_si128(block1, _mm_loadu_si128((const __m128i *)xorBlocks)); xorBlocks += xorIncrement; block2 = _mm_xor_si128(block2, _mm_loadu_si128((const __m128i *)xorBlocks)); xorBlocks += xorIncrement; block3 = _mm_xor_si128(block3, _mm_loadu_si128((const __m128i *)xorBlocks)); xorBlocks += xorIncrement; } _mm_storeu_si128((__m128i *)outBlocks, block0); outBlocks += outIncrement; _mm_storeu_si128((__m128i *)outBlocks, block1); outBlocks += outIncrement; _mm_storeu_si128((__m128i *)outBlocks, block2); outBlocks += outIncrement; _mm_storeu_si128((__m128i *)outBlocks, block3); outBlocks += outIncrement; length -= 4*blockSize; } } while (length >= blockSize) { __m128i block = _mm_loadu_si128((const __m128i *)inBlocks); if (flags & BlockTransformation::BT_XorInput) block = _mm_xor_si128(block, _mm_loadu_si128((const __m128i *)xorBlocks)); if (flags & BlockTransformation::BT_InBlockIsCounter) const_cast(inBlocks)[15]++; func1(block, subkeys, rounds); if (xorBlocks && !(flags & BlockTransformation::BT_XorInput)) block = _mm_xor_si128(block, _mm_loadu_si128((const __m128i *)xorBlocks)); _mm_storeu_si128((__m128i *)outBlocks, block); inBlocks += inIncrement; outBlocks += outIncrement; xorBlocks += xorIncrement; length -= blockSize; } return length; } #endif size_t Rijndael::Enc::AdvancedProcessBlocks(const byte *inBlocks, const byte *xorBlocks, byte *outBlocks, size_t length, word32 flags) const { #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE if (HasAESNI()) return AESNI_AdvancedProcessBlocks(AESNI_Enc_Block, AESNI_Enc_4_Blocks, (const __m128i *)m_key.begin(), m_rounds, inBlocks, xorBlocks, outBlocks, length, flags); #endif #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE || defined(CRYPTOPP_X64_MASM_AVAILABLE) if (HasSSE2()) { if (length < BLOCKSIZE) return length; struct Locals { word32 subkeys[4*12], workspace[8]; const byte *inBlocks, *inXorBlocks, *outXorBlocks; byte *outBlocks; size_t inIncrement, inXorIncrement, outXorIncrement, outIncrement; size_t regSpill, lengthAndCounterFlag, keysBegin; }; size_t increment = BLOCKSIZE; const byte* zeros = (byte *)(Te+256); byte *space; do { space = (byte *)alloca(255+sizeof(Locals)); space += (256-(size_t)space%256)%256; } while (AliasedWithTable(space, space+sizeof(Locals))); if (flags & BT_ReverseDirection) { assert(length % BLOCKSIZE == 0); inBlocks += length - BLOCKSIZE; xorBlocks += length - BLOCKSIZE; outBlocks += length - BLOCKSIZE; increment = 0-increment; } Locals &locals = *(Locals *)space; locals.inBlocks = inBlocks; locals.inXorBlocks = (flags & BT_XorInput) && xorBlocks ? xorBlocks : zeros; locals.outXorBlocks = (flags & BT_XorInput) || !xorBlocks ? zeros : xorBlocks; locals.outBlocks = outBlocks; locals.inIncrement = (flags & BT_DontIncrementInOutPointers) ? 0 : increment; locals.inXorIncrement = (flags & BT_XorInput) && xorBlocks ? increment : 0; locals.outXorIncrement = (flags & BT_XorInput) || !xorBlocks ? 0 : increment; locals.outIncrement = (flags & BT_DontIncrementInOutPointers) ? 0 : increment; locals.lengthAndCounterFlag = length - (length%16) - bool(flags & BT_InBlockIsCounter); int keysToCopy = m_rounds - (flags & BT_InBlockIsCounter ? 3 : 2); locals.keysBegin = (12-keysToCopy)*16; Rijndael_Enc_AdvancedProcessBlocks(&locals, m_key); return length % BLOCKSIZE; } #endif return BlockTransformation::AdvancedProcessBlocks(inBlocks, xorBlocks, outBlocks, length, flags); } #endif #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE size_t Rijndael::Dec::AdvancedProcessBlocks(const byte *inBlocks, const byte *xorBlocks, byte *outBlocks, size_t length, word32 flags) const { if (HasAESNI()) return AESNI_AdvancedProcessBlocks(AESNI_Dec_Block, AESNI_Dec_4_Blocks, (const __m128i *)m_key.begin(), m_rounds, inBlocks, xorBlocks, outBlocks, length, flags); return BlockTransformation::AdvancedProcessBlocks(inBlocks, xorBlocks, outBlocks, length, flags); } #endif // #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE NAMESPACE_END #endif #endif armory-0.92.3/cppForSwig/cryptopp/eax.h0000755000000000000000000000512212414772654016524 0ustar rootroot#ifndef CRYPTOPP_EAX_H #define CRYPTOPP_EAX_H #include "authenc.h" #include "modes.h" #include "cmac.h" NAMESPACE_BEGIN(CryptoPP) //! . class CRYPTOPP_NO_VTABLE EAX_Base : public AuthenticatedSymmetricCipherBase { public: // AuthenticatedSymmetricCipher std::string AlgorithmName() const {return GetMAC().GetCipher().AlgorithmName() + std::string("/EAX");} size_t MinKeyLength() const {return GetMAC().MinKeyLength();} size_t MaxKeyLength() const {return GetMAC().MaxKeyLength();} size_t DefaultKeyLength() const {return GetMAC().DefaultKeyLength();} size_t GetValidKeyLength(size_t n) const {return GetMAC().GetValidKeyLength(n);} bool IsValidKeyLength(size_t n) const {return GetMAC().IsValidKeyLength(n);} unsigned int OptimalDataAlignment() const {return GetMAC().OptimalDataAlignment();} IV_Requirement IVRequirement() const {return UNIQUE_IV;} unsigned int IVSize() const {return GetMAC().TagSize();} unsigned int MinIVLength() const {return 0;} unsigned int MaxIVLength() const {return UINT_MAX;} unsigned int DigestSize() const {return GetMAC().TagSize();} lword MaxHeaderLength() const {return LWORD_MAX;} lword MaxMessageLength() const {return LWORD_MAX;} protected: // AuthenticatedSymmetricCipherBase bool AuthenticationIsOnPlaintext() const {return false;} unsigned int AuthenticationBlockSize() const {return 1;} void SetKeyWithoutResync(const byte *userKey, size_t keylength, const NameValuePairs ¶ms); void Resync(const byte *iv, size_t len); size_t AuthenticateBlocks(const byte *data, size_t len); void AuthenticateLastHeaderBlock(); void AuthenticateLastFooterBlock(byte *mac, size_t macSize); SymmetricCipher & AccessSymmetricCipher() {return m_ctr;} const CMAC_Base & GetMAC() const {return const_cast(this)->AccessMAC();} virtual CMAC_Base & AccessMAC() =0; CTR_Mode_ExternalCipher::Encryption m_ctr; }; //! . template class EAX_Final : public EAX_Base { public: static std::string StaticAlgorithmName() {return T_BlockCipher::StaticAlgorithmName() + std::string("/EAX");} bool IsForwardTransformation() const {return T_IsEncryption;} private: CMAC_Base & AccessMAC() {return m_cmac;} CMAC m_cmac; }; #ifdef EAX // EAX is defined to 11 on GCC 3.4.3, OpenSolaris 8.11 #undef EAX #endif /// EAX template struct EAX : public AuthenticatedSymmetricCipherDocumentation { typedef EAX_Final Encryption; typedef EAX_Final Decryption; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/salsa.cpp0000755000000000000000000005423012414772654017411 0ustar rootroot// salsa.cpp - written and placed in the public domain by Wei Dai // use "cl /EP /P /DCRYPTOPP_GENERATE_X64_MASM salsa.cpp" to generate MASM code #include "pch.h" #ifndef CRYPTOPP_GENERATE_X64_MASM #include "salsa.h" #include "misc.h" #include "argnames.h" #include "cpu.h" NAMESPACE_BEGIN(CryptoPP) void Salsa20_TestInstantiations() { Salsa20::Encryption x; } void Salsa20_Policy::CipherSetKey(const NameValuePairs ¶ms, const byte *key, size_t length) { m_rounds = params.GetIntValueWithDefault(Name::Rounds(), 20); if (!(m_rounds == 8 || m_rounds == 12 || m_rounds == 20)) throw InvalidRounds(Salsa20::StaticAlgorithmName(), m_rounds); // m_state is reordered for SSE2 GetBlock get1(key); get1(m_state[13])(m_state[10])(m_state[7])(m_state[4]); GetBlock get2(key + length - 16); get2(m_state[15])(m_state[12])(m_state[9])(m_state[6]); // "expand 16-byte k" or "expand 32-byte k" m_state[0] = 0x61707865; m_state[1] = (length == 16) ? 0x3120646e : 0x3320646e; m_state[2] = (length == 16) ? 0x79622d36 : 0x79622d32; m_state[3] = 0x6b206574; } void Salsa20_Policy::CipherResynchronize(byte *keystreamBuffer, const byte *IV, size_t length) { assert(length==8); GetBlock get(IV); get(m_state[14])(m_state[11]); m_state[8] = m_state[5] = 0; } void Salsa20_Policy::SeekToIteration(lword iterationCount) { m_state[8] = (word32)iterationCount; m_state[5] = (word32)SafeRightShift<32>(iterationCount); } #if CRYPTOPP_BOOL_X86 || CRYPTOPP_BOOL_X64 unsigned int Salsa20_Policy::GetAlignment() const { #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE if (HasSSE2()) return 16; else #endif return GetAlignmentOf(); } unsigned int Salsa20_Policy::GetOptimalBlockSize() const { #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE if (HasSSE2()) return 4*BYTES_PER_ITERATION; else #endif return BYTES_PER_ITERATION; } #endif #ifdef CRYPTOPP_X64_MASM_AVAILABLE extern "C" { void Salsa20_OperateKeystream(byte *output, const byte *input, size_t iterationCount, int rounds, void *state); } #endif #pragma warning(disable: 4731) // frame pointer register 'ebp' modified by inline assembly code void Salsa20_Policy::OperateKeystream(KeystreamOperation operation, byte *output, const byte *input, size_t iterationCount) { #endif // #ifdef CRYPTOPP_GENERATE_X64_MASM #ifdef CRYPTOPP_X64_MASM_AVAILABLE Salsa20_OperateKeystream(output, input, iterationCount, m_rounds, m_state.data()); return; #endif #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE #ifdef CRYPTOPP_GENERATE_X64_MASM ALIGN 8 Salsa20_OperateKeystream PROC FRAME mov r10, [rsp + 5*8] ; state alloc_stack(10*16 + 32*16 + 8) save_xmm128 xmm6, 0200h save_xmm128 xmm7, 0210h save_xmm128 xmm8, 0220h save_xmm128 xmm9, 0230h save_xmm128 xmm10, 0240h save_xmm128 xmm11, 0250h save_xmm128 xmm12, 0260h save_xmm128 xmm13, 0270h save_xmm128 xmm14, 0280h save_xmm128 xmm15, 0290h .endprolog #define REG_output rcx #define REG_input rdx #define REG_iterationCount r8 #define REG_state r10 #define REG_rounds e9d #define REG_roundsLeft eax #define REG_temp32 r11d #define REG_temp r11 #define SSE2_WORKSPACE rsp #else if (HasSSE2()) { #if CRYPTOPP_BOOL_X64 #define REG_output %4 #define REG_input %1 #define REG_iterationCount %2 #define REG_state %3 #define REG_rounds %0 #define REG_roundsLeft eax #define REG_temp32 edx #define REG_temp rdx #define SSE2_WORKSPACE %5 FixedSizeAlignedSecBlock workspace; #else #define REG_output edi #define REG_input eax #define REG_iterationCount ecx #define REG_state esi #define REG_rounds edx #define REG_roundsLeft ebx #define REG_temp32 ebp #define REG_temp ebp #define SSE2_WORKSPACE esp + WORD_SZ #endif #ifdef __GNUC__ __asm__ __volatile__ ( ".intel_syntax noprefix;" AS_PUSH_IF86( bx) #else void *s = m_state.data(); word32 r = m_rounds; AS2( mov REG_iterationCount, iterationCount) AS2( mov REG_input, input) AS2( mov REG_output, output) AS2( mov REG_state, s) AS2( mov REG_rounds, r) #endif #endif // #ifndef CRYPTOPP_GENERATE_X64_MASM AS_PUSH_IF86( bp) AS2( cmp REG_iterationCount, 4) ASJ( jl, 5, f) #if CRYPTOPP_BOOL_X86 AS2( mov ebx, esp) AS2( and esp, -16) AS2( sub esp, 32*16) AS1( push ebx) #endif #define SSE2_EXPAND_S(i, j) \ ASS( pshufd xmm4, xmm##i, j, j, j, j) \ AS2( movdqa [SSE2_WORKSPACE + (i*4+j)*16 + 256], xmm4) AS2( movdqa xmm0, [REG_state + 0*16]) AS2( movdqa xmm1, [REG_state + 1*16]) AS2( movdqa xmm2, [REG_state + 2*16]) AS2( movdqa xmm3, [REG_state + 3*16]) SSE2_EXPAND_S(0, 0) SSE2_EXPAND_S(0, 1) SSE2_EXPAND_S(0, 2) SSE2_EXPAND_S(0, 3) SSE2_EXPAND_S(1, 0) SSE2_EXPAND_S(1, 2) SSE2_EXPAND_S(1, 3) SSE2_EXPAND_S(2, 1) SSE2_EXPAND_S(2, 2) SSE2_EXPAND_S(2, 3) SSE2_EXPAND_S(3, 0) SSE2_EXPAND_S(3, 1) SSE2_EXPAND_S(3, 2) SSE2_EXPAND_S(3, 3) #define SSE2_EXPAND_S85(i) \ AS2( mov dword ptr [SSE2_WORKSPACE + 8*16 + i*4 + 256], REG_roundsLeft) \ AS2( mov dword ptr [SSE2_WORKSPACE + 5*16 + i*4 + 256], REG_temp32) \ AS2( add REG_roundsLeft, 1) \ AS2( adc REG_temp32, 0) ASL(1) AS2( mov REG_roundsLeft, dword ptr [REG_state + 8*4]) AS2( mov REG_temp32, dword ptr [REG_state + 5*4]) SSE2_EXPAND_S85(0) SSE2_EXPAND_S85(1) SSE2_EXPAND_S85(2) SSE2_EXPAND_S85(3) AS2( mov dword ptr [REG_state + 8*4], REG_roundsLeft) AS2( mov dword ptr [REG_state + 5*4], REG_temp32) #define SSE2_QUARTER_ROUND(a, b, d, i) \ AS2( movdqa xmm4, xmm##d) \ AS2( paddd xmm4, xmm##a) \ AS2( movdqa xmm5, xmm4) \ AS2( pslld xmm4, i) \ AS2( psrld xmm5, 32-i) \ AS2( pxor xmm##b, xmm4) \ AS2( pxor xmm##b, xmm5) #define L01(A,B,C,D,a,b,c,d,i) AS2( movdqa xmm##A, [SSE2_WORKSPACE + d*16 + i*256]) /* y3 */ #define L02(A,B,C,D,a,b,c,d,i) AS2( movdqa xmm##C, [SSE2_WORKSPACE + a*16 + i*256]) /* y0 */ #define L03(A,B,C,D,a,b,c,d,i) AS2( paddd xmm##A, xmm##C) /* y0+y3 */ #define L04(A,B,C,D,a,b,c,d,i) AS2( movdqa xmm##B, xmm##A) #define L05(A,B,C,D,a,b,c,d,i) AS2( pslld xmm##A, 7) #define L06(A,B,C,D,a,b,c,d,i) AS2( psrld xmm##B, 32-7) #define L07(A,B,C,D,a,b,c,d,i) AS2( pxor xmm##A, [SSE2_WORKSPACE + b*16 + i*256]) #define L08(A,B,C,D,a,b,c,d,i) AS2( pxor xmm##A, xmm##B) /* z1 */ #define L09(A,B,C,D,a,b,c,d,i) AS2( movdqa [SSE2_WORKSPACE + b*16], xmm##A) #define L10(A,B,C,D,a,b,c,d,i) AS2( movdqa xmm##B, xmm##A) #define L11(A,B,C,D,a,b,c,d,i) AS2( paddd xmm##A, xmm##C) /* z1+y0 */ #define L12(A,B,C,D,a,b,c,d,i) AS2( movdqa xmm##D, xmm##A) #define L13(A,B,C,D,a,b,c,d,i) AS2( pslld xmm##A, 9) #define L14(A,B,C,D,a,b,c,d,i) AS2( psrld xmm##D, 32-9) #define L15(A,B,C,D,a,b,c,d,i) AS2( pxor xmm##A, [SSE2_WORKSPACE + c*16 + i*256]) #define L16(A,B,C,D,a,b,c,d,i) AS2( pxor xmm##A, xmm##D) /* z2 */ #define L17(A,B,C,D,a,b,c,d,i) AS2( movdqa [SSE2_WORKSPACE + c*16], xmm##A) #define L18(A,B,C,D,a,b,c,d,i) AS2( movdqa xmm##D, xmm##A) #define L19(A,B,C,D,a,b,c,d,i) AS2( paddd xmm##A, xmm##B) /* z2+z1 */ #define L20(A,B,C,D,a,b,c,d,i) AS2( movdqa xmm##B, xmm##A) #define L21(A,B,C,D,a,b,c,d,i) AS2( pslld xmm##A, 13) #define L22(A,B,C,D,a,b,c,d,i) AS2( psrld xmm##B, 32-13) #define L23(A,B,C,D,a,b,c,d,i) AS2( pxor xmm##A, [SSE2_WORKSPACE + d*16 + i*256]) #define L24(A,B,C,D,a,b,c,d,i) AS2( pxor xmm##A, xmm##B) /* z3 */ #define L25(A,B,C,D,a,b,c,d,i) AS2( movdqa [SSE2_WORKSPACE + d*16], xmm##A) #define L26(A,B,C,D,a,b,c,d,i) AS2( paddd xmm##A, xmm##D) /* z3+z2 */ #define L27(A,B,C,D,a,b,c,d,i) AS2( movdqa xmm##D, xmm##A) #define L28(A,B,C,D,a,b,c,d,i) AS2( pslld xmm##A, 18) #define L29(A,B,C,D,a,b,c,d,i) AS2( psrld xmm##D, 32-18) #define L30(A,B,C,D,a,b,c,d,i) AS2( pxor xmm##A, xmm##C) /* xor y0 */ #define L31(A,B,C,D,a,b,c,d,i) AS2( pxor xmm##A, xmm##D) /* z0 */ #define L32(A,B,C,D,a,b,c,d,i) AS2( movdqa [SSE2_WORKSPACE + a*16], xmm##A) #define SSE2_QUARTER_ROUND_X8(i, a, b, c, d, e, f, g, h) \ L01(0,1,2,3, a,b,c,d, i) L01(4,5,6,7, e,f,g,h, i) \ L02(0,1,2,3, a,b,c,d, i) L02(4,5,6,7, e,f,g,h, i) \ L03(0,1,2,3, a,b,c,d, i) L03(4,5,6,7, e,f,g,h, i) \ L04(0,1,2,3, a,b,c,d, i) L04(4,5,6,7, e,f,g,h, i) \ L05(0,1,2,3, a,b,c,d, i) L05(4,5,6,7, e,f,g,h, i) \ L06(0,1,2,3, a,b,c,d, i) L06(4,5,6,7, e,f,g,h, i) \ L07(0,1,2,3, a,b,c,d, i) L07(4,5,6,7, e,f,g,h, i) \ L08(0,1,2,3, a,b,c,d, i) L08(4,5,6,7, e,f,g,h, i) \ L09(0,1,2,3, a,b,c,d, i) L09(4,5,6,7, e,f,g,h, i) \ L10(0,1,2,3, a,b,c,d, i) L10(4,5,6,7, e,f,g,h, i) \ L11(0,1,2,3, a,b,c,d, i) L11(4,5,6,7, e,f,g,h, i) \ L12(0,1,2,3, a,b,c,d, i) L12(4,5,6,7, e,f,g,h, i) \ L13(0,1,2,3, a,b,c,d, i) L13(4,5,6,7, e,f,g,h, i) \ L14(0,1,2,3, a,b,c,d, i) L14(4,5,6,7, e,f,g,h, i) \ L15(0,1,2,3, a,b,c,d, i) L15(4,5,6,7, e,f,g,h, i) \ L16(0,1,2,3, a,b,c,d, i) L16(4,5,6,7, e,f,g,h, i) \ L17(0,1,2,3, a,b,c,d, i) L17(4,5,6,7, e,f,g,h, i) \ L18(0,1,2,3, a,b,c,d, i) L18(4,5,6,7, e,f,g,h, i) \ L19(0,1,2,3, a,b,c,d, i) L19(4,5,6,7, e,f,g,h, i) \ L20(0,1,2,3, a,b,c,d, i) L20(4,5,6,7, e,f,g,h, i) \ L21(0,1,2,3, a,b,c,d, i) L21(4,5,6,7, e,f,g,h, i) \ L22(0,1,2,3, a,b,c,d, i) L22(4,5,6,7, e,f,g,h, i) \ L23(0,1,2,3, a,b,c,d, i) L23(4,5,6,7, e,f,g,h, i) \ L24(0,1,2,3, a,b,c,d, i) L24(4,5,6,7, e,f,g,h, i) \ L25(0,1,2,3, a,b,c,d, i) L25(4,5,6,7, e,f,g,h, i) \ L26(0,1,2,3, a,b,c,d, i) L26(4,5,6,7, e,f,g,h, i) \ L27(0,1,2,3, a,b,c,d, i) L27(4,5,6,7, e,f,g,h, i) \ L28(0,1,2,3, a,b,c,d, i) L28(4,5,6,7, e,f,g,h, i) \ L29(0,1,2,3, a,b,c,d, i) L29(4,5,6,7, e,f,g,h, i) \ L30(0,1,2,3, a,b,c,d, i) L30(4,5,6,7, e,f,g,h, i) \ L31(0,1,2,3, a,b,c,d, i) L31(4,5,6,7, e,f,g,h, i) \ L32(0,1,2,3, a,b,c,d, i) L32(4,5,6,7, e,f,g,h, i) #define SSE2_QUARTER_ROUND_X16(i, a, b, c, d, e, f, g, h, A, B, C, D, E, F, G, H) \ L01(0,1,2,3, a,b,c,d, i) L01(4,5,6,7, e,f,g,h, i) L01(8,9,10,11, A,B,C,D, i) L01(12,13,14,15, E,F,G,H, i) \ L02(0,1,2,3, a,b,c,d, i) L02(4,5,6,7, e,f,g,h, i) L02(8,9,10,11, A,B,C,D, i) L02(12,13,14,15, E,F,G,H, i) \ L03(0,1,2,3, a,b,c,d, i) L03(4,5,6,7, e,f,g,h, i) L03(8,9,10,11, A,B,C,D, i) L03(12,13,14,15, E,F,G,H, i) \ L04(0,1,2,3, a,b,c,d, i) L04(4,5,6,7, e,f,g,h, i) L04(8,9,10,11, A,B,C,D, i) L04(12,13,14,15, E,F,G,H, i) \ L05(0,1,2,3, a,b,c,d, i) L05(4,5,6,7, e,f,g,h, i) L05(8,9,10,11, A,B,C,D, i) L05(12,13,14,15, E,F,G,H, i) \ L06(0,1,2,3, a,b,c,d, i) L06(4,5,6,7, e,f,g,h, i) L06(8,9,10,11, A,B,C,D, i) L06(12,13,14,15, E,F,G,H, i) \ L07(0,1,2,3, a,b,c,d, i) L07(4,5,6,7, e,f,g,h, i) L07(8,9,10,11, A,B,C,D, i) L07(12,13,14,15, E,F,G,H, i) \ L08(0,1,2,3, a,b,c,d, i) L08(4,5,6,7, e,f,g,h, i) L08(8,9,10,11, A,B,C,D, i) L08(12,13,14,15, E,F,G,H, i) \ L09(0,1,2,3, a,b,c,d, i) L09(4,5,6,7, e,f,g,h, i) L09(8,9,10,11, A,B,C,D, i) L09(12,13,14,15, E,F,G,H, i) \ L10(0,1,2,3, a,b,c,d, i) L10(4,5,6,7, e,f,g,h, i) L10(8,9,10,11, A,B,C,D, i) L10(12,13,14,15, E,F,G,H, i) \ L11(0,1,2,3, a,b,c,d, i) L11(4,5,6,7, e,f,g,h, i) L11(8,9,10,11, A,B,C,D, i) L11(12,13,14,15, E,F,G,H, i) \ L12(0,1,2,3, a,b,c,d, i) L12(4,5,6,7, e,f,g,h, i) L12(8,9,10,11, A,B,C,D, i) L12(12,13,14,15, E,F,G,H, i) \ L13(0,1,2,3, a,b,c,d, i) L13(4,5,6,7, e,f,g,h, i) L13(8,9,10,11, A,B,C,D, i) L13(12,13,14,15, E,F,G,H, i) \ L14(0,1,2,3, a,b,c,d, i) L14(4,5,6,7, e,f,g,h, i) L14(8,9,10,11, A,B,C,D, i) L14(12,13,14,15, E,F,G,H, i) \ L15(0,1,2,3, a,b,c,d, i) L15(4,5,6,7, e,f,g,h, i) L15(8,9,10,11, A,B,C,D, i) L15(12,13,14,15, E,F,G,H, i) \ L16(0,1,2,3, a,b,c,d, i) L16(4,5,6,7, e,f,g,h, i) L16(8,9,10,11, A,B,C,D, i) L16(12,13,14,15, E,F,G,H, i) \ L17(0,1,2,3, a,b,c,d, i) L17(4,5,6,7, e,f,g,h, i) L17(8,9,10,11, A,B,C,D, i) L17(12,13,14,15, E,F,G,H, i) \ L18(0,1,2,3, a,b,c,d, i) L18(4,5,6,7, e,f,g,h, i) L18(8,9,10,11, A,B,C,D, i) L18(12,13,14,15, E,F,G,H, i) \ L19(0,1,2,3, a,b,c,d, i) L19(4,5,6,7, e,f,g,h, i) L19(8,9,10,11, A,B,C,D, i) L19(12,13,14,15, E,F,G,H, i) \ L20(0,1,2,3, a,b,c,d, i) L20(4,5,6,7, e,f,g,h, i) L20(8,9,10,11, A,B,C,D, i) L20(12,13,14,15, E,F,G,H, i) \ L21(0,1,2,3, a,b,c,d, i) L21(4,5,6,7, e,f,g,h, i) L21(8,9,10,11, A,B,C,D, i) L21(12,13,14,15, E,F,G,H, i) \ L22(0,1,2,3, a,b,c,d, i) L22(4,5,6,7, e,f,g,h, i) L22(8,9,10,11, A,B,C,D, i) L22(12,13,14,15, E,F,G,H, i) \ L23(0,1,2,3, a,b,c,d, i) L23(4,5,6,7, e,f,g,h, i) L23(8,9,10,11, A,B,C,D, i) L23(12,13,14,15, E,F,G,H, i) \ L24(0,1,2,3, a,b,c,d, i) L24(4,5,6,7, e,f,g,h, i) L24(8,9,10,11, A,B,C,D, i) L24(12,13,14,15, E,F,G,H, i) \ L25(0,1,2,3, a,b,c,d, i) L25(4,5,6,7, e,f,g,h, i) L25(8,9,10,11, A,B,C,D, i) L25(12,13,14,15, E,F,G,H, i) \ L26(0,1,2,3, a,b,c,d, i) L26(4,5,6,7, e,f,g,h, i) L26(8,9,10,11, A,B,C,D, i) L26(12,13,14,15, E,F,G,H, i) \ L27(0,1,2,3, a,b,c,d, i) L27(4,5,6,7, e,f,g,h, i) L27(8,9,10,11, A,B,C,D, i) L27(12,13,14,15, E,F,G,H, i) \ L28(0,1,2,3, a,b,c,d, i) L28(4,5,6,7, e,f,g,h, i) L28(8,9,10,11, A,B,C,D, i) L28(12,13,14,15, E,F,G,H, i) \ L29(0,1,2,3, a,b,c,d, i) L29(4,5,6,7, e,f,g,h, i) L29(8,9,10,11, A,B,C,D, i) L29(12,13,14,15, E,F,G,H, i) \ L30(0,1,2,3, a,b,c,d, i) L30(4,5,6,7, e,f,g,h, i) L30(8,9,10,11, A,B,C,D, i) L30(12,13,14,15, E,F,G,H, i) \ L31(0,1,2,3, a,b,c,d, i) L31(4,5,6,7, e,f,g,h, i) L31(8,9,10,11, A,B,C,D, i) L31(12,13,14,15, E,F,G,H, i) \ L32(0,1,2,3, a,b,c,d, i) L32(4,5,6,7, e,f,g,h, i) L32(8,9,10,11, A,B,C,D, i) L32(12,13,14,15, E,F,G,H, i) #if CRYPTOPP_BOOL_X64 SSE2_QUARTER_ROUND_X16(1, 0, 4, 8, 12, 1, 5, 9, 13, 2, 6, 10, 14, 3, 7, 11, 15) #else SSE2_QUARTER_ROUND_X8(1, 2, 6, 10, 14, 3, 7, 11, 15) SSE2_QUARTER_ROUND_X8(1, 0, 4, 8, 12, 1, 5, 9, 13) #endif AS2( mov REG_roundsLeft, REG_rounds) ASJ( jmp, 2, f) ASL(SSE2_Salsa_Output) AS2( movdqa xmm0, xmm4) AS2( punpckldq xmm4, xmm5) AS2( movdqa xmm1, xmm6) AS2( punpckldq xmm6, xmm7) AS2( movdqa xmm2, xmm4) AS2( punpcklqdq xmm4, xmm6) // e AS2( punpckhqdq xmm2, xmm6) // f AS2( punpckhdq xmm0, xmm5) AS2( punpckhdq xmm1, xmm7) AS2( movdqa xmm6, xmm0) AS2( punpcklqdq xmm0, xmm1) // g AS2( punpckhqdq xmm6, xmm1) // h AS_XMM_OUTPUT4(SSE2_Salsa_Output_A, REG_input, REG_output, 4, 2, 0, 6, 1, 0, 4, 8, 12, 1) AS1( ret) ASL(6) #if CRYPTOPP_BOOL_X64 SSE2_QUARTER_ROUND_X16(0, 0, 4, 8, 12, 1, 5, 9, 13, 2, 6, 10, 14, 3, 7, 11, 15) ASL(2) SSE2_QUARTER_ROUND_X16(0, 0, 13, 10, 7, 1, 14, 11, 4, 2, 15, 8, 5, 3, 12, 9, 6) #else SSE2_QUARTER_ROUND_X8(0, 2, 6, 10, 14, 3, 7, 11, 15) SSE2_QUARTER_ROUND_X8(0, 0, 4, 8, 12, 1, 5, 9, 13) ASL(2) SSE2_QUARTER_ROUND_X8(0, 2, 15, 8, 5, 3, 12, 9, 6) SSE2_QUARTER_ROUND_X8(0, 0, 13, 10, 7, 1, 14, 11, 4) #endif AS2( sub REG_roundsLeft, 2) ASJ( jnz, 6, b) #define SSE2_OUTPUT_4(a, b, c, d) \ AS2( movdqa xmm4, [SSE2_WORKSPACE + a*16 + 256])\ AS2( paddd xmm4, [SSE2_WORKSPACE + a*16])\ AS2( movdqa xmm5, [SSE2_WORKSPACE + b*16 + 256])\ AS2( paddd xmm5, [SSE2_WORKSPACE + b*16])\ AS2( movdqa xmm6, [SSE2_WORKSPACE + c*16 + 256])\ AS2( paddd xmm6, [SSE2_WORKSPACE + c*16])\ AS2( movdqa xmm7, [SSE2_WORKSPACE + d*16 + 256])\ AS2( paddd xmm7, [SSE2_WORKSPACE + d*16])\ ASC( call, SSE2_Salsa_Output) SSE2_OUTPUT_4(0, 13, 10, 7) SSE2_OUTPUT_4(4, 1, 14, 11) SSE2_OUTPUT_4(8, 5, 2, 15) SSE2_OUTPUT_4(12, 9, 6, 3) AS2( test REG_input, REG_input) ASJ( jz, 9, f) AS2( add REG_input, 12*16) ASL(9) AS2( add REG_output, 12*16) AS2( sub REG_iterationCount, 4) AS2( cmp REG_iterationCount, 4) ASJ( jge, 1, b) AS_POP_IF86( sp) ASL(5) AS2( sub REG_iterationCount, 1) ASJ( jl, 4, f) AS2( movdqa xmm0, [REG_state + 0*16]) AS2( movdqa xmm1, [REG_state + 1*16]) AS2( movdqa xmm2, [REG_state + 2*16]) AS2( movdqa xmm3, [REG_state + 3*16]) AS2( mov REG_roundsLeft, REG_rounds) ASL(0) SSE2_QUARTER_ROUND(0, 1, 3, 7) SSE2_QUARTER_ROUND(1, 2, 0, 9) SSE2_QUARTER_ROUND(2, 3, 1, 13) SSE2_QUARTER_ROUND(3, 0, 2, 18) ASS( pshufd xmm1, xmm1, 2, 1, 0, 3) ASS( pshufd xmm2, xmm2, 1, 0, 3, 2) ASS( pshufd xmm3, xmm3, 0, 3, 2, 1) SSE2_QUARTER_ROUND(0, 3, 1, 7) SSE2_QUARTER_ROUND(3, 2, 0, 9) SSE2_QUARTER_ROUND(2, 1, 3, 13) SSE2_QUARTER_ROUND(1, 0, 2, 18) ASS( pshufd xmm1, xmm1, 0, 3, 2, 1) ASS( pshufd xmm2, xmm2, 1, 0, 3, 2) ASS( pshufd xmm3, xmm3, 2, 1, 0, 3) AS2( sub REG_roundsLeft, 2) ASJ( jnz, 0, b) AS2( paddd xmm0, [REG_state + 0*16]) AS2( paddd xmm1, [REG_state + 1*16]) AS2( paddd xmm2, [REG_state + 2*16]) AS2( paddd xmm3, [REG_state + 3*16]) AS2( add dword ptr [REG_state + 8*4], 1) AS2( adc dword ptr [REG_state + 5*4], 0) AS2( pcmpeqb xmm6, xmm6) // all ones AS2( psrlq xmm6, 32) // lo32 mask ASS( pshufd xmm7, xmm6, 0, 1, 2, 3) // hi32 mask AS2( movdqa xmm4, xmm0) AS2( movdqa xmm5, xmm3) AS2( pand xmm0, xmm7) AS2( pand xmm4, xmm6) AS2( pand xmm3, xmm6) AS2( pand xmm5, xmm7) AS2( por xmm4, xmm5) // 0,13,2,15 AS2( movdqa xmm5, xmm1) AS2( pand xmm1, xmm7) AS2( pand xmm5, xmm6) AS2( por xmm0, xmm5) // 4,1,6,3 AS2( pand xmm6, xmm2) AS2( pand xmm2, xmm7) AS2( por xmm1, xmm6) // 8,5,10,7 AS2( por xmm2, xmm3) // 12,9,14,11 AS2( movdqa xmm5, xmm4) AS2( movdqa xmm6, xmm0) AS3( shufpd xmm4, xmm1, 2) // 0,13,10,7 AS3( shufpd xmm0, xmm2, 2) // 4,1,14,11 AS3( shufpd xmm1, xmm5, 2) // 8,5,2,15 AS3( shufpd xmm2, xmm6, 2) // 12,9,6,3 // output keystream AS_XMM_OUTPUT4(SSE2_Salsa_Output_B, REG_input, REG_output, 4, 0, 1, 2, 3, 0, 1, 2, 3, 4) ASJ( jmp, 5, b) ASL(4) AS_POP_IF86( bp) #ifdef __GNUC__ AS_POP_IF86( bx) ".att_syntax prefix;" : #if CRYPTOPP_BOOL_X64 : "r" (m_rounds), "r" (input), "r" (iterationCount), "r" (m_state.data()), "r" (output), "r" (workspace.m_ptr) : "%eax", "%edx", "memory", "cc", "%xmm0", "%xmm1", "%xmm2", "%xmm3", "%xmm4", "%xmm5", "%xmm6", "%xmm7", "%xmm8", "%xmm9", "%xmm10", "%xmm11", "%xmm12", "%xmm13", "%xmm14", "%xmm15" #else : "d" (m_rounds), "a" (input), "c" (iterationCount), "S" (m_state.data()), "D" (output) : "memory", "cc" #endif ); #endif #ifdef CRYPTOPP_GENERATE_X64_MASM movdqa xmm6, [rsp + 0200h] movdqa xmm7, [rsp + 0210h] movdqa xmm8, [rsp + 0220h] movdqa xmm9, [rsp + 0230h] movdqa xmm10, [rsp + 0240h] movdqa xmm11, [rsp + 0250h] movdqa xmm12, [rsp + 0260h] movdqa xmm13, [rsp + 0270h] movdqa xmm14, [rsp + 0280h] movdqa xmm15, [rsp + 0290h] add rsp, 10*16 + 32*16 + 8 ret Salsa20_OperateKeystream ENDP #else } else #endif #endif #ifndef CRYPTOPP_GENERATE_X64_MASM { word32 x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15; while (iterationCount--) { x0 = m_state[0]; x1 = m_state[1]; x2 = m_state[2]; x3 = m_state[3]; x4 = m_state[4]; x5 = m_state[5]; x6 = m_state[6]; x7 = m_state[7]; x8 = m_state[8]; x9 = m_state[9]; x10 = m_state[10]; x11 = m_state[11]; x12 = m_state[12]; x13 = m_state[13]; x14 = m_state[14]; x15 = m_state[15]; for (int i=m_rounds; i>0; i-=2) { #define QUARTER_ROUND(a, b, c, d) \ b = b ^ rotlFixed(a + d, 7); \ c = c ^ rotlFixed(b + a, 9); \ d = d ^ rotlFixed(c + b, 13); \ a = a ^ rotlFixed(d + c, 18); QUARTER_ROUND(x0, x4, x8, x12) QUARTER_ROUND(x1, x5, x9, x13) QUARTER_ROUND(x2, x6, x10, x14) QUARTER_ROUND(x3, x7, x11, x15) QUARTER_ROUND(x0, x13, x10, x7) QUARTER_ROUND(x1, x14, x11, x4) QUARTER_ROUND(x2, x15, x8, x5) QUARTER_ROUND(x3, x12, x9, x6) } #define SALSA_OUTPUT(x) {\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 0, x0 + m_state[0]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 1, x13 + m_state[13]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 2, x10 + m_state[10]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 3, x7 + m_state[7]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 4, x4 + m_state[4]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 5, x1 + m_state[1]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 6, x14 + m_state[14]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 7, x11 + m_state[11]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 8, x8 + m_state[8]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 9, x5 + m_state[5]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 10, x2 + m_state[2]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 11, x15 + m_state[15]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 12, x12 + m_state[12]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 13, x9 + m_state[9]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 14, x6 + m_state[6]);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 15, x3 + m_state[3]);} #ifndef CRYPTOPP_DOXYGEN_PROCESSING CRYPTOPP_KEYSTREAM_OUTPUT_SWITCH(SALSA_OUTPUT, BYTES_PER_ITERATION); #endif if (++m_state[8] == 0) ++m_state[5]; } } } // see comment above if an internal compiler error occurs here void XSalsa20_Policy::CipherSetKey(const NameValuePairs ¶ms, const byte *key, size_t length) { m_rounds = params.GetIntValueWithDefault(Name::Rounds(), 20); if (!(m_rounds == 8 || m_rounds == 12 || m_rounds == 20)) throw InvalidRounds(XSalsa20::StaticAlgorithmName(), m_rounds); GetUserKey(LITTLE_ENDIAN_ORDER, m_key.begin(), m_key.size(), key, length); if (length == 16) memcpy(m_key.begin()+4, m_key.begin(), 16); // "expand 32-byte k" m_state[0] = 0x61707865; m_state[1] = 0x3320646e; m_state[2] = 0x79622d32; m_state[3] = 0x6b206574; } void XSalsa20_Policy::CipherResynchronize(byte *keystreamBuffer, const byte *IV, size_t length) { assert(length==24); word32 x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15; GetBlock get(IV); get(x14)(x11)(x8)(x5)(m_state[14])(m_state[11]); x13 = m_key[0]; x10 = m_key[1]; x7 = m_key[2]; x4 = m_key[3]; x15 = m_key[4]; x12 = m_key[5]; x9 = m_key[6]; x6 = m_key[7]; x0 = m_state[0]; x1 = m_state[1]; x2 = m_state[2]; x3 = m_state[3]; for (int i=m_rounds; i>0; i-=2) { QUARTER_ROUND(x0, x4, x8, x12) QUARTER_ROUND(x1, x5, x9, x13) QUARTER_ROUND(x2, x6, x10, x14) QUARTER_ROUND(x3, x7, x11, x15) QUARTER_ROUND(x0, x13, x10, x7) QUARTER_ROUND(x1, x14, x11, x4) QUARTER_ROUND(x2, x15, x8, x5) QUARTER_ROUND(x3, x12, x9, x6) } m_state[13] = x0; m_state[10] = x1; m_state[7] = x2; m_state[4] = x3; m_state[15] = x14; m_state[12] = x11; m_state[9] = x8; m_state[6] = x5; m_state[8] = m_state[5] = 0; } NAMESPACE_END #endif // #ifndef CRYPTOPP_GENERATE_X64_MASM armory-0.92.3/cppForSwig/cryptopp/3way.cpp0000755000000000000000000000637612414772654017201 0ustar rootroot// 3way.cpp - modifed by Wei Dai from Joan Daemen's 3way.c // The original code and all modifications are in the public domain. #include "pch.h" #include "3way.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) void ThreeWay_TestInstantiations() { ThreeWay::Encryption x1; ThreeWay::Decryption x2; } static const word32 START_E = 0x0b0b; // round constant of first encryption round static const word32 START_D = 0xb1b1; // round constant of first decryption round static const word32 RC_MODULUS = 0x11011; static inline word32 reverseBits(word32 a) { a = ((a & 0xAAAAAAAA) >> 1) | ((a & 0x55555555) << 1); a = ((a & 0xCCCCCCCC) >> 2) | ((a & 0x33333333) << 2); return ((a & 0xF0F0F0F0) >> 4) | ((a & 0x0F0F0F0F) << 4); } #define mu(a0, a1, a2) \ { \ a1 = reverseBits(a1); \ word32 t = reverseBits(a0); \ a0 = reverseBits(a2); \ a2 = t; \ } #define pi_gamma_pi(a0, a1, a2) \ { \ word32 b0, b2; \ b2 = rotlFixed(a2, 1U); \ b0 = rotlFixed(a0, 22U); \ a0 = rotlFixed(b0 ^ (a1|(~b2)), 1U); \ a2 = rotlFixed(b2 ^ (b0|(~a1)), 22U);\ a1 ^= (b2|(~b0)); \ } // thanks to Paulo Barreto for this optimized theta() #define theta(a0, a1, a2) \ { \ word32 b0, b1, c; \ c = a0 ^ a1 ^ a2; \ c = rotlFixed(c, 16U) ^ rotlFixed(c, 8U); \ b0 = (a0 << 24) ^ (a2 >> 8) ^ (a1 << 8) ^ (a0 >> 24); \ b1 = (a1 << 24) ^ (a0 >> 8) ^ (a2 << 8) ^ (a1 >> 24); \ a0 ^= c ^ b0; \ a1 ^= c ^ b1; \ a2 ^= c ^ (b0 >> 16) ^ (b1 << 16); \ } #define rho(a0, a1, a2) \ { \ theta(a0, a1, a2); \ pi_gamma_pi(a0, a1, a2); \ } void ThreeWay::Base::UncheckedSetKey(const byte *uk, unsigned int length, const NameValuePairs ¶ms) { AssertValidKeyLength(length); m_rounds = GetRoundsAndThrowIfInvalid(params, this); for (unsigned int i=0; i<3; i++) m_k[i] = (word32)uk[4*i+3] | ((word32)uk[4*i+2]<<8) | ((word32)uk[4*i+1]<<16) | ((word32)uk[4*i]<<24); if (!IsForwardTransformation()) { theta(m_k[0], m_k[1], m_k[2]); mu(m_k[0], m_k[1], m_k[2]); m_k[0] = ByteReverse(m_k[0]); m_k[1] = ByteReverse(m_k[1]); m_k[2] = ByteReverse(m_k[2]); } } void ThreeWay::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { typedef BlockGetAndPut Block; word32 a0, a1, a2; Block::Get(inBlock)(a0)(a1)(a2); word32 rc = START_E; for(unsigned i=0; i Block; word32 a0, a1, a2; Block::Get(inBlock)(a0)(a1)(a2); word32 rc = START_D; mu(a0, a1, a2); for(unsigned i=0; i Block; // Richard Outerbridge's initial permutation algorithm /* inline void IPERM(word32 &left, word32 &right) { word32 work; work = ((left >> 4) ^ right) & 0x0f0f0f0f; right ^= work; left ^= work << 4; work = ((left >> 16) ^ right) & 0xffff; right ^= work; left ^= work << 16; work = ((right >> 2) ^ left) & 0x33333333; left ^= work; right ^= (work << 2); work = ((right >> 8) ^ left) & 0xff00ff; left ^= work; right ^= (work << 8); right = rotl(right, 1); work = (left ^ right) & 0xaaaaaaaa; left ^= work; right ^= work; left = rotl(left, 1); } inline void FPERM(word32 &left, word32 &right) { word32 work; right = rotr(right, 1); work = (left ^ right) & 0xaaaaaaaa; left ^= work; right ^= work; left = rotr(left, 1); work = ((left >> 8) ^ right) & 0xff00ff; right ^= work; left ^= work << 8; work = ((left >> 2) ^ right) & 0x33333333; right ^= work; left ^= work << 2; work = ((right >> 16) ^ left) & 0xffff; left ^= work; right ^= work << 16; work = ((right >> 4) ^ left) & 0x0f0f0f0f; left ^= work; right ^= work << 4; } */ // Wei Dai's modification to Richard Outerbridge's initial permutation // algorithm, this one is faster if you have access to rotate instructions // (like in MSVC) static inline void IPERM(word32 &left, word32 &right) { word32 work; right = rotlFixed(right, 4U); work = (left ^ right) & 0xf0f0f0f0; left ^= work; right = rotrFixed(right^work, 20U); work = (left ^ right) & 0xffff0000; left ^= work; right = rotrFixed(right^work, 18U); work = (left ^ right) & 0x33333333; left ^= work; right = rotrFixed(right^work, 6U); work = (left ^ right) & 0x00ff00ff; left ^= work; right = rotlFixed(right^work, 9U); work = (left ^ right) & 0xaaaaaaaa; left = rotlFixed(left^work, 1U); right ^= work; } static inline void FPERM(word32 &left, word32 &right) { word32 work; right = rotrFixed(right, 1U); work = (left ^ right) & 0xaaaaaaaa; right ^= work; left = rotrFixed(left^work, 9U); work = (left ^ right) & 0x00ff00ff; right ^= work; left = rotlFixed(left^work, 6U); work = (left ^ right) & 0x33333333; right ^= work; left = rotlFixed(left^work, 18U); work = (left ^ right) & 0xffff0000; right ^= work; left = rotlFixed(left^work, 20U); work = (left ^ right) & 0xf0f0f0f0; right ^= work; left = rotrFixed(left^work, 4U); } void DES::Base::UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs &) { AssertValidKeyLength(length); RawSetKey(GetCipherDirection(), userKey); } #ifndef CRYPTOPP_IMPORTS /* Tables defined in the Data Encryption Standard documents * Three of these tables, the initial permutation, the final * permutation and the expansion operator, are regular enough that * for speed, we hard-code them. They're here for reference only. * Also, the S and P boxes are used by a separate program, gensp.c, * to build the combined SP box, Spbox[]. They're also here just * for reference. */ #ifdef notdef /* initial permutation IP */ static byte ip[] = { 58, 50, 42, 34, 26, 18, 10, 2, 60, 52, 44, 36, 28, 20, 12, 4, 62, 54, 46, 38, 30, 22, 14, 6, 64, 56, 48, 40, 32, 24, 16, 8, 57, 49, 41, 33, 25, 17, 9, 1, 59, 51, 43, 35, 27, 19, 11, 3, 61, 53, 45, 37, 29, 21, 13, 5, 63, 55, 47, 39, 31, 23, 15, 7 }; /* final permutation IP^-1 */ static byte fp[] = { 40, 8, 48, 16, 56, 24, 64, 32, 39, 7, 47, 15, 55, 23, 63, 31, 38, 6, 46, 14, 54, 22, 62, 30, 37, 5, 45, 13, 53, 21, 61, 29, 36, 4, 44, 12, 52, 20, 60, 28, 35, 3, 43, 11, 51, 19, 59, 27, 34, 2, 42, 10, 50, 18, 58, 26, 33, 1, 41, 9, 49, 17, 57, 25 }; /* expansion operation matrix */ static byte ei[] = { 32, 1, 2, 3, 4, 5, 4, 5, 6, 7, 8, 9, 8, 9, 10, 11, 12, 13, 12, 13, 14, 15, 16, 17, 16, 17, 18, 19, 20, 21, 20, 21, 22, 23, 24, 25, 24, 25, 26, 27, 28, 29, 28, 29, 30, 31, 32, 1 }; /* The (in)famous S-boxes */ static byte sbox[8][64] = { /* S1 */ 14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7, 0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8, 4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0, 15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13, /* S2 */ 15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10, 3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5, 0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15, 13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9, /* S3 */ 10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8, 13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1, 13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7, 1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12, /* S4 */ 7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15, 13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9, 10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4, 3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14, /* S5 */ 2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9, 14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6, 4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14, 11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3, /* S6 */ 12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11, 10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8, 9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6, 4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13, /* S7 */ 4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1, 13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6, 1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2, 6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12, /* S8 */ 13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7, 1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2, 7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8, 2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11 }; /* 32-bit permutation function P used on the output of the S-boxes */ static byte p32i[] = { 16, 7, 20, 21, 29, 12, 28, 17, 1, 15, 23, 26, 5, 18, 31, 10, 2, 8, 24, 14, 32, 27, 3, 9, 19, 13, 30, 6, 22, 11, 4, 25 }; #endif /* permuted choice table (key) */ static const byte pc1[] = { 57, 49, 41, 33, 25, 17, 9, 1, 58, 50, 42, 34, 26, 18, 10, 2, 59, 51, 43, 35, 27, 19, 11, 3, 60, 52, 44, 36, 63, 55, 47, 39, 31, 23, 15, 7, 62, 54, 46, 38, 30, 22, 14, 6, 61, 53, 45, 37, 29, 21, 13, 5, 28, 20, 12, 4 }; /* number left rotations of pc1 */ static const byte totrot[] = { 1,2,4,6,8,10,12,14,15,17,19,21,23,25,27,28 }; /* permuted choice key (table) */ static const byte pc2[] = { 14, 17, 11, 24, 1, 5, 3, 28, 15, 6, 21, 10, 23, 19, 12, 4, 26, 8, 16, 7, 27, 20, 13, 2, 41, 52, 31, 37, 47, 55, 30, 40, 51, 45, 33, 48, 44, 49, 39, 56, 34, 53, 46, 42, 50, 36, 29, 32 }; /* End of DES-defined tables */ /* bit 0 is left-most in byte */ static const int bytebit[] = { 0200,0100,040,020,010,04,02,01 }; /* Set key (initialize key schedule array) */ void RawDES::RawSetKey(CipherDir dir, const byte *key) { SecByteBlock buffer(56+56+8); byte *const pc1m=buffer; /* place to modify pc1 into */ byte *const pcr=pc1m+56; /* place to rotate pc1 into */ byte *const ks=pcr+56; register int i,j,l; int m; for (j=0; j<56; j++) { /* convert pc1 to bits of key */ l=pc1[j]-1; /* integer bit location */ m = l & 07; /* find bit */ pc1m[j]=(key[l>>3] & /* find which key byte l is in */ bytebit[m]) /* and which bit of that byte */ ? 1 : 0; /* and store 1-bit result */ } for (i=0; i<16; i++) { /* key chunk for each iteration */ memset(ks,0,8); /* Clear key schedule */ for (j=0; j<56; j++) /* rotate pc1 the right amount */ pcr[j] = pc1m[(l=j+totrot[i])<(j<28? 28 : 56) ? l: l-28]; /* rotate left and right halves independently */ for (j=0; j<48; j++){ /* select bits individually */ /* check bit that goes to ks[j] */ if (pcr[pc2[j]-1]){ /* mask it in if it's there */ l= j % 6; ks[j/6] |= bytebit[l] >> 2; } } /* Now convert to odd/even interleaved form for use in F */ k[2*i] = ((word32)ks[0] << 24) | ((word32)ks[2] << 16) | ((word32)ks[4] << 8) | ((word32)ks[6]); k[2*i+1] = ((word32)ks[1] << 24) | ((word32)ks[3] << 16) | ((word32)ks[5] << 8) | ((word32)ks[7]); } if (dir==DECRYPTION) // reverse key schedule order for (i=0; i<16; i+=2) { std::swap(k[i], k[32-2-i]); std::swap(k[i+1], k[32-1-i]); } } void RawDES::RawProcessBlock(word32 &l_, word32 &r_) const { word32 l = l_, r = r_; const word32 *kptr=k; for (unsigned i=0; i<8; i++) { word32 work = rotrFixed(r, 4U) ^ kptr[4*i+0]; l ^= Spbox[6][(work) & 0x3f] ^ Spbox[4][(work >> 8) & 0x3f] ^ Spbox[2][(work >> 16) & 0x3f] ^ Spbox[0][(work >> 24) & 0x3f]; work = r ^ kptr[4*i+1]; l ^= Spbox[7][(work) & 0x3f] ^ Spbox[5][(work >> 8) & 0x3f] ^ Spbox[3][(work >> 16) & 0x3f] ^ Spbox[1][(work >> 24) & 0x3f]; work = rotrFixed(l, 4U) ^ kptr[4*i+2]; r ^= Spbox[6][(work) & 0x3f] ^ Spbox[4][(work >> 8) & 0x3f] ^ Spbox[2][(work >> 16) & 0x3f] ^ Spbox[0][(work >> 24) & 0x3f]; work = l ^ kptr[4*i+3]; r ^= Spbox[7][(work) & 0x3f] ^ Spbox[5][(work >> 8) & 0x3f] ^ Spbox[3][(work >> 16) & 0x3f] ^ Spbox[1][(work >> 24) & 0x3f]; } l_ = l; r_ = r; } void DES_EDE2::Base::UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs &) { AssertValidKeyLength(length); m_des1.RawSetKey(GetCipherDirection(), userKey); m_des2.RawSetKey(ReverseCipherDir(GetCipherDirection()), userKey+8); } void DES_EDE2::Base::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 l,r; Block::Get(inBlock)(l)(r); IPERM(l,r); m_des1.RawProcessBlock(l, r); m_des2.RawProcessBlock(r, l); m_des1.RawProcessBlock(l, r); FPERM(l,r); Block::Put(xorBlock, outBlock)(r)(l); } void DES_EDE3::Base::UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs &) { AssertValidKeyLength(length); m_des1.RawSetKey(GetCipherDirection(), userKey + (IsForwardTransformation() ? 0 : 16)); m_des2.RawSetKey(ReverseCipherDir(GetCipherDirection()), userKey + 8); m_des3.RawSetKey(GetCipherDirection(), userKey + (IsForwardTransformation() ? 16 : 0)); } void DES_EDE3::Base::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 l,r; Block::Get(inBlock)(l)(r); IPERM(l,r); m_des1.RawProcessBlock(l, r); m_des2.RawProcessBlock(r, l); m_des3.RawProcessBlock(l, r); FPERM(l,r); Block::Put(xorBlock, outBlock)(r)(l); } #endif // #ifndef CRYPTOPP_IMPORTS static inline bool CheckParity(byte b) { unsigned int a = b ^ (b >> 4); return ((a ^ (a>>1) ^ (a>>2) ^ (a>>3)) & 1) == 1; } bool DES::CheckKeyParityBits(const byte *key) { for (unsigned int i=0; i<8; i++) if (!CheckParity(key[i])) return false; return true; } void DES::CorrectKeyParityBits(byte *key) { for (unsigned int i=0; i<8; i++) if (!CheckParity(key[i])) key[i] ^= 1; } // Encrypt or decrypt a block of data in ECB mode void DES::Base::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 l,r; Block::Get(inBlock)(l)(r); IPERM(l,r); RawProcessBlock(l, r); FPERM(l,r); Block::Put(xorBlock, outBlock)(r)(l); } void DES_XEX3::Base::UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs &) { AssertValidKeyLength(length); if (!m_des.get()) m_des.reset(new DES::Encryption); memcpy(m_x1, key + (IsForwardTransformation() ? 0 : 16), BLOCKSIZE); m_des->RawSetKey(GetCipherDirection(), key + 8); memcpy(m_x3, key + (IsForwardTransformation() ? 16 : 0), BLOCKSIZE); } void DES_XEX3::Base::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { xorbuf(outBlock, inBlock, m_x1, BLOCKSIZE); m_des->ProcessAndXorBlock(outBlock, xorBlock, outBlock); xorbuf(outBlock, m_x3, BLOCKSIZE); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/cpu.cpp0000755000000000000000000000732112414772654017074 0ustar rootroot// cpu.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "cpu.h" #include "misc.h" #include #ifndef CRYPTOPP_MS_STYLE_INLINE_ASSEMBLY #include #include #endif #if CRYPTOPP_BOOL_SSE2_INTRINSICS_AVAILABLE #include #endif NAMESPACE_BEGIN(CryptoPP) #ifdef CRYPTOPP_CPUID_AVAILABLE #if _MSC_VER >= 1400 && CRYPTOPP_BOOL_X64 bool CpuId(word32 input, word32 *output) { __cpuid((int *)output, input); return true; } #else #ifndef CRYPTOPP_MS_STYLE_INLINE_ASSEMBLY extern "C" { typedef void (*SigHandler)(int); static jmp_buf s_jmpNoCPUID; static void SigIllHandlerCPUID(int) { longjmp(s_jmpNoCPUID, 1); } static jmp_buf s_jmpNoSSE2; static void SigIllHandlerSSE2(int) { longjmp(s_jmpNoSSE2, 1); } } #endif bool CpuId(word32 input, word32 *output) { #ifdef CRYPTOPP_MS_STYLE_INLINE_ASSEMBLY __try { __asm { mov eax, input cpuid mov edi, output mov [edi], eax mov [edi+4], ebx mov [edi+8], ecx mov [edi+12], edx } } __except (1) { return false; } return true; #else SigHandler oldHandler = signal(SIGILL, SigIllHandlerCPUID); if (oldHandler == SIG_ERR) return false; bool result = true; if (setjmp(s_jmpNoCPUID)) result = false; else { asm ( // save ebx in case -fPIC is being used #if CRYPTOPP_BOOL_X86 "push %%ebx; cpuid; mov %%ebx, %%edi; pop %%ebx" #else "pushq %%rbx; cpuid; mov %%ebx, %%edi; popq %%rbx" #endif : "=a" (output[0]), "=D" (output[1]), "=c" (output[2]), "=d" (output[3]) : "a" (input) ); } signal(SIGILL, oldHandler); return result; #endif } #endif static bool TrySSE2() { #if CRYPTOPP_BOOL_X64 return true; #elif defined(CRYPTOPP_MS_STYLE_INLINE_ASSEMBLY) __try { #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE AS2(por xmm0, xmm0) // executing SSE2 instruction #elif CRYPTOPP_BOOL_SSE2_INTRINSICS_AVAILABLE __m128i x = _mm_setzero_si128(); return _mm_cvtsi128_si32(x) == 0; #endif } __except (1) { return false; } return true; #else SigHandler oldHandler = signal(SIGILL, SigIllHandlerSSE2); if (oldHandler == SIG_ERR) return false; bool result = true; if (setjmp(s_jmpNoSSE2)) result = false; else { #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE __asm __volatile ("por %xmm0, %xmm0"); #elif CRYPTOPP_BOOL_SSE2_INTRINSICS_AVAILABLE __m128i x = _mm_setzero_si128(); result = _mm_cvtsi128_si32(x) == 0; #endif } signal(SIGILL, oldHandler); return result; #endif } bool g_x86DetectionDone = false; bool g_hasISSE = false, g_hasSSE2 = false, g_hasSSSE3 = false, g_hasMMX = false, g_hasAESNI = false, g_hasCLMUL = false, g_isP4 = false; word32 g_cacheLineSize = CRYPTOPP_L1_CACHE_LINE_SIZE; void DetectX86Features() { word32 cpuid[4], cpuid1[4]; if (!CpuId(0, cpuid)) return; if (!CpuId(1, cpuid1)) return; g_hasMMX = (cpuid1[3] & (1 << 23)) != 0; if ((cpuid1[3] & (1 << 26)) != 0) g_hasSSE2 = TrySSE2(); g_hasSSSE3 = g_hasSSE2 && (cpuid1[2] & (1<<9)); g_hasAESNI = g_hasSSE2 && (cpuid1[2] & (1<<25)); g_hasCLMUL = g_hasSSE2 && (cpuid1[2] & (1<<1)); if ((cpuid1[3] & (1 << 25)) != 0) g_hasISSE = true; else { word32 cpuid2[4]; CpuId(0x080000000, cpuid2); if (cpuid2[0] >= 0x080000001) { CpuId(0x080000001, cpuid2); g_hasISSE = (cpuid2[3] & (1 << 22)) != 0; } } std::swap(cpuid[2], cpuid[3]); if (memcmp(cpuid+1, "GenuineIntel", 12) == 0) { g_isP4 = ((cpuid1[0] >> 8) & 0xf) == 0xf; g_cacheLineSize = 8 * GETBYTE(cpuid1[1], 1); } else if (memcmp(cpuid+1, "AuthenticAMD", 12) == 0) { CpuId(0x80000005, cpuid); g_cacheLineSize = GETBYTE(cpuid[2], 0); } if (!g_cacheLineSize) g_cacheLineSize = CRYPTOPP_L1_CACHE_LINE_SIZE; g_x86DetectionDone = true; } #endif NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/cryptopp.vcxproj.filters0000755000000000000000000005643212414772654022554 0ustar rootroot {4FC737F1-C7A5-4376-A066-2A32D752A2FF} cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx {93995380-89BD-4b04-88EB-625FBE52EBFB} h;hpp;hxx;hm;inl;inc;xsd {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Source Files Source Files armory-0.92.3/cppForSwig/cryptopp/hex.cpp0000755000000000000000000000217512414772654017073 0ustar rootroot// hex.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "hex.h" NAMESPACE_BEGIN(CryptoPP) static const byte s_vecUpper[] = "0123456789ABCDEF"; static const byte s_vecLower[] = "0123456789abcdef"; void HexEncoder::IsolatedInitialize(const NameValuePairs ¶meters) { bool uppercase = parameters.GetValueWithDefault(Name::Uppercase(), true); m_filter->Initialize(CombinedNameValuePairs( parameters, MakeParameters(Name::EncodingLookupArray(), uppercase ? &s_vecUpper[0] : &s_vecLower[0], false)(Name::Log2Base(), 4, true))); } void HexDecoder::IsolatedInitialize(const NameValuePairs ¶meters) { BaseN_Decoder::IsolatedInitialize(CombinedNameValuePairs( parameters, MakeParameters(Name::DecodingLookupArray(), GetDefaultDecodingLookupArray(), false)(Name::Log2Base(), 4, true))); } const int *HexDecoder::GetDefaultDecodingLookupArray() { static volatile bool s_initialized = false; static int s_array[256]; if (!s_initialized) { InitializeDecodingLookupArray(s_array, s_vecUpper, 16, true); s_initialized = true; } return s_array; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/strciphr.cpp0000755000000000000000000001572112414772654020146 0ustar rootroot// strciphr.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "strciphr.h" NAMESPACE_BEGIN(CryptoPP) template void AdditiveCipherTemplate::UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms) { PolicyInterface &policy = this->AccessPolicy(); policy.CipherSetKey(params, key, length); m_leftOver = 0; unsigned int bufferByteSize = policy.CanOperateKeystream() ? GetBufferByteSize(policy) : RoundUpToMultipleOf(1024U, GetBufferByteSize(policy)); m_buffer.New(bufferByteSize); if (this->IsResynchronizable()) { size_t ivLength; const byte *iv = this->GetIVAndThrowIfInvalid(params, ivLength); policy.CipherResynchronize(m_buffer, iv, ivLength); } } template void AdditiveCipherTemplate::GenerateBlock(byte *outString, size_t length) { if (m_leftOver > 0) { size_t len = STDMIN(m_leftOver, length); memcpy(outString, KeystreamBufferEnd()-m_leftOver, len); length -= len; m_leftOver -= len; outString += len; if (!length) return; } assert(m_leftOver == 0); PolicyInterface &policy = this->AccessPolicy(); unsigned int bytesPerIteration = policy.GetBytesPerIteration(); if (length >= bytesPerIteration) { size_t iterations = length / bytesPerIteration; policy.WriteKeystream(outString, iterations); outString += iterations * bytesPerIteration; length -= iterations * bytesPerIteration; } if (length > 0) { size_t bufferByteSize = RoundUpToMultipleOf(length, bytesPerIteration); size_t bufferIterations = bufferByteSize / bytesPerIteration; policy.WriteKeystream(KeystreamBufferEnd()-bufferByteSize, bufferIterations); memcpy(outString, KeystreamBufferEnd()-bufferByteSize, length); m_leftOver = bufferByteSize - length; } } template void AdditiveCipherTemplate::ProcessData(byte *outString, const byte *inString, size_t length) { if (m_leftOver > 0) { size_t len = STDMIN(m_leftOver, length); xorbuf(outString, inString, KeystreamBufferEnd()-m_leftOver, len); length -= len; m_leftOver -= len; inString += len; outString += len; if (!length) return; } assert(m_leftOver == 0); PolicyInterface &policy = this->AccessPolicy(); unsigned int bytesPerIteration = policy.GetBytesPerIteration(); if (policy.CanOperateKeystream() && length >= bytesPerIteration) { size_t iterations = length / bytesPerIteration; unsigned int alignment = policy.GetAlignment(); KeystreamOperation operation = KeystreamOperation((IsAlignedOn(inString, alignment) * 2) | (int)IsAlignedOn(outString, alignment)); policy.OperateKeystream(operation, outString, inString, iterations); inString += iterations * bytesPerIteration; outString += iterations * bytesPerIteration; length -= iterations * bytesPerIteration; if (!length) return; } size_t bufferByteSize = m_buffer.size(); size_t bufferIterations = bufferByteSize / bytesPerIteration; while (length >= bufferByteSize) { policy.WriteKeystream(m_buffer, bufferIterations); xorbuf(outString, inString, KeystreamBufferBegin(), bufferByteSize); length -= bufferByteSize; inString += bufferByteSize; outString += bufferByteSize; } if (length > 0) { bufferByteSize = RoundUpToMultipleOf(length, bytesPerIteration); bufferIterations = bufferByteSize / bytesPerIteration; policy.WriteKeystream(KeystreamBufferEnd()-bufferByteSize, bufferIterations); xorbuf(outString, inString, KeystreamBufferEnd()-bufferByteSize, length); m_leftOver = bufferByteSize - length; } } template void AdditiveCipherTemplate::Resynchronize(const byte *iv, int length) { PolicyInterface &policy = this->AccessPolicy(); m_leftOver = 0; m_buffer.New(GetBufferByteSize(policy)); policy.CipherResynchronize(m_buffer, iv, this->ThrowIfInvalidIVLength(length)); } template void AdditiveCipherTemplate::Seek(lword position) { PolicyInterface &policy = this->AccessPolicy(); unsigned int bytesPerIteration = policy.GetBytesPerIteration(); policy.SeekToIteration(position / bytesPerIteration); position %= bytesPerIteration; if (position > 0) { policy.WriteKeystream(KeystreamBufferEnd()-bytesPerIteration, 1); m_leftOver = bytesPerIteration - (unsigned int)position; } else m_leftOver = 0; } template void CFB_CipherTemplate::UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms) { PolicyInterface &policy = this->AccessPolicy(); policy.CipherSetKey(params, key, length); if (this->IsResynchronizable()) { size_t ivLength; const byte *iv = this->GetIVAndThrowIfInvalid(params, ivLength); policy.CipherResynchronize(iv, ivLength); } m_leftOver = policy.GetBytesPerIteration(); } template void CFB_CipherTemplate::Resynchronize(const byte *iv, int length) { PolicyInterface &policy = this->AccessPolicy(); policy.CipherResynchronize(iv, this->ThrowIfInvalidIVLength(length)); m_leftOver = policy.GetBytesPerIteration(); } template void CFB_CipherTemplate::ProcessData(byte *outString, const byte *inString, size_t length) { assert(length % this->MandatoryBlockSize() == 0); PolicyInterface &policy = this->AccessPolicy(); unsigned int bytesPerIteration = policy.GetBytesPerIteration(); unsigned int alignment = policy.GetAlignment(); byte *reg = policy.GetRegisterBegin(); if (m_leftOver) { size_t len = STDMIN(m_leftOver, length); CombineMessageAndShiftRegister(outString, reg + bytesPerIteration - m_leftOver, inString, len); m_leftOver -= len; length -= len; inString += len; outString += len; } if (!length) return; assert(m_leftOver == 0); if (policy.CanIterate() && length >= bytesPerIteration && IsAlignedOn(outString, alignment)) { if (IsAlignedOn(inString, alignment)) policy.Iterate(outString, inString, GetCipherDir(*this), length / bytesPerIteration); else { memcpy(outString, inString, length); policy.Iterate(outString, outString, GetCipherDir(*this), length / bytesPerIteration); } inString += length - length % bytesPerIteration; outString += length - length % bytesPerIteration; length %= bytesPerIteration; } while (length >= bytesPerIteration) { policy.TransformRegister(); CombineMessageAndShiftRegister(outString, reg, inString, bytesPerIteration); length -= bytesPerIteration; inString += bytesPerIteration; outString += bytesPerIteration; } if (length > 0) { policy.TransformRegister(); CombineMessageAndShiftRegister(outString, reg, inString, length); m_leftOver = bytesPerIteration - length; } } template void CFB_EncryptionTemplate::CombineMessageAndShiftRegister(byte *output, byte *reg, const byte *message, size_t length) { xorbuf(reg, message, length); memcpy(output, reg, length); } template void CFB_DecryptionTemplate::CombineMessageAndShiftRegister(byte *output, byte *reg, const byte *message, size_t length) { for (unsigned int i=0; i #if _MSC_VER >= 1600 // for make_unchecked_array_iterator #include #endif NAMESPACE_BEGIN(CryptoPP) using namespace std; LowFirstBitWriter::LowFirstBitWriter(BufferedTransformation *attachment) : Filter(attachment), m_counting(false), m_buffer(0), m_bitsBuffered(0), m_bytesBuffered(0) { } void LowFirstBitWriter::StartCounting() { assert(!m_counting); m_counting = true; m_bitCount = 0; } unsigned long LowFirstBitWriter::FinishCounting() { assert(m_counting); m_counting = false; return m_bitCount; } void LowFirstBitWriter::PutBits(unsigned long value, unsigned int length) { if (m_counting) m_bitCount += length; else { m_buffer |= value << m_bitsBuffered; m_bitsBuffered += length; assert(m_bitsBuffered <= sizeof(unsigned long)*8); while (m_bitsBuffered >= 8) { m_outputBuffer[m_bytesBuffered++] = (byte)m_buffer; if (m_bytesBuffered == m_outputBuffer.size()) { AttachedTransformation()->PutModifiable(m_outputBuffer, m_bytesBuffered); m_bytesBuffered = 0; } m_buffer >>= 8; m_bitsBuffered -= 8; } } } void LowFirstBitWriter::FlushBitBuffer() { if (m_counting) m_bitCount += 8*(m_bitsBuffered > 0); else { if (m_bytesBuffered > 0) { AttachedTransformation()->PutModifiable(m_outputBuffer, m_bytesBuffered); m_bytesBuffered = 0; } if (m_bitsBuffered > 0) { AttachedTransformation()->Put((byte)m_buffer); m_buffer = 0; m_bitsBuffered = 0; } } } void LowFirstBitWriter::ClearBitBuffer() { m_buffer = 0; m_bytesBuffered = 0; m_bitsBuffered = 0; } HuffmanEncoder::HuffmanEncoder(const unsigned int *codeBits, unsigned int nCodes) { Initialize(codeBits, nCodes); } struct HuffmanNode { size_t symbol; union {size_t parent; unsigned depth, freq;}; }; struct FreqLessThan { inline bool operator()(unsigned int lhs, const HuffmanNode &rhs) {return lhs < rhs.freq;} inline bool operator()(const HuffmanNode &lhs, const HuffmanNode &rhs) const {return lhs.freq < rhs.freq;} // needed for MSVC .NET 2005 inline bool operator()(const HuffmanNode &lhs, unsigned int rhs) {return lhs.freq < rhs;} }; void HuffmanEncoder::GenerateCodeLengths(unsigned int *codeBits, unsigned int maxCodeBits, const unsigned int *codeCounts, size_t nCodes) { assert(nCodes > 0); assert(nCodes <= ((size_t)1 << maxCodeBits)); size_t i; SecBlockWithHint tree(nCodes); for (i=0; i= 2) for (i=tree.size()-2; i>=nCodes; i--) tree[i].depth = tree[tree[i].parent].depth + 1; unsigned int sum = 0; SecBlockWithHint blCount(maxCodeBits+1); fill(blCount.begin(), blCount.end(), 0); for (i=treeBegin; i (unsigned int)(1 << maxCodeBits) ? sum - (1 << maxCodeBits) : 0; while (overflow--) { unsigned int bits = maxCodeBits-1; while (blCount[bits] == 0) bits--; blCount[bits]--; blCount[bits+1] += 2; assert(blCount[maxCodeBits] > 0); blCount[maxCodeBits]--; } for (i=0; i 0); unsigned int maxCodeBits = *max_element(codeBits, codeBits+nCodes); if (maxCodeBits == 0) return; // assume this object won't be used SecBlockWithHint blCount(maxCodeBits+1); fill(blCount.begin(), blCount.end(), 0); unsigned int i; for (i=0; i nextCode(maxCodeBits+1); nextCode[1] = 0; for (i=2; i<=maxCodeBits; i++) { code = (code + blCount[i-1]) << 1; nextCode[i] = code; } assert(maxCodeBits == 1 || code == (1 << maxCodeBits) - blCount[maxCodeBits]); m_valueToCode.resize(nCodes); for (i=0; i> (8*sizeof(code_t)-len); } } inline void HuffmanEncoder::Encode(LowFirstBitWriter &writer, value_t value) const { assert(m_valueToCode[value].len > 0); writer.PutBits(m_valueToCode[value].code, m_valueToCode[value].len); } Deflator::Deflator(BufferedTransformation *attachment, int deflateLevel, int log2WindowSize, bool detectUncompressible) : LowFirstBitWriter(attachment) , m_deflateLevel(-1) { InitializeStaticEncoders(); IsolatedInitialize(MakeParameters("DeflateLevel", deflateLevel)("Log2WindowSize", log2WindowSize)("DetectUncompressible", detectUncompressible)); } Deflator::Deflator(const NameValuePairs ¶meters, BufferedTransformation *attachment) : LowFirstBitWriter(attachment) , m_deflateLevel(-1) { InitializeStaticEncoders(); IsolatedInitialize(parameters); } void Deflator::InitializeStaticEncoders() { unsigned int codeLengths[288]; fill(codeLengths + 0, codeLengths + 144, 8); fill(codeLengths + 144, codeLengths + 256, 9); fill(codeLengths + 256, codeLengths + 280, 7); fill(codeLengths + 280, codeLengths + 288, 8); m_staticLiteralEncoder.Initialize(codeLengths, 288); fill(codeLengths + 0, codeLengths + 32, 5); m_staticDistanceEncoder.Initialize(codeLengths, 32); } void Deflator::IsolatedInitialize(const NameValuePairs ¶meters) { int log2WindowSize = parameters.GetIntValueWithDefault("Log2WindowSize", DEFAULT_LOG2_WINDOW_SIZE); if (!(MIN_LOG2_WINDOW_SIZE <= log2WindowSize && log2WindowSize <= MAX_LOG2_WINDOW_SIZE)) throw InvalidArgument("Deflator: " + IntToString(log2WindowSize) + " is an invalid window size"); m_log2WindowSize = log2WindowSize; DSIZE = 1 << m_log2WindowSize; DMASK = DSIZE - 1; HSIZE = 1 << m_log2WindowSize; HMASK = HSIZE - 1; m_byteBuffer.New(2*DSIZE); m_head.New(HSIZE); m_prev.New(DSIZE); m_matchBuffer.New(DSIZE/2); Reset(true); SetDeflateLevel(parameters.GetIntValueWithDefault("DeflateLevel", DEFAULT_DEFLATE_LEVEL)); bool detectUncompressible = parameters.GetValueWithDefault("DetectUncompressible", true); m_compressibleDeflateLevel = detectUncompressible ? m_deflateLevel : 0; } void Deflator::Reset(bool forceReset) { if (forceReset) ClearBitBuffer(); else assert(m_bitsBuffered == 0); m_headerWritten = false; m_matchAvailable = false; m_dictionaryEnd = 0; m_stringStart = 0; m_lookahead = 0; m_minLookahead = MAX_MATCH; m_matchBufferEnd = 0; m_blockStart = 0; m_blockLength = 0; m_detectCount = 1; m_detectSkip = 0; // m_prev will be initialized automaticly in InsertString fill(m_head.begin(), m_head.end(), 0); fill(m_literalCounts.begin(), m_literalCounts.end(), 0); fill(m_distanceCounts.begin(), m_distanceCounts.end(), 0); } void Deflator::SetDeflateLevel(int deflateLevel) { if (!(MIN_DEFLATE_LEVEL <= deflateLevel && deflateLevel <= MAX_DEFLATE_LEVEL)) throw InvalidArgument("Deflator: " + IntToString(deflateLevel) + " is an invalid deflate level"); if (deflateLevel == m_deflateLevel) return; EndBlock(false); static const unsigned int configurationTable[10][4] = { /* good lazy nice chain */ /* 0 */ {0, 0, 0, 0}, /* store only */ /* 1 */ {4, 3, 8, 4}, /* maximum speed, no lazy matches */ /* 2 */ {4, 3, 16, 8}, /* 3 */ {4, 3, 32, 32}, /* 4 */ {4, 4, 16, 16}, /* lazy matches */ /* 5 */ {8, 16, 32, 32}, /* 6 */ {8, 16, 128, 128}, /* 7 */ {8, 32, 128, 256}, /* 8 */ {32, 128, 258, 1024}, /* 9 */ {32, 258, 258, 4096}}; /* maximum compression */ GOOD_MATCH = configurationTable[deflateLevel][0]; MAX_LAZYLENGTH = configurationTable[deflateLevel][1]; MAX_CHAIN_LENGTH = configurationTable[deflateLevel][3]; m_deflateLevel = deflateLevel; } unsigned int Deflator::FillWindow(const byte *str, size_t length) { unsigned int maxBlockSize = (unsigned int)STDMIN(2UL*DSIZE, 0xffffUL); if (m_stringStart >= maxBlockSize - MAX_MATCH) { if (m_blockStart < DSIZE) EndBlock(false); memcpy(m_byteBuffer, m_byteBuffer + DSIZE, DSIZE); m_dictionaryEnd = m_dictionaryEnd < DSIZE ? 0 : m_dictionaryEnd-DSIZE; assert(m_stringStart >= DSIZE); m_stringStart -= DSIZE; assert(!m_matchAvailable || m_previousMatch >= DSIZE); m_previousMatch -= DSIZE; assert(m_blockStart >= DSIZE); m_blockStart -= DSIZE; unsigned int i; for (i=0; i m_stringStart+m_lookahead); unsigned int accepted = UnsignedMin(maxBlockSize-(m_stringStart+m_lookahead), length); assert(accepted > 0); memcpy(m_byteBuffer + m_stringStart + m_lookahead, str, accepted); m_lookahead += accepted; return accepted; } inline unsigned int Deflator::ComputeHash(const byte *str) const { assert(str+3 <= m_byteBuffer + m_stringStart + m_lookahead); return ((str[0] << 10) ^ (str[1] << 5) ^ str[2]) & HMASK; } unsigned int Deflator::LongestMatch(unsigned int &bestMatch) const { assert(m_previousLength < MAX_MATCH); bestMatch = 0; unsigned int bestLength = STDMAX(m_previousLength, (unsigned int)MIN_MATCH-1); if (m_lookahead <= bestLength) return 0; const byte *scan = m_byteBuffer + m_stringStart, *scanEnd = scan + STDMIN((unsigned int)MAX_MATCH, m_lookahead); unsigned int limit = m_stringStart > (DSIZE-MAX_MATCH) ? m_stringStart - (DSIZE-MAX_MATCH) : 0; unsigned int current = m_head[ComputeHash(scan)]; unsigned int chainLength = MAX_CHAIN_LENGTH; if (m_previousLength >= GOOD_MATCH) chainLength >>= 2; while (current > limit && --chainLength > 0) { const byte *match = m_byteBuffer + current; assert(scan + bestLength < m_byteBuffer + m_stringStart + m_lookahead); if (scan[bestLength-1] == match[bestLength-1] && scan[bestLength] == match[bestLength] && scan[0] == match[0] && scan[1] == match[1]) { assert(scan[2] == match[2]); unsigned int len = (unsigned int)( #if defined(_STDEXT_BEGIN) && !(defined(_MSC_VER) && (_MSC_VER < 1400 || _MSC_VER >= 1600)) && !defined(_STLPORT_VERSION) stdext::unchecked_mismatch #else std::mismatch #endif #if _MSC_VER >= 1600 (stdext::make_unchecked_array_iterator(scan)+3, stdext::make_unchecked_array_iterator(scanEnd), stdext::make_unchecked_array_iterator(match)+3).first - stdext::make_unchecked_array_iterator(scan)); #else (scan+3, scanEnd, match+3).first - scan); #endif assert(len != bestLength); if (len > bestLength) { bestLength = len; bestMatch = current; if (len == (scanEnd - scan)) break; } } current = m_prev[current & DMASK]; } return (bestMatch > 0) ? bestLength : 0; } inline void Deflator::InsertString(unsigned int start) { unsigned int hash = ComputeHash(m_byteBuffer + start); m_prev[start & DMASK] = m_head[hash]; m_head[hash] = start; } void Deflator::ProcessBuffer() { if (!m_headerWritten) { WritePrestreamHeader(); m_headerWritten = true; } if (m_deflateLevel == 0) { m_stringStart += m_lookahead; m_lookahead = 0; m_blockLength = m_stringStart - m_blockStart; m_matchAvailable = false; return; } while (m_lookahead > m_minLookahead) { while (m_dictionaryEnd < m_stringStart && m_dictionaryEnd+3 <= m_stringStart+m_lookahead) InsertString(m_dictionaryEnd++); if (m_matchAvailable) { unsigned int matchPosition, matchLength; bool usePreviousMatch; if (m_previousLength >= MAX_LAZYLENGTH) usePreviousMatch = true; else { matchLength = LongestMatch(matchPosition); usePreviousMatch = (matchLength == 0); } if (usePreviousMatch) { MatchFound(m_stringStart-1-m_previousMatch, m_previousLength); m_stringStart += m_previousLength-1; m_lookahead -= m_previousLength-1; m_matchAvailable = false; } else { m_previousLength = matchLength; m_previousMatch = matchPosition; LiteralByte(m_byteBuffer[m_stringStart-1]); m_stringStart++; m_lookahead--; } } else { m_previousLength = 0; m_previousLength = LongestMatch(m_previousMatch); if (m_previousLength) m_matchAvailable = true; else LiteralByte(m_byteBuffer[m_stringStart]); m_stringStart++; m_lookahead--; } assert(m_stringStart - (m_blockStart+m_blockLength) == (unsigned int)m_matchAvailable); } if (m_minLookahead == 0 && m_matchAvailable) { LiteralByte(m_byteBuffer[m_stringStart-1]); m_matchAvailable = false; } } size_t Deflator::Put2(const byte *str, size_t length, int messageEnd, bool blocking) { if (!blocking) throw BlockingInputOnly("Deflator"); size_t accepted = 0; while (accepted < length) { unsigned int newAccepted = FillWindow(str+accepted, length-accepted); ProcessBuffer(); // call ProcessUncompressedData() after WritePrestreamHeader() ProcessUncompressedData(str+accepted, newAccepted); accepted += newAccepted; } assert(accepted == length); if (messageEnd) { m_minLookahead = 0; ProcessBuffer(); EndBlock(true); FlushBitBuffer(); WritePoststreamTail(); Reset(); } Output(0, NULL, 0, messageEnd, blocking); return 0; } bool Deflator::IsolatedFlush(bool hardFlush, bool blocking) { if (!blocking) throw BlockingInputOnly("Deflator"); m_minLookahead = 0; ProcessBuffer(); m_minLookahead = MAX_MATCH; EndBlock(false); if (hardFlush) EncodeBlock(false, STORED); return false; } void Deflator::LiteralByte(byte b) { if (m_matchBufferEnd == m_matchBuffer.size()) EndBlock(false); m_matchBuffer[m_matchBufferEnd++].literalCode = b; m_literalCounts[b]++; m_blockLength++; } void Deflator::MatchFound(unsigned int distance, unsigned int length) { if (m_matchBufferEnd == m_matchBuffer.size()) EndBlock(false); static const unsigned int lengthCodes[] = { 257, 258, 259, 260, 261, 262, 263, 264, 265, 265, 266, 266, 267, 267, 268, 268, 269, 269, 269, 269, 270, 270, 270, 270, 271, 271, 271, 271, 272, 272, 272, 272, 273, 273, 273, 273, 273, 273, 273, 273, 274, 274, 274, 274, 274, 274, 274, 274, 275, 275, 275, 275, 275, 275, 275, 275, 276, 276, 276, 276, 276, 276, 276, 276, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 285}; static const unsigned int lengthBases[] = {3,4,5,6,7,8,9,10,11,13,15,17,19,23,27,31,35,43,51,59,67,83,99,115,131,163,195,227,258}; static const unsigned int distanceBases[30] = {1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577}; EncodedMatch &m = m_matchBuffer[m_matchBufferEnd++]; assert(length >= 3); unsigned int lengthCode = lengthCodes[length-3]; m.literalCode = lengthCode; m.literalExtra = length - lengthBases[lengthCode-257]; unsigned int distanceCode = (unsigned int)(upper_bound(distanceBases, distanceBases+30, distance) - distanceBases - 1); m.distanceCode = distanceCode; m.distanceExtra = distance - distanceBases[distanceCode]; m_literalCounts[lengthCode]++; m_distanceCounts[distanceCode]++; m_blockLength += length; } inline unsigned int CodeLengthEncode(const unsigned int *begin, const unsigned int *end, const unsigned int *& p, unsigned int &extraBits, unsigned int &extraBitsLength) { unsigned int v = *p; if ((end-p) >= 3) { const unsigned int *oldp = p; if (v==0 && p[1]==0 && p[2]==0) { for (p=p+3; p!=end && *p==0 && p!=oldp+138; p++) {} unsigned int repeat = (unsigned int)(p - oldp); if (repeat <= 10) { extraBits = repeat-3; extraBitsLength = 3; return 17; } else { extraBits = repeat-11; extraBitsLength = 7; return 18; } } else if (p!=begin && v==p[-1] && v==p[1] && v==p[2]) { for (p=p+3; p!=end && *p==v && p!=oldp+6; p++) {} unsigned int repeat = (unsigned int)(p - oldp); extraBits = repeat-3; extraBitsLength = 2; return 16; } } p++; extraBits = 0; extraBitsLength = 0; return v; } void Deflator::EncodeBlock(bool eof, unsigned int blockType) { PutBits(eof, 1); PutBits(blockType, 2); if (blockType == STORED) { assert(m_blockStart + m_blockLength <= m_byteBuffer.size()); assert(m_blockLength <= 0xffff); FlushBitBuffer(); AttachedTransformation()->PutWord16(m_blockLength, LITTLE_ENDIAN_ORDER); AttachedTransformation()->PutWord16(~m_blockLength, LITTLE_ENDIAN_ORDER); AttachedTransformation()->Put(m_byteBuffer + m_blockStart, m_blockLength); } else { if (blockType == DYNAMIC) { #if defined(_MSC_VER) && !defined(__MWERKS__) && (_MSC_VER <= 1300) // VC60 and VC7 workaround: built-in reverse_iterator has two template parameters, Dinkumware only has one typedef reverse_bidirectional_iterator RevIt; #elif defined(_RWSTD_NO_CLASS_PARTIAL_SPEC) typedef reverse_iterator RevIt; #else typedef reverse_iterator RevIt; #endif FixedSizeSecBlock literalCodeLengths; FixedSizeSecBlock distanceCodeLengths; m_literalCounts[256] = 1; HuffmanEncoder::GenerateCodeLengths(literalCodeLengths, 15, m_literalCounts, 286); m_dynamicLiteralEncoder.Initialize(literalCodeLengths, 286); unsigned int hlit = (unsigned int)(find_if(RevIt(literalCodeLengths.end()), RevIt(literalCodeLengths.begin()+257), bind2nd(not_equal_to(), 0)).base() - (literalCodeLengths.begin()+257)); HuffmanEncoder::GenerateCodeLengths(distanceCodeLengths, 15, m_distanceCounts, 30); m_dynamicDistanceEncoder.Initialize(distanceCodeLengths, 30); unsigned int hdist = (unsigned int)(find_if(RevIt(distanceCodeLengths.end()), RevIt(distanceCodeLengths.begin()+1), bind2nd(not_equal_to(), 0)).base() - (distanceCodeLengths.begin()+1)); SecBlockWithHint combinedLengths(hlit+257+hdist+1); memcpy(combinedLengths, literalCodeLengths, (hlit+257)*sizeof(unsigned int)); memcpy(combinedLengths+hlit+257, distanceCodeLengths, (hdist+1)*sizeof(unsigned int)); FixedSizeSecBlock codeLengthCodeCounts, codeLengthCodeLengths; fill(codeLengthCodeCounts.begin(), codeLengthCodeCounts.end(), 0); const unsigned int *p = combinedLengths.begin(), *begin = combinedLengths.begin(), *end = combinedLengths.end(); while (p != end) { unsigned int code, extraBits, extraBitsLength; code = CodeLengthEncode(begin, end, p, extraBits, extraBitsLength); codeLengthCodeCounts[code]++; } HuffmanEncoder::GenerateCodeLengths(codeLengthCodeLengths, 7, codeLengthCodeCounts, 19); HuffmanEncoder codeLengthEncoder(codeLengthCodeLengths, 19); static const unsigned int border[] = { // Order of the bit length code lengths 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; unsigned int hclen = 19; while (hclen > 4 && codeLengthCodeLengths[border[hclen-1]] == 0) hclen--; hclen -= 4; PutBits(hlit, 5); PutBits(hdist, 5); PutBits(hclen, 4); for (unsigned int i=0; i= 257) { assert(literalCode <= 285); PutBits(m_matchBuffer[i].literalExtra, lengthExtraBits[literalCode-257]); unsigned int distanceCode = m_matchBuffer[i].distanceCode; distanceEncoder.Encode(*this, distanceCode); PutBits(m_matchBuffer[i].distanceExtra, distanceExtraBits[distanceCode]); } } literalEncoder.Encode(*this, 256); // end of block } } void Deflator::EndBlock(bool eof) { if (m_blockLength == 0 && !eof) return; if (m_deflateLevel == 0) { EncodeBlock(eof, STORED); if (m_compressibleDeflateLevel > 0 && ++m_detectCount == m_detectSkip) { m_deflateLevel = m_compressibleDeflateLevel; m_detectCount = 1; } } else { unsigned long storedLen = 8*((unsigned long)m_blockLength+4) + RoundUpToMultipleOf(m_bitsBuffered+3, 8U)-m_bitsBuffered; StartCounting(); EncodeBlock(eof, STATIC); unsigned long staticLen = FinishCounting(); unsigned long dynamicLen; if (m_blockLength < 128 && m_deflateLevel < 8) dynamicLen = ULONG_MAX; else { StartCounting(); EncodeBlock(eof, DYNAMIC); dynamicLen = FinishCounting(); } if (storedLen <= staticLen && storedLen <= dynamicLen) { EncodeBlock(eof, STORED); if (m_compressibleDeflateLevel > 0) { if (m_detectSkip) m_deflateLevel = 0; m_detectSkip = m_detectSkip ? STDMIN(2*m_detectSkip, 128U) : 1; } } else { if (staticLen <= dynamicLen) EncodeBlock(eof, STATIC); else EncodeBlock(eof, DYNAMIC); if (m_compressibleDeflateLevel > 0) m_detectSkip = 0; } } m_matchBufferEnd = 0; m_blockStart += m_blockLength; m_blockLength = 0; fill(m_literalCounts.begin(), m_literalCounts.end(), 0); fill(m_distanceCounts.begin(), m_distanceCounts.end(), 0); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/sha.h0000755000000000000000000000460012414772654016522 0ustar rootroot#ifndef CRYPTOPP_SHA_H #define CRYPTOPP_SHA_H #include "iterhash.h" NAMESPACE_BEGIN(CryptoPP) /// SHA-1 class CRYPTOPP_DLL SHA1 : public IteratedHashWithStaticTransform { public: static void CRYPTOPP_API InitState(HashWordType *state); static void CRYPTOPP_API Transform(word32 *digest, const word32 *data); static const char * CRYPTOPP_API StaticAlgorithmName() {return "SHA-1";} }; typedef SHA1 SHA; // for backwards compatibility //! implements the SHA-256 standard class CRYPTOPP_DLL SHA256 : public IteratedHashWithStaticTransform { public: #if defined(CRYPTOPP_X86_ASM_AVAILABLE) || defined(CRYPTOPP_X64_MASM_AVAILABLE) size_t HashMultipleBlocks(const word32 *input, size_t length); #endif static void CRYPTOPP_API InitState(HashWordType *state); static void CRYPTOPP_API Transform(word32 *digest, const word32 *data); static const char * CRYPTOPP_API StaticAlgorithmName() {return "SHA-256";} }; //! implements the SHA-224 standard class CRYPTOPP_DLL SHA224 : public IteratedHashWithStaticTransform { public: #if defined(CRYPTOPP_X86_ASM_AVAILABLE) || defined(CRYPTOPP_X64_MASM_AVAILABLE) size_t HashMultipleBlocks(const word32 *input, size_t length); #endif static void CRYPTOPP_API InitState(HashWordType *state); static void CRYPTOPP_API Transform(word32 *digest, const word32 *data) {SHA256::Transform(digest, data);} static const char * CRYPTOPP_API StaticAlgorithmName() {return "SHA-224";} }; //! implements the SHA-512 standard class CRYPTOPP_DLL SHA512 : public IteratedHashWithStaticTransform { public: static void CRYPTOPP_API InitState(HashWordType *state); static void CRYPTOPP_API Transform(word64 *digest, const word64 *data); static const char * CRYPTOPP_API StaticAlgorithmName() {return "SHA-512";} }; //! implements the SHA-384 standard class CRYPTOPP_DLL SHA384 : public IteratedHashWithStaticTransform { public: static void CRYPTOPP_API InitState(HashWordType *state); static void CRYPTOPP_API Transform(word64 *digest, const word64 *data) {SHA512::Transform(digest, data);} static const char * CRYPTOPP_API StaticAlgorithmName() {return "SHA-384";} }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/seckey.h0000755000000000000000000001634112414772654017237 0ustar rootroot// seckey.h - written and placed in the public domain by Wei Dai // This file contains helper classes/functions for implementing secret key algorithms. #ifndef CRYPTOPP_SECKEY_H #define CRYPTOPP_SECKEY_H #include "cryptlib.h" #include "misc.h" #include "simple.h" NAMESPACE_BEGIN(CryptoPP) inline CipherDir ReverseCipherDir(CipherDir dir) { return (dir == ENCRYPTION) ? DECRYPTION : ENCRYPTION; } //! to be inherited by block ciphers with fixed block size template class FixedBlockSize { public: CRYPTOPP_CONSTANT(BLOCKSIZE = N) }; // ************** rounds *************** //! to be inherited by ciphers with fixed number of rounds template class FixedRounds { public: CRYPTOPP_CONSTANT(ROUNDS = R) }; //! to be inherited by ciphers with variable number of rounds template // use INT_MAX here because enums are treated as signed ints class VariableRounds { public: CRYPTOPP_CONSTANT(DEFAULT_ROUNDS = D) CRYPTOPP_CONSTANT(MIN_ROUNDS = N) CRYPTOPP_CONSTANT(MAX_ROUNDS = M) static unsigned int StaticGetDefaultRounds(size_t keylength) {return DEFAULT_ROUNDS;} protected: inline void ThrowIfInvalidRounds(int rounds, const Algorithm *alg) { if (rounds < MIN_ROUNDS || rounds > MAX_ROUNDS) throw InvalidRounds(alg->AlgorithmName(), rounds); } inline unsigned int GetRoundsAndThrowIfInvalid(const NameValuePairs ¶m, const Algorithm *alg) { int rounds = param.GetIntValueWithDefault("Rounds", DEFAULT_ROUNDS); ThrowIfInvalidRounds(rounds, alg); return (unsigned int)rounds; } }; // ************** key length *************** //! to be inherited by keyed algorithms with fixed key length template class FixedKeyLength { public: CRYPTOPP_CONSTANT(KEYLENGTH=N) CRYPTOPP_CONSTANT(MIN_KEYLENGTH=N) CRYPTOPP_CONSTANT(MAX_KEYLENGTH=N) CRYPTOPP_CONSTANT(DEFAULT_KEYLENGTH=N) CRYPTOPP_CONSTANT(IV_REQUIREMENT = IV_REQ) CRYPTOPP_CONSTANT(IV_LENGTH = IV_L) static size_t CRYPTOPP_API StaticGetValidKeyLength(size_t) {return KEYLENGTH;} }; /// support query of variable key length, template parameters are default, min, max, multiple (default multiple 1) template class VariableKeyLength { // make these private to avoid Doxygen documenting them in all derived classes CRYPTOPP_COMPILE_ASSERT(Q > 0); CRYPTOPP_COMPILE_ASSERT(N % Q == 0); CRYPTOPP_COMPILE_ASSERT(M % Q == 0); CRYPTOPP_COMPILE_ASSERT(N < M); CRYPTOPP_COMPILE_ASSERT(D >= N); CRYPTOPP_COMPILE_ASSERT(M >= D); public: CRYPTOPP_CONSTANT(MIN_KEYLENGTH=N) CRYPTOPP_CONSTANT(MAX_KEYLENGTH=M) CRYPTOPP_CONSTANT(DEFAULT_KEYLENGTH=D) CRYPTOPP_CONSTANT(KEYLENGTH_MULTIPLE=Q) CRYPTOPP_CONSTANT(IV_REQUIREMENT=IV_REQ) CRYPTOPP_CONSTANT(IV_LENGTH=IV_L) static size_t CRYPTOPP_API StaticGetValidKeyLength(size_t n) { if (n < (size_t)MIN_KEYLENGTH) return MIN_KEYLENGTH; else if (n > (size_t)MAX_KEYLENGTH) return (size_t)MAX_KEYLENGTH; else { n += KEYLENGTH_MULTIPLE-1; return n - n%KEYLENGTH_MULTIPLE; } } }; /// support query of key length that's the same as another class template class SameKeyLengthAs { public: CRYPTOPP_CONSTANT(MIN_KEYLENGTH=T::MIN_KEYLENGTH) CRYPTOPP_CONSTANT(MAX_KEYLENGTH=T::MAX_KEYLENGTH) CRYPTOPP_CONSTANT(DEFAULT_KEYLENGTH=T::DEFAULT_KEYLENGTH) CRYPTOPP_CONSTANT(IV_REQUIREMENT=IV_REQ) CRYPTOPP_CONSTANT(IV_LENGTH=IV_L) static size_t CRYPTOPP_API StaticGetValidKeyLength(size_t keylength) {return T::StaticGetValidKeyLength(keylength);} }; // ************** implementation helper for SimpleKeyed *************** //! _ template class CRYPTOPP_NO_VTABLE SimpleKeyingInterfaceImpl : public BASE { public: size_t MinKeyLength() const {return INFO::MIN_KEYLENGTH;} size_t MaxKeyLength() const {return (size_t)INFO::MAX_KEYLENGTH;} size_t DefaultKeyLength() const {return INFO::DEFAULT_KEYLENGTH;} size_t GetValidKeyLength(size_t n) const {return INFO::StaticGetValidKeyLength(n);} SimpleKeyingInterface::IV_Requirement IVRequirement() const {return (SimpleKeyingInterface::IV_Requirement)INFO::IV_REQUIREMENT;} unsigned int IVSize() const {return INFO::IV_LENGTH;} }; template class CRYPTOPP_NO_VTABLE BlockCipherImpl : public AlgorithmImpl > > { public: unsigned int BlockSize() const {return this->BLOCKSIZE;} }; //! _ template class BlockCipherFinal : public ClonableImpl, BASE> { public: BlockCipherFinal() {} BlockCipherFinal(const byte *key) {this->SetKey(key, this->DEFAULT_KEYLENGTH);} BlockCipherFinal(const byte *key, size_t length) {this->SetKey(key, length);} BlockCipherFinal(const byte *key, size_t length, unsigned int rounds) {this->SetKeyWithRounds(key, length, rounds);} bool IsForwardTransformation() const {return DIR == ENCRYPTION;} }; //! _ template class MessageAuthenticationCodeImpl : public AlgorithmImpl, INFO> { }; //! _ template class MessageAuthenticationCodeFinal : public ClonableImpl, MessageAuthenticationCodeImpl > { public: MessageAuthenticationCodeFinal() {} MessageAuthenticationCodeFinal(const byte *key) {this->SetKey(key, this->DEFAULT_KEYLENGTH);} MessageAuthenticationCodeFinal(const byte *key, size_t length) {this->SetKey(key, length);} }; // ************** documentation *************** //! These objects usually should not be used directly. See CipherModeDocumentation instead. /*! Each class derived from this one defines two types, Encryption and Decryption, both of which implement the BlockCipher interface. */ struct BlockCipherDocumentation { //! implements the BlockCipher interface typedef BlockCipher Encryption; //! implements the BlockCipher interface typedef BlockCipher Decryption; }; /*! \brief Each class derived from this one defines two types, Encryption and Decryption, both of which implement the SymmetricCipher interface. Two types of classes derive from this class: stream ciphers and block cipher modes. Stream ciphers can be used alone, cipher mode classes need to be used with a block cipher. See CipherModeDocumentation for more for information about using cipher modes and block ciphers. */ struct SymmetricCipherDocumentation { //! implements the SymmetricCipher interface typedef SymmetricCipher Encryption; //! implements the SymmetricCipher interface typedef SymmetricCipher Decryption; }; /*! \brief Each class derived from this one defines two types, Encryption and Decryption, both of which implement the AuthenticatedSymmetricCipher interface. */ struct AuthenticatedSymmetricCipherDocumentation { //! implements the AuthenticatedSymmetricCipher interface typedef AuthenticatedSymmetricCipher Encryption; //! implements the AuthenticatedSymmetricCipher interface typedef AuthenticatedSymmetricCipher Decryption; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/osrng.cpp0000755000000000000000000000661012414772654017435 0ustar rootroot// osrng.cpp - written and placed in the public domain by Wei Dai // Thanks to Leonard Janke for the suggestion for AutoSeededRandomPool. #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "osrng.h" #ifdef OS_RNG_AVAILABLE #include "rng.h" #ifdef CRYPTOPP_WIN32_AVAILABLE #ifndef _WIN32_WINNT #define _WIN32_WINNT 0x0400 #endif #include #include #endif #ifdef CRYPTOPP_UNIX_AVAILABLE #include #include #include #endif NAMESPACE_BEGIN(CryptoPP) #if defined(NONBLOCKING_RNG_AVAILABLE) || defined(BLOCKING_RNG_AVAILABLE) OS_RNG_Err::OS_RNG_Err(const std::string &operation) : Exception(OTHER_ERROR, "OS_Rng: " + operation + " operation failed with error " + #ifdef CRYPTOPP_WIN32_AVAILABLE "0x" + IntToString(GetLastError(), 16) #else IntToString(errno) #endif ) { } #endif #ifdef NONBLOCKING_RNG_AVAILABLE #ifdef CRYPTOPP_WIN32_AVAILABLE MicrosoftCryptoProvider::MicrosoftCryptoProvider() { if(!CryptAcquireContext(&m_hProvider, 0, 0, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT)) throw OS_RNG_Err("CryptAcquireContext"); } MicrosoftCryptoProvider::~MicrosoftCryptoProvider() { CryptReleaseContext(m_hProvider, 0); } #endif NonblockingRng::NonblockingRng() { #ifndef CRYPTOPP_WIN32_AVAILABLE m_fd = open("/dev/urandom",O_RDONLY); if (m_fd == -1) throw OS_RNG_Err("open /dev/urandom"); #endif } NonblockingRng::~NonblockingRng() { #ifndef CRYPTOPP_WIN32_AVAILABLE close(m_fd); #endif } void NonblockingRng::GenerateBlock(byte *output, size_t size) { #ifdef CRYPTOPP_WIN32_AVAILABLE # ifdef WORKAROUND_MS_BUG_Q258000 const MicrosoftCryptoProvider &m_Provider = Singleton().Ref(); # endif if (!CryptGenRandom(m_Provider.GetProviderHandle(), (DWORD)size, output)) throw OS_RNG_Err("CryptGenRandom"); #else if (read(m_fd, output, size) != size) throw OS_RNG_Err("read /dev/urandom"); #endif } #endif // ************************************************************* #ifdef BLOCKING_RNG_AVAILABLE #ifndef CRYPTOPP_BLOCKING_RNG_FILENAME #ifdef __OpenBSD__ #define CRYPTOPP_BLOCKING_RNG_FILENAME "/dev/srandom" #else #define CRYPTOPP_BLOCKING_RNG_FILENAME "/dev/random" #endif #endif BlockingRng::BlockingRng() { m_fd = open(CRYPTOPP_BLOCKING_RNG_FILENAME,O_RDONLY); if (m_fd == -1) throw OS_RNG_Err("open " CRYPTOPP_BLOCKING_RNG_FILENAME); } BlockingRng::~BlockingRng() { close(m_fd); } void BlockingRng::GenerateBlock(byte *output, size_t size) { while (size) { // on some systems /dev/random will block until all bytes // are available, on others it will returns immediately ssize_t len = read(m_fd, output, size); if (len < 0) throw OS_RNG_Err("read " CRYPTOPP_BLOCKING_RNG_FILENAME); size -= len; output += len; if (size) sleep(1); } } #endif // ************************************************************* void OS_GenerateRandomBlock(bool blocking, byte *output, size_t size) { #ifdef NONBLOCKING_RNG_AVAILABLE if (blocking) #endif { #ifdef BLOCKING_RNG_AVAILABLE BlockingRng rng; rng.GenerateBlock(output, size); #endif } #ifdef BLOCKING_RNG_AVAILABLE if (!blocking) #endif { #ifdef NONBLOCKING_RNG_AVAILABLE NonblockingRng rng; rng.GenerateBlock(output, size); #endif } } void AutoSeededRandomPool::Reseed(bool blocking, unsigned int seedSize) { SecByteBlock seed(seedSize); OS_GenerateRandomBlock(blocking, seed, seedSize); IncorporateEntropy(seed, seedSize); } NAMESPACE_END #endif #endif armory-0.92.3/cppForSwig/cryptopp/modes.h0000755000000000000000000004157112414772654017066 0ustar rootroot#ifndef CRYPTOPP_MODES_H #define CRYPTOPP_MODES_H /*! \file */ #include "cryptlib.h" #include "secblock.h" #include "misc.h" #include "strciphr.h" #include "argnames.h" #include "algparam.h" NAMESPACE_BEGIN(CryptoPP) //! Cipher modes documentation. See NIST SP 800-38A for definitions of these modes. See AuthenticatedSymmetricCipherDocumentation for authenticated encryption modes. /*! Each class derived from this one defines two types, Encryption and Decryption, both of which implement the SymmetricCipher interface. For each mode there are two classes, one of which is a template class, and the other one has a name that ends in "_ExternalCipher". The "external cipher" mode objects hold a reference to the underlying block cipher, instead of holding an instance of it. The reference must be passed in to the constructor. For the "cipher holder" classes, the CIPHER template parameter should be a class derived from BlockCipherDocumentation, for example DES or AES. */ struct CipherModeDocumentation : public SymmetricCipherDocumentation { }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CipherModeBase : public SymmetricCipher { public: size_t MinKeyLength() const {return m_cipher->MinKeyLength();} size_t MaxKeyLength() const {return m_cipher->MaxKeyLength();} size_t DefaultKeyLength() const {return m_cipher->DefaultKeyLength();} size_t GetValidKeyLength(size_t n) const {return m_cipher->GetValidKeyLength(n);} bool IsValidKeyLength(size_t n) const {return m_cipher->IsValidKeyLength(n);} unsigned int OptimalDataAlignment() const {return m_cipher->OptimalDataAlignment();} unsigned int IVSize() const {return BlockSize();} virtual IV_Requirement IVRequirement() const =0; void SetCipher(BlockCipher &cipher) { this->ThrowIfResynchronizable(); this->m_cipher = &cipher; this->ResizeBuffers(); } void SetCipherWithIV(BlockCipher &cipher, const byte *iv, int feedbackSize = 0) { this->ThrowIfInvalidIV(iv); this->m_cipher = &cipher; this->ResizeBuffers(); this->SetFeedbackSize(feedbackSize); if (this->IsResynchronizable()) this->Resynchronize(iv); } protected: CipherModeBase() : m_cipher(NULL) {} inline unsigned int BlockSize() const {assert(m_register.size() > 0); return (unsigned int)m_register.size();} virtual void SetFeedbackSize(unsigned int feedbackSize) { if (!(feedbackSize == 0 || feedbackSize == BlockSize())) throw InvalidArgument("CipherModeBase: feedback size cannot be specified for this cipher mode"); } virtual void ResizeBuffers() { m_register.New(m_cipher->BlockSize()); } BlockCipher *m_cipher; AlignedSecByteBlock m_register; }; template class CRYPTOPP_NO_VTABLE ModePolicyCommonTemplate : public CipherModeBase, public POLICY_INTERFACE { unsigned int GetAlignment() const {return m_cipher->OptimalDataAlignment();} void CipherSetKey(const NameValuePairs ¶ms, const byte *key, size_t length); }; template void ModePolicyCommonTemplate::CipherSetKey(const NameValuePairs ¶ms, const byte *key, size_t length) { m_cipher->SetKey(key, length, params); ResizeBuffers(); int feedbackSize = params.GetIntValueWithDefault(Name::FeedbackSize(), 0); SetFeedbackSize(feedbackSize); } class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CFB_ModePolicy : public ModePolicyCommonTemplate { public: IV_Requirement IVRequirement() const {return RANDOM_IV;} static const char * CRYPTOPP_API StaticAlgorithmName() {return "CFB";} protected: unsigned int GetBytesPerIteration() const {return m_feedbackSize;} byte * GetRegisterBegin() {return m_register + BlockSize() - m_feedbackSize;} bool CanIterate() const {return m_feedbackSize == BlockSize();} void Iterate(byte *output, const byte *input, CipherDir dir, size_t iterationCount); void TransformRegister(); void CipherResynchronize(const byte *iv, size_t length); void SetFeedbackSize(unsigned int feedbackSize); void ResizeBuffers(); SecByteBlock m_temp; unsigned int m_feedbackSize; }; inline void CopyOrZero(void *dest, const void *src, size_t s) { if (src) memcpy_s(dest, s, src, s); else memset(dest, 0, s); } class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE OFB_ModePolicy : public ModePolicyCommonTemplate { public: bool CipherIsRandomAccess() const {return false;} IV_Requirement IVRequirement() const {return UNIQUE_IV;} static const char * CRYPTOPP_API StaticAlgorithmName() {return "OFB";} private: unsigned int GetBytesPerIteration() const {return BlockSize();} unsigned int GetIterationsToBuffer() const {return m_cipher->OptimalNumberOfParallelBlocks();} void WriteKeystream(byte *keystreamBuffer, size_t iterationCount); void CipherResynchronize(byte *keystreamBuffer, const byte *iv, size_t length); }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CTR_ModePolicy : public ModePolicyCommonTemplate { public: bool CipherIsRandomAccess() const {return true;} IV_Requirement IVRequirement() const {return RANDOM_IV;} static const char * CRYPTOPP_API StaticAlgorithmName() {return "CTR";} protected: virtual void IncrementCounterBy256(); unsigned int GetAlignment() const {return m_cipher->OptimalDataAlignment();} unsigned int GetBytesPerIteration() const {return BlockSize();} unsigned int GetIterationsToBuffer() const {return m_cipher->OptimalNumberOfParallelBlocks();} void WriteKeystream(byte *buffer, size_t iterationCount) {OperateKeystream(WRITE_KEYSTREAM, buffer, NULL, iterationCount);} bool CanOperateKeystream() const {return true;} void OperateKeystream(KeystreamOperation operation, byte *output, const byte *input, size_t iterationCount); void CipherResynchronize(byte *keystreamBuffer, const byte *iv, size_t length); void SeekToIteration(lword iterationCount); AlignedSecByteBlock m_counterArray; }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE BlockOrientedCipherModeBase : public CipherModeBase { public: void UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms); unsigned int MandatoryBlockSize() const {return BlockSize();} bool IsRandomAccess() const {return false;} bool IsSelfInverting() const {return false;} bool IsForwardTransformation() const {return m_cipher->IsForwardTransformation();} void Resynchronize(const byte *iv, int length=-1) {memcpy_s(m_register, m_register.size(), iv, ThrowIfInvalidIVLength(length));} protected: bool RequireAlignedInput() const {return true;} void ResizeBuffers() { CipherModeBase::ResizeBuffers(); m_buffer.New(BlockSize()); } SecByteBlock m_buffer; }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE ECB_OneWay : public BlockOrientedCipherModeBase { public: void SetKey(const byte *key, size_t length, const NameValuePairs ¶ms = g_nullNameValuePairs) {m_cipher->SetKey(key, length, params); BlockOrientedCipherModeBase::ResizeBuffers();} IV_Requirement IVRequirement() const {return NOT_RESYNCHRONIZABLE;} unsigned int OptimalBlockSize() const {return BlockSize() * m_cipher->OptimalNumberOfParallelBlocks();} void ProcessData(byte *outString, const byte *inString, size_t length); static const char * CRYPTOPP_API StaticAlgorithmName() {return "ECB";} }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CBC_ModeBase : public BlockOrientedCipherModeBase { public: IV_Requirement IVRequirement() const {return UNPREDICTABLE_RANDOM_IV;} bool RequireAlignedInput() const {return false;} unsigned int MinLastBlockSize() const {return 0;} static const char * CRYPTOPP_API StaticAlgorithmName() {return "CBC";} }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CBC_Encryption : public CBC_ModeBase { public: void ProcessData(byte *outString, const byte *inString, size_t length); }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CBC_CTS_Encryption : public CBC_Encryption { public: void SetStolenIV(byte *iv) {m_stolenIV = iv;} unsigned int MinLastBlockSize() const {return BlockSize()+1;} void ProcessLastBlock(byte *outString, const byte *inString, size_t length); static const char * CRYPTOPP_API StaticAlgorithmName() {return "CBC/CTS";} protected: void UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms) { CBC_Encryption::UncheckedSetKey(key, length, params); m_stolenIV = params.GetValueWithDefault(Name::StolenIV(), (byte *)NULL); } byte *m_stolenIV; }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CBC_Decryption : public CBC_ModeBase { public: void ProcessData(byte *outString, const byte *inString, size_t length); protected: void ResizeBuffers() { BlockOrientedCipherModeBase::ResizeBuffers(); m_temp.New(BlockSize()); } AlignedSecByteBlock m_temp; }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CBC_CTS_Decryption : public CBC_Decryption { public: unsigned int MinLastBlockSize() const {return BlockSize()+1;} void ProcessLastBlock(byte *outString, const byte *inString, size_t length); }; //! _ template class CipherModeFinalTemplate_CipherHolder : protected ObjectHolder, public AlgorithmImpl > { public: CipherModeFinalTemplate_CipherHolder() { this->m_cipher = &this->m_object; this->ResizeBuffers(); } CipherModeFinalTemplate_CipherHolder(const byte *key, size_t length) { this->m_cipher = &this->m_object; this->SetKey(key, length); } CipherModeFinalTemplate_CipherHolder(const byte *key, size_t length, const byte *iv) { this->m_cipher = &this->m_object; this->SetKey(key, length, MakeParameters(Name::IV(), ConstByteArrayParameter(iv, this->m_cipher->BlockSize()))); } CipherModeFinalTemplate_CipherHolder(const byte *key, size_t length, const byte *iv, int feedbackSize) { this->m_cipher = &this->m_object; this->SetKey(key, length, MakeParameters(Name::IV(), ConstByteArrayParameter(iv, this->m_cipher->BlockSize()))(Name::FeedbackSize(), feedbackSize)); } static std::string CRYPTOPP_API StaticAlgorithmName() {return CIPHER::StaticAlgorithmName() + "/" + BASE::StaticAlgorithmName();} }; //! _ template class CipherModeFinalTemplate_ExternalCipher : public BASE { public: CipherModeFinalTemplate_ExternalCipher() {} CipherModeFinalTemplate_ExternalCipher(BlockCipher &cipher) {this->SetCipher(cipher);} CipherModeFinalTemplate_ExternalCipher(BlockCipher &cipher, const byte *iv, int feedbackSize = 0) {this->SetCipherWithIV(cipher, iv, feedbackSize);} std::string AlgorithmName() const {return (this->m_cipher ? this->m_cipher->AlgorithmName() + "/" : std::string("")) + BASE::StaticAlgorithmName();} }; CRYPTOPP_DLL_TEMPLATE_CLASS CFB_CipherTemplate >; CRYPTOPP_DLL_TEMPLATE_CLASS CFB_EncryptionTemplate >; CRYPTOPP_DLL_TEMPLATE_CLASS CFB_DecryptionTemplate >; //! CFB mode template struct CFB_Mode : public CipherModeDocumentation { typedef CipherModeFinalTemplate_CipherHolder > > > Encryption; typedef CipherModeFinalTemplate_CipherHolder > > > Decryption; }; //! CFB mode, external cipher struct CFB_Mode_ExternalCipher : public CipherModeDocumentation { typedef CipherModeFinalTemplate_ExternalCipher > > > Encryption; typedef CipherModeFinalTemplate_ExternalCipher > > > Decryption; }; //! CFB mode FIPS variant, requiring full block plaintext according to FIPS 800-38A template struct CFB_FIPS_Mode : public CipherModeDocumentation { typedef CipherModeFinalTemplate_CipherHolder > > > > Encryption; typedef CipherModeFinalTemplate_CipherHolder > > > > Decryption; }; //! CFB mode FIPS variant, requiring full block plaintext according to FIPS 800-38A, external cipher struct CFB_FIPS_Mode_ExternalCipher : public CipherModeDocumentation { typedef CipherModeFinalTemplate_ExternalCipher > > > > Encryption; typedef CipherModeFinalTemplate_ExternalCipher > > > > Decryption; }; CRYPTOPP_DLL_TEMPLATE_CLASS AdditiveCipherTemplate >; //! OFB mode template struct OFB_Mode : public CipherModeDocumentation { typedef CipherModeFinalTemplate_CipherHolder > > > Encryption; typedef Encryption Decryption; }; //! OFB mode, external cipher struct OFB_Mode_ExternalCipher : public CipherModeDocumentation { typedef CipherModeFinalTemplate_ExternalCipher > > > Encryption; typedef Encryption Decryption; }; CRYPTOPP_DLL_TEMPLATE_CLASS AdditiveCipherTemplate >; CRYPTOPP_DLL_TEMPLATE_CLASS CipherModeFinalTemplate_ExternalCipher > > >; //! CTR mode template struct CTR_Mode : public CipherModeDocumentation { typedef CipherModeFinalTemplate_CipherHolder > > > Encryption; typedef Encryption Decryption; }; //! CTR mode, external cipher struct CTR_Mode_ExternalCipher : public CipherModeDocumentation { typedef CipherModeFinalTemplate_ExternalCipher > > > Encryption; typedef Encryption Decryption; }; //! ECB mode template struct ECB_Mode : public CipherModeDocumentation { typedef CipherModeFinalTemplate_CipherHolder Encryption; typedef CipherModeFinalTemplate_CipherHolder Decryption; }; CRYPTOPP_DLL_TEMPLATE_CLASS CipherModeFinalTemplate_ExternalCipher; //! ECB mode, external cipher struct ECB_Mode_ExternalCipher : public CipherModeDocumentation { typedef CipherModeFinalTemplate_ExternalCipher Encryption; typedef Encryption Decryption; }; //! CBC mode template struct CBC_Mode : public CipherModeDocumentation { typedef CipherModeFinalTemplate_CipherHolder Encryption; typedef CipherModeFinalTemplate_CipherHolder Decryption; }; CRYPTOPP_DLL_TEMPLATE_CLASS CipherModeFinalTemplate_ExternalCipher; CRYPTOPP_DLL_TEMPLATE_CLASS CipherModeFinalTemplate_ExternalCipher; //! CBC mode, external cipher struct CBC_Mode_ExternalCipher : public CipherModeDocumentation { typedef CipherModeFinalTemplate_ExternalCipher Encryption; typedef CipherModeFinalTemplate_ExternalCipher Decryption; }; //! CBC mode with ciphertext stealing template struct CBC_CTS_Mode : public CipherModeDocumentation { typedef CipherModeFinalTemplate_CipherHolder Encryption; typedef CipherModeFinalTemplate_CipherHolder Decryption; }; CRYPTOPP_DLL_TEMPLATE_CLASS CipherModeFinalTemplate_ExternalCipher; CRYPTOPP_DLL_TEMPLATE_CLASS CipherModeFinalTemplate_ExternalCipher; //! CBC mode with ciphertext stealing, external cipher struct CBC_CTS_Mode_ExternalCipher : public CipherModeDocumentation { typedef CipherModeFinalTemplate_ExternalCipher Encryption; typedef CipherModeFinalTemplate_ExternalCipher Decryption; }; #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY typedef CFB_Mode_ExternalCipher::Encryption CFBEncryption; typedef CFB_Mode_ExternalCipher::Decryption CFBDecryption; typedef OFB_Mode_ExternalCipher::Encryption OFB; typedef CTR_Mode_ExternalCipher::Encryption CounterMode; #endif NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/seed.cpp0000755000000000000000000001173612414772654017232 0ustar rootroot// seed.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "seed.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) static const word32 s_kc[16] = { 0x9e3779b9, 0x3c6ef373, 0x78dde6e6, 0xf1bbcdcc, 0xe3779b99, 0xc6ef3733, 0x8dde6e67, 0x1bbcdccf, 0x3779b99e, 0x6ef3733c, 0xdde6e678, 0xbbcdccf1, 0x779b99e3, 0xef3733c6, 0xde6e678d, 0xbcdccf1b}; static const byte s_s0[256] = { 0xA9, 0x85, 0xD6, 0xD3, 0x54, 0x1D, 0xAC, 0x25, 0x5D, 0x43, 0x18, 0x1E, 0x51, 0xFC, 0xCA, 0x63, 0x28, 0x44, 0x20, 0x9D, 0xE0, 0xE2, 0xC8, 0x17, 0xA5, 0x8F, 0x03, 0x7B, 0xBB, 0x13, 0xD2, 0xEE, 0x70, 0x8C, 0x3F, 0xA8, 0x32, 0xDD, 0xF6, 0x74, 0xEC, 0x95, 0x0B, 0x57, 0x5C, 0x5B, 0xBD, 0x01, 0x24, 0x1C, 0x73, 0x98, 0x10, 0xCC, 0xF2, 0xD9, 0x2C, 0xE7, 0x72, 0x83, 0x9B, 0xD1, 0x86, 0xC9, 0x60, 0x50, 0xA3, 0xEB, 0x0D, 0xB6, 0x9E, 0x4F, 0xB7, 0x5A, 0xC6, 0x78, 0xA6, 0x12, 0xAF, 0xD5, 0x61, 0xC3, 0xB4, 0x41, 0x52, 0x7D, 0x8D, 0x08, 0x1F, 0x99, 0x00, 0x19, 0x04, 0x53, 0xF7, 0xE1, 0xFD, 0x76, 0x2F, 0x27, 0xB0, 0x8B, 0x0E, 0xAB, 0xA2, 0x6E, 0x93, 0x4D, 0x69, 0x7C, 0x09, 0x0A, 0xBF, 0xEF, 0xF3, 0xC5, 0x87, 0x14, 0xFE, 0x64, 0xDE, 0x2E, 0x4B, 0x1A, 0x06, 0x21, 0x6B, 0x66, 0x02, 0xF5, 0x92, 0x8A, 0x0C, 0xB3, 0x7E, 0xD0, 0x7A, 0x47, 0x96, 0xE5, 0x26, 0x80, 0xAD, 0xDF, 0xA1, 0x30, 0x37, 0xAE, 0x36, 0x15, 0x22, 0x38, 0xF4, 0xA7, 0x45, 0x4C, 0x81, 0xE9, 0x84, 0x97, 0x35, 0xCB, 0xCE, 0x3C, 0x71, 0x11, 0xC7, 0x89, 0x75, 0xFB, 0xDA, 0xF8, 0x94, 0x59, 0x82, 0xC4, 0xFF, 0x49, 0x39, 0x67, 0xC0, 0xCF, 0xD7, 0xB8, 0x0F, 0x8E, 0x42, 0x23, 0x91, 0x6C, 0xDB, 0xA4, 0x34, 0xF1, 0x48, 0xC2, 0x6F, 0x3D, 0x2D, 0x40, 0xBE, 0x3E, 0xBC, 0xC1, 0xAA, 0xBA, 0x4E, 0x55, 0x3B, 0xDC, 0x68, 0x7F, 0x9C, 0xD8, 0x4A, 0x56, 0x77, 0xA0, 0xED, 0x46, 0xB5, 0x2B, 0x65, 0xFA, 0xE3, 0xB9, 0xB1, 0x9F, 0x5E, 0xF9, 0xE6, 0xB2, 0x31, 0xEA, 0x6D, 0x5F, 0xE4, 0xF0, 0xCD, 0x88, 0x16, 0x3A, 0x58, 0xD4, 0x62, 0x29, 0x07, 0x33, 0xE8, 0x1B, 0x05, 0x79, 0x90, 0x6A, 0x2A, 0x9A}; static const byte s_s1[256] = { 0x38, 0xE8, 0x2D, 0xA6, 0xCF, 0xDE, 0xB3, 0xB8, 0xAF, 0x60, 0x55, 0xC7, 0x44, 0x6F, 0x6B, 0x5B, 0xC3, 0x62, 0x33, 0xB5, 0x29, 0xA0, 0xE2, 0xA7, 0xD3, 0x91, 0x11, 0x06, 0x1C, 0xBC, 0x36, 0x4B, 0xEF, 0x88, 0x6C, 0xA8, 0x17, 0xC4, 0x16, 0xF4, 0xC2, 0x45, 0xE1, 0xD6, 0x3F, 0x3D, 0x8E, 0x98, 0x28, 0x4E, 0xF6, 0x3E, 0xA5, 0xF9, 0x0D, 0xDF, 0xD8, 0x2B, 0x66, 0x7A, 0x27, 0x2F, 0xF1, 0x72, 0x42, 0xD4, 0x41, 0xC0, 0x73, 0x67, 0xAC, 0x8B, 0xF7, 0xAD, 0x80, 0x1F, 0xCA, 0x2C, 0xAA, 0x34, 0xD2, 0x0B, 0xEE, 0xE9, 0x5D, 0x94, 0x18, 0xF8, 0x57, 0xAE, 0x08, 0xC5, 0x13, 0xCD, 0x86, 0xB9, 0xFF, 0x7D, 0xC1, 0x31, 0xF5, 0x8A, 0x6A, 0xB1, 0xD1, 0x20, 0xD7, 0x02, 0x22, 0x04, 0x68, 0x71, 0x07, 0xDB, 0x9D, 0x99, 0x61, 0xBE, 0xE6, 0x59, 0xDD, 0x51, 0x90, 0xDC, 0x9A, 0xA3, 0xAB, 0xD0, 0x81, 0x0F, 0x47, 0x1A, 0xE3, 0xEC, 0x8D, 0xBF, 0x96, 0x7B, 0x5C, 0xA2, 0xA1, 0x63, 0x23, 0x4D, 0xC8, 0x9E, 0x9C, 0x3A, 0x0C, 0x2E, 0xBA, 0x6E, 0x9F, 0x5A, 0xF2, 0x92, 0xF3, 0x49, 0x78, 0xCC, 0x15, 0xFB, 0x70, 0x75, 0x7F, 0x35, 0x10, 0x03, 0x64, 0x6D, 0xC6, 0x74, 0xD5, 0xB4, 0xEA, 0x09, 0x76, 0x19, 0xFE, 0x40, 0x12, 0xE0, 0xBD, 0x05, 0xFA, 0x01, 0xF0, 0x2A, 0x5E, 0xA9, 0x56, 0x43, 0x85, 0x14, 0x89, 0x9B, 0xB0, 0xE5, 0x48, 0x79, 0x97, 0xFC, 0x1E, 0x82, 0x21, 0x8C, 0x1B, 0x5F, 0x77, 0x54, 0xB2, 0x1D, 0x25, 0x4F, 0x00, 0x46, 0xED, 0x58, 0x52, 0xEB, 0x7E, 0xDA, 0xC9, 0xFD, 0x30, 0x95, 0x65, 0x3C, 0xB6, 0xE4, 0xBB, 0x7C, 0x0E, 0x50, 0x39, 0x26, 0x32, 0x84, 0x69, 0x93, 0x37, 0xE7, 0x24, 0xA4, 0xCB, 0x53, 0x0A, 0x87, 0xD9, 0x4C, 0x83, 0x8F, 0xCE, 0x3B, 0x4A, 0xB7}; #define SS0(x) ((s_s0[x]*0x01010101UL) & 0x3FCFF3FC) #define SS1(x) ((s_s1[x]*0x01010101UL) & 0xFC3FCFF3) #define SS2(x) ((s_s0[x]*0x01010101UL) & 0xF3FC3FCF) #define SS3(x) ((s_s1[x]*0x01010101UL) & 0xCFF3FC3F) #define G(x) (SS0(GETBYTE(x, 0)) ^ SS1(GETBYTE(x, 1)) ^ SS2(GETBYTE(x, 2)) ^ SS3(GETBYTE(x, 3))) void SEED::Base::UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms) { AssertValidKeyLength(length); word64 key01, key23; GetBlock get(userKey); get(key01)(key23); word32 *k = m_k; size_t kInc = 2; if (!IsForwardTransformation()) { k = k+30; kInc = 0-kInc; } for (int i=0; i>32) + word32(key23>>32) - s_kc[i]; word32 t1 = word32(key01) - word32(key23) + s_kc[i]; k[0] = G(t0); k[1] = G(t1); k+=kInc; if (i&1) key23 = rotlFixed(key23, 8); else key01 = rotrFixed(key01, 8); } } void SEED::Base::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { typedef BlockGetAndPut Block; word32 a0, a1, b0, b1, t0, t1; Block::Get(inBlock)(a0)(a1)(b0)(b1); for (int i=0; i Debug Win32 Debug x64 Release Win32 Release x64 WinXP_32 Win32 WinXP_32 x64 {B1055DA3-83CE-47BF-98E6-2850E3411D39} Win32Proj cryptopp StaticLibrary true MultiByte v110 StaticLibrary true MultiByte v110 StaticLibrary false true MultiByte v110 StaticLibrary false true MultiByte v110 v100 StaticLibrary MultiByte v110 true $(SolutionDir)libs\$(Platform)\ $(ProjectName)_d $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ $(ProjectName)_d true $(SolutionDir)libs\x64 false $(SolutionDir)libs\$(Platform)\ $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ false $(SolutionDir)libs\$(Platform)\ $(SolutionDir)libs\$(Platform)\Win_XP Level3 Disabled WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) cryptopp MultiThreadedDebug Console true Level3 Disabled WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) cryptopp MultiThreadedDebug Console true Level3 MaxSpeed true true WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) MultiThreaded cryptopp Console true true true Level3 NotUsing MaxSpeed true true NDEBUG;_CONSOLE;WIN32;%(PreprocessorDefinitions);NDEBUG MultiThreaded cryptopp pch.h $(IntDir)cryptlib.pch Console true true true Disabled MultiThreaded Document ml64.exe /c /nologo /Fo"$(IntDir)x64dll.obj" /Zi "%(FullPath)" $(IntDir)x64dll.obj;%(Outputs) $(IntDir)x64dll.obj;%(Outputs) ml64.exe /c /nologo /Fo"$(IntDir)x64dll.obj" /Zi "%(FullPath)" Document ml64.exe /c /nologo /Fo"$(IntDir)x64masm.obj" /Zi "%(FullPath)" $(IntDir)x64masm.obj;%(Outputs) ml64.exe /c /nologo /Fo"$(IntDir)x64masm.obj" /Zi "%(FullPath)" $(IntDir)x64masm.obj;%(Outputs) armory-0.92.3/cppForSwig/cryptopp/rc5.cpp0000755000000000000000000000356312414772654017002 0ustar rootroot// rc5.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "rc5.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) void RC5::Base::UncheckedSetKey(const byte *k, unsigned int keylen, const NameValuePairs ¶ms) { AssertValidKeyLength(keylen); r = GetRoundsAndThrowIfInvalid(params, this); sTable.New(2*(r+1)); static const RC5_WORD MAGIC_P = 0xb7e15163L; // magic constant P for wordsize static const RC5_WORD MAGIC_Q = 0x9e3779b9L; // magic constant Q for wordsize static const int U=sizeof(RC5_WORD); const unsigned int c = STDMAX((keylen+U-1)/U, 1U); // RC6 paper says c=1 if keylen==0 SecBlock l(c); GetUserKey(LITTLE_ENDIAN_ORDER, l.begin(), c, k, keylen); sTable[0] = MAGIC_P; for (unsigned j=1; j Block; void RC5::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { const RC5_WORD *sptr = sTable; RC5_WORD a, b; Block::Get(inBlock)(a)(b); a += sptr[0]; b += sptr[1]; sptr += 2; for(unsigned i=0; i NAMESPACE_BEGIN(CryptoPP) /** The queue is implemented as a linked list of byte arrays, but you don't need to know about that. So just ignore this next line. :) */ class ByteQueueNode; //! Byte Queue class CRYPTOPP_DLL ByteQueue : public Bufferless { public: ByteQueue(size_t nodeSize=0); ByteQueue(const ByteQueue ©); ~ByteQueue(); lword MaxRetrievable() const {return CurrentSize();} bool AnyRetrievable() const {return !IsEmpty();} void IsolatedInitialize(const NameValuePairs ¶meters); byte * CreatePutSpace(size_t &size); size_t Put2(const byte *inString, size_t length, int messageEnd, bool blocking); size_t Get(byte &outByte); size_t Get(byte *outString, size_t getMax); size_t Peek(byte &outByte) const; size_t Peek(byte *outString, size_t peekMax) const; size_t TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true); size_t CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) const; // these member functions are not inherited void SetNodeSize(size_t nodeSize); lword CurrentSize() const; bool IsEmpty() const; void Clear(); void Unget(byte inByte); void Unget(const byte *inString, size_t length); const byte * Spy(size_t &contiguousSize) const; void LazyPut(const byte *inString, size_t size); void LazyPutModifiable(byte *inString, size_t size); void UndoLazyPut(size_t size); void FinalizeLazyPut(); ByteQueue & operator=(const ByteQueue &rhs); bool operator==(const ByteQueue &rhs) const; byte operator[](lword i) const; void swap(ByteQueue &rhs); class Walker : public InputRejecting { public: Walker(const ByteQueue &queue) : m_queue(queue) {Initialize();} lword GetCurrentPosition() {return m_position;} lword MaxRetrievable() const {return m_queue.CurrentSize() - m_position;} void IsolatedInitialize(const NameValuePairs ¶meters); size_t Get(byte &outByte); size_t Get(byte *outString, size_t getMax); size_t Peek(byte &outByte) const; size_t Peek(byte *outString, size_t peekMax) const; size_t TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true); size_t CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) const; private: const ByteQueue &m_queue; const ByteQueueNode *m_node; lword m_position; size_t m_offset; const byte *m_lazyString; size_t m_lazyLength; }; friend class Walker; private: void CleanupUsedNodes(); void CopyFrom(const ByteQueue ©); void Destroy(); bool m_autoNodeSize; size_t m_nodeSize; ByteQueueNode *m_head, *m_tail; byte *m_lazyString; size_t m_lazyLength; bool m_lazyStringModifiable; }; //! use this to make sure LazyPut is finalized in event of exception class CRYPTOPP_DLL LazyPutter { public: LazyPutter(ByteQueue &bq, const byte *inString, size_t size) : m_bq(bq) {bq.LazyPut(inString, size);} ~LazyPutter() {try {m_bq.FinalizeLazyPut();} catch(...) {}} protected: LazyPutter(ByteQueue &bq) : m_bq(bq) {} private: ByteQueue &m_bq; }; //! like LazyPutter, but does a LazyPutModifiable instead class LazyPutterModifiable : public LazyPutter { public: LazyPutterModifiable(ByteQueue &bq, byte *inString, size_t size) : LazyPutter(bq) {bq.LazyPutModifiable(inString, size);} }; NAMESPACE_END #ifndef __BORLANDC__ NAMESPACE_BEGIN(std) template<> inline void swap(CryptoPP::ByteQueue &a, CryptoPP::ByteQueue &b) { a.swap(b); } NAMESPACE_END #endif #endif armory-0.92.3/cppForSwig/cryptopp/wake.cpp0000755000000000000000000000521612414772654017235 0ustar rootroot// wake.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "wake.h" NAMESPACE_BEGIN(CryptoPP) void WAKE_TestInstantiations() { WAKE_OFB<>::Encryption x2; WAKE_OFB<>::Decryption x4; } inline word32 WAKE_Base::M(word32 x, word32 y) { word32 w = x+y; return (w>>8) ^ t[w & 0xff]; } void WAKE_Base::GenKey(word32 k0, word32 k1, word32 k2, word32 k3) { // this code is mostly copied from David Wheeler's paper "A Bulk Data Encryption Algorithm" signed int x, z, p; // x and z were declared as "long" in Wheeler's paper, which is a signed type. I don't know if that was intentional, but it's too late to change it now. -- Wei 7/4/2010 CRYPTOPP_COMPILE_ASSERT(sizeof(x) == 4); static int tt[10]= { 0x726a8f3b, // table 0xe69a3b5c, 0xd3c71fe5, 0xab3c73d2, 0x4d3a8eb3, 0x0396d6e8, 0x3d4c2f7a, 0x9ee27cf3, } ; t[0] = k0; t[1] = k1; t[2] = k2; t[3] = k3; for (p=4 ; p<256 ; p++) { x=t[p-4]+t[p-1] ; // fill t t[p]= (x>>3) ^ tt[x&7] ; } for (p=0 ; p<23 ; p++) t[p]+=t[p+89] ; // mix first entries x=t[33] ; z=t[59] | 0x01000001 ; z=z&0xff7fffff ; for (p=0 ; p<256 ; p++) { //change top byte to x=(x&0xff7fffff)+z ; // a permutation etc t[p]=(t[p] & 0x00ffffff) ^ x ; } t[256]=t[0] ; byte y=byte(x); for (p=0 ; p<256 ; p++) { // further change perm. t[p]=t[y=byte(t[p^y]^y)] ; // and other digits t[y]=t[p+1] ; } } template void WAKE_Policy::CipherSetKey(const NameValuePairs ¶ms, const byte *key, size_t length) { word32 k0, k1, k2, k3; BlockGetAndPut::Get(key)(r3)(r4)(r5)(r6)(k0)(k1)(k2)(k3); GenKey(k0, k1, k2, k3); } // OFB template void WAKE_Policy::OperateKeystream(KeystreamOperation operation, byte *output, const byte *input, size_t iterationCount) { #define WAKE_OUTPUT(x)\ while (iterationCount--)\ {\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, B::ToEnum(), 0, r6);\ r3 = M(r3, r6);\ r4 = M(r4, r3);\ r5 = M(r5, r4);\ r6 = M(r6, r5);\ output += 4;\ if (!(x & INPUT_NULL))\ input += 4;\ } typedef word32 WordType; CRYPTOPP_KEYSTREAM_OUTPUT_SWITCH(WAKE_OUTPUT, 0); } /* template void WAKE_ROFB_Policy::Iterate(KeystreamOperation operation, byte *output, const byte *input, unsigned int iterationCount) { KeystreamOutput keystreamOperation(operation, output, input); while (iterationCount--) { keystreamOperation(r6); r3 = M(r3, r6); r4 = M(r4, r3); r5 = M(r5, r4); r6 = M(r6, r5); } } */ template class WAKE_Policy; template class WAKE_Policy; //template class WAKE_ROFB_Policy; //template class WAKE_ROFB_Policy; NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/ida.h0000755000000000000000000001151012414772654016502 0ustar rootroot#ifndef CRYPTOPP_IDA_H #define CRYPTOPP_IDA_H #include "mqueue.h" #include "filters.h" #include "channels.h" #include #include NAMESPACE_BEGIN(CryptoPP) /// base class for secret sharing and information dispersal class RawIDA : public AutoSignaling > > { public: RawIDA(BufferedTransformation *attachment=NULL) {Detach(attachment);} unsigned int GetThreshold() const {return m_threshold;} void AddOutputChannel(word32 channelId); void ChannelData(word32 channelId, const byte *inString, size_t length, bool messageEnd); lword InputBuffered(word32 channelId) const; void IsolatedInitialize(const NameValuePairs ¶meters=g_nullNameValuePairs); size_t ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking) { if (!blocking) throw BlockingInputOnly("RawIDA"); ChannelData(StringToWord(channel), begin, length, messageEnd != 0); return 0; } protected: virtual void FlushOutputQueues(); virtual void OutputMessageEnds(); unsigned int InsertInputChannel(word32 channelId); unsigned int LookupInputChannel(word32 channelId) const; void ComputeV(unsigned int); void PrepareInterpolation(); void ProcessInputQueues(); typedef std::map InputChannelMap; InputChannelMap m_inputChannelMap; InputChannelMap::iterator m_lastMapPosition; std::vector m_inputQueues; std::vector m_inputChannelIds, m_outputChannelIds, m_outputToInput; std::vector m_outputChannelIdStrings; std::vector m_outputQueues; int m_threshold; unsigned int m_channelsReady, m_channelsFinished; std::vector > m_v; SecBlock m_u, m_w, m_y; }; /// a variant of Shamir's Secret Sharing Algorithm class SecretSharing : public CustomFlushPropagation { public: SecretSharing(RandomNumberGenerator &rng, int threshold, int nShares, BufferedTransformation *attachment=NULL, bool addPadding=true) : m_rng(rng), m_ida(new OutputProxy(*this, true)) { Detach(attachment); IsolatedInitialize(MakeParameters("RecoveryThreshold", threshold)("NumberOfShares", nShares)("AddPadding", addPadding)); } void IsolatedInitialize(const NameValuePairs ¶meters=g_nullNameValuePairs); size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking); bool Flush(bool hardFlush, int propagation=-1, bool blocking=true) {return m_ida.Flush(hardFlush, propagation, blocking);} protected: RandomNumberGenerator &m_rng; RawIDA m_ida; bool m_pad; }; /// a variant of Shamir's Secret Sharing Algorithm class SecretRecovery : public RawIDA { public: SecretRecovery(int threshold, BufferedTransformation *attachment=NULL, bool removePadding=true) : RawIDA(attachment) {IsolatedInitialize(MakeParameters("RecoveryThreshold", threshold)("RemovePadding", removePadding));} void IsolatedInitialize(const NameValuePairs ¶meters=g_nullNameValuePairs); protected: void FlushOutputQueues(); void OutputMessageEnds(); bool m_pad; }; /// a variant of Rabin's Information Dispersal Algorithm class InformationDispersal : public CustomFlushPropagation { public: InformationDispersal(int threshold, int nShares, BufferedTransformation *attachment=NULL, bool addPadding=true) : m_ida(new OutputProxy(*this, true)) { Detach(attachment); IsolatedInitialize(MakeParameters("RecoveryThreshold", threshold)("NumberOfShares", nShares)("AddPadding", addPadding)); } void IsolatedInitialize(const NameValuePairs ¶meters=g_nullNameValuePairs); size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking); bool Flush(bool hardFlush, int propagation=-1, bool blocking=true) {return m_ida.Flush(hardFlush, propagation, blocking);} protected: RawIDA m_ida; bool m_pad; unsigned int m_nextChannel; }; /// a variant of Rabin's Information Dispersal Algorithm class InformationRecovery : public RawIDA { public: InformationRecovery(int threshold, BufferedTransformation *attachment=NULL, bool removePadding=true) : RawIDA(attachment) {IsolatedInitialize(MakeParameters("RecoveryThreshold", threshold)("RemovePadding", removePadding));} void IsolatedInitialize(const NameValuePairs ¶meters=g_nullNameValuePairs); protected: void FlushOutputQueues(); void OutputMessageEnds(); bool m_pad; ByteQueue m_queue; }; class PaddingRemover : public Unflushable { public: PaddingRemover(BufferedTransformation *attachment=NULL) : m_possiblePadding(false) {Detach(attachment);} void IsolatedInitialize(const NameValuePairs ¶meters) {m_possiblePadding = false;} size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking); // GetPossiblePadding() == false at the end of a message indicates incorrect padding bool GetPossiblePadding() const {return m_possiblePadding;} private: bool m_possiblePadding; lword m_zeroCount; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/nbtheory.h0000755000000000000000000001402712414772654017605 0ustar rootroot// nbtheory.h - written and placed in the public domain by Wei Dai #ifndef CRYPTOPP_NBTHEORY_H #define CRYPTOPP_NBTHEORY_H #include "integer.h" #include "algparam.h" NAMESPACE_BEGIN(CryptoPP) // obtain pointer to small prime table and get its size CRYPTOPP_DLL const word16 * CRYPTOPP_API GetPrimeTable(unsigned int &size); // ************ primality testing **************** // generate a provable prime CRYPTOPP_DLL Integer CRYPTOPP_API MaurerProvablePrime(RandomNumberGenerator &rng, unsigned int bits); CRYPTOPP_DLL Integer CRYPTOPP_API MihailescuProvablePrime(RandomNumberGenerator &rng, unsigned int bits); CRYPTOPP_DLL bool CRYPTOPP_API IsSmallPrime(const Integer &p); // returns true if p is divisible by some prime less than bound // bound not be greater than the largest entry in the prime table CRYPTOPP_DLL bool CRYPTOPP_API TrialDivision(const Integer &p, unsigned bound); // returns true if p is NOT divisible by small primes CRYPTOPP_DLL bool CRYPTOPP_API SmallDivisorsTest(const Integer &p); // These is no reason to use these two, use the ones below instead CRYPTOPP_DLL bool CRYPTOPP_API IsFermatProbablePrime(const Integer &n, const Integer &b); CRYPTOPP_DLL bool CRYPTOPP_API IsLucasProbablePrime(const Integer &n); CRYPTOPP_DLL bool CRYPTOPP_API IsStrongProbablePrime(const Integer &n, const Integer &b); CRYPTOPP_DLL bool CRYPTOPP_API IsStrongLucasProbablePrime(const Integer &n); // Rabin-Miller primality test, i.e. repeating the strong probable prime test // for several rounds with random bases CRYPTOPP_DLL bool CRYPTOPP_API RabinMillerTest(RandomNumberGenerator &rng, const Integer &w, unsigned int rounds); // primality test, used to generate primes CRYPTOPP_DLL bool CRYPTOPP_API IsPrime(const Integer &p); // more reliable than IsPrime(), used to verify primes generated by others CRYPTOPP_DLL bool CRYPTOPP_API VerifyPrime(RandomNumberGenerator &rng, const Integer &p, unsigned int level = 1); class CRYPTOPP_DLL PrimeSelector { public: const PrimeSelector *GetSelectorPointer() const {return this;} virtual bool IsAcceptable(const Integer &candidate) const =0; }; // use a fast sieve to find the first probable prime in {x | p<=x<=max and x%mod==equiv} // returns true iff successful, value of p is undefined if no such prime exists CRYPTOPP_DLL bool CRYPTOPP_API FirstPrime(Integer &p, const Integer &max, const Integer &equiv, const Integer &mod, const PrimeSelector *pSelector); CRYPTOPP_DLL unsigned int CRYPTOPP_API PrimeSearchInterval(const Integer &max); CRYPTOPP_DLL AlgorithmParameters CRYPTOPP_API MakeParametersForTwoPrimesOfEqualSize(unsigned int productBitLength); // ********** other number theoretic functions ************ inline Integer GCD(const Integer &a, const Integer &b) {return Integer::Gcd(a,b);} inline bool RelativelyPrime(const Integer &a, const Integer &b) {return Integer::Gcd(a,b) == Integer::One();} inline Integer LCM(const Integer &a, const Integer &b) {return a/Integer::Gcd(a,b)*b;} inline Integer EuclideanMultiplicativeInverse(const Integer &a, const Integer &b) {return a.InverseMod(b);} // use Chinese Remainder Theorem to calculate x given x mod p and x mod q, and u = inverse of p mod q CRYPTOPP_DLL Integer CRYPTOPP_API CRT(const Integer &xp, const Integer &p, const Integer &xq, const Integer &q, const Integer &u); // if b is prime, then Jacobi(a, b) returns 0 if a%b==0, 1 if a is quadratic residue mod b, -1 otherwise // check a number theory book for what Jacobi symbol means when b is not prime CRYPTOPP_DLL int CRYPTOPP_API Jacobi(const Integer &a, const Integer &b); // calculates the Lucas function V_e(p, 1) mod n CRYPTOPP_DLL Integer CRYPTOPP_API Lucas(const Integer &e, const Integer &p, const Integer &n); // calculates x such that m==Lucas(e, x, p*q), p q primes, u=inverse of p mod q CRYPTOPP_DLL Integer CRYPTOPP_API InverseLucas(const Integer &e, const Integer &m, const Integer &p, const Integer &q, const Integer &u); inline Integer ModularExponentiation(const Integer &a, const Integer &e, const Integer &m) {return a_exp_b_mod_c(a, e, m);} // returns x such that x*x%p == a, p prime CRYPTOPP_DLL Integer CRYPTOPP_API ModularSquareRoot(const Integer &a, const Integer &p); // returns x such that a==ModularExponentiation(x, e, p*q), p q primes, // and e relatively prime to (p-1)*(q-1) // dp=d%(p-1), dq=d%(q-1), (d is inverse of e mod (p-1)*(q-1)) // and u=inverse of p mod q CRYPTOPP_DLL Integer CRYPTOPP_API ModularRoot(const Integer &a, const Integer &dp, const Integer &dq, const Integer &p, const Integer &q, const Integer &u); // find r1 and r2 such that ax^2 + bx + c == 0 (mod p) for x in {r1, r2}, p prime // returns true if solutions exist CRYPTOPP_DLL bool CRYPTOPP_API SolveModularQuadraticEquation(Integer &r1, Integer &r2, const Integer &a, const Integer &b, const Integer &c, const Integer &p); // returns log base 2 of estimated number of operations to calculate discrete log or factor a number CRYPTOPP_DLL unsigned int CRYPTOPP_API DiscreteLogWorkFactor(unsigned int bitlength); CRYPTOPP_DLL unsigned int CRYPTOPP_API FactoringWorkFactor(unsigned int bitlength); // ******************************************************** //! generator of prime numbers of special forms class CRYPTOPP_DLL PrimeAndGenerator { public: PrimeAndGenerator() {} // generate a random prime p of the form 2*q+delta, where delta is 1 or -1 and q is also prime // Precondition: pbits > 5 // warning: this is slow, because primes of this form are harder to find PrimeAndGenerator(signed int delta, RandomNumberGenerator &rng, unsigned int pbits) {Generate(delta, rng, pbits, pbits-1);} // generate a random prime p of the form 2*r*q+delta, where q is also prime // Precondition: qbits > 4 && pbits > qbits PrimeAndGenerator(signed int delta, RandomNumberGenerator &rng, unsigned int pbits, unsigned qbits) {Generate(delta, rng, pbits, qbits);} void Generate(signed int delta, RandomNumberGenerator &rng, unsigned int pbits, unsigned qbits); const Integer& Prime() const {return p;} const Integer& SubPrime() const {return q;} const Integer& Generator() const {return g;} private: Integer p, q, g; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/cryptlib.vcproj0000755000000000000000000056625712414772654020700 0ustar rootroot armory-0.92.3/cppForSwig/cryptopp/ripemd.cpp0000755000000000000000000007504612414772654017576 0ustar rootroot// ripemd.cpp // RIPEMD-160 written and placed in the public domain by Wei Dai // RIPEMD-320, RIPEMD-128, RIPEMD-256 written by Kevin Springle // and also placed in the public domain #include "pch.h" #include "ripemd.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) #define F(x, y, z) (x ^ y ^ z) #define G(x, y, z) (z ^ (x & (y^z))) #define H(x, y, z) (z ^ (x | ~y)) #define I(x, y, z) (y ^ (z & (x^y))) #define J(x, y, z) (x ^ (y | ~z)) #define k0 0 #define k1 0x5a827999UL #define k2 0x6ed9eba1UL #define k3 0x8f1bbcdcUL #define k4 0xa953fd4eUL #define k5 0x50a28be6UL #define k6 0x5c4dd124UL #define k7 0x6d703ef3UL #define k8 0x7a6d76e9UL #define k9 0 // ************************************************************* // for 160 and 320 #define Subround(f, a, b, c, d, e, x, s, k) \ a += f(b, c, d) + x + k;\ a = rotlFixed((word32)a, s) + e;\ c = rotlFixed((word32)c, 10U) void RIPEMD160::InitState(HashWordType *state) { state[0] = 0x67452301L; state[1] = 0xefcdab89L; state[2] = 0x98badcfeL; state[3] = 0x10325476L; state[4] = 0xc3d2e1f0L; } void RIPEMD160::Transform (word32 *digest, const word32 *X) { unsigned long a1, b1, c1, d1, e1, a2, b2, c2, d2, e2; a1 = a2 = digest[0]; b1 = b2 = digest[1]; c1 = c2 = digest[2]; d1 = d2 = digest[3]; e1 = e2 = digest[4]; Subround(F, a1, b1, c1, d1, e1, X[ 0], 11, k0); Subround(F, e1, a1, b1, c1, d1, X[ 1], 14, k0); Subround(F, d1, e1, a1, b1, c1, X[ 2], 15, k0); Subround(F, c1, d1, e1, a1, b1, X[ 3], 12, k0); Subround(F, b1, c1, d1, e1, a1, X[ 4], 5, k0); Subround(F, a1, b1, c1, d1, e1, X[ 5], 8, k0); Subround(F, e1, a1, b1, c1, d1, X[ 6], 7, k0); Subround(F, d1, e1, a1, b1, c1, X[ 7], 9, k0); Subround(F, c1, d1, e1, a1, b1, X[ 8], 11, k0); Subround(F, b1, c1, d1, e1, a1, X[ 9], 13, k0); Subround(F, a1, b1, c1, d1, e1, X[10], 14, k0); Subround(F, e1, a1, b1, c1, d1, X[11], 15, k0); Subround(F, d1, e1, a1, b1, c1, X[12], 6, k0); Subround(F, c1, d1, e1, a1, b1, X[13], 7, k0); Subround(F, b1, c1, d1, e1, a1, X[14], 9, k0); Subround(F, a1, b1, c1, d1, e1, X[15], 8, k0); Subround(G, e1, a1, b1, c1, d1, X[ 7], 7, k1); Subround(G, d1, e1, a1, b1, c1, X[ 4], 6, k1); Subround(G, c1, d1, e1, a1, b1, X[13], 8, k1); Subround(G, b1, c1, d1, e1, a1, X[ 1], 13, k1); Subround(G, a1, b1, c1, d1, e1, X[10], 11, k1); Subround(G, e1, a1, b1, c1, d1, X[ 6], 9, k1); Subround(G, d1, e1, a1, b1, c1, X[15], 7, k1); Subround(G, c1, d1, e1, a1, b1, X[ 3], 15, k1); Subround(G, b1, c1, d1, e1, a1, X[12], 7, k1); Subround(G, a1, b1, c1, d1, e1, X[ 0], 12, k1); Subround(G, e1, a1, b1, c1, d1, X[ 9], 15, k1); Subround(G, d1, e1, a1, b1, c1, X[ 5], 9, k1); Subround(G, c1, d1, e1, a1, b1, X[ 2], 11, k1); Subround(G, b1, c1, d1, e1, a1, X[14], 7, k1); Subround(G, a1, b1, c1, d1, e1, X[11], 13, k1); Subround(G, e1, a1, b1, c1, d1, X[ 8], 12, k1); Subround(H, d1, e1, a1, b1, c1, X[ 3], 11, k2); Subround(H, c1, d1, e1, a1, b1, X[10], 13, k2); Subround(H, b1, c1, d1, e1, a1, X[14], 6, k2); Subround(H, a1, b1, c1, d1, e1, X[ 4], 7, k2); Subround(H, e1, a1, b1, c1, d1, X[ 9], 14, k2); Subround(H, d1, e1, a1, b1, c1, X[15], 9, k2); Subround(H, c1, d1, e1, a1, b1, X[ 8], 13, k2); Subround(H, b1, c1, d1, e1, a1, X[ 1], 15, k2); Subround(H, a1, b1, c1, d1, e1, X[ 2], 14, k2); Subround(H, e1, a1, b1, c1, d1, X[ 7], 8, k2); Subround(H, d1, e1, a1, b1, c1, X[ 0], 13, k2); Subround(H, c1, d1, e1, a1, b1, X[ 6], 6, k2); Subround(H, b1, c1, d1, e1, a1, X[13], 5, k2); Subround(H, a1, b1, c1, d1, e1, X[11], 12, k2); Subround(H, e1, a1, b1, c1, d1, X[ 5], 7, k2); Subround(H, d1, e1, a1, b1, c1, X[12], 5, k2); Subround(I, c1, d1, e1, a1, b1, X[ 1], 11, k3); Subround(I, b1, c1, d1, e1, a1, X[ 9], 12, k3); Subround(I, a1, b1, c1, d1, e1, X[11], 14, k3); Subround(I, e1, a1, b1, c1, d1, X[10], 15, k3); Subround(I, d1, e1, a1, b1, c1, X[ 0], 14, k3); Subround(I, c1, d1, e1, a1, b1, X[ 8], 15, k3); Subround(I, b1, c1, d1, e1, a1, X[12], 9, k3); Subround(I, a1, b1, c1, d1, e1, X[ 4], 8, k3); Subround(I, e1, a1, b1, c1, d1, X[13], 9, k3); Subround(I, d1, e1, a1, b1, c1, X[ 3], 14, k3); Subround(I, c1, d1, e1, a1, b1, X[ 7], 5, k3); Subround(I, b1, c1, d1, e1, a1, X[15], 6, k3); Subround(I, a1, b1, c1, d1, e1, X[14], 8, k3); Subround(I, e1, a1, b1, c1, d1, X[ 5], 6, k3); Subround(I, d1, e1, a1, b1, c1, X[ 6], 5, k3); Subround(I, c1, d1, e1, a1, b1, X[ 2], 12, k3); Subround(J, b1, c1, d1, e1, a1, X[ 4], 9, k4); Subround(J, a1, b1, c1, d1, e1, X[ 0], 15, k4); Subround(J, e1, a1, b1, c1, d1, X[ 5], 5, k4); Subround(J, d1, e1, a1, b1, c1, X[ 9], 11, k4); Subround(J, c1, d1, e1, a1, b1, X[ 7], 6, k4); Subround(J, b1, c1, d1, e1, a1, X[12], 8, k4); Subround(J, a1, b1, c1, d1, e1, X[ 2], 13, k4); Subround(J, e1, a1, b1, c1, d1, X[10], 12, k4); Subround(J, d1, e1, a1, b1, c1, X[14], 5, k4); Subround(J, c1, d1, e1, a1, b1, X[ 1], 12, k4); Subround(J, b1, c1, d1, e1, a1, X[ 3], 13, k4); Subround(J, a1, b1, c1, d1, e1, X[ 8], 14, k4); Subround(J, e1, a1, b1, c1, d1, X[11], 11, k4); Subround(J, d1, e1, a1, b1, c1, X[ 6], 8, k4); Subround(J, c1, d1, e1, a1, b1, X[15], 5, k4); Subround(J, b1, c1, d1, e1, a1, X[13], 6, k4); Subround(J, a2, b2, c2, d2, e2, X[ 5], 8, k5); Subround(J, e2, a2, b2, c2, d2, X[14], 9, k5); Subround(J, d2, e2, a2, b2, c2, X[ 7], 9, k5); Subround(J, c2, d2, e2, a2, b2, X[ 0], 11, k5); Subround(J, b2, c2, d2, e2, a2, X[ 9], 13, k5); Subround(J, a2, b2, c2, d2, e2, X[ 2], 15, k5); Subround(J, e2, a2, b2, c2, d2, X[11], 15, k5); Subround(J, d2, e2, a2, b2, c2, X[ 4], 5, k5); Subround(J, c2, d2, e2, a2, b2, X[13], 7, k5); Subround(J, b2, c2, d2, e2, a2, X[ 6], 7, k5); Subround(J, a2, b2, c2, d2, e2, X[15], 8, k5); Subround(J, e2, a2, b2, c2, d2, X[ 8], 11, k5); Subround(J, d2, e2, a2, b2, c2, X[ 1], 14, k5); Subround(J, c2, d2, e2, a2, b2, X[10], 14, k5); Subround(J, b2, c2, d2, e2, a2, X[ 3], 12, k5); Subround(J, a2, b2, c2, d2, e2, X[12], 6, k5); Subround(I, e2, a2, b2, c2, d2, X[ 6], 9, k6); Subround(I, d2, e2, a2, b2, c2, X[11], 13, k6); Subround(I, c2, d2, e2, a2, b2, X[ 3], 15, k6); Subround(I, b2, c2, d2, e2, a2, X[ 7], 7, k6); Subround(I, a2, b2, c2, d2, e2, X[ 0], 12, k6); Subround(I, e2, a2, b2, c2, d2, X[13], 8, k6); Subround(I, d2, e2, a2, b2, c2, X[ 5], 9, k6); Subround(I, c2, d2, e2, a2, b2, X[10], 11, k6); Subround(I, b2, c2, d2, e2, a2, X[14], 7, k6); Subround(I, a2, b2, c2, d2, e2, X[15], 7, k6); Subround(I, e2, a2, b2, c2, d2, X[ 8], 12, k6); Subround(I, d2, e2, a2, b2, c2, X[12], 7, k6); Subround(I, c2, d2, e2, a2, b2, X[ 4], 6, k6); Subround(I, b2, c2, d2, e2, a2, X[ 9], 15, k6); Subround(I, a2, b2, c2, d2, e2, X[ 1], 13, k6); Subround(I, e2, a2, b2, c2, d2, X[ 2], 11, k6); Subround(H, d2, e2, a2, b2, c2, X[15], 9, k7); Subround(H, c2, d2, e2, a2, b2, X[ 5], 7, k7); Subround(H, b2, c2, d2, e2, a2, X[ 1], 15, k7); Subround(H, a2, b2, c2, d2, e2, X[ 3], 11, k7); Subround(H, e2, a2, b2, c2, d2, X[ 7], 8, k7); Subround(H, d2, e2, a2, b2, c2, X[14], 6, k7); Subround(H, c2, d2, e2, a2, b2, X[ 6], 6, k7); Subround(H, b2, c2, d2, e2, a2, X[ 9], 14, k7); Subround(H, a2, b2, c2, d2, e2, X[11], 12, k7); Subround(H, e2, a2, b2, c2, d2, X[ 8], 13, k7); Subround(H, d2, e2, a2, b2, c2, X[12], 5, k7); Subround(H, c2, d2, e2, a2, b2, X[ 2], 14, k7); Subround(H, b2, c2, d2, e2, a2, X[10], 13, k7); Subround(H, a2, b2, c2, d2, e2, X[ 0], 13, k7); Subround(H, e2, a2, b2, c2, d2, X[ 4], 7, k7); Subround(H, d2, e2, a2, b2, c2, X[13], 5, k7); Subround(G, c2, d2, e2, a2, b2, X[ 8], 15, k8); Subround(G, b2, c2, d2, e2, a2, X[ 6], 5, k8); Subround(G, a2, b2, c2, d2, e2, X[ 4], 8, k8); Subround(G, e2, a2, b2, c2, d2, X[ 1], 11, k8); Subround(G, d2, e2, a2, b2, c2, X[ 3], 14, k8); Subround(G, c2, d2, e2, a2, b2, X[11], 14, k8); Subround(G, b2, c2, d2, e2, a2, X[15], 6, k8); Subround(G, a2, b2, c2, d2, e2, X[ 0], 14, k8); Subround(G, e2, a2, b2, c2, d2, X[ 5], 6, k8); Subround(G, d2, e2, a2, b2, c2, X[12], 9, k8); Subround(G, c2, d2, e2, a2, b2, X[ 2], 12, k8); Subround(G, b2, c2, d2, e2, a2, X[13], 9, k8); Subround(G, a2, b2, c2, d2, e2, X[ 9], 12, k8); Subround(G, e2, a2, b2, c2, d2, X[ 7], 5, k8); Subround(G, d2, e2, a2, b2, c2, X[10], 15, k8); Subround(G, c2, d2, e2, a2, b2, X[14], 8, k8); Subround(F, b2, c2, d2, e2, a2, X[12], 8, k9); Subround(F, a2, b2, c2, d2, e2, X[15], 5, k9); Subround(F, e2, a2, b2, c2, d2, X[10], 12, k9); Subround(F, d2, e2, a2, b2, c2, X[ 4], 9, k9); Subround(F, c2, d2, e2, a2, b2, X[ 1], 12, k9); Subround(F, b2, c2, d2, e2, a2, X[ 5], 5, k9); Subround(F, a2, b2, c2, d2, e2, X[ 8], 14, k9); Subround(F, e2, a2, b2, c2, d2, X[ 7], 6, k9); Subround(F, d2, e2, a2, b2, c2, X[ 6], 8, k9); Subround(F, c2, d2, e2, a2, b2, X[ 2], 13, k9); Subround(F, b2, c2, d2, e2, a2, X[13], 6, k9); Subround(F, a2, b2, c2, d2, e2, X[14], 5, k9); Subround(F, e2, a2, b2, c2, d2, X[ 0], 15, k9); Subround(F, d2, e2, a2, b2, c2, X[ 3], 13, k9); Subround(F, c2, d2, e2, a2, b2, X[ 9], 11, k9); Subround(F, b2, c2, d2, e2, a2, X[11], 11, k9); c1 = digest[1] + c1 + d2; digest[1] = digest[2] + d1 + e2; digest[2] = digest[3] + e1 + a2; digest[3] = digest[4] + a1 + b2; digest[4] = digest[0] + b1 + c2; digest[0] = c1; } // ************************************************************* void RIPEMD320::InitState(HashWordType *state) { state[0] = 0x67452301L; state[1] = 0xefcdab89L; state[2] = 0x98badcfeL; state[3] = 0x10325476L; state[4] = 0xc3d2e1f0L; state[5] = 0x76543210L; state[6] = 0xfedcba98L; state[7] = 0x89abcdefL; state[8] = 0x01234567L; state[9] = 0x3c2d1e0fL; } void RIPEMD320::Transform (word32 *digest, const word32 *X) { unsigned long a1, b1, c1, d1, e1, a2, b2, c2, d2, e2, t; a1 = digest[0]; b1 = digest[1]; c1 = digest[2]; d1 = digest[3]; e1 = digest[4]; a2 = digest[5]; b2 = digest[6]; c2 = digest[7]; d2 = digest[8]; e2 = digest[9]; Subround(F, a1, b1, c1, d1, e1, X[ 0], 11, k0); Subround(F, e1, a1, b1, c1, d1, X[ 1], 14, k0); Subround(F, d1, e1, a1, b1, c1, X[ 2], 15, k0); Subround(F, c1, d1, e1, a1, b1, X[ 3], 12, k0); Subround(F, b1, c1, d1, e1, a1, X[ 4], 5, k0); Subround(F, a1, b1, c1, d1, e1, X[ 5], 8, k0); Subround(F, e1, a1, b1, c1, d1, X[ 6], 7, k0); Subround(F, d1, e1, a1, b1, c1, X[ 7], 9, k0); Subround(F, c1, d1, e1, a1, b1, X[ 8], 11, k0); Subround(F, b1, c1, d1, e1, a1, X[ 9], 13, k0); Subround(F, a1, b1, c1, d1, e1, X[10], 14, k0); Subround(F, e1, a1, b1, c1, d1, X[11], 15, k0); Subround(F, d1, e1, a1, b1, c1, X[12], 6, k0); Subround(F, c1, d1, e1, a1, b1, X[13], 7, k0); Subround(F, b1, c1, d1, e1, a1, X[14], 9, k0); Subround(F, a1, b1, c1, d1, e1, X[15], 8, k0); Subround(J, a2, b2, c2, d2, e2, X[ 5], 8, k5); Subround(J, e2, a2, b2, c2, d2, X[14], 9, k5); Subround(J, d2, e2, a2, b2, c2, X[ 7], 9, k5); Subround(J, c2, d2, e2, a2, b2, X[ 0], 11, k5); Subround(J, b2, c2, d2, e2, a2, X[ 9], 13, k5); Subround(J, a2, b2, c2, d2, e2, X[ 2], 15, k5); Subround(J, e2, a2, b2, c2, d2, X[11], 15, k5); Subround(J, d2, e2, a2, b2, c2, X[ 4], 5, k5); Subround(J, c2, d2, e2, a2, b2, X[13], 7, k5); Subround(J, b2, c2, d2, e2, a2, X[ 6], 7, k5); Subround(J, a2, b2, c2, d2, e2, X[15], 8, k5); Subround(J, e2, a2, b2, c2, d2, X[ 8], 11, k5); Subround(J, d2, e2, a2, b2, c2, X[ 1], 14, k5); Subround(J, c2, d2, e2, a2, b2, X[10], 14, k5); Subround(J, b2, c2, d2, e2, a2, X[ 3], 12, k5); Subround(J, a2, b2, c2, d2, e2, X[12], 6, k5); t = a1; a1 = a2; a2 = t; Subround(G, e1, a1, b1, c1, d1, X[ 7], 7, k1); Subround(G, d1, e1, a1, b1, c1, X[ 4], 6, k1); Subround(G, c1, d1, e1, a1, b1, X[13], 8, k1); Subround(G, b1, c1, d1, e1, a1, X[ 1], 13, k1); Subround(G, a1, b1, c1, d1, e1, X[10], 11, k1); Subround(G, e1, a1, b1, c1, d1, X[ 6], 9, k1); Subround(G, d1, e1, a1, b1, c1, X[15], 7, k1); Subround(G, c1, d1, e1, a1, b1, X[ 3], 15, k1); Subround(G, b1, c1, d1, e1, a1, X[12], 7, k1); Subround(G, a1, b1, c1, d1, e1, X[ 0], 12, k1); Subround(G, e1, a1, b1, c1, d1, X[ 9], 15, k1); Subround(G, d1, e1, a1, b1, c1, X[ 5], 9, k1); Subround(G, c1, d1, e1, a1, b1, X[ 2], 11, k1); Subround(G, b1, c1, d1, e1, a1, X[14], 7, k1); Subround(G, a1, b1, c1, d1, e1, X[11], 13, k1); Subround(G, e1, a1, b1, c1, d1, X[ 8], 12, k1); Subround(I, e2, a2, b2, c2, d2, X[ 6], 9, k6); Subround(I, d2, e2, a2, b2, c2, X[11], 13, k6); Subround(I, c2, d2, e2, a2, b2, X[ 3], 15, k6); Subround(I, b2, c2, d2, e2, a2, X[ 7], 7, k6); Subround(I, a2, b2, c2, d2, e2, X[ 0], 12, k6); Subround(I, e2, a2, b2, c2, d2, X[13], 8, k6); Subround(I, d2, e2, a2, b2, c2, X[ 5], 9, k6); Subround(I, c2, d2, e2, a2, b2, X[10], 11, k6); Subround(I, b2, c2, d2, e2, a2, X[14], 7, k6); Subround(I, a2, b2, c2, d2, e2, X[15], 7, k6); Subround(I, e2, a2, b2, c2, d2, X[ 8], 12, k6); Subround(I, d2, e2, a2, b2, c2, X[12], 7, k6); Subround(I, c2, d2, e2, a2, b2, X[ 4], 6, k6); Subround(I, b2, c2, d2, e2, a2, X[ 9], 15, k6); Subround(I, a2, b2, c2, d2, e2, X[ 1], 13, k6); Subround(I, e2, a2, b2, c2, d2, X[ 2], 11, k6); t = b1; b1 = b2; b2 = t; Subround(H, d1, e1, a1, b1, c1, X[ 3], 11, k2); Subround(H, c1, d1, e1, a1, b1, X[10], 13, k2); Subround(H, b1, c1, d1, e1, a1, X[14], 6, k2); Subround(H, a1, b1, c1, d1, e1, X[ 4], 7, k2); Subround(H, e1, a1, b1, c1, d1, X[ 9], 14, k2); Subround(H, d1, e1, a1, b1, c1, X[15], 9, k2); Subround(H, c1, d1, e1, a1, b1, X[ 8], 13, k2); Subround(H, b1, c1, d1, e1, a1, X[ 1], 15, k2); Subround(H, a1, b1, c1, d1, e1, X[ 2], 14, k2); Subround(H, e1, a1, b1, c1, d1, X[ 7], 8, k2); Subround(H, d1, e1, a1, b1, c1, X[ 0], 13, k2); Subround(H, c1, d1, e1, a1, b1, X[ 6], 6, k2); Subround(H, b1, c1, d1, e1, a1, X[13], 5, k2); Subround(H, a1, b1, c1, d1, e1, X[11], 12, k2); Subround(H, e1, a1, b1, c1, d1, X[ 5], 7, k2); Subround(H, d1, e1, a1, b1, c1, X[12], 5, k2); Subround(H, d2, e2, a2, b2, c2, X[15], 9, k7); Subround(H, c2, d2, e2, a2, b2, X[ 5], 7, k7); Subround(H, b2, c2, d2, e2, a2, X[ 1], 15, k7); Subround(H, a2, b2, c2, d2, e2, X[ 3], 11, k7); Subround(H, e2, a2, b2, c2, d2, X[ 7], 8, k7); Subround(H, d2, e2, a2, b2, c2, X[14], 6, k7); Subround(H, c2, d2, e2, a2, b2, X[ 6], 6, k7); Subround(H, b2, c2, d2, e2, a2, X[ 9], 14, k7); Subround(H, a2, b2, c2, d2, e2, X[11], 12, k7); Subround(H, e2, a2, b2, c2, d2, X[ 8], 13, k7); Subround(H, d2, e2, a2, b2, c2, X[12], 5, k7); Subround(H, c2, d2, e2, a2, b2, X[ 2], 14, k7); Subround(H, b2, c2, d2, e2, a2, X[10], 13, k7); Subround(H, a2, b2, c2, d2, e2, X[ 0], 13, k7); Subround(H, e2, a2, b2, c2, d2, X[ 4], 7, k7); Subround(H, d2, e2, a2, b2, c2, X[13], 5, k7); t = c1; c1 = c2; c2 = t; Subround(I, c1, d1, e1, a1, b1, X[ 1], 11, k3); Subround(I, b1, c1, d1, e1, a1, X[ 9], 12, k3); Subround(I, a1, b1, c1, d1, e1, X[11], 14, k3); Subround(I, e1, a1, b1, c1, d1, X[10], 15, k3); Subround(I, d1, e1, a1, b1, c1, X[ 0], 14, k3); Subround(I, c1, d1, e1, a1, b1, X[ 8], 15, k3); Subround(I, b1, c1, d1, e1, a1, X[12], 9, k3); Subround(I, a1, b1, c1, d1, e1, X[ 4], 8, k3); Subround(I, e1, a1, b1, c1, d1, X[13], 9, k3); Subround(I, d1, e1, a1, b1, c1, X[ 3], 14, k3); Subround(I, c1, d1, e1, a1, b1, X[ 7], 5, k3); Subround(I, b1, c1, d1, e1, a1, X[15], 6, k3); Subround(I, a1, b1, c1, d1, e1, X[14], 8, k3); Subround(I, e1, a1, b1, c1, d1, X[ 5], 6, k3); Subround(I, d1, e1, a1, b1, c1, X[ 6], 5, k3); Subround(I, c1, d1, e1, a1, b1, X[ 2], 12, k3); Subround(G, c2, d2, e2, a2, b2, X[ 8], 15, k8); Subround(G, b2, c2, d2, e2, a2, X[ 6], 5, k8); Subround(G, a2, b2, c2, d2, e2, X[ 4], 8, k8); Subround(G, e2, a2, b2, c2, d2, X[ 1], 11, k8); Subround(G, d2, e2, a2, b2, c2, X[ 3], 14, k8); Subround(G, c2, d2, e2, a2, b2, X[11], 14, k8); Subround(G, b2, c2, d2, e2, a2, X[15], 6, k8); Subround(G, a2, b2, c2, d2, e2, X[ 0], 14, k8); Subround(G, e2, a2, b2, c2, d2, X[ 5], 6, k8); Subround(G, d2, e2, a2, b2, c2, X[12], 9, k8); Subround(G, c2, d2, e2, a2, b2, X[ 2], 12, k8); Subround(G, b2, c2, d2, e2, a2, X[13], 9, k8); Subround(G, a2, b2, c2, d2, e2, X[ 9], 12, k8); Subround(G, e2, a2, b2, c2, d2, X[ 7], 5, k8); Subround(G, d2, e2, a2, b2, c2, X[10], 15, k8); Subround(G, c2, d2, e2, a2, b2, X[14], 8, k8); t = d1; d1 = d2; d2 = t; Subround(J, b1, c1, d1, e1, a1, X[ 4], 9, k4); Subround(J, a1, b1, c1, d1, e1, X[ 0], 15, k4); Subround(J, e1, a1, b1, c1, d1, X[ 5], 5, k4); Subround(J, d1, e1, a1, b1, c1, X[ 9], 11, k4); Subround(J, c1, d1, e1, a1, b1, X[ 7], 6, k4); Subround(J, b1, c1, d1, e1, a1, X[12], 8, k4); Subround(J, a1, b1, c1, d1, e1, X[ 2], 13, k4); Subround(J, e1, a1, b1, c1, d1, X[10], 12, k4); Subround(J, d1, e1, a1, b1, c1, X[14], 5, k4); Subround(J, c1, d1, e1, a1, b1, X[ 1], 12, k4); Subround(J, b1, c1, d1, e1, a1, X[ 3], 13, k4); Subround(J, a1, b1, c1, d1, e1, X[ 8], 14, k4); Subround(J, e1, a1, b1, c1, d1, X[11], 11, k4); Subround(J, d1, e1, a1, b1, c1, X[ 6], 8, k4); Subround(J, c1, d1, e1, a1, b1, X[15], 5, k4); Subround(J, b1, c1, d1, e1, a1, X[13], 6, k4); Subround(F, b2, c2, d2, e2, a2, X[12], 8, k9); Subround(F, a2, b2, c2, d2, e2, X[15], 5, k9); Subround(F, e2, a2, b2, c2, d2, X[10], 12, k9); Subround(F, d2, e2, a2, b2, c2, X[ 4], 9, k9); Subround(F, c2, d2, e2, a2, b2, X[ 1], 12, k9); Subround(F, b2, c2, d2, e2, a2, X[ 5], 5, k9); Subround(F, a2, b2, c2, d2, e2, X[ 8], 14, k9); Subround(F, e2, a2, b2, c2, d2, X[ 7], 6, k9); Subround(F, d2, e2, a2, b2, c2, X[ 6], 8, k9); Subround(F, c2, d2, e2, a2, b2, X[ 2], 13, k9); Subround(F, b2, c2, d2, e2, a2, X[13], 6, k9); Subround(F, a2, b2, c2, d2, e2, X[14], 5, k9); Subround(F, e2, a2, b2, c2, d2, X[ 0], 15, k9); Subround(F, d2, e2, a2, b2, c2, X[ 3], 13, k9); Subround(F, c2, d2, e2, a2, b2, X[ 9], 11, k9); Subround(F, b2, c2, d2, e2, a2, X[11], 11, k9); t = e1; e1 = e2; e2 = t; digest[0] += a1; digest[1] += b1; digest[2] += c1; digest[3] += d1; digest[4] += e1; digest[5] += a2; digest[6] += b2; digest[7] += c2; digest[8] += d2; digest[9] += e2; } #undef Subround // ************************************************************* // for 128 and 256 #define Subround(f, a, b, c, d, x, s, k) \ a += f(b, c, d) + x + k;\ a = rotlFixed((word32)a, s); void RIPEMD128::InitState(HashWordType *state) { state[0] = 0x67452301L; state[1] = 0xefcdab89L; state[2] = 0x98badcfeL; state[3] = 0x10325476L; } void RIPEMD128::Transform (word32 *digest, const word32 *X) { unsigned long a1, b1, c1, d1, a2, b2, c2, d2; a1 = a2 = digest[0]; b1 = b2 = digest[1]; c1 = c2 = digest[2]; d1 = d2 = digest[3]; Subround(F, a1, b1, c1, d1, X[ 0], 11, k0); Subround(F, d1, a1, b1, c1, X[ 1], 14, k0); Subround(F, c1, d1, a1, b1, X[ 2], 15, k0); Subround(F, b1, c1, d1, a1, X[ 3], 12, k0); Subround(F, a1, b1, c1, d1, X[ 4], 5, k0); Subround(F, d1, a1, b1, c1, X[ 5], 8, k0); Subround(F, c1, d1, a1, b1, X[ 6], 7, k0); Subround(F, b1, c1, d1, a1, X[ 7], 9, k0); Subround(F, a1, b1, c1, d1, X[ 8], 11, k0); Subround(F, d1, a1, b1, c1, X[ 9], 13, k0); Subround(F, c1, d1, a1, b1, X[10], 14, k0); Subround(F, b1, c1, d1, a1, X[11], 15, k0); Subround(F, a1, b1, c1, d1, X[12], 6, k0); Subround(F, d1, a1, b1, c1, X[13], 7, k0); Subround(F, c1, d1, a1, b1, X[14], 9, k0); Subround(F, b1, c1, d1, a1, X[15], 8, k0); Subround(G, a1, b1, c1, d1, X[ 7], 7, k1); Subround(G, d1, a1, b1, c1, X[ 4], 6, k1); Subround(G, c1, d1, a1, b1, X[13], 8, k1); Subround(G, b1, c1, d1, a1, X[ 1], 13, k1); Subround(G, a1, b1, c1, d1, X[10], 11, k1); Subround(G, d1, a1, b1, c1, X[ 6], 9, k1); Subround(G, c1, d1, a1, b1, X[15], 7, k1); Subround(G, b1, c1, d1, a1, X[ 3], 15, k1); Subround(G, a1, b1, c1, d1, X[12], 7, k1); Subround(G, d1, a1, b1, c1, X[ 0], 12, k1); Subround(G, c1, d1, a1, b1, X[ 9], 15, k1); Subround(G, b1, c1, d1, a1, X[ 5], 9, k1); Subround(G, a1, b1, c1, d1, X[ 2], 11, k1); Subround(G, d1, a1, b1, c1, X[14], 7, k1); Subround(G, c1, d1, a1, b1, X[11], 13, k1); Subround(G, b1, c1, d1, a1, X[ 8], 12, k1); Subround(H, a1, b1, c1, d1, X[ 3], 11, k2); Subround(H, d1, a1, b1, c1, X[10], 13, k2); Subround(H, c1, d1, a1, b1, X[14], 6, k2); Subround(H, b1, c1, d1, a1, X[ 4], 7, k2); Subround(H, a1, b1, c1, d1, X[ 9], 14, k2); Subround(H, d1, a1, b1, c1, X[15], 9, k2); Subround(H, c1, d1, a1, b1, X[ 8], 13, k2); Subround(H, b1, c1, d1, a1, X[ 1], 15, k2); Subround(H, a1, b1, c1, d1, X[ 2], 14, k2); Subround(H, d1, a1, b1, c1, X[ 7], 8, k2); Subround(H, c1, d1, a1, b1, X[ 0], 13, k2); Subround(H, b1, c1, d1, a1, X[ 6], 6, k2); Subround(H, a1, b1, c1, d1, X[13], 5, k2); Subround(H, d1, a1, b1, c1, X[11], 12, k2); Subround(H, c1, d1, a1, b1, X[ 5], 7, k2); Subround(H, b1, c1, d1, a1, X[12], 5, k2); Subround(I, a1, b1, c1, d1, X[ 1], 11, k3); Subround(I, d1, a1, b1, c1, X[ 9], 12, k3); Subround(I, c1, d1, a1, b1, X[11], 14, k3); Subround(I, b1, c1, d1, a1, X[10], 15, k3); Subround(I, a1, b1, c1, d1, X[ 0], 14, k3); Subround(I, d1, a1, b1, c1, X[ 8], 15, k3); Subround(I, c1, d1, a1, b1, X[12], 9, k3); Subround(I, b1, c1, d1, a1, X[ 4], 8, k3); Subround(I, a1, b1, c1, d1, X[13], 9, k3); Subround(I, d1, a1, b1, c1, X[ 3], 14, k3); Subround(I, c1, d1, a1, b1, X[ 7], 5, k3); Subround(I, b1, c1, d1, a1, X[15], 6, k3); Subround(I, a1, b1, c1, d1, X[14], 8, k3); Subround(I, d1, a1, b1, c1, X[ 5], 6, k3); Subround(I, c1, d1, a1, b1, X[ 6], 5, k3); Subround(I, b1, c1, d1, a1, X[ 2], 12, k3); Subround(I, a2, b2, c2, d2, X[ 5], 8, k5); Subround(I, d2, a2, b2, c2, X[14], 9, k5); Subround(I, c2, d2, a2, b2, X[ 7], 9, k5); Subround(I, b2, c2, d2, a2, X[ 0], 11, k5); Subround(I, a2, b2, c2, d2, X[ 9], 13, k5); Subround(I, d2, a2, b2, c2, X[ 2], 15, k5); Subround(I, c2, d2, a2, b2, X[11], 15, k5); Subround(I, b2, c2, d2, a2, X[ 4], 5, k5); Subround(I, a2, b2, c2, d2, X[13], 7, k5); Subround(I, d2, a2, b2, c2, X[ 6], 7, k5); Subround(I, c2, d2, a2, b2, X[15], 8, k5); Subround(I, b2, c2, d2, a2, X[ 8], 11, k5); Subround(I, a2, b2, c2, d2, X[ 1], 14, k5); Subround(I, d2, a2, b2, c2, X[10], 14, k5); Subround(I, c2, d2, a2, b2, X[ 3], 12, k5); Subround(I, b2, c2, d2, a2, X[12], 6, k5); Subround(H, a2, b2, c2, d2, X[ 6], 9, k6); Subround(H, d2, a2, b2, c2, X[11], 13, k6); Subround(H, c2, d2, a2, b2, X[ 3], 15, k6); Subround(H, b2, c2, d2, a2, X[ 7], 7, k6); Subround(H, a2, b2, c2, d2, X[ 0], 12, k6); Subround(H, d2, a2, b2, c2, X[13], 8, k6); Subround(H, c2, d2, a2, b2, X[ 5], 9, k6); Subround(H, b2, c2, d2, a2, X[10], 11, k6); Subround(H, a2, b2, c2, d2, X[14], 7, k6); Subround(H, d2, a2, b2, c2, X[15], 7, k6); Subround(H, c2, d2, a2, b2, X[ 8], 12, k6); Subround(H, b2, c2, d2, a2, X[12], 7, k6); Subround(H, a2, b2, c2, d2, X[ 4], 6, k6); Subround(H, d2, a2, b2, c2, X[ 9], 15, k6); Subround(H, c2, d2, a2, b2, X[ 1], 13, k6); Subround(H, b2, c2, d2, a2, X[ 2], 11, k6); Subround(G, a2, b2, c2, d2, X[15], 9, k7); Subround(G, d2, a2, b2, c2, X[ 5], 7, k7); Subround(G, c2, d2, a2, b2, X[ 1], 15, k7); Subround(G, b2, c2, d2, a2, X[ 3], 11, k7); Subround(G, a2, b2, c2, d2, X[ 7], 8, k7); Subround(G, d2, a2, b2, c2, X[14], 6, k7); Subround(G, c2, d2, a2, b2, X[ 6], 6, k7); Subround(G, b2, c2, d2, a2, X[ 9], 14, k7); Subround(G, a2, b2, c2, d2, X[11], 12, k7); Subround(G, d2, a2, b2, c2, X[ 8], 13, k7); Subround(G, c2, d2, a2, b2, X[12], 5, k7); Subround(G, b2, c2, d2, a2, X[ 2], 14, k7); Subround(G, a2, b2, c2, d2, X[10], 13, k7); Subround(G, d2, a2, b2, c2, X[ 0], 13, k7); Subround(G, c2, d2, a2, b2, X[ 4], 7, k7); Subround(G, b2, c2, d2, a2, X[13], 5, k7); Subround(F, a2, b2, c2, d2, X[ 8], 15, k9); Subround(F, d2, a2, b2, c2, X[ 6], 5, k9); Subround(F, c2, d2, a2, b2, X[ 4], 8, k9); Subround(F, b2, c2, d2, a2, X[ 1], 11, k9); Subround(F, a2, b2, c2, d2, X[ 3], 14, k9); Subround(F, d2, a2, b2, c2, X[11], 14, k9); Subround(F, c2, d2, a2, b2, X[15], 6, k9); Subround(F, b2, c2, d2, a2, X[ 0], 14, k9); Subround(F, a2, b2, c2, d2, X[ 5], 6, k9); Subround(F, d2, a2, b2, c2, X[12], 9, k9); Subround(F, c2, d2, a2, b2, X[ 2], 12, k9); Subround(F, b2, c2, d2, a2, X[13], 9, k9); Subround(F, a2, b2, c2, d2, X[ 9], 12, k9); Subround(F, d2, a2, b2, c2, X[ 7], 5, k9); Subround(F, c2, d2, a2, b2, X[10], 15, k9); Subround(F, b2, c2, d2, a2, X[14], 8, k9); c1 = digest[1] + c1 + d2; digest[1] = digest[2] + d1 + a2; digest[2] = digest[3] + a1 + b2; digest[3] = digest[0] + b1 + c2; digest[0] = c1; } // ************************************************************* void RIPEMD256::InitState(HashWordType *state) { state[0] = 0x67452301L; state[1] = 0xefcdab89L; state[2] = 0x98badcfeL; state[3] = 0x10325476L; state[4] = 0x76543210L; state[5] = 0xfedcba98L; state[6] = 0x89abcdefL; state[7] = 0x01234567L; } void RIPEMD256::Transform (word32 *digest, const word32 *X) { unsigned long a1, b1, c1, d1, a2, b2, c2, d2, t; a1 = digest[0]; b1 = digest[1]; c1 = digest[2]; d1 = digest[3]; a2 = digest[4]; b2 = digest[5]; c2 = digest[6]; d2 = digest[7]; Subround(F, a1, b1, c1, d1, X[ 0], 11, k0); Subround(F, d1, a1, b1, c1, X[ 1], 14, k0); Subround(F, c1, d1, a1, b1, X[ 2], 15, k0); Subround(F, b1, c1, d1, a1, X[ 3], 12, k0); Subround(F, a1, b1, c1, d1, X[ 4], 5, k0); Subround(F, d1, a1, b1, c1, X[ 5], 8, k0); Subround(F, c1, d1, a1, b1, X[ 6], 7, k0); Subround(F, b1, c1, d1, a1, X[ 7], 9, k0); Subround(F, a1, b1, c1, d1, X[ 8], 11, k0); Subround(F, d1, a1, b1, c1, X[ 9], 13, k0); Subround(F, c1, d1, a1, b1, X[10], 14, k0); Subround(F, b1, c1, d1, a1, X[11], 15, k0); Subround(F, a1, b1, c1, d1, X[12], 6, k0); Subround(F, d1, a1, b1, c1, X[13], 7, k0); Subround(F, c1, d1, a1, b1, X[14], 9, k0); Subround(F, b1, c1, d1, a1, X[15], 8, k0); Subround(I, a2, b2, c2, d2, X[ 5], 8, k5); Subround(I, d2, a2, b2, c2, X[14], 9, k5); Subround(I, c2, d2, a2, b2, X[ 7], 9, k5); Subround(I, b2, c2, d2, a2, X[ 0], 11, k5); Subround(I, a2, b2, c2, d2, X[ 9], 13, k5); Subround(I, d2, a2, b2, c2, X[ 2], 15, k5); Subround(I, c2, d2, a2, b2, X[11], 15, k5); Subround(I, b2, c2, d2, a2, X[ 4], 5, k5); Subround(I, a2, b2, c2, d2, X[13], 7, k5); Subround(I, d2, a2, b2, c2, X[ 6], 7, k5); Subround(I, c2, d2, a2, b2, X[15], 8, k5); Subround(I, b2, c2, d2, a2, X[ 8], 11, k5); Subround(I, a2, b2, c2, d2, X[ 1], 14, k5); Subround(I, d2, a2, b2, c2, X[10], 14, k5); Subround(I, c2, d2, a2, b2, X[ 3], 12, k5); Subround(I, b2, c2, d2, a2, X[12], 6, k5); t = a1; a1 = a2; a2 = t; Subround(G, a1, b1, c1, d1, X[ 7], 7, k1); Subround(G, d1, a1, b1, c1, X[ 4], 6, k1); Subround(G, c1, d1, a1, b1, X[13], 8, k1); Subround(G, b1, c1, d1, a1, X[ 1], 13, k1); Subround(G, a1, b1, c1, d1, X[10], 11, k1); Subround(G, d1, a1, b1, c1, X[ 6], 9, k1); Subround(G, c1, d1, a1, b1, X[15], 7, k1); Subround(G, b1, c1, d1, a1, X[ 3], 15, k1); Subround(G, a1, b1, c1, d1, X[12], 7, k1); Subround(G, d1, a1, b1, c1, X[ 0], 12, k1); Subround(G, c1, d1, a1, b1, X[ 9], 15, k1); Subround(G, b1, c1, d1, a1, X[ 5], 9, k1); Subround(G, a1, b1, c1, d1, X[ 2], 11, k1); Subround(G, d1, a1, b1, c1, X[14], 7, k1); Subround(G, c1, d1, a1, b1, X[11], 13, k1); Subround(G, b1, c1, d1, a1, X[ 8], 12, k1); Subround(H, a2, b2, c2, d2, X[ 6], 9, k6); Subround(H, d2, a2, b2, c2, X[11], 13, k6); Subround(H, c2, d2, a2, b2, X[ 3], 15, k6); Subround(H, b2, c2, d2, a2, X[ 7], 7, k6); Subround(H, a2, b2, c2, d2, X[ 0], 12, k6); Subround(H, d2, a2, b2, c2, X[13], 8, k6); Subround(H, c2, d2, a2, b2, X[ 5], 9, k6); Subround(H, b2, c2, d2, a2, X[10], 11, k6); Subround(H, a2, b2, c2, d2, X[14], 7, k6); Subround(H, d2, a2, b2, c2, X[15], 7, k6); Subround(H, c2, d2, a2, b2, X[ 8], 12, k6); Subround(H, b2, c2, d2, a2, X[12], 7, k6); Subround(H, a2, b2, c2, d2, X[ 4], 6, k6); Subround(H, d2, a2, b2, c2, X[ 9], 15, k6); Subround(H, c2, d2, a2, b2, X[ 1], 13, k6); Subround(H, b2, c2, d2, a2, X[ 2], 11, k6); t = b1; b1 = b2; b2 = t; Subround(H, a1, b1, c1, d1, X[ 3], 11, k2); Subround(H, d1, a1, b1, c1, X[10], 13, k2); Subround(H, c1, d1, a1, b1, X[14], 6, k2); Subround(H, b1, c1, d1, a1, X[ 4], 7, k2); Subround(H, a1, b1, c1, d1, X[ 9], 14, k2); Subround(H, d1, a1, b1, c1, X[15], 9, k2); Subround(H, c1, d1, a1, b1, X[ 8], 13, k2); Subround(H, b1, c1, d1, a1, X[ 1], 15, k2); Subround(H, a1, b1, c1, d1, X[ 2], 14, k2); Subround(H, d1, a1, b1, c1, X[ 7], 8, k2); Subround(H, c1, d1, a1, b1, X[ 0], 13, k2); Subround(H, b1, c1, d1, a1, X[ 6], 6, k2); Subround(H, a1, b1, c1, d1, X[13], 5, k2); Subround(H, d1, a1, b1, c1, X[11], 12, k2); Subround(H, c1, d1, a1, b1, X[ 5], 7, k2); Subround(H, b1, c1, d1, a1, X[12], 5, k2); Subround(G, a2, b2, c2, d2, X[15], 9, k7); Subround(G, d2, a2, b2, c2, X[ 5], 7, k7); Subround(G, c2, d2, a2, b2, X[ 1], 15, k7); Subround(G, b2, c2, d2, a2, X[ 3], 11, k7); Subround(G, a2, b2, c2, d2, X[ 7], 8, k7); Subround(G, d2, a2, b2, c2, X[14], 6, k7); Subround(G, c2, d2, a2, b2, X[ 6], 6, k7); Subround(G, b2, c2, d2, a2, X[ 9], 14, k7); Subround(G, a2, b2, c2, d2, X[11], 12, k7); Subround(G, d2, a2, b2, c2, X[ 8], 13, k7); Subround(G, c2, d2, a2, b2, X[12], 5, k7); Subround(G, b2, c2, d2, a2, X[ 2], 14, k7); Subround(G, a2, b2, c2, d2, X[10], 13, k7); Subround(G, d2, a2, b2, c2, X[ 0], 13, k7); Subround(G, c2, d2, a2, b2, X[ 4], 7, k7); Subround(G, b2, c2, d2, a2, X[13], 5, k7); t = c1; c1 = c2; c2 = t; Subround(I, a1, b1, c1, d1, X[ 1], 11, k3); Subround(I, d1, a1, b1, c1, X[ 9], 12, k3); Subround(I, c1, d1, a1, b1, X[11], 14, k3); Subround(I, b1, c1, d1, a1, X[10], 15, k3); Subround(I, a1, b1, c1, d1, X[ 0], 14, k3); Subround(I, d1, a1, b1, c1, X[ 8], 15, k3); Subround(I, c1, d1, a1, b1, X[12], 9, k3); Subround(I, b1, c1, d1, a1, X[ 4], 8, k3); Subround(I, a1, b1, c1, d1, X[13], 9, k3); Subround(I, d1, a1, b1, c1, X[ 3], 14, k3); Subround(I, c1, d1, a1, b1, X[ 7], 5, k3); Subround(I, b1, c1, d1, a1, X[15], 6, k3); Subround(I, a1, b1, c1, d1, X[14], 8, k3); Subround(I, d1, a1, b1, c1, X[ 5], 6, k3); Subround(I, c1, d1, a1, b1, X[ 6], 5, k3); Subround(I, b1, c1, d1, a1, X[ 2], 12, k3); Subround(F, a2, b2, c2, d2, X[ 8], 15, k9); Subround(F, d2, a2, b2, c2, X[ 6], 5, k9); Subround(F, c2, d2, a2, b2, X[ 4], 8, k9); Subround(F, b2, c2, d2, a2, X[ 1], 11, k9); Subround(F, a2, b2, c2, d2, X[ 3], 14, k9); Subround(F, d2, a2, b2, c2, X[11], 14, k9); Subround(F, c2, d2, a2, b2, X[15], 6, k9); Subround(F, b2, c2, d2, a2, X[ 0], 14, k9); Subround(F, a2, b2, c2, d2, X[ 5], 6, k9); Subround(F, d2, a2, b2, c2, X[12], 9, k9); Subround(F, c2, d2, a2, b2, X[ 2], 12, k9); Subround(F, b2, c2, d2, a2, X[13], 9, k9); Subround(F, a2, b2, c2, d2, X[ 9], 12, k9); Subround(F, d2, a2, b2, c2, X[ 7], 5, k9); Subround(F, c2, d2, a2, b2, X[10], 15, k9); Subround(F, b2, c2, d2, a2, X[14], 8, k9); t = d1; d1 = d2; d2 = t; digest[0] += a1; digest[1] += b1; digest[2] += c1; digest[3] += d1; digest[4] += a2; digest[5] += b2; digest[6] += c2; digest[7] += d2; } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/ec2n.cpp0000755000000000000000000001604412414772654017136 0ustar rootroot// ec2n.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "ec2n.h" #include "asn.h" #include "algebra.cpp" #include "eprecomp.cpp" NAMESPACE_BEGIN(CryptoPP) EC2N::EC2N(BufferedTransformation &bt) : m_field(BERDecodeGF2NP(bt)) { BERSequenceDecoder seq(bt); m_field->BERDecodeElement(seq, m_a); m_field->BERDecodeElement(seq, m_b); // skip optional seed if (!seq.EndReached()) { SecByteBlock seed; unsigned int unused; BERDecodeBitString(seq, seed, unused); } seq.MessageEnd(); } void EC2N::DEREncode(BufferedTransformation &bt) const { m_field->DEREncode(bt); DERSequenceEncoder seq(bt); m_field->DEREncodeElement(seq, m_a); m_field->DEREncodeElement(seq, m_b); seq.MessageEnd(); } bool EC2N::DecodePoint(EC2N::Point &P, const byte *encodedPoint, size_t encodedPointLen) const { StringStore store(encodedPoint, encodedPointLen); return DecodePoint(P, store, encodedPointLen); } bool EC2N::DecodePoint(EC2N::Point &P, BufferedTransformation &bt, size_t encodedPointLen) const { byte type; if (encodedPointLen < 1 || !bt.Get(type)) return false; switch (type) { case 0: P.identity = true; return true; case 2: case 3: { if (encodedPointLen != EncodedPointSize(true)) return false; P.identity = false; P.x.Decode(bt, m_field->MaxElementByteLength()); if (P.x.IsZero()) { P.y = m_field->SquareRoot(m_b); return true; } FieldElement z = m_field->Square(P.x); assert(P.x == m_field->SquareRoot(z)); P.y = m_field->Divide(m_field->Add(m_field->Multiply(z, m_field->Add(P.x, m_a)), m_b), z); assert(P.x == m_field->Subtract(m_field->Divide(m_field->Subtract(m_field->Multiply(P.y, z), m_b), z), m_a)); z = m_field->SolveQuadraticEquation(P.y); assert(m_field->Add(m_field->Square(z), z) == P.y); z.SetCoefficient(0, type & 1); P.y = m_field->Multiply(z, P.x); return true; } case 4: { if (encodedPointLen != EncodedPointSize(false)) return false; unsigned int len = m_field->MaxElementByteLength(); P.identity = false; P.x.Decode(bt, len); P.y.Decode(bt, len); return true; } default: return false; } } void EC2N::EncodePoint(BufferedTransformation &bt, const Point &P, bool compressed) const { if (P.identity) NullStore().TransferTo(bt, EncodedPointSize(compressed)); else if (compressed) { bt.Put(2 + (!P.x ? 0 : m_field->Divide(P.y, P.x).GetBit(0))); P.x.Encode(bt, m_field->MaxElementByteLength()); } else { unsigned int len = m_field->MaxElementByteLength(); bt.Put(4); // uncompressed P.x.Encode(bt, len); P.y.Encode(bt, len); } } void EC2N::EncodePoint(byte *encodedPoint, const Point &P, bool compressed) const { ArraySink sink(encodedPoint, EncodedPointSize(compressed)); EncodePoint(sink, P, compressed); assert(sink.TotalPutLength() == EncodedPointSize(compressed)); } EC2N::Point EC2N::BERDecodePoint(BufferedTransformation &bt) const { SecByteBlock str; BERDecodeOctetString(bt, str); Point P; if (!DecodePoint(P, str, str.size())) BERDecodeError(); return P; } void EC2N::DEREncodePoint(BufferedTransformation &bt, const Point &P, bool compressed) const { SecByteBlock str(EncodedPointSize(compressed)); EncodePoint(str, P, compressed); DEREncodeOctetString(bt, str); } bool EC2N::ValidateParameters(RandomNumberGenerator &rng, unsigned int level) const { bool pass = !!m_b; pass = pass && m_a.CoefficientCount() <= m_field->MaxElementBitLength(); pass = pass && m_b.CoefficientCount() <= m_field->MaxElementBitLength(); if (level >= 1) pass = pass && m_field->GetModulus().IsIrreducible(); return pass; } bool EC2N::VerifyPoint(const Point &P) const { const FieldElement &x = P.x, &y = P.y; return P.identity || (x.CoefficientCount() <= m_field->MaxElementBitLength() && y.CoefficientCount() <= m_field->MaxElementBitLength() && !(((x+m_a)*x*x+m_b-(x+y)*y)%m_field->GetModulus())); } bool EC2N::Equal(const Point &P, const Point &Q) const { if (P.identity && Q.identity) return true; if (P.identity && !Q.identity) return false; if (!P.identity && Q.identity) return false; return (m_field->Equal(P.x,Q.x) && m_field->Equal(P.y,Q.y)); } const EC2N::Point& EC2N::Identity() const { return Singleton().Ref(); } const EC2N::Point& EC2N::Inverse(const Point &P) const { if (P.identity) return P; else { m_R.identity = false; m_R.y = m_field->Add(P.x, P.y); m_R.x = P.x; return m_R; } } const EC2N::Point& EC2N::Add(const Point &P, const Point &Q) const { if (P.identity) return Q; if (Q.identity) return P; if (Equal(P, Q)) return Double(P); if (m_field->Equal(P.x, Q.x) && m_field->Equal(P.y, m_field->Add(Q.x, Q.y))) return Identity(); FieldElement t = m_field->Add(P.y, Q.y); t = m_field->Divide(t, m_field->Add(P.x, Q.x)); FieldElement x = m_field->Square(t); m_field->Accumulate(x, t); m_field->Accumulate(x, Q.x); m_field->Accumulate(x, m_a); m_R.y = m_field->Add(P.y, m_field->Multiply(t, x)); m_field->Accumulate(x, P.x); m_field->Accumulate(m_R.y, x); m_R.x.swap(x); m_R.identity = false; return m_R; } const EC2N::Point& EC2N::Double(const Point &P) const { if (P.identity) return P; if (!m_field->IsUnit(P.x)) return Identity(); FieldElement t = m_field->Divide(P.y, P.x); m_field->Accumulate(t, P.x); m_R.y = m_field->Square(P.x); m_R.x = m_field->Square(t); m_field->Accumulate(m_R.x, t); m_field->Accumulate(m_R.x, m_a); m_field->Accumulate(m_R.y, m_field->Multiply(t, m_R.x)); m_field->Accumulate(m_R.y, m_R.x); m_R.identity = false; return m_R; } // ******************************************************** /* EcPrecomputation& EcPrecomputation::operator=(const EcPrecomputation &rhs) { m_ec = rhs.m_ec; m_ep = rhs.m_ep; m_ep.m_group = m_ec.get(); return *this; } void EcPrecomputation::SetCurveAndBase(const EC2N &ec, const EC2N::Point &base) { m_ec.reset(new EC2N(ec)); m_ep.SetGroupAndBase(*m_ec, base); } void EcPrecomputation::Precompute(unsigned int maxExpBits, unsigned int storage) { m_ep.Precompute(maxExpBits, storage); } void EcPrecomputation::Load(BufferedTransformation &bt) { BERSequenceDecoder seq(bt); word32 version; BERDecodeUnsigned(seq, version, INTEGER, 1, 1); m_ep.m_exponentBase.BERDecode(seq); m_ep.m_windowSize = m_ep.m_exponentBase.BitCount() - 1; m_ep.m_bases.clear(); while (!seq.EndReached()) m_ep.m_bases.push_back(m_ec->BERDecodePoint(seq)); seq.MessageEnd(); } void EcPrecomputation::Save(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); DEREncodeUnsigned(seq, 1); // version m_ep.m_exponentBase.DEREncode(seq); for (unsigned i=0; iDEREncodePoint(seq, m_ep.m_bases[i]); seq.MessageEnd(); } EC2N::Point EcPrecomputation::Exponentiate(const Integer &exponent) const { return m_ep.Exponentiate(exponent); } EC2N::Point EcPrecomputation::CascadeExponentiate(const Integer &exponent, const DL_FixedBasePrecomputation &pc2, const Integer &exponent2) const { return m_ep.CascadeExponentiate(exponent, static_cast &>(pc2).m_ep, exponent2); } */ NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/dsa.cpp0000755000000000000000000000461112414772654017053 0ustar rootroot// dsa.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "dsa.h" #include "nbtheory.h" NAMESPACE_BEGIN(CryptoPP) size_t DSAConvertSignatureFormat(byte *buffer, size_t bufferSize, DSASignatureFormat toFormat, const byte *signature, size_t signatureLen, DSASignatureFormat fromFormat) { Integer r, s; StringStore store(signature, signatureLen); ArraySink sink(buffer, bufferSize); switch (fromFormat) { case DSA_P1363: r.Decode(store, signatureLen/2); s.Decode(store, signatureLen/2); break; case DSA_DER: { BERSequenceDecoder seq(store); r.BERDecode(seq); s.BERDecode(seq); seq.MessageEnd(); break; } case DSA_OPENPGP: r.OpenPGPDecode(store); s.OpenPGPDecode(store); break; } switch (toFormat) { case DSA_P1363: r.Encode(sink, bufferSize/2); s.Encode(sink, bufferSize/2); break; case DSA_DER: { DERSequenceEncoder seq(sink); r.DEREncode(seq); s.DEREncode(seq); seq.MessageEnd(); break; } case DSA_OPENPGP: r.OpenPGPEncode(sink); s.OpenPGPEncode(sink); break; } return (size_t)sink.TotalPutLength(); } bool DSA::GeneratePrimes(const byte *seedIn, unsigned int g, int &counter, Integer &p, unsigned int L, Integer &q, bool useInputCounterValue) { assert(g%8 == 0); SHA sha; SecByteBlock seed(seedIn, g/8); SecByteBlock U(SHA::DIGESTSIZE); SecByteBlock temp(SHA::DIGESTSIZE); SecByteBlock W(((L-1)/160+1) * SHA::DIGESTSIZE); const int n = (L-1) / 160; const int b = (L-1) % 160; Integer X; sha.CalculateDigest(U, seed, g/8); for (int i=g/8-1, carry=true; i>=0 && carry; i--) carry=!++seed[i]; sha.CalculateDigest(temp, seed, g/8); xorbuf(U, temp, SHA::DIGESTSIZE); U[0] |= 0x80; U[SHA::DIGESTSIZE-1] |= 1; q.Decode(U, SHA::DIGESTSIZE); if (!IsPrime(q)) return false; int counterEnd = useInputCounterValue ? counter+1 : 4096; for (int c = 0; c < counterEnd; c++) { for (int k=0; k<=n; k++) { for (int i=g/8-1, carry=true; i>=0 && carry; i--) carry=!++seed[i]; if (!useInputCounterValue || c == counter) sha.CalculateDigest(W+(n-k)*SHA::DIGESTSIZE, seed, g/8); } if (!useInputCounterValue || c == counter) { W[SHA::DIGESTSIZE - 1 - b/8] |= 0x80; X.Decode(W + SHA::DIGESTSIZE - 1 - b/8, L/8); p = X-((X % (2*q))-1); if (p.GetBit(L-1) && IsPrime(p)) { counter = c; return true; } } } return false; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/cast.cpp0000755000000000000000000002540012414772654017235 0ustar rootroot// cast.cpp - written and placed in the public domain by Wei Dai and Leonard Janke // based on Steve Reid's public domain cast.c #include "pch.h" #include "cast.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) /* Macros to access 8-bit bytes out of a 32-bit word */ #define U8a(x) GETBYTE(x,3) #define U8b(x) GETBYTE(x,2) #define U8c(x) GETBYTE(x,1) #define U8d(x) GETBYTE(x,0) /* CAST uses three different round functions */ #define f1(l, r, km, kr) \ t = rotlVariable(km + r, kr); \ l ^= ((S[0][U8a(t)] ^ S[1][U8b(t)]) - \ S[2][U8c(t)]) + S[3][U8d(t)]; #define f2(l, r, km, kr) \ t = rotlVariable(km ^ r, kr); \ l ^= ((S[0][U8a(t)] - S[1][U8b(t)]) + \ S[2][U8c(t)]) ^ S[3][U8d(t)]; #define f3(l, r, km, kr) \ t = rotlVariable(km - r, kr); \ l ^= ((S[0][U8a(t)] + S[1][U8b(t)]) ^ \ S[2][U8c(t)]) - S[3][U8d(t)]; #define F1(l, r, i, j) f1(l, r, K[i], K[i+j]) #define F2(l, r, i, j) f2(l, r, K[i], K[i+j]) #define F3(l, r, i, j) f3(l, r, K[i], K[i+j]) typedef BlockGetAndPut Block; void CAST128::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 t, l, r; /* Get inblock into l,r */ Block::Get(inBlock)(l)(r); /* Do the work */ F1(l, r, 0, 16); F2(r, l, 1, 16); F3(l, r, 2, 16); F1(r, l, 3, 16); F2(l, r, 4, 16); F3(r, l, 5, 16); F1(l, r, 6, 16); F2(r, l, 7, 16); F3(l, r, 8, 16); F1(r, l, 9, 16); F2(l, r, 10, 16); F3(r, l, 11, 16); /* Only do full 16 rounds if key length > 80 bits */ if (!reduced) { F1(l, r, 12, 16); F2(r, l, 13, 16); F3(l, r, 14, 16); F1(r, l, 15, 16); } /* Put l,r into outblock */ Block::Put(xorBlock, outBlock)(r)(l); } void CAST128::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 t, l, r; /* Get inblock into l,r */ Block::Get(inBlock)(r)(l); /* Only do full 16 rounds if key length > 80 bits */ if (!reduced) { F1(r, l, 15, 16); F3(l, r, 14, 16); F2(r, l, 13, 16); F1(l, r, 12, 16); } F3(r, l, 11, 16); F2(l, r, 10, 16); F1(r, l, 9, 16); F3(l, r, 8, 16); F2(r, l, 7, 16); F1(l, r, 6, 16); F3(r, l, 5, 16); F2(l, r, 4, 16); F1(r, l, 3, 16); F3(l, r, 2, 16); F2(r, l, 1, 16); F1(l, r, 0, 16); /* Put l,r into outblock */ Block::Put(xorBlock, outBlock)(l)(r); /* Wipe clean */ t = l = r = 0; } void CAST128::Base::UncheckedSetKey(const byte *userKey, unsigned int keylength, const NameValuePairs &) { AssertValidKeyLength(keylength); reduced = (keylength <= 10); word32 X[4], Z[4]; GetUserKey(BIG_ENDIAN_ORDER, X, 4, userKey, keylength); #define x(i) GETBYTE(X[i/4], 3-i%4) #define z(i) GETBYTE(Z[i/4], 3-i%4) unsigned int i; for (i=0; i<=16; i+=16) { // this part is copied directly from RFC 2144 (with some search and replace) by Wei Dai Z[0] = X[0] ^ S[4][x(0xD)] ^ S[5][x(0xF)] ^ S[6][x(0xC)] ^ S[7][x(0xE)] ^ S[6][x(0x8)]; Z[1] = X[2] ^ S[4][z(0x0)] ^ S[5][z(0x2)] ^ S[6][z(0x1)] ^ S[7][z(0x3)] ^ S[7][x(0xA)]; Z[2] = X[3] ^ S[4][z(0x7)] ^ S[5][z(0x6)] ^ S[6][z(0x5)] ^ S[7][z(0x4)] ^ S[4][x(0x9)]; Z[3] = X[1] ^ S[4][z(0xA)] ^ S[5][z(0x9)] ^ S[6][z(0xB)] ^ S[7][z(0x8)] ^ S[5][x(0xB)]; K[i+0] = S[4][z(0x8)] ^ S[5][z(0x9)] ^ S[6][z(0x7)] ^ S[7][z(0x6)] ^ S[4][z(0x2)]; K[i+1] = S[4][z(0xA)] ^ S[5][z(0xB)] ^ S[6][z(0x5)] ^ S[7][z(0x4)] ^ S[5][z(0x6)]; K[i+2] = S[4][z(0xC)] ^ S[5][z(0xD)] ^ S[6][z(0x3)] ^ S[7][z(0x2)] ^ S[6][z(0x9)]; K[i+3] = S[4][z(0xE)] ^ S[5][z(0xF)] ^ S[6][z(0x1)] ^ S[7][z(0x0)] ^ S[7][z(0xC)]; X[0] = Z[2] ^ S[4][z(0x5)] ^ S[5][z(0x7)] ^ S[6][z(0x4)] ^ S[7][z(0x6)] ^ S[6][z(0x0)]; X[1] = Z[0] ^ S[4][x(0x0)] ^ S[5][x(0x2)] ^ S[6][x(0x1)] ^ S[7][x(0x3)] ^ S[7][z(0x2)]; X[2] = Z[1] ^ S[4][x(0x7)] ^ S[5][x(0x6)] ^ S[6][x(0x5)] ^ S[7][x(0x4)] ^ S[4][z(0x1)]; X[3] = Z[3] ^ S[4][x(0xA)] ^ S[5][x(0x9)] ^ S[6][x(0xB)] ^ S[7][x(0x8)] ^ S[5][z(0x3)]; K[i+4] = S[4][x(0x3)] ^ S[5][x(0x2)] ^ S[6][x(0xC)] ^ S[7][x(0xD)] ^ S[4][x(0x8)]; K[i+5] = S[4][x(0x1)] ^ S[5][x(0x0)] ^ S[6][x(0xE)] ^ S[7][x(0xF)] ^ S[5][x(0xD)]; K[i+6] = S[4][x(0x7)] ^ S[5][x(0x6)] ^ S[6][x(0x8)] ^ S[7][x(0x9)] ^ S[6][x(0x3)]; K[i+7] = S[4][x(0x5)] ^ S[5][x(0x4)] ^ S[6][x(0xA)] ^ S[7][x(0xB)] ^ S[7][x(0x7)]; Z[0] = X[0] ^ S[4][x(0xD)] ^ S[5][x(0xF)] ^ S[6][x(0xC)] ^ S[7][x(0xE)] ^ S[6][x(0x8)]; Z[1] = X[2] ^ S[4][z(0x0)] ^ S[5][z(0x2)] ^ S[6][z(0x1)] ^ S[7][z(0x3)] ^ S[7][x(0xA)]; Z[2] = X[3] ^ S[4][z(0x7)] ^ S[5][z(0x6)] ^ S[6][z(0x5)] ^ S[7][z(0x4)] ^ S[4][x(0x9)]; Z[3] = X[1] ^ S[4][z(0xA)] ^ S[5][z(0x9)] ^ S[6][z(0xB)] ^ S[7][z(0x8)] ^ S[5][x(0xB)]; K[i+8] = S[4][z(0x3)] ^ S[5][z(0x2)] ^ S[6][z(0xC)] ^ S[7][z(0xD)] ^ S[4][z(0x9)]; K[i+9] = S[4][z(0x1)] ^ S[5][z(0x0)] ^ S[6][z(0xE)] ^ S[7][z(0xF)] ^ S[5][z(0xC)]; K[i+10] = S[4][z(0x7)] ^ S[5][z(0x6)] ^ S[6][z(0x8)] ^ S[7][z(0x9)] ^ S[6][z(0x2)]; K[i+11] = S[4][z(0x5)] ^ S[5][z(0x4)] ^ S[6][z(0xA)] ^ S[7][z(0xB)] ^ S[7][z(0x6)]; X[0] = Z[2] ^ S[4][z(0x5)] ^ S[5][z(0x7)] ^ S[6][z(0x4)] ^ S[7][z(0x6)] ^ S[6][z(0x0)]; X[1] = Z[0] ^ S[4][x(0x0)] ^ S[5][x(0x2)] ^ S[6][x(0x1)] ^ S[7][x(0x3)] ^ S[7][z(0x2)]; X[2] = Z[1] ^ S[4][x(0x7)] ^ S[5][x(0x6)] ^ S[6][x(0x5)] ^ S[7][x(0x4)] ^ S[4][z(0x1)]; X[3] = Z[3] ^ S[4][x(0xA)] ^ S[5][x(0x9)] ^ S[6][x(0xB)] ^ S[7][x(0x8)] ^ S[5][z(0x3)]; K[i+12] = S[4][x(0x8)] ^ S[5][x(0x9)] ^ S[6][x(0x7)] ^ S[7][x(0x6)] ^ S[4][x(0x3)]; K[i+13] = S[4][x(0xA)] ^ S[5][x(0xB)] ^ S[6][x(0x5)] ^ S[7][x(0x4)] ^ S[5][x(0x7)]; K[i+14] = S[4][x(0xC)] ^ S[5][x(0xD)] ^ S[6][x(0x3)] ^ S[7][x(0x2)] ^ S[6][x(0x8)]; K[i+15] = S[4][x(0xE)] ^ S[5][x(0xF)] ^ S[6][x(0x1)] ^ S[7][x(0x0)] ^ S[7][x(0xD)]; } for (i=16; i<32; i++) K[i] &= 0x1f; } // The following CAST-256 implementation was contributed by Leonard Janke const word32 CAST256::Base::t_m[8][24]={ { 0x5a827999, 0xd151d6a1, 0x482133a9, 0xbef090b1, 0x35bfedb9, 0xac8f4ac1, 0x235ea7c9, 0x9a2e04d1, 0x10fd61d9, 0x87ccbee1, 0xfe9c1be9, 0x756b78f1, 0xec3ad5f9, 0x630a3301, 0xd9d99009, 0x50a8ed11, 0xc7784a19, 0x3e47a721, 0xb5170429, 0x2be66131, 0xa2b5be39, 0x19851b41, 0x90547849, 0x0723d551}, { 0xc95c653a, 0x402bc242, 0xb6fb1f4a, 0x2dca7c52, 0xa499d95a, 0x1b693662, 0x9238936a, 0x0907f072, 0x7fd74d7a, 0xf6a6aa82, 0x6d76078a, 0xe4456492, 0x5b14c19a, 0xd1e41ea2, 0x48b37baa, 0xbf82d8b2, 0x365235ba, 0xad2192c2, 0x23f0efca, 0x9ac04cd2, 0x118fa9da, 0x885f06e2, 0xff2e63ea, 0x75fdc0f2}, { 0x383650db, 0xaf05ade3, 0x25d50aeb, 0x9ca467f3, 0x1373c4fb, 0x8a432203, 0x01127f0b, 0x77e1dc13, 0xeeb1391b, 0x65809623, 0xdc4ff32b, 0x531f5033, 0xc9eead3b, 0x40be0a43, 0xb78d674b, 0x2e5cc453, 0xa52c215b, 0x1bfb7e63, 0x92cadb6b, 0x099a3873, 0x8069957b, 0xf738f283, 0x6e084f8b, 0xe4d7ac93}, { 0xa7103c7c, 0x1ddf9984, 0x94aef68c, 0x0b7e5394, 0x824db09c, 0xf91d0da4, 0x6fec6aac, 0xe6bbc7b4, 0x5d8b24bc, 0xd45a81c4, 0x4b29decc, 0xc1f93bd4, 0x38c898dc, 0xaf97f5e4, 0x266752ec, 0x9d36aff4, 0x14060cfc, 0x8ad56a04, 0x01a4c70c, 0x78742414, 0xef43811c, 0x6612de24, 0xdce23b2c, 0x53b19834}, { 0x15ea281d, 0x8cb98525, 0x0388e22d, 0x7a583f35, 0xf1279c3d, 0x67f6f945, 0xdec6564d, 0x5595b355, 0xcc65105d, 0x43346d65, 0xba03ca6d, 0x30d32775, 0xa7a2847d, 0x1e71e185, 0x95413e8d, 0x0c109b95, 0x82dff89d, 0xf9af55a5, 0x707eb2ad, 0xe74e0fb5, 0x5e1d6cbd, 0xd4ecc9c5, 0x4bbc26cd, 0xc28b83d5}, { 0x84c413be, 0xfb9370c6, 0x7262cdce, 0xe9322ad6, 0x600187de, 0xd6d0e4e6, 0x4da041ee, 0xc46f9ef6, 0x3b3efbfe, 0xb20e5906, 0x28ddb60e, 0x9fad1316, 0x167c701e, 0x8d4bcd26, 0x041b2a2e, 0x7aea8736, 0xf1b9e43e, 0x68894146, 0xdf589e4e, 0x5627fb56, 0xccf7585e, 0x43c6b566, 0xba96126e, 0x31656f76}, { 0xf39dff5f, 0x6a6d5c67, 0xe13cb96f, 0x580c1677, 0xcedb737f, 0x45aad087, 0xbc7a2d8f, 0x33498a97, 0xaa18e79f, 0x20e844a7, 0x97b7a1af, 0x0e86feb7, 0x85565bbf, 0xfc25b8c7, 0x72f515cf, 0xe9c472d7, 0x6093cfdf, 0xd7632ce7, 0x4e3289ef, 0xc501e6f7, 0x3bd143ff, 0xb2a0a107, 0x296ffe0f, 0xa03f5b17}, { 0x6277eb00, 0xd9474808, 0x5016a510, 0xc6e60218, 0x3db55f20, 0xb484bc28, 0x2b541930, 0xa2237638, 0x18f2d340, 0x8fc23048, 0x06918d50, 0x7d60ea58, 0xf4304760, 0x6affa468, 0xe1cf0170, 0x589e5e78, 0xcf6dbb80, 0x463d1888, 0xbd0c7590, 0x33dbd298, 0xaaab2fa0, 0x217a8ca8, 0x9849e9b0, 0x0f1946b8} }; const unsigned int CAST256::Base::t_r[8][24]={ {19, 27, 3, 11, 19, 27, 3, 11, 19, 27, 3, 11, 19, 27, 3, 11, 19, 27, 3, 11, 19, 27, 3, 11}, {4, 12, 20, 28, 4, 12, 20, 28, 4, 12, 20, 28, 4, 12, 20, 28, 4, 12, 20, 28, 4, 12, 20, 28}, {21, 29, 5, 13, 21, 29, 5, 13, 21, 29, 5, 13, 21, 29, 5, 13, 21, 29, 5, 13, 21, 29, 5, 13}, {6, 14, 22, 30, 6, 14, 22, 30, 6, 14, 22, 30, 6, 14, 22, 30, 6, 14, 22, 30, 6, 14, 22, 30}, {23, 31, 7, 15, 23, 31, 7, 15, 23, 31, 7, 15, 23, 31, 7, 15, 23, 31, 7, 15, 23, 31, 7, 15}, {8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0}, {25, 1, 9, 17, 25, 1, 9, 17, 25, 1, 9, 17, 25, 1, 9, 17, 25, 1, 9, 17, 25, 1, 9, 17}, {10, 18, 26, 2, 10, 18, 26, 2, 10, 18, 26, 2, 10, 18, 26, 2, 10, 18, 26, 2, 10, 18, 26, 2} }; #define Q(i) \ F1(block[2],block[3],8*i+4,-4); \ F2(block[1],block[2],8*i+5,-4); \ F3(block[0],block[1],8*i+6,-4); \ F1(block[3],block[0],8*i+7,-4); #define QBar(i) \ F1(block[3],block[0],8*i+7,-4); \ F3(block[0],block[1],8*i+6,-4); \ F2(block[1],block[2],8*i+5,-4); \ F1(block[2],block[3],8*i+4,-4); /* CAST256's encrypt/decrypt functions are identical except for the order that the keys are used */ void CAST256::Base::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 t, block[4]; Block::Get(inBlock)(block[0])(block[1])(block[2])(block[3]); // Perform 6 forward quad rounds Q(0); Q(1); Q(2); Q(3); Q(4); Q(5); // Perform 6 reverse quad rounds QBar(6); QBar(7); QBar(8); QBar(9); QBar(10); QBar(11); Block::Put(xorBlock, outBlock)(block[0])(block[1])(block[2])(block[3]); } /* Set up a CAST-256 key */ void CAST256::Base::Omega(int i, word32 kappa[8]) { word32 t; f1(kappa[6],kappa[7],t_m[0][i],t_r[0][i]); f2(kappa[5],kappa[6],t_m[1][i],t_r[1][i]); f3(kappa[4],kappa[5],t_m[2][i],t_r[2][i]); f1(kappa[3],kappa[4],t_m[3][i],t_r[3][i]); f2(kappa[2],kappa[3],t_m[4][i],t_r[4][i]); f3(kappa[1],kappa[2],t_m[5][i],t_r[5][i]); f1(kappa[0],kappa[1],t_m[6][i],t_r[6][i]); f2(kappa[7],kappa[0],t_m[7][i],t_r[7][i]); } void CAST256::Base::UncheckedSetKey(const byte *userKey, unsigned int keylength, const NameValuePairs &) { AssertValidKeyLength(keylength); word32 kappa[8]; GetUserKey(BIG_ENDIAN_ORDER, kappa, 8, userKey, keylength); for(int i=0; i<12; ++i) { Omega(2*i,kappa); Omega(2*i+1,kappa); K[8*i]=kappa[0] & 31; K[8*i+1]=kappa[2] & 31; K[8*i+2]=kappa[4] & 31; K[8*i+3]=kappa[6] & 31; K[8*i+4]=kappa[7]; K[8*i+5]=kappa[5]; K[8*i+6]=kappa[3]; K[8*i+7]=kappa[1]; } if (!IsForwardTransformation()) { for(int j=0; j<6; ++j) { for(int i=0; i<4; ++i) { int i1=8*j+i; int i2=8*(11-j)+i; assert(i1 cipher; unsigned int S; // blocksize of cipher SecByteBlock dtbuf; // buffer for enciphered timestamp SecByteBlock randseed, m_lastBlock, m_deterministicTimeVector; }; /** This class implements Maurer's Universal Statistical Test for Random Bit Generators it is intended for measuring the randomness of *PHYSICAL* RNGs. For more details see his paper in Journal of Cryptology, 1992. */ class MaurerRandomnessTest : public Bufferless { public: MaurerRandomnessTest(); size_t Put2(const byte *inString, size_t length, int messageEnd, bool blocking); // BytesNeeded() returns how many more bytes of input is needed by the test // GetTestValue() should not be called before BytesNeeded()==0 unsigned int BytesNeeded() const {return n >= (Q+K) ? 0 : Q+K-n;} // returns a number between 0.0 and 1.0, describing the quality of the // random numbers entered double GetTestValue() const; private: enum {L=8, V=256, Q=2000, K=2000}; double sum; unsigned int n; unsigned int tab[V]; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/mqueue.h0000755000000000000000000000646612414772654017264 0ustar rootroot#ifndef CRYPTOPP_MQUEUE_H #define CRYPTOPP_MQUEUE_H #include "queue.h" #include "filters.h" #include NAMESPACE_BEGIN(CryptoPP) //! Message Queue class CRYPTOPP_DLL MessageQueue : public AutoSignaling { public: MessageQueue(unsigned int nodeSize=256); void IsolatedInitialize(const NameValuePairs ¶meters) {m_queue.IsolatedInitialize(parameters); m_lengths.assign(1, 0U); m_messageCounts.assign(1, 0U);} size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking) { m_queue.Put(begin, length); m_lengths.back() += length; if (messageEnd) { m_lengths.push_back(0); m_messageCounts.back()++; } return 0; } bool IsolatedFlush(bool hardFlush, bool blocking) {return false;} bool IsolatedMessageSeriesEnd(bool blocking) {m_messageCounts.push_back(0); return false;} lword MaxRetrievable() const {return m_lengths.front();} bool AnyRetrievable() const {return m_lengths.front() > 0;} size_t TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true); size_t CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) const; lword TotalBytesRetrievable() const {return m_queue.MaxRetrievable();} unsigned int NumberOfMessages() const {return (unsigned int)m_lengths.size()-1;} bool GetNextMessage(); unsigned int NumberOfMessagesInThisSeries() const {return m_messageCounts[0];} unsigned int NumberOfMessageSeries() const {return (unsigned int)m_messageCounts.size()-1;} unsigned int CopyMessagesTo(BufferedTransformation &target, unsigned int count=UINT_MAX, const std::string &channel=DEFAULT_CHANNEL) const; const byte * Spy(size_t &contiguousSize) const; void swap(MessageQueue &rhs); private: ByteQueue m_queue; std::deque m_lengths; std::deque m_messageCounts; }; //! A filter that checks messages on two channels for equality class CRYPTOPP_DLL EqualityComparisonFilter : public Unflushable > { public: struct MismatchDetected : public Exception {MismatchDetected() : Exception(DATA_INTEGRITY_CHECK_FAILED, "EqualityComparisonFilter: did not receive the same data on two channels") {}}; /*! if throwIfNotEqual is false, this filter will output a '\\0' byte when it detects a mismatch, '\\1' otherwise */ EqualityComparisonFilter(BufferedTransformation *attachment=NULL, bool throwIfNotEqual=true, const std::string &firstChannel="0", const std::string &secondChannel="1") : m_throwIfNotEqual(throwIfNotEqual), m_mismatchDetected(false) , m_firstChannel(firstChannel), m_secondChannel(secondChannel) {Detach(attachment);} size_t ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking); bool ChannelMessageSeriesEnd(const std::string &channel, int propagation=-1, bool blocking=true); private: unsigned int MapChannel(const std::string &channel) const; bool HandleMismatchDetected(bool blocking); bool m_throwIfNotEqual, m_mismatchDetected; std::string m_firstChannel, m_secondChannel; MessageQueue m_q[2]; }; NAMESPACE_END #ifndef __BORLANDC__ NAMESPACE_BEGIN(std) template<> inline void swap(CryptoPP::MessageQueue &a, CryptoPP::MessageQueue &b) { a.swap(b); } NAMESPACE_END #endif #endif armory-0.92.3/cppForSwig/cryptopp/elgamal.cpp0000755000000000000000000000051612414772654017706 0ustar rootroot// elgamal.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "elgamal.h" #include "asn.h" #include "nbtheory.h" NAMESPACE_BEGIN(CryptoPP) void ElGamal_TestInstantiations() { ElGamalEncryptor test1(1, 1, 1); ElGamalDecryptor test2(NullRNG(), 123); ElGamalEncryptor test3(test2); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/argnames.h0000755000000000000000000001043112414772654017543 0ustar rootroot#ifndef CRYPTOPP_ARGNAMES_H #define CRYPTOPP_ARGNAMES_H #include "cryptlib.h" NAMESPACE_BEGIN(CryptoPP) DOCUMENTED_NAMESPACE_BEGIN(Name) #define CRYPTOPP_DEFINE_NAME_STRING(name) inline const char *name() {return #name;} CRYPTOPP_DEFINE_NAME_STRING(ValueNames) //!< string, a list of value names with a semicolon (';') after each name CRYPTOPP_DEFINE_NAME_STRING(Version) //!< int CRYPTOPP_DEFINE_NAME_STRING(Seed) //!< ConstByteArrayParameter CRYPTOPP_DEFINE_NAME_STRING(Key) //!< ConstByteArrayParameter CRYPTOPP_DEFINE_NAME_STRING(IV) //!< ConstByteArrayParameter, also accepts const byte * for backwards compatibility CRYPTOPP_DEFINE_NAME_STRING(StolenIV) //!< byte * CRYPTOPP_DEFINE_NAME_STRING(Rounds) //!< int CRYPTOPP_DEFINE_NAME_STRING(FeedbackSize) //!< int CRYPTOPP_DEFINE_NAME_STRING(WordSize) //!< int, in bytes CRYPTOPP_DEFINE_NAME_STRING(BlockSize) //!< int, in bytes CRYPTOPP_DEFINE_NAME_STRING(EffectiveKeyLength) //!< int, in bits CRYPTOPP_DEFINE_NAME_STRING(KeySize) //!< int, in bits CRYPTOPP_DEFINE_NAME_STRING(ModulusSize) //!< int, in bits CRYPTOPP_DEFINE_NAME_STRING(SubgroupOrderSize) //!< int, in bits CRYPTOPP_DEFINE_NAME_STRING(PrivateExponentSize)//!< int, in bits CRYPTOPP_DEFINE_NAME_STRING(Modulus) //!< Integer CRYPTOPP_DEFINE_NAME_STRING(PublicExponent) //!< Integer CRYPTOPP_DEFINE_NAME_STRING(PrivateExponent) //!< Integer CRYPTOPP_DEFINE_NAME_STRING(PublicElement) //!< Integer CRYPTOPP_DEFINE_NAME_STRING(SubgroupOrder) //!< Integer CRYPTOPP_DEFINE_NAME_STRING(Cofactor) //!< Integer CRYPTOPP_DEFINE_NAME_STRING(SubgroupGenerator) //!< Integer, ECP::Point, or EC2N::Point CRYPTOPP_DEFINE_NAME_STRING(Curve) //!< ECP or EC2N CRYPTOPP_DEFINE_NAME_STRING(GroupOID) //!< OID CRYPTOPP_DEFINE_NAME_STRING(PointerToPrimeSelector) //!< const PrimeSelector * CRYPTOPP_DEFINE_NAME_STRING(Prime1) //!< Integer CRYPTOPP_DEFINE_NAME_STRING(Prime2) //!< Integer CRYPTOPP_DEFINE_NAME_STRING(ModPrime1PrivateExponent) //!< Integer CRYPTOPP_DEFINE_NAME_STRING(ModPrime2PrivateExponent) //!< Integer CRYPTOPP_DEFINE_NAME_STRING(MultiplicativeInverseOfPrime2ModPrime1) //!< Integer CRYPTOPP_DEFINE_NAME_STRING(QuadraticResidueModPrime1) //!< Integer CRYPTOPP_DEFINE_NAME_STRING(QuadraticResidueModPrime2) //!< Integer CRYPTOPP_DEFINE_NAME_STRING(PutMessage) //!< bool CRYPTOPP_DEFINE_NAME_STRING(TruncatedDigestSize) //!< int CRYPTOPP_DEFINE_NAME_STRING(BlockPaddingScheme) //!< StreamTransformationFilter::BlockPaddingScheme CRYPTOPP_DEFINE_NAME_STRING(HashVerificationFilterFlags) //!< word32 CRYPTOPP_DEFINE_NAME_STRING(AuthenticatedDecryptionFilterFlags) //!< word32 CRYPTOPP_DEFINE_NAME_STRING(SignatureVerificationFilterFlags) //!< word32 CRYPTOPP_DEFINE_NAME_STRING(InputBuffer) //!< ConstByteArrayParameter CRYPTOPP_DEFINE_NAME_STRING(OutputBuffer) //!< ByteArrayParameter CRYPTOPP_DEFINE_NAME_STRING(InputFileName) //!< const char * CRYPTOPP_DEFINE_NAME_STRING(InputFileNameWide) //!< const wchar_t * CRYPTOPP_DEFINE_NAME_STRING(InputStreamPointer) //!< std::istream * CRYPTOPP_DEFINE_NAME_STRING(InputBinaryMode) //!< bool CRYPTOPP_DEFINE_NAME_STRING(OutputFileName) //!< const char * CRYPTOPP_DEFINE_NAME_STRING(OutputFileNameWide) //!< const wchar_t * CRYPTOPP_DEFINE_NAME_STRING(OutputStreamPointer) //!< std::ostream * CRYPTOPP_DEFINE_NAME_STRING(OutputBinaryMode) //!< bool CRYPTOPP_DEFINE_NAME_STRING(EncodingParameters) //!< ConstByteArrayParameter CRYPTOPP_DEFINE_NAME_STRING(KeyDerivationParameters) //!< ConstByteArrayParameter CRYPTOPP_DEFINE_NAME_STRING(Separator) //< ConstByteArrayParameter CRYPTOPP_DEFINE_NAME_STRING(Terminator) //< ConstByteArrayParameter CRYPTOPP_DEFINE_NAME_STRING(Uppercase) //< bool CRYPTOPP_DEFINE_NAME_STRING(GroupSize) //< int CRYPTOPP_DEFINE_NAME_STRING(Pad) //< bool CRYPTOPP_DEFINE_NAME_STRING(PaddingByte) //< byte CRYPTOPP_DEFINE_NAME_STRING(Log2Base) //< int CRYPTOPP_DEFINE_NAME_STRING(EncodingLookupArray) //< const byte * CRYPTOPP_DEFINE_NAME_STRING(DecodingLookupArray) //< const byte * CRYPTOPP_DEFINE_NAME_STRING(InsertLineBreaks) //< bool CRYPTOPP_DEFINE_NAME_STRING(MaxLineLength) //< int CRYPTOPP_DEFINE_NAME_STRING(DigestSize) //!< int, in bytes CRYPTOPP_DEFINE_NAME_STRING(L1KeyLength) //!< int, in bytes CRYPTOPP_DEFINE_NAME_STRING(TableSize) //!< int, in bytes DOCUMENTED_NAMESPACE_END NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/ecp.cpp0000755000000000000000000002651112414772654017056 0ustar rootroot// ecp.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "ecp.h" #include "asn.h" #include "nbtheory.h" #include "algebra.cpp" NAMESPACE_BEGIN(CryptoPP) ANONYMOUS_NAMESPACE_BEGIN static inline ECP::Point ToMontgomery(const ModularArithmetic &mr, const ECP::Point &P) { return P.identity ? P : ECP::Point(mr.ConvertIn(P.x), mr.ConvertIn(P.y)); } static inline ECP::Point FromMontgomery(const ModularArithmetic &mr, const ECP::Point &P) { return P.identity ? P : ECP::Point(mr.ConvertOut(P.x), mr.ConvertOut(P.y)); } NAMESPACE_END ECP::ECP(const ECP &ecp, bool convertToMontgomeryRepresentation) { if (convertToMontgomeryRepresentation && !ecp.GetField().IsMontgomeryRepresentation()) { m_fieldPtr.reset(new MontgomeryRepresentation(ecp.GetField().GetModulus())); m_a = GetField().ConvertIn(ecp.m_a); m_b = GetField().ConvertIn(ecp.m_b); } else operator=(ecp); } ECP::ECP(BufferedTransformation &bt) : m_fieldPtr(new Field(bt)) { BERSequenceDecoder seq(bt); GetField().BERDecodeElement(seq, m_a); GetField().BERDecodeElement(seq, m_b); // skip optional seed if (!seq.EndReached()) { SecByteBlock seed; unsigned int unused; BERDecodeBitString(seq, seed, unused); } seq.MessageEnd(); } void ECP::DEREncode(BufferedTransformation &bt) const { GetField().DEREncode(bt); DERSequenceEncoder seq(bt); GetField().DEREncodeElement(seq, m_a); GetField().DEREncodeElement(seq, m_b); seq.MessageEnd(); } bool ECP::DecodePoint(ECP::Point &P, const byte *encodedPoint, size_t encodedPointLen) const { StringStore store(encodedPoint, encodedPointLen); return DecodePoint(P, store, encodedPointLen); } bool ECP::DecodePoint(ECP::Point &P, BufferedTransformation &bt, size_t encodedPointLen) const { byte type; if (encodedPointLen < 1 || !bt.Get(type)) return false; switch (type) { case 0: P.identity = true; return true; case 2: case 3: { if (encodedPointLen != EncodedPointSize(true)) return false; Integer p = FieldSize(); P.identity = false; P.x.Decode(bt, GetField().MaxElementByteLength()); P.y = ((P.x*P.x+m_a)*P.x+m_b) % p; if (Jacobi(P.y, p) !=1) return false; P.y = ModularSquareRoot(P.y, p); if ((type & 1) != P.y.GetBit(0)) P.y = p-P.y; return true; } case 4: { if (encodedPointLen != EncodedPointSize(false)) return false; unsigned int len = GetField().MaxElementByteLength(); P.identity = false; P.x.Decode(bt, len); P.y.Decode(bt, len); return true; } default: return false; } } void ECP::EncodePoint(BufferedTransformation &bt, const Point &P, bool compressed) const { if (P.identity) NullStore().TransferTo(bt, EncodedPointSize(compressed)); else if (compressed) { bt.Put(2 + P.y.GetBit(0)); P.x.Encode(bt, GetField().MaxElementByteLength()); } else { unsigned int len = GetField().MaxElementByteLength(); bt.Put(4); // uncompressed P.x.Encode(bt, len); P.y.Encode(bt, len); } } void ECP::EncodePoint(byte *encodedPoint, const Point &P, bool compressed) const { ArraySink sink(encodedPoint, EncodedPointSize(compressed)); EncodePoint(sink, P, compressed); assert(sink.TotalPutLength() == EncodedPointSize(compressed)); } ECP::Point ECP::BERDecodePoint(BufferedTransformation &bt) const { SecByteBlock str; BERDecodeOctetString(bt, str); Point P; if (!DecodePoint(P, str, str.size())) BERDecodeError(); return P; } void ECP::DEREncodePoint(BufferedTransformation &bt, const Point &P, bool compressed) const { SecByteBlock str(EncodedPointSize(compressed)); EncodePoint(str, P, compressed); DEREncodeOctetString(bt, str); } bool ECP::ValidateParameters(RandomNumberGenerator &rng, unsigned int level) const { Integer p = FieldSize(); bool pass = p.IsOdd(); pass = pass && !m_a.IsNegative() && m_a

= 1) pass = pass && ((4*m_a*m_a*m_a+27*m_b*m_b)%p).IsPositive(); if (level >= 2) pass = pass && VerifyPrime(rng, p); return pass; } bool ECP::VerifyPoint(const Point &P) const { const FieldElement &x = P.x, &y = P.y; Integer p = FieldSize(); return P.identity || (!x.IsNegative() && x

().Ref(); } const ECP::Point& ECP::Inverse(const Point &P) const { if (P.identity) return P; else { m_R.identity = false; m_R.x = P.x; m_R.y = GetField().Inverse(P.y); return m_R; } } const ECP::Point& ECP::Add(const Point &P, const Point &Q) const { if (P.identity) return Q; if (Q.identity) return P; if (GetField().Equal(P.x, Q.x)) return GetField().Equal(P.y, Q.y) ? Double(P) : Identity(); FieldElement t = GetField().Subtract(Q.y, P.y); t = GetField().Divide(t, GetField().Subtract(Q.x, P.x)); FieldElement x = GetField().Subtract(GetField().Subtract(GetField().Square(t), P.x), Q.x); m_R.y = GetField().Subtract(GetField().Multiply(t, GetField().Subtract(P.x, x)), P.y); m_R.x.swap(x); m_R.identity = false; return m_R; } const ECP::Point& ECP::Double(const Point &P) const { if (P.identity || P.y==GetField().Identity()) return Identity(); FieldElement t = GetField().Square(P.x); t = GetField().Add(GetField().Add(GetField().Double(t), t), m_a); t = GetField().Divide(t, GetField().Double(P.y)); FieldElement x = GetField().Subtract(GetField().Subtract(GetField().Square(t), P.x), P.x); m_R.y = GetField().Subtract(GetField().Multiply(t, GetField().Subtract(P.x, x)), P.y); m_R.x.swap(x); m_R.identity = false; return m_R; } template void ParallelInvert(const AbstractRing &ring, Iterator begin, Iterator end) { size_t n = end-begin; if (n == 1) *begin = ring.MultiplicativeInverse(*begin); else if (n > 1) { std::vector vec((n+1)/2); unsigned int i; Iterator it; for (i=0, it=begin; i::iterator it) : it(it) {} Integer& operator*() {return it->z;} int operator-(ZIterator it2) {return int(it-it2.it);} ZIterator operator+(int i) {return ZIterator(it+i);} ZIterator& operator+=(int i) {it+=i; return *this;} std::vector::iterator it; }; ECP::Point ECP::ScalarMultiply(const Point &P, const Integer &k) const { Element result; if (k.BitCount() <= 5) AbstractGroup::SimultaneousMultiply(&result, P, &k, 1); else ECP::SimultaneousMultiply(&result, P, &k, 1); return result; } void ECP::SimultaneousMultiply(ECP::Point *results, const ECP::Point &P, const Integer *expBegin, unsigned int expCount) const { if (!GetField().IsMontgomeryRepresentation()) { ECP ecpmr(*this, true); const ModularArithmetic &mr = ecpmr.GetField(); ecpmr.SimultaneousMultiply(results, ToMontgomery(mr, P), expBegin, expCount); for (unsigned int i=0; i bases; std::vector exponents; exponents.reserve(expCount); std::vector > baseIndices(expCount); std::vector > negateBase(expCount); std::vector > exponentWindows(expCount); unsigned int i; for (i=0; iNotNegative()); exponents.push_back(WindowSlider(*expBegin++, InversionIsFast(), 5)); exponents[i].FindNextWindow(); } unsigned int expBitPosition = 0; bool notDone = true; while (notDone) { notDone = false; bool baseAdded = false; for (i=0; i > finalCascade; for (i=0; i::CascadeScalarMultiply(P, k1, Q, k2); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/esign.cpp0000755000000000000000000001325512414772654017415 0ustar rootroot// esign.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "esign.h" #include "asn.h" #include "modarith.h" #include "nbtheory.h" #include "sha.h" #include "algparam.h" NAMESPACE_BEGIN(CryptoPP) void ESIGN_TestInstantiations() { ESIGN::Verifier x1(1, 1); ESIGN::Signer x2(NullRNG(), 1); ESIGN::Verifier x3(x2); ESIGN::Verifier x4(x2.GetKey()); ESIGN::Verifier x5(x3); ESIGN::Signer x6 = x2; x6 = x2; x3 = ESIGN::Verifier(x2); x4 = x2.GetKey(); } void ESIGNFunction::BERDecode(BufferedTransformation &bt) { BERSequenceDecoder seq(bt); m_n.BERDecode(seq); m_e.BERDecode(seq); seq.MessageEnd(); } void ESIGNFunction::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); m_n.DEREncode(seq); m_e.DEREncode(seq); seq.MessageEnd(); } Integer ESIGNFunction::ApplyFunction(const Integer &x) const { DoQuickSanityCheck(); return STDMIN(a_exp_b_mod_c(x, m_e, m_n) >> (2*GetK()+2), MaxImage()); } bool ESIGNFunction::Validate(RandomNumberGenerator &rng, unsigned int level) const { bool pass = true; pass = pass && m_n > Integer::One() && m_n.IsOdd(); pass = pass && m_e >= 8 && m_e < m_n; return pass; } bool ESIGNFunction::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue).Assignable() CRYPTOPP_GET_FUNCTION_ENTRY(Modulus) CRYPTOPP_GET_FUNCTION_ENTRY(PublicExponent) ; } void ESIGNFunction::AssignFrom(const NameValuePairs &source) { AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY(Modulus) CRYPTOPP_SET_FUNCTION_ENTRY(PublicExponent) ; } // ***************************************************************************** void InvertibleESIGNFunction::GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs ¶m) { int modulusSize = 1023*2; param.GetIntValue("ModulusSize", modulusSize) || param.GetIntValue("KeySize", modulusSize); if (modulusSize < 24) throw InvalidArgument("InvertibleESIGNFunction: specified modulus size is too small"); if (modulusSize % 3 != 0) throw InvalidArgument("InvertibleESIGNFunction: modulus size must be divisible by 3"); m_e = param.GetValueWithDefault("PublicExponent", Integer(32)); if (m_e < 8) throw InvalidArgument("InvertibleESIGNFunction: public exponents less than 8 may not be secure"); // VC70 workaround: putting these after primeParam causes overlapped stack allocation ConstByteArrayParameter seedParam; SecByteBlock seed; const Integer minP = Integer(204) << (modulusSize/3-8); const Integer maxP = Integer::Power2(modulusSize/3)-1; AlgorithmParameters primeParam = MakeParameters("Min", minP)("Max", maxP)("RandomNumberType", Integer::PRIME); if (param.GetValue("Seed", seedParam)) { seed.resize(seedParam.size() + 4); memcpy(seed + 4, seedParam.begin(), seedParam.size()); PutWord(false, BIG_ENDIAN_ORDER, seed, (word32)0); m_p.GenerateRandom(rng, CombinedNameValuePairs(primeParam, MakeParameters("Seed", ConstByteArrayParameter(seed)))); PutWord(false, BIG_ENDIAN_ORDER, seed, (word32)1); m_q.GenerateRandom(rng, CombinedNameValuePairs(primeParam, MakeParameters("Seed", ConstByteArrayParameter(seed)))); } else { m_p.GenerateRandom(rng, primeParam); m_q.GenerateRandom(rng, primeParam); } m_n = m_p * m_p * m_q; assert(m_n.BitCount() == modulusSize); } void InvertibleESIGNFunction::BERDecode(BufferedTransformation &bt) { BERSequenceDecoder privateKey(bt); m_n.BERDecode(privateKey); m_e.BERDecode(privateKey); m_p.BERDecode(privateKey); m_q.BERDecode(privateKey); privateKey.MessageEnd(); } void InvertibleESIGNFunction::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder privateKey(bt); m_n.DEREncode(privateKey); m_e.DEREncode(privateKey); m_p.DEREncode(privateKey); m_q.DEREncode(privateKey); privateKey.MessageEnd(); } Integer InvertibleESIGNFunction::CalculateRandomizedInverse(RandomNumberGenerator &rng, const Integer &x) const { DoQuickSanityCheck(); Integer pq = m_p * m_q; Integer p2 = m_p * m_p; Integer r, z, re, a, w0, w1; do { r.Randomize(rng, Integer::Zero(), pq); z = x << (2*GetK()+2); re = a_exp_b_mod_c(r, m_e, m_n); a = (z - re) % m_n; Integer::Divide(w1, w0, a, pq); if (w1.NotZero()) { ++w0; w1 = pq - w1; } } while ((w1 >> 2*GetK()+1).IsPositive()); ModularArithmetic modp(m_p); Integer t = modp.Divide(w0 * r % m_p, m_e * re % m_p); Integer s = r + t*pq; assert(s < m_n); /* using namespace std; cout << "f = " << x << endl; cout << "r = " << r << endl; cout << "z = " << z << endl; cout << "a = " << a << endl; cout << "w0 = " << w0 << endl; cout << "w1 = " << w1 << endl; cout << "t = " << t << endl; cout << "s = " << s << endl; */ return s; } bool InvertibleESIGNFunction::Validate(RandomNumberGenerator &rng, unsigned int level) const { bool pass = ESIGNFunction::Validate(rng, level); pass = pass && m_p > Integer::One() && m_p.IsOdd() && m_p < m_n; pass = pass && m_q > Integer::One() && m_q.IsOdd() && m_q < m_n; pass = pass && m_p.BitCount() == m_q.BitCount(); if (level >= 1) pass = pass && m_p * m_p * m_q == m_n; if (level >= 2) pass = pass && VerifyPrime(rng, m_p, level-2) && VerifyPrime(rng, m_q, level-2); return pass; } bool InvertibleESIGNFunction::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue).Assignable() CRYPTOPP_GET_FUNCTION_ENTRY(Prime1) CRYPTOPP_GET_FUNCTION_ENTRY(Prime2) ; } void InvertibleESIGNFunction::AssignFrom(const NameValuePairs &source) { AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY(Prime1) CRYPTOPP_SET_FUNCTION_ENTRY(Prime2) ; } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/algparam.h0000755000000000000000000003057212414772654017542 0ustar rootroot#ifndef CRYPTOPP_ALGPARAM_H #define CRYPTOPP_ALGPARAM_H #include "cryptlib.h" #include "smartptr.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! used to pass byte array input as part of a NameValuePairs object /*! the deepCopy option is used when the NameValuePairs object can't keep a copy of the data available */ class ConstByteArrayParameter { public: ConstByteArrayParameter(const char *data = NULL, bool deepCopy = false) { Assign((const byte *)data, data ? strlen(data) : 0, deepCopy); } ConstByteArrayParameter(const byte *data, size_t size, bool deepCopy = false) { Assign(data, size, deepCopy); } template ConstByteArrayParameter(const T &string, bool deepCopy = false) { CRYPTOPP_COMPILE_ASSERT(sizeof(CPP_TYPENAME T::value_type) == 1); Assign((const byte *)string.data(), string.size(), deepCopy); } void Assign(const byte *data, size_t size, bool deepCopy) { if (deepCopy) m_block.Assign(data, size); else { m_data = data; m_size = size; } m_deepCopy = deepCopy; } const byte *begin() const {return m_deepCopy ? m_block.begin() : m_data;} const byte *end() const {return m_deepCopy ? m_block.end() : m_data + m_size;} size_t size() const {return m_deepCopy ? m_block.size() : m_size;} private: bool m_deepCopy; const byte *m_data; size_t m_size; SecByteBlock m_block; }; class ByteArrayParameter { public: ByteArrayParameter(byte *data = NULL, unsigned int size = 0) : m_data(data), m_size(size) {} ByteArrayParameter(SecByteBlock &block) : m_data(block.begin()), m_size(block.size()) {} byte *begin() const {return m_data;} byte *end() const {return m_data + m_size;} size_t size() const {return m_size;} private: byte *m_data; size_t m_size; }; class CRYPTOPP_DLL CombinedNameValuePairs : public NameValuePairs { public: CombinedNameValuePairs(const NameValuePairs &pairs1, const NameValuePairs &pairs2) : m_pairs1(pairs1), m_pairs2(pairs2) {} bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; private: const NameValuePairs &m_pairs1, &m_pairs2; }; template class GetValueHelperClass { public: GetValueHelperClass(const T *pObject, const char *name, const std::type_info &valueType, void *pValue, const NameValuePairs *searchFirst) : m_pObject(pObject), m_name(name), m_valueType(&valueType), m_pValue(pValue), m_found(false), m_getValueNames(false) { if (strcmp(m_name, "ValueNames") == 0) { m_found = m_getValueNames = true; NameValuePairs::ThrowIfTypeMismatch(m_name, typeid(std::string), *m_valueType); if (searchFirst) searchFirst->GetVoidValue(m_name, valueType, pValue); if (typeid(T) != typeid(BASE)) pObject->BASE::GetVoidValue(m_name, valueType, pValue); ((*reinterpret_cast(m_pValue) += "ThisPointer:") += typeid(T).name()) += ';'; } if (!m_found && strncmp(m_name, "ThisPointer:", 12) == 0 && strcmp(m_name+12, typeid(T).name()) == 0) { NameValuePairs::ThrowIfTypeMismatch(m_name, typeid(T *), *m_valueType); *reinterpret_cast(pValue) = pObject; m_found = true; return; } if (!m_found && searchFirst) m_found = searchFirst->GetVoidValue(m_name, valueType, pValue); if (!m_found && typeid(T) != typeid(BASE)) m_found = pObject->BASE::GetVoidValue(m_name, valueType, pValue); } operator bool() const {return m_found;} template GetValueHelperClass & operator()(const char *name, const R & (T::*pm)() const) { if (m_getValueNames) (*reinterpret_cast(m_pValue) += name) += ";"; if (!m_found && strcmp(name, m_name) == 0) { NameValuePairs::ThrowIfTypeMismatch(name, typeid(R), *m_valueType); *reinterpret_cast(m_pValue) = (m_pObject->*pm)(); m_found = true; } return *this; } GetValueHelperClass &Assignable() { #ifndef __INTEL_COMPILER // ICL 9.1 workaround: Intel compiler copies the vTable pointer for some reason if (m_getValueNames) ((*reinterpret_cast(m_pValue) += "ThisObject:") += typeid(T).name()) += ';'; if (!m_found && strncmp(m_name, "ThisObject:", 11) == 0 && strcmp(m_name+11, typeid(T).name()) == 0) { NameValuePairs::ThrowIfTypeMismatch(m_name, typeid(T), *m_valueType); *reinterpret_cast(m_pValue) = *m_pObject; m_found = true; } #endif return *this; } private: const T *m_pObject; const char *m_name; const std::type_info *m_valueType; void *m_pValue; bool m_found, m_getValueNames; }; template GetValueHelperClass GetValueHelper(const T *pObject, const char *name, const std::type_info &valueType, void *pValue, const NameValuePairs *searchFirst=NULL, BASE *dummy=NULL) { return GetValueHelperClass(pObject, name, valueType, pValue, searchFirst); } template GetValueHelperClass GetValueHelper(const T *pObject, const char *name, const std::type_info &valueType, void *pValue, const NameValuePairs *searchFirst=NULL) { return GetValueHelperClass(pObject, name, valueType, pValue, searchFirst); } // ******************************************************** template R Hack_DefaultValueFromConstReferenceType(const R &) { return R(); } template bool Hack_GetValueIntoConstReference(const NameValuePairs &source, const char *name, const R &value) { return source.GetValue(name, const_cast(value)); } template class AssignFromHelperClass { public: AssignFromHelperClass(T *pObject, const NameValuePairs &source) : m_pObject(pObject), m_source(source), m_done(false) { if (source.GetThisObject(*pObject)) m_done = true; else if (typeid(BASE) != typeid(T)) pObject->BASE::AssignFrom(source); } template AssignFromHelperClass & operator()(const char *name, void (T::*pm)(R)) // VC60 workaround: "const R &" here causes compiler error { if (!m_done) { R value = Hack_DefaultValueFromConstReferenceType(reinterpret_cast(*(int *)NULL)); if (!Hack_GetValueIntoConstReference(m_source, name, value)) throw InvalidArgument(std::string(typeid(T).name()) + ": Missing required parameter '" + name + "'"); (m_pObject->*pm)(value); } return *this; } template AssignFromHelperClass & operator()(const char *name1, const char *name2, void (T::*pm)(R, S)) // VC60 workaround: "const R &" here causes compiler error { if (!m_done) { R value1 = Hack_DefaultValueFromConstReferenceType(reinterpret_cast(*(int *)NULL)); if (!Hack_GetValueIntoConstReference(m_source, name1, value1)) throw InvalidArgument(std::string(typeid(T).name()) + ": Missing required parameter '" + name1 + "'"); S value2 = Hack_DefaultValueFromConstReferenceType(reinterpret_cast(*(int *)NULL)); if (!Hack_GetValueIntoConstReference(m_source, name2, value2)) throw InvalidArgument(std::string(typeid(T).name()) + ": Missing required parameter '" + name2 + "'"); (m_pObject->*pm)(value1, value2); } return *this; } private: T *m_pObject; const NameValuePairs &m_source; bool m_done; }; template AssignFromHelperClass AssignFromHelper(T *pObject, const NameValuePairs &source, BASE *dummy=NULL) { return AssignFromHelperClass(pObject, source); } template AssignFromHelperClass AssignFromHelper(T *pObject, const NameValuePairs &source) { return AssignFromHelperClass(pObject, source); } // ******************************************************** // to allow the linker to discard Integer code if not needed. typedef bool (CRYPTOPP_API * PAssignIntToInteger)(const std::type_info &valueType, void *pInteger, const void *pInt); CRYPTOPP_DLL extern PAssignIntToInteger g_pAssignIntToInteger; CRYPTOPP_DLL const std::type_info & CRYPTOPP_API IntegerTypeId(); class CRYPTOPP_DLL AlgorithmParametersBase { public: class ParameterNotUsed : public Exception { public: ParameterNotUsed(const char *name) : Exception(OTHER_ERROR, std::string("AlgorithmParametersBase: parameter \"") + name + "\" not used") {} }; // this is actually a move, not a copy AlgorithmParametersBase(const AlgorithmParametersBase &x) : m_name(x.m_name), m_throwIfNotUsed(x.m_throwIfNotUsed), m_used(x.m_used) { m_next.reset(const_cast(x).m_next.release()); x.m_used = true; } AlgorithmParametersBase(const char *name, bool throwIfNotUsed) : m_name(name), m_throwIfNotUsed(throwIfNotUsed), m_used(false) {} virtual ~AlgorithmParametersBase() { #ifdef CRYPTOPP_UNCAUGHT_EXCEPTION_AVAILABLE if (!std::uncaught_exception()) #else try #endif { if (m_throwIfNotUsed && !m_used) throw ParameterNotUsed(m_name); } #ifndef CRYPTOPP_UNCAUGHT_EXCEPTION_AVAILABLE catch(...) { } #endif } bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; protected: friend class AlgorithmParameters; void operator=(const AlgorithmParametersBase& rhs); // assignment not allowed, declare this for VC60 virtual void AssignValue(const char *name, const std::type_info &valueType, void *pValue) const =0; virtual void MoveInto(void *p) const =0; // not really const const char *m_name; bool m_throwIfNotUsed; mutable bool m_used; member_ptr m_next; }; template class AlgorithmParametersTemplate : public AlgorithmParametersBase { public: AlgorithmParametersTemplate(const char *name, const T &value, bool throwIfNotUsed) : AlgorithmParametersBase(name, throwIfNotUsed), m_value(value) { } void AssignValue(const char *name, const std::type_info &valueType, void *pValue) const { // special case for retrieving an Integer parameter when an int was passed in if (!(g_pAssignIntToInteger != NULL && typeid(T) == typeid(int) && g_pAssignIntToInteger(valueType, pValue, &m_value))) { NameValuePairs::ThrowIfTypeMismatch(name, typeid(T), valueType); *reinterpret_cast(pValue) = m_value; } } void MoveInto(void *buffer) const { AlgorithmParametersTemplate* p = new(buffer) AlgorithmParametersTemplate(*this); } protected: T m_value; }; CRYPTOPP_DLL_TEMPLATE_CLASS AlgorithmParametersTemplate; CRYPTOPP_DLL_TEMPLATE_CLASS AlgorithmParametersTemplate; CRYPTOPP_DLL_TEMPLATE_CLASS AlgorithmParametersTemplate; class CRYPTOPP_DLL AlgorithmParameters : public NameValuePairs { public: AlgorithmParameters(); #ifdef __BORLANDC__ template AlgorithmParameters(const char *name, const T &value, bool throwIfNotUsed=true) : m_next(new AlgorithmParametersTemplate(name, value, throwIfNotUsed)) , m_defaultThrowIfNotUsed(throwIfNotUsed) { } #endif AlgorithmParameters(const AlgorithmParameters &x); AlgorithmParameters & operator=(const AlgorithmParameters &x); template AlgorithmParameters & operator()(const char *name, const T &value, bool throwIfNotUsed) { member_ptr p(new AlgorithmParametersTemplate(name, value, throwIfNotUsed)); p->m_next.reset(m_next.release()); m_next.reset(p.release()); m_defaultThrowIfNotUsed = throwIfNotUsed; return *this; } template AlgorithmParameters & operator()(const char *name, const T &value) { return operator()(name, value, m_defaultThrowIfNotUsed); } bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; protected: member_ptr m_next; bool m_defaultThrowIfNotUsed; }; //! Create an object that implements NameValuePairs for passing parameters /*! \param throwIfNotUsed if true, the object will throw an exception if the value is not accessed \note throwIfNotUsed is ignored if using a compiler that does not support std::uncaught_exception(), such as MSVC 7.0 and earlier. \note A NameValuePairs object containing an arbitrary number of name value pairs may be constructed by repeatedly using operator() on the object returned by MakeParameters, for example: AlgorithmParameters parameters = MakeParameters(name1, value1)(name2, value2)(name3, value3); */ #ifdef __BORLANDC__ typedef AlgorithmParameters MakeParameters; #else template AlgorithmParameters MakeParameters(const char *name, const T &value, bool throwIfNotUsed = true) { return AlgorithmParameters()(name, value, throwIfNotUsed); } #endif #define CRYPTOPP_GET_FUNCTION_ENTRY(name) (Name::name(), &ThisClass::Get##name) #define CRYPTOPP_SET_FUNCTION_ENTRY(name) (Name::name(), &ThisClass::Set##name) #define CRYPTOPP_SET_FUNCTION_ENTRY2(name1, name2) (Name::name1(), Name::name2(), &ThisClass::Set##name1##And##name2) NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/blumshub.cpp0000755000000000000000000000253012414772654020123 0ustar rootroot// blumshub.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "blumshub.h" NAMESPACE_BEGIN(CryptoPP) PublicBlumBlumShub::PublicBlumBlumShub(const Integer &n, const Integer &seed) : modn(n), maxBits(BitPrecision(n.BitCount())-1) { current = modn.Square(modn.Square(seed)); bitsLeft = maxBits; } unsigned int PublicBlumBlumShub::GenerateBit() { if (bitsLeft==0) { current = modn.Square(current); bitsLeft = maxBits; } return current.GetBit(--bitsLeft); } byte PublicBlumBlumShub::GenerateByte() { byte b=0; for (int i=0; i<8; i++) b = (b << 1) | PublicBlumBlumShub::GenerateBit(); return b; } void PublicBlumBlumShub::GenerateBlock(byte *output, size_t size) { while (size--) *output++ = PublicBlumBlumShub::GenerateByte(); } void PublicBlumBlumShub::ProcessData(byte *outString, const byte *inString, size_t length) { while (length--) *outString++ = *inString++ ^ PublicBlumBlumShub::GenerateByte(); } BlumBlumShub::BlumBlumShub(const Integer &p, const Integer &q, const Integer &seed) : PublicBlumBlumShub(p*q, seed), p(p), q(q), x0(modn.Square(seed)) { } void BlumBlumShub::Seek(lword index) { Integer i(Integer::POSITIVE, index); i *= 8; Integer e = a_exp_b_mod_c (2, i / maxBits + 1, (p-1)*(q-1)); current = modn.Exponentiate(x0, e); bitsLeft = maxBits - i % maxBits; } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/config.h0000755000000000000000000003636412414772654017230 0ustar rootroot#ifndef CRYPTOPP_CONFIG_H #define CRYPTOPP_CONFIG_H // ***************** Important Settings ******************** // define this if running on a big-endian CPU #if !defined(IS_LITTLE_ENDIAN) && (defined(__BIG_ENDIAN__) || defined(__sparc) || defined(__sparc__) || defined(__hppa__) || defined(__MIPSEB__) || defined(__ARMEB__) || (defined(__MWERKS__) && !defined(__INTEL__))) # define IS_BIG_ENDIAN #endif // define this if running on a little-endian CPU // big endian will be assumed if IS_LITTLE_ENDIAN is not defined #ifndef IS_BIG_ENDIAN # define IS_LITTLE_ENDIAN #endif // define this if you want to disable all OS-dependent features, // such as sockets and OS-provided random number generators // #define NO_OS_DEPENDENCE // Define this to use features provided by Microsoft's CryptoAPI. // Currently the only feature used is random number generation. // This macro will be ignored if NO_OS_DEPENDENCE is defined. #define USE_MS_CRYPTOAPI // Define this to 1 to enforce the requirement in FIPS 186-2 Change Notice 1 that only 1024 bit moduli be used #ifndef DSA_1024_BIT_MODULUS_ONLY # define DSA_1024_BIT_MODULUS_ONLY 1 #endif // ***************** Less Important Settings *************** // define this to retain (as much as possible) old deprecated function and class names // #define CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY #define GZIP_OS_CODE 0 // Try this if your CPU has 256K internal cache or a slow multiply instruction // and you want a (possibly) faster IDEA implementation using log tables // #define IDEA_LARGECACHE // Define this if, for the linear congruential RNG, you want to use // the original constants as specified in S.K. Park and K.W. Miller's // CACM paper. // #define LCRNG_ORIGINAL_NUMBERS // choose which style of sockets to wrap (mostly useful for cygwin which has both) #define PREFER_BERKELEY_STYLE_SOCKETS // #define PREFER_WINDOWS_STYLE_SOCKETS // set the name of Rijndael cipher, was "Rijndael" before version 5.3 #define CRYPTOPP_RIJNDAEL_NAME "AES" // ***************** Important Settings Again ******************** // But the defaults should be ok. // namespace support is now required #ifdef NO_NAMESPACE # error namespace support is now required #endif // Define this to workaround a Microsoft CryptoAPI bug where // each call to CryptAcquireContext causes a 100 KB memory leak. // Defining this will cause Crypto++ to make only one call to CryptAcquireContext. #define WORKAROUND_MS_BUG_Q258000 #ifdef CRYPTOPP_DOXYGEN_PROCESSING // Avoid putting "CryptoPP::" in front of everything in Doxygen output # define CryptoPP # define NAMESPACE_BEGIN(x) # define NAMESPACE_END // Get Doxygen to generate better documentation for these typedefs # define DOCUMENTED_TYPEDEF(x, y) class y : public x {}; #else # define NAMESPACE_BEGIN(x) namespace x { # define NAMESPACE_END } # define DOCUMENTED_TYPEDEF(x, y) typedef x y; #endif #define ANONYMOUS_NAMESPACE_BEGIN namespace { #define USING_NAMESPACE(x) using namespace x; #define DOCUMENTED_NAMESPACE_BEGIN(x) namespace x { #define DOCUMENTED_NAMESPACE_END } // What is the type of the third parameter to bind? // For Unix, the new standard is ::socklen_t (typically unsigned int), and the old standard is int. // Unfortunately there is no way to tell whether or not socklen_t is defined. // To work around this, TYPE_OF_SOCKLEN_T is a macro so that you can change it from the makefile. #ifndef TYPE_OF_SOCKLEN_T # if defined(_WIN32) || defined(__CYGWIN__) # define TYPE_OF_SOCKLEN_T int # else # define TYPE_OF_SOCKLEN_T ::socklen_t # endif #endif #if defined(__CYGWIN__) && defined(PREFER_WINDOWS_STYLE_SOCKETS) # define __USE_W32_SOCKETS #endif typedef unsigned char byte; // put in global namespace to avoid ambiguity with other byte typedefs NAMESPACE_BEGIN(CryptoPP) typedef unsigned short word16; typedef unsigned int word32; #if defined(_MSC_VER) || defined(__BORLANDC__) typedef unsigned __int64 word64; #define W64LIT(x) x##ui64 #else typedef unsigned long long word64; #define W64LIT(x) x##ULL #endif // define large word type, used for file offsets and such typedef word64 lword; const lword LWORD_MAX = W64LIT(0xffffffffffffffff); #ifdef __GNUC__ #define CRYPTOPP_GCC_VERSION (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__) #endif // define hword, word, and dword. these are used for multiprecision integer arithmetic // Intel compiler won't have _umul128 until version 10.0. See http://softwarecommunity.intel.com/isn/Community/en-US/forums/thread/30231625.aspx #if (defined(_MSC_VER) && (!defined(__INTEL_COMPILER) || __INTEL_COMPILER >= 1000) && (defined(_M_X64) || defined(_M_IA64))) || (defined(__DECCXX) && defined(__alpha__)) || (defined(__INTEL_COMPILER) && defined(__x86_64__)) || (defined(__SUNPRO_CC) && defined(__x86_64__)) typedef word32 hword; typedef word64 word; #else #define CRYPTOPP_NATIVE_DWORD_AVAILABLE #if defined(__alpha__) || defined(__ia64__) || defined(_ARCH_PPC64) || defined(__x86_64__) || defined(__mips64) || defined(__sparc64__) #if defined(__GNUC__) && !defined(__INTEL_COMPILER) && !(CRYPTOPP_GCC_VERSION == 40001 && defined(__APPLE__)) && CRYPTOPP_GCC_VERSION >= 30400 // GCC 4.0.1 on MacOS X is missing __umodti3 and __udivti3 // mode(TI) division broken on amd64 with GCC earlier than GCC 3.4 typedef word32 hword; typedef word64 word; typedef __uint128_t dword; typedef __uint128_t word128; #define CRYPTOPP_WORD128_AVAILABLE #else // if we're here, it means we're on a 64-bit CPU but we don't have a way to obtain 128-bit multiplication results typedef word16 hword; typedef word32 word; typedef word64 dword; #endif #else // being here means the native register size is probably 32 bits or less #define CRYPTOPP_BOOL_SLOW_WORD64 1 typedef word16 hword; typedef word32 word; typedef word64 dword; #endif #endif #ifndef CRYPTOPP_BOOL_SLOW_WORD64 #define CRYPTOPP_BOOL_SLOW_WORD64 0 #endif const unsigned int WORD_SIZE = sizeof(word); const unsigned int WORD_BITS = WORD_SIZE * 8; NAMESPACE_END #ifndef CRYPTOPP_L1_CACHE_LINE_SIZE // This should be a lower bound on the L1 cache line size. It's used for defense against timing attacks. #if defined(_M_X64) || defined(__x86_64__) #define CRYPTOPP_L1_CACHE_LINE_SIZE 64 #else // L1 cache line size is 32 on Pentium III and earlier #define CRYPTOPP_L1_CACHE_LINE_SIZE 32 #endif #endif #if defined(_MSC_VER) #if _MSC_VER == 1200 #include #endif #if _MSC_VER > 1200 || defined(_mm_free) #define CRYPTOPP_MSVC6PP_OR_LATER // VC 6 processor pack or later #else #define CRYPTOPP_MSVC6_NO_PP // VC 6 without processor pack #endif #endif #ifndef CRYPTOPP_ALIGN_DATA #if defined(CRYPTOPP_MSVC6PP_OR_LATER) #define CRYPTOPP_ALIGN_DATA(x) __declspec(align(x)) #elif defined(__GNUC__) #define CRYPTOPP_ALIGN_DATA(x) __attribute__((aligned(x))) #else #define CRYPTOPP_ALIGN_DATA(x) #endif #endif #ifndef CRYPTOPP_SECTION_ALIGN16 #if defined(__GNUC__) && !defined(__APPLE__) // the alignment attribute doesn't seem to work without this section attribute when -fdata-sections is turned on #define CRYPTOPP_SECTION_ALIGN16 __attribute__((section ("CryptoPP_Align16"))) #else #define CRYPTOPP_SECTION_ALIGN16 #endif #endif #if defined(_MSC_VER) || defined(__fastcall) #define CRYPTOPP_FASTCALL __fastcall #else #define CRYPTOPP_FASTCALL #endif // VC60 workaround: it doesn't allow typename in some places #if defined(_MSC_VER) && (_MSC_VER < 1300) #define CPP_TYPENAME #else #define CPP_TYPENAME typename #endif // VC60 workaround: can't cast unsigned __int64 to float or double #if defined(_MSC_VER) && !defined(CRYPTOPP_MSVC6PP_OR_LATER) #define CRYPTOPP_VC6_INT64 (__int64) #else #define CRYPTOPP_VC6_INT64 #endif #ifdef _MSC_VER #define CRYPTOPP_NO_VTABLE __declspec(novtable) #else #define CRYPTOPP_NO_VTABLE #endif #ifdef _MSC_VER // 4231: nonstandard extension used : 'extern' before template explicit instantiation // 4250: dominance // 4251: member needs to have dll-interface // 4275: base needs to have dll-interface // 4660: explicitly instantiating a class that's already implicitly instantiated // 4661: no suitable definition provided for explicit template instantiation request // 4786: identifer was truncated in debug information // 4355: 'this' : used in base member initializer list // 4910: '__declspec(dllexport)' and 'extern' are incompatible on an explicit instantiation # pragma warning(disable: 4231 4250 4251 4275 4660 4661 4786 4355 4910) #endif #ifdef __BORLANDC__ // 8037: non-const function called for const object. needed to work around BCB2006 bug # pragma warn -8037 #endif #if (defined(_MSC_VER) && _MSC_VER <= 1300) || defined(__MWERKS__) || defined(_STLPORT_VERSION) #define CRYPTOPP_DISABLE_UNCAUGHT_EXCEPTION #endif #ifndef CRYPTOPP_DISABLE_UNCAUGHT_EXCEPTION #define CRYPTOPP_UNCAUGHT_EXCEPTION_AVAILABLE #endif #ifdef CRYPTOPP_DISABLE_X86ASM // for backwards compatibility: this macro had both meanings #define CRYPTOPP_DISABLE_ASM #define CRYPTOPP_DISABLE_SSE2 #endif #if !defined(CRYPTOPP_DISABLE_ASM) && ((defined(_MSC_VER) && defined(_M_IX86)) || (defined(__GNUC__) && (defined(__i386__) || defined(__x86_64__)))) // C++Builder 2010 does not allow "call label" where label is defined within inline assembly #define CRYPTOPP_X86_ASM_AVAILABLE #if !defined(CRYPTOPP_DISABLE_SSE2) && (defined(CRYPTOPP_MSVC6PP_OR_LATER) || CRYPTOPP_GCC_VERSION >= 30300) #define CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE 1 #else #define CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE 0 #endif // SSSE3 was actually introduced in GNU as 2.17, which was released 6/23/2006, but we can't tell what version of binutils is installed. // GCC 4.1.2 was released on 2/13/2007, so we'll use that as a proxy for the binutils version. #if !defined(CRYPTOPP_DISABLE_SSSE3) && (_MSC_VER >= 1400 || CRYPTOPP_GCC_VERSION >= 40102) #define CRYPTOPP_BOOL_SSSE3_ASM_AVAILABLE 1 #else #define CRYPTOPP_BOOL_SSSE3_ASM_AVAILABLE 0 #endif #endif #if !defined(CRYPTOPP_DISABLE_ASM) && defined(_MSC_VER) && defined(_M_X64) #define CRYPTOPP_X64_MASM_AVAILABLE #endif #if !defined(CRYPTOPP_DISABLE_ASM) && defined(__GNUC__) && defined(__x86_64__) #define CRYPTOPP_X64_ASM_AVAILABLE #endif #if !defined(CRYPTOPP_DISABLE_SSE2) && (defined(CRYPTOPP_MSVC6PP_OR_LATER) || defined(__SSE2__)) #define CRYPTOPP_BOOL_SSE2_INTRINSICS_AVAILABLE 1 #else #define CRYPTOPP_BOOL_SSE2_INTRINSICS_AVAILABLE 0 #endif #if !defined(CRYPTOPP_DISABLE_SSSE3) && !defined(CRYPTOPP_DISABLE_AESNI) && CRYPTOPP_BOOL_SSE2_INTRINSICS_AVAILABLE && (CRYPTOPP_GCC_VERSION >= 40400 || _MSC_FULL_VER >= 150030729 || __INTEL_COMPILER >= 1110) #define CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE 1 #else #define CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE 0 #endif #if CRYPTOPP_BOOL_SSE2_INTRINSICS_AVAILABLE || CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE || defined(CRYPTOPP_X64_MASM_AVAILABLE) #define CRYPTOPP_BOOL_ALIGN16_ENABLED 1 #else #define CRYPTOPP_BOOL_ALIGN16_ENABLED 0 #endif // how to allocate 16-byte aligned memory (for SSE2) #if defined(CRYPTOPP_MSVC6PP_OR_LATER) #define CRYPTOPP_MM_MALLOC_AVAILABLE #elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) #define CRYPTOPP_MALLOC_ALIGNMENT_IS_16 #elif defined(__linux__) || defined(__sun__) || defined(__CYGWIN__) #define CRYPTOPP_MEMALIGN_AVAILABLE #else #define CRYPTOPP_NO_ALIGNED_ALLOC #endif // how to disable inlining #if defined(_MSC_VER) && _MSC_VER >= 1300 # define CRYPTOPP_NOINLINE_DOTDOTDOT # define CRYPTOPP_NOINLINE __declspec(noinline) #elif defined(__GNUC__) # define CRYPTOPP_NOINLINE_DOTDOTDOT # define CRYPTOPP_NOINLINE __attribute__((noinline)) #else # define CRYPTOPP_NOINLINE_DOTDOTDOT ... # define CRYPTOPP_NOINLINE #endif // how to declare class constants #if (defined(_MSC_VER) && _MSC_VER <= 1300) || defined(__INTEL_COMPILER) # define CRYPTOPP_CONSTANT(x) enum {x}; #else # define CRYPTOPP_CONSTANT(x) static const int x; #endif #if defined(_M_X64) || defined(__x86_64__) #define CRYPTOPP_BOOL_X64 1 #else #define CRYPTOPP_BOOL_X64 0 #endif // see http://predef.sourceforge.net/prearch.html #if defined(_M_IX86) || defined(__i386__) || defined(__i386) || defined(_X86_) || defined(__I86__) || defined(__INTEL__) #define CRYPTOPP_BOOL_X86 1 #else #define CRYPTOPP_BOOL_X86 0 #endif #if CRYPTOPP_BOOL_X64 || CRYPTOPP_BOOL_X86 || defined(__powerpc__) #define CRYPTOPP_ALLOW_UNALIGNED_DATA_ACCESS #endif #define CRYPTOPP_VERSION 561 // ***************** determine availability of OS features ******************** #ifndef NO_OS_DEPENDENCE #if defined(_WIN32) || defined(__CYGWIN__) #define CRYPTOPP_WIN32_AVAILABLE #endif #if defined(__unix__) || defined(__MACH__) || defined(__NetBSD__) || defined(__sun) #define CRYPTOPP_UNIX_AVAILABLE #endif #if defined(CRYPTOPP_WIN32_AVAILABLE) || defined(CRYPTOPP_UNIX_AVAILABLE) # define HIGHRES_TIMER_AVAILABLE #endif #ifdef CRYPTOPP_UNIX_AVAILABLE # define HAS_BERKELEY_STYLE_SOCKETS #endif #ifdef CRYPTOPP_WIN32_AVAILABLE # define HAS_WINDOWS_STYLE_SOCKETS #endif #if defined(HIGHRES_TIMER_AVAILABLE) && (defined(HAS_BERKELEY_STYLE_SOCKETS) || defined(HAS_WINDOWS_STYLE_SOCKETS)) # define SOCKETS_AVAILABLE #endif #if defined(HAS_WINDOWS_STYLE_SOCKETS) && (!defined(HAS_BERKELEY_STYLE_SOCKETS) || defined(PREFER_WINDOWS_STYLE_SOCKETS)) # define USE_WINDOWS_STYLE_SOCKETS #else # define USE_BERKELEY_STYLE_SOCKETS #endif #if defined(HIGHRES_TIMER_AVAILABLE) && defined(CRYPTOPP_WIN32_AVAILABLE) && !defined(USE_BERKELEY_STYLE_SOCKETS) # define WINDOWS_PIPES_AVAILABLE #endif #if defined(CRYPTOPP_WIN32_AVAILABLE) && defined(USE_MS_CRYPTOAPI) # define NONBLOCKING_RNG_AVAILABLE # define OS_RNG_AVAILABLE #endif #if defined(CRYPTOPP_UNIX_AVAILABLE) || defined(CRYPTOPP_DOXYGEN_PROCESSING) # define NONBLOCKING_RNG_AVAILABLE # define BLOCKING_RNG_AVAILABLE # define OS_RNG_AVAILABLE # define HAS_PTHREADS # define THREADS_AVAILABLE #endif #ifdef CRYPTOPP_WIN32_AVAILABLE # define HAS_WINTHREADS # define THREADS_AVAILABLE #endif #endif // NO_OS_DEPENDENCE // ***************** DLL related ******************** #if defined(CRYPTOPP_WIN32_AVAILABLE) && !defined(CRYPTOPP_DOXYGEN_PROCESSING) #ifdef CRYPTOPP_EXPORTS #define CRYPTOPP_IS_DLL #define CRYPTOPP_DLL __declspec(dllexport) #elif defined(CRYPTOPP_IMPORTS) #define CRYPTOPP_IS_DLL #define CRYPTOPP_DLL __declspec(dllimport) #else #define CRYPTOPP_DLL #endif #define CRYPTOPP_API __cdecl #else // CRYPTOPP_WIN32_AVAILABLE #define CRYPTOPP_DLL #define CRYPTOPP_API #endif // CRYPTOPP_WIN32_AVAILABLE #if defined(__MWERKS__) #define CRYPTOPP_EXTERN_DLL_TEMPLATE_CLASS extern class CRYPTOPP_DLL #elif defined(__BORLANDC__) || defined(__SUNPRO_CC) #define CRYPTOPP_EXTERN_DLL_TEMPLATE_CLASS template class CRYPTOPP_DLL #else #define CRYPTOPP_EXTERN_DLL_TEMPLATE_CLASS extern template class CRYPTOPP_DLL #endif #if defined(CRYPTOPP_MANUALLY_INSTANTIATE_TEMPLATES) && !defined(CRYPTOPP_IMPORTS) #define CRYPTOPP_DLL_TEMPLATE_CLASS template class CRYPTOPP_DLL #else #define CRYPTOPP_DLL_TEMPLATE_CLASS CRYPTOPP_EXTERN_DLL_TEMPLATE_CLASS #endif #if defined(__MWERKS__) #define CRYPTOPP_EXTERN_STATIC_TEMPLATE_CLASS extern class #elif defined(__BORLANDC__) || defined(__SUNPRO_CC) #define CRYPTOPP_EXTERN_STATIC_TEMPLATE_CLASS template class #else #define CRYPTOPP_EXTERN_STATIC_TEMPLATE_CLASS extern template class #endif #if defined(CRYPTOPP_MANUALLY_INSTANTIATE_TEMPLATES) && !defined(CRYPTOPP_EXPORTS) #define CRYPTOPP_STATIC_TEMPLATE_CLASS template class #else #define CRYPTOPP_STATIC_TEMPLATE_CLASS CRYPTOPP_EXTERN_STATIC_TEMPLATE_CLASS #endif #endif armory-0.92.3/cppForSwig/cryptopp/sosemanuk.cpp0000755000000000000000000005605512414772654020322 0ustar rootroot// sosemanuk.cpp - written and placed in the public domain by Wei Dai // use "cl /EP /P /DCRYPTOPP_GENERATE_X64_MASM sosemanuk.cpp" to generate MASM code #include "pch.h" #ifndef CRYPTOPP_GENERATE_X64_MASM #include "sosemanuk.h" #include "misc.h" #include "cpu.h" #include "serpentp.h" NAMESPACE_BEGIN(CryptoPP) void SosemanukPolicy::CipherSetKey(const NameValuePairs ¶ms, const byte *userKey, size_t keylen) { Serpent_KeySchedule(m_key, 24, userKey, keylen); } void SosemanukPolicy::CipherResynchronize(byte *keystreamBuffer, const byte *iv, size_t length) { assert(length==16); word32 a, b, c, d, e; typedef BlockGetAndPut Block; Block::Get(iv)(a)(b)(c)(d); const word32 *k = m_key; unsigned int i=1; do { beforeS0(KX); beforeS0(S0); afterS0(LT); afterS0(KX); afterS0(S1); afterS1(LT); if (i == 3) // after 18th round { m_state[4] = b; m_state[5] = e; m_state[10] = c; m_state[11] = a; } afterS1(KX); afterS1(S2); afterS2(LT); afterS2(KX); afterS2(S3); afterS3(LT); if (i == 2) // after 12th round { m_state[6] = c; m_state[7] = d; m_state[8] = b; m_state[9] = e; } afterS3(KX); afterS3(S4); afterS4(LT); afterS4(KX); afterS4(S5); afterS5(LT); afterS5(KX); afterS5(S6); afterS6(LT); afterS6(KX); afterS6(S7); afterS7(LT); if (i == 3) break; ++i; c = b; b = e; e = d; d = a; a = e; k += 32; } while (true); afterS7(KX); m_state[0] = a; m_state[1] = b; m_state[2] = e; m_state[3] = d; #define XMUX(c, x, y) (x ^ (y & (0 - (c & 1)))) m_state[11] += XMUX(m_state[10], m_state[1], m_state[8]); m_state[10] = rotlFixed(m_state[10] * 0x54655307, 7); } extern "C" { word32 s_sosemanukMulTables[512] = { #if CRYPTOPP_BOOL_X86 | CRYPTOPP_BOOL_X64 0x00000000, 0xE19FCF12, 0x6B973724, 0x8A08F836, 0xD6876E48, 0x3718A15A, 0xBD10596C, 0x5C8F967E, 0x05A7DC90, 0xE4381382, 0x6E30EBB4, 0x8FAF24A6, 0xD320B2D8, 0x32BF7DCA, 0xB8B785FC, 0x59284AEE, 0x0AE71189, 0xEB78DE9B, 0x617026AD, 0x80EFE9BF, 0xDC607FC1, 0x3DFFB0D3, 0xB7F748E5, 0x566887F7, 0x0F40CD19, 0xEEDF020B, 0x64D7FA3D, 0x8548352F, 0xD9C7A351, 0x38586C43, 0xB2509475, 0x53CF5B67, 0x146722BB, 0xF5F8EDA9, 0x7FF0159F, 0x9E6FDA8D, 0xC2E04CF3, 0x237F83E1, 0xA9777BD7, 0x48E8B4C5, 0x11C0FE2B, 0xF05F3139, 0x7A57C90F, 0x9BC8061D, 0xC7479063, 0x26D85F71, 0xACD0A747, 0x4D4F6855, 0x1E803332, 0xFF1FFC20, 0x75170416, 0x9488CB04, 0xC8075D7A, 0x29989268, 0xA3906A5E, 0x420FA54C, 0x1B27EFA2, 0xFAB820B0, 0x70B0D886, 0x912F1794, 0xCDA081EA, 0x2C3F4EF8, 0xA637B6CE, 0x47A879DC, 0x28CE44DF, 0xC9518BCD, 0x435973FB, 0xA2C6BCE9, 0xFE492A97, 0x1FD6E585, 0x95DE1DB3, 0x7441D2A1, 0x2D69984F, 0xCCF6575D, 0x46FEAF6B, 0xA7616079, 0xFBEEF607, 0x1A713915, 0x9079C123, 0x71E60E31, 0x22295556, 0xC3B69A44, 0x49BE6272, 0xA821AD60, 0xF4AE3B1E, 0x1531F40C, 0x9F390C3A, 0x7EA6C328, 0x278E89C6, 0xC61146D4, 0x4C19BEE2, 0xAD8671F0, 0xF109E78E, 0x1096289C, 0x9A9ED0AA, 0x7B011FB8, 0x3CA96664, 0xDD36A976, 0x573E5140, 0xB6A19E52, 0xEA2E082C, 0x0BB1C73E, 0x81B93F08, 0x6026F01A, 0x390EBAF4, 0xD89175E6, 0x52998DD0, 0xB30642C2, 0xEF89D4BC, 0x0E161BAE, 0x841EE398, 0x65812C8A, 0x364E77ED, 0xD7D1B8FF, 0x5DD940C9, 0xBC468FDB, 0xE0C919A5, 0x0156D6B7, 0x8B5E2E81, 0x6AC1E193, 0x33E9AB7D, 0xD276646F, 0x587E9C59, 0xB9E1534B, 0xE56EC535, 0x04F10A27, 0x8EF9F211, 0x6F663D03, 0x50358817, 0xB1AA4705, 0x3BA2BF33, 0xDA3D7021, 0x86B2E65F, 0x672D294D, 0xED25D17B, 0x0CBA1E69, 0x55925487, 0xB40D9B95, 0x3E0563A3, 0xDF9AACB1, 0x83153ACF, 0x628AF5DD, 0xE8820DEB, 0x091DC2F9, 0x5AD2999E, 0xBB4D568C, 0x3145AEBA, 0xD0DA61A8, 0x8C55F7D6, 0x6DCA38C4, 0xE7C2C0F2, 0x065D0FE0, 0x5F75450E, 0xBEEA8A1C, 0x34E2722A, 0xD57DBD38, 0x89F22B46, 0x686DE454, 0xE2651C62, 0x03FAD370, 0x4452AAAC, 0xA5CD65BE, 0x2FC59D88, 0xCE5A529A, 0x92D5C4E4, 0x734A0BF6, 0xF942F3C0, 0x18DD3CD2, 0x41F5763C, 0xA06AB92E, 0x2A624118, 0xCBFD8E0A, 0x97721874, 0x76EDD766, 0xFCE52F50, 0x1D7AE042, 0x4EB5BB25, 0xAF2A7437, 0x25228C01, 0xC4BD4313, 0x9832D56D, 0x79AD1A7F, 0xF3A5E249, 0x123A2D5B, 0x4B1267B5, 0xAA8DA8A7, 0x20855091, 0xC11A9F83, 0x9D9509FD, 0x7C0AC6EF, 0xF6023ED9, 0x179DF1CB, 0x78FBCCC8, 0x996403DA, 0x136CFBEC, 0xF2F334FE, 0xAE7CA280, 0x4FE36D92, 0xC5EB95A4, 0x24745AB6, 0x7D5C1058, 0x9CC3DF4A, 0x16CB277C, 0xF754E86E, 0xABDB7E10, 0x4A44B102, 0xC04C4934, 0x21D38626, 0x721CDD41, 0x93831253, 0x198BEA65, 0xF8142577, 0xA49BB309, 0x45047C1B, 0xCF0C842D, 0x2E934B3F, 0x77BB01D1, 0x9624CEC3, 0x1C2C36F5, 0xFDB3F9E7, 0xA13C6F99, 0x40A3A08B, 0xCAAB58BD, 0x2B3497AF, 0x6C9CEE73, 0x8D032161, 0x070BD957, 0xE6941645, 0xBA1B803B, 0x5B844F29, 0xD18CB71F, 0x3013780D, 0x693B32E3, 0x88A4FDF1, 0x02AC05C7, 0xE333CAD5, 0xBFBC5CAB, 0x5E2393B9, 0xD42B6B8F, 0x35B4A49D, 0x667BFFFA, 0x87E430E8, 0x0DECC8DE, 0xEC7307CC, 0xB0FC91B2, 0x51635EA0, 0xDB6BA696, 0x3AF46984, 0x63DC236A, 0x8243EC78, 0x084B144E, 0xE9D4DB5C, 0xB55B4D22, 0x54C48230, 0xDECC7A06, 0x3F53B514, #else 0x00000000, 0xE19FCF13, 0x6B973726, 0x8A08F835, 0xD6876E4C, 0x3718A15F, 0xBD10596A, 0x5C8F9679, 0x05A7DC98, 0xE438138B, 0x6E30EBBE, 0x8FAF24AD, 0xD320B2D4, 0x32BF7DC7, 0xB8B785F2, 0x59284AE1, 0x0AE71199, 0xEB78DE8A, 0x617026BF, 0x80EFE9AC, 0xDC607FD5, 0x3DFFB0C6, 0xB7F748F3, 0x566887E0, 0x0F40CD01, 0xEEDF0212, 0x64D7FA27, 0x85483534, 0xD9C7A34D, 0x38586C5E, 0xB250946B, 0x53CF5B78, 0x1467229B, 0xF5F8ED88, 0x7FF015BD, 0x9E6FDAAE, 0xC2E04CD7, 0x237F83C4, 0xA9777BF1, 0x48E8B4E2, 0x11C0FE03, 0xF05F3110, 0x7A57C925, 0x9BC80636, 0xC747904F, 0x26D85F5C, 0xACD0A769, 0x4D4F687A, 0x1E803302, 0xFF1FFC11, 0x75170424, 0x9488CB37, 0xC8075D4E, 0x2998925D, 0xA3906A68, 0x420FA57B, 0x1B27EF9A, 0xFAB82089, 0x70B0D8BC, 0x912F17AF, 0xCDA081D6, 0x2C3F4EC5, 0xA637B6F0, 0x47A879E3, 0x28CE449F, 0xC9518B8C, 0x435973B9, 0xA2C6BCAA, 0xFE492AD3, 0x1FD6E5C0, 0x95DE1DF5, 0x7441D2E6, 0x2D699807, 0xCCF65714, 0x46FEAF21, 0xA7616032, 0xFBEEF64B, 0x1A713958, 0x9079C16D, 0x71E60E7E, 0x22295506, 0xC3B69A15, 0x49BE6220, 0xA821AD33, 0xF4AE3B4A, 0x1531F459, 0x9F390C6C, 0x7EA6C37F, 0x278E899E, 0xC611468D, 0x4C19BEB8, 0xAD8671AB, 0xF109E7D2, 0x109628C1, 0x9A9ED0F4, 0x7B011FE7, 0x3CA96604, 0xDD36A917, 0x573E5122, 0xB6A19E31, 0xEA2E0848, 0x0BB1C75B, 0x81B93F6E, 0x6026F07D, 0x390EBA9C, 0xD891758F, 0x52998DBA, 0xB30642A9, 0xEF89D4D0, 0x0E161BC3, 0x841EE3F6, 0x65812CE5, 0x364E779D, 0xD7D1B88E, 0x5DD940BB, 0xBC468FA8, 0xE0C919D1, 0x0156D6C2, 0x8B5E2EF7, 0x6AC1E1E4, 0x33E9AB05, 0xD2766416, 0x587E9C23, 0xB9E15330, 0xE56EC549, 0x04F10A5A, 0x8EF9F26F, 0x6F663D7C, 0x50358897, 0xB1AA4784, 0x3BA2BFB1, 0xDA3D70A2, 0x86B2E6DB, 0x672D29C8, 0xED25D1FD, 0x0CBA1EEE, 0x5592540F, 0xB40D9B1C, 0x3E056329, 0xDF9AAC3A, 0x83153A43, 0x628AF550, 0xE8820D65, 0x091DC276, 0x5AD2990E, 0xBB4D561D, 0x3145AE28, 0xD0DA613B, 0x8C55F742, 0x6DCA3851, 0xE7C2C064, 0x065D0F77, 0x5F754596, 0xBEEA8A85, 0x34E272B0, 0xD57DBDA3, 0x89F22BDA, 0x686DE4C9, 0xE2651CFC, 0x03FAD3EF, 0x4452AA0C, 0xA5CD651F, 0x2FC59D2A, 0xCE5A5239, 0x92D5C440, 0x734A0B53, 0xF942F366, 0x18DD3C75, 0x41F57694, 0xA06AB987, 0x2A6241B2, 0xCBFD8EA1, 0x977218D8, 0x76EDD7CB, 0xFCE52FFE, 0x1D7AE0ED, 0x4EB5BB95, 0xAF2A7486, 0x25228CB3, 0xC4BD43A0, 0x9832D5D9, 0x79AD1ACA, 0xF3A5E2FF, 0x123A2DEC, 0x4B12670D, 0xAA8DA81E, 0x2085502B, 0xC11A9F38, 0x9D950941, 0x7C0AC652, 0xF6023E67, 0x179DF174, 0x78FBCC08, 0x9964031B, 0x136CFB2E, 0xF2F3343D, 0xAE7CA244, 0x4FE36D57, 0xC5EB9562, 0x24745A71, 0x7D5C1090, 0x9CC3DF83, 0x16CB27B6, 0xF754E8A5, 0xABDB7EDC, 0x4A44B1CF, 0xC04C49FA, 0x21D386E9, 0x721CDD91, 0x93831282, 0x198BEAB7, 0xF81425A4, 0xA49BB3DD, 0x45047CCE, 0xCF0C84FB, 0x2E934BE8, 0x77BB0109, 0x9624CE1A, 0x1C2C362F, 0xFDB3F93C, 0xA13C6F45, 0x40A3A056, 0xCAAB5863, 0x2B349770, 0x6C9CEE93, 0x8D032180, 0x070BD9B5, 0xE69416A6, 0xBA1B80DF, 0x5B844FCC, 0xD18CB7F9, 0x301378EA, 0x693B320B, 0x88A4FD18, 0x02AC052D, 0xE333CA3E, 0xBFBC5C47, 0x5E239354, 0xD42B6B61, 0x35B4A472, 0x667BFF0A, 0x87E43019, 0x0DECC82C, 0xEC73073F, 0xB0FC9146, 0x51635E55, 0xDB6BA660, 0x3AF46973, 0x63DC2392, 0x8243EC81, 0x084B14B4, 0xE9D4DBA7, 0xB55B4DDE, 0x54C482CD, 0xDECC7AF8, 0x3F53B5EB, #endif 0x00000000, 0x180F40CD, 0x301E8033, 0x2811C0FE, 0x603CA966, 0x7833E9AB, 0x50222955, 0x482D6998, 0xC078FBCC, 0xD877BB01, 0xF0667BFF, 0xE8693B32, 0xA04452AA, 0xB84B1267, 0x905AD299, 0x88559254, 0x29F05F31, 0x31FF1FFC, 0x19EEDF02, 0x01E19FCF, 0x49CCF657, 0x51C3B69A, 0x79D27664, 0x61DD36A9, 0xE988A4FD, 0xF187E430, 0xD99624CE, 0xC1996403, 0x89B40D9B, 0x91BB4D56, 0xB9AA8DA8, 0xA1A5CD65, 0x5249BE62, 0x4A46FEAF, 0x62573E51, 0x7A587E9C, 0x32751704, 0x2A7A57C9, 0x026B9737, 0x1A64D7FA, 0x923145AE, 0x8A3E0563, 0xA22FC59D, 0xBA208550, 0xF20DECC8, 0xEA02AC05, 0xC2136CFB, 0xDA1C2C36, 0x7BB9E153, 0x63B6A19E, 0x4BA76160, 0x53A821AD, 0x1B854835, 0x038A08F8, 0x2B9BC806, 0x339488CB, 0xBBC11A9F, 0xA3CE5A52, 0x8BDF9AAC, 0x93D0DA61, 0xDBFDB3F9, 0xC3F2F334, 0xEBE333CA, 0xF3EC7307, 0xA492D5C4, 0xBC9D9509, 0x948C55F7, 0x8C83153A, 0xC4AE7CA2, 0xDCA13C6F, 0xF4B0FC91, 0xECBFBC5C, 0x64EA2E08, 0x7CE56EC5, 0x54F4AE3B, 0x4CFBEEF6, 0x04D6876E, 0x1CD9C7A3, 0x34C8075D, 0x2CC74790, 0x8D628AF5, 0x956DCA38, 0xBD7C0AC6, 0xA5734A0B, 0xED5E2393, 0xF551635E, 0xDD40A3A0, 0xC54FE36D, 0x4D1A7139, 0x551531F4, 0x7D04F10A, 0x650BB1C7, 0x2D26D85F, 0x35299892, 0x1D38586C, 0x053718A1, 0xF6DB6BA6, 0xEED42B6B, 0xC6C5EB95, 0xDECAAB58, 0x96E7C2C0, 0x8EE8820D, 0xA6F942F3, 0xBEF6023E, 0x36A3906A, 0x2EACD0A7, 0x06BD1059, 0x1EB25094, 0x569F390C, 0x4E9079C1, 0x6681B93F, 0x7E8EF9F2, 0xDF2B3497, 0xC724745A, 0xEF35B4A4, 0xF73AF469, 0xBF179DF1, 0xA718DD3C, 0x8F091DC2, 0x97065D0F, 0x1F53CF5B, 0x075C8F96, 0x2F4D4F68, 0x37420FA5, 0x7F6F663D, 0x676026F0, 0x4F71E60E, 0x577EA6C3, 0xE18D0321, 0xF98243EC, 0xD1938312, 0xC99CC3DF, 0x81B1AA47, 0x99BEEA8A, 0xB1AF2A74, 0xA9A06AB9, 0x21F5F8ED, 0x39FAB820, 0x11EB78DE, 0x09E43813, 0x41C9518B, 0x59C61146, 0x71D7D1B8, 0x69D89175, 0xC87D5C10, 0xD0721CDD, 0xF863DC23, 0xE06C9CEE, 0xA841F576, 0xB04EB5BB, 0x985F7545, 0x80503588, 0x0805A7DC, 0x100AE711, 0x381B27EF, 0x20146722, 0x68390EBA, 0x70364E77, 0x58278E89, 0x4028CE44, 0xB3C4BD43, 0xABCBFD8E, 0x83DA3D70, 0x9BD57DBD, 0xD3F81425, 0xCBF754E8, 0xE3E69416, 0xFBE9D4DB, 0x73BC468F, 0x6BB30642, 0x43A2C6BC, 0x5BAD8671, 0x1380EFE9, 0x0B8FAF24, 0x239E6FDA, 0x3B912F17, 0x9A34E272, 0x823BA2BF, 0xAA2A6241, 0xB225228C, 0xFA084B14, 0xE2070BD9, 0xCA16CB27, 0xD2198BEA, 0x5A4C19BE, 0x42435973, 0x6A52998D, 0x725DD940, 0x3A70B0D8, 0x227FF015, 0x0A6E30EB, 0x12617026, 0x451FD6E5, 0x5D109628, 0x750156D6, 0x6D0E161B, 0x25237F83, 0x3D2C3F4E, 0x153DFFB0, 0x0D32BF7D, 0x85672D29, 0x9D686DE4, 0xB579AD1A, 0xAD76EDD7, 0xE55B844F, 0xFD54C482, 0xD545047C, 0xCD4A44B1, 0x6CEF89D4, 0x74E0C919, 0x5CF109E7, 0x44FE492A, 0x0CD320B2, 0x14DC607F, 0x3CCDA081, 0x24C2E04C, 0xAC977218, 0xB49832D5, 0x9C89F22B, 0x8486B2E6, 0xCCABDB7E, 0xD4A49BB3, 0xFCB55B4D, 0xE4BA1B80, 0x17566887, 0x0F59284A, 0x2748E8B4, 0x3F47A879, 0x776AC1E1, 0x6F65812C, 0x477441D2, 0x5F7B011F, 0xD72E934B, 0xCF21D386, 0xE7301378, 0xFF3F53B5, 0xB7123A2D, 0xAF1D7AE0, 0x870CBA1E, 0x9F03FAD3, 0x3EA637B6, 0x26A9777B, 0x0EB8B785, 0x16B7F748, 0x5E9A9ED0, 0x4695DE1D, 0x6E841EE3, 0x768B5E2E, 0xFEDECC7A, 0xE6D18CB7, 0xCEC04C49, 0xD6CF0C84, 0x9EE2651C, 0x86ED25D1, 0xAEFCE52F, 0xB6F3A5E2 }; } #if CRYPTOPP_BOOL_X86 || CRYPTOPP_BOOL_X64 unsigned int SosemanukPolicy::GetAlignment() const { #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE #ifdef __INTEL_COMPILER if (HasSSE2() && !IsP4()) // Intel compiler produces faster code for this algorithm on the P4 #else if (HasSSE2()) #endif return 16; else #endif return GetAlignmentOf(); } unsigned int SosemanukPolicy::GetOptimalBlockSize() const { #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE #ifdef __INTEL_COMPILER if (HasSSE2() && !IsP4()) // Intel compiler produces faster code for this algorithm on the P4 #else if (HasSSE2()) #endif return 4*BYTES_PER_ITERATION; else #endif return BYTES_PER_ITERATION; } #endif #ifdef CRYPTOPP_X64_MASM_AVAILABLE extern "C" { void Sosemanuk_OperateKeystream(size_t iterationCount, const byte *input, byte *output, word32 *state); } #endif #pragma warning(disable: 4731) // frame pointer register 'ebp' modified by inline assembly code void SosemanukPolicy::OperateKeystream(KeystreamOperation operation, byte *output, const byte *input, size_t iterationCount) { #endif // #ifdef CRYPTOPP_GENERATE_X64_MASM #ifdef CRYPTOPP_X64_MASM_AVAILABLE Sosemanuk_OperateKeystream(iterationCount, input, output, m_state.data()); return; #endif #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE #ifdef CRYPTOPP_GENERATE_X64_MASM ALIGN 8 Sosemanuk_OperateKeystream PROC FRAME rex_push_reg rsi push_reg rdi alloc_stack(80*4*2+12*4+8*WORD_SZ + 2*16+8) save_xmm128 xmm6, 02f0h save_xmm128 xmm7, 0300h .endprolog mov rdi, r8 mov rax, r9 #else #ifdef __INTEL_COMPILER if (HasSSE2() && !IsP4()) // Intel compiler produces faster code for this algorithm on the P4 #else if (HasSSE2()) #endif { #ifdef __GNUC__ #if CRYPTOPP_BOOL_X64 FixedSizeAlignedSecBlock workspace; #endif __asm__ __volatile__ ( ".intel_syntax noprefix;" AS_PUSH_IF86( bx) #else word32 *state = m_state; AS2( mov WORD_REG(ax), state) AS2( mov WORD_REG(di), output) AS2( mov WORD_REG(dx), input) AS2( mov WORD_REG(cx), iterationCount) #endif #endif // #ifdef CRYPTOPP_GENERATE_X64_MASM #if defined(__GNUC__) && CRYPTOPP_BOOL_X64 #define SSE2_workspace %5 #else #define SSE2_workspace WORD_REG(sp) #endif #define SSE2_output WORD_PTR [SSE2_workspace+1*WORD_SZ] #define SSE2_input WORD_PTR [SSE2_workspace+2*WORD_SZ] #define SSE2_wordsLeft WORD_PTR [SSE2_workspace+3*WORD_SZ] #define SSE2_diEnd WORD_PTR [SSE2_workspace+4*WORD_SZ] #define SSE2_pMulTables WORD_PTR [SSE2_workspace+5*WORD_SZ] #define SSE2_state WORD_PTR [SSE2_workspace+6*WORD_SZ] #define SSE2_wordsLeft2 WORD_PTR [SSE2_workspace+7*WORD_SZ] #define SSE2_stateCopy SSE2_workspace + 8*WORD_SZ #define SSE2_uvStart SSE2_stateCopy + 12*4 #if CRYPTOPP_BOOL_X86 AS_PUSH_IF86( bp) AS2( mov AS_REG_6, esp) AS2( and esp, -16) AS2( sub esp, 80*4*2+12*4+8*WORD_SZ) // 80 v's, 80 u's, 12 state, 8 locals AS2( mov [esp], AS_REG_6) #endif AS2( mov SSE2_output, WORD_REG(di)) AS2( mov SSE2_input, WORD_REG(dx)) AS2( mov SSE2_state, WORD_REG(ax)) #ifndef _MSC_VER AS2( mov SSE2_pMulTables, WORD_REG(si)) #endif AS2( lea WORD_REG(cx), [4*WORD_REG(cx)+WORD_REG(cx)]) AS2( lea WORD_REG(si), [4*WORD_REG(cx)]) AS2( mov SSE2_wordsLeft, WORD_REG(si)) AS2( movdqa xmm0, [WORD_REG(ax)+0*16]) // copy state to stack to save a register AS2( movdqa [SSE2_stateCopy+0*16], xmm0) AS2( movdqa xmm0, [WORD_REG(ax)+1*16]) AS2( movdqa [SSE2_stateCopy+1*16], xmm0) AS2( movq xmm0, QWORD PTR [WORD_REG(ax)+2*16]) AS2( movq QWORD PTR [SSE2_stateCopy+2*16], xmm0) AS2( psrlq xmm0, 32) AS2( movd AS_REG_6d, xmm0) // s(9) AS2( mov ecx, [WORD_REG(ax)+10*4]) AS2( mov edx, [WORD_REG(ax)+11*4]) AS2( pcmpeqb xmm7, xmm7) // all ones #define s(i) SSE2_stateCopy + ASM_MOD(i,10)*4 #define u(j) WORD_REG(di) + (ASM_MOD(j,4)*20 + (j/4)) * 4 #define v(j) WORD_REG(di) + (ASM_MOD(j,4)*20 + (j/4)) * 4 + 80*4 #define R10 ecx #define R11 edx #define R20 edx #define R21 ecx // workaround bug in GAS 2.15 #define R20r WORD_REG(dx) #define R21r WORD_REG(cx) #define SSE2_STEP(i, j) \ AS2( mov eax, [s(i+0)])\ AS2( mov [v(i)], eax)\ AS2( rol eax, 8)\ AS2( lea AS_REG_7, [AS_REG_6 + R2##j##r])\ AS2( xor AS_REG_7d, R1##j)\ AS2( mov [u(i)], AS_REG_7d)\ AS2( mov AS_REG_7d, 1)\ AS2( and AS_REG_7d, R2##j)\ AS1( neg AS_REG_7d)\ AS2( and AS_REG_7d, AS_REG_6d)\ AS2( xor AS_REG_6d, eax)\ AS2( movzx eax, al)\ AS2( xor AS_REG_6d, [WORD_REG(si)+WORD_REG(ax)*4])\ AS2( mov eax, [s(i+3)])\ AS2( xor AS_REG_7d, [s(i+2)])\ AS2( add R1##j, AS_REG_7d)\ AS2( movzx AS_REG_7d, al)\ AS2( shr eax, 8)\ AS2( xor AS_REG_6d, [WORD_REG(si)+1024+AS_REG_7*4])\ AS2( xor AS_REG_6d, eax)\ AS2( imul R2##j, AS_HEX(54655307))\ AS2( rol R2##j, 7)\ AS2( mov [s(i+0)], AS_REG_6d)\ ASL(2) // outer loop, each iteration of this processes 80 words AS2( lea WORD_REG(di), [SSE2_uvStart]) // start of v and u AS2( mov WORD_REG(ax), 80) AS2( cmp WORD_REG(si), 80) AS2( cmovg WORD_REG(si), WORD_REG(ax)) AS2( mov SSE2_wordsLeft2, WORD_REG(si)) AS2( lea WORD_REG(si), [WORD_REG(di)+WORD_REG(si)]) // use to end first inner loop AS2( mov SSE2_diEnd, WORD_REG(si)) #ifdef _MSC_VER AS2( lea WORD_REG(si), s_sosemanukMulTables) #else AS2( mov WORD_REG(si), SSE2_pMulTables) #endif ASL(0) // first inner loop, 20 words each, 4 iterations SSE2_STEP(0, 0) SSE2_STEP(1, 1) SSE2_STEP(2, 0) SSE2_STEP(3, 1) SSE2_STEP(4, 0) SSE2_STEP(5, 1) SSE2_STEP(6, 0) SSE2_STEP(7, 1) SSE2_STEP(8, 0) SSE2_STEP(9, 1) SSE2_STEP(10, 0) SSE2_STEP(11, 1) SSE2_STEP(12, 0) SSE2_STEP(13, 1) SSE2_STEP(14, 0) SSE2_STEP(15, 1) SSE2_STEP(16, 0) SSE2_STEP(17, 1) SSE2_STEP(18, 0) SSE2_STEP(19, 1) // loop AS2( add WORD_REG(di), 5*4) AS2( cmp WORD_REG(di), SSE2_diEnd) ASJ( jne, 0, b) AS2( mov WORD_REG(ax), SSE2_input) AS2( mov AS_REG_7, SSE2_output) AS2( lea WORD_REG(di), [SSE2_uvStart]) // start of v and u AS2( mov WORD_REG(si), SSE2_wordsLeft2) ASL(1) // second inner loop, 16 words each, 5 iterations AS2( movdqa xmm0, [WORD_REG(di)+0*20*4]) AS2( movdqa xmm2, [WORD_REG(di)+2*20*4]) AS2( movdqa xmm3, [WORD_REG(di)+3*20*4]) AS2( movdqa xmm1, [WORD_REG(di)+1*20*4]) // S2 AS2( movdqa xmm4, xmm0) AS2( pand xmm0, xmm2) AS2( pxor xmm0, xmm3) AS2( pxor xmm2, xmm1) AS2( pxor xmm2, xmm0) AS2( por xmm3, xmm4) AS2( pxor xmm3, xmm1) AS2( pxor xmm4, xmm2) AS2( movdqa xmm1, xmm3) AS2( por xmm3, xmm4) AS2( pxor xmm3, xmm0) AS2( pand xmm0, xmm1) AS2( pxor xmm4, xmm0) AS2( pxor xmm1, xmm3) AS2( pxor xmm1, xmm4) AS2( pxor xmm4, xmm7) // xor with v AS2( pxor xmm2, [WORD_REG(di)+80*4]) AS2( pxor xmm3, [WORD_REG(di)+80*5]) AS2( pxor xmm1, [WORD_REG(di)+80*6]) AS2( pxor xmm4, [WORD_REG(di)+80*7]) // exit loop early if less than 16 words left to output // this is necessary because block size is 20 words, and we output 16 words in each iteration of this loop AS2( cmp WORD_REG(si), 16) ASJ( jl, 4, f) // unpack AS2( movdqa xmm6, xmm2) AS2( punpckldq xmm2, xmm3) AS2( movdqa xmm5, xmm1) AS2( punpckldq xmm1, xmm4) AS2( movdqa xmm0, xmm2) AS2( punpcklqdq xmm2, xmm1) AS2( punpckhqdq xmm0, xmm1) AS2( punpckhdq xmm6, xmm3) AS2( punpckhdq xmm5, xmm4) AS2( movdqa xmm3, xmm6) AS2( punpcklqdq xmm6, xmm5) AS2( punpckhqdq xmm3, xmm5) // output keystream AS_XMM_OUTPUT4(SSE2_Sosemanuk_Output, WORD_REG(ax), AS_REG_7, 2,0,6,3, 1, 0,1,2,3, 4) // loop AS2( add WORD_REG(di), 4*4) AS2( sub WORD_REG(si), 16) ASJ( jnz, 1, b) // outer loop AS2( mov WORD_REG(si), SSE2_wordsLeft) AS2( sub WORD_REG(si), 80) ASJ( jz, 6, f) AS2( mov SSE2_wordsLeft, WORD_REG(si)) AS2( mov SSE2_input, WORD_REG(ax)) AS2( mov SSE2_output, AS_REG_7) ASJ( jmp, 2, b) ASL(4) // final output of less than 16 words AS2( test WORD_REG(ax), WORD_REG(ax)) ASJ( jz, 5, f) AS2( movd xmm0, dword ptr [WORD_REG(ax)+0*4]) AS2( pxor xmm2, xmm0) AS2( movd xmm0, dword ptr [WORD_REG(ax)+1*4]) AS2( pxor xmm3, xmm0) AS2( movd xmm0, dword ptr [WORD_REG(ax)+2*4]) AS2( pxor xmm1, xmm0) AS2( movd xmm0, dword ptr [WORD_REG(ax)+3*4]) AS2( pxor xmm4, xmm0) AS2( add WORD_REG(ax), 16) ASL(5) AS2( movd dword ptr [AS_REG_7+0*4], xmm2) AS2( movd dword ptr [AS_REG_7+1*4], xmm3) AS2( movd dword ptr [AS_REG_7+2*4], xmm1) AS2( movd dword ptr [AS_REG_7+3*4], xmm4) AS2( sub WORD_REG(si), 4) ASJ( jz, 6, f) AS2( add AS_REG_7, 16) AS2( psrldq xmm2, 4) AS2( psrldq xmm3, 4) AS2( psrldq xmm1, 4) AS2( psrldq xmm4, 4) ASJ( jmp, 4, b) ASL(6) // save state AS2( mov AS_REG_6, SSE2_state) AS2( movdqa xmm0, [SSE2_stateCopy+0*16]) AS2( movdqa [AS_REG_6+0*16], xmm0) AS2( movdqa xmm0, [SSE2_stateCopy+1*16]) AS2( movdqa [AS_REG_6+1*16], xmm0) AS2( movq xmm0, QWORD PTR [SSE2_stateCopy+2*16]) AS2( movq QWORD PTR [AS_REG_6+2*16], xmm0) AS2( mov [AS_REG_6+10*4], ecx) AS2( mov [AS_REG_6+11*4], edx) AS_POP_IF86( sp) AS_POP_IF86( bp) #ifdef __GNUC__ AS_POP_IF86( bx) ".att_syntax prefix;" : : "a" (m_state.m_ptr), "c" (iterationCount), "S" (s_sosemanukMulTables), "D" (output), "d" (input) #if CRYPTOPP_BOOL_X64 , "r" (workspace.m_ptr) : "memory", "cc", "%r9", "%r10", "%xmm0", "%xmm1", "%xmm2", "%xmm3", "%xmm4", "%xmm5", "%xmm6", "%xmm7" #else : "memory", "cc" #endif ); #endif #ifdef CRYPTOPP_GENERATE_X64_MASM movdqa xmm6, [rsp + 02f0h] movdqa xmm7, [rsp + 0300h] add rsp, 80*4*2+12*4+8*WORD_SZ + 2*16+8 pop rdi pop rsi ret Sosemanuk_OperateKeystream ENDP #else } else #endif #endif #ifndef CRYPTOPP_GENERATE_X64_MASM { #if CRYPTOPP_BOOL_X86 | CRYPTOPP_BOOL_X64 #define MUL_A(x) (x = rotlFixed(x, 8), x ^ s_sosemanukMulTables[byte(x)]) #else #define MUL_A(x) (((x) << 8) ^ s_sosemanukMulTables[(x) >> 24]) #endif #define DIV_A(x) (((x) >> 8) ^ s_sosemanukMulTables[256 + byte(x)]) #define r1(i) ((i%2) ? reg2 : reg1) #define r2(i) ((i%2) ? reg1 : reg2) #define STEP(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, v, u) \ u = (s##x9 + r2(x0)) ^ r1(x0);\ v = s##x0;\ s##x0 = MUL_A(s##x0) ^ DIV_A(s##x3) ^ s##x9;\ r1(x0) += XMUX(r2(x0), s##x2, s##x9);\ r2(x0) = rotlFixed(r2(x0) * 0x54655307, 7);\ #define SOSEMANUK_OUTPUT(x) \ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 0, u2 ^ v0);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 1, u3 ^ v1);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 2, u1 ^ v2);\ CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, LITTLE_ENDIAN_ORDER, 3, u4 ^ v3); #define OUTPUT4 \ S2(0, u0, u1, u2, u3, u4);\ CRYPTOPP_KEYSTREAM_OUTPUT_SWITCH(SOSEMANUK_OUTPUT, 4*4); word32 s0 = m_state[0]; word32 s1 = m_state[1]; word32 s2 = m_state[2]; word32 s3 = m_state[3]; word32 s4 = m_state[4]; word32 s5 = m_state[5]; word32 s6 = m_state[6]; word32 s7 = m_state[7]; word32 s8 = m_state[8]; word32 s9 = m_state[9]; word32 reg1 = m_state[10]; word32 reg2 = m_state[11]; word32 u0, u1, u2, u3, u4, v0, v1, v2, v3; do { STEP(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, v0, u0) STEP(1, 2, 3, 4, 5, 6, 7, 8, 9, 0, v1, u1) STEP(2, 3, 4, 5, 6, 7, 8, 9, 0, 1, v2, u2) STEP(3, 4, 5, 6, 7, 8, 9, 0, 1, 2, v3, u3) OUTPUT4 STEP(4, 5, 6, 7, 8, 9, 0, 1, 2, 3, v0, u0) STEP(5, 6, 7, 8, 9, 0, 1, 2, 3, 4, v1, u1) STEP(6, 7, 8, 9, 0, 1, 2, 3, 4, 5, v2, u2) STEP(7, 8, 9, 0, 1, 2, 3, 4, 5, 6, v3, u3) OUTPUT4 STEP(8, 9, 0, 1, 2, 3, 4, 5, 6, 7, v0, u0) STEP(9, 0, 1, 2, 3, 4, 5, 6, 7, 8, v1, u1) STEP(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, v2, u2) STEP(1, 2, 3, 4, 5, 6, 7, 8, 9, 0, v3, u3) OUTPUT4 STEP(2, 3, 4, 5, 6, 7, 8, 9, 0, 1, v0, u0) STEP(3, 4, 5, 6, 7, 8, 9, 0, 1, 2, v1, u1) STEP(4, 5, 6, 7, 8, 9, 0, 1, 2, 3, v2, u2) STEP(5, 6, 7, 8, 9, 0, 1, 2, 3, 4, v3, u3) OUTPUT4 STEP(6, 7, 8, 9, 0, 1, 2, 3, 4, 5, v0, u0) STEP(7, 8, 9, 0, 1, 2, 3, 4, 5, 6, v1, u1) STEP(8, 9, 0, 1, 2, 3, 4, 5, 6, 7, v2, u2) STEP(9, 0, 1, 2, 3, 4, 5, 6, 7, 8, v3, u3) OUTPUT4 } while (--iterationCount); m_state[0] = s0; m_state[1] = s1; m_state[2] = s2; m_state[3] = s3; m_state[4] = s4; m_state[5] = s5; m_state[6] = s6; m_state[7] = s7; m_state[8] = s8; m_state[9] = s9; m_state[10] = reg1; m_state[11] = reg2; } } NAMESPACE_END #endif // #ifndef CRYPTOPP_GENERATE_X64_MASM armory-0.92.3/cppForSwig/cryptopp/shacal2.cpp0000755000000000000000000000733112414772654017623 0ustar rootroot// shacal2.cpp - by Kevin Springle, 2003 // // Portions of this code were derived from // Wei Dai's implementation of SHA-2 // // The original code and all modifications are in the public domain. #include "pch.h" #include "shacal2.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) // SHACAL-2 function and round definitions #define S0(x) (rotrFixed(x,2)^rotrFixed(x,13)^rotrFixed(x,22)) #define S1(x) (rotrFixed(x,6)^rotrFixed(x,11)^rotrFixed(x,25)) #define s0(x) (rotrFixed(x,7)^rotrFixed(x,18)^(x>>3)) #define s1(x) (rotrFixed(x,17)^rotrFixed(x,19)^(x>>10)) #define Ch(x,y,z) (z^(x&(y^z))) #define Maj(x,y,z) ((x&y)|(z&(x|y))) /* R is the SHA-256 round function. */ /* This macro increments the k argument as a side effect. */ #define R(a,b,c,d,e,f,g,h,k) \ h+=S1(e)+Ch(e,f,g)+*k++;d+=h;h+=S0(a)+Maj(a,b,c); /* P is the inverse of the SHA-256 round function. */ /* This macro decrements the k argument as a side effect. */ #define P(a,b,c,d,e,f,g,h,k) \ h-=S0(a)+Maj(a,b,c);d-=h;h-=S1(e)+Ch(e,f,g)+*--k; void SHACAL2::Base::UncheckedSetKey(const byte *userKey, unsigned int keylen, const NameValuePairs &) { AssertValidKeyLength(keylen); word32 *rk = m_key; unsigned int i; GetUserKey(BIG_ENDIAN_ORDER, rk, m_key.size(), userKey, keylen); for (i = 0; i < 48; i++, rk++) { rk[16] = rk[0] + s0(rk[1]) + rk[9] + s1(rk[14]); rk[0] += K[i]; } for (i = 48; i < 64; i++, rk++) { rk[0] += K[i]; } } typedef BlockGetAndPut Block; void SHACAL2::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 a, b, c, d, e, f, g, h; const word32 *rk = m_key; /* * map byte array block to cipher state: */ Block::Get(inBlock)(a)(b)(c)(d)(e)(f)(g)(h); // Perform SHA-256 transformation. /* 64 operations, partially loop unrolled */ for (unsigned int j=0; j<64; j+=8) { R(a,b,c,d,e,f,g,h,rk); R(h,a,b,c,d,e,f,g,rk); R(g,h,a,b,c,d,e,f,rk); R(f,g,h,a,b,c,d,e,rk); R(e,f,g,h,a,b,c,d,rk); R(d,e,f,g,h,a,b,c,rk); R(c,d,e,f,g,h,a,b,rk); R(b,c,d,e,f,g,h,a,rk); } /* * map cipher state to byte array block: */ Block::Put(xorBlock, outBlock)(a)(b)(c)(d)(e)(f)(g)(h); } void SHACAL2::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 a, b, c, d, e, f, g, h; const word32 *rk = m_key + 64; /* * map byte array block to cipher state: */ Block::Get(inBlock)(a)(b)(c)(d)(e)(f)(g)(h); // Perform inverse SHA-256 transformation. /* 64 operations, partially loop unrolled */ for (unsigned int j=0; j<64; j+=8) { P(b,c,d,e,f,g,h,a,rk); P(c,d,e,f,g,h,a,b,rk); P(d,e,f,g,h,a,b,c,rk); P(e,f,g,h,a,b,c,d,rk); P(f,g,h,a,b,c,d,e,rk); P(g,h,a,b,c,d,e,f,rk); P(h,a,b,c,d,e,f,g,rk); P(a,b,c,d,e,f,g,h,rk); } /* * map cipher state to byte array block: */ Block::Put(xorBlock, outBlock)(a)(b)(c)(d)(e)(f)(g)(h); } // The SHACAL-2 round constants are identical to the SHA-256 round constants. const word32 SHACAL2::Base::K[64] = { 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2 }; NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/secblock.h0000755000000000000000000003011312414772654017532 0ustar rootroot// secblock.h - written and placed in the public domain by Wei Dai #ifndef CRYPTOPP_SECBLOCK_H #define CRYPTOPP_SECBLOCK_H #include "config.h" #include "misc.h" #include NAMESPACE_BEGIN(CryptoPP) // ************** secure memory allocation *************** template class AllocatorBase { public: typedef T value_type; typedef size_t size_type; #ifdef CRYPTOPP_MSVCRT6 typedef ptrdiff_t difference_type; #else typedef std::ptrdiff_t difference_type; #endif typedef T * pointer; typedef const T * const_pointer; typedef T & reference; typedef const T & const_reference; pointer address(reference r) const {return (&r);} const_pointer address(const_reference r) const {return (&r); } void construct(pointer p, const T& val) {new (p) T(val);} void destroy(pointer p) {p->~T();} size_type max_size() const {return ~size_type(0)/sizeof(T);} // switch to std::numeric_limits::max later protected: static void CheckSize(size_t n) { if (n > ~size_t(0) / sizeof(T)) throw InvalidArgument("AllocatorBase: requested size would cause integer overflow"); } }; #define CRYPTOPP_INHERIT_ALLOCATOR_TYPES \ typedef typename AllocatorBase::value_type value_type;\ typedef typename AllocatorBase::size_type size_type;\ typedef typename AllocatorBase::difference_type difference_type;\ typedef typename AllocatorBase::pointer pointer;\ typedef typename AllocatorBase::const_pointer const_pointer;\ typedef typename AllocatorBase::reference reference;\ typedef typename AllocatorBase::const_reference const_reference; #if defined(_MSC_VER) && (_MSC_VER < 1300) // this pragma causes an internal compiler error if placed immediately before std::swap(a, b) #pragma warning(push) #pragma warning(disable: 4700) // VC60 workaround: don't know how to get rid of this warning #endif template typename A::pointer StandardReallocate(A& a, T *p, typename A::size_type oldSize, typename A::size_type newSize, bool preserve) { if (oldSize == newSize) return p; if (preserve) { typename A::pointer newPointer = a.allocate(newSize, NULL); memcpy_s(newPointer, sizeof(T)*newSize, p, sizeof(T)*STDMIN(oldSize, newSize)); a.deallocate(p, oldSize); return newPointer; } else { a.deallocate(p, oldSize); return a.allocate(newSize, NULL); } } #if defined(_MSC_VER) && (_MSC_VER < 1300) #pragma warning(pop) #endif template class AllocatorWithCleanup : public AllocatorBase { public: CRYPTOPP_INHERIT_ALLOCATOR_TYPES pointer allocate(size_type n, const void * = NULL) { this->CheckSize(n); if (n == 0) return NULL; #if CRYPTOPP_BOOL_ALIGN16_ENABLED if (T_Align16 && n*sizeof(T) >= 16) return (pointer)AlignedAllocate(n*sizeof(T)); #endif return (pointer)UnalignedAllocate(n*sizeof(T)); } void deallocate(void *p, size_type n) { SecureWipeArray((pointer)p, n); #if CRYPTOPP_BOOL_ALIGN16_ENABLED if (T_Align16 && n*sizeof(T) >= 16) return AlignedDeallocate(p); #endif UnalignedDeallocate(p); } pointer reallocate(T *p, size_type oldSize, size_type newSize, bool preserve) { return StandardReallocate(*this, p, oldSize, newSize, preserve); } // VS.NET STL enforces the policy of "All STL-compliant allocators have to provide a // template class member called rebind". template struct rebind { typedef AllocatorWithCleanup other; }; #if _MSC_VER >= 1500 AllocatorWithCleanup() {} template AllocatorWithCleanup(const AllocatorWithCleanup &) {} #endif }; CRYPTOPP_DLL_TEMPLATE_CLASS AllocatorWithCleanup; CRYPTOPP_DLL_TEMPLATE_CLASS AllocatorWithCleanup; CRYPTOPP_DLL_TEMPLATE_CLASS AllocatorWithCleanup; CRYPTOPP_DLL_TEMPLATE_CLASS AllocatorWithCleanup; #if CRYPTOPP_BOOL_X86 CRYPTOPP_DLL_TEMPLATE_CLASS AllocatorWithCleanup; // for Integer #endif template class NullAllocator : public AllocatorBase { public: CRYPTOPP_INHERIT_ALLOCATOR_TYPES pointer allocate(size_type n, const void * = NULL) { assert(false); return NULL; } void deallocate(void *p, size_type n) { assert(false); } size_type max_size() const {return 0;} }; // This allocator can't be used with standard collections because // they require that all objects of the same allocator type are equivalent. // So this is for use with SecBlock only. template , bool T_Align16 = false> class FixedSizeAllocatorWithCleanup : public AllocatorBase { public: CRYPTOPP_INHERIT_ALLOCATOR_TYPES FixedSizeAllocatorWithCleanup() : m_allocated(false) {} pointer allocate(size_type n) { assert(IsAlignedOn(m_array, 8)); if (n <= S && !m_allocated) { m_allocated = true; return GetAlignedArray(); } else return m_fallbackAllocator.allocate(n); } pointer allocate(size_type n, const void *hint) { if (n <= S && !m_allocated) { m_allocated = true; return GetAlignedArray(); } else return m_fallbackAllocator.allocate(n, hint); } void deallocate(void *p, size_type n) { if (p == GetAlignedArray()) { assert(n <= S); assert(m_allocated); m_allocated = false; SecureWipeArray((pointer)p, n); } else m_fallbackAllocator.deallocate(p, n); } pointer reallocate(pointer p, size_type oldSize, size_type newSize, bool preserve) { if (p == GetAlignedArray() && newSize <= S) { assert(oldSize <= S); if (oldSize > newSize) SecureWipeArray(p+newSize, oldSize-newSize); return p; } pointer newPointer = allocate(newSize, NULL); if (preserve) memcpy(newPointer, p, sizeof(T)*STDMIN(oldSize, newSize)); deallocate(p, oldSize); return newPointer; } size_type max_size() const {return STDMAX(m_fallbackAllocator.max_size(), S);} private: #ifdef __BORLANDC__ T* GetAlignedArray() {return m_array;} T m_array[S]; #else T* GetAlignedArray() {return (CRYPTOPP_BOOL_ALIGN16_ENABLED && T_Align16) ? (T*)(((byte *)m_array) + (0-(size_t)m_array)%16) : m_array;} CRYPTOPP_ALIGN_DATA(8) T m_array[(CRYPTOPP_BOOL_ALIGN16_ENABLED && T_Align16) ? S+8/sizeof(T) : S]; #endif A m_fallbackAllocator; bool m_allocated; }; //! a block of memory allocated using A template > class SecBlock { public: typedef typename A::value_type value_type; typedef typename A::pointer iterator; typedef typename A::const_pointer const_iterator; typedef typename A::size_type size_type; explicit SecBlock(size_type size=0) : m_size(size) {m_ptr = m_alloc.allocate(size, NULL);} SecBlock(const SecBlock &t) : m_size(t.m_size) {m_ptr = m_alloc.allocate(m_size, NULL); memcpy_s(m_ptr, m_size*sizeof(T), t.m_ptr, m_size*sizeof(T));} SecBlock(const T *t, size_type len) : m_size(len) { m_ptr = m_alloc.allocate(len, NULL); if (t == NULL) memset_z(m_ptr, 0, len*sizeof(T)); else memcpy(m_ptr, t, len*sizeof(T)); } ~SecBlock() {m_alloc.deallocate(m_ptr, m_size);} #ifdef __BORLANDC__ operator T *() const {return (T*)m_ptr;} #else operator const void *() const {return m_ptr;} operator void *() {return m_ptr;} operator const T *() const {return m_ptr;} operator T *() {return m_ptr;} #endif // T *operator +(size_type offset) // {return m_ptr+offset;} // const T *operator +(size_type offset) const // {return m_ptr+offset;} // T& operator[](size_type index) // {assert(index >= 0 && index < m_size); return m_ptr[index];} // const T& operator[](size_type index) const // {assert(index >= 0 && index < m_size); return m_ptr[index];} iterator begin() {return m_ptr;} const_iterator begin() const {return m_ptr;} iterator end() {return m_ptr+m_size;} const_iterator end() const {return m_ptr+m_size;} typename A::pointer data() {return m_ptr;} typename A::const_pointer data() const {return m_ptr;} size_type size() const {return m_size;} bool empty() const {return m_size == 0;} byte * BytePtr() {return (byte *)m_ptr;} const byte * BytePtr() const {return (const byte *)m_ptr;} size_type SizeInBytes() const {return m_size*sizeof(T);} //! set contents and size void Assign(const T *t, size_type len) { New(len); memcpy_s(m_ptr, m_size*sizeof(T), t, len*sizeof(T)); } //! copy contents and size from another SecBlock void Assign(const SecBlock &t) { if (this != &t) { New(t.m_size); memcpy_s(m_ptr, m_size*sizeof(T), t.m_ptr, m_size*sizeof(T)); } } SecBlock& operator=(const SecBlock &t) { Assign(t); return *this; } // append to this object SecBlock& operator+=(const SecBlock &t) { size_type oldSize = m_size; Grow(m_size+t.m_size); memcpy_s(m_ptr+oldSize, m_size*sizeof(T), t.m_ptr, t.m_size*sizeof(T)); return *this; } // append operator SecBlock operator+(const SecBlock &t) { SecBlock result(m_size+t.m_size); memcpy_s(result.m_ptr, result.m_size*sizeof(T), m_ptr, m_size*sizeof(T)); memcpy_s(result.m_ptr+m_size, t.m_size*sizeof(T), t.m_ptr, t.m_size*sizeof(T)); return result; } bool operator==(const SecBlock &t) const { return m_size == t.m_size && VerifyBufsEqual(m_ptr, t.m_ptr, m_size*sizeof(T)); } bool operator!=(const SecBlock &t) const { return !operator==(t); } //! change size, without preserving contents void New(size_type newSize) { m_ptr = m_alloc.reallocate(m_ptr, m_size, newSize, false); m_size = newSize; } //! change size and set contents to 0 void CleanNew(size_type newSize) { New(newSize); memset_z(m_ptr, 0, m_size*sizeof(T)); } //! change size only if newSize > current size. contents are preserved void Grow(size_type newSize) { if (newSize > m_size) { m_ptr = m_alloc.reallocate(m_ptr, m_size, newSize, true); m_size = newSize; } } //! change size only if newSize > current size. contents are preserved and additional area is set to 0 void CleanGrow(size_type newSize) { if (newSize > m_size) { m_ptr = m_alloc.reallocate(m_ptr, m_size, newSize, true); memset(m_ptr+m_size, 0, (newSize-m_size)*sizeof(T)); m_size = newSize; } } //! change size and preserve contents void resize(size_type newSize) { m_ptr = m_alloc.reallocate(m_ptr, m_size, newSize, true); m_size = newSize; } //! swap contents and size with another SecBlock void swap(SecBlock &b) { std::swap(m_alloc, b.m_alloc); std::swap(m_size, b.m_size); std::swap(m_ptr, b.m_ptr); } //private: A m_alloc; size_type m_size; T *m_ptr; }; typedef SecBlock SecByteBlock; typedef SecBlock > AlignedSecByteBlock; typedef SecBlock SecWordBlock; //! a SecBlock with fixed size, allocated statically template > class FixedSizeSecBlock : public SecBlock { public: explicit FixedSizeSecBlock() : SecBlock(S) {} }; template class FixedSizeAlignedSecBlock : public FixedSizeSecBlock, T_Align16> > { }; //! a SecBlock that preallocates size S statically, and uses the heap when this size is exceeded template > > class SecBlockWithHint : public SecBlock { public: explicit SecBlockWithHint(size_t size) : SecBlock(size) {} }; template inline bool operator==(const CryptoPP::AllocatorWithCleanup&, const CryptoPP::AllocatorWithCleanup&) {return (true);} template inline bool operator!=(const CryptoPP::AllocatorWithCleanup&, const CryptoPP::AllocatorWithCleanup&) {return (false);} NAMESPACE_END NAMESPACE_BEGIN(std) template inline void swap(CryptoPP::SecBlock &a, CryptoPP::SecBlock &b) { a.swap(b); } #if defined(_STLP_DONT_SUPPORT_REBIND_MEMBER_TEMPLATE) || (defined(_STLPORT_VERSION) && !defined(_STLP_MEMBER_TEMPLATE_CLASSES)) // working for STLport 5.1.3 and MSVC 6 SP5 template inline CryptoPP::AllocatorWithCleanup<_Tp2>& __stl_alloc_rebind(CryptoPP::AllocatorWithCleanup<_Tp1>& __a, const _Tp2*) { return (CryptoPP::AllocatorWithCleanup<_Tp2>&)(__a); } #endif NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/algebra.h0000755000000000000000000002133212414772654017345 0ustar rootroot#ifndef CRYPTOPP_ALGEBRA_H #define CRYPTOPP_ALGEBRA_H #include "config.h" NAMESPACE_BEGIN(CryptoPP) class Integer; // "const Element&" returned by member functions are references // to internal data members. Since each object may have only // one such data member for holding results, the following code // will produce incorrect results: // abcd = group.Add(group.Add(a,b), group.Add(c,d)); // But this should be fine: // abcd = group.Add(a, group.Add(b, group.Add(c,d)); //! Abstract Group template class CRYPTOPP_NO_VTABLE AbstractGroup { public: typedef T Element; virtual ~AbstractGroup() {} virtual bool Equal(const Element &a, const Element &b) const =0; virtual const Element& Identity() const =0; virtual const Element& Add(const Element &a, const Element &b) const =0; virtual const Element& Inverse(const Element &a) const =0; virtual bool InversionIsFast() const {return false;} virtual const Element& Double(const Element &a) const; virtual const Element& Subtract(const Element &a, const Element &b) const; virtual Element& Accumulate(Element &a, const Element &b) const; virtual Element& Reduce(Element &a, const Element &b) const; virtual Element ScalarMultiply(const Element &a, const Integer &e) const; virtual Element CascadeScalarMultiply(const Element &x, const Integer &e1, const Element &y, const Integer &e2) const; virtual void SimultaneousMultiply(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const; }; //! Abstract Ring template class CRYPTOPP_NO_VTABLE AbstractRing : public AbstractGroup { public: typedef T Element; AbstractRing() {m_mg.m_pRing = this;} AbstractRing(const AbstractRing &source) {m_mg.m_pRing = this;} AbstractRing& operator=(const AbstractRing &source) {return *this;} virtual bool IsUnit(const Element &a) const =0; virtual const Element& MultiplicativeIdentity() const =0; virtual const Element& Multiply(const Element &a, const Element &b) const =0; virtual const Element& MultiplicativeInverse(const Element &a) const =0; virtual const Element& Square(const Element &a) const; virtual const Element& Divide(const Element &a, const Element &b) const; virtual Element Exponentiate(const Element &a, const Integer &e) const; virtual Element CascadeExponentiate(const Element &x, const Integer &e1, const Element &y, const Integer &e2) const; virtual void SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const; virtual const AbstractGroup& MultiplicativeGroup() const {return m_mg;} private: class MultiplicativeGroupT : public AbstractGroup { public: const AbstractRing& GetRing() const {return *m_pRing;} bool Equal(const Element &a, const Element &b) const {return GetRing().Equal(a, b);} const Element& Identity() const {return GetRing().MultiplicativeIdentity();} const Element& Add(const Element &a, const Element &b) const {return GetRing().Multiply(a, b);} Element& Accumulate(Element &a, const Element &b) const {return a = GetRing().Multiply(a, b);} const Element& Inverse(const Element &a) const {return GetRing().MultiplicativeInverse(a);} const Element& Subtract(const Element &a, const Element &b) const {return GetRing().Divide(a, b);} Element& Reduce(Element &a, const Element &b) const {return a = GetRing().Divide(a, b);} const Element& Double(const Element &a) const {return GetRing().Square(a);} Element ScalarMultiply(const Element &a, const Integer &e) const {return GetRing().Exponentiate(a, e);} Element CascadeScalarMultiply(const Element &x, const Integer &e1, const Element &y, const Integer &e2) const {return GetRing().CascadeExponentiate(x, e1, y, e2);} void SimultaneousMultiply(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const {GetRing().SimultaneousExponentiate(results, base, exponents, exponentsCount);} const AbstractRing *m_pRing; }; MultiplicativeGroupT m_mg; }; // ******************************************************** //! Base and Exponent template struct BaseAndExponent { public: BaseAndExponent() {} BaseAndExponent(const T &base, const E &exponent) : base(base), exponent(exponent) {} bool operator<(const BaseAndExponent &rhs) const {return exponent < rhs.exponent;} T base; E exponent; }; // VC60 workaround: incomplete member template support template Element GeneralCascadeMultiplication(const AbstractGroup &group, Iterator begin, Iterator end); template Element GeneralCascadeExponentiation(const AbstractRing &ring, Iterator begin, Iterator end); // ******************************************************** //! Abstract Euclidean Domain template class CRYPTOPP_NO_VTABLE AbstractEuclideanDomain : public AbstractRing { public: typedef T Element; virtual void DivisionAlgorithm(Element &r, Element &q, const Element &a, const Element &d) const =0; virtual const Element& Mod(const Element &a, const Element &b) const =0; virtual const Element& Gcd(const Element &a, const Element &b) const; protected: mutable Element result; }; // ******************************************************** //! EuclideanDomainOf template class EuclideanDomainOf : public AbstractEuclideanDomain { public: typedef T Element; EuclideanDomainOf() {} bool Equal(const Element &a, const Element &b) const {return a==b;} const Element& Identity() const {return Element::Zero();} const Element& Add(const Element &a, const Element &b) const {return result = a+b;} Element& Accumulate(Element &a, const Element &b) const {return a+=b;} const Element& Inverse(const Element &a) const {return result = -a;} const Element& Subtract(const Element &a, const Element &b) const {return result = a-b;} Element& Reduce(Element &a, const Element &b) const {return a-=b;} const Element& Double(const Element &a) const {return result = a.Doubled();} const Element& MultiplicativeIdentity() const {return Element::One();} const Element& Multiply(const Element &a, const Element &b) const {return result = a*b;} const Element& Square(const Element &a) const {return result = a.Squared();} bool IsUnit(const Element &a) const {return a.IsUnit();} const Element& MultiplicativeInverse(const Element &a) const {return result = a.MultiplicativeInverse();} const Element& Divide(const Element &a, const Element &b) const {return result = a/b;} const Element& Mod(const Element &a, const Element &b) const {return result = a%b;} void DivisionAlgorithm(Element &r, Element &q, const Element &a, const Element &d) const {Element::Divide(r, q, a, d);} bool operator==(const EuclideanDomainOf &rhs) const {return true;} private: mutable Element result; }; //! Quotient Ring template class QuotientRing : public AbstractRing { public: typedef T EuclideanDomain; typedef typename T::Element Element; QuotientRing(const EuclideanDomain &domain, const Element &modulus) : m_domain(domain), m_modulus(modulus) {} const EuclideanDomain & GetDomain() const {return m_domain;} const Element& GetModulus() const {return m_modulus;} bool Equal(const Element &a, const Element &b) const {return m_domain.Equal(m_domain.Mod(m_domain.Subtract(a, b), m_modulus), m_domain.Identity());} const Element& Identity() const {return m_domain.Identity();} const Element& Add(const Element &a, const Element &b) const {return m_domain.Add(a, b);} Element& Accumulate(Element &a, const Element &b) const {return m_domain.Accumulate(a, b);} const Element& Inverse(const Element &a) const {return m_domain.Inverse(a);} const Element& Subtract(const Element &a, const Element &b) const {return m_domain.Subtract(a, b);} Element& Reduce(Element &a, const Element &b) const {return m_domain.Reduce(a, b);} const Element& Double(const Element &a) const {return m_domain.Double(a);} bool IsUnit(const Element &a) const {return m_domain.IsUnit(m_domain.Gcd(a, m_modulus));} const Element& MultiplicativeIdentity() const {return m_domain.MultiplicativeIdentity();} const Element& Multiply(const Element &a, const Element &b) const {return m_domain.Mod(m_domain.Multiply(a, b), m_modulus);} const Element& Square(const Element &a) const {return m_domain.Mod(m_domain.Square(a), m_modulus);} const Element& MultiplicativeInverse(const Element &a) const; bool operator==(const QuotientRing &rhs) const {return m_domain == rhs.m_domain && m_modulus == rhs.m_modulus;} protected: EuclideanDomain m_domain; Element m_modulus; }; NAMESPACE_END #ifdef CRYPTOPP_MANUALLY_INSTANTIATE_TEMPLATES #include "algebra.cpp" #endif #endif armory-0.92.3/cppForSwig/cryptopp/ttmac.h0000755000000000000000000000223012414772654017054 0ustar rootroot// ttmac.h - written and placed in the public domain by Kevin Springle #ifndef CRYPTOPP_TTMAC_H #define CRYPTOPP_TTMAC_H #include "seckey.h" #include "iterhash.h" NAMESPACE_BEGIN(CryptoPP) //! _ class CRYPTOPP_NO_VTABLE TTMAC_Base : public FixedKeyLength<20>, public IteratedHash { public: static std::string StaticAlgorithmName() {return std::string("Two-Track-MAC");} CRYPTOPP_CONSTANT(DIGESTSIZE=20) unsigned int DigestSize() const {return DIGESTSIZE;}; void UncheckedSetKey(const byte *userKey, unsigned int keylength, const NameValuePairs ¶ms); void TruncatedFinal(byte *mac, size_t size); protected: static void Transform (word32 *digest, const word32 *X, bool last); void HashEndianCorrectedBlock(const word32 *data) {Transform(m_digest, data, false);} void Init(); word32* StateBuf() {return m_digest;} FixedSizeSecBlock m_digest; FixedSizeSecBlock m_key; }; //! Two-Track-MAC /*! 160 Bit MAC with 160 Bit Key */ DOCUMENTED_TYPEDEF(MessageAuthenticationCodeFinal, TTMAC) NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/polynomi.cpp0000755000000000000000000003357312414772654020163 0ustar rootroot// polynomi.cpp - written and placed in the public domain by Wei Dai // Part of the code for polynomial evaluation and interpolation // originally came from Hal Finney's public domain secsplit.c. #include "pch.h" #include "polynomi.h" #include "secblock.h" #include #include NAMESPACE_BEGIN(CryptoPP) template void PolynomialOver::Randomize(RandomNumberGenerator &rng, const RandomizationParameter ¶meter, const Ring &ring) { m_coefficients.resize(parameter.m_coefficientCount); for (unsigned int i=0; i void PolynomialOver::FromStr(const char *str, const Ring &ring) { std::istringstream in((char *)str); bool positive = true; CoefficientType coef; unsigned int power; while (in) { std::ws(in); if (in.peek() == 'x') coef = ring.MultiplicativeIdentity(); else in >> coef; std::ws(in); if (in.peek() == 'x') { in.get(); std::ws(in); if (in.peek() == '^') { in.get(); in >> power; } else power = 1; } else power = 0; if (!positive) coef = ring.Inverse(coef); SetCoefficient(power, coef, ring); std::ws(in); switch (in.get()) { case '+': positive = true; break; case '-': positive = false; break; default: return; // something's wrong with the input string } } } template unsigned int PolynomialOver::CoefficientCount(const Ring &ring) const { unsigned count = m_coefficients.size(); while (count && ring.Equal(m_coefficients[count-1], ring.Identity())) count--; const_cast &>(m_coefficients).resize(count); return count; } template typename PolynomialOver::CoefficientType PolynomialOver::GetCoefficient(unsigned int i, const Ring &ring) const { return (i < m_coefficients.size()) ? m_coefficients[i] : ring.Identity(); } template PolynomialOver& PolynomialOver::operator=(const PolynomialOver& t) { if (this != &t) { m_coefficients.resize(t.m_coefficients.size()); for (unsigned int i=0; i PolynomialOver& PolynomialOver::Accumulate(const PolynomialOver& t, const Ring &ring) { unsigned int count = t.CoefficientCount(ring); if (count > CoefficientCount(ring)) m_coefficients.resize(count, ring.Identity()); for (unsigned int i=0; i PolynomialOver& PolynomialOver::Reduce(const PolynomialOver& t, const Ring &ring) { unsigned int count = t.CoefficientCount(ring); if (count > CoefficientCount(ring)) m_coefficients.resize(count, ring.Identity()); for (unsigned int i=0; i typename PolynomialOver::CoefficientType PolynomialOver::EvaluateAt(const CoefficientType &x, const Ring &ring) const { int degree = Degree(ring); if (degree < 0) return ring.Identity(); CoefficientType result = m_coefficients[degree]; for (int j=degree-1; j>=0; j--) { result = ring.Multiply(result, x); ring.Accumulate(result, m_coefficients[j]); } return result; } template PolynomialOver& PolynomialOver::ShiftLeft(unsigned int n, const Ring &ring) { unsigned int i = CoefficientCount(ring) + n; m_coefficients.resize(i, ring.Identity()); while (i > n) { i--; m_coefficients[i] = m_coefficients[i-n]; } while (i) { i--; m_coefficients[i] = ring.Identity(); } return *this; } template PolynomialOver& PolynomialOver::ShiftRight(unsigned int n, const Ring &ring) { unsigned int count = CoefficientCount(ring); if (count > n) { for (unsigned int i=0; i void PolynomialOver::SetCoefficient(unsigned int i, const CoefficientType &value, const Ring &ring) { if (i >= m_coefficients.size()) m_coefficients.resize(i+1, ring.Identity()); m_coefficients[i] = value; } template void PolynomialOver::Negate(const Ring &ring) { unsigned int count = CoefficientCount(ring); for (unsigned int i=0; i void PolynomialOver::swap(PolynomialOver &t) { m_coefficients.swap(t.m_coefficients); } template bool PolynomialOver::Equals(const PolynomialOver& t, const Ring &ring) const { unsigned int count = CoefficientCount(ring); if (count != t.CoefficientCount(ring)) return false; for (unsigned int i=0; i PolynomialOver PolynomialOver::Plus(const PolynomialOver& t, const Ring &ring) const { unsigned int i; unsigned int count = CoefficientCount(ring); unsigned int tCount = t.CoefficientCount(ring); if (count > tCount) { PolynomialOver result(ring, count); for (i=0; i result(ring, tCount); for (i=0; i PolynomialOver PolynomialOver::Minus(const PolynomialOver& t, const Ring &ring) const { unsigned int i; unsigned int count = CoefficientCount(ring); unsigned int tCount = t.CoefficientCount(ring); if (count > tCount) { PolynomialOver result(ring, count); for (i=0; i result(ring, tCount); for (i=0; i PolynomialOver PolynomialOver::Inverse(const Ring &ring) const { unsigned int count = CoefficientCount(ring); PolynomialOver result(ring, count); for (unsigned int i=0; i PolynomialOver PolynomialOver::Times(const PolynomialOver& t, const Ring &ring) const { if (IsZero(ring) || t.IsZero(ring)) return PolynomialOver(); unsigned int count1 = CoefficientCount(ring), count2 = t.CoefficientCount(ring); PolynomialOver result(ring, count1 + count2 - 1); for (unsigned int i=0; i PolynomialOver PolynomialOver::DividedBy(const PolynomialOver& t, const Ring &ring) const { PolynomialOver remainder, quotient; Divide(remainder, quotient, *this, t, ring); return quotient; } template PolynomialOver PolynomialOver::Modulo(const PolynomialOver& t, const Ring &ring) const { PolynomialOver remainder, quotient; Divide(remainder, quotient, *this, t, ring); return remainder; } template PolynomialOver PolynomialOver::MultiplicativeInverse(const Ring &ring) const { return Degree(ring)==0 ? ring.MultiplicativeInverse(m_coefficients[0]) : ring.Identity(); } template bool PolynomialOver::IsUnit(const Ring &ring) const { return Degree(ring)==0 && ring.IsUnit(m_coefficients[0]); } template std::istream& PolynomialOver::Input(std::istream &in, const Ring &ring) { char c; unsigned int length = 0; SecBlock str(length + 16); bool paren = false; std::ws(in); if (in.peek() == '(') { paren = true; in.get(); } do { in.read(&c, 1); str[length++] = c; if (length >= str.size()) str.Grow(length + 16); } // if we started with a left paren, then read until we find a right paren, // otherwise read until the end of the line while (in && ((paren && c != ')') || (!paren && c != '\n'))); str[length-1] = '\0'; *this = PolynomialOver(str, ring); return in; } template std::ostream& PolynomialOver::Output(std::ostream &out, const Ring &ring) const { unsigned int i = CoefficientCount(ring); if (i) { bool firstTerm = true; while (i--) { if (m_coefficients[i] != ring.Identity()) { if (firstTerm) { firstTerm = false; if (!i || !ring.Equal(m_coefficients[i], ring.MultiplicativeIdentity())) out << m_coefficients[i]; } else { CoefficientType inverse = ring.Inverse(m_coefficients[i]); std::ostringstream pstr, nstr; pstr << m_coefficients[i]; nstr << inverse; if (pstr.str().size() <= nstr.str().size()) { out << " + "; if (!i || !ring.Equal(m_coefficients[i], ring.MultiplicativeIdentity())) out << m_coefficients[i]; } else { out << " - "; if (!i || !ring.Equal(inverse, ring.MultiplicativeIdentity())) out << inverse; } } switch (i) { case 0: break; case 1: out << "x"; break; default: out << "x^" << i; } } } } else { out << ring.Identity(); } return out; } template void PolynomialOver::Divide(PolynomialOver &r, PolynomialOver &q, const PolynomialOver &a, const PolynomialOver &d, const Ring &ring) { unsigned int i = a.CoefficientCount(ring); const int dDegree = d.Degree(ring); if (dDegree < 0) throw DivideByZero(); r = a; q.m_coefficients.resize(STDMAX(0, int(i - dDegree))); while (i > (unsigned int)dDegree) { --i; q.m_coefficients[i-dDegree] = ring.Divide(r.m_coefficients[i], d.m_coefficients[dDegree]); for (int j=0; j<=dDegree; j++) ring.Reduce(r.m_coefficients[i-dDegree+j], ring.Multiply(q.m_coefficients[i-dDegree], d.m_coefficients[j])); } r.CoefficientCount(ring); // resize r.m_coefficients } // ******************************************************** // helper function for Interpolate() and InterpolateAt() template void RingOfPolynomialsOver::CalculateAlpha(std::vector &alpha, const CoefficientType x[], const CoefficientType y[], unsigned int n) const { for (unsigned int j=0; j=k; --j) { m_ring.Reduce(alpha[j], alpha[j-1]); CoefficientType d = m_ring.Subtract(x[j], x[j-k]); if (!m_ring.IsUnit(d)) throw InterpolationFailed(); alpha[j] = m_ring.Divide(alpha[j], d); } } } template typename RingOfPolynomialsOver::Element RingOfPolynomialsOver::Interpolate(const CoefficientType x[], const CoefficientType y[], unsigned int n) const { assert(n > 0); std::vector alpha(n); CalculateAlpha(alpha, x, y, n); std::vector coefficients((size_t)n, m_ring.Identity()); coefficients[0] = alpha[n-1]; for (int j=n-2; j>=0; --j) { for (unsigned int i=n-j-1; i>0; i--) coefficients[i] = m_ring.Subtract(coefficients[i-1], m_ring.Multiply(coefficients[i], x[j])); coefficients[0] = m_ring.Subtract(alpha[j], m_ring.Multiply(coefficients[0], x[j])); } return PolynomialOver(coefficients.begin(), coefficients.end()); } template typename RingOfPolynomialsOver::CoefficientType RingOfPolynomialsOver::InterpolateAt(const CoefficientType &position, const CoefficientType x[], const CoefficientType y[], unsigned int n) const { assert(n > 0); std::vector alpha(n); CalculateAlpha(alpha, x, y, n); CoefficientType result = alpha[n-1]; for (int j=n-2; j>=0; --j) { result = m_ring.Multiply(result, m_ring.Subtract(position, x[j])); m_ring.Accumulate(result, alpha[j]); } return result; } template void PrepareBulkPolynomialInterpolation(const Ring &ring, Element *w, const Element x[], unsigned int n) { for (unsigned int i=0; i void PrepareBulkPolynomialInterpolationAt(const Ring &ring, Element *v, const Element &position, const Element x[], const Element w[], unsigned int n) { assert(n > 0); std::vector a(2*n-1); unsigned int i; for (i=0; i1; i--) a[i-1] = ring.Multiply(a[2*i], a[2*i-1]); a[0] = ring.MultiplicativeIdentity(); for (i=0; i Element BulkPolynomialInterpolateAt(const Ring &ring, const Element y[], const Element v[], unsigned int n) { Element result = ring.Identity(); for (unsigned int i=0; i const PolynomialOverFixedRing &PolynomialOverFixedRing::Zero() { return Singleton().Ref(); } template const PolynomialOverFixedRing &PolynomialOverFixedRing::One() { return Singleton().Ref(); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/files.h0000755000000000000000000001065612414772654017061 0ustar rootroot#ifndef CRYPTOPP_FILES_H #define CRYPTOPP_FILES_H #include "cryptlib.h" #include "filters.h" #include "argnames.h" #include #include NAMESPACE_BEGIN(CryptoPP) //! file-based implementation of Store interface class CRYPTOPP_DLL FileStore : public Store, private FilterPutSpaceHelper, public NotCopyable { public: class Err : public Exception { public: Err(const std::string &s) : Exception(IO_ERROR, s) {} }; class OpenErr : public Err {public: OpenErr(const std::string &filename) : Err("FileStore: error opening file for reading: " + filename) {}}; class ReadErr : public Err {public: ReadErr() : Err("FileStore: error reading file") {}}; FileStore() : m_stream(NULL) {} FileStore(std::istream &in) {StoreInitialize(MakeParameters(Name::InputStreamPointer(), &in));} FileStore(const char *filename) {StoreInitialize(MakeParameters(Name::InputFileName(), filename));} #if defined(CRYPTOPP_UNIX_AVAILABLE) || _MSC_VER >= 1400 //! specify file with Unicode name. On non-Windows OS, this function assumes that setlocale() has been called. FileStore(const wchar_t *filename) {StoreInitialize(MakeParameters(Name::InputFileNameWide(), filename));} #endif std::istream* GetStream() {return m_stream;} lword MaxRetrievable() const; size_t TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true); size_t CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) const; lword Skip(lword skipMax=ULONG_MAX); private: void StoreInitialize(const NameValuePairs ¶meters); member_ptr m_file; std::istream *m_stream; byte *m_space; size_t m_len; bool m_waiting; }; //! file-based implementation of Source interface class CRYPTOPP_DLL FileSource : public SourceTemplate { public: typedef FileStore::Err Err; typedef FileStore::OpenErr OpenErr; typedef FileStore::ReadErr ReadErr; FileSource(BufferedTransformation *attachment = NULL) : SourceTemplate(attachment) {} FileSource(std::istream &in, bool pumpAll, BufferedTransformation *attachment = NULL) : SourceTemplate(attachment) {SourceInitialize(pumpAll, MakeParameters(Name::InputStreamPointer(), &in));} FileSource(const char *filename, bool pumpAll, BufferedTransformation *attachment = NULL, bool binary=true) : SourceTemplate(attachment) {SourceInitialize(pumpAll, MakeParameters(Name::InputFileName(), filename)(Name::InputBinaryMode(), binary));} #if defined(CRYPTOPP_UNIX_AVAILABLE) || _MSC_VER >= 1400 //! specify file with Unicode name. On non-Windows OS, this function assumes that setlocale() has been called. FileSource(const wchar_t *filename, bool pumpAll, BufferedTransformation *attachment = NULL, bool binary=true) : SourceTemplate(attachment) {SourceInitialize(pumpAll, MakeParameters(Name::InputFileNameWide(), filename)(Name::InputBinaryMode(), binary));} #endif std::istream* GetStream() {return m_store.GetStream();} }; //! file-based implementation of Sink interface class CRYPTOPP_DLL FileSink : public Sink, public NotCopyable { public: class Err : public Exception { public: Err(const std::string &s) : Exception(IO_ERROR, s) {} }; class OpenErr : public Err {public: OpenErr(const std::string &filename) : Err("FileSink: error opening file for writing: " + filename) {}}; class WriteErr : public Err {public: WriteErr() : Err("FileSink: error writing file") {}}; FileSink() : m_stream(NULL) {} FileSink(std::ostream &out) {IsolatedInitialize(MakeParameters(Name::OutputStreamPointer(), &out));} FileSink(const char *filename, bool binary=true) {IsolatedInitialize(MakeParameters(Name::OutputFileName(), filename)(Name::OutputBinaryMode(), binary));} #if defined(CRYPTOPP_UNIX_AVAILABLE) || _MSC_VER >= 1400 //! specify file with Unicode name. On non-Windows OS, this function assumes that setlocale() has been called. FileSink(const wchar_t *filename, bool binary=true) {IsolatedInitialize(MakeParameters(Name::OutputFileNameWide(), filename)(Name::OutputBinaryMode(), binary));} #endif std::ostream* GetStream() {return m_stream;} void IsolatedInitialize(const NameValuePairs ¶meters); size_t Put2(const byte *inString, size_t length, int messageEnd, bool blocking); bool IsolatedFlush(bool hardFlush, bool blocking); private: member_ptr m_file; std::ostream *m_stream; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/sha.cpp0000755000000000000000000006223412414772654017064 0ustar rootroot// sha.cpp - modified by Wei Dai from Steve Reid's public domain sha1.c // Steve Reid implemented SHA-1. Wei Dai implemented SHA-2. // Both are in the public domain. // use "cl /EP /P /DCRYPTOPP_GENERATE_X64_MASM sha.cpp" to generate MASM code #include "pch.h" #ifndef CRYPTOPP_IMPORTS #ifndef CRYPTOPP_GENERATE_X64_MASM #include "sha.h" #include "misc.h" #include "cpu.h" NAMESPACE_BEGIN(CryptoPP) // start of Steve Reid's code #define blk0(i) (W[i] = data[i]) #define blk1(i) (W[i&15] = rotlFixed(W[(i+13)&15]^W[(i+8)&15]^W[(i+2)&15]^W[i&15],1)) void SHA1::InitState(HashWordType *state) { state[0] = 0x67452301L; state[1] = 0xEFCDAB89L; state[2] = 0x98BADCFEL; state[3] = 0x10325476L; state[4] = 0xC3D2E1F0L; } #define f1(x,y,z) (z^(x&(y^z))) #define f2(x,y,z) (x^y^z) #define f3(x,y,z) ((x&y)|(z&(x|y))) #define f4(x,y,z) (x^y^z) /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ #define R0(v,w,x,y,z,i) z+=f1(w,x,y)+blk0(i)+0x5A827999+rotlFixed(v,5);w=rotlFixed(w,30); #define R1(v,w,x,y,z,i) z+=f1(w,x,y)+blk1(i)+0x5A827999+rotlFixed(v,5);w=rotlFixed(w,30); #define R2(v,w,x,y,z,i) z+=f2(w,x,y)+blk1(i)+0x6ED9EBA1+rotlFixed(v,5);w=rotlFixed(w,30); #define R3(v,w,x,y,z,i) z+=f3(w,x,y)+blk1(i)+0x8F1BBCDC+rotlFixed(v,5);w=rotlFixed(w,30); #define R4(v,w,x,y,z,i) z+=f4(w,x,y)+blk1(i)+0xCA62C1D6+rotlFixed(v,5);w=rotlFixed(w,30); void SHA1::Transform(word32 *state, const word32 *data) { word32 W[16]; /* Copy context->state[] to working vars */ word32 a = state[0]; word32 b = state[1]; word32 c = state[2]; word32 d = state[3]; word32 e = state[4]; /* 4 rounds of 20 operations each. Loop unrolled. */ R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3); R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7); R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11); R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15); R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19); R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23); R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27); R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31); R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35); R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39); R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43); R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47); R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51); R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55); R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59); R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63); R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67); R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71); R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75); R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79); /* Add the working vars back into context.state[] */ state[0] += a; state[1] += b; state[2] += c; state[3] += d; state[4] += e; } // end of Steve Reid's code // ************************************************************* void SHA224::InitState(HashWordType *state) { static const word32 s[8] = {0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4}; memcpy(state, s, sizeof(s)); } void SHA256::InitState(HashWordType *state) { static const word32 s[8] = {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19}; memcpy(state, s, sizeof(s)); } #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE CRYPTOPP_ALIGN_DATA(16) extern const word32 SHA256_K[64] CRYPTOPP_SECTION_ALIGN16 = { #else extern const word32 SHA256_K[64] = { #endif 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2 }; #endif // #ifndef CRYPTOPP_GENERATE_X64_MASM #if defined(CRYPTOPP_X86_ASM_AVAILABLE) || defined(CRYPTOPP_GENERATE_X64_MASM) #pragma warning(disable: 4731) // frame pointer register 'ebp' modified by inline assembly code static void CRYPTOPP_FASTCALL X86_SHA256_HashBlocks(word32 *state, const word32 *data, size_t len #if defined(_MSC_VER) && (_MSC_VER == 1200) , ... // VC60 workaround: prevent VC 6 from inlining this function #endif ) { #if defined(_MSC_VER) && (_MSC_VER == 1200) AS2(mov ecx, [state]) AS2(mov edx, [data]) #endif #define LOCALS_SIZE 8*4 + 16*4 + 4*WORD_SZ #define H(i) [BASE+ASM_MOD(1024+7-(i),8)*4] #define G(i) H(i+1) #define F(i) H(i+2) #define E(i) H(i+3) #define D(i) H(i+4) #define C(i) H(i+5) #define B(i) H(i+6) #define A(i) H(i+7) #define Wt(i) BASE+8*4+ASM_MOD(1024+15-(i),16)*4 #define Wt_2(i) Wt((i)-2) #define Wt_15(i) Wt((i)-15) #define Wt_7(i) Wt((i)-7) #define K_END [BASE+8*4+16*4+0*WORD_SZ] #define STATE_SAVE [BASE+8*4+16*4+1*WORD_SZ] #define DATA_SAVE [BASE+8*4+16*4+2*WORD_SZ] #define DATA_END [BASE+8*4+16*4+3*WORD_SZ] #define Kt(i) WORD_REG(si)+(i)*4 #if CRYPTOPP_BOOL_X86 #define BASE esp+4 #elif defined(__GNUC__) #define BASE r8 #else #define BASE rsp #endif #define RA0(i, edx, edi) \ AS2( add edx, [Kt(i)] )\ AS2( add edx, [Wt(i)] )\ AS2( add edx, H(i) )\ #define RA1(i, edx, edi) #define RB0(i, edx, edi) #define RB1(i, edx, edi) \ AS2( mov AS_REG_7d, [Wt_2(i)] )\ AS2( mov edi, [Wt_15(i)])\ AS2( mov ebx, AS_REG_7d )\ AS2( shr AS_REG_7d, 10 )\ AS2( ror ebx, 17 )\ AS2( xor AS_REG_7d, ebx )\ AS2( ror ebx, 2 )\ AS2( xor ebx, AS_REG_7d )/* s1(W_t-2) */\ AS2( add ebx, [Wt_7(i)])\ AS2( mov AS_REG_7d, edi )\ AS2( shr AS_REG_7d, 3 )\ AS2( ror edi, 7 )\ AS2( add ebx, [Wt(i)])/* s1(W_t-2) + W_t-7 + W_t-16 */\ AS2( xor AS_REG_7d, edi )\ AS2( add edx, [Kt(i)])\ AS2( ror edi, 11 )\ AS2( add edx, H(i) )\ AS2( xor AS_REG_7d, edi )/* s0(W_t-15) */\ AS2( add AS_REG_7d, ebx )/* W_t = s1(W_t-2) + W_t-7 + s0(W_t-15) W_t-16*/\ AS2( mov [Wt(i)], AS_REG_7d)\ AS2( add edx, AS_REG_7d )\ #define ROUND(i, r, eax, ecx, edi, edx)\ /* in: edi = E */\ /* unused: eax, ecx, temp: ebx, AS_REG_7d, out: edx = T1 */\ AS2( mov edx, F(i) )\ AS2( xor edx, G(i) )\ AS2( and edx, edi )\ AS2( xor edx, G(i) )/* Ch(E,F,G) = (G^(E&(F^G))) */\ AS2( mov AS_REG_7d, edi )\ AS2( ror edi, 6 )\ AS2( ror AS_REG_7d, 25 )\ RA##r(i, edx, edi )/* H + Wt + Kt + Ch(E,F,G) */\ AS2( xor AS_REG_7d, edi )\ AS2( ror edi, 5 )\ AS2( xor AS_REG_7d, edi )/* S1(E) */\ AS2( add edx, AS_REG_7d )/* T1 = S1(E) + Ch(E,F,G) + H + Wt + Kt */\ RB##r(i, edx, edi )/* H + Wt + Kt + Ch(E,F,G) */\ /* in: ecx = A, eax = B^C, edx = T1 */\ /* unused: edx, temp: ebx, AS_REG_7d, out: eax = A, ecx = B^C, edx = E */\ AS2( mov ebx, ecx )\ AS2( xor ecx, B(i) )/* A^B */\ AS2( and eax, ecx )\ AS2( xor eax, B(i) )/* Maj(A,B,C) = B^((A^B)&(B^C) */\ AS2( mov AS_REG_7d, ebx )\ AS2( ror ebx, 2 )\ AS2( add eax, edx )/* T1 + Maj(A,B,C) */\ AS2( add edx, D(i) )\ AS2( mov D(i), edx )\ AS2( ror AS_REG_7d, 22 )\ AS2( xor AS_REG_7d, ebx )\ AS2( ror ebx, 11 )\ AS2( xor AS_REG_7d, ebx )\ AS2( add eax, AS_REG_7d )/* T1 + S0(A) + Maj(A,B,C) */\ AS2( mov H(i), eax )\ #define SWAP_COPY(i) \ AS2( mov WORD_REG(bx), [WORD_REG(dx)+i*WORD_SZ])\ AS1( bswap WORD_REG(bx))\ AS2( mov [Wt(i*(1+CRYPTOPP_BOOL_X64)+CRYPTOPP_BOOL_X64)], WORD_REG(bx)) #if defined(__GNUC__) #if CRYPTOPP_BOOL_X64 FixedSizeAlignedSecBlock workspace; #endif __asm__ __volatile__ ( #if CRYPTOPP_BOOL_X64 "lea %4, %%r8;" #endif ".intel_syntax noprefix;" #elif defined(CRYPTOPP_GENERATE_X64_MASM) ALIGN 8 X86_SHA256_HashBlocks PROC FRAME rex_push_reg rsi push_reg rdi push_reg rbx push_reg rbp alloc_stack(LOCALS_SIZE+8) .endprolog mov rdi, r8 lea rsi, [?SHA256_K@CryptoPP@@3QBIB + 48*4] #endif #if CRYPTOPP_BOOL_X86 #ifndef __GNUC__ AS2( mov edi, [len]) AS2( lea WORD_REG(si), [SHA256_K+48*4]) #endif #if !defined(_MSC_VER) || (_MSC_VER < 1400) AS_PUSH_IF86(bx) #endif AS_PUSH_IF86(bp) AS2( mov ebx, esp) AS2( and esp, -16) AS2( sub WORD_REG(sp), LOCALS_SIZE) AS_PUSH_IF86(bx) #endif AS2( mov STATE_SAVE, WORD_REG(cx)) AS2( mov DATA_SAVE, WORD_REG(dx)) AS2( lea WORD_REG(ax), [WORD_REG(di) + WORD_REG(dx)]) AS2( mov DATA_END, WORD_REG(ax)) AS2( mov K_END, WORD_REG(si)) #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE #if CRYPTOPP_BOOL_X86 AS2( test edi, 1) ASJ( jnz, 2, f) AS1( dec DWORD PTR K_END) #endif AS2( movdqa xmm0, XMMWORD_PTR [WORD_REG(cx)+0*16]) AS2( movdqa xmm1, XMMWORD_PTR [WORD_REG(cx)+1*16]) #endif #if CRYPTOPP_BOOL_X86 #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE ASJ( jmp, 0, f) #endif ASL(2) // non-SSE2 AS2( mov esi, ecx) AS2( lea edi, A(0)) AS2( mov ecx, 8) AS1( rep movsd) AS2( mov esi, K_END) ASJ( jmp, 3, f) #endif #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE ASL(0) AS2( movdqa E(0), xmm1) AS2( movdqa A(0), xmm0) #endif #if CRYPTOPP_BOOL_X86 ASL(3) #endif AS2( sub WORD_REG(si), 48*4) SWAP_COPY(0) SWAP_COPY(1) SWAP_COPY(2) SWAP_COPY(3) SWAP_COPY(4) SWAP_COPY(5) SWAP_COPY(6) SWAP_COPY(7) #if CRYPTOPP_BOOL_X86 SWAP_COPY(8) SWAP_COPY(9) SWAP_COPY(10) SWAP_COPY(11) SWAP_COPY(12) SWAP_COPY(13) SWAP_COPY(14) SWAP_COPY(15) #endif AS2( mov edi, E(0)) // E AS2( mov eax, B(0)) // B AS2( xor eax, C(0)) // B^C AS2( mov ecx, A(0)) // A ROUND(0, 0, eax, ecx, edi, edx) ROUND(1, 0, ecx, eax, edx, edi) ROUND(2, 0, eax, ecx, edi, edx) ROUND(3, 0, ecx, eax, edx, edi) ROUND(4, 0, eax, ecx, edi, edx) ROUND(5, 0, ecx, eax, edx, edi) ROUND(6, 0, eax, ecx, edi, edx) ROUND(7, 0, ecx, eax, edx, edi) ROUND(8, 0, eax, ecx, edi, edx) ROUND(9, 0, ecx, eax, edx, edi) ROUND(10, 0, eax, ecx, edi, edx) ROUND(11, 0, ecx, eax, edx, edi) ROUND(12, 0, eax, ecx, edi, edx) ROUND(13, 0, ecx, eax, edx, edi) ROUND(14, 0, eax, ecx, edi, edx) ROUND(15, 0, ecx, eax, edx, edi) ASL(1) AS2(add WORD_REG(si), 4*16) ROUND(0, 1, eax, ecx, edi, edx) ROUND(1, 1, ecx, eax, edx, edi) ROUND(2, 1, eax, ecx, edi, edx) ROUND(3, 1, ecx, eax, edx, edi) ROUND(4, 1, eax, ecx, edi, edx) ROUND(5, 1, ecx, eax, edx, edi) ROUND(6, 1, eax, ecx, edi, edx) ROUND(7, 1, ecx, eax, edx, edi) ROUND(8, 1, eax, ecx, edi, edx) ROUND(9, 1, ecx, eax, edx, edi) ROUND(10, 1, eax, ecx, edi, edx) ROUND(11, 1, ecx, eax, edx, edi) ROUND(12, 1, eax, ecx, edi, edx) ROUND(13, 1, ecx, eax, edx, edi) ROUND(14, 1, eax, ecx, edi, edx) ROUND(15, 1, ecx, eax, edx, edi) AS2( cmp WORD_REG(si), K_END) ASJ( jb, 1, b) AS2( mov WORD_REG(dx), DATA_SAVE) AS2( add WORD_REG(dx), 64) AS2( mov AS_REG_7, STATE_SAVE) AS2( mov DATA_SAVE, WORD_REG(dx)) #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE #if CRYPTOPP_BOOL_X86 AS2( test DWORD PTR K_END, 1) ASJ( jz, 4, f) #endif AS2( movdqa xmm1, XMMWORD_PTR [AS_REG_7+1*16]) AS2( movdqa xmm0, XMMWORD_PTR [AS_REG_7+0*16]) AS2( paddd xmm1, E(0)) AS2( paddd xmm0, A(0)) AS2( movdqa [AS_REG_7+1*16], xmm1) AS2( movdqa [AS_REG_7+0*16], xmm0) AS2( cmp WORD_REG(dx), DATA_END) ASJ( jb, 0, b) #endif #if CRYPTOPP_BOOL_X86 #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE ASJ( jmp, 5, f) ASL(4) // non-SSE2 #endif AS2( add [AS_REG_7+0*4], ecx) // A AS2( add [AS_REG_7+4*4], edi) // E AS2( mov eax, B(0)) AS2( mov ebx, C(0)) AS2( mov ecx, D(0)) AS2( add [AS_REG_7+1*4], eax) AS2( add [AS_REG_7+2*4], ebx) AS2( add [AS_REG_7+3*4], ecx) AS2( mov eax, F(0)) AS2( mov ebx, G(0)) AS2( mov ecx, H(0)) AS2( add [AS_REG_7+5*4], eax) AS2( add [AS_REG_7+6*4], ebx) AS2( add [AS_REG_7+7*4], ecx) AS2( mov ecx, AS_REG_7d) AS2( cmp WORD_REG(dx), DATA_END) ASJ( jb, 2, b) #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE ASL(5) #endif #endif AS_POP_IF86(sp) AS_POP_IF86(bp) #if !defined(_MSC_VER) || (_MSC_VER < 1400) AS_POP_IF86(bx) #endif #ifdef CRYPTOPP_GENERATE_X64_MASM add rsp, LOCALS_SIZE+8 pop rbp pop rbx pop rdi pop rsi ret X86_SHA256_HashBlocks ENDP #endif #ifdef __GNUC__ ".att_syntax prefix;" : : "c" (state), "d" (data), "S" (SHA256_K+48), "D" (len) #if CRYPTOPP_BOOL_X64 , "m" (workspace[0]) #endif : "memory", "cc", "%eax" #if CRYPTOPP_BOOL_X64 , "%rbx", "%r8", "%r10" #endif ); #endif } #endif // #if defined(CRYPTOPP_X86_ASM_AVAILABLE) || defined(CRYPTOPP_GENERATE_X64_MASM) #ifndef CRYPTOPP_GENERATE_X64_MASM #ifdef CRYPTOPP_X64_MASM_AVAILABLE extern "C" { void CRYPTOPP_FASTCALL X86_SHA256_HashBlocks(word32 *state, const word32 *data, size_t len); } #endif #if defined(CRYPTOPP_X86_ASM_AVAILABLE) || defined(CRYPTOPP_X64_MASM_AVAILABLE) size_t SHA256::HashMultipleBlocks(const word32 *input, size_t length) { X86_SHA256_HashBlocks(m_state, input, (length&(size_t(0)-BLOCKSIZE)) - !HasSSE2()); return length % BLOCKSIZE; } size_t SHA224::HashMultipleBlocks(const word32 *input, size_t length) { X86_SHA256_HashBlocks(m_state, input, (length&(size_t(0)-BLOCKSIZE)) - !HasSSE2()); return length % BLOCKSIZE; } #endif #define blk2(i) (W[i&15]+=s1(W[(i-2)&15])+W[(i-7)&15]+s0(W[(i-15)&15])) #define Ch(x,y,z) (z^(x&(y^z))) #define Maj(x,y,z) (y^((x^y)&(y^z))) #define a(i) T[(0-i)&7] #define b(i) T[(1-i)&7] #define c(i) T[(2-i)&7] #define d(i) T[(3-i)&7] #define e(i) T[(4-i)&7] #define f(i) T[(5-i)&7] #define g(i) T[(6-i)&7] #define h(i) T[(7-i)&7] #define R(i) h(i)+=S1(e(i))+Ch(e(i),f(i),g(i))+SHA256_K[i+j]+(j?blk2(i):blk0(i));\ d(i)+=h(i);h(i)+=S0(a(i))+Maj(a(i),b(i),c(i)) // for SHA256 #define S0(x) (rotrFixed(x,2)^rotrFixed(x,13)^rotrFixed(x,22)) #define S1(x) (rotrFixed(x,6)^rotrFixed(x,11)^rotrFixed(x,25)) #define s0(x) (rotrFixed(x,7)^rotrFixed(x,18)^(x>>3)) #define s1(x) (rotrFixed(x,17)^rotrFixed(x,19)^(x>>10)) void SHA256::Transform(word32 *state, const word32 *data) { word32 W[16]; #if defined(CRYPTOPP_X86_ASM_AVAILABLE) || defined(CRYPTOPP_X64_MASM_AVAILABLE) // this byte reverse is a waste of time, but this function is only called by MDC ByteReverse(W, data, BLOCKSIZE); X86_SHA256_HashBlocks(state, W, BLOCKSIZE - !HasSSE2()); #else word32 T[8]; /* Copy context->state[] to working vars */ memcpy(T, state, sizeof(T)); /* 64 operations, partially loop unrolled */ for (unsigned int j=0; j<64; j+=16) { R( 0); R( 1); R( 2); R( 3); R( 4); R( 5); R( 6); R( 7); R( 8); R( 9); R(10); R(11); R(12); R(13); R(14); R(15); } /* Add the working vars back into context.state[] */ state[0] += a(0); state[1] += b(0); state[2] += c(0); state[3] += d(0); state[4] += e(0); state[5] += f(0); state[6] += g(0); state[7] += h(0); #endif } /* // smaller but slower void SHA256::Transform(word32 *state, const word32 *data) { word32 T[20]; word32 W[32]; unsigned int i = 0, j = 0; word32 *t = T+8; memcpy(t, state, 8*4); word32 e = t[4], a = t[0]; do { word32 w = data[j]; W[j] = w; w += SHA256_K[j]; w += t[7]; w += S1(e); w += Ch(e, t[5], t[6]); e = t[3] + w; t[3] = t[3+8] = e; w += S0(t[0]); a = w + Maj(a, t[1], t[2]); t[-1] = t[7] = a; --t; ++j; if (j%8 == 0) t += 8; } while (j<16); do { i = j&0xf; word32 w = s1(W[i+16-2]) + s0(W[i+16-15]) + W[i] + W[i+16-7]; W[i+16] = W[i] = w; w += SHA256_K[j]; w += t[7]; w += S1(e); w += Ch(e, t[5], t[6]); e = t[3] + w; t[3] = t[3+8] = e; w += S0(t[0]); a = w + Maj(a, t[1], t[2]); t[-1] = t[7] = a; w = s1(W[(i+1)+16-2]) + s0(W[(i+1)+16-15]) + W[(i+1)] + W[(i+1)+16-7]; W[(i+1)+16] = W[(i+1)] = w; w += SHA256_K[j+1]; w += (t-1)[7]; w += S1(e); w += Ch(e, (t-1)[5], (t-1)[6]); e = (t-1)[3] + w; (t-1)[3] = (t-1)[3+8] = e; w += S0((t-1)[0]); a = w + Maj(a, (t-1)[1], (t-1)[2]); (t-1)[-1] = (t-1)[7] = a; t-=2; j+=2; if (j%8 == 0) t += 8; } while (j<64); state[0] += a; state[1] += t[1]; state[2] += t[2]; state[3] += t[3]; state[4] += e; state[5] += t[5]; state[6] += t[6]; state[7] += t[7]; } */ #undef S0 #undef S1 #undef s0 #undef s1 #undef R // ************************************************************* void SHA384::InitState(HashWordType *state) { static const word64 s[8] = { W64LIT(0xcbbb9d5dc1059ed8), W64LIT(0x629a292a367cd507), W64LIT(0x9159015a3070dd17), W64LIT(0x152fecd8f70e5939), W64LIT(0x67332667ffc00b31), W64LIT(0x8eb44a8768581511), W64LIT(0xdb0c2e0d64f98fa7), W64LIT(0x47b5481dbefa4fa4)}; memcpy(state, s, sizeof(s)); } void SHA512::InitState(HashWordType *state) { static const word64 s[8] = { W64LIT(0x6a09e667f3bcc908), W64LIT(0xbb67ae8584caa73b), W64LIT(0x3c6ef372fe94f82b), W64LIT(0xa54ff53a5f1d36f1), W64LIT(0x510e527fade682d1), W64LIT(0x9b05688c2b3e6c1f), W64LIT(0x1f83d9abfb41bd6b), W64LIT(0x5be0cd19137e2179)}; memcpy(state, s, sizeof(s)); } #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE && CRYPTOPP_BOOL_X86 CRYPTOPP_ALIGN_DATA(16) static const word64 SHA512_K[80] CRYPTOPP_SECTION_ALIGN16 = { #else static const word64 SHA512_K[80] = { #endif W64LIT(0x428a2f98d728ae22), W64LIT(0x7137449123ef65cd), W64LIT(0xb5c0fbcfec4d3b2f), W64LIT(0xe9b5dba58189dbbc), W64LIT(0x3956c25bf348b538), W64LIT(0x59f111f1b605d019), W64LIT(0x923f82a4af194f9b), W64LIT(0xab1c5ed5da6d8118), W64LIT(0xd807aa98a3030242), W64LIT(0x12835b0145706fbe), W64LIT(0x243185be4ee4b28c), W64LIT(0x550c7dc3d5ffb4e2), W64LIT(0x72be5d74f27b896f), W64LIT(0x80deb1fe3b1696b1), W64LIT(0x9bdc06a725c71235), W64LIT(0xc19bf174cf692694), W64LIT(0xe49b69c19ef14ad2), W64LIT(0xefbe4786384f25e3), W64LIT(0x0fc19dc68b8cd5b5), W64LIT(0x240ca1cc77ac9c65), W64LIT(0x2de92c6f592b0275), W64LIT(0x4a7484aa6ea6e483), W64LIT(0x5cb0a9dcbd41fbd4), W64LIT(0x76f988da831153b5), W64LIT(0x983e5152ee66dfab), W64LIT(0xa831c66d2db43210), W64LIT(0xb00327c898fb213f), W64LIT(0xbf597fc7beef0ee4), W64LIT(0xc6e00bf33da88fc2), W64LIT(0xd5a79147930aa725), W64LIT(0x06ca6351e003826f), W64LIT(0x142929670a0e6e70), W64LIT(0x27b70a8546d22ffc), W64LIT(0x2e1b21385c26c926), W64LIT(0x4d2c6dfc5ac42aed), W64LIT(0x53380d139d95b3df), W64LIT(0x650a73548baf63de), W64LIT(0x766a0abb3c77b2a8), W64LIT(0x81c2c92e47edaee6), W64LIT(0x92722c851482353b), W64LIT(0xa2bfe8a14cf10364), W64LIT(0xa81a664bbc423001), W64LIT(0xc24b8b70d0f89791), W64LIT(0xc76c51a30654be30), W64LIT(0xd192e819d6ef5218), W64LIT(0xd69906245565a910), W64LIT(0xf40e35855771202a), W64LIT(0x106aa07032bbd1b8), W64LIT(0x19a4c116b8d2d0c8), W64LIT(0x1e376c085141ab53), W64LIT(0x2748774cdf8eeb99), W64LIT(0x34b0bcb5e19b48a8), W64LIT(0x391c0cb3c5c95a63), W64LIT(0x4ed8aa4ae3418acb), W64LIT(0x5b9cca4f7763e373), W64LIT(0x682e6ff3d6b2b8a3), W64LIT(0x748f82ee5defb2fc), W64LIT(0x78a5636f43172f60), W64LIT(0x84c87814a1f0ab72), W64LIT(0x8cc702081a6439ec), W64LIT(0x90befffa23631e28), W64LIT(0xa4506cebde82bde9), W64LIT(0xbef9a3f7b2c67915), W64LIT(0xc67178f2e372532b), W64LIT(0xca273eceea26619c), W64LIT(0xd186b8c721c0c207), W64LIT(0xeada7dd6cde0eb1e), W64LIT(0xf57d4f7fee6ed178), W64LIT(0x06f067aa72176fba), W64LIT(0x0a637dc5a2c898a6), W64LIT(0x113f9804bef90dae), W64LIT(0x1b710b35131c471b), W64LIT(0x28db77f523047d84), W64LIT(0x32caab7b40c72493), W64LIT(0x3c9ebe0a15c9bebc), W64LIT(0x431d67c49c100d4c), W64LIT(0x4cc5d4becb3e42b6), W64LIT(0x597f299cfc657e2a), W64LIT(0x5fcb6fab3ad6faec), W64LIT(0x6c44198c4a475817) }; #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE && CRYPTOPP_BOOL_X86 // put assembly version in separate function, otherwise MSVC 2005 SP1 doesn't generate correct code for the non-assembly version CRYPTOPP_NAKED static void CRYPTOPP_FASTCALL SHA512_SSE2_Transform(word64 *state, const word64 *data) { #ifdef __GNUC__ __asm__ __volatile__ ( ".intel_syntax noprefix;" AS1( push ebx) AS2( mov ebx, eax) #else AS1( push ebx) AS1( push esi) AS1( push edi) AS2( lea ebx, SHA512_K) #endif AS2( mov eax, esp) AS2( and esp, 0xfffffff0) AS2( sub esp, 27*16) // 17*16 for expanded data, 20*8 for state AS1( push eax) AS2( xor eax, eax) AS2( lea edi, [esp+4+8*8]) // start at middle of state buffer. will decrement pointer each round to avoid copying AS2( lea esi, [esp+4+20*8+8]) // 16-byte alignment, then add 8 AS2( movdqa xmm0, [ecx+0*16]) AS2( movdq2q mm4, xmm0) AS2( movdqa [edi+0*16], xmm0) AS2( movdqa xmm0, [ecx+1*16]) AS2( movdqa [edi+1*16], xmm0) AS2( movdqa xmm0, [ecx+2*16]) AS2( movdq2q mm5, xmm0) AS2( movdqa [edi+2*16], xmm0) AS2( movdqa xmm0, [ecx+3*16]) AS2( movdqa [edi+3*16], xmm0) ASJ( jmp, 0, f) #define SSE2_S0_S1(r, a, b, c) \ AS2( movq mm6, r)\ AS2( psrlq r, a)\ AS2( movq mm7, r)\ AS2( psllq mm6, 64-c)\ AS2( pxor mm7, mm6)\ AS2( psrlq r, b-a)\ AS2( pxor mm7, r)\ AS2( psllq mm6, c-b)\ AS2( pxor mm7, mm6)\ AS2( psrlq r, c-b)\ AS2( pxor r, mm7)\ AS2( psllq mm6, b-a)\ AS2( pxor r, mm6) #define SSE2_s0(r, a, b, c) \ AS2( movdqa xmm6, r)\ AS2( psrlq r, a)\ AS2( movdqa xmm7, r)\ AS2( psllq xmm6, 64-c)\ AS2( pxor xmm7, xmm6)\ AS2( psrlq r, b-a)\ AS2( pxor xmm7, r)\ AS2( psrlq r, c-b)\ AS2( pxor r, xmm7)\ AS2( psllq xmm6, c-a)\ AS2( pxor r, xmm6) #define SSE2_s1(r, a, b, c) \ AS2( movdqa xmm6, r)\ AS2( psrlq r, a)\ AS2( movdqa xmm7, r)\ AS2( psllq xmm6, 64-c)\ AS2( pxor xmm7, xmm6)\ AS2( psrlq r, b-a)\ AS2( pxor xmm7, r)\ AS2( psllq xmm6, c-b)\ AS2( pxor xmm7, xmm6)\ AS2( psrlq r, c-b)\ AS2( pxor r, xmm7) ASL(SHA512_Round) // k + w is in mm0, a is in mm4, e is in mm5 AS2( paddq mm0, [edi+7*8]) // h AS2( movq mm2, [edi+5*8]) // f AS2( movq mm3, [edi+6*8]) // g AS2( pxor mm2, mm3) AS2( pand mm2, mm5) SSE2_S0_S1(mm5,14,18,41) AS2( pxor mm2, mm3) AS2( paddq mm0, mm2) // h += Ch(e,f,g) AS2( paddq mm5, mm0) // h += S1(e) AS2( movq mm2, [edi+1*8]) // b AS2( movq mm1, mm2) AS2( por mm2, mm4) AS2( pand mm2, [edi+2*8]) // c AS2( pand mm1, mm4) AS2( por mm1, mm2) AS2( paddq mm1, mm5) // temp = h + Maj(a,b,c) AS2( paddq mm5, [edi+3*8]) // e = d + h AS2( movq [edi+3*8], mm5) AS2( movq [edi+11*8], mm5) SSE2_S0_S1(mm4,28,34,39) // S0(a) AS2( paddq mm4, mm1) // a = temp + S0(a) AS2( movq [edi-8], mm4) AS2( movq [edi+7*8], mm4) AS1( ret) // first 16 rounds ASL(0) AS2( movq mm0, [edx+eax*8]) AS2( movq [esi+eax*8], mm0) AS2( movq [esi+eax*8+16*8], mm0) AS2( paddq mm0, [ebx+eax*8]) ASC( call, SHA512_Round) AS1( inc eax) AS2( sub edi, 8) AS2( test eax, 7) ASJ( jnz, 0, b) AS2( add edi, 8*8) AS2( cmp eax, 16) ASJ( jne, 0, b) // rest of the rounds AS2( movdqu xmm0, [esi+(16-2)*8]) ASL(1) // data expansion, W[i-2] already in xmm0 AS2( movdqu xmm3, [esi]) AS2( paddq xmm3, [esi+(16-7)*8]) AS2( movdqa xmm2, [esi+(16-15)*8]) SSE2_s1(xmm0, 6, 19, 61) AS2( paddq xmm0, xmm3) SSE2_s0(xmm2, 1, 7, 8) AS2( paddq xmm0, xmm2) AS2( movdq2q mm0, xmm0) AS2( movhlps xmm1, xmm0) AS2( paddq mm0, [ebx+eax*8]) AS2( movlps [esi], xmm0) AS2( movlps [esi+8], xmm1) AS2( movlps [esi+8*16], xmm0) AS2( movlps [esi+8*17], xmm1) // 2 rounds ASC( call, SHA512_Round) AS2( sub edi, 8) AS2( movdq2q mm0, xmm1) AS2( paddq mm0, [ebx+eax*8+8]) ASC( call, SHA512_Round) // update indices and loop AS2( add esi, 16) AS2( add eax, 2) AS2( sub edi, 8) AS2( test eax, 7) ASJ( jnz, 1, b) // do housekeeping every 8 rounds AS2( mov esi, 0xf) AS2( and esi, eax) AS2( lea esi, [esp+4+20*8+8+esi*8]) AS2( add edi, 8*8) AS2( cmp eax, 80) ASJ( jne, 1, b) #define SSE2_CombineState(i) \ AS2( movdqa xmm0, [edi+i*16])\ AS2( paddq xmm0, [ecx+i*16])\ AS2( movdqa [ecx+i*16], xmm0) SSE2_CombineState(0) SSE2_CombineState(1) SSE2_CombineState(2) SSE2_CombineState(3) AS1( pop esp) AS1( emms) #if defined(__GNUC__) AS1( pop ebx) ".att_syntax prefix;" : : "a" (SHA512_K), "c" (state), "d" (data) : "%esi", "%edi", "memory", "cc" ); #else AS1( pop edi) AS1( pop esi) AS1( pop ebx) AS1( ret) #endif } #endif // #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE void SHA512::Transform(word64 *state, const word64 *data) { #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE && CRYPTOPP_BOOL_X86 if (HasSSE2()) { SHA512_SSE2_Transform(state, data); return; } #endif #define S0(x) (rotrFixed(x,28)^rotrFixed(x,34)^rotrFixed(x,39)) #define S1(x) (rotrFixed(x,14)^rotrFixed(x,18)^rotrFixed(x,41)) #define s0(x) (rotrFixed(x,1)^rotrFixed(x,8)^(x>>7)) #define s1(x) (rotrFixed(x,19)^rotrFixed(x,61)^(x>>6)) #define R(i) h(i)+=S1(e(i))+Ch(e(i),f(i),g(i))+SHA512_K[i+j]+(j?blk2(i):blk0(i));\ d(i)+=h(i);h(i)+=S0(a(i))+Maj(a(i),b(i),c(i)) word64 W[16]; word64 T[8]; /* Copy context->state[] to working vars */ memcpy(T, state, sizeof(T)); /* 80 operations, partially loop unrolled */ for (unsigned int j=0; j<80; j+=16) { R( 0); R( 1); R( 2); R( 3); R( 4); R( 5); R( 6); R( 7); R( 8); R( 9); R(10); R(11); R(12); R(13); R(14); R(15); } /* Add the working vars back into context.state[] */ state[0] += a(0); state[1] += b(0); state[2] += c(0); state[3] += d(0); state[4] += e(0); state[5] += f(0); state[6] += g(0); state[7] += h(0); } NAMESPACE_END #endif // #ifndef CRYPTOPP_GENERATE_X64_MASM #endif // #ifndef CRYPTOPP_IMPORTS armory-0.92.3/cppForSwig/cryptopp/strciphr.h0000755000000000000000000003046212414772654017612 0ustar rootroot/*! \file This file contains helper classes for implementing stream ciphers. All this infrastructure may look very complex compared to what's in Crypto++ 4.x, but stream ciphers implementations now support a lot of new functionality, including better performance (minimizing copying), resetting of keys and IVs, and methods to query which features are supported by a cipher. Here's an explanation of these classes. The word "policy" is used here to mean a class with a set of methods that must be implemented by individual stream cipher implementations. This is usually much simpler than the full stream cipher API, which is implemented by either AdditiveCipherTemplate or CFB_CipherTemplate using the policy. So for example, an implementation of SEAL only needs to implement the AdditiveCipherAbstractPolicy interface (since it's an additive cipher, i.e., it xors a keystream into the plaintext). See this line in seal.h: typedef SymmetricCipherFinal\, AdditiveCipherTemplate\<\> \> \> Encryption; AdditiveCipherTemplate and CFB_CipherTemplate are designed so that they don't need to take a policy class as a template parameter (although this is allowed), so that their code is not duplicated for each new cipher. Instead they each get a reference to an abstract policy interface by calling AccessPolicy() on itself, so AccessPolicy() must be overriden to return the actual policy reference. This is done by the ConceretePolicyHolder class. Finally, SymmetricCipherFinal implements the constructors and other functions that must be implemented by the most derived class. */ #ifndef CRYPTOPP_STRCIPHR_H #define CRYPTOPP_STRCIPHR_H #include "seckey.h" #include "secblock.h" #include "argnames.h" NAMESPACE_BEGIN(CryptoPP) template class CRYPTOPP_NO_VTABLE AbstractPolicyHolder : public BASE { public: typedef POLICY_INTERFACE PolicyInterface; virtual ~AbstractPolicyHolder() {} protected: virtual const POLICY_INTERFACE & GetPolicy() const =0; virtual POLICY_INTERFACE & AccessPolicy() =0; }; template class ConcretePolicyHolder : public BASE, protected POLICY { protected: const POLICY_INTERFACE & GetPolicy() const {return *this;} POLICY_INTERFACE & AccessPolicy() {return *this;} }; enum KeystreamOperationFlags {OUTPUT_ALIGNED=1, INPUT_ALIGNED=2, INPUT_NULL = 4}; enum KeystreamOperation { WRITE_KEYSTREAM = INPUT_NULL, WRITE_KEYSTREAM_ALIGNED = INPUT_NULL | OUTPUT_ALIGNED, XOR_KEYSTREAM = 0, XOR_KEYSTREAM_INPUT_ALIGNED = INPUT_ALIGNED, XOR_KEYSTREAM_OUTPUT_ALIGNED= OUTPUT_ALIGNED, XOR_KEYSTREAM_BOTH_ALIGNED = OUTPUT_ALIGNED | INPUT_ALIGNED}; struct CRYPTOPP_DLL CRYPTOPP_NO_VTABLE AdditiveCipherAbstractPolicy { virtual ~AdditiveCipherAbstractPolicy() {} virtual unsigned int GetAlignment() const {return 1;} virtual unsigned int GetBytesPerIteration() const =0; virtual unsigned int GetOptimalBlockSize() const {return GetBytesPerIteration();} virtual unsigned int GetIterationsToBuffer() const =0; virtual void WriteKeystream(byte *keystream, size_t iterationCount) {OperateKeystream(KeystreamOperation(INPUT_NULL | (KeystreamOperationFlags)IsAlignedOn(keystream, GetAlignment())), keystream, NULL, iterationCount);} virtual bool CanOperateKeystream() const {return false;} virtual void OperateKeystream(KeystreamOperation operation, byte *output, const byte *input, size_t iterationCount) {assert(false);} virtual void CipherSetKey(const NameValuePairs ¶ms, const byte *key, size_t length) =0; virtual void CipherResynchronize(byte *keystreamBuffer, const byte *iv, size_t length) {throw NotImplemented("SimpleKeyingInterface: this object doesn't support resynchronization");} virtual bool CipherIsRandomAccess() const =0; virtual void SeekToIteration(lword iterationCount) {assert(!CipherIsRandomAccess()); throw NotImplemented("StreamTransformation: this object doesn't support random access");} }; template struct CRYPTOPP_NO_VTABLE AdditiveCipherConcretePolicy : public BASE { typedef WT WordType; CRYPTOPP_CONSTANT(BYTES_PER_ITERATION = sizeof(WordType) * W) #if !(CRYPTOPP_BOOL_X86 || CRYPTOPP_BOOL_X64) unsigned int GetAlignment() const {return GetAlignmentOf();} #endif unsigned int GetBytesPerIteration() const {return BYTES_PER_ITERATION;} unsigned int GetIterationsToBuffer() const {return X;} bool CanOperateKeystream() const {return true;} virtual void OperateKeystream(KeystreamOperation operation, byte *output, const byte *input, size_t iterationCount) =0; }; // use these to implement OperateKeystream #define CRYPTOPP_KEYSTREAM_OUTPUT_WORD(x, b, i, a) \ PutWord(bool(x & OUTPUT_ALIGNED), b, output+i*sizeof(WordType), (x & INPUT_NULL) ? a : a ^ GetWord(bool(x & INPUT_ALIGNED), b, input+i*sizeof(WordType))); #define CRYPTOPP_KEYSTREAM_OUTPUT_XMM(x, i, a) {\ __m128i t = (x & INPUT_NULL) ? a : _mm_xor_si128(a, (x & INPUT_ALIGNED) ? _mm_load_si128((__m128i *)input+i) : _mm_loadu_si128((__m128i *)input+i));\ if (x & OUTPUT_ALIGNED) _mm_store_si128((__m128i *)output+i, t);\ else _mm_storeu_si128((__m128i *)output+i, t);} #define CRYPTOPP_KEYSTREAM_OUTPUT_SWITCH(x, y) \ switch (operation) \ { \ case WRITE_KEYSTREAM: \ x(WRITE_KEYSTREAM) \ break; \ case XOR_KEYSTREAM: \ x(XOR_KEYSTREAM) \ input += y; \ break; \ case XOR_KEYSTREAM_INPUT_ALIGNED: \ x(XOR_KEYSTREAM_INPUT_ALIGNED) \ input += y; \ break; \ case XOR_KEYSTREAM_OUTPUT_ALIGNED: \ x(XOR_KEYSTREAM_OUTPUT_ALIGNED) \ input += y; \ break; \ case WRITE_KEYSTREAM_ALIGNED: \ x(WRITE_KEYSTREAM_ALIGNED) \ break; \ case XOR_KEYSTREAM_BOTH_ALIGNED: \ x(XOR_KEYSTREAM_BOTH_ALIGNED) \ input += y; \ break; \ } \ output += y; template > class CRYPTOPP_NO_VTABLE AdditiveCipherTemplate : public BASE, public RandomNumberGenerator { public: void GenerateBlock(byte *output, size_t size); void ProcessData(byte *outString, const byte *inString, size_t length); void Resynchronize(const byte *iv, int length=-1); unsigned int OptimalBlockSize() const {return this->GetPolicy().GetOptimalBlockSize();} unsigned int GetOptimalNextBlockSize() const {return (unsigned int)this->m_leftOver;} unsigned int OptimalDataAlignment() const {return this->GetPolicy().GetAlignment();} bool IsSelfInverting() const {return true;} bool IsForwardTransformation() const {return true;} bool IsRandomAccess() const {return this->GetPolicy().CipherIsRandomAccess();} void Seek(lword position); typedef typename BASE::PolicyInterface PolicyInterface; protected: void UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms); unsigned int GetBufferByteSize(const PolicyInterface &policy) const {return policy.GetBytesPerIteration() * policy.GetIterationsToBuffer();} inline byte * KeystreamBufferBegin() {return this->m_buffer.data();} inline byte * KeystreamBufferEnd() {return (this->m_buffer.data() + this->m_buffer.size());} SecByteBlock m_buffer; size_t m_leftOver; }; class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CFB_CipherAbstractPolicy { public: virtual ~CFB_CipherAbstractPolicy() {} virtual unsigned int GetAlignment() const =0; virtual unsigned int GetBytesPerIteration() const =0; virtual byte * GetRegisterBegin() =0; virtual void TransformRegister() =0; virtual bool CanIterate() const {return false;} virtual void Iterate(byte *output, const byte *input, CipherDir dir, size_t iterationCount) {assert(false); throw 0;} virtual void CipherSetKey(const NameValuePairs ¶ms, const byte *key, size_t length) =0; virtual void CipherResynchronize(const byte *iv, size_t length) {throw NotImplemented("SimpleKeyingInterface: this object doesn't support resynchronization");} }; template struct CRYPTOPP_NO_VTABLE CFB_CipherConcretePolicy : public BASE { typedef WT WordType; unsigned int GetAlignment() const {return sizeof(WordType);} unsigned int GetBytesPerIteration() const {return sizeof(WordType) * W;} bool CanIterate() const {return true;} void TransformRegister() {this->Iterate(NULL, NULL, ENCRYPTION, 1);} template struct RegisterOutput { RegisterOutput(byte *output, const byte *input, CipherDir dir) : m_output(output), m_input(input), m_dir(dir) {} inline RegisterOutput& operator()(WordType ®isterWord) { assert(IsAligned(m_output)); assert(IsAligned(m_input)); if (!NativeByteOrderIs(B::ToEnum())) registerWord = ByteReverse(registerWord); if (m_dir == ENCRYPTION) { if (m_input == NULL) assert(m_output == NULL); else { WordType ct = *(const WordType *)m_input ^ registerWord; registerWord = ct; *(WordType*)m_output = ct; m_input += sizeof(WordType); m_output += sizeof(WordType); } } else { WordType ct = *(const WordType *)m_input; *(WordType*)m_output = registerWord ^ ct; registerWord = ct; m_input += sizeof(WordType); m_output += sizeof(WordType); } // registerWord is left unreversed so it can be xor-ed with further input return *this; } byte *m_output; const byte *m_input; CipherDir m_dir; }; }; template class CRYPTOPP_NO_VTABLE CFB_CipherTemplate : public BASE { public: void ProcessData(byte *outString, const byte *inString, size_t length); void Resynchronize(const byte *iv, int length=-1); unsigned int OptimalBlockSize() const {return this->GetPolicy().GetBytesPerIteration();} unsigned int GetOptimalNextBlockSize() const {return (unsigned int)m_leftOver;} unsigned int OptimalDataAlignment() const {return this->GetPolicy().GetAlignment();} bool IsRandomAccess() const {return false;} bool IsSelfInverting() const {return false;} typedef typename BASE::PolicyInterface PolicyInterface; protected: virtual void CombineMessageAndShiftRegister(byte *output, byte *reg, const byte *message, size_t length) =0; void UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms); size_t m_leftOver; }; template > class CRYPTOPP_NO_VTABLE CFB_EncryptionTemplate : public CFB_CipherTemplate { bool IsForwardTransformation() const {return true;} void CombineMessageAndShiftRegister(byte *output, byte *reg, const byte *message, size_t length); }; template > class CRYPTOPP_NO_VTABLE CFB_DecryptionTemplate : public CFB_CipherTemplate { bool IsForwardTransformation() const {return false;} void CombineMessageAndShiftRegister(byte *output, byte *reg, const byte *message, size_t length); }; template class CFB_RequireFullDataBlocks : public BASE { public: unsigned int MandatoryBlockSize() const {return this->OptimalBlockSize();} }; //! _ template class SymmetricCipherFinal : public AlgorithmImpl, INFO> { public: SymmetricCipherFinal() {} SymmetricCipherFinal(const byte *key) {this->SetKey(key, this->DEFAULT_KEYLENGTH);} SymmetricCipherFinal(const byte *key, size_t length) {this->SetKey(key, length);} SymmetricCipherFinal(const byte *key, size_t length, const byte *iv) {this->SetKeyWithIV(key, length, iv);} Clonable * Clone() const {return static_cast(new SymmetricCipherFinal(*this));} }; NAMESPACE_END #ifdef CRYPTOPP_MANUALLY_INSTANTIATE_TEMPLATES #include "strciphr.cpp" #endif NAMESPACE_BEGIN(CryptoPP) CRYPTOPP_DLL_TEMPLATE_CLASS AbstractPolicyHolder; CRYPTOPP_DLL_TEMPLATE_CLASS AdditiveCipherTemplate >; CRYPTOPP_DLL_TEMPLATE_CLASS CFB_CipherTemplate >; CRYPTOPP_DLL_TEMPLATE_CLASS CFB_EncryptionTemplate >; CRYPTOPP_DLL_TEMPLATE_CLASS CFB_DecryptionTemplate >; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/smartptr.h0000755000000000000000000001161312414772654017625 0ustar rootroot#ifndef CRYPTOPP_SMARTPTR_H #define CRYPTOPP_SMARTPTR_H #include "config.h" #include NAMESPACE_BEGIN(CryptoPP) template class simple_ptr { public: simple_ptr(T *p = NULL) : m_p(p) {} ~simple_ptr() {delete m_p; m_p = NULL;} // set m_p to NULL so double destruction (which might occur in Singleton) will be harmless T *m_p; }; template class member_ptr { public: explicit member_ptr(T *p = NULL) : m_p(p) {} ~member_ptr(); const T& operator*() const { return *m_p; } T& operator*() { return *m_p; } const T* operator->() const { return m_p; } T* operator->() { return m_p; } const T* get() const { return m_p; } T* get() { return m_p; } T* release() { T *old_p = m_p; m_p = 0; return old_p; } void reset(T *p = 0); protected: member_ptr(const member_ptr& rhs); // copy not allowed void operator=(const member_ptr& rhs); // assignment not allowed T *m_p; }; template member_ptr::~member_ptr() {delete m_p;} template void member_ptr::reset(T *p) {delete m_p; m_p = p;} // ******************************************************** template class value_ptr : public member_ptr { public: value_ptr(const T &obj) : member_ptr(new T(obj)) {} value_ptr(T *p = NULL) : member_ptr(p) {} value_ptr(const value_ptr& rhs) : member_ptr(rhs.m_p ? new T(*rhs.m_p) : NULL) {} value_ptr& operator=(const value_ptr& rhs); bool operator==(const value_ptr& rhs) { return (!this->m_p && !rhs.m_p) || (this->m_p && rhs.m_p && *this->m_p == *rhs.m_p); } }; template value_ptr& value_ptr::operator=(const value_ptr& rhs) { T *old_p = this->m_p; this->m_p = rhs.m_p ? new T(*rhs.m_p) : NULL; delete old_p; return *this; } // ******************************************************** template class clonable_ptr : public member_ptr { public: clonable_ptr(const T &obj) : member_ptr(obj.Clone()) {} clonable_ptr(T *p = NULL) : member_ptr(p) {} clonable_ptr(const clonable_ptr& rhs) : member_ptr(rhs.m_p ? rhs.m_p->Clone() : NULL) {} clonable_ptr& operator=(const clonable_ptr& rhs); }; template clonable_ptr& clonable_ptr::operator=(const clonable_ptr& rhs) { T *old_p = this->m_p; this->m_p = rhs.m_p ? rhs.m_p->Clone() : NULL; delete old_p; return *this; } // ******************************************************** template class counted_ptr { public: explicit counted_ptr(T *p = 0); counted_ptr(const T &r) : m_p(0) {attach(r);} counted_ptr(const counted_ptr& rhs); ~counted_ptr(); const T& operator*() const { return *m_p; } T& operator*() { return *m_p; } const T* operator->() const { return m_p; } T* operator->() { return get(); } const T* get() const { return m_p; } T* get(); void attach(const T &p); counted_ptr & operator=(const counted_ptr& rhs); private: T *m_p; }; template counted_ptr::counted_ptr(T *p) : m_p(p) { if (m_p) m_p->m_referenceCount = 1; } template counted_ptr::counted_ptr(const counted_ptr& rhs) : m_p(rhs.m_p) { if (m_p) m_p->m_referenceCount++; } template counted_ptr::~counted_ptr() { if (m_p && --m_p->m_referenceCount == 0) delete m_p; } template void counted_ptr::attach(const T &r) { if (m_p && --m_p->m_referenceCount == 0) delete m_p; if (r.m_referenceCount == 0) { m_p = r.clone(); m_p->m_referenceCount = 1; } else { m_p = const_cast(&r); m_p->m_referenceCount++; } } template T* counted_ptr::get() { if (m_p && m_p->m_referenceCount > 1) { T *temp = m_p->clone(); m_p->m_referenceCount--; m_p = temp; m_p->m_referenceCount = 1; } return m_p; } template counted_ptr & counted_ptr::operator=(const counted_ptr& rhs) { if (m_p != rhs.m_p) { if (m_p && --m_p->m_referenceCount == 0) delete m_p; m_p = rhs.m_p; if (m_p) m_p->m_referenceCount++; } return *this; } // ******************************************************** template class vector_member_ptrs { public: vector_member_ptrs(size_t size=0) : m_size(size), m_ptr(new member_ptr[size]) {} ~vector_member_ptrs() {delete [] this->m_ptr;} member_ptr& operator[](size_t index) {assert(indexm_size); return this->m_ptr[index];} const member_ptr& operator[](size_t index) const {assert(indexm_size); return this->m_ptr[index];} size_t size() const {return this->m_size;} void resize(size_t newSize) { member_ptr *newPtr = new member_ptr[newSize]; for (size_t i=0; im_size && im_ptr[i].release()); delete [] this->m_ptr; this->m_size = newSize; this->m_ptr = newPtr; } private: vector_member_ptrs(const vector_member_ptrs &c); // copy not allowed void operator=(const vector_member_ptrs &x); // assignment not allowed size_t m_size; member_ptr *m_ptr; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/trdlocal.cpp0000755000000000000000000000306012414772654020105 0ustar rootroot// trdlocal.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #ifdef THREADS_AVAILABLE #include "trdlocal.h" #ifdef HAS_WINTHREADS #include #endif NAMESPACE_BEGIN(CryptoPP) ThreadLocalStorage::Err::Err(const std::string& operation, int error) : OS_Error(OTHER_ERROR, "ThreadLocalStorage: " + operation + " operation failed with error 0x" + IntToString(error, 16), operation, error) { } ThreadLocalStorage::ThreadLocalStorage() { #ifdef HAS_WINTHREADS m_index = TlsAlloc(); if (m_index == TLS_OUT_OF_INDEXES) throw Err("TlsAlloc", GetLastError()); #else int error = pthread_key_create(&m_index, NULL); if (error) throw Err("pthread_key_create", error); #endif } ThreadLocalStorage::~ThreadLocalStorage() { #ifdef HAS_WINTHREADS if (!TlsFree(m_index)) throw Err("TlsFree", GetLastError()); #else int error = pthread_key_delete(m_index); if (error) throw Err("pthread_key_delete", error); #endif } void ThreadLocalStorage::SetValue(void *value) { #ifdef HAS_WINTHREADS if (!TlsSetValue(m_index, value)) throw Err("TlsSetValue", GetLastError()); #else int error = pthread_setspecific(m_index, value); if (error) throw Err("pthread_key_getspecific", error); #endif } void *ThreadLocalStorage::GetValue() const { #ifdef HAS_WINTHREADS void *result = TlsGetValue(m_index); if (!result && GetLastError() != NO_ERROR) throw Err("TlsGetValue", GetLastError()); #else void *result = pthread_getspecific(m_index); #endif return result; } NAMESPACE_END #endif // #ifdef THREADS_AVAILABLE #endif armory-0.92.3/cppForSwig/cryptopp/algparam.cpp0000755000000000000000000000370312414772654020071 0ustar rootroot// algparam.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "algparam.h" NAMESPACE_BEGIN(CryptoPP) PAssignIntToInteger g_pAssignIntToInteger = NULL; bool CombinedNameValuePairs::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { if (strcmp(name, "ValueNames") == 0) return m_pairs1.GetVoidValue(name, valueType, pValue) && m_pairs2.GetVoidValue(name, valueType, pValue); else return m_pairs1.GetVoidValue(name, valueType, pValue) || m_pairs2.GetVoidValue(name, valueType, pValue); } void AlgorithmParametersBase::operator=(const AlgorithmParametersBase& rhs) { assert(false); } bool AlgorithmParametersBase::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { if (strcmp(name, "ValueNames") == 0) { NameValuePairs::ThrowIfTypeMismatch(name, typeid(std::string), valueType); if (m_next.get()) m_next->GetVoidValue(name, valueType, pValue); (*reinterpret_cast(pValue) += m_name) += ";"; return true; } else if (strcmp(name, m_name) == 0) { AssignValue(name, valueType, pValue); m_used = true; return true; } else if (m_next.get()) return m_next->GetVoidValue(name, valueType, pValue); else return false; } AlgorithmParameters::AlgorithmParameters() : m_defaultThrowIfNotUsed(true) { } AlgorithmParameters::AlgorithmParameters(const AlgorithmParameters &x) : m_defaultThrowIfNotUsed(x.m_defaultThrowIfNotUsed) { m_next.reset(const_cast(x).m_next.release()); } AlgorithmParameters & AlgorithmParameters::operator=(const AlgorithmParameters &x) { m_next.reset(const_cast(x).m_next.release()); return *this; } bool AlgorithmParameters::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { if (m_next.get()) return m_next->GetVoidValue(name, valueType, pValue); else return false; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/blowfish.h0000755000000000000000000000232712414772654017570 0ustar rootroot#ifndef CRYPTOPP_BLOWFISH_H #define CRYPTOPP_BLOWFISH_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct Blowfish_Info : public FixedBlockSize<8>, public VariableKeyLength<16, 1, 56>, public FixedRounds<16> { static const char *StaticAlgorithmName() {return "Blowfish";} }; //! Blowfish class Blowfish : public Blowfish_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; void UncheckedSetKey(const byte *key_string, unsigned int keylength, const NameValuePairs ¶ms); private: void crypt_block(const word32 in[2], word32 out[2]) const; static const word32 p_init[ROUNDS+2]; static const word32 s_init[4*256]; FixedSizeSecBlock pbox; FixedSizeSecBlock sbox; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef Blowfish::Encryption BlowfishEncryption; typedef Blowfish::Decryption BlowfishDecryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/trunhash.h0000755000000000000000000000256312414772654017611 0ustar rootroot#ifndef CRYPTOPP_TRUNHASH_H #define CRYPTOPP_TRUNHASH_H #include "cryptlib.h" NAMESPACE_BEGIN(CryptoPP) class NullHash : public HashTransformation { public: void Update(const byte *input, size_t length) {} unsigned int DigestSize() const {return 0;} void TruncatedFinal(byte *digest, size_t digestSize) {} bool TruncatedVerify(const byte *digest, size_t digestLength) {return true;} }; //! construct new HashModule with smaller DigestSize() from existing one template class TruncatedHashTemplate : public HashTransformation { public: TruncatedHashTemplate(T hm, unsigned int digestSize) : m_hm(hm), m_digestSize(digestSize) {} TruncatedHashTemplate(const byte *key, size_t keyLength, unsigned int digestSize) : m_hm(key, keyLength), m_digestSize(digestSize) {} TruncatedHashTemplate(size_t digestSize) : m_digestSize(digestSize) {} void Restart() {m_hm.Restart();} void Update(const byte *input, size_t length) {m_hm.Update(input, length);} unsigned int DigestSize() const {return m_digestSize;} void TruncatedFinal(byte *digest, size_t digestSize) {m_hm.TruncatedFinal(digest, digestSize);} bool TruncatedVerify(const byte *digest, size_t digestLength) {return m_hm.TruncatedVerify(digest, digestLength);} private: T m_hm; unsigned int m_digestSize; }; typedef TruncatedHashTemplate TruncatedHashModule; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/network.h0000755000000000000000000001742112414772654017445 0ustar rootroot#ifndef CRYPTOPP_NETWORK_H #define CRYPTOPP_NETWORK_H #include "config.h" #ifdef HIGHRES_TIMER_AVAILABLE #include "filters.h" #include "hrtimer.h" #include NAMESPACE_BEGIN(CryptoPP) class LimitedBandwidth { public: LimitedBandwidth(lword maxBytesPerSecond = 0) : m_maxBytesPerSecond(maxBytesPerSecond), m_timer(Timer::MILLISECONDS) , m_nextTransceiveTime(0) { m_timer.StartTimer(); } lword GetMaxBytesPerSecond() const { return m_maxBytesPerSecond; } void SetMaxBytesPerSecond(lword v) { m_maxBytesPerSecond = v; } lword ComputeCurrentTransceiveLimit(); double TimeToNextTransceive(); void NoteTransceive(lword size); public: /*! GetWaitObjects() must be called despite the 0 return from GetMaxWaitObjectCount(); the 0 is because the ScheduleEvent() method is used instead of adding a wait object */ unsigned int GetMaxWaitObjectCount() const { return 0; } void GetWaitObjects(WaitObjectContainer &container, const CallStack &callStack); private: lword m_maxBytesPerSecond; typedef std::deque > OpQueue; OpQueue m_ops; Timer m_timer; double m_nextTransceiveTime; void ComputeNextTransceiveTime(); double GetCurTimeAndCleanUp(); }; //! a Source class that can pump from a device for a specified amount of time. class CRYPTOPP_NO_VTABLE NonblockingSource : public AutoSignaling, public LimitedBandwidth { public: NonblockingSource(BufferedTransformation *attachment) : m_messageEndSent(false) , m_doPumpBlocked(false), m_blockedBySpeedLimit(false) {Detach(attachment);} //! \name NONBLOCKING SOURCE //@{ //! pump up to maxSize bytes using at most maxTime milliseconds /*! If checkDelimiter is true, pump up to delimiter, which itself is not extracted or pumped. */ size_t GeneralPump2(lword &byteCount, bool blockingOutput=true, unsigned long maxTime=INFINITE_TIME, bool checkDelimiter=false, byte delimiter='\n'); lword GeneralPump(lword maxSize=LWORD_MAX, unsigned long maxTime=INFINITE_TIME, bool checkDelimiter=false, byte delimiter='\n') { GeneralPump2(maxSize, true, maxTime, checkDelimiter, delimiter); return maxSize; } lword TimedPump(unsigned long maxTime) {return GeneralPump(LWORD_MAX, maxTime);} lword PumpLine(byte delimiter='\n', lword maxSize=1024) {return GeneralPump(maxSize, INFINITE_TIME, true, delimiter);} size_t Pump2(lword &byteCount, bool blocking=true) {return GeneralPump2(byteCount, blocking, blocking ? INFINITE_TIME : 0);} size_t PumpMessages2(unsigned int &messageCount, bool blocking=true); //@} protected: virtual size_t DoPump(lword &byteCount, bool blockingOutput, unsigned long maxTime, bool checkDelimiter, byte delimiter) =0; bool BlockedBySpeedLimit() const { return m_blockedBySpeedLimit; } private: bool m_messageEndSent, m_doPumpBlocked, m_blockedBySpeedLimit; }; //! Network Receiver class CRYPTOPP_NO_VTABLE NetworkReceiver : public Waitable { public: virtual bool MustWaitToReceive() {return false;} virtual bool MustWaitForResult() {return false;} //! receive data from network source, returns whether result is immediately available virtual bool Receive(byte* buf, size_t bufLen) =0; virtual unsigned int GetReceiveResult() =0; virtual bool EofReceived() const =0; }; class CRYPTOPP_NO_VTABLE NonblockingSinkInfo { public: virtual ~NonblockingSinkInfo() {} virtual size_t GetMaxBufferSize() const =0; virtual size_t GetCurrentBufferSize() const =0; virtual bool EofPending() const =0; //! compute the current speed of this sink in bytes per second virtual float ComputeCurrentSpeed() =0; //! get the maximum observed speed of this sink in bytes per second virtual float GetMaxObservedSpeed() const =0; }; //! a Sink class that queues input and can flush to a device for a specified amount of time. class CRYPTOPP_NO_VTABLE NonblockingSink : public Sink, public NonblockingSinkInfo, public LimitedBandwidth { public: NonblockingSink() : m_blockedBySpeedLimit(false) {} bool IsolatedFlush(bool hardFlush, bool blocking); //! flush to device for no more than maxTime milliseconds /*! This function will repeatedly attempt to flush data to some device, until the queue is empty, or a total of maxTime milliseconds have elapsed. If maxTime == 0, at least one attempt will be made to flush some data, but it is likely that not all queued data will be flushed, even if the device is ready to receive more data without waiting. If you want to flush as much data as possible without waiting for the device, call this function in a loop. For example: while (sink.TimedFlush(0) > 0) {} \return number of bytes flushed */ lword TimedFlush(unsigned long maxTime, size_t targetSize = 0); virtual void SetMaxBufferSize(size_t maxBufferSize) =0; //! set a bound which will cause sink to flush if exceeded by GetCurrentBufferSize() virtual void SetAutoFlushBound(size_t bound) =0; protected: virtual lword DoFlush(unsigned long maxTime, size_t targetSize) = 0; bool BlockedBySpeedLimit() const { return m_blockedBySpeedLimit; } private: bool m_blockedBySpeedLimit; }; //! Network Sender class CRYPTOPP_NO_VTABLE NetworkSender : public Waitable { public: virtual bool MustWaitToSend() {return false;} virtual bool MustWaitForResult() {return false;} virtual void Send(const byte* buf, size_t bufLen) =0; virtual unsigned int GetSendResult() =0; virtual bool MustWaitForEof() {return false;} virtual void SendEof() =0; virtual bool EofSent() {return false;} // implement if MustWaitForEof() == true }; //! Network Source class CRYPTOPP_NO_VTABLE NetworkSource : public NonblockingSource { public: NetworkSource(BufferedTransformation *attachment); unsigned int GetMaxWaitObjectCount() const; void GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack); bool SourceExhausted() const {return m_dataBegin == m_dataEnd && GetReceiver().EofReceived();} protected: size_t DoPump(lword &byteCount, bool blockingOutput, unsigned long maxTime, bool checkDelimiter, byte delimiter); virtual NetworkReceiver & AccessReceiver() =0; const NetworkReceiver & GetReceiver() const {return const_cast(this)->AccessReceiver();} private: SecByteBlock m_buf; size_t m_putSize, m_dataBegin, m_dataEnd; bool m_waitingForResult, m_outputBlocked; }; //! Network Sink class CRYPTOPP_NO_VTABLE NetworkSink : public NonblockingSink { public: NetworkSink(unsigned int maxBufferSize, unsigned int autoFlushBound); unsigned int GetMaxWaitObjectCount() const; void GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack); size_t Put2(const byte *inString, size_t length, int messageEnd, bool blocking); void SetMaxBufferSize(size_t maxBufferSize) {m_maxBufferSize = maxBufferSize; m_buffer.SetNodeSize(UnsignedMin(maxBufferSize, 16U*1024U+256U));} void SetAutoFlushBound(size_t bound) {m_autoFlushBound = bound;} size_t GetMaxBufferSize() const {return m_maxBufferSize;} size_t GetCurrentBufferSize() const {return (size_t)m_buffer.CurrentSize();} void ClearBuffer() { m_buffer.Clear(); } bool EofPending() const { return m_eofState > EOF_NONE && m_eofState < EOF_DONE; } //! compute the current speed of this sink in bytes per second float ComputeCurrentSpeed(); //! get the maximum observed speed of this sink in bytes per second float GetMaxObservedSpeed() const; protected: lword DoFlush(unsigned long maxTime, size_t targetSize); virtual NetworkSender & AccessSender() =0; const NetworkSender & GetSender() const {return const_cast(this)->AccessSender();} private: enum EofState { EOF_NONE, EOF_PENDING_SEND, EOF_PENDING_DELIVERY, EOF_DONE }; size_t m_maxBufferSize, m_autoFlushBound; bool m_needSendResult, m_wasBlocked; EofState m_eofState; ByteQueue m_buffer; size_t m_skipBytes; Timer m_speedTimer; float m_byteCountSinceLastTimerReset, m_currentSpeed, m_maxObservedSpeed; }; NAMESPACE_END #endif // #ifdef HIGHRES_TIMER_AVAILABLE #endif armory-0.92.3/cppForSwig/cryptopp/filters.h0000755000000000000000000010232412414772654017421 0ustar rootroot#ifndef CRYPTOPP_FILTERS_H #define CRYPTOPP_FILTERS_H //! \file #include "simple.h" #include "secblock.h" #include "misc.h" #include "smartptr.h" #include "queue.h" #include "algparam.h" #include NAMESPACE_BEGIN(CryptoPP) /// provides an implementation of BufferedTransformation's attachment interface class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Filter : public BufferedTransformation, public NotCopyable { public: Filter(BufferedTransformation *attachment = NULL); bool Attachable() {return true;} BufferedTransformation *AttachedTransformation(); const BufferedTransformation *AttachedTransformation() const; void Detach(BufferedTransformation *newAttachment = NULL); size_t TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true); size_t CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) const; void Initialize(const NameValuePairs ¶meters=g_nullNameValuePairs, int propagation=-1); bool Flush(bool hardFlush, int propagation=-1, bool blocking=true); bool MessageSeriesEnd(int propagation=-1, bool blocking=true); protected: virtual BufferedTransformation * NewDefaultAttachment() const; void Insert(Filter *nextFilter); // insert filter after this one virtual bool ShouldPropagateMessageEnd() const {return true;} virtual bool ShouldPropagateMessageSeriesEnd() const {return true;} void PropagateInitialize(const NameValuePairs ¶meters, int propagation); size_t Output(int outputSite, const byte *inString, size_t length, int messageEnd, bool blocking, const std::string &channel=DEFAULT_CHANNEL); size_t OutputModifiable(int outputSite, byte *inString, size_t length, int messageEnd, bool blocking, const std::string &channel=DEFAULT_CHANNEL); bool OutputMessageEnd(int outputSite, int propagation, bool blocking, const std::string &channel=DEFAULT_CHANNEL); bool OutputFlush(int outputSite, bool hardFlush, int propagation, bool blocking, const std::string &channel=DEFAULT_CHANNEL); bool OutputMessageSeriesEnd(int outputSite, int propagation, bool blocking, const std::string &channel=DEFAULT_CHANNEL); private: member_ptr m_attachment; protected: size_t m_inputPosition; int m_continueAt; }; struct CRYPTOPP_DLL FilterPutSpaceHelper { // desiredSize is how much to ask target, bufferSize is how much to allocate in m_tempSpace byte *HelpCreatePutSpace(BufferedTransformation &target, const std::string &channel, size_t minSize, size_t desiredSize, size_t &bufferSize) { assert(desiredSize >= minSize && bufferSize >= minSize); if (m_tempSpace.size() < minSize) { byte *result = target.ChannelCreatePutSpace(channel, desiredSize); if (desiredSize >= minSize) { bufferSize = desiredSize; return result; } m_tempSpace.New(bufferSize); } bufferSize = m_tempSpace.size(); return m_tempSpace.begin(); } byte *HelpCreatePutSpace(BufferedTransformation &target, const std::string &channel, size_t minSize) {return HelpCreatePutSpace(target, channel, minSize, minSize, minSize);} byte *HelpCreatePutSpace(BufferedTransformation &target, const std::string &channel, size_t minSize, size_t bufferSize) {return HelpCreatePutSpace(target, channel, minSize, minSize, bufferSize);} SecByteBlock m_tempSpace; }; //! measure how many byte and messages pass through, also serves as valve class CRYPTOPP_DLL MeterFilter : public Bufferless { public: MeterFilter(BufferedTransformation *attachment=NULL, bool transparent=true) : m_transparent(transparent) {Detach(attachment); ResetMeter();} void SetTransparent(bool transparent) {m_transparent = transparent;} void AddRangeToSkip(unsigned int message, lword position, lword size, bool sortNow = true); void ResetMeter(); void IsolatedInitialize(const NameValuePairs ¶meters) {ResetMeter();} lword GetCurrentMessageBytes() const {return m_currentMessageBytes;} lword GetTotalBytes() {return m_totalBytes;} unsigned int GetCurrentSeriesMessages() {return m_currentSeriesMessages;} unsigned int GetTotalMessages() {return m_totalMessages;} unsigned int GetTotalMessageSeries() {return m_totalMessageSeries;} byte * CreatePutSpace(size_t &size) {return AttachedTransformation()->CreatePutSpace(size);} size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking); size_t PutModifiable2(byte *inString, size_t length, int messageEnd, bool blocking); bool IsolatedMessageSeriesEnd(bool blocking); private: size_t PutMaybeModifiable(byte *inString, size_t length, int messageEnd, bool blocking, bool modifiable); bool ShouldPropagateMessageEnd() const {return m_transparent;} bool ShouldPropagateMessageSeriesEnd() const {return m_transparent;} struct MessageRange { inline bool operator<(const MessageRange &b) const // BCB2006 workaround: this has to be a member function {return message < b.message || (message == b.message && position < b.position);} unsigned int message; lword position; lword size; }; bool m_transparent; lword m_currentMessageBytes, m_totalBytes; unsigned int m_currentSeriesMessages, m_totalMessages, m_totalMessageSeries; std::deque m_rangesToSkip; byte *m_begin; size_t m_length; }; //! _ class CRYPTOPP_DLL TransparentFilter : public MeterFilter { public: TransparentFilter(BufferedTransformation *attachment=NULL) : MeterFilter(attachment, true) {} }; //! _ class CRYPTOPP_DLL OpaqueFilter : public MeterFilter { public: OpaqueFilter(BufferedTransformation *attachment=NULL) : MeterFilter(attachment, false) {} }; /*! FilterWithBufferedInput divides up the input stream into a first block, a number of middle blocks, and a last block. First and last blocks are optional, and middle blocks may be a stream instead (i.e. blockSize == 1). */ class CRYPTOPP_DLL FilterWithBufferedInput : public Filter { public: FilterWithBufferedInput(BufferedTransformation *attachment); //! firstSize and lastSize may be 0, blockSize must be at least 1 FilterWithBufferedInput(size_t firstSize, size_t blockSize, size_t lastSize, BufferedTransformation *attachment); void IsolatedInitialize(const NameValuePairs ¶meters); size_t Put2(const byte *inString, size_t length, int messageEnd, bool blocking) { return PutMaybeModifiable(const_cast(inString), length, messageEnd, blocking, false); } size_t PutModifiable2(byte *inString, size_t length, int messageEnd, bool blocking) { return PutMaybeModifiable(inString, length, messageEnd, blocking, true); } /*! calls ForceNextPut() if hardFlush is true */ bool IsolatedFlush(bool hardFlush, bool blocking); /*! The input buffer may contain more than blockSize bytes if lastSize != 0. ForceNextPut() forces a call to NextPut() if this is the case. */ void ForceNextPut(); protected: bool DidFirstPut() {return m_firstInputDone;} virtual void InitializeDerivedAndReturnNewSizes(const NameValuePairs ¶meters, size_t &firstSize, size_t &blockSize, size_t &lastSize) {InitializeDerived(parameters);} virtual void InitializeDerived(const NameValuePairs ¶meters) {} // FirstPut() is called if (firstSize != 0 and totalLength >= firstSize) // or (firstSize == 0 and (totalLength > 0 or a MessageEnd() is received)) virtual void FirstPut(const byte *inString) =0; // NextPut() is called if totalLength >= firstSize+blockSize+lastSize virtual void NextPutSingle(const byte *inString) {assert(false);} // Same as NextPut() except length can be a multiple of blockSize // Either NextPut() or NextPutMultiple() must be overriden virtual void NextPutMultiple(const byte *inString, size_t length); // Same as NextPutMultiple(), but inString can be modified virtual void NextPutModifiable(byte *inString, size_t length) {NextPutMultiple(inString, length);} // LastPut() is always called // if totalLength < firstSize then length == totalLength // else if totalLength <= firstSize+lastSize then length == totalLength-firstSize // else lastSize <= length < lastSize+blockSize virtual void LastPut(const byte *inString, size_t length) =0; virtual void FlushDerived() {} protected: size_t PutMaybeModifiable(byte *begin, size_t length, int messageEnd, bool blocking, bool modifiable); void NextPutMaybeModifiable(byte *inString, size_t length, bool modifiable) { if (modifiable) NextPutModifiable(inString, length); else NextPutMultiple(inString, length); } // This function should no longer be used, put this here to cause a compiler error // if someone tries to override NextPut(). virtual int NextPut(const byte *inString, size_t length) {assert(false); return 0;} class BlockQueue { public: void ResetQueue(size_t blockSize, size_t maxBlocks); byte *GetBlock(); byte *GetContigousBlocks(size_t &numberOfBytes); size_t GetAll(byte *outString); void Put(const byte *inString, size_t length); size_t CurrentSize() const {return m_size;} size_t MaxSize() const {return m_buffer.size();} private: SecByteBlock m_buffer; size_t m_blockSize, m_maxBlocks, m_size; byte *m_begin; }; size_t m_firstSize, m_blockSize, m_lastSize; bool m_firstInputDone; BlockQueue m_queue; }; //! _ class CRYPTOPP_DLL FilterWithInputQueue : public Filter { public: FilterWithInputQueue(BufferedTransformation *attachment=NULL) : Filter(attachment) {} size_t Put2(const byte *inString, size_t length, int messageEnd, bool blocking) { if (!blocking) throw BlockingInputOnly("FilterWithInputQueue"); m_inQueue.Put(inString, length); if (messageEnd) { IsolatedMessageEnd(blocking); Output(0, NULL, 0, messageEnd, blocking); } return 0; } protected: virtual bool IsolatedMessageEnd(bool blocking) =0; void IsolatedInitialize(const NameValuePairs ¶meters) {m_inQueue.Clear();} ByteQueue m_inQueue; }; struct BlockPaddingSchemeDef { enum BlockPaddingScheme {NO_PADDING, ZEROS_PADDING, PKCS_PADDING, ONE_AND_ZEROS_PADDING, DEFAULT_PADDING}; }; //! Filter Wrapper for StreamTransformation, optionally handling padding/unpadding when needed class CRYPTOPP_DLL StreamTransformationFilter : public FilterWithBufferedInput, public BlockPaddingSchemeDef, private FilterPutSpaceHelper { public: /*! DEFAULT_PADDING means PKCS_PADDING if c.MandatoryBlockSize() > 1 && c.MinLastBlockSize() == 0 (e.g. ECB or CBC mode), otherwise NO_PADDING (OFB, CFB, CTR, CBC-CTS modes). See http://www.weidai.com/scan-mirror/csp.html for details of the padding schemes. */ StreamTransformationFilter(StreamTransformation &c, BufferedTransformation *attachment = NULL, BlockPaddingScheme padding = DEFAULT_PADDING, bool allowAuthenticatedSymmetricCipher = false); std::string AlgorithmName() const {return m_cipher.AlgorithmName();} protected: void InitializeDerivedAndReturnNewSizes(const NameValuePairs ¶meters, size_t &firstSize, size_t &blockSize, size_t &lastSize); void FirstPut(const byte *inString); void NextPutMultiple(const byte *inString, size_t length); void NextPutModifiable(byte *inString, size_t length); void LastPut(const byte *inString, size_t length); static size_t LastBlockSize(StreamTransformation &c, BlockPaddingScheme padding); StreamTransformation &m_cipher; BlockPaddingScheme m_padding; unsigned int m_optimalBufferSize; }; #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY typedef StreamTransformationFilter StreamCipherFilter; #endif //! Filter Wrapper for HashTransformation class CRYPTOPP_DLL HashFilter : public Bufferless, private FilterPutSpaceHelper { public: HashFilter(HashTransformation &hm, BufferedTransformation *attachment = NULL, bool putMessage=false, int truncatedDigestSize=-1, const std::string &messagePutChannel=DEFAULT_CHANNEL, const std::string &hashPutChannel=DEFAULT_CHANNEL); std::string AlgorithmName() const {return m_hashModule.AlgorithmName();} void IsolatedInitialize(const NameValuePairs ¶meters); size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking); byte * CreatePutSpace(size_t &size) {return m_hashModule.CreateUpdateSpace(size);} private: HashTransformation &m_hashModule; bool m_putMessage; unsigned int m_digestSize; byte *m_space; std::string m_messagePutChannel, m_hashPutChannel; }; //! Filter Wrapper for HashTransformation class CRYPTOPP_DLL HashVerificationFilter : public FilterWithBufferedInput { public: class HashVerificationFailed : public Exception { public: HashVerificationFailed() : Exception(DATA_INTEGRITY_CHECK_FAILED, "HashVerificationFilter: message hash or MAC not valid") {} }; enum Flags {HASH_AT_END=0, HASH_AT_BEGIN=1, PUT_MESSAGE=2, PUT_HASH=4, PUT_RESULT=8, THROW_EXCEPTION=16, DEFAULT_FLAGS = HASH_AT_BEGIN | PUT_RESULT}; HashVerificationFilter(HashTransformation &hm, BufferedTransformation *attachment = NULL, word32 flags = DEFAULT_FLAGS, int truncatedDigestSize=-1); std::string AlgorithmName() const {return m_hashModule.AlgorithmName();} bool GetLastResult() const {return m_verified;} protected: void InitializeDerivedAndReturnNewSizes(const NameValuePairs ¶meters, size_t &firstSize, size_t &blockSize, size_t &lastSize); void FirstPut(const byte *inString); void NextPutMultiple(const byte *inString, size_t length); void LastPut(const byte *inString, size_t length); private: friend class AuthenticatedDecryptionFilter; HashTransformation &m_hashModule; word32 m_flags; unsigned int m_digestSize; bool m_verified; SecByteBlock m_expectedHash; }; typedef HashVerificationFilter HashVerifier; // for backwards compatibility //! Filter wrapper for encrypting with AuthenticatedSymmetricCipher, optionally handling padding/unpadding when needed /*! Additional authenticated data should be given in channel "AAD". If putAAD is true, AAD will be Put() to the attached BufferedTransformation in channel "AAD". */ class CRYPTOPP_DLL AuthenticatedEncryptionFilter : public StreamTransformationFilter { public: /*! See StreamTransformationFilter for documentation on BlockPaddingScheme */ AuthenticatedEncryptionFilter(AuthenticatedSymmetricCipher &c, BufferedTransformation *attachment = NULL, bool putAAD=false, int truncatedDigestSize=-1, const std::string &macChannel=DEFAULT_CHANNEL, BlockPaddingScheme padding = DEFAULT_PADDING); void IsolatedInitialize(const NameValuePairs ¶meters); byte * ChannelCreatePutSpace(const std::string &channel, size_t &size); size_t ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking); void LastPut(const byte *inString, size_t length); protected: HashFilter m_hf; }; //! Filter wrapper for decrypting with AuthenticatedSymmetricCipher, optionally handling padding/unpadding when needed /*! Additional authenticated data should be given in channel "AAD". */ class CRYPTOPP_DLL AuthenticatedDecryptionFilter : public FilterWithBufferedInput, public BlockPaddingSchemeDef { public: enum Flags {MAC_AT_END=0, MAC_AT_BEGIN=1, THROW_EXCEPTION=16, DEFAULT_FLAGS = THROW_EXCEPTION}; /*! See StreamTransformationFilter for documentation on BlockPaddingScheme */ AuthenticatedDecryptionFilter(AuthenticatedSymmetricCipher &c, BufferedTransformation *attachment = NULL, word32 flags = DEFAULT_FLAGS, int truncatedDigestSize=-1, BlockPaddingScheme padding = DEFAULT_PADDING); std::string AlgorithmName() const {return m_hashVerifier.AlgorithmName();} byte * ChannelCreatePutSpace(const std::string &channel, size_t &size); size_t ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking); bool GetLastResult() const {return m_hashVerifier.GetLastResult();} protected: void InitializeDerivedAndReturnNewSizes(const NameValuePairs ¶meters, size_t &firstSize, size_t &blockSize, size_t &lastSize); void FirstPut(const byte *inString); void NextPutMultiple(const byte *inString, size_t length); void LastPut(const byte *inString, size_t length); HashVerificationFilter m_hashVerifier; StreamTransformationFilter m_streamFilter; }; //! Filter Wrapper for PK_Signer class CRYPTOPP_DLL SignerFilter : public Unflushable { public: SignerFilter(RandomNumberGenerator &rng, const PK_Signer &signer, BufferedTransformation *attachment = NULL, bool putMessage=false) : m_rng(rng), m_signer(signer), m_messageAccumulator(signer.NewSignatureAccumulator(rng)), m_putMessage(putMessage) {Detach(attachment);} std::string AlgorithmName() const {return m_signer.AlgorithmName();} void IsolatedInitialize(const NameValuePairs ¶meters); size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking); private: RandomNumberGenerator &m_rng; const PK_Signer &m_signer; member_ptr m_messageAccumulator; bool m_putMessage; SecByteBlock m_buf; }; //! Filter Wrapper for PK_Verifier class CRYPTOPP_DLL SignatureVerificationFilter : public FilterWithBufferedInput { public: class SignatureVerificationFailed : public Exception { public: SignatureVerificationFailed() : Exception(DATA_INTEGRITY_CHECK_FAILED, "VerifierFilter: digital signature not valid") {} }; enum Flags {SIGNATURE_AT_END=0, SIGNATURE_AT_BEGIN=1, PUT_MESSAGE=2, PUT_SIGNATURE=4, PUT_RESULT=8, THROW_EXCEPTION=16, DEFAULT_FLAGS = SIGNATURE_AT_BEGIN | PUT_RESULT}; SignatureVerificationFilter(const PK_Verifier &verifier, BufferedTransformation *attachment = NULL, word32 flags = DEFAULT_FLAGS); std::string AlgorithmName() const {return m_verifier.AlgorithmName();} bool GetLastResult() const {return m_verified;} protected: void InitializeDerivedAndReturnNewSizes(const NameValuePairs ¶meters, size_t &firstSize, size_t &blockSize, size_t &lastSize); void FirstPut(const byte *inString); void NextPutMultiple(const byte *inString, size_t length); void LastPut(const byte *inString, size_t length); private: const PK_Verifier &m_verifier; member_ptr m_messageAccumulator; word32 m_flags; SecByteBlock m_signature; bool m_verified; }; typedef SignatureVerificationFilter VerifierFilter; // for backwards compatibility //! Redirect input to another BufferedTransformation without owning it class CRYPTOPP_DLL Redirector : public CustomSignalPropagation { public: enum Behavior { DATA_ONLY = 0x00, PASS_SIGNALS = 0x01, PASS_WAIT_OBJECTS = 0x02, PASS_EVERYTHING = PASS_SIGNALS | PASS_WAIT_OBJECTS }; Redirector() : m_target(NULL), m_behavior(PASS_EVERYTHING) {} Redirector(BufferedTransformation &target, Behavior behavior=PASS_EVERYTHING) : m_target(&target), m_behavior(behavior) {} void Redirect(BufferedTransformation &target) {m_target = ⌖} void StopRedirection() {m_target = NULL;} Behavior GetBehavior() {return (Behavior) m_behavior;} void SetBehavior(Behavior behavior) {m_behavior=behavior;} bool GetPassSignals() const {return (m_behavior & PASS_SIGNALS) != 0;} void SetPassSignals(bool pass) { if (pass) m_behavior |= PASS_SIGNALS; else m_behavior &= ~(word32) PASS_SIGNALS; } bool GetPassWaitObjects() const {return (m_behavior & PASS_WAIT_OBJECTS) != 0;} void SetPassWaitObjects(bool pass) { if (pass) m_behavior |= PASS_WAIT_OBJECTS; else m_behavior &= ~(word32) PASS_WAIT_OBJECTS; } bool CanModifyInput() const {return m_target ? m_target->CanModifyInput() : false;} void Initialize(const NameValuePairs ¶meters, int propagation); byte * CreatePutSpace(size_t &size) {return m_target ? m_target->CreatePutSpace(size) : (byte *)(size=0, NULL);} size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking) {return m_target ? m_target->Put2(begin, length, GetPassSignals() ? messageEnd : 0, blocking) : 0;} bool Flush(bool hardFlush, int propagation=-1, bool blocking=true) {return m_target && GetPassSignals() ? m_target->Flush(hardFlush, propagation, blocking) : false;} bool MessageSeriesEnd(int propagation=-1, bool blocking=true) {return m_target && GetPassSignals() ? m_target->MessageSeriesEnd(propagation, blocking) : false;} byte * ChannelCreatePutSpace(const std::string &channel, size_t &size) {return m_target ? m_target->ChannelCreatePutSpace(channel, size) : (byte *)(size=0, NULL);} size_t ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking) {return m_target ? m_target->ChannelPut2(channel, begin, length, GetPassSignals() ? messageEnd : 0, blocking) : 0;} size_t ChannelPutModifiable2(const std::string &channel, byte *begin, size_t length, int messageEnd, bool blocking) {return m_target ? m_target->ChannelPutModifiable2(channel, begin, length, GetPassSignals() ? messageEnd : 0, blocking) : 0;} bool ChannelFlush(const std::string &channel, bool completeFlush, int propagation=-1, bool blocking=true) {return m_target && GetPassSignals() ? m_target->ChannelFlush(channel, completeFlush, propagation, blocking) : false;} bool ChannelMessageSeriesEnd(const std::string &channel, int propagation=-1, bool blocking=true) {return m_target && GetPassSignals() ? m_target->ChannelMessageSeriesEnd(channel, propagation, blocking) : false;} unsigned int GetMaxWaitObjectCount() const { return m_target && GetPassWaitObjects() ? m_target->GetMaxWaitObjectCount() : 0; } void GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack) { if (m_target && GetPassWaitObjects()) m_target->GetWaitObjects(container, callStack); } private: BufferedTransformation *m_target; word32 m_behavior; }; // Used By ProxyFilter class CRYPTOPP_DLL OutputProxy : public CustomSignalPropagation { public: OutputProxy(BufferedTransformation &owner, bool passSignal) : m_owner(owner), m_passSignal(passSignal) {} bool GetPassSignal() const {return m_passSignal;} void SetPassSignal(bool passSignal) {m_passSignal = passSignal;} byte * CreatePutSpace(size_t &size) {return m_owner.AttachedTransformation()->CreatePutSpace(size);} size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking) {return m_owner.AttachedTransformation()->Put2(begin, length, m_passSignal ? messageEnd : 0, blocking);} size_t PutModifiable2(byte *begin, size_t length, int messageEnd, bool blocking) {return m_owner.AttachedTransformation()->PutModifiable2(begin, length, m_passSignal ? messageEnd : 0, blocking);} void Initialize(const NameValuePairs ¶meters=g_nullNameValuePairs, int propagation=-1) {if (m_passSignal) m_owner.AttachedTransformation()->Initialize(parameters, propagation);} bool Flush(bool hardFlush, int propagation=-1, bool blocking=true) {return m_passSignal ? m_owner.AttachedTransformation()->Flush(hardFlush, propagation, blocking) : false;} bool MessageSeriesEnd(int propagation=-1, bool blocking=true) {return m_passSignal ? m_owner.AttachedTransformation()->MessageSeriesEnd(propagation, blocking) : false;} byte * ChannelCreatePutSpace(const std::string &channel, size_t &size) {return m_owner.AttachedTransformation()->ChannelCreatePutSpace(channel, size);} size_t ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking) {return m_owner.AttachedTransformation()->ChannelPut2(channel, begin, length, m_passSignal ? messageEnd : 0, blocking);} size_t ChannelPutModifiable2(const std::string &channel, byte *begin, size_t length, int messageEnd, bool blocking) {return m_owner.AttachedTransformation()->ChannelPutModifiable2(channel, begin, length, m_passSignal ? messageEnd : 0, blocking);} bool ChannelFlush(const std::string &channel, bool completeFlush, int propagation=-1, bool blocking=true) {return m_passSignal ? m_owner.AttachedTransformation()->ChannelFlush(channel, completeFlush, propagation, blocking) : false;} bool ChannelMessageSeriesEnd(const std::string &channel, int propagation=-1, bool blocking=true) {return m_passSignal ? m_owner.AttachedTransformation()->ChannelMessageSeriesEnd(channel, propagation, blocking) : false;} private: BufferedTransformation &m_owner; bool m_passSignal; }; //! Base class for Filter classes that are proxies for a chain of other filters. class CRYPTOPP_DLL ProxyFilter : public FilterWithBufferedInput { public: ProxyFilter(BufferedTransformation *filter, size_t firstSize, size_t lastSize, BufferedTransformation *attachment); bool IsolatedFlush(bool hardFlush, bool blocking); void SetFilter(Filter *filter); void NextPutMultiple(const byte *s, size_t len); void NextPutModifiable(byte *inString, size_t length); protected: member_ptr m_filter; }; //! simple proxy filter that doesn't modify the underlying filter's input or output class CRYPTOPP_DLL SimpleProxyFilter : public ProxyFilter { public: SimpleProxyFilter(BufferedTransformation *filter, BufferedTransformation *attachment) : ProxyFilter(filter, 0, 0, attachment) {} void FirstPut(const byte *) {} void LastPut(const byte *, size_t) {m_filter->MessageEnd();} }; //! proxy for the filter created by PK_Encryptor::CreateEncryptionFilter /*! This class is here just to provide symmetry with VerifierFilter. */ class CRYPTOPP_DLL PK_EncryptorFilter : public SimpleProxyFilter { public: PK_EncryptorFilter(RandomNumberGenerator &rng, const PK_Encryptor &encryptor, BufferedTransformation *attachment = NULL) : SimpleProxyFilter(encryptor.CreateEncryptionFilter(rng), attachment) {} }; //! proxy for the filter created by PK_Decryptor::CreateDecryptionFilter /*! This class is here just to provide symmetry with SignerFilter. */ class CRYPTOPP_DLL PK_DecryptorFilter : public SimpleProxyFilter { public: PK_DecryptorFilter(RandomNumberGenerator &rng, const PK_Decryptor &decryptor, BufferedTransformation *attachment = NULL) : SimpleProxyFilter(decryptor.CreateDecryptionFilter(rng), attachment) {} }; //! Append input to a string object template class StringSinkTemplate : public Bufferless { public: // VC60 workaround: no T::char_type typedef typename T::traits_type::char_type char_type; StringSinkTemplate(T &output) : m_output(&output) {assert(sizeof(output[0])==1);} void IsolatedInitialize(const NameValuePairs ¶meters) {if (!parameters.GetValue("OutputStringPointer", m_output)) throw InvalidArgument("StringSink: OutputStringPointer not specified");} size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking) { if (length > 0) { typename T::size_type size = m_output->size(); if (length < size && size + length > m_output->capacity()) m_output->reserve(2*size); m_output->append((const char_type *)begin, (const char_type *)begin+length); } return 0; } private: T *m_output; }; //! Append input to an std::string CRYPTOPP_DLL_TEMPLATE_CLASS StringSinkTemplate; typedef StringSinkTemplate StringSink; //! incorporates input into RNG as additional entropy class RandomNumberSink : public Bufferless { public: RandomNumberSink() : m_rng(NULL) {} RandomNumberSink(RandomNumberGenerator &rng) : m_rng(&rng) {} void IsolatedInitialize(const NameValuePairs ¶meters); size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking); private: RandomNumberGenerator *m_rng; }; //! Copy input to a memory buffer class CRYPTOPP_DLL ArraySink : public Bufferless { public: ArraySink(const NameValuePairs ¶meters = g_nullNameValuePairs) {IsolatedInitialize(parameters);} ArraySink(byte *buf, size_t size) : m_buf(buf), m_size(size), m_total(0) {} size_t AvailableSize() {return SaturatingSubtract(m_size, m_total);} lword TotalPutLength() {return m_total;} void IsolatedInitialize(const NameValuePairs ¶meters); byte * CreatePutSpace(size_t &size); size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking); protected: byte *m_buf; size_t m_size; lword m_total; }; //! Xor input to a memory buffer class CRYPTOPP_DLL ArrayXorSink : public ArraySink { public: ArrayXorSink(byte *buf, size_t size) : ArraySink(buf, size) {} size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking); byte * CreatePutSpace(size_t &size) {return BufferedTransformation::CreatePutSpace(size);} }; //! string-based implementation of Store interface class StringStore : public Store { public: StringStore(const char *string = NULL) {StoreInitialize(MakeParameters("InputBuffer", ConstByteArrayParameter(string)));} StringStore(const byte *string, size_t length) {StoreInitialize(MakeParameters("InputBuffer", ConstByteArrayParameter(string, length)));} template StringStore(const T &string) {StoreInitialize(MakeParameters("InputBuffer", ConstByteArrayParameter(string)));} CRYPTOPP_DLL size_t TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true); CRYPTOPP_DLL size_t CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) const; private: CRYPTOPP_DLL void StoreInitialize(const NameValuePairs ¶meters); const byte *m_store; size_t m_length, m_count; }; //! RNG-based implementation of Source interface class CRYPTOPP_DLL RandomNumberStore : public Store { public: RandomNumberStore() : m_rng(NULL), m_length(0), m_count(0) {} RandomNumberStore(RandomNumberGenerator &rng, lword length) : m_rng(&rng), m_length(length), m_count(0) {} bool AnyRetrievable() const {return MaxRetrievable() != 0;} lword MaxRetrievable() const {return m_length-m_count;} size_t TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true); size_t CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) const { throw NotImplemented("RandomNumberStore: CopyRangeTo2() is not supported by this store"); } private: void StoreInitialize(const NameValuePairs ¶meters); RandomNumberGenerator *m_rng; lword m_length, m_count; }; //! empty store class CRYPTOPP_DLL NullStore : public Store { public: NullStore(lword size = ULONG_MAX) : m_size(size) {} void StoreInitialize(const NameValuePairs ¶meters) {} lword MaxRetrievable() const {return m_size;} size_t TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true); size_t CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) const; private: lword m_size; }; //! A Filter that pumps data into its attachment as input class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Source : public InputRejecting { public: Source(BufferedTransformation *attachment = NULL) {Source::Detach(attachment);} lword Pump(lword pumpMax=size_t(0)-1) {Pump2(pumpMax); return pumpMax;} unsigned int PumpMessages(unsigned int count=UINT_MAX) {PumpMessages2(count); return count;} void PumpAll() {PumpAll2();} virtual size_t Pump2(lword &byteCount, bool blocking=true) =0; virtual size_t PumpMessages2(unsigned int &messageCount, bool blocking=true) =0; virtual size_t PumpAll2(bool blocking=true); virtual bool SourceExhausted() const =0; protected: void SourceInitialize(bool pumpAll, const NameValuePairs ¶meters) { IsolatedInitialize(parameters); if (pumpAll) PumpAll(); } }; //! Turn a Store into a Source template class SourceTemplate : public Source { public: SourceTemplate(BufferedTransformation *attachment) : Source(attachment) {} void IsolatedInitialize(const NameValuePairs ¶meters) {m_store.IsolatedInitialize(parameters);} size_t Pump2(lword &byteCount, bool blocking=true) {return m_store.TransferTo2(*AttachedTransformation(), byteCount, DEFAULT_CHANNEL, blocking);} size_t PumpMessages2(unsigned int &messageCount, bool blocking=true) {return m_store.TransferMessagesTo2(*AttachedTransformation(), messageCount, DEFAULT_CHANNEL, blocking);} size_t PumpAll2(bool blocking=true) {return m_store.TransferAllTo2(*AttachedTransformation(), DEFAULT_CHANNEL, blocking);} bool SourceExhausted() const {return !m_store.AnyRetrievable() && !m_store.AnyMessages();} void SetAutoSignalPropagation(int propagation) {m_store.SetAutoSignalPropagation(propagation);} int GetAutoSignalPropagation() const {return m_store.GetAutoSignalPropagation();} protected: T m_store; }; //! string-based implementation of Source interface class CRYPTOPP_DLL StringSource : public SourceTemplate { public: StringSource(BufferedTransformation *attachment = NULL) : SourceTemplate(attachment) {} //! zero terminated string as source StringSource(const char *string, bool pumpAll, BufferedTransformation *attachment = NULL) : SourceTemplate(attachment) {SourceInitialize(pumpAll, MakeParameters("InputBuffer", ConstByteArrayParameter(string)));} //! binary byte array as source StringSource(const byte *string, size_t length, bool pumpAll, BufferedTransformation *attachment = NULL) : SourceTemplate(attachment) {SourceInitialize(pumpAll, MakeParameters("InputBuffer", ConstByteArrayParameter(string, length)));} //! std::string as source StringSource(const std::string &string, bool pumpAll, BufferedTransformation *attachment = NULL) : SourceTemplate(attachment) {SourceInitialize(pumpAll, MakeParameters("InputBuffer", ConstByteArrayParameter(string)));} }; //! use the third constructor for an array source typedef StringSource ArraySource; //! RNG-based implementation of Source interface class CRYPTOPP_DLL RandomNumberSource : public SourceTemplate { public: RandomNumberSource(RandomNumberGenerator &rng, int length, bool pumpAll, BufferedTransformation *attachment = NULL) : SourceTemplate(attachment) {SourceInitialize(pumpAll, MakeParameters("RandomNumberGeneratorPointer", &rng)("RandomNumberStoreSize", length));} }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/cryptest.dsp0000755000000000000000000001702712414772654020172 0ustar rootroot# Microsoft Developer Studio Project File - Name="cryptest" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Console Application" 0x0103 CFG=cryptest - Win32 Debug !MESSAGE This is not a valid makefile. To build this project using NMAKE, !MESSAGE use the Export Makefile command and run !MESSAGE !MESSAGE NMAKE /f "cryptest.mak". !MESSAGE !MESSAGE You can specify a configuration when running NMAKE !MESSAGE by defining the macro CFG on the command line. For example: !MESSAGE !MESSAGE NMAKE /f "cryptest.mak" CFG="cryptest - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "cryptest - Win32 DLL-Import Release" (based on "Win32 (x86) Console Application") !MESSAGE "cryptest - Win32 DLL-Import Debug" (based on "Win32 (x86) Console Application") !MESSAGE "cryptest - Win32 Release" (based on "Win32 (x86) Console Application") !MESSAGE "cryptest - Win32 Debug" (based on "Win32 (x86) Console Application") !MESSAGE # Begin Project # PROP AllowPerConfigDependencies 0 # PROP Scc_ProjName "" # PROP Scc_LocalPath "" CPP=cl.exe RSC=rc.exe !IF "$(CFG)" == "cryptest - Win32 DLL-Import Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "cryptest___Win32_FIPS_140_Release" # PROP BASE Intermediate_Dir "cryptest___Win32_FIPS_140_Release" # PROP BASE Ignore_Export_Lib 0 # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 0 # PROP Output_Dir "CT_DLL_Import_Release" # PROP Intermediate_Dir "CT_DLL_Import_Release" # PROP Ignore_Export_Lib 0 # PROP Target_Dir "" # ADD BASE CPP /nologo /G5 /Gz /MT /W3 /GX /Zi /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /Zm200 /c # ADD CPP /nologo /G5 /Gz /MT /W3 /GR /GX /Zi /O1 /Ob2 /D "NDEBUG" /D "CRYPTOPP_IMPORTS" /D "WIN32" /D "_CONSOLE" /D "_MBCS" /YX /FD /Zm400 /c # ADD BASE RSC /l 0x409 /d "NDEBUG" # ADD RSC /l 0x409 /d "NDEBUG" BSC32=bscmake.exe # ADD BASE BSC32 /nologo # ADD BSC32 /nologo LINK32=link.exe # ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib Ws2_32.lib /nologo /subsystem:console /debug /machine:I386 /OPT:NOWIN98 # ADD LINK32 Ws2_32.lib /nologo /subsystem:console /debug /machine:I386 /out:"DLL_Release/cryptest.exe" /libpath:"DLL_Release" /OPT:NOWIN98 /OPT:REF /OPT:ICF # SUBTRACT LINK32 /pdb:none /incremental:yes # Begin Special Build Tool SOURCE="$(InputPath)" PreLink_Cmds=echo This configuration requires cryptopp.dll. echo You can build it yourself using the cryptdll project, or echo obtain a pre-built, FIPS 140-2 validated DLL. If you build it yourself echo the resulting DLL will not be considered FIPS validated echo unless it undergoes FIPS validation. # End Special Build Tool !ELSEIF "$(CFG)" == "cryptest - Win32 DLL-Import Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "cryptest___Win32_FIPS_140_Debug" # PROP BASE Intermediate_Dir "cryptest___Win32_FIPS_140_Debug" # PROP BASE Ignore_Export_Lib 0 # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "CT_DLL_Import_Debug" # PROP Intermediate_Dir "CT_DLL_Import_Debug" # PROP Ignore_Export_Lib 0 # PROP Target_Dir "" # ADD BASE CPP /nologo /MTd /W3 /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /Zm200 /c # ADD CPP /nologo /G5 /Gz /MTd /W3 /GR /GX /Zi /Oi /D "_DEBUG" /D "CRYPTOPP_IMPORTS" /D "WIN32" /D "_CONSOLE" /D "_MBCS" /YX /FD /Zm400 /c # ADD BASE RSC /l 0x409 /d "_DEBUG" # ADD RSC /l 0x409 /d "_DEBUG" BSC32=bscmake.exe # ADD BASE BSC32 /nologo # ADD BSC32 /nologo LINK32=link.exe # ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib Ws2_32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /OPT:NOWIN98 # ADD LINK32 Ws2_32.lib /nologo /subsystem:console /debug /machine:I386 /out:"DLL_Debug/cryptest.exe" /pdbtype:sept /libpath:"DLL_Debug" /OPT:NOWIN98 # Begin Special Build Tool SOURCE="$(InputPath)" PreLink_Cmds=echo This configuration requires cryptopp.dll. echo You can build it yourself using the cryptdll project, or echo obtain a pre-built, FIPS 140-2 validated DLL. If you build it yourself echo the resulting DLL will not be considered FIPS validated echo unless it undergoes FIPS validation. # End Special Build Tool !ELSEIF "$(CFG)" == "cryptest - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "cryptes0" # PROP BASE Intermediate_Dir "cryptes0" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 0 # PROP Output_Dir "CTRelease" # PROP Intermediate_Dir "CTRelease" # PROP Ignore_Export_Lib 0 # PROP Target_Dir "" # ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c # ADD CPP /nologo /MT /W3 /GR /GX /Zi /O1 /Ob2 /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "WIN32" /YX /FD /Zm400 /c # ADD BASE RSC /l 0x409 /d "NDEBUG" # ADD RSC /l 0x409 /d "NDEBUG" BSC32=bscmake.exe # ADD BASE BSC32 /nologo # ADD BSC32 /nologo LINK32=link.exe # ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 # ADD LINK32 advapi32.lib Ws2_32.lib /nologo /subsystem:console /map /debug /machine:I386 /OPT:NOWIN98 /OPT:REF /OPT:ICF # SUBTRACT LINK32 /pdb:none !ELSEIF "$(CFG)" == "cryptest - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "cryptes1" # PROP BASE Intermediate_Dir "cryptes1" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "CTDebug" # PROP Intermediate_Dir "CTDebug" # PROP Ignore_Export_Lib 0 # PROP Target_Dir "" # ADD BASE CPP /nologo /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c # ADD CPP /nologo /MTd /W3 /GR /GX /Zi /Oi /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "WIN32" /YX /FD /Zm400 /c # ADD BASE RSC /l 0x409 /d "_DEBUG" # ADD RSC /l 0x409 /d "_DEBUG" BSC32=bscmake.exe # ADD BASE BSC32 /nologo # ADD BSC32 /nologo LINK32=link.exe # ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept # ADD LINK32 advapi32.lib Ws2_32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /OPT:NOWIN98 # SUBTRACT LINK32 /pdb:none !ENDIF # Begin Target # Name "cryptest - Win32 DLL-Import Release" # Name "cryptest - Win32 DLL-Import Debug" # Name "cryptest - Win32 Release" # Name "cryptest - Win32 Debug" # Begin Group "Source Code" # PROP Default_Filter ".cpp;.h" # Begin Source File SOURCE=.\adhoc.cpp # End Source File # Begin Source File SOURCE=.\bench.cpp # End Source File # Begin Source File SOURCE=.\bench.h # End Source File # Begin Source File SOURCE=.\bench2.cpp # End Source File # Begin Source File SOURCE=.\datatest.cpp # End Source File # Begin Source File SOURCE=.\dlltest.cpp # End Source File # Begin Source File SOURCE=.\fipsalgt.cpp # End Source File # Begin Source File SOURCE=.\regtest.cpp # End Source File # Begin Source File SOURCE=.\test.cpp # End Source File # Begin Source File SOURCE=.\validat1.cpp # End Source File # Begin Source File SOURCE=.\validat2.cpp # End Source File # Begin Source File SOURCE=.\validat3.cpp # End Source File # Begin Source File SOURCE=.\validate.h # End Source File # End Group # End Target # End Project armory-0.92.3/cppForSwig/cryptopp/safer.cpp0000755000000000000000000001414712414772654017411 0ustar rootroot// safer.cpp - modified by by Wei Dai from Richard De Moliner's safer.c #include "pch.h" #include "safer.h" #include "misc.h" #include "argnames.h" NAMESPACE_BEGIN(CryptoPP) const byte SAFER::Base::exp_tab[256] = {1, 45, 226, 147, 190, 69, 21, 174, 120, 3, 135, 164, 184, 56, 207, 63, 8, 103, 9, 148, 235, 38, 168, 107, 189, 24, 52, 27, 187, 191, 114, 247, 64, 53, 72, 156, 81, 47, 59, 85, 227, 192, 159, 216, 211, 243, 141, 177, 255, 167, 62, 220, 134, 119, 215, 166, 17, 251, 244, 186, 146, 145, 100, 131, 241, 51, 239, 218, 44, 181, 178, 43, 136, 209, 153, 203, 140, 132, 29, 20, 129, 151, 113, 202, 95, 163, 139, 87, 60, 130, 196, 82, 92, 28, 232, 160, 4, 180, 133, 74, 246, 19, 84, 182, 223, 12, 26, 142, 222, 224, 57, 252, 32, 155, 36, 78, 169, 152, 158, 171, 242, 96, 208, 108, 234, 250, 199, 217, 0, 212, 31, 110, 67, 188, 236, 83, 137, 254, 122, 93, 73, 201, 50, 194, 249, 154, 248, 109, 22, 219, 89, 150, 68, 233, 205, 230, 70, 66, 143, 10, 193, 204, 185, 101, 176, 210, 198, 172, 30, 65, 98, 41, 46, 14, 116, 80, 2, 90, 195, 37, 123, 138, 42, 91, 240, 6, 13, 71, 111, 112, 157, 126, 16, 206, 18, 39, 213, 76, 79, 214, 121, 48, 104, 54, 117, 125, 228, 237, 128, 106, 144, 55, 162, 94, 118, 170, 197, 127, 61, 175, 165, 229, 25, 97, 253, 77, 124, 183, 11, 238, 173, 75, 34, 245, 231, 115, 35, 33, 200, 5, 225, 102, 221, 179, 88, 105, 99, 86, 15, 161, 49, 149, 23, 7, 58, 40}; const byte SAFER::Base::log_tab[256] = {128, 0, 176, 9, 96, 239, 185, 253, 16, 18, 159, 228, 105, 186, 173, 248, 192, 56, 194, 101, 79, 6, 148, 252, 25, 222, 106, 27, 93, 78, 168, 130, 112, 237, 232, 236, 114, 179, 21, 195, 255, 171, 182, 71, 68, 1, 172, 37, 201, 250, 142, 65, 26, 33, 203, 211, 13, 110, 254, 38, 88, 218, 50, 15, 32, 169, 157, 132, 152, 5, 156, 187, 34, 140, 99, 231, 197, 225, 115, 198, 175, 36, 91, 135, 102, 39, 247, 87, 244, 150, 177, 183, 92, 139, 213, 84, 121, 223, 170, 246, 62, 163, 241, 17, 202, 245, 209, 23, 123, 147, 131, 188, 189, 82, 30, 235, 174, 204, 214, 53, 8, 200, 138, 180, 226, 205, 191, 217, 208, 80, 89, 63, 77, 98, 52, 10, 72, 136, 181, 86, 76, 46, 107, 158, 210, 61, 60, 3, 19, 251, 151, 81, 117, 74, 145, 113, 35, 190, 118, 42, 95, 249, 212, 85, 11, 220, 55, 49, 22, 116, 215, 119, 167, 230, 7, 219, 164, 47, 70, 243, 97, 69, 103, 227, 12, 162, 59, 28, 133, 24, 4, 29, 41, 160, 143, 178, 90, 216, 166, 126, 238, 141, 83, 75, 161, 154, 193, 14, 122, 73, 165, 44, 129, 196, 199, 54, 43, 127, 67, 149, 51, 242, 108, 104, 109, 240, 2, 40, 206, 221, 155, 234, 94, 153, 124, 20, 134, 207, 229, 66, 184, 64, 120, 45, 58, 233, 100, 31, 146, 144, 125, 57, 111, 224, 137, 48}; #define EXP(x) exp_tab[(x)] #define LOG(x) log_tab[(x)] #define PHT(x, y) { y += x; x += y; } #define IPHT(x, y) { x -= y; y -= x; } static const unsigned int BLOCKSIZE = 8; static const unsigned int MAX_ROUNDS = 13; void SAFER::Base::UncheckedSetKey(const byte *userkey_1, unsigned int length, const NameValuePairs ¶ms) { bool strengthened = Strengthened(); unsigned int nof_rounds = params.GetIntValueWithDefault(Name::Rounds(), length == 8 ? (strengthened ? 8 : 6) : 10); const byte *userkey_2 = length == 8 ? userkey_1 : userkey_1 + 8; keySchedule.New(1 + BLOCKSIZE * (1 + 2 * nof_rounds)); unsigned int i, j; byte *key = keySchedule; SecByteBlock ka(BLOCKSIZE + 1), kb(BLOCKSIZE + 1); if (MAX_ROUNDS < nof_rounds) nof_rounds = MAX_ROUNDS; *key++ = (unsigned char)nof_rounds; ka[BLOCKSIZE] = 0; kb[BLOCKSIZE] = 0; for (j = 0; j < BLOCKSIZE; j++) { ka[BLOCKSIZE] ^= ka[j] = rotlFixed(userkey_1[j], 5U); kb[BLOCKSIZE] ^= kb[j] = *key++ = userkey_2[j]; } for (i = 1; i <= nof_rounds; i++) { for (j = 0; j < BLOCKSIZE + 1; j++) { ka[j] = rotlFixed(ka[j], 6U); kb[j] = rotlFixed(kb[j], 6U); } for (j = 0; j < BLOCKSIZE; j++) if (strengthened) *key++ = (ka[(j + 2 * i - 1) % (BLOCKSIZE + 1)] + exp_tab[exp_tab[18 * i + j + 1]]) & 0xFF; else *key++ = (ka[j] + exp_tab[exp_tab[18 * i + j + 1]]) & 0xFF; for (j = 0; j < BLOCKSIZE; j++) if (strengthened) *key++ = (kb[(j + 2 * i) % (BLOCKSIZE + 1)] + exp_tab[exp_tab[18 * i + j + 10]]) & 0xFF; else *key++ = (kb[j] + exp_tab[exp_tab[18 * i + j + 10]]) & 0xFF; } } typedef BlockGetAndPut Block; void SAFER::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { byte a, b, c, d, e, f, g, h, t; const byte *key = keySchedule+1; unsigned int round = keySchedule[0]; Block::Get(inBlock)(a)(b)(c)(d)(e)(f)(g)(h); while(round--) { a ^= key[0]; b += key[1]; c += key[2]; d ^= key[3]; e ^= key[4]; f += key[5]; g += key[6]; h ^= key[7]; a = EXP(a) + key[ 8]; b = LOG(b) ^ key[ 9]; c = LOG(c) ^ key[10]; d = EXP(d) + key[11]; e = EXP(e) + key[12]; f = LOG(f) ^ key[13]; g = LOG(g) ^ key[14]; h = EXP(h) + key[15]; key += 16; PHT(a, b); PHT(c, d); PHT(e, f); PHT(g, h); PHT(a, c); PHT(e, g); PHT(b, d); PHT(f, h); PHT(a, e); PHT(b, f); PHT(c, g); PHT(d, h); t = b; b = e; e = c; c = t; t = d; d = f; f = g; g = t; } a ^= key[0]; b += key[1]; c += key[2]; d ^= key[3]; e ^= key[4]; f += key[5]; g += key[6]; h ^= key[7]; Block::Put(xorBlock, outBlock)(a)(b)(c)(d)(e)(f)(g)(h); } void SAFER::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { byte a, b, c, d, e, f, g, h, t; unsigned int round = keySchedule[0]; const byte *key = keySchedule + BLOCKSIZE * (1 + 2 * round) - 7; Block::Get(inBlock)(a)(b)(c)(d)(e)(f)(g)(h); h ^= key[7]; g -= key[6]; f -= key[5]; e ^= key[4]; d ^= key[3]; c -= key[2]; b -= key[1]; a ^= key[0]; while (round--) { key -= 16; t = e; e = b; b = c; c = t; t = f; f = d; d = g; g = t; IPHT(a, e); IPHT(b, f); IPHT(c, g); IPHT(d, h); IPHT(a, c); IPHT(e, g); IPHT(b, d); IPHT(f, h); IPHT(a, b); IPHT(c, d); IPHT(e, f); IPHT(g, h); h -= key[15]; g ^= key[14]; f ^= key[13]; e -= key[12]; d -= key[11]; c ^= key[10]; b ^= key[9]; a -= key[8]; h = LOG(h) ^ key[7]; g = EXP(g) - key[6]; f = EXP(f) - key[5]; e = LOG(e) ^ key[4]; d = LOG(d) ^ key[3]; c = EXP(c) - key[2]; b = EXP(b) - key[1]; a = LOG(a) ^ key[0]; } Block::Put(xorBlock, outBlock)(a)(b)(c)(d)(e)(f)(g)(h); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/queue.cpp0000755000000000000000000002707612414772654017442 0ustar rootroot// queue.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "queue.h" #include "filters.h" NAMESPACE_BEGIN(CryptoPP) static const unsigned int s_maxAutoNodeSize = 16*1024; // this class for use by ByteQueue only class ByteQueueNode { public: ByteQueueNode(size_t maxSize) : buf(maxSize) { m_head = m_tail = 0; next = 0; } inline size_t MaxSize() const {return buf.size();} inline size_t CurrentSize() const { return m_tail-m_head; } inline bool UsedUp() const { return (m_head==MaxSize()); } inline void Clear() { m_head = m_tail = 0; } inline size_t Put(const byte *begin, size_t length) { size_t l = STDMIN(length, MaxSize()-m_tail); if (buf+m_tail != begin) memcpy(buf+m_tail, begin, l); m_tail += l; return l; } inline size_t Peek(byte &outByte) const { if (m_tail==m_head) return 0; outByte=buf[m_head]; return 1; } inline size_t Peek(byte *target, size_t copyMax) const { size_t len = STDMIN(copyMax, m_tail-m_head); memcpy(target, buf+m_head, len); return len; } inline size_t CopyTo(BufferedTransformation &target, const std::string &channel=DEFAULT_CHANNEL) const { size_t len = m_tail-m_head; target.ChannelPut(channel, buf+m_head, len); return len; } inline size_t CopyTo(BufferedTransformation &target, size_t copyMax, const std::string &channel=DEFAULT_CHANNEL) const { size_t len = STDMIN(copyMax, m_tail-m_head); target.ChannelPut(channel, buf+m_head, len); return len; } inline size_t Get(byte &outByte) { size_t len = Peek(outByte); m_head += len; return len; } inline size_t Get(byte *outString, size_t getMax) { size_t len = Peek(outString, getMax); m_head += len; return len; } inline size_t TransferTo(BufferedTransformation &target, const std::string &channel=DEFAULT_CHANNEL) { size_t len = m_tail-m_head; target.ChannelPutModifiable(channel, buf+m_head, len); m_head = m_tail; return len; } inline size_t TransferTo(BufferedTransformation &target, lword transferMax, const std::string &channel=DEFAULT_CHANNEL) { size_t len = UnsignedMin(m_tail-m_head, transferMax); target.ChannelPutModifiable(channel, buf+m_head, len); m_head += len; return len; } inline size_t Skip(size_t skipMax) { size_t len = STDMIN(skipMax, m_tail-m_head); m_head += len; return len; } inline byte operator[](size_t i) const { return buf[m_head+i]; } ByteQueueNode *next; SecByteBlock buf; size_t m_head, m_tail; }; // ******************************************************** ByteQueue::ByteQueue(size_t nodeSize) : m_lazyString(NULL), m_lazyLength(0) { SetNodeSize(nodeSize); m_head = m_tail = new ByteQueueNode(m_nodeSize); } void ByteQueue::SetNodeSize(size_t nodeSize) { m_autoNodeSize = !nodeSize; m_nodeSize = m_autoNodeSize ? 256 : nodeSize; } ByteQueue::ByteQueue(const ByteQueue ©) : m_lazyString(NULL) { CopyFrom(copy); } void ByteQueue::CopyFrom(const ByteQueue ©) { m_lazyLength = 0; m_autoNodeSize = copy.m_autoNodeSize; m_nodeSize = copy.m_nodeSize; m_head = m_tail = new ByteQueueNode(*copy.m_head); for (ByteQueueNode *current=copy.m_head->next; current; current=current->next) { m_tail->next = new ByteQueueNode(*current); m_tail = m_tail->next; } m_tail->next = NULL; Put(copy.m_lazyString, copy.m_lazyLength); } ByteQueue::~ByteQueue() { Destroy(); } void ByteQueue::Destroy() { for (ByteQueueNode *next, *current=m_head; current; current=next) { next=current->next; delete current; } } void ByteQueue::IsolatedInitialize(const NameValuePairs ¶meters) { m_nodeSize = parameters.GetIntValueWithDefault("NodeSize", 256); Clear(); } lword ByteQueue::CurrentSize() const { lword size=0; for (ByteQueueNode *current=m_head; current; current=current->next) size += current->CurrentSize(); return size + m_lazyLength; } bool ByteQueue::IsEmpty() const { return m_head==m_tail && m_head->CurrentSize()==0 && m_lazyLength==0; } void ByteQueue::Clear() { for (ByteQueueNode *next, *current=m_head->next; current; current=next) { next=current->next; delete current; } m_tail = m_head; m_head->Clear(); m_head->next = NULL; m_lazyLength = 0; } size_t ByteQueue::Put2(const byte *inString, size_t length, int messageEnd, bool blocking) { if (m_lazyLength > 0) FinalizeLazyPut(); size_t len; while ((len=m_tail->Put(inString, length)) < length) { inString += len; length -= len; if (m_autoNodeSize && m_nodeSize < s_maxAutoNodeSize) do { m_nodeSize *= 2; } while (m_nodeSize < length && m_nodeSize < s_maxAutoNodeSize); m_tail->next = new ByteQueueNode(STDMAX(m_nodeSize, length)); m_tail = m_tail->next; } return 0; } void ByteQueue::CleanupUsedNodes() { while (m_head != m_tail && m_head->UsedUp()) { ByteQueueNode *temp=m_head; m_head=m_head->next; delete temp; } if (m_head->CurrentSize() == 0) m_head->Clear(); } void ByteQueue::LazyPut(const byte *inString, size_t size) { if (m_lazyLength > 0) FinalizeLazyPut(); if (inString == m_tail->buf+m_tail->m_tail) Put(inString, size); else { m_lazyString = const_cast(inString); m_lazyLength = size; m_lazyStringModifiable = false; } } void ByteQueue::LazyPutModifiable(byte *inString, size_t size) { if (m_lazyLength > 0) FinalizeLazyPut(); m_lazyString = inString; m_lazyLength = size; m_lazyStringModifiable = true; } void ByteQueue::UndoLazyPut(size_t size) { if (m_lazyLength < size) throw InvalidArgument("ByteQueue: size specified for UndoLazyPut is too large"); m_lazyLength -= size; } void ByteQueue::FinalizeLazyPut() { size_t len = m_lazyLength; m_lazyLength = 0; if (len) Put(m_lazyString, len); } size_t ByteQueue::Get(byte &outByte) { if (m_head->Get(outByte)) { if (m_head->UsedUp()) CleanupUsedNodes(); return 1; } else if (m_lazyLength > 0) { outByte = *m_lazyString++; m_lazyLength--; return 1; } else return 0; } size_t ByteQueue::Get(byte *outString, size_t getMax) { ArraySink sink(outString, getMax); return (size_t)TransferTo(sink, getMax); } size_t ByteQueue::Peek(byte &outByte) const { if (m_head->Peek(outByte)) return 1; else if (m_lazyLength > 0) { outByte = *m_lazyString; return 1; } else return 0; } size_t ByteQueue::Peek(byte *outString, size_t peekMax) const { ArraySink sink(outString, peekMax); return (size_t)CopyTo(sink, peekMax); } size_t ByteQueue::TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel, bool blocking) { if (blocking) { lword bytesLeft = transferBytes; for (ByteQueueNode *current=m_head; bytesLeft && current; current=current->next) bytesLeft -= current->TransferTo(target, bytesLeft, channel); CleanupUsedNodes(); size_t len = (size_t)STDMIN(bytesLeft, (lword)m_lazyLength); if (len) { if (m_lazyStringModifiable) target.ChannelPutModifiable(channel, m_lazyString, len); else target.ChannelPut(channel, m_lazyString, len); m_lazyString += len; m_lazyLength -= len; bytesLeft -= len; } transferBytes -= bytesLeft; return 0; } else { Walker walker(*this); size_t blockedBytes = walker.TransferTo2(target, transferBytes, channel, blocking); Skip(transferBytes); return blockedBytes; } } size_t ByteQueue::CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end, const std::string &channel, bool blocking) const { Walker walker(*this); walker.Skip(begin); lword transferBytes = end-begin; size_t blockedBytes = walker.TransferTo2(target, transferBytes, channel, blocking); begin += transferBytes; return blockedBytes; } void ByteQueue::Unget(byte inByte) { Unget(&inByte, 1); } void ByteQueue::Unget(const byte *inString, size_t length) { size_t len = STDMIN(length, m_head->m_head); length -= len; m_head->m_head -= len; memcpy(m_head->buf + m_head->m_head, inString + length, len); if (length > 0) { ByteQueueNode *newHead = new ByteQueueNode(length); newHead->next = m_head; m_head = newHead; m_head->Put(inString, length); } } const byte * ByteQueue::Spy(size_t &contiguousSize) const { contiguousSize = m_head->m_tail - m_head->m_head; if (contiguousSize == 0 && m_lazyLength > 0) { contiguousSize = m_lazyLength; return m_lazyString; } else return m_head->buf + m_head->m_head; } byte * ByteQueue::CreatePutSpace(size_t &size) { if (m_lazyLength > 0) FinalizeLazyPut(); if (m_tail->m_tail == m_tail->MaxSize()) { m_tail->next = new ByteQueueNode(STDMAX(m_nodeSize, size)); m_tail = m_tail->next; } size = m_tail->MaxSize() - m_tail->m_tail; return m_tail->buf + m_tail->m_tail; } ByteQueue & ByteQueue::operator=(const ByteQueue &rhs) { Destroy(); CopyFrom(rhs); return *this; } bool ByteQueue::operator==(const ByteQueue &rhs) const { const lword currentSize = CurrentSize(); if (currentSize != rhs.CurrentSize()) return false; Walker walker1(*this), walker2(rhs); byte b1, b2; while (walker1.Get(b1) && walker2.Get(b2)) if (b1 != b2) return false; return true; } byte ByteQueue::operator[](lword i) const { for (ByteQueueNode *current=m_head; current; current=current->next) { if (i < current->CurrentSize()) return (*current)[(size_t)i]; i -= current->CurrentSize(); } assert(i < m_lazyLength); return m_lazyString[i]; } void ByteQueue::swap(ByteQueue &rhs) { std::swap(m_autoNodeSize, rhs.m_autoNodeSize); std::swap(m_nodeSize, rhs.m_nodeSize); std::swap(m_head, rhs.m_head); std::swap(m_tail, rhs.m_tail); std::swap(m_lazyString, rhs.m_lazyString); std::swap(m_lazyLength, rhs.m_lazyLength); std::swap(m_lazyStringModifiable, rhs.m_lazyStringModifiable); } // ******************************************************** void ByteQueue::Walker::IsolatedInitialize(const NameValuePairs ¶meters) { m_node = m_queue.m_head; m_position = 0; m_offset = 0; m_lazyString = m_queue.m_lazyString; m_lazyLength = m_queue.m_lazyLength; } size_t ByteQueue::Walker::Get(byte &outByte) { ArraySink sink(&outByte, 1); return (size_t)TransferTo(sink, 1); } size_t ByteQueue::Walker::Get(byte *outString, size_t getMax) { ArraySink sink(outString, getMax); return (size_t)TransferTo(sink, getMax); } size_t ByteQueue::Walker::Peek(byte &outByte) const { ArraySink sink(&outByte, 1); return (size_t)CopyTo(sink, 1); } size_t ByteQueue::Walker::Peek(byte *outString, size_t peekMax) const { ArraySink sink(outString, peekMax); return (size_t)CopyTo(sink, peekMax); } size_t ByteQueue::Walker::TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel, bool blocking) { lword bytesLeft = transferBytes; size_t blockedBytes = 0; while (m_node) { size_t len = (size_t)STDMIN(bytesLeft, (lword)m_node->CurrentSize()-m_offset); blockedBytes = target.ChannelPut2(channel, m_node->buf+m_node->m_head+m_offset, len, 0, blocking); if (blockedBytes) goto done; m_position += len; bytesLeft -= len; if (!bytesLeft) { m_offset += len; goto done; } m_node = m_node->next; m_offset = 0; } if (bytesLeft && m_lazyLength) { size_t len = (size_t)STDMIN(bytesLeft, (lword)m_lazyLength); blockedBytes = target.ChannelPut2(channel, m_lazyString, len, 0, blocking); if (blockedBytes) goto done; m_lazyString += len; m_lazyLength -= len; bytesLeft -= len; } done: transferBytes -= bytesLeft; return blockedBytes; } size_t ByteQueue::Walker::CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end, const std::string &channel, bool blocking) const { Walker walker(*this); walker.Skip(begin); lword transferBytes = end-begin; size_t blockedBytes = walker.TransferTo2(target, transferBytes, channel, blocking); begin += transferBytes; return blockedBytes; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/gf2n.h0000755000000000000000000002722012414772654016606 0ustar rootroot#ifndef CRYPTOPP_GF2N_H #define CRYPTOPP_GF2N_H /*! \file */ #include "cryptlib.h" #include "secblock.h" #include "misc.h" #include "algebra.h" #include NAMESPACE_BEGIN(CryptoPP) //! Polynomial with Coefficients in GF(2) /*! \nosubgrouping */ class CRYPTOPP_DLL PolynomialMod2 { public: //! \name ENUMS, EXCEPTIONS, and TYPEDEFS //@{ //! divide by zero exception class DivideByZero : public Exception { public: DivideByZero() : Exception(OTHER_ERROR, "PolynomialMod2: division by zero") {} }; typedef unsigned int RandomizationParameter; //@} //! \name CREATORS //@{ //! creates the zero polynomial PolynomialMod2(); //! copy constructor PolynomialMod2(const PolynomialMod2& t); //! convert from word /*! value should be encoded with the least significant bit as coefficient to x^0 and most significant bit as coefficient to x^(WORD_BITS-1) bitLength denotes how much memory to allocate initially */ PolynomialMod2(word value, size_t bitLength=WORD_BITS); //! convert from big-endian byte array PolynomialMod2(const byte *encodedPoly, size_t byteCount) {Decode(encodedPoly, byteCount);} //! convert from big-endian form stored in a BufferedTransformation PolynomialMod2(BufferedTransformation &encodedPoly, size_t byteCount) {Decode(encodedPoly, byteCount);} //! create a random polynomial uniformly distributed over all polynomials with degree less than bitcount PolynomialMod2(RandomNumberGenerator &rng, size_t bitcount) {Randomize(rng, bitcount);} //! return x^i static PolynomialMod2 CRYPTOPP_API Monomial(size_t i); //! return x^t0 + x^t1 + x^t2 static PolynomialMod2 CRYPTOPP_API Trinomial(size_t t0, size_t t1, size_t t2); //! return x^t0 + x^t1 + x^t2 + x^t3 + x^t4 static PolynomialMod2 CRYPTOPP_API Pentanomial(size_t t0, size_t t1, size_t t2, size_t t3, size_t t4); //! return x^(n-1) + ... + x + 1 static PolynomialMod2 CRYPTOPP_API AllOnes(size_t n); //! static const PolynomialMod2 & CRYPTOPP_API Zero(); //! static const PolynomialMod2 & CRYPTOPP_API One(); //@} //! \name ENCODE/DECODE //@{ //! minimum number of bytes to encode this polynomial /*! MinEncodedSize of 0 is 1 */ unsigned int MinEncodedSize() const {return STDMAX(1U, ByteCount());} //! encode in big-endian format /*! if outputLen < MinEncodedSize, the most significant bytes will be dropped if outputLen > MinEncodedSize, the most significant bytes will be padded */ void Encode(byte *output, size_t outputLen) const; //! void Encode(BufferedTransformation &bt, size_t outputLen) const; //! void Decode(const byte *input, size_t inputLen); //! //* Precondition: bt.MaxRetrievable() >= inputLen void Decode(BufferedTransformation &bt, size_t inputLen); //! encode value as big-endian octet string void DEREncodeAsOctetString(BufferedTransformation &bt, size_t length) const; //! decode value as big-endian octet string void BERDecodeAsOctetString(BufferedTransformation &bt, size_t length); //@} //! \name ACCESSORS //@{ //! number of significant bits = Degree() + 1 unsigned int BitCount() const; //! number of significant bytes = ceiling(BitCount()/8) unsigned int ByteCount() const; //! number of significant words = ceiling(ByteCount()/sizeof(word)) unsigned int WordCount() const; //! return the n-th bit, n=0 being the least significant bit bool GetBit(size_t n) const {return GetCoefficient(n)!=0;} //! return the n-th byte byte GetByte(size_t n) const; //! the zero polynomial will return a degree of -1 signed int Degree() const {return BitCount()-1;} //! degree + 1 unsigned int CoefficientCount() const {return BitCount();} //! return coefficient for x^i int GetCoefficient(size_t i) const {return (i/WORD_BITS < reg.size()) ? int(reg[i/WORD_BITS] >> (i % WORD_BITS)) & 1 : 0;} //! return coefficient for x^i int operator[](unsigned int i) const {return GetCoefficient(i);} //! bool IsZero() const {return !*this;} //! bool Equals(const PolynomialMod2 &rhs) const; //@} //! \name MANIPULATORS //@{ //! PolynomialMod2& operator=(const PolynomialMod2& t); //! PolynomialMod2& operator&=(const PolynomialMod2& t); //! PolynomialMod2& operator^=(const PolynomialMod2& t); //! PolynomialMod2& operator+=(const PolynomialMod2& t) {return *this ^= t;} //! PolynomialMod2& operator-=(const PolynomialMod2& t) {return *this ^= t;} //! PolynomialMod2& operator*=(const PolynomialMod2& t); //! PolynomialMod2& operator/=(const PolynomialMod2& t); //! PolynomialMod2& operator%=(const PolynomialMod2& t); //! PolynomialMod2& operator<<=(unsigned int); //! PolynomialMod2& operator>>=(unsigned int); //! void Randomize(RandomNumberGenerator &rng, size_t bitcount); //! void SetBit(size_t i, int value = 1); //! set the n-th byte to value void SetByte(size_t n, byte value); //! void SetCoefficient(size_t i, int value) {SetBit(i, value);} //! void swap(PolynomialMod2 &a) {reg.swap(a.reg);} //@} //! \name UNARY OPERATORS //@{ //! bool operator!() const; //! PolynomialMod2 operator+() const {return *this;} //! PolynomialMod2 operator-() const {return *this;} //@} //! \name BINARY OPERATORS //@{ //! PolynomialMod2 And(const PolynomialMod2 &b) const; //! PolynomialMod2 Xor(const PolynomialMod2 &b) const; //! PolynomialMod2 Plus(const PolynomialMod2 &b) const {return Xor(b);} //! PolynomialMod2 Minus(const PolynomialMod2 &b) const {return Xor(b);} //! PolynomialMod2 Times(const PolynomialMod2 &b) const; //! PolynomialMod2 DividedBy(const PolynomialMod2 &b) const; //! PolynomialMod2 Modulo(const PolynomialMod2 &b) const; //! PolynomialMod2 operator>>(unsigned int n) const; //! PolynomialMod2 operator<<(unsigned int n) const; //@} //! \name OTHER ARITHMETIC FUNCTIONS //@{ //! sum modulo 2 of all coefficients unsigned int Parity() const; //! check for irreducibility bool IsIrreducible() const; //! is always zero since we're working modulo 2 PolynomialMod2 Doubled() const {return Zero();} //! PolynomialMod2 Squared() const; //! only 1 is a unit bool IsUnit() const {return Equals(One());} //! return inverse if *this is a unit, otherwise return 0 PolynomialMod2 MultiplicativeInverse() const {return IsUnit() ? One() : Zero();} //! greatest common divisor static PolynomialMod2 CRYPTOPP_API Gcd(const PolynomialMod2 &a, const PolynomialMod2 &n); //! calculate multiplicative inverse of *this mod n PolynomialMod2 InverseMod(const PolynomialMod2 &) const; //! calculate r and q such that (a == d*q + r) && (deg(r) < deg(d)) static void CRYPTOPP_API Divide(PolynomialMod2 &r, PolynomialMod2 &q, const PolynomialMod2 &a, const PolynomialMod2 &d); //@} //! \name INPUT/OUTPUT //@{ //! friend std::ostream& operator<<(std::ostream& out, const PolynomialMod2 &a); //@} private: friend class GF2NT; SecWordBlock reg; }; //! inline bool operator==(const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) {return a.Equals(b);} //! inline bool operator!=(const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) {return !(a==b);} //! compares degree inline bool operator> (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) {return a.Degree() > b.Degree();} //! compares degree inline bool operator>=(const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) {return a.Degree() >= b.Degree();} //! compares degree inline bool operator< (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) {return a.Degree() < b.Degree();} //! compares degree inline bool operator<=(const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) {return a.Degree() <= b.Degree();} //! inline CryptoPP::PolynomialMod2 operator&(const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) {return a.And(b);} //! inline CryptoPP::PolynomialMod2 operator^(const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) {return a.Xor(b);} //! inline CryptoPP::PolynomialMod2 operator+(const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) {return a.Plus(b);} //! inline CryptoPP::PolynomialMod2 operator-(const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) {return a.Minus(b);} //! inline CryptoPP::PolynomialMod2 operator*(const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) {return a.Times(b);} //! inline CryptoPP::PolynomialMod2 operator/(const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) {return a.DividedBy(b);} //! inline CryptoPP::PolynomialMod2 operator%(const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) {return a.Modulo(b);} // CodeWarrior 8 workaround: put these template instantiations after overloaded operator declarations, // but before the use of QuotientRing > for VC .NET 2003 CRYPTOPP_DLL_TEMPLATE_CLASS AbstractGroup; CRYPTOPP_DLL_TEMPLATE_CLASS AbstractRing; CRYPTOPP_DLL_TEMPLATE_CLASS AbstractEuclideanDomain; CRYPTOPP_DLL_TEMPLATE_CLASS EuclideanDomainOf; CRYPTOPP_DLL_TEMPLATE_CLASS QuotientRing >; //! GF(2^n) with Polynomial Basis class CRYPTOPP_DLL GF2NP : public QuotientRing > { public: GF2NP(const PolynomialMod2 &modulus); virtual GF2NP * Clone() const {return new GF2NP(*this);} virtual void DEREncode(BufferedTransformation &bt) const {assert(false);} // no ASN.1 syntax yet for general polynomial basis void DEREncodeElement(BufferedTransformation &out, const Element &a) const; void BERDecodeElement(BufferedTransformation &in, Element &a) const; bool Equal(const Element &a, const Element &b) const {assert(a.Degree() < m_modulus.Degree() && b.Degree() < m_modulus.Degree()); return a.Equals(b);} bool IsUnit(const Element &a) const {assert(a.Degree() < m_modulus.Degree()); return !!a;} unsigned int MaxElementBitLength() const {return m;} unsigned int MaxElementByteLength() const {return (unsigned int)BitsToBytes(MaxElementBitLength());} Element SquareRoot(const Element &a) const; Element HalfTrace(const Element &a) const; // returns z such that z^2 + z == a Element SolveQuadraticEquation(const Element &a) const; protected: unsigned int m; }; //! GF(2^n) with Trinomial Basis class CRYPTOPP_DLL GF2NT : public GF2NP { public: // polynomial modulus = x^t0 + x^t1 + x^t2, t0 > t1 > t2 GF2NT(unsigned int t0, unsigned int t1, unsigned int t2); GF2NP * Clone() const {return new GF2NT(*this);} void DEREncode(BufferedTransformation &bt) const; const Element& Multiply(const Element &a, const Element &b) const; const Element& Square(const Element &a) const {return Reduced(a.Squared());} const Element& MultiplicativeInverse(const Element &a) const; private: const Element& Reduced(const Element &a) const; unsigned int t0, t1; mutable PolynomialMod2 result; }; //! GF(2^n) with Pentanomial Basis class CRYPTOPP_DLL GF2NPP : public GF2NP { public: // polynomial modulus = x^t0 + x^t1 + x^t2 + x^t3 + x^t4, t0 > t1 > t2 > t3 > t4 GF2NPP(unsigned int t0, unsigned int t1, unsigned int t2, unsigned int t3, unsigned int t4) : GF2NP(PolynomialMod2::Pentanomial(t0, t1, t2, t3, t4)), t0(t0), t1(t1), t2(t2), t3(t3) {} GF2NP * Clone() const {return new GF2NPP(*this);} void DEREncode(BufferedTransformation &bt) const; private: unsigned int t0, t1, t2, t3; }; // construct new GF2NP from the ASN.1 sequence Characteristic-two CRYPTOPP_DLL GF2NP * CRYPTOPP_API BERDecodeGF2NP(BufferedTransformation &bt); NAMESPACE_END #ifndef __BORLANDC__ NAMESPACE_BEGIN(std) template<> inline void swap(CryptoPP::PolynomialMod2 &a, CryptoPP::PolynomialMod2 &b) { a.swap(b); } NAMESPACE_END #endif #endif armory-0.92.3/cppForSwig/cryptopp/dmac.h0000755000000000000000000000476312414772654016665 0ustar rootroot#ifndef CRYPTOPP_DMAC_H #define CRYPTOPP_DMAC_H #include "cbcmac.h" NAMESPACE_BEGIN(CryptoPP) //! _ template class CRYPTOPP_NO_VTABLE DMAC_Base : public SameKeyLengthAs, public MessageAuthenticationCode { public: static std::string StaticAlgorithmName() {return std::string("DMAC(") + T::StaticAlgorithmName() + ")";} CRYPTOPP_CONSTANT(DIGESTSIZE=T::BLOCKSIZE) DMAC_Base() {} void UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms); void Update(const byte *input, size_t length); void TruncatedFinal(byte *mac, size_t size); unsigned int DigestSize() const {return DIGESTSIZE;} private: byte *GenerateSubKeys(const byte *key, size_t keylength); size_t m_subkeylength; SecByteBlock m_subkeys; CBC_MAC m_mac1; typename T::Encryption m_f2; unsigned int m_counter; }; //! DMAC /*! Based on "CBC MAC for Real-Time Data Sources" by Erez Petrank and Charles Rackoff. T should be a class derived from BlockCipherDocumentation. */ template class DMAC : public MessageAuthenticationCodeFinal > { public: DMAC() {} DMAC(const byte *key, size_t length=DMAC_Base::DEFAULT_KEYLENGTH) {this->SetKey(key, length);} }; template void DMAC_Base::UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms) { m_subkeylength = T::StaticGetValidKeyLength(T::BLOCKSIZE); m_subkeys.resize(2*UnsignedMin((unsigned int)T::BLOCKSIZE, m_subkeylength)); m_mac1.SetKey(GenerateSubKeys(key, length), m_subkeylength, params); m_f2.SetKey(m_subkeys+m_subkeys.size()/2, m_subkeylength, params); m_counter = 0; m_subkeys.resize(0); } template void DMAC_Base::Update(const byte *input, size_t length) { m_mac1.Update(input, length); m_counter = (unsigned int)((m_counter + length) % T::BLOCKSIZE); } template void DMAC_Base::TruncatedFinal(byte *mac, size_t size) { ThrowIfInvalidTruncatedSize(size); byte pad[T::BLOCKSIZE]; byte padByte = byte(T::BLOCKSIZE-m_counter); memset(pad, padByte, padByte); m_mac1.Update(pad, padByte); m_mac1.TruncatedFinal(mac, size); m_f2.ProcessBlock(mac); m_counter = 0; // reset for next message } template byte *DMAC_Base::GenerateSubKeys(const byte *key, size_t keylength) { typename T::Encryption cipher(key, keylength); memset(m_subkeys, 0, m_subkeys.size()); cipher.ProcessBlock(m_subkeys); m_subkeys[m_subkeys.size()/2 + T::BLOCKSIZE - 1] = 1; cipher.ProcessBlock(m_subkeys+m_subkeys.size()/2); return m_subkeys; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/eccrypto.h0000755000000000000000000002476612414772654017616 0ustar rootroot#ifndef CRYPTOPP_ECCRYPTO_H #define CRYPTOPP_ECCRYPTO_H /*! \file */ #include "pubkey.h" #include "integer.h" #include "asn.h" #include "hmac.h" #include "sha.h" #include "gfpcrypt.h" #include "dh.h" #include "mqv.h" #include "ecp.h" #include "ec2n.h" NAMESPACE_BEGIN(CryptoPP) //! Elliptic Curve Parameters /*! This class corresponds to the ASN.1 sequence of the same name in ANSI X9.62 (also SEC 1). */ template class DL_GroupParameters_EC : public DL_GroupParametersImpl > { typedef DL_GroupParameters_EC ThisClass; public: typedef EC EllipticCurve; typedef typename EllipticCurve::Point Point; typedef Point Element; typedef IncompatibleCofactorMultiplication DefaultCofactorOption; DL_GroupParameters_EC() : m_compress(false), m_encodeAsOID(false) {} DL_GroupParameters_EC(const OID &oid) : m_compress(false), m_encodeAsOID(false) {Initialize(oid);} DL_GroupParameters_EC(const EllipticCurve &ec, const Point &G, const Integer &n, const Integer &k = Integer::Zero()) : m_compress(false), m_encodeAsOID(false) {Initialize(ec, G, n, k);} DL_GroupParameters_EC(BufferedTransformation &bt) : m_compress(false), m_encodeAsOID(false) {BERDecode(bt);} void Initialize(const EllipticCurve &ec, const Point &G, const Integer &n, const Integer &k = Integer::Zero()) { this->m_groupPrecomputation.SetCurve(ec); this->SetSubgroupGenerator(G); m_n = n; m_k = k; } void Initialize(const OID &oid); // NameValuePairs bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; void AssignFrom(const NameValuePairs &source); // GeneratibleCryptoMaterial interface //! this implementation doesn't actually generate a curve, it just initializes the parameters with existing values /*! parameters: (Curve, SubgroupGenerator, SubgroupOrder, Cofactor (optional)), or (GroupOID) */ void GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg); // DL_GroupParameters const DL_FixedBasePrecomputation & GetBasePrecomputation() const {return this->m_gpc;} DL_FixedBasePrecomputation & AccessBasePrecomputation() {return this->m_gpc;} const Integer & GetSubgroupOrder() const {return m_n;} Integer GetCofactor() const; bool ValidateGroup(RandomNumberGenerator &rng, unsigned int level) const; bool ValidateElement(unsigned int level, const Element &element, const DL_FixedBasePrecomputation *precomp) const; bool FastSubgroupCheckAvailable() const {return false;} void EncodeElement(bool reversible, const Element &element, byte *encoded) const { if (reversible) GetCurve().EncodePoint(encoded, element, m_compress); else element.x.Encode(encoded, GetEncodedElementSize(false)); } unsigned int GetEncodedElementSize(bool reversible) const { if (reversible) return GetCurve().EncodedPointSize(m_compress); else return GetCurve().GetField().MaxElementByteLength(); } Element DecodeElement(const byte *encoded, bool checkForGroupMembership) const { Point result; if (!GetCurve().DecodePoint(result, encoded, GetEncodedElementSize(true))) throw DL_BadElement(); if (checkForGroupMembership && !ValidateElement(1, result, NULL)) throw DL_BadElement(); return result; } Integer ConvertElementToInteger(const Element &element) const; Integer GetMaxExponent() const {return GetSubgroupOrder()-1;} bool IsIdentity(const Element &element) const {return element.identity;} void SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const; static std::string CRYPTOPP_API StaticAlgorithmNamePrefix() {return "EC";} // ASN1Key OID GetAlgorithmID() const; // used by MQV Element MultiplyElements(const Element &a, const Element &b) const; Element CascadeExponentiate(const Element &element1, const Integer &exponent1, const Element &element2, const Integer &exponent2) const; // non-inherited // enumerate OIDs for recommended parameters, use OID() to get first one static OID CRYPTOPP_API GetNextRecommendedParametersOID(const OID &oid); void BERDecode(BufferedTransformation &bt); void DEREncode(BufferedTransformation &bt) const; void SetPointCompression(bool compress) {m_compress = compress;} bool GetPointCompression() const {return m_compress;} void SetEncodeAsOID(bool encodeAsOID) {m_encodeAsOID = encodeAsOID;} bool GetEncodeAsOID() const {return m_encodeAsOID;} const EllipticCurve& GetCurve() const {return this->m_groupPrecomputation.GetCurve();} bool operator==(const ThisClass &rhs) const {return this->m_groupPrecomputation.GetCurve() == rhs.m_groupPrecomputation.GetCurve() && this->m_gpc.GetBase(this->m_groupPrecomputation) == rhs.m_gpc.GetBase(rhs.m_groupPrecomputation);} #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY const Point& GetBasePoint() const {return GetSubgroupGenerator();} const Integer& GetBasePointOrder() const {return GetSubgroupOrder();} void LoadRecommendedParameters(const OID &oid) {Initialize(oid);} #endif protected: unsigned int FieldElementLength() const {return GetCurve().GetField().MaxElementByteLength();} unsigned int ExponentLength() const {return m_n.ByteCount();} OID m_oid; // set if parameters loaded from a recommended curve Integer m_n; // order of base point bool m_compress, m_encodeAsOID; mutable Integer m_k; // cofactor }; //! EC public key template class DL_PublicKey_EC : public DL_PublicKeyImpl > { public: typedef typename EC::Point Element; void Initialize(const DL_GroupParameters_EC ¶ms, const Element &Q) {this->AccessGroupParameters() = params; this->SetPublicElement(Q);} void Initialize(const EC &ec, const Element &G, const Integer &n, const Element &Q) {this->AccessGroupParameters().Initialize(ec, G, n); this->SetPublicElement(Q);} // X509PublicKey void BERDecodePublicKey(BufferedTransformation &bt, bool parametersPresent, size_t size); void DEREncodePublicKey(BufferedTransformation &bt) const; }; //! EC private key template class DL_PrivateKey_EC : public DL_PrivateKeyImpl > { public: typedef typename EC::Point Element; void Initialize(const DL_GroupParameters_EC ¶ms, const Integer &x) {this->AccessGroupParameters() = params; this->SetPrivateExponent(x);} void Initialize(const EC &ec, const Element &G, const Integer &n, const Integer &x) {this->AccessGroupParameters().Initialize(ec, G, n); this->SetPrivateExponent(x);} void Initialize(RandomNumberGenerator &rng, const DL_GroupParameters_EC ¶ms) {this->GenerateRandom(rng, params);} void Initialize(RandomNumberGenerator &rng, const EC &ec, const Element &G, const Integer &n) {this->GenerateRandom(rng, DL_GroupParameters_EC(ec, G, n));} // PKCS8PrivateKey void BERDecodePrivateKey(BufferedTransformation &bt, bool parametersPresent, size_t size); void DEREncodePrivateKey(BufferedTransformation &bt) const; }; //! Elliptic Curve Diffie-Hellman, AKA ECDH template ::DefaultCofactorOption> struct ECDH { typedef DH_Domain, COFACTOR_OPTION> Domain; }; /// Elliptic Curve Menezes-Qu-Vanstone, AKA ECMQV template ::DefaultCofactorOption> struct ECMQV { typedef MQV_Domain, COFACTOR_OPTION> Domain; }; //! EC keys template struct DL_Keys_EC { typedef DL_PublicKey_EC PublicKey; typedef DL_PrivateKey_EC PrivateKey; }; template struct ECDSA; //! ECDSA keys template struct DL_Keys_ECDSA { typedef DL_PublicKey_EC PublicKey; typedef DL_PrivateKey_WithSignaturePairwiseConsistencyTest, ECDSA > PrivateKey; }; //! ECDSA algorithm template class DL_Algorithm_ECDSA : public DL_Algorithm_GDSA { public: static const char * CRYPTOPP_API StaticAlgorithmName() {return "ECDSA";} }; //! ECNR algorithm template class DL_Algorithm_ECNR : public DL_Algorithm_NR { public: static const char * CRYPTOPP_API StaticAlgorithmName() {return "ECNR";} }; //! ECDSA template struct ECDSA : public DL_SS, DL_Algorithm_ECDSA, DL_SignatureMessageEncodingMethod_DSA, H> { }; //! ECNR template struct ECNR : public DL_SS, DL_Algorithm_ECNR, DL_SignatureMessageEncodingMethod_NR, H> { }; //! Elliptic Curve Integrated Encryption Scheme, AKA ECIES /*! Default to (NoCofactorMultiplication and DHAES_MODE = false) for compatibilty with SEC1 and Crypto++ 4.2. The combination of (IncompatibleCofactorMultiplication and DHAES_MODE = true) is recommended for best efficiency and security. */ template struct ECIES : public DL_ES< DL_Keys_EC, DL_KeyAgreementAlgorithm_DH, DL_KeyDerivationAlgorithm_P1363 >, DL_EncryptionAlgorithm_Xor, DHAES_MODE>, ECIES > { static std::string CRYPTOPP_API StaticAlgorithmName() {return "ECIES";} // TODO: fix this after name is standardized }; NAMESPACE_END #ifdef CRYPTOPP_MANUALLY_INSTANTIATE_TEMPLATES #include "eccrypto.cpp" #endif NAMESPACE_BEGIN(CryptoPP) CRYPTOPP_DLL_TEMPLATE_CLASS DL_GroupParameters_EC; CRYPTOPP_DLL_TEMPLATE_CLASS DL_GroupParameters_EC; CRYPTOPP_DLL_TEMPLATE_CLASS DL_PublicKeyImpl >; CRYPTOPP_DLL_TEMPLATE_CLASS DL_PublicKeyImpl >; CRYPTOPP_DLL_TEMPLATE_CLASS DL_PublicKey_EC; CRYPTOPP_DLL_TEMPLATE_CLASS DL_PublicKey_EC; CRYPTOPP_DLL_TEMPLATE_CLASS DL_PrivateKeyImpl >; CRYPTOPP_DLL_TEMPLATE_CLASS DL_PrivateKeyImpl >; CRYPTOPP_DLL_TEMPLATE_CLASS DL_PrivateKey_EC; CRYPTOPP_DLL_TEMPLATE_CLASS DL_PrivateKey_EC; CRYPTOPP_DLL_TEMPLATE_CLASS DL_Algorithm_GDSA; CRYPTOPP_DLL_TEMPLATE_CLASS DL_Algorithm_GDSA; CRYPTOPP_DLL_TEMPLATE_CLASS DL_PrivateKey_WithSignaturePairwiseConsistencyTest, ECDSA >; CRYPTOPP_DLL_TEMPLATE_CLASS DL_PrivateKey_WithSignaturePairwiseConsistencyTest, ECDSA >; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/mqv.cpp0000755000000000000000000000027212414772654017106 0ustar rootroot// mqv.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "mqv.h" NAMESPACE_BEGIN(CryptoPP) void TestInstantiations_MQV() { MQV mqv; } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/modes.cpp0000755000000000000000000001640312414772654017415 0ustar rootroot// modes.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "modes.h" #ifndef NDEBUG #include "des.h" #endif NAMESPACE_BEGIN(CryptoPP) #ifndef NDEBUG void Modes_TestInstantiations() { CFB_Mode::Encryption m0; CFB_Mode::Decryption m1; OFB_Mode::Encryption m2; CTR_Mode::Encryption m3; ECB_Mode::Encryption m4; CBC_Mode::Encryption m5; } #endif void CFB_ModePolicy::Iterate(byte *output, const byte *input, CipherDir dir, size_t iterationCount) { assert(m_cipher->IsForwardTransformation()); // CFB mode needs the "encrypt" direction of the underlying block cipher, even to decrypt assert(m_feedbackSize == BlockSize()); unsigned int s = BlockSize(); if (dir == ENCRYPTION) { m_cipher->ProcessAndXorBlock(m_register, input, output); m_cipher->AdvancedProcessBlocks(output, input+s, output+s, (iterationCount-1)*s, 0); memcpy(m_register, output+(iterationCount-1)*s, s); } else { memcpy(m_temp, input+(iterationCount-1)*s, s); // make copy first in case of in-place decryption m_cipher->AdvancedProcessBlocks(input, input+s, output+s, (iterationCount-1)*s, BlockTransformation::BT_ReverseDirection); m_cipher->ProcessAndXorBlock(m_register, input, output); memcpy(m_register, m_temp, s); } } void CFB_ModePolicy::TransformRegister() { assert(m_cipher->IsForwardTransformation()); // CFB mode needs the "encrypt" direction of the underlying block cipher, even to decrypt m_cipher->ProcessBlock(m_register, m_temp); unsigned int updateSize = BlockSize()-m_feedbackSize; memmove_s(m_register, m_register.size(), m_register+m_feedbackSize, updateSize); memcpy_s(m_register+updateSize, m_register.size()-updateSize, m_temp, m_feedbackSize); } void CFB_ModePolicy::CipherResynchronize(const byte *iv, size_t length) { assert(length == BlockSize()); CopyOrZero(m_register, iv, length); TransformRegister(); } void CFB_ModePolicy::SetFeedbackSize(unsigned int feedbackSize) { if (feedbackSize > BlockSize()) throw InvalidArgument("CFB_Mode: invalid feedback size"); m_feedbackSize = feedbackSize ? feedbackSize : BlockSize(); } void CFB_ModePolicy::ResizeBuffers() { CipherModeBase::ResizeBuffers(); m_temp.New(BlockSize()); } void OFB_ModePolicy::WriteKeystream(byte *keystreamBuffer, size_t iterationCount) { assert(m_cipher->IsForwardTransformation()); // OFB mode needs the "encrypt" direction of the underlying block cipher, even to decrypt unsigned int s = BlockSize(); m_cipher->ProcessBlock(m_register, keystreamBuffer); if (iterationCount > 1) m_cipher->AdvancedProcessBlocks(keystreamBuffer, NULL, keystreamBuffer+s, s*(iterationCount-1), 0); memcpy(m_register, keystreamBuffer+s*(iterationCount-1), s); } void OFB_ModePolicy::CipherResynchronize(byte *keystreamBuffer, const byte *iv, size_t length) { assert(length == BlockSize()); CopyOrZero(m_register, iv, length); } void CTR_ModePolicy::SeekToIteration(lword iterationCount) { int carry=0; for (int i=BlockSize()-1; i>=0; i--) { unsigned int sum = m_register[i] + byte(iterationCount) + carry; m_counterArray[i] = (byte) sum; carry = sum >> 8; iterationCount >>= 8; } } void CTR_ModePolicy::IncrementCounterBy256() { IncrementCounterByOne(m_counterArray, BlockSize()-1); } void CTR_ModePolicy::OperateKeystream(KeystreamOperation operation, byte *output, const byte *input, size_t iterationCount) { assert(m_cipher->IsForwardTransformation()); // CTR mode needs the "encrypt" direction of the underlying block cipher, even to decrypt unsigned int s = BlockSize(); unsigned int inputIncrement = input ? s : 0; while (iterationCount) { byte lsb = m_counterArray[s-1]; size_t blocks = UnsignedMin(iterationCount, 256U-lsb); m_cipher->AdvancedProcessBlocks(m_counterArray, input, output, blocks*s, BlockTransformation::BT_InBlockIsCounter|BlockTransformation::BT_AllowParallel); if ((m_counterArray[s-1] = lsb + (byte)blocks) == 0) IncrementCounterBy256(); output += blocks*s; input += blocks*inputIncrement; iterationCount -= blocks; } } void CTR_ModePolicy::CipherResynchronize(byte *keystreamBuffer, const byte *iv, size_t length) { assert(length == BlockSize()); CopyOrZero(m_register, iv, length); m_counterArray = m_register; } void BlockOrientedCipherModeBase::UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms) { m_cipher->SetKey(key, length, params); ResizeBuffers(); if (IsResynchronizable()) { size_t ivLength; const byte *iv = GetIVAndThrowIfInvalid(params, ivLength); Resynchronize(iv, (int)ivLength); } } void ECB_OneWay::ProcessData(byte *outString, const byte *inString, size_t length) { assert(length%BlockSize()==0); m_cipher->AdvancedProcessBlocks(inString, NULL, outString, length, BlockTransformation::BT_AllowParallel); } void CBC_Encryption::ProcessData(byte *outString, const byte *inString, size_t length) { if (!length) return; assert(length%BlockSize()==0); unsigned int blockSize = BlockSize(); m_cipher->AdvancedProcessBlocks(inString, m_register, outString, blockSize, BlockTransformation::BT_XorInput); if (length > blockSize) m_cipher->AdvancedProcessBlocks(inString+blockSize, outString, outString+blockSize, length-blockSize, BlockTransformation::BT_XorInput); memcpy(m_register, outString + length - blockSize, blockSize); } void CBC_CTS_Encryption::ProcessLastBlock(byte *outString, const byte *inString, size_t length) { if (length <= BlockSize()) { if (!m_stolenIV) throw InvalidArgument("CBC_Encryption: message is too short for ciphertext stealing"); // steal from IV memcpy(outString, m_register, length); outString = m_stolenIV; } else { // steal from next to last block xorbuf(m_register, inString, BlockSize()); m_cipher->ProcessBlock(m_register); inString += BlockSize(); length -= BlockSize(); memcpy(outString+BlockSize(), m_register, length); } // output last full ciphertext block xorbuf(m_register, inString, length); m_cipher->ProcessBlock(m_register); memcpy(outString, m_register, BlockSize()); } void CBC_Decryption::ProcessData(byte *outString, const byte *inString, size_t length) { if (!length) return; assert(length%BlockSize()==0); unsigned int blockSize = BlockSize(); memcpy(m_temp, inString+length-blockSize, blockSize); // save copy now in case of in-place decryption if (length > blockSize) m_cipher->AdvancedProcessBlocks(inString+blockSize, inString, outString+blockSize, length-blockSize, BlockTransformation::BT_ReverseDirection|BlockTransformation::BT_AllowParallel); m_cipher->ProcessAndXorBlock(inString, m_register, outString); m_register.swap(m_temp); } void CBC_CTS_Decryption::ProcessLastBlock(byte *outString, const byte *inString, size_t length) { const byte *pn, *pn1; bool stealIV = length <= BlockSize(); if (stealIV) { pn = inString; pn1 = m_register; } else { pn = inString + BlockSize(); pn1 = inString; length -= BlockSize(); } // decrypt last partial plaintext block memcpy(m_temp, pn1, BlockSize()); m_cipher->ProcessBlock(m_temp); xorbuf(m_temp, pn, length); if (stealIV) memcpy(outString, m_temp, length); else { memcpy(outString+BlockSize(), m_temp, length); // decrypt next to last plaintext block memcpy(m_temp, pn, length); m_cipher->ProcessBlock(m_temp); xorbuf(outString, m_temp, m_register, BlockSize()); } } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/iterhash.h0000755000000000000000000000726312414772654017566 0ustar rootroot#ifndef CRYPTOPP_ITERHASH_H #define CRYPTOPP_ITERHASH_H #include "cryptlib.h" #include "secblock.h" #include "misc.h" #include "simple.h" NAMESPACE_BEGIN(CryptoPP) //! exception thrown when trying to hash more data than is allowed by a hash function class CRYPTOPP_DLL HashInputTooLong : public InvalidDataFormat { public: explicit HashInputTooLong(const std::string &alg) : InvalidDataFormat("IteratedHashBase: input data exceeds maximum allowed by hash function " + alg) {} }; //! _ template class CRYPTOPP_NO_VTABLE IteratedHashBase : public BASE { public: typedef T HashWordType; IteratedHashBase() : m_countLo(0), m_countHi(0) {} unsigned int OptimalBlockSize() const {return this->BlockSize();} unsigned int OptimalDataAlignment() const {return GetAlignmentOf();} void Update(const byte *input, size_t length); byte * CreateUpdateSpace(size_t &size); void Restart(); void TruncatedFinal(byte *digest, size_t size); protected: inline T GetBitCountHi() const {return (m_countLo >> (8*sizeof(T)-3)) + (m_countHi << 3);} inline T GetBitCountLo() const {return m_countLo << 3;} void PadLastBlock(unsigned int lastBlockSize, byte padFirst=0x80); virtual void Init() =0; virtual ByteOrder GetByteOrder() const =0; virtual void HashEndianCorrectedBlock(const HashWordType *data) =0; virtual size_t HashMultipleBlocks(const T *input, size_t length); void HashBlock(const HashWordType *input) {HashMultipleBlocks(input, this->BlockSize());} virtual T* DataBuf() =0; virtual T* StateBuf() =0; private: T m_countLo, m_countHi; }; //! _ template class CRYPTOPP_NO_VTABLE IteratedHash : public IteratedHashBase { public: typedef T_Endianness ByteOrderClass; typedef T_HashWordType HashWordType; CRYPTOPP_CONSTANT(BLOCKSIZE = T_BlockSize) // BCB2006 workaround: can't use BLOCKSIZE here CRYPTOPP_COMPILE_ASSERT((T_BlockSize & (T_BlockSize - 1)) == 0); // blockSize is a power of 2 unsigned int BlockSize() const {return T_BlockSize;} ByteOrder GetByteOrder() const {return T_Endianness::ToEnum();} inline static void CorrectEndianess(HashWordType *out, const HashWordType *in, size_t byteCount) { ConditionalByteReverse(T_Endianness::ToEnum(), out, in, byteCount); } protected: T_HashWordType* DataBuf() {return this->m_data;} FixedSizeSecBlock m_data; }; //! _ template class CRYPTOPP_NO_VTABLE IteratedHashWithStaticTransform : public ClonableImpl, T_Transform> > { public: CRYPTOPP_CONSTANT(DIGESTSIZE = T_DigestSize ? T_DigestSize : T_StateSize) unsigned int DigestSize() const {return DIGESTSIZE;}; protected: IteratedHashWithStaticTransform() {this->Init();} void HashEndianCorrectedBlock(const T_HashWordType *data) {T_Transform::Transform(this->m_state, data);} void Init() {T_Transform::InitState(this->m_state);} T_HashWordType* StateBuf() {return this->m_state;} FixedSizeAlignedSecBlock m_state; }; #ifndef __GNUC__ CRYPTOPP_DLL_TEMPLATE_CLASS IteratedHashBase; CRYPTOPP_STATIC_TEMPLATE_CLASS IteratedHashBase; CRYPTOPP_DLL_TEMPLATE_CLASS IteratedHashBase; CRYPTOPP_STATIC_TEMPLATE_CLASS IteratedHashBase; #endif NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/ripemd.h0000755000000000000000000000322612414772654017232 0ustar rootroot#ifndef CRYPTOPP_RIPEMD_H #define CRYPTOPP_RIPEMD_H #include "iterhash.h" NAMESPACE_BEGIN(CryptoPP) //! RIPEMD-160 /*! Digest Length = 160 bits */ class RIPEMD160 : public IteratedHashWithStaticTransform { public: static void InitState(HashWordType *state); static void Transform(word32 *digest, const word32 *data); static const char * StaticAlgorithmName() {return "RIPEMD-160";} }; /*! Digest Length = 320 bits, Security is similar to RIPEMD-160 */ class RIPEMD320 : public IteratedHashWithStaticTransform { public: static void InitState(HashWordType *state); static void Transform(word32 *digest, const word32 *data); static const char * StaticAlgorithmName() {return "RIPEMD-320";} }; /*! \warning RIPEMD-128 is considered insecure, and should not be used unless you absolutely need it for compatibility. */ class RIPEMD128 : public IteratedHashWithStaticTransform { public: static void InitState(HashWordType *state); static void Transform(word32 *digest, const word32 *data); static const char * StaticAlgorithmName() {return "RIPEMD-128";} }; /*! \warning RIPEMD-256 is considered insecure, and should not be used unless you absolutely need it for compatibility. */ class RIPEMD256 : public IteratedHashWithStaticTransform { public: static void InitState(HashWordType *state); static void Transform(word32 *digest, const word32 *data); static const char * StaticAlgorithmName() {return "RIPEMD-256";} }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/idea.h0000755000000000000000000000266612414772654016663 0ustar rootroot#ifndef CRYPTOPP_IDEA_H #define CRYPTOPP_IDEA_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct IDEA_Info : public FixedBlockSize<8>, public FixedKeyLength<16>, public FixedRounds<8> { static const char *StaticAlgorithmName() {return "IDEA";} }; /// IDEA class IDEA : public IDEA_Info, public BlockCipherDocumentation { public: // made public for internal purposes #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE typedef word Word; #else typedef hword Word; #endif private: class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: unsigned int OptimalDataAlignment() const {return 2;} void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); private: void EnKey(const byte *); void DeKey(); FixedSizeSecBlock m_key; #ifdef IDEA_LARGECACHE static inline void LookupMUL(word &a, word b); void LookupKeyLogs(); static void BuildLogTables(); static volatile bool tablesBuilt; static word16 log[0x10000], antilog[0x10000]; #endif }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef IDEA::Encryption IDEAEncryption; typedef IDEA::Decryption IDEADecryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/gost.h0000755000000000000000000000244412414772654016727 0ustar rootroot#ifndef CRYPTOPP_GOST_H #define CRYPTOPP_GOST_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct GOST_Info : public FixedBlockSize<8>, public FixedKeyLength<32> { static const char *StaticAlgorithmName() {return "GOST";} }; /// GOST class GOST : public GOST_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); protected: static void PrecalculateSTable(); static const byte sBox[8][16]; static volatile bool sTableCalculated; static word32 sTable[4][256]; FixedSizeSecBlock key; }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef GOST::Encryption GOSTEncryption; typedef GOST::Decryption GOSTDecryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/rc2.h0000755000000000000000000000364012414772654016440 0ustar rootroot#ifndef CRYPTOPP_RC2_H #define CRYPTOPP_RC2_H /** \file */ #include "seckey.h" #include "secblock.h" #include "algparam.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct RC2_Info : public FixedBlockSize<8>, public VariableKeyLength<16, 1, 128> { CRYPTOPP_CONSTANT(DEFAULT_EFFECTIVE_KEYLENGTH = 1024) CRYPTOPP_CONSTANT(MAX_EFFECTIVE_KEYLENGTH = 1024) static const char *StaticAlgorithmName() {return "RC2";} }; /// RC2 class RC2 : public RC2_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); unsigned int OptimalDataAlignment() const {return GetAlignmentOf();} protected: FixedSizeSecBlock K; // expanded key table }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; public: class Encryption : public BlockCipherFinal { public: Encryption() {} Encryption(const byte *key, size_t keyLen=DEFAULT_KEYLENGTH) {SetKey(key, keyLen);} Encryption(const byte *key, size_t keyLen, int effectiveKeyLen) {SetKey(key, keyLen, MakeParameters("EffectiveKeyLength", effectiveKeyLen));} }; class Decryption : public BlockCipherFinal { public: Decryption() {} Decryption(const byte *key, size_t keyLen=DEFAULT_KEYLENGTH) {SetKey(key, keyLen);} Decryption(const byte *key, size_t keyLen, int effectiveKeyLen) {SetKey(key, keyLen, MakeParameters("EffectiveKeyLength", effectiveKeyLen));} }; }; typedef RC2::Encryption RC2Encryption; typedef RC2::Decryption RC2Decryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/mqv.h0000755000000000000000000001175412414772654016562 0ustar rootroot#ifndef CRYPTOPP_MQV_H #define CRYPTOPP_MQV_H /** \file */ #include "gfpcrypt.h" NAMESPACE_BEGIN(CryptoPP) //! _ template class MQV_Domain : public AuthenticatedKeyAgreementDomain { public: typedef GROUP_PARAMETERS GroupParameters; typedef typename GroupParameters::Element Element; typedef MQV_Domain Domain; MQV_Domain() {} MQV_Domain(const GroupParameters ¶ms) : m_groupParameters(params) {} MQV_Domain(BufferedTransformation &bt) {m_groupParameters.BERDecode(bt);} template MQV_Domain(T1 v1, T2 v2) {m_groupParameters.Initialize(v1, v2);} template MQV_Domain(T1 v1, T2 v2, T3 v3) {m_groupParameters.Initialize(v1, v2, v3);} template MQV_Domain(T1 v1, T2 v2, T3 v3, T4 v4) {m_groupParameters.Initialize(v1, v2, v3, v4);} const GroupParameters & GetGroupParameters() const {return m_groupParameters;} GroupParameters & AccessGroupParameters() {return m_groupParameters;} CryptoParameters & AccessCryptoParameters() {return AccessAbstractGroupParameters();} unsigned int AgreedValueLength() const {return GetAbstractGroupParameters().GetEncodedElementSize(false);} unsigned int StaticPrivateKeyLength() const {return GetAbstractGroupParameters().GetSubgroupOrder().ByteCount();} unsigned int StaticPublicKeyLength() const {return GetAbstractGroupParameters().GetEncodedElementSize(true);} void GenerateStaticPrivateKey(RandomNumberGenerator &rng, byte *privateKey) const { Integer x(rng, Integer::One(), GetAbstractGroupParameters().GetMaxExponent()); x.Encode(privateKey, StaticPrivateKeyLength()); } void GenerateStaticPublicKey(RandomNumberGenerator &rng, const byte *privateKey, byte *publicKey) const { const DL_GroupParameters ¶ms = GetAbstractGroupParameters(); Integer x(privateKey, StaticPrivateKeyLength()); Element y = params.ExponentiateBase(x); params.EncodeElement(true, y, publicKey); } unsigned int EphemeralPrivateKeyLength() const {return StaticPrivateKeyLength() + StaticPublicKeyLength();} unsigned int EphemeralPublicKeyLength() const {return StaticPublicKeyLength();} void GenerateEphemeralPrivateKey(RandomNumberGenerator &rng, byte *privateKey) const { const DL_GroupParameters ¶ms = GetAbstractGroupParameters(); Integer x(rng, Integer::One(), params.GetMaxExponent()); x.Encode(privateKey, StaticPrivateKeyLength()); Element y = params.ExponentiateBase(x); params.EncodeElement(true, y, privateKey+StaticPrivateKeyLength()); } void GenerateEphemeralPublicKey(RandomNumberGenerator &rng, const byte *privateKey, byte *publicKey) const { memcpy(publicKey, privateKey+StaticPrivateKeyLength(), EphemeralPublicKeyLength()); } bool Agree(byte *agreedValue, const byte *staticPrivateKey, const byte *ephemeralPrivateKey, const byte *staticOtherPublicKey, const byte *ephemeralOtherPublicKey, bool validateStaticOtherPublicKey=true) const { try { const DL_GroupParameters ¶ms = GetAbstractGroupParameters(); Element WW = params.DecodeElement(staticOtherPublicKey, validateStaticOtherPublicKey); Element VV = params.DecodeElement(ephemeralOtherPublicKey, true); Integer s(staticPrivateKey, StaticPrivateKeyLength()); Integer u(ephemeralPrivateKey, StaticPrivateKeyLength()); Element V = params.DecodeElement(ephemeralPrivateKey+StaticPrivateKeyLength(), false); const Integer &r = params.GetSubgroupOrder(); Integer h2 = Integer::Power2((r.BitCount()+1)/2); Integer e = ((h2+params.ConvertElementToInteger(V)%h2)*s+u) % r; Integer tt = h2 + params.ConvertElementToInteger(VV) % h2; if (COFACTOR_OPTION::ToEnum() == NO_COFACTOR_MULTIPLICTION) { Element P = params.ExponentiateElement(WW, tt); P = m_groupParameters.MultiplyElements(P, VV); Element R[2]; const Integer e2[2] = {r, e}; params.SimultaneousExponentiate(R, P, e2, 2); if (!params.IsIdentity(R[0]) || params.IsIdentity(R[1])) return false; params.EncodeElement(false, R[1], agreedValue); } else { const Integer &k = params.GetCofactor(); if (COFACTOR_OPTION::ToEnum() == COMPATIBLE_COFACTOR_MULTIPLICTION) e = ModularArithmetic(r).Divide(e, k); Element P = m_groupParameters.CascadeExponentiate(VV, k*e, WW, k*(e*tt%r)); if (params.IsIdentity(P)) return false; params.EncodeElement(false, P, agreedValue); } } catch (DL_BadElement &) { return false; } return true; } private: DL_GroupParameters & AccessAbstractGroupParameters() {return m_groupParameters;} const DL_GroupParameters & GetAbstractGroupParameters() const {return m_groupParameters;} GroupParameters m_groupParameters; }; //! Menezes-Qu-Vanstone in GF(p) with key validation, AKA MQV typedef MQV_Domain MQV; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/cryptdll.dsp0000755000000000000000000002633212414772654020151 0ustar rootroot# Microsoft Developer Studio Project File - Name="cryptdll" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102 CFG=cryptdll - Win32 Debug !MESSAGE This is not a valid makefile. To build this project using NMAKE, !MESSAGE use the Export Makefile command and run !MESSAGE !MESSAGE NMAKE /f "cryptdll.mak". !MESSAGE !MESSAGE You can specify a configuration when running NMAKE !MESSAGE by defining the macro CFG on the command line. For example: !MESSAGE !MESSAGE NMAKE /f "cryptdll.mak" CFG="cryptdll - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "cryptdll - Win32 Release" (based on "Win32 (x86) Dynamic-Link Library") !MESSAGE "cryptdll - Win32 Debug" (based on "Win32 (x86) Dynamic-Link Library") !MESSAGE # Begin Project # PROP AllowPerConfigDependencies 0 # PROP Scc_ProjName "" # PROP Scc_LocalPath "" CPP=cl.exe MTL=midl.exe RSC=rc.exe !IF "$(CFG)" == "cryptdll - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "cryptdll___Win32_Release" # PROP BASE Intermediate_Dir "cryptdll___Win32_Release" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 0 # PROP Output_Dir "DLL_Release" # PROP Intermediate_Dir "DLL_Release" # PROP Ignore_Export_Lib 0 # PROP Target_Dir "" # ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "CRYPTDLL_EXPORTS" /YX /FD /c # ADD CPP /nologo /G5 /MT /W3 /GR /GX /Zi /O1 /Ob2 /D "NDEBUG" /D "WIN32" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "CRYPTOPP_EXPORTS" /D CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2=1 /D "USE_PRECOMPILED_HEADERS" /Yu"pch.h" /FD /Zm200 /c # ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32 # ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32 # ADD BASE RSC /l 0x409 /d "NDEBUG" # ADD RSC /l 0x409 /d "NDEBUG" BSC32=bscmake.exe # ADD BASE BSC32 /nologo # ADD BSC32 /nologo LINK32=link.exe # ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /machine:I386 # ADD LINK32 advapi32.lib /nologo /base:"0x42900000" /dll /map /debug /machine:I386 /out:"DLL_Release/cryptopp.dll" /opt:ref # SUBTRACT LINK32 /pdb:none # Begin Custom Build OutDir=.\DLL_Release TargetPath=.\DLL_Release\cryptopp.dll InputPath=.\DLL_Release\cryptopp.dll SOURCE="$(InputPath)" "$(OutDir)\cryptopp.mac.done" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)" CTRelease\cryptest mac_dll $(TargetPath) echo mac done > $(OutDir)\cryptopp.mac.done # End Custom Build !ELSEIF "$(CFG)" == "cryptdll - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "cryptdll___Win32_Debug" # PROP BASE Intermediate_Dir "cryptdll___Win32_Debug" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "DLL_Debug" # PROP Intermediate_Dir "DLL_Debug" # PROP Ignore_Export_Lib 0 # PROP Target_Dir "" # ADD BASE CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "CRYPTDLL_EXPORTS" /YX /FD /GZ /c # ADD CPP /nologo /G5 /MTd /W3 /Gm /GR /GX /Zi /Oi /D "_DEBUG" /D "WIN32" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "CRYPTOPP_EXPORTS" /D CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2=1 /D "USE_PRECOMPILED_HEADERS" /Yu"pch.h" /FD /GZ /Zm200 /c # ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /win32 # ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32 # ADD BASE RSC /l 0x409 /d "_DEBUG" # ADD RSC /l 0x409 /d "_DEBUG" BSC32=bscmake.exe # ADD BASE BSC32 /nologo # ADD BSC32 /nologo LINK32=link.exe # ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /pdbtype:sept # ADD LINK32 advapi32.lib /nologo /base:"0x42900000" /dll /incremental:no /debug /machine:I386 /out:"DLL_Debug/cryptopp.dll" /opt:ref # SUBTRACT LINK32 /pdb:none # Begin Custom Build OutDir=.\DLL_Debug TargetPath=.\DLL_Debug\cryptopp.dll InputPath=.\DLL_Debug\cryptopp.dll SOURCE="$(InputPath)" "$(OutDir)\cryptopp.mac.done" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)" CTDebug\cryptest mac_dll $(TargetPath) echo mac done > $(OutDir)\cryptopp.mac.done # End Custom Build !ENDIF # Begin Target # Name "cryptdll - Win32 Release" # Name "cryptdll - Win32 Debug" # Begin Group "Source Files" # PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat" # Begin Source File SOURCE=.\algebra.cpp # End Source File # Begin Source File SOURCE=.\algparam.cpp # End Source File # Begin Source File SOURCE=.\asn.cpp # End Source File # Begin Source File SOURCE=.\authenc.cpp # End Source File # Begin Source File SOURCE=.\basecode.cpp # End Source File # Begin Source File SOURCE=.\cbcmac.cpp # End Source File # Begin Source File SOURCE=.\ccm.cpp # End Source File # Begin Source File SOURCE=.\channels.cpp # End Source File # Begin Source File SOURCE=.\cmac.cpp # End Source File # Begin Source File SOURCE=.\cpu.cpp # End Source File # Begin Source File SOURCE=.\cryptlib.cpp # End Source File # Begin Source File SOURCE=.\des.cpp # End Source File # Begin Source File SOURCE=.\dessp.cpp # End Source File # Begin Source File SOURCE=.\dh.cpp # End Source File # Begin Source File SOURCE=.\dll.cpp # SUBTRACT CPP /YX /Yc /Yu # End Source File # Begin Source File SOURCE=.\dsa.cpp # End Source File # Begin Source File SOURCE=.\ec2n.cpp # End Source File # Begin Source File SOURCE=.\eccrypto.cpp # End Source File # Begin Source File SOURCE=.\ecp.cpp # End Source File # Begin Source File SOURCE=.\emsa2.cpp # End Source File # Begin Source File SOURCE=.\eprecomp.cpp # End Source File # Begin Source File SOURCE=.\files.cpp # End Source File # Begin Source File SOURCE=.\filters.cpp # End Source File # Begin Source File SOURCE=.\fips140.cpp # End Source File # Begin Source File SOURCE=.\fipstest.cpp # End Source File # Begin Source File SOURCE=.\gcm.cpp # End Source File # Begin Source File SOURCE=.\gf2n.cpp # End Source File # Begin Source File SOURCE=.\gfpcrypt.cpp # End Source File # Begin Source File SOURCE=.\hex.cpp # End Source File # Begin Source File SOURCE=.\hmac.cpp # End Source File # Begin Source File SOURCE=.\hrtimer.cpp # End Source File # Begin Source File SOURCE=.\integer.cpp # End Source File # Begin Source File SOURCE=.\iterhash.cpp # SUBTRACT CPP /YX /Yc /Yu # End Source File # Begin Source File SOURCE=.\misc.cpp # End Source File # Begin Source File SOURCE=.\modes.cpp # End Source File # Begin Source File SOURCE=.\mqueue.cpp # End Source File # Begin Source File SOURCE=.\nbtheory.cpp # End Source File # Begin Source File SOURCE=.\oaep.cpp # End Source File # Begin Source File SOURCE=.\osrng.cpp # End Source File # Begin Source File SOURCE=.\pch.cpp # ADD CPP /Yc"pch.h" # End Source File # Begin Source File SOURCE=.\pkcspad.cpp # End Source File # Begin Source File SOURCE=.\pssr.cpp # End Source File # Begin Source File SOURCE=.\pubkey.cpp # End Source File # Begin Source File SOURCE=.\queue.cpp # End Source File # Begin Source File SOURCE=.\randpool.cpp # End Source File # Begin Source File SOURCE=.\rdtables.cpp # End Source File # Begin Source File SOURCE=.\rijndael.cpp # End Source File # Begin Source File SOURCE=.\rng.cpp # End Source File # Begin Source File SOURCE=.\rsa.cpp # End Source File # Begin Source File SOURCE=.\rw.cpp # End Source File # Begin Source File SOURCE=.\sha.cpp # End Source File # Begin Source File SOURCE=.\simple.cpp # End Source File # Begin Source File SOURCE=.\skipjack.cpp # End Source File # Begin Source File SOURCE=.\strciphr.cpp # End Source File # Begin Source File SOURCE=.\trdlocal.cpp # End Source File # End Group # Begin Group "Header Files" # PROP Default_Filter ".h" # Begin Source File SOURCE=.\aes.h # End Source File # Begin Source File SOURCE=.\algebra.h # End Source File # Begin Source File SOURCE=.\algparam.h # End Source File # Begin Source File SOURCE=.\argnames.h # End Source File # Begin Source File SOURCE=.\asn.h # End Source File # Begin Source File SOURCE=.\authenc.h # End Source File # Begin Source File SOURCE=.\basecode.h # End Source File # Begin Source File SOURCE=.\cbcmac.h # End Source File # Begin Source File SOURCE=.\ccm.h # End Source File # Begin Source File SOURCE=.\channels.h # End Source File # Begin Source File SOURCE=.\cmac.h # End Source File # Begin Source File SOURCE=.\config.h # End Source File # Begin Source File SOURCE=.\cryptlib.h # End Source File # Begin Source File SOURCE=.\des.h # End Source File # Begin Source File SOURCE=.\dh.h # End Source File # Begin Source File SOURCE=.\dll.h # End Source File # Begin Source File SOURCE=.\dsa.h # End Source File # Begin Source File SOURCE=.\ec2n.h # End Source File # Begin Source File SOURCE=.\eccrypto.h # End Source File # Begin Source File SOURCE=.\ecp.h # End Source File # Begin Source File SOURCE=.\eprecomp.h # End Source File # Begin Source File SOURCE=.\files.h # End Source File # Begin Source File SOURCE=.\filters.h # End Source File # Begin Source File SOURCE=.\fips140.h # End Source File # Begin Source File SOURCE=.\fltrimpl.h # End Source File # Begin Source File SOURCE=.\gcm.h # End Source File # Begin Source File SOURCE=.\gf2n.h # End Source File # Begin Source File SOURCE=.\gfpcrypt.h # End Source File # Begin Source File SOURCE=.\hex.h # End Source File # Begin Source File SOURCE=.\hmac.h # End Source File # Begin Source File SOURCE=.\integer.h # End Source File # Begin Source File SOURCE=.\iterhash.h # End Source File # Begin Source File SOURCE=.\mdc.h # End Source File # Begin Source File SOURCE=.\misc.h # End Source File # Begin Source File SOURCE=.\modarith.h # End Source File # Begin Source File SOURCE=.\modes.h # End Source File # Begin Source File SOURCE=.\modexppc.h # End Source File # Begin Source File SOURCE=.\mqueue.h # End Source File # Begin Source File SOURCE=.\mqv.h # End Source File # Begin Source File SOURCE=.\nbtheory.h # End Source File # Begin Source File SOURCE=.\oaep.h # End Source File # Begin Source File SOURCE=.\oids.h # End Source File # Begin Source File SOURCE=.\osrng.h # End Source File # Begin Source File SOURCE=.\pch.h # End Source File # Begin Source File SOURCE=.\pkcspad.h # End Source File # Begin Source File SOURCE=.\pubkey.h # End Source File # Begin Source File SOURCE=.\queue.h # End Source File # Begin Source File SOURCE=.\randpool.h # End Source File # Begin Source File SOURCE=.\rijndael.h # End Source File # Begin Source File SOURCE=.\rng.h # End Source File # Begin Source File SOURCE=.\rsa.h # End Source File # Begin Source File SOURCE=.\secblock.h # End Source File # Begin Source File SOURCE=.\seckey.h # End Source File # Begin Source File SOURCE=.\sha.h # End Source File # Begin Source File SOURCE=.\simple.h # End Source File # Begin Source File SOURCE=.\skipjack.h # End Source File # Begin Source File SOURCE=.\smartptr.h # End Source File # Begin Source File SOURCE=.\stdcpp.h # End Source File # Begin Source File SOURCE=.\strciphr.h # End Source File # Begin Source File SOURCE=.\trdlocal.h # End Source File # Begin Source File SOURCE=.\words.h # End Source File # End Group # Begin Source File SOURCE=.\cryptopp.rc # End Source File # End Target # End Project armory-0.92.3/cppForSwig/cryptopp/rsa.cpp0000755000000000000000000002122612414772654017072 0ustar rootroot// rsa.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "rsa.h" #include "asn.h" #include "oids.h" #include "modarith.h" #include "nbtheory.h" #include "sha.h" #include "algparam.h" #include "fips140.h" #if !defined(NDEBUG) && !defined(CRYPTOPP_IS_DLL) #include "pssr.h" NAMESPACE_BEGIN(CryptoPP) void RSA_TestInstantiations() { RSASS::Verifier x1(1, 1); RSASS::Signer x2(NullRNG(), 1); RSASS::Verifier x3(x2); RSASS::Verifier x4(x2.GetKey()); RSASS::Verifier x5(x3); #ifndef __MWERKS__ RSASS::Signer x6 = x2; x3 = x2; x6 = x2; #endif RSAES::Encryptor x7(x2); #ifndef __GNUC__ RSAES::Encryptor x8(x3); #endif RSAES >::Encryptor x9(x2); x4 = x2.GetKey(); } NAMESPACE_END #endif #ifndef CRYPTOPP_IMPORTS NAMESPACE_BEGIN(CryptoPP) OID RSAFunction::GetAlgorithmID() const { return ASN1::rsaEncryption(); } void RSAFunction::BERDecodePublicKey(BufferedTransformation &bt, bool, size_t) { BERSequenceDecoder seq(bt); m_n.BERDecode(seq); m_e.BERDecode(seq); seq.MessageEnd(); } void RSAFunction::DEREncodePublicKey(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); m_n.DEREncode(seq); m_e.DEREncode(seq); seq.MessageEnd(); } Integer RSAFunction::ApplyFunction(const Integer &x) const { DoQuickSanityCheck(); return a_exp_b_mod_c(x, m_e, m_n); } bool RSAFunction::Validate(RandomNumberGenerator &rng, unsigned int level) const { bool pass = true; pass = pass && m_n > Integer::One() && m_n.IsOdd(); pass = pass && m_e > Integer::One() && m_e.IsOdd() && m_e < m_n; return pass; } bool RSAFunction::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue).Assignable() CRYPTOPP_GET_FUNCTION_ENTRY(Modulus) CRYPTOPP_GET_FUNCTION_ENTRY(PublicExponent) ; } void RSAFunction::AssignFrom(const NameValuePairs &source) { AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY(Modulus) CRYPTOPP_SET_FUNCTION_ENTRY(PublicExponent) ; } // ***************************************************************************** class RSAPrimeSelector : public PrimeSelector { public: RSAPrimeSelector(const Integer &e) : m_e(e) {} bool IsAcceptable(const Integer &candidate) const {return RelativelyPrime(m_e, candidate-Integer::One());} Integer m_e; }; void InvertibleRSAFunction::GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg) { int modulusSize = 2048; alg.GetIntValue(Name::ModulusSize(), modulusSize) || alg.GetIntValue(Name::KeySize(), modulusSize); if (modulusSize < 16) throw InvalidArgument("InvertibleRSAFunction: specified modulus size is too small"); m_e = alg.GetValueWithDefault(Name::PublicExponent(), Integer(17)); if (m_e < 3 || m_e.IsEven()) throw InvalidArgument("InvertibleRSAFunction: invalid public exponent"); RSAPrimeSelector selector(m_e); AlgorithmParameters primeParam = MakeParametersForTwoPrimesOfEqualSize(modulusSize) (Name::PointerToPrimeSelector(), selector.GetSelectorPointer()); m_p.GenerateRandom(rng, primeParam); m_q.GenerateRandom(rng, primeParam); m_d = m_e.InverseMod(LCM(m_p-1, m_q-1)); assert(m_d.IsPositive()); m_dp = m_d % (m_p-1); m_dq = m_d % (m_q-1); m_n = m_p * m_q; m_u = m_q.InverseMod(m_p); if (FIPS_140_2_ComplianceEnabled()) { RSASS::Signer signer(*this); RSASS::Verifier verifier(signer); SignaturePairwiseConsistencyTest_FIPS_140_Only(signer, verifier); RSAES >::Decryptor decryptor(*this); RSAES >::Encryptor encryptor(decryptor); EncryptionPairwiseConsistencyTest_FIPS_140_Only(encryptor, decryptor); } } void InvertibleRSAFunction::Initialize(RandomNumberGenerator &rng, unsigned int keybits, const Integer &e) { GenerateRandom(rng, MakeParameters(Name::ModulusSize(), (int)keybits)(Name::PublicExponent(), e+e.IsEven())); } void InvertibleRSAFunction::Initialize(const Integer &n, const Integer &e, const Integer &d) { if (n.IsEven() || e.IsEven() | d.IsEven()) throw InvalidArgument("InvertibleRSAFunction: input is not a valid RSA private key"); m_n = n; m_e = e; m_d = d; Integer r = --(d*e); unsigned int s = 0; while (r.IsEven()) { r >>= 1; s++; } ModularArithmetic modn(n); for (Integer i = 2; ; ++i) { Integer a = modn.Exponentiate(i, r); if (a == 1) continue; Integer b; unsigned int j = 0; while (a != n-1) { b = modn.Square(a); if (b == 1) { m_p = GCD(a-1, n); m_q = n/m_p; m_dp = m_d % (m_p-1); m_dq = m_d % (m_q-1); m_u = m_q.InverseMod(m_p); return; } if (++j == s) throw InvalidArgument("InvertibleRSAFunction: input is not a valid RSA private key"); a = b; } } } void InvertibleRSAFunction::BERDecodePrivateKey(BufferedTransformation &bt, bool, size_t) { BERSequenceDecoder privateKey(bt); word32 version; BERDecodeUnsigned(privateKey, version, INTEGER, 0, 0); // check version m_n.BERDecode(privateKey); m_e.BERDecode(privateKey); m_d.BERDecode(privateKey); m_p.BERDecode(privateKey); m_q.BERDecode(privateKey); m_dp.BERDecode(privateKey); m_dq.BERDecode(privateKey); m_u.BERDecode(privateKey); privateKey.MessageEnd(); } void InvertibleRSAFunction::DEREncodePrivateKey(BufferedTransformation &bt) const { DERSequenceEncoder privateKey(bt); DEREncodeUnsigned(privateKey, 0); // version m_n.DEREncode(privateKey); m_e.DEREncode(privateKey); m_d.DEREncode(privateKey); m_p.DEREncode(privateKey); m_q.DEREncode(privateKey); m_dp.DEREncode(privateKey); m_dq.DEREncode(privateKey); m_u.DEREncode(privateKey); privateKey.MessageEnd(); } Integer InvertibleRSAFunction::CalculateInverse(RandomNumberGenerator &rng, const Integer &x) const { DoQuickSanityCheck(); ModularArithmetic modn(m_n); Integer r, rInv; do { // do this in a loop for people using small numbers for testing r.Randomize(rng, Integer::One(), m_n - Integer::One()); rInv = modn.MultiplicativeInverse(r); } while (rInv.IsZero()); Integer re = modn.Exponentiate(r, m_e); re = modn.Multiply(re, x); // blind // here we follow the notation of PKCS #1 and let u=q inverse mod p // but in ModRoot, u=p inverse mod q, so we reverse the order of p and q Integer y = ModularRoot(re, m_dq, m_dp, m_q, m_p, m_u); y = modn.Multiply(y, rInv); // unblind if (modn.Exponentiate(y, m_e) != x) // check throw Exception(Exception::OTHER_ERROR, "InvertibleRSAFunction: computational error during private key operation"); return y; } bool InvertibleRSAFunction::Validate(RandomNumberGenerator &rng, unsigned int level) const { bool pass = RSAFunction::Validate(rng, level); pass = pass && m_p > Integer::One() && m_p.IsOdd() && m_p < m_n; pass = pass && m_q > Integer::One() && m_q.IsOdd() && m_q < m_n; pass = pass && m_d > Integer::One() && m_d.IsOdd() && m_d < m_n; pass = pass && m_dp > Integer::One() && m_dp.IsOdd() && m_dp < m_p; pass = pass && m_dq > Integer::One() && m_dq.IsOdd() && m_dq < m_q; pass = pass && m_u.IsPositive() && m_u < m_p; if (level >= 1) { pass = pass && m_p * m_q == m_n; pass = pass && m_e*m_d % LCM(m_p-1, m_q-1) == 1; pass = pass && m_dp == m_d%(m_p-1) && m_dq == m_d%(m_q-1); pass = pass && m_u * m_q % m_p == 1; } if (level >= 2) pass = pass && VerifyPrime(rng, m_p, level-2) && VerifyPrime(rng, m_q, level-2); return pass; } bool InvertibleRSAFunction::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue).Assignable() CRYPTOPP_GET_FUNCTION_ENTRY(Prime1) CRYPTOPP_GET_FUNCTION_ENTRY(Prime2) CRYPTOPP_GET_FUNCTION_ENTRY(PrivateExponent) CRYPTOPP_GET_FUNCTION_ENTRY(ModPrime1PrivateExponent) CRYPTOPP_GET_FUNCTION_ENTRY(ModPrime2PrivateExponent) CRYPTOPP_GET_FUNCTION_ENTRY(MultiplicativeInverseOfPrime2ModPrime1) ; } void InvertibleRSAFunction::AssignFrom(const NameValuePairs &source) { AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY(Prime1) CRYPTOPP_SET_FUNCTION_ENTRY(Prime2) CRYPTOPP_SET_FUNCTION_ENTRY(PrivateExponent) CRYPTOPP_SET_FUNCTION_ENTRY(ModPrime1PrivateExponent) CRYPTOPP_SET_FUNCTION_ENTRY(ModPrime2PrivateExponent) CRYPTOPP_SET_FUNCTION_ENTRY(MultiplicativeInverseOfPrime2ModPrime1) ; } // ***************************************************************************** Integer RSAFunction_ISO::ApplyFunction(const Integer &x) const { Integer t = RSAFunction::ApplyFunction(x); return t % 16 == 12 ? t : m_n - t; } Integer InvertibleRSAFunction_ISO::CalculateInverse(RandomNumberGenerator &rng, const Integer &x) const { Integer t = InvertibleRSAFunction::CalculateInverse(rng, x); return STDMIN(t, m_n-t); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/casts.cpp0000755000000000000000000007125012414772654017424 0ustar rootroot#include "pch.h" #include "cast.h" NAMESPACE_BEGIN(CryptoPP) // CAST S-boxes const word32 CAST::S[8][256] = { { 0x30FB40D4UL, 0x9FA0FF0BUL, 0x6BECCD2FUL, 0x3F258C7AUL, 0x1E213F2FUL, 0x9C004DD3UL, 0x6003E540UL, 0xCF9FC949UL, 0xBFD4AF27UL, 0x88BBBDB5UL, 0xE2034090UL, 0x98D09675UL, 0x6E63A0E0UL, 0x15C361D2UL, 0xC2E7661DUL, 0x22D4FF8EUL, 0x28683B6FUL, 0xC07FD059UL, 0xFF2379C8UL, 0x775F50E2UL, 0x43C340D3UL, 0xDF2F8656UL, 0x887CA41AUL, 0xA2D2BD2DUL, 0xA1C9E0D6UL, 0x346C4819UL, 0x61B76D87UL, 0x22540F2FUL, 0x2ABE32E1UL, 0xAA54166BUL, 0x22568E3AUL, 0xA2D341D0UL, 0x66DB40C8UL, 0xA784392FUL, 0x004DFF2FUL, 0x2DB9D2DEUL, 0x97943FACUL, 0x4A97C1D8UL, 0x527644B7UL, 0xB5F437A7UL, 0xB82CBAEFUL, 0xD751D159UL, 0x6FF7F0EDUL, 0x5A097A1FUL, 0x827B68D0UL, 0x90ECF52EUL, 0x22B0C054UL, 0xBC8E5935UL, 0x4B6D2F7FUL, 0x50BB64A2UL, 0xD2664910UL, 0xBEE5812DUL, 0xB7332290UL, 0xE93B159FUL, 0xB48EE411UL, 0x4BFF345DUL, 0xFD45C240UL, 0xAD31973FUL, 0xC4F6D02EUL, 0x55FC8165UL, 0xD5B1CAADUL, 0xA1AC2DAEUL, 0xA2D4B76DUL, 0xC19B0C50UL, 0x882240F2UL, 0x0C6E4F38UL, 0xA4E4BFD7UL, 0x4F5BA272UL, 0x564C1D2FUL, 0xC59C5319UL, 0xB949E354UL, 0xB04669FEUL, 0xB1B6AB8AUL, 0xC71358DDUL, 0x6385C545UL, 0x110F935DUL, 0x57538AD5UL, 0x6A390493UL, 0xE63D37E0UL, 0x2A54F6B3UL, 0x3A787D5FUL, 0x6276A0B5UL, 0x19A6FCDFUL, 0x7A42206AUL, 0x29F9D4D5UL, 0xF61B1891UL, 0xBB72275EUL, 0xAA508167UL, 0x38901091UL, 0xC6B505EBUL, 0x84C7CB8CUL, 0x2AD75A0FUL, 0x874A1427UL, 0xA2D1936BUL, 0x2AD286AFUL, 0xAA56D291UL, 0xD7894360UL, 0x425C750DUL, 0x93B39E26UL, 0x187184C9UL, 0x6C00B32DUL, 0x73E2BB14UL, 0xA0BEBC3CUL, 0x54623779UL, 0x64459EABUL, 0x3F328B82UL, 0x7718CF82UL, 0x59A2CEA6UL, 0x04EE002EUL, 0x89FE78E6UL, 0x3FAB0950UL, 0x325FF6C2UL, 0x81383F05UL, 0x6963C5C8UL, 0x76CB5AD6UL, 0xD49974C9UL, 0xCA180DCFUL, 0x380782D5UL, 0xC7FA5CF6UL, 0x8AC31511UL, 0x35E79E13UL, 0x47DA91D0UL, 0xF40F9086UL, 0xA7E2419EUL, 0x31366241UL, 0x051EF495UL, 0xAA573B04UL, 0x4A805D8DUL, 0x548300D0UL, 0x00322A3CUL, 0xBF64CDDFUL, 0xBA57A68EUL, 0x75C6372BUL, 0x50AFD341UL, 0xA7C13275UL, 0x915A0BF5UL, 0x6B54BFABUL, 0x2B0B1426UL, 0xAB4CC9D7UL, 0x449CCD82UL, 0xF7FBF265UL, 0xAB85C5F3UL, 0x1B55DB94UL, 0xAAD4E324UL, 0xCFA4BD3FUL, 0x2DEAA3E2UL, 0x9E204D02UL, 0xC8BD25ACUL, 0xEADF55B3UL, 0xD5BD9E98UL, 0xE31231B2UL, 0x2AD5AD6CUL, 0x954329DEUL, 0xADBE4528UL, 0xD8710F69UL, 0xAA51C90FUL, 0xAA786BF6UL, 0x22513F1EUL, 0xAA51A79BUL, 0x2AD344CCUL, 0x7B5A41F0UL, 0xD37CFBADUL, 0x1B069505UL, 0x41ECE491UL, 0xB4C332E6UL, 0x032268D4UL, 0xC9600ACCUL, 0xCE387E6DUL, 0xBF6BB16CUL, 0x6A70FB78UL, 0x0D03D9C9UL, 0xD4DF39DEUL, 0xE01063DAUL, 0x4736F464UL, 0x5AD328D8UL, 0xB347CC96UL, 0x75BB0FC3UL, 0x98511BFBUL, 0x4FFBCC35UL, 0xB58BCF6AUL, 0xE11F0ABCUL, 0xBFC5FE4AUL, 0xA70AEC10UL, 0xAC39570AUL, 0x3F04442FUL, 0x6188B153UL, 0xE0397A2EUL, 0x5727CB79UL, 0x9CEB418FUL, 0x1CACD68DUL, 0x2AD37C96UL, 0x0175CB9DUL, 0xC69DFF09UL, 0xC75B65F0UL, 0xD9DB40D8UL, 0xEC0E7779UL, 0x4744EAD4UL, 0xB11C3274UL, 0xDD24CB9EUL, 0x7E1C54BDUL, 0xF01144F9UL, 0xD2240EB1UL, 0x9675B3FDUL, 0xA3AC3755UL, 0xD47C27AFUL, 0x51C85F4DUL, 0x56907596UL, 0xA5BB15E6UL, 0x580304F0UL, 0xCA042CF1UL, 0x011A37EAUL, 0x8DBFAADBUL, 0x35BA3E4AUL, 0x3526FFA0UL, 0xC37B4D09UL, 0xBC306ED9UL, 0x98A52666UL, 0x5648F725UL, 0xFF5E569DUL, 0x0CED63D0UL, 0x7C63B2CFUL, 0x700B45E1UL, 0xD5EA50F1UL, 0x85A92872UL, 0xAF1FBDA7UL, 0xD4234870UL, 0xA7870BF3UL, 0x2D3B4D79UL, 0x42E04198UL, 0x0CD0EDE7UL, 0x26470DB8UL, 0xF881814CUL, 0x474D6AD7UL, 0x7C0C5E5CUL, 0xD1231959UL, 0x381B7298UL, 0xF5D2F4DBUL, 0xAB838653UL, 0x6E2F1E23UL, 0x83719C9EUL, 0xBD91E046UL, 0x9A56456EUL, 0xDC39200CUL, 0x20C8C571UL, 0x962BDA1CUL, 0xE1E696FFUL, 0xB141AB08UL, 0x7CCA89B9UL, 0x1A69E783UL, 0x02CC4843UL, 0xA2F7C579UL, 0x429EF47DUL, 0x427B169CUL, 0x5AC9F049UL, 0xDD8F0F00UL, 0x5C8165BFUL }, { 0x1F201094UL, 0xEF0BA75BUL, 0x69E3CF7EUL, 0x393F4380UL, 0xFE61CF7AUL, 0xEEC5207AUL, 0x55889C94UL, 0x72FC0651UL, 0xADA7EF79UL, 0x4E1D7235UL, 0xD55A63CEUL, 0xDE0436BAUL, 0x99C430EFUL, 0x5F0C0794UL, 0x18DCDB7DUL, 0xA1D6EFF3UL, 0xA0B52F7BUL, 0x59E83605UL, 0xEE15B094UL, 0xE9FFD909UL, 0xDC440086UL, 0xEF944459UL, 0xBA83CCB3UL, 0xE0C3CDFBUL, 0xD1DA4181UL, 0x3B092AB1UL, 0xF997F1C1UL, 0xA5E6CF7BUL, 0x01420DDBUL, 0xE4E7EF5BUL, 0x25A1FF41UL, 0xE180F806UL, 0x1FC41080UL, 0x179BEE7AUL, 0xD37AC6A9UL, 0xFE5830A4UL, 0x98DE8B7FUL, 0x77E83F4EUL, 0x79929269UL, 0x24FA9F7BUL, 0xE113C85BUL, 0xACC40083UL, 0xD7503525UL, 0xF7EA615FUL, 0x62143154UL, 0x0D554B63UL, 0x5D681121UL, 0xC866C359UL, 0x3D63CF73UL, 0xCEE234C0UL, 0xD4D87E87UL, 0x5C672B21UL, 0x071F6181UL, 0x39F7627FUL, 0x361E3084UL, 0xE4EB573BUL, 0x602F64A4UL, 0xD63ACD9CUL, 0x1BBC4635UL, 0x9E81032DUL, 0x2701F50CUL, 0x99847AB4UL, 0xA0E3DF79UL, 0xBA6CF38CUL, 0x10843094UL, 0x2537A95EUL, 0xF46F6FFEUL, 0xA1FF3B1FUL, 0x208CFB6AUL, 0x8F458C74UL, 0xD9E0A227UL, 0x4EC73A34UL, 0xFC884F69UL, 0x3E4DE8DFUL, 0xEF0E0088UL, 0x3559648DUL, 0x8A45388CUL, 0x1D804366UL, 0x721D9BFDUL, 0xA58684BBUL, 0xE8256333UL, 0x844E8212UL, 0x128D8098UL, 0xFED33FB4UL, 0xCE280AE1UL, 0x27E19BA5UL, 0xD5A6C252UL, 0xE49754BDUL, 0xC5D655DDUL, 0xEB667064UL, 0x77840B4DUL, 0xA1B6A801UL, 0x84DB26A9UL, 0xE0B56714UL, 0x21F043B7UL, 0xE5D05860UL, 0x54F03084UL, 0x066FF472UL, 0xA31AA153UL, 0xDADC4755UL, 0xB5625DBFUL, 0x68561BE6UL, 0x83CA6B94UL, 0x2D6ED23BUL, 0xECCF01DBUL, 0xA6D3D0BAUL, 0xB6803D5CUL, 0xAF77A709UL, 0x33B4A34CUL, 0x397BC8D6UL, 0x5EE22B95UL, 0x5F0E5304UL, 0x81ED6F61UL, 0x20E74364UL, 0xB45E1378UL, 0xDE18639BUL, 0x881CA122UL, 0xB96726D1UL, 0x8049A7E8UL, 0x22B7DA7BUL, 0x5E552D25UL, 0x5272D237UL, 0x79D2951CUL, 0xC60D894CUL, 0x488CB402UL, 0x1BA4FE5BUL, 0xA4B09F6BUL, 0x1CA815CFUL, 0xA20C3005UL, 0x8871DF63UL, 0xB9DE2FCBUL, 0x0CC6C9E9UL, 0x0BEEFF53UL, 0xE3214517UL, 0xB4542835UL, 0x9F63293CUL, 0xEE41E729UL, 0x6E1D2D7CUL, 0x50045286UL, 0x1E6685F3UL, 0xF33401C6UL, 0x30A22C95UL, 0x31A70850UL, 0x60930F13UL, 0x73F98417UL, 0xA1269859UL, 0xEC645C44UL, 0x52C877A9UL, 0xCDFF33A6UL, 0xA02B1741UL, 0x7CBAD9A2UL, 0x2180036FUL, 0x50D99C08UL, 0xCB3F4861UL, 0xC26BD765UL, 0x64A3F6ABUL, 0x80342676UL, 0x25A75E7BUL, 0xE4E6D1FCUL, 0x20C710E6UL, 0xCDF0B680UL, 0x17844D3BUL, 0x31EEF84DUL, 0x7E0824E4UL, 0x2CCB49EBUL, 0x846A3BAEUL, 0x8FF77888UL, 0xEE5D60F6UL, 0x7AF75673UL, 0x2FDD5CDBUL, 0xA11631C1UL, 0x30F66F43UL, 0xB3FAEC54UL, 0x157FD7FAUL, 0xEF8579CCUL, 0xD152DE58UL, 0xDB2FFD5EUL, 0x8F32CE19UL, 0x306AF97AUL, 0x02F03EF8UL, 0x99319AD5UL, 0xC242FA0FUL, 0xA7E3EBB0UL, 0xC68E4906UL, 0xB8DA230CUL, 0x80823028UL, 0xDCDEF3C8UL, 0xD35FB171UL, 0x088A1BC8UL, 0xBEC0C560UL, 0x61A3C9E8UL, 0xBCA8F54DUL, 0xC72FEFFAUL, 0x22822E99UL, 0x82C570B4UL, 0xD8D94E89UL, 0x8B1C34BCUL, 0x301E16E6UL, 0x273BE979UL, 0xB0FFEAA6UL, 0x61D9B8C6UL, 0x00B24869UL, 0xB7FFCE3FUL, 0x08DC283BUL, 0x43DAF65AUL, 0xF7E19798UL, 0x7619B72FUL, 0x8F1C9BA4UL, 0xDC8637A0UL, 0x16A7D3B1UL, 0x9FC393B7UL, 0xA7136EEBUL, 0xC6BCC63EUL, 0x1A513742UL, 0xEF6828BCUL, 0x520365D6UL, 0x2D6A77ABUL, 0x3527ED4BUL, 0x821FD216UL, 0x095C6E2EUL, 0xDB92F2FBUL, 0x5EEA29CBUL, 0x145892F5UL, 0x91584F7FUL, 0x5483697BUL, 0x2667A8CCUL, 0x85196048UL, 0x8C4BACEAUL, 0x833860D4UL, 0x0D23E0F9UL, 0x6C387E8AUL, 0x0AE6D249UL, 0xB284600CUL, 0xD835731DUL, 0xDCB1C647UL, 0xAC4C56EAUL, 0x3EBD81B3UL, 0x230EABB0UL, 0x6438BC87UL, 0xF0B5B1FAUL, 0x8F5EA2B3UL, 0xFC184642UL, 0x0A036B7AUL, 0x4FB089BDUL, 0x649DA589UL, 0xA345415EUL, 0x5C038323UL, 0x3E5D3BB9UL, 0x43D79572UL, 0x7E6DD07CUL, 0x06DFDF1EUL, 0x6C6CC4EFUL, 0x7160A539UL, 0x73BFBE70UL, 0x83877605UL, 0x4523ECF1UL }, { 0x8DEFC240UL, 0x25FA5D9FUL, 0xEB903DBFUL, 0xE810C907UL, 0x47607FFFUL, 0x369FE44BUL, 0x8C1FC644UL, 0xAECECA90UL, 0xBEB1F9BFUL, 0xEEFBCAEAUL, 0xE8CF1950UL, 0x51DF07AEUL, 0x920E8806UL, 0xF0AD0548UL, 0xE13C8D83UL, 0x927010D5UL, 0x11107D9FUL, 0x07647DB9UL, 0xB2E3E4D4UL, 0x3D4F285EUL, 0xB9AFA820UL, 0xFADE82E0UL, 0xA067268BUL, 0x8272792EUL, 0x553FB2C0UL, 0x489AE22BUL, 0xD4EF9794UL, 0x125E3FBCUL, 0x21FFFCEEUL, 0x825B1BFDUL, 0x9255C5EDUL, 0x1257A240UL, 0x4E1A8302UL, 0xBAE07FFFUL, 0x528246E7UL, 0x8E57140EUL, 0x3373F7BFUL, 0x8C9F8188UL, 0xA6FC4EE8UL, 0xC982B5A5UL, 0xA8C01DB7UL, 0x579FC264UL, 0x67094F31UL, 0xF2BD3F5FUL, 0x40FFF7C1UL, 0x1FB78DFCUL, 0x8E6BD2C1UL, 0x437BE59BUL, 0x99B03DBFUL, 0xB5DBC64BUL, 0x638DC0E6UL, 0x55819D99UL, 0xA197C81CUL, 0x4A012D6EUL, 0xC5884A28UL, 0xCCC36F71UL, 0xB843C213UL, 0x6C0743F1UL, 0x8309893CUL, 0x0FEDDD5FUL, 0x2F7FE850UL, 0xD7C07F7EUL, 0x02507FBFUL, 0x5AFB9A04UL, 0xA747D2D0UL, 0x1651192EUL, 0xAF70BF3EUL, 0x58C31380UL, 0x5F98302EUL, 0x727CC3C4UL, 0x0A0FB402UL, 0x0F7FEF82UL, 0x8C96FDADUL, 0x5D2C2AAEUL, 0x8EE99A49UL, 0x50DA88B8UL, 0x8427F4A0UL, 0x1EAC5790UL, 0x796FB449UL, 0x8252DC15UL, 0xEFBD7D9BUL, 0xA672597DUL, 0xADA840D8UL, 0x45F54504UL, 0xFA5D7403UL, 0xE83EC305UL, 0x4F91751AUL, 0x925669C2UL, 0x23EFE941UL, 0xA903F12EUL, 0x60270DF2UL, 0x0276E4B6UL, 0x94FD6574UL, 0x927985B2UL, 0x8276DBCBUL, 0x02778176UL, 0xF8AF918DUL, 0x4E48F79EUL, 0x8F616DDFUL, 0xE29D840EUL, 0x842F7D83UL, 0x340CE5C8UL, 0x96BBB682UL, 0x93B4B148UL, 0xEF303CABUL, 0x984FAF28UL, 0x779FAF9BUL, 0x92DC560DUL, 0x224D1E20UL, 0x8437AA88UL, 0x7D29DC96UL, 0x2756D3DCUL, 0x8B907CEEUL, 0xB51FD240UL, 0xE7C07CE3UL, 0xE566B4A1UL, 0xC3E9615EUL, 0x3CF8209DUL, 0x6094D1E3UL, 0xCD9CA341UL, 0x5C76460EUL, 0x00EA983BUL, 0xD4D67881UL, 0xFD47572CUL, 0xF76CEDD9UL, 0xBDA8229CUL, 0x127DADAAUL, 0x438A074EUL, 0x1F97C090UL, 0x081BDB8AUL, 0x93A07EBEUL, 0xB938CA15UL, 0x97B03CFFUL, 0x3DC2C0F8UL, 0x8D1AB2ECUL, 0x64380E51UL, 0x68CC7BFBUL, 0xD90F2788UL, 0x12490181UL, 0x5DE5FFD4UL, 0xDD7EF86AUL, 0x76A2E214UL, 0xB9A40368UL, 0x925D958FUL, 0x4B39FFFAUL, 0xBA39AEE9UL, 0xA4FFD30BUL, 0xFAF7933BUL, 0x6D498623UL, 0x193CBCFAUL, 0x27627545UL, 0x825CF47AUL, 0x61BD8BA0UL, 0xD11E42D1UL, 0xCEAD04F4UL, 0x127EA392UL, 0x10428DB7UL, 0x8272A972UL, 0x9270C4A8UL, 0x127DE50BUL, 0x285BA1C8UL, 0x3C62F44FUL, 0x35C0EAA5UL, 0xE805D231UL, 0x428929FBUL, 0xB4FCDF82UL, 0x4FB66A53UL, 0x0E7DC15BUL, 0x1F081FABUL, 0x108618AEUL, 0xFCFD086DUL, 0xF9FF2889UL, 0x694BCC11UL, 0x236A5CAEUL, 0x12DECA4DUL, 0x2C3F8CC5UL, 0xD2D02DFEUL, 0xF8EF5896UL, 0xE4CF52DAUL, 0x95155B67UL, 0x494A488CUL, 0xB9B6A80CUL, 0x5C8F82BCUL, 0x89D36B45UL, 0x3A609437UL, 0xEC00C9A9UL, 0x44715253UL, 0x0A874B49UL, 0xD773BC40UL, 0x7C34671CUL, 0x02717EF6UL, 0x4FEB5536UL, 0xA2D02FFFUL, 0xD2BF60C4UL, 0xD43F03C0UL, 0x50B4EF6DUL, 0x07478CD1UL, 0x006E1888UL, 0xA2E53F55UL, 0xB9E6D4BCUL, 0xA2048016UL, 0x97573833UL, 0xD7207D67UL, 0xDE0F8F3DUL, 0x72F87B33UL, 0xABCC4F33UL, 0x7688C55DUL, 0x7B00A6B0UL, 0x947B0001UL, 0x570075D2UL, 0xF9BB88F8UL, 0x8942019EUL, 0x4264A5FFUL, 0x856302E0UL, 0x72DBD92BUL, 0xEE971B69UL, 0x6EA22FDEUL, 0x5F08AE2BUL, 0xAF7A616DUL, 0xE5C98767UL, 0xCF1FEBD2UL, 0x61EFC8C2UL, 0xF1AC2571UL, 0xCC8239C2UL, 0x67214CB8UL, 0xB1E583D1UL, 0xB7DC3E62UL, 0x7F10BDCEUL, 0xF90A5C38UL, 0x0FF0443DUL, 0x606E6DC6UL, 0x60543A49UL, 0x5727C148UL, 0x2BE98A1DUL, 0x8AB41738UL, 0x20E1BE24UL, 0xAF96DA0FUL, 0x68458425UL, 0x99833BE5UL, 0x600D457DUL, 0x282F9350UL, 0x8334B362UL, 0xD91D1120UL, 0x2B6D8DA0UL, 0x642B1E31UL, 0x9C305A00UL, 0x52BCE688UL, 0x1B03588AUL, 0xF7BAEFD5UL, 0x4142ED9CUL, 0xA4315C11UL, 0x83323EC5UL, 0xDFEF4636UL, 0xA133C501UL, 0xE9D3531CUL, 0xEE353783UL }, { 0x9DB30420UL, 0x1FB6E9DEUL, 0xA7BE7BEFUL, 0xD273A298UL, 0x4A4F7BDBUL, 0x64AD8C57UL, 0x85510443UL, 0xFA020ED1UL, 0x7E287AFFUL, 0xE60FB663UL, 0x095F35A1UL, 0x79EBF120UL, 0xFD059D43UL, 0x6497B7B1UL, 0xF3641F63UL, 0x241E4ADFUL, 0x28147F5FUL, 0x4FA2B8CDUL, 0xC9430040UL, 0x0CC32220UL, 0xFDD30B30UL, 0xC0A5374FUL, 0x1D2D00D9UL, 0x24147B15UL, 0xEE4D111AUL, 0x0FCA5167UL, 0x71FF904CUL, 0x2D195FFEUL, 0x1A05645FUL, 0x0C13FEFEUL, 0x081B08CAUL, 0x05170121UL, 0x80530100UL, 0xE83E5EFEUL, 0xAC9AF4F8UL, 0x7FE72701UL, 0xD2B8EE5FUL, 0x06DF4261UL, 0xBB9E9B8AUL, 0x7293EA25UL, 0xCE84FFDFUL, 0xF5718801UL, 0x3DD64B04UL, 0xA26F263BUL, 0x7ED48400UL, 0x547EEBE6UL, 0x446D4CA0UL, 0x6CF3D6F5UL, 0x2649ABDFUL, 0xAEA0C7F5UL, 0x36338CC1UL, 0x503F7E93UL, 0xD3772061UL, 0x11B638E1UL, 0x72500E03UL, 0xF80EB2BBUL, 0xABE0502EUL, 0xEC8D77DEUL, 0x57971E81UL, 0xE14F6746UL, 0xC9335400UL, 0x6920318FUL, 0x081DBB99UL, 0xFFC304A5UL, 0x4D351805UL, 0x7F3D5CE3UL, 0xA6C866C6UL, 0x5D5BCCA9UL, 0xDAEC6FEAUL, 0x9F926F91UL, 0x9F46222FUL, 0x3991467DUL, 0xA5BF6D8EUL, 0x1143C44FUL, 0x43958302UL, 0xD0214EEBUL, 0x022083B8UL, 0x3FB6180CUL, 0x18F8931EUL, 0x281658E6UL, 0x26486E3EUL, 0x8BD78A70UL, 0x7477E4C1UL, 0xB506E07CUL, 0xF32D0A25UL, 0x79098B02UL, 0xE4EABB81UL, 0x28123B23UL, 0x69DEAD38UL, 0x1574CA16UL, 0xDF871B62UL, 0x211C40B7UL, 0xA51A9EF9UL, 0x0014377BUL, 0x041E8AC8UL, 0x09114003UL, 0xBD59E4D2UL, 0xE3D156D5UL, 0x4FE876D5UL, 0x2F91A340UL, 0x557BE8DEUL, 0x00EAE4A7UL, 0x0CE5C2ECUL, 0x4DB4BBA6UL, 0xE756BDFFUL, 0xDD3369ACUL, 0xEC17B035UL, 0x06572327UL, 0x99AFC8B0UL, 0x56C8C391UL, 0x6B65811CUL, 0x5E146119UL, 0x6E85CB75UL, 0xBE07C002UL, 0xC2325577UL, 0x893FF4ECUL, 0x5BBFC92DUL, 0xD0EC3B25UL, 0xB7801AB7UL, 0x8D6D3B24UL, 0x20C763EFUL, 0xC366A5FCUL, 0x9C382880UL, 0x0ACE3205UL, 0xAAC9548AUL, 0xECA1D7C7UL, 0x041AFA32UL, 0x1D16625AUL, 0x6701902CUL, 0x9B757A54UL, 0x31D477F7UL, 0x9126B031UL, 0x36CC6FDBUL, 0xC70B8B46UL, 0xD9E66A48UL, 0x56E55A79UL, 0x026A4CEBUL, 0x52437EFFUL, 0x2F8F76B4UL, 0x0DF980A5UL, 0x8674CDE3UL, 0xEDDA04EBUL, 0x17A9BE04UL, 0x2C18F4DFUL, 0xB7747F9DUL, 0xAB2AF7B4UL, 0xEFC34D20UL, 0x2E096B7CUL, 0x1741A254UL, 0xE5B6A035UL, 0x213D42F6UL, 0x2C1C7C26UL, 0x61C2F50FUL, 0x6552DAF9UL, 0xD2C231F8UL, 0x25130F69UL, 0xD8167FA2UL, 0x0418F2C8UL, 0x001A96A6UL, 0x0D1526ABUL, 0x63315C21UL, 0x5E0A72ECUL, 0x49BAFEFDUL, 0x187908D9UL, 0x8D0DBD86UL, 0x311170A7UL, 0x3E9B640CUL, 0xCC3E10D7UL, 0xD5CAD3B6UL, 0x0CAEC388UL, 0xF73001E1UL, 0x6C728AFFUL, 0x71EAE2A1UL, 0x1F9AF36EUL, 0xCFCBD12FUL, 0xC1DE8417UL, 0xAC07BE6BUL, 0xCB44A1D8UL, 0x8B9B0F56UL, 0x013988C3UL, 0xB1C52FCAUL, 0xB4BE31CDUL, 0xD8782806UL, 0x12A3A4E2UL, 0x6F7DE532UL, 0x58FD7EB6UL, 0xD01EE900UL, 0x24ADFFC2UL, 0xF4990FC5UL, 0x9711AAC5UL, 0x001D7B95UL, 0x82E5E7D2UL, 0x109873F6UL, 0x00613096UL, 0xC32D9521UL, 0xADA121FFUL, 0x29908415UL, 0x7FBB977FUL, 0xAF9EB3DBUL, 0x29C9ED2AUL, 0x5CE2A465UL, 0xA730F32CUL, 0xD0AA3FE8UL, 0x8A5CC091UL, 0xD49E2CE7UL, 0x0CE454A9UL, 0xD60ACD86UL, 0x015F1919UL, 0x77079103UL, 0xDEA03AF6UL, 0x78A8565EUL, 0xDEE356DFUL, 0x21F05CBEUL, 0x8B75E387UL, 0xB3C50651UL, 0xB8A5C3EFUL, 0xD8EEB6D2UL, 0xE523BE77UL, 0xC2154529UL, 0x2F69EFDFUL, 0xAFE67AFBUL, 0xF470C4B2UL, 0xF3E0EB5BUL, 0xD6CC9876UL, 0x39E4460CUL, 0x1FDA8538UL, 0x1987832FUL, 0xCA007367UL, 0xA99144F8UL, 0x296B299EUL, 0x492FC295UL, 0x9266BEABUL, 0xB5676E69UL, 0x9BD3DDDAUL, 0xDF7E052FUL, 0xDB25701CUL, 0x1B5E51EEUL, 0xF65324E6UL, 0x6AFCE36CUL, 0x0316CC04UL, 0x8644213EUL, 0xB7DC59D0UL, 0x7965291FUL, 0xCCD6FD43UL, 0x41823979UL, 0x932BCDF6UL, 0xB657C34DUL, 0x4EDFD282UL, 0x7AE5290CUL, 0x3CB9536BUL, 0x851E20FEUL, 0x9833557EUL, 0x13ECF0B0UL, 0xD3FFB372UL, 0x3F85C5C1UL, 0x0AEF7ED2UL }, { 0x7EC90C04UL, 0x2C6E74B9UL, 0x9B0E66DFUL, 0xA6337911UL, 0xB86A7FFFUL, 0x1DD358F5UL, 0x44DD9D44UL, 0x1731167FUL, 0x08FBF1FAUL, 0xE7F511CCUL, 0xD2051B00UL, 0x735ABA00UL, 0x2AB722D8UL, 0x386381CBUL, 0xACF6243AUL, 0x69BEFD7AUL, 0xE6A2E77FUL, 0xF0C720CDUL, 0xC4494816UL, 0xCCF5C180UL, 0x38851640UL, 0x15B0A848UL, 0xE68B18CBUL, 0x4CAADEFFUL, 0x5F480A01UL, 0x0412B2AAUL, 0x259814FCUL, 0x41D0EFE2UL, 0x4E40B48DUL, 0x248EB6FBUL, 0x8DBA1CFEUL, 0x41A99B02UL, 0x1A550A04UL, 0xBA8F65CBUL, 0x7251F4E7UL, 0x95A51725UL, 0xC106ECD7UL, 0x97A5980AUL, 0xC539B9AAUL, 0x4D79FE6AUL, 0xF2F3F763UL, 0x68AF8040UL, 0xED0C9E56UL, 0x11B4958BUL, 0xE1EB5A88UL, 0x8709E6B0UL, 0xD7E07156UL, 0x4E29FEA7UL, 0x6366E52DUL, 0x02D1C000UL, 0xC4AC8E05UL, 0x9377F571UL, 0x0C05372AUL, 0x578535F2UL, 0x2261BE02UL, 0xD642A0C9UL, 0xDF13A280UL, 0x74B55BD2UL, 0x682199C0UL, 0xD421E5ECUL, 0x53FB3CE8UL, 0xC8ADEDB3UL, 0x28A87FC9UL, 0x3D959981UL, 0x5C1FF900UL, 0xFE38D399UL, 0x0C4EFF0BUL, 0x062407EAUL, 0xAA2F4FB1UL, 0x4FB96976UL, 0x90C79505UL, 0xB0A8A774UL, 0xEF55A1FFUL, 0xE59CA2C2UL, 0xA6B62D27UL, 0xE66A4263UL, 0xDF65001FUL, 0x0EC50966UL, 0xDFDD55BCUL, 0x29DE0655UL, 0x911E739AUL, 0x17AF8975UL, 0x32C7911CUL, 0x89F89468UL, 0x0D01E980UL, 0x524755F4UL, 0x03B63CC9UL, 0x0CC844B2UL, 0xBCF3F0AAUL, 0x87AC36E9UL, 0xE53A7426UL, 0x01B3D82BUL, 0x1A9E7449UL, 0x64EE2D7EUL, 0xCDDBB1DAUL, 0x01C94910UL, 0xB868BF80UL, 0x0D26F3FDUL, 0x9342EDE7UL, 0x04A5C284UL, 0x636737B6UL, 0x50F5B616UL, 0xF24766E3UL, 0x8ECA36C1UL, 0x136E05DBUL, 0xFEF18391UL, 0xFB887A37UL, 0xD6E7F7D4UL, 0xC7FB7DC9UL, 0x3063FCDFUL, 0xB6F589DEUL, 0xEC2941DAUL, 0x26E46695UL, 0xB7566419UL, 0xF654EFC5UL, 0xD08D58B7UL, 0x48925401UL, 0xC1BACB7FUL, 0xE5FF550FUL, 0xB6083049UL, 0x5BB5D0E8UL, 0x87D72E5AUL, 0xAB6A6EE1UL, 0x223A66CEUL, 0xC62BF3CDUL, 0x9E0885F9UL, 0x68CB3E47UL, 0x086C010FUL, 0xA21DE820UL, 0xD18B69DEUL, 0xF3F65777UL, 0xFA02C3F6UL, 0x407EDAC3UL, 0xCBB3D550UL, 0x1793084DUL, 0xB0D70EBAUL, 0x0AB378D5UL, 0xD951FB0CUL, 0xDED7DA56UL, 0x4124BBE4UL, 0x94CA0B56UL, 0x0F5755D1UL, 0xE0E1E56EUL, 0x6184B5BEUL, 0x580A249FUL, 0x94F74BC0UL, 0xE327888EUL, 0x9F7B5561UL, 0xC3DC0280UL, 0x05687715UL, 0x646C6BD7UL, 0x44904DB3UL, 0x66B4F0A3UL, 0xC0F1648AUL, 0x697ED5AFUL, 0x49E92FF6UL, 0x309E374FUL, 0x2CB6356AUL, 0x85808573UL, 0x4991F840UL, 0x76F0AE02UL, 0x083BE84DUL, 0x28421C9AUL, 0x44489406UL, 0x736E4CB8UL, 0xC1092910UL, 0x8BC95FC6UL, 0x7D869CF4UL, 0x134F616FUL, 0x2E77118DUL, 0xB31B2BE1UL, 0xAA90B472UL, 0x3CA5D717UL, 0x7D161BBAUL, 0x9CAD9010UL, 0xAF462BA2UL, 0x9FE459D2UL, 0x45D34559UL, 0xD9F2DA13UL, 0xDBC65487UL, 0xF3E4F94EUL, 0x176D486FUL, 0x097C13EAUL, 0x631DA5C7UL, 0x445F7382UL, 0x175683F4UL, 0xCDC66A97UL, 0x70BE0288UL, 0xB3CDCF72UL, 0x6E5DD2F3UL, 0x20936079UL, 0x459B80A5UL, 0xBE60E2DBUL, 0xA9C23101UL, 0xEBA5315CUL, 0x224E42F2UL, 0x1C5C1572UL, 0xF6721B2CUL, 0x1AD2FFF3UL, 0x8C25404EUL, 0x324ED72FUL, 0x4067B7FDUL, 0x0523138EUL, 0x5CA3BC78UL, 0xDC0FD66EUL, 0x75922283UL, 0x784D6B17UL, 0x58EBB16EUL, 0x44094F85UL, 0x3F481D87UL, 0xFCFEAE7BUL, 0x77B5FF76UL, 0x8C2302BFUL, 0xAAF47556UL, 0x5F46B02AUL, 0x2B092801UL, 0x3D38F5F7UL, 0x0CA81F36UL, 0x52AF4A8AUL, 0x66D5E7C0UL, 0xDF3B0874UL, 0x95055110UL, 0x1B5AD7A8UL, 0xF61ED5ADUL, 0x6CF6E479UL, 0x20758184UL, 0xD0CEFA65UL, 0x88F7BE58UL, 0x4A046826UL, 0x0FF6F8F3UL, 0xA09C7F70UL, 0x5346ABA0UL, 0x5CE96C28UL, 0xE176EDA3UL, 0x6BAC307FUL, 0x376829D2UL, 0x85360FA9UL, 0x17E3FE2AUL, 0x24B79767UL, 0xF5A96B20UL, 0xD6CD2595UL, 0x68FF1EBFUL, 0x7555442CUL, 0xF19F06BEUL, 0xF9E0659AUL, 0xEEB9491DUL, 0x34010718UL, 0xBB30CAB8UL, 0xE822FE15UL, 0x88570983UL, 0x750E6249UL, 0xDA627E55UL, 0x5E76FFA8UL, 0xB1534546UL, 0x6D47DE08UL, 0xEFE9E7D4UL }, { 0xF6FA8F9DUL, 0x2CAC6CE1UL, 0x4CA34867UL, 0xE2337F7CUL, 0x95DB08E7UL, 0x016843B4UL, 0xECED5CBCUL, 0x325553ACUL, 0xBF9F0960UL, 0xDFA1E2EDUL, 0x83F0579DUL, 0x63ED86B9UL, 0x1AB6A6B8UL, 0xDE5EBE39UL, 0xF38FF732UL, 0x8989B138UL, 0x33F14961UL, 0xC01937BDUL, 0xF506C6DAUL, 0xE4625E7EUL, 0xA308EA99UL, 0x4E23E33CUL, 0x79CBD7CCUL, 0x48A14367UL, 0xA3149619UL, 0xFEC94BD5UL, 0xA114174AUL, 0xEAA01866UL, 0xA084DB2DUL, 0x09A8486FUL, 0xA888614AUL, 0x2900AF98UL, 0x01665991UL, 0xE1992863UL, 0xC8F30C60UL, 0x2E78EF3CUL, 0xD0D51932UL, 0xCF0FEC14UL, 0xF7CA07D2UL, 0xD0A82072UL, 0xFD41197EUL, 0x9305A6B0UL, 0xE86BE3DAUL, 0x74BED3CDUL, 0x372DA53CUL, 0x4C7F4448UL, 0xDAB5D440UL, 0x6DBA0EC3UL, 0x083919A7UL, 0x9FBAEED9UL, 0x49DBCFB0UL, 0x4E670C53UL, 0x5C3D9C01UL, 0x64BDB941UL, 0x2C0E636AUL, 0xBA7DD9CDUL, 0xEA6F7388UL, 0xE70BC762UL, 0x35F29ADBUL, 0x5C4CDD8DUL, 0xF0D48D8CUL, 0xB88153E2UL, 0x08A19866UL, 0x1AE2EAC8UL, 0x284CAF89UL, 0xAA928223UL, 0x9334BE53UL, 0x3B3A21BFUL, 0x16434BE3UL, 0x9AEA3906UL, 0xEFE8C36EUL, 0xF890CDD9UL, 0x80226DAEUL, 0xC340A4A3UL, 0xDF7E9C09UL, 0xA694A807UL, 0x5B7C5ECCUL, 0x221DB3A6UL, 0x9A69A02FUL, 0x68818A54UL, 0xCEB2296FUL, 0x53C0843AUL, 0xFE893655UL, 0x25BFE68AUL, 0xB4628ABCUL, 0xCF222EBFUL, 0x25AC6F48UL, 0xA9A99387UL, 0x53BDDB65UL, 0xE76FFBE7UL, 0xE967FD78UL, 0x0BA93563UL, 0x8E342BC1UL, 0xE8A11BE9UL, 0x4980740DUL, 0xC8087DFCUL, 0x8DE4BF99UL, 0xA11101A0UL, 0x7FD37975UL, 0xDA5A26C0UL, 0xE81F994FUL, 0x9528CD89UL, 0xFD339FEDUL, 0xB87834BFUL, 0x5F04456DUL, 0x22258698UL, 0xC9C4C83BUL, 0x2DC156BEUL, 0x4F628DAAUL, 0x57F55EC5UL, 0xE2220ABEUL, 0xD2916EBFUL, 0x4EC75B95UL, 0x24F2C3C0UL, 0x42D15D99UL, 0xCD0D7FA0UL, 0x7B6E27FFUL, 0xA8DC8AF0UL, 0x7345C106UL, 0xF41E232FUL, 0x35162386UL, 0xE6EA8926UL, 0x3333B094UL, 0x157EC6F2UL, 0x372B74AFUL, 0x692573E4UL, 0xE9A9D848UL, 0xF3160289UL, 0x3A62EF1DUL, 0xA787E238UL, 0xF3A5F676UL, 0x74364853UL, 0x20951063UL, 0x4576698DUL, 0xB6FAD407UL, 0x592AF950UL, 0x36F73523UL, 0x4CFB6E87UL, 0x7DA4CEC0UL, 0x6C152DAAUL, 0xCB0396A8UL, 0xC50DFE5DUL, 0xFCD707ABUL, 0x0921C42FUL, 0x89DFF0BBUL, 0x5FE2BE78UL, 0x448F4F33UL, 0x754613C9UL, 0x2B05D08DUL, 0x48B9D585UL, 0xDC049441UL, 0xC8098F9BUL, 0x7DEDE786UL, 0xC39A3373UL, 0x42410005UL, 0x6A091751UL, 0x0EF3C8A6UL, 0x890072D6UL, 0x28207682UL, 0xA9A9F7BEUL, 0xBF32679DUL, 0xD45B5B75UL, 0xB353FD00UL, 0xCBB0E358UL, 0x830F220AUL, 0x1F8FB214UL, 0xD372CF08UL, 0xCC3C4A13UL, 0x8CF63166UL, 0x061C87BEUL, 0x88C98F88UL, 0x6062E397UL, 0x47CF8E7AUL, 0xB6C85283UL, 0x3CC2ACFBUL, 0x3FC06976UL, 0x4E8F0252UL, 0x64D8314DUL, 0xDA3870E3UL, 0x1E665459UL, 0xC10908F0UL, 0x513021A5UL, 0x6C5B68B7UL, 0x822F8AA0UL, 0x3007CD3EUL, 0x74719EEFUL, 0xDC872681UL, 0x073340D4UL, 0x7E432FD9UL, 0x0C5EC241UL, 0x8809286CUL, 0xF592D891UL, 0x08A930F6UL, 0x957EF305UL, 0xB7FBFFBDUL, 0xC266E96FUL, 0x6FE4AC98UL, 0xB173ECC0UL, 0xBC60B42AUL, 0x953498DAUL, 0xFBA1AE12UL, 0x2D4BD736UL, 0x0F25FAABUL, 0xA4F3FCEBUL, 0xE2969123UL, 0x257F0C3DUL, 0x9348AF49UL, 0x361400BCUL, 0xE8816F4AUL, 0x3814F200UL, 0xA3F94043UL, 0x9C7A54C2UL, 0xBC704F57UL, 0xDA41E7F9UL, 0xC25AD33AUL, 0x54F4A084UL, 0xB17F5505UL, 0x59357CBEUL, 0xEDBD15C8UL, 0x7F97C5ABUL, 0xBA5AC7B5UL, 0xB6F6DEAFUL, 0x3A479C3AUL, 0x5302DA25UL, 0x653D7E6AUL, 0x54268D49UL, 0x51A477EAUL, 0x5017D55BUL, 0xD7D25D88UL, 0x44136C76UL, 0x0404A8C8UL, 0xB8E5A121UL, 0xB81A928AUL, 0x60ED5869UL, 0x97C55B96UL, 0xEAEC991BUL, 0x29935913UL, 0x01FDB7F1UL, 0x088E8DFAUL, 0x9AB6F6F5UL, 0x3B4CBF9FUL, 0x4A5DE3ABUL, 0xE6051D35UL, 0xA0E1D855UL, 0xD36B4CF1UL, 0xF544EDEBUL, 0xB0E93524UL, 0xBEBB8FBDUL, 0xA2D762CFUL, 0x49C92F54UL, 0x38B5F331UL, 0x7128A454UL, 0x48392905UL, 0xA65B1DB8UL, 0x851C97BDUL, 0xD675CF2FUL }, { 0x85E04019UL, 0x332BF567UL, 0x662DBFFFUL, 0xCFC65693UL, 0x2A8D7F6FUL, 0xAB9BC912UL, 0xDE6008A1UL, 0x2028DA1FUL, 0x0227BCE7UL, 0x4D642916UL, 0x18FAC300UL, 0x50F18B82UL, 0x2CB2CB11UL, 0xB232E75CUL, 0x4B3695F2UL, 0xB28707DEUL, 0xA05FBCF6UL, 0xCD4181E9UL, 0xE150210CUL, 0xE24EF1BDUL, 0xB168C381UL, 0xFDE4E789UL, 0x5C79B0D8UL, 0x1E8BFD43UL, 0x4D495001UL, 0x38BE4341UL, 0x913CEE1DUL, 0x92A79C3FUL, 0x089766BEUL, 0xBAEEADF4UL, 0x1286BECFUL, 0xB6EACB19UL, 0x2660C200UL, 0x7565BDE4UL, 0x64241F7AUL, 0x8248DCA9UL, 0xC3B3AD66UL, 0x28136086UL, 0x0BD8DFA8UL, 0x356D1CF2UL, 0x107789BEUL, 0xB3B2E9CEUL, 0x0502AA8FUL, 0x0BC0351EUL, 0x166BF52AUL, 0xEB12FF82UL, 0xE3486911UL, 0xD34D7516UL, 0x4E7B3AFFUL, 0x5F43671BUL, 0x9CF6E037UL, 0x4981AC83UL, 0x334266CEUL, 0x8C9341B7UL, 0xD0D854C0UL, 0xCB3A6C88UL, 0x47BC2829UL, 0x4725BA37UL, 0xA66AD22BUL, 0x7AD61F1EUL, 0x0C5CBAFAUL, 0x4437F107UL, 0xB6E79962UL, 0x42D2D816UL, 0x0A961288UL, 0xE1A5C06EUL, 0x13749E67UL, 0x72FC081AUL, 0xB1D139F7UL, 0xF9583745UL, 0xCF19DF58UL, 0xBEC3F756UL, 0xC06EBA30UL, 0x07211B24UL, 0x45C28829UL, 0xC95E317FUL, 0xBC8EC511UL, 0x38BC46E9UL, 0xC6E6FA14UL, 0xBAE8584AUL, 0xAD4EBC46UL, 0x468F508BUL, 0x7829435FUL, 0xF124183BUL, 0x821DBA9FUL, 0xAFF60FF4UL, 0xEA2C4E6DUL, 0x16E39264UL, 0x92544A8BUL, 0x009B4FC3UL, 0xABA68CEDUL, 0x9AC96F78UL, 0x06A5B79AUL, 0xB2856E6EUL, 0x1AEC3CA9UL, 0xBE838688UL, 0x0E0804E9UL, 0x55F1BE56UL, 0xE7E5363BUL, 0xB3A1F25DUL, 0xF7DEBB85UL, 0x61FE033CUL, 0x16746233UL, 0x3C034C28UL, 0xDA6D0C74UL, 0x79AAC56CUL, 0x3CE4E1ADUL, 0x51F0C802UL, 0x98F8F35AUL, 0x1626A49FUL, 0xEED82B29UL, 0x1D382FE3UL, 0x0C4FB99AUL, 0xBB325778UL, 0x3EC6D97BUL, 0x6E77A6A9UL, 0xCB658B5CUL, 0xD45230C7UL, 0x2BD1408BUL, 0x60C03EB7UL, 0xB9068D78UL, 0xA33754F4UL, 0xF430C87DUL, 0xC8A71302UL, 0xB96D8C32UL, 0xEBD4E7BEUL, 0xBE8B9D2DUL, 0x7979FB06UL, 0xE7225308UL, 0x8B75CF77UL, 0x11EF8DA4UL, 0xE083C858UL, 0x8D6B786FUL, 0x5A6317A6UL, 0xFA5CF7A0UL, 0x5DDA0033UL, 0xF28EBFB0UL, 0xF5B9C310UL, 0xA0EAC280UL, 0x08B9767AUL, 0xA3D9D2B0UL, 0x79D34217UL, 0x021A718DUL, 0x9AC6336AUL, 0x2711FD60UL, 0x438050E3UL, 0x069908A8UL, 0x3D7FEDC4UL, 0x826D2BEFUL, 0x4EEB8476UL, 0x488DCF25UL, 0x36C9D566UL, 0x28E74E41UL, 0xC2610ACAUL, 0x3D49A9CFUL, 0xBAE3B9DFUL, 0xB65F8DE6UL, 0x92AEAF64UL, 0x3AC7D5E6UL, 0x9EA80509UL, 0xF22B017DUL, 0xA4173F70UL, 0xDD1E16C3UL, 0x15E0D7F9UL, 0x50B1B887UL, 0x2B9F4FD5UL, 0x625ABA82UL, 0x6A017962UL, 0x2EC01B9CUL, 0x15488AA9UL, 0xD716E740UL, 0x40055A2CUL, 0x93D29A22UL, 0xE32DBF9AUL, 0x058745B9UL, 0x3453DC1EUL, 0xD699296EUL, 0x496CFF6FUL, 0x1C9F4986UL, 0xDFE2ED07UL, 0xB87242D1UL, 0x19DE7EAEUL, 0x053E561AUL, 0x15AD6F8CUL, 0x66626C1CUL, 0x7154C24CUL, 0xEA082B2AUL, 0x93EB2939UL, 0x17DCB0F0UL, 0x58D4F2AEUL, 0x9EA294FBUL, 0x52CF564CUL, 0x9883FE66UL, 0x2EC40581UL, 0x763953C3UL, 0x01D6692EUL, 0xD3A0C108UL, 0xA1E7160EUL, 0xE4F2DFA6UL, 0x693ED285UL, 0x74904698UL, 0x4C2B0EDDUL, 0x4F757656UL, 0x5D393378UL, 0xA132234FUL, 0x3D321C5DUL, 0xC3F5E194UL, 0x4B269301UL, 0xC79F022FUL, 0x3C997E7EUL, 0x5E4F9504UL, 0x3FFAFBBDUL, 0x76F7AD0EUL, 0x296693F4UL, 0x3D1FCE6FUL, 0xC61E45BEUL, 0xD3B5AB34UL, 0xF72BF9B7UL, 0x1B0434C0UL, 0x4E72B567UL, 0x5592A33DUL, 0xB5229301UL, 0xCFD2A87FUL, 0x60AEB767UL, 0x1814386BUL, 0x30BCC33DUL, 0x38A0C07DUL, 0xFD1606F2UL, 0xC363519BUL, 0x589DD390UL, 0x5479F8E6UL, 0x1CB8D647UL, 0x97FD61A9UL, 0xEA7759F4UL, 0x2D57539DUL, 0x569A58CFUL, 0xE84E63ADUL, 0x462E1B78UL, 0x6580F87EUL, 0xF3817914UL, 0x91DA55F4UL, 0x40A230F3UL, 0xD1988F35UL, 0xB6E318D2UL, 0x3FFA50BCUL, 0x3D40F021UL, 0xC3C0BDAEUL, 0x4958C24CUL, 0x518F36B2UL, 0x84B1D370UL, 0x0FEDCE83UL, 0x878DDADAUL, 0xF2A279C7UL, 0x94E01BE8UL, 0x90716F4BUL, 0x954B8AA3UL }, { 0xE216300DUL, 0xBBDDFFFCUL, 0xA7EBDABDUL, 0x35648095UL, 0x7789F8B7UL, 0xE6C1121BUL, 0x0E241600UL, 0x052CE8B5UL, 0x11A9CFB0UL, 0xE5952F11UL, 0xECE7990AUL, 0x9386D174UL, 0x2A42931CUL, 0x76E38111UL, 0xB12DEF3AUL, 0x37DDDDFCUL, 0xDE9ADEB1UL, 0x0A0CC32CUL, 0xBE197029UL, 0x84A00940UL, 0xBB243A0FUL, 0xB4D137CFUL, 0xB44E79F0UL, 0x049EEDFDUL, 0x0B15A15DUL, 0x480D3168UL, 0x8BBBDE5AUL, 0x669DED42UL, 0xC7ECE831UL, 0x3F8F95E7UL, 0x72DF191BUL, 0x7580330DUL, 0x94074251UL, 0x5C7DCDFAUL, 0xABBE6D63UL, 0xAA402164UL, 0xB301D40AUL, 0x02E7D1CAUL, 0x53571DAEUL, 0x7A3182A2UL, 0x12A8DDECUL, 0xFDAA335DUL, 0x176F43E8UL, 0x71FB46D4UL, 0x38129022UL, 0xCE949AD4UL, 0xB84769ADUL, 0x965BD862UL, 0x82F3D055UL, 0x66FB9767UL, 0x15B80B4EUL, 0x1D5B47A0UL, 0x4CFDE06FUL, 0xC28EC4B8UL, 0x57E8726EUL, 0x647A78FCUL, 0x99865D44UL, 0x608BD593UL, 0x6C200E03UL, 0x39DC5FF6UL, 0x5D0B00A3UL, 0xAE63AFF2UL, 0x7E8BD632UL, 0x70108C0CUL, 0xBBD35049UL, 0x2998DF04UL, 0x980CF42AUL, 0x9B6DF491UL, 0x9E7EDD53UL, 0x06918548UL, 0x58CB7E07UL, 0x3B74EF2EUL, 0x522FFFB1UL, 0xD24708CCUL, 0x1C7E27CDUL, 0xA4EB215BUL, 0x3CF1D2E2UL, 0x19B47A38UL, 0x424F7618UL, 0x35856039UL, 0x9D17DEE7UL, 0x27EB35E6UL, 0xC9AFF67BUL, 0x36BAF5B8UL, 0x09C467CDUL, 0xC18910B1UL, 0xE11DBF7BUL, 0x06CD1AF8UL, 0x7170C608UL, 0x2D5E3354UL, 0xD4DE495AUL, 0x64C6D006UL, 0xBCC0C62CUL, 0x3DD00DB3UL, 0x708F8F34UL, 0x77D51B42UL, 0x264F620FUL, 0x24B8D2BFUL, 0x15C1B79EUL, 0x46A52564UL, 0xF8D7E54EUL, 0x3E378160UL, 0x7895CDA5UL, 0x859C15A5UL, 0xE6459788UL, 0xC37BC75FUL, 0xDB07BA0CUL, 0x0676A3ABUL, 0x7F229B1EUL, 0x31842E7BUL, 0x24259FD7UL, 0xF8BEF472UL, 0x835FFCB8UL, 0x6DF4C1F2UL, 0x96F5B195UL, 0xFD0AF0FCUL, 0xB0FE134CUL, 0xE2506D3DUL, 0x4F9B12EAUL, 0xF215F225UL, 0xA223736FUL, 0x9FB4C428UL, 0x25D04979UL, 0x34C713F8UL, 0xC4618187UL, 0xEA7A6E98UL, 0x7CD16EFCUL, 0x1436876CUL, 0xF1544107UL, 0xBEDEEE14UL, 0x56E9AF27UL, 0xA04AA441UL, 0x3CF7C899UL, 0x92ECBAE6UL, 0xDD67016DUL, 0x151682EBUL, 0xA842EEDFUL, 0xFDBA60B4UL, 0xF1907B75UL, 0x20E3030FUL, 0x24D8C29EUL, 0xE139673BUL, 0xEFA63FB8UL, 0x71873054UL, 0xB6F2CF3BUL, 0x9F326442UL, 0xCB15A4CCUL, 0xB01A4504UL, 0xF1E47D8DUL, 0x844A1BE5UL, 0xBAE7DFDCUL, 0x42CBDA70UL, 0xCD7DAE0AUL, 0x57E85B7AUL, 0xD53F5AF6UL, 0x20CF4D8CUL, 0xCEA4D428UL, 0x79D130A4UL, 0x3486EBFBUL, 0x33D3CDDCUL, 0x77853B53UL, 0x37EFFCB5UL, 0xC5068778UL, 0xE580B3E6UL, 0x4E68B8F4UL, 0xC5C8B37EUL, 0x0D809EA2UL, 0x398FEB7CUL, 0x132A4F94UL, 0x43B7950EUL, 0x2FEE7D1CUL, 0x223613BDUL, 0xDD06CAA2UL, 0x37DF932BUL, 0xC4248289UL, 0xACF3EBC3UL, 0x5715F6B7UL, 0xEF3478DDUL, 0xF267616FUL, 0xC148CBE4UL, 0x9052815EUL, 0x5E410FABUL, 0xB48A2465UL, 0x2EDA7FA4UL, 0xE87B40E4UL, 0xE98EA084UL, 0x5889E9E1UL, 0xEFD390FCUL, 0xDD07D35BUL, 0xDB485694UL, 0x38D7E5B2UL, 0x57720101UL, 0x730EDEBCUL, 0x5B643113UL, 0x94917E4FUL, 0x503C2FBAUL, 0x646F1282UL, 0x7523D24AUL, 0xE0779695UL, 0xF9C17A8FUL, 0x7A5B2121UL, 0xD187B896UL, 0x29263A4DUL, 0xBA510CDFUL, 0x81F47C9FUL, 0xAD1163EDUL, 0xEA7B5965UL, 0x1A00726EUL, 0x11403092UL, 0x00DA6D77UL, 0x4A0CDD61UL, 0xAD1F4603UL, 0x605BDFB0UL, 0x9EEDC364UL, 0x22EBE6A8UL, 0xCEE7D28AUL, 0xA0E736A0UL, 0x5564A6B9UL, 0x10853209UL, 0xC7EB8F37UL, 0x2DE705CAUL, 0x8951570FUL, 0xDF09822BUL, 0xBD691A6CUL, 0xAA12E4F2UL, 0x87451C0FUL, 0xE0F6A27AUL, 0x3ADA4819UL, 0x4CF1764FUL, 0x0D771C2BUL, 0x67CDB156UL, 0x350D8384UL, 0x5938FA0FUL, 0x42399EF3UL, 0x36997B07UL, 0x0E84093DUL, 0x4AA93E61UL, 0x8360D87BUL, 0x1FA98B0CUL, 0x1149382CUL, 0xE97625A5UL, 0x0614D1B7UL, 0x0E25244BUL, 0x0C768347UL, 0x589E8D82UL, 0x0D2059D1UL, 0xA466BB1EUL, 0xF8DA0A82UL, 0x04F19130UL, 0xBA6E4EC0UL, 0x99265164UL, 0x1EE7230DUL, 0x50B2AD80UL, 0xEAEE6801UL, 0x8DB2A283UL, 0xEA8BF59EUL }}; NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/cryptopp.rc0000755000000000000000000000453012414772654020006 0ustar rootroot// Microsoft Visual C++ generated resource script. // #include "resource.h" #define APSTUDIO_READONLY_SYMBOLS ///////////////////////////////////////////////////////////////////////////// // // Generated from the TEXTINCLUDE 2 resource. // #include "winres.h" ///////////////////////////////////////////////////////////////////////////// #undef APSTUDIO_READONLY_SYMBOLS ///////////////////////////////////////////////////////////////////////////// // English (U.S.) resources #if !defined(AFX_RESOURCE_DLL) || defined(AFX_TARG_ENU) #ifdef _WIN32 LANGUAGE LANG_ENGLISH, SUBLANG_ENGLISH_US #pragma code_page(1252) #endif //_WIN32 ///////////////////////////////////////////////////////////////////////////// // // Version // VS_VERSION_INFO VERSIONINFO FILEVERSION 5,6,1,0 PRODUCTVERSION 5,6,1,0 FILEFLAGSMASK 0x3fL #ifdef _DEBUG FILEFLAGS 0x1L #else FILEFLAGS 0x0L #endif FILEOS 0x4L FILETYPE 0x2L FILESUBTYPE 0x0L BEGIN BLOCK "StringFileInfo" BEGIN BLOCK "040904b0" BEGIN VALUE "Comments", "free crypto library, more information available at www.cryptopp.com" VALUE "CompanyName", "Wei Dai" VALUE "FileDescription", "Crypto++ Library DLL" VALUE "FileVersion", "5, 6, 1, 0" VALUE "InternalName", "cryptopp" VALUE "LegalCopyright", "Copyright 1995-2010 by Wei Dai" VALUE "LegalTrademarks", "Crypto++" VALUE "OriginalFilename", "cryptopp.dll" VALUE "ProductName", "Crypto++ Library" VALUE "ProductVersion", "5, 6, 1, 0" END END BLOCK "VarFileInfo" BEGIN VALUE "Translation", 0x409, 1200 END END #ifdef APSTUDIO_INVOKED ///////////////////////////////////////////////////////////////////////////// // // TEXTINCLUDE // 1 TEXTINCLUDE BEGIN "resource.h\0" END 2 TEXTINCLUDE BEGIN "#include ""winres.h""\r\n" "\0" END 3 TEXTINCLUDE BEGIN "\r\n" "\0" END #endif // APSTUDIO_INVOKED #endif // English (U.S.) resources ///////////////////////////////////////////////////////////////////////////// #ifndef APSTUDIO_INVOKED ///////////////////////////////////////////////////////////////////////////// // // Generated from the TEXTINCLUDE 3 resource. // ///////////////////////////////////////////////////////////////////////////// #endif // not APSTUDIO_INVOKED armory-0.92.3/cppForSwig/cryptopp/tftables.cpp0000755000000000000000000003750312414772654020116 0ustar rootroot// Twofish tables #include "pch.h" #include "twofish.h" NAMESPACE_BEGIN(CryptoPP) const byte Twofish::Base::q[2][256] = { 0xA9, 0x67, 0xB3, 0xE8, 0x04, 0xFD, 0xA3, 0x76, 0x9A, 0x92, 0x80, 0x78, 0xE4, 0xDD, 0xD1, 0x38, 0x0D, 0xC6, 0x35, 0x98, 0x18, 0xF7, 0xEC, 0x6C, 0x43, 0x75, 0x37, 0x26, 0xFA, 0x13, 0x94, 0x48, 0xF2, 0xD0, 0x8B, 0x30, 0x84, 0x54, 0xDF, 0x23, 0x19, 0x5B, 0x3D, 0x59, 0xF3, 0xAE, 0xA2, 0x82, 0x63, 0x01, 0x83, 0x2E, 0xD9, 0x51, 0x9B, 0x7C, 0xA6, 0xEB, 0xA5, 0xBE, 0x16, 0x0C, 0xE3, 0x61, 0xC0, 0x8C, 0x3A, 0xF5, 0x73, 0x2C, 0x25, 0x0B, 0xBB, 0x4E, 0x89, 0x6B, 0x53, 0x6A, 0xB4, 0xF1, 0xE1, 0xE6, 0xBD, 0x45, 0xE2, 0xF4, 0xB6, 0x66, 0xCC, 0x95, 0x03, 0x56, 0xD4, 0x1C, 0x1E, 0xD7, 0xFB, 0xC3, 0x8E, 0xB5, 0xE9, 0xCF, 0xBF, 0xBA, 0xEA, 0x77, 0x39, 0xAF, 0x33, 0xC9, 0x62, 0x71, 0x81, 0x79, 0x09, 0xAD, 0x24, 0xCD, 0xF9, 0xD8, 0xE5, 0xC5, 0xB9, 0x4D, 0x44, 0x08, 0x86, 0xE7, 0xA1, 0x1D, 0xAA, 0xED, 0x06, 0x70, 0xB2, 0xD2, 0x41, 0x7B, 0xA0, 0x11, 0x31, 0xC2, 0x27, 0x90, 0x20, 0xF6, 0x60, 0xFF, 0x96, 0x5C, 0xB1, 0xAB, 0x9E, 0x9C, 0x52, 0x1B, 0x5F, 0x93, 0x0A, 0xEF, 0x91, 0x85, 0x49, 0xEE, 0x2D, 0x4F, 0x8F, 0x3B, 0x47, 0x87, 0x6D, 0x46, 0xD6, 0x3E, 0x69, 0x64, 0x2A, 0xCE, 0xCB, 0x2F, 0xFC, 0x97, 0x05, 0x7A, 0xAC, 0x7F, 0xD5, 0x1A, 0x4B, 0x0E, 0xA7, 0x5A, 0x28, 0x14, 0x3F, 0x29, 0x88, 0x3C, 0x4C, 0x02, 0xB8, 0xDA, 0xB0, 0x17, 0x55, 0x1F, 0x8A, 0x7D, 0x57, 0xC7, 0x8D, 0x74, 0xB7, 0xC4, 0x9F, 0x72, 0x7E, 0x15, 0x22, 0x12, 0x58, 0x07, 0x99, 0x34, 0x6E, 0x50, 0xDE, 0x68, 0x65, 0xBC, 0xDB, 0xF8, 0xC8, 0xA8, 0x2B, 0x40, 0xDC, 0xFE, 0x32, 0xA4, 0xCA, 0x10, 0x21, 0xF0, 0xD3, 0x5D, 0x0F, 0x00, 0x6F, 0x9D, 0x36, 0x42, 0x4A, 0x5E, 0xC1, 0xE0, 0x75, 0xF3, 0xC6, 0xF4, 0xDB, 0x7B, 0xFB, 0xC8, 0x4A, 0xD3, 0xE6, 0x6B, 0x45, 0x7D, 0xE8, 0x4B, 0xD6, 0x32, 0xD8, 0xFD, 0x37, 0x71, 0xF1, 0xE1, 0x30, 0x0F, 0xF8, 0x1B, 0x87, 0xFA, 0x06, 0x3F, 0x5E, 0xBA, 0xAE, 0x5B, 0x8A, 0x00, 0xBC, 0x9D, 0x6D, 0xC1, 0xB1, 0x0E, 0x80, 0x5D, 0xD2, 0xD5, 0xA0, 0x84, 0x07, 0x14, 0xB5, 0x90, 0x2C, 0xA3, 0xB2, 0x73, 0x4C, 0x54, 0x92, 0x74, 0x36, 0x51, 0x38, 0xB0, 0xBD, 0x5A, 0xFC, 0x60, 0x62, 0x96, 0x6C, 0x42, 0xF7, 0x10, 0x7C, 0x28, 0x27, 0x8C, 0x13, 0x95, 0x9C, 0xC7, 0x24, 0x46, 0x3B, 0x70, 0xCA, 0xE3, 0x85, 0xCB, 0x11, 0xD0, 0x93, 0xB8, 0xA6, 0x83, 0x20, 0xFF, 0x9F, 0x77, 0xC3, 0xCC, 0x03, 0x6F, 0x08, 0xBF, 0x40, 0xE7, 0x2B, 0xE2, 0x79, 0x0C, 0xAA, 0x82, 0x41, 0x3A, 0xEA, 0xB9, 0xE4, 0x9A, 0xA4, 0x97, 0x7E, 0xDA, 0x7A, 0x17, 0x66, 0x94, 0xA1, 0x1D, 0x3D, 0xF0, 0xDE, 0xB3, 0x0B, 0x72, 0xA7, 0x1C, 0xEF, 0xD1, 0x53, 0x3E, 0x8F, 0x33, 0x26, 0x5F, 0xEC, 0x76, 0x2A, 0x49, 0x81, 0x88, 0xEE, 0x21, 0xC4, 0x1A, 0xEB, 0xD9, 0xC5, 0x39, 0x99, 0xCD, 0xAD, 0x31, 0x8B, 0x01, 0x18, 0x23, 0xDD, 0x1F, 0x4E, 0x2D, 0xF9, 0x48, 0x4F, 0xF2, 0x65, 0x8E, 0x78, 0x5C, 0x58, 0x19, 0x8D, 0xE5, 0x98, 0x57, 0x67, 0x7F, 0x05, 0x64, 0xAF, 0x63, 0xB6, 0xFE, 0xF5, 0xB7, 0x3C, 0xA5, 0xCE, 0xE9, 0x68, 0x44, 0xE0, 0x4D, 0x43, 0x69, 0x29, 0x2E, 0xAC, 0x15, 0x59, 0xA8, 0x0A, 0x9E, 0x6E, 0x47, 0xDF, 0x34, 0x35, 0x6A, 0xCF, 0xDC, 0x22, 0xC9, 0xC0, 0x9B, 0x89, 0xD4, 0xED, 0xAB, 0x12, 0xA2, 0x0D, 0x52, 0xBB, 0x02, 0x2F, 0xA9, 0xD7, 0x61, 0x1E, 0xB4, 0x50, 0x04, 0xF6, 0xC2, 0x16, 0x25, 0x86, 0x56, 0x55, 0x09, 0xBE, 0x91 }; const word32 Twofish::Base::mds[4][256] = { 0xbcbc3275, 0xecec21f3, 0x202043c6, 0xb3b3c9f4, 0xdada03db, 0x02028b7b, 0xe2e22bfb, 0x9e9efac8, 0xc9c9ec4a, 0xd4d409d3, 0x18186be6, 0x1e1e9f6b, 0x98980e45, 0xb2b2387d, 0xa6a6d2e8, 0x2626b74b, 0x3c3c57d6, 0x93938a32, 0x8282eed8, 0x525298fd, 0x7b7bd437, 0xbbbb3771, 0x5b5b97f1, 0x474783e1, 0x24243c30, 0x5151e20f, 0xbabac6f8, 0x4a4af31b, 0xbfbf4887, 0x0d0d70fa, 0xb0b0b306, 0x7575de3f, 0xd2d2fd5e, 0x7d7d20ba, 0x666631ae, 0x3a3aa35b, 0x59591c8a, 0x00000000, 0xcdcd93bc, 0x1a1ae09d, 0xaeae2c6d, 0x7f7fabc1, 0x2b2bc7b1, 0xbebeb90e, 0xe0e0a080, 0x8a8a105d, 0x3b3b52d2, 0x6464bad5, 0xd8d888a0, 0xe7e7a584, 0x5f5fe807, 0x1b1b1114, 0x2c2cc2b5, 0xfcfcb490, 0x3131272c, 0x808065a3, 0x73732ab2, 0x0c0c8173, 0x79795f4c, 0x6b6b4154, 0x4b4b0292, 0x53536974, 0x94948f36, 0x83831f51, 0x2a2a3638, 0xc4c49cb0, 0x2222c8bd, 0xd5d5f85a, 0xbdbdc3fc, 0x48487860, 0xffffce62, 0x4c4c0796, 0x4141776c, 0xc7c7e642, 0xebeb24f7, 0x1c1c1410, 0x5d5d637c, 0x36362228, 0x6767c027, 0xe9e9af8c, 0x4444f913, 0x1414ea95, 0xf5f5bb9c, 0xcfcf18c7, 0x3f3f2d24, 0xc0c0e346, 0x7272db3b, 0x54546c70, 0x29294cca, 0xf0f035e3, 0x0808fe85, 0xc6c617cb, 0xf3f34f11, 0x8c8ce4d0, 0xa4a45993, 0xcaca96b8, 0x68683ba6, 0xb8b84d83, 0x38382820, 0xe5e52eff, 0xadad569f, 0x0b0b8477, 0xc8c81dc3, 0x9999ffcc, 0x5858ed03, 0x19199a6f, 0x0e0e0a08, 0x95957ebf, 0x70705040, 0xf7f730e7, 0x6e6ecf2b, 0x1f1f6ee2, 0xb5b53d79, 0x09090f0c, 0x616134aa, 0x57571682, 0x9f9f0b41, 0x9d9d803a, 0x111164ea, 0x2525cdb9, 0xafafdde4, 0x4545089a, 0xdfdf8da4, 0xa3a35c97, 0xeaead57e, 0x353558da, 0xededd07a, 0x4343fc17, 0xf8f8cb66, 0xfbfbb194, 0x3737d3a1, 0xfafa401d, 0xc2c2683d, 0xb4b4ccf0, 0x32325dde, 0x9c9c71b3, 0x5656e70b, 0xe3e3da72, 0x878760a7, 0x15151b1c, 0xf9f93aef, 0x6363bfd1, 0x3434a953, 0x9a9a853e, 0xb1b1428f, 0x7c7cd133, 0x88889b26, 0x3d3da65f, 0xa1a1d7ec, 0xe4e4df76, 0x8181942a, 0x91910149, 0x0f0ffb81, 0xeeeeaa88, 0x161661ee, 0xd7d77321, 0x9797f5c4, 0xa5a5a81a, 0xfefe3feb, 0x6d6db5d9, 0x7878aec5, 0xc5c56d39, 0x1d1de599, 0x7676a4cd, 0x3e3edcad, 0xcbcb6731, 0xb6b6478b, 0xefef5b01, 0x12121e18, 0x6060c523, 0x6a6ab0dd, 0x4d4df61f, 0xcecee94e, 0xdede7c2d, 0x55559df9, 0x7e7e5a48, 0x2121b24f, 0x03037af2, 0xa0a02665, 0x5e5e198e, 0x5a5a6678, 0x65654b5c, 0x62624e58, 0xfdfd4519, 0x0606f48d, 0x404086e5, 0xf2f2be98, 0x3333ac57, 0x17179067, 0x05058e7f, 0xe8e85e05, 0x4f4f7d64, 0x89896aaf, 0x10109563, 0x74742fb6, 0x0a0a75fe, 0x5c5c92f5, 0x9b9b74b7, 0x2d2d333c, 0x3030d6a5, 0x2e2e49ce, 0x494989e9, 0x46467268, 0x77775544, 0xa8a8d8e0, 0x9696044d, 0x2828bd43, 0xa9a92969, 0xd9d97929, 0x8686912e, 0xd1d187ac, 0xf4f44a15, 0x8d8d1559, 0xd6d682a8, 0xb9b9bc0a, 0x42420d9e, 0xf6f6c16e, 0x2f2fb847, 0xdddd06df, 0x23233934, 0xcccc6235, 0xf1f1c46a, 0xc1c112cf, 0x8585ebdc, 0x8f8f9e22, 0x7171a1c9, 0x9090f0c0, 0xaaaa539b, 0x0101f189, 0x8b8be1d4, 0x4e4e8ced, 0x8e8e6fab, 0xababa212, 0x6f6f3ea2, 0xe6e6540d, 0xdbdbf252, 0x92927bbb, 0xb7b7b602, 0x6969ca2f, 0x3939d9a9, 0xd3d30cd7, 0xa7a72361, 0xa2a2ad1e, 0xc3c399b4, 0x6c6c4450, 0x07070504, 0x04047ff6, 0x272746c2, 0xacaca716, 0xd0d07625, 0x50501386, 0xdcdcf756, 0x84841a55, 0xe1e15109, 0x7a7a25be, 0x1313ef91, 0xa9d93939, 0x67901717, 0xb3719c9c, 0xe8d2a6a6, 0x04050707, 0xfd985252, 0xa3658080, 0x76dfe4e4, 0x9a084545, 0x92024b4b, 0x80a0e0e0, 0x78665a5a, 0xe4ddafaf, 0xddb06a6a, 0xd1bf6363, 0x38362a2a, 0x0d54e6e6, 0xc6432020, 0x3562cccc, 0x98bef2f2, 0x181e1212, 0xf724ebeb, 0xecd7a1a1, 0x6c774141, 0x43bd2828, 0x7532bcbc, 0x37d47b7b, 0x269b8888, 0xfa700d0d, 0x13f94444, 0x94b1fbfb, 0x485a7e7e, 0xf27a0303, 0xd0e48c8c, 0x8b47b6b6, 0x303c2424, 0x84a5e7e7, 0x54416b6b, 0xdf06dddd, 0x23c56060, 0x1945fdfd, 0x5ba33a3a, 0x3d68c2c2, 0x59158d8d, 0xf321ecec, 0xae316666, 0xa23e6f6f, 0x82165757, 0x63951010, 0x015befef, 0x834db8b8, 0x2e918686, 0xd9b56d6d, 0x511f8383, 0x9b53aaaa, 0x7c635d5d, 0xa63b6868, 0xeb3ffefe, 0xa5d63030, 0xbe257a7a, 0x16a7acac, 0x0c0f0909, 0xe335f0f0, 0x6123a7a7, 0xc0f09090, 0x8cafe9e9, 0x3a809d9d, 0xf5925c5c, 0x73810c0c, 0x2c273131, 0x2576d0d0, 0x0be75656, 0xbb7b9292, 0x4ee9cece, 0x89f10101, 0x6b9f1e1e, 0x53a93434, 0x6ac4f1f1, 0xb499c3c3, 0xf1975b5b, 0xe1834747, 0xe66b1818, 0xbdc82222, 0x450e9898, 0xe26e1f1f, 0xf4c9b3b3, 0xb62f7474, 0x66cbf8f8, 0xccff9999, 0x95ea1414, 0x03ed5858, 0x56f7dcdc, 0xd4e18b8b, 0x1c1b1515, 0x1eada2a2, 0xd70cd3d3, 0xfb2be2e2, 0xc31dc8c8, 0x8e195e5e, 0xb5c22c2c, 0xe9894949, 0xcf12c1c1, 0xbf7e9595, 0xba207d7d, 0xea641111, 0x77840b0b, 0x396dc5c5, 0xaf6a8989, 0x33d17c7c, 0xc9a17171, 0x62ceffff, 0x7137bbbb, 0x81fb0f0f, 0x793db5b5, 0x0951e1e1, 0xaddc3e3e, 0x242d3f3f, 0xcda47676, 0xf99d5555, 0xd8ee8282, 0xe5864040, 0xc5ae7878, 0xb9cd2525, 0x4d049696, 0x44557777, 0x080a0e0e, 0x86135050, 0xe730f7f7, 0xa1d33737, 0x1d40fafa, 0xaa346161, 0xed8c4e4e, 0x06b3b0b0, 0x706c5454, 0xb22a7373, 0xd2523b3b, 0x410b9f9f, 0x7b8b0202, 0xa088d8d8, 0x114ff3f3, 0x3167cbcb, 0xc2462727, 0x27c06767, 0x90b4fcfc, 0x20283838, 0xf67f0404, 0x60784848, 0xff2ee5e5, 0x96074c4c, 0x5c4b6565, 0xb1c72b2b, 0xab6f8e8e, 0x9e0d4242, 0x9cbbf5f5, 0x52f2dbdb, 0x1bf34a4a, 0x5fa63d3d, 0x9359a4a4, 0x0abcb9b9, 0xef3af9f9, 0x91ef1313, 0x85fe0808, 0x49019191, 0xee611616, 0x2d7cdede, 0x4fb22121, 0x8f42b1b1, 0x3bdb7272, 0x47b82f2f, 0x8748bfbf, 0x6d2caeae, 0x46e3c0c0, 0xd6573c3c, 0x3e859a9a, 0x6929a9a9, 0x647d4f4f, 0x2a948181, 0xce492e2e, 0xcb17c6c6, 0x2fca6969, 0xfcc3bdbd, 0x975ca3a3, 0x055ee8e8, 0x7ad0eded, 0xac87d1d1, 0x7f8e0505, 0xd5ba6464, 0x1aa8a5a5, 0x4bb72626, 0x0eb9bebe, 0xa7608787, 0x5af8d5d5, 0x28223636, 0x14111b1b, 0x3fde7575, 0x2979d9d9, 0x88aaeeee, 0x3c332d2d, 0x4c5f7979, 0x02b6b7b7, 0xb896caca, 0xda583535, 0xb09cc4c4, 0x17fc4343, 0x551a8484, 0x1ff64d4d, 0x8a1c5959, 0x7d38b2b2, 0x57ac3333, 0xc718cfcf, 0x8df40606, 0x74695353, 0xb7749b9b, 0xc4f59797, 0x9f56adad, 0x72dae3e3, 0x7ed5eaea, 0x154af4f4, 0x229e8f8f, 0x12a2abab, 0x584e6262, 0x07e85f5f, 0x99e51d1d, 0x34392323, 0x6ec1f6f6, 0x50446c6c, 0xde5d3232, 0x68724646, 0x6526a0a0, 0xbc93cdcd, 0xdb03dada, 0xf8c6baba, 0xc8fa9e9e, 0xa882d6d6, 0x2bcf6e6e, 0x40507070, 0xdceb8585, 0xfe750a0a, 0x328a9393, 0xa48ddfdf, 0xca4c2929, 0x10141c1c, 0x2173d7d7, 0xf0ccb4b4, 0xd309d4d4, 0x5d108a8a, 0x0fe25151, 0x00000000, 0x6f9a1919, 0x9de01a1a, 0x368f9494, 0x42e6c7c7, 0x4aecc9c9, 0x5efdd2d2, 0xc1ab7f7f, 0xe0d8a8a8, 0xbc75bc32, 0xecf3ec21, 0x20c62043, 0xb3f4b3c9, 0xdadbda03, 0x027b028b, 0xe2fbe22b, 0x9ec89efa, 0xc94ac9ec, 0xd4d3d409, 0x18e6186b, 0x1e6b1e9f, 0x9845980e, 0xb27db238, 0xa6e8a6d2, 0x264b26b7, 0x3cd63c57, 0x9332938a, 0x82d882ee, 0x52fd5298, 0x7b377bd4, 0xbb71bb37, 0x5bf15b97, 0x47e14783, 0x2430243c, 0x510f51e2, 0xbaf8bac6, 0x4a1b4af3, 0xbf87bf48, 0x0dfa0d70, 0xb006b0b3, 0x753f75de, 0xd25ed2fd, 0x7dba7d20, 0x66ae6631, 0x3a5b3aa3, 0x598a591c, 0x00000000, 0xcdbccd93, 0x1a9d1ae0, 0xae6dae2c, 0x7fc17fab, 0x2bb12bc7, 0xbe0ebeb9, 0xe080e0a0, 0x8a5d8a10, 0x3bd23b52, 0x64d564ba, 0xd8a0d888, 0xe784e7a5, 0x5f075fe8, 0x1b141b11, 0x2cb52cc2, 0xfc90fcb4, 0x312c3127, 0x80a38065, 0x73b2732a, 0x0c730c81, 0x794c795f, 0x6b546b41, 0x4b924b02, 0x53745369, 0x9436948f, 0x8351831f, 0x2a382a36, 0xc4b0c49c, 0x22bd22c8, 0xd55ad5f8, 0xbdfcbdc3, 0x48604878, 0xff62ffce, 0x4c964c07, 0x416c4177, 0xc742c7e6, 0xebf7eb24, 0x1c101c14, 0x5d7c5d63, 0x36283622, 0x672767c0, 0xe98ce9af, 0x441344f9, 0x149514ea, 0xf59cf5bb, 0xcfc7cf18, 0x3f243f2d, 0xc046c0e3, 0x723b72db, 0x5470546c, 0x29ca294c, 0xf0e3f035, 0x088508fe, 0xc6cbc617, 0xf311f34f, 0x8cd08ce4, 0xa493a459, 0xcab8ca96, 0x68a6683b, 0xb883b84d, 0x38203828, 0xe5ffe52e, 0xad9fad56, 0x0b770b84, 0xc8c3c81d, 0x99cc99ff, 0x580358ed, 0x196f199a, 0x0e080e0a, 0x95bf957e, 0x70407050, 0xf7e7f730, 0x6e2b6ecf, 0x1fe21f6e, 0xb579b53d, 0x090c090f, 0x61aa6134, 0x57825716, 0x9f419f0b, 0x9d3a9d80, 0x11ea1164, 0x25b925cd, 0xafe4afdd, 0x459a4508, 0xdfa4df8d, 0xa397a35c, 0xea7eead5, 0x35da3558, 0xed7aedd0, 0x431743fc, 0xf866f8cb, 0xfb94fbb1, 0x37a137d3, 0xfa1dfa40, 0xc23dc268, 0xb4f0b4cc, 0x32de325d, 0x9cb39c71, 0x560b56e7, 0xe372e3da, 0x87a78760, 0x151c151b, 0xf9eff93a, 0x63d163bf, 0x345334a9, 0x9a3e9a85, 0xb18fb142, 0x7c337cd1, 0x8826889b, 0x3d5f3da6, 0xa1eca1d7, 0xe476e4df, 0x812a8194, 0x91499101, 0x0f810ffb, 0xee88eeaa, 0x16ee1661, 0xd721d773, 0x97c497f5, 0xa51aa5a8, 0xfeebfe3f, 0x6dd96db5, 0x78c578ae, 0xc539c56d, 0x1d991de5, 0x76cd76a4, 0x3ead3edc, 0xcb31cb67, 0xb68bb647, 0xef01ef5b, 0x1218121e, 0x602360c5, 0x6add6ab0, 0x4d1f4df6, 0xce4ecee9, 0xde2dde7c, 0x55f9559d, 0x7e487e5a, 0x214f21b2, 0x03f2037a, 0xa065a026, 0x5e8e5e19, 0x5a785a66, 0x655c654b, 0x6258624e, 0xfd19fd45, 0x068d06f4, 0x40e54086, 0xf298f2be, 0x335733ac, 0x17671790, 0x057f058e, 0xe805e85e, 0x4f644f7d, 0x89af896a, 0x10631095, 0x74b6742f, 0x0afe0a75, 0x5cf55c92, 0x9bb79b74, 0x2d3c2d33, 0x30a530d6, 0x2ece2e49, 0x49e94989, 0x46684672, 0x77447755, 0xa8e0a8d8, 0x964d9604, 0x284328bd, 0xa969a929, 0xd929d979, 0x862e8691, 0xd1acd187, 0xf415f44a, 0x8d598d15, 0xd6a8d682, 0xb90ab9bc, 0x429e420d, 0xf66ef6c1, 0x2f472fb8, 0xdddfdd06, 0x23342339, 0xcc35cc62, 0xf16af1c4, 0xc1cfc112, 0x85dc85eb, 0x8f228f9e, 0x71c971a1, 0x90c090f0, 0xaa9baa53, 0x018901f1, 0x8bd48be1, 0x4eed4e8c, 0x8eab8e6f, 0xab12aba2, 0x6fa26f3e, 0xe60de654, 0xdb52dbf2, 0x92bb927b, 0xb702b7b6, 0x692f69ca, 0x39a939d9, 0xd3d7d30c, 0xa761a723, 0xa21ea2ad, 0xc3b4c399, 0x6c506c44, 0x07040705, 0x04f6047f, 0x27c22746, 0xac16aca7, 0xd025d076, 0x50865013, 0xdc56dcf7, 0x8455841a, 0xe109e151, 0x7abe7a25, 0x139113ef, 0xd939a9d9, 0x90176790, 0x719cb371, 0xd2a6e8d2, 0x05070405, 0x9852fd98, 0x6580a365, 0xdfe476df, 0x08459a08, 0x024b9202, 0xa0e080a0, 0x665a7866, 0xddafe4dd, 0xb06addb0, 0xbf63d1bf, 0x362a3836, 0x54e60d54, 0x4320c643, 0x62cc3562, 0xbef298be, 0x1e12181e, 0x24ebf724, 0xd7a1ecd7, 0x77416c77, 0xbd2843bd, 0x32bc7532, 0xd47b37d4, 0x9b88269b, 0x700dfa70, 0xf94413f9, 0xb1fb94b1, 0x5a7e485a, 0x7a03f27a, 0xe48cd0e4, 0x47b68b47, 0x3c24303c, 0xa5e784a5, 0x416b5441, 0x06dddf06, 0xc56023c5, 0x45fd1945, 0xa33a5ba3, 0x68c23d68, 0x158d5915, 0x21ecf321, 0x3166ae31, 0x3e6fa23e, 0x16578216, 0x95106395, 0x5bef015b, 0x4db8834d, 0x91862e91, 0xb56dd9b5, 0x1f83511f, 0x53aa9b53, 0x635d7c63, 0x3b68a63b, 0x3ffeeb3f, 0xd630a5d6, 0x257abe25, 0xa7ac16a7, 0x0f090c0f, 0x35f0e335, 0x23a76123, 0xf090c0f0, 0xafe98caf, 0x809d3a80, 0x925cf592, 0x810c7381, 0x27312c27, 0x76d02576, 0xe7560be7, 0x7b92bb7b, 0xe9ce4ee9, 0xf10189f1, 0x9f1e6b9f, 0xa93453a9, 0xc4f16ac4, 0x99c3b499, 0x975bf197, 0x8347e183, 0x6b18e66b, 0xc822bdc8, 0x0e98450e, 0x6e1fe26e, 0xc9b3f4c9, 0x2f74b62f, 0xcbf866cb, 0xff99ccff, 0xea1495ea, 0xed5803ed, 0xf7dc56f7, 0xe18bd4e1, 0x1b151c1b, 0xada21ead, 0x0cd3d70c, 0x2be2fb2b, 0x1dc8c31d, 0x195e8e19, 0xc22cb5c2, 0x8949e989, 0x12c1cf12, 0x7e95bf7e, 0x207dba20, 0x6411ea64, 0x840b7784, 0x6dc5396d, 0x6a89af6a, 0xd17c33d1, 0xa171c9a1, 0xceff62ce, 0x37bb7137, 0xfb0f81fb, 0x3db5793d, 0x51e10951, 0xdc3eaddc, 0x2d3f242d, 0xa476cda4, 0x9d55f99d, 0xee82d8ee, 0x8640e586, 0xae78c5ae, 0xcd25b9cd, 0x04964d04, 0x55774455, 0x0a0e080a, 0x13508613, 0x30f7e730, 0xd337a1d3, 0x40fa1d40, 0x3461aa34, 0x8c4eed8c, 0xb3b006b3, 0x6c54706c, 0x2a73b22a, 0x523bd252, 0x0b9f410b, 0x8b027b8b, 0x88d8a088, 0x4ff3114f, 0x67cb3167, 0x4627c246, 0xc06727c0, 0xb4fc90b4, 0x28382028, 0x7f04f67f, 0x78486078, 0x2ee5ff2e, 0x074c9607, 0x4b655c4b, 0xc72bb1c7, 0x6f8eab6f, 0x0d429e0d, 0xbbf59cbb, 0xf2db52f2, 0xf34a1bf3, 0xa63d5fa6, 0x59a49359, 0xbcb90abc, 0x3af9ef3a, 0xef1391ef, 0xfe0885fe, 0x01914901, 0x6116ee61, 0x7cde2d7c, 0xb2214fb2, 0x42b18f42, 0xdb723bdb, 0xb82f47b8, 0x48bf8748, 0x2cae6d2c, 0xe3c046e3, 0x573cd657, 0x859a3e85, 0x29a96929, 0x7d4f647d, 0x94812a94, 0x492ece49, 0x17c6cb17, 0xca692fca, 0xc3bdfcc3, 0x5ca3975c, 0x5ee8055e, 0xd0ed7ad0, 0x87d1ac87, 0x8e057f8e, 0xba64d5ba, 0xa8a51aa8, 0xb7264bb7, 0xb9be0eb9, 0x6087a760, 0xf8d55af8, 0x22362822, 0x111b1411, 0xde753fde, 0x79d92979, 0xaaee88aa, 0x332d3c33, 0x5f794c5f, 0xb6b702b6, 0x96cab896, 0x5835da58, 0x9cc4b09c, 0xfc4317fc, 0x1a84551a, 0xf64d1ff6, 0x1c598a1c, 0x38b27d38, 0xac3357ac, 0x18cfc718, 0xf4068df4, 0x69537469, 0x749bb774, 0xf597c4f5, 0x56ad9f56, 0xdae372da, 0xd5ea7ed5, 0x4af4154a, 0x9e8f229e, 0xa2ab12a2, 0x4e62584e, 0xe85f07e8, 0xe51d99e5, 0x39233439, 0xc1f66ec1, 0x446c5044, 0x5d32de5d, 0x72466872, 0x26a06526, 0x93cdbc93, 0x03dadb03, 0xc6baf8c6, 0xfa9ec8fa, 0x82d6a882, 0xcf6e2bcf, 0x50704050, 0xeb85dceb, 0x750afe75, 0x8a93328a, 0x8ddfa48d, 0x4c29ca4c, 0x141c1014, 0x73d72173, 0xccb4f0cc, 0x09d4d309, 0x108a5d10, 0xe2510fe2, 0x00000000, 0x9a196f9a, 0xe01a9de0, 0x8f94368f, 0xe6c742e6, 0xecc94aec, 0xfdd25efd, 0xab7fc1ab, 0xd8a8e0d8}; NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/md2.cpp0000755000000000000000000000562712414772654016776 0ustar rootroot// md2.cpp - modified by Wei Dai from Andrew M. Kuchling's md2.c // The original code and all modifications are in the public domain. // This is the original introductory comment: /* * md2.c : MD2 hash algorithm. * * Part of the Python Cryptography Toolkit, version 1.1 * * Distribute and use freely; there are no restrictions on further * dissemination and usage except those imposed by the laws of your * country of residence. * */ #include "pch.h" #define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1 #include "md2.h" NAMESPACE_BEGIN(CryptoPP) namespace Weak1 { MD2::MD2() : m_X(48), m_C(16), m_buf(16) { Init(); } void MD2::Init() { memset(m_X, 0, 48); memset(m_C, 0, 16); memset(m_buf, 0, 16); m_count = 0; } void MD2::Update(const byte *buf, size_t len) { static const byte S[256] = { 41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240, 6, 19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217, 188, 76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66, 111, 24, 138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73, 160, 251, 245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178, 7, 63, 148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154, 90, 144, 50, 39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25, 48, 179, 72, 165, 181, 209, 215, 94, 146, 42, 172, 86, 170, 198, 79, 184, 56, 210, 150, 164, 125, 182, 118, 252, 107, 226, 156, 116, 4, 241, 69, 157, 112, 89, 100, 113, 135, 32, 134, 91, 207, 101, 230, 45, 168, 2, 27, 96, 37, 173, 174, 176, 185, 246, 28, 70, 97, 105, 52, 64, 126, 15, 85, 71, 163, 35, 221, 81, 175, 58, 195, 92, 249, 206, 186, 197, 234, 38, 44, 83, 13, 110, 133, 40, 132, 9, 211, 223, 205, 244, 65, 129, 77, 82, 106, 220, 55, 200, 108, 193, 171, 250, 36, 225, 123, 8, 12, 189, 177, 74, 120, 136, 149, 139, 227, 99, 232, 109, 233, 203, 213, 254, 59, 0, 29, 57, 242, 239, 183, 14, 102, 88, 208, 228, 166, 119, 114, 248, 235, 117, 75, 10, 49, 68, 80, 180, 143, 237, 31, 26, 219, 153, 141, 51, 159, 17, 131, 20 }; while (len) { unsigned int L = UnsignedMin(16U-m_count, len); memcpy(m_buf+m_count, buf, L); m_count+=L; buf+=L; len-=L; if (m_count==16) { byte t; int i,j; m_count=0; memcpy(m_X+16, m_buf, 16); t=m_C[15]; for(i=0; i<16; i++) { m_X[32+i]=m_X[16+i]^m_X[i]; t=m_C[i]^=S[m_buf[i]^t]; } t=0; for(i=0; i<18; i++) { for(j=0; j<48; j+=8) { t=m_X[j+0]^=S[t]; t=m_X[j+1]^=S[t]; t=m_X[j+2]^=S[t]; t=m_X[j+3]^=S[t]; t=m_X[j+4]^=S[t]; t=m_X[j+5]^=S[t]; t=m_X[j+6]^=S[t]; t=m_X[j+7]^=S[t]; } t=(t+i) & 0xFF; } } } } void MD2::TruncatedFinal(byte *hash, size_t size) { ThrowIfInvalidTruncatedSize(size); byte padding[16]; word32 padlen; unsigned int i; padlen= 16-m_count; for(i=0; i, public VariableKeyLength<16, 16, 64> { static const char *StaticAlgorithmName() {return "SHACAL-2";} }; /// SHACAL-2 class SHACAL2 : public SHACAL2_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms); protected: FixedSizeSecBlock m_key; static const word32 K[64]; }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef SHACAL2::Encryption SHACAL2Encryption; typedef SHACAL2::Decryption SHACAL2Decryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/polynomi.h0000755000000000000000000004074112414772654017623 0ustar rootroot#ifndef CRYPTOPP_POLYNOMI_H #define CRYPTOPP_POLYNOMI_H /*! \file */ #include "cryptlib.h" #include "misc.h" #include "algebra.h" #include #include NAMESPACE_BEGIN(CryptoPP) //! represents single-variable polynomials over arbitrary rings /*! \nosubgrouping */ template class PolynomialOver { public: //! \name ENUMS, EXCEPTIONS, and TYPEDEFS //@{ //! division by zero exception class DivideByZero : public Exception { public: DivideByZero() : Exception(OTHER_ERROR, "PolynomialOver: division by zero") {} }; //! specify the distribution for randomization functions class RandomizationParameter { public: RandomizationParameter(unsigned int coefficientCount, const typename T::RandomizationParameter &coefficientParameter ) : m_coefficientCount(coefficientCount), m_coefficientParameter(coefficientParameter) {} private: unsigned int m_coefficientCount; typename T::RandomizationParameter m_coefficientParameter; friend class PolynomialOver; }; typedef T Ring; typedef typename T::Element CoefficientType; //@} //! \name CREATORS //@{ //! creates the zero polynomial PolynomialOver() {} //! PolynomialOver(const Ring &ring, unsigned int count) : m_coefficients((size_t)count, ring.Identity()) {} //! copy constructor PolynomialOver(const PolynomialOver &t) : m_coefficients(t.m_coefficients.size()) {*this = t;} //! construct constant polynomial PolynomialOver(const CoefficientType &element) : m_coefficients(1, element) {} //! construct polynomial with specified coefficients, starting from coefficient of x^0 template PolynomialOver(Iterator begin, Iterator end) : m_coefficients(begin, end) {} //! convert from string PolynomialOver(const char *str, const Ring &ring) {FromStr(str, ring);} //! convert from big-endian byte array PolynomialOver(const byte *encodedPolynomialOver, unsigned int byteCount); //! convert from Basic Encoding Rules encoded byte array explicit PolynomialOver(const byte *BEREncodedPolynomialOver); //! convert from BER encoded byte array stored in a BufferedTransformation object explicit PolynomialOver(BufferedTransformation &bt); //! create a random PolynomialOver PolynomialOver(RandomNumberGenerator &rng, const RandomizationParameter ¶meter, const Ring &ring) {Randomize(rng, parameter, ring);} //@} //! \name ACCESSORS //@{ //! the zero polynomial will return a degree of -1 int Degree(const Ring &ring) const {return int(CoefficientCount(ring))-1;} //! unsigned int CoefficientCount(const Ring &ring) const; //! return coefficient for x^i CoefficientType GetCoefficient(unsigned int i, const Ring &ring) const; //@} //! \name MANIPULATORS //@{ //! PolynomialOver& operator=(const PolynomialOver& t); //! void Randomize(RandomNumberGenerator &rng, const RandomizationParameter ¶meter, const Ring &ring); //! set the coefficient for x^i to value void SetCoefficient(unsigned int i, const CoefficientType &value, const Ring &ring); //! void Negate(const Ring &ring); //! void swap(PolynomialOver &t); //@} //! \name BASIC ARITHMETIC ON POLYNOMIALS //@{ bool Equals(const PolynomialOver &t, const Ring &ring) const; bool IsZero(const Ring &ring) const {return CoefficientCount(ring)==0;} PolynomialOver Plus(const PolynomialOver& t, const Ring &ring) const; PolynomialOver Minus(const PolynomialOver& t, const Ring &ring) const; PolynomialOver Inverse(const Ring &ring) const; PolynomialOver Times(const PolynomialOver& t, const Ring &ring) const; PolynomialOver DividedBy(const PolynomialOver& t, const Ring &ring) const; PolynomialOver Modulo(const PolynomialOver& t, const Ring &ring) const; PolynomialOver MultiplicativeInverse(const Ring &ring) const; bool IsUnit(const Ring &ring) const; PolynomialOver& Accumulate(const PolynomialOver& t, const Ring &ring); PolynomialOver& Reduce(const PolynomialOver& t, const Ring &ring); //! PolynomialOver Doubled(const Ring &ring) const {return Plus(*this, ring);} //! PolynomialOver Squared(const Ring &ring) const {return Times(*this, ring);} CoefficientType EvaluateAt(const CoefficientType &x, const Ring &ring) const; PolynomialOver& ShiftLeft(unsigned int n, const Ring &ring); PolynomialOver& ShiftRight(unsigned int n, const Ring &ring); //! calculate r and q such that (a == d*q + r) && (0 <= degree of r < degree of d) static void Divide(PolynomialOver &r, PolynomialOver &q, const PolynomialOver &a, const PolynomialOver &d, const Ring &ring); //@} //! \name INPUT/OUTPUT //@{ std::istream& Input(std::istream &in, const Ring &ring); std::ostream& Output(std::ostream &out, const Ring &ring) const; //@} private: void FromStr(const char *str, const Ring &ring); std::vector m_coefficients; }; //! Polynomials over a fixed ring /*! Having a fixed ring allows overloaded operators */ template class PolynomialOverFixedRing : private PolynomialOver { typedef PolynomialOver B; typedef PolynomialOverFixedRing ThisType; public: typedef T Ring; typedef typename T::Element CoefficientType; typedef typename B::DivideByZero DivideByZero; typedef typename B::RandomizationParameter RandomizationParameter; //! \name CREATORS //@{ //! creates the zero polynomial PolynomialOverFixedRing(unsigned int count = 0) : B(ms_fixedRing, count) {} //! copy constructor PolynomialOverFixedRing(const ThisType &t) : B(t) {} explicit PolynomialOverFixedRing(const B &t) : B(t) {} //! construct constant polynomial PolynomialOverFixedRing(const CoefficientType &element) : B(element) {} //! construct polynomial with specified coefficients, starting from coefficient of x^0 template PolynomialOverFixedRing(Iterator first, Iterator last) : B(first, last) {} //! convert from string explicit PolynomialOverFixedRing(const char *str) : B(str, ms_fixedRing) {} //! convert from big-endian byte array PolynomialOverFixedRing(const byte *encodedPoly, unsigned int byteCount) : B(encodedPoly, byteCount) {} //! convert from Basic Encoding Rules encoded byte array explicit PolynomialOverFixedRing(const byte *BEREncodedPoly) : B(BEREncodedPoly) {} //! convert from BER encoded byte array stored in a BufferedTransformation object explicit PolynomialOverFixedRing(BufferedTransformation &bt) : B(bt) {} //! create a random PolynomialOverFixedRing PolynomialOverFixedRing(RandomNumberGenerator &rng, const RandomizationParameter ¶meter) : B(rng, parameter, ms_fixedRing) {} static const ThisType &Zero(); static const ThisType &One(); //@} //! \name ACCESSORS //@{ //! the zero polynomial will return a degree of -1 int Degree() const {return B::Degree(ms_fixedRing);} //! degree + 1 unsigned int CoefficientCount() const {return B::CoefficientCount(ms_fixedRing);} //! return coefficient for x^i CoefficientType GetCoefficient(unsigned int i) const {return B::GetCoefficient(i, ms_fixedRing);} //! return coefficient for x^i CoefficientType operator[](unsigned int i) const {return B::GetCoefficient(i, ms_fixedRing);} //@} //! \name MANIPULATORS //@{ //! ThisType& operator=(const ThisType& t) {B::operator=(t); return *this;} //! ThisType& operator+=(const ThisType& t) {Accumulate(t, ms_fixedRing); return *this;} //! ThisType& operator-=(const ThisType& t) {Reduce(t, ms_fixedRing); return *this;} //! ThisType& operator*=(const ThisType& t) {return *this = *this*t;} //! ThisType& operator/=(const ThisType& t) {return *this = *this/t;} //! ThisType& operator%=(const ThisType& t) {return *this = *this%t;} //! ThisType& operator<<=(unsigned int n) {ShiftLeft(n, ms_fixedRing); return *this;} //! ThisType& operator>>=(unsigned int n) {ShiftRight(n, ms_fixedRing); return *this;} //! set the coefficient for x^i to value void SetCoefficient(unsigned int i, const CoefficientType &value) {B::SetCoefficient(i, value, ms_fixedRing);} //! void Randomize(RandomNumberGenerator &rng, const RandomizationParameter ¶meter) {B::Randomize(rng, parameter, ms_fixedRing);} //! void Negate() {B::Negate(ms_fixedRing);} void swap(ThisType &t) {B::swap(t);} //@} //! \name UNARY OPERATORS //@{ //! bool operator!() const {return CoefficientCount()==0;} //! ThisType operator+() const {return *this;} //! ThisType operator-() const {return ThisType(Inverse(ms_fixedRing));} //@} //! \name BINARY OPERATORS //@{ //! friend ThisType operator>>(ThisType a, unsigned int n) {return ThisType(a>>=n);} //! friend ThisType operator<<(ThisType a, unsigned int n) {return ThisType(a<<=n);} //@} //! \name OTHER ARITHMETIC FUNCTIONS //@{ //! ThisType MultiplicativeInverse() const {return ThisType(B::MultiplicativeInverse(ms_fixedRing));} //! bool IsUnit() const {return B::IsUnit(ms_fixedRing);} //! ThisType Doubled() const {return ThisType(B::Doubled(ms_fixedRing));} //! ThisType Squared() const {return ThisType(B::Squared(ms_fixedRing));} CoefficientType EvaluateAt(const CoefficientType &x) const {return B::EvaluateAt(x, ms_fixedRing);} //! calculate r and q such that (a == d*q + r) && (0 <= r < abs(d)) static void Divide(ThisType &r, ThisType &q, const ThisType &a, const ThisType &d) {B::Divide(r, q, a, d, ms_fixedRing);} //@} //! \name INPUT/OUTPUT //@{ //! friend std::istream& operator>>(std::istream& in, ThisType &a) {return a.Input(in, ms_fixedRing);} //! friend std::ostream& operator<<(std::ostream& out, const ThisType &a) {return a.Output(out, ms_fixedRing);} //@} private: struct NewOnePolynomial { ThisType * operator()() const { return new ThisType(ms_fixedRing.MultiplicativeIdentity()); } }; static const Ring ms_fixedRing; }; //! Ring of polynomials over another ring template class RingOfPolynomialsOver : public AbstractEuclideanDomain > { public: typedef T CoefficientRing; typedef PolynomialOver Element; typedef typename Element::CoefficientType CoefficientType; typedef typename Element::RandomizationParameter RandomizationParameter; RingOfPolynomialsOver(const CoefficientRing &ring) : m_ring(ring) {} Element RandomElement(RandomNumberGenerator &rng, const RandomizationParameter ¶meter) {return Element(rng, parameter, m_ring);} bool Equal(const Element &a, const Element &b) const {return a.Equals(b, m_ring);} const Element& Identity() const {return this->result = m_ring.Identity();} const Element& Add(const Element &a, const Element &b) const {return this->result = a.Plus(b, m_ring);} Element& Accumulate(Element &a, const Element &b) const {a.Accumulate(b, m_ring); return a;} const Element& Inverse(const Element &a) const {return this->result = a.Inverse(m_ring);} const Element& Subtract(const Element &a, const Element &b) const {return this->result = a.Minus(b, m_ring);} Element& Reduce(Element &a, const Element &b) const {return a.Reduce(b, m_ring);} const Element& Double(const Element &a) const {return this->result = a.Doubled(m_ring);} const Element& MultiplicativeIdentity() const {return this->result = m_ring.MultiplicativeIdentity();} const Element& Multiply(const Element &a, const Element &b) const {return this->result = a.Times(b, m_ring);} const Element& Square(const Element &a) const {return this->result = a.Squared(m_ring);} bool IsUnit(const Element &a) const {return a.IsUnit(m_ring);} const Element& MultiplicativeInverse(const Element &a) const {return this->result = a.MultiplicativeInverse(m_ring);} const Element& Divide(const Element &a, const Element &b) const {return this->result = a.DividedBy(b, m_ring);} const Element& Mod(const Element &a, const Element &b) const {return this->result = a.Modulo(b, m_ring);} void DivisionAlgorithm(Element &r, Element &q, const Element &a, const Element &d) const {Element::Divide(r, q, a, d, m_ring);} class InterpolationFailed : public Exception { public: InterpolationFailed() : Exception(OTHER_ERROR, "RingOfPolynomialsOver: interpolation failed") {} }; Element Interpolate(const CoefficientType x[], const CoefficientType y[], unsigned int n) const; // a faster version of Interpolate(x, y, n).EvaluateAt(position) CoefficientType InterpolateAt(const CoefficientType &position, const CoefficientType x[], const CoefficientType y[], unsigned int n) const; /* void PrepareBulkInterpolation(CoefficientType *w, const CoefficientType x[], unsigned int n) const; void PrepareBulkInterpolationAt(CoefficientType *v, const CoefficientType &position, const CoefficientType x[], const CoefficientType w[], unsigned int n) const; CoefficientType BulkInterpolateAt(const CoefficientType y[], const CoefficientType v[], unsigned int n) const; */ protected: void CalculateAlpha(std::vector &alpha, const CoefficientType x[], const CoefficientType y[], unsigned int n) const; CoefficientRing m_ring; }; template void PrepareBulkPolynomialInterpolation(const Ring &ring, Element *w, const Element x[], unsigned int n); template void PrepareBulkPolynomialInterpolationAt(const Ring &ring, Element *v, const Element &position, const Element x[], const Element w[], unsigned int n); template Element BulkPolynomialInterpolateAt(const Ring &ring, const Element y[], const Element v[], unsigned int n); //! template inline bool operator==(const CryptoPP::PolynomialOverFixedRing &a, const CryptoPP::PolynomialOverFixedRing &b) {return a.Equals(b, a.ms_fixedRing);} //! template inline bool operator!=(const CryptoPP::PolynomialOverFixedRing &a, const CryptoPP::PolynomialOverFixedRing &b) {return !(a==b);} //! template inline bool operator> (const CryptoPP::PolynomialOverFixedRing &a, const CryptoPP::PolynomialOverFixedRing &b) {return a.Degree() > b.Degree();} //! template inline bool operator>=(const CryptoPP::PolynomialOverFixedRing &a, const CryptoPP::PolynomialOverFixedRing &b) {return a.Degree() >= b.Degree();} //! template inline bool operator< (const CryptoPP::PolynomialOverFixedRing &a, const CryptoPP::PolynomialOverFixedRing &b) {return a.Degree() < b.Degree();} //! template inline bool operator<=(const CryptoPP::PolynomialOverFixedRing &a, const CryptoPP::PolynomialOverFixedRing &b) {return a.Degree() <= b.Degree();} //! template inline CryptoPP::PolynomialOverFixedRing operator+(const CryptoPP::PolynomialOverFixedRing &a, const CryptoPP::PolynomialOverFixedRing &b) {return CryptoPP::PolynomialOverFixedRing(a.Plus(b, a.ms_fixedRing));} //! template inline CryptoPP::PolynomialOverFixedRing operator-(const CryptoPP::PolynomialOverFixedRing &a, const CryptoPP::PolynomialOverFixedRing &b) {return CryptoPP::PolynomialOverFixedRing(a.Minus(b, a.ms_fixedRing));} //! template inline CryptoPP::PolynomialOverFixedRing operator*(const CryptoPP::PolynomialOverFixedRing &a, const CryptoPP::PolynomialOverFixedRing &b) {return CryptoPP::PolynomialOverFixedRing(a.Times(b, a.ms_fixedRing));} //! template inline CryptoPP::PolynomialOverFixedRing operator/(const CryptoPP::PolynomialOverFixedRing &a, const CryptoPP::PolynomialOverFixedRing &b) {return CryptoPP::PolynomialOverFixedRing(a.DividedBy(b, a.ms_fixedRing));} //! template inline CryptoPP::PolynomialOverFixedRing operator%(const CryptoPP::PolynomialOverFixedRing &a, const CryptoPP::PolynomialOverFixedRing &b) {return CryptoPP::PolynomialOverFixedRing(a.Modulo(b, a.ms_fixedRing));} NAMESPACE_END NAMESPACE_BEGIN(std) template inline void swap(CryptoPP::PolynomialOver &a, CryptoPP::PolynomialOver &b) { a.swap(b); } template inline void swap(CryptoPP::PolynomialOverFixedRing &a, CryptoPP::PolynomialOverFixedRing &b) { a.swap(b); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/validate.h0000755000000000000000000000327612414772654017550 0ustar rootroot#ifndef CRYPTOPP_VALIDATE_H #define CRYPTOPP_VALIDATE_H #include "cryptlib.h" bool ValidateAll(bool thorough); bool TestSettings(); bool TestOS_RNG(); bool ValidateBaseCode(); bool ValidateCRC32(); bool ValidateAdler32(); bool ValidateMD2(); bool ValidateMD4(); bool ValidateMD5(); bool ValidateSHA(); bool ValidateSHA2(); bool ValidateTiger(); bool ValidateRIPEMD(); bool ValidatePanama(); bool ValidateWhirlpool(); bool ValidateHMAC(); bool ValidateTTMAC(); bool ValidateCipherModes(); bool ValidatePBKDF(); bool ValidateDES(); bool ValidateIDEA(); bool ValidateSAFER(); bool ValidateRC2(); bool ValidateARC4(); bool ValidateRC5(); bool ValidateBlowfish(); bool ValidateThreeWay(); bool ValidateGOST(); bool ValidateSHARK(); bool ValidateSEAL(); bool ValidateCAST(); bool ValidateSquare(); bool ValidateSKIPJACK(); bool ValidateRC6(); bool ValidateMARS(); bool ValidateRijndael(); bool ValidateTwofish(); bool ValidateSerpent(); bool ValidateSHACAL2(); bool ValidateCamellia(); bool ValidateSalsa(); bool ValidateSosemanuk(); bool ValidateVMAC(); bool ValidateCCM(); bool ValidateGCM(); bool ValidateCMAC(); bool ValidateBBS(); bool ValidateDH(); bool ValidateMQV(); bool ValidateRSA(); bool ValidateElGamal(); bool ValidateDLIES(); bool ValidateNR(); bool ValidateDSA(bool thorough); bool ValidateLUC(); bool ValidateLUC_DL(); bool ValidateLUC_DH(); bool ValidateXTR_DH(); bool ValidateRabin(); bool ValidateRW(); //bool ValidateBlumGoldwasser(); bool ValidateECP(); bool ValidateEC2N(); bool ValidateECDSA(); bool ValidateESIGN(); CryptoPP::RandomNumberGenerator & GlobalRNG(); bool RunTestDataFile(const char *filename, const CryptoPP::NameValuePairs &overrideParameters=CryptoPP::g_nullNameValuePairs); #endif armory-0.92.3/cppForSwig/cryptopp/whrlpool.h0000755000000000000000000000104412414772654017614 0ustar rootroot#ifndef CRYPTOPP_WHIRLPOOL_H #define CRYPTOPP_WHIRLPOOL_H #include "config.h" #include "iterhash.h" NAMESPACE_BEGIN(CryptoPP) //! Whirlpool class Whirlpool : public IteratedHashWithStaticTransform { public: static void InitState(HashWordType *state); static void Transform(word64 *digest, const word64 *data); void TruncatedFinal(byte *hash, size_t size); static const char * StaticAlgorithmName() {return "Whirlpool";} }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/gf256.cpp0000755000000000000000000000112012414772654017125 0ustar rootroot// gf256.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "gf256.h" NAMESPACE_BEGIN(CryptoPP) GF256::Element GF256::Multiply(Element a, Element b) const { word result = 0, t = b; for (unsigned int i=0; i<8; i++) { result <<= 1; if (result & 0x100) result ^= m_modulus; t <<= 1; if (t & 0x100) result ^= a; } return (GF256::Element) result; } GF256::Element GF256::MultiplicativeInverse(Element a) const { Element result = a; for (int i=1; i<7; i++) result = Multiply(Square(result), a); return Square(result); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/randpool.cpp0000755000000000000000000000270112414772654020120 0ustar rootroot// randpool.cpp - written and placed in the public domain by Wei Dai // RandomPool used to follow the design of randpool in PGP 2.6.x, // but as of version 5.5 it has been redesigned to reduce the risk // of reusing random numbers after state rollback (which may occur // when running in a virtual machine like VMware). #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "randpool.h" #include "aes.h" #include "sha.h" #include "hrtimer.h" #include NAMESPACE_BEGIN(CryptoPP) RandomPool::RandomPool() : m_pCipher(new AES::Encryption), m_keySet(false) { memset(m_key, 0, m_key.SizeInBytes()); memset(m_seed, 0, m_seed.SizeInBytes()); } void RandomPool::IncorporateEntropy(const byte *input, size_t length) { SHA256 hash; hash.Update(m_key, 32); hash.Update(input, length); hash.Final(m_key); m_keySet = false; } void RandomPool::GenerateIntoBufferedTransformation(BufferedTransformation &target, const std::string &channel, lword size) { if (size > 0) { if (!m_keySet) m_pCipher->SetKey(m_key, 32); Timer timer; TimerWord tw = timer.GetCurrentTimerValue(); CRYPTOPP_COMPILE_ASSERT(sizeof(tw) <= 16); *(TimerWord *)m_seed.data() += tw; time_t t = time(NULL); CRYPTOPP_COMPILE_ASSERT(sizeof(t) <= 8); *(time_t *)(m_seed.data()+8) += t; do { m_pCipher->ProcessBlock(m_seed); size_t len = UnsignedMin(16, size); target.ChannelPut(channel, m_seed, len); size -= len; } while (size > 0); } } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/dlltest.dsp0000755000000000000000000000716712414772654017774 0ustar rootroot# Microsoft Developer Studio Project File - Name="dlltest" - Package Owner=<4> # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86) Console Application" 0x0103 CFG=dlltest - Win32 Debug !MESSAGE This is not a valid makefile. To build this project using NMAKE, !MESSAGE use the Export Makefile command and run !MESSAGE !MESSAGE NMAKE /f "dlltest.mak". !MESSAGE !MESSAGE You can specify a configuration when running NMAKE !MESSAGE by defining the macro CFG on the command line. For example: !MESSAGE !MESSAGE NMAKE /f "dlltest.mak" CFG="dlltest - Win32 Debug" !MESSAGE !MESSAGE Possible choices for configuration are: !MESSAGE !MESSAGE "dlltest - Win32 Release" (based on "Win32 (x86) Console Application") !MESSAGE "dlltest - Win32 Debug" (based on "Win32 (x86) Console Application") !MESSAGE # Begin Project # PROP AllowPerConfigDependencies 0 # PROP Scc_ProjName "" # PROP Scc_LocalPath "" CPP=cl.exe RSC=rc.exe !IF "$(CFG)" == "dlltest - Win32 Release" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 0 # PROP BASE Output_Dir "dlltest___Win32_Release" # PROP BASE Intermediate_Dir "dlltest___Win32_Release" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 0 # PROP Output_Dir "dlltest___Win32_Release" # PROP Intermediate_Dir "dlltest___Win32_Release" # PROP Ignore_Export_Lib 0 # PROP Target_Dir "" # ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c # ADD CPP /nologo /Gz /MT /W3 /GR /GX /Zi /O1 /Ob2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "CRYPTOPP_DLL_ONLY" /YX /FD /c # ADD BASE RSC /l 0x409 /d "NDEBUG" # ADD RSC /l 0x409 /d "NDEBUG" BSC32=bscmake.exe # ADD BASE BSC32 /nologo # ADD BSC32 /nologo LINK32=link.exe # ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 # ADD LINK32 /nologo /subsystem:console /map /debug /machine:I386 /out:"DLL_Release/dlltest.exe" /libpath:"DLL_Release" !ELSEIF "$(CFG)" == "dlltest - Win32 Debug" # PROP BASE Use_MFC 0 # PROP BASE Use_Debug_Libraries 1 # PROP BASE Output_Dir "dlltest___Win32_Debug" # PROP BASE Intermediate_Dir "dlltest___Win32_Debug" # PROP BASE Target_Dir "" # PROP Use_MFC 0 # PROP Use_Debug_Libraries 1 # PROP Output_Dir "dlltest___Win32_Debug" # PROP Intermediate_Dir "dlltest___Win32_Debug" # PROP Ignore_Export_Lib 0 # PROP Target_Dir "" # ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c # ADD CPP /nologo /Gz /MTd /W3 /Gm /GR /GX /Zi /Oi /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "CRYPTOPP_DLL_ONLY" /YX /FD /GZ /c # ADD BASE RSC /l 0x409 /d "_DEBUG" # ADD RSC /l 0x409 /d "_DEBUG" BSC32=bscmake.exe # ADD BASE BSC32 /nologo # ADD BSC32 /nologo LINK32=link.exe # ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept # ADD LINK32 /nologo /subsystem:console /debug /machine:I386 /out:"DLL_Debug/dlltest.exe" /pdbtype:sept /libpath:"DLL_Debug" !ENDIF # Begin Target # Name "dlltest - Win32 Release" # Name "dlltest - Win32 Debug" # Begin Source File SOURCE=.\dlltest.cpp # End Source File # End Target # End Project armory-0.92.3/cppForSwig/cryptopp/modexppc.h0000755000000000000000000000203512414772654017566 0ustar rootroot#ifndef CRYPTOPP_MODEXPPC_H #define CRYPTOPP_MODEXPPC_H #include "modarith.h" #include "eprecomp.h" #include "smartptr.h" #include "pubkey.h" NAMESPACE_BEGIN(CryptoPP) CRYPTOPP_DLL_TEMPLATE_CLASS DL_FixedBasePrecomputationImpl; class ModExpPrecomputation : public DL_GroupPrecomputation { public: // DL_GroupPrecomputation bool NeedConversions() const {return true;} Element ConvertIn(const Element &v) const {return m_mr->ConvertIn(v);} virtual Element ConvertOut(const Element &v) const {return m_mr->ConvertOut(v);} const AbstractGroup & GetGroup() const {return m_mr->MultiplicativeGroup();} Element BERDecodeElement(BufferedTransformation &bt) const {return Integer(bt);} void DEREncodeElement(BufferedTransformation &bt, const Element &v) const {v.DEREncode(bt);} // non-inherited void SetModulus(const Integer &v) {m_mr.reset(new MontgomeryRepresentation(v));} const Integer & GetModulus() const {return m_mr->GetModulus();} private: value_ptr m_mr; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/trdlocal.h0000755000000000000000000000134212414772654017553 0ustar rootroot#ifndef CRYPTOPP_TRDLOCAL_H #define CRYPTOPP_TRDLOCAL_H #include "config.h" #ifdef THREADS_AVAILABLE #include "misc.h" #ifdef HAS_WINTHREADS typedef unsigned long ThreadLocalIndexType; #else #include typedef pthread_key_t ThreadLocalIndexType; #endif NAMESPACE_BEGIN(CryptoPP) //! thread local storage class CRYPTOPP_DLL ThreadLocalStorage : public NotCopyable { public: //! exception thrown by ThreadLocalStorage class class Err : public OS_Error { public: Err(const std::string& operation, int error); }; ThreadLocalStorage(); ~ThreadLocalStorage(); void SetValue(void *value); void *GetValue() const; private: ThreadLocalIndexType m_index; }; NAMESPACE_END #endif // #ifdef THREADS_AVAILABLE #endif armory-0.92.3/cppForSwig/cryptopp/cmac.cpp0000755000000000000000000000517312414772654017213 0ustar rootroot// cmac.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "cmac.h" NAMESPACE_BEGIN(CryptoPP) static void MulU(byte *k, unsigned int length) { byte carry = 0; for (int i=length-1; i>=1; i-=2) { byte carry2 = k[i] >> 7; k[i] += k[i] + carry; carry = k[i-1] >> 7; k[i-1] += k[i-1] + carry2; } if (carry) { switch (length) { case 8: k[7] ^= 0x1b; break; case 16: k[15] ^= 0x87; break; case 32: k[30] ^= 4; k[31] ^= 0x23; break; default: throw InvalidArgument("CMAC: " + IntToString(length) + " is not a supported cipher block size"); } } } void CMAC_Base::UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms) { BlockCipher &cipher = AccessCipher(); unsigned int blockSize = cipher.BlockSize(); cipher.SetKey(key, length, params); m_reg.CleanNew(3*blockSize); m_counter = 0; cipher.ProcessBlock(m_reg, m_reg+blockSize); MulU(m_reg+blockSize, blockSize); memcpy(m_reg+2*blockSize, m_reg+blockSize, blockSize); MulU(m_reg+2*blockSize, blockSize); } void CMAC_Base::Update(const byte *input, size_t length) { if (!length) return; BlockCipher &cipher = AccessCipher(); unsigned int blockSize = cipher.BlockSize(); if (m_counter > 0) { unsigned int len = UnsignedMin(blockSize - m_counter, length); xorbuf(m_reg+m_counter, input, len); length -= len; input += len; m_counter += len; if (m_counter == blockSize && length > 0) { cipher.ProcessBlock(m_reg); m_counter = 0; } } if (length > blockSize) { assert(m_counter == 0); size_t leftOver = 1 + cipher.AdvancedProcessBlocks(m_reg, input, m_reg, length-1, BlockTransformation::BT_DontIncrementInOutPointers|BlockTransformation::BT_XorInput); input += (length - leftOver); length = leftOver; } if (length > 0) { assert(m_counter + length <= blockSize); xorbuf(m_reg+m_counter, input, length); m_counter += (unsigned int)length; } assert(m_counter > 0); } void CMAC_Base::TruncatedFinal(byte *mac, size_t size) { ThrowIfInvalidTruncatedSize(size); BlockCipher &cipher = AccessCipher(); unsigned int blockSize = cipher.BlockSize(); if (m_counter < blockSize) { m_reg[m_counter] ^= 0x80; cipher.AdvancedProcessBlocks(m_reg, m_reg+2*blockSize, m_reg, blockSize, BlockTransformation::BT_DontIncrementInOutPointers|BlockTransformation::BT_XorInput); } else cipher.AdvancedProcessBlocks(m_reg, m_reg+blockSize, m_reg, blockSize, BlockTransformation::BT_DontIncrementInOutPointers|BlockTransformation::BT_XorInput); memcpy(mac, m_reg, size); m_counter = 0; memset(m_reg, 0, blockSize); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/md4.cpp0000755000000000000000000000527512414772654016777 0ustar rootroot// md4.cpp - modified by Wei Dai from Andrew M. Kuchling's md4.c // The original code and all modifications are in the public domain. // This is the original introductory comment: /* * md4.c : MD4 hash algorithm. * * Part of the Python Cryptography Toolkit, version 1.1 * * Distribute and use freely; there are no restrictions on further * dissemination and usage except those imposed by the laws of your * country of residence. * */ #include "pch.h" #define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1 #include "md4.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) namespace Weak1 { void MD4::InitState(HashWordType *state) { state[0] = 0x67452301L; state[1] = 0xefcdab89L; state[2] = 0x98badcfeL; state[3] = 0x10325476L; } void MD4::Transform (word32 *digest, const word32 *in) { // #define F(x, y, z) (((x) & (y)) | ((~x) & (z))) #define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z)))) #define G(x, y, z) (((x) & (y)) | ((x) & (z)) | ((y) & (z))) #define H(x, y, z) ((x) ^ (y) ^ (z)) word32 A, B, C, D; A=digest[0]; B=digest[1]; C=digest[2]; D=digest[3]; #define function(a,b,c,d,k,s) a=rotlFixed(a+F(b,c,d)+in[k],s); function(A,B,C,D, 0, 3); function(D,A,B,C, 1, 7); function(C,D,A,B, 2,11); function(B,C,D,A, 3,19); function(A,B,C,D, 4, 3); function(D,A,B,C, 5, 7); function(C,D,A,B, 6,11); function(B,C,D,A, 7,19); function(A,B,C,D, 8, 3); function(D,A,B,C, 9, 7); function(C,D,A,B,10,11); function(B,C,D,A,11,19); function(A,B,C,D,12, 3); function(D,A,B,C,13, 7); function(C,D,A,B,14,11); function(B,C,D,A,15,19); #undef function #define function(a,b,c,d,k,s) a=rotlFixed(a+G(b,c,d)+in[k]+0x5a827999,s); function(A,B,C,D, 0, 3); function(D,A,B,C, 4, 5); function(C,D,A,B, 8, 9); function(B,C,D,A,12,13); function(A,B,C,D, 1, 3); function(D,A,B,C, 5, 5); function(C,D,A,B, 9, 9); function(B,C,D,A,13,13); function(A,B,C,D, 2, 3); function(D,A,B,C, 6, 5); function(C,D,A,B,10, 9); function(B,C,D,A,14,13); function(A,B,C,D, 3, 3); function(D,A,B,C, 7, 5); function(C,D,A,B,11, 9); function(B,C,D,A,15,13); #undef function #define function(a,b,c,d,k,s) a=rotlFixed(a+H(b,c,d)+in[k]+0x6ed9eba1,s); function(A,B,C,D, 0, 3); function(D,A,B,C, 8, 9); function(C,D,A,B, 4,11); function(B,C,D,A,12,15); function(A,B,C,D, 2, 3); function(D,A,B,C,10, 9); function(C,D,A,B, 6,11); function(B,C,D,A,14,15); function(A,B,C,D, 1, 3); function(D,A,B,C, 9, 9); function(C,D,A,B, 5,11); function(B,C,D,A,13,15); function(A,B,C,D, 3, 3); function(D,A,B,C,11, 9); function(C,D,A,B, 7,11); function(B,C,D,A,15,15); digest[0]+=A; digest[1]+=B; digest[2]+=C; digest[3]+=D; } } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/shark.h0000755000000000000000000000271312414772654017062 0ustar rootroot#ifndef CRYPTOPP_SHARK_H #define CRYPTOPP_SHARK_H /** \file */ #include "config.h" #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct SHARK_Info : public FixedBlockSize<8>, public VariableKeyLength<16, 1, 16>, public VariableRounds<6, 2> { static const char *StaticAlgorithmName() {return "SHARK-E";} }; /// SHARK-E class SHARK : public SHARK_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶m); protected: unsigned int m_rounds; SecBlock m_roundKeys; }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; // used by Base to do key setup void InitForKeySetup(); private: static const byte sbox[256]; static const word64 cbox[8][256]; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; private: static const byte sbox[256]; static const word64 cbox[8][256]; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; typedef SHARK::Encryption SHARKEncryption; typedef SHARK::Decryption SHARKDecryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/channels.cpp0000755000000000000000000001636612414772654020111 0ustar rootroot// channels.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "channels.h" NAMESPACE_BEGIN(CryptoPP) USING_NAMESPACE(std) #if 0 void MessageSwitch::AddDefaultRoute(BufferedTransformation &destination, const std::string &channel) { m_defaultRoutes.push_back(Route(&destination, channel)); } void MessageSwitch::AddRoute(unsigned int begin, unsigned int end, BufferedTransformation &destination, const std::string &channel) { RangeRoute route(begin, end, Route(&destination, channel)); RouteList::iterator it = upper_bound(m_routes.begin(), m_routes.end(), route); m_routes.insert(it, route); } /* class MessageRouteIterator { public: typedef MessageSwitch::RouteList::const_iterator RouteIterator; typedef MessageSwitch::DefaultRouteList::const_iterator DefaultIterator; bool m_useDefault; RouteIterator m_itRouteCurrent, m_itRouteEnd; DefaultIterator m_itDefaultCurrent, m_itDefaultEnd; MessageRouteIterator(MessageSwitch &ms, const std::string &channel) : m_channel(channel) { pair range = cs.m_routeMap.equal_range(channel); if (range.first == range.second) { m_useDefault = true; m_itListCurrent = cs.m_defaultRoutes.begin(); m_itListEnd = cs.m_defaultRoutes.end(); } else { m_useDefault = false; m_itMapCurrent = range.first; m_itMapEnd = range.second; } } bool End() const { return m_useDefault ? m_itListCurrent == m_itListEnd : m_itMapCurrent == m_itMapEnd; } void Next() { if (m_useDefault) ++m_itListCurrent; else ++m_itMapCurrent; } BufferedTransformation & Destination() { return m_useDefault ? *m_itListCurrent->first : *m_itMapCurrent->second.first; } const std::string & Message() { if (m_useDefault) return m_itListCurrent->second.get() ? *m_itListCurrent->second.get() : m_channel; else return m_itMapCurrent->second.second; } }; void MessageSwitch::Put(byte inByte); void MessageSwitch::Put(const byte *inString, unsigned int length); void MessageSwitch::Flush(bool completeFlush, int propagation=-1); void MessageSwitch::MessageEnd(int propagation=-1); void MessageSwitch::PutMessageEnd(const byte *inString, unsigned int length, int propagation=-1); void MessageSwitch::MessageSeriesEnd(int propagation=-1); */ #endif // // ChannelRouteIterator ////////////////////////// void ChannelRouteIterator::Reset(const std::string &channel) { m_channel = channel; pair range = m_cs.m_routeMap.equal_range(channel); if (range.first == range.second) { m_useDefault = true; m_itListCurrent = m_cs.m_defaultRoutes.begin(); m_itListEnd = m_cs.m_defaultRoutes.end(); } else { m_useDefault = false; m_itMapCurrent = range.first; m_itMapEnd = range.second; } } bool ChannelRouteIterator::End() const { return m_useDefault ? m_itListCurrent == m_itListEnd : m_itMapCurrent == m_itMapEnd; } void ChannelRouteIterator::Next() { if (m_useDefault) ++m_itListCurrent; else ++m_itMapCurrent; } BufferedTransformation & ChannelRouteIterator::Destination() { return m_useDefault ? *m_itListCurrent->first : *m_itMapCurrent->second.first; } const std::string & ChannelRouteIterator::Channel() { if (m_useDefault) return m_itListCurrent->second.get() ? *m_itListCurrent->second.get() : m_channel; else return m_itMapCurrent->second.second; } // // ChannelSwitch /////////////////// size_t ChannelSwitch::ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking) { if (m_blocked) { m_blocked = false; goto WasBlocked; } m_it.Reset(channel); while (!m_it.End()) { WasBlocked: if (m_it.Destination().ChannelPut2(m_it.Channel(), begin, length, messageEnd, blocking)) { m_blocked = true; return 1; } m_it.Next(); } return 0; } void ChannelSwitch::IsolatedInitialize(const NameValuePairs ¶meters/* =g_nullNameValuePairs */) { m_routeMap.clear(); m_defaultRoutes.clear(); m_blocked = false; } bool ChannelSwitch::ChannelFlush(const std::string &channel, bool completeFlush, int propagation, bool blocking) { if (m_blocked) { m_blocked = false; goto WasBlocked; } m_it.Reset(channel); while (!m_it.End()) { WasBlocked: if (m_it.Destination().ChannelFlush(m_it.Channel(), completeFlush, propagation, blocking)) { m_blocked = true; return true; } m_it.Next(); } return false; } bool ChannelSwitch::ChannelMessageSeriesEnd(const std::string &channel, int propagation, bool blocking) { if (m_blocked) { m_blocked = false; goto WasBlocked; } m_it.Reset(channel); while (!m_it.End()) { WasBlocked: if (m_it.Destination().ChannelMessageSeriesEnd(m_it.Channel(), propagation)) { m_blocked = true; return true; } m_it.Next(); } return false; } byte * ChannelSwitch::ChannelCreatePutSpace(const std::string &channel, size_t &size) { m_it.Reset(channel); if (!m_it.End()) { BufferedTransformation &target = m_it.Destination(); const std::string &channel = m_it.Channel(); m_it.Next(); if (m_it.End()) // there is only one target channel return target.ChannelCreatePutSpace(channel, size); } size = 0; return NULL; } size_t ChannelSwitch::ChannelPutModifiable2(const std::string &channel, byte *inString, size_t length, int messageEnd, bool blocking) { ChannelRouteIterator it(*this); it.Reset(channel); if (!it.End()) { BufferedTransformation &target = it.Destination(); const std::string &targetChannel = it.Channel(); it.Next(); if (it.End()) // there is only one target channel return target.ChannelPutModifiable2(targetChannel, inString, length, messageEnd, blocking); } return ChannelPut2(channel, inString, length, messageEnd, blocking); } void ChannelSwitch::AddDefaultRoute(BufferedTransformation &destination) { m_defaultRoutes.push_back(DefaultRoute(&destination, value_ptr(NULL))); } void ChannelSwitch::RemoveDefaultRoute(BufferedTransformation &destination) { for (DefaultRouteList::iterator it = m_defaultRoutes.begin(); it != m_defaultRoutes.end(); ++it) if (it->first == &destination && !it->second.get()) { m_defaultRoutes.erase(it); break; } } void ChannelSwitch::AddDefaultRoute(BufferedTransformation &destination, const std::string &outChannel) { m_defaultRoutes.push_back(DefaultRoute(&destination, outChannel)); } void ChannelSwitch::RemoveDefaultRoute(BufferedTransformation &destination, const std::string &outChannel) { for (DefaultRouteList::iterator it = m_defaultRoutes.begin(); it != m_defaultRoutes.end(); ++it) if (it->first == &destination && (it->second.get() && *it->second == outChannel)) { m_defaultRoutes.erase(it); break; } } void ChannelSwitch::AddRoute(const std::string &inChannel, BufferedTransformation &destination, const std::string &outChannel) { m_routeMap.insert(RouteMap::value_type(inChannel, Route(&destination, outChannel))); } void ChannelSwitch::RemoveRoute(const std::string &inChannel, BufferedTransformation &destination, const std::string &outChannel) { typedef ChannelSwitch::RouteMap::iterator MapIterator; pair range = m_routeMap.equal_range(inChannel); for (MapIterator it = range.first; it != range.second; ++it) if (it->second.first == &destination && it->second.second == outChannel) { m_routeMap.erase(it); break; } } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/dlltest.vcproj0000755000000000000000000002060612414772654020502 0ustar rootroot armory-0.92.3/cppForSwig/cryptopp/stdcpp.h0000755000000000000000000000143312414772654017245 0ustar rootroot#ifndef CRYPTOPP_STDCPP_H #define CRYPTOPP_STDCPP_H #if _MSC_VER >= 1500 #define _DO_NOT_DECLARE_INTERLOCKED_INTRINSICS_IN_MEMORY #include #endif #include #include #include #include #include #include #include #include #include #include #include #include #ifdef CRYPTOPP_INCLUDE_VECTOR_CC // workaround needed on Sun Studio 12u1 Sun C++ 5.10 SunOS_i386 128229-02 2009/09/21 #include #endif // for alloca #ifdef __sun #include #elif defined(__MINGW32__) || defined(__BORLANDC__) #include #endif #ifdef _MSC_VER #pragma warning(disable: 4231) // re-disable this #ifdef _CRTAPI1 #define CRYPTOPP_MSVCRT6 #endif #endif #endif armory-0.92.3/cppForSwig/cryptopp/rc6.cpp0000755000000000000000000000435412414772654017002 0ustar rootroot// rc6.cpp - written and placed in the public domain by Sean Woods // based on Wei Dai's RC5 code. #include "pch.h" #include "rc6.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) void RC6::Base::UncheckedSetKey(const byte *k, unsigned int keylen, const NameValuePairs ¶ms) { AssertValidKeyLength(keylen); r = GetRoundsAndThrowIfInvalid(params, this); sTable.New(2*(r+2)); static const RC6_WORD MAGIC_P = 0xb7e15163L; // magic constant P for wordsize static const RC6_WORD MAGIC_Q = 0x9e3779b9L; // magic constant Q for wordsize static const int U=sizeof(RC6_WORD); const unsigned int c = STDMAX((keylen+U-1)/U, 1U); // RC6 paper says c=1 if keylen==0 SecBlock l(c); GetUserKey(LITTLE_ENDIAN_ORDER, l.begin(), c, k, keylen); sTable[0] = MAGIC_P; for (unsigned j=1; j Block; void RC6::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { const RC6_WORD *sptr = sTable; RC6_WORD a, b, c, d, t, u; Block::Get(inBlock)(a)(b)(c)(d); b += sptr[0]; d += sptr[1]; sptr += 2; for(unsigned i=0; i>1);} }; class CRYPTOPP_DLL InvertibleRSAFunction_ISO : public InvertibleRSAFunction { public: Integer CalculateInverse(RandomNumberGenerator &rng, const Integer &x) const; Integer PreimageBound() const {return ++(m_n>>1);} }; //! RSA struct CRYPTOPP_DLL RSA { static const char * CRYPTOPP_API StaticAlgorithmName() {return "RSA";} typedef RSAFunction PublicKey; typedef InvertibleRSAFunction PrivateKey; }; //! RSA cryptosystem template struct RSAES : public TF_ES { }; //! RSA signature scheme with appendix /*! See documentation of PKCS1v15 for a list of hash functions that can be used with it. */ template struct RSASS : public TF_SS { }; struct CRYPTOPP_DLL RSA_ISO { static const char * CRYPTOPP_API StaticAlgorithmName() {return "RSA-ISO";} typedef RSAFunction_ISO PublicKey; typedef InvertibleRSAFunction_ISO PrivateKey; }; template struct RSASS_ISO : public TF_SS { }; // The two RSA encryption schemes defined in PKCS #1 v2.0 typedef RSAES::Decryptor RSAES_PKCS1v15_Decryptor; typedef RSAES::Encryptor RSAES_PKCS1v15_Encryptor; typedef RSAES >::Decryptor RSAES_OAEP_SHA_Decryptor; typedef RSAES >::Encryptor RSAES_OAEP_SHA_Encryptor; // The three RSA signature schemes defined in PKCS #1 v2.0 typedef RSASS::Signer RSASSA_PKCS1v15_SHA_Signer; typedef RSASS::Verifier RSASSA_PKCS1v15_SHA_Verifier; namespace Weak { typedef RSASS::Signer RSASSA_PKCS1v15_MD2_Signer; typedef RSASS::Verifier RSASSA_PKCS1v15_MD2_Verifier; typedef RSASS::Signer RSASSA_PKCS1v15_MD5_Signer; typedef RSASS::Verifier RSASSA_PKCS1v15_MD5_Verifier; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/resource.h0000755000000000000000000000061512414772654017600 0ustar rootroot//{{NO_DEPENDENCIES}} // Microsoft Developer Studio generated include file. // Used by cryptopp.rc // // Next default values for new objects // #ifdef APSTUDIO_INVOKED #ifndef APSTUDIO_READONLY_SYMBOLS #define _APS_NEXT_RESOURCE_VALUE 101 #define _APS_NEXT_COMMAND_VALUE 40001 #define _APS_NEXT_CONTROL_VALUE 1000 #define _APS_NEXT_SYMED_VALUE 101 #endif #endif armory-0.92.3/cppForSwig/cryptopp/pssr.h0000755000000000000000000000477612414772654016754 0ustar rootroot#ifndef CRYPTOPP_PSSR_H #define CRYPTOPP_PSSR_H #include "pubkey.h" #include "emsa2.h" #ifdef CRYPTOPP_IS_DLL #include "sha.h" #endif NAMESPACE_BEGIN(CryptoPP) class CRYPTOPP_DLL PSSR_MEM_Base : public PK_RecoverableSignatureMessageEncodingMethod { virtual bool AllowRecovery() const =0; virtual size_t SaltLen(size_t hashLen) const =0; virtual size_t MinPadLen(size_t hashLen) const =0; virtual const MaskGeneratingFunction & GetMGF() const =0; public: size_t MinRepresentativeBitLength(size_t hashIdentifierLength, size_t digestLength) const; size_t MaxRecoverableLength(size_t representativeBitLength, size_t hashIdentifierLength, size_t digestLength) const; bool IsProbabilistic() const; bool AllowNonrecoverablePart() const; bool RecoverablePartFirst() const; void ComputeMessageRepresentative(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const; DecodingResult RecoverMessageFromRepresentative( HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength, byte *recoverableMessage) const; }; template class PSSR_MEM_BaseWithHashId; template<> class PSSR_MEM_BaseWithHashId : public EMSA2HashIdLookup {}; template<> class PSSR_MEM_BaseWithHashId : public PSSR_MEM_Base {}; template class PSSR_MEM : public PSSR_MEM_BaseWithHashId { virtual bool AllowRecovery() const {return ALLOW_RECOVERY;} virtual size_t SaltLen(size_t hashLen) const {return SALT_LEN < 0 ? hashLen : SALT_LEN;} virtual size_t MinPadLen(size_t hashLen) const {return MIN_PAD_LEN < 0 ? hashLen : MIN_PAD_LEN;} virtual const MaskGeneratingFunction & GetMGF() const {static MGF mgf; return mgf;} public: static std::string CRYPTOPP_API StaticAlgorithmName() {return std::string(ALLOW_RECOVERY ? "PSSR-" : "PSS-") + MGF::StaticAlgorithmName();} }; //! PSSR-MGF1 struct PSSR : public SignatureStandard { typedef PSSR_MEM SignatureMessageEncodingMethod; }; //! PSS-MGF1 struct PSS : public SignatureStandard { typedef PSSR_MEM SignatureMessageEncodingMethod; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/dh.h0000755000000000000000000000650012414772654016343 0ustar rootroot#ifndef CRYPTOPP_DH_H #define CRYPTOPP_DH_H /** \file */ #include "gfpcrypt.h" NAMESPACE_BEGIN(CryptoPP) //! , template class DH_Domain : public DL_SimpleKeyAgreementDomainBase { typedef DL_SimpleKeyAgreementDomainBase Base; public: typedef GROUP_PARAMETERS GroupParameters; typedef typename GroupParameters::Element Element; typedef DL_KeyAgreementAlgorithm_DH DH_Algorithm; typedef DH_Domain Domain; DH_Domain() {} DH_Domain(const GroupParameters ¶ms) : m_groupParameters(params) {} DH_Domain(BufferedTransformation &bt) {m_groupParameters.BERDecode(bt);} template DH_Domain(RandomNumberGenerator &v1, const T2 &v2) {m_groupParameters.Initialize(v1, v2);} template DH_Domain(RandomNumberGenerator &v1, const T2 &v2, const T3 &v3) {m_groupParameters.Initialize(v1, v2, v3);} template DH_Domain(RandomNumberGenerator &v1, const T2 &v2, const T3 &v3, const T4 &v4) {m_groupParameters.Initialize(v1, v2, v3, v4);} template DH_Domain(const T1 &v1, const T2 &v2) {m_groupParameters.Initialize(v1, v2);} template DH_Domain(const T1 &v1, const T2 &v2, const T3 &v3) {m_groupParameters.Initialize(v1, v2, v3);} template DH_Domain(const T1 &v1, const T2 &v2, const T3 &v3, const T4 &v4) {m_groupParameters.Initialize(v1, v2, v3, v4);} const GroupParameters & GetGroupParameters() const {return m_groupParameters;} GroupParameters & AccessGroupParameters() {return m_groupParameters;} void GeneratePublicKey(RandomNumberGenerator &rng, const byte *privateKey, byte *publicKey) const { Base::GeneratePublicKey(rng, privateKey, publicKey); if (FIPS_140_2_ComplianceEnabled()) { SecByteBlock privateKey2(this->PrivateKeyLength()); this->GeneratePrivateKey(rng, privateKey2); SecByteBlock publicKey2(this->PublicKeyLength()); Base::GeneratePublicKey(rng, privateKey2, publicKey2); SecByteBlock agreedValue(this->AgreedValueLength()), agreedValue2(this->AgreedValueLength()); bool agreed1 = this->Agree(agreedValue, privateKey, publicKey2); bool agreed2 = this->Agree(agreedValue2, privateKey2, publicKey); if (!agreed1 || !agreed2 || agreedValue != agreedValue2) throw SelfTestFailure(this->AlgorithmName() + ": pairwise consistency test failed"); } } static std::string CRYPTOPP_API StaticAlgorithmName() {return GroupParameters::StaticAlgorithmNamePrefix() + DH_Algorithm::StaticAlgorithmName();} std::string AlgorithmName() const {return StaticAlgorithmName();} private: const DL_KeyAgreementAlgorithm & GetKeyAgreementAlgorithm() const {return Singleton().Ref();} DL_GroupParameters & AccessAbstractGroupParameters() {return m_groupParameters;} GroupParameters m_groupParameters; }; CRYPTOPP_DLL_TEMPLATE_CLASS DH_Domain; //! Diffie-Hellman in GF(p) with key validation typedef DH_Domain DH; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/pch.cpp0000755000000000000000000000002112414772654017045 0ustar rootroot#include "pch.h" armory-0.92.3/cppForSwig/cryptopp/cryptest_bds.bdsproj0000755000000000000000000005165612414772654021705 0ustar rootroot cryptest_bds.bpf False False 1 0 0 0 False False False False False 1033 1252 1.0.0.0 1.0.0.0 v True . D:\cvs\c5\Debug_Build\cryptest_bds.exe False False True False Delphi 1.0 Compatibility Components Borland C++Builder Internet Explorer 5 Components Package armory-0.92.3/cppForSwig/cryptopp/cpu.h0000755000000000000000000002117212414772654016541 0ustar rootroot#ifndef CRYPTOPP_CPU_H #define CRYPTOPP_CPU_H #ifdef CRYPTOPP_GENERATE_X64_MASM #define CRYPTOPP_X86_ASM_AVAILABLE #define CRYPTOPP_BOOL_X64 1 #define CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE 1 #define NAMESPACE_END #else #include "config.h" #if CRYPTOPP_BOOL_SSE2_INTRINSICS_AVAILABLE #include #endif #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE #if !defined(__GNUC__) || defined(__SSSE3__) || defined(__INTEL_COMPILER) #include #else __inline __m128i __attribute__((__gnu_inline__, __always_inline__, __artificial__)) _mm_shuffle_epi8 (__m128i a, __m128i b) { asm ("pshufb %1, %0" : "+x"(a) : "xm"(b)); return a; } #endif #if !defined(__GNUC__) || defined(__SSE4_1__) || defined(__INTEL_COMPILER) #include #else __inline int __attribute__((__gnu_inline__, __always_inline__, __artificial__)) _mm_extract_epi32 (__m128i a, const int i) { int r; asm ("pextrd %2, %1, %0" : "=rm"(r) : "x"(a), "i"(i)); return r; } __inline __m128i __attribute__((__gnu_inline__, __always_inline__, __artificial__)) _mm_insert_epi32 (__m128i a, int b, const int i) { asm ("pinsrd %2, %1, %0" : "+x"(a) : "rm"(b), "i"(i)); return a; } #endif #if !defined(__GNUC__) || (defined(__AES__) && defined(__PCLMUL__)) || defined(__INTEL_COMPILER) #include #else __inline __m128i __attribute__((__gnu_inline__, __always_inline__, __artificial__)) _mm_clmulepi64_si128 (__m128i a, __m128i b, const int i) { asm ("pclmulqdq %2, %1, %0" : "+x"(a) : "xm"(b), "i"(i)); return a; } __inline __m128i __attribute__((__gnu_inline__, __always_inline__, __artificial__)) _mm_aeskeygenassist_si128 (__m128i a, const int i) { __m128i r; asm ("aeskeygenassist %2, %1, %0" : "=x"(r) : "xm"(a), "i"(i)); return r; } __inline __m128i __attribute__((__gnu_inline__, __always_inline__, __artificial__)) _mm_aesimc_si128 (__m128i a) { __m128i r; asm ("aesimc %1, %0" : "=x"(r) : "xm"(a)); return r; } __inline __m128i __attribute__((__gnu_inline__, __always_inline__, __artificial__)) _mm_aesenc_si128 (__m128i a, __m128i b) { asm ("aesenc %1, %0" : "+x"(a) : "xm"(b)); return a; } __inline __m128i __attribute__((__gnu_inline__, __always_inline__, __artificial__)) _mm_aesenclast_si128 (__m128i a, __m128i b) { asm ("aesenclast %1, %0" : "+x"(a) : "xm"(b)); return a; } __inline __m128i __attribute__((__gnu_inline__, __always_inline__, __artificial__)) _mm_aesdec_si128 (__m128i a, __m128i b) { asm ("aesdec %1, %0" : "+x"(a) : "xm"(b)); return a; } __inline __m128i __attribute__((__gnu_inline__, __always_inline__, __artificial__)) _mm_aesdeclast_si128 (__m128i a, __m128i b) { asm ("aesdeclast %1, %0" : "+x"(a) : "xm"(b)); return a; } #endif #endif NAMESPACE_BEGIN(CryptoPP) #if CRYPTOPP_BOOL_X86 || CRYPTOPP_BOOL_X64 #define CRYPTOPP_CPUID_AVAILABLE // these should not be used directly extern CRYPTOPP_DLL bool g_x86DetectionDone; extern CRYPTOPP_DLL bool g_hasSSSE3; extern CRYPTOPP_DLL bool g_hasAESNI; extern CRYPTOPP_DLL bool g_hasCLMUL; extern CRYPTOPP_DLL bool g_isP4; extern CRYPTOPP_DLL word32 g_cacheLineSize; CRYPTOPP_DLL void CRYPTOPP_API DetectX86Features(); CRYPTOPP_DLL bool CRYPTOPP_API CpuId(word32 input, word32 *output); #if CRYPTOPP_BOOL_X64 inline bool HasSSE2() {return true;} inline bool HasISSE() {return true;} inline bool HasMMX() {return true;} #else extern CRYPTOPP_DLL bool g_hasSSE2; extern CRYPTOPP_DLL bool g_hasISSE; extern CRYPTOPP_DLL bool g_hasMMX; inline bool HasSSE2() { if (!g_x86DetectionDone) DetectX86Features(); return g_hasSSE2; } inline bool HasISSE() { if (!g_x86DetectionDone) DetectX86Features(); return g_hasISSE; } inline bool HasMMX() { if (!g_x86DetectionDone) DetectX86Features(); return g_hasMMX; } #endif inline bool HasSSSE3() { if (!g_x86DetectionDone) DetectX86Features(); return g_hasSSSE3; } inline bool HasAESNI() { if (!g_x86DetectionDone) DetectX86Features(); return g_hasAESNI; } inline bool HasCLMUL() { if (!g_x86DetectionDone) DetectX86Features(); return g_hasCLMUL; } inline bool IsP4() { if (!g_x86DetectionDone) DetectX86Features(); return g_isP4; } inline int GetCacheLineSize() { if (!g_x86DetectionDone) DetectX86Features(); return g_cacheLineSize; } #else inline int GetCacheLineSize() { return CRYPTOPP_L1_CACHE_LINE_SIZE; } #endif #endif #ifdef CRYPTOPP_GENERATE_X64_MASM #define AS1(x) x*newline* #define AS2(x, y) x, y*newline* #define AS3(x, y, z) x, y, z*newline* #define ASS(x, y, a, b, c, d) x, y, a*64+b*16+c*4+d*newline* #define ASL(x) label##x:*newline* #define ASJ(x, y, z) x label##y*newline* #define ASC(x, y) x label##y*newline* #define AS_HEX(y) 0##y##h #elif defined(_MSC_VER) || defined(__BORLANDC__) #define CRYPTOPP_MS_STYLE_INLINE_ASSEMBLY #define AS1(x) __asm {x} #define AS2(x, y) __asm {x, y} #define AS3(x, y, z) __asm {x, y, z} #define ASS(x, y, a, b, c, d) __asm {x, y, (a)*64+(b)*16+(c)*4+(d)} #define ASL(x) __asm {label##x:} #define ASJ(x, y, z) __asm {x label##y} #define ASC(x, y) __asm {x label##y} #define CRYPTOPP_NAKED __declspec(naked) #define AS_HEX(y) 0x##y #else #define CRYPTOPP_GNU_STYLE_INLINE_ASSEMBLY // define these in two steps to allow arguments to be expanded #define GNU_AS1(x) #x ";" #define GNU_AS2(x, y) #x ", " #y ";" #define GNU_AS3(x, y, z) #x ", " #y ", " #z ";" #define GNU_ASL(x) "\n" #x ":" #define GNU_ASJ(x, y, z) #x " " #y #z ";" #define AS1(x) GNU_AS1(x) #define AS2(x, y) GNU_AS2(x, y) #define AS3(x, y, z) GNU_AS3(x, y, z) #define ASS(x, y, a, b, c, d) #x ", " #y ", " #a "*64+" #b "*16+" #c "*4+" #d ";" #define ASL(x) GNU_ASL(x) #define ASJ(x, y, z) GNU_ASJ(x, y, z) #define ASC(x, y) #x " " #y ";" #define CRYPTOPP_NAKED #define AS_HEX(y) 0x##y #endif #define IF0(y) #define IF1(y) y #ifdef CRYPTOPP_GENERATE_X64_MASM #define ASM_MOD(x, y) ((x) MOD (y)) #define XMMWORD_PTR XMMWORD PTR #else // GNU assembler doesn't seem to have mod operator #define ASM_MOD(x, y) ((x)-((x)/(y))*(y)) // GAS 2.15 doesn't support XMMWORD PTR. it seems necessary only for MASM #define XMMWORD_PTR #endif #if CRYPTOPP_BOOL_X86 #define AS_REG_1 ecx #define AS_REG_2 edx #define AS_REG_3 esi #define AS_REG_4 edi #define AS_REG_5 eax #define AS_REG_6 ebx #define AS_REG_7 ebp #define AS_REG_1d ecx #define AS_REG_2d edx #define AS_REG_3d esi #define AS_REG_4d edi #define AS_REG_5d eax #define AS_REG_6d ebx #define AS_REG_7d ebp #define WORD_SZ 4 #define WORD_REG(x) e##x #define WORD_PTR DWORD PTR #define AS_PUSH_IF86(x) AS1(push e##x) #define AS_POP_IF86(x) AS1(pop e##x) #define AS_JCXZ jecxz #elif CRYPTOPP_BOOL_X64 #ifdef CRYPTOPP_GENERATE_X64_MASM #define AS_REG_1 rcx #define AS_REG_2 rdx #define AS_REG_3 r8 #define AS_REG_4 r9 #define AS_REG_5 rax #define AS_REG_6 r10 #define AS_REG_7 r11 #define AS_REG_1d ecx #define AS_REG_2d edx #define AS_REG_3d r8d #define AS_REG_4d r9d #define AS_REG_5d eax #define AS_REG_6d r10d #define AS_REG_7d r11d #else #define AS_REG_1 rdi #define AS_REG_2 rsi #define AS_REG_3 rdx #define AS_REG_4 rcx #define AS_REG_5 r8 #define AS_REG_6 r9 #define AS_REG_7 r10 #define AS_REG_1d edi #define AS_REG_2d esi #define AS_REG_3d edx #define AS_REG_4d ecx #define AS_REG_5d r8d #define AS_REG_6d r9d #define AS_REG_7d r10d #endif #define WORD_SZ 8 #define WORD_REG(x) r##x #define WORD_PTR QWORD PTR #define AS_PUSH_IF86(x) #define AS_POP_IF86(x) #define AS_JCXZ jrcxz #endif // helper macro for stream cipher output #define AS_XMM_OUTPUT4(labelPrefix, inputPtr, outputPtr, x0, x1, x2, x3, t, p0, p1, p2, p3, increment)\ AS2( test inputPtr, inputPtr)\ ASC( jz, labelPrefix##3)\ AS2( test inputPtr, 15)\ ASC( jnz, labelPrefix##7)\ AS2( pxor xmm##x0, [inputPtr+p0*16])\ AS2( pxor xmm##x1, [inputPtr+p1*16])\ AS2( pxor xmm##x2, [inputPtr+p2*16])\ AS2( pxor xmm##x3, [inputPtr+p3*16])\ AS2( add inputPtr, increment*16)\ ASC( jmp, labelPrefix##3)\ ASL(labelPrefix##7)\ AS2( movdqu xmm##t, [inputPtr+p0*16])\ AS2( pxor xmm##x0, xmm##t)\ AS2( movdqu xmm##t, [inputPtr+p1*16])\ AS2( pxor xmm##x1, xmm##t)\ AS2( movdqu xmm##t, [inputPtr+p2*16])\ AS2( pxor xmm##x2, xmm##t)\ AS2( movdqu xmm##t, [inputPtr+p3*16])\ AS2( pxor xmm##x3, xmm##t)\ AS2( add inputPtr, increment*16)\ ASL(labelPrefix##3)\ AS2( test outputPtr, 15)\ ASC( jnz, labelPrefix##8)\ AS2( movdqa [outputPtr+p0*16], xmm##x0)\ AS2( movdqa [outputPtr+p1*16], xmm##x1)\ AS2( movdqa [outputPtr+p2*16], xmm##x2)\ AS2( movdqa [outputPtr+p3*16], xmm##x3)\ ASC( jmp, labelPrefix##9)\ ASL(labelPrefix##8)\ AS2( movdqu [outputPtr+p0*16], xmm##x0)\ AS2( movdqu [outputPtr+p1*16], xmm##x1)\ AS2( movdqu [outputPtr+p2*16], xmm##x2)\ AS2( movdqu [outputPtr+p3*16], xmm##x3)\ ASL(labelPrefix##9)\ AS2( add outputPtr, increment*16) NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/osrng.h0000755000000000000000000001062112414772654017077 0ustar rootroot#ifndef CRYPTOPP_OSRNG_H #define CRYPTOPP_OSRNG_H //! \file #include "config.h" #ifdef OS_RNG_AVAILABLE #include "randpool.h" #include "rng.h" #include "aes.h" #include "sha.h" #include "fips140.h" NAMESPACE_BEGIN(CryptoPP) //! Exception class for Operating-System Random Number Generator. class CRYPTOPP_DLL OS_RNG_Err : public Exception { public: OS_RNG_Err(const std::string &operation); }; #ifdef NONBLOCKING_RNG_AVAILABLE #ifdef CRYPTOPP_WIN32_AVAILABLE class CRYPTOPP_DLL MicrosoftCryptoProvider { public: MicrosoftCryptoProvider(); ~MicrosoftCryptoProvider(); #if defined(_WIN64) typedef unsigned __int64 ProviderHandle; // type HCRYPTPROV, avoid #include #else typedef unsigned long ProviderHandle; #endif ProviderHandle GetProviderHandle() const {return m_hProvider;} private: ProviderHandle m_hProvider; }; #pragma comment(lib, "advapi32.lib") #endif //! encapsulate CryptoAPI's CryptGenRandom or /dev/urandom class CRYPTOPP_DLL NonblockingRng : public RandomNumberGenerator { public: NonblockingRng(); ~NonblockingRng(); void GenerateBlock(byte *output, size_t size); protected: #ifdef CRYPTOPP_WIN32_AVAILABLE # ifndef WORKAROUND_MS_BUG_Q258000 MicrosoftCryptoProvider m_Provider; # endif #else int m_fd; #endif }; #endif #ifdef BLOCKING_RNG_AVAILABLE //! encapsulate /dev/random, or /dev/srandom on OpenBSD class CRYPTOPP_DLL BlockingRng : public RandomNumberGenerator { public: BlockingRng(); ~BlockingRng(); void GenerateBlock(byte *output, size_t size); protected: int m_fd; }; #endif CRYPTOPP_DLL void CRYPTOPP_API OS_GenerateRandomBlock(bool blocking, byte *output, size_t size); //! Automaticly Seeded Randomness Pool /*! This class seeds itself using an operating system provided RNG. */ class CRYPTOPP_DLL AutoSeededRandomPool : public RandomPool { public: //! use blocking to choose seeding with BlockingRng or NonblockingRng. the parameter is ignored if only one of these is available explicit AutoSeededRandomPool(bool blocking = false, unsigned int seedSize = 32) {Reseed(blocking, seedSize);} void Reseed(bool blocking = false, unsigned int seedSize = 32); }; //! RNG from ANSI X9.17 Appendix C, seeded using an OS provided RNG template class AutoSeededX917RNG : public RandomNumberGenerator, public NotCopyable { public: //! use blocking to choose seeding with BlockingRng or NonblockingRng. the parameter is ignored if only one of these is available explicit AutoSeededX917RNG(bool blocking = false, bool autoSeed = true) {if (autoSeed) Reseed(blocking);} void Reseed(bool blocking = false, const byte *additionalEntropy = NULL, size_t length = 0); // exposed for testing void Reseed(const byte *key, size_t keylength, const byte *seed, const byte *timeVector); bool CanIncorporateEntropy() const {return true;} void IncorporateEntropy(const byte *input, size_t length) {Reseed(false, input, length);} void GenerateIntoBufferedTransformation(BufferedTransformation &target, const std::string &channel, lword length) {m_rng->GenerateIntoBufferedTransformation(target, channel, length);} private: member_ptr m_rng; }; template void AutoSeededX917RNG::Reseed(const byte *key, size_t keylength, const byte *seed, const byte *timeVector) { m_rng.reset(new X917RNG(new typename BLOCK_CIPHER::Encryption(key, keylength), seed, timeVector)); } template void AutoSeededX917RNG::Reseed(bool blocking, const byte *input, size_t length) { SecByteBlock seed(BLOCK_CIPHER::BLOCKSIZE + BLOCK_CIPHER::DEFAULT_KEYLENGTH); const byte *key; do { OS_GenerateRandomBlock(blocking, seed, seed.size()); if (length > 0) { SHA256 hash; hash.Update(seed, seed.size()); hash.Update(input, length); hash.TruncatedFinal(seed, UnsignedMin(hash.DigestSize(), seed.size())); } key = seed + BLOCK_CIPHER::BLOCKSIZE; } // check that seed and key don't have same value while (memcmp(key, seed, STDMIN((unsigned int)BLOCK_CIPHER::BLOCKSIZE, (unsigned int)BLOCK_CIPHER::DEFAULT_KEYLENGTH)) == 0); Reseed(key, BLOCK_CIPHER::DEFAULT_KEYLENGTH, seed, NULL); } CRYPTOPP_DLL_TEMPLATE_CLASS AutoSeededX917RNG; //! this is AutoSeededX917RNG\ in FIPS mode, otherwise it's AutoSeededRandomPool #if CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2 typedef AutoSeededX917RNG DefaultAutoSeededRNG; #else typedef AutoSeededRandomPool DefaultAutoSeededRNG; #endif NAMESPACE_END #endif #endif armory-0.92.3/cppForSwig/cryptopp/winpipes.cpp0000755000000000000000000001101612414772654020137 0ustar rootroot// winpipes.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "winpipes.h" #ifdef WINDOWS_PIPES_AVAILABLE #include "wait.h" NAMESPACE_BEGIN(CryptoPP) WindowsHandle::WindowsHandle(HANDLE h, bool own) : m_h(h), m_own(own) { } WindowsHandle::~WindowsHandle() { if (m_own) { try { CloseHandle(); } catch (...) { } } } bool WindowsHandle::HandleValid() const { return m_h && m_h != INVALID_HANDLE_VALUE; } void WindowsHandle::AttachHandle(HANDLE h, bool own) { if (m_own) CloseHandle(); m_h = h; m_own = own; HandleChanged(); } HANDLE WindowsHandle::DetachHandle() { HANDLE h = m_h; m_h = INVALID_HANDLE_VALUE; HandleChanged(); return h; } void WindowsHandle::CloseHandle() { if (m_h != INVALID_HANDLE_VALUE) { ::CloseHandle(m_h); m_h = INVALID_HANDLE_VALUE; HandleChanged(); } } // ******************************************************** void WindowsPipe::HandleError(const char *operation) const { DWORD err = GetLastError(); throw Err(GetHandle(), operation, err); } WindowsPipe::Err::Err(HANDLE s, const std::string& operation, int error) : OS_Error(IO_ERROR, "WindowsPipe: " + operation + " operation failed with error 0x" + IntToString(error, 16), operation, error) , m_h(s) { } // ************************************************************* WindowsPipeReceiver::WindowsPipeReceiver() : m_resultPending(false), m_eofReceived(false) { m_event.AttachHandle(CreateEvent(NULL, true, false, NULL), true); CheckAndHandleError("CreateEvent", m_event.HandleValid()); memset(&m_overlapped, 0, sizeof(m_overlapped)); m_overlapped.hEvent = m_event; } bool WindowsPipeReceiver::Receive(byte* buf, size_t bufLen) { assert(!m_resultPending && !m_eofReceived); HANDLE h = GetHandle(); // don't queue too much at once, or we might use up non-paged memory if (ReadFile(h, buf, UnsignedMin((DWORD)128*1024, bufLen), &m_lastResult, &m_overlapped)) { if (m_lastResult == 0) m_eofReceived = true; } else { switch (GetLastError()) { default: CheckAndHandleError("ReadFile", false); case ERROR_BROKEN_PIPE: case ERROR_HANDLE_EOF: m_lastResult = 0; m_eofReceived = true; break; case ERROR_IO_PENDING: m_resultPending = true; } } return !m_resultPending; } void WindowsPipeReceiver::GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack) { if (m_resultPending) container.AddHandle(m_event, CallStack("WindowsPipeReceiver::GetWaitObjects() - result pending", &callStack)); else if (!m_eofReceived) container.SetNoWait(CallStack("WindowsPipeReceiver::GetWaitObjects() - result ready", &callStack)); } unsigned int WindowsPipeReceiver::GetReceiveResult() { if (m_resultPending) { HANDLE h = GetHandle(); if (GetOverlappedResult(h, &m_overlapped, &m_lastResult, false)) { if (m_lastResult == 0) m_eofReceived = true; } else { switch (GetLastError()) { default: CheckAndHandleError("GetOverlappedResult", false); case ERROR_BROKEN_PIPE: case ERROR_HANDLE_EOF: m_lastResult = 0; m_eofReceived = true; } } m_resultPending = false; } return m_lastResult; } // ************************************************************* WindowsPipeSender::WindowsPipeSender() : m_resultPending(false), m_lastResult(0) { m_event.AttachHandle(CreateEvent(NULL, true, false, NULL), true); CheckAndHandleError("CreateEvent", m_event.HandleValid()); memset(&m_overlapped, 0, sizeof(m_overlapped)); m_overlapped.hEvent = m_event; } void WindowsPipeSender::Send(const byte* buf, size_t bufLen) { DWORD written = 0; HANDLE h = GetHandle(); // don't queue too much at once, or we might use up non-paged memory if (WriteFile(h, buf, UnsignedMin((DWORD)128*1024, bufLen), &written, &m_overlapped)) { m_resultPending = false; m_lastResult = written; } else { if (GetLastError() != ERROR_IO_PENDING) CheckAndHandleError("WriteFile", false); m_resultPending = true; } } void WindowsPipeSender::GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack) { if (m_resultPending) container.AddHandle(m_event, CallStack("WindowsPipeSender::GetWaitObjects() - result pending", &callStack)); else container.SetNoWait(CallStack("WindowsPipeSender::GetWaitObjects() - result ready", &callStack)); } unsigned int WindowsPipeSender::GetSendResult() { if (m_resultPending) { HANDLE h = GetHandle(); BOOL result = GetOverlappedResult(h, &m_overlapped, &m_lastResult, false); CheckAndHandleError("GetOverlappedResult", result); m_resultPending = false; } return m_lastResult; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/skipjack.cpp0000755000000000000000000001366112414772654020110 0ustar rootroot// skipjack.cpp - modified by Wei Dai from Paulo Barreto's skipjack32.c, // which is public domain according to his web site. #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "skipjack.h" /* * Optimized implementation of SKIPJACK algorithm * * originally written by Panu Rissanen 1998.06.24 * optimized by Mark Tillotson 1998.06.25 * optimized by Paulo Barreto 1998.06.30 */ NAMESPACE_BEGIN(CryptoPP) /** * The F-table byte permutation (see description of the G-box permutation) */ const byte SKIPJACK::Base::fTable[256] = { 0xa3,0xd7,0x09,0x83,0xf8,0x48,0xf6,0xf4,0xb3,0x21,0x15,0x78,0x99,0xb1,0xaf,0xf9, 0xe7,0x2d,0x4d,0x8a,0xce,0x4c,0xca,0x2e,0x52,0x95,0xd9,0x1e,0x4e,0x38,0x44,0x28, 0x0a,0xdf,0x02,0xa0,0x17,0xf1,0x60,0x68,0x12,0xb7,0x7a,0xc3,0xe9,0xfa,0x3d,0x53, 0x96,0x84,0x6b,0xba,0xf2,0x63,0x9a,0x19,0x7c,0xae,0xe5,0xf5,0xf7,0x16,0x6a,0xa2, 0x39,0xb6,0x7b,0x0f,0xc1,0x93,0x81,0x1b,0xee,0xb4,0x1a,0xea,0xd0,0x91,0x2f,0xb8, 0x55,0xb9,0xda,0x85,0x3f,0x41,0xbf,0xe0,0x5a,0x58,0x80,0x5f,0x66,0x0b,0xd8,0x90, 0x35,0xd5,0xc0,0xa7,0x33,0x06,0x65,0x69,0x45,0x00,0x94,0x56,0x6d,0x98,0x9b,0x76, 0x97,0xfc,0xb2,0xc2,0xb0,0xfe,0xdb,0x20,0xe1,0xeb,0xd6,0xe4,0xdd,0x47,0x4a,0x1d, 0x42,0xed,0x9e,0x6e,0x49,0x3c,0xcd,0x43,0x27,0xd2,0x07,0xd4,0xde,0xc7,0x67,0x18, 0x89,0xcb,0x30,0x1f,0x8d,0xc6,0x8f,0xaa,0xc8,0x74,0xdc,0xc9,0x5d,0x5c,0x31,0xa4, 0x70,0x88,0x61,0x2c,0x9f,0x0d,0x2b,0x87,0x50,0x82,0x54,0x64,0x26,0x7d,0x03,0x40, 0x34,0x4b,0x1c,0x73,0xd1,0xc4,0xfd,0x3b,0xcc,0xfb,0x7f,0xab,0xe6,0x3e,0x5b,0xa5, 0xad,0x04,0x23,0x9c,0x14,0x51,0x22,0xf0,0x29,0x79,0x71,0x7e,0xff,0x8c,0x0e,0xe2, 0x0c,0xef,0xbc,0x72,0x75,0x6f,0x37,0xa1,0xec,0xd3,0x8e,0x62,0x8b,0x86,0x10,0xe8, 0x08,0x77,0x11,0xbe,0x92,0x4f,0x24,0xc5,0x32,0x36,0x9d,0xcf,0xf3,0xa6,0xbb,0xac, 0x5e,0x6c,0xa9,0x13,0x57,0x25,0xb5,0xe3,0xbd,0xa8,0x3a,0x01,0x05,0x59,0x2a,0x46 }; /** * The key-dependent permutation G on V^16 is a four-round Feistel network. * The round function is a fixed byte-substitution table (permutation on V^8), * the F-table. Each round of G incorporates a single byte from the key. */ #define g(tab, w, i, j, k, l) \ { \ w ^= (word)tab[i*256 + (w & 0xff)] << 8; \ w ^= (word)tab[j*256 + (w >> 8)]; \ w ^= (word)tab[k*256 + (w & 0xff)] << 8; \ w ^= (word)tab[l*256 + (w >> 8)]; \ } #define g0(tab, w) g(tab, w, 0, 1, 2, 3) #define g1(tab, w) g(tab, w, 4, 5, 6, 7) #define g2(tab, w) g(tab, w, 8, 9, 0, 1) #define g3(tab, w) g(tab, w, 2, 3, 4, 5) #define g4(tab, w) g(tab, w, 6, 7, 8, 9) /** * The inverse of the G permutation. */ #define h(tab, w, i, j, k, l) \ { \ w ^= (word)tab[l*256 + (w >> 8)]; \ w ^= (word)tab[k*256 + (w & 0xff)] << 8; \ w ^= (word)tab[j*256 + (w >> 8)]; \ w ^= (word)tab[i*256 + (w & 0xff)] << 8; \ } #define h0(tab, w) h(tab, w, 0, 1, 2, 3) #define h1(tab, w) h(tab, w, 4, 5, 6, 7) #define h2(tab, w) h(tab, w, 8, 9, 0, 1) #define h3(tab, w) h(tab, w, 2, 3, 4, 5) #define h4(tab, w) h(tab, w, 6, 7, 8, 9) /** * Preprocess a user key into a table to save an XOR at each F-table access. */ void SKIPJACK::Base::UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs &) { AssertValidKeyLength(length); /* tab[i][c] = fTable[c ^ key[i]] */ int i; for (i = 0; i < 10; i++) { byte *t = tab+i*256, k = key[9-i]; int c; for (c = 0; c < 256; c++) { t[c] = fTable[c ^ k]; } } } typedef BlockGetAndPut Block; /** * Encrypt a single block of data. */ void SKIPJACK::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word16 w1, w2, w3, w4; Block::Get(inBlock)(w4)(w3)(w2)(w1); /* stepping rule A: */ g0(tab, w1); w4 ^= w1 ^ 1; g1(tab, w4); w3 ^= w4 ^ 2; g2(tab, w3); w2 ^= w3 ^ 3; g3(tab, w2); w1 ^= w2 ^ 4; g4(tab, w1); w4 ^= w1 ^ 5; g0(tab, w4); w3 ^= w4 ^ 6; g1(tab, w3); w2 ^= w3 ^ 7; g2(tab, w2); w1 ^= w2 ^ 8; /* stepping rule B: */ w2 ^= w1 ^ 9; g3(tab, w1); w1 ^= w4 ^ 10; g4(tab, w4); w4 ^= w3 ^ 11; g0(tab, w3); w3 ^= w2 ^ 12; g1(tab, w2); w2 ^= w1 ^ 13; g2(tab, w1); w1 ^= w4 ^ 14; g3(tab, w4); w4 ^= w3 ^ 15; g4(tab, w3); w3 ^= w2 ^ 16; g0(tab, w2); /* stepping rule A: */ g1(tab, w1); w4 ^= w1 ^ 17; g2(tab, w4); w3 ^= w4 ^ 18; g3(tab, w3); w2 ^= w3 ^ 19; g4(tab, w2); w1 ^= w2 ^ 20; g0(tab, w1); w4 ^= w1 ^ 21; g1(tab, w4); w3 ^= w4 ^ 22; g2(tab, w3); w2 ^= w3 ^ 23; g3(tab, w2); w1 ^= w2 ^ 24; /* stepping rule B: */ w2 ^= w1 ^ 25; g4(tab, w1); w1 ^= w4 ^ 26; g0(tab, w4); w4 ^= w3 ^ 27; g1(tab, w3); w3 ^= w2 ^ 28; g2(tab, w2); w2 ^= w1 ^ 29; g3(tab, w1); w1 ^= w4 ^ 30; g4(tab, w4); w4 ^= w3 ^ 31; g0(tab, w3); w3 ^= w2 ^ 32; g1(tab, w2); Block::Put(xorBlock, outBlock)(w4)(w3)(w2)(w1); } /** * Decrypt a single block of data. */ void SKIPJACK::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word16 w1, w2, w3, w4; Block::Get(inBlock)(w4)(w3)(w2)(w1); /* stepping rule A: */ h1(tab, w2); w3 ^= w2 ^ 32; h0(tab, w3); w4 ^= w3 ^ 31; h4(tab, w4); w1 ^= w4 ^ 30; h3(tab, w1); w2 ^= w1 ^ 29; h2(tab, w2); w3 ^= w2 ^ 28; h1(tab, w3); w4 ^= w3 ^ 27; h0(tab, w4); w1 ^= w4 ^ 26; h4(tab, w1); w2 ^= w1 ^ 25; /* stepping rule B: */ w1 ^= w2 ^ 24; h3(tab, w2); w2 ^= w3 ^ 23; h2(tab, w3); w3 ^= w4 ^ 22; h1(tab, w4); w4 ^= w1 ^ 21; h0(tab, w1); w1 ^= w2 ^ 20; h4(tab, w2); w2 ^= w3 ^ 19; h3(tab, w3); w3 ^= w4 ^ 18; h2(tab, w4); w4 ^= w1 ^ 17; h1(tab, w1); /* stepping rule A: */ h0(tab, w2); w3 ^= w2 ^ 16; h4(tab, w3); w4 ^= w3 ^ 15; h3(tab, w4); w1 ^= w4 ^ 14; h2(tab, w1); w2 ^= w1 ^ 13; h1(tab, w2); w3 ^= w2 ^ 12; h0(tab, w3); w4 ^= w3 ^ 11; h4(tab, w4); w1 ^= w4 ^ 10; h3(tab, w1); w2 ^= w1 ^ 9; /* stepping rule B: */ w1 ^= w2 ^ 8; h2(tab, w2); w2 ^= w3 ^ 7; h1(tab, w3); w3 ^= w4 ^ 6; h0(tab, w4); w4 ^= w1 ^ 5; h4(tab, w1); w1 ^= w2 ^ 4; h3(tab, w2); w2 ^= w3 ^ 3; h2(tab, w3); w3 ^= w4 ^ 2; h1(tab, w4); w4 ^= w1 ^ 1; h0(tab, w1); Block::Put(xorBlock, outBlock)(w4)(w3)(w2)(w1); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/safer.h0000755000000000000000000000447612414772654017062 0ustar rootroot#ifndef CRYPTOPP_SAFER_H #define CRYPTOPP_SAFER_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) /// base class, do not use directly class SAFER { public: class CRYPTOPP_NO_VTABLE Base : public BlockCipher { public: unsigned int OptimalDataAlignment() const {return 1;} void UncheckedSetKey(const byte *userkey, unsigned int length, const NameValuePairs ¶ms); protected: virtual bool Strengthened() const =0; SecByteBlock keySchedule; static const byte exp_tab[256]; static const byte log_tab[256]; }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; }; }; template class CRYPTOPP_NO_VTABLE SAFER_Impl : public BlockCipherImpl { protected: bool Strengthened() const {return STR;} }; //! _ struct SAFER_K_Info : public FixedBlockSize<8>, public VariableKeyLength<16, 8, 16, 8>, public VariableRounds<10, 1, 13> { static const char *StaticAlgorithmName() {return "SAFER-K";} }; /// SAFER-K class SAFER_K : public SAFER_K_Info, public SAFER, public BlockCipherDocumentation { public: typedef BlockCipherFinal > Encryption; typedef BlockCipherFinal > Decryption; }; //! _ struct SAFER_SK_Info : public FixedBlockSize<8>, public VariableKeyLength<16, 8, 16, 8>, public VariableRounds<10, 1, 13> { static const char *StaticAlgorithmName() {return "SAFER-SK";} }; /// SAFER-SK class SAFER_SK : public SAFER_SK_Info, public SAFER, public BlockCipherDocumentation { public: typedef BlockCipherFinal > Encryption; typedef BlockCipherFinal > Decryption; }; typedef SAFER_K::Encryption SAFER_K_Encryption; typedef SAFER_K::Decryption SAFER_K_Decryption; typedef SAFER_SK::Encryption SAFER_SK_Encryption; typedef SAFER_SK::Decryption SAFER_SK_Decryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/cryptest_bds.bdsgroup0000755000000000000000000000150412414772654022052 0ustar rootroot cryptest_bds.bdsproj cryptlib_bds.bdsproj cryptest_bds.exe cryptlib_bds.lib armory-0.92.3/cppForSwig/cryptopp/wait.cpp0000755000000000000000000002474612414772654017263 0ustar rootroot// wait.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "wait.h" #include "misc.h" #ifdef SOCKETS_AVAILABLE #ifdef USE_BERKELEY_STYLE_SOCKETS #include #include #include #include #endif NAMESPACE_BEGIN(CryptoPP) unsigned int WaitObjectContainer::MaxWaitObjects() { #ifdef USE_WINDOWS_STYLE_SOCKETS return MAXIMUM_WAIT_OBJECTS * (MAXIMUM_WAIT_OBJECTS-1); #else return FD_SETSIZE; #endif } WaitObjectContainer::WaitObjectContainer(WaitObjectsTracer* tracer) : m_tracer(tracer), m_eventTimer(Timer::MILLISECONDS) , m_sameResultCount(0), m_noWaitTimer(Timer::MILLISECONDS) { Clear(); m_eventTimer.StartTimer(); } void WaitObjectContainer::Clear() { #ifdef USE_WINDOWS_STYLE_SOCKETS m_handles.clear(); #else m_maxFd = 0; FD_ZERO(&m_readfds); FD_ZERO(&m_writefds); #endif m_noWait = false; m_firstEventTime = 0; } inline void WaitObjectContainer::SetLastResult(LastResultType result) { if (result == m_lastResult) m_sameResultCount++; else { m_lastResult = result; m_sameResultCount = 0; } } void WaitObjectContainer::DetectNoWait(LastResultType result, CallStack const& callStack) { if (result == m_lastResult && m_noWaitTimer.ElapsedTime() > 1000) { if (m_sameResultCount > m_noWaitTimer.ElapsedTime()) { if (m_tracer) { std::string desc = "No wait loop detected - m_lastResult: "; desc.append(IntToString(m_lastResult)).append(", call stack:"); for (CallStack const* cs = &callStack; cs; cs = cs->Prev()) desc.append("\n- ").append(cs->Format()); m_tracer->TraceNoWaitLoop(desc); } try { throw 0; } catch (...) {} // help debugger break } m_noWaitTimer.StartTimer(); m_sameResultCount = 0; } } void WaitObjectContainer::SetNoWait(CallStack const& callStack) { DetectNoWait(LASTRESULT_NOWAIT, CallStack("WaitObjectContainer::SetNoWait()", &callStack)); m_noWait = true; } void WaitObjectContainer::ScheduleEvent(double milliseconds, CallStack const& callStack) { if (milliseconds <= 3) DetectNoWait(LASTRESULT_SCHEDULED, CallStack("WaitObjectContainer::ScheduleEvent()", &callStack)); double thisEventTime = m_eventTimer.ElapsedTimeAsDouble() + milliseconds; if (!m_firstEventTime || thisEventTime < m_firstEventTime) m_firstEventTime = thisEventTime; } #ifdef USE_WINDOWS_STYLE_SOCKETS struct WaitingThreadData { bool waitingToWait, terminate; HANDLE startWaiting, stopWaiting; const HANDLE *waitHandles; unsigned int count; HANDLE threadHandle; DWORD threadId; DWORD* error; }; WaitObjectContainer::~WaitObjectContainer() { try // don't let exceptions escape destructor { if (!m_threads.empty()) { HANDLE threadHandles[MAXIMUM_WAIT_OBJECTS]; unsigned int i; for (i=0; i pThread((WaitingThreadData *)lParam); WaitingThreadData &thread = *pThread; std::vector handles; while (true) { thread.waitingToWait = true; ::WaitForSingleObject(thread.startWaiting, INFINITE); thread.waitingToWait = false; if (thread.terminate) break; if (!thread.count) continue; handles.resize(thread.count + 1); handles[0] = thread.stopWaiting; std::copy(thread.waitHandles, thread.waitHandles+thread.count, handles.begin()+1); DWORD result = ::WaitForMultipleObjects((DWORD)handles.size(), &handles[0], FALSE, INFINITE); if (result == WAIT_OBJECT_0) continue; // another thread finished waiting first, so do nothing SetEvent(thread.stopWaiting); if (!(result > WAIT_OBJECT_0 && result < WAIT_OBJECT_0 + handles.size())) { assert(!"error in WaitingThread"); // break here so we can see which thread has an error *thread.error = ::GetLastError(); } } return S_OK; // return a value here to avoid compiler warning } void WaitObjectContainer::CreateThreads(unsigned int count) { size_t currentCount = m_threads.size(); if (currentCount == 0) { m_startWaiting = ::CreateEvent(NULL, TRUE, FALSE, NULL); m_stopWaiting = ::CreateEvent(NULL, TRUE, FALSE, NULL); } if (currentCount < count) { m_threads.resize(count); for (size_t i=currentCount; i MAXIMUM_WAIT_OBJECTS) { // too many wait objects for a single WaitForMultipleObjects call, so use multiple threads static const unsigned int WAIT_OBJECTS_PER_THREAD = MAXIMUM_WAIT_OBJECTS-1; unsigned int nThreads = (unsigned int)((m_handles.size() + WAIT_OBJECTS_PER_THREAD - 1) / WAIT_OBJECTS_PER_THREAD); if (nThreads > MAXIMUM_WAIT_OBJECTS) // still too many wait objects, maybe implement recursive threading later? throw Err("WaitObjectContainer: number of wait objects exceeds limit"); CreateThreads(nThreads); DWORD error = S_OK; for (unsigned int i=0; i 0) { unsigned long timeAfterWait = t.ElapsedTime(); OutputDebugString(("Handles " + IntToString(m_handles.size()) + ", Woke up by " + IntToString(result-WAIT_OBJECT_0) + ", Busied for " + IntToString(timeBeforeWait-lastTime) + " us, Waited for " + IntToString(timeAfterWait-timeBeforeWait) + " us, max " + IntToString(milliseconds) + "ms\n").c_str()); lastTime = timeAfterWait; } #endif if (result >= WAIT_OBJECT_0 && result < WAIT_OBJECT_0 + m_handles.size()) { if (result == m_lastResult) m_sameResultCount++; else { m_lastResult = result; m_sameResultCount = 0; } return true; } else if (result == WAIT_TIMEOUT) { SetLastResult(timeoutIsScheduledEvent ? LASTRESULT_SCHEDULED : LASTRESULT_TIMEOUT); return timeoutIsScheduledEvent; } else throw Err("WaitObjectContainer: WaitForMultipleObjects failed with error " + IntToString(::GetLastError())); } } #else // #ifdef USE_WINDOWS_STYLE_SOCKETS void WaitObjectContainer::AddReadFd(int fd, CallStack const& callStack) // TODO: do something with callStack { FD_SET(fd, &m_readfds); m_maxFd = STDMAX(m_maxFd, fd); } void WaitObjectContainer::AddWriteFd(int fd, CallStack const& callStack) // TODO: do something with callStack { FD_SET(fd, &m_writefds); m_maxFd = STDMAX(m_maxFd, fd); } bool WaitObjectContainer::Wait(unsigned long milliseconds) { if (m_noWait || (!m_maxFd && !m_firstEventTime)) return true; bool timeoutIsScheduledEvent = false; if (m_firstEventTime) { double timeToFirstEvent = SaturatingSubtract(m_firstEventTime, m_eventTimer.ElapsedTimeAsDouble()); if (timeToFirstEvent <= milliseconds) { milliseconds = (unsigned long)timeToFirstEvent; timeoutIsScheduledEvent = true; } } timeval tv, *timeout; if (milliseconds == INFINITE_TIME) timeout = NULL; else { tv.tv_sec = milliseconds / 1000; tv.tv_usec = (milliseconds % 1000) * 1000; timeout = &tv; } int result = select(m_maxFd+1, &m_readfds, &m_writefds, NULL, timeout); if (result > 0) return true; else if (result == 0) return timeoutIsScheduledEvent; else throw Err("WaitObjectContainer: select failed with error " + errno); } #endif // ******************************************************** std::string CallStack::Format() const { return m_info; } std::string CallStackWithNr::Format() const { return std::string(m_info) + " / nr: " + IntToString(m_nr); } std::string CallStackWithStr::Format() const { return std::string(m_info) + " / " + std::string(m_z); } bool Waitable::Wait(unsigned long milliseconds, CallStack const& callStack) { WaitObjectContainer container; GetWaitObjects(container, callStack); // reduce clutter by not adding this func to stack return container.Wait(milliseconds); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/gost.cpp0000755000000000000000000000641412414772654017263 0ustar rootroot#include "pch.h" #include "gost.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) // these are the S-boxes given in Applied Cryptography 2nd Ed., p. 333 const byte GOST::Base::sBox[8][16]={ {4, 10, 9, 2, 13, 8, 0, 14, 6, 11, 1, 12, 7, 15, 5, 3}, {14, 11, 4, 12, 6, 13, 15, 10, 2, 3, 8, 1, 0, 7, 5, 9}, {5, 8, 1, 13, 10, 3, 4, 2, 14, 15, 12, 7, 6, 0, 9, 11}, {7, 13, 10, 1, 0, 8, 9, 15, 14, 4, 6, 12, 11, 2, 5, 3}, {6, 12, 7, 1, 5, 15, 13, 8, 4, 10, 9, 14, 0, 3, 11, 2}, {4, 11, 10, 0, 7, 2, 1, 13, 3, 6, 8, 5, 9, 12, 15, 14}, {13, 11, 4, 1, 3, 15, 5, 9, 0, 10, 14, 7, 6, 8, 2, 12}, {1, 15, 13, 0, 5, 7, 10, 4, 9, 2, 3, 14, 6, 11, 8, 12}}; /* // these are the S-boxes given in the GOST source code listing in Applied // Cryptography 2nd Ed., p. 644. they appear to be from the DES S-boxes {13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7 }, { 4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1 }, {12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11 }, { 2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9 }, { 7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15 }, {10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8 }, {15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10 }, {14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7 }}; */ volatile bool GOST::Base::sTableCalculated = false; word32 GOST::Base::sTable[4][256]; void GOST::Base::UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs &) { AssertValidKeyLength(length); PrecalculateSTable(); GetUserKey(LITTLE_ENDIAN_ORDER, key.begin(), 8, userKey, KEYLENGTH); } void GOST::Base::PrecalculateSTable() { if (!sTableCalculated) { for (unsigned i = 0; i < 4; i++) for (unsigned j = 0; j < 256; j++) { word32 temp = sBox[2*i][j%16] | (sBox[2*i+1][j/16] << 4); sTable[i][j] = rotlMod(temp, 11+8*i); } sTableCalculated=true; } } #define f(x) ( t=x, \ sTable[3][GETBYTE(t, 3)] ^ sTable[2][GETBYTE(t, 2)] \ ^ sTable[1][GETBYTE(t, 1)] ^ sTable[0][GETBYTE(t, 0)] ) typedef BlockGetAndPut Block; void GOST::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 n1, n2, t; Block::Get(inBlock)(n1)(n2); for (unsigned int i=0; i<3; i++) { n2 ^= f(n1+key[0]); n1 ^= f(n2+key[1]); n2 ^= f(n1+key[2]); n1 ^= f(n2+key[3]); n2 ^= f(n1+key[4]); n1 ^= f(n2+key[5]); n2 ^= f(n1+key[6]); n1 ^= f(n2+key[7]); } n2 ^= f(n1+key[7]); n1 ^= f(n2+key[6]); n2 ^= f(n1+key[5]); n1 ^= f(n2+key[4]); n2 ^= f(n1+key[3]); n1 ^= f(n2+key[2]); n2 ^= f(n1+key[1]); n1 ^= f(n2+key[0]); Block::Put(xorBlock, outBlock)(n2)(n1); } void GOST::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word32 n1, n2, t; Block::Get(inBlock)(n1)(n2); n2 ^= f(n1+key[0]); n1 ^= f(n2+key[1]); n2 ^= f(n1+key[2]); n1 ^= f(n2+key[3]); n2 ^= f(n1+key[4]); n1 ^= f(n2+key[5]); n2 ^= f(n1+key[6]); n1 ^= f(n2+key[7]); for (unsigned int i=0; i<3; i++) { n2 ^= f(n1+key[7]); n1 ^= f(n2+key[6]); n2 ^= f(n1+key[5]); n1 ^= f(n2+key[4]); n2 ^= f(n1+key[3]); n1 ^= f(n2+key[2]); n2 ^= f(n1+key[1]); n1 ^= f(n2+key[0]); } Block::Put(xorBlock, outBlock)(n2)(n1); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/eprecomp.cpp0000755000000000000000000000735012414772654020121 0ustar rootroot// eprecomp.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "eprecomp.h" #include "asn.h" NAMESPACE_BEGIN(CryptoPP) template void DL_FixedBasePrecomputationImpl::SetBase(const DL_GroupPrecomputation &group, const Element &i_base) { m_base = group.NeedConversions() ? group.ConvertIn(i_base) : i_base; if (m_bases.empty() || !(m_base == m_bases[0])) { m_bases.resize(1); m_bases[0] = m_base; } if (group.NeedConversions()) m_base = i_base; } template void DL_FixedBasePrecomputationImpl::Precompute(const DL_GroupPrecomputation &group, unsigned int maxExpBits, unsigned int storage) { assert(m_bases.size() > 0); assert(storage <= maxExpBits); if (storage > 1) { m_windowSize = (maxExpBits+storage-1)/storage; m_exponentBase = Integer::Power2(m_windowSize); } m_bases.resize(storage); for (unsigned i=1; i void DL_FixedBasePrecomputationImpl::Load(const DL_GroupPrecomputation &group, BufferedTransformation &bt) { BERSequenceDecoder seq(bt); word32 version; BERDecodeUnsigned(seq, version, INTEGER, 1, 1); m_exponentBase.BERDecode(seq); m_windowSize = m_exponentBase.BitCount() - 1; m_bases.clear(); while (!seq.EndReached()) m_bases.push_back(group.BERDecodeElement(seq)); if (!m_bases.empty() && group.NeedConversions()) m_base = group.ConvertOut(m_bases[0]); seq.MessageEnd(); } template void DL_FixedBasePrecomputationImpl::Save(const DL_GroupPrecomputation &group, BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); DEREncodeUnsigned(seq, 1); // version m_exponentBase.DEREncode(seq); for (unsigned i=0; i void DL_FixedBasePrecomputationImpl::PrepareCascade(const DL_GroupPrecomputation &i_group, std::vector > &eb, const Integer &exponent) const { const AbstractGroup &group = i_group.GetGroup(); Integer r, q, e = exponent; bool fastNegate = group.InversionIsFast() && m_windowSize > 1; unsigned int i; for (i=0; i+1(group.Inverse(m_bases[i]), m_exponentBase - r)); } else eb.push_back(BaseAndExponent(m_bases[i], r)); } eb.push_back(BaseAndExponent(m_bases[i], e)); } template T DL_FixedBasePrecomputationImpl::Exponentiate(const DL_GroupPrecomputation &group, const Integer &exponent) const { std::vector > eb; // array of segments of the exponent and precalculated bases eb.reserve(m_bases.size()); PrepareCascade(group, eb, exponent); return group.ConvertOut(GeneralCascadeMultiplication(group.GetGroup(), eb.begin(), eb.end())); } template T DL_FixedBasePrecomputationImpl::CascadeExponentiate(const DL_GroupPrecomputation &group, const Integer &exponent, const DL_FixedBasePrecomputation &i_pc2, const Integer &exponent2) const { std::vector > eb; // array of segments of the exponent and precalculated bases const DL_FixedBasePrecomputationImpl &pc2 = static_cast &>(i_pc2); eb.reserve(m_bases.size() + pc2.m_bases.size()); PrepareCascade(group, eb, exponent); pc2.PrepareCascade(group, eb, exponent2); return group.ConvertOut(GeneralCascadeMultiplication(group.GetGroup(), eb.begin(), eb.end())); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/tiger.cpp0000755000000000000000000001346212414772654017422 0ustar rootroot// tiger.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "tiger.h" #include "misc.h" #include "cpu.h" NAMESPACE_BEGIN(CryptoPP) void Tiger::InitState(HashWordType *state) { state[0] = W64LIT(0x0123456789ABCDEF); state[1] = W64LIT(0xFEDCBA9876543210); state[2] = W64LIT(0xF096A5B4C3B2E187); } void Tiger::TruncatedFinal(byte *hash, size_t size) { ThrowIfInvalidTruncatedSize(size); PadLastBlock(56, 0x01); CorrectEndianess(m_data, m_data, 56); m_data[7] = GetBitCountLo(); Transform(m_state, m_data); CorrectEndianess(m_state, m_state, DigestSize()); memcpy(hash, m_state, size); Restart(); // reinit for next use } void Tiger::Transform (word64 *digest, const word64 *X) { #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE && CRYPTOPP_BOOL_X86 if (HasSSE2()) { #ifdef __GNUC__ __asm__ __volatile__ ( ".intel_syntax noprefix;" AS1( push ebx) #else #if _MSC_VER < 1300 const word64 *t = table; AS2( mov edx, t) #else AS2( lea edx, [table]) #endif AS2( mov eax, digest) AS2( mov esi, X) #endif AS2( movq mm0, [eax]) AS2( movq mm1, [eax+1*8]) AS2( movq mm5, mm1) AS2( movq mm2, [eax+2*8]) AS2( movq mm7, [edx+4*2048+0*8]) AS2( movq mm6, [edx+4*2048+1*8]) AS2( mov ecx, esp) AS2( and esp, 0xfffffff0) AS2( sub esp, 8*8) AS1( push ecx) #define SSE2_round(a,b,c,x,mul) \ AS2( pxor c, [x])\ AS2( movd ecx, c)\ AS2( movzx edi, cl)\ AS2( movq mm3, [edx+0*2048+edi*8])\ AS2( movzx edi, ch)\ AS2( movq mm4, [edx+3*2048+edi*8])\ AS2( shr ecx, 16)\ AS2( movzx edi, cl)\ AS2( pxor mm3, [edx+1*2048+edi*8])\ AS2( movzx edi, ch)\ AS2( pxor mm4, [edx+2*2048+edi*8])\ AS3( pextrw ecx, c, 2)\ AS2( movzx edi, cl)\ AS2( pxor mm3, [edx+2*2048+edi*8])\ AS2( movzx edi, ch)\ AS2( pxor mm4, [edx+1*2048+edi*8])\ AS3( pextrw ecx, c, 3)\ AS2( movzx edi, cl)\ AS2( pxor mm3, [edx+3*2048+edi*8])\ AS2( psubq a, mm3)\ AS2( movzx edi, ch)\ AS2( pxor mm4, [edx+0*2048+edi*8])\ AS2( paddq b, mm4)\ SSE2_mul_##mul(b) #define SSE2_mul_5(b) \ AS2( movq mm3, b)\ AS2( psllq b, 2)\ AS2( paddq b, mm3) #define SSE2_mul_7(b) \ AS2( movq mm3, b)\ AS2( psllq b, 3)\ AS2( psubq b, mm3) #define SSE2_mul_9(b) \ AS2( movq mm3, b)\ AS2( psllq b, 3)\ AS2( paddq b, mm3) #define label2_5 1 #define label2_7 2 #define label2_9 3 #define SSE2_pass(A,B,C,mul,X) \ AS2( xor ebx, ebx)\ ASL(mul)\ SSE2_round(A,B,C,X+0*8+ebx,mul)\ SSE2_round(B,C,A,X+1*8+ebx,mul)\ AS2( cmp ebx, 6*8)\ ASJ( je, label2_##mul, f)\ SSE2_round(C,A,B,X+2*8+ebx,mul)\ AS2( add ebx, 3*8)\ ASJ( jmp, mul, b)\ ASL(label2_##mul) #define SSE2_key_schedule(Y,X) \ AS2( movq mm3, [X+7*8])\ AS2( pxor mm3, mm6)\ AS2( movq mm4, [X+0*8])\ AS2( psubq mm4, mm3)\ AS2( movq [Y+0*8], mm4)\ AS2( pxor mm4, [X+1*8])\ AS2( movq mm3, mm4)\ AS2( movq [Y+1*8], mm4)\ AS2( paddq mm4, [X+2*8])\ AS2( pxor mm3, mm7)\ AS2( psllq mm3, 19)\ AS2( movq [Y+2*8], mm4)\ AS2( pxor mm3, mm4)\ AS2( movq mm4, [X+3*8])\ AS2( psubq mm4, mm3)\ AS2( movq [Y+3*8], mm4)\ AS2( pxor mm4, [X+4*8])\ AS2( movq mm3, mm4)\ AS2( movq [Y+4*8], mm4)\ AS2( paddq mm4, [X+5*8])\ AS2( pxor mm3, mm7)\ AS2( psrlq mm3, 23)\ AS2( movq [Y+5*8], mm4)\ AS2( pxor mm3, mm4)\ AS2( movq mm4, [X+6*8])\ AS2( psubq mm4, mm3)\ AS2( movq [Y+6*8], mm4)\ AS2( pxor mm4, [X+7*8])\ AS2( movq mm3, mm4)\ AS2( movq [Y+7*8], mm4)\ AS2( paddq mm4, [Y+0*8])\ AS2( pxor mm3, mm7)\ AS2( psllq mm3, 19)\ AS2( movq [Y+0*8], mm4)\ AS2( pxor mm3, mm4)\ AS2( movq mm4, [Y+1*8])\ AS2( psubq mm4, mm3)\ AS2( movq [Y+1*8], mm4)\ AS2( pxor mm4, [Y+2*8])\ AS2( movq mm3, mm4)\ AS2( movq [Y+2*8], mm4)\ AS2( paddq mm4, [Y+3*8])\ AS2( pxor mm3, mm7)\ AS2( psrlq mm3, 23)\ AS2( movq [Y+3*8], mm4)\ AS2( pxor mm3, mm4)\ AS2( movq mm4, [Y+4*8])\ AS2( psubq mm4, mm3)\ AS2( movq [Y+4*8], mm4)\ AS2( pxor mm4, [Y+5*8])\ AS2( movq [Y+5*8], mm4)\ AS2( paddq mm4, [Y+6*8])\ AS2( movq [Y+6*8], mm4)\ AS2( pxor mm4, [edx+4*2048+2*8])\ AS2( movq mm3, [Y+7*8])\ AS2( psubq mm3, mm4)\ AS2( movq [Y+7*8], mm3) SSE2_pass(mm0, mm1, mm2, 5, esi) SSE2_key_schedule(esp+4, esi) SSE2_pass(mm2, mm0, mm1, 7, esp+4) SSE2_key_schedule(esp+4, esp+4) SSE2_pass(mm1, mm2, mm0, 9, esp+4) AS2( pxor mm0, [eax+0*8]) AS2( movq [eax+0*8], mm0) AS2( psubq mm1, mm5) AS2( movq [eax+1*8], mm1) AS2( paddq mm2, [eax+2*8]) AS2( movq [eax+2*8], mm2) AS1( pop esp) AS1( emms) #ifdef __GNUC__ AS1( pop ebx) ".att_syntax prefix;" : : "a" (digest), "S" (X), "d" (table) : "%ecx", "%edi", "memory", "cc" ); #endif } else #endif { word64 a = digest[0]; word64 b = digest[1]; word64 c = digest[2]; word64 Y[8]; #define t1 (table) #define t2 (table+256) #define t3 (table+256*2) #define t4 (table+256*3) #define round(a,b,c,x,mul) \ c ^= x; \ a -= t1[GETBYTE(c,0)] ^ t2[GETBYTE(c,2)] ^ t3[GETBYTE(c,4)] ^ t4[GETBYTE(c,6)]; \ b += t4[GETBYTE(c,1)] ^ t3[GETBYTE(c,3)] ^ t2[GETBYTE(c,5)] ^ t1[GETBYTE(c,7)]; \ b *= mul #define pass(a,b,c,mul,X) {\ int i=0;\ while (true)\ {\ round(a,b,c,X[i+0],mul); \ round(b,c,a,X[i+1],mul); \ if (i==6)\ break;\ round(c,a,b,X[i+2],mul); \ i+=3;\ }} #define key_schedule(Y,X) \ Y[0] = X[0] - (X[7]^W64LIT(0xA5A5A5A5A5A5A5A5)); \ Y[1] = X[1] ^ Y[0]; \ Y[2] = X[2] + Y[1]; \ Y[3] = X[3] - (Y[2] ^ ((~Y[1])<<19)); \ Y[4] = X[4] ^ Y[3]; \ Y[5] = X[5] + Y[4]; \ Y[6] = X[6] - (Y[5] ^ ((~Y[4])>>23)); \ Y[7] = X[7] ^ Y[6]; \ Y[0] += Y[7]; \ Y[1] -= Y[0] ^ ((~Y[7])<<19); \ Y[2] ^= Y[1]; \ Y[3] += Y[2]; \ Y[4] -= Y[3] ^ ((~Y[2])>>23); \ Y[5] ^= Y[4]; \ Y[6] += Y[5]; \ Y[7] -= Y[6] ^ W64LIT(0x0123456789ABCDEF) pass(a,b,c,5,X); key_schedule(Y,X); pass(c,a,b,7,Y); key_schedule(Y,Y); pass(b,c,a,9,Y); digest[0] = a ^ digest[0]; digest[1] = b - digest[1]; digest[2] = c + digest[2]; } } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/cryptest.sln0000755000000000000000000001474012414772654020177 0ustar rootrootMicrosoft Visual Studio Solution File, Format Version 12.00 # Visual Studio Express 2012 for Windows Desktop Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "cryptopp", "cryptdll.vcxproj", "{EBD86293-69A9-456B-B814-916E12AA9BBF}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "cryptest", "cryptest.vcxproj", "{9EAFA456-89B4-4879-AD4F-C2C341184CF5}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "cryptlib", "cryptlib.vcxproj", "{3423EC9A-52E4-4A4D-9753-EDEBC38785EF}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "dlltest", "dlltest.vcxproj", "{A7483CE8-2784-46CE-8CB8-8C0C1D27E232}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Debug|x64 = Debug|x64 DLL-Import Debug|Win32 = DLL-Import Debug|Win32 DLL-Import Debug|x64 = DLL-Import Debug|x64 DLL-Import Release|Win32 = DLL-Import Release|Win32 DLL-Import Release|x64 = DLL-Import Release|x64 Release|Win32 = Release|Win32 Release|x64 = Release|x64 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {EBD86293-69A9-456B-B814-916E12AA9BBF}.Debug|Win32.ActiveCfg = Debug|Win32 {EBD86293-69A9-456B-B814-916E12AA9BBF}.Debug|Win32.Build.0 = Debug|Win32 {EBD86293-69A9-456B-B814-916E12AA9BBF}.Debug|x64.ActiveCfg = Debug|x64 {EBD86293-69A9-456B-B814-916E12AA9BBF}.Debug|x64.Build.0 = Debug|x64 {EBD86293-69A9-456B-B814-916E12AA9BBF}.DLL-Import Debug|Win32.ActiveCfg = Debug|Win32 {EBD86293-69A9-456B-B814-916E12AA9BBF}.DLL-Import Debug|Win32.Build.0 = Debug|Win32 {EBD86293-69A9-456B-B814-916E12AA9BBF}.DLL-Import Debug|x64.ActiveCfg = Debug|x64 {EBD86293-69A9-456B-B814-916E12AA9BBF}.DLL-Import Debug|x64.Build.0 = Debug|x64 {EBD86293-69A9-456B-B814-916E12AA9BBF}.DLL-Import Release|Win32.ActiveCfg = Release|Win32 {EBD86293-69A9-456B-B814-916E12AA9BBF}.DLL-Import Release|Win32.Build.0 = Release|Win32 {EBD86293-69A9-456B-B814-916E12AA9BBF}.DLL-Import Release|x64.ActiveCfg = Release|x64 {EBD86293-69A9-456B-B814-916E12AA9BBF}.DLL-Import Release|x64.Build.0 = Release|x64 {EBD86293-69A9-456B-B814-916E12AA9BBF}.Release|Win32.ActiveCfg = Release|Win32 {EBD86293-69A9-456B-B814-916E12AA9BBF}.Release|Win32.Build.0 = Release|Win32 {EBD86293-69A9-456B-B814-916E12AA9BBF}.Release|x64.ActiveCfg = Release|x64 {EBD86293-69A9-456B-B814-916E12AA9BBF}.Release|x64.Build.0 = Release|x64 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.Debug|Win32.ActiveCfg = Debug|Win32 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.Debug|Win32.Build.0 = Debug|Win32 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.Debug|x64.ActiveCfg = Debug|x64 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.Debug|x64.Build.0 = Debug|x64 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.DLL-Import Debug|Win32.ActiveCfg = DLL-Import Debug|Win32 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.DLL-Import Debug|Win32.Build.0 = DLL-Import Debug|Win32 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.DLL-Import Debug|x64.ActiveCfg = DLL-Import Debug|x64 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.DLL-Import Debug|x64.Build.0 = DLL-Import Debug|x64 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.DLL-Import Release|Win32.ActiveCfg = DLL-Import Release|Win32 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.DLL-Import Release|Win32.Build.0 = DLL-Import Release|Win32 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.DLL-Import Release|x64.ActiveCfg = DLL-Import Release|x64 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.DLL-Import Release|x64.Build.0 = DLL-Import Release|x64 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.Release|Win32.ActiveCfg = Release|Win32 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.Release|Win32.Build.0 = Release|Win32 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.Release|x64.ActiveCfg = Release|x64 {9EAFA456-89B4-4879-AD4F-C2C341184CF5}.Release|x64.Build.0 = Release|x64 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.Debug|Win32.ActiveCfg = Debug|Win32 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.Debug|Win32.Build.0 = Debug|Win32 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.Debug|x64.ActiveCfg = Debug|x64 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.Debug|x64.Build.0 = Debug|x64 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.DLL-Import Debug|Win32.ActiveCfg = DLL-Import Debug|Win32 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.DLL-Import Debug|Win32.Build.0 = DLL-Import Debug|Win32 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.DLL-Import Debug|x64.ActiveCfg = DLL-Import Debug|x64 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.DLL-Import Debug|x64.Build.0 = DLL-Import Debug|x64 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.DLL-Import Release|Win32.ActiveCfg = DLL-Import Release|Win32 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.DLL-Import Release|Win32.Build.0 = DLL-Import Release|Win32 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.DLL-Import Release|x64.ActiveCfg = DLL-Import Release|x64 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.DLL-Import Release|x64.Build.0 = DLL-Import Release|x64 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.Release|Win32.ActiveCfg = Release|Win32 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.Release|Win32.Build.0 = Release|Win32 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.Release|x64.ActiveCfg = Release|x64 {3423EC9A-52E4-4A4D-9753-EDEBC38785EF}.Release|x64.Build.0 = Release|x64 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.Debug|Win32.ActiveCfg = Debug|Win32 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.Debug|Win32.Build.0 = Debug|Win32 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.Debug|x64.ActiveCfg = Debug|x64 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.Debug|x64.Build.0 = Debug|x64 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.DLL-Import Debug|Win32.ActiveCfg = Debug|Win32 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.DLL-Import Debug|Win32.Build.0 = Debug|Win32 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.DLL-Import Debug|x64.ActiveCfg = Debug|x64 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.DLL-Import Debug|x64.Build.0 = Debug|x64 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.DLL-Import Release|Win32.ActiveCfg = Release|Win32 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.DLL-Import Release|Win32.Build.0 = Release|Win32 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.DLL-Import Release|x64.ActiveCfg = Release|x64 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.DLL-Import Release|x64.Build.0 = Release|x64 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.Release|Win32.ActiveCfg = Release|Win32 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.Release|Win32.Build.0 = Release|Win32 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.Release|x64.ActiveCfg = Release|x64 {A7483CE8-2784-46CE-8CB8-8C0C1D27E232}.Release|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal armory-0.92.3/cppForSwig/cryptopp/cbcmac.cpp0000755000000000000000000000232512414772654017514 0ustar rootroot#include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "cbcmac.h" NAMESPACE_BEGIN(CryptoPP) void CBC_MAC_Base::UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms) { AccessCipher().SetKey(key, length, params); m_reg.CleanNew(AccessCipher().BlockSize()); m_counter = 0; } void CBC_MAC_Base::Update(const byte *input, size_t length) { unsigned int blockSize = AccessCipher().BlockSize(); while (m_counter && length) { m_reg[m_counter++] ^= *input++; if (m_counter == blockSize) ProcessBuf(); length--; } if (length >= blockSize) { size_t leftOver = AccessCipher().AdvancedProcessBlocks(m_reg, input, m_reg, length, BlockTransformation::BT_DontIncrementInOutPointers|BlockTransformation::BT_XorInput); input += (length - leftOver); length = leftOver; } while (length--) { m_reg[m_counter++] ^= *input++; if (m_counter == blockSize) ProcessBuf(); } } void CBC_MAC_Base::TruncatedFinal(byte *mac, size_t size) { ThrowIfInvalidTruncatedSize(size); if (m_counter) ProcessBuf(); memcpy(mac, m_reg, size); memset(m_reg, 0, AccessCipher().BlockSize()); } void CBC_MAC_Base::ProcessBuf() { AccessCipher().ProcessBlock(m_reg); m_counter = 0; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/simple.h0000755000000000000000000001574612414772654017255 0ustar rootroot// simple.h - written and placed in the public domain by Wei Dai /*! \file Simple non-interface classes derived from classes in cryptlib.h. */ #ifndef CRYPTOPP_SIMPLE_H #define CRYPTOPP_SIMPLE_H #include "cryptlib.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) //! _ template class CRYPTOPP_NO_VTABLE ClonableImpl : public BASE { public: Clonable * Clone() const {return new DERIVED(*static_cast(this));} }; //! _ template class CRYPTOPP_NO_VTABLE AlgorithmImpl : public BASE { public: static std::string CRYPTOPP_API StaticAlgorithmName() {return ALGORITHM_INFO::StaticAlgorithmName();} std::string AlgorithmName() const {return ALGORITHM_INFO::StaticAlgorithmName();} }; //! _ class CRYPTOPP_DLL InvalidKeyLength : public InvalidArgument { public: explicit InvalidKeyLength(const std::string &algorithm, size_t length) : InvalidArgument(algorithm + ": " + IntToString(length) + " is not a valid key length") {} }; //! _ class CRYPTOPP_DLL InvalidRounds : public InvalidArgument { public: explicit InvalidRounds(const std::string &algorithm, unsigned int rounds) : InvalidArgument(algorithm + ": " + IntToString(rounds) + " is not a valid number of rounds") {} }; // ***************************** //! _ template class CRYPTOPP_NO_VTABLE Bufferless : public T { public: bool IsolatedFlush(bool hardFlush, bool blocking) {return false;} }; //! _ template class CRYPTOPP_NO_VTABLE Unflushable : public T { public: bool Flush(bool completeFlush, int propagation=-1, bool blocking=true) {return ChannelFlush(DEFAULT_CHANNEL, completeFlush, propagation, blocking);} bool IsolatedFlush(bool hardFlush, bool blocking) {assert(false); return false;} bool ChannelFlush(const std::string &channel, bool hardFlush, int propagation=-1, bool blocking=true) { if (hardFlush && !InputBufferIsEmpty()) throw CannotFlush("Unflushable: this object has buffered input that cannot be flushed"); else { BufferedTransformation *attached = this->AttachedTransformation(); return attached && propagation ? attached->ChannelFlush(channel, hardFlush, propagation-1, blocking) : false; } } protected: virtual bool InputBufferIsEmpty() const {return false;} }; //! _ template class CRYPTOPP_NO_VTABLE InputRejecting : public T { public: struct InputRejected : public NotImplemented {InputRejected() : NotImplemented("BufferedTransformation: this object doesn't allow input") {}}; // shouldn't be calling these functions on this class size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking) {throw InputRejected();} bool IsolatedFlush(bool, bool) {return false;} bool IsolatedMessageSeriesEnd(bool) {throw InputRejected();} size_t ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking) {throw InputRejected();} bool ChannelMessageSeriesEnd(const std::string &, int, bool) {throw InputRejected();} }; //! _ template class CRYPTOPP_NO_VTABLE CustomFlushPropagation : public T { public: virtual bool Flush(bool hardFlush, int propagation=-1, bool blocking=true) =0; private: bool IsolatedFlush(bool hardFlush, bool blocking) {assert(false); return false;} }; //! _ template class CRYPTOPP_NO_VTABLE CustomSignalPropagation : public CustomFlushPropagation { public: virtual void Initialize(const NameValuePairs ¶meters=g_nullNameValuePairs, int propagation=-1) =0; private: void IsolatedInitialize(const NameValuePairs ¶meters) {assert(false);} }; //! _ template class CRYPTOPP_NO_VTABLE Multichannel : public CustomFlushPropagation { public: bool Flush(bool hardFlush, int propagation=-1, bool blocking=true) {return this->ChannelFlush(DEFAULT_CHANNEL, hardFlush, propagation, blocking);} bool MessageSeriesEnd(int propagation=-1, bool blocking=true) {return this->ChannelMessageSeriesEnd(DEFAULT_CHANNEL, propagation, blocking);} byte * CreatePutSpace(size_t &size) {return this->ChannelCreatePutSpace(DEFAULT_CHANNEL, size);} size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking) {return this->ChannelPut2(DEFAULT_CHANNEL, begin, length, messageEnd, blocking);} size_t PutModifiable2(byte *inString, size_t length, int messageEnd, bool blocking) {return this->ChannelPutModifiable2(DEFAULT_CHANNEL, inString, length, messageEnd, blocking);} // void ChannelMessageSeriesEnd(const std::string &channel, int propagation=-1) // {PropagateMessageSeriesEnd(propagation, channel);} byte * ChannelCreatePutSpace(const std::string &channel, size_t &size) {size = 0; return NULL;} bool ChannelPutModifiable(const std::string &channel, byte *inString, size_t length) {this->ChannelPut(channel, inString, length); return false;} virtual size_t ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking) =0; size_t ChannelPutModifiable2(const std::string &channel, byte *begin, size_t length, int messageEnd, bool blocking) {return ChannelPut2(channel, begin, length, messageEnd, blocking);} virtual bool ChannelFlush(const std::string &channel, bool hardFlush, int propagation=-1, bool blocking=true) =0; }; //! _ template class CRYPTOPP_NO_VTABLE AutoSignaling : public T { public: AutoSignaling(int propagation=-1) : m_autoSignalPropagation(propagation) {} void SetAutoSignalPropagation(int propagation) {m_autoSignalPropagation = propagation;} int GetAutoSignalPropagation() const {return m_autoSignalPropagation;} private: int m_autoSignalPropagation; }; //! A BufferedTransformation that only contains pre-existing data as "output" class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Store : public AutoSignaling > { public: Store() : m_messageEnd(false) {} void IsolatedInitialize(const NameValuePairs ¶meters) { m_messageEnd = false; StoreInitialize(parameters); } unsigned int NumberOfMessages() const {return m_messageEnd ? 0 : 1;} bool GetNextMessage(); unsigned int CopyMessagesTo(BufferedTransformation &target, unsigned int count=UINT_MAX, const std::string &channel=DEFAULT_CHANNEL) const; protected: virtual void StoreInitialize(const NameValuePairs ¶meters) =0; bool m_messageEnd; }; //! A BufferedTransformation that doesn't produce any retrievable output class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Sink : public BufferedTransformation { public: size_t TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) {transferBytes = 0; return 0;} size_t CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) const {return 0;} }; class CRYPTOPP_DLL BitBucket : public Bufferless { public: std::string AlgorithmName() const {return "BitBucket";} void IsolatedInitialize(const NameValuePairs ¶meters) {} size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking) {return 0;} }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/hrtimer.cpp0000755000000000000000000000647112414772654017764 0ustar rootroot// hrtimer.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "hrtimer.h" #include "misc.h" #include // for NULL #include #if defined(CRYPTOPP_WIN32_AVAILABLE) #include #elif defined(CRYPTOPP_UNIX_AVAILABLE) #include #include #include #endif #include NAMESPACE_BEGIN(CryptoPP) #ifndef CRYPTOPP_IMPORTS double TimerBase::ConvertTo(TimerWord t, Unit unit) { static unsigned long unitsPerSecondTable[] = {1, 1000, 1000*1000, 1000*1000*1000}; assert(unit < sizeof(unitsPerSecondTable) / sizeof(unitsPerSecondTable[0])); return (double)CRYPTOPP_VC6_INT64 t * unitsPerSecondTable[unit] / CRYPTOPP_VC6_INT64 TicksPerSecond(); } void TimerBase::StartTimer() { m_last = m_start = GetCurrentTimerValue(); m_started = true; } double TimerBase::ElapsedTimeAsDouble() { if (m_stuckAtZero) return 0; if (m_started) { TimerWord now = GetCurrentTimerValue(); if (m_last < now) // protect against OS bugs where time goes backwards m_last = now; return ConvertTo(m_last - m_start, m_timerUnit); } StartTimer(); return 0; } unsigned long TimerBase::ElapsedTime() { double elapsed = ElapsedTimeAsDouble(); assert(elapsed <= ULONG_MAX); return (unsigned long)elapsed; } TimerWord Timer::GetCurrentTimerValue() { #if defined(CRYPTOPP_WIN32_AVAILABLE) LARGE_INTEGER now; if (!QueryPerformanceCounter(&now)) throw Exception(Exception::OTHER_ERROR, "Timer: QueryPerformanceCounter failed with error " + IntToString(GetLastError())); return now.QuadPart; #elif defined(CRYPTOPP_UNIX_AVAILABLE) timeval now; gettimeofday(&now, NULL); return (TimerWord)now.tv_sec * 1000000 + now.tv_usec; #else clock_t now; return clock(); #endif } TimerWord Timer::TicksPerSecond() { #if defined(CRYPTOPP_WIN32_AVAILABLE) static LARGE_INTEGER freq = {0}; if (freq.QuadPart == 0) { if (!QueryPerformanceFrequency(&freq)) throw Exception(Exception::OTHER_ERROR, "Timer: QueryPerformanceFrequency failed with error " + IntToString(GetLastError())); } return freq.QuadPart; #elif defined(CRYPTOPP_UNIX_AVAILABLE) return 1000000; #else return CLOCKS_PER_SEC; #endif } #endif // #ifndef CRYPTOPP_IMPORTS TimerWord ThreadUserTimer::GetCurrentTimerValue() { #if defined(CRYPTOPP_WIN32_AVAILABLE) static bool getCurrentThreadImplemented = true; if (getCurrentThreadImplemented) { FILETIME now, ignored; if (!GetThreadTimes(GetCurrentThread(), &ignored, &ignored, &ignored, &now)) { DWORD lastError = GetLastError(); if (lastError == ERROR_CALL_NOT_IMPLEMENTED) { getCurrentThreadImplemented = false; goto GetCurrentThreadNotImplemented; } throw Exception(Exception::OTHER_ERROR, "ThreadUserTimer: GetThreadTimes failed with error " + IntToString(lastError)); } return now.dwLowDateTime + ((TimerWord)now.dwHighDateTime << 32); } GetCurrentThreadNotImplemented: return (TimerWord)clock() * (10*1000*1000 / CLOCKS_PER_SEC); #elif defined(CRYPTOPP_UNIX_AVAILABLE) tms now; times(&now); return now.tms_utime; #else return clock(); #endif } TimerWord ThreadUserTimer::TicksPerSecond() { #if defined(CRYPTOPP_WIN32_AVAILABLE) return 10*1000*1000; #elif defined(CRYPTOPP_UNIX_AVAILABLE) static const long ticksPerSecond = sysconf(_SC_CLK_TCK); return ticksPerSecond; #else return CLOCKS_PER_SEC; #endif } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/hmac.cpp0000755000000000000000000000340312414772654017212 0ustar rootroot// hmac.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "hmac.h" NAMESPACE_BEGIN(CryptoPP) void HMAC_Base::UncheckedSetKey(const byte *userKey, unsigned int keylength, const NameValuePairs &) { AssertValidKeyLength(keylength); Restart(); HashTransformation &hash = AccessHash(); unsigned int blockSize = hash.BlockSize(); if (!blockSize) throw InvalidArgument("HMAC: can only be used with a block-based hash function"); m_buf.resize(2*AccessHash().BlockSize() + AccessHash().DigestSize()); if (keylength <= blockSize) memcpy(AccessIpad(), userKey, keylength); else { AccessHash().CalculateDigest(AccessIpad(), userKey, keylength); keylength = hash.DigestSize(); } assert(keylength <= blockSize); memset(AccessIpad()+keylength, 0, blockSize-keylength); for (unsigned int i=0; i #endif #define VMAC_BOOL_WORD128 (defined(CRYPTOPP_WORD128_AVAILABLE) && !defined(CRYPTOPP_X64_ASM_AVAILABLE)) #ifdef __BORLANDC__ #define const // Turbo C++ 2006 workaround #endif static const word64 p64 = W64LIT(0xfffffffffffffeff); /* 2^64 - 257 prime */ static const word64 m62 = W64LIT(0x3fffffffffffffff); /* 62-bit mask */ static const word64 m63 = W64LIT(0x7fffffffffffffff); /* 63-bit mask */ static const word64 m64 = W64LIT(0xffffffffffffffff); /* 64-bit mask */ static const word64 mpoly = W64LIT(0x1fffffff1fffffff); /* Poly key mask */ #ifdef __BORLANDC__ #undef const #endif #if VMAC_BOOL_WORD128 #ifdef __powerpc__ // workaround GCC Bug 31690: ICE with const __uint128_t and C++ front-end #define m126 ((word128(m62)<<64)|m64) #else static const word128 m126 = (word128(m62)<<64)|m64; /* 126-bit mask */ #endif #endif void VMAC_Base::UncheckedSetKey(const byte *userKey, unsigned int keylength, const NameValuePairs ¶ms) { int digestLength = params.GetIntValueWithDefault(Name::DigestSize(), DefaultDigestSize()); if (digestLength != 8 && digestLength != 16) throw InvalidArgument("VMAC: DigestSize must be 8 or 16"); m_is128 = digestLength == 16; m_L1KeyLength = params.GetIntValueWithDefault(Name::L1KeyLength(), 128); if (m_L1KeyLength <= 0 || m_L1KeyLength % 128 != 0) throw InvalidArgument("VMAC: L1KeyLength must be a positive multiple of 128"); AllocateBlocks(); BlockCipher &cipher = AccessCipher(); cipher.SetKey(userKey, keylength, params); unsigned int blockSize = cipher.BlockSize(); unsigned int blockSizeInWords = blockSize / sizeof(word64); SecBlock out(blockSizeInWords); SecByteBlock in; in.CleanNew(blockSize); size_t i; /* Fill nh key */ in[0] = 0x80; cipher.AdvancedProcessBlocks(in, NULL, (byte *)m_nhKey(), m_nhKeySize()*sizeof(word64), cipher.BT_InBlockIsCounter); ConditionalByteReverse(BIG_ENDIAN_ORDER, m_nhKey(), m_nhKey(), m_nhKeySize()*sizeof(word64)); /* Fill poly key */ in[0] = 0xC0; in[15] = 0; for (i = 0; i <= (size_t)m_is128; i++) { cipher.ProcessBlock(in, out.BytePtr()); m_polyState()[i*4+2] = GetWord(true, BIG_ENDIAN_ORDER, out.BytePtr()) & mpoly; m_polyState()[i*4+3] = GetWord(true, BIG_ENDIAN_ORDER, out.BytePtr()+8) & mpoly; in[15]++; } /* Fill ip key */ in[0] = 0xE0; in[15] = 0; word64 *l3Key = m_l3Key(); for (i = 0; i <= (size_t)m_is128; i++) do { cipher.ProcessBlock(in, out.BytePtr()); l3Key[i*2+0] = GetWord(true, BIG_ENDIAN_ORDER, out.BytePtr()); l3Key[i*2+1] = GetWord(true, BIG_ENDIAN_ORDER, out.BytePtr()+8); in[15]++; } while ((l3Key[i*2+0] >= p64) || (l3Key[i*2+1] >= p64)); m_padCached = false; size_t nonceLength; const byte *nonce = GetIVAndThrowIfInvalid(params, nonceLength); Resynchronize(nonce, (int)nonceLength); } void VMAC_Base::GetNextIV(RandomNumberGenerator &rng, byte *IV) { SimpleKeyingInterface::GetNextIV(rng, IV); IV[0] &= 0x7f; } void VMAC_Base::Resynchronize(const byte *nonce, int len) { size_t length = ThrowIfInvalidIVLength(len); size_t s = IVSize(); byte *storedNonce = m_nonce(); if (m_is128) { memset(storedNonce, 0, s-length); memcpy(storedNonce+s-length, nonce, length); AccessCipher().ProcessBlock(storedNonce, m_pad()); } else { if (m_padCached && (storedNonce[s-1] | 1) == (nonce[length-1] | 1)) { m_padCached = VerifyBufsEqual(storedNonce+s-length, nonce, length-1); for (size_t i=0; m_padCached && i>64); rl = word64(p);} #define AccumulateNH(a, b, c) a += word128(b)*(c) #define Multiply128(r, i1, i2) r = word128(word64(i1)) * word64(i2) #else #if _MSC_VER >= 1400 && !defined(__INTEL_COMPILER) #define MUL32(a, b) __emulu(word32(a), word32(b)) #else #define MUL32(a, b) ((word64)((word32)(a)) * (word32)(b)) #endif #if defined(CRYPTOPP_X64_ASM_AVAILABLE) #define DeclareNH(a) word64 a##0=0, a##1=0 #define MUL64(rh,rl,i1,i2) asm ("mulq %3" : "=a"(rl), "=d"(rh) : "a"(i1), "g"(i2) : "cc"); #define AccumulateNH(a, b, c) asm ("mulq %3; addq %%rax, %0; adcq %%rdx, %1" : "+r"(a##0), "+r"(a##1) : "a"(b), "g"(c) : "%rdx", "cc"); #define ADD128(rh,rl,ih,il) asm ("addq %3, %1; adcq %2, %0" : "+r"(rh),"+r"(rl) : "r"(ih),"r"(il) : "cc"); #elif defined(_MSC_VER) && !CRYPTOPP_BOOL_SLOW_WORD64 #define DeclareNH(a) word64 a##0=0, a##1=0 #define MUL64(rh,rl,i1,i2) (rl) = _umul128(i1,i2,&(rh)); #define AccumulateNH(a, b, c) {\ word64 ph, pl;\ pl = _umul128(b,c,&ph);\ a##0 += pl;\ a##1 += ph + (a##0 < pl);} #else #define VMAC_BOOL_32BIT 1 #define DeclareNH(a) word64 a##0=0, a##1=0, a##2=0 #define MUL64(rh,rl,i1,i2) \ { word64 _i1 = (i1), _i2 = (i2); \ word64 m1= MUL32(_i1,_i2>>32); \ word64 m2= MUL32(_i1>>32,_i2); \ rh = MUL32(_i1>>32,_i2>>32); \ rl = MUL32(_i1,_i2); \ ADD128(rh,rl,(m1 >> 32),(m1 << 32)); \ ADD128(rh,rl,(m2 >> 32),(m2 << 32)); \ } #define AccumulateNH(a, b, c) {\ word64 p = MUL32(b, c);\ a##1 += word32((p)>>32);\ a##0 += word32(p);\ p = MUL32((b)>>32, c);\ a##2 += word32((p)>>32);\ a##1 += word32(p);\ p = MUL32((b)>>32, (c)>>32);\ a##2 += p;\ p = MUL32(b, (c)>>32);\ a##1 += word32(p);\ a##2 += word32(p>>32);} #endif #endif #ifndef VMAC_BOOL_32BIT #define VMAC_BOOL_32BIT 0 #endif #ifndef ADD128 #define ADD128(rh,rl,ih,il) \ { word64 _il = (il); \ (rl) += (_il); \ (rh) += (ih) + ((rl) < (_il)); \ } #endif #if !(defined(_MSC_VER) && _MSC_VER < 1300) template #endif void VMAC_Base::VHASH_Update_Template(const word64 *data, size_t blocksRemainingInWord64) { #define INNER_LOOP_ITERATION(j) {\ word64 d0 = ConditionalByteReverse(LITTLE_ENDIAN_ORDER, data[i+2*j+0]);\ word64 d1 = ConditionalByteReverse(LITTLE_ENDIAN_ORDER, data[i+2*j+1]);\ AccumulateNH(nhA, d0+nhK[i+2*j+0], d1+nhK[i+2*j+1]);\ if (T_128BitTag)\ AccumulateNH(nhB, d0+nhK[i+2*j+2], d1+nhK[i+2*j+3]);\ } #if (defined(_MSC_VER) && _MSC_VER < 1300) bool T_128BitTag = m_is128; #endif size_t L1KeyLengthInWord64 = m_L1KeyLength / 8; size_t innerLoopEnd = L1KeyLengthInWord64; const word64 *nhK = m_nhKey(); word64 *polyS = m_polyState(); bool isFirstBlock = true; size_t i; #if !VMAC_BOOL_32BIT #if VMAC_BOOL_WORD128 word128 a1, a2; #else word64 ah1, al1, ah2, al2; #endif word64 kh1, kl1, kh2, kl2; kh1=(polyS+0*4+2)[0]; kl1=(polyS+0*4+2)[1]; if (T_128BitTag) { kh2=(polyS+1*4+2)[0]; kl2=(polyS+1*4+2)[1]; } #endif do { DeclareNH(nhA); DeclareNH(nhB); i = 0; if (blocksRemainingInWord64 < L1KeyLengthInWord64) { if (blocksRemainingInWord64 % 8) { innerLoopEnd = blocksRemainingInWord64 % 8; for (; i> 32); nh1[0] = word32(nhA1); nh2[0] = (nhA2 + (nhA1 >> 32)) & m62; if (T_128BitTag) { nh0[1] = word32(nhB0); nhB1 += (nhB0 >> 32); nh1[1] = word32(nhB1); nh2[1] = (nhB2 + (nhB1 >> 32)) & m62; } #define a0 (((word32 *)(polyS+i*4))[2+NativeByteOrder::ToEnum()]) #define a1 (*(((word32 *)(polyS+i*4))+3-NativeByteOrder::ToEnum())) // workaround for GCC 3.2 #define a2 (((word32 *)(polyS+i*4))[0+NativeByteOrder::ToEnum()]) #define a3 (*(((word32 *)(polyS+i*4))+1-NativeByteOrder::ToEnum())) #define aHi ((polyS+i*4)[0]) #define k0 (((word32 *)(polyS+i*4+2))[2+NativeByteOrder::ToEnum()]) #define k1 (*(((word32 *)(polyS+i*4+2))+3-NativeByteOrder::ToEnum())) #define k2 (((word32 *)(polyS+i*4+2))[0+NativeByteOrder::ToEnum()]) #define k3 (*(((word32 *)(polyS+i*4+2))+1-NativeByteOrder::ToEnum())) #define kHi ((polyS+i*4+2)[0]) if (isFirstBlock) { isFirstBlock = false; if (m_isFirstBlock) { m_isFirstBlock = false; for (i=0; i<=(size_t)T_128BitTag; i++) { word64 t = (word64)nh0[i] + k0; a0 = (word32)t; t = (t >> 32) + nh1[i] + k1; a1 = (word32)t; aHi = (t >> 32) + nh2[i] + kHi; } continue; } } for (i=0; i<=(size_t)T_128BitTag; i++) { word64 p, t; word32 t2; p = MUL32(a3, 2*k3); p += nh2[i]; p += MUL32(a0, k2); p += MUL32(a1, k1); p += MUL32(a2, k0); t2 = (word32)p; p >>= 32; p += MUL32(a0, k3); p += MUL32(a1, k2); p += MUL32(a2, k1); p += MUL32(a3, k0); t = (word64(word32(p) & 0x7fffffff) << 32) | t2; p >>= 31; p += nh0[i]; p += MUL32(a0, k0); p += MUL32(a1, 2*k3); p += MUL32(a2, 2*k2); p += MUL32(a3, 2*k1); t2 = (word32)p; p >>= 32; p += nh1[i]; p += MUL32(a0, k1); p += MUL32(a1, k0); p += MUL32(a2, 2*k3); p += MUL32(a3, 2*k2); a0 = t2; a1 = (word32)p; aHi = (p >> 32) + t; } #undef a0 #undef a1 #undef a2 #undef a3 #undef aHi #undef k0 #undef k1 #undef k2 #undef k3 #undef kHi #else // #if VMAC_BOOL_32BIT if (isFirstBlock) { isFirstBlock = false; if (m_isFirstBlock) { m_isFirstBlock = false; #if VMAC_BOOL_WORD128 #define first_poly_step(a, kh, kl, m) a = (m & m126) + ((word128(kh) << 64) | kl) first_poly_step(a1, kh1, kl1, nhA); if (T_128BitTag) first_poly_step(a2, kh2, kl2, nhB); #else #define first_poly_step(ah, al, kh, kl, mh, ml) {\ mh &= m62;\ ADD128(mh, ml, kh, kl); \ ah = mh; al = ml;} first_poly_step(ah1, al1, kh1, kl1, nhA1, nhA0); if (T_128BitTag) first_poly_step(ah2, al2, kh2, kl2, nhB1, nhB0); #endif continue; } else { #if VMAC_BOOL_WORD128 a1 = (word128((polyS+0*4)[0]) << 64) | (polyS+0*4)[1]; #else ah1=(polyS+0*4)[0]; al1=(polyS+0*4)[1]; #endif if (T_128BitTag) { #if VMAC_BOOL_WORD128 a2 = (word128((polyS+1*4)[0]) << 64) | (polyS+1*4)[1]; #else ah2=(polyS+1*4)[0]; al2=(polyS+1*4)[1]; #endif } } } #if VMAC_BOOL_WORD128 #define poly_step(a, kh, kl, m) \ { word128 t1, t2, t3, t4;\ Multiply128(t2, a>>64, kl);\ Multiply128(t3, a, kh);\ Multiply128(t1, a, kl);\ Multiply128(t4, a>>64, 2*kh);\ t2 += t3;\ t4 += t1;\ t2 += t4>>64;\ a = (word128(word64(t2)&m63) << 64) | word64(t4);\ t2 *= 2;\ a += m & m126;\ a += t2>>64;} poly_step(a1, kh1, kl1, nhA); if (T_128BitTag) poly_step(a2, kh2, kl2, nhB); #else #define poly_step(ah, al, kh, kl, mh, ml) \ { word64 t1h, t1l, t2h, t2l, t3h, t3l, z=0; \ /* compute ab*cd, put bd into result registers */ \ MUL64(t2h,t2l,ah,kl); \ MUL64(t3h,t3l,al,kh); \ MUL64(t1h,t1l,ah,2*kh); \ MUL64(ah,al,al,kl); \ /* add together ad + bc */ \ ADD128(t2h,t2l,t3h,t3l); \ /* add 2 * ac to result */ \ ADD128(ah,al,t1h,t1l); \ /* now (ah,al), (t2l,2*t2h) need summing */ \ /* first add the high registers, carrying into t2h */ \ ADD128(t2h,ah,z,t2l); \ /* double t2h and add top bit of ah */ \ t2h += t2h + (ah >> 63); \ ah &= m63; \ /* now add the low registers */ \ mh &= m62; \ ADD128(ah,al,mh,ml); \ ADD128(ah,al,z,t2h); \ } poly_step(ah1, al1, kh1, kl1, nhA1, nhA0); if (T_128BitTag) poly_step(ah2, al2, kh2, kl2, nhB1, nhB0); #endif #endif // #if VMAC_BOOL_32BIT } while (blocksRemainingInWord64); #if VMAC_BOOL_WORD128 (polyS+0*4)[0]=word64(a1>>64); (polyS+0*4)[1]=word64(a1); if (T_128BitTag) { (polyS+1*4)[0]=word64(a2>>64); (polyS+1*4)[1]=word64(a2); } #elif !VMAC_BOOL_32BIT (polyS+0*4)[0]=ah1; (polyS+0*4)[1]=al1; if (T_128BitTag) { (polyS+1*4)[0]=ah2; (polyS+1*4)[1]=al2; } #endif } inline void VMAC_Base::VHASH_Update(const word64 *data, size_t blocksRemainingInWord64) { #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE && CRYPTOPP_BOOL_X86 if (HasSSE2()) { VHASH_Update_SSE2(data, blocksRemainingInWord64, 0); if (m_is128) VHASH_Update_SSE2(data, blocksRemainingInWord64, 1); m_isFirstBlock = false; } else #endif { #if defined(_MSC_VER) && _MSC_VER < 1300 VHASH_Update_Template(data, blocksRemainingInWord64); #else if (m_is128) VHASH_Update_Template(data, blocksRemainingInWord64); else VHASH_Update_Template(data, blocksRemainingInWord64); #endif } } size_t VMAC_Base::HashMultipleBlocks(const word64 *data, size_t length) { size_t remaining = ModPowerOf2(length, m_L1KeyLength); VHASH_Update(data, (length-remaining)/8); return remaining; } static word64 L3Hash(const word64 *input, const word64 *l3Key, size_t len) { word64 rh, rl, t, z=0; word64 p1 = input[0], p2 = input[1]; word64 k1 = l3Key[0], k2 = l3Key[1]; /* fully reduce (p1,p2)+(len,0) mod p127 */ t = p1 >> 63; p1 &= m63; ADD128(p1, p2, len, t); /* At this point, (p1,p2) is at most 2^127+(len<<64) */ t = (p1 > m63) + ((p1 == m63) & (p2 == m64)); ADD128(p1, p2, z, t); p1 &= m63; /* compute (p1,p2)/(2^64-2^32) and (p1,p2)%(2^64-2^32) */ t = p1 + (p2 >> 32); t += (t >> 32); t += (word32)t > 0xfffffffeU; p1 += (t >> 32); p2 += (p1 << 32); /* compute (p1+k1)%p64 and (p2+k2)%p64 */ p1 += k1; p1 += (0 - (p1 < k1)) & 257; p2 += k2; p2 += (0 - (p2 < k2)) & 257; /* compute (p1+k1)*(p2+k2)%p64 */ MUL64(rh, rl, p1, p2); t = rh >> 56; ADD128(t, rl, z, rh); rh <<= 8; ADD128(t, rl, z, rh); t += t << 8; rl += t; rl += (0 - (rl < t)) & 257; rl += (0 - (rl > p64-1)) & 257; return rl; } void VMAC_Base::TruncatedFinal(byte *mac, size_t size) { size_t len = ModPowerOf2(GetBitCountLo()/8, m_L1KeyLength); if (len) { memset(m_data()+len, 0, (0-len)%16); VHASH_Update(DataBuf(), ((len+15)/16)*2); len *= 8; // convert to bits } else if (m_isFirstBlock) { // special case for empty string m_polyState()[0] = m_polyState()[2]; m_polyState()[1] = m_polyState()[3]; if (m_is128) { m_polyState()[4] = m_polyState()[6]; m_polyState()[5] = m_polyState()[7]; } } if (m_is128) { word64 t[2]; t[0] = L3Hash(m_polyState(), m_l3Key(), len) + GetWord(true, BIG_ENDIAN_ORDER, m_pad()); t[1] = L3Hash(m_polyState()+4, m_l3Key()+2, len) + GetWord(true, BIG_ENDIAN_ORDER, m_pad()+8); if (size == 16) { PutWord(false, BIG_ENDIAN_ORDER, mac, t[0]); PutWord(false, BIG_ENDIAN_ORDER, mac+8, t[1]); } else { t[0] = ConditionalByteReverse(BIG_ENDIAN_ORDER, t[0]); t[1] = ConditionalByteReverse(BIG_ENDIAN_ORDER, t[1]); memcpy(mac, t, size); } } else { word64 t = L3Hash(m_polyState(), m_l3Key(), len); t += GetWord(true, BIG_ENDIAN_ORDER, m_pad() + (m_nonce()[IVSize()-1]&1) * 8); if (size == 8) PutWord(false, BIG_ENDIAN_ORDER, mac, t); else { t = ConditionalByteReverse(BIG_ENDIAN_ORDER, t); memcpy(mac, &t, size); } } } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/cryptest.dsw0000755000000000000000000000242712414772654020177 0ustar rootrootMicrosoft Developer Studio Workspace File, Format Version 6.00 # WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE! ############################################################################### Project: "cryptdll"=.\cryptdll.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ Begin Project Dependency Project_Dep_Name cryptest End Project Dependency }}} ############################################################################### Project: "cryptest"=.\cryptest.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ Begin Project Dependency Project_Dep_Name cryptlib End Project Dependency }}} ############################################################################### Project: "cryptlib"=.\cryptlib.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ }}} ############################################################################### Project: "dlltest"=.\dlltest.dsp - Package Owner=<4> Package=<5> {{{ }}} Package=<4> {{{ Begin Project Dependency Project_Dep_Name cryptdll End Project Dependency }}} ############################################################################### Global: Package=<5> {{{ }}} Package=<3> {{{ }}} ############################################################################### armory-0.92.3/cppForSwig/cryptopp/adler32.h0000755000000000000000000000116412414772654017205 0ustar rootroot#ifndef CRYPTOPP_ADLER32_H #define CRYPTOPP_ADLER32_H #include "cryptlib.h" NAMESPACE_BEGIN(CryptoPP) //! ADLER-32 checksum calculations class Adler32 : public HashTransformation { public: CRYPTOPP_CONSTANT(DIGESTSIZE = 4) Adler32() {Reset();} void Update(const byte *input, size_t length); void TruncatedFinal(byte *hash, size_t size); unsigned int DigestSize() const {return DIGESTSIZE;} static const char * StaticAlgorithmName() {return "Adler32";} std::string AlgorithmName() const {return StaticAlgorithmName();} private: void Reset() {m_s1 = 1; m_s2 = 0;} word16 m_s1, m_s2; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/basecode.h0000755000000000000000000000500312414772654017512 0ustar rootroot#ifndef CRYPTOPP_BASECODE_H #define CRYPTOPP_BASECODE_H #include "filters.h" #include "algparam.h" #include "argnames.h" NAMESPACE_BEGIN(CryptoPP) //! base n encoder, where n is a power of 2 class CRYPTOPP_DLL BaseN_Encoder : public Unflushable { public: BaseN_Encoder(BufferedTransformation *attachment=NULL) {Detach(attachment);} BaseN_Encoder(const byte *alphabet, int log2base, BufferedTransformation *attachment=NULL, int padding=-1) { Detach(attachment); IsolatedInitialize(MakeParameters(Name::EncodingLookupArray(), alphabet) (Name::Log2Base(), log2base) (Name::Pad(), padding != -1) (Name::PaddingByte(), byte(padding))); } void IsolatedInitialize(const NameValuePairs ¶meters); size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking); private: const byte *m_alphabet; int m_padding, m_bitsPerChar, m_outputBlockSize; int m_bytePos, m_bitPos; SecByteBlock m_outBuf; }; //! base n decoder, where n is a power of 2 class CRYPTOPP_DLL BaseN_Decoder : public Unflushable { public: BaseN_Decoder(BufferedTransformation *attachment=NULL) {Detach(attachment);} BaseN_Decoder(const int *lookup, int log2base, BufferedTransformation *attachment=NULL) { Detach(attachment); IsolatedInitialize(MakeParameters(Name::DecodingLookupArray(), lookup)(Name::Log2Base(), log2base)); } void IsolatedInitialize(const NameValuePairs ¶meters); size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking); static void CRYPTOPP_API InitializeDecodingLookupArray(int *lookup, const byte *alphabet, unsigned int base, bool caseInsensitive); private: const int *m_lookup; int m_padding, m_bitsPerChar, m_outputBlockSize; int m_bytePos, m_bitPos; SecByteBlock m_outBuf; }; //! filter that breaks input stream into groups of fixed size class CRYPTOPP_DLL Grouper : public Bufferless { public: Grouper(BufferedTransformation *attachment=NULL) {Detach(attachment);} Grouper(int groupSize, const std::string &separator, const std::string &terminator, BufferedTransformation *attachment=NULL) { Detach(attachment); IsolatedInitialize(MakeParameters(Name::GroupSize(), groupSize) (Name::Separator(), ConstByteArrayParameter(separator)) (Name::Terminator(), ConstByteArrayParameter(terminator))); } void IsolatedInitialize(const NameValuePairs ¶meters); size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking); private: SecByteBlock m_separator, m_terminator; size_t m_groupSize, m_counter; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/lubyrack.h0000755000000000000000000000633712414772654017574 0ustar rootroot// lubyrack.h - written and placed in the public domain by Wei Dai #ifndef CRYPTOPP_LUBYRACK_H #define CRYPTOPP_LUBYRACK_H /** \file */ #include "simple.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) template struct DigestSizeDoubleWorkaround // VC60 workaround { CRYPTOPP_CONSTANT(RESULT = 2*T::DIGESTSIZE) }; //! algorithm info template struct LR_Info : public VariableKeyLength<16, 0, 2*(INT_MAX/2), 2>, public FixedBlockSize::RESULT> { static std::string StaticAlgorithmName() {return std::string("LR/")+T::StaticAlgorithmName();} }; //! Luby-Rackoff template class LR : public LR_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl > { public: // VC60 workaround: have to define these functions within class definition void UncheckedSetKey(const byte *userKey, unsigned int length, const NameValuePairs ¶ms) { this->AssertValidKeyLength(length); L = length/2; buffer.New(2*S); digest.New(S); key.Assign(userKey, 2*L); } protected: CRYPTOPP_CONSTANT(S=T::DIGESTSIZE) unsigned int L; // key length / 2 SecByteBlock key; mutable T hm; mutable SecByteBlock buffer, digest; }; class CRYPTOPP_NO_VTABLE Enc : public Base { public: #define KL this->key #define KR this->key+this->L #define BL this->buffer #define BR this->buffer+this->S #define IL inBlock #define IR inBlock+this->S #define OL outBlock #define OR outBlock+this->S void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { this->hm.Update(KL, this->L); this->hm.Update(IL, this->S); this->hm.Final(BR); xorbuf(BR, IR, this->S); this->hm.Update(KR, this->L); this->hm.Update(BR, this->S); this->hm.Final(BL); xorbuf(BL, IL, this->S); this->hm.Update(KL, this->L); this->hm.Update(BL, this->S); this->hm.Final(this->digest); xorbuf(BR, this->digest, this->S); this->hm.Update(KR, this->L); this->hm.Update(OR, this->S); this->hm.Final(this->digest); xorbuf(BL, this->digest, this->S); if (xorBlock) xorbuf(outBlock, xorBlock, this->buffer, 2*this->S); else memcpy_s(outBlock, 2*this->S, this->buffer, 2*this->S); } }; class CRYPTOPP_NO_VTABLE Dec : public Base { public: void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { this->hm.Update(KR, this->L); this->hm.Update(IR, this->S); this->hm.Final(BL); xorbuf(BL, IL, this->S); this->hm.Update(KL, this->L); this->hm.Update(BL, this->S); this->hm.Final(BR); xorbuf(BR, IR, this->S); this->hm.Update(KR, this->L); this->hm.Update(BR, this->S); this->hm.Final(this->digest); xorbuf(BL, this->digest, this->S); this->hm.Update(KL, this->L); this->hm.Update(OL, this->S); this->hm.Final(this->digest); xorbuf(BR, this->digest, this->S); if (xorBlock) xorbuf(outBlock, xorBlock, this->buffer, 2*this->S); else memcpy(outBlock, this->buffer, 2*this->S); } #undef KL #undef KR #undef BL #undef BR #undef IL #undef IR #undef OL #undef OR }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/seed.h0000755000000000000000000000157212414772654016674 0ustar rootroot#ifndef CRYPTOPP_SEED_H #define CRYPTOPP_SEED_H /** \file */ #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct SEED_Info : public FixedBlockSize<16>, public FixedKeyLength<16>, public FixedRounds<16> { static const char *StaticAlgorithmName() {return "SEED";} }; /// SEED class SEED : public SEED_Info, public BlockCipherDocumentation { class CRYPTOPP_NO_VTABLE Base : public BlockCipherImpl { public: void UncheckedSetKey(const byte *key, unsigned int length, const NameValuePairs ¶ms); void ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const; protected: FixedSizeSecBlock m_k; }; public: typedef BlockCipherFinal Encryption; typedef BlockCipherFinal Decryption; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/camellia.cpp0000755000000000000000000005070112414772654020054 0ustar rootroot// camellia.cpp - by Kevin Springle, 2003 // This code is hereby placed in the public domain. /* Optimisations and defense against timing attacks added in Jan 2007 by Wei Dai. The first 2 rounds and the last round seem especially vulnerable to timing attacks. The protection is similar to what was implemented for Rijndael. See comments at top of rijndael.cpp for more details. */ #include "pch.h" #include "camellia.h" #include "misc.h" #include "cpu.h" NAMESPACE_BEGIN(CryptoPP) // round implementation that uses a small table for protection against timing attacks #define SLOW_ROUND(lh, ll, rh, rl, kh, kl) { \ word32 zr = ll ^ kl; \ word32 zl = lh ^ kh; \ zr= rotlFixed(s1[GETBYTE(zr, 3)], 1) | \ (rotrFixed(s1[GETBYTE(zr, 2)], 1) << 24) | \ (s1[rotlFixed(CRYPTOPP_GET_BYTE_AS_BYTE(zr, 1),1)] << 16) | \ (s1[GETBYTE(zr, 0)] << 8); \ zl= (s1[GETBYTE(zl, 3)] << 24) | \ (rotlFixed(s1[GETBYTE(zl, 2)], 1) << 16) | \ (rotrFixed(s1[GETBYTE(zl, 1)], 1) << 8) | \ s1[rotlFixed(CRYPTOPP_GET_BYTE_AS_BYTE(zl, 0), 1)]; \ zl ^= zr; \ zr = zl ^ rotlFixed(zr, 8); \ zl = zr ^ rotrFixed(zl, 8); \ rh ^= rotlFixed(zr, 16); \ rh ^= zl; \ rl ^= rotlFixed(zl, 8); \ } // normal round - same output as above but using larger tables for faster speed #define ROUND(lh, ll, rh, rl, kh, kl) { \ word32 th = lh ^ kh; \ word32 tl = ll ^ kl; \ word32 d = SP[0][GETBYTE(tl,0)] ^ SP[1][GETBYTE(tl,3)] ^ SP[2][GETBYTE(tl,2)] ^ SP[3][GETBYTE(tl,1)]; \ word32 u = SP[0][GETBYTE(th,3)] ^ SP[1][GETBYTE(th,2)] ^ SP[2][GETBYTE(th,1)] ^ SP[3][GETBYTE(th,0)]; \ d ^= u; \ rh ^= d; \ rl ^= d; \ rl ^= rotrFixed(u, 8);} #define DOUBLE_ROUND(lh, ll, rh, rl, k0, k1, k2, k3) \ ROUND(lh, ll, rh, rl, k0, k1) \ ROUND(rh, rl, lh, ll, k2, k3) #ifdef IS_LITTLE_ENDIAN #define EFI(i) (1-(i)) #else #define EFI(i) (i) #endif void Camellia::Base::UncheckedSetKey(const byte *key, unsigned int keylen, const NameValuePairs &) { m_rounds = (keylen >= 24) ? 4 : 3; unsigned int kslen = (8 * m_rounds + 2); m_key.New(kslen*2); word32 *ks32 = m_key.data(); int m=0, a=0; if (!IsForwardTransformation()) m = -1, a = kslen-1; word32 kl0, kl1, kl2, kl3; GetBlock getBlock(key); getBlock(kl0)(kl1)(kl2)(kl3); word32 k0=kl0, k1=kl1, k2=kl2, k3=kl3; #define CALC_ADDR2(base, i, j) ((byte *)(base)+8*(i)+4*(j)+((-16*(i))&m)) #define CALC_ADDR(base, i) CALC_ADDR2(base, i, 0) #if 1 word64 kwl, kwr; ks32 += 2*a; #define PREPARE_KS_ROUNDS \ kwl = (word64(k0) << 32) | k1; \ kwr = (word64(k2) << 32) | k3 #define KS_ROUND_0(i) \ *(word64*)CALC_ADDR(ks32, i+EFI(0)) = kwl; \ *(word64*)CALC_ADDR(ks32, i+EFI(1)) = kwr #define KS_ROUND(i, r, which) \ if (which & (1<> (64 - (r%64))); \ if (which & (1<64))) *(word64*)CALC_ADDR(ks32, i+EFI(r>64)) = (kwl << (r%64)) | (kwr >> (64 - (r%64))) #else // SSE2 version is 30% faster on Intel Core 2. Doesn't seem worth the hassle of maintenance, but left here // #if'd out in case someone needs it. __m128i kw, kw2; __m128i *ks128 = (__m128i *)ks32+a/2; ks32 += 2*a; #define PREPARE_KS_ROUNDS \ kw = _mm_set_epi32(k0, k1, k2, k3); \ if (m) kw2 = kw, kw = _mm_shuffle_epi32(kw, _MM_SHUFFLE(1, 0, 3, 2)); \ else kw2 = _mm_shuffle_epi32(kw, _MM_SHUFFLE(1, 0, 3, 2)) #define KS_ROUND_0(i) \ _mm_store_si128((__m128i *)CALC_ADDR(ks128, i), kw) #define KS_ROUND(i, r, which) { \ __m128i temp; \ if (r<64 && (which!=1 || m)) temp = _mm_or_si128(_mm_slli_epi64(kw, r%64), _mm_srli_epi64(kw2, 64-r%64)); \ else temp = _mm_or_si128(_mm_slli_epi64(kw2, r%64), _mm_srli_epi64(kw, 64-r%64)); \ if (which & 2) _mm_store_si128((__m128i *)CALC_ADDR(ks128, i), temp); \ else _mm_storel_epi64((__m128i*)CALC_ADDR(ks32, i+EFI(0)), temp); \ } #endif if (keylen == 16) { // KL PREPARE_KS_ROUNDS; KS_ROUND_0(0); KS_ROUND(4, 15, 3); KS_ROUND(10, 45, 3); KS_ROUND(12, 60, 2); KS_ROUND(16, 77, 3); KS_ROUND(18, 94, 3); KS_ROUND(22, 111, 3); // KA k0=kl0, k1=kl1, k2=kl2, k3=kl3; DOUBLE_ROUND(k0, k1, k2, k3, 0xA09E667Ful, 0x3BCC908Bul, 0xB67AE858ul, 0x4CAA73B2ul); k0^=kl0, k1^=kl1, k2^=kl2, k3^=kl3; DOUBLE_ROUND(k0, k1, k2, k3, 0xC6EF372Ful, 0xE94F82BEul, 0x54FF53A5ul, 0xF1D36F1Cul); PREPARE_KS_ROUNDS; KS_ROUND_0(2); KS_ROUND(6, 15, 3); KS_ROUND(8, 30, 3); KS_ROUND(12, 45, 1); KS_ROUND(14, 60, 3); KS_ROUND(20, 94, 3); KS_ROUND(24, 47, 3); } else { // KL PREPARE_KS_ROUNDS; KS_ROUND_0(0); KS_ROUND(12, 45, 3); KS_ROUND(16, 60, 3); KS_ROUND(22, 77, 3); KS_ROUND(30, 111, 3); // KR word32 kr0, kr1, kr2, kr3; GetBlock(key+16)(kr0)(kr1); if (keylen == 24) kr2 = ~kr0, kr3 = ~kr1; else GetBlock(key+24)(kr2)(kr3); k0=kr0, k1=kr1, k2=kr2, k3=kr3; PREPARE_KS_ROUNDS; KS_ROUND(4, 15, 3); KS_ROUND(8, 30, 3); KS_ROUND(18, 60, 3); KS_ROUND(26, 94, 3); // KA k0^=kl0, k1^=kl1, k2^=kl2, k3^=kl3; DOUBLE_ROUND(k0, k1, k2, k3, 0xA09E667Ful, 0x3BCC908Bul, 0xB67AE858ul, 0x4CAA73B2ul); k0^=kl0, k1^=kl1, k2^=kl2, k3^=kl3; DOUBLE_ROUND(k0, k1, k2, k3, 0xC6EF372Ful, 0xE94F82BEul, 0x54FF53A5ul, 0xF1D36F1Cul); PREPARE_KS_ROUNDS; KS_ROUND(6, 15, 3); KS_ROUND(14, 45, 3); KS_ROUND(24, 77, 3); KS_ROUND(28, 94, 3); // KB k0^=kr0, k1^=kr1, k2^=kr2, k3^=kr3; DOUBLE_ROUND(k0, k1, k2, k3, 0x10E527FAul, 0xDE682D1Dul, 0xB05688C2ul, 0xB3E6C1FDul); PREPARE_KS_ROUNDS; KS_ROUND_0(2); KS_ROUND(10, 30, 3); KS_ROUND(20, 60, 3); KS_ROUND(32, 47, 3); } } void Camellia::Base::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { #define KS(i, j) ks[i*4 + EFI(j/2)*2 + EFI(j%2)] #define FL(klh, kll, krh, krl) \ ll ^= rotlFixed(lh & klh, 1); \ lh ^= (ll | kll); \ rh ^= (rl | krl); \ rl ^= rotlFixed(rh & krh, 1); word32 lh, ll, rh, rl; typedef BlockGetAndPut Block; Block::Get(inBlock)(lh)(ll)(rh)(rl); const word32 *ks = m_key.data(); lh ^= KS(0,0); ll ^= KS(0,1); rh ^= KS(0,2); rl ^= KS(0,3); // timing attack countermeasure. see comments at top for more details const int cacheLineSize = GetCacheLineSize(); unsigned int i; word32 u = 0; for (i=0; i<256; i+=cacheLineSize) u &= *(const word32 *)(s1+i); u &= *(const word32 *)(s1+252); lh |= u; ll |= u; SLOW_ROUND(lh, ll, rh, rl, KS(1,0), KS(1,1)) SLOW_ROUND(rh, rl, lh, ll, KS(1,2), KS(1,3)) for (i = m_rounds-1; i > 0; --i) { DOUBLE_ROUND(lh, ll, rh, rl, KS(2,0), KS(2,1), KS(2,2), KS(2,3)) DOUBLE_ROUND(lh, ll, rh, rl, KS(3,0), KS(3,1), KS(3,2), KS(3,3)) FL(KS(4,0), KS(4,1), KS(4,2), KS(4,3)); DOUBLE_ROUND(lh, ll, rh, rl, KS(5,0), KS(5,1), KS(5,2), KS(5,3)) ks += 16; } DOUBLE_ROUND(lh, ll, rh, rl, KS(2,0), KS(2,1), KS(2,2), KS(2,3)) ROUND(lh, ll, rh, rl, KS(3,0), KS(3,1)) SLOW_ROUND(rh, rl, lh, ll, KS(3,2), KS(3,3)) lh ^= KS(4,0); ll ^= KS(4,1); rh ^= KS(4,2); rl ^= KS(4,3); Block::Put(xorBlock, outBlock)(rh)(rl)(lh)(ll); } // The Camellia s-boxes const byte Camellia::Base::s1[256] = { 112,130,44,236,179,39,192,229,228,133,87,53,234,12,174,65, 35,239,107,147,69,25,165,33,237,14,79,78,29,101,146,189, 134,184,175,143,124,235,31,206,62,48,220,95,94,197,11,26, 166,225,57,202,213,71,93,61,217,1,90,214,81,86,108,77, 139,13,154,102,251,204,176,45,116,18,43,32,240,177,132,153, 223,76,203,194,52,126,118,5,109,183,169,49,209,23,4,215, 20,88,58,97,222,27,17,28,50,15,156,22,83,24,242,34, 254,68,207,178,195,181,122,145,36,8,232,168,96,252,105,80, 170,208,160,125,161,137,98,151,84,91,30,149,224,255,100,210, 16,196,0,72,163,247,117,219,138,3,230,218,9,63,221,148, 135,92,131,2,205,74,144,51,115,103,246,243,157,127,191,226, 82,155,216,38,200,55,198,59,129,150,111,75,19,190,99,46, 233,121,167,140,159,110,188,142,41,245,249,182,47,253,180,89, 120,152,6,106,231,70,113,186,212,37,171,66,136,162,141,250, 114,7,185,85,248,238,172,10,54,73,42,104,60,56,241,164, 64,40,211,123,187,201,67,193,21,227,173,244,119,199,128,158 }; const word32 Camellia::Base::SP[4][256] = { { 0x70707000, 0x82828200, 0x2c2c2c00, 0xececec00, 0xb3b3b300, 0x27272700, 0xc0c0c000, 0xe5e5e500, 0xe4e4e400, 0x85858500, 0x57575700, 0x35353500, 0xeaeaea00, 0x0c0c0c00, 0xaeaeae00, 0x41414100, 0x23232300, 0xefefef00, 0x6b6b6b00, 0x93939300, 0x45454500, 0x19191900, 0xa5a5a500, 0x21212100, 0xededed00, 0x0e0e0e00, 0x4f4f4f00, 0x4e4e4e00, 0x1d1d1d00, 0x65656500, 0x92929200, 0xbdbdbd00, 0x86868600, 0xb8b8b800, 0xafafaf00, 0x8f8f8f00, 0x7c7c7c00, 0xebebeb00, 0x1f1f1f00, 0xcecece00, 0x3e3e3e00, 0x30303000, 0xdcdcdc00, 0x5f5f5f00, 0x5e5e5e00, 0xc5c5c500, 0x0b0b0b00, 0x1a1a1a00, 0xa6a6a600, 0xe1e1e100, 0x39393900, 0xcacaca00, 0xd5d5d500, 0x47474700, 0x5d5d5d00, 0x3d3d3d00, 0xd9d9d900, 0x01010100, 0x5a5a5a00, 0xd6d6d600, 0x51515100, 0x56565600, 0x6c6c6c00, 0x4d4d4d00, 0x8b8b8b00, 0x0d0d0d00, 0x9a9a9a00, 0x66666600, 0xfbfbfb00, 0xcccccc00, 0xb0b0b000, 0x2d2d2d00, 0x74747400, 0x12121200, 0x2b2b2b00, 0x20202000, 0xf0f0f000, 0xb1b1b100, 0x84848400, 0x99999900, 0xdfdfdf00, 0x4c4c4c00, 0xcbcbcb00, 0xc2c2c200, 0x34343400, 0x7e7e7e00, 0x76767600, 0x05050500, 0x6d6d6d00, 0xb7b7b700, 0xa9a9a900, 0x31313100, 0xd1d1d100, 0x17171700, 0x04040400, 0xd7d7d700, 0x14141400, 0x58585800, 0x3a3a3a00, 0x61616100, 0xdedede00, 0x1b1b1b00, 0x11111100, 0x1c1c1c00, 0x32323200, 0x0f0f0f00, 0x9c9c9c00, 0x16161600, 0x53535300, 0x18181800, 0xf2f2f200, 0x22222200, 0xfefefe00, 0x44444400, 0xcfcfcf00, 0xb2b2b200, 0xc3c3c300, 0xb5b5b500, 0x7a7a7a00, 0x91919100, 0x24242400, 0x08080800, 0xe8e8e800, 0xa8a8a800, 0x60606000, 0xfcfcfc00, 0x69696900, 0x50505000, 0xaaaaaa00, 0xd0d0d000, 0xa0a0a000, 0x7d7d7d00, 0xa1a1a100, 0x89898900, 0x62626200, 0x97979700, 0x54545400, 0x5b5b5b00, 0x1e1e1e00, 0x95959500, 0xe0e0e000, 0xffffff00, 0x64646400, 0xd2d2d200, 0x10101000, 0xc4c4c400, 0x00000000, 0x48484800, 0xa3a3a300, 0xf7f7f700, 0x75757500, 0xdbdbdb00, 0x8a8a8a00, 0x03030300, 0xe6e6e600, 0xdadada00, 0x09090900, 0x3f3f3f00, 0xdddddd00, 0x94949400, 0x87878700, 0x5c5c5c00, 0x83838300, 0x02020200, 0xcdcdcd00, 0x4a4a4a00, 0x90909000, 0x33333300, 0x73737300, 0x67676700, 0xf6f6f600, 0xf3f3f300, 0x9d9d9d00, 0x7f7f7f00, 0xbfbfbf00, 0xe2e2e200, 0x52525200, 0x9b9b9b00, 0xd8d8d800, 0x26262600, 0xc8c8c800, 0x37373700, 0xc6c6c600, 0x3b3b3b00, 0x81818100, 0x96969600, 0x6f6f6f00, 0x4b4b4b00, 0x13131300, 0xbebebe00, 0x63636300, 0x2e2e2e00, 0xe9e9e900, 0x79797900, 0xa7a7a700, 0x8c8c8c00, 0x9f9f9f00, 0x6e6e6e00, 0xbcbcbc00, 0x8e8e8e00, 0x29292900, 0xf5f5f500, 0xf9f9f900, 0xb6b6b600, 0x2f2f2f00, 0xfdfdfd00, 0xb4b4b400, 0x59595900, 0x78787800, 0x98989800, 0x06060600, 0x6a6a6a00, 0xe7e7e700, 0x46464600, 0x71717100, 0xbababa00, 0xd4d4d400, 0x25252500, 0xababab00, 0x42424200, 0x88888800, 0xa2a2a200, 0x8d8d8d00, 0xfafafa00, 0x72727200, 0x07070700, 0xb9b9b900, 0x55555500, 0xf8f8f800, 0xeeeeee00, 0xacacac00, 0x0a0a0a00, 0x36363600, 0x49494900, 0x2a2a2a00, 0x68686800, 0x3c3c3c00, 0x38383800, 0xf1f1f100, 0xa4a4a400, 0x40404000, 0x28282800, 0xd3d3d300, 0x7b7b7b00, 0xbbbbbb00, 0xc9c9c900, 0x43434300, 0xc1c1c100, 0x15151500, 0xe3e3e300, 0xadadad00, 0xf4f4f400, 0x77777700, 0xc7c7c700, 0x80808000, 0x9e9e9e00 }, { 0x00e0e0e0, 0x00050505, 0x00585858, 0x00d9d9d9, 0x00676767, 0x004e4e4e, 0x00818181, 0x00cbcbcb, 0x00c9c9c9, 0x000b0b0b, 0x00aeaeae, 0x006a6a6a, 0x00d5d5d5, 0x00181818, 0x005d5d5d, 0x00828282, 0x00464646, 0x00dfdfdf, 0x00d6d6d6, 0x00272727, 0x008a8a8a, 0x00323232, 0x004b4b4b, 0x00424242, 0x00dbdbdb, 0x001c1c1c, 0x009e9e9e, 0x009c9c9c, 0x003a3a3a, 0x00cacaca, 0x00252525, 0x007b7b7b, 0x000d0d0d, 0x00717171, 0x005f5f5f, 0x001f1f1f, 0x00f8f8f8, 0x00d7d7d7, 0x003e3e3e, 0x009d9d9d, 0x007c7c7c, 0x00606060, 0x00b9b9b9, 0x00bebebe, 0x00bcbcbc, 0x008b8b8b, 0x00161616, 0x00343434, 0x004d4d4d, 0x00c3c3c3, 0x00727272, 0x00959595, 0x00ababab, 0x008e8e8e, 0x00bababa, 0x007a7a7a, 0x00b3b3b3, 0x00020202, 0x00b4b4b4, 0x00adadad, 0x00a2a2a2, 0x00acacac, 0x00d8d8d8, 0x009a9a9a, 0x00171717, 0x001a1a1a, 0x00353535, 0x00cccccc, 0x00f7f7f7, 0x00999999, 0x00616161, 0x005a5a5a, 0x00e8e8e8, 0x00242424, 0x00565656, 0x00404040, 0x00e1e1e1, 0x00636363, 0x00090909, 0x00333333, 0x00bfbfbf, 0x00989898, 0x00979797, 0x00858585, 0x00686868, 0x00fcfcfc, 0x00ececec, 0x000a0a0a, 0x00dadada, 0x006f6f6f, 0x00535353, 0x00626262, 0x00a3a3a3, 0x002e2e2e, 0x00080808, 0x00afafaf, 0x00282828, 0x00b0b0b0, 0x00747474, 0x00c2c2c2, 0x00bdbdbd, 0x00363636, 0x00222222, 0x00383838, 0x00646464, 0x001e1e1e, 0x00393939, 0x002c2c2c, 0x00a6a6a6, 0x00303030, 0x00e5e5e5, 0x00444444, 0x00fdfdfd, 0x00888888, 0x009f9f9f, 0x00656565, 0x00878787, 0x006b6b6b, 0x00f4f4f4, 0x00232323, 0x00484848, 0x00101010, 0x00d1d1d1, 0x00515151, 0x00c0c0c0, 0x00f9f9f9, 0x00d2d2d2, 0x00a0a0a0, 0x00555555, 0x00a1a1a1, 0x00414141, 0x00fafafa, 0x00434343, 0x00131313, 0x00c4c4c4, 0x002f2f2f, 0x00a8a8a8, 0x00b6b6b6, 0x003c3c3c, 0x002b2b2b, 0x00c1c1c1, 0x00ffffff, 0x00c8c8c8, 0x00a5a5a5, 0x00202020, 0x00898989, 0x00000000, 0x00909090, 0x00474747, 0x00efefef, 0x00eaeaea, 0x00b7b7b7, 0x00151515, 0x00060606, 0x00cdcdcd, 0x00b5b5b5, 0x00121212, 0x007e7e7e, 0x00bbbbbb, 0x00292929, 0x000f0f0f, 0x00b8b8b8, 0x00070707, 0x00040404, 0x009b9b9b, 0x00949494, 0x00212121, 0x00666666, 0x00e6e6e6, 0x00cecece, 0x00ededed, 0x00e7e7e7, 0x003b3b3b, 0x00fefefe, 0x007f7f7f, 0x00c5c5c5, 0x00a4a4a4, 0x00373737, 0x00b1b1b1, 0x004c4c4c, 0x00919191, 0x006e6e6e, 0x008d8d8d, 0x00767676, 0x00030303, 0x002d2d2d, 0x00dedede, 0x00969696, 0x00262626, 0x007d7d7d, 0x00c6c6c6, 0x005c5c5c, 0x00d3d3d3, 0x00f2f2f2, 0x004f4f4f, 0x00191919, 0x003f3f3f, 0x00dcdcdc, 0x00797979, 0x001d1d1d, 0x00525252, 0x00ebebeb, 0x00f3f3f3, 0x006d6d6d, 0x005e5e5e, 0x00fbfbfb, 0x00696969, 0x00b2b2b2, 0x00f0f0f0, 0x00313131, 0x000c0c0c, 0x00d4d4d4, 0x00cfcfcf, 0x008c8c8c, 0x00e2e2e2, 0x00757575, 0x00a9a9a9, 0x004a4a4a, 0x00575757, 0x00848484, 0x00111111, 0x00454545, 0x001b1b1b, 0x00f5f5f5, 0x00e4e4e4, 0x000e0e0e, 0x00737373, 0x00aaaaaa, 0x00f1f1f1, 0x00dddddd, 0x00595959, 0x00141414, 0x006c6c6c, 0x00929292, 0x00545454, 0x00d0d0d0, 0x00787878, 0x00707070, 0x00e3e3e3, 0x00494949, 0x00808080, 0x00505050, 0x00a7a7a7, 0x00f6f6f6, 0x00777777, 0x00939393, 0x00868686, 0x00838383, 0x002a2a2a, 0x00c7c7c7, 0x005b5b5b, 0x00e9e9e9, 0x00eeeeee, 0x008f8f8f, 0x00010101, 0x003d3d3d }, { 0x38003838, 0x41004141, 0x16001616, 0x76007676, 0xd900d9d9, 0x93009393, 0x60006060, 0xf200f2f2, 0x72007272, 0xc200c2c2, 0xab00abab, 0x9a009a9a, 0x75007575, 0x06000606, 0x57005757, 0xa000a0a0, 0x91009191, 0xf700f7f7, 0xb500b5b5, 0xc900c9c9, 0xa200a2a2, 0x8c008c8c, 0xd200d2d2, 0x90009090, 0xf600f6f6, 0x07000707, 0xa700a7a7, 0x27002727, 0x8e008e8e, 0xb200b2b2, 0x49004949, 0xde00dede, 0x43004343, 0x5c005c5c, 0xd700d7d7, 0xc700c7c7, 0x3e003e3e, 0xf500f5f5, 0x8f008f8f, 0x67006767, 0x1f001f1f, 0x18001818, 0x6e006e6e, 0xaf00afaf, 0x2f002f2f, 0xe200e2e2, 0x85008585, 0x0d000d0d, 0x53005353, 0xf000f0f0, 0x9c009c9c, 0x65006565, 0xea00eaea, 0xa300a3a3, 0xae00aeae, 0x9e009e9e, 0xec00ecec, 0x80008080, 0x2d002d2d, 0x6b006b6b, 0xa800a8a8, 0x2b002b2b, 0x36003636, 0xa600a6a6, 0xc500c5c5, 0x86008686, 0x4d004d4d, 0x33003333, 0xfd00fdfd, 0x66006666, 0x58005858, 0x96009696, 0x3a003a3a, 0x09000909, 0x95009595, 0x10001010, 0x78007878, 0xd800d8d8, 0x42004242, 0xcc00cccc, 0xef00efef, 0x26002626, 0xe500e5e5, 0x61006161, 0x1a001a1a, 0x3f003f3f, 0x3b003b3b, 0x82008282, 0xb600b6b6, 0xdb00dbdb, 0xd400d4d4, 0x98009898, 0xe800e8e8, 0x8b008b8b, 0x02000202, 0xeb00ebeb, 0x0a000a0a, 0x2c002c2c, 0x1d001d1d, 0xb000b0b0, 0x6f006f6f, 0x8d008d8d, 0x88008888, 0x0e000e0e, 0x19001919, 0x87008787, 0x4e004e4e, 0x0b000b0b, 0xa900a9a9, 0x0c000c0c, 0x79007979, 0x11001111, 0x7f007f7f, 0x22002222, 0xe700e7e7, 0x59005959, 0xe100e1e1, 0xda00dada, 0x3d003d3d, 0xc800c8c8, 0x12001212, 0x04000404, 0x74007474, 0x54005454, 0x30003030, 0x7e007e7e, 0xb400b4b4, 0x28002828, 0x55005555, 0x68006868, 0x50005050, 0xbe00bebe, 0xd000d0d0, 0xc400c4c4, 0x31003131, 0xcb00cbcb, 0x2a002a2a, 0xad00adad, 0x0f000f0f, 0xca00caca, 0x70007070, 0xff00ffff, 0x32003232, 0x69006969, 0x08000808, 0x62006262, 0x00000000, 0x24002424, 0xd100d1d1, 0xfb00fbfb, 0xba00baba, 0xed00eded, 0x45004545, 0x81008181, 0x73007373, 0x6d006d6d, 0x84008484, 0x9f009f9f, 0xee00eeee, 0x4a004a4a, 0xc300c3c3, 0x2e002e2e, 0xc100c1c1, 0x01000101, 0xe600e6e6, 0x25002525, 0x48004848, 0x99009999, 0xb900b9b9, 0xb300b3b3, 0x7b007b7b, 0xf900f9f9, 0xce00cece, 0xbf00bfbf, 0xdf00dfdf, 0x71007171, 0x29002929, 0xcd00cdcd, 0x6c006c6c, 0x13001313, 0x64006464, 0x9b009b9b, 0x63006363, 0x9d009d9d, 0xc000c0c0, 0x4b004b4b, 0xb700b7b7, 0xa500a5a5, 0x89008989, 0x5f005f5f, 0xb100b1b1, 0x17001717, 0xf400f4f4, 0xbc00bcbc, 0xd300d3d3, 0x46004646, 0xcf00cfcf, 0x37003737, 0x5e005e5e, 0x47004747, 0x94009494, 0xfa00fafa, 0xfc00fcfc, 0x5b005b5b, 0x97009797, 0xfe00fefe, 0x5a005a5a, 0xac00acac, 0x3c003c3c, 0x4c004c4c, 0x03000303, 0x35003535, 0xf300f3f3, 0x23002323, 0xb800b8b8, 0x5d005d5d, 0x6a006a6a, 0x92009292, 0xd500d5d5, 0x21002121, 0x44004444, 0x51005151, 0xc600c6c6, 0x7d007d7d, 0x39003939, 0x83008383, 0xdc00dcdc, 0xaa00aaaa, 0x7c007c7c, 0x77007777, 0x56005656, 0x05000505, 0x1b001b1b, 0xa400a4a4, 0x15001515, 0x34003434, 0x1e001e1e, 0x1c001c1c, 0xf800f8f8, 0x52005252, 0x20002020, 0x14001414, 0xe900e9e9, 0xbd00bdbd, 0xdd00dddd, 0xe400e4e4, 0xa100a1a1, 0xe000e0e0, 0x8a008a8a, 0xf100f1f1, 0xd600d6d6, 0x7a007a7a, 0xbb00bbbb, 0xe300e3e3, 0x40004040, 0x4f004f4f }, { 0x70700070, 0x2c2c002c, 0xb3b300b3, 0xc0c000c0, 0xe4e400e4, 0x57570057, 0xeaea00ea, 0xaeae00ae, 0x23230023, 0x6b6b006b, 0x45450045, 0xa5a500a5, 0xeded00ed, 0x4f4f004f, 0x1d1d001d, 0x92920092, 0x86860086, 0xafaf00af, 0x7c7c007c, 0x1f1f001f, 0x3e3e003e, 0xdcdc00dc, 0x5e5e005e, 0x0b0b000b, 0xa6a600a6, 0x39390039, 0xd5d500d5, 0x5d5d005d, 0xd9d900d9, 0x5a5a005a, 0x51510051, 0x6c6c006c, 0x8b8b008b, 0x9a9a009a, 0xfbfb00fb, 0xb0b000b0, 0x74740074, 0x2b2b002b, 0xf0f000f0, 0x84840084, 0xdfdf00df, 0xcbcb00cb, 0x34340034, 0x76760076, 0x6d6d006d, 0xa9a900a9, 0xd1d100d1, 0x04040004, 0x14140014, 0x3a3a003a, 0xdede00de, 0x11110011, 0x32320032, 0x9c9c009c, 0x53530053, 0xf2f200f2, 0xfefe00fe, 0xcfcf00cf, 0xc3c300c3, 0x7a7a007a, 0x24240024, 0xe8e800e8, 0x60600060, 0x69690069, 0xaaaa00aa, 0xa0a000a0, 0xa1a100a1, 0x62620062, 0x54540054, 0x1e1e001e, 0xe0e000e0, 0x64640064, 0x10100010, 0x00000000, 0xa3a300a3, 0x75750075, 0x8a8a008a, 0xe6e600e6, 0x09090009, 0xdddd00dd, 0x87870087, 0x83830083, 0xcdcd00cd, 0x90900090, 0x73730073, 0xf6f600f6, 0x9d9d009d, 0xbfbf00bf, 0x52520052, 0xd8d800d8, 0xc8c800c8, 0xc6c600c6, 0x81810081, 0x6f6f006f, 0x13130013, 0x63630063, 0xe9e900e9, 0xa7a700a7, 0x9f9f009f, 0xbcbc00bc, 0x29290029, 0xf9f900f9, 0x2f2f002f, 0xb4b400b4, 0x78780078, 0x06060006, 0xe7e700e7, 0x71710071, 0xd4d400d4, 0xabab00ab, 0x88880088, 0x8d8d008d, 0x72720072, 0xb9b900b9, 0xf8f800f8, 0xacac00ac, 0x36360036, 0x2a2a002a, 0x3c3c003c, 0xf1f100f1, 0x40400040, 0xd3d300d3, 0xbbbb00bb, 0x43430043, 0x15150015, 0xadad00ad, 0x77770077, 0x80800080, 0x82820082, 0xecec00ec, 0x27270027, 0xe5e500e5, 0x85850085, 0x35350035, 0x0c0c000c, 0x41410041, 0xefef00ef, 0x93930093, 0x19190019, 0x21210021, 0x0e0e000e, 0x4e4e004e, 0x65650065, 0xbdbd00bd, 0xb8b800b8, 0x8f8f008f, 0xebeb00eb, 0xcece00ce, 0x30300030, 0x5f5f005f, 0xc5c500c5, 0x1a1a001a, 0xe1e100e1, 0xcaca00ca, 0x47470047, 0x3d3d003d, 0x01010001, 0xd6d600d6, 0x56560056, 0x4d4d004d, 0x0d0d000d, 0x66660066, 0xcccc00cc, 0x2d2d002d, 0x12120012, 0x20200020, 0xb1b100b1, 0x99990099, 0x4c4c004c, 0xc2c200c2, 0x7e7e007e, 0x05050005, 0xb7b700b7, 0x31310031, 0x17170017, 0xd7d700d7, 0x58580058, 0x61610061, 0x1b1b001b, 0x1c1c001c, 0x0f0f000f, 0x16160016, 0x18180018, 0x22220022, 0x44440044, 0xb2b200b2, 0xb5b500b5, 0x91910091, 0x08080008, 0xa8a800a8, 0xfcfc00fc, 0x50500050, 0xd0d000d0, 0x7d7d007d, 0x89890089, 0x97970097, 0x5b5b005b, 0x95950095, 0xffff00ff, 0xd2d200d2, 0xc4c400c4, 0x48480048, 0xf7f700f7, 0xdbdb00db, 0x03030003, 0xdada00da, 0x3f3f003f, 0x94940094, 0x5c5c005c, 0x02020002, 0x4a4a004a, 0x33330033, 0x67670067, 0xf3f300f3, 0x7f7f007f, 0xe2e200e2, 0x9b9b009b, 0x26260026, 0x37370037, 0x3b3b003b, 0x96960096, 0x4b4b004b, 0xbebe00be, 0x2e2e002e, 0x79790079, 0x8c8c008c, 0x6e6e006e, 0x8e8e008e, 0xf5f500f5, 0xb6b600b6, 0xfdfd00fd, 0x59590059, 0x98980098, 0x6a6a006a, 0x46460046, 0xbaba00ba, 0x25250025, 0x42420042, 0xa2a200a2, 0xfafa00fa, 0x07070007, 0x55550055, 0xeeee00ee, 0x0a0a000a, 0x49490049, 0x68680068, 0x38380038, 0xa4a400a4, 0x28280028, 0x7b7b007b, 0xc9c900c9, 0xc1c100c1, 0xe3e300e3, 0xf4f400f4, 0xc7c700c7, 0x9e9e009e }}; NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/md4.h0000755000000000000000000000243212414772654016434 0ustar rootroot#ifndef CRYPTOPP_MD4_H #define CRYPTOPP_MD4_H #include "iterhash.h" NAMESPACE_BEGIN(CryptoPP) namespace Weak1 { //! MD4 /*! \warning MD4 is considered insecure, and should not be used unless you absolutely need it for compatibility. */ class MD4 : public IteratedHashWithStaticTransform { public: static void InitState(HashWordType *state); static void Transform(word32 *digest, const word32 *data); static const char *StaticAlgorithmName() {return "MD4";} }; } #if CRYPTOPP_ENABLE_NAMESPACE_WEAK >= 1 namespace Weak {using namespace Weak1;} // import Weak1 into CryptoPP::Weak #else using namespace Weak1; // import Weak1 into CryptoPP with warning #ifdef __GNUC__ #warning "You may be using a weak algorithm that has been retained for backwards compatibility. Please '#define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1' before including this .h file and prepend the class name with 'Weak::' to remove this warning." #else #pragma message("You may be using a weak algorithm that has been retained for backwards compatibility. Please '#define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1' before including this .h file and prepend the class name with 'Weak::' to remove this warning.") #endif #endif NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/cryptlib_bds.cpp0000755000000000000000000000031712414772654020763 0ustar rootroot//--------------------------------------------------------------------------- /* #include #pragma hdrstop */ #define Library // To add a file to the library use the Project menu 'Add to Project'. armory-0.92.3/cppForSwig/cryptopp/winpipes.h0000755000000000000000000000657412414772654017621 0ustar rootroot#ifndef CRYPTOPP_WINPIPES_H #define CRYPTOPP_WINPIPES_H #include "config.h" #ifdef WINDOWS_PIPES_AVAILABLE #include "network.h" #include "queue.h" #include NAMESPACE_BEGIN(CryptoPP) //! Windows Handle class WindowsHandle { public: WindowsHandle(HANDLE h = INVALID_HANDLE_VALUE, bool own=false); WindowsHandle(const WindowsHandle &h) : m_h(h.m_h), m_own(false) {} virtual ~WindowsHandle(); bool GetOwnership() const {return m_own;} void SetOwnership(bool own) {m_own = own;} operator HANDLE() {return m_h;} HANDLE GetHandle() const {return m_h;} bool HandleValid() const; void AttachHandle(HANDLE h, bool own=false); HANDLE DetachHandle(); void CloseHandle(); protected: virtual void HandleChanged() {} HANDLE m_h; bool m_own; }; //! Windows Pipe class WindowsPipe { public: class Err : public OS_Error { public: Err(HANDLE h, const std::string& operation, int error); HANDLE GetHandle() const {return m_h;} private: HANDLE m_h; }; protected: virtual HANDLE GetHandle() const =0; virtual void HandleError(const char *operation) const; void CheckAndHandleError(const char *operation, BOOL result) const {assert(result==TRUE || result==FALSE); if (!result) HandleError(operation);} }; //! pipe-based implementation of NetworkReceiver class WindowsPipeReceiver : public WindowsPipe, public NetworkReceiver { public: WindowsPipeReceiver(); bool MustWaitForResult() {return true;} bool Receive(byte* buf, size_t bufLen); unsigned int GetReceiveResult(); bool EofReceived() const {return m_eofReceived;} unsigned int GetMaxWaitObjectCount() const {return 1;} void GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack); private: WindowsHandle m_event; OVERLAPPED m_overlapped; bool m_resultPending; DWORD m_lastResult; bool m_eofReceived; }; //! pipe-based implementation of NetworkSender class WindowsPipeSender : public WindowsPipe, public NetworkSender { public: WindowsPipeSender(); bool MustWaitForResult() {return true;} void Send(const byte* buf, size_t bufLen); unsigned int GetSendResult(); bool MustWaitForEof() { return false; } void SendEof() {} unsigned int GetMaxWaitObjectCount() const {return 1;} void GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack); private: WindowsHandle m_event; OVERLAPPED m_overlapped; bool m_resultPending; DWORD m_lastResult; }; //! Windows Pipe Source class WindowsPipeSource : public WindowsHandle, public NetworkSource, public WindowsPipeReceiver { public: WindowsPipeSource(HANDLE h=INVALID_HANDLE_VALUE, bool pumpAll=false, BufferedTransformation *attachment=NULL) : WindowsHandle(h), NetworkSource(attachment) { if (pumpAll) PumpAll(); } NetworkSource::GetMaxWaitObjectCount; NetworkSource::GetWaitObjects; private: HANDLE GetHandle() const {return WindowsHandle::GetHandle();} NetworkReceiver & AccessReceiver() {return *this;} }; //! Windows Pipe Sink class WindowsPipeSink : public WindowsHandle, public NetworkSink, public WindowsPipeSender { public: WindowsPipeSink(HANDLE h=INVALID_HANDLE_VALUE, unsigned int maxBufferSize=0, unsigned int autoFlushBound=16*1024) : WindowsHandle(h), NetworkSink(maxBufferSize, autoFlushBound) {} NetworkSink::GetMaxWaitObjectCount; NetworkSink::GetWaitObjects; private: HANDLE GetHandle() const {return WindowsHandle::GetHandle();} NetworkSender & AccessSender() {return *this;} }; NAMESPACE_END #endif #endif armory-0.92.3/cppForSwig/cryptopp/oaep.h0000755000000000000000000000271112414772654016674 0ustar rootroot#ifndef CRYPTOPP_OAEP_H #define CRYPTOPP_OAEP_H #include "pubkey.h" #include "sha.h" NAMESPACE_BEGIN(CryptoPP) //! _ class CRYPTOPP_DLL OAEP_Base : public PK_EncryptionMessageEncodingMethod { public: bool ParameterSupported(const char *name) const {return strcmp(name, Name::EncodingParameters()) == 0;} size_t MaxUnpaddedLength(size_t paddedLength) const; void Pad(RandomNumberGenerator &rng, const byte *raw, size_t inputLength, byte *padded, size_t paddedLength, const NameValuePairs ¶meters) const; DecodingResult Unpad(const byte *padded, size_t paddedLength, byte *raw, const NameValuePairs ¶meters) const; protected: virtual unsigned int DigestSize() const =0; virtual HashTransformation * NewHash() const =0; virtual MaskGeneratingFunction * NewMGF() const =0; }; //! EME-OAEP, for use with classes derived from TF_ES template class OAEP : public OAEP_Base, public EncryptionStandard { public: static std::string CRYPTOPP_API StaticAlgorithmName() {return std::string("OAEP-") + MGF::StaticAlgorithmName() + "(" + H::StaticAlgorithmName() + ")";} typedef OAEP EncryptionMessageEncodingMethod; protected: unsigned int DigestSize() const {return H::DIGESTSIZE;} HashTransformation * NewHash() const {return new H;} MaskGeneratingFunction * NewMGF() const {return new MGF;} }; CRYPTOPP_DLL_TEMPLATE_CLASS OAEP; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/dll.cpp0000755000000000000000000001015712414772654017061 0ustar rootroot// dll.cpp - written and placed in the public domain by Wei Dai #define CRYPTOPP_MANUALLY_INSTANTIATE_TEMPLATES #define CRYPTOPP_DEFAULT_NO_DLL #include "dll.h" #pragma warning(default: 4660) #if defined(CRYPTOPP_EXPORTS) && defined(CRYPTOPP_WIN32_AVAILABLE) #include #endif #ifndef CRYPTOPP_IMPORTS NAMESPACE_BEGIN(CryptoPP) template<> const byte PKCS_DigestDecoration::decoration[] = {0x30,0x21,0x30,0x09,0x06,0x05,0x2B,0x0E,0x03,0x02,0x1A,0x05,0x00,0x04,0x14}; template<> const unsigned int PKCS_DigestDecoration::length = sizeof(PKCS_DigestDecoration::decoration); template<> const byte PKCS_DigestDecoration::decoration[] = {0x30,0x2d,0x30,0x0d,0x06,0x09,0x60,0x86,0x48,0x01,0x65,0x03,0x04,0x02,0x04,0x05,0x00,0x04,0x1c}; template<> const unsigned int PKCS_DigestDecoration::length = sizeof(PKCS_DigestDecoration::decoration); template<> const byte PKCS_DigestDecoration::decoration[] = {0x30,0x31,0x30,0x0d,0x06,0x09,0x60,0x86,0x48,0x01,0x65,0x03,0x04,0x02,0x01,0x05,0x00,0x04,0x20}; template<> const unsigned int PKCS_DigestDecoration::length = sizeof(PKCS_DigestDecoration::decoration); template<> const byte PKCS_DigestDecoration::decoration[] = {0x30,0x41,0x30,0x0d,0x06,0x09,0x60,0x86,0x48,0x01,0x65,0x03,0x04,0x02,0x02,0x05,0x00,0x04,0x30}; template<> const unsigned int PKCS_DigestDecoration::length = sizeof(PKCS_DigestDecoration::decoration); template<> const byte PKCS_DigestDecoration::decoration[] = {0x30,0x51,0x30,0x0d,0x06,0x09,0x60,0x86,0x48,0x01,0x65,0x03,0x04,0x02,0x03,0x05,0x00,0x04,0x40}; template<> const unsigned int PKCS_DigestDecoration::length = sizeof(PKCS_DigestDecoration::decoration); template<> const byte EMSA2HashId::id = 0x33; template<> const byte EMSA2HashId::id = 0x38; template<> const byte EMSA2HashId::id = 0x34; template<> const byte EMSA2HashId::id = 0x36; template<> const byte EMSA2HashId::id = 0x35; NAMESPACE_END #endif #ifdef CRYPTOPP_EXPORTS USING_NAMESPACE(CryptoPP) #if !(defined(_MSC_VER) && (_MSC_VER < 1300)) using std::set_new_handler; #endif static PNew s_pNew = NULL; static PDelete s_pDelete = NULL; static void * New (size_t size) { void *p; while (!(p = malloc(size))) CallNewHandler(); return p; } static void SetNewAndDeleteFunctionPointers() { void *p = NULL; HMODULE hModule = NULL; MEMORY_BASIC_INFORMATION mbi; while (true) { VirtualQuery(p, &mbi, sizeof(mbi)); if (p >= (char *)mbi.BaseAddress + mbi.RegionSize) break; p = (char *)mbi.BaseAddress + mbi.RegionSize; if (!mbi.AllocationBase || mbi.AllocationBase == hModule) continue; hModule = HMODULE(mbi.AllocationBase); PGetNewAndDelete pGetNewAndDelete = (PGetNewAndDelete)GetProcAddress(hModule, "GetNewAndDeleteForCryptoPP"); if (pGetNewAndDelete) { pGetNewAndDelete(s_pNew, s_pDelete); return; } PSetNewAndDelete pSetNewAndDelete = (PSetNewAndDelete)GetProcAddress(hModule, "SetNewAndDeleteFromCryptoPP"); if (pSetNewAndDelete) { s_pNew = &New; s_pDelete = &free; pSetNewAndDelete(s_pNew, s_pDelete, &set_new_handler); return; } } // try getting these directly using mangled names of new and delete operators hModule = GetModuleHandle("msvcrtd"); if (!hModule) hModule = GetModuleHandle("msvcrt"); if (hModule) { // 32-bit versions s_pNew = (PNew)GetProcAddress(hModule, "??2@YAPAXI@Z"); s_pDelete = (PDelete)GetProcAddress(hModule, "??3@YAXPAX@Z"); if (s_pNew && s_pDelete) return; // 64-bit versions s_pNew = (PNew)GetProcAddress(hModule, "??2@YAPEAX_K@Z"); s_pDelete = (PDelete)GetProcAddress(hModule, "??3@YAXPEAX@Z"); if (s_pNew && s_pDelete) return; } OutputDebugString("Crypto++ was not able to obtain new and delete function pointers.\n"); throw 0; } void * operator new (size_t size) { if (!s_pNew) SetNewAndDeleteFunctionPointers(); return s_pNew(size); } void operator delete (void * p) { s_pDelete(p); } void * operator new [] (size_t size) { return operator new (size); } void operator delete [] (void * p) { operator delete (p); } #endif // #ifdef CRYPTOPP_EXPORTS armory-0.92.3/cppForSwig/cryptopp/bench2.cpp0000755000000000000000000002762412414772654017456 0ustar rootroot// bench2.cpp - written and placed in the public domain by Wei Dai #include "bench.h" #include "validate.h" #include "files.h" #include "hex.h" #include "rsa.h" #include "nr.h" #include "dsa.h" #include "luc.h" #include "rw.h" #include "eccrypto.h" #include "ecp.h" #include "ec2n.h" #include "asn.h" #include "dh.h" #include "mqv.h" #include "xtrcrypt.h" #include "esign.h" #include "pssr.h" #include "oids.h" #include "randpool.h" #include #include #include #include USING_NAMESPACE(CryptoPP) USING_NAMESPACE(std) void OutputResultOperations(const char *name, const char *operation, bool pc, unsigned long iterations, double timeTaken); void BenchMarkEncryption(const char *name, PK_Encryptor &key, double timeTotal, bool pc=false) { unsigned int len = 16; SecByteBlock plaintext(len), ciphertext(key.CiphertextLength(len)); GlobalRNG().GenerateBlock(plaintext, len); clock_t start = clock(); unsigned int i; double timeTaken; for (timeTaken=(double)0, i=0; timeTaken < timeTotal; timeTaken = double(clock() - start) / CLOCK_TICKS_PER_SECOND, i++) key.Encrypt(GlobalRNG(), plaintext, len, ciphertext); OutputResultOperations(name, "Encryption", pc, i, timeTaken); if (!pc && key.GetMaterial().SupportsPrecomputation()) { key.AccessMaterial().Precompute(16); BenchMarkEncryption(name, key, timeTotal, true); } } void BenchMarkDecryption(const char *name, PK_Decryptor &priv, PK_Encryptor &pub, double timeTotal) { unsigned int len = 16; SecByteBlock ciphertext(pub.CiphertextLength(len)); SecByteBlock plaintext(pub.MaxPlaintextLength(ciphertext.size())); GlobalRNG().GenerateBlock(plaintext, len); pub.Encrypt(GlobalRNG(), plaintext, len, ciphertext); clock_t start = clock(); unsigned int i; double timeTaken; for (timeTaken=(double)0, i=0; timeTaken < timeTotal; timeTaken = double(clock() - start) / CLOCK_TICKS_PER_SECOND, i++) priv.Decrypt(GlobalRNG(), ciphertext, ciphertext.size(), plaintext); OutputResultOperations(name, "Decryption", false, i, timeTaken); } void BenchMarkSigning(const char *name, PK_Signer &key, double timeTotal, bool pc=false) { unsigned int len = 16; AlignedSecByteBlock message(len), signature(key.SignatureLength()); GlobalRNG().GenerateBlock(message, len); clock_t start = clock(); unsigned int i; double timeTaken; for (timeTaken=(double)0, i=0; timeTaken < timeTotal; timeTaken = double(clock() - start) / CLOCK_TICKS_PER_SECOND, i++) key.SignMessage(GlobalRNG(), message, len, signature); OutputResultOperations(name, "Signature", pc, i, timeTaken); if (!pc && key.GetMaterial().SupportsPrecomputation()) { key.AccessMaterial().Precompute(16); BenchMarkSigning(name, key, timeTotal, true); } } void BenchMarkVerification(const char *name, const PK_Signer &priv, PK_Verifier &pub, double timeTotal, bool pc=false) { unsigned int len = 16; AlignedSecByteBlock message(len), signature(pub.SignatureLength()); GlobalRNG().GenerateBlock(message, len); priv.SignMessage(GlobalRNG(), message, len, signature); clock_t start = clock(); unsigned int i; double timeTaken; for (timeTaken=(double)0, i=0; timeTaken < timeTotal; timeTaken = double(clock() - start) / CLOCK_TICKS_PER_SECOND, i++) pub.VerifyMessage(message, len, signature, signature.size()); OutputResultOperations(name, "Verification", pc, i, timeTaken); if (!pc && pub.GetMaterial().SupportsPrecomputation()) { pub.AccessMaterial().Precompute(16); BenchMarkVerification(name, priv, pub, timeTotal, true); } } void BenchMarkKeyGen(const char *name, SimpleKeyAgreementDomain &d, double timeTotal, bool pc=false) { SecByteBlock priv(d.PrivateKeyLength()), pub(d.PublicKeyLength()); clock_t start = clock(); unsigned int i; double timeTaken; for (timeTaken=(double)0, i=0; timeTaken < timeTotal; timeTaken = double(clock() - start) / CLOCK_TICKS_PER_SECOND, i++) d.GenerateKeyPair(GlobalRNG(), priv, pub); OutputResultOperations(name, "Key-Pair Generation", pc, i, timeTaken); if (!pc && d.GetMaterial().SupportsPrecomputation()) { d.AccessMaterial().Precompute(16); BenchMarkKeyGen(name, d, timeTotal, true); } } void BenchMarkKeyGen(const char *name, AuthenticatedKeyAgreementDomain &d, double timeTotal, bool pc=false) { SecByteBlock priv(d.EphemeralPrivateKeyLength()), pub(d.EphemeralPublicKeyLength()); clock_t start = clock(); unsigned int i; double timeTaken; for (timeTaken=(double)0, i=0; timeTaken < timeTotal; timeTaken = double(clock() - start) / CLOCK_TICKS_PER_SECOND, i++) d.GenerateEphemeralKeyPair(GlobalRNG(), priv, pub); OutputResultOperations(name, "Key-Pair Generation", pc, i, timeTaken); if (!pc && d.GetMaterial().SupportsPrecomputation()) { d.AccessMaterial().Precompute(16); BenchMarkKeyGen(name, d, timeTotal, true); } } void BenchMarkAgreement(const char *name, SimpleKeyAgreementDomain &d, double timeTotal, bool pc=false) { SecByteBlock priv1(d.PrivateKeyLength()), priv2(d.PrivateKeyLength()); SecByteBlock pub1(d.PublicKeyLength()), pub2(d.PublicKeyLength()); d.GenerateKeyPair(GlobalRNG(), priv1, pub1); d.GenerateKeyPair(GlobalRNG(), priv2, pub2); SecByteBlock val(d.AgreedValueLength()); clock_t start = clock(); unsigned int i; double timeTaken; for (timeTaken=(double)0, i=0; timeTaken < timeTotal; timeTaken = double(clock() - start) / CLOCK_TICKS_PER_SECOND, i+=2) { d.Agree(val, priv1, pub2); d.Agree(val, priv2, pub1); } OutputResultOperations(name, "Key Agreement", pc, i, timeTaken); } void BenchMarkAgreement(const char *name, AuthenticatedKeyAgreementDomain &d, double timeTotal, bool pc=false) { SecByteBlock spriv1(d.StaticPrivateKeyLength()), spriv2(d.StaticPrivateKeyLength()); SecByteBlock epriv1(d.EphemeralPrivateKeyLength()), epriv2(d.EphemeralPrivateKeyLength()); SecByteBlock spub1(d.StaticPublicKeyLength()), spub2(d.StaticPublicKeyLength()); SecByteBlock epub1(d.EphemeralPublicKeyLength()), epub2(d.EphemeralPublicKeyLength()); d.GenerateStaticKeyPair(GlobalRNG(), spriv1, spub1); d.GenerateStaticKeyPair(GlobalRNG(), spriv2, spub2); d.GenerateEphemeralKeyPair(GlobalRNG(), epriv1, epub1); d.GenerateEphemeralKeyPair(GlobalRNG(), epriv2, epub2); SecByteBlock val(d.AgreedValueLength()); clock_t start = clock(); unsigned int i; double timeTaken; for (timeTaken=(double)0, i=0; timeTaken < timeTotal; timeTaken = double(clock() - start) / CLOCK_TICKS_PER_SECOND, i+=2) { d.Agree(val, spriv1, epriv1, spub2, epub2); d.Agree(val, spriv2, epriv2, spub1, epub1); } OutputResultOperations(name, "Key Agreement", pc, i, timeTaken); } //VC60 workaround: compiler bug triggered without the extra dummy parameters template void BenchMarkCrypto(const char *filename, const char *name, double timeTotal, SCHEME *x=NULL) { FileSource f(filename, true, new HexDecoder()); typename SCHEME::Decryptor priv(f); typename SCHEME::Encryptor pub(priv); BenchMarkEncryption(name, pub, timeTotal); BenchMarkDecryption(name, priv, pub, timeTotal); } //VC60 workaround: compiler bug triggered without the extra dummy parameters template void BenchMarkSignature(const char *filename, const char *name, double timeTotal, SCHEME *x=NULL) { FileSource f(filename, true, new HexDecoder()); typename SCHEME::Signer priv(f); typename SCHEME::Verifier pub(priv); BenchMarkSigning(name, priv, timeTotal); BenchMarkVerification(name, priv, pub, timeTotal); } //VC60 workaround: compiler bug triggered without the extra dummy parameters template void BenchMarkKeyAgreement(const char *filename, const char *name, double timeTotal, D *x=NULL) { FileSource f(filename, true, new HexDecoder()); D d(f); BenchMarkKeyGen(name, d, timeTotal); BenchMarkAgreement(name, d, timeTotal); } extern double g_hertz; void BenchmarkAll2(double t, double hertz) { g_hertz = hertz; #if 0 cout << "" << endl; cout << ""; BenchMarkCrypto > >("TestData/rsa1024.dat", "RSA 1024", t); BenchMarkCrypto > >("TestData/luc1024.dat", "LUC 1024", t); BenchMarkCrypto >("TestData/dlie1024.dat", "DLIES 1024", t); BenchMarkCrypto >("TestData/lucc512.dat", "LUCELG 512", t); cout << "\n"; BenchMarkCrypto > >("TestData/rsa2048.dat", "RSA 2048", t); BenchMarkCrypto > >("TestData/luc2048.dat", "LUC 2048", t); BenchMarkCrypto >("TestData/dlie2048.dat", "DLIES 2048", t); BenchMarkCrypto >("TestData/lucc1024.dat", "LUCELG 1024", t); cout << "\n"; BenchMarkSignature >("TestData/rsa1024.dat", "RSA 1024", t); BenchMarkSignature >("TestData/rw1024.dat", "RW 1024", t); BenchMarkSignature >("TestData/luc1024.dat", "LUC 1024", t); BenchMarkSignature >("TestData/nr1024.dat", "NR 1024", t); BenchMarkSignature("TestData/dsa1024.dat", "DSA 1024", t); BenchMarkSignature >("TestData/lucs512.dat", "LUC-HMP 512", t); BenchMarkSignature >("TestData/esig1023.dat", "ESIGN 1023", t); BenchMarkSignature >("TestData/esig1536.dat", "ESIGN 1536", t); cout << "\n"; BenchMarkSignature >("TestData/rsa2048.dat", "RSA 2048", t); BenchMarkSignature >("TestData/rw2048.dat", "RW 2048", t); BenchMarkSignature >("TestData/luc2048.dat", "LUC 2048", t); BenchMarkSignature >("TestData/nr2048.dat", "NR 2048", t); BenchMarkSignature >("TestData/lucs1024.dat", "LUC-HMP 1024", t); BenchMarkSignature >("TestData/esig2046.dat", "ESIGN 2046", t); cout << "\n"; BenchMarkKeyAgreement("TestData/xtrdh171.dat", "XTR-DH 171", t); BenchMarkKeyAgreement("TestData/xtrdh342.dat", "XTR-DH 342", t); BenchMarkKeyAgreement("TestData/dh1024.dat", "DH 1024", t); BenchMarkKeyAgreement("TestData/dh2048.dat", "DH 2048", t); BenchMarkKeyAgreement("TestData/lucd512.dat", "LUCDIF 512", t); BenchMarkKeyAgreement("TestData/lucd1024.dat", "LUCDIF 1024", t); BenchMarkKeyAgreement("TestData/mqv1024.dat", "MQV 1024", t); BenchMarkKeyAgreement("TestData/mqv2048.dat", "MQV 2048", t); #endif cout << "\n"; { ECIES::Decryptor cpriv(GlobalRNG(), ASN1::secp256k1()); ECIES::Encryptor cpub(cpriv); ECDSA::Signer spriv(cpriv); ECDSA::Verifier spub(spriv); ECDH::Domain ecdhc(ASN1::secp256k1()); ECMQV::Domain ecmqvc(ASN1::secp256k1()); BenchMarkEncryption("ECIES over GF(p) 256", cpub, t); BenchMarkDecryption("ECIES over GF(p) 256", cpriv, cpub, t); BenchMarkSigning("ECDSA over GF(p) 256", spriv, t); BenchMarkVerification("ECDSA over GF(p) 256", spriv, spub, t); BenchMarkKeyGen("ECDHC over GF(p) 256", ecdhc, t); BenchMarkAgreement("ECDHC over GF(p) 256", ecdhc, t); BenchMarkKeyGen("ECMQVC over GF(p) 256", ecmqvc, t); BenchMarkAgreement("ECMQVC over GF(p) 256", ecmqvc, t); } cout << "" << endl; { ECIES::Decryptor cpriv(GlobalRNG(), ASN1::sect233r1()); ECIES::Encryptor cpub(cpriv); ECDSA::Signer spriv(cpriv); ECDSA::Verifier spub(spriv); ECDH::Domain ecdhc(ASN1::sect233r1()); ECMQV::Domain ecmqvc(ASN1::sect233r1()); BenchMarkEncryption("ECIES over GF(2^n) 233", cpub, t); BenchMarkDecryption("ECIES over GF(2^n) 233", cpriv, cpub, t); BenchMarkSigning("ECDSA over GF(2^n) 233", spriv, t); BenchMarkVerification("ECDSA over GF(2^n) 233", spriv, spub, t); BenchMarkKeyGen("ECDHC over GF(2^n) 233", ecdhc, t); BenchMarkAgreement("ECDHC over GF(2^n) 233", ecdhc, t); BenchMarkKeyGen("ECMQVC over GF(2^n) 233", ecmqvc, t); BenchMarkAgreement("ECMQVC over GF(2^n) 233", ecmqvc, t); } cout << "
OperationMilliseconds/Operation" << (g_hertz ? "Megacycles/Operation" : "") << endl; cout << "\n
" << endl; } armory-0.92.3/cppForSwig/cryptopp/blumshub.h0000755000000000000000000000242612414772654017574 0ustar rootroot#ifndef CRYPTOPP_BLUMSHUB_H #define CRYPTOPP_BLUMSHUB_H #include "modarith.h" NAMESPACE_BEGIN(CryptoPP) class BlumGoldwasserPublicKey; class BlumGoldwasserPrivateKey; //! BlumBlumShub without factorization of the modulus class PublicBlumBlumShub : public RandomNumberGenerator, public StreamTransformation { public: PublicBlumBlumShub(const Integer &n, const Integer &seed); unsigned int GenerateBit(); byte GenerateByte(); void GenerateBlock(byte *output, size_t size); void ProcessData(byte *outString, const byte *inString, size_t length); bool IsSelfInverting() const {return true;} bool IsForwardTransformation() const {return true;} protected: ModularArithmetic modn; word maxBits, bitsLeft; Integer current; friend class BlumGoldwasserPublicKey; friend class BlumGoldwasserPrivateKey; }; //! BlumBlumShub with factorization of the modulus class BlumBlumShub : public PublicBlumBlumShub { public: // Make sure p and q are both primes congruent to 3 mod 4 and at least 512 bits long, // seed is the secret key and should be about as big as p*q BlumBlumShub(const Integer &p, const Integer &q, const Integer &seed); bool IsRandomAccess() const {return true;} void Seek(lword index); protected: const Integer p, q; const Integer x0; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/bfinit.cpp0000755000000000000000000003326212414772654017563 0ustar rootroot#include "pch.h" #include "blowfish.h" NAMESPACE_BEGIN(CryptoPP) const word32 Blowfish::Base::p_init[Blowfish::ROUNDS+2] = { 608135816U, 2242054355U, 320440878U, 57701188U, 2752067618U, 698298832U, 137296536U, 3964562569U, 1160258022U, 953160567U, 3193202383U, 887688300U, 3232508343U, 3380367581U, 1065670069U, 3041331479U, 2450970073U, 2306472731U } ; const word32 Blowfish::Base::s_init[4*256] = { 3509652390U, 2564797868U, 805139163U, 3491422135U, 3101798381U, 1780907670U, 3128725573U, 4046225305U, 614570311U, 3012652279U, 134345442U, 2240740374U, 1667834072U, 1901547113U, 2757295779U, 4103290238U, 227898511U, 1921955416U, 1904987480U, 2182433518U, 2069144605U, 3260701109U, 2620446009U, 720527379U, 3318853667U, 677414384U, 3393288472U, 3101374703U, 2390351024U, 1614419982U, 1822297739U, 2954791486U, 3608508353U, 3174124327U, 2024746970U, 1432378464U, 3864339955U, 2857741204U, 1464375394U, 1676153920U, 1439316330U, 715854006U, 3033291828U, 289532110U, 2706671279U, 2087905683U, 3018724369U, 1668267050U, 732546397U, 1947742710U, 3462151702U, 2609353502U, 2950085171U, 1814351708U, 2050118529U, 680887927U, 999245976U, 1800124847U, 3300911131U, 1713906067U, 1641548236U, 4213287313U, 1216130144U, 1575780402U, 4018429277U, 3917837745U, 3693486850U, 3949271944U, 596196993U, 3549867205U, 258830323U, 2213823033U, 772490370U, 2760122372U, 1774776394U, 2652871518U, 566650946U, 4142492826U, 1728879713U, 2882767088U, 1783734482U, 3629395816U, 2517608232U, 2874225571U, 1861159788U, 326777828U, 3124490320U, 2130389656U, 2716951837U, 967770486U, 1724537150U, 2185432712U, 2364442137U, 1164943284U, 2105845187U, 998989502U, 3765401048U, 2244026483U, 1075463327U, 1455516326U, 1322494562U, 910128902U, 469688178U, 1117454909U, 936433444U, 3490320968U, 3675253459U, 1240580251U, 122909385U, 2157517691U, 634681816U, 4142456567U, 3825094682U, 3061402683U, 2540495037U, 79693498U, 3249098678U, 1084186820U, 1583128258U, 426386531U, 1761308591U, 1047286709U, 322548459U, 995290223U, 1845252383U, 2603652396U, 3431023940U, 2942221577U, 3202600964U, 3727903485U, 1712269319U, 422464435U, 3234572375U, 1170764815U, 3523960633U, 3117677531U, 1434042557U, 442511882U, 3600875718U, 1076654713U, 1738483198U, 4213154764U, 2393238008U, 3677496056U, 1014306527U, 4251020053U, 793779912U, 2902807211U, 842905082U, 4246964064U, 1395751752U, 1040244610U, 2656851899U, 3396308128U, 445077038U, 3742853595U, 3577915638U, 679411651U, 2892444358U, 2354009459U, 1767581616U, 3150600392U, 3791627101U, 3102740896U, 284835224U, 4246832056U, 1258075500U, 768725851U, 2589189241U, 3069724005U, 3532540348U, 1274779536U, 3789419226U, 2764799539U, 1660621633U, 3471099624U, 4011903706U, 913787905U, 3497959166U, 737222580U, 2514213453U, 2928710040U, 3937242737U, 1804850592U, 3499020752U, 2949064160U, 2386320175U, 2390070455U, 2415321851U, 4061277028U, 2290661394U, 2416832540U, 1336762016U, 1754252060U, 3520065937U, 3014181293U, 791618072U, 3188594551U, 3933548030U, 2332172193U, 3852520463U, 3043980520U, 413987798U, 3465142937U, 3030929376U, 4245938359U, 2093235073U, 3534596313U, 375366246U, 2157278981U, 2479649556U, 555357303U, 3870105701U, 2008414854U, 3344188149U, 4221384143U, 3956125452U, 2067696032U, 3594591187U, 2921233993U, 2428461U, 544322398U, 577241275U, 1471733935U, 610547355U, 4027169054U, 1432588573U, 1507829418U, 2025931657U, 3646575487U, 545086370U, 48609733U, 2200306550U, 1653985193U, 298326376U, 1316178497U, 3007786442U, 2064951626U, 458293330U, 2589141269U, 3591329599U, 3164325604U, 727753846U, 2179363840U, 146436021U, 1461446943U, 4069977195U, 705550613U, 3059967265U, 3887724982U, 4281599278U, 3313849956U, 1404054877U, 2845806497U, 146425753U, 1854211946U, 1266315497U, 3048417604U, 3681880366U, 3289982499U, 2909710000U, 1235738493U, 2632868024U, 2414719590U, 3970600049U, 1771706367U, 1449415276U, 3266420449U, 422970021U, 1963543593U, 2690192192U, 3826793022U, 1062508698U, 1531092325U, 1804592342U, 2583117782U, 2714934279U, 4024971509U, 1294809318U, 4028980673U, 1289560198U, 2221992742U, 1669523910U, 35572830U, 157838143U, 1052438473U, 1016535060U, 1802137761U, 1753167236U, 1386275462U, 3080475397U, 2857371447U, 1040679964U, 2145300060U, 2390574316U, 1461121720U, 2956646967U, 4031777805U, 4028374788U, 33600511U, 2920084762U, 1018524850U, 629373528U, 3691585981U, 3515945977U, 2091462646U, 2486323059U, 586499841U, 988145025U, 935516892U, 3367335476U, 2599673255U, 2839830854U, 265290510U, 3972581182U, 2759138881U, 3795373465U, 1005194799U, 847297441U, 406762289U, 1314163512U, 1332590856U, 1866599683U, 4127851711U, 750260880U, 613907577U, 1450815602U, 3165620655U, 3734664991U, 3650291728U, 3012275730U, 3704569646U, 1427272223U, 778793252U, 1343938022U, 2676280711U, 2052605720U, 1946737175U, 3164576444U, 3914038668U, 3967478842U, 3682934266U, 1661551462U, 3294938066U, 4011595847U, 840292616U, 3712170807U, 616741398U, 312560963U, 711312465U, 1351876610U, 322626781U, 1910503582U, 271666773U, 2175563734U, 1594956187U, 70604529U, 3617834859U, 1007753275U, 1495573769U, 4069517037U, 2549218298U, 2663038764U, 504708206U, 2263041392U, 3941167025U, 2249088522U, 1514023603U, 1998579484U, 1312622330U, 694541497U, 2582060303U, 2151582166U, 1382467621U, 776784248U, 2618340202U, 3323268794U, 2497899128U, 2784771155U, 503983604U, 4076293799U, 907881277U, 423175695U, 432175456U, 1378068232U, 4145222326U, 3954048622U, 3938656102U, 3820766613U, 2793130115U, 2977904593U, 26017576U, 3274890735U, 3194772133U, 1700274565U, 1756076034U, 4006520079U, 3677328699U, 720338349U, 1533947780U, 354530856U, 688349552U, 3973924725U, 1637815568U, 332179504U, 3949051286U, 53804574U, 2852348879U, 3044236432U, 1282449977U, 3583942155U, 3416972820U, 4006381244U, 1617046695U, 2628476075U, 3002303598U, 1686838959U, 431878346U, 2686675385U, 1700445008U, 1080580658U, 1009431731U, 832498133U, 3223435511U, 2605976345U, 2271191193U, 2516031870U, 1648197032U, 4164389018U, 2548247927U, 300782431U, 375919233U, 238389289U, 3353747414U, 2531188641U, 2019080857U, 1475708069U, 455242339U, 2609103871U, 448939670U, 3451063019U, 1395535956U, 2413381860U, 1841049896U, 1491858159U, 885456874U, 4264095073U, 4001119347U, 1565136089U, 3898914787U, 1108368660U, 540939232U, 1173283510U, 2745871338U, 3681308437U, 4207628240U, 3343053890U, 4016749493U, 1699691293U, 1103962373U, 3625875870U, 2256883143U, 3830138730U, 1031889488U, 3479347698U, 1535977030U, 4236805024U, 3251091107U, 2132092099U, 1774941330U, 1199868427U, 1452454533U, 157007616U, 2904115357U, 342012276U, 595725824U, 1480756522U, 206960106U, 497939518U, 591360097U, 863170706U, 2375253569U, 3596610801U, 1814182875U, 2094937945U, 3421402208U, 1082520231U, 3463918190U, 2785509508U, 435703966U, 3908032597U, 1641649973U, 2842273706U, 3305899714U, 1510255612U, 2148256476U, 2655287854U, 3276092548U, 4258621189U, 236887753U, 3681803219U, 274041037U, 1734335097U, 3815195456U, 3317970021U, 1899903192U, 1026095262U, 4050517792U, 356393447U, 2410691914U, 3873677099U, 3682840055U, 3913112168U, 2491498743U, 4132185628U, 2489919796U, 1091903735U, 1979897079U, 3170134830U, 3567386728U, 3557303409U, 857797738U, 1136121015U, 1342202287U, 507115054U, 2535736646U, 337727348U, 3213592640U, 1301675037U, 2528481711U, 1895095763U, 1721773893U, 3216771564U, 62756741U, 2142006736U, 835421444U, 2531993523U, 1442658625U, 3659876326U, 2882144922U, 676362277U, 1392781812U, 170690266U, 3921047035U, 1759253602U, 3611846912U, 1745797284U, 664899054U, 1329594018U, 3901205900U, 3045908486U, 2062866102U, 2865634940U, 3543621612U, 3464012697U, 1080764994U, 553557557U, 3656615353U, 3996768171U, 991055499U, 499776247U, 1265440854U, 648242737U, 3940784050U, 980351604U, 3713745714U, 1749149687U, 3396870395U, 4211799374U, 3640570775U, 1161844396U, 3125318951U, 1431517754U, 545492359U, 4268468663U, 3499529547U, 1437099964U, 2702547544U, 3433638243U, 2581715763U, 2787789398U, 1060185593U, 1593081372U, 2418618748U, 4260947970U, 69676912U, 2159744348U, 86519011U, 2512459080U, 3838209314U, 1220612927U, 3339683548U, 133810670U, 1090789135U, 1078426020U, 1569222167U, 845107691U, 3583754449U, 4072456591U, 1091646820U, 628848692U, 1613405280U, 3757631651U, 526609435U, 236106946U, 48312990U, 2942717905U, 3402727701U, 1797494240U, 859738849U, 992217954U, 4005476642U, 2243076622U, 3870952857U, 3732016268U, 765654824U, 3490871365U, 2511836413U, 1685915746U, 3888969200U, 1414112111U, 2273134842U, 3281911079U, 4080962846U, 172450625U, 2569994100U, 980381355U, 4109958455U, 2819808352U, 2716589560U, 2568741196U, 3681446669U, 3329971472U, 1835478071U, 660984891U, 3704678404U, 4045999559U, 3422617507U, 3040415634U, 1762651403U, 1719377915U, 3470491036U, 2693910283U, 3642056355U, 3138596744U, 1364962596U, 2073328063U, 1983633131U, 926494387U, 3423689081U, 2150032023U, 4096667949U, 1749200295U, 3328846651U, 309677260U, 2016342300U, 1779581495U, 3079819751U, 111262694U, 1274766160U, 443224088U, 298511866U, 1025883608U, 3806446537U, 1145181785U, 168956806U, 3641502830U, 3584813610U, 1689216846U, 3666258015U, 3200248200U, 1692713982U, 2646376535U, 4042768518U, 1618508792U, 1610833997U, 3523052358U, 4130873264U, 2001055236U, 3610705100U, 2202168115U, 4028541809U, 2961195399U, 1006657119U, 2006996926U, 3186142756U, 1430667929U, 3210227297U, 1314452623U, 4074634658U, 4101304120U, 2273951170U, 1399257539U, 3367210612U, 3027628629U, 1190975929U, 2062231137U, 2333990788U, 2221543033U, 2438960610U, 1181637006U, 548689776U, 2362791313U, 3372408396U, 3104550113U, 3145860560U, 296247880U, 1970579870U, 3078560182U, 3769228297U, 1714227617U, 3291629107U, 3898220290U, 166772364U, 1251581989U, 493813264U, 448347421U, 195405023U, 2709975567U, 677966185U, 3703036547U, 1463355134U, 2715995803U, 1338867538U, 1343315457U, 2802222074U, 2684532164U, 233230375U, 2599980071U, 2000651841U, 3277868038U, 1638401717U, 4028070440U, 3237316320U, 6314154U, 819756386U, 300326615U, 590932579U, 1405279636U, 3267499572U, 3150704214U, 2428286686U, 3959192993U, 3461946742U, 1862657033U, 1266418056U, 963775037U, 2089974820U, 2263052895U, 1917689273U, 448879540U, 3550394620U, 3981727096U, 150775221U, 3627908307U, 1303187396U, 508620638U, 2975983352U, 2726630617U, 1817252668U, 1876281319U, 1457606340U, 908771278U, 3720792119U, 3617206836U, 2455994898U, 1729034894U, 1080033504U, 976866871U, 3556439503U, 2881648439U, 1522871579U, 1555064734U, 1336096578U, 3548522304U, 2579274686U, 3574697629U, 3205460757U, 3593280638U, 3338716283U, 3079412587U, 564236357U, 2993598910U, 1781952180U, 1464380207U, 3163844217U, 3332601554U, 1699332808U, 1393555694U, 1183702653U, 3581086237U, 1288719814U, 691649499U, 2847557200U, 2895455976U, 3193889540U, 2717570544U, 1781354906U, 1676643554U, 2592534050U, 3230253752U, 1126444790U, 2770207658U, 2633158820U, 2210423226U, 2615765581U, 2414155088U, 3127139286U, 673620729U, 2805611233U, 1269405062U, 4015350505U, 3341807571U, 4149409754U, 1057255273U, 2012875353U, 2162469141U, 2276492801U, 2601117357U, 993977747U, 3918593370U, 2654263191U, 753973209U, 36408145U, 2530585658U, 25011837U, 3520020182U, 2088578344U, 530523599U, 2918365339U, 1524020338U, 1518925132U, 3760827505U, 3759777254U, 1202760957U, 3985898139U, 3906192525U, 674977740U, 4174734889U, 2031300136U, 2019492241U, 3983892565U, 4153806404U, 3822280332U, 352677332U, 2297720250U, 60907813U, 90501309U, 3286998549U, 1016092578U, 2535922412U, 2839152426U, 457141659U, 509813237U, 4120667899U, 652014361U, 1966332200U, 2975202805U, 55981186U, 2327461051U, 676427537U, 3255491064U, 2882294119U, 3433927263U, 1307055953U, 942726286U, 933058658U, 2468411793U, 3933900994U, 4215176142U, 1361170020U, 2001714738U, 2830558078U, 3274259782U, 1222529897U, 1679025792U, 2729314320U, 3714953764U, 1770335741U, 151462246U, 3013232138U, 1682292957U, 1483529935U, 471910574U, 1539241949U, 458788160U, 3436315007U, 1807016891U, 3718408830U, 978976581U, 1043663428U, 3165965781U, 1927990952U, 4200891579U, 2372276910U, 3208408903U, 3533431907U, 1412390302U, 2931980059U, 4132332400U, 1947078029U, 3881505623U, 4168226417U, 2941484381U, 1077988104U, 1320477388U, 886195818U, 18198404U, 3786409000U, 2509781533U, 112762804U, 3463356488U, 1866414978U, 891333506U, 18488651U, 661792760U, 1628790961U, 3885187036U, 3141171499U, 876946877U, 2693282273U, 1372485963U, 791857591U, 2686433993U, 3759982718U, 3167212022U, 3472953795U, 2716379847U, 445679433U, 3561995674U, 3504004811U, 3574258232U, 54117162U, 3331405415U, 2381918588U, 3769707343U, 4154350007U, 1140177722U, 4074052095U, 668550556U, 3214352940U, 367459370U, 261225585U, 2610173221U, 4209349473U, 3468074219U, 3265815641U, 314222801U, 3066103646U, 3808782860U, 282218597U, 3406013506U, 3773591054U, 379116347U, 1285071038U, 846784868U, 2669647154U, 3771962079U, 3550491691U, 2305946142U, 453669953U, 1268987020U, 3317592352U, 3279303384U, 3744833421U, 2610507566U, 3859509063U, 266596637U, 3847019092U, 517658769U, 3462560207U, 3443424879U, 370717030U, 4247526661U, 2224018117U, 4143653529U, 4112773975U, 2788324899U, 2477274417U, 1456262402U, 2901442914U, 1517677493U, 1846949527U, 2295493580U, 3734397586U, 2176403920U, 1280348187U, 1908823572U, 3871786941U, 846861322U, 1172426758U, 3287448474U, 3383383037U, 1655181056U, 3139813346U, 901632758U, 1897031941U, 2986607138U, 3066810236U, 3447102507U, 1393639104U, 373351379U, 950779232U, 625454576U, 3124240540U, 4148612726U, 2007998917U, 544563296U, 2244738638U, 2330496472U, 2058025392U, 1291430526U, 424198748U, 50039436U, 29584100U, 3605783033U, 2429876329U, 2791104160U, 1057563949U, 3255363231U, 3075367218U, 3463963227U, 1469046755U, 985887462U }; NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/filters.cpp0000755000000000000000000010235612414772654017761 0ustar rootroot// filters.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "filters.h" #include "mqueue.h" #include "fltrimpl.h" #include "argnames.h" #include #include NAMESPACE_BEGIN(CryptoPP) Filter::Filter(BufferedTransformation *attachment) : m_attachment(attachment), m_continueAt(0) { } BufferedTransformation * Filter::NewDefaultAttachment() const { return new MessageQueue; } BufferedTransformation * Filter::AttachedTransformation() { if (m_attachment.get() == NULL) m_attachment.reset(NewDefaultAttachment()); return m_attachment.get(); } const BufferedTransformation *Filter::AttachedTransformation() const { if (m_attachment.get() == NULL) const_cast(this)->m_attachment.reset(NewDefaultAttachment()); return m_attachment.get(); } void Filter::Detach(BufferedTransformation *newOut) { m_attachment.reset(newOut); } void Filter::Insert(Filter *filter) { filter->m_attachment.reset(m_attachment.release()); m_attachment.reset(filter); } size_t Filter::CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end, const std::string &channel, bool blocking) const { return AttachedTransformation()->CopyRangeTo2(target, begin, end, channel, blocking); } size_t Filter::TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel, bool blocking) { return AttachedTransformation()->TransferTo2(target, transferBytes, channel, blocking); } void Filter::Initialize(const NameValuePairs ¶meters, int propagation) { m_continueAt = 0; IsolatedInitialize(parameters); PropagateInitialize(parameters, propagation); } bool Filter::Flush(bool hardFlush, int propagation, bool blocking) { switch (m_continueAt) { case 0: if (IsolatedFlush(hardFlush, blocking)) return true; case 1: if (OutputFlush(1, hardFlush, propagation, blocking)) return true; } return false; } bool Filter::MessageSeriesEnd(int propagation, bool blocking) { switch (m_continueAt) { case 0: if (IsolatedMessageSeriesEnd(blocking)) return true; case 1: if (ShouldPropagateMessageSeriesEnd() && OutputMessageSeriesEnd(1, propagation, blocking)) return true; } return false; } void Filter::PropagateInitialize(const NameValuePairs ¶meters, int propagation) { if (propagation) AttachedTransformation()->Initialize(parameters, propagation-1); } size_t Filter::OutputModifiable(int outputSite, byte *inString, size_t length, int messageEnd, bool blocking, const std::string &channel) { if (messageEnd) messageEnd--; size_t result = AttachedTransformation()->ChannelPutModifiable2(channel, inString, length, messageEnd, blocking); m_continueAt = result ? outputSite : 0; return result; } size_t Filter::Output(int outputSite, const byte *inString, size_t length, int messageEnd, bool blocking, const std::string &channel) { if (messageEnd) messageEnd--; size_t result = AttachedTransformation()->ChannelPut2(channel, inString, length, messageEnd, blocking); m_continueAt = result ? outputSite : 0; return result; } bool Filter::OutputFlush(int outputSite, bool hardFlush, int propagation, bool blocking, const std::string &channel) { if (propagation && AttachedTransformation()->ChannelFlush(channel, hardFlush, propagation-1, blocking)) { m_continueAt = outputSite; return true; } m_continueAt = 0; return false; } bool Filter::OutputMessageSeriesEnd(int outputSite, int propagation, bool blocking, const std::string &channel) { if (propagation && AttachedTransformation()->ChannelMessageSeriesEnd(channel, propagation-1, blocking)) { m_continueAt = outputSite; return true; } m_continueAt = 0; return false; } // ************************************************************* void MeterFilter::ResetMeter() { m_currentMessageBytes = m_totalBytes = m_currentSeriesMessages = m_totalMessages = m_totalMessageSeries = 0; m_rangesToSkip.clear(); } void MeterFilter::AddRangeToSkip(unsigned int message, lword position, lword size, bool sortNow) { MessageRange r = {message, position, size}; m_rangesToSkip.push_back(r); if (sortNow) std::sort(m_rangesToSkip.begin(), m_rangesToSkip.end()); } size_t MeterFilter::PutMaybeModifiable(byte *begin, size_t length, int messageEnd, bool blocking, bool modifiable) { if (!m_transparent) return 0; size_t t; FILTER_BEGIN; m_begin = begin; m_length = length; while (m_length > 0 || messageEnd) { if (m_length > 0 && !m_rangesToSkip.empty() && m_rangesToSkip.front().message == m_totalMessages && m_currentMessageBytes + m_length > m_rangesToSkip.front().position) { FILTER_OUTPUT_MAYBE_MODIFIABLE(1, m_begin, t = (size_t)SaturatingSubtract(m_rangesToSkip.front().position, m_currentMessageBytes), false, modifiable); assert(t < m_length); m_begin += t; m_length -= t; m_currentMessageBytes += t; m_totalBytes += t; if (m_currentMessageBytes + m_length < m_rangesToSkip.front().position + m_rangesToSkip.front().size) t = m_length; else { t = (size_t)SaturatingSubtract(m_rangesToSkip.front().position + m_rangesToSkip.front().size, m_currentMessageBytes); assert(t <= m_length); m_rangesToSkip.pop_front(); } m_begin += t; m_length -= t; m_currentMessageBytes += t; m_totalBytes += t; } else { FILTER_OUTPUT_MAYBE_MODIFIABLE(2, m_begin, m_length, messageEnd, modifiable); m_currentMessageBytes += m_length; m_totalBytes += m_length; m_length = 0; if (messageEnd) { m_currentMessageBytes = 0; m_currentSeriesMessages++; m_totalMessages++; messageEnd = false; } } } FILTER_END_NO_MESSAGE_END; } size_t MeterFilter::Put2(const byte *begin, size_t length, int messageEnd, bool blocking) { return PutMaybeModifiable(const_cast(begin), length, messageEnd, blocking, false); } size_t MeterFilter::PutModifiable2(byte *begin, size_t length, int messageEnd, bool blocking) { return PutMaybeModifiable(begin, length, messageEnd, blocking, true); } bool MeterFilter::IsolatedMessageSeriesEnd(bool blocking) { m_currentMessageBytes = 0; m_currentSeriesMessages = 0; m_totalMessageSeries++; return false; } // ************************************************************* void FilterWithBufferedInput::BlockQueue::ResetQueue(size_t blockSize, size_t maxBlocks) { m_buffer.New(blockSize * maxBlocks); m_blockSize = blockSize; m_maxBlocks = maxBlocks; m_size = 0; m_begin = m_buffer; } byte *FilterWithBufferedInput::BlockQueue::GetBlock() { if (m_size >= m_blockSize) { byte *ptr = m_begin; if ((m_begin+=m_blockSize) == m_buffer.end()) m_begin = m_buffer; m_size -= m_blockSize; return ptr; } else return NULL; } byte *FilterWithBufferedInput::BlockQueue::GetContigousBlocks(size_t &numberOfBytes) { numberOfBytes = STDMIN(numberOfBytes, STDMIN(size_t(m_buffer.end()-m_begin), m_size)); byte *ptr = m_begin; m_begin += numberOfBytes; m_size -= numberOfBytes; if (m_size == 0 || m_begin == m_buffer.end()) m_begin = m_buffer; return ptr; } size_t FilterWithBufferedInput::BlockQueue::GetAll(byte *outString) { size_t size = m_size; size_t numberOfBytes = m_maxBlocks*m_blockSize; const byte *ptr = GetContigousBlocks(numberOfBytes); memcpy(outString, ptr, numberOfBytes); memcpy(outString+numberOfBytes, m_begin, m_size); m_size = 0; return size; } void FilterWithBufferedInput::BlockQueue::Put(const byte *inString, size_t length) { assert(m_size + length <= m_buffer.size()); byte *end = (m_size < size_t(m_buffer.end()-m_begin)) ? m_begin + m_size : m_begin + m_size - m_buffer.size(); size_t len = STDMIN(length, size_t(m_buffer.end()-end)); memcpy(end, inString, len); if (len < length) memcpy(m_buffer, inString+len, length-len); m_size += length; } FilterWithBufferedInput::FilterWithBufferedInput(BufferedTransformation *attachment) : Filter(attachment) { } FilterWithBufferedInput::FilterWithBufferedInput(size_t firstSize, size_t blockSize, size_t lastSize, BufferedTransformation *attachment) : Filter(attachment), m_firstSize(firstSize), m_blockSize(blockSize), m_lastSize(lastSize) , m_firstInputDone(false) { if (m_firstSize < 0 || m_blockSize < 1 || m_lastSize < 0) throw InvalidArgument("FilterWithBufferedInput: invalid buffer size"); m_queue.ResetQueue(1, m_firstSize); } void FilterWithBufferedInput::IsolatedInitialize(const NameValuePairs ¶meters) { InitializeDerivedAndReturnNewSizes(parameters, m_firstSize, m_blockSize, m_lastSize); if (m_firstSize < 0 || m_blockSize < 1 || m_lastSize < 0) throw InvalidArgument("FilterWithBufferedInput: invalid buffer size"); m_queue.ResetQueue(1, m_firstSize); m_firstInputDone = false; } bool FilterWithBufferedInput::IsolatedFlush(bool hardFlush, bool blocking) { if (!blocking) throw BlockingInputOnly("FilterWithBufferedInput"); if (hardFlush) ForceNextPut(); FlushDerived(); return false; } size_t FilterWithBufferedInput::PutMaybeModifiable(byte *inString, size_t length, int messageEnd, bool blocking, bool modifiable) { if (!blocking) throw BlockingInputOnly("FilterWithBufferedInput"); if (length != 0) { size_t newLength = m_queue.CurrentSize() + length; if (!m_firstInputDone && newLength >= m_firstSize) { size_t len = m_firstSize - m_queue.CurrentSize(); m_queue.Put(inString, len); FirstPut(m_queue.GetContigousBlocks(m_firstSize)); assert(m_queue.CurrentSize() == 0); m_queue.ResetQueue(m_blockSize, (2*m_blockSize+m_lastSize-2)/m_blockSize); inString += len; newLength -= m_firstSize; m_firstInputDone = true; } if (m_firstInputDone) { if (m_blockSize == 1) { while (newLength > m_lastSize && m_queue.CurrentSize() > 0) { size_t len = newLength - m_lastSize; byte *ptr = m_queue.GetContigousBlocks(len); NextPutModifiable(ptr, len); newLength -= len; } if (newLength > m_lastSize) { size_t len = newLength - m_lastSize; NextPutMaybeModifiable(inString, len, modifiable); inString += len; newLength -= len; } } else { while (newLength >= m_blockSize + m_lastSize && m_queue.CurrentSize() >= m_blockSize) { NextPutModifiable(m_queue.GetBlock(), m_blockSize); newLength -= m_blockSize; } if (newLength >= m_blockSize + m_lastSize && m_queue.CurrentSize() > 0) { assert(m_queue.CurrentSize() < m_blockSize); size_t len = m_blockSize - m_queue.CurrentSize(); m_queue.Put(inString, len); inString += len; NextPutModifiable(m_queue.GetBlock(), m_blockSize); newLength -= m_blockSize; } if (newLength >= m_blockSize + m_lastSize) { size_t len = RoundDownToMultipleOf(newLength - m_lastSize, m_blockSize); NextPutMaybeModifiable(inString, len, modifiable); inString += len; newLength -= len; } } } m_queue.Put(inString, newLength - m_queue.CurrentSize()); } if (messageEnd) { if (!m_firstInputDone && m_firstSize==0) FirstPut(NULL); SecByteBlock temp(m_queue.CurrentSize()); m_queue.GetAll(temp); LastPut(temp, temp.size()); m_firstInputDone = false; m_queue.ResetQueue(1, m_firstSize); Output(1, NULL, 0, messageEnd, blocking); } return 0; } void FilterWithBufferedInput::ForceNextPut() { if (!m_firstInputDone) return; if (m_blockSize > 1) { while (m_queue.CurrentSize() >= m_blockSize) NextPutModifiable(m_queue.GetBlock(), m_blockSize); } else { size_t len; while ((len = m_queue.CurrentSize()) > 0) NextPutModifiable(m_queue.GetContigousBlocks(len), len); } } void FilterWithBufferedInput::NextPutMultiple(const byte *inString, size_t length) { assert(m_blockSize > 1); // m_blockSize = 1 should always override this function while (length > 0) { assert(length >= m_blockSize); NextPutSingle(inString); inString += m_blockSize; length -= m_blockSize; } } // ************************************************************* void Redirector::Initialize(const NameValuePairs ¶meters, int propagation) { m_target = parameters.GetValueWithDefault("RedirectionTargetPointer", (BufferedTransformation*)NULL); m_behavior = parameters.GetIntValueWithDefault("RedirectionBehavior", PASS_EVERYTHING); if (m_target && GetPassSignals()) m_target->Initialize(parameters, propagation); } // ************************************************************* ProxyFilter::ProxyFilter(BufferedTransformation *filter, size_t firstSize, size_t lastSize, BufferedTransformation *attachment) : FilterWithBufferedInput(firstSize, 1, lastSize, attachment), m_filter(filter) { if (m_filter.get()) m_filter->Attach(new OutputProxy(*this, false)); } bool ProxyFilter::IsolatedFlush(bool hardFlush, bool blocking) { return m_filter.get() ? m_filter->Flush(hardFlush, -1, blocking) : false; } void ProxyFilter::SetFilter(Filter *filter) { m_filter.reset(filter); if (filter) { OutputProxy *proxy; std::auto_ptr temp(proxy = new OutputProxy(*this, false)); m_filter->TransferAllTo(*proxy); m_filter->Attach(temp.release()); } } void ProxyFilter::NextPutMultiple(const byte *s, size_t len) { if (m_filter.get()) m_filter->Put(s, len); } void ProxyFilter::NextPutModifiable(byte *s, size_t len) { if (m_filter.get()) m_filter->PutModifiable(s, len); } // ************************************************************* void RandomNumberSink::IsolatedInitialize(const NameValuePairs ¶meters) { parameters.GetRequiredParameter("RandomNumberSink", "RandomNumberGeneratorPointer", m_rng); } size_t RandomNumberSink::Put2(const byte *begin, size_t length, int messageEnd, bool blocking) { m_rng->IncorporateEntropy(begin, length); return 0; } size_t ArraySink::Put2(const byte *begin, size_t length, int messageEnd, bool blocking) { if (m_buf+m_total != begin) memcpy(m_buf+m_total, begin, STDMIN(length, SaturatingSubtract(m_size, m_total))); m_total += length; return 0; } byte * ArraySink::CreatePutSpace(size_t &size) { size = SaturatingSubtract(m_size, m_total); return m_buf + m_total; } void ArraySink::IsolatedInitialize(const NameValuePairs ¶meters) { ByteArrayParameter array; if (!parameters.GetValue(Name::OutputBuffer(), array)) throw InvalidArgument("ArraySink: missing OutputBuffer argument"); m_buf = array.begin(); m_size = array.size(); m_total = 0; } size_t ArrayXorSink::Put2(const byte *begin, size_t length, int messageEnd, bool blocking) { xorbuf(m_buf+m_total, begin, STDMIN(length, SaturatingSubtract(m_size, m_total))); m_total += length; return 0; } // ************************************************************* StreamTransformationFilter::StreamTransformationFilter(StreamTransformation &c, BufferedTransformation *attachment, BlockPaddingScheme padding, bool allowAuthenticatedSymmetricCipher) : FilterWithBufferedInput(attachment) , m_cipher(c) { assert(c.MinLastBlockSize() == 0 || c.MinLastBlockSize() > c.MandatoryBlockSize()); if (!allowAuthenticatedSymmetricCipher && dynamic_cast(&c) != 0) throw InvalidArgument("StreamTransformationFilter: please use AuthenticatedEncryptionFilter and AuthenticatedDecryptionFilter for AuthenticatedSymmetricCipher"); IsolatedInitialize(MakeParameters(Name::BlockPaddingScheme(), padding)); } size_t StreamTransformationFilter::LastBlockSize(StreamTransformation &c, BlockPaddingScheme padding) { if (c.MinLastBlockSize() > 0) return c.MinLastBlockSize(); else if (c.MandatoryBlockSize() > 1 && !c.IsForwardTransformation() && padding != NO_PADDING && padding != ZEROS_PADDING) return c.MandatoryBlockSize(); else return 0; } void StreamTransformationFilter::InitializeDerivedAndReturnNewSizes(const NameValuePairs ¶meters, size_t &firstSize, size_t &blockSize, size_t &lastSize) { BlockPaddingScheme padding = parameters.GetValueWithDefault(Name::BlockPaddingScheme(), DEFAULT_PADDING); bool isBlockCipher = (m_cipher.MandatoryBlockSize() > 1 && m_cipher.MinLastBlockSize() == 0); if (padding == DEFAULT_PADDING) m_padding = isBlockCipher ? PKCS_PADDING : NO_PADDING; else m_padding = padding; if (!isBlockCipher && (m_padding == PKCS_PADDING || m_padding == ONE_AND_ZEROS_PADDING)) throw InvalidArgument("StreamTransformationFilter: PKCS_PADDING and ONE_AND_ZEROS_PADDING cannot be used with " + m_cipher.AlgorithmName()); firstSize = 0; blockSize = m_cipher.MandatoryBlockSize(); lastSize = LastBlockSize(m_cipher, m_padding); } void StreamTransformationFilter::FirstPut(const byte *inString) { m_optimalBufferSize = m_cipher.OptimalBlockSize(); m_optimalBufferSize = (unsigned int)STDMAX(m_optimalBufferSize, RoundDownToMultipleOf(4096U, m_optimalBufferSize)); } void StreamTransformationFilter::NextPutMultiple(const byte *inString, size_t length) { if (!length) return; size_t s = m_cipher.MandatoryBlockSize(); do { size_t len = m_optimalBufferSize; byte *space = HelpCreatePutSpace(*AttachedTransformation(), DEFAULT_CHANNEL, s, length, len); if (len < length) { if (len == m_optimalBufferSize) len -= m_cipher.GetOptimalBlockSizeUsed(); len = RoundDownToMultipleOf(len, s); } else len = length; m_cipher.ProcessString(space, inString, len); AttachedTransformation()->PutModifiable(space, len); inString += len; length -= len; } while (length > 0); } void StreamTransformationFilter::NextPutModifiable(byte *inString, size_t length) { m_cipher.ProcessString(inString, length); AttachedTransformation()->PutModifiable(inString, length); } void StreamTransformationFilter::LastPut(const byte *inString, size_t length) { byte *space = NULL; switch (m_padding) { case NO_PADDING: case ZEROS_PADDING: if (length > 0) { size_t minLastBlockSize = m_cipher.MinLastBlockSize(); bool isForwardTransformation = m_cipher.IsForwardTransformation(); if (isForwardTransformation && m_padding == ZEROS_PADDING && (minLastBlockSize == 0 || length < minLastBlockSize)) { // do padding size_t blockSize = STDMAX(minLastBlockSize, (size_t)m_cipher.MandatoryBlockSize()); space = HelpCreatePutSpace(*AttachedTransformation(), DEFAULT_CHANNEL, blockSize); memcpy(space, inString, length); memset(space + length, 0, blockSize - length); m_cipher.ProcessLastBlock(space, space, blockSize); AttachedTransformation()->Put(space, blockSize); } else { if (minLastBlockSize == 0) { if (isForwardTransformation) throw InvalidDataFormat("StreamTransformationFilter: plaintext length is not a multiple of block size and NO_PADDING is specified"); else throw InvalidCiphertext("StreamTransformationFilter: ciphertext length is not a multiple of block size"); } space = HelpCreatePutSpace(*AttachedTransformation(), DEFAULT_CHANNEL, length, m_optimalBufferSize); m_cipher.ProcessLastBlock(space, inString, length); AttachedTransformation()->Put(space, length); } } break; case PKCS_PADDING: case ONE_AND_ZEROS_PADDING: unsigned int s; s = m_cipher.MandatoryBlockSize(); assert(s > 1); space = HelpCreatePutSpace(*AttachedTransformation(), DEFAULT_CHANNEL, s, m_optimalBufferSize); if (m_cipher.IsForwardTransformation()) { assert(length < s); memcpy(space, inString, length); if (m_padding == PKCS_PADDING) { assert(s < 256); byte pad = byte(s-length); memset(space+length, pad, s-length); } else { space[length] = 0x80; memset(space+length+1, 0, s-length-1); } m_cipher.ProcessData(space, space, s); AttachedTransformation()->Put(space, s); } else { if (length != s) throw InvalidCiphertext("StreamTransformationFilter: ciphertext length is not a multiple of block size"); m_cipher.ProcessData(space, inString, s); if (m_padding == PKCS_PADDING) { byte pad = space[s-1]; if (pad < 1 || pad > s || std::find_if(space+s-pad, space+s, std::bind2nd(std::not_equal_to(), pad)) != space+s) throw InvalidCiphertext("StreamTransformationFilter: invalid PKCS #7 block padding found"); length = s-pad; } else { while (length > 1 && space[length-1] == 0) --length; if (space[--length] != 0x80) throw InvalidCiphertext("StreamTransformationFilter: invalid ones-and-zeros padding found"); } AttachedTransformation()->Put(space, length); } break; default: assert(false); } } // ************************************************************* HashFilter::HashFilter(HashTransformation &hm, BufferedTransformation *attachment, bool putMessage, int truncatedDigestSize, const std::string &messagePutChannel, const std::string &hashPutChannel) : m_hashModule(hm), m_putMessage(putMessage), m_messagePutChannel(messagePutChannel), m_hashPutChannel(hashPutChannel) { m_digestSize = truncatedDigestSize < 0 ? m_hashModule.DigestSize() : truncatedDigestSize; Detach(attachment); } void HashFilter::IsolatedInitialize(const NameValuePairs ¶meters) { m_putMessage = parameters.GetValueWithDefault(Name::PutMessage(), false); int s = parameters.GetIntValueWithDefault(Name::TruncatedDigestSize(), -1); m_digestSize = s < 0 ? m_hashModule.DigestSize() : s; } size_t HashFilter::Put2(const byte *inString, size_t length, int messageEnd, bool blocking) { FILTER_BEGIN; if (m_putMessage) FILTER_OUTPUT3(1, 0, inString, length, 0, m_messagePutChannel); m_hashModule.Update(inString, length); if (messageEnd) { { size_t size; m_space = HelpCreatePutSpace(*AttachedTransformation(), m_hashPutChannel, m_digestSize, m_digestSize, size = m_digestSize); m_hashModule.TruncatedFinal(m_space, m_digestSize); } FILTER_OUTPUT3(2, 0, m_space, m_digestSize, messageEnd, m_hashPutChannel); } FILTER_END_NO_MESSAGE_END; } // ************************************************************* HashVerificationFilter::HashVerificationFilter(HashTransformation &hm, BufferedTransformation *attachment, word32 flags, int truncatedDigestSize) : FilterWithBufferedInput(attachment) , m_hashModule(hm) { IsolatedInitialize(MakeParameters(Name::HashVerificationFilterFlags(), flags)(Name::TruncatedDigestSize(), truncatedDigestSize)); } void HashVerificationFilter::InitializeDerivedAndReturnNewSizes(const NameValuePairs ¶meters, size_t &firstSize, size_t &blockSize, size_t &lastSize) { m_flags = parameters.GetValueWithDefault(Name::HashVerificationFilterFlags(), (word32)DEFAULT_FLAGS); int s = parameters.GetIntValueWithDefault(Name::TruncatedDigestSize(), -1); m_digestSize = s < 0 ? m_hashModule.DigestSize() : s; m_verified = false; firstSize = m_flags & HASH_AT_BEGIN ? m_digestSize : 0; blockSize = 1; lastSize = m_flags & HASH_AT_BEGIN ? 0 : m_digestSize; } void HashVerificationFilter::FirstPut(const byte *inString) { if (m_flags & HASH_AT_BEGIN) { m_expectedHash.New(m_digestSize); memcpy(m_expectedHash, inString, m_expectedHash.size()); if (m_flags & PUT_HASH) AttachedTransformation()->Put(inString, m_expectedHash.size()); } } void HashVerificationFilter::NextPutMultiple(const byte *inString, size_t length) { m_hashModule.Update(inString, length); if (m_flags & PUT_MESSAGE) AttachedTransformation()->Put(inString, length); } void HashVerificationFilter::LastPut(const byte *inString, size_t length) { if (m_flags & HASH_AT_BEGIN) { assert(length == 0); m_verified = m_hashModule.TruncatedVerify(m_expectedHash, m_digestSize); } else { m_verified = (length==m_digestSize && m_hashModule.TruncatedVerify(inString, length)); if (m_flags & PUT_HASH) AttachedTransformation()->Put(inString, length); } if (m_flags & PUT_RESULT) AttachedTransformation()->Put(m_verified); if ((m_flags & THROW_EXCEPTION) && !m_verified) throw HashVerificationFailed(); } // ************************************************************* AuthenticatedEncryptionFilter::AuthenticatedEncryptionFilter(AuthenticatedSymmetricCipher &c, BufferedTransformation *attachment, bool putAAD, int truncatedDigestSize, const std::string &macChannel, BlockPaddingScheme padding) : StreamTransformationFilter(c, attachment, padding, true) , m_hf(c, new OutputProxy(*this, false), putAAD, truncatedDigestSize, AAD_CHANNEL, macChannel) { assert(c.IsForwardTransformation()); } void AuthenticatedEncryptionFilter::IsolatedInitialize(const NameValuePairs ¶meters) { m_hf.IsolatedInitialize(parameters); StreamTransformationFilter::IsolatedInitialize(parameters); } byte * AuthenticatedEncryptionFilter::ChannelCreatePutSpace(const std::string &channel, size_t &size) { if (channel.empty()) return StreamTransformationFilter::CreatePutSpace(size); if (channel == AAD_CHANNEL) return m_hf.CreatePutSpace(size); throw InvalidChannelName("AuthenticatedEncryptionFilter", channel); } size_t AuthenticatedEncryptionFilter::ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking) { if (channel.empty()) return StreamTransformationFilter::Put2(begin, length, messageEnd, blocking); if (channel == AAD_CHANNEL) return m_hf.Put2(begin, length, 0, blocking); throw InvalidChannelName("AuthenticatedEncryptionFilter", channel); } void AuthenticatedEncryptionFilter::LastPut(const byte *inString, size_t length) { StreamTransformationFilter::LastPut(inString, length); m_hf.MessageEnd(); } // ************************************************************* AuthenticatedDecryptionFilter::AuthenticatedDecryptionFilter(AuthenticatedSymmetricCipher &c, BufferedTransformation *attachment, word32 flags, int truncatedDigestSize, BlockPaddingScheme padding) : FilterWithBufferedInput(attachment) , m_hashVerifier(c, new OutputProxy(*this, false)) , m_streamFilter(c, new OutputProxy(*this, false), padding, true) { assert(!c.IsForwardTransformation() || c.IsSelfInverting()); IsolatedInitialize(MakeParameters(Name::BlockPaddingScheme(), padding)(Name::AuthenticatedDecryptionFilterFlags(), flags)(Name::TruncatedDigestSize(), truncatedDigestSize)); } void AuthenticatedDecryptionFilter::InitializeDerivedAndReturnNewSizes(const NameValuePairs ¶meters, size_t &firstSize, size_t &blockSize, size_t &lastSize) { word32 flags = parameters.GetValueWithDefault(Name::AuthenticatedDecryptionFilterFlags(), (word32)DEFAULT_FLAGS); m_hashVerifier.Initialize(CombinedNameValuePairs(parameters, MakeParameters(Name::HashVerificationFilterFlags(), flags))); m_streamFilter.Initialize(parameters); firstSize = m_hashVerifier.m_firstSize; blockSize = 1; lastSize = m_hashVerifier.m_lastSize; } byte * AuthenticatedDecryptionFilter::ChannelCreatePutSpace(const std::string &channel, size_t &size) { if (channel.empty()) return m_streamFilter.CreatePutSpace(size); if (channel == AAD_CHANNEL) return m_hashVerifier.CreatePutSpace(size); throw InvalidChannelName("AuthenticatedDecryptionFilter", channel); } size_t AuthenticatedDecryptionFilter::ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking) { if (channel.empty()) { if (m_lastSize > 0) m_hashVerifier.ForceNextPut(); return FilterWithBufferedInput::Put2(begin, length, messageEnd, blocking); } if (channel == AAD_CHANNEL) return m_hashVerifier.Put2(begin, length, 0, blocking); throw InvalidChannelName("AuthenticatedDecryptionFilter", channel); } void AuthenticatedDecryptionFilter::FirstPut(const byte *inString) { m_hashVerifier.Put(inString, m_firstSize); } void AuthenticatedDecryptionFilter::NextPutMultiple(const byte *inString, size_t length) { m_streamFilter.Put(inString, length); } void AuthenticatedDecryptionFilter::LastPut(const byte *inString, size_t length) { m_streamFilter.MessageEnd(); m_hashVerifier.PutMessageEnd(inString, length); } // ************************************************************* void SignerFilter::IsolatedInitialize(const NameValuePairs ¶meters) { m_putMessage = parameters.GetValueWithDefault(Name::PutMessage(), false); m_messageAccumulator.reset(m_signer.NewSignatureAccumulator(m_rng)); } size_t SignerFilter::Put2(const byte *inString, size_t length, int messageEnd, bool blocking) { FILTER_BEGIN; m_messageAccumulator->Update(inString, length); if (m_putMessage) FILTER_OUTPUT(1, inString, length, 0); if (messageEnd) { m_buf.New(m_signer.SignatureLength()); m_signer.Sign(m_rng, m_messageAccumulator.release(), m_buf); FILTER_OUTPUT(2, m_buf, m_buf.size(), messageEnd); m_messageAccumulator.reset(m_signer.NewSignatureAccumulator(m_rng)); } FILTER_END_NO_MESSAGE_END; } SignatureVerificationFilter::SignatureVerificationFilter(const PK_Verifier &verifier, BufferedTransformation *attachment, word32 flags) : FilterWithBufferedInput(attachment) , m_verifier(verifier) { IsolatedInitialize(MakeParameters(Name::SignatureVerificationFilterFlags(), flags)); } void SignatureVerificationFilter::InitializeDerivedAndReturnNewSizes(const NameValuePairs ¶meters, size_t &firstSize, size_t &blockSize, size_t &lastSize) { m_flags = parameters.GetValueWithDefault(Name::SignatureVerificationFilterFlags(), (word32)DEFAULT_FLAGS); m_messageAccumulator.reset(m_verifier.NewVerificationAccumulator()); size_t size = m_verifier.SignatureLength(); assert(size != 0); // TODO: handle recoverable signature scheme m_verified = false; firstSize = m_flags & SIGNATURE_AT_BEGIN ? size : 0; blockSize = 1; lastSize = m_flags & SIGNATURE_AT_BEGIN ? 0 : size; } void SignatureVerificationFilter::FirstPut(const byte *inString) { if (m_flags & SIGNATURE_AT_BEGIN) { if (m_verifier.SignatureUpfront()) m_verifier.InputSignature(*m_messageAccumulator, inString, m_verifier.SignatureLength()); else { m_signature.New(m_verifier.SignatureLength()); memcpy(m_signature, inString, m_signature.size()); } if (m_flags & PUT_SIGNATURE) AttachedTransformation()->Put(inString, m_signature.size()); } else { assert(!m_verifier.SignatureUpfront()); } } void SignatureVerificationFilter::NextPutMultiple(const byte *inString, size_t length) { m_messageAccumulator->Update(inString, length); if (m_flags & PUT_MESSAGE) AttachedTransformation()->Put(inString, length); } void SignatureVerificationFilter::LastPut(const byte *inString, size_t length) { if (m_flags & SIGNATURE_AT_BEGIN) { assert(length == 0); m_verifier.InputSignature(*m_messageAccumulator, m_signature, m_signature.size()); m_verified = m_verifier.VerifyAndRestart(*m_messageAccumulator); } else { m_verifier.InputSignature(*m_messageAccumulator, inString, length); m_verified = m_verifier.VerifyAndRestart(*m_messageAccumulator); if (m_flags & PUT_SIGNATURE) AttachedTransformation()->Put(inString, length); } if (m_flags & PUT_RESULT) AttachedTransformation()->Put(m_verified); if ((m_flags & THROW_EXCEPTION) && !m_verified) throw SignatureVerificationFailed(); } // ************************************************************* size_t Source::PumpAll2(bool blocking) { unsigned int messageCount = UINT_MAX; do { RETURN_IF_NONZERO(PumpMessages2(messageCount, blocking)); } while(messageCount == UINT_MAX); return 0; } bool Store::GetNextMessage() { if (!m_messageEnd && !AnyRetrievable()) { m_messageEnd=true; return true; } else return false; } unsigned int Store::CopyMessagesTo(BufferedTransformation &target, unsigned int count, const std::string &channel) const { if (m_messageEnd || count == 0) return 0; else { CopyTo(target, ULONG_MAX, channel); if (GetAutoSignalPropagation()) target.ChannelMessageEnd(channel, GetAutoSignalPropagation()-1); return 1; } } void StringStore::StoreInitialize(const NameValuePairs ¶meters) { ConstByteArrayParameter array; if (!parameters.GetValue(Name::InputBuffer(), array)) throw InvalidArgument("StringStore: missing InputBuffer argument"); m_store = array.begin(); m_length = array.size(); m_count = 0; } size_t StringStore::TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel, bool blocking) { lword position = 0; size_t blockedBytes = CopyRangeTo2(target, position, transferBytes, channel, blocking); m_count += (size_t)position; transferBytes = position; return blockedBytes; } size_t StringStore::CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end, const std::string &channel, bool blocking) const { size_t i = UnsignedMin(m_length, m_count+begin); size_t len = UnsignedMin(m_length-i, end-begin); size_t blockedBytes = target.ChannelPut2(channel, m_store+i, len, 0, blocking); if (!blockedBytes) begin += len; return blockedBytes; } void RandomNumberStore::StoreInitialize(const NameValuePairs ¶meters) { parameters.GetRequiredParameter("RandomNumberStore", "RandomNumberGeneratorPointer", m_rng); int length; parameters.GetRequiredIntParameter("RandomNumberStore", "RandomNumberStoreSize", length); m_length = length; } size_t RandomNumberStore::TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel, bool blocking) { if (!blocking) throw NotImplemented("RandomNumberStore: nonblocking transfer is not implemented by this object"); transferBytes = UnsignedMin(transferBytes, m_length - m_count); m_rng->GenerateIntoBufferedTransformation(target, channel, transferBytes); m_count += transferBytes; return 0; } size_t NullStore::CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end, const std::string &channel, bool blocking) const { static const byte nullBytes[128] = {0}; while (begin < end) { size_t len = (size_t)STDMIN(end-begin, lword(128)); size_t blockedBytes = target.ChannelPut2(channel, nullBytes, len, 0, blocking); if (blockedBytes) return blockedBytes; begin += len; } return 0; } size_t NullStore::TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel, bool blocking) { lword begin = 0; size_t blockedBytes = NullStore::CopyRangeTo2(target, begin, transferBytes, channel, blocking); transferBytes = begin; m_size -= begin; return blockedBytes; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/asn.cpp0000755000000000000000000003174212414772654017072 0ustar rootroot// asn.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "asn.h" #include #include NAMESPACE_BEGIN(CryptoPP) USING_NAMESPACE(std) /// DER Length size_t DERLengthEncode(BufferedTransformation &bt, lword length) { size_t i=0; if (length <= 0x7f) { bt.Put(byte(length)); i++; } else { bt.Put(byte(BytePrecision(length) | 0x80)); i++; for (int j=BytePrecision(length); j; --j) { bt.Put(byte(length >> (j-1)*8)); i++; } } return i; } bool BERLengthDecode(BufferedTransformation &bt, lword &length, bool &definiteLength) { byte b; if (!bt.Get(b)) return false; if (!(b & 0x80)) { definiteLength = true; length = b; } else { unsigned int lengthBytes = b & 0x7f; if (lengthBytes == 0) { definiteLength = false; return true; } definiteLength = true; length = 0; while (lengthBytes--) { if (length >> (8*(sizeof(length)-1))) BERDecodeError(); // length about to overflow if (!bt.Get(b)) return false; length = (length << 8) | b; } } return true; } bool BERLengthDecode(BufferedTransformation &bt, size_t &length) { lword lw; bool definiteLength; if (!BERLengthDecode(bt, lw, definiteLength)) BERDecodeError(); if (!SafeConvert(lw, length)) BERDecodeError(); return definiteLength; } void DEREncodeNull(BufferedTransformation &out) { out.Put(TAG_NULL); out.Put(0); } void BERDecodeNull(BufferedTransformation &in) { byte b; if (!in.Get(b) || b != TAG_NULL) BERDecodeError(); size_t length; if (!BERLengthDecode(in, length) || length != 0) BERDecodeError(); } /// ASN Strings size_t DEREncodeOctetString(BufferedTransformation &bt, const byte *str, size_t strLen) { bt.Put(OCTET_STRING); size_t lengthBytes = DERLengthEncode(bt, strLen); bt.Put(str, strLen); return 1+lengthBytes+strLen; } size_t DEREncodeOctetString(BufferedTransformation &bt, const SecByteBlock &str) { return DEREncodeOctetString(bt, str.begin(), str.size()); } size_t BERDecodeOctetString(BufferedTransformation &bt, SecByteBlock &str) { byte b; if (!bt.Get(b) || b != OCTET_STRING) BERDecodeError(); size_t bc; if (!BERLengthDecode(bt, bc)) BERDecodeError(); str.resize(bc); if (bc != bt.Get(str, bc)) BERDecodeError(); return bc; } size_t BERDecodeOctetString(BufferedTransformation &bt, BufferedTransformation &str) { byte b; if (!bt.Get(b) || b != OCTET_STRING) BERDecodeError(); size_t bc; if (!BERLengthDecode(bt, bc)) BERDecodeError(); bt.TransferTo(str, bc); return bc; } size_t DEREncodeTextString(BufferedTransformation &bt, const std::string &str, byte asnTag) { bt.Put(asnTag); size_t lengthBytes = DERLengthEncode(bt, str.size()); bt.Put((const byte *)str.data(), str.size()); return 1+lengthBytes+str.size(); } size_t BERDecodeTextString(BufferedTransformation &bt, std::string &str, byte asnTag) { byte b; if (!bt.Get(b) || b != asnTag) BERDecodeError(); size_t bc; if (!BERLengthDecode(bt, bc)) BERDecodeError(); SecByteBlock temp(bc); if (bc != bt.Get(temp, bc)) BERDecodeError(); str.assign((char *)temp.begin(), bc); return bc; } /// ASN BitString size_t DEREncodeBitString(BufferedTransformation &bt, const byte *str, size_t strLen, unsigned int unusedBits) { bt.Put(BIT_STRING); size_t lengthBytes = DERLengthEncode(bt, strLen+1); bt.Put((byte)unusedBits); bt.Put(str, strLen); return 2+lengthBytes+strLen; } size_t BERDecodeBitString(BufferedTransformation &bt, SecByteBlock &str, unsigned int &unusedBits) { byte b; if (!bt.Get(b) || b != BIT_STRING) BERDecodeError(); size_t bc; if (!BERLengthDecode(bt, bc)) BERDecodeError(); byte unused; if (!bt.Get(unused)) BERDecodeError(); unusedBits = unused; str.resize(bc-1); if ((bc-1) != bt.Get(str, bc-1)) BERDecodeError(); return bc-1; } void DERReencode(BufferedTransformation &source, BufferedTransformation &dest) { byte tag; source.Peek(tag); BERGeneralDecoder decoder(source, tag); DERGeneralEncoder encoder(dest, tag); if (decoder.IsDefiniteLength()) decoder.TransferTo(encoder, decoder.RemainingLength()); else { while (!decoder.EndReached()) DERReencode(decoder, encoder); } decoder.MessageEnd(); encoder.MessageEnd(); } void OID::EncodeValue(BufferedTransformation &bt, word32 v) { for (unsigned int i=RoundUpToMultipleOf(STDMAX(7U,BitPrecision(v)), 7U)-7; i != 0; i-=7) bt.Put((byte)(0x80 | ((v >> i) & 0x7f))); bt.Put((byte)(v & 0x7f)); } size_t OID::DecodeValue(BufferedTransformation &bt, word32 &v) { byte b; size_t i=0; v = 0; while (true) { if (!bt.Get(b)) BERDecodeError(); i++; if (v >> (8*sizeof(v)-7)) // v about to overflow BERDecodeError(); v <<= 7; v += b & 0x7f; if (!(b & 0x80)) return i; } } void OID::DEREncode(BufferedTransformation &bt) const { assert(m_values.size() >= 2); ByteQueue temp; temp.Put(byte(m_values[0] * 40 + m_values[1])); for (size_t i=2; i 0) { word32 v; size_t valueLen = DecodeValue(bt, v); if (valueLen > length) BERDecodeError(); m_values.push_back(v); length -= valueLen; } } void OID::BERDecodeAndCheck(BufferedTransformation &bt) const { OID oid(bt); if (*this != oid) BERDecodeError(); } inline BufferedTransformation & EncodedObjectFilter::CurrentTarget() { if (m_flags & PUT_OBJECTS) return *AttachedTransformation(); else return TheBitBucket(); } void EncodedObjectFilter::Put(const byte *inString, size_t length) { if (m_nCurrentObject == m_nObjects) { AttachedTransformation()->Put(inString, length); return; } LazyPutter lazyPutter(m_queue, inString, length); while (m_queue.AnyRetrievable()) { switch (m_state) { case IDENTIFIER: if (!m_queue.Get(m_id)) return; m_queue.TransferTo(CurrentTarget(), 1); m_state = LENGTH; // fall through case LENGTH: { byte b; if (m_level > 0 && m_id == 0 && m_queue.Peek(b) && b == 0) { m_queue.TransferTo(CurrentTarget(), 1); m_level--; m_state = IDENTIFIER; break; } ByteQueue::Walker walker(m_queue); bool definiteLength; if (!BERLengthDecode(walker, m_lengthRemaining, definiteLength)) return; m_queue.TransferTo(CurrentTarget(), walker.GetCurrentPosition()); if (!((m_id & CONSTRUCTED) || definiteLength)) BERDecodeError(); if (!definiteLength) { if (!(m_id & CONSTRUCTED)) BERDecodeError(); m_level++; m_state = IDENTIFIER; break; } m_state = BODY; // fall through } case BODY: m_lengthRemaining -= m_queue.TransferTo(CurrentTarget(), m_lengthRemaining); if (m_lengthRemaining == 0) m_state = IDENTIFIER; } if (m_state == IDENTIFIER && m_level == 0) { // just finished processing a level 0 object ++m_nCurrentObject; if (m_flags & PUT_MESSANGE_END_AFTER_EACH_OBJECT) AttachedTransformation()->MessageEnd(); if (m_nCurrentObject == m_nObjects) { if (m_flags & PUT_MESSANGE_END_AFTER_ALL_OBJECTS) AttachedTransformation()->MessageEnd(); if (m_flags & PUT_MESSANGE_SERIES_END_AFTER_ALL_OBJECTS) AttachedTransformation()->MessageSeriesEnd(); m_queue.TransferAllTo(*AttachedTransformation()); return; } } } } BERGeneralDecoder::BERGeneralDecoder(BufferedTransformation &inQueue, byte asnTag) : m_inQueue(inQueue), m_finished(false) { Init(asnTag); } BERGeneralDecoder::BERGeneralDecoder(BERGeneralDecoder &inQueue, byte asnTag) : m_inQueue(inQueue), m_finished(false) { Init(asnTag); } void BERGeneralDecoder::Init(byte asnTag) { byte b; if (!m_inQueue.Get(b) || b != asnTag) BERDecodeError(); if (!BERLengthDecode(m_inQueue, m_length, m_definiteLength)) BERDecodeError(); if (!m_definiteLength && !(asnTag & CONSTRUCTED)) BERDecodeError(); // cannot be primitive and have indefinite length } BERGeneralDecoder::~BERGeneralDecoder() { try // avoid throwing in constructor { if (!m_finished) MessageEnd(); } catch (...) { } } bool BERGeneralDecoder::EndReached() const { if (m_definiteLength) return m_length == 0; else { // check end-of-content octets word16 i; return (m_inQueue.PeekWord16(i)==2 && i==0); } } byte BERGeneralDecoder::PeekByte() const { byte b; if (!Peek(b)) BERDecodeError(); return b; } void BERGeneralDecoder::CheckByte(byte check) { byte b; if (!Get(b) || b != check) BERDecodeError(); } void BERGeneralDecoder::MessageEnd() { m_finished = true; if (m_definiteLength) { if (m_length != 0) BERDecodeError(); } else { // remove end-of-content octets word16 i; if (m_inQueue.GetWord16(i) != 2 || i != 0) BERDecodeError(); } } size_t BERGeneralDecoder::TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel, bool blocking) { if (m_definiteLength && transferBytes > m_length) transferBytes = m_length; size_t blockedBytes = m_inQueue.TransferTo2(target, transferBytes, channel, blocking); ReduceLength(transferBytes); return blockedBytes; } size_t BERGeneralDecoder::CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end, const std::string &channel, bool blocking) const { if (m_definiteLength) end = STDMIN(m_length, end); return m_inQueue.CopyRangeTo2(target, begin, end, channel, blocking); } lword BERGeneralDecoder::ReduceLength(lword delta) { if (m_definiteLength) { if (m_length < delta) BERDecodeError(); m_length -= delta; } return delta; } DERGeneralEncoder::DERGeneralEncoder(BufferedTransformation &outQueue, byte asnTag) : m_outQueue(outQueue), m_finished(false), m_asnTag(asnTag) { } DERGeneralEncoder::DERGeneralEncoder(DERGeneralEncoder &outQueue, byte asnTag) : m_outQueue(outQueue), m_finished(false), m_asnTag(asnTag) { } DERGeneralEncoder::~DERGeneralEncoder() { try // avoid throwing in constructor { if (!m_finished) MessageEnd(); } catch (...) { } } void DERGeneralEncoder::MessageEnd() { m_finished = true; lword length = CurrentSize(); m_outQueue.Put(m_asnTag); DERLengthEncode(m_outQueue, length); TransferTo(m_outQueue); } // ************************************************************* void X509PublicKey::BERDecode(BufferedTransformation &bt) { BERSequenceDecoder subjectPublicKeyInfo(bt); BERSequenceDecoder algorithm(subjectPublicKeyInfo); GetAlgorithmID().BERDecodeAndCheck(algorithm); bool parametersPresent = algorithm.EndReached() ? false : BERDecodeAlgorithmParameters(algorithm); algorithm.MessageEnd(); BERGeneralDecoder subjectPublicKey(subjectPublicKeyInfo, BIT_STRING); subjectPublicKey.CheckByte(0); // unused bits BERDecodePublicKey(subjectPublicKey, parametersPresent, (size_t)subjectPublicKey.RemainingLength()); subjectPublicKey.MessageEnd(); subjectPublicKeyInfo.MessageEnd(); } void X509PublicKey::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder subjectPublicKeyInfo(bt); DERSequenceEncoder algorithm(subjectPublicKeyInfo); GetAlgorithmID().DEREncode(algorithm); DEREncodeAlgorithmParameters(algorithm); algorithm.MessageEnd(); DERGeneralEncoder subjectPublicKey(subjectPublicKeyInfo, BIT_STRING); subjectPublicKey.Put(0); // unused bits DEREncodePublicKey(subjectPublicKey); subjectPublicKey.MessageEnd(); subjectPublicKeyInfo.MessageEnd(); } void PKCS8PrivateKey::BERDecode(BufferedTransformation &bt) { BERSequenceDecoder privateKeyInfo(bt); word32 version; BERDecodeUnsigned(privateKeyInfo, version, INTEGER, 0, 0); // check version BERSequenceDecoder algorithm(privateKeyInfo); GetAlgorithmID().BERDecodeAndCheck(algorithm); bool parametersPresent = algorithm.EndReached() ? false : BERDecodeAlgorithmParameters(algorithm); algorithm.MessageEnd(); BERGeneralDecoder octetString(privateKeyInfo, OCTET_STRING); BERDecodePrivateKey(octetString, parametersPresent, (size_t)privateKeyInfo.RemainingLength()); octetString.MessageEnd(); if (!privateKeyInfo.EndReached()) BERDecodeOptionalAttributes(privateKeyInfo); privateKeyInfo.MessageEnd(); } void PKCS8PrivateKey::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder privateKeyInfo(bt); DEREncodeUnsigned(privateKeyInfo, 0); // version DERSequenceEncoder algorithm(privateKeyInfo); GetAlgorithmID().DEREncode(algorithm); DEREncodeAlgorithmParameters(algorithm); algorithm.MessageEnd(); DERGeneralEncoder octetString(privateKeyInfo, OCTET_STRING); DEREncodePrivateKey(octetString); octetString.MessageEnd(); DEREncodeOptionalAttributes(privateKeyInfo); privateKeyInfo.MessageEnd(); } void PKCS8PrivateKey::BERDecodeOptionalAttributes(BufferedTransformation &bt) { DERReencode(bt, m_optionalAttributes); } void PKCS8PrivateKey::DEREncodeOptionalAttributes(BufferedTransformation &bt) const { m_optionalAttributes.CopyTo(bt); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/fipsalgt.cpp0000755000000000000000000010666712414772654020133 0ustar rootroot// fipsalgt.cpp - written and placed in the public domain by Wei Dai // This file implements the various algorithm tests needed to pass FIPS 140 validation. // They're preserved here (commented out) in case Crypto++ needs to be revalidated. #if 0 #ifndef CRYPTOPP_IMPORTS #define CRYPTOPP_DEFAULT_NO_DLL #endif #include "dll.h" #include "oids.h" USING_NAMESPACE(CryptoPP) USING_NAMESPACE(std) class LineBreakParser : public AutoSignaling > { public: LineBreakParser(BufferedTransformation *attachment=NULL, byte lineEnd='\n') : m_lineEnd(lineEnd) {Detach(attachment);} size_t Put2(const byte *begin, size_t length, int messageEnd, bool blocking) { if (!blocking) throw BlockingInputOnly("LineBreakParser"); unsigned int i, last = 0; for (i=0; iPut2(begin+last, i-last, GetAutoSignalPropagation(), blocking); last = i+1; } } if (last != i) AttachedTransformation()->Put2(begin+last, i-last, 0, blocking); if (messageEnd && GetAutoSignalPropagation()) { AttachedTransformation()->MessageEnd(GetAutoSignalPropagation()-1, blocking); AttachedTransformation()->MessageSeriesEnd(GetAutoSignalPropagation()-1, blocking); } return 0; } private: byte m_lineEnd; }; class TestDataParser : public Unflushable { public: enum DataType {OTHER, COUNT, KEY_T, IV, INPUT, OUTPUT}; TestDataParser(std::string algorithm, std::string test, std::string mode, unsigned int feedbackSize, bool encrypt, BufferedTransformation *attachment) : m_algorithm(algorithm), m_test(test), m_mode(mode), m_feedbackSize(feedbackSize) , m_firstLine(true), m_blankLineTransition(0) { Detach(attachment); m_typeToName[COUNT] = "COUNT"; m_nameToType["COUNT"] = COUNT; m_nameToType["KEY"] = KEY_T; m_nameToType["KEYs"] = KEY_T; m_nameToType["key"] = KEY_T; m_nameToType["Key"] = KEY_T; m_nameToType["IV"] = IV; m_nameToType["IV1"] = IV; m_nameToType["CV"] = IV; m_nameToType["CV1"] = IV; m_nameToType["IB"] = IV; m_nameToType["TEXT"] = INPUT; m_nameToType["RESULT"] = OUTPUT; m_nameToType["Msg"] = INPUT; m_nameToType["Seed"] = INPUT; m_nameToType["V"] = INPUT; m_nameToType["DT"] = IV; SetEncrypt(encrypt); if (m_algorithm == "DSA" || m_algorithm == "ECDSA") { if (m_test == "PKV") m_trigger = "Qy"; else if (m_test == "KeyPair") m_trigger = "N"; else if (m_test == "SigGen") m_trigger = "Msg"; else if (m_test == "SigVer") m_trigger = "S"; else if (m_test == "PQGGen") m_trigger = "N"; else if (m_test == "PQGVer") m_trigger = "H"; } else if (m_algorithm == "HMAC") m_trigger = "Msg"; else if (m_algorithm == "SHA") m_trigger = (m_test == "MONTE") ? "Seed" : "Msg"; else if (m_algorithm == "RNG") m_trigger = "V"; else if (m_algorithm == "RSA") m_trigger = (m_test == "Ver") ? "S" : "Msg"; } void SetEncrypt(bool encrypt) { m_encrypt = encrypt; if (encrypt) { m_nameToType["PLAINTEXT"] = INPUT; m_nameToType["CIPHERTEXT"] = OUTPUT; m_nameToType["PT"] = INPUT; m_nameToType["CT"] = OUTPUT; } else { m_nameToType["PLAINTEXT"] = OUTPUT; m_nameToType["CIPHERTEXT"] = INPUT; m_nameToType["PT"] = OUTPUT; m_nameToType["CT"] = INPUT; } if (m_algorithm == "AES" || m_algorithm == "TDES") { if (encrypt) { m_trigger = "PLAINTEXT"; m_typeToName[OUTPUT] = "CIPHERTEXT"; } else { m_trigger = "CIPHERTEXT"; m_typeToName[OUTPUT] = "PLAINTEXT"; } m_count = 0; } } protected: void OutputData(std::string &output, const std::string &key, const std::string &data) { output += key; output += "= "; output += data; output += "\n"; } void OutputData(std::string &output, const std::string &key, int data) { OutputData(output, key, IntToString(data)); } void OutputData(std::string &output, const std::string &key, const SecByteBlock &data) { output += key; output += "= "; HexEncoder(new StringSink(output), false).Put(data, data.size()); output += "\n"; } void OutputData(std::string &output, const std::string &key, const Integer &data, int size=-1) { SecByteBlock s(size < 0 ? data.MinEncodedSize() : size); data.Encode(s, s.size()); OutputData(output, key, s); } void OutputData(std::string &output, const std::string &key, const PolynomialMod2 &data, int size=-1) { SecByteBlock s(size < 0 ? data.MinEncodedSize() : size); data.Encode(s, s.size()); OutputData(output, key, s); } void OutputData(std::string &output, DataType t, const std::string &data) { if (m_algorithm == "SKIPJACK") { if (m_test == "KAT") { if (t == OUTPUT) output = m_line + data + "\n"; } else { if (t != COUNT) { output += m_typeToName[t]; output += "="; } output += data; output += t == OUTPUT ? "\n" : " "; } } else if (m_algorithm == "TDES" && t == KEY_T && m_typeToName[KEY_T].empty()) { output += "KEY1 = "; output += data.substr(0, 16); output += "\nKEY2 = "; output += data.size() > 16 ? data.substr(16, 16) : data.substr(0, 16); output += "\nKEY3 = "; output += data.size() > 32 ? data.substr(32, 16) : data.substr(0, 16); output += "\n"; } else { output += m_typeToName[t]; output += " = "; output += data; output += "\n"; } } void OutputData(std::string &output, DataType t, int i) { OutputData(output, t, IntToString(i)); } void OutputData(std::string &output, DataType t, const SecByteBlock &data) { std::string hexData; StringSource(data.begin(), data.size(), true, new HexEncoder(new StringSink(hexData), false)); OutputData(output, t, hexData); } void OutputGivenData(std::string &output, DataType t, bool optional = false) { if (m_data.find(m_typeToName[t]) == m_data.end()) { if (optional) return; throw Exception(Exception::OTHER_ERROR, "TestDataParser: key not found: " + m_typeToName[t]); } OutputData(output, t, m_data[m_typeToName[t]]); } template BlockCipher * NewBT(T *) { if (!m_encrypt && (m_mode == "ECB" || m_mode == "CBC")) return new typename T::Decryption; else return new typename T::Encryption; } template SymmetricCipher * NewMode(T *, BlockCipher &bt, const byte *iv) { if (!m_encrypt) return new typename T::Decryption(bt, iv, m_feedbackSize/8); else return new typename T::Encryption(bt, iv, m_feedbackSize/8); } static inline void Xor(SecByteBlock &z, const SecByteBlock &x, const SecByteBlock &y) { assert(x.size() == y.size()); z.resize(x.size()); xorbuf(z, x, y, x.size()); } SecByteBlock UpdateKey(SecByteBlock key, const SecByteBlock *text) { unsigned int innerCount = (m_algorithm == "AES") ? 1000 : 10000; int keySize = key.size(), blockSize = text[0].size(); SecByteBlock x(keySize); for (int k=0; k void EC_KeyPair(string &output, int n, const OID &oid) { DL_GroupParameters_EC params(oid); for (int i=0; i priv; DL_PublicKey_EC pub; priv.Initialize(m_rng, params); priv.MakePublicKey(pub); OutputData(output, "d ", priv.GetPrivateExponent()); OutputData(output, "Qx ", pub.GetPublicElement().x, params.GetCurve().GetField().MaxElementByteLength()); OutputData(output, "Qy ", pub.GetPublicElement().y, params.GetCurve().GetField().MaxElementByteLength()); } } template void EC_SigGen(string &output, const OID &oid) { DL_GroupParameters_EC params(oid); typename ECDSA::PrivateKey priv; typename ECDSA::PublicKey pub; priv.Initialize(m_rng, params); priv.MakePublicKey(pub); typename ECDSA::Signer signer(priv); SecByteBlock sig(signer.SignatureLength()); StringSource(m_data["Msg"], true, new HexDecoder(new SignerFilter(m_rng, signer, new ArraySink(sig, sig.size())))); SecByteBlock R(sig, sig.size()/2), S(sig+sig.size()/2, sig.size()/2); OutputData(output, "Qx ", pub.GetPublicElement().x, params.GetCurve().GetField().MaxElementByteLength()); OutputData(output, "Qy ", pub.GetPublicElement().y, params.GetCurve().GetField().MaxElementByteLength()); OutputData(output, "R ", R); OutputData(output, "S ", S); } template void EC_SigVer(string &output, const OID &oid) { SecByteBlock x(DecodeHex(m_data["Qx"])); SecByteBlock y(DecodeHex(m_data["Qy"])); Integer r((m_data["R"]+"h").c_str()); Integer s((m_data["S"]+"h").c_str()); typename EC::FieldElement Qx(x, x.size()); typename EC::FieldElement Qy(y, y.size()); typename EC::Element Q(Qx, Qy); DL_GroupParameters_EC params(oid); typename ECDSA::PublicKey pub; pub.Initialize(params, Q); typename ECDSA::Verifier verifier(pub); SecByteBlock sig(verifier.SignatureLength()); r.Encode(sig, sig.size()/2); s.Encode(sig+sig.size()/2, sig.size()/2); SignatureVerificationFilter filter(verifier); filter.Put(sig, sig.size()); StringSource(m_data["Msg"], true, new HexDecoder(new Redirector(filter, Redirector::DATA_ONLY))); filter.MessageEnd(); byte b; filter.Get(b); OutputData(output, "Result ", b ? "P" : "F"); } template static bool EC_PKV(RandomNumberGenerator &rng, const SecByteBlock &x, const SecByteBlock &y, const OID &oid) { typename EC::FieldElement Qx(x, x.size()); typename EC::FieldElement Qy(y, y.size()); typename EC::Element Q(Qx, Qy); DL_GroupParameters_EC params(oid); typename ECDSA::PublicKey pub; pub.Initialize(params, Q); return pub.Validate(rng, 3); } template Result * CreateRSA2(const std::string &standard) { if (typeid(Result) == typeid(PK_Verifier)) { if (standard == "R") return (Result *) new typename RSASS_ISO::Verifier; else if (standard == "P") return (Result *) new typename RSASS::Verifier; else if (standard == "1") return (Result *) new typename RSASS::Verifier; } else if (typeid(Result) == typeid(PK_Signer)) { if (standard == "R") return (Result *) new typename RSASS_ISO::Signer; else if (standard == "P") return (Result *) new typename RSASS::Signer; else if (standard == "1") return (Result *) new typename RSASS::Signer; } return NULL; } template Result * CreateRSA(const std::string &standard, const std::string &hash) { if (hash == "1") return CreateRSA2(standard); else if (hash == "224") return CreateRSA2(standard); else if (hash == "256") return CreateRSA2(standard); else if (hash == "384") return CreateRSA2(standard); else if (hash == "512") return CreateRSA2(standard); else return NULL; } virtual void DoTest() { std::string output; if (m_algorithm == "DSA") { if (m_test == "KeyPair") { DL_GroupParameters_DSA pqg; int modLen = atol(m_bracketString.substr(6).c_str()); pqg.GenerateRandomWithKeySize(m_rng, modLen); OutputData(output, "P ", pqg.GetModulus()); OutputData(output, "Q ", pqg.GetSubgroupOrder()); OutputData(output, "G ", pqg.GetSubgroupGenerator()); int n = atol(m_data["N"].c_str()); for (int i=0; iPut((byte *)output.data(), output.size()); output.resize(0); } } else if (m_test == "PQGGen") { int n = atol(m_data["N"].c_str()); for (int i=0; iPut((byte *)output.data(), output.size()); output.resize(0); } } else if (m_test == "SigGen") { std::string &encodedKey = m_data["PrivKey"]; int modLen = atol(m_bracketString.substr(6).c_str()); DSA::PrivateKey priv; if (!encodedKey.empty()) { StringStore s(encodedKey); priv.BERDecode(s); if (priv.GetGroupParameters().GetModulus().BitCount() != modLen) encodedKey.clear(); } if (encodedKey.empty()) { priv.Initialize(m_rng, modLen); StringSink s(encodedKey); priv.DEREncode(s); OutputData(output, "P ", priv.GetGroupParameters().GetModulus()); OutputData(output, "Q ", priv.GetGroupParameters().GetSubgroupOrder()); OutputData(output, "G ", priv.GetGroupParameters().GetSubgroupGenerator()); } DSA::Signer signer(priv); DSA::Verifier pub(signer); OutputData(output, "Msg ", m_data["Msg"]); OutputData(output, "Y ", pub.GetKey().GetPublicElement()); SecByteBlock sig(signer.SignatureLength()); StringSource(m_data["Msg"], true, new HexDecoder(new SignerFilter(m_rng, signer, new ArraySink(sig, sig.size())))); SecByteBlock R(sig, sig.size()/2), S(sig+sig.size()/2, sig.size()/2); OutputData(output, "R ", R); OutputData(output, "S ", S); AttachedTransformation()->Put((byte *)output.data(), output.size()); output.resize(0); } else if (m_test == "SigVer") { Integer p((m_data["P"] + "h").c_str()); Integer q((m_data["Q"] + "h").c_str()); Integer g((m_data["G"] + "h").c_str()); Integer y((m_data["Y"] + "h").c_str()); DSA::Verifier verifier(p, q, g, y); HexDecoder filter(new SignatureVerificationFilter(verifier)); StringSource(m_data["R"], true, new Redirector(filter, Redirector::DATA_ONLY)); StringSource(m_data["S"], true, new Redirector(filter, Redirector::DATA_ONLY)); StringSource(m_data["Msg"], true, new Redirector(filter, Redirector::DATA_ONLY)); filter.MessageEnd(); byte b; filter.Get(b); OutputData(output, "Result ", b ? "P" : "F"); AttachedTransformation()->Put((byte *)output.data(), output.size()); output.resize(0); } else if (m_test == "PQGVer") { Integer p((m_data["P"] + "h").c_str()); Integer q((m_data["Q"] + "h").c_str()); Integer g((m_data["G"] + "h").c_str()); Integer h((m_data["H"] + "h").c_str()); int c = atol(m_data["c"].c_str()); SecByteBlock seed(m_data["Seed"].size()/2); StringSource(m_data["Seed"], true, new HexDecoder(new ArraySink(seed, seed.size()))); Integer p1, q1; bool result = DSA::GeneratePrimes(seed, seed.size()*8, c, p1, 1024, q1, true); result = result && (p1 == p && q1 == q); result = result && g == a_exp_b_mod_c(h, (p-1)/q, p); OutputData(output, "Result ", result ? "P" : "F"); AttachedTransformation()->Put((byte *)output.data(), output.size()); output.resize(0); } return; } if (m_algorithm == "ECDSA") { std::map name2oid; name2oid["P-192"] = ASN1::secp192r1(); name2oid["P-224"] = ASN1::secp224r1(); name2oid["P-256"] = ASN1::secp256r1(); name2oid["P-384"] = ASN1::secp384r1(); name2oid["P-521"] = ASN1::secp521r1(); name2oid["K-163"] = ASN1::sect163k1(); name2oid["K-233"] = ASN1::sect233k1(); name2oid["K-283"] = ASN1::sect283k1(); name2oid["K-409"] = ASN1::sect409k1(); name2oid["K-571"] = ASN1::sect571k1(); name2oid["B-163"] = ASN1::sect163r2(); name2oid["B-233"] = ASN1::sect233r1(); name2oid["B-283"] = ASN1::sect283r1(); name2oid["B-409"] = ASN1::sect409r1(); name2oid["B-571"] = ASN1::sect571r1(); if (m_test == "PKV") { bool pass; if (m_bracketString[0] == 'P') pass = EC_PKV(m_rng, DecodeHex(m_data["Qx"]), DecodeHex(m_data["Qy"]), name2oid[m_bracketString]); else pass = EC_PKV(m_rng, DecodeHex(m_data["Qx"]), DecodeHex(m_data["Qy"]), name2oid[m_bracketString]); OutputData(output, "Result ", pass ? "P" : "F"); } else if (m_test == "KeyPair") { if (m_bracketString[0] == 'P') EC_KeyPair(output, atol(m_data["N"].c_str()), name2oid[m_bracketString]); else EC_KeyPair(output, atol(m_data["N"].c_str()), name2oid[m_bracketString]); } else if (m_test == "SigGen") { if (m_bracketString[0] == 'P') EC_SigGen(output, name2oid[m_bracketString]); else EC_SigGen(output, name2oid[m_bracketString]); } else if (m_test == "SigVer") { if (m_bracketString[0] == 'P') EC_SigVer(output, name2oid[m_bracketString]); else EC_SigVer(output, name2oid[m_bracketString]); } AttachedTransformation()->Put((byte *)output.data(), output.size()); output.resize(0); return; } if (m_algorithm == "RSA") { std::string shaAlg = m_data["SHAAlg"].substr(3); if (m_test == "Ver") { Integer n((m_data["n"] + "h").c_str()); Integer e((m_data["e"] + "h").c_str()); RSA::PublicKey pub; pub.Initialize(n, e); member_ptr pV(CreateRSA(m_mode, shaAlg)); pV->AccessMaterial().AssignFrom(pub); HexDecoder filter(new SignatureVerificationFilter(*pV)); for (unsigned int i=m_data["S"].size(); iSignatureLength()*2; i++) filter.Put('0'); StringSource(m_data["S"], true, new Redirector(filter, Redirector::DATA_ONLY)); StringSource(m_data["Msg"], true, new Redirector(filter, Redirector::DATA_ONLY)); filter.MessageEnd(); byte b; filter.Get(b); OutputData(output, "Result ", b ? "P" : "F"); } else { assert(m_test == "Gen"); int modLen = atol(m_bracketString.substr(6).c_str()); std::string &encodedKey = m_data["PrivKey"]; RSA::PrivateKey priv; if (!encodedKey.empty()) { StringStore s(encodedKey); priv.BERDecode(s); if (priv.GetModulus().BitCount() != modLen) encodedKey.clear(); } if (encodedKey.empty()) { priv.Initialize(m_rng, modLen); StringSink s(encodedKey); priv.DEREncode(s); OutputData(output, "n ", priv.GetModulus()); OutputData(output, "e ", priv.GetPublicExponent(), modLen/8); } member_ptr pS(CreateRSA(m_mode, shaAlg)); pS->AccessMaterial().AssignFrom(priv); SecByteBlock sig(pS->SignatureLength()); StringSource(m_data["Msg"], true, new HexDecoder(new SignerFilter(m_rng, *pS, new ArraySink(sig, sig.size())))); OutputData(output, "SHAAlg ", m_data["SHAAlg"]); OutputData(output, "Msg ", m_data["Msg"]); OutputData(output, "S ", sig); } AttachedTransformation()->Put((byte *)output.data(), output.size()); output.resize(0); return; } if (m_algorithm == "SHA") { member_ptr pHF; if (m_mode == "1") pHF.reset(new SHA1); else if (m_mode == "224") pHF.reset(new SHA224); else if (m_mode == "256") pHF.reset(new SHA256); else if (m_mode == "384") pHF.reset(new SHA384); else if (m_mode == "512") pHF.reset(new SHA512); if (m_test == "MONTE") { SecByteBlock seed = m_data2[INPUT]; SecByteBlock MD[1003]; int i,j; for (j=0; j<100; j++) { MD[0] = MD[1] = MD[2] = seed; for (i=3; i<1003; i++) { SecByteBlock Mi = MD[i-3] + MD[i-2] + MD[i-1]; MD[i].resize(pHF->DigestSize()); pHF->CalculateDigest(MD[i], Mi, Mi.size()); } seed = MD[1002]; OutputData(output, "COUNT ", j); OutputData(output, "MD ", seed); AttachedTransformation()->Put((byte *)output.data(), output.size()); output.resize(0); } } else { SecByteBlock tag(pHF->DigestSize()); SecByteBlock &msg(m_data2[INPUT]); int len = atol(m_data["Len"].c_str()); StringSource(msg.begin(), len/8, true, new HashFilter(*pHF, new ArraySink(tag, tag.size()))); OutputData(output, "MD ", tag); AttachedTransformation()->Put((byte *)output.data(), output.size()); output.resize(0); } return; } SecByteBlock &key = m_data2[KEY_T]; if (m_algorithm == "TDES") { if (!m_data["KEY1"].empty()) { const std::string keys[3] = {m_data["KEY1"], m_data["KEY2"], m_data["KEY3"]}; key.resize(24); HexDecoder hexDec(new ArraySink(key, key.size())); for (int i=0; i<3; i++) hexDec.Put((byte *)keys[i].data(), keys[i].size()); if (keys[0] == keys[2]) { if (keys[0] == keys[1]) key.resize(8); else key.resize(16); } else key.resize(24); } } if (m_algorithm == "RNG") { key.resize(24); StringSource(m_data["Key1"] + m_data["Key2"] + m_data["Key3"], true, new HexDecoder(new ArraySink(key, key.size()))); SecByteBlock seed(m_data2[INPUT]), dt(m_data2[IV]), r(8); X917RNG rng(new DES_EDE3::Encryption(key, key.size()), seed, dt); if (m_test == "MCT") { for (int i=0; i<10000; i++) rng.GenerateBlock(r, r.size()); } else { rng.GenerateBlock(r, r.size()); } OutputData(output, "R ", r); AttachedTransformation()->Put((byte *)output.data(), output.size()); output.resize(0); return; } if (m_algorithm == "HMAC") { member_ptr pMAC; if (m_bracketString == "L=20") pMAC.reset(new HMAC); else if (m_bracketString == "L=28") pMAC.reset(new HMAC); else if (m_bracketString == "L=32") pMAC.reset(new HMAC); else if (m_bracketString == "L=48") pMAC.reset(new HMAC); else if (m_bracketString == "L=64") pMAC.reset(new HMAC); else throw Exception(Exception::OTHER_ERROR, "TestDataParser: unexpected HMAC bracket string: " + m_bracketString); pMAC->SetKey(key, key.size()); int Tlen = atol(m_data["Tlen"].c_str()); SecByteBlock tag(Tlen); StringSource(m_data["Msg"], true, new HexDecoder(new HashFilter(*pMAC, new ArraySink(tag, Tlen), false, Tlen))); OutputData(output, "Mac ", tag); AttachedTransformation()->Put((byte *)output.data(), output.size()); output.resize(0); return; } member_ptr pBT; if (m_algorithm == "DES") pBT.reset(NewBT((DES*)0)); else if (m_algorithm == "TDES") { if (key.size() == 8) pBT.reset(NewBT((DES*)0)); else if (key.size() == 16) pBT.reset(NewBT((DES_EDE2*)0)); else pBT.reset(NewBT((DES_EDE3*)0)); } else if (m_algorithm == "SKIPJACK") pBT.reset(NewBT((SKIPJACK*)0)); else if (m_algorithm == "AES") pBT.reset(NewBT((AES*)0)); else throw Exception(Exception::OTHER_ERROR, "TestDataParser: unexpected algorithm: " + m_algorithm); if (!pBT->IsValidKeyLength(key.size())) key.CleanNew(pBT->DefaultKeyLength()); // for Scbcvrct pBT->SetKey(key.data(), key.size()); SecByteBlock &iv = m_data2[IV]; if (iv.empty()) iv.CleanNew(pBT->BlockSize()); member_ptr pCipher; unsigned int K = m_feedbackSize; if (m_mode == "ECB") pCipher.reset(NewMode((ECB_Mode_ExternalCipher*)0, *pBT, iv)); else if (m_mode == "CBC") pCipher.reset(NewMode((CBC_Mode_ExternalCipher*)0, *pBT, iv)); else if (m_mode == "CFB") pCipher.reset(NewMode((CFB_Mode_ExternalCipher*)0, *pBT, iv)); else if (m_mode == "OFB") pCipher.reset(NewMode((OFB_Mode_ExternalCipher*)0, *pBT, iv)); else throw Exception(Exception::OTHER_ERROR, "TestDataParser: unexpected mode: " + m_mode); bool encrypt = m_encrypt; if (m_test == "MONTE") { SecByteBlock KEY[401]; KEY[0] = key; int keySize = key.size(); int blockSize = pBT->BlockSize(); std::vector IB(10001), OB(10001), PT(10001), CT(10001), RESULT(10001), TXT(10001), CV(10001); PT[0] = GetData("PLAINTEXT"); CT[0] = GetData("CIPHERTEXT"); CV[0] = IB[0] = iv; TXT[0] = GetData("TEXT"); int outerCount = (m_algorithm == "AES") ? 100 : 400; int innerCount = (m_algorithm == "AES") ? 1000 : 10000; for (int i=0; iSetKey(KEY[i], keySize); for (int j=0; jProcessBlock(IB[j], CT[j]); PT[j+1] = CT[j]; } else { IB[j] = CT[j]; PT[j].resize(blockSize); pBT->ProcessBlock(IB[j], PT[j]); CT[j+1] = PT[j]; } } else if (m_mode == "OFB") { OB[j].resize(blockSize); pBT->ProcessBlock(IB[j], OB[j]); Xor(RESULT[j], OB[j], TXT[j]); TXT[j+1] = IB[j]; IB[j+1] = OB[j]; } else if (m_mode == "CBC") { if (encrypt) { Xor(IB[j], PT[j], CV[j]); CT[j].resize(blockSize); pBT->ProcessBlock(IB[j], CT[j]); PT[j+1] = CV[j]; CV[j+1] = CT[j]; } else { IB[j] = CT[j]; OB[j].resize(blockSize); pBT->ProcessBlock(IB[j], OB[j]); Xor(PT[j], OB[j], CV[j]); CV[j+1] = CT[j]; CT[j+1] = PT[j]; } } else if (m_mode == "CFB") { if (encrypt) { OB[j].resize(blockSize); pBT->ProcessBlock(IB[j], OB[j]); AssignLeftMostBits(CT[j], OB[j], K); Xor(CT[j], CT[j], PT[j]); AssignLeftMostBits(PT[j+1], IB[j], K); IB[j+1].resize(blockSize); memcpy(IB[j+1], IB[j]+K/8, blockSize-K/8); memcpy(IB[j+1]+blockSize-K/8, CT[j], K/8); } else { OB[j].resize(blockSize); pBT->ProcessBlock(IB[j], OB[j]); AssignLeftMostBits(PT[j], OB[j], K); Xor(PT[j], PT[j], CT[j]); IB[j+1].resize(blockSize); memcpy(IB[j+1], IB[j]+K/8, blockSize-K/8); memcpy(IB[j+1]+blockSize-K/8, CT[j], K/8); AssignLeftMostBits(CT[j+1], OB[j], K); } } else throw Exception(Exception::OTHER_ERROR, "TestDataParser: unexpected mode: " + m_mode); } OutputData(output, COUNT, IntToString(i)); OutputData(output, KEY_T, KEY[i]); if (m_mode == "CBC") OutputData(output, IV, CV[0]); if (m_mode == "OFB" || m_mode == "CFB") OutputData(output, IV, IB[0]); if (m_mode == "ECB" || m_mode == "CBC" || m_mode == "CFB") { if (encrypt) { OutputData(output, INPUT, PT[0]); OutputData(output, OUTPUT, CT[innerCount-1]); KEY[i+1] = UpdateKey(KEY[i], &CT[0]); } else { OutputData(output, INPUT, CT[0]); OutputData(output, OUTPUT, PT[innerCount-1]); KEY[i+1] = UpdateKey(KEY[i], &PT[0]); } PT[0] = PT[innerCount]; IB[0] = IB[innerCount]; CV[0] = CV[innerCount]; CT[0] = CT[innerCount]; } else if (m_mode == "OFB") { OutputData(output, INPUT, TXT[0]); OutputData(output, OUTPUT, RESULT[innerCount-1]); KEY[i+1] = UpdateKey(KEY[i], &RESULT[0]); Xor(TXT[0], TXT[0], IB[innerCount-1]); IB[0] = OB[innerCount-1]; } output += "\n"; AttachedTransformation()->Put((byte *)output.data(), output.size()); output.resize(0); } } else if (m_test == "MCT") { SecByteBlock KEY[101]; KEY[0] = key; int keySize = key.size(); int blockSize = pBT->BlockSize(); SecByteBlock ivs[101], inputs[1001], outputs[1001]; ivs[0] = iv; inputs[0] = m_data2[INPUT]; for (int i=0; i<100; i++) { pCipher->SetKey(KEY[i], keySize, MakeParameters(Name::IV(), (const byte *)ivs[i])(Name::FeedbackSize(), (int)K/8, false)); for (int j=0; j<1000; j++) { outputs[j] = inputs[j]; pCipher->ProcessString(outputs[j], outputs[j].size()); if (K==8 && m_mode == "CFB") { if (j<16) inputs[j+1].Assign(ivs[i]+j, 1); else inputs[j+1] = outputs[j-16]; } else if (m_mode == "ECB") inputs[j+1] = outputs[j]; else if (j == 0) inputs[j+1] = ivs[i]; else inputs[j+1] = outputs[j-1]; } if (m_algorithm == "AES") OutputData(output, COUNT, m_count++); OutputData(output, KEY_T, KEY[i]); if (m_mode != "ECB") OutputData(output, IV, ivs[i]); OutputData(output, INPUT, inputs[0]); OutputData(output, OUTPUT, outputs[999]); output += "\n"; AttachedTransformation()->Put((byte *)output.data(), output.size()); output.resize(0); KEY[i+1] = UpdateKey(KEY[i], outputs); ivs[i+1].CleanNew(pCipher->IVSize()); ivs[i+1] = UpdateKey(ivs[i+1], outputs); if (K==8 && m_mode == "CFB") inputs[0] = outputs[999-16]; else if (m_mode == "ECB") inputs[0] = outputs[999]; else inputs[0] = outputs[998]; } } else { assert(m_test == "KAT"); SecByteBlock &input = m_data2[INPUT]; SecByteBlock result(input.size()); member_ptr pFilter(new StreamTransformationFilter(*pCipher, new ArraySink(result, result.size()), StreamTransformationFilter::NO_PADDING)); StringSource(input.data(), input.size(), true, pFilter.release()); OutputGivenData(output, COUNT, true); OutputData(output, KEY_T, key); OutputGivenData(output, IV, true); OutputGivenData(output, INPUT); OutputData(output, OUTPUT, result); output += "\n"; AttachedTransformation()->Put((byte *)output.data(), output.size()); } } std::vector Tokenize(const std::string &line) { std::vector result; std::string s; for (unsigned int i=0; i") { assert(m_test == "sha"); m_bracketString = m_line.substr(2, m_line.size()-4); m_line = m_line.substr(0, 13) + "Hashes") copyLine = true; if (m_line == "Put((byte *)m_line.data(), m_line.size(), blocking); return false; } std::vector tokens = Tokenize(m_line); if (m_algorithm == "DSA" && m_test == "sha") { for (unsigned int i = 0; i < tokens.size(); i++) { if (tokens[i] == "^") DoTest(); else if (tokens[i] != "") m_compactString.push_back(atol(tokens[i].c_str())); } } else { if (!m_line.empty() && ((m_algorithm == "RSA" && m_test != "Gen") || m_algorithm == "RNG" || m_algorithm == "HMAC" || m_algorithm == "SHA" || (m_algorithm == "ECDSA" && m_test != "KeyPair") || (m_algorithm == "DSA" && (m_test == "PQGVer" || m_test == "SigVer")))) { // copy input to output std::string output = m_line + '\n'; AttachedTransformation()->Put((byte *)output.data(), output.size()); } for (unsigned int i = 0; i < tokens.size(); i++) { if (m_firstLine && m_algorithm != "DSA") { if (tokens[i] == "Encrypt" || tokens[i] == "OFB") SetEncrypt(true); else if (tokens[i] == "Decrypt") SetEncrypt(false); else if (tokens[i] == "Modes") m_test = "MONTE"; } else { if (tokens[i] != "=") continue; if (i == 0) throw Exception(Exception::OTHER_ERROR, "TestDataParser: unexpected data: " + m_line); const std::string &key = tokens[i-1]; std::string &data = m_data[key]; data = (tokens.size() > i+1) ? tokens[i+1] : ""; DataType t = m_nameToType[key]; m_typeToName[t] = key; m_data2[t] = DecodeHex(data); if (key == m_trigger || (t == OUTPUT && !m_data2[INPUT].empty() && !isspace(m_line[0]))) DoTest(); } } } m_firstLine = false; return false; } inline const SecByteBlock & GetData(const std::string &key) { return m_data2[m_nameToType[key]]; } static SecByteBlock DecodeHex(const std::string &data) { SecByteBlock data2(data.size() / 2); StringSource(data, true, new HexDecoder(new ArraySink(data2, data2.size()))); return data2; } std::string m_algorithm, m_test, m_mode, m_line, m_bracketString, m_trigger; unsigned int m_feedbackSize, m_blankLineTransition; bool m_encrypt, m_firstLine; typedef std::map NameToTypeMap; NameToTypeMap m_nameToType; typedef std::map TypeToNameMap; TypeToNameMap m_typeToName; typedef std::map Map; Map m_data; // raw data typedef std::map Map2; Map2 m_data2; int m_count; AutoSeededX917RNG m_rng; std::vector m_compactString; }; int FIPS_140_AlgorithmTest(int argc, char **argv) { argc--; argv++; std::string algorithm = argv[1]; std::string pathname = argv[2]; unsigned int i = pathname.find_last_of("\\/"); std::string filename = pathname.substr(i == std::string::npos ? 0 : i+1); std::string dirname = pathname.substr(0, i); if (algorithm == "auto") { string algTable[] = {"AES", "ECDSA", "DSA", "HMAC", "RNG", "RSA", "TDES", "SKIPJACK", "SHA"}; // order is important here for (i=0; i 3) { std::string outDir = argv[3]; if (outDir == "auto") { if (dirname.substr(dirname.size()-3) == "req") outDir = dirname.substr(0, dirname.size()-3) + "resp"; } if (*outDir.rbegin() != '\\' && *outDir.rbegin() != '/') outDir += '/'; std::string outPathname = outDir + filename.substr(0, filename.size() - 3) + "rsp"; pSink = new FileSink(outPathname.c_str(), false); } else pSink = new FileSink(cout); FileSource(pathname.c_str(), true, new LineBreakParser(new TestDataParser(algorithm, test, mode, feedbackSize, encrypt, pSink)), false); } catch (...) { cout << "file: " << filename << endl; throw; } return 0; } extern int (*AdhocTest)(int argc, char *argv[]); static int s_i = (AdhocTest = &FIPS_140_AlgorithmTest, 0); #endif armory-0.92.3/cppForSwig/cryptopp/bench.h0000755000000000000000000000032612414772654017027 0ustar rootroot#ifndef CRYPTOPP_BENCH_H #define CRYPTOPP_BENCH_H #include "cryptlib.h" extern const double CLOCK_TICKS_PER_SECOND; void BenchmarkAll(double t, double hertz); void BenchmarkAll2(double t, double hertz); #endif armory-0.92.3/cppForSwig/cryptopp/pubkey.cpp0000755000000000000000000001760212414772654017607 0ustar rootroot// pubkey.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "pubkey.h" NAMESPACE_BEGIN(CryptoPP) void P1363_MGF1KDF2_Common(HashTransformation &hash, byte *output, size_t outputLength, const byte *input, size_t inputLength, const byte *derivationParams, size_t derivationParamsLength, bool mask, unsigned int counterStart) { ArraySink *sink; HashFilter filter(hash, sink = mask ? new ArrayXorSink(output, outputLength) : new ArraySink(output, outputLength)); word32 counter = counterStart; while (sink->AvailableSize() > 0) { filter.Put(input, inputLength); filter.PutWord32(counter++); filter.Put(derivationParams, derivationParamsLength); filter.MessageEnd(); } } bool PK_DeterministicSignatureMessageEncodingMethod::VerifyMessageRepresentative( HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const { SecByteBlock computedRepresentative(BitsToBytes(representativeBitLength)); ComputeMessageRepresentative(NullRNG(), NULL, 0, hash, hashIdentifier, messageEmpty, computedRepresentative, representativeBitLength); return VerifyBufsEqual(representative, computedRepresentative, computedRepresentative.size()); } bool PK_RecoverableSignatureMessageEncodingMethod::VerifyMessageRepresentative( HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const { SecByteBlock recoveredMessage(MaxRecoverableLength(representativeBitLength, hashIdentifier.second, hash.DigestSize())); DecodingResult result = RecoverMessageFromRepresentative( hash, hashIdentifier, messageEmpty, representative, representativeBitLength, recoveredMessage); return result.isValidCoding && result.messageLength == 0; } void TF_SignerBase::InputRecoverableMessage(PK_MessageAccumulator &messageAccumulator, const byte *recoverableMessage, size_t recoverableMessageLength) const { PK_MessageAccumulatorBase &ma = static_cast(messageAccumulator); HashIdentifier id = GetHashIdentifier(); const MessageEncodingInterface &encoding = GetMessageEncodingInterface(); if (MessageRepresentativeBitLength() < encoding.MinRepresentativeBitLength(id.second, ma.AccessHash().DigestSize())) throw PK_SignatureScheme::KeyTooShort(); size_t maxRecoverableLength = encoding.MaxRecoverableLength(MessageRepresentativeBitLength(), GetHashIdentifier().second, ma.AccessHash().DigestSize()); if (maxRecoverableLength == 0) {throw NotImplemented("TF_SignerBase: this algorithm does not support messsage recovery or the key is too short");} if (recoverableMessageLength > maxRecoverableLength) throw InvalidArgument("TF_SignerBase: the recoverable message part is too long for the given key and algorithm"); ma.m_recoverableMessage.Assign(recoverableMessage, recoverableMessageLength); encoding.ProcessRecoverableMessage( ma.AccessHash(), recoverableMessage, recoverableMessageLength, NULL, 0, ma.m_semisignature); } size_t TF_SignerBase::SignAndRestart(RandomNumberGenerator &rng, PK_MessageAccumulator &messageAccumulator, byte *signature, bool restart) const { PK_MessageAccumulatorBase &ma = static_cast(messageAccumulator); HashIdentifier id = GetHashIdentifier(); const MessageEncodingInterface &encoding = GetMessageEncodingInterface(); if (MessageRepresentativeBitLength() < encoding.MinRepresentativeBitLength(id.second, ma.AccessHash().DigestSize())) throw PK_SignatureScheme::KeyTooShort(); SecByteBlock representative(MessageRepresentativeLength()); encoding.ComputeMessageRepresentative(rng, ma.m_recoverableMessage, ma.m_recoverableMessage.size(), ma.AccessHash(), id, ma.m_empty, representative, MessageRepresentativeBitLength()); ma.m_empty = true; Integer r(representative, representative.size()); size_t signatureLength = SignatureLength(); GetTrapdoorFunctionInterface().CalculateRandomizedInverse(rng, r).Encode(signature, signatureLength); return signatureLength; } void TF_VerifierBase::InputSignature(PK_MessageAccumulator &messageAccumulator, const byte *signature, size_t signatureLength) const { PK_MessageAccumulatorBase &ma = static_cast(messageAccumulator); HashIdentifier id = GetHashIdentifier(); const MessageEncodingInterface &encoding = GetMessageEncodingInterface(); if (MessageRepresentativeBitLength() < encoding.MinRepresentativeBitLength(id.second, ma.AccessHash().DigestSize())) throw PK_SignatureScheme::KeyTooShort(); ma.m_representative.New(MessageRepresentativeLength()); Integer x = GetTrapdoorFunctionInterface().ApplyFunction(Integer(signature, signatureLength)); if (x.BitCount() > MessageRepresentativeBitLength()) x = Integer::Zero(); // don't return false here to prevent timing attack x.Encode(ma.m_representative, ma.m_representative.size()); } bool TF_VerifierBase::VerifyAndRestart(PK_MessageAccumulator &messageAccumulator) const { PK_MessageAccumulatorBase &ma = static_cast(messageAccumulator); HashIdentifier id = GetHashIdentifier(); const MessageEncodingInterface &encoding = GetMessageEncodingInterface(); if (MessageRepresentativeBitLength() < encoding.MinRepresentativeBitLength(id.second, ma.AccessHash().DigestSize())) throw PK_SignatureScheme::KeyTooShort(); bool result = encoding.VerifyMessageRepresentative( ma.AccessHash(), id, ma.m_empty, ma.m_representative, MessageRepresentativeBitLength()); ma.m_empty = true; return result; } DecodingResult TF_VerifierBase::RecoverAndRestart(byte *recoveredMessage, PK_MessageAccumulator &messageAccumulator) const { PK_MessageAccumulatorBase &ma = static_cast(messageAccumulator); HashIdentifier id = GetHashIdentifier(); const MessageEncodingInterface &encoding = GetMessageEncodingInterface(); if (MessageRepresentativeBitLength() < encoding.MinRepresentativeBitLength(id.second, ma.AccessHash().DigestSize())) throw PK_SignatureScheme::KeyTooShort(); DecodingResult result = encoding.RecoverMessageFromRepresentative( ma.AccessHash(), id, ma.m_empty, ma.m_representative, MessageRepresentativeBitLength(), recoveredMessage); ma.m_empty = true; return result; } DecodingResult TF_DecryptorBase::Decrypt(RandomNumberGenerator &rng, const byte *ciphertext, size_t ciphertextLength, byte *plaintext, const NameValuePairs ¶meters) const { if (ciphertextLength != FixedCiphertextLength()) throw InvalidArgument(AlgorithmName() + ": ciphertext length of " + IntToString(ciphertextLength) + " doesn't match the required length of " + IntToString(FixedCiphertextLength()) + " for this key"); SecByteBlock paddedBlock(PaddedBlockByteLength()); Integer x = GetTrapdoorFunctionInterface().CalculateInverse(rng, Integer(ciphertext, ciphertextLength)); if (x.ByteCount() > paddedBlock.size()) x = Integer::Zero(); // don't return false here to prevent timing attack x.Encode(paddedBlock, paddedBlock.size()); return GetMessageEncodingInterface().Unpad(paddedBlock, PaddedBlockBitLength(), plaintext, parameters); } void TF_EncryptorBase::Encrypt(RandomNumberGenerator &rng, const byte *plaintext, size_t plaintextLength, byte *ciphertext, const NameValuePairs ¶meters) const { if (plaintextLength > FixedMaxPlaintextLength()) { if (FixedMaxPlaintextLength() < 1) throw InvalidArgument(AlgorithmName() + ": this key is too short to encrypt any messages"); else throw InvalidArgument(AlgorithmName() + ": message length of " + IntToString(plaintextLength) + " exceeds the maximum of " + IntToString(FixedMaxPlaintextLength()) + " for this public key"); } SecByteBlock paddedBlock(PaddedBlockByteLength()); GetMessageEncodingInterface().Pad(rng, plaintext, plaintextLength, paddedBlock, PaddedBlockBitLength(), parameters); GetTrapdoorFunctionInterface().ApplyRandomizedFunction(rng, Integer(paddedBlock, paddedBlock.size())).Encode(ciphertext, FixedCiphertextLength()); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/salsa.h0000755000000000000000000000417612414772654017062 0ustar rootroot// salsa.h - written and placed in the public domain by Wei Dai #ifndef CRYPTOPP_SALSA_H #define CRYPTOPP_SALSA_H #include "strciphr.h" NAMESPACE_BEGIN(CryptoPP) //! _ struct Salsa20_Info : public VariableKeyLength<32, 16, 32, 16, SimpleKeyingInterface::UNIQUE_IV, 8> { static const char *StaticAlgorithmName() {return "Salsa20";} }; class CRYPTOPP_NO_VTABLE Salsa20_Policy : public AdditiveCipherConcretePolicy { protected: void CipherSetKey(const NameValuePairs ¶ms, const byte *key, size_t length); void OperateKeystream(KeystreamOperation operation, byte *output, const byte *input, size_t iterationCount); void CipherResynchronize(byte *keystreamBuffer, const byte *IV, size_t length); bool CipherIsRandomAccess() const {return true;} void SeekToIteration(lword iterationCount); #if CRYPTOPP_BOOL_X86 || CRYPTOPP_BOOL_X64 unsigned int GetAlignment() const; unsigned int GetOptimalBlockSize() const; #endif FixedSizeAlignedSecBlock m_state; int m_rounds; }; /// Salsa20, variable rounds: 8, 12 or 20 (default 20) struct Salsa20 : public Salsa20_Info, public SymmetricCipherDocumentation { typedef SymmetricCipherFinal >, Salsa20_Info> Encryption; typedef Encryption Decryption; }; //! _ struct XSalsa20_Info : public FixedKeyLength<32, SimpleKeyingInterface::UNIQUE_IV, 24> { static const char *StaticAlgorithmName() {return "XSalsa20";} }; class CRYPTOPP_NO_VTABLE XSalsa20_Policy : public Salsa20_Policy { public: void CipherSetKey(const NameValuePairs ¶ms, const byte *key, size_t length); void CipherResynchronize(byte *keystreamBuffer, const byte *IV, size_t length); protected: FixedSizeSecBlock m_key; }; /// XSalsa20, variable rounds: 8, 12 or 20 (default 20) struct XSalsa20 : public XSalsa20_Info, public SymmetricCipherDocumentation { typedef SymmetricCipherFinal >, XSalsa20_Info> Encryption; typedef Encryption Decryption; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/factory.h0000755000000000000000000001020112414772654017410 0ustar rootroot#ifndef CRYPTOPP_OBJFACT_H #define CRYPTOPP_OBJFACT_H #include "cryptlib.h" #include #include NAMESPACE_BEGIN(CryptoPP) //! _ template class ObjectFactory { public: virtual AbstractClass * CreateObject() const =0; }; //! _ template class DefaultObjectFactory : public ObjectFactory { public: AbstractClass * CreateObject() const { return new ConcreteClass; } }; //! _ template class ObjectFactoryRegistry { public: class FactoryNotFound : public Exception { public: FactoryNotFound(const char *name) : Exception(OTHER_ERROR, std::string("ObjectFactoryRegistry: could not find factory for algorithm ") + name) {} }; ~ObjectFactoryRegistry() { for (CPP_TYPENAME Map::iterator i = m_map.begin(); i != m_map.end(); ++i) { delete (ObjectFactory *)i->second; i->second = NULL; } } void RegisterFactory(const std::string &name, ObjectFactory *factory) { m_map[name] = factory; } const ObjectFactory * GetFactory(const char *name) const { CPP_TYPENAME Map::const_iterator i = m_map.find(name); return i == m_map.end() ? NULL : (ObjectFactory *)i->second; } AbstractClass *CreateObject(const char *name) const { const ObjectFactory *factory = GetFactory(name); if (!factory) throw FactoryNotFound(name); return factory->CreateObject(); } // Return a vector containing the factory names. This is easier than returning an iterator. // from Andrew Pitonyak std::vector GetFactoryNames() const { std::vector names; CPP_TYPENAME Map::const_iterator iter; for (iter = m_map.begin(); iter != m_map.end(); ++iter) names.push_back(iter->first); return names; } CRYPTOPP_NOINLINE static ObjectFactoryRegistry & Registry(CRYPTOPP_NOINLINE_DOTDOTDOT); private: // use void * instead of ObjectFactory * to save code size typedef std::map Map; Map m_map; }; template ObjectFactoryRegistry & ObjectFactoryRegistry::Registry(CRYPTOPP_NOINLINE_DOTDOTDOT) { static ObjectFactoryRegistry s_registry; return s_registry; } template struct RegisterDefaultFactoryFor { RegisterDefaultFactoryFor(const char *name=NULL) { // BCB2006 workaround std::string n = name ? std::string(name) : std::string(ConcreteClass::StaticAlgorithmName()); ObjectFactoryRegistry::Registry(). RegisterFactory(n, new DefaultObjectFactory); }}; template void RegisterAsymmetricCipherDefaultFactories(const char *name=NULL, SchemeClass *dummy=NULL) { RegisterDefaultFactoryFor((const char *)name); RegisterDefaultFactoryFor((const char *)name); } template void RegisterSignatureSchemeDefaultFactories(const char *name=NULL, SchemeClass *dummy=NULL) { RegisterDefaultFactoryFor((const char *)name); RegisterDefaultFactoryFor((const char *)name); } template void RegisterSymmetricCipherDefaultFactories(const char *name=NULL, SchemeClass *dummy=NULL) { RegisterDefaultFactoryFor((const char *)name); RegisterDefaultFactoryFor((const char *)name); } template void RegisterAuthenticatedSymmetricCipherDefaultFactories(const char *name=NULL, SchemeClass *dummy=NULL) { RegisterDefaultFactoryFor((const char *)name); RegisterDefaultFactoryFor((const char *)name); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/files.cpp0000755000000000000000000001325512414772654017412 0ustar rootroot// files.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "files.h" #include NAMESPACE_BEGIN(CryptoPP) using namespace std; #ifndef NDEBUG void Files_TestInstantiations() { FileStore f0; FileSource f1; FileSink f2; } #endif void FileStore::StoreInitialize(const NameValuePairs ¶meters) { m_waiting = false; m_stream = NULL; m_file.release(); const char *fileName = NULL; #if defined(CRYPTOPP_UNIX_AVAILABLE) || _MSC_VER >= 1400 const wchar_t *fileNameWide = NULL; if (!parameters.GetValue(Name::InputFileNameWide(), fileNameWide)) #endif if (!parameters.GetValue(Name::InputFileName(), fileName)) { parameters.GetValue(Name::InputStreamPointer(), m_stream); return; } ios::openmode binary = parameters.GetValueWithDefault(Name::InputBinaryMode(), true) ? ios::binary : ios::openmode(0); m_file.reset(new std::ifstream); #ifdef CRYPTOPP_UNIX_AVAILABLE std::string narrowed; if (fileNameWide) fileName = (narrowed = StringNarrow(fileNameWide)).c_str(); #endif #if _MSC_VER >= 1400 if (fileNameWide) { m_file->open(fileNameWide, ios::in | binary); if (!*m_file) throw OpenErr(StringNarrow(fileNameWide, false)); } #endif if (fileName) { m_file->open(fileName, ios::in | binary); if (!*m_file) throw OpenErr(fileName); } m_stream = m_file.get(); } lword FileStore::MaxRetrievable() const { if (!m_stream) return 0; streampos current = m_stream->tellg(); streampos end = m_stream->seekg(0, ios::end).tellg(); m_stream->seekg(current); return end-current; } size_t FileStore::TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel, bool blocking) { if (!m_stream) { transferBytes = 0; return 0; } lword size=transferBytes; transferBytes = 0; if (m_waiting) goto output; while (size && m_stream->good()) { { size_t spaceSize = 1024; m_space = HelpCreatePutSpace(target, channel, 1, UnsignedMin(size_t(0)-1, size), spaceSize); m_stream->read((char *)m_space, (unsigned int)STDMIN(size, (lword)spaceSize)); } m_len = (size_t)m_stream->gcount(); size_t blockedBytes; output: blockedBytes = target.ChannelPutModifiable2(channel, m_space, m_len, 0, blocking); m_waiting = blockedBytes > 0; if (m_waiting) return blockedBytes; size -= m_len; transferBytes += m_len; } if (!m_stream->good() && !m_stream->eof()) throw ReadErr(); return 0; } size_t FileStore::CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end, const std::string &channel, bool blocking) const { if (!m_stream) return 0; if (begin == 0 && end == 1) { int result = m_stream->peek(); if (result == char_traits::eof()) return 0; else { size_t blockedBytes = target.ChannelPut(channel, byte(result), blocking); begin += 1-blockedBytes; return blockedBytes; } } // TODO: figure out what happens on cin streampos current = m_stream->tellg(); streampos endPosition = m_stream->seekg(0, ios::end).tellg(); streampos newPosition = current + (streamoff)begin; if (newPosition >= endPosition) { m_stream->seekg(current); return 0; // don't try to seek beyond the end of file } m_stream->seekg(newPosition); try { assert(!m_waiting); lword copyMax = end-begin; size_t blockedBytes = const_cast(this)->TransferTo2(target, copyMax, channel, blocking); begin += copyMax; if (blockedBytes) { const_cast(this)->m_waiting = false; return blockedBytes; } } catch(...) { m_stream->clear(); m_stream->seekg(current); throw; } m_stream->clear(); m_stream->seekg(current); return 0; } lword FileStore::Skip(lword skipMax) { if (!m_stream) return 0; lword oldPos = m_stream->tellg(); std::istream::off_type offset; if (!SafeConvert(skipMax, offset)) throw InvalidArgument("FileStore: maximum seek offset exceeded"); m_stream->seekg(offset, ios::cur); return (lword)m_stream->tellg() - oldPos; } void FileSink::IsolatedInitialize(const NameValuePairs ¶meters) { m_stream = NULL; m_file.release(); const char *fileName = NULL; #if defined(CRYPTOPP_UNIX_AVAILABLE) || _MSC_VER >= 1400 const wchar_t *fileNameWide = NULL; if (!parameters.GetValue(Name::OutputFileNameWide(), fileNameWide)) #endif if (!parameters.GetValue(Name::OutputFileName(), fileName)) { parameters.GetValue(Name::OutputStreamPointer(), m_stream); return; } ios::openmode binary = parameters.GetValueWithDefault(Name::OutputBinaryMode(), true) ? ios::binary : ios::openmode(0); m_file.reset(new std::ofstream); #ifdef CRYPTOPP_UNIX_AVAILABLE std::string narrowed; if (fileNameWide) fileName = (narrowed = StringNarrow(fileNameWide)).c_str(); #endif #if _MSC_VER >= 1400 if (fileNameWide) { m_file->open(fileNameWide, ios::out | ios::trunc | binary); if (!*m_file) throw OpenErr(StringNarrow(fileNameWide, false)); } #endif if (fileName) { m_file->open(fileName, ios::out | ios::trunc | binary); if (!*m_file) throw OpenErr(fileName); } m_stream = m_file.get(); } bool FileSink::IsolatedFlush(bool hardFlush, bool blocking) { if (!m_stream) throw Err("FileSink: output stream not opened"); m_stream->flush(); if (!m_stream->good()) throw WriteErr(); return false; } size_t FileSink::Put2(const byte *inString, size_t length, int messageEnd, bool blocking) { if (!m_stream) throw Err("FileSink: output stream not opened"); while (length > 0) { std::streamsize size; if (!SafeConvert(length, size)) size = numeric_limits::max(); m_stream->write((const char *)inString, size); inString += size; length -= (size_t)size; } if (messageEnd) m_stream->flush(); if (!m_stream->good()) throw WriteErr(); return 0; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/dlltest.cpp0000755000000000000000000001306312414772654017760 0ustar rootroot#ifndef CRYPTOPP_DLL_ONLY #define CRYPTOPP_DEFAULT_NO_DLL #endif #include "dll.h" USING_NAMESPACE(CryptoPP) USING_NAMESPACE(std) void FIPS140_SampleApplication() { if (!FIPS_140_2_ComplianceEnabled()) { cerr << "FIPS 140-2 compliance was turned off at compile time.\n"; abort(); } // check self test status if (GetPowerUpSelfTestStatus() != POWER_UP_SELF_TEST_PASSED) { cerr << "Automatic power-up self test failed.\n"; abort(); } cout << "0. Automatic power-up self test passed.\n"; // simulate a power-up self test error SimulatePowerUpSelfTestFailure(); try { // trying to use a crypto algorithm after power-up self test error will result in an exception AES::Encryption aes; // should not be here cerr << "Use of AES failed to cause an exception after power-up self test error.\n"; abort(); } catch (SelfTestFailure &e) { cout << "1. Caught expected exception when simulating self test failure. Exception message follows: "; cout << e.what() << endl; } // clear the self test error state and redo power-up self test DoDllPowerUpSelfTest(); if (GetPowerUpSelfTestStatus() != POWER_UP_SELF_TEST_PASSED) { cerr << "Re-do power-up self test failed.\n"; abort(); } cout << "2. Re-do power-up self test passed.\n"; // encrypt and decrypt const byte key[] = {0x01,0x23,0x45,0x67,0x89,0xab,0xcd,0xef, 0x01,0x23,0x45,0x67,0x89,0xab,0xcd,0xef, 0x01,0x23,0x45,0x67,0x89,0xab,0xcd,0xef}; const byte iv[] = {0x12,0x34,0x56,0x78,0x90,0xab,0xcd,0xef}; const byte plaintext[] = { // "Now is the time for all " without tailing 0 0x4e,0x6f,0x77,0x20,0x69,0x73,0x20,0x74, 0x68,0x65,0x20,0x74,0x69,0x6d,0x65,0x20, 0x66,0x6f,0x72,0x20,0x61,0x6c,0x6c,0x20}; byte ciphertext[24]; byte decrypted[24]; CFB_FIPS_Mode::Encryption encryption_DES_EDE3_CFB; encryption_DES_EDE3_CFB.SetKeyWithIV(key, sizeof(key), iv); encryption_DES_EDE3_CFB.ProcessString(ciphertext, plaintext, 24); CFB_FIPS_Mode::Decryption decryption_DES_EDE3_CFB; decryption_DES_EDE3_CFB.SetKeyWithIV(key, sizeof(key), iv); decryption_DES_EDE3_CFB.ProcessString(decrypted, ciphertext, 24); if (memcmp(plaintext, decrypted, 24) != 0) { cerr << "DES-EDE3-CFB Encryption/decryption failed.\n"; abort(); } cout << "3. DES-EDE3-CFB Encryption/decryption succeeded.\n"; // hash const byte message[] = {'a', 'b', 'c'}; const byte expectedDigest[] = {0xA9,0x99,0x3E,0x36,0x47,0x06,0x81,0x6A,0xBA,0x3E,0x25,0x71,0x78,0x50,0xC2,0x6C,0x9C,0xD0,0xD8,0x9D}; byte digest[20]; SHA1 sha; sha.Update(message, 3); sha.Final(digest); if (memcmp(digest, expectedDigest, 20) != 0) { cerr << "SHA-1 hash failed.\n"; abort(); } cout << "4. SHA-1 hash succeeded.\n"; // create auto-seeded X9.17 RNG object, if available #ifdef OS_RNG_AVAILABLE AutoSeededX917RNG rng; #else // this is used to allow this function to compile on platforms that don't have auto-seeded RNGs RandomNumberGenerator &rng(NullRNG()); #endif // generate DSA key DSA::PrivateKey dsaPrivateKey; dsaPrivateKey.GenerateRandomWithKeySize(rng, 1024); DSA::PublicKey dsaPublicKey; dsaPublicKey.AssignFrom(dsaPrivateKey); if (!dsaPrivateKey.Validate(rng, 3) || !dsaPublicKey.Validate(rng, 3)) { cerr << "DSA key generation failed.\n"; abort(); } cout << "5. DSA key generation succeeded.\n"; // encode DSA key std::string encodedDsaPublicKey, encodedDsaPrivateKey; dsaPublicKey.DEREncode(StringSink(encodedDsaPublicKey).Ref()); dsaPrivateKey.DEREncode(StringSink(encodedDsaPrivateKey).Ref()); // decode DSA key DSA::PrivateKey decodedDsaPrivateKey; decodedDsaPrivateKey.BERDecode(StringStore(encodedDsaPrivateKey).Ref()); DSA::PublicKey decodedDsaPublicKey; decodedDsaPublicKey.BERDecode(StringStore(encodedDsaPublicKey).Ref()); if (!decodedDsaPrivateKey.Validate(rng, 3) || !decodedDsaPublicKey.Validate(rng, 3)) { cerr << "DSA key encode/decode failed.\n"; abort(); } cout << "6. DSA key encode/decode succeeded.\n"; // sign and verify byte signature[40]; DSA::Signer signer(dsaPrivateKey); assert(signer.SignatureLength() == 40); signer.SignMessage(rng, message, 3, signature); DSA::Verifier verifier(dsaPublicKey); if (!verifier.VerifyMessage(message, 3, signature, sizeof(signature))) { cerr << "DSA signature and verification failed.\n"; abort(); } cout << "7. DSA signature and verification succeeded.\n"; // try to verify an invalid signature signature[0] ^= 1; if (verifier.VerifyMessage(message, 3, signature, sizeof(signature))) { cerr << "DSA signature verification failed to detect bad signature.\n"; abort(); } cout << "8. DSA signature verification successfully detected bad signature.\n"; // try to use an invalid key length try { ECB_Mode::Encryption encryption_DES_EDE3_ECB; encryption_DES_EDE3_ECB.SetKey(key, 5); // should not be here cerr << "DES-EDE3 implementation did not detect use of invalid key length.\n"; abort(); } catch (InvalidArgument &e) { cout << "9. Caught expected exception when using invalid key length. Exception message follows: "; cout << e.what() << endl; } cout << "\nFIPS 140-2 Sample Application completed normally.\n"; } #ifdef CRYPTOPP_IMPORTS static PNew s_pNew = NULL; static PDelete s_pDelete = NULL; extern "C" __declspec(dllexport) void __cdecl SetNewAndDeleteFromCryptoPP(PNew pNew, PDelete pDelete, PSetNewHandler pSetNewHandler) { s_pNew = pNew; s_pDelete = pDelete; } void * __cdecl operator new (size_t size) { return s_pNew(size); } void __cdecl operator delete (void * p) { s_pDelete(p); } #endif #ifdef CRYPTOPP_DLL_ONLY int __cdecl main() { FIPS140_SampleApplication(); return 0; } #endif armory-0.92.3/cppForSwig/cryptopp/dessp.cpp0000755000000000000000000001404512414772654017424 0ustar rootroot// This file is mostly generated by Phil Karn's gensp.c #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "des.h" NAMESPACE_BEGIN(CryptoPP) // VC60 workaround: gives a C4786 warning without this function // when runtime lib is set to multithread debug DLL // even though warning 4786 is disabled! void DES_VC60Workaround() { } const word32 RawDES::Spbox[8][64] = { { 0x01010400,0x00000000,0x00010000,0x01010404, 0x01010004,0x00010404,0x00000004,0x00010000, 0x00000400,0x01010400,0x01010404,0x00000400, 0x01000404,0x01010004,0x01000000,0x00000004, 0x00000404,0x01000400,0x01000400,0x00010400, 0x00010400,0x01010000,0x01010000,0x01000404, 0x00010004,0x01000004,0x01000004,0x00010004, 0x00000000,0x00000404,0x00010404,0x01000000, 0x00010000,0x01010404,0x00000004,0x01010000, 0x01010400,0x01000000,0x01000000,0x00000400, 0x01010004,0x00010000,0x00010400,0x01000004, 0x00000400,0x00000004,0x01000404,0x00010404, 0x01010404,0x00010004,0x01010000,0x01000404, 0x01000004,0x00000404,0x00010404,0x01010400, 0x00000404,0x01000400,0x01000400,0x00000000, 0x00010004,0x00010400,0x00000000,0x01010004}, { 0x80108020,0x80008000,0x00008000,0x00108020, 0x00100000,0x00000020,0x80100020,0x80008020, 0x80000020,0x80108020,0x80108000,0x80000000, 0x80008000,0x00100000,0x00000020,0x80100020, 0x00108000,0x00100020,0x80008020,0x00000000, 0x80000000,0x00008000,0x00108020,0x80100000, 0x00100020,0x80000020,0x00000000,0x00108000, 0x00008020,0x80108000,0x80100000,0x00008020, 0x00000000,0x00108020,0x80100020,0x00100000, 0x80008020,0x80100000,0x80108000,0x00008000, 0x80100000,0x80008000,0x00000020,0x80108020, 0x00108020,0x00000020,0x00008000,0x80000000, 0x00008020,0x80108000,0x00100000,0x80000020, 0x00100020,0x80008020,0x80000020,0x00100020, 0x00108000,0x00000000,0x80008000,0x00008020, 0x80000000,0x80100020,0x80108020,0x00108000}, { 0x00000208,0x08020200,0x00000000,0x08020008, 0x08000200,0x00000000,0x00020208,0x08000200, 0x00020008,0x08000008,0x08000008,0x00020000, 0x08020208,0x00020008,0x08020000,0x00000208, 0x08000000,0x00000008,0x08020200,0x00000200, 0x00020200,0x08020000,0x08020008,0x00020208, 0x08000208,0x00020200,0x00020000,0x08000208, 0x00000008,0x08020208,0x00000200,0x08000000, 0x08020200,0x08000000,0x00020008,0x00000208, 0x00020000,0x08020200,0x08000200,0x00000000, 0x00000200,0x00020008,0x08020208,0x08000200, 0x08000008,0x00000200,0x00000000,0x08020008, 0x08000208,0x00020000,0x08000000,0x08020208, 0x00000008,0x00020208,0x00020200,0x08000008, 0x08020000,0x08000208,0x00000208,0x08020000, 0x00020208,0x00000008,0x08020008,0x00020200}, { 0x00802001,0x00002081,0x00002081,0x00000080, 0x00802080,0x00800081,0x00800001,0x00002001, 0x00000000,0x00802000,0x00802000,0x00802081, 0x00000081,0x00000000,0x00800080,0x00800001, 0x00000001,0x00002000,0x00800000,0x00802001, 0x00000080,0x00800000,0x00002001,0x00002080, 0x00800081,0x00000001,0x00002080,0x00800080, 0x00002000,0x00802080,0x00802081,0x00000081, 0x00800080,0x00800001,0x00802000,0x00802081, 0x00000081,0x00000000,0x00000000,0x00802000, 0x00002080,0x00800080,0x00800081,0x00000001, 0x00802001,0x00002081,0x00002081,0x00000080, 0x00802081,0x00000081,0x00000001,0x00002000, 0x00800001,0x00002001,0x00802080,0x00800081, 0x00002001,0x00002080,0x00800000,0x00802001, 0x00000080,0x00800000,0x00002000,0x00802080}, { 0x00000100,0x02080100,0x02080000,0x42000100, 0x00080000,0x00000100,0x40000000,0x02080000, 0x40080100,0x00080000,0x02000100,0x40080100, 0x42000100,0x42080000,0x00080100,0x40000000, 0x02000000,0x40080000,0x40080000,0x00000000, 0x40000100,0x42080100,0x42080100,0x02000100, 0x42080000,0x40000100,0x00000000,0x42000000, 0x02080100,0x02000000,0x42000000,0x00080100, 0x00080000,0x42000100,0x00000100,0x02000000, 0x40000000,0x02080000,0x42000100,0x40080100, 0x02000100,0x40000000,0x42080000,0x02080100, 0x40080100,0x00000100,0x02000000,0x42080000, 0x42080100,0x00080100,0x42000000,0x42080100, 0x02080000,0x00000000,0x40080000,0x42000000, 0x00080100,0x02000100,0x40000100,0x00080000, 0x00000000,0x40080000,0x02080100,0x40000100}, { 0x20000010,0x20400000,0x00004000,0x20404010, 0x20400000,0x00000010,0x20404010,0x00400000, 0x20004000,0x00404010,0x00400000,0x20000010, 0x00400010,0x20004000,0x20000000,0x00004010, 0x00000000,0x00400010,0x20004010,0x00004000, 0x00404000,0x20004010,0x00000010,0x20400010, 0x20400010,0x00000000,0x00404010,0x20404000, 0x00004010,0x00404000,0x20404000,0x20000000, 0x20004000,0x00000010,0x20400010,0x00404000, 0x20404010,0x00400000,0x00004010,0x20000010, 0x00400000,0x20004000,0x20000000,0x00004010, 0x20000010,0x20404010,0x00404000,0x20400000, 0x00404010,0x20404000,0x00000000,0x20400010, 0x00000010,0x00004000,0x20400000,0x00404010, 0x00004000,0x00400010,0x20004010,0x00000000, 0x20404000,0x20000000,0x00400010,0x20004010}, { 0x00200000,0x04200002,0x04000802,0x00000000, 0x00000800,0x04000802,0x00200802,0x04200800, 0x04200802,0x00200000,0x00000000,0x04000002, 0x00000002,0x04000000,0x04200002,0x00000802, 0x04000800,0x00200802,0x00200002,0x04000800, 0x04000002,0x04200000,0x04200800,0x00200002, 0x04200000,0x00000800,0x00000802,0x04200802, 0x00200800,0x00000002,0x04000000,0x00200800, 0x04000000,0x00200800,0x00200000,0x04000802, 0x04000802,0x04200002,0x04200002,0x00000002, 0x00200002,0x04000000,0x04000800,0x00200000, 0x04200800,0x00000802,0x00200802,0x04200800, 0x00000802,0x04000002,0x04200802,0x04200000, 0x00200800,0x00000000,0x00000002,0x04200802, 0x00000000,0x00200802,0x04200000,0x00000800, 0x04000002,0x04000800,0x00000800,0x00200002}, { 0x10001040,0x00001000,0x00040000,0x10041040, 0x10000000,0x10001040,0x00000040,0x10000000, 0x00040040,0x10040000,0x10041040,0x00041000, 0x10041000,0x00041040,0x00001000,0x00000040, 0x10040000,0x10000040,0x10001000,0x00001040, 0x00041000,0x00040040,0x10040040,0x10041000, 0x00001040,0x00000000,0x00000000,0x10040040, 0x10000040,0x10001000,0x00041040,0x00040000, 0x00041040,0x00040000,0x10041000,0x00001000, 0x00000040,0x10040040,0x00001000,0x00041040, 0x10001000,0x00000040,0x10000040,0x10040000, 0x10040040,0x10000000,0x00040000,0x10001040, 0x00000000,0x10041040,0x00040040,0x10000040, 0x10040000,0x10001000,0x10001040,0x00000000, 0x10041040,0x00041000,0x00041000,0x00001040, 0x00001040,0x00040040,0x10000000,0x10041000} }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/xtrcrypt.h0000755000000000000000000000340412414772654017647 0ustar rootroot#ifndef CRYPTOPP_XTRCRYPT_H #define CRYPTOPP_XTRCRYPT_H /** \file "The XTR public key system" by Arjen K. Lenstra and Eric R. Verheul */ #include "xtr.h" NAMESPACE_BEGIN(CryptoPP) //! XTR-DH with key validation class XTR_DH : public SimpleKeyAgreementDomain, public CryptoParameters { typedef XTR_DH ThisClass; public: XTR_DH(const Integer &p, const Integer &q, const GFP2Element &g); XTR_DH(RandomNumberGenerator &rng, unsigned int pbits, unsigned int qbits); XTR_DH(BufferedTransformation &domainParams); void DEREncode(BufferedTransformation &domainParams) const; bool Validate(RandomNumberGenerator &rng, unsigned int level) const; bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; void AssignFrom(const NameValuePairs &source); CryptoParameters & AccessCryptoParameters() {return *this;} unsigned int AgreedValueLength() const {return 2*m_p.ByteCount();} unsigned int PrivateKeyLength() const {return m_q.ByteCount();} unsigned int PublicKeyLength() const {return 2*m_p.ByteCount();} void GeneratePrivateKey(RandomNumberGenerator &rng, byte *privateKey) const; void GeneratePublicKey(RandomNumberGenerator &rng, const byte *privateKey, byte *publicKey) const; bool Agree(byte *agreedValue, const byte *privateKey, const byte *otherPublicKey, bool validateOtherPublicKey=true) const; const Integer &GetModulus() const {return m_p;} const Integer &GetSubgroupOrder() const {return m_q;} const GFP2Element &GetSubgroupGenerator() const {return m_g;} void SetModulus(const Integer &p) {m_p = p;} void SetSubgroupOrder(const Integer &q) {m_q = q;} void SetSubgroupGenerator(const GFP2Element &g) {m_g = g;} private: unsigned int ExponentBitLength() const; Integer m_p, m_q; GFP2Element m_g; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/emsa2.cpp0000755000000000000000000000226412414772654017315 0ustar rootroot// emsa2.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "emsa2.h" #ifndef CRYPTOPP_IMPORTS NAMESPACE_BEGIN(CryptoPP) void EMSA2Pad::ComputeMessageRepresentative(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, HashTransformation &hash, HashIdentifier hashIdentifier, bool messageEmpty, byte *representative, size_t representativeBitLength) const { assert(representativeBitLength >= MinRepresentativeBitLength(hashIdentifier.second, hash.DigestSize())); if (representativeBitLength % 8 != 7) throw PK_SignatureScheme::InvalidKeyLength("EMSA2: EMSA2 requires a key length that is a multiple of 8"); size_t digestSize = hash.DigestSize(); size_t representativeByteLength = BitsToBytes(representativeBitLength); representative[0] = messageEmpty ? 0x4b : 0x6b; memset(representative+1, 0xbb, representativeByteLength-digestSize-4); // pad with 0xbb byte *afterP2 = representative+representativeByteLength-digestSize-3; afterP2[0] = 0xba; hash.Final(afterP2+1); representative[representativeByteLength-2] = *hashIdentifier.first; representative[representativeByteLength-1] = 0xcc; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/fltrimpl.h0000755000000000000000000000362512414772654017606 0ustar rootroot#ifndef CRYPTOPP_FLTRIMPL_H #define CRYPTOPP_FLTRIMPL_H #define FILTER_BEGIN \ switch (m_continueAt) \ { \ case 0: \ m_inputPosition = 0; #define FILTER_END_NO_MESSAGE_END_NO_RETURN \ break; \ default: \ assert(false); \ } #define FILTER_END_NO_MESSAGE_END \ FILTER_END_NO_MESSAGE_END_NO_RETURN \ return 0; /* #define FILTER_END \ case -1: \ if (messageEnd && Output(-1, NULL, 0, messageEnd, blocking)) \ return 1; \ FILTER_END_NO_MESSAGE_END */ #define FILTER_OUTPUT3(site, statement, output, length, messageEnd, channel) \ {\ case site: \ statement; \ if (Output(site, output, length, messageEnd, blocking, channel)) \ return STDMAX(size_t(1), length-m_inputPosition);\ } #define FILTER_OUTPUT2(site, statement, output, length, messageEnd) \ FILTER_OUTPUT3(site, statement, output, length, messageEnd, DEFAULT_CHANNEL) #define FILTER_OUTPUT(site, output, length, messageEnd) \ FILTER_OUTPUT2(site, 0, output, length, messageEnd) #define FILTER_OUTPUT_BYTE(site, output) \ FILTER_OUTPUT(site, &(const byte &)(byte)output, 1, 0) #define FILTER_OUTPUT2_MODIFIABLE(site, statement, output, length, messageEnd) \ {\ case site: \ statement; \ if (OutputModifiable(site, output, length, messageEnd, blocking)) \ return STDMAX(size_t(1), length-m_inputPosition);\ } #define FILTER_OUTPUT_MODIFIABLE(site, output, length, messageEnd) \ FILTER_OUTPUT2_MODIFIABLE(site, 0, output, length, messageEnd) #define FILTER_OUTPUT2_MAYBE_MODIFIABLE(site, statement, output, length, messageEnd, modifiable) \ {\ case site: \ statement; \ if (modifiable ? OutputModifiable(site, output, length, messageEnd, blocking) : Output(site, output, length, messageEnd, blocking)) \ return STDMAX(size_t(1), length-m_inputPosition);\ } #define FILTER_OUTPUT_MAYBE_MODIFIABLE(site, output, length, messageEnd, modifiable) \ FILTER_OUTPUT2_MAYBE_MODIFIABLE(site, 0, output, length, messageEnd, modifiable) #endif armory-0.92.3/cppForSwig/cryptopp/zinflate.cpp0000755000000000000000000004021012414772654020113 0ustar rootroot// zinflate.cpp - written and placed in the public domain by Wei Dai // This is a complete reimplementation of the DEFLATE decompression algorithm. // It should not be affected by any security vulnerabilities in the zlib // compression library. In particular it is not affected by the double free bug // (http://www.kb.cert.org/vuls/id/368819). #include "pch.h" #include "zinflate.h" NAMESPACE_BEGIN(CryptoPP) struct CodeLessThan { inline bool operator()(CryptoPP::HuffmanDecoder::code_t lhs, const CryptoPP::HuffmanDecoder::CodeInfo &rhs) {return lhs < rhs.code;} // needed for MSVC .NET 2005 inline bool operator()(const CryptoPP::HuffmanDecoder::CodeInfo &lhs, const CryptoPP::HuffmanDecoder::CodeInfo &rhs) {return lhs.code < rhs.code;} }; inline bool LowFirstBitReader::FillBuffer(unsigned int length) { while (m_bitsBuffered < length) { byte b; if (!m_store.Get(b)) return false; m_buffer |= (unsigned long)b << m_bitsBuffered; m_bitsBuffered += 8; } assert(m_bitsBuffered <= sizeof(unsigned long)*8); return true; } inline unsigned long LowFirstBitReader::PeekBits(unsigned int length) { bool result = FillBuffer(length); assert(result); return m_buffer & (((unsigned long)1 << length) - 1); } inline void LowFirstBitReader::SkipBits(unsigned int length) { assert(m_bitsBuffered >= length); m_buffer >>= length; m_bitsBuffered -= length; } inline unsigned long LowFirstBitReader::GetBits(unsigned int length) { unsigned long result = PeekBits(length); SkipBits(length); return result; } inline HuffmanDecoder::code_t HuffmanDecoder::NormalizeCode(HuffmanDecoder::code_t code, unsigned int codeBits) { return code << (MAX_CODE_BITS - codeBits); } void HuffmanDecoder::Initialize(const unsigned int *codeBits, unsigned int nCodes) { // the Huffman codes are represented in 3 ways in this code: // // 1. most significant code bit (i.e. top of code tree) in the least significant bit position // 2. most significant code bit (i.e. top of code tree) in the most significant bit position // 3. most significant code bit (i.e. top of code tree) in n-th least significant bit position, // where n is the maximum code length for this code tree // // (1) is the way the codes come in from the deflate stream // (2) is used to sort codes so they can be binary searched // (3) is used in this function to compute codes from code lengths // // a code in representation (2) is called "normalized" here // The BitReverse() function is used to convert between (1) and (2) // The NormalizeCode() function is used to convert from (3) to (2) if (nCodes == 0) throw Err("null code"); m_maxCodeBits = *std::max_element(codeBits, codeBits+nCodes); if (m_maxCodeBits > MAX_CODE_BITS) throw Err("code length exceeds maximum"); if (m_maxCodeBits == 0) throw Err("null code"); // count number of codes of each length SecBlockWithHint blCount(m_maxCodeBits+1); std::fill(blCount.begin(), blCount.end(), 0); unsigned int i; for (i=0; i nextCode(m_maxCodeBits+1); nextCode[1] = 0; for (i=2; i<=m_maxCodeBits; i++) { // compute this while checking for overflow: code = (code + blCount[i-1]) << 1 if (code > code + blCount[i-1]) throw Err("codes oversubscribed"); code += blCount[i-1]; if (code > (code << 1)) throw Err("codes oversubscribed"); code <<= 1; nextCode[i] = code; } if (code > (1 << m_maxCodeBits) - blCount[m_maxCodeBits]) throw Err("codes oversubscribed"); else if (m_maxCodeBits != 1 && code < (1 << m_maxCodeBits) - blCount[m_maxCodeBits]) throw Err("codes incomplete"); // compute a vector of triples sorted by code m_codeToValue.resize(nCodes - blCount[0]); unsigned int j=0; for (i=0; ilen) { entry.type = 2; entry.len = codeInfo.len; } else { entry.type = 3; entry.end = last+1; } } } inline unsigned int HuffmanDecoder::Decode(code_t code, /* out */ value_t &value) const { assert(m_codeToValue.size() > 0); LookupEntry &entry = m_cache[code & m_cacheMask]; code_t normalizedCode; if (entry.type != 1) normalizedCode = BitReverse(code); if (entry.type == 0) FillCacheEntry(entry, normalizedCode); if (entry.type == 1) { value = entry.value; return entry.len; } else { const CodeInfo &codeInfo = (entry.type == 2) ? entry.begin[(normalizedCode << m_cacheBits) >> (MAX_CODE_BITS - (entry.len - m_cacheBits))] : *(std::upper_bound(entry.begin, entry.end, normalizedCode, CodeLessThan())-1); value = codeInfo.value; return codeInfo.len; } } bool HuffmanDecoder::Decode(LowFirstBitReader &reader, value_t &value) const { reader.FillBuffer(m_maxCodeBits); unsigned int codeBits = Decode(reader.PeekBuffer(), value); if (codeBits > reader.BitsBuffered()) return false; reader.SkipBits(codeBits); return true; } // ************************************************************* Inflator::Inflator(BufferedTransformation *attachment, bool repeat, int propagation) : AutoSignaling(propagation) , m_state(PRE_STREAM), m_repeat(repeat), m_reader(m_inQueue) { Detach(attachment); } void Inflator::IsolatedInitialize(const NameValuePairs ¶meters) { m_state = PRE_STREAM; parameters.GetValue("Repeat", m_repeat); m_inQueue.Clear(); m_reader.SkipBits(m_reader.BitsBuffered()); } void Inflator::OutputByte(byte b) { m_window[m_current++] = b; if (m_current == m_window.size()) { ProcessDecompressedData(m_window + m_lastFlush, m_window.size() - m_lastFlush); m_lastFlush = 0; m_current = 0; m_wrappedAround = true; } } void Inflator::OutputString(const byte *string, size_t length) { while (length) { size_t len = UnsignedMin(length, m_window.size() - m_current); memcpy(m_window + m_current, string, len); m_current += len; if (m_current == m_window.size()) { ProcessDecompressedData(m_window + m_lastFlush, m_window.size() - m_lastFlush); m_lastFlush = 0; m_current = 0; m_wrappedAround = true; } string += len; length -= len; } } void Inflator::OutputPast(unsigned int length, unsigned int distance) { size_t start; if (distance <= m_current) start = m_current - distance; else if (m_wrappedAround && distance <= m_window.size()) start = m_current + m_window.size() - distance; else throw BadBlockErr(); if (start + length > m_window.size()) { for (; start < m_window.size(); start++, length--) OutputByte(m_window[start]); start = 0; } if (start + length > m_current || m_current + length >= m_window.size()) { while (length--) OutputByte(m_window[start++]); } else { memcpy(m_window + m_current, m_window + start, length); m_current += length; } } size_t Inflator::Put2(const byte *inString, size_t length, int messageEnd, bool blocking) { if (!blocking) throw BlockingInputOnly("Inflator"); LazyPutter lp(m_inQueue, inString, length); ProcessInput(messageEnd != 0); if (messageEnd) if (!(m_state == PRE_STREAM || m_state == AFTER_END)) throw UnexpectedEndErr(); Output(0, NULL, 0, messageEnd, blocking); return 0; } bool Inflator::IsolatedFlush(bool hardFlush, bool blocking) { if (!blocking) throw BlockingInputOnly("Inflator"); if (hardFlush) ProcessInput(true); FlushOutput(); return false; } void Inflator::ProcessInput(bool flush) { while (true) { switch (m_state) { case PRE_STREAM: if (!flush && m_inQueue.CurrentSize() < MaxPrestreamHeaderSize()) return; ProcessPrestreamHeader(); m_state = WAIT_HEADER; m_wrappedAround = false; m_current = 0; m_lastFlush = 0; m_window.New(1 << GetLog2WindowSize()); break; case WAIT_HEADER: { // maximum number of bytes before actual compressed data starts const size_t MAX_HEADER_SIZE = BitsToBytes(3+5+5+4+19*7+286*15+19*15); if (m_inQueue.CurrentSize() < (flush ? 1 : MAX_HEADER_SIZE)) return; DecodeHeader(); break; } case DECODING_BODY: if (!DecodeBody()) return; break; case POST_STREAM: if (!flush && m_inQueue.CurrentSize() < MaxPoststreamTailSize()) return; ProcessPoststreamTail(); m_state = m_repeat ? PRE_STREAM : AFTER_END; Output(0, NULL, 0, GetAutoSignalPropagation(), true); // TODO: non-blocking if (m_inQueue.IsEmpty()) return; break; case AFTER_END: m_inQueue.TransferTo(*AttachedTransformation()); return; } } } void Inflator::DecodeHeader() { if (!m_reader.FillBuffer(3)) throw UnexpectedEndErr(); m_eof = m_reader.GetBits(1) != 0; m_blockType = (byte)m_reader.GetBits(2); switch (m_blockType) { case 0: // stored { m_reader.SkipBits(m_reader.BitsBuffered() % 8); if (!m_reader.FillBuffer(32)) throw UnexpectedEndErr(); m_storedLen = (word16)m_reader.GetBits(16); word16 nlen = (word16)m_reader.GetBits(16); if (nlen != (word16)~m_storedLen) throw BadBlockErr(); break; } case 1: // fixed codes m_nextDecode = LITERAL; break; case 2: // dynamic codes { if (!m_reader.FillBuffer(5+5+4)) throw UnexpectedEndErr(); unsigned int hlit = m_reader.GetBits(5); unsigned int hdist = m_reader.GetBits(5); unsigned int hclen = m_reader.GetBits(4); FixedSizeSecBlock codeLengths; unsigned int i; static const unsigned int border[] = { // Order of the bit length code lengths 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; std::fill(codeLengths.begin(), codeLengths+19, 0); for (i=0; i hlit+257+hdist+1) throw BadBlockErr(); std::fill(codeLengths + i, codeLengths + i + count, repeater); i += count; } m_dynamicLiteralDecoder.Initialize(codeLengths, hlit+257); if (hdist == 0 && codeLengths[hlit+257] == 0) { if (hlit != 0) // a single zero distance code length means all literals throw BadBlockErr(); } else m_dynamicDistanceDecoder.Initialize(codeLengths+hlit+257, hdist+1); m_nextDecode = LITERAL; } catch (HuffmanDecoder::Err &) { throw BadBlockErr(); } break; } default: throw BadBlockErr(); // reserved block type } m_state = DECODING_BODY; } bool Inflator::DecodeBody() { bool blockEnd = false; switch (m_blockType) { case 0: // stored assert(m_reader.BitsBuffered() == 0); while (!m_inQueue.IsEmpty() && !blockEnd) { size_t size; const byte *block = m_inQueue.Spy(size); size = UnsignedMin(m_storedLen, size); OutputString(block, size); m_inQueue.Skip(size); m_storedLen -= (word16)size; if (m_storedLen == 0) blockEnd = true; } break; case 1: // fixed codes case 2: // dynamic codes static const unsigned int lengthStarts[] = { 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258}; static const unsigned int lengthExtraBits[] = { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0}; static const unsigned int distanceStarts[] = { 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577}; static const unsigned int distanceExtraBits[] = { 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13}; const HuffmanDecoder& literalDecoder = GetLiteralDecoder(); const HuffmanDecoder& distanceDecoder = GetDistanceDecoder(); switch (m_nextDecode) { case LITERAL: while (true) { if (!literalDecoder.Decode(m_reader, m_literal)) { m_nextDecode = LITERAL; break; } if (m_literal < 256) OutputByte((byte)m_literal); else if (m_literal == 256) // end of block { blockEnd = true; break; } else { if (m_literal > 285) throw BadBlockErr(); unsigned int bits; case LENGTH_BITS: bits = lengthExtraBits[m_literal-257]; if (!m_reader.FillBuffer(bits)) { m_nextDecode = LENGTH_BITS; break; } m_literal = m_reader.GetBits(bits) + lengthStarts[m_literal-257]; case DISTANCE: if (!distanceDecoder.Decode(m_reader, m_distance)) { m_nextDecode = DISTANCE; break; } case DISTANCE_BITS: bits = distanceExtraBits[m_distance]; if (!m_reader.FillBuffer(bits)) { m_nextDecode = DISTANCE_BITS; break; } m_distance = m_reader.GetBits(bits) + distanceStarts[m_distance]; OutputPast(m_literal, m_distance); } } } } if (blockEnd) { if (m_eof) { FlushOutput(); m_reader.SkipBits(m_reader.BitsBuffered()%8); if (m_reader.BitsBuffered()) { // undo too much lookahead SecBlockWithHint buffer(m_reader.BitsBuffered() / 8); for (unsigned int i=0; i= m_lastFlush); ProcessDecompressedData(m_window + m_lastFlush, m_current - m_lastFlush); m_lastFlush = m_current; } } struct NewFixedLiteralDecoder { HuffmanDecoder * operator()() const { unsigned int codeLengths[288]; std::fill(codeLengths + 0, codeLengths + 144, 8); std::fill(codeLengths + 144, codeLengths + 256, 9); std::fill(codeLengths + 256, codeLengths + 280, 7); std::fill(codeLengths + 280, codeLengths + 288, 8); std::auto_ptr pDecoder(new HuffmanDecoder); pDecoder->Initialize(codeLengths, 288); return pDecoder.release(); } }; struct NewFixedDistanceDecoder { HuffmanDecoder * operator()() const { unsigned int codeLengths[32]; std::fill(codeLengths + 0, codeLengths + 32, 5); std::auto_ptr pDecoder(new HuffmanDecoder); pDecoder->Initialize(codeLengths, 32); return pDecoder.release(); } }; const HuffmanDecoder& Inflator::GetLiteralDecoder() const { return m_blockType == 1 ? Singleton().Ref() : m_dynamicLiteralDecoder; } const HuffmanDecoder& Inflator::GetDistanceDecoder() const { return m_blockType == 1 ? Singleton().Ref() : m_dynamicDistanceDecoder; } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/x64masm.asm0000755000000000000000000010763312414772654017611 0ustar rootrootinclude ksamd64.inc EXTERNDEF s_sosemanukMulTables:FAR .CODE ALIGN 8 Salsa20_OperateKeystream PROC FRAME mov r10, [rsp + 5*8] alloc_stack(10*16 + 32*16 + 8) save_xmm128 xmm6, 0200h save_xmm128 xmm7, 0210h save_xmm128 xmm8, 0220h save_xmm128 xmm9, 0230h save_xmm128 xmm10, 0240h save_xmm128 xmm11, 0250h save_xmm128 xmm12, 0260h save_xmm128 xmm13, 0270h save_xmm128 xmm14, 0280h save_xmm128 xmm15, 0290h .endprolog cmp r8, 4 jl label5 movdqa xmm0, [r10 + 0*16] movdqa xmm1, [r10 + 1*16] movdqa xmm2, [r10 + 2*16] movdqa xmm3, [r10 + 3*16] pshufd xmm4, xmm0, 0*64+0*16+0*4+0 movdqa [rsp + (0*4+0)*16 + 256], xmm4 pshufd xmm4, xmm0, 1*64+1*16+1*4+1 movdqa [rsp + (0*4+1)*16 + 256], xmm4 pshufd xmm4, xmm0, 2*64+2*16+2*4+2 movdqa [rsp + (0*4+2)*16 + 256], xmm4 pshufd xmm4, xmm0, 3*64+3*16+3*4+3 movdqa [rsp + (0*4+3)*16 + 256], xmm4 pshufd xmm4, xmm1, 0*64+0*16+0*4+0 movdqa [rsp + (1*4+0)*16 + 256], xmm4 pshufd xmm4, xmm1, 2*64+2*16+2*4+2 movdqa [rsp + (1*4+2)*16 + 256], xmm4 pshufd xmm4, xmm1, 3*64+3*16+3*4+3 movdqa [rsp + (1*4+3)*16 + 256], xmm4 pshufd xmm4, xmm2, 1*64+1*16+1*4+1 movdqa [rsp + (2*4+1)*16 + 256], xmm4 pshufd xmm4, xmm2, 2*64+2*16+2*4+2 movdqa [rsp + (2*4+2)*16 + 256], xmm4 pshufd xmm4, xmm2, 3*64+3*16+3*4+3 movdqa [rsp + (2*4+3)*16 + 256], xmm4 pshufd xmm4, xmm3, 0*64+0*16+0*4+0 movdqa [rsp + (3*4+0)*16 + 256], xmm4 pshufd xmm4, xmm3, 1*64+1*16+1*4+1 movdqa [rsp + (3*4+1)*16 + 256], xmm4 pshufd xmm4, xmm3, 2*64+2*16+2*4+2 movdqa [rsp + (3*4+2)*16 + 256], xmm4 pshufd xmm4, xmm3, 3*64+3*16+3*4+3 movdqa [rsp + (3*4+3)*16 + 256], xmm4 label1: mov eax, dword ptr [r10 + 8*4] mov r11d, dword ptr [r10 + 5*4] mov dword ptr [rsp + 8*16 + 0*4 + 256], eax mov dword ptr [rsp + 5*16 + 0*4 + 256], r11d add eax, 1 adc r11d, 0 mov dword ptr [rsp + 8*16 + 1*4 + 256], eax mov dword ptr [rsp + 5*16 + 1*4 + 256], r11d add eax, 1 adc r11d, 0 mov dword ptr [rsp + 8*16 + 2*4 + 256], eax mov dword ptr [rsp + 5*16 + 2*4 + 256], r11d add eax, 1 adc r11d, 0 mov dword ptr [rsp + 8*16 + 3*4 + 256], eax mov dword ptr [rsp + 5*16 + 3*4 + 256], r11d add eax, 1 adc r11d, 0 mov dword ptr [r10 + 8*4], eax mov dword ptr [r10 + 5*4], r11d movdqa xmm0, [rsp + 12*16 + 1*256] movdqa xmm4, [rsp + 13*16 + 1*256] movdqa xmm8, [rsp + 14*16 + 1*256] movdqa xmm12, [rsp + 15*16 + 1*256] movdqa xmm2, [rsp + 0*16 + 1*256] movdqa xmm6, [rsp + 1*16 + 1*256] movdqa xmm10, [rsp + 2*16 + 1*256] movdqa xmm14, [rsp + 3*16 + 1*256] paddd xmm0, xmm2 paddd xmm4, xmm6 paddd xmm8, xmm10 paddd xmm12, xmm14 movdqa xmm1, xmm0 movdqa xmm5, xmm4 movdqa xmm9, xmm8 movdqa xmm13, xmm12 pslld xmm0, 7 pslld xmm4, 7 pslld xmm8, 7 pslld xmm12, 7 psrld xmm1, 32-7 psrld xmm5, 32-7 psrld xmm9, 32-7 psrld xmm13, 32-7 pxor xmm0, [rsp + 4*16 + 1*256] pxor xmm4, [rsp + 5*16 + 1*256] pxor xmm8, [rsp + 6*16 + 1*256] pxor xmm12, [rsp + 7*16 + 1*256] pxor xmm0, xmm1 pxor xmm4, xmm5 pxor xmm8, xmm9 pxor xmm12, xmm13 movdqa [rsp + 4*16], xmm0 movdqa [rsp + 5*16], xmm4 movdqa [rsp + 6*16], xmm8 movdqa [rsp + 7*16], xmm12 movdqa xmm1, xmm0 movdqa xmm5, xmm4 movdqa xmm9, xmm8 movdqa xmm13, xmm12 paddd xmm0, xmm2 paddd xmm4, xmm6 paddd xmm8, xmm10 paddd xmm12, xmm14 movdqa xmm3, xmm0 movdqa xmm7, xmm4 movdqa xmm11, xmm8 movdqa xmm15, xmm12 pslld xmm0, 9 pslld xmm4, 9 pslld xmm8, 9 pslld xmm12, 9 psrld xmm3, 32-9 psrld xmm7, 32-9 psrld xmm11, 32-9 psrld xmm15, 32-9 pxor xmm0, [rsp + 8*16 + 1*256] pxor xmm4, [rsp + 9*16 + 1*256] pxor xmm8, [rsp + 10*16 + 1*256] pxor xmm12, [rsp + 11*16 + 1*256] pxor xmm0, xmm3 pxor xmm4, xmm7 pxor xmm8, xmm11 pxor xmm12, xmm15 movdqa [rsp + 8*16], xmm0 movdqa [rsp + 9*16], xmm4 movdqa [rsp + 10*16], xmm8 movdqa [rsp + 11*16], xmm12 movdqa xmm3, xmm0 movdqa xmm7, xmm4 movdqa xmm11, xmm8 movdqa xmm15, xmm12 paddd xmm0, xmm1 paddd xmm4, xmm5 paddd xmm8, xmm9 paddd xmm12, xmm13 movdqa xmm1, xmm0 movdqa xmm5, xmm4 movdqa xmm9, xmm8 movdqa xmm13, xmm12 pslld xmm0, 13 pslld xmm4, 13 pslld xmm8, 13 pslld xmm12, 13 psrld xmm1, 32-13 psrld xmm5, 32-13 psrld xmm9, 32-13 psrld xmm13, 32-13 pxor xmm0, [rsp + 12*16 + 1*256] pxor xmm4, [rsp + 13*16 + 1*256] pxor xmm8, [rsp + 14*16 + 1*256] pxor xmm12, [rsp + 15*16 + 1*256] pxor xmm0, xmm1 pxor xmm4, xmm5 pxor xmm8, xmm9 pxor xmm12, xmm13 movdqa [rsp + 12*16], xmm0 movdqa [rsp + 13*16], xmm4 movdqa [rsp + 14*16], xmm8 movdqa [rsp + 15*16], xmm12 paddd xmm0, xmm3 paddd xmm4, xmm7 paddd xmm8, xmm11 paddd xmm12, xmm15 movdqa xmm3, xmm0 movdqa xmm7, xmm4 movdqa xmm11, xmm8 movdqa xmm15, xmm12 pslld xmm0, 18 pslld xmm4, 18 pslld xmm8, 18 pslld xmm12, 18 psrld xmm3, 32-18 psrld xmm7, 32-18 psrld xmm11, 32-18 psrld xmm15, 32-18 pxor xmm0, xmm2 pxor xmm4, xmm6 pxor xmm8, xmm10 pxor xmm12, xmm14 pxor xmm0, xmm3 pxor xmm4, xmm7 pxor xmm8, xmm11 pxor xmm12, xmm15 movdqa [rsp + 0*16], xmm0 movdqa [rsp + 1*16], xmm4 movdqa [rsp + 2*16], xmm8 movdqa [rsp + 3*16], xmm12 mov rax, r9 jmp label2 labelSSE2_Salsa_Output: movdqa xmm0, xmm4 punpckldq xmm4, xmm5 movdqa xmm1, xmm6 punpckldq xmm6, xmm7 movdqa xmm2, xmm4 punpcklqdq xmm4, xmm6 punpckhqdq xmm2, xmm6 punpckhdq xmm0, xmm5 punpckhdq xmm1, xmm7 movdqa xmm6, xmm0 punpcklqdq xmm0, xmm1 punpckhqdq xmm6, xmm1 test rdx, rdx jz labelSSE2_Salsa_Output_A3 test rdx, 15 jnz labelSSE2_Salsa_Output_A7 pxor xmm4, [rdx+0*16] pxor xmm2, [rdx+4*16] pxor xmm0, [rdx+8*16] pxor xmm6, [rdx+12*16] add rdx, 1*16 jmp labelSSE2_Salsa_Output_A3 labelSSE2_Salsa_Output_A7: movdqu xmm1, [rdx+0*16] pxor xmm4, xmm1 movdqu xmm1, [rdx+4*16] pxor xmm2, xmm1 movdqu xmm1, [rdx+8*16] pxor xmm0, xmm1 movdqu xmm1, [rdx+12*16] pxor xmm6, xmm1 add rdx, 1*16 labelSSE2_Salsa_Output_A3: test rcx, 15 jnz labelSSE2_Salsa_Output_A8 movdqa [rcx+0*16], xmm4 movdqa [rcx+4*16], xmm2 movdqa [rcx+8*16], xmm0 movdqa [rcx+12*16], xmm6 jmp labelSSE2_Salsa_Output_A9 labelSSE2_Salsa_Output_A8: movdqu [rcx+0*16], xmm4 movdqu [rcx+4*16], xmm2 movdqu [rcx+8*16], xmm0 movdqu [rcx+12*16], xmm6 labelSSE2_Salsa_Output_A9: add rcx, 1*16 ret label6: movdqa xmm0, [rsp + 12*16 + 0*256] movdqa xmm4, [rsp + 13*16 + 0*256] movdqa xmm8, [rsp + 14*16 + 0*256] movdqa xmm12, [rsp + 15*16 + 0*256] movdqa xmm2, [rsp + 0*16 + 0*256] movdqa xmm6, [rsp + 1*16 + 0*256] movdqa xmm10, [rsp + 2*16 + 0*256] movdqa xmm14, [rsp + 3*16 + 0*256] paddd xmm0, xmm2 paddd xmm4, xmm6 paddd xmm8, xmm10 paddd xmm12, xmm14 movdqa xmm1, xmm0 movdqa xmm5, xmm4 movdqa xmm9, xmm8 movdqa xmm13, xmm12 pslld xmm0, 7 pslld xmm4, 7 pslld xmm8, 7 pslld xmm12, 7 psrld xmm1, 32-7 psrld xmm5, 32-7 psrld xmm9, 32-7 psrld xmm13, 32-7 pxor xmm0, [rsp + 4*16 + 0*256] pxor xmm4, [rsp + 5*16 + 0*256] pxor xmm8, [rsp + 6*16 + 0*256] pxor xmm12, [rsp + 7*16 + 0*256] pxor xmm0, xmm1 pxor xmm4, xmm5 pxor xmm8, xmm9 pxor xmm12, xmm13 movdqa [rsp + 4*16], xmm0 movdqa [rsp + 5*16], xmm4 movdqa [rsp + 6*16], xmm8 movdqa [rsp + 7*16], xmm12 movdqa xmm1, xmm0 movdqa xmm5, xmm4 movdqa xmm9, xmm8 movdqa xmm13, xmm12 paddd xmm0, xmm2 paddd xmm4, xmm6 paddd xmm8, xmm10 paddd xmm12, xmm14 movdqa xmm3, xmm0 movdqa xmm7, xmm4 movdqa xmm11, xmm8 movdqa xmm15, xmm12 pslld xmm0, 9 pslld xmm4, 9 pslld xmm8, 9 pslld xmm12, 9 psrld xmm3, 32-9 psrld xmm7, 32-9 psrld xmm11, 32-9 psrld xmm15, 32-9 pxor xmm0, [rsp + 8*16 + 0*256] pxor xmm4, [rsp + 9*16 + 0*256] pxor xmm8, [rsp + 10*16 + 0*256] pxor xmm12, [rsp + 11*16 + 0*256] pxor xmm0, xmm3 pxor xmm4, xmm7 pxor xmm8, xmm11 pxor xmm12, xmm15 movdqa [rsp + 8*16], xmm0 movdqa [rsp + 9*16], xmm4 movdqa [rsp + 10*16], xmm8 movdqa [rsp + 11*16], xmm12 movdqa xmm3, xmm0 movdqa xmm7, xmm4 movdqa xmm11, xmm8 movdqa xmm15, xmm12 paddd xmm0, xmm1 paddd xmm4, xmm5 paddd xmm8, xmm9 paddd xmm12, xmm13 movdqa xmm1, xmm0 movdqa xmm5, xmm4 movdqa xmm9, xmm8 movdqa xmm13, xmm12 pslld xmm0, 13 pslld xmm4, 13 pslld xmm8, 13 pslld xmm12, 13 psrld xmm1, 32-13 psrld xmm5, 32-13 psrld xmm9, 32-13 psrld xmm13, 32-13 pxor xmm0, [rsp + 12*16 + 0*256] pxor xmm4, [rsp + 13*16 + 0*256] pxor xmm8, [rsp + 14*16 + 0*256] pxor xmm12, [rsp + 15*16 + 0*256] pxor xmm0, xmm1 pxor xmm4, xmm5 pxor xmm8, xmm9 pxor xmm12, xmm13 movdqa [rsp + 12*16], xmm0 movdqa [rsp + 13*16], xmm4 movdqa [rsp + 14*16], xmm8 movdqa [rsp + 15*16], xmm12 paddd xmm0, xmm3 paddd xmm4, xmm7 paddd xmm8, xmm11 paddd xmm12, xmm15 movdqa xmm3, xmm0 movdqa xmm7, xmm4 movdqa xmm11, xmm8 movdqa xmm15, xmm12 pslld xmm0, 18 pslld xmm4, 18 pslld xmm8, 18 pslld xmm12, 18 psrld xmm3, 32-18 psrld xmm7, 32-18 psrld xmm11, 32-18 psrld xmm15, 32-18 pxor xmm0, xmm2 pxor xmm4, xmm6 pxor xmm8, xmm10 pxor xmm12, xmm14 pxor xmm0, xmm3 pxor xmm4, xmm7 pxor xmm8, xmm11 pxor xmm12, xmm15 movdqa [rsp + 0*16], xmm0 movdqa [rsp + 1*16], xmm4 movdqa [rsp + 2*16], xmm8 movdqa [rsp + 3*16], xmm12 label2: movdqa xmm0, [rsp + 7*16 + 0*256] movdqa xmm4, [rsp + 4*16 + 0*256] movdqa xmm8, [rsp + 5*16 + 0*256] movdqa xmm12, [rsp + 6*16 + 0*256] movdqa xmm2, [rsp + 0*16 + 0*256] movdqa xmm6, [rsp + 1*16 + 0*256] movdqa xmm10, [rsp + 2*16 + 0*256] movdqa xmm14, [rsp + 3*16 + 0*256] paddd xmm0, xmm2 paddd xmm4, xmm6 paddd xmm8, xmm10 paddd xmm12, xmm14 movdqa xmm1, xmm0 movdqa xmm5, xmm4 movdqa xmm9, xmm8 movdqa xmm13, xmm12 pslld xmm0, 7 pslld xmm4, 7 pslld xmm8, 7 pslld xmm12, 7 psrld xmm1, 32-7 psrld xmm5, 32-7 psrld xmm9, 32-7 psrld xmm13, 32-7 pxor xmm0, [rsp + 13*16 + 0*256] pxor xmm4, [rsp + 14*16 + 0*256] pxor xmm8, [rsp + 15*16 + 0*256] pxor xmm12, [rsp + 12*16 + 0*256] pxor xmm0, xmm1 pxor xmm4, xmm5 pxor xmm8, xmm9 pxor xmm12, xmm13 movdqa [rsp + 13*16], xmm0 movdqa [rsp + 14*16], xmm4 movdqa [rsp + 15*16], xmm8 movdqa [rsp + 12*16], xmm12 movdqa xmm1, xmm0 movdqa xmm5, xmm4 movdqa xmm9, xmm8 movdqa xmm13, xmm12 paddd xmm0, xmm2 paddd xmm4, xmm6 paddd xmm8, xmm10 paddd xmm12, xmm14 movdqa xmm3, xmm0 movdqa xmm7, xmm4 movdqa xmm11, xmm8 movdqa xmm15, xmm12 pslld xmm0, 9 pslld xmm4, 9 pslld xmm8, 9 pslld xmm12, 9 psrld xmm3, 32-9 psrld xmm7, 32-9 psrld xmm11, 32-9 psrld xmm15, 32-9 pxor xmm0, [rsp + 10*16 + 0*256] pxor xmm4, [rsp + 11*16 + 0*256] pxor xmm8, [rsp + 8*16 + 0*256] pxor xmm12, [rsp + 9*16 + 0*256] pxor xmm0, xmm3 pxor xmm4, xmm7 pxor xmm8, xmm11 pxor xmm12, xmm15 movdqa [rsp + 10*16], xmm0 movdqa [rsp + 11*16], xmm4 movdqa [rsp + 8*16], xmm8 movdqa [rsp + 9*16], xmm12 movdqa xmm3, xmm0 movdqa xmm7, xmm4 movdqa xmm11, xmm8 movdqa xmm15, xmm12 paddd xmm0, xmm1 paddd xmm4, xmm5 paddd xmm8, xmm9 paddd xmm12, xmm13 movdqa xmm1, xmm0 movdqa xmm5, xmm4 movdqa xmm9, xmm8 movdqa xmm13, xmm12 pslld xmm0, 13 pslld xmm4, 13 pslld xmm8, 13 pslld xmm12, 13 psrld xmm1, 32-13 psrld xmm5, 32-13 psrld xmm9, 32-13 psrld xmm13, 32-13 pxor xmm0, [rsp + 7*16 + 0*256] pxor xmm4, [rsp + 4*16 + 0*256] pxor xmm8, [rsp + 5*16 + 0*256] pxor xmm12, [rsp + 6*16 + 0*256] pxor xmm0, xmm1 pxor xmm4, xmm5 pxor xmm8, xmm9 pxor xmm12, xmm13 movdqa [rsp + 7*16], xmm0 movdqa [rsp + 4*16], xmm4 movdqa [rsp + 5*16], xmm8 movdqa [rsp + 6*16], xmm12 paddd xmm0, xmm3 paddd xmm4, xmm7 paddd xmm8, xmm11 paddd xmm12, xmm15 movdqa xmm3, xmm0 movdqa xmm7, xmm4 movdqa xmm11, xmm8 movdqa xmm15, xmm12 pslld xmm0, 18 pslld xmm4, 18 pslld xmm8, 18 pslld xmm12, 18 psrld xmm3, 32-18 psrld xmm7, 32-18 psrld xmm11, 32-18 psrld xmm15, 32-18 pxor xmm0, xmm2 pxor xmm4, xmm6 pxor xmm8, xmm10 pxor xmm12, xmm14 pxor xmm0, xmm3 pxor xmm4, xmm7 pxor xmm8, xmm11 pxor xmm12, xmm15 movdqa [rsp + 0*16], xmm0 movdqa [rsp + 1*16], xmm4 movdqa [rsp + 2*16], xmm8 movdqa [rsp + 3*16], xmm12 sub eax, 2 jnz label6 movdqa xmm4, [rsp + 0*16 + 256] paddd xmm4, [rsp + 0*16] movdqa xmm5, [rsp + 13*16 + 256] paddd xmm5, [rsp + 13*16] movdqa xmm6, [rsp + 10*16 + 256] paddd xmm6, [rsp + 10*16] movdqa xmm7, [rsp + 7*16 + 256] paddd xmm7, [rsp + 7*16] call labelSSE2_Salsa_Output movdqa xmm4, [rsp + 4*16 + 256] paddd xmm4, [rsp + 4*16] movdqa xmm5, [rsp + 1*16 + 256] paddd xmm5, [rsp + 1*16] movdqa xmm6, [rsp + 14*16 + 256] paddd xmm6, [rsp + 14*16] movdqa xmm7, [rsp + 11*16 + 256] paddd xmm7, [rsp + 11*16] call labelSSE2_Salsa_Output movdqa xmm4, [rsp + 8*16 + 256] paddd xmm4, [rsp + 8*16] movdqa xmm5, [rsp + 5*16 + 256] paddd xmm5, [rsp + 5*16] movdqa xmm6, [rsp + 2*16 + 256] paddd xmm6, [rsp + 2*16] movdqa xmm7, [rsp + 15*16 + 256] paddd xmm7, [rsp + 15*16] call labelSSE2_Salsa_Output movdqa xmm4, [rsp + 12*16 + 256] paddd xmm4, [rsp + 12*16] movdqa xmm5, [rsp + 9*16 + 256] paddd xmm5, [rsp + 9*16] movdqa xmm6, [rsp + 6*16 + 256] paddd xmm6, [rsp + 6*16] movdqa xmm7, [rsp + 3*16 + 256] paddd xmm7, [rsp + 3*16] call labelSSE2_Salsa_Output test rdx, rdx jz label9 add rdx, 12*16 label9: add rcx, 12*16 sub r8, 4 cmp r8, 4 jge label1 label5: sub r8, 1 jl label4 movdqa xmm0, [r10 + 0*16] movdqa xmm1, [r10 + 1*16] movdqa xmm2, [r10 + 2*16] movdqa xmm3, [r10 + 3*16] mov rax, r9 label0: movdqa xmm4, xmm3 paddd xmm4, xmm0 movdqa xmm5, xmm4 pslld xmm4, 7 psrld xmm5, 32-7 pxor xmm1, xmm4 pxor xmm1, xmm5 movdqa xmm4, xmm0 paddd xmm4, xmm1 movdqa xmm5, xmm4 pslld xmm4, 9 psrld xmm5, 32-9 pxor xmm2, xmm4 pxor xmm2, xmm5 movdqa xmm4, xmm1 paddd xmm4, xmm2 movdqa xmm5, xmm4 pslld xmm4, 13 psrld xmm5, 32-13 pxor xmm3, xmm4 pxor xmm3, xmm5 movdqa xmm4, xmm2 paddd xmm4, xmm3 movdqa xmm5, xmm4 pslld xmm4, 18 psrld xmm5, 32-18 pxor xmm0, xmm4 pxor xmm0, xmm5 pshufd xmm1, xmm1, 2*64+1*16+0*4+3 pshufd xmm2, xmm2, 1*64+0*16+3*4+2 pshufd xmm3, xmm3, 0*64+3*16+2*4+1 movdqa xmm4, xmm1 paddd xmm4, xmm0 movdqa xmm5, xmm4 pslld xmm4, 7 psrld xmm5, 32-7 pxor xmm3, xmm4 pxor xmm3, xmm5 movdqa xmm4, xmm0 paddd xmm4, xmm3 movdqa xmm5, xmm4 pslld xmm4, 9 psrld xmm5, 32-9 pxor xmm2, xmm4 pxor xmm2, xmm5 movdqa xmm4, xmm3 paddd xmm4, xmm2 movdqa xmm5, xmm4 pslld xmm4, 13 psrld xmm5, 32-13 pxor xmm1, xmm4 pxor xmm1, xmm5 movdqa xmm4, xmm2 paddd xmm4, xmm1 movdqa xmm5, xmm4 pslld xmm4, 18 psrld xmm5, 32-18 pxor xmm0, xmm4 pxor xmm0, xmm5 pshufd xmm1, xmm1, 0*64+3*16+2*4+1 pshufd xmm2, xmm2, 1*64+0*16+3*4+2 pshufd xmm3, xmm3, 2*64+1*16+0*4+3 sub eax, 2 jnz label0 paddd xmm0, [r10 + 0*16] paddd xmm1, [r10 + 1*16] paddd xmm2, [r10 + 2*16] paddd xmm3, [r10 + 3*16] add dword ptr [r10 + 8*4], 1 adc dword ptr [r10 + 5*4], 0 pcmpeqb xmm6, xmm6 psrlq xmm6, 32 pshufd xmm7, xmm6, 0*64+1*16+2*4+3 movdqa xmm4, xmm0 movdqa xmm5, xmm3 pand xmm0, xmm7 pand xmm4, xmm6 pand xmm3, xmm6 pand xmm5, xmm7 por xmm4, xmm5 movdqa xmm5, xmm1 pand xmm1, xmm7 pand xmm5, xmm6 por xmm0, xmm5 pand xmm6, xmm2 pand xmm2, xmm7 por xmm1, xmm6 por xmm2, xmm3 movdqa xmm5, xmm4 movdqa xmm6, xmm0 shufpd xmm4, xmm1, 2 shufpd xmm0, xmm2, 2 shufpd xmm1, xmm5, 2 shufpd xmm2, xmm6, 2 test rdx, rdx jz labelSSE2_Salsa_Output_B3 test rdx, 15 jnz labelSSE2_Salsa_Output_B7 pxor xmm4, [rdx+0*16] pxor xmm0, [rdx+1*16] pxor xmm1, [rdx+2*16] pxor xmm2, [rdx+3*16] add rdx, 4*16 jmp labelSSE2_Salsa_Output_B3 labelSSE2_Salsa_Output_B7: movdqu xmm3, [rdx+0*16] pxor xmm4, xmm3 movdqu xmm3, [rdx+1*16] pxor xmm0, xmm3 movdqu xmm3, [rdx+2*16] pxor xmm1, xmm3 movdqu xmm3, [rdx+3*16] pxor xmm2, xmm3 add rdx, 4*16 labelSSE2_Salsa_Output_B3: test rcx, 15 jnz labelSSE2_Salsa_Output_B8 movdqa [rcx+0*16], xmm4 movdqa [rcx+1*16], xmm0 movdqa [rcx+2*16], xmm1 movdqa [rcx+3*16], xmm2 jmp labelSSE2_Salsa_Output_B9 labelSSE2_Salsa_Output_B8: movdqu [rcx+0*16], xmm4 movdqu [rcx+1*16], xmm0 movdqu [rcx+2*16], xmm1 movdqu [rcx+3*16], xmm2 labelSSE2_Salsa_Output_B9: add rcx, 4*16 jmp label5 label4: movdqa xmm6, [rsp + 0200h] movdqa xmm7, [rsp + 0210h] movdqa xmm8, [rsp + 0220h] movdqa xmm9, [rsp + 0230h] movdqa xmm10, [rsp + 0240h] movdqa xmm11, [rsp + 0250h] movdqa xmm12, [rsp + 0260h] movdqa xmm13, [rsp + 0270h] movdqa xmm14, [rsp + 0280h] movdqa xmm15, [rsp + 0290h] add rsp, 10*16 + 32*16 + 8 ret Salsa20_OperateKeystream ENDP ALIGN 8 Sosemanuk_OperateKeystream PROC FRAME rex_push_reg rsi push_reg rdi alloc_stack(80*4*2+12*4+8*8 + 2*16+8) save_xmm128 xmm6, 02f0h save_xmm128 xmm7, 0300h .endprolog mov rdi, r8 mov rax, r9 mov QWORD PTR [rsp+1*8], rdi mov QWORD PTR [rsp+2*8], rdx mov QWORD PTR [rsp+6*8], rax lea rcx, [4*rcx+rcx] lea rsi, [4*rcx] mov QWORD PTR [rsp+3*8], rsi movdqa xmm0, [rax+0*16] movdqa [rsp + 8*8+0*16], xmm0 movdqa xmm0, [rax+1*16] movdqa [rsp + 8*8+1*16], xmm0 movq xmm0, QWORD PTR [rax+2*16] movq QWORD PTR [rsp + 8*8+2*16], xmm0 psrlq xmm0, 32 movd r10d, xmm0 mov ecx, [rax+10*4] mov edx, [rax+11*4] pcmpeqb xmm7, xmm7 label2: lea rdi, [rsp + 8*8 + 12*4] mov rax, 80 cmp rsi, 80 cmovg rsi, rax mov QWORD PTR [rsp+7*8], rsi lea rsi, [rdi+rsi] mov QWORD PTR [rsp+4*8], rsi lea rsi, s_sosemanukMulTables label0: mov eax, [rsp + 8*8 + ((0+0)-((0+0)/(10))*(10))*4] mov [rdi + (((0)-((0)/(4))*(4))*20 + (0/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + edx] xor r11d, ecx mov [rdi + (((0)-((0)/(4))*(4))*20 + (0/4)) * 4], r11d mov r11d, 1 and r11d, edx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((0+3)-((0+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((0+2)-((0+2)/(10))*(10))*4] add ecx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul edx, 54655307h rol edx, 7 mov [rsp + 8*8 + ((0+0)-((0+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((1+0)-((1+0)/(10))*(10))*4] mov [rdi + (((1)-((1)/(4))*(4))*20 + (1/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + ecx] xor r11d, edx mov [rdi + (((1)-((1)/(4))*(4))*20 + (1/4)) * 4], r11d mov r11d, 1 and r11d, ecx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((1+3)-((1+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((1+2)-((1+2)/(10))*(10))*4] add edx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul ecx, 54655307h rol ecx, 7 mov [rsp + 8*8 + ((1+0)-((1+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((2+0)-((2+0)/(10))*(10))*4] mov [rdi + (((2)-((2)/(4))*(4))*20 + (2/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + edx] xor r11d, ecx mov [rdi + (((2)-((2)/(4))*(4))*20 + (2/4)) * 4], r11d mov r11d, 1 and r11d, edx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((2+3)-((2+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((2+2)-((2+2)/(10))*(10))*4] add ecx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul edx, 54655307h rol edx, 7 mov [rsp + 8*8 + ((2+0)-((2+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((3+0)-((3+0)/(10))*(10))*4] mov [rdi + (((3)-((3)/(4))*(4))*20 + (3/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + ecx] xor r11d, edx mov [rdi + (((3)-((3)/(4))*(4))*20 + (3/4)) * 4], r11d mov r11d, 1 and r11d, ecx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((3+3)-((3+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((3+2)-((3+2)/(10))*(10))*4] add edx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul ecx, 54655307h rol ecx, 7 mov [rsp + 8*8 + ((3+0)-((3+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((4+0)-((4+0)/(10))*(10))*4] mov [rdi + (((4)-((4)/(4))*(4))*20 + (4/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + edx] xor r11d, ecx mov [rdi + (((4)-((4)/(4))*(4))*20 + (4/4)) * 4], r11d mov r11d, 1 and r11d, edx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((4+3)-((4+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((4+2)-((4+2)/(10))*(10))*4] add ecx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul edx, 54655307h rol edx, 7 mov [rsp + 8*8 + ((4+0)-((4+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((5+0)-((5+0)/(10))*(10))*4] mov [rdi + (((5)-((5)/(4))*(4))*20 + (5/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + ecx] xor r11d, edx mov [rdi + (((5)-((5)/(4))*(4))*20 + (5/4)) * 4], r11d mov r11d, 1 and r11d, ecx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((5+3)-((5+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((5+2)-((5+2)/(10))*(10))*4] add edx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul ecx, 54655307h rol ecx, 7 mov [rsp + 8*8 + ((5+0)-((5+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((6+0)-((6+0)/(10))*(10))*4] mov [rdi + (((6)-((6)/(4))*(4))*20 + (6/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + edx] xor r11d, ecx mov [rdi + (((6)-((6)/(4))*(4))*20 + (6/4)) * 4], r11d mov r11d, 1 and r11d, edx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((6+3)-((6+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((6+2)-((6+2)/(10))*(10))*4] add ecx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul edx, 54655307h rol edx, 7 mov [rsp + 8*8 + ((6+0)-((6+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((7+0)-((7+0)/(10))*(10))*4] mov [rdi + (((7)-((7)/(4))*(4))*20 + (7/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + ecx] xor r11d, edx mov [rdi + (((7)-((7)/(4))*(4))*20 + (7/4)) * 4], r11d mov r11d, 1 and r11d, ecx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((7+3)-((7+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((7+2)-((7+2)/(10))*(10))*4] add edx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul ecx, 54655307h rol ecx, 7 mov [rsp + 8*8 + ((7+0)-((7+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((8+0)-((8+0)/(10))*(10))*4] mov [rdi + (((8)-((8)/(4))*(4))*20 + (8/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + edx] xor r11d, ecx mov [rdi + (((8)-((8)/(4))*(4))*20 + (8/4)) * 4], r11d mov r11d, 1 and r11d, edx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((8+3)-((8+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((8+2)-((8+2)/(10))*(10))*4] add ecx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul edx, 54655307h rol edx, 7 mov [rsp + 8*8 + ((8+0)-((8+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((9+0)-((9+0)/(10))*(10))*4] mov [rdi + (((9)-((9)/(4))*(4))*20 + (9/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + ecx] xor r11d, edx mov [rdi + (((9)-((9)/(4))*(4))*20 + (9/4)) * 4], r11d mov r11d, 1 and r11d, ecx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((9+3)-((9+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((9+2)-((9+2)/(10))*(10))*4] add edx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul ecx, 54655307h rol ecx, 7 mov [rsp + 8*8 + ((9+0)-((9+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((10+0)-((10+0)/(10))*(10))*4] mov [rdi + (((10)-((10)/(4))*(4))*20 + (10/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + edx] xor r11d, ecx mov [rdi + (((10)-((10)/(4))*(4))*20 + (10/4)) * 4], r11d mov r11d, 1 and r11d, edx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((10+3)-((10+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((10+2)-((10+2)/(10))*(10))*4] add ecx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul edx, 54655307h rol edx, 7 mov [rsp + 8*8 + ((10+0)-((10+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((11+0)-((11+0)/(10))*(10))*4] mov [rdi + (((11)-((11)/(4))*(4))*20 + (11/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + ecx] xor r11d, edx mov [rdi + (((11)-((11)/(4))*(4))*20 + (11/4)) * 4], r11d mov r11d, 1 and r11d, ecx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((11+3)-((11+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((11+2)-((11+2)/(10))*(10))*4] add edx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul ecx, 54655307h rol ecx, 7 mov [rsp + 8*8 + ((11+0)-((11+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((12+0)-((12+0)/(10))*(10))*4] mov [rdi + (((12)-((12)/(4))*(4))*20 + (12/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + edx] xor r11d, ecx mov [rdi + (((12)-((12)/(4))*(4))*20 + (12/4)) * 4], r11d mov r11d, 1 and r11d, edx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((12+3)-((12+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((12+2)-((12+2)/(10))*(10))*4] add ecx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul edx, 54655307h rol edx, 7 mov [rsp + 8*8 + ((12+0)-((12+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((13+0)-((13+0)/(10))*(10))*4] mov [rdi + (((13)-((13)/(4))*(4))*20 + (13/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + ecx] xor r11d, edx mov [rdi + (((13)-((13)/(4))*(4))*20 + (13/4)) * 4], r11d mov r11d, 1 and r11d, ecx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((13+3)-((13+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((13+2)-((13+2)/(10))*(10))*4] add edx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul ecx, 54655307h rol ecx, 7 mov [rsp + 8*8 + ((13+0)-((13+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((14+0)-((14+0)/(10))*(10))*4] mov [rdi + (((14)-((14)/(4))*(4))*20 + (14/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + edx] xor r11d, ecx mov [rdi + (((14)-((14)/(4))*(4))*20 + (14/4)) * 4], r11d mov r11d, 1 and r11d, edx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((14+3)-((14+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((14+2)-((14+2)/(10))*(10))*4] add ecx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul edx, 54655307h rol edx, 7 mov [rsp + 8*8 + ((14+0)-((14+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((15+0)-((15+0)/(10))*(10))*4] mov [rdi + (((15)-((15)/(4))*(4))*20 + (15/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + ecx] xor r11d, edx mov [rdi + (((15)-((15)/(4))*(4))*20 + (15/4)) * 4], r11d mov r11d, 1 and r11d, ecx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((15+3)-((15+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((15+2)-((15+2)/(10))*(10))*4] add edx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul ecx, 54655307h rol ecx, 7 mov [rsp + 8*8 + ((15+0)-((15+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((16+0)-((16+0)/(10))*(10))*4] mov [rdi + (((16)-((16)/(4))*(4))*20 + (16/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + edx] xor r11d, ecx mov [rdi + (((16)-((16)/(4))*(4))*20 + (16/4)) * 4], r11d mov r11d, 1 and r11d, edx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((16+3)-((16+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((16+2)-((16+2)/(10))*(10))*4] add ecx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul edx, 54655307h rol edx, 7 mov [rsp + 8*8 + ((16+0)-((16+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((17+0)-((17+0)/(10))*(10))*4] mov [rdi + (((17)-((17)/(4))*(4))*20 + (17/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + ecx] xor r11d, edx mov [rdi + (((17)-((17)/(4))*(4))*20 + (17/4)) * 4], r11d mov r11d, 1 and r11d, ecx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((17+3)-((17+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((17+2)-((17+2)/(10))*(10))*4] add edx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul ecx, 54655307h rol ecx, 7 mov [rsp + 8*8 + ((17+0)-((17+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((18+0)-((18+0)/(10))*(10))*4] mov [rdi + (((18)-((18)/(4))*(4))*20 + (18/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + edx] xor r11d, ecx mov [rdi + (((18)-((18)/(4))*(4))*20 + (18/4)) * 4], r11d mov r11d, 1 and r11d, edx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((18+3)-((18+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((18+2)-((18+2)/(10))*(10))*4] add ecx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul edx, 54655307h rol edx, 7 mov [rsp + 8*8 + ((18+0)-((18+0)/(10))*(10))*4], r10d mov eax, [rsp + 8*8 + ((19+0)-((19+0)/(10))*(10))*4] mov [rdi + (((19)-((19)/(4))*(4))*20 + (19/4)) * 4 + 80*4], eax rol eax, 8 lea r11d, [r10d + ecx] xor r11d, edx mov [rdi + (((19)-((19)/(4))*(4))*20 + (19/4)) * 4], r11d mov r11d, 1 and r11d, ecx neg r11d and r11d, r10d xor r10d, eax movzx eax, al xor r10d, [rsi+rax*4] mov eax, [rsp + 8*8 + ((19+3)-((19+3)/(10))*(10))*4] xor r11d, [rsp + 8*8 + ((19+2)-((19+2)/(10))*(10))*4] add edx, r11d movzx r11d, al shr eax, 8 xor r10d, [rsi+1024+r11*4] xor r10d, eax imul ecx, 54655307h rol ecx, 7 mov [rsp + 8*8 + ((19+0)-((19+0)/(10))*(10))*4], r10d add rdi, 5*4 cmp rdi, QWORD PTR [rsp+4*8] jne label0 mov rax, QWORD PTR [rsp+2*8] mov r11, QWORD PTR [rsp+1*8] lea rdi, [rsp + 8*8 + 12*4] mov rsi, QWORD PTR [rsp+7*8] label1: movdqa xmm0, [rdi+0*20*4] movdqa xmm2, [rdi+2*20*4] movdqa xmm3, [rdi+3*20*4] movdqa xmm1, [rdi+1*20*4] movdqa xmm4, xmm0 pand xmm0, xmm2 pxor xmm0, xmm3 pxor xmm2, xmm1 pxor xmm2, xmm0 por xmm3, xmm4 pxor xmm3, xmm1 pxor xmm4, xmm2 movdqa xmm1, xmm3 por xmm3, xmm4 pxor xmm3, xmm0 pand xmm0, xmm1 pxor xmm4, xmm0 pxor xmm1, xmm3 pxor xmm1, xmm4 pxor xmm4, xmm7 pxor xmm2, [rdi+80*4] pxor xmm3, [rdi+80*5] pxor xmm1, [rdi+80*6] pxor xmm4, [rdi+80*7] cmp rsi, 16 jl label4 movdqa xmm6, xmm2 punpckldq xmm2, xmm3 movdqa xmm5, xmm1 punpckldq xmm1, xmm4 movdqa xmm0, xmm2 punpcklqdq xmm2, xmm1 punpckhqdq xmm0, xmm1 punpckhdq xmm6, xmm3 punpckhdq xmm5, xmm4 movdqa xmm3, xmm6 punpcklqdq xmm6, xmm5 punpckhqdq xmm3, xmm5 test rax, rax jz labelSSE2_Sosemanuk_Output3 test rax, 15 jnz labelSSE2_Sosemanuk_Output7 pxor xmm2, [rax+0*16] pxor xmm0, [rax+1*16] pxor xmm6, [rax+2*16] pxor xmm3, [rax+3*16] add rax, 4*16 jmp labelSSE2_Sosemanuk_Output3 labelSSE2_Sosemanuk_Output7: movdqu xmm1, [rax+0*16] pxor xmm2, xmm1 movdqu xmm1, [rax+1*16] pxor xmm0, xmm1 movdqu xmm1, [rax+2*16] pxor xmm6, xmm1 movdqu xmm1, [rax+3*16] pxor xmm3, xmm1 add rax, 4*16 labelSSE2_Sosemanuk_Output3: test r11, 15 jnz labelSSE2_Sosemanuk_Output8 movdqa [r11+0*16], xmm2 movdqa [r11+1*16], xmm0 movdqa [r11+2*16], xmm6 movdqa [r11+3*16], xmm3 jmp labelSSE2_Sosemanuk_Output9 labelSSE2_Sosemanuk_Output8: movdqu [r11+0*16], xmm2 movdqu [r11+1*16], xmm0 movdqu [r11+2*16], xmm6 movdqu [r11+3*16], xmm3 labelSSE2_Sosemanuk_Output9: add r11, 4*16 add rdi, 4*4 sub rsi, 16 jnz label1 mov rsi, QWORD PTR [rsp+3*8] sub rsi, 80 jz label6 mov QWORD PTR [rsp+3*8], rsi mov QWORD PTR [rsp+2*8], rax mov QWORD PTR [rsp+1*8], r11 jmp label2 label4: test rax, rax jz label5 movd xmm0, dword ptr [rax+0*4] pxor xmm2, xmm0 movd xmm0, dword ptr [rax+1*4] pxor xmm3, xmm0 movd xmm0, dword ptr [rax+2*4] pxor xmm1, xmm0 movd xmm0, dword ptr [rax+3*4] pxor xmm4, xmm0 add rax, 16 label5: movd dword ptr [r11+0*4], xmm2 movd dword ptr [r11+1*4], xmm3 movd dword ptr [r11+2*4], xmm1 movd dword ptr [r11+3*4], xmm4 sub rsi, 4 jz label6 add r11, 16 psrldq xmm2, 4 psrldq xmm3, 4 psrldq xmm1, 4 psrldq xmm4, 4 jmp label4 label6: mov r10, QWORD PTR [rsp+6*8] movdqa xmm0, [rsp + 8*8+0*16] movdqa [r10+0*16], xmm0 movdqa xmm0, [rsp + 8*8+1*16] movdqa [r10+1*16], xmm0 movq xmm0, QWORD PTR [rsp + 8*8+2*16] movq QWORD PTR [r10+2*16], xmm0 mov [r10+10*4], ecx mov [r10+11*4], edx movdqa xmm6, [rsp + 02f0h] movdqa xmm7, [rsp + 0300h] add rsp, 80*4*2+12*4+8*8 + 2*16+8 pop rdi pop rsi ret Sosemanuk_OperateKeystream ENDP Panama_SSE2_Pull PROC FRAME rex_push_reg rdi alloc_stack(2*16) save_xmm128 xmm6, 0h save_xmm128 xmm7, 10h .endprolog shl rcx, 5 jz label5 mov r10d, [rdx+4*17] add rcx, r10 mov rdi, rcx movdqa xmm0, xmmword ptr [rdx+0*16] movdqa xmm1, xmmword ptr [rdx+1*16] movdqa xmm2, xmmword ptr [rdx+2*16] movdqa xmm3, xmmword ptr [rdx+3*16] mov eax, dword ptr [rdx+4*16] label4: movdqa xmm6, xmm2 movss xmm6, xmm3 pshufd xmm5, xmm6, 0*64+3*16+2*4+1 movd xmm6, eax movdqa xmm7, xmm3 movss xmm7, xmm6 pshufd xmm6, xmm7, 0*64+3*16+2*4+1 movd ecx, xmm2 not ecx movd r11d, xmm3 or ecx, r11d xor eax, ecx pcmpeqb xmm7, xmm7 pxor xmm7, xmm1 por xmm7, xmm2 pxor xmm7, xmm3 movd ecx, xmm7 rol ecx, (((((5*1) MOD (17))*(((5*1) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(1)) MOD (17)))*13+16)) MOD (17))*4], ecx pshuflw xmm7, xmm7, 1*64+0*16+3*4+2 movd ecx, xmm7 rol ecx, (((((5*5) MOD (17))*(((5*5) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(5)) MOD (17)))*13+16)) MOD (17))*4], ecx punpckhqdq xmm7, xmm7 movd ecx, xmm7 rol ecx, (((((5*9) MOD (17))*(((5*9) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(9)) MOD (17)))*13+16)) MOD (17))*4], ecx pshuflw xmm7, xmm7, 1*64+0*16+3*4+2 movd ecx, xmm7 rol ecx, (((((5*13) MOD (17))*(((5*13) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(13)) MOD (17)))*13+16)) MOD (17))*4], ecx pcmpeqb xmm7, xmm7 pxor xmm7, xmm0 por xmm7, xmm1 pxor xmm7, xmm2 movd ecx, xmm7 rol ecx, (((((5*2) MOD (17))*(((5*2) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(2)) MOD (17)))*13+16)) MOD (17))*4], ecx pshuflw xmm7, xmm7, 1*64+0*16+3*4+2 movd ecx, xmm7 rol ecx, (((((5*6) MOD (17))*(((5*6) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(6)) MOD (17)))*13+16)) MOD (17))*4], ecx punpckhqdq xmm7, xmm7 movd ecx, xmm7 rol ecx, (((((5*10) MOD (17))*(((5*10) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(10)) MOD (17)))*13+16)) MOD (17))*4], ecx pshuflw xmm7, xmm7, 1*64+0*16+3*4+2 movd ecx, xmm7 rol ecx, (((((5*14) MOD (17))*(((5*14) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(14)) MOD (17)))*13+16)) MOD (17))*4], ecx pcmpeqb xmm7, xmm7 pxor xmm7, xmm6 por xmm7, xmm0 pxor xmm7, xmm1 movd ecx, xmm7 rol ecx, (((((5*3) MOD (17))*(((5*3) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(3)) MOD (17)))*13+16)) MOD (17))*4], ecx pshuflw xmm7, xmm7, 1*64+0*16+3*4+2 movd ecx, xmm7 rol ecx, (((((5*7) MOD (17))*(((5*7) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(7)) MOD (17)))*13+16)) MOD (17))*4], ecx punpckhqdq xmm7, xmm7 movd ecx, xmm7 rol ecx, (((((5*11) MOD (17))*(((5*11) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(11)) MOD (17)))*13+16)) MOD (17))*4], ecx pshuflw xmm7, xmm7, 1*64+0*16+3*4+2 movd ecx, xmm7 rol ecx, (((((5*15) MOD (17))*(((5*15) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(15)) MOD (17)))*13+16)) MOD (17))*4], ecx pcmpeqb xmm7, xmm7 pxor xmm7, xmm5 por xmm7, xmm6 pxor xmm7, xmm0 movd ecx, xmm7 rol ecx, (((((5*4) MOD (17))*(((5*4) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(4)) MOD (17)))*13+16)) MOD (17))*4], ecx pshuflw xmm7, xmm7, 1*64+0*16+3*4+2 movd ecx, xmm7 rol ecx, (((((5*8) MOD (17))*(((5*8) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(8)) MOD (17)))*13+16)) MOD (17))*4], ecx punpckhqdq xmm7, xmm7 movd ecx, xmm7 rol ecx, (((((5*12) MOD (17))*(((5*12) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(12)) MOD (17)))*13+16)) MOD (17))*4], ecx pshuflw xmm7, xmm7, 1*64+0*16+3*4+2 movd ecx, xmm7 rol ecx, (((((5*16) MOD (17))*(((5*16) MOD (17))+1)/2)) MOD (32)) mov [rdx+((((((5*(16)) MOD (17)))*13+16)) MOD (17))*4], ecx movdqa xmm4, xmm3 punpcklqdq xmm3, xmm2 punpckhdq xmm4, xmm2 movdqa xmm2, xmm1 punpcklqdq xmm1, xmm0 punpckhdq xmm2, xmm0 test r8, r8 jz label0 movdqa xmm6, xmm4 punpcklqdq xmm4, xmm2 punpckhqdq xmm6, xmm2 test r9, 15 jnz label2 test r9, r9 jz label1 pxor xmm4, [r9] pxor xmm6, [r9+16] add r9, 32 jmp label1 label2: movdqu xmm0, [r9] movdqu xmm2, [r9+16] pxor xmm4, xmm0 pxor xmm6, xmm2 add r9, 32 label1: test r8, 15 jnz label3 movdqa xmmword ptr [r8], xmm4 movdqa xmmword ptr [r8+16], xmm6 add r8, 32 jmp label0 label3: movdqu xmmword ptr [r8], xmm4 movdqu xmmword ptr [r8+16], xmm6 add r8, 32 label0: lea rcx, [r10 + 32] and rcx, 31*32 lea r11, [r10 + (32-24)*32] and r11, 31*32 movdqa xmm0, xmmword ptr [rdx+20*4+rcx+0*8] pxor xmm3, xmm0 pshufd xmm0, xmm0, 2*64+3*16+0*4+1 movdqa xmmword ptr [rdx+20*4+rcx+0*8], xmm3 pxor xmm0, xmmword ptr [rdx+20*4+r11+2*8] movdqa xmmword ptr [rdx+20*4+r11+2*8], xmm0 movdqa xmm4, xmmword ptr [rdx+20*4+rcx+2*8] pxor xmm1, xmm4 movdqa xmmword ptr [rdx+20*4+rcx+2*8], xmm1 pxor xmm4, xmmword ptr [rdx+20*4+r11+0*8] movdqa xmmword ptr [rdx+20*4+r11+0*8], xmm4 movdqa xmm3, xmmword ptr [rdx+3*16] movdqa xmm2, xmmword ptr [rdx+2*16] movdqa xmm1, xmmword ptr [rdx+1*16] movdqa xmm0, xmmword ptr [rdx+0*16] movd xmm6, eax movdqa xmm7, xmm3 movss xmm7, xmm6 movdqa xmm6, xmm2 movss xmm6, xmm3 movdqa xmm5, xmm1 movss xmm5, xmm2 movdqa xmm4, xmm0 movss xmm4, xmm1 pshufd xmm7, xmm7, 0*64+3*16+2*4+1 pshufd xmm6, xmm6, 0*64+3*16+2*4+1 pshufd xmm5, xmm5, 0*64+3*16+2*4+1 pshufd xmm4, xmm4, 0*64+3*16+2*4+1 xor eax, 1 movd ecx, xmm0 xor eax, ecx movd ecx, xmm3 xor eax, ecx pxor xmm3, xmm2 pxor xmm2, xmm1 pxor xmm1, xmm0 pxor xmm0, xmm7 pxor xmm3, xmm7 pxor xmm2, xmm6 pxor xmm1, xmm5 pxor xmm0, xmm4 lea rcx, [r10 + (32-4)*32] and rcx, 31*32 lea r11, [r10 + 16*32] and r11, 31*32 movdqa xmm4, xmmword ptr [rdx+20*4+rcx+0*16] movdqa xmm5, xmmword ptr [rdx+20*4+r11+0*16] movdqa xmm6, xmm4 punpcklqdq xmm4, xmm5 punpckhqdq xmm6, xmm5 pxor xmm3, xmm4 pxor xmm2, xmm6 movdqa xmm4, xmmword ptr [rdx+20*4+rcx+1*16] movdqa xmm5, xmmword ptr [rdx+20*4+r11+1*16] movdqa xmm6, xmm4 punpcklqdq xmm4, xmm5 punpckhqdq xmm6, xmm5 pxor xmm1, xmm4 pxor xmm0, xmm6 add r10, 32 cmp r10, rdi jne label4 mov [rdx+4*16], eax movdqa xmmword ptr [rdx+3*16], xmm3 movdqa xmmword ptr [rdx+2*16], xmm2 movdqa xmmword ptr [rdx+1*16], xmm1 movdqa xmmword ptr [rdx+0*16], xmm0 label5: movdqa xmm6, [rsp + 0h] movdqa xmm7, [rsp + 10h] add rsp, 2*16 pop rdi ret Panama_SSE2_Pull ENDP _TEXT ENDS END armory-0.92.3/cppForSwig/cryptopp/default.cpp0000755000000000000000000002022412414772654017726 0ustar rootroot// default.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "default.h" #include "queue.h" #include #include NAMESPACE_BEGIN(CryptoPP) static const unsigned int MASH_ITERATIONS = 200; static const unsigned int SALTLENGTH = 8; static const unsigned int BLOCKSIZE = Default_BlockCipher::Encryption::BLOCKSIZE; static const unsigned int KEYLENGTH = Default_BlockCipher::Encryption::DEFAULT_KEYLENGTH; // The purpose of this function Mash() is to take an arbitrary length input // string and *deterministicly* produce an arbitrary length output string such // that (1) it looks random, (2) no information about the input is // deducible from it, and (3) it contains as much entropy as it can hold, or // the amount of entropy in the input string, whichever is smaller. static void Mash(const byte *in, size_t inLen, byte *out, size_t outLen, int iterations) { if (BytePrecision(outLen) > 2) throw InvalidArgument("Mash: output legnth too large"); size_t bufSize = RoundUpToMultipleOf(outLen, (size_t)DefaultHashModule::DIGESTSIZE); byte b[2]; SecByteBlock buf(bufSize); SecByteBlock outBuf(bufSize); DefaultHashModule hash; unsigned int i; for(i=0; i> 8); b[1] = (byte) i; hash.Update(b, 2); hash.Update(in, inLen); hash.Final(outBuf+i); } while (iterations-- > 1) { memcpy(buf, outBuf, bufSize); for (i=0; i> 8); b[1] = (byte) i; hash.Update(b, 2); hash.Update(buf, bufSize); hash.Final(outBuf+i); } } memcpy(out, outBuf, outLen); } static void GenerateKeyIV(const byte *passphrase, size_t passphraseLength, const byte *salt, size_t saltLength, byte *key, byte *IV) { SecByteBlock temp(passphraseLength+saltLength); memcpy(temp, passphrase, passphraseLength); memcpy(temp+passphraseLength, salt, saltLength); SecByteBlock keyIV(KEYLENGTH+BLOCKSIZE); Mash(temp, passphraseLength + saltLength, keyIV, KEYLENGTH+BLOCKSIZE, MASH_ITERATIONS); memcpy(key, keyIV, KEYLENGTH); memcpy(IV, keyIV+KEYLENGTH, BLOCKSIZE); } // ******************************************************** DefaultEncryptor::DefaultEncryptor(const char *passphrase, BufferedTransformation *attachment) : ProxyFilter(NULL, 0, 0, attachment), m_passphrase((const byte *)passphrase, strlen(passphrase)) { } DefaultEncryptor::DefaultEncryptor(const byte *passphrase, size_t passphraseLength, BufferedTransformation *attachment) : ProxyFilter(NULL, 0, 0, attachment), m_passphrase(passphrase, passphraseLength) { } void DefaultEncryptor::FirstPut(const byte *) { // VC60 workaround: __LINE__ expansion bug CRYPTOPP_COMPILE_ASSERT_INSTANCE(SALTLENGTH <= DefaultHashModule::DIGESTSIZE, 1); CRYPTOPP_COMPILE_ASSERT_INSTANCE(BLOCKSIZE <= DefaultHashModule::DIGESTSIZE, 2); SecByteBlock salt(DefaultHashModule::DIGESTSIZE), keyCheck(DefaultHashModule::DIGESTSIZE); DefaultHashModule hash; // use hash(passphrase | time | clock) as salt hash.Update(m_passphrase, m_passphrase.size()); time_t t=time(0); hash.Update((byte *)&t, sizeof(t)); clock_t c=clock(); hash.Update((byte *)&c, sizeof(c)); hash.Final(salt); // use hash(passphrase | salt) as key check hash.Update(m_passphrase, m_passphrase.size()); hash.Update(salt, SALTLENGTH); hash.Final(keyCheck); AttachedTransformation()->Put(salt, SALTLENGTH); // mash passphrase and salt together into key and IV SecByteBlock key(KEYLENGTH); SecByteBlock IV(BLOCKSIZE); GenerateKeyIV(m_passphrase, m_passphrase.size(), salt, SALTLENGTH, key, IV); m_cipher.SetKeyWithIV(key, key.size(), IV); SetFilter(new StreamTransformationFilter(m_cipher)); m_filter->Put(keyCheck, BLOCKSIZE); } void DefaultEncryptor::LastPut(const byte *inString, size_t length) { m_filter->MessageEnd(); } // ******************************************************** DefaultDecryptor::DefaultDecryptor(const char *p, BufferedTransformation *attachment, bool throwException) : ProxyFilter(NULL, SALTLENGTH+BLOCKSIZE, 0, attachment) , m_state(WAITING_FOR_KEYCHECK) , m_passphrase((const byte *)p, strlen(p)) , m_throwException(throwException) { } DefaultDecryptor::DefaultDecryptor(const byte *passphrase, size_t passphraseLength, BufferedTransformation *attachment, bool throwException) : ProxyFilter(NULL, SALTLENGTH+BLOCKSIZE, 0, attachment) , m_state(WAITING_FOR_KEYCHECK) , m_passphrase(passphrase, passphraseLength) , m_throwException(throwException) { } void DefaultDecryptor::FirstPut(const byte *inString) { CheckKey(inString, inString+SALTLENGTH); } void DefaultDecryptor::LastPut(const byte *inString, size_t length) { if (m_filter.get() == NULL) { m_state = KEY_BAD; if (m_throwException) throw KeyBadErr(); } else { m_filter->MessageEnd(); m_state = WAITING_FOR_KEYCHECK; } } void DefaultDecryptor::CheckKey(const byte *salt, const byte *keyCheck) { SecByteBlock check(STDMAX((unsigned int)2*BLOCKSIZE, (unsigned int)DefaultHashModule::DIGESTSIZE)); DefaultHashModule hash; hash.Update(m_passphrase, m_passphrase.size()); hash.Update(salt, SALTLENGTH); hash.Final(check); SecByteBlock key(KEYLENGTH); SecByteBlock IV(BLOCKSIZE); GenerateKeyIV(m_passphrase, m_passphrase.size(), salt, SALTLENGTH, key, IV); m_cipher.SetKeyWithIV(key, key.size(), IV); std::auto_ptr decryptor(new StreamTransformationFilter(m_cipher)); decryptor->Put(keyCheck, BLOCKSIZE); decryptor->ForceNextPut(); decryptor->Get(check+BLOCKSIZE, BLOCKSIZE); SetFilter(decryptor.release()); if (!VerifyBufsEqual(check, check+BLOCKSIZE, BLOCKSIZE)) { m_state = KEY_BAD; if (m_throwException) throw KeyBadErr(); } else m_state = KEY_GOOD; } // ******************************************************** static DefaultMAC * NewDefaultEncryptorMAC(const byte *passphrase, size_t passphraseLength) { size_t macKeyLength = DefaultMAC::StaticGetValidKeyLength(16); SecByteBlock macKey(macKeyLength); // since the MAC is encrypted there is no reason to mash the passphrase for many iterations Mash(passphrase, passphraseLength, macKey, macKeyLength, 1); return new DefaultMAC(macKey, macKeyLength); } DefaultEncryptorWithMAC::DefaultEncryptorWithMAC(const char *passphrase, BufferedTransformation *attachment) : ProxyFilter(NULL, 0, 0, attachment) , m_mac(NewDefaultEncryptorMAC((const byte *)passphrase, strlen(passphrase))) { SetFilter(new HashFilter(*m_mac, new DefaultEncryptor(passphrase), true)); } DefaultEncryptorWithMAC::DefaultEncryptorWithMAC(const byte *passphrase, size_t passphraseLength, BufferedTransformation *attachment) : ProxyFilter(NULL, 0, 0, attachment) , m_mac(NewDefaultEncryptorMAC(passphrase, passphraseLength)) { SetFilter(new HashFilter(*m_mac, new DefaultEncryptor(passphrase, passphraseLength), true)); } void DefaultEncryptorWithMAC::LastPut(const byte *inString, size_t length) { m_filter->MessageEnd(); } // ******************************************************** DefaultDecryptorWithMAC::DefaultDecryptorWithMAC(const char *passphrase, BufferedTransformation *attachment, bool throwException) : ProxyFilter(NULL, 0, 0, attachment) , m_mac(NewDefaultEncryptorMAC((const byte *)passphrase, strlen(passphrase))) , m_throwException(throwException) { SetFilter(new DefaultDecryptor(passphrase, m_hashVerifier=new HashVerifier(*m_mac, NULL, HashVerifier::PUT_MESSAGE), throwException)); } DefaultDecryptorWithMAC::DefaultDecryptorWithMAC(const byte *passphrase, size_t passphraseLength, BufferedTransformation *attachment, bool throwException) : ProxyFilter(NULL, 0, 0, attachment) , m_mac(NewDefaultEncryptorMAC(passphrase, passphraseLength)) , m_throwException(throwException) { SetFilter(new DefaultDecryptor(passphrase, passphraseLength, m_hashVerifier=new HashVerifier(*m_mac, NULL, HashVerifier::PUT_MESSAGE), throwException)); } DefaultDecryptor::State DefaultDecryptorWithMAC::CurrentState() const { return static_cast(m_filter.get())->CurrentState(); } bool DefaultDecryptorWithMAC::CheckLastMAC() const { return m_hashVerifier->GetLastResult(); } void DefaultDecryptorWithMAC::LastPut(const byte *inString, size_t length) { m_filter->MessageEnd(); if (m_throwException && !CheckLastMAC()) throw MACBadErr(); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/cryptlib.cpp0000755000000000000000000006004512414772654020137 0ustar rootroot// cryptlib.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "cryptlib.h" #include "misc.h" #include "filters.h" #include "algparam.h" #include "fips140.h" #include "argnames.h" #include "fltrimpl.h" #include "trdlocal.h" #include "osrng.h" #include NAMESPACE_BEGIN(CryptoPP) CRYPTOPP_COMPILE_ASSERT(sizeof(byte) == 1); CRYPTOPP_COMPILE_ASSERT(sizeof(word16) == 2); CRYPTOPP_COMPILE_ASSERT(sizeof(word32) == 4); CRYPTOPP_COMPILE_ASSERT(sizeof(word64) == 8); #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE CRYPTOPP_COMPILE_ASSERT(sizeof(dword) == 2*sizeof(word)); #endif const std::string DEFAULT_CHANNEL; const std::string AAD_CHANNEL = "AAD"; const std::string &BufferedTransformation::NULL_CHANNEL = DEFAULT_CHANNEL; class NullNameValuePairs : public NameValuePairs { public: bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const {return false;} }; simple_ptr s_pNullNameValuePairs(new NullNameValuePairs); const NameValuePairs &g_nullNameValuePairs = *s_pNullNameValuePairs.m_p; BufferedTransformation & TheBitBucket() { static BitBucket bitBucket; return bitBucket; } Algorithm::Algorithm(bool checkSelfTestStatus) { if (checkSelfTestStatus && FIPS_140_2_ComplianceEnabled()) { if (GetPowerUpSelfTestStatus() == POWER_UP_SELF_TEST_NOT_DONE && !PowerUpSelfTestInProgressOnThisThread()) throw SelfTestFailure("Cryptographic algorithms are disabled before the power-up self tests are performed."); if (GetPowerUpSelfTestStatus() == POWER_UP_SELF_TEST_FAILED) throw SelfTestFailure("Cryptographic algorithms are disabled after a power-up self test failed."); } } void SimpleKeyingInterface::SetKey(const byte *key, size_t length, const NameValuePairs ¶ms) { this->ThrowIfInvalidKeyLength(length); this->UncheckedSetKey(key, (unsigned int)length, params); } void SimpleKeyingInterface::SetKeyWithRounds(const byte *key, size_t length, int rounds) { SetKey(key, length, MakeParameters(Name::Rounds(), rounds)); } void SimpleKeyingInterface::SetKeyWithIV(const byte *key, size_t length, const byte *iv, size_t ivLength) { SetKey(key, length, MakeParameters(Name::IV(), ConstByteArrayParameter(iv, ivLength))); } void SimpleKeyingInterface::ThrowIfInvalidKeyLength(size_t length) { if (!IsValidKeyLength(length)) throw InvalidKeyLength(GetAlgorithm().AlgorithmName(), length); } void SimpleKeyingInterface::ThrowIfResynchronizable() { if (IsResynchronizable()) throw InvalidArgument(GetAlgorithm().AlgorithmName() + ": this object requires an IV"); } void SimpleKeyingInterface::ThrowIfInvalidIV(const byte *iv) { if (!iv && IVRequirement() == UNPREDICTABLE_RANDOM_IV) throw InvalidArgument(GetAlgorithm().AlgorithmName() + ": this object cannot use a null IV"); } size_t SimpleKeyingInterface::ThrowIfInvalidIVLength(int size) { if (size < 0) return IVSize(); else if ((size_t)size < MinIVLength()) throw InvalidArgument(GetAlgorithm().AlgorithmName() + ": IV length " + IntToString(size) + " is less than the minimum of " + IntToString(MinIVLength())); else if ((size_t)size > MaxIVLength()) throw InvalidArgument(GetAlgorithm().AlgorithmName() + ": IV length " + IntToString(size) + " exceeds the maximum of " + IntToString(MaxIVLength())); else return size; } const byte * SimpleKeyingInterface::GetIVAndThrowIfInvalid(const NameValuePairs ¶ms, size_t &size) { ConstByteArrayParameter ivWithLength; const byte *iv; bool found = false; try {found = params.GetValue(Name::IV(), ivWithLength);} catch (const NameValuePairs::ValueTypeMismatch &) {} if (found) { iv = ivWithLength.begin(); ThrowIfInvalidIV(iv); size = ThrowIfInvalidIVLength((int)ivWithLength.size()); return iv; } else if (params.GetValue(Name::IV(), iv)) { ThrowIfInvalidIV(iv); size = IVSize(); return iv; } else { ThrowIfResynchronizable(); size = 0; return NULL; } } void SimpleKeyingInterface::GetNextIV(RandomNumberGenerator &rng, byte *IV) { rng.GenerateBlock(IV, IVSize()); } size_t BlockTransformation::AdvancedProcessBlocks(const byte *inBlocks, const byte *xorBlocks, byte *outBlocks, size_t length, word32 flags) const { size_t blockSize = BlockSize(); size_t inIncrement = (flags & (BT_InBlockIsCounter|BT_DontIncrementInOutPointers)) ? 0 : blockSize; size_t xorIncrement = xorBlocks ? blockSize : 0; size_t outIncrement = (flags & BT_DontIncrementInOutPointers) ? 0 : blockSize; if (flags & BT_ReverseDirection) { assert(length % blockSize == 0); inBlocks += length - blockSize; xorBlocks += length - blockSize; outBlocks += length - blockSize; inIncrement = 0-inIncrement; xorIncrement = 0-xorIncrement; outIncrement = 0-outIncrement; } while (length >= blockSize) { if (flags & BT_XorInput) { xorbuf(outBlocks, xorBlocks, inBlocks, blockSize); ProcessBlock(outBlocks); } else ProcessAndXorBlock(inBlocks, xorBlocks, outBlocks); if (flags & BT_InBlockIsCounter) const_cast(inBlocks)[blockSize-1]++; inBlocks += inIncrement; outBlocks += outIncrement; xorBlocks += xorIncrement; length -= blockSize; } return length; } unsigned int BlockTransformation::OptimalDataAlignment() const { return GetAlignmentOf(); } unsigned int StreamTransformation::OptimalDataAlignment() const { return GetAlignmentOf(); } unsigned int HashTransformation::OptimalDataAlignment() const { return GetAlignmentOf(); } void StreamTransformation::ProcessLastBlock(byte *outString, const byte *inString, size_t length) { assert(MinLastBlockSize() == 0); // this function should be overriden otherwise if (length == MandatoryBlockSize()) ProcessData(outString, inString, length); else if (length != 0) throw NotImplemented(AlgorithmName() + ": this object does't support a special last block"); } void AuthenticatedSymmetricCipher::SpecifyDataLengths(lword headerLength, lword messageLength, lword footerLength) { if (headerLength > MaxHeaderLength()) throw InvalidArgument(GetAlgorithm().AlgorithmName() + ": header length " + IntToString(headerLength) + " exceeds the maximum of " + IntToString(MaxHeaderLength())); if (messageLength > MaxMessageLength()) throw InvalidArgument(GetAlgorithm().AlgorithmName() + ": message length " + IntToString(messageLength) + " exceeds the maximum of " + IntToString(MaxMessageLength())); if (footerLength > MaxFooterLength()) throw InvalidArgument(GetAlgorithm().AlgorithmName() + ": footer length " + IntToString(footerLength) + " exceeds the maximum of " + IntToString(MaxFooterLength())); UncheckedSpecifyDataLengths(headerLength, messageLength, footerLength); } void AuthenticatedSymmetricCipher::EncryptAndAuthenticate(byte *ciphertext, byte *mac, size_t macSize, const byte *iv, int ivLength, const byte *header, size_t headerLength, const byte *message, size_t messageLength) { Resynchronize(iv, ivLength); SpecifyDataLengths(headerLength, messageLength); Update(header, headerLength); ProcessString(ciphertext, message, messageLength); TruncatedFinal(mac, macSize); } bool AuthenticatedSymmetricCipher::DecryptAndVerify(byte *message, const byte *mac, size_t macLength, const byte *iv, int ivLength, const byte *header, size_t headerLength, const byte *ciphertext, size_t ciphertextLength) { Resynchronize(iv, ivLength); SpecifyDataLengths(headerLength, ciphertextLength); Update(header, headerLength); ProcessString(message, ciphertext, ciphertextLength); return TruncatedVerify(mac, macLength); } unsigned int RandomNumberGenerator::GenerateBit() { return GenerateByte() & 1; } byte RandomNumberGenerator::GenerateByte() { byte b; GenerateBlock(&b, 1); return b; } word32 RandomNumberGenerator::GenerateWord32(word32 min, word32 max) { word32 range = max-min; const int maxBits = BitPrecision(range); word32 value; do { GenerateBlock((byte *)&value, sizeof(value)); value = Crop(value, maxBits); } while (value > range); return value+min; } void RandomNumberGenerator::GenerateBlock(byte *output, size_t size) { ArraySink s(output, size); GenerateIntoBufferedTransformation(s, DEFAULT_CHANNEL, size); } void RandomNumberGenerator::DiscardBytes(size_t n) { GenerateIntoBufferedTransformation(TheBitBucket(), DEFAULT_CHANNEL, n); } void RandomNumberGenerator::GenerateIntoBufferedTransformation(BufferedTransformation &target, const std::string &channel, lword length) { FixedSizeSecBlock buffer; while (length) { size_t len = UnsignedMin(buffer.size(), length); GenerateBlock(buffer, len); target.ChannelPut(channel, buffer, len); length -= len; } } //! see NullRNG() class ClassNullRNG : public RandomNumberGenerator { public: std::string AlgorithmName() const {return "NullRNG";} void GenerateBlock(byte *output, size_t size) {throw NotImplemented("NullRNG: NullRNG should only be passed to functions that don't need to generate random bytes");} }; RandomNumberGenerator & NullRNG() { static ClassNullRNG s_nullRNG; return s_nullRNG; } bool HashTransformation::TruncatedVerify(const byte *digestIn, size_t digestLength) { ThrowIfInvalidTruncatedSize(digestLength); SecByteBlock digest(digestLength); TruncatedFinal(digest, digestLength); return VerifyBufsEqual(digest, digestIn, digestLength); } void HashTransformation::ThrowIfInvalidTruncatedSize(size_t size) const { if (size > DigestSize()) throw InvalidArgument("HashTransformation: can't truncate a " + IntToString(DigestSize()) + " byte digest to " + IntToString(size) + " bytes"); } unsigned int BufferedTransformation::GetMaxWaitObjectCount() const { const BufferedTransformation *t = AttachedTransformation(); return t ? t->GetMaxWaitObjectCount() : 0; } void BufferedTransformation::GetWaitObjects(WaitObjectContainer &container, CallStack const& callStack) { BufferedTransformation *t = AttachedTransformation(); if (t) t->GetWaitObjects(container, callStack); // reduce clutter by not adding to stack here } void BufferedTransformation::Initialize(const NameValuePairs ¶meters, int propagation) { assert(!AttachedTransformation()); IsolatedInitialize(parameters); } bool BufferedTransformation::Flush(bool hardFlush, int propagation, bool blocking) { assert(!AttachedTransformation()); return IsolatedFlush(hardFlush, blocking); } bool BufferedTransformation::MessageSeriesEnd(int propagation, bool blocking) { assert(!AttachedTransformation()); return IsolatedMessageSeriesEnd(blocking); } byte * BufferedTransformation::ChannelCreatePutSpace(const std::string &channel, size_t &size) { if (channel.empty()) return CreatePutSpace(size); else throw NoChannelSupport(AlgorithmName()); } size_t BufferedTransformation::ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking) { if (channel.empty()) return Put2(begin, length, messageEnd, blocking); else throw NoChannelSupport(AlgorithmName()); } size_t BufferedTransformation::ChannelPutModifiable2(const std::string &channel, byte *begin, size_t length, int messageEnd, bool blocking) { if (channel.empty()) return PutModifiable2(begin, length, messageEnd, blocking); else return ChannelPut2(channel, begin, length, messageEnd, blocking); } bool BufferedTransformation::ChannelFlush(const std::string &channel, bool completeFlush, int propagation, bool blocking) { if (channel.empty()) return Flush(completeFlush, propagation, blocking); else throw NoChannelSupport(AlgorithmName()); } bool BufferedTransformation::ChannelMessageSeriesEnd(const std::string &channel, int propagation, bool blocking) { if (channel.empty()) return MessageSeriesEnd(propagation, blocking); else throw NoChannelSupport(AlgorithmName()); } lword BufferedTransformation::MaxRetrievable() const { if (AttachedTransformation()) return AttachedTransformation()->MaxRetrievable(); else return CopyTo(TheBitBucket()); } bool BufferedTransformation::AnyRetrievable() const { if (AttachedTransformation()) return AttachedTransformation()->AnyRetrievable(); else { byte b; return Peek(b) != 0; } } size_t BufferedTransformation::Get(byte &outByte) { if (AttachedTransformation()) return AttachedTransformation()->Get(outByte); else return Get(&outByte, 1); } size_t BufferedTransformation::Get(byte *outString, size_t getMax) { if (AttachedTransformation()) return AttachedTransformation()->Get(outString, getMax); else { ArraySink arraySink(outString, getMax); return (size_t)TransferTo(arraySink, getMax); } } size_t BufferedTransformation::Peek(byte &outByte) const { if (AttachedTransformation()) return AttachedTransformation()->Peek(outByte); else return Peek(&outByte, 1); } size_t BufferedTransformation::Peek(byte *outString, size_t peekMax) const { if (AttachedTransformation()) return AttachedTransformation()->Peek(outString, peekMax); else { ArraySink arraySink(outString, peekMax); return (size_t)CopyTo(arraySink, peekMax); } } lword BufferedTransformation::Skip(lword skipMax) { if (AttachedTransformation()) return AttachedTransformation()->Skip(skipMax); else return TransferTo(TheBitBucket(), skipMax); } lword BufferedTransformation::TotalBytesRetrievable() const { if (AttachedTransformation()) return AttachedTransformation()->TotalBytesRetrievable(); else return MaxRetrievable(); } unsigned int BufferedTransformation::NumberOfMessages() const { if (AttachedTransformation()) return AttachedTransformation()->NumberOfMessages(); else return CopyMessagesTo(TheBitBucket()); } bool BufferedTransformation::AnyMessages() const { if (AttachedTransformation()) return AttachedTransformation()->AnyMessages(); else return NumberOfMessages() != 0; } bool BufferedTransformation::GetNextMessage() { if (AttachedTransformation()) return AttachedTransformation()->GetNextMessage(); else { assert(!AnyMessages()); return false; } } unsigned int BufferedTransformation::SkipMessages(unsigned int count) { if (AttachedTransformation()) return AttachedTransformation()->SkipMessages(count); else return TransferMessagesTo(TheBitBucket(), count); } size_t BufferedTransformation::TransferMessagesTo2(BufferedTransformation &target, unsigned int &messageCount, const std::string &channel, bool blocking) { if (AttachedTransformation()) return AttachedTransformation()->TransferMessagesTo2(target, messageCount, channel, blocking); else { unsigned int maxMessages = messageCount; for (messageCount=0; messageCount < maxMessages && AnyMessages(); messageCount++) { size_t blockedBytes; lword transferredBytes; while (AnyRetrievable()) { transferredBytes = LWORD_MAX; blockedBytes = TransferTo2(target, transferredBytes, channel, blocking); if (blockedBytes > 0) return blockedBytes; } if (target.ChannelMessageEnd(channel, GetAutoSignalPropagation(), blocking)) return 1; bool result = GetNextMessage(); assert(result); } return 0; } } unsigned int BufferedTransformation::CopyMessagesTo(BufferedTransformation &target, unsigned int count, const std::string &channel) const { if (AttachedTransformation()) return AttachedTransformation()->CopyMessagesTo(target, count, channel); else return 0; } void BufferedTransformation::SkipAll() { if (AttachedTransformation()) AttachedTransformation()->SkipAll(); else { while (SkipMessages()) {} while (Skip()) {} } } size_t BufferedTransformation::TransferAllTo2(BufferedTransformation &target, const std::string &channel, bool blocking) { if (AttachedTransformation()) return AttachedTransformation()->TransferAllTo2(target, channel, blocking); else { assert(!NumberOfMessageSeries()); unsigned int messageCount; do { messageCount = UINT_MAX; size_t blockedBytes = TransferMessagesTo2(target, messageCount, channel, blocking); if (blockedBytes) return blockedBytes; } while (messageCount != 0); lword byteCount; do { byteCount = ULONG_MAX; size_t blockedBytes = TransferTo2(target, byteCount, channel, blocking); if (blockedBytes) return blockedBytes; } while (byteCount != 0); return 0; } } void BufferedTransformation::CopyAllTo(BufferedTransformation &target, const std::string &channel) const { if (AttachedTransformation()) AttachedTransformation()->CopyAllTo(target, channel); else { assert(!NumberOfMessageSeries()); while (CopyMessagesTo(target, UINT_MAX, channel)) {} } } void BufferedTransformation::SetRetrievalChannel(const std::string &channel) { if (AttachedTransformation()) AttachedTransformation()->SetRetrievalChannel(channel); } size_t BufferedTransformation::ChannelPutWord16(const std::string &channel, word16 value, ByteOrder order, bool blocking) { PutWord(false, order, m_buf, value); return ChannelPut(channel, m_buf, 2, blocking); } size_t BufferedTransformation::ChannelPutWord32(const std::string &channel, word32 value, ByteOrder order, bool blocking) { PutWord(false, order, m_buf, value); return ChannelPut(channel, m_buf, 4, blocking); } size_t BufferedTransformation::PutWord16(word16 value, ByteOrder order, bool blocking) { return ChannelPutWord16(DEFAULT_CHANNEL, value, order, blocking); } size_t BufferedTransformation::PutWord32(word32 value, ByteOrder order, bool blocking) { return ChannelPutWord32(DEFAULT_CHANNEL, value, order, blocking); } size_t BufferedTransformation::PeekWord16(word16 &value, ByteOrder order) const { byte buf[2] = {0, 0}; size_t len = Peek(buf, 2); if (order) value = (buf[0] << 8) | buf[1]; else value = (buf[1] << 8) | buf[0]; return len; } size_t BufferedTransformation::PeekWord32(word32 &value, ByteOrder order) const { byte buf[4] = {0, 0, 0, 0}; size_t len = Peek(buf, 4); if (order) value = (buf[0] << 24) | (buf[1] << 16) | (buf[2] << 8) | buf [3]; else value = (buf[3] << 24) | (buf[2] << 16) | (buf[1] << 8) | buf [0]; return len; } size_t BufferedTransformation::GetWord16(word16 &value, ByteOrder order) { return (size_t)Skip(PeekWord16(value, order)); } size_t BufferedTransformation::GetWord32(word32 &value, ByteOrder order) { return (size_t)Skip(PeekWord32(value, order)); } void BufferedTransformation::Attach(BufferedTransformation *newOut) { if (AttachedTransformation() && AttachedTransformation()->Attachable()) AttachedTransformation()->Attach(newOut); else Detach(newOut); } void GeneratableCryptoMaterial::GenerateRandomWithKeySize(RandomNumberGenerator &rng, unsigned int keySize) { GenerateRandom(rng, MakeParameters("KeySize", (int)keySize)); } class PK_DefaultEncryptionFilter : public Unflushable { public: PK_DefaultEncryptionFilter(RandomNumberGenerator &rng, const PK_Encryptor &encryptor, BufferedTransformation *attachment, const NameValuePairs ¶meters) : m_rng(rng), m_encryptor(encryptor), m_parameters(parameters) { Detach(attachment); } size_t Put2(const byte *inString, size_t length, int messageEnd, bool blocking) { FILTER_BEGIN; m_plaintextQueue.Put(inString, length); if (messageEnd) { { size_t plaintextLength; if (!SafeConvert(m_plaintextQueue.CurrentSize(), plaintextLength)) throw InvalidArgument("PK_DefaultEncryptionFilter: plaintext too long"); size_t ciphertextLength = m_encryptor.CiphertextLength(plaintextLength); SecByteBlock plaintext(plaintextLength); m_plaintextQueue.Get(plaintext, plaintextLength); m_ciphertext.resize(ciphertextLength); m_encryptor.Encrypt(m_rng, plaintext, plaintextLength, m_ciphertext, m_parameters); } FILTER_OUTPUT(1, m_ciphertext, m_ciphertext.size(), messageEnd); } FILTER_END_NO_MESSAGE_END; } RandomNumberGenerator &m_rng; const PK_Encryptor &m_encryptor; const NameValuePairs &m_parameters; ByteQueue m_plaintextQueue; SecByteBlock m_ciphertext; }; BufferedTransformation * PK_Encryptor::CreateEncryptionFilter(RandomNumberGenerator &rng, BufferedTransformation *attachment, const NameValuePairs ¶meters) const { return new PK_DefaultEncryptionFilter(rng, *this, attachment, parameters); } class PK_DefaultDecryptionFilter : public Unflushable { public: PK_DefaultDecryptionFilter(RandomNumberGenerator &rng, const PK_Decryptor &decryptor, BufferedTransformation *attachment, const NameValuePairs ¶meters) : m_rng(rng), m_decryptor(decryptor), m_parameters(parameters) { Detach(attachment); } size_t Put2(const byte *inString, size_t length, int messageEnd, bool blocking) { FILTER_BEGIN; m_ciphertextQueue.Put(inString, length); if (messageEnd) { { size_t ciphertextLength; if (!SafeConvert(m_ciphertextQueue.CurrentSize(), ciphertextLength)) throw InvalidArgument("PK_DefaultDecryptionFilter: ciphertext too long"); size_t maxPlaintextLength = m_decryptor.MaxPlaintextLength(ciphertextLength); SecByteBlock ciphertext(ciphertextLength); m_ciphertextQueue.Get(ciphertext, ciphertextLength); m_plaintext.resize(maxPlaintextLength); m_result = m_decryptor.Decrypt(m_rng, ciphertext, ciphertextLength, m_plaintext, m_parameters); if (!m_result.isValidCoding) throw InvalidCiphertext(m_decryptor.AlgorithmName() + ": invalid ciphertext"); } FILTER_OUTPUT(1, m_plaintext, m_result.messageLength, messageEnd); } FILTER_END_NO_MESSAGE_END; } RandomNumberGenerator &m_rng; const PK_Decryptor &m_decryptor; const NameValuePairs &m_parameters; ByteQueue m_ciphertextQueue; SecByteBlock m_plaintext; DecodingResult m_result; }; BufferedTransformation * PK_Decryptor::CreateDecryptionFilter(RandomNumberGenerator &rng, BufferedTransformation *attachment, const NameValuePairs ¶meters) const { return new PK_DefaultDecryptionFilter(rng, *this, attachment, parameters); } size_t PK_Signer::Sign(RandomNumberGenerator &rng, PK_MessageAccumulator *messageAccumulator, byte *signature) const { std::auto_ptr m(messageAccumulator); return SignAndRestart(rng, *m, signature, false); } size_t PK_Signer::SignMessage(RandomNumberGenerator &rng, const byte *message, size_t messageLen, byte *signature) const { std::auto_ptr m(NewSignatureAccumulator(rng)); m->Update(message, messageLen); return SignAndRestart(rng, *m, signature, false); } size_t PK_Signer::SignMessageWithRecovery(RandomNumberGenerator &rng, const byte *recoverableMessage, size_t recoverableMessageLength, const byte *nonrecoverableMessage, size_t nonrecoverableMessageLength, byte *signature) const { std::auto_ptr m(NewSignatureAccumulator(rng)); InputRecoverableMessage(*m, recoverableMessage, recoverableMessageLength); m->Update(nonrecoverableMessage, nonrecoverableMessageLength); return SignAndRestart(rng, *m, signature, false); } bool PK_Verifier::Verify(PK_MessageAccumulator *messageAccumulator) const { std::auto_ptr m(messageAccumulator); return VerifyAndRestart(*m); } bool PK_Verifier::VerifyMessage(const byte *message, size_t messageLen, const byte *signature, size_t signatureLength) const { std::auto_ptr m(NewVerificationAccumulator()); InputSignature(*m, signature, signatureLength); m->Update(message, messageLen); return VerifyAndRestart(*m); } DecodingResult PK_Verifier::Recover(byte *recoveredMessage, PK_MessageAccumulator *messageAccumulator) const { std::auto_ptr m(messageAccumulator); return RecoverAndRestart(recoveredMessage, *m); } DecodingResult PK_Verifier::RecoverMessage(byte *recoveredMessage, const byte *nonrecoverableMessage, size_t nonrecoverableMessageLength, const byte *signature, size_t signatureLength) const { std::auto_ptr m(NewVerificationAccumulator()); InputSignature(*m, signature, signatureLength); m->Update(nonrecoverableMessage, nonrecoverableMessageLength); return RecoverAndRestart(recoveredMessage, *m); } void SimpleKeyAgreementDomain::GenerateKeyPair(RandomNumberGenerator &rng, byte *privateKey, byte *publicKey) const { GeneratePrivateKey(rng, privateKey); GeneratePublicKey(rng, privateKey, publicKey); } void AuthenticatedKeyAgreementDomain::GenerateStaticKeyPair(RandomNumberGenerator &rng, byte *privateKey, byte *publicKey) const { GenerateStaticPrivateKey(rng, privateKey); GenerateStaticPublicKey(rng, privateKey, publicKey); } void AuthenticatedKeyAgreementDomain::GenerateEphemeralKeyPair(RandomNumberGenerator &rng, byte *privateKey, byte *publicKey) const { GenerateEphemeralPrivateKey(rng, privateKey); GenerateEphemeralPublicKey(rng, privateKey, publicKey); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/gcm.cpp0000755000000000000000000005670412414772654017064 0ustar rootroot// gcm.cpp - written and placed in the public domain by Wei Dai // use "cl /EP /P /DCRYPTOPP_GENERATE_X64_MASM gcm.cpp" to generate MASM code #include "pch.h" #ifndef CRYPTOPP_IMPORTS #ifndef CRYPTOPP_GENERATE_X64_MASM #include "gcm.h" #include "cpu.h" NAMESPACE_BEGIN(CryptoPP) word16 GCM_Base::s_reductionTable[256]; volatile bool GCM_Base::s_reductionTableInitialized = false; void GCM_Base::GCTR::IncrementCounterBy256() { IncrementCounterByOne(m_counterArray+BlockSize()-4, 3); } #if 0 // preserved for testing void gcm_gf_mult(const unsigned char *a, const unsigned char *b, unsigned char *c) { word64 Z0=0, Z1=0, V0, V1; typedef BlockGetAndPut Block; Block::Get(a)(V0)(V1); for (int i=0; i<16; i++) { for (int j=0x80; j!=0; j>>=1) { int x = b[i] & j; Z0 ^= x ? V0 : 0; Z1 ^= x ? V1 : 0; x = (int)V1 & 1; V1 = (V1>>1) | (V0<<63); V0 = (V0>>1) ^ (x ? W64LIT(0xe1) << 56 : 0); } } Block::Put(NULL, c)(Z0)(Z1); } __m128i _mm_clmulepi64_si128(const __m128i &a, const __m128i &b, int i) { word64 A[1] = {ByteReverse(((word64*)&a)[i&1])}; word64 B[1] = {ByteReverse(((word64*)&b)[i>>4])}; PolynomialMod2 pa((byte *)A, 8); PolynomialMod2 pb((byte *)B, 8); PolynomialMod2 c = pa*pb; __m128i output; for (int i=0; i<16; i++) ((byte *)&output)[i] = c.GetByte(i); return output; } #endif #if CRYPTOPP_BOOL_SSE2_INTRINSICS_AVAILABLE || CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE inline static void SSE2_Xor16(byte *a, const byte *b, const byte *c) { #if CRYPTOPP_BOOL_SSE2_INTRINSICS_AVAILABLE *(__m128i *)a = _mm_xor_si128(*(__m128i *)b, *(__m128i *)c); #else asm ("movdqa %1, %%xmm0; pxor %2, %%xmm0; movdqa %%xmm0, %0;" : "=m" (a[0]) : "m"(b[0]), "m"(c[0])); #endif } #endif inline static void Xor16(byte *a, const byte *b, const byte *c) { ((word64 *)a)[0] = ((word64 *)b)[0] ^ ((word64 *)c)[0]; ((word64 *)a)[1] = ((word64 *)b)[1] ^ ((word64 *)c)[1]; } #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE static CRYPTOPP_ALIGN_DATA(16) const word64 s_clmulConstants64[] = { W64LIT(0xe100000000000000), W64LIT(0xc200000000000000), W64LIT(0x08090a0b0c0d0e0f), W64LIT(0x0001020304050607), W64LIT(0x0001020304050607), W64LIT(0x08090a0b0c0d0e0f)}; static const __m128i *s_clmulConstants = (const __m128i *)s_clmulConstants64; static const unsigned int s_clmulTableSizeInBlocks = 8; inline __m128i CLMUL_Reduce(__m128i c0, __m128i c1, __m128i c2, const __m128i &r) { /* The polynomial to be reduced is c0 * x^128 + c1 * x^64 + c2. c0t below refers to the most significant half of c0 as a polynomial, which, due to GCM's bit reflection, are in the rightmost bit positions, and the lowest byte addresses. c1 ^= c0t * 0xc200000000000000 c2t ^= c0t t = shift (c1t ^ c0b) left 1 bit c2 ^= t * 0xe100000000000000 c2t ^= c1b shift c2 left 1 bit and xor in lowest bit of c1t */ #if 0 // MSVC 2010 workaround: see http://connect.microsoft.com/VisualStudio/feedback/details/575301 c2 = _mm_xor_si128(c2, _mm_move_epi64(c0)); #else c1 = _mm_xor_si128(c1, _mm_slli_si128(c0, 8)); #endif c1 = _mm_xor_si128(c1, _mm_clmulepi64_si128(c0, r, 0x10)); c0 = _mm_srli_si128(c0, 8); c0 = _mm_xor_si128(c0, c1); c0 = _mm_slli_epi64(c0, 1); c0 = _mm_clmulepi64_si128(c0, r, 0); c2 = _mm_xor_si128(c2, c0); c2 = _mm_xor_si128(c2, _mm_srli_si128(c1, 8)); c1 = _mm_unpacklo_epi64(c1, c2); c1 = _mm_srli_epi64(c1, 63); c2 = _mm_slli_epi64(c2, 1); return _mm_xor_si128(c2, c1); } inline __m128i CLMUL_GF_Mul(const __m128i &x, const __m128i &h, const __m128i &r) { __m128i c0 = _mm_clmulepi64_si128(x,h,0); __m128i c1 = _mm_xor_si128(_mm_clmulepi64_si128(x,h,1), _mm_clmulepi64_si128(x,h,0x10)); __m128i c2 = _mm_clmulepi64_si128(x,h,0x11); return CLMUL_Reduce(c0, c1, c2, r); } #endif void GCM_Base::SetKeyWithoutResync(const byte *userKey, size_t keylength, const NameValuePairs ¶ms) { BlockCipher &blockCipher = AccessBlockCipher(); blockCipher.SetKey(userKey, keylength, params); if (blockCipher.BlockSize() != REQUIRED_BLOCKSIZE) throw InvalidArgument(AlgorithmName() + ": block size of underlying block cipher is not 16"); int tableSize, i, j, k; #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE if (HasCLMUL()) { params.GetIntValue(Name::TableSize(), tableSize); // avoid "parameter not used" error tableSize = s_clmulTableSizeInBlocks * REQUIRED_BLOCKSIZE; } else #endif { if (params.GetIntValue(Name::TableSize(), tableSize)) tableSize = (tableSize >= 64*1024) ? 64*1024 : 2*1024; else tableSize = (GetTablesOption() == GCM_64K_Tables) ? 64*1024 : 2*1024; #if defined(_MSC_VER) && (_MSC_VER >= 1300 && _MSC_VER < 1400) // VC 2003 workaround: compiler generates bad code for 64K tables tableSize = 2*1024; #endif } m_buffer.resize(3*REQUIRED_BLOCKSIZE + tableSize); byte *table = MulTable(); byte *hashKey = HashKey(); memset(hashKey, 0, REQUIRED_BLOCKSIZE); blockCipher.ProcessBlock(hashKey); #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE if (HasCLMUL()) { const __m128i r = s_clmulConstants[0]; __m128i h0 = _mm_shuffle_epi8(_mm_load_si128((__m128i *)hashKey), s_clmulConstants[1]); __m128i h = h0; for (i=0; i Block; Block::Get(hashKey)(V0)(V1); if (tableSize == 64*1024) { for (i=0; i<128; i++) { k = i%8; Block::Put(NULL, table+(i/8)*256*16+(size_t(1)<<(11-k)))(V0)(V1); int x = (int)V1 & 1; V1 = (V1>>1) | (V0<<63); V0 = (V0>>1) ^ (x ? W64LIT(0xe1) << 56 : 0); } for (i=0; i<16; i++) { memset(table+i*256*16, 0, 16); #if CRYPTOPP_BOOL_SSE2_INTRINSICS_AVAILABLE || CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE if (HasSSE2()) for (j=2; j<=0x80; j*=2) for (k=1; k>1) | (V0<<63); V0 = (V0>>1) ^ (x ? W64LIT(0xe1) << 56 : 0); } for (i=0; i<4; i++) { memset(table+i*256, 0, 16); memset(table+1024+i*256, 0, 16); #if CRYPTOPP_BOOL_SSE2_INTRINSICS_AVAILABLE || CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE if (HasSSE2()) for (j=2; j<=8; j*=2) for (k=1; k= HASH_BLOCKSIZE) { len = GCM_Base::AuthenticateBlocks(iv, len); iv += (origLen - len); } if (len > 0) { memcpy(m_buffer, iv, len); memset(m_buffer+len, 0, HASH_BLOCKSIZE-len); GCM_Base::AuthenticateBlocks(m_buffer, HASH_BLOCKSIZE); } PutBlock(NULL, m_buffer)(0)(origLen*8); GCM_Base::AuthenticateBlocks(m_buffer, HASH_BLOCKSIZE); ReverseHashBufferIfNeeded(); } if (m_state >= State_IVSet) m_ctr.Resynchronize(hashBuffer, REQUIRED_BLOCKSIZE); else m_ctr.SetCipherWithIV(cipher, hashBuffer); m_ctr.Seek(HASH_BLOCKSIZE); memset(hashBuffer, 0, HASH_BLOCKSIZE); } unsigned int GCM_Base::OptimalDataAlignment() const { return #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE || defined(CRYPTOPP_X64_MASM_AVAILABLE) HasSSE2() ? 16 : #endif GetBlockCipher().OptimalDataAlignment(); } #pragma warning(disable: 4731) // frame pointer register 'ebp' modified by inline assembly code #endif // #ifndef CRYPTOPP_GENERATE_X64_MASM #ifdef CRYPTOPP_X64_MASM_AVAILABLE extern "C" { void GCM_AuthenticateBlocks_2K(const byte *data, size_t blocks, word64 *hashBuffer, const word16 *reductionTable); void GCM_AuthenticateBlocks_64K(const byte *data, size_t blocks, word64 *hashBuffer); } #endif #ifndef CRYPTOPP_GENERATE_X64_MASM size_t GCM_Base::AuthenticateBlocks(const byte *data, size_t len) { #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE if (HasCLMUL()) { const __m128i *table = (const __m128i *)MulTable(); __m128i x = _mm_load_si128((__m128i *)HashBuffer()); const __m128i r = s_clmulConstants[0], bswapMask = s_clmulConstants[1], bswapMask2 = s_clmulConstants[2]; while (len >= 16) { size_t s = UnsignedMin(len/16, s_clmulTableSizeInBlocks), i=0; __m128i d, d2 = _mm_shuffle_epi8(_mm_loadu_si128((const __m128i *)(data+(s-1)*16)), bswapMask2);; __m128i c0 = _mm_setzero_si128(); __m128i c1 = _mm_setzero_si128(); __m128i c2 = _mm_setzero_si128(); while (true) { __m128i h0 = _mm_load_si128(table+i); __m128i h1 = _mm_load_si128(table+i+1); __m128i h01 = _mm_xor_si128(h0, h1); if (++i == s) { d = _mm_shuffle_epi8(_mm_loadu_si128((const __m128i *)data), bswapMask); d = _mm_xor_si128(d, x); c0 = _mm_xor_si128(c0, _mm_clmulepi64_si128(d, h0, 0)); c2 = _mm_xor_si128(c2, _mm_clmulepi64_si128(d, h1, 1)); d = _mm_xor_si128(d, _mm_shuffle_epi32(d, _MM_SHUFFLE(1, 0, 3, 2))); c1 = _mm_xor_si128(c1, _mm_clmulepi64_si128(d, h01, 0)); break; } d = _mm_shuffle_epi8(_mm_loadu_si128((const __m128i *)(data+(s-i)*16-8)), bswapMask2); c0 = _mm_xor_si128(c0, _mm_clmulepi64_si128(d2, h0, 1)); c2 = _mm_xor_si128(c2, _mm_clmulepi64_si128(d, h1, 1)); d2 = _mm_xor_si128(d2, d); c1 = _mm_xor_si128(c1, _mm_clmulepi64_si128(d2, h01, 1)); if (++i == s) { d = _mm_shuffle_epi8(_mm_loadu_si128((const __m128i *)data), bswapMask); d = _mm_xor_si128(d, x); c0 = _mm_xor_si128(c0, _mm_clmulepi64_si128(d, h0, 0x10)); c2 = _mm_xor_si128(c2, _mm_clmulepi64_si128(d, h1, 0x11)); d = _mm_xor_si128(d, _mm_shuffle_epi32(d, _MM_SHUFFLE(1, 0, 3, 2))); c1 = _mm_xor_si128(c1, _mm_clmulepi64_si128(d, h01, 0x10)); break; } d2 = _mm_shuffle_epi8(_mm_loadu_si128((const __m128i *)(data+(s-i)*16-8)), bswapMask); c0 = _mm_xor_si128(c0, _mm_clmulepi64_si128(d, h0, 0x10)); c2 = _mm_xor_si128(c2, _mm_clmulepi64_si128(d2, h1, 0x10)); d = _mm_xor_si128(d, d2); c1 = _mm_xor_si128(c1, _mm_clmulepi64_si128(d, h01, 0x10)); } data += s*16; len -= s*16; c1 = _mm_xor_si128(_mm_xor_si128(c1, c0), c2); x = CLMUL_Reduce(c0, c1, c2, r); } _mm_store_si128((__m128i *)HashBuffer(), x); return len; } #endif typedef BlockGetAndPut Block; word64 *hashBuffer = (word64 *)HashBuffer(); switch (2*(m_buffer.size()>=64*1024) #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE || defined(CRYPTOPP_X64_MASM_AVAILABLE) + HasSSE2() #endif ) { case 0: // non-SSE2 and 2K tables { byte *table = MulTable(); word64 x0 = hashBuffer[0], x1 = hashBuffer[1]; do { word64 y0, y1, a0, a1, b0, b1, c0, c1, d0, d1; Block::Get(data)(y0)(y1); x0 ^= y0; x1 ^= y1; data += HASH_BLOCKSIZE; len -= HASH_BLOCKSIZE; #define READ_TABLE_WORD64_COMMON(a, b, c, d) *(word64 *)(table+(a*1024)+(b*256)+c+d*8) #ifdef IS_LITTLE_ENDIAN #if CRYPTOPP_BOOL_SLOW_WORD64 word32 z0 = (word32)x0; word32 z1 = (word32)(x0>>32); word32 z2 = (word32)x1; word32 z3 = (word32)(x1>>32); #define READ_TABLE_WORD64(a, b, c, d, e) READ_TABLE_WORD64_COMMON((d%2), c, (d?(z##c>>((d?d-1:0)*4))&0xf0:(z##c&0xf)<<4), e) #else #define READ_TABLE_WORD64(a, b, c, d, e) READ_TABLE_WORD64_COMMON((d%2), c, ((d+8*b)?(x##a>>(((d+8*b)?(d+8*b)-1:1)*4))&0xf0:(x##a&0xf)<<4), e) #endif #define GF_MOST_SIG_8BITS(a) (a##1 >> 7*8) #define GF_SHIFT_8(a) a##1 = (a##1 << 8) ^ (a##0 >> 7*8); a##0 <<= 8; #else #define READ_TABLE_WORD64(a, b, c, d, e) READ_TABLE_WORD64_COMMON((1-d%2), c, ((15-d-8*b)?(x##a>>(((15-d-8*b)?(15-d-8*b)-1:0)*4))&0xf0:(x##a&0xf)<<4), e) #define GF_MOST_SIG_8BITS(a) (a##1 & 0xff) #define GF_SHIFT_8(a) a##1 = (a##1 >> 8) ^ (a##0 << 7*8); a##0 >>= 8; #endif #define GF_MUL_32BY128(op, a, b, c) \ a0 op READ_TABLE_WORD64(a, b, c, 0, 0) ^ READ_TABLE_WORD64(a, b, c, 1, 0);\ a1 op READ_TABLE_WORD64(a, b, c, 0, 1) ^ READ_TABLE_WORD64(a, b, c, 1, 1);\ b0 op READ_TABLE_WORD64(a, b, c, 2, 0) ^ READ_TABLE_WORD64(a, b, c, 3, 0);\ b1 op READ_TABLE_WORD64(a, b, c, 2, 1) ^ READ_TABLE_WORD64(a, b, c, 3, 1);\ c0 op READ_TABLE_WORD64(a, b, c, 4, 0) ^ READ_TABLE_WORD64(a, b, c, 5, 0);\ c1 op READ_TABLE_WORD64(a, b, c, 4, 1) ^ READ_TABLE_WORD64(a, b, c, 5, 1);\ d0 op READ_TABLE_WORD64(a, b, c, 6, 0) ^ READ_TABLE_WORD64(a, b, c, 7, 0);\ d1 op READ_TABLE_WORD64(a, b, c, 6, 1) ^ READ_TABLE_WORD64(a, b, c, 7, 1);\ GF_MUL_32BY128(=, 0, 0, 0) GF_MUL_32BY128(^=, 0, 1, 1) GF_MUL_32BY128(^=, 1, 0, 2) GF_MUL_32BY128(^=, 1, 1, 3) word32 r = (word32)s_reductionTable[GF_MOST_SIG_8BITS(d)] << 16; GF_SHIFT_8(d) c0 ^= d0; c1 ^= d1; r ^= (word32)s_reductionTable[GF_MOST_SIG_8BITS(c)] << 8; GF_SHIFT_8(c) b0 ^= c0; b1 ^= c1; r ^= s_reductionTable[GF_MOST_SIG_8BITS(b)]; GF_SHIFT_8(b) a0 ^= b0; a1 ^= b1; a0 ^= ConditionalByteReverse(LITTLE_ENDIAN_ORDER, r); x0 = a0; x1 = a1; } while (len >= HASH_BLOCKSIZE); hashBuffer[0] = x0; hashBuffer[1] = x1; return len; } case 2: // non-SSE2 and 64K tables { byte *table = MulTable(); word64 x0 = hashBuffer[0], x1 = hashBuffer[1]; do { word64 y0, y1, a0, a1; Block::Get(data)(y0)(y1); x0 ^= y0; x1 ^= y1; data += HASH_BLOCKSIZE; len -= HASH_BLOCKSIZE; #undef READ_TABLE_WORD64_COMMON #undef READ_TABLE_WORD64 #define READ_TABLE_WORD64_COMMON(a, c, d) *(word64 *)(table+(a)*256*16+(c)+(d)*8) #ifdef IS_LITTLE_ENDIAN #if CRYPTOPP_BOOL_SLOW_WORD64 word32 z0 = (word32)x0; word32 z1 = (word32)(x0>>32); word32 z2 = (word32)x1; word32 z3 = (word32)(x1>>32); #define READ_TABLE_WORD64(b, c, d, e) READ_TABLE_WORD64_COMMON(c*4+d, (d?(z##c>>((d?d:1)*8-4))&0xff0:(z##c&0xff)<<4), e) #else #define READ_TABLE_WORD64(b, c, d, e) READ_TABLE_WORD64_COMMON(c*4+d, ((d+4*(c%2))?(x##b>>(((d+4*(c%2))?(d+4*(c%2)):1)*8-4))&0xff0:(x##b&0xff)<<4), e) #endif #else #define READ_TABLE_WORD64(b, c, d, e) READ_TABLE_WORD64_COMMON(c*4+d, ((7-d-4*(c%2))?(x##b>>(((7-d-4*(c%2))?(7-d-4*(c%2)):1)*8-4))&0xff0:(x##b&0xff)<<4), e) #endif #define GF_MUL_8BY128(op, b, c, d) \ a0 op READ_TABLE_WORD64(b, c, d, 0);\ a1 op READ_TABLE_WORD64(b, c, d, 1);\ GF_MUL_8BY128(=, 0, 0, 0) GF_MUL_8BY128(^=, 0, 0, 1) GF_MUL_8BY128(^=, 0, 0, 2) GF_MUL_8BY128(^=, 0, 0, 3) GF_MUL_8BY128(^=, 0, 1, 0) GF_MUL_8BY128(^=, 0, 1, 1) GF_MUL_8BY128(^=, 0, 1, 2) GF_MUL_8BY128(^=, 0, 1, 3) GF_MUL_8BY128(^=, 1, 2, 0) GF_MUL_8BY128(^=, 1, 2, 1) GF_MUL_8BY128(^=, 1, 2, 2) GF_MUL_8BY128(^=, 1, 2, 3) GF_MUL_8BY128(^=, 1, 3, 0) GF_MUL_8BY128(^=, 1, 3, 1) GF_MUL_8BY128(^=, 1, 3, 2) GF_MUL_8BY128(^=, 1, 3, 3) x0 = a0; x1 = a1; } while (len >= HASH_BLOCKSIZE); hashBuffer[0] = x0; hashBuffer[1] = x1; return len; } #endif // #ifndef CRYPTOPP_GENERATE_X64_MASM #ifdef CRYPTOPP_X64_MASM_AVAILABLE case 1: // SSE2 and 2K tables GCM_AuthenticateBlocks_2K(data, len/16, hashBuffer, s_reductionTable); return len % 16; case 3: // SSE2 and 64K tables GCM_AuthenticateBlocks_64K(data, len/16, hashBuffer); return len % 16; #endif #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE case 1: // SSE2 and 2K tables { #ifdef __GNUC__ __asm__ __volatile__ ( ".intel_syntax noprefix;" #elif defined(CRYPTOPP_GENERATE_X64_MASM) ALIGN 8 GCM_AuthenticateBlocks_2K PROC FRAME rex_push_reg rsi push_reg rdi push_reg rbx .endprolog mov rsi, r8 mov r11, r9 #else AS2( mov WORD_REG(cx), data ) AS2( mov WORD_REG(dx), len ) AS2( mov WORD_REG(si), hashBuffer ) AS2( shr WORD_REG(dx), 4 ) #endif AS_PUSH_IF86( bx) AS_PUSH_IF86( bp) #ifdef __GNUC__ AS2( mov AS_REG_7, WORD_REG(di)) #elif CRYPTOPP_BOOL_X86 AS2( lea AS_REG_7, s_reductionTable) #endif AS2( movdqa xmm0, [WORD_REG(si)] ) #define MUL_TABLE_0 WORD_REG(si) + 32 #define MUL_TABLE_1 WORD_REG(si) + 32 + 1024 #define RED_TABLE AS_REG_7 ASL(0) AS2( movdqu xmm4, [WORD_REG(cx)] ) AS2( pxor xmm0, xmm4 ) AS2( movd ebx, xmm0 ) AS2( mov eax, AS_HEX(f0f0f0f0) ) AS2( and eax, ebx ) AS2( shl ebx, 4 ) AS2( and ebx, AS_HEX(f0f0f0f0) ) AS2( movzx edi, ah ) AS2( movdqa xmm5, XMMWORD_PTR [MUL_TABLE_1 + WORD_REG(di)] ) AS2( movzx edi, al ) AS2( movdqa xmm4, XMMWORD_PTR [MUL_TABLE_1 + WORD_REG(di)] ) AS2( shr eax, 16 ) AS2( movzx edi, ah ) AS2( movdqa xmm3, XMMWORD_PTR [MUL_TABLE_1 + WORD_REG(di)] ) AS2( movzx edi, al ) AS2( movdqa xmm2, XMMWORD_PTR [MUL_TABLE_1 + WORD_REG(di)] ) #define SSE2_MUL_32BITS(i) \ AS2( psrldq xmm0, 4 )\ AS2( movd eax, xmm0 )\ AS2( and eax, AS_HEX(f0f0f0f0) )\ AS2( movzx edi, bh )\ AS2( pxor xmm5, XMMWORD_PTR [MUL_TABLE_0 + (i-1)*256 + WORD_REG(di)] )\ AS2( movzx edi, bl )\ AS2( pxor xmm4, XMMWORD_PTR [MUL_TABLE_0 + (i-1)*256 + WORD_REG(di)] )\ AS2( shr ebx, 16 )\ AS2( movzx edi, bh )\ AS2( pxor xmm3, XMMWORD_PTR [MUL_TABLE_0 + (i-1)*256 + WORD_REG(di)] )\ AS2( movzx edi, bl )\ AS2( pxor xmm2, XMMWORD_PTR [MUL_TABLE_0 + (i-1)*256 + WORD_REG(di)] )\ AS2( movd ebx, xmm0 )\ AS2( shl ebx, 4 )\ AS2( and ebx, AS_HEX(f0f0f0f0) )\ AS2( movzx edi, ah )\ AS2( pxor xmm5, XMMWORD_PTR [MUL_TABLE_1 + i*256 + WORD_REG(di)] )\ AS2( movzx edi, al )\ AS2( pxor xmm4, XMMWORD_PTR [MUL_TABLE_1 + i*256 + WORD_REG(di)] )\ AS2( shr eax, 16 )\ AS2( movzx edi, ah )\ AS2( pxor xmm3, XMMWORD_PTR [MUL_TABLE_1 + i*256 + WORD_REG(di)] )\ AS2( movzx edi, al )\ AS2( pxor xmm2, XMMWORD_PTR [MUL_TABLE_1 + i*256 + WORD_REG(di)] )\ SSE2_MUL_32BITS(1) SSE2_MUL_32BITS(2) SSE2_MUL_32BITS(3) AS2( movzx edi, bh ) AS2( pxor xmm5, XMMWORD_PTR [MUL_TABLE_0 + 3*256 + WORD_REG(di)] ) AS2( movzx edi, bl ) AS2( pxor xmm4, XMMWORD_PTR [MUL_TABLE_0 + 3*256 + WORD_REG(di)] ) AS2( shr ebx, 16 ) AS2( movzx edi, bh ) AS2( pxor xmm3, XMMWORD_PTR [MUL_TABLE_0 + 3*256 + WORD_REG(di)] ) AS2( movzx edi, bl ) AS2( pxor xmm2, XMMWORD_PTR [MUL_TABLE_0 + 3*256 + WORD_REG(di)] ) AS2( movdqa xmm0, xmm3 ) AS2( pslldq xmm3, 1 ) AS2( pxor xmm2, xmm3 ) AS2( movdqa xmm1, xmm2 ) AS2( pslldq xmm2, 1 ) AS2( pxor xmm5, xmm2 ) AS2( psrldq xmm0, 15 ) AS2( movd WORD_REG(di), xmm0 ) AS2( movzx eax, WORD PTR [RED_TABLE + WORD_REG(di)*2] ) AS2( shl eax, 8 ) AS2( movdqa xmm0, xmm5 ) AS2( pslldq xmm5, 1 ) AS2( pxor xmm4, xmm5 ) AS2( psrldq xmm1, 15 ) AS2( movd WORD_REG(di), xmm1 ) AS2( xor ax, WORD PTR [RED_TABLE + WORD_REG(di)*2] ) AS2( shl eax, 8 ) AS2( psrldq xmm0, 15 ) AS2( movd WORD_REG(di), xmm0 ) AS2( xor ax, WORD PTR [RED_TABLE + WORD_REG(di)*2] ) AS2( movd xmm0, eax ) AS2( pxor xmm0, xmm4 ) AS2( add WORD_REG(cx), 16 ) AS2( sub WORD_REG(dx), 1 ) ASJ( jnz, 0, b ) AS2( movdqa [WORD_REG(si)], xmm0 ) AS_POP_IF86( bp) AS_POP_IF86( bx) #ifdef __GNUC__ ".att_syntax prefix;" : : "c" (data), "d" (len/16), "S" (hashBuffer), "D" (s_reductionTable) : "memory", "cc", "%eax" #if CRYPTOPP_BOOL_X64 , "%ebx", "%r11" #endif ); #elif defined(CRYPTOPP_GENERATE_X64_MASM) pop rbx pop rdi pop rsi ret GCM_AuthenticateBlocks_2K ENDP #endif return len%16; } case 3: // SSE2 and 64K tables { #ifdef __GNUC__ __asm__ __volatile__ ( ".intel_syntax noprefix;" #elif defined(CRYPTOPP_GENERATE_X64_MASM) ALIGN 8 GCM_AuthenticateBlocks_64K PROC FRAME rex_push_reg rsi push_reg rdi .endprolog mov rsi, r8 #else AS2( mov WORD_REG(cx), data ) AS2( mov WORD_REG(dx), len ) AS2( mov WORD_REG(si), hashBuffer ) AS2( shr WORD_REG(dx), 4 ) #endif AS2( movdqa xmm0, [WORD_REG(si)] ) #undef MUL_TABLE #define MUL_TABLE(i,j) WORD_REG(si) + 32 + (i*4+j)*256*16 ASL(1) AS2( movdqu xmm1, [WORD_REG(cx)] ) AS2( pxor xmm1, xmm0 ) AS2( pxor xmm0, xmm0 ) #undef SSE2_MUL_32BITS #define SSE2_MUL_32BITS(i) \ AS2( movd eax, xmm1 )\ AS2( psrldq xmm1, 4 )\ AS2( movzx edi, al )\ AS2( add WORD_REG(di), WORD_REG(di) )\ AS2( pxor xmm0, [MUL_TABLE(i,0) + WORD_REG(di)*8] )\ AS2( movzx edi, ah )\ AS2( add WORD_REG(di), WORD_REG(di) )\ AS2( pxor xmm0, [MUL_TABLE(i,1) + WORD_REG(di)*8] )\ AS2( shr eax, 16 )\ AS2( movzx edi, al )\ AS2( add WORD_REG(di), WORD_REG(di) )\ AS2( pxor xmm0, [MUL_TABLE(i,2) + WORD_REG(di)*8] )\ AS2( movzx edi, ah )\ AS2( add WORD_REG(di), WORD_REG(di) )\ AS2( pxor xmm0, [MUL_TABLE(i,3) + WORD_REG(di)*8] )\ SSE2_MUL_32BITS(0) SSE2_MUL_32BITS(1) SSE2_MUL_32BITS(2) SSE2_MUL_32BITS(3) AS2( add WORD_REG(cx), 16 ) AS2( sub WORD_REG(dx), 1 ) ASJ( jnz, 1, b ) AS2( movdqa [WORD_REG(si)], xmm0 ) #ifdef __GNUC__ ".att_syntax prefix;" : : "c" (data), "d" (len/16), "S" (hashBuffer) : "memory", "cc", "%edi", "%eax" ); #elif defined(CRYPTOPP_GENERATE_X64_MASM) pop rdi pop rsi ret GCM_AuthenticateBlocks_64K ENDP #endif return len%16; } #endif #ifndef CRYPTOPP_GENERATE_X64_MASM } return len%16; } void GCM_Base::AuthenticateLastHeaderBlock() { if (m_bufferedDataLength > 0) { memset(m_buffer+m_bufferedDataLength, 0, HASH_BLOCKSIZE-m_bufferedDataLength); m_bufferedDataLength = 0; GCM_Base::AuthenticateBlocks(m_buffer, HASH_BLOCKSIZE); } } void GCM_Base::AuthenticateLastConfidentialBlock() { GCM_Base::AuthenticateLastHeaderBlock(); PutBlock(NULL, m_buffer)(m_totalHeaderLength*8)(m_totalMessageLength*8); GCM_Base::AuthenticateBlocks(m_buffer, HASH_BLOCKSIZE); } void GCM_Base::AuthenticateLastFooterBlock(byte *mac, size_t macSize) { m_ctr.Seek(0); ReverseHashBufferIfNeeded(); m_ctr.ProcessData(mac, HashBuffer(), macSize); } NAMESPACE_END #endif // #ifndef CRYPTOPP_GENERATE_X64_MASM #endif armory-0.92.3/cppForSwig/cryptopp/crc.h0000755000000000000000000000174612414772654016526 0ustar rootroot#ifndef CRYPTOPP_CRC32_H #define CRYPTOPP_CRC32_H #include "cryptlib.h" NAMESPACE_BEGIN(CryptoPP) const word32 CRC32_NEGL = 0xffffffffL; #ifdef IS_LITTLE_ENDIAN #define CRC32_INDEX(c) (c & 0xff) #define CRC32_SHIFTED(c) (c >> 8) #else #define CRC32_INDEX(c) (c >> 24) #define CRC32_SHIFTED(c) (c << 8) #endif //! CRC Checksum Calculation class CRC32 : public HashTransformation { public: CRYPTOPP_CONSTANT(DIGESTSIZE = 4) CRC32(); void Update(const byte *input, size_t length); void TruncatedFinal(byte *hash, size_t size); unsigned int DigestSize() const {return DIGESTSIZE;} static const char * StaticAlgorithmName() {return "CRC32";} std::string AlgorithmName() const {return StaticAlgorithmName();} void UpdateByte(byte b) {m_crc = m_tab[CRC32_INDEX(m_crc) ^ b] ^ CRC32_SHIFTED(m_crc);} byte GetCrcByte(size_t i) const {return ((byte *)&(m_crc))[i];} private: void Reset() {m_crc = CRC32_NEGL;} static const word32 m_tab[256]; word32 m_crc; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/rc2.cpp0000755000000000000000000000650312414772654016774 0ustar rootroot// rc2.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "rc2.h" #include "misc.h" #include "argnames.h" NAMESPACE_BEGIN(CryptoPP) void RC2::Base::UncheckedSetKey(const byte *key, unsigned int keyLen, const NameValuePairs ¶ms) { AssertValidKeyLength(keyLen); int effectiveLen = params.GetIntValueWithDefault(Name::EffectiveKeyLength(), DEFAULT_EFFECTIVE_KEYLENGTH); if (effectiveLen > MAX_EFFECTIVE_KEYLENGTH) throw InvalidArgument("RC2: effective key length parameter exceeds maximum"); static const unsigned char PITABLE[256] = { 217,120,249,196, 25,221,181,237, 40,233,253,121, 74,160,216,157, 198,126, 55,131, 43,118, 83,142, 98, 76,100,136, 68,139,251,162, 23,154, 89,245,135,179, 79, 19, 97, 69,109,141, 9,129,125, 50, 189,143, 64,235,134,183,123, 11,240,149, 33, 34, 92,107, 78,130, 84,214,101,147,206, 96,178, 28,115, 86,192, 20,167,140,241,220, 18,117,202, 31, 59,190,228,209, 66, 61,212, 48,163, 60,182, 38, 111,191, 14,218, 70,105, 7, 87, 39,242, 29,155,188,148, 67, 3, 248, 17,199,246,144,239, 62,231, 6,195,213, 47,200,102, 30,215, 8,232,234,222,128, 82,238,247,132,170,114,172, 53, 77,106, 42, 150, 26,210,113, 90, 21, 73,116, 75,159,208, 94, 4, 24,164,236, 194,224, 65,110, 15, 81,203,204, 36,145,175, 80,161,244,112, 57, 153,124, 58,133, 35,184,180,122,252, 2, 54, 91, 37, 85,151, 49, 45, 93,250,152,227,138,146,174, 5,223, 41, 16,103,108,186,201, 211, 0,230,207,225,158,168, 44, 99, 22, 1, 63, 88,226,137,169, 13, 56, 52, 27,171, 51,255,176,187, 72, 12, 95,185,177,205, 46, 197,243,219, 71,229,165,156,119, 10,166, 32,104,254,127,193,173}; SecByteBlock L(128); memcpy(L, key, keyLen); int i; for (i=keyLen; i<128; i++) L[i] = PITABLE[(L[i-1] + L[i-keyLen]) & 255]; unsigned int T8 = (effectiveLen+7) / 8; byte TM = 255 >> ((8-(effectiveLen%8))%8); L[128-T8] = PITABLE[L[128-T8] & TM]; for (i=127-T8; i>=0; i--) L[i] = PITABLE[L[i+1] ^ L[i+T8]]; for (i=0; i<64; i++) K[i] = L[2*i] + (L[2*i+1] << 8); } typedef BlockGetAndPut Block; void RC2::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word16 R0, R1, R2, R3; Block::Get(inBlock)(R0)(R1)(R2)(R3); for (int i = 0; i < 16; i++) { R0 += (R1 & ~R3) + (R2 & R3) + K[4*i+0]; R0 = rotlFixed(R0, 1); R1 += (R2 & ~R0) + (R3 & R0) + K[4*i+1]; R1 = rotlFixed(R1, 2); R2 += (R3 & ~R1) + (R0 & R1) + K[4*i+2]; R2 = rotlFixed(R2, 3); R3 += (R0 & ~R2) + (R1 & R2) + K[4*i+3]; R3 = rotlFixed(R3, 5); if (i == 4 || i == 10) { R0 += K[R3 & 63]; R1 += K[R0 & 63]; R2 += K[R1 & 63]; R3 += K[R2 & 63]; } } Block::Put(xorBlock, outBlock)(R0)(R1)(R2)(R3); } void RC2::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const { word16 R0, R1, R2, R3; Block::Get(inBlock)(R0)(R1)(R2)(R3); for (int i = 15; i >= 0; i--) { if (i == 4 || i == 10) { R3 -= K[R2 & 63]; R2 -= K[R1 & 63]; R1 -= K[R0 & 63]; R0 -= K[R3 & 63]; } R3 = rotrFixed(R3, 5); R3 -= (R0 & ~R2) + (R1 & R2) + K[4*i+3]; R2 = rotrFixed(R2, 3); R2 -= (R3 & ~R1) + (R0 & R1) + K[4*i+2]; R1 = rotrFixed(R1, 2); R1 -= (R2 & ~R0) + (R3 & R0) + K[4*i+1]; R0 = rotrFixed(R0, 1); R0 -= (R1 & ~R3) + (R2 & R3) + K[4*i+0]; } Block::Put(xorBlock, outBlock)(R0)(R1)(R2)(R3); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/bench.cpp0000755000000000000000000003053012414772654017362 0ustar rootroot// bench.cpp - written and placed in the public domain by Wei Dai #define _CRT_SECURE_NO_DEPRECATE #include "bench.h" #include "validate.h" #include "aes.h" #include "blumshub.h" #include "files.h" #include "hex.h" #include "modes.h" #include "factory.h" #include "cpu.h" #include #include #include #include USING_NAMESPACE(CryptoPP) USING_NAMESPACE(std) #ifdef CLOCKS_PER_SEC const double CLOCK_TICKS_PER_SECOND = (double)CLOCKS_PER_SEC; #elif defined(CLK_TCK) const double CLOCK_TICKS_PER_SECOND = (double)CLK_TCK; #else const double CLOCK_TICKS_PER_SECOND = 1000000.0; #endif double logtotal = 0, g_allocatedTime, g_hertz; unsigned int logcount = 0; static const byte *const key=(byte *)"0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000"; void OutputResultBytes(const char *name, double length, double timeTaken) { double mbs = length / timeTaken / (1024*1024); cout << "\n" << name; // cout << "" << setprecision(3) << length / (1024*1024); cout << setiosflags(ios::fixed); // cout << "" << setprecision(3) << timeTaken; cout << "" << setprecision(0) << setiosflags(ios::fixed) << mbs; if (g_hertz) cout << "" << setprecision(1) << setiosflags(ios::fixed) << timeTaken * g_hertz / length; cout << resetiosflags(ios::fixed); logtotal += log(mbs); logcount++; } void OutputResultKeying(double iterations, double timeTaken) { cout << "" << setprecision(3) << setiosflags(ios::fixed) << (1000*1000*timeTaken/iterations); if (g_hertz) cout << "" << setprecision(0) << setiosflags(ios::fixed) << timeTaken * g_hertz / iterations; } void OutputResultOperations(const char *name, const char *operation, bool pc, unsigned long iterations, double timeTaken) { cout << "\n" << name << " " << operation << (pc ? " with precomputation" : ""); // cout << "" << iterations; // cout << setiosflags(ios::fixed); // cout << "" << setprecision(3) << timeTaken; cout << "" << setprecision(2) << setiosflags(ios::fixed) << (1000*timeTaken/iterations); if (g_hertz) cout << "" << setprecision(2) << setiosflags(ios::fixed) << timeTaken * g_hertz / iterations / 1000000; cout << resetiosflags(ios::fixed); logtotal += log(iterations/timeTaken); logcount++; } /* void BenchMark(const char *name, BlockTransformation &cipher, double timeTotal) { const int BUF_SIZE = RoundUpToMultipleOf(2048U, cipher.OptimalNumberOfParallelBlocks() * cipher.BlockSize()); AlignedSecByteBlock buf(BUF_SIZE); const int nBlocks = BUF_SIZE / cipher.BlockSize(); clock_t start = clock(); unsigned long i=0, blocks=1; double timeTaken; do { blocks *= 2; for (; i(cipher), timeTotal); } void BenchMark(const char *name, HashTransformation &ht, double timeTotal) { const int BUF_SIZE=2048U; AlignedSecByteBlock buf(BUF_SIZE); GlobalRNG().GenerateBlock(buf, BUF_SIZE); clock_t start = clock(); unsigned long i=0, blocks=1; double timeTaken; do { blocks *= 2; for (; i void BenchMarkByName2(const char *factoryName, size_t keyLength = 0, const char *displayName=NULL, const NameValuePairs ¶ms = g_nullNameValuePairs, T_FactoryOutput *x=NULL, T_Interface *y=NULL) { std::string name = factoryName; if (displayName) name = displayName; else if (keyLength) name += " (" + IntToString(keyLength * 8) + "-bit key)"; std::auto_ptr obj(ObjectFactoryRegistry::Registry().CreateObject(factoryName)); if (!keyLength) keyLength = obj->DefaultKeyLength(); obj->SetKey(key, keyLength, CombinedNameValuePairs(params, MakeParameters(Name::IV(), ConstByteArrayParameter(key, obj->IVSize()), false))); BenchMark(name.c_str(), *static_cast(obj.get()), g_allocatedTime); BenchMarkKeying(*obj, keyLength, CombinedNameValuePairs(params, MakeParameters(Name::IV(), ConstByteArrayParameter(key, obj->IVSize()), false))); } //VC60 workaround: compiler bug triggered without the extra dummy parameters template void BenchMarkByName(const char *factoryName, size_t keyLength = 0, const char *displayName=NULL, const NameValuePairs ¶ms = g_nullNameValuePairs, T_FactoryOutput *x=NULL) { BenchMarkByName2(factoryName, keyLength, displayName, params, x, x); } template void BenchMarkByNameKeyLess(const char *factoryName, const char *displayName=NULL, const NameValuePairs ¶ms = g_nullNameValuePairs, T *x=NULL) { std::string name = factoryName; if (displayName) name = displayName; std::auto_ptr obj(ObjectFactoryRegistry::Registry().CreateObject(factoryName)); BenchMark(name.c_str(), *obj, g_allocatedTime); } void BenchmarkAll(double t, double hertz) { #if 1 logtotal = 0; logcount = 0; g_allocatedTime = t; g_hertz = hertz; const char *cpb, *cpk; if (g_hertz) { cpb = "Cycles Per Byte"; cpk = "Cycles to
Setup Key and IV"; cout << "CPU frequency of the test platform is " << g_hertz << " Hz.\n"; } else { cpb = cpk = ""; cout << "CPU frequency of the test platform was not provided.\n"; } cout << "" << endl; cout << ""; #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE if (HasCLMUL()) BenchMarkByName2("AES/GCM", 0, "AES/GCM"); else #endif { BenchMarkByName2("AES/GCM", 0, "AES/GCM (2K tables)", MakeParameters(Name::TableSize(), 2048)); BenchMarkByName2("AES/GCM", 0, "AES/GCM (64K tables)", MakeParameters(Name::TableSize(), 64*1024)); } BenchMarkByName2("AES/CCM"); BenchMarkByName2("AES/EAX"); cout << "\n"; #if CRYPTOPP_BOOL_AESNI_INTRINSICS_AVAILABLE if (HasCLMUL()) BenchMarkByName2("AES/GCM", 0, "GMAC(AES)"); else #endif { BenchMarkByName2("AES/GCM", 0, "GMAC(AES) (2K tables)", MakeParameters(Name::TableSize(), 2048)); BenchMarkByName2("AES/GCM", 0, "GMAC(AES) (64K tables)", MakeParameters(Name::TableSize(), 64*1024)); } BenchMarkByName("VMAC(AES)-64"); BenchMarkByName("VMAC(AES)-128"); BenchMarkByName("HMAC(SHA-1)"); BenchMarkByName("Two-Track-MAC"); BenchMarkByName("CMAC(AES)"); BenchMarkByName("DMAC(AES)"); cout << "\n"; BenchMarkByNameKeyLess("CRC32"); BenchMarkByNameKeyLess("Adler32"); BenchMarkByNameKeyLess("MD5"); BenchMarkByNameKeyLess("SHA-1"); BenchMarkByNameKeyLess("SHA-256"); BenchMarkByNameKeyLess("SHA-512"); BenchMarkByNameKeyLess("Tiger"); BenchMarkByNameKeyLess("Whirlpool"); BenchMarkByNameKeyLess("RIPEMD-160"); BenchMarkByNameKeyLess("RIPEMD-320"); BenchMarkByNameKeyLess("RIPEMD-128"); BenchMarkByNameKeyLess("RIPEMD-256"); cout << "\n"; BenchMarkByName("Panama-LE"); BenchMarkByName("Panama-BE"); BenchMarkByName("Salsa20"); BenchMarkByName("Salsa20", 0, "Salsa20/12", MakeParameters(Name::Rounds(), 12)); BenchMarkByName("Salsa20", 0, "Salsa20/8", MakeParameters(Name::Rounds(), 8)); BenchMarkByName("Sosemanuk"); BenchMarkByName("MARC4"); BenchMarkByName("SEAL-3.0-LE"); BenchMarkByName("WAKE-OFB-LE"); cout << "\n"; BenchMarkByName("AES/CTR", 16); BenchMarkByName("AES/CTR", 24); BenchMarkByName("AES/CTR", 32); BenchMarkByName("AES/CBC", 16); BenchMarkByName("AES/CBC", 24); BenchMarkByName("AES/CBC", 32); BenchMarkByName("AES/OFB", 16); BenchMarkByName("AES/CFB", 16); BenchMarkByName("AES/ECB", 16); BenchMarkByName("Camellia/CTR", 16); BenchMarkByName("Camellia/CTR", 32); BenchMarkByName("Twofish/CTR"); BenchMarkByName("Serpent/CTR"); BenchMarkByName("CAST-256/CTR"); BenchMarkByName("RC6/CTR"); BenchMarkByName("MARS/CTR"); BenchMarkByName("SHACAL-2/CTR", 16); BenchMarkByName("SHACAL-2/CTR", 64); BenchMarkByName("DES/CTR"); BenchMarkByName("DES-XEX3/CTR"); BenchMarkByName("DES-EDE3/CTR"); BenchMarkByName("IDEA/CTR"); BenchMarkByName("RC5/CTR", 0, "RC5 (r=16)"); BenchMarkByName("Blowfish/CTR"); BenchMarkByName("TEA/CTR"); BenchMarkByName("XTEA/CTR"); BenchMarkByName("CAST-128/CTR"); BenchMarkByName("SKIPJACK/CTR"); BenchMarkByName("SEED/CTR", 0, "SEED/CTR (1/2 K table)"); cout << "
AlgorithmMiB/Second" << cpb << "Microseconds to
Setup Key and IV" << cpk << endl; cout << "\n
" << endl; BenchmarkAll2(t, hertz); cout << "Throughput Geometric Average: " << setiosflags(ios::fixed) << exp(logtotal/logcount) << endl; time_t endTime = time(NULL); cout << "\nTest ended at " << asctime(localtime(&endTime)); #endif } armory-0.92.3/cppForSwig/cryptopp/dsa.h0000755000000000000000000000227312414772654016522 0ustar rootroot#ifndef CRYPTOPP_DSA_H #define CRYPTOPP_DSA_H /** \file */ #include "gfpcrypt.h" NAMESPACE_BEGIN(CryptoPP) /*! The DSA signature format used by Crypto++ is as defined by IEEE P1363. Java uses the DER format, and OpenPGP uses the OpenPGP format. */ enum DSASignatureFormat {DSA_P1363, DSA_DER, DSA_OPENPGP}; /** This function converts between these formats, and returns length of signature in the target format. If toFormat == DSA_P1363, bufferSize must equal publicKey.SignatureLength() */ size_t DSAConvertSignatureFormat(byte *buffer, size_t bufferSize, DSASignatureFormat toFormat, const byte *signature, size_t signatureLen, DSASignatureFormat fromFormat); #ifdef CRYPTOPP_MAINTAIN_BACKWARDS_COMPATIBILITY typedef DSA::Signer DSAPrivateKey; typedef DSA::Verifier DSAPublicKey; const int MIN_DSA_PRIME_LENGTH = DSA::MIN_PRIME_LENGTH; const int MAX_DSA_PRIME_LENGTH = DSA::MAX_PRIME_LENGTH; const int DSA_PRIME_LENGTH_MULTIPLE = DSA::PRIME_LENGTH_MULTIPLE; inline bool GenerateDSAPrimes(const byte *seed, size_t seedLength, int &counter, Integer &p, unsigned int primeLength, Integer &q) {return DSA::GeneratePrimes(seed, seedLength, counter, p, primeLength, q);} #endif NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/asn.h0000755000000000000000000002726412414772654016543 0ustar rootroot#ifndef CRYPTOPP_ASN_H #define CRYPTOPP_ASN_H #include "filters.h" #include "queue.h" #include NAMESPACE_BEGIN(CryptoPP) // these tags and flags are not complete enum ASNTag { BOOLEAN = 0x01, INTEGER = 0x02, BIT_STRING = 0x03, OCTET_STRING = 0x04, TAG_NULL = 0x05, OBJECT_IDENTIFIER = 0x06, OBJECT_DESCRIPTOR = 0x07, EXTERNAL = 0x08, REAL = 0x09, ENUMERATED = 0x0a, UTF8_STRING = 0x0c, SEQUENCE = 0x10, SET = 0x11, NUMERIC_STRING = 0x12, PRINTABLE_STRING = 0x13, T61_STRING = 0x14, VIDEOTEXT_STRING = 0x15, IA5_STRING = 0x16, UTC_TIME = 0x17, GENERALIZED_TIME = 0x18, GRAPHIC_STRING = 0x19, VISIBLE_STRING = 0x1a, GENERAL_STRING = 0x1b }; enum ASNIdFlag { UNIVERSAL = 0x00, // DATA = 0x01, // HEADER = 0x02, CONSTRUCTED = 0x20, APPLICATION = 0x40, CONTEXT_SPECIFIC = 0x80, PRIVATE = 0xc0 }; inline void BERDecodeError() {throw BERDecodeErr();} class CRYPTOPP_DLL UnknownOID : public BERDecodeErr { public: UnknownOID() : BERDecodeErr("BER decode error: unknown object identifier") {} UnknownOID(const char *err) : BERDecodeErr(err) {} }; // unsigned int DERLengthEncode(unsigned int length, byte *output=0); CRYPTOPP_DLL size_t CRYPTOPP_API DERLengthEncode(BufferedTransformation &out, lword length); // returns false if indefinite length CRYPTOPP_DLL bool CRYPTOPP_API BERLengthDecode(BufferedTransformation &in, size_t &length); CRYPTOPP_DLL void CRYPTOPP_API DEREncodeNull(BufferedTransformation &out); CRYPTOPP_DLL void CRYPTOPP_API BERDecodeNull(BufferedTransformation &in); CRYPTOPP_DLL size_t CRYPTOPP_API DEREncodeOctetString(BufferedTransformation &out, const byte *str, size_t strLen); CRYPTOPP_DLL size_t CRYPTOPP_API DEREncodeOctetString(BufferedTransformation &out, const SecByteBlock &str); CRYPTOPP_DLL size_t CRYPTOPP_API BERDecodeOctetString(BufferedTransformation &in, SecByteBlock &str); CRYPTOPP_DLL size_t CRYPTOPP_API BERDecodeOctetString(BufferedTransformation &in, BufferedTransformation &str); // for UTF8_STRING, PRINTABLE_STRING, and IA5_STRING CRYPTOPP_DLL size_t CRYPTOPP_API DEREncodeTextString(BufferedTransformation &out, const std::string &str, byte asnTag); CRYPTOPP_DLL size_t CRYPTOPP_API BERDecodeTextString(BufferedTransformation &in, std::string &str, byte asnTag); CRYPTOPP_DLL size_t CRYPTOPP_API DEREncodeBitString(BufferedTransformation &out, const byte *str, size_t strLen, unsigned int unusedBits=0); CRYPTOPP_DLL size_t CRYPTOPP_API BERDecodeBitString(BufferedTransformation &in, SecByteBlock &str, unsigned int &unusedBits); // BER decode from source and DER reencode into dest CRYPTOPP_DLL void CRYPTOPP_API DERReencode(BufferedTransformation &source, BufferedTransformation &dest); //! Object Identifier class CRYPTOPP_DLL OID { public: OID() {} OID(word32 v) : m_values(1, v) {} OID(BufferedTransformation &bt) {BERDecode(bt);} inline OID & operator+=(word32 rhs) {m_values.push_back(rhs); return *this;} void DEREncode(BufferedTransformation &bt) const; void BERDecode(BufferedTransformation &bt); // throw BERDecodeErr() if decoded value doesn't equal this OID void BERDecodeAndCheck(BufferedTransformation &bt) const; std::vector m_values; private: static void EncodeValue(BufferedTransformation &bt, word32 v); static size_t DecodeValue(BufferedTransformation &bt, word32 &v); }; class EncodedObjectFilter : public Filter { public: enum Flag {PUT_OBJECTS=1, PUT_MESSANGE_END_AFTER_EACH_OBJECT=2, PUT_MESSANGE_END_AFTER_ALL_OBJECTS=4, PUT_MESSANGE_SERIES_END_AFTER_ALL_OBJECTS=8}; EncodedObjectFilter(BufferedTransformation *attachment = NULL, unsigned int nObjects = 1, word32 flags = 0); void Put(const byte *inString, size_t length); unsigned int GetNumberOfCompletedObjects() const {return m_nCurrentObject;} unsigned long GetPositionOfObject(unsigned int i) const {return m_positions[i];} private: BufferedTransformation & CurrentTarget(); word32 m_flags; unsigned int m_nObjects, m_nCurrentObject, m_level; std::vector m_positions; ByteQueue m_queue; enum State {IDENTIFIER, LENGTH, BODY, TAIL, ALL_DONE} m_state; byte m_id; lword m_lengthRemaining; }; //! BER General Decoder class CRYPTOPP_DLL BERGeneralDecoder : public Store { public: explicit BERGeneralDecoder(BufferedTransformation &inQueue, byte asnTag); explicit BERGeneralDecoder(BERGeneralDecoder &inQueue, byte asnTag); ~BERGeneralDecoder(); bool IsDefiniteLength() const {return m_definiteLength;} lword RemainingLength() const {assert(m_definiteLength); return m_length;} bool EndReached() const; byte PeekByte() const; void CheckByte(byte b); size_t TransferTo2(BufferedTransformation &target, lword &transferBytes, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true); size_t CopyRangeTo2(BufferedTransformation &target, lword &begin, lword end=LWORD_MAX, const std::string &channel=DEFAULT_CHANNEL, bool blocking=true) const; // call this to denote end of sequence void MessageEnd(); protected: BufferedTransformation &m_inQueue; bool m_finished, m_definiteLength; lword m_length; private: void Init(byte asnTag); void StoreInitialize(const NameValuePairs ¶meters) {assert(false);} lword ReduceLength(lword delta); }; //! DER General Encoder class CRYPTOPP_DLL DERGeneralEncoder : public ByteQueue { public: explicit DERGeneralEncoder(BufferedTransformation &outQueue, byte asnTag = SEQUENCE | CONSTRUCTED); explicit DERGeneralEncoder(DERGeneralEncoder &outQueue, byte asnTag = SEQUENCE | CONSTRUCTED); ~DERGeneralEncoder(); // call this to denote end of sequence void MessageEnd(); private: BufferedTransformation &m_outQueue; bool m_finished; byte m_asnTag; }; //! BER Sequence Decoder class CRYPTOPP_DLL BERSequenceDecoder : public BERGeneralDecoder { public: explicit BERSequenceDecoder(BufferedTransformation &inQueue, byte asnTag = SEQUENCE | CONSTRUCTED) : BERGeneralDecoder(inQueue, asnTag) {} explicit BERSequenceDecoder(BERSequenceDecoder &inQueue, byte asnTag = SEQUENCE | CONSTRUCTED) : BERGeneralDecoder(inQueue, asnTag) {} }; //! DER Sequence Encoder class CRYPTOPP_DLL DERSequenceEncoder : public DERGeneralEncoder { public: explicit DERSequenceEncoder(BufferedTransformation &outQueue, byte asnTag = SEQUENCE | CONSTRUCTED) : DERGeneralEncoder(outQueue, asnTag) {} explicit DERSequenceEncoder(DERSequenceEncoder &outQueue, byte asnTag = SEQUENCE | CONSTRUCTED) : DERGeneralEncoder(outQueue, asnTag) {} }; //! BER Set Decoder class CRYPTOPP_DLL BERSetDecoder : public BERGeneralDecoder { public: explicit BERSetDecoder(BufferedTransformation &inQueue, byte asnTag = SET | CONSTRUCTED) : BERGeneralDecoder(inQueue, asnTag) {} explicit BERSetDecoder(BERSetDecoder &inQueue, byte asnTag = SET | CONSTRUCTED) : BERGeneralDecoder(inQueue, asnTag) {} }; //! DER Set Encoder class CRYPTOPP_DLL DERSetEncoder : public DERGeneralEncoder { public: explicit DERSetEncoder(BufferedTransformation &outQueue, byte asnTag = SET | CONSTRUCTED) : DERGeneralEncoder(outQueue, asnTag) {} explicit DERSetEncoder(DERSetEncoder &outQueue, byte asnTag = SET | CONSTRUCTED) : DERGeneralEncoder(outQueue, asnTag) {} }; template class ASNOptional : public member_ptr { public: void BERDecode(BERSequenceDecoder &seqDecoder, byte tag, byte mask = ~CONSTRUCTED) { byte b; if (seqDecoder.Peek(b) && (b & mask) == tag) reset(new T(seqDecoder)); } void DEREncode(BufferedTransformation &out) { if (this->get() != NULL) this->get()->DEREncode(out); } }; //! _ template class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE ASN1CryptoMaterial : public ASN1Object, public BASE { public: void Save(BufferedTransformation &bt) const {BEREncode(bt);} void Load(BufferedTransformation &bt) {BERDecode(bt);} }; //! encodes/decodes subjectPublicKeyInfo class CRYPTOPP_DLL X509PublicKey : public ASN1CryptoMaterial { public: void BERDecode(BufferedTransformation &bt); void DEREncode(BufferedTransformation &bt) const; virtual OID GetAlgorithmID() const =0; virtual bool BERDecodeAlgorithmParameters(BufferedTransformation &bt) {BERDecodeNull(bt); return false;} virtual bool DEREncodeAlgorithmParameters(BufferedTransformation &bt) const {DEREncodeNull(bt); return false;} // see RFC 2459, section 7.3.1 //! decode subjectPublicKey part of subjectPublicKeyInfo, without the BIT STRING header virtual void BERDecodePublicKey(BufferedTransformation &bt, bool parametersPresent, size_t size) =0; //! encode subjectPublicKey part of subjectPublicKeyInfo, without the BIT STRING header virtual void DEREncodePublicKey(BufferedTransformation &bt) const =0; }; //! encodes/decodes privateKeyInfo class CRYPTOPP_DLL PKCS8PrivateKey : public ASN1CryptoMaterial { public: void BERDecode(BufferedTransformation &bt); void DEREncode(BufferedTransformation &bt) const; virtual OID GetAlgorithmID() const =0; virtual bool BERDecodeAlgorithmParameters(BufferedTransformation &bt) {BERDecodeNull(bt); return false;} virtual bool DEREncodeAlgorithmParameters(BufferedTransformation &bt) const {DEREncodeNull(bt); return false;} // see RFC 2459, section 7.3.1 //! decode privateKey part of privateKeyInfo, without the OCTET STRING header virtual void BERDecodePrivateKey(BufferedTransformation &bt, bool parametersPresent, size_t size) =0; //! encode privateKey part of privateKeyInfo, without the OCTET STRING header virtual void DEREncodePrivateKey(BufferedTransformation &bt) const =0; //! decode optional attributes including context-specific tag /*! /note default implementation stores attributes to be output in DEREncodeOptionalAttributes */ virtual void BERDecodeOptionalAttributes(BufferedTransformation &bt); //! encode optional attributes including context-specific tag virtual void DEREncodeOptionalAttributes(BufferedTransformation &bt) const; protected: ByteQueue m_optionalAttributes; }; // ******************************************************** //! DER Encode Unsigned /*! for INTEGER, BOOLEAN, and ENUM */ template size_t DEREncodeUnsigned(BufferedTransformation &out, T w, byte asnTag = INTEGER) { byte buf[sizeof(w)+1]; unsigned int bc; if (asnTag == BOOLEAN) { buf[sizeof(w)] = w ? 0xff : 0; bc = 1; } else { buf[0] = 0; for (unsigned int i=0; i> (sizeof(w)-1-i)*8); bc = sizeof(w); while (bc > 1 && buf[sizeof(w)+1-bc] == 0) --bc; if (buf[sizeof(w)+1-bc] & 0x80) ++bc; } out.Put(asnTag); size_t lengthBytes = DERLengthEncode(out, bc); out.Put(buf+sizeof(w)+1-bc, bc); return 1+lengthBytes+bc; } //! BER Decode Unsigned // VC60 workaround: std::numeric_limits::max conflicts with MFC max macro // CW41 workaround: std::numeric_limits::max causes a template error template void BERDecodeUnsigned(BufferedTransformation &in, T &w, byte asnTag = INTEGER, T minValue = 0, T maxValue = 0xffffffff) { byte b; if (!in.Get(b) || b != asnTag) BERDecodeError(); size_t bc; BERLengthDecode(in, bc); SecByteBlock buf(bc); if (bc != in.Get(buf, bc)) BERDecodeError(); const byte *ptr = buf; while (bc > sizeof(w) && *ptr == 0) { bc--; ptr++; } if (bc > sizeof(w)) BERDecodeError(); w = 0; for (unsigned int i=0; i maxValue) BERDecodeError(); } inline bool operator==(const ::CryptoPP::OID &lhs, const ::CryptoPP::OID &rhs) {return lhs.m_values == rhs.m_values;} inline bool operator!=(const ::CryptoPP::OID &lhs, const ::CryptoPP::OID &rhs) {return lhs.m_values != rhs.m_values;} inline bool operator<(const ::CryptoPP::OID &lhs, const ::CryptoPP::OID &rhs) {return std::lexicographical_compare(lhs.m_values.begin(), lhs.m_values.end(), rhs.m_values.begin(), rhs.m_values.end());} inline ::CryptoPP::OID operator+(const ::CryptoPP::OID &lhs, unsigned long rhs) {return ::CryptoPP::OID(lhs)+=rhs;} NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/Doxyfile0000755000000000000000000020474012414772654017313 0ustar rootroot# Doxyfile 1.7.1 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project # # All text after a hash (#) is considered a comment and will be ignored # The format is: # TAG = value [value, ...] # For lists items can also be appended using: # TAG += value [value, ...] # Values that contain spaces should be placed between quotes (" ") #--------------------------------------------------------------------------- # Project related configuration options #--------------------------------------------------------------------------- # This tag specifies the encoding used for all characters in the config file # that follow. The default is UTF-8 which is also the encoding used for all # text before the first occurrence of this tag. Doxygen uses libiconv (or the # iconv built into libc) for the transcoding. See # http://www.gnu.org/software/libiconv for the list of possible encodings. DOXYFILE_ENCODING = UTF-8 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = Crypto++ # The PROJECT_NUMBER tag can be used to enter a project or revision number. # This could be handy for archiving the generated documentation or # if some version control system is used. PROJECT_NUMBER = # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = doc # If the CREATE_SUBDIRS tag is set to YES, then doxygen will create # 4096 sub-directories (in 2 levels) under the output directory of each output # format and will distribute the generated files over these directories. # Enabling this option can be useful when feeding doxygen a huge amount of # source files, where putting all generated files in the same directory would # otherwise cause performance problems for the file system. CREATE_SUBDIRS = NO # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this # information to generate all constant output in the proper language. # The default language is English, other supported languages are: # Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional, # Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German, # Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English # messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, # Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrilic, Slovak, # Slovene, Spanish, Swedish, Ukrainian, and Vietnamese. OUTPUT_LANGUAGE = English # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will # include brief member descriptions after the members that are listed in # the file and class documentation (similar to JavaDoc). # Set to NO to disable this. BRIEF_MEMBER_DESC = YES # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend # the brief description of a member or function before the detailed description. # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the # brief descriptions will be completely suppressed. REPEAT_BRIEF = YES # This tag implements a quasi-intelligent brief description abbreviator # that is used to form the text in various listings. Each string # in this list, if found as the leading text of the brief description, will be # stripped from the text and the result after processing the whole list, is # used as the annotated text. Otherwise, the brief description is used as-is. # If left blank, the following values are used ("$name" is automatically # replaced with the name of the entity): "The $name class" "The $name widget" # "The $name file" "is" "provides" "specifies" "contains" # "represents" "a" "an" "the" ABBREVIATE_BRIEF = # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then # Doxygen will generate a detailed section even if there is only a brief # description. ALWAYS_DETAILED_SEC = NO # If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all # inherited members of a class in the documentation of that class as if those # members were ordinary class members. Constructors, destructors and assignment # operators of the base classes will not be shown. INLINE_INHERITED_MEMB = YES # If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full # path before files name in the file list and in the header files. If set # to NO the shortest path that makes the file name unique will be used. FULL_PATH_NAMES = NO # If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag # can be used to strip a user-defined part of the path. Stripping is # only done if one of the specified strings matches the left-hand part of # the path. The tag can be used to show relative paths in the file list. # If left blank the directory from which doxygen is run is used as the # path to strip. STRIP_FROM_PATH = # The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of # the path mentioned in the documentation of a class, which tells # the reader which header file to include in order to use a class. # If left blank only the name of the header file containing the class # definition is used. Otherwise one should specify the include paths that # are normally passed to the compiler using the -I flag. STRIP_FROM_INC_PATH = # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter # (but less readable) file names. This can be useful is your file systems # doesn't support long names like on DOS, Mac, or CD-ROM. SHORT_NAMES = NO # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen # will interpret the first line (until the first dot) of a JavaDoc-style # comment as the brief description. If set to NO, the JavaDoc # comments will behave just like regular Qt-style comments # (thus requiring an explicit @brief command for a brief description.) JAVADOC_AUTOBRIEF = YES # If the QT_AUTOBRIEF tag is set to YES then Doxygen will # interpret the first line (until the first dot) of a Qt-style # comment as the brief description. If set to NO, the comments # will behave just like regular Qt-style comments (thus requiring # an explicit \brief command for a brief description.) QT_AUTOBRIEF = NO # The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen # treat a multi-line C++ special comment block (i.e. a block of //! or /// # comments) as a brief description. This used to be the default behaviour. # The new default is to treat a multi-line C++ comment block as a detailed # description. Set this tag to YES if you prefer the old behaviour instead. MULTILINE_CPP_IS_BRIEF = NO # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented # member inherits the documentation from any documented member that it # re-implements. INHERIT_DOCS = YES # If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce # a new page for each member. If set to NO, the documentation of a member will # be part of the file/class/namespace that contains it. SEPARATE_MEMBER_PAGES = NO # The TAB_SIZE tag can be used to set the number of spaces in a tab. # Doxygen uses this value to replace tabs by spaces in code fragments. TAB_SIZE = 8 # This tag can be used to specify a number of aliases that acts # as commands in the documentation. An alias has the form "name=value". # For example adding "sideeffect=\par Side Effects:\n" will allow you to # put the command \sideeffect (or @sideeffect) in the documentation, which # will result in a user-defined paragraph with heading "Side Effects:". # You can put \n's in the value part of an alias to insert newlines. ALIASES = # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C # sources only. Doxygen will then generate output that is more tailored for C. # For instance, some of the names that are used will be different. The list # of all members will be omitted, etc. OPTIMIZE_OUTPUT_FOR_C = NO # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java # sources only. Doxygen will then generate output that is more tailored for # Java. For instance, namespaces will be presented as packages, qualified # scopes will look different, etc. OPTIMIZE_OUTPUT_JAVA = NO # Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran # sources only. Doxygen will then generate output that is more tailored for # Fortran. OPTIMIZE_FOR_FORTRAN = NO # Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL # sources. Doxygen will then generate output that is tailored for # VHDL. OPTIMIZE_OUTPUT_VHDL = NO # Doxygen selects the parser to use depending on the extension of the files it # parses. With this tag you can assign which parser to use for a given extension. # Doxygen has a built-in mapping, but you can override or extend it using this # tag. The format is ext=language, where ext is a file extension, and language # is one of the parsers supported by doxygen: IDL, Java, Javascript, CSharp, C, # C++, D, PHP, Objective-C, Python, Fortran, VHDL, C, C++. For instance to make # doxygen treat .inc files as Fortran files (default is PHP), and .f files as C # (default is Fortran), use: inc=Fortran f=C. Note that for custom extensions # you also need to set FILE_PATTERNS otherwise the files are not read by doxygen. EXTENSION_MAPPING = # If you use STL classes (i.e. std::string, std::vector, etc.) but do not want # to include (a tag file for) the STL sources as input, then you should # set this tag to YES in order to let doxygen match functions declarations and # definitions whose arguments contain STL classes (e.g. func(std::string); v.s. # func(std::string) {}). This also make the inheritance and collaboration # diagrams that involve STL classes more complete and accurate. BUILTIN_STL_SUPPORT = NO # If you use Microsoft's C++/CLI language, you should set this option to YES to # enable parsing support. CPP_CLI_SUPPORT = NO # Set the SIP_SUPPORT tag to YES if your project consists of sip sources only. # Doxygen will parse them like normal C++ but will assume all classes use public # instead of private inheritance when no explicit protection keyword is present. SIP_SUPPORT = NO # For Microsoft's IDL there are propget and propput attributes to indicate getter # and setter methods for a property. Setting this option to YES (the default) # will make doxygen to replace the get and set methods by a property in the # documentation. This will only work if the methods are indeed getting or # setting a simple type. If this is not the case, or you want to show the # methods anyway, you should set this option to NO. IDL_PROPERTY_SUPPORT = YES # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC # tag is set to YES, then doxygen will reuse the documentation of the first # member in the group (if any) for the other members of the group. By default # all members of a group must be documented explicitly. DISTRIBUTE_GROUP_DOC = NO # Set the SUBGROUPING tag to YES (the default) to allow class member groups of # the same type (for instance a group of public functions) to be put as a # subgroup of that type (e.g. under the Public Functions section). Set it to # NO to prevent subgrouping. Alternatively, this can be done per class using # the \nosubgrouping command. SUBGROUPING = YES # When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum # is documented as struct, union, or enum with the name of the typedef. So # typedef struct TypeS {} TypeT, will appear in the documentation as a struct # with name TypeT. When disabled the typedef will appear as a member of a file, # namespace, or class. And the struct will be named TypeS. This can typically # be useful for C code in case the coding convention dictates that all compound # types are typedef'ed and only the typedef is referenced, never the tag name. TYPEDEF_HIDES_STRUCT = NO # The SYMBOL_CACHE_SIZE determines the size of the internal cache use to # determine which symbols to keep in memory and which to flush to disk. # When the cache is full, less often used symbols will be written to disk. # For small to medium size projects (<1000 input files) the default value is # probably good enough. For larger projects a too small cache size can cause # doxygen to be busy swapping symbols to and from disk most of the time # causing a significant performance penality. # If the system has enough physical memory increasing the cache will improve the # performance by keeping more symbols in memory. Note that the value works on # a logarithmic scale so increasing the size by one will rougly double the # memory usage. The cache size is given by this formula: # 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0, # corresponding to a cache size of 2^16 = 65536 symbols SYMBOL_CACHE_SIZE = 0 #--------------------------------------------------------------------------- # Build related configuration options #--------------------------------------------------------------------------- # If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in # documentation are documented, even if no documentation was available. # Private class members and static file members will be hidden unless # the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES EXTRACT_ALL = NO # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. EXTRACT_PRIVATE = NO # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. EXTRACT_STATIC = NO # If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) # defined locally in source files will be included in the documentation. # If set to NO only classes defined in header files are included. EXTRACT_LOCAL_CLASSES = YES # This flag is only useful for Objective-C code. When set to YES local # methods, which are defined in the implementation section but not in # the interface are included in the documentation. # If set to NO (the default) only methods in the interface are included. EXTRACT_LOCAL_METHODS = NO # If this flag is set to YES, the members of anonymous namespaces will be # extracted and appear in the documentation as a namespace called # 'anonymous_namespace{file}', where file will be replaced with the base # name of the file that contains the anonymous namespace. By default # anonymous namespace are hidden. EXTRACT_ANON_NSPACES = NO # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all # undocumented members of documented classes, files or namespaces. # If set to NO (the default) these members will be included in the # various overviews, but no documentation section is generated. # This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_MEMBERS = NO # If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all # undocumented classes that are normally visible in the class hierarchy. # If set to NO (the default) these classes will be included in the various # overviews. This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_CLASSES = NO # If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all # friend (class|struct|union) declarations. # If set to NO (the default) these declarations will be included in the # documentation. HIDE_FRIEND_COMPOUNDS = NO # If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any # documentation blocks found inside the body of a function. # If set to NO (the default) these blocks will be appended to the # function's detailed documentation block. HIDE_IN_BODY_DOCS = NO # The INTERNAL_DOCS tag determines if documentation # that is typed after a \internal command is included. If the tag is set # to NO (the default) then the documentation will be excluded. # Set it to YES to include the internal documentation. INTERNAL_DOCS = NO # If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate # file names in lower-case letters. If set to YES upper-case letters are also # allowed. This is useful if you have classes or files whose names only differ # in case and if your file system supports case sensitive file names. Windows # and Mac users are advised to set this option to NO. CASE_SENSE_NAMES = NO # If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen # will show members with their full class and namespace scopes in the # documentation. If set to YES the scope will be hidden. HIDE_SCOPE_NAMES = NO # If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen # will put a list of the files that are included by a file in the documentation # of that file. SHOW_INCLUDE_FILES = YES # If the FORCE_LOCAL_INCLUDES tag is set to YES then Doxygen # will list include files with double quotes in the documentation # rather than with sharp brackets. FORCE_LOCAL_INCLUDES = NO # If the INLINE_INFO tag is set to YES (the default) then a tag [inline] # is inserted in the documentation for inline members. INLINE_INFO = YES # If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen # will sort the (detailed) documentation of file and class members # alphabetically by member name. If set to NO the members will appear in # declaration order. SORT_MEMBER_DOCS = NO # If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the # brief documentation of file, namespace and class members alphabetically # by member name. If set to NO (the default) the members will appear in # declaration order. SORT_BRIEF_DOCS = NO # If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen # will sort the (brief and detailed) documentation of class members so that # constructors and destructors are listed first. If set to NO (the default) # the constructors will appear in the respective orders defined by # SORT_MEMBER_DOCS and SORT_BRIEF_DOCS. # This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO # and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO. SORT_MEMBERS_CTORS_1ST = NO # If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the # hierarchy of group names into alphabetical order. If set to NO (the default) # the group names will appear in their defined order. SORT_GROUP_NAMES = NO # If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be # sorted by fully-qualified names, including namespaces. If set to # NO (the default), the class list will be sorted only by class name, # not including the namespace part. # Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. # Note: This option applies only to the class list, not to the # alphabetical list. SORT_BY_SCOPE_NAME = NO # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = YES # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = YES # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = YES # The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or # disable (NO) the deprecated list. This list is created by putting # \deprecated commands in the documentation. GENERATE_DEPRECATEDLIST= YES # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or define consists of for it to appear in # the documentation. If the initializer consists of more lines than specified # here it will be hidden. Use a value of 0 to hide initializers completely. # The appearance of the initializer of individual variables and defines in the # documentation can be controlled using \showinitializer or \hideinitializer # command in the documentation regardless of this setting. MAX_INITIALIZER_LINES = 30 # Set the SHOW_USED_FILES tag to NO to disable the list of files generated # at the bottom of the documentation of classes and structs. If set to YES the # list will mention the files that were used to generate the documentation. SHOW_USED_FILES = YES # If the sources in your project are distributed over multiple directories # then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy # in the documentation. The default is NO. SHOW_DIRECTORIES = NO # Set the SHOW_FILES tag to NO to disable the generation of the Files page. # This will remove the Files entry from the Quick Index and from the # Folder Tree View (if specified). The default is YES. SHOW_FILES = YES # Set the SHOW_NAMESPACES tag to NO to disable the generation of the # Namespaces page. # This will remove the Namespaces entry from the Quick Index # and from the Folder Tree View (if specified). The default is YES. SHOW_NAMESPACES = YES # The FILE_VERSION_FILTER tag can be used to specify a program or script that # doxygen should invoke to get the current version for each file (typically from # the version control system). Doxygen will invoke the program by executing (via # popen()) the command , where is the value of # the FILE_VERSION_FILTER tag, and is the name of an input file # provided by doxygen. Whatever the program writes to standard output # is used as the file version. See the manual for examples. FILE_VERSION_FILTER = # The LAYOUT_FILE tag can be used to specify a layout file which will be parsed # by doxygen. The layout file controls the global structure of the generated # output files in an output format independent way. The create the layout file # that represents doxygen's defaults, run doxygen with the -l option. # You can optionally specify a file name after the option, if omitted # DoxygenLayout.xml will be used as the name of the layout file. LAYOUT_FILE = #--------------------------------------------------------------------------- # configuration options related to warning and progress messages #--------------------------------------------------------------------------- # The QUIET tag can be used to turn on/off the messages that are generated # by doxygen. Possible values are YES and NO. If left blank NO is used. QUIET = NO # The WARNINGS tag can be used to turn on/off the warning messages that are # generated by doxygen. Possible values are YES and NO. If left blank # NO is used. WARNINGS = NO # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings # for undocumented members. If EXTRACT_ALL is set to YES then this flag will # automatically be disabled. WARN_IF_UNDOCUMENTED = NO # If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for # potential errors in the documentation, such as not documenting some # parameters in a documented function, or documenting parameters that # don't exist or using markup commands wrongly. WARN_IF_DOC_ERROR = YES # This WARN_NO_PARAMDOC option can be abled to get warnings for # functions that are documented, but have no documentation for their parameters # or return value. If set to NO (the default) doxygen will only warn about # wrong or incomplete parameter documentation, but not about the absence of # documentation. WARN_NO_PARAMDOC = NO # The WARN_FORMAT tag determines the format of the warning messages that # doxygen can produce. The string should contain the $file, $line, and $text # tags, which will be replaced by the file and line number from which the # warning originated and the warning text. Optionally the format may contain # $version, which will be replaced by the version of the file (if it could # be obtained via FILE_VERSION_FILTER) WARN_FORMAT = "$file:$line: $text" # The WARN_LOGFILE tag can be used to specify a file to which warning # and error messages should be written. If left blank the output is written # to stderr. WARN_LOGFILE = #--------------------------------------------------------------------------- # configuration options related to the input files #--------------------------------------------------------------------------- # The INPUT tag can be used to specify the files and/or directories that contain # documented source files. You may enter file names like "myfile.cpp" or # directories like "/usr/src/myproject". Separate the files or directories # with spaces. INPUT = . # This tag can be used to specify the character encoding of the source files # that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is # also the default input encoding. Doxygen uses libiconv (or the iconv built # into libc) for the transcoding. See http://www.gnu.org/software/libiconv for # the list of possible encodings. INPUT_ENCODING = UTF-8 # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank the following patterns are tested: # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx # *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90 FILE_PATTERNS = *.h \ *.cpp # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = NO # The EXCLUDE tag can be used to specify files and/or directories that should # excluded from the INPUT source files. This way you can easily exclude a # subdirectory from a directory tree whose root is specified with the INPUT tag. EXCLUDE = adhoc.cpp # The EXCLUDE_SYMLINKS tag can be used select whether or not files or # directories that are symbolic links (a Unix filesystem feature) are excluded # from the input. EXCLUDE_SYMLINKS = NO # If the value of the INPUT tag contains directories, you can use the # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude # certain files from those directories. Note that the wildcards are matched # against the file with absolute path, so to exclude all test directories # for example use the pattern */test/* EXCLUDE_PATTERNS = # The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names # (namespaces, classes, functions, etc.) that should be excluded from the # output. The symbol name can be a fully qualified name, a word, or if the # wildcard * is used, a substring. Examples: ANamespace, AClass, # AClass::ANamespace, ANamespace::*Test EXCLUDE_SYMBOLS = # The EXAMPLE_PATH tag can be used to specify one or more files or # directories that contain example code fragments that are included (see # the \include command). EXAMPLE_PATH = . # If the value of the EXAMPLE_PATH tag contains directories, you can use the # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank all files are included. EXAMPLE_PATTERNS = # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be # searched for input files to be used with the \include or \dontinclude # commands irrespective of the value of the RECURSIVE tag. # Possible values are YES and NO. If left blank NO is used. EXAMPLE_RECURSIVE = NO # The IMAGE_PATH tag can be used to specify one or more files or # directories that contain image that are included in the documentation (see # the \image command). IMAGE_PATH = # The INPUT_FILTER tag can be used to specify a program that doxygen should # invoke to filter for each input file. Doxygen will invoke the filter program # by executing (via popen()) the command , where # is the value of the INPUT_FILTER tag, and is the name of an # input file. Doxygen will then use the output that the filter program writes # to standard output. # If FILTER_PATTERNS is specified, this tag will be # ignored. INPUT_FILTER = # The FILTER_PATTERNS tag can be used to specify filters on a per file pattern # basis. # Doxygen will compare the file name with each pattern and apply the # filter if there is a match. # The filters are a list of the form: # pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further # info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER # is applied to all files. FILTER_PATTERNS = # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using # INPUT_FILTER) will be used to filter the input files when producing source # files to browse (i.e. when SOURCE_BROWSER is set to YES). FILTER_SOURCE_FILES = NO #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. # Note: To get rid of all source code in the generated output, make sure also # VERBATIM_HEADERS is set to NO. SOURCE_BROWSER = YES # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct # doxygen to hide any special comment blocks from generated source code # fragments. Normal C and C++ comments will always remain visible. STRIP_CODE_COMMENTS = NO # If the REFERENCED_BY_RELATION tag is set to YES # then for each documented function all documented # functions referencing it will be listed. REFERENCED_BY_RELATION = YES # If the REFERENCES_RELATION tag is set to YES # then for each documented function all documented entities # called/used by that function will be listed. REFERENCES_RELATION = YES # If the REFERENCES_LINK_SOURCE tag is set to YES (the default) # and SOURCE_BROWSER tag is set to YES, then the hyperlinks from # functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will # link to the source code. # Otherwise they will link to the documentation. REFERENCES_LINK_SOURCE = YES # If the USE_HTAGS tag is set to YES then the references to source code # will point to the HTML generated by the htags(1) tool instead of doxygen # built-in source browser. The htags tool is part of GNU's global source # tagging system (see http://www.gnu.org/software/global/global.html). You # will need version 4.8.6 or higher. USE_HTAGS = NO # If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen # will generate a verbatim copy of the header file for each class for # which an include is specified. Set to NO to disable this. VERBATIM_HEADERS = YES #--------------------------------------------------------------------------- # configuration options related to the alphabetical class index #--------------------------------------------------------------------------- # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index # of all compounds will be generated. Enable this if the project # contains a lot of classes, structs, unions or interfaces. ALPHABETICAL_INDEX = YES # If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns # in which this list will be split (can be a number in the range [1..20]) COLS_IN_ALPHA_INDEX = 3 # In case all classes in a project start with a common prefix, all # classes will be put under the same header in the alphabetical index. # The IGNORE_PREFIX tag can be used to specify one or more prefixes that # should be ignored while generating the index headers. IGNORE_PREFIX = #--------------------------------------------------------------------------- # configuration options related to the HTML output #--------------------------------------------------------------------------- # If the GENERATE_HTML tag is set to YES (the default) Doxygen will # generate HTML output. GENERATE_HTML = YES # The HTML_OUTPUT tag is used to specify where the HTML docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `html' will be used as the default path. HTML_OUTPUT = # The HTML_FILE_EXTENSION tag can be used to specify the file extension for # each generated HTML page (for example: .htm,.php,.asp). If it is left blank # doxygen will generate files with .html extension. HTML_FILE_EXTENSION = .html # The HTML_HEADER tag can be used to specify a personal HTML header for # each generated HTML page. If it is left blank doxygen will generate a # standard header. HTML_HEADER = # The HTML_FOOTER tag can be used to specify a personal HTML footer for # each generated HTML page. If it is left blank doxygen will generate a # standard footer. HTML_FOOTER = # The HTML_STYLESHEET tag can be used to specify a user-defined cascading # style sheet that is used by each HTML page. It can be used to # fine-tune the look of the HTML output. If the tag is left blank doxygen # will generate a default style sheet. Note that doxygen will try to copy # the style sheet file to the HTML output directory, so don't put your own # stylesheet in the HTML output directory as well, or it will be erased! HTML_STYLESHEET = # The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. # Doxygen will adjust the colors in the stylesheet and background images # according to this color. Hue is specified as an angle on a colorwheel, # see http://en.wikipedia.org/wiki/Hue for more information. # For instance the value 0 represents red, 60 is yellow, 120 is green, # 180 is cyan, 240 is blue, 300 purple, and 360 is red again. # The allowed range is 0 to 359. HTML_COLORSTYLE_HUE = 220 # The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of # the colors in the HTML output. For a value of 0 the output will use # grayscales only. A value of 255 will produce the most vivid colors. HTML_COLORSTYLE_SAT = 100 # The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to # the luminance component of the colors in the HTML output. Values below # 100 gradually make the output lighter, whereas values above 100 make # the output darker. The value divided by 100 is the actual gamma applied, # so 80 represents a gamma of 0.8, The value 220 represents a gamma of 2.2, # and 100 does not change the gamma. HTML_COLORSTYLE_GAMMA = 80 # If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML # page will contain the date and time when the page was generated. Setting # this to NO can help when comparing the output of multiple runs. HTML_TIMESTAMP = YES # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, # files or namespaces will be aligned in HTML using tables. If set to # NO a bullet list will be used. HTML_ALIGN_MEMBERS = YES # If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML # documentation will contain sections that can be hidden and shown after the # page has loaded. For this to work a browser that supports # JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox # Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari). HTML_DYNAMIC_SECTIONS = NO # If the GENERATE_DOCSET tag is set to YES, additional index files # will be generated that can be used as input for Apple's Xcode 3 # integrated development environment, introduced with OSX 10.5 (Leopard). # To create a documentation set, doxygen will generate a Makefile in the # HTML output directory. Running make will produce the docset in that # directory and running "make install" will install the docset in # ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find # it at startup. # See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html # for more information. GENERATE_DOCSET = NO # When GENERATE_DOCSET tag is set to YES, this tag determines the name of the # feed. A documentation feed provides an umbrella under which multiple # documentation sets from a single provider (such as a company or product suite) # can be grouped. DOCSET_FEEDNAME = "Doxygen generated docs" # When GENERATE_DOCSET tag is set to YES, this tag specifies a string that # should uniquely identify the documentation set bundle. This should be a # reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen # will append .docset to the name. DOCSET_BUNDLE_ID = org.doxygen.Project # When GENERATE_PUBLISHER_ID tag specifies a string that should uniquely identify # the documentation publisher. This should be a reverse domain-name style # string, e.g. com.mycompany.MyDocSet.documentation. DOCSET_PUBLISHER_ID = org.doxygen.Publisher # The GENERATE_PUBLISHER_NAME tag identifies the documentation publisher. DOCSET_PUBLISHER_NAME = Publisher # If the GENERATE_HTMLHELP tag is set to YES, additional index files # will be generated that can be used as input for tools like the # Microsoft HTML help workshop to generate a compiled HTML help file (.chm) # of the generated HTML documentation. GENERATE_HTMLHELP = YES # If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can # be used to specify the file name of the resulting .chm file. You # can add a path in front of the file if the result should not be # written to the html output directory. CHM_FILE = # If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can # be used to specify the location (absolute path including file name) of # the HTML help compiler (hhc.exe). If non-empty doxygen will try to run # the HTML help compiler on the generated index.hhp. HHC_LOCATION = # If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag # controls if a separate .chi index file is generated (YES) or that # it should be included in the master .chm file (NO). GENERATE_CHI = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING # is used to encode HtmlHelp index (hhk), content (hhc) and project file # content. CHM_INDEX_ENCODING = # If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag # controls whether a binary table of contents is generated (YES) or a # normal table of contents (NO) in the .chm file. BINARY_TOC = NO # The TOC_EXPAND flag can be set to YES to add extra items for group members # to the contents of the HTML help documentation and to the tree view. TOC_EXPAND = NO # If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and # QHP_VIRTUAL_FOLDER are set, an additional index file will be generated # that can be used as input for Qt's qhelpgenerator to generate a # Qt Compressed Help (.qch) of the generated HTML documentation. GENERATE_QHP = NO # If the QHG_LOCATION tag is specified, the QCH_FILE tag can # be used to specify the file name of the resulting .qch file. # The path specified is relative to the HTML output folder. QCH_FILE = # The QHP_NAMESPACE tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#namespace QHP_NAMESPACE = org.doxygen.Project # The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#virtual-folders QHP_VIRTUAL_FOLDER = doc # If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to # add. For more information please see # http://doc.trolltech.com/qthelpproject.html#custom-filters QHP_CUST_FILTER_NAME = # The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the # custom filter to add. For more information please see # # Qt Help Project / Custom Filters. QHP_CUST_FILTER_ATTRS = # The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this # project's # filter section matches. # # Qt Help Project / Filter Attributes. QHP_SECT_FILTER_ATTRS = # If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can # be used to specify the location of Qt's qhelpgenerator. # If non-empty doxygen will try to run qhelpgenerator on the generated # .qhp file. QHG_LOCATION = # If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files # will be generated, which together with the HTML files, form an Eclipse help # plugin. To install this plugin and make it available under the help contents # menu in Eclipse, the contents of the directory containing the HTML and XML # files needs to be copied into the plugins directory of eclipse. The name of # the directory within the plugins directory should be the same as # the ECLIPSE_DOC_ID value. After copying Eclipse needs to be restarted before # the help appears. GENERATE_ECLIPSEHELP = NO # A unique identifier for the eclipse help plugin. When installing the plugin # the directory name containing the HTML and XML files should also have # this name. ECLIPSE_DOC_ID = org.doxygen.Project # The DISABLE_INDEX tag can be used to turn on/off the condensed index at # top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. DISABLE_INDEX = NO # This tag can be used to set the number of enum values (range [1..20]) # that doxygen will group on one line in the generated HTML documentation. ENUM_VALUES_PER_LINE = 4 # The GENERATE_TREEVIEW tag is used to specify whether a tree-like index # structure should be generated to display hierarchical information. # If the tag value is set to YES, a side panel will be generated # containing a tree-like index structure (just like the one that # is generated for HTML Help). For this to work a browser that supports # JavaScript, DHTML, CSS and frames is required (i.e. any modern browser). # Windows users are probably better off using the HTML help feature. GENERATE_TREEVIEW = NO # By enabling USE_INLINE_TREES, doxygen will generate the Groups, Directories, # and Class Hierarchy pages using a tree view instead of an ordered list. USE_INLINE_TREES = NO # If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be # used to set the initial width (in pixels) of the frame in which the tree # is shown. TREEVIEW_WIDTH = 250 # When the EXT_LINKS_IN_WINDOW option is set to YES doxygen will open # links to external symbols imported via tag files in a separate window. EXT_LINKS_IN_WINDOW = NO # Use this tag to change the font size of Latex formulas included # as images in the HTML documentation. The default is 10. Note that # when you change the font size after a successful doxygen run you need # to manually remove any form_*.png images from the HTML output directory # to force them to be regenerated. FORMULA_FONTSIZE = 10 # Use the FORMULA_TRANPARENT tag to determine whether or not the images # generated for formulas are transparent PNGs. Transparent PNGs are # not supported properly for IE 6.0, but are supported on all modern browsers. # Note that when changing this option you need to delete any form_*.png files # in the HTML output before the changes have effect. FORMULA_TRANSPARENT = YES # When the SEARCHENGINE tag is enabled doxygen will generate a search box # for the HTML output. The underlying search engine uses javascript # and DHTML and should work on any modern browser. Note that when using # HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets # (GENERATE_DOCSET) there is already a search function so this one should # typically be disabled. For large projects the javascript based search engine # can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution. SEARCHENGINE = NO # When the SERVER_BASED_SEARCH tag is enabled the search engine will be # implemented using a PHP enabled web server instead of at the web client # using Javascript. Doxygen will generate the search PHP script and index # file to put on the web server. The advantage of the server # based approach is that it scales better to large projects and allows # full text search. The disadvances is that it is more difficult to setup # and does not have live searching capabilities. SERVER_BASED_SEARCH = NO #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = NO # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be # invoked. If left blank `latex' will be used as the default command name. # Note that when enabling USE_PDFLATEX this option is only used for # generating bitmaps for formulas in the HTML output, but not in the # Makefile that is written to the output directory. LATEX_CMD_NAME = latex # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to # generate index for LaTeX. If left blank `makeindex' will be used as the # default command name. MAKEINDEX_CMD_NAME = makeindex # If the COMPACT_LATEX tag is set to YES Doxygen generates more compact # LaTeX documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_LATEX = NO # The PAPER_TYPE tag can be used to set the paper type that is used # by the printer. Possible values are: a4, a4wide, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4 # The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX # packages that should be included in the LaTeX output. EXTRA_PACKAGES = # The LATEX_HEADER tag can be used to specify a personal LaTeX header for # the generated latex document. The header should contain everything until # the first chapter. If it is left blank doxygen will generate a # standard header. Notice: only use this tag if you know what you are doing! LATEX_HEADER = # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated # is prepared for conversion to pdf (using ps2pdf). The pdf file will # contain links (just like the HTML output) instead of page references # This makes the output suitable for online browsing using a pdf viewer. PDF_HYPERLINKS = NO # If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of # plain latex in the generated Makefile. Set this option to YES to get a # higher quality PDF documentation. USE_PDFLATEX = NO # If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. # command to the generated LaTeX files. This will instruct LaTeX to keep # running if errors occur, instead of asking the user for help. # This option is also used when generating formulas in HTML. LATEX_BATCHMODE = NO # If LATEX_HIDE_INDICES is set to YES then doxygen will not # include the index chapters (such as File Index, Compound Index, etc.) # in the output. LATEX_HIDE_INDICES = NO # If LATEX_SOURCE_CODE is set to YES then doxygen will include # source code with syntax highlighting in the LaTeX output. # Note that which sources are shown also depends on other settings # such as SOURCE_BROWSER. LATEX_SOURCE_CODE = NO #--------------------------------------------------------------------------- # configuration options related to the RTF output #--------------------------------------------------------------------------- # If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output # The RTF output is optimized for Word 97 and may not look very pretty with # other RTF readers or editors. GENERATE_RTF = NO # The RTF_OUTPUT tag is used to specify where the RTF docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `rtf' will be used as the default path. RTF_OUTPUT = rtf # If the COMPACT_RTF tag is set to YES Doxygen generates more compact # RTF documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_RTF = NO # If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated # will contain hyperlink fields. The RTF file will # contain links (just like the HTML output) instead of page references. # This makes the output suitable for online browsing using WORD or other # programs which support those fields. # Note: wordpad (write) and others do not support links. RTF_HYPERLINKS = NO # Load stylesheet definitions from file. Syntax is similar to doxygen's # config file, i.e. a series of assignments. You only have to provide # replacements, missing definitions are set to their default value. RTF_STYLESHEET_FILE = # Set optional variables used in the generation of an rtf document. # Syntax is similar to doxygen's config file. RTF_EXTENSIONS_FILE = #--------------------------------------------------------------------------- # configuration options related to the man page output #--------------------------------------------------------------------------- # If the GENERATE_MAN tag is set to YES (the default) Doxygen will # generate man pages GENERATE_MAN = NO # The MAN_OUTPUT tag is used to specify where the man pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `man' will be used as the default path. MAN_OUTPUT = # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = .3 # If the MAN_LINKS tag is set to YES and Doxygen generates man output, # then it will generate one additional man file for each entity # documented in the real man page(s). These additional files # only source the real man page, but without them the man command # would be unable to find the correct page. The default is NO. MAN_LINKS = NO #--------------------------------------------------------------------------- # configuration options related to the XML output #--------------------------------------------------------------------------- # If the GENERATE_XML tag is set to YES Doxygen will # generate an XML file that captures the structure of # the code including all documentation. GENERATE_XML = NO # The XML_OUTPUT tag is used to specify where the XML pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `xml' will be used as the default path. XML_OUTPUT = xml # The XML_SCHEMA tag can be used to specify an XML schema, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_SCHEMA = # The XML_DTD tag can be used to specify an XML DTD, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_DTD = # If the XML_PROGRAMLISTING tag is set to YES Doxygen will # dump the program listings (including syntax highlighting # and cross-referencing information) to the XML output. Note that # enabling this will significantly increase the size of the XML output. XML_PROGRAMLISTING = YES #--------------------------------------------------------------------------- # configuration options for the AutoGen Definitions output #--------------------------------------------------------------------------- # If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will # generate an AutoGen Definitions (see autogen.sf.net) file # that captures the structure of the code including all # documentation. Note that this feature is still experimental # and incomplete at the moment. GENERATE_AUTOGEN_DEF = NO #--------------------------------------------------------------------------- # configuration options related to the Perl module output #--------------------------------------------------------------------------- # If the GENERATE_PERLMOD tag is set to YES Doxygen will # generate a Perl module file that captures the structure of # the code including all documentation. Note that this # feature is still experimental and incomplete at the # moment. GENERATE_PERLMOD = NO # If the PERLMOD_LATEX tag is set to YES Doxygen will generate # the necessary Makefile rules, Perl scripts and LaTeX code to be able # to generate PDF and DVI output from the Perl module output. PERLMOD_LATEX = NO # If the PERLMOD_PRETTY tag is set to YES the Perl module output will be # nicely formatted so it can be parsed by a human reader. # This is useful # if you want to understand what is going on. # On the other hand, if this # tag is set to NO the size of the Perl module output will be much smaller # and Perl will parse it just the same. PERLMOD_PRETTY = YES # The names of the make variables in the generated doxyrules.make file # are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. # This is useful so different doxyrules.make files included by the same # Makefile don't overwrite each other's variables. PERLMOD_MAKEVAR_PREFIX = #--------------------------------------------------------------------------- # Configuration options related to the preprocessor #--------------------------------------------------------------------------- # If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will # evaluate all C-preprocessor directives found in the sources and include # files. ENABLE_PREPROCESSING = YES # If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro # names in the source code. If set to NO (the default) only conditional # compilation will be performed. Macro expansion can be done in a controlled # way by setting EXPAND_ONLY_PREDEF to YES. MACRO_EXPANSION = YES # If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES # then the macro expansion is limited to the macros specified with the # PREDEFINED and EXPAND_AS_DEFINED tags. EXPAND_ONLY_PREDEF = NO # If the SEARCH_INCLUDES tag is set to YES (the default) the includes files # in the INCLUDE_PATH (see below) will be search if a #include is found. SEARCH_INCLUDES = YES # The INCLUDE_PATH tag can be used to specify one or more directories that # contain include files that are not input files but should be processed by # the preprocessor. INCLUDE_PATH = . # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard # patterns (like *.h and *.hpp) to filter out the header-files in the # directories. If left blank, the patterns specified with FILE_PATTERNS will # be used. INCLUDE_FILE_PATTERNS = # The PREDEFINED tag can be used to specify one or more macro names that # are defined before the preprocessor is started (similar to the -D option of # gcc). The argument of the tag is a list of macros of the form: name # or name=definition (no spaces). If the definition and the = are # omitted =1 is assumed. To prevent a macro definition from being # undefined via #undef or recursively expanded use the := operator # instead of the = operator. PREDEFINED = _WIN32 \ _WINDOWS \ __FreeBSD__ \ CRYPTOPP_DOXYGEN_PROCESSING # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then # this tag can be used to specify a list of macro names that should be expanded. # The macro definition that is found in the sources will be used. # Use the PREDEFINED tag if you want to use a different macro definition. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all function-like macros that are alone # on a line, have an all uppercase name, and do not end with a semicolon. Such # function macros are typically used for boiler-plate code, and will confuse # the parser if not removed. SKIP_FUNCTION_MACROS = YES #--------------------------------------------------------------------------- # Configuration::additions related to external references #--------------------------------------------------------------------------- # The TAGFILES option can be used to specify one or more tagfiles. # Optionally an initial location of the external documentation # can be added for each tagfile. The format of a tag file without # this location is as follows: # # TAGFILES = file1 file2 ... # Adding location for the tag files is done as follows: # # TAGFILES = file1=loc1 "file2 = loc2" ... # where "loc1" and "loc2" can be relative or absolute paths or # URLs. If a location is present for each tag, the installdox tool # does not have to be run to correct the links. # Note that each tag file must have a unique name # (where the name does NOT include the path) # If a tag file is not located in the directory in which doxygen # is run, you must also specify the path to the tagfile here. TAGFILES = # When a file name is specified after GENERATE_TAGFILE, doxygen will create # a tag file that is based on the input files it reads. GENERATE_TAGFILE = # If the ALLEXTERNALS tag is set to YES all external classes will be listed # in the class index. If set to NO only the inherited external classes # will be listed. ALLEXTERNALS = NO # If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed # in the modules index. If set to NO, only the current project's groups will # be listed. EXTERNAL_GROUPS = YES # The PERL_PATH should be the absolute path and name of the perl script # interpreter (i.e. the result of `which perl'). PERL_PATH = /usr/bin/perl #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- # If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will # generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base # or super classes. Setting the tag to NO turns the diagrams off. Note that # this option is superseded by the HAVE_DOT option below. This is only a # fallback. It is recommended to install and use dot, since it yields more # powerful graphs. CLASS_DIAGRAMS = YES # You can define message sequence charts within doxygen comments using the \msc # command. Doxygen will then run the mscgen tool (see # http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the # documentation. The MSCGEN_PATH tag allows you to specify the directory where # the mscgen tool resides. If left empty the tool is assumed to be found in the # default search path. MSCGEN_PATH = # If set to YES, the inheritance and collaboration graphs will hide # inheritance and usage relations if the target is undocumented # or is not a class. HIDE_UNDOC_RELATIONS = YES # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is # available from the path. This tool is part of Graphviz, a graph visualization # toolkit from AT&T and Lucent Bell Labs. The other options in this section # have no effect if this option is set to NO (the default) HAVE_DOT = NO # The DOT_NUM_THREADS specifies the number of dot invocations doxygen is # allowed to run in parallel. When set to 0 (the default) doxygen will # base this on the number of processors available in the system. You can set it # explicitly to a value larger than 0 to get control over the balance # between CPU load and processing speed. DOT_NUM_THREADS = 0 # By default doxygen will write a font called FreeSans.ttf to the output # directory and reference it in all dot files that doxygen generates. This # font does not include all possible unicode characters however, so when you need # these (or just want a differently looking font) you can specify the font name # using DOT_FONTNAME. You need need to make sure dot is able to find the font, # which can be done by putting it in a standard location or by setting the # DOTFONTPATH environment variable or by setting DOT_FONTPATH to the directory # containing the font. DOT_FONTNAME = FreeSans.ttf # The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs. # The default size is 10pt. DOT_FONTSIZE = 10 # By default doxygen will tell dot to use the output directory to look for the # FreeSans.ttf font (which doxygen will put there itself). If you specify a # different font using DOT_FONTNAME you can set the path where dot # can find it using this tag. DOT_FONTPATH = # If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect inheritance relations. Setting this tag to YES will force the # the CLASS_DIAGRAMS tag to NO. CLASS_GRAPH = YES # If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect implementation dependencies (inheritance, containment, and # class references variables) of the class with other documented classes. COLLABORATION_GRAPH = YES # If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen # will generate a graph for groups, showing the direct groups dependencies GROUP_GRAPHS = YES # If the UML_LOOK tag is set to YES doxygen will generate inheritance and # collaboration diagrams in a style similar to the OMG's Unified Modeling # Language. UML_LOOK = NO # If set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT # tags are set to YES then doxygen will generate a graph for each documented # file showing the direct and indirect include dependencies of the file with # other documented files. INCLUDE_GRAPH = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and # HAVE_DOT tags are set to YES then doxygen will generate a graph for each # documented header file showing the documented files that directly or # indirectly include this file. INCLUDED_BY_GRAPH = YES # If the CALL_GRAPH and HAVE_DOT options are set to YES then # doxygen will generate a call dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable call graphs # for selected functions only using the \callgraph command. CALL_GRAPH = NO # If the CALLER_GRAPH and HAVE_DOT tags are set to YES then # doxygen will generate a caller dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable caller # graphs for selected functions only using the \callergraph command. CALLER_GRAPH = NO # If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen # will graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES # then doxygen will show the dependencies a directory has on other directories # in a graphical way. The dependency relations are determined by the #include # relations between the files in the directories. DIRECTORY_GRAPH = YES # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images # generated by dot. Possible values are png, jpg, or gif # If left blank png will be used. DOT_IMAGE_FORMAT = png # The tag DOT_PATH can be used to specify the path where the dot tool can be # found. If left blank, it is assumed the dot tool can be found in the path. DOT_PATH = # The DOTFILE_DIRS tag can be used to specify one or more directories that # contain dot files that are included in the documentation (see the # \dotfile command). DOTFILE_DIRS = # The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of # nodes that will be shown in the graph. If the number of nodes in a graph # becomes larger than this value, doxygen will truncate the graph, which is # visualized by representing a node as a red box. Note that doxygen if the # number of direct children of the root node in a graph is already larger than # DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note # that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH. DOT_GRAPH_MAX_NODES = 50 # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the # graphs generated by dot. A depth value of 3 means that only nodes reachable # from the root by following a path via at most 3 edges will be shown. Nodes # that lay further from the root node will be omitted. Note that setting this # option to 1 or 2 may greatly reduce the computation time needed for large # code bases. Also note that the size of a graph can be further restricted by # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction. MAX_DOT_GRAPH_DEPTH = 0 # Set the DOT_TRANSPARENT tag to YES to generate images with a transparent # background. This is disabled by default, because dot on Windows does not # seem to support this out of the box. Warning: Depending on the platform used, # enabling this option may lead to badly anti-aliased labels on the edges of # a graph (i.e. they become hard to read). DOT_TRANSPARENT = NO # Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output # files in one run (i.e. multiple -o and -T options on the command line). This # makes dot run faster, but since only newer versions of dot (>1.8.10) # support this, this feature is disabled by default. DOT_MULTI_TARGETS = NO # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermediate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES armory-0.92.3/cppForSwig/cryptopp/ccm.h0000755000000000000000000000632712414772654016521 0ustar rootroot#ifndef CRYPTOPP_CCM_H #define CRYPTOPP_CCM_H #include "authenc.h" #include "modes.h" NAMESPACE_BEGIN(CryptoPP) //! . class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CCM_Base : public AuthenticatedSymmetricCipherBase { public: CCM_Base() : m_digestSize(0), m_L(0) {} // AuthenticatedSymmetricCipher std::string AlgorithmName() const {return GetBlockCipher().AlgorithmName() + std::string("/CCM");} size_t MinKeyLength() const {return GetBlockCipher().MinKeyLength();} size_t MaxKeyLength() const {return GetBlockCipher().MaxKeyLength();} size_t DefaultKeyLength() const {return GetBlockCipher().DefaultKeyLength();} size_t GetValidKeyLength(size_t n) const {return GetBlockCipher().GetValidKeyLength(n);} bool IsValidKeyLength(size_t n) const {return GetBlockCipher().IsValidKeyLength(n);} unsigned int OptimalDataAlignment() const {return GetBlockCipher().OptimalDataAlignment();} IV_Requirement IVRequirement() const {return UNIQUE_IV;} unsigned int IVSize() const {return 8;} unsigned int MinIVLength() const {return 7;} unsigned int MaxIVLength() const {return 13;} unsigned int DigestSize() const {return m_digestSize;} lword MaxHeaderLength() const {return W64LIT(0)-1;} lword MaxMessageLength() const {return m_L<8 ? (W64LIT(1)<<(8*m_L))-1 : W64LIT(0)-1;} bool NeedsPrespecifiedDataLengths() const {return true;} void UncheckedSpecifyDataLengths(lword headerLength, lword messageLength, lword footerLength); protected: // AuthenticatedSymmetricCipherBase bool AuthenticationIsOnPlaintext() const {return true;} unsigned int AuthenticationBlockSize() const {return GetBlockCipher().BlockSize();} void SetKeyWithoutResync(const byte *userKey, size_t keylength, const NameValuePairs ¶ms); void Resync(const byte *iv, size_t len); size_t AuthenticateBlocks(const byte *data, size_t len); void AuthenticateLastHeaderBlock(); void AuthenticateLastConfidentialBlock(); void AuthenticateLastFooterBlock(byte *mac, size_t macSize); SymmetricCipher & AccessSymmetricCipher() {return m_ctr;} virtual BlockCipher & AccessBlockCipher() =0; virtual int DefaultDigestSize() const =0; const BlockCipher & GetBlockCipher() const {return const_cast(this)->AccessBlockCipher();}; byte *CBC_Buffer() {return m_buffer+REQUIRED_BLOCKSIZE;} enum {REQUIRED_BLOCKSIZE = 16}; int m_digestSize, m_L; word64 m_messageLength, m_aadLength; CTR_Mode_ExternalCipher::Encryption m_ctr; }; //! . template class CCM_Final : public CCM_Base { public: static std::string StaticAlgorithmName() {return T_BlockCipher::StaticAlgorithmName() + std::string("/CCM");} bool IsForwardTransformation() const {return T_IsEncryption;} private: BlockCipher & AccessBlockCipher() {return m_cipher;} int DefaultDigestSize() const {return T_DefaultDigestSize;} typename T_BlockCipher::Encryption m_cipher; }; /// CCM template struct CCM : public AuthenticatedSymmetricCipherDocumentation { typedef CCM_Final Encryption; typedef CCM_Final Decryption; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/hex.h0000755000000000000000000000213312414772654016532 0ustar rootroot#ifndef CRYPTOPP_HEX_H #define CRYPTOPP_HEX_H #include "basecode.h" NAMESPACE_BEGIN(CryptoPP) //! Converts given data to base 16 class CRYPTOPP_DLL HexEncoder : public SimpleProxyFilter { public: HexEncoder(BufferedTransformation *attachment = NULL, bool uppercase = true, int outputGroupSize = 0, const std::string &separator = ":", const std::string &terminator = "") : SimpleProxyFilter(new BaseN_Encoder(new Grouper), attachment) { IsolatedInitialize(MakeParameters(Name::Uppercase(), uppercase)(Name::GroupSize(), outputGroupSize)(Name::Separator(), ConstByteArrayParameter(separator))(Name::Terminator(), ConstByteArrayParameter(terminator))); } void IsolatedInitialize(const NameValuePairs ¶meters); }; //! Decode base 16 data back to bytes class CRYPTOPP_DLL HexDecoder : public BaseN_Decoder { public: HexDecoder(BufferedTransformation *attachment = NULL) : BaseN_Decoder(GetDefaultDecodingLookupArray(), 4, attachment) {} void IsolatedInitialize(const NameValuePairs ¶meters); private: static const int * CRYPTOPP_API GetDefaultDecodingLookupArray(); }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/zlib.cpp0000755000000000000000000000454612414772654017253 0ustar rootroot// zlib.cpp - written and placed in the public domain by Wei Dai // "zlib" is the name of a well known C language compression library // (http://www.zlib.org) and also the name of a compression format // (RFC 1950) that the library implements. This file is part of a // complete reimplementation of the zlib compression format. #include "pch.h" #include "zlib.h" #include "zdeflate.h" #include "zinflate.h" NAMESPACE_BEGIN(CryptoPP) static const byte DEFLATE_METHOD = 8; static const byte FDICT_FLAG = 1 << 5; // ************************************************************* void ZlibCompressor::WritePrestreamHeader() { m_adler32.Restart(); byte cmf = DEFLATE_METHOD | ((GetLog2WindowSize()-8) << 4); byte flags = GetCompressionLevel() << 6; AttachedTransformation()->PutWord16(RoundUpToMultipleOf(cmf*256+flags, 31)); } void ZlibCompressor::ProcessUncompressedData(const byte *inString, size_t length) { m_adler32.Update(inString, length); } void ZlibCompressor::WritePoststreamTail() { FixedSizeSecBlock adler32; m_adler32.Final(adler32); AttachedTransformation()->Put(adler32, 4); } unsigned int ZlibCompressor::GetCompressionLevel() const { static const unsigned int deflateToCompressionLevel[] = {0, 1, 1, 1, 2, 2, 2, 2, 2, 3}; return deflateToCompressionLevel[GetDeflateLevel()]; } // ************************************************************* ZlibDecompressor::ZlibDecompressor(BufferedTransformation *attachment, bool repeat, int propagation) : Inflator(attachment, repeat, propagation) { } void ZlibDecompressor::ProcessPrestreamHeader() { m_adler32.Restart(); byte cmf; byte flags; if (!m_inQueue.Get(cmf) || !m_inQueue.Get(flags)) throw HeaderErr(); if ((cmf*256+flags) % 31 != 0) throw HeaderErr(); // if you hit this exception, you're probably trying to decompress invalid data if ((cmf & 0xf) != DEFLATE_METHOD) throw UnsupportedAlgorithm(); if (flags & FDICT_FLAG) throw UnsupportedPresetDictionary(); m_log2WindowSize = 8 + (cmf >> 4); } void ZlibDecompressor::ProcessDecompressedData(const byte *inString, size_t length) { AttachedTransformation()->Put(inString, length); m_adler32.Update(inString, length); } void ZlibDecompressor::ProcessPoststreamTail() { FixedSizeSecBlock adler32; if (m_inQueue.Get(adler32, 4) != 4) throw Adler32Err(); if (!m_adler32.Verify(adler32)) throw Adler32Err(); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/validat2.cpp0000755000000000000000000005722212414772654020020 0ustar rootroot// validat2.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1 #include "blumshub.h" #include "rsa.h" #include "md2.h" #include "elgamal.h" #include "nr.h" #include "dsa.h" #include "dh.h" #include "mqv.h" #include "luc.h" #include "xtrcrypt.h" #include "rabin.h" #include "rw.h" #include "eccrypto.h" #include "ecp.h" #include "ec2n.h" #include "asn.h" #include "rng.h" #include "files.h" #include "hex.h" #include "oids.h" #include "esign.h" #include "osrng.h" #include #include #include "validate.h" USING_NAMESPACE(CryptoPP) USING_NAMESPACE(std) class FixedRNG : public RandomNumberGenerator { public: FixedRNG(BufferedTransformation &source) : m_source(source) {} void GenerateBlock(byte *output, size_t size) { m_source.Get(output, size); } private: BufferedTransformation &m_source; }; bool ValidateBBS() { cout << "\nBlumBlumShub validation suite running...\n\n"; Integer p("212004934506826557583707108431463840565872545889679278744389317666981496005411448865750399674653351"); Integer q("100677295735404212434355574418077394581488455772477016953458064183204108039226017738610663984508231"); Integer seed("63239752671357255800299643604761065219897634268887145610573595874544114193025997412441121667211431"); BlumBlumShub bbs(p, q, seed); bool pass = true, fail; int j; const byte output1[] = { 0x49,0xEA,0x2C,0xFD,0xB0,0x10,0x64,0xA0,0xBB,0xB9, 0x2A,0xF1,0x01,0xDA,0xC1,0x8A,0x94,0xF7,0xB7,0xCE}; const byte output2[] = { 0x74,0x45,0x48,0xAE,0xAC,0xB7,0x0E,0xDF,0xAF,0xD7, 0xD5,0x0E,0x8E,0x29,0x83,0x75,0x6B,0x27,0x46,0xA1}; byte buf[20]; bbs.GenerateBlock(buf, 20); fail = memcmp(output1, buf, 20) != 0; pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); for (j=0;j<20;j++) cout << setw(2) << setfill('0') << hex << (int)buf[j]; cout << endl; bbs.Seek(10); bbs.GenerateBlock(buf, 10); fail = memcmp(output1+10, buf, 10) != 0; pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); for (j=0;j<10;j++) cout << setw(2) << setfill('0') << hex << (int)buf[j]; cout << endl; bbs.Seek(1234567); bbs.GenerateBlock(buf, 20); fail = memcmp(output2, buf, 20) != 0; pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); for (j=0;j<20;j++) cout << setw(2) << setfill('0') << hex << (int)buf[j]; cout << endl; return pass; } bool SignatureValidate(PK_Signer &priv, PK_Verifier &pub, bool thorough = false) { bool pass = true, fail; fail = !pub.GetMaterial().Validate(GlobalRNG(), thorough ? 3 : 2) || !priv.GetMaterial().Validate(GlobalRNG(), thorough ? 3 : 2); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "signature key validation\n"; const byte *message = (byte *)"test message"; const int messageLen = 12; SecByteBlock signature(priv.MaxSignatureLength()); size_t signatureLength = priv.SignMessage(GlobalRNG(), message, messageLen, signature); fail = !pub.VerifyMessage(message, messageLen, signature, signatureLength); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "signature and verification\n"; ++signature[0]; fail = pub.VerifyMessage(message, messageLen, signature, signatureLength); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "checking invalid signature" << endl; if (priv.MaxRecoverableLength() > 0) { signatureLength = priv.SignMessageWithRecovery(GlobalRNG(), message, messageLen, NULL, 0, signature); SecByteBlock recovered(priv.MaxRecoverableLengthFromSignatureLength(signatureLength)); DecodingResult result = pub.RecoverMessage(recovered, NULL, 0, signature, signatureLength); fail = !(result.isValidCoding && result.messageLength == messageLen && memcmp(recovered, message, messageLen) == 0); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "signature and verification with recovery" << endl; ++signature[0]; result = pub.RecoverMessage(recovered, NULL, 0, signature, signatureLength); fail = result.isValidCoding; pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "recovery with invalid signature" << endl; } return pass; } bool CryptoSystemValidate(PK_Decryptor &priv, PK_Encryptor &pub, bool thorough = false) { bool pass = true, fail; fail = !pub.GetMaterial().Validate(GlobalRNG(), thorough ? 3 : 2) || !priv.GetMaterial().Validate(GlobalRNG(), thorough ? 3 : 2); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "cryptosystem key validation\n"; const byte *message = (byte *)"test message"; const int messageLen = 12; SecByteBlock ciphertext(priv.CiphertextLength(messageLen)); SecByteBlock plaintext(priv.MaxPlaintextLength(ciphertext.size())); pub.Encrypt(GlobalRNG(), message, messageLen, ciphertext); fail = priv.Decrypt(GlobalRNG(), ciphertext, priv.CiphertextLength(messageLen), plaintext) != DecodingResult(messageLen); fail = fail || memcmp(message, plaintext, messageLen); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "encryption and decryption\n"; return pass; } bool SimpleKeyAgreementValidate(SimpleKeyAgreementDomain &d) { if (d.GetCryptoParameters().Validate(GlobalRNG(), 3)) cout << "passed simple key agreement domain parameters validation" << endl; else { cout << "FAILED simple key agreement domain parameters invalid" << endl; return false; } SecByteBlock priv1(d.PrivateKeyLength()), priv2(d.PrivateKeyLength()); SecByteBlock pub1(d.PublicKeyLength()), pub2(d.PublicKeyLength()); SecByteBlock val1(d.AgreedValueLength()), val2(d.AgreedValueLength()); d.GenerateKeyPair(GlobalRNG(), priv1, pub1); d.GenerateKeyPair(GlobalRNG(), priv2, pub2); memset(val1.begin(), 0x10, val1.size()); memset(val2.begin(), 0x11, val2.size()); if (!(d.Agree(val1, priv1, pub2) && d.Agree(val2, priv2, pub1))) { cout << "FAILED simple key agreement failed" << endl; return false; } if (memcmp(val1.begin(), val2.begin(), d.AgreedValueLength())) { cout << "FAILED simple agreed values not equal" << endl; return false; } cout << "passed simple key agreement" << endl; return true; } bool AuthenticatedKeyAgreementValidate(AuthenticatedKeyAgreementDomain &d) { if (d.GetCryptoParameters().Validate(GlobalRNG(), 3)) cout << "passed authenticated key agreement domain parameters validation" << endl; else { cout << "FAILED authenticated key agreement domain parameters invalid" << endl; return false; } SecByteBlock spriv1(d.StaticPrivateKeyLength()), spriv2(d.StaticPrivateKeyLength()); SecByteBlock epriv1(d.EphemeralPrivateKeyLength()), epriv2(d.EphemeralPrivateKeyLength()); SecByteBlock spub1(d.StaticPublicKeyLength()), spub2(d.StaticPublicKeyLength()); SecByteBlock epub1(d.EphemeralPublicKeyLength()), epub2(d.EphemeralPublicKeyLength()); SecByteBlock val1(d.AgreedValueLength()), val2(d.AgreedValueLength()); d.GenerateStaticKeyPair(GlobalRNG(), spriv1, spub1); d.GenerateStaticKeyPair(GlobalRNG(), spriv2, spub2); d.GenerateEphemeralKeyPair(GlobalRNG(), epriv1, epub1); d.GenerateEphemeralKeyPair(GlobalRNG(), epriv2, epub2); memset(val1.begin(), 0x10, val1.size()); memset(val2.begin(), 0x11, val2.size()); if (!(d.Agree(val1, spriv1, epriv1, spub2, epub2) && d.Agree(val2, spriv2, epriv2, spub1, epub1))) { cout << "FAILED authenticated key agreement failed" << endl; return false; } if (memcmp(val1.begin(), val2.begin(), d.AgreedValueLength())) { cout << "FAILED authenticated agreed values not equal" << endl; return false; } cout << "passed authenticated key agreement" << endl; return true; } bool ValidateRSA() { cout << "\nRSA validation suite running...\n\n"; byte out[100], outPlain[100]; bool pass = true, fail; { const char *plain = "Everyone gets Friday off."; byte *signature = (byte *) "\x05\xfa\x6a\x81\x2f\xc7\xdf\x8b\xf4\xf2\x54\x25\x09\xe0\x3e\x84" "\x6e\x11\xb9\xc6\x20\xbe\x20\x09\xef\xb4\x40\xef\xbc\xc6\x69\x21" "\x69\x94\xac\x04\xf3\x41\xb5\x7d\x05\x20\x2d\x42\x8f\xb2\xa2\x7b" "\x5c\x77\xdf\xd9\xb1\x5b\xfc\x3d\x55\x93\x53\x50\x34\x10\xc1\xe1"; FileSource keys("TestData/rsa512a.dat", true, new HexDecoder); Weak::RSASSA_PKCS1v15_MD2_Signer rsaPriv(keys); Weak::RSASSA_PKCS1v15_MD2_Verifier rsaPub(rsaPriv); size_t signatureLength = rsaPriv.SignMessage(GlobalRNG(), (byte *)plain, strlen(plain), out); fail = memcmp(signature, out, 64) != 0; pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "signature check against test vector\n"; fail = !rsaPub.VerifyMessage((byte *)plain, strlen(plain), out, signatureLength); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "verification check against test vector\n"; out[10]++; fail = rsaPub.VerifyMessage((byte *)plain, strlen(plain), out, signatureLength); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "invalid signature verification\n"; } { FileSource keys("TestData/rsa1024.dat", true, new HexDecoder); RSAES_PKCS1v15_Decryptor rsaPriv(keys); RSAES_PKCS1v15_Encryptor rsaPub(rsaPriv); pass = CryptoSystemValidate(rsaPriv, rsaPub) && pass; } { RSAES >::Decryptor rsaPriv(GlobalRNG(), 512); RSAES >::Encryptor rsaPub(rsaPriv); pass = CryptoSystemValidate(rsaPriv, rsaPub) && pass; } { byte *plain = (byte *) "\x54\x85\x9b\x34\x2c\x49\xea\x2a"; byte *encrypted = (byte *) "\x14\xbd\xdd\x28\xc9\x83\x35\x19\x23\x80\xe8\xe5\x49\xb1\x58\x2a" "\x8b\x40\xb4\x48\x6d\x03\xa6\xa5\x31\x1f\x1f\xd5\xf0\xa1\x80\xe4" "\x17\x53\x03\x29\xa9\x34\x90\x74\xb1\x52\x13\x54\x29\x08\x24\x52" "\x62\x51"; byte *oaepSeed = (byte *) "\xaa\xfd\x12\xf6\x59\xca\xe6\x34\x89\xb4\x79\xe5\x07\x6d\xde\xc2" "\xf0\x6c\xb5\x8f"; ByteQueue bq; bq.Put(oaepSeed, 20); FixedRNG rng(bq); FileSource privFile("TestData/rsa400pv.dat", true, new HexDecoder); FileSource pubFile("TestData/rsa400pb.dat", true, new HexDecoder); RSAES_OAEP_SHA_Decryptor rsaPriv; rsaPriv.AccessKey().BERDecodePrivateKey(privFile, false, 0); RSAES_OAEP_SHA_Encryptor rsaPub(pubFile); memset(out, 0, 50); memset(outPlain, 0, 8); rsaPub.Encrypt(rng, plain, 8, out); DecodingResult result = rsaPriv.FixedLengthDecrypt(GlobalRNG(), encrypted, outPlain); fail = !result.isValidCoding || (result.messageLength!=8) || memcmp(out, encrypted, 50) || memcmp(plain, outPlain, 8); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "PKCS 2.0 encryption and decryption\n"; } return pass; } bool ValidateDH() { cout << "\nDH validation suite running...\n\n"; FileSource f("TestData/dh1024.dat", true, new HexDecoder()); DH dh(f); return SimpleKeyAgreementValidate(dh); } bool ValidateMQV() { cout << "\nMQV validation suite running...\n\n"; FileSource f("TestData/mqv1024.dat", true, new HexDecoder()); MQV mqv(f); return AuthenticatedKeyAgreementValidate(mqv); } bool ValidateLUC_DH() { cout << "\nLUC-DH validation suite running...\n\n"; FileSource f("TestData/lucd512.dat", true, new HexDecoder()); LUC_DH dh(f); return SimpleKeyAgreementValidate(dh); } bool ValidateXTR_DH() { cout << "\nXTR-DH validation suite running...\n\n"; FileSource f("TestData/xtrdh171.dat", true, new HexDecoder()); XTR_DH dh(f); return SimpleKeyAgreementValidate(dh); } bool ValidateElGamal() { cout << "\nElGamal validation suite running...\n\n"; bool pass = true; { FileSource fc("TestData/elgc1024.dat", true, new HexDecoder); ElGamalDecryptor privC(fc); ElGamalEncryptor pubC(privC); privC.AccessKey().Precompute(); ByteQueue queue; privC.AccessKey().SavePrecomputation(queue); privC.AccessKey().LoadPrecomputation(queue); pass = CryptoSystemValidate(privC, pubC) && pass; } return pass; } bool ValidateDLIES() { cout << "\nDLIES validation suite running...\n\n"; bool pass = true; { FileSource fc("TestData/dlie1024.dat", true, new HexDecoder); DLIES<>::Decryptor privC(fc); DLIES<>::Encryptor pubC(privC); pass = CryptoSystemValidate(privC, pubC) && pass; } { cout << "Generating new encryption key..." << endl; DLIES<>::GroupParameters gp; gp.GenerateRandomWithKeySize(GlobalRNG(), 128); DLIES<>::Decryptor decryptor; decryptor.AccessKey().GenerateRandom(GlobalRNG(), gp); DLIES<>::Encryptor encryptor(decryptor); pass = CryptoSystemValidate(decryptor, encryptor) && pass; } return pass; } bool ValidateNR() { cout << "\nNR validation suite running...\n\n"; bool pass = true; { FileSource f("TestData/nr2048.dat", true, new HexDecoder); NR::Signer privS(f); privS.AccessKey().Precompute(); NR::Verifier pubS(privS); pass = SignatureValidate(privS, pubS) && pass; } { cout << "Generating new signature key..." << endl; NR::Signer privS(GlobalRNG(), 256); NR::Verifier pubS(privS); pass = SignatureValidate(privS, pubS) && pass; } return pass; } bool ValidateDSA(bool thorough) { cout << "\nDSA validation suite running...\n\n"; bool pass = true, fail; { FileSource fs("TestData/dsa512.dat", true, new HexDecoder()); GDSA::Signer priv(fs); priv.AccessKey().Precompute(16); GDSA::Verifier pub(priv); byte seed[]={0xd5, 0x01, 0x4e, 0x4b, 0x60, 0xef, 0x2b, 0xa8, 0xb6, 0x21, 0x1b, 0x40, 0x62, 0xba, 0x32, 0x24, 0xe0, 0x42, 0x7d, 0xd3}; Integer k("358dad57 1462710f 50e254cf 1a376b2b deaadfbfh"); Integer h("a9993e36 4706816a ba3e2571 7850c26c 9cd0d89dh"); byte sig[]={0x8b, 0xac, 0x1a, 0xb6, 0x64, 0x10, 0x43, 0x5c, 0xb7, 0x18, 0x1f, 0x95, 0xb1, 0x6a, 0xb9, 0x7c, 0x92, 0xb3, 0x41, 0xc0, 0x41, 0xe2, 0x34, 0x5f, 0x1f, 0x56, 0xdf, 0x24, 0x58, 0xf4, 0x26, 0xd1, 0x55, 0xb4, 0xba, 0x2d, 0xb6, 0xdc, 0xd8, 0xc8}; Integer r(sig, 20); Integer s(sig+20, 20); Integer pGen, qGen, rOut, sOut; int c; fail = !DSA::GeneratePrimes(seed, 160, c, pGen, 512, qGen); fail = fail || (pGen != pub.GetKey().GetGroupParameters().GetModulus()) || (qGen != pub.GetKey().GetGroupParameters().GetSubgroupOrder()); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "prime generation test\n"; priv.RawSign(k, h, rOut, sOut); fail = (rOut != r) || (sOut != s); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "signature check against test vector\n"; fail = !pub.VerifyMessage((byte *)"abc", 3, sig, sizeof(sig)); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "verification check against test vector\n"; fail = pub.VerifyMessage((byte *)"xyz", 3, sig, sizeof(sig)); pass = pass && !fail; } FileSource fs1("TestData/dsa1024.dat", true, new HexDecoder()); DSA::Signer priv(fs1); DSA::Verifier pub(priv); FileSource fs2("TestData/dsa1024b.dat", true, new HexDecoder()); DSA::Verifier pub1(fs2); assert(pub.GetKey() == pub1.GetKey()); pass = SignatureValidate(priv, pub, thorough) && pass; return pass; } bool ValidateLUC() { cout << "\nLUC validation suite running...\n\n"; bool pass=true; { FileSource f("TestData/luc1024.dat", true, new HexDecoder); LUCSSA_PKCS1v15_SHA_Signer priv(f); LUCSSA_PKCS1v15_SHA_Verifier pub(priv); pass = SignatureValidate(priv, pub) && pass; } { LUCES_OAEP_SHA_Decryptor priv(GlobalRNG(), 512); LUCES_OAEP_SHA_Encryptor pub(priv); pass = CryptoSystemValidate(priv, pub) && pass; } return pass; } bool ValidateLUC_DL() { cout << "\nLUC-HMP validation suite running...\n\n"; FileSource f("TestData/lucs512.dat", true, new HexDecoder); LUC_HMP::Signer privS(f); LUC_HMP::Verifier pubS(privS); bool pass = SignatureValidate(privS, pubS); cout << "\nLUC-IES validation suite running...\n\n"; FileSource fc("TestData/lucc512.dat", true, new HexDecoder); LUC_IES<>::Decryptor privC(fc); LUC_IES<>::Encryptor pubC(privC); pass = CryptoSystemValidate(privC, pubC) && pass; return pass; } bool ValidateRabin() { cout << "\nRabin validation suite running...\n\n"; bool pass=true; { FileSource f("TestData/rabi1024.dat", true, new HexDecoder); RabinSS::Signer priv(f); RabinSS::Verifier pub(priv); pass = SignatureValidate(priv, pub) && pass; } { RabinES >::Decryptor priv(GlobalRNG(), 512); RabinES >::Encryptor pub(priv); pass = CryptoSystemValidate(priv, pub) && pass; } return pass; } bool ValidateRW() { cout << "\nRW validation suite running...\n\n"; FileSource f("TestData/rw1024.dat", true, new HexDecoder); RWSS::Signer priv(f); RWSS::Verifier pub(priv); return SignatureValidate(priv, pub); } /* bool ValidateBlumGoldwasser() { cout << "\nBlumGoldwasser validation suite running...\n\n"; FileSource f("TestData/blum512.dat", true, new HexDecoder); BlumGoldwasserPrivateKey priv(f); BlumGoldwasserPublicKey pub(priv); return CryptoSystemValidate(priv, pub); } */ bool ValidateECP() { cout << "\nECP validation suite running...\n\n"; ECIES::Decryptor cpriv(GlobalRNG(), ASN1::secp192r1()); ECIES::Encryptor cpub(cpriv); ByteQueue bq; cpriv.GetKey().DEREncode(bq); cpub.AccessKey().AccessGroupParameters().SetEncodeAsOID(true); cpub.GetKey().DEREncode(bq); ECDSA::Signer spriv(bq); ECDSA::Verifier spub(bq); ECDH::Domain ecdhc(ASN1::secp192r1()); ECMQV::Domain ecmqvc(ASN1::secp192r1()); spriv.AccessKey().Precompute(); ByteQueue queue; spriv.AccessKey().SavePrecomputation(queue); spriv.AccessKey().LoadPrecomputation(queue); bool pass = SignatureValidate(spriv, spub); cpub.AccessKey().Precompute(); cpriv.AccessKey().Precompute(); pass = CryptoSystemValidate(cpriv, cpub) && pass; pass = SimpleKeyAgreementValidate(ecdhc) && pass; pass = AuthenticatedKeyAgreementValidate(ecmqvc) && pass; cout << "Turning on point compression..." << endl; cpriv.AccessKey().AccessGroupParameters().SetPointCompression(true); cpub.AccessKey().AccessGroupParameters().SetPointCompression(true); ecdhc.AccessGroupParameters().SetPointCompression(true); ecmqvc.AccessGroupParameters().SetPointCompression(true); pass = CryptoSystemValidate(cpriv, cpub) && pass; pass = SimpleKeyAgreementValidate(ecdhc) && pass; pass = AuthenticatedKeyAgreementValidate(ecmqvc) && pass; cout << "Testing SEC 2, NIST, and Brainpool recommended curves..." << endl; OID oid; while (!(oid = DL_GroupParameters_EC::GetNextRecommendedParametersOID(oid)).m_values.empty()) { DL_GroupParameters_EC params(oid); bool fail = !params.Validate(GlobalRNG(), 2); cout << (fail ? "FAILED" : "passed") << " " << dec << params.GetCurve().GetField().MaxElementBitLength() << " bits" << endl; pass = pass && !fail; } return pass; } bool ValidateEC2N() { cout << "\nEC2N validation suite running...\n\n"; ECIES::Decryptor cpriv(GlobalRNG(), ASN1::sect193r1()); ECIES::Encryptor cpub(cpriv); ByteQueue bq; cpriv.DEREncode(bq); cpub.AccessKey().AccessGroupParameters().SetEncodeAsOID(true); cpub.DEREncode(bq); ECDSA::Signer spriv(bq); ECDSA::Verifier spub(bq); ECDH::Domain ecdhc(ASN1::sect193r1()); ECMQV::Domain ecmqvc(ASN1::sect193r1()); spriv.AccessKey().Precompute(); ByteQueue queue; spriv.AccessKey().SavePrecomputation(queue); spriv.AccessKey().LoadPrecomputation(queue); bool pass = SignatureValidate(spriv, spub); pass = CryptoSystemValidate(cpriv, cpub) && pass; pass = SimpleKeyAgreementValidate(ecdhc) && pass; pass = AuthenticatedKeyAgreementValidate(ecmqvc) && pass; cout << "Turning on point compression..." << endl; cpriv.AccessKey().AccessGroupParameters().SetPointCompression(true); cpub.AccessKey().AccessGroupParameters().SetPointCompression(true); ecdhc.AccessGroupParameters().SetPointCompression(true); ecmqvc.AccessGroupParameters().SetPointCompression(true); pass = CryptoSystemValidate(cpriv, cpub) && pass; pass = SimpleKeyAgreementValidate(ecdhc) && pass; pass = AuthenticatedKeyAgreementValidate(ecmqvc) && pass; #if 0 // TODO: turn this back on when I make EC2N faster for pentanomial basis cout << "Testing SEC 2 recommended curves..." << endl; OID oid; while (!(oid = DL_GroupParameters_EC::GetNextRecommendedParametersOID(oid)).m_values.empty()) { DL_GroupParameters_EC params(oid); bool fail = !params.Validate(GlobalRNG(), 2); cout << (fail ? "FAILED" : "passed") << " " << params.GetCurve().GetField().MaxElementBitLength() << " bits" << endl; pass = pass && !fail; } #endif return pass; } bool ValidateECDSA() { cout << "\nECDSA validation suite running...\n\n"; // from Sample Test Vectors for P1363 GF2NT gf2n(191, 9, 0); byte a[]="\x28\x66\x53\x7B\x67\x67\x52\x63\x6A\x68\xF5\x65\x54\xE1\x26\x40\x27\x6B\x64\x9E\xF7\x52\x62\x67"; byte b[]="\x2E\x45\xEF\x57\x1F\x00\x78\x6F\x67\xB0\x08\x1B\x94\x95\xA3\xD9\x54\x62\xF5\xDE\x0A\xA1\x85\xEC"; EC2N ec(gf2n, PolynomialMod2(a,24), PolynomialMod2(b,24)); EC2N::Point P; ec.DecodePoint(P, (byte *)"\x04\x36\xB3\xDA\xF8\xA2\x32\x06\xF9\xC4\xF2\x99\xD7\xB2\x1A\x9C\x36\x91\x37\xF2\xC8\x4A\xE1\xAA\x0D" "\x76\x5B\xE7\x34\x33\xB3\xF9\x5E\x33\x29\x32\xE7\x0E\xA2\x45\xCA\x24\x18\xEA\x0E\xF9\x80\x18\xFB", ec.EncodedPointSize()); Integer n("40000000000000000000000004a20e90c39067c893bbb9a5H"); Integer d("340562e1dda332f9d2aec168249b5696ee39d0ed4d03760fH"); EC2N::Point Q(ec.Multiply(d, P)); ECDSA::Signer priv(ec, P, n, d); ECDSA::Verifier pub(priv); Integer h("A9993E364706816ABA3E25717850C26C9CD0D89DH"); Integer k("3eeace72b4919d991738d521879f787cb590aff8189d2b69H"); byte sig[]="\x03\x8e\x5a\x11\xfb\x55\xe4\xc6\x54\x71\xdc\xd4\x99\x84\x52\xb1\xe0\x2d\x8a\xf7\x09\x9b\xb9\x30" "\x0c\x9a\x08\xc3\x44\x68\xc2\x44\xb4\xe5\xd6\xb2\x1b\x3c\x68\x36\x28\x07\x41\x60\x20\x32\x8b\x6e"; Integer r(sig, 24); Integer s(sig+24, 24); Integer rOut, sOut; bool fail, pass=true; priv.RawSign(k, h, rOut, sOut); fail = (rOut != r) || (sOut != s); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "signature check against test vector\n"; fail = !pub.VerifyMessage((byte *)"abc", 3, sig, sizeof(sig)); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "verification check against test vector\n"; fail = pub.VerifyMessage((byte *)"xyz", 3, sig, sizeof(sig)); pass = pass && !fail; pass = SignatureValidate(priv, pub) && pass; return pass; } bool ValidateESIGN() { cout << "\nESIGN validation suite running...\n\n"; bool pass = true, fail; const char *plain = "test"; const byte *signature = (byte *) "\xA3\xE3\x20\x65\xDE\xDA\xE7\xEC\x05\xC1\xBF\xCD\x25\x79\x7D\x99\xCD\xD5\x73\x9D\x9D\xF3\xA4\xAA\x9A\xA4\x5A\xC8\x23\x3D\x0D\x37\xFE\xBC\x76\x3F\xF1\x84\xF6\x59" "\x14\x91\x4F\x0C\x34\x1B\xAE\x9A\x5C\x2E\x2E\x38\x08\x78\x77\xCB\xDC\x3C\x7E\xA0\x34\x44\x5B\x0F\x67\xD9\x35\x2A\x79\x47\x1A\x52\x37\x71\xDB\x12\x67\xC1\xB6\xC6" "\x66\x73\xB3\x40\x2E\xD6\xF2\x1A\x84\x0A\xB6\x7B\x0F\xEB\x8B\x88\xAB\x33\xDD\xE4\x83\x21\x90\x63\x2D\x51\x2A\xB1\x6F\xAB\xA7\x5C\xFD\x77\x99\xF2\xE1\xEF\x67\x1A" "\x74\x02\x37\x0E\xED\x0A\x06\xAD\xF4\x15\x65\xB8\xE1\xD1\x45\xAE\x39\x19\xB4\xFF\x5D\xF1\x45\x7B\xE0\xFE\x72\xED\x11\x92\x8F\x61\x41\x4F\x02\x00\xF2\x76\x6F\x7C" "\x79\xA2\xE5\x52\x20\x5D\x97\x5E\xFE\x39\xAE\x21\x10\xFB\x35\xF4\x80\x81\x41\x13\xDD\xE8\x5F\xCA\x1E\x4F\xF8\x9B\xB2\x68\xFB\x28"; FileSource keys("TestData/esig1536.dat", true, new HexDecoder); ESIGN::Signer signer(keys); ESIGN::Verifier verifier(signer); fail = !SignatureValidate(signer, verifier); pass = pass && !fail; fail = !verifier.VerifyMessage((byte *)plain, strlen(plain), signature, verifier.SignatureLength()); pass = pass && !fail; cout << (fail ? "FAILED " : "passed "); cout << "verification check against test vector\n"; cout << "Generating signature key from seed..." << endl; signer.AccessKey().GenerateRandom(GlobalRNG(), MakeParameters("Seed", ConstByteArrayParameter((const byte *)"test", 4))("KeySize", 3*512)); verifier = signer; fail = !SignatureValidate(signer, verifier); pass = pass && !fail; return pass; } armory-0.92.3/cppForSwig/cryptopp/luc.cpp0000755000000000000000000001403212414772654017065 0ustar rootroot// luc.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "luc.h" #include "asn.h" #include "nbtheory.h" #include "sha.h" #include "algparam.h" NAMESPACE_BEGIN(CryptoPP) void LUC_TestInstantiations() { LUC_HMP::Signer t1; LUCFunction t2; InvertibleLUCFunction t3; } void DL_Algorithm_LUC_HMP::Sign(const DL_GroupParameters ¶ms, const Integer &x, const Integer &k, const Integer &e, Integer &r, Integer &s) const { const Integer &q = params.GetSubgroupOrder(); r = params.ExponentiateBase(k); s = (k + x*(r+e)) % q; } bool DL_Algorithm_LUC_HMP::Verify(const DL_GroupParameters ¶ms, const DL_PublicKey &publicKey, const Integer &e, const Integer &r, const Integer &s) const { Integer p = params.GetGroupOrder()-1; const Integer &q = params.GetSubgroupOrder(); Integer Vsg = params.ExponentiateBase(s); Integer Vry = publicKey.ExponentiatePublicElement((r+e)%q); return (Vsg*Vsg + Vry*Vry + r*r) % p == (Vsg * Vry * r + 4) % p; } Integer DL_BasePrecomputation_LUC::Exponentiate(const DL_GroupPrecomputation &group, const Integer &exponent) const { return Lucas(exponent, m_g, static_cast(group).GetModulus()); } void DL_GroupParameters_LUC::SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const { for (unsigned int i=0; i Integer::One() && m_n.IsOdd(); pass = pass && m_e > Integer::One() && m_e.IsOdd() && m_e < m_n; return pass; } bool LUCFunction::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue).Assignable() CRYPTOPP_GET_FUNCTION_ENTRY(Modulus) CRYPTOPP_GET_FUNCTION_ENTRY(PublicExponent) ; } void LUCFunction::AssignFrom(const NameValuePairs &source) { AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY(Modulus) CRYPTOPP_SET_FUNCTION_ENTRY(PublicExponent) ; } // ***************************************************************************** // private key operations: class LUCPrimeSelector : public PrimeSelector { public: LUCPrimeSelector(const Integer &e) : m_e(e) {} bool IsAcceptable(const Integer &candidate) const { return RelativelyPrime(m_e, candidate+1) && RelativelyPrime(m_e, candidate-1); } Integer m_e; }; void InvertibleLUCFunction::GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg) { int modulusSize = 2048; alg.GetIntValue("ModulusSize", modulusSize) || alg.GetIntValue("KeySize", modulusSize); if (modulusSize < 16) throw InvalidArgument("InvertibleLUCFunction: specified modulus size is too small"); m_e = alg.GetValueWithDefault("PublicExponent", Integer(17)); if (m_e < 5 || m_e.IsEven()) throw InvalidArgument("InvertibleLUCFunction: invalid public exponent"); LUCPrimeSelector selector(m_e); AlgorithmParameters primeParam = MakeParametersForTwoPrimesOfEqualSize(modulusSize) ("PointerToPrimeSelector", selector.GetSelectorPointer()); m_p.GenerateRandom(rng, primeParam); m_q.GenerateRandom(rng, primeParam); m_n = m_p * m_q; m_u = m_q.InverseMod(m_p); } void InvertibleLUCFunction::Initialize(RandomNumberGenerator &rng, unsigned int keybits, const Integer &e) { GenerateRandom(rng, MakeParameters("ModulusSize", (int)keybits)("PublicExponent", e)); } void InvertibleLUCFunction::BERDecode(BufferedTransformation &bt) { BERSequenceDecoder seq(bt); Integer version(seq); if (!!version) // make sure version is 0 BERDecodeError(); m_n.BERDecode(seq); m_e.BERDecode(seq); m_p.BERDecode(seq); m_q.BERDecode(seq); m_u.BERDecode(seq); seq.MessageEnd(); } void InvertibleLUCFunction::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); const byte version[] = {INTEGER, 1, 0}; seq.Put(version, sizeof(version)); m_n.DEREncode(seq); m_e.DEREncode(seq); m_p.DEREncode(seq); m_q.DEREncode(seq); m_u.DEREncode(seq); seq.MessageEnd(); } Integer InvertibleLUCFunction::CalculateInverse(RandomNumberGenerator &rng, const Integer &x) const { // not clear how to do blinding with LUC DoQuickSanityCheck(); return InverseLucas(m_e, x, m_q, m_p, m_u); } bool InvertibleLUCFunction::Validate(RandomNumberGenerator &rng, unsigned int level) const { bool pass = LUCFunction::Validate(rng, level); pass = pass && m_p > Integer::One() && m_p.IsOdd() && m_p < m_n; pass = pass && m_q > Integer::One() && m_q.IsOdd() && m_q < m_n; pass = pass && m_u.IsPositive() && m_u < m_p; if (level >= 1) { pass = pass && m_p * m_q == m_n; pass = pass && RelativelyPrime(m_e, m_p+1); pass = pass && RelativelyPrime(m_e, m_p-1); pass = pass && RelativelyPrime(m_e, m_q+1); pass = pass && RelativelyPrime(m_e, m_q-1); pass = pass && m_u * m_q % m_p == 1; } if (level >= 2) pass = pass && VerifyPrime(rng, m_p, level-2) && VerifyPrime(rng, m_q, level-2); return pass; } bool InvertibleLUCFunction::GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue).Assignable() CRYPTOPP_GET_FUNCTION_ENTRY(Prime1) CRYPTOPP_GET_FUNCTION_ENTRY(Prime2) CRYPTOPP_GET_FUNCTION_ENTRY(MultiplicativeInverseOfPrime2ModPrime1) ; } void InvertibleLUCFunction::AssignFrom(const NameValuePairs &source) { AssignFromHelper(this, source) CRYPTOPP_SET_FUNCTION_ENTRY(Prime1) CRYPTOPP_SET_FUNCTION_ENTRY(Prime2) CRYPTOPP_SET_FUNCTION_ENTRY(MultiplicativeInverseOfPrime2ModPrime1) ; } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/eax.cpp0000755000000000000000000000273212414772654017063 0ustar rootroot// eax.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "eax.h" NAMESPACE_BEGIN(CryptoPP) void EAX_Base::SetKeyWithoutResync(const byte *userKey, size_t keylength, const NameValuePairs ¶ms) { AccessMAC().SetKey(userKey, keylength, params); m_buffer.New(2*AccessMAC().TagSize()); } void EAX_Base::Resync(const byte *iv, size_t len) { MessageAuthenticationCode &mac = AccessMAC(); unsigned int blockSize = mac.TagSize(); memset(m_buffer, 0, blockSize); mac.Update(m_buffer, blockSize); mac.CalculateDigest(m_buffer+blockSize, iv, len); m_buffer[blockSize-1] = 1; mac.Update(m_buffer, blockSize); m_ctr.SetCipherWithIV(AccessMAC().AccessCipher(), m_buffer+blockSize, blockSize); } size_t EAX_Base::AuthenticateBlocks(const byte *data, size_t len) { AccessMAC().Update(data, len); return 0; } void EAX_Base::AuthenticateLastHeaderBlock() { assert(m_bufferedDataLength == 0); MessageAuthenticationCode &mac = AccessMAC(); unsigned int blockSize = mac.TagSize(); mac.Final(m_buffer); xorbuf(m_buffer+blockSize, m_buffer, blockSize); memset(m_buffer, 0, blockSize); m_buffer[blockSize-1] = 2; mac.Update(m_buffer, blockSize); } void EAX_Base::AuthenticateLastFooterBlock(byte *tag, size_t macSize) { assert(m_bufferedDataLength == 0); MessageAuthenticationCode &mac = AccessMAC(); unsigned int blockSize = mac.TagSize(); mac.TruncatedFinal(m_buffer, macSize); xorbuf(tag, m_buffer, m_buffer+blockSize, macSize); } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/gcm.h0000755000000000000000000000655112414772654016524 0ustar rootroot#ifndef CRYPTOPP_GCM_H #define CRYPTOPP_GCM_H #include "authenc.h" #include "modes.h" NAMESPACE_BEGIN(CryptoPP) //! . enum GCM_TablesOption {GCM_2K_Tables, GCM_64K_Tables}; //! . class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE GCM_Base : public AuthenticatedSymmetricCipherBase { public: // AuthenticatedSymmetricCipher std::string AlgorithmName() const {return GetBlockCipher().AlgorithmName() + std::string("/GCM");} size_t MinKeyLength() const {return GetBlockCipher().MinKeyLength();} size_t MaxKeyLength() const {return GetBlockCipher().MaxKeyLength();} size_t DefaultKeyLength() const {return GetBlockCipher().DefaultKeyLength();} size_t GetValidKeyLength(size_t n) const {return GetBlockCipher().GetValidKeyLength(n);} bool IsValidKeyLength(size_t n) const {return GetBlockCipher().IsValidKeyLength(n);} unsigned int OptimalDataAlignment() const; IV_Requirement IVRequirement() const {return UNIQUE_IV;} unsigned int IVSize() const {return 12;} unsigned int MinIVLength() const {return 1;} unsigned int MaxIVLength() const {return UINT_MAX;} // (W64LIT(1)<<61)-1 in the standard unsigned int DigestSize() const {return 16;} lword MaxHeaderLength() const {return (W64LIT(1)<<61)-1;} lword MaxMessageLength() const {return ((W64LIT(1)<<39)-256)/8;} protected: // AuthenticatedSymmetricCipherBase bool AuthenticationIsOnPlaintext() const {return false;} unsigned int AuthenticationBlockSize() const {return HASH_BLOCKSIZE;} void SetKeyWithoutResync(const byte *userKey, size_t keylength, const NameValuePairs ¶ms); void Resync(const byte *iv, size_t len); size_t AuthenticateBlocks(const byte *data, size_t len); void AuthenticateLastHeaderBlock(); void AuthenticateLastConfidentialBlock(); void AuthenticateLastFooterBlock(byte *mac, size_t macSize); SymmetricCipher & AccessSymmetricCipher() {return m_ctr;} virtual BlockCipher & AccessBlockCipher() =0; virtual GCM_TablesOption GetTablesOption() const =0; const BlockCipher & GetBlockCipher() const {return const_cast(this)->AccessBlockCipher();}; byte *HashBuffer() {return m_buffer+REQUIRED_BLOCKSIZE;} byte *HashKey() {return m_buffer+2*REQUIRED_BLOCKSIZE;} byte *MulTable() {return m_buffer+3*REQUIRED_BLOCKSIZE;} inline void ReverseHashBufferIfNeeded(); class CRYPTOPP_DLL GCTR : public CTR_Mode_ExternalCipher::Encryption { protected: void IncrementCounterBy256(); }; GCTR m_ctr; static word16 s_reductionTable[256]; static volatile bool s_reductionTableInitialized; enum {REQUIRED_BLOCKSIZE = 16, HASH_BLOCKSIZE = 16}; }; //! . template class GCM_Final : public GCM_Base { public: static std::string StaticAlgorithmName() {return T_BlockCipher::StaticAlgorithmName() + std::string("/GCM");} bool IsForwardTransformation() const {return T_IsEncryption;} private: GCM_TablesOption GetTablesOption() const {return T_TablesOption;} BlockCipher & AccessBlockCipher() {return m_cipher;} typename T_BlockCipher::Encryption m_cipher; }; //! GCM template struct GCM : public AuthenticatedSymmetricCipherDocumentation { typedef GCM_Final Encryption; typedef GCM_Final Decryption; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/xtr.cpp0000755000000000000000000000532712414772654017126 0ustar rootroot// cryptlib.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "xtr.h" #include "nbtheory.h" #include "algebra.cpp" NAMESPACE_BEGIN(CryptoPP) const GFP2Element & GFP2Element::Zero() { return Singleton().Ref(); } void XTR_FindPrimesAndGenerator(RandomNumberGenerator &rng, Integer &p, Integer &q, GFP2Element &g, unsigned int pbits, unsigned int qbits) { assert(qbits > 9); // no primes exist for pbits = 10, qbits = 9 assert(pbits > qbits); const Integer minQ = Integer::Power2(qbits - 1); const Integer maxQ = Integer::Power2(qbits) - 1; const Integer minP = Integer::Power2(pbits - 1); const Integer maxP = Integer::Power2(pbits) - 1; Integer r1, r2; do { bool qFound = q.Randomize(rng, minQ, maxQ, Integer::PRIME, 7, 12); assert(qFound); bool solutionsExist = SolveModularQuadraticEquation(r1, r2, 1, -1, 1, q); assert(solutionsExist); } while (!p.Randomize(rng, minP, maxP, Integer::PRIME, CRT(rng.GenerateBit()?r1:r2, q, 2, 3, EuclideanMultiplicativeInverse(p, 3)), 3*q)); assert(((p.Squared() - p + 1) % q).IsZero()); GFP2_ONB gfp2(p); GFP2Element three = gfp2.ConvertIn(3), t; while (true) { g.c1.Randomize(rng, Integer::Zero(), p-1); g.c2.Randomize(rng, Integer::Zero(), p-1); t = XTR_Exponentiate(g, p+1, p); if (t.c1 == t.c2) continue; g = XTR_Exponentiate(g, (p.Squared()-p+1)/q, p); if (g != three) break; } assert(XTR_Exponentiate(g, q, p) == three); } GFP2Element XTR_Exponentiate(const GFP2Element &b, const Integer &e, const Integer &p) { unsigned int bitCount = e.BitCount(); if (bitCount == 0) return GFP2Element(-3, -3); // find the lowest bit of e that is 1 unsigned int lowest1bit; for (lowest1bit=0; e.GetBit(lowest1bit) == 0; lowest1bit++) {} GFP2_ONB gfp2(p); GFP2Element c = gfp2.ConvertIn(b); GFP2Element cp = gfp2.PthPower(c); GFP2Element S[5] = {gfp2.ConvertIn(3), c, gfp2.SpecialOperation1(c)}; // do all exponents bits except the lowest zeros starting from the top unsigned int i; for (i = e.BitCount() - 1; i>lowest1bit; i--) { if (e.GetBit(i)) { gfp2.RaiseToPthPower(S[0]); gfp2.Accumulate(S[0], gfp2.SpecialOperation2(S[2], c, S[1])); S[1] = gfp2.SpecialOperation1(S[1]); S[2] = gfp2.SpecialOperation1(S[2]); S[0].swap(S[1]); } else { gfp2.RaiseToPthPower(S[2]); gfp2.Accumulate(S[2], gfp2.SpecialOperation2(S[0], cp, S[1])); S[1] = gfp2.SpecialOperation1(S[1]); S[0] = gfp2.SpecialOperation1(S[0]); S[2].swap(S[1]); } } // now do the lowest zeros while (i--) S[1] = gfp2.SpecialOperation1(S[1]); return gfp2.ConvertOut(S[1]); } template class AbstractRing; template class AbstractGroup; NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/gf2n.cpp0000755000000000000000000004435312414772654017147 0ustar rootroot// gf2n.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "gf2n.h" #include "algebra.h" #include "words.h" #include "randpool.h" #include "asn.h" #include "oids.h" #include NAMESPACE_BEGIN(CryptoPP) PolynomialMod2::PolynomialMod2() { } PolynomialMod2::PolynomialMod2(word value, size_t bitLength) : reg(BitsToWords(bitLength)) { assert(value==0 || reg.size()>0); if (reg.size() > 0) { reg[0] = value; SetWords(reg+1, 0, reg.size()-1); } } PolynomialMod2::PolynomialMod2(const PolynomialMod2& t) : reg(t.reg.size()) { CopyWords(reg, t.reg, reg.size()); } void PolynomialMod2::Randomize(RandomNumberGenerator &rng, size_t nbits) { const size_t nbytes = nbits/8 + 1; SecByteBlock buf(nbytes); rng.GenerateBlock(buf, nbytes); buf[0] = (byte)Crop(buf[0], nbits % 8); Decode(buf, nbytes); } PolynomialMod2 PolynomialMod2::AllOnes(size_t bitLength) { PolynomialMod2 result((word)0, bitLength); SetWords(result.reg, ~(word)0, result.reg.size()); if (bitLength%WORD_BITS) result.reg[result.reg.size()-1] = (word)Crop(result.reg[result.reg.size()-1], bitLength%WORD_BITS); return result; } void PolynomialMod2::SetBit(size_t n, int value) { if (value) { reg.CleanGrow(n/WORD_BITS + 1); reg[n/WORD_BITS] |= (word(1) << (n%WORD_BITS)); } else { if (n/WORD_BITS < reg.size()) reg[n/WORD_BITS] &= ~(word(1) << (n%WORD_BITS)); } } byte PolynomialMod2::GetByte(size_t n) const { if (n/WORD_SIZE >= reg.size()) return 0; else return byte(reg[n/WORD_SIZE] >> ((n%WORD_SIZE)*8)); } void PolynomialMod2::SetByte(size_t n, byte value) { reg.CleanGrow(BytesToWords(n+1)); reg[n/WORD_SIZE] &= ~(word(0xff) << 8*(n%WORD_SIZE)); reg[n/WORD_SIZE] |= (word(value) << 8*(n%WORD_SIZE)); } PolynomialMod2 PolynomialMod2::Monomial(size_t i) { PolynomialMod2 r((word)0, i+1); r.SetBit(i); return r; } PolynomialMod2 PolynomialMod2::Trinomial(size_t t0, size_t t1, size_t t2) { PolynomialMod2 r((word)0, t0+1); r.SetBit(t0); r.SetBit(t1); r.SetBit(t2); return r; } PolynomialMod2 PolynomialMod2::Pentanomial(size_t t0, size_t t1, size_t t2, size_t t3, size_t t4) { PolynomialMod2 r((word)0, t0+1); r.SetBit(t0); r.SetBit(t1); r.SetBit(t2); r.SetBit(t3); r.SetBit(t4); return r; } template struct NewPolynomialMod2 { PolynomialMod2 * operator()() const { return new PolynomialMod2(i); } }; const PolynomialMod2 &PolynomialMod2::Zero() { return Singleton().Ref(); } const PolynomialMod2 &PolynomialMod2::One() { return Singleton >().Ref(); } void PolynomialMod2::Decode(const byte *input, size_t inputLen) { StringStore store(input, inputLen); Decode(store, inputLen); } void PolynomialMod2::Encode(byte *output, size_t outputLen) const { ArraySink sink(output, outputLen); Encode(sink, outputLen); } void PolynomialMod2::Decode(BufferedTransformation &bt, size_t inputLen) { reg.CleanNew(BytesToWords(inputLen)); for (size_t i=inputLen; i > 0; i--) { byte b; bt.Get(b); reg[(i-1)/WORD_SIZE] |= word(b) << ((i-1)%WORD_SIZE)*8; } } void PolynomialMod2::Encode(BufferedTransformation &bt, size_t outputLen) const { for (size_t i=outputLen; i > 0; i--) bt.Put(GetByte(i-1)); } void PolynomialMod2::DEREncodeAsOctetString(BufferedTransformation &bt, size_t length) const { DERGeneralEncoder enc(bt, OCTET_STRING); Encode(enc, length); enc.MessageEnd(); } void PolynomialMod2::BERDecodeAsOctetString(BufferedTransformation &bt, size_t length) { BERGeneralDecoder dec(bt, OCTET_STRING); if (!dec.IsDefiniteLength() || dec.RemainingLength() != length) BERDecodeError(); Decode(dec, length); dec.MessageEnd(); } unsigned int PolynomialMod2::WordCount() const { return (unsigned int)CountWords(reg, reg.size()); } unsigned int PolynomialMod2::ByteCount() const { unsigned wordCount = WordCount(); if (wordCount) return (wordCount-1)*WORD_SIZE + BytePrecision(reg[wordCount-1]); else return 0; } unsigned int PolynomialMod2::BitCount() const { unsigned wordCount = WordCount(); if (wordCount) return (wordCount-1)*WORD_BITS + BitPrecision(reg[wordCount-1]); else return 0; } unsigned int PolynomialMod2::Parity() const { unsigned i; word temp=0; for (i=0; i= reg.size()) { PolynomialMod2 result((word)0, b.reg.size()*WORD_BITS); XorWords(result.reg, reg, b.reg, reg.size()); CopyWords(result.reg+reg.size(), b.reg+reg.size(), b.reg.size()-reg.size()); return result; } else { PolynomialMod2 result((word)0, reg.size()*WORD_BITS); XorWords(result.reg, reg, b.reg, b.reg.size()); CopyWords(result.reg+b.reg.size(), reg+b.reg.size(), reg.size()-b.reg.size()); return result; } } PolynomialMod2 PolynomialMod2::And(const PolynomialMod2 &b) const { PolynomialMod2 result((word)0, WORD_BITS*STDMIN(reg.size(), b.reg.size())); AndWords(result.reg, reg, b.reg, result.reg.size()); return result; } PolynomialMod2 PolynomialMod2::Times(const PolynomialMod2 &b) const { PolynomialMod2 result((word)0, BitCount() + b.BitCount()); for (int i=b.Degree(); i>=0; i--) { result <<= 1; if (b[i]) XorWords(result.reg, reg, reg.size()); } return result; } PolynomialMod2 PolynomialMod2::Squared() const { static const word map[16] = {0, 1, 4, 5, 16, 17, 20, 21, 64, 65, 68, 69, 80, 81, 84, 85}; PolynomialMod2 result((word)0, 2*reg.size()*WORD_BITS); for (unsigned i=0; i> (j/2)) % 16] << j; for (j=0; j> (j/2 + WORD_BITS/2)) % 16] << j; } return result; } void PolynomialMod2::Divide(PolynomialMod2 &remainder, PolynomialMod2 "ient, const PolynomialMod2 ÷nd, const PolynomialMod2 &divisor) { if (!divisor) throw PolynomialMod2::DivideByZero(); int degree = divisor.Degree(); remainder.reg.CleanNew(BitsToWords(degree+1)); if (dividend.BitCount() >= divisor.BitCount()) quotient.reg.CleanNew(BitsToWords(dividend.BitCount() - divisor.BitCount() + 1)); else quotient.reg.CleanNew(0); for (int i=dividend.Degree(); i>=0; i--) { remainder <<= 1; remainder.reg[0] |= dividend[i]; if (remainder[degree]) { remainder -= divisor; quotient.SetBit(i); } } } PolynomialMod2 PolynomialMod2::DividedBy(const PolynomialMod2 &b) const { PolynomialMod2 remainder, quotient; PolynomialMod2::Divide(remainder, quotient, *this, b); return quotient; } PolynomialMod2 PolynomialMod2::Modulo(const PolynomialMod2 &b) const { PolynomialMod2 remainder, quotient; PolynomialMod2::Divide(remainder, quotient, *this, b); return remainder; } PolynomialMod2& PolynomialMod2::operator<<=(unsigned int n) { if (!reg.size()) return *this; int i; word u; word carry=0; word *r=reg; if (n==1) // special case code for most frequent case { i = (int)reg.size(); while (i--) { u = *r; *r = (u << 1) | carry; carry = u >> (WORD_BITS-1); r++; } if (carry) { reg.Grow(reg.size()+1); reg[reg.size()-1] = carry; } return *this; } int shiftWords = n / WORD_BITS; int shiftBits = n % WORD_BITS; if (shiftBits) { i = (int)reg.size(); while (i--) { u = *r; *r = (u << shiftBits) | carry; carry = u >> (WORD_BITS-shiftBits); r++; } } if (carry) { reg.Grow(reg.size()+shiftWords+1); reg[reg.size()-1] = carry; } else reg.Grow(reg.size()+shiftWords); if (shiftWords) { for (i = (int)reg.size()-1; i>=shiftWords; i--) reg[i] = reg[i-shiftWords]; for (; i>=0; i--) reg[i] = 0; } return *this; } PolynomialMod2& PolynomialMod2::operator>>=(unsigned int n) { if (!reg.size()) return *this; int shiftWords = n / WORD_BITS; int shiftBits = n % WORD_BITS; size_t i; word u; word carry=0; word *r=reg+reg.size()-1; if (shiftBits) { i = reg.size(); while (i--) { u = *r; *r = (u >> shiftBits) | carry; carry = u << (WORD_BITS-shiftBits); r--; } } if (shiftWords) { for (i=0; i>(unsigned int n) const { PolynomialMod2 result(*this); return result>>=n; } bool PolynomialMod2::operator!() const { for (unsigned i=0; i s(a.BitCount()/bits+1); unsigned i; static const char upper[]="0123456789ABCDEF"; static const char lower[]="0123456789abcdef"; const char* vec = (out.flags() & std::ios::uppercase) ? upper : lower; for (i=0; i*bits < a.BitCount(); i++) { int digit=0; for (int j=0; j().Gcd(a, b); } PolynomialMod2 PolynomialMod2::InverseMod(const PolynomialMod2 &modulus) const { typedef EuclideanDomainOf Domain; return QuotientRing(Domain(), modulus).MultiplicativeInverse(*this); } bool PolynomialMod2::IsIrreducible() const { signed int d = Degree(); if (d <= 0) return false; PolynomialMod2 t(2), u(t); for (int i=1; i<=d/2; i++) { u = u.Squared()%(*this); if (!Gcd(u+t, *this).IsUnit()) return false; } return true; } // ******************************************************** GF2NP::GF2NP(const PolynomialMod2 &modulus) : QuotientRing >(EuclideanDomainOf(), modulus), m(modulus.Degree()) { } GF2NP::Element GF2NP::SquareRoot(const Element &a) const { Element r = a; for (unsigned int i=1; i t1 && t1 > t2 && t2==0); } const GF2NT::Element& GF2NT::MultiplicativeInverse(const Element &a) const { if (t0-t1 < WORD_BITS) return GF2NP::MultiplicativeInverse(a); SecWordBlock T(m_modulus.reg.size() * 4); word *b = T; word *c = T+m_modulus.reg.size(); word *f = T+2*m_modulus.reg.size(); word *g = T+3*m_modulus.reg.size(); size_t bcLen=1, fgLen=m_modulus.reg.size(); unsigned int k=0; SetWords(T, 0, 3*m_modulus.reg.size()); b[0]=1; assert(a.reg.size() <= m_modulus.reg.size()); CopyWords(f, a.reg, a.reg.size()); CopyWords(g, m_modulus.reg, m_modulus.reg.size()); while (1) { word t=f[0]; while (!t) { ShiftWordsRightByWords(f, fgLen, 1); if (c[bcLen-1]) bcLen++; assert(bcLen <= m_modulus.reg.size()); ShiftWordsLeftByWords(c, bcLen, 1); k+=WORD_BITS; t=f[0]; } unsigned int i=0; while (t%2 == 0) { t>>=1; i++; } k+=i; if (t==1 && CountWords(f, fgLen)==1) break; if (i==1) { ShiftWordsRightByBits(f, fgLen, 1); t=ShiftWordsLeftByBits(c, bcLen, 1); } else { ShiftWordsRightByBits(f, fgLen, i); t=ShiftWordsLeftByBits(c, bcLen, i); } if (t) { c[bcLen] = t; bcLen++; assert(bcLen <= m_modulus.reg.size()); } if (f[fgLen-1]==0 && g[fgLen-1]==0) fgLen--; if (f[fgLen-1] < g[fgLen-1]) { std::swap(f, g); std::swap(b, c); } XorWords(f, g, fgLen); XorWords(b, c, bcLen); } while (k >= WORD_BITS) { word temp = b[0]; // right shift b for (unsigned i=0; i+1> j) & 1) << (t1 + j); else b[t1/WORD_BITS-1] ^= temp << t1%WORD_BITS; if (t1 % WORD_BITS) b[t1/WORD_BITS] ^= temp >> (WORD_BITS - t1%WORD_BITS); if (t0%WORD_BITS) { b[t0/WORD_BITS-1] ^= temp << t0%WORD_BITS; b[t0/WORD_BITS] ^= temp >> (WORD_BITS - t0%WORD_BITS); } else b[t0/WORD_BITS-1] ^= temp; k -= WORD_BITS; } if (k) { word temp = b[0] << (WORD_BITS - k); ShiftWordsRightByBits(b, BitsToWords(m), k); if (t1 < WORD_BITS) for (unsigned int j=0; j> j) & 1) << (t1 + j); else b[t1/WORD_BITS-1] ^= temp << t1%WORD_BITS; if (t1 % WORD_BITS) b[t1/WORD_BITS] ^= temp >> (WORD_BITS - t1%WORD_BITS); if (t0%WORD_BITS) { b[t0/WORD_BITS-1] ^= temp << t0%WORD_BITS; b[t0/WORD_BITS] ^= temp >> (WORD_BITS - t0%WORD_BITS); } else b[t0/WORD_BITS-1] ^= temp; } CopyWords(result.reg.begin(), b, result.reg.size()); return result; } const GF2NT::Element& GF2NT::Multiply(const Element &a, const Element &b) const { size_t aSize = STDMIN(a.reg.size(), result.reg.size()); Element r((word)0, m); for (int i=m-1; i>=0; i--) { if (r[m-1]) { ShiftWordsLeftByBits(r.reg.begin(), r.reg.size(), 1); XorWords(r.reg.begin(), m_modulus.reg, r.reg.size()); } else ShiftWordsLeftByBits(r.reg.begin(), r.reg.size(), 1); if (b[i]) XorWords(r.reg.begin(), a.reg, aSize); } if (m%WORD_BITS) r.reg.begin()[r.reg.size()-1] = (word)Crop(r.reg[r.reg.size()-1], m%WORD_BITS); CopyWords(result.reg.begin(), r.reg.begin(), result.reg.size()); return result; } const GF2NT::Element& GF2NT::Reduced(const Element &a) const { if (t0-t1 < WORD_BITS) return m_domain.Mod(a, m_modulus); SecWordBlock b(a.reg); size_t i; for (i=b.size()-1; i>=BitsToWords(t0); i--) { word temp = b[i]; if (t0%WORD_BITS) { b[i-t0/WORD_BITS] ^= temp >> t0%WORD_BITS; b[i-t0/WORD_BITS-1] ^= temp << (WORD_BITS - t0%WORD_BITS); } else b[i-t0/WORD_BITS] ^= temp; if ((t0-t1)%WORD_BITS) { b[i-(t0-t1)/WORD_BITS] ^= temp >> (t0-t1)%WORD_BITS; b[i-(t0-t1)/WORD_BITS-1] ^= temp << (WORD_BITS - (t0-t1)%WORD_BITS); } else b[i-(t0-t1)/WORD_BITS] ^= temp; } if (i==BitsToWords(t0)-1 && t0%WORD_BITS) { word mask = ((word)1<<(t0%WORD_BITS))-1; word temp = b[i] & ~mask; b[i] &= mask; b[i-t0/WORD_BITS] ^= temp >> t0%WORD_BITS; if ((t0-t1)%WORD_BITS) { b[i-(t0-t1)/WORD_BITS] ^= temp >> (t0-t1)%WORD_BITS; if ((t0-t1)%WORD_BITS > t0%WORD_BITS) b[i-(t0-t1)/WORD_BITS-1] ^= temp << (WORD_BITS - (t0-t1)%WORD_BITS); else assert(temp << (WORD_BITS - (t0-t1)%WORD_BITS) == 0); } else b[i-(t0-t1)/WORD_BITS] ^= temp; } SetWords(result.reg.begin(), 0, result.reg.size()); CopyWords(result.reg.begin(), b, STDMIN(b.size(), result.reg.size())); return result; } void GF2NP::DEREncodeElement(BufferedTransformation &out, const Element &a) const { a.DEREncodeAsOctetString(out, MaxElementByteLength()); } void GF2NP::BERDecodeElement(BufferedTransformation &in, Element &a) const { a.BERDecodeAsOctetString(in, MaxElementByteLength()); } void GF2NT::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); ASN1::characteristic_two_field().DEREncode(seq); DERSequenceEncoder parameters(seq); DEREncodeUnsigned(parameters, m); ASN1::tpBasis().DEREncode(parameters); DEREncodeUnsigned(parameters, t1); parameters.MessageEnd(); seq.MessageEnd(); } void GF2NPP::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); ASN1::characteristic_two_field().DEREncode(seq); DERSequenceEncoder parameters(seq); DEREncodeUnsigned(parameters, m); ASN1::ppBasis().DEREncode(parameters); DERSequenceEncoder pentanomial(parameters); DEREncodeUnsigned(pentanomial, t3); DEREncodeUnsigned(pentanomial, t2); DEREncodeUnsigned(pentanomial, t1); pentanomial.MessageEnd(); parameters.MessageEnd(); seq.MessageEnd(); } GF2NP * BERDecodeGF2NP(BufferedTransformation &bt) { // VC60 workaround: auto_ptr lacks reset() member_ptr result; BERSequenceDecoder seq(bt); if (OID(seq) != ASN1::characteristic_two_field()) BERDecodeError(); BERSequenceDecoder parameters(seq); unsigned int m; BERDecodeUnsigned(parameters, m); OID oid(parameters); if (oid == ASN1::tpBasis()) { unsigned int t1; BERDecodeUnsigned(parameters, t1); result.reset(new GF2NT(m, t1, 0)); } else if (oid == ASN1::ppBasis()) { unsigned int t1, t2, t3; BERSequenceDecoder pentanomial(parameters); BERDecodeUnsigned(pentanomial, t3); BERDecodeUnsigned(pentanomial, t2); BERDecodeUnsigned(pentanomial, t1); pentanomial.MessageEnd(); result.reset(new GF2NPP(m, t3, t2, t1, 0)); } else { BERDecodeError(); return NULL; } parameters.MessageEnd(); seq.MessageEnd(); return result.release(); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/ccm.cpp0000755000000000000000000000746412414772654017057 0ustar rootroot// ccm.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "ccm.h" NAMESPACE_BEGIN(CryptoPP) void CCM_Base::SetKeyWithoutResync(const byte *userKey, size_t keylength, const NameValuePairs ¶ms) { BlockCipher &blockCipher = AccessBlockCipher(); blockCipher.SetKey(userKey, keylength, params); if (blockCipher.BlockSize() != REQUIRED_BLOCKSIZE) throw InvalidArgument(AlgorithmName() + ": block size of underlying block cipher is not 16"); m_digestSize = params.GetIntValueWithDefault(Name::DigestSize(), DefaultDigestSize()); if (m_digestSize % 2 > 0 || m_digestSize < 4 || m_digestSize > 16) throw InvalidArgument(AlgorithmName() + ": DigestSize must be 4, 6, 8, 10, 12, 14, or 16"); m_buffer.Grow(2*REQUIRED_BLOCKSIZE); m_L = 8; } void CCM_Base::Resync(const byte *iv, size_t len) { BlockCipher &cipher = AccessBlockCipher(); m_L = REQUIRED_BLOCKSIZE-1-(int)len; assert(m_L >= 2); if (m_L > 8) m_L = 8; m_buffer[0] = byte(m_L-1); // flag memcpy(m_buffer+1, iv, len); memset(m_buffer+1+len, 0, REQUIRED_BLOCKSIZE-1-len); if (m_state >= State_IVSet) m_ctr.Resynchronize(m_buffer, REQUIRED_BLOCKSIZE); else m_ctr.SetCipherWithIV(cipher, m_buffer); m_ctr.Seek(REQUIRED_BLOCKSIZE); m_aadLength = 0; m_messageLength = 0; } void CCM_Base::UncheckedSpecifyDataLengths(lword headerLength, lword messageLength, lword footerLength) { if (m_state != State_IVSet) throw BadState(AlgorithmName(), "SpecifyDataLengths", "or after State_IVSet"); m_aadLength = headerLength; m_messageLength = messageLength; byte *cbcBuffer = CBC_Buffer(); const BlockCipher &cipher = GetBlockCipher(); cbcBuffer[0] = byte(64*(headerLength>0) + 8*((m_digestSize-2)/2) + (m_L-1)); // flag PutWord(true, BIG_ENDIAN_ORDER, cbcBuffer+REQUIRED_BLOCKSIZE-8, m_messageLength); memcpy(cbcBuffer+1, m_buffer+1, REQUIRED_BLOCKSIZE-1-m_L); cipher.ProcessBlock(cbcBuffer); if (headerLength>0) { assert(m_bufferedDataLength == 0); if (headerLength < ((1<<16) - (1<<8))) { PutWord(true, BIG_ENDIAN_ORDER, m_buffer, (word16)headerLength); m_bufferedDataLength = 2; } else if (headerLength < (W64LIT(1)<<32)) { m_buffer[0] = 0xff; m_buffer[1] = 0xfe; PutWord(false, BIG_ENDIAN_ORDER, m_buffer+2, (word32)headerLength); m_bufferedDataLength = 6; } else { m_buffer[0] = 0xff; m_buffer[1] = 0xff; PutWord(false, BIG_ENDIAN_ORDER, m_buffer+2, headerLength); m_bufferedDataLength = 10; } } } size_t CCM_Base::AuthenticateBlocks(const byte *data, size_t len) { byte *cbcBuffer = CBC_Buffer(); const BlockCipher &cipher = GetBlockCipher(); return cipher.AdvancedProcessBlocks(cbcBuffer, data, cbcBuffer, len, BlockTransformation::BT_DontIncrementInOutPointers|BlockTransformation::BT_XorInput); } void CCM_Base::AuthenticateLastHeaderBlock() { byte *cbcBuffer = CBC_Buffer(); const BlockCipher &cipher = GetBlockCipher(); if (m_aadLength != m_totalHeaderLength) throw InvalidArgument(AlgorithmName() + ": header length doesn't match that given in SpecifyDataLengths"); if (m_bufferedDataLength > 0) { xorbuf(cbcBuffer, m_buffer, m_bufferedDataLength); cipher.ProcessBlock(cbcBuffer); m_bufferedDataLength = 0; } } void CCM_Base::AuthenticateLastConfidentialBlock() { byte *cbcBuffer = CBC_Buffer(); const BlockCipher &cipher = GetBlockCipher(); if (m_messageLength != m_totalMessageLength) throw InvalidArgument(AlgorithmName() + ": message length doesn't match that given in SpecifyDataLengths"); if (m_bufferedDataLength > 0) { xorbuf(cbcBuffer, m_buffer, m_bufferedDataLength); cipher.ProcessBlock(cbcBuffer); m_bufferedDataLength = 0; } } void CCM_Base::AuthenticateLastFooterBlock(byte *mac, size_t macSize) { m_ctr.Seek(0); m_ctr.ProcessData(mac, CBC_Buffer(), macSize); } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/fips140.h0000755000000000000000000000447612414772654017150 0ustar rootroot#ifndef CRYPTOPP_FIPS140_H #define CRYPTOPP_FIPS140_H /*! \file FIPS 140 related functions and classes. */ #include "cryptlib.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! exception thrown when a crypto algorithm is used after a self test fails class CRYPTOPP_DLL SelfTestFailure : public Exception { public: explicit SelfTestFailure(const std::string &s) : Exception(OTHER_ERROR, s) {} }; //! returns whether FIPS 140-2 compliance features were enabled at compile time CRYPTOPP_DLL bool CRYPTOPP_API FIPS_140_2_ComplianceEnabled(); //! enum values representing status of the power-up self test enum PowerUpSelfTestStatus {POWER_UP_SELF_TEST_NOT_DONE, POWER_UP_SELF_TEST_FAILED, POWER_UP_SELF_TEST_PASSED}; //! perform the power-up self test, and set the self test status CRYPTOPP_DLL void CRYPTOPP_API DoPowerUpSelfTest(const char *moduleFilename, const byte *expectedModuleMac); //! perform the power-up self test using the filename of this DLL and the embedded module MAC CRYPTOPP_DLL void CRYPTOPP_API DoDllPowerUpSelfTest(); //! set the power-up self test status to POWER_UP_SELF_TEST_FAILED CRYPTOPP_DLL void CRYPTOPP_API SimulatePowerUpSelfTestFailure(); //! return the current power-up self test status CRYPTOPP_DLL PowerUpSelfTestStatus CRYPTOPP_API GetPowerUpSelfTestStatus(); typedef PowerUpSelfTestStatus (CRYPTOPP_API * PGetPowerUpSelfTestStatus)(); CRYPTOPP_DLL MessageAuthenticationCode * CRYPTOPP_API NewIntegrityCheckingMAC(); CRYPTOPP_DLL bool CRYPTOPP_API IntegrityCheckModule(const char *moduleFilename, const byte *expectedModuleMac, SecByteBlock *pActualMac = NULL, unsigned long *pMacFileLocation = NULL); // this is used by Algorithm constructor to allow Algorithm objects to be constructed for the self test bool PowerUpSelfTestInProgressOnThisThread(); void SetPowerUpSelfTestInProgressOnThisThread(bool inProgress); void SignaturePairwiseConsistencyTest(const PK_Signer &signer, const PK_Verifier &verifier); void EncryptionPairwiseConsistencyTest(const PK_Encryptor &encryptor, const PK_Decryptor &decryptor); void SignaturePairwiseConsistencyTest_FIPS_140_Only(const PK_Signer &signer, const PK_Verifier &verifier); void EncryptionPairwiseConsistencyTest_FIPS_140_Only(const PK_Encryptor &encryptor, const PK_Decryptor &decryptor); #define CRYPTOPP_DUMMY_DLL_MAC "MAC_51f34b8db820ae8" NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/integer.cpp0000755000000000000000000032066312414772654017751 0ustar rootroot// integer.cpp - written and placed in the public domain by Wei Dai // contains public domain code contributed by Alister Lee and Leonard Janke #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "integer.h" #include "modarith.h" #include "nbtheory.h" #include "asn.h" #include "oids.h" #include "words.h" #include "algparam.h" #include "pubkey.h" // for P1363_KDF2 #include "sha.h" #include "cpu.h" #include #if _MSC_VER >= 1400 #include #endif #ifdef __DECCXX #include #endif #ifdef CRYPTOPP_MSVC6_NO_PP #pragma message("You do not seem to have the Visual C++ Processor Pack installed, so use of SSE2 instructions will be disabled.") #endif #define CRYPTOPP_INTEGER_SSE2 (CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE && CRYPTOPP_BOOL_X86) NAMESPACE_BEGIN(CryptoPP) bool AssignIntToInteger(const std::type_info &valueType, void *pInteger, const void *pInt) { if (valueType != typeid(Integer)) return false; *reinterpret_cast(pInteger) = *reinterpret_cast(pInt); return true; } inline static int Compare(const word *A, const word *B, size_t N) { while (N--) if (A[N] > B[N]) return 1; else if (A[N] < B[N]) return -1; return 0; } inline static int Increment(word *A, size_t N, word B=1) { assert(N); word t = A[0]; A[0] = t+B; if (A[0] >= t) return 0; for (unsigned i=1; i>(WORD_BITS-1)); d##0 = 2*d##0 + (c>>(WORD_BITS-1)); c *= 2; #endif #ifndef Acc2WordsBy2 #define Acc2WordsBy2(a, b) a##0 += b##0; a##1 += a##0 < b##0; a##1 += b##1; #endif #define AddWithCarry(u, a, b) {word t = a+b; u##0 = t + u##1; u##1 = (ta) + (u##0>t);} #define GetCarry(u) u##1 #define GetBorrow(u) u##1 #else #define Declare2Words(x) dword x; #if _MSC_VER >= 1400 && !defined(__INTEL_COMPILER) #define MultiplyWords(p, a, b) p = __emulu(a, b); #else #define MultiplyWords(p, a, b) p = (dword)a*b; #endif #define AssignWord(a, b) a = b; #define Add2WordsBy1(a, b, c) a = b + c; #define Acc2WordsBy2(a, b) a += b; #define LowWord(a) word(a) #define HighWord(a) word(a>>WORD_BITS) #define Double3Words(c, d) d = 2*d + (c>>(WORD_BITS-1)); c *= 2; #define AddWithCarry(u, a, b) u = dword(a) + b + GetCarry(u); #define SubtractWithBorrow(u, a, b) u = dword(a) - b - GetBorrow(u); #define GetCarry(u) HighWord(u) #define GetBorrow(u) word(u>>(WORD_BITS*2-1)) #endif #ifndef MulAcc #define MulAcc(c, d, a, b) MultiplyWords(p, a, b); Acc2WordsBy1(p, c); c = LowWord(p); Acc2WordsBy1(d, HighWord(p)); #endif #ifndef Acc2WordsBy1 #define Acc2WordsBy1(a, b) Add2WordsBy1(a, a, b) #endif #ifndef Acc3WordsBy2 #define Acc3WordsBy2(c, d, e) Acc2WordsBy1(e, c); c = LowWord(e); Add2WordsBy1(e, d, HighWord(e)); #endif class DWord { public: DWord() {} #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE explicit DWord(word low) { m_whole = low; } #else explicit DWord(word low) { m_halfs.low = low; m_halfs.high = 0; } #endif DWord(word low, word high) { m_halfs.low = low; m_halfs.high = high; } static DWord Multiply(word a, word b) { DWord r; #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE r.m_whole = (dword)a * b; #elif defined(MultiplyWordsLoHi) MultiplyWordsLoHi(r.m_halfs.low, r.m_halfs.high, a, b); #endif return r; } static DWord MultiplyAndAdd(word a, word b, word c) { DWord r = Multiply(a, b); return r += c; } DWord & operator+=(word a) { #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE m_whole = m_whole + a; #else m_halfs.low += a; m_halfs.high += (m_halfs.low < a); #endif return *this; } DWord operator+(word a) { DWord r; #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE r.m_whole = m_whole + a; #else r.m_halfs.low = m_halfs.low + a; r.m_halfs.high = m_halfs.high + (r.m_halfs.low < a); #endif return r; } DWord operator-(DWord a) { DWord r; #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE r.m_whole = m_whole - a.m_whole; #else r.m_halfs.low = m_halfs.low - a.m_halfs.low; r.m_halfs.high = m_halfs.high - a.m_halfs.high - (r.m_halfs.low > m_halfs.low); #endif return r; } DWord operator-(word a) { DWord r; #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE r.m_whole = m_whole - a; #else r.m_halfs.low = m_halfs.low - a; r.m_halfs.high = m_halfs.high - (r.m_halfs.low > m_halfs.low); #endif return r; } // returns quotient, which must fit in a word word operator/(word divisor); word operator%(word a); bool operator!() const { #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE return !m_whole; #else return !m_halfs.high && !m_halfs.low; #endif } word GetLowHalf() const {return m_halfs.low;} word GetHighHalf() const {return m_halfs.high;} word GetHighHalfAsBorrow() const {return 0-m_halfs.high;} private: union { #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE dword m_whole; #endif struct { #ifdef IS_LITTLE_ENDIAN word low; word high; #else word high; word low; #endif } m_halfs; }; }; class Word { public: Word() {} Word(word value) { m_whole = value; } Word(hword low, hword high) { m_whole = low | (word(high) << (WORD_BITS/2)); } static Word Multiply(hword a, hword b) { Word r; r.m_whole = (word)a * b; return r; } Word operator-(Word a) { Word r; r.m_whole = m_whole - a.m_whole; return r; } Word operator-(hword a) { Word r; r.m_whole = m_whole - a; return r; } // returns quotient, which must fit in a word hword operator/(hword divisor) { return hword(m_whole / divisor); } bool operator!() const { return !m_whole; } word GetWhole() const {return m_whole;} hword GetLowHalf() const {return hword(m_whole);} hword GetHighHalf() const {return hword(m_whole>>(WORD_BITS/2));} hword GetHighHalfAsBorrow() const {return 0-hword(m_whole>>(WORD_BITS/2));} private: word m_whole; }; // do a 3 word by 2 word divide, returns quotient and leaves remainder in A template S DivideThreeWordsByTwo(S *A, S B0, S B1, D *dummy=NULL) { // assert {A[2],A[1]} < {B1,B0}, so quotient can fit in a S assert(A[2] < B1 || (A[2]==B1 && A[1] < B0)); // estimate the quotient: do a 2 S by 1 S divide S Q; if (S(B1+1) == 0) Q = A[2]; else if (B1 > 0) Q = D(A[1], A[2]) / S(B1+1); else Q = D(A[0], A[1]) / B0; // now subtract Q*B from A D p = D::Multiply(B0, Q); D u = (D) A[0] - p.GetLowHalf(); A[0] = u.GetLowHalf(); u = (D) A[1] - p.GetHighHalf() - u.GetHighHalfAsBorrow() - D::Multiply(B1, Q); A[1] = u.GetLowHalf(); A[2] += u.GetHighHalf(); // Q <= actual quotient, so fix it while (A[2] || A[1] > B1 || (A[1]==B1 && A[0]>=B0)) { u = (D) A[0] - B0; A[0] = u.GetLowHalf(); u = (D) A[1] - B1 - u.GetHighHalfAsBorrow(); A[1] = u.GetLowHalf(); A[2] += u.GetHighHalf(); Q++; assert(Q); // shouldn't overflow } return Q; } // do a 4 word by 2 word divide, returns 2 word quotient in Q0 and Q1 template inline D DivideFourWordsByTwo(S *T, const D &Al, const D &Ah, const D &B) { if (!B) // if divisor is 0, we assume divisor==2**(2*WORD_BITS) return D(Ah.GetLowHalf(), Ah.GetHighHalf()); else { S Q[2]; T[0] = Al.GetLowHalf(); T[1] = Al.GetHighHalf(); T[2] = Ah.GetLowHalf(); T[3] = Ah.GetHighHalf(); Q[1] = DivideThreeWordsByTwo(T+1, B.GetLowHalf(), B.GetHighHalf()); Q[0] = DivideThreeWordsByTwo(T, B.GetLowHalf(), B.GetHighHalf()); return D(Q[0], Q[1]); } } // returns quotient, which must fit in a word inline word DWord::operator/(word a) { #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE return word(m_whole / a); #else hword r[4]; return DivideFourWordsByTwo(r, m_halfs.low, m_halfs.high, a).GetWhole(); #endif } inline word DWord::operator%(word a) { #ifdef CRYPTOPP_NATIVE_DWORD_AVAILABLE return word(m_whole % a); #else if (a < (word(1) << (WORD_BITS/2))) { hword h = hword(a); word r = m_halfs.high % h; r = ((m_halfs.low >> (WORD_BITS/2)) + (r << (WORD_BITS/2))) % h; return hword((hword(m_halfs.low) + (r << (WORD_BITS/2))) % h); } else { hword r[4]; DivideFourWordsByTwo(r, m_halfs.low, m_halfs.high, a); return Word(r[0], r[1]).GetWhole(); } #endif } // ******************************************************** // use some tricks to share assembly code between MSVC and GCC #if defined(__GNUC__) #define AddPrologue \ int result; \ __asm__ __volatile__ \ ( \ ".intel_syntax noprefix;" #define AddEpilogue \ ".att_syntax prefix;" \ : "=a" (result)\ : "d" (C), "a" (A), "D" (B), "c" (N) \ : "%esi", "memory", "cc" \ );\ return result; #define MulPrologue \ __asm__ __volatile__ \ ( \ ".intel_syntax noprefix;" \ AS1( push ebx) \ AS2( mov ebx, edx) #define MulEpilogue \ AS1( pop ebx) \ ".att_syntax prefix;" \ : \ : "d" (s_maskLow16), "c" (C), "a" (A), "D" (B) \ : "%esi", "memory", "cc" \ ); #define SquPrologue MulPrologue #define SquEpilogue \ AS1( pop ebx) \ ".att_syntax prefix;" \ : \ : "d" (s_maskLow16), "c" (C), "a" (A) \ : "%esi", "%edi", "memory", "cc" \ ); #define TopPrologue MulPrologue #define TopEpilogue \ AS1( pop ebx) \ ".att_syntax prefix;" \ : \ : "d" (s_maskLow16), "c" (C), "a" (A), "D" (B), "S" (L) \ : "memory", "cc" \ ); #else #define AddPrologue \ __asm push edi \ __asm push esi \ __asm mov eax, [esp+12] \ __asm mov edi, [esp+16] #define AddEpilogue \ __asm pop esi \ __asm pop edi \ __asm ret 8 #if _MSC_VER < 1300 #define SaveEBX __asm push ebx #define RestoreEBX __asm pop ebx #else #define SaveEBX #define RestoreEBX #endif #define SquPrologue \ AS2( mov eax, A) \ AS2( mov ecx, C) \ SaveEBX \ AS2( lea ebx, s_maskLow16) #define MulPrologue \ AS2( mov eax, A) \ AS2( mov edi, B) \ AS2( mov ecx, C) \ SaveEBX \ AS2( lea ebx, s_maskLow16) #define TopPrologue \ AS2( mov eax, A) \ AS2( mov edi, B) \ AS2( mov ecx, C) \ AS2( mov esi, L) \ SaveEBX \ AS2( lea ebx, s_maskLow16) #define SquEpilogue RestoreEBX #define MulEpilogue RestoreEBX #define TopEpilogue RestoreEBX #endif #ifdef CRYPTOPP_X64_MASM_AVAILABLE extern "C" { int Baseline_Add(size_t N, word *C, const word *A, const word *B); int Baseline_Sub(size_t N, word *C, const word *A, const word *B); } #elif defined(CRYPTOPP_X64_ASM_AVAILABLE) && defined(__GNUC__) && defined(CRYPTOPP_WORD128_AVAILABLE) int Baseline_Add(size_t N, word *C, const word *A, const word *B) { word result; __asm__ __volatile__ ( ".intel_syntax;" AS1( neg %1) ASJ( jz, 1, f) AS2( mov %0,[%3+8*%1]) AS2( add %0,[%4+8*%1]) AS2( mov [%2+8*%1],%0) ASL(0) AS2( mov %0,[%3+8*%1+8]) AS2( adc %0,[%4+8*%1+8]) AS2( mov [%2+8*%1+8],%0) AS2( lea %1,[%1+2]) ASJ( jrcxz, 1, f) AS2( mov %0,[%3+8*%1]) AS2( adc %0,[%4+8*%1]) AS2( mov [%2+8*%1],%0) ASJ( jmp, 0, b) ASL(1) AS2( mov %0, 0) AS2( adc %0, %0) ".att_syntax;" : "=&r" (result), "+c" (N) : "r" (C+N), "r" (A+N), "r" (B+N) : "memory", "cc" ); return (int)result; } int Baseline_Sub(size_t N, word *C, const word *A, const word *B) { word result; __asm__ __volatile__ ( ".intel_syntax;" AS1( neg %1) ASJ( jz, 1, f) AS2( mov %0,[%3+8*%1]) AS2( sub %0,[%4+8*%1]) AS2( mov [%2+8*%1],%0) ASL(0) AS2( mov %0,[%3+8*%1+8]) AS2( sbb %0,[%4+8*%1+8]) AS2( mov [%2+8*%1+8],%0) AS2( lea %1,[%1+2]) ASJ( jrcxz, 1, f) AS2( mov %0,[%3+8*%1]) AS2( sbb %0,[%4+8*%1]) AS2( mov [%2+8*%1],%0) ASJ( jmp, 0, b) ASL(1) AS2( mov %0, 0) AS2( adc %0, %0) ".att_syntax;" : "=&r" (result), "+c" (N) : "r" (C+N), "r" (A+N), "r" (B+N) : "memory", "cc" ); return (int)result; } #elif defined(CRYPTOPP_X86_ASM_AVAILABLE) && CRYPTOPP_BOOL_X86 CRYPTOPP_NAKED int CRYPTOPP_FASTCALL Baseline_Add(size_t N, word *C, const word *A, const word *B) { AddPrologue // now: eax = A, edi = B, edx = C, ecx = N AS2( lea eax, [eax+4*ecx]) AS2( lea edi, [edi+4*ecx]) AS2( lea edx, [edx+4*ecx]) AS1( neg ecx) // ecx is negative index AS2( test ecx, 2) // this clears carry flag ASJ( jz, 0, f) AS2( sub ecx, 2) ASJ( jmp, 1, f) ASL(0) ASJ( jecxz, 2, f) // loop until ecx overflows and becomes zero AS2( mov esi,[eax+4*ecx]) AS2( adc esi,[edi+4*ecx]) AS2( mov [edx+4*ecx],esi) AS2( mov esi,[eax+4*ecx+4]) AS2( adc esi,[edi+4*ecx+4]) AS2( mov [edx+4*ecx+4],esi) ASL(1) AS2( mov esi,[eax+4*ecx+8]) AS2( adc esi,[edi+4*ecx+8]) AS2( mov [edx+4*ecx+8],esi) AS2( mov esi,[eax+4*ecx+12]) AS2( adc esi,[edi+4*ecx+12]) AS2( mov [edx+4*ecx+12],esi) AS2( lea ecx,[ecx+4]) // advance index, avoid inc which causes slowdown on Intel Core 2 ASJ( jmp, 0, b) ASL(2) AS2( mov eax, 0) AS1( setc al) // store carry into eax (return result register) AddEpilogue } CRYPTOPP_NAKED int CRYPTOPP_FASTCALL Baseline_Sub(size_t N, word *C, const word *A, const word *B) { AddPrologue // now: eax = A, edi = B, edx = C, ecx = N AS2( lea eax, [eax+4*ecx]) AS2( lea edi, [edi+4*ecx]) AS2( lea edx, [edx+4*ecx]) AS1( neg ecx) // ecx is negative index AS2( test ecx, 2) // this clears carry flag ASJ( jz, 0, f) AS2( sub ecx, 2) ASJ( jmp, 1, f) ASL(0) ASJ( jecxz, 2, f) // loop until ecx overflows and becomes zero AS2( mov esi,[eax+4*ecx]) AS2( sbb esi,[edi+4*ecx]) AS2( mov [edx+4*ecx],esi) AS2( mov esi,[eax+4*ecx+4]) AS2( sbb esi,[edi+4*ecx+4]) AS2( mov [edx+4*ecx+4],esi) ASL(1) AS2( mov esi,[eax+4*ecx+8]) AS2( sbb esi,[edi+4*ecx+8]) AS2( mov [edx+4*ecx+8],esi) AS2( mov esi,[eax+4*ecx+12]) AS2( sbb esi,[edi+4*ecx+12]) AS2( mov [edx+4*ecx+12],esi) AS2( lea ecx,[ecx+4]) // advance index, avoid inc which causes slowdown on Intel Core 2 ASJ( jmp, 0, b) ASL(2) AS2( mov eax, 0) AS1( setc al) // store carry into eax (return result register) AddEpilogue } #if CRYPTOPP_INTEGER_SSE2 CRYPTOPP_NAKED int CRYPTOPP_FASTCALL SSE2_Add(size_t N, word *C, const word *A, const word *B) { AddPrologue // now: eax = A, edi = B, edx = C, ecx = N AS2( lea eax, [eax+4*ecx]) AS2( lea edi, [edi+4*ecx]) AS2( lea edx, [edx+4*ecx]) AS1( neg ecx) // ecx is negative index AS2( pxor mm2, mm2) ASJ( jz, 2, f) AS2( test ecx, 2) // this clears carry flag ASJ( jz, 0, f) AS2( sub ecx, 2) ASJ( jmp, 1, f) ASL(0) AS2( movd mm0, DWORD PTR [eax+4*ecx]) AS2( movd mm1, DWORD PTR [edi+4*ecx]) AS2( paddq mm0, mm1) AS2( paddq mm2, mm0) AS2( movd DWORD PTR [edx+4*ecx], mm2) AS2( psrlq mm2, 32) AS2( movd mm0, DWORD PTR [eax+4*ecx+4]) AS2( movd mm1, DWORD PTR [edi+4*ecx+4]) AS2( paddq mm0, mm1) AS2( paddq mm2, mm0) AS2( movd DWORD PTR [edx+4*ecx+4], mm2) AS2( psrlq mm2, 32) ASL(1) AS2( movd mm0, DWORD PTR [eax+4*ecx+8]) AS2( movd mm1, DWORD PTR [edi+4*ecx+8]) AS2( paddq mm0, mm1) AS2( paddq mm2, mm0) AS2( movd DWORD PTR [edx+4*ecx+8], mm2) AS2( psrlq mm2, 32) AS2( movd mm0, DWORD PTR [eax+4*ecx+12]) AS2( movd mm1, DWORD PTR [edi+4*ecx+12]) AS2( paddq mm0, mm1) AS2( paddq mm2, mm0) AS2( movd DWORD PTR [edx+4*ecx+12], mm2) AS2( psrlq mm2, 32) AS2( add ecx, 4) ASJ( jnz, 0, b) ASL(2) AS2( movd eax, mm2) AS1( emms) AddEpilogue } CRYPTOPP_NAKED int CRYPTOPP_FASTCALL SSE2_Sub(size_t N, word *C, const word *A, const word *B) { AddPrologue // now: eax = A, edi = B, edx = C, ecx = N AS2( lea eax, [eax+4*ecx]) AS2( lea edi, [edi+4*ecx]) AS2( lea edx, [edx+4*ecx]) AS1( neg ecx) // ecx is negative index AS2( pxor mm2, mm2) ASJ( jz, 2, f) AS2( test ecx, 2) // this clears carry flag ASJ( jz, 0, f) AS2( sub ecx, 2) ASJ( jmp, 1, f) ASL(0) AS2( movd mm0, DWORD PTR [eax+4*ecx]) AS2( movd mm1, DWORD PTR [edi+4*ecx]) AS2( psubq mm0, mm1) AS2( psubq mm0, mm2) AS2( movd DWORD PTR [edx+4*ecx], mm0) AS2( psrlq mm0, 63) AS2( movd mm2, DWORD PTR [eax+4*ecx+4]) AS2( movd mm1, DWORD PTR [edi+4*ecx+4]) AS2( psubq mm2, mm1) AS2( psubq mm2, mm0) AS2( movd DWORD PTR [edx+4*ecx+4], mm2) AS2( psrlq mm2, 63) ASL(1) AS2( movd mm0, DWORD PTR [eax+4*ecx+8]) AS2( movd mm1, DWORD PTR [edi+4*ecx+8]) AS2( psubq mm0, mm1) AS2( psubq mm0, mm2) AS2( movd DWORD PTR [edx+4*ecx+8], mm0) AS2( psrlq mm0, 63) AS2( movd mm2, DWORD PTR [eax+4*ecx+12]) AS2( movd mm1, DWORD PTR [edi+4*ecx+12]) AS2( psubq mm2, mm1) AS2( psubq mm2, mm0) AS2( movd DWORD PTR [edx+4*ecx+12], mm2) AS2( psrlq mm2, 63) AS2( add ecx, 4) ASJ( jnz, 0, b) ASL(2) AS2( movd eax, mm2) AS1( emms) AddEpilogue } #endif // #if CRYPTOPP_BOOL_SSE2_ASM_AVAILABLE #else int CRYPTOPP_FASTCALL Baseline_Add(size_t N, word *C, const word *A, const word *B) { assert (N%2 == 0); Declare2Words(u); AssignWord(u, 0); for (size_t i=0; i=2 && N%2==0); if (N <= s_recursionLimit) s_pMul[N/4](R, A, B); else { const size_t N2 = N/2; size_t AN2 = Compare(A0, A1, N2) > 0 ? 0 : N2; Subtract(R0, A + AN2, A + (N2 ^ AN2), N2); size_t BN2 = Compare(B0, B1, N2) > 0 ? 0 : N2; Subtract(R1, B + BN2, B + (N2 ^ BN2), N2); RecursiveMultiply(R2, T2, A1, B1, N2); RecursiveMultiply(T0, T2, R0, R1, N2); RecursiveMultiply(R0, T2, A0, B0, N2); // now T[01] holds (A1-A0)*(B0-B1), R[01] holds A0*B0, R[23] holds A1*B1 int c2 = Add(R2, R2, R1, N2); int c3 = c2; c2 += Add(R1, R2, R0, N2); c3 += Add(R2, R2, R3, N2); if (AN2 == BN2) c3 -= Subtract(R1, R1, T0, N); else c3 += Add(R1, R1, T0, N); c3 += Increment(R2, N2, c2); assert (c3 >= 0 && c3 <= 2); Increment(R3, N2, c3); } } // R[2*N] - result = A*A // T[2*N] - temporary work space // A[N] --- number to be squared void RecursiveSquare(word *R, word *T, const word *A, size_t N) { assert(N && N%2==0); if (N <= s_recursionLimit) s_pSqu[N/4](R, A); else { const size_t N2 = N/2; RecursiveSquare(R0, T2, A0, N2); RecursiveSquare(R2, T2, A1, N2); RecursiveMultiply(T0, T2, A0, A1, N2); int carry = Add(R1, R1, T0, N); carry += Add(R1, R1, T0, N); Increment(R3, N2, carry); } } // R[N] - bottom half of A*B // T[3*N/2] - temporary work space // A[N] - multiplier // B[N] - multiplicant void RecursiveMultiplyBottom(word *R, word *T, const word *A, const word *B, size_t N) { assert(N>=2 && N%2==0); if (N <= s_recursionLimit) s_pBot[N/4](R, A, B); else { const size_t N2 = N/2; RecursiveMultiply(R, T, A0, B0, N2); RecursiveMultiplyBottom(T0, T1, A1, B0, N2); Add(R1, R1, T0, N2); RecursiveMultiplyBottom(T0, T1, A0, B1, N2); Add(R1, R1, T0, N2); } } // R[N] --- upper half of A*B // T[2*N] - temporary work space // L[N] --- lower half of A*B // A[N] --- multiplier // B[N] --- multiplicant void MultiplyTop(word *R, word *T, const word *L, const word *A, const word *B, size_t N) { assert(N>=2 && N%2==0); if (N <= s_recursionLimit) s_pTop[N/4](R, A, B, L[N-1]); else { const size_t N2 = N/2; size_t AN2 = Compare(A0, A1, N2) > 0 ? 0 : N2; Subtract(R0, A + AN2, A + (N2 ^ AN2), N2); size_t BN2 = Compare(B0, B1, N2) > 0 ? 0 : N2; Subtract(R1, B + BN2, B + (N2 ^ BN2), N2); RecursiveMultiply(T0, T2, R0, R1, N2); RecursiveMultiply(R0, T2, A1, B1, N2); // now T[01] holds (A1-A0)*(B0-B1) = A1*B0+A0*B1-A1*B1-A0*B0, R[01] holds A1*B1 int t, c3; int c2 = Subtract(T2, L+N2, L, N2); if (AN2 == BN2) { c2 -= Add(T2, T2, T0, N2); t = (Compare(T2, R0, N2) == -1); c3 = t - Subtract(T2, T2, T1, N2); } else { c2 += Subtract(T2, T2, T0, N2); t = (Compare(T2, R0, N2) == -1); c3 = t + Add(T2, T2, T1, N2); } c2 += t; if (c2 >= 0) c3 += Increment(T2, N2, c2); else c3 -= Decrement(T2, N2, -c2); c3 += Add(R0, T2, R1, N2); assert (c3 >= 0 && c3 <= 2); Increment(R1, N2, c3); } } inline void Multiply(word *R, word *T, const word *A, const word *B, size_t N) { RecursiveMultiply(R, T, A, B, N); } inline void Square(word *R, word *T, const word *A, size_t N) { RecursiveSquare(R, T, A, N); } inline void MultiplyBottom(word *R, word *T, const word *A, const word *B, size_t N) { RecursiveMultiplyBottom(R, T, A, B, N); } // R[NA+NB] - result = A*B // T[NA+NB] - temporary work space // A[NA] ---- multiplier // B[NB] ---- multiplicant void AsymmetricMultiply(word *R, word *T, const word *A, size_t NA, const word *B, size_t NB) { if (NA == NB) { if (A == B) Square(R, T, A, NA); else Multiply(R, T, A, B, NA); return; } if (NA > NB) { std::swap(A, B); std::swap(NA, NB); } assert(NB % NA == 0); if (NA==2 && !A[1]) { switch (A[0]) { case 0: SetWords(R, 0, NB+2); return; case 1: CopyWords(R, B, NB); R[NB] = R[NB+1] = 0; return; default: R[NB] = LinearMultiply(R, B, A[0], NB); R[NB+1] = 0; return; } } size_t i; if ((NB/NA)%2 == 0) { Multiply(R, T, A, B, NA); CopyWords(T+2*NA, R+NA, NA); for (i=2*NA; i=4); #define M0 M #define M1 (M+N2) #define V0 V #define V1 (V+N2) #define X0 X #define X1 (X+N2) #define X2 (X+N) #define X3 (X+N+N2) const size_t N2 = N/2; Multiply(T0, T2, V0, X3, N2); int c2 = Add(T0, T0, X0, N); MultiplyBottom(T3, T2, T0, U, N2); MultiplyTop(T2, R, T0, T3, M0, N2); c2 -= Subtract(T2, T1, T2, N2); Multiply(T0, R, T3, M1, N2); c2 -= Subtract(T0, T2, T0, N2); int c3 = -(int)Subtract(T1, X2, T1, N2); Multiply(R0, T2, V1, X3, N2); c3 += Add(R, R, T, N); if (c2>0) c3 += Increment(R1, N2); else if (c2<0) c3 -= Decrement(R1, N2, -c2); assert(c3>=-1 && c3<=1); if (c3>0) Subtract(R, R, M, N); else if (c3<0) Add(R, R, M, N); #undef M0 #undef M1 #undef V0 #undef V1 #undef X0 #undef X1 #undef X2 #undef X3 } #undef A0 #undef A1 #undef B0 #undef B1 #undef T0 #undef T1 #undef T2 #undef T3 #undef R0 #undef R1 #undef R2 #undef R3 /* // do a 3 word by 2 word divide, returns quotient and leaves remainder in A static word SubatomicDivide(word *A, word B0, word B1) { // assert {A[2],A[1]} < {B1,B0}, so quotient can fit in a word assert(A[2] < B1 || (A[2]==B1 && A[1] < B0)); // estimate the quotient: do a 2 word by 1 word divide word Q; if (B1+1 == 0) Q = A[2]; else Q = DWord(A[1], A[2]).DividedBy(B1+1); // now subtract Q*B from A DWord p = DWord::Multiply(B0, Q); DWord u = (DWord) A[0] - p.GetLowHalf(); A[0] = u.GetLowHalf(); u = (DWord) A[1] - p.GetHighHalf() - u.GetHighHalfAsBorrow() - DWord::Multiply(B1, Q); A[1] = u.GetLowHalf(); A[2] += u.GetHighHalf(); // Q <= actual quotient, so fix it while (A[2] || A[1] > B1 || (A[1]==B1 && A[0]>=B0)) { u = (DWord) A[0] - B0; A[0] = u.GetLowHalf(); u = (DWord) A[1] - B1 - u.GetHighHalfAsBorrow(); A[1] = u.GetLowHalf(); A[2] += u.GetHighHalf(); Q++; assert(Q); // shouldn't overflow } return Q; } // do a 4 word by 2 word divide, returns 2 word quotient in Q0 and Q1 static inline void AtomicDivide(word *Q, const word *A, const word *B) { if (!B[0] && !B[1]) // if divisor is 0, we assume divisor==2**(2*WORD_BITS) { Q[0] = A[2]; Q[1] = A[3]; } else { word T[4]; T[0] = A[0]; T[1] = A[1]; T[2] = A[2]; T[3] = A[3]; Q[1] = SubatomicDivide(T+1, B[0], B[1]); Q[0] = SubatomicDivide(T, B[0], B[1]); #ifndef NDEBUG // multiply quotient and divisor and add remainder, make sure it equals dividend assert(!T[2] && !T[3] && (T[1] < B[1] || (T[1]==B[1] && T[0](T, DWord(A[0], A[1]), DWord(A[2], A[3]), DWord(B[0], B[1])); Q[0] = q.GetLowHalf(); Q[1] = q.GetHighHalf(); #ifndef NDEBUG if (B[0] || B[1]) { // multiply quotient and divisor and add remainder, make sure it equals dividend assert(!T[2] && !T[3] && (T[1] < B[1] || (T[1]==B[1] && T[0]= 0) { R[N] -= Subtract(R, R, B, N); Q[1] += (++Q[0]==0); assert(Q[0] || Q[1]); // no overflow } } // R[NB] -------- remainder = A%B // Q[NA-NB+2] --- quotient = A/B // T[NA+3*(NB+2)] - temp work space // A[NA] -------- dividend // B[NB] -------- divisor void Divide(word *R, word *Q, word *T, const word *A, size_t NA, const word *B, size_t NB) { assert(NA && NB && NA%2==0 && NB%2==0); assert(B[NB-1] || B[NB-2]); assert(NB <= NA); // set up temporary work space word *const TA=T; word *const TB=T+NA+2; word *const TP=T+NA+2+NB; // copy B into TB and normalize it so that TB has highest bit set to 1 unsigned shiftWords = (B[NB-1]==0); TB[0] = TB[NB-1] = 0; CopyWords(TB+shiftWords, B, NB-shiftWords); unsigned shiftBits = WORD_BITS - BitPrecision(TB[NB-1]); assert(shiftBits < WORD_BITS); ShiftWordsLeftByBits(TB, NB, shiftBits); // copy A into TA and normalize it TA[0] = TA[NA] = TA[NA+1] = 0; CopyWords(TA+shiftWords, A, NA); ShiftWordsLeftByBits(TA, NA+2, shiftBits); if (TA[NA+1]==0 && TA[NA] <= 1) { Q[NA-NB+1] = Q[NA-NB] = 0; while (TA[NA] || Compare(TA+NA-NB, TB, NB) >= 0) { TA[NA] -= Subtract(TA+NA-NB, TA+NA-NB, TB, NB); ++Q[NA-NB]; } } else { NA+=2; assert(Compare(TA+NA-NB, TB, NB) < 0); } word BT[2]; BT[0] = TB[NB-2] + 1; BT[1] = TB[NB-1] + (BT[0]==0); // start reducing TA mod TB, 2 words at a time for (size_t i=NA-2; i>=NB; i-=2) { AtomicDivide(Q+i-NB, TA+i-2, BT); CorrectQuotientEstimate(TA+i-NB, TP, Q+i-NB, TB, NB); } // copy TA into R, and denormalize it CopyWords(R, TA+shiftWords, NB); ShiftWordsRightByBits(R, NB, shiftBits); } static inline size_t EvenWordCount(const word *X, size_t N) { while (N && X[N-2]==0 && X[N-1]==0) N-=2; return N; } // return k // R[N] --- result = A^(-1) * 2^k mod M // T[4*N] - temporary work space // A[NA] -- number to take inverse of // M[N] --- modulus unsigned int AlmostInverse(word *R, word *T, const word *A, size_t NA, const word *M, size_t N) { assert(NA<=N && N && N%2==0); word *b = T; word *c = T+N; word *f = T+2*N; word *g = T+3*N; size_t bcLen=2, fgLen=EvenWordCount(M, N); unsigned int k=0; bool s=false; SetWords(T, 0, 3*N); b[0]=1; CopyWords(f, A, NA); CopyWords(g, M, N); while (1) { word t=f[0]; while (!t) { if (EvenWordCount(f, fgLen)==0) { SetWords(R, 0, N); return 0; } ShiftWordsRightByWords(f, fgLen, 1); bcLen += 2 * (c[bcLen-1] != 0); assert(bcLen <= N); ShiftWordsLeftByWords(c, bcLen, 1); k+=WORD_BITS; t=f[0]; } unsigned int i = TrailingZeros(t); t >>= i; k += i; if (t==1 && f[1]==0 && EvenWordCount(f+2, fgLen-2)==0) { if (s) Subtract(R, M, b, N); else CopyWords(R, b, N); return k; } ShiftWordsRightByBits(f, fgLen, i); t = ShiftWordsLeftByBits(c, bcLen, i); c[bcLen] += t; bcLen += 2 * (t!=0); assert(bcLen <= N); bool swap = Compare(f, g, fgLen)==-1; ConditionalSwapPointers(swap, f, g); ConditionalSwapPointers(swap, b, c); s ^= swap; fgLen -= 2 * !(f[fgLen-2] | f[fgLen-1]); Subtract(f, f, g, fgLen); t = Add(b, b, c, bcLen); b[bcLen] += t; bcLen += 2*t; assert(bcLen <= N); } } // R[N] - result = A/(2^k) mod M // A[N] - input // M[N] - modulus void DivideByPower2Mod(word *R, const word *A, size_t k, const word *M, size_t N) { CopyWords(R, A, N); while (k--) { if (R[0]%2==0) ShiftWordsRightByBits(R, N, 1); else { word carry = Add(R, R, M, N); ShiftWordsRightByBits(R, N, 1); R[N-1] += carry<<(WORD_BITS-1); } } } // R[N] - result = A*(2^k) mod M // A[N] - input // M[N] - modulus void MultiplyByPower2Mod(word *R, const word *A, size_t k, const word *M, size_t N) { CopyWords(R, A, N); while (k--) if (ShiftWordsLeftByBits(R, N, 1) || Compare(R, M, N)>=0) Subtract(R, R, M, N); } // ****************************************************************** InitializeInteger::InitializeInteger() { if (!g_pAssignIntToInteger) { SetFunctionPointers(); g_pAssignIntToInteger = AssignIntToInteger; } } static const unsigned int RoundupSizeTable[] = {2, 2, 2, 4, 4, 8, 8, 8, 8}; static inline size_t RoundupSize(size_t n) { if (n<=8) return RoundupSizeTable[n]; else if (n<=16) return 16; else if (n<=32) return 32; else if (n<=64) return 64; else return size_t(1) << BitPrecision(n-1); } Integer::Integer() : reg(2), sign(POSITIVE) { reg[0] = reg[1] = 0; } Integer::Integer(const Integer& t) : reg(RoundupSize(t.WordCount())), sign(t.sign) { CopyWords(reg, t.reg, reg.size()); } Integer::Integer(Sign s, lword value) : reg(2), sign(s) { reg[0] = word(value); reg[1] = word(SafeRightShift(value)); } Integer::Integer(signed long value) : reg(2) { if (value >= 0) sign = POSITIVE; else { sign = NEGATIVE; value = -value; } reg[0] = word(value); reg[1] = word(SafeRightShift((unsigned long)value)); } Integer::Integer(Sign s, word high, word low) : reg(2), sign(s) { reg[0] = low; reg[1] = high; } bool Integer::IsConvertableToLong() const { if (ByteCount() > sizeof(long)) return false; unsigned long value = (unsigned long)reg[0]; value += SafeLeftShift((unsigned long)reg[1]); if (sign==POSITIVE) return (signed long)value >= 0; else return -(signed long)value < 0; } signed long Integer::ConvertToLong() const { assert(IsConvertableToLong()); unsigned long value = (unsigned long)reg[0]; value += SafeLeftShift((unsigned long)reg[1]); return sign==POSITIVE ? value : -(signed long)value; } Integer::Integer(BufferedTransformation &encodedInteger, size_t byteCount, Signedness s) { Decode(encodedInteger, byteCount, s); } Integer::Integer(const byte *encodedInteger, size_t byteCount, Signedness s) { Decode(encodedInteger, byteCount, s); } Integer::Integer(BufferedTransformation &bt) { BERDecode(bt); } Integer::Integer(RandomNumberGenerator &rng, size_t bitcount) { Randomize(rng, bitcount); } Integer::Integer(RandomNumberGenerator &rng, const Integer &min, const Integer &max, RandomNumberType rnType, const Integer &equiv, const Integer &mod) { if (!Randomize(rng, min, max, rnType, equiv, mod)) throw Integer::RandomNumberNotFound(); } Integer Integer::Power2(size_t e) { Integer r((word)0, BitsToWords(e+1)); r.SetBit(e); return r; } template struct NewInteger { Integer * operator()() const { return new Integer(i); } }; const Integer &Integer::Zero() { return Singleton().Ref(); } const Integer &Integer::One() { return Singleton >().Ref(); } const Integer &Integer::Two() { return Singleton >().Ref(); } bool Integer::operator!() const { return IsNegative() ? false : (reg[0]==0 && WordCount()==0); } Integer& Integer::operator=(const Integer& t) { if (this != &t) { if (reg.size() != t.reg.size() || t.reg[t.reg.size()/2] == 0) reg.New(RoundupSize(t.WordCount())); CopyWords(reg, t.reg, reg.size()); sign = t.sign; } return *this; } bool Integer::GetBit(size_t n) const { if (n/WORD_BITS >= reg.size()) return 0; else return bool((reg[n/WORD_BITS] >> (n % WORD_BITS)) & 1); } void Integer::SetBit(size_t n, bool value) { if (value) { reg.CleanGrow(RoundupSize(BitsToWords(n+1))); reg[n/WORD_BITS] |= (word(1) << (n%WORD_BITS)); } else { if (n/WORD_BITS < reg.size()) reg[n/WORD_BITS] &= ~(word(1) << (n%WORD_BITS)); } } byte Integer::GetByte(size_t n) const { if (n/WORD_SIZE >= reg.size()) return 0; else return byte(reg[n/WORD_SIZE] >> ((n%WORD_SIZE)*8)); } void Integer::SetByte(size_t n, byte value) { reg.CleanGrow(RoundupSize(BytesToWords(n+1))); reg[n/WORD_SIZE] &= ~(word(0xff) << 8*(n%WORD_SIZE)); reg[n/WORD_SIZE] |= (word(value) << 8*(n%WORD_SIZE)); } lword Integer::GetBits(size_t i, size_t n) const { lword v = 0; assert(n <= sizeof(v)*8); for (unsigned int j=0; j static Integer StringToInteger(const T *str) { int radix; // GCC workaround // std::char_traits::length() not defined in GCC 3.2 and STLport 4.5.3 unsigned int length; for (length = 0; str[length] != 0; length++) {} Integer v; if (length == 0) return v; switch (str[length-1]) { case 'h': case 'H': radix=16; break; case 'o': case 'O': radix=8; break; case 'b': case 'B': radix=2; break; default: radix=10; } if (length > 2 && str[0] == '0' && str[1] == 'x') radix = 16; for (unsigned i=0; i= '0' && str[i] <= '9') digit = str[i] - '0'; else if (str[i] >= 'A' && str[i] <= 'F') digit = str[i] - 'A' + 10; else if (str[i] >= 'a' && str[i] <= 'f') digit = str[i] - 'a' + 10; else digit = radix; if (digit < radix) { v *= radix; v += digit; } } if (str[0] == '-') v.Negate(); return v; } Integer::Integer(const char *str) : reg(2), sign(POSITIVE) { *this = StringToInteger(str); } Integer::Integer(const wchar_t *str) : reg(2), sign(POSITIVE) { *this = StringToInteger(str); } unsigned int Integer::WordCount() const { return (unsigned int)CountWords(reg, reg.size()); } unsigned int Integer::ByteCount() const { unsigned wordCount = WordCount(); if (wordCount) return (wordCount-1)*WORD_SIZE + BytePrecision(reg[wordCount-1]); else return 0; } unsigned int Integer::BitCount() const { unsigned wordCount = WordCount(); if (wordCount) return (wordCount-1)*WORD_BITS + BitPrecision(reg[wordCount-1]); else return 0; } void Integer::Decode(const byte *input, size_t inputLen, Signedness s) { StringStore store(input, inputLen); Decode(store, inputLen, s); } void Integer::Decode(BufferedTransformation &bt, size_t inputLen, Signedness s) { assert(bt.MaxRetrievable() >= inputLen); byte b; bt.Peek(b); sign = ((s==SIGNED) && (b & 0x80)) ? NEGATIVE : POSITIVE; while (inputLen>0 && (sign==POSITIVE ? b==0 : b==0xff)) { bt.Skip(1); inputLen--; bt.Peek(b); } reg.CleanNew(RoundupSize(BytesToWords(inputLen))); for (size_t i=inputLen; i > 0; i--) { bt.Get(b); reg[(i-1)/WORD_SIZE] |= word(b) << ((i-1)%WORD_SIZE)*8; } if (sign == NEGATIVE) { for (size_t i=inputLen; i 0; i--) bt.Put(GetByte(i-1)); } else { // take two's complement of *this Integer temp = Integer::Power2(8*STDMAX((size_t)ByteCount(), outputLen)) + *this; temp.Encode(bt, outputLen, UNSIGNED); } } void Integer::DEREncode(BufferedTransformation &bt) const { DERGeneralEncoder enc(bt, INTEGER); Encode(enc, MinEncodedSize(SIGNED), SIGNED); enc.MessageEnd(); } void Integer::BERDecode(const byte *input, size_t len) { StringStore store(input, len); BERDecode(store); } void Integer::BERDecode(BufferedTransformation &bt) { BERGeneralDecoder dec(bt, INTEGER); if (!dec.IsDefiniteLength() || dec.MaxRetrievable() < dec.RemainingLength()) BERDecodeError(); Decode(dec, (size_t)dec.RemainingLength(), SIGNED); dec.MessageEnd(); } void Integer::DEREncodeAsOctetString(BufferedTransformation &bt, size_t length) const { DERGeneralEncoder enc(bt, OCTET_STRING); Encode(enc, length); enc.MessageEnd(); } void Integer::BERDecodeAsOctetString(BufferedTransformation &bt, size_t length) { BERGeneralDecoder dec(bt, OCTET_STRING); if (!dec.IsDefiniteLength() || dec.RemainingLength() != length) BERDecodeError(); Decode(dec, length); dec.MessageEnd(); } size_t Integer::OpenPGPEncode(byte *output, size_t len) const { ArraySink sink(output, len); return OpenPGPEncode(sink); } size_t Integer::OpenPGPEncode(BufferedTransformation &bt) const { word16 bitCount = BitCount(); bt.PutWord16(bitCount); size_t byteCount = BitsToBytes(bitCount); Encode(bt, byteCount); return 2 + byteCount; } void Integer::OpenPGPDecode(const byte *input, size_t len) { StringStore store(input, len); OpenPGPDecode(store); } void Integer::OpenPGPDecode(BufferedTransformation &bt) { word16 bitCount; if (bt.GetWord16(bitCount) != 2 || bt.MaxRetrievable() < BitsToBytes(bitCount)) throw OpenPGPDecodeErr(); Decode(bt, BitsToBytes(bitCount)); } void Integer::Randomize(RandomNumberGenerator &rng, size_t nbits) { const size_t nbytes = nbits/8 + 1; SecByteBlock buf(nbytes); rng.GenerateBlock(buf, nbytes); if (nbytes) buf[0] = (byte)Crop(buf[0], nbits % 8); Decode(buf, nbytes, UNSIGNED); } void Integer::Randomize(RandomNumberGenerator &rng, const Integer &min, const Integer &max) { if (min > max) throw InvalidArgument("Integer: Min must be no greater than Max"); Integer range = max - min; const unsigned int nbits = range.BitCount(); do { Randomize(rng, nbits); } while (*this > range); *this += min; } bool Integer::Randomize(RandomNumberGenerator &rng, const Integer &min, const Integer &max, RandomNumberType rnType, const Integer &equiv, const Integer &mod) { return GenerateRandomNoThrow(rng, MakeParameters("Min", min)("Max", max)("RandomNumberType", rnType)("EquivalentTo", equiv)("Mod", mod)); } class KDF2_RNG : public RandomNumberGenerator { public: KDF2_RNG(const byte *seed, size_t seedSize) : m_counter(0), m_counterAndSeed(seedSize + 4) { memcpy(m_counterAndSeed + 4, seed, seedSize); } void GenerateBlock(byte *output, size_t size) { PutWord(false, BIG_ENDIAN_ORDER, m_counterAndSeed, m_counter); ++m_counter; P1363_KDF2::DeriveKey(output, size, m_counterAndSeed, m_counterAndSeed.size(), NULL, 0); } private: word32 m_counter; SecByteBlock m_counterAndSeed; }; bool Integer::GenerateRandomNoThrow(RandomNumberGenerator &i_rng, const NameValuePairs ¶ms) { Integer min = params.GetValueWithDefault("Min", Integer::Zero()); Integer max; if (!params.GetValue("Max", max)) { int bitLength; if (params.GetIntValue("BitLength", bitLength)) max = Integer::Power2(bitLength); else throw InvalidArgument("Integer: missing Max argument"); } if (min > max) throw InvalidArgument("Integer: Min must be no greater than Max"); Integer equiv = params.GetValueWithDefault("EquivalentTo", Integer::Zero()); Integer mod = params.GetValueWithDefault("Mod", Integer::One()); if (equiv.IsNegative() || equiv >= mod) throw InvalidArgument("Integer: invalid EquivalentTo and/or Mod argument"); Integer::RandomNumberType rnType = params.GetValueWithDefault("RandomNumberType", Integer::ANY); member_ptr kdf2Rng; ConstByteArrayParameter seed; if (params.GetValue(Name::Seed(), seed)) { ByteQueue bq; DERSequenceEncoder seq(bq); min.DEREncode(seq); max.DEREncode(seq); equiv.DEREncode(seq); mod.DEREncode(seq); DEREncodeUnsigned(seq, rnType); DEREncodeOctetString(seq, seed.begin(), seed.size()); seq.MessageEnd(); SecByteBlock finalSeed((size_t)bq.MaxRetrievable()); bq.Get(finalSeed, finalSeed.size()); kdf2Rng.reset(new KDF2_RNG(finalSeed.begin(), finalSeed.size())); } RandomNumberGenerator &rng = kdf2Rng.get() ? (RandomNumberGenerator &)*kdf2Rng : i_rng; switch (rnType) { case ANY: if (mod == One()) Randomize(rng, min, max); else { Integer min1 = min + (equiv-min)%mod; if (max < min1) return false; Randomize(rng, Zero(), (max - min1) / mod); *this *= mod; *this += min1; } return true; case PRIME: { const PrimeSelector *pSelector = params.GetValueWithDefault(Name::PointerToPrimeSelector(), (const PrimeSelector *)NULL); int i; i = 0; while (1) { if (++i==16) { // check if there are any suitable primes in [min, max] Integer first = min; if (FirstPrime(first, max, equiv, mod, pSelector)) { // if there is only one suitable prime, we're done *this = first; if (!FirstPrime(first, max, equiv, mod, pSelector)) return true; } else return false; } Randomize(rng, min, max); if (FirstPrime(*this, STDMIN(*this+mod*PrimeSearchInterval(max), max), equiv, mod, pSelector)) return true; } } default: throw InvalidArgument("Integer: invalid RandomNumberType argument"); } } std::istream& operator>>(std::istream& in, Integer &a) { char c; unsigned int length = 0; SecBlock str(length + 16); std::ws(in); do { in.read(&c, 1); str[length++] = c; if (length >= str.size()) str.Grow(length + 16); } while (in && (c=='-' || c=='x' || (c>='0' && c<='9') || (c>='a' && c<='f') || (c>='A' && c<='F') || c=='h' || c=='H' || c=='o' || c=='O' || c==',' || c=='.')); if (in.gcount()) in.putback(c); str[length-1] = '\0'; a = Integer(str); return in; } std::ostream& operator<<(std::ostream& out, const Integer &a) { // Get relevant conversion specifications from ostream. long f = out.flags() & std::ios::basefield; // Get base digits. int base, block; char suffix; switch(f) { case std::ios::oct : base = 8; block = 8; suffix = 'o'; break; case std::ios::hex : base = 16; block = 4; suffix = 'h'; break; default : base = 10; block = 3; suffix = '.'; } Integer temp1=a, temp2; if (a.IsNegative()) { out << '-'; temp1.Negate(); } if (!a) out << '0'; static const char upper[]="0123456789ABCDEF"; static const char lower[]="0123456789abcdef"; const char* vec = (out.flags() & std::ios::uppercase) ? upper : lower; unsigned i=0; SecBlock s(a.BitCount() / (BitPrecision(base)-1) + 1); while (!!temp1) { word digit; Integer::Divide(digit, temp2, temp1, base); s[i++]=vec[digit]; temp1.swap(temp2); } while (i--) { out << s[i]; // if (i && !(i%block)) // out << ","; } return out << suffix; } Integer& Integer::operator++() { if (NotNegative()) { if (Increment(reg, reg.size())) { reg.CleanGrow(2*reg.size()); reg[reg.size()/2]=1; } } else { word borrow = Decrement(reg, reg.size()); assert(!borrow); if (WordCount()==0) *this = Zero(); } return *this; } Integer& Integer::operator--() { if (IsNegative()) { if (Increment(reg, reg.size())) { reg.CleanGrow(2*reg.size()); reg[reg.size()/2]=1; } } else { if (Decrement(reg, reg.size())) *this = -One(); } return *this; } void PositiveAdd(Integer &sum, const Integer &a, const Integer& b) { int carry; if (a.reg.size() == b.reg.size()) carry = Add(sum.reg, a.reg, b.reg, a.reg.size()); else if (a.reg.size() > b.reg.size()) { carry = Add(sum.reg, a.reg, b.reg, b.reg.size()); CopyWords(sum.reg+b.reg.size(), a.reg+b.reg.size(), a.reg.size()-b.reg.size()); carry = Increment(sum.reg+b.reg.size(), a.reg.size()-b.reg.size(), carry); } else { carry = Add(sum.reg, a.reg, b.reg, a.reg.size()); CopyWords(sum.reg+a.reg.size(), b.reg+a.reg.size(), b.reg.size()-a.reg.size()); carry = Increment(sum.reg+a.reg.size(), b.reg.size()-a.reg.size(), carry); } if (carry) { sum.reg.CleanGrow(2*sum.reg.size()); sum.reg[sum.reg.size()/2] = 1; } sum.sign = Integer::POSITIVE; } void PositiveSubtract(Integer &diff, const Integer &a, const Integer& b) { unsigned aSize = a.WordCount(); aSize += aSize%2; unsigned bSize = b.WordCount(); bSize += bSize%2; if (aSize == bSize) { if (Compare(a.reg, b.reg, aSize) >= 0) { Subtract(diff.reg, a.reg, b.reg, aSize); diff.sign = Integer::POSITIVE; } else { Subtract(diff.reg, b.reg, a.reg, aSize); diff.sign = Integer::NEGATIVE; } } else if (aSize > bSize) { word borrow = Subtract(diff.reg, a.reg, b.reg, bSize); CopyWords(diff.reg+bSize, a.reg+bSize, aSize-bSize); borrow = Decrement(diff.reg+bSize, aSize-bSize, borrow); assert(!borrow); diff.sign = Integer::POSITIVE; } else { word borrow = Subtract(diff.reg, b.reg, a.reg, aSize); CopyWords(diff.reg+aSize, b.reg+aSize, bSize-aSize); borrow = Decrement(diff.reg+aSize, bSize-aSize, borrow); assert(!borrow); diff.sign = Integer::NEGATIVE; } } // MSVC .NET 2003 workaround template inline const T& STDMAX2(const T& a, const T& b) { return a < b ? b : a; } Integer Integer::Plus(const Integer& b) const { Integer sum((word)0, STDMAX2(reg.size(), b.reg.size())); if (NotNegative()) { if (b.NotNegative()) PositiveAdd(sum, *this, b); else PositiveSubtract(sum, *this, b); } else { if (b.NotNegative()) PositiveSubtract(sum, b, *this); else { PositiveAdd(sum, *this, b); sum.sign = Integer::NEGATIVE; } } return sum; } Integer& Integer::operator+=(const Integer& t) { reg.CleanGrow(t.reg.size()); if (NotNegative()) { if (t.NotNegative()) PositiveAdd(*this, *this, t); else PositiveSubtract(*this, *this, t); } else { if (t.NotNegative()) PositiveSubtract(*this, t, *this); else { PositiveAdd(*this, *this, t); sign = Integer::NEGATIVE; } } return *this; } Integer Integer::Minus(const Integer& b) const { Integer diff((word)0, STDMAX2(reg.size(), b.reg.size())); if (NotNegative()) { if (b.NotNegative()) PositiveSubtract(diff, *this, b); else PositiveAdd(diff, *this, b); } else { if (b.NotNegative()) { PositiveAdd(diff, *this, b); diff.sign = Integer::NEGATIVE; } else PositiveSubtract(diff, b, *this); } return diff; } Integer& Integer::operator-=(const Integer& t) { reg.CleanGrow(t.reg.size()); if (NotNegative()) { if (t.NotNegative()) PositiveSubtract(*this, *this, t); else PositiveAdd(*this, *this, t); } else { if (t.NotNegative()) { PositiveAdd(*this, *this, t); sign = Integer::NEGATIVE; } else PositiveSubtract(*this, t, *this); } return *this; } Integer& Integer::operator<<=(size_t n) { const size_t wordCount = WordCount(); const size_t shiftWords = n / WORD_BITS; const unsigned int shiftBits = (unsigned int)(n % WORD_BITS); reg.CleanGrow(RoundupSize(wordCount+BitsToWords(n))); ShiftWordsLeftByWords(reg, wordCount + shiftWords, shiftWords); ShiftWordsLeftByBits(reg+shiftWords, wordCount+BitsToWords(shiftBits), shiftBits); return *this; } Integer& Integer::operator>>=(size_t n) { const size_t wordCount = WordCount(); const size_t shiftWords = n / WORD_BITS; const unsigned int shiftBits = (unsigned int)(n % WORD_BITS); ShiftWordsRightByWords(reg, wordCount, shiftWords); if (wordCount > shiftWords) ShiftWordsRightByBits(reg, wordCount-shiftWords, shiftBits); if (IsNegative() && WordCount()==0) // avoid -0 *this = Zero(); return *this; } void PositiveMultiply(Integer &product, const Integer &a, const Integer &b) { size_t aSize = RoundupSize(a.WordCount()); size_t bSize = RoundupSize(b.WordCount()); product.reg.CleanNew(RoundupSize(aSize+bSize)); product.sign = Integer::POSITIVE; IntegerSecBlock workspace(aSize + bSize); AsymmetricMultiply(product.reg, workspace, a.reg, aSize, b.reg, bSize); } void Multiply(Integer &product, const Integer &a, const Integer &b) { PositiveMultiply(product, a, b); if (a.NotNegative() != b.NotNegative()) product.Negate(); } Integer Integer::Times(const Integer &b) const { Integer product; Multiply(product, *this, b); return product; } /* void PositiveDivide(Integer &remainder, Integer "ient, const Integer ÷nd, const Integer &divisor) { remainder.reg.CleanNew(divisor.reg.size()); remainder.sign = Integer::POSITIVE; quotient.reg.New(0); quotient.sign = Integer::POSITIVE; unsigned i=dividend.BitCount(); while (i--) { word overflow = ShiftWordsLeftByBits(remainder.reg, remainder.reg.size(), 1); remainder.reg[0] |= dividend[i]; if (overflow || remainder >= divisor) { Subtract(remainder.reg, remainder.reg, divisor.reg, remainder.reg.size()); quotient.SetBit(i); } } } */ void PositiveDivide(Integer &remainder, Integer "ient, const Integer &a, const Integer &b) { unsigned aSize = a.WordCount(); unsigned bSize = b.WordCount(); if (!bSize) throw Integer::DivideByZero(); if (aSize < bSize) { remainder = a; remainder.sign = Integer::POSITIVE; quotient = Integer::Zero(); return; } aSize += aSize%2; // round up to next even number bSize += bSize%2; remainder.reg.CleanNew(RoundupSize(bSize)); remainder.sign = Integer::POSITIVE; quotient.reg.CleanNew(RoundupSize(aSize-bSize+2)); quotient.sign = Integer::POSITIVE; IntegerSecBlock T(aSize+3*(bSize+2)); Divide(remainder.reg, quotient.reg, T, a.reg, aSize, b.reg, bSize); } void Integer::Divide(Integer &remainder, Integer "ient, const Integer ÷nd, const Integer &divisor) { PositiveDivide(remainder, quotient, dividend, divisor); if (dividend.IsNegative()) { quotient.Negate(); if (remainder.NotZero()) { --quotient; remainder = divisor.AbsoluteValue() - remainder; } } if (divisor.IsNegative()) quotient.Negate(); } void Integer::DivideByPowerOf2(Integer &r, Integer &q, const Integer &a, unsigned int n) { q = a; q >>= n; const size_t wordCount = BitsToWords(n); if (wordCount <= a.WordCount()) { r.reg.resize(RoundupSize(wordCount)); CopyWords(r.reg, a.reg, wordCount); SetWords(r.reg+wordCount, 0, r.reg.size()-wordCount); if (n % WORD_BITS != 0) r.reg[wordCount-1] %= (word(1) << (n % WORD_BITS)); } else { r.reg.resize(RoundupSize(a.WordCount())); CopyWords(r.reg, a.reg, r.reg.size()); } r.sign = POSITIVE; if (a.IsNegative() && r.NotZero()) { --q; r = Power2(n) - r; } } Integer Integer::DividedBy(const Integer &b) const { Integer remainder, quotient; Integer::Divide(remainder, quotient, *this, b); return quotient; } Integer Integer::Modulo(const Integer &b) const { Integer remainder, quotient; Integer::Divide(remainder, quotient, *this, b); return remainder; } void Integer::Divide(word &remainder, Integer "ient, const Integer ÷nd, word divisor) { if (!divisor) throw Integer::DivideByZero(); assert(divisor); if ((divisor & (divisor-1)) == 0) // divisor is a power of 2 { quotient = dividend >> (BitPrecision(divisor)-1); remainder = dividend.reg[0] & (divisor-1); return; } unsigned int i = dividend.WordCount(); quotient.reg.CleanNew(RoundupSize(i)); remainder = 0; while (i--) { quotient.reg[i] = DWord(dividend.reg[i], remainder) / divisor; remainder = DWord(dividend.reg[i], remainder) % divisor; } if (dividend.NotNegative()) quotient.sign = POSITIVE; else { quotient.sign = NEGATIVE; if (remainder) { --quotient; remainder = divisor - remainder; } } } Integer Integer::DividedBy(word b) const { word remainder; Integer quotient; Integer::Divide(remainder, quotient, *this, b); return quotient; } word Integer::Modulo(word divisor) const { if (!divisor) throw Integer::DivideByZero(); assert(divisor); word remainder; if ((divisor & (divisor-1)) == 0) // divisor is a power of 2 remainder = reg[0] & (divisor-1); else { unsigned int i = WordCount(); if (divisor <= 5) { DWord sum(0, 0); while (i--) sum += reg[i]; remainder = sum % divisor; } else { remainder = 0; while (i--) remainder = DWord(reg[i], remainder) % divisor; } } if (IsNegative() && remainder) remainder = divisor - remainder; return remainder; } void Integer::Negate() { if (!!(*this)) // don't flip sign if *this==0 sign = Sign(1-sign); } int Integer::PositiveCompare(const Integer& t) const { unsigned size = WordCount(), tSize = t.WordCount(); if (size == tSize) return CryptoPP::Compare(reg, t.reg, size); else return size > tSize ? 1 : -1; } int Integer::Compare(const Integer& t) const { if (NotNegative()) { if (t.NotNegative()) return PositiveCompare(t); else return 1; } else { if (t.NotNegative()) return -1; else return -PositiveCompare(t); } } Integer Integer::SquareRoot() const { if (!IsPositive()) return Zero(); // overestimate square root Integer x, y = Power2((BitCount()+1)/2); assert(y*y >= *this); do { x = y; y = (x + *this/x) >> 1; } while (y().Gcd(a, b); } Integer Integer::InverseMod(const Integer &m) const { assert(m.NotNegative()); if (IsNegative()) return Modulo(m).InverseMod(m); if (m.IsEven()) { if (!m || IsEven()) return Zero(); // no inverse if (*this == One()) return One(); Integer u = m.Modulo(*this).InverseMod(*this); return !u ? Zero() : (m*(*this-u)+1)/(*this); } SecBlock T(m.reg.size() * 4); Integer r((word)0, m.reg.size()); unsigned k = AlmostInverse(r.reg, T, reg, reg.size(), m.reg, m.reg.size()); DivideByPower2Mod(r.reg, r.reg, k, m.reg, m.reg.size()); return r; } word Integer::InverseMod(word mod) const { word g0 = mod, g1 = *this % mod; word v0 = 0, v1 = 1; word y; while (g1) { if (g1 == 1) return v1; y = g0 / g1; g0 = g0 % g1; v0 += y * v1; if (!g0) break; if (g0 == 1) return mod-v0; y = g1 / g0; g1 = g1 % g0; v1 += y * v0; } return 0; } // ******************************************************** ModularArithmetic::ModularArithmetic(BufferedTransformation &bt) { BERSequenceDecoder seq(bt); OID oid(seq); if (oid != ASN1::prime_field()) BERDecodeError(); m_modulus.BERDecode(seq); seq.MessageEnd(); m_result.reg.resize(m_modulus.reg.size()); } void ModularArithmetic::DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); ASN1::prime_field().DEREncode(seq); m_modulus.DEREncode(seq); seq.MessageEnd(); } void ModularArithmetic::DEREncodeElement(BufferedTransformation &out, const Element &a) const { a.DEREncodeAsOctetString(out, MaxElementByteLength()); } void ModularArithmetic::BERDecodeElement(BufferedTransformation &in, Element &a) const { a.BERDecodeAsOctetString(in, MaxElementByteLength()); } const Integer& ModularArithmetic::Half(const Integer &a) const { if (a.reg.size()==m_modulus.reg.size()) { CryptoPP::DivideByPower2Mod(m_result.reg.begin(), a.reg, 1, m_modulus.reg, a.reg.size()); return m_result; } else return m_result1 = (a.IsEven() ? (a >> 1) : ((a+m_modulus) >> 1)); } const Integer& ModularArithmetic::Add(const Integer &a, const Integer &b) const { if (a.reg.size()==m_modulus.reg.size() && b.reg.size()==m_modulus.reg.size()) { if (CryptoPP::Add(m_result.reg.begin(), a.reg, b.reg, a.reg.size()) || Compare(m_result.reg, m_modulus.reg, a.reg.size()) >= 0) { CryptoPP::Subtract(m_result.reg.begin(), m_result.reg, m_modulus.reg, a.reg.size()); } return m_result; } else { m_result1 = a+b; if (m_result1 >= m_modulus) m_result1 -= m_modulus; return m_result1; } } Integer& ModularArithmetic::Accumulate(Integer &a, const Integer &b) const { if (a.reg.size()==m_modulus.reg.size() && b.reg.size()==m_modulus.reg.size()) { if (CryptoPP::Add(a.reg, a.reg, b.reg, a.reg.size()) || Compare(a.reg, m_modulus.reg, a.reg.size()) >= 0) { CryptoPP::Subtract(a.reg, a.reg, m_modulus.reg, a.reg.size()); } } else { a+=b; if (a>=m_modulus) a-=m_modulus; } return a; } const Integer& ModularArithmetic::Subtract(const Integer &a, const Integer &b) const { if (a.reg.size()==m_modulus.reg.size() && b.reg.size()==m_modulus.reg.size()) { if (CryptoPP::Subtract(m_result.reg.begin(), a.reg, b.reg, a.reg.size())) CryptoPP::Add(m_result.reg.begin(), m_result.reg, m_modulus.reg, a.reg.size()); return m_result; } else { m_result1 = a-b; if (m_result1.IsNegative()) m_result1 += m_modulus; return m_result1; } } Integer& ModularArithmetic::Reduce(Integer &a, const Integer &b) const { if (a.reg.size()==m_modulus.reg.size() && b.reg.size()==m_modulus.reg.size()) { if (CryptoPP::Subtract(a.reg, a.reg, b.reg, a.reg.size())) CryptoPP::Add(a.reg, a.reg, m_modulus.reg, a.reg.size()); } else { a-=b; if (a.IsNegative()) a+=m_modulus; } return a; } const Integer& ModularArithmetic::Inverse(const Integer &a) const { if (!a) return a; CopyWords(m_result.reg.begin(), m_modulus.reg, m_modulus.reg.size()); if (CryptoPP::Subtract(m_result.reg.begin(), m_result.reg, a.reg, a.reg.size())) Decrement(m_result.reg.begin()+a.reg.size(), m_modulus.reg.size()-a.reg.size()); return m_result; } Integer ModularArithmetic::CascadeExponentiate(const Integer &x, const Integer &e1, const Integer &y, const Integer &e2) const { if (m_modulus.IsOdd()) { MontgomeryRepresentation dr(m_modulus); return dr.ConvertOut(dr.CascadeExponentiate(dr.ConvertIn(x), e1, dr.ConvertIn(y), e2)); } else return AbstractRing::CascadeExponentiate(x, e1, y, e2); } void ModularArithmetic::SimultaneousExponentiate(Integer *results, const Integer &base, const Integer *exponents, unsigned int exponentsCount) const { if (m_modulus.IsOdd()) { MontgomeryRepresentation dr(m_modulus); dr.SimultaneousExponentiate(results, dr.ConvertIn(base), exponents, exponentsCount); for (unsigned int i=0; i::SimultaneousExponentiate(results, base, exponents, exponentsCount); } MontgomeryRepresentation::MontgomeryRepresentation(const Integer &m) // modulus must be odd : ModularArithmetic(m), m_u((word)0, m_modulus.reg.size()), m_workspace(5*m_modulus.reg.size()) { if (!m_modulus.IsOdd()) throw InvalidArgument("MontgomeryRepresentation: Montgomery representation requires an odd modulus"); RecursiveInverseModPower2(m_u.reg, m_workspace, m_modulus.reg, m_modulus.reg.size()); } const Integer& MontgomeryRepresentation::Multiply(const Integer &a, const Integer &b) const { word *const T = m_workspace.begin(); word *const R = m_result.reg.begin(); const size_t N = m_modulus.reg.size(); assert(a.reg.size()<=N && b.reg.size()<=N); AsymmetricMultiply(T, T+2*N, a.reg, a.reg.size(), b.reg, b.reg.size()); SetWords(T+a.reg.size()+b.reg.size(), 0, 2*N-a.reg.size()-b.reg.size()); MontgomeryReduce(R, T+2*N, T, m_modulus.reg, m_u.reg, N); return m_result; } const Integer& MontgomeryRepresentation::Square(const Integer &a) const { word *const T = m_workspace.begin(); word *const R = m_result.reg.begin(); const size_t N = m_modulus.reg.size(); assert(a.reg.size()<=N); CryptoPP::Square(T, T+2*N, a.reg, a.reg.size()); SetWords(T+2*a.reg.size(), 0, 2*N-2*a.reg.size()); MontgomeryReduce(R, T+2*N, T, m_modulus.reg, m_u.reg, N); return m_result; } Integer MontgomeryRepresentation::ConvertOut(const Integer &a) const { word *const T = m_workspace.begin(); word *const R = m_result.reg.begin(); const size_t N = m_modulus.reg.size(); assert(a.reg.size()<=N); CopyWords(T, a.reg, a.reg.size()); SetWords(T+a.reg.size(), 0, 2*N-a.reg.size()); MontgomeryReduce(R, T+2*N, T, m_modulus.reg, m_u.reg, N); return m_result; } const Integer& MontgomeryRepresentation::MultiplicativeInverse(const Integer &a) const { // return (EuclideanMultiplicativeInverse(a, modulus)<<(2*WORD_BITS*modulus.reg.size()))%modulus; word *const T = m_workspace.begin(); word *const R = m_result.reg.begin(); const size_t N = m_modulus.reg.size(); assert(a.reg.size()<=N); CopyWords(T, a.reg, a.reg.size()); SetWords(T+a.reg.size(), 0, 2*N-a.reg.size()); MontgomeryReduce(R, T+2*N, T, m_modulus.reg, m_u.reg, N); unsigned k = AlmostInverse(R, T, R, N, m_modulus.reg, N); // cout << "k=" << k << " N*32=" << 32*N << endl; if (k>N*WORD_BITS) DivideByPower2Mod(R, R, k-N*WORD_BITS, m_modulus.reg, N); else MultiplyByPower2Mod(R, R, N*WORD_BITS-k, m_modulus.reg, N); return m_result; } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/wait.h0000755000000000000000000001562012414772654016717 0ustar rootroot#ifndef CRYPTOPP_WAIT_H #define CRYPTOPP_WAIT_H #include "config.h" #ifdef SOCKETS_AVAILABLE #include "misc.h" #include "cryptlib.h" #include #ifdef USE_WINDOWS_STYLE_SOCKETS #include #else #include #endif #include "hrtimer.h" NAMESPACE_BEGIN(CryptoPP) class Tracer { public: Tracer(unsigned int level) : m_level(level) {} virtual ~Tracer() {} protected: //! Override this in your most-derived tracer to do the actual tracing. virtual void Trace(unsigned int n, std::string const& s) = 0; /*! By default, tracers will decide which trace messages to trace according to a trace level mechanism. If your most-derived tracer uses a different mechanism, override this to return false. If this method returns false, the default TraceXxxx(void) methods will all return 0 and must be overridden explicitly by your tracer for trace messages you want. */ virtual bool UsingDefaults() const { return true; } protected: unsigned int m_level; void TraceIf(unsigned int n, std::string const&s) { if (n) Trace(n, s); } /*! Returns nr if, according to the default log settings mechanism (using log levels), the message should be traced. Returns 0 if the default trace level mechanism is not in use, or if it is in use but the event should not be traced. Provided as a utility method for easier and shorter coding of default TraceXxxx(void) implementations. */ unsigned int Tracing(unsigned int nr, unsigned int minLevel) const { return (UsingDefaults() && m_level >= minLevel) ? nr : 0; } }; // Your Tracer-derived class should inherit as virtual public from Tracer or another // Tracer-derived class, and should pass the log level in its constructor. You can use the // following methods to begin and end your Tracer definition. // This constructor macro initializes Tracer directly even if not derived directly from it; // this is intended, virtual base classes are always initialized by the most derived class. #define CRYPTOPP_TRACER_CONSTRUCTOR(DERIVED) \ public: DERIVED(unsigned int level = 0) : Tracer(level) {} #define CRYPTOPP_BEGIN_TRACER_CLASS_1(DERIVED, BASE1) \ class DERIVED : virtual public BASE1 { CRYPTOPP_TRACER_CONSTRUCTOR(DERIVED) #define CRYPTOPP_BEGIN_TRACER_CLASS_2(DERIVED, BASE1, BASE2) \ class DERIVED : virtual public BASE1, virtual public BASE2 { CRYPTOPP_TRACER_CONSTRUCTOR(DERIVED) #define CRYPTOPP_END_TRACER_CLASS }; // In your Tracer-derived class, you should define a globally unique event number for each // new event defined. This can be done using the following macros. #define CRYPTOPP_BEGIN_TRACER_EVENTS(UNIQUENR) enum { EVENTBASE = UNIQUENR, #define CRYPTOPP_TRACER_EVENT(EVENTNAME) EventNr_##EVENTNAME, #define CRYPTOPP_END_TRACER_EVENTS }; // In your own Tracer-derived class, you must define two methods per new trace event type: // - unsigned int TraceXxxx() const // Your default implementation of this method should return the event number if according // to the default trace level system the event should be traced, or 0 if it should not. // - void TraceXxxx(string const& s) // This method should call TraceIf(TraceXxxx(), s); to do the tracing. // For your convenience, a macro to define these two types of methods are defined below. // If you use this macro, you should also use the TRACER_EVENTS macros above to associate // event names with numbers. #define CRYPTOPP_TRACER_EVENT_METHODS(EVENTNAME, LOGLEVEL) \ virtual unsigned int Trace##EVENTNAME() const { return Tracing(EventNr_##EVENTNAME, LOGLEVEL); } \ virtual void Trace##EVENTNAME(std::string const& s) { TraceIf(Trace##EVENTNAME(), s); } /*! A simple unidirectional linked list with m_prev == 0 to indicate the final entry. The aim of this implementation is to provide a very lightweight and practical tracing mechanism with a low performance impact. Functions and methods supporting this call-stack mechanism would take a parameter of the form "CallStack const& callStack", and would pass this parameter to subsequent functions they call using the construct: SubFunc(arg1, arg2, CallStack("my func at place such and such", &callStack)); The advantage of this approach is that it is easy to use and should be very efficient, involving no allocation from the heap, just a linked list of stack objects containing pointers to static ASCIIZ strings (or possibly additional but simple data if derived). */ class CallStack { public: CallStack(char const* i, CallStack const* p) : m_info(i), m_prev(p) {} CallStack const* Prev() const { return m_prev; } virtual std::string Format() const; protected: char const* m_info; CallStack const* m_prev; }; /*! An extended CallStack entry type with an additional numeric parameter. */ class CallStackWithNr : public CallStack { public: CallStackWithNr(char const* i, word32 n, CallStack const* p) : CallStack(i, p), m_nr(n) {} std::string Format() const; protected: word32 m_nr; }; /*! An extended CallStack entry type with an additional string parameter. */ class CallStackWithStr : public CallStack { public: CallStackWithStr(char const* i, char const* z, CallStack const* p) : CallStack(i, p), m_z(z) {} std::string Format() const; protected: char const* m_z; }; CRYPTOPP_BEGIN_TRACER_CLASS_1(WaitObjectsTracer, Tracer) CRYPTOPP_BEGIN_TRACER_EVENTS(0x48752841) CRYPTOPP_TRACER_EVENT(NoWaitLoop) CRYPTOPP_END_TRACER_EVENTS CRYPTOPP_TRACER_EVENT_METHODS(NoWaitLoop, 1) CRYPTOPP_END_TRACER_CLASS struct WaitingThreadData; //! container of wait objects class WaitObjectContainer : public NotCopyable { public: //! exception thrown by WaitObjectContainer class Err : public Exception { public: Err(const std::string& s) : Exception(IO_ERROR, s) {} }; static unsigned int MaxWaitObjects(); WaitObjectContainer(WaitObjectsTracer* tracer = 0); void Clear(); void SetNoWait(CallStack const& callStack); void ScheduleEvent(double milliseconds, CallStack const& callStack); // returns false if timed out bool Wait(unsigned long milliseconds); #ifdef USE_WINDOWS_STYLE_SOCKETS ~WaitObjectContainer(); void AddHandle(HANDLE handle, CallStack const& callStack); #else void AddReadFd(int fd, CallStack const& callStack); void AddWriteFd(int fd, CallStack const& callStack); #endif private: WaitObjectsTracer* m_tracer; #ifdef USE_WINDOWS_STYLE_SOCKETS void CreateThreads(unsigned int count); std::vector m_handles; std::vector m_threads; HANDLE m_startWaiting; HANDLE m_stopWaiting; #else fd_set m_readfds, m_writefds; int m_maxFd; #endif bool m_noWait; double m_firstEventTime; Timer m_eventTimer; #ifdef USE_WINDOWS_STYLE_SOCKETS typedef size_t LastResultType; #else typedef int LastResultType; #endif enum { LASTRESULT_NOWAIT = -1, LASTRESULT_SCHEDULED = -2, LASTRESULT_TIMEOUT = -3 }; LastResultType m_lastResult; unsigned int m_sameResultCount; Timer m_noWaitTimer; void SetLastResult(LastResultType result); void DetectNoWait(LastResultType result, CallStack const& callStack); }; NAMESPACE_END #endif #endif armory-0.92.3/cppForSwig/cryptopp/cryptdll.vcproj0000755000000000000000000023250312414772654020665 0ustar rootroot armory-0.92.3/cppForSwig/cryptopp/zdeflate.h0000755000000000000000000000765512414772654017562 0ustar rootroot#ifndef CRYPTOPP_ZDEFLATE_H #define CRYPTOPP_ZDEFLATE_H #include "filters.h" #include "misc.h" NAMESPACE_BEGIN(CryptoPP) //! _ class LowFirstBitWriter : public Filter { public: LowFirstBitWriter(BufferedTransformation *attachment); void PutBits(unsigned long value, unsigned int length); void FlushBitBuffer(); void ClearBitBuffer(); void StartCounting(); unsigned long FinishCounting(); protected: bool m_counting; unsigned long m_bitCount; unsigned long m_buffer; unsigned int m_bitsBuffered, m_bytesBuffered; FixedSizeSecBlock m_outputBuffer; }; //! Huffman Encoder class HuffmanEncoder { public: typedef unsigned int code_t; typedef unsigned int value_t; HuffmanEncoder() {} HuffmanEncoder(const unsigned int *codeBits, unsigned int nCodes); void Initialize(const unsigned int *codeBits, unsigned int nCodes); static void GenerateCodeLengths(unsigned int *codeBits, unsigned int maxCodeBits, const unsigned int *codeCounts, size_t nCodes); void Encode(LowFirstBitWriter &writer, value_t value) const; struct Code { unsigned int code; unsigned int len; }; SecBlock m_valueToCode; }; //! DEFLATE (RFC 1951) compressor class Deflator : public LowFirstBitWriter { public: enum {MIN_DEFLATE_LEVEL = 0, DEFAULT_DEFLATE_LEVEL = 6, MAX_DEFLATE_LEVEL = 9}; enum {MIN_LOG2_WINDOW_SIZE = 9, DEFAULT_LOG2_WINDOW_SIZE = 15, MAX_LOG2_WINDOW_SIZE = 15}; /*! \note detectUncompressible makes it faster to process uncompressible files, but if a file has both compressible and uncompressible parts, it may fail to compress some of the compressible parts. */ Deflator(BufferedTransformation *attachment=NULL, int deflateLevel=DEFAULT_DEFLATE_LEVEL, int log2WindowSize=DEFAULT_LOG2_WINDOW_SIZE, bool detectUncompressible=true); //! possible parameter names: Log2WindowSize, DeflateLevel, DetectUncompressible Deflator(const NameValuePairs ¶meters, BufferedTransformation *attachment=NULL); //! this function can be used to set the deflate level in the middle of compression void SetDeflateLevel(int deflateLevel); int GetDeflateLevel() const {return m_deflateLevel;} int GetLog2WindowSize() const {return m_log2WindowSize;} void IsolatedInitialize(const NameValuePairs ¶meters); size_t Put2(const byte *inString, size_t length, int messageEnd, bool blocking); bool IsolatedFlush(bool hardFlush, bool blocking); protected: virtual void WritePrestreamHeader() {} virtual void ProcessUncompressedData(const byte *string, size_t length) {} virtual void WritePoststreamTail() {} enum {STORED = 0, STATIC = 1, DYNAMIC = 2}; enum {MIN_MATCH = 3, MAX_MATCH = 258}; void InitializeStaticEncoders(); void Reset(bool forceReset = false); unsigned int FillWindow(const byte *str, size_t length); unsigned int ComputeHash(const byte *str) const; unsigned int LongestMatch(unsigned int &bestMatch) const; void InsertString(unsigned int start); void ProcessBuffer(); void LiteralByte(byte b); void MatchFound(unsigned int distance, unsigned int length); void EncodeBlock(bool eof, unsigned int blockType); void EndBlock(bool eof); struct EncodedMatch { unsigned literalCode : 9; unsigned literalExtra : 5; unsigned distanceCode : 5; unsigned distanceExtra : 13; }; int m_deflateLevel, m_log2WindowSize, m_compressibleDeflateLevel; unsigned int m_detectSkip, m_detectCount; unsigned int DSIZE, DMASK, HSIZE, HMASK, GOOD_MATCH, MAX_LAZYLENGTH, MAX_CHAIN_LENGTH; bool m_headerWritten, m_matchAvailable; unsigned int m_dictionaryEnd, m_stringStart, m_lookahead, m_minLookahead, m_previousMatch, m_previousLength; HuffmanEncoder m_staticLiteralEncoder, m_staticDistanceEncoder, m_dynamicLiteralEncoder, m_dynamicDistanceEncoder; SecByteBlock m_byteBuffer; SecBlock m_head, m_prev; FixedSizeSecBlock m_literalCounts; FixedSizeSecBlock m_distanceCounts; SecBlock m_matchBuffer; unsigned int m_matchBufferEnd, m_blockStart, m_blockLength; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/gfpcrypt.h0000755000000000000000000004654012414772654017616 0ustar rootroot#ifndef CRYPTOPP_GFPCRYPT_H #define CRYPTOPP_GFPCRYPT_H /** \file Implementation of schemes based on DL over GF(p) */ #include "pubkey.h" #include "modexppc.h" #include "sha.h" #include "algparam.h" #include "asn.h" #include "smartptr.h" #include "hmac.h" #include NAMESPACE_BEGIN(CryptoPP) CRYPTOPP_DLL_TEMPLATE_CLASS DL_GroupParameters; //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE DL_GroupParameters_IntegerBased : public ASN1CryptoMaterial > { typedef DL_GroupParameters_IntegerBased ThisClass; public: void Initialize(const DL_GroupParameters_IntegerBased ¶ms) {Initialize(params.GetModulus(), params.GetSubgroupOrder(), params.GetSubgroupGenerator());} void Initialize(RandomNumberGenerator &rng, unsigned int pbits) {GenerateRandom(rng, MakeParameters("ModulusSize", (int)pbits));} void Initialize(const Integer &p, const Integer &g) {SetModulusAndSubgroupGenerator(p, g); SetSubgroupOrder(ComputeGroupOrder(p)/2);} void Initialize(const Integer &p, const Integer &q, const Integer &g) {SetModulusAndSubgroupGenerator(p, g); SetSubgroupOrder(q);} // ASN1Object interface void BERDecode(BufferedTransformation &bt); void DEREncode(BufferedTransformation &bt) const; // GeneratibleCryptoMaterial interface /*! parameters: (ModulusSize, SubgroupOrderSize (optional)) */ void GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg); bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const; void AssignFrom(const NameValuePairs &source); // DL_GroupParameters const Integer & GetSubgroupOrder() const {return m_q;} Integer GetGroupOrder() const {return GetFieldType() == 1 ? GetModulus()-Integer::One() : GetModulus()+Integer::One();} bool ValidateGroup(RandomNumberGenerator &rng, unsigned int level) const; bool ValidateElement(unsigned int level, const Integer &element, const DL_FixedBasePrecomputation *precomp) const; bool FastSubgroupCheckAvailable() const {return GetCofactor() == 2;} void EncodeElement(bool reversible, const Element &element, byte *encoded) const {element.Encode(encoded, GetModulus().ByteCount());} unsigned int GetEncodedElementSize(bool reversible) const {return GetModulus().ByteCount();} Integer DecodeElement(const byte *encoded, bool checkForGroupMembership) const; Integer ConvertElementToInteger(const Element &element) const {return element;} Integer GetMaxExponent() const; static std::string CRYPTOPP_API StaticAlgorithmNamePrefix() {return "";} OID GetAlgorithmID() const; virtual const Integer & GetModulus() const =0; virtual void SetModulusAndSubgroupGenerator(const Integer &p, const Integer &g) =0; void SetSubgroupOrder(const Integer &q) {m_q = q; ParametersChanged();} protected: Integer ComputeGroupOrder(const Integer &modulus) const {return modulus-(GetFieldType() == 1 ? 1 : -1);} // GF(p) = 1, GF(p^2) = 2 virtual int GetFieldType() const =0; virtual unsigned int GetDefaultSubgroupOrderSize(unsigned int modulusSize) const; private: Integer m_q; }; //! _ template > class CRYPTOPP_NO_VTABLE DL_GroupParameters_IntegerBasedImpl : public DL_GroupParametersImpl { typedef DL_GroupParameters_IntegerBasedImpl ThisClass; public: typedef typename GROUP_PRECOMP::Element Element; // GeneratibleCryptoMaterial interface bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const {return GetValueHelper(this, name, valueType, pValue).Assignable();} void AssignFrom(const NameValuePairs &source) {AssignFromHelper(this, source);} // DL_GroupParameters const DL_FixedBasePrecomputation & GetBasePrecomputation() const {return this->m_gpc;} DL_FixedBasePrecomputation & AccessBasePrecomputation() {return this->m_gpc;} // IntegerGroupParameters const Integer & GetModulus() const {return this->m_groupPrecomputation.GetModulus();} const Integer & GetGenerator() const {return this->m_gpc.GetBase(this->GetGroupPrecomputation());} void SetModulusAndSubgroupGenerator(const Integer &p, const Integer &g) // these have to be set together {this->m_groupPrecomputation.SetModulus(p); this->m_gpc.SetBase(this->GetGroupPrecomputation(), g); this->ParametersChanged();} // non-inherited bool operator==(const DL_GroupParameters_IntegerBasedImpl &rhs) const {return GetModulus() == rhs.GetModulus() && GetGenerator() == rhs.GetGenerator() && this->GetSubgroupOrder() == rhs.GetSubgroupOrder();} bool operator!=(const DL_GroupParameters_IntegerBasedImpl &rhs) const {return !operator==(rhs);} }; CRYPTOPP_DLL_TEMPLATE_CLASS DL_GroupParameters_IntegerBasedImpl; //! GF(p) group parameters class CRYPTOPP_DLL DL_GroupParameters_GFP : public DL_GroupParameters_IntegerBasedImpl { public: // DL_GroupParameters bool IsIdentity(const Integer &element) const {return element == Integer::One();} void SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const; // NameValuePairs interface bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { return GetValueHelper(this, name, valueType, pValue).Assignable(); } // used by MQV Element MultiplyElements(const Element &a, const Element &b) const; Element CascadeExponentiate(const Element &element1, const Integer &exponent1, const Element &element2, const Integer &exponent2) const; protected: int GetFieldType() const {return 1;} }; //! GF(p) group parameters that default to same primes class CRYPTOPP_DLL DL_GroupParameters_GFP_DefaultSafePrime : public DL_GroupParameters_GFP { public: typedef NoCofactorMultiplication DefaultCofactorOption; protected: unsigned int GetDefaultSubgroupOrderSize(unsigned int modulusSize) const {return modulusSize-1;} }; //! GDSA algorithm template class DL_Algorithm_GDSA : public DL_ElgamalLikeSignatureAlgorithm { public: static const char * CRYPTOPP_API StaticAlgorithmName() {return "DSA-1363";} void Sign(const DL_GroupParameters ¶ms, const Integer &x, const Integer &k, const Integer &e, Integer &r, Integer &s) const { const Integer &q = params.GetSubgroupOrder(); r %= q; Integer kInv = k.InverseMod(q); s = (kInv * (x*r + e)) % q; assert(!!r && !!s); } bool Verify(const DL_GroupParameters ¶ms, const DL_PublicKey &publicKey, const Integer &e, const Integer &r, const Integer &s) const { const Integer &q = params.GetSubgroupOrder(); if (r>=q || r<1 || s>=q || s<1) return false; Integer w = s.InverseMod(q); Integer u1 = (e * w) % q; Integer u2 = (r * w) % q; // verify r == (g^u1 * y^u2 mod p) mod q return r == params.ConvertElementToInteger(publicKey.CascadeExponentiateBaseAndPublicElement(u1, u2)) % q; } }; CRYPTOPP_DLL_TEMPLATE_CLASS DL_Algorithm_GDSA; //! NR algorithm template class DL_Algorithm_NR : public DL_ElgamalLikeSignatureAlgorithm { public: static const char * CRYPTOPP_API StaticAlgorithmName() {return "NR";} void Sign(const DL_GroupParameters ¶ms, const Integer &x, const Integer &k, const Integer &e, Integer &r, Integer &s) const { const Integer &q = params.GetSubgroupOrder(); r = (r + e) % q; s = (k - x*r) % q; assert(!!r); } bool Verify(const DL_GroupParameters ¶ms, const DL_PublicKey &publicKey, const Integer &e, const Integer &r, const Integer &s) const { const Integer &q = params.GetSubgroupOrder(); if (r>=q || r<1 || s>=q) return false; // check r == (m_g^s * m_y^r + m) mod m_q return r == (params.ConvertElementToInteger(publicKey.CascadeExponentiateBaseAndPublicElement(s, r)) + e) % q; } }; /*! DSA public key format is defined in 7.3.3 of RFC 2459. The private key format is defined in 12.9 of PKCS #11 v2.10. */ template class DL_PublicKey_GFP : public DL_PublicKeyImpl { public: void Initialize(const DL_GroupParameters_IntegerBased ¶ms, const Integer &y) {this->AccessGroupParameters().Initialize(params); this->SetPublicElement(y);} void Initialize(const Integer &p, const Integer &g, const Integer &y) {this->AccessGroupParameters().Initialize(p, g); this->SetPublicElement(y);} void Initialize(const Integer &p, const Integer &q, const Integer &g, const Integer &y) {this->AccessGroupParameters().Initialize(p, q, g); this->SetPublicElement(y);} // X509PublicKey void BERDecodePublicKey(BufferedTransformation &bt, bool, size_t) {this->SetPublicElement(Integer(bt));} void DEREncodePublicKey(BufferedTransformation &bt) const {this->GetPublicElement().DEREncode(bt);} }; //! DL private key (in GF(p) groups) template class DL_PrivateKey_GFP : public DL_PrivateKeyImpl { public: void Initialize(RandomNumberGenerator &rng, unsigned int modulusBits) {this->GenerateRandomWithKeySize(rng, modulusBits);} void Initialize(RandomNumberGenerator &rng, const Integer &p, const Integer &g) {this->GenerateRandom(rng, MakeParameters("Modulus", p)("SubgroupGenerator", g));} void Initialize(RandomNumberGenerator &rng, const Integer &p, const Integer &q, const Integer &g) {this->GenerateRandom(rng, MakeParameters("Modulus", p)("SubgroupOrder", q)("SubgroupGenerator", g));} void Initialize(const DL_GroupParameters_IntegerBased ¶ms, const Integer &x) {this->AccessGroupParameters().Initialize(params); this->SetPrivateExponent(x);} void Initialize(const Integer &p, const Integer &g, const Integer &x) {this->AccessGroupParameters().Initialize(p, g); this->SetPrivateExponent(x);} void Initialize(const Integer &p, const Integer &q, const Integer &g, const Integer &x) {this->AccessGroupParameters().Initialize(p, q, g); this->SetPrivateExponent(x);} }; //! DL signing/verification keys (in GF(p) groups) struct DL_SignatureKeys_GFP { typedef DL_GroupParameters_GFP GroupParameters; typedef DL_PublicKey_GFP PublicKey; typedef DL_PrivateKey_GFP PrivateKey; }; //! DL encryption/decryption keys (in GF(p) groups) struct DL_CryptoKeys_GFP { typedef DL_GroupParameters_GFP_DefaultSafePrime GroupParameters; typedef DL_PublicKey_GFP PublicKey; typedef DL_PrivateKey_GFP PrivateKey; }; //! provided for backwards compatibility, this class uses the old non-standard Crypto++ key format template class DL_PublicKey_GFP_OldFormat : public BASE { public: void BERDecode(BufferedTransformation &bt) { BERSequenceDecoder seq(bt); Integer v1(seq); Integer v2(seq); Integer v3(seq); if (seq.EndReached()) { this->AccessGroupParameters().Initialize(v1, v1/2, v2); this->SetPublicElement(v3); } else { Integer v4(seq); this->AccessGroupParameters().Initialize(v1, v2, v3); this->SetPublicElement(v4); } seq.MessageEnd(); } void DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); this->GetGroupParameters().GetModulus().DEREncode(seq); if (this->GetGroupParameters().GetCofactor() != 2) this->GetGroupParameters().GetSubgroupOrder().DEREncode(seq); this->GetGroupParameters().GetGenerator().DEREncode(seq); this->GetPublicElement().DEREncode(seq); seq.MessageEnd(); } }; //! provided for backwards compatibility, this class uses the old non-standard Crypto++ key format template class DL_PrivateKey_GFP_OldFormat : public BASE { public: void BERDecode(BufferedTransformation &bt) { BERSequenceDecoder seq(bt); Integer v1(seq); Integer v2(seq); Integer v3(seq); Integer v4(seq); if (seq.EndReached()) { this->AccessGroupParameters().Initialize(v1, v1/2, v2); this->SetPrivateExponent(v4 % (v1/2)); // some old keys may have x >= q } else { Integer v5(seq); this->AccessGroupParameters().Initialize(v1, v2, v3); this->SetPrivateExponent(v5); } seq.MessageEnd(); } void DEREncode(BufferedTransformation &bt) const { DERSequenceEncoder seq(bt); this->GetGroupParameters().GetModulus().DEREncode(seq); if (this->GetGroupParameters().GetCofactor() != 2) this->GetGroupParameters().GetSubgroupOrder().DEREncode(seq); this->GetGroupParameters().GetGenerator().DEREncode(seq); this->GetGroupParameters().ExponentiateBase(this->GetPrivateExponent()).DEREncode(seq); this->GetPrivateExponent().DEREncode(seq); seq.MessageEnd(); } }; //! DSA-1363 template struct GDSA : public DL_SS< DL_SignatureKeys_GFP, DL_Algorithm_GDSA, DL_SignatureMessageEncodingMethod_DSA, H> { }; //! NR template struct NR : public DL_SS< DL_SignatureKeys_GFP, DL_Algorithm_NR, DL_SignatureMessageEncodingMethod_NR, H> { }; //! DSA group parameters, these are GF(p) group parameters that are allowed by the DSA standard class CRYPTOPP_DLL DL_GroupParameters_DSA : public DL_GroupParameters_GFP { public: /*! also checks that the lengths of p and q are allowed by the DSA standard */ bool ValidateGroup(RandomNumberGenerator &rng, unsigned int level) const; /*! parameters: (ModulusSize), or (Modulus, SubgroupOrder, SubgroupGenerator) */ /*! ModulusSize must be between DSA::MIN_PRIME_LENGTH and DSA::MAX_PRIME_LENGTH, and divisible by DSA::PRIME_LENGTH_MULTIPLE */ void GenerateRandom(RandomNumberGenerator &rng, const NameValuePairs &alg); }; struct DSA; //! DSA keys struct DL_Keys_DSA { typedef DL_PublicKey_GFP PublicKey; typedef DL_PrivateKey_WithSignaturePairwiseConsistencyTest, DSA> PrivateKey; }; //! DSA struct CRYPTOPP_DLL DSA : public DL_SS< DL_Keys_DSA, DL_Algorithm_GDSA, DL_SignatureMessageEncodingMethod_DSA, SHA, DSA> { static const char * CRYPTOPP_API StaticAlgorithmName() {return "DSA";} //! Generate DSA primes according to NIST standard /*! Both seedLength and primeLength are in bits, but seedLength should be a multiple of 8. If useInputCounterValue == true, the counter parameter is taken as input, otherwise it's used for output */ static bool CRYPTOPP_API GeneratePrimes(const byte *seed, unsigned int seedLength, int &counter, Integer &p, unsigned int primeLength, Integer &q, bool useInputCounterValue = false); static bool CRYPTOPP_API IsValidPrimeLength(unsigned int pbits) {return pbits >= MIN_PRIME_LENGTH && pbits <= MAX_PRIME_LENGTH && pbits % PRIME_LENGTH_MULTIPLE == 0;} //! FIPS 186-2 Change Notice 1 changed the minimum modulus length to 1024 enum { #if (DSA_1024_BIT_MODULUS_ONLY) MIN_PRIME_LENGTH = 1024, #else MIN_PRIME_LENGTH = 512, #endif MAX_PRIME_LENGTH = 1024, PRIME_LENGTH_MULTIPLE = 64}; }; CRYPTOPP_DLL_TEMPLATE_CLASS DL_PublicKey_GFP; CRYPTOPP_DLL_TEMPLATE_CLASS DL_PrivateKey_GFP; CRYPTOPP_DLL_TEMPLATE_CLASS DL_PrivateKey_WithSignaturePairwiseConsistencyTest, DSA>; //! the XOR encryption method, for use with DL-based cryptosystems template class DL_EncryptionAlgorithm_Xor : public DL_SymmetricEncryptionAlgorithm { public: bool ParameterSupported(const char *name) const {return strcmp(name, Name::EncodingParameters()) == 0;} size_t GetSymmetricKeyLength(size_t plaintextLength) const {return plaintextLength + MAC::DEFAULT_KEYLENGTH;} size_t GetSymmetricCiphertextLength(size_t plaintextLength) const {return plaintextLength + MAC::DIGESTSIZE;} size_t GetMaxSymmetricPlaintextLength(size_t ciphertextLength) const {return (unsigned int)SaturatingSubtract(ciphertextLength, (unsigned int)MAC::DIGESTSIZE);} void SymmetricEncrypt(RandomNumberGenerator &rng, const byte *key, const byte *plaintext, size_t plaintextLength, byte *ciphertext, const NameValuePairs ¶meters) const { const byte *cipherKey, *macKey; if (DHAES_MODE) { macKey = key; cipherKey = key + MAC::DEFAULT_KEYLENGTH; } else { cipherKey = key; macKey = key + plaintextLength; } ConstByteArrayParameter encodingParameters; parameters.GetValue(Name::EncodingParameters(), encodingParameters); xorbuf(ciphertext, plaintext, cipherKey, plaintextLength); MAC mac(macKey); mac.Update(ciphertext, plaintextLength); mac.Update(encodingParameters.begin(), encodingParameters.size()); if (DHAES_MODE) { byte L[8] = {0,0,0,0}; PutWord(false, BIG_ENDIAN_ORDER, L+4, word32(encodingParameters.size())); mac.Update(L, 8); } mac.Final(ciphertext + plaintextLength); } DecodingResult SymmetricDecrypt(const byte *key, const byte *ciphertext, size_t ciphertextLength, byte *plaintext, const NameValuePairs ¶meters) const { size_t plaintextLength = GetMaxSymmetricPlaintextLength(ciphertextLength); const byte *cipherKey, *macKey; if (DHAES_MODE) { macKey = key; cipherKey = key + MAC::DEFAULT_KEYLENGTH; } else { cipherKey = key; macKey = key + plaintextLength; } ConstByteArrayParameter encodingParameters; parameters.GetValue(Name::EncodingParameters(), encodingParameters); MAC mac(macKey); mac.Update(ciphertext, plaintextLength); mac.Update(encodingParameters.begin(), encodingParameters.size()); if (DHAES_MODE) { byte L[8] = {0,0,0,0}; PutWord(false, BIG_ENDIAN_ORDER, L+4, word32(encodingParameters.size())); mac.Update(L, 8); } if (!mac.Verify(ciphertext + plaintextLength)) return DecodingResult(); xorbuf(plaintext, ciphertext, cipherKey, plaintextLength); return DecodingResult(plaintextLength); } }; //! _ template class DL_KeyDerivationAlgorithm_P1363 : public DL_KeyDerivationAlgorithm { public: bool ParameterSupported(const char *name) const {return strcmp(name, Name::KeyDerivationParameters()) == 0;} void Derive(const DL_GroupParameters ¶ms, byte *derivedKey, size_t derivedLength, const T &agreedElement, const T &ephemeralPublicKey, const NameValuePairs ¶meters) const { SecByteBlock agreedSecret; if (DHAES_MODE) { agreedSecret.New(params.GetEncodedElementSize(true) + params.GetEncodedElementSize(false)); params.EncodeElement(true, ephemeralPublicKey, agreedSecret); params.EncodeElement(false, agreedElement, agreedSecret + params.GetEncodedElementSize(true)); } else { agreedSecret.New(params.GetEncodedElementSize(false)); params.EncodeElement(false, agreedElement, agreedSecret); } ConstByteArrayParameter derivationParameters; parameters.GetValue(Name::KeyDerivationParameters(), derivationParameters); KDF::DeriveKey(derivedKey, derivedLength, agreedSecret, agreedSecret.size(), derivationParameters.begin(), derivationParameters.size()); } }; //! Discrete Log Integrated Encryption Scheme, AKA DLIES template struct DLIES : public DL_ES< DL_CryptoKeys_GFP, DL_KeyAgreementAlgorithm_DH, DL_KeyDerivationAlgorithm_P1363 >, DL_EncryptionAlgorithm_Xor, DHAES_MODE>, DLIES<> > { static std::string CRYPTOPP_API StaticAlgorithmName() {return "DLIES";} // TODO: fix this after name is standardized }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/pch.h0000755000000000000000000000042412414772654016521 0ustar rootroot#ifndef CRYPTOPP_PCH_H #define CRYPTOPP_PCH_H #ifdef CRYPTOPP_GENERATE_X64_MASM #include "cpu.h" #else #include "config.h" #ifdef USE_PRECOMPILED_HEADERS #include "simple.h" #include "secblock.h" #include "misc.h" #include "smartptr.h" #endif #endif #endif armory-0.92.3/cppForSwig/cryptopp/aes.h0000755000000000000000000000051212414772654016515 0ustar rootroot#ifndef CRYPTOPP_AES_H #define CRYPTOPP_AES_H #include "rijndael.h" NAMESPACE_BEGIN(CryptoPP) //! AES winner, announced on 10/2/2000 DOCUMENTED_TYPEDEF(Rijndael, AES); typedef RijndaelEncryption AESEncryption; typedef RijndaelDecryption AESDecryption; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/md5.h0000755000000000000000000000223512414772654016436 0ustar rootroot#ifndef CRYPTOPP_MD5_H #define CRYPTOPP_MD5_H #include "iterhash.h" NAMESPACE_BEGIN(CryptoPP) namespace Weak1 { //! MD5 class MD5 : public IteratedHashWithStaticTransform { public: static void InitState(HashWordType *state); static void Transform(word32 *digest, const word32 *data); static const char * StaticAlgorithmName() {return "MD5";} }; } #if CRYPTOPP_ENABLE_NAMESPACE_WEAK >= 1 namespace Weak {using namespace Weak1;} // import Weak1 into CryptoPP::Weak #else using namespace Weak1; // import Weak1 into CryptoPP with warning #ifdef __GNUC__ #warning "You may be using a weak algorithm that has been retained for backwards compatibility. Please '#define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1' before including this .h file and prepend the class name with 'Weak::' to remove this warning." #else #pragma message("You may be using a weak algorithm that has been retained for backwards compatibility. Please '#define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1' before including this .h file and prepend the class name with 'Weak::' to remove this warning.") #endif #endif NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/channels.h0000755000000000000000000000773112414772654017552 0ustar rootroot#ifndef CRYPTOPP_CHANNELS_H #define CRYPTOPP_CHANNELS_H #include "simple.h" #include "smartptr.h" #include #include NAMESPACE_BEGIN(CryptoPP) #if 0 //! Route input on default channel to different and/or multiple channels based on message sequence number class MessageSwitch : public Sink { public: void AddDefaultRoute(BufferedTransformation &destination, const std::string &channel); void AddRoute(unsigned int begin, unsigned int end, BufferedTransformation &destination, const std::string &channel); void Put(byte inByte); void Put(const byte *inString, unsigned int length); void Flush(bool completeFlush, int propagation=-1); void MessageEnd(int propagation=-1); void PutMessageEnd(const byte *inString, unsigned int length, int propagation=-1); void MessageSeriesEnd(int propagation=-1); private: typedef std::pair Route; struct RangeRoute { RangeRoute(unsigned int begin, unsigned int end, const Route &route) : begin(begin), end(end), route(route) {} bool operator<(const RangeRoute &rhs) const {return begin < rhs.begin;} unsigned int begin, end; Route route; }; typedef std::list RouteList; typedef std::list DefaultRouteList; RouteList m_routes; DefaultRouteList m_defaultRoutes; unsigned int m_nCurrentMessage; }; #endif class ChannelSwitchTypedefs { public: typedef std::pair Route; typedef std::multimap RouteMap; typedef std::pair > DefaultRoute; typedef std::list DefaultRouteList; // SunCC workaround: can't use const_iterator here typedef RouteMap::iterator MapIterator; typedef DefaultRouteList::iterator ListIterator; }; class ChannelSwitch; class ChannelRouteIterator : public ChannelSwitchTypedefs { public: ChannelSwitch& m_cs; std::string m_channel; bool m_useDefault; MapIterator m_itMapCurrent, m_itMapEnd; ListIterator m_itListCurrent, m_itListEnd; ChannelRouteIterator(ChannelSwitch &cs) : m_cs(cs) {} void Reset(const std::string &channel); bool End() const; void Next(); BufferedTransformation & Destination(); const std::string & Channel(); }; //! Route input to different and/or multiple channels based on channel ID class CRYPTOPP_DLL ChannelSwitch : public Multichannel, public ChannelSwitchTypedefs { public: ChannelSwitch() : m_it(*this), m_blocked(false) {} ChannelSwitch(BufferedTransformation &destination) : m_it(*this), m_blocked(false) { AddDefaultRoute(destination); } ChannelSwitch(BufferedTransformation &destination, const std::string &outChannel) : m_it(*this), m_blocked(false) { AddDefaultRoute(destination, outChannel); } void IsolatedInitialize(const NameValuePairs ¶meters=g_nullNameValuePairs); size_t ChannelPut2(const std::string &channel, const byte *begin, size_t length, int messageEnd, bool blocking); size_t ChannelPutModifiable2(const std::string &channel, byte *begin, size_t length, int messageEnd, bool blocking); bool ChannelFlush(const std::string &channel, bool completeFlush, int propagation=-1, bool blocking=true); bool ChannelMessageSeriesEnd(const std::string &channel, int propagation=-1, bool blocking=true); byte * ChannelCreatePutSpace(const std::string &channel, size_t &size); void AddDefaultRoute(BufferedTransformation &destination); void RemoveDefaultRoute(BufferedTransformation &destination); void AddDefaultRoute(BufferedTransformation &destination, const std::string &outChannel); void RemoveDefaultRoute(BufferedTransformation &destination, const std::string &outChannel); void AddRoute(const std::string &inChannel, BufferedTransformation &destination, const std::string &outChannel); void RemoveRoute(const std::string &inChannel, BufferedTransformation &destination, const std::string &outChannel); private: RouteMap m_routeMap; DefaultRouteList m_defaultRoutes; ChannelRouteIterator m_it; bool m_blocked; friend class ChannelRouteIterator; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/hmac.h0000755000000000000000000000344612414772654016666 0ustar rootroot// hmac.h - written and placed in the public domain by Wei Dai #ifndef CRYPTOPP_HMAC_H #define CRYPTOPP_HMAC_H #include "seckey.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! _ class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE HMAC_Base : public VariableKeyLength<16, 0, INT_MAX>, public MessageAuthenticationCode { public: HMAC_Base() : m_innerHashKeyed(false) {} void UncheckedSetKey(const byte *userKey, unsigned int keylength, const NameValuePairs ¶ms); void Restart(); void Update(const byte *input, size_t length); void TruncatedFinal(byte *mac, size_t size); unsigned int OptimalBlockSize() const {return const_cast(this)->AccessHash().OptimalBlockSize();} unsigned int DigestSize() const {return const_cast(this)->AccessHash().DigestSize();} protected: virtual HashTransformation & AccessHash() =0; byte * AccessIpad() {return m_buf;} byte * AccessOpad() {return m_buf + AccessHash().BlockSize();} byte * AccessInnerHash() {return m_buf + 2*AccessHash().BlockSize();} private: void KeyInnerHash(); SecByteBlock m_buf; bool m_innerHashKeyed; }; //! HMAC /*! HMAC(K, text) = H(K XOR opad, H(K XOR ipad, text)) */ template class HMAC : public MessageAuthenticationCodeImpl > { public: CRYPTOPP_CONSTANT(DIGESTSIZE=T::DIGESTSIZE) CRYPTOPP_CONSTANT(BLOCKSIZE=T::BLOCKSIZE) HMAC() {} HMAC(const byte *key, size_t length=HMAC_Base::DEFAULT_KEYLENGTH) {this->SetKey(key, length);} static std::string StaticAlgorithmName() {return std::string("HMAC(") + T::StaticAlgorithmName() + ")";} std::string AlgorithmName() const {return std::string("HMAC(") + m_hash.AlgorithmName() + ")";} private: HashTransformation & AccessHash() {return m_hash;} T m_hash; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/fips140.cpp0000755000000000000000000000437512414772654017501 0ustar rootroot// fips140.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #ifndef CRYPTOPP_IMPORTS #include "fips140.h" #include "trdlocal.h" // needs to be included last for cygwin NAMESPACE_BEGIN(CryptoPP) // Define this to 1 to turn on FIPS 140-2 compliance features, including additional tests during // startup, random number generation, and key generation. These tests may affect performance. #ifndef CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2 #define CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2 0 #endif #if (CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2 && !defined(THREADS_AVAILABLE)) #error FIPS 140-2 compliance requires the availability of thread local storage. #endif #if (CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2 && !defined(OS_RNG_AVAILABLE)) #error FIPS 140-2 compliance requires the availability of OS provided RNG. #endif PowerUpSelfTestStatus g_powerUpSelfTestStatus = POWER_UP_SELF_TEST_NOT_DONE; bool FIPS_140_2_ComplianceEnabled() { return CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2; } void SimulatePowerUpSelfTestFailure() { g_powerUpSelfTestStatus = POWER_UP_SELF_TEST_FAILED; } PowerUpSelfTestStatus CRYPTOPP_API GetPowerUpSelfTestStatus() { return g_powerUpSelfTestStatus; } #if CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2 ThreadLocalStorage & AccessPowerUpSelfTestInProgress() { static ThreadLocalStorage selfTestInProgress; return selfTestInProgress; } #endif bool PowerUpSelfTestInProgressOnThisThread() { #if CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2 return AccessPowerUpSelfTestInProgress().GetValue() != NULL; #else assert(false); // should not be called return false; #endif } void SetPowerUpSelfTestInProgressOnThisThread(bool inProgress) { #if CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2 AccessPowerUpSelfTestInProgress().SetValue((void *)inProgress); #endif } void EncryptionPairwiseConsistencyTest_FIPS_140_Only(const PK_Encryptor &encryptor, const PK_Decryptor &decryptor) { #if CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2 EncryptionPairwiseConsistencyTest(encryptor, decryptor); #endif } void SignaturePairwiseConsistencyTest_FIPS_140_Only(const PK_Signer &signer, const PK_Verifier &verifier) { #if CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2 SignaturePairwiseConsistencyTest(signer, verifier); #endif } NAMESPACE_END #endif armory-0.92.3/cppForSwig/cryptopp/rng.cpp0000755000000000000000000000731112414772654017072 0ustar rootroot// rng.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "rng.h" #include "fips140.h" #include #include NAMESPACE_BEGIN(CryptoPP) // linear congruential generator // originally by William S. England // do not use for cryptographic purposes /* ** Original_numbers are the original published m and q in the ** ACM article above. John Burton has furnished numbers for ** a reportedly better generator. The new numbers are now ** used in this program by default. */ #ifndef LCRNG_ORIGINAL_NUMBERS const word32 LC_RNG::m=2147483647L; const word32 LC_RNG::q=44488L; const word16 LC_RNG::a=(unsigned int)48271L; const word16 LC_RNG::r=3399; #else const word32 LC_RNG::m=2147483647L; const word32 LC_RNG::q=127773L; const word16 LC_RNG::a=16807; const word16 LC_RNG::r=2836; #endif void LC_RNG::GenerateBlock(byte *output, size_t size) { while (size--) { word32 hi = seed/q; word32 lo = seed%q; long test = a*lo - r*hi; if (test > 0) seed = test; else seed = test+ m; *output++ = (GETBYTE(seed, 0) ^ GETBYTE(seed, 1) ^ GETBYTE(seed, 2) ^ GETBYTE(seed, 3)); } } // ******************************************************** #ifndef CRYPTOPP_IMPORTS X917RNG::X917RNG(BlockTransformation *c, const byte *seed, const byte *deterministicTimeVector) : cipher(c), S(cipher->BlockSize()), dtbuf(S), randseed(seed, S), m_lastBlock(S), m_deterministicTimeVector(deterministicTimeVector, deterministicTimeVector ? S : 0) { if (!deterministicTimeVector) { time_t tstamp1 = time(0); xorbuf(dtbuf, (byte *)&tstamp1, UnsignedMin(sizeof(tstamp1), S)); cipher->ProcessBlock(dtbuf); clock_t tstamp2 = clock(); xorbuf(dtbuf, (byte *)&tstamp2, UnsignedMin(sizeof(tstamp2), S)); cipher->ProcessBlock(dtbuf); } // for FIPS 140-2 GenerateBlock(m_lastBlock, S); } void X917RNG::GenerateIntoBufferedTransformation(BufferedTransformation &target, const std::string &channel, lword size) { while (size > 0) { // calculate new enciphered timestamp if (m_deterministicTimeVector.size()) { cipher->ProcessBlock(m_deterministicTimeVector, dtbuf); IncrementCounterByOne(m_deterministicTimeVector, S); } else { clock_t c = clock(); xorbuf(dtbuf, (byte *)&c, UnsignedMin(sizeof(c), S)); time_t t = time(NULL); xorbuf(dtbuf+S-UnsignedMin(sizeof(t), S), (byte *)&t, UnsignedMin(sizeof(t), S)); cipher->ProcessBlock(dtbuf); } // combine enciphered timestamp with seed xorbuf(randseed, dtbuf, S); // generate a new block of random bytes cipher->ProcessBlock(randseed); if (memcmp(m_lastBlock, randseed, S) == 0) throw SelfTestFailure("X917RNG: Continuous random number generator test failed."); // output random bytes size_t len = UnsignedMin(S, size); target.ChannelPut(channel, randseed, len); size -= len; // compute new seed vector memcpy(m_lastBlock, randseed, S); xorbuf(randseed, dtbuf, S); cipher->ProcessBlock(randseed); } } #endif MaurerRandomnessTest::MaurerRandomnessTest() : sum(0.0), n(0) { for (unsigned i=0; i= Q) sum += log(double(n - tab[inByte])); tab[inByte] = n; n++; } return 0; } double MaurerRandomnessTest::GetTestValue() const { if (BytesNeeded() > 0) throw Exception(Exception::OTHER_ERROR, "MaurerRandomnessTest: " + IntToString(BytesNeeded()) + " more bytes of input needed"); double fTu = (sum/(n-Q))/log(2.0); // this is the test value defined by Maurer double value = fTu * 0.1392; // arbitrarily normalize it to return value > 1.0 ? 1.0 : value; // a number between 0 and 1 } NAMESPACE_END armory-0.92.3/cppForSwig/cryptopp/pwdbased.h0000755000000000000000000001452312414772654017545 0ustar rootroot// pwdbased.h - written and placed in the public domain by Wei Dai #ifndef CRYPTOPP_PWDBASED_H #define CRYPTOPP_PWDBASED_H #include "cryptlib.h" #include "hmac.h" #include "hrtimer.h" #include "integer.h" NAMESPACE_BEGIN(CryptoPP) //! abstract base class for password based key derivation function class PasswordBasedKeyDerivationFunction { public: virtual size_t MaxDerivedKeyLength() const =0; virtual bool UsesPurposeByte() const =0; //! derive key from password /*! If timeInSeconds != 0, will iterate until time elapsed, as measured by ThreadUserTimer Returns actual iteration count, which is equal to iterations if timeInSeconds == 0, and not less than iterations otherwise. */ virtual unsigned int DeriveKey(byte *derived, size_t derivedLen, byte purpose, const byte *password, size_t passwordLen, const byte *salt, size_t saltLen, unsigned int iterations, double timeInSeconds=0) const =0; }; //! PBKDF1 from PKCS #5, T should be a HashTransformation class template class PKCS5_PBKDF1 : public PasswordBasedKeyDerivationFunction { public: size_t MaxDerivedKeyLength() const {return T::DIGESTSIZE;} bool UsesPurposeByte() const {return false;} // PKCS #5 says PBKDF1 should only take 8-byte salts. This implementation allows salts of any length. unsigned int DeriveKey(byte *derived, size_t derivedLen, byte purpose, const byte *password, size_t passwordLen, const byte *salt, size_t saltLen, unsigned int iterations, double timeInSeconds=0) const; }; //! PBKDF2 from PKCS #5, T should be a HashTransformation class template class PKCS5_PBKDF2_HMAC : public PasswordBasedKeyDerivationFunction { public: size_t MaxDerivedKeyLength() const {return 0xffffffffU;} // should multiply by T::DIGESTSIZE, but gets overflow that way bool UsesPurposeByte() const {return false;} unsigned int DeriveKey(byte *derived, size_t derivedLen, byte purpose, const byte *password, size_t passwordLen, const byte *salt, size_t saltLen, unsigned int iterations, double timeInSeconds=0) const; }; /* class PBKDF2Params { public: SecByteBlock m_salt; unsigned int m_interationCount; ASNOptional > m_keyLength; }; */ template unsigned int PKCS5_PBKDF1::DeriveKey(byte *derived, size_t derivedLen, byte purpose, const byte *password, size_t passwordLen, const byte *salt, size_t saltLen, unsigned int iterations, double timeInSeconds) const { assert(derivedLen <= MaxDerivedKeyLength()); assert(iterations > 0 || timeInSeconds > 0); if (!iterations) iterations = 1; T hash; hash.Update(password, passwordLen); hash.Update(salt, saltLen); SecByteBlock buffer(hash.DigestSize()); hash.Final(buffer); unsigned int i; ThreadUserTimer timer; if (timeInSeconds) timer.StartTimer(); for (i=1; i unsigned int PKCS5_PBKDF2_HMAC::DeriveKey(byte *derived, size_t derivedLen, byte purpose, const byte *password, size_t passwordLen, const byte *salt, size_t saltLen, unsigned int iterations, double timeInSeconds) const { assert(derivedLen <= MaxDerivedKeyLength()); assert(iterations > 0 || timeInSeconds > 0); if (!iterations) iterations = 1; HMAC hmac(password, passwordLen); SecByteBlock buffer(hmac.DigestSize()); ThreadUserTimer timer; unsigned int i=1; while (derivedLen > 0) { hmac.Update(salt, saltLen); unsigned int j; for (j=0; j<4; j++) { byte b = byte(i >> ((3-j)*8)); hmac.Update(&b, 1); } hmac.Final(buffer); size_t segmentLen = STDMIN(derivedLen, buffer.size()); memcpy(derived, buffer, segmentLen); if (timeInSeconds) { timeInSeconds = timeInSeconds / ((derivedLen + buffer.size() - 1) / buffer.size()); timer.StartTimer(); } for (j=1; j class PKCS12_PBKDF : public PasswordBasedKeyDerivationFunction { public: size_t MaxDerivedKeyLength() const {return size_t(0)-1;} bool UsesPurposeByte() const {return true;} unsigned int DeriveKey(byte *derived, size_t derivedLen, byte purpose, const byte *password, size_t passwordLen, const byte *salt, size_t saltLen, unsigned int iterations, double timeInSeconds) const; }; template unsigned int PKCS12_PBKDF::DeriveKey(byte *derived, size_t derivedLen, byte purpose, const byte *password, size_t passwordLen, const byte *salt, size_t saltLen, unsigned int iterations, double timeInSeconds) const { assert(derivedLen <= MaxDerivedKeyLength()); assert(iterations > 0 || timeInSeconds > 0); if (!iterations) iterations = 1; const size_t v = T::BLOCKSIZE; // v is in bytes rather than bits as in PKCS #12 const size_t DLen = v, SLen = RoundUpToMultipleOf(saltLen, v); const size_t PLen = RoundUpToMultipleOf(passwordLen, v), ILen = SLen + PLen; SecByteBlock buffer(DLen + SLen + PLen); byte *D = buffer, *S = buffer+DLen, *P = buffer+DLen+SLen, *I = S; memset(D, purpose, DLen); size_t i; for (i=0; i 0) { hash.CalculateDigest(Ai, buffer, buffer.size()); if (timeInSeconds) { timeInSeconds = timeInSeconds / ((derivedLen + Ai.size() - 1) / Ai.size()); timer.StartTimer(); } for (i=1; i #include USING_NAMESPACE(CryptoPP) USING_NAMESPACE(std) typedef std::map TestData; class TestFailure : public Exception { public: TestFailure() : Exception(OTHER_ERROR, "Validation test failed") {} }; static const TestData *s_currentTestData = NULL; static void OutputTestData(const TestData &v) { for (TestData::const_iterator i = v.begin(); i != v.end(); ++i) { cerr << i->first << ": " << i->second << endl; } } static void SignalTestFailure() { OutputTestData(*s_currentTestData); throw TestFailure(); } static void SignalTestError() { OutputTestData(*s_currentTestData); throw Exception(Exception::OTHER_ERROR, "Unexpected error during validation test"); } bool DataExists(const TestData &data, const char *name) { TestData::const_iterator i = data.find(name); return (i != data.end()); } const std::string & GetRequiredDatum(const TestData &data, const char *name) { TestData::const_iterator i = data.find(name); if (i == data.end()) SignalTestError(); return i->second; } void RandomizedTransfer(BufferedTransformation &source, BufferedTransformation &target, bool finish, const std::string &channel=DEFAULT_CHANNEL) { while (source.MaxRetrievable() > (finish ? 0 : 4096)) { byte buf[4096+64]; size_t start = GlobalRNG().GenerateWord32(0, 63); size_t len = GlobalRNG().GenerateWord32(1, UnsignedMin(4096U, 3*source.MaxRetrievable()/2)); len = source.Get(buf+start, len); target.ChannelPut(channel, buf+start, len); } } void PutDecodedDatumInto(const TestData &data, const char *name, BufferedTransformation &target) { std::string s1 = GetRequiredDatum(data, name), s2; ByteQueue q; while (!s1.empty()) { while (s1[0] == ' ') { s1 = s1.substr(1); if (s1.empty()) goto end; // avoid invalid read if s1 is empty } int repeat = 1; if (s1[0] == 'r') { repeat = atoi(s1.c_str()+1); s1 = s1.substr(s1.find(' ')+1); } s2 = ""; // MSVC 6 doesn't have clear(); if (s1[0] == '\"') { s2 = s1.substr(1, s1.find('\"', 1)-1); s1 = s1.substr(s2.length() + 2); } else if (s1.substr(0, 2) == "0x") { StringSource(s1.substr(2, s1.find(' ')), true, new HexDecoder(new StringSink(s2))); s1 = s1.substr(STDMIN(s1.find(' '), s1.length())); } else { StringSource(s1.substr(0, s1.find(' ')), true, new HexDecoder(new StringSink(s2))); s1 = s1.substr(STDMIN(s1.find(' '), s1.length())); } while (repeat--) { q.Put((const byte *)s2.data(), s2.size()); RandomizedTransfer(q, target, false); } } end: RandomizedTransfer(q, target, true); } std::string GetDecodedDatum(const TestData &data, const char *name) { std::string s; PutDecodedDatumInto(data, name, StringSink(s).Ref()); return s; } std::string GetOptionalDecodedDatum(const TestData &data, const char *name) { std::string s; if (DataExists(data, name)) PutDecodedDatumInto(data, name, StringSink(s).Ref()); return s; } class TestDataNameValuePairs : public NameValuePairs { public: TestDataNameValuePairs(const TestData &data) : m_data(data) {} virtual bool GetVoidValue(const char *name, const std::type_info &valueType, void *pValue) const { TestData::const_iterator i = m_data.find(name); if (i == m_data.end()) { if (std::string(name) == Name::DigestSize() && valueType == typeid(int)) { i = m_data.find("MAC"); if (i == m_data.end()) i = m_data.find("Digest"); if (i == m_data.end()) return false; m_temp.resize(0); PutDecodedDatumInto(m_data, i->first.c_str(), StringSink(m_temp).Ref()); *reinterpret_cast(pValue) = (int)m_temp.size(); return true; } else return false; } const std::string &value = i->second; if (valueType == typeid(int)) *reinterpret_cast(pValue) = atoi(value.c_str()); else if (valueType == typeid(Integer)) *reinterpret_cast(pValue) = Integer((std::string(value) + "h").c_str()); else if (valueType == typeid(ConstByteArrayParameter)) { m_temp.resize(0); PutDecodedDatumInto(m_data, name, StringSink(m_temp).Ref()); reinterpret_cast(pValue)->Assign((const byte *)m_temp.data(), m_temp.size(), false); } else throw ValueTypeMismatch(name, typeid(std::string), valueType); return true; } private: const TestData &m_data; mutable std::string m_temp; }; void TestKeyPairValidAndConsistent(CryptoMaterial &pub, const CryptoMaterial &priv) { if (!pub.Validate(GlobalRNG(), 3)) SignalTestFailure(); if (!priv.Validate(GlobalRNG(), 3)) SignalTestFailure(); /* EqualityComparisonFilter comparison; pub.Save(ChannelSwitch(comparison, "0")); pub.AssignFrom(priv); pub.Save(ChannelSwitch(comparison, "1")); comparison.ChannelMessageSeriesEnd("0"); comparison.ChannelMessageSeriesEnd("1"); */ } void TestSignatureScheme(TestData &v) { std::string name = GetRequiredDatum(v, "Name"); std::string test = GetRequiredDatum(v, "Test"); std::auto_ptr signer(ObjectFactoryRegistry::Registry().CreateObject(name.c_str())); std::auto_ptr verifier(ObjectFactoryRegistry::Registry().CreateObject(name.c_str())); TestDataNameValuePairs pairs(v); std::string keyFormat = GetRequiredDatum(v, "KeyFormat"); if (keyFormat == "DER") verifier->AccessMaterial().Load(StringStore(GetDecodedDatum(v, "PublicKey")).Ref()); else if (keyFormat == "Component") verifier->AccessMaterial().AssignFrom(pairs); if (test == "Verify" || test == "NotVerify") { VerifierFilter verifierFilter(*verifier, NULL, VerifierFilter::SIGNATURE_AT_BEGIN); PutDecodedDatumInto(v, "Signature", verifierFilter); PutDecodedDatumInto(v, "Message", verifierFilter); verifierFilter.MessageEnd(); if (verifierFilter.GetLastResult() == (test == "NotVerify")) SignalTestFailure(); } else if (test == "PublicKeyValid") { if (!verifier->GetMaterial().Validate(GlobalRNG(), 3)) SignalTestFailure(); } else goto privateKeyTests; return; privateKeyTests: if (keyFormat == "DER") signer->AccessMaterial().Load(StringStore(GetDecodedDatum(v, "PrivateKey")).Ref()); else if (keyFormat == "Component") signer->AccessMaterial().AssignFrom(pairs); if (test == "KeyPairValidAndConsistent") { TestKeyPairValidAndConsistent(verifier->AccessMaterial(), signer->GetMaterial()); } else if (test == "Sign") { SignerFilter f(GlobalRNG(), *signer, new HexEncoder(new FileSink(cout))); StringSource ss(GetDecodedDatum(v, "Message"), true, new Redirector(f)); SignalTestFailure(); } else if (test == "DeterministicSign") { SignalTestError(); assert(false); // TODO: implement } else if (test == "RandomSign") { SignalTestError(); assert(false); // TODO: implement } else if (test == "GenerateKey") { SignalTestError(); assert(false); } else { SignalTestError(); assert(false); } } void TestAsymmetricCipher(TestData &v) { std::string name = GetRequiredDatum(v, "Name"); std::string test = GetRequiredDatum(v, "Test"); std::auto_ptr encryptor(ObjectFactoryRegistry::Registry().CreateObject(name.c_str())); std::auto_ptr decryptor(ObjectFactoryRegistry::Registry().CreateObject(name.c_str())); std::string keyFormat = GetRequiredDatum(v, "KeyFormat"); if (keyFormat == "DER") { decryptor->AccessMaterial().Load(StringStore(GetDecodedDatum(v, "PrivateKey")).Ref()); encryptor->AccessMaterial().Load(StringStore(GetDecodedDatum(v, "PublicKey")).Ref()); } else if (keyFormat == "Component") { TestDataNameValuePairs pairs(v); decryptor->AccessMaterial().AssignFrom(pairs); encryptor->AccessMaterial().AssignFrom(pairs); } if (test == "DecryptMatch") { std::string decrypted, expected = GetDecodedDatum(v, "Plaintext"); StringSource ss(GetDecodedDatum(v, "Ciphertext"), true, new PK_DecryptorFilter(GlobalRNG(), *decryptor, new StringSink(decrypted))); if (decrypted != expected) SignalTestFailure(); } else if (test == "KeyPairValidAndConsistent") { TestKeyPairValidAndConsistent(encryptor->AccessMaterial(), decryptor->GetMaterial()); } else { SignalTestError(); assert(false); } } void TestSymmetricCipher(TestData &v, const NameValuePairs &overrideParameters) { std::string name = GetRequiredDatum(v, "Name"); std::string test = GetRequiredDatum(v, "Test"); std::string key = GetDecodedDatum(v, "Key"); std::string plaintext = GetDecodedDatum(v, "Plaintext"); TestDataNameValuePairs testDataPairs(v); CombinedNameValuePairs pairs(overrideParameters, testDataPairs); if (test == "Encrypt" || test == "EncryptXorDigest" || test == "Resync" || test == "EncryptionMCT" || test == "DecryptionMCT") { static member_ptr encryptor, decryptor; static std::string lastName; if (name != lastName) { encryptor.reset(ObjectFactoryRegistry::Registry().CreateObject(name.c_str())); decryptor.reset(ObjectFactoryRegistry::Registry().CreateObject(name.c_str())); lastName = name; } ConstByteArrayParameter iv; if (pairs.GetValue(Name::IV(), iv) && iv.size() != encryptor->IVSize()) SignalTestFailure(); if (test == "Resync") { encryptor->Resynchronize(iv.begin(), (int)iv.size()); decryptor->Resynchronize(iv.begin(), (int)iv.size()); } else { encryptor->SetKey((const byte *)key.data(), key.size(), pairs); decryptor->SetKey((const byte *)key.data(), key.size(), pairs); } int seek = pairs.GetIntValueWithDefault("Seek", 0); if (seek) { encryptor->Seek(seek); decryptor->Seek(seek); } std::string encrypted, xorDigest, ciphertext, ciphertextXorDigest; if (test == "EncryptionMCT" || test == "DecryptionMCT") { SymmetricCipher *cipher = encryptor.get(); SecByteBlock buf((byte *)plaintext.data(), plaintext.size()), keybuf((byte *)key.data(), key.size()); if (test == "DecryptionMCT") { cipher = decryptor.get(); ciphertext = GetDecodedDatum(v, "Ciphertext"); buf.Assign((byte *)ciphertext.data(), ciphertext.size()); } for (int i=0; i<400; i++) { encrypted.reserve(10000 * plaintext.size()); for (int j=0; j<10000; j++) { cipher->ProcessString(buf.begin(), buf.size()); encrypted.append((char *)buf.begin(), buf.size()); } encrypted.erase(0, encrypted.size() - keybuf.size()); xorbuf(keybuf.begin(), (const byte *)encrypted.data(), keybuf.size()); cipher->SetKey(keybuf, keybuf.size()); } encrypted.assign((char *)buf.begin(), buf.size()); ciphertext = GetDecodedDatum(v, test == "EncryptionMCT" ? "Ciphertext" : "Plaintext"); if (encrypted != ciphertext) { std::cout << "incorrectly encrypted: "; StringSource xx(encrypted, false, new HexEncoder(new FileSink(std::cout))); xx.Pump(256); xx.Flush(false); std::cout << "\n"; SignalTestFailure(); } return; } StreamTransformationFilter encFilter(*encryptor, new StringSink(encrypted), StreamTransformationFilter::NO_PADDING); RandomizedTransfer(StringStore(plaintext).Ref(), encFilter, true); encFilter.MessageEnd(); /*{ std::string z; encryptor->Seek(seek); StringSource ss(plaintext, false, new StreamTransformationFilter(*encryptor, new StringSink(z), StreamTransformationFilter::NO_PADDING)); while (ss.Pump(64)) {} ss.PumpAll(); for (int i=0; i asc1, asc2; asc1.reset(ObjectFactoryRegistry::Registry().CreateObject(name.c_str())); asc2.reset(ObjectFactoryRegistry::Registry().CreateObject(name.c_str())); asc1->SetKey((const byte *)key.data(), key.size(), pairs); asc2->SetKey((const byte *)key.data(), key.size(), pairs); std::string encrypted, decrypted; AuthenticatedEncryptionFilter ef(*asc1, new StringSink(encrypted)); bool macAtBegin = !mac.empty() && !GlobalRNG().GenerateBit(); // test both ways randomly AuthenticatedDecryptionFilter df(*asc2, new StringSink(decrypted), macAtBegin ? AuthenticatedDecryptionFilter::MAC_AT_BEGIN : 0); if (asc1->NeedsPrespecifiedDataLengths()) { asc1->SpecifyDataLengths(header.size(), plaintext.size(), footer.size()); asc2->SpecifyDataLengths(header.size(), plaintext.size(), footer.size()); } StringStore sh(header), sp(plaintext), sc(ciphertext), sf(footer), sm(mac); if (macAtBegin) RandomizedTransfer(sm, df, true); sh.CopyTo(df, LWORD_MAX, AAD_CHANNEL); RandomizedTransfer(sc, df, true); sf.CopyTo(df, LWORD_MAX, AAD_CHANNEL); if (!macAtBegin) RandomizedTransfer(sm, df, true); df.MessageEnd(); RandomizedTransfer(sh, ef, true, AAD_CHANNEL); RandomizedTransfer(sp, ef, true); RandomizedTransfer(sf, ef, true, AAD_CHANNEL); ef.MessageEnd(); if (test == "Encrypt" && encrypted != ciphertext+mac) { std::cout << "incorrectly encrypted: "; StringSource xx(encrypted, false, new HexEncoder(new FileSink(std::cout))); xx.Pump(2048); xx.Flush(false); std::cout << "\n"; SignalTestFailure(); } if (test == "Encrypt" && decrypted != plaintext) { std::cout << "incorrectly decrypted: "; StringSource xx(decrypted, false, new HexEncoder(new FileSink(std::cout))); xx.Pump(256); xx.Flush(false); std::cout << "\n"; SignalTestFailure(); } if (ciphertext.size()+mac.size()-plaintext.size() != asc1->DigestSize()) { std::cout << "bad MAC size\n"; SignalTestFailure(); } if (df.GetLastResult() != (test == "Encrypt")) { std::cout << "MAC incorrectly verified\n"; SignalTestFailure(); } } else { std::cout << "unexpected test name\n"; SignalTestError(); } } void TestDigestOrMAC(TestData &v, bool testDigest) { std::string name = GetRequiredDatum(v, "Name"); std::string test = GetRequiredDatum(v, "Test"); const char *digestName = testDigest ? "Digest" : "MAC"; member_ptr mac; member_ptr hash; HashTransformation *pHash = NULL; TestDataNameValuePairs pairs(v); if (testDigest) { hash.reset(ObjectFactoryRegistry::Registry().CreateObject(name.c_str())); pHash = hash.get(); } else { mac.reset(ObjectFactoryRegistry::Registry().CreateObject(name.c_str())); pHash = mac.get(); std::string key = GetDecodedDatum(v, "Key"); mac->SetKey((const byte *)key.c_str(), key.size(), pairs); } if (test == "Verify" || test == "VerifyTruncated" || test == "NotVerify") { int digestSize = -1; if (test == "VerifyTruncated") pairs.GetIntValue(Name::DigestSize(), digestSize); HashVerificationFilter verifierFilter(*pHash, NULL, HashVerificationFilter::HASH_AT_BEGIN, digestSize); PutDecodedDatumInto(v, digestName, verifierFilter); PutDecodedDatumInto(v, "Message", verifierFilter); verifierFilter.MessageEnd(); if (verifierFilter.GetLastResult() == (test == "NotVerify")) SignalTestFailure(); } else { SignalTestError(); assert(false); } } bool GetField(std::istream &is, std::string &name, std::string &value) { name.resize(0); // GCC workaround: 2.95.3 doesn't have clear() is >> name; if (name.empty()) return false; if (name[name.size()-1] != ':') { char c; is >> skipws >> c; if (c != ':') SignalTestError(); } else name.erase(name.size()-1); while (is.peek() == ' ') is.ignore(1); // VC60 workaround: getline bug char buffer[128]; value.resize(0); // GCC workaround: 2.95.3 doesn't have clear() bool continueLine; do { do { is.get(buffer, sizeof(buffer)); value += buffer; } while (buffer[0] != 0); is.clear(); is.ignore(); if (!value.empty() && value[value.size()-1] == '\r') value.resize(value.size()-1); if (!value.empty() && value[value.size()-1] == '\\') { value.resize(value.size()-1); continueLine = true; } else continueLine = false; std::string::size_type i = value.find('#'); if (i != std::string::npos) value.erase(i); } while (continueLine); return true; } void OutputPair(const NameValuePairs &v, const char *name) { Integer x; bool b = v.GetValue(name, x); assert(b); cout << name << ": \\\n "; x.Encode(HexEncoder(new FileSink(cout), false, 64, "\\\n ").Ref(), x.MinEncodedSize()); cout << endl; } void OutputNameValuePairs(const NameValuePairs &v) { std::string names = v.GetValueNames(); string::size_type i = 0; while (i < names.size()) { string::size_type j = names.find_first_of (';', i); if (j == string::npos) return; else { std::string name = names.substr(i, j-i); if (name.find(':') == string::npos) OutputPair(v, name.c_str()); } i = j + 1; } } void TestDataFile(const std::string &filename, const NameValuePairs &overrideParameters, unsigned int &totalTests, unsigned int &failedTests) { std::ifstream file(filename.c_str()); if (!file.good()) throw Exception(Exception::OTHER_ERROR, "Can not open file " + filename + " for reading"); TestData v; s_currentTestData = &v; std::string name, value, lastAlgName; while (file) { while (file.peek() == '#') file.ignore(INT_MAX, '\n'); if (file.peek() == '\n' || file.peek() == '\r') v.clear(); if (!GetField(file, name, value)) break; v[name] = value; if (name == "Test") { bool failed = true; std::string algType = GetRequiredDatum(v, "AlgorithmType"); if (lastAlgName != GetRequiredDatum(v, "Name")) { lastAlgName = GetRequiredDatum(v, "Name"); cout << "\nTesting " << algType.c_str() << " algorithm " << lastAlgName.c_str() << ".\n"; } try { if (algType == "Signature") TestSignatureScheme(v); else if (algType == "SymmetricCipher") TestSymmetricCipher(v, overrideParameters); else if (algType == "AuthenticatedSymmetricCipher") TestAuthenticatedSymmetricCipher(v, overrideParameters); else if (algType == "AsymmetricCipher") TestAsymmetricCipher(v); else if (algType == "MessageDigest") TestDigestOrMAC(v, true); else if (algType == "MAC") TestDigestOrMAC(v, false); else if (algType == "FileList") TestDataFile(GetRequiredDatum(v, "Test"), g_nullNameValuePairs, totalTests, failedTests); else SignalTestError(); failed = false; } catch (TestFailure &) { cout << "\nTest failed.\n"; } catch (CryptoPP::Exception &e) { cout << "\nCryptoPP::Exception caught: " << e.what() << endl; } catch (std::exception &e) { cout << "\nstd::exception caught: " << e.what() << endl; } if (failed) { cout << "Skipping to next test.\n"; failedTests++; } else cout << "." << flush; totalTests++; } } } bool RunTestDataFile(const char *filename, const NameValuePairs &overrideParameters) { unsigned int totalTests = 0, failedTests = 0; TestDataFile(filename, overrideParameters, totalTests, failedTests); cout << dec << "\nTests complete. Total tests = " << totalTests << ". Failed tests = " << failedTests << ".\n"; if (failedTests != 0) cout << "SOME TESTS FAILED!\n"; return failedTests == 0; } armory-0.92.3/cppForSwig/cryptopp/authenc.h0000755000000000000000000000364712414772654017410 0ustar rootroot#ifndef CRYPTOPP_AUTHENC_H #define CRYPTOPP_AUTHENC_H #include "cryptlib.h" #include "secblock.h" NAMESPACE_BEGIN(CryptoPP) //! . class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE AuthenticatedSymmetricCipherBase : public AuthenticatedSymmetricCipher { public: AuthenticatedSymmetricCipherBase() : m_state(State_Start) {} bool IsRandomAccess() const {return false;} bool IsSelfInverting() const {return true;} void UncheckedSetKey(const byte *,unsigned int,const CryptoPP::NameValuePairs &) {assert(false);} void SetKey(const byte *userKey, size_t keylength, const NameValuePairs ¶ms); void Restart() {if (m_state > State_KeySet) m_state = State_KeySet;} void Resynchronize(const byte *iv, int length=-1); void Update(const byte *input, size_t length); void ProcessData(byte *outString, const byte *inString, size_t length); void TruncatedFinal(byte *mac, size_t macSize); protected: void AuthenticateData(const byte *data, size_t len); const SymmetricCipher & GetSymmetricCipher() const {return const_cast(this)->AccessSymmetricCipher();}; virtual SymmetricCipher & AccessSymmetricCipher() =0; virtual bool AuthenticationIsOnPlaintext() const =0; virtual unsigned int AuthenticationBlockSize() const =0; virtual void SetKeyWithoutResync(const byte *userKey, size_t keylength, const NameValuePairs ¶ms) =0; virtual void Resync(const byte *iv, size_t len) =0; virtual size_t AuthenticateBlocks(const byte *data, size_t len) =0; virtual void AuthenticateLastHeaderBlock() =0; virtual void AuthenticateLastConfidentialBlock() {} virtual void AuthenticateLastFooterBlock(byte *mac, size_t macSize) =0; enum State {State_Start, State_KeySet, State_IVSet, State_AuthUntransformed, State_AuthTransformed, State_AuthFooter}; State m_state; unsigned int m_bufferedDataLength; lword m_totalHeaderLength, m_totalMessageLength, m_totalFooterLength; AlignedSecByteBlock m_buffer; }; NAMESPACE_END #endif armory-0.92.3/cppForSwig/BitcoinArmory_SwigDLL/0000755000000000000000000000000012414772654020021 5ustar rootrootarmory-0.92.3/cppForSwig/BitcoinArmory_SwigDLL/BitcoinArmory_SwigDLL.vcxproj0000644000000000000000000006155712414772654025562 0ustar rootroot Debug Win32 Debug x64 Release Win32 Release x64 WinXP_32 Win32 WinXP_32 x64 {19329A6B-FE96-4917-B69A-2B0375C12017} Win32Proj BitcoinArmory_CppTests DynamicLibrary true v110 MultiByte false DynamicLibrary true v110 MultiByte true DynamicLibrary true v110 MultiByte DynamicLibrary true v110 MultiByte DynamicLibrary false v110 true MultiByte DynamicLibrary false v100 true MultiByte DynamicLibrary false v110 true MultiByte DynamicLibrary false v110 true MultiByte v100 v110 v100 true DynamicLibrary MultiByte v110 true $(SolutionDir)libs\$(Platform)\ $(ProjectName)_d $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ true $(SolutionDir)libs\$(Platform)\Win_XP $(ProjectName)_d $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ $(ProjectName)_d true $(SolutionDir)libs\x64 $(ProjectName)_d true $(SolutionDir)libs\x64 true $(SolutionDir)libs\$(Platform)\ $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ false $(SolutionDir)libs\$(Platform)\ $(SolutionDir)libs\IntermediateBuildFiles\$(Configuration).$(ProjectName)\ false $(SolutionDir)libs\x64 false $(SolutionDir)libs\x64 $(SolutionDir)libs\$(Platform)\Win_XP Level3 Disabled WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions) ..\leveldb;..\leveldb\include;..\leveldb_windows_port\win32_posix;..\cryptopp;C:\Python27\include;C:\Python26\include;%(AdditionalIncludeDirectories) MultiThreadedDebug Console true cryptopp_d.lib;leveldb_msvc11_port_d.lib;%(AdditionalDependencies) ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x86;..\pthreads-w32-2-9-1-release\Pre-built.2\dll\x86;$(SolutionDir)libs\$(Platform)\;C:\WinDDK\7600.16385.1\lib\ATL\i386;C:\Python27\libs;C:\Python26\libs;%(AdditionalLibraryDirectories) copy ..\libs\Win32\BitcoinArmory_SwigDLL_d.dll ..\..\_CppBlockUtils.pyd C:\Python27\Lib\site-packages\PyQt4\pyrcc4.exe -o ..\..\qrc_img_resources.py ..\..\imgList.xml ..\swigwin\swig.exe -c++ -python -threads -classic -outdir ..\..\ -v ..\CppBlockUtils.i Level3 Full WIN32;_CONSOLE;_CRT_SECURE_NO_WARNINGS;_MSC_PLATFORM_TOOLSET=$(PlatformToolset);%(PreprocessorDefinitions) ..\leveldb;..\leveldb\include;..\leveldb_windows_port\win32_posix;..\cryptopp;C:\Python27\include;C:\Python26\include;%(AdditionalIncludeDirectories) MultiThreaded None Default Console false cryptopp_d.lib;leveldb_msvc11_port_d.lib;%(AdditionalDependencies) ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x86;..\pthreads-w32-2-9-1-release\Pre-built.2\dll\x86;$(SolutionDir)libs\$(Platform)\Win_XP;C:\WinDDK\7600.16385.1\lib\ATL\i386;C:\Python27\libs;C:\Python26\libs;%(AdditionalLibraryDirectories) copy ..\libs\Win32\BitcoinArmory_SwigDLL_d.dll ..\..\_CppBlockUtils.pyd C:\Python27\Lib\site-packages\PyQt4\pyrcc4.exe -o ..\..\qrc_img_resources.py ..\..\imgList.xml Level3 Disabled WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions) ..\leveldb;..\leveldb\include;..\leveldb_windows_port\win32_posix;..\cryptopp;C:\Python27\include;C:\Python26\include;%(AdditionalIncludeDirectories) MultiThreadedDebug Console true cryptopp_d.lib;leveldb_msvc11_port_d.lib;%(AdditionalDependencies) ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x64;$(SolutionDir)libs\$(Platform)\;C:\Python27_64\libs;C:\Python26\libs;%(AdditionalLibraryDirectories) copy ..\libs\x64\BitcoinArmory_SwigDLL_d.dll ..\..\_CppBlockUtils.pyd C:\Python27_64\Lib\site-packages\PyQt4\pyrcc4.exe -o ..\..\qrc_img_resources.py ..\..\imgList.xml ..\swigwin\swig.exe -c++ -python -threads -classic -outdir ..\..\ -v ..\CppBlockUtils.i Level3 Disabled WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions) ..\leveldb;..\leveldb\include;..\leveldb_windows_port\win32_posix;..\cryptopp;C:\Python27\include;C:\Python26\include;%(AdditionalIncludeDirectories) MultiThreadedDebug Console true cryptopp_d.lib;leveldb_msvc11_port_d.lib;%(AdditionalDependencies) ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x64;$(SolutionDir)libs\$(Platform)\;C:\Python27_64\libs;C:\Python26\libs;%(AdditionalLibraryDirectories) copy ..\libs\x64\BitcoinArmory_SwigDLL_d.dll ..\..\_CppBlockUtils.pyd C:\Python27_64\Lib\site-packages\PyQt4\pyrcc4.exe -o ..\..\qrc_img_resources.py ..\..\imgList.xml Level3 NotUsing Full true true _CRT_SECURE_NO_WARNINGS;_MSC_PLATFORM_TOOLSET=$(PlatformToolset);%(PreprocessorDefinitions) ..\leveldb;..\leveldb\include;..\cryptopp;C:\Python27\include;C:\Python26\include;..\leveldb_windows_port\win32_posix;%(AdditionalIncludeDirectories) MultiThreaded Speed true None CompileAsCpp Console false false true $(SolutionDir)libs\$(Platform)\;C:\Python27\libs;C:\Python26\libs;%(AdditionalLibraryDirectories) cryptopp.lib;leveldb_msvc11_port.lib;%(AdditionalDependencies) ..\swigwin\swig.exe -c++ -python -threads -classic -outdir ..\..\ -v ..\CppBlockUtils.i build_installer.bat copy ..\libs\Win32\BitcoinArmory_SwigDLL.dll ..\..\_CppBlockUtils.pyd false false Level3 MaxSpeed true true WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;_MSC_PLATFORM_TOOLSET=$(PlatformToolset);%(PreprocessorDefinitions) ..\leveldb;..\leveldb\include;..\leveldb_windows_port\win32_posix;..\cryptopp;C:\Python27\include;C:\Python26\include;%(AdditionalIncludeDirectories) MultiThreaded Speed true Console false true true $(SolutionDir)libs\$(Platform)\Win_XP;C:\Python27\libs;%(AdditionalLibraryDirectories) cryptopp.lib;leveldb_msvc11_port.lib;%(AdditionalDependencies) ..\swigwin\swig.exe -c++ -python -threads -classic -outdir ..\..\ -v ..\CppBlockUtils.i ..\..\build_installer.bat Level3 MaxSpeed true true WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions) ..\leveldb;..\leveldb\include;..\leveldb_windows_port\win32_posix;..\cryptopp;C:\Python27\include;C:\Python26\include;%(AdditionalIncludeDirectories) MultiThreaded Console false true true C:\Python27_64\libs;..\libs\x64;%(AdditionalLibraryDirectories) cryptopp.lib;leveldb_msvc11_port.lib;%(AdditionalDependencies) ..\swigwin\swig.exe -c++ -python -threads -classic -outdir ..\..\ -v ..\CppBlockUtils.i ..\..\build_installer_64.bat Level3 MaxSpeed true true WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions) ..\leveldb;..\leveldb\include;..\leveldb_windows_port\win32_posix;..\cryptopp;C:\Python27\include;C:\Python26\include;%(AdditionalIncludeDirectories) MultiThreaded Console false true true C:\Python27_64\libs;..\libs\x64;..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x64;%(AdditionalLibraryDirectories) cryptopp.lib;leveldb_msvc11_port.lib;snappy.lib;pthreadVC2.lib;python27.lib;%(AdditionalDependencies) ..\swigwin\swig.exe -c++ -python -threads -classic -outdir ..\..\ -v ..\CppBlockUtils.i ..\..\build_installer_64.bat WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;_MSC_PLATFORM_TOOLSET=100;%(PreprocessorDefinitions) ..\leveldb;..\leveldb\include;..\leveldb_windows_port\win32_posix;..\cryptopp;C:\Python27\include;C:\Python26\include;%(AdditionalIncludeDirectories) MultiThreaded ..\pthreads-w32-2-9-1-release\Pre-built.2\lib\x86;..\libs\$(Platform)\Win_XP;C:\Python27\libs;C:\Python26\libs;%(AdditionalLibraryDirectories) cryptopp.lib;leveldb_msvc11_port.lib;pthreadVC2.lib;%(AdditionalDependencies) false Console ..\swigwin\swig.exe -c++ -python -threads -classic -outdir ..\..\ -v ..\CppBlockUtils.i armory-0.92.3/cppForSwig/BitcoinArmory_SwigDLL/BitcoinArmory_SwigDLL.vcxproj.filters0000644000000000000000000000452212414772654027216 0ustar rootroot Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Source Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files Header Files {e3f9bc8b-4d5f-43db-b89b-12060f5c13a2} {7fc64c57-ce9f-4864-8d81-e66466e48727} armory-0.92.3/cppForSwig/leveldb_wrapper.h0000644000000000000000000007117512414772654017254 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// // #ifndef _LEVELDB_WRAPPER_ #define _LEVELDB_WRAPPER_ #include #include #include "log.h" #include "BinaryData.h" #include "BtcUtils.h" #include "BlockObj.h" #include "StoredBlockObj.h" #include "leveldb/db.h" #include "leveldb/write_batch.h" #include "leveldb/cache.h" //#include "leveldb/filter_policy.h" //////////////////////////////////////////////////////////////////////////////// // // Create & manage a bunch of different databases // //////////////////////////////////////////////////////////////////////////////// #define STD_READ_OPTS leveldb::ReadOptions() #define STD_WRITE_OPTS leveldb::WriteOptions() #define KVLIST vector > #define DEFAULT_LDB_BLOCK_SIZE 32*1024 // Use this to create iterators that are intended for bulk scanning // It's actually that the ReadOptions::fill_cache arg needs to be false #define BULK_SCAN false class BlockHeader; class Tx; class TxIn; class TxOut; class TxRef; class TxIOPair; class GlobalDBUtilities; class StoredHeader; class StoredTx; class StoredTxOut; class StoredScriptHistory; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // NOTE: VERY IMPORTANT NOTE ABOUT THE DATABASE STRUCTURE // // Almost everywhere you see integers serialized throughout Bitcoin, is uses // little-endian. This is critical to follow because you are always handling // hashes of these serializations, so the byte-ordering matters. // // *HOWEVER*: // // This database design relies on the natural ordering of database // keys which are frequently concatenations of integers. For instance, each // block is indexed by height, and we expect an iteration over all keys will // traverse the blocks in height-order. BUT THIS DOESN'T WORK IF THE KEYS // ARE WRITTEN IN LITTLE-ENDIAN. Therefore, all serialized integers in // database KEYS are BIG-ENDIAN. All other serializations in database VALUES // are LITTLE-ENDIAN (including var_ints, and all put/get_uintX_t() calls). // // *HOWEVER-2*: // // This gets exceptionally confusing because some of the DB VALUES include // references to DB KEYS, thus requiring those specific serializations to be // BE, even though the rest of the data uses LE. // // REPEATED: // // Database Keys: BIG-ENDIAN integers // Database Values: LITTLE-ENDIAN integers // // // How to avoid getting yourself in a mess with this: // // Always use hgtx methods: // hgtxToHeight( BinaryData(4) ) // hgtxToDupID( BinaryData(4) ) // heightAndDupToHgtx( uint32_t, uint8_t) // // Always use BIGENDIAN for txIndex_ or txOutIndex_ serializations: // BinaryWriter.put_uint16_t(txIndex, BIGENDIAN); // BinaryWriter.put_uint16_t(txOutIndex, BIGENDIAN); // BinaryReader.get_uint16_t(BIGENDIAN); // BinaryReader.get_uint16_t(BIGENDIAN); // // // *OR* // // Don't mess with the internals of the DB! The public methods that are // used to access the data in the DB externally do not require an // understanding of how the data is actually serialized under the hood. // // //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // // InterfaceToLDB // // This is intended to be the only part of the project that communicates // directly with LevelDB objects. All the public methods only interact with // BinaryData, BinaryDataRef, and BinaryRefReader objects. // // As of this writing (the first implementation of this interface), the // interface and underlying DB structure is designed and tested for // ARMORY_DB_FULL and DB_PRUNE_NONE, which is essentially the same mode that // Armory used before the persistent blockchain upgrades. However, much of // the design decisions about how to store and access data was done to best // accommodate future implementation of pruned/lite modes, as well as a // supernode mode (which tracks all addresses and can be used to respond to // balance/UTXO queries from other nodes). There is still implementation // work to be done to enable these other modes, but it shouldn't require // changing the DB structure dramatically. The biggest modification will // adding and tracking undo-data to deal with reorgs in a pruned blockchain. // // NOTE 1: This class was designed with certain optimizations that may cause // unexpected behavior if you are not aware of it. The following // methods return/modify static member of InterfaceToLDB: // // getValue* // seekTo* // start*Iteration // advance* // // This is especially dangerous with getValueRef() which returns a // reference to lastGetValue_ which changes under you as soon as you // execute any other getValue* calls. This eliminates unnecessary // copying of DB data but can cause all sorts of problems if you are // doing sequences of find-and-modify operations. // // It is best to avoid getValueRef() unless you are sure that you // understand how to use it safely. Only use getValue() unless there // is reason to believe that the optimization is needed. // // // // NOTE 2: Batch writing operations are smoothed so that multiple, nested // startBatch-commitBatch calls do not actually do anything except // at the outer-most level. But this means that you MUST make sure // that there is a commit for every start, at every level. If you // return a value from a method sidestepping a required commitBatch // call, the code will stop writing to the DB at all! // //////////////////////////////////////////////////////////////////////////////// class LDBIter { public: // fill_cache argument should be false for large bulk scans LDBIter(void) { db_=NULL; iter_=NULL; isDirty_=true;} LDBIter(leveldb::DB* dbptr, bool fill_cache=true); ~LDBIter(void) { destroy(); } void destroy(void) {if(iter_!=NULL) delete iter_; iter_ = NULL; db_ = NULL;} bool isNull(void) { return iter_==NULL; } bool isValid(void) { return (!isNull() && iter_->Valid()); } bool isValid(DB_PREFIX dbpref); bool readIterData(void); bool advance(void); bool advance(DB_PREFIX prefix); bool advanceAndRead(void); bool advanceAndRead(DB_PREFIX prefix); BinaryData getKey(void) ; BinaryData getValue(void) ; BinaryDataRef getKeyRef(void) ; BinaryDataRef getValueRef(void) ; BinaryRefReader& getKeyReader(void) ; BinaryRefReader& getValueReader(void) ; // All the seekTo* methods do the exact same thing, the variant simply // determines the meaning of the return true/false value. bool seekTo(BinaryDataRef key); bool seekTo(DB_PREFIX pref, BinaryDataRef key); bool seekToExact(BinaryDataRef key); bool seekToExact(DB_PREFIX pref, BinaryDataRef key); bool seekToStartsWith(BinaryDataRef key); bool seekToStartsWith(DB_PREFIX prefix); bool seekToStartsWith(DB_PREFIX pref, BinaryDataRef key); bool seekToFirst(void); // Return true if the iterator is currently on valid data, with key match bool checkKeyExact(BinaryDataRef key); bool checkKeyExact(DB_PREFIX prefix, BinaryDataRef key); bool checkKeyStartsWith(BinaryDataRef key); bool checkKeyStartsWith(DB_PREFIX prefix, BinaryDataRef key); bool verifyPrefix(DB_PREFIX prefix, bool advanceReader=true); void resetReaders(void){currKey_.resetPosition();currValue_.resetPosition();} leveldb::Slice binaryDataToSlice(BinaryData const & bd) {return leveldb::Slice((char*)bd.getPtr(), bd.getSize());} leveldb::Slice binaryDataRefToSlice(BinaryDataRef const & bdr) {return leveldb::Slice((char*)bdr.getPtr(), bdr.getSize());} private: leveldb::DB* db_; leveldb::Iterator* iter_; BinaryRefReader currKey_; BinaryRefReader currValue_; bool isDirty_; }; //////////////////////////////////////////////////////////////////////////////// class InterfaceToLDB { private: ///////////////////////////////////////////////////////////////////////////// leveldb::Slice binaryDataToSlice(BinaryData const & bd) {return leveldb::Slice((char*)bd.getPtr(), bd.getSize());} leveldb::Slice binaryDataRefToSlice(BinaryDataRef const & bdr) {return leveldb::Slice((char*)bdr.getPtr(), bdr.getSize());} ///////////////////////////////////////////////////////////////////////////// // These four sliceTo* methods make copies, and thus safe to use even after // we have advanced the iterator to new data ///////////////////////////////////////////////////////////////////////////// BinaryData sliceToBinaryData( leveldb::Slice slice); void sliceToBinaryData( leveldb::Slice slice, BinaryData & bd); BinaryReader sliceToBinaryReader( leveldb::Slice slice); void sliceToBinaryReader( leveldb::Slice slice, BinaryReader & brr); ///////////////////////////////////////////////////////////////////////////// // The reamining sliceTo* methods are reference-based, which become // invalid after the iterator moves on. BinaryDataRef sliceToBinaryDataRef( leveldb::Slice slice); BinaryRefReader sliceToBinaryRefReader(leveldb::Slice slice); public: ///////////////////////////////////////////////////////////////////////////// InterfaceToLDB(void); ~InterfaceToLDB(void); ///////////////////////////////////////////////////////////////////////////// void init(void); ///////////////////////////////////////////////////////////////////////////// bool openDatabases(string basedir, BinaryData const & genesisBlkHash, BinaryData const & genesisTxHash, BinaryData const & magic, ARMORY_DB_TYPE dbtype=ARMORY_DB_WHATEVER, DB_PRUNE_TYPE pruneType=DB_PRUNE_WHATEVER); ///////////////////////////////////////////////////////////////////////////// void nukeHeadersDB(void); ///////////////////////////////////////////////////////////////////////////// void closeDatabases(void); ///////////////////////////////////////////////////////////////////////////// // Sometimes, we just need to nuke everything and start over void destroyAndResetDatabases(void); ///////////////////////////////////////////////////////////////////////////// bool databasesAreOpen(void) { return dbIsOpen_; } ///////////////////////////////////////////////////////////////////////////// // Get latest block info BinaryData getTopBlockHash(DB_SELECT db); uint32_t getTopBlockHeight(DB_SELECT db); ///////////////////////////////////////////////////////////////////////////// LDBIter getIterator(DB_SELECT db, bool fill_cache=true) { return LDBIter(dbs_[db], fill_cache); } ///////////////////////////////////////////////////////////////////////////// // Get value using pre-created slice BinaryData getValue(DB_SELECT db, leveldb::Slice ldbKey); ///////////////////////////////////////////////////////////////////////////// // Get value using BinaryData object. If you have a string, you can use // BinaryData key(string(theStr)); BinaryData getValue(DB_SELECT db, BinaryDataRef keyWithPrefix); ///////////////////////////////////////////////////////////////////////////// // Get value using BinaryData object. If you have a string, you can use // BinaryData key(string(theStr)); BinaryData getValue(DB_SELECT db, DB_PREFIX pref, BinaryDataRef key); ///////////////////////////////////////////////////////////////////////////// // Get value using BinaryDataRef object. The data from the get* call is // actually stored in a member variable, and thus the refs are valid only // until the next get* call. BinaryDataRef getValueRef(DB_SELECT db, BinaryDataRef keyWithPrefix); BinaryDataRef getValueRef(DB_SELECT db, DB_PREFIX prefix, BinaryDataRef key); ///////////////////////////////////////////////////////////////////////////// // Same as the getValueRef, in that they are only valid until the next get* // call. These are convenience methods which basically just save us BinaryRefReader getValueReader(DB_SELECT db, BinaryDataRef keyWithPrefix); BinaryRefReader getValueReader(DB_SELECT db, DB_PREFIX prefix, BinaryDataRef key); BinaryData getHashForDBKey(BinaryData dbkey); BinaryData getHashForDBKey(uint32_t hgt, uint8_t dup, uint16_t txi=UINT16_MAX, uint16_t txo=UINT16_MAX); ///////////////////////////////////////////////////////////////////////////// // Put value based on BinaryDataRefs key and value void putValue(DB_SELECT db, BinaryDataRef key, BinaryDataRef value); void putValue(DB_SELECT db, BinaryData const & key, BinaryData const & value); void putValue(DB_SELECT db, DB_PREFIX pref, BinaryDataRef key, BinaryDataRef value); ///////////////////////////////////////////////////////////////////////////// // Put value based on BinaryData key. If batch writing, pass in the batch void deleteValue(DB_SELECT db, BinaryDataRef key); void deleteValue(DB_SELECT db, DB_PREFIX pref, BinaryDataRef key); // Move the iterator in DB to the lowest entry with key >= inputKey bool seekTo(DB_SELECT db, BinaryDataRef key); bool seekTo(DB_SELECT db, DB_PREFIX pref, BinaryDataRef key); // Move the iterator to the first entry >= txHash bool seekToTxByHash(LDBIter & ldbIter, BinaryDataRef txHash); ///////////////////////////////////////////////////////////////////////////// // "Skip" refers to the behavior that the previous operation may have left // the iterator already on the next desired block. So our "advance" op may // have finished before it started. Alternatively, we may be on this block // because we checked it and decide we don't care, so we want to skip it. bool advanceToNextBlock(LDBIter & iter, bool skip=false); bool advanceIterAndRead(DB_SELECT, DB_PREFIX); bool dbIterIsValid(DB_SELECT db, DB_PREFIX prefix=DB_PREFIX_COUNT); ///////////////////////////////////////////////////////////////////////////// void readAllHeaders(map & headerMap, map & storedMap); ///////////////////////////////////////////////////////////////////////////// // When we're not in supernode mode, we're going to need to track only // specific addresses. We will keep a list of those addresses here. // UINT32_MAX for the "scannedUpToBlk" arg means that this address is totally // new and does not require a rescan. If you don't know when the scraddress // was created, use 0. Or if you know something, you can supply it. Though // in many cases, we will just do a full rescan if it's not totally new. void addRegisteredScript(BinaryDataRef rawScript, uint32_t scannedUpToBlk=UINT32_MAX); ///////////////////////////////////////////////////////////////////////////// bool startBlkDataIteration(LDBIter & iter, DB_PREFIX prefix); ///////////////////////////////////////////////////////////////////////////// void getNextBlock(void); ///////////////////////////////////////////////////////////////////////////// void getBlock(BlockHeader & bh, vector & txList, leveldb::Iterator* iter=NULL, bool ignoreMerkle = true); ///////////////////////////////////////////////////////////////////////////// void loadAllStoredHistory(void); map getHeaderMap(void); BinaryData getRawHeader(BinaryData const & headerHash); //bool addHeader(BinaryData const & headerHash, BinaryData const & headerRaw); ///////////////////////////////////////////////////////////////////////////// // All put/del ops will be batched/queued, and only executed when called // commitBatch(). We track the number calls to startBatch and commitBatch // and only write if we've called commit as many times as we called start. // In this way, we can have multiple levels starting and ending batches // without caring whether a batched operation is already in process or if // it's the first void startBatch(DB_SELECT db); void commitBatch(DB_SELECT db); bool isBatchOn(DB_SELECT db) { return batchStarts_[db] > 0; } ///////////////////////////////////////////////////////////////////////////// uint8_t getValidDupIDForHeight_fromDB(uint32_t blockHgt); uint8_t getValidDupIDForHeight(uint32_t blockHgt); void setValidDupIDForHeight(uint32_t blockHgt, uint8_t dup); //////////////////////////////////////////////////////////////////////////// uint8_t getDupForBlockHash(BinaryDataRef blockHash); ///////////////////////////////////////////////////////////////////////////// // Interface to translate Stored* objects to/from persistent DB storage ///////////////////////////////////////////////////////////////////////////// void putStoredDBInfo(DB_SELECT db, StoredDBInfo const & sdbi); bool getStoredDBInfo(DB_SELECT db, StoredDBInfo & sdbi, bool warn=true); ///////////////////////////////////////////////////////////////////////////// // BareHeaders are those int the HEADERS DB with no blockdta associated uint8_t putBareHeader(StoredHeader & sbh); bool getBareHeader(StoredHeader & sbh, uint32_t blkHgt, uint8_t dup); bool getBareHeader(StoredHeader & sbh, uint32_t blkHgt); bool getBareHeader(StoredHeader & sbh, BinaryDataRef headHash); ///////////////////////////////////////////////////////////////////////////// // StoredHeader accessors uint8_t putStoredHeader(StoredHeader & sbh, bool withBlkData=true); bool getStoredHeader(StoredHeader & sbh, uint32_t blockHgt, uint8_t blockDup=UINT8_MAX, bool withTx=true); bool getStoredHeader(StoredHeader & sbh, BinaryDataRef headHash, bool withTx=true); // This seemed unnecessary and was also causing conflicts with optional args //bool getStoredHeader(StoredHeader & sbh, //uint32_t blockHgt, //bool withTx=true); ///////////////////////////////////////////////////////////////////////////// // StoredTx Accessors void putStoredTx( StoredTx & st, bool withTxOut=true); bool getStoredTx( StoredTx & stx, BinaryDataRef txHashOrDBKey); bool getStoredTx_byDBKey( StoredTx & stx, BinaryDataRef dbKey); bool getStoredTx_byHash( StoredTx & stx, BinaryDataRef txHash); bool getStoredTx( StoredTx & st, uint32_t blkHgt, uint16_t txIndex, bool withTxOut=true); bool getStoredTx( StoredTx & st, uint32_t blkHgt, uint8_t dupID, uint16_t txIndex, bool withTxOut=true); ///////////////////////////////////////////////////////////////////////////// // StoredTxOut Accessors void putStoredTxOut( StoredTxOut const & sto); bool getStoredTxOut( StoredTxOut & stxo, uint32_t blockHeight, uint8_t dupID, uint16_t txIndex, uint16_t txOutIndex); bool getStoredTxOut( StoredTxOut & stxo, uint32_t blockHeight, uint16_t txIndex, uint16_t txOutIndex); void putStoredScriptHistory( StoredScriptHistory & ssh); void getStoredScriptHistory( StoredScriptHistory & ssh, BinaryDataRef scrAddrStr); void getStoredScriptHistorySummary( StoredScriptHistory & ssh, BinaryDataRef scrAddrStr); void getStoredScriptHistoryByRawScript( StoredScriptHistory & ssh, BinaryDataRef rawScript); // This method breaks from the convention I've used for getting/putting // stored objects, because we never really handle Sub-SSH objects directly, // but we do need to harness them. This method could be renamed to // "getPartialScriptHistory()" ... it reads the main // sub-SSH from DB and adds it to the supplied regular-SSH. bool fetchStoredSubHistory( StoredScriptHistory & ssh, BinaryData hgtX, bool createIfDNE=false, bool forceReadAndMerge=false); // This could go in StoredBlockObj if it didn't need to lookup DB data bool getFullUTXOMapForSSH(StoredScriptHistory & ssh, map & mapToFill, bool withMultisig=false); uint64_t getBalanceForScrAddr(BinaryDataRef scrAddr, bool withMulti=false); // TODO: We should probably implement some kind of method for accessing or // running calculations on an SSH without ever loading the entire // thing into RAM. // None of the SUD methods are implemented because we don't actually need // to read/write SUD to the database -- our only mode is ARMORY_DB_SUPER // which doesn't require storing undo data bool putStoredUndoData(StoredUndoData const & sud); bool getStoredUndoData(StoredUndoData & sud, uint32_t height); bool getStoredUndoData(StoredUndoData & sud, uint32_t height, uint8_t dup); bool getStoredUndoData(StoredUndoData & sud, BinaryDataRef headHash); bool putStoredTxHints(StoredTxHints const & sths); bool getStoredTxHints(StoredTxHints & sths, BinaryDataRef hashPrefix); void updatePreferredTxHint(BinaryDataRef hashOrPrefix, BinaryData preferKey); bool putStoredHeadHgtList(StoredHeadHgtList const & hhl); bool getStoredHeadHgtList(StoredHeadHgtList & hhl, uint32_t height); //////////////////////////////////////////////////////////////////////////// // Some methods to grab data at the current iterator location. Return // false if reading fails (maybe because we were expecting to find the // specified DB entry type, but the prefix byte indicated something else bool readStoredBlockAtIter(LDBIter & iter, StoredHeader & sbh); bool readStoredTxAtIter(LDBIter & iter, uint32_t height, uint8_t dupID, StoredTx & stx); bool readStoredTxOutAtIter(LDBIter & iter, uint32_t height, uint8_t dupID, uint16_t txIndex, StoredTxOut & stxo); bool readStoredScriptHistoryAtIter(LDBIter & iter, StoredScriptHistory & ssh); // TxRefs are much simpler with LDB than the previous FileDataPtr construct TxRef getTxRef( BinaryDataRef txHash); TxRef getTxRef( BinaryData hgtx, uint16_t txIndex); TxRef getTxRef( uint32_t hgt, uint8_t dup, uint16_t txIndex); // Sometimes we already know where the Tx is, but we don't know its hash Tx getFullTxCopy( BinaryData ldbKey6B ); Tx getFullTxCopy( uint32_t hgt, uint16_t txIndex); Tx getFullTxCopy( uint32_t hgt, uint8_t dup, uint16_t txIndex); TxOut getTxOutCopy( BinaryData ldbKey6B, uint16_t txOutIdx); TxIn getTxInCopy( BinaryData ldbKey6B, uint16_t txInIdx ); // Sometimes we already know where the Tx is, but we don't know its hash BinaryData getTxHashForLdbKey( BinaryDataRef ldbKey6B ); BinaryData getTxHashForHeightAndIndex( uint32_t height, uint16_t txIndex); BinaryData getTxHashForHeightAndIndex( uint32_t height, uint8_t dup, uint16_t txIndex); StoredTxHints getHintsForTxHash(BinaryDataRef txHash); //////////////////////////////////////////////////////////////////////////// bool markBlockHeaderValid(BinaryDataRef headHash); bool markBlockHeaderValid(uint32_t height, uint8_t dup); bool markTxEntryValid(uint32_t height, uint8_t dupID, uint16_t txIndex); ///////////////////////////////////////////////////////////////////////////// void computeUndoDataFromRawBlock(StoredHeader const & sbh, StoredUndoData & sud); void computeUndoDataFromRawBlock(BinaryDataRef rawBlock, StoredUndoData & sud); bool computeUndoDataForBlock(uint32_t height, uint8_t dupID, StoredUndoData & sud); ///////////////////////////////////////////////////////////////////////////// bool checkStatus(leveldb::Status stat, bool warn=true); void setMaxOpenFiles(uint32_t n) { maxOpenFiles_ = n; } uint32_t getMaxOpenFiles(void) { return maxOpenFiles_; } void setLdbBlockSize(uint32_t sz){ ldbBlockSize_ = sz; } uint32_t getLdbBlockSize(void) { return ldbBlockSize_; } KVLIST getAllDatabaseEntries(DB_SELECT db); void printAllDatabaseEntries(DB_SELECT db); void pprintBlkDataDB(uint32_t indent=3); BinaryData getGenesisBlockHash(void) { return genesisBlkHash_; } BinaryData getGenesisTxHash(void) { return genesisTxHash_; } BinaryData getMagicBytes(void) { return magicBytes_; } private: string baseDir_; BinaryData genesisBlkHash_; BinaryData genesisTxHash_; BinaryData magicBytes_; ARMORY_DB_TYPE armoryDbType_; DB_PRUNE_TYPE dbPruneType_; //leveldb::Iterator* iters_[2]; leveldb::WriteBatch* batches_[2]; leveldb::DB* dbs_[2]; string dbPaths_[2]; bool iterIsDirty_[2]; //leveldb::FilterPolicy* dbFilterPolicy_[2]; // This will be incremented every time startBatch is called, decremented // every time commitBatch is called. We will only *actually* start a new // batch when the value starts at zero, or commit when it ends at zero. uint32_t batchStarts_[2]; vector validDupByHeight_; //BinaryRefReader currReadKey_; //BinaryRefReader currReadValue_;; string lastGetValue_; bool dbIsOpen_; uint32_t ldbBlockSize_; uint32_t lowestScannedUpTo_; leveldb::Status lastStatus_; uint32_t maxOpenFiles_; // In this case, a address is any TxOut script, which is usually // just a 25-byte script. But this generically captures all types // of addresses including pubkey-only, P2SH, map registeredSSHs_; }; //////////////////////////////////////////////////////////////////////////////// // A semi-singleton class: this basically allows you class LevelDBWrapper { public: ///////////////////////////////////////////////////////////////////////////// static InterfaceToLDB & GetInterface(uint32_t i=0) { if(ifaceVect_.size() < i+1) { ifaceVect_.resize(i+1); ifaceVect_[i] = new InterfaceToLDB; ifaceVect_[i]->init(); } return *(ifaceVect_[i]); } ///////////////////////////////////////////////////////////////////////////// static InterfaceToLDB* GetInterfacePtr(uint32_t i=0) { if(ifaceVect_.size() < i+1) { ifaceVect_.resize(i+1); ifaceVect_[i] = new InterfaceToLDB; ifaceVect_[i]->init(); } return ifaceVect_[i]; } private: static vector ifaceVect_; }; #endif armory-0.92.3/cppForSwig/leveldb_wrapper.cpp0000644000000000000000000025115612414772654017606 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// // #include #include #include #include #include #include #include "BinaryData.h" #include "BtcUtils.h" #include "BlockObj.h" #include "StoredBlockObj.h" #include "leveldb_wrapper.h" vector LevelDBWrapper::ifaceVect_(0); //////////////////////////////////////////////////////////////////////////////// LDBIter::LDBIter(leveldb::DB* dbptr, bool fill_cache) { db_ = dbptr; leveldb::ReadOptions readopts; readopts.fill_cache = fill_cache; iter_ = db_->NewIterator(readopts); isDirty_ = true; } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::isValid(DB_PREFIX dbpref) { if(!isValid() || iter_->key().size() == 0) return false; return iter_->key()[0] == (char)dbpref; } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::advance(void) { iter_->Next(); isDirty_ = true; return isValid(); } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::advance(DB_PREFIX prefix) { iter_->Next(); isDirty_ = true; return isValid(prefix); } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::readIterData(void) { if(!isValid()) { isDirty_ = true; return false; } currKey_.setNewData((uint8_t*)iter_->key().data(), iter_->key().size()); currValue_.setNewData((uint8_t*)iter_->value().data(), iter_->value().size()); isDirty_ = false; return true; } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::advanceAndRead(void) { if(!advance()) return false; return readIterData(); } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::advanceAndRead(DB_PREFIX prefix) { if(!advance(prefix)) return false; return readIterData(); } //////////////////////////////////////////////////////////////////////////////// BinaryData LDBIter::getKey(void) { if(isDirty_) { LOGERR << "Returning dirty key ref"; return BinaryData(0); } return currKey_.getRawRef().copy(); } //////////////////////////////////////////////////////////////////////////////// BinaryData LDBIter::getValue(void) { if(isDirty_) { LOGERR << "Returning dirty value ref"; return BinaryData(0); } return currValue_.getRawRef().copy(); } //////////////////////////////////////////////////////////////////////////////// BinaryDataRef LDBIter::getKeyRef(void) { if(isDirty_) { LOGERR << "Returning dirty key ref"; return BinaryDataRef(); } return currKey_.getRawRef(); } //////////////////////////////////////////////////////////////////////////////// BinaryDataRef LDBIter::getValueRef(void) { if(isDirty_) { LOGERR << "Returning dirty value ref"; return BinaryDataRef(); } return currValue_.getRawRef(); } //////////////////////////////////////////////////////////////////////////////// BinaryRefReader& LDBIter::getKeyReader(void) { if(isDirty_) LOGERR << "Returning dirty key reader"; return currKey_; } //////////////////////////////////////////////////////////////////////////////// BinaryRefReader& LDBIter::getValueReader(void) { if(isDirty_) LOGERR << "Returning dirty value reader"; return currValue_; } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::seekTo(BinaryDataRef key) { if(isNull()) return false; iter_->Seek(binaryDataRefToSlice(key)); return readIterData(); } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::seekTo(DB_PREFIX pref, BinaryDataRef key) { BinaryWriter bw(key.getSize() + 1); bw.put_uint8_t((uint8_t)pref); bw.put_BinaryData(key); bool didSucceed = seekTo(bw.getDataRef()); if(didSucceed) readIterData(); return didSucceed; } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::seekToExact(BinaryDataRef key) { if(!seekTo(key)) return false; return checkKeyExact(key); } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::seekToExact(DB_PREFIX pref, BinaryDataRef key) { if(!seekTo(pref, key)) return false; return checkKeyExact(pref, key); } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::seekToStartsWith(BinaryDataRef key) { if(!seekTo(key)) return false; return checkKeyStartsWith(key); } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::seekToStartsWith(DB_PREFIX prefix) { BinaryWriter bw(1); bw.put_uint8_t((uint8_t)prefix); if(!seekTo(bw.getDataRef())) return false; return checkKeyStartsWith(bw.getDataRef()); } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::seekToStartsWith(DB_PREFIX pref, BinaryDataRef key) { if(!seekTo(pref, key)) return false; return checkKeyStartsWith(pref, key); } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::seekToFirst(void) { if(isNull()) return false; iter_->SeekToFirst(); readIterData(); return true; } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::checkKeyExact(BinaryDataRef key) { if(isDirty_ && !readIterData()) return false; return (key==currKey_.getRawRef()); } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::checkKeyExact(DB_PREFIX prefix, BinaryDataRef key) { BinaryWriter bw(key.getSize() + 1); bw.put_uint8_t((uint8_t)prefix); bw.put_BinaryData(key); if(isDirty_ && !readIterData()) return false; return (bw.getDataRef()==currKey_.getRawRef()); } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::checkKeyStartsWith(BinaryDataRef key) { if(isDirty_ && !readIterData()) return false; return (currKey_.getRawRef().startsWith(key)); } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::verifyPrefix(DB_PREFIX prefix, bool advanceReader) { if(isDirty_ && !readIterData()) return false; if(currKey_.getSizeRemaining() < 1) return false; if(advanceReader) return (currKey_.get_uint8_t() == (uint8_t)prefix); else return (currKey_.getRawRef()[0] == (uint8_t)prefix); } //////////////////////////////////////////////////////////////////////////////// bool LDBIter::checkKeyStartsWith(DB_PREFIX prefix, BinaryDataRef key) { BinaryWriter bw(key.getSize() + 1); bw.put_uint8_t((uint8_t)prefix); bw.put_BinaryData(key); return checkKeyStartsWith(bw.getDataRef()); } //////////////////////////////////////////////////////////////////////////////// bool InterfaceToLDB::checkStatus(leveldb::Status stat, bool warn) { lastStatus_ = stat; if( lastStatus_.ok() ) return true; if(warn) LOGWARN << "***LevelDB Error: " << lastStatus_.ToString(); return false; } //////////////////////////////////////////////////////////////////////////////// BinaryData InterfaceToLDB::sliceToBinaryData(leveldb::Slice slice) { return BinaryData((uint8_t*)(slice.data()), slice.size()); } //////////////////////////////////////////////////////////////////////////////// void InterfaceToLDB::sliceToBinaryData(leveldb::Slice slice, BinaryData & bd) { bd.copyFrom((uint8_t*)(slice.data()), slice.size()); } //////////////////////////////////////////////////////////////////////////////// BinaryReader InterfaceToLDB::sliceToBinaryReader(leveldb::Slice slice) { return BinaryReader((uint8_t*)(slice.data()), slice.size()); } //////////////////////////////////////////////////////////////////////////////// void InterfaceToLDB::sliceToBinaryReader(leveldb::Slice slice, BinaryReader & br) { br.setNewData((uint8_t*)(slice.data()), slice.size()); } //////////////////////////////////////////////////////////////////////////////// BinaryDataRef InterfaceToLDB::sliceToBinaryDataRef(leveldb::Slice slice) { return BinaryDataRef( (uint8_t*)(slice.data()), slice.size()); } //////////////////////////////////////////////////////////////////////////////// BinaryRefReader InterfaceToLDB::sliceToBinaryRefReader(leveldb::Slice slice) { return BinaryRefReader( (uint8_t*)(slice.data()), slice.size()); } //////////////////////////////////////////////////////////////////////////////// void InterfaceToLDB::init() { SCOPED_TIMER("InterfaceToLDB::init"); dbIsOpen_ = false; for(uint8_t i=0; i 0) LOGERR << "Unwritten batch in progress during shutdown"; closeDatabases(); } ///////////////////////////////////////////////////////////////////////////// // The dbType and pruneType inputs are left blank if you are just going to // take whatever is the current state of database. You can choose to // manually specify them, if you want to throw an error if it's not what you // were expecting bool InterfaceToLDB::openDatabases(string basedir, BinaryData const & genesisBlkHash, BinaryData const & genesisTxHash, BinaryData const & magic, ARMORY_DB_TYPE dbtype, DB_PRUNE_TYPE pruneType) { SCOPED_TIMER("openDatabases"); LOGINFO << "Opening databases..."; baseDir_ = basedir; stringstream head; head << baseDir_ << "/" << "leveldb_headers"; dbPaths_[0] = head.str(); stringstream blk; blk << baseDir_ << "/" << "leveldb_blkdata"; dbPaths_[1] = blk.str(); magicBytes_ = magic; genesisTxHash_ = genesisTxHash; genesisBlkHash_ = genesisBlkHash; DBUtils.setArmoryDbType(dbtype); DBUtils.setDbPruneType(pruneType); if(genesisBlkHash_.getSize() == 0 || magicBytes_.getSize() == 0) { LOGERR << " must set magic bytes and genesis block"; LOGERR << " before opening databases."; return false; } // Just in case this isn't the first time we tried to open it. closeDatabases(); vector dbs[2]; for(uint32_t db=0; dbDelete(binaryDataRefToSlice(ldbIter.getKeyRef())); ldbIter.advanceAndRead(); } commitBatch(HEADERS); StoredDBInfo sdbi; sdbi.magic_ = magicBytes_; sdbi.topBlkHgt_ = 0; sdbi.topBlkHash_ = genesisBlkHash_; putStoredDBInfo(HEADERS, sdbi); validDupByHeight_.clear(); validDupByHeight_.resize(0); validDupByHeight_.reserve(300000); } ///////////////////////////////////////////////////////////////////////////// // DBs don't really need to be closed. Just delete them void InterfaceToLDB::closeDatabases(void) { SCOPED_TIMER("closeDatabases"); for(uint32_t db=0; dbWrite(leveldb::WriteOptions(), batches_[db]); else LOGWARN << "Attempted to commitBatch but dbs_ is NULL. Skipping"; // Even if the dbs_[db] is NULL, we still want to clear the batched data batches_[db]->Clear(); delete batches_[db]; batches_[db] = NULL; iterIsDirty_[db] = true; } } ///////////////////////////////////////////////////////////////////////////// // Get value using pre-created slice BinaryData InterfaceToLDB::getValue(DB_SELECT db, leveldb::Slice ldbKey) { leveldb::Status stat = dbs_[db]->Get(STD_READ_OPTS, ldbKey, &lastGetValue_); if(!checkStatus(stat, false)) return BinaryData(0); return BinaryData(lastGetValue_); } ///////////////////////////////////////////////////////////////////////////// // Get value using BinaryData object. If you have a string, you can use // BinaryData key(string(theStr)); BinaryData InterfaceToLDB::getValue(DB_SELECT db, BinaryDataRef key) { leveldb::Slice ldbKey((char*)key.getPtr(), key.getSize()); return getValue(db, ldbKey); } ///////////////////////////////////////////////////////////////////////////// // Get value using BinaryData object. If you have a string, you can use // BinaryData key(string(theStr)); BinaryData InterfaceToLDB::getValue(DB_SELECT db, DB_PREFIX prefix, BinaryDataRef key) { BinaryData keyFull(key.getSize()+1); keyFull[0] = (uint8_t)prefix; key.copyTo(keyFull.getPtr()+1, key.getSize()); leveldb::Slice ldbKey((char*)keyFull.getPtr(), keyFull.getSize()); return getValue(db, ldbKey); } ///////////////////////////////////////////////////////////////////////////// // Get value using BinaryDataRef object. The data from the get* call is // actually copied to a member variable, and thus the refs are valid only // until the next get* call. BinaryDataRef InterfaceToLDB::getValueRef(DB_SELECT db, BinaryDataRef key) { leveldb::Slice ldbKey = binaryDataRefToSlice(key); leveldb::Status stat = dbs_[db]->Get(STD_READ_OPTS, ldbKey, &lastGetValue_); if(!checkStatus(stat, false)) lastGetValue_ = string(""); return BinaryDataRef((uint8_t*)lastGetValue_.data(), lastGetValue_.size()); } ///////////////////////////////////////////////////////////////////////////// // Get value using BinaryDataRef object. The data from the get* call is // actually copied to a member variable, and thus the refs are valid only // until the next get* call. BinaryDataRef InterfaceToLDB::getValueRef(DB_SELECT db, DB_PREFIX prefix, BinaryDataRef key) { BinaryWriter bw(key.getSize() + 1); bw.put_uint8_t((uint8_t)prefix); bw.put_BinaryData(key); return getValueRef(db, bw.getDataRef()); } ///////////////////////////////////////////////////////////////////////////// // Same as the getValueRef, in that they are only valid until the next get* // call. These are convenience methods which basically just save us BinaryRefReader InterfaceToLDB::getValueReader( DB_SELECT db, BinaryDataRef keyWithPrefix) { return BinaryRefReader(getValueRef(db, keyWithPrefix)); } ///////////////////////////////////////////////////////////////////////////// // Same as the getValueRef, in that they are only valid until the next get* // call. These are convenience methods which basically just save us BinaryRefReader InterfaceToLDB::getValueReader( DB_SELECT db, DB_PREFIX prefix, BinaryDataRef key) { return BinaryRefReader(getValueRef(db, prefix, key)); } ///////////////////////////////////////////////////////////////////////////// // Header Key: returns header hash // Tx Key: returns tx hash // TxOut Key: returns serialized OutPoint BinaryData InterfaceToLDB::getHashForDBKey(BinaryData dbkey) { uint32_t hgt; uint8_t dup; uint16_t txi; uint16_t txo; uint32_t sz = dbkey.getSize(); if(sz < 4 || sz > 9) { LOGERR << "Invalid DBKey size: " << sz << ", " << dbkey.toHexStr(); return BinaryData(0); } BinaryRefReader brr(dbkey); if(dbkey.getSize() % 2 == 0) DBUtils.readBlkDataKeyNoPrefix(brr, hgt, dup, txi, txo); else DBUtils.readBlkDataKey(brr, hgt, dup, txi, txo); return getHashForDBKey(hgt, dup, txi, txo); } ///////////////////////////////////////////////////////////////////////////// // Header Key: returns header hash // Tx Key: returns tx hash // TxOut Key: returns serialized OutPoint BinaryData InterfaceToLDB::getHashForDBKey(uint32_t hgt, uint8_t dup, uint16_t txi, uint16_t txo) { if(txi==UINT16_MAX) { StoredHeader sbh; getBareHeader(sbh, hgt, dup); return sbh.thisHash_; } else if(txo==UINT16_MAX) { StoredTx stx; getStoredTx(stx, hgt, dup, txi, false); return stx.thisHash_; } else { StoredTx stx; getStoredTx(stx, hgt, dup, txi, false); OutPoint op(stx.thisHash_, txo); return op.serialize(); } } ///////////////////////////////////////////////////////////////////////////// // Put value based on BinaryData key. If batch writing, pass in the batch void InterfaceToLDB::putValue(DB_SELECT db, BinaryDataRef key, BinaryDataRef value) { leveldb::Slice ldbkey = binaryDataRefToSlice(key); leveldb::Slice ldbval = binaryDataRefToSlice(value); if(batches_[db]!=NULL) batches_[db]->Put(ldbkey, ldbval); else { leveldb::Status stat = dbs_[db]->Put(STD_WRITE_OPTS, ldbkey, ldbval); checkStatus(stat); iterIsDirty_[db] = true; } } ///////////////////////////////////////////////////////////////////////////// void InterfaceToLDB::putValue(DB_SELECT db, BinaryData const & key, BinaryData const & value) { putValue(db, key.getRef(), value.getRef()); } ///////////////////////////////////////////////////////////////////////////// // Put value based on BinaryData key. If batch writing, pass in the batch void InterfaceToLDB::putValue(DB_SELECT db, DB_PREFIX prefix, BinaryDataRef key, BinaryDataRef value) { BinaryWriter bw; bw.put_uint8_t((uint8_t)prefix); bw.put_BinaryData(key); putValue(db, bw.getDataRef(), value); } ///////////////////////////////////////////////////////////////////////////// // Delete value based on BinaryData key. If batch writing, pass in the batch void InterfaceToLDB::deleteValue(DB_SELECT db, BinaryDataRef key) { string value; leveldb::Slice ldbKey = binaryDataRefToSlice(key); if(batches_[db]!=NULL) batches_[db]->Delete(ldbKey); else { leveldb::Status stat = dbs_[db]->Delete(STD_WRITE_OPTS, ldbKey); checkStatus(stat); iterIsDirty_[db] = true; } } ///////////////////////////////////////////////////////////////////////////// // Delete Put value based on BinaryData key. If batch writing, pass in the batch void InterfaceToLDB::deleteValue(DB_SELECT db, DB_PREFIX prefix, BinaryDataRef key) { BinaryWriter bw; bw.put_uint8_t((uint8_t)prefix); bw.put_BinaryData(key); deleteValue(db, bw.getDataRef()); } ///////////////////////////////////////////////////////////////////////////// // Not sure why this is useful over getHeaderMap() ... this iterates over // the headers in hash-ID-order, instead of height-order //void InterfaceToLDB::startHeaderIteration() //{ //SCOPED_TIMER("startHeaderIteration"); //seekTo(HEADERS, DB_PREFIX_HEADHASH, BinaryData(0)); //} ///////////////////////////////////////////////////////////////////////////// bool InterfaceToLDB::startBlkDataIteration(LDBIter & ldbIter, DB_PREFIX prefix) { return ldbIter.seekToStartsWith(prefix); } ///////////////////////////////////////////////////////////////////////////// // "Skip" refers to the behavior that the previous operation may have left // the iterator already on the next desired block. So our "advance" op may // have finished before it started. Alternatively, we may be on this block // because we checked it and decide we don't care, so we want to skip it. bool InterfaceToLDB::advanceToNextBlock(LDBIter & ldbIter, bool skip) { char prefix = DB_PREFIX_TXDATA; BinaryData key; while(1) { if(skip) ldbIter.advanceAndRead(); //if( !it->Valid() || it->key()[0] != (char)DB_PREFIX_TXDATA) if(!ldbIter.isValid(DB_PREFIX_TXDATA)) return false; else if(ldbIter.getKeyRef().getSize() == 5) return true; if(!skip) ldbIter.advanceAndRead(); } LOGERR << "we should never get here..."; return false; } //////////////////////////////////////////////////////////////////////////////// // We frequently have a Tx hash and need to determine the Hgt/Dup/Index of it. // And frequently when we do, we plan to read the tx right afterwards, so we // should leave the itereator there. bool InterfaceToLDB::seekToTxByHash(LDBIter & ldbIter, BinaryDataRef txHash) { SCOPED_TIMER("seekToTxByHash"); StoredTxHints sths = getHintsForTxHash(txHash); for(uint32_t i=0; i::iterator iter; uint32_t numTxioRead = 0; do { uint32_t sz = ldbIter.getKeyRef().getSize(); BinaryDataRef keyNoPrefix= ldbIter.getKeyRef().getSliceRef(1,sz-1); if(!keyNoPrefix.startsWith(ssh.uniqueKey_)) break; pair keyValPair; keyValPair.first = keyNoPrefix.getSliceCopy(sz-5, 4); keyValPair.second.unserializeDBKey(ldbIter.getKeyRef()); keyValPair.second.unserializeDBValue(ldbIter.getValueReader()); iter = ssh.subHistMap_.insert(keyValPair).first; numTxioRead += iter->second.txioSet_.size(); } while( ldbIter.advanceAndRead(DB_PREFIX_SCRIPT) ); if(numTxioRead != ssh.totalTxioCount_) { LOGERR << "Number of TXIOs read does not match SSH entry value"; ssh.totalTxioCount_ = numTxioRead; } return true; } //////////////////////////////////////////////////////////////////////////////// void InterfaceToLDB::putStoredScriptHistory( StoredScriptHistory & ssh) { SCOPED_TIMER("putStoredScriptHistory"); if(!ssh.isInitialized()) { LOGERR << "Trying to put uninitialized SSH into DB"; return; } putValue(BLKDATA, ssh.getDBKey(), ssh.serializeDBValue()); if(!ssh.useMultipleEntries_) return; map::iterator iter; for(iter = ssh.subHistMap_.begin(); iter != ssh.subHistMap_.end(); iter++) { StoredSubHistory & subssh = iter->second; if(subssh.txioSet_.size() > 0) putValue(BLKDATA, subssh.getDBKey(), subssh.serializeDBValue()); } } //////////////////////////////////////////////////////////////////////////////// void InterfaceToLDB::getStoredScriptHistorySummary( StoredScriptHistory & ssh, BinaryDataRef scrAddrStr) { LDBIter ldbIter = getIterator(BLKDATA); bool seekTrue = ldbIter.seekTo(DB_PREFIX_SCRIPT, scrAddrStr); if(!ldbIter.seekToExact(DB_PREFIX_SCRIPT, scrAddrStr)) { ssh.uniqueKey_.resize(0); return; } ssh.unserializeDBKey(ldbIter.getKeyRef()); ssh.unserializeDBValue(ldbIter.getValueRef()); } //////////////////////////////////////////////////////////////////////////////// void InterfaceToLDB::getStoredScriptHistory( StoredScriptHistory & ssh, BinaryDataRef scrAddrStr) { SCOPED_TIMER("getStoredScriptHistory"); LDBIter ldbIter = getIterator(BLKDATA); if(!ldbIter.seekToExact(DB_PREFIX_SCRIPT, scrAddrStr)) { ssh.uniqueKey_.resize(0); return; } readStoredScriptHistoryAtIter(ldbIter, ssh); } //////////////////////////////////////////////////////////////////////////////// void InterfaceToLDB::getStoredScriptHistoryByRawScript( StoredScriptHistory & ssh, BinaryDataRef script) { BinaryData uniqueKey = BtcUtils::getTxOutScrAddr(script); getStoredScriptHistory(ssh, uniqueKey); } ///////////////////////////////////////////////////////////////////////////// // This doesn't actually return a SUBhistory, it grabs it and adds it to the // regular-SSH object. This does not affect balance or Txio count. It's // simply filling in data that the SSH may be expected to have. bool InterfaceToLDB::fetchStoredSubHistory( StoredScriptHistory & ssh, BinaryData hgtX, bool createIfDNE, bool forceReadDB) { if(!forceReadDB && KEY_IN_MAP(hgtX, ssh.subHistMap_)) return true; BinaryData key = ssh.uniqueKey_ + hgtX; BinaryRefReader brr = getValueReader(BLKDATA, DB_PREFIX_SCRIPT, key); StoredSubHistory subssh; subssh.uniqueKey_ = ssh.uniqueKey_; subssh.hgtX_ = hgtX; if(brr.getSize() > 0) subssh.unserializeDBValue(brr); else if(!createIfDNE) return false; return ssh.mergeSubHistory(subssh); } //////////////////////////////////////////////////////////////////////////////// uint64_t InterfaceToLDB::getBalanceForScrAddr(BinaryDataRef scrAddr, bool withMulti) { StoredScriptHistory ssh; if(!withMulti) { getStoredScriptHistorySummary(ssh, scrAddr); return ssh.totalUnspent_; } else { getStoredScriptHistory(ssh, scrAddr); uint64_t total = ssh.totalUnspent_; map utxoList; map::iterator iter; getFullUTXOMapForSSH(ssh, utxoList, true); for(iter = utxoList.begin(); iter != utxoList.end(); iter++) if(iter->second.isMultisigRef()) total += iter->second.getValue(); return total; } } //////////////////////////////////////////////////////////////////////////////// // We need the block hashes and scripts, which need to be retrieved from the // DB, which is why this method can't be part of StoredBlockObj.h/.cpp bool InterfaceToLDB::getFullUTXOMapForSSH( StoredScriptHistory & ssh, map & mapToFill, bool withMultisig) { if(!ssh.haveFullHistoryLoaded()) return false; map::iterator iterSubSSH; map::iterator iterTxio; for(iterSubSSH = ssh.subHistMap_.begin(); iterSubSSH != ssh.subHistMap_.end(); iterSubSSH++) { StoredSubHistory & subSSH = iterSubSSH->second; for(iterTxio = subSSH.txioSet_.begin(); iterTxio != subSSH.txioSet_.end(); iterTxio++) { TxIOPair & txio = iterTxio->second; StoredTx stx; BinaryData txoKey = txio.getDBKeyOfOutput(); BinaryData txKey = txio.getTxRefOfOutput().getDBKey(); uint16_t txoIdx = txio.getIndexOfOutput(); getStoredTx(stx, txKey); StoredTxOut & stxo = stx.stxoMap_[txoIdx]; if(stxo.isSpent()) continue; mapToFill[txoKey] = UnspentTxOut( stx.thisHash_, txoIdx, stx.blockHeight_, txio.getValue(), stx.stxoMap_[txoIdx].getScriptRef()); } } return true; } //////////////////////////////////////////////////////////////////////////////// // We must guarantee that we don't overwrite data if void InterfaceToLDB::addRegisteredScript(BinaryDataRef rawScript, uint32_t blockCreated) { BinaryData uniqKey = BtcUtils::getTxOutScrAddr(rawScript); bool isMulti = BtcUtils::isMultisigScript(rawScript); StoredScriptHistory ssh; getStoredScriptHistory(ssh, uniqKey); uint32_t scannedTo; if(!ssh.isInitialized()) { // Script is not registered in the DB yet ssh.uniqueKey_ = uniqKey; ssh.version_ = ARMORY_DB_VERSION; ssh.alreadyScannedUpToBlk_ = blockCreated; //ssh.multisigDBKeys_.resize(0); putStoredScriptHistory(ssh); } else { if(blockCreated!=UINT32_MAX) scannedTo = max(ssh.alreadyScannedUpToBlk_, blockCreated); // Only overwrite if the data in the DB is incorrect if(scannedTo != ssh.alreadyScannedUpToBlk_) { ssh.alreadyScannedUpToBlk_ = scannedTo; putStoredScriptHistory(ssh); } } registeredSSHs_[uniqKey] = ssh; } ///////////////////////////////////////////////////////////////////////////// // TODO: We should also read the HeaderHgtList entries to get the blockchain // sorting that is saved in the DB. But right now, I'm not sure what // that would get us since we are reading all the headers and doing // a fresh organize/sort anyway. void InterfaceToLDB::readAllHeaders(map & headerMap, map & storedMap) { LDBIter ldbIter = getIterator(HEADERS); if(!ldbIter.seekToStartsWith(DB_PREFIX_HEADHASH)) { LOGWARN << "No headers in DB yet!"; return; } StoredHeader sbh; BlockHeader regHead; do { ldbIter.resetReaders(); ldbIter.verifyPrefix(DB_PREFIX_HEADHASH); if(ldbIter.getKeyReader().getSizeRemaining() != 32) { LOGERR << "How did we get header hash not 32 bytes?"; continue; } ldbIter.getKeyReader().get_BinaryData(sbh.thisHash_, 32); sbh.unserializeDBValue(HEADERS, ldbIter.getValueRef()); regHead.unserialize(sbh.dataCopy_); headerMap[sbh.thisHash_] = regHead; storedMap[sbh.thisHash_] = sbh; } while(ldbIter.advanceAndRead(DB_PREFIX_HEADHASH)); } //////////////////////////////////////////////////////////////////////////////// uint8_t InterfaceToLDB::getValidDupIDForHeight(uint32_t blockHgt) { if(validDupByHeight_.size() < blockHgt+1) { LOGERR << "Block height exceeds DupID lookup table"; return UINT8_MAX; } return validDupByHeight_[blockHgt]; } //////////////////////////////////////////////////////////////////////////////// void InterfaceToLDB::setValidDupIDForHeight(uint32_t blockHgt, uint8_t dup) { while(validDupByHeight_.size() < blockHgt+1) validDupByHeight_.push_back(UINT8_MAX); validDupByHeight_[blockHgt] = dup; } //////////////////////////////////////////////////////////////////////////////// uint8_t InterfaceToLDB::getValidDupIDForHeight_fromDB(uint32_t blockHgt) { BinaryData hgt4((uint8_t*)&blockHgt, 4); BinaryRefReader brrHgts = getValueReader(HEADERS, DB_PREFIX_HEADHGT, hgt4); if(brrHgts.getSize() == 0) { LOGERR << "Requested header does not exist in DB"; return false; } uint8_t lenEntry = 33; uint8_t numDup = brrHgts.getSize() / lenEntry; for(uint8_t i=0; i 0) return (dup8 & 0x7f); } LOGERR << "Requested a header-by-height but none were marked as main"; return UINT8_MAX; } //////////////////////////////////////////////////////////////////////////////// void InterfaceToLDB::putStoredDBInfo(DB_SELECT db, StoredDBInfo const & sdbi) { SCOPED_TIMER("putStoredDBInfo"); if(!sdbi.isInitialized()) { LOGERR << "Tried to put DB info into DB but it's not initialized"; return; } putValue(db, sdbi.getDBKey(), sdbi.serializeDBValue()); } //////////////////////////////////////////////////////////////////////////////// bool InterfaceToLDB::getStoredDBInfo(DB_SELECT db, StoredDBInfo & sdbi, bool warn) { SCOPED_TIMER("getStoredDBInfo"); BinaryRefReader brr = getValueRef(db, StoredDBInfo::getDBKey()); if(brr.getSize() == 0 && warn) { LOGERR << "No DB info key in database to get"; return false; } sdbi.unserializeDBValue(brr); return true; } //////////////////////////////////////////////////////////////////////////////// // We assume that the SBH has the correct blockheight already included. Will // adjust the dupID value in the SBH after we determine it. // Will overwrite existing data, for simplicity, and so that this method allows // us to easily replace/update data, even if overwriting isn't always necessary // // NOTE: If you want this header to be marked valid/invalid, make sure the // isMainBranch_ property of the SBH is set appropriate before calling. uint8_t InterfaceToLDB::putStoredHeader( StoredHeader & sbh, bool withBlkData) { SCOPED_TIMER("putStoredHeader"); // Put header into HEADERS DB uint8_t newDup = putBareHeader(sbh); /////// // If we only wanted to update the headers DB, we're done. if(!withBlkData) return newDup; startBatch(BLKDATA); BinaryData key = DBUtils.getBlkDataKey(sbh.blockHeight_, sbh.duplicateID_); BinaryWriter bwBlkData; sbh.serializeDBValue(BLKDATA, bwBlkData); putValue(BLKDATA, key.getRef(), bwBlkData.getDataRef()); for(uint32_t i=0; i::iterator txIter = sbh.stxMap_.find(i); //if(txIter != sbh.stxMap_.end()) if(ITER_IN_MAP(txIter, sbh.stxMap_)) { // Make sure the txIndex value is correct, then dump it to DB. txIter->second.txIndex_ = i; // When writing out the tx, we always write out the TxOuts. // (that's what the second "true" argument is specifying) // There's no situation where we indicate *at the block-header // level*, that we want to put the Txs but not the TxOuts. // In other contexts, it may be desired to put/update a Tx // without updating the TxOuts. putStoredTx(txIter->second, true); } } // If this is a valid block being put in BLKDATA DB, update DBInfo if(sbh.isMainBranch_ && withBlkData) { StoredDBInfo sdbiB; getStoredDBInfo(BLKDATA, sdbiB); if(sbh.blockHeight_ > sdbiB.topBlkHgt_) { sdbiB.topBlkHgt_ = sbh.blockHeight_; sdbiB.topBlkHash_ = sbh.thisHash_; putStoredDBInfo(BLKDATA, sdbiB); } } commitBatch(BLKDATA); return newDup; } //////////////////////////////////////////////////////////////////////////////// // Puts bare header into HEADERS DB. Use "putStoredHeader" to add to both // (which actually calls this method as the first step) // // Returns the duplicateID of the header just inserted uint8_t InterfaceToLDB::putBareHeader(StoredHeader & sbh) { SCOPED_TIMER("putBareHeader"); if(!sbh.isInitialized()) { LOGERR << "Attempting to put uninitialized bare header into DB"; return UINT8_MAX; } StoredDBInfo sdbiH; getStoredDBInfo(HEADERS, sdbiH); uint32_t height = sbh.blockHeight_; uint8_t sbhDupID = UINT8_MAX; // Check if it's already in the height-indexed DB - determine dupID if not StoredHeadHgtList hhl; getStoredHeadHgtList(hhl, height); bool alreadyInHgtDB = false; bool needToWriteHHL = false; if(hhl.dupAndHashList_.size() == 0) { sbhDupID = 0; hhl.addDupAndHash(0, sbh.thisHash_); if(sbh.isMainBranch_) hhl.preferredDup_ = 0; needToWriteHHL = true; } else { int8_t maxDup = -1; for(uint8_t i=0; i= sdbiH.topBlkHgt_) { sdbiH.topBlkHgt_ = sbh.blockHeight_; sdbiH.topBlkHash_ = sbh.thisHash_; putStoredDBInfo(HEADERS, sdbiH); } } commitBatch(HEADERS); return sbhDupID; } //////////////////////////////////////////////////////////////////////////////// // "BareHeader" refers to bool InterfaceToLDB::getBareHeader(StoredHeader & sbh, uint32_t blockHgt, uint8_t dup) { SCOPED_TIMER("getBareHeader"); // Get the hash from the head-hgt list StoredHeadHgtList hhl; if(!getStoredHeadHgtList(hhl, blockHgt)) { LOGERR << "No headers at height " << blockHgt; return false; } for(uint32_t i=0; i::iterator iter; for(iter = stx.stxoMap_.begin(); iter != stx.stxoMap_.end(); iter++) { // Make sure all the parameters of the TxOut are set right iter->second.txVersion_ = READ_UINT32_LE(stx.dataCopy_.getPtr()); iter->second.blockHeight_ = stx.blockHeight_; iter->second.duplicateID_ = stx.duplicateID_; iter->second.txIndex_ = stx.txIndex_; iter->second.txOutIndex_ = iter->first; putStoredTxOut(iter->second); } } commitBatch(BLKDATA); } //////////////////////////////////////////////////////////////////////////////// void InterfaceToLDB::updatePreferredTxHint( BinaryDataRef hashOrPrefix, BinaryData preferDBKey) { SCOPED_TIMER("updatePreferredTxHint"); StoredTxHints sths; getStoredTxHints(sths, hashOrPrefix); if(sths.preferredDBKey_ == preferDBKey) return; // Check whether the hint already exists in the DB bool exists = false; for(uint32_t i=0; i= sbh.numTx_) { LOGERR << "Invalid txIndex at height " << (sbh.blockHeight_) << " index " << currIdx; return false; } //if(sbh.stxMap_.find(currIdx) == sbh.stxMap_.end()) if(KEY_NOT_IN_MAP(currIdx, sbh.stxMap_)) sbh.stxMap_[currIdx] = StoredTx(); readStoredTxAtIter(ldbIter, sbh.blockHeight_, sbh.duplicateID_, sbh.stxMap_[currIdx]); } return true; } //////////////////////////////////////////////////////////////////////////////// // We assume we have a valid iterator left at the beginning of (potentially) a // transaction in this block. It's okay if it starts at at TxOut entry (in // some instances we may not have a Tx entry, but only the TxOuts). bool InterfaceToLDB::readStoredTxAtIter( LDBIter & ldbIter, uint32_t height, uint8_t dupID, StoredTx & stx) { SCOPED_TIMER("readStoredTxAtIter"); BinaryData blkPrefix = DBUtils.getBlkDataKey(height, dupID); // Make sure that we are still within the desired block (but beyond header) ldbIter.resetReaders(); BinaryDataRef key = ldbIter.getKeyRef(); if(!key.startsWith(blkPrefix) || key.getSize() < 7) return false; // Check that we are at a tx with the correct height & dup uint32_t storedHgt; uint8_t storedDup; uint16_t storedIdx; DBUtils.readBlkDataKey(ldbIter.getKeyReader(), storedHgt, storedDup, storedIdx); if(storedHgt != height || storedDup != dupID) return false; // Make sure the stx has correct height/dup/idx stx.blockHeight_ = storedHgt; stx.duplicateID_ = storedDup; stx.txIndex_ = storedIdx; // Use a temp variable instead of stx.numBytes_ directly, because the // stx.unserializeDBValue() call will reset numBytes to UINT32_MAX. // Assign it at the end, if we're confident we have the correct value. uint32_t nbytes = 0; BinaryData txPrefix = DBUtils.getBlkDataKey(height, dupID, stx.txIndex_); // Reset the key again, and then cycle through entries until no longer // on an entry with the correct prefix. Use do-while because we've // already verified the iterator is at a valid tx entry ldbIter.resetReaders(); do { // Stop if key doesn't start with [PREFIX | HGT | DUP | TXIDX] if(!ldbIter.checkKeyStartsWith(txPrefix)) break; // Read the prefix, height and dup uint16_t txOutIdx; BLKDATA_TYPE bdtype = DBUtils.readBlkDataKey(ldbIter.getKeyReader(), stx.blockHeight_, stx.duplicateID_, stx.txIndex_, txOutIdx); // Now actually process the iter value if(bdtype == BLKDATA_TX) { // Get everything else from the iter value stx.unserializeDBValue(ldbIter.getValueRef()); nbytes += stx.dataCopy_.getSize(); } else if(bdtype == BLKDATA_TXOUT) { stx.stxoMap_[txOutIdx] = StoredTxOut(); StoredTxOut & stxo = stx.stxoMap_[txOutIdx]; readStoredTxOutAtIter(ldbIter, height, dupID, stx.txIndex_, stxo); stxo.parentHash_ = stx.thisHash_; stxo.txVersion_ = stx.version_; nbytes += stxo.dataCopy_.getSize(); } else { LOGERR << "Unexpected BLKDATA entry while iterating"; return false; } } while(ldbIter.advanceAndRead(DB_PREFIX_TXDATA)); // If have the correct size, save it, otherwise ignore the computation stx.numBytes_ = stx.haveAllTxOut() ? nbytes : UINT32_MAX; return true; } //////////////////////////////////////////////////////////////////////////////// bool InterfaceToLDB::readStoredTxOutAtIter( LDBIter & ldbIter, uint32_t height, uint8_t dupID, uint16_t txIndex, StoredTxOut & stxo) { if(ldbIter.getKeyRef().getSize() < 9) return false; ldbIter.resetReaders(); // Check that we are at a tx with the correct height & dup & txIndex uint32_t keyHgt; uint8_t keyDup; uint16_t keyTxIdx; uint16_t keyTxOutIdx; DBUtils.readBlkDataKey(ldbIter.getKeyReader(), keyHgt, keyDup, keyTxIdx, keyTxOutIdx); if(keyHgt != height || keyDup != dupID || keyTxIdx != txIndex) return false; stxo.blockHeight_ = height; stxo.duplicateID_ = dupID; stxo.txIndex_ = txIndex; stxo.txOutIndex_ = keyTxOutIdx; stxo.unserializeDBValue(ldbIter.getValueRef()); return true; } //////////////////////////////////////////////////////////////////////////////// Tx InterfaceToLDB::getFullTxCopy( BinaryData ldbKey6B ) { SCOPED_TIMER("getFullTxCopy"); if(ldbKey6B.getSize() != 6) { LOGERR << "Provided zero-length ldbKey6B"; return Tx(); } LDBIter ldbIter = getIterator(BLKDATA); if(!ldbIter.seekToStartsWith(DB_PREFIX_TXDATA, ldbKey6B)) { LOGERR << "TxRef key does not exist in BLKDATA DB"; return Tx(); } BinaryData hgtx = ldbKey6B.getSliceCopy(0,4); StoredTx stx; readStoredTxAtIter( ldbIter, DBUtils.hgtxToHeight(hgtx), DBUtils.hgtxToDupID(hgtx), stx); if(!stx.haveAllTxOut()) { LOGERR << "Requested full Tx but not all TxOut available"; return Tx(); } return stx.getTxCopy(); } //////////////////////////////////////////////////////////////////////////////// Tx InterfaceToLDB::getFullTxCopy( uint32_t hgt, uint16_t txIndex) { SCOPED_TIMER("getFullTxCopy"); uint8_t dup = getValidDupIDForHeight(hgt); if(dup == UINT8_MAX) LOGERR << "Headers DB has no block at height: " << hgt; BinaryData ldbKey = DBUtils.getBlkDataKey(hgt, dup, txIndex); return getFullTxCopy(ldbKey); } //////////////////////////////////////////////////////////////////////////////// Tx InterfaceToLDB::getFullTxCopy( uint32_t hgt, uint8_t dup, uint16_t txIndex) { SCOPED_TIMER("getFullTxCopy"); BinaryData ldbKey = DBUtils.getBlkDataKey(hgt, dup, txIndex); return getFullTxCopy(ldbKey); } //////////////////////////////////////////////////////////////////////////////// TxOut InterfaceToLDB::getTxOutCopy( BinaryData ldbKey6B, uint16_t txOutIdx) { SCOPED_TIMER("getTxOutCopy"); BinaryWriter bw(8); bw.put_BinaryData(ldbKey6B); bw.put_uint16_t(txOutIdx, BIGENDIAN); BinaryDataRef ldbKey8 = bw.getDataRef(); TxOut txoOut; BinaryRefReader brr = getValueReader(BLKDATA, DB_PREFIX_TXDATA, ldbKey8); if(brr.getSize()==0) { LOGERR << "TxOut key does not exist in BLKDATA DB"; return TxOut(); } TxRef parent(ldbKey6B, this); brr.advance(2); txoOut.unserialize_checked(brr.getCurrPtr(), brr.getSizeRemaining(), 0, parent, (uint32_t)txOutIdx); return txoOut; } //////////////////////////////////////////////////////////////////////////////// TxIn InterfaceToLDB::getTxInCopy( BinaryData ldbKey6B, uint16_t txInIdx) { SCOPED_TIMER("getTxInCopy"); TxIn txiOut; BinaryRefReader brr = getValueReader(BLKDATA, DB_PREFIX_TXDATA, ldbKey6B); if(brr.getSize()==0) { LOGERR << "TxOut key does not exist in BLKDATA DB"; return TxIn(); } BitUnpacker bitunpack(brr); // flags uint16_t dbVer = bitunpack.getBits(4); uint16_t txVer = bitunpack.getBits(2); uint16_t txSer = bitunpack.getBits(4); brr.advance(32); if(txSer != TX_SER_FULL && txSer != TX_SER_FRAGGED) { LOGERR << "Tx not available to retrieve TxIn"; return TxIn(); } else { bool isFragged = txSer==TX_SER_FRAGGED; vector offsetsIn; BtcUtils::StoredTxCalcLength(brr.getCurrPtr(), isFragged, &offsetsIn); if((uint32_t)(offsetsIn.size()-1) < (uint32_t)(txInIdx+1)) { LOGERR << "Requested TxIn with index greater than numTxIn"; return TxIn(); } TxRef parent(ldbKey6B, this); uint8_t const * txInStart = brr.exposeDataPtr() + 34 + offsetsIn[txInIdx]; uint32_t txInLength = offsetsIn[txInIdx+1] - offsetsIn[txInIdx]; TxIn txin; txin.unserialize_checked(txInStart, brr.getSize() - 34 - offsetsIn[txInIdx], txInLength, parent, txInIdx); return txin; } } //////////////////////////////////////////////////////////////////////////////// BinaryData InterfaceToLDB::getTxHashForLdbKey( BinaryDataRef ldbKey6B ) { SCOPED_TIMER("getTxHashForLdbKey"); BinaryRefReader stxVal = getValueReader(BLKDATA, DB_PREFIX_TXDATA, ldbKey6B); if(stxVal.getSize()==0) { LOGERR << "TxRef key does not exist in BLKDATA DB"; return BinaryData(0); } // We can't get here unless we found the precise Tx entry we were looking for stxVal.advance(2); return stxVal.get_BinaryData(32); } //////////////////////////////////////////////////////////////////////////////// BinaryData InterfaceToLDB::getTxHashForHeightAndIndex( uint32_t height, uint16_t txIndex) { SCOPED_TIMER("getTxHashForHeightAndIndex"); uint8_t dup = getValidDupIDForHeight(height); if(dup == UINT8_MAX) LOGERR << "Headers DB has no block at height: " << height; return getTxHashForLdbKey(DBUtils.getBlkDataKey(height, dup, txIndex)); } //////////////////////////////////////////////////////////////////////////////// BinaryData InterfaceToLDB::getTxHashForHeightAndIndex( uint32_t height, uint8_t dupID, uint16_t txIndex) { SCOPED_TIMER("getTxHashForHeightAndIndex"); return getTxHashForLdbKey(DBUtils.getBlkDataKey(height, dupID, txIndex)); } //////////////////////////////////////////////////////////////////////////////// StoredTxHints InterfaceToLDB::getHintsForTxHash(BinaryDataRef txHash) { SCOPED_TIMER("getAllHintsForTxHash"); StoredTxHints sths; sths.txHashPrefix_ = txHash.getSliceRef(0,4); BinaryRefReader brr = getValueReader(BLKDATA, DB_PREFIX_TXHINTS, sths.txHashPrefix_); if(brr.getSize() == 0) { // Don't need to throw any errors, we frequently ask for tx that DNE //LOGERR << "No hints for prefix: " << sths.txHashPrefix_.toHexStr(); } else sths.unserializeDBValue(brr); return sths; } //////////////////////////////////////////////////////////////////////////////// bool InterfaceToLDB::getStoredTx( StoredTx & stx, BinaryDataRef txHashOrDBKey) { uint32_t sz = txHashOrDBKey.getSize(); if(sz == 32) return getStoredTx_byHash(stx, txHashOrDBKey); else if(sz == 6 || sz == 7) return getStoredTx_byDBKey(stx, txHashOrDBKey); else { LOGERR << "Unrecognized input string: " << txHashOrDBKey.toHexStr(); return false; } } //////////////////////////////////////////////////////////////////////////////// bool InterfaceToLDB::getStoredTx_byDBKey( StoredTx & stx, BinaryDataRef dbKey) { uint32_t hgt; uint8_t dup; uint16_t txi; BinaryRefReader brrKey(dbKey); if(dbKey.getSize() == 6) DBUtils.readBlkDataKeyNoPrefix(brrKey, hgt, dup, txi); else if(dbKey.getSize() == 7) DBUtils.readBlkDataKey(brrKey, hgt, dup, txi); else { LOGERR << "Unrecognized input string: " << dbKey.toHexStr(); return false; } return getStoredTx(stx, hgt, dup, txi, true); } //////////////////////////////////////////////////////////////////////////////// // We assume that the first TxHint that matches is correct. This means that // when we mark a transaction/block valid, we need to make sure all the hints // lists have the correct one in front. Luckily, the TXHINTS entries are tiny // and the number of modifications to make for each reorg is small. bool InterfaceToLDB::getStoredTx_byHash( StoredTx & stx, BinaryDataRef txHash) { SCOPED_TIMER("getStoredTx"); BinaryData hash4(txHash.getSliceRef(0,4)); BinaryData hintsDBVal = getValue(BLKDATA, DB_PREFIX_TXHINTS, hash4); uint32_t valSize = hintsDBVal.getSize(); if(valSize < 2) { LOGERR << "No tx in DB with hash: " << txHash.toHexStr(); return false; } LDBIter ldbIter = getIterator(BLKDATA); BinaryRefReader brrHints(hintsDBVal); uint32_t numHints = (uint32_t)brrHints.get_var_int(); uint32_t height; uint8_t dup; uint16_t txIdx; for(uint32_t i=0; i 0) { sths.unserializeDBValue(bdr); return true; } else { sths.dbKeyList_.resize(0); sths.preferredDBKey_.resize(0); return false; } } //////////////////////////////////////////////////////////////////////////////// bool InterfaceToLDB::putStoredHeadHgtList(StoredHeadHgtList const & hhl) { SCOPED_TIMER("putStoredHeadHgtList"); if(hhl.height_ == UINT32_MAX) { LOGERR << "HHL does not have a valid height to be put into DB"; return false; } putValue(HEADERS, hhl.getDBKey(), hhl.serializeDBValue()); return true; } //////////////////////////////////////////////////////////////////////////////// bool InterfaceToLDB::getStoredHeadHgtList(StoredHeadHgtList & hhl, uint32_t height) { BinaryData ldbKey = WRITE_UINT32_BE(height); BinaryDataRef bdr = getValueRef(HEADERS, DB_PREFIX_HEADHGT, ldbKey); hhl.height_ = height; if(bdr.getSize() > 0) { hhl.unserializeDBValue(bdr); return true; } else { hhl.preferredDup_ = UINT8_MAX; hhl.dupAndHashList_.resize(0); return false; } } //////////////////////////////////////////////////////////////////////////////// TxRef InterfaceToLDB::getTxRef( BinaryDataRef txHash ) { LDBIter ldbIter = getIterator(BLKDATA); if(seekToTxByHash(ldbIter, txHash)) { ldbIter.getKeyReader().advance(1); return TxRef(ldbIter.getKeyReader().get_BinaryDataRef(6), this); } return TxRef(); } //////////////////////////////////////////////////////////////////////////////// TxRef InterfaceToLDB::getTxRef(BinaryData hgtx, uint16_t txIndex) { BinaryWriter bw; bw.put_BinaryData(hgtx); bw.put_uint16_t(txIndex, BIGENDIAN); return TxRef(bw.getDataRef(), this); } //////////////////////////////////////////////////////////////////////////////// TxRef InterfaceToLDB::getTxRef( uint32_t hgt, uint8_t dup, uint16_t txIndex) { BinaryWriter bw; bw.put_BinaryData(DBUtils.heightAndDupToHgtx(hgt,dup)); bw.put_uint16_t(txIndex, BIGENDIAN); return TxRef(bw.getDataRef(), this); } //////////////////////////////////////////////////////////////////////////////// bool InterfaceToLDB::markBlockHeaderValid(BinaryDataRef headHash) { SCOPED_TIMER("markBlockHeaderValid"); BinaryRefReader brr = getValueReader(HEADERS, DB_PREFIX_HEADHASH, headHash); if(brr.getSize()==0) { LOGERR << "Invalid header hash: " << headHash.toHexStr(); return false; } brr.advance(HEADER_SIZE); BinaryData hgtx = brr.get_BinaryData(4); uint32_t height = DBUtils.hgtxToHeight(hgtx); uint8_t dup = DBUtils.hgtxToDupID(hgtx); return markBlockHeaderValid(height, dup); } //////////////////////////////////////////////////////////////////////////////// bool InterfaceToLDB::markBlockHeaderValid(uint32_t height, uint8_t dup) { SCOPED_TIMER("markBlockHeaderValid"); StoredHeadHgtList hhl; getStoredHeadHgtList(hhl, height); if(hhl.preferredDup_ == dup) return true; bool hasEntry = false; for(uint32_t i=0; i collectList; bool hasEntry = false; for(uint8_t i=0; i::iterator iter; for(iter = collectList.begin(); iter != collectList.end(); iter++) bwOut.put_BinaryData(*iter); putValue(HEADERS, DB_PREFIX_HEADHGT, key4, bwOut.getDataRef()); return true; } //////////////////////////////////////////////////////////////////////////////// // This is used only for debugging and testing with small database sizes. // For intance, the reorg unit test only has a couple blocks, a couple // addresses and a dozen transactions. We can easily predict and construct // the output of this function or analyze the output by eye. KVLIST InterfaceToLDB::getAllDatabaseEntries(DB_SELECT db) { SCOPED_TIMER("getAllDatabaseEntries"); if(!databasesAreOpen()) return KVLIST(); KVLIST outList; outList.reserve(100); LDBIter ldbIter = getIterator(db); ldbIter.seekToFirst(); for(ldbIter.seekToFirst(); ldbIter.isValid(); ldbIter.advanceAndRead()) { size_t last = outList.size(); outList.push_back( pair() ); outList[last].first = ldbIter.getKey(); outList[last].second = ldbIter.getValue(); } return outList; } //////////////////////////////////////////////////////////////////////////////// void InterfaceToLDB::printAllDatabaseEntries(DB_SELECT db) { SCOPED_TIMER("printAllDatabaseEntries"); cout << "Printing DB entries... (DB=" << db << ")" << endl; KVLIST dbList = getAllDatabaseEntries(db); if(dbList.size() == 0) { cout << " " << endl; return; } for(uint32_t i=0; i" << endl; return; } BinaryData lastSSH = READHEX("00"); for(uint32_t i=0; i & txOutsRemoved, list & outpointsAdded) { // For ARMORY_DB_FULL we don't need undo data yet. } //////////////////////////////////////////////////////////////////////////////// BinaryData InterfaceToLDB::getUndoDataForBlock( list & txOutsRemoved, list & outpointsAdded) { // Maybe don't clear them, so that we can accumulate multi-block data, if // we have some reason to do that. Let the caller clear the lists //txOutsRemoved.clear(); //outpointsAdded.clear(); // For ARMORY_DB_FULL we don't need undo data yet. for(uint32_t i=0; i #include #include #include #include #include "BinaryData.h" #include "BtcUtils.h" //////////////////////////////////////////////////////////////////////////////// class InterfaceToLDB; class GlobalDBUtilities; class TxRef; class Tx; class TxIn; class TxOut; class BlockHeader { friend class BlockDataManager_LevelDB; friend class InterfaceToLDB; public: ///////////////////////////////////////////////////////////////////////////// BlockHeader(void) : isInitialized_(false), numTx_(UINT32_MAX), numBlockBytes_(UINT32_MAX), duplicateID_(UINT8_MAX) {} explicit BlockHeader(uint8_t const * ptr, uint32_t size) { unserialize(ptr, size); } explicit BlockHeader(BinaryRefReader & brr) { unserialize(brr); } explicit BlockHeader(BinaryDataRef str) { unserialize(str); } explicit BlockHeader(BinaryData const & str) { unserialize(str); } // SWIG needs a non-overloaded method BlockHeader & unserialize_1_(BinaryData const & str) { unserialize(str); return *this; } uint32_t getVersion(void) const { return READ_UINT32_LE(getPtr() ); } BinaryData const & getThisHash(void) const { return thisHash_; } BinaryData getPrevHash(void) const { return BinaryData(getPtr()+4 ,32); } BinaryData const & getNextHash(void) const { return nextHash_; } BinaryData getMerkleRoot(void) const { return BinaryData(getPtr()+36,32); } BinaryData getDiffBits(void) const { return BinaryData(getPtr()+72,4 ); } uint32_t getTimestamp(void) const { return READ_UINT32_LE(getPtr()+68); } uint32_t getNonce(void) const { return READ_UINT32_LE(getPtr()+76); } uint32_t getBlockHeight(void) const { return blockHeight_; } bool isMainBranch(void) const { return isMainBranch_; } bool isOrphan(void) const { return isOrphan_; } double getDifficulty(void) const { return difficultyDbl_; } double getDifficultySum(void) const{ return difficultySum_; } ///////////////////////////////////////////////////////////////////////////// BinaryDataRef getThisHashRef(void) const { return thisHash_.getRef(); } BinaryDataRef getPrevHashRef(void) const { return BinaryDataRef(getPtr()+4, 32); } BinaryDataRef getNextHashRef(void) const { return nextHash_.getRef(); } BinaryDataRef getMerkleRootRef(void) const { return BinaryDataRef(getPtr()+36,32); } BinaryDataRef getDiffBitsRef(void) const { return BinaryDataRef(getPtr()+72,4 ); } uint32_t getNumTx(void) const { return numTx_; } ///////////////////////////////////////////////////////////////////////////// uint8_t const * getPtr(void) const { assert(isInitialized_); return dataCopy_.getPtr(); } uint32_t getSize(void) const { assert(isInitialized_); return dataCopy_.getSize(); } uint32_t isInitialized(void) const { return isInitialized_; } uint32_t getBlockSize(void) const { return numBlockBytes_; } void setBlockSize(uint32_t sz) { numBlockBytes_ = sz; } void setNumTx(uint32_t ntx) { numTx_ = ntx; } ///////////////////////////////////////////////////////////////////////////// void setBlockFile(string filename) {blkFile_ = filename;} void setBlockFileNum(uint32_t fnum) {blkFileNum_ = fnum;} void setBlockFileOffset(uint64_t offs) {blkFileOffset_ = offs;} ///////////////////////////////////////////////////////////////////////////// void pprint(ostream & os=cout, int nIndent=0, bool pBigendian=true) const; void pprintAlot(ostream & os=cout); ///////////////////////////////////////////////////////////////////////////// BinaryData serialize(void) { return dataCopy_; } ///////////////////////////////////////////////////////////////////////////// // Just in case we ever want to calculate a difficulty-1 header via CPU... uint32_t findNonce(void); ///////////////////////////////////////////////////////////////////////////// void unserialize(uint8_t const * ptr, uint32_t size); void unserialize(BinaryData const & str) { unserialize(str.getRef()); } void unserialize(BinaryDataRef const & str); void unserialize(BinaryRefReader & brr); void unserialize_swigsafe_(BinaryData const & rawHead) { unserialize(rawHead); } uint8_t getDuplicateID(void) const { return duplicateID_; } void setDuplicateID(uint8_t d) { duplicateID_ = d; } void clearDataCopy() {dataCopy_.resize(0);} private: BinaryData dataCopy_; bool isInitialized_; // Derived properties - we expect these to be set after construct/copy BinaryData thisHash_; double difficultyDbl_; // Need to compute these later BinaryData nextHash_; uint32_t blockHeight_; double difficultySum_; bool isMainBranch_; bool isOrphan_; bool isFinishedCalc_; uint32_t numTx_; uint32_t numBlockBytes_; // includes header + nTx + sum(Tx) string blkFile_; uint32_t blkFileNum_; uint64_t blkFileOffset_; // Specific to the DB storage uint8_t duplicateID_; // ID of this blk rel to others at same height }; //////////////////////////////////////////////////////////////////////////////// class TxRef { friend class BlockDataManager_LevelDB; friend class Tx; public: ///////////////////////////////////////////////////////////////////////////// TxRef(void) { setRef(); } TxRef(BinaryDataRef bdr) { setRef(bdr); } TxRef(BinaryDataRef bdr, InterfaceToLDB* ifc) { setRef(bdr, ifc); } ///////////////////////////////////////////////////////////////////////////// void setRef(BinaryDataRef bdr=BinaryDataRef(), InterfaceToLDB* iface=NULL); ///////////////////////////////////////////////////////////////////////////// BinaryData getThisHash(void) const; Tx getTxCopy(void) const; bool isMainBranch(void) const; bool isInitialized(void) const {return dbKey6B_.getSize()>0;} bool isBound(void) const {return dbIface_!=NULL;} ///////////////////////////////////////////////////////////////////////////// BinaryData getDBKey(void) const { return dbKey6B_;} BinaryDataRef getDBKeyRef(void) { return dbKey6B_.getRef();} void setDBKey(BinaryData const & bd) {dbKey6B_.copyFrom(bd);} void setDBKey(BinaryDataRef const & bd) {dbKey6B_.copyFrom(bd);} bool isNull(void) const { return !isInitialized();} ///////////////////////////////////////////////////////////////////////////// BinaryData getDBKeyOfChild(uint16_t i) const {return dbKey6B_+WRITE_UINT16_BE(i);} ///////////////////////////////////////////////////////////////////////////// // This as fast as you can get a single TxIn or TxOut from the DB. But if // need multiple of them from the same Tx, you should getTxCopy() and then // iterate over them in the Tx object TxIn getTxInCopy(uint32_t i); TxOut getTxOutCopy(uint32_t i); ///////////////////////////////////////////////////////////////////////////// BinaryData serialize(void) const; ///////////////////////////////////////////////////////////////////////////// BinaryData getBlockHash(void) const; uint32_t getBlockTimestamp(void); uint32_t getBlockHeight(void) const; uint8_t getDuplicateID(void) const; uint16_t getBlockTxIndex(void) const; ///////////////////////////////////////////////////////////////////////////// void pprint(ostream & os=cout, int nIndent=0) const; ///////////////////////////////////////////////////////////////////////////// bool operator==(BinaryData const & dbkey) const { return dbKey6B_ == dbkey; } bool operator==(TxRef const & txr) const { return dbKey6B_ == txr.dbKey6B_;} private: //FileDataPtr blkFilePtr_; //BlockHeader* headerPtr_; // Both filePtr and headerPtr can be replaced by a single dbKey // It is 6 bytes: [ HeaderHgt(3) || DupID(1) || TxIndex(2) ] // It tells us exactly how to get this Tx from DB, and by the way // the DB is structured, the first four bytes also tells us how // to get the associated header. BinaryData dbKey6B_; // TxRefs are associated with a particular interface (at this time, there // will only be one interface). InterfaceToLDB* dbIface_; }; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // OutPoint is just a reference to a TxOut class OutPoint { friend class BlockDataManager_LevelDB; friend class OutPointRef; public: OutPoint(void) : txHash_(32), txOutIndex_(UINT32_MAX) { } explicit OutPoint(uint8_t const * ptr, uint32_t remaining) { unserialize(ptr, remaining); } explicit OutPoint(BinaryData const & txHash, uint32_t txOutIndex) : txHash_(txHash), txOutIndex_(txOutIndex) { } BinaryData const & getTxHash(void) const { return txHash_; } BinaryDataRef getTxHashRef(void) const { return BinaryDataRef(txHash_); } uint32_t getTxOutIndex(void) const { return txOutIndex_; } void setTxHash(BinaryData const & hash) { txHash_.copyFrom(hash); } void setTxOutIndex(uint32_t idx) { txOutIndex_ = idx; } // Define these operators so that we can use OutPoint as a map<> key bool operator<(OutPoint const & op2) const; bool operator==(OutPoint const & op2) const; void serialize(BinaryWriter & bw) const; BinaryData serialize(void) const; void unserialize(uint8_t const * ptr, uint32_t remaining); void unserialize(BinaryReader & br); void unserialize(BinaryRefReader & brr); void unserialize(BinaryData const & bd); void unserialize(BinaryDataRef const & bdRef); void unserialize_swigsafe_(BinaryData const & rawOP) { unserialize(rawOP); } private: BinaryData txHash_; uint32_t txOutIndex_; }; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class TxIn { friend class BlockDataManager_LevelDB; friend class InterfaceToLDB; public: TxIn(void) : dataCopy_(0), parentHash_(0), parentHeight_(UINT32_MAX), scriptType_(TXIN_SCRIPT_NONSTANDARD), scriptOffset_(0) {} // Ptr to the beginning of the TxIn, last two arguments are supplemental /*TxIn(uint8_t const * ptr, uint32_t size, uint32_t nBytes=0, TxRef parent=TxRef(), uint32_t idx=UINT32_MAX) { unserialize_checked(ptr, size, nBytes, parent, idx); } */ uint8_t const * getPtr(void) const { assert(isInitialized()); return dataCopy_.getPtr(); } uint32_t getSize(void) const { assert(isInitialized()); return dataCopy_.getSize(); } bool isStandard(void) const { return scriptType_!=TXIN_SCRIPT_NONSTANDARD; } bool isCoinbase(void) const { return (scriptType_ == TXIN_SCRIPT_COINBASE); } bool isInitialized(void) const {return dataCopy_.getSize() > 0; } OutPoint getOutPoint(void) const; // Script ops BinaryData getScript(void) const; BinaryDataRef getScriptRef(void) const; uint32_t getScriptSize(void) { return getSize() - (scriptOffset_ + 4); } TXIN_SCRIPT_TYPE getScriptType(void) const { return scriptType_; } uint32_t getScriptOffset(void) const { return scriptOffset_; } // SWIG doesn't handle these enums well, so we will provide some direct bools bool isScriptStandard(void) { return scriptType_ != TXIN_SCRIPT_NONSTANDARD;} bool isScriptStdUncompr(void) { return scriptType_ == TXIN_SCRIPT_STDUNCOMPR;} bool isScriptStdCompr(void) { return scriptType_ == TXIN_SCRIPT_STDCOMPR;} bool isScriptCoinbase(void) { return scriptType_ == TXIN_SCRIPT_COINBASE;} bool isScriptSpendMulti(void) { return scriptType_ == TXIN_SCRIPT_SPENDMULTI; } bool isScriptSpendPubKey(void){ return scriptType_ == TXIN_SCRIPT_SPENDPUBKEY; } bool isScriptSpendP2SH(void) { return scriptType_ == TXIN_SCRIPT_SPENDP2SH; } bool isScriptNonStd(void) { return scriptType_ == TXIN_SCRIPT_NONSTANDARD; } TxRef getParentTxRef(void) { return parentTx_; } uint32_t getIndex(void) { return index_; } //void setParentTx(TxRef txref, int32_t idx=-1) {parentTx_=txref; index_=idx;} uint32_t getSequence(void) { return READ_UINT32_LE(getPtr()+getSize()-4); } BinaryData getParentHash(void); uint32_t getParentHeight(void); void setParentHash(BinaryData const & txhash) {parentHash_ = txhash;} void setParentHeight(uint32_t blkheight) {parentHeight_ = blkheight;} ///////////////////////////////////////////////////////////////////////////// BinaryData serialize(void) { return dataCopy_; } ///////////////////////////////////////////////////////////////////////////// void unserialize_checked( uint8_t const * ptr, uint32_t size, uint32_t nbytes=0, TxRef parent=TxRef(), uint32_t idx=UINT32_MAX); void unserialize( BinaryData const & str, uint32_t nbytes=0, TxRef parent=TxRef(), uint32_t idx=UINT32_MAX); void unserialize( BinaryDataRef str, uint32_t nbytes=0, TxRef parent=TxRef(), uint32_t idx=UINT32_MAX); void unserialize( BinaryRefReader & brr, uint32_t nbytes=0, TxRef parent=TxRef(), uint32_t idx=UINT32_MAX); void unserialize_swigsafe_(BinaryData const & rawIn) { unserialize(rawIn); } ///////////////////////////////////////////////////////////////////////////// // Not all TxIns have sendor info. Might have to go to the Outpoint and get // the corresponding TxOut to find the sender. In the case the sender is // not available, return false and don't write the output bool getSenderScrAddrIfAvail(BinaryData & addrTarget) const; BinaryData getSenderScrAddrIfAvail(void) const; void pprint(ostream & os=cout, int nIndent=0, bool pBigendian=true) const; private: BinaryData dataCopy_; BinaryData parentHash_; uint32_t parentHeight_; // Derived properties - we expect these to be set after construct/copy uint32_t index_; TXIN_SCRIPT_TYPE scriptType_; uint32_t scriptOffset_; TxRef parentTx_; }; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class TxOut { friend class BlockDataManager_LevelDB; friend class InterfaceToLDB; public: ///////////////////////////////////////////////////////////////////////////// TxOut(void) : dataCopy_(0), parentHash_(0) {} /* TxOut(uint8_t const * ptr, uint32_t nBytes=0, TxRef parent=TxRef(), uint32_t idx=UINT32_MAX) { unserialize(ptr, nBytes, parent, idx); } */ uint8_t const * getPtr(void) const { return dataCopy_.getPtr(); } uint32_t getSize(void) const { return dataCopy_.getSize(); } uint64_t getValue(void) const { return READ_UINT64_LE(dataCopy_.getPtr()); } bool isStandard(void) const { return scriptType_ != TXOUT_SCRIPT_NONSTANDARD; } bool isInitialized(void) const {return dataCopy_.getSize() > 0; } TxRef getParentTxRef(void) { return parentTx_; } uint32_t getIndex(void) { return index_; } //void setParentTx(TxRef txref, uint32_t idx=-1) { parentTx_=txref; index_=idx;} ///////////////////////////////////////////////////////////////////////////// BinaryData const & getScrAddressStr(void) const { return uniqueScrAddr_; } BinaryDataRef getScrAddressRef(void) const { return uniqueScrAddr_.getRef(); } //BinaryData const & getRecipientAddr(void) const { return recipientBinAddr20_; } //BinaryDataRef getRecipientAddrRef(void) const { return recipientBinAddr20_.getRef(); } ///////////////////////////////////////////////////////////////////////////// BinaryData getScript(void); BinaryDataRef getScriptRef(void); TXOUT_SCRIPT_TYPE getScriptType(void) const { return scriptType_; } uint32_t getScriptSize(void) const { return getSize() - scriptOffset_; } // SWIG doesn't handle these enums well, so we will provide some direct bools bool isScriptStandard(void) { return scriptType_ != TXOUT_SCRIPT_NONSTANDARD;} bool isScriptStdHash160(void) { return scriptType_ == TXOUT_SCRIPT_STDHASH160;} bool isScriptStdPubKey65(void) { return scriptType_ == TXOUT_SCRIPT_STDPUBKEY65;} bool isScriptStdPubKey33(void) { return scriptType_ == TXOUT_SCRIPT_STDPUBKEY33; } bool isScriptP2SH(void) { return scriptType_ == TXOUT_SCRIPT_P2SH; } bool isScriptNonStd(void) { return scriptType_ == TXOUT_SCRIPT_NONSTANDARD; } ///////////////////////////////////////////////////////////////////////////// BinaryData serialize(void) { return BinaryData(dataCopy_); } BinaryDataRef serializeRef(void) { return dataCopy_; } BinaryData getParentHash(void); uint32_t getParentHeight(void); void setParentHash(BinaryData const & txhash) {parentHash_ = txhash;} void setParentHeight(uint32_t blkheight) {parentHeight_ = blkheight;} ///////////////////////////////////////////////////////////////////////////// void unserialize_checked( uint8_t const * ptr, uint32_t size, uint32_t nbytes=0, TxRef parent=TxRef(), uint32_t idx=UINT32_MAX); void unserialize( BinaryData const & str, uint32_t nbytes=0, TxRef parent=TxRef(), uint32_t idx=UINT32_MAX); void unserialize( BinaryDataRef const & str, uint32_t nbytes=0, TxRef parent=TxRef(), uint32_t idx=UINT32_MAX); void unserialize( BinaryRefReader & brr, uint32_t nbytes=0, TxRef parent=TxRef(), uint32_t idx=UINT32_MAX); void unserialize_swigsafe_(BinaryData const & rawOut) { unserialize(rawOut); } void pprint(ostream & os=cout, int nIndent=0, bool pBigendian=true); private: BinaryData dataCopy_; BinaryData parentHash_; uint32_t parentHeight_; // Derived properties - we expect these to be set after construct/copy //BinaryData recipientBinAddr20_; BinaryData uniqueScrAddr_; TXOUT_SCRIPT_TYPE scriptType_; uint32_t scriptOffset_; uint32_t index_; TxRef parentTx_; }; //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// class Tx { friend class BlockDataManager_LevelDB; friend class InterfaceToLDB; public: Tx(void) : isInitialized_(false), offsetsTxIn_(0), offsetsTxOut_(0) {} explicit Tx(uint8_t const * ptr, uint32_t size) { unserialize(ptr, size); } explicit Tx(BinaryRefReader & brr) { unserialize(brr); } explicit Tx(BinaryData const & str) { unserialize(str); } explicit Tx(BinaryDataRef const & str) { unserialize(str); } explicit Tx(TxRef txref); uint8_t const * getPtr(void) const { return dataCopy_.getPtr(); } uint32_t getSize(void) const { return dataCopy_.getSize(); } ///////////////////////////////////////////////////////////////////////////// uint32_t getVersion(void) const { return READ_UINT32_LE(dataCopy_.getPtr());} uint32_t getNumTxIn(void) const { return offsetsTxIn_.size()-1;} uint32_t getNumTxOut(void) const { return offsetsTxOut_.size()-1;} BinaryData getThisHash(void) const; bool isMainBranch(void) const; bool isInitialized(void) const { return isInitialized_; } ///////////////////////////////////////////////////////////////////////////// uint32_t getTxInOffset(uint32_t i) const { return offsetsTxIn_[i]; } uint32_t getTxOutOffset(uint32_t i) const { return offsetsTxOut_[i]; } ///////////////////////////////////////////////////////////////////////////// static Tx createFromStr(BinaryData const & bd) {return Tx(bd);} ///////////////////////////////////////////////////////////////////////////// bool hasTxRef(void) const { return txRefObj_.isInitialized(); } TxRef getTxRef(void) const { return txRefObj_; } void setTxRef(TxRef ref) { txRefObj_ = ref; } ///////////////////////////////////////////////////////////////////////////// BinaryData serialize(void) const { return dataCopy_; } ///////////////////////////////////////////////////////////////////////////// void unserialize(uint8_t const * ptr, uint32_t size); void unserialize(BinaryData const & str) { unserialize(str.getPtr(), str.getSize()); } void unserialize(BinaryDataRef const & str) { unserialize(str.getPtr(), str.getSize()); } void unserialize(BinaryRefReader & brr); //void unserialize_no_txout(BinaryRefReader & brr); void unserialize_swigsafe_(BinaryData const & rawTx) { unserialize(rawTx); } ///////////////////////////////////////////////////////////////////////////// uint32_t getLockTime(void) const { return lockTime_; } uint64_t getSumOfOutputs(void); BinaryData getScrAddrForTxOut(uint32_t txOutIndex); ///////////////////////////////////////////////////////////////////////////// // These are not pointers to persistent object, these methods actually // CREATES the TxIn/TxOut. But the construction is fast, so it's // okay to do it on the fly TxIn getTxInCopy(int i); TxOut getTxOutCopy(int i); ///////////////////////////////////////////////////////////////////////////// // All these methods return UINTX_MAX if txRefObj.isNull() BinaryData getBlockHash(void) { return txRefObj_.getBlockHash(); } uint32_t getBlockTimestamp(void) { return txRefObj_.getBlockTimestamp(); } uint32_t getBlockHeight(void) { return txRefObj_.getBlockHeight(); } uint8_t getDuplicateID(void) { return txRefObj_.getDuplicateID(); } uint16_t getBlockTxIndex(void) { return txRefObj_.getBlockTxIndex(); } ///////////////////////////////////////////////////////////////////////////// void pprint(ostream & os=cout, int nIndent=0, bool pBigendian=true); void pprintAlot(ostream & os=cout); private: // Full copy of the serialized tx BinaryData dataCopy_; bool isInitialized_; uint32_t version_; uint32_t lockTime_; // Derived properties - we expect these to be set after construct/copy BinaryData thisHash_; // Will always create TxIns and TxOuts on-the-fly; only store the offsets vector offsetsTxIn_; vector offsetsTxOut_; // To be calculated later //BlockHeader* headerPtr_; TxRef txRefObj_; }; //////////////////////////////////////////////////////////////////////////////// // TxIOPair // // This makes a lot of sense, despite the added complexity. No TxIn exists // unless there was a TxOut, and they both have the same value, so we will // store them together here. // // This will provide the future benefit of easily determining what Tx data // can be pruned. If a TxIOPair has both TxIn and TxOut, then the value // was received and spent, contributes zero to our balance, and can effectively // ignored. For now we will maintain them, but in the future we may decide // to just start removing TxIOPairs after they are spent (in which case they // are no longer TxIO pairs, they're just TxO's...which eventually are removed) // // class TxIOPair { public: ////////////////////////////////////////////////////////////////////////////// // TODO: since we tend not to track TxIn/TxOuts but make them on the fly, // we should probably do that here, too. I designed this before I // realized that these copies will fall out of sync on a reorg TxIOPair(void); explicit TxIOPair(uint64_t amount); explicit TxIOPair(TxRef txRefO, uint32_t txoutIndex); explicit TxIOPair(BinaryData txOutKey8B, uint64_t value); explicit TxIOPair(TxRef txRefO, uint32_t txoutIndex, TxRef txRefI, uint32_t txinIndex); // Lots of accessors bool hasTxOut(void) const { return (txRefOfOutput_.isInitialized()); } bool hasTxIn(void) const { return (txRefOfInput_.isInitialized()); } bool hasTxOutInMain(void) const; bool hasTxInInMain(void) const; bool hasTxOutZC(void) const; bool hasTxInZC(void) const; bool hasValue(void) const { return (amount_!=0); } uint64_t getValue(void) const { return amount_;} void setValue(uint64_t newVal) { amount_ = newVal;} ////////////////////////////////////////////////////////////////////////////// TxOut getTxOutCopy(void); TxIn getTxInCopy(void); TxOut getTxOutZC(void) const {return txOfOutputZC_->getTxOutCopy(indexOfOutputZC_);} TxIn getTxInZC(void) const {return txOfInputZC_->getTxInCopy(indexOfInputZC_);} TxRef getTxRefOfOutput(void) const { return txRefOfOutput_; } TxRef getTxRefOfInput(void) const { return txRefOfInput_; } uint32_t getIndexOfOutput(void) const { return indexOfOutput_; } uint32_t getIndexOfInput(void) const { return indexOfInput_; } OutPoint getOutPoint(void) { return OutPoint(getTxHashOfOutput(),indexOfOutput_);} pair reassessValidity(void); bool isTxOutFromSelf(void) const { return isTxOutFromSelf_; } void setTxOutFromSelf(bool isTrue=true) { isTxOutFromSelf_ = isTrue; } bool isFromCoinbase(void) const { return isFromCoinbase_; } void setFromCoinbase(bool isTrue=true) { isFromCoinbase_ = isTrue; } bool isMultisig(void) const { return isMultisig_; } void setMultisig(bool isTrue=true) { isMultisig_ = isTrue; } BinaryData getDBKeyOfOutput(void) const { return txRefOfOutput_.getDBKeyOfChild(indexOfOutput_);} BinaryData getDBKeyOfInput(void) const { return txRefOfInput_.getDBKeyOfChild(indexOfInput_);} ////////////////////////////////////////////////////////////////////////////// BinaryData getTxHashOfInput(void); BinaryData getTxHashOfOutput(void); bool setTxIn (TxRef txref, uint32_t index); bool setTxIn (BinaryData dbKey8B); bool setTxOut (TxRef txref, uint32_t index); bool setTxOut (BinaryData dbKey8B); bool setTxInZC (Tx* tx, uint32_t index); bool setTxOutZC(Tx* tx, uint32_t index); ////////////////////////////////////////////////////////////////////////////// bool isSourceUnknown(void) { return ( !hasTxOut() && hasTxIn() ); } bool isStandardTxOutScript(void); bool isSpent(void); bool isUnspent(void); bool isSpendable(uint32_t currBlk=0, bool ignoreAllZeroConf=false); bool isMineButUnconfirmed(uint32_t currBlk, bool includeAllZeroConf=false); void clearZCFields(void); void pprintOneLine(void); bool operator<(TxIOPair const & t2) { return (getDBKeyOfOutput() < t2.getDBKeyOfOutput()); } bool operator==(TxIOPair const & t2) { return (getDBKeyOfOutput() == t2.getDBKeyOfOutput()); } private: uint64_t amount_; TxRef txRefOfOutput_; uint32_t indexOfOutput_; TxRef txRefOfInput_; uint32_t indexOfInput_; // Zero-conf data isn't on disk, yet, so can't use TxRef Tx* txOfOutputZC_; uint32_t indexOfOutputZC_; Tx* txOfInputZC_; uint32_t indexOfInputZC_; bool isTxOutFromSelf_; bool isFromCoinbase_; bool isMultisig_; }; //////////////////////////////////////////////////////////////////////////////// // Just a simple struct for storing spentness info /* class SpentByRef { public: SpentByRef(BinaryData const & ref) { BinaryRefReader brr(ref); initialize(brr); } SpentByRef(BinaryDataRef const & ref) { BinaryRefReader brr(ref); initialize(brr); } SpentByRef(BinaryRefReader & brr) { initialize(brr); } SpentByRef(BinaryData const & hgtxPlusTxIdx, uint16_t key) { //static uint8_t blkdataprefix = (uint8_t)DB_PREFIX_BLKDATA; //dbKey_ = BinaryData(&blkdataprefix,1) + hgtxPlusTxIdx; //txInIndex_ = brr.get_uint16_t(); } void initialize(BinaryRefReader & brr) { //static uint8_t blkdataprefix = (uint8_t)DB_PREFIX_BLKDATA; //dbKey_ = BinaryData(&blkdataprefix,1) + brr.get_BinaryData(6); //txInIndex_ = brr.get_uint16_t(); } public: BinaryData dbKey_; uint16_t txInIndex_; }; */ //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // This class is mainly for sorting by priority class UnspentTxOut { public: UnspentTxOut(void); UnspentTxOut(TxOut & txout, uint32_t blknum) { init(txout, blknum);} UnspentTxOut(BinaryData const & hash, uint32_t outIndex, uint32_t height, uint64_t val, BinaryData const & script) : txHash_(hash), txOutIndex_(outIndex), txHeight_(height), value_(val), script_(script) {} void init(TxOut & txout, uint32_t blknum, bool isMultiRef=false); BinaryData getTxHash(void) const { return txHash_; } uint32_t getTxOutIndex(void) const { return txOutIndex_; } uint64_t getValue(void) const { return value_; } uint64_t getTxHeight(void) const { return txHeight_; } uint32_t getNumConfirm(void) const { return numConfirm_; } uint32_t isMultisigRef(void) const { return isMultisigRef_; } OutPoint getOutPoint(void) const { return OutPoint(txHash_, txOutIndex_); } BinaryData const & getScript(void) const { return script_; } BinaryData getRecipientScrAddr(void) const; uint32_t updateNumConfirm(uint32_t currBlknum); void pprintOneLine(uint32_t currBlk=UINT32_MAX); //float getPriority(void); //bool operator<(UnspentTxOut const & t2) //{ return (getPriority() < t2.getPriority()); } //bool operator==(UnspentTxOut const & t2) //{ return (getPriority() == t2.getPriority()); } // These four methods are listed from steepest-to-shallowest in terms of // how much they favor large inputs over small inputs. // NOTE: This isn't useful at all anymore: it was hardly useful even before // I had UTXO sorting in python. This was really more experimental // than anything, so I wouldn't bother doing anything with it unless // you want to use it as a template for custom sorting in C++ static bool CompareNaive(UnspentTxOut const & uto1, UnspentTxOut const & uto2); static bool CompareTech1(UnspentTxOut const & uto1, UnspentTxOut const & uto2); static bool CompareTech2(UnspentTxOut const & uto1, UnspentTxOut const & uto2); static bool CompareTech3(UnspentTxOut const & uto1, UnspentTxOut const & uto2); static void sortTxOutVect(vector & utovect, int sortType=1); public: BinaryData txHash_; uint32_t txOutIndex_; uint32_t txHeight_; uint64_t value_; BinaryData script_; uint32_t numConfirm_; bool isMultisigRef_; // This can be set and used as part of a compare function: if you want // each TxOut prioritization to be dependent on the target Tx amount. uint64_t targetTxAmount_; }; //////////////////////////////////////////////////////////////////////////////// // BDM is now tracking "registered" addresses and wallets during each of its // normal scanning operations. class RegisteredScrAddr { public: RegisteredScrAddr(HashString a160=HashString(0), uint32_t blkCreated=0) : uniqueKey_(a160), blkCreated_(blkCreated), alreadyScannedUpToBlk_(blkCreated) { } //RegisteredScrAddr(BtcAddress const & addrObj, int32_t blkCreated=-1); bool operator==(RegisteredScrAddr const & ra2) const { return uniqueKey_ == ra2.uniqueKey_;} bool operator< (RegisteredScrAddr const & ra2) const { return uniqueKey_ < ra2.uniqueKey_;} bool operator> (RegisteredScrAddr const & ra2) const { return uniqueKey_ > ra2.uniqueKey_;} void setUniqueKey(BinaryData const & key) { addrType_ = uniqueKey_[0]; uniqueKey_.copyFrom(key.getPtr()+1, key.getSize()-1); } BinaryData uniqueKey_; uint8_t addrType_; uint32_t blkCreated_; uint32_t alreadyScannedUpToBlk_; uint64_t sumValue_; }; //////////////////////////////////////////////////////////////////////////////// // We're going to need to be able to sort our list of registered transactions, // so I decided to make a new class to support it, with a native operator<(). // // I debated calling this class "SortableTx" class RegisteredTx { public: TxRef txRefObj_; // Not necessary for sorting, but useful BinaryData txHash_; uint32_t blkNum_; uint16_t txIndex_; TxRef getTxRef() { return txRefObj_; } Tx getTxCopy() { return txRefObj_.getTxCopy(); } BinaryData getTxHash() { return txHash_; } uint32_t getBlkNum() { return blkNum_; } uint16_t getTxIndex() { return txIndex_; } RegisteredTx(void) : txHash_(""), blkNum_(UINT32_MAX), txIndex_(UINT16_MAX) { } RegisteredTx( BinaryData const & txHash, uint32_t blkNum, uint16_t txIndex) : txHash_(txHash), blkNum_(blkNum), txIndex_(txIndex) { } RegisteredTx( TxRef txref, BinaryData const & txHash, uint32_t blkNum, uint16_t txIndex) : txRefObj_(txref), txHash_(txHash), blkNum_(blkNum), txIndex_(txIndex) { } explicit RegisteredTx(TxRef txref) : txRefObj_(txref), txHash_(txref.getThisHash()), blkNum_(txref.getBlockHeight()), txIndex_(txref.getBlockTxIndex()) { } explicit RegisteredTx(Tx & tx) : txRefObj_(tx.getTxRef()), txHash_(tx.getThisHash()), blkNum_(tx.getBlockHeight()), txIndex_(tx.getBlockTxIndex()) { } bool operator<(RegisteredTx const & rt2) const { if( blkNum_ < rt2.blkNum_ ) return true; else if( rt2.blkNum_ < blkNum_ ) return false; else return (txIndex_ {4FC737F1-C7A5-4376-A066-2A32D752A2FF} cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx {93995380-89BD-4b04-88EB-625FBE52EBFB} h;hpp;hxx;hm;inl;inc;xsd {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav Source Files armory-0.92.3/cppForSwig/guardian/guardian.vcproj0000644000000000000000000000736312414772654020535 0ustar rootroot armory-0.92.3/cppForSwig/guardian/guardian.sln0000644000000000000000000000157212414772654020022 0ustar rootroot Microsoft Visual Studio Solution File, Format Version 12.00 # Visual Studio Express 2012 for Windows Desktop Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "guardian", "guardian.vcxproj", "{D35F732D-55D7-4037-9C6D-E141F740F802}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {D35F732D-55D7-4037-9C6D-E141F740F802}.Debug|Win32.ActiveCfg = Debug|Win32 {D35F732D-55D7-4037-9C6D-E141F740F802}.Debug|Win32.Build.0 = Debug|Win32 {D35F732D-55D7-4037-9C6D-E141F740F802}.Release|Win32.ActiveCfg = Release|Win32 {D35F732D-55D7-4037-9C6D-E141F740F802}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal armory-0.92.3/cppForSwig/guardian/guardian.vcxproj0000644000000000000000000004206712414772654020725 0ustar rootroot Debug Win32 Debug x64 Release Win32 Release x64 WinXP_32 Win32 WinXP_32 x64 {D35F732D-55D7-4037-9C6D-E141F740F802} guardian Win32Proj Application v110 MultiByte true Application v100 MultiByte true Application v100 MultiByte true Application v110 MultiByte true Application v110 MultiByte true Application v110 MultiByte true Application v110 Unicode Application v110 Unicode v100 v110 v100 true v110 <_ProjectFileVersion>11.0.50727.1 $(SolutionDir)\..\ $(Configuration)\ true true $(SolutionDir)\..\ArmoryStandalone\ $(Configuration)\ false $(SolutionDir)\..\ArmoryStandalone\ $(Configuration)\ false $(SolutionDir)\..\ArmoryStandalone\ $(Configuration)\ false false $(SolutionDir)\..\ArmoryStandalone\ false false $(SolutionDir)\..\ArmoryStandalone\ Disabled WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) true EnableFastChecks MultiThreaded Level3 EditAndContinue true Console MachineX86 Disabled WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) EnableFastChecks MultiThreaded Level3 ProgramDatabase true Console MaxSpeed true WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) MultiThreaded true Level3 ProgramDatabase false Console true true MachineX86 copy ..\..\ArmoryStandalone\guardian.exe ..\guardian.exe MaxSpeed true WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) MultiThreaded true Level3 ProgramDatabase false Console true true MachineX86 copy ..\..\ArmoryStandalone\guardian.exe ..\guardian.exe MaxSpeed true WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) MultiThreaded true Level3 None false Console true true MachineX86 copy ..\..\ArmoryStandalone\guardian.exe ..\guardian.exe MaxSpeed true WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) MultiThreaded true Level3 ProgramDatabase true Console true true copy ..\..\ArmoryStandalone\guardian.exe ..\guardian.exe MaxSpeed true WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) MultiThreaded true Level3 ProgramDatabase true Console true true copy ..\..\ArmoryStandalone\guardian.exe ..\guardian.exe MaxSpeed true WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) MultiThreaded true Level3 ProgramDatabase true Console true true copy ..\..\ArmoryStandalone\guardian.exe ..\guardian.exe copy ..\..\ArmoryStandalone\guardian.exe ..\guardian.exe false Console MultiThreaded armory-0.92.3/cppForSwig/guardian/guardian.cpp0000644000000000000000000000652012414772654020006 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// // // A very simple program that simply monitors one PID, and kills another one // when it disappears. This is needed for when Armory spawns a bitcoind // process in the background, but crashes before it can close it. Armory // will launch this "guardian" to kill bitcoind.exe if Armory.exe disappears. // #include #include #include #include #include // Forward declarations: BOOL GetProcessList( ); BOOL ListProcessModules( DWORD dwPID ); BOOL ListProcessThreads( DWORD dwOwnerPID ); bool processIsStillRunning(HANDLE hndl) { DWORD exitCode = 0; GetExitCodeProcess(hndl, &exitCode); return (exitCode==STILL_ACTIVE); } DWORD getProcessWithParent(int pid) { HANDLE hProcessSnap; PROCESSENTRY32 pe32; // Take a snapshot of all processes in the system. hProcessSnap = CreateToolhelp32Snapshot( TH32CS_SNAPPROCESS, 0 ); if( hProcessSnap == INVALID_HANDLE_VALUE ) { return( FALSE ); } // Set the size of the structure before using it. pe32.dwSize = sizeof( PROCESSENTRY32 ); // Retrieve information about the first process, // and exit if unsuccessful if( !Process32First( hProcessSnap, &pe32 ) ) { CloseHandle( hProcessSnap ); // clean the snapshot object return( FALSE ); } // Now walk the snapshot of processes, and // display information about each process in turn DWORD parent = static_cast(pid); DWORD childID = 0xffffffff; do { if(pe32.th32ParentProcessID == parent) return static_cast(pe32.th32ProcessID); } while( Process32Next( hProcessSnap, &pe32 ) ); _tprintf( TEXT("Never found process with parent!") ); return childID; } int main(int argc, char** argv ) { if(argc != 3) { _tprintf( TEXT("\nInvalid arguments:")); _tprintf( TEXT("\nUSAGE: guardian.exe pidWatch pidKill")); // I know I should use argv[0] instead of "guardian.exe", but I // don't feel like messing with strings<->windows.h. I had a bad // experience once... return 1; } int pidWatch = atoi(argv[1]); int pidKillA = atoi(argv[2]); int pidKillB = getProcessWithParent(pidKillA); _tprintf( TEXT("Found two processes to kill: "), pidKillA, TEXT(" "), pidKillB); HANDLE hWatch = OpenProcess(PROCESS_ALL_ACCESS, FALSE, static_cast(pidWatch)); HANDLE hKillA = OpenProcess(PROCESS_ALL_ACCESS, FALSE, static_cast(pidKillA)); HANDLE hKillB = OpenProcess(PROCESS_ALL_ACCESS, FALSE, static_cast(pidKillB)); while(processIsStillRunning(hWatch)) Sleep(static_cast(2000)); _tprintf( TEXT("\nThe watched process died!")); TerminateProcess(hKillA, 0); TerminateProcess(hKillB, 0); _tprintf( TEXT("\nAttempted to kill the two processes! "), pidKillA, TEXT(" "), pidKillB); return 0; } armory-0.92.3/cppForSwig/BlockObj.cpp0000644000000000000000000011424212414772654016110 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// #include #include #include #include #include #include "BinaryData.h" #include "BtcUtils.h" #include "BlockObj.h" #include "leveldb_wrapper.h" //////////////////////////////////////////////////////////////////////////////// void BlockHeader::unserialize(uint8_t const * ptr, uint32_t size) { if (size < HEADER_SIZE) throw BlockDeserializingException(); dataCopy_.copyFrom(ptr, HEADER_SIZE); BtcUtils::getHash256(dataCopy_.getPtr(), HEADER_SIZE, thisHash_); difficultyDbl_ = BtcUtils::convertDiffBitsToDouble( BinaryDataRef(dataCopy_.getPtr()+72, 4)); isInitialized_ = true; nextHash_ = BinaryData(0); blockHeight_ = UINT32_MAX; difficultySum_ = -1; isMainBranch_ = false; isOrphan_ = true; //txPtrList_ = vector(0); numTx_ = UINT32_MAX; } //////////////////////////////////////////////////////////////////////////////// void BlockHeader::unserialize(BinaryDataRef const & str) { unserialize(str.getPtr(), str.getSize()); } //////////////////////////////////////////////////////////////////////////////// void BlockHeader::unserialize(BinaryRefReader & brr) { unserialize(brr.get_BinaryDataRef(HEADER_SIZE)); } ///////////////////////////////////////////////////////////////////////////// void BlockHeader::pprint(ostream & os, int nIndent, bool pBigendian) const { string indent = ""; for(int i=0; i key bool OutPoint::operator<(OutPoint const & op2) const { if(txHash_ == op2.txHash_) return txOutIndex_ < op2.txOutIndex_; else return txHash_ < op2.txHash_; } bool OutPoint::operator==(OutPoint const & op2) const { return (txHash_ == op2.txHash_ && txOutIndex_ == op2.txOutIndex_); } void OutPoint::serialize(BinaryWriter & bw) const { bw.put_BinaryData(txHash_); bw.put_uint32_t(txOutIndex_); } BinaryData OutPoint::serialize(void) const { BinaryWriter bw(36); serialize(bw); return bw.getData(); } void OutPoint::unserialize(uint8_t const * ptr, uint32_t size) { if (size < 32) throw BlockDeserializingException(); txHash_.copyFrom(ptr, 32); txOutIndex_ = READ_UINT32_LE(ptr+32); } void OutPoint::unserialize(BinaryReader & br) { if (br.getSizeRemaining() < 32) throw BlockDeserializingException(); br.get_BinaryData(txHash_, 32); txOutIndex_ = br.get_uint32_t(); } void OutPoint::unserialize(BinaryRefReader & brr) { if (brr.getSizeRemaining() < 32) throw BlockDeserializingException(); brr.get_BinaryData(txHash_, 32); txOutIndex_ = brr.get_uint32_t(); } void OutPoint::unserialize(BinaryData const & bd) { unserialize(bd.getPtr(), bd.getSize()); } void OutPoint::unserialize(BinaryDataRef const & bdRef) { unserialize(bdRef.getPtr(), bdRef.getSize()); } //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // // TxIn methods // //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// OutPoint TxIn::getOutPoint(void) const { OutPoint op; op.unserialize(getPtr(), getSize()); return op; } ///////////////////////////////////////////////////////////////////////////// BinaryData TxIn::getScript(void) const { uint32_t scrLen = (uint32_t)BtcUtils::readVarInt(getPtr()+36); return BinaryData(getPtr() + getScriptOffset(), scrLen); } ///////////////////////////////////////////////////////////////////////////// BinaryDataRef TxIn::getScriptRef(void) const { uint32_t scrLen = (uint32_t)BtcUtils::readVarInt(getPtr()+36); return BinaryDataRef(getPtr() + getScriptOffset(), scrLen); } ///////////////////////////////////////////////////////////////////////////// void TxIn::unserialize_checked(uint8_t const * ptr, uint32_t size, uint32_t nbytes, TxRef parent, uint32_t idx) { parentTx_ = parent; index_ = idx; uint32_t numBytes = (nbytes==0 ? BtcUtils::TxInCalcLength(ptr, size) : nbytes); if (size < numBytes) throw BlockDeserializingException(); dataCopy_.copyFrom(ptr, numBytes); if (dataCopy_.getSize()-36 < 1) throw BlockDeserializingException(); scriptOffset_ = 36 + BtcUtils::readVarIntLength(getPtr()+36); if (dataCopy_.getSize() < 32) throw BlockDeserializingException(); scriptType_ = BtcUtils::getTxInScriptType(getScriptRef(), BinaryDataRef(getPtr(),32)); if(!parentTx_.isInitialized()) { parentHeight_ = UINT32_MAX; parentHash_ = BinaryData(0); } } ///////////////////////////////////////////////////////////////////////////// void TxIn::unserialize(BinaryRefReader & brr, uint32_t nbytes, TxRef parent, uint32_t idx) { unserialize_checked(brr.getCurrPtr(), brr.getSizeRemaining(), nbytes, parent, idx); brr.advance(getSize()); } ///////////////////////////////////////////////////////////////////////////// void TxIn::unserialize(BinaryData const & str, uint32_t nbytes, TxRef parent, uint32_t idx) { unserialize_checked(str.getPtr(), str.getSize(), nbytes, parent, idx); } ///////////////////////////////////////////////////////////////////////////// void TxIn::unserialize(BinaryDataRef str, uint32_t nbytes, TxRef parent, uint32_t idx) { unserialize_checked(str.getPtr(), str.getSize(), nbytes, parent, idx); } ///////////////////////////////////////////////////////////////////////////// // Not all TxIns have this information. Have to go to the Outpoint and get // the corresponding TxOut to find the sender. In the case the sender is // not available, return false and don't write the output bool TxIn::getSenderScrAddrIfAvail(BinaryData & addrTarget) const { if(scriptType_ == TXIN_SCRIPT_NONSTANDARD || scriptType_ == TXIN_SCRIPT_COINBASE) { addrTarget = BtcUtils::BadAddress_; return false; } try { addrTarget = BtcUtils::getTxInAddrFromType(getScript(), scriptType_); } catch (BlockDeserializingException&) { return false; } return true; } //////////////////////////////////////////////////////////////////////////////// BinaryData TxIn::getSenderScrAddrIfAvail(void) const { BinaryData addrTarget(20); getSenderScrAddrIfAvail(addrTarget); return addrTarget; } //////////////////////////////////////////////////////////////////////////////// BinaryData TxIn::getParentHash(void) { if(!parentTx_.isInitialized()) return parentHash_; else return parentTx_.getThisHash(); } //////////////////////////////////////////////////////////////////////////////// uint32_t TxIn::getParentHeight(void) { if(!parentTx_.isInitialized()) return parentHeight_; else return parentTx_.getBlockHeight(); } //////////////////////////////////////////////////////////////////////////////// void TxIn::pprint(ostream & os, int nIndent, bool pBigendian) const { string indent = ""; for(int i=0; i size) throw BlockDeserializingException(); BinaryDataRef scriptRef(dataCopy_.getPtr()+scriptOffset_, getScriptSize()); scriptType_ = BtcUtils::getTxOutScriptType(scriptRef); uniqueScrAddr_ = BtcUtils::getTxOutScrAddr(scriptRef); if(!parentTx_.isInitialized()) { parentHeight_ = UINT32_MAX; parentHash_ = BinaryData(0); } } ///////////////////////////////////////////////////////////////////////////// void TxOut::unserialize( BinaryData const & str, uint32_t nbytes, TxRef parent, uint32_t idx) { unserialize_checked(str.getPtr(), str.getSize(), nbytes, parent, idx); } ///////////////////////////////////////////////////////////////////////////// void TxOut::unserialize( BinaryDataRef const & str, uint32_t nbytes, TxRef parent, uint32_t idx) { unserialize_checked(str.getPtr(), str.getSize(), nbytes, parent, idx); } ///////////////////////////////////////////////////////////////////////////// void TxOut::unserialize( BinaryRefReader & brr, uint32_t nbytes, TxRef parent, uint32_t idx) { unserialize_checked( brr.getCurrPtr(), brr.getSizeRemaining(), nbytes, parent, idx ); brr.advance(getSize()); } //////////////////////////////////////////////////////////////////////////////// BinaryData TxOut::getParentHash(void) { if(!parentTx_.isInitialized()) return parentHash_; else return parentTx_.getThisHash(); } //////////////////////////////////////////////////////////////////////////////// uint32_t TxOut::getParentHeight(void) { if(!parentTx_.isInitialized()) return parentHeight_; else return parentTx_.getBlockHeight(); } ///////////////////////////////////////////////////////////////////////////// void TxOut::pprint(ostream & os, int nIndent, bool pBigendian) { string indent = ""; for(int i=0; i size) throw BlockDeserializingException(); dataCopy_.copyFrom(ptr, nBytes); BtcUtils::getHash256(ptr, nBytes, thisHash_); if (8 > size) throw BlockDeserializingException(); uint32_t numTxOut = offsetsTxOut_.size()-1; version_ = READ_UINT32_LE(ptr); if (4 > size - offsetsTxOut_[numTxOut]) throw BlockDeserializingException(); lockTime_ = READ_UINT32_LE(ptr + offsetsTxOut_[numTxOut]); isInitialized_ = true; //headerPtr_ = NULL; } ///////////////////////////////////////////////////////////////////////////// bool Tx::isMainBranch(void) const { if(txRefObj_.isNull()) return false; else return txRefObj_.isMainBranch(); } ///////////////////////////////////////////////////////////////////////////// BinaryData Tx::getThisHash(void) const { return BtcUtils::getHash256(dataCopy_.getPtr(), dataCopy_.getSize()); } ///////////////////////////////////////////////////////////////////////////// void Tx::unserialize(BinaryRefReader & brr) { unserialize(brr.getCurrPtr(), brr.getSizeRemaining()); brr.advance(getSize()); } ///////////////////////////////////////////////////////////////////////////// uint64_t Tx::getSumOfOutputs(void) { uint64_t sumVal = 0; for(uint32_t i=0; i" << endl; else os << indent << " Blk: " << getBlockHeight() << endl; os << indent << " TxSize: " << getSize() << " bytes" << endl; os << indent << " NumInputs: " << getNumTxIn() << endl; os << indent << " NumOutputs: " << getNumTxOut() << endl; os << endl; for(uint32_t i=0; igetFullTxCopy(dbKey6B_).serialize(); } ///////////////////////////////////////////////////////////////////////////// Tx TxRef::getTxCopy(void) const { if(!isBound()) return Tx(); return dbIface_->getFullTxCopy(dbKey6B_); } ///////////////////////////////////////////////////////////////////////////// bool TxRef::isMainBranch(void) const { if(dbKey6B_.getSize() != 6) return false; else { if(!isBound()) return false; uint8_t dup8 = dbIface_->getValidDupIDForHeight(getBlockHeight()); return (getDuplicateID() == dup8); } } ///////////////////////////////////////////////////////////////////////////// BinaryData TxRef::getThisHash(void) const { if(!isBound()) return BinaryData(0); return dbIface_->getTxHashForLdbKey(dbKey6B_); } ///////////////////////////////////////////////////////////////////////////// void TxRef::setRef(BinaryDataRef bdr, InterfaceToLDB* iface) { dbKey6B_ = bdr.copy(); dbIface_ = iface; if(iface==NULL) dbIface_ = LevelDBWrapper().GetInterfacePtr(); } ///////////////////////////////////////////////////////////////////////////// uint32_t TxRef::getBlockTimestamp(void) { static StoredHeader sbh; if(dbIface_!=NULL && dbKey6B_.getSize() == 6) { dbIface_->getStoredHeader(sbh, getBlockHeight(), getDuplicateID(), false); return READ_UINT32_BE(sbh.dataCopy_.getPtr()+68); } else return UINT32_MAX; } ///////////////////////////////////////////////////////////////////////////// BinaryData TxRef::getBlockHash(void) const { static StoredHeader sbh; if(dbIface_!=NULL && dbKey6B_.getSize() == 6) { dbIface_->getStoredHeader(sbh, getBlockHeight(), getDuplicateID(), false); return sbh.thisHash_; } else return BtcUtils::EmptyHash_; } ///////////////////////////////////////////////////////////////////////////// uint32_t TxRef::getBlockHeight(void) const { if(dbKey6B_.getSize() == 6) return DBUtils.hgtxToHeight(dbKey6B_.getSliceCopy(0,4)); else return UINT32_MAX; } ///////////////////////////////////////////////////////////////////////////// uint8_t TxRef::getDuplicateID(void) const { if(dbKey6B_.getSize() == 6) return DBUtils.hgtxToDupID(dbKey6B_.getSliceCopy(0,4)); else return UINT8_MAX; } ///////////////////////////////////////////////////////////////////////////// uint16_t TxRef::getBlockTxIndex(void) const { if(dbKey6B_.getSize() == 6) return READ_UINT16_BE(dbKey6B_.getPtr() + 4); else return UINT16_MAX; } ///////////////////////////////////////////////////////////////////////////// void TxRef::pprint(ostream & os, int nIndent) const { os << "TxRef Information:" << endl; os << " Hash: " << getThisHash().toHexStr() << endl; os << " Height: " << getBlockHeight() << endl; os << " BlkIndex: " << getBlockTxIndex() << endl; //os << " FileIdx: " << blkFilePtr_.getFileIndex() << endl; //os << " FileStart: " << blkFilePtr_.getStartByte() << endl; //os << " NumBytes: " << blkFilePtr_.getNumBytes() << endl; os << " ----- " << endl; os << " Read from disk, full tx-info: " << endl; getTxCopy().pprint(os, nIndent+1); } //////////////////////////////////////////////////////////////////////////////// TxIn TxRef::getTxInCopy(uint32_t i) { return dbIface_->getTxInCopy( dbKey6B_, i); } //////////////////////////////////////////////////////////////////////////////// TxOut TxRef::getTxOutCopy(uint32_t i) { return dbIface_->getTxOutCopy(dbKey6B_, i); } //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // // TxIOPair Methods // //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// ////////////////////////////////////////////////////////////////////////////// TxIOPair::TxIOPair(void) : amount_(0), indexOfOutput_(0), indexOfInput_(0), txOfOutputZC_(NULL), indexOfOutputZC_(0), txOfInputZC_(NULL), indexOfInputZC_(0), isTxOutFromSelf_(false), isFromCoinbase_(false), isMultisig_(false) {} ////////////////////////////////////////////////////////////////////////////// TxIOPair::TxIOPair(uint64_t amount) : amount_(amount), indexOfOutput_(0), indexOfInput_(0), txOfOutputZC_(NULL), indexOfOutputZC_(0), txOfInputZC_(NULL), indexOfInputZC_(0) , isTxOutFromSelf_(false), isFromCoinbase_(false), isMultisig_(false) {} ////////////////////////////////////////////////////////////////////////////// TxIOPair::TxIOPair(TxRef txPtrO, uint32_t txoutIndex) : amount_(0), indexOfInput_(0) , txOfOutputZC_(NULL), indexOfOutputZC_(0), txOfInputZC_(NULL), indexOfInputZC_(0), isTxOutFromSelf_(false), isFromCoinbase_(false), isMultisig_(false) { setTxOut(txPtrO, txoutIndex); } ////////////////////////////////////////////////////////////////////////////// TxIOPair::TxIOPair(TxRef txPtrO, uint32_t txoutIndex, TxRef txPtrI, uint32_t txinIndex) : amount_(0), txOfOutputZC_(NULL), indexOfOutputZC_(0), txOfInputZC_(NULL), indexOfInputZC_(0), isTxOutFromSelf_(false), isFromCoinbase_(false), isMultisig_(false) { setTxOut(txPtrO, txoutIndex); setTxIn (txPtrI, txinIndex ); } ////////////////////////////////////////////////////////////////////////////// TxIOPair::TxIOPair(BinaryData txOutKey8B, uint64_t val) : amount_(val), indexOfOutput_(0), indexOfInput_(0), txOfOutputZC_(NULL), indexOfOutputZC_(0), txOfInputZC_(NULL), indexOfInputZC_(0), isTxOutFromSelf_(false), isFromCoinbase_(false), isMultisig_(false) { setTxOut(txOutKey8B); } ////////////////////////////////////////////////////////////////////////////// HashString TxIOPair::getTxHashOfOutput(void) { if(!hasTxOut()) return BtcUtils::EmptyHash_; else if(txRefOfOutput_.isInitialized()) return txRefOfOutput_.getThisHash(); else return BinaryData(0); } ////////////////////////////////////////////////////////////////////////////// HashString TxIOPair::getTxHashOfInput(void) { if(!hasTxIn()) return BtcUtils::EmptyHash_; else if(txRefOfInput_.isInitialized()) return txRefOfInput_.getThisHash(); else return BinaryData(0); } ////////////////////////////////////////////////////////////////////////////// TxOut TxIOPair::getTxOutCopy(void) { // I actually want this to segfault when there is no TxOut... // we should't ever be trying to access it without checking it // first in the calling code (hasTxOut/hasTxOutZC) if(hasTxOut()) return txRefOfOutput_.getTxOutCopy(indexOfOutput_); else return getTxOutZC(); } ////////////////////////////////////////////////////////////////////////////// TxIn TxIOPair::getTxInCopy(void) { // I actually want this to segfault when there is no TxIn... // we should't ever be trying to access it without checking it // first in the calling code (hasTxIn/hasTxInZC) if(hasTxIn()) return txRefOfInput_.getTxInCopy(indexOfInput_); else return getTxInZC(); } ////////////////////////////////////////////////////////////////////////////// bool TxIOPair::setTxIn(TxRef txref, uint32_t index) { txRefOfInput_ = txref; indexOfInput_ = index; txOfInputZC_ = NULL; indexOfInputZC_= 0; return true; } ////////////////////////////////////////////////////////////////////////////// bool TxIOPair::setTxIn(BinaryData dbKey8B) { BinaryRefReader brr(dbKey8B); BinaryDataRef txKey6B = brr.get_BinaryDataRef(6); uint16_t txInIdx = brr.get_uint16_t(BIGENDIAN); return setTxIn(TxRef(txKey6B), (uint32_t)txInIdx); } ////////////////////////////////////////////////////////////////////////////// bool TxIOPair::setTxOut(BinaryData dbKey8B) { BinaryRefReader brr(dbKey8B); BinaryDataRef txKey6B = brr.get_BinaryDataRef(6); uint16_t txOutIdx = brr.get_uint16_t(BIGENDIAN); return setTxOut(TxRef(txKey6B), (uint32_t)txOutIdx); } ////////////////////////////////////////////////////////////////////////////// bool TxIOPair::setTxInZC(Tx* tx, uint32_t index) { if(hasTxInInMain() || hasTxInZC()) return false; else { txRefOfInput_ = TxRef(); indexOfInput_ = 0; txOfInputZC_ = tx; indexOfInputZC_ = index; } return true; } ////////////////////////////////////////////////////////////////////////////// bool TxIOPair::setTxOut(TxRef txref, uint32_t index) { txRefOfOutput_ = txref; indexOfOutput_ = index; txOfOutputZC_ = NULL; indexOfOutputZC_ = 0; return true; } ////////////////////////////////////////////////////////////////////////////// bool TxIOPair::setTxOutZC(Tx* tx, uint32_t index) { if(hasTxOutInMain() || hasTxOutZC()) return false; else { txRefOfOutput_ = TxRef(); indexOfOutput_ = 0; txOfOutputZC_ = tx; indexOfOutputZC_ = index; } return true; } ////////////////////////////////////////////////////////////////////////////// bool TxIOPair::isStandardTxOutScript(void) { if(hasTxOut()) return getTxOutCopy().isStandard(); return false; } ////////////////////////////////////////////////////////////////////////////// pair TxIOPair::reassessValidity(void) { pair result; result.first = hasTxOutInMain(); result.second = hasTxInInMain(); return result; } ////////////////////////////////////////////////////////////////////////////// bool TxIOPair::isSpent(void) { // Not sure whether we should verify hasTxOut. It wouldn't make much // sense to have TxIn but not TxOut, but there might be a preferred // behavior in such awkward circumstances return (hasTxInInMain() || hasTxInZC()); } ////////////////////////////////////////////////////////////////////////////// bool TxIOPair::isUnspent(void) { return ( (hasTxOutInMain() || hasTxOutZC()) && !isSpent()); } ////////////////////////////////////////////////////////////////////////////// bool TxIOPair::isSpendable(uint32_t currBlk, bool ignoreAllZeroConf) { // Spendable TxOuts are ones with at least 1 confirmation, or zero-conf // TxOuts that were sent-to-self. Obviously, they should be unspent, too if( hasTxInInMain() || hasTxInZC() ) return false; if( hasTxOutInMain() ) { uint32_t nConf = currBlk - txRefOfOutput_.getBlockHeight() + 1; if(isFromCoinbase_ && nConf<=COINBASE_MATURITY) return false; else return true; } if( hasTxOutZC() && isTxOutFromSelf() ) return !ignoreAllZeroConf; return false; } ////////////////////////////////////////////////////////////////////////////// bool TxIOPair::isMineButUnconfirmed(uint32_t currBlk, bool inclAllZC) { // All TxOuts that were from our own transactions are always confirmed if(isTxOutFromSelf()) return false; if( (hasTxIn() && txRefOfInput_.isMainBranch()) || hasTxInZC() ) return false; if(hasTxOutInMain()) { uint32_t nConf = currBlk - txRefOfOutput_.getBlockHeight() + 1; if(isFromCoinbase_) return (nConfisInitialized()); } bool TxIOPair::hasTxInZC(void) const { return (txOfInputZC_!=NULL && txOfInputZC_->isInitialized()); } void TxIOPair::clearZCFields(void) { txOfOutputZC_ = NULL; txOfInputZC_ = NULL; indexOfOutputZC_ = 0; indexOfInputZC_ = 0; //isTxOutFromSelf_ = false; } void TxIOPair::pprintOneLine(void) { printf(" Val:(%0.3f)\t (STS, O,I, Omb,Imb, Oz,Iz) %d %d%d %d%d %d%d\n", (double)getValue()/1e8, (isTxOutFromSelf() ? 1 : 0), (hasTxOut() ? 1 : 0), (hasTxIn() ? 1 : 0), (hasTxOutInMain() ? 1 : 0), (hasTxInInMain() ? 1 : 0), (hasTxOutZC() ? 1 : 0), (hasTxInZC() ? 1 : 0)); } //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // // UnspentTxOut Methods // //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// UnspentTxOut::UnspentTxOut(void) : txHash_(BtcUtils::EmptyHash_), txOutIndex_(0), txHeight_(0), value_(0), script_(BinaryData(0)), numConfirm_(0), isMultisigRef_(false) { // Nothing to do here } //////////////////////////////////////////////////////////////////////////////// void UnspentTxOut::init(TxOut & txout, uint32_t blkNum, bool isMulti) { txHash_ = txout.getParentHash(); txOutIndex_ = txout.getIndex(); txHeight_ = txout.getParentHeight(); value_ = txout.getValue(); script_ = txout.getScript(); updateNumConfirm(blkNum); isMultisigRef_ = isMulti; } //////////////////////////////////////////////////////////////////////////////// BinaryData UnspentTxOut::getRecipientScrAddr(void) const { return BtcUtils::getTxOutScrAddr(getScript()); } //////////////////////////////////////////////////////////////////////////////// uint32_t UnspentTxOut::updateNumConfirm(uint32_t currBlkNum) { if(txHeight_ == UINT32_MAX) numConfirm_ = 0; else numConfirm_ = currBlkNum - txHeight_ + 1; return numConfirm_; } //////////////////////////////////////////////////////////////////////////////// bool UnspentTxOut::CompareNaive(UnspentTxOut const & uto1, UnspentTxOut const & uto2) { float val1 = (float)uto1.getValue(); float val2 = (float)uto2.getValue(); return (val1*uto1.numConfirm_ < val2*uto2.numConfirm_); } //////////////////////////////////////////////////////////////////////////////// bool UnspentTxOut::CompareTech1(UnspentTxOut const & uto1, UnspentTxOut const & uto2) { float val1 = pow((float)uto1.getValue(), 1.0f/3.0f); float val2 = pow((float)uto2.getValue(), 1.0f/3.0f); return (val1*uto1.numConfirm_ < val2*uto2.numConfirm_); } //////////////////////////////////////////////////////////////////////////////// bool UnspentTxOut::CompareTech2(UnspentTxOut const & uto1, UnspentTxOut const & uto2) { float val1 = pow(log10((float)uto1.getValue()) + 5, 5); float val2 = pow(log10((float)uto2.getValue()) + 5, 5); return (val1*uto1.numConfirm_ < val2*uto2.numConfirm_); } //////////////////////////////////////////////////////////////////////////////// bool UnspentTxOut::CompareTech3(UnspentTxOut const & uto1, UnspentTxOut const & uto2) { float val1 = pow(log10((float)uto1.getValue()) + 5, 4); float val2 = pow(log10((float)uto2.getValue()) + 5, 4); return (val1*uto1.numConfirm_ < val2*uto2.numConfirm_); } //////////////////////////////////////////////////////////////////////////////// void UnspentTxOut::sortTxOutVect(vector & utovect, int sortType) { switch(sortType) { case 0: sort(utovect.begin(), utovect.end(), CompareNaive); break; case 1: sort(utovect.begin(), utovect.end(), CompareTech1); break; case 2: sort(utovect.begin(), utovect.end(), CompareTech2); break; case 3: sort(utovect.begin(), utovect.end(), CompareTech3); break; default: break; // do nothing } } //////////////////////////////////////////////////////////////////////////////// void UnspentTxOut::pprintOneLine(uint32_t currBlk) { updateNumConfirm(currBlk); printf(" Tx:%s:%02d BTC:%0.3f nConf:%04d\n", txHash_.copySwapEndian().getSliceCopy(0,8).toHexStr().c_str(), txOutIndex_, value_/1e8, numConfirm_); } //////////////////////////////////////////////////////////////////////////////// /* RegisteredScrAddr::RegisteredScrAddr(BtcAddress const & addrObj, int32_t blkCreated) { uniqueKey_ = addrObj.getAddrStr20(); addrType_ = 0x00; if(blkCreated<0) blkCreated = addrObj.getFirstBlockNum(); blkCreated_ = blkCreated; alreadyScannedUpToBlk_ = blkCreated; } */ // kate: indent-width 3; replace-tabs on; armory-0.92.3/cppForSwig/EncryptionUtils.cpp0000644000000000000000000010722612414772654017602 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// #include "EncryptionUtils.h" #include "log.h" #include "integer.h" #include "oids.h" //#include //#include //#include #define CRYPTO_DEBUG false ///////////////////////////////////////////////////////////////////////////// // We have to explicitly re-define some of these methods... SecureBinaryData & SecureBinaryData::append(SecureBinaryData & sbd2) { if(sbd2.getSize()==0) return (*this); if(getSize()==0) BinaryData::copyFrom(sbd2.getPtr(), sbd2.getSize()); else BinaryData::append(sbd2.getRawRef()); lockData(); return (*this); } ///////////////////////////////////////////////////////////////////////////// SecureBinaryData SecureBinaryData::operator+(SecureBinaryData & sbd2) const { SecureBinaryData out(getSize() + sbd2.getSize()); memcpy(out.getPtr(), getPtr(), getSize()); memcpy(out.getPtr()+getSize(), sbd2.getPtr(), sbd2.getSize()); out.lockData(); return out; } ///////////////////////////////////////////////////////////////////////////// SecureBinaryData & SecureBinaryData::operator=(SecureBinaryData const & sbd2) { copyFrom(sbd2.getPtr(), sbd2.getSize() ); lockData(); return (*this); } ///////////////////////////////////////////////////////////////////////////// bool SecureBinaryData::operator==(SecureBinaryData const & sbd2) const { if(getSize() != sbd2.getSize()) return false; for(unsigned int i=0; i 0) prng.IncorporateEntropy( (byte*)entropy.getPtr(), entropy.getSize()); SecureBinaryData randData(numBytes); prng.GenerateBlock(randData.getPtr(), numBytes); return randData; } ///////////////////////////////////////////////////////////////////////////// KdfRomix::KdfRomix(void) : hashFunctionName_( "sha512" ), hashOutputBytes_( 64 ), kdfOutputBytes_( 32 ), memoryReqtBytes_( 32 ), numIterations_( 0 ) { // Nothing to do here } ///////////////////////////////////////////////////////////////////////////// KdfRomix::KdfRomix(uint32_t memReqts, uint32_t numIter, SecureBinaryData salt) : hashFunctionName_( "sha512" ), hashOutputBytes_( 64 ), kdfOutputBytes_( 32 ) { usePrecomputedKdfParams(memReqts, numIter, salt); } ///////////////////////////////////////////////////////////////////////////// void KdfRomix::computeKdfParams(double targetComputeSec, uint32_t maxMemReqts) { // Create a random salt, even though this is probably unnecessary: // the variation in numIter and memReqts is probably effective enough salt_ = SecureBinaryData().GenerateRandom(32); // If target compute is 0s, then this method really only generates // a random salt, and sets the other params to default minimum. if(targetComputeSec == 0) { numIterations_ = 1; memoryReqtBytes_ = 1024; return; } // Here, we pick the largest memory reqt that allows the executing system // to compute the KDF is less than the target time. A maximum can be // specified, in case the target system is likely to be memory-limited // more than compute-speed limited SecureBinaryData testKey("This is an example key to test KDF iteration speed"); // Start the search for a memory value at 1kB memoryReqtBytes_ = 1024; double approxSec = 0; while(approxSec <= targetComputeSec/4 && memoryReqtBytes_ < maxMemReqts) { memoryReqtBytes_ *= 2; sequenceCount_ = memoryReqtBytes_ / hashOutputBytes_; lookupTable_.resize(memoryReqtBytes_); TIMER_RESTART("KDF_Mem_Search"); testKey = DeriveKey_OneIter(testKey); TIMER_STOP("KDF_Mem_Search"); approxSec = TIMER_READ_SEC("KDF_Mem_Search"); } // Recompute here, in case we didn't enter the search above sequenceCount_ = memoryReqtBytes_ / hashOutputBytes_; lookupTable_.resize(memoryReqtBytes_); // Depending on the search above (or if a low max memory was chosen, // we may need to do multiple iterations to achieve the desired compute // time on this system. double allItersSec = 0; uint32_t numTest = 1; while(allItersSec < 0.02) { numTest *= 2; TIMER_RESTART("KDF_Time_Search"); for(uint32_t i=0; i consecutive hashes of the passphrase // Every iteration is stored in the next 64-bytes in the Lookup table for(uint32_t nByte=0; nByte V64ptr = (uint64_t*)(frontOfLUT + HSZ*newIndex); // xor X with V, and store the result in X for(uint32_t i=0; i::Encryption aes_enc( (byte*)key.getPtr(), key.getSize(), (byte*)iv.getPtr()); aes_enc.ProcessData( (byte*)encrData.getPtr(), (byte*)data.getPtr(), data.getSize()); return encrData; } ///////////////////////////////////////////////////////////////////////////// // Implement AES decryption using AES mode, CFB SecureBinaryData CryptoAES::DecryptCFB(SecureBinaryData & data, SecureBinaryData & key, SecureBinaryData iv ) { if(CRYPTO_DEBUG) { cout << "AES Decrypt" << endl; cout << " BinData: " << data.toHexStr() << endl; cout << " BinKey : " << key.toHexStr() << endl; cout << " BinIV : " << iv.toHexStr() << endl; } if(data.getSize() == 0) return SecureBinaryData(0); SecureBinaryData unencrData(data.getSize()); BTC_CFB_MODE::Decryption aes_enc( (byte*)key.getPtr(), key.getSize(), (byte*)iv.getPtr()); aes_enc.ProcessData( (byte*)unencrData.getPtr(), (byte*)data.getPtr(), data.getSize()); return unencrData; } ///////////////////////////////////////////////////////////////////////////// // Same as above, but only changing the AES mode of operation (CBC, not CFB) SecureBinaryData CryptoAES::EncryptCBC(SecureBinaryData & data, SecureBinaryData & key, SecureBinaryData & iv) { if(CRYPTO_DEBUG) { cout << "AES Decrypt" << endl; cout << " BinData: " << data.toHexStr() << endl; cout << " BinKey : " << key.toHexStr() << endl; cout << " BinIV : " << iv.toHexStr() << endl; } if(data.getSize() == 0) return SecureBinaryData(0); SecureBinaryData encrData(data.getSize()); // Caller can supply their own IV/entropy, or let it be generated here // (variable "iv" is a reference, so check it on the way out) if(iv.getSize() == 0) iv = SecureBinaryData().GenerateRandom(BTC_AES::BLOCKSIZE); BTC_CBC_MODE::Encryption aes_enc( (byte*)key.getPtr(), key.getSize(), (byte*)iv.getPtr()); aes_enc.ProcessData( (byte*)encrData.getPtr(), (byte*)data.getPtr(), data.getSize()); return encrData; } ///////////////////////////////////////////////////////////////////////////// // Same as above, but only changing the AES mode of operation (CBC, not CFB) SecureBinaryData CryptoAES::DecryptCBC(SecureBinaryData & data, SecureBinaryData & key, SecureBinaryData iv ) { if(CRYPTO_DEBUG) { cout << "AES Decrypt" << endl; cout << " BinData: " << data.toHexStr() << endl; cout << " BinKey : " << key.toHexStr() << endl; cout << " BinIV : " << iv.toHexStr() << endl; } if(data.getSize() == 0) return SecureBinaryData(0); SecureBinaryData unencrData(data.getSize()); BTC_CBC_MODE::Decryption aes_enc( (byte*)key.getPtr(), key.getSize(), (byte*)iv.getPtr()); aes_enc.ProcessData( (byte*)unencrData.getPtr(), (byte*)data.getPtr(), data.getSize()); return unencrData; } ///////////////////////////////////////////////////////////////////////////// BTC_PRIVKEY CryptoECDSA::CreateNewPrivateKey(SecureBinaryData entropy) { return ParsePrivateKey(SecureBinaryData().GenerateRandom(32, entropy)); } ///////////////////////////////////////////////////////////////////////////// BTC_PRIVKEY CryptoECDSA::ParsePrivateKey(SecureBinaryData const & privKeyData) { BTC_PRIVKEY cppPrivKey; CryptoPP::Integer privateExp; privateExp.Decode(privKeyData.getPtr(), privKeyData.getSize(), UNSIGNED); cppPrivKey.Initialize(CryptoPP::ASN1::secp256k1(), privateExp); return cppPrivKey; } ///////////////////////////////////////////////////////////////////////////// BTC_PUBKEY CryptoECDSA::ParsePublicKey(SecureBinaryData const & pubKey65B) { SecureBinaryData pubXbin(pubKey65B.getSliceRef( 1,32)); SecureBinaryData pubYbin(pubKey65B.getSliceRef(33,32)); return ParsePublicKey(pubXbin, pubYbin); } ///////////////////////////////////////////////////////////////////////////// BTC_PUBKEY CryptoECDSA::ParsePublicKey(SecureBinaryData const & pubKeyX32B, SecureBinaryData const & pubKeyY32B) { BTC_PUBKEY cppPubKey; CryptoPP::Integer pubX; CryptoPP::Integer pubY; pubX.Decode(pubKeyX32B.getPtr(), pubKeyX32B.getSize(), UNSIGNED); pubY.Decode(pubKeyY32B.getPtr(), pubKeyY32B.getSize(), UNSIGNED); BTC_ECPOINT publicPoint(pubX, pubY); // Initialize the public key with the ECP point just created cppPubKey.Initialize(CryptoPP::ASN1::secp256k1(), publicPoint); // Validate the public key -- not sure why this needs a PRNG BTC_PRNG prng; assert(cppPubKey.Validate(prng, 3)); return cppPubKey; } ///////////////////////////////////////////////////////////////////////////// SecureBinaryData CryptoECDSA::SerializePrivateKey(BTC_PRIVKEY const & privKey) { CryptoPP::Integer privateExp = privKey.GetPrivateExponent(); SecureBinaryData privKeyData(32); privateExp.Encode(privKeyData.getPtr(), privKeyData.getSize(), UNSIGNED); return privKeyData; } ///////////////////////////////////////////////////////////////////////////// SecureBinaryData CryptoECDSA::SerializePublicKey(BTC_PUBKEY const & pubKey) { BTC_ECPOINT publicPoint = pubKey.GetPublicElement(); CryptoPP::Integer pubX = publicPoint.x; CryptoPP::Integer pubY = publicPoint.y; SecureBinaryData pubData(65); pubData.fill(0x04); // we fill just to set the first byte... pubX.Encode(pubData.getPtr()+1, 32, UNSIGNED); pubY.Encode(pubData.getPtr()+33, 32, UNSIGNED); return pubData; } ///////////////////////////////////////////////////////////////////////////// SecureBinaryData CryptoECDSA::ComputePublicKey(SecureBinaryData const & cppPrivKey) { BTC_PRIVKEY pk = ParsePrivateKey(cppPrivKey); BTC_PUBKEY pub; pk.MakePublicKey(pub); return SerializePublicKey(pub); } ///////////////////////////////////////////////////////////////////////////// BTC_PUBKEY CryptoECDSA::ComputePublicKey(BTC_PRIVKEY const & cppPrivKey) { BTC_PUBKEY cppPubKey; cppPrivKey.MakePublicKey(cppPubKey); // Validate the public key -- not sure why this needs a prng... BTC_PRNG prng; assert(cppPubKey.Validate(prng, 3)); assert(cppPubKey.Validate(prng, 3)); return cppPubKey; } //////////////////////////////////////////////////////////////////////////////// SecureBinaryData CryptoECDSA::GenerateNewPrivateKey(SecureBinaryData entropy) { return SecureBinaryData().GenerateRandom(32, entropy); } //////////////////////////////////////////////////////////////////////////////// bool CryptoECDSA::CheckPubPrivKeyMatch(BTC_PRIVKEY const & cppPrivKey, BTC_PUBKEY const & cppPubKey) { BTC_PUBKEY computedPubKey; cppPrivKey.MakePublicKey(computedPubKey); BTC_ECPOINT ppA = cppPubKey.GetPublicElement(); BTC_ECPOINT ppB = computedPubKey.GetPublicElement(); return (ppA.x==ppB.x && ppA.y==ppB.y); } ///////////////////////////////////////////////////////////////////////////// bool CryptoECDSA::CheckPubPrivKeyMatch(SecureBinaryData const & privKey32, SecureBinaryData const & pubKey65) { if(CRYPTO_DEBUG) { cout << "CheckPubPrivKeyMatch:" << endl; cout << " BinPrv: " << privKey32.toHexStr() << endl; cout << " BinPub: " << pubKey65.toHexStr() << endl; } BTC_PRIVKEY privKey = ParsePrivateKey(privKey32); BTC_PUBKEY pubKey = ParsePublicKey(pubKey65); return CheckPubPrivKeyMatch(privKey, pubKey); } bool CryptoECDSA::VerifyPublicKeyValid(SecureBinaryData const & pubKey) { if(CRYPTO_DEBUG) { cout << "BinPub: " << pubKey.toHexStr() << endl; } SecureBinaryData keyToCheck(65); // To support compressed keys, we'll just check to see if a key is compressed // and then decompress it. if(pubKey.getSize() == 33) { keyToCheck = UncompressPoint(pubKey); } else { keyToCheck = pubKey; } // Basically just copying the ParsePublicKey method, but without // the assert that would throw an error from C++ SecureBinaryData pubXbin(keyToCheck.getSliceRef( 1,32)); SecureBinaryData pubYbin(keyToCheck.getSliceRef(33,32)); CryptoPP::Integer pubX; CryptoPP::Integer pubY; pubX.Decode(pubXbin.getPtr(), pubXbin.getSize(), UNSIGNED); pubY.Decode(pubYbin.getPtr(), pubYbin.getSize(), UNSIGNED); BTC_ECPOINT publicPoint(pubX, pubY); // Initialize the public key with the ECP point just created BTC_PUBKEY cppPubKey; cppPubKey.Initialize(CryptoPP::ASN1::secp256k1(), publicPoint); // Validate the public key -- not sure why this needs a PRNG BTC_PRNG prng; return cppPubKey.Validate(prng, 3); } ///////////////////////////////////////////////////////////////////////////// SecureBinaryData CryptoECDSA::SignData(SecureBinaryData const & binToSign, SecureBinaryData const & binPrivKey) { if(CRYPTO_DEBUG) { cout << "SignData:" << endl; cout << " BinSgn: " << binToSign.getSize() << " " << binToSign.toHexStr() << endl; cout << " BinPrv: " << binPrivKey.getSize() << " " << binPrivKey.toHexStr() << endl; } BTC_PRIVKEY cppPrivKey = ParsePrivateKey(binPrivKey); return SignData(binToSign, cppPrivKey); } ///////////////////////////////////////////////////////////////////////////// SecureBinaryData CryptoECDSA::SignData(SecureBinaryData const & binToSign, BTC_PRIVKEY const & cppPrivKey) { // We trick the Crypto++ ECDSA module by passing it a single-hashed // message, it will do the second hash before it signs it. This is // exactly what we need. CryptoPP::SHA256 sha256; BTC_PRNG prng; // Execute the first sha256 op -- the signer will do the other one SecureBinaryData hashVal(32); sha256.CalculateDigest(hashVal.getPtr(), binToSign.getPtr(), binToSign.getSize()); string signature; BTC_SIGNER signer(cppPrivKey); CryptoPP::StringSource( hashVal.toBinStr(), true, new CryptoPP::SignerFilter( prng, signer, new CryptoPP::StringSink(signature))); return SecureBinaryData(signature); } ///////////////////////////////////////////////////////////////////////////// bool CryptoECDSA::VerifyData(SecureBinaryData const & binMessage, SecureBinaryData const & binSignature, SecureBinaryData const & pubkey65B) { if(CRYPTO_DEBUG) { cout << "VerifyData:" << endl; cout << " BinMsg: " << binMessage.toHexStr() << endl; cout << " BinSig: " << binSignature.toHexStr() << endl; cout << " BinPub: " << pubkey65B.toHexStr() << endl; } BTC_PUBKEY cppPubKey = ParsePublicKey(pubkey65B); return VerifyData(binMessage, binSignature, cppPubKey); } ///////////////////////////////////////////////////////////////////////////// bool CryptoECDSA::VerifyData(SecureBinaryData const & binMessage, SecureBinaryData const & binSignature, BTC_PUBKEY const & cppPubKey) { CryptoPP::SHA256 sha256; BTC_PRNG prng; assert(cppPubKey.Validate(prng, 3)); // We execute the first SHA256 op, here. Next one is done by Verifier SecureBinaryData hashVal(32); sha256.CalculateDigest(hashVal.getPtr(), binMessage.getPtr(), binMessage.getSize()); // Verifying message BTC_VERIFIER verifier(cppPubKey); return verifier.VerifyMessage((const byte*)hashVal.getPtr(), hashVal.getSize(), (const byte*)binSignature.getPtr(), binSignature.getSize()); } ///////////////////////////////////////////////////////////////////////////// // Deterministically generate new private key using a chaincode // Changed: added using the hash of the public key to the mix // b/c multiplying by the chaincode alone is too "linear" // (there's no reason to believe it's insecure, but it doesn't // hurt to add some extra entropy/non-linearity to the chain // generation process) SecureBinaryData CryptoECDSA::ComputeChainedPrivateKey( SecureBinaryData const & binPrivKey, SecureBinaryData const & chainCode, SecureBinaryData binPubKey, SecureBinaryData* multiplierOut) { if(CRYPTO_DEBUG) { cout << "ComputeChainedPrivateKey:" << endl; cout << " BinPrv: " << binPrivKey.toHexStr() << endl; cout << " BinChn: " << chainCode.toHexStr() << endl; cout << " BinPub: " << binPubKey.toHexStr() << endl; } if( binPubKey.getSize()==0 ) binPubKey = ComputePublicKey(binPrivKey); if( binPrivKey.getSize() != 32 || chainCode.getSize() != 32) { LOGERR << "***ERROR: Invalid private key or chaincode (both must be 32B)"; LOGERR << "BinPrivKey: " << binPrivKey.getSize(); LOGERR << "BinPrivKey: (not logged for security)"; //LOGERR << "BinPrivKey: " << binPrivKey.toHexStr(); LOGERR << "BinChain : " << chainCode.getSize(); LOGERR << "BinChain : " << chainCode.toHexStr(); } // Adding extra entropy to chaincode by xor'ing with hash256 of pubkey BinaryData chainMod = binPubKey.getHash256(); BinaryData chainOrig = chainCode.getRawCopy(); BinaryData chainXor(32); for(uint8_t i=0; i<8; i++) { uint8_t offset = 4*i; *(uint32_t*)(chainXor.getPtr()+offset) = *(uint32_t*)( chainMod.getPtr()+offset) ^ *(uint32_t*)(chainOrig.getPtr()+offset); } // Hard-code the order of the group static SecureBinaryData SECP256K1_ORDER_BE = SecureBinaryData().CreateFromHex( "fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"); CryptoPP::Integer mult, origPrivExp, ecOrder; // A mult.Decode(chainXor.getPtr(), chainXor.getSize(), UNSIGNED); // B origPrivExp.Decode(binPrivKey.getPtr(), binPrivKey.getSize(), UNSIGNED); // C ecOrder.Decode(SECP256K1_ORDER_BE.getPtr(), SECP256K1_ORDER_BE.getSize(), UNSIGNED); // A*B mod C will get us a new private key exponent CryptoPP::Integer newPrivExponent = a_times_b_mod_c(mult, origPrivExp, ecOrder); // Convert new private exponent to big-endian binary string SecureBinaryData newPrivData(32); newPrivExponent.Encode(newPrivData.getPtr(), newPrivData.getSize(), UNSIGNED); if(multiplierOut != NULL) (*multiplierOut) = SecureBinaryData(chainXor); //LOGINFO << "Computed new chained private key using:"; //LOGINFO << " Public key: " << binPubKey.toHexStr().c_str(); //LOGINFO << " PubKeyHash: " << chainMod.toHexStr().c_str(); //LOGINFO << " Chaincode: " << chainOrig.toHexStr().c_str(); //LOGINFO << " Multiplier: " << chainXor.toHexStr().c_str(); return newPrivData; } ///////////////////////////////////////////////////////////////////////////// // Deterministically generate new public key using a chaincode SecureBinaryData CryptoECDSA::ComputeChainedPublicKey( SecureBinaryData const & binPubKey, SecureBinaryData const & chainCode, SecureBinaryData* multiplierOut) { if(CRYPTO_DEBUG) { cout << "ComputeChainedPUBLICKey:" << endl; cout << " BinPub: " << binPubKey.toHexStr() << endl; cout << " BinChn: " << chainCode.toHexStr() << endl; } static SecureBinaryData SECP256K1_ORDER_BE = SecureBinaryData::CreateFromHex( "fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"); // Added extra entropy to chaincode by xor'ing with hash256 of pubkey BinaryData chainMod = binPubKey.getHash256(); BinaryData chainOrig = chainCode.getRawCopy(); BinaryData chainXor(32); for(uint8_t i=0; i<8; i++) { uint8_t offset = 4*i; *(uint32_t*)(chainXor.getPtr()+offset) = *(uint32_t*)( chainMod.getPtr()+offset) ^ *(uint32_t*)(chainOrig.getPtr()+offset); } // Parse the chaincode as a big-endian integer CryptoPP::Integer mult; mult.Decode(chainXor.getPtr(), chainXor.getSize(), UNSIGNED); // "new" init as "old", to make sure it's initialized on the correct curve BTC_PUBKEY oldPubKey = ParsePublicKey(binPubKey); BTC_PUBKEY newPubKey = ParsePublicKey(binPubKey); // Let Crypto++ do the EC math for us, serialize the new public key newPubKey.SetPublicElement( oldPubKey.ExponentiatePublicElement(mult) ); if(multiplierOut != NULL) (*multiplierOut) = SecureBinaryData(chainXor); //LOGINFO << "Computed new chained public key using:"; //LOGINFO << " Public key: " << binPubKey.toHexStr().c_str(); //LOGINFO << " PubKeyHash: " << chainMod.toHexStr().c_str(); //LOGINFO << " Chaincode: " << chainOrig.toHexStr().c_str(); //LOGINFO << " Multiplier: " << chainXor.toHexStr().c_str(); return CryptoECDSA::SerializePublicKey(newPubKey); } //////////////////////////////////////////////////////////////////////////////// SecureBinaryData CryptoECDSA::InvMod(const SecureBinaryData& m) { static BinaryData N = BinaryData::CreateFromHex( "fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"); CryptoPP::Integer cppM; CryptoPP::Integer cppModulo; cppM.Decode(m.getPtr(), m.getSize(), UNSIGNED); cppModulo.Decode(N.getPtr(), N.getSize(), UNSIGNED); CryptoPP::Integer cppResult = cppM.InverseMod(cppModulo); SecureBinaryData result(32); cppResult.Encode(result.getPtr(), result.getSize(), UNSIGNED); return result; } //////////////////////////////////////////////////////////////////////////////// bool CryptoECDSA::ECVerifyPoint(BinaryData const & x, BinaryData const & y) { BTC_PUBKEY cppPubKey; CryptoPP::Integer pubX; CryptoPP::Integer pubY; pubX.Decode(x.getPtr(), x.getSize(), UNSIGNED); pubY.Decode(y.getPtr(), y.getSize(), UNSIGNED); BTC_ECPOINT publicPoint(pubX, pubY); // Initialize the public key with the ECP point just created cppPubKey.Initialize(CryptoPP::ASN1::secp256k1(), publicPoint); // Validate the public key -- not sure why this needs a PRNG BTC_PRNG prng; return cppPubKey.Validate(prng, 3); } //////////////////////////////////////////////////////////////////////////////// CryptoPP::ECP CryptoECDSA::Get_secp256k1_ECP(void) { static bool firstRun = true; static CryptoPP::Integer intN; static CryptoPP::Integer inta; static CryptoPP::Integer intb; static BinaryData N; static BinaryData a; static BinaryData b; if(firstRun) { firstRun = false; N = BinaryData::CreateFromHex( "fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"); a = BinaryData::CreateFromHex( "0000000000000000000000000000000000000000000000000000000000000000"); b = BinaryData::CreateFromHex( "0000000000000000000000000000000000000000000000000000000000000007"); intN.Decode( N.getPtr(), N.getSize(), UNSIGNED); inta.Decode( a.getPtr(), a.getSize(), UNSIGNED); intb.Decode( b.getPtr(), b.getSize(), UNSIGNED); } return CryptoPP::ECP(intN, inta, intb); } //////////////////////////////////////////////////////////////////////////////// BinaryData CryptoECDSA::ECMultiplyScalars(BinaryData const & A, BinaryData const & B) { // Hardcode the order of the secp256k1 EC group static BinaryData N = BinaryData::CreateFromHex( "fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"); CryptoPP::Integer intA, intB, intC, intN; intA.Decode(A.getPtr(), A.getSize(), UNSIGNED); intB.Decode(B.getPtr(), B.getSize(), UNSIGNED); intN.Decode(N.getPtr(), N.getSize(), UNSIGNED); intC = a_times_b_mod_c(intA, intB, intN); BinaryData C(32); intC.Encode(C.getPtr(), 32, UNSIGNED); return C; } //////////////////////////////////////////////////////////////////////////////// BinaryData CryptoECDSA::ECMultiplyPoint(BinaryData const & A, BinaryData const & Bx, BinaryData const & By) { CryptoPP::ECP ecp = Get_secp256k1_ECP(); CryptoPP::Integer intA, intBx, intBy, intCx, intCy; intA.Decode( A.getPtr(), A.getSize(), UNSIGNED); intBx.Decode(Bx.getPtr(), Bx.getSize(), UNSIGNED); intBy.Decode(By.getPtr(), By.getSize(), UNSIGNED); BTC_ECPOINT B(intBx, intBy); BTC_ECPOINT C = ecp.ScalarMultiply(B, intA); BinaryData Cbd(64); C.x.Encode(Cbd.getPtr(), 32, UNSIGNED); C.y.Encode(Cbd.getPtr()+32, 32, UNSIGNED); return Cbd; } //////////////////////////////////////////////////////////////////////////////// BinaryData CryptoECDSA::ECAddPoints(BinaryData const & Ax, BinaryData const & Ay, BinaryData const & Bx, BinaryData const & By) { CryptoPP::ECP ecp = Get_secp256k1_ECP(); CryptoPP::Integer intAx, intAy, intBx, intBy, intCx, intCy; intAx.Decode(Ax.getPtr(), Ax.getSize(), UNSIGNED); intAy.Decode(Ay.getPtr(), Ay.getSize(), UNSIGNED); intBx.Decode(Bx.getPtr(), Bx.getSize(), UNSIGNED); intBy.Decode(By.getPtr(), By.getSize(), UNSIGNED); BTC_ECPOINT A(intAx, intAy); BTC_ECPOINT B(intBx, intBy); BTC_ECPOINT C = ecp.Add(A,B); BinaryData Cbd(64); C.x.Encode(Cbd.getPtr(), 32, UNSIGNED); C.y.Encode(Cbd.getPtr()+32, 32, UNSIGNED); return Cbd; } //////////////////////////////////////////////////////////////////////////////// BinaryData CryptoECDSA::ECInverse(BinaryData const & Ax, BinaryData const & Ay) { CryptoPP::ECP ecp = Get_secp256k1_ECP(); CryptoPP::Integer intAx, intAy, intCx, intCy; intAx.Decode(Ax.getPtr(), Ax.getSize(), UNSIGNED); intAy.Decode(Ay.getPtr(), Ay.getSize(), UNSIGNED); BTC_ECPOINT A(intAx, intAy); BTC_ECPOINT C = ecp.Inverse(A); BinaryData Cbd(64); C.x.Encode(Cbd.getPtr(), 32, UNSIGNED); C.y.Encode(Cbd.getPtr()+32, 32, UNSIGNED); return Cbd; } //////////////////////////////////////////////////////////////////////////////// SecureBinaryData CryptoECDSA::CompressPoint(SecureBinaryData const & pubKey65) { CryptoPP::ECP ecp = Get_secp256k1_ECP(); BTC_ECPOINT ptPub; ecp.DecodePoint(ptPub, (byte*)pubKey65.getPtr(), 65); SecureBinaryData ptCompressed(33); ecp.EncodePoint((byte*)ptCompressed.getPtr(), ptPub, true); return ptCompressed; } //////////////////////////////////////////////////////////////////////////////// SecureBinaryData CryptoECDSA::UncompressPoint(SecureBinaryData const & pubKey33) { CryptoPP::ECP ecp = Get_secp256k1_ECP(); BTC_ECPOINT ptPub; ecp.DecodePoint(ptPub, (byte*)pubKey33.getPtr(), 33); SecureBinaryData ptUncompressed(65); ecp.EncodePoint((byte*)ptUncompressed.getPtr(), ptPub, false); return ptUncompressed; } /* OpenSSL code (untested) static SecureBinaryData sigSpace(1000); static uint32_t sigSize = 0; // Create the key object EC_KEY* pubKey = EC_KEY_new_by_curve_name(NID_secp256k1); uint8_t* pbegin = privKey.getPtr(); d2i_ECPrivateKey(&pubKey, &pbegin, privKey.getSize()); ECDSA_sign(0, binToSign.getPtr(), binToSign.getSize(), sigSpace.getPtr(), &sigSize, pubKey) EC_KEY_free(pubKey); return SecureBinaryData(sigSpace.getPtr(), sigSize); */ armory-0.92.3/cppForSwig/StoredBlockObj.cpp0000644000000000000000000026230512414772654017275 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// #include #include #include #include "StoredBlockObj.h" DB_PRUNE_TYPE GlobalDBUtilities::dbPruneType_ = DB_PRUNE_WHATEVER; ARMORY_DB_TYPE GlobalDBUtilities::armoryDbType_ = ARMORY_DB_WHATEVER; GlobalDBUtilities* GlobalDBUtilities::theOneUtilsObj_ = NULL; ///////////////////////////////////////////////////////////////////////////// BinaryData StoredDBInfo::getDBKey(void) { // Return a key that is guaranteed to be before all other non-empty // DB keys static BinaryData dbinfokey(0); if(dbinfokey.getSize() == 0) { BinaryWriter bw(1); bw.put_uint8_t((uint8_t)DB_PREFIX_DBINFO); dbinfokey = bw.getData(); } return dbinfokey; } ///////////////////////////////////////////////////////////////////////////// void StoredDBInfo::unserializeDBValue(BinaryRefReader & brr) { if(brr.getSizeRemaining() < 44) { magic_.resize(0); topBlkHgt_ = UINT32_MAX; topBlkHash_.resize(0); return; } brr.get_BinaryData(magic_, 4); BitUnpacker bitunpack(brr); topBlkHgt_ = brr.get_uint32_t(); appliedToHgt_ = brr.get_uint32_t(); brr.get_BinaryData(topBlkHash_, 32); armoryVer_ = bitunpack.getBits(4); armoryType_ = (ARMORY_DB_TYPE)bitunpack.getBits(4); pruneType_ = (DB_PRUNE_TYPE) bitunpack.getBits(4); } ///////////////////////////////////////////////////////////////////////////// void StoredDBInfo::serializeDBValue(BinaryWriter & bw ) const { BitPacker bitpack; bitpack.putBits((uint32_t)armoryVer_, 4); bitpack.putBits((uint32_t)armoryType_, 4); bitpack.putBits((uint32_t)pruneType_, 4); bw.put_BinaryData(magic_); bw.put_BitPacker(bitpack); bw.put_uint32_t(topBlkHgt_); // top blk height bw.put_uint32_t(appliedToHgt_); // top blk height bw.put_BinaryData(topBlkHash_); } //////////////////////////////////////////////////////////////////////////////// void StoredDBInfo::unserializeDBValue(BinaryData const & bd) { BinaryRefReader brr(bd); unserializeDBValue(brr); } //////////////////////////////////////////////////////////////////////////////// void StoredDBInfo::unserializeDBValue(BinaryDataRef bdr) { BinaryRefReader brr(bdr); unserializeDBValue(brr); } //////////////////////////////////////////////////////////////////////////////// BinaryData StoredDBInfo::serializeDBValue(void) const { BinaryWriter bw; serializeDBValue(bw); return bw.getData(); } ///////////////////////////////////////////////////////////////////////////// void StoredDBInfo::pprintOneLine(uint32_t indent) { for(uint32_t i=0; i::iterator iter; for(iter = stxMap_.begin(); iter != stxMap_.end(); iter++) iter->second.setKeyData(hgt, dupID, iter->first); } ///////////////////////////////////////////////////////////////////////////// void StoredHeader::setHeightAndDup(uint32_t hgt, uint8_t dupID) { blockHeight_ = hgt; duplicateID_ = dupID; } ///////////////////////////////////////////////////////////////////////////// void StoredHeader::setHeightAndDup(BinaryData hgtx) { blockHeight_ = DBUtils.hgtxToHeight(hgtx); duplicateID_ = DBUtils.hgtxToDupID(hgtx); } ///////////////////////////////////////////////////////////////////////////// bool StoredHeader::haveFullBlock(void) const { if(dataCopy_.getSize() != HEADER_SIZE) return false; for(uint16_t tx=0; tx::const_iterator iter = stxMap_.find(tx); if(ITER_NOT_IN_MAP(iter, stxMap_)) return false; if(!iter->second.haveAllTxOut()) return false; } return true; } ///////////////////////////////////////////////////////////////////////////// BinaryData StoredHeader::getSerializedBlock(void) const { if(!haveFullBlock()) return BinaryData(0); BinaryWriter bw; if(numBytes_>0) bw.reserve(numBytes_+100); // add extra room for header and var_int bw.put_BinaryData(dataCopy_); bw.put_var_int(numTx_); for(uint16_t tx=0; tx::const_iterator iter; for(iter = stxMap_.begin(); iter != stxMap_.end(); iter++) { if(!iter->second.haveAllTxOut()) { LOGERR << "Don't have all TxOut in tx during serialize full block"; return false; } bwTemp.put_BinaryData(iter->second.getSerializedTx()); } bw.put_BinaryData(bwTemp.getDataRef()); return true; } ///////////////////////////////////////////////////////////////////////////// void StoredHeader::addTxToMap(uint16_t txIdx, Tx & tx) { StoredTx storedTx; storedTx.createFromTx(tx); addStoredTxToMap(txIdx, storedTx); } ///////////////////////////////////////////////////////////////////////////// void StoredHeader::addStoredTxToMap(uint16_t txIdx, StoredTx & stx) { if(txIdx >= numTx_) { LOGERR << "TxIdx is greater than numTx of stored header"; return; } stxMap_[txIdx] = stx; } ///////////////////////////////////////////////////////////////////////////// void StoredTx::addTxOutToMap(uint16_t idx, TxOut & txout) { if(idx >= numTxOut_) { LOGERR << "TxOutIdx is greater than numTxOut of stored tx"; return; } StoredTxOut stxo; stxo.unserialize(txout.serialize()); stxoMap_[idx] = stxo; } ///////////////////////////////////////////////////////////////////////////// void StoredTx::addStoredTxOutToMap(uint16_t idx, StoredTxOut & stxo) { if(idx >= numTxOut_) { LOGERR << "TxOutIdx is greater than numTxOut of stored tx"; return; } stxoMap_[idx] = stxo; } ///////////////////////////////////////////////////////////////////////////// BlockHeader StoredHeader::getBlockHeaderCopy(void) const { if(!isInitialized()) return BlockHeader(); BlockHeader bh(dataCopy_); bh.setNumTx(numTx_); bh.setBlockSize(numBytes_); bh.setDuplicateID(duplicateID_); return bh; } ///////////////////////////////////////////////////////////////////////////// BinaryData StoredHeader::getSerializedBlockHeader(void) const { if(!isInitialized()) return BinaryData(0); return dataCopy_; } //////////////////////////////////////////////////////////////////////////////// void StoredHeader::unserializeDBValue(DB_SELECT db, BinaryData const & bd, bool ignoreMerkle) { BinaryRefReader brr(bd); unserializeDBValue(db, brr, ignoreMerkle); } //////////////////////////////////////////////////////////////////////////////// void StoredHeader::unserializeDBValue(DB_SELECT db, BinaryDataRef bdr, bool ignoreMerkle) { BinaryRefReader brr(bdr); unserializeDBValue(db, brr, ignoreMerkle); } //////////////////////////////////////////////////////////////////////////////// BinaryData StoredHeader::serializeDBValue(DB_SELECT db) const { BinaryWriter bw; serializeDBValue(db, bw); return bw.getData(); } ///////////////////////////////////////////////////////////////////////////// void StoredHeader::unserializeDBValue( DB_SELECT db, BinaryRefReader & brr, bool ignoreMerkle) { if(db==HEADERS) { brr.get_BinaryData(dataCopy_, HEADER_SIZE); BinaryData hgtx = brr.get_BinaryData(4); blockHeight_ = DBUtils.hgtxToHeight(hgtx); duplicateID_ = DBUtils.hgtxToDupID(hgtx); BtcUtils::getHash256(dataCopy_, thisHash_); } else if(db==BLKDATA) { // Read the flags byte BitUnpacker bitunpack(brr); unserArmVer_ = bitunpack.getBits(4); unserBlkVer_ = bitunpack.getBits(4); unserDbType_ = (ARMORY_DB_TYPE) bitunpack.getBits(4); unserPrType_ = (DB_PRUNE_TYPE) bitunpack.getBits(2); unserMkType_ = (MERKLE_SER_TYPE)bitunpack.getBits(2); blockAppliedToDB_ = bitunpack.getBit(); // Unserialize the raw header into the SBH object brr.get_BinaryData(dataCopy_, HEADER_SIZE); BtcUtils::getHash256(dataCopy_, thisHash_); numTx_ = brr.get_uint32_t(); numBytes_ = brr.get_uint32_t(); if(unserArmVer_ != ARMORY_DB_VERSION) LOGWARN << "Version mismatch in unserialize DB header"; if( !ignoreMerkle ) { uint32_t currPos = brr.getPosition(); uint32_t totalSz = brr.getSize(); if(unserMkType_ == MERKLE_SER_NONE) merkle_.resize(0); else { merkleIsPartial_ = (unserMkType_ == MERKLE_SER_PARTIAL); brr.get_BinaryData(merkle_, totalSz - currPos); } } } } ///////////////////////////////////////////////////////////////////////////// void StoredHeader::serializeDBValue( DB_SELECT db, BinaryWriter & bw) const { if(!isInitialized()) { LOGERR << "Attempted to serialize uninitialized block header"; return; } if(db==HEADERS) { BinaryData hgtx = DBUtils.heightAndDupToHgtx(blockHeight_, duplicateID_); bw.put_BinaryData(dataCopy_); bw.put_BinaryData(hgtx); } else if(db==BLKDATA) { uint32_t version = READ_UINT32_LE(dataCopy_.getPtr()); // TODO: We define merkle serialization types here, but we're not actually // enforcing it in this function. Either merkle_ member contains // the correct form of the merkle data or it doesn't. We should // figure out whether we need to make sure the correct data is // already here when this function starts, or guarantee the data // is in the right form as part of this function. For now I'm // assuming that it's already in the right form, and thus the // determination of PARTIAL vs FULL is irrelevant MERKLE_SER_TYPE mtype; switch(DBUtils.getArmoryDbType()) { // If we store all the tx anyway, don't need any/partial merkle trees case ARMORY_DB_BARE: mtype = MERKLE_SER_NONE; break; case ARMORY_DB_LITE: mtype = MERKLE_SER_PARTIAL; break; case ARMORY_DB_PARTIAL: mtype = MERKLE_SER_FULL; break; case ARMORY_DB_FULL: mtype = MERKLE_SER_NONE; break; case ARMORY_DB_SUPER: mtype = MERKLE_SER_NONE; break; default: LOGERR << "Invalid DB mode in serializeStoredHeaderValue"; } // Override the above mtype if the merkle data is zero-length if(merkle_.getSize()==0) mtype = MERKLE_SER_NONE; // Create the flags byte BitPacker bitpack; bitpack.putBits((uint32_t)ARMORY_DB_VERSION, 4); bitpack.putBits((uint32_t)version, 4); bitpack.putBits((uint32_t)DBUtils.getArmoryDbType(), 4); bitpack.putBits((uint32_t)DBUtils.getDbPruneType(), 2); bitpack.putBits((uint32_t)mtype, 2); bitpack.putBit(blockAppliedToDB_); bw.put_BitPacker(bitpack); bw.put_BinaryData(dataCopy_); bw.put_uint32_t(numTx_); bw.put_uint32_t(numBytes_); if( mtype != MERKLE_SER_NONE ) { bw.put_BinaryData(merkle_); if(merkle_.getSize()==0) LOGERR << "Expected to serialize merkle tree, but empty string"; } } } ///////////////////////////////////////////////////////////////////////////// void StoredHeader::unserializeDBKey(DB_SELECT db, BinaryDataRef key) { if(db==BLKDATA) { BinaryRefReader brr(key); if(key.getSize() == 4) DBUtils.readBlkDataKeyNoPrefix(brr, blockHeight_, duplicateID_); else if(key.getSize() == 5) DBUtils.readBlkDataKey(brr, blockHeight_, duplicateID_); else LOGERR << "Invalid key for StoredHeader"; } else LOGERR << "This method not intended for HEADERS DB"; } ///////////////////////////////////////////////////////////////////////////// void StoredHeader::pprintOneLine(uint32_t indent) { for(uint32_t i=0; i 10000) { cout << " " << endl; return; } for(uint32_t i=0; i offsetsIn, offsetsOut; uint32_t nbytes = BtcUtils::StoredTxCalcLength(brr.getCurrPtr(), fragged, &offsetsIn, &offsetsOut); if(brr.getSizeRemaining() < nbytes) { LOGERR << "Not enough bytes in BRR to unserialize StoredTx"; return; } brr.get_BinaryData(dataCopy_, nbytes); isFragged_ = fragged; numTxOut_ = offsetsOut.size()-1; version_ = READ_UINT32_LE(dataCopy_.getPtr()); lockTime_ = READ_UINT32_LE(dataCopy_.getPtr() + nbytes - 4); if(isFragged_) { fragBytes_ = nbytes; numBytes_ = UINT32_MAX; } else { numBytes_ = nbytes; uint32_t span = offsetsOut[numTxOut_] - offsetsOut[0]; fragBytes_ = numBytes_ - span; BtcUtils::getHash256(dataCopy_, thisHash_); } } //////////////////////////////////////////////////////////////////////////////// void StoredTx::unserializeDBValue(BinaryData const & bd) { BinaryRefReader brr(bd); unserializeDBValue(brr); } //////////////////////////////////////////////////////////////////////////////// void StoredTx::unserializeDBValue(BinaryDataRef bdr) { BinaryRefReader brr(bdr); unserializeDBValue(brr); } //////////////////////////////////////////////////////////////////////////////// BinaryData StoredTx::serializeDBValue(void) const { BinaryWriter bw; serializeDBValue(bw); return bw.getData(); } ///////////////////////////////////////////////////////////////////////////// void StoredTx::unserializeDBValue(BinaryRefReader & brr) { // flags // DBVersion 4 bits // TxVersion 2 bits // HowTxSer 4 bits (FullTxOut, TxNoTxOuts, numTxOutOnly) BitUnpacker bitunpack(brr); // flags unserArmVer_ = bitunpack.getBits(4); unserTxVer_ = bitunpack.getBits(2); unserTxType_ = (TX_SERIALIZE_TYPE)bitunpack.getBits(4); if(unserArmVer_ != ARMORY_DB_VERSION) LOGWARN << "Version mismatch in unserialize DB tx"; brr.get_BinaryData(thisHash_, 32); if(unserTxType_ == TX_SER_FULL || unserTxType_ == TX_SER_FRAGGED) unserialize(brr, unserTxType_==TX_SER_FRAGGED); else numTxOut_ = (uint32_t)brr.get_var_int(); } ///////////////////////////////////////////////////////////////////////////// void StoredTx::serializeDBValue(BinaryWriter & bw) const { TX_SERIALIZE_TYPE serType; switch(DBUtils.getArmoryDbType()) { // In most cases, if storing separate TxOuts, fragged Tx is fine // UPDATE: I'm not sure there's a good reason to NOT frag ever case ARMORY_DB_BARE: serType = TX_SER_FRAGGED; break; case ARMORY_DB_LITE: serType = TX_SER_FRAGGED; break; case ARMORY_DB_PARTIAL: serType = TX_SER_FRAGGED; break; case ARMORY_DB_FULL: serType = TX_SER_FRAGGED; break; case ARMORY_DB_SUPER: serType = TX_SER_FRAGGED; break; default: LOGERR << "Invalid DB mode in serializeStoredTxValue"; } if(serType==TX_SER_FULL && !haveAllTxOut()) { LOGERR << "Supposed to write out full Tx, but don't have it"; return; } if(thisHash_.getSize() == 0) { LOGERR << "Do not know tx hash to be able to DB-serialize StoredTx"; return; } uint16_t version = (uint16_t)READ_UINT32_LE(dataCopy_.getPtr()); BitPacker bitpack; bitpack.putBits((uint16_t)ARMORY_DB_VERSION, 4); bitpack.putBits((uint16_t)version, 2); bitpack.putBits((uint16_t)serType, 4); bw.put_BitPacker(bitpack); bw.put_BinaryData(thisHash_); if(serType == TX_SER_FULL) bw.put_BinaryData(getSerializedTx()); else if(serType == TX_SER_FRAGGED) bw.put_BinaryData(getSerializedTxFragged()); else bw.put_var_int(numTxOut_); } //////////////////////////////////////////////////////////////////////////////// bool StoredTx::haveAllTxOut(void) const { if(!isInitialized()) return false; if(!isFragged_) return true; return stxoMap_.size()==numTxOut_; } //////////////////////////////////////////////////////////////////////////////// BinaryData StoredTx::getSerializedTx(void) const { if(!isInitialized()) return BinaryData(0); if(!isFragged_) return dataCopy_; else if(!haveAllTxOut()) return BinaryData(0); BinaryWriter bw; bw.reserve(numBytes_); if(numBytes_ != UINT32_MAX) bw.reserve(numBytes_); bw.put_BinaryData(dataCopy_.getPtr(), dataCopy_.getSize()-4); map::const_iterator iter; uint16_t i=0; for(iter = stxoMap_.begin(); iter != stxoMap_.end(); iter++, i++) { if(iter->first != i) { LOGERR << "Indices out of order accessing stxoMap_...?!"; return BinaryData(0); } bw.put_BinaryData(iter->second.getSerializedTxOut()); } bw.put_BinaryData(dataCopy_.getPtr()+dataCopy_.getSize()-4, 4); return bw.getData(); } //////////////////////////////////////////////////////////////////////////////// BinaryData StoredTx::getSerializedTxFragged(void) const { if(!isInitialized()) return BinaryData(0); if(isFragged_) return dataCopy_; if(numBytes_ == UINT32_MAX) { LOGERR << "Do not know size of tx in order to serialize it"; return BinaryData(0); } BinaryWriter bw; vector outOffsets; BtcUtils::StoredTxCalcLength(dataCopy_.getPtr(), false, NULL, &outOffsets); uint32_t firstOut = outOffsets[0]; uint32_t afterLast = outOffsets[outOffsets.size()-1]; uint32_t span = afterLast - firstOut; BinaryData output(dataCopy_.getSize() - span); dataCopy_.getSliceRef(0, firstOut).copyTo(output.getPtr()); dataCopy_.getSliceRef(afterLast, 4).copyTo(output.getPtr()+firstOut); return output; } ///////////////////////////////////////////////////////////////////////////// void StoredTx::unserializeDBKey(BinaryDataRef key) { BinaryRefReader brr(key); if(key.getSize() == 6) DBUtils.readBlkDataKeyNoPrefix(brr, blockHeight_, duplicateID_, txIndex_); else if(key.getSize() == 7) DBUtils.readBlkDataKey(brr, blockHeight_, duplicateID_, txIndex_); else LOGERR << "Invalid key for StoredTx"; } //////////////////////////////////////////////////////////////////////////////// void StoredTx::pprintOneLine(uint32_t indent) { for(uint32_t i=0; i 10000) { cout << " " << endl; return; } for(uint32_t i=0; i bitunpack(brr); unserArmVer_ = bitunpack.getBits(4); txVersion_ = bitunpack.getBits(2); spentness_ = (TXOUT_SPENTNESS)bitunpack.getBits(2); isCoinbase_ = bitunpack.getBit(); unserialize(brr); if(spentness_ == TXOUT_SPENT && brr.getSizeRemaining()>=8) spentByTxInKey_ = brr.get_BinaryData(8); } //////////////////////////////////////////////////////////////////////////////// BinaryData StoredTxOut::serializeDBValue(bool forceSaveSpent) const { BinaryWriter bw; serializeDBValue(bw, forceSaveSpent); return bw.getData(); } //////////////////////////////////////////////////////////////////////////////// void StoredTxOut::serializeDBValue(BinaryWriter & bw, bool forceSaveSpentness) const { TXOUT_SPENTNESS writeSpent = spentness_; if(!forceSaveSpentness) { switch(DBUtils.getArmoryDbType()) { //// If the DB is in lite or partial modes, we don't bother recording // spentness (in fact, if it's spent, this entry probably won't even // be written to the DB). case ARMORY_DB_BARE: break; case ARMORY_DB_LITE: writeSpent = TXOUT_SPENTUNK; break; case ARMORY_DB_PARTIAL: writeSpent = TXOUT_SPENTUNK; break; case ARMORY_DB_FULL: break; case ARMORY_DB_SUPER: break; default: LOGERR << "Invalid DB mode in serializeStoredTxOutValue"; } } uint16_t isCbase = (isCoinbase_ ? 1 : 0); BitPacker bitpack; bitpack.putBits((uint16_t)ARMORY_DB_VERSION, 4); bitpack.putBits((uint16_t)txVersion_, 2); bitpack.putBits((uint16_t)writeSpent, 2); bitpack.putBit( isCoinbase_); bw.put_BitPacker(bitpack); bw.put_BinaryData(dataCopy_); // 8-byte value, var_int sz, pkscript if(writeSpent == TXOUT_SPENT) { if(spentByTxInKey_.getSize()==0) LOGERR << "Need to write out spentByTxIn but no spentness data"; bw.put_BinaryData(spentByTxInKey_); } } ///////////////////////////////////////////////////////////////////////////// BinaryData StoredTxOut::getDBKey(bool withPrefix) const { if(blockHeight_ == UINT32_MAX || duplicateID_ == UINT8_MAX || txIndex_ == UINT16_MAX || txOutIndex_ == UINT16_MAX) { LOGERR << "Requesting DB key for incomplete STXO"; return BinaryData(0); } if(withPrefix) return DBUtils.getBlkDataKey( blockHeight_, duplicateID_, txIndex_, txOutIndex_); else return DBUtils.getBlkDataKeyNoPrefix( blockHeight_, duplicateID_, txIndex_, txOutIndex_); } //////////////////////////////////////////////////////////////////////////////// BinaryData StoredTxOut::getDBKeyOfParentTx(bool withPrefix) const { BinaryData stxoKey = getDBKey(withPrefix); if(withPrefix) return stxoKey.getSliceCopy(0, 7); else return stxoKey.getSliceCopy(0, 6); } //////////////////////////////////////////////////////////////////////////////// bool StoredTxOut::matchesDBKey(BinaryDataRef dbkey) const { if(dbkey.getSize() == 8) return (getDBKey(false) == dbkey); else if(dbkey.getSize() == 9) return (getDBKey(true) == dbkey); else { LOGERR << "Non STXO-DBKey passed in to check match against STXO"; return false; } } //////////////////////////////////////////////////////////////////////////////// Tx StoredTx::getTxCopy(void) const { if(!haveAllTxOut()) { LOGERR << "Cannot get tx copy, because don't have full StoredTx!"; return Tx(); } Tx returnTx(getSerializedTx()); if(blockHeight_ != UINT32_MAX) returnTx.setTxRef(TxRef(getDBKey(false))); return returnTx; } //////////////////////////////////////////////////////////////////////////////// void StoredTx::setKeyData(uint32_t height, uint8_t dup, uint16_t txIdx) { blockHeight_ = height; duplicateID_ = dup; txIndex_ = txIdx; map::iterator iter; for(iter = stxoMap_.begin(); iter != stxoMap_.end(); iter++) { iter->second.blockHeight_ = height; iter->second.duplicateID_ = dup; iter->second.txIndex_ = txIdx; iter->second.txOutIndex_ = iter->first; } } //////////////////////////////////////////////////////////////////////////////// StoredTx & StoredTx::createFromTx(BinaryDataRef rawTx, bool doFrag, bool withTxOuts) { Tx tx(rawTx); return createFromTx(tx, doFrag, withTxOuts); } //////////////////////////////////////////////////////////////////////////////// StoredTx & StoredTx::createFromTx(Tx & tx, bool doFrag, bool withTxOuts) { if(!tx.isInitialized()) { LOGERR << "Creating storedtx from uninitialized tx. Aborting."; dataCopy_.resize(0); return *this; } thisHash_ = tx.getThisHash(); numTxOut_ = tx.getNumTxOut(); version_ = tx.getVersion(); lockTime_ = tx.getLockTime(); numBytes_ = tx.getSize(); isFragged_ = doFrag; uint32_t span = tx.getTxOutOffset(numTxOut_) - tx.getTxOutOffset(0); fragBytes_ = numBytes_ - span; if(!doFrag) dataCopy_ = tx.serialize(); else { BinaryRefReader brr(tx.getPtr(), tx.getSize()); uint32_t firstOut = tx.getTxOutOffset(0); uint32_t afterLast = tx.getTxOutOffset(numTxOut_); uint32_t span = afterLast - firstOut; dataCopy_.resize(tx.getSize() - span); brr.get_BinaryData(dataCopy_.getPtr(), firstOut); brr.advance(span); brr.get_BinaryData(dataCopy_.getPtr()+firstOut, 4); } if(withTxOuts) { for(uint32_t txo = 0; txo < tx.getNumTxOut(); txo++) { stxoMap_[txo] = StoredTxOut(); StoredTxOut & stxo = stxoMap_[txo]; stxo.unserialize(tx.getTxOutCopy(txo).serialize()); stxo.txVersion_ = tx.getVersion(); stxo.txIndex_ = tx.getBlockTxIndex(); stxo.txOutIndex_ = txo; stxo.isCoinbase_ = tx.getTxInCopy(0).isCoinbase(); } } return *this; } //////////////////////////////////////////////////////////////////////////////// StoredTxOut & StoredTxOut::createFromTxOut(TxOut & txout) { unserialize(txout.serialize()); return *this; } //////////////////////////////////////////////////////////////////////////////// BinaryData StoredTxOut::getSerializedTxOut(void) const { if(!isInitialized()) { LOGERR << "Attempted to get serialized TxOut, but not initialized"; return BinaryData(0); } return dataCopy_; } //////////////////////////////////////////////////////////////////////////////// TxOut StoredTxOut::getTxOutCopy(void) const { if(!isInitialized()) { LOGERR << "Attempted to get TxOut copy but not initialized"; return TxOut(); } TxOut o; o.unserialize_checked(dataCopy_.getPtr(), dataCopy_.getSize()); return o; } //////////////////////////////////////////////////////////////////////////////// BinaryData StoredTxOut::getScrAddress(void) const { BinaryRefReader brr(dataCopy_); brr.advance(8); uint32_t scrsz = (uint32_t)brr.get_var_int(); return BtcUtils::getTxOutScrAddr(brr.get_BinaryDataRef(scrsz)); } //////////////////////////////////////////////////////////////////////////////// BinaryDataRef StoredTxOut::getScriptRef(void) const { BinaryRefReader brr(dataCopy_); brr.advance(8); uint32_t scrsz = (uint32_t)brr.get_var_int(); return brr.get_BinaryDataRef(scrsz); } //////////////////////////////////////////////////////////////////////////////// uint64_t StoredTxOut::getValue(void) const { if(!isInitialized()) return UINT64_MAX; return *(uint64_t*)dataCopy_.getPtr(); } ///////////////////////////////////////////////////////////////////////////// void StoredTxOut::unserializeDBKey(BinaryDataRef key) { BinaryRefReader brr(key); if(key.getSize() == 8) DBUtils.readBlkDataKeyNoPrefix(brr, blockHeight_, duplicateID_, txIndex_, txOutIndex_); else if(key.getSize() == 9) DBUtils.readBlkDataKey(brr, blockHeight_, duplicateID_, txIndex_, txOutIndex_); else LOGERR << "Invalid key for StoredTxOut"; } //////////////////////////////////////////////////////////////////////////////// void StoredTxOut::pprintOneLine(uint32_t indent) { for(uint32_t i=0; i 0) pprintHash = parentHash_.getSliceCopy(0,4).toHexStr(); cout << "TXOUT: " << " (" << blockHeight_ << "," << (uint32_t)duplicateID_ << "," << txIndex_ << "," << txOutIndex_ << ")" << " Value=" << (double)(getValue())/(100000000.0) << " isCB: " << (isCoinbase_ ? "(X)" : " "); if(spentness_ == TXOUT_SPENTUNK) cout << " Spnt: " << "<-----UNKNOWN---->" << endl; else if(spentness_ == TXOUT_UNSPENT) cout << " Spnt: " << "< >" << endl; else cout << " Spnt: " << "<" << spentByTxInKey_.toHexStr() << ">" << endl; } //////////////////////////////////////////////////////////////////////////////// // The list of spent/unspent txOuts is exactly what is needed to construct // a full vector for each address. Keep in mind that this list // only contains TxOuts and spentness of those TxOuts that are: // (1) Already in the blockchain // (2) On the longest chain at the time is was written // It contains no zero-confirmation tx data, and it may not be accurate // if there was a reorg since it was written. Part of the challenge of // implementing this DB stuff correctly is making sure both conditions // above are adhered to, despite TxIOPair objects being used in RAM to store // zero-confirmation data as well as in-blockchain data. void StoredScriptHistory::unserializeDBValue(BinaryRefReader & brr) { // Now read the stored data fro this registered address DB_PRUNE_TYPE pruneType; SCRIPT_UTXO_TYPE txoListType; BitUnpacker bitunpack(brr); version_ = bitunpack.getBits(4); pruneType = (DB_PRUNE_TYPE) bitunpack.getBits(2); txoListType = (SCRIPT_UTXO_TYPE) bitunpack.getBits(2); useMultipleEntries_ = bitunpack.getBit(); alreadyScannedUpToBlk_ = brr.get_uint32_t(); totalTxioCount_ = brr.get_var_int(); // We shouldn't end up with empty SSH's, but should catch it just in case if(totalTxioCount_==0) return; subHistMap_.clear(); if(useMultipleEntries_) totalUnspent_ = brr.get_uint64_t(); else { // If we are not using multiple entries, then we have a TxIO in this // base SSH entry, and no sub-histories. Otherwise, there's nothing // else to be read from this DB value BitUnpacker bitunpack(brr); bool isFromSelf = bitunpack.getBit(); bool isCoinbase = bitunpack.getBit(); bool isSpent = bitunpack.getBit(); bool isMulti = bitunpack.getBit(); // We always include the 8-byte value uint64_t txoValue = brr.get_uint64_t(); // First 4 bytes is same for all TxIOs, and was copied outside the loop. // So we grab the last four bytes and copy it to the end. BinaryData fullTxOutKey = brr.get_BinaryData(8); TxIOPair txio(fullTxOutKey, txoValue); totalUnspent_ = 0; if(isSpent) txio.setTxIn(brr.get_BinaryDataRef(8)); else { if(!isMulti) totalUnspent_ = txoValue; } txio.setTxOutFromSelf(isFromSelf); txio.setFromCoinbase(isCoinbase); txio.setMultisig(isMulti); // The second "true" is to tell the insert function to skip incrementing // the totalUnspent_ and totalTxioCount_, since that data is already // correct. insertTxio(txio, true, true); } } //////////////////////////////////////////////////////////////////////////////// void StoredScriptHistory::serializeDBValue(BinaryWriter & bw ) const { // Write out all the flags BitPacker bitpack; bitpack.putBits((uint16_t)ARMORY_DB_VERSION, 4); bitpack.putBits((uint16_t)DBUtils.getDbPruneType(),2); bitpack.putBits((uint16_t)SCRIPT_UTXO_VECTOR, 2); bitpack.putBit(useMultipleEntries_); bw.put_BitPacker(bitpack); // bw.put_uint32_t(alreadyScannedUpToBlk_); bw.put_var_int(totalTxioCount_); // We shouldn't end up with empty SSH's, but should catch it just in case if(totalTxioCount_==0) return; // Most addresses have only one TxIO, so we store it in the base SSH // DB entry. If there's more than one, we serialize nothing else, // and stored all the TxIOs in the sub-SSH entries (sub-histories). if(useMultipleEntries_) bw.put_uint64_t(totalUnspent_); else { if(subHistMap_.size() != 1) { LOGERR << "!multi entry but " << subHistMap_.size() << " TxIOs?"; LOGERR << uniqueKey_.toHexStr().c_str(); return; } map::const_iterator iter; iter = subHistMap_.begin(); if(iter->second.txioSet_.size() != 1) { LOGERR << "One subSSH but " << iter->second.txioSet_.size() << " TxIOs?"; return; } // Iter is pointing to the first SubSSH, now get the first/only TxIOPair TxIOPair const & txio = iter->second.txioSet_.begin()->second; BinaryData key8B = txio.getDBKeyOfOutput(); BitPacker bitpack; bitpack.putBit(txio.isTxOutFromSelf()); bitpack.putBit(txio.isFromCoinbase()); bitpack.putBit(txio.hasTxInInMain()); bitpack.putBit(txio.isMultisig()); bw.put_BitPacker(bitpack); // Always write the value and last 4 bytes of dbkey (first 4 is in dbkey) bw.put_uint64_t(txio.getValue()); bw.put_BinaryData(key8B); // If not supposed to write the TxIn, we would've bailed earlier if(txio.hasTxInInMain()) bw.put_BinaryData(txio.getDBKeyOfInput()); } } //////////////////////////////////////////////////////////////////////////////// void StoredScriptHistory::unserializeDBValue(BinaryData const & bd) { BinaryRefReader brr(bd); unserializeDBValue(brr); } //////////////////////////////////////////////////////////////////////////////// void StoredScriptHistory::unserializeDBValue(BinaryDataRef bdr) { BinaryRefReader brr(bdr); unserializeDBValue(brr); } //////////////////////////////////////////////////////////////////////////////// BinaryData StoredScriptHistory::serializeDBValue(void) const { BinaryWriter bw; serializeDBValue(bw); return bw.getData(); } //////////////////////////////////////////////////////////////////////////////// BinaryData StoredScriptHistory::getDBKey(bool withPrefix) const { BinaryWriter bw(1+uniqueKey_.getSize()); if(withPrefix) bw.put_uint8_t((uint8_t)DB_PREFIX_SCRIPT); bw.put_BinaryData(uniqueKey_); return bw.getData(); } //////////////////////////////////////////////////////////////////////////////// SCRIPT_PREFIX StoredScriptHistory::getScriptType(void) const { if(uniqueKey_.getSize() == 0) return SCRIPT_PREFIX_NONSTD; else return (SCRIPT_PREFIX)uniqueKey_[0]; } ///////////////////////////////////////////////////////////////////////////// void StoredScriptHistory::unserializeDBKey(BinaryDataRef key, bool withPrefix) { // Assume prefix if(withPrefix) uniqueKey_ = key.getSliceCopy(1, key.getSize()-1); else uniqueKey_ = key; } //////////////////////////////////////////////////////////////////////////////// void StoredScriptHistory::pprintOneLine(uint32_t indent) { for(uint32_t i=0; i::iterator iter; for(iter = subHistMap_.begin(); iter != subHistMap_.end(); iter++) iter->second.pprintFullSubSSH(indent+3); } //////////////////////////////////////////////////////////////////////////////// TxIOPair* StoredScriptHistory::findTxio(BinaryData const & dbKey8B, bool includeMultisig) { if(!isInitialized() || subHistMap_.size() == 0) return NULL; // Optimize case of 1 txio -- don't bother with extra copies or map.find ops if(totalTxioCount_ == 1) { // We gotta do some simple checks to avoid segfaulting in case // totalTxioCount_ is wrong (which shouldn't ever happen) if(subHistMap_.size() != 1) { LOGERR << "totalTxioCount_ and subHistMap_.size do not agree!"; return NULL; } StoredSubHistory & subSSH = subHistMap_.begin()->second; if(subSSH.txioSet_.size() != 1) { LOGERR << "totalTxioCount_ and subSSH.txioSet_.size() do not agree!"; return NULL; } TxIOPair* outptr = &(subSSH.txioSet_.begin()->second); if(!includeMultisig && outptr->isMultisig()) return NULL; return (outptr->getDBKeyOfOutput() == dbKey8B ? outptr : NULL); } else { // Otherwise, we go searching... BinaryData first4 = dbKey8B.getSliceCopy(0,4); map::iterator iterSubSSH; iterSubSSH = subHistMap_.find(first4); if(ITER_NOT_IN_MAP(iterSubSSH, subHistMap_)) return NULL; // This returns NULL if does not exist. TxIOPair* outptr = iterSubSSH->second.findTxio(dbKey8B); if(outptr==NULL) return NULL; if(!includeMultisig && outptr->isMultisig()) return NULL; return outptr; } } //////////////////////////////////////////////////////////////////////////////// TxIOPair& StoredScriptHistory::insertTxio(TxIOPair const & txio, bool withOverwrite, bool skipTally) { BinaryData dbKey8 = txio.getDBKeyOfOutput(); BinaryData first4 = dbKey8.getSliceCopy(0,4); map::iterator iterSubHist; iterSubHist = subHistMap_.find(first4); if(ITER_NOT_IN_MAP(iterSubHist, subHistMap_)) { // Create a new sub-history add it to its map subHistMap_[first4] = StoredSubHistory(); subHistMap_[first4].uniqueKey_ = uniqueKey_; subHistMap_[first4].hgtX_ = first4; if(!skipTally) { totalTxioCount_ += 1; if(!txio.hasTxInInMain() && !txio.isMultisig()) totalUnspent_ += txio.getValue(); useMultipleEntries_ = (totalTxioCount_>1); } return subHistMap_[first4].insertTxio(txio, withOverwrite); } else { // We have sub-history already, though not sure about this specific Txio if(iterSubHist->second.findTxio(dbKey8) == NULL && !skipTally) { // We don't have it yet, the insert call will add it totalTxioCount_ += 1; if(!txio.hasTxInInMain() && !txio.isMultisig()) totalUnspent_ += txio.getValue(); useMultipleEntries_ = (totalTxioCount_>1); } return iterSubHist->second.insertTxio(txio, withOverwrite); } } //////////////////////////////////////////////////////////////////////////////// // For subtle bugginess reasons, even if we are pruning and reduce the total // TxIO count to one, we will keep "useMultipleEntries_=true". Once true, always // true, regardless of how many TxIO we have. bool StoredScriptHistory::eraseTxio(TxIOPair const & txio) { return eraseTxio(txio.getDBKeyOfOutput()); } //////////////////////////////////////////////////////////////////////////////// bool StoredScriptHistory::eraseTxio(BinaryData const & dbKey8B) { if(!isInitialized()) return false; if(dbKey8B.getSize() != 8) { LOGERR << "Invalid dbKey: " << dbKey8B.toHexStr().c_str(); return false; } BinaryData first4 = dbKey8B.getSliceCopy(0,4); map::iterator iterSubHist; iterSubHist = subHistMap_.find(first4); if(ITER_NOT_IN_MAP(iterSubHist, subHistMap_)) return false; StoredSubHistory & subssh = iterSubHist->second; uint64_t valueRemoved = subssh.eraseTxio(dbKey8B); bool wasRemoved = (valueRemoved!=UINT64_MAX); if(wasRemoved) { totalTxioCount_ -= 1; totalUnspent_ -= valueRemoved; } // Commented out because we need to be able to iterate through and see // which subHistMap_ are empty (later) so they can be removed from the DB. // If we erase it here without recording any kind of tracking data, later // we have no idea what was removed and those dead SubSSH objects are left // in the DB. //if(iterSubHist->second.txioSet_.size() == 0) //subHistMap_.erase(iterSubHist); return wasRemoved; } //////////////////////////////////////////////////////////////////////////////// bool StoredScriptHistory::mergeSubHistory(StoredSubHistory & subssh) { if(uniqueKey_ != subssh.uniqueKey_) { LOGERR << "Attempting to add sub-SSH to incorrect SSH"; return false; } pair keyValPair; keyValPair.first = subssh.hgtX_; keyValPair.second = subssh; pair::iterator, bool> insResult; insResult = subHistMap_.insert(keyValPair); bool alreadyExisted = !insResult.second; if(alreadyExisted) { // If already existed, we need to merge the DB data into the RAM struct StoredSubHistory & subsshAlreadyInRAM = insResult.first->second; StoredSubHistory & subsshTriedToAdd = subssh; LOGINFO << "SubSSH already in SSH...should this happen?"; map::iterator iter; for(iter = subsshTriedToAdd.txioSet_.begin(); iter != subsshTriedToAdd.txioSet_.end(); iter++) { subsshAlreadyInRAM.txioSet_[iter->first] = iter->second; } } return true; } //////////////////////////////////////////////////////////////////////////////// // This adds the TxOut if it doesn't exist yet uint64_t StoredScriptHistory::markTxOutSpent(BinaryData txOutKey8B, BinaryData txInKey8B) { if(!isInitialized()) return UINT64_MAX; if(txOutKey8B.getSize() != 8 || txInKey8B.getSize() != 8) { LOGERR << "Invalid input to mark TxOut spent"; LOGERR << "TxOutKey: '" << txOutKey8B.toHexStr().c_str() << "'"; LOGERR << "TxInKey: '" << txInKey8B.toHexStr().c_str() << "'"; return UINT64_MAX; } BinaryData first4 = txOutKey8B.getSliceCopy(0,4); map::iterator iter; iter = subHistMap_.find(first4); if(ITER_NOT_IN_MAP(iter, subHistMap_)) { LOGWARN << "Trying to mark TxIO spent, but does not exist!"; return UINT64_MAX; } uint64_t val = iter->second.markTxOutSpent(txOutKey8B, txInKey8B); if(val != UINT64_MAX) totalUnspent_ -= val; return val; } //////////////////////////////////////////////////////////////////////////////// uint64_t StoredScriptHistory::markTxOutUnspent(BinaryData txOutKey8B, uint64_t value, bool isCoinbase, bool isMultisig) { if(!isInitialized()) return UINT64_MAX; if(txOutKey8B.getSize() != 8) { LOGERR << "Invalid input to mark TxOut unspent"; LOGERR << "TxOutKey: '" << txOutKey8B.toHexStr().c_str() << "'"; return UINT64_MAX; } BinaryData first4 = txOutKey8B.getSliceCopy(0,4); map::iterator iter; iter = subHistMap_.find(first4); if(ITER_NOT_IN_MAP(iter, subHistMap_)) { // The SubHistory doesn't actually exist yet, so we have to add it if(value == UINT64_MAX) { LOGERR << "Tried to create TxOut in SSH but no value supplied!"; return UINT64_MAX; } pair toInsert(first4, StoredSubHistory()); iter = subHistMap_.insert(toInsert).first; iter->second.uniqueKey_ = uniqueKey_; iter->second.hgtX_ = first4; } // More sanity checking if(ITER_NOT_IN_MAP(iter, subHistMap_)) { LOGERR << "Somehow still don't have the subSSH after trying to insert it"; return UINT64_MAX; } StoredSubHistory & subssh = iter->second; uint32_t prevSize = subssh.txioSet_.size(); uint64_t val = subssh.markTxOutUnspent(txOutKey8B, value, isCoinbase, isMultisig); uint32_t newSize = subssh.txioSet_.size(); // Value returned above is zero if it's multisig, so no need to check here // Also, markTxOutUnspent doesn't indicate whether a new entry was added, // so we use txioSet_.size() to update appropriately. totalUnspent_ += val; totalTxioCount_ += (newSize - prevSize); // should only ever be +=0 or +=1 useMultipleEntries_ = (totalTxioCount_>1); return val; } //////////////////////////////////////////////////////////////////////////////// bool StoredScriptHistory::haveFullHistoryLoaded(void) const { if(!isInitialized()) return false; uint64_t numTxio = 0; map::const_iterator iter; for(iter = subHistMap_.begin(); iter != subHistMap_.end(); iter++) numTxio += iter->second.getTxioCount(); if(numTxio > totalTxioCount_) LOGERR << "Somehow stored total is less than counted total...?"; return (numTxio==totalTxioCount_); } //////////////////////////////////////////////////////////////////////////////// uint64_t StoredScriptHistory::getScriptReceived(bool withMultisig) { if(!haveFullHistoryLoaded()) return UINT64_MAX; uint64_t bal = 0; map::iterator iter; for(iter = subHistMap_.begin(); iter != subHistMap_.end(); iter++) bal += iter->second.getSubHistoryReceived(withMultisig); return bal; } //////////////////////////////////////////////////////////////////////////////// uint64_t StoredScriptHistory::getScriptBalance(bool withMultisig) { // If regular balance, if(!withMultisig) return totalUnspent_; // If with multisig we have to load and count everything if(!haveFullHistoryLoaded()) return UINT64_MAX; uint64_t bal = 0; map::iterator iter; for(iter = subHistMap_.begin(); iter != subHistMap_.end(); iter++) bal += iter->second.getSubHistoryBalance(withMultisig); return bal; } //////////////////////////////////////////////////////////////////////////////// bool StoredScriptHistory::getFullTxioMap( map & mapToFill, bool withMultisig) { if(!haveFullHistoryLoaded()) return false; map::iterator iterSubSSH; for(iterSubSSH = subHistMap_.begin(); iterSubSSH != subHistMap_.end(); iterSubSSH++) { StoredSubHistory & subssh = iterSubSSH->second; if(withMultisig) { // If with multisig, we can just copy everything mapToFill.insert(subssh.txioSet_.begin(), subssh.txioSet_.end()); } else { // Otherwise, we have to filter out the multisig TxIOs map::iterator iterTxio; for(iterTxio = subssh.txioSet_.begin(); iterTxio != subssh.txioSet_.end(); iterTxio++) { if(!iterTxio->second.isMultisig()) mapToFill[iterTxio->first] = iterTxio->second; } } } return true; } //////////////////////////////////////////////////////////////////////////////// // SubSSH object code // // If the SSH has more than one TxIO, then we put them into SubSSH objects, // which represent a list of TxIOs for the given block. The complexity of // doing it this way seems unnecessary, but it actually works quite efficiently // for massively-reused addresses like SatoshiDice. //////////////////////////////////////////////////////////////////////////////// void StoredSubHistory::unserializeDBValue(BinaryRefReader & brr) { // Get the TxOut list if a pointer was supplied // This list is unspent-TxOuts only if pruning enabled. You will // have to dereference each one to check spentness if not pruning if(hgtX_.getSize() != 4) { LOGERR << "Cannot unserialize DB value until key is set (hgt&dup)"; uniqueKey_.resize(0); return; } BinaryData fullTxOutKey(8); hgtX_.copyTo(fullTxOutKey.getPtr()); uint32_t numTxo = (uint32_t)(brr.get_var_int()); for(uint32_t i=0; i bitunpack(brr); bool isFromSelf = bitunpack.getBit(); bool isCoinbase = bitunpack.getBit(); bool isSpent = bitunpack.getBit(); bool isMulti = bitunpack.getBit(); // We always include the 8-byte value uint64_t txoValue = brr.get_uint64_t(); // First 4 bytes is same for all TxIOs, and was copied outside the loop. // So we grab the last four bytes and copy it to the end. brr.get_BinaryData(fullTxOutKey.getPtr()+4, 4); TxIOPair txio(fullTxOutKey, txoValue); if(isSpent) txio.setTxIn(brr.get_BinaryDataRef(8)); txio.setTxOutFromSelf(isFromSelf); txio.setFromCoinbase(isCoinbase); txio.setMultisig(isMulti); insertTxio(txio); } } //////////////////////////////////////////////////////////////////////////////// void StoredSubHistory::serializeDBValue(BinaryWriter & bw ) const { bw.put_var_int(txioSet_.size()); map::const_iterator iter; for(iter = txioSet_.begin(); iter != txioSet_.end(); iter++) { TxIOPair const & txio = iter->second; bool isSpent = txio.hasTxInInMain(); // If spent and only maintaining a pruned DB, skip it if(isSpent) { if(DBUtils.getDbPruneType()==DB_PRUNE_ALL) continue; if(!txio.getTxRefOfInput().isInitialized()) { LOGERR << "TxIO is spent, but input is not initialized"; continue; } } // We need to write BinaryData key8B = txio.getDBKeyOfOutput(); if(!key8B.startsWith(hgtX_)) LOGERR << "How did TxIO key not match hgtX_??"; BitPacker bitpack; bitpack.putBit(txio.isTxOutFromSelf()); bitpack.putBit(txio.isFromCoinbase()); bitpack.putBit(txio.hasTxInInMain()); bitpack.putBit(txio.isMultisig()); bw.put_BitPacker(bitpack); // Always write the value and last 4 bytes of dbkey (first 4 is in dbkey) bw.put_uint64_t(txio.getValue()); bw.put_BinaryData(key8B.getSliceCopy(4,4)); // If not supposed to write the TxIn, we would've bailed earlier if(isSpent) bw.put_BinaryData(txio.getDBKeyOfInput()); } } //////////////////////////////////////////////////////////////////////////////// void StoredSubHistory::unserializeDBValue(BinaryData const & bd) { BinaryRefReader brr(bd); unserializeDBValue(brr); } //////////////////////////////////////////////////////////////////////////////// void StoredSubHistory::unserializeDBValue(BinaryDataRef bdr) { BinaryRefReader brr(bdr); unserializeDBValue(brr); } //////////////////////////////////////////////////////////////////////////////// BinaryData StoredSubHistory::serializeDBValue(void) const { BinaryWriter bw; serializeDBValue(bw); return bw.getData(); } //////////////////////////////////////////////////////////////////////////////// void StoredSubHistory::unserializeDBKey(BinaryDataRef key, bool withPrefix) { uint32_t sz = key.getSize(); BinaryRefReader brr(key); // Assume prefix if(withPrefix) { DBUtils.checkPrefixByte(brr, DB_PREFIX_SCRIPT); sz -= 1; } brr.get_BinaryData(uniqueKey_, sz-4); brr.get_BinaryData(hgtX_, 4); } //////////////////////////////////////////////////////////////////////////////// BinaryData StoredSubHistory::getDBKey(bool withPrefix) const { BinaryWriter bw; if(withPrefix) bw.put_uint8_t(DB_PREFIX_SCRIPT); bw.put_BinaryData(uniqueKey_); bw.put_BinaryData(hgtX_); return bw.getData(); } //////////////////////////////////////////////////////////////////////////////// SCRIPT_PREFIX StoredSubHistory::getScriptType(void) const { if(uniqueKey_.getSize() == 0) return SCRIPT_PREFIX_NONSTD; else return (SCRIPT_PREFIX)uniqueKey_[0]; } //////////////////////////////////////////////////////////////////////////////// void StoredSubHistory::pprintFullSubSSH(uint32_t indent) { for(uint32_t ind=0; ind::iterator iter; for(iter = txioSet_.begin(); iter != txioSet_.end(); iter++) { for(uint32_t ind=0; indsecond; uint32_t hgt; uint8_t dup; uint16_t txi; uint16_t txo = txio.getIndexOfOutput(); BinaryData txoKey = txio.getDBKeyOfOutput(); BinaryRefReader brrTxOut(txoKey); DBUtils.readBlkDataKeyNoPrefix(brrTxOut, hgt, dup, txi); cout << "TXIO: (" << hgt << "," << (uint32_t)dup << "," << txi << "," << txo << ")"; BinaryData scraddr = txio.getTxOutCopy().getScrAddressStr(); cout << " VALUE: " << (txio.getValue() /COIN); cout << " isCB: " << (txio.isFromCoinbase() ? "X" : " "); cout << " isMS: " << (txio.isMultisig() ? "X" : " "); cout << " Type: " << (uint32_t)uniqueKey_[0]; cout << " Addr: " << uniqueKey_.getSliceCopy(1,4).toHexStr().c_str(); if(txio.hasTxIn()) { uint16_t txo = txio.getIndexOfInput(); BinaryData txiKey = txio.getDBKeyOfInput(); BinaryRefReader brrTxIn(txiKey); DBUtils.readBlkDataKeyNoPrefix(brrTxIn, hgt, dup, txi); cout << " SPENT: (" << hgt << "," << (uint32_t)dup << "," << txi << "," << txo << ")"; } cout << endl; } } //////////////////////////////////////////////////////////////////////////////// TxIOPair* StoredSubHistory::findTxio(BinaryData const & dbKey8B, bool withMulti) { map::iterator iter = txioSet_.find(dbKey8B); if(ITER_NOT_IN_MAP(iter, txioSet_)) return NULL; else { if(!withMulti && iter->second.isMultisig()) return NULL; return &(iter->second); } } //////////////////////////////////////////////////////////////////////////////// TxIOPair& StoredSubHistory::insertTxio(TxIOPair const & txio, bool withOverwrite) { BinaryData key8B = txio.getDBKeyOfOutput(); if(!key8B.startsWith(hgtX_)) { LOGERR << "This txio does not belong in this subSSH"; // Hmm, can't return a NULL ref... let's just fix any bug that causes // this branch to hit instead of hacking something } pair txioInsertPair(txio.getDBKeyOfOutput(), txio); pair::iterator, bool> txioInsertResult; // This returns pair txioInsertResult = txioSet_.insert(txioInsertPair); // If not inserted, then it was already there. Overwrite if requested if(!txioInsertResult.second && withOverwrite) txioInsertResult.first->second = txio; return txioInsertResult.first->second; } //////////////////////////////////////////////////////////////////////////////// // Since the outer-SSH object tracks total unspent balances, we need to pass // out the total amount that was deleted from the sub-history, and of course // return zero if nothing was removed. uint64_t StoredSubHistory::eraseTxio(TxIOPair const & txio) { return eraseTxio(txio.getDBKeyOfOutput()); } //////////////////////////////////////////////////////////////////////////////// uint64_t StoredSubHistory::eraseTxio(BinaryData const & dbKey8B) { map::iterator iter = txioSet_.find(dbKey8B); if(ITER_NOT_IN_MAP(iter, txioSet_)) return UINT64_MAX; else { TxIOPair & txio = iter->second; uint64_t valueRemoved = txio.getValue(); if(txio.hasTxInInMain() || txio.isMultisig()) valueRemoved = 0; txioSet_.erase(iter); return valueRemoved; } } //////////////////////////////////////////////////////////////////////////////// uint64_t StoredSubHistory::getSubHistoryReceived(bool withMultisig) { uint64_t bal = 0; map::iterator iter; for(iter = txioSet_.begin(); iter != txioSet_.end(); iter++) if(!iter->second.isMultisig() || withMultisig) bal += iter->second.getValue(); return bal; } //////////////////////////////////////////////////////////////////////////////// uint64_t StoredSubHistory::getSubHistoryBalance(bool withMultisig) { uint64_t bal = 0; map::iterator iter; for(iter = txioSet_.begin(); iter != txioSet_.end(); iter++) { if(!iter->second.hasTxIn()) if(!iter->second.isMultisig() || withMultisig) bal += iter->second.getValue(); } return bal; } //////////////////////////////////////////////////////////////////////////////// uint64_t StoredSubHistory::markTxOutSpent(BinaryData txOutKey8B, BinaryData txInKey8B) { // We found the TxIO we care about if(DBUtils.getDbPruneType() != DB_PRUNE_NONE) { LOGERR << "Have not yet implemented pruning logic yet!"; return UINT64_MAX; } TxIOPair * txioptr = findTxio(txOutKey8B); if(txioptr==NULL) { LOGERR << "We should've found an STXO in the SSH but didn't"; return UINT64_MAX; } if(txioptr->hasTxInInMain()) { LOGWARN << "TxOut is already marked as spent"; return 0; } if(txInKey8B.getSize() != 8) { LOGERR << "TxIn key input not valid! " << txInKey8B.toHexStr(); return UINT64_MAX; } txioptr->setTxIn(txInKey8B); // Return value spent only if not multisig return (txioptr->isMultisig() ? 0 : txioptr->getValue()); } //////////////////////////////////////////////////////////////////////////////// // This method will add the TxIOPair to the SSH object if it doesn't exist, // in addition to marking it unspent. // // If there is a 2-of-3 multisig scraddr M, which includes pubkeys, X, Y and Z, // then the DB will ultimately look like this: // // Key: Value: // ------- ------- // PREFIX_SCRIPT + M TxIO.isMultisigRef == false // PREFIX_SCRIPT + X TxIO.isMultisigRef == true // PREFIX_SCRIPT + Y TxIO.isMultisigRef == true // PREFIX_SCRIPT + Z TxIO.isMultisigRef == true // // We will ultimately update all four entries, but the TxIOs that are added // to X, Y and Z will be flagged so they are not interpretted as single-sig // addresses. We do this so we can later lookup multi-sig addresses that // involve a given scraddr, but don't automatically include them in any // balance or UTXO set calculations. // // Returns the difference to be applied to totalUnspent_ in the outer SSH // (unless it's UINT64_MAX which is interpretted as failure) uint64_t StoredSubHistory::markTxOutUnspent(BinaryData txOutKey8B, uint64_t value, bool isCoinbase, bool isMultisigRef) { TxIOPair* txioptr = findTxio(txOutKey8B); if(txioptr != NULL) { if(DBUtils.getDbPruneType() != DB_PRUNE_NONE) { LOGERR << "Found STXO that we expected to already be pruned..."; return 0; } if(!txioptr->hasTxInInMain()) { LOGWARN << "STXO already marked unspent in SSH"; return 0; } txioptr->setTxIn(TxRef(), UINT32_MAX); return (txioptr->isMultisig() ? 0 : txioptr->getValue()); } else { if(value==UINT64_MAX) { LOGERR << "Need to add TxOut to sub-history, but no value supplied!"; return UINT64_MAX; } // The TxIOPair was not in the SSH yet; add it TxIOPair txio = TxIOPair(txOutKey8B, value); txio.setFromCoinbase(isCoinbase); txio.setMultisig(isMultisigRef); txio.setTxOutFromSelf(false); // in super-node mode, we don't use this insertTxio(txio); return (isMultisigRef ? 0 : value); } } /* Meh, no demand for this functionality yet ... finish it later //////////////////////////////////////////////////////////////////////////////// // One loop to compute all four values // values[0] ~ current balance no multisig // values[1] ~ current balance multisig-only // values[2] ~ total received no multisig // values[3] ~ total received multisig-only vector StoredSubHistory::getSubHistoryValues(void) { // vector values(4); for(uint32_t i=0; i<4; i++) values[i] = 0; map::iterator iter; for(iter = txioSet_.begin(); iter != txioSet_.end(); iter++) { if(iter->second.isMultisig()) { } if(!iter->second.hasTxIn()) if(!iter->second.isMultisig() || withMultisig) bal += iter->second.getValue(); } return bal; } */ //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// void StoredUndoData::unserializeDBValue(BinaryRefReader & brr) { brr.get_BinaryData(blockHash_, 32); uint32_t nStxoRmd = brr.get_uint32_t(); stxOutsRemovedByBlock_.clear(); stxOutsRemovedByBlock_.resize(nStxoRmd); for(uint32_t i=0; i bitunpack(brr); stxo.unserDbType_ = bitunpack.getBits(4); stxo.txVersion_ = bitunpack.getBits(2); stxo.isCoinbase_ = bitunpack.getBit(); BinaryData hgtx = brr.get_BinaryData(4); stxo.blockHeight_ = DBUtils.hgtxToHeight(hgtx); stxo.duplicateID_ = DBUtils.hgtxToDupID(hgtx); stxo.txIndex_ = brr.get_uint16_t(BIGENDIAN); stxo.txOutIndex_ = brr.get_uint16_t(BIGENDIAN); // This is the raw OutPoint of the removed TxOut. May not strictly // be necessary for processing undo ops in this DB (but might be), // but may be useful for giving to peers if needed w/o exta lookups brr.get_BinaryData(stxo.parentHash_, 32); stxo.txOutIndex_ = brr.get_uint32_t(); // Then read the raw TxOut itself stxo.unserialize(brr); } uint32_t nOpAdded = brr.get_uint32_t(); outPointsAddedByBlock_.clear(); outPointsAddedByBlock_.resize(nStxoRmd); for(uint32_t i=0; i bitpack; bitpack.putBits( (uint8_t)DBUtils.getArmoryDbType(), 4); bitpack.putBits( (uint8_t)stxo.txVersion_, 2); bitpack.putBit( stxo.isCoinbase_); bw.put_BitPacker(bitpack); // Put the blkdata key directly into the DB to save us a lookup bw.put_BinaryData( DBUtils.getBlkDataKeyNoPrefix( stxo.blockHeight_, stxo.duplicateID_, stxo.txIndex_, stxo.txOutIndex_)); bw.put_BinaryData(stxo.parentHash_); bw.put_uint32_t((uint32_t)stxo.txOutIndex_); bw.put_BinaryData(stxo.getSerializedTxOut()); } // Store just the OutPoints of the TxOuts that were added by this block. // If we're undoing this block, we have the full TxOuts already in the DB // under the block key with same hgt & dup. We could probably avoid // storing this data at all due to this DB design, but it is needed if we // are ever going to serve any other process that expects the OutPoint list. bw.put_uint32_t(nOpAdded); for(uint32_t i=0; i 0) preferredDBKey_ = dbKeyList_[0]; } //////////////////////////////////////////////////////////////////////////////// void StoredTxHints::serializeDBValue(BinaryWriter & bw ) const { bw.put_var_int(dbKeyList_.size()); // Find and write the preferred key first, skip all unpreferred (the first // one in the list is the preferred key... that paradigm could be improved // for sure...) for(uint32_t i=0; i 0) preferredDup_ = dup & 0x7f; } } //////////////////////////////////////////////////////////////////////////////// void StoredHeadHgtList::serializeDBValue(BinaryWriter & bw ) const { bw.put_uint8_t( dupAndHashList_.size() ); // Write the preferred/valid block header first for(uint32_t i=0; i"); } } ///////////////////////////////////////////////////////////////////////////// bool GlobalDBUtilities::checkPrefixByteWError( BinaryRefReader & brr, DB_PREFIX prefix, bool rewindWhenDone) { uint8_t oneByte = brr.get_uint8_t(); bool out; if(oneByte == (uint8_t)prefix) out = true; else { LOGERR << "Unexpected prefix byte: " << "Expected: " << getPrefixName(prefix) << "Received: " << getPrefixName(oneByte); out = false; } if(rewindWhenDone) brr.rewind(1); return out; } ///////////////////////////////////////////////////////////////////////////// bool GlobalDBUtilities::checkPrefixByte( BinaryRefReader & brr, DB_PREFIX prefix, bool rewindWhenDone) { uint8_t oneByte = brr.get_uint8_t(); bool out = (oneByte == (uint8_t)prefix); if(rewindWhenDone) brr.rewind(1); return out; } ///////////////////////////////////////////////////////////////////////////// BinaryData GlobalDBUtilities::getBlkDataKey( uint32_t height, uint8_t dup) { BinaryWriter bw(5); bw.put_uint8_t( DB_PREFIX_TXDATA ); bw.put_BinaryData( heightAndDupToHgtx(height,dup) ); return bw.getData(); } ///////////////////////////////////////////////////////////////////////////// BinaryData GlobalDBUtilities::getBlkDataKey( uint32_t height, uint8_t dup, uint16_t txIdx) { BinaryWriter bw(7); bw.put_uint8_t( DB_PREFIX_TXDATA ); bw.put_BinaryData( heightAndDupToHgtx(height,dup) ); bw.put_uint16_t( txIdx, BIGENDIAN); return bw.getData(); } ///////////////////////////////////////////////////////////////////////////// BinaryData GlobalDBUtilities::getBlkDataKey(uint32_t height, uint8_t dup, uint16_t txIdx, uint16_t txOutIdx) { BinaryWriter bw(9); bw.put_uint8_t( DB_PREFIX_TXDATA ); bw.put_BinaryData( heightAndDupToHgtx(height,dup) ); bw.put_uint16_t( txIdx, BIGENDIAN); bw.put_uint16_t( txOutIdx, BIGENDIAN); return bw.getData(); } ///////////////////////////////////////////////////////////////////////////// BinaryData GlobalDBUtilities::getBlkDataKeyNoPrefix( uint32_t height, uint8_t dup) { return heightAndDupToHgtx(height,dup); } ///////////////////////////////////////////////////////////////////////////// BinaryData GlobalDBUtilities::getBlkDataKeyNoPrefix( uint32_t height, uint8_t dup, uint16_t txIdx) { BinaryWriter bw(6); bw.put_BinaryData( heightAndDupToHgtx(height,dup)); bw.put_uint16_t( txIdx, BIGENDIAN); return bw.getData(); } ///////////////////////////////////////////////////////////////////////////// BinaryData GlobalDBUtilities::getBlkDataKeyNoPrefix( uint32_t height, uint8_t dup, uint16_t txIdx, uint16_t txOutIdx) { BinaryWriter bw(8); bw.put_BinaryData( heightAndDupToHgtx(height,dup)); bw.put_uint16_t( txIdx, BIGENDIAN); bw.put_uint16_t( txOutIdx, BIGENDIAN); return bw.getData(); } ///////////////////////////////////////////////////////////////////////////// uint32_t GlobalDBUtilities::hgtxToHeight(const BinaryData& hgtx) { return (READ_UINT32_BE(hgtx) >> 8); } ///////////////////////////////////////////////////////////////////////////// uint8_t GlobalDBUtilities::hgtxToDupID(const BinaryData& hgtx) { return (READ_UINT32_BE(hgtx) & 0x7f); } ///////////////////////////////////////////////////////////////////////////// BinaryData GlobalDBUtilities::heightAndDupToHgtx(uint32_t hgt, uint8_t dup) { uint32_t hgtxInt = (hgt<<8) | (uint32_t)dup; return WRITE_UINT32_BE(hgtxInt); } // kate: indent-width 3; replace-tabs on; armory-0.92.3/cppForSwig/OS_TranslatePath.h0000644000000000000000000000033312414772654017236 0ustar rootroot//Defines path translation for unicode support. Currently only active in Windows #ifndef _MSC_VER #define OS_TranslatePath(X) X #else #include #define OS_TranslatePath Win_TranslatePath #endif armory-0.92.3/cppForSwig/EncryptionUtils.h0000644000000000000000000004621412414772654017246 0ustar rootroot//////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////// // // Implements canned routines in Crypto++ for AES encryption (for wallet // security), ECDSA (which is already available in the python interface, // but it is slow, so we might as well use the fast C++ method if avail), // time- and memory-hard key derivation functions (resistent to brute // force, and designed to be too difficult for a GPU to implement), and // secure binary data handling (to make sure we don't leave sensitive // data floating around in application memory). // // // For the KDF: // // This technique is described in Colin Percival's paper on memory-hard // key-derivation functions, used to create "scrypt": // // http://www.tarsnap.com/scrypt/scrypt.pdf // // The goal is to create a key-derivation function that can force a memory // requirement on the thread applying the KDF. By picking a sequence-length // of 1,000,000, each thread will require 32 MB of memory to compute the keys, // which completely disarms GPUs of their massive parallelization capabilities // (for maximum parallelization, the kernel must use less than 1-2 MB/thread) // // Even with less than 1,000,000 hashes, as long as it requires more than 64 // kB of memory, a GPU will have to store the computed lookup tables in global // memory, which is extremely slow for random lookup. As a result, GPUs are // no better (and possibly much worse) than a CPU for brute-forcing the passwd // // This KDF is actually the ROMIX algorithm described on page 6 of Colin's // paper. This was chosen because it is the simplest technique that provably // achieves the goal of being secure, and memory-hard. // // The computeKdfParams method well test the speed of the system it is running // on, and try to pick the largest memory-size the system can compute in less // than 0.25s (or specified target). // // // NOTE: If you are getting an error about invalid argument types, from python, // it is usually because you passed in a BinaryData/Python-string instead // of a SecureBinaryData object // //////////////////////////////////////////////////////////////////////////////// #ifndef _ENCRYPTION_UTILS_ #define _ENCRYPTION_UTILS_ #include #include #include #include #include #include "cryptlib.h" #include "osrng.h" #include "sha.h" #include "aes.h" #include "modes.h" #include "eccrypto.h" #include "filters.h" #include "BinaryData.h" #include "BtcUtils.h" #include "UniversalTimer.h" // This is used to attempt to keep keying material out of swap // I am stealing this from bitcoin 0.4.0 src, serialize.h #if defined(_MSC_VER) || defined(__MINGW32__) // Note that VirtualLock does not provide this as a guarantee on Windows, // but, in practice, memory that has been VirtualLock'd almost never gets written to // the pagefile except in rare circumstances where memory is extremely low. #include #define mlock(p, n) VirtualLock((p), (n)); #define munlock(p, n) VirtualUnlock((p), (n)); #else #include #include /* This comes from limits.h if it's not defined there set a sane default */ #ifndef PAGESIZE #include #define PAGESIZE sysconf(_SC_PAGESIZE) #endif #define mlock(a,b) \ mlock(((void *)(((size_t)(a)) & (~((PAGESIZE)-1)))),\ (((((size_t)(a)) + (b) - 1) | ((PAGESIZE) - 1)) + 1) - (((size_t)(a)) & (~((PAGESIZE) - 1)))) #define munlock(a,b) \ munlock(((void *)(((size_t)(a)) & (~((PAGESIZE)-1)))),\ (((((size_t)(a)) + (b) - 1) | ((PAGESIZE) - 1)) + 1) - (((size_t)(a)) & (~((PAGESIZE) - 1)))) #endif // We will look for a high memory value to use in the KDF // But as a safety check, we should probably put a cap // on how much memory the KDF can use -- 32 MB is good // If a KDF uses 32 MB of memory, it is undeniably easier // to compute on a CPU than a GPU. #define DEFAULT_KDF_MAX_MEMORY 32*1024*1024 using namespace std; // Use this to avoid "using namespace CryptoPP" (which confuses SWIG) // and also so it's easy to switch the AES MODE or PRNG, in one place #define UNSIGNED ((CryptoPP::Integer::Signedness)(0)) #define BTC_AES CryptoPP::AES #define BTC_CFB_MODE CryptoPP::CFB_Mode #define BTC_CBC_MODE CryptoPP::CBC_Mode #define BTC_PRNG CryptoPP::AutoSeededX917RNG #define BTC_ECPOINT CryptoPP::ECP::Point #define BTC_ECDSA CryptoPP::ECDSA #define BTC_PRIVKEY CryptoPP::ECDSA::PrivateKey #define BTC_PUBKEY CryptoPP::ECDSA::PublicKey #define BTC_SIGNER CryptoPP::ECDSA::Signer #define BTC_VERIFIER CryptoPP::ECDSA::Verifier //////////////////////////////////////////////////////////////////////////////// // Make sure that all crypto information is handled with page-locked data, // and overwritten when it's destructor is called. For simplicity, we will // use this data type for all crypto data, even for data values that aren't // really sensitive. We can use the SecureBinaryData(bdObj) to convert our // regular strings/BinaryData objects to secure objects // class SecureBinaryData : public BinaryData { public: // We want regular BinaryData, but page-locked and secure destruction SecureBinaryData(void) : BinaryData() { lockData(); } SecureBinaryData(uint32_t sz) : BinaryData(sz) { lockData(); } SecureBinaryData(BinaryData const & data) : BinaryData(data) { lockData(); } SecureBinaryData(uint8_t const * inData, size_t sz) : BinaryData(inData, sz) { lockData(); } SecureBinaryData(uint8_t const * d0, uint8_t const * d1) : BinaryData(d0, d1) { lockData(); } SecureBinaryData(string const & str) : BinaryData(str) { lockData(); } SecureBinaryData(BinaryDataRef const & bdRef) : BinaryData(bdRef) { lockData(); } ~SecureBinaryData(void) { destroy(); } // These methods are definitely inherited, but SWIG needs them here if they // are to be used from python uint8_t const * getPtr(void) const { return BinaryData::getPtr(); } uint8_t * getPtr(void) { return BinaryData::getPtr(); } size_t getSize(void) const { return BinaryData::getSize(); } SecureBinaryData copy(void) const { return SecureBinaryData(getPtr(), getSize());} string toHexStr(bool BE=false) const { return BinaryData::toHexStr(BE);} string toBinStr(void) const { return BinaryData::toBinStr(); } SecureBinaryData(SecureBinaryData const & sbd2) : BinaryData(sbd2.getPtr(), sbd2.getSize()) { lockData(); } void resize(size_t sz) { BinaryData::resize(sz); lockData(); } void reserve(size_t sz) { BinaryData::reserve(sz); lockData(); } BinaryData getRawCopy(void) const { return BinaryData(getPtr(), getSize()); } BinaryDataRef getRawRef(void) { return BinaryDataRef(getPtr(), getSize()); } SecureBinaryData copySwapEndian(size_t pos1=0, size_t pos2=0) const; SecureBinaryData & append(SecureBinaryData & sbd2) ; SecureBinaryData & operator=(SecureBinaryData const & sbd2); SecureBinaryData operator+(SecureBinaryData & sbd2) const; //uint8_t const & operator[](size_t i) const {return BinaryData::operator[](i);} bool operator==(SecureBinaryData const & sbd2) const; BinaryData getHash256(void) const { return BtcUtils::getHash256(getPtr(), (uint32_t)getSize()); } BinaryData getHash160(void) const { return BtcUtils::getHash160(getPtr(), (uint32_t)getSize()); } // This would be a static method, as would be appropriate, except SWIG won't // play nice with static methods. Instead, we will just use // SecureBinaryData().GenerateRandom(32), etc SecureBinaryData GenerateRandom(uint32_t numBytes, SecureBinaryData extraEntropy=SecureBinaryData()); void lockData(void) { if(getSize() > 0) mlock(getPtr(), getSize()); } void destroy(void) { if(getSize() > 0) { fill(0x00); munlock(getPtr(), getSize()); } resize(0); } }; //////////////////////////////////////////////////////////////////////////////// // A memory-bound key-derivation function -- uses a variation of Colin // Percival's ROMix algorithm: http://www.tarsnap.com/scrypt/scrypt.pdf // // The computeKdfParams method takes in a target time, T, for computation // on the computer executing the test. The final KDF should take somewhere // between T/2 and T seconds. class KdfRomix { public: ///////////////////////////////////////////////////////////////////////////// KdfRomix(void); ///////////////////////////////////////////////////////////////////////////// KdfRomix(uint32_t memReqts, uint32_t numIter, SecureBinaryData salt); ///////////////////////////////////////////////////////////////////////////// // Default max-memory reqt will void computeKdfParams(double targetComputeSec=0.25, uint32_t maxMemReqtsBytes=DEFAULT_KDF_MAX_MEMORY); ///////////////////////////////////////////////////////////////////////////// void usePrecomputedKdfParams(uint32_t memReqts, uint32_t numIter, SecureBinaryData salt); ///////////////////////////////////////////////////////////////////////////// void printKdfParams(void); ///////////////////////////////////////////////////////////////////////////// SecureBinaryData DeriveKey_OneIter(SecureBinaryData const & password); ///////////////////////////////////////////////////////////////////////////// SecureBinaryData DeriveKey(SecureBinaryData const & password); ///////////////////////////////////////////////////////////////////////////// string getHashFunctionName(void) const { return hashFunctionName_; } uint32_t getMemoryReqtBytes(void) const { return memoryReqtBytes_; } uint32_t getNumIterations(void) const { return numIterations_; } SecureBinaryData getSalt(void) const { return salt_; } private: string hashFunctionName_; // name of hash function to use (only one) uint32_t hashOutputBytes_; uint32_t kdfOutputBytes_; // size of final key data uint32_t memoryReqtBytes_; uint32_t sequenceCount_; SecureBinaryData lookupTable_; SecureBinaryData salt_; // prob not necessary amidst numIter, memReqts // but I guess it can't hurt uint32_t numIterations_; // We set the ROMIX params for a given memory // req't. Then run it numIter times to meet // the computation-time req't }; //////////////////////////////////////////////////////////////////////////////// // Leverage CryptoPP library for AES encryption/decryption class CryptoAES { public: CryptoAES(void) {} ///////////////////////////////////////////////////////////////////////////// SecureBinaryData EncryptCFB(SecureBinaryData & data, SecureBinaryData & key, SecureBinaryData & iv); ///////////////////////////////////////////////////////////////////////////// SecureBinaryData DecryptCFB(SecureBinaryData & data, SecureBinaryData & key, SecureBinaryData iv); ///////////////////////////////////////////////////////////////////////////// SecureBinaryData EncryptCBC(SecureBinaryData & data, SecureBinaryData & key, SecureBinaryData & iv); ///////////////////////////////////////////////////////////////////////////// SecureBinaryData DecryptCBC(SecureBinaryData & data, SecureBinaryData & key, SecureBinaryData iv); }; //////////////////////////////////////////////////////////////////////////////// // Create a C++ interface to the Crypto++ ECDSA ops: should be more secure // and much faster than the pure-python methods created by Lis // // These methods might as well just be static methods, but SWIG doesn't like // static methods. So we will invoke these via CryptoECDSA().Function() class CryptoECDSA { public: CryptoECDSA(void) {} ///////////////////////////////////////////////////////////////////////////// static BTC_PRIVKEY CreateNewPrivateKey( SecureBinaryData extraEntropy=SecureBinaryData()); ///////////////////////////////////////////////////////////////////////////// static BTC_PRIVKEY ParsePrivateKey(SecureBinaryData const & privKeyData); ///////////////////////////////////////////////////////////////////////////// static BTC_PUBKEY ParsePublicKey(SecureBinaryData const & pubKey65B); ///////////////////////////////////////////////////////////////////////////// static BTC_PUBKEY ParsePublicKey(SecureBinaryData const & pubKeyX32B, SecureBinaryData const & pubKeyY32B); ///////////////////////////////////////////////////////////////////////////// static SecureBinaryData SerializePrivateKey(BTC_PRIVKEY const & privKey); ///////////////////////////////////////////////////////////////////////////// static SecureBinaryData SerializePublicKey(BTC_PUBKEY const & pubKey); ///////////////////////////////////////////////////////////////////////////// static BTC_PUBKEY ComputePublicKey(BTC_PRIVKEY const & cppPrivKey); ///////////////////////////////////////////////////////////////////////////// static bool CheckPubPrivKeyMatch(BTC_PRIVKEY const & cppPrivKey, BTC_PUBKEY const & cppPubKey); ///////////////////////////////////////////////////////////////////////////// // For signing and verification, pass in original, UN-HASHED binary string static SecureBinaryData SignData(SecureBinaryData const & binToSign, BTC_PRIVKEY const & cppPrivKey); ///////////////////////////////////////////////////////////////////////////// // For signing and verification, pass in original, UN-HASHED binary string static bool VerifyData(SecureBinaryData const & binMessage, SecureBinaryData const & binSignature, BTC_PUBKEY const & cppPubKey); ///////////////////////////////////////////////////////////////////////////// // For doing direct raw ECPoint operations... need the ECP object static CryptoPP::ECP Get_secp256k1_ECP(void); ///////////////////////////////////////////////////////////////////////////// // We need to make sure that we have methods that take only secure strings // and return secure strings (I don't feel like figuring out how to get // SWIG to take BTC_PUBKEY and BTC_PRIVKEY ///////////////////////////////////////////////////////////////////////////// SecureBinaryData GenerateNewPrivateKey( SecureBinaryData extraEntropy=SecureBinaryData()); ///////////////////////////////////////////////////////////////////////////// SecureBinaryData ComputePublicKey(SecureBinaryData const & cppPrivKey); ///////////////////////////////////////////////////////////////////////////// bool VerifyPublicKeyValid(SecureBinaryData const & pubKey); ///////////////////////////////////////////////////////////////////////////// bool CheckPubPrivKeyMatch(SecureBinaryData const & privKey32, SecureBinaryData const & pubKey65); ///////////////////////////////////////////////////////////////////////////// // For signing and verification, pass in original, UN-HASHED binary string SecureBinaryData SignData(SecureBinaryData const & binToSign, SecureBinaryData const & binPrivKey); ///////////////////////////////////////////////////////////////////////////// // For signing and verification, pass in original, UN-HASHED binary string bool VerifyData(SecureBinaryData const & binMessage, SecureBinaryData const & binSignature, SecureBinaryData const & pubkey65B); ///////////////////////////////////////////////////////////////////////////// // Deterministically generate new private key using a chaincode // Changed: Added using the hash of the public key to the mix // b/c multiplying by the chaincode alone is too "linear" // (there's no reason to believe it's insecure, but it doesn't // hurt to add some extra entropy/non-linearity to the chain // generation process) SecureBinaryData ComputeChainedPrivateKey( SecureBinaryData const & binPrivKey, SecureBinaryData const & chainCode, SecureBinaryData binPubKey=SecureBinaryData(), SecureBinaryData* computedMultiplier=NULL); ///////////////////////////////////////////////////////////////////////////// // Deterministically generate new private key using a chaincode SecureBinaryData ComputeChainedPublicKey( SecureBinaryData const & binPubKey, SecureBinaryData const & chainCode, SecureBinaryData* multiplierOut=NULL); ///////////////////////////////////////////////////////////////////////////// // We need some direct access to Crypto++ math functions SecureBinaryData InvMod(const SecureBinaryData& m); ///////////////////////////////////////////////////////////////////////////// // Some standard ECC operations //////////////////////////////////////////////////////////////////////////////// bool ECVerifyPoint(BinaryData const & x, BinaryData const & y); BinaryData ECMultiplyScalars(BinaryData const & A, BinaryData const & B); BinaryData ECMultiplyPoint(BinaryData const & A, BinaryData const & Bx, BinaryData const & By); BinaryData ECAddPoints(BinaryData const & Ax, BinaryData const & Ay, BinaryData const & Bx, BinaryData const & By); BinaryData ECInverse(BinaryData const & Ax, BinaryData const & Ay); ///////////////////////////////////////////////////////////////////////////// // For Point-compression SecureBinaryData CompressPoint(SecureBinaryData const & pubKey65); SecureBinaryData UncompressPoint(SecureBinaryData const & pubKey33); }; #endif armory-0.92.3/cppForSwig/CppBlockUtils.i0000755000000000000000000000713212414772654016611 0ustar rootroot/* File BlockUtils.i */ /* //////////////////////////////////////////////////////////////////////////////// // // // Copyright (C) 2011-2014, Armory Technologies, Inc. // // support@bitcoinarmory.com // // Distributed under the GNU Affero General Public License (AGPL v3) // // See LICENSE or http://www.gnu.org/licenses/agpl.html // // // //////////////////////////////////////////////////////////////////////////////// */ %module CppBlockUtils %{ #define SWIG_PYTHON_EXTRA_NATIVE_CONTAINERS #include "BlockObj.h" #include "StoredBlockObj.h" #include "BlockUtils.h" #include "BtcUtils.h" #include "EncryptionUtils.h" %} %include "std_string.i" %include "std_vector.i" %typedef std::string string; %typedef unsigned char uint8_t; %typedef unsigned short uint16_t; %typedef unsigned int uint32_t; %typedef unsigned long long uint64_t; %typedef char int8_t; %typedef short int16_t; %typedef int int32_t; %typedef long long int64_t; %typedef unsigned int size_t; %typedef unsigned int TXIN_SCRIPT_TYPE; %typedef unsigned int TXOUT_SCRIPT_TYPE; namespace std { %template(vector_int) std::vector; %template(vector_float) std::vector; %template(vector_BinaryData) std::vector; %template(vector_LedgerEntry) std::vector; %template(vector_TxRefPtr) std::vector; %template(vector_Tx) std::vector; %template(vector_BlockHeaderPtr) std::vector; %template(vector_UnspentTxOut) std::vector; %template(vector_BtcWallet) std::vector; %template(vector_AddressBookEntry) std::vector; %template(vector_RegisteredTx) std::vector; } /******************************************************************************/ /* Convert Python(str) to C++(BinaryData) */ %typemap(in) BinaryData { if(!PyString_Check($input)) { PyErr_SetString(PyExc_ValueError, "Expected string argument!"); return NULL; } $1 = BinaryData((uint8_t*)PyString_AsString($input), PyString_Size($input)); } /******************************************************************************/ /* Convert C++(BinaryData) to Python(str) */ %typemap(out) BinaryData { $result = PyString_FromStringAndSize((char*)($1.getPtr()), $1.getSize()); } /******************************************************************************/ /* // Convert Python(str) to C++(BinaryData const &) // We add a bdObj which will get created outside the typemap block, // so that we have a BinaryData obj that isn't destroyed before it // is referenced (search CppBlockUtils_wrap.cxx for "bdObj") */ %typemap(in) BinaryData const & (BinaryData bdObj) { if(!PyString_Check($input)) { PyErr_SetString(PyExc_ValueError, "Expected string argument!"); return NULL; } bdObj.copyFrom((uint8_t*)PyString_AsString($input), PyString_Size($input)); $1 = &bdObj; } /******************************************************************************/ /* Convert C++(BinaryData const &) to Python(str) */ %typemap(out) BinaryData const & { $result = PyString_FromStringAndSize((char*)($1->getPtr()), $1->getSize()); } /* With our typemaps, we can finally include our other objects */ %include "BlockObj.h" %include "StoredBlockObj.h" %include "BlockUtils.h" %include "BtcUtils.h" %include "EncryptionUtils.h" armory-0.92.3/default_bootstrap.torrent0000644000000000000000000047040612414772654017003 0ustar rootrootd8:announce46:http://tracker.bitcoinarmory.com:6969/announce7:comment25:Armory Technologies, Inc.10:created by25:Transmission/2.51 (13280)13:creation datei1395277523e8:encoding5:UTF-84:infod6:lengthi16746462909e4:name13:bootstrap.dat12:piece lengthi2097152e6:pieces159720: rlq/-ucf!]]\x)H%h)ٝn.D>L}XǎzL; SAtpbYeVv/A?3@1TU"$`OְPƀ餿A5mюM/%TM\a8"yHH^&HKs1!>h`H[p,ywW8x¨o,=S tDǗ0k`5}Oކ0CbƲqR.xãaXLYqM48]$Z,RLR$UY$J%Z8V(xtԶkNx.]hi9CaR|ľΞYµ}3f8ew^@!נ뛫<~DeP2`Vc: CkAȍkT&e% avMڷ>x t3+]ViՋ-7*~|f~5?@<^kȋ*qI203>~`|1zb5[؅1h~Χ 2gY`(!4 FA6pma$ ^A}vdTLgLJbEQ . PF%`(q3JSֵ B_!.a}S'׌qm.j{KK*\4h_WBZ=4@ }%-@b@6[b1/I( uG]qw(eM4Mӵq9R纞gQJ9vSa& :6&Rž⹘]c:(gc:3EUo;1zܻO6t"|_2r FlF^h=qЭ;#=d.\9.eJaO+bB?h\ n/ Uʦ-grr%wrуyH1SKD7Rpޥc A,h8 նous<lr']h淯8PשV󦫂p97PkM'}&QG<+?k)$PjTM8] 3 rkԳQEd,V/nt}vvLO.(Szfx Ӝr$'3<66IKtB]YO,G TSE{S~1 JiXt ͤ5Of*>])xpR>{%IϪ~8!DCNU>H@?u '_en)EEB'[|o!Ф1m:ư:,ޞcTQL&mP{aד5c/Z1mK <:DWλqj/\k3[ȡrHAC~MܰbmXd{{:"L r$r|:ccX؄?Y=%D/fPʓu<nzC닻/I<:$Ȼs+o^}K*́'ڋdx 9 OW (eRJ9N!EƥS. ocq6 ߦȱt=rk>x0 Yb7_n'dg:PDaEyZWcvg`H6Kp<;h+RȚJCȂmȢcojyۭnKovyO+O[\PiqSuCO~X1,^Xtz( %mLvB46n:?_]M0.M6#k\Y n5.lcAtS<ӲeQ?Eorfue1 G1c@Ok鮑U T #a֒ Xj6ė, I6 CJzy'8 M ~_T}M68n m?|dPD;S:l0w}Zk6|ϦRMٔufVGUW!E:ǻh_b@s~ 썡Id- VcНl"9ilM49U"I Du:؝7"P ֋B`ciNڔ83_ ?fnd]}Hdgu3N?F E8pm"H9u)D/TT1aK3ѧd,- T {$IC3 s'z-+L + *KLfl<_#,#8+ ݟ9N1u9]J]T{`K"-[ V*auE詷=-W4I=:[ЬoY:esxQY^`1tlǢZʧHtƟϲ)p1eM&e SQ+:݃@:}JůJ)q׽w4yRqˮ+7' #W]̘o%}Gp{pҞÒч}*&cB0Ld ˃FF4Ftn'm;޾*AVH?Ӣ*km/c-TX.0- K$. X>Oc >ÒOyk<IsZ髍GFgm<> f@Sdْ cF'7u ůkݧt[cj (f 7HqPe g_T~*#m39<DQ mʝi±] ?y}~BHJHfɲN#Pwae96D_XQE\]k/~${T\ F/=dp歩2p[S&(:FOm6(xd]L{ѰE9ZG0MEk^O[ɖ>YmḎ`c3`;gK88/Mt*J5}C^ /Fo~,8ǬYk>*= p5f;='H`2d8C:2RoGBlVG8PI~`lFpX~l 8 -jiaV9BdPd5|渠j!}o~sci욺) =sх2zѤ-v5v_X g5&{vm(~;>?{Ż^Q^ڝ2>-L49RI?*С!Q/'6sW,_AcaI+-L8P{XqQ{I(;r~ޑ#%W8=Zݍ+Bl 7Þ1ϱq8{.ɝm\EӬ85 /o MEs@M㎉J[&J46 ҩJ}Ze[yS;lvsNfZa: sqV, {b-kЇ ^3c h/d^)hTM+25L9;0Nҥ 3>%R!Eځ>kwF HPq2Ex&l˘rOJ3HR1ȁ$А;T|c8;)ߦ e*Œ ,eת@3kVȽҖ WA H{#f~0٠ÉyZ,/k̼sIvl}~OFq~}kdB2+l ks(aheV LPKQPAu W:)bwe5-\ybDq̎l:vE܆a_|A'\nQD`r5H& Z쥦yBuCpyY$[U1sQCɔЈ ˡ^JB(5kiʡqN}'W@8DQiC1t*NhXy]'= B'GʘQKwkVsY_ÝSW,Z ^ Jמ_e9htE %f-ȸ z}q\6slSz~>U+—!&7ӗa[DŶ+Yz%!A3 V i<[' ZZ_ᮻ T-k/B幋Rƴ|,hth}'$Lk:0:P1^q'K',leN{ U8gZW@j>.;1+lnt"tҎc1\e8H&g% '4@J.L-fTÛZۚ9Kebwswa':Vǯk"`?TFJF,\i{u E_2uFkrkR}Mﮯ1;jmB=^WnJ-Wale~̾2̀hmIb=B93g@((=r߶"5 a\ϩE4B8\ t{1;q:Jmn) .p0 rq?pu?u6ș2Hh>ZQnyh Y;bu^<nem@&?vj$bb 2ʁTy-/|( f[)fKn;{Ib;DS}îxIT #3G4mNcp We|-nc- oH̶nd nAFMޅ4ۀ$}&_lK/ɑ>p؄;X%6l-ԊX*jvnu+ʍd 0m; _>:Rw#AN+dI:[z/W{z#8W6)wGdP,UpPT$ |\14Z:>z$p:~[*M8`ԈkCH\\j%t _bf?1_#vb¥(=kfɂ 8E(xδn9GY7FM(sYI$ }}\۟U̧ ?lvX)T72MOMqIB|ra[88?]*KNgrB + DK{HIWyǛmٯYmI 'p<20agȆۖ9LSq2<8rXzr'ՕԹ-jTcH#"/1Ox. @-xh@WgrMc’|!3?ƀ^s؉8ơ\f<ᠾ4ńo}H "ϑ56bŝ`Pr߸ DZZSީ'L K$]?PTi/L hLc t%q9Ke&OK#UsGnS~UVzM5ƀCw;s:ƽݜ%+Lf9$"u.n"鋕OƖ!-(3(}f`OF[іHYS¾{q8PhJOvYALdy 7_[x9n]5.3M3j[M1%$F0aR>Z3CAsWh/4 X-Qmm1ɑѯm1&^b BTOnEuB 1{{H;v]{){/mlehQ:-1^~Õ~VUo+EвKG!7`=t+Mcs#AwSa8#Y0oNǭ_Gף߶B M`cw; ,\e`b@sIrf2T=O Xnˆi$#1'1=A)|o#py=ĻQBJPırGr J6NJ$'k*́T %oujpX$Tt7>XMQ+B .{&ˡ YYxp0nWa^`vVIEBFcLҤ_QOQ) b'ຽp>jb1ѫխv?־Gd@:MCuHawG X C$jW<1LetHC(7]`D[R'sI@ s> @r}@h&hK;MrO,>uYiDRDFƤOy"sG i2ջ)O$Ne`|!߭Ak4%څuЊJv7꼯w6g[l[Hd_d)Ƒ5k4 {Z:n'v9U|*܄IWƓtJk!lHh [wwIAZ[UDz*Z5 &!Fmzա³`(u67س4:Hq$q>Zf ^Sk~f߂8֗>vmm@֗Q5ó"ỹ[e2v;](-sZ"L?!cM>]\: N67/t 1PCNӎ2Imj$ahVVMKD-G :*aoo󠞏? ʤɨCY:YYoiŲĒst#i%=w /evnKG_tؙzjL~-LMXmy$+o*wc%Qd7Yk¿<Rъ<oEGQq 7R [ڨ+ : o@?}"v%nlLl┃qGMhɧ<8lDGpGw)4U_i60N# w"Ac]T\7 B^UdQз#0*D~gvs ؿs(/':yD攩g.yϼ oE\,_ ,nI '-)Ej/^y:x֫\r$-\])E0_^TbҞ{}4:MԜ/Qs1݄]bGև q6 eKfwDZV|gƱPԚ]M;*"Zɴfx0r&& bLca:eH{5% ,>TVDFğʜJZS N~6c&Mɡt `V;kP32:3kE[CM@0( dÿБ> X![&^| xj8B€|=HGVr##2-!N:E`.)'-BulTƇLr ZB{w S 58hE3ĨF؃Ϗ@pu1*fUe\F8j? "'d=y }Ɇ"kĖt98屹dx}!ʑ x ]!bB 0RЉ{IWeoڃ~XT_6a3R1jԗvV )8߿Gxeet { /Ni;SV—RCJhjч(%e#Δ!!G,/NC]м\+ܘʸ]kpxm+H|ҳ}VwqMV(̚0oV d۽9kCC[Ռ׫%,9",E:M A|euqDdeb!%*{8MEx2~l+Ơ *緈65eKcsћ&"~ٓХqARPsf1bHS{ݦKx絡/?i c7^|\<ڢ'(V2[.5j{fRD#!X]=uܾ>ȵ5r*4\GR?`Udp甝IJXwg)־#Tv6^mMDi]ɨ87#+ȨґafuTx<[͡:dAJU([^Y$:|!Ul$YPw9QtTWnn3MF#C-JW̏RM_Mgּݥxuq8a1. j:1l&r%cx/2`:383|[!OrNW,9G["U)G;oꇅ1PSI՜nJҼ:w?] qއ&P~?F*sh\Q6RG4}# /L v,җRFGptE/e:c}.a?n38Vm%[#1t"zR(QN t #ARUjHIa?SՑ*³+5,(\zujI]{ xGpu]gW~&au) o l?{U$j6e&co2{0NV$'Ayϩ R:[fR~$jJ4޹<[8.͋KN̫r~fkY6kȜ }:aw2xe0VlO LZpE]AñKTajAq5Htp~C}+P6w0G䠸Z* % )_{ХGL.tʋ f4,9vsNX4ӸKA#z*C/N% >EdSKn % sQ۩:sN74h54 d^YTLf K㏁5̺ $d>̒+F\\ZďL+h}lJj m_?oA#bLBA" IQD[y'>FIӉww#7RY|@Zwd.2KƊU V}Q|RMhT)~­OIGYMI'Ĵ3P:k1洨ʜ^ǭUF騢BAG>24@j.{dkN*x\nl;>o+|DYHD=!S 5ͥZOI"}5#>FoIJ`0b'Ud"u5݂=KQUz0 9/M$ZBʹDfjϸ'57?8lY0!N7i# ;X|C0%P6 9ah ~.'M sU k ɒu֦&`,;?nS:JW-蜓xb䆪Qd$Qs~/ Ym2pl4#!bPIX9R';<ɗ:l2!IXu9zYӁg)GMs?JlHlRZ-ߪަ,Dl}=]G 8)C 9~6-J7RRcS5x1hD!2igX!~/Xe>MRP)_@hQ%1F s'X>x<9\l@#~_FjO'VrT|I< b/0Vꫛkmg42XdV 9Nphѩm!ݺg^7@6 7-ZDzY&Ě6!09;4 {I+ .CD6_&*Q颦UW~BJے._dd|C%s?+0X0CSWz#"ɫEqˇt"6UL9]?v~jo6V ܋ ZtRvq4mSUL 6Q4t7^63%8&аUQ1|^9r SQ/"} P"ƖV21m$$v,RS[$/mn'M"F~YҐEk\Mu[P{xC7`'P  8M^!<_3Ur'^ϗQIC9gXIb C$1Aw~ j#R 5/ىî|ih˾,+4Yl!WĊ֪ybc֚4<]◊$FijuB ~6EHAY6O2Ne355[HU: Щ!@ ?n5KVp'x/Ӯ-;Rtzذ5 \ iFԏP2uc"10FdK8  -A@ s/]j#e3A˲+B*zDbFiY):aSMUi~8ޱ|.D-WZ rĂйY)5Dq8έSl='-RU{=by{? ǽ& }қOmfh4D7;y=Qc{[˵T%-;e܇js>phpz\eg'Aڹ>alن/+X78RG2^(&Svf(AC 22zPfX"yITha50x^Ou =}By;#a$DT$639I&`›sy0̒T nbS^U}@p yKYN ᣯԻ3rjdV=ؖe{Y5ϓJD]bM~zϧh +HrY5ġiL5jt6d. )m)k;uB;GXM@ХWY7Ʌ>FGUIـZ DDzR@ycP*v?JP|0#쵺$jGkYa 4_y.I&.hRz|K]@tO5B1 r8-y-sL#k1`sl TZgsʘpi$l)j0 Em H6>.;K`L^Y#ڏ륐)x.. ezy dET7t=/+NFj~nT|2Ҳx}'c`PzzaR`F/'Qїh@"qPa<^Ћdv|+(WTB º封׎_뗉`R!nw/[oMǂd%:W?&+GDGt5Oy3'|(^<-0|4I< R~~IMkUU U^KX9oƨh5sHvWCzZ(9}#k^7sTwv Լ2;`y.NB{麝6߸œ>JT>׺,*K-2qf"GraDDE3 M`zzI>ŇAj;j Wڏ5uJ-U ,u_^ y Ƃ ?I 8P* 09S~BW 8QC7ٲZ灤߽u&oKG|Ct~ YCkGZfΛ'ߺG ^x[BI}uUUg_|~X% 5ysF]ao2[ֈO-Tȋ ( rK%a2@b3c@*9қ2xtO?]ҫEḩ;J;YbeHC3{H0P^M큨El`0 ^Ny?hise~uEeREiɃ 7U ˊC8zu~M QK: Y #xAh4宁7q%1*VUAԯV_P 5Z<;W) Y<8.1'gqpGh65 pwH)TQ+'(2jDm,.Gҿew q?#0 09ڸni_'Y#7?Hvږs&i@̌ 4G+:ZvxBEv4i{ő06'ӝd՞[zJM YT8H hm O}6Bܽn[#mzA*dEImZGxQErgNsh= ٵ52=r:<5Rjuydj1պ ΀4xK, @nևgewĨURB9't1{ ,-oKkJ"D3EjVm5^{V(Mﭲ=W+7Z;XU ,?D[i 7T>Ě}<` X1-줂ønkydGtƠp]׋mUɝ/r"sL[4hSHOB-8O Fw{#t<pyC(f 4Ds>[hj pq!=Lz{@.h;%K} e֤9艾312`uuA6 ~!.]P|Bu畷"'QO[#p4XRhnQ,gc󂝚 u,\iwoT!+Zp Fx!֒ p,IFyգo 'o\t kshI| ud~6qөP(RmKYiIv-Cp-(]{my*{ \8ytͱ!1ůoS= ͒UH<BD S阍d~fӥ,L;+zFfÑMEZZMK2<+1Ax,z꭮/SF*I!)@w&Jy[R,h=_ `L@AY4Nܧ7Nɹ"̢085N>>bTIj"G/c$4G }H8u[Q^I%_ƩeßW%=fQ/%] ''9X6ÃjKߝc?!clikij퀗ň-W+jqcu2dP~e:#)6ʹkt 0:+P<"SZB@3wZj $U0SSxAu7S 9CsI0'"8T? /D8H^-V׵4O(MdDXӠ6/D7?v =%5 +![|BYdz?W>קRgyh(g~Vd>} /&kk55~~ K|+7[$3訿Qv+f#aQfyG̼]+7.m;u8BN (Q?)c`7k9jieq6/~2,H ssr%.'{Bi'0Zu;si!;s܆SZ.2/«ʶ(DZXRx Z? ?8&ܕLHև(f 5uN6sY%e+uYJ]9TӉ4h.@R ?H}o#aA[zd:  \sA˃[*MqAH9ƭTܛݛU+tg6}u9Tk8c0 TmZ8ԃ]p 7I vAͯ~t\TG ^KG=d=bW,˜[:n{S3G6[mΖzbeڢ9XK ȬO_w7WJ(ǚ $!i<=ہȽQj$9wIV?lu!I9ɡD!*3)FLx 2id(m]MAYv}vRn|4EwgQ|Q7&ARl'ues_HIE/G&@|slI$hYL55fBz)'D^6c$Oo~orZQV4寄(" 9¶9d˯uY궨C"p?#އy_>.{ #w9 FU WO]&-{skɂ%[-zؽV)WVH;9ifjL쟡Uof-;M[I6d6J] ŋ;趜.V)eeBR zƾ8S7<3V.9T*o*x.@S\u7rԭ1Py|7-5Nݻi R=9W_ja{hrQ4~0Oo efNH#H|oEZvI6C PC(塀Sϧ2*#E[v?Rbc^C{c6ρn);n:$LM-f}3꧈Tb$PT9cdll`*UBqB&nmVKoE/Z!k!i__YKx\р=˕4xSU4G4LAVz~@"DmOyXYSh9&E^i<|Р,)B=dԑƹTTz_Z9SӬHiV1yjc0kpX"ǜ@4>nKH`V@JgH\k1oHú^LĮ5uCMz'LyM:wڸ=HK[)$ژ0&ᅉ5"&i+!"Qb ݢ#2O( 6px'ÍyuaxC51\~ ?Î+mSmȠ4 ?4u(xjQ>wP1XrpT5feC7.6PeA ?ևȜ>:RIcv%vAn2G:Na\Z~]yH2pw3l.D?W2Z6r'`xl:^@&}E3ެpoWXL/Tɣ<h3&ebf <;ыuBH xw~I~=*"RjLL7Z޹YblC7S=@3u}Q"I^؀l g-fٲE;JGS.lA[p/w𡉶ޖ0?cAVlQ]q|6}>D́7vŚ5nGhfnyC2<;BAޢwǵm3GhEeYe%ugG;P$ڒ#Tʶi7j'@ $'x[Vzkp ef\xlQ1h^|L$ȺFOk%)'wObK*>7jHU3T_p9S]-ڥv;Q;6P@ݷmw"7.[j?a%P.@㘺6rA@Fuh2?pc8~ΰ!QSn] ˀLoJmc*{T=GksUCw>9os%LGg8jqO` )ޕ ;AOiDU@BȞlk!q鐻ZHdNֺgirШ|lVunL_m|%V'i37Dq{&zxz[l?9VYҥ"/˶^P 7niqCnSa$#k?wq I[!2t..SDӹAƳt*}( !\67of\2 x3Ӧ1f4bYu%`0,^Ge%}$ٔ=~koU5AIr =gu;@>"sNk0Vǫm-٦W@heTV=CmBLr?>YĶZJHs> &3C> }NS0C{'!}C,L/峞upcxv/ !4]JCl;A~_{P= 5ē2~2xJ&Aԭح {p;4فDȉP+ƿoǩDC=3ntF jk|Z\*j0fXDKƙ˯QSn 3L9>:ԪsFqpt[_RSHؐƈ5gLTYl 4jY8mrՙ{#eд^={1ym{B={xVCH*sDMi Қ192ܜӴRQf|bVV]I69_w]&!DtB= Ԇy*~"={;8BUKR= Yv{P-[XV+λ$LI0!&$zP0Ai Ȁ<:6c>{2fm86=2^7.i}NYZPu.lfe $KN)8V\wO+. ܩ[F/ŵPcfxQQGdl㊸w_GeEkjXtUr#Ճ2@WQR}l^֦vJthU…k3iDqaEľDvg88Eĸr7 <'擋-:0(7}7~[\⩾}l).~]Xoy‡E~ɒ*&sʨSs/IW "J?Jض1"I*1ɨZ;6vҞ&1x ߷>ދRlR ,(BM@bL:]M-n}9Uu%Uo9[t>-NՐR7. bϞSN"ME;N;w]l|/yv'>!7g`z  vʽ{cs Vs{<׵G3/5VF FvGѺPI" 9 kg+*r92n-;?l;/?9yUij^%3窆nb{7U+̰ڐϵJEx 'Irz-gS+FbNx)G1yL]7$%`\M1rAwPQXʞq6/R'Quf6KϓY! QO Y>)}D4ʴ@PMjSznهQ|J^BfjOFt?Iȗ=eNWB! ؁c]<2E Yx}PSy^g"= xg$ U`Af783G;mYURp̫b%h}\fm( ?1(lJ))"xE@Xj3,֔xGO*gN fCy7賝io sUlszE6FrZq. H@'REfW" 낎-E!أWWƝ.[ gDc=ϵqϒaJGk7BjL\L- xniގѩ\݌ 6BB#ݥ)-4Z欀0-bsf0}dY#!I-ammް<ZR!_-$1踴СUmb'l"ߎG x!Bt:KH 7o(Yy$/Ր} *0\j*L>eӁKRiZ/׀2U'7d**gڭ~kR;@ #x(f{ّ7;̀^V:W/6 eyt"˰Mo2H(F Qn8ntNmC9*hCg x- aH;?7/ tAl提LkJ8 'zo!2!3q+6[ ӕ -"ce0't&4ꌦ K>w,y-yU> [ܠApZř/54v8^3=%4p*s`Ւ D+ػbk #*׬;UKsBNi;r8]"0zӇ?+1˿ ݐmh0l"5\W5G|ThyR͘y5ƙ+#иB%2+k<섶υjѓ ꎵ׿9j^  dLGy S,'dyĨn? T^&&-VN^]4ږWZ*ѿb/szY #"IP- 8d@ǤjJXEݫU),yOlקNhks#%tYK~ |pocV^EP ٶV)hr$JҠw e`#&b2|4-ѓ&ˎF,AU껏zE rRqY [4ԕaQ~EQIѐM&7;nuk-Ӫ(#V>NN*ڪ4;Qɶ ieGgz˘#@l9O!m<^8c,MDʎLI5J-D d DG?诏=rIyb 3,0?\;,XΩv⧄qZ;J?$ {%rhX>jZG7pŔ\Q;% N|YUbaTO]@_g'%M;aՋ rZNW|bU]F: VָaZ9RODp1D$\NώԘAGϼ?qRse\cx9dbnw\\b占qTFAJ~54udƎ@{ @ܲ+j)ѳ<iQE2qusAM|HefV^~f/oSt`MgaU`k>vRTG#{X%p{1"VxX#urljԗutXKo 7I2VK`t( YKw>^__hAH1YN/>A:";Jc [`7|BR N{J=iҷ u/:%IvG!@K MoZ:ޣۚc*BD%m<-%)S4>@iNn •A Ʊoǀ#V}V#(1$CCyMc%µ2Jrz ;/y@{z1T!~us MlmxAn&ΰNP-04?\p?ztzplTe4gWe[ HI*OzM P Uء#iF ["Nc& r7Hl嗜%/A#5'Y,@c$Kxq 9(er~)0cRTJ`f^ϋTf:v&_1N(m"`W8-Re8 nLuz/)hg=ZEXd6b'77+!psrJzkotɼZw"< q+m払Oc;@S[isxn(:s{9e@Sǭx+t< k3˰Eꈣ"kCf܆vFX2"oŨoh2|/NZGs 8 mp o[ؐ V%ciz[6,c b[ oCW$}sW $YBJzl?֡ 3.)f<1~Mo'+7l^[-RxɘV9r?#β.n# \`d 0.OO$<*VĹ+k[}ܓJtP* #C_Hx{ofaq#%5|}miϥD@dC RWpiYCSõ A1~.6;J+?ƹr@?Scg'D|xz81I]-3S Dy_bKȟq)m=1P%1c u'ŽrGs)/+,oxvb1Ŭţ)ZF<( qhͽ5)9xd ˾A{ 12#Wfg6MfFw= @GEokMZt0ܶ 1jeq|Ft|SQw岡`ފQ~j*D{SFbF@$q'ٹ>>J<*۲ ޣ[usJ?9ZccbԮ+ΚhTJ vnQ ,q>6Fyk%o"ӕY&@||t[Jc3WzMQMōk$NuTVGkKOa?PӏyX(v3{]i$Iͣ*w. ulLf-TqHs]GLeW =MVBCėh@~]wvln_QѤQ^=.Rvk֨M#|W[sSEᆻD',lE^ Ba Cʅ٧$u;lj^Z-6 OpkkŘm_:tOS7o}^h4ڼ۵ZejU?oHsl-bG_%!5i`>oZ8%Ae@Ӹ#v9[koR)HR+PH/w5Rd)^]@Yu FW vJ9r62 ! %e>ZIm(&7U<)P <ɦ~8=ЋEPj 8%u9,zT79LIG?SRvqk=jjhJ,D>J![ k.? Un[yrgK[^-=n0qG!SYLFƬQlb&#=sjC8jH"B0׸%6E$gTx7!08gssnznVA{MzW'oci8_(+L_ 3ư#EEJfhi;oMypty &c8MCƱf9w޵*\&Ңk_[ V-[FHv?r9io &oq @5+5 ATf/hC gI%& TsWQHr_6;[1I)?B/c0{:8א9*׶"O7!΄l^,]jq@w'KYaL\8V,L]%0UJ^c,qS1Bd{}bDGzWkCԚ75XjAKtőB@.6\KS0d%s殺}u43(!Gq >r|<04+tJ|3+b֯̽eT?KKfpײ\>CCXIf!lAW8@ן&RDQ!HF2d@i$v}ccgԋSzON!9yzjzB߻A}3d[rjI-E=#|Hr"RwϮӋddaW``9CI7#_GYPi)ff?ߔP0+‡eh zmB77v"VHez:}08준IaSwBީ߼ y}\!͓ӔK拴LŔu. DˍQ1DL#$Y$$9k ޕ]WL7AoYz  \)V:d@ { ,dO &Gڗy>܁=#kqzr#x.jjk͈NNtOsKԯdm^c=a;NchS>Eu:Cme3BtaI]K#&nGoN#^ii;u@.yJ@|`]spTLoHM̉s3AVg@_8F1n{Ts^r/?Wzds]:q3:,C||ɚvn:dZR0UK."YdqmD7~EJOf{:hI%1@9ŧD%ϝs"jfmG9.ɸ(aMc%ӝ/v5F'kh݇$~W[:ӧdaȲ,^}4-_FaP=mu;C+v x(&j"T/D&(n}}FM>mV(~uR0 ^`}SȌK $[3h19e48is:Wӓ {gt o`Lq97MdwT]ksfqDɆ-)p}xM-洄EkP źqH+uma뻌>!7:nֹo{p; TxBY6:Up.oǬmT+޳z0r Cd}"d;jeD%`KC[xAo#nzݬSA=y3a,ҕb %ȧqAEݗ]`d^*tm R'3崓p;Dxh~).r ܙ:BLnX ^lhGoWe퓽hӂ\Xf-PrB1XEYӱe> yvsW|L.wqEX7Ncuih<&_u*MDiqA]_i@Y*C i^0r '9h;d:;gWŰΐZ/Lb&sT/=Ur<^a(jj;'"# Lbof;|*ՍdFhA,CwrQs4Z?;G,A(A3^F!<8Rsq[es+aםl,|XF%rDn=1+fKCj*µ I1fUd bF#_NSw[x)a-83Q &CjQZ|)ڠt颜] +pm7V]- 6_YP W-\xMKSΐ};"IIh5~T4dW,z T|dՓÓ`~p)na{OCEZ$7/:rBS+e%4`Ԍ<7eԻ!q!Fw\8G6(޻pD[ô |G9.-DbvCp BZH?I?W;v?YwNms_fٕ t-0@ qF)㟂cHk@"xTQ9äZkˌx%nWٜڐgg]I*wj3njzT/k>;Lj `|b ՙHtγ3FS5Q"bBfJrI]K|  _ilGY6GW嘰;Y!Jt"C"?vu)Q:Yhhuۄ$gs{o϶y2lI*$aCjj(FX|MT UZwTxZ!Rpxg1zF}'S3/ AL B ID3IvD տ20{ UeWgNDԟӘԕ%sg2RS[|FM =2pb5ؽΜJ8*J<*h`B N e(-Й{$h zABOKtG2 6b$R|= t}U|g&C_Opj D6M8 F[g!;ɸ3 0B xYJa}qi<B)d_!$;A5}yNT*`5 X f|ةl xK+pF1ZAFl'R&@֚""bdPz#D\{Jm>>3M9bAU.\} BX!vfj@#vbJ|Ip)4vИF' ).8Ր챣QU#AyӪ,V5 ̫c¤d Ubz)ҞgߝLE:+rVv+CՋ\߸w=Bj0Msrv9xe.gM66? ½^E5K%;&S E:!>^"IOT8`ŚqvÃ$+AM>Ae_Rҙh}Dtt4Ax,Zi`}R&9`,G̱vnȲI8H*QEsR1[}K's*)QA_htD v+[DlO0NQXp*i gG=ٖcqa?&<'}.vMAts#IΩu0TI IىhpL+u^@=ON~`*N@mQ0O BU[]C 5IFMU :%|ht_|*f^'Ț=竚<)!H<&_w .jld:v{LNnKT4}]ٙS#9x|JL"ѡQy-.6a.ć3z\'Jߨytuɹ/}ZQ pJ+ xF8EZ@|ĊC΂C'!3HFn.2>![ gW6@*5ަ[~;zvQy`l ,s?&|!@M߄cyۮ5(0eGJhL-Y]qHJ,=x芷;m]rJSJѩxJ"71&t:Z6˲`V^PC;v3Ay'ƚYmAo.8s>1@,k1ڣ3wu=x\іMz$/| [I q\f ]+7&FOrz$X^ARiqu י1kXSU[^-*]͌n=!H8[4Ƴ@7A7D٩ߤ;8ux;{[3LI",;:ԯMWk*I̠-ML6Xҽ/i7uS0~Vqzr[8B֏?A Uwo\} x,ȫEXXcük^.4>,'4k !ڒȈ2UDWbeBp'צ?){WC ֎'.X]+P4z3qb"BbGӡÐ%[]y{Ц뛔=_Շ;.Mݨ>E ,Ɂgt*2sb:L)M&ZC'Sx>{ \bӁ\n^5{훀f& ̆ͅas^` 2^Yg-T_Lہ+(TP$sP^N j)L!$hUSd~@Ю\3k7nx{̜$pCxȡ0$7Ոxkm"-%ݘL{+/i4go;!NA&W'@'X$G1,udrzdQp*?y%gA]׹\Xk.I`p,H.{0Y֣K+OQW(^wx 5j-{ ymTk)#tbz-V׽f2 c6i9-Q>*Mjv:bR-Ȉo\-~ Y2Q-0YOP$ktI(? @(P|#P[qO%dPЎISR#|90;xMRY>oQM*xʗ!.hz֡m(Q6l-/)qha}| !j@jT#z`jDGz$nvK9t,vYz޷'nfSQ4O}m`굜bb[oĘ:߯c}P w2UDe8曔Az]gkݢa6ӈ+3@6~O./zFoob~qy*-# J-~NGK97;7_o݈;hƋۦjCs@.gw^؎$L&BvBDu] |ҠAؚuѐLd3ϩu[Գ2h.,!qP?Ԩۦ8􃛍 FQnOϙ!=Z9'Që~^mcuZNt 5'Pbmoߓg?f7S ;H+&b᛾}$w#$X`׺oW rWh'ra, }i*&Ŧ᧲v8}7T2l^Ůuݩ x,H \tp7dݦ$${Ea0pjdD//= 8o^ "ذlU?> 5/pѲrTF:UA0;q7\AQ^u,UO~;BA ''Rʡq/Mhj:Y3$NWzqp)66!w?v_nA !ʚ OAۼIl3TL Y1r7X>ɣu0J}C- ߼ o߲}In3䛥3Ioݺ5#Nmý$$&.l{:oU S6%-Nj@8ƹԎhsDK9}"0GjQt8>#)9!oӈg|Dxb68&Ԇ NL鉟la\bSLT#ZnKh1]2> -k_-݇]B}nmWS&'Mp h%8w1`$9ж`") |1-0k[GsάxS~Ddܱ a7N@c.((`e:~Sgڑ0aNMZ!{ae͐)a( IG ÅlrZk_D}CWO-6ϛ }x`w6;sρvLgPυZ< IpLPv_H2F[mD`Rvs]/StAWֺJ7OʲNfVc>6a|u.OH@y - {a;߁mnD7{qjƗ";ds%j>;J6 jg NTeT@ʿSd0qJCjE &/q6R0LֆNڈqtR>`\A?gEvl(콫}PC6&)W_כe5oꁓIʨ ۞qQc4,!H5^X5긧3=-{orE 3ׇVqI|%Ak/H[ϩ0 5"8øG]/ɗXT$TgkŚ? 4 bzS Q 27pFqDg:U06mdgݔ5ܾ J@s4qKJ7Vi '6;wm=՞#HL}-sG(9jb4eLz,Mp=J&а33~rsFy.F0uECV>4kb1L돕~gkGS;l~qd7?loJ#zh ߳6{4[ƛݞa[]s$C%.10+mHŀ44'FRG;I%j1OX=>! 6vTh9nH Ȋ|Iof0Oobur^V {eWS ]5zB st\荔 + v`5i/NK7Q֌~&g#TaNPlq+<޸$ R&0ɇ1җSL_c#4 2~88z)-k\;usaUuݐ &cU| nKf8Ok?h[)-ܽϓ(~@8ܫ2c# M%i==N<4 }1`˖UHvzq9:so;b]Ǯm-RtŒ[>>'ί&E _H4ck$8ǥ#+d PgT U&͠Da PZoܠZ:m0iq!ĵLZFz$W v@6տ8 nҶ +d )erS{dfvo1SP&Wc7 I}nO?GM'Zard+8kR'fvzP|"6uC2OvN [/Q:aq-~bx*铢,]D!W,Ce0 l"OThltɜl4. C9G[@: ^ HT܅6~T#lL4S ]==3PKi8M1O9/|o):3AI6 OlbŬv9$ŅiZ9iri숈N`d}⚃VYZ&a$*vZXT58N K_iArJ`qQޫ 4i3C'SlgcQFTdO@sDKlk-B~,1!CDi܌$]Mrnq "$_Zmsi{4dI##DBTDHv_#:{Q|l|ڿ [gWӕ;:ps+;P[_uMRtqH q3]j3W%2IPJx@ڭYڞ Cq ՚ N`uZq8.a4Ȭ́f* ~U)^oT1R(qFkY3D{#I-*u+*AO kR רM)tTeT8^.ed^ؑ+s-/!ԏ+iLdB/c5!Kb"ڊ.> `?Q3$o@Bj: ѰZs@l =Y{"aL{/sQ!k)gx[d\s5&2JH(fM̈뉫= ĈX K$6NF]:i3mp%C>r> 4 yl ZQY2΢* =%qTc[|l_ Y'ppy(3M_~"k)R{8\_"!4!$rM Cod}Wu҄;r<7ö@\aK .Pz8z:w%ٹTEXXTe)a?**ԲX%^ C@ PT' ^G490+ Yv~{VLv?@q6YUn"`(lI'ӏmA2&iLܤ;լAf/ &qG/̹l39Yt ? H/|(O@u xs5uHaHq?0;vK[kܞΫb@ :*KaʶS)&$6L2=O%ivWlhh֒;ę],a<=m>(cˤe@eu_3*RP ~#qŹrVҶ20 ! )$;e`^ͬ}⎚Qj[`0,_{#)T[~[=AHl_tbx~@yIbvӏ{x{m|Rg<Zg06b{%D'+ɍ[ 0>F}g%zxHo}-]RePh@)9APOAFOR@ ;37@@hM+/3>3^׌~l,N a]*oMgMS DfDY$ ̈́!VC#_i.yݫ<锁=ߛxB|r[NvAx6rP$z<%Yْ"&0fP Q5ó_ԢGYnZaeݓrmg91`%>pei i8]J\iT!vtg4$_OUo|1- ^"v ;`wy&p#B pp&:#"4i'}8d'~cCt~v݃adVCI< ^Xp)|)c{lLJRBkN?B$ 1ωW@? ;GHj$~gKԟ.5NJzU|Թv0_95Ibv%َSGAB")o4Vϐtj2a %x*j; z pUx#=(LJt3![Efцg>F6^Y[XfuETiXGhq'}9O3GJp)S$jF\n;bU%:/s?}ot>mv[ ~TVb/"А?4@IW=D]JՂDY稹t+f% 8,lS^~:!|3[@B(w,i+NΔXtHD(uXdDt =XC0xmĐ-G׶*9-kcF,Q̮ t,+[$IZL2-XG_$ZwZ#h5@}ɵ;KHI(KfU)4R1nm;SAg -ٝvUИ ;}J/VD j>SR&Dg|qxP!ܦ>y4yڕЅgX[JHY"ӿ1%'g`_XeSSV@Sqv+RM>Q[RpUPZMdd{ klvLk4Kl׋[hU%#":|Xu!0$63 ʼnqSF+6O^A5L'Dx3[}) Ƹb>&?,B4`$g q;Vuo'<Å=g5 WMP8pSyM\@ dؿ妧 }}J~_ErV j -_e} [#08{Y2FsN]CKVUv-hY_l0Ⱥ*X3MO,p@s kz&ab[oLeB̯R7]dH}#0ԪE3/+!eIc6/`;=8#qQz+y [on?{9QLrėF%&)ѯ&IV<&`6ӷt go<^KFThWpQgA TD8sͦk T^y`p6uw.B\LcD 9[IC͈nL|4~cZ"S00F9$] <'fVf̄v|ʜp`am,wgcQJ\O<5_*5GSC3LE 0%79x:zJ1jo\ozK3dUESA&;FV_?֔T/}Y!Qkw=NtDT[9msDJ,V]=k+k[TM?5an]LǗ,yLnD1sS҉)TH泰*HK'T6" rKi欼BP22qP}8y+xG۔NFx]l=SX lC+%\h&. cwQfB Ab`+<oNW1 Z_2DY/)ЄH=A^v`&SK.[KŇki?p֥=z\x=D 4pvQz&`zVK-eUg>w>إ|bϣ@SlJl{鋊(N˷ I{p6H,.'% ҫ4gl.kOwĸ?MOz7 뜟 1  Zǿ퉬?ǧdAOg#3Z)?.5VNuA=D:WzHÕG9>%ɰ2W^~f6@23&yvs˱^y?rZs ;CG)ɖX]BpI['C Th"?d,ea{-Kl\*/-Rr3`93frqjqPP弢2w;`La a~ǩ#A)*U'\EnJVSӕx^a^d?kt!c9 i;&U_(\ZrNSْnP&X_6پg/{Ki(dW6@03 " OVbYʍ"%r?'kacn Pw'}M蒿~ʹF ػz,Qzx5ѾVz uIٗz뷶G2̒  9P=|[y%{æmpxzn.k| s2 kq^2];1DYm^1ZggsTx-= )*2OP4AЙ5} Z@`絪;\WkpiiD#ϮmҁfŔn(hٯ'C2wOŸpg:XOAl> |5ՎJs#!ڨ߇:n~ץf {/e xW6Xf+iJ9[V)khʧ>@uOw# Yx9Z.>7C_O4'F Ф<\ce;~R8ɃL[.}{}ʽ{KPT-2 e5TQ&dB{%*6of<11"~MT"*Qi}Oh"ݩ(??KO w˯~x3I{9>˟l@B&"޴g|ef*ީ Pn} 5F+l@B-$ݯ17+'>lX|>I,%Uc07ZMz?> 4W.t1?Ĥ wm7ar,/lyNULlh &xSPuJdV&VXA ߼FvгC>\!#COJ Lz+,qp}מ.-,Њ4axGvFa8xB=ṔsH (fߝ;;=06|X@q78n!q2ۯ֒M)<;&}f&!9BW=oŢ2Xm24[2 qcSFշD)r: V*\T:o9SpCݎY3qy$ 4y ]sVmGuYEi'7'$גlwS]&$N+wzz/{‹P[C*(VuvUð?M(h+8 ?*D)LgIjh߆KFEFRrW_fˀKҭHH6[-TDݰ`r)ߍC\?5A@5o]mMއ09Zw+6Щ3 I422=U2SK0vTv-zXs'+'4`(gR_+"&Ŗ[K Rjd vyhK0}B>_|[|75aW,mc }׭ݮ!hW9[Z9~A 9 G8ʔ77Oސ\WL/M{fEh;mX"->UE,A7=ʳ*^N JUE{;I'UW1.1l"O PRS(vsI;1|O:޸#+7NDe؉iܸ}6،V *sLxB{"ir.~6|U;S?'KHsÞJcr揞1A];gGB2Yu3!qvS֐8y-%zay:=o!4_xbZLv16KrƄn~@?K*[@?eaZgC_Jd xPH$w(DdDw-<~H_K pD|޸)n~/o% 0m%@xv{6!x}O9::9XaP0ݛxߑL>P8n* Njf> ]#T '1/![G"gC,w54a~WmeXIX-b\|cbץ4|uѤקUߎ&a9Ԗ8,d5Sy6>}Gb ٧"0R_l6{۔U$M6e2%y։.S}yqtzxޯf6[B\Gite-Zgn͗Y?hwB7{]ID39EmtsQ6)G#lCaŽ|ǡJ_{~2$nFŹ/c,AzyE)` ZGe&j'ݿT:MDasAa'3pOAZۧQn.>i΢ט;_zyqUsrZwԞ"ѩ!ਝ50dO.aU/ އY!ԁ#ߔ &LzVJ/s؎9\4A/TR =&d^% W>γYTqu4D7{F#jǔC>3b!n͉X&V/!xֈ7" rG>KIgV{sA)\83WL4*IK?ζ@9¯%u`FEiֽ,j_BJCJeE f2D5Q{)ot8G~4Jxਃ0NA?`M)My$YqQo.^6o+f ؜+bJgq)۝@f* xt1ƻDr_y?,DzFq=.9LT3-JA #e3O'#u8gWe>BsDľrR5o.+yIbjaSO}S:yo0' Vm 㩹Zd-uUø?A%c][ʭiHCs E9DjX/c/ *?&ށ/A(Px$nb\Xtv-CsZXԗcphEMMJD jdՓ,)")e706R=ߵm(/~LeVP4HR}ȥ݄1#\_c# b}K5 z!kkp#q*e X>&7**#0*@XW (Ფ[-? ][ͥwGB0o0wzh#!% NGJ-Çlɜ5nI\\ġS qk4 ?j_r>^Ta`j腮dpca^~ymŃe "%!mt%RD BMEFu9qad$DME>Aul.;dMywJ@odIϷʾOFI0ﾩ)QNU*=Iwaǹ9B "΍BNQ&xv"W VI&')l_>&hx6t:dʶ1je5[ O^-aPz8;MBu?jVq-u 4iN T=><#M3IU!&fL6+G\Sj!'k4`/]->:%09P{$(~RUO'-m&%U]wO`5.6ewbp7w3dw늷]2%l҇w"bX wb#R 40]_ EH*5uM$:5ST\L@ i?ZgU8eTк̬N9fd!I->FҔnK7v,c.4B.X"-ww¦DH?h B&;<;6hmK&huYYG[`ѡs38{$8EZjSPhtic5tsh<(jKWt枈@*Ahct$\4Z|(ˍu-.Z\8z2/n l_f:[W-Jʫ:FIbd+:qoхGlvUym61KkݙNIk?lf_.tz|RޒG|J+ʛXDbXCRb_K͸R]y_" :<ϡduh.Py4#Z`KuDuJ#QRv:VL}#9m, KR8τ\)aP}x|v"TZwϩ0 ="dʍg납W3K`?c[vm%8u@{k.'xVLz*p8AE(Ƃ"[b@>=!4/~dǎ!"6/R{BVp|F& ꠂ4_eB8mJ!E.9ܖ XN =HKlȻ:]!ێ~ N4K>{n.a/=@YePby VZAoAJ,X/9獼yJt -HH1Vy ϔ^<34dR11yG#i ew]Mѣ K5Wk7Bf}JZh,$ߐ92# '+\􃆹B[>>Dԫ\S^/W5&ݶ,|JN!D[7)z,V~PLrXxaœ˕O']< P]*qZ\Dx:€H;Zdv9mϧJPbx?pSww\@S.ڇ❁=Nh,j9r۔4c F&?Lad s~o65puW/5 Xi@ݓ*iBY[惕|HExjLY}8Ξ}<GeۗB0I;eH{zWGpGUOF2c߸hTE#.F'uF7EFֈ)#U~O Yu dɎK(<и~zye{dҲ{N.^c.# 0tM~nKh` 6z ;$BݫJl7TSd~{"|F[ ƍpƎ x/ٿ,X8,VwWSRQwF{"4Ng?V4N?@; }QVTL;\Th=%$B,e6׹T ,XMIWj:cO{=xQ?LJniO^MBl=ci/J3rH!ŗ5pV2E;Xk)$9">"7NېC>i3U&$Rfw0\BYpl6 DH|Yww2O!2C~ӠsfB2zh]^n[HPԅ߅ yi<\-s 'y_kf}r)0u3leq6A9VXVJ#bEeJ {0Ut7dDe~>T9eSB>mJnʔ26j%zmMh97on#O}rw. s!91E;;MD8$*b}FBKa셶TҼZO&FRC#-?#\%h&/t2XZ2`EK't cݴ@ ڭܸ ("M5r“rNX@LjNVZѕCs؞?K$INk x& `+A MAW p(3ljS;M (d임Mֵ޹XbIMLhɮq]zY33pKlxc4y8`\f9qŰ@ )dH#^/}B`Ɓ:0}kEث!$x@Ȭ P)ާ,RWY61@߈)bSy D6Prnݵ0*|g R*xo`8av!\x95_T{M9Rre76AuFK,zƻd }h\W?D z \2ZD'u&`C-i,_rϏ=MGŝv?ՈB'; y(8Zu\K{Y=ߠ3U Vo<Ƒ,^M.;ҺtJ%l5RIL2).P8b6Y%lq-&\-վ+-%**h DLٯCzR&#ںer ;sLʁ4@K/FLHbLL;*@KTX_{kT]}Hm7sԳ0\p[W0`LjP^i՜ 8E]y7L$xQ+PT!iw9H_Cٽu} ,QbCH=V"t;}ݥLyrA٣;Ʃ29DXO1R-Wx7*Qz坲n&kD3c q&(_VX=c:(Gn6]eZ2*wHidE/faOv?À-Yȍ\M>8D͏>Sk/0m_Ma |nDDaȨfGW`LTO:65PNc#v|Ru}ꮱ@*./t\fy13#@&7M"b{KPy{ELMx2 I-~ٚ@,O)\3ߡqğ7\T&-r87.c'OO[2P) nH4"S'A&g>=-DYBp{jz |3Tvp vo Pr/B [1wrp>1ozp.jVNF=r7͋A%{tsy훡%6I;$9CGQP hp ^3䭧mwʓq{Ƞ.a+WSdUH˞ZScA rg:j ;_ _O5[&x*o JZG$XKEz(sfo &EW@P`2&-P͹i֥&5e"x?hQ[jyO)"+dGӖ#NQy`81Sʻ#&24sO,$\j8lMϨSn)I)w!MrH/8*&UyAm_ҭu S.vg(AiK][ΥC^p"Qf}g0%kC3i:/t4[܆te" G0pPn4} !*рF?9<'Cgeaz=E==idfEYS?mU1*pkԽiUD}mjY'ڮr2́V|7RF1Zĺ GM:91uz6ǯ)D]ax9&]J2 radNq9s207ޑzPV[.Vҩ{f_q8J.MU4;lYKa#Aq#&*x:|@B[]|J #t#]7_lVcӾ`cZF*BIk h a3Fx:99!'^ԅf%Z6K,r _Tr߂Tbx Q YRS]tӰ&QㆮJ&͏y cM6Y| dSS_ :ӚTz |3x]DRPI)̈́@"} J1o$\b>_ aѼ+(fFC -ˉҚCOٺQ(U}b-\B4μj;`Po<Ӊ|:z)'[4L͌,}Ӗv}l8BL/H Jva{9yOl#Yl*~}꺸ċKIl\c}]-2wFKVlUM?CHd+YlgU=Rl(Hг.|3@~SKN!$B+2-}G3%\~ĤLJgc3qcqlÏSܮreޡ$u yw8n[H$34.Fa=mχh= Yixf0U$%unN3۲?" k5-Htī4dhlo AE0 !-{n yGRD[IT/)6@9A?Yu XMg'P>@vv0D6B"cgTU{fBWj xX0\ޚ.S\#Nþf yX0J?JW|ͪI01}lT|e80mCJVb뱺ڌǵp1BW䢒FpD$dP6Հ,1ه׳cQuWq5-#u|S]y4"W1 ˽]XRY9.JKX58']ڧqLIHsy(ZL83hR!Т; )әV)gi5Tie䳒YX&Lobf-f(D9Tx#_w%5i#/֢>!>&4;8䁑33w}JW5hɯլwpLۮ$Jtz%?/~u&!ԵNh%O jkZ۫Wj8 y%P}]M~ʗ%,liLã$QE"Ve5PK5 %>T*p M̿SyO8IzKB|$Ƙ̱[l=/gD s-Jܽw@E.S,fDv-pݎ@LepbۥHwoc^3/ۖEUIb7 w`jIp|bRj9mW@#<;HfxFo.1fa\s@daҌx&^DrdͥYFG ñ~Pi-mjo>}WMލ0\s@P`| ˖UP$ICI2yJYɱ CN(" uc`άrzS%͘GTCt sUܽs2 a+`Π !ch޸\9Txu,uĩQ<07[W0DȨ Wr,va v68kG+|5>%U'=#s*?֐RD;3iZYDTy}=Wa?dCU|*fi hYtpO?3 ?&Eԑ=t/KY>\tU@s$In(ߊ.n(}uߓҰ)> QW=Ov^2fhQ `_qՙU^LrQkL2z=[%bJDx$; ֶ5>ԧ0CX*}N(*sN QϼU[+Bn"fxM2XO}RU֖_-8vyꦝnER\q WtݙljX|%WNʀ)=ƉYW]"]kbݠ 0fvyb"KOjYG sKCYºzz>fNHj?V2#yY`6XKZmLC-X?~ 0vVFSdž ^IjL ѯ3pG(>,YONΊmC!GjW6(YdKըBTvkhLI"Fy&d]|]: kTh%Sx ^I5ls (dž &kRI ΌqnnO-7G3 v-]("3\yZ7J?KI#C 7eF$*#r <w2+/NuQ4̼dNcB'h=rrIs\.iǝDAŴ̯oP\mG{. ':t ?5_͝D3\"_53YTm &VϟRb"4AKR>Uyɕ=D-kCO/o\k|j 5`AމQ?ܲayy4u&vMtݕ:0#jX˔mq0 =3gԹyAlV"}'Ȇ0A=}z>DTOZX]K߀gM$٫ V+b/7pR~"[FqұX*֙s@ LVQA{o 5бP&r1yB.?4[[]}6a6폛5-G} °AidHs$EM=Xk\a "؀c1QQ6 ^_pxER&x 靑NTlWU{?sD_NOՎ Ѳ A}Jgqʜo aDZvep4 <Dnʸ 7"iTV%lrԪ'BZ -$ik3=&?Ul*.W`g#2~ (B7D=Pכ{/+S >ijXߝ=_eZYf`<.qYmracRl?yKAsf`oOi4+|ޢq2eK9Ĺ R%lVS Gc͝ )COj?3i4 wXGv!˷CLlN Wk,"5N R ^QJ:(G Q8&O bN>l0z##Y nawXRsGWX ncټIyu]dXYFԔ#1 /@bE.eNj:Isx SF?(ԗ jc[F~TPUIf>,+*.擪\ީŢ:RW=W/۪a7M 9 {!RwƝb, ;Ft+su$N@?LLKG@ +$ ) F))~CQ]-YQP`_dWj!K0̜ԦjY &EZ,&MsucqU䗵q/D\{. mQCyD^?0=O?x$s&i!/YW.XyQ+qQB2AmH\b$ІD[|-ԨAѣ˪Zw9OʅQa_wIw3B6hFr%0pVB'RU\ ϋDtkoZOE#M(Zk*2h%,!7Mgb?=ܐPg"omU|ާ\EDԴ*2tB0Y<d煋ȯ(wmXePjkńqISkT!x=`Cd5o&)'21de7)jBā=Q=(ڊM=7Q9^pɾ<!FՉ>xxNk/ĥ&7T/ @ -Ii߄sfd>$teFwyY0PXqږ`{rEA2TJ)Zq/&su*=I0];' ԗw!RUlr\w8>$*~mnz I[vfP8A["z<{JBۗ\z8Z&,UZiQm~iئwS=eV9>0úc'%&ToQk8 hJ`Dzb"v^1f gKU ImB("Rgy tr?>RBnE!_Ezշ2{ԟqf#av?m),Ň}XEKig9ۮr?}o5$` ߊ#^uMH܈ʷyE !hwCz`vQ^Fi۬S A0|)Bide+0t)6Բ$/y)֯F{7L2 M{ nʙϻ-\AױrQ)\a[lJXihsiU)N4ʐOW(÷T$B,j חr p`VE`e;w݂;aK|)8|lٔݍlhrsގjPj/02&me7(~f· jQRiiw `_&v&JjbtT:EsiM&qnPVQ/64 iT4X>(">WL,2rl Cc'0묙k(}cQpJֽ\JOAnP H<=u4f7wR;Gyd6Ws+Q*V^q&4|8_0X+b>\J^LI},y3G䫈n8++>[f EܒHi6Y8@}@P7}8"dB^y$ ^wy?ߋ[Yn"SBݔtR iN>M-`C9q k„ (w2 %>଑b}#Ӻwr^}zMEpgY%S7d[fWB ݿ9h;?X]cG=U4;afZe 1uFm(6 i`͕[%қlI a/KaNYȈnGŘ@^>j&j^*.lVyw<(Wg6ŞҸify5>5t`mȶ`hD[f0olܥw6R8,)`NJ9+ٽLRĒRD*+Ar= Q!x#֟,6ߘ(g+ケ~n*ŽE;-FX- lsjoQrocs~+1&#>2V e΃1ŠoCBu1`88ɕkI?[f-E4xY>TZ_?`qjCZ%GT,DAB {YsVsmB :Q;)\}=GQN`kzz2kPSj"J>@l4@%R;N=C*FBϫ~)ЛJIKg)#Õmow*0:9Z'< :6[DcP `&{nTQ/ӀgXKZ C[WVOv !&y2@*\?;)ŕ=`WF"Ѭ0֬ah[^ _P765ZyH r4QI` !\% `h2s~ʀ0&]IƩHXcMzٿ6"k`< l.g-٤}q;:)WœMaS}fs\E6Sf @s'"/9˰]Ni"#Z#~IEk)ypB]s=]jTOTIV2BĶrCsmi-V.UX XVۂ[Om#(FߺjS'vEAœ3!څ7 qVUi0}+U(^=w bVy5yCG1Y}}<]dfrMxcE~VYbmL/g[n%[cko h!!IX򡂹no:hCB1L'h/])wՒ\k9Sֳ81M%fra0"f#o~{;X<CCfɉ4.g`oHM:g2TA (\vxXΙ9Y+ KWO)ݼO~ as,,8S5'-,B`%zadak p =WX8v`BbDV)u%f4 u~̭#=rcז,Np><帇+{_*4"s*Vj3QHtN@G3Y2~owȨtV-C!طByNvXA LLdL*4+ (D띿Ŧl4 L b@$';./.bd Jp9]^;f.[7p.ޛ6*_U+׸L6tJGs׮zx?8?pp2D_Ȼv=y3w19NN(&*Z-L9"%w 1 _;fs1T.KpNFg]dHaӁRɧ,mKE!ǣ ܊$^`nbjxȸ\=4MEkE%P5Ɠ5.!1cnNE$'[S00¹퐯c$JS`[ Iɷ$Q[rg9UC=69 d8 _D…_>l a r[Tj_8Sfu%ip6:'*&$8LJZCSkm<[~S8ezųV ^b\f.ר`m_o6}l*h_Tκ vN]o[(X{ e;aM 1=*4ElXʥ6Biڃ .K'nom5nφ۵O-w;ʼnqGwv%$VHݽb7B+`)چ]>w=eshqzbD_ 5A88\'&~`N#٧jqI`! @I-ˀy6jBI>xƇ=O$%vGzR7clGRDhqoEH{ y] %̈́I?x/we}qXMEt/x l"GqZ-Hf2ms_:Uۻ¬ZYf~QU]0t$uMi.$dŨs671ͬEREA.zDAtMF-N𱱸OA|oo7rytӱ!J(~4ι i&Ҙ[a#pS4I1z=O EZ_|/߷:TqX[_w˲LPr]I_g ȡp6 "D,g<* 9GJ:*K aHw{{lď֯%aSQ65 ʗ_5*!92k'e%!G～ H& xx15 :_1wn 9="YWlh! !㨯V"ꏵO)Jn}#]- i|: /8A}2בmHJ #ۙ:H("`qWm[A!NIe4PM<fS.8:cmV2K.s7Oe!6TtQ_7(s7yIf &SlK۾\S&$C/*Xt‘2rs,q~:_6&$Mlx%+G7DrlMgs8wg+lG>H|iwb96Qjx- P :nKiE{ISn`\\Wh&QGPs^;lIzk^1f<^s&ם )qlA ڲ.k26QOY%:%gZ_^Bpl#3;3D=!xivjU _c"UQ S1zCeKZ :ĒU=KKGgi;V?͔=0 YU3 AZBoQM"ÿ 79*k3]8A.džhdvN]*KumB`}jca$4j.Q0qNg3({W}M $㜩Jq :U"KxKoVJ1$~:Cg[V{֣u^ %&,4Zs6wp&x7pJۗ$jPm90 wR!JI6_nt1"pw:&(A+|Ar1PbjݴPKB rExmfɦdsB qK' p*J{]cy a<汘1p('3>SXcmI6?j5, &|-%鐃Jv*]`+6ZPՏV* bK Oûe5TVG_]ϪSS 7UwWB ,V:^d݊<`bs2˖,G B:PoHoM }@Fɝ }&쀭sA-ЃQsM2hl!HU;rU\ ɗ@o](iM._;!K1<=5< 44oC%V:8<(x*@,2$s~)t/.~T ,aO _Mg}*lyaW|M(\= N@+'才g呭^_T<|Zlq a1&s S;zdSp hlg;^+ n<*evJ=a33HI\ s@9'tZ#J7{UcS^i*^s]r17j{c4E]in9Piz)57'9N p 9y}Y%1ۂu4!dkJy|~8UP3-Ck覒cSmÁT<[ O΃K#ڂP0֖3]Ă%?m۷1sC뵪?lS.s{]N ;P4Y!}1ɞDĎ(o\SEJg*b@XcQ}h,F-J|{2)XML wXa7bTd:}5ʈ Xaf:qK|7kG{7:l_{pj 5a 'U@g7^bUXIM-gu FO݊Ir ?8dw:f+x2 @ۨm3o j 2_e *4"UfrF%$@nl S:$!_:pIY"-efm\Mv΅C8>)0Q^*cE 8TTB7@TEfoa'^|F(,M_'PVPΙe=^z;5r@vCLʳf_F_uq6pTNs ]!0{40v7yQz.$_-3h|lQ,'`q>y7# etkw4Uq"T]+ \kc8*m `UT۽_ 7EtF{mM\Nӛ:-ѷ5S'xD>4Xy$;;)u7H: 7j 3Fċ;%%{Ϊ9ado`:?H'CQxzJJW~TO [IݏDV2t3RK,f$w2HMuk2bH[zh߶YO}Y<7I,|eSfZqX$zrLZNȦqgyωjх]lz@D:x)tʰJ(Ŋ͐=sU~Z7 Vс=9sEtӔ1(ebx3|9Fx7ng'SYcLq >>,">G'Y] )HHNJWoȁ6+Yg"uD% Ԛ|3a(K^8?B/(-~ڏ): 4[vOXBy2c_mkEA&fw'.Z=}$O,kOzl&aM,o\ZLxv|FY3IzKgw!i EtFU}TwlI,Nv47 TMOz\g2(WtH $X.j1.?VvMϟ2K@<رylיE( _:vܨ::m#/Gb{8ܱ =!7XC& mQ|rpYd] ztrLA=D*w$@;*0]( CJڈ)"t'J c  ytOKԃzf$Ylbf:dςӾ6;Z"I)#ib>uR5 "b Q2 sg[]NcVxMMM R qkR8OWh,ZAQR&2lqn<#r#Mꅜ D&#=wqgZ| ofV<Ⱦfe9]J'hy^,X)rVA)k:*':.-nQw¥l*So5i!?!c#q%)+@QAoE\Z(F`n6tlYWu_q5zdJkqԴD9JRf!ZK:h>hgKo fMfKfW $"R| C'q@=/ΕpEmH`;/k- ,A(cJ:G]ݶ3k ` zvu U1wcL}ăS?tj,ӥWZuhő8:}؎fw[z^l-[ \bxFR&iYGߺ,vO e6C@$/ZKs/Oʾ_[9CՊP:"/.KTTf ?@;4bU]=jȡR+'PhLG۲"G<r).ҾV2&PMcZZwu@M Ѕ2 KӾ(6Drj}>LLj54=} sW3B("[x4*]UZ:W$D+#ՁJR9}&N}% Pw4=0Ϯ{QD)z&7[֗%WIkȘG} RI՚NI6SL-ܶX찞:EĂ(R$ݮq~A_V, *'W~O-g34T_˝=<ڂډ׷*m#gÎcκR~8,q({ا Zs2$ExϼGl8$>(V5"-*^ɀ uvZmz`c FE~lL2p{Z&';V Ih~4R'luKS[nRqR#mf:䗸C;kONGUfgz2fS$?5T\YvT<Ϝ(& >Szvk:g3DaS&g4d~ڥ."ܻxϔ}V?moeIQOݖ럺[9KմgSN; dL;D+U{U'`0N"hxM%LǦ_b,WnF Yݣeׇxc * ݄{G0(uhNCZOmC@KizyG$$ÂU-48 jpOΥDp5s8lOyr$$<+[.Rzp 3 q"I3/ ,PKAא5c^I}DR#_C6h1x:plPv(tXu_^t8:> Tȭ㶫Ǝ/;Ow=^2(׈V$ŷv&[f:mYfT IC{=eJ4yqpz/ZMG@%Ң}YFx.rڙDbFԨ op,?c0mzIhvq oILd=$2 L_)i(M{Ϙd L<<[Ac0]!=k< iCuP&~GoPS9+OCDOhVHyʇ̦ ?1$2TZ5k!E&?ŽthЀzY~-w ÃH'szDIWZmY4 *TV&LREC<&)T8?%3Yu[/i-H{Н\Nx]ݐ7:3I & p ?sZE41;jLSxjo*2H$Pݗ >N"8ݜPM%r5z(+lH=GB rz`HMإY8~S'W&AyhRA|ցUo'ڿKsR%\@832%x2<ƙgBSC:tp-MOO NC>xѩ S6<, QO弟7r>ɽ9dkz6˲4(_Xeu(wέ/E߾Fa3f& ~=21Ai(Ի33?1 uGz↿+W/+PX QfVXR*#WlN櫚!q.mУyGh!J|J3~Hx.Pjq8ڻL)({>+/ JqbKr UY`aىKheDȄvPB^EsYCn"6n"@],0YҋA/Phk4d7LԗziP]l}Ήcq~G>*V=Ynnʝ).hJ'O7`/NOMN}( gS )i-A8?(tUq.b.Gؿ["UKf05|77yľ~I?o M4*. @Y1TPU~K) hp2%xwe9BEuk§ ;I}Å5|߸B5uVYG f]R3:)lb[wk䁴 ̬抭|s4>N2xH$(g9ͼJiI2`27HY@}Q gQp)ܩje*ިpy@g~hD( Q| A qfyw0,Ewa 3q5)ȖGtݍHJNDC3˴Dm齧'#4L7c-Xw)sUOֆJ׻e/'2G:$ C6wpW?K;.(]xjwqc!DZʌp_fKO[UМa͈6i|Z+gW6يYvVcoF{@(v5G<1}Ux|0D =ӪW`gF`ҀS )L$xy'*µhe]8.- &ZƁ,-@n>Jf9!VI="nƭD61EGA~yc8Icrr-^Nw3>ZԽ.j=DxJ=ym&/lJ^ x^^ p,q!# 5ڃKy}65E 9j<lj`m0vdk}1+|=c)s_gop[̻WY8^7NG4%YPg.gE^ʑ%B@'ϙl0P4 U4t浈nƼ_} ``;ɕ]Gd@$fw+qwožn\ H|kĜ:buMubq&B;V&vj։ 8@Nf3o#¶J Bvjzun[pqTqWEFWs]RBEx|]˽9_Wc KEPnlcL]9@ 7p5QHGXzêCu-~A]MW7Kf|6HuӅ|yGۆ/Ii6UWg&(mo|xi "sV7jr1]_k^}@̏kG!jcWSF\ŬlԲ FǢG]٬dqÈStr:vchOY{yc~0Sg҃t1kx0 ys.IB"k kFEO\P 7|)gfy󿥍b$h'#da?a}} ٚ7+5*9g f/cwo$@dKɵTDeBl7% g [4[GV!Z ?j0Ηyp؆γvsAHl_T.?e?0@G.(HW T7].pV ^]O':/קS=VK8p`lQ 'faJ{ߵPw1M.0pzݪ-WXd8<$*Uת fz1"|ٺhwm:*ղk,jk-ݨ캔ےn ꞶVbfSU2 s%-Ü(FQ[sSUK]@6v*9A:KۯM: S,le7};~ R!!SF[pe&D!^`Tv*BۘҶ[T FW͏0FEܲS7[ jH*[,u|IoHLʐrxSPG(kj (*nS }ml.T0Uq~: QIe,3P<IUYM{ÎьqO+,v&FPJi 7\\E=]wgOHC멫*N_՘d@ U ki׃>PDd>2۽)9^8|Rˣz.~a#0+33J=g0}: צ{9yҙ0JWb(e{Əkeތ4^QӢ"Ƀd>{&jYDzj"f⁏P[TT =[uC#ЪE |xQLMPk.XDM6'y7k{K7[o2F ȟ$O4K\&a;IѷJ|^f uzo!j1S]Z5{ۄޖzDs! Jø:).vSPpK$̾7m-!iDFq %+ɒ񼹧Di"*"孃t/zs6t!wĎtc,dhQaVH"<7~bP=g[*˵ghk=<_ V4 0X7MR~͢''͑do+rr$L1s!(/% ߞd*lnnMC )a]0ز$v' }c p/Q:%cO8!4Bь*豴TN~gQp0r▞5x9?)SQ~Tju?垠aWvw 2}o$'}Jg?qwl4ŲIGf,vAa".d1moGСS/thQ iͪہFf  X%[zrePY6D)"ᪿ:\L1.?Ұ(wYh'6,"ɿt}7i $ y Ouy!ܾtnۢ sHdҔОON0~2J8:EѭD7^̭x%2UJL,."8ڀVz;MMU^(Շ~ )W˫Q#z6iao< vްG'*tS'\6}իYGX y?F,S*%2fu0*1%Vs(4sI.'^ƲX { <-D3!QS%KNcұ{9E˓XKO :T `^')#sCЭg=HuAdPaJAP!HJ^j.좫$DG_Xcn(=t  \K7cv*xgQZȜelN!X,R wIhhdi]ߡHGta#=8!HkJن&hG@o2uQìu˝KlD#Q'>;.#!2I`;}z{Ք! ̾ 'Y=3lϦ͹EI|g|7mθa۾( [q^լoC&^O'0b^Hr^b5bM{%o7s eK[!XDjZEuV+cs? ino{qLrO80蚪:3k_or}|(@r$˜!5Ji鬶(^"ɰES\Mh=Ξs1m?^"AfyH/(Y j_,d YDCg;C&\ l'!ey}hIٷ ;3B1 x@I٧Ͼ.n#Z;{};h͌RRǛ 8>SXw"Vm=9=kX`M2T:ʠ7RkDpM٫*zB !w!(i(,HσX9WIL5}ĺd?jwݎKim{u9x+bƞ5ImQMFe0P+/tpnIuw, "E}%hI"w7 ܟo!v^j|$JE^]}c ht>.6<]D Si[IR c >,Vw 3>L E T6߫WO$C%zTy]%ZMٳ^gAqǿDS.7SEkV͹& )()@|`[Kej1 ֕5UQ$5MVQ+VlJ:) _ /g:y)МTN ژǞTfoWA>hoKn3ig,;ouv-݌a(-~|>-kȯ!k>-l~R24++h}MXouTjdSneL"&o<SbZYzPFǕHpQW$w;WT5A> PKO"`?^ cQBwnu[l-v;|\/;AQoו>T\IIuIؚHĺ9 xgJöPM+\J!; SUAkZ}'h<pFFARҊn}S IA~u$(*:{`VvnJfgWYqɹ{kŧ{;`E돨@憱GoxL!fck}eA!=U% cQt0QJ#4F+CB aFWS\| XDyCxm`"/! s\MMTwGl \ a8ͽRe "ZKQKe{aװ1&F _PX PYݟ4kru-#ě&IhXWܶXFxQ| 7_Eek8HЂ.Za { ;~ UN5:sLU)(E͝UMIW>48!ol9Mö=˹{mu SOW/ )H)~GK^z3cv Ƿz "-,&?2Ř !FR|,21a#ij~tD6yFda0"RD.8z\y4&YkRy0E%v7j~SPA\p:*y?;k7jhyQ3rkl}2t'CgNU@er2n=߄o[=RE>5/_[V<@K'9sft1)`ѫ 7V^㺅dş^th,>%Y@`7YS=BLq 竇M$gX H拦iCPb -Dp&KXoG̉UV/O+Ha`cKCl{oUV5`@vVzA#{4va=м?d8>.QCoQa T3\:=wdZ0^6suqii撎<?& /RO{e\X{!ہ?7!f7†B'}ΨV[u[F%FPQLJ^k`G~疴x= (Y 9k9n6+pP((vLd>Ӂ,O&C0ΐEkBTߘv٦L5t (>4 g?b+2`s.c+̪Y(Q-:2` 0F.H$`::A)F=&N@l3"ǽh)^Tuؾ$@Б:ƇU*G]RL*7imYur]?puᇎn$׮v\N2"<8C=\x(Yw@5E%2vy2m,Q˂Ͻ\M$'_>"F, [^&(idGNkRpýU| Vz,e5E{*GKVP4tjHQڪGC[Ӑ"gݯT''@'FyrhVy,ȗ(I_T+=*IKMnVZ;ڬaMhm>mK`.e0NX@Բ^ u3|)fe9%U}99P7H" 2 aOi\{дCaika.I^9Y5}߆Oף}/ OFB41Iޗh[,ebM-9FX!f%<. ޓ! ^B嬢r[~9ء0A#}w;SG?8J:N ^-s5T/65 "Zc%V`YV\οS/xex˸'CBK}8"g4QR)X{z]hE; kp(_9 &%K\oJ.ZDXsp*$?y1 j#o}@A!̥]ʒr 9*8 )! 2jÜy!G{1 n2_LIVgY*r}Zy'bO bbICjV ڷjz릯VA?%;AL_+mrI_"/]ADQP'ksluԺW; ڮ3E2ftЀ8m{x:Ǐr)jCvmnpw-iҡsd[{[ޕ$)YT4uIrxWn+|ݢx[bݜ%Y*WcJ pe3 9ŝ}_Bnmr8w[r6B3J3bZoUnEq P,1)d["<ɱrZCjx-n-UI{r)<[kG`\YQ ؜>ّ:d ~, PHXG5@n!7Ր6)2DL/5}p N}hM|xnEeN%NTqmzl3fJ:/$!$9wJSPЂr+xl1uRPe2Bs?&$:b zwS3f: Ŋ8lp KT7DBWr9ϼxFXprjP\E}~ҫf ^\ aIӂ]YR|.B=ʟ=\(]{ɣ&hM$W،yJ ?9mڃ6١] )M_s+׻03+g͜;4.SJw&J$zoQF$Dӳ'K~C<TÌo!;źE7\E7қh%FnƮs{T5vuJzXjIO 4Gט dCNUKA"&DPvntBt 0Ml4p"yZ5|"BNd?* Ol{ǝ484ӝP,dHmՇb{w<׵azrAPfƯu$*^wƩk1ԗt6ĺ;7S |ޙ<'ZSQSV 3T;ފ^-=w&pSPD~ > Op^U-4r/\s>YDGzrz&;,e(/(Sh*X]O`a@vkKZV&^Czo $de%1*ag%^X7^˿Ie/?OɒJbkLE&N&eY}j g3F9}&&BIrc$t5.JrߩHAW@AE!qvU$'h M'ͺ/М*DT4n6xJ'@ە_JXD7GY@B PSZOFz8G'܏]D]H{W"F"(j aS8܏@HS3M^^MM$GR.۟6D8:$!{D-nH콅-,:ZV>j#'m3, Wuc]B4pmx/M>l%"t ЇEkLl$ɞFT&jO5ooxn?ΘgJFA^;$88B]zwNz٪MuG$abJ^u[W*Ƿzd[ylvB,$ dD6zsЬ'pSGJ|xע=<Ӥ#}σ ;;kOpZRdS5 4NQG*?8Linh (f%-ą$Ӽ2{!FZqs?i1MΊ1+=FY]n/zً3CIxҗ9:D͑,zZY_']԰F3}j@hu'WܷT FM zO(^bF޹즹VObzn4W]c"s?Kg!5oź@AR2*jJ#gjr_d+q$Ł6ikktǸ #\+d9!³ߚJOfy\%V[\ "[$Z Ryq&G֝ItUOIp،僄q߯puF~Ydd+ːbl2OD=ٱ|ѽR?֕⒊ȿA$DOj V?;LN`Wj󛸰'Z6}^=lnN +1k\ScR. V'hn5s [~ŐQƐQnHn ;1$nmP짤Pt;9Fc;PiKq7O1^xx{`ye05<p-RUW>ae$tM=a }b9=u Uګ3tyl\Ū1lse^3oL o1hd2}P3!xԮ6gH Hf7 {7 B[6__uc6cӋ=K |cԻe&wF)%~pi ǛMML\&jQ g6zv;#Kf9#<(#F^ ݆÷WO\Y^[9=oBN+\2R1МH$ 3r~{~s21= #Ed\5cґ^5i2T_2k\O<>L2Hݿ (>}uQZL攱K鍪2re2Db| "uM)_msT`[qC@ur:"x%_rE t02.( WVSp=ҦLHL+0\'D7nBך΄Hqi<R_Hde?"K+V"=@QT6[i돍^MwuZm~Оy6dZDYc8'*+/=?*,W^6 1ثp:&MZtm8#8V8kƁl^0@D;[wy7a @C@6(C0CggzFA qqYΟ%aϦc'@wh?4u[JY6@]oMUFUk%8%|mݞd%~M壖M.O|Ԑ:^Q]¶{%m!o3檏P5#eL%їQs(nMVaI4h_yZ쉜wqv6h?G uZ;/97d@/D#=wnvZv^7X:b_7D5&룭o2 ˧UA:H%䖅K~gh1݁ʾ>`b50>cVd"m%Ԭw15 Ns pnb\oTw.'8=w6׺D-gLBTSkxuLy؛MQug#C 2w[O2uxJ@'A/j{ `#H4 [r\JXj"#x .P~\ko~{׫?p*Qm"/u1O9m-҇g144H@2Q3y*N6g | 1i!sn7̎`!U% z̷N(fEM; B,ۆ ΀A4C}ht6F[l+=Ò2^O"tl)'G;ˆ$krMZ> !tLJDc!׽ Ϭw%0|CWEU:gh2k~Ay%Bc?p_?яv~z!@ k i̊qFv̽ըna\VvM@G<d3B+ uN={4?jW.Nz7-HrB=o 9/w78i" DrAI`2FuYdQ` 5ͦ-W?Οf; #f k+%0mDjihwG(?IJ>ț6Ȍ<7tw3Rw%vf(1ne"yȱU72?;{CS=~J- 52o.xNOP).?I|sC%P`o)Gydbb!*(HyJ$=Zυ E=p -y1z<5x"l_5x^P ( D>4?fn{"c_~U hNXW} F\x^ZfAd4\ꆠ.۴9(wP8Tܠw`fQiWKx<+ (?5N[# OGkpg ņ3M}Ry9Sh8le hҢ̶ >>oo-gp7 z?RGo@wsv+t/vRE䨤86>6ϒTb^Pt6s:) dQU9y[~i}}M .YT`o~Bv7Xe-9am€O@Wj:լk]6+TgeI}JTQ@ϐ ,)O:SR"^6J@J> tEX\]#Օ#} M2Pj}.;0ɹ.?h Srcy}\J$s8ɏ[i ݓ h;,ڿ ֹXۓz] SΗhv0EH-Cczx5{'&3;0(e_npmI6D\q̞`lq U6Yb~e14IPNZv 1oͭH]" VlzL)`^Ju#a+T61x'CU޲, dPM +ɲaþ81xˬ_hđgw5 k"qy g՚ט6ʾUׯ p.{@{H (x&v1+t|])i~(6.O8p~2҈C~EwioLsr=zCQUJt5eTrA5[kJc s0,V_M$XcSL͚R`g1@qqUkq?MDݕ-V`Җ7&\z9)iak>5[:3l&t^+SiX%cM9]-_lʜuEvpipgzBQX#/A-i(&q u-Wr>ͷd\nڮ28X?EuH:kt$vb'0 w3|.Rs,ah@C(k>O'jF:yE^j, m͹ʪt ['E'@ +/[.,8<1D'h oT(!wIʚ,j.'/!1 _+y$)s.a:mb(LXJթ`hzX}gp3B$>h?;WFj"=oGTRa E{ړ&@Hq|9[}݁E^1b;ƙ9~m_Q8PCWLhSޥ3fPY4B'>a&avk>]!+^oױ3X9lDIDHhN:{%+Z`h"P#S5nil>:w[R}dה!`Dğ>bp<6o oRf1Mw剮Ūlj= &0}[gI O1M>pf_&!d&{8KWRtߎ^<̡(hQc;pC=Տ-Z'jM"@~P,Qn6Ma4w"qݾ}=w@onm gȟW8gא[ 9Ή~ހ}6ǡը.mw | XM< uE)\5THEx;5N$!ޙ:*CJP2{, .곪NGwm?uAt0d>:56/)D p[ad e5K?p4V%/Q*)/pYL.iۑYhpvArz)3Z1hy`8<*9V <=d wnW^n "IZjf]Olm.`WfX 7dwE2m Es~ȷoir%}Ž{v+يsAdR?Y?Da5%|oFZk _~$0e11%ƴQˍN]c\tЮ|we\R'8%pz2QTC-oyc'ѰˡhWC֎ :v)[<5V4VسP( Wb;lmՊŹdXF+p6 07>ί۵*l3l8{=cDIiҔb[ '+ ݾx7qqَ;j]VފT!v$<X#C2Ewt%"'ʫF zE0_2sZ ۃP^:E#×o$:JYA؉7]w3#`b6Liab! P2y&( Rpu7!#km- i]Lg^/m0TDᑶ{w(*3IvNƮWhu p20z,#m; g>pPM+hOXn6llL4mЈo ,C"Z1W+S_i&Ը16eP[?',!NijdcQ*= ܃Qyҡ{J7mYwێ?#V8TRl+_ͯ.L07$^CH]I+o;- *wc*AbĺΛJkF$jxF #7qX?}*4Q`C'XFs4.ձ2oD:c7wI5Lj<hmw3N*22ryX-۫ssktIs0DCyRdmT!m?oUOvȯؼ^E&TC xe_v 0+?xV0,5H>褝a4N4an xXTc߭Y:3)0N s*!nGA xH/ 9a_-d􃻬g {BP0y#ȸz`Hݤ<)sζxS!π ) h[CHu4%iBT}gC,΢"k{xGmu[vnv(gg-bq:3(okÌ2 iN}+*-E :>DYǨ2809_] %Ur !z9 QvvtG`Oibq-V-<9HFzwrT.U]Ej3%4'ybЎC_ !iA<jľݩ~s.t#eUIEqSCBCR cFѾ!x\ǖс*j`OP;.Z5RՕxWڒSIbY_|ˆ>_6÷Nx #AO[mKS2\^elޒanIO)FL;,1 # 'LXK ]MOtM{'Y*=9JԹL٢-psm^dJ=?( X)&R8]E]FB*XSQ28Paޓ5ـR@2Β5VKwKGjTk/o U_DEýMY"לwQ̈B}ʰi8j(qYf7'6{,w H.9DʾӠiuҪBcm#MR7@p|9Jk'ri1Ǣ؟1]LC/Iuc,uh#_D{vTB dZ,NJ1ͱ5ϤP|P/\8k]+,F[|MRwkZWv7b/}o`s^*LES:кAe"1gp<1kG-[}N:n$XP.Z溝ݠors+^h״`Z'҈xF U}YݔU0\",Gn.ڴvI+o g{2`!ZW.j5AN%2Б ~s_ +1 4to:YUjčNɿpIb= 0Bb>4{wf\~貯 @3f ؓ:NFnZ佟^`o3 B33Rha.D@fW;^GMD;E*Gij+P#.=8aFr($-@@VL-7GOCۣVeG%vN9]&ӵo9:TB#UUiZkcjd(@; ۤS~948}YK`X@6pܦA͚Ɛ^&Z"kh$Fs/U,fDTd{y\޳#E Ny;<ǿgP1zfK.BŮFz&O3Q_0& 4Ֆ@f̑4>lBkxՂAEGL/i!4t""_h8}6F J ٩"jg_vc*#ޟhwF6 _:auUj{W‰Ki%0LV?~ 20\d}c!'#Ldb-sNrACp!R(VJdy)$q2n?7e|uK^3G>l]W}r2Yy)̢k,`9 mW|حh _QZ/\37uΔ2 /%9(x7}).opy;؇0>bUnRJO6*u*'v~2rovceV] 4t 2PlYn`@KoᚽJϡ:אVN]rF-MJ ^|ȳږ1B64'f`g~}aRz |-reZՌ3WI^ly)LqXٯGwR'o SU3a|,+[x%{9ݕ/p(eE)hx,6o2!  Ox694϶`VX5Zށ:vAU6= ~V KҫFd]r2G!N)ul4M?#Ϳ/TJƘ}n1ҹ '>9EIJ鍴1L#)rSG|.-tw'<$KNZ1KFiălƋI>Ff7ARDe `A.!6JUSy0JL}m#o &B$2~+F_bq8حGz9vk)Gel:,vp yf'v^!-zYa>N#'{tOS-wYM@ (;5G"_jSgRN߬ewN"Wž宱ƙz^1mLN>t2< UgޓN֗S@K~ pPSZ<=<݉NI~;k'>Eҟl4w3/[Q6BS;~`Ƒ0,};A(?k د73,PiwYI! }H3E-S֧'AПAՓΑؾ+kh_7 K(4!>C"yS0s\\s̑ʉc݀LWR7hf}V#"6%ʪ v\]09RhRֳ *',+;O&$If>wP.nz0Z kC@l1nk8dע1i8`yD{n G.- 6 Stl"p}KWtMhlIi!@?K.г:W(gֱI@nWrIpTҤnUAge,j|QC ;FnLc/@pb#Ky!ΐN U{,mʴ|PCk4ㅣԍ&mJEPӏաeh FI`/u9#A;a?y7)u4 qwMi;[MVJS([DR:_Sw\\U_~aBuBg2։6Ea6Q +RP3@\B,g\S(էx@"L 9Վ69d*UL[/2Zyӱoiٞa&`D%喒| @ݢnhii`[192W1cwƗTTyH|Y.@g>H )K"یKL{a7Fw&oS~pvm,2oFf $(히y@O.Lt3k]&B'frwOB)Cgi o/J5_|ƞMBꂰB;ZȤɉ#+ޅ߫#ϘBq:xf㶷OA}wv֝U,}\)uMuo3o38F>lv6ǿ ^MTOݏI%fz3 |C7 [I.a';$ ˊTvkiޘ4tccT/|Z ̵ֻ2ԍܠѿPۯ=A YbS\JDCYL.p=9u@dXEn.|y.Fy;ϼ ZHDHȷ6m89^E|VRU\dʡՒ}}uܓSp?bO,JN*#hĤ匔+#cyӹAg,IU1TGNj/ {Vf3\DB?} yX=bK&4gMF)4=$3bjH01 pB%Lg1~ce!;\5vEDַ_s`kAQU'aX~U\4+m౴6@?zBwgYH1PNgdI>zTǿzA1c&iCckAH;NcnMGBZs՚LVKoD ! 8|hE`9m9zcF@M+{,*M( @1y )+fkFʮ/+oDVsU=қ$~`})ڶFˆ%Zr8BCq>^m,M$qW#õMx+/=ǔpZZx6`fq]/|<}ϫ%|VmʨեͻLhCϔ6,Olq1=6QTOn+)q[RxV'uae}Sl}kO6:GJ7,9Cp/y)vZ@#צRO\ֻzڟڤ+Db1J&Mg`3[ X;SN,O%وi 1$^53(Oa6@|oLg/3GR!bG+OH5;}lʗܾMEX;P-;M yvyzE*3uF:raĕž=,7&9t ~VyoiJOY3ﯨpyd "9pkmE +Jݎcp,Sl5q$-B݂G[ B$Yλ#(:9Hk~KրCktL௠6qU3o4.paƈ߽.Nf*i|WbD3|%[5itqoũ֏igO5pFiW*IM]s `?l!)i[\fR"\>)~<Vه)(Lkz=ћ d"ŒDo5aMFO4OӼ%%Nu[1qΏ$yXCߵw+JxV0>Ѵ8١My q;!莸`Z>h2.[.M<叏+F^>t '4]S ?f&ee,r4*]z|SՓ:<;Yug4$ۗvA+"9+]ھε:#[*تxz *i)X{4|b}ʿj}p^H3a6eXWb_5dhμfqku@p(V;V'w,*vVPTc=rTu=8@Up2N4H5)"Xq'G1?/ J?P,wX-HGQ0>\t W|AP%AIs/oWl]`$eaf8Ɲ?Y39<)7떹&OApzh&Rnf~_(K`/ZPKr&'x(BCVȨk&owph;Vi~[ mxd [ a C{2L1lPM, OOz.x#8Ah^&w:ڕnUBuyAB@_1ױ5 M ]P0X:(m6mxd QׁAO="Z^e|>IH'z`|[$[]x : Oа5ň"9o#f `t1UU*(;5Ip0NXݞ07{K{ZRz+daZ"S1ڍ^ȉ5^H}}ߙBG%C./mN*#vU2 sfYo!$C4AMLʕ"Ɉo_lY ,D^uױ̲4wk 1gKq42օݫ 9Ā4{rl=:QU߃6#E"fAN3&WD.SۄDH}xa>Y8# qDV; ];=st/L (XlPU0C'(V˟$RuGBN.A[*`VcP/v^j}dz3I_ i26(+#\w~zX6tjYSn%zIZq`LެT$yl _'=s5r_PLk&\r[,2}^lK$|V=X:XOX^ XMg 9.oKqf~x+O|^ im():/(?*_keV6 )߀mSF /QJ񉜩jO*df[rYɗtH0-tKEsju9"e]tqS9Ӊ=FpB޼7Q8VL&qYJ{a-c}^zecOK>rHT)^}| ꢌ _dX`U&+,3{hӕqADOu ><-F.qL c GwXpE,e-g82ԹN)xԋt 2;[+Aذ\m80U0M| 9,4 x9+ٓθXF4`[q/ZSTpe ԷoKsϠ5ۮ+Q4U0 T GrkWpsT0nBLz'쵭'.N5NB>z(ۗ#4/mm: ėԇb/MWϷ>Bʄ Gf,j{6K)YW0ZitؔAvT4ZS?~ ?EԳ#ҜaB k>H-o ; @5]xYv@eeS'.h)=GUDqhInJiX0Rnq"gD%:FT8=TTو66*7|{Zvl;邔r%ա1W {#nZ &"kQp㫣-_T U@;ͦOED_mD@k5Pp̉[$(3ݝ#?>BB&"voхk&TM fyUJ0o'Ey ThȚ-DA0Kc@ZM*Ʝ{!IkJEJ4LnοW&t!7ĭrZy:q8Dm3$ќ//;5]I~VbX Pϐ@׈4kV?3sKTc:Bw(qΟޑB?h",ĊjnQ[aFR犉c]HIw_1+|"lq;XWA2INk[sL[+'Kе}rZj)NeY3O:Ӷi2M5&^&{,s*'W@ӊ KQ>֕ta>77Ƿ J%ktfB HZ@4=u@5(}8(M}-XIJYq^V$/ar孁Q%j7b?g-0 EpG(/kЂ"9/e0cyœ2/5Teee{B GmhN'+kӴ켽OrǏƂ_5VlZX$!h6말wZ2rrV[Omf4%1j+mx|Q5F@aQ&-kA*DM $^qJKs+Y& GɧO zBnYk/sUmi}[ybTD\bI}ܞbg)6M ݂-{|M 4B +X#3֥n^9~9MyS3Ra"3$9 tӲ90[f-o}^}nH]3GaCu_rIi5x Q86k WEB7)mh S3d*j񒑬YV/~/>,٩GKS8K2YgWgU Il6oBOMo, FռhEb.(w{u_a͆ M~8 ("NI^CXx.;W]V1g9+qi(cN:hWO]JM:nh{e"rz<}YYr& Bd\F3N"F>Z%g)s8 cx\)W 񏿵Gk}??=,ar6q9Ȼxs3QO4?}Q,x` Z6:ڑו*˙#{|(:}.ֱ+~Wzȟ!3Z#$,gNo/!|| Z 6ŀ9B`)j (";//t^K)_ G;a_>W 5&d6eiիO8ֆuS[{s{1;Df2}R;:;ÇH㏵y2&op4m&2p<ͧL?n=z12 (–]t1ïŐj}L\d&)K|kh(23ucԽR*d pg <4Ǭ-pe~mt1CE{ Lji9f~v!8WmTQ*b=5W|&$EI[-hnJ ^8CR|x~%܁VIK7GA@ུqv R0}xTKM6Yh0nԣxDb|Q郲+T,ιgz_{ׄB uة]f㰈j5܋V͉ i]|?} (Z-T3늀V8hkNURZSU)f':*bNK5cܯ7\jC5D*o0Ԟgy)LAHڿҨp){*_ʽ6Gz+ 9gMrM]Z&qJ)fl\L; n,Qϝgz"=29=j.jWƮ N+y}y}RgȨx59^y:y,D߸>VUW+&cO-uxe9ȩ#@ySXdU12V|RMN5Q۷ |\P לp]gvWڟʅ܁D"dd"3YaW( ^}W4ĸ 9(3ΊP۵ۘ.Q@n 9!"M*~M[[(u:A} 43(`7FrKwTBCu&Ѽ0wHl r~1[8: QwmȚ7a=LL5Kh%&wu^w-ЫC p(@2Rtaz.볜'j6<-o{Lx#,3 cDi4~#|}>0t$~ ndO&F aCS:LͭO|idFNW:Vj傴)#zm6GP&:%3Ao(dXӐmYq[x jZd[v$̰J;JcBIyH ZaI2 ~~*@\Vߏ7b:d.$C))/l- ^HƱlq"k/RplgE$J\3|sx 42Jm& hzJ~.0Sn4 `9 YMO#L8S)*v#gQ3^heD/Oyp?D8ѵ[ϥA, RtÎÁ?H|GZ#a!4hG\TDΏGOmc_c{J)#bt O=\@H.H-NjA<m{(8Ή[lԚ R2{7pe'{LD'ߐF j|@yWӒ(ːM-QC`e*EEKm69R꒯h7˰EBQ߸)vDwFwasGsud+>qS'v:>I=zaxzS/W]Y2b ;1jYIg+!au ]35Pt.8TC>l ;IvYWJɉa,{yn-J]B=y39?xĎC7Fdo Vc!~? r܍Ug/4-EKv4 {\@O`^l99 B$`f.rl']D3۾f s?fvje>ӄ~ &}gyf{.=9y;ꩩ!YNN:U`ɦV7I m(޳f7)le1u|嵓UWZ_w$+kyHׇ4ya\=uL࢖3Q3zV6zjG&RQD ;9fvϦoxJl>@<<*;2*BEh?(5/U^]BW[1)Uf}UHL8Dbt,y$uɒ }xyb%FmTE 4i;)Epz.K4IkZ3Ut~,$p RО|h :Di'X4y0[x~I=,'!5Wک[ O F9Ck-Q3Rzw[u6ekY Kj(]\~(%Jk abc.̿ rZ0vVD6&(ޔ dg| >$T%zdP Xk͚0Cާ:L `Mû+mr>ZS [n/} m8SHDxEc&V Ʃ-D'9a%u?,#b&eׄG9@?|+KMgdDJ`4S)x@(E7B7?G@'m E:Yzf[o'Uf1z1˟J4'7#QtX]w BH |:?##dAb M`g:cuwF/+ہъ.~}%5vC47|ˁld:lGqU9l-gօjk?+  k \5r[Z~9οQ .g y7D[h5רZ#%nF͐EoG-E,WjN ,Iwxp-Vu(=fӶ o6SJ4YRHx< _V@XwGQo!JɊ߂/cyi;xY$ii橊6u%vvmA*2|Str\Y;)V}?X^єhfaN.YK5DӃ B'XV"[2G jX~.𐤶Ңו~$*NlFl IB^ŽtU-ȰA"&NeH!8 /{eps"jq@hhd 089SKHKrOt'z׫`?r$Ul1]57x \ w<}!5? zf8zpg¹1!.H*4=&E/&OHjIB;_1`"o`mj-՚6P\a/ݽ5m6۩1㱂rVW苆G0Sfe$4Q˷cG4dbR%By,0+Pn)K^&SU HF}XBKP7ٺ `X X,J.&: \3j>me!-G/GGA>Jd) ퟖhU6NsDK\T3E0V|'cA9>"g_afЍbî-.~כbe '61)M-ׅiޮN3GT3jk𞗆Z-[Qx6Ӈ,"زzC1?OreZ@wfzW/>T8!+ե<\ГaJW"UYϕ>RX@?%g6ˬJRg~sip.$&ص<)$+"wHDi4')46P@ 13r%Q$ N 1OEy >HJO 8}S&PO`IIN_ho,䂄oqRNKuXL׾)Z I Utj%_׃ +#3biLk3%Pvדo0z/ϓU|VEP V$3 sgNu4Mo8Qb1/gY}H9 D4fn=EKRkwʼnSr>-::vud:_3C se8:ŏ g&MItl{ 554k(s)Jw? Tyq@>PD=o4OQzfq,_JvV-fuG7HTd9ќDg[*Nn^n5f6GJm x"*w{l>q憫7n\F']5 akֽ1; zvL4V>LE);V9UJHIX" rH@2l.^T!Hh~"ω&$sCrPGM;MUc46V1e`Y:j2I1ݥ}Xm#p d -x2$n\i_ Br(b={WW>=EVĕd GoY qQI<yTNe23"Tb6TlrD1O(MUE[w9WWO"O[>򕂦0c8_cۅU}ypK/rT>) YzJ~>6J&A!iio FOӽ$Nr(GSHܖtMT@an!X P q_bI3uY\ ʒu2#z9c_ĽRg1 RDj5 0d > }z- J`:v|z3 ,>Oz̔rAyܵp7y| :DaA`9mYͻ#Y#8X~s91k}765p88!BZ ">9{:wLjtDSPJRb]azECĐĺ>==Si׀#|-1бPV3W;?Ǎavf@Z$FKK;y̌% I K&(YMz#LseSY5&1/N+@>f:Dl5Xv]@&i#nUrUBd炖,ZJo*3#|.$gzLϥ.q̴NmamZmQT@Z 3OM s~ݨsY-_jIly!&XSē# s]Ëm݊3XQum65>eC" oS`ciQ- 즶DH{ gLZz}"[4ED1kQ<0;fyqbuB4r-0d@Z T"@RUXX1czfZ NwG<{,FIA9(ߩo`<:\J؎dFC;A˒s"j7|IeS}\ՀeSkp6Vށy?p:7c12w?Sfʻ=*)\Ѣx#(-GR2 @W%Goơ+r+pt΢ieD>0l˾ais} xWߢ"F|xm``g&Fݦ&dFG~4P-<ol(})gD?wi %^m1dqr&U> ?  n6_]w 8z,8,GPOv(\$e{+:%O g 5c :+,7 zd4TL3A% \V[6H as `H7us,/&^@us2DWt0Cr dxG{8<K+= %ӥ+Q0}6ʎFݺ6cy Kv38ʩ0+>|~/?a8A_g#kԵN?fƞU L<N{vX[\\:jw_3\0+ڧnM(sLX͈e}EkbdOݵI6W?2Vw@=bIZ)5Df@c61^8şd+ Kٱ3JAlQwΙDLD'n-p K^P--;֕kͼ!|&̀=6S\Ɍnfb%\ @$rA9SVvMN%l7+f{Zh'|F{+@NT畤E|  "ca?,Ǖ.͉XVhs qoݏ.VB|A(YK`a1c] <0zzb6Ddu@Oȡf8-~Ѝݯd.Gx, qsYvtvZ][T@j'Y竫4TʍV%Q e_Q n@m꜠MA7SGz֪"ҷF/z`F#lFy\1- z0Pˮea ũ6?\RVhծYmt1DȤ1qch5Ṹɰ<^}6fjtXo1{A[(yfYӓK>%&)p1_e!Ti'~)Hdocy)a2OiX'3hSe:x@X !O7×?iue܏Xns}F]x3C`6#8 !*Bt} S.ދ|6_EB~ xcy?X{E*V.uC2j}rQgm厡޹ iˉKA`iSB b繶nG9f}[ĬAWiɩ]v׏ÚɜY@d#q h@=¾Vj hubb=*BTSALd/pc6VU|Dm{͇vR+y>w :~ۡ'JN80)QulHcDNb?|Gj =z $0a +fzEP)GӀ!|1)i"ʇ/=;o &oй3]{m+KYo'J$@Y[lВWPYY23۱⠈nz ζIcBJgi*%i5V4 pi Gk ţ P)6>||Gh 5IŴi!~/`\Nw!LG(vkQi{u>MH"~mF]02>N_|R5(ԔMx:T 㙹K!@~̰-ԍ`VИy"Ǝւr5s@rNt+ ܎HUO]^iܯ'dpbf9YI8]DLEG('R##^U:5W@\0:ƑJ#VvLGMQb벥 W }C #A8-PM3 E fxmuxR =P|Z;7wmv ]$9kG .eP5R=ZRԈmƁN^ܥ_GACx㈀z?܉#^!3ubocVvQ}㬼̺qZ+lKu$*Vs/A\x>k 8gES=Z?+qc-DbPSF?1Bl וּ'V&i|ىqMB7?rA9a,\M ]h"u2wTJ9i\:3q&|>uCrHe?ɔ(?1Pi4Rh2/&rTjt]wT H FFZ>c\qoׄ:P`GX7ŕո%Sfgv)V:kR4D>:+#-n&4Mgk' ]aGH0XΫ$Zk[PxcyLh|D%I F3z5xSxa/x '0(=gV#Q=/tVtyi(r+V3Cܒ=5 tu +%> zŷ2OV:=L6/F՞X7= TՠJ>@8kI'1 É fGn~4]!dQ~Ḥ5yұ#ݒp%`RNS!&\Yګ:s;yfQZY!:wf$q1`x3fҞcOFy/"''HQfas}p63Uy7Ъ ZMס5@s9ȂlIW)_ A4"=ibs g)sY(SN6{PpIbRrA!Ҁԗ'߷duo͇U#U4m@x=it31FŮk;0xO y'>w.emV&ao4QbwbRP\hfR5 ;. J$+::&^S5%v仌7{ȶk}b Sf8oS3sȩjH5<>2흶f.㪤K׌գo;ag%.̗fZtS=Ivt&EܢHO@V:_.˙A\֧(+YΩW8TR.{eHt.[/^E)* ]AKmʮp~Sp MA PY@ ;X_};ut]zLiӱ#C}Z^t[Z)-JYLRR@0/)@M)HdxP<`ǭP&Z)<R.@;#(:XS9 6gр?WhkQ`}hLwBO[\Ђmq1W Db‡_ +\<!S/dGO ^r(Y v.Ju+ 6@(7a] Ј -fLA 9'lNɺ>%h>D3!bAwpM[lehb20"@D]t'g8A}ofc%MHdZ:MGiD{$_g֛YAy1 kXQ?nGrQ+_SFsETN7D哋c-,w$Gwr'aBYqsi*p^E -&grWC=MБӫχ|n rebKm@slA{*$CA{ m܄!yisx 3P9cKPiVfu% p9|B0amA@ OyZ֏Fv?}+FPxTH1v16_Scdg)(]E{ƹw\TE$(Sߦ𞮇%F:6DI'Ҏ  ')H%cɞ1 ޥAݔi2PG+ˢH5>i~1GuVhID>AvK`iY 1ᣠ';0w*% WnL4" &,߇n.<2Lq0"G+:%RHT!0ԙC}WSکe[:&=啳bZu%1{s{f}vB|Ea~z`Ӱ;6s{۞DxWvPбN/^Y6&MKb(muw|D L@qa&[73]r Jg҄rQ)G0T2dRark]ugiPQ3AAmᒝ0^ߠ[GnщVLaٙ">[˗Ƣ8WyVu۞ *HbTUT6a"EȡeBv/+f\H]HKTޏ1FҎB .#&5(t7׏h?7>xP5Y;S઀Q<;_,ϤK*1;ΏlK-ybp* ӄ>&!JLJD3 š@YZ-ʔUsrIF%ovn`05(# R63UtJzꑠRfBt 2-_9[&a$0GA>&i\cseyW%y53*"+hj\+O3% ,I#oΙ'sCAZ]Qݡum0>d G˅8Ls$CwOUaWw< oV": x9cFtK6+ _d{ a9ʂ6Ea|m)n_iz.1yO']=m\bp$QUZ0}b/Nb}Hq r 7/KZCGQDpDezEΨw0}eBI0`Zc(Fu?>>V`j1]3/H%Zܠv:f4{BLoh2 (9WhV؇ײ5xɒ)4+F~8híTA'z a>`J!8~aᶢ ]P%}sg~ܲ*e`(wZnEO3bgU&ת@,rd3eY[y A z.q3Sq Qn7I0&B4,1#tyćRsØ47IŢC8^ U] rH:*2`tZ (48,ų+pa#FA=|˂['O2fmh|# ?cc0߅BTYхbz~0V17=3[(p￁Y#\{Ҿ>?yzW֩ _^>ne(wJ5(D*b?t}fW, {9(5D^>?GUrFcD!`>ceQ}׬,A]~mnGlX~fmS Zȹб4m3|ΊqTaZ9@ѹ fYE?t{\%ΕMhUT?rDXlfޕs׀_Ÿ10vC{_$~0 }Nޙ>-m;n;2]QEA+[MdnQ@V@{Ō+%|_桄_Qz1U9=}/tTPX~5Do0bV9oUzUSJ R,tfhgɆaEHbYcKO^ DOV'0_ 26&&P?xTis 3w ]Ӄiqh`MoCjd*$A7ث:H {/h>YNCD.}~ޗ0Xy}.QmQL[h`a גvORk8@,dEn49Y 9~m Rlâ|0ݟ@"BWΚK'_:3x8G{(x᫏ x rA#:DtlVUYY"z"N8e#Q7s{}~WF ˹RY Ӊ)3f=銊<ѵD=9`U> RA_yD+޼llJ~Y:BM~{. h8:@QʉuQjF*)BBlq9"lҶU,ip%;U~_<o- ⼃jĩi;W!S_IZ?"q\% t[i6K fxz]! U ٙ!-Q+cTꧠR ΰ:@5Uј8>@r<~XCGReTc'*UI XEj*$';;T0¿>b%!h5ƕqW$I%p:+a^hB-РvjUF^5Xx"%K킗jFqxA2Gn7yBP9mbF`?dkuM omdLG53x]IV% oR@Þu:\(T{ŋ 6,ݏ7m_4gߣ⦝(WnGqw.ViOt#C:jL-#o GmJKpX4jsWFQ!q7KZh>]}(! uZ_٨ {(?g>+9rS#@0DH櫵I'q†fAbȈ8F)z[h99g̚B᥹0*'|?k8|V&!z^"5IPEEsBG{D+ke/~z$oBNہ|lU+u?5l#K(ڞWC^">`oXKG wyscdDqITN:.]fw Sl#b,HŇVRUv@`IȥѕѾY;rU5`ݛ~=Qʋ]3Kx }5s:vϕauUm#ݣ@ƶ=^)iCBYEwUۄ)r`Zkz罬hKs/ }]ݳ'S\j#&#jOir kfP}7e.PYP7 S;?r=nnfA߆qH@l[k/MP#nM[SP#X3Ͷ6@M7y$/ ^ J|}y (6ߴCSO>/"7c(U/u:M 3UD`y^؇gh~#xf>KkJ9cMa99pq" ]ho.'P5Tz#q$<ʆkx a"щYe%%NȚe#Ϸ9d/L"\oWcHfz:zx;JWPxXb-Cs*WהW,":x"SW[z&!YR N5, z.!1" N&uwLG\wU~4ã>@YCtYFC>7VL1NjԭR\`)_Z79qv+_.Ӧhc.%.ɂxiq}r7DBn|XUN_ r= 39x?~3fJU_u( |^- N*ba$~Tǡ.읤)]S\ } Ҥe?'_'λNhD= (E_ſ=1/c0|>Xjz1:~VM J3;tS0jo'ʃW>nJit5.i7b0)w;UƤUv%"r쁂ࠛ!ZwGޤ*\hXcِM%p^1Q>~ y,7[LRl4}Iq687Ycݧ ʐ) x̶`#NZGrGμYvykQ*3m<)??P?p 49GNhg̡j; ̓Yy K?ðKT= en 9s['+ V77,ST=x"XK>]#L 2+jVrRHJE/T D`saYVj-$L@InqT%2&:x'cRPWpzCk*k-?yβa .SbNBg29RZ2Ҳ9KG@w<@)=P{x$0`N}htcM0F iSdAJ3*g[̓:qUxGBR8D҃9ӜNԧW+uyeeU]N_E%M*<|MZ)Ӗ:6zv2REltQի]m`;6$ܘf"ޖ w(@𳀰QH,,ɟ* uJOG:S>}<ї9L d2QߕEĥMAj`Ց˽|uu%Ɂ`&\$ucnd=X[ ׸cneA5Ljj9@lק+X爧ȓ'k ;d J 9r>`rTx"ĔK F؁Чj3֚ *DolwL8L#]-;jld|gKm.5VP5EB#)^sdNpU0CBaUK%GmG^$Mɿ3N~>),(Ab`8eS;I5SDpq* `Eq&Gvw6/\/Z~Ruqݱ[$5ڦP{FMb]W̵\9F".%m dKKYw{SȐ ՈRS)im6 }$LIl®?ml2;JzT" eh-d0scŴ9`V2K;S B2B?vv'{s2*4' %OHÙI'gE;&t5AU (,+X0ן6̒ugmM&w?Q\adqP/_;[ XD8Qx56d*D> lkk(-%.(Q>6Q|O˫+-<~9O[eO,W7RT?\H\ _Úʧ>dI=Hs.Z~9sѪڄ-+H.BCTAL1jL]fpGFm߹@\-k ͙Wa`D7?lol~t',PdǓÔKTD/\R*KmL+S{A#1ZxKN=by|'jk!rG7$G4k"}hAX;8^ Sk47r=l|Y|jOe~ 7Rao)j(6([mtpm٪-+Gl\V_gFM3?4J&x]Ҭz0- >];.ZP*ITQ8!#4D| @{cɷߒDtY"pg|UjTbE'sÅbM>d|PP*[ҳk=a^~eCRXzGރ۝ _ @q`ZFų1$Y /;mx`N  Aal 6xj>KCh1feWar1ɤ v^U7SukvaKHftyr`.B!Y=M/%Zʹmݓa8 ߟ1 &t/r*$A6`əȡyMz$yZqǰs/fF+h  )A@2d4zii9X'Յ,1c7e ¹վ BV?e+*u2*GvfhbݝA%ާc5=4 \mwOm-}KժNLAz39"+s ,tbA-]l%yբiB訹hip?VUkS*^ѰzcN')NR}^d)Cd-TЙO܃n8xb5[ҵKjy-6=NҚm>F}թʣdeu 'M"!qLx6"[/gUp{v3Ve< ے`y" >RV?իG }HH>.75vW6md|w(䄉o@eoy%Wt\f#ӕŊ'D_LyN"M|<%M/rFKB~͕c"Z-tKk'Պ# ee(h Zg}oMЙfQQ5E}ta@&#/BO\ bcXmj;ä;zY뽃jr֭Uㅨ]Fp6TCklkۅEVskq˦?9ڼqUeA+Wەu0aCx[WB p-Dl1/T SYz4 ΅TΡ[#?iը~ ~İ#6etjփG@iwdd83L')ԯы*ӗ3Rl;3N-'ަL \ ?36kf%X.>שտ>YrʊF &vK##7(8v˓j5б3ZKa;WGhrQAGbpճ&r'@C7 QC%:̊ό(^3 kf(-Ai#f'>Qڟ_]Қ[TpR-~h|PDGʟb5:v>=:n^^Vp^+˃$F?1CmO Ɇ_" 9S"my(Y)9=s^Q\O;<~k%!`smQ-nW3iP̠ x6C5v8Ǣ ax@Q•֞H uO@ɼ>ON%L_w+Y,l*L&޵dKD&QF`NJY a@+|l(3C)7qe֏]5E/G`03(--bR܍V(= uKV{%㠴c;:1\suޏ1[D晪I,""K=@MmAlM4laZ@ #;IxOZ`#Luv)iP,fpL4izLWŶܬ^ȕz58j#n18b}~ (cؗXpĵ ÇE^"l|ݍ 2]<?4R#-ĘI ti F< @fc ӓe\+Mq ,yx|]kZtdd`/i( uh6Ӓ]x\w%9nNKd'fB;"wL RōP5YR7BNAq—7i[hg`6)טN3"\}2Q7q(qu6 $w:)^PD'Q˻ik+'sA8iO򺌙{V$Wwe#%ػ[DBUP]@ajMv=k߁Z(  I'F#ݹrԭG :QZZ!xҚ`wK#ԫ/,˦wvƃ[(bE`Wk>>#c}JxUb•xQe#ʧIbk3P5( 2T N۷ @ǵ+n,ۂݰrVz!>DcR:SNbň/,ZfTBdH@Qw&A[uM&9Ri^Q3H~ّlp %SEcI22=Twa;ČEVvn:T'Lm=t/* jUh. X)Yl׋3ԠKEnX-:Z1V:TWcpr!bIL/ВF]dP-J^ kQz^t{׷U4H7_XwqmuaѳJ{Z; 'ueƵ) $/< +14Cq(sz4Lϙ c6ݙw%4*V6`Md)AVs5%ND\?)dE/OPGz eكh?ǞZy~s:PMÔe/H"1N-5a̞yok>=M5G*q֋*bέ[Uх+:!Wf*쇙-*w4 [H-=. @vR¿egV8Y9b٣td~9BBUէl'k;UE(p5T wލNVc~OХ`KbW=`w2Q]1'EZf@bR9O"0#q&=r/+\3:XwFk^C@|q W+gwf7ۜ P{;G~bɣ ^)6PyMJ7ڗGH5'#6¾ bqM1oUQ5 ve#0 6dܨ5wF|_S Ͱ,aMߣ竢SxeR:* Ǝ'}:AQCwCKu(LϘyGKHSl؈+2beQN:T& +JvJ?amʄd +? #idr^&B 8SwOpIp+(6b7xrՇK$v|8vgF+fHJ͕Smy_i-J7}w$߭Q8iPWXx8ѶKS.K e(=zL|˱52z: U</FM {TOUx`K2nPQ|9]!,SH&N"s6JL>걛|pED)\cBn'hS2mʱ@hiw .f#Gy?y.jZ((]zWW5_q*$h0g}aq<Pkc!J|E:/1^!QxBT[8 *BHN/P(Nay")8DB} 54ѐ*S@Ĉa`NÔM>7t0P[RPX㷧]_V4Ȧl؁.},ʽӫwZ9z2oAmu;tz}R{9E,nO2X"AxѲƑBKakmDA9<&%F003> !jEI/3|JYY7h#km+\SM(.ԠJP.@,c7L);!0+O ɃhlLȢ m|B:|-hyj`נl=p>g8Eӎ/t@djauU/2i^ait\4š˱]=Er<9A+?{shbR@+# $ˬ- !|k`Xԋ I[Rj"*s͞EMKvAx&f#bgW׋ YDNcwʟT20wk83w 1e@8z #j)tz{H3THs G]Bd)x ~'ׯu^=\ADgrEtsO7]r.#tGP)񔩉%(1OX!|+?WaOhnha:&N4|PkZg&2()er/u`HCm4zKd?KL}Fvʍh zzLY%7O$x͑-,KQ̸"#ߟ_Wmy|2q'.2KQh;3@ ӓ{sc1yѽFLԜ.2&Ig4oB)$]\:P2w@s:HGj 05z!Λ\EDzR.TnDf 3M}c/j >D"w(R`bJtNB _r㎥r;?k0u; o :,1.c%slh {I`G69!{g>VQĒ~WhB<Cȶ|FUkn-vBEuz7GLeJlDOd_̨dtr $tI+7E#:̄oC ؘt<CC dN hH~8^>JS'{aoOH:H^;>)IM?[c1>1!/A-.9Fd\dЇ{. R$-s?$,D :*t C7YHe34Yj 3Stn{1Ěf;:|$J\@wi$1AliϩH~mldB2U$D H2~ۼ#J7%2;u捧^̾m|C*#v+o \0pbt|$Mᕌ?O-8 xE޹(.;e(.2K͉8Q=GB Ԗ8XKg 4Yc$}}ܭ{ʼnF˱c!YՕi6GAZwktܝ+橉 hUz_xpɽE0;^P&`_ⴊdsS,]R;zUv@5?S>E!:`uƽ :/{9QSIO kW'ǷZiR}D ydmN 6jrSbUmEd\[؉;[R񙲼 2/t\Jhc[ @"cߗ}n{[*8,5-PGԚQdS,vjFhgY+$)5ixpbSq0dpER+a, ((R vb(Ѷ1k϶:#D-' {]}kETҡ&@|R4ԕ} 3u|EgcoqĤC\|ZkķT m'9fgG A\,|4yh?\}9S}5~ӛrΟm)nC/j Hd ݐMW1 zXjP}WMTQ D7[Q`h,XMYf> ޚC'"Is76xy@WPn"C1;Hl5,񐷨x)PK׵GF{"\0uaO]ޖ^$tEDU' 1*6 8% 2 sׂݰN;GGi/6a/,qɭXďXO F|(} :鱌OdCi=N醎GI&es~Ɗsxf?3:y=;|}:]#xIi#a:(iKGQT0`3_ r?g_T:bWk=H[ȍ50R]!~S BuMe47gqHh*Iq L mc ^5ѱ AO #9(G>Y$m~nBX/pCQfvYkHZ'Stm Ӧ|hMT.C*lp~i7ȍ6b\kZL BDZ?Kv19g}@.Xo.f"/ؗw(cFeDOtBFENvgM*)u1K1mU#">H>="'HCkrVw\ٞr>z?ft9\ zcɾExQ6,)C*6ջF'>2k<:܄ז L6o6b9ĵ|/g|u*e:7ӄO?.륤D쾼ed(s6a7% R7|w@S\>ڴhޥĎ$U!zڷK 9AzSOhbVep}M.3f_JEO&PGsM5X>/Ȋq{'ޗ4DYKpۋ (.!?r@#tz<&]gnWeR}}w$\h%0pŜ-C[i$o^Y=Vf p0p[NQ ]j}pvfJr#pǣBӂ4 ++/"wboY-| z,ȏr)CXuEݝE;[!K](-Mύ/QC n{]LN]U b]D& aD WkʟAT *-䢹ph{wdLmUaHwّ:5uO) fRIecd$0n[/dy LhC,t3.@afd"Ibs(|-;kݟ=2؂?;dKp6=V2LVZIn$ISXpo,?߮6 ]gE n=!~y9y;6]ל\;iM8_F̃?جaEh T 7d$T}+^Gq0~Օy:<"fzq!CN5.eZ Rl_V6q\\j*Ж0qҌ𪧀Rꔈ'~Mb*ҘIM"aqу ^ڻB"Aخ;,l(c% C>.TbpZJJ:,m 0G[Qht}l>/`]8h/P׌ K'!w| TVbUZJ/nDݲD5 }E8(qD> QIA0򕋁DSs4#y6iCcњ(pNĈyYׄjRa@ySf a%6(CHrO0 }-$R9GQ*rbv QX;&aoI9 70 8sႌBl1%8G ut' DzY՝&2S0$7F|9]*>dxrYm%n/(4zӋ%.U*ɄW`G[,?JVNٴ~['h f$q@(8*LSzs`ts5 \]zr쁾D$3x]HzD:9n7AC z&֍F BIU nB3ώ ͵/8"㞀y- CNR_\Rg0 ) JwntKmɦ:u 4AyЩHD-r|T _D(b-wu,^J;njС6{ Ԁˋ1F:ĢA^} F(ЕK?7z {# MȭrBگm&2!sI6W#Y!M.|uMh>E7 h O8+G)K5dY6yT" 2JL:iVm|?=Nе84u:Pg/xS~lO84ti1rM T1 2DšK )DdGMTz%/Fo=dŎ^. I1*45M[J!TL_d" 7C|ʄeon)pm(x:/#Rl3y!ڟdK];xyH9ib,q?}zbn'$"_A&/cd{kI;"4 93%D~ {z>₭S + [Γa8.!WMf Y U[4hV^(&3}S;]ML(,:>DWCûS[1d339iq~~U83j"CG' Q2b|C};L :&eZ`t߰i-cU~"~wG~+%wb`!O 5~<TMl.\mǾsIޏpLEXMWE`E0׊XDZe(dUUi2.TYcNnɢ._, _fW+pQu0gz eBtc{ x9*:T.i?O5^^'u[ a9,t*oUamѷPGgNyCf}Э ,ⱏGJ~Ud ; c|.dJx-y܅(' g%.;Qk!(D@3Xuzq6 @lU|-ͨ(>[!碳;,`V7%'+07%?k{ڴ,ˑrO A6MХ"nqYf=;sO!RbM|X&⎼La ެCAvAQ4*DK`e機.A9fg CAxC-|srI%-S!-tW(&i?,<ڕSlָ2GlFc[wp'Yhu&&t \>S~Y0@=^@#AgaY,e(*:NdrXTr!1 hJa\x! > j}0A(Qtj3~r,Ydaeٺu>=<? >.È Y Sbm8o0QZ_?ަȼf{_!8j#.p:jaנ2n`,Mqsre'൱'(k"O&DK&z]D,*#=Q66{x +(^x.jP Uҏ Q%H:5FU+vT&YZwB!W7ۢ ]vfXAzovo5\ۚ$.qi Û1վCIZ/kUkv}] RML:MOPmٔlڪ+G>q8b17Lپ$& yK'uj P$u;4zx^@* ?C(gmd5GeƩ&^Sr.!C!(r 8_AUUsnI >wq,7| ۾nTfC@3z$y;xBkP}W- 'S-n[!0cHEP:Ou1Z\>PSLW˲xXd |K-4GJwqN–D\lJNp=yQN?tp1D(0敀caPNkO oԣQ>S?SAP!+"pc9rtYMmG:U\*%+CeRGJ'؏8|*w()+?+ZgSW|bjFF0]ުX r?.mVFL8ciaTѱWXV D|K[%X'2cj}=/U^v F2鲤Քym-.69hm">P@yۨ(AxX)X3Pwu_PĽŻ2lUq#m~Oi&M5G*q)%¹giآ$B) B&>x{=YxTie^+ |t'=径wH 3+}@QOw`8Ž]JE jvyr0!#s5z^qJ .FIoӴ898ee4M\HJl"#<7:Ur\/p K;v⢔ӷE nncHV?(_ZX;3OsSӊm/X5Ѭi)F\`VMd %g%#[Y;N9/^e<[OvM"Vdb: aLKOpvTxQ]QsJޡbG?yMy Dj<[ 7&%T $,>0-x%TbO^OtF&\}K'&kRgZԖf@٤"N9n=OI]&Q)\RB2p4ARsRAƎY*|7/N2TԛNԛ䶾k:n(g7?͢vlg+mNU(v*<ȫ.j  ֒PɾW,IO8@>KDcJ尣Q' 5EhT^ۍ&yz]n;/ȟ;` & yu'D/{L^ b_VXؕCZ:-u65c,fpCd=0d<1WG3 3N5{-RҩٍO(2kTH׮:rوNO] /&80%H*d{$~MjLp T:2ޚCϓS-9Fb\+Ѕvپ9Hd,:@[@,fsc&b|IM2 A"WBRЗ= ̣<8/Q`Ʌxx6D6}~L[j7)p䳷}!bbko\=N: M*,CISyvDEM旽ra^oWWvp ~~jL [.c|N`uŸ)&(H}`yiӢ5r('rС:a.?* llT jUY X{ݣJ ")?\ a^DʱMAu 4$Inش "Ne"F綎V«vY!a]o*5Rq xxyb-1_?QT.f@(RGK f#ߥJr\цЌÏ[T@\:HN`~*X7ZG!nǸL|0gAύ jx7Kټ9fҜֺx"V^: _W˾]~!+3m~-/RܾP\_ .ŝ+E*SS;Thp0;\w3xh|vF .4q%<|#BDCg@AN?W=v7F{Ap0f|`V .k/ \Jqi4tnP?C9L;G׆TwqiCw>5=}8_ %C߼ \`blgT`Jv}PpҒǑ6hoXW %W_'JKalk<{v[`]sZ%.&73*,RK1A׊t3 v{ ˹.9үG#flvRbθСw0ɊD! L̸ S ;N?(s7ϫSX )J-O V2K'pzR&޷K:L.Y5B1eE8Ȫ&aګyݞ:Gf&bx A8 y 'd1(Ō_9&xVuF;F mmK"} R)#Tow9c&*Uµfz<jN ϼG(oڡM|5 fq2@žq זsՓlhōlb&1nfRŌqu!4TEtÑq0Sq HbLwclXBܮ1u⊚*Ŧ:x I|㪩M/PK#P zithC8gqC Y5>.%;szXBHhs ښgP]Ub}9-uìh|=FxT^^*lsҵ%,fӵƨ[%{20㼲88It`vhy'1|2uN;^Jn%4̢ ^AFrV2r2<@pX d8KC+RS-jMG:r$8wg|e$ʔH֙m s|zsqr)ڬevԟ_A޵o,Rzb:G/zs7}V'7'OU, peBET0ۢG`L%=^]9lg }&vPn8=һx02sC~i;*p#i\wΞPO[W+1oc; &<̗wh!G} {[W6^VOSK'&^HGX44y’57)`Czݘz?FwZD~JStz`)nB1ʏ6NOQ0֑_i'M߰:#eZBnxFlPk@tk%0>]3 "_v}m&rSb4lkJ6˹1!8q=]X[ JRW# 8O7"m:.|+)С+s/j+RKO QBGH=|}B ->x.ԻuubP4#zlN jx+,uM? skVlrX@ gH"SgiLOq[3Wnm:Y\D*+E6k8, 3toTr(2K鍞5bZ'RpDM=EQO|1O|cc,=蕎i9uIEŵ'9"H"lT&n<0yti$;z48ֳY,;&bH )zR,_R=n1<ă luƪWd'N;$D]K@UXQ^W`Sv@d77>C3}w׌l .Q6").$ :#l_W 6B@Dsf5# q{ VJw">PNu p垤 hh;q#Ucm3,=9(4~+іZԂmyCBRox@PX+ˀ`X)MQ=LvkW Te}GFG5Y{B sQl\j5vdMy[з4v qXiMkqmZiڣO"c<^Yg5F8_8ATm~K~U'Rh41c ME DKΔ*l.:wJLws4qwKkWIF>Q+NN۸&U5V K?ůk:_t.cZ) cYƱ~P;!~ޘt \pM%sU}i lwV1jX|g̞5̷QLv=nt9&Yh-89`c#֘2e/ s{ë({,%f!b _Ffs3膹֞TH/OvܻPʁlI7bou*OB?aO} 6+#sjRFVA1<~p~&XV1 2/awz c+ mW4r~;-vY-ӰTrN2hGp/Ɏʤ0q㚆<IqUde%S`Wʏgж3ej#a7n}e2(W*[ߒ' NZm# jtqZ/X юÅrfH0VQ,u9_*`q7IA8S~wt-zC޸^Gg9S\dGrn@KRa;;q]U3a72#ڴ0N@@AZ /qJ9UE 3'>vf7ЀrC^H Y_l/g)%r ;@(Њ2{ m47K<. C^H^ O,^|0m_%1O 6FlXJkOM|#8!e%j/JC+} ״D2;vo"붊` ɫ0j*[ ycؔ yܓ״4Lma3sL5Ӛ"U * zٴ*LAIxG2z'L,nj.<%$ 1:{u3– tH*C栺ZjX/<$Uv&9ZV$:6hig19oV7Aqz0 1G2Rncaj0wRgfҧ VwHW >ʀ^m sg#0v 5M8?+lrh$#npdQpS!0Tq}~+6 v.X{ͮf!zTf9r.jv0r{hQ*9`iCX9߰HmĴӓW:y~ w$pkZ\d~?\3(4e /hx$EZăU<$&#5hͺ(`{޴]$J+Og[Npq۫G^U 0օ\vf `M+}ns$pRL~1e !Dz6p =j .01x݉)[\?yoB; R.kmM<:%٣i*f%hm$.9;(4<;[O)׌},' 8YE3KmNxT9:vӤux$J[_8H7.iϣxwzN_1rJpbdIٜ'XY[w-< J&WL Ď1|.H+"O}_j^7#fow }K%4/%7LP\63z*r;iN4~vSk9,%HF{g?^1۰mvϥXP#4gFN5LFwCc߸լ_kjUBO 3L$DxgR&e#u>I,,Pa9ЧWaTyO;um.-' 4Ji{}E⠅y}TGUŷX౩%Nޱ1L:h%F |tۆbgT0*W"p;n7Δ[5+?r{PpGQ&TA59?8qSgvaIS z| ӍQ{ z;Ø&2M!wnٙB%jBumIEߴ) KrC dGĽn:BMoܔӟ2A#.Y_߂ UN}W()7ZJZl{x\㽢@h}V'f1+,ZCT~`q >D~!7:privatei1eeearmory-0.92.3/WindowsBuild.txt0000644000000000000000000000471212414772654015007 0ustar rootroot Make sure you have MSVS 2005 or 2008. [b]And if you are on a 64-bit system, make sure you select to install the x64 compilers under C++ options (The MSVS 2010 project is desperately out of date. Don't even bother trying it unless you're ready for a battle! However, I will be updating at some point in the future, I just want to make available the 2005 project first. Install Git and TortoiseGit http://code.google.com/p/msysgit/downloads/detail?name=Git-1.7.8-preview20111206.exe http://code.google.com/p/tortoisegit/downloads/list Clone the repo: Right click on the directory where you want the code to go: select "Git clone..." URL: git://github.com/etotheipi/BitcoinArmory.git Click OK While that's going, start downloading python-related stuff (there's a lot!) -- Download and install Python 2.6 or 2.7: http://www.python.org/ftp/python/2.7.2/ -- Download and install Python-Twisted: http://twistedmatrix.com/trac/wiki/Downloads -- Download and install zope.interface (for python-twisted): http://pypi.python.org/pypi/zope.interface/3.8.0#downloads Unless you know what to with an .egg file, you're going to have to download the tar.gz, unpack it, and then execute setup.py via: python setup.py install -- Download and UNPACK SWIG. http://www.swig.org/download.html Move the inner-most swig-2.0.4 directory to BtcoinArmory/cppForSwig (you should now see 3 subdirectories in cppForSwig dir: cryptopp, reorgTest and swig-2.0.4): -- Download and full-install PyQt4: http://www.riverbankcomputing.co.uk/software/pyqt/download -- (OPTIONAL) py2exe AND pywin32 AND MSVCP90.dll http://sourceforge.net/projects/py2exe/files/py2exe/0.6.9/ http://sourceforge.net/projects/pywin32/files/pywin32/Build216/ MSVS is setup to create a standalone .exe of Armory if it finds py2exe (otherwise it bails at the last build-step, but you can still manually run ArmoryQt.py as long as the SWIG dir is in the right place, and all packages are installed). pywin32 is needed to During the last compilation step, you might observe an error about not finding 'python'. For whatever reason, python doesn't add itself to your PATH environment variable. You'll have to add ";C:\Python27\" or ";C:\Python26" to your path depending on which version you're using. Do this through control panel, search for "environment" and then edit the path and append the appropriate string. Reboot